From e7b5146c5cff3c0fa1394bc68e20f8a5aaaea529 Mon Sep 17 00:00:00 2001
From: Johannes Ring <johannr@simula.no>
Date: Mon, 11 Aug 2014 08:57:36 +0100
Subject: [PATCH] Import dolfin_1.4.0+dfsg.orig.tar.gz

[dgit import orig dolfin_1.4.0+dfsg.orig.tar.gz]
---
 .gitignore                                    |   109 +
 .mailmap                                      |    34 +
 AUTHORS                                       |    74 +
 CMakeLists.txt                                |  1048 +
 COPYING                                       |   674 +
 COPYING.LESSER                                |   165 +
 ChangeLog                                     |  1296 +
 INSTALL                                       |    80 +
 README.rst                                    |    61 +
 bench/CMakeLists.txt                          |    33 +
 bench/README                                  |    23 +
 bench/bench.py                                |   110 +
 bench/common/progress/cpp/CMakeLists.txt      |    40 +
 bench/common/progress/cpp/main.cpp            |    46 +
 bench/common/timing/cpp/CMakeLists.txt        |    40 +
 bench/common/timing/cpp/main.cpp              |    58 +
 bench/fem/assembly/cpp/CMakeLists.txt         |    40 +
 bench/fem/assembly/cpp/forms.h                |    99 +
 bench/fem/assembly/cpp/forms/Elasticity3D.h   |  5519 ++
 bench/fem/assembly/cpp/forms/Elasticity3D.ufl |    18 +
 bench/fem/assembly/cpp/forms/NSEMomentum3D.h  |  7643 +++
 .../fem/assembly/cpp/forms/NSEMomentum3D.ufl  |    18 +
 bench/fem/assembly/cpp/forms/Poisson2DP1.h    |  1682 +
 bench/fem/assembly/cpp/forms/Poisson2DP1.ufl  |     6 +
 bench/fem/assembly/cpp/forms/Poisson2DP2.h    |  2428 +
 bench/fem/assembly/cpp/forms/Poisson2DP2.ufl  |     6 +
 bench/fem/assembly/cpp/forms/Poisson2DP3.h    |  3632 +
 bench/fem/assembly/cpp/forms/Poisson2DP3.ufl  |     6 +
 bench/fem/assembly/cpp/forms/StabStokes2D.h   |  5995 ++
 bench/fem/assembly/cpp/forms/StabStokes2D.ufl |    11 +
 bench/fem/assembly/cpp/forms/THStokes2D.h     | 10562 +++
 bench/fem/assembly/cpp/forms/THStokes2D.ufl   |     8 +
 bench/fem/assembly/cpp/forms/compile.log      |  3904 ++
 bench/fem/assembly/cpp/main.cpp               |   172 +
 bench/fem/assembly/python/broken              |    97 +
 bench/fem/convergence/cpp/CMakeLists.txt      |    40 +
 bench/fem/convergence/cpp/Poisson2D_1.cpp     |  1602 +
 bench/fem/convergence/cpp/Poisson2D_1.h       |   985 +
 bench/fem/convergence/cpp/Poisson2D_1.ufl     |    30 +
 bench/fem/convergence/cpp/Poisson2D_2.cpp     |  2354 +
 bench/fem/convergence/cpp/Poisson2D_2.h       |   985 +
 bench/fem/convergence/cpp/Poisson2D_2.ufl     |    30 +
 bench/fem/convergence/cpp/Poisson2D_3.cpp     |  3566 +
 bench/fem/convergence/cpp/Poisson2D_3.h       |   985 +
 bench/fem/convergence/cpp/Poisson2D_3.ufl     |    30 +
 bench/fem/convergence/cpp/Poisson2D_4.cpp     |  5479 ++
 bench/fem/convergence/cpp/Poisson2D_4.h       |   985 +
 bench/fem/convergence/cpp/Poisson2D_4.ufl     |    30 +
 bench/fem/convergence/cpp/Poisson2D_5.cpp     |  1805 +
 bench/fem/convergence/cpp/Poisson2D_5.h       |   987 +
 bench/fem/convergence/cpp/Poisson2D_5.ufl     |    30 +
 bench/fem/convergence/cpp/Poisson3D_1.cpp     |  1973 +
 bench/fem/convergence/cpp/Poisson3D_1.h       |   985 +
 bench/fem/convergence/cpp/Poisson3D_1.ufl     |    30 +
 bench/fem/convergence/cpp/Poisson3D_2.cpp     |  3972 ++
 bench/fem/convergence/cpp/Poisson3D_2.h       |   985 +
 bench/fem/convergence/cpp/Poisson3D_2.ufl     |    30 +
 bench/fem/convergence/cpp/Poisson3D_3.cpp     |  8813 +++
 bench/fem/convergence/cpp/Poisson3D_3.h       |   985 +
 bench/fem/convergence/cpp/Poisson3D_3.ufl     |    30 +
 bench/fem/convergence/cpp/Poisson3D_4.cpp     |  3054 +
 bench/fem/convergence/cpp/Poisson3D_4.h       |   987 +
 bench/fem/convergence/cpp/Poisson3D_4.ufl     |    30 +
 bench/fem/convergence/cpp/README              |    46 +
 bench/fem/convergence/cpp/compile.log         |  2641 +
 bench/fem/convergence/cpp/main.cpp            |   266 +
 bench/fem/jit/python/bench_fem_jit_python     |    76 +
 bench/fem/multicore/cpp/CMakeLists.txt        |    40 +
 bench/fem/multicore/cpp/NavierStokes.h        |  6836 ++
 bench/fem/multicore/cpp/NavierStokes.ufl      |    16 +
 bench/fem/multicore/cpp/Poisson.h             |  2051 +
 bench/fem/multicore/cpp/Poisson.ufl           |     8 +
 bench/fem/multicore/cpp/compile.log           |  1409 +
 bench/fem/multicore/cpp/main.cpp              |   184 +
 bench/fem/speedup/cpp/CMakeLists.txt          |    42 +
 bench/fem/speedup/cpp/Poisson.h               |  2584 +
 bench/fem/speedup/cpp/Poisson.ufl             |    31 +
 bench/fem/speedup/cpp/README                  |    16 +
 bench/fem/speedup/cpp/analyse-bench           |    90 +
 bench/fem/speedup/cpp/assemble-poisson.cpp    |    72 +
 bench/fem/speedup/cpp/bench_fem_speedup_cpp   |    73 +
 bench/fem/speedup/cpp/clean.sh                |     5 +
 bench/fem/speedup/cpp/compile.log             |   202 +
 bench/fem/speedup/cpp/solve-poisson.cpp       |   119 +
 bench/fem/speedup/cpp/submit-bench            |    62 +
 bench/function/evaluation/cpp/CMakeLists.txt  |    40 +
 bench/function/evaluation/cpp/P1.h            |  1624 +
 bench/function/evaluation/cpp/P1.ufl          |    27 +
 bench/function/evaluation/cpp/compile.log     |   128 +
 bench/function/evaluation/cpp/main.cpp        |    92 +
 .../bench_function_extrapolation_python       |    43 +
 .../bench_function_interpolation_python       |    52 +
 .../cpp/CMakeLists.txt                        |    40 +
 .../bounding_box_tree_build/cpp/main.cpp      |    43 +
 .../cpp/CMakeLists.txt                        |    40 +
 .../cpp/main.cpp                              |    56 +
 .../cpp/CMakeLists.txt                        |    40 +
 .../cpp/main.cpp                              |    57 +
 bench/la/cusp/python/bench_la_cusp_python     |    90 +
 bench/la/vector/access/cpp/CMakeLists.txt     |    40 +
 bench/la/vector/access/cpp/main.cpp           |    47 +
 bench/la/vector/assignment/cpp/CMakeLists.txt |    40 +
 bench/la/vector/assignment/cpp/main.cpp       |    44 +
 bench/logs/bench.log                          |   151 +
 bench/logs/milestones.log                     |    14 +
 bench/mesh/iteration/cpp/CMakeLists.txt       |    40 +
 bench/mesh/iteration/cpp/main.cpp             |    51 +
 bench/mesh/refinement/cpp/CMakeLists.txt      |    40 +
 bench/mesh/refinement/cpp/main.cpp            |    47 +
 bench/mesh/topology/cpp/CMakeLists.txt        |    40 +
 bench/mesh/topology/cpp/main.cpp              |    55 +
 bench/mesh/unitcube/cpp/CMakeLists.txt        |    40 +
 bench/mesh/unitcube/cpp/main.cpp              |    42 +
 bench/plot.py                                 |   230 +
 cmake/modules/CheckOpenMP.cmake               |    55 +
 cmake/modules/CorrectWindowsPaths.cmake       |    14 +
 cmake/modules/FindAMD.cmake                   |    62 +
 cmake/modules/FindBLAS.cmake                  |   629 +
 cmake/modules/FindBLASHeader.cmake            |    50 +
 cmake/modules/FindCGAL.cmake                  |   132 +
 cmake/modules/FindCHOLMOD.cmake               |   230 +
 cmake/modules/FindCppUnit.cmake               |    69 +
 cmake/modules/FindEigen3.cmake                |    87 +
 cmake/modules/FindGMP.cmake                   |    87 +
 cmake/modules/FindLAPACK.cmake                |   350 +
 cmake/modules/FindMPI.cmake                   |   660 +
 cmake/modules/FindMTL4.cmake                  |    88 +
 cmake/modules/FindNumPy.cmake                 |    80 +
 cmake/modules/FindPETSc.cmake                 |   363 +
 cmake/modules/FindPETSc4py.cmake              |    82 +
 cmake/modules/FindPaStiX.cmake                |   159 +
 cmake/modules/FindParMETIS.cmake              |   153 +
 cmake/modules/FindSCOTCH.cmake                |   324 +
 cmake/modules/FindSLEPc.cmake                 |   270 +
 cmake/modules/FindSphinx.cmake                |    78 +
 cmake/modules/FindUMFPACK.cmake               |   132 +
 cmake/modules/ResolveCompilerPaths.cmake      |   111 +
 cmake/modules/language_support_v2.cmake       |    65 +
 cmake/post-install/CMakeLists.txt             |    22 +
 cmake/scripts/codeexamples.py                 |   217 +
 cmake/scripts/codesnippets.py                 |   143 +
 cmake/scripts/copy-swig-files                 |    59 +
 cmake/scripts/copy-test-demo-data             |    71 +
 cmake/scripts/download-demo-data              |    70 +
 cmake/scripts/generate-all                    |    20 +
 cmake/scripts/generate-cmakefiles             |   179 +
 cmake/scripts/generate-form-files             |    81 +
 cmake/scripts/generate-swig-docstrings        |   460 +
 cmake/scripts/generate-swig-interface         |   591 +
 cmake/templates/DOLFINConfig.cmake.in         |    53 +
 cmake/templates/DOLFINConfigVersion.cmake.in  |    16 +
 cmake/templates/UseDOLFIN.cmake.in            |    26 +
 cmake/templates/cmake_uninstall.cmake.in      |    21 +
 .../templates/dolfin-config-version.cmake.in  |    16 +
 cmake/templates/dolfin-config.cmake.in        |    56 +
 cmake/templates/dolfin-get-demos.in           |    34 +
 cmake/templates/dolfin-version.in             |     4 +
 cmake/templates/dolfin.conf.in                |    12 +
 cmake/templates/dolfin.pc.in                  |    17 +
 data/README                                   |     6 +
 demo/CMakeLists.txt                           |    32 +
 demo/cmake.local                              |    19 +
 .../auto-adaptive-poisson/common.txt          |   138 +
 .../cpp/AdaptivePoisson.h                     | 15101 +++++
 .../cpp/AdaptivePoisson.ufl                   |    32 +
 .../auto-adaptive-poisson/cpp/CMakeLists.txt  |    40 +
 .../auto-adaptive-poisson/cpp/compile.log     |  3326 +
 .../cpp/documentation.rst                     |     6 +
 .../auto-adaptive-poisson/cpp/main.cpp        |    99 +
 .../python/demo_auto-adaptive_poisson.py      |    64 +
 .../python/documentation.rst                  |   151 +
 .../auto-adaptive-poisson/u_refined.png       |   Bin 0 -> 39800 bytes
 .../auto-adaptive-poisson/u_unrefined.png     |   Bin 0 -> 31880 bytes
 demo/documented/bcs/aneurysm.xml.gz           |   Bin 0 -> 703208 bytes
 demo/documented/bcs/common.txt                |    55 +
 demo/documented/bcs/cpp/CMakeLists.txt        |    40 +
 demo/documented/bcs/cpp/Poisson.h             |  2584 +
 demo/documented/bcs/cpp/Poisson.ufl           |    33 +
 demo/documented/bcs/cpp/compile.log           |   202 +
 demo/documented/bcs/cpp/documentation.rst     |     6 +
 demo/documented/bcs/cpp/main.cpp              |    75 +
 demo/documented/bcs/demo_bcs.png              |   Bin 0 -> 62820 bytes
 demo/documented/bcs/python/demo_bcs.py        |    66 +
 demo/documented/bcs/python/documentation.rst  |   103 +
 demo/documented/biharmonic/biharmonic_u.png   |   Bin 0 -> 35721 bytes
 demo/documented/biharmonic/common.txt         |    83 +
 demo/documented/biharmonic/cpp/Biharmonic.h   |  6644 ++
 demo/documented/biharmonic/cpp/Biharmonic.ufl |    50 +
 demo/documented/biharmonic/cpp/CMakeLists.txt |    40 +
 demo/documented/biharmonic/cpp/compile.log    |  1262 +
 .../biharmonic/cpp/documentation.rst          |   211 +
 demo/documented/biharmonic/cpp/main.cpp       |   100 +
 .../biharmonic/python/demo_biharmonic.py      |    95 +
 .../biharmonic/python/documentation.rst       |   138 +
 demo/documented/built-in_meshes/common.txt    |    16 +
 .../built-in_meshes/cpp/CMakeLists.txt        |    40 +
 .../built-in_meshes/cpp/documentation.rst     |     6 +
 demo/documented/built-in_meshes/cpp/main.cpp  |    94 +
 .../built-in_meshes/python/boxmesh.png        |   Bin 0 -> 7418 bytes
 .../built-in_meshes/python/demo_built-in.py   |    82 +
 .../built-in_meshes/python/documentation.rst  |   201 +
 .../built-in_meshes/python/rectanglemesh.png  |   Bin 0 -> 3535 bytes
 .../python/rectanglemesh_left_right.png       |   Bin 0 -> 4891 bytes
 .../built-in_meshes/python/unitcubemesh.png   |   Bin 0 -> 12548 bytes
 .../python/unitintervalmesh.png               |   Bin 0 -> 1606 bytes
 .../built-in_meshes/python/unitsquaremesh.png |   Bin 0 -> 4982 bytes
 .../python/unitsquaremesh_crossed.png         |   Bin 0 -> 7111 bytes
 .../python/unitsquaremesh_left.png            |   Bin 0 -> 4985 bytes
 .../python/unitsquaremesh_left_right.png      |   Bin 0 -> 5900 bytes
 .../cahn-hilliard/cahn-hilliard_c.png         |   Bin 0 -> 93097 bytes
 demo/documented/cahn-hilliard/common.txt      |    94 +
 .../cahn-hilliard/cpp/CMakeLists.txt          |    40 +
 .../cahn-hilliard/cpp/CahnHilliard2D.cpp      |  4035 ++
 .../cahn-hilliard/cpp/CahnHilliard2D.h        |  1842 +
 .../cahn-hilliard/cpp/CahnHilliard2D.ufl      |    58 +
 .../cahn-hilliard/cpp/CahnHilliard3D.cpp      |  5195 ++
 .../cahn-hilliard/cpp/CahnHilliard3D.h        |  1842 +
 .../cahn-hilliard/cpp/CahnHilliard3D.ufl      |    56 +
 demo/documented/cahn-hilliard/cpp/compile.log |  7060 ++
 .../cahn-hilliard/cpp/documentation.rst       |   411 +
 demo/documented/cahn-hilliard/cpp/main.cpp    |   193 +
 .../python/demo_cahn-hilliard.py              |   119 +
 .../cahn-hilliard/python/documentation.rst    |   301 +
 demo/documented/csg-2D/common.txt             |    21 +
 demo/documented/csg-2D/cpp/CMakeLists.txt     |    40 +
 demo/documented/csg-2D/cpp/documentation.rst  |     6 +
 demo/documented/csg-2D/cpp/main.cpp           |    76 +
 demo/documented/csg-2D/csg_boundary.png       |   Bin 0 -> 3944 bytes
 demo/documented/csg-2D/csg_mesh.png           |   Bin 0 -> 16162 bytes
 demo/documented/csg-2D/python/demo_csg_2D.py  |    54 +
 .../csg-2D/python/documentation.rst           |   104 +
 demo/documented/csg-3D/common.txt             |    21 +
 demo/documented/csg-3D/cpp/CMakeLists.txt     |    40 +
 demo/documented/csg-3D/cpp/documentation.rst  |     6 +
 demo/documented/csg-3D/cpp/main.cpp           |    61 +
 demo/documented/csg-3D/csg3D_boundary.png     |   Bin 0 -> 20438 bytes
 demo/documented/csg-3D/csg3D_mesh.png         |   Bin 0 -> 45855 bytes
 demo/documented/csg-3D/python/demo_csg-3D.py  |    50 +
 .../csg-3D/python/documentation.rst           |   112 +
 .../eigenvalue/box_with_dent.xml.gz           |   Bin 0 -> 8836 bytes
 demo/documented/eigenvalue/common.txt         |    40 +
 demo/documented/eigenvalue/cpp/CMakeLists.txt |    40 +
 .../eigenvalue/cpp/StiffnessMatrix.h          |  2051 +
 .../eigenvalue/cpp/StiffnessMatrix.ufl        |    28 +
 demo/documented/eigenvalue/cpp/compile.log    |   165 +
 .../eigenvalue/cpp/documentation.rst          |     3 +
 demo/documented/eigenvalue/cpp/main.cpp       |    72 +
 demo/documented/eigenvalue/eigenvalue_x.png   |   Bin 0 -> 41085 bytes
 .../eigenvalue/python/demo_eigenvalue.py      |    73 +
 .../eigenvalue/python/documentation.rst       |   125 +
 demo/documented/hyperelasticity/common.txt    |   140 +
 .../hyperelasticity/cpp/CMakeLists.txt        |    40 +
 .../hyperelasticity/cpp/HyperElasticity.h     |  7158 ++
 .../hyperelasticity/cpp/HyperElasticity.ufl   |    64 +
 .../hyperelasticity/cpp/compile.log           |  1487 +
 .../hyperelasticity/cpp/documentation.rst     |   329 +
 demo/documented/hyperelasticity/cpp/main.cpp  |   149 +
 .../hyperelasticity/hyperelasticity_u0.png    |   Bin 0 -> 40841 bytes
 .../hyperelasticity/hyperelasticity_u1.png    |   Bin 0 -> 42794 bytes
 .../python/demo_hyperelasticity.py            |    99 +
 .../hyperelasticity/python/documentation.rst  |   218 +
 demo/documented/mesh-generation/common.txt    |    14 +
 demo/documented/mesh-generation/cpp/README    |     2 +
 .../mesh-generation/cpp/documentation.rst     |     6 +
 demo/documented/mesh-generation/cube.off      |    16 +
 .../python/demo_mesh_generation.py            |    57 +
 .../mesh-generation/python/documentation.rst  |   141 +
 .../mesh-generation/python/plot_cubemesh.png  |   Bin 0 -> 39015 bytes
 .../python/plot_polygonmesh.png               |   Bin 0 -> 15635 bytes
 .../python/plot_tetrahedronmesh.png           |   Bin 0 -> 21616 bytes
 .../mesh-generation/tetrahedron.off           |    12 +
 demo/documented/mixed-poisson-dual/common.txt |    75 +
 .../mixed-poisson-dual/cpp/CMakeLists.txt     |    40 +
 .../mixed-poisson-dual/cpp/MixedPoissonDual.h | 13248 ++++
 .../cpp/MixedPoissonDual.ufl                  |    38 +
 .../mixed-poisson-dual/cpp/compile.log        |   750 +
 .../mixed-poisson-dual/cpp/documentation.rst  |   213 +
 .../mixed-poisson-dual/cpp/main.cpp           |    87 +
 .../mixed-poisson-dual_sigma.png              |   Bin 0 -> 31670 bytes
 .../mixed-poisson-dual_u.png                  |   Bin 0 -> 39242 bytes
 .../python/demo_mixed-poisson-dual.py         |    78 +
 .../python/documentation.rst                  |   150 +
 demo/documented/mixed-poisson/common.txt      |    99 +
 .../mixed-poisson/cpp/CMakeLists.txt          |    40 +
 .../mixed-poisson/cpp/MixedPoisson.h          |  6759 ++
 .../mixed-poisson/cpp/MixedPoisson.ufl        |    37 +
 demo/documented/mixed-poisson/cpp/compile.log |   493 +
 .../mixed-poisson/cpp/documentation.rst       |   240 +
 demo/documented/mixed-poisson/cpp/main.cpp    |   108 +
 .../mixed-poisson/mixed-poisson_sigma.png     |   Bin 0 -> 78506 bytes
 .../mixed-poisson/mixed-poisson_u.png         |   Bin 0 -> 34205 bytes
 .../python/demo_mixed-poisson.py              |    94 +
 .../mixed-poisson/python/documentation.rst    |   184 +
 demo/documented/navier-stokes/common.txt      |    91 +
 .../navier-stokes/cpp/CMakeLists.txt          |    40 +
 .../navier-stokes/cpp/PressureUpdate.h        |  7858 +++
 .../navier-stokes/cpp/PressureUpdate.ufl      |    41 +
 .../navier-stokes/cpp/TentativeVelocity.h     |  7029 ++
 .../navier-stokes/cpp/TentativeVelocity.ufl   |    45 +
 .../navier-stokes/cpp/VelocityUpdate.h        |  8040 +++
 .../navier-stokes/cpp/VelocityUpdate.ufl      |    42 +
 demo/documented/navier-stokes/cpp/compile.log |  3024 +
 .../navier-stokes/cpp/documentation.rst       |   449 +
 demo/documented/navier-stokes/cpp/main.cpp    |   196 +
 demo/documented/navier-stokes/lshape.xml.gz   |   Bin 0 -> 3420 bytes
 .../navier-stokes/navier-stokes_p.png         |   Bin 0 -> 28878 bytes
 .../navier-stokes/navier-stokes_u.png         |   Bin 0 -> 60472 bytes
 .../python/demo_navier-stokes.py              |   141 +
 .../navier-stokes/python/documentation.rst    |   240 +
 demo/documented/neumann-poisson/common.txt    |    99 +
 .../neumann-poisson/cpp/CMakeLists.txt        |    40 +
 demo/documented/neumann-poisson/cpp/Poisson.h |  4254 ++
 .../neumann-poisson/cpp/Poisson.ufl           |    36 +
 .../neumann-poisson/cpp/compile.log           |   346 +
 .../neumann-poisson/cpp/documentation.rst     |     6 +
 demo/documented/neumann-poisson/cpp/main.cpp  |    98 +
 .../neumann-poisson/neumann-poisson_u.png     |   Bin 0 -> 42812 bytes
 .../python/demo_neumann-poisson.py            |    70 +
 .../neumann-poisson/python/documentation.rst  |   115 +
 demo/documented/nonlinear-poisson/common.txt  |    83 +
 .../nonlinear-poisson/cpp/CMakeLists.txt      |    40 +
 .../nonlinear-poisson/cpp/NonlinearPoisson.h  |  2550 +
 .../cpp/NonlinearPoisson.ufl                  |    35 +
 .../nonlinear-poisson/cpp/compile.log         |   494 +
 .../nonlinear-poisson/cpp/documentation.rst   |     6 +
 .../documented/nonlinear-poisson/cpp/main.cpp |   115 +
 demo/documented/nonlinear-poisson/cpp/plot.py |    10 +
 demo/documented/nonlinear-poisson/plot_u.png  |   Bin 0 -> 25785 bytes
 .../nonlinear-poisson/plot_u_gradient.png     |   Bin 0 -> 34141 bytes
 .../python/demo_nonlinear-poisson.py          |    84 +
 .../python/documentation.rst                  |   164 +
 demo/documented/periodic/common.txt           |    50 +
 demo/documented/periodic/cpp/CMakeLists.txt   |    40 +
 demo/documented/periodic/cpp/Poisson.h        |  2213 +
 demo/documented/periodic/cpp/Poisson.ufl      |    33 +
 demo/documented/periodic/cpp/compile.log      |   170 +
 .../documented/periodic/cpp/documentation.rst |     6 +
 demo/documented/periodic/cpp/main.cpp         |   133 +
 demo/documented/periodic/plot_u.png           |   Bin 0 -> 58379 bytes
 .../periodic/python/demo_periodic.py          |    89 +
 .../periodic/python/documentation.rst         |   174 +
 demo/documented/poisson/common.txt            |    54 +
 demo/documented/poisson/cpp/CMakeLists.txt    |    40 +
 demo/documented/poisson/cpp/Poisson.h         |  2403 +
 demo/documented/poisson/cpp/Poisson.ufl       |    34 +
 demo/documented/poisson/cpp/compile.log       |   213 +
 demo/documented/poisson/cpp/documentation.rst |   225 +
 demo/documented/poisson/cpp/main.cpp          |   101 +
 demo/documented/poisson/poisson_u.png         |   Bin 0 -> 35484 bytes
 .../documented/poisson/python/demo_poisson.py |    68 +
 .../poisson/python/documentation.rst          |   157 +
 demo/documented/singular-poisson/common.txt   |    78 +
 .../singular-poisson/cpp/CMakeLists.txt       |    40 +
 .../documented/singular-poisson/cpp/Poisson.h |  2403 +
 .../singular-poisson/cpp/Poisson.ufl          |    33 +
 .../singular-poisson/cpp/compile.log          |   213 +
 .../singular-poisson/cpp/documentation.rst    |     6 +
 demo/documented/singular-poisson/cpp/main.cpp |   126 +
 .../python/demo_singular-poisson.py           |    93 +
 .../singular-poisson/python/documentation.rst |   161 +
 .../singular-poisson/singular_u.png           |   Bin 0 -> 45179 bytes
 demo/documented/stokes-iterative/common.txt   |    85 +
 .../stokes-iterative/cpp/CMakeLists.txt       |    40 +
 demo/documented/stokes-iterative/cpp/Stokes.h | 25833 +++++++
 .../stokes-iterative/cpp/Stokes.ufl           |    37 +
 .../cpp/StokesPreconditioner.h                | 25227 +++++++
 .../cpp/StokesPreconditioner.ufl              |    35 +
 .../stokes-iterative/cpp/compile.log          |  2677 +
 .../stokes-iterative/cpp/documentation.rst    |     6 +
 demo/documented/stokes-iterative/cpp/main.cpp |   184 +
 .../python/demo_stokes-iterative.py           |   114 +
 .../stokes-iterative/python/documentation.rst |   211 +
 demo/documented/stokes-mini/common.txt        |    71 +
 demo/documented/stokes-mini/cpp/README        |     2 +
 .../stokes-mini/cpp/documentation.rst         |     6 +
 .../documented/stokes-mini/dolfin_fine.xml.gz |   Bin 0 -> 88283 bytes
 .../stokes-mini/dolfin_fine_subdomains.xml.gz |   Bin 0 -> 42459 bytes
 demo/documented/stokes-mini/plot_p.png        |   Bin 0 -> 56331 bytes
 demo/documented/stokes-mini/plot_u.png        |   Bin 0 -> 60770 bytes
 .../stokes-mini/python/demo_stokes-mini.py    |    87 +
 .../stokes-mini/python/documentation.rst      |   165 +
 demo/documented/stokes-stabilized/common.txt  |    84 +
 .../stokes-stabilized/cpp/CMakeLists.txt      |    40 +
 .../documented/stokes-stabilized/cpp/Stokes.h |  6386 ++
 .../stokes-stabilized/cpp/Stokes.ufl          |    40 +
 .../stokes-stabilized/cpp/compile.log         |   941 +
 .../stokes-stabilized/cpp/documentation.rst   |     6 +
 .../documented/stokes-stabilized/cpp/main.cpp |   120 +
 demo/documented/stokes-stabilized/cpp/plot.py |     9 +
 .../stokes-stabilized/dolfin_fine.xml.gz      |   Bin 0 -> 88283 bytes
 .../dolfin_fine_subdomains.xml.gz             |   Bin 0 -> 42459 bytes
 demo/documented/stokes-stabilized/plot_p.png  |   Bin 0 -> 49829 bytes
 demo/documented/stokes-stabilized/plot_u.png  |   Bin 0 -> 94743 bytes
 .../python/demo_stokes-stabilized.py          |    85 +
 .../python/documentation.rst                  |   136 +
 demo/documented/stokes-taylor-hood/common.txt |    79 +
 .../stokes-taylor-hood/cpp/CMakeLists.txt     |    40 +
 .../stokes-taylor-hood/cpp/Stokes.h           | 11114 ++++
 .../stokes-taylor-hood/cpp/Stokes.ufl         |    36 +
 .../stokes-taylor-hood/cpp/compile.log        |   738 +
 .../stokes-taylor-hood/cpp/documentation.rst  |     6 +
 .../stokes-taylor-hood/cpp/main.cpp           |   118 +
 .../documented/stokes-taylor-hood/cpp/plot.py |     9 +
 .../stokes-taylor-hood/dolfin_fine.xml.gz     |   Bin 0 -> 88283 bytes
 .../dolfin_fine_subdomains.xml.gz             |   Bin 0 -> 42459 bytes
 .../stokes-taylor-hood/plot_mesh.png          |   Bin 0 -> 35671 bytes
 .../plot_mesh_boundaries.png                  |   Bin 0 -> 52672 bytes
 demo/documented/stokes-taylor-hood/plot_p.png |   Bin 0 -> 45135 bytes
 demo/documented/stokes-taylor-hood/plot_u.png |   Bin 0 -> 95531 bytes
 .../python/demo_stokes-taylorhood.py          |    92 +
 .../python/documentation.rst                  |   162 +
 demo/documented/subdomains-poisson/common.txt |    53 +
 demo/documented/subdomains-poisson/cpp/README |     2 +
 .../subdomains-poisson/cpp/documentation.rst  |     6 +
 .../python/demo_subdomains-poisson.py         |   117 +
 .../python/documentation.rst                  |   240 +
 demo/documented/subdomains/common.txt         |    29 +
 demo/documented/subdomains/cpp/CMakeLists.txt |    40 +
 .../subdomains/cpp/documentation.rst          |     6 +
 demo/documented/subdomains/cpp/main.cpp       |   101 +
 demo/documented/subdomains/dolfin_fine.xml.gz |   Bin 0 -> 88283 bytes
 .../documented/subdomains/plot_subdomains.png |   Bin 0 -> 27143 bytes
 .../subdomains/python/demo_subdomains.py      |    96 +
 .../subdomains/python/documentation.rst       |   165 +
 .../tensor-weighted-poisson/common.txt        |    70 +
 .../tensor-weighted-poisson/cpp/README        |     2 +
 .../cpp/documentation.rst                     |     6 +
 .../python/demo_tensorweighted-poisson.py     |   120 +
 .../python/documentation.rst                  |   302 +
 .../python/generate_data.py                   |    62 +
 .../tensorweighted-poisson_u.png              |   Bin 0 -> 59610 bytes
 .../unitsquare_32_32.xml.gz                   |   Bin 0 -> 21613 bytes
 .../unitsquare_32_32_c00.xml.gz               |   Bin 0 -> 6551 bytes
 .../unitsquare_32_32_c01.xml.gz               |   Bin 0 -> 6570 bytes
 .../unitsquare_32_32_c11.xml.gz               |   Bin 0 -> 6548 bytes
 .../adaptive-poisson/cpp/CMakeLists.txt       |    39 +
 demo/undocumented/adaptive-poisson/cpp/README |     2 +
 .../python/demo_adaptive-poisson.py           |   104 +
 .../cpp/AdvectionDiffusion.h                  |  7538 +++
 .../cpp/AdvectionDiffusion.ufl                |    40 +
 .../advection-diffusion/cpp/CMakeLists.txt    |    40 +
 .../advection-diffusion/cpp/Velocity.h        |  5113 ++
 .../advection-diffusion/cpp/Velocity.ufl      |    25 +
 .../advection-diffusion/cpp/compile.log       |   741 +
 .../advection-diffusion/cpp/main.cpp          |   113 +
 .../advection-diffusion/dolfin_fine.xml.gz    |   Bin 0 -> 88283 bytes
 .../dolfin_fine_subdomains.xml.gz             |   Bin 0 -> 42459 bytes
 .../dolfin_fine_velocity.xml.gz               |   Bin 0 -> 375382 bytes
 .../python/demo_advection-diffusion.py        |   127 +
 demo/undocumented/ale/cpp/CMakeLists.txt      |    40 +
 demo/undocumented/ale/cpp/main.cpp            |    60 +
 demo/undocumented/ale/python/demo_ale.py      |    46 +
 .../channel_with_flap.xml.gz                  |   Bin 0 -> 10417 bytes
 .../cpp/AdaptiveNavierStokes.h                | 55496 ++++++++++++++++
 .../cpp/AdaptiveNavierStokes.ufl              |    51 +
 .../cpp/CMakeLists.txt                        |    40 +
 .../cpp/compile.log                           | 21902 ++++++
 .../auto-adaptive-navier-stokes/cpp/main.cpp  |   130 +
 .../demo_auto-adaptive-navier-stokes.py       |   115 +
 .../block-matrix/cpp/CMakeLists.txt           |    40 +
 .../block-matrix/cpp/StiffnessMatrix.h        |  2121 +
 .../block-matrix/cpp/StiffnessMatrix.ufl      |    31 +
 .../undocumented/block-matrix/cpp/compile.log |   356 +
 demo/undocumented/block-matrix/cpp/main.cpp   |    69 +
 .../block-matrix/python/demo_block-matrix.py  |    59 +
 demo/undocumented/built-in/cpp/CMakeLists.txt |    40 +
 demo/undocumented/built-in/cpp/main.cpp       |    74 +
 .../built-in/python/demo_built-in.py          |    69 +
 .../python/demo_collision-detection.py        |    98 +
 demo/undocumented/coloring/cpp/CMakeLists.txt |    40 +
 demo/undocumented/coloring/cpp/main.cpp       |    66 +
 .../coloring/python/demo_coloring.py          |    52 +
 .../compiled-extension-module/cpp/README      |     2 +
 .../python/Probe/Probe.cpp                    |   138 +
 .../python/Probe/Probe.h                      |    85 +
 .../python/demo_compiled-extension-module.py  |    42 +
 .../conditional/cpp/CMakeLists.txt            |    40 +
 .../conditional/cpp/Conditional.h             |  2876 +
 .../conditional/cpp/Conditional.ufl           |    44 +
 demo/undocumented/conditional/cpp/compile.log |   330 +
 demo/undocumented/conditional/cpp/main.cpp    |    76 +
 .../conditional/python/demo_conditional.py    |    77 +
 .../contact-vi-snes/circle_yplane.geo         |    15 +
 .../contact-vi-snes/circle_yplane.xml.gz      |   Bin 0 -> 73289 bytes
 .../contact-vi-snes/cpp/CMakeLists.txt        |    40 +
 .../contact-vi-snes/cpp/HyperElasticity.h     |  4932 ++
 .../contact-vi-snes/cpp/HyperElasticity.ufl   |    62 +
 .../contact-vi-snes/cpp/compile.log           |   537 +
 .../undocumented/contact-vi-snes/cpp/main.cpp |   152 +
 .../python/demo_contact-vi-snes.py            |   116 +
 .../contact-vi-tao/circle_yplane.xml.gz       |   Bin 0 -> 73289 bytes
 .../contact-vi-tao/cpp/CMakeLists.txt         |    40 +
 .../contact-vi-tao/cpp/Elasticity.h           |  4739 ++
 .../contact-vi-tao/cpp/Elasticity.ufl         |    45 +
 .../contact-vi-tao/cpp/compile.log            |   425 +
 demo/undocumented/contact-vi-tao/cpp/main.cpp |   133 +
 .../python/demo_contact-vi-tao.py             |   104 +
 .../undocumented/curl-curl/cpp/CMakeLists.txt |    40 +
 .../curl-curl/cpp/CurrentDensity.h            |  8256 +++
 .../curl-curl/cpp/CurrentDensity.ufl          |    34 +
 .../undocumented/curl-curl/cpp/EddyCurrents.h |  8168 +++
 .../curl-curl/cpp/EddyCurrents.ufl            |    34 +
 demo/undocumented/curl-curl/cpp/compile.log   |  1673 +
 demo/undocumented/curl-curl/cpp/main.cpp      |   135 +
 .../curl-curl/python/demo_curl-curl.py        |    89 +
 .../cpp/AdvectionDiffusion.h                  |  9504 +++
 .../cpp/AdvectionDiffusion.ufl                |    58 +
 .../dg-advection-diffusion/cpp/CMakeLists.txt |    40 +
 .../dg-advection-diffusion/cpp/Projection.h   |  3325 +
 .../dg-advection-diffusion/cpp/Projection.ufl |    32 +
 .../dg-advection-diffusion/cpp/Velocity.h     |  5113 ++
 .../dg-advection-diffusion/cpp/Velocity.ufl   |    26 +
 .../dg-advection-diffusion/cpp/compile.log    |  2743 +
 .../dg-advection-diffusion/cpp/main.cpp       |   120 +
 .../python/demo_dg-advection-diffusion.py     |   101 +
 .../unitsquare_64_64.xml.gz                   |   Bin 0 -> 84425 bytes
 .../unitsquare_64_64_velocity.xml.gz          |   Bin 0 -> 205780 bytes
 .../dg-poisson/cpp/CMakeLists.txt             |    40 +
 demo/undocumented/dg-poisson/cpp/Poisson.h    |  4032 ++
 demo/undocumented/dg-poisson/cpp/Poisson.ufl  |    55 +
 demo/undocumented/dg-poisson/cpp/compile.log  |  1558 +
 demo/undocumented/dg-poisson/cpp/main.cpp     |   132 +
 demo/undocumented/dg-poisson/cpp/plot.py      |     4 +
 .../dg-poisson/python/demo_dg-poisson.py      |   103 +
 .../elasticity/cpp/CMakeLists.txt             |    40 +
 demo/undocumented/elasticity/cpp/Elasticity.h |  9652 +++
 .../elasticity/cpp/Elasticity.ufl             |    54 +
 demo/undocumented/elasticity/cpp/compile.log  |  1968 +
 demo/undocumented/elasticity/cpp/main.cpp     |   197 +
 demo/undocumented/elasticity/cpp/plot.py      |     4 +
 demo/undocumented/elasticity/gear.xml.gz      |   Bin 0 -> 500213 bytes
 .../elasticity/python/demo_elasticity.py      |   111 +
 .../elastodynamics/cpp/CMakeLists.txt         |    40 +
 .../elastodynamics/cpp/DG0_eps_xx.h           |  4411 ++
 .../elastodynamics/cpp/DG0_eps_xx.ufl         |    34 +
 .../elastodynamics/cpp/ElastoDynamics.h       |  6405 ++
 .../elastodynamics/cpp/ElastoDynamics.ufl     |    77 +
 .../elastodynamics/cpp/compile.log            |  1260 +
 demo/undocumented/elastodynamics/cpp/main.cpp |   233 +
 .../elastodynamics/dolfin_fine.xml.gz         |   Bin 0 -> 88283 bytes
 .../python/demo_elastodynamics.py             |   177 +
 .../elementplot/python/demo_elementplot.py    |    26 +
 demo/undocumented/eval/cpp/CMakeLists.txt     |    40 +
 demo/undocumented/eval/cpp/Projection.h       |  4575 ++
 demo/undocumented/eval/cpp/Projection.ufl     |    33 +
 demo/undocumented/eval/cpp/compile.log        |   242 +
 demo/undocumented/eval/cpp/main.cpp           |    76 +
 demo/undocumented/eval/python/demo_eval.py    |    52 +
 .../extrapolation/cpp/CMakeLists.txt          |    40 +
 demo/undocumented/extrapolation/cpp/P1.h      |  1267 +
 demo/undocumented/extrapolation/cpp/P1.ufl    |     1 +
 demo/undocumented/extrapolation/cpp/P2.h      |  1986 +
 demo/undocumented/extrapolation/cpp/P2.ufl    |     1 +
 .../extrapolation/cpp/compile.log             |   216 +
 demo/undocumented/extrapolation/cpp/main.cpp  |    67 +
 .../python/demo_extrapolation.py              |    42 +
 .../functional/cpp/CMakeLists.txt             |    40 +
 demo/undocumented/functional/cpp/EnergyNorm.h |  2424 +
 .../functional/cpp/EnergyNorm.ufl             |    26 +
 demo/undocumented/functional/cpp/compile.log  |   481 +
 demo/undocumented/functional/cpp/main.cpp     |    65 +
 .../functional/python/demo_functional.py      |    50 +
 .../interpolation/cpp/CMakeLists.txt          |    39 +
 demo/undocumented/interpolation/cpp/README    |     2 +
 .../python/demo_interpolation.py              |    63 +
 .../undocumented/lift-drag/cpp/CMakeLists.txt |    40 +
 demo/undocumented/lift-drag/cpp/Functionals.h |  2270 +
 .../lift-drag/cpp/Functionals.ufl             |    36 +
 demo/undocumented/lift-drag/cpp/README        |     1 +
 demo/undocumented/lift-drag/cpp/compile.log   |   539 +
 demo/undocumented/lift-drag/cpp/main.cpp      |    78 +
 .../undocumented/lift-drag/dolfin_fine.xml.gz |   Bin 0 -> 88283 bytes
 .../lift-drag/dolfin_fine_pressure.xml.gz     |   Bin 0 -> 49720 bytes
 .../lift-drag/python/demo_lift-drag.py        |    64 +
 .../mesh-quality/cpp/CMakeLists.txt           |    40 +
 demo/undocumented/mesh-quality/cpp/main.cpp   |    67 +
 .../mesh-quality/dolfin_fine.xml.gz           |   Bin 0 -> 88283 bytes
 .../mesh-quality/python/demo_mesh-quality.py  |    42 +
 .../cpp/CMakeLists.txt                        |    40 +
 .../meshfunction-refinement/cpp/main.cpp      |    75 +
 .../python/demo_mixed-poisson-sphere.py       |    76 +
 .../mixed-poisson-sphere/sphere_16.xml.gz     |   Bin 0 -> 34606 bytes
 .../undocumented/multistage-solver/cpp/README |     2 +
 .../multistage-solver/dolfin_fine.xml.gz      |   Bin 0 -> 88283 bytes
 .../dolfin_fine_subdomains.xml.gz             |   Bin 0 -> 42459 bytes
 .../dolfin_fine_velocity.xml.gz               |   Bin 0 -> 375382 bytes
 .../python/demo_multi-stage-solver.py         |   100 +
 .../cpp/CMakeLists.txt                        |    40 +
 .../nonmatching-interpolation/cpp/P1.h        |  1267 +
 .../nonmatching-interpolation/cpp/P1.ufl      |    27 +
 .../nonmatching-interpolation/cpp/P3.h        |  3126 +
 .../nonmatching-interpolation/cpp/P3.ufl      |    27 +
 .../nonmatching-interpolation/cpp/compile.log |   264 +
 .../nonmatching-interpolation/cpp/main.cpp    |    82 +
 .../python/demo_nonmatching-interpolation.py  |    46 +
 .../nonmatching-projection/cpp/CMakeLists.txt |    40 +
 .../cpp/P1_projection.h                       |  5210 ++
 .../cpp/P1_projection.ufl                     |    34 +
 .../nonmatching-projection/cpp/P3.h           |  3126 +
 .../nonmatching-projection/cpp/P3.ufl         |    27 +
 .../nonmatching-projection/cpp/compile.log    |   462 +
 .../nonmatching-projection/cpp/main.cpp       |    84 +
 .../python/demo_nonmatching-projection.py     |    51 +
 .../optimization/python/demo_optimization.py  |    98 +
 .../overlapping-regions/cpp/README            |     2 +
 .../overlapping-regions/python/README         |     2 +
 .../python/demo_overlapping-regions.py        |    75 +
 .../parallel-refinement/cpp/CMakeLists.txt    |    40 +
 .../parallel-refinement/cpp/main.cpp          |    59 +
 .../python/demo_parallel-refinement.py        |    48 +
 .../parameters/cpp/CMakeLists.txt             |    40 +
 demo/undocumented/parameters/cpp/main.cpp     |   119 +
 .../parameters/cpp/parameters.xml             |     8 +
 .../parameters/python/demo_parameters.py      |   161 +
 .../parameters/python/parameters.xml          |    14 +
 .../petsc4py/python/demo_petsc4py.py          |   101 +
 .../plot-qt/cpp/BoundaryMeshFunction.cpp      |    37 +
 .../plot-qt/cpp/BoundaryMeshFunction.h        |    48 +
 demo/undocumented/plot-qt/cpp/CMakeLists.txt  |   102 +
 demo/undocumented/plot-qt/cpp/CoordLabel.cpp  |    49 +
 demo/undocumented/plot-qt/cpp/CoordLabel.h    |    49 +
 demo/undocumented/plot-qt/cpp/PlotWidget.cpp  |    53 +
 demo/undocumented/plot-qt/cpp/PlotWidget.h    |    57 +
 demo/undocumented/plot-qt/cpp/Plotter.cpp     |   108 +
 demo/undocumented/plot-qt/cpp/Plotter.h       |    73 +
 demo/undocumented/plot-qt/cpp/main.cpp        |    96 +
 demo/undocumented/plot/cpp/CMakeLists.txt     |    40 +
 demo/undocumented/plot/cpp/main.cpp           |   129 +
 demo/undocumented/plot/dolfin_fine.xml.gz     |   Bin 0 -> 88283 bytes
 demo/undocumented/plot/python/demo_plot.py    |   101 +
 .../poisson1D-in-2D/cpp/CMakeLists.txt        |    40 +
 .../poisson1D-in-2D/cpp/Poisson.h             |  2148 +
 .../poisson1D-in-2D/cpp/Poisson.ufl           |    38 +
 .../poisson1D-in-2D/cpp/compile.log           |   180 +
 .../undocumented/poisson1D-in-2D/cpp/main.cpp |   140 +
 .../python/demo_poisson1D-in-2D.py            |   114 +
 .../undocumented/poisson1D/cpp/CMakeLists.txt |    40 +
 demo/undocumented/poisson1D/cpp/Poisson.h     |  2108 +
 demo/undocumented/poisson1D/cpp/Poisson.ufl   |    35 +
 demo/undocumented/poisson1D/cpp/compile.log   |   180 +
 demo/undocumented/poisson1D/cpp/main.cpp      |   109 +
 .../poisson1D/python/demo_poisson1D.py        |    70 +
 .../cpp/CMakeLists.txt                        |    39 +
 .../projection-interpolation/cpp/README       |     2 +
 .../python/demo_projection-interpolation.py   |    44 +
 .../refinement/cpp/CMakeLists.txt             |    40 +
 demo/undocumented/refinement/cpp/main.cpp     |    61 +
 .../refinement/python/demo_refinement.py      |    66 +
 .../restriction/cpp/CMakeLists.txt            |    40 +
 demo/undocumented/restriction/cpp/Poisson.h   |  2213 +
 demo/undocumented/restriction/cpp/Poisson.ufl |    33 +
 demo/undocumented/restriction/cpp/compile.log |   170 +
 demo/undocumented/restriction/cpp/main.cpp    |    81 +
 demo/undocumented/restriction/python/README   |     2 +
 .../restriction/python/demo_restriction.py    |    79 +
 .../undocumented/smoothing/cpp/CMakeLists.txt |    39 +
 demo/undocumented/smoothing/cpp/README        |     2 +
 .../smoothing/python/demo_smoothing.py        |    72 +
 .../spatial-coordinates/cpp/CMakeLists.txt    |    40 +
 .../cpp/SpatialCoordinates.h                  |  3091 +
 .../cpp/SpatialCoordinates.ufl                |    36 +
 .../spatial-coordinates/cpp/compile.log       |   926 +
 .../spatial-coordinates/cpp/main.cpp          |    83 +
 .../python/demo_spatial-coordinates.py        |    79 +
 .../python/demo_special_functions.py          |    54 +
 .../sub-function-assignment/cpp/README        |     2 +
 .../python/demo_sub-function-assignment.py    |    72 +
 demo/undocumented/submesh/cpp/CMakeLists.txt  |    40 +
 demo/undocumented/submesh/cpp/main.cpp        |    73 +
 .../submesh/python/demo_submesh.py            |    62 +
 .../sym-dirichlet-bc/cpp/CMakeLists.txt       |    40 +
 .../sym-dirichlet-bc/cpp/Poisson.h            |  2403 +
 .../sym-dirichlet-bc/cpp/Poisson.ufl          |    34 +
 .../sym-dirichlet-bc/cpp/compile.log          |   213 +
 .../sym-dirichlet-bc/cpp/main.cpp             |   142 +
 .../python/demo_sym-dirichlet-bc.py           |    75 +
 .../time-series/cpp/CMakeLists.txt            |    40 +
 demo/undocumented/time-series/cpp/main.cpp    |    71 +
 .../time-series/python/demo_time-series.py    |    54 +
 .../triangulate/cpp/CMakeLists.txt            |    40 +
 demo/undocumented/triangulate/cpp/main.cpp    |    60 +
 .../triangulate/python/demo_triangulate.py    |    43 +
 .../trilinos/python/demo_trilinos.py          |   102 +
 .../undocumented/waveguide/cpp/CMakeLists.txt |    40 +
 demo/undocumented/waveguide/cpp/Forms.h       |  6166 ++
 demo/undocumented/waveguide/cpp/Forms.py      |    46 +
 demo/undocumented/waveguide/cpp/Forms.ufl     |    31 +
 demo/undocumented/waveguide/cpp/compile.log   |  1249 +
 demo/undocumented/waveguide/cpp/main.cpp      |   108 +
 .../waveguide/python/demo_waveguide.py        |   104 +
 doc/CMakeLists.txt                            |    97 +
 doc/README                                    |    80 +
 doc/copy_and_split_demo_doc.py                |   190 +
 doc/generate_api_doc.py                       |    75 +
 doc/generate_main_index.py                    |    85 +
 doc/man/man1/dolfin-convert.1.gz              |   Bin 0 -> 789 bytes
 doc/man/man1/dolfin-order.1.gz                |   Bin 0 -> 305 bytes
 doc/man/man1/dolfin-plot.1.gz                 |   Bin 0 -> 321 bytes
 doc/man/man1/dolfin-version.1.gz              |   Bin 0 -> 236 bytes
 doc/quick_reference_cpp.rst                   |    50 +
 doc/quick_reference_python.rst                |    48 +
 doc/sphinx-common/Makefile                    |   130 +
 doc/sphinx-common/README                      |     5 +
 doc/sphinx-common/source/conf.py              |   230 +
 doc/sphinx-common/source/index.rst            |     0
 dolfin/CMakeLists.txt                         |   423 +
 .../AdaptiveLinearVariationalSolver.cpp       |   133 +
 .../AdaptiveLinearVariationalSolver.h         |   168 +
 .../AdaptiveNonlinearVariationalSolver.cpp    |   130 +
 .../AdaptiveNonlinearVariationalSolver.h      |   169 +
 dolfin/adaptivity/ErrorControl.cpp            |   501 +
 dolfin/adaptivity/ErrorControl.h              |   244 +
 dolfin/adaptivity/Extrapolation.cpp           |   299 +
 dolfin/adaptivity/Extrapolation.h             |   112 +
 .../GenericAdaptiveVariationalSolver.cpp      |   257 +
 .../GenericAdaptiveVariationalSolver.h        |   161 +
 dolfin/adaptivity/GoalFunctional.cpp          |    34 +
 dolfin/adaptivity/GoalFunctional.h            |    67 +
 dolfin/adaptivity/LocalAssembler.cpp          |   204 +
 dolfin/adaptivity/LocalAssembler.h            |    91 +
 dolfin/adaptivity/TimeSeries.cpp              |   404 +
 dolfin/adaptivity/TimeSeries.h                |   206 +
 dolfin/adaptivity/TimeSeriesHDF5.cpp          |   406 +
 dolfin/adaptivity/TimeSeriesHDF5.h            |   165 +
 dolfin/adaptivity/adapt.cpp                   |   630 +
 dolfin/adaptivity/adapt.h                     |   160 +
 dolfin/adaptivity/adaptivesolve.cpp           |   119 +
 dolfin/adaptivity/adaptivesolve.h             |    91 +
 dolfin/adaptivity/dolfin_adaptivity.h         |    20 +
 dolfin/adaptivity/marking.cpp                 |    93 +
 dolfin/adaptivity/marking.h                   |    68 +
 dolfin/ale/ALE.cpp                            |   136 +
 dolfin/ale/ALE.h                              |    62 +
 dolfin/ale/ALEType.h                          |    32 +
 dolfin/ale/HarmonicSmoothing.cpp              |   187 +
 dolfin/ale/HarmonicSmoothing.h                |    51 +
 dolfin/ale/MeshDisplacement.cpp               |   116 +
 dolfin/ale/MeshDisplacement.h                 |   109 +
 dolfin/ale/Poisson1D.h                        |  1407 +
 dolfin/ale/Poisson1D.ufl                      |    23 +
 dolfin/ale/Poisson2D.h                        |  1682 +
 dolfin/ale/Poisson2D.ufl                      |    23 +
 dolfin/ale/Poisson3D.h                        |  2051 +
 dolfin/ale/Poisson3D.ufl                      |    23 +
 dolfin/ale/compile.log                        |   407 +
 dolfin/ale/dolfin_ale.h                       |     9 +
 dolfin/common/Array.h                         |   122 +
 dolfin/common/Hierarchical.h                  |   282 +
 dolfin/common/IndexSet.h                      |   135 +
 dolfin/common/MPI.cpp                         |   197 +
 dolfin/common/MPI.h                           |   682 +
 dolfin/common/NoDeleter.h                     |    49 +
 dolfin/common/RangedIndexSet.h                |   108 +
 dolfin/common/Set.h                           |   133 +
 dolfin/common/SubSystemsManager.cpp           |   314 +
 dolfin/common/SubSystemsManager.h             |    96 +
 dolfin/common/Timer.cpp                       |    59 +
 dolfin/common/Timer.h                         |    79 +
 dolfin/common/UniqueIdGenerator.cpp           |    44 +
 dolfin/common/UniqueIdGenerator.h             |    55 +
 dolfin/common/Variable.cpp                    |    78 +
 dolfin/common/Variable.h                      |    88 +
 dolfin/common/constants.h                     |    33 +
 dolfin/common/defines.cpp                     |   170 +
 dolfin/common/defines.h                       |    86 +
 dolfin/common/dolfin_common.h                 |    20 +
 dolfin/common/dolfin_doc.h                    |    32 +
 dolfin/common/init.cpp                        |    35 +
 dolfin/common/init.h                          |    34 +
 dolfin/common/timing.cpp                      |   113 +
 dolfin/common/timing.h                        |    58 +
 dolfin/common/types.h                         |    44 +
 dolfin/common/unittest.h                      |    40 +
 dolfin/common/utils.cpp                       |    58 +
 dolfin/common/utils.h                         |   103 +
 dolfin/dolfin.h                               |    39 +
 dolfin/fem/Assembler.cpp                      |   428 +
 dolfin/fem/Assembler.h                        |   104 +
 dolfin/fem/AssemblerBase.cpp                  |   273 +
 dolfin/fem/AssemblerBase.h                    |   154 +
 dolfin/fem/BasisFunction.h                    |   124 +
 dolfin/fem/CCFEMAssembler.cpp                 |   195 +
 dolfin/fem/CCFEMAssembler.h                   |    65 +
 dolfin/fem/CCFEMDofMap.cpp                    |   314 +
 dolfin/fem/CCFEMDofMap.h                      |   221 +
 dolfin/fem/CCFEMForm.cpp                      |   124 +
 dolfin/fem/CCFEMForm.h                        |   130 +
 dolfin/fem/DirichletBC.cpp                    |  1237 +
 dolfin/fem/DirichletBC.h                      |   545 +
 dolfin/fem/DofMap.cpp                         |   526 +
 dolfin/fem/DofMap.h                           |   454 +
 dolfin/fem/DofMapBuilder.cpp                  |  1364 +
 dolfin/fem/DofMapBuilder.h                    |   176 +
 dolfin/fem/DomainAssigner.cpp                 |    69 +
 dolfin/fem/DomainAssigner.h                   |   106 +
 dolfin/fem/Equation.cpp                       |    67 +
 dolfin/fem/Equation.h                         |    84 +
 dolfin/fem/FiniteElement.cpp                  |    90 +
 dolfin/fem/FiniteElement.h                    |   284 +
 dolfin/fem/Form.cpp                           |   394 +
 dolfin/fem/Form.h                             |   374 +
 dolfin/fem/GenericDofMap.h                    |   183 +
 dolfin/fem/LinearTimeDependentProblem.cpp     |   167 +
 dolfin/fem/LinearTimeDependentProblem.h       |   118 +
 dolfin/fem/LinearVariationalProblem.cpp       |   158 +
 dolfin/fem/LinearVariationalProblem.h         |   114 +
 dolfin/fem/LinearVariationalSolver.cpp        |   211 +
 dolfin/fem/LinearVariationalSolver.h          |    79 +
 dolfin/fem/LocalSolver.cpp                    |   138 +
 dolfin/fem/LocalSolver.h                      |    58 +
 dolfin/fem/NonlinearVariationalProblem.cpp    |   266 +
 dolfin/fem/NonlinearVariationalProblem.h      |   185 +
 dolfin/fem/NonlinearVariationalSolver.cpp     |   245 +
 dolfin/fem/NonlinearVariationalSolver.h       |   192 +
 dolfin/fem/OpenMpAssembler.cpp                |   631 +
 dolfin/fem/OpenMpAssembler.h                  |    83 +
 dolfin/fem/PointSource.cpp                    |   143 +
 dolfin/fem/PointSource.h                      |    73 +
 dolfin/fem/SparsityPatternBuilder.cpp         |   226 +
 dolfin/fem/SparsityPatternBuilder.h           |    64 +
 dolfin/fem/SystemAssembler.cpp                |  1001 +
 dolfin/fem/SystemAssembler.h                  |   172 +
 dolfin/fem/UFC.cpp                            |   194 +
 dolfin/fem/UFC.h                              |   244 +
 dolfin/fem/assemble.cpp                       |    96 +
 dolfin/fem/assemble.h                         |    87 +
 dolfin/fem/dolfin_fem.h                       |    33 +
 dolfin/fem/fem_utils.cpp                      |   138 +
 dolfin/fem/fem_utils.h                        |    66 +
 dolfin/fem/solve.cpp                          |   120 +
 dolfin/fem/solve.h                            |   106 +
 dolfin/function/CCFEMFunction.cpp             |   117 +
 dolfin/function/CCFEMFunction.h               |   106 +
 dolfin/function/CCFEMFunctionSpace.cpp        |   358 +
 dolfin/function/CCFEMFunctionSpace.h          |   303 +
 dolfin/function/CoefficientAssigner.cpp       |    47 +
 dolfin/function/CoefficientAssigner.h         |    66 +
 dolfin/function/Constant.cpp                  |   131 +
 dolfin/function/Constant.h                    |   147 +
 dolfin/function/Expression.cpp                |   146 +
 dolfin/function/Expression.h                  |   168 +
 dolfin/function/Function.cpp                  |   765 +
 dolfin/function/Function.h                    |   409 +
 dolfin/function/FunctionAXPY.cpp              |   141 +
 dolfin/function/FunctionAXPY.h                |   105 +
 dolfin/function/FunctionAssigner.cpp          |   485 +
 dolfin/function/FunctionAssigner.h            |   161 +
 dolfin/function/FunctionSpace.cpp             |   303 +
 dolfin/function/FunctionSpace.h               |   279 +
 dolfin/function/GenericFunction.cpp           |   202 +
 dolfin/function/GenericFunction.h             |   141 +
 dolfin/function/LagrangeInterpolator.cpp      |   440 +
 dolfin/function/LagrangeInterpolator.h        |   109 +
 dolfin/function/SpecialFacetFunction.cpp      |    53 +
 dolfin/function/SpecialFacetFunction.h        |    85 +
 dolfin/function/SpecialFunctions.cpp          |    75 +
 dolfin/function/SpecialFunctions.h            |    82 +
 dolfin/function/SubSpace.cpp                  |    61 +
 dolfin/function/SubSpace.h                    |    61 +
 dolfin/function/assign.cpp                    |    64 +
 dolfin/function/assign.h                      |    62 +
 dolfin/function/dolfin_function.h             |    21 +
 dolfin/generation/BoxMesh.cpp                 |   158 +
 dolfin/generation/BoxMesh.h                   |   123 +
 dolfin/generation/CGALMeshBuilder.h           |   529 +
 dolfin/generation/CSGCGALDomain2D.cpp         |   345 +
 dolfin/generation/CSGCGALDomain2D.h           |    72 +
 dolfin/generation/CSGCGALMeshGenerator2D.cpp  |   459 +
 dolfin/generation/CSGCGALMeshGenerator2D.h    |    71 +
 dolfin/generation/CSGCGALMeshGenerator3D.cpp  |   238 +
 dolfin/generation/CSGCGALMeshGenerator3D.h    |    79 +
 dolfin/generation/CSGGeometries3D.cpp         |   145 +
 dolfin/generation/CSGGeometries3D.h           |    52 +
 dolfin/generation/CSGGeometry.cpp             |    74 +
 dolfin/generation/CSGGeometry.h               |    73 +
 dolfin/generation/CSGMeshGenerator.cpp        |   103 +
 dolfin/generation/CSGMeshGenerator.h          |    52 +
 dolfin/generation/CSGOperators.cpp            |   167 +
 dolfin/generation/CSGOperators.h              |   196 +
 dolfin/generation/CSGPrimitive.h              |    42 +
 dolfin/generation/CSGPrimitives2D.cpp         |   211 +
 dolfin/generation/CSGPrimitives2D.h           |   198 +
 dolfin/generation/CSGPrimitives3D.cpp         |   168 +
 dolfin/generation/CSGPrimitives3D.h           |   207 +
 dolfin/generation/EllipseMesh.cpp             |    71 +
 dolfin/generation/EllipseMesh.h               |    90 +
 dolfin/generation/EllipsoidMesh.cpp           |    75 +
 dolfin/generation/EllipsoidMesh.h             |    90 +
 dolfin/generation/GeometryToCGALConverter.cpp |   738 +
 dolfin/generation/GeometryToCGALConverter.h   |    45 +
 .../ImplicitDomainMeshGenerator.cpp           |   215 +
 .../generation/ImplicitDomainMeshGenerator.h  |    65 +
 dolfin/generation/IntervalMesh.cpp            |   114 +
 dolfin/generation/IntervalMesh.h              |    89 +
 dolfin/generation/PolygonalMeshGenerator.cpp  |   116 +
 dolfin/generation/PolygonalMeshGenerator.h    |    61 +
 dolfin/generation/PolyhedralMeshGenerator.cpp |   340 +
 dolfin/generation/PolyhedralMeshGenerator.h   |    79 +
 dolfin/generation/PolyhedronUtils.cpp         |   635 +
 dolfin/generation/PolyhedronUtils.h           |    67 +
 dolfin/generation/RectangleMesh.cpp           |   228 +
 dolfin/generation/RectangleMesh.h             |   109 +
 dolfin/generation/Triangulate.cpp             |   118 +
 dolfin/generation/Triangulate.h               |    57 +
 dolfin/generation/UnitCubeMesh.h              |    87 +
 dolfin/generation/UnitIntervalMesh.h          |    78 +
 dolfin/generation/UnitSquareMesh.h            |    93 +
 dolfin/generation/UnitTetrahedronMesh.cpp     |    73 +
 dolfin/generation/UnitTetrahedronMesh.h       |    51 +
 dolfin/generation/UnitTriangleMesh.cpp        |    69 +
 dolfin/generation/UnitTriangleMesh.h          |    50 +
 dolfin/generation/cgal_csg3d.h                |    59 +
 .../generation/cgal_triangulate_polyhedron.h  |   218 +
 dolfin/generation/compute_normal.h            |    44 +
 dolfin/generation/dolfin_generation.h         |    29 +
 dolfin/generation/self_intersect.h            |   155 +
 dolfin/geometry/BoundingBoxTree.cpp           |   207 +
 dolfin/geometry/BoundingBoxTree.h             |   246 +
 dolfin/geometry/BoundingBoxTree1D.h           |   173 +
 dolfin/geometry/BoundingBoxTree2D.h           |   215 +
 dolfin/geometry/BoundingBoxTree3D.h           |   257 +
 dolfin/geometry/CollisionDetection.cpp        |  1107 +
 dolfin/geometry/CollisionDetection.h          |   303 +
 dolfin/geometry/GenericBoundingBoxTree.cpp    |   727 +
 dolfin/geometry/GenericBoundingBoxTree.h      |   344 +
 dolfin/geometry/ImplicitSurface.cpp           |    45 +
 dolfin/geometry/ImplicitSurface.h             |    97 +
 dolfin/geometry/IntersectionTriangulation.cpp |   966 +
 dolfin/geometry/IntersectionTriangulation.h   |   146 +
 dolfin/geometry/MeshPointIntersection.cpp     |    44 +
 dolfin/geometry/MeshPointIntersection.h       |    62 +
 dolfin/geometry/Point.cpp                     |    76 +
 dolfin/geometry/Point.h                       |   340 +
 dolfin/geometry/SimplexQuadrature.cpp         |   108 +
 dolfin/geometry/SimplexQuadrature.h           |   122 +
 dolfin/geometry/dolfin_geometry.h             |    14 +
 dolfin/geometry/intersect.cpp                 |    33 +
 dolfin/geometry/intersect.h                   |    50 +
 dolfin/graph/BoostGraphColoring.h             |   123 +
 dolfin/graph/BoostGraphOrdering.cpp           |   194 +
 dolfin/graph/BoostGraphOrdering.h             |    66 +
 dolfin/graph/Graph.h                          |    43 +
 dolfin/graph/GraphBuilder.cpp                 |   368 +
 dolfin/graph/GraphBuilder.h                   |    91 +
 dolfin/graph/GraphColoring.cpp                |    58 +
 dolfin/graph/GraphColoring.h                  |    46 +
 dolfin/graph/GraphOrdering.cpp                |   197 +
 dolfin/graph/GraphOrdering.h                  |    99 +
 dolfin/graph/ParMETIS.cpp                     |   314 +
 dolfin/graph/ParMETIS.h                       |    79 +
 dolfin/graph/SCOTCH.cpp                       |   444 +
 dolfin/graph/SCOTCH.h                         |    80 +
 dolfin/graph/ZoltanInterface.cpp              |   181 +
 dolfin/graph/ZoltanInterface.h                |   100 +
 dolfin/graph/ZoltanPartition.cpp              |   466 +
 dolfin/graph/ZoltanPartition.h                |    99 +
 dolfin/graph/dolfin_graph.h                   |    11 +
 dolfin/io/BinaryFile.cpp                      |   321 +
 dolfin/io/BinaryFile.h                        |   121 +
 dolfin/io/Encoder.h                           |    97 +
 dolfin/io/ExodusFile.cpp                      |   400 +
 dolfin/io/ExodusFile.h                        |    76 +
 dolfin/io/File.cpp                            |   244 +
 dolfin/io/File.h                              |   275 +
 dolfin/io/GenericFile.cpp                     |   361 +
 dolfin/io/GenericFile.h                       |   146 +
 dolfin/io/HDF5Attribute.cpp                   |   212 +
 dolfin/io/HDF5Attribute.h                     |   120 +
 dolfin/io/HDF5File.cpp                        |  1386 +
 dolfin/io/HDF5File.h                          |   233 +
 dolfin/io/HDF5Interface.cpp                   |   406 +
 dolfin/io/HDF5Interface.h                     |   616 +
 dolfin/io/HDF5Utility.cpp                     |   440 +
 dolfin/io/HDF5Utility.h                       |   103 +
 dolfin/io/RAWFile.cpp                         |   235 +
 dolfin/io/RAWFile.h                           |    61 +
 dolfin/io/SAX2AttributeParser.h               |    83 +
 dolfin/io/SVGFile.cpp                         |   128 +
 dolfin/io/SVGFile.h                           |    49 +
 dolfin/io/VTKFile.cpp                         |   779 +
 dolfin/io/VTKFile.h                           |   126 +
 dolfin/io/VTKWriter.cpp                       |   414 +
 dolfin/io/VTKWriter.h                         |   156 +
 dolfin/io/X3DFile.cpp                         |   668 +
 dolfin/io/X3DFile.h                           |   104 +
 dolfin/io/XDMFFile.cpp                        |   957 +
 dolfin/io/XDMFFile.h                          |   163 +
 dolfin/io/XMLArray.h                          |   120 +
 dolfin/io/XMLFile.cpp                         |   455 +
 dolfin/io/XMLFile.h                           |   174 +
 dolfin/io/XMLFunctionData.cpp                 |   318 +
 dolfin/io/XMLFunctionData.h                   |    61 +
 dolfin/io/XMLLocalMeshSAX.cpp                 |   576 +
 dolfin/io/XMLLocalMeshSAX.h                   |   141 +
 dolfin/io/XMLMesh.cpp                         |   509 +
 dolfin/io/XMLMesh.h                           |    89 +
 dolfin/io/XMLMeshFunction.h                   |   249 +
 dolfin/io/XMLMeshValueCollection.h            |   179 +
 dolfin/io/XMLParameters.cpp                   |   164 +
 dolfin/io/XMLParameters.h                     |    60 +
 dolfin/io/XMLVector.cpp                       |   144 +
 dolfin/io/XMLVector.h                         |    62 +
 dolfin/io/XYZFile.cpp                         |   209 +
 dolfin/io/XYZFile.h                           |    63 +
 dolfin/io/base64.cpp                          |   124 +
 dolfin/io/base64.h                            |     5 +
 dolfin/io/dolfin_io.h                         |    12 +
 dolfin/io/pugiconfig.hpp                      |    69 +
 dolfin/io/pugixml.cpp                         | 10250 +++
 dolfin/io/pugixml.hpp                         |  1265 +
 dolfin/io/xmlutils.cpp                        |    44 +
 dolfin/io/xmlutils.h                          |    41 +
 dolfin/la/BlockMatrix.cpp                     |   195 +
 dolfin/la/BlockMatrix.h                       |    87 +
 dolfin/la/BlockVector.cpp                     |   202 +
 dolfin/la/BlockVector.h                       |   111 +
 dolfin/la/CholmodCholeskySolver.cpp           |   353 +
 dolfin/la/CholmodCholeskySolver.h             |   141 +
 dolfin/la/CoordinateMatrix.cpp                |   114 +
 dolfin/la/CoordinateMatrix.h                  |    92 +
 dolfin/la/DefaultFactory.cpp                  |   139 +
 dolfin/la/DefaultFactory.h                    |    84 +
 dolfin/la/EpetraFactory.cpp                   |   113 +
 dolfin/la/EpetraFactory.h                     |   103 +
 dolfin/la/EpetraKrylovSolver.cpp              |   341 +
 dolfin/la/EpetraKrylovSolver.h                |   138 +
 dolfin/la/EpetraLUSolver.cpp                  |   337 +
 dolfin/la/EpetraLUSolver.h                    |   123 +
 dolfin/la/EpetraMatrix.cpp                    |   814 +
 dolfin/la/EpetraMatrix.h                      |   197 +
 dolfin/la/EpetraVector.cpp                    |   926 +
 dolfin/la/EpetraVector.h                      |   251 +
 dolfin/la/GenericLUSolver.h                   |    84 +
 dolfin/la/GenericLinearAlgebraFactory.h       |   124 +
 dolfin/la/GenericLinearOperator.h             |    77 +
 dolfin/la/GenericLinearSolver.cpp             |    65 +
 dolfin/la/GenericLinearSolver.h               |   147 +
 dolfin/la/GenericMatrix.cpp                   |   183 +
 dolfin/la/GenericMatrix.h                     |   239 +
 dolfin/la/GenericPreconditioner.h             |    66 +
 dolfin/la/GenericSparsityPattern.h            |   129 +
 dolfin/la/GenericTensor.h                     |   110 +
 dolfin/la/GenericVector.h                     |   289 +
 dolfin/la/KrylovSolver.cpp                    |   194 +
 dolfin/la/KrylovSolver.h                      |   106 +
 dolfin/la/LUSolver.cpp                        |   127 +
 dolfin/la/LUSolver.h                          |   111 +
 dolfin/la/LinearAlgebraObject.h               |   192 +
 dolfin/la/LinearOperator.cpp                  |    71 +
 dolfin/la/LinearOperator.h                    |    85 +
 dolfin/la/LinearSolver.cpp                    |   172 +
 dolfin/la/LinearSolver.h                      |   115 +
 dolfin/la/MUMPSLUSolver.cpp                   |   199 +
 dolfin/la/MUMPSLUSolver.h                     |    80 +
 dolfin/la/Matrix.h                            |   229 +
 dolfin/la/PETScBaseMatrix.cpp                 |   131 +
 dolfin/la/PETScBaseMatrix.h                   |    94 +
 dolfin/la/PETScCuspFactory.cpp                |   106 +
 dolfin/la/PETScCuspFactory.h                  |    92 +
 dolfin/la/PETScFactory.cpp                    |   102 +
 dolfin/la/PETScFactory.h                      |    95 +
 dolfin/la/PETScKrylovSolver.cpp               |   716 +
 dolfin/la/PETScKrylovSolver.h                 |   198 +
 dolfin/la/PETScLUSolver.cpp                   |   495 +
 dolfin/la/PETScLUSolver.h                     |   156 +
 dolfin/la/PETScLinearOperator.cpp             |   146 +
 dolfin/la/PETScLinearOperator.h               |    86 +
 dolfin/la/PETScMatrix.cpp                     |   668 +
 dolfin/la/PETScMatrix.h                       |   205 +
 dolfin/la/PETScObject.h                       |    59 +
 dolfin/la/PETScOptions.cpp                    |    69 +
 dolfin/la/PETScOptions.h                      |    85 +
 dolfin/la/PETScPreconditioner.cpp             |   795 +
 dolfin/la/PETScPreconditioner.h               |   128 +
 dolfin/la/PETScUserPreconditioner.cpp         |    98 +
 dolfin/la/PETScUserPreconditioner.h           |    73 +
 dolfin/la/PETScVector.cpp                     |   914 +
 dolfin/la/PETScVector.h                       |   258 +
 dolfin/la/PaStiXLUSolver.cpp                  |   294 +
 dolfin/la/PaStiXLUSolver.h                    |    69 +
 dolfin/la/SLEPcEigenSolver.cpp                |   409 +
 dolfin/la/SLEPcEigenSolver.h                  |   240 +
 dolfin/la/STLFactory.cpp                      |    28 +
 dolfin/la/STLFactory.h                        |   115 +
 dolfin/la/STLFactoryCSC.cpp                   |    26 +
 dolfin/la/STLFactoryCSC.h                     |    60 +
 dolfin/la/STLMatrix.cpp                       |   470 +
 dolfin/la/STLMatrix.h                         |   388 +
 dolfin/la/STLVector.h                         |    43 +
 dolfin/la/Scalar.h                            |   193 +
 dolfin/la/SparsityPattern.cpp                 |   492 +
 dolfin/la/SparsityPattern.h                   |   150 +
 dolfin/la/TensorLayout.cpp                    |   109 +
 dolfin/la/TensorLayout.h                      |   111 +
 dolfin/la/TrilinosPreconditioner.cpp          |   278 +
 dolfin/la/TrilinosPreconditioner.h            |   151 +
 dolfin/la/UmfpackLUSolver.cpp                 |   518 +
 dolfin/la/UmfpackLUSolver.h                   |   119 +
 dolfin/la/Vector.h                            |   287 +
 dolfin/la/VectorSpaceBasis.cpp                |    93 +
 dolfin/la/VectorSpaceBasis.h                  |    68 +
 dolfin/la/dolfin_la.h                         |    76 +
 dolfin/la/solve.cpp                           |   316 +
 dolfin/la/solve.h                             |   110 +
 dolfin/la/uBLASDenseMatrix.h                  |    33 +
 dolfin/la/uBLASDummyPreconditioner.cpp        |    41 +
 dolfin/la/uBLASDummyPreconditioner.h          |    55 +
 dolfin/la/uBLASFactory.h                      |   141 +
 dolfin/la/uBLASILUPreconditioner.cpp          |   184 +
 dolfin/la/uBLASILUPreconditioner.h            |    69 +
 dolfin/la/uBLASKrylovSolver.cpp               |   168 +
 dolfin/la/uBLASKrylovSolver.h                 |   518 +
 dolfin/la/uBLASLinearOperator.cpp             |    82 +
 dolfin/la/uBLASLinearOperator.h               |    73 +
 dolfin/la/uBLASMatrix.h                       |   758 +
 dolfin/la/uBLASPreconditioner.h               |    79 +
 dolfin/la/uBLASSparseMatrix.h                 |    33 +
 dolfin/la/uBLASVector.cpp                     |   414 +
 dolfin/la/uBLASVector.h                       |   290 +
 dolfin/la/ublas.h                             |    77 +
 dolfin/log/Event.cpp                          |    58 +
 dolfin/log/Event.h                            |    75 +
 dolfin/log/LogLevel.h                         |    21 +
 dolfin/log/LogManager.cpp                     |    24 +
 dolfin/log/LogManager.h                       |    50 +
 dolfin/log/LogStream.cpp                      |   129 +
 dolfin/log/LogStream.h                        |   108 +
 dolfin/log/Logger.cpp                         |   437 +
 dolfin/log/Logger.h                           |   162 +
 dolfin/log/Progress.cpp                       |   165 +
 dolfin/log/Progress.h                         |   137 +
 dolfin/log/README                             |    44 +
 dolfin/log/Table.cpp                          |   356 +
 dolfin/log/Table.h                            |   157 +
 dolfin/log/dolfin_log.h                       |    13 +
 dolfin/log/log.cpp                            |   230 +
 dolfin/log/log.h                              |   184 +
 dolfin/math/Lagrange.cpp                      |   180 +
 dolfin/math/Lagrange.h                        |   105 +
 dolfin/math/Legendre.cpp                      |    49 +
 dolfin/math/Legendre.h                        |    48 +
 dolfin/math/basic.cpp                         |    72 +
 dolfin/math/basic.h                           |    49 +
 dolfin/math/dolfin_math.h                     |    10 +
 dolfin/mesh/BoundaryComputation.cpp           |   465 +
 dolfin/mesh/BoundaryComputation.h             |    63 +
 dolfin/mesh/BoundaryMesh.cpp                  |    82 +
 dolfin/mesh/BoundaryMesh.h                    |    86 +
 dolfin/mesh/Cell.h                            |   407 +
 dolfin/mesh/CellType.cpp                      |   335 +
 dolfin/mesh/CellType.h                        |   175 +
 dolfin/mesh/DistributedMeshTools.cpp          |  1062 +
 dolfin/mesh/DistributedMeshTools.h            |   156 +
 dolfin/mesh/DomainBoundary.h                  |    52 +
 dolfin/mesh/DynamicMeshEditor.cpp             |   235 +
 dolfin/mesh/DynamicMeshEditor.h               |   116 +
 dolfin/mesh/Edge.cpp                          |    68 +
 dolfin/mesh/Edge.h                            |   128 +
 dolfin/mesh/Face.cpp                          |   130 +
 dolfin/mesh/Face.h                            |    84 +
 dolfin/mesh/Facet.cpp                         |    98 +
 dolfin/mesh/Facet.h                           |   101 +
 dolfin/mesh/FacetCell.cpp                     |    59 +
 dolfin/mesh/FacetCell.h                       |    58 +
 dolfin/mesh/IntervalCell.cpp                  |   308 +
 dolfin/mesh/IntervalCell.h                    |   110 +
 dolfin/mesh/LocalMeshData.cpp                 |   322 +
 dolfin/mesh/LocalMeshData.h                   |   142 +
 dolfin/mesh/LocalMeshValueCollection.h        |   139 +
 dolfin/mesh/Mesh.cpp                          |   549 +
 dolfin/mesh/Mesh.h                            |   702 +
 dolfin/mesh/MeshColoring.cpp                  |   181 +
 dolfin/mesh/MeshColoring.h                    |    76 +
 dolfin/mesh/MeshConnectivity.cpp              |   176 +
 dolfin/mesh/MeshConnectivity.h                |   176 +
 dolfin/mesh/MeshData.cpp                      |   225 +
 dolfin/mesh/MeshData.h                        |   205 +
 dolfin/mesh/MeshDomains.cpp                   |   119 +
 dolfin/mesh/MeshDomains.h                     |    95 +
 dolfin/mesh/MeshEditor.cpp                    |   382 +
 dolfin/mesh/MeshEditor.h                      |   362 +
 dolfin/mesh/MeshEntity.cpp                    |   154 +
 dolfin/mesh/MeshEntity.h                      |   246 +
 dolfin/mesh/MeshEntityIterator.h              |   204 +
 dolfin/mesh/MeshEntityIteratorBase.h          |   169 +
 dolfin/mesh/MeshFunction.cpp                  |    67 +
 dolfin/mesh/MeshFunction.h                    |   843 +
 dolfin/mesh/MeshGeometry.cpp                  |   141 +
 dolfin/mesh/MeshGeometry.h                    |   151 +
 dolfin/mesh/MeshOrdering.cpp                  |    80 +
 dolfin/mesh/MeshOrdering.h                    |    46 +
 dolfin/mesh/MeshPartitioning.cpp              |   545 +
 dolfin/mesh/MeshPartitioning.h                |   299 +
 dolfin/mesh/MeshQuality.cpp                   |   135 +
 dolfin/mesh/MeshQuality.h                     |    95 +
 dolfin/mesh/MeshRenumbering.cpp               |   267 +
 dolfin/mesh/MeshRenumbering.h                 |    68 +
 dolfin/mesh/MeshSmoothing.cpp                 |   207 +
 dolfin/mesh/MeshSmoothing.h                   |    62 +
 dolfin/mesh/MeshTopology.cpp                  |   245 +
 dolfin/mesh/MeshTopology.h                    |   174 +
 dolfin/mesh/MeshTransformation.cpp            |   186 +
 dolfin/mesh/MeshTransformation.h              |    76 +
 dolfin/mesh/MeshValueCollection.h             |   625 +
 dolfin/mesh/PeriodicBoundaryComputation.cpp   |   380 +
 dolfin/mesh/PeriodicBoundaryComputation.h     |    74 +
 dolfin/mesh/PointCell.cpp                     |   190 +
 dolfin/mesh/PointCell.h                       |   112 +
 dolfin/mesh/Restriction.cpp                   |    83 +
 dolfin/mesh/Restriction.h                     |   118 +
 dolfin/mesh/SubDomain.cpp                     |   327 +
 dolfin/mesh/SubDomain.h                       |   288 +
 dolfin/mesh/SubMesh.cpp                       |   320 +
 dolfin/mesh/SubMesh.h                         |    67 +
 dolfin/mesh/SubsetIterator.h                  |   137 +
 dolfin/mesh/TetrahedronCell.cpp               |   729 +
 dolfin/mesh/TetrahedronCell.h                 |   125 +
 dolfin/mesh/TopologyComputation.cpp           |   366 +
 dolfin/mesh/TopologyComputation.h             |    61 +
 dolfin/mesh/TriangleCell.cpp                  |   524 +
 dolfin/mesh/TriangleCell.h                    |   118 +
 dolfin/mesh/Vertex.h                          |    87 +
 dolfin/mesh/dolfin_mesh.h                     |    40 +
 dolfin/multistage/MultiStageScheme.cpp        |   266 +
 dolfin/multistage/MultiStageScheme.h          |   163 +
 dolfin/multistage/PointIntegralSolver.cpp     |   824 +
 dolfin/multistage/PointIntegralSolver.h       |   222 +
 dolfin/multistage/RKSolver.cpp                |   138 +
 dolfin/multistage/RKSolver.h                  |    73 +
 dolfin/multistage/dolfin_multistage.h         |    10 +
 dolfin/nls/NewtonSolver.cpp                   |   280 +
 dolfin/nls/NewtonSolver.h                     |   148 +
 dolfin/nls/NonlinearProblem.h                 |    63 +
 dolfin/nls/PETScSNESSolver.cpp                |   660 +
 dolfin/nls/PETScSNESSolver.h                  |   168 +
 dolfin/nls/TAOLinearBoundSolver.cpp           |   450 +
 dolfin/nls/TAOLinearBoundSolver.h             |   222 +
 dolfin/nls/dolfin_nls.h                       |    11 +
 dolfin/parameter/GlobalParameters.cpp         |   159 +
 dolfin/parameter/GlobalParameters.h           |   193 +
 dolfin/parameter/Parameter.cpp                |   712 +
 dolfin/parameter/Parameter.h                  |   336 +
 dolfin/parameter/Parameters.cpp               |   650 +
 dolfin/parameter/Parameters.h                 |   307 +
 dolfin/parameter/dolfin_parameter.h           |    10 +
 dolfin/plot/ExpressionWrapper.cpp             |    34 +
 dolfin/plot/ExpressionWrapper.h               |    67 +
 dolfin/plot/GenericVTKPlottable.h             |   116 +
 dolfin/plot/VTKPlottableCSGGeometry.cpp       |   104 +
 dolfin/plot/VTKPlottableCSGGeometry.h         |    67 +
 dolfin/plot/VTKPlottableDirichletBC.cpp       |   104 +
 dolfin/plot/VTKPlottableDirichletBC.h         |    70 +
 dolfin/plot/VTKPlottableGenericFunction.cpp   |   340 +
 dolfin/plot/VTKPlottableGenericFunction.h     |   138 +
 dolfin/plot/VTKPlottableGenericFunction1D.cpp |   156 +
 dolfin/plot/VTKPlottableGenericFunction1D.h   |    93 +
 dolfin/plot/VTKPlottableMesh.cpp              |   518 +
 dolfin/plot/VTKPlottableMesh.h                |   163 +
 dolfin/plot/VTKPlottableMeshFunction.cpp      |    70 +
 dolfin/plot/VTKPlottableMeshFunction.h        |    80 +
 dolfin/plot/VTKPlotter.cpp                    |   839 +
 dolfin/plot/VTKPlotter.h                      |   330 +
 dolfin/plot/VTKWindowOutputStage.cpp          |   642 +
 dolfin/plot/VTKWindowOutputStage.h            |   199 +
 dolfin/plot/dolfin_plot.h                     |     9 +
 dolfin/plot/gauss_120.dat                     |   259 +
 dolfin/plot/plot.cpp                          |   172 +
 dolfin/plot/plot.h                            |    93 +
 dolfin/refinement/BisectionRefinement.cpp     |   181 +
 dolfin/refinement/BisectionRefinement.h       |    58 +
 dolfin/refinement/LocalMeshCoarsening.cpp     |   436 +
 dolfin/refinement/LocalMeshCoarsening.h       |    71 +
 dolfin/refinement/LocalMeshRefinement.cpp     |    70 +
 dolfin/refinement/LocalMeshRefinement.h       |    49 +
 dolfin/refinement/ParallelRefinement.cpp      |   402 +
 dolfin/refinement/ParallelRefinement.h        |   114 +
 dolfin/refinement/ParallelRefinement2D.cpp    |   302 +
 dolfin/refinement/ParallelRefinement2D.h      |    51 +
 dolfin/refinement/ParallelRefinement3D.cpp    |   424 +
 dolfin/refinement/ParallelRefinement3D.h      |    55 +
 dolfin/refinement/RegularCutRefinement.cpp    |   695 +
 dolfin/refinement/RegularCutRefinement.h      |    94 +
 dolfin/refinement/RivaraRefinement.cpp        |   480 +
 dolfin/refinement/RivaraRefinement.h          |   114 +
 dolfin/refinement/UniformMeshRefinement.cpp   |   109 +
 dolfin/refinement/UniformMeshRefinement.h     |    44 +
 dolfin/refinement/dolfin_refinement.h         |     8 +
 dolfin/refinement/refine.cpp                  |    96 +
 dolfin/refinement/refine.h                    |   120 +
 dolfin/swig/CMakeLists.txt                    |   131 +
 dolfin/swig/README                            |    60 +
 dolfin/swig/adaptivity/docstrings.i           |   956 +
 dolfin/swig/adaptivity/post.i                 |    38 +
 dolfin/swig/adaptivity/pre.i                  |    53 +
 dolfin/swig/ale/docstrings.i                  |   121 +
 dolfin/swig/ale/pre.i                         |    28 +
 dolfin/swig/common/docstrings.i               |   803 +
 dolfin/swig/common/post.i                     |   147 +
 dolfin/swig/common/pre.i                      |    91 +
 dolfin/swig/defines.i                         |    37 +
 dolfin/swig/exceptions.i                      |    73 +
 dolfin/swig/fem/docstrings.i                  |  2297 +
 dolfin/swig/fem/post.i                        |   195 +
 dolfin/swig/fem/pre.i                         |   303 +
 dolfin/swig/forwarddeclarations.i             |    69 +
 dolfin/swig/function/docstrings.i             |  1489 +
 dolfin/swig/function/import.i                 |     2 +
 dolfin/swig/function/post.i                   |   151 +
 dolfin/swig/function/pre.i                    |   220 +
 dolfin/swig/generation/docstrings.i           |   947 +
 dolfin/swig/generation/post.i                 |    21 +
 dolfin/swig/geometry/docstrings.i             |   666 +
 dolfin/swig/geometry/post.i                   |    42 +
 dolfin/swig/geometry/pre.i                    |    50 +
 dolfin/swig/globalincludes.i                  |    57 +
 dolfin/swig/graph/docstrings.i                |    76 +
 dolfin/swig/graph/post.i                      |    12 +
 dolfin/swig/io/docstrings.i                   |   481 +
 dolfin/swig/io/post.i                         |    64 +
 dolfin/swig/io/pre.i                          |    39 +
 dolfin/swig/la/Indices.i                      |   354 +
 dolfin/swig/la/docstrings.i                   |  4617 ++
 dolfin/swig/la/la_get_set_items.i             |   577 +
 dolfin/swig/la/post.i                         |  1009 +
 dolfin/swig/la/pre.i                          |   352 +
 dolfin/swig/log/docstrings.i                  |   400 +
 dolfin/swig/log/post.i                        |    90 +
 dolfin/swig/log/pre.i                         |    57 +
 dolfin/swig/math/docstrings.i                 |   129 +
 dolfin/swig/mesh/docstrings.i                 |  3753 ++
 dolfin/swig/mesh/post.i                       |   523 +
 dolfin/swig/mesh/pre.i                        |   284 +
 dolfin/swig/modules/common/CMakeLists.txt     |    59 +
 dolfin/swig/modules/common/dependencies.txt   |     1 +
 dolfin/swig/modules/common/module.i           |   114 +
 dolfin/swig/modules/fem/CMakeLists.txt        |    59 +
 dolfin/swig/modules/fem/dependencies.txt      |     1 +
 dolfin/swig/modules/fem/module.i              |   242 +
 dolfin/swig/modules/function/CMakeLists.txt   |    59 +
 dolfin/swig/modules/function/dependencies.txt |     1 +
 dolfin/swig/modules/function/module.i         |   183 +
 dolfin/swig/modules/io/CMakeLists.txt         |    59 +
 dolfin/swig/modules/io/dependencies.txt       |     1 +
 dolfin/swig/modules/io/module.i               |   161 +
 dolfin/swig/modules/la/CMakeLists.txt         |    59 +
 dolfin/swig/modules/la/dependencies.txt       |     1 +
 dolfin/swig/modules/la/module.i               |   217 +
 dolfin/swig/modules/mesh/CMakeLists.txt       |    59 +
 dolfin/swig/modules/mesh/dependencies.txt     |     1 +
 dolfin/swig/modules/mesh/module.i             |   245 +
 dolfin/swig/multistage/docstrings.i           |   136 +
 dolfin/swig/multistage/pre.i                  |    39 +
 dolfin/swig/nls/docstrings.i                  |   248 +
 dolfin/swig/nls/pre.i                         |    64 +
 dolfin/swig/parameter/docstrings.i            |   562 +
 dolfin/swig/parameter/post.i                  |   331 +
 dolfin/swig/parameter/pre.i                   |   161 +
 dolfin/swig/plot/docstrings.i                 |   232 +
 dolfin/swig/refinement/docstrings.i           |    99 +
 dolfin/swig/shared_ptr_classes.i              |   268 +
 dolfin/swig/typemaps/array.i                  |   119 +
 dolfin/swig/typemaps/includes.i               |    32 +
 dolfin/swig/typemaps/numpy.i                  |   505 +
 dolfin/swig/typemaps/primitives.i             |   337 +
 dolfin/swig/typemaps/std_map.i                |   218 +
 dolfin/swig/typemaps/std_pair.i               |   255 +
 dolfin/swig/typemaps/std_set.i                |   132 +
 dolfin/swig/typemaps/std_vector.i             |   688 +
 dolfin/swig/version.i                         |    35 +
 scripts/dolfin-convert/dolfin-convert         |   131 +
 scripts/dolfin-convert/test_Triangle.edge     |    60 +
 scripts/dolfin-convert/test_Triangle.ele      |    31 +
 scripts/dolfin-convert/test_Triangle.node     |    31 +
 scripts/dolfin-convert/test_exodus.exo        |   Bin 0 -> 7180 bytes
 scripts/dolfin-order/dolfin-order             |    60 +
 scripts/dolfin-order/mesh0.xml.gz             |   Bin 0 -> 312 bytes
 scripts/dolfin-order/mesh1.xml.gz             |   Bin 0 -> 247 bytes
 scripts/dolfin-plot/dolfin-plot               |   149 +
 scripts/dolfin-plot/mesh.xml.gz               |   Bin 0 -> 20894 bytes
 scripts/dolfin-plot/plot_book_elements.sh     |    71 +
 scripts/dolfin-plot/plot_elements.sh          |    19 +
 site-packages/dolfin/__init__.py              |    47 +
 site-packages/dolfin/common/__init__.py       |    21 +
 site-packages/dolfin/common/constants.py      |    11 +
 .../dolfin/common/globalparameters.py.in      |    62 +
 site-packages/dolfin/common/math.py           |    18 +
 site-packages/dolfin/common/memory.py         |    48 +
 site-packages/dolfin/common/plotting.py       |   145 +
 site-packages/dolfin/common/time.py           |    65 +
 .../dolfin/compilemodules/__init__.py         |    17 +
 .../dolfin/compilemodules/compilemodule.py    |   472 +
 .../dolfin/compilemodules/expressions.py      |   233 +
 site-packages/dolfin/compilemodules/jit.py    |   126 +
 .../dolfin/compilemodules/subdomains.py       |   235 +
 .../dolfin/compilemodules/swigimportinfo.py   |   301 +
 site-packages/dolfin/cpp/__init__.py          |    82 +
 site-packages/dolfin/deprecation.py           |    36 +
 site-packages/dolfin/fem/__init__.py          |    32 +
 site-packages/dolfin/fem/adaptivesolving.py   |   222 +
 site-packages/dolfin/fem/assembling.py        |   453 +
 site-packages/dolfin/fem/bcs.py               |   185 +
 .../dolfin/fem/errorcontrolgenerator.py       |   103 +
 site-packages/dolfin/fem/form.py              |   298 +
 site-packages/dolfin/fem/formmanipulations.py |   145 +
 site-packages/dolfin/fem/interpolation.py     |    66 +
 site-packages/dolfin/fem/norms.py             |   266 +
 site-packages/dolfin/fem/projection.py        |   145 +
 site-packages/dolfin/fem/solving.py           |   456 +
 site-packages/dolfin/functions/__init__.py    |    20 +
 site-packages/dolfin/functions/constant.py    |   107 +
 site-packages/dolfin/functions/expression.py  |   837 +
 site-packages/dolfin/functions/function.py    |   688 +
 .../dolfin/functions/functionspace.py         |   674 +
 .../dolfin/functions/specialfunctions.py      |   227 +
 .../dolfin/functions/ufc_functionspace.py     |    32 +
 .../dolfin/importhandler/__init__.py          |    52 +
 site-packages/dolfin/mesh/__init__.py         |    14 +
 site-packages/dolfin/mesh/ale.py              |   185 +
 .../dolfin/mesh/boundarysubdomainfinder.py    |   223 +
 site-packages/dolfin/mesh/meshes.py           |    74 +
 site-packages/dolfin/mesh/refinement.py       |    80 +
 site-packages/dolfin/mesh/svgtools.py         |   104 +
 site-packages/dolfin/multistage/__init__.py   |    12 +
 .../dolfin/multistage/multistagescheme.py     |   750 +
 .../dolfin/multistage/multistagesolvers.py    |    62 +
 site-packages/dolfin_utils/__init__.py        |     0
 site-packages/dolfin_utils/commands.py        |    42 +
 .../dolfin_utils/cppparser/CppHeaderParser.py |  2407 +
 .../dolfin_utils/cppparser/__init__.py        |     2 +
 site-packages/dolfin_utils/cppparser/utils.py |   179 +
 .../dolfin_utils/documentation/__init__.py    |     4 +
 .../documentation/docstringutils.py           |    49 +
 .../documentation/extractdocumentation.py     |   225 +
 .../documentation/generatecpprst.py           |   154 +
 .../documentation/generatepythonrst.py        |   219 +
 .../documentation/indextemplates.py           |    91 +
 .../dolfin_utils/meshconvert/__init__.py      |     0
 .../dolfin_utils/meshconvert/abaqus.py        |   475 +
 .../dolfin_utils/meshconvert/meshconvert.py   |  1449 +
 .../dolfin_utils/meshconvert/xml_writer.py    |   152 +
 site-packages/dolfin_utils/ordereddict.py     |   127 +
 site-packages/dolfin_utils/pjobs/__init__.py  |     1 +
 site-packages/dolfin_utils/pjobs/pjobs.py     |   230 +
 site-packages/dolfin_utils/pjobs/sge.py       |    99 +
 site-packages/dolfin_utils/pjobs/slurm.py     |    62 +
 site-packages/dolfin_utils/pjobs/torque.py    |    78 +
 site-packages/fenics/__init__.py              |     6 +
 test/CMakeLists.txt                           |    58 +
 test/README                                   |    44 +
 test/codingstyle/test.py                      |   136 +
 test/documentation/README                     |     1 +
 test/documentation/test.py                    |    38 +
 .../verify_demo_code_snippets.py              |   188 +
 test/memory/dolfin_valgrind.supp              |  2483 +
 test/memory/test.py                           |   189 +
 test/regression/README                        |     7 +
 test/regression/test.py                       |   253 +
 test/system/parallel-assembly-solve/solver.py |   121 +
 test/system/parallel-assembly-solve/test.py   |    53 +
 test/system/test.py                           |    52 +
 .../assembly_derivatives.py                   |   271 +
 .../ufl-jit-assemble-chain/form_operations.py |    58 +
 test/system/ufl-jit-assemble-chain/test.py    |    41 +
 test/test.py                                  |    49 +
 test/unit/adaptivity/python/TimeSeries.py     |   102 +
 test/unit/adaptivity/python/errorcontrol.py   |   131 +
 test/unit/ale/python/HarmonicSmoothing.py     |   112 +
 test/unit/book/README                         |    28 +
 test/unit/book/python/chapter_1.py            |   188 +
 test/unit/book/python/chapter_10.py           |  1014 +
 .../chapter_1_files/dolfin_parameters.xml     |    69 +
 .../nonlinear_poisson/alg_newton_np.py        |   111 +
 .../nonlinear_poisson/pde_newton_np.py        |   109 +
 .../stationary/nonlinear_poisson/picard_np.py |    82 +
 .../stationary/nonlinear_poisson/vp1_np.py    |   105 +
 .../stationary/nonlinear_poisson/vp2_np.py    |   114 +
 .../stationary/poisson/d1_p2D.py              |    45 +
 .../stationary/poisson/d2_p2D.py              |    61 +
 .../stationary/poisson/d3_p2D.py              |    61 +
 .../stationary/poisson/d4_p2D.py              |    82 +
 .../stationary/poisson/d5_p2D.py              |   111 +
 .../stationary/poisson/d6_p2D.py              |   125 +
 .../stationary/poisson/dn1_p2D.py             |    69 +
 .../stationary/poisson/dn2_p2D.py             |    87 +
 .../stationary/poisson/dn3_p2D.py             |   111 +
 .../stationary/poisson/dn4_p2D.py             |   127 +
 .../stationary/poisson/dnr_p2D.py             |    97 +
 .../stationary/poisson/mat2_p2D.py            |   103 +
 .../stationary/poisson/mat2x_p2D.py           |    97 +
 .../stationary/poisson/membrane1.py           |    78 +
 .../stationary/poisson/membrane1v.py          |    80 +
 .../chapter_1_files/stationary/poisson/paD.py |    53 +
 .../stationary/poisson/vcp2D.py               |   170 +
 .../transient/diffusion/d1_d2D.py             |    59 +
 .../transient/diffusion/d2_d2D.py             |    72 +
 .../transient/diffusion/demo_sin_daD.sh       |    12 +
 .../transient/diffusion/sin_daD.py            |   197 +
 test/unit/book/python/mesh.xml                |    26 +
 test/unit/book/python/original_tests/README   |     5 +
 test/unit/fem/python/Assembler.py             |   679 +
 test/unit/fem/python/DirichletBC.py           |   143 +
 test/unit/fem/python/DofMap.py                |   299 +
 test/unit/fem/python/FiniteElement.py         |   146 +
 test/unit/fem/python/Form.py                  |   397 +
 test/unit/fem/python/LocalSolver.py           |    59 +
 test/unit/fem/python/SystemAssembler.py       |   314 +
 test/unit/fem/python/aneurysm.xml.gz          |   Bin 0 -> 703208 bytes
 test/unit/fem/python/manifolds.py             |   275 +
 test/unit/fem/python/solving.py               |    95 +
 test/unit/fem/python/tetrahedron.xml.gz       |   Bin 0 -> 254 bytes
 test/unit/function/cpp/CMakeLists.txt         |    40 +
 test/unit/function/cpp/Expression.cpp         |   111 +
 test/unit/function/cpp/Projection.h           |  4575 ++
 test/unit/function/cpp/Projection.ufl         |    33 +
 test/unit/function/cpp/compile.log            |   242 +
 test/unit/function/python/Constant.py         |    86 +
 .../python/ConstrainedFunctionSpace.py        |   168 +
 test/unit/function/python/Expression.py       |   658 +
 test/unit/function/python/Function.py         |   401 +
 test/unit/function/python/FunctionAssigner.py |   168 +
 test/unit/function/python/FunctionSpace.py    |   158 +
 .../function/python/LagrangeInterpolator.py   |    90 +
 test/unit/function/python/SpecialFunctions.py |    46 +
 .../python/nonmatching_interpolation.py       |    87 +
 test/unit/geometry/python/BoundingBoxTree.py  |   447 +
 .../geometry/python/CollisionDetection.py     |   159 +
 test/unit/geometry/python/Intersection.py     |    67 +
 .../python/IntersectionTriangulation.py       |   175 +
 test/unit/geometry/python/Issues.py           |    54 +
 test/unit/graph/python/GraphBuild.py          |    40 +
 test/unit/io/cpp/CMakeLists.txt               |    44 +
 test/unit/io/cpp/XMLLocalMeshData.cpp         |    53 +
 test/unit/io/cpp/XMLMeshData.cpp              |    85 +
 test/unit/io/cpp/XMLMeshValueCollection.cpp   |    65 +
 test/unit/io/cpp/xml_value_collection_ref.xml |    11 +
 test/unit/io/python/Exodus.py                 |    90 +
 test/unit/io/python/HDF5.py                   |   182 +
 test/unit/io/python/HDF5Attribute.py          |    87 +
 test/unit/io/python/SVG.py                    |    45 +
 test/unit/io/python/X3D.py                    |    71 +
 test/unit/io/python/XDMF.py                   |   239 +
 test/unit/io/python/XMLLocalMeshData.py       |    36 +
 test/unit/io/python/XMLMesh.py                |   123 +
 test/unit/io/python/XMLMeshFunction.py        |   124 +
 test/unit/io/python/XMLMeshValueCollection.py |    75 +
 test/unit/io/python/XMLVector.py              |   109 +
 test/unit/io/python/vtk.py                    |   203 +
 .../io/python/xml_value_collection_ref.xml    |    11 +
 test/unit/io/snake.xml.gz                     |   Bin 0 -> 95055 bytes
 test/unit/jit/python/test.py                  |    81 +
 test/unit/la/cpp/CMakeLists.txt               |    42 +
 test/unit/la/cpp/LinearOperator.cpp           |   136 +
 test/unit/la/cpp/Vector.cpp                   |   218 +
 test/unit/la/cpp/forms/ReactionDiffusion.h    |  2214 +
 test/unit/la/cpp/forms/ReactionDiffusion.ufl  |    28 +
 .../la/cpp/forms/ReactionDiffusionAction.h    |  1735 +
 .../la/cpp/forms/ReactionDiffusionAction.ufl  |    26 +
 test/unit/la/cpp/forms/compile.log            |   329 +
 test/unit/la/python/KrylovSolver.py           |    80 +
 test/unit/la/python/LinearOperator.py         |    94 +
 test/unit/la/python/Matrix.py                 |   376 +
 test/unit/la/python/Scalar.py                 |    44 +
 test/unit/la/python/Vector.py                 |   384 +
 test/unit/la/python/solve.py                  |    54 +
 test/unit/la/python/test.py                   |   372 +
 test/unit/math/python/test.py                 |    98 +
 test/unit/mesh/boxes.xml.gz                   |   Bin 0 -> 16611 bytes
 test/unit/mesh/cpp/CMakeLists.txt             |    44 +
 test/unit/mesh/cpp/Mesh.cpp                   |   322 +
 test/unit/mesh/cpp/MeshFunction.cpp           |    97 +
 test/unit/mesh/cpp/MeshValueCollection.cpp    |   187 +
 test/unit/mesh/python/BoundaryMesh.py         |    59 +
 test/unit/mesh/python/Cell.py                 |    65 +
 test/unit/mesh/python/Edge.py                 |    56 +
 test/unit/mesh/python/Face.py                 |    68 +
 test/unit/mesh/python/Mesh.py                 |   374 +
 test/unit/mesh/python/MeshColoring.py         |    41 +
 test/unit/mesh/python/MeshData.py             |    40 +
 test/unit/mesh/python/MeshEditor.py           |    52 +
 test/unit/mesh/python/MeshFunction.py         |   131 +
 test/unit/mesh/python/MeshIterator.py         |   148 +
 test/unit/mesh/python/MeshMarkers.py          |    67 +
 test/unit/mesh/python/MeshQuality.py          |   114 +
 test/unit/mesh/python/MeshTransformation.py   |    54 +
 test/unit/mesh/python/MeshValueCollection.py  |   172 +
 .../python/PeriodicBoundaryComputation.py     |    62 +
 test/unit/mesh/python/SubDomain.py            |   100 +
 test/unit/mesh/python/SubMesh.py              |   107 +
 test/unit/meshconvert/python/data/abaqus.inp  |    79 +
 .../meshconvert/python/data/abaqus_facet.inp  |   781 +
 .../meshconvert/python/data/diffpack_tet.grid |   121 +
 .../meshconvert/python/data/diffpack_tri.grid |   138 +
 test/unit/meshconvert/python/data/gmsh.msh    |    29 +
 .../data/gmsh_test_facet_regions_1D_2.geo     |    10 +
 .../data/gmsh_test_facet_regions_1D_2.msh     |    32 +
 .../data/gmsh_test_facet_regions_2D_1.geo     |    15 +
 .../data/gmsh_test_facet_regions_2D_1.msh     |    19 +
 .../data/gmsh_test_facet_regions_2D_2.geo     |    15 +
 .../data/gmsh_test_facet_regions_2D_2.msh     |    20 +
 .../data/gmsh_test_facet_regions_2D_3.geo     |    15 +
 .../data/gmsh_test_facet_regions_2D_3.msh     |    21 +
 .../data/gmsh_test_facet_regions_2D_4.geo     |    15 +
 .../data/gmsh_test_facet_regions_2D_4.msh     |    22 +
 .../data/gmsh_test_facet_regions_3D_1.geo     |    39 +
 .../data/gmsh_test_facet_regions_3D_1.msh     |    51 +
 .../python/data/test_Triangle_3.edge          |   118 +
 .../python/data/test_Triangle_3.ele           |    60 +
 .../python/data/test_Triangle_3.node          |    60 +
 .../unit/meshconvert/python/data/triangle.ele |   161 +
 .../meshconvert/python/data/triangle.node     |    98 +
 test/unit/meshconvert/python/test.py          |   532 +
 .../multistage/python/PointIntegralSolver.py  |   156 +
 test/unit/multistage/python/RKSolver.py       |   105 +
 test/unit/nls/python/PETScSNESSolver.py       |   125 +
 test/unit/nls/python/TAOLinearBoundSolver.py  |   111 +
 test/unit/nls/python/doughnut.xml.gz          |   Bin 0 -> 15843 bytes
 test/unit/parameter/cpp/CMakeLists.txt        |    40 +
 test/unit/parameter/cpp/Parameters.cpp        |   124 +
 test/unit/parameter/python/Parameters.py      |   149 +
 test/unit/python-extras/python/test.py        |    49 +
 test/unit/refinement/python/refine.py         |    44 +
 test/unit/test.py                             |   153 +
 utils/emacs/macros                            |    21 +
 utils/gid/DOLFIN.bas                          |    17 +
 utils/matlab/meshindex.m                      |    54 +
 utils/matlab/plotcontroller.m                 |    35 +
 utils/matlab/plotslab.m                       |   173 +
 utils/matlab/xmlmatrix.m                      |    72 +
 utils/matlab/xmlmesh.m                        |    97 +
 utils/matlab/xmlvector.m                      |    58 +
 utils/octave/README                           |    28 +
 utils/octave/pdemesh.m                        |    29 +
 utils/octave/pdeplot.m                        |   230 +
 utils/octave/pdesurf.m                        |    26 +
 utils/python/README                           |     2 +
 utils/python/extract2d                        |    88 +
 utils/scripts/broken                          |     6 +
 utils/scripts/code-formatting                 |   198 +
 utils/scripts/dolfinreplace                   |   141 +
 utils/scripts/fixme                           |     6 +
 utils/scripts/formatcode                      |   122 +
 utils/scripts/klocs                           |    17 +
 utils/scripts/makedoc                         |    14 +
 utils/scripts/notinuse                        |    23 +
 utils/scripts/pdebug                          |     7 +
 utils/scripts/plotklocs                       |    88 +
 utils/swig/dolfin-swig                        |   156 +
 utils/system/monitor                          |    42 +
 utils/tetgen/dolfin-tetgen                    |    36 +
 utils/vim/macros                              |     6 +
 utils/xml/convertall                          |    40 +
 1651 files changed, 769939 insertions(+)
 create mode 100644 .gitignore
 create mode 100644 .mailmap
 create mode 100644 AUTHORS
 create mode 100644 CMakeLists.txt
 create mode 100644 COPYING
 create mode 100644 COPYING.LESSER
 create mode 100644 ChangeLog
 create mode 100644 INSTALL
 create mode 100644 README.rst
 create mode 100644 bench/CMakeLists.txt
 create mode 100644 bench/README
 create mode 100644 bench/bench.py
 create mode 100644 bench/common/progress/cpp/CMakeLists.txt
 create mode 100644 bench/common/progress/cpp/main.cpp
 create mode 100644 bench/common/timing/cpp/CMakeLists.txt
 create mode 100644 bench/common/timing/cpp/main.cpp
 create mode 100644 bench/fem/assembly/cpp/CMakeLists.txt
 create mode 100644 bench/fem/assembly/cpp/forms.h
 create mode 100644 bench/fem/assembly/cpp/forms/Elasticity3D.h
 create mode 100644 bench/fem/assembly/cpp/forms/Elasticity3D.ufl
 create mode 100644 bench/fem/assembly/cpp/forms/NSEMomentum3D.h
 create mode 100644 bench/fem/assembly/cpp/forms/NSEMomentum3D.ufl
 create mode 100644 bench/fem/assembly/cpp/forms/Poisson2DP1.h
 create mode 100644 bench/fem/assembly/cpp/forms/Poisson2DP1.ufl
 create mode 100644 bench/fem/assembly/cpp/forms/Poisson2DP2.h
 create mode 100644 bench/fem/assembly/cpp/forms/Poisson2DP2.ufl
 create mode 100644 bench/fem/assembly/cpp/forms/Poisson2DP3.h
 create mode 100644 bench/fem/assembly/cpp/forms/Poisson2DP3.ufl
 create mode 100644 bench/fem/assembly/cpp/forms/StabStokes2D.h
 create mode 100644 bench/fem/assembly/cpp/forms/StabStokes2D.ufl
 create mode 100644 bench/fem/assembly/cpp/forms/THStokes2D.h
 create mode 100644 bench/fem/assembly/cpp/forms/THStokes2D.ufl
 create mode 100644 bench/fem/assembly/cpp/forms/compile.log
 create mode 100644 bench/fem/assembly/cpp/main.cpp
 create mode 100755 bench/fem/assembly/python/broken
 create mode 100644 bench/fem/convergence/cpp/CMakeLists.txt
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_1.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_1.h
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_1.ufl
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_2.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_2.h
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_2.ufl
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_3.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_3.h
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_3.ufl
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_4.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_4.h
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_4.ufl
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_5.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_5.h
 create mode 100644 bench/fem/convergence/cpp/Poisson2D_5.ufl
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_1.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_1.h
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_1.ufl
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_2.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_2.h
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_2.ufl
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_3.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_3.h
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_3.ufl
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_4.cpp
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_4.h
 create mode 100644 bench/fem/convergence/cpp/Poisson3D_4.ufl
 create mode 100644 bench/fem/convergence/cpp/README
 create mode 100644 bench/fem/convergence/cpp/compile.log
 create mode 100644 bench/fem/convergence/cpp/main.cpp
 create mode 100755 bench/fem/jit/python/bench_fem_jit_python
 create mode 100644 bench/fem/multicore/cpp/CMakeLists.txt
 create mode 100644 bench/fem/multicore/cpp/NavierStokes.h
 create mode 100644 bench/fem/multicore/cpp/NavierStokes.ufl
 create mode 100644 bench/fem/multicore/cpp/Poisson.h
 create mode 100644 bench/fem/multicore/cpp/Poisson.ufl
 create mode 100644 bench/fem/multicore/cpp/compile.log
 create mode 100644 bench/fem/multicore/cpp/main.cpp
 create mode 100644 bench/fem/speedup/cpp/CMakeLists.txt
 create mode 100644 bench/fem/speedup/cpp/Poisson.h
 create mode 100644 bench/fem/speedup/cpp/Poisson.ufl
 create mode 100644 bench/fem/speedup/cpp/README
 create mode 100755 bench/fem/speedup/cpp/analyse-bench
 create mode 100644 bench/fem/speedup/cpp/assemble-poisson.cpp
 create mode 100755 bench/fem/speedup/cpp/bench_fem_speedup_cpp
 create mode 100755 bench/fem/speedup/cpp/clean.sh
 create mode 100644 bench/fem/speedup/cpp/compile.log
 create mode 100644 bench/fem/speedup/cpp/solve-poisson.cpp
 create mode 100755 bench/fem/speedup/cpp/submit-bench
 create mode 100644 bench/function/evaluation/cpp/CMakeLists.txt
 create mode 100644 bench/function/evaluation/cpp/P1.h
 create mode 100644 bench/function/evaluation/cpp/P1.ufl
 create mode 100644 bench/function/evaluation/cpp/compile.log
 create mode 100644 bench/function/evaluation/cpp/main.cpp
 create mode 100755 bench/function/extrapolation/python/bench_function_extrapolation_python
 create mode 100755 bench/function/interpolation/python/bench_function_interpolation_python
 create mode 100644 bench/geometry/bounding_box_tree_build/cpp/CMakeLists.txt
 create mode 100644 bench/geometry/bounding_box_tree_build/cpp/main.cpp
 create mode 100644 bench/geometry/bounding_box_tree_compute_closest_entity/cpp/CMakeLists.txt
 create mode 100644 bench/geometry/bounding_box_tree_compute_closest_entity/cpp/main.cpp
 create mode 100644 bench/geometry/bounding_box_tree_compute_entity_collisions/cpp/CMakeLists.txt
 create mode 100644 bench/geometry/bounding_box_tree_compute_entity_collisions/cpp/main.cpp
 create mode 100755 bench/la/cusp/python/bench_la_cusp_python
 create mode 100644 bench/la/vector/access/cpp/CMakeLists.txt
 create mode 100644 bench/la/vector/access/cpp/main.cpp
 create mode 100644 bench/la/vector/assignment/cpp/CMakeLists.txt
 create mode 100644 bench/la/vector/assignment/cpp/main.cpp
 create mode 100644 bench/logs/bench.log
 create mode 100644 bench/logs/milestones.log
 create mode 100644 bench/mesh/iteration/cpp/CMakeLists.txt
 create mode 100644 bench/mesh/iteration/cpp/main.cpp
 create mode 100644 bench/mesh/refinement/cpp/CMakeLists.txt
 create mode 100644 bench/mesh/refinement/cpp/main.cpp
 create mode 100644 bench/mesh/topology/cpp/CMakeLists.txt
 create mode 100644 bench/mesh/topology/cpp/main.cpp
 create mode 100644 bench/mesh/unitcube/cpp/CMakeLists.txt
 create mode 100644 bench/mesh/unitcube/cpp/main.cpp
 create mode 100644 bench/plot.py
 create mode 100644 cmake/modules/CheckOpenMP.cmake
 create mode 100644 cmake/modules/CorrectWindowsPaths.cmake
 create mode 100644 cmake/modules/FindAMD.cmake
 create mode 100644 cmake/modules/FindBLAS.cmake
 create mode 100644 cmake/modules/FindBLASHeader.cmake
 create mode 100644 cmake/modules/FindCGAL.cmake
 create mode 100644 cmake/modules/FindCHOLMOD.cmake
 create mode 100644 cmake/modules/FindCppUnit.cmake
 create mode 100644 cmake/modules/FindEigen3.cmake
 create mode 100644 cmake/modules/FindGMP.cmake
 create mode 100644 cmake/modules/FindLAPACK.cmake
 create mode 100644 cmake/modules/FindMPI.cmake
 create mode 100644 cmake/modules/FindMTL4.cmake
 create mode 100644 cmake/modules/FindNumPy.cmake
 create mode 100644 cmake/modules/FindPETSc.cmake
 create mode 100644 cmake/modules/FindPETSc4py.cmake
 create mode 100644 cmake/modules/FindPaStiX.cmake
 create mode 100644 cmake/modules/FindParMETIS.cmake
 create mode 100644 cmake/modules/FindSCOTCH.cmake
 create mode 100644 cmake/modules/FindSLEPc.cmake
 create mode 100644 cmake/modules/FindSphinx.cmake
 create mode 100644 cmake/modules/FindUMFPACK.cmake
 create mode 100644 cmake/modules/ResolveCompilerPaths.cmake
 create mode 100644 cmake/modules/language_support_v2.cmake
 create mode 100644 cmake/post-install/CMakeLists.txt
 create mode 100644 cmake/scripts/codeexamples.py
 create mode 100644 cmake/scripts/codesnippets.py
 create mode 100755 cmake/scripts/copy-swig-files
 create mode 100755 cmake/scripts/copy-test-demo-data
 create mode 100755 cmake/scripts/download-demo-data
 create mode 100755 cmake/scripts/generate-all
 create mode 100755 cmake/scripts/generate-cmakefiles
 create mode 100755 cmake/scripts/generate-form-files
 create mode 100755 cmake/scripts/generate-swig-docstrings
 create mode 100755 cmake/scripts/generate-swig-interface
 create mode 100644 cmake/templates/DOLFINConfig.cmake.in
 create mode 100644 cmake/templates/DOLFINConfigVersion.cmake.in
 create mode 100644 cmake/templates/UseDOLFIN.cmake.in
 create mode 100644 cmake/templates/cmake_uninstall.cmake.in
 create mode 100644 cmake/templates/dolfin-config-version.cmake.in
 create mode 100644 cmake/templates/dolfin-config.cmake.in
 create mode 100644 cmake/templates/dolfin-get-demos.in
 create mode 100644 cmake/templates/dolfin-version.in
 create mode 100644 cmake/templates/dolfin.conf.in
 create mode 100644 cmake/templates/dolfin.pc.in
 create mode 100644 data/README
 create mode 100644 demo/CMakeLists.txt
 create mode 100755 demo/cmake.local
 create mode 100644 demo/documented/auto-adaptive-poisson/common.txt
 create mode 100644 demo/documented/auto-adaptive-poisson/cpp/AdaptivePoisson.h
 create mode 100644 demo/documented/auto-adaptive-poisson/cpp/AdaptivePoisson.ufl
 create mode 100644 demo/documented/auto-adaptive-poisson/cpp/CMakeLists.txt
 create mode 100644 demo/documented/auto-adaptive-poisson/cpp/compile.log
 create mode 100644 demo/documented/auto-adaptive-poisson/cpp/documentation.rst
 create mode 100644 demo/documented/auto-adaptive-poisson/cpp/main.cpp
 create mode 100644 demo/documented/auto-adaptive-poisson/python/demo_auto-adaptive_poisson.py
 create mode 100644 demo/documented/auto-adaptive-poisson/python/documentation.rst
 create mode 100644 demo/documented/auto-adaptive-poisson/u_refined.png
 create mode 100644 demo/documented/auto-adaptive-poisson/u_unrefined.png
 create mode 100644 demo/documented/bcs/aneurysm.xml.gz
 create mode 100644 demo/documented/bcs/common.txt
 create mode 100644 demo/documented/bcs/cpp/CMakeLists.txt
 create mode 100644 demo/documented/bcs/cpp/Poisson.h
 create mode 100644 demo/documented/bcs/cpp/Poisson.ufl
 create mode 100644 demo/documented/bcs/cpp/compile.log
 create mode 100644 demo/documented/bcs/cpp/documentation.rst
 create mode 100644 demo/documented/bcs/cpp/main.cpp
 create mode 100644 demo/documented/bcs/demo_bcs.png
 create mode 100644 demo/documented/bcs/python/demo_bcs.py
 create mode 100644 demo/documented/bcs/python/documentation.rst
 create mode 100644 demo/documented/biharmonic/biharmonic_u.png
 create mode 100644 demo/documented/biharmonic/common.txt
 create mode 100644 demo/documented/biharmonic/cpp/Biharmonic.h
 create mode 100644 demo/documented/biharmonic/cpp/Biharmonic.ufl
 create mode 100644 demo/documented/biharmonic/cpp/CMakeLists.txt
 create mode 100644 demo/documented/biharmonic/cpp/compile.log
 create mode 100644 demo/documented/biharmonic/cpp/documentation.rst
 create mode 100644 demo/documented/biharmonic/cpp/main.cpp
 create mode 100644 demo/documented/biharmonic/python/demo_biharmonic.py
 create mode 100644 demo/documented/biharmonic/python/documentation.rst
 create mode 100644 demo/documented/built-in_meshes/common.txt
 create mode 100644 demo/documented/built-in_meshes/cpp/CMakeLists.txt
 create mode 100644 demo/documented/built-in_meshes/cpp/documentation.rst
 create mode 100644 demo/documented/built-in_meshes/cpp/main.cpp
 create mode 100644 demo/documented/built-in_meshes/python/boxmesh.png
 create mode 100644 demo/documented/built-in_meshes/python/demo_built-in.py
 create mode 100644 demo/documented/built-in_meshes/python/documentation.rst
 create mode 100644 demo/documented/built-in_meshes/python/rectanglemesh.png
 create mode 100644 demo/documented/built-in_meshes/python/rectanglemesh_left_right.png
 create mode 100644 demo/documented/built-in_meshes/python/unitcubemesh.png
 create mode 100644 demo/documented/built-in_meshes/python/unitintervalmesh.png
 create mode 100644 demo/documented/built-in_meshes/python/unitsquaremesh.png
 create mode 100644 demo/documented/built-in_meshes/python/unitsquaremesh_crossed.png
 create mode 100644 demo/documented/built-in_meshes/python/unitsquaremesh_left.png
 create mode 100644 demo/documented/built-in_meshes/python/unitsquaremesh_left_right.png
 create mode 100644 demo/documented/cahn-hilliard/cahn-hilliard_c.png
 create mode 100644 demo/documented/cahn-hilliard/common.txt
 create mode 100644 demo/documented/cahn-hilliard/cpp/CMakeLists.txt
 create mode 100644 demo/documented/cahn-hilliard/cpp/CahnHilliard2D.cpp
 create mode 100644 demo/documented/cahn-hilliard/cpp/CahnHilliard2D.h
 create mode 100644 demo/documented/cahn-hilliard/cpp/CahnHilliard2D.ufl
 create mode 100644 demo/documented/cahn-hilliard/cpp/CahnHilliard3D.cpp
 create mode 100644 demo/documented/cahn-hilliard/cpp/CahnHilliard3D.h
 create mode 100644 demo/documented/cahn-hilliard/cpp/CahnHilliard3D.ufl
 create mode 100644 demo/documented/cahn-hilliard/cpp/compile.log
 create mode 100644 demo/documented/cahn-hilliard/cpp/documentation.rst
 create mode 100644 demo/documented/cahn-hilliard/cpp/main.cpp
 create mode 100644 demo/documented/cahn-hilliard/python/demo_cahn-hilliard.py
 create mode 100644 demo/documented/cahn-hilliard/python/documentation.rst
 create mode 100644 demo/documented/csg-2D/common.txt
 create mode 100644 demo/documented/csg-2D/cpp/CMakeLists.txt
 create mode 100644 demo/documented/csg-2D/cpp/documentation.rst
 create mode 100644 demo/documented/csg-2D/cpp/main.cpp
 create mode 100644 demo/documented/csg-2D/csg_boundary.png
 create mode 100644 demo/documented/csg-2D/csg_mesh.png
 create mode 100644 demo/documented/csg-2D/python/demo_csg_2D.py
 create mode 100644 demo/documented/csg-2D/python/documentation.rst
 create mode 100644 demo/documented/csg-3D/common.txt
 create mode 100644 demo/documented/csg-3D/cpp/CMakeLists.txt
 create mode 100644 demo/documented/csg-3D/cpp/documentation.rst
 create mode 100644 demo/documented/csg-3D/cpp/main.cpp
 create mode 100644 demo/documented/csg-3D/csg3D_boundary.png
 create mode 100644 demo/documented/csg-3D/csg3D_mesh.png
 create mode 100644 demo/documented/csg-3D/python/demo_csg-3D.py
 create mode 100644 demo/documented/csg-3D/python/documentation.rst
 create mode 100644 demo/documented/eigenvalue/box_with_dent.xml.gz
 create mode 100644 demo/documented/eigenvalue/common.txt
 create mode 100644 demo/documented/eigenvalue/cpp/CMakeLists.txt
 create mode 100644 demo/documented/eigenvalue/cpp/StiffnessMatrix.h
 create mode 100644 demo/documented/eigenvalue/cpp/StiffnessMatrix.ufl
 create mode 100644 demo/documented/eigenvalue/cpp/compile.log
 create mode 100644 demo/documented/eigenvalue/cpp/documentation.rst
 create mode 100644 demo/documented/eigenvalue/cpp/main.cpp
 create mode 100644 demo/documented/eigenvalue/eigenvalue_x.png
 create mode 100644 demo/documented/eigenvalue/python/demo_eigenvalue.py
 create mode 100644 demo/documented/eigenvalue/python/documentation.rst
 create mode 100644 demo/documented/hyperelasticity/common.txt
 create mode 100644 demo/documented/hyperelasticity/cpp/CMakeLists.txt
 create mode 100644 demo/documented/hyperelasticity/cpp/HyperElasticity.h
 create mode 100644 demo/documented/hyperelasticity/cpp/HyperElasticity.ufl
 create mode 100644 demo/documented/hyperelasticity/cpp/compile.log
 create mode 100644 demo/documented/hyperelasticity/cpp/documentation.rst
 create mode 100644 demo/documented/hyperelasticity/cpp/main.cpp
 create mode 100644 demo/documented/hyperelasticity/hyperelasticity_u0.png
 create mode 100644 demo/documented/hyperelasticity/hyperelasticity_u1.png
 create mode 100644 demo/documented/hyperelasticity/python/demo_hyperelasticity.py
 create mode 100644 demo/documented/hyperelasticity/python/documentation.rst
 create mode 100644 demo/documented/mesh-generation/common.txt
 create mode 100644 demo/documented/mesh-generation/cpp/README
 create mode 100644 demo/documented/mesh-generation/cpp/documentation.rst
 create mode 100644 demo/documented/mesh-generation/cube.off
 create mode 100644 demo/documented/mesh-generation/python/demo_mesh_generation.py
 create mode 100644 demo/documented/mesh-generation/python/documentation.rst
 create mode 100644 demo/documented/mesh-generation/python/plot_cubemesh.png
 create mode 100644 demo/documented/mesh-generation/python/plot_polygonmesh.png
 create mode 100644 demo/documented/mesh-generation/python/plot_tetrahedronmesh.png
 create mode 100644 demo/documented/mesh-generation/tetrahedron.off
 create mode 100644 demo/documented/mixed-poisson-dual/common.txt
 create mode 100644 demo/documented/mixed-poisson-dual/cpp/CMakeLists.txt
 create mode 100644 demo/documented/mixed-poisson-dual/cpp/MixedPoissonDual.h
 create mode 100644 demo/documented/mixed-poisson-dual/cpp/MixedPoissonDual.ufl
 create mode 100644 demo/documented/mixed-poisson-dual/cpp/compile.log
 create mode 100644 demo/documented/mixed-poisson-dual/cpp/documentation.rst
 create mode 100644 demo/documented/mixed-poisson-dual/cpp/main.cpp
 create mode 100644 demo/documented/mixed-poisson-dual/mixed-poisson-dual_sigma.png
 create mode 100644 demo/documented/mixed-poisson-dual/mixed-poisson-dual_u.png
 create mode 100644 demo/documented/mixed-poisson-dual/python/demo_mixed-poisson-dual.py
 create mode 100644 demo/documented/mixed-poisson-dual/python/documentation.rst
 create mode 100644 demo/documented/mixed-poisson/common.txt
 create mode 100644 demo/documented/mixed-poisson/cpp/CMakeLists.txt
 create mode 100644 demo/documented/mixed-poisson/cpp/MixedPoisson.h
 create mode 100644 demo/documented/mixed-poisson/cpp/MixedPoisson.ufl
 create mode 100644 demo/documented/mixed-poisson/cpp/compile.log
 create mode 100644 demo/documented/mixed-poisson/cpp/documentation.rst
 create mode 100644 demo/documented/mixed-poisson/cpp/main.cpp
 create mode 100644 demo/documented/mixed-poisson/mixed-poisson_sigma.png
 create mode 100644 demo/documented/mixed-poisson/mixed-poisson_u.png
 create mode 100644 demo/documented/mixed-poisson/python/demo_mixed-poisson.py
 create mode 100644 demo/documented/mixed-poisson/python/documentation.rst
 create mode 100644 demo/documented/navier-stokes/common.txt
 create mode 100644 demo/documented/navier-stokes/cpp/CMakeLists.txt
 create mode 100644 demo/documented/navier-stokes/cpp/PressureUpdate.h
 create mode 100644 demo/documented/navier-stokes/cpp/PressureUpdate.ufl
 create mode 100644 demo/documented/navier-stokes/cpp/TentativeVelocity.h
 create mode 100644 demo/documented/navier-stokes/cpp/TentativeVelocity.ufl
 create mode 100644 demo/documented/navier-stokes/cpp/VelocityUpdate.h
 create mode 100644 demo/documented/navier-stokes/cpp/VelocityUpdate.ufl
 create mode 100644 demo/documented/navier-stokes/cpp/compile.log
 create mode 100644 demo/documented/navier-stokes/cpp/documentation.rst
 create mode 100644 demo/documented/navier-stokes/cpp/main.cpp
 create mode 100644 demo/documented/navier-stokes/lshape.xml.gz
 create mode 100644 demo/documented/navier-stokes/navier-stokes_p.png
 create mode 100644 demo/documented/navier-stokes/navier-stokes_u.png
 create mode 100644 demo/documented/navier-stokes/python/demo_navier-stokes.py
 create mode 100644 demo/documented/navier-stokes/python/documentation.rst
 create mode 100644 demo/documented/neumann-poisson/common.txt
 create mode 100644 demo/documented/neumann-poisson/cpp/CMakeLists.txt
 create mode 100644 demo/documented/neumann-poisson/cpp/Poisson.h
 create mode 100644 demo/documented/neumann-poisson/cpp/Poisson.ufl
 create mode 100644 demo/documented/neumann-poisson/cpp/compile.log
 create mode 100644 demo/documented/neumann-poisson/cpp/documentation.rst
 create mode 100644 demo/documented/neumann-poisson/cpp/main.cpp
 create mode 100644 demo/documented/neumann-poisson/neumann-poisson_u.png
 create mode 100644 demo/documented/neumann-poisson/python/demo_neumann-poisson.py
 create mode 100644 demo/documented/neumann-poisson/python/documentation.rst
 create mode 100644 demo/documented/nonlinear-poisson/common.txt
 create mode 100644 demo/documented/nonlinear-poisson/cpp/CMakeLists.txt
 create mode 100644 demo/documented/nonlinear-poisson/cpp/NonlinearPoisson.h
 create mode 100644 demo/documented/nonlinear-poisson/cpp/NonlinearPoisson.ufl
 create mode 100644 demo/documented/nonlinear-poisson/cpp/compile.log
 create mode 100644 demo/documented/nonlinear-poisson/cpp/documentation.rst
 create mode 100644 demo/documented/nonlinear-poisson/cpp/main.cpp
 create mode 100644 demo/documented/nonlinear-poisson/cpp/plot.py
 create mode 100644 demo/documented/nonlinear-poisson/plot_u.png
 create mode 100644 demo/documented/nonlinear-poisson/plot_u_gradient.png
 create mode 100644 demo/documented/nonlinear-poisson/python/demo_nonlinear-poisson.py
 create mode 100644 demo/documented/nonlinear-poisson/python/documentation.rst
 create mode 100644 demo/documented/periodic/common.txt
 create mode 100644 demo/documented/periodic/cpp/CMakeLists.txt
 create mode 100644 demo/documented/periodic/cpp/Poisson.h
 create mode 100644 demo/documented/periodic/cpp/Poisson.ufl
 create mode 100644 demo/documented/periodic/cpp/compile.log
 create mode 100644 demo/documented/periodic/cpp/documentation.rst
 create mode 100644 demo/documented/periodic/cpp/main.cpp
 create mode 100644 demo/documented/periodic/plot_u.png
 create mode 100644 demo/documented/periodic/python/demo_periodic.py
 create mode 100644 demo/documented/periodic/python/documentation.rst
 create mode 100644 demo/documented/poisson/common.txt
 create mode 100644 demo/documented/poisson/cpp/CMakeLists.txt
 create mode 100644 demo/documented/poisson/cpp/Poisson.h
 create mode 100644 demo/documented/poisson/cpp/Poisson.ufl
 create mode 100644 demo/documented/poisson/cpp/compile.log
 create mode 100644 demo/documented/poisson/cpp/documentation.rst
 create mode 100644 demo/documented/poisson/cpp/main.cpp
 create mode 100644 demo/documented/poisson/poisson_u.png
 create mode 100644 demo/documented/poisson/python/demo_poisson.py
 create mode 100644 demo/documented/poisson/python/documentation.rst
 create mode 100644 demo/documented/singular-poisson/common.txt
 create mode 100644 demo/documented/singular-poisson/cpp/CMakeLists.txt
 create mode 100644 demo/documented/singular-poisson/cpp/Poisson.h
 create mode 100644 demo/documented/singular-poisson/cpp/Poisson.ufl
 create mode 100644 demo/documented/singular-poisson/cpp/compile.log
 create mode 100644 demo/documented/singular-poisson/cpp/documentation.rst
 create mode 100644 demo/documented/singular-poisson/cpp/main.cpp
 create mode 100644 demo/documented/singular-poisson/python/demo_singular-poisson.py
 create mode 100644 demo/documented/singular-poisson/python/documentation.rst
 create mode 100644 demo/documented/singular-poisson/singular_u.png
 create mode 100644 demo/documented/stokes-iterative/common.txt
 create mode 100644 demo/documented/stokes-iterative/cpp/CMakeLists.txt
 create mode 100644 demo/documented/stokes-iterative/cpp/Stokes.h
 create mode 100644 demo/documented/stokes-iterative/cpp/Stokes.ufl
 create mode 100644 demo/documented/stokes-iterative/cpp/StokesPreconditioner.h
 create mode 100644 demo/documented/stokes-iterative/cpp/StokesPreconditioner.ufl
 create mode 100644 demo/documented/stokes-iterative/cpp/compile.log
 create mode 100644 demo/documented/stokes-iterative/cpp/documentation.rst
 create mode 100644 demo/documented/stokes-iterative/cpp/main.cpp
 create mode 100644 demo/documented/stokes-iterative/python/demo_stokes-iterative.py
 create mode 100644 demo/documented/stokes-iterative/python/documentation.rst
 create mode 100644 demo/documented/stokes-mini/common.txt
 create mode 100644 demo/documented/stokes-mini/cpp/README
 create mode 100644 demo/documented/stokes-mini/cpp/documentation.rst
 create mode 100644 demo/documented/stokes-mini/dolfin_fine.xml.gz
 create mode 100644 demo/documented/stokes-mini/dolfin_fine_subdomains.xml.gz
 create mode 100644 demo/documented/stokes-mini/plot_p.png
 create mode 100644 demo/documented/stokes-mini/plot_u.png
 create mode 100644 demo/documented/stokes-mini/python/demo_stokes-mini.py
 create mode 100644 demo/documented/stokes-mini/python/documentation.rst
 create mode 100644 demo/documented/stokes-stabilized/common.txt
 create mode 100644 demo/documented/stokes-stabilized/cpp/CMakeLists.txt
 create mode 100644 demo/documented/stokes-stabilized/cpp/Stokes.h
 create mode 100644 demo/documented/stokes-stabilized/cpp/Stokes.ufl
 create mode 100644 demo/documented/stokes-stabilized/cpp/compile.log
 create mode 100644 demo/documented/stokes-stabilized/cpp/documentation.rst
 create mode 100644 demo/documented/stokes-stabilized/cpp/main.cpp
 create mode 100644 demo/documented/stokes-stabilized/cpp/plot.py
 create mode 100644 demo/documented/stokes-stabilized/dolfin_fine.xml.gz
 create mode 100644 demo/documented/stokes-stabilized/dolfin_fine_subdomains.xml.gz
 create mode 100644 demo/documented/stokes-stabilized/plot_p.png
 create mode 100644 demo/documented/stokes-stabilized/plot_u.png
 create mode 100644 demo/documented/stokes-stabilized/python/demo_stokes-stabilized.py
 create mode 100644 demo/documented/stokes-stabilized/python/documentation.rst
 create mode 100644 demo/documented/stokes-taylor-hood/common.txt
 create mode 100644 demo/documented/stokes-taylor-hood/cpp/CMakeLists.txt
 create mode 100644 demo/documented/stokes-taylor-hood/cpp/Stokes.h
 create mode 100644 demo/documented/stokes-taylor-hood/cpp/Stokes.ufl
 create mode 100644 demo/documented/stokes-taylor-hood/cpp/compile.log
 create mode 100644 demo/documented/stokes-taylor-hood/cpp/documentation.rst
 create mode 100644 demo/documented/stokes-taylor-hood/cpp/main.cpp
 create mode 100644 demo/documented/stokes-taylor-hood/cpp/plot.py
 create mode 100644 demo/documented/stokes-taylor-hood/dolfin_fine.xml.gz
 create mode 100644 demo/documented/stokes-taylor-hood/dolfin_fine_subdomains.xml.gz
 create mode 100644 demo/documented/stokes-taylor-hood/plot_mesh.png
 create mode 100644 demo/documented/stokes-taylor-hood/plot_mesh_boundaries.png
 create mode 100644 demo/documented/stokes-taylor-hood/plot_p.png
 create mode 100644 demo/documented/stokes-taylor-hood/plot_u.png
 create mode 100644 demo/documented/stokes-taylor-hood/python/demo_stokes-taylorhood.py
 create mode 100644 demo/documented/stokes-taylor-hood/python/documentation.rst
 create mode 100644 demo/documented/subdomains-poisson/common.txt
 create mode 100644 demo/documented/subdomains-poisson/cpp/README
 create mode 100644 demo/documented/subdomains-poisson/cpp/documentation.rst
 create mode 100644 demo/documented/subdomains-poisson/python/demo_subdomains-poisson.py
 create mode 100644 demo/documented/subdomains-poisson/python/documentation.rst
 create mode 100644 demo/documented/subdomains/common.txt
 create mode 100644 demo/documented/subdomains/cpp/CMakeLists.txt
 create mode 100644 demo/documented/subdomains/cpp/documentation.rst
 create mode 100644 demo/documented/subdomains/cpp/main.cpp
 create mode 100644 demo/documented/subdomains/dolfin_fine.xml.gz
 create mode 100644 demo/documented/subdomains/plot_subdomains.png
 create mode 100644 demo/documented/subdomains/python/demo_subdomains.py
 create mode 100644 demo/documented/subdomains/python/documentation.rst
 create mode 100644 demo/documented/tensor-weighted-poisson/common.txt
 create mode 100644 demo/documented/tensor-weighted-poisson/cpp/README
 create mode 100644 demo/documented/tensor-weighted-poisson/cpp/documentation.rst
 create mode 100644 demo/documented/tensor-weighted-poisson/python/demo_tensorweighted-poisson.py
 create mode 100644 demo/documented/tensor-weighted-poisson/python/documentation.rst
 create mode 100644 demo/documented/tensor-weighted-poisson/python/generate_data.py
 create mode 100644 demo/documented/tensor-weighted-poisson/tensorweighted-poisson_u.png
 create mode 100644 demo/documented/tensor-weighted-poisson/unitsquare_32_32.xml.gz
 create mode 100644 demo/documented/tensor-weighted-poisson/unitsquare_32_32_c00.xml.gz
 create mode 100644 demo/documented/tensor-weighted-poisson/unitsquare_32_32_c01.xml.gz
 create mode 100644 demo/documented/tensor-weighted-poisson/unitsquare_32_32_c11.xml.gz
 create mode 100644 demo/undocumented/adaptive-poisson/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/adaptive-poisson/cpp/README
 create mode 100755 demo/undocumented/adaptive-poisson/python/demo_adaptive-poisson.py
 create mode 100644 demo/undocumented/advection-diffusion/cpp/AdvectionDiffusion.h
 create mode 100644 demo/undocumented/advection-diffusion/cpp/AdvectionDiffusion.ufl
 create mode 100644 demo/undocumented/advection-diffusion/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/advection-diffusion/cpp/Velocity.h
 create mode 100644 demo/undocumented/advection-diffusion/cpp/Velocity.ufl
 create mode 100644 demo/undocumented/advection-diffusion/cpp/compile.log
 create mode 100644 demo/undocumented/advection-diffusion/cpp/main.cpp
 create mode 100644 demo/undocumented/advection-diffusion/dolfin_fine.xml.gz
 create mode 100644 demo/undocumented/advection-diffusion/dolfin_fine_subdomains.xml.gz
 create mode 100644 demo/undocumented/advection-diffusion/dolfin_fine_velocity.xml.gz
 create mode 100644 demo/undocumented/advection-diffusion/python/demo_advection-diffusion.py
 create mode 100644 demo/undocumented/ale/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/ale/cpp/main.cpp
 create mode 100644 demo/undocumented/ale/python/demo_ale.py
 create mode 100644 demo/undocumented/auto-adaptive-navier-stokes/channel_with_flap.xml.gz
 create mode 100644 demo/undocumented/auto-adaptive-navier-stokes/cpp/AdaptiveNavierStokes.h
 create mode 100644 demo/undocumented/auto-adaptive-navier-stokes/cpp/AdaptiveNavierStokes.ufl
 create mode 100644 demo/undocumented/auto-adaptive-navier-stokes/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/auto-adaptive-navier-stokes/cpp/compile.log
 create mode 100644 demo/undocumented/auto-adaptive-navier-stokes/cpp/main.cpp
 create mode 100644 demo/undocumented/auto-adaptive-navier-stokes/python/demo_auto-adaptive-navier-stokes.py
 create mode 100644 demo/undocumented/block-matrix/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/block-matrix/cpp/StiffnessMatrix.h
 create mode 100644 demo/undocumented/block-matrix/cpp/StiffnessMatrix.ufl
 create mode 100644 demo/undocumented/block-matrix/cpp/compile.log
 create mode 100644 demo/undocumented/block-matrix/cpp/main.cpp
 create mode 100644 demo/undocumented/block-matrix/python/demo_block-matrix.py
 create mode 100644 demo/undocumented/built-in/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/built-in/cpp/main.cpp
 create mode 100644 demo/undocumented/built-in/python/demo_built-in.py
 create mode 100644 demo/undocumented/collision-detection/python/demo_collision-detection.py
 create mode 100644 demo/undocumented/coloring/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/coloring/cpp/main.cpp
 create mode 100644 demo/undocumented/coloring/python/demo_coloring.py
 create mode 100644 demo/undocumented/compiled-extension-module/cpp/README
 create mode 100644 demo/undocumented/compiled-extension-module/python/Probe/Probe.cpp
 create mode 100644 demo/undocumented/compiled-extension-module/python/Probe/Probe.h
 create mode 100644 demo/undocumented/compiled-extension-module/python/demo_compiled-extension-module.py
 create mode 100644 demo/undocumented/conditional/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/conditional/cpp/Conditional.h
 create mode 100644 demo/undocumented/conditional/cpp/Conditional.ufl
 create mode 100644 demo/undocumented/conditional/cpp/compile.log
 create mode 100644 demo/undocumented/conditional/cpp/main.cpp
 create mode 100644 demo/undocumented/conditional/python/demo_conditional.py
 create mode 100644 demo/undocumented/contact-vi-snes/circle_yplane.geo
 create mode 100644 demo/undocumented/contact-vi-snes/circle_yplane.xml.gz
 create mode 100644 demo/undocumented/contact-vi-snes/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/contact-vi-snes/cpp/HyperElasticity.h
 create mode 100644 demo/undocumented/contact-vi-snes/cpp/HyperElasticity.ufl
 create mode 100644 demo/undocumented/contact-vi-snes/cpp/compile.log
 create mode 100644 demo/undocumented/contact-vi-snes/cpp/main.cpp
 create mode 100644 demo/undocumented/contact-vi-snes/python/demo_contact-vi-snes.py
 create mode 100644 demo/undocumented/contact-vi-tao/circle_yplane.xml.gz
 create mode 100644 demo/undocumented/contact-vi-tao/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/contact-vi-tao/cpp/Elasticity.h
 create mode 100644 demo/undocumented/contact-vi-tao/cpp/Elasticity.ufl
 create mode 100644 demo/undocumented/contact-vi-tao/cpp/compile.log
 create mode 100644 demo/undocumented/contact-vi-tao/cpp/main.cpp
 create mode 100644 demo/undocumented/contact-vi-tao/python/demo_contact-vi-tao.py
 create mode 100644 demo/undocumented/curl-curl/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/curl-curl/cpp/CurrentDensity.h
 create mode 100644 demo/undocumented/curl-curl/cpp/CurrentDensity.ufl
 create mode 100644 demo/undocumented/curl-curl/cpp/EddyCurrents.h
 create mode 100644 demo/undocumented/curl-curl/cpp/EddyCurrents.ufl
 create mode 100644 demo/undocumented/curl-curl/cpp/compile.log
 create mode 100644 demo/undocumented/curl-curl/cpp/main.cpp
 create mode 100644 demo/undocumented/curl-curl/python/demo_curl-curl.py
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.h
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.ufl
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/Projection.h
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/Projection.ufl
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/Velocity.h
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/Velocity.ufl
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/compile.log
 create mode 100644 demo/undocumented/dg-advection-diffusion/cpp/main.cpp
 create mode 100644 demo/undocumented/dg-advection-diffusion/python/demo_dg-advection-diffusion.py
 create mode 100644 demo/undocumented/dg-advection-diffusion/unitsquare_64_64.xml.gz
 create mode 100644 demo/undocumented/dg-advection-diffusion/unitsquare_64_64_velocity.xml.gz
 create mode 100644 demo/undocumented/dg-poisson/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/dg-poisson/cpp/Poisson.h
 create mode 100644 demo/undocumented/dg-poisson/cpp/Poisson.ufl
 create mode 100644 demo/undocumented/dg-poisson/cpp/compile.log
 create mode 100644 demo/undocumented/dg-poisson/cpp/main.cpp
 create mode 100644 demo/undocumented/dg-poisson/cpp/plot.py
 create mode 100644 demo/undocumented/dg-poisson/python/demo_dg-poisson.py
 create mode 100644 demo/undocumented/elasticity/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/elasticity/cpp/Elasticity.h
 create mode 100644 demo/undocumented/elasticity/cpp/Elasticity.ufl
 create mode 100644 demo/undocumented/elasticity/cpp/compile.log
 create mode 100644 demo/undocumented/elasticity/cpp/main.cpp
 create mode 100644 demo/undocumented/elasticity/cpp/plot.py
 create mode 100644 demo/undocumented/elasticity/gear.xml.gz
 create mode 100644 demo/undocumented/elasticity/python/demo_elasticity.py
 create mode 100644 demo/undocumented/elastodynamics/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/elastodynamics/cpp/DG0_eps_xx.h
 create mode 100644 demo/undocumented/elastodynamics/cpp/DG0_eps_xx.ufl
 create mode 100644 demo/undocumented/elastodynamics/cpp/ElastoDynamics.h
 create mode 100644 demo/undocumented/elastodynamics/cpp/ElastoDynamics.ufl
 create mode 100644 demo/undocumented/elastodynamics/cpp/compile.log
 create mode 100644 demo/undocumented/elastodynamics/cpp/main.cpp
 create mode 100644 demo/undocumented/elastodynamics/dolfin_fine.xml.gz
 create mode 100644 demo/undocumented/elastodynamics/python/demo_elastodynamics.py
 create mode 100644 demo/undocumented/elementplot/python/demo_elementplot.py
 create mode 100644 demo/undocumented/eval/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/eval/cpp/Projection.h
 create mode 100644 demo/undocumented/eval/cpp/Projection.ufl
 create mode 100644 demo/undocumented/eval/cpp/compile.log
 create mode 100644 demo/undocumented/eval/cpp/main.cpp
 create mode 100644 demo/undocumented/eval/python/demo_eval.py
 create mode 100644 demo/undocumented/extrapolation/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/extrapolation/cpp/P1.h
 create mode 100644 demo/undocumented/extrapolation/cpp/P1.ufl
 create mode 100644 demo/undocumented/extrapolation/cpp/P2.h
 create mode 100644 demo/undocumented/extrapolation/cpp/P2.ufl
 create mode 100644 demo/undocumented/extrapolation/cpp/compile.log
 create mode 100644 demo/undocumented/extrapolation/cpp/main.cpp
 create mode 100644 demo/undocumented/extrapolation/python/demo_extrapolation.py
 create mode 100644 demo/undocumented/functional/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/functional/cpp/EnergyNorm.h
 create mode 100644 demo/undocumented/functional/cpp/EnergyNorm.ufl
 create mode 100644 demo/undocumented/functional/cpp/compile.log
 create mode 100644 demo/undocumented/functional/cpp/main.cpp
 create mode 100644 demo/undocumented/functional/python/demo_functional.py
 create mode 100644 demo/undocumented/interpolation/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/interpolation/cpp/README
 create mode 100644 demo/undocumented/interpolation/python/demo_interpolation.py
 create mode 100644 demo/undocumented/lift-drag/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/lift-drag/cpp/Functionals.h
 create mode 100644 demo/undocumented/lift-drag/cpp/Functionals.ufl
 create mode 100644 demo/undocumented/lift-drag/cpp/README
 create mode 100644 demo/undocumented/lift-drag/cpp/compile.log
 create mode 100644 demo/undocumented/lift-drag/cpp/main.cpp
 create mode 100644 demo/undocumented/lift-drag/dolfin_fine.xml.gz
 create mode 100644 demo/undocumented/lift-drag/dolfin_fine_pressure.xml.gz
 create mode 100644 demo/undocumented/lift-drag/python/demo_lift-drag.py
 create mode 100644 demo/undocumented/mesh-quality/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/mesh-quality/cpp/main.cpp
 create mode 100644 demo/undocumented/mesh-quality/dolfin_fine.xml.gz
 create mode 100644 demo/undocumented/mesh-quality/python/demo_mesh-quality.py
 create mode 100644 demo/undocumented/meshfunction-refinement/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/meshfunction-refinement/cpp/main.cpp
 create mode 100644 demo/undocumented/mixed-poisson-sphere/python/demo_mixed-poisson-sphere.py
 create mode 100644 demo/undocumented/mixed-poisson-sphere/sphere_16.xml.gz
 create mode 100644 demo/undocumented/multistage-solver/cpp/README
 create mode 100644 demo/undocumented/multistage-solver/dolfin_fine.xml.gz
 create mode 100644 demo/undocumented/multistage-solver/dolfin_fine_subdomains.xml.gz
 create mode 100644 demo/undocumented/multistage-solver/dolfin_fine_velocity.xml.gz
 create mode 100644 demo/undocumented/multistage-solver/python/demo_multi-stage-solver.py
 create mode 100644 demo/undocumented/nonmatching-interpolation/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/nonmatching-interpolation/cpp/P1.h
 create mode 100644 demo/undocumented/nonmatching-interpolation/cpp/P1.ufl
 create mode 100644 demo/undocumented/nonmatching-interpolation/cpp/P3.h
 create mode 100644 demo/undocumented/nonmatching-interpolation/cpp/P3.ufl
 create mode 100644 demo/undocumented/nonmatching-interpolation/cpp/compile.log
 create mode 100644 demo/undocumented/nonmatching-interpolation/cpp/main.cpp
 create mode 100644 demo/undocumented/nonmatching-interpolation/python/demo_nonmatching-interpolation.py
 create mode 100644 demo/undocumented/nonmatching-projection/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/nonmatching-projection/cpp/P1_projection.h
 create mode 100644 demo/undocumented/nonmatching-projection/cpp/P1_projection.ufl
 create mode 100644 demo/undocumented/nonmatching-projection/cpp/P3.h
 create mode 100644 demo/undocumented/nonmatching-projection/cpp/P3.ufl
 create mode 100644 demo/undocumented/nonmatching-projection/cpp/compile.log
 create mode 100644 demo/undocumented/nonmatching-projection/cpp/main.cpp
 create mode 100644 demo/undocumented/nonmatching-projection/python/demo_nonmatching-projection.py
 create mode 100644 demo/undocumented/optimization/python/demo_optimization.py
 create mode 100644 demo/undocumented/overlapping-regions/cpp/README
 create mode 100644 demo/undocumented/overlapping-regions/python/README
 create mode 100644 demo/undocumented/overlapping-regions/python/demo_overlapping-regions.py
 create mode 100644 demo/undocumented/parallel-refinement/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/parallel-refinement/cpp/main.cpp
 create mode 100644 demo/undocumented/parallel-refinement/python/demo_parallel-refinement.py
 create mode 100644 demo/undocumented/parameters/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/parameters/cpp/main.cpp
 create mode 100644 demo/undocumented/parameters/cpp/parameters.xml
 create mode 100644 demo/undocumented/parameters/python/demo_parameters.py
 create mode 100644 demo/undocumented/parameters/python/parameters.xml
 create mode 100644 demo/undocumented/petsc4py/python/demo_petsc4py.py
 create mode 100644 demo/undocumented/plot-qt/cpp/BoundaryMeshFunction.cpp
 create mode 100644 demo/undocumented/plot-qt/cpp/BoundaryMeshFunction.h
 create mode 100644 demo/undocumented/plot-qt/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/plot-qt/cpp/CoordLabel.cpp
 create mode 100644 demo/undocumented/plot-qt/cpp/CoordLabel.h
 create mode 100644 demo/undocumented/plot-qt/cpp/PlotWidget.cpp
 create mode 100644 demo/undocumented/plot-qt/cpp/PlotWidget.h
 create mode 100644 demo/undocumented/plot-qt/cpp/Plotter.cpp
 create mode 100644 demo/undocumented/plot-qt/cpp/Plotter.h
 create mode 100644 demo/undocumented/plot-qt/cpp/main.cpp
 create mode 100644 demo/undocumented/plot/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/plot/cpp/main.cpp
 create mode 100644 demo/undocumented/plot/dolfin_fine.xml.gz
 create mode 100644 demo/undocumented/plot/python/demo_plot.py
 create mode 100644 demo/undocumented/poisson1D-in-2D/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/poisson1D-in-2D/cpp/Poisson.h
 create mode 100644 demo/undocumented/poisson1D-in-2D/cpp/Poisson.ufl
 create mode 100644 demo/undocumented/poisson1D-in-2D/cpp/compile.log
 create mode 100644 demo/undocumented/poisson1D-in-2D/cpp/main.cpp
 create mode 100644 demo/undocumented/poisson1D-in-2D/python/demo_poisson1D-in-2D.py
 create mode 100644 demo/undocumented/poisson1D/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/poisson1D/cpp/Poisson.h
 create mode 100644 demo/undocumented/poisson1D/cpp/Poisson.ufl
 create mode 100644 demo/undocumented/poisson1D/cpp/compile.log
 create mode 100644 demo/undocumented/poisson1D/cpp/main.cpp
 create mode 100644 demo/undocumented/poisson1D/python/demo_poisson1D.py
 create mode 100644 demo/undocumented/projection-interpolation/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/projection-interpolation/cpp/README
 create mode 100644 demo/undocumented/projection-interpolation/python/demo_projection-interpolation.py
 create mode 100644 demo/undocumented/refinement/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/refinement/cpp/main.cpp
 create mode 100644 demo/undocumented/refinement/python/demo_refinement.py
 create mode 100644 demo/undocumented/restriction/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/restriction/cpp/Poisson.h
 create mode 100644 demo/undocumented/restriction/cpp/Poisson.ufl
 create mode 100644 demo/undocumented/restriction/cpp/compile.log
 create mode 100644 demo/undocumented/restriction/cpp/main.cpp
 create mode 100644 demo/undocumented/restriction/python/README
 create mode 100644 demo/undocumented/restriction/python/demo_restriction.py
 create mode 100644 demo/undocumented/smoothing/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/smoothing/cpp/README
 create mode 100644 demo/undocumented/smoothing/python/demo_smoothing.py
 create mode 100644 demo/undocumented/spatial-coordinates/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/spatial-coordinates/cpp/SpatialCoordinates.h
 create mode 100644 demo/undocumented/spatial-coordinates/cpp/SpatialCoordinates.ufl
 create mode 100644 demo/undocumented/spatial-coordinates/cpp/compile.log
 create mode 100644 demo/undocumented/spatial-coordinates/cpp/main.cpp
 create mode 100644 demo/undocumented/spatial-coordinates/python/demo_spatial-coordinates.py
 create mode 100644 demo/undocumented/special-functions/python/demo_special_functions.py
 create mode 100644 demo/undocumented/sub-function-assignment/cpp/README
 create mode 100644 demo/undocumented/sub-function-assignment/python/demo_sub-function-assignment.py
 create mode 100644 demo/undocumented/submesh/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/submesh/cpp/main.cpp
 create mode 100644 demo/undocumented/submesh/python/demo_submesh.py
 create mode 100644 demo/undocumented/sym-dirichlet-bc/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/sym-dirichlet-bc/cpp/Poisson.h
 create mode 100644 demo/undocumented/sym-dirichlet-bc/cpp/Poisson.ufl
 create mode 100644 demo/undocumented/sym-dirichlet-bc/cpp/compile.log
 create mode 100644 demo/undocumented/sym-dirichlet-bc/cpp/main.cpp
 create mode 100644 demo/undocumented/sym-dirichlet-bc/python/demo_sym-dirichlet-bc.py
 create mode 100644 demo/undocumented/time-series/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/time-series/cpp/main.cpp
 create mode 100644 demo/undocumented/time-series/python/demo_time-series.py
 create mode 100644 demo/undocumented/triangulate/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/triangulate/cpp/main.cpp
 create mode 100644 demo/undocumented/triangulate/python/demo_triangulate.py
 create mode 100644 demo/undocumented/trilinos/python/demo_trilinos.py
 create mode 100644 demo/undocumented/waveguide/cpp/CMakeLists.txt
 create mode 100644 demo/undocumented/waveguide/cpp/Forms.h
 create mode 100644 demo/undocumented/waveguide/cpp/Forms.py
 create mode 100644 demo/undocumented/waveguide/cpp/Forms.ufl
 create mode 100644 demo/undocumented/waveguide/cpp/compile.log
 create mode 100644 demo/undocumented/waveguide/cpp/main.cpp
 create mode 100644 demo/undocumented/waveguide/python/demo_waveguide.py
 create mode 100644 doc/CMakeLists.txt
 create mode 100644 doc/README
 create mode 100644 doc/copy_and_split_demo_doc.py
 create mode 100644 doc/generate_api_doc.py
 create mode 100644 doc/generate_main_index.py
 create mode 100644 doc/man/man1/dolfin-convert.1.gz
 create mode 100644 doc/man/man1/dolfin-order.1.gz
 create mode 100644 doc/man/man1/dolfin-plot.1.gz
 create mode 100644 doc/man/man1/dolfin-version.1.gz
 create mode 100644 doc/quick_reference_cpp.rst
 create mode 100644 doc/quick_reference_python.rst
 create mode 100644 doc/sphinx-common/Makefile
 create mode 100644 doc/sphinx-common/README
 create mode 100644 doc/sphinx-common/source/conf.py
 create mode 100644 doc/sphinx-common/source/index.rst
 create mode 100644 dolfin/CMakeLists.txt
 create mode 100644 dolfin/adaptivity/AdaptiveLinearVariationalSolver.cpp
 create mode 100644 dolfin/adaptivity/AdaptiveLinearVariationalSolver.h
 create mode 100644 dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.cpp
 create mode 100644 dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h
 create mode 100644 dolfin/adaptivity/ErrorControl.cpp
 create mode 100644 dolfin/adaptivity/ErrorControl.h
 create mode 100644 dolfin/adaptivity/Extrapolation.cpp
 create mode 100644 dolfin/adaptivity/Extrapolation.h
 create mode 100644 dolfin/adaptivity/GenericAdaptiveVariationalSolver.cpp
 create mode 100644 dolfin/adaptivity/GenericAdaptiveVariationalSolver.h
 create mode 100644 dolfin/adaptivity/GoalFunctional.cpp
 create mode 100644 dolfin/adaptivity/GoalFunctional.h
 create mode 100644 dolfin/adaptivity/LocalAssembler.cpp
 create mode 100644 dolfin/adaptivity/LocalAssembler.h
 create mode 100644 dolfin/adaptivity/TimeSeries.cpp
 create mode 100644 dolfin/adaptivity/TimeSeries.h
 create mode 100644 dolfin/adaptivity/TimeSeriesHDF5.cpp
 create mode 100644 dolfin/adaptivity/TimeSeriesHDF5.h
 create mode 100644 dolfin/adaptivity/adapt.cpp
 create mode 100644 dolfin/adaptivity/adapt.h
 create mode 100644 dolfin/adaptivity/adaptivesolve.cpp
 create mode 100644 dolfin/adaptivity/adaptivesolve.h
 create mode 100644 dolfin/adaptivity/dolfin_adaptivity.h
 create mode 100644 dolfin/adaptivity/marking.cpp
 create mode 100644 dolfin/adaptivity/marking.h
 create mode 100644 dolfin/ale/ALE.cpp
 create mode 100644 dolfin/ale/ALE.h
 create mode 100644 dolfin/ale/ALEType.h
 create mode 100644 dolfin/ale/HarmonicSmoothing.cpp
 create mode 100644 dolfin/ale/HarmonicSmoothing.h
 create mode 100644 dolfin/ale/MeshDisplacement.cpp
 create mode 100644 dolfin/ale/MeshDisplacement.h
 create mode 100644 dolfin/ale/Poisson1D.h
 create mode 100644 dolfin/ale/Poisson1D.ufl
 create mode 100644 dolfin/ale/Poisson2D.h
 create mode 100644 dolfin/ale/Poisson2D.ufl
 create mode 100644 dolfin/ale/Poisson3D.h
 create mode 100644 dolfin/ale/Poisson3D.ufl
 create mode 100644 dolfin/ale/compile.log
 create mode 100644 dolfin/ale/dolfin_ale.h
 create mode 100644 dolfin/common/Array.h
 create mode 100644 dolfin/common/Hierarchical.h
 create mode 100644 dolfin/common/IndexSet.h
 create mode 100644 dolfin/common/MPI.cpp
 create mode 100644 dolfin/common/MPI.h
 create mode 100644 dolfin/common/NoDeleter.h
 create mode 100644 dolfin/common/RangedIndexSet.h
 create mode 100644 dolfin/common/Set.h
 create mode 100644 dolfin/common/SubSystemsManager.cpp
 create mode 100644 dolfin/common/SubSystemsManager.h
 create mode 100644 dolfin/common/Timer.cpp
 create mode 100644 dolfin/common/Timer.h
 create mode 100644 dolfin/common/UniqueIdGenerator.cpp
 create mode 100644 dolfin/common/UniqueIdGenerator.h
 create mode 100644 dolfin/common/Variable.cpp
 create mode 100644 dolfin/common/Variable.h
 create mode 100644 dolfin/common/constants.h
 create mode 100644 dolfin/common/defines.cpp
 create mode 100644 dolfin/common/defines.h
 create mode 100644 dolfin/common/dolfin_common.h
 create mode 100644 dolfin/common/dolfin_doc.h
 create mode 100644 dolfin/common/init.cpp
 create mode 100644 dolfin/common/init.h
 create mode 100644 dolfin/common/timing.cpp
 create mode 100644 dolfin/common/timing.h
 create mode 100644 dolfin/common/types.h
 create mode 100644 dolfin/common/unittest.h
 create mode 100644 dolfin/common/utils.cpp
 create mode 100644 dolfin/common/utils.h
 create mode 100644 dolfin/dolfin.h
 create mode 100644 dolfin/fem/Assembler.cpp
 create mode 100644 dolfin/fem/Assembler.h
 create mode 100644 dolfin/fem/AssemblerBase.cpp
 create mode 100644 dolfin/fem/AssemblerBase.h
 create mode 100644 dolfin/fem/BasisFunction.h
 create mode 100644 dolfin/fem/CCFEMAssembler.cpp
 create mode 100644 dolfin/fem/CCFEMAssembler.h
 create mode 100644 dolfin/fem/CCFEMDofMap.cpp
 create mode 100644 dolfin/fem/CCFEMDofMap.h
 create mode 100644 dolfin/fem/CCFEMForm.cpp
 create mode 100644 dolfin/fem/CCFEMForm.h
 create mode 100644 dolfin/fem/DirichletBC.cpp
 create mode 100644 dolfin/fem/DirichletBC.h
 create mode 100644 dolfin/fem/DofMap.cpp
 create mode 100644 dolfin/fem/DofMap.h
 create mode 100644 dolfin/fem/DofMapBuilder.cpp
 create mode 100644 dolfin/fem/DofMapBuilder.h
 create mode 100644 dolfin/fem/DomainAssigner.cpp
 create mode 100644 dolfin/fem/DomainAssigner.h
 create mode 100644 dolfin/fem/Equation.cpp
 create mode 100644 dolfin/fem/Equation.h
 create mode 100644 dolfin/fem/FiniteElement.cpp
 create mode 100644 dolfin/fem/FiniteElement.h
 create mode 100644 dolfin/fem/Form.cpp
 create mode 100644 dolfin/fem/Form.h
 create mode 100644 dolfin/fem/GenericDofMap.h
 create mode 100644 dolfin/fem/LinearTimeDependentProblem.cpp
 create mode 100644 dolfin/fem/LinearTimeDependentProblem.h
 create mode 100644 dolfin/fem/LinearVariationalProblem.cpp
 create mode 100644 dolfin/fem/LinearVariationalProblem.h
 create mode 100644 dolfin/fem/LinearVariationalSolver.cpp
 create mode 100644 dolfin/fem/LinearVariationalSolver.h
 create mode 100644 dolfin/fem/LocalSolver.cpp
 create mode 100644 dolfin/fem/LocalSolver.h
 create mode 100644 dolfin/fem/NonlinearVariationalProblem.cpp
 create mode 100644 dolfin/fem/NonlinearVariationalProblem.h
 create mode 100644 dolfin/fem/NonlinearVariationalSolver.cpp
 create mode 100644 dolfin/fem/NonlinearVariationalSolver.h
 create mode 100644 dolfin/fem/OpenMpAssembler.cpp
 create mode 100644 dolfin/fem/OpenMpAssembler.h
 create mode 100644 dolfin/fem/PointSource.cpp
 create mode 100644 dolfin/fem/PointSource.h
 create mode 100644 dolfin/fem/SparsityPatternBuilder.cpp
 create mode 100644 dolfin/fem/SparsityPatternBuilder.h
 create mode 100644 dolfin/fem/SystemAssembler.cpp
 create mode 100644 dolfin/fem/SystemAssembler.h
 create mode 100644 dolfin/fem/UFC.cpp
 create mode 100644 dolfin/fem/UFC.h
 create mode 100644 dolfin/fem/assemble.cpp
 create mode 100644 dolfin/fem/assemble.h
 create mode 100644 dolfin/fem/dolfin_fem.h
 create mode 100644 dolfin/fem/fem_utils.cpp
 create mode 100644 dolfin/fem/fem_utils.h
 create mode 100644 dolfin/fem/solve.cpp
 create mode 100644 dolfin/fem/solve.h
 create mode 100644 dolfin/function/CCFEMFunction.cpp
 create mode 100644 dolfin/function/CCFEMFunction.h
 create mode 100644 dolfin/function/CCFEMFunctionSpace.cpp
 create mode 100644 dolfin/function/CCFEMFunctionSpace.h
 create mode 100644 dolfin/function/CoefficientAssigner.cpp
 create mode 100644 dolfin/function/CoefficientAssigner.h
 create mode 100644 dolfin/function/Constant.cpp
 create mode 100644 dolfin/function/Constant.h
 create mode 100644 dolfin/function/Expression.cpp
 create mode 100644 dolfin/function/Expression.h
 create mode 100644 dolfin/function/Function.cpp
 create mode 100644 dolfin/function/Function.h
 create mode 100644 dolfin/function/FunctionAXPY.cpp
 create mode 100644 dolfin/function/FunctionAXPY.h
 create mode 100644 dolfin/function/FunctionAssigner.cpp
 create mode 100644 dolfin/function/FunctionAssigner.h
 create mode 100644 dolfin/function/FunctionSpace.cpp
 create mode 100644 dolfin/function/FunctionSpace.h
 create mode 100644 dolfin/function/GenericFunction.cpp
 create mode 100644 dolfin/function/GenericFunction.h
 create mode 100644 dolfin/function/LagrangeInterpolator.cpp
 create mode 100644 dolfin/function/LagrangeInterpolator.h
 create mode 100644 dolfin/function/SpecialFacetFunction.cpp
 create mode 100644 dolfin/function/SpecialFacetFunction.h
 create mode 100644 dolfin/function/SpecialFunctions.cpp
 create mode 100644 dolfin/function/SpecialFunctions.h
 create mode 100644 dolfin/function/SubSpace.cpp
 create mode 100644 dolfin/function/SubSpace.h
 create mode 100644 dolfin/function/assign.cpp
 create mode 100644 dolfin/function/assign.h
 create mode 100644 dolfin/function/dolfin_function.h
 create mode 100644 dolfin/generation/BoxMesh.cpp
 create mode 100644 dolfin/generation/BoxMesh.h
 create mode 100644 dolfin/generation/CGALMeshBuilder.h
 create mode 100644 dolfin/generation/CSGCGALDomain2D.cpp
 create mode 100644 dolfin/generation/CSGCGALDomain2D.h
 create mode 100644 dolfin/generation/CSGCGALMeshGenerator2D.cpp
 create mode 100644 dolfin/generation/CSGCGALMeshGenerator2D.h
 create mode 100644 dolfin/generation/CSGCGALMeshGenerator3D.cpp
 create mode 100644 dolfin/generation/CSGCGALMeshGenerator3D.h
 create mode 100644 dolfin/generation/CSGGeometries3D.cpp
 create mode 100644 dolfin/generation/CSGGeometries3D.h
 create mode 100644 dolfin/generation/CSGGeometry.cpp
 create mode 100644 dolfin/generation/CSGGeometry.h
 create mode 100644 dolfin/generation/CSGMeshGenerator.cpp
 create mode 100644 dolfin/generation/CSGMeshGenerator.h
 create mode 100644 dolfin/generation/CSGOperators.cpp
 create mode 100644 dolfin/generation/CSGOperators.h
 create mode 100644 dolfin/generation/CSGPrimitive.h
 create mode 100644 dolfin/generation/CSGPrimitives2D.cpp
 create mode 100644 dolfin/generation/CSGPrimitives2D.h
 create mode 100644 dolfin/generation/CSGPrimitives3D.cpp
 create mode 100644 dolfin/generation/CSGPrimitives3D.h
 create mode 100644 dolfin/generation/EllipseMesh.cpp
 create mode 100644 dolfin/generation/EllipseMesh.h
 create mode 100644 dolfin/generation/EllipsoidMesh.cpp
 create mode 100644 dolfin/generation/EllipsoidMesh.h
 create mode 100644 dolfin/generation/GeometryToCGALConverter.cpp
 create mode 100644 dolfin/generation/GeometryToCGALConverter.h
 create mode 100644 dolfin/generation/ImplicitDomainMeshGenerator.cpp
 create mode 100644 dolfin/generation/ImplicitDomainMeshGenerator.h
 create mode 100644 dolfin/generation/IntervalMesh.cpp
 create mode 100644 dolfin/generation/IntervalMesh.h
 create mode 100644 dolfin/generation/PolygonalMeshGenerator.cpp
 create mode 100644 dolfin/generation/PolygonalMeshGenerator.h
 create mode 100644 dolfin/generation/PolyhedralMeshGenerator.cpp
 create mode 100644 dolfin/generation/PolyhedralMeshGenerator.h
 create mode 100644 dolfin/generation/PolyhedronUtils.cpp
 create mode 100644 dolfin/generation/PolyhedronUtils.h
 create mode 100644 dolfin/generation/RectangleMesh.cpp
 create mode 100644 dolfin/generation/RectangleMesh.h
 create mode 100644 dolfin/generation/Triangulate.cpp
 create mode 100644 dolfin/generation/Triangulate.h
 create mode 100644 dolfin/generation/UnitCubeMesh.h
 create mode 100644 dolfin/generation/UnitIntervalMesh.h
 create mode 100644 dolfin/generation/UnitSquareMesh.h
 create mode 100644 dolfin/generation/UnitTetrahedronMesh.cpp
 create mode 100644 dolfin/generation/UnitTetrahedronMesh.h
 create mode 100644 dolfin/generation/UnitTriangleMesh.cpp
 create mode 100644 dolfin/generation/UnitTriangleMesh.h
 create mode 100644 dolfin/generation/cgal_csg3d.h
 create mode 100644 dolfin/generation/cgal_triangulate_polyhedron.h
 create mode 100644 dolfin/generation/compute_normal.h
 create mode 100644 dolfin/generation/dolfin_generation.h
 create mode 100644 dolfin/generation/self_intersect.h
 create mode 100644 dolfin/geometry/BoundingBoxTree.cpp
 create mode 100644 dolfin/geometry/BoundingBoxTree.h
 create mode 100644 dolfin/geometry/BoundingBoxTree1D.h
 create mode 100644 dolfin/geometry/BoundingBoxTree2D.h
 create mode 100644 dolfin/geometry/BoundingBoxTree3D.h
 create mode 100644 dolfin/geometry/CollisionDetection.cpp
 create mode 100644 dolfin/geometry/CollisionDetection.h
 create mode 100644 dolfin/geometry/GenericBoundingBoxTree.cpp
 create mode 100644 dolfin/geometry/GenericBoundingBoxTree.h
 create mode 100644 dolfin/geometry/ImplicitSurface.cpp
 create mode 100644 dolfin/geometry/ImplicitSurface.h
 create mode 100644 dolfin/geometry/IntersectionTriangulation.cpp
 create mode 100644 dolfin/geometry/IntersectionTriangulation.h
 create mode 100644 dolfin/geometry/MeshPointIntersection.cpp
 create mode 100644 dolfin/geometry/MeshPointIntersection.h
 create mode 100644 dolfin/geometry/Point.cpp
 create mode 100644 dolfin/geometry/Point.h
 create mode 100644 dolfin/geometry/SimplexQuadrature.cpp
 create mode 100644 dolfin/geometry/SimplexQuadrature.h
 create mode 100644 dolfin/geometry/dolfin_geometry.h
 create mode 100644 dolfin/geometry/intersect.cpp
 create mode 100644 dolfin/geometry/intersect.h
 create mode 100644 dolfin/graph/BoostGraphColoring.h
 create mode 100644 dolfin/graph/BoostGraphOrdering.cpp
 create mode 100644 dolfin/graph/BoostGraphOrdering.h
 create mode 100644 dolfin/graph/Graph.h
 create mode 100644 dolfin/graph/GraphBuilder.cpp
 create mode 100644 dolfin/graph/GraphBuilder.h
 create mode 100644 dolfin/graph/GraphColoring.cpp
 create mode 100644 dolfin/graph/GraphColoring.h
 create mode 100644 dolfin/graph/GraphOrdering.cpp
 create mode 100644 dolfin/graph/GraphOrdering.h
 create mode 100644 dolfin/graph/ParMETIS.cpp
 create mode 100644 dolfin/graph/ParMETIS.h
 create mode 100644 dolfin/graph/SCOTCH.cpp
 create mode 100644 dolfin/graph/SCOTCH.h
 create mode 100644 dolfin/graph/ZoltanInterface.cpp
 create mode 100644 dolfin/graph/ZoltanInterface.h
 create mode 100644 dolfin/graph/ZoltanPartition.cpp
 create mode 100644 dolfin/graph/ZoltanPartition.h
 create mode 100644 dolfin/graph/dolfin_graph.h
 create mode 100644 dolfin/io/BinaryFile.cpp
 create mode 100644 dolfin/io/BinaryFile.h
 create mode 100644 dolfin/io/Encoder.h
 create mode 100644 dolfin/io/ExodusFile.cpp
 create mode 100644 dolfin/io/ExodusFile.h
 create mode 100644 dolfin/io/File.cpp
 create mode 100644 dolfin/io/File.h
 create mode 100644 dolfin/io/GenericFile.cpp
 create mode 100644 dolfin/io/GenericFile.h
 create mode 100644 dolfin/io/HDF5Attribute.cpp
 create mode 100644 dolfin/io/HDF5Attribute.h
 create mode 100644 dolfin/io/HDF5File.cpp
 create mode 100644 dolfin/io/HDF5File.h
 create mode 100644 dolfin/io/HDF5Interface.cpp
 create mode 100644 dolfin/io/HDF5Interface.h
 create mode 100644 dolfin/io/HDF5Utility.cpp
 create mode 100644 dolfin/io/HDF5Utility.h
 create mode 100644 dolfin/io/RAWFile.cpp
 create mode 100644 dolfin/io/RAWFile.h
 create mode 100644 dolfin/io/SAX2AttributeParser.h
 create mode 100644 dolfin/io/SVGFile.cpp
 create mode 100644 dolfin/io/SVGFile.h
 create mode 100644 dolfin/io/VTKFile.cpp
 create mode 100644 dolfin/io/VTKFile.h
 create mode 100644 dolfin/io/VTKWriter.cpp
 create mode 100644 dolfin/io/VTKWriter.h
 create mode 100644 dolfin/io/X3DFile.cpp
 create mode 100644 dolfin/io/X3DFile.h
 create mode 100644 dolfin/io/XDMFFile.cpp
 create mode 100644 dolfin/io/XDMFFile.h
 create mode 100644 dolfin/io/XMLArray.h
 create mode 100644 dolfin/io/XMLFile.cpp
 create mode 100644 dolfin/io/XMLFile.h
 create mode 100644 dolfin/io/XMLFunctionData.cpp
 create mode 100644 dolfin/io/XMLFunctionData.h
 create mode 100644 dolfin/io/XMLLocalMeshSAX.cpp
 create mode 100644 dolfin/io/XMLLocalMeshSAX.h
 create mode 100644 dolfin/io/XMLMesh.cpp
 create mode 100644 dolfin/io/XMLMesh.h
 create mode 100644 dolfin/io/XMLMeshFunction.h
 create mode 100644 dolfin/io/XMLMeshValueCollection.h
 create mode 100644 dolfin/io/XMLParameters.cpp
 create mode 100644 dolfin/io/XMLParameters.h
 create mode 100644 dolfin/io/XMLVector.cpp
 create mode 100644 dolfin/io/XMLVector.h
 create mode 100644 dolfin/io/XYZFile.cpp
 create mode 100644 dolfin/io/XYZFile.h
 create mode 100644 dolfin/io/base64.cpp
 create mode 100644 dolfin/io/base64.h
 create mode 100644 dolfin/io/dolfin_io.h
 create mode 100644 dolfin/io/pugiconfig.hpp
 create mode 100644 dolfin/io/pugixml.cpp
 create mode 100644 dolfin/io/pugixml.hpp
 create mode 100644 dolfin/io/xmlutils.cpp
 create mode 100644 dolfin/io/xmlutils.h
 create mode 100644 dolfin/la/BlockMatrix.cpp
 create mode 100644 dolfin/la/BlockMatrix.h
 create mode 100644 dolfin/la/BlockVector.cpp
 create mode 100644 dolfin/la/BlockVector.h
 create mode 100644 dolfin/la/CholmodCholeskySolver.cpp
 create mode 100644 dolfin/la/CholmodCholeskySolver.h
 create mode 100644 dolfin/la/CoordinateMatrix.cpp
 create mode 100644 dolfin/la/CoordinateMatrix.h
 create mode 100644 dolfin/la/DefaultFactory.cpp
 create mode 100644 dolfin/la/DefaultFactory.h
 create mode 100644 dolfin/la/EpetraFactory.cpp
 create mode 100644 dolfin/la/EpetraFactory.h
 create mode 100644 dolfin/la/EpetraKrylovSolver.cpp
 create mode 100644 dolfin/la/EpetraKrylovSolver.h
 create mode 100644 dolfin/la/EpetraLUSolver.cpp
 create mode 100644 dolfin/la/EpetraLUSolver.h
 create mode 100644 dolfin/la/EpetraMatrix.cpp
 create mode 100644 dolfin/la/EpetraMatrix.h
 create mode 100644 dolfin/la/EpetraVector.cpp
 create mode 100644 dolfin/la/EpetraVector.h
 create mode 100644 dolfin/la/GenericLUSolver.h
 create mode 100644 dolfin/la/GenericLinearAlgebraFactory.h
 create mode 100644 dolfin/la/GenericLinearOperator.h
 create mode 100644 dolfin/la/GenericLinearSolver.cpp
 create mode 100644 dolfin/la/GenericLinearSolver.h
 create mode 100644 dolfin/la/GenericMatrix.cpp
 create mode 100644 dolfin/la/GenericMatrix.h
 create mode 100644 dolfin/la/GenericPreconditioner.h
 create mode 100644 dolfin/la/GenericSparsityPattern.h
 create mode 100644 dolfin/la/GenericTensor.h
 create mode 100644 dolfin/la/GenericVector.h
 create mode 100644 dolfin/la/KrylovSolver.cpp
 create mode 100644 dolfin/la/KrylovSolver.h
 create mode 100644 dolfin/la/LUSolver.cpp
 create mode 100644 dolfin/la/LUSolver.h
 create mode 100644 dolfin/la/LinearAlgebraObject.h
 create mode 100644 dolfin/la/LinearOperator.cpp
 create mode 100644 dolfin/la/LinearOperator.h
 create mode 100644 dolfin/la/LinearSolver.cpp
 create mode 100644 dolfin/la/LinearSolver.h
 create mode 100644 dolfin/la/MUMPSLUSolver.cpp
 create mode 100644 dolfin/la/MUMPSLUSolver.h
 create mode 100644 dolfin/la/Matrix.h
 create mode 100644 dolfin/la/PETScBaseMatrix.cpp
 create mode 100644 dolfin/la/PETScBaseMatrix.h
 create mode 100644 dolfin/la/PETScCuspFactory.cpp
 create mode 100644 dolfin/la/PETScCuspFactory.h
 create mode 100644 dolfin/la/PETScFactory.cpp
 create mode 100644 dolfin/la/PETScFactory.h
 create mode 100644 dolfin/la/PETScKrylovSolver.cpp
 create mode 100644 dolfin/la/PETScKrylovSolver.h
 create mode 100644 dolfin/la/PETScLUSolver.cpp
 create mode 100644 dolfin/la/PETScLUSolver.h
 create mode 100644 dolfin/la/PETScLinearOperator.cpp
 create mode 100644 dolfin/la/PETScLinearOperator.h
 create mode 100644 dolfin/la/PETScMatrix.cpp
 create mode 100644 dolfin/la/PETScMatrix.h
 create mode 100644 dolfin/la/PETScObject.h
 create mode 100644 dolfin/la/PETScOptions.cpp
 create mode 100644 dolfin/la/PETScOptions.h
 create mode 100644 dolfin/la/PETScPreconditioner.cpp
 create mode 100644 dolfin/la/PETScPreconditioner.h
 create mode 100644 dolfin/la/PETScUserPreconditioner.cpp
 create mode 100644 dolfin/la/PETScUserPreconditioner.h
 create mode 100644 dolfin/la/PETScVector.cpp
 create mode 100644 dolfin/la/PETScVector.h
 create mode 100644 dolfin/la/PaStiXLUSolver.cpp
 create mode 100644 dolfin/la/PaStiXLUSolver.h
 create mode 100644 dolfin/la/SLEPcEigenSolver.cpp
 create mode 100644 dolfin/la/SLEPcEigenSolver.h
 create mode 100644 dolfin/la/STLFactory.cpp
 create mode 100644 dolfin/la/STLFactory.h
 create mode 100644 dolfin/la/STLFactoryCSC.cpp
 create mode 100644 dolfin/la/STLFactoryCSC.h
 create mode 100644 dolfin/la/STLMatrix.cpp
 create mode 100644 dolfin/la/STLMatrix.h
 create mode 100644 dolfin/la/STLVector.h
 create mode 100644 dolfin/la/Scalar.h
 create mode 100644 dolfin/la/SparsityPattern.cpp
 create mode 100644 dolfin/la/SparsityPattern.h
 create mode 100644 dolfin/la/TensorLayout.cpp
 create mode 100644 dolfin/la/TensorLayout.h
 create mode 100644 dolfin/la/TrilinosPreconditioner.cpp
 create mode 100644 dolfin/la/TrilinosPreconditioner.h
 create mode 100644 dolfin/la/UmfpackLUSolver.cpp
 create mode 100644 dolfin/la/UmfpackLUSolver.h
 create mode 100644 dolfin/la/Vector.h
 create mode 100644 dolfin/la/VectorSpaceBasis.cpp
 create mode 100644 dolfin/la/VectorSpaceBasis.h
 create mode 100644 dolfin/la/dolfin_la.h
 create mode 100644 dolfin/la/solve.cpp
 create mode 100644 dolfin/la/solve.h
 create mode 100644 dolfin/la/uBLASDenseMatrix.h
 create mode 100644 dolfin/la/uBLASDummyPreconditioner.cpp
 create mode 100644 dolfin/la/uBLASDummyPreconditioner.h
 create mode 100644 dolfin/la/uBLASFactory.h
 create mode 100644 dolfin/la/uBLASILUPreconditioner.cpp
 create mode 100644 dolfin/la/uBLASILUPreconditioner.h
 create mode 100644 dolfin/la/uBLASKrylovSolver.cpp
 create mode 100644 dolfin/la/uBLASKrylovSolver.h
 create mode 100644 dolfin/la/uBLASLinearOperator.cpp
 create mode 100644 dolfin/la/uBLASLinearOperator.h
 create mode 100644 dolfin/la/uBLASMatrix.h
 create mode 100644 dolfin/la/uBLASPreconditioner.h
 create mode 100644 dolfin/la/uBLASSparseMatrix.h
 create mode 100644 dolfin/la/uBLASVector.cpp
 create mode 100644 dolfin/la/uBLASVector.h
 create mode 100644 dolfin/la/ublas.h
 create mode 100644 dolfin/log/Event.cpp
 create mode 100644 dolfin/log/Event.h
 create mode 100644 dolfin/log/LogLevel.h
 create mode 100644 dolfin/log/LogManager.cpp
 create mode 100644 dolfin/log/LogManager.h
 create mode 100644 dolfin/log/LogStream.cpp
 create mode 100644 dolfin/log/LogStream.h
 create mode 100644 dolfin/log/Logger.cpp
 create mode 100644 dolfin/log/Logger.h
 create mode 100644 dolfin/log/Progress.cpp
 create mode 100644 dolfin/log/Progress.h
 create mode 100644 dolfin/log/README
 create mode 100644 dolfin/log/Table.cpp
 create mode 100644 dolfin/log/Table.h
 create mode 100644 dolfin/log/dolfin_log.h
 create mode 100644 dolfin/log/log.cpp
 create mode 100644 dolfin/log/log.h
 create mode 100644 dolfin/math/Lagrange.cpp
 create mode 100644 dolfin/math/Lagrange.h
 create mode 100644 dolfin/math/Legendre.cpp
 create mode 100644 dolfin/math/Legendre.h
 create mode 100644 dolfin/math/basic.cpp
 create mode 100644 dolfin/math/basic.h
 create mode 100644 dolfin/math/dolfin_math.h
 create mode 100644 dolfin/mesh/BoundaryComputation.cpp
 create mode 100644 dolfin/mesh/BoundaryComputation.h
 create mode 100644 dolfin/mesh/BoundaryMesh.cpp
 create mode 100644 dolfin/mesh/BoundaryMesh.h
 create mode 100644 dolfin/mesh/Cell.h
 create mode 100644 dolfin/mesh/CellType.cpp
 create mode 100644 dolfin/mesh/CellType.h
 create mode 100644 dolfin/mesh/DistributedMeshTools.cpp
 create mode 100644 dolfin/mesh/DistributedMeshTools.h
 create mode 100644 dolfin/mesh/DomainBoundary.h
 create mode 100644 dolfin/mesh/DynamicMeshEditor.cpp
 create mode 100644 dolfin/mesh/DynamicMeshEditor.h
 create mode 100644 dolfin/mesh/Edge.cpp
 create mode 100644 dolfin/mesh/Edge.h
 create mode 100644 dolfin/mesh/Face.cpp
 create mode 100644 dolfin/mesh/Face.h
 create mode 100644 dolfin/mesh/Facet.cpp
 create mode 100644 dolfin/mesh/Facet.h
 create mode 100644 dolfin/mesh/FacetCell.cpp
 create mode 100644 dolfin/mesh/FacetCell.h
 create mode 100644 dolfin/mesh/IntervalCell.cpp
 create mode 100644 dolfin/mesh/IntervalCell.h
 create mode 100644 dolfin/mesh/LocalMeshData.cpp
 create mode 100644 dolfin/mesh/LocalMeshData.h
 create mode 100644 dolfin/mesh/LocalMeshValueCollection.h
 create mode 100644 dolfin/mesh/Mesh.cpp
 create mode 100644 dolfin/mesh/Mesh.h
 create mode 100644 dolfin/mesh/MeshColoring.cpp
 create mode 100644 dolfin/mesh/MeshColoring.h
 create mode 100644 dolfin/mesh/MeshConnectivity.cpp
 create mode 100644 dolfin/mesh/MeshConnectivity.h
 create mode 100644 dolfin/mesh/MeshData.cpp
 create mode 100644 dolfin/mesh/MeshData.h
 create mode 100644 dolfin/mesh/MeshDomains.cpp
 create mode 100644 dolfin/mesh/MeshDomains.h
 create mode 100644 dolfin/mesh/MeshEditor.cpp
 create mode 100644 dolfin/mesh/MeshEditor.h
 create mode 100644 dolfin/mesh/MeshEntity.cpp
 create mode 100644 dolfin/mesh/MeshEntity.h
 create mode 100644 dolfin/mesh/MeshEntityIterator.h
 create mode 100644 dolfin/mesh/MeshEntityIteratorBase.h
 create mode 100644 dolfin/mesh/MeshFunction.cpp
 create mode 100644 dolfin/mesh/MeshFunction.h
 create mode 100644 dolfin/mesh/MeshGeometry.cpp
 create mode 100644 dolfin/mesh/MeshGeometry.h
 create mode 100644 dolfin/mesh/MeshOrdering.cpp
 create mode 100644 dolfin/mesh/MeshOrdering.h
 create mode 100644 dolfin/mesh/MeshPartitioning.cpp
 create mode 100644 dolfin/mesh/MeshPartitioning.h
 create mode 100644 dolfin/mesh/MeshQuality.cpp
 create mode 100644 dolfin/mesh/MeshQuality.h
 create mode 100644 dolfin/mesh/MeshRenumbering.cpp
 create mode 100644 dolfin/mesh/MeshRenumbering.h
 create mode 100644 dolfin/mesh/MeshSmoothing.cpp
 create mode 100644 dolfin/mesh/MeshSmoothing.h
 create mode 100644 dolfin/mesh/MeshTopology.cpp
 create mode 100644 dolfin/mesh/MeshTopology.h
 create mode 100644 dolfin/mesh/MeshTransformation.cpp
 create mode 100644 dolfin/mesh/MeshTransformation.h
 create mode 100644 dolfin/mesh/MeshValueCollection.h
 create mode 100644 dolfin/mesh/PeriodicBoundaryComputation.cpp
 create mode 100644 dolfin/mesh/PeriodicBoundaryComputation.h
 create mode 100644 dolfin/mesh/PointCell.cpp
 create mode 100644 dolfin/mesh/PointCell.h
 create mode 100644 dolfin/mesh/Restriction.cpp
 create mode 100644 dolfin/mesh/Restriction.h
 create mode 100644 dolfin/mesh/SubDomain.cpp
 create mode 100644 dolfin/mesh/SubDomain.h
 create mode 100644 dolfin/mesh/SubMesh.cpp
 create mode 100644 dolfin/mesh/SubMesh.h
 create mode 100644 dolfin/mesh/SubsetIterator.h
 create mode 100644 dolfin/mesh/TetrahedronCell.cpp
 create mode 100644 dolfin/mesh/TetrahedronCell.h
 create mode 100644 dolfin/mesh/TopologyComputation.cpp
 create mode 100644 dolfin/mesh/TopologyComputation.h
 create mode 100644 dolfin/mesh/TriangleCell.cpp
 create mode 100644 dolfin/mesh/TriangleCell.h
 create mode 100644 dolfin/mesh/Vertex.h
 create mode 100644 dolfin/mesh/dolfin_mesh.h
 create mode 100644 dolfin/multistage/MultiStageScheme.cpp
 create mode 100644 dolfin/multistage/MultiStageScheme.h
 create mode 100644 dolfin/multistage/PointIntegralSolver.cpp
 create mode 100644 dolfin/multistage/PointIntegralSolver.h
 create mode 100644 dolfin/multistage/RKSolver.cpp
 create mode 100644 dolfin/multistage/RKSolver.h
 create mode 100644 dolfin/multistage/dolfin_multistage.h
 create mode 100644 dolfin/nls/NewtonSolver.cpp
 create mode 100644 dolfin/nls/NewtonSolver.h
 create mode 100644 dolfin/nls/NonlinearProblem.h
 create mode 100644 dolfin/nls/PETScSNESSolver.cpp
 create mode 100644 dolfin/nls/PETScSNESSolver.h
 create mode 100644 dolfin/nls/TAOLinearBoundSolver.cpp
 create mode 100644 dolfin/nls/TAOLinearBoundSolver.h
 create mode 100644 dolfin/nls/dolfin_nls.h
 create mode 100644 dolfin/parameter/GlobalParameters.cpp
 create mode 100644 dolfin/parameter/GlobalParameters.h
 create mode 100644 dolfin/parameter/Parameter.cpp
 create mode 100644 dolfin/parameter/Parameter.h
 create mode 100644 dolfin/parameter/Parameters.cpp
 create mode 100644 dolfin/parameter/Parameters.h
 create mode 100644 dolfin/parameter/dolfin_parameter.h
 create mode 100644 dolfin/plot/ExpressionWrapper.cpp
 create mode 100644 dolfin/plot/ExpressionWrapper.h
 create mode 100644 dolfin/plot/GenericVTKPlottable.h
 create mode 100644 dolfin/plot/VTKPlottableCSGGeometry.cpp
 create mode 100644 dolfin/plot/VTKPlottableCSGGeometry.h
 create mode 100644 dolfin/plot/VTKPlottableDirichletBC.cpp
 create mode 100644 dolfin/plot/VTKPlottableDirichletBC.h
 create mode 100644 dolfin/plot/VTKPlottableGenericFunction.cpp
 create mode 100644 dolfin/plot/VTKPlottableGenericFunction.h
 create mode 100644 dolfin/plot/VTKPlottableGenericFunction1D.cpp
 create mode 100644 dolfin/plot/VTKPlottableGenericFunction1D.h
 create mode 100644 dolfin/plot/VTKPlottableMesh.cpp
 create mode 100644 dolfin/plot/VTKPlottableMesh.h
 create mode 100644 dolfin/plot/VTKPlottableMeshFunction.cpp
 create mode 100644 dolfin/plot/VTKPlottableMeshFunction.h
 create mode 100644 dolfin/plot/VTKPlotter.cpp
 create mode 100644 dolfin/plot/VTKPlotter.h
 create mode 100644 dolfin/plot/VTKWindowOutputStage.cpp
 create mode 100644 dolfin/plot/VTKWindowOutputStage.h
 create mode 100644 dolfin/plot/dolfin_plot.h
 create mode 100644 dolfin/plot/gauss_120.dat
 create mode 100644 dolfin/plot/plot.cpp
 create mode 100644 dolfin/plot/plot.h
 create mode 100644 dolfin/refinement/BisectionRefinement.cpp
 create mode 100644 dolfin/refinement/BisectionRefinement.h
 create mode 100644 dolfin/refinement/LocalMeshCoarsening.cpp
 create mode 100644 dolfin/refinement/LocalMeshCoarsening.h
 create mode 100644 dolfin/refinement/LocalMeshRefinement.cpp
 create mode 100644 dolfin/refinement/LocalMeshRefinement.h
 create mode 100644 dolfin/refinement/ParallelRefinement.cpp
 create mode 100644 dolfin/refinement/ParallelRefinement.h
 create mode 100644 dolfin/refinement/ParallelRefinement2D.cpp
 create mode 100644 dolfin/refinement/ParallelRefinement2D.h
 create mode 100644 dolfin/refinement/ParallelRefinement3D.cpp
 create mode 100644 dolfin/refinement/ParallelRefinement3D.h
 create mode 100644 dolfin/refinement/RegularCutRefinement.cpp
 create mode 100644 dolfin/refinement/RegularCutRefinement.h
 create mode 100644 dolfin/refinement/RivaraRefinement.cpp
 create mode 100644 dolfin/refinement/RivaraRefinement.h
 create mode 100644 dolfin/refinement/UniformMeshRefinement.cpp
 create mode 100644 dolfin/refinement/UniformMeshRefinement.h
 create mode 100644 dolfin/refinement/dolfin_refinement.h
 create mode 100644 dolfin/refinement/refine.cpp
 create mode 100644 dolfin/refinement/refine.h
 create mode 100644 dolfin/swig/CMakeLists.txt
 create mode 100644 dolfin/swig/README
 create mode 100644 dolfin/swig/adaptivity/docstrings.i
 create mode 100644 dolfin/swig/adaptivity/post.i
 create mode 100644 dolfin/swig/adaptivity/pre.i
 create mode 100644 dolfin/swig/ale/docstrings.i
 create mode 100644 dolfin/swig/ale/pre.i
 create mode 100644 dolfin/swig/common/docstrings.i
 create mode 100644 dolfin/swig/common/post.i
 create mode 100644 dolfin/swig/common/pre.i
 create mode 100644 dolfin/swig/defines.i
 create mode 100644 dolfin/swig/exceptions.i
 create mode 100644 dolfin/swig/fem/docstrings.i
 create mode 100644 dolfin/swig/fem/post.i
 create mode 100644 dolfin/swig/fem/pre.i
 create mode 100644 dolfin/swig/forwarddeclarations.i
 create mode 100644 dolfin/swig/function/docstrings.i
 create mode 100644 dolfin/swig/function/import.i
 create mode 100644 dolfin/swig/function/post.i
 create mode 100644 dolfin/swig/function/pre.i
 create mode 100644 dolfin/swig/generation/docstrings.i
 create mode 100644 dolfin/swig/generation/post.i
 create mode 100644 dolfin/swig/geometry/docstrings.i
 create mode 100644 dolfin/swig/geometry/post.i
 create mode 100644 dolfin/swig/geometry/pre.i
 create mode 100644 dolfin/swig/globalincludes.i
 create mode 100644 dolfin/swig/graph/docstrings.i
 create mode 100644 dolfin/swig/graph/post.i
 create mode 100644 dolfin/swig/io/docstrings.i
 create mode 100644 dolfin/swig/io/post.i
 create mode 100644 dolfin/swig/io/pre.i
 create mode 100644 dolfin/swig/la/Indices.i
 create mode 100644 dolfin/swig/la/docstrings.i
 create mode 100644 dolfin/swig/la/la_get_set_items.i
 create mode 100644 dolfin/swig/la/post.i
 create mode 100644 dolfin/swig/la/pre.i
 create mode 100644 dolfin/swig/log/docstrings.i
 create mode 100644 dolfin/swig/log/post.i
 create mode 100644 dolfin/swig/log/pre.i
 create mode 100644 dolfin/swig/math/docstrings.i
 create mode 100644 dolfin/swig/mesh/docstrings.i
 create mode 100644 dolfin/swig/mesh/post.i
 create mode 100644 dolfin/swig/mesh/pre.i
 create mode 100644 dolfin/swig/modules/common/CMakeLists.txt
 create mode 100644 dolfin/swig/modules/common/dependencies.txt
 create mode 100644 dolfin/swig/modules/common/module.i
 create mode 100644 dolfin/swig/modules/fem/CMakeLists.txt
 create mode 100644 dolfin/swig/modules/fem/dependencies.txt
 create mode 100644 dolfin/swig/modules/fem/module.i
 create mode 100644 dolfin/swig/modules/function/CMakeLists.txt
 create mode 100644 dolfin/swig/modules/function/dependencies.txt
 create mode 100644 dolfin/swig/modules/function/module.i
 create mode 100644 dolfin/swig/modules/io/CMakeLists.txt
 create mode 100644 dolfin/swig/modules/io/dependencies.txt
 create mode 100644 dolfin/swig/modules/io/module.i
 create mode 100644 dolfin/swig/modules/la/CMakeLists.txt
 create mode 100644 dolfin/swig/modules/la/dependencies.txt
 create mode 100644 dolfin/swig/modules/la/module.i
 create mode 100644 dolfin/swig/modules/mesh/CMakeLists.txt
 create mode 100644 dolfin/swig/modules/mesh/dependencies.txt
 create mode 100644 dolfin/swig/modules/mesh/module.i
 create mode 100644 dolfin/swig/multistage/docstrings.i
 create mode 100644 dolfin/swig/multistage/pre.i
 create mode 100644 dolfin/swig/nls/docstrings.i
 create mode 100644 dolfin/swig/nls/pre.i
 create mode 100644 dolfin/swig/parameter/docstrings.i
 create mode 100644 dolfin/swig/parameter/post.i
 create mode 100644 dolfin/swig/parameter/pre.i
 create mode 100644 dolfin/swig/plot/docstrings.i
 create mode 100644 dolfin/swig/refinement/docstrings.i
 create mode 100644 dolfin/swig/shared_ptr_classes.i
 create mode 100644 dolfin/swig/typemaps/array.i
 create mode 100644 dolfin/swig/typemaps/includes.i
 create mode 100644 dolfin/swig/typemaps/numpy.i
 create mode 100644 dolfin/swig/typemaps/primitives.i
 create mode 100644 dolfin/swig/typemaps/std_map.i
 create mode 100644 dolfin/swig/typemaps/std_pair.i
 create mode 100644 dolfin/swig/typemaps/std_set.i
 create mode 100644 dolfin/swig/typemaps/std_vector.i
 create mode 100644 dolfin/swig/version.i
 create mode 100755 scripts/dolfin-convert/dolfin-convert
 create mode 100644 scripts/dolfin-convert/test_Triangle.edge
 create mode 100644 scripts/dolfin-convert/test_Triangle.ele
 create mode 100644 scripts/dolfin-convert/test_Triangle.node
 create mode 100644 scripts/dolfin-convert/test_exodus.exo
 create mode 100755 scripts/dolfin-order/dolfin-order
 create mode 100644 scripts/dolfin-order/mesh0.xml.gz
 create mode 100644 scripts/dolfin-order/mesh1.xml.gz
 create mode 100755 scripts/dolfin-plot/dolfin-plot
 create mode 100644 scripts/dolfin-plot/mesh.xml.gz
 create mode 100755 scripts/dolfin-plot/plot_book_elements.sh
 create mode 100755 scripts/dolfin-plot/plot_elements.sh
 create mode 100644 site-packages/dolfin/__init__.py
 create mode 100644 site-packages/dolfin/common/__init__.py
 create mode 100644 site-packages/dolfin/common/constants.py
 create mode 100644 site-packages/dolfin/common/globalparameters.py.in
 create mode 100644 site-packages/dolfin/common/math.py
 create mode 100644 site-packages/dolfin/common/memory.py
 create mode 100644 site-packages/dolfin/common/plotting.py
 create mode 100644 site-packages/dolfin/common/time.py
 create mode 100644 site-packages/dolfin/compilemodules/__init__.py
 create mode 100644 site-packages/dolfin/compilemodules/compilemodule.py
 create mode 100644 site-packages/dolfin/compilemodules/expressions.py
 create mode 100644 site-packages/dolfin/compilemodules/jit.py
 create mode 100644 site-packages/dolfin/compilemodules/subdomains.py
 create mode 100644 site-packages/dolfin/compilemodules/swigimportinfo.py
 create mode 100644 site-packages/dolfin/cpp/__init__.py
 create mode 100644 site-packages/dolfin/deprecation.py
 create mode 100644 site-packages/dolfin/fem/__init__.py
 create mode 100644 site-packages/dolfin/fem/adaptivesolving.py
 create mode 100644 site-packages/dolfin/fem/assembling.py
 create mode 100644 site-packages/dolfin/fem/bcs.py
 create mode 100644 site-packages/dolfin/fem/errorcontrolgenerator.py
 create mode 100644 site-packages/dolfin/fem/form.py
 create mode 100644 site-packages/dolfin/fem/formmanipulations.py
 create mode 100644 site-packages/dolfin/fem/interpolation.py
 create mode 100644 site-packages/dolfin/fem/norms.py
 create mode 100644 site-packages/dolfin/fem/projection.py
 create mode 100644 site-packages/dolfin/fem/solving.py
 create mode 100644 site-packages/dolfin/functions/__init__.py
 create mode 100644 site-packages/dolfin/functions/constant.py
 create mode 100644 site-packages/dolfin/functions/expression.py
 create mode 100644 site-packages/dolfin/functions/function.py
 create mode 100644 site-packages/dolfin/functions/functionspace.py
 create mode 100644 site-packages/dolfin/functions/specialfunctions.py
 create mode 100644 site-packages/dolfin/functions/ufc_functionspace.py
 create mode 100644 site-packages/dolfin/importhandler/__init__.py
 create mode 100644 site-packages/dolfin/mesh/__init__.py
 create mode 100644 site-packages/dolfin/mesh/ale.py
 create mode 100644 site-packages/dolfin/mesh/boundarysubdomainfinder.py
 create mode 100644 site-packages/dolfin/mesh/meshes.py
 create mode 100644 site-packages/dolfin/mesh/refinement.py
 create mode 100644 site-packages/dolfin/mesh/svgtools.py
 create mode 100644 site-packages/dolfin/multistage/__init__.py
 create mode 100644 site-packages/dolfin/multistage/multistagescheme.py
 create mode 100644 site-packages/dolfin/multistage/multistagesolvers.py
 create mode 100644 site-packages/dolfin_utils/__init__.py
 create mode 100644 site-packages/dolfin_utils/commands.py
 create mode 100644 site-packages/dolfin_utils/cppparser/CppHeaderParser.py
 create mode 100644 site-packages/dolfin_utils/cppparser/__init__.py
 create mode 100644 site-packages/dolfin_utils/cppparser/utils.py
 create mode 100644 site-packages/dolfin_utils/documentation/__init__.py
 create mode 100644 site-packages/dolfin_utils/documentation/docstringutils.py
 create mode 100644 site-packages/dolfin_utils/documentation/extractdocumentation.py
 create mode 100644 site-packages/dolfin_utils/documentation/generatecpprst.py
 create mode 100644 site-packages/dolfin_utils/documentation/generatepythonrst.py
 create mode 100644 site-packages/dolfin_utils/documentation/indextemplates.py
 create mode 100644 site-packages/dolfin_utils/meshconvert/__init__.py
 create mode 100644 site-packages/dolfin_utils/meshconvert/abaqus.py
 create mode 100644 site-packages/dolfin_utils/meshconvert/meshconvert.py
 create mode 100644 site-packages/dolfin_utils/meshconvert/xml_writer.py
 create mode 100644 site-packages/dolfin_utils/ordereddict.py
 create mode 100644 site-packages/dolfin_utils/pjobs/__init__.py
 create mode 100644 site-packages/dolfin_utils/pjobs/pjobs.py
 create mode 100644 site-packages/dolfin_utils/pjobs/sge.py
 create mode 100644 site-packages/dolfin_utils/pjobs/slurm.py
 create mode 100644 site-packages/dolfin_utils/pjobs/torque.py
 create mode 100644 site-packages/fenics/__init__.py
 create mode 100644 test/CMakeLists.txt
 create mode 100644 test/README
 create mode 100644 test/codingstyle/test.py
 create mode 100644 test/documentation/README
 create mode 100644 test/documentation/test.py
 create mode 100755 test/documentation/verify_demo_code_snippets.py
 create mode 100644 test/memory/dolfin_valgrind.supp
 create mode 100644 test/memory/test.py
 create mode 100644 test/regression/README
 create mode 100644 test/regression/test.py
 create mode 100644 test/system/parallel-assembly-solve/solver.py
 create mode 100644 test/system/parallel-assembly-solve/test.py
 create mode 100644 test/system/test.py
 create mode 100644 test/system/ufl-jit-assemble-chain/assembly_derivatives.py
 create mode 100644 test/system/ufl-jit-assemble-chain/form_operations.py
 create mode 100644 test/system/ufl-jit-assemble-chain/test.py
 create mode 100644 test/test.py
 create mode 100644 test/unit/adaptivity/python/TimeSeries.py
 create mode 100644 test/unit/adaptivity/python/errorcontrol.py
 create mode 100644 test/unit/ale/python/HarmonicSmoothing.py
 create mode 100644 test/unit/book/README
 create mode 100644 test/unit/book/python/chapter_1.py
 create mode 100644 test/unit/book/python/chapter_10.py
 create mode 100644 test/unit/book/python/chapter_1_files/dolfin_parameters.xml
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/alg_newton_np.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/pde_newton_np.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/picard_np.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/vp1_np.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/vp2_np.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/d1_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/d2_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/d3_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/d4_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/d5_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/d6_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/dn1_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/dn2_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/dn3_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/dn4_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/dnr_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/mat2_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/mat2x_p2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/membrane1.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/membrane1v.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/paD.py
 create mode 100644 test/unit/book/python/chapter_1_files/stationary/poisson/vcp2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/transient/diffusion/d1_d2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/transient/diffusion/d2_d2D.py
 create mode 100644 test/unit/book/python/chapter_1_files/transient/diffusion/demo_sin_daD.sh
 create mode 100644 test/unit/book/python/chapter_1_files/transient/diffusion/sin_daD.py
 create mode 100644 test/unit/book/python/mesh.xml
 create mode 100644 test/unit/book/python/original_tests/README
 create mode 100644 test/unit/fem/python/Assembler.py
 create mode 100644 test/unit/fem/python/DirichletBC.py
 create mode 100644 test/unit/fem/python/DofMap.py
 create mode 100644 test/unit/fem/python/FiniteElement.py
 create mode 100644 test/unit/fem/python/Form.py
 create mode 100644 test/unit/fem/python/LocalSolver.py
 create mode 100644 test/unit/fem/python/SystemAssembler.py
 create mode 100644 test/unit/fem/python/aneurysm.xml.gz
 create mode 100644 test/unit/fem/python/manifolds.py
 create mode 100644 test/unit/fem/python/solving.py
 create mode 100644 test/unit/fem/python/tetrahedron.xml.gz
 create mode 100644 test/unit/function/cpp/CMakeLists.txt
 create mode 100644 test/unit/function/cpp/Expression.cpp
 create mode 100644 test/unit/function/cpp/Projection.h
 create mode 100644 test/unit/function/cpp/Projection.ufl
 create mode 100644 test/unit/function/cpp/compile.log
 create mode 100644 test/unit/function/python/Constant.py
 create mode 100644 test/unit/function/python/ConstrainedFunctionSpace.py
 create mode 100644 test/unit/function/python/Expression.py
 create mode 100644 test/unit/function/python/Function.py
 create mode 100644 test/unit/function/python/FunctionAssigner.py
 create mode 100644 test/unit/function/python/FunctionSpace.py
 create mode 100644 test/unit/function/python/LagrangeInterpolator.py
 create mode 100644 test/unit/function/python/SpecialFunctions.py
 create mode 100644 test/unit/function/python/nonmatching_interpolation.py
 create mode 100644 test/unit/geometry/python/BoundingBoxTree.py
 create mode 100644 test/unit/geometry/python/CollisionDetection.py
 create mode 100644 test/unit/geometry/python/Intersection.py
 create mode 100644 test/unit/geometry/python/IntersectionTriangulation.py
 create mode 100644 test/unit/geometry/python/Issues.py
 create mode 100644 test/unit/graph/python/GraphBuild.py
 create mode 100644 test/unit/io/cpp/CMakeLists.txt
 create mode 100644 test/unit/io/cpp/XMLLocalMeshData.cpp
 create mode 100644 test/unit/io/cpp/XMLMeshData.cpp
 create mode 100644 test/unit/io/cpp/XMLMeshValueCollection.cpp
 create mode 100644 test/unit/io/cpp/xml_value_collection_ref.xml
 create mode 100644 test/unit/io/python/Exodus.py
 create mode 100644 test/unit/io/python/HDF5.py
 create mode 100644 test/unit/io/python/HDF5Attribute.py
 create mode 100644 test/unit/io/python/SVG.py
 create mode 100644 test/unit/io/python/X3D.py
 create mode 100644 test/unit/io/python/XDMF.py
 create mode 100644 test/unit/io/python/XMLLocalMeshData.py
 create mode 100644 test/unit/io/python/XMLMesh.py
 create mode 100644 test/unit/io/python/XMLMeshFunction.py
 create mode 100644 test/unit/io/python/XMLMeshValueCollection.py
 create mode 100644 test/unit/io/python/XMLVector.py
 create mode 100644 test/unit/io/python/vtk.py
 create mode 100644 test/unit/io/python/xml_value_collection_ref.xml
 create mode 100644 test/unit/io/snake.xml.gz
 create mode 100644 test/unit/jit/python/test.py
 create mode 100644 test/unit/la/cpp/CMakeLists.txt
 create mode 100644 test/unit/la/cpp/LinearOperator.cpp
 create mode 100644 test/unit/la/cpp/Vector.cpp
 create mode 100644 test/unit/la/cpp/forms/ReactionDiffusion.h
 create mode 100644 test/unit/la/cpp/forms/ReactionDiffusion.ufl
 create mode 100644 test/unit/la/cpp/forms/ReactionDiffusionAction.h
 create mode 100644 test/unit/la/cpp/forms/ReactionDiffusionAction.ufl
 create mode 100644 test/unit/la/cpp/forms/compile.log
 create mode 100644 test/unit/la/python/KrylovSolver.py
 create mode 100644 test/unit/la/python/LinearOperator.py
 create mode 100644 test/unit/la/python/Matrix.py
 create mode 100644 test/unit/la/python/Scalar.py
 create mode 100644 test/unit/la/python/Vector.py
 create mode 100644 test/unit/la/python/solve.py
 create mode 100644 test/unit/la/python/test.py
 create mode 100644 test/unit/math/python/test.py
 create mode 100644 test/unit/mesh/boxes.xml.gz
 create mode 100644 test/unit/mesh/cpp/CMakeLists.txt
 create mode 100644 test/unit/mesh/cpp/Mesh.cpp
 create mode 100644 test/unit/mesh/cpp/MeshFunction.cpp
 create mode 100644 test/unit/mesh/cpp/MeshValueCollection.cpp
 create mode 100644 test/unit/mesh/python/BoundaryMesh.py
 create mode 100644 test/unit/mesh/python/Cell.py
 create mode 100644 test/unit/mesh/python/Edge.py
 create mode 100644 test/unit/mesh/python/Face.py
 create mode 100644 test/unit/mesh/python/Mesh.py
 create mode 100644 test/unit/mesh/python/MeshColoring.py
 create mode 100644 test/unit/mesh/python/MeshData.py
 create mode 100644 test/unit/mesh/python/MeshEditor.py
 create mode 100644 test/unit/mesh/python/MeshFunction.py
 create mode 100644 test/unit/mesh/python/MeshIterator.py
 create mode 100644 test/unit/mesh/python/MeshMarkers.py
 create mode 100644 test/unit/mesh/python/MeshQuality.py
 create mode 100644 test/unit/mesh/python/MeshTransformation.py
 create mode 100644 test/unit/mesh/python/MeshValueCollection.py
 create mode 100644 test/unit/mesh/python/PeriodicBoundaryComputation.py
 create mode 100644 test/unit/mesh/python/SubDomain.py
 create mode 100644 test/unit/mesh/python/SubMesh.py
 create mode 100644 test/unit/meshconvert/python/data/abaqus.inp
 create mode 100644 test/unit/meshconvert/python/data/abaqus_facet.inp
 create mode 100644 test/unit/meshconvert/python/data/diffpack_tet.grid
 create mode 100644 test/unit/meshconvert/python/data/diffpack_tri.grid
 create mode 100644 test/unit/meshconvert/python/data/gmsh.msh
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_1D_2.geo
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_1D_2.msh
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_1.geo
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_1.msh
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_2.geo
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_2.msh
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_3.geo
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_3.msh
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_4.geo
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_4.msh
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_3D_1.geo
 create mode 100644 test/unit/meshconvert/python/data/gmsh_test_facet_regions_3D_1.msh
 create mode 100644 test/unit/meshconvert/python/data/test_Triangle_3.edge
 create mode 100644 test/unit/meshconvert/python/data/test_Triangle_3.ele
 create mode 100644 test/unit/meshconvert/python/data/test_Triangle_3.node
 create mode 100644 test/unit/meshconvert/python/data/triangle.ele
 create mode 100644 test/unit/meshconvert/python/data/triangle.node
 create mode 100644 test/unit/meshconvert/python/test.py
 create mode 100644 test/unit/multistage/python/PointIntegralSolver.py
 create mode 100644 test/unit/multistage/python/RKSolver.py
 create mode 100644 test/unit/nls/python/PETScSNESSolver.py
 create mode 100644 test/unit/nls/python/TAOLinearBoundSolver.py
 create mode 100644 test/unit/nls/python/doughnut.xml.gz
 create mode 100644 test/unit/parameter/cpp/CMakeLists.txt
 create mode 100644 test/unit/parameter/cpp/Parameters.cpp
 create mode 100644 test/unit/parameter/python/Parameters.py
 create mode 100644 test/unit/python-extras/python/test.py
 create mode 100644 test/unit/refinement/python/refine.py
 create mode 100644 test/unit/test.py
 create mode 100644 utils/emacs/macros
 create mode 100644 utils/gid/DOLFIN.bas
 create mode 100644 utils/matlab/meshindex.m
 create mode 100644 utils/matlab/plotcontroller.m
 create mode 100644 utils/matlab/plotslab.m
 create mode 100644 utils/matlab/xmlmatrix.m
 create mode 100644 utils/matlab/xmlmesh.m
 create mode 100644 utils/matlab/xmlvector.m
 create mode 100644 utils/octave/README
 create mode 100644 utils/octave/pdemesh.m
 create mode 100644 utils/octave/pdeplot.m
 create mode 100644 utils/octave/pdesurf.m
 create mode 100644 utils/python/README
 create mode 100755 utils/python/extract2d
 create mode 100755 utils/scripts/broken
 create mode 100755 utils/scripts/code-formatting
 create mode 100755 utils/scripts/dolfinreplace
 create mode 100755 utils/scripts/fixme
 create mode 100755 utils/scripts/formatcode
 create mode 100755 utils/scripts/klocs
 create mode 100755 utils/scripts/makedoc
 create mode 100755 utils/scripts/notinuse
 create mode 100755 utils/scripts/pdebug
 create mode 100644 utils/scripts/plotklocs
 create mode 100755 utils/swig/dolfin-swig
 create mode 100644 utils/system/monitor
 create mode 100755 utils/tetgen/dolfin-tetgen
 create mode 100644 utils/vim/macros
 create mode 100644 utils/xml/convertall

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..7e50772
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,109 @@
+# Compiled source
+*.o
+*.Plo
+*.Po
+*.lo
+*.la
+*.a
+*.os
+*.pyc
+*.so
+*.pc
+*.pyd
+*.def
+*.dll
+*.exe
+*.dylib
+dolfin/libdolfin.so*
+
+# FFC generated code in library
+dolfin/ale/Poisson*D.h
+
+# Log files
+*.log
+
+# Install directory
+/local
+/local.*
+
+# SWIG generated files
+dolfin/swig/**/**/*.py
+dolfin/swig/**/**/*.h
+dolfin/swig/**/**/*.cc
+dolfin/swig/**/**/*.cxx
+dolfin/swig/**/**/module.i
+dolfin/swig/**/**/dependencies.txt
+swigimportinfo.py
+
+# Documentation
+docstrings.i
+
+# Configuration files
+dolfin.conf
+dolfin-version
+dolfin-config.cmake
+DOLFINConfig.cmake
+DOLFINConfigVersion.cmake
+UseDOLFIN.cmake
+dolfin-config-version.cmake
+
+# Demos and tests
+demo_*
+test_*
+build_demo.*
+test/unit/mesh/{cpp,python}/*.{xml,m}
+test/unit/parameter/{cpp,python}/*.{xml,xml.gz}
+bench/**/**/cpp/forms/*.h
+bench/**/**/cpp/*.h
+test/unit/**/python/*.xml
+test/unit/**/cpp/*.xml
+
+# FFC generated demo files
+demo/**/**/cpp/*.h
+demo/pde/cahn-hilliard/cpp/CahnHilliard2D.cpp
+demo/pde/cahn-hilliard/cpp/CahnHilliard3D.cpp
+
+# QT generated code
+moc_*
+
+# Temporaries
+*~
+
+# Compressed files
+*.xz
+*.gz
+*.zs-old
+
+# Data files
+*.pvd
+*.pvtu
+*.vtu
+*.h5
+*.xdmf
+*.bin
+
+# CMake and Make file
+CMakeLists.txt
+!/CMakeLists.txt
+!dolfin/CMakeLists.txt
+!bench/CMakeLists.txt
+!dolfin/swig/CMakeLists.txt
+!doc/CMakeLists.txt
+!demo/CMakeLists.txt
+!test/CMakeLists.txt
+
+
+CMakeCache.txt
+CMakeFiles
+cmake_install.cmake
+cmake_uninstall.cmake
+Makefile
+install_manifest.txt
+
+# Local build files
+/build
+/build.*/
+
+# OS X files
+.DS_Store
+.DS_Store?
\ No newline at end of file
diff --git a/.mailmap b/.mailmap
new file mode 100644
index 0000000..1d87877
--- /dev/null
+++ b/.mailmap
@@ -0,0 +1,34 @@
+# Mapping of commit names to canonical names. This is useful for
+# listing contributions from users who have either changed email
+# addresses or did not configure their user names correctly at
+# time of a commit.
+#
+# See 'git help shortlog' for details.
+
+Benjamin Kehlet <benjamik@simula.no>
+Benjamin Kehlet <benjamik@simula.no>    Benjamin Kehlet <benjamik@ifi.uio.no>
+Benjamin Kehlet <benjamik@simula.no>    Benjamin Kehlet <benjamik@login.ifi.uio.no>
+
+Anders Logg <logg@simula.no>
+Anders Logg <logg@simula.no>            logg
+Anders Logg <logg@simula.no>            Anders Logg <logg@glaurung>
+Anders Logg <logg@simula.no>            Anders Logg <logg@olorin>
+Anders Logg <logg@simula.no>            Anders Logg <logg@tti-c.org>
+Anders Logg <logg@simula.no>            logg <devnull@localhost>
+Anders Logg <logg@simula.no>            logg <logg@bigblue.simula.no>
+Anders Logg <logg@simula.no>            logg <logg@bunjil.simula.no>
+Anders Logg <logg@simula.no>            logg <logg@olorin>
+
+Garth N. Wells <gnw20@cam.ac.uk>
+Garth N. Wells <gnw20@cam.ac.uk>        Garth N. Wells <g.n.wells@tudelft.nl>
+Garth N. Wells <gnw20@cam.ac.uk>        Garth N. Wells <garth@garth-laptop>
+Garth N. Wells <gnw20@cam.ac.uk>        Garth N. Wells <garth@gnw20pc>
+Garth N. Wells <gnw20@cam.ac.uk>        Garth N. Wells <gnw20@cam.ac.uk>
+Garth N. Wells <gnw20@cam.ac.uk>        Garth Wells <gnw20@cam.ac.uk>
+Garth N. Wells <gnw20@cam.ac.uk>        garth <garth@debian.eng.cam.ac.uk>
+Garth N. Wells <gnw20@cam.ac.uk>        garth <garth@fedora32-virtual>
+Garth N. Wells <gnw20@cam.ac.uk>        garth <garth@gnw20pc>
+Garth N. Wells <gnw20@cam.ac.uk>        garth <garth@home-laptop>
+Garth N. Wells <gnw20@cam.ac.uk>        garth <garth@localhost.localdomain>
+Garth N. Wells <gnw20@cam.ac.uk>        garth <garth@ubuntu.eng.cam.ac.uk>
+Garth N. Wells <gnw20@cam.ac.uk>        garth <garth@ubuntu32-virtual>
diff --git a/AUTHORS b/AUTHORS
new file mode 100644
index 0000000..e1afc59
--- /dev/null
+++ b/AUTHORS
@@ -0,0 +1,74 @@
+Authors/contributors in alphabetical order:
+
+  Ido Akkerman          <I.Akkerman@tudelft.nl>             (-)
+  Martin Sandve Alnæs   <martinal@simula.no>                (C)
+  Fredrik Bengzon       <bengzon@math.chalmers.se>          (-)
+  Jan Blechta           <blechta@karlin.mff.cuni.cz>        (C)
+  Rolv Erlend Bredesen  <rolv@simula.no>                    (C)
+  Jed Brown             <fenics@59A2.org>                   (C)
+  Solveig Bruvoll       <solveio@ifi.uio.no>                (C)
+  Niklas Ericsson       <nen@math.chalmers.se>              (-)
+  Patrick Farrell       <patrick.farrell06@imperial.ac.uk>  (C)
+  Georgios Foufas       <foufas@math.chalmers.se>           (C)
+  Joachim B Haga        <jobh@broadpark.no>                 (C)
+  Johan Hake            <hake@simula.no>                    (C)
+  Jack S. Hale          <j.hale09@imperial.ac.uk>           (C)
+  Rasmus Hemph          <PDE project course 2001/2002>      (-)
+  David Heintz          <david.heintz@comhem.se>            (-)
+  Johan Hoffman         <hoffman@csc.kth.se>                (C)
+  Par Ingelstrom        <pi@elmagn.chalmers.se>             (-)
+  Anders E. Johansen    <andersej@math.uio.no>              (C)
+  Johan Jansson         <johanjan@math.chalmers.se>         (C)
+  Niclas Jansson        <njansson@kth.se>                   (C)
+  Alexander Jarosch     <alexanj@hi.is>                     (C)
+  Kristen Kaasbjerg     <cosby@fys.ku.dk>                   (C)
+  Benjamin Kehlet       <benjamik@simula.no>                (C)
+  Arve Knudsen          <arvenk@simula.no>                  (C)
+  Karin Kraft           <kakr@math.chalmers.se>             (-)
+  Aleksandra Krusper    <PDE project course 2001/2002>      (-)
+  Evan Lezar            <mail@evanlezar.com>                (C)
+  Dag Lindbo            <dag@csc.kth.se>                    (C)
+  Glenn Terje Lines     <glennli@simula.no>                 (C)
+  Anders Logg           <logg@simula.no>                    (C)
+  Nuno Lopes            <ndl@ptmat.fc.ul.pt>                (C)
+  Kent-Andre Mardal     <kent-and@simula.no>                (C)
+  Andreas Mark          <f00anma@dd.chalmers.se>            (-)
+  Andre Massing         <massing@simula.no>                 (C)
+  Lawrence Mitchell     <lawrence.mitchell@imperial.ac.uk>  (C)
+  Marco Morandini       <morandini@aero.polimi.it>          (C)
+  Mikael Mortensen      <mikael.mortensen@gmail.com>        (C)
+  Corrado Maurini       <cmaurini@gmail.com>                (C)
+  Pablo De Napoli       <pdenapo@gmail.com>                 (-)
+  Harish Narayanan      <hnarayanan@gmail.com>              (C)
+  Andreas Nilsson       <f99anni@dd.chalmers.se>            (-)
+  Minh Do-Quang         <minh@mech.kth.se>                  (-)
+  Chris Richardson      <chris@bpi.cam.ac.uk>               (!)
+  Johannes Ring         <johannr@simula.no>                 (C)
+  Marie E. Rognes       <meg@simula.no>                     (C)
+  John Rudge            <jfr23@cam.ac.uk>                   (-)
+  Bartosz Sawicki       <sawickib@iem.pw.edu.pl>            (C)
+  Nico Schlömer         <nico.schloemer@gmail.com>          (C)
+  Kristoffer Selim      <selim@simula.no>                   (C)
+  Angelo Simone         <a.simone@tudelft.nl>               (C)
+  Ola Skavhaug          <skavhaug@simula.no>                (C)
+  Thomas Svedberg       <thsv@am.chalmers.se>               (-)
+  Erik Svensson         <eriksv@math.chalmers.se>           (C)
+  Harald Svensson       <harald.s@home.se>                  (-)
+  Andy Terrel           <aterrel@uchicago.edu>              (C)
+  Jim Tilander          <jt@dd.chalmers.se>                 (C)
+  Fredrik Valdmanis     <fredrik@valdmanis.com>             (C)
+  Magnus Vikstrøm       <gustavv@ifi.uio.no>                (C)
+  Walter Villanueva     <PDE project course 2001/2002>      (-)
+  Shawn Walker          <walker@cims.nyu.edu>               (C)
+  Garth N. Wells        <gnw20@cam.ac.uk>                   (C)
+  Ilmar Wilbers         <ilmarw@simula.dot.no>              (C)
+  Cian Wilson           <cwilson@ldeo.columbia.edu>         (C)
+  Åsmund Ødegård        <aasmund@simula.no>                 (C)
+  Kristian Ølgaard      <k.b.oelgaard@tudelft.nl>           (C)
+
+(C) = copyright form signed
+(!) = missing copyright form!
+(-) = minor change, copyright form not signed
+
+Missing credits? Tell us and we will fix it.
+Send an email to fenics@fenicsproject.org
diff --git a/CMakeLists.txt b/CMakeLists.txt
new file mode 100644
index 0000000..5ab15f5
--- /dev/null
+++ b/CMakeLists.txt
@@ -0,0 +1,1048 @@
+# Top level CMakeLists.txt file for DOLFIN
+
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+#------------------------------------------------------------------------------
+# Set project name and version number
+
+project(DOLFIN)
+set(DOLFIN_VERSION_MAJOR "1")
+set(DOLFIN_VERSION_MINOR "4")
+set(DOLFIN_VERSION_MICRO "0")
+set(DOLFIN_VERSION "${DOLFIN_VERSION_MAJOR}.${DOLFIN_VERSION_MINOR}.${DOLFIN_VERSION_MICRO}")
+
+#------------------------------------------------------------------------------
+# Get GIT changeset, if available
+
+# Check for git
+find_program(GIT_FOUND git)
+
+if (GIT_FOUND)
+  # Get the commit hash of the working branch
+  execute_process(COMMAND git rev-parse HEAD
+    WORKING_DIRECTORY ${CMAKE_SOURCE_DIR}
+    OUTPUT_VARIABLE GIT_COMMIT_HASH
+    OUTPUT_STRIP_TRAILING_WHITESPACE
+    )
+else()
+  set(GIT_COMMIT_HASH "unknown")
+endif()
+
+#------------------------------------------------------------------------------
+# General configuration
+
+# Set CMake options, see `cmake --help-policy CMP000x`
+if (COMMAND cmake_policy)
+  cmake_policy(SET CMP0003 NEW)
+  cmake_policy(SET CMP0004 OLD)
+endif()
+
+# Set location of our FindFoo.cmake modules
+set(DOLFIN_CMAKE_DIR "${DOLFIN_SOURCE_DIR}/cmake" CACHE INTERNAL "")
+set(CMAKE_MODULE_PATH "${DOLFIN_CMAKE_DIR}/modules")
+
+# Make sure CMake uses the correct DOLFINConfig.cmake for tests and demos
+set(CMAKE_PREFIX_PATH ${CMAKE_PREFIX_PATH} ${CMAKE_CURRENT_BINARY_DIR}/dolfin)
+
+#------------------------------------------------------------------------------
+# Configurable options for how we want to build
+
+option(BUILD_SHARED_LIBS "Build DOLFIN with shared libraries." ON)
+option(CMAKE_SKIP_RPATH "Do not add runtime paths when using shared libraries." OFF)
+option(CMAKE_INSTALL_RPATH_USE_LINK_PATH "Add paths to linker search and installed rpath." ON)
+option(CMAKE_USE_RELATIVE_PATHS "Use relative paths in makefiles and projects." OFF)
+option(DOLFIN_AUTO_DETECT_MPI "Detect MPI automatically - turn this off to use the MPI compiler wrappers directly via setting CXX, CXX, FC." ON)
+option(DOLFIN_DEBUG_UBLAS "Use extra uBLAS debugging." OFF)
+option(DOLFIN_ENABLE_CODE_COVERAGE "Enable code coverage." OFF)
+option(DOLFIN_WITH_LIBRARY_VERSION "Build with library version information." ON)
+option(DOLFIN_ENABLE_UNIT_TESTS "Enable unit tests." ON)
+option(DOLFIN_ENABLE_TESTING "Enable testing." OFF)
+option(DOLFIN_ENABLE_BENCHMARKS "Enable benchmark programs." OFF)
+option(DOLFIN_ENABLE_DOCS "Enable generation of documentation." ON)
+option(DOLFIN_SKIP_BUILD_TESTS "Skip build tests." OFF)
+option(DOLFIN_DEPRECATION_ERROR "Turn deprecation warnings into errors." OFF)
+#------------------------------------------------------------------------------
+# This should be removed when petsc version > 3.4 is out
+
+option(DOLFIN_ENABLE_TAO "Enable TAO solver." OFF)
+
+#------------------------------------------------------------------------------
+# Enable or disable optional packages
+
+# List optional packages
+set(OPTIONAL_PACKAGES "")
+list(APPEND OPTIONAL_PACKAGES "OpenMP")
+list(APPEND OPTIONAL_PACKAGES "MPI")
+list(APPEND OPTIONAL_PACKAGES "PETSc")
+list(APPEND OPTIONAL_PACKAGES "PETSc4py")
+list(APPEND OPTIONAL_PACKAGES "SLEPc")
+list(APPEND OPTIONAL_PACKAGES "Trilinos")
+list(APPEND OPTIONAL_PACKAGES "UMFPACK")
+list(APPEND OPTIONAL_PACKAGES "CHOLMOD")
+list(APPEND OPTIONAL_PACKAGES "PaStiX")
+list(APPEND OPTIONAL_PACKAGES "SCOTCH")
+list(APPEND OPTIONAL_PACKAGES "ParMETIS")
+list(APPEND OPTIONAL_PACKAGES "CGAL")
+list(APPEND OPTIONAL_PACKAGES "zlib")
+list(APPEND OPTIONAL_PACKAGES "Python")
+list(APPEND OPTIONAL_PACKAGES "Sphinx")
+list(APPEND OPTIONAL_PACKAGES "HDF5")
+list(APPEND OPTIONAL_PACKAGES "VTK")
+list(APPEND OPTIONAL_PACKAGES "QT")
+
+# Add options
+foreach (OPTIONAL_PACKAGE ${OPTIONAL_PACKAGES})
+  string(TOUPPER "DOLFIN_ENABLE_${OPTIONAL_PACKAGE}" OPTION_NAME)
+  option(${OPTION_NAME} "Compile with support for ${OPTIONAL_PACKAGE}." ON)
+endforeach()
+
+#------------------------------------------------------------------------------
+# General compiler defintions
+
+if (DOLFIN_DEPRECATION_ERROR)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DDOLFIN_DEPRECATION_ERROR")
+endif()
+
+#------------------------------------------------------------------------------
+# Package-specific options
+
+option(CGAL_DISABLE_ROUNDING_MATH_CHECK "Disable rounding math check in CGAL. This permits Valgrind to run." OFF)
+
+#------------------------------------------------------------------------------
+# Compiler flags
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug Developer MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Check for some compiler flags
+include(CheckCXXCompilerFlag)
+CHECK_CXX_COMPILER_FLAG(-pipe HAVE_PIPE)
+if (HAVE_PIPE)
+  set(DOLFIN_CXX_DEVELOPER_FLAGS "-pipe ${DOLFIN_CXX_DEVELOPER_FLAGS}")
+endif()
+
+# Add some strict compiler checks
+CHECK_CXX_COMPILER_FLAG("-Wall -Werror -pedantic" HAVE_PEDANTIC)
+if (HAVE_PEDANTIC)
+  set(DOLFIN_CXX_DEVELOPER_FLAGS "-Wall -Werror -pedantic ${DOLFIN_CXX_DEVELOPER_FLAGS}")
+endif()
+
+if (CYGWIN OR (WIN32 AND UNIX))
+  # Use -std=gnu++11 instead of -std=c++11 on Cygwin to work around
+  # problem when using vsnprintf.
+  CHECK_CXX_COMPILER_FLAG(-std=gnu++11 HAVE_STD_GNUPP11)
+  if (HAVE_STD_GNUPP11)
+    SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=gnu++11")
+  else()
+    CHECK_CXX_COMPILER_FLAG(-std=gnu++0x HAVE_STD_GNUPP0x)
+    if (HAVE_STD_GNUPP0x)
+      SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=gnu++0x")
+    endif()
+  endif()
+else()
+  CHECK_CXX_COMPILER_FLAG(-std=c++11 HAVE_STD_CPP11)
+  if (HAVE_STD_CPP11)
+    SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
+  else()
+    CHECK_CXX_COMPILER_FLAG(-std=c++0x HAVE_STD_CPP0x)
+    if (HAVE_STD_CPP0x)
+      SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++0x")
+    endif()
+  endif()
+endif()
+
+# Debug flags
+CHECK_CXX_COMPILER_FLAG(-g HAVE_DEBUG)
+if (HAVE_DEBUG)
+  set(DOLFIN_CXX_DEVELOPER_FLAGS "-g ${DOLFIN_CXX_DEVELOPER_FLAGS}")
+endif()
+
+CHECK_CXX_COMPILER_FLAG(-O2 HAVE_O2_OPTIMISATION)
+if (HAVE_O2_OPTIMISATION)
+  set(DOLFIN_CXX_DEVELOPER_FLAGS "-O2 ${DOLFIN_CXX_DEVELOPER_FLAGS}")
+endif()
+
+# Set 'Developer' build type flags
+set(CMAKE_CXX_FLAGS_DEVELOPER "${DOLFIN_CXX_DEVELOPER_FLAGS}" CACHE STRING
+  "Flags used by the compiler during development." FORCE)
+
+# Do not debug uBLAS unless requested
+if (NOT DOLFIN_DEBUG_UBLAS)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DBOOST_UBLAS_NDEBUG")
+endif()
+
+# FIXME: Do we want to add -DDEBUG to RelWithDebInfo?
+
+# Add debug definitions
+if (CMAKE_BUILD_TYPE STREQUAL "Developer" OR CMAKE_BUILD_TYPE STREQUAL "Debug")
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DDEBUG")
+endif()
+
+# Add flags for generating code coverage reports
+if (DOLFIN_ENABLE_CODE_COVERAGE AND CMAKE_COMPILER_IS_GNUCXX)
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fprofile-arcs -ftest-coverage")
+  set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -fprofile-arcs -ftest-coverage")
+endif()
+
+# Settings for Intel compilers
+if("${CMAKE_CXX_COMPILER_ID}" STREQUAL "Intel")
+  # Use -isystem incluse flag with Intel compiler
+  set(CMAKE_INCLUDE_SYSTEM_FLAG_CXX "-isystem ")
+
+  # Stop spurious warnings from older Intel compilers
+  if("${CMAKE_CXX_COMPILER_VERSION}" LESS "13")
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -wd654,1125")
+    set(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} -wd654,1125")
+    set(CMAKE_CXX_FLAGS_DEVELOPER "${CMAKE_CXX_FLAGS_DEVELOPER} -wd654,1125")
+    set(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -wd654,1125")
+    set(CMAKE_CXX_FLAGS_RELWITHDEBINFO "${CMAKE_CXX_FLAGS_RELWITHDEBINFO} -wd654,1125")
+  endif()
+endif()
+
+# Set system include flags to get around CMake bug on OSX with gcc
+# See http://public.kitware.com/Bug/print_bug_page.php?bug_id=10837
+if ("${CMAKE_CXX_COMPILER_ID}" STREQUAL "GNU")
+  set(CMAKE_INCLUDE_SYSTEM_FLAG_CXX "-isystem ")
+endif()
+
+if (APPLE)
+  set(CMAKE_INCLUDE_SYSTEM_FLAG_CXX "-isystem ")
+  set(CMAKE_CXX_FLAGS_DEVELOPER "${CMAKE_CXX_FLAGS_DEVELOPER} -Wno-long-long")
+  set(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} -Wno-long-long")
+  set(CMAKE_CXX_FLAGS_RELWITHDEBINFO "${CMAKE_CXX_FLAGS_RELWITHDEBINFO} -Wno-long-long")
+endif()
+
+#------------------------------------------------------------------------------
+# Enable Fortran if available. Used for some configuration tests (e.g. BLAS)
+
+# This workaround address a CMake bug (http://cmake.org/Bug/view.php?id=9220)
+include(language_support_v2)
+workaround_9220(Fortran Fortran_language_works)
+if (Fortran_language_works)
+  enable_language(Fortran OPTIONAL)
+endif()
+
+#------------------------------------------------------------------------------
+# Check type sizes
+
+include(CheckTypeSize)
+
+# Check size of size_t
+check_type_size("size_t" size_t_size)
+if (size_t_size)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DDOLFIN_SIZE_T=${size_t_size}")
+endif()
+
+#------------------------------------------------------------------------------
+# Check for MPI and OpenMP
+
+# FIXME: Should be set CMake to use the MPI compiler wrappers?
+
+if (DOLFIN_ENABLE_MPI)
+  if (DOLFIN_AUTO_DETECT_MPI)
+    find_package(MPI)
+    if (MPI_CXX_FOUND)
+      set(MPI_FOUND TRUE)
+    endif()
+  else()
+    # Assume user has set MPI compiler wrappers (via CXX, etc or CMAKE_CXX_COMPILER, etc)
+    set(MPI_FOUND TRUE)
+    set(MPI_CXX_FOUND TRUE)
+    set(MPI_C_FOUND TRUE)
+  endif()
+endif()
+
+if (DOLFIN_ENABLE_OPENMP)
+  find_package(OpenMP)
+  include(CheckOpenMP)
+  check_openmp_unsigned_int_loop_control_variable(OPENMP_UINT_TEST_RUNS)
+  if (NOT OPENMP_UINT_TEST_RUNS)
+    set(OPENMP_FOUND FALSE)
+  endif()
+endif()
+
+#------------------------------------------------------------------------------
+# Run tests to find required packages
+
+# Check for Boost
+set(BOOST_ROOT $ENV{BOOST_DIR})
+if (BOOST_ROOT)
+  set(Boost_NO_SYSTEM_PATHS on)
+endif()
+
+# Prevent FindBoost.cmake from looking for system  Boost{foo}.cmake files
+set(Boost_NO_BOOST_CMAKE true)
+
+set(Boost_USE_MULTITHREADED $ENV{BOOST_USE_MULTITHREADED})
+set(Boost_ADDITIONAL_VERSIONS 1.48 1.48.0 1.49 1.49.0 1.50 1.50.0)
+
+find_package(Boost 1.48 QUIET REQUIRED)
+
+set(DOLFIN_BOOST_COMPONENTS filesystem program_options system thread iostreams)
+find_package(Boost COMPONENTS ${DOLFIN_BOOST_COMPONENTS} REQUIRED)
+
+# Check for required package UFC
+find_package(UFC 1.4.0 QUIET HINTS ${UFC_DIR})
+if (NOT UFC_FOUND)
+  message(FATAL_ERROR "Could not find a configuration file for package UFC that is "
+    "compatible with requested version 1.4.0.\n"
+    "Set UFC_DIR to the directory containing a CMake configuration file for UFC.")
+else()
+  message(STATUS "UFC version: ${UFC_VERSION_STRING}")
+endif()
+
+# Check for required package Eigen3
+find_package(Eigen3 3.0.0 REQUIRED)
+
+# Check for required package LibXml2
+find_package(LibXml2 REQUIRED)
+
+#------------------------------------------------------------------------------
+# Run tests to find optional packages
+
+# Note: Check for Python interpreter even when Python is disabled because it
+#       is used to get the installation path for dolfin_utils
+find_package(PythonInterp 2)
+if (DOLFIN_ENABLE_PYTHON)
+
+  # Set variables to help find Python library that is compatible with
+  # interpreter
+  if (PYTHONINTERP_FOUND)
+    # Get Python include path from Python interpretter
+    execute_process(COMMAND "${PYTHON_EXECUTABLE}" -c
+                           "import distutils.sysconfig, sys; sys.stdout.write(distutils.sysconfig.get_python_inc())"
+                    OUTPUT_VARIABLE _PYTHON_INCLUDE_PATH
+                    RESULT_VARIABLE _PYTHON_INCLUDE_RESULT)
+
+    # Get Python library path from interpreter
+    execute_process(COMMAND "${PYTHON_EXECUTABLE}" -c
+                          "import os, sys, inspect; sys.stdout.write(os.path.split(os.path.split(inspect.getfile(inspect))[0])[0])"
+                    OUTPUT_VARIABLE _PYTHON_LIB_PATH
+                    RESULT_VARIABLE _PYTHON_LIB_RESULT)
+
+    # Set include path, if returned by interpreter
+    if ("${_PYTHON_INCLUDE_RESULT}" STREQUAL "0")
+      set(PYTHON_INCLUDE_DIR ${_PYTHON_INCLUDE_PATH})
+    endif()
+
+    # Add a search path for Python library based on output from
+    # interpreter
+    set(CMAKE_LIBRARY_PATH_SAVE ${CMAKE_LIBRARY_PATH})
+    if ("${_PYTHON_LIB_RESULT}" STREQUAL "0")
+      set(CMAKE_LIBRARY_PATH ${_PYTHON_LIB_PATH})
+    endif()
+
+    # Find Pythons libs
+    find_package(PythonLibs ${PYTHON_VERSION_STRING} EXACT QUIET REQUIRED)
+    set(CMAKE_LIBRARY_PATH ${CMAKE_LIBRARY_PATH_SAVE})
+  endif()
+
+  # If Python is found, check for NumPy and SWIG
+  if (PYTHONINTERP_FOUND AND PYTHONLIBS_FOUND)
+    find_package(NumPy REQUIRED)
+
+    find_package(SWIG REQUIRED)
+    if (${SWIG_VERSION} LESS 2.0)
+      message(FATAL_ERROR " DOLFIN requires SWIG version 2.0 or greater. You have version ${SWIG_VERSION}. Set DOLFIN_ENABLE_PYTHON to False or install correct SWIG version.")
+    endif()
+    include(UseSWIG)
+    set(PYTHON_FOUND TRUE)
+  endif()
+
+endif()
+
+# Check for PETSc, SLEPc and petsc4py
+if (DOLFIN_ENABLE_PETSC)
+  find_package(PETSc 3.3)
+
+  if (PETSC_FOUND AND DOLFIN_ENABLE_SLEPC)
+    find_package(SLEPc 3.3)
+  endif()
+
+  if (PETSC_FOUND AND PYTHON_FOUND AND DOLFIN_ENABLE_PETSC4PY)
+    find_package(PETSc4py)
+    if (PETSC4PY_FOUND)
+      if (NOT ("${PETSC4PY_VERSION_MAJOR}" EQUAL "${PETSC_VERSION_MAJOR}"
+               AND "${PETSC4PY_VERSION_MINOR}" EQUAL "${PETSC_VERSION_MINOR}"))
+        message(WARNING "PETSc version ${PETSC_VERSION} and petsc4py version ${PETSC4PY_VERSION} do not match.  Disabling petsc4py support")
+        set(PETSC4PY_FOUND FALSE)
+      endif()
+    endif()
+  endif()
+
+  # Enable PETSc SNES for PETSc verion > 3.3
+  if (PETSC_VERSION VERSION_GREATER 3.3.100)
+    set(PETSC_ENABLE_SNES TRUE)
+  endif()
+
+  # Enable TAO from PETSc for PETSc verion > 3.4
+  if ((PETSC_VERSION VERSION_GREATER 3.4.100) OR (DOLFIN_ENABLE_TAO))
+    set(PETSC_ENABLE_TAO TRUE)
+  endif()
+
+endif()
+
+# Check for ParMETIS and SCOTCH
+if (DOLFIN_ENABLE_MPI AND MPI_C_FOUND)
+  if (DOLFIN_ENABLE_PARMETIS)
+    find_package(ParMETIS 4.0.2)
+  endif()
+
+  if (DOLFIN_ENABLE_SCOTCH)
+    find_package(SCOTCH)
+  endif()
+endif()
+
+# Check for UMFPACK
+if (DOLFIN_ENABLE_UMFPACK)
+  find_package(AMD QUIET)
+  find_package(BLAS QUIET)
+  find_package(UMFPACK QUIET)
+endif()
+
+# Check for CHOLMOD
+if (DOLFIN_ENABLE_CHOLMOD)
+  find_package(CHOLMOD QUIET)
+endif()
+
+# Check for HDF5
+if (DOLFIN_ENABLE_HDF5)
+  if (NOT DEFINED ENV{HDF5_ROOT})
+    set(ENV{HDF5_ROOT} "$ENV{HDF5_DIR}")
+  endif()
+  find_package(HDF5)
+
+  # Check that HDF5 has parallel support
+  if (HDF5_FOUND)
+    if (DOLFIN_ENABLE_MPI)
+      if (NOT (HDF5_IS_PARALLEL OR HDF5_ENABLE_PARALLEL))
+        message(STATUS "HDF5 has been found, but is missing parallel support. It will not be enabled.")
+        set(HDF5_FOUND false)
+      endif()
+    else()
+      message(STATUS "HDF5 has been found, but MPI support is missing. It will not be enabled.")
+      set(HDF5_FOUND false)
+    endif()
+  endif()
+endif()
+
+# Check for PaStiX
+if (DOLFIN_ENABLE_PASTIX)
+  find_package(PaStiX 5.2.1)
+endif()
+
+# Check for Trilinos and the requires Trilinos packages
+if (DOLFIN_ENABLE_TRILINOS)
+  message(STATUS "Checking for Trilinos")
+  find_package(Trilinos PATHS ${TRILINOS_DIR} ${Trilinos_DIR} $ENV{TRILINOS_DIR} QUIET)
+  set(DOLFIN_TRILINOS_PACKAGES "Epetra;Zoltan;ML;Ifpack;Amesos;Belos")
+
+  if ("${Trilinos_VERSION}" VERSION_LESS "11.0.0")
+    set(Trilinos_FOUND FALSE)
+    message(STATUS "Unable to find Trilinos (>= 11.0.0)")
+  endif()
+
+  # Check for required packages
+  set(DOLFIN_TRILINOS_PACKAGES_FOUND false)
+  if (Trilinos_FOUND)
+    message(STATUS "  Trilinos version ${Trilinos_VERSION} found. Checking for components")
+
+    # Check that necessary packages are enabled
+    set(DOLFIN_TRILINOS_PACKAGES_FOUND true)
+    foreach (required_package ${DOLFIN_TRILINOS_PACKAGES})
+
+      # Search for required package in list of available packages
+      list(FIND Trilinos_PACKAGE_LIST ${required_package} required_trilinos_package_index)
+      if(required_trilinos_package_index EQUAL -1)
+          set(required_trilinos_package_found false)
+      else()
+          set(required_trilinos_package_found true)
+      endif()
+
+      # Print whether or not package is found
+      if (required_trilinos_package_found)
+        message(STATUS "    ${required_package} found")
+      else()
+        message(STATUS "    Trilinos found, but required package ${required_package} not found. Trilinos will be disabled.")
+        set(DOLFIN_TRILINOS_PACKAGES_FOUND false)
+        break()
+      endif()
+
+    endforeach()
+
+    # Add package libraries if all packages have been found
+    if (DOLFIN_TRILINOS_PACKAGES_FOUND)
+      message(STATUS "  All necessary Trilinos components found. Trilinos will be enabled.")
+      set(DOLFIN_TRILINOS_DEFINITIONS)
+
+      # Loop over each package
+      foreach (package ${DOLFIN_TRILINOS_PACKAGES})
+
+        # Loop over libs and get full path
+        foreach (lib ${${package}_LIBRARIES})
+          find_library(TRILINOS_LIB_${lib} ${lib} PATHS ${${package}_LIBRARY_DIRS} NO_DEFAULT_PATH)
+          # Also search the default paths
+          find_library(TRILINOS_LIB_${lib} ${lib})
+          if (TRILINOS_LIB_${lib})
+            list(APPEND DOLFIN_TRILINOS_LIBRARIES ${TRILINOS_LIB_${lib}})
+          endif()
+        endforeach()
+
+      endforeach()
+
+      # Remove duplicates
+      list(REVERSE DOLFIN_TRILINOS_LIBRARIES)
+      list(REMOVE_DUPLICATES DOLFIN_TRILINOS_LIBRARIES)
+      list(REVERSE DOLFIN_TRILINOS_LIBRARIES)
+
+    endif()
+
+  else()
+    message(STATUS "Trilinos could not be found")
+  endif()
+endif()
+
+
+# Check for CGAL
+if (DOLFIN_ENABLE_CGAL)
+  find_package(CGAL 4.1)
+endif()
+
+# Check for zlib
+if (DOLFIN_ENABLE_ZLIB)
+  find_package(ZLIB)
+endif()
+
+# Check for cppunit
+if (DOLFIN_ENABLE_UNIT_TESTS)
+  find_package(CppUnit)
+
+  # Older version of CPPUNIT use std::auto_ptr, which is deprecated
+  if (CPPUNIT_FOUND)
+    if (${CPPUNIT_VERSION} LESS 1.13.1)
+      include(CheckCXXCompilerFlag)
+      CHECK_CXX_COMPILER_FLAG(-Wno-deprecated HAVE_NO_DEPRECATED)
+      if (HAVE_NO_DEPRECATED)
+        set(CMAKE_CXX_FLAGS_DEVELOPER "${CMAKE_CXX_FLAGS_DEVELOPER} -Wno-deprecated")
+      endif()
+    endif()
+  endif()
+
+endif()
+
+# Check for Sphinx
+if (DOLFIN_ENABLE_DOCS AND PYTHON_FOUND)
+  find_package(Sphinx 1.1.0)
+endif()
+
+# Check for Qt4
+if (DOLFIN_ENABLE_QT)
+  find_package(Qt4)
+endif()
+
+# Check for VTK
+if (DOLFIN_ENABLE_VTK)
+  find_package(VTK HINTS ${VTK_DIR} $ENV{VTK_DIR})
+  set(VTK_VERSION "${VTK_MAJOR_VERSION}.${VTK_MINOR_VERSION}")
+  if (VTK_FOUND)
+    if ("${VTK_VERSION}" VERSION_LESS "5.2")
+      set(VTK_FOUND FALSE)
+      message(WARNING "Unable to find VTK (>= 5.2)")
+    else()
+      message(STATUS "Found VTK: ${VTK_DIR} (found version \"${VTK_VERSION}\")")
+    endif()
+  endif()
+endif()
+
+#------------------------------------------------------------------------------
+# Print summary of found and not found optional packages
+
+# FIXME: Use FeatureSummary.cmake to do this
+
+# Gather information about which optional packages were found and not found
+set(OPTIONAL_PACKAGES_FOUND "")
+set(OPTIONAL_PACKAGES_NOT_FOUND "")
+set(OPTIONAL_PACKAGES_NOT_ENABLED "")
+foreach (OPTIONAL_PACKAGE ${OPTIONAL_PACKAGES})
+  string(TOUPPER "${OPTIONAL_PACKAGE}" PKG)
+  if (${PKG}_FOUND OR ${OPTIONAL_PACKAGE}_FOUND)
+    list(APPEND OPTIONAL_PACKAGES_FOUND ${PKG})
+  elseif (DOLFIN_ENABLE_${PKG})
+    list(APPEND OPTIONAL_PACKAGES_NOT_FOUND ${PKG})
+  else()
+    list(APPEND OPTIONAL_PACKAGES_NOT_ENABLED ${PKG})
+  endif()
+endforeach()
+
+message(STATUS "")
+
+# Print information about packages that were found
+if (OPTIONAL_PACKAGES_FOUND)
+  message(STATUS "The following optional packages were found:")
+  message(STATUS "-------------------------------------------")
+  foreach (OPTIONAL_PACKAGE ${OPTIONAL_PACKAGES_FOUND})
+    string(TOUPPER "${OPTIONAL_PACKAGE}" PKG)
+    message(STATUS "(OK) ${OPTIONAL_PACKAGE}")
+  endforeach()
+  message(STATUS "")
+endif()
+
+# Print information about packages that were not enabled
+if (OPTIONAL_PACKAGES_NOT_ENABLED)
+  message(STATUS "The following optional packages were not enabled:")
+  message(STATUS "-------------------------------------------------")
+  foreach (OPTIONAL_PACKAGE ${OPTIONAL_PACKAGES_NOT_ENABLED})
+    string(TOUPPER "${OPTIONAL_PACKAGE}" PKG)
+    message(STATUS "(--) ${OPTIONAL_PACKAGE}")
+  endforeach()
+  message(STATUS "")
+endif()
+
+# Print information about packages that were not found
+if (OPTIONAL_PACKAGES_NOT_FOUND)
+  message(STATUS "The following optional packages were not found:")
+  message(STATUS "-----------------------------------------------")
+  foreach (OPTIONAL_PACKAGE ${OPTIONAL_PACKAGES_NOT_FOUND})
+    string(TOUPPER "${OPTIONAL_PACKAGE}" PKG)
+    message(STATUS "(**) ${OPTIONAL_PACKAGE}")
+  endforeach()
+  message(STATUS "")
+endif()
+
+#------------------------------------------------------------------------------
+# Get installation paths for Python modules (pure and platform-dependent)
+
+if (PYTHONINTERP_FOUND)
+
+  if (NOT DEFINED DOLFIN_INSTALL_PYTHON_MODULE_DIR)
+    # Get path for platform-dependent Python modules (since we install a binary libary)
+
+    # Python command string to discover module install location
+    if (CMAKE_INSTALL_PREFIX_INITIALIZED_TO_DEFAULT)
+      set(PYTHON_LIB_DISCOVER_STR "import sys, distutils.sysconfig; sys.stdout.write(distutils.sysconfig.get_python_lib(plat_specific=True))")
+    else()
+      set(PYTHON_LIB_DISCOVER_STR "import sys, distutils.sysconfig; sys.stdout.write(distutils.sysconfig.get_python_lib(plat_specific=True, prefix='${CMAKE_INSTALL_PREFIX}'))")
+    endif()
+
+    # Probe Python interpreter
+    execute_process(COMMAND ${PYTHON_EXECUTABLE} -c "${PYTHON_LIB_DISCOVER_STR}"
+      OUTPUT_VARIABLE DOLFIN_INSTALL_PYTHON_MODULE_DIR
+      )
+    set(DOLFIN_INSTALL_PYTHON_MODULE_DIR ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}
+      CACHE PATH "Python extension module installation directory.")
+  endif()
+
+  if (NOT DEFINED DOLFIN_INSTALL_PYTHON_PURE_MODULE_DIR)
+    # Get path for pure Python modules
+
+    # Python command string to discover module install location
+    if (CMAKE_INSTALL_PREFIX_INITIALIZED_TO_DEFAULT)
+      set(PYTHON_LIB_DISCOVER_STR "import sys, distutils.sysconfig; sys.stdout.write(distutils.sysconfig.get_python_lib(plat_specific=False))")
+    else()
+      set(PYTHON_LIB_DISCOVER_STR "import sys, distutils.sysconfig; sys.stdout.write(distutils.sysconfig.get_python_lib(plat_specific=False, prefix='${CMAKE_INSTALL_PREFIX}'))")
+    endif()
+
+    # Probe Pyton interpreter
+    execute_process(COMMAND ${PYTHON_EXECUTABLE} -c "${PYTHON_LIB_DISCOVER_STR}"
+      OUTPUT_VARIABLE DOLFIN_INSTALL_PYTHON_PURE_MODULE_DIR
+      )
+    set(DOLFIN_INSTALL_PYTHON_PURE_MODULE_DIR ${DOLFIN_INSTALL_PYTHON_PURE_MODULE_DIR}
+      CACHE PATH "Python module installation directory.")
+  endif()
+
+endif()
+
+#------------------------------------------------------------------------------
+# Installation of DOLFIN and FEniCS Python modules
+
+if (DOLFIN_ENABLE_PYTHON AND PYTHON_FOUND)
+  install(DIRECTORY
+    ${CMAKE_SOURCE_DIR}/site-packages/dolfin
+    DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}
+    USE_SOURCE_PERMISSIONS
+    COMPONENT RuntimeLibraries
+    PATTERN "*.in" EXCLUDE
+    )
+
+  configure_file(${CMAKE_SOURCE_DIR}/site-packages/dolfin/common/globalparameters.py.in
+    ${CMAKE_BINARY_DIR}/globalparameters.py @ONLY)
+
+  install(FILES ${CMAKE_BINARY_DIR}/globalparameters.py
+    DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin/common/
+    COMPONENT RuntimeLibraries
+    )
+
+  install(DIRECTORY
+    ${CMAKE_SOURCE_DIR}/site-packages/fenics
+    DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}
+    USE_SOURCE_PERMISSIONS
+    COMPONENT RuntimeLibraries
+    PATTERN "*.in" EXCLUDE
+    )
+endif()
+
+#------------------------------------------------------------------------------
+# Installation of dolfin_utils
+
+if (DOLFIN_INSTALL_PYTHON_MODULE_DIR)
+  install(DIRECTORY ${CMAKE_SOURCE_DIR}/site-packages/dolfin_utils
+    DESTINATION ${DOLFIN_INSTALL_PYTHON_PURE_MODULE_DIR}
+    USE_SOURCE_PERMISSIONS)
+
+  # Add target "install_dolfin_utils" for installing dolfin_utils
+  # without building and install the rest of DOLFIN
+  add_custom_target(install_dolfin_utils
+    COMMAND ${CMAKE_COMMAND} -E copy_directory
+      "${CMAKE_SOURCE_DIR}/site-packages/dolfin_utils"
+      "${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin_utils"
+    COMMENT "Installing dolfin_utils in ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin_utils")
+endif()
+
+#------------------------------------------------------------------------------
+# Installation of docstrings
+
+#install(DIRECTORY ${CMAKE_SOURCE_DIR}/site-packages/dolfin/docstrings
+#        DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin
+#        USE_SOURCE_PERMISSIONS)
+
+#------------------------------------------------------------------------------
+# Installation of DOLFIN library
+
+# Append the library version information to the library target properties
+if (DOLFIN_WITH_LIBRARY_VERSION)
+  string(REPLACE "+" "" DOLFIN_LIBRARY_VERSION ${DOLFIN_VERSION})
+  # This setting of SOVERSION assumes that any API change
+  # will increment either the minor or major version number.
+  set(DOLFIN_LIBRARY_PROPERTIES ${DOLFIN_LIBRARY_PROPERTIES}
+    VERSION ${DOLFIN_LIBRARY_VERSION}
+    SOVERSION ${DOLFIN_VERSION_MAJOR}.${DOLFIN_VERSION_MINOR}
+  )
+endif()
+
+# Set DOLFIN install sub-directories
+set(DOLFIN_BIN_DIR "bin" CACHE PATH "Binary installation directory.")
+set(DOLFIN_LIB_DIR "lib" CACHE PATH "Library installation directory.")
+set(DOLFIN_INCLUDE_DIR "include" CACHE PATH "C/C++ header installation directory.")
+set(DOLFIN_PKGCONFIG_DIR "lib/pkgconfig" CACHE PATH "pkg-config file installation directory.")
+set(DOLFIN_SHARE_DIR "share/dolfin" CACHE PATH "Shared data installation directory.")
+set(DOLFIN_MAN_DIR "share/man" CACHE PATH "Manual page installation directory.")
+set(DOLFIN_DOC_DIR "${DOLFIN_SHARE_DIR}/doc" CACHE PATH "DOLFIN Documentation directory.")
+set(DOLFIN_ETC_DIR "etc" CACHE PATH "Configuration file directory.")
+
+# Add source directory
+add_subdirectory(dolfin)
+
+#------------------------------------------------------------------------------
+# Installation of DOLFIN utilities
+
+set(DOLFIN_UTILITIES
+  ${DOLFIN_SOURCE_DIR}/scripts/dolfin-convert/dolfin-convert
+  ${DOLFIN_SOURCE_DIR}/scripts/dolfin-order/dolfin-order
+  ${DOLFIN_SOURCE_DIR}/scripts/dolfin-plot/dolfin-plot)
+
+install(FILES ${DOLFIN_UTILITIES}
+  DESTINATION ${DOLFIN_BIN_DIR}
+  PERMISSIONS OWNER_WRITE OWNER_READ GROUP_READ WORLD_READ OWNER_EXECUTE GROUP_EXECUTE WORLD_EXECUTE
+  COMPONENT RuntimeExecutables)
+
+#------------------------------------------------------------------------------
+# Installation of DOLFIN manual pages
+
+install(DIRECTORY ${DOLFIN_SOURCE_DIR}/doc/man/
+  DESTINATION ${DOLFIN_MAN_DIR}
+  USE_SOURCE_PERMISSIONS
+  COMPONENT RuntimeExecutables)
+
+#------------------------------------------------------------------------------
+# Generate and install helper file dolfin.conf
+
+# FIXME: Can CMake provide the library path name variable?
+if (APPLE)
+  set(OS_LIBRARY_PATH_NAME "DYLD_LIBRARY_PATH")
+else()
+  set(OS_LIBRARY_PATH_NAME "LD_LIBRARY_PATH")
+endif()
+
+# FIXME: not cross-platform compatible
+# Create and install dolfin.conf file
+configure_file(${DOLFIN_CMAKE_DIR}/templates/dolfin.conf.in
+               ${CMAKE_BINARY_DIR}/dolfin.conf @ONLY)
+install(FILES ${CMAKE_BINARY_DIR}/dolfin.conf
+        DESTINATION ${DOLFIN_SHARE_DIR}
+        COMPONENT Development)
+
+#------------------------------------------------------------------------------
+# Generate and install helper file dolfin-version
+
+# FIXME: not cross-platform compatible
+# Create and install dolfin-version file
+configure_file(${DOLFIN_CMAKE_DIR}/templates/dolfin-version.in
+               ${CMAKE_BINARY_DIR}/dolfin-version @ONLY)
+install(FILES ${CMAKE_BINARY_DIR}/dolfin-version
+        DESTINATION ${DOLFIN_BIN_DIR}
+	PERMISSIONS OWNER_WRITE OWNER_READ GROUP_READ WORLD_READ
+        OWNER_EXECUTE GROUP_EXECUTE WORLD_EXECUTE
+        COMPONENT RuntimeExecutables)
+
+#------------------------------------------------------------------------------
+# Generate and install utility script dolfin-get-demos
+
+configure_file(${DOLFIN_CMAKE_DIR}/templates/dolfin-get-demos.in
+               ${CMAKE_BINARY_DIR}/dolfin-get-demos @ONLY)
+install(FILES ${CMAKE_BINARY_DIR}/dolfin-get-demos
+        DESTINATION ${DOLFIN_BIN_DIR}
+	PERMISSIONS OWNER_WRITE OWNER_READ GROUP_READ WORLD_READ OWNER_EXECUTE GROUP_EXECUTE WORLD_EXECUTE
+        COMPONENT RuntimeExecutables)
+
+
+#------------------------------------------------------------------------------
+# Generate form files for tests, bench, demos and dolfin if not exists
+# FIXME: Generate files in Build directory instead, at least for bench, demo and tests
+
+set(COPY_DEMO_TEST_DEMO_DATA FALSE)
+if (NOT EXISTS ${DOLFIN_SOURCE_DIR}/demo/documented/poisson/cpp/Poisson.h)
+  message(STATUS "")
+  message(STATUS "Generating form files in demo, test, bench and dolfin directories. May take some time...")
+  message(STATUS "----------------------------------------------------------------------------------------")
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-form-files
+    WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR}
+    RESULT_VARIABLE FORM_GENERATION_RESULT
+    OUTPUT_VARIABLE FORM_GENERATION_OUTPUT
+    ERROR_VARIABLE FORM_GENERATION_OUTPUT
+    OUTPUT_QUIET)
+  if (FORM_GENERATION_RESULT)
+
+    # Cleanup so download is triggered next time we run cmake
+    if (EXISTS ${DOLFIN_SOURCE_DIR}/demo/documented/poisson/cpp/Poisson.h)
+      file(REMOVE ${DOLFIN_SOURCE_DIR}/demo/documented/poisson/cpp/Poisson.h)
+    endif()
+
+    message(FATAL_ERROR "Generation of form files failed: \n${FORM_GENERATION_OUTPUT}")
+  endif()
+  set(COPY_DEMO_TEST_DEMO_DATA TRUE)
+endif()
+
+#------------------------------------------------------------------------------
+# Generate CMakeLists.txt files for tests, bench and demos if not exists
+# FIXME: Generate files in Build directory instead?
+# NOTE: We need to call this script after generate-formfiles
+if (NOT EXISTS ${DOLFIN_SOURCE_DIR}/demo/documented/poisson/cpp/CMakeLists.txt)
+  message(STATUS "")
+  message(STATUS "Generating CMakeLists.txt files in demo, test and bench directories")
+  message(STATUS "-------------------------------------------------------------------")
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-cmakefiles
+    WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR}
+    RESULT_VARIABLE CMAKE_GENERATION_RESULT
+    OUTPUT_VARIABLE CMAKE_GENERATION_OUTPUT
+    ERROR_VARIABLE CMAKE_GENERATION_OUTPUT
+    OUTPUT_QUIET)
+  if (CMAKE_GENERATION_RESULT)
+
+    # Cleanup so download is triggered next time we run cmake
+    if (EXISTS ${DOLFIN_SOURCE_DIR}/demo/documented/poisson/cpp/CMakeLists.txt)
+      file(REMOVE ${DOLFIN_SOURCE_DIR}/demo/documented/poisson/cpp/CMakeLists.txt)
+    endif()
+    message(FATAL_ERROR "Generation of CMakeLists.txt files failed: \n${CMAKE_GENERATION_OUTPUT}")
+  endif()
+
+  set(COPY_DEMO_TEST_DEMO_DATA TRUE)
+endif()
+
+#------------------------------------------------------------------------------
+# Check if data is downloaded
+
+if (NOT EXISTS ${DOLFIN_SOURCE_DIR}/demo/documented/eigenvalue/box_with_dent.xml.gz)
+  # FIXME: What if we do not have internet connection
+  message(STATUS "")
+  message(STATUS "Download demo and test data. May take some time...")
+  message(STATUS "--------------------------------------------------")
+  execute_process(
+    COMMAND ${DOLFIN_SOURCE_DIR}/cmake/scripts/download-demo-data
+    WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR}
+    RESULT_VARIABLE DOWNLOAD_DEMO_DATA_RESULT
+    OUTPUT_VARIABLE DOWNLOAD_DEMO_DATA_OUTPUT
+    ERROR_VARIABLE DOWNLOAD_DEMO_DATA_OUTPUT
+    OUTPUT_QUIET)
+  if (DOWNLOAD_DEMO_DATA_RESULT)
+
+    # Cleanup so download is triggered next time we run cmake
+    if (EXISTS ${DOLFIN_SOURCE_DIR}/demo/documented/eigenvalue/box_with_dent.xml.gz)
+      file(REMOVE ${DOLFIN_SOURCE_DIR}/demo/documented/eigenvalue/box_with_dent.xml.gz)
+    endif()
+    message(WARNING "Download failed: \n${DOWNLOAD_DEMO_DATA_OUTPUT}")
+  endif()
+  set(COPY_DEMO_TEST_DEMO_DATA TRUE)
+endif()
+
+# If data have been generated or downloaded in the demo/bench/test direcories
+# we need to copy them to the build directories
+# FIXME: We should probably just generate them directly in the build directory...
+if (COPY_DEMO_TEST_DEMO_DATA)
+  message(STATUS "")
+  message(STATUS "Copying demo and test data to build directory.")
+  message(STATUS "----------------------------------------------")
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/copy-test-demo-data ${CMAKE_CURRENT_BINARY_DIR}
+    WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}
+    RESULT_VARIABLE COPY_DEMO_DATA_RESULT
+    OUTPUT_VARIABLE COPY_DEMO_DATA_OUTPUT
+    ERROR_VARIABLE COPY_DEMO_DATA_OUTPUT
+    OUTPUT_QUIET)
+  if (COPY_DEMO_DATA_RESULT)
+    message(FATAL_ERROR "Copy demo data failed: \n${COPY_DEMO_DATA_OUTPUT}")
+  endif()
+endif()
+
+#------------------------------------------------------------------------------
+# Add demos and install demo source files and mesh files
+
+# Add demo but do not add to default target
+add_subdirectory(demo EXCLUDE_FROM_ALL)
+
+# Set make program
+if ("${CMAKE_GENERATOR}" STREQUAL "Unix Makefiles")
+  set(MAKE_PROGRAM "$(MAKE)")
+else()
+  set(MAKE_PROGRAM "${CMAKE_MAKE_PROGRAM}")
+endif()
+
+# Add target "demo" for building the demos
+add_custom_target(demo
+  COMMAND ${MAKE_PROGRAM}
+  DEPENDS copy_data_test_demo
+  WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/demo")
+
+# Install the demo source files
+install(DIRECTORY demo DESTINATION ${DOLFIN_SHARE_DIR}
+        FILES_MATCHING
+        PATTERN "CMakeLists.txt"
+        PATTERN "*.cpp"
+        PATTERN "*.ufl"
+        PATTERN "*.h"
+        PATTERN "*.py"
+        PATTERN "*.xml*"
+        PATTERN "*.off"
+        PATTERN "CMakeFiles" EXCLUDE)
+
+# Install meshes (data directory)
+install(DIRECTORY data DESTINATION ${DOLFIN_SHARE_DIR})
+
+#------------------------------------------------------------------------------
+# Generate documentation
+
+if (DOLFIN_ENABLE_DOCS)
+  if (NOT SPHINX_FOUND)
+    message(STATUS "Disabling generation of documentation because Sphinx is missing.")
+  else()
+    add_subdirectory(doc)
+  endif()
+endif()
+
+#------------------------------------------------------------------------------
+# Add tests and benchmarks
+
+if (DOLFIN_ENABLE_BENCHMARKS)
+  # Add bench but do not add to default target
+  add_subdirectory(bench EXCLUDE_FROM_ALL)
+
+  # Add target "bench" for building benchmarks
+  add_custom_target(bench
+    COMMAND ${MAKE_PROGRAM}
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/bench")
+
+  # Copy files needed to run benchmarks in build directory
+  file(COPY bench DESTINATION ${CMAKE_CURRENT_BINARY_DIR}
+    FILES_MATCHING
+    PATTERN "*"
+    PATTERN "CMakeFiles" EXCLUDE)
+
+  # Add target "run_bench" for running benchmarks
+  add_custom_target(run_bench
+    COMMAND ${PYTHON_EXECUTABLE} "bench.py"
+    DEPENDS bench
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/bench")
+endif()
+
+if (CPPUNIT_FOUND)
+  # Add test but do not add to default target
+  add_subdirectory(test EXCLUDE_FROM_ALL)
+
+  # Add target "test" for building tests
+  add_custom_target(test
+    COMMAND ${MAKE_PROGRAM}
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/test")
+endif()
+
+if (DOLFIN_ENABLE_TESTING)
+
+  # Add target "run_memorytests" for running memory tests
+  add_custom_target(copy_data_test_demo
+    COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/copy-test-demo-data ${CMAKE_CURRENT_BINARY_DIR}
+    WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR})
+
+  # Add target "run_memorytests" for running memory tests
+  add_custom_target(run_memorytests
+    COMMAND ${PYTHON_EXECUTABLE} "test.py"
+    DEPENDS copy_data_test_demo
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/test/memory")
+
+  # Add target "run_regressiontests" for running regression tests
+  add_custom_target(run_regressiontests
+    COMMAND ${PYTHON_EXECUTABLE} "test.py"
+    DEPENDS copy_data_test_demo demo
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/test/regression")
+
+  # Add target "run_systemtests" for running system tests
+  add_custom_target(run_systemtests
+    COMMAND ${PYTHON_EXECUTABLE} "test.py"
+    DEPENDS copy_data_test_demo
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/test/system")
+
+  # Add target "run_unittests" for running unit tests
+  add_custom_target(run_unittests
+    COMMAND ${PYTHON_EXECUTABLE} "test.py"
+    DEPENDS copy_data_test_demo test
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/test/unit")
+
+  # Add target "run_quicktest" for running only Python unit tests
+  add_custom_target(run_quicktest
+    COMMAND ${PYTHON_EXECUTABLE} test.py --only-python
+    DEPENDS copy_data_test_demo
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/test/unit")
+
+  # Add target "run_doctest" for running documentation tests
+  add_custom_target(run_doctest
+    COMMAND ${PYTHON_EXECUTABLE} test.py
+    DEPENDS copy_data_test_demo
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/test/documentation")
+
+  # Add target "runtests" for running all tests
+  add_custom_target(runtests
+    ${PYTHON_EXECUTABLE} "test.py"
+    DEPENDS copy_data_test_demo demo test
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/test")
+endif()
+
+#------------------------------------------------------------------------------
+# Add "make uninstall" target
+
+configure_file(
+  "${DOLFIN_CMAKE_DIR}/templates/cmake_uninstall.cmake.in"
+  "${CMAKE_CURRENT_BINARY_DIR}/cmake_uninstall.cmake"
+  IMMEDIATE @ONLY)
+
+add_custom_target(uninstall
+  "${CMAKE_COMMAND}" -P "${CMAKE_CURRENT_BINARY_DIR}/cmake_uninstall.cmake")
+
+#------------------------------------------------------------------------------
+# Print post-install message
+
+add_subdirectory(cmake/post-install)
+
+#------------------------------------------------------------------------------
diff --git a/COPYING b/COPYING
new file mode 100644
index 0000000..94a9ed0
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY 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.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     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
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    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 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/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU 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 Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/COPYING.LESSER b/COPYING.LESSER
new file mode 100644
index 0000000..fc8a5de
--- /dev/null
+++ b/COPYING.LESSER
@@ -0,0 +1,165 @@
+		   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions. 
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version. 
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
diff --git a/ChangeLog b/ChangeLog
new file mode 100644
index 0000000..d8533dc
--- /dev/null
+++ b/ChangeLog
@@ -0,0 +1,1296 @@
+1.4.0 [2014-06-02]
+ - Feature: Add set_diagonal (with GenericVector) to GenericMatrix
+ - Fix many bugs associated with cell orientations on manifolds
+ - Force all global dofs to be ordered last and to be on the last process
+	in parallel
+ - Speed up dof reordering of mixed space including global dofs by removing
+	the latter from graph reordering
+ - Force all dofs on a shared facet to be owned by the same process
+ - Add FEniCS ('fenics') Python module, identical with DOLFIN Python module
+ - Add function Form::set_some_coefficients()
+ - Remove Boost.MPI dependency
+ - Change GenericMatrix::compresss to return a new matrix (7be3a29)
+ - Add function GenericTensor::empty()
+ - Deprecate resizing of linear algebra via the GenericFoo interfaces
+	(fixes #213)
+ - Deprecate MPI::process_number() in favour of MPI::rank(MPI_Comm)
+ - Use PETSc built-in reference counting to manage lifetime of wrapped PETSc
+	objects
+ - Remove random access function from MeshEntityIterator (fixes #178)
+ - Add support for VTK 6 (fixes #149)
+ - Use MPI communicator in interfaces. Permits the creation of distributed and
+	local objects, e.g. Meshes.
+ - Reduce memory usage and increase speed of mesh topology computation
+1.3.0 [2014-01-07]
+ - Feature: Enable assignment of sparse MeshValueCollections to MeshFunctions
+ - Feature: Add free function assign that is used for sub function assignment
+ - Feature: Add class FunctionAssigner that cache dofs for sub function
+	assignment
+ - Fix runtime dependency on checking swig version
+ - Deprecate DofMap member methods vertex_to_dof_map and dof_to_vertex_map
+ - Add free functions: vertex_to_dof_map and dof_to_vertex_map, and correct the
+	ordering of the map.
+ - Introduce CompiledSubDomain a more robust version of compiled_subdomains,
+	which is now deprecated
+ - CMake now takes care of calling the correct generate-foo script if so needed.
+ - Feature: Add new built-in computational geometry library (BoundingBoxTree)
+ - Feature: Add support for setting name and label to an Expression when
+	constructed
+ - Feature: Add support for passing a scalar GenericFunction as default value
+	to a CompiledExpression
+ - Feature: Add support for distance queries for 3-D meshes
+ - Feature: Add PointIntegralSolver, which uses the MultiStageSchemes to solve
+	local ODEs at Vertices
+ - Feature: Add RKSolver and MultiStageScheme for general time integral solvers
+ - Feature: Add support for assigning a Function with linear combinations of
+	Functions, which lives in the same FunctionSpace
+ - Added Python wrapper for SystemAssembler
+ - Added a demo using compiled_extension_module with separate source files
+ - Fixes for NumPy 1.7
+ - Remove DOLFIN wrapper code (moved to FFC)
+ - Add set_options_prefix to PETScKrylovSolver
+ - Remove base class BoundarCondition
+ - Set block size for PETScMatrix when available from TensorLayout
+ - Add support to get block compressed format from STLMatrix
+ - Add detection of block structures in the dofmap for vector equations
+ - Expose PETSc GAMG parameters
+ - Modify SystemAssembler to support separate assembly of A and b
+1.2.0 [2013-03-24]
+ - Fixes bug where child/parent hierarchy in Python were destroyed
+ - Add utility script dolfin-get-demos
+ - MeshFunctions in python now support iterable protocol
+ - Add timed VTK output for Mesh and MeshFunction in addtion to Functions
+ - Expose ufc::dofmap::tabulate_entity_dofs to GenericDofMap interface
+ - Expose ufc::dofmap::num_entity_dofs to GenericDofMap interface
+ - Allow setting of row dof coordinates in preconditioners (only works with
+	PETSc backed for now)
+ - Expose more PETSc/ML parameters
+ - Improve speed to tabulating coordinates in some DofMap functions
+ - Feature: Add support for passing a Constant as default value to a
+	CompiledExpression
+ - Fix bug in dimension check for 1-D ALE
+ - Remove some redundant graph code
+ - Improvements in speed of parallel dual graph builder
+ - Fix bug in XMDF output for cell-based Functions
+ - Fixes for latest version of clang compiler
+ - LocalSolver class added to efficiently solve cell-wise problems
+ - New implementation of periodic boundary conditions. Now incorporated into
+	the dofmap
+ - Optional arguments to assemblers removed
+ - SymmetricAssembler removed
+ - Domains for assemblers can now only be attached to forms
+ - SubMesh can now be constructed without a CellFunction argument, if the
+	MeshDomain contains marked celldomains.
+ - MeshDomains are propagated to a SubMesh during construction
+ - Simplify generation of a MeshFunction from MeshDomains: No need to call
+	mesh_function with mesh
+ - Rename dolfin-config.cmake to DOLFINConfig.cmake
+ - Use CMake to configure JIT compilation of extension modules
+ - Feature: Add vertex_to_dof_map to DofMap, which map vertex indices to
+	dolfin dofs
+ - Feature: Add support for solving on m dimensional meshes embedded in n >= m
+	dimensions
+1.1.0 [2013-01-08]
+ - Add support for solving singular problems with Krylov solvers (PETSc only)
+ - Add new typedef dolfin::la_index for consistent indexing with linear algebra
+	backends.
+ - Change default unsigned integer type to std::size_t
+ - Add support to attaching operator null space to preconditioner
+   (required for smoothed aggregation AMG)
+ - Add basic interface to the PETSc AMG preconditioner
+ - Make SCOTCH default graph partitioner (GNU-compatible free license, unlike
+	ParMETIS)
+ - Add scalable construction of mesh dual graph for mesh partitioning
+ - Improve performance of mesh building in parallel
+ - Add mesh output to SVG
+ - Add support for Facet and cell markers to mesh converted from Diffpack
+ - Add support for Facet and cell markers/attributes to mesh converted from
+	Triangle
+ - Change interface for auto-adaptive solvers: these now take the goal
+   functional as a constructor argument
+ - Add memory usage monitor: monitor_memory_usage()
+ - Compare mesh hash in interpolate_vertex_values
+ - Add hash() for Mesh and MeshTopology
+ - Expose GenericVector::operator{+=,-=,+,-}(double) to Python
+ - Add function Function::compute_vertex_values not needing a mesh argument
+ - Add support for XDMF and HDF5
+ - Add new interface LinearOperator for matrix-free linear systems
+ - Remove MTL4 linear algebra backend
+ - Rename down_cast --> as_type in C++ / as_backend_type in Python
+ - Remove KrylovMatrix interface
+ - Remove quadrature classes
+ - JIT compiled C++ code can now include a dolfin namespace
+ - Expression string parsing now understand C++ namespace such as std::cosh
+ - Fix bug in Expression so one can pass min, max
+ - Fix bug in SystemAssembler, where mesh.init(D-1, D) was not called before assemble
+ - Fix bug where the reference count of Py_None was not increased
+ - Fix bug in reading TimeSeries of size smaller than 3
+ - Improve code design for Mesh FooIterators to avoid dubious down cast
+ - Bug fix in destruction of PETSc user preconditioners
+ - Add CellVolume(mesh) convenience wrapper to Python interface for UFL function
+ - Fix bug in producing outward pointing normals of BoundaryMesh
+ - Fix bug introduced by SWIG 2.0.5, where typemaps of templated typedefs
+   are not handled correctly
+ - Fix bug introduced by SWIG 2.0.5, which treated uint as Python long
+ - Add check that sample points for TimeSeries are monotone
+ - Fix handling of parameter "report" in Krylov solvers
+ - Add new linear algebra backend "PETScCusp" for GPU-accelerated linear algebra
+ - Add sparray method in the Python interface of GenericMatrix, requires scipy.sparse
+ - Make methods that return a view of contiguous c-arrays, via a NumPy array, keep a reference from the object so it wont get out of scope
+ - Add parameter: "use_petsc_signal_handler", which enables/disable PETSc system signals
+ - Avoid unnecessary resize of result vector for A*b
+ - MPI functionality for distributing values between neighbours
+ - SystemAssembler now works in parallel with topological/geometric boundary search
+ - New symmetric assembler with ability for stand-alone RHS assemble
+ - Major speed-up of DirichletBC computation and mesh marking
+ - Major speed-up of assembly of functions and expressions
+ - Major speed-up of mesh topology computation
+ - Add simple 2D and 3D mesh generation (via CGAL)
+ - Add creation of mesh from triangulations of points (via CGAL)
+ - Split the SWIG interface into six combined modules instead of one
+ - Add has_foo to easy check what solver and preconditioners are available
+ - Add convenience functions for listing available linear_algebra_backends
+ - Change naming convention for cpp unit tests test.cpp -> Foo.cpp
+ - Added cpp unit test for GenericVector::operator{-,+,*,/}= for all la backends
+ - Add functionality for rotating meshes
+ - Add mesh generation based on NETGEN constructive solid geometry
+ - Generalize SparsityPattern and STLMatrix to support column-wise storage
+ - Add interfaces to wrap PaStiX and MUMPS direct solvers
+ - Add CoordinateMatrix class
+ - Make STLMatrix work in parallel
+ - Remove all tr1::tuple and use boost::tuple
+ - Fix wrong link in Python quick reference.
+1.0.0 [2011-12-07]
+ - Change return value of IntervalCell::facet_area() 0.0 --> 1.0.
+ - Recompile all forms with FFC 1.0.0
+ - Fix for CGAL 3.9 on OS X
+ - Improve docstrings for Box and Rectangle
+ - Check number of dofs on local patch in extrapolation
+1.0-rc2 [2011-11-28]
+ - Fix bug in 1D mesh refinement
+ - Fix bug in handling of subdirectories for TimeSeries
+ - Fix logic behind vector assignment, especially in parallel
+1.0-rc1 [2011-11-21]
+ - 33 bugs fixed
+ - Implement traversal of bounding box trees for all codimensions
+ - Edit and improve all error messages
+ - Added [un]equality operator to FunctionSpace
+ - Remove batch compilation of Expression (Expressions) from Python interface
+ - Added get_value to MeshValueCollection
+ - Added assignment operator to MeshValueCollection
+1.0-beta2 [2011-10-26]
+ - Change search path of parameter file to ~/.fenics/dolfin_parameters.xml
+ - Add functions Parameters::has_parameter, Parameters::has_parameter_set
+ - Added option to store all connectivities in a mesh for TimeSeries (false by default)
+ - Added option for gzip compressed binary files for TimeSeries
+ - Propagate global parameters to Krylov and LU solvers
+ - Fix OpenMp assemble of scalars
+ - Make OpenMP assemble over sub domains work
+ - DirichletBC.get_boundary_values, FunctionSpace.collapse now return a dict in Python
+ - Changed name of has_la_backend to has_linear_algebra_backend
+ - Added has_foo functions which can be used instead of the HAS_FOO defines
+ - Less trict check on kwargs for compiled Expression
+ - Add option to not right-justify tables
+ - Rename summary --> list_timings
+ - Add function list_linear_solver_methods
+ - Add function list_lu_solver_methods
+ - Add function list_krylov_solver_methods
+ - Add function list_krylov_solver_preconditioners
+ - Support subdomains in SystemAssembler (not for interior facet integrals)
+ - Add option functionality apply("flush") to PETScMatrix
+ - Add option finalize_tensor=true to assemble functions
+ - Solver parameters can now be passed to solve
+ - Remove deprecated function Variable::disp()
+ - Remove deprecated function logging()
+ - Add new class MeshValueCollection
+ - Add new class MeshDomains replacing old storage of boundary markers
+   as part of MeshData. The following names are no longer supported:
+   * boundary_facet_cells
+   * boundary_facet_numbers
+   * boundary_indicators
+   * material_indicators
+   * cell_domains
+   * interior_facet_domains
+   * exterior_facet_domains
+ - Rename XML tag <meshfunction> --> <mesh_function>
+ - Rename SubMesh data "global_vertex_indices" --> "parent_vertex_indices"
+ - Get XML input/output of boundary markers working again
+ - Get FacetArea working again
+1.0-beta [2011-08-11]
+ - Print percentage of non-zero entries when computing sparsity patterns
+ - Use ufl.Real for Constant in Python interface
+ - Add Dirichlet boundary condition argument to Python project function
+ - Add remove functionality for parameter sets
+ - Added out typemap for vector of shared_ptr objects
+ - Fix typemap bug for list of shared_ptr objects
+ - Support parallel XML vector io
+ - Add support for gzipped XML output
+ - Use pugixml for XML output
+ - Move XML SAX parser to libxml2 SAX2 interface
+ - Simplify XML io
+ - Change interface for variational problems, class VariationalProblem removed
+ - Add solve interface: solve(a == L), solve(F == 0)
+ - Add new classes Linear/NonlinearVariationalProblem
+ - Add new classes Linear/NonlinearVariationalSolver
+ - Ad form class aliases ResidualForm and Jacobian form in wrapper code
+ - Default argument to variables in Expression are passed as kwargs in the
+   Python interface
+ - Add has_openmp as utility function in Python interface
+ - Add improved error reporting using dolfin_error
+ - Use Boost to compute Legendre polynolials
+ - Remove ode code
+ - Handle parsing of unrecognized command-line parameters
+ - All const std::vector<foo>& now return a read-only NumPy array
+ - Make a robust macro for generating a NumPy array from data
+ - Exposing low level fem functionality to Python, by adding a
+   Cell -> ufc::cell typemap
+ - Added ufl_cell as a method to Mesh in Python interface
+ - Fix memory leak in Zoltan interface
+ - Remove some 'new' for arrays in favour of std::vector
+ - Added cell as an optional argument to Constant
+ - Prevent the use of non contiguous NumPy arrays for most typemaps
+ - Point can now be used to evaluate a Function or Expression in Python
+ - Fixed dimension check for Function and Expression eval in Python
+ - Fix compressed VTK output for tensors in 2D
+0.9.11 [2011-05-16]
+ - Change license from LGPL v2.1 to LGPL v3 or later
+ - Moved meshconverter to dolfin_utils
+ - Add support for conversion of material markers for Gmsh meshes
+ - Add support for point sources (class PointSource)
+ - Rename logging --> set_log_active
+ - Add parameter "clear_on_write" to TimeSeries
+ - Add support for input/output of nested parameter sets
+ - Check for dimensions in linear solvers
+ - Add support for automated error control for variational problems
+ - Add support for refinement of MeshFunctions after mesh refinement
+ - Change order of test and trial spaces in Form constructors
+ - Make SWIG version >= 2.0 a requirement
+ - Recognize subdomain data in Assembler from both Form and Mesh
+ - Add storage for subdomains (cell_domains etc) in Form class
+ - Rename MeshData "boundary facet cells" --> "boundary_facet_cells"
+ - Rename MeshData "boundary facet numbers" --> "boundary_facet_numbers"
+ - Rename MeshData "boundary indicators" --> "boundary_indicators"
+ - Rename MeshData "exterior facet domains" --> "exterior_facet_domains"
+ - Updates for UFC 2.0.1
+ - Add FiniteElement::evaluate_basis_derivatives_all
+ - Add support for VTK output of facet-based MeshFunctions
+ - Change default log level from PROGRESS to INFO
+ - Add copy functions to FiniteElement and DofMap
+ - Simplify DofMap
+ - Interpolate vector values when reading from time series
+0.9.10 [2011-02-23]
+ - Updates for UFC 2.0.0
+ - Handle TimeSeries stored backward in time (automatic reversal)
+ - Automatic storage of hierarchy during refinement
+ - Remove directory/library 'main', merged into 'common'
+ - dolfin_init --> init, dolfin_set_precision --> set_precision
+ - Remove need for mesh argument to functional assembly when possible
+ - Add function set_output_stream
+ - Add operator () for evaluation at points for Function/Expression in C++
+ - Add abs() to GenericVector interface
+ - Fix bug for local refinement of manifolds
+ - Interface change: VariationalProblem now takes: a, L or F, (dF)
+ - Map linear algebra objects to processes consistently with mesh parition
+ - Lots of improvemenst to parallel assembly, dof maps and linear algebra
+ - Add lists supported_elements and supported_elements_for_plotting in Python
+ - Add script dolfin-plot for plotting meshes and elements from the command-line
+ - Add support for plotting elements from Python
+ - Add experimental OpenMP assembler
+ - Thread-safe fixed in Function class
+ - Make GenericFunction::eval thread-safe (Data class removed)
+ - Optimize and speedup topology computation (mesh.init())
+ - Add function Mesh::clean() for cleaning out auxilliary topology data
+ - Improve speed and accuracy of timers
+ - Fix bug in 3D uniform mesh refinement
+ - Add built-in meshes UnitTriangle and UnitTetrahedron
+ - Only create output directories when they don't exist
+ - Make it impossible to set the linear algebra backend to something illegal
+ - Overload value_shape instead of dim for userdefined Python Expressions
+ - Permit unset parameters
+ - Search only for BLAS library (not cblas.h)
+0.9.9 [2010-09-01]
+ - Change build system to CMake
+ - Add named MeshFunctions: VertexFunction, EdgeFunction, FaceFunction, FacetFunction, CellFunction
+ - Allow setting constant boundary conditions directly without using Constant
+ - Allow setting boundary conditions based on string ("x[0] == 0.0")
+ - Create missing directories if specified as part of file names
+ - Allow re-use of preconditioners for most backends
+ - Fixes for UMFPACK solver on some 32 bit machines
+ - Provide access to more Hypre preconditioners via PETSc
+ - Updates for SLEPc 3.1
+ - Improve and implement re-use of LU factorizations for all backends
+ - Fix bug in refinement of MeshFunctions
+0.9.8 [2010-07-01]
+ - Optimize and improve StabilityAnalysis.
+ - Use own implementation of binary search in ODESolution (takes advantage of
+   previous values as initial guess)
+ - Improve reading ODESolution spanning multiple files
+ - Dramatic speedup of progress bar (and algorithms using it)
+ - Fix bug in writing meshes embedded higher dimensions to M-files
+ - Zero vector in uBLASVector::resize() to fix spurious bug in Krylov solver
+ - Handle named fields (u.rename()) in VTK output
+ - Bug fix in computation of FacetArea for tetrahedrons
+ - Add support for direct plotting of Dirichlet boundary conditions: plot(bc)
+ - Updates for PETSc 3.1
+ - Add relaxation parameter to NewtonSolver
+ - Implement collapse of renumbered dof maps (serial and parallel)
+ - Simplification of DofMapBuilder for parallel dof maps
+ - Improve and simplify DofMap
+ - Add Armadillo dependency for dense linear algebra
+ - Remove LAPACKFoo wrappers
+ - Add abstract base class GenericDofMap
+ - Zero small values in VTK output to avoid VTK crashes
+ - Handle MeshFunction/markers in homogenize bc
+ - Make preconditioner selectable in VariationalProblem (new parameter)
+ - Read/write meshes in binary format
+ - Add parameter "use_ident" in DirichletBC
+ - Issue error by default when solvers don't converge (parameter "error_on_convergence")
+ - Add option to print matrix/vector for a VariationalProblem
+ - Trilinos backend now works in parallel
+ - Remove Mesh refine members functions. Use free refine(...) functions instead
+ - Remove AdapativeObjects
+ - Add Stokes demo using the MINI element
+ - Interface change: operator+ now used to denote enriched function spaces
+ - Interface change: operator+ --> operator* for mixed elements
+ - Add option 'allow_extrapolation' useful when interpolating to refined meshes
+ - Add SpatialCoordinates demo
+ - Add functionality for accessing time series sample times: vector_times(), mesh_times()
+ - Add functionality for snapping mesh to curved boundaries during refinement
+ - Add functionality for smoothing the boundary of a mesh
+ - Speedup assembly over exterior facets by not using BoundaryMesh
+ - Mesh refinement improvements, remove unecessary copying in Python interface
+ - Clean PETSc and Epetra Krylov solvers
+ - Add separate preconditioner classes for PETSc and Epetra solvers
+ - Add function ident_zeros for inserting one on diagonal for zero rows
+ - Add LU support for Trilinos interface
+0.9.7 [2010-02-17]
+ - Add support for specifying facet orientation in assembly over interior facets
+ - Allow user to choose which LU package PETScLUSolver uses
+ - Add computation of intersection between arbitrary mesh entities
+ - Random access to MeshEntitiyIterators
+ - Modify SWIG flags to prevent leak when using SWIG director feature
+ - Fix memory leak in std::vector<Foo*> typemaps
+ - Add interface for SCOTCH for parallel mesh partitioning
+ - Bug fix in SubDomain::mark, fixes bug in DirichletBC based on SubDomain::inside
+ - Improvements in time series class, recognizing old stored values
+ - Add FacetCell class useful in algorithms iterating over boundary facets
+ - Rename reconstruct --> extrapolate
+ - Remove GTS dependency
+0.9.6 [2010-02-03]
+ - Simplify access to form compiler parameters, now integrated with global parameters
+ - Add DofMap member function to return set of dofs
+ - Fix memory leak in the LA interface
+ - Do not import cos, sin, exp from NumPy to avoid clash with UFL functions
+ - Fix bug in MTL4Vector assignment
+ - Remove sandbox (moved to separate repository)
+ - Remove matrix factory (dolfin/mf)
+ - Update .ufl files for changes in UFL
+ - Added swig/import/foo.i for easy type importing from dolfin modules
+ - Allow optional argument cell when creating Expression
+ - Change name of Expression argument cpparg --> cppcode
+ - Add simple constructor (dim0, dim1) for C++ matrix Expressions
+ - Add example demonstrating the use of cpparg (C++ code in Python)
+ - Add least squares solver for dense systems (wrapper for DGELS)
+ - New linear algebra wrappers for LAPACK matrices and vectors
+ - Experimental support for reconstruction of higher order functions
+ - Modified interface for eval() and inside() in C++ using Array
+ - Introduce new Array class for simplified wrapping of arrays in SWIG
+ - Improved functionality for intersection detection
+ - Reimplementation of intersection detection using CGAL
+0.9.5 [2009-12-03]
+ - Set appropriate parameters for symmetric eigenvalue problems with SLEPc
+ - Fix for performance regression in recent uBLAS releases
+ - Simplify Expression interface: f = Expression("sin(x[0])")
+ - Simplify Constant interface: c = Constant(1.0)
+ - Fix bug in periodic boundary conditions
+ - Add simple script dolfin-tetgen for generating DOLFIN XML meshes from STL
+ - Make XML parser append/overwrite parameter set when reading parameters from file
+ - Refinement of function spaces and automatic interpolation of member functions
+ - Allow setting global parameters for Krylov solver
+ - Fix handling of Constants in Python interface to avoid repeated JIT compilation
+ - Allow simple specification of subdomains in Python without needing to subclass SubDomain
+ - Add function homogenize() for simple creation of homogeneous BCs from given BCs
+ - Add copy constructor and possibility to change value for DirichletBC
+ - Add simple wrapper for ufl.cell.n. FacetNormal(mesh) now works again in Python.
+ - Support apply(A), apply(b) and apply(b, x) in PeriodicBC
+ - Enable setting spectral transformation for SLEPc eigenvalue solver
+0.9.4 [2009-10-12]
+ - Remove set, get and operator() methods from MeshFunction
+ - Added const and none const T &operator[uint/MeshEntity] to MeshFunction
+ - More clean up in SWIG interface files, remove global renames and ignores
+ - Update Python interface to Expression, with extended tests for value ranks
+ - Removed DiscreteFunction class
+ - Require value_shape and geometric_dimension in Expression
+ - Introduce new class Expression replacing user-defined Functions
+ - interpolate_vertex_values --> compute_vertex_values
+ - std::map<std::string, Coefficient> replaces generated CoefficientSet code
+ - Cleanup logic in Function class as a result of new Expression class
+ - Introduce new Coefficient base class for form coefficients
+ - Replace CellSize::min,max by Mesh::hmin,hmax
+ - Use MUMPS instead of UMFPACK as default direct solver in both serial and parallel
+ - Fix bug in SystemAssembler
+ - Remove support for PETSc 2.3 and support PETSc 3.0.0 only
+ - Remove FacetNormal Function. Use UFL facet normal instead.
+ - Add update() function to FunctionSpace and DofMap for use in adaptive mesh refinement
+ - Require mesh in constructor of functionals (C++) or argument to assemble (Python)
+0.9.3 [2009-09-25]
+ - Add global parameter "ffc_representation" for form representation in FFC JIT compiler
+ - Make norm() function handle both vectors and functions in Python
+ - Speedup periodic boundary conditions and make work for mixed (vector-valued) elements
+ - Add possibilities to use any number numpy array when assigning matrices and vectors
+ - Add possibilities to use any integer numpy array for indices in matrices and vectors
+ - Fix for int typemaps in PyDOLFIN
+ - Split mult into mult and transpmult
+ - Filter out PETSc argument when parsing command-line parameters
+ - Extend comments to SWIG interface files
+ - Add copyright statements to SWIG interface files (not finished yet)
+ - Add typemaps for misc std::vector<types> in PyDOLFIN
+ - Remove dependencies on std_vector.i reducing SWIG wrapper code size
+ - Use relative %includes in dolfin.i
+ - Changed names on SWIG interface files dolfin_foo.i -> foo.i
+ - Add function interpolate() in Python interface
+ - Fix typmaps for uint in python 2.6
+ - Use TypeError instead of ValueError in typechecks in typmaps.i
+ - Add in/out shared_ptr<Epetra_FEFoo> typemaps for PyDOLFIN
+ - Fix JIT compiling in parallel
+ - Add a compile_extension_module function in PyDOLFIN
+ - Fix bug in Python vector assignment
+ - Add support for compressed base64 encoded VTK files (using zlib)
+ - Add support for base64 encoded VTK files
+ - Experimental support for parallel assembly and solve
+ - Bug fix in project() function, update to UFL syntax
+ - Remove disp() functions and replace by info(foo, true)
+ - Add fem unit test (Python)
+ - Clean up SystemAssembler
+ - Enable assemble_system through PyDOLFIN
+ - Add 'norm' to GenericMatrix
+ - Efficiency improvements in NewtonSolver
+ - Rename NewtonSolver::get_iteration() to NewtonSolver::iteration()
+ - Improvements to EpetraKrylovSolver::solve
+ - Add constructor Vector::Vector(const GenericVector& x)
+ - Remove SCons deprecation warnings
+ - Memory leak fix in PETScKrylovSolver
+ - Rename dolfin_assert -> assert and use C++ version
+ - Fix debug/optimise flags
+ - Remove AvgMeshSize, InvMeshSize, InvFacetArea from SpecialFunctions
+ - Rename MeshSize -> CellSize
+ - Rewrite parameter system with improved support for command-line parsing,
+   localization of parameters (per class) and usability from Python
+ - Remove OutflowFacet from SpecialFunctions
+ - Rename interpolate(double*) --> interpolate_vertex_values(double*)
+ - Add Python version of Cahn-Hilliard demo
+ - Fix bug in assemble.py
+ - Permit interpolation of functions between non-matching meshes
+ - Remove Function::Function(std::string filename)
+ - Transition to new XML io
+ - Remove GenericSparsityPattern::sort
+ - Require sorted/unsorted parameter in SparsityPattern constructor
+ - Improve performance of SparsityPattern::insert
+ - Replace enums with strings for linear algebra and built-in meshes
+ - Allow direct access to Constant value
+ - Initialize entities in MeshEntity constructor automatically and check range
+ - Add unit tests to the memorycheck
+ - Add call to clean up libxml2 parser at exit
+ - Remove unecessary arguments in DofMap member functions
+ - Remove reference constructors from DofMap, FiniteElement and FunctionSpace
+ - Use a shared_ptr to store the mesh in DofMap objects
+ - Interface change for wrapper code: PoissonBilinearForm --> Poisson::BilinearForm
+ - Add function info_underline() for writing underlined messages
+ - Rename message() --> info() for "compatibility" with Python logging module
+ - Add elementwise multiplication in GeneriVector interface
+ - GenericVector interface in PyDOLFIN now support the sequence protocol
+ - Rename of camelCaps functions names: fooBar --> foo_bar
+   Note: mesh.numVertices() --> mesh.num_vertices(), mesh.numCells() --> mesh.num_cells()
+ - Add slicing capabilities for GenericMatrix interface in PyDOLFIN (only getitem)
+ - Add slicing capabilities for GenericVector interface in PyDOLFIN
+ - Add sum to GenericVector interface
+0.9.2 [2009-04-07]
+ - Enable setting parameters for Newton solver in VariationalProblem
+ - Simplified and improved implementation of C++ plotting, calling Viper on command-line
+ - Remove precompiled elements and projections
+ - Automatically interpolate user-defined functions on assignment
+ - Add new built-in function MeshCoordinates, useful in ALE simulations
+ - Add new constructor to Function class, Function(V, "vector.xml")
+ - Remove class Array (using std::vector instead)
+ - Add vector_mapping data to MeshData
+ - Use std::vector instead of Array in MeshData
+ - Add assignment operator and copy constructor for MeshFunction
+ - Add function mesh.move(other_mesh) for moving mesh according to matching mesh (for FSI)
+ - Add function mesh.move(u) for moving mesh according to displacement function (for FSI)
+ - Add macro dolfin_not_implemented()
+ - Add new interpolate() function for interpolation of user-defined function to discrete
+ - Make _function_space protected in Function
+ - Added access to crs data from python for uBLAS and MTL4 backendg
+0.9.1 [2009-02-17]
+ - Check Rectangle and Box for non-zero dimensions
+ - ODE solvers now solve the dual problem
+ - New class SubMesh for simple extraction of matching meshes for sub domains
+ - Improvements of multiprecision ODE solver
+ - Fix Function class copy constructor
+ - Bug fixes for errornorm(), updates for new interface
+ - Interface update for MeshData: createMeshFunction --> create_mesh_function etc
+ - Interface update for Rectangle and Box
+ - Add elastodynamics demo
+ - Fix memory leak in IntersectionDetector/GTSInterface
+ - Add check for swig version, in jit and compile functions
+ - Bug fix in dolfin-order script for gzipped files
+ - Make shared_ptr work across C++/Python interface
+ - Replace std::tr1::shared_ptr with boost::shared_ptr
+ - Bug fix in transfinite mean-value interpolation
+ - Less annoying progress bar (silent when progress is fast)
+ - Fix assignment operator for MeshData
+ - Improved adaptive mesh refinement (recursive Rivara) producing better quality meshes
+0.9.0 [2009-01-05]
+ - Cross-platform fixes
+ - PETScMatrix::copy fix
+ - Some Trilinos fixes
+ - Improvements in MeshData class
+ - Do not use initial guess in Newton solver
+ - Change OutflowFacet to IsOutflowFacet and change syntax
+ - Used shared_ptr for underling linear algebra objects
+ - Cache subspaces in FunctionSpace
+ - Improved plotting, now support plot(grad(u)), plot(div(u)) etc
+ - Simple handling of JIT-compiled functions
+ - Sign change (bug fix) in increment for Newton solver
+ - New class VariationalProblem replacing LinearPDE and NonlinearPDE
+ - Parallel parsing and partitioning of meshes (experimental)
+ - Add script dolfin-order for ordering mesh files
+ - Add new class SubSpace (replacing SubSystem)
+ - Add new class FunctionSpace
+ - Complete redesign of Function class hierarchy, now a single Function class
+ - Increased use of shared_ptr in Function, FunctionSpace, etc
+ - New interface for boundary conditions, form not necessary
+ - Allow simple setting of coefficient functions based on names (not their index)
+ - Don't order mesh automatically, meshes must now be ordered explicitly
+ - Simpler definition of user-defined functions (constructors not necessary)
+ - Make mesh iterators const to allow for const-correct Mesh code
+0.8.1 [2008-10-20]
+ - Add option to use ML multigrid preconditioner through PETSc
+ - Interface change for ODE solvers: uBLASVector --> double*
+ - Remove homotopy solver
+ - Remove typedef real, now using plain double instead
+ - Add various operators -=, += to GenericMatrix
+ - Don't use -Werror when compiling SWIG generated code
+ - Remove init(n) and init(m, n) from GenericVector/Matrix. Use resize and zero instead
+ - Add new function is_combatible() for checking compatibility of boundary conditions
+ - Use x as initial guess in Krylov solvers (PETSc, uBLAS, ITL)
+ - Add new function errornorm()
+ - Add harmonic ALE mesh smoothing
+ - Refinements of Graph class
+ - Add CholmodCholeskySlover (direct solver for symmetric matrices)
+ - Implement application of Dirichlet boundary conditions within assembly loop
+ - Improve efficiency of SparsityPattern
+ - Allow a variable number of smoothings
+ - Add class Table for pretty-printing of tables
+ - Add experimental MTL4 linear algebra backend
+ - Add OutflowFacet to SpecialFunctions for DG transport problems
+ - Remove unmaintained OpenDX file format
+ - Fix problem with mesh smoothing near nonconvex corners
+ - Simple projection of functions in Python
+ - Add file format: XYZ for use with Xd3d
+ - Add built-in meshes: UnitCircle, Box, Rectangle, UnitSphere
+0.8.0 [2008-06-23]
+ - Fix input of matrix data from XML
+ - Add function normalize()
+ - Integration with VMTK for reading DOLFIN XML meshes produced by VMTK
+ - Extend mesh XML format to handle boundary indicators
+ - Add support for attaching arbitrarily named data to meshes
+ - Add support for dynamically choosing the linear algebra backend
+ - Add Epetra/Trilinos linear solvers
+ - Add setrow() to matrix interface
+ - Add new solver SingularSolver for solving singular (pressure) systems
+ - Add MeshSize::min(), max() for easy computation of smallest/largest mesh size
+ - LinearSolver now handles all backends and linear solvers
+ - Add access to normal in Function, useful for inflow boundary conditions
+ - Remove GMRES and LU classes, use solve() instead
+ - Improve solve() function, now handles both LU and Krylov + preconditioners
+ - Add ALE mesh interpolation (moving mesh according to new boundary coordinates)
+0.7.3 [2008-04-30]
+ - Add support for Epetra/Trilinos
+ - Bug fix for order of values in interpolate_vertex_values, now according to UFC
+ - Boundary meshes are now always oriented with respect to outward facet normals
+ - Improved linear algebra, both in C++ and Python
+ - Make periodic boundary conditions work in Python
+ - Fix saving of user-defined functions
+ - Improve plotting
+ - Simple computation of various norms of functions from Python
+ - Evaluation of Functions at arbitrary points in a mesh
+ - Fix bug in assembling over exterior facets (subdomains were ignored)
+ - Make progress bar less annoying
+ - New scons-based build system replaces autotools
+ - Fix bug when choosing iterative solver from Python
+0.7.2 [2008-02-18]
+ - Improve sparsity pattern generator efficiency
+ - Dimension-independent sparsity pattern generator
+ - Add support for setting strong boundary values for DG elements
+ - Add option setting boundary conditions based on geometrical search
+ - Check UMFPACK return argument for warnings/errors
+ - Simplify setting simple Dirichlet boundary conditions
+ - Much improved integration with FFC in PyDOLFIN
+ - Caching of forms by JIT compiler now works
+ - Updates for UFC 1.1
+ - Catch exceptions in PyDOLFIN
+ - Work on linear algebra interfaces GenericTensor/Matrix/Vector
+ - Add linear algebra factory (backend) interface
+ - Add support for 1D meshes
+ - Make Assembler independent of linear algebra backend
+ - Add manager for handling sub systems (PETSc and MPI)
+ - Add parallel broadcast of Mesh and MeshFunction
+ - Add experimental support for parallel assembly
+ - Use PETSc MPI matrices when running in parallel
+ - Add predefined functions FacetNormal and AvgMeshSize
+ - Add left/right/crisscross options for UnitSquare
+ - Add more Python demos
+ - Add support for Exodus II format in dolfin-convert
+ - Autogenerate docstrings for PyDOLFIN
+ - Various small bug fixes and improvements
+0.7.1 [2007-08-31]
+ - Integrate FFC form language into PyDOLFIN
+ - Just-in-time (JIT) compilation of variational forms
+ - Conversion from from Diffpack grid format to DOLFIN XML
+ - Name change: BoundaryCondition --> DirichletBC
+ - Add support for periodic boundary conditions: class PeriodicBC
+ - Redesign default linear algebra interface (Matrix, Vector, KrylovSolver, etc)
+ - Add function to return Vector associated with a DiscreteFunction
+0.7.0-1 [2007-06-22]
+ - Recompile all forms with latest FFC release
+ - Remove typedefs SparseMatrix and SparseVector
+ - Fix includes in LinearPDE
+ - Rename DofMaps -> DofMapSet
+0.7.0 [2007-06-20]
+ - Move to UFC interface for code generation
+ - Major rewrite, restructure, cleanup
+ - Add support for Brezzi-Douglas-Marini (BDM) elements
+ - Add support for Raviart-Thomas (RT) elements
+ - Add support for Discontinuous Galerkin (DG) methods
+ - Add support for mesh partitioning (through SCOTCH)
+ - Handle both UMFPACK and UFSPARSE
+ - Local mesh refinement
+ - Mesh smoothing
+ - Built-in plotting (through Viper)
+ - Cleanup log system
+ - Numerous fixes for mesh, in particular MeshFunction
+ - Much improved Python bindings for mesh
+ - Fix Python interface for vertex and cell maps in boundary computation
+0.6.4 [2006-12-01]
+ - Switch from Python Numeric to Python NumPy
+ - Improved mesh Python bindings
+ - Add input/output support for MeshFunction
+ - Change Mesh::vertices() --> Mesh::coordinates()
+ - Fix bug in output of mesh to MATLAB format
+ - Add plasticty module (experimental)
+ - Fix configure test for Python dev (patch from Åsmund Ødegård)
+ - Add mesh benchmark
+ - Fix memory leak in mesh (data not deleted correctly in MeshTopology)
+ - Fix detection of curses libraries
+ - Remove Tecplot output format
+0.6.3 [2006-10-27]
+ - Move to new mesh library
+ - Remove dolfin-config and move to pkg-config
+ - Remove unused classes PArray, PList, Table, Tensor
+ - Visualization of 2D solutions in OpenDX is now supported (3D supported before)
+ - Add support for evaluation of functionals
+ - Fix bug in Vector::sum() for uBLAS vectors
+0.6.2-1 [2006-09-06]
+ - Fix compilation error when using --enable-petsc (dolfin::uBLASVector::PETScVector undefined)
+0.6.2 [2006-09-05]
+ - Finish chapter in manual on linear algebra
+ - Enable PyDOLFIN by default, use --disable-pydolfin to disable
+ - Disable PETSc by default, use --enable-petsc to enable
+ - Modify ODE solver interface for u0() and f()
+ - Add class ConvectionMatrix
+ - Readd classes LoadVector, MassMatrix, StiffnessMatrix
+ - Add matrix factory for simple creation of standard finite element matrices
+ - Collect static solvers in LU and GMRES
+ - Bug fixes for Python interface PyDOLFIN
+ - Enable use of direct solver for ODE solver (experimental)
+ - Remove demo bistable
+ - Restructure and cleanup linear algebra
+ - Use UMFPACK for LU solver with uBLAS matrix types
+ - Add templated wrapper class for different uBLAS matrix types
+ - Add ILU preconditioning for uBLAS matrices
+ - Add Krylov solver for uBLAS sparse matrices (GMRES and BICGSTAB)
+ - Add first version of new mesh library (NewMesh, experimental)
+ - Add Parametrized::readParameters() to trigger reading of values on set()
+ - Remove output of zeros in Octave matrix file format
+ - Use uBLAS-based vector for Vector if PETSc disabled
+ - Add wrappers for uBLAS compressed_matrix class
+ - Compute eigenvalues using SLEPc (an extension of PETSc)
+ - Clean up assembly and linear algebra
+ - Add function to solve Ax = b for dense matrices and dense vectors
+ - Make it possible to compile without PETSc (--disable-petsc)
+ - Much improved ODE solvers
+ - Complete multi-adaptive benchmarks reaction and wave
+ - Assemble boundary integrals
+ - FEM class cleaned up.
+ - Fix multi-adaptive benchmark problem reaction
+ - Small fixes for Intel C++ compiler version 9.1
+ - Test for Intel C++ compiler and configure appropriately
+ - Add new classes DenseMatrix and DenseVector (wrappers for ublas)
+ - Fix bug in conversion from Gmsh format
+0.6.1 [2006-03-28]
+ - Regenerate build system in makedist script
+ - Update for new FFC syntax: BasisFunction --> TestFunction, TrialFunction
+ - Fixes for conversion script dolfin-convert
+ - Initial cleanups and fixes for ODE solvers
+ - Numerous small fixes to improve portability
+ - Remove dolfin:: qualifier on output << in Parameter.h
+ - Don't use anonymous classes in demos, gives errors with some compilers
+ - Remove KrylovSolver::solver()
+ - Fix bug in convection-diffusion demo (boundary condition for pressure), use direct solver
+ - LinearPDE and NewonSolver use umfpack LU solver by default (if available) when doing direct solve
+ - Set PETSc matrix type through Matrix constructor
+ - Allow linear solver and preconditioner type to be passed to NewtonSolver
+ - Fix bug in Stokes demos (wrong boundary conditions)
+ - Cleanup Krylov solver
+ - Remove KrylovSolver::setPreconditioner() etc. and move to constructors
+ - Remove KrylovSolver::setRtol() etc. and replace with parameters
+ - Fix remaining name changes: noFoo() --> numFoo()
+ - Add Cahn-Hilliard equation demo
+ - NewtonSolver option to use residual or incremental convergence criterion
+ - Add separate function to nls to test for convergence of Newton iterations
+ - Fix bug in dolfin-config (wrong version number)
+0.6.0 [2006-03-01]
+ - Fix bug in XML output format (writing multiple objects)
+ - Fix bug in XML matrix output format (handle zero rows)
+ - Add new nonlinear PDE demo
+ - Restructure PDE class to use envelope-letter design
+ - Add precompiled finite elements for q <= 5
+ - Add FiniteElementSpec and factor function for FiniteElement
+ - Add input/output of Function to DOLFIN XML
+ - Name change: dof --> node
+ - Name change: noFoo() --> numFoo()
+ - Add conversion from gmsh format in dolfin-convert script
+ - Updates for PETSc 2.3.1
+ - Add new type of Function (constant)
+ - Simplify use of Function class
+ - Add new demo Stokes + convection-diffusion
+ - Add new demo Stokes (equal-order stabilized)
+ - Add new demo Stokes (Taylor-Hood)
+ - Add new parameter for KrylovSolvers: "monitor convergence"
+ - Add conversion script dolfin-convert for various mesh formats
+ - Add new demo elasticity
+ - Move poisson demo to src/demo/pde/poisson
+ - Move to Mercurial (hg) from CVS
+ - Use libtool to build libraries (including shared)
+0.5.12 [2006-01-12]
+ - Make Stokes solver dimension independent (2D/3D)
+ - Make Poisson solver dimension independent (2D/3D)
+ - Fix sparse matrix output format for MATLAB
+ - Modify demo problem for Stokes, add exact solution and compute error
+ - Change interface for boundary conditions: operator() --> eval()
+ - Add two benchmark problems for the Navier-Stokes solver
+ - Add support for 2D/3D selection in Navier-Stokes solver
+ - Move tic()/toc() to timing.h
+ - Navier-Stokes solver back online
+ - Make Solver a subclass of Parametrized
+ - Add support for localization of parameters
+ - Redesign of parameter system
+0.5.11 [2005-12-15]
+ - Add script monitor for monitoring memory usage
+ - Remove meminfo.h (not portable)
+ - Remove dependence on parameter system in log system
+ - Don't use drand48() (not portable)
+ - Don't use strcasecmp() (not portable)
+ - Remove sysinfo.h and class System (not portable)
+ - Don't include <sys/utsname.h> (not portable)
+ - Change ::show() --> ::disp() everywhere
+ - Clean out old quadrature classes on triangles and tetrahedra
+ - Clean out old sparse matrix code
+ - Update chapter on Functions in manual
+ - Use std::map to store parameters
+ - Implement class KrylovSolver
+ - Name change: Node --> Vertex
+ - Add nonlinear solver demos
+ - Add support for picking sub functions and components of functions
+ - Update interface for FiniteElement for latest FFC version
+ - Improve and restructure implementation of the Function class
+ - Dynamically adjust safety factor during integration
+ - Improve output Matrix::disp()
+ - Check residual at end of time step, reject step if too large
+ - Implement Vector::sum()
+ - Implement nonlinear solver
+ - New option for ODE solver: "save final solution" --> solution.data
+ - New ODE test problem: reaction
+ - Fixes for automake 1.9 (nobase_include_HEADERS)
+ - Reorganize build system, remove fake install and require make install
+ - Add checks for non-standard PETSc component HYPRE in NSE solver
+ - Make GMRES solver return the number of iterations
+ - Add installation script for Python interface
+ - Add Matrix Market format (Haiko Etzel)
+ - Automatically reinitialize GMRES solver when system size changes
+ - Implement cout << for class Vector
+0.5.10 [2005-10-11]
+ - Modify ODE solver interface: add T to constructor
+ - Fix compilation on AMD 64 bit systems (add -fPIC)
+ - Add new BLAS mode for form evaluation
+ - Change enum types in File to lowercase
+ - Change default file type for .m to Octave
+ - Add experimental Python interface PyDOLFIN
+ - Fix compilation for gcc 4.0
+0.5.9 [2005-09-23]
+ - Add Stokes module
+ - Support for arbitrary mixed elements through FFC
+ - VTK output interface now handles time-dependent functions automatically
+ - Fix cout for empty matrix
+ - Change dolfin_start() --> dolfin_end()
+ - Add chapters to manual: about, log system, parameters, reference elements,
+   installation, contributing, license
+ - Use new template fenicsmanual.cls for manual
+ - Add compiler flag -U__STRICT_ANSI__ when compiling under Cygwin
+ - Add class EigenvalueSolver
+0.5.8 [2005-07-05]
+ - Add new output format Paraview/VTK (Garth N. Wells)
+ - Update Tecplot interface
+ - Move to PETSc 2.3.0
+ - Complete support for general order Lagrange elements in triangles and tetrahedra
+ - Add test problem in src/demo/fem/convergence/ for general Lagrange elements
+ - Make FEM::assemble() estimate the number of nonzeros in each row
+ - Implement Matrix::init(M, N, nzmax)
+ - Add Matrix::nz(), Matrix::nzsum() and Matrix::nzmax()
+ - Improve Mesh::disp()
+ - Add FiniteElement::disp() and FEM::disp() (useful for debugging)
+ - Remove old class SparseMatrix
+ - Change FEM::setBC() --> FEM::applyBC()
+ - Change Mesh::tetrahedrons --> Mesh::tetrahedra
+ - Implement Dirichlet boundary conditions for tetrahedra
+ - Implement Face::contains(const Point& p)
+ - Add test for shape dimension of mesh and form in FEM::assemble()
+ - Move src/demo/fem/ demo to src/demo/fem/simple/
+ - Add README file in src/demo/poisson/ (simple manual)
+ - Add simple demo program src/demo/poisson/
+ - Update computation of alignment of faces to match FFC/FIAT
+0.5.7 [2005-06-23]
+ - Clean up ODE test problems
+ - Implement automatic detection of sparsity pattern from given matrix
+ - Clean up homotopy solver
+ - Implement automatic computation of Jacobian
+ - Add support for assembly of non-square systems (Andy Terrel)
+ - Make ODE solver report average number of iterations
+ - Make progress bar write first update at 0%
+ - Initialize all values of u before solution in multi-adaptive solver,
+   not only components given by dependencies
+ - Allow user to modify and verify a converging homotopy path
+ - Make homotopy solver save a list of the solutions
+ - Add Matrix::norm()
+ - Add new test problem for CES economy
+ - Remove cast from Parameter to const char* (use std::string)
+ - Make solution data filename optional for homotopy solver
+ - Append homotopy solution data to file during solution
+ - Add dolfin::seed(int) for optionally seeding random number generator
+ - Remove dolfin::max,min (use std::max,min)
+ - Add polynomial-integer (true polynomial) form of general CES system
+ - Compute multi-adaptive efficiency index
+ - Updates for gcc 4.0 (patches by Garth N. Wells)
+ - Add Matrix::mult(const real x[], uint row) (temporary fix, assumes uniprocessor case)
+ - Add Matrix::mult(const Vector& x, uint row) (temporary fix, assumes uniprocessor case)
+ - Update shortcuts MassMatrix and StiffnessMatrix to new system
+ - Add missing friend to Face.h (reported by Garth N. Wells)
+0.5.6 [2005-05-17]
+ - Implementation of boundary conditions for general order Lagrange (experimental)
+ - Use interpolation function automatically generated by FFC
+ - Put computation of map into class AffineMap
+ - Clean up assembly
+ - Use dof maps automatically generated by FFC (experimental)
+ - Modify interface FiniteElement for new version of FFC
+ - Update ODE homotopy test problems
+ - Add cross product to class Point
+ - Sort mesh entities locally according to ordering used by FIAT and FFC
+ - Add new format for dof maps (preparation for higher-order elements)
+ - Code cleanups: NewFoo --> Foo complete
+ - Updates for new version of FFC (0.1.7)
+ - Bypass log system when finalizing PETSc (may be out of scope)
+0.5.5 [2005-04-26]
+ - Fix broken log system, curses works again
+ - Much improved multi-adaptive time-stepping
+ - Move elasticity module to new system based on FFC
+ - Add boundary conditions for systems
+ - Improve regulation of time steps
+ - Clean out old assembly classes
+ - Clean out old form classes
+ - Remove kernel module map
+ - Remove kernel module element
+ - Move convection-diffusion module to new system based on FFC
+ - Add iterators for cell neighbors of edges and faces
+ - Implement polynomial for of CES economy
+ - Rename all new linear algebra classes: NewFoo --> Foo
+ - Clean out old linear algebra
+ - Speedup setting of boundary conditions (add MAT_KEEP_ZEROED_ROWS)
+ - Fix bug for option --disable-curses
+0.5.4 [2005-03-29]
+ - Remove option to compile with PETSc 2.2.0 (2.2.1 required)
+ - Make make install work again (fix missing includes)
+ - Add support for mixing multiple finite elements (through FFC)
+ - Improve functionality of homotopy solver
+ - Simple creation of piecewise linear functions (without having an element)
+ - Simple creation of piecewise linear elements
+ - Add support of automatic creation of simple meshes (unit cube, unit square)
+0.5.3 [2005-02-26]
+ - Change to PETSc version 2.2.1
+ - Add flag --with-petsc=<path> to configure script
+ - Move Poisson's equation to system based on FFC
+ - Add support for automatic creation of homotopies
+ - Make all ODE solvers automatically handle complex ODEs: (M) z' = f(z,t)
+ - Implement version of mono-adaptive solver for implicit ODEs: M u' = f(u,t)
+ - Implement Newton's method for multi- and mono-adaptive ODE solvers
+ - Update PETSc wrappers NewVector, NewMatrix, and NewGMRES
+ - Fix initialization of PETSc
+ - Add mono-adaptive cG(q) and dG(q) solvers (experimental)
+ - Implementation of new assebly: NewFEM, using output from FFC
+ - Add access to mesh for nodes, cells, faces and edges
+ - Add Tecplot I/O interface; contributed by Garth N. Wells
+0.5.2 [2005-01-26]
+ - Benchmarks for DOLFIN vs PETSc (src/demo/form and src/demo/test)
+ - Complete rewrite of the multi-adaptive ODE solver (experimental)
+ - Add wrapper for PETSc GMRES solver
+ - Update class Point with new operators
+ - Complete rewrite of the multi-adaptive solver to improve performance
+ - Add PETSc wrappers NewMatrix and NewVector
+ - Add DOLFIN/PETSc benchmarks
+0.5.1 [2004-11-10]
+ - Experimental support for automatic generation of forms using FFC
+ - Allow user to supply Jacobian to ODE solver
+ - Add optional test to check if a dependency already exists (Sparsity)
+ - Modify sparse matrix output (Matrix::show())
+ - Add FGMRES solver in new format (patch from eriksv)
+ - Add non-const version of quick-access of sparse matrices
+ - Add linear mappings for simple computation of derivatives
+ - Add check of matrix dimensions for ODE sparsity pattern
+ - Include missing cmath in Function.cpp
+0.5.0 [2004-08-18]
+ - First prototype of new form evaluation system
+ - New classes Jacobi, SOR, Richardson (preconditioners and linear solvers)
+ - Add integrals on the boundary (ds), partly working
+ - Add maps from boundary of reference cell
+ - Add evaluation of map from reference cell
+ - New Matrix functions: max, min, norm, and sum of rows and columns (erik)
+ - Derivatives/gradients of ElementFunction (coefficients f.ex.) implemented
+ - Enable assignment to all elements of a NewArray
+ - Add functions Boundary::noNodes(), noFaces(), noEdges()
+ - New class GaussSeidel (preconditioner and linear solver)
+ - New classes Preconditioner and LinearSolver
+ - Bug fix for tetrahedral mesh refinement (ingelstrom)
+ - Add iterators for Edge and Face on Boundary
+ - Add functionality to Map: bdet() and cell()
+ - Add connectivity face-cell and edge-cell
+ - New interface for assembly: Galerkin --> FEM
+ - Bug fix for PDE systems of size > 3
+0.4.11 [2004-04-23]
+ - Add multigrid solver (experimental)
+ - Update manual
+0.4.10
+ - Automatic model reduction (experimental)
+ - Fix bug in ParticleSystem (divide by mass)
+ - Improve control of integration (add function ODE::update())
+ - Load/save parameters in XML-format
+ - Add assembly test
+ - Add simple StiffnessMatrix, MassMatrix, and LoadVector
+ - Change dK --> dx
+ - Change dx() --> ddx()
+ - Add support for GiD file format
+ - Add performance tests for multi-adaptivity (both stiff and non-stiff)
+ - First version of Newton for the multi-adaptive solver
+ - Test for Newton for the multi-adaptive solver
+0.4.9
+ - Add multi-adaptive solver for the bistable equation
+ - Add BiCGSTAB solver (thsv)
+ - Fix bug in SOR (thsv)
+ - Improved visual program for OpenDX
+ - Fix OpenDX file format for scalar functions
+ - Allow access to samples of multi-adaptive solution
+ - New patch from thsv for gcc 3.4.0 and 3.5.0
+ - Make progress step a parameter
+ - New function ODE::sparse(const Matrix& A)
+ - Access nodes, cells, edges, faces by id
+ - New function Matrix::lump()
+0.4.8
+ - Add support for systems (jansson and bengzon)
+ - Add new module wave
+ - Add new module wave-vector
+ - Add new module elasticity
+ - Add new module elasticity-stationary
+ - Multi-adaptive updates
+ - Fix compilation error in LogStream
+ - Fix local Newton iteration for higher order elements
+ - Init matrix to given type
+ - Add output of cG(q) and dG(q) weights in matrix format
+ - Fix numbering of frames from plotslab script
+ - Add png output for plotslab script
+ - Add script for running stiff test problems, plot solutions
+ - Fix bug in MeshInit (node neighbors of node)
+ - Modify output of sysinfo()
+ - Compile with -Wall -Werror -pedantic -ansi -std=c++98 (thsv)
+0.4.7
+ - Make all stiff test problems work
+ - Display status report also when using step()
+ - Improve adaptive damping for stiff problems (remove spikes)
+ - Modify Octave/Matlab format for solution data (speed improvement)
+ - Adaptive sampling of solution (optional)
+ - Restructure stiff test problems
+ - Check if value of right-hand side is valid
+ - Modify divergence test in AdaptiveIterationLevel1
+0.4.6
+ - Save vectors and matrices from Matlab/Octave (foufas)
+ - Rename writexml.m to xmlmesh.m
+ - Inlining of important functions
+ - Optimize evaluation of elements
+ - Optimize Lagrange polynomials
+ - Optimize sparsity: use stl containers
+ - Optimize choice of discrete residual for multi-adaptive solver
+ - Don't save solution in benchmark proble
+ - Improve computation of divergence factor for underdamped systems
+ - Don't check residual on first slab for fixed time step
+ - Decrease largest (default) time step to 0.1
+ - Add missing <cmath> in TimeStepper
+ - Move real into dolfin namespace
+0.4.5
+ - Rename function.h to enable compilation under Cygwin
+ - Add new benchmark problem for multi-adaptive solver
+ - Bug fix for ParticleSystem
+ - Initialization of first time step
+ - Improve time step regulation (threshold)
+ - Improve stabilization
+ - Improve TimeStepper interface (Ko Project)
+ - Use iterators instead of recursively calling TimeSlab::update()
+ - Clean up ODESolver
+ - Add iterators for elements in time slabs and element groups
+ - Add -f to creation of symbolic links
+0.4.4
+ - Add support for 3D graphics in Octave using Open Inventor (jj)
+0.4.3
+ - Stabilization of multi-adaptive solver (experimental)
+ - Improved non-support for curses (--disable-curses)
+ - New class MechanicalSystem for simulating mechanical systems
+ - Save debug info from primal and dual (plotslab.m)
+ - Fix bug in progress bar
+ - Add missing include file in Components.h (kakr)
+ - New function dolfin_end(const char* msg, ...)
+ - Move numerical differentiation to RHS
+ - New class Event for limited display of messages
+ - Fix bug in LogStream (large numbers in floating point format)
+ - Specify individual time steps for different components
+ - Compile without warnings
+ - Add -Werror to option enable-debug
+ - Specify individual methods for different components
+ - Fix bug in dGqMethods
+ - Fix bug (delete old block) in ElementData
+ - Add parameters for method and order
+ - New test problem reaction
+ - New class FixedPointIteration
+ - Fix bug in grid refinement
+0.4.2
+ - Fix bug in computation of residual (divide by k)
+ - Add automatic generation and solution of the dual problem
+ - Automatic selection of file names for primal and dual
+ - Fix bug in progress bar (TerminalLogger)
+ - Many updates of multi-adaptive solver
+ - Add class ODEFunction
+ - Update function class hierarchies
+ - Move functions to a separate directory
+ - Store multi-adaptive solution binary on disk with cache
+0.4.1
+ - First version of multi-adaptive solver working
+ - Clean up file formats
+ - Start changing from int to unsigned int where necessary
+ - Fix bool->int when using stdard in Parameter
+ - Add NewArray and NewList (will replace Array and List)
+0.4.0
+ - Initiation of the FEniCS project
+ - Change syntax of mesh files: grid -> mesh
+ - Create symbolic links instead of copying files
+ - Tanganyika -> ODE
+ - Add Heat module
+ - Grid -> Mesh
+ - Move forms and mappings to separate libraries
+ - Fix missing include of DirectSolver.h
+0.3.12
+ - Adaptive grid refinement (!)
+ - Add User Manual
+ - Add function dolfin_log() to turn logging on/off
+ - Change from pointers to references for Node, Cell, Edge, Face
+ - Update writexml.m
+ - Add new grid files and rename old grid files
+0.3.11
+ - Add configure option --disable-curses
+ - Grid refinement updates
+ - Make OpenDX file format work for grids (output)
+ - Add volume() and diameter() in cell
+ - New classes TriGridRefinement and TetGridRefinement
+ - Add iterators for faces and edges on a boundary
+ - New class GridHierarchy
+0.3.10
+ - Use new boundary structure in Galerkin
+ - Make dolfin_start() and dolfin_end() work
+ - Make dolfin_assert() raise segmentation fault for plain text mode
+ - Add configure option --enable-debug
+ - Use autoreconf instead of scripts/preconfigure
+ - Rename configure.in -> configure.ac
+ - New class FaceIterator
+ - New class Face
+ - Move computation of boundary from GridInit to BoundaryInit
+ - New class BoundaryData
+ - New class BoundaryInit
+ - New class Boundary
+ - Make InitGrid compute edges
+ - Add test program for generic matrix in src/demo/la
+ - Clean up Grid classes
+ - Add new class GridRefinementData
+ - Move data from Cell to GenericCell
+ - Make GMRES work with user defined matrix, only mult() needed
+ - GMRES now uses only one function to compute residual()
+ - Change Matrix structure (a modified envelope/letter)
+ - Update script checkerror.m for Poisson
+ - Add function dolfin_info_aptr()
+ - Add cast to element pointer for iterators
+ - Clean up and improve the Tensor class
+ - New class: List
+ - Name change: List -> Table
+ - Name change: ShortList -> Array
+ - Make functions in GridRefinement static
+ - Make functions in GridInit static
+ - Fix bug in GridInit (eriksv)
+ - Add output to OpenDX format for 3D grids
+ - Clean up ShortList class
+ - Clean up List class
+ - New class ODE, Equation replaced by PDE
+ - Add Lorenz test problem
+ - Add new problem type for ODEs
+ - Add new module ode
+ - Work on multi-adaptive ODE solver (lots of new stuff)
+ - Work on grid refinement
+ - Write all macros in LoggerMacros in one line
+ - Add transpose functions to Matrix (Erik)
+0.3.9
+ - Update Krylov solver (Erik, Johan)
+ - Add new LU factorization and LU solve (Niklas)
+ - Add benchmark test in src/demo/bench
+ - Add silent logger
+0.3.8
+ - Make sure dolfin-config is regenerated every time
+ - Add demo program for cG(q) and dG(q)
+ - Add dG(q) precalc of nodal points and weights
+ - Add cG(q) precalc of nodal points and weights
+ - Fix a bug in configure.in (AC_INIT with README)
+ - Add Lagrange polynomials
+ - Add multiplication with transpose
+ - Add scalar products with rows and columns
+ - Add A[i][j] index operator for quick access to dense matrix
+0.3.7
+ - Add new Matlab-like syntax like A(i,all) = x or A(3,all) = A(4,all)
+ - Add dolfin_assert() macro enabled if debug is defined
+ - Redesign of Matrix/DenseMatrix/SparseMatrix to use Matrix as common interface
+ - Include missing cmath in Legendre.cpp and GaussianQuadrature.cpp
+0.3.6
+ - Add output functionality in DenseMatrix
+ - Add high precision solver to DirectSolver
+ - Clean up error messages in Matrix
+ - Make solvers directly accessible through Matrix and DenseMatrix
+ - Add quadrature (Gauss, Radau, and Lobatto) from Tanganyika
+ - Start merge with Tanganyika
+ - Add support for automatic documentation using doxygen
+ - Update configure scripts
+ - Add greeting at end of compilation
+0.3.5
+ - Define version number only in the file configure.in
+ - Fix compilation problem (missing depcomp)
+0.3.4
+ - Fix bugs in some of the ElementFunction operators
+ - Make convection-diffusion solver work again
+ - Fix bug in integration, move multiplication with the determinant
+ - Fix memory leaks in ElementFunction
+ - Add parameter to choose output format
+ - Make OctaveFile and MatlabFile subclasses of MFile
+ - Add classes ScalarExpressionFunction and VectorExpressionFunction
+ - Make progress bars work cleaner
+ - Get ctrl-c in curses logger
+ - Remove <Problem>Settings-classes and use dolfin_parameter()
+ - Redesign settings to match the structure of the log system
+ - Add vector functions: Function::Vector
+ - Add vector element functions: ElementFunction::Vector
+0.3.3
+ - Increased functionality of curses-based interface
+ - Add progress bars to log system
+0.3.2
+ - More work on grid refinement
+ - Add new curses based log system
+0.3.1
+ - Makefile updates: make install should now work properly
+ - KrylovSolver updates
+ - Preparation for grid refinement
+ - Matrix and Vector updates
+0.3.0
+ - Make poisson work again, other modules still not working
+ - Add output format for octave
+ - Fix code to compile with g++-3.2 -Wall -Werror
+ - New operators for Matrix
+ - New and faster GMRES solver (speedup factor 4)
+ - Changed name from SparseMatrix to Matrix
+ - Remove old unused code
+ - Add subdirectory math containing mathematical functions
+ - Better access for A(i,j) += to improve speed in assembling
+ - Add benchmark for linear algebra
+ - New definition of finite element
+ - Add algebra for function spaces
+ - Convert grids in data/grids to xml.gz
+ - Add iterators for Nodes and Cells
+ - Change from .hh to .h
+ - Add operators to Vector class (foufas)
+ - Add dependence on libxml2
+ - Change from .C to .cpp to make Jim happy.
+ - Change input/output functionality to streams
+ - Change to new data structure for Grid
+ - Change to object-oriented API at top level
+ - Add use of C++ namespaces
+ - Complete and major restructuring of the code
+ - Fix compilation error in src/config
+ - Fix name of keyword for convection-diffusion
+0.2.11-1
+ - Fix compilation error (`source`) on Solaris
+0.2.11
+ - Automate build process to simplify addition of new modules
+ - Fix bug in matlab_write_field() (walter)
+ - Fix bug in SparseMatrix::GetCopy() (foufas)
+0.2.10-1
+ - Fix compilation errors on RedHat (thsv)
+0.2.10
+ - Fix compilation of problems to use correct compiler
+ - Change default test problems to the ones in the report
+ - Improve memory management using mpatrol for tracking allocations
+ - Change bool to int for va_arg, seems to be a problem with gcc > 3.0
+ - Improve input / output support: GiD, Matlab, OpenDX
+0.2.8
+ - Navier-Stokes starting to work again
+ - Add Navier-Stokes 2d
+ - Bug fixes
+0.2.7
+ - Add support for 2D problems
+ - Add module convection-diffusion
+ - Add local/global fields in equation/problem
+ - Bug fixes
+ - Navier-Stokes updates (still broken)
+0.2.6 [2002-02-19]
+ - Navier-Stokes updates (still broken)
+ - Output to matlab format
+0.2.5
+ - Add variational formulation with overloaded operators for systems
+ - ShapeFunction/LocalField/FiniteElement according to Scott & Brenner
+0.2.4
+ - Add boundary conditions
+ - Poisson seems to work ok
+0.2.3
+ - Add GMRES solver
+ - Add CG solver
+ - Add direct solver
+ - Add Poisson solver
+ - Big changes to the organisation of the source tree
+ - Add kwdist.sh script
+ - Bug fixes
+0.2.2:
+ - Remove curses temporarily
+0.2.1:
+ - Remove all PETSc stuff. Finally!
+ - Gauss-Seidel cannot handle the pressure equation
+0.2.0:
+ - First GPL release
+ - Remove all of Klas Samuelssons proprietary grid code
+ - Adaptivity and refinement broken, include in next release
diff --git a/INSTALL b/INSTALL
new file mode 100644
index 0000000..88199c1
--- /dev/null
+++ b/INSTALL
@@ -0,0 +1,80 @@
+Requirements
+------------
+
+DOLFIN uses CMake for configuration and installation. DOLFIN also
+relies on a number of other third-party libraries. Your system will be
+probed for these libraries as part of the configuration process.
+
+Simple build and install
+------------------------
+
+In the simplest case, just issue the commands
+
+  cmake .
+  make install
+
+This will first configure DOLFIN for your system and then compile and
+install DOLFIN in your system's default installation direcory, for
+example in /usr/local/ or /opt/local/.
+
+Local installation
+------------------
+
+It may sometimes be advantageous to install DOLFIN locally as part
+of the DOLFIN source tree. To do this, simply type
+
+  ./cmake.local
+
+This configures, compiles, and install DOLFIN in a directory named
+'local' in the DOLFIN source tree.
+
+(Re-)generating the SWIG interface and docstrings
+-------------------------------------------------
+
+In order to regenerate the SWIG interface and update the
+documentation, respectively, run the generator scripts:
+
+   ./cmake/scripts/generate-swig-interface
+   ./cmake/scripts/generate-swig-docstrings
+
+Customized builds
+-----------------
+
+To customize the configuration of DOLFIN, it is convenient to use one
+of the graphical user interfaces for CMake, such as either ccmake or
+cmake-gui. These frontends to CMake allow simple manipulation of
+variables that control the configuration of DOLFIN.
+
+It is often useful to build DOLFIN 'out-of-source' which means that
+all files generated by the build process end up in a separate
+directory without cluttering the source tree. To make an out-of-source
+build for DOLFIN using a graphical interface to CMake, simply type
+
+  mkdir build
+  cd build
+  cmake-gui ..
+  make install
+
+Building demos and tests
+------------------------
+
+To build demos, enter the build directory (if any) and type
+
+  make demo
+
+This will build all demos. To build a specific demo, just name the
+demo you want to build, for example the Poisson demo, and type
+
+  make poisson-demo
+
+Alternatively, you may navigate to the demo directory directly, for
+example demo/pde/poisson/cpp and then build the demo using CMake as
+above:
+
+  cmake .
+  make
+
+Python demos can be run directly by navigating to the directory of the
+demo and typing
+
+  python demo.py
diff --git a/README.rst b/README.rst
new file mode 100644
index 0000000..cc52c6e
--- /dev/null
+++ b/README.rst
@@ -0,0 +1,61 @@
+======
+DOLFIN
+======
+
+DOLFIN is the C++/Python interface of FEniCS, providing a consistent
+PSE (Problem Solving Environment) for ordinary and partial
+differential equations.
+
+Installation
+============
+
+To build DOLFIN, run::
+
+  cmake .
+  make install
+
+For detailed instructions, see the file INSTALL.
+
+
+License
+=======
+
+DOLFIN is free software: you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as published by
+the Free Software Foundation, either version 3 of the License, or
+(at your option) any later version.
+
+DOLFIN 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 Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public License
+along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+
+Contact
+=======
+
+For comments and requests, send an email to the FEniCS mailing list:
+
+  fenics@fenicsproject.org
+
+For questions and bug reports, visit the FEniCS Q&A page:
+
+  http://fenicsproject.org/qa
+
+For bug reports, visit the DOLFIN Bitbucket page:
+
+  http://bitbucket.org/fenics-project/dolfin
+
+
+About
+=====
+
+DOLFIN is developed by a group of mathematicians, computational
+scientists and engineers distributed around the world. A list of
+authors can be found in the file AUTHORS. For more information about
+DOLFIN, visit
+
+  http://fenicsproject.org
diff --git a/bench/CMakeLists.txt b/bench/CMakeLists.txt
new file mode 100644
index 0000000..f68b79d
--- /dev/null
+++ b/bench/CMakeLists.txt
@@ -0,0 +1,33 @@
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+# FIXME: Temporary fix for whitespace error
+cmake_policy(SET CMP0004 OLD)
+
+# Find DOLFIN config file (not used here, but check that benchmarks will be
+# able to find it
+find_package(DOLFIN REQUIRED)
+
+# If config file is found, add all demo sub-directories, else print helper
+# message
+if (DOLFIN_FOUND)
+
+  # Build list of all cpp directories
+  file( GLOB_RECURSE list "main.cpp")
+  list( SORT list )
+  string(REGEX REPLACE "/main.cpp" "" list "${list}")
+
+  # Add each C++ code directory
+  foreach (cpp_dir ${list})
+    #message(STATUS "Add C++ benchmark: ${cpp_dir}")
+    add_subdirectory(${cpp_dir})
+  endforeach()
+
+  # Add fem/speedup/cpp manually (no main.cpp so not picked up automatically)
+  add_subdirectory(fem/speedup/cpp)
+
+else()
+
+  message(STATUS "Could not locate DOLFINConfig.cmake file. Did you do 'make install' for the DOLFIN library and set the appropriate paths (source <build_dir>/dolfin.conf)?")
+
+endif()
diff --git a/bench/README b/bench/README
new file mode 100644
index 0000000..e65d334
--- /dev/null
+++ b/bench/README
@@ -0,0 +1,23 @@
+This directory (and its sub directories) contain a benchmark suite for
+DOLFIN. To run all benchmarks, simply run the script demo.py.
+
+This script runs all executables/scripts named 'bench' found in the
+directory tree and records the result for benchmark found in foo/bar
+under the name 'foo-bar' in logs/bench.log.
+
+Two pieces of information are extracted from each benchmark:
+
+1. A short description of the benchmark. This is extracted as the
+first line of output from the benchmark.
+
+2. One or more timings. These are extracted from output in the form
+
+  BENCH <totaltime>
+  BENCH <subtask> <subtime>
+
+If no output is given (or <totaltime> is not given), then the total
+running time of the program is recorded.
+
+Important notice: To run the benchmarks correctly, you need to compile
+DOLFIN with option --enable-optimization. Compiling DOLFIN with
+--enable-debug will slow down some of the benchmarks considerably.
diff --git a/bench/bench.py b/bench/bench.py
new file mode 100644
index 0000000..7d18eb1
--- /dev/null
+++ b/bench/bench.py
@@ -0,0 +1,110 @@
+"Run all benchmarks"
+
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johannes Ring, 2011, 2012
+#
+# First added:  2010-03-26
+# Last changed: 2012-03-15
+
+import os, sys, time
+
+failed = []
+
+def run_bench(arg, directory, files):
+
+    # Skip directories not containing a benchmark
+    bench_exec = "bench_" + "_".join(directory.split(os.path.sep)[1:])
+    if not bench_exec in files:
+        return
+
+    # Get name of benchmark
+    name = directory.replace("./", "").replace("/", "-")
+    print "Running benchmark %s..." % name
+
+    # Remove old logfile
+    cwd = os.getcwd()
+    logfile = os.path.join(cwd, "logs", name + ".log")
+    try:
+        os.remove(logfile)
+    except:
+        pass
+
+    # Run benchmark
+    os.chdir(directory)
+    t0 = time.time()
+    status = os.system(os.path.join(os.curdir, bench_exec) + " > %s" % logfile)
+    elapsed_time = time.time() - t0
+
+    # Change to toplevel directory
+    os.chdir(cwd)
+
+    # Report timing
+    if status == 0:
+        print "Completed in %g seconds\n" % elapsed_time
+    else:
+        global failed
+        failed.append(name)
+        print "*** Failed\n"
+        return
+
+    # Get description of benchmark
+    f = open(logfile)
+    description = f.read().split("\n")[0]
+    f.close()
+
+    # Get timings (if any)
+    f = open(logfile)
+    run_timings = [("", elapsed_time)]
+    for line in [line for line in f.read().split("\n") if "BENCH" in line]:
+        words = [word.strip() for word in line.split(" ")]
+        # Override total time
+        if len(words) == 2:
+            run_timings[0] = ("", float(words[1]))
+        # Add sub timing
+        elif len(words) == 3:
+            run_timings.append((words[1].lower(), float(words[2])))
+    f.close()
+
+    # Append to log file
+    d = time.gmtime()
+    date = str((d.tm_year, d.tm_mon, d.tm_mday, d.tm_hour, d.tm_min, d.tm_sec))
+    f = open(os.path.join("logs", "bench.log"), "a")
+    for (postfix, timing) in run_timings:
+        if postfix == "":
+            n = name
+            d = description
+        else:
+            n = "%s-%s" % (name, postfix)
+            d = "%s (%s)" % (description, postfix)
+        f.write('%s %s %g "%s"\n'  % (date, n, timing, d))
+
+    return status == 0
+
+# Iterate over benchmarks
+os.path.walk(".", run_bench, None)
+
+# Print summary
+if len(failed) == 0:
+    print "All benchmarks OK"
+else:
+    print "%d benchmark(s) failed:" % len(failed)
+    for name in failed:
+        print "  " + name
+
+sys.exit(len(failed))
diff --git a/bench/common/progress/cpp/CMakeLists.txt b/bench/common/progress/cpp/CMakeLists.txt
new file mode 100644
index 0000000..81b479e
--- /dev/null
+++ b/bench/common/progress/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_common_progress_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/common/progress/cpp/main.cpp b/bench/common/progress/cpp/main.cpp
new file mode 100644
index 0000000..ad1c6fe
--- /dev/null
+++ b/bench/common/progress/cpp/main.cpp
@@ -0,0 +1,46 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-06-29
+// Last changed: 2010-11-16
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 5
+#define SIZE 500000000
+
+int main(int argc, char* argv[])
+{
+  info("Creating progress bar with %d steps (%d repetitions)",
+       SIZE, NUM_REPS);
+
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    Progress p("Stepping", SIZE);
+    double sum = 0.0;
+    for (int j = 0; j < SIZE; j++)
+    {
+      sum += 0.1;
+      p++;
+    }
+    dolfin::cout << "sum = " << sum << dolfin::endl;
+  }
+
+  return 0;
+}
diff --git a/bench/common/timing/cpp/CMakeLists.txt b/bench/common/timing/cpp/CMakeLists.txt
new file mode 100644
index 0000000..9708dd0
--- /dev/null
+++ b/bench/common/timing/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_common_timing_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/common/timing/cpp/main.cpp b/bench/common/timing/cpp/main.cpp
new file mode 100644
index 0000000..4920e59
--- /dev/null
+++ b/bench/common/timing/cpp/main.cpp
@@ -0,0 +1,58 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-11-16
+// Last changed: 2010-11-16
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 10000000
+
+int main(int argc, char* argv[])
+{
+  info("Timing access and registration of timings (%d repetitions)", NUM_REPS);
+
+  // Access to timer
+  double sum = 0.0;
+  double t0 = time();
+  double t1 = t0;
+  Timer timer_function("time() function");
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    t0 = time();
+    t1 = time();
+    sum += t1 - t0;
+  }
+  timer_function.stop();
+  dolfin::cout << "sum = " << sum << dolfin::endl << dolfin::endl;
+
+  // Test timer
+  Timer timer_loop("timer start/stop");
+  Timer timer_class("Timer class");
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    timer_loop.start();
+    timer_loop.stop();
+  }
+  timer_class.stop();
+
+  summary();
+
+  return 0;
+}
diff --git a/bench/fem/assembly/cpp/CMakeLists.txt b/bench/fem/assembly/cpp/CMakeLists.txt
new file mode 100644
index 0000000..aa8ef15
--- /dev/null
+++ b/bench/fem/assembly/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_fem_assembly_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/fem/assembly/cpp/forms.h b/bench/fem/assembly/cpp/forms.h
new file mode 100644
index 0000000..6bf6bda
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms.h
@@ -0,0 +1,99 @@
+// Copyright (C) 2008-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-07-22
+// Last changed: 2010-05-03
+
+#include <dolfin.h>
+
+#include "forms/Poisson2DP1.h"
+#include "forms/Poisson2DP2.h"
+#include "forms/Poisson2DP3.h"
+#include "forms/THStokes2D.h"
+#include "forms/StabStokes2D.h"
+#include "forms/Elasticity3D.h"
+#include "forms/NSEMomentum3D.h"
+
+#define SIZE_2D 256
+#define SIZE_3D 32
+
+using namespace dolfin;
+
+double bench_form(std::string form_name, double (*foo)(Form&))
+{
+  if (form_name == "poisson1")
+  {
+    UnitSquareMesh mesh(SIZE_2D, SIZE_2D);
+    Poisson2DP1::FunctionSpace V(mesh);
+    Poisson2DP1::BilinearForm form(V, V);
+    return foo(form);
+  }
+  else if (form_name == "poisson2")
+  {
+    UnitSquareMesh mesh(SIZE_2D, SIZE_2D);
+    Poisson2DP2::FunctionSpace V(mesh);
+    Poisson2DP2::BilinearForm form(V, V);
+    return foo(form);
+  }
+  else if (form_name == "poisson3")
+  {
+    UnitSquareMesh mesh(SIZE_2D, SIZE_2D);
+    Poisson2DP3::FunctionSpace V(mesh);
+    Poisson2DP3::BilinearForm form(V, V);
+    return foo(form);
+  }
+  else if (form_name == "stokes")
+  {
+    UnitSquareMesh mesh(SIZE_2D, SIZE_2D);
+    THStokes2D::FunctionSpace V(mesh);
+    THStokes2D::BilinearForm form(V, V);
+    return foo(form);
+  }
+  else if (form_name == "stabilization")
+  {
+    UnitSquareMesh mesh(SIZE_2D, SIZE_2D);
+    StabStokes2D::FunctionSpace V(mesh);
+    Constant h(1.0);
+    StabStokes2D::BilinearForm form(V, V, h);
+    return foo(form);
+  }
+  else if (form_name == "elasticity")
+  {
+    UnitCubeMesh mesh(SIZE_3D, SIZE_3D, SIZE_3D);
+    Elasticity3D::FunctionSpace V(mesh);
+    Elasticity3D::BilinearForm form(V, V);
+    return foo(form);
+  }
+  else if (form_name == "navierstokes")
+  {
+    UnitCubeMesh mesh(SIZE_3D, SIZE_3D, SIZE_3D);
+    NSEMomentum3D::FunctionSpace V(mesh);
+    Constant  w(1.0, 1.0, 1.0);
+    Constant d1(1.0);
+    Constant d2(1.0);
+    Constant k(1.0);
+    Constant nu(1.0);
+    NSEMomentum3D::BilinearForm form(V, V, w, d1, d2, k, nu);
+    return foo(form);
+  }
+  else
+  {
+    error("Unknown form: %s.", form_name.c_str());
+  }
+
+  return 0.0;
+}
diff --git a/bench/fem/assembly/cpp/forms/Elasticity3D.h b/bench/fem/assembly/cpp/forms/Elasticity3D.h
new file mode 100644
index 0000000..4df063c
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/Elasticity3D.h
@@ -0,0 +1,5519 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ELASTICITY3D_H
+#define __ELASTICITY3D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class elasticity3d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity3d_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity3d_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity3d_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elasticity3d_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity3d_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity3d_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 9:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[10] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[11] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[4];
+    vertex_values[4] = dof_values[5];
+    vertex_values[7] = dof_values[6];
+    vertex_values[10] = dof_values[7];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[8];
+    vertex_values[5] = dof_values[9];
+    vertex_values[8] = dof_values[10];
+    vertex_values[11] = dof_values[11];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity3d_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity3d_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity3d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity3d_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity3d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity3d_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity3d_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity3d_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity3d_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity3d_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity3d_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[0][0];
+    dofs[5] = offset + c.entity_indices[0][1];
+    dofs[6] = offset + c.entity_indices[0][2];
+    dofs[7] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[8] = offset + c.entity_indices[0][0];
+    dofs[9] = offset + c.entity_indices[0][1];
+    dofs[10] = offset + c.entity_indices[0][2];
+    dofs[11] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 9;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 11;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 10;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 4;
+        dofs[2] = 8;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 5;
+        dofs[2] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 6;
+        dofs[2] = 10;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 7;
+        dofs[2] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = vertex_coordinates[0];
+    dof_coordinates[4][1] = vertex_coordinates[1];
+    dof_coordinates[4][2] = vertex_coordinates[2];
+    dof_coordinates[5][0] = vertex_coordinates[3];
+    dof_coordinates[5][1] = vertex_coordinates[4];
+    dof_coordinates[5][2] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[6];
+    dof_coordinates[6][1] = vertex_coordinates[7];
+    dof_coordinates[6][2] = vertex_coordinates[8];
+    dof_coordinates[7][0] = vertex_coordinates[9];
+    dof_coordinates[7][1] = vertex_coordinates[10];
+    dof_coordinates[7][2] = vertex_coordinates[11];
+    dof_coordinates[8][0] = vertex_coordinates[0];
+    dof_coordinates[8][1] = vertex_coordinates[1];
+    dof_coordinates[8][2] = vertex_coordinates[2];
+    dof_coordinates[9][0] = vertex_coordinates[3];
+    dof_coordinates[9][1] = vertex_coordinates[4];
+    dof_coordinates[9][2] = vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[6];
+    dof_coordinates[10][1] = vertex_coordinates[7];
+    dof_coordinates[10][2] = vertex_coordinates[8];
+    dof_coordinates[11][0] = vertex_coordinates[9];
+    dof_coordinates[11][1] = vertex_coordinates[10];
+    dof_coordinates[11][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity3d_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity3d_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity3d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity3d_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elasticity3d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elasticity3d_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity3d_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.166666666666667;
+    // Quadrature points on the UFC reference element: (0.25, 0.25, 0.25)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0_D001[1][2] = \
+    {{-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[2] = {8, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {4, 7};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[2] = {4, 6};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[2] = {8, 10};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[2] = {4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[2] = {8, 9};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 144; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 324.
+    double G[45];
+    G[0] = W1*det*(13.4615384615385*K[5]*K[5] + 3.84615384615385*(K[3]*K[3] + K[4]*K[4]));
+    G[1] = W1*det*(13.4615384615385*K[2]*K[5] + 3.84615384615385*(K[0]*K[3] + K[1]*K[4]));
+    G[2] = W1*det*(3.84615384615385*K[3]*K[8] + 5.76923076923077*K[5]*K[6]);
+    G[3] = 9.61538461538461*K[3]*K[5]*W1*det;
+    G[4] = W1*det*(3.84615384615385*K[2]*K[3] + 5.76923076923077*K[0]*K[5]);
+    G[5] = W1*det*(3.84615384615385*K[4]*K[8] + 5.76923076923077*K[5]*K[7]);
+    G[6] = 9.61538461538461*K[4]*K[5]*W1*det;
+    G[7] = W1*det*(3.84615384615385*K[2]*K[4] + 5.76923076923077*K[1]*K[5]);
+    G[8] = W1*det*(13.4615384615385*K[5]*K[8] + 3.84615384615385*(K[3]*K[6] + K[4]*K[7]));
+    G[9] = W1*det*(13.4615384615385*K[2]*K[2] + 3.84615384615385*(K[0]*K[0] + K[1]*K[1]));
+    G[10] = W1*det*(3.84615384615385*K[0]*K[8] + 5.76923076923077*K[2]*K[6]);
+    G[11] = W1*det*(3.84615384615385*K[0]*K[5] + 5.76923076923077*K[2]*K[3]);
+    G[12] = 9.61538461538461*K[0]*K[2]*W1*det;
+    G[13] = W1*det*(3.84615384615385*K[1]*K[8] + 5.76923076923077*K[2]*K[7]);
+    G[14] = W1*det*(3.84615384615385*K[1]*K[5] + 5.76923076923077*K[2]*K[4]);
+    G[15] = 9.61538461538461*K[1]*K[2]*W1*det;
+    G[16] = W1*det*(13.4615384615385*K[2]*K[8] + 3.84615384615385*(K[0]*K[6] + K[1]*K[7]));
+    G[17] = W1*det*(13.4615384615385*K[6]*K[6] + 3.84615384615385*(K[7]*K[7] + K[8]*K[8]));
+    G[18] = W1*det*(13.4615384615385*K[3]*K[6] + 3.84615384615385*(K[4]*K[7] + K[5]*K[8]));
+    G[19] = W1*det*(13.4615384615385*K[0]*K[6] + 3.84615384615385*(K[1]*K[7] + K[2]*K[8]));
+    G[20] = 9.61538461538461*K[6]*K[7]*W1*det;
+    G[21] = W1*det*(3.84615384615385*K[3]*K[7] + 5.76923076923077*K[4]*K[6]);
+    G[22] = W1*det*(3.84615384615385*K[0]*K[7] + 5.76923076923077*K[1]*K[6]);
+    G[23] = 9.61538461538461*K[6]*K[8]*W1*det;
+    G[24] = W1*det*(13.4615384615385*K[3]*K[3] + 3.84615384615385*(K[4]*K[4] + K[5]*K[5]));
+    G[25] = W1*det*(13.4615384615385*K[0]*K[3] + 3.84615384615385*(K[1]*K[4] + K[2]*K[5]));
+    G[26] = W1*det*(3.84615384615385*K[4]*K[6] + 5.76923076923077*K[3]*K[7]);
+    G[27] = 9.61538461538461*K[3]*K[4]*W1*det;
+    G[28] = W1*det*(3.84615384615385*K[0]*K[4] + 5.76923076923077*K[1]*K[3]);
+    G[29] = W1*det*(3.84615384615385*K[5]*K[6] + 5.76923076923077*K[3]*K[8]);
+    G[30] = W1*det*(13.4615384615385*K[0]*K[0] + 3.84615384615385*(K[1]*K[1] + K[2]*K[2]));
+    G[31] = W1*det*(3.84615384615385*K[1]*K[6] + 5.76923076923077*K[0]*K[7]);
+    G[32] = W1*det*(3.84615384615385*K[1]*K[3] + 5.76923076923077*K[0]*K[4]);
+    G[33] = 9.61538461538461*K[0]*K[1]*W1*det;
+    G[34] = W1*det*(3.84615384615385*K[2]*K[6] + 5.76923076923077*K[0]*K[8]);
+    G[35] = W1*det*(13.4615384615385*K[7]*K[7] + 3.84615384615385*(K[6]*K[6] + K[8]*K[8]));
+    G[36] = W1*det*(13.4615384615385*K[4]*K[7] + 3.84615384615385*(K[3]*K[6] + K[5]*K[8]));
+    G[37] = W1*det*(13.4615384615385*K[1]*K[7] + 3.84615384615385*(K[0]*K[6] + K[2]*K[8]));
+    G[38] = 9.61538461538461*K[7]*K[8]*W1*det;
+    G[39] = W1*det*(13.4615384615385*K[4]*K[4] + 3.84615384615385*(K[3]*K[3] + K[5]*K[5]));
+    G[40] = W1*det*(13.4615384615385*K[1]*K[4] + 3.84615384615385*(K[0]*K[3] + K[2]*K[5]));
+    G[41] = W1*det*(3.84615384615385*K[5]*K[7] + 5.76923076923077*K[4]*K[8]);
+    G[42] = W1*det*(13.4615384615385*K[1]*K[1] + 3.84615384615385*(K[0]*K[0] + K[2]*K[2]));
+    G[43] = W1*det*(3.84615384615385*K[2]*K[7] + 5.76923076923077*K[1]*K[8]);
+    G[44] = W1*det*(13.4615384615385*K[8]*K[8] + 3.84615384615385*(K[6]*K[6] + K[7]*K[7]));
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 972
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Number of operations for primary indices: 972
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[0];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[9];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[10];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[11];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[12];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[13];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[14];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[15];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[16];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[10];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[17];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[18];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[19];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[20];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[21];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[22];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[23];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[11];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[18];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[24];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[25];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[26];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[27];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[28];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[29];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[12];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[19];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[25];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[30];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[31];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[32];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[33];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[34];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[13];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[20];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[26];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[31];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[35];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[36];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[37];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[38];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[14];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[21];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[27];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[32];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[36];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[39];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[40];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[41];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[15];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[22];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[28];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[33];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[37];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[40];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[42];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[43];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[16];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[23];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[29];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[34];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[38];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[41];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[43];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[44];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elasticity3d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  elasticity3d_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity3d_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "f3ac8c8261535dc44afaf87bd454cefa3cf1b9a9cc2aa252d4e383a25b88800477455a28ad694dfa1f1d8e9c54c5f43c2f973f075540088848aacccf38582cf4";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity3d_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity3d_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity3d_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity3d_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elasticity3d_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Elasticity3D
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity3d_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity3d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity3d_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/assembly/cpp/forms/Elasticity3D.ufl b/bench/fem/assembly/cpp/forms/Elasticity3D.ufl
new file mode 100644
index 0000000..da51224
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/Elasticity3D.ufl
@@ -0,0 +1,18 @@
+element = VectorElement("Lagrange", tetrahedron, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+E  = 10.0
+nu = 0.3
+
+mu    = E / (2*(1 + nu))
+lmbda = E*nu / ((1 + nu)*(1 - 2*nu))
+
+def epsilon(v):
+    return 0.5*(grad(v) + (grad(v)).T)
+
+def sigma(v):
+    return 2*mu*epsilon(v) + lmbda*tr(epsilon(v))*Identity(len(v))
+
+a = inner(grad(v), sigma(u))*dx
diff --git a/bench/fem/assembly/cpp/forms/NSEMomentum3D.h b/bench/fem/assembly/cpp/forms/NSEMomentum3D.h
new file mode 100644
index 0000000..987d7bb
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/NSEMomentum3D.h
@@ -0,0 +1,7643 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __NSEMOMENTUM3D_H
+#define __NSEMOMENTUM3D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class nsemomentum3d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Compute subdeterminants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+    vertex_values[3] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new nsemomentum3d_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class nsemomentum3d_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Compute subdeterminants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[1] = vals[1];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[2] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[0];
+    vertex_values[6] = dof_values[0];
+    vertex_values[9] = dof_values[0];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[1];
+    vertex_values[4] = dof_values[1];
+    vertex_values[7] = dof_values[1];
+    vertex_values[10] = dof_values[1];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[2];
+    vertex_values[5] = dof_values[2];
+    vertex_values[8] = dof_values[2];
+    vertex_values[11] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nsemomentum3d_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new nsemomentum3d_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new nsemomentum3d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new nsemomentum3d_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class nsemomentum3d_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new nsemomentum3d_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class nsemomentum3d_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 9:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[10] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[11] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[4];
+    vertex_values[4] = dof_values[5];
+    vertex_values[7] = dof_values[6];
+    vertex_values[10] = dof_values[7];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[8];
+    vertex_values[5] = dof_values[9];
+    vertex_values[8] = dof_values[10];
+    vertex_values[11] = dof_values[11];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nsemomentum3d_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new nsemomentum3d_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new nsemomentum3d_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new nsemomentum3d_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class nsemomentum3d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[3];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[3][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new nsemomentum3d_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class nsemomentum3d_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[3];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[1] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[2] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[1][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[1][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[1][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[2][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[2][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[2][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nsemomentum3d_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new nsemomentum3d_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new nsemomentum3d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new nsemomentum3d_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class nsemomentum3d_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new nsemomentum3d_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class nsemomentum3d_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[0][0];
+    dofs[5] = offset + c.entity_indices[0][1];
+    dofs[6] = offset + c.entity_indices[0][2];
+    dofs[7] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[8] = offset + c.entity_indices[0][0];
+    dofs[9] = offset + c.entity_indices[0][1];
+    dofs[10] = offset + c.entity_indices[0][2];
+    dofs[11] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 9;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 11;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 10;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 4;
+        dofs[2] = 8;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 5;
+        dofs[2] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 6;
+        dofs[2] = 10;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 7;
+        dofs[2] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = vertex_coordinates[0];
+    dof_coordinates[4][1] = vertex_coordinates[1];
+    dof_coordinates[4][2] = vertex_coordinates[2];
+    dof_coordinates[5][0] = vertex_coordinates[3];
+    dof_coordinates[5][1] = vertex_coordinates[4];
+    dof_coordinates[5][2] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[6];
+    dof_coordinates[6][1] = vertex_coordinates[7];
+    dof_coordinates[6][2] = vertex_coordinates[8];
+    dof_coordinates[7][0] = vertex_coordinates[9];
+    dof_coordinates[7][1] = vertex_coordinates[10];
+    dof_coordinates[7][2] = vertex_coordinates[11];
+    dof_coordinates[8][0] = vertex_coordinates[0];
+    dof_coordinates[8][1] = vertex_coordinates[1];
+    dof_coordinates[8][2] = vertex_coordinates[2];
+    dof_coordinates[9][0] = vertex_coordinates[3];
+    dof_coordinates[9][1] = vertex_coordinates[4];
+    dof_coordinates[9][2] = vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[6];
+    dof_coordinates[10][1] = vertex_coordinates[7];
+    dof_coordinates[10][2] = vertex_coordinates[8];
+    dof_coordinates[11][0] = vertex_coordinates[9];
+    dof_coordinates[11][1] = vertex_coordinates[10];
+    dof_coordinates[11][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nsemomentum3d_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new nsemomentum3d_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new nsemomentum3d_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new nsemomentum3d_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class nsemomentum3d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W4[4] = {0.0416666666666667, 0.0416666666666667, 0.0416666666666667, 0.0416666666666667};
+    // Quadrature points on the UFC reference element: (0.585410196624969, 0.138196601125011, 0.138196601125011), (0.138196601125011, 0.585410196624969, 0.138196601125011), (0.138196601125011, 0.138196601125011, 0.585410196624969), (0.138196601125011, 0.138196601125011, 0.138196601125011)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE2_C0[4][4] = \
+    {{0.138196601125009, 0.585410196624969, 0.138196601125011, 0.138196601125011},
+    {0.138196601125009, 0.138196601125011, 0.585410196624969, 0.138196601125011},
+    {0.138196601125009, 0.138196601125011, 0.138196601125011, 0.585410196624969},
+    {0.585410196624967, 0.138196601125011, 0.138196601125011, 0.138196601125011}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[4] = {4, 5, 6, 7};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[4] = {0, 1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[4] = {8, 9, 10, 11};
+    
+    static const double FE2_C0_D001[4][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[2] = {4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[2] = {8, 9};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {0, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[2] = {8, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[2] = {8, 10};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[2] = {4, 7};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[2] = {4, 6};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 144; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 864.
+    double G[72];
+    G[0] = 0.5*det*w[3][0]*(K[1]*K[1]*w[2][0] + w[0][1]*w[0][1]*w[1][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]) + w[4][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[1] = 0.5*det*w[3][0]*(K[1]*K[8]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[2] = 0.5*det*w[3][0]*(K[1]*K[5]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[3] = 0.5*det*w[3][0]*(K[1]*K[2]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[4] = 0.5*det*w[3][0]*(K[1]*K[6]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[5] = 0.5*det*w[3][0]*(K[1]*K[3]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[6] = 0.5*det*w[3][0]*(K[0]*K[1]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[7] = 0.5*det*w[3][0]*(K[1]*K[7]*w[2][0] + w[0][1]*w[0][1]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]) + w[4][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[8] = 0.5*det*w[3][0]*(K[1]*K[4]*w[2][0] + w[0][1]*w[0][1]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]) + w[4][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[9] = 0.5*det*w[3][0]*(K[8]*K[8]*w[2][0] + w[0][2]*w[0][2]*w[1][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]) + w[4][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[10] = 0.5*det*w[3][0]*(K[5]*K[8]*w[2][0] + w[0][2]*w[0][2]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]) + w[4][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[11] = 0.5*det*w[3][0]*(K[2]*K[8]*w[2][0] + w[0][2]*w[0][2]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]) + w[4][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[12] = 0.5*det*w[3][0]*(K[6]*K[8]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[13] = 0.5*det*w[3][0]*(K[3]*K[8]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[14] = 0.5*det*w[3][0]*(K[0]*K[8]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[15] = 0.5*det*w[3][0]*(K[7]*K[8]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[16] = 0.5*det*w[3][0]*(K[4]*K[8]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[17] = 0.5*det*w[3][0]*(K[5]*K[5]*w[2][0] + w[0][2]*w[0][2]*w[1][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]) + w[4][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[18] = 0.5*det*w[3][0]*(K[2]*K[5]*w[2][0] + w[0][2]*w[0][2]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]) + w[4][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[19] = 0.5*det*w[3][0]*(K[5]*K[6]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[20] = 0.5*det*w[3][0]*(K[3]*K[5]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[21] = 0.5*det*w[3][0]*(K[0]*K[5]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[22] = 0.5*det*w[3][0]*(K[5]*K[7]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[23] = 0.5*det*w[3][0]*(K[4]*K[5]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[24] = 0.5*det*w[3][0]*(K[2]*K[2]*w[2][0] + w[0][2]*w[0][2]*w[1][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]) + w[4][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[25] = 0.5*det*w[3][0]*(K[2]*K[6]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[26] = 0.5*det*w[3][0]*(K[2]*K[3]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[27] = 0.5*det*w[3][0]*(K[0]*K[2]*w[2][0] + w[0][0]*w[0][2]*w[1][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[28] = 0.5*det*w[3][0]*(K[2]*K[7]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[29] = 0.5*det*w[3][0]*(K[2]*K[4]*w[2][0] + w[0][1]*w[0][2]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[30] = 0.5*det*w[3][0]*(K[6]*K[6]*w[2][0] + w[0][0]*w[0][0]*w[1][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]) + w[4][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[31] = 0.5*det*w[3][0]*(K[3]*K[6]*w[2][0] + w[0][0]*w[0][0]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]) + w[4][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[32] = 0.5*det*w[3][0]*(K[0]*K[6]*w[2][0] + w[0][0]*w[0][0]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]) + w[4][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[33] = 0.5*det*w[3][0]*(K[6]*K[7]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[34] = 0.5*det*w[3][0]*(K[4]*K[6]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[35] = 0.5*det*w[3][0]*(K[3]*K[3]*w[2][0] + w[0][0]*w[0][0]*w[1][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]) + w[4][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[36] = 0.5*det*w[3][0]*(K[0]*K[3]*w[2][0] + w[0][0]*w[0][0]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]) + w[4][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[37] = 0.5*det*w[3][0]*(K[3]*K[7]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[38] = 0.5*det*w[3][0]*(K[3]*K[4]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[39] = 0.5*det*w[3][0]*(K[0]*K[0]*w[2][0] + w[0][0]*w[0][0]*w[1][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]) + w[4][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[40] = 0.5*det*w[3][0]*(K[0]*K[7]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[41] = 0.5*det*w[3][0]*(K[0]*K[4]*w[2][0] + w[0][0]*w[0][1]*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[42] = 0.5*det*w[3][0]*(K[7]*K[7]*w[2][0] + w[0][1]*w[0][1]*w[1][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]) + w[4][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[43] = 0.5*det*w[3][0]*(K[4]*K[7]*w[2][0] + w[0][1]*w[0][1]*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]) + w[4][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[44] = 0.5*det*w[3][0]*(K[4]*K[4]*w[2][0] + w[0][1]*w[0][1]*w[1][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]) + w[4][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[45] = 0.5*K[2]*det*w[0][1]*w[3][0];
+    G[46] = 0.5*K[8]*det*w[0][2]*w[3][0];
+    G[47] = 0.5*K[5]*det*w[0][2]*w[3][0];
+    G[48] = 0.5*K[2]*det*w[0][2]*w[3][0];
+    G[49] = 0.5*K[8]*det*w[0][0]*w[3][0];
+    G[50] = 0.5*K[5]*det*w[0][0]*w[3][0];
+    G[51] = 0.5*K[2]*det*w[0][0]*w[3][0];
+    G[52] = 0.5*K[8]*det*w[0][1]*w[3][0];
+    G[53] = 0.5*K[5]*det*w[0][1]*w[3][0];
+    G[54] = 0.5*K[0]*det*w[0][1]*w[3][0];
+    G[55] = 0.5*K[6]*det*w[0][2]*w[3][0];
+    G[56] = 0.5*K[3]*det*w[0][2]*w[3][0];
+    G[57] = 0.5*K[0]*det*w[0][2]*w[3][0];
+    G[58] = 0.5*K[6]*det*w[0][0]*w[3][0];
+    G[59] = 0.5*K[3]*det*w[0][0]*w[3][0];
+    G[60] = 0.5*K[0]*det*w[0][0]*w[3][0];
+    G[61] = 0.5*K[6]*det*w[0][1]*w[3][0];
+    G[62] = 0.5*K[3]*det*w[0][1]*w[3][0];
+    G[63] = 0.5*K[1]*det*w[0][1]*w[3][0];
+    G[64] = 0.5*K[7]*det*w[0][2]*w[3][0];
+    G[65] = 0.5*K[4]*det*w[0][2]*w[3][0];
+    G[66] = 0.5*K[1]*det*w[0][2]*w[3][0];
+    G[67] = 0.5*K[7]*det*w[0][0]*w[3][0];
+    G[68] = 0.5*K[4]*det*w[0][0]*w[3][0];
+    G[69] = 0.5*K[1]*det*w[0][0]*w[3][0];
+    G[70] = 0.5*K[7]*det*w[0][1]*w[3][0];
+    G[71] = 0.5*K[4]*det*w[0][1]*w[3][0];
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 7348
+    for (unsigned int ip = 0; ip < 4; ip++)
+    {
+      
+      // Number of operations to compute ip constants: 73
+      double I[73];
+      // Number of operations: 1
+      I[0] = G[0]*W4[ip];
+      
+      // Number of operations: 1
+      I[1] = G[1]*W4[ip];
+      
+      // Number of operations: 1
+      I[2] = G[2]*W4[ip];
+      
+      // Number of operations: 1
+      I[3] = G[3]*W4[ip];
+      
+      // Number of operations: 1
+      I[4] = G[4]*W4[ip];
+      
+      // Number of operations: 1
+      I[5] = G[5]*W4[ip];
+      
+      // Number of operations: 1
+      I[6] = G[6]*W4[ip];
+      
+      // Number of operations: 1
+      I[7] = G[7]*W4[ip];
+      
+      // Number of operations: 1
+      I[8] = G[8]*W4[ip];
+      
+      // Number of operations: 1
+      I[9] = G[9]*W4[ip];
+      
+      // Number of operations: 1
+      I[10] = G[10]*W4[ip];
+      
+      // Number of operations: 1
+      I[11] = G[11]*W4[ip];
+      
+      // Number of operations: 1
+      I[12] = G[12]*W4[ip];
+      
+      // Number of operations: 1
+      I[13] = G[13]*W4[ip];
+      
+      // Number of operations: 1
+      I[14] = G[14]*W4[ip];
+      
+      // Number of operations: 1
+      I[15] = G[15]*W4[ip];
+      
+      // Number of operations: 1
+      I[16] = G[16]*W4[ip];
+      
+      // Number of operations: 1
+      I[17] = G[17]*W4[ip];
+      
+      // Number of operations: 1
+      I[18] = G[18]*W4[ip];
+      
+      // Number of operations: 1
+      I[19] = G[19]*W4[ip];
+      
+      // Number of operations: 1
+      I[20] = G[20]*W4[ip];
+      
+      // Number of operations: 1
+      I[21] = G[21]*W4[ip];
+      
+      // Number of operations: 1
+      I[22] = G[22]*W4[ip];
+      
+      // Number of operations: 1
+      I[23] = G[23]*W4[ip];
+      
+      // Number of operations: 1
+      I[24] = G[24]*W4[ip];
+      
+      // Number of operations: 1
+      I[25] = G[25]*W4[ip];
+      
+      // Number of operations: 1
+      I[26] = G[26]*W4[ip];
+      
+      // Number of operations: 1
+      I[27] = G[27]*W4[ip];
+      
+      // Number of operations: 1
+      I[28] = G[28]*W4[ip];
+      
+      // Number of operations: 1
+      I[29] = G[29]*W4[ip];
+      
+      // Number of operations: 1
+      I[30] = G[30]*W4[ip];
+      
+      // Number of operations: 1
+      I[31] = G[31]*W4[ip];
+      
+      // Number of operations: 1
+      I[32] = G[32]*W4[ip];
+      
+      // Number of operations: 1
+      I[33] = G[33]*W4[ip];
+      
+      // Number of operations: 1
+      I[34] = G[34]*W4[ip];
+      
+      // Number of operations: 1
+      I[35] = G[35]*W4[ip];
+      
+      // Number of operations: 1
+      I[36] = G[36]*W4[ip];
+      
+      // Number of operations: 1
+      I[37] = G[37]*W4[ip];
+      
+      // Number of operations: 1
+      I[38] = G[38]*W4[ip];
+      
+      // Number of operations: 1
+      I[39] = G[39]*W4[ip];
+      
+      // Number of operations: 1
+      I[40] = G[40]*W4[ip];
+      
+      // Number of operations: 1
+      I[41] = G[41]*W4[ip];
+      
+      // Number of operations: 1
+      I[42] = G[42]*W4[ip];
+      
+      // Number of operations: 1
+      I[43] = G[43]*W4[ip];
+      
+      // Number of operations: 1
+      I[44] = G[44]*W4[ip];
+      
+      // Number of operations: 1
+      I[45] = G[45]*W4[ip];
+      
+      // Number of operations: 1
+      I[46] = G[46]*W4[ip];
+      
+      // Number of operations: 1
+      I[47] = G[47]*W4[ip];
+      
+      // Number of operations: 1
+      I[48] = G[48]*W4[ip];
+      
+      // Number of operations: 1
+      I[49] = G[49]*W4[ip];
+      
+      // Number of operations: 1
+      I[50] = G[50]*W4[ip];
+      
+      // Number of operations: 1
+      I[51] = G[51]*W4[ip];
+      
+      // Number of operations: 1
+      I[52] = G[52]*W4[ip];
+      
+      // Number of operations: 1
+      I[53] = G[53]*W4[ip];
+      
+      // Number of operations: 1
+      I[54] = G[54]*W4[ip];
+      
+      // Number of operations: 1
+      I[55] = G[55]*W4[ip];
+      
+      // Number of operations: 1
+      I[56] = G[56]*W4[ip];
+      
+      // Number of operations: 1
+      I[57] = G[57]*W4[ip];
+      
+      // Number of operations: 1
+      I[58] = G[58]*W4[ip];
+      
+      // Number of operations: 1
+      I[59] = G[59]*W4[ip];
+      
+      // Number of operations: 1
+      I[60] = G[60]*W4[ip];
+      
+      // Number of operations: 1
+      I[61] = G[61]*W4[ip];
+      
+      // Number of operations: 1
+      I[62] = G[62]*W4[ip];
+      
+      // Number of operations: 1
+      I[63] = G[63]*W4[ip];
+      
+      // Number of operations: 1
+      I[64] = G[64]*W4[ip];
+      
+      // Number of operations: 1
+      I[65] = G[65]*W4[ip];
+      
+      // Number of operations: 1
+      I[66] = G[66]*W4[ip];
+      
+      // Number of operations: 1
+      I[67] = G[67]*W4[ip];
+      
+      // Number of operations: 1
+      I[68] = G[68]*W4[ip];
+      
+      // Number of operations: 1
+      I[69] = G[69]*W4[ip];
+      
+      // Number of operations: 1
+      I[70] = G[70]*W4[ip];
+      
+      // Number of operations: 1
+      I[71] = G[71]*W4[ip];
+      
+      // Number of operations: 1
+      I[72] = W4[ip]*det;
+      
+      
+      // Number of operations for primary indices: 648
+      for (unsigned int j = 0; j < 4; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc10[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[45];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc12[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[46];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc13[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[47];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc14[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[48];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc4[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[49];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc5[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[50];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc6[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[51];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc8[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[52];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc9[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[53];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc10[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[54];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc12[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[55];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc13[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[56];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc14[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[57];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc4[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[58];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc5[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[59];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc6[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[60];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc8[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[61];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc9[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[62];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc10[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[63];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc12[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[64];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc13[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[65];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc14[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[66];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc4[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[67];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc5[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[68];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc6[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[69];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc8[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[70];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc9[k]] += FE2_C0[ip][j]*FE2_C0_D001[ip][k]*I[71];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 972
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[0];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[5];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[6];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[7];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[8];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[9];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[10];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[11];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[12];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[13];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[14];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[15];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[16];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[10];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[17];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[18];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[19];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[20];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[21];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[22];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[23];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[11];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[18];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[24];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[25];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[26];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[27];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[28];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[29];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[12];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[19];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[25];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[30];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[31];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[32];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[33];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[34];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[5];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[13];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[20];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[26];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[31];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[35];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[36];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[37];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[38];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[6];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[14];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[21];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[27];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[32];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[36];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[39];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[40];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[41];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[7];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[15];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[22];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[28];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[33];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[37];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[40];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[42];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[43];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc10[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[8];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc12[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[16];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc13[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[23];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc14[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[29];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc4[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[34];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc5[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[38];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc6[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[41];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc8[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[43];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc9[k]] += FE2_C0_D001[ip][j]*FE2_C0_D001[ip][k]*I[44];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 144
+      for (unsigned int j = 0; j < 4; j++)
+      {
+        for (unsigned int k = 0; k < 4; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc11[k]] += FE2_C0[ip][j]*FE2_C0[ip][k]*I[72];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc3[k]] += FE2_C0[ip][j]*FE2_C0[ip][k]*I[72];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc7[k]] += FE2_C0[ip][j]*FE2_C0[ip][k]*I[72];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class nsemomentum3d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  nsemomentum3d_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nsemomentum3d_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d69a102d1ec0bb17129f2bd5fb6684b8b84a3a7486c502489c5b578db04594cdd8d0373c3e186f73647c987ec6172f8f003acb0107e3be6f570f7635ee72840e";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 5;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nsemomentum3d_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new nsemomentum3d_finite_element_3();
+        break;
+      }
+    case 2:
+      {
+        return new nsemomentum3d_finite_element_1();
+        break;
+      }
+    case 3:
+      {
+        return new nsemomentum3d_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new nsemomentum3d_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new nsemomentum3d_finite_element_0();
+        break;
+      }
+    case 6:
+      {
+        return new nsemomentum3d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nsemomentum3d_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new nsemomentum3d_dofmap_3();
+        break;
+      }
+    case 2:
+      {
+        return new nsemomentum3d_dofmap_1();
+        break;
+      }
+    case 3:
+      {
+        return new nsemomentum3d_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new nsemomentum3d_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new nsemomentum3d_dofmap_0();
+        break;
+      }
+    case 6:
+      {
+        return new nsemomentum3d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new nsemomentum3d_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace NSEMomentum3D
+{
+
+class CoefficientSpace_d1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_d1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_d1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_d1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_d1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_d1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_d1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_d1()
+  {
+  }
+
+};
+
+class CoefficientSpace_d2: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_d2(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_d2(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_d2(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_d2(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_d2(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_d2(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_d2()
+  {
+  }
+
+};
+
+class CoefficientSpace_k: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_k(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_k()
+  {
+  }
+
+};
+
+class CoefficientSpace_nu: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_nu(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_nu(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_nu(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_nu()
+  {
+  }
+
+};
+
+class CoefficientSpace_w: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_w(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_w(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_w(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_w()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nsemomentum3d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nsemomentum3d_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_w Form_a_FunctionSpace_2;
+
+typedef CoefficientSpace_d1 Form_a_FunctionSpace_3;
+
+typedef CoefficientSpace_d2 Form_a_FunctionSpace_4;
+
+typedef CoefficientSpace_k Form_a_FunctionSpace_5;
+
+typedef CoefficientSpace_nu Form_a_FunctionSpace_6;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nsemomentum3d_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& d1, const dolfin::GenericFunction& d2, const dolfin::GenericFunction& k, const dolfin::GenericFunction& nu):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->w = w;
+    this->d1 = d1;
+    this->d2 = d2;
+    this->k = k;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nsemomentum3d_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> d1, std::shared_ptr<const dolfin::GenericFunction> d2, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->w = *w;
+    this->d1 = *d1;
+    this->d2 = *d2;
+    this->k = *k;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nsemomentum3d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nsemomentum3d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& d1, const dolfin::GenericFunction& d2, const dolfin::GenericFunction& k, const dolfin::GenericFunction& nu):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->w = w;
+    this->d1 = d1;
+    this->d2 = d2;
+    this->k = k;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nsemomentum3d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> d1, std::shared_ptr<const dolfin::GenericFunction> d2, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->w = *w;
+    this->d1 = *d1;
+    this->d2 = *d2;
+    this->k = *k;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nsemomentum3d_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+    else if (name == "d1")
+      return 1;
+    else if (name == "d2")
+      return 2;
+    else if (name == "k")
+      return 3;
+    else if (name == "nu")
+      return 4;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    case 1:
+      return "d1";
+    case 2:
+      return "d2";
+    case 3:
+      return "k";
+    case 4:
+      return "nu";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_w;
+  typedef Form_a_FunctionSpace_3 CoefficientSpace_d1;
+  typedef Form_a_FunctionSpace_4 CoefficientSpace_d2;
+  typedef Form_a_FunctionSpace_5 CoefficientSpace_k;
+  typedef Form_a_FunctionSpace_6 CoefficientSpace_nu;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+  dolfin::CoefficientAssigner d1;
+  dolfin::CoefficientAssigner d2;
+  dolfin::CoefficientAssigner k;
+  dolfin::CoefficientAssigner nu;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/assembly/cpp/forms/NSEMomentum3D.ufl b/bench/fem/assembly/cpp/forms/NSEMomentum3D.ufl
new file mode 100644
index 0000000..772cdf3
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/NSEMomentum3D.ufl
@@ -0,0 +1,18 @@
+element = VectorElement("Lagrange", tetrahedron, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+constant_scalar = FiniteElement("Discontinuous Lagrange", tetrahedron, 0)
+constant_vector = VectorElement("Discontinuous Lagrange", tetrahedron, 0)
+
+w  = Coefficient(constant_vector)
+d1 = Coefficient(constant_scalar)
+d2 = Coefficient(constant_scalar)
+k  = Coefficient(constant_scalar)
+nu = Coefficient(constant_scalar)
+
+G_a  = inner(v, u)*dx + 0.5*k*nu*inner(grad(v), grad(u))*dx + 0.5*k*inner(v, dot(w, grad(u)))*dx
+SD_a = d1*0.5*k*dot(dot(w, grad(v)), dot(w, grad(u)))*dx + d2*0.5*k*div(v)*div(u)*dx
+
+a = G_a + SD_a
diff --git a/bench/fem/assembly/cpp/forms/Poisson2DP1.h b/bench/fem/assembly/cpp/forms/Poisson2DP1.h
new file mode 100644
index 0000000..d19cb8e
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/Poisson2DP1.h
@@ -0,0 +1,1682 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON2DP1_H
+#define __POISSON2DP1_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2dp1_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2dp1_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp1_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson2dp1_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2dp1_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2dp1_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp1_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson2dp1_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2dp1_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2dp1_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp1_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2dp1_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2dp1_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp1_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2dp1_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2dp1_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2dp1_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2dp1_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson2dp1_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2DP1
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2dp1_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2dp1_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/assembly/cpp/forms/Poisson2DP1.ufl b/bench/fem/assembly/cpp/forms/Poisson2DP1.ufl
new file mode 100644
index 0000000..cac2a7a
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/Poisson2DP1.ufl
@@ -0,0 +1,6 @@
+element = FiniteElement("Lagrange", triangle, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+a = dot(grad(v), grad(u))*dx
diff --git a/bench/fem/assembly/cpp/forms/Poisson2DP2.h b/bench/fem/assembly/cpp/forms/Poisson2DP2.h
new file mode 100644
index 0000000..3920a69
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/Poisson2DP2.h
@@ -0,0 +1,2428 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON2DP2_H
+#define __POISSON2DP2_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2dp2_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2dp2_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp2_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson2dp2_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2dp2_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2dp2_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp2_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson2dp2_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2dp2_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2dp2_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp2_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 49
+    // Total number of operations (multiply-add pairs):                  60
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_1_0;
+    A[2] = 0.166666666666667*G0_0_1 + 0.166666666666667*G0_1_1;
+    A[3] = 0.0;
+    A[4] = -0.666666666666667*G0_0_1 - 0.666666666666667*G0_1_1;
+    A[5] = -0.666666666666667*G0_0_0 - 0.666666666666667*G0_1_0;
+    A[6] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1;
+    A[7] = 0.5*G0_0_0;
+    A[8] = -0.166666666666667*G0_0_1;
+    A[9] = 0.666666666666666*G0_0_1;
+    A[10] = 0.0;
+    A[11] = -0.666666666666667*G0_0_0 - 0.666666666666666*G0_0_1;
+    A[12] = 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1;
+    A[13] = -0.166666666666667*G0_1_0;
+    A[14] = 0.5*G0_1_1;
+    A[15] = 0.666666666666666*G0_1_0;
+    A[16] = -0.666666666666666*G0_1_0 - 0.666666666666666*G0_1_1;
+    A[17] = 0.0;
+    A[18] = 0.0;
+    A[19] = 0.666666666666666*G0_1_0;
+    A[20] = 0.666666666666666*G0_0_1;
+    A[21] = 1.33333333333333*G0_0_0 + 0.666666666666665*G0_0_1 + 0.666666666666665*G0_1_0 + 1.33333333333333*G0_1_1;
+    A[22] = -1.33333333333333*G0_0_0 - 0.666666666666666*G0_0_1 - 0.666666666666665*G0_1_0;
+    A[23] = -0.666666666666665*G0_0_1 - 0.666666666666667*G0_1_0 - 1.33333333333333*G0_1_1;
+    A[24] = -0.666666666666667*G0_1_0 - 0.666666666666667*G0_1_1;
+    A[25] = 0.0;
+    A[26] = -0.666666666666666*G0_0_1 - 0.666666666666666*G0_1_1;
+    A[27] = -1.33333333333333*G0_0_0 - 0.666666666666665*G0_0_1 - 0.666666666666666*G0_1_0;
+    A[28] = 1.33333333333333*G0_0_0 + 0.666666666666666*G0_0_1 + 0.666666666666666*G0_1_0 + 1.33333333333333*G0_1_1;
+    A[29] = 0.666666666666665*G0_0_1 + 0.666666666666667*G0_1_0;
+    A[30] = -0.666666666666667*G0_0_0 - 0.666666666666667*G0_0_1;
+    A[31] = -0.666666666666667*G0_0_0 - 0.666666666666666*G0_1_0;
+    A[32] = 0.0;
+    A[33] = -0.666666666666667*G0_0_1 - 0.666666666666665*G0_1_0 - 1.33333333333333*G0_1_1;
+    A[34] = 0.666666666666667*G0_0_1 + 0.666666666666665*G0_1_0;
+    A[35] = 1.33333333333333*G0_0_0 + 0.666666666666667*G0_0_1 + 0.666666666666667*G0_1_0 + 1.33333333333333*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2dp2_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2dp2_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp2_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "aae0a73595ace2836ec2cfac776b19ebe6bc264a8954a0a93986ca1a90118d4671958a14ba9141ef0d8adc0b7311a7d128634bedabdb1f15360fafef8ee30294";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2dp2_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2dp2_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2dp2_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2dp2_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson2dp2_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2DP2
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2dp2_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2dp2_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/assembly/cpp/forms/Poisson2DP2.ufl b/bench/fem/assembly/cpp/forms/Poisson2DP2.ufl
new file mode 100644
index 0000000..62120d5
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/Poisson2DP2.ufl
@@ -0,0 +1,6 @@
+element = FiniteElement("Lagrange", triangle, 2)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+a = dot(grad(v), grad(u))*dx
diff --git a/bench/fem/assembly/cpp/forms/Poisson2DP3.h b/bench/fem/assembly/cpp/forms/Poisson2DP3.h
new file mode 100644
index 0000000..fbaf047
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/Poisson2DP3.h
@@ -0,0 +1,3632 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON2DP3_H
+#define __POISSON2DP3_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2dp3_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2dp3_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp3_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson2dp3_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2dp3_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2dp3_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp3_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + 2*num_global_entities[1] + num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson2dp3_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2dp3_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2dp3_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp3_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 205
+    // Total number of operations (multiply-add pairs):                  216
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.424999999999999*G0_0_0 + 0.424999999999999*G0_0_1 + 0.424999999999999*G0_1_0 + 0.424999999999999*G0_1_1;
+    A[1] = -0.0875000000000006*G0_0_0 - 0.0875000000000005*G0_1_0;
+    A[2] = -0.0875000000000005*G0_0_1 - 0.0875000000000006*G0_1_1;
+    A[3] = -0.0375000000000006*G0_0_0 - 0.0375000000000018*G0_0_1 - 0.0375000000000006*G0_1_0 - 0.0375000000000017*G0_1_1;
+    A[4] = -0.0375000000000017*G0_0_0 - 0.0375000000000007*G0_0_1 - 0.0375000000000017*G0_1_0 - 0.0375000000000007*G0_1_1;
+    A[5] = 0.0374999999999997*G0_0_0 - 0.674999999999998*G0_0_1 + 0.0374999999999996*G0_1_0 - 0.674999999999998*G0_1_1;
+    A[6] = 0.0375000000000017*G0_0_0 + 0.3375*G0_0_1 + 0.0375000000000017*G0_1_0 + 0.3375*G0_1_1;
+    A[7] = -0.674999999999998*G0_0_0 + 0.0374999999999994*G0_0_1 - 0.674999999999998*G0_1_0 + 0.0374999999999994*G0_1_1;
+    A[8] = 0.3375*G0_0_0 + 0.037500000000002*G0_0_1 + 0.3375*G0_1_0 + 0.0375000000000018*G0_1_1;
+    A[9] = 0.0;
+    A[10] = -0.0875000000000006*G0_0_0 - 0.0875000000000005*G0_0_1;
+    A[11] = 0.425000000000002*G0_0_0;
+    A[12] = 0.0874999999999996*G0_0_1;
+    A[13] = 0.0375000000000018*G0_0_0 + 0.712500000000003*G0_0_1;
+    A[14] = 0.0374999999999996*G0_0_0 - 0.3*G0_0_1;
+    A[15] = -0.0375000000000001*G0_0_0;
+    A[16] = -0.0374999999999996*G0_0_0;
+    A[17] = 0.337500000000003*G0_0_0 + 0.300000000000003*G0_0_1;
+    A[18] = -0.675000000000004*G0_0_0 - 0.712500000000003*G0_0_1;
+    A[19] = 0.0;
+    A[20] = -0.0875000000000005*G0_1_0 - 0.0875000000000006*G0_1_1;
+    A[21] = 0.0874999999999996*G0_1_0;
+    A[22] = 0.425000000000002*G0_1_1;
+    A[23] = -0.3*G0_1_0 + 0.0374999999999994*G0_1_1;
+    A[24] = 0.712500000000004*G0_1_0 + 0.0375000000000025*G0_1_1;
+    A[25] = 0.300000000000003*G0_1_0 + 0.337500000000003*G0_1_1;
+    A[26] = -0.712500000000004*G0_1_0 - 0.675000000000005*G0_1_1;
+    A[27] = -0.0374999999999996*G0_1_1;
+    A[28] = -0.0374999999999994*G0_1_1;
+    A[29] = 0.0;
+    A[30] = -0.0375000000000006*G0_0_0 - 0.0375000000000006*G0_0_1 - 0.0375000000000018*G0_1_0 - 0.0375000000000017*G0_1_1;
+    A[31] = 0.0375000000000018*G0_0_0 + 0.712500000000003*G0_1_0;
+    A[32] = -0.3*G0_0_1 + 0.0374999999999994*G0_1_1;
+    A[33] = 1.6875*G0_0_0 + 0.843750000000001*G0_0_1 + 0.843750000000001*G0_1_0 + 1.6875*G0_1_1;
+    A[34] = -0.3375*G0_0_0 + 0.843749999999998*G0_0_1 - 0.168750000000001*G0_1_0 - 0.3375*G0_1_1;
+    A[35] = 0.337500000000001*G0_0_0 + 0.16875*G0_0_1 + 0.16875*G0_1_0;
+    A[36] = 0.3375*G0_0_0 + 0.168750000000001*G0_0_1 + 0.168750000000001*G0_1_0;
+    A[37] = 0.168750000000004*G0_0_1 + 0.168750000000007*G0_1_0 + 0.337500000000006*G0_1_1;
+    A[38] = -0.843750000000002*G0_0_1 - 0.843750000000008*G0_1_0 - 1.68750000000001*G0_1_1;
+    A[39] = -2.025*G0_0_0 - 1.0125*G0_0_1 - 1.0125*G0_1_0;
+    A[40] = -0.0375000000000017*G0_0_0 - 0.0375000000000017*G0_0_1 - 0.0375000000000007*G0_1_0 - 0.0375000000000007*G0_1_1;
+    A[41] = 0.0374999999999996*G0_0_0 - 0.3*G0_1_0;
+    A[42] = 0.712500000000004*G0_0_1 + 0.0375000000000024*G0_1_1;
+    A[43] = -0.3375*G0_0_0 - 0.168750000000001*G0_0_1 + 0.843749999999998*G0_1_0 - 0.3375*G0_1_1;
+    A[44] = 1.68750000000001*G0_0_0 + 0.843750000000003*G0_0_1 + 0.843750000000003*G0_1_0 + 1.6875*G0_1_1;
+    A[45] = 0.337500000000007*G0_0_0 + 0.168750000000007*G0_0_1 + 0.168750000000005*G0_1_0;
+    A[46] = -1.68750000000001*G0_0_0 - 0.84375000000001*G0_0_1 - 0.843750000000004*G0_1_0;
+    A[47] = 0.168750000000001*G0_0_1 + 0.168750000000001*G0_1_0 + 0.337500000000002*G0_1_1;
+    A[48] = 0.168750000000001*G0_0_1 + 0.168749999999999*G0_1_0 + 0.337500000000001*G0_1_1;
+    A[49] = -1.0125*G0_0_1 - 1.0125*G0_1_0 - 2.025*G0_1_1;
+    A[50] = 0.0374999999999997*G0_0_0 + 0.0374999999999996*G0_0_1 - 0.674999999999998*G0_1_0 - 0.674999999999998*G0_1_1;
+    A[51] = -0.0375000000000001*G0_0_0;
+    A[52] = 0.300000000000003*G0_0_1 + 0.337500000000003*G0_1_1;
+    A[53] = 0.337500000000001*G0_0_0 + 0.16875*G0_0_1 + 0.16875*G0_1_0;
+    A[54] = 0.337500000000007*G0_0_0 + 0.168750000000004*G0_0_1 + 0.168750000000007*G0_1_0;
+    A[55] = 1.6875*G0_0_0 + 0.843750000000003*G0_0_1 + 0.843750000000003*G0_1_0 + 1.6875*G0_1_1;
+    A[56] = -0.337500000000007*G0_0_0 - 1.18125000000001*G0_0_1 - 0.168750000000007*G0_1_0 - 1.35*G0_1_1;
+    A[57] = 0.84375*G0_0_1 + 0.843749999999995*G0_1_0;
+    A[58] = -0.16875*G0_0_1 - 0.168749999999997*G0_1_0;
+    A[59] = -2.025*G0_0_0 - 1.0125*G0_0_1 - 1.0125*G0_1_0;
+    A[60] = 0.0375000000000017*G0_0_0 + 0.0375000000000017*G0_0_1 + 0.3375*G0_1_0 + 0.3375*G0_1_1;
+    A[61] = -0.0374999999999996*G0_0_0;
+    A[62] = -0.712500000000004*G0_0_1 - 0.675000000000005*G0_1_1;
+    A[63] = 0.3375*G0_0_0 + 0.168750000000001*G0_0_1 + 0.168750000000001*G0_1_0;
+    A[64] = -1.68750000000001*G0_0_0 - 0.843750000000004*G0_0_1 - 0.84375000000001*G0_1_0;
+    A[65] = -0.337500000000007*G0_0_0 - 0.168750000000007*G0_0_1 - 1.18125000000001*G0_1_0 - 1.35*G0_1_1;
+    A[66] = 1.68750000000001*G0_0_0 + 0.84375000000001*G0_0_1 + 0.843750000000011*G0_1_0 + 1.68750000000001*G0_1_1;
+    A[67] = -0.168750000000001*G0_0_1 - 0.168749999999997*G0_1_0;
+    A[68] = -0.168750000000001*G0_0_1 - 0.168750000000004*G0_1_0;
+    A[69] = 1.01250000000001*G0_0_1 + 1.01250000000001*G0_1_0;
+    A[70] = -0.674999999999998*G0_0_0 - 0.674999999999998*G0_0_1 + 0.0374999999999994*G0_1_0 + 0.0374999999999994*G0_1_1;
+    A[71] = 0.337500000000003*G0_0_0 + 0.300000000000003*G0_1_0;
+    A[72] = -0.0374999999999996*G0_1_1;
+    A[73] = 0.168750000000007*G0_0_1 + 0.168750000000004*G0_1_0 + 0.337500000000006*G0_1_1;
+    A[74] = 0.168750000000001*G0_0_1 + 0.168750000000001*G0_1_0 + 0.337500000000002*G0_1_1;
+    A[75] = 0.843749999999995*G0_0_1 + 0.84375*G0_1_0;
+    A[76] = -0.168749999999997*G0_0_1 - 0.168750000000001*G0_1_0;
+    A[77] = 1.6875*G0_0_0 + 0.843750000000002*G0_0_1 + 0.843750000000002*G0_1_0 + 1.6875*G0_1_1;
+    A[78] = -1.35*G0_0_0 - 0.168750000000007*G0_0_1 - 1.18125000000001*G0_1_0 - 0.337500000000006*G0_1_1;
+    A[79] = -1.0125*G0_0_1 - 1.0125*G0_1_0 - 2.025*G0_1_1;
+    A[80] = 0.3375*G0_0_0 + 0.3375*G0_0_1 + 0.037500000000002*G0_1_0 + 0.0375000000000018*G0_1_1;
+    A[81] = -0.675000000000004*G0_0_0 - 0.712500000000003*G0_1_0;
+    A[82] = -0.0374999999999994*G0_1_1;
+    A[83] = -0.843750000000008*G0_0_1 - 0.843750000000002*G0_1_0 - 1.68750000000001*G0_1_1;
+    A[84] = 0.168749999999999*G0_0_1 + 0.168750000000001*G0_1_0 + 0.337500000000001*G0_1_1;
+    A[85] = -0.168749999999997*G0_0_1 - 0.16875*G0_1_0;
+    A[86] = -0.168750000000004*G0_0_1 - 0.168750000000001*G0_1_0;
+    A[87] = -1.35*G0_0_0 - 1.18125*G0_0_1 - 0.168750000000007*G0_1_0 - 0.337500000000006*G0_1_1;
+    A[88] = 1.68750000000001*G0_0_0 + 0.843750000000009*G0_0_1 + 0.843750000000009*G0_1_0 + 1.68750000000001*G0_1_1;
+    A[89] = 1.01250000000001*G0_0_1 + 1.0125*G0_1_0;
+    A[90] = 0.0;
+    A[91] = 0.0;
+    A[92] = 0.0;
+    A[93] = -2.025*G0_0_0 - 1.0125*G0_0_1 - 1.0125*G0_1_0;
+    A[94] = -1.0125*G0_0_1 - 1.0125*G0_1_0 - 2.025*G0_1_1;
+    A[95] = -2.025*G0_0_0 - 1.0125*G0_0_1 - 1.0125*G0_1_0;
+    A[96] = 1.01250000000001*G0_0_1 + 1.01250000000001*G0_1_0;
+    A[97] = -1.0125*G0_0_1 - 1.0125*G0_1_0 - 2.025*G0_1_1;
+    A[98] = 1.0125*G0_0_1 + 1.01250000000001*G0_1_0;
+    A[99] = 4.05*G0_0_0 + 2.025*G0_0_1 + 2.025*G0_1_0 + 4.05000000000001*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2dp3_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2dp3_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2dp3_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "f9b8ce71238cbeed8abadbc4741d92fef64810352ec67cfe46516d0c7bebacf074a0af32740986f745e0a7c5e2014ad386a492e81c6e7ac63b8b3e2e1bd6577d";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2dp3_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2dp3_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2dp3_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2dp3_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson2dp3_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2DP3
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2dp3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2dp3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2dp3_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2dp3_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/assembly/cpp/forms/Poisson2DP3.ufl b/bench/fem/assembly/cpp/forms/Poisson2DP3.ufl
new file mode 100644
index 0000000..b1a90c7
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/Poisson2DP3.ufl
@@ -0,0 +1,6 @@
+element = FiniteElement("Lagrange", triangle, 3)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+a = dot(grad(v), grad(u))*dx
diff --git a/bench/fem/assembly/cpp/forms/StabStokes2D.h b/bench/fem/assembly/cpp/forms/StabStokes2D.h
new file mode 100644
index 0000000..4249298
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/StabStokes2D.h
@@ -0,0 +1,5995 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __STABSTOKES2D_H
+#define __STABSTOKES2D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class stabstokes2d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stabstokes2d_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stabstokes2d_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stabstokes2d_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stabstokes2d_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[3] = dof_values[4];
+    vertex_values[5] = dof_values[5];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stabstokes2d_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new stabstokes2d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stabstokes2d_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stabstokes2d_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stabstokes2d_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stabstokes2d_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stabstokes2d_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stabstokes2d_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 7;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 7; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[1][1] = \
+      {{0.0}};
+      
+      static const double dmats1[1][1] = \
+      {{0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[1][1] = \
+      {{1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[1][1] = \
+      {{1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 1; t++)
+        {
+          for (unsigned int u = 0; u < 1; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              for (unsigned int tu = 0; tu < 1; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              for (unsigned int tu = 0; tu < 1; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 7; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[6];
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 7; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[4] = dof_values[4];
+    vertex_values[7] = dof_values[5];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[6];
+    vertex_values[5] = dof_values[6];
+    vertex_values[8] = dof_values[6];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stabstokes2d_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new stabstokes2d_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stabstokes2d_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stabstokes2d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stabstokes2d_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stabstokes2d_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stabstokes2d_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stabstokes2d_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stabstokes2d_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new stabstokes2d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stabstokes2d_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stabstokes2d_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stabstokes2d_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[2][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stabstokes2d_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stabstokes2d_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stabstokes2d_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 7;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[6] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 6;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stabstokes2d_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new stabstokes2d_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stabstokes2d_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stabstokes2d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stabstokes2d_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.5;
+    // Quadrature points on the UFC reference element: (0.333333333333333, 0.333333333333333)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0_D01[1][2] = \
+    {{-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[2] = {3, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[2] = {3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[2] = {0, 1};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 49; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 31.
+    double G[11];
+    G[0] =  - K[3]*W1*det;
+    G[1] =  - K[1]*W1*det;
+    G[2] =  - K[2]*W1*det;
+    G[3] =  - K[0]*W1*det;
+    G[4] = W1*det*(K[2]*K[2] + K[3]*K[3]);
+    G[5] = W1*det*(K[0]*K[2] + K[1]*K[3]);
+    G[6] = W1*det*(K[0]*K[0] + K[1]*K[1]);
+    G[7] = K[3]*W1*det;
+    G[8] = K[1]*W1*det;
+    G[9] = K[2]*W1*det;
+    G[10] = K[0]*W1*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 128
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Number of operations for primary indices: 96
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*7 + nzc10[k]] += FE1_C0_D01[0][j]*FE1_C0_D01[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*7 + nzc11[k]] += FE1_C0_D01[0][j]*FE1_C0_D01[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*7 + nzc10[k]] += FE1_C0_D01[0][j]*FE1_C0_D01[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*7 + nzc11[k]] += FE1_C0_D01[0][j]*FE1_C0_D01[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*7 + nzc7[k]] += FE1_C0_D01[0][j]*FE1_C0_D01[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*7 + nzc8[k]] += FE1_C0_D01[0][j]*FE1_C0_D01[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*7 + nzc7[k]] += FE1_C0_D01[0][j]*FE1_C0_D01[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*7 + nzc8[k]] += FE1_C0_D01[0][j]*FE1_C0_D01[0][k]*G[6];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 16
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc10[j]*7 + 6] += FE1_C0_D01[0][j]*G[0];
+        // Number of operations to compute entry: 2
+        A[nzc11[j]*7 + 6] += FE1_C0_D01[0][j]*G[1];
+        // Number of operations to compute entry: 2
+        A[nzc7[j]*7 + 6] += FE1_C0_D01[0][j]*G[2];
+        // Number of operations to compute entry: 2
+        A[nzc8[j]*7 + 6] += FE1_C0_D01[0][j]*G[3];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 16
+      for (unsigned int k = 0; k < 2; k++)
+      {
+        // Number of operations to compute entry: 2
+        A[6*7 + nzc10[k]] += FE1_C0_D01[0][k]*G[7];
+        // Number of operations to compute entry: 2
+        A[6*7 + nzc11[k]] += FE1_C0_D01[0][k]*G[8];
+        // Number of operations to compute entry: 2
+        A[6*7 + nzc7[k]] += FE1_C0_D01[0][k]*G[9];
+        // Number of operations to compute entry: 2
+        A[6*7 + nzc8[k]] += FE1_C0_D01[0][k]*G[10];
+      } // end loop over 'k'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stabstokes2d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  stabstokes2d_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stabstokes2d_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "845832555f178bd62e52af471b533420104fdec29b776b5fa528b306ca849ccc8075d74864cbe6ed1ba78590cdf26b764d0b5872412fe2bc489715473f3e3248";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stabstokes2d_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new stabstokes2d_finite_element_3();
+        break;
+      }
+    case 2:
+      {
+        return new stabstokes2d_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stabstokes2d_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new stabstokes2d_dofmap_3();
+        break;
+      }
+    case 2:
+      {
+        return new stabstokes2d_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stabstokes2d_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace StabStokes2D
+{
+
+class CoefficientSpace_h: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_h(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_h(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_h(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_h(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_h(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_h(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_h()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stabstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stabstokes2d_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_h Form_a_FunctionSpace_2;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), h(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stabstokes2d_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& h):
+    dolfin::Form(2, 1), h(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->h = h;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stabstokes2d_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> h):
+    dolfin::Form(2, 1), h(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->h = *h;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stabstokes2d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), h(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stabstokes2d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& h):
+    dolfin::Form(2, 1), h(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->h = h;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stabstokes2d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> h):
+    dolfin::Form(2, 1), h(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->h = *h;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stabstokes2d_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "h")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "h";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_h;
+
+  // Coefficients
+  dolfin::CoefficientAssigner h;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/assembly/cpp/forms/StabStokes2D.ufl b/bench/fem/assembly/cpp/forms/StabStokes2D.ufl
new file mode 100644
index 0000000..8975a7d
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/StabStokes2D.ufl
@@ -0,0 +1,11 @@
+vector  = VectorElement("Lagrange", triangle, 1)
+scalar  = FiniteElement("Discontinuous Lagrange", triangle, 0)
+element = vector * scalar
+
+(v, q) = TestFunctions(element)
+(u, p) = TrialFunctions(element)
+
+h = Coefficient(scalar)
+delta = 0.2*h*h
+
+a = (inner(grad(v), grad(u)) - div(v)*p + q*div(u) + delta*inner(grad(q), grad(p)))*dx
diff --git a/bench/fem/assembly/cpp/forms/THStokes2D.h b/bench/fem/assembly/cpp/forms/THStokes2D.h
new file mode 100644
index 0000000..fa6ed68
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/THStokes2D.h
@@ -0,0 +1,10562 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __THSTOKES2D_H
+#define __THSTOKES2D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class thstokes2d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  thstokes2d_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new thstokes2d_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class thstokes2d_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  thstokes2d_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new thstokes2d_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new thstokes2d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new thstokes2d_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class thstokes2d_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  thstokes2d_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new thstokes2d_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class thstokes2d_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  thstokes2d_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[12];
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 13:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 14:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[12] = vals[2];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[13] = vals[2];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[4] = dof_values[7];
+    vertex_values[7] = dof_values[8];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[12];
+    vertex_values[5] = dof_values[13];
+    vertex_values[8] = dof_values[14];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new thstokes2d_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new thstokes2d_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new thstokes2d_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class thstokes2d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  thstokes2d_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new thstokes2d_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class thstokes2d_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  thstokes2d_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new thstokes2d_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new thstokes2d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new thstokes2d_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class thstokes2d_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  thstokes2d_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new thstokes2d_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class thstokes2d_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  thstokes2d_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 8;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[12] = offset + c.entity_indices[0][0];
+    dofs[13] = offset + c.entity_indices[0][1];
+    dofs[14] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+      dofs[6] = 13;
+      dofs[7] = 14;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+      dofs[6] = 12;
+      dofs[7] = 14;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+      dofs[6] = 12;
+      dofs[7] = 13;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+        dofs[2] = 12;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+        dofs[2] = 13;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+        dofs[2] = 14;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[12][0] = vertex_coordinates[0];
+    dof_coordinates[12][1] = vertex_coordinates[1];
+    dof_coordinates[13][0] = vertex_coordinates[2];
+    dof_coordinates[13][1] = vertex_coordinates[3];
+    dof_coordinates[14][0] = vertex_coordinates[4];
+    dof_coordinates[14][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new thstokes2d_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new thstokes2d_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new thstokes2d_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class thstokes2d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  thstokes2d_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    32
+    // Number of operations (multiply-add pairs) for tensor contraction: 282
+    // Total number of operations (multiply-add pairs):                  317
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*K[0]*(1.0);
+    const double G0_1 = det*K[2]*(1.0);
+    const double G1_0 = det*K[1]*(1.0);
+    const double G1_1 = det*K[3]*(1.0);
+    const double G2_0 = det*K[0]*(1.0);
+    const double G2_1 = det*K[2]*(1.0);
+    const double G3_0 = det*K[1]*(1.0);
+    const double G3_1 = det*K[3]*(1.0);
+    const double G4_0_0 = det*K[0]*K[0]*(1.0);
+    const double G4_0_1 = det*K[0]*K[2]*(1.0);
+    const double G4_1_0 = det*K[2]*K[0]*(1.0);
+    const double G4_1_1 = det*K[2]*K[2]*(1.0);
+    const double G5_0_0 = det*K[0]*K[0]*(1.0);
+    const double G5_0_1 = det*K[0]*K[2]*(1.0);
+    const double G5_1_0 = det*K[2]*K[0]*(1.0);
+    const double G5_1_1 = det*K[2]*K[2]*(1.0);
+    const double G6_0_0 = det*K[1]*K[1]*(1.0);
+    const double G6_0_1 = det*K[1]*K[3]*(1.0);
+    const double G6_1_0 = det*K[3]*K[1]*(1.0);
+    const double G6_1_1 = det*K[3]*K[3]*(1.0);
+    const double G7_0_0 = det*K[1]*K[1]*(1.0);
+    const double G7_0_1 = det*K[1]*K[3]*(1.0);
+    const double G7_1_0 = det*K[3]*K[1]*(1.0);
+    const double G7_1_1 = det*K[3]*K[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.5*G4_0_0 + 0.5*G4_0_1 + 0.5*G4_1_0 + 0.5*G4_1_1 + 0.5*G6_0_0 + 0.5*G6_0_1 + 0.5*G6_1_0 + 0.5*G6_1_1;
+    A[1] = 0.166666666666667*G4_0_0 + 0.166666666666667*G4_1_0 + 0.166666666666667*G6_0_0 + 0.166666666666667*G6_1_0;
+    A[2] = 0.166666666666666*G4_0_1 + 0.166666666666666*G4_1_1 + 0.166666666666666*G6_0_1 + 0.166666666666666*G6_1_1;
+    A[3] = 0.0;
+    A[4] = -0.666666666666666*G4_0_1 - 0.666666666666666*G4_1_1 - 0.666666666666666*G6_0_1 - 0.666666666666666*G6_1_1;
+    A[5] = -0.666666666666666*G4_0_0 - 0.666666666666666*G4_1_0 - 0.666666666666666*G6_0_0 - 0.666666666666666*G6_1_0;
+    A[6] = 0.0;
+    A[7] = 0.0;
+    A[8] = 0.0;
+    A[9] = 0.0;
+    A[10] = 0.0;
+    A[11] = 0.0;
+    A[12] = 0.166666666666666*G2_0 + 0.166666666666666*G2_1;
+    A[13] = 0.0;
+    A[14] = 0.0;
+    A[15] = 0.166666666666667*G4_0_0 + 0.166666666666667*G4_0_1 + 0.166666666666667*G6_0_0 + 0.166666666666667*G6_0_1;
+    A[16] = 0.5*G4_0_0 + 0.5*G6_0_0;
+    A[17] = -0.166666666666666*G4_0_1 - 0.166666666666666*G6_0_1;
+    A[18] = 0.666666666666666*G4_0_1 + 0.666666666666666*G6_0_1;
+    A[19] = 0.0;
+    A[20] = -0.666666666666666*G4_0_0 - 0.666666666666666*G4_0_1 - 0.666666666666666*G6_0_0 - 0.666666666666666*G6_0_1;
+    A[21] = 0.0;
+    A[22] = 0.0;
+    A[23] = 0.0;
+    A[24] = 0.0;
+    A[25] = 0.0;
+    A[26] = 0.0;
+    A[27] = 0.0;
+    A[28] = -0.166666666666667*G2_0;
+    A[29] = 0.0;
+    A[30] = 0.166666666666666*G4_1_0 + 0.166666666666666*G4_1_1 + 0.166666666666666*G6_1_0 + 0.166666666666666*G6_1_1;
+    A[31] = -0.166666666666666*G4_1_0 - 0.166666666666666*G6_1_0;
+    A[32] = 0.5*G4_1_1 + 0.5*G6_1_1;
+    A[33] = 0.666666666666666*G4_1_0 + 0.666666666666666*G6_1_0;
+    A[34] = -0.666666666666666*G4_1_0 - 0.666666666666666*G4_1_1 - 0.666666666666666*G6_1_0 - 0.666666666666666*G6_1_1;
+    A[35] = 0.0;
+    A[36] = 0.0;
+    A[37] = 0.0;
+    A[38] = 0.0;
+    A[39] = 0.0;
+    A[40] = 0.0;
+    A[41] = 0.0;
+    A[42] = 0.0;
+    A[43] = 0.0;
+    A[44] = -0.166666666666666*G2_1;
+    A[45] = 0.0;
+    A[46] = 0.666666666666666*G4_1_0 + 0.666666666666666*G6_1_0;
+    A[47] = 0.666666666666666*G4_0_1 + 0.666666666666666*G6_0_1;
+    A[48] = 1.33333333333333*G4_0_0 + 0.666666666666665*G4_0_1 + 0.666666666666665*G4_1_0 + 1.33333333333333*G4_1_1 + 1.33333333333333*G6_0_0 + 0.666666666666665*G6_0_1 + 0.666666666666665*G6_1_0 + 1.33333333333333*G6_1_1;
+    A[49] = -1.33333333333333*G4_0_0 - 0.666666666666666*G4_0_1 - 0.666666666666665*G4_1_0 - 1.33333333333333*G6_0_0 - 0.666666666666666*G6_0_1 - 0.666666666666665*G6_1_0;
+    A[50] = -0.666666666666666*G4_0_1 - 0.666666666666666*G4_1_0 - 1.33333333333333*G4_1_1 - 0.666666666666666*G6_0_1 - 0.666666666666666*G6_1_0 - 1.33333333333333*G6_1_1;
+    A[51] = 0.0;
+    A[52] = 0.0;
+    A[53] = 0.0;
+    A[54] = 0.0;
+    A[55] = 0.0;
+    A[56] = 0.0;
+    A[57] = -0.166666666666667*G2_0 - 0.166666666666667*G2_1;
+    A[58] = -0.166666666666667*G2_0 - 0.333333333333333*G2_1;
+    A[59] = -0.333333333333333*G2_0 - 0.166666666666667*G2_1;
+    A[60] = -0.666666666666666*G4_1_0 - 0.666666666666666*G4_1_1 - 0.666666666666666*G6_1_0 - 0.666666666666666*G6_1_1;
+    A[61] = 0.0;
+    A[62] = -0.666666666666666*G4_0_1 - 0.666666666666666*G4_1_1 - 0.666666666666666*G6_0_1 - 0.666666666666666*G6_1_1;
+    A[63] = -1.33333333333333*G4_0_0 - 0.666666666666665*G4_0_1 - 0.666666666666666*G4_1_0 - 1.33333333333333*G6_0_0 - 0.666666666666665*G6_0_1 - 0.666666666666666*G6_1_0;
+    A[64] = 1.33333333333333*G4_0_0 + 0.666666666666666*G4_0_1 + 0.666666666666666*G4_1_0 + 1.33333333333333*G4_1_1 + 1.33333333333333*G6_0_0 + 0.666666666666666*G6_0_1 + 0.666666666666666*G6_1_0 + 1.33333333333333*G6_1_1;
+    A[65] = 0.666666666666666*G4_0_1 + 0.666666666666666*G4_1_0 + 0.666666666666666*G6_0_1 + 0.666666666666666*G6_1_0;
+    A[66] = 0.0;
+    A[67] = 0.0;
+    A[68] = 0.0;
+    A[69] = 0.0;
+    A[70] = 0.0;
+    A[71] = 0.0;
+    A[72] = 0.166666666666667*G2_0 - 0.166666666666666*G2_1;
+    A[73] = 0.166666666666667*G2_0;
+    A[74] = 0.333333333333333*G2_0 + 0.166666666666666*G2_1;
+    A[75] = -0.666666666666666*G4_0_0 - 0.666666666666666*G4_0_1 - 0.666666666666666*G6_0_0 - 0.666666666666666*G6_0_1;
+    A[76] = -0.666666666666666*G4_0_0 - 0.666666666666666*G4_1_0 - 0.666666666666666*G6_0_0 - 0.666666666666666*G6_1_0;
+    A[77] = 0.0;
+    A[78] = -0.666666666666666*G4_0_1 - 0.666666666666666*G4_1_0 - 1.33333333333333*G4_1_1 - 0.666666666666666*G6_0_1 - 0.666666666666666*G6_1_0 - 1.33333333333333*G6_1_1;
+    A[79] = 0.666666666666666*G4_0_1 + 0.666666666666666*G4_1_0 + 0.666666666666666*G6_0_1 + 0.666666666666666*G6_1_0;
+    A[80] = 1.33333333333333*G4_0_0 + 0.666666666666667*G4_0_1 + 0.666666666666667*G4_1_0 + 1.33333333333333*G4_1_1 + 1.33333333333333*G6_0_0 + 0.666666666666667*G6_0_1 + 0.666666666666667*G6_1_0 + 1.33333333333333*G6_1_1;
+    A[81] = 0.0;
+    A[82] = 0.0;
+    A[83] = 0.0;
+    A[84] = 0.0;
+    A[85] = 0.0;
+    A[86] = 0.0;
+    A[87] = -0.166666666666666*G2_0 + 0.166666666666667*G2_1;
+    A[88] = 0.166666666666667*G2_0 + 0.333333333333333*G2_1;
+    A[89] = 0.166666666666667*G2_1;
+    A[90] = 0.0;
+    A[91] = 0.0;
+    A[92] = 0.0;
+    A[93] = 0.0;
+    A[94] = 0.0;
+    A[95] = 0.0;
+    A[96] = 0.5*G5_0_0 + 0.5*G5_0_1 + 0.5*G5_1_0 + 0.5*G5_1_1 + 0.5*G7_0_0 + 0.5*G7_0_1 + 0.5*G7_1_0 + 0.5*G7_1_1;
+    A[97] = 0.166666666666667*G5_0_0 + 0.166666666666667*G5_1_0 + 0.166666666666667*G7_0_0 + 0.166666666666667*G7_1_0;
+    A[98] = 0.166666666666666*G5_0_1 + 0.166666666666666*G5_1_1 + 0.166666666666666*G7_0_1 + 0.166666666666666*G7_1_1;
+    A[99] = 0.0;
+    A[100] = -0.666666666666666*G5_0_1 - 0.666666666666666*G5_1_1 - 0.666666666666666*G7_0_1 - 0.666666666666666*G7_1_1;
+    A[101] = -0.666666666666666*G5_0_0 - 0.666666666666666*G5_1_0 - 0.666666666666666*G7_0_0 - 0.666666666666666*G7_1_0;
+    A[102] = 0.166666666666666*G3_0 + 0.166666666666666*G3_1;
+    A[103] = 0.0;
+    A[104] = 0.0;
+    A[105] = 0.0;
+    A[106] = 0.0;
+    A[107] = 0.0;
+    A[108] = 0.0;
+    A[109] = 0.0;
+    A[110] = 0.0;
+    A[111] = 0.166666666666667*G5_0_0 + 0.166666666666667*G5_0_1 + 0.166666666666667*G7_0_0 + 0.166666666666667*G7_0_1;
+    A[112] = 0.5*G5_0_0 + 0.5*G7_0_0;
+    A[113] = -0.166666666666666*G5_0_1 - 0.166666666666666*G7_0_1;
+    A[114] = 0.666666666666666*G5_0_1 + 0.666666666666666*G7_0_1;
+    A[115] = 0.0;
+    A[116] = -0.666666666666666*G5_0_0 - 0.666666666666666*G5_0_1 - 0.666666666666666*G7_0_0 - 0.666666666666666*G7_0_1;
+    A[117] = 0.0;
+    A[118] = -0.166666666666667*G3_0;
+    A[119] = 0.0;
+    A[120] = 0.0;
+    A[121] = 0.0;
+    A[122] = 0.0;
+    A[123] = 0.0;
+    A[124] = 0.0;
+    A[125] = 0.0;
+    A[126] = 0.166666666666666*G5_1_0 + 0.166666666666666*G5_1_1 + 0.166666666666666*G7_1_0 + 0.166666666666666*G7_1_1;
+    A[127] = -0.166666666666666*G5_1_0 - 0.166666666666666*G7_1_0;
+    A[128] = 0.5*G5_1_1 + 0.5*G7_1_1;
+    A[129] = 0.666666666666666*G5_1_0 + 0.666666666666666*G7_1_0;
+    A[130] = -0.666666666666666*G5_1_0 - 0.666666666666666*G5_1_1 - 0.666666666666666*G7_1_0 - 0.666666666666666*G7_1_1;
+    A[131] = 0.0;
+    A[132] = 0.0;
+    A[133] = 0.0;
+    A[134] = -0.166666666666666*G3_1;
+    A[135] = 0.0;
+    A[136] = 0.0;
+    A[137] = 0.0;
+    A[138] = 0.0;
+    A[139] = 0.0;
+    A[140] = 0.0;
+    A[141] = 0.0;
+    A[142] = 0.666666666666666*G5_1_0 + 0.666666666666666*G7_1_0;
+    A[143] = 0.666666666666666*G5_0_1 + 0.666666666666666*G7_0_1;
+    A[144] = 1.33333333333333*G5_0_0 + 0.666666666666665*G5_0_1 + 0.666666666666665*G5_1_0 + 1.33333333333333*G5_1_1 + 1.33333333333333*G7_0_0 + 0.666666666666665*G7_0_1 + 0.666666666666665*G7_1_0 + 1.33333333333333*G7_1_1;
+    A[145] = -1.33333333333333*G5_0_0 - 0.666666666666666*G5_0_1 - 0.666666666666665*G5_1_0 - 1.33333333333333*G7_0_0 - 0.666666666666666*G7_0_1 - 0.666666666666665*G7_1_0;
+    A[146] = -0.666666666666666*G5_0_1 - 0.666666666666666*G5_1_0 - 1.33333333333333*G5_1_1 - 0.666666666666666*G7_0_1 - 0.666666666666666*G7_1_0 - 1.33333333333333*G7_1_1;
+    A[147] = -0.166666666666667*G3_0 - 0.166666666666667*G3_1;
+    A[148] = -0.166666666666667*G3_0 - 0.333333333333333*G3_1;
+    A[149] = -0.333333333333333*G3_0 - 0.166666666666667*G3_1;
+    A[150] = 0.0;
+    A[151] = 0.0;
+    A[152] = 0.0;
+    A[153] = 0.0;
+    A[154] = 0.0;
+    A[155] = 0.0;
+    A[156] = -0.666666666666666*G5_1_0 - 0.666666666666666*G5_1_1 - 0.666666666666666*G7_1_0 - 0.666666666666666*G7_1_1;
+    A[157] = 0.0;
+    A[158] = -0.666666666666666*G5_0_1 - 0.666666666666666*G5_1_1 - 0.666666666666666*G7_0_1 - 0.666666666666666*G7_1_1;
+    A[159] = -1.33333333333333*G5_0_0 - 0.666666666666665*G5_0_1 - 0.666666666666666*G5_1_0 - 1.33333333333333*G7_0_0 - 0.666666666666665*G7_0_1 - 0.666666666666666*G7_1_0;
+    A[160] = 1.33333333333333*G5_0_0 + 0.666666666666666*G5_0_1 + 0.666666666666666*G5_1_0 + 1.33333333333333*G5_1_1 + 1.33333333333333*G7_0_0 + 0.666666666666666*G7_0_1 + 0.666666666666666*G7_1_0 + 1.33333333333333*G7_1_1;
+    A[161] = 0.666666666666666*G5_0_1 + 0.666666666666666*G5_1_0 + 0.666666666666666*G7_0_1 + 0.666666666666666*G7_1_0;
+    A[162] = 0.166666666666667*G3_0 - 0.166666666666666*G3_1;
+    A[163] = 0.166666666666667*G3_0;
+    A[164] = 0.333333333333333*G3_0 + 0.166666666666666*G3_1;
+    A[165] = 0.0;
+    A[166] = 0.0;
+    A[167] = 0.0;
+    A[168] = 0.0;
+    A[169] = 0.0;
+    A[170] = 0.0;
+    A[171] = -0.666666666666666*G5_0_0 - 0.666666666666666*G5_0_1 - 0.666666666666666*G7_0_0 - 0.666666666666666*G7_0_1;
+    A[172] = -0.666666666666666*G5_0_0 - 0.666666666666666*G5_1_0 - 0.666666666666666*G7_0_0 - 0.666666666666666*G7_1_0;
+    A[173] = 0.0;
+    A[174] = -0.666666666666666*G5_0_1 - 0.666666666666666*G5_1_0 - 1.33333333333333*G5_1_1 - 0.666666666666666*G7_0_1 - 0.666666666666666*G7_1_0 - 1.33333333333333*G7_1_1;
+    A[175] = 0.666666666666666*G5_0_1 + 0.666666666666666*G5_1_0 + 0.666666666666666*G7_0_1 + 0.666666666666666*G7_1_0;
+    A[176] = 1.33333333333333*G5_0_0 + 0.666666666666667*G5_0_1 + 0.666666666666667*G5_1_0 + 1.33333333333333*G5_1_1 + 1.33333333333333*G7_0_0 + 0.666666666666667*G7_0_1 + 0.666666666666667*G7_1_0 + 1.33333333333333*G7_1_1;
+    A[177] = -0.166666666666666*G3_0 + 0.166666666666667*G3_1;
+    A[178] = 0.166666666666667*G3_0 + 0.333333333333333*G3_1;
+    A[179] = 0.166666666666667*G3_1;
+    A[180] = -0.166666666666666*G0_0 - 0.166666666666666*G0_1;
+    A[181] = 0.0;
+    A[182] = 0.0;
+    A[183] = 0.166666666666667*G0_0 + 0.166666666666667*G0_1;
+    A[184] = -0.166666666666667*G0_0 + 0.166666666666666*G0_1;
+    A[185] = 0.166666666666666*G0_0 - 0.166666666666667*G0_1;
+    A[186] = -0.166666666666666*G1_0 - 0.166666666666666*G1_1;
+    A[187] = 0.0;
+    A[188] = 0.0;
+    A[189] = 0.166666666666667*G1_0 + 0.166666666666667*G1_1;
+    A[190] = -0.166666666666667*G1_0 + 0.166666666666666*G1_1;
+    A[191] = 0.166666666666666*G1_0 - 0.166666666666667*G1_1;
+    A[192] = 0.0;
+    A[193] = 0.0;
+    A[194] = 0.0;
+    A[195] = 0.0;
+    A[196] = 0.166666666666667*G0_0;
+    A[197] = 0.0;
+    A[198] = 0.166666666666667*G0_0 + 0.333333333333333*G0_1;
+    A[199] = -0.166666666666667*G0_0;
+    A[200] = -0.166666666666667*G0_0 - 0.333333333333333*G0_1;
+    A[201] = 0.0;
+    A[202] = 0.166666666666667*G1_0;
+    A[203] = 0.0;
+    A[204] = 0.166666666666667*G1_0 + 0.333333333333333*G1_1;
+    A[205] = -0.166666666666667*G1_0;
+    A[206] = -0.166666666666667*G1_0 - 0.333333333333333*G1_1;
+    A[207] = 0.0;
+    A[208] = 0.0;
+    A[209] = 0.0;
+    A[210] = 0.0;
+    A[211] = 0.0;
+    A[212] = 0.166666666666666*G0_1;
+    A[213] = 0.333333333333333*G0_0 + 0.166666666666667*G0_1;
+    A[214] = -0.333333333333333*G0_0 - 0.166666666666666*G0_1;
+    A[215] = -0.166666666666667*G0_1;
+    A[216] = 0.0;
+    A[217] = 0.0;
+    A[218] = 0.166666666666666*G1_1;
+    A[219] = 0.333333333333333*G1_0 + 0.166666666666667*G1_1;
+    A[220] = -0.333333333333333*G1_0 - 0.166666666666666*G1_1;
+    A[221] = -0.166666666666667*G1_1;
+    A[222] = 0.0;
+    A[223] = 0.0;
+    A[224] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class thstokes2d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  thstokes2d_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~thstokes2d_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "c9e96217bdf0b022e1a9d4f90d63fa9416a1eee23b1a54c975139f2f6b9c7cdd37541ea9b58f1cb326bf42f666b50c6dd5e092cd12a6ee87d8ae82cf4a165465";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new thstokes2d_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new thstokes2d_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new thstokes2d_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new thstokes2d_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new thstokes2d_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace THStokes2D
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new thstokes2d_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new thstokes2d_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new thstokes2d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new thstokes2d_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/assembly/cpp/forms/THStokes2D.ufl b/bench/fem/assembly/cpp/forms/THStokes2D.ufl
new file mode 100644
index 0000000..15b8df3
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/THStokes2D.ufl
@@ -0,0 +1,8 @@
+vector  = VectorElement("Lagrange", triangle, 2)
+scalar  = FiniteElement("Lagrange", triangle, 1)
+element = vector * scalar
+
+(v, q) = TestFunctions(element)
+(u, p) = TrialFunctions(element)
+
+a = (inner(grad(v), grad(u)) - div(v)*p + q*div(u))*dx
diff --git a/bench/fem/assembly/cpp/forms/compile.log b/bench/fem/assembly/cpp/forms/compile.log
new file mode 100644
index 0000000..3d9dc37
--- /dev/null
+++ b/bench/fem/assembly/cpp/forms/compile.log
@@ -0,0 +1,3904 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2DP1
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0164669 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.0008 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00652909 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000216007 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0437171 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000373125 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2DP1.h.
+  
+Compiler stage 5 finished in 0.00056386 seconds.
+
+FFC finished in 0.0681932 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Elasticity3D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Vector<3 x CG1(?)>'
+  Unique sub elements:    'Vector<3 x CG1(?)>, CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Identity.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0137739 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 2 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 2 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 1, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 0, 0): array([[[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]]]), (0, 0, 1): array([[[ -1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.11022302e-16],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [ -1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.11022302e-16],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [ -1.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.11022302e-16]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.00000000e+00]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]])}
+  
+  tables: {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C2_D001': 'FE0_C2_D001', 'FE0_C1_D001': 'FE0_C1_D001', 'FE0_C1_D010': 'FE0_C1_D010', 'FE0_C2_D010': 'FE0_C2_D010', 'FE0_C1_D100': 'FE0_C1_D100', 'FE0_C0_D100': 'FE0_C0_D100', 'FE0_C0_D010': 'FE0_C0_D010', 'FE0_C0_D001': 'FE0_C0_D001', 'FE0_C2_D100': 'FE0_C2_D100', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D001': array([[-1.,  1.]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C2_D001': ('FE0_C0_D001', (9, [8, 11]), False, False), 'FE0_C1_D001': ('FE0_C0_D001', (5, [4, 7]), False, False), 'FE0_C1_D010': ('FE0_C0_D001', (6, [4, 6]), False, False), 'FE0_C2_D010': ('FE0_C0_D001', (10, [8, 10]), False, False), 'FE0_C1_D100': ('FE0_C0_D001', (7, [4, 5]), False, False), 'FE0_C0_D100': ('FE0_C0_D001', (3, [0, 1]), False, False), 'FE0_C0_D010': ('FE0_C0_D001', (2, [0, 2]), False, False), 'FE0_C0_D001': ('FE0_C0_D001', (1, [0, 3]), False, False), 'FE0_C2_D100': ('FE0_C0_D001', (11, [8, 9]), False, False), 'FE0_C2': ('FE0_C0', (8, [8, 9, 10, 11]), False, False), 'FE0_C1': ('FE0_C0', (4, [4, 5, 6, 7]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2, 3]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.133289 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.0188811 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 2 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 2 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.242237 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000416994 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Elasticity3D.h.
+  
+Compiler stage 5 finished in 0.000925064 seconds.
+
+FFC finished in 0.409922 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form NSEMomentum3D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 5
+  Coefficients:           '[w_0, w_1, w_2, w_3, w_4]'
+  Coefficient names:      '[w, d1, d2, k, nu]'
+  Unique elements:        'Vector<3 x CG1(?)>, Vector<3 x DG0(?)>, DG0(?)'
+  Unique sub elements:    'Vector<3 x CG1(?)>, Vector<3 x DG0(?)>, DG0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 6
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.035696 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {4: {VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]]]), (0, 1, 0): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]]]), (0, 0, 0): array([[[ 0.1381966,  0.1381966,  0.1381966,  0.5854102],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.5854102,  0.1381966,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.1381966,  0.5854102,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.1381966,  0.1381966,  0.5854102,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.1381966,  0.5854102],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.5854102,  0.1381966,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.5854102,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.5854102,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.1381966,  0.5854102]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.5854102,  0.1381966,  0.1381966,  0.1381966]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.5854102,  0.1381966,  0.1381966]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.5854102,  0.1381966]]]), (0, 0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]])}}}, VectorElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, dim=3, quad_scheme=None): {None: {None: {(0, 0, 0): array([[[ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.]]])}}}, FiniteElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0, 0): array([[ 1.,  1.,  1.,  1.]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE2_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE2_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.99600361e-16,   5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE1_C0': array([[ 1.,  0.,  0.],
+         [ 1.,  0.,  0.],
+         [ 1.,  0.,  0.],
+         [ 1.,  0.,  0.]]), 'FE1_C1': array([[ 0.,  1.,  0.],
+         [ 0.,  1.,  0.],
+         [ 0.,  1.,  0.],
+         [ 0.,  1.,  0.]]), 'FE1_C2': array([[ 0.,  0.,  1.],
+         [ 0.,  0.,  1.],
+         [ 0.,  0.,  1.],
+         [ 0.,  0.,  1.]]), 'FE2_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE2_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE2_C1': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.5854102,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.5854102,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.1381966,  0.5854102,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.5854102,
+           0.1381966,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE2_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE2_C2': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.5854102,
+           0.1381966,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.5854102,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.1381966,  0.5854102],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.5854102,  0.1381966,
+           0.1381966,  0.1381966]]), 'FE2_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.99600361e-16,   5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE2_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE2_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.99600361e-16,
+            5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C0_D010': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE2_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE2_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.99600361e-16,   5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE1_C0': array([[ 1.,  0.,  0.],
+         [ 1.,  0.,  0.],
+         [ 1.,  0.,  0.],
+         [ 1.,  0.,  0.]]), 'FE1_C1': array([[ 0.,  1.,  0.],
+         [ 0.,  1.,  0.],
+         [ 0.,  1.,  0.],
+         [ 0.,  1.,  0.]]), 'FE1_C2': array([[ 0.,  0.,  1.],
+         [ 0.,  0.,  1.],
+         [ 0.,  0.,  1.],
+         [ 0.,  0.,  1.]]), 'FE2_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE2_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE2_C1': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.5854102,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.5854102,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.1381966,  0.5854102,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.5854102,
+           0.1381966,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE2_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE2_C2': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.5854102,
+           0.1381966,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.5854102,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.1381966,  0.5854102],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.5854102,  0.1381966,
+           0.1381966,  0.1381966]]), 'FE2_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.99600361e-16,   5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE2_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE2_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.99600361e-16,
+            5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C0_D010': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE2_C1_D100': 'FE2_C1_D100', 'FE0': 'FE0', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C2': 'FE1_C2', 'FE2_C0_D100': 'FE2_C0_D100', 'FE2_C2_D100': 'FE2_C2_D100', 'FE2_C1': 'FE2_C1', 'FE2_C0': 'FE2_C0', 'FE2_C2': 'FE2_C2', 'FE2_C0_D001': 'FE2_C0_D001', 'FE2_C2_D001': 'FE2_C2_D001', 'FE2_C2_D010': 'FE2_C2_D010', 'FE2_C1_D001': 'FE2_C1_D001', 'FE2_C0_D010': 'FE2_C0_D010', 'FE2_C1_D010': 'FE2_C1_D010'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE2_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966]]), 'FE2_C0_D001': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE0': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE2_C1_D100': ('FE2_C0_D001', (10, [4, 5]), False, False), 'FE0': ('FE0', (), False, True), 'FE1_C0': ('FE0', (0, [0]), False, True), 'FE1_C1': ('FE0', (1, [1]), False, True), 'FE1_C2': ('FE0', (2, [2]), False, True), 'FE2_C0_D100': ('FE2_C0_D001', (6, [0, 1]), False, False), 'FE2_C2_D100': ('FE2_C0_D001', (14, [8, 9]), False, False), 'FE2_C1': ('FE2_C0', (7, [4, 5, 6, 7]), False, False), 'FE2_C0': ('FE2_C0', (3, [0, 1, 2, 3]), False, False), 'FE2_C2': ('FE2_C0', (11, [8, 9, 10, 11]), False, False), 'FE2_C0_D001': ('FE2_C0_D001', (4, [0, 3]), False, False), 'FE2_C2_D001': ('FE2_C0_D001', (12, [8, 11]), False, False), 'FE2_C2_D010': ('FE2_C0_D001', (13, [8, 10]), False, False), 'FE2_C1_D001': ('FE2_C0_D001', (8, [4, 7]), False, False), 'FE2_C0_D010': ('FE2_C0_D001', (5, [0, 2]), False, False), 'FE2_C1_D010': ('FE2_C0_D001', (9, [4, 6]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.281735 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.0613921 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Z
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: d_22
+  Removing unused variable: d_21
+  Removing unused variable: d_20
+  Removing unused variable: d_12
+  Removing unused variable: d_11
+  Removing unused variable: d_10
+  Removing unused variable: d_02
+  Removing unused variable: d_01
+  Removing unused variable: d_00
+  Removing unused variable: C2
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Z
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: d_22
+  Removing unused variable: d_21
+  Removing unused variable: d_20
+  Removing unused variable: d_12
+  Removing unused variable: d_11
+  Removing unused variable: d_10
+  Removing unused variable: d_02
+  Removing unused variable: d_01
+  Removing unused variable: d_00
+  Removing unused variable: C2
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.365535 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000880003 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./NSEMomentum3D.h.
+  
+Compiler stage 5 finished in 0.00142193 seconds.
+
+FFC finished in 0.747132 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2DP2
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0222299 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00158 seconds
+  Shape of reference tensor: (6, 6, 2, 2)
+  Primary multi index:   rank = 2 dims = [6, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00914693 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000267029 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.15273 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000815868 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2DP2.h.
+  
+Compiler stage 5 finished in 0.00135899 seconds.
+
+FFC finished in 0.187122 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2DP3
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG3(?)'
+  Unique sub elements:    'CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0219939 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  400 entries computed in 0.0029 seconds
+  Shape of reference tensor: (10, 10, 2, 2)
+  Primary multi index:   rank = 2 dims = [10, 10] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0088861 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000194073 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.191246 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000368834 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2DP3.h.
+  
+Compiler stage 5 finished in 0.001302 seconds.
+
+FFC finished in 0.224361 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form StabStokes2D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[h]'
+  Unique elements:        'Mixed<Vector<2 x CG1(?)>, DG0(?)>, DG0(?)'
+  Unique sub elements:    'Mixed<Vector<2 x CG1(?)>, DG0(?)>, DG0(?), Vector<2 x CG1
+                          (?)>, CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 1
+  quadrature_degree: auto --> 1
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0324228 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0]], dtype=object)}}}, MixedElement(*[VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (1, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.33333333],
+          [ 0.        ],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.        ],
+          [ 1.        ]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE2_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333,  0.        ]]), 'FE2_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ,  0.        ]]), 'FE2_C2': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  1.]]), 'FE0': array([[1.0]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333,  0.        ]]), 'FE2_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ,  0.        ]]), 'FE2_C2': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  1.]]), 'FE0': array([[1.0]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {'FE2_C2_D01': ['FE2_C2_D10']}
+  
+  inv_name_map: {'FE2_C1_D01': 'FE2_C1_D01', 'FE2_C1_D10': 'FE2_C1_D10', 'FE2_C0': 'FE2_C0', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D01': 'FE1_C1_D01', 'FE2_C2_D10': 'FE2_C2_D01', 'FE1_C1_D10': 'FE1_C1_D10', 'FE2_C1': 'FE2_C1', 'FE2_C0_D01': 'FE2_C0_D01', 'FE2_C2': 'FE2_C2', 'FE0': 'FE0', 'FE2_C0_D10': 'FE2_C0_D10', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10', 'FE2_C2_D01': 'FE2_C2_D01'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[ 0.33333333,  0.33333333,  0.33333333]]), 'FE0': array([[1.0]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.]]), 'FE2_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE2_C1_D01': ('FE1_C0_D01', (10, [3, 5]), False, False), 'FE2_C1_D10': ('FE1_C0_D01', (11, [3, 4]), False, False), 'FE2_C0': ('FE1_C0', (6, [0, 1, 2]), False, False), 'FE1_C0': ('FE1_C0', (0, [0, 1, 2]), False, False), 'FE1_C1': ('FE1_C0', (3, [3, 4, 5]), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (4, [3, 5]), False, False), 'FE2_C2_D10': ('FE2_C2_D01', (), True, False), 'FE1_C1_D10': ('FE1_C0_D01', (5, [3, 4]), False, False), 'FE2_C1': ('FE1_C0', (9, [3, 4, 5]), False, False), 'FE2_C0_D01': ('FE1_C0_D01', (7, [0, 2]), False, False), 'FE2_C2': ('FE0', (12, [6]), False, True), 'FE0': ('FE0', (), False, True), 'FE2_C0_D10': ('FE1_C0_D01', (8, [0, 1]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (2, [0, 1]), False, False), 'FE2_C2_D01': ('FE2_C2_D01', (), True, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.117329 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.001719 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.153051 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000530958 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./StabStokes2D.h.
+  
+Compiler stage 5 finished in 0.000887156 seconds.
+
+FFC finished in 0.306298 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form THStokes2D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Mixed<Vector<2 x CG2(?)>, CG1(?)>'
+  Unique sub elements:    'Mixed<Vector<2 x CG2(?)>, CG1(?)>, Vector<2 x CG2(?)>, CG
+                          1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0449529 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00895 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00602 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00593 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00902 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.00384 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.0037 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.00388 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.00359 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.100885 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000272036 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.523609 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000440121 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./THStokes2D.h.
+  
+Compiler stage 5 finished in 0.00141382 seconds.
+
+FFC finished in 0.672034 seconds.
diff --git a/bench/fem/assembly/cpp/main.cpp b/bench/fem/assembly/cpp/main.cpp
new file mode 100644
index 0000000..f773ff2
--- /dev/null
+++ b/bench/fem/assembly/cpp/main.cpp
@@ -0,0 +1,172 @@
+// Copyright (C) 2008-2010 Dag Lindbo, Anders Logg and Ilmar Wilbers
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-07-22
+// Last changed: 2011-09-21
+
+#include <string>
+#include <vector>
+#include <iostream>
+#include <dolfin.h>
+#include "forms.h"
+
+using namespace dolfin;
+
+double assemble_form(Form& form)
+{
+  // Assemble once
+  const double t0 = time();
+  Matrix A;
+  Assembler assembler;
+  assembler.assemble(A, form);
+  return time() - t0;
+}
+
+double reassemble_form(Form& form)
+{
+  // Assemble once
+  Matrix A;
+  Assembler assembler;
+  assembler.assemble(A, form);
+
+  // Reassemble
+  const double t0 = time();
+  assembler.reset_sparsity = false;
+  assembler.assemble(A, form);
+  return time() - t0;
+}
+
+int main(int argc, char* argv[])
+{
+  info("Assembly for various forms and backends");
+  set_log_active(false);
+
+  parameters["reorder_dofs_serial"] = false;
+
+  // Forms
+  std::vector<std::string> forms;
+  forms.push_back("poisson1");
+  forms.push_back("poisson2");
+  forms.push_back("poisson3");
+  forms.push_back("stokes");
+  forms.push_back("stabilization");
+  forms.push_back("elasticity");
+  forms.push_back("navierstokes");
+
+  // Backends
+  std::vector<std::string> backends;
+  backends.push_back("uBLAS");
+  backends.push_back("PETSc");
+  backends.push_back("Epetra");
+  backends.push_back("STL");
+
+  // Override forms and backends with command-line arguments
+  if (argc == 3)
+  {
+    forms.clear();
+    forms.push_back(argv[1]);
+    backends.clear();
+    backends.push_back(argv[2]);
+  }
+  else if (argc != 1)
+  {
+    std::cout << "Usage: bench [form] [backend]" << std::endl;
+    exit(1);
+  }
+
+  // Tables for results
+  Table t0("Assemble total");
+  Table t1("Init dofmap");
+  Table t2("Build sparsity");
+  Table t3("Init tensor");
+  Table t4("Delete sparsity");
+  Table t5("Assemble cells");
+  Table t6("Overhead");
+  Table t7("Reassemble total");
+
+  // Benchmark assembly
+  for (unsigned int i = 0; i < forms.size(); i++)
+  {
+    std::cout << "Form: " << forms[i] << std::endl;
+    for (unsigned int j = 0; j < backends.size(); j++)
+    {
+      parameters["linear_algebra_backend"] = backends[j];
+      parameters["timer_prefix"] = backends[j];
+      std::cout << "  Backend: " << backends[j] << std::endl;
+      const double tt0 = bench_form(forms[i], assemble_form);
+      const double tt1 = timing(backends[j] + t1.title(), true);
+      const double tt2 = timing(backends[j] + t2.title(), true);
+      const double tt3 = timing(backends[j] + t3.title(), true);
+      const double tt4 = timing(backends[j] + t4.title(), true);
+      const double tt5 = timing(backends[j] + t5.title(), true);
+      t0(forms[i], backends[j]) = tt0;
+      t1(forms[i], backends[j]) = tt1;
+      t2(forms[i], backends[j]) = tt2;
+      t3(forms[i], backends[j]) = tt3;
+      t4(forms[i], backends[j]) = tt4;
+      t5(forms[i], backends[j]) = tt5;
+      t6(forms[i], backends[j]) = tt0 - tt1 - tt2 - tt3 - tt4 - tt5;
+      std::cout << "  BENCH " << forms[i] << "-" << backends[j] << " " << tt0 << std::endl;
+    }
+  }
+
+  // Benchmark reassembly
+  if (argc == 1)
+  {
+    for (unsigned int i = 0; i < forms.size(); i++)
+    {
+      std::cout << "Form: " << forms[i] << std::endl;
+      for (unsigned int j = 0; j < backends.size(); j++)
+      {
+        parameters["linear_algebra_backend"] = backends[j];
+        parameters["timer_prefix"] = backends[j];
+        std::cout << "  Backend: " << backends[j] << std::endl;
+        t7(forms[i], backends[j]) = bench_form(forms[i], reassemble_form);
+      }
+    }
+  }
+
+  // Display results
+  set_log_active(true);
+  std::cout << std::endl; info(t0, true);
+  std::cout << std::endl; info(t1, true);
+  std::cout << std::endl; info(t2, true);
+  std::cout << std::endl; info(t3, true);
+  std::cout << std::endl; info(t4, true);
+  std::cout << std::endl; info(t5, true);
+  std::cout << std::endl; info(t6, true);
+  if (argc == 1)
+    std::cout << std::endl; info(t7, true);
+
+  /*
+  // Display LaTeX tables
+  const bool print_latex = true;
+  if (print_latex)
+  {
+    std::cout << std::endl << t0.str_latex();
+    //std::cout << std::endl << t1.str_latex();
+    std::cout << std::endl << t2.str_latex();
+    std::cout << std::endl << t3.str_latex();
+    std::cout << std::endl << t4.str_latex();
+    std::cout << std::endl << t5.str_latex();
+    std::cout << std::endl << t6.str_latex();
+    std::cout << std::endl << t7.str_latex();
+  }
+  */
+
+  return 0;
+}
diff --git a/bench/fem/assembly/python/broken b/bench/fem/assembly/python/broken
new file mode 100755
index 0000000..2621b08
--- /dev/null
+++ b/bench/fem/assembly/python/broken
@@ -0,0 +1,97 @@
+# Copyright (C) 2008 Ilmar Wilbers
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+#
+# First added:  2008-06-04
+# Last changed: 2008-07-21
+
+# Be careful to first run the benchmark once in order for
+# the Python extensions to be created, or else the timings
+# will not be correct.
+
+from dolfin import *
+from time import time
+import sys
+
+def make_form(name, mesh):
+    globals()['mesh'] = mesh
+    execfile("../forms/" + name + '.form', globals())
+    try:
+        return a
+    except:
+        print "No object 'a' to return in file %s.form" %name
+        return None
+
+def bench_form(form, mesh, reps=1):
+    totaltime = 0.0
+    t0 = time()
+    A = assemble(form, mesh)
+    totaltime += time() - t0
+    for i in range(reps - 1):
+        t0 = time()
+        assemble(form, mesh, tensor=A, reset_sparsity=False)
+        totaltime += time() - t0
+    return totaltime / float(reps)
+
+def make_mesh(name, dim):
+    if dim == 3:
+        N = 32
+        mesh = UnitCube(N, N, N)
+        return mesh
+    else:
+        N = 256
+        mesh = UnitSquare(N, N)
+        return mesh
+
+if __name__ == "__main__":
+    try:
+        reps = int(sys.argv[1])
+    except:
+        print 'Usage: %s number_of_repetitions [1]' %sys.argv[0]
+        reps = 1
+
+# Backends
+backends = ["uBLAS", "PETSc", "Epetra", "MTL4", "Assembly"]
+
+# Forms
+forms = ["Elasticity3D",
+         "PoissonP1", 
+         "PoissonP2", 
+         "PoissonP3", 
+         "THStokes2D",
+         "NSEMomentum3D",
+         "StabStokes2D"]
+
+dolfin_set("output destination", "silent")
+results = Table("Assembly benchmark")
+
+for backend in backends:
+    dolfin_set("linear algebra backend", backend)
+    for form in forms:
+        dim = 2 if not form.find("3D") > -1 else 3
+        m = make_mesh(form, dim)
+        a = make_form(form, m)
+        print "Assembling %s with %s" % (form, backend)
+        t = bench_form(a, m, reps=reps)
+        results.set(backend, form, t)
+
+dolfin_set("output destination", "terminal")
+print ""
+
+results.disp()
+summary()
diff --git a/bench/fem/convergence/cpp/CMakeLists.txt b/bench/fem/convergence/cpp/CMakeLists.txt
new file mode 100644
index 0000000..741ee06
--- /dev/null
+++ b/bench/fem/convergence/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_fem_convergence_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} Poisson3D_4.cpp Poisson3D_3.cpp Poisson3D_2.cpp Poisson2D_4.cpp Poisson2D_2.cpp Poisson3D_1.cpp Poisson2D_1.cpp Poisson2D_3.cpp main.cpp Poisson2D_5.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/fem/convergence/cpp/Poisson2D_1.cpp b/bench/fem/convergence/cpp/Poisson2D_1.cpp
new file mode 100644
index 0000000..740fbff
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_1.cpp
@@ -0,0 +1,1602 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson2D_1.h"
+
+/// Constructor
+poisson2d_1_finite_element_0::poisson2d_1_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_1_finite_element_0::~poisson2d_1_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson2d_1_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson2d_1_finite_element_0::cell_shape() const
+{
+    return ufc::triangle;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson2d_1_finite_element_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson2d_1_finite_element_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson2d_1_finite_element_0::space_dimension() const
+{
+    return 3;
+}
+
+/// Return the rank of the value space
+std::size_t poisson2d_1_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson2d_1_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson2d_1_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson2d_1_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson2d_1_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson2d_1_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson2d_1_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson2d_1_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson2d_1_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson2d_1_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson2d_1_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson2d_1_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson2d_1_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson2d_1_finite_element_0::create() const
+{
+    return new poisson2d_1_finite_element_0();
+}
+
+/// Constructor
+poisson2d_1_dofmap_0::poisson2d_1_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_1_dofmap_0::~poisson2d_1_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson2d_1_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson2d_1_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson2d_1_dofmap_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson2d_1_dofmap_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson2d_1_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson2d_1_dofmap_0::local_dimension() const
+{
+    return 3;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson2d_1_dofmap_0::num_facet_dofs() const
+{
+    return 2;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson2d_1_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson2d_1_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson2d_1_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson2d_1_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson2d_1_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson2d_1_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson2d_1_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson2d_1_dofmap_0::create() const
+{
+    return new poisson2d_1_dofmap_0();
+}
+
+/// Constructor
+poisson2d_1_cell_integral_0_otherwise::poisson2d_1_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_1_cell_integral_0_otherwise::~poisson2d_1_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_1_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_1_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+}
+
+/// Constructor
+poisson2d_1_cell_integral_1_otherwise::poisson2d_1_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_1_cell_integral_1_otherwise::~poisson2d_1_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_1_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_1_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+}
+
+/// Constructor
+poisson2d_1_form_0::poisson2d_1_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_1_form_0::~poisson2d_1_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_1_form_0::signature() const
+{
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_1_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_1_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_1_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_1_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_1_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_1_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_1_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_1_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_1_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_1_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_1_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_1_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_1_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_1_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_1_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_1_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_1_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_1_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_1_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_1_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_1_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_1_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_1_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_1_form_0::create_default_cell_integral() const
+{
+    return new poisson2d_1_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_1_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_1_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_1_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_1_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson2d_1_form_1::poisson2d_1_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_1_form_1::~poisson2d_1_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_1_form_1::signature() const
+{
+    return "d29669d54e80ba045b9f6aeb94d0d33237447c2de5977853d51a949f2f7e7c2b30871cf2fd1dd173fdabb4daf7908a96678f21eb4086c6ed052d173bfb7ea232";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_1_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_1_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_1_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_1_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_1_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_1_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_1_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_1_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_1_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_1_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_1_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_1_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_1_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_1_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_1_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_1_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_1_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_1_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_1_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_1_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_1_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_1_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_1_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_1_form_1::create_default_cell_integral() const
+{
+    return new poisson2d_1_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_1_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_1_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_1_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_1_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson2D_1.h b/bench/fem/convergence/cpp/Poisson2D_1.h
new file mode 100644
index 0000000..a7fe05d
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_1.h
@@ -0,0 +1,985 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON2D_1_H
+#define __POISSON2D_1_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2d_1_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2d_1_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson2d_1_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2d_1_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2d_1_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson2d_1_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_1_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_1_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_1_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_1_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_1_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_1_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_1_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_1_form_0();
+
+  /// Destructor
+  virtual ~poisson2d_1_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_1_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_1_form_1();
+
+  /// Destructor
+  virtual ~poisson2d_1_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2D_1
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_1_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_1_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_1_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson2D_1.ufl b/bench/fem/convergence/cpp/Poisson2D_1.ufl
new file mode 100644
index 0000000..1f399d5
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_1.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#
+# Poisson's equation in 2D for q = 1
+
+element = FiniteElement("Lagrange", triangle, 1)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/Poisson2D_2.cpp b/bench/fem/convergence/cpp/Poisson2D_2.cpp
new file mode 100644
index 0000000..6af22a2
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_2.cpp
@@ -0,0 +1,2354 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson2D_2.h"
+
+/// Constructor
+poisson2d_2_finite_element_0::poisson2d_2_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_2_finite_element_0::~poisson2d_2_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson2d_2_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson2d_2_finite_element_0::cell_shape() const
+{
+    return ufc::triangle;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson2d_2_finite_element_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson2d_2_finite_element_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson2d_2_finite_element_0::space_dimension() const
+{
+    return 6;
+}
+
+/// Return the rank of the value space
+std::size_t poisson2d_2_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson2d_2_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson2d_2_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson2d_2_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson2d_2_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson2d_2_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson2d_2_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson2d_2_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson2d_2_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson2d_2_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson2d_2_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson2d_2_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson2d_2_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson2d_2_finite_element_0::create() const
+{
+    return new poisson2d_2_finite_element_0();
+}
+
+/// Constructor
+poisson2d_2_dofmap_0::poisson2d_2_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_2_dofmap_0::~poisson2d_2_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson2d_2_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson2d_2_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson2d_2_dofmap_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson2d_2_dofmap_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson2d_2_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0] + num_global_entities[1];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson2d_2_dofmap_0::local_dimension() const
+{
+    return 6;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson2d_2_dofmap_0::num_facet_dofs() const
+{
+    return 3;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson2d_2_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson2d_2_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson2d_2_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson2d_2_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson2d_2_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson2d_2_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson2d_2_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson2d_2_dofmap_0::create() const
+{
+    return new poisson2d_2_dofmap_0();
+}
+
+/// Constructor
+poisson2d_2_cell_integral_0_otherwise::poisson2d_2_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_2_cell_integral_0_otherwise::~poisson2d_2_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_2_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_2_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 49
+    // Total number of operations (multiply-add pairs):                  60
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_1_0;
+    A[2] = 0.166666666666667*G0_0_1 + 0.166666666666667*G0_1_1;
+    A[3] = 0.0;
+    A[4] = -0.666666666666667*G0_0_1 - 0.666666666666667*G0_1_1;
+    A[5] = -0.666666666666667*G0_0_0 - 0.666666666666667*G0_1_0;
+    A[6] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1;
+    A[7] = 0.5*G0_0_0;
+    A[8] = -0.166666666666667*G0_0_1;
+    A[9] = 0.666666666666666*G0_0_1;
+    A[10] = 0.0;
+    A[11] = -0.666666666666667*G0_0_0 - 0.666666666666666*G0_0_1;
+    A[12] = 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1;
+    A[13] = -0.166666666666667*G0_1_0;
+    A[14] = 0.5*G0_1_1;
+    A[15] = 0.666666666666666*G0_1_0;
+    A[16] = -0.666666666666666*G0_1_0 - 0.666666666666666*G0_1_1;
+    A[17] = 0.0;
+    A[18] = 0.0;
+    A[19] = 0.666666666666666*G0_1_0;
+    A[20] = 0.666666666666666*G0_0_1;
+    A[21] = 1.33333333333333*G0_0_0 + 0.666666666666665*G0_0_1 + 0.666666666666665*G0_1_0 + 1.33333333333333*G0_1_1;
+    A[22] = -1.33333333333333*G0_0_0 - 0.666666666666666*G0_0_1 - 0.666666666666665*G0_1_0;
+    A[23] = -0.666666666666665*G0_0_1 - 0.666666666666667*G0_1_0 - 1.33333333333333*G0_1_1;
+    A[24] = -0.666666666666667*G0_1_0 - 0.666666666666667*G0_1_1;
+    A[25] = 0.0;
+    A[26] = -0.666666666666666*G0_0_1 - 0.666666666666666*G0_1_1;
+    A[27] = -1.33333333333333*G0_0_0 - 0.666666666666665*G0_0_1 - 0.666666666666666*G0_1_0;
+    A[28] = 1.33333333333333*G0_0_0 + 0.666666666666666*G0_0_1 + 0.666666666666666*G0_1_0 + 1.33333333333333*G0_1_1;
+    A[29] = 0.666666666666665*G0_0_1 + 0.666666666666667*G0_1_0;
+    A[30] = -0.666666666666667*G0_0_0 - 0.666666666666667*G0_0_1;
+    A[31] = -0.666666666666667*G0_0_0 - 0.666666666666666*G0_1_0;
+    A[32] = 0.0;
+    A[33] = -0.666666666666667*G0_0_1 - 0.666666666666665*G0_1_0 - 1.33333333333333*G0_1_1;
+    A[34] = 0.666666666666667*G0_0_1 + 0.666666666666665*G0_1_0;
+    A[35] = 1.33333333333333*G0_0_0 + 0.666666666666667*G0_0_1 + 0.666666666666667*G0_1_0 + 1.33333333333333*G0_1_1;
+}
+
+/// Constructor
+poisson2d_2_cell_integral_1_otherwise::poisson2d_2_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_2_cell_integral_1_otherwise::~poisson2d_2_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_2_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_2_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    6
+    // Number of operations (multiply-add pairs) for tensor contraction: 21
+    // Total number of operations (multiply-add pairs):                  30
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0 - 0.00277777777777778*G0_1 - 0.00277777777777778*G0_2 - 0.0111111111111111*G0_3;
+    A[1] = -0.00277777777777778*G0_0 + 0.0166666666666667*G0_1 - 0.00277777777777781*G0_2 - 0.0111111111111111*G0_4;
+    A[2] = -0.00277777777777778*G0_0 - 0.0027777777777778*G0_1 + 0.0166666666666667*G0_2 - 0.0111111111111111*G0_5;
+    A[3] = -0.0111111111111111*G0_0 + 0.0888888888888888*G0_3 + 0.0444444444444443*G0_4 + 0.0444444444444443*G0_5;
+    A[4] = -0.0111111111111111*G0_1 + 0.0444444444444443*G0_3 + 0.0888888888888887*G0_4 + 0.0444444444444443*G0_5;
+    A[5] = -0.0111111111111111*G0_2 + 0.0444444444444443*G0_3 + 0.0444444444444443*G0_4 + 0.0888888888888887*G0_5;
+}
+
+/// Constructor
+poisson2d_2_form_0::poisson2d_2_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_2_form_0::~poisson2d_2_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_2_form_0::signature() const
+{
+    return "aae0a73595ace2836ec2cfac776b19ebe6bc264a8954a0a93986ca1a90118d4671958a14ba9141ef0d8adc0b7311a7d128634bedabdb1f15360fafef8ee30294";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_2_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_2_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_2_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_2_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_2_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_2_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_2_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_2_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_2_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_2_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_2_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_2_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_2_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_2_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_2_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_2_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_2_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_2_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_2_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_2_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_2_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_2_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_2_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_2_form_0::create_default_cell_integral() const
+{
+    return new poisson2d_2_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_2_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_2_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_2_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_2_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson2d_2_form_1::poisson2d_2_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_2_form_1::~poisson2d_2_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_2_form_1::signature() const
+{
+    return "9a0e5d6d194de632408849439b4e348035f5f938271c8f88b18541fec23a6ad6203835eeaaecea00101dc60215cfed9f0ad01e069f415d8073294be2ed9eabe9";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_2_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_2_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_2_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_2_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_2_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_2_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_2_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_2_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_2_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_2_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_2_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_2_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_2_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_2_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_2_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_2_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_2_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_2_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_2_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_2_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_2_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_2_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_2_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_2_form_1::create_default_cell_integral() const
+{
+    return new poisson2d_2_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_2_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_2_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_2_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_2_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson2D_2.h b/bench/fem/convergence/cpp/Poisson2D_2.h
new file mode 100644
index 0000000..f3236b7
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_2.h
@@ -0,0 +1,985 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON2D_2_H
+#define __POISSON2D_2_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2d_2_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2d_2_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson2d_2_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2d_2_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2d_2_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson2d_2_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_2_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_2_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_2_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_2_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_2_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_2_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_2_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_2_form_0();
+
+  /// Destructor
+  virtual ~poisson2d_2_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_2_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_2_form_1();
+
+  /// Destructor
+  virtual ~poisson2d_2_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2D_2
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_2_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_2_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_2_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson2D_2.ufl b/bench/fem/convergence/cpp/Poisson2D_2.ufl
new file mode 100644
index 0000000..589cce9
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_2.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#
+# Poisson's equation in 2D for q = 2
+
+element = FiniteElement("Lagrange", triangle, 2)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/Poisson2D_3.cpp b/bench/fem/convergence/cpp/Poisson2D_3.cpp
new file mode 100644
index 0000000..892aa2e
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_3.cpp
@@ -0,0 +1,3566 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson2D_3.h"
+
+/// Constructor
+poisson2d_3_finite_element_0::poisson2d_3_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_3_finite_element_0::~poisson2d_3_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson2d_3_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson2d_3_finite_element_0::cell_shape() const
+{
+    return ufc::triangle;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson2d_3_finite_element_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson2d_3_finite_element_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson2d_3_finite_element_0::space_dimension() const
+{
+    return 10;
+}
+
+/// Return the rank of the value space
+std::size_t poisson2d_3_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson2d_3_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson2d_3_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson2d_3_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson2d_3_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson2d_3_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson2d_3_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson2d_3_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson2d_3_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson2d_3_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson2d_3_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson2d_3_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson2d_3_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson2d_3_finite_element_0::create() const
+{
+    return new poisson2d_3_finite_element_0();
+}
+
+/// Constructor
+poisson2d_3_dofmap_0::poisson2d_3_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_3_dofmap_0::~poisson2d_3_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson2d_3_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson2d_3_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson2d_3_dofmap_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson2d_3_dofmap_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson2d_3_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0] + 2*num_global_entities[1] + num_global_entities[2];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson2d_3_dofmap_0::local_dimension() const
+{
+    return 10;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson2d_3_dofmap_0::num_facet_dofs() const
+{
+    return 4;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson2d_3_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson2d_3_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson2d_3_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson2d_3_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson2d_3_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson2d_3_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson2d_3_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson2d_3_dofmap_0::create() const
+{
+    return new poisson2d_3_dofmap_0();
+}
+
+/// Constructor
+poisson2d_3_cell_integral_0_otherwise::poisson2d_3_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_3_cell_integral_0_otherwise::~poisson2d_3_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_3_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_3_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 205
+    // Total number of operations (multiply-add pairs):                  216
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.424999999999999*G0_0_0 + 0.424999999999999*G0_0_1 + 0.424999999999999*G0_1_0 + 0.424999999999999*G0_1_1;
+    A[1] = -0.0875000000000006*G0_0_0 - 0.0875000000000005*G0_1_0;
+    A[2] = -0.0875000000000005*G0_0_1 - 0.0875000000000006*G0_1_1;
+    A[3] = -0.0375000000000006*G0_0_0 - 0.0375000000000018*G0_0_1 - 0.0375000000000006*G0_1_0 - 0.0375000000000017*G0_1_1;
+    A[4] = -0.0375000000000017*G0_0_0 - 0.0375000000000007*G0_0_1 - 0.0375000000000017*G0_1_0 - 0.0375000000000007*G0_1_1;
+    A[5] = 0.0374999999999997*G0_0_0 - 0.674999999999998*G0_0_1 + 0.0374999999999996*G0_1_0 - 0.674999999999998*G0_1_1;
+    A[6] = 0.0375000000000017*G0_0_0 + 0.3375*G0_0_1 + 0.0375000000000017*G0_1_0 + 0.3375*G0_1_1;
+    A[7] = -0.674999999999998*G0_0_0 + 0.0374999999999994*G0_0_1 - 0.674999999999998*G0_1_0 + 0.0374999999999994*G0_1_1;
+    A[8] = 0.3375*G0_0_0 + 0.037500000000002*G0_0_1 + 0.3375*G0_1_0 + 0.0375000000000018*G0_1_1;
+    A[9] = 0.0;
+    A[10] = -0.0875000000000006*G0_0_0 - 0.0875000000000005*G0_0_1;
+    A[11] = 0.425000000000002*G0_0_0;
+    A[12] = 0.0874999999999996*G0_0_1;
+    A[13] = 0.0375000000000018*G0_0_0 + 0.712500000000003*G0_0_1;
+    A[14] = 0.0374999999999996*G0_0_0 - 0.3*G0_0_1;
+    A[15] = -0.0375000000000001*G0_0_0;
+    A[16] = -0.0374999999999996*G0_0_0;
+    A[17] = 0.337500000000003*G0_0_0 + 0.300000000000003*G0_0_1;
+    A[18] = -0.675000000000004*G0_0_0 - 0.712500000000003*G0_0_1;
+    A[19] = 0.0;
+    A[20] = -0.0875000000000005*G0_1_0 - 0.0875000000000006*G0_1_1;
+    A[21] = 0.0874999999999996*G0_1_0;
+    A[22] = 0.425000000000002*G0_1_1;
+    A[23] = -0.3*G0_1_0 + 0.0374999999999994*G0_1_1;
+    A[24] = 0.712500000000004*G0_1_0 + 0.0375000000000025*G0_1_1;
+    A[25] = 0.300000000000003*G0_1_0 + 0.337500000000003*G0_1_1;
+    A[26] = -0.712500000000004*G0_1_0 - 0.675000000000005*G0_1_1;
+    A[27] = -0.0374999999999996*G0_1_1;
+    A[28] = -0.0374999999999994*G0_1_1;
+    A[29] = 0.0;
+    A[30] = -0.0375000000000006*G0_0_0 - 0.0375000000000006*G0_0_1 - 0.0375000000000018*G0_1_0 - 0.0375000000000017*G0_1_1;
+    A[31] = 0.0375000000000018*G0_0_0 + 0.712500000000003*G0_1_0;
+    A[32] = -0.3*G0_0_1 + 0.0374999999999994*G0_1_1;
+    A[33] = 1.6875*G0_0_0 + 0.843750000000001*G0_0_1 + 0.843750000000001*G0_1_0 + 1.6875*G0_1_1;
+    A[34] = -0.3375*G0_0_0 + 0.843749999999998*G0_0_1 - 0.168750000000001*G0_1_0 - 0.3375*G0_1_1;
+    A[35] = 0.337500000000001*G0_0_0 + 0.16875*G0_0_1 + 0.16875*G0_1_0;
+    A[36] = 0.3375*G0_0_0 + 0.168750000000001*G0_0_1 + 0.168750000000001*G0_1_0;
+    A[37] = 0.168750000000004*G0_0_1 + 0.168750000000007*G0_1_0 + 0.337500000000006*G0_1_1;
+    A[38] = -0.843750000000002*G0_0_1 - 0.843750000000008*G0_1_0 - 1.68750000000001*G0_1_1;
+    A[39] = -2.025*G0_0_0 - 1.0125*G0_0_1 - 1.0125*G0_1_0;
+    A[40] = -0.0375000000000017*G0_0_0 - 0.0375000000000017*G0_0_1 - 0.0375000000000007*G0_1_0 - 0.0375000000000007*G0_1_1;
+    A[41] = 0.0374999999999996*G0_0_0 - 0.3*G0_1_0;
+    A[42] = 0.712500000000004*G0_0_1 + 0.0375000000000024*G0_1_1;
+    A[43] = -0.3375*G0_0_0 - 0.168750000000001*G0_0_1 + 0.843749999999998*G0_1_0 - 0.3375*G0_1_1;
+    A[44] = 1.68750000000001*G0_0_0 + 0.843750000000003*G0_0_1 + 0.843750000000003*G0_1_0 + 1.6875*G0_1_1;
+    A[45] = 0.337500000000007*G0_0_0 + 0.168750000000007*G0_0_1 + 0.168750000000005*G0_1_0;
+    A[46] = -1.68750000000001*G0_0_0 - 0.84375000000001*G0_0_1 - 0.843750000000004*G0_1_0;
+    A[47] = 0.168750000000001*G0_0_1 + 0.168750000000001*G0_1_0 + 0.337500000000002*G0_1_1;
+    A[48] = 0.168750000000001*G0_0_1 + 0.168749999999999*G0_1_0 + 0.337500000000001*G0_1_1;
+    A[49] = -1.0125*G0_0_1 - 1.0125*G0_1_0 - 2.025*G0_1_1;
+    A[50] = 0.0374999999999997*G0_0_0 + 0.0374999999999996*G0_0_1 - 0.674999999999998*G0_1_0 - 0.674999999999998*G0_1_1;
+    A[51] = -0.0375000000000001*G0_0_0;
+    A[52] = 0.300000000000003*G0_0_1 + 0.337500000000003*G0_1_1;
+    A[53] = 0.337500000000001*G0_0_0 + 0.16875*G0_0_1 + 0.16875*G0_1_0;
+    A[54] = 0.337500000000007*G0_0_0 + 0.168750000000004*G0_0_1 + 0.168750000000007*G0_1_0;
+    A[55] = 1.6875*G0_0_0 + 0.843750000000003*G0_0_1 + 0.843750000000003*G0_1_0 + 1.6875*G0_1_1;
+    A[56] = -0.337500000000007*G0_0_0 - 1.18125000000001*G0_0_1 - 0.168750000000007*G0_1_0 - 1.35*G0_1_1;
+    A[57] = 0.84375*G0_0_1 + 0.843749999999995*G0_1_0;
+    A[58] = -0.16875*G0_0_1 - 0.168749999999997*G0_1_0;
+    A[59] = -2.025*G0_0_0 - 1.0125*G0_0_1 - 1.0125*G0_1_0;
+    A[60] = 0.0375000000000017*G0_0_0 + 0.0375000000000017*G0_0_1 + 0.3375*G0_1_0 + 0.3375*G0_1_1;
+    A[61] = -0.0374999999999996*G0_0_0;
+    A[62] = -0.712500000000004*G0_0_1 - 0.675000000000005*G0_1_1;
+    A[63] = 0.3375*G0_0_0 + 0.168750000000001*G0_0_1 + 0.168750000000001*G0_1_0;
+    A[64] = -1.68750000000001*G0_0_0 - 0.843750000000004*G0_0_1 - 0.84375000000001*G0_1_0;
+    A[65] = -0.337500000000007*G0_0_0 - 0.168750000000007*G0_0_1 - 1.18125000000001*G0_1_0 - 1.35*G0_1_1;
+    A[66] = 1.68750000000001*G0_0_0 + 0.84375000000001*G0_0_1 + 0.843750000000011*G0_1_0 + 1.68750000000001*G0_1_1;
+    A[67] = -0.168750000000001*G0_0_1 - 0.168749999999997*G0_1_0;
+    A[68] = -0.168750000000001*G0_0_1 - 0.168750000000004*G0_1_0;
+    A[69] = 1.01250000000001*G0_0_1 + 1.01250000000001*G0_1_0;
+    A[70] = -0.674999999999998*G0_0_0 - 0.674999999999998*G0_0_1 + 0.0374999999999994*G0_1_0 + 0.0374999999999994*G0_1_1;
+    A[71] = 0.337500000000003*G0_0_0 + 0.300000000000003*G0_1_0;
+    A[72] = -0.0374999999999996*G0_1_1;
+    A[73] = 0.168750000000007*G0_0_1 + 0.168750000000004*G0_1_0 + 0.337500000000006*G0_1_1;
+    A[74] = 0.168750000000001*G0_0_1 + 0.168750000000001*G0_1_0 + 0.337500000000002*G0_1_1;
+    A[75] = 0.843749999999995*G0_0_1 + 0.84375*G0_1_0;
+    A[76] = -0.168749999999997*G0_0_1 - 0.168750000000001*G0_1_0;
+    A[77] = 1.6875*G0_0_0 + 0.843750000000002*G0_0_1 + 0.843750000000002*G0_1_0 + 1.6875*G0_1_1;
+    A[78] = -1.35*G0_0_0 - 0.168750000000007*G0_0_1 - 1.18125000000001*G0_1_0 - 0.337500000000006*G0_1_1;
+    A[79] = -1.0125*G0_0_1 - 1.0125*G0_1_0 - 2.025*G0_1_1;
+    A[80] = 0.3375*G0_0_0 + 0.3375*G0_0_1 + 0.037500000000002*G0_1_0 + 0.0375000000000018*G0_1_1;
+    A[81] = -0.675000000000004*G0_0_0 - 0.712500000000003*G0_1_0;
+    A[82] = -0.0374999999999994*G0_1_1;
+    A[83] = -0.843750000000008*G0_0_1 - 0.843750000000002*G0_1_0 - 1.68750000000001*G0_1_1;
+    A[84] = 0.168749999999999*G0_0_1 + 0.168750000000001*G0_1_0 + 0.337500000000001*G0_1_1;
+    A[85] = -0.168749999999997*G0_0_1 - 0.16875*G0_1_0;
+    A[86] = -0.168750000000004*G0_0_1 - 0.168750000000001*G0_1_0;
+    A[87] = -1.35*G0_0_0 - 1.18125*G0_0_1 - 0.168750000000007*G0_1_0 - 0.337500000000006*G0_1_1;
+    A[88] = 1.68750000000001*G0_0_0 + 0.843750000000009*G0_0_1 + 0.843750000000009*G0_1_0 + 1.68750000000001*G0_1_1;
+    A[89] = 1.01250000000001*G0_0_1 + 1.0125*G0_1_0;
+    A[90] = 0.0;
+    A[91] = 0.0;
+    A[92] = 0.0;
+    A[93] = -2.025*G0_0_0 - 1.0125*G0_0_1 - 1.0125*G0_1_0;
+    A[94] = -1.0125*G0_0_1 - 1.0125*G0_1_0 - 2.025*G0_1_1;
+    A[95] = -2.025*G0_0_0 - 1.0125*G0_0_1 - 1.0125*G0_1_0;
+    A[96] = 1.01250000000001*G0_0_1 + 1.01250000000001*G0_1_0;
+    A[97] = -1.0125*G0_0_1 - 1.0125*G0_1_0 - 2.025*G0_1_1;
+    A[98] = 1.0125*G0_0_1 + 1.01250000000001*G0_1_0;
+    A[99] = 4.05*G0_0_0 + 2.025*G0_0_1 + 2.025*G0_1_0 + 4.05000000000001*G0_1_1;
+}
+
+/// Constructor
+poisson2d_3_cell_integral_1_otherwise::poisson2d_3_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_3_cell_integral_1_otherwise::~poisson2d_3_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_3_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_3_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    10
+    // Number of operations (multiply-add pairs) for tensor contraction: 83
+    // Total number of operations (multiply-add pairs):                  96
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00565476190476194*G0_0 + 0.000818452380952386*G0_1 + 0.000818452380952386*G0_2 + 0.00200892857142856*G0_3 + 0.00200892857142856*G0_4 + 0.00133928571428575*G0_5 + 0.00133928571428575*G0_7 + 0.00267857142857137*G0_9;
+    A[1] = 0.000818452380952386*G0_0 + 0.00565476190476195*G0_1 + 0.000818452380952387*G0_2 + 0.00133928571428575*G0_3 + 0.00200892857142857*G0_5 + 0.00200892857142857*G0_6 + 0.00133928571428575*G0_8 + 0.00267857142857143*G0_9;
+    A[2] = 0.000818452380952386*G0_0 + 0.000818452380952387*G0_1 + 0.00565476190476195*G0_2 + 0.00133928571428575*G0_4 + 0.00133928571428575*G0_6 + 0.00200892857142857*G0_7 + 0.00200892857142857*G0_8 + 0.00267857142857141*G0_9;
+    A[3] = 0.00200892857142856*G0_0 + 0.00133928571428575*G0_1 + 0.0401785714285717*G0_3 - 0.0140624999999999*G0_4 - 0.00401785714285713*G0_5 - 0.0100446428571428*G0_6 - 0.0100446428571428*G0_7 + 0.0200892857142856*G0_8 + 0.0120535714285714*G0_9;
+    A[4] = 0.00200892857142856*G0_0 + 0.00133928571428575*G0_2 - 0.0140624999999999*G0_3 + 0.0401785714285717*G0_4 - 0.0100446428571428*G0_5 + 0.0200892857142856*G0_6 - 0.00401785714285714*G0_7 - 0.0100446428571428*G0_8 + 0.0120535714285713*G0_9;
+    A[5] = 0.00133928571428575*G0_0 + 0.00200892857142857*G0_1 - 0.00401785714285713*G0_3 - 0.0100446428571428*G0_4 + 0.0401785714285717*G0_5 - 0.0140624999999999*G0_6 + 0.0200892857142856*G0_7 - 0.0100446428571428*G0_8 + 0.0120535714285715*G0_9;
+    A[6] = 0.00200892857142857*G0_1 + 0.00133928571428575*G0_2 - 0.0100446428571428*G0_3 + 0.0200892857142856*G0_4 - 0.0140624999999999*G0_5 + 0.0401785714285718*G0_6 - 0.0100446428571428*G0_7 - 0.00401785714285714*G0_8 + 0.0120535714285714*G0_9;
+    A[7] = 0.00133928571428575*G0_0 + 0.00200892857142857*G0_2 - 0.0100446428571428*G0_3 - 0.00401785714285714*G0_4 + 0.0200892857142856*G0_5 - 0.0100446428571428*G0_6 + 0.0401785714285717*G0_7 - 0.0140624999999999*G0_8 + 0.0120535714285715*G0_9;
+    A[8] = 0.00133928571428575*G0_1 + 0.00200892857142857*G0_2 + 0.0200892857142856*G0_3 - 0.0100446428571428*G0_4 - 0.0100446428571428*G0_5 - 0.00401785714285714*G0_6 - 0.0140624999999999*G0_7 + 0.0401785714285717*G0_8 + 0.0120535714285714*G0_9;
+    A[9] = 0.00267857142857137*G0_0 + 0.00267857142857143*G0_1 + 0.00267857142857141*G0_2 + 0.0120535714285714*G0_3 + 0.0120535714285713*G0_4 + 0.0120535714285715*G0_5 + 0.0120535714285714*G0_6 + 0.0120535714285715*G0_7 + 0.0120535714285714*G0_8 + 0.144642857142856*G0_9;
+}
+
+/// Constructor
+poisson2d_3_form_0::poisson2d_3_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_3_form_0::~poisson2d_3_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_3_form_0::signature() const
+{
+    return "f9b8ce71238cbeed8abadbc4741d92fef64810352ec67cfe46516d0c7bebacf074a0af32740986f745e0a7c5e2014ad386a492e81c6e7ac63b8b3e2e1bd6577d";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_3_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_3_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_3_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_3_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_3_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_3_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_3_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_3_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_3_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_3_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_3_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_3_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_3_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_3_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_3_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_3_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_3_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_3_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_3_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_3_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_3_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_3_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_3_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_3_form_0::create_default_cell_integral() const
+{
+    return new poisson2d_3_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_3_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_3_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_3_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_3_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson2d_3_form_1::poisson2d_3_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_3_form_1::~poisson2d_3_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_3_form_1::signature() const
+{
+    return "e9df4208cf9a9694f9dfe09d426820ed0cb5b0778e002b97a27e65b07bf6e3b4a89365b4aa574ef40884cb921f1bcfd437b3f1818546f8cfb73d3918ab3a9c5c";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_3_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_3_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_3_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_3_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_3_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_3_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_3_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_3_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_3_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_3_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_3_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_3_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_3_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_3_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_3_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_3_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_3_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_3_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_3_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_3_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_3_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_3_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_3_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_3_form_1::create_default_cell_integral() const
+{
+    return new poisson2d_3_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_3_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_3_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_3_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_3_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson2D_3.h b/bench/fem/convergence/cpp/Poisson2D_3.h
new file mode 100644
index 0000000..5dd622a
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_3.h
@@ -0,0 +1,985 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON2D_3_H
+#define __POISSON2D_3_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2d_3_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2d_3_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson2d_3_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2d_3_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2d_3_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson2d_3_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_3_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_3_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_3_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_3_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_3_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_3_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_3_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_3_form_0();
+
+  /// Destructor
+  virtual ~poisson2d_3_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_3_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_3_form_1();
+
+  /// Destructor
+  virtual ~poisson2d_3_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2D_3
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_3_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_3_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_3_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson2D_3.ufl b/bench/fem/convergence/cpp/Poisson2D_3.ufl
new file mode 100644
index 0000000..b429748
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_3.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#
+# Poisson's equation in 2D for q = 3
+
+element = FiniteElement("Lagrange", triangle, 3)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/Poisson2D_4.cpp b/bench/fem/convergence/cpp/Poisson2D_4.cpp
new file mode 100644
index 0000000..7847df0
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_4.cpp
@@ -0,0 +1,5479 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson2D_4.h"
+
+/// Constructor
+poisson2d_4_finite_element_0::poisson2d_4_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_4_finite_element_0::~poisson2d_4_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson2d_4_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 4, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson2d_4_finite_element_0::cell_shape() const
+{
+    return ufc::triangle;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson2d_4_finite_element_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson2d_4_finite_element_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson2d_4_finite_element_0::space_dimension() const
+{
+    return 15;
+}
+
+/// Return the rank of the value space
+std::size_t poisson2d_4_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson2d_4_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson2d_4_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.0, -0.0412393049421161, -0.0238095238095238, 0.0289800294976278, 0.0224478343233825, 0.012960263189329, -0.0395942580610999, -0.0334632556631574, -0.025920526378658, -0.014965222882255, 0.0321247254366312, 0.0283313448138523, 0.023944356611608, 0.0185472188784818, 0.0107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.0, 0.0412393049421161, -0.0238095238095238, 0.0289800294976278, -0.0224478343233825, 0.012960263189329, 0.0395942580610999, -0.0334632556631574, 0.025920526378658, -0.014965222882255, 0.0321247254366312, -0.0283313448138523, 0.023944356611608, -0.0185472188784818, 0.0107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.0, 0.0, 0.0476190476190476, 0.0, 0.0, 0.038880789567987, 0.0, 0.0, 0.0, 0.0598608915290199, 0.0, 0.0, 0.0, 0.0, 0.0535412090610519};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, 0.131965775814772, -0.0253968253968253, 0.139104141588614, -0.0718330698348239, 0.0311046316543896, 0.0633508128977599, 0.0267706045305259, -0.0622092633087791, 0.0478887132232159, 0.0, 0.0566626896277046, -0.0838052481406279, 0.0834624849531682, -0.0535412090610519};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {-0.0314269680527355, 0.010997147984564, 0.00634920634920636, 0.0, 0.188561808316413, -0.163299316185545, 0.0, 0.0936971158568408, 0.0, -0.0419026240703139, 0.0, 0.0, 0.0838052481406279, -0.139104141588614, 0.107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, 0.0439885919382573, 0.126984126984127, 0.0, 0.035916534917412, 0.155523158271948, 0.0, 0.0, 0.103682105514632, -0.011972178305804, 0.0, 0.0, 0.0, 0.0927360943924091, -0.107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, -0.131965775814772, -0.0253968253968254, 0.139104141588614, 0.0718330698348239, 0.0311046316543895, -0.0633508128977599, 0.0267706045305259, 0.0622092633087792, 0.0478887132232159, 0.0, -0.0566626896277046, -0.0838052481406278, -0.0834624849531681, -0.0535412090610519};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {-0.0314269680527356, -0.0109971479845643, 0.00634920634920625, 0.0, -0.188561808316413, -0.163299316185545, 0.0, 0.0936971158568409, 0.0, -0.0419026240703138, 0.0, 0.0, 0.0838052481406278, 0.139104141588614, 0.107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, -0.0439885919382572, 0.126984126984127, 0.0, -0.0359165349174119, 0.155523158271948, 0.0, 0.0, -0.103682105514632, -0.011972178305804, 0.0, 0.0, 0.0, -0.0927360943924091, -0.107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, -0.0879771838765144, -0.101587301587302, 0.0927360943924091, 0.107749604752236, 0.0725774738602423, 0.0791885161221998, -0.013385302265263, -0.0518410527573159, -0.0419026240703139, -0.128498901746525, -0.0566626896277046, -0.011972178305804, 0.00927360943924089, 0.0107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {-0.0314269680527352, 0.0, -0.0126984126984127, -0.243432247780074, 0.0, 0.0544331053951817, 0.0, 0.0936971158568408, 0.0, -0.0419026240703139, 0.192748352619787, 0.0, -0.0239443566116079, 0.0, 0.0107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, 0.0879771838765144, -0.101587301587302, 0.0927360943924091, -0.107749604752236, 0.0725774738602423, -0.0791885161221998, -0.013385302265263, 0.051841052757316, -0.041902624070314, -0.128498901746525, 0.0566626896277046, -0.011972178305804, -0.00927360943924091, 0.0107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.251415744421884, -0.351908735506058, -0.203174603174603, -0.139104141588614, -0.107749604752236, -0.0622092633087791, 0.19005243869328, -0.0267706045305259, 0.124418526617558, 0.155638317975452, 0.0, 0.169988068883114, 0.0838052481406278, -0.0278208283177227, -0.053541209061052};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.251415744421884, 0.351908735506058, -0.203174603174603, -0.139104141588614, 0.107749604752236, -0.0622092633087791, -0.19005243869328, -0.0267706045305259, -0.124418526617558, 0.155638317975452, 0.0, -0.169988068883114, 0.0838052481406278, 0.0278208283177227, -0.0535412090610519};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.251415744421883, 0.0, 0.406349206349206, 0.0, 0.0, -0.186627789926337, 0.0, -0.187394231713682, 0.0, -0.203527031198668, 0.0, 0.0, -0.167610496281256, 0.0, 0.107082418122104};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 15; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson2d_4_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson2d_4_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 4)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[16][4];
+    for (unsigned int row = 0; row < 16; row++)
+    {
+      for (unsigned int col = 0; col < 4; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[16][16];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.0, -0.0412393049421161, -0.0238095238095238, 0.0289800294976278, 0.0224478343233825, 0.012960263189329, -0.0395942580610999, -0.0334632556631574, -0.025920526378658, -0.014965222882255, 0.0321247254366312, 0.0283313448138523, 0.023944356611608, 0.0185472188784818, 0.0107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.0, 0.0412393049421161, -0.0238095238095238, 0.0289800294976278, -0.0224478343233825, 0.012960263189329, 0.0395942580610999, -0.0334632556631574, 0.025920526378658, -0.014965222882255, 0.0321247254366312, -0.0283313448138523, 0.023944356611608, -0.0185472188784818, 0.0107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.0, 0.0, 0.0476190476190476, 0.0, 0.0, 0.038880789567987, 0.0, 0.0, 0.0, 0.0598608915290199, 0.0, 0.0, 0.0, 0.0, 0.0535412090610519};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, 0.131965775814772, -0.0253968253968253, 0.139104141588614, -0.0718330698348239, 0.0311046316543896, 0.0633508128977599, 0.0267706045305259, -0.0622092633087791, 0.0478887132232159, 0.0, 0.0566626896277046, -0.0838052481406279, 0.0834624849531682, -0.0535412090610519};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {-0.0314269680527355, 0.010997147984564, 0.00634920634920636, 0.0, 0.188561808316413, -0.163299316185545, 0.0, 0.0936971158568408, 0.0, -0.0419026240703139, 0.0, 0.0, 0.0838052481406279, -0.139104141588614, 0.107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, 0.0439885919382573, 0.126984126984127, 0.0, 0.035916534917412, 0.155523158271948, 0.0, 0.0, 0.103682105514632, -0.011972178305804, 0.0, 0.0, 0.0, 0.0927360943924091, -0.107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, -0.131965775814772, -0.0253968253968254, 0.139104141588614, 0.0718330698348239, 0.0311046316543895, -0.0633508128977599, 0.0267706045305259, 0.0622092633087792, 0.0478887132232159, 0.0, -0.0566626896277046, -0.0838052481406278, -0.0834624849531681, -0.0535412090610519};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {-0.0314269680527356, -0.0109971479845643, 0.00634920634920625, 0.0, -0.188561808316413, -0.163299316185545, 0.0, 0.0936971158568409, 0.0, -0.0419026240703138, 0.0, 0.0, 0.0838052481406278, 0.139104141588614, 0.107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, -0.0439885919382572, 0.126984126984127, 0.0, -0.0359165349174119, 0.155523158271948, 0.0, 0.0, -0.103682105514632, -0.011972178305804, 0.0, 0.0, 0.0, -0.0927360943924091, -0.107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, -0.0879771838765144, -0.101587301587302, 0.0927360943924091, 0.107749604752236, 0.0725774738602423, 0.0791885161221998, -0.013385302265263, -0.0518410527573159, -0.0419026240703139, -0.128498901746525, -0.0566626896277046, -0.011972178305804, 0.00927360943924089, 0.0107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {-0.0314269680527352, 0.0, -0.0126984126984127, -0.243432247780074, 0.0, 0.0544331053951817, 0.0, 0.0936971158568408, 0.0, -0.0419026240703139, 0.192748352619787, 0.0, -0.0239443566116079, 0.0, 0.0107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.125707872210942, 0.0879771838765144, -0.101587301587302, 0.0927360943924091, -0.107749604752236, 0.0725774738602423, -0.0791885161221998, -0.013385302265263, 0.051841052757316, -0.041902624070314, -0.128498901746525, 0.0566626896277046, -0.011972178305804, -0.00927360943924091, 0.0107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.251415744421884, -0.351908735506058, -0.203174603174603, -0.139104141588614, -0.107749604752236, -0.0622092633087791, 0.19005243869328, -0.0267706045305259, 0.124418526617558, 0.155638317975452, 0.0, 0.169988068883114, 0.0838052481406278, -0.0278208283177227, -0.053541209061052};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.251415744421884, 0.351908735506058, -0.203174603174603, -0.139104141588614, 0.107749604752236, -0.0622092633087791, -0.19005243869328, -0.0267706045305259, -0.124418526617558, 0.155638317975452, 0.0, -0.169988068883114, 0.0838052481406278, 0.0278208283177227, -0.0535412090610519};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[15] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[10] = basisvalues[6]*1.75*tmp0 - basisvalues[3]*0.75*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[11] = basisvalues[6]*(3.5 + 4.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[14] = basisvalues[9]*(0.0285714285714286 + Y*1.8) - basisvalues[5]*0.771428571428571;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[13] = basisvalues[8]*(0.285714285714286 + Y*2.0) - basisvalues[4]*0.714285714285714;
+      basisvalues[12] = basisvalues[7]*(1.02040816326531 + Y*2.57142857142857) - basisvalues[3]*0.551020408163265;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[14] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[13] *= std::sqrt(7.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[12] *= std::sqrt(12.5);
+      basisvalues[6] *= std::sqrt(14.0);
+      basisvalues[11] *= std::sqrt(17.5);
+      basisvalues[10] *= std::sqrt(22.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[15] = \
+      {0.251415744421883, 0.0, 0.406349206349206, 0.0, 0.0, -0.186627789926337, 0.0, -0.187394231713682, 0.0, -0.203527031198668, 0.0, 0.0, -0.167610496281256, 0.0, 0.107082418122104};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212917, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513776, 0.0, 7.83836717690618, 0.0, 0.0, 8.40000000000001, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 10.9544511501033, 0.0, 0.0, -3.83325938999965, 0.0, 17.7482393492989, 0.0, 0.553283335172493, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.73286382647968, 0.0, 3.3466401061363, 4.36435780471985, 1.56370854789005e-14, -5.07468037933238, 0.0, 17.0084012854152, 0.0, 1.52127765851133, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 2.44948974278318, 0.0, 0.0, 9.14285714285714, 0.0, 0.0, 0.0, 14.8461497791618, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.09838667696593, 0.0, 7.66811580507233, 0.0, 0.0, 10.733126291999, 0.0, 0.0, 0.0, 9.2951600308978, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[15][15] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175279, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.00000000000001, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.30940107675849, 0.0, 8.16496580927727, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872629, -1.49666295470958, 6.83130051063974, -1.05830052442583, 0.305505046330392, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749978, 2.19089023002067, 2.52982212813471, 8.08290376865477, 6.26099033699943, -1.80739222823013, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238572, 4.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.0, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.68328157299974, 5.47722557505167, -1.89736659610103, 7.42307488958091, -1.91662969499982, 0.663940002206988, 8.87411967464942, -1.07142857142857, 0.276641667586246, -0.0958314847499896, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.36643191323983, 2.89827534923789, 1.67332005306815, 2.18217890235993, 5.74704893215392, -2.53734018966619, 10.0623058987491, 8.50420064270761, -2.1957751641342, 0.760638829255665, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 1.22474487139159, 3.53553390593274, -7.37711113563318, 4.57142857142858, 1.64957219768465, 0.0, 11.4997781699989, 7.42307488958091, -2.57142857142857, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.54919333848297, 6.64078308635359, 3.83405790253616, 0.0, -6.19677335393187, 5.3665631459995, 0.0, 0.0, 13.4164078649987, 4.6475800154489, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.57770876399968, 0.0, 8.85437744847146, 0.0, 0.0, -3.09838667696594, 0.0, 0.0, 0.0, 16.0996894379985, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[15][15] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 15; t++)
+        {
+          for (unsigned int u = 0; u < 15; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            for (unsigned int u = 0; u < 15; u++)
+            {
+              for (unsigned int tu = 0; tu < 15; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 15; s++)
+        {
+          for (unsigned int t = 0; t < 15; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson2d_4_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 4)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[16];
+    for (unsigned int r = 0; r < 16; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson2d_4_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+      y[1] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[4];
+      y[1] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[4];
+      y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[4];
+      y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[2];
+      y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[2];
+      y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 12:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 13:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+      y[1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson2d_4_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+    y[1] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[4];
+    y[1] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[4];
+    y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[4];
+    y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[2];
+    y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[10] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[2];
+    y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[12] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+    y[1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[13] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson2d_4_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson2d_4_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson2d_4_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson2d_4_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson2d_4_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson2d_4_finite_element_0::create() const
+{
+    return new poisson2d_4_finite_element_0();
+}
+
+/// Constructor
+poisson2d_4_dofmap_0::poisson2d_4_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_4_dofmap_0::~poisson2d_4_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson2d_4_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 4, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson2d_4_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson2d_4_dofmap_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson2d_4_dofmap_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson2d_4_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0] + 3*num_global_entities[1] + 3*num_global_entities[2];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson2d_4_dofmap_0::local_dimension() const
+{
+    return 15;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson2d_4_dofmap_0::num_facet_dofs() const
+{
+    return 5;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson2d_4_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 3;
+        break;
+      }
+    case 2:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson2d_4_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 3*c.entity_indices[1][0];
+    dofs[4] = offset + 3*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 3*c.entity_indices[1][0] + 2;
+    dofs[6] = offset + 3*c.entity_indices[1][1];
+    dofs[7] = offset + 3*c.entity_indices[1][1] + 1;
+    dofs[8] = offset + 3*c.entity_indices[1][1] + 2;
+    dofs[9] = offset + 3*c.entity_indices[1][2];
+    dofs[10] = offset + 3*c.entity_indices[1][2] + 1;
+    dofs[11] = offset + 3*c.entity_indices[1][2] + 2;
+    offset += 3*num_global_entities[1];
+    dofs[12] = offset + 3*c.entity_indices[2][0];
+    dofs[13] = offset + 3*c.entity_indices[2][0] + 1;
+    dofs[14] = offset + 3*c.entity_indices[2][0] + 2;
+    offset += 3*num_global_entities[2];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson2d_4_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 6;
+      dofs[3] = 7;
+      dofs[4] = 8;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 9;
+      dofs[3] = 10;
+      dofs[4] = 11;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson2d_4_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+        dofs[2] = 5;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 6;
+        dofs[1] = 7;
+        dofs[2] = 8;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 9;
+        dofs[1] = 10;
+        dofs[2] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 12;
+      dofs[1] = 13;
+      dofs[2] = 14;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson2d_4_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[8][0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[4];
+    dof_coordinates[8][1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[2];
+    dof_coordinates[9][1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[3];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[11][0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[3];
+    dof_coordinates[12][0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+    dof_coordinates[12][1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+    dof_coordinates[13][0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+    dof_coordinates[13][1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+    dof_coordinates[14][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[14][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson2d_4_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson2d_4_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson2d_4_dofmap_0::create() const
+{
+    return new poisson2d_4_dofmap_0();
+}
+
+/// Constructor
+poisson2d_4_cell_integral_0_otherwise::poisson2d_4_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_4_cell_integral_0_otherwise::~poisson2d_4_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_4_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_4_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 599
+    // Total number of operations (multiply-add pairs):                  610
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.373015873015877*G0_0_0 + 0.373015873015877*G0_0_1 + 0.373015873015877*G0_1_0 + 0.373015873015877*G0_1_1;
+    A[1] = 0.0566137566137574*G0_0_0 + 0.0566137566137574*G0_1_0;
+    A[2] = 0.0566137566137574*G0_0_1 + 0.0566137566137575*G0_1_1;
+    A[3] = 0.0423280423280444*G0_0_0 + 0.0423280423280434*G0_0_1 + 0.0423280423280446*G0_1_0 + 0.0423280423280436*G0_1_1;
+    A[4] = 0.0423280423280459*G0_0_0 + 0.0423280423280453*G0_0_1 + 0.0423280423280455*G0_1_0 + 0.0423280423280451*G0_1_1;
+    A[5] = 0.0423280423280438*G0_0_0 + 0.0423280423280449*G0_0_1 + 0.042328042328044*G0_1_0 + 0.0423280423280448*G0_1_1;
+    A[6] = 0.126984126984126*G0_0_0 - 0.651851851851859*G0_0_1 + 0.126984126984126*G0_1_0 - 0.651851851851859*G0_1_1;
+    A[7] = 0.0423280423280438*G0_0_0 + 0.467724867724873*G0_0_1 + 0.0423280423280439*G0_1_0 + 0.467724867724874*G0_1_1;
+    A[8] = -0.0423280423280437*G0_0_0 - 0.245502645502649*G0_0_1 - 0.042328042328044*G0_1_0 - 0.245502645502649*G0_1_1;
+    A[9] = -0.65185185185186*G0_0_0 + 0.126984126984127*G0_0_1 - 0.65185185185186*G0_1_0 + 0.126984126984127*G0_1_1;
+    A[10] = 0.467724867724874*G0_0_0 + 0.0423280423280441*G0_0_1 + 0.467724867724873*G0_1_0 + 0.0423280423280439*G0_1_1;
+    A[11] = -0.245502645502648*G0_0_0 - 0.0423280423280432*G0_0_1 - 0.245502645502648*G0_1_0 - 0.0423280423280434*G0_1_1;
+    A[12] = -0.0846560846560822*G0_0_0 - 0.0846560846560829*G0_0_1 - 0.0846560846560823*G0_1_0 - 0.0846560846560832*G0_1_1;
+    A[13] = -0.0846560846560885*G0_0_0 - 0.0846560846560903*G0_0_1 - 0.0846560846560885*G0_1_0 - 0.08465608465609*G0_1_1;
+    A[14] = -0.0846560846560897*G0_0_0 - 0.0846560846560879*G0_0_1 - 0.0846560846560895*G0_1_0 - 0.0846560846560877*G0_1_1;
+    A[15] = 0.0566137566137574*G0_0_0 + 0.0566137566137574*G0_0_1;
+    A[16] = 0.373015873015877*G0_0_0;
+    A[17] = -0.0566137566137574*G0_0_1;
+    A[18] = 0.126984126984127*G0_0_0 + 0.778835978835987*G0_0_1;
+    A[19] = 0.0423280423280435*G0_0_0 - 0.425396825396831*G0_0_1;
+    A[20] = -0.0423280423280436*G0_0_0 + 0.203174603174605*G0_0_1;
+    A[21] = 0.0423280423280445*G0_0_0;
+    A[22] = 0.0423280423280448*G0_0_0;
+    A[23] = 0.0423280423280436*G0_0_0;
+    A[24] = -0.245502645502648*G0_0_0 - 0.203174603174604*G0_0_1;
+    A[25] = 0.467724867724873*G0_0_0 + 0.42539682539683*G0_0_1;
+    A[26] = -0.651851851851859*G0_0_0 - 0.778835978835987*G0_0_1;
+    A[27] = -0.084656084656088*G0_0_0;
+    A[28] = -0.0846560846560835*G0_0_0;
+    A[29] = -0.0846560846560884*G0_0_0;
+    A[30] = 0.0566137566137574*G0_1_0 + 0.0566137566137575*G0_1_1;
+    A[31] = -0.0566137566137574*G0_1_0;
+    A[32] = 0.373015873015877*G0_1_1;
+    A[33] = 0.203174603174604*G0_1_0 - 0.0423280423280443*G0_1_1;
+    A[34] = -0.425396825396829*G0_1_0 + 0.0423280423280436*G0_1_1;
+    A[35] = 0.778835978835987*G0_1_0 + 0.126984126984128*G0_1_1;
+    A[36] = -0.203174603174604*G0_1_0 - 0.245502645502648*G0_1_1;
+    A[37] = 0.425396825396829*G0_1_0 + 0.467724867724873*G0_1_1;
+    A[38] = -0.778835978835987*G0_1_0 - 0.651851851851859*G0_1_1;
+    A[39] = 0.0423280423280447*G0_1_1;
+    A[40] = 0.042328042328046*G0_1_1;
+    A[41] = 0.0423280423280441*G0_1_1;
+    A[42] = -0.0846560846560878*G0_1_1;
+    A[43] = -0.0846560846560897*G0_1_1;
+    A[44] = -0.0846560846560845*G0_1_1;
+    A[45] = 0.0423280423280444*G0_0_0 + 0.0423280423280446*G0_0_1 + 0.0423280423280434*G0_1_0 + 0.0423280423280435*G0_1_1;
+    A[46] = 0.126984126984127*G0_0_0 + 0.778835978835987*G0_1_0;
+    A[47] = 0.203174603174604*G0_0_1 - 0.0423280423280443*G0_1_1;
+    A[48] = 1.82857142857145*G0_0_0 + 1.04973544973546*G0_0_1 + 1.04973544973546*G0_1_0 + 2.09947089947092*G0_1_1;
+    A[49] = -0.660317460317463*G0_0_0 + 0.821164021164033*G0_0_1 - 0.296296296296296*G0_1_0 - 0.761904761904773*G0_1_1;
+    A[50] = 0.338624338624343*G0_0_0 - 0.44021164021164*G0_0_1 + 0.101587301587301*G0_1_0 + 0.338624338624346*G0_1_1;
+    A[51] = -0.203174603174608*G0_0_0 - 0.101587301587306*G0_0_1 - 0.101587301587301*G0_1_0;
+    A[52] = -0.152380952380962*G0_0_0 - 0.0423280423280473*G0_0_1 - 0.0423280423280444*G0_1_0;
+    A[53] = -0.338624338624343*G0_0_0 - 0.101587301587295*G0_0_1 - 0.101587301587301*G0_1_0;
+    A[54] = -0.135449735449744*G0_0_0 - 0.237037037037046*G0_0_1 - 0.237037037037042*G0_1_0 - 0.338624338624343*G0_1_1;
+    A[55] = 0.101587301587313*G0_0_0 + 0.46560846560848*G0_0_1 + 0.465608465608474*G0_1_0 + 0.761904761904771*G0_1_1;
+    A[56] = -0.13544973544974*G0_0_0 - 1.04973544973546*G0_0_1 - 1.04973544973546*G0_1_0 - 2.09947089947092*G0_1_1;
+    A[57] = 0.812698412698437*G0_0_0 + 0.338624338624355*G0_0_1 + 0.338624338624345*G0_1_0;
+    A[58] = -2.43809523809527*G0_0_0 - 1.28677248677251*G0_0_1 - 1.2867724867725*G0_1_0;
+    A[59] = 0.812698412698423*G0_0_0 + 0.338624338624331*G0_0_1 + 0.33862433862434*G0_1_0;
+    A[60] = 0.0423280423280459*G0_0_0 + 0.0423280423280455*G0_0_1 + 0.0423280423280453*G0_1_0 + 0.0423280423280451*G0_1_1;
+    A[61] = 0.0423280423280435*G0_0_0 - 0.425396825396831*G0_1_0;
+    A[62] = -0.425396825396829*G0_0_1 + 0.0423280423280436*G0_1_1;
+    A[63] = -0.660317460317462*G0_0_0 - 0.296296296296296*G0_0_1 + 0.821164021164033*G0_1_0 - 0.761904761904773*G0_1_1;
+    A[64] = 2.45079365079368*G0_0_0 + 0.971428571428586*G0_0_1 + 0.971428571428586*G0_1_0 + 2.45079365079369*G0_1_1;
+    A[65] = -0.761904761904771*G0_0_0 + 0.821164021164033*G0_0_1 - 0.296296296296298*G0_1_0 - 0.660317460317466*G0_1_1;
+    A[66] = -0.152380952380965*G0_0_0 - 0.110052910052921*G0_0_1 - 0.110052910052919*G0_1_0 - 0.0677248677248744*G0_1_1;
+    A[67] = 0.393650793650818*G0_0_0 + 0.196825396825416*G0_0_1 + 0.196825396825406*G0_1_0 + 0.0507936507936562*G0_1_1;
+    A[68] = 0.761904761904771*G0_0_0 + 0.296296296296289*G0_0_1 + 0.296296296296298*G0_1_0 - 0.0677248677248703*G0_1_1;
+    A[69] = -0.067724867724876*G0_0_0 - 0.110052910052919*G0_0_1 - 0.110052910052921*G0_1_0 - 0.152380952380965*G0_1_1;
+    A[70] = 0.0507936507936557*G0_0_0 + 0.196825396825401*G0_0_1 + 0.196825396825414*G0_1_0 + 0.393650793650815*G0_1_1;
+    A[71] = -0.067724867724869*G0_0_0 + 0.296296296296296*G0_0_1 + 0.296296296296292*G0_1_0 + 0.761904761904774*G0_1_1;
+    A[72] = 0.406349206349235*G0_0_0 + 0.457142857142891*G0_0_1 + 0.457142857142888*G0_1_0 + 0.406349206349236*G0_1_1;
+    A[73] = 0.406349206349193*G0_0_0 - 1.16825396825399*G0_0_1 - 1.168253968254*G0_1_0 - 2.8444444444445*G0_1_1;
+    A[74] = -2.8444444444445*G0_0_0 - 1.168253968254*G0_0_1 - 1.16825396825399*G0_1_0 + 0.406349206349194*G0_1_1;
+    A[75] = 0.0423280423280438*G0_0_0 + 0.042328042328044*G0_0_1 + 0.0423280423280449*G0_1_0 + 0.0423280423280448*G0_1_1;
+    A[76] = -0.0423280423280436*G0_0_0 + 0.203174603174605*G0_1_0;
+    A[77] = 0.778835978835987*G0_0_1 + 0.126984126984128*G0_1_1;
+    A[78] = 0.338624338624343*G0_0_0 + 0.101587301587301*G0_0_1 - 0.44021164021164*G0_1_0 + 0.338624338624346*G0_1_1;
+    A[79] = -0.761904761904771*G0_0_0 - 0.296296296296298*G0_0_1 + 0.821164021164033*G0_1_0 - 0.660317460317466*G0_1_1;
+    A[80] = 2.09947089947092*G0_0_0 + 1.04973544973546*G0_0_1 + 1.04973544973546*G0_1_0 + 1.82857142857145*G0_1_1;
+    A[81] = -0.338624338624341*G0_0_0 - 0.237037037037042*G0_0_1 - 0.237037037037046*G0_1_0 - 0.135449735449745*G0_1_1;
+    A[82] = 0.761904761904769*G0_0_0 + 0.465608465608472*G0_0_1 + 0.465608465608478*G0_1_0 + 0.101587301587313*G0_1_1;
+    A[83] = -2.09947089947092*G0_0_0 - 1.04973544973546*G0_0_1 - 1.04973544973546*G0_1_0 - 0.13544973544974*G0_1_1;
+    A[84] = -0.101587301587302*G0_0_1 - 0.101587301587307*G0_1_0 - 0.20317460317461*G0_1_1;
+    A[85] = -0.0423280423280418*G0_0_1 - 0.0423280423280461*G0_1_0 - 0.152380952380962*G0_1_1;
+    A[86] = -0.101587301587302*G0_0_1 - 0.101587301587297*G0_1_0 - 0.338624338624347*G0_1_1;
+    A[87] = 0.338624338624346*G0_0_1 + 0.338624338624357*G0_1_0 + 0.81269841269844*G0_1_1;
+    A[88] = 0.338624338624339*G0_0_1 + 0.338624338624329*G0_1_0 + 0.812698412698428*G0_1_1;
+    A[89] = -1.2867724867725*G0_0_1 - 1.28677248677251*G0_1_0 - 2.43809523809528*G0_1_1;
+    A[90] = 0.126984126984126*G0_0_0 + 0.126984126984126*G0_0_1 - 0.65185185185186*G0_1_0 - 0.651851851851859*G0_1_1;
+    A[91] = 0.0423280423280445*G0_0_0;
+    A[92] = -0.203174603174604*G0_0_1 - 0.245502645502648*G0_1_1;
+    A[93] = -0.203174603174608*G0_0_0 - 0.101587301587301*G0_0_1 - 0.101587301587306*G0_1_0;
+    A[94] = -0.152380952380965*G0_0_0 - 0.110052910052919*G0_0_1 - 0.110052910052921*G0_1_0 - 0.0677248677248743*G0_1_1;
+    A[95] = -0.338624338624341*G0_0_0 - 0.237037037037046*G0_0_1 - 0.237037037037042*G0_1_0 - 0.135449735449745*G0_1_1;
+    A[96] = 1.82857142857145*G0_0_0 + 0.778835978835992*G0_0_1 + 0.778835978835992*G0_1_0 + 1.82857142857145*G0_1_1;
+    A[97] = -0.660317460317465*G0_0_0 - 1.4814814814815*G0_0_1 - 0.364021164021168*G0_1_0 - 1.94708994708997*G0_1_1;
+    A[98] = 0.338624338624342*G0_0_0 + 0.778835978835985*G0_0_1 + 0.237037037037042*G0_1_0 + 1.01587301587303*G0_1_1;
+    A[99] = -0.13544973544974*G0_0_0 + 0.914285714285715*G0_0_1 + 0.914285714285721*G0_1_0 - 0.13544973544974*G0_1_1;
+    A[100] = 0.101587301587312*G0_0_0 - 0.364021164021168*G0_0_1 - 0.364021164021161*G0_1_0 - 0.0677248677248713*G0_1_1;
+    A[101] = -0.135449735449743*G0_0_0 + 0.101587301587302*G0_0_1 + 0.101587301587299*G0_1_0;
+    A[102] = -2.43809523809528*G0_0_0 - 1.15132275132276*G0_0_1 - 1.15132275132278*G0_1_0 + 0.135449735449737*G0_1_1;
+    A[103] = 0.812698412698438*G0_0_0 + 0.474074074074087*G0_0_1 + 0.474074074074093*G0_1_0 + 0.135449735449747*G0_1_1;
+    A[104] = 0.81269841269843*G0_0_0 + 0.474074074074093*G0_0_1 + 0.474074074074089*G0_1_0 + 0.135449735449746*G0_1_1;
+    A[105] = 0.0423280423280438*G0_0_0 + 0.0423280423280439*G0_0_1 + 0.467724867724873*G0_1_0 + 0.467724867724874*G0_1_1;
+    A[106] = 0.0423280423280448*G0_0_0;
+    A[107] = 0.425396825396829*G0_0_1 + 0.467724867724873*G0_1_1;
+    A[108] = -0.152380952380962*G0_0_0 - 0.0423280423280444*G0_0_1 - 0.0423280423280473*G0_1_0;
+    A[109] = 0.393650793650818*G0_0_0 + 0.196825396825406*G0_0_1 + 0.196825396825416*G0_1_0 + 0.0507936507936562*G0_1_1;
+    A[110] = 0.761904761904769*G0_0_0 + 0.465608465608478*G0_0_1 + 0.465608465608472*G0_1_0 + 0.101587301587313*G0_1_1;
+    A[111] = -0.660317460317465*G0_0_0 - 0.364021164021168*G0_0_1 - 1.4814814814815*G0_1_0 - 1.94708994708997*G0_1_1;
+    A[112] = 2.45079365079369*G0_0_0 + 1.4793650793651*G0_0_1 + 1.4793650793651*G0_1_0 + 2.9587301587302*G0_1_1;
+    A[113] = -0.761904761904769*G0_0_0 - 1.58306878306881*G0_0_1 - 0.465608465608472*G0_1_0 - 1.94708994708997*G0_1_1;
+    A[114] = -0.0677248677248693*G0_0_0 - 0.364021164021167*G0_0_1 - 0.36402116402116*G0_1_0 + 0.101587301587313*G0_1_1;
+    A[115] = 0.0507936507936544*G0_0_0 - 0.146031746031745*G0_0_1 - 0.146031746031758*G0_1_0 + 0.0507936507936567*G0_1_1;
+    A[116] = -0.0677248677248737*G0_0_0 + 0.0423280423280432*G0_0_1 + 0.0423280423280455*G0_1_0;
+    A[117] = 0.406349206349202*G0_0_0 + 1.57460317460319*G0_0_1 + 1.5746031746032*G0_1_0 - 0.101587301587311*G0_1_1;
+    A[118] = 0.406349206349225*G0_0_0 - 0.0507936507936589*G0_0_1 - 0.0507936507936557*G0_1_0 - 0.101587301587314*G0_1_1;
+    A[119] = -2.84444444444451*G0_0_0 - 1.6761904761905*G0_0_1 - 1.67619047619052*G0_1_0 - 0.101587301587313*G0_1_1;
+    A[120] = -0.0423280423280437*G0_0_0 - 0.042328042328044*G0_0_1 - 0.245502645502649*G0_1_0 - 0.245502645502649*G0_1_1;
+    A[121] = 0.0423280423280436*G0_0_0;
+    A[122] = -0.778835978835987*G0_0_1 - 0.651851851851859*G0_1_1;
+    A[123] = -0.338624338624343*G0_0_0 - 0.101587301587301*G0_0_1 - 0.101587301587295*G0_1_0;
+    A[124] = 0.761904761904771*G0_0_0 + 0.296296296296298*G0_0_1 + 0.296296296296289*G0_1_0 - 0.0677248677248703*G0_1_1;
+    A[125] = -2.09947089947092*G0_0_0 - 1.04973544973546*G0_0_1 - 1.04973544973546*G0_1_0 - 0.13544973544974*G0_1_1;
+    A[126] = 0.338624338624342*G0_0_0 + 0.237037037037042*G0_0_1 + 0.778835978835985*G0_1_0 + 1.01587301587303*G0_1_1;
+    A[127] = -0.761904761904769*G0_0_0 - 0.465608465608472*G0_0_1 - 1.58306878306881*G0_1_0 - 1.94708994708997*G0_1_1;
+    A[128] = 2.09947089947092*G0_0_0 + 1.04973544973546*G0_0_1 + 1.04973544973546*G0_1_0 + 1.82857142857145*G0_1_1;
+    A[129] = 0.101587301587302*G0_0_1 + 0.101587301587298*G0_1_0 - 0.135449735449745*G0_1_1;
+    A[130] = 0.0423280423280418*G0_0_1 + 0.042328042328046*G0_1_0 - 0.0677248677248755*G0_1_1;
+    A[131] = 0.101587301587302*G0_0_1 + 0.101587301587306*G0_1_0;
+    A[132] = -0.338624338624346*G0_0_1 - 0.338624338624342*G0_1_0 + 0.135449735449746*G0_1_1;
+    A[133] = -0.338624338624339*G0_0_1 - 0.338624338624348*G0_1_0 + 0.135449735449746*G0_1_1;
+    A[134] = 1.2867724867725*G0_0_1 + 1.28677248677252*G0_1_0 + 0.135449735449738*G0_1_1;
+    A[135] = -0.65185185185186*G0_0_0 - 0.651851851851859*G0_0_1 + 0.126984126984127*G0_1_0 + 0.126984126984127*G0_1_1;
+    A[136] = -0.245502645502648*G0_0_0 - 0.203174603174604*G0_1_0;
+    A[137] = 0.0423280423280447*G0_1_1;
+    A[138] = -0.135449735449744*G0_0_0 - 0.237037037037042*G0_0_1 - 0.237037037037046*G0_1_0 - 0.338624338624343*G0_1_1;
+    A[139] = -0.067724867724876*G0_0_0 - 0.110052910052921*G0_0_1 - 0.110052910052919*G0_1_0 - 0.152380952380965*G0_1_1;
+    A[140] = -0.101587301587307*G0_0_1 - 0.101587301587302*G0_1_0 - 0.20317460317461*G0_1_1;
+    A[141] = -0.13544973544974*G0_0_0 + 0.914285714285721*G0_0_1 + 0.914285714285715*G0_1_0 - 0.13544973544974*G0_1_1;
+    A[142] = -0.0677248677248693*G0_0_0 - 0.36402116402116*G0_0_1 - 0.364021164021167*G0_1_0 + 0.101587301587313*G0_1_1;
+    A[143] = 0.101587301587298*G0_0_1 + 0.101587301587302*G0_1_0 - 0.135449735449745*G0_1_1;
+    A[144] = 1.82857142857145*G0_0_0 + 0.778835978835991*G0_0_1 + 0.778835978835991*G0_1_0 + 1.82857142857145*G0_1_1;
+    A[145] = -1.94708994708997*G0_0_0 - 0.364021164021168*G0_0_1 - 1.4814814814815*G0_1_0 - 0.660317460317464*G0_1_1;
+    A[146] = 1.01587301587303*G0_0_0 + 0.237037037037041*G0_0_1 + 0.778835978835984*G0_1_0 + 0.338624338624343*G0_1_1;
+    A[147] = 0.135449735449736*G0_0_0 - 1.15132275132278*G0_0_1 - 1.15132275132276*G0_1_0 - 2.43809523809528*G0_1_1;
+    A[148] = 0.135449735449748*G0_0_0 + 0.47407407407409*G0_0_1 + 0.474074074074094*G0_1_0 + 0.812698412698428*G0_1_1;
+    A[149] = 0.135449735449745*G0_0_0 + 0.474074074074091*G0_0_1 + 0.474074074074087*G0_1_0 + 0.812698412698441*G0_1_1;
+    A[150] = 0.467724867724874*G0_0_0 + 0.467724867724873*G0_0_1 + 0.0423280423280441*G0_1_0 + 0.0423280423280439*G0_1_1;
+    A[151] = 0.467724867724873*G0_0_0 + 0.42539682539683*G0_1_0;
+    A[152] = 0.042328042328046*G0_1_1;
+    A[153] = 0.101587301587313*G0_0_0 + 0.465608465608474*G0_0_1 + 0.46560846560848*G0_1_0 + 0.761904761904771*G0_1_1;
+    A[154] = 0.0507936507936556*G0_0_0 + 0.196825396825414*G0_0_1 + 0.196825396825401*G0_1_0 + 0.393650793650815*G0_1_1;
+    A[155] = -0.0423280423280461*G0_0_1 - 0.0423280423280418*G0_1_0 - 0.152380952380962*G0_1_1;
+    A[156] = 0.101587301587312*G0_0_0 - 0.364021164021161*G0_0_1 - 0.364021164021168*G0_1_0 - 0.0677248677248713*G0_1_1;
+    A[157] = 0.0507936507936544*G0_0_0 - 0.146031746031758*G0_0_1 - 0.146031746031745*G0_1_0 + 0.0507936507936567*G0_1_1;
+    A[158] = 0.042328042328046*G0_0_1 + 0.0423280423280417*G0_1_0 - 0.0677248677248755*G0_1_1;
+    A[159] = -1.94708994708997*G0_0_0 - 1.4814814814815*G0_0_1 - 0.364021164021168*G0_1_0 - 0.660317460317464*G0_1_1;
+    A[160] = 2.9587301587302*G0_0_0 + 1.4793650793651*G0_0_1 + 1.4793650793651*G0_1_0 + 2.45079365079369*G0_1_1;
+    A[161] = -1.94708994708997*G0_0_0 - 0.465608465608473*G0_0_1 - 1.58306878306881*G0_1_0 - 0.76190476190477*G0_1_1;
+    A[162] = -0.101587301587311*G0_0_0 + 1.5746031746032*G0_0_1 + 1.57460317460319*G0_1_0 + 0.406349206349198*G0_1_1;
+    A[163] = -0.101587301587315*G0_0_0 - 1.67619047619052*G0_0_1 - 1.6761904761905*G0_1_0 - 2.84444444444451*G0_1_1;
+    A[164] = -0.10158730158731*G0_0_0 - 0.0507936507936535*G0_0_1 - 0.050793650793656*G0_1_0 + 0.406349206349228*G0_1_1;
+    A[165] = -0.245502645502648*G0_0_0 - 0.245502645502648*G0_0_1 - 0.0423280423280432*G0_1_0 - 0.0423280423280434*G0_1_1;
+    A[166] = -0.65185185185186*G0_0_0 - 0.778835978835987*G0_1_0;
+    A[167] = 0.042328042328044*G0_1_1;
+    A[168] = -0.13544973544974*G0_0_0 - 1.04973544973546*G0_0_1 - 1.04973544973546*G0_1_0 - 2.09947089947092*G0_1_1;
+    A[169] = -0.067724867724869*G0_0_0 + 0.296296296296292*G0_0_1 + 0.296296296296296*G0_1_0 + 0.761904761904774*G0_1_1;
+    A[170] = -0.101587301587297*G0_0_1 - 0.101587301587302*G0_1_0 - 0.338624338624347*G0_1_1;
+    A[171] = -0.135449735449743*G0_0_0 + 0.101587301587298*G0_0_1 + 0.101587301587302*G0_1_0;
+    A[172] = -0.0677248677248737*G0_0_0 + 0.0423280423280455*G0_0_1 + 0.0423280423280432*G0_1_0;
+    A[173] = 0.101587301587306*G0_0_1 + 0.101587301587302*G0_1_0;
+    A[174] = 1.01587301587303*G0_0_0 + 0.778835978835984*G0_0_1 + 0.237037037037041*G0_1_0 + 0.338624338624343*G0_1_1;
+    A[175] = -1.94708994708997*G0_0_0 - 1.58306878306881*G0_0_1 - 0.465608465608473*G0_1_0 - 0.76190476190477*G0_1_1;
+    A[176] = 1.82857142857145*G0_0_0 + 1.04973544973546*G0_0_1 + 1.04973544973546*G0_1_0 + 2.09947089947092*G0_1_1;
+    A[177] = 0.135449735449746*G0_0_0 - 0.338624338624338*G0_0_1 - 0.338624338624345*G0_1_0;
+    A[178] = 0.135449735449737*G0_0_0 + 1.28677248677251*G0_0_1 + 1.2867724867725*G0_1_0;
+    A[179] = 0.135449735449743*G0_0_0 - 0.338624338624349*G0_0_1 - 0.338624338624339*G0_1_0;
+    A[180] = -0.0846560846560822*G0_0_0 - 0.0846560846560823*G0_0_1 - 0.0846560846560829*G0_1_0 - 0.0846560846560832*G0_1_1;
+    A[181] = -0.084656084656088*G0_0_0;
+    A[182] = -0.0846560846560878*G0_1_1;
+    A[183] = 0.812698412698437*G0_0_0 + 0.338624338624345*G0_0_1 + 0.338624338624356*G0_1_0;
+    A[184] = 0.406349206349235*G0_0_0 + 0.457142857142888*G0_0_1 + 0.457142857142891*G0_1_0 + 0.406349206349236*G0_1_1;
+    A[185] = 0.338624338624356*G0_0_1 + 0.338624338624346*G0_1_0 + 0.81269841269844*G0_1_1;
+    A[186] = -2.43809523809528*G0_0_0 - 1.15132275132278*G0_0_1 - 1.15132275132276*G0_1_0 + 0.135449735449737*G0_1_1;
+    A[187] = 0.406349206349202*G0_0_0 + 1.5746031746032*G0_0_1 + 1.57460317460319*G0_1_0 - 0.101587301587311*G0_1_1;
+    A[188] = -0.338624338624342*G0_0_1 - 0.338624338624346*G0_1_0 + 0.135449735449746*G0_1_1;
+    A[189] = 0.135449735449736*G0_0_0 - 1.15132275132276*G0_0_1 - 1.15132275132278*G0_1_0 - 2.43809523809528*G0_1_1;
+    A[190] = -0.10158730158731*G0_0_0 + 1.57460317460319*G0_0_1 + 1.5746031746032*G0_1_0 + 0.406349206349198*G0_1_1;
+    A[191] = 0.135449735449746*G0_0_0 - 0.338624338624345*G0_0_1 - 0.338624338624338*G0_1_0;
+    A[192] = 5.68888888888897*G0_0_0 + 2.84444444444447*G0_0_1 + 2.84444444444447*G0_1_0 + 5.68888888888897*G0_1_1;
+    A[193] = -4.06349206349213*G0_0_0 - 2.03174603174608*G0_0_1 - 2.03174603174606*G0_1_0 - 0.812698412698431*G0_1_1;
+    A[194] = -0.812698412698436*G0_0_0 - 2.03174603174606*G0_0_1 - 2.03174603174608*G0_1_0 - 4.06349206349214*G0_1_1;
+    A[195] = -0.0846560846560885*G0_0_0 - 0.0846560846560885*G0_0_1 - 0.0846560846560903*G0_1_0 - 0.08465608465609*G0_1_1;
+    A[196] = -0.0846560846560835*G0_0_0;
+    A[197] = -0.0846560846560897*G0_1_1;
+    A[198] = -2.43809523809527*G0_0_0 - 1.2867724867725*G0_0_1 - 1.28677248677251*G0_1_0;
+    A[199] = 0.406349206349193*G0_0_0 - 1.168253968254*G0_0_1 - 1.16825396825399*G0_1_0 - 2.8444444444445*G0_1_1;
+    A[200] = 0.33862433862433*G0_0_1 + 0.338624338624339*G0_1_0 + 0.812698412698428*G0_1_1;
+    A[201] = 0.812698412698438*G0_0_0 + 0.474074074074093*G0_0_1 + 0.474074074074087*G0_1_0 + 0.135449735449747*G0_1_1;
+    A[202] = 0.406349206349225*G0_0_0 - 0.0507936507936558*G0_0_1 - 0.0507936507936588*G0_1_0 - 0.101587301587314*G0_1_1;
+    A[203] = -0.338624338624348*G0_0_1 - 0.338624338624339*G0_1_0 + 0.135449735449746*G0_1_1;
+    A[204] = 0.135449735449748*G0_0_0 + 0.474074074074094*G0_0_1 + 0.47407407407409*G0_1_0 + 0.812698412698428*G0_1_1;
+    A[205] = -0.101587301587315*G0_0_0 - 1.6761904761905*G0_0_1 - 1.67619047619052*G0_1_0 - 2.84444444444451*G0_1_1;
+    A[206] = 0.135449735449737*G0_0_0 + 1.2867724867725*G0_0_1 + 1.28677248677251*G0_1_0;
+    A[207] = -4.06349206349213*G0_0_0 - 2.03174603174606*G0_0_1 - 2.03174603174608*G0_1_0 - 0.812698412698431*G0_1_1;
+    A[208] = 5.68888888888897*G0_0_0 + 2.84444444444451*G0_0_1 + 2.84444444444451*G0_1_0 + 5.68888888888901*G0_1_1;
+    A[209] = -0.812698412698417*G0_0_0 + 1.21904761904764*G0_0_1 + 1.21904761904765*G0_1_0 - 0.812698412698424*G0_1_1;
+    A[210] = -0.0846560846560898*G0_0_0 - 0.0846560846560895*G0_0_1 - 0.084656084656088*G0_1_0 - 0.0846560846560877*G0_1_1;
+    A[211] = -0.0846560846560883*G0_0_0;
+    A[212] = -0.0846560846560845*G0_1_1;
+    A[213] = 0.812698412698423*G0_0_0 + 0.33862433862434*G0_0_1 + 0.338624338624331*G0_1_0;
+    A[214] = -2.8444444444445*G0_0_0 - 1.16825396825399*G0_0_1 - 1.168253968254*G0_1_0 + 0.406349206349194*G0_1_1;
+    A[215] = -1.28677248677251*G0_0_1 - 1.2867724867725*G0_1_0 - 2.43809523809528*G0_1_1;
+    A[216] = 0.81269841269843*G0_0_0 + 0.474074074074089*G0_0_1 + 0.474074074074093*G0_1_0 + 0.135449735449746*G0_1_1;
+    A[217] = -2.84444444444451*G0_0_0 - 1.67619047619052*G0_0_1 - 1.6761904761905*G0_1_0 - 0.101587301587313*G0_1_1;
+    A[218] = 1.28677248677252*G0_0_1 + 1.2867724867725*G0_1_0 + 0.135449735449738*G0_1_1;
+    A[219] = 0.135449735449745*G0_0_0 + 0.474074074074087*G0_0_1 + 0.474074074074091*G0_1_0 + 0.812698412698441*G0_1_1;
+    A[220] = -0.10158730158731*G0_0_0 - 0.050793650793656*G0_0_1 - 0.0507936507936534*G0_1_0 + 0.406349206349228*G0_1_1;
+    A[221] = 0.135449735449743*G0_0_0 - 0.338624338624339*G0_0_1 - 0.338624338624349*G0_1_0;
+    A[222] = -0.812698412698436*G0_0_0 - 2.03174603174608*G0_0_1 - 2.03174603174606*G0_1_0 - 4.06349206349214*G0_1_1;
+    A[223] = -0.812698412698417*G0_0_0 + 1.21904761904765*G0_0_1 + 1.21904761904764*G0_1_0 - 0.812698412698424*G0_1_1;
+    A[224] = 5.68888888888901*G0_0_0 + 2.84444444444451*G0_0_1 + 2.84444444444451*G0_1_0 + 5.68888888888898*G0_1_1;
+}
+
+/// Constructor
+poisson2d_4_cell_integral_1_otherwise::poisson2d_4_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_4_cell_integral_1_otherwise::~poisson2d_4_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_4_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_4_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    15
+    // Number of operations (multiply-add pairs) for tensor contraction: 205
+    // Total number of operations (multiply-add pairs):                  223
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    const double G0_10 = det*w[0][10]*(1.0);
+    const double G0_11 = det*w[0][11]*(1.0);
+    const double G0_12 = det*w[0][12]*(1.0);
+    const double G0_13 = det*w[0][13]*(1.0);
+    const double G0_14 = det*w[0][14]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00255731922398588*G0_0 - 0.000238095238095237*G0_1 - 0.000238095238095236*G0_2 - 0.000987654320987651*G0_3 - 0.000105820105820103*G0_4 - 0.000987654320987653*G0_5 + 0.00141093474426806*G0_6 - 0.000705467372134029*G0_7 + 0.00141093474426807*G0_9 - 0.000705467372134032*G0_10 + 0.00141093474426807*G0_12 - 0.00141093474426807*G0_13 - 0.00141093474426807*G0_14;
+    A[1] = -0.000238095238095237*G0_0 + 0.00255731922398588*G0_1 - 0.000238095238095236*G0_2 + 0.00141093474426807*G0_3 - 0.000705467372134036*G0_4 - 0.00098765432098765*G0_6 - 0.000105820105820106*G0_7 - 0.000987654320987649*G0_8 - 0.000705467372134035*G0_10 + 0.00141093474426807*G0_11 - 0.00141093474426807*G0_12 + 0.00141093474426808*G0_13 - 0.00141093474426807*G0_14;
+    A[2] = -0.000238095238095236*G0_0 - 0.000238095238095236*G0_1 + 0.00255731922398588*G0_2 - 0.000705467372134034*G0_4 + 0.00141093474426807*G0_5 - 0.000705467372134036*G0_7 + 0.00141093474426807*G0_8 - 0.00098765432098765*G0_9 - 0.000105820105820104*G0_10 - 0.00098765432098765*G0_11 - 0.00141093474426807*G0_12 - 0.00141093474426808*G0_13 + 0.00141093474426805*G0_14;
+    A[3] = -0.000987654320987651*G0_0 + 0.00141093474426807*G0_1 + 0.0225749559082891*G0_3 - 0.0112874779541446*G0_4 + 0.00677248677248674*G0_5 + 0.00225749559082891*G0_6 + 0.000564373897707235*G0_7 + 0.00451499118165783*G0_8 + 0.00451499118165783*G0_9 - 0.00846560846560843*G0_10 + 0.0112874779541446*G0_11 - 0.00225749559082892*G0_12 + 0.0112874779541446*G0_13 + 0.00225749559082891*G0_14;
+    A[4] = -0.000105820105820103*G0_0 - 0.000705467372134036*G0_1 - 0.000705467372134034*G0_2 - 0.0112874779541446*G0_3 + 0.0279365079365078*G0_4 - 0.0112874779541446*G0_5 + 0.000564373897707244*G0_6 + 0.000423280423280403*G0_7 - 0.00846560846560841*G0_8 + 0.000564373897707238*G0_9 + 0.00042328042328042*G0_10 - 0.00846560846560842*G0_11 - 0.00677248677248672*G0_12 + 0.00338624338624336*G0_13 + 0.00338624338624339*G0_14;
+    A[5] = -0.000987654320987653*G0_0 + 0.00141093474426807*G0_2 + 0.00677248677248674*G0_3 - 0.0112874779541446*G0_4 + 0.0225749559082891*G0_5 + 0.00451499118165781*G0_6 - 0.00846560846560842*G0_7 + 0.0112874779541446*G0_8 + 0.0022574955908289*G0_9 + 0.000564373897707236*G0_10 + 0.00451499118165782*G0_11 - 0.00225749559082894*G0_12 + 0.00225749559082891*G0_13 + 0.0112874779541446*G0_14;
+    A[6] = 0.00141093474426806*G0_0 - 0.000987654320987649*G0_1 + 0.00225749559082891*G0_3 + 0.000564373897707244*G0_4 + 0.00451499118165781*G0_5 + 0.0225749559082891*G0_6 - 0.0112874779541446*G0_7 + 0.00677248677248673*G0_8 + 0.0112874779541446*G0_9 - 0.00846560846560842*G0_10 + 0.00451499118165782*G0_11 + 0.0112874779541446*G0_12 - 0.00225749559082892*G0_13 + 0.00225749559082889*G0_14;
+    A[7] = -0.000705467372134029*G0_0 - 0.000105820105820106*G0_1 - 0.000705467372134036*G0_2 + 0.000564373897707235*G0_3 + 0.000423280423280404*G0_4 - 0.00846560846560842*G0_5 - 0.0112874779541446*G0_6 + 0.0279365079365078*G0_7 - 0.0112874779541446*G0_8 - 0.00846560846560842*G0_9 + 0.000423280423280421*G0_10 + 0.000564373897707235*G0_11 + 0.00338624338624338*G0_12 - 0.00677248677248674*G0_13 + 0.00338624338624335*G0_14;
+    A[8] = -0.000987654320987649*G0_1 + 0.00141093474426807*G0_2 + 0.00451499118165783*G0_3 - 0.00846560846560841*G0_4 + 0.0112874779541446*G0_5 + 0.00677248677248673*G0_6 - 0.0112874779541446*G0_7 + 0.0225749559082891*G0_8 + 0.00451499118165782*G0_9 + 0.000564373897707234*G0_10 + 0.00225749559082891*G0_11 + 0.0022574955908289*G0_12 - 0.00225749559082892*G0_13 + 0.0112874779541446*G0_14;
+    A[9] = 0.00141093474426807*G0_0 - 0.00098765432098765*G0_2 + 0.00451499118165783*G0_3 + 0.000564373897707238*G0_4 + 0.0022574955908289*G0_5 + 0.0112874779541446*G0_6 - 0.00846560846560842*G0_7 + 0.00451499118165782*G0_8 + 0.0225749559082891*G0_9 - 0.0112874779541446*G0_10 + 0.00677248677248673*G0_11 + 0.0112874779541446*G0_12 + 0.00225749559082891*G0_13 - 0.00225749559082891*G0_14;
+    A[10] = -0.000705467372134032*G0_0 - 0.000705467372134035*G0_1 - 0.000105820105820103*G0_2 - 0.00846560846560843*G0_3 + 0.00042328042328042*G0_4 + 0.000564373897707236*G0_5 - 0.00846560846560842*G0_6 + 0.000423280423280421*G0_7 + 0.000564373897707234*G0_8 - 0.0112874779541446*G0_9 + 0.0279365079365078*G0_10 - 0.0112874779541446*G0_11 + 0.00338624338624338*G0_12 + 0.00338624338624338*G0_13 - 0.00677248677248672*G0_14;
+    A[11] = 0.00141093474426807*G0_1 - 0.00098765432098765*G0_2 + 0.0112874779541446*G0_3 - 0.00846560846560842*G0_4 + 0.00451499118165781*G0_5 + 0.00451499118165782*G0_6 + 0.000564373897707235*G0_7 + 0.00225749559082891*G0_8 + 0.00677248677248673*G0_9 - 0.0112874779541446*G0_10 + 0.0225749559082891*G0_11 + 0.00225749559082891*G0_12 + 0.0112874779541445*G0_13 - 0.00225749559082891*G0_14;
+    A[12] = 0.00141093474426807*G0_0 - 0.00141093474426807*G0_1 - 0.00141093474426807*G0_2 - 0.00225749559082892*G0_3 - 0.00677248677248672*G0_4 - 0.00225749559082894*G0_5 + 0.0112874779541446*G0_6 + 0.00338624338624338*G0_7 + 0.0022574955908289*G0_8 + 0.0112874779541446*G0_9 + 0.00338624338624339*G0_10 + 0.00225749559082891*G0_11 + 0.0948148148148144*G0_12 - 0.0135449735449735*G0_13 - 0.0135449735449735*G0_14;
+    A[13] = -0.00141093474426807*G0_0 + 0.00141093474426808*G0_1 - 0.00141093474426808*G0_2 + 0.0112874779541446*G0_3 + 0.00338624338624335*G0_4 + 0.00225749559082891*G0_5 - 0.00225749559082892*G0_6 - 0.00677248677248674*G0_7 - 0.00225749559082891*G0_8 + 0.00225749559082891*G0_9 + 0.00338624338624338*G0_10 + 0.0112874779541445*G0_11 - 0.0135449735449735*G0_12 + 0.0948148148148145*G0_13 - 0.0135449735449735*G0_14;
+    A[14] = -0.00141093474426807*G0_0 - 0.00141093474426807*G0_1 + 0.00141093474426805*G0_2 + 0.00225749559082891*G0_3 + 0.00338624338624339*G0_4 + 0.0112874779541446*G0_5 + 0.00225749559082889*G0_6 + 0.00338624338624335*G0_7 + 0.0112874779541446*G0_8 - 0.00225749559082891*G0_9 - 0.00677248677248672*G0_10 - 0.00225749559082891*G0_11 - 0.0135449735449735*G0_12 - 0.0135449735449735*G0_13 + 0.0948148148148144*G0_14;
+}
+
+/// Constructor
+poisson2d_4_form_0::poisson2d_4_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_4_form_0::~poisson2d_4_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_4_form_0::signature() const
+{
+    return "222f0a863535a3588ce6ab48c665de446a824c86571a9a59d472c73dba77ec660d1b8dcc7892fe0c58c718e1c7a90af2de706a8bc3f69e7a6b3ab66be2b83c99";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_4_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_4_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_4_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_4_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_4_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_4_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_4_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_4_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_4_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_4_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_4_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_4_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_4_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_4_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_4_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_4_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_4_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_4_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_4_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_4_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_4_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_4_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_4_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_4_form_0::create_default_cell_integral() const
+{
+    return new poisson2d_4_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_4_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_4_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_4_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_4_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson2d_4_form_1::poisson2d_4_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_4_form_1::~poisson2d_4_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_4_form_1::signature() const
+{
+    return "f268ff49ff08e46f0b767dc659d691059556f5a394d611c73efd7117de4e84bc4367a4620c0cd526d78ad1fdaa841d855a6a739f7d55db7edb1ad0d2150b6c14";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_4_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_4_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_4_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_4_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_4_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_4_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_4_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_4_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_4_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_4_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_4_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_4_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_4_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_4_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_4_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_4_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_4_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_4_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_4_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_4_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_4_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_4_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_4_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_4_form_1::create_default_cell_integral() const
+{
+    return new poisson2d_4_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_4_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_4_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_4_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_4_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson2D_4.h b/bench/fem/convergence/cpp/Poisson2D_4.h
new file mode 100644
index 0000000..365c416
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_4.h
@@ -0,0 +1,985 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON2D_4_H
+#define __POISSON2D_4_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2d_4_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2d_4_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson2d_4_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2d_4_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2d_4_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson2d_4_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_4_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_4_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_4_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_4_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_4_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_4_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_4_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_4_form_0();
+
+  /// Destructor
+  virtual ~poisson2d_4_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_4_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_4_form_1();
+
+  /// Destructor
+  virtual ~poisson2d_4_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2D_4
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_4_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_4_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_4_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_4_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson2D_4.ufl b/bench/fem/convergence/cpp/Poisson2D_4.ufl
new file mode 100644
index 0000000..7579b42
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_4.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#
+# Poisson's equation in 2D for q = 4
+
+element = FiniteElement("Lagrange", triangle, 4)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/Poisson2D_5.cpp b/bench/fem/convergence/cpp/Poisson2D_5.cpp
new file mode 100644
index 0000000..62060ee
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_5.cpp
@@ -0,0 +1,1805 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no-evaluate_basis:              True
+//   no-evaluate_basis_derivatives:  True
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson2D_5.h"
+
+/// Constructor
+poisson2d_5_finite_element_0::poisson2d_5_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_5_finite_element_0::~poisson2d_5_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson2d_5_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 5, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson2d_5_finite_element_0::cell_shape() const
+{
+    return ufc::triangle;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson2d_5_finite_element_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson2d_5_finite_element_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson2d_5_finite_element_0::space_dimension() const
+{
+    return 21;
+}
+
+/// Return the rank of the value space
+std::size_t poisson2d_5_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson2d_5_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson2d_5_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+throw std::runtime_error("// Function evaluate_basis not generated (compiled with -fno-evaluate_basis)");
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson2d_5_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 21; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson2d_5_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+throw std::runtime_error("// Function evaluate_basis_derivatives not generated (compiled with -fno-evaluate_basis_derivatives)");
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson2d_5_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 21; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 5)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[32];
+    for (unsigned int r = 0; r < 32; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 21; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson2d_5_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.8*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+      y[1] = 0.8*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.6*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+      y[1] = 0.6*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.4*vertex_coordinates[2] + 0.6*vertex_coordinates[4];
+      y[1] = 0.4*vertex_coordinates[3] + 0.6*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.2*vertex_coordinates[2] + 0.8*vertex_coordinates[4];
+      y[1] = 0.2*vertex_coordinates[3] + 0.8*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.8*vertex_coordinates[0] + 0.2*vertex_coordinates[4];
+      y[1] = 0.8*vertex_coordinates[1] + 0.2*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.6*vertex_coordinates[0] + 0.4*vertex_coordinates[4];
+      y[1] = 0.6*vertex_coordinates[1] + 0.4*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.4*vertex_coordinates[0] + 0.6*vertex_coordinates[4];
+      y[1] = 0.4*vertex_coordinates[1] + 0.6*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.2*vertex_coordinates[0] + 0.8*vertex_coordinates[4];
+      y[1] = 0.2*vertex_coordinates[1] + 0.8*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.8*vertex_coordinates[0] + 0.2*vertex_coordinates[2];
+      y[1] = 0.8*vertex_coordinates[1] + 0.2*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 12:
+      {
+        y[0] = 0.6*vertex_coordinates[0] + 0.4*vertex_coordinates[2];
+      y[1] = 0.6*vertex_coordinates[1] + 0.4*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 13:
+      {
+        y[0] = 0.4*vertex_coordinates[0] + 0.6*vertex_coordinates[2];
+      y[1] = 0.4*vertex_coordinates[1] + 0.6*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.2*vertex_coordinates[0] + 0.8*vertex_coordinates[2];
+      y[1] = 0.2*vertex_coordinates[1] + 0.8*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.6*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+      y[1] = 0.6*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.4*vertex_coordinates[0] + 0.4*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+      y[1] = 0.4*vertex_coordinates[1] + 0.4*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.2*vertex_coordinates[0] + 0.6*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+      y[1] = 0.2*vertex_coordinates[1] + 0.6*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.4*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+      y[1] = 0.4*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.2*vertex_coordinates[0] + 0.4*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+      y[1] = 0.2*vertex_coordinates[1] + 0.4*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 20:
+      {
+        y[0] = 0.2*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.6*vertex_coordinates[4];
+      y[1] = 0.2*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.6*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson2d_5_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.8*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+    y[1] = 0.8*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.6*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+    y[1] = 0.6*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.4*vertex_coordinates[2] + 0.6*vertex_coordinates[4];
+    y[1] = 0.4*vertex_coordinates[3] + 0.6*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.2*vertex_coordinates[2] + 0.8*vertex_coordinates[4];
+    y[1] = 0.2*vertex_coordinates[3] + 0.8*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.8*vertex_coordinates[0] + 0.2*vertex_coordinates[4];
+    y[1] = 0.8*vertex_coordinates[1] + 0.2*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.6*vertex_coordinates[0] + 0.4*vertex_coordinates[4];
+    y[1] = 0.6*vertex_coordinates[1] + 0.4*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.4*vertex_coordinates[0] + 0.6*vertex_coordinates[4];
+    y[1] = 0.4*vertex_coordinates[1] + 0.6*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = 0.2*vertex_coordinates[0] + 0.8*vertex_coordinates[4];
+    y[1] = 0.2*vertex_coordinates[1] + 0.8*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[0];
+    y[0] = 0.8*vertex_coordinates[0] + 0.2*vertex_coordinates[2];
+    y[1] = 0.8*vertex_coordinates[1] + 0.2*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[0];
+    y[0] = 0.6*vertex_coordinates[0] + 0.4*vertex_coordinates[2];
+    y[1] = 0.6*vertex_coordinates[1] + 0.4*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[12] = vals[0];
+    y[0] = 0.4*vertex_coordinates[0] + 0.6*vertex_coordinates[2];
+    y[1] = 0.4*vertex_coordinates[1] + 0.6*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[13] = vals[0];
+    y[0] = 0.2*vertex_coordinates[0] + 0.8*vertex_coordinates[2];
+    y[1] = 0.2*vertex_coordinates[1] + 0.8*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[14] = vals[0];
+    y[0] = 0.6*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+    y[1] = 0.6*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[15] = vals[0];
+    y[0] = 0.4*vertex_coordinates[0] + 0.4*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+    y[1] = 0.4*vertex_coordinates[1] + 0.4*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[16] = vals[0];
+    y[0] = 0.2*vertex_coordinates[0] + 0.6*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+    y[1] = 0.2*vertex_coordinates[1] + 0.6*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[17] = vals[0];
+    y[0] = 0.4*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+    y[1] = 0.4*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[18] = vals[0];
+    y[0] = 0.2*vertex_coordinates[0] + 0.4*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+    y[1] = 0.2*vertex_coordinates[1] + 0.4*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[19] = vals[0];
+    y[0] = 0.2*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.6*vertex_coordinates[4];
+    y[1] = 0.2*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.6*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[20] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson2d_5_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson2d_5_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson2d_5_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson2d_5_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson2d_5_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson2d_5_finite_element_0::create() const
+{
+    return new poisson2d_5_finite_element_0();
+}
+
+/// Constructor
+poisson2d_5_dofmap_0::poisson2d_5_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_5_dofmap_0::~poisson2d_5_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson2d_5_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 5, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson2d_5_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson2d_5_dofmap_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson2d_5_dofmap_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson2d_5_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0] + 4*num_global_entities[1] + 6*num_global_entities[2];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson2d_5_dofmap_0::local_dimension() const
+{
+    return 21;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson2d_5_dofmap_0::num_facet_dofs() const
+{
+    return 6;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson2d_5_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 4;
+        break;
+      }
+    case 2:
+      {
+        return 6;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson2d_5_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 4*c.entity_indices[1][0];
+    dofs[4] = offset + 4*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 4*c.entity_indices[1][0] + 2;
+    dofs[6] = offset + 4*c.entity_indices[1][0] + 3;
+    dofs[7] = offset + 4*c.entity_indices[1][1];
+    dofs[8] = offset + 4*c.entity_indices[1][1] + 1;
+    dofs[9] = offset + 4*c.entity_indices[1][1] + 2;
+    dofs[10] = offset + 4*c.entity_indices[1][1] + 3;
+    dofs[11] = offset + 4*c.entity_indices[1][2];
+    dofs[12] = offset + 4*c.entity_indices[1][2] + 1;
+    dofs[13] = offset + 4*c.entity_indices[1][2] + 2;
+    dofs[14] = offset + 4*c.entity_indices[1][2] + 3;
+    offset += 4*num_global_entities[1];
+    dofs[15] = offset + 6*c.entity_indices[2][0];
+    dofs[16] = offset + 6*c.entity_indices[2][0] + 1;
+    dofs[17] = offset + 6*c.entity_indices[2][0] + 2;
+    dofs[18] = offset + 6*c.entity_indices[2][0] + 3;
+    dofs[19] = offset + 6*c.entity_indices[2][0] + 4;
+    dofs[20] = offset + 6*c.entity_indices[2][0] + 5;
+    offset += 6*num_global_entities[2];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson2d_5_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 7;
+      dofs[3] = 8;
+      dofs[4] = 9;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 11;
+      dofs[3] = 12;
+      dofs[4] = 13;
+      dofs[5] = 14;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson2d_5_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+        dofs[2] = 5;
+        dofs[3] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+        dofs[2] = 9;
+        dofs[3] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 11;
+        dofs[1] = 12;
+        dofs[2] = 13;
+        dofs[3] = 14;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 15;
+      dofs[1] = 16;
+      dofs[2] = 17;
+      dofs[3] = 18;
+      dofs[4] = 19;
+      dofs[5] = 20;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson2d_5_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.8*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.8*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.6*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.6*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.4*vertex_coordinates[2] + 0.6*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.4*vertex_coordinates[3] + 0.6*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.2*vertex_coordinates[2] + 0.8*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.2*vertex_coordinates[3] + 0.8*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.8*vertex_coordinates[0] + 0.2*vertex_coordinates[4];
+    dof_coordinates[7][1] = 0.8*vertex_coordinates[1] + 0.2*vertex_coordinates[5];
+    dof_coordinates[8][0] = 0.6*vertex_coordinates[0] + 0.4*vertex_coordinates[4];
+    dof_coordinates[8][1] = 0.6*vertex_coordinates[1] + 0.4*vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.4*vertex_coordinates[0] + 0.6*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.4*vertex_coordinates[1] + 0.6*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.2*vertex_coordinates[0] + 0.8*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.2*vertex_coordinates[1] + 0.8*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.8*vertex_coordinates[0] + 0.2*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.8*vertex_coordinates[1] + 0.2*vertex_coordinates[3];
+    dof_coordinates[12][0] = 0.6*vertex_coordinates[0] + 0.4*vertex_coordinates[2];
+    dof_coordinates[12][1] = 0.6*vertex_coordinates[1] + 0.4*vertex_coordinates[3];
+    dof_coordinates[13][0] = 0.4*vertex_coordinates[0] + 0.6*vertex_coordinates[2];
+    dof_coordinates[13][1] = 0.4*vertex_coordinates[1] + 0.6*vertex_coordinates[3];
+    dof_coordinates[14][0] = 0.2*vertex_coordinates[0] + 0.8*vertex_coordinates[2];
+    dof_coordinates[14][1] = 0.2*vertex_coordinates[1] + 0.8*vertex_coordinates[3];
+    dof_coordinates[15][0] = 0.6*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+    dof_coordinates[15][1] = 0.6*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+    dof_coordinates[16][0] = 0.4*vertex_coordinates[0] + 0.4*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+    dof_coordinates[16][1] = 0.4*vertex_coordinates[1] + 0.4*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+    dof_coordinates[17][0] = 0.2*vertex_coordinates[0] + 0.6*vertex_coordinates[2] + 0.2*vertex_coordinates[4];
+    dof_coordinates[17][1] = 0.2*vertex_coordinates[1] + 0.6*vertex_coordinates[3] + 0.2*vertex_coordinates[5];
+    dof_coordinates[18][0] = 0.4*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+    dof_coordinates[18][1] = 0.4*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+    dof_coordinates[19][0] = 0.2*vertex_coordinates[0] + 0.4*vertex_coordinates[2] + 0.4*vertex_coordinates[4];
+    dof_coordinates[19][1] = 0.2*vertex_coordinates[1] + 0.4*vertex_coordinates[3] + 0.4*vertex_coordinates[5];
+    dof_coordinates[20][0] = 0.2*vertex_coordinates[0] + 0.2*vertex_coordinates[2] + 0.6*vertex_coordinates[4];
+    dof_coordinates[20][1] = 0.2*vertex_coordinates[1] + 0.2*vertex_coordinates[3] + 0.6*vertex_coordinates[5];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson2d_5_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson2d_5_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson2d_5_dofmap_0::create() const
+{
+    return new poisson2d_5_dofmap_0();
+}
+
+/// Constructor
+poisson2d_5_cell_integral_0_otherwise::poisson2d_5_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_5_cell_integral_0_otherwise::~poisson2d_5_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_5_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_5_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 1259
+    // Total number of operations (multiply-add pairs):                  1270
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.342406580687829*G0_0_0 + 0.342406580687829*G0_0_1 + 0.342406580687829*G0_1_0 + 0.34240658068783*G0_1_1;
+    A[1] = -0.040998401675485*G0_0_0 - 0.0409984016754851*G0_1_0;
+    A[2] = -0.040998401675485*G0_0_1 - 0.040998401675485*G0_1_1;
+    A[3] = -0.0408192791005283*G0_0_0 - 0.040819279100529*G0_0_1 - 0.0408192791005285*G0_1_0 - 0.0408192791005291*G0_1_1;
+    A[4] = -0.0379774305555561*G0_0_0 - 0.0379774305555545*G0_0_1 - 0.0379774305555559*G0_1_0 - 0.0379774305555543*G0_1_1;
+    A[5] = -0.0379774305555538*G0_0_0 - 0.0379774305555549*G0_0_1 - 0.037977430555554*G0_1_0 - 0.037977430555555*G0_1_1;
+    A[6] = -0.040819279100529*G0_0_0 - 0.0408192791005282*G0_0_1 - 0.040819279100529*G0_1_0 - 0.0408192791005283*G0_1_1;
+    A[7] = 0.202287946428571*G0_0_0 - 0.64802758487654*G0_0_1 + 0.202287946428571*G0_1_0 - 0.648027584876541*G0_1_1;
+    A[8] = -0.0158454585537927*G0_0_0 + 0.594204695767193*G0_0_1 - 0.0158454585537928*G0_1_0 + 0.594204695767193*G0_1_1;
+    A[9] = -0.069668347663138*G0_0_0 - 0.449959352954142*G0_0_1 - 0.069668347663138*G0_1_0 - 0.449959352954143*G0_1_1;
+    A[10] = 0.0408192791005289*G0_0_0 + 0.202374063051146*G0_0_1 + 0.0408192791005289*G0_1_0 + 0.202374063051146*G0_1_1;
+    A[11] = -0.64802758487654*G0_0_0 + 0.202287946428571*G0_0_1 - 0.64802758487654*G0_1_0 + 0.202287946428572*G0_1_1;
+    A[12] = 0.594204695767192*G0_0_0 - 0.0158454585537913*G0_0_1 + 0.594204695767192*G0_1_0 - 0.0158454585537912*G0_1_1;
+    A[13] = -0.449959352954142*G0_0_0 - 0.0696683476631398*G0_0_1 - 0.449959352954142*G0_1_0 - 0.0696683476631396*G0_1_1;
+    A[14] = 0.202374063051145*G0_0_0 + 0.0408192791005295*G0_0_1 + 0.202374063051146*G0_1_0 + 0.0408192791005296*G0_1_1;
+    A[15] = -0.215291556437389*G0_0_0 - 0.215291556437391*G0_0_1 - 0.215291556437389*G0_1_0 - 0.215291556437392*G0_1_1;
+    A[16] = -0.0538228891093484*G0_0_0 - 0.0538228891093457*G0_0_1 - 0.0538228891093485*G0_1_0 - 0.053822889109346*G0_1_1;
+    A[17] = 0.107645778218694*G0_0_0 + 0.107645778218693*G0_0_1 + 0.107645778218695*G0_1_0 + 0.107645778218693*G0_1_1;
+    A[18] = -0.0538228891093464*G0_0_0 - 0.053822889109346*G0_0_1 - 0.0538228891093465*G0_1_0 - 0.0538228891093456*G0_1_1;
+    A[19] = 0.107645778218695*G0_0_0 + 0.107645778218694*G0_0_1 + 0.107645778218695*G0_1_0 + 0.107645778218695*G0_1_1;
+    A[20] = 0.107645778218692*G0_0_0 + 0.107645778218692*G0_0_1 + 0.107645778218692*G0_1_0 + 0.107645778218692*G0_1_1;
+    A[21] = -0.040998401675485*G0_0_0 - 0.0409984016754851*G0_0_1;
+    A[22] = 0.342406580687829*G0_0_0;
+    A[23] = 0.0409984016754845*G0_0_1;
+    A[24] = 0.20228794642857*G0_0_0 + 0.85031553130511*G0_0_1;
+    A[25] = -0.0158454585537937*G0_0_0 - 0.610050154320986*G0_0_1;
+    A[26] = -0.0696683476631382*G0_0_0 + 0.380291005291002*G0_0_1;
+    A[27] = 0.0408192791005282*G0_0_0 - 0.161554783950616*G0_0_1;
+    A[28] = -0.0408192791005284*G0_0_0;
+    A[29] = -0.037977430555556*G0_0_0;
+    A[30] = -0.0379774305555545*G0_0_0;
+    A[31] = -0.0408192791005283*G0_0_0;
+    A[32] = 0.202374063051145*G0_0_0 + 0.161554783950616*G0_0_1;
+    A[33] = -0.449959352954142*G0_0_0 - 0.380291005291001*G0_0_1;
+    A[34] = 0.594204695767192*G0_0_0 + 0.610050154320982*G0_0_1;
+    A[35] = -0.64802758487654*G0_0_0 - 0.85031553130511*G0_0_1;
+    A[36] = 0.107645778218694*G0_0_0;
+    A[37] = -0.0538228891093496*G0_0_0;
+    A[38] = -0.215291556437387*G0_0_0;
+    A[39] = 0.107645778218696*G0_0_0;
+    A[40] = -0.0538228891093464*G0_0_0;
+    A[41] = 0.107645778218693*G0_0_0;
+    A[42] = -0.040998401675485*G0_1_0 - 0.040998401675485*G0_1_1;
+    A[43] = 0.0409984016754845*G0_1_0;
+    A[44] = 0.34240658068783*G0_1_1;
+    A[45] = -0.161554783950617*G0_1_0 + 0.0408192791005279*G0_1_1;
+    A[46] = 0.380291005291006*G0_1_0 - 0.0696683476631372*G0_1_1;
+    A[47] = -0.610050154320988*G0_1_0 - 0.015845458553793*G0_1_1;
+    A[48] = 0.850315531305113*G0_1_0 + 0.20228794642857*G0_1_1;
+    A[49] = 0.161554783950618*G0_1_0 + 0.202374063051146*G0_1_1;
+    A[50] = -0.380291005291006*G0_1_0 - 0.449959352954144*G0_1_1;
+    A[51] = 0.610050154320987*G0_1_0 + 0.594204695767196*G0_1_1;
+    A[52] = -0.850315531305113*G0_1_0 - 0.648027584876543*G0_1_1;
+    A[53] = -0.0408192791005286*G0_1_1;
+    A[54] = -0.0379774305555554*G0_1_1;
+    A[55] = -0.0379774305555546*G0_1_1;
+    A[56] = -0.0408192791005283*G0_1_1;
+    A[57] = 0.107645778218693*G0_1_1;
+    A[58] = 0.107645778218695*G0_1_1;
+    A[59] = 0.107645778218692*G0_1_1;
+    A[60] = -0.0538228891093447*G0_1_1;
+    A[61] = -0.0538228891093471*G0_1_1;
+    A[62] = -0.21529155643739*G0_1_1;
+    A[63] = -0.0408192791005283*G0_0_0 - 0.0408192791005285*G0_0_1 - 0.040819279100529*G0_1_0 - 0.0408192791005292*G0_1_1;
+    A[64] = 0.20228794642857*G0_0_0 + 0.85031553130511*G0_1_0;
+    A[65] = -0.161554783950617*G0_0_1 + 0.0408192791005279*G0_1_1;
+    A[66] = 1.98929398148147*G0_0_0 + 1.28098476080246*G0_0_1 + 1.28098476080246*G0_1_0 + 2.56196952160492*G0_1_1;
+    A[67] = -0.906377452601409*G0_0_0 + 0.796578758818337*G0_0_1 - 0.529617228835981*G0_1_0 - 1.39508928571428*G0_1_1;
+    A[68] = 0.818107914462078*G0_0_0 - 0.482253086419752*G0_0_1 + 0.232514880952381*G0_1_0 + 0.895612874779533*G0_1_1;
+    A[69] = -0.340160659171074*G0_0_0 + 0.329396081349206*G0_0_1 - 0.0710462136243394*G0_1_0 - 0.340160659171072*G0_1_1;
+    A[70] = 0.142092427248674*G0_0_0 + 0.0710462136243362*G0_0_1 + 0.0710462136243363*G0_1_0;
+    A[71] = 0.131327849426809*G0_0_0 + 0.0301408179012379*G0_0_1 + 0.0301408179012345*G0_1_0;
+    A[72] = 0.172233245149907*G0_0_0 + 0.0301408179012311*G0_0_1 + 0.0301408179012338*G0_1_0;
+    A[73] = 0.340160659171074*G0_0_0 + 0.0710462136243409*G0_0_1 + 0.0710462136243393*G0_1_0;
+    A[74] = 0.198068231922395*G0_0_0 + 0.269114445546734*G0_0_1 + 0.269114445546735*G0_1_0 + 0.340160659171073*G0_1_1;
+    A[75] = -0.359536899250436*G0_0_0 - 0.663097993827155*G0_0_1 - 0.663097993827155*G0_1_0 - 0.895612874779531*G0_1_1;
+    A[76] = 0.286337770061724*G0_0_0 + 0.865472056878298*G0_0_1 + 0.8654720568783*G0_1_0 + 1.39508928571427*G0_1_1;
+    A[77] = -0.286337770061725*G0_0_0 - 1.28098476080246*G0_0_1 - 1.28098476080246*G0_1_0 - 2.56196952160492*G0_1_1;
+    A[78] = -0.667403824955902*G0_0_0 - 0.262655698853613*G0_0_1 - 0.262655698853609*G0_1_0;
+    A[79] = 1.35633680555554*G0_0_0 + 0.572675540123453*G0_0_1 + 0.572675540123445*G0_1_0;
+    A[80] = -2.82031938932979*G0_0_0 - 1.66205081569664*G0_0_1 - 1.66205081569663*G0_1_0;
+    A[81] = -0.419818535052911*G0_0_0 - 0.0731991291887145*G0_0_1 - 0.0731991291887099*G0_1_0;
+    A[82] = 1.19486813822751*G0_0_0 + 0.572675540123455*G0_0_1 + 0.572675540123456*G0_1_0;
+    A[83] = -0.990341159611985*G0_0_0 - 0.262655698853612*G0_0_1 - 0.262655698853615*G0_1_0;
+    A[84] = -0.0379774305555561*G0_0_0 - 0.0379774305555558*G0_0_1 - 0.0379774305555545*G0_1_0 - 0.0379774305555543*G0_1_1;
+    A[85] = -0.0158454585537937*G0_0_0 - 0.610050154320985*G0_1_0;
+    A[86] = 0.380291005291006*G0_0_1 - 0.0696683476631372*G0_1_1;
+    A[87] = -0.906377452601409*G0_0_0 - 0.529617228835981*G0_0_1 + 0.796578758818337*G0_1_0 - 1.39508928571428*G0_1_1;
+    A[88] = 3.07436342592592*G0_0_0 + 1.17549189814815*G0_0_1 + 1.17549189814815*G0_1_0 + 3.69440310846559*G0_1_1;
+    A[89] = -1.80414324294532*G0_0_0 + 0.69969755842151*G0_0_1 - 0.350925236992947*G0_1_0 - 1.80414324294532*G0_1_1;
+    A[90] = 0.895612874779541*G0_0_0 - 0.48225308641975*G0_0_1 + 0.232514880952383*G0_1_0 + 0.818107914462077*G0_1_1;
+    A[91] = 0.13132784942681*G0_0_0 + 0.101187031525576*G0_0_1 + 0.101187031525575*G0_1_0 + 0.0710462136243381*G0_1_1;
+    A[92] = -0.297102347883603*G0_0_0 - 0.148551173941805*G0_0_1 - 0.148551173941801*G0_1_0 - 0.0172233245149925*G0_1_1;
+    A[93] = -0.21959738756613*G0_0_0 - 0.062434551366835*G0_0_1 - 0.062434551366842*G0_1_0 - 0.0172233245149881*G0_1_1;
+    A[94] = -0.89561287477954*G0_0_0 - 0.232514880952385*G0_0_1 - 0.232514880952383*G0_1_0 + 0.0710462136243353*G0_1_1;
+    A[95] = 0.111951609347444*G0_0_0 + 0.142092427248677*G0_0_1 + 0.142092427248675*G0_1_0 + 0.172233245149911*G0_1_1;
+    A[96] = -0.111951609347442*G0_0_0 - 0.157162836199293*G0_0_1 - 0.157162836199291*G0_1_0 - 0.219597387566139*G0_1_1;
+    A[97] = 0.103339947089946*G0_0_0 + 0.133480764991184*G0_0_1 + 0.133480764991179*G0_1_0 + 0.266961529982366*G0_1_1;
+    A[98] = -0.0495170579805987*G0_0_0 + 0.529617228835981*G0_0_1 + 0.529617228835978*G0_1_0 + 1.39508928571428*G0_1_1;
+    A[99] = -0.344466490299827*G0_0_0 - 0.447806437389772*G0_0_1 - 0.447806437389773*G0_1_0 - 0.516699735449737*G0_1_1;
+    A[100] = 0.387524801587307*G0_0_0 + 0.859013310185179*G0_0_1 + 0.85901331018519*G0_1_0 + 1.01187031525573*G0_1_1;
+    A[101] = 0.731991291887121*G0_0_0 - 1.30897266313933*G0_0_1 - 1.30897266313933*G0_1_0 - 3.96136463844796*G0_1_1;
+    A[102] = 1.03339947089947*G0_0_0 + 0.374607308201062*G0_0_1 + 0.374607308201053*G0_1_0 + 0.0430583112874783*G0_1_1;
+    A[103] = -3.81066054894178*G0_0_0 - 1.4015480324074*G0_0_1 - 1.4015480324074*G0_1_0 + 1.01187031525572*G0_1_1;
+    A[104] = 2.02374063051145*G0_0_0 + 0.413359788359785*G0_0_1 + 0.413359788359789*G0_1_0 - 0.516699735449728*G0_1_1;
+    A[105] = -0.0379774305555538*G0_0_0 - 0.037977430555554*G0_0_1 - 0.0379774305555549*G0_1_0 - 0.037977430555555*G0_1_1;
+    A[106] = -0.0696683476631382*G0_0_0 + 0.380291005291002*G0_1_0;
+    A[107] = -0.610050154320988*G0_0_1 - 0.0158454585537929*G0_1_1;
+    A[108] = 0.818107914462078*G0_0_0 + 0.232514880952381*G0_0_1 - 0.482253086419752*G0_1_0 + 0.895612874779533*G0_1_1;
+    A[109] = -1.80414324294532*G0_0_0 - 0.350925236992947*G0_0_1 + 0.69969755842151*G0_1_0 - 1.80414324294532*G0_1_1;
+    A[110] = 3.6944031084656*G0_0_0 + 1.17549189814814*G0_0_1 + 1.17549189814814*G0_1_0 + 3.0743634259259*G0_1_1;
+    A[111] = -1.39508928571428*G0_0_0 + 0.79657875881834*G0_0_1 - 0.529617228835976*G0_1_0 - 0.906377452601404*G0_1_1;
+    A[112] = 0.172233245149906*G0_0_0 + 0.14209242724867*G0_0_1 + 0.142092427248673*G0_1_0 + 0.111951609347439*G0_1_1;
+    A[113] = -0.219597387566128*G0_0_0 - 0.157162836199283*G0_0_1 - 0.157162836199291*G0_1_0 - 0.111951609347437*G0_1_1;
+    A[114] = 0.266961529982354*G0_0_0 + 0.133480764991172*G0_0_1 + 0.133480764991179*G0_1_0 + 0.103339947089942*G0_1_1;
+    A[115] = 1.39508928571428*G0_0_0 + 0.529617228835983*G0_0_1 + 0.529617228835977*G0_1_0 - 0.0495170579805959*G0_1_1;
+    A[116] = 0.0710462136243354*G0_0_0 + 0.101187031525572*G0_0_1 + 0.101187031525572*G0_1_0 + 0.131327849426806*G0_1_1;
+    A[117] = -0.0172233245149888*G0_0_0 - 0.148551173941798*G0_0_1 - 0.148551173941797*G0_1_0 - 0.297102347883594*G0_1_1;
+    A[118] = -0.0172233245149926*G0_0_0 - 0.0624345513668466*G0_0_1 - 0.0624345513668439*G0_1_0 - 0.21959738756614*G0_1_1;
+    A[119] = 0.0710462136243387*G0_0_0 - 0.232514880952382*G0_0_1 - 0.232514880952379*G0_1_0 - 0.895612874779535*G0_1_1;
+    A[120] = -0.516699735449724*G0_0_0 - 0.447806437389765*G0_0_1 - 0.447806437389764*G0_1_0 - 0.344466490299821*G0_1_1;
+    A[121] = 0.0430583112874709*G0_0_0 + 0.374607308201058*G0_0_1 + 0.374607308201052*G0_1_0 + 1.03339947089946*G0_1_1;
+    A[122] = -0.516699735449731*G0_0_0 + 0.413359788359793*G0_0_1 + 0.41335978835979*G0_1_0 + 2.02374063051146*G0_1_1;
+    A[123] = 1.01187031525572*G0_0_0 + 0.859013310185172*G0_0_1 + 0.859013310185178*G0_1_0 + 0.387524801587298*G0_1_1;
+    A[124] = 1.01187031525573*G0_0_0 - 1.4015480324074*G0_0_1 - 1.4015480324074*G0_1_0 - 3.81066054894177*G0_1_1;
+    A[125] = -3.96136463844795*G0_0_0 - 1.30897266313932*G0_0_1 - 1.30897266313932*G0_1_0 + 0.731991291887121*G0_1_1;
+    A[126] = -0.040819279100529*G0_0_0 - 0.040819279100529*G0_0_1 - 0.0408192791005282*G0_1_0 - 0.0408192791005283*G0_1_1;
+    A[127] = 0.0408192791005282*G0_0_0 - 0.161554783950616*G0_1_0;
+    A[128] = 0.850315531305113*G0_0_1 + 0.20228794642857*G0_1_1;
+    A[129] = -0.340160659171074*G0_0_0 - 0.0710462136243394*G0_0_1 + 0.329396081349206*G0_1_0 - 0.340160659171072*G0_1_1;
+    A[130] = 0.895612874779541*G0_0_0 + 0.232514880952383*G0_0_1 - 0.48225308641975*G0_1_0 + 0.818107914462077*G0_1_1;
+    A[131] = -1.39508928571428*G0_0_0 - 0.529617228835976*G0_0_1 + 0.79657875881834*G0_1_0 - 0.906377452601404*G0_1_1;
+    A[132] = 2.56196952160493*G0_0_0 + 1.28098476080246*G0_0_1 + 1.28098476080246*G0_1_0 + 1.98929398148147*G0_1_1;
+    A[133] = 0.340160659171078*G0_0_0 + 0.269114445546738*G0_0_1 + 0.269114445546737*G0_1_0 + 0.198068231922396*G0_1_1;
+    A[134] = -0.895612874779545*G0_0_0 - 0.663097993827163*G0_0_1 - 0.66309799382716*G0_1_0 - 0.359536899250439*G0_1_1;
+    A[135] = 1.39508928571429*G0_0_0 + 0.865472056878311*G0_0_1 + 0.865472056878304*G0_1_0 + 0.286337770061729*G0_1_1;
+    A[136] = -2.56196952160493*G0_0_0 - 1.28098476080247*G0_0_1 - 1.28098476080246*G0_1_0 - 0.286337770061728*G0_1_1;
+    A[137] = 0.07104621362434*G0_0_1 + 0.071046213624338*G0_1_0 + 0.142092427248678*G0_1_1;
+    A[138] = 0.0301408179012343*G0_0_1 + 0.0301408179012348*G0_1_0 + 0.131327849426807*G0_1_1;
+    A[139] = 0.0301408179012361*G0_0_1 + 0.0301408179012338*G0_1_0 + 0.172233245149912*G0_1_1;
+    A[140] = 0.0710462136243392*G0_0_1 + 0.0710462136243384*G0_1_0 + 0.340160659171072*G0_1_1;
+    A[141] = -0.262655698853621*G0_0_1 - 0.262655698853615*G0_1_0 - 0.66740382495591*G0_1_1;
+    A[142] = -0.0731991291887108*G0_0_1 - 0.0731991291887092*G0_1_0 - 0.419818535052906*G0_1_1;
+    A[143] = -0.262655698853619*G0_0_1 - 0.262655698853619*G0_1_0 - 0.99034115961199*G0_1_1;
+    A[144] = 0.572675540123462*G0_0_1 + 0.572675540123456*G0_1_0 + 1.35633680555555*G0_1_1;
+    A[145] = 0.572675540123451*G0_0_1 + 0.572675540123453*G0_1_0 + 1.1948681382275*G0_1_1;
+    A[146] = -1.66205081569664*G0_0_1 - 1.66205081569664*G0_1_0 - 2.82031938932979*G0_1_1;
+    A[147] = 0.202287946428571*G0_0_0 + 0.202287946428571*G0_0_1 - 0.64802758487654*G0_1_0 - 0.648027584876541*G0_1_1;
+    A[148] = -0.0408192791005284*G0_0_0;
+    A[149] = 0.161554783950618*G0_0_1 + 0.202374063051146*G0_1_1;
+    A[150] = 0.142092427248674*G0_0_0 + 0.0710462136243363*G0_0_1 + 0.0710462136243362*G0_1_0;
+    A[151] = 0.13132784942681*G0_0_0 + 0.101187031525575*G0_0_1 + 0.101187031525576*G0_1_0 + 0.0710462136243381*G0_1_1;
+    A[152] = 0.172233245149906*G0_0_0 + 0.142092427248673*G0_0_1 + 0.14209242724867*G0_1_0 + 0.111951609347439*G0_1_1;
+    A[153] = 0.340160659171078*G0_0_0 + 0.269114445546737*G0_0_1 + 0.269114445546738*G0_1_0 + 0.198068231922396*G0_1_1;
+    A[154] = 1.98929398148147*G0_0_0 + 0.708309220679007*G0_0_1 + 0.708309220679007*G0_1_0 + 1.98929398148147*G0_1_1;
+    A[155] = -0.906377452601406*G0_0_0 - 1.70295621141974*G0_0_1 - 0.376760223765426*G0_1_0 - 2.56842826829805*G0_1_1;
+    A[156] = 0.818107914462077*G0_0_0 + 1.30036100088183*G0_0_1 + 0.585593033509693*G0_1_0 + 1.96345899470898*G0_1_1;
+    A[157] = -0.340160659171078*G0_0_0 - 0.66955674052028*G0_0_1 - 0.269114445546738*G0_1_0 - 0.938671186067016*G0_1_1;
+    A[158] = -0.286337770061728*G0_0_0 + 0.994646990740736*G0_0_1 + 0.994646990740735*G0_1_0 - 0.286337770061729*G0_1_1;
+    A[159] = 0.286337770061726*G0_0_0 - 0.579134286816575*G0_0_1 - 0.579134286816575*G0_1_0 - 0.049517057980602*G0_1_1;
+    A[160] = -0.359536899250437*G0_0_0 + 0.303561094576719*G0_0_1 + 0.303561094576719*G0_1_0 + 0.0710462136243417*G0_1_1;
+    A[161] = 0.198068231922396*G0_0_0 - 0.0710462136243371*G0_0_1 - 0.0710462136243399*G0_1_0;
+    A[162] = -2.82031938932979*G0_0_0 - 1.15826857363315*G0_0_1 - 1.15826857363315*G0_1_0 + 0.503782242063499*G0_1_1;
+    A[163] = 1.35633680555554*G0_0_0 + 0.783661265432094*G0_0_1 + 0.783661265432094*G0_1_0 + 0.21098572530864*G0_1_1;
+    A[164] = -0.667403824955901*G0_0_0 - 0.404748126102293*G0_0_1 - 0.40474812610229*G0_1_0 - 0.142092427248677*G0_1_1;
+    A[165] = 1.19486813822751*G0_0_0 + 0.622192598104048*G0_0_1 + 0.622192598104048*G0_1_0 + 0.0495170579805897*G0_1_1;
+    A[166] = -0.419818535052911*G0_0_0 - 0.346619405864192*G0_0_1 - 0.346619405864199*G0_1_0 - 0.273420276675483*G0_1_1;
+    A[167] = -0.990341159611982*G0_0_0 - 0.727685460758374*G0_0_1 - 0.727685460758364*G0_1_0 - 0.465029761904753*G0_1_1;
+    A[168] = -0.0158454585537927*G0_0_0 - 0.0158454585537928*G0_0_1 + 0.594204695767193*G0_1_0 + 0.594204695767193*G0_1_1;
+    A[169] = -0.037977430555556*G0_0_0;
+    A[170] = -0.380291005291006*G0_0_1 - 0.449959352954144*G0_1_1;
+    A[171] = 0.131327849426809*G0_0_0 + 0.0301408179012345*G0_0_1 + 0.0301408179012379*G0_1_0;
+    A[172] = -0.297102347883603*G0_0_0 - 0.148551173941801*G0_0_1 - 0.148551173941805*G0_1_0 - 0.0172233245149925*G0_1_1;
+    A[173] = -0.219597387566128*G0_0_0 - 0.157162836199291*G0_0_1 - 0.157162836199283*G0_1_0 - 0.111951609347437*G0_1_1;
+    A[174] = -0.895612874779545*G0_0_0 - 0.66309799382716*G0_0_1 - 0.663097993827163*G0_1_0 - 0.359536899250439*G0_1_1;
+    A[175] = -0.906377452601406*G0_0_0 - 0.376760223765426*G0_0_1 - 1.70295621141974*G0_1_0 - 2.56842826829805*G0_1_1;
+    A[176] = 3.07436342592592*G0_0_0 + 1.89887152777777*G0_0_1 + 1.89887152777777*G0_1_0 + 4.41778273809521*G0_1_1;
+    A[177] = -1.80414324294532*G0_0_0 - 2.50384080136683*G0_0_1 - 1.45321800595237*G0_1_0 - 3.9570588073192*G0_1_1;
+    A[178] = 0.895612874779545*G0_0_0 + 1.37786596119929*G0_0_1 + 0.663097993827163*G0_1_0 + 1.96345899470899*G0_1_1;
+    A[179] = -0.0495170579805976*G0_0_0 - 0.579134286816577*G0_0_1 - 0.579134286816575*G0_1_0 + 0.286337770061727*G0_1_1;
+    A[180] = 0.103339947089946*G0_0_0 - 0.0301408179012345*G0_0_1 - 0.0301408179012339*G0_1_0 + 0.103339947089949*G0_1_1;
+    A[181] = -0.111951609347442*G0_0_0 + 0.0452112268518518*G0_0_1 + 0.0452112268518497*G0_1_0 - 0.0172233245149949*G0_1_1;
+    A[182] = 0.111951609347443*G0_0_0 - 0.0301408179012338*G0_0_1 - 0.0301408179012322*G0_1_0;
+    A[183] = 0.731991291887122*G0_0_0 + 2.04096395502645*G0_0_1 + 2.04096395502644*G0_1_0 - 0.611428020282191*G0_1_1;
+    A[184] = 0.387524801587298*G0_0_0 - 0.471488508597881*G0_0_1 - 0.47148850859788*G0_1_0 - 0.318631503527332*G0_1_1;
+    A[185] = -0.344466490299823*G0_0_0 + 0.103339947089949*G0_0_1 + 0.103339947089945*G0_1_0 + 0.0344466490299834*G0_1_1;
+    A[186] = -3.81066054894178*G0_0_0 - 2.40911251653438*G0_0_1 - 2.40911251653437*G0_1_0 + 0.00430583112875654*G0_1_1;
+    A[187] = 1.03339947089947*G0_0_0 + 0.658792162698407*G0_0_1 + 0.658792162698414*G0_1_0 + 0.327243165784827*G0_1_1;
+    A[188] = 2.02374063051144*G0_0_0 + 1.61038084215166*G0_0_1 + 1.61038084215165*G0_1_0 + 0.680321318342141*G0_1_1;
+    A[189] = -0.069668347663138*G0_0_0 - 0.069668347663138*G0_0_1 - 0.449959352954142*G0_1_0 - 0.449959352954143*G0_1_1;
+    A[190] = -0.0379774305555544*G0_0_0;
+    A[191] = 0.610050154320987*G0_0_1 + 0.594204695767196*G0_1_1;
+    A[192] = 0.172233245149907*G0_0_0 + 0.0301408179012338*G0_0_1 + 0.0301408179012311*G0_1_0;
+    A[193] = -0.219597387566131*G0_0_0 - 0.062434551366842*G0_0_1 - 0.062434551366835*G0_1_0 - 0.0172233245149881*G0_1_1;
+    A[194] = 0.266961529982354*G0_0_0 + 0.133480764991179*G0_0_1 + 0.133480764991172*G0_1_0 + 0.103339947089942*G0_1_1;
+    A[195] = 1.39508928571429*G0_0_0 + 0.865472056878304*G0_0_1 + 0.865472056878311*G0_1_0 + 0.286337770061729*G0_1_1;
+    A[196] = 0.818107914462077*G0_0_0 + 0.585593033509694*G0_0_1 + 1.30036100088183*G0_1_0 + 1.96345899470898*G0_1_1;
+    A[197] = -1.80414324294532*G0_0_0 - 1.45321800595237*G0_0_1 - 2.50384080136683*G0_1_0 - 3.9570588073192*G0_1_1;
+    A[198] = 3.6944031084656*G0_0_0 + 2.51891121031745*G0_0_1 + 2.51891121031745*G0_1_0 + 4.41778273809522*G0_1_1;
+    A[199] = -1.39508928571429*G0_0_0 - 2.19166804453262*G0_0_1 - 0.865472056878312*G0_1_0 - 2.56842826829805*G0_1_1;
+    A[200] = 0.0710462136243353*G0_0_0 + 0.30356109457672*G0_0_1 + 0.303561094576716*G0_1_0 - 0.359536899250439*G0_1_1;
+    A[201] = -0.0172233245149901*G0_0_0 + 0.0452112268518527*G0_0_1 + 0.0452112268518517*G0_1_0 - 0.111951609347445*G0_1_1;
+    A[202] = -0.0172233245149894*G0_0_0 + 0.131327849426811*G0_0_1 + 0.131327849426809*G0_1_0 - 0.017223324514987*G0_1_1;
+    A[203] = 0.0710462136243358*G0_0_0 - 0.0301408179012346*G0_0_1 - 0.0301408179012364*G0_1_0;
+    A[204] = -0.516699735449726*G0_0_0 - 0.93005952380952*G0_0_1 - 0.930059523809516*G0_1_0 + 0.680321318342151*G0_1_1;
+    A[205] = 0.0430583112874713*G0_0_0 - 0.331548996913582*G0_0_1 - 0.33154899691358*G0_1_0 + 0.327243165784829*G0_1_1;
+    A[206] = -0.516699735449729*G0_0_0 - 0.0688932980599681*G0_0_1 - 0.0688932980599629*G0_1_0 + 0.0344466490299786*G0_1_1;
+    A[207] = 1.01187031525573*G0_0_0 + 2.41341834766314*G0_0_1 + 2.41341834766313*G0_1_0 + 0.00430583112874527*G0_1_1;
+    A[208] = 1.01187031525572*G0_0_0 + 0.15285700507055*G0_0_1 + 0.15285700507054*G0_1_0 - 0.318631503527332*G0_1_1;
+    A[209] = -3.96136463844795*G0_0_0 - 2.65239197530864*G0_0_1 - 2.65239197530862*G0_1_0 - 0.611428020282183*G0_1_1;
+    A[210] = 0.0408192791005289*G0_0_0 + 0.0408192791005289*G0_0_1 + 0.202374063051146*G0_1_0 + 0.202374063051146*G0_1_1;
+    A[211] = -0.0408192791005282*G0_0_0;
+    A[212] = -0.850315531305113*G0_0_1 - 0.648027584876543*G0_1_1;
+    A[213] = 0.340160659171074*G0_0_0 + 0.0710462136243393*G0_0_1 + 0.0710462136243409*G0_1_0;
+    A[214] = -0.89561287477954*G0_0_0 - 0.232514880952383*G0_0_1 - 0.232514880952385*G0_1_0 + 0.0710462136243353*G0_1_1;
+    A[215] = 1.39508928571428*G0_0_0 + 0.529617228835977*G0_0_1 + 0.529617228835983*G0_1_0 - 0.0495170579805959*G0_1_1;
+    A[216] = -2.56196952160493*G0_0_0 - 1.28098476080246*G0_0_1 - 1.28098476080247*G0_1_0 - 0.286337770061728*G0_1_1;
+    A[217] = -0.340160659171078*G0_0_0 - 0.269114445546738*G0_0_1 - 0.66955674052028*G0_1_0 - 0.938671186067016*G0_1_1;
+    A[218] = 0.895612874779545*G0_0_0 + 0.663097993827164*G0_0_1 + 1.37786596119929*G0_1_0 + 1.96345899470899*G0_1_1;
+    A[219] = -1.39508928571429*G0_0_0 - 0.865472056878312*G0_0_1 - 2.19166804453262*G0_1_0 - 2.56842826829805*G0_1_1;
+    A[220] = 2.56196952160493*G0_0_0 + 1.28098476080247*G0_0_1 + 1.28098476080247*G0_1_0 + 1.98929398148148*G0_1_1;
+    A[221] = -0.07104621362434*G0_0_1 - 0.0710462136243373*G0_1_0 + 0.198068231922398*G0_1_1;
+    A[222] = -0.0301408179012347*G0_0_1 - 0.0301408179012351*G0_1_0 + 0.111951609347443*G0_1_1;
+    A[223] = -0.030140817901236*G0_0_1 - 0.0301408179012352*G0_1_0 + 0.0710462136243355*G0_1_1;
+    A[224] = -0.071046213624339*G0_0_1 - 0.0710462136243377*G0_1_0;
+    A[225] = 0.262655698853621*G0_0_1 + 0.262655698853613*G0_1_0 - 0.46502976190476*G0_1_1;
+    A[226] = 0.0731991291887117*G0_0_1 + 0.0731991291887132*G0_1_0 - 0.273420276675482*G0_1_1;
+    A[227] = 0.262655698853618*G0_0_1 + 0.262655698853614*G0_1_0 - 0.142092427248673*G0_1_1;
+    A[228] = -0.572675540123461*G0_0_1 - 0.572675540123456*G0_1_0 + 0.0495170579805962*G0_1_1;
+    A[229] = -0.572675540123452*G0_0_1 - 0.572675540123448*G0_1_0 + 0.210985725308638*G0_1_1;
+    A[230] = 1.66205081569664*G0_0_1 + 1.66205081569664*G0_1_0 + 0.503782242063493*G0_1_1;
+    A[231] = -0.64802758487654*G0_0_0 - 0.64802758487654*G0_0_1 + 0.202287946428571*G0_1_0 + 0.202287946428572*G0_1_1;
+    A[232] = 0.202374063051145*G0_0_0 + 0.161554783950616*G0_1_0;
+    A[233] = -0.0408192791005285*G0_1_1;
+    A[234] = 0.198068231922395*G0_0_0 + 0.269114445546735*G0_0_1 + 0.269114445546734*G0_1_0 + 0.340160659171073*G0_1_1;
+    A[235] = 0.111951609347444*G0_0_0 + 0.142092427248675*G0_0_1 + 0.142092427248677*G0_1_0 + 0.172233245149911*G0_1_1;
+    A[236] = 0.0710462136243354*G0_0_0 + 0.101187031525571*G0_0_1 + 0.101187031525572*G0_1_0 + 0.131327849426806*G0_1_1;
+    A[237] = 0.071046213624338*G0_0_1 + 0.07104621362434*G0_1_0 + 0.142092427248678*G0_1_1;
+    A[238] = -0.286337770061728*G0_0_0 + 0.994646990740735*G0_0_1 + 0.994646990740736*G0_1_0 - 0.286337770061729*G0_1_1;
+    A[239] = -0.0495170579805976*G0_0_0 - 0.579134286816575*G0_0_1 - 0.579134286816577*G0_1_0 + 0.286337770061727*G0_1_1;
+    A[240] = 0.0710462136243353*G0_0_0 + 0.303561094576717*G0_0_1 + 0.30356109457672*G0_1_0 - 0.359536899250439*G0_1_1;
+    A[241] = -0.0710462136243373*G0_0_1 - 0.07104621362434*G0_1_0 + 0.198068231922398*G0_1_1;
+    A[242] = 1.98929398148147*G0_0_0 + 0.708309220679006*G0_0_1 + 0.708309220679006*G0_1_0 + 1.98929398148147*G0_1_1;
+    A[243] = -2.56842826829804*G0_0_0 - 0.376760223765429*G0_0_1 - 1.70295621141974*G0_1_0 - 0.906377452601403*G0_1_1;
+    A[244] = 1.96345899470898*G0_0_0 + 0.585593033509695*G0_0_1 + 1.30036100088183*G0_1_0 + 0.818107914462073*G0_1_1;
+    A[245] = -0.938671186067014*G0_0_0 - 0.269114445546736*G0_0_1 - 0.669556740520278*G0_1_0 - 0.340160659171073*G0_1_1;
+    A[246] = 0.503782242063491*G0_0_0 - 1.15826857363315*G0_0_1 - 1.15826857363315*G0_1_0 - 2.82031938932979*G0_1_1;
+    A[247] = 0.0495170579805971*G0_0_0 + 0.622192598104045*G0_0_1 + 0.622192598104045*G0_1_0 + 1.1948681382275*G0_1_1;
+    A[248] = -0.465029761904755*G0_0_0 - 0.727685460758368*G0_0_1 - 0.727685460758368*G0_1_0 - 0.990341159611985*G0_1_1;
+    A[249] = 0.210985725308639*G0_0_0 + 0.783661265432093*G0_0_1 + 0.783661265432096*G0_1_0 + 1.35633680555555*G0_1_1;
+    A[250] = -0.273420276675483*G0_0_0 - 0.346619405864192*G0_0_1 - 0.346619405864195*G0_1_0 - 0.419818535052904*G0_1_1;
+    A[251] = -0.142092427248672*G0_0_0 - 0.404748126102289*G0_0_1 - 0.404748126102292*G0_1_0 - 0.667403824955909*G0_1_1;
+    A[252] = 0.594204695767192*G0_0_0 + 0.594204695767192*G0_0_1 - 0.0158454585537913*G0_1_0 - 0.0158454585537913*G0_1_1;
+    A[253] = -0.449959352954142*G0_0_0 - 0.380291005291001*G0_1_0;
+    A[254] = -0.0379774305555554*G0_1_1;
+    A[255] = -0.359536899250436*G0_0_0 - 0.663097993827155*G0_0_1 - 0.663097993827155*G0_1_0 - 0.895612874779531*G0_1_1;
+    A[256] = -0.111951609347442*G0_0_0 - 0.157162836199291*G0_0_1 - 0.157162836199293*G0_1_0 - 0.219597387566139*G0_1_1;
+    A[257] = -0.0172233245149888*G0_0_0 - 0.148551173941797*G0_0_1 - 0.148551173941798*G0_1_0 - 0.297102347883594*G0_1_1;
+    A[258] = 0.0301408179012348*G0_0_1 + 0.0301408179012343*G0_1_0 + 0.131327849426806*G0_1_1;
+    A[259] = 0.286337770061726*G0_0_0 - 0.579134286816575*G0_0_1 - 0.579134286816576*G0_1_0 - 0.049517057980602*G0_1_1;
+    A[260] = 0.103339947089946*G0_0_0 - 0.0301408179012339*G0_0_1 - 0.0301408179012345*G0_1_0 + 0.103339947089949*G0_1_1;
+    A[261] = -0.0172233245149901*G0_0_0 + 0.0452112268518519*G0_0_1 + 0.0452112268518527*G0_1_0 - 0.111951609347445*G0_1_1;
+    A[262] = -0.0301408179012351*G0_0_1 - 0.0301408179012347*G0_1_0 + 0.111951609347443*G0_1_1;
+    A[263] = -2.56842826829804*G0_0_0 - 1.70295621141974*G0_0_1 - 0.376760223765429*G0_1_0 - 0.906377452601403*G0_1_1;
+    A[264] = 4.41778273809521*G0_0_0 + 1.89887152777776*G0_0_1 + 1.89887152777776*G0_1_0 + 3.0743634259259*G0_1_1;
+    A[265] = -3.9570588073192*G0_0_0 - 1.45321800595237*G0_0_1 - 2.50384080136682*G0_1_0 - 1.80414324294531*G0_1_1;
+    A[266] = 1.96345899470898*G0_0_0 + 0.663097993827155*G0_0_1 + 1.37786596119928*G0_1_0 + 0.895612874779531*G0_1_1;
+    A[267] = -0.611428020282184*G0_0_0 + 2.04096395502644*G0_0_1 + 2.04096395502644*G0_1_0 + 0.731991291887116*G0_1_1;
+    A[268] = 0.00430583112875335*G0_0_0 - 2.40911251653437*G0_0_1 - 2.40911251653437*G0_1_0 - 3.81066054894177*G0_1_1;
+    A[269] = 0.680321318342141*G0_0_0 + 1.61038084215166*G0_0_1 + 1.61038084215166*G0_1_0 + 2.02374063051145*G0_1_1;
+    A[270] = -0.318631503527334*G0_0_0 - 0.471488508597882*G0_0_1 - 0.471488508597882*G0_1_0 + 0.387524801587306*G0_1_1;
+    A[271] = 0.327243165784828*G0_0_0 + 0.658792162698405*G0_0_1 + 0.658792162698409*G0_1_0 + 1.03339947089947*G0_1_1;
+    A[272] = 0.0344466490299804*G0_0_0 + 0.103339947089947*G0_0_1 + 0.103339947089946*G0_1_0 - 0.344466490299824*G0_1_1;
+    A[273] = -0.449959352954142*G0_0_0 - 0.449959352954142*G0_0_1 - 0.0696683476631398*G0_1_0 - 0.0696683476631396*G0_1_1;
+    A[274] = 0.594204695767192*G0_0_0 + 0.610050154320982*G0_1_0;
+    A[275] = -0.0379774305555546*G0_1_1;
+    A[276] = 0.286337770061724*G0_0_0 + 0.8654720568783*G0_0_1 + 0.865472056878298*G0_1_0 + 1.39508928571427*G0_1_1;
+    A[277] = 0.103339947089946*G0_0_0 + 0.133480764991179*G0_0_1 + 0.133480764991184*G0_1_0 + 0.266961529982366*G0_1_1;
+    A[278] = -0.0172233245149927*G0_0_0 - 0.0624345513668439*G0_0_1 - 0.0624345513668466*G0_1_0 - 0.21959738756614*G0_1_1;
+    A[279] = 0.0301408179012337*G0_0_1 + 0.0301408179012361*G0_1_0 + 0.172233245149912*G0_1_1;
+    A[280] = -0.359536899250437*G0_0_0 + 0.303561094576719*G0_0_1 + 0.303561094576719*G0_1_0 + 0.0710462136243417*G0_1_1;
+    A[281] = -0.111951609347442*G0_0_0 + 0.0452112268518497*G0_0_1 + 0.0452112268518518*G0_1_0 - 0.0172233245149949*G0_1_1;
+    A[282] = -0.0172233245149894*G0_0_0 + 0.131327849426809*G0_0_1 + 0.131327849426811*G0_1_0 - 0.017223324514987*G0_1_1;
+    A[283] = -0.0301408179012352*G0_0_1 - 0.030140817901236*G0_1_0 + 0.0710462136243355*G0_1_1;
+    A[284] = 1.96345899470898*G0_0_0 + 1.30036100088183*G0_0_1 + 0.585593033509695*G0_1_0 + 0.818107914462073*G0_1_1;
+    A[285] = -3.9570588073192*G0_0_0 - 2.50384080136682*G0_0_1 - 1.45321800595237*G0_1_0 - 1.80414324294531*G0_1_1;
+    A[286] = 4.41778273809521*G0_0_0 + 2.51891121031744*G0_0_1 + 2.51891121031744*G0_1_0 + 3.69440310846558*G0_1_1;
+    A[287] = -2.56842826829804*G0_0_0 - 0.865472056878301*G0_0_1 - 2.19166804453261*G0_1_0 - 1.39508928571427*G0_1_1;
+    A[288] = 0.680321318342151*G0_0_0 - 0.930059523809514*G0_0_1 - 0.93005952380951*G0_1_0 - 0.516699735449723*G0_1_1;
+    A[289] = 0.00430583112873832*G0_0_0 + 2.41341834766311*G0_0_1 + 2.41341834766311*G0_1_0 + 1.01187031525571*G0_1_1;
+    A[290] = -0.611428020282177*G0_0_0 - 2.65239197530862*G0_0_1 - 2.65239197530862*G0_1_0 - 3.96136463844795*G0_1_1;
+    A[291] = 0.32724316578483*G0_0_0 - 0.331548996913579*G0_0_1 - 0.331548996913577*G0_1_0 + 0.0430583112874745*G0_1_1;
+    A[292] = -0.318631503527333*G0_0_0 + 0.152857005070552*G0_0_1 + 0.152857005070543*G0_1_0 + 1.01187031525573*G0_1_1;
+    A[293] = 0.0344466490299806*G0_0_0 - 0.0688932980599666*G0_0_1 - 0.0688932980599646*G0_1_0 - 0.516699735449736*G0_1_1;
+    A[294] = 0.202374063051145*G0_0_0 + 0.202374063051146*G0_0_1 + 0.0408192791005295*G0_1_0 + 0.0408192791005296*G0_1_1;
+    A[295] = -0.64802758487654*G0_0_0 - 0.85031553130511*G0_1_0;
+    A[296] = -0.0408192791005283*G0_1_1;
+    A[297] = -0.286337770061725*G0_0_0 - 1.28098476080246*G0_0_1 - 1.28098476080246*G0_1_0 - 2.56196952160492*G0_1_1;
+    A[298] = -0.0495170579805987*G0_0_0 + 0.529617228835977*G0_0_1 + 0.529617228835981*G0_1_0 + 1.39508928571428*G0_1_1;
+    A[299] = 0.0710462136243387*G0_0_0 - 0.232514880952379*G0_0_1 - 0.232514880952382*G0_1_0 - 0.895612874779535*G0_1_1;
+    A[300] = 0.0710462136243384*G0_0_1 + 0.0710462136243392*G0_1_0 + 0.340160659171072*G0_1_1;
+    A[301] = 0.198068231922396*G0_0_0 - 0.0710462136243399*G0_0_1 - 0.0710462136243371*G0_1_0;
+    A[302] = 0.111951609347443*G0_0_0 - 0.0301408179012322*G0_0_1 - 0.0301408179012338*G0_1_0;
+    A[303] = 0.0710462136243358*G0_0_0 - 0.0301408179012364*G0_0_1 - 0.0301408179012346*G0_1_0;
+    A[304] = -0.0710462136243377*G0_0_1 - 0.071046213624339*G0_1_0;
+    A[305] = -0.938671186067014*G0_0_0 - 0.669556740520278*G0_0_1 - 0.269114445546736*G0_1_0 - 0.340160659171073*G0_1_1;
+    A[306] = 1.96345899470898*G0_0_0 + 1.37786596119928*G0_0_1 + 0.663097993827155*G0_1_0 + 0.895612874779531*G0_1_1;
+    A[307] = -2.56842826829804*G0_0_0 - 2.19166804453261*G0_0_1 - 0.865472056878301*G0_1_0 - 1.39508928571427*G0_1_1;
+    A[308] = 1.98929398148147*G0_0_0 + 1.28098476080246*G0_0_1 + 1.28098476080246*G0_1_0 + 2.56196952160492*G0_1_1;
+    A[309] = -0.465029761904761*G0_0_0 + 0.262655698853611*G0_0_1 + 0.262655698853609*G0_1_0;
+    A[310] = 0.0495170579806064*G0_0_0 - 0.572675540123445*G0_0_1 - 0.572675540123445*G0_1_0;
+    A[311] = 0.503782242063484*G0_0_0 + 1.66205081569664*G0_0_1 + 1.66205081569663*G0_1_0;
+    A[312] = -0.273420276675487*G0_0_0 + 0.0731991291887106*G0_0_1 + 0.0731991291887092*G0_1_0;
+    A[313] = 0.210985725308642*G0_0_0 - 0.572675540123459*G0_0_1 - 0.572675540123457*G0_1_0;
+    A[314] = -0.142092427248674*G0_0_0 + 0.262655698853619*G0_0_1 + 0.262655698853617*G0_1_0;
+    A[315] = -0.215291556437388*G0_0_0 - 0.215291556437389*G0_0_1 - 0.215291556437391*G0_1_0 - 0.215291556437392*G0_1_1;
+    A[316] = 0.107645778218694*G0_0_0;
+    A[317] = 0.107645778218693*G0_1_1;
+    A[318] = -0.667403824955902*G0_0_0 - 0.262655698853609*G0_0_1 - 0.262655698853613*G0_1_0;
+    A[319] = -0.344466490299827*G0_0_0 - 0.447806437389773*G0_0_1 - 0.447806437389772*G0_1_0 - 0.516699735449737*G0_1_1;
+    A[320] = -0.516699735449724*G0_0_0 - 0.447806437389764*G0_0_1 - 0.447806437389765*G0_1_0 - 0.344466490299821*G0_1_1;
+    A[321] = -0.262655698853615*G0_0_1 - 0.262655698853621*G0_1_0 - 0.66740382495591*G0_1_1;
+    A[322] = -2.82031938932979*G0_0_0 - 1.15826857363315*G0_0_1 - 1.15826857363315*G0_1_0 + 0.503782242063499*G0_1_1;
+    A[323] = 0.731991291887122*G0_0_0 + 2.04096395502644*G0_0_1 + 2.04096395502645*G0_1_0 - 0.61142802028219*G0_1_1;
+    A[324] = -0.516699735449726*G0_0_0 - 0.930059523809516*G0_0_1 - 0.93005952380952*G0_1_0 + 0.680321318342151*G0_1_1;
+    A[325] = 0.262655698853613*G0_0_1 + 0.262655698853621*G0_1_0 - 0.46502976190476*G0_1_1;
+    A[326] = 0.503782242063491*G0_0_0 - 1.15826857363315*G0_0_1 - 1.15826857363315*G0_1_0 - 2.82031938932979*G0_1_1;
+    A[327] = -0.611428020282184*G0_0_0 + 2.04096395502644*G0_0_1 + 2.04096395502644*G0_1_0 + 0.731991291887116*G0_1_1;
+    A[328] = 0.680321318342151*G0_0_0 - 0.93005952380951*G0_0_1 - 0.930059523809514*G0_1_0 - 0.516699735449723*G0_1_1;
+    A[329] = -0.465029761904761*G0_0_0 + 0.262655698853609*G0_0_1 + 0.262655698853611*G0_1_0;
+    A[330] = 7.06156305114633*G0_0_0 + 3.10019841269839*G0_0_1 + 3.10019841269839*G0_1_0 + 7.06156305114637*G0_1_1;
+    A[331] = -6.32957175925921*G0_0_0 - 3.05714010141091*G0_0_1 - 3.05714010141091*G0_1_0 - 1.80844907407406*G0_1_1;
+    A[332] = 2.75573192239856*G0_0_0 + 1.37786596119928*G0_0_1 + 1.37786596119928*G0_1_0 + 1.03339947089946*G0_1_1;
+    A[333] = -1.80844907407406*G0_0_0 - 3.05714010141091*G0_0_1 - 3.05714010141092*G0_1_0 - 6.32957175925924*G0_1_1;
+    A[334] = 1.42092427248677*G0_0_0 + 1.46398258377424*G0_0_1 + 1.46398258377424*G0_1_0 + 1.42092427248676*G0_1_1;
+    A[335] = 1.03339947089945*G0_0_0 + 1.37786596119928*G0_0_1 + 1.37786596119928*G0_1_0 + 2.75573192239858*G0_1_1;
+    A[336] = -0.0538228891093484*G0_0_0 - 0.0538228891093485*G0_0_1 - 0.0538228891093457*G0_1_0 - 0.053822889109346*G0_1_1;
+    A[337] = -0.0538228891093496*G0_0_0;
+    A[338] = 0.107645778218695*G0_1_1;
+    A[339] = 1.35633680555554*G0_0_0 + 0.572675540123445*G0_0_1 + 0.572675540123453*G0_1_0;
+    A[340] = 0.387524801587307*G0_0_0 + 0.85901331018519*G0_0_1 + 0.859013310185178*G0_1_0 + 1.01187031525573*G0_1_1;
+    A[341] = 0.0430583112874709*G0_0_0 + 0.374607308201052*G0_0_1 + 0.374607308201058*G0_1_0 + 1.03339947089946*G0_1_1;
+    A[342] = -0.0731991291887092*G0_0_1 - 0.0731991291887109*G0_1_0 - 0.419818535052906*G0_1_1;
+    A[343] = 1.35633680555554*G0_0_0 + 0.783661265432094*G0_0_1 + 0.783661265432094*G0_1_0 + 0.21098572530864*G0_1_1;
+    A[344] = 0.387524801587298*G0_0_0 - 0.47148850859788*G0_0_1 - 0.471488508597881*G0_1_0 - 0.318631503527332*G0_1_1;
+    A[345] = 0.0430583112874713*G0_0_0 - 0.33154899691358*G0_0_1 - 0.331548996913582*G0_1_0 + 0.327243165784829*G0_1_1;
+    A[346] = 0.073199129188713*G0_0_1 + 0.0731991291887117*G0_1_0 - 0.273420276675482*G0_1_1;
+    A[347] = 0.0495170579805969*G0_0_0 + 0.622192598104045*G0_0_1 + 0.622192598104045*G0_1_0 + 1.1948681382275*G0_1_1;
+    A[348] = 0.00430583112875357*G0_0_0 - 2.40911251653437*G0_0_1 - 2.40911251653437*G0_1_0 - 3.81066054894177*G0_1_1;
+    A[349] = 0.00430583112873832*G0_0_0 + 2.41341834766311*G0_0_1 + 2.41341834766311*G0_1_0 + 1.01187031525571*G0_1_1;
+    A[350] = 0.0495170579806061*G0_0_0 - 0.572675540123445*G0_0_1 - 0.572675540123445*G0_1_0;
+    A[351] = -6.32957175925921*G0_0_0 - 3.05714010141091*G0_0_1 - 3.05714010141091*G0_1_0 - 1.80844907407406*G0_1_1;
+    A[352] = 9.94646990740734*G0_0_0 + 4.97323495370367*G0_0_1 + 4.97323495370367*G0_1_0 + 8.65472056878302*G0_1_1;
+    A[353] = -6.32957175925921*G0_0_0 - 3.2724316578483*G0_0_1 - 3.2724316578483*G0_1_0 - 2.02374063051144*G0_1_1;
+    A[354] = -0.387524801587296*G0_0_0 + 2.55120494378305*G0_0_1 + 2.55120494378306*G0_1_0 - 0.387524801587306*G0_1_1;
+    A[355] = -0.387524801587308*G0_0_0 - 2.93872974537036*G0_0_1 - 2.93872974537035*G0_1_0 - 5.87745949074072*G0_1_1;
+    A[356] = -0.0861166225749424*G0_0_0 - 0.0430583112874729*G0_0_1 - 0.043058311287477*G0_1_0 + 1.42092427248677*G0_1_1;
+    A[357] = 0.107645778218694*G0_0_0 + 0.107645778218695*G0_0_1 + 0.107645778218693*G0_1_0 + 0.107645778218693*G0_1_1;
+    A[358] = -0.215291556437387*G0_0_0;
+    A[359] = 0.107645778218692*G0_1_1;
+    A[360] = -2.82031938932979*G0_0_0 - 1.66205081569663*G0_0_1 - 1.66205081569664*G0_1_0;
+    A[361] = 0.731991291887121*G0_0_0 - 1.30897266313933*G0_0_1 - 1.30897266313933*G0_1_0 - 3.96136463844796*G0_1_1;
+    A[362] = -0.516699735449731*G0_0_0 + 0.41335978835979*G0_0_1 + 0.413359788359793*G0_1_0 + 2.02374063051146*G0_1_1;
+    A[363] = -0.262655698853619*G0_0_1 - 0.262655698853619*G0_1_0 - 0.99034115961199*G0_1_1;
+    A[364] = -0.667403824955901*G0_0_0 - 0.40474812610229*G0_0_1 - 0.404748126102293*G0_1_0 - 0.142092427248677*G0_1_1;
+    A[365] = -0.344466490299823*G0_0_0 + 0.103339947089945*G0_0_1 + 0.103339947089949*G0_1_0 + 0.0344466490299834*G0_1_1;
+    A[366] = -0.516699735449729*G0_0_0 - 0.068893298059963*G0_0_1 - 0.0688932980599681*G0_1_0 + 0.0344466490299786*G0_1_1;
+    A[367] = 0.262655698853614*G0_0_1 + 0.262655698853618*G0_1_0 - 0.142092427248673*G0_1_1;
+    A[368] = -0.465029761904755*G0_0_0 - 0.727685460758368*G0_0_1 - 0.727685460758368*G0_1_0 - 0.990341159611985*G0_1_1;
+    A[369] = 0.680321318342141*G0_0_0 + 1.61038084215166*G0_0_1 + 1.61038084215166*G0_1_0 + 2.02374063051145*G0_1_1;
+    A[370] = -0.611428020282177*G0_0_0 - 2.65239197530862*G0_0_1 - 2.65239197530862*G0_1_0 - 3.96136463844795*G0_1_1;
+    A[371] = 0.503782242063484*G0_0_0 + 1.66205081569663*G0_0_1 + 1.66205081569664*G0_1_0;
+    A[372] = 2.75573192239856*G0_0_0 + 1.37786596119928*G0_0_1 + 1.37786596119928*G0_1_0 + 1.03339947089946*G0_1_1;
+    A[373] = -6.32957175925921*G0_0_0 - 3.2724316578483*G0_0_1 - 3.2724316578483*G0_1_0 - 2.02374063051144*G0_1_1;
+    A[374] = 7.06156305114634*G0_0_0 + 3.96136463844795*G0_0_1 + 3.96136463844795*G0_1_0 + 7.92272927689591*G0_1_1;
+    A[375] = 1.42092427248677*G0_0_0 - 0.0430583112874708*G0_0_1 - 0.0430583112874745*G0_1_0 - 0.086116622574956*G0_1_1;
+    A[376] = -1.80844907407407*G0_0_0 + 1.24869102733686*G0_0_1 + 1.24869102733685*G0_1_0 - 2.02374063051146*G0_1_1;
+    A[377] = 1.03339947089946*G0_0_0 - 0.344466490299824*G0_0_1 - 0.344466490299825*G0_1_0 + 1.03339947089947*G0_1_1;
+    A[378] = -0.0538228891093463*G0_0_0 - 0.0538228891093464*G0_0_1 - 0.0538228891093459*G0_1_0 - 0.0538228891093456*G0_1_1;
+    A[379] = 0.107645778218696*G0_0_0;
+    A[380] = -0.0538228891093447*G0_1_1;
+    A[381] = -0.419818535052911*G0_0_0 - 0.0731991291887099*G0_0_1 - 0.0731991291887145*G0_1_0;
+    A[382] = 1.03339947089947*G0_0_0 + 0.374607308201053*G0_0_1 + 0.374607308201062*G0_1_0 + 0.0430583112874783*G0_1_1;
+    A[383] = 1.01187031525572*G0_0_0 + 0.859013310185178*G0_0_1 + 0.859013310185172*G0_1_0 + 0.387524801587298*G0_1_1;
+    A[384] = 0.572675540123456*G0_0_1 + 0.572675540123462*G0_1_0 + 1.35633680555555*G0_1_1;
+    A[385] = 1.19486813822751*G0_0_0 + 0.622192598104048*G0_0_1 + 0.622192598104048*G0_1_0 + 0.0495170579805897*G0_1_1;
+    A[386] = -3.81066054894178*G0_0_0 - 2.40911251653437*G0_0_1 - 2.40911251653438*G0_1_0 + 0.00430583112875677*G0_1_1;
+    A[387] = 1.01187031525573*G0_0_0 + 2.41341834766313*G0_0_1 + 2.41341834766314*G0_1_0 + 0.00430583112874544*G0_1_1;
+    A[388] = -0.572675540123456*G0_0_1 - 0.572675540123462*G0_1_0 + 0.0495170579805963*G0_1_1;
+    A[389] = 0.210985725308639*G0_0_0 + 0.783661265432096*G0_0_1 + 0.783661265432093*G0_1_0 + 1.35633680555555*G0_1_1;
+    A[390] = -0.318631503527334*G0_0_0 - 0.471488508597882*G0_0_1 - 0.471488508597882*G0_1_0 + 0.387524801587306*G0_1_1;
+    A[391] = 0.32724316578483*G0_0_0 - 0.331548996913577*G0_0_1 - 0.331548996913579*G0_1_0 + 0.0430583112874745*G0_1_1;
+    A[392] = -0.273420276675487*G0_0_0 + 0.0731991291887092*G0_0_1 + 0.0731991291887106*G0_1_0;
+    A[393] = -1.80844907407406*G0_0_0 - 3.05714010141092*G0_0_1 - 3.05714010141091*G0_1_0 - 6.32957175925924*G0_1_1;
+    A[394] = -0.387524801587296*G0_0_0 + 2.55120494378306*G0_0_1 + 2.55120494378305*G0_1_0 - 0.387524801587306*G0_1_1;
+    A[395] = 1.42092427248677*G0_0_0 - 0.0430583112874745*G0_0_1 - 0.043058311287471*G0_1_0 - 0.0861166225749559*G0_1_1;
+    A[396] = 8.65472056878303*G0_0_0 + 4.97323495370368*G0_0_1 + 4.97323495370368*G0_1_0 + 9.94646990740738*G0_1_1;
+    A[397] = -5.87745949074072*G0_0_0 - 2.93872974537036*G0_0_1 - 2.93872974537036*G0_1_0 - 0.387524801587293*G0_1_1;
+    A[398] = -2.02374063051144*G0_0_0 - 3.27243165784831*G0_0_1 - 3.27243165784831*G0_1_0 - 6.32957175925924*G0_1_1;
+    A[399] = 0.107645778218695*G0_0_0 + 0.107645778218695*G0_0_1 + 0.107645778218694*G0_1_0 + 0.107645778218695*G0_1_1;
+    A[400] = -0.0538228891093465*G0_0_0;
+    A[401] = -0.0538228891093471*G0_1_1;
+    A[402] = 1.19486813822751*G0_0_0 + 0.572675540123456*G0_0_1 + 0.572675540123455*G0_1_0;
+    A[403] = -3.81066054894178*G0_0_0 - 1.4015480324074*G0_0_1 - 1.4015480324074*G0_1_0 + 1.01187031525572*G0_1_1;
+    A[404] = 1.01187031525573*G0_0_0 - 1.4015480324074*G0_0_1 - 1.4015480324074*G0_1_0 - 3.81066054894177*G0_1_1;
+    A[405] = 0.572675540123454*G0_0_1 + 0.572675540123451*G0_1_0 + 1.1948681382275*G0_1_1;
+    A[406] = -0.419818535052911*G0_0_0 - 0.346619405864199*G0_0_1 - 0.346619405864192*G0_1_0 - 0.273420276675483*G0_1_1;
+    A[407] = 1.03339947089947*G0_0_0 + 0.658792162698414*G0_0_1 + 0.658792162698407*G0_1_0 + 0.327243165784827*G0_1_1;
+    A[408] = 1.01187031525572*G0_0_0 + 0.15285700507054*G0_0_1 + 0.15285700507055*G0_1_0 - 0.318631503527332*G0_1_1;
+    A[409] = -0.572675540123448*G0_0_1 - 0.572675540123452*G0_1_0 + 0.210985725308638*G0_1_1;
+    A[410] = -0.273420276675483*G0_0_0 - 0.346619405864195*G0_0_1 - 0.346619405864192*G0_1_0 - 0.419818535052904*G0_1_1;
+    A[411] = 0.327243165784828*G0_0_0 + 0.658792162698409*G0_0_1 + 0.658792162698405*G0_1_0 + 1.03339947089947*G0_1_1;
+    A[412] = -0.318631503527333*G0_0_0 + 0.152857005070543*G0_0_1 + 0.152857005070552*G0_1_0 + 1.01187031525573*G0_1_1;
+    A[413] = 0.210985725308642*G0_0_0 - 0.572675540123457*G0_0_1 - 0.572675540123459*G0_1_0;
+    A[414] = 1.42092427248677*G0_0_0 + 1.46398258377424*G0_0_1 + 1.46398258377424*G0_1_0 + 1.42092427248676*G0_1_1;
+    A[415] = -0.387524801587308*G0_0_0 - 2.93872974537035*G0_0_1 - 2.93872974537036*G0_1_0 - 5.87745949074072*G0_1_1;
+    A[416] = -1.80844907407407*G0_0_0 + 1.24869102733685*G0_0_1 + 1.24869102733686*G0_1_0 - 2.02374063051146*G0_1_1;
+    A[417] = -5.87745949074072*G0_0_0 - 2.93872974537036*G0_0_1 - 2.93872974537036*G0_1_0 - 0.387524801587294*G0_1_1;
+    A[418] = 8.65472056878303*G0_0_0 + 3.68148561507935*G0_0_1 + 3.68148561507935*G0_1_0 + 8.65472056878304*G0_1_1;
+    A[419] = -2.02374063051145*G0_0_0 + 1.24869102733686*G0_0_1 + 1.24869102733686*G0_1_0 - 1.80844907407407*G0_1_1;
+    A[420] = 0.107645778218692*G0_0_0 + 0.107645778218692*G0_0_1 + 0.107645778218692*G0_1_0 + 0.107645778218692*G0_1_1;
+    A[421] = 0.107645778218693*G0_0_0;
+    A[422] = -0.21529155643739*G0_1_1;
+    A[423] = -0.990341159611985*G0_0_0 - 0.262655698853615*G0_0_1 - 0.262655698853612*G0_1_0;
+    A[424] = 2.02374063051145*G0_0_0 + 0.413359788359789*G0_0_1 + 0.413359788359785*G0_1_0 - 0.516699735449728*G0_1_1;
+    A[425] = -3.96136463844795*G0_0_0 - 1.30897266313932*G0_0_1 - 1.30897266313932*G0_1_0 + 0.731991291887121*G0_1_1;
+    A[426] = -1.66205081569664*G0_0_1 - 1.66205081569664*G0_1_0 - 2.82031938932979*G0_1_1;
+    A[427] = -0.990341159611981*G0_0_0 - 0.727685460758364*G0_0_1 - 0.727685460758374*G0_1_0 - 0.465029761904753*G0_1_1;
+    A[428] = 2.02374063051144*G0_0_0 + 1.61038084215165*G0_0_1 + 1.61038084215166*G0_1_0 + 0.680321318342141*G0_1_1;
+    A[429] = -3.96136463844795*G0_0_0 - 2.65239197530862*G0_0_1 - 2.65239197530864*G0_1_0 - 0.611428020282183*G0_1_1;
+    A[430] = 1.66205081569664*G0_0_1 + 1.66205081569664*G0_1_0 + 0.503782242063493*G0_1_1;
+    A[431] = -0.142092427248672*G0_0_0 - 0.404748126102292*G0_0_1 - 0.404748126102289*G0_1_0 - 0.667403824955909*G0_1_1;
+    A[432] = 0.0344466490299804*G0_0_0 + 0.103339947089946*G0_0_1 + 0.103339947089947*G0_1_0 - 0.344466490299824*G0_1_1;
+    A[433] = 0.0344466490299806*G0_0_0 - 0.0688932980599646*G0_0_1 - 0.0688932980599665*G0_1_0 - 0.516699735449737*G0_1_1;
+    A[434] = -0.142092427248674*G0_0_0 + 0.262655698853617*G0_0_1 + 0.262655698853618*G0_1_0;
+    A[435] = 1.03339947089945*G0_0_0 + 1.37786596119928*G0_0_1 + 1.37786596119928*G0_1_0 + 2.75573192239858*G0_1_1;
+    A[436] = -0.0861166225749425*G0_0_0 - 0.043058311287477*G0_0_1 - 0.043058311287473*G0_1_0 + 1.42092427248677*G0_1_1;
+    A[437] = 1.03339947089946*G0_0_0 - 0.344466490299825*G0_0_1 - 0.344466490299824*G0_1_0 + 1.03339947089947*G0_1_1;
+    A[438] = -2.02374063051144*G0_0_0 - 3.27243165784831*G0_0_1 - 3.27243165784831*G0_1_0 - 6.32957175925924*G0_1_1;
+    A[439] = -2.02374063051145*G0_0_0 + 1.24869102733686*G0_0_1 + 1.24869102733686*G0_1_0 - 1.80844907407407*G0_1_1;
+    A[440] = 7.9227292768959*G0_0_0 + 3.96136463844795*G0_0_1 + 3.96136463844795*G0_1_0 + 7.06156305114636*G0_1_1;
+}
+
+/// Constructor
+poisson2d_5_cell_integral_1_otherwise::poisson2d_5_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_5_cell_integral_1_otherwise::~poisson2d_5_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson2d_5_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson2d_5_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    21
+    // Number of operations (multiply-add pairs) for tensor contraction: 430
+    // Total number of operations (multiply-add pairs):                  454
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    const double G0_10 = det*w[0][10]*(1.0);
+    const double G0_11 = det*w[0][11]*(1.0);
+    const double G0_12 = det*w[0][12]*(1.0);
+    const double G0_13 = det*w[0][13]*(1.0);
+    const double G0_14 = det*w[0][14]*(1.0);
+    const double G0_15 = det*w[0][15]*(1.0);
+    const double G0_16 = det*w[0][16]*(1.0);
+    const double G0_17 = det*w[0][17]*(1.0);
+    const double G0_18 = det*w[0][18]*(1.0);
+    const double G0_19 = det*w[0][19]*(1.0);
+    const double G0_20 = det*w[0][20]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00138945256132761*G0_0 + 0.000123877456776765*G0_1 + 0.000123877456776765*G0_2 + 0.000363647010782439*G0_3 + 0.000207201813104596*G0_4 + 0.000207201813104597*G0_5 + 0.000363647010782438*G0_6 + 0.00118136348605102*G0_7 - 0.000958243145743178*G0_8 + 0.000462681126743636*G0_9 - 2.29644326866568e-05*G0_10 + 0.00118136348605102*G0_11 - 0.000958243145743178*G0_12 + 0.000462681126743638*G0_13 - 2.29644326866555e-05*G0_14 + 0.000892481361231364*G0_15 - 0.000974683591871135*G0_16 + 0.000879433388113953*G0_17 - 0.000974683591871131*G0_18 + 0.000649789061247419*G0_19 + 0.000879433388113951*G0_20;
+    A[1] = 0.000123877456776765*G0_0 + 0.00138945256132761*G0_1 + 0.000123877456776766*G0_2 + 0.00118136348605102*G0_3 - 0.000958243145743182*G0_4 + 0.000462681126743644*G0_5 - 2.2964432686658e-05*G0_6 + 0.000363647010782441*G0_7 + 0.000207201813104595*G0_8 + 0.000207201813104599*G0_9 + 0.000363647010782438*G0_10 - 2.29644326866539e-05*G0_11 + 0.000462681126743647*G0_12 - 0.000958243145743182*G0_13 + 0.00118136348605103*G0_14 + 0.000879433388113976*G0_15 - 0.000974683591871122*G0_16 + 0.00089248136123139*G0_17 + 0.000649789061247416*G0_18 - 0.000974683591871126*G0_19 + 0.00087943338811397*G0_20;
+    A[2] = 0.000123877456776765*G0_0 + 0.000123877456776766*G0_1 + 0.00138945256132761*G0_2 - 2.29644326866539e-05*G0_3 + 0.000462681126743638*G0_4 - 0.000958243145743175*G0_5 + 0.00118136348605102*G0_6 - 2.29644326866545e-05*G0_7 + 0.000462681126743639*G0_8 - 0.000958243145743178*G0_9 + 0.00118136348605102*G0_10 + 0.000363647010782442*G0_11 + 0.0002072018131046*G0_12 + 0.000207201813104598*G0_13 + 0.00036364701078244*G0_14 + 0.000879433388113975*G0_15 + 0.000649789061247419*G0_16 + 0.00087943338811397*G0_17 - 0.000974683591871126*G0_18 - 0.00097468359187113*G0_19 + 0.000892481361231379*G0_20;
+    A[3] = 0.000363647010782439*G0_0 + 0.00118136348605102*G0_1 - 2.29644326866539e-05*G0_2 + 0.0147050657033301*G0_3 - 0.00958373625474353*G0_4 + 0.00770482812583532*G0_5 - 0.00396984582097443*G0_6 - 0.000411011153198678*G0_7 - 0.00144832501603339*G0_8 - 4.56679059109682e-05*G0_9 - 0.00248237688558877*G0_10 - 0.00248237688558878*G0_11 + 0.00576068013134009*G0_12 - 0.00735253285166507*G0_13 + 0.00735253285166507*G0_14 + 0.00078287838704508*G0_15 - 0.00381653213684479*G0_16 + 0.0102426588971732*G0_17 - 0.00137003717732889*G0_18 + 9.78597983806315e-05*G0_19 - 0.00280531422024486*G0_20;
+    A[4] = 0.000207201813104596*G0_0 - 0.000958243145743182*G0_1 + 0.000462681126743638*G0_2 - 0.00958373625474353*G0_3 + 0.0220771705146713*G0_4 - 0.0134785562302928*G0_5 + 0.00770482812583534*G0_6 - 0.00144832501603339*G0_7 + 0.00281836219336229*G0_8 - 0.00135698920421147*G0_9 + 0.00576068013134005*G0_10 - 4.56679059109496e-05*G0_11 - 0.00135698920421148*G0_12 + 0.0029488419245365*G0_13 - 0.00735253285166506*G0_14 + 0.00313151354818033*G0_15 - 0.00548014870931554*G0_16 - 0.00143527704291599*G0_17 - 0.000587158790283811*G0_18 + 0.00528442911255429*G0_19 + 0.00508870951579302*G0_20;
+    A[5] = 0.000207201813104597*G0_0 + 0.000462681126743644*G0_1 - 0.000958243145743175*G0_2 + 0.00770482812583532*G0_3 - 0.0134785562302928*G0_4 + 0.0220771705146713*G0_5 - 0.00958373625474352*G0_6 - 4.56679059109687e-05*G0_7 - 0.00135698920421146*G0_8 + 0.00294884192453647*G0_9 - 0.00735253285166504*G0_10 - 0.0014483250160334*G0_11 + 0.00281836219336231*G0_12 - 0.00135698920421148*G0_13 + 0.00576068013134005*G0_14 + 0.00313151354818033*G0_15 - 0.000587158790283832*G0_16 + 0.00508870951579303*G0_17 - 0.00548014870931556*G0_18 + 0.0052844291125543*G0_19 - 0.00143527704291597*G0_20;
+    A[6] = 0.000363647010782438*G0_0 - 2.29644326866579e-05*G0_1 + 0.00118136348605102*G0_2 - 0.00396984582097443*G0_3 + 0.00770482812583534*G0_4 - 0.00958373625474352*G0_5 + 0.0147050657033301*G0_6 - 0.00248237688558878*G0_7 + 0.00576068013134005*G0_8 - 0.00735253285166505*G0_9 + 0.00735253285166505*G0_10 - 0.000411011153198661*G0_11 - 0.0014483250160334*G0_12 - 4.56679059109575e-05*G0_13 - 0.00248237688558878*G0_14 + 0.000782878387045073*G0_15 - 0.00137003717732888*G0_16 - 0.00280531422024488*G0_17 - 0.00381653213684476*G0_18 + 9.7859798380642e-05*G0_19 + 0.0102426588971731*G0_20;
+    A[7] = 0.00118136348605102*G0_0 + 0.000363647010782441*G0_1 - 2.29644326866545e-05*G0_2 - 0.000411011153198678*G0_3 - 0.00144832501603339*G0_4 - 4.56679059109689e-05*G0_5 - 0.00248237688558878*G0_6 + 0.0147050657033301*G0_7 - 0.00958373625474352*G0_8 + 0.00770482812583533*G0_9 - 0.00396984582097444*G0_10 + 0.00735253285166505*G0_11 - 0.00735253285166505*G0_12 + 0.00576068013134006*G0_13 - 0.00248237688558879*G0_14 + 0.0102426588971732*G0_15 - 0.00381653213684478*G0_16 + 0.000782878387045078*G0_17 + 9.78597983806186e-05*G0_18 - 0.00137003717732889*G0_19 - 0.00280531422024487*G0_20;
+    A[8] = -0.000958243145743178*G0_0 + 0.000207201813104595*G0_1 + 0.000462681126743639*G0_2 - 0.00144832501603339*G0_3 + 0.00281836219336229*G0_4 - 0.00135698920421147*G0_5 + 0.00576068013134005*G0_6 - 0.00958373625474352*G0_7 + 0.0220771705146712*G0_8 - 0.0134785562302928*G0_9 + 0.00770482812583534*G0_10 - 0.00735253285166504*G0_11 + 0.00294884192453647*G0_12 - 0.00135698920421148*G0_13 - 4.56679059109633e-05*G0_14 - 0.00143527704291601*G0_15 - 0.00548014870931555*G0_16 + 0.0031315135481803*G0_17 + 0.0052844291125543*G0_18 - 0.000587158790283819*G0_19 + 0.00508870951579298*G0_20;
+    A[9] = 0.000462681126743636*G0_0 + 0.0002072018131046*G0_1 - 0.000958243145743178*G0_2 - 4.56679059109682e-05*G0_3 - 0.00135698920421147*G0_4 + 0.00294884192453647*G0_5 - 0.00735253285166505*G0_6 + 0.00770482812583533*G0_7 - 0.0134785562302928*G0_8 + 0.0220771705146713*G0_9 - 0.00958373625474355*G0_10 + 0.00576068013134005*G0_11 - 0.00135698920421147*G0_12 + 0.0028183621933623*G0_13 - 0.0014483250160334*G0_14 + 0.00508870951579306*G0_15 - 0.000587158790283817*G0_16 + 0.00313151354818034*G0_17 + 0.00528442911255427*G0_18 - 0.00548014870931555*G0_19 - 0.00143527704291596*G0_20;
+    A[10] = -2.29644326866567e-05*G0_0 + 0.000363647010782438*G0_1 + 0.00118136348605102*G0_2 - 0.00248237688558877*G0_3 + 0.00576068013134005*G0_4 - 0.00735253285166504*G0_5 + 0.00735253285166505*G0_6 - 0.00396984582097444*G0_7 + 0.00770482812583534*G0_8 - 0.00958373625474355*G0_9 + 0.0147050657033301*G0_10 - 0.00248237688558878*G0_11 - 4.56679059109584e-05*G0_12 - 0.0014483250160334*G0_13 - 0.000411011153198662*G0_14 - 0.0028053142202449*G0_15 - 0.00137003717732888*G0_16 + 0.000782878387045079*G0_17 + 9.78597983806383e-05*G0_18 - 0.00381653213684477*G0_19 + 0.0102426588971731*G0_20;
+    A[11] = 0.00118136348605102*G0_0 - 2.29644326866539e-05*G0_1 + 0.000363647010782442*G0_2 - 0.00248237688558878*G0_3 - 4.56679059109497e-05*G0_4 - 0.0014483250160334*G0_5 - 0.000411011153198661*G0_6 + 0.00735253285166505*G0_7 - 0.00735253285166504*G0_8 + 0.00576068013134005*G0_9 - 0.00248237688558878*G0_10 + 0.0147050657033301*G0_11 - 0.00958373625474354*G0_12 + 0.00770482812583536*G0_13 - 0.00396984582097444*G0_14 + 0.0102426588971732*G0_15 + 9.7859798380627e-05*G0_16 - 0.00280531422024484*G0_17 - 0.00381653213684478*G0_18 - 0.00137003717732887*G0_19 + 0.000782878387045111*G0_20;
+    A[12] = -0.000958243145743178*G0_0 + 0.000462681126743647*G0_1 + 0.0002072018131046*G0_2 + 0.00576068013134009*G0_3 - 0.00135698920421148*G0_4 + 0.00281836219336231*G0_5 - 0.0014483250160334*G0_6 - 0.00735253285166505*G0_7 + 0.00294884192453647*G0_8 - 0.00135698920421147*G0_9 - 4.56679059109584e-05*G0_10 - 0.00958373625474354*G0_11 + 0.0220771705146713*G0_12 - 0.0134785562302928*G0_13 + 0.00770482812583538*G0_14 - 0.00143527704291595*G0_15 + 0.00528442911255429*G0_16 + 0.00508870951579309*G0_17 - 0.00548014870931556*G0_18 - 0.000587158790283808*G0_19 + 0.00313151354818035*G0_20;
+    A[13] = 0.000462681126743638*G0_0 - 0.000958243145743182*G0_1 + 0.000207201813104598*G0_2 - 0.00735253285166507*G0_3 + 0.0029488419245365*G0_4 - 0.00135698920421148*G0_5 - 4.5667905910958e-05*G0_6 + 0.00576068013134007*G0_7 - 0.00135698920421148*G0_8 + 0.0028183621933623*G0_9 - 0.0014483250160334*G0_10 + 0.00770482812583536*G0_11 - 0.0134785562302928*G0_12 + 0.0220771705146713*G0_13 - 0.00958373625474357*G0_14 + 0.00508870951579306*G0_15 + 0.0052844291125543*G0_16 - 0.00143527704291599*G0_17 - 0.000587158790283811*G0_18 - 0.00548014870931556*G0_19 + 0.00313151354818033*G0_20;
+    A[14] = -2.29644326866554e-05*G0_0 + 0.00118136348605103*G0_1 + 0.00036364701078244*G0_2 + 0.00735253285166507*G0_3 - 0.00735253285166506*G0_4 + 0.00576068013134005*G0_5 - 0.00248237688558878*G0_6 - 0.00248237688558879*G0_7 - 4.56679059109632e-05*G0_8 - 0.0014483250160334*G0_9 - 0.000411011153198661*G0_10 - 0.00396984582097444*G0_11 + 0.00770482812583538*G0_12 - 0.00958373625474357*G0_13 + 0.0147050657033301*G0_14 - 0.00280531422024488*G0_15 + 9.7859798380624e-05*G0_16 + 0.0102426588971732*G0_17 - 0.00137003717732889*G0_18 - 0.00381653213684476*G0_19 + 0.000782878387045086*G0_20;
+    A[15] = 0.000892481361231365*G0_0 + 0.000879433388113976*G0_1 + 0.000879433388113975*G0_2 + 0.00078287838704508*G0_3 + 0.00313151354818033*G0_4 + 0.00313151354818033*G0_5 + 0.000782878387045073*G0_6 + 0.0102426588971732*G0_7 - 0.00143527704291601*G0_8 + 0.00508870951579306*G0_9 - 0.0028053142202449*G0_10 + 0.0102426588971732*G0_11 - 0.00143527704291595*G0_12 + 0.00508870951579306*G0_13 - 0.00280531422024487*G0_14 + 0.0704590548340574*G0_15 - 0.0156575677409016*G0_16 + 0.0117431758056762*G0_17 - 0.0156575677409016*G0_18 + 0.0039143919352254*G0_19 + 0.0117431758056762*G0_20;
+    A[16] = -0.000974683591871135*G0_0 - 0.000974683591871122*G0_1 + 0.000649789061247419*G0_2 - 0.00381653213684479*G0_3 - 0.00548014870931554*G0_4 - 0.000587158790283832*G0_5 - 0.00137003717732888*G0_6 - 0.00381653213684478*G0_7 - 0.00548014870931555*G0_8 - 0.000587158790283815*G0_9 - 0.00137003717732888*G0_10 + 9.78597983806265e-05*G0_11 + 0.00528442911255429*G0_12 + 0.0052844291125543*G0_13 + 9.78597983806244e-05*G0_14 - 0.0156575677409016*G0_15 + 0.0763306427368953*G0_16 - 0.0156575677409016*G0_17 - 0.0117431758056762*G0_18 - 0.0117431758056762*G0_19 + 0.0039143919352254*G0_20;
+    A[17] = 0.000879433388113953*G0_0 + 0.00089248136123139*G0_1 + 0.00087943338811397*G0_2 + 0.0102426588971732*G0_3 - 0.00143527704291599*G0_4 + 0.00508870951579303*G0_5 - 0.00280531422024488*G0_6 + 0.000782878387045078*G0_7 + 0.0031315135481803*G0_8 + 0.00313151354818034*G0_9 + 0.000782878387045079*G0_10 - 0.00280531422024484*G0_11 + 0.00508870951579309*G0_12 - 0.00143527704291599*G0_13 + 0.0102426588971732*G0_14 + 0.0117431758056762*G0_15 - 0.0156575677409016*G0_16 + 0.0704590548340572*G0_17 + 0.00391439193522537*G0_18 - 0.0156575677409016*G0_19 + 0.0117431758056762*G0_20;
+    A[18] = -0.000974683591871131*G0_0 + 0.000649789061247416*G0_1 - 0.000974683591871126*G0_2 - 0.00137003717732889*G0_3 - 0.000587158790283811*G0_4 - 0.00548014870931556*G0_5 - 0.00381653213684476*G0_6 + 9.78597983806186e-05*G0_7 + 0.00528442911255429*G0_8 + 0.00528442911255427*G0_9 + 9.78597983806388e-05*G0_10 - 0.00381653213684478*G0_11 - 0.00548014870931557*G0_12 - 0.00058715879028381*G0_13 - 0.00137003717732889*G0_14 - 0.0156575677409016*G0_15 - 0.0117431758056762*G0_16 + 0.00391439193522537*G0_17 + 0.0763306427368953*G0_18 - 0.0117431758056762*G0_19 - 0.0156575677409016*G0_20;
+    A[19] = 0.000649789061247419*G0_0 - 0.000974683591871126*G0_1 - 0.00097468359187113*G0_2 + 9.78597983806303e-05*G0_3 + 0.00528442911255429*G0_4 + 0.0052844291125543*G0_5 + 9.78597983806421e-05*G0_6 - 0.00137003717732889*G0_7 - 0.000587158790283818*G0_8 - 0.00548014870931555*G0_9 - 0.00381653213684477*G0_10 - 0.00137003717732887*G0_11 - 0.000587158790283809*G0_12 - 0.00548014870931556*G0_13 - 0.00381653213684476*G0_14 + 0.00391439193522541*G0_15 - 0.0117431758056762*G0_16 - 0.0156575677409016*G0_17 - 0.0117431758056762*G0_18 + 0.0763306427368953*G0_19 - 0.0156575677409016*G0_20;
+    A[20] = 0.000879433388113951*G0_0 + 0.00087943338811397*G0_1 + 0.000892481361231379*G0_2 - 0.00280531422024486*G0_3 + 0.00508870951579302*G0_4 - 0.00143527704291597*G0_5 + 0.0102426588971731*G0_6 - 0.00280531422024487*G0_7 + 0.00508870951579298*G0_8 - 0.00143527704291596*G0_9 + 0.0102426588971731*G0_10 + 0.000782878387045111*G0_11 + 0.00313151354818035*G0_12 + 0.00313151354818033*G0_13 + 0.000782878387045086*G0_14 + 0.0117431758056762*G0_15 + 0.0039143919352254*G0_16 + 0.0117431758056762*G0_17 - 0.0156575677409016*G0_18 - 0.0156575677409017*G0_19 + 0.0704590548340572*G0_20;
+}
+
+/// Constructor
+poisson2d_5_form_0::poisson2d_5_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_5_form_0::~poisson2d_5_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_5_form_0::signature() const
+{
+    return "944b360928d96ca1ca281c1b4c2cb8b29cd22f204a85110b2b90670006beb2c3a859d863896862213a053634cc369deca81f4afa61c4e91c74820123ab17cd05";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_5_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_5_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_5_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_5_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_5_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_5_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_5_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_5_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_5_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_5_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_5_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_5_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_5_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_5_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_5_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_5_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_5_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_5_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_5_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_5_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_5_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_5_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_5_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_5_form_0::create_default_cell_integral() const
+{
+    return new poisson2d_5_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_5_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_5_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_5_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_5_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson2d_5_form_1::poisson2d_5_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson2d_5_form_1::~poisson2d_5_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson2d_5_form_1::signature() const
+{
+    return "8d1e3de65bbd30f6946ddf51ea0105e5dd67f6399f6f8ffb7e3b21feebe0c5e40a874d4beb56ad82feb38f70c606ce38f67d902b15c1873909b08e505d5bab0b";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson2d_5_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson2d_5_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson2d_5_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson2d_5_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson2d_5_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson2d_5_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson2d_5_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson2d_5_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson2d_5_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson2d_5_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson2d_5_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson2d_5_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson2d_5_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_5_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_5_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson2d_5_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_5_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_5_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson2d_5_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson2d_5_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson2d_5_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson2d_5_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson2d_5_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson2d_5_form_1::create_default_cell_integral() const
+{
+    return new poisson2d_5_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson2d_5_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson2d_5_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson2d_5_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson2d_5_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson2D_5.h b/bench/fem/convergence/cpp/Poisson2D_5.h
new file mode 100644
index 0000000..f375a65
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_5.h
@@ -0,0 +1,987 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no-evaluate_basis:              True
+//   no-evaluate_basis_derivatives:  True
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON2D_5_H
+#define __POISSON2D_5_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2d_5_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2d_5_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson2d_5_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2d_5_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2d_5_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson2d_5_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_5_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_5_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_5_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_5_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_5_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson2d_5_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_5_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_5_form_0();
+
+  /// Destructor
+  virtual ~poisson2d_5_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_5_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_5_form_1();
+
+  /// Destructor
+  virtual ~poisson2d_5_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2D_5
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_5_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_5_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_5_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_5_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_5_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_5_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_5_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_5_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_5_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_5_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson2D_5.ufl b/bench/fem/convergence/cpp/Poisson2D_5.ufl
new file mode 100644
index 0000000..97e5382
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson2D_5.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#
+# Poisson's equation in 2D for q = 5
+
+element = FiniteElement("Lagrange", triangle, 5)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/Poisson3D_1.cpp b/bench/fem/convergence/cpp/Poisson3D_1.cpp
new file mode 100644
index 0000000..7795bca
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_1.cpp
@@ -0,0 +1,1973 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson3D_1.h"
+
+/// Constructor
+poisson3d_1_finite_element_0::poisson3d_1_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_1_finite_element_0::~poisson3d_1_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson3d_1_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson3d_1_finite_element_0::cell_shape() const
+{
+    return ufc::tetrahedron;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson3d_1_finite_element_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson3d_1_finite_element_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson3d_1_finite_element_0::space_dimension() const
+{
+    return 4;
+}
+
+/// Return the rank of the value space
+std::size_t poisson3d_1_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson3d_1_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson3d_1_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson3d_1_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson3d_1_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson3d_1_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson3d_1_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson3d_1_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson3d_1_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson3d_1_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson3d_1_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson3d_1_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson3d_1_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson3d_1_finite_element_0::create() const
+{
+    return new poisson3d_1_finite_element_0();
+}
+
+/// Constructor
+poisson3d_1_dofmap_0::poisson3d_1_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_1_dofmap_0::~poisson3d_1_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson3d_1_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson3d_1_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson3d_1_dofmap_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson3d_1_dofmap_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson3d_1_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson3d_1_dofmap_0::local_dimension() const
+{
+    return 4;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson3d_1_dofmap_0::num_facet_dofs() const
+{
+    return 3;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson3d_1_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson3d_1_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson3d_1_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson3d_1_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson3d_1_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson3d_1_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson3d_1_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson3d_1_dofmap_0::create() const
+{
+    return new poisson3d_1_dofmap_0();
+}
+
+/// Constructor
+poisson3d_1_cell_integral_0_otherwise::poisson3d_1_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_1_cell_integral_0_otherwise::~poisson3d_1_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson3d_1_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson3d_1_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 28
+    // Total number of operations (multiply-add pairs):                  58
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1 + 0.166666666666667*G0_0_2 + 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1 + 0.166666666666667*G0_1_2 + 0.166666666666667*G0_2_0 + 0.166666666666667*G0_2_1 + 0.166666666666667*G0_2_2;
+    A[1] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_1_0 - 0.166666666666667*G0_2_0;
+    A[2] = -0.166666666666667*G0_0_1 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_2_1;
+    A[3] = -0.166666666666667*G0_0_2 - 0.166666666666667*G0_1_2 - 0.166666666666667*G0_2_2;
+    A[4] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_0_1 - 0.166666666666667*G0_0_2;
+    A[5] = 0.166666666666667*G0_0_0;
+    A[6] = 0.166666666666667*G0_0_1;
+    A[7] = 0.166666666666667*G0_0_2;
+    A[8] = -0.166666666666667*G0_1_0 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_1_2;
+    A[9] = 0.166666666666667*G0_1_0;
+    A[10] = 0.166666666666667*G0_1_1;
+    A[11] = 0.166666666666667*G0_1_2;
+    A[12] = -0.166666666666667*G0_2_0 - 0.166666666666667*G0_2_1 - 0.166666666666667*G0_2_2;
+    A[13] = 0.166666666666667*G0_2_0;
+    A[14] = 0.166666666666667*G0_2_1;
+    A[15] = 0.166666666666667*G0_2_2;
+}
+
+/// Constructor
+poisson3d_1_cell_integral_1_otherwise::poisson3d_1_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_1_cell_integral_1_otherwise::~poisson3d_1_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson3d_1_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson3d_1_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    4
+    // Number of operations (multiply-add pairs) for tensor contraction: 14
+    // Total number of operations (multiply-add pairs):                  21
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0 + 0.0083333333333333*G0_1 + 0.0083333333333333*G0_2 + 0.0083333333333333*G0_3;
+    A[1] = 0.0083333333333333*G0_0 + 0.0166666666666667*G0_1 + 0.00833333333333337*G0_2 + 0.00833333333333337*G0_3;
+    A[2] = 0.0083333333333333*G0_0 + 0.00833333333333337*G0_1 + 0.0166666666666667*G0_2 + 0.00833333333333337*G0_3;
+    A[3] = 0.0083333333333333*G0_0 + 0.00833333333333337*G0_1 + 0.00833333333333337*G0_2 + 0.0166666666666667*G0_3;
+}
+
+/// Constructor
+poisson3d_1_form_0::poisson3d_1_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_1_form_0::~poisson3d_1_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson3d_1_form_0::signature() const
+{
+    return "485ee4abc20119b82968409dcd30845bbd75cf8eb2d37865cd36ae609240e0096d0047eeab6075652c6e4268052caed39792496313b48a8a3cb2824bcd9e32aa";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson3d_1_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson3d_1_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson3d_1_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson3d_1_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson3d_1_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson3d_1_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson3d_1_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson3d_1_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson3d_1_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson3d_1_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson3d_1_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson3d_1_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson3d_1_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_1_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_1_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson3d_1_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_1_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_1_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson3d_1_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson3d_1_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson3d_1_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson3d_1_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson3d_1_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson3d_1_form_0::create_default_cell_integral() const
+{
+    return new poisson3d_1_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson3d_1_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson3d_1_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson3d_1_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson3d_1_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson3d_1_form_1::poisson3d_1_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_1_form_1::~poisson3d_1_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson3d_1_form_1::signature() const
+{
+    return "c082c1c25a4ba7a938c9ca1a7b631eccd027000fb5b9464fb5a3a47fc51677a6004507ea7b064954f22fae9f9055a367b38e0d5532a53056ac02b6014df53e23";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson3d_1_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson3d_1_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson3d_1_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson3d_1_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson3d_1_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson3d_1_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson3d_1_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson3d_1_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson3d_1_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson3d_1_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson3d_1_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson3d_1_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson3d_1_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_1_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_1_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson3d_1_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_1_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_1_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson3d_1_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson3d_1_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson3d_1_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson3d_1_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson3d_1_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson3d_1_form_1::create_default_cell_integral() const
+{
+    return new poisson3d_1_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson3d_1_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson3d_1_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson3d_1_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson3d_1_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson3D_1.h b/bench/fem/convergence/cpp/Poisson3D_1.h
new file mode 100644
index 0000000..d2384ce
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_1.h
@@ -0,0 +1,985 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON3D_1_H
+#define __POISSON3D_1_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson3d_1_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson3d_1_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson3d_1_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson3d_1_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson3d_1_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson3d_1_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_1_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_1_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson3d_1_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_1_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_1_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson3d_1_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_1_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_1_form_0();
+
+  /// Destructor
+  virtual ~poisson3d_1_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_1_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_1_form_1();
+
+  /// Destructor
+  virtual ~poisson3d_1_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson3D_1
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_1_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_1_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_1_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_1_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson3D_1.ufl b/bench/fem/convergence/cpp/Poisson3D_1.ufl
new file mode 100644
index 0000000..abc182a
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_1.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#
+# Poisson's equation in 3D for q = 1
+
+element = FiniteElement("Lagrange", tetrahedron, 1)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/Poisson3D_2.cpp b/bench/fem/convergence/cpp/Poisson3D_2.cpp
new file mode 100644
index 0000000..0617da1
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_2.cpp
@@ -0,0 +1,3972 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson3D_2.h"
+
+/// Constructor
+poisson3d_2_finite_element_0::poisson3d_2_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_2_finite_element_0::~poisson3d_2_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson3d_2_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson3d_2_finite_element_0::cell_shape() const
+{
+    return ufc::tetrahedron;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson3d_2_finite_element_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson3d_2_finite_element_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson3d_2_finite_element_0::space_dimension() const
+{
+    return 10;
+}
+
+/// Return the rank of the value space
+std::size_t poisson3d_2_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson3d_2_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson3d_2_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson3d_2_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson3d_2_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson3d_2_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson3d_2_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson3d_2_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson3d_2_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson3d_2_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson3d_2_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson3d_2_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson3d_2_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson3d_2_finite_element_0::create() const
+{
+    return new poisson3d_2_finite_element_0();
+}
+
+/// Constructor
+poisson3d_2_dofmap_0::poisson3d_2_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_2_dofmap_0::~poisson3d_2_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson3d_2_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson3d_2_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson3d_2_dofmap_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson3d_2_dofmap_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson3d_2_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0] + num_global_entities[1];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson3d_2_dofmap_0::local_dimension() const
+{
+    return 10;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson3d_2_dofmap_0::num_facet_dofs() const
+{
+    return 6;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson3d_2_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson3d_2_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson3d_2_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson3d_2_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson3d_2_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson3d_2_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson3d_2_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson3d_2_dofmap_0::create() const
+{
+    return new poisson3d_2_dofmap_0();
+}
+
+/// Constructor
+poisson3d_2_cell_integral_0_otherwise::poisson3d_2_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_2_cell_integral_0_otherwise::~poisson3d_2_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson3d_2_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson3d_2_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 331
+    // Total number of operations (multiply-add pairs):                  361
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.1*G0_0_0 + 0.1*G0_0_1 + 0.1*G0_0_2 + 0.1*G0_1_0 + 0.1*G0_1_1 + 0.1*G0_1_2 + 0.1*G0_2_0 + 0.1*G0_2_1 + 0.1*G0_2_2;
+    A[1] = 0.0333333333333333*G0_0_0 + 0.0333333333333333*G0_1_0 + 0.0333333333333333*G0_2_0;
+    A[2] = 0.0333333333333333*G0_0_1 + 0.0333333333333333*G0_1_1 + 0.0333333333333333*G0_2_1;
+    A[3] = 0.0333333333333333*G0_0_2 + 0.0333333333333333*G0_1_2 + 0.0333333333333333*G0_2_2;
+    A[4] = 0.0333333333333342*G0_0_1 + 0.0333333333333342*G0_0_2 + 0.0333333333333342*G0_1_1 + 0.0333333333333342*G0_1_2 + 0.0333333333333342*G0_2_1 + 0.0333333333333342*G0_2_2;
+    A[5] = 0.0333333333333342*G0_0_0 + 0.0333333333333343*G0_0_2 + 0.0333333333333342*G0_1_0 + 0.0333333333333343*G0_1_2 + 0.0333333333333342*G0_2_0 + 0.0333333333333343*G0_2_2;
+    A[6] = 0.0333333333333342*G0_0_0 + 0.0333333333333342*G0_0_1 + 0.0333333333333342*G0_1_0 + 0.0333333333333343*G0_1_1 + 0.0333333333333342*G0_2_0 + 0.0333333333333342*G0_2_1;
+    A[7] = -0.0333333333333342*G0_0_0 - 0.0333333333333342*G0_0_1 - 0.133333333333333*G0_0_2 - 0.0333333333333342*G0_1_0 - 0.0333333333333342*G0_1_1 - 0.133333333333333*G0_1_2 - 0.0333333333333342*G0_2_0 - 0.0333333333333343*G0_2_1 - 0.133333333333333*G0_2_2;
+    A[8] = -0.0333333333333342*G0_0_0 - 0.133333333333333*G0_0_1 - 0.0333333333333342*G0_0_2 - 0.0333333333333342*G0_1_0 - 0.133333333333333*G0_1_1 - 0.0333333333333342*G0_1_2 - 0.0333333333333342*G0_2_0 - 0.133333333333333*G0_2_1 - 0.0333333333333342*G0_2_2;
+    A[9] = -0.133333333333333*G0_0_0 - 0.0333333333333343*G0_0_1 - 0.0333333333333343*G0_0_2 - 0.133333333333333*G0_1_0 - 0.0333333333333343*G0_1_1 - 0.0333333333333343*G0_1_2 - 0.133333333333333*G0_2_0 - 0.0333333333333343*G0_2_1 - 0.0333333333333343*G0_2_2;
+    A[10] = 0.0333333333333333*G0_0_0 + 0.0333333333333333*G0_0_1 + 0.0333333333333333*G0_0_2;
+    A[11] = 0.1*G0_0_0;
+    A[12] = -0.0333333333333333*G0_0_1;
+    A[13] = -0.0333333333333333*G0_0_2;
+    A[14] = -0.033333333333333*G0_0_1 - 0.033333333333333*G0_0_2;
+    A[15] = -0.033333333333333*G0_0_0 + 0.1*G0_0_2;
+    A[16] = -0.033333333333333*G0_0_0 + 0.1*G0_0_1;
+    A[17] = 0.033333333333333*G0_0_0 + 0.033333333333333*G0_0_1;
+    A[18] = 0.033333333333333*G0_0_0 + 0.033333333333333*G0_0_2;
+    A[19] = -0.133333333333333*G0_0_0 - 0.1*G0_0_1 - 0.1*G0_0_2;
+    A[20] = 0.0333333333333333*G0_1_0 + 0.0333333333333333*G0_1_1 + 0.0333333333333333*G0_1_2;
+    A[21] = -0.0333333333333333*G0_1_0;
+    A[22] = 0.1*G0_1_1;
+    A[23] = -0.0333333333333334*G0_1_2;
+    A[24] = -0.033333333333333*G0_1_1 + 0.1*G0_1_2;
+    A[25] = -0.033333333333333*G0_1_0 - 0.033333333333333*G0_1_2;
+    A[26] = 0.1*G0_1_0 - 0.033333333333333*G0_1_1;
+    A[27] = 0.033333333333333*G0_1_0 + 0.033333333333333*G0_1_1;
+    A[28] = -0.1*G0_1_0 - 0.133333333333333*G0_1_1 - 0.1*G0_1_2;
+    A[29] = 0.033333333333333*G0_1_1 + 0.033333333333333*G0_1_2;
+    A[30] = 0.0333333333333333*G0_2_0 + 0.0333333333333333*G0_2_1 + 0.0333333333333333*G0_2_2;
+    A[31] = -0.0333333333333333*G0_2_0;
+    A[32] = -0.0333333333333334*G0_2_1;
+    A[33] = 0.1*G0_2_2;
+    A[34] = 0.1*G0_2_1 - 0.0333333333333331*G0_2_2;
+    A[35] = 0.1*G0_2_0 - 0.0333333333333331*G0_2_2;
+    A[36] = -0.0333333333333331*G0_2_0 - 0.0333333333333331*G0_2_1;
+    A[37] = -0.1*G0_2_0 - 0.1*G0_2_1 - 0.133333333333333*G0_2_2;
+    A[38] = 0.0333333333333331*G0_2_0 + 0.0333333333333331*G0_2_2;
+    A[39] = 0.0333333333333331*G0_2_1 + 0.0333333333333331*G0_2_2;
+    A[40] = 0.0333333333333342*G0_1_0 + 0.0333333333333342*G0_1_1 + 0.0333333333333343*G0_1_2 + 0.0333333333333342*G0_2_0 + 0.0333333333333342*G0_2_1 + 0.0333333333333342*G0_2_2;
+    A[41] = -0.033333333333333*G0_1_0 - 0.033333333333333*G0_2_0;
+    A[42] = -0.033333333333333*G0_1_1 + 0.1*G0_2_1;
+    A[43] = 0.1*G0_1_2 - 0.0333333333333331*G0_2_2;
+    A[44] = 0.266666666666667*G0_1_1 + 0.133333333333334*G0_1_2 + 0.133333333333334*G0_2_1 + 0.266666666666667*G0_2_2;
+    A[45] = 0.266666666666667*G0_1_0 + 0.133333333333334*G0_1_2 + 0.133333333333334*G0_2_0 + 0.133333333333334*G0_2_2;
+    A[46] = 0.133333333333334*G0_1_0 + 0.133333333333334*G0_1_1 + 0.266666666666667*G0_2_0 + 0.133333333333334*G0_2_1;
+    A[47] = -0.266666666666667*G0_1_0 - 0.266666666666667*G0_1_1 - 0.133333333333335*G0_1_2 - 0.133333333333334*G0_2_0 - 0.133333333333334*G0_2_1;
+    A[48] = -0.133333333333334*G0_1_0 - 0.133333333333334*G0_1_2 - 0.266666666666667*G0_2_0 - 0.133333333333335*G0_2_1 - 0.266666666666667*G0_2_2;
+    A[49] = -0.133333333333334*G0_1_1 - 0.133333333333334*G0_1_2 - 0.133333333333334*G0_2_1 - 0.133333333333334*G0_2_2;
+    A[50] = 0.0333333333333342*G0_0_0 + 0.0333333333333342*G0_0_1 + 0.0333333333333342*G0_0_2 + 0.0333333333333343*G0_2_0 + 0.0333333333333343*G0_2_1 + 0.0333333333333343*G0_2_2;
+    A[51] = -0.033333333333333*G0_0_0 + 0.1*G0_2_0;
+    A[52] = -0.033333333333333*G0_0_1 - 0.033333333333333*G0_2_1;
+    A[53] = 0.1*G0_0_2 - 0.0333333333333331*G0_2_2;
+    A[54] = 0.266666666666667*G0_0_1 + 0.133333333333334*G0_0_2 + 0.133333333333334*G0_2_1 + 0.133333333333334*G0_2_2;
+    A[55] = 0.266666666666667*G0_0_0 + 0.133333333333334*G0_0_2 + 0.133333333333334*G0_2_0 + 0.266666666666667*G0_2_2;
+    A[56] = 0.133333333333334*G0_0_0 + 0.133333333333334*G0_0_1 + 0.133333333333334*G0_2_0 + 0.266666666666667*G0_2_1;
+    A[57] = -0.266666666666667*G0_0_0 - 0.266666666666667*G0_0_1 - 0.133333333333335*G0_0_2 - 0.133333333333334*G0_2_0 - 0.133333333333334*G0_2_1;
+    A[58] = -0.133333333333334*G0_0_0 - 0.133333333333334*G0_0_2 - 0.133333333333334*G0_2_0 - 0.133333333333334*G0_2_2;
+    A[59] = -0.133333333333334*G0_0_1 - 0.133333333333334*G0_0_2 - 0.133333333333335*G0_2_0 - 0.266666666666667*G0_2_1 - 0.266666666666667*G0_2_2;
+    A[60] = 0.0333333333333342*G0_0_0 + 0.0333333333333342*G0_0_1 + 0.0333333333333342*G0_0_2 + 0.0333333333333342*G0_1_0 + 0.0333333333333343*G0_1_1 + 0.0333333333333342*G0_1_2;
+    A[61] = -0.033333333333333*G0_0_0 + 0.1*G0_1_0;
+    A[62] = 0.1*G0_0_1 - 0.033333333333333*G0_1_1;
+    A[63] = -0.0333333333333331*G0_0_2 - 0.0333333333333331*G0_1_2;
+    A[64] = 0.133333333333334*G0_0_1 + 0.266666666666667*G0_0_2 + 0.133333333333334*G0_1_1 + 0.133333333333334*G0_1_2;
+    A[65] = 0.133333333333334*G0_0_0 + 0.133333333333334*G0_0_2 + 0.133333333333334*G0_1_0 + 0.266666666666667*G0_1_2;
+    A[66] = 0.266666666666667*G0_0_0 + 0.133333333333334*G0_0_1 + 0.133333333333334*G0_1_0 + 0.266666666666667*G0_1_1;
+    A[67] = -0.133333333333334*G0_0_0 - 0.133333333333334*G0_0_1 - 0.133333333333334*G0_1_0 - 0.133333333333334*G0_1_1;
+    A[68] = -0.266666666666667*G0_0_0 - 0.133333333333335*G0_0_1 - 0.266666666666667*G0_0_2 - 0.133333333333334*G0_1_0 - 0.133333333333334*G0_1_2;
+    A[69] = -0.133333333333334*G0_0_1 - 0.133333333333334*G0_0_2 - 0.133333333333335*G0_1_0 - 0.266666666666667*G0_1_1 - 0.266666666666667*G0_1_2;
+    A[70] = -0.0333333333333342*G0_0_0 - 0.0333333333333342*G0_0_1 - 0.0333333333333342*G0_0_2 - 0.0333333333333342*G0_1_0 - 0.0333333333333342*G0_1_1 - 0.0333333333333343*G0_1_2 - 0.133333333333333*G0_2_0 - 0.133333333333333*G0_2_1 - 0.133333333333333*G0_2_2;
+    A[71] = 0.033333333333333*G0_0_0 + 0.033333333333333*G0_1_0;
+    A[72] = 0.033333333333333*G0_0_1 + 0.033333333333333*G0_1_1;
+    A[73] = -0.1*G0_0_2 - 0.1*G0_1_2 - 0.133333333333333*G0_2_2;
+    A[74] = -0.266666666666667*G0_0_1 - 0.133333333333334*G0_0_2 - 0.266666666666667*G0_1_1 - 0.133333333333334*G0_1_2 - 0.133333333333335*G0_2_1;
+    A[75] = -0.266666666666667*G0_0_0 - 0.133333333333334*G0_0_2 - 0.266666666666667*G0_1_0 - 0.133333333333334*G0_1_2 - 0.133333333333335*G0_2_0;
+    A[76] = -0.133333333333334*G0_0_0 - 0.133333333333334*G0_0_1 - 0.133333333333334*G0_1_0 - 0.133333333333334*G0_1_1;
+    A[77] = 0.266666666666667*G0_0_0 + 0.266666666666667*G0_0_1 + 0.133333333333335*G0_0_2 + 0.266666666666667*G0_1_0 + 0.266666666666667*G0_1_1 + 0.133333333333335*G0_1_2 + 0.133333333333335*G0_2_0 + 0.133333333333335*G0_2_1 + 0.266666666666666*G0_2_2;
+    A[78] = 0.133333333333334*G0_0_0 + 0.133333333333334*G0_0_2 + 0.133333333333334*G0_1_0 + 0.133333333333334*G0_1_2 + 0.133333333333333*G0_2_1;
+    A[79] = 0.133333333333334*G0_0_1 + 0.133333333333334*G0_0_2 + 0.133333333333334*G0_1_1 + 0.133333333333334*G0_1_2 + 0.133333333333333*G0_2_0;
+    A[80] = -0.0333333333333342*G0_0_0 - 0.0333333333333342*G0_0_1 - 0.0333333333333342*G0_0_2 - 0.133333333333333*G0_1_0 - 0.133333333333333*G0_1_1 - 0.133333333333333*G0_1_2 - 0.0333333333333342*G0_2_0 - 0.0333333333333342*G0_2_1 - 0.0333333333333342*G0_2_2;
+    A[81] = 0.033333333333333*G0_0_0 + 0.033333333333333*G0_2_0;
+    A[82] = -0.1*G0_0_1 - 0.133333333333333*G0_1_1 - 0.1*G0_2_1;
+    A[83] = 0.0333333333333331*G0_0_2 + 0.0333333333333331*G0_2_2;
+    A[84] = -0.133333333333334*G0_0_1 - 0.266666666666667*G0_0_2 - 0.133333333333335*G0_1_2 - 0.133333333333334*G0_2_1 - 0.266666666666667*G0_2_2;
+    A[85] = -0.133333333333334*G0_0_0 - 0.133333333333334*G0_0_2 - 0.133333333333334*G0_2_0 - 0.133333333333334*G0_2_2;
+    A[86] = -0.266666666666667*G0_0_0 - 0.133333333333334*G0_0_1 - 0.133333333333335*G0_1_0 - 0.266666666666667*G0_2_0 - 0.133333333333334*G0_2_1;
+    A[87] = 0.133333333333334*G0_0_0 + 0.133333333333334*G0_0_1 + 0.133333333333333*G0_1_2 + 0.133333333333334*G0_2_0 + 0.133333333333334*G0_2_1;
+    A[88] = 0.266666666666667*G0_0_0 + 0.133333333333335*G0_0_1 + 0.266666666666667*G0_0_2 + 0.133333333333335*G0_1_0 + 0.266666666666667*G0_1_1 + 0.133333333333334*G0_1_2 + 0.266666666666667*G0_2_0 + 0.133333333333334*G0_2_1 + 0.266666666666667*G0_2_2;
+    A[89] = 0.133333333333334*G0_0_1 + 0.133333333333334*G0_0_2 + 0.133333333333333*G0_1_0 + 0.133333333333334*G0_2_1 + 0.133333333333334*G0_2_2;
+    A[90] = -0.133333333333333*G0_0_0 - 0.133333333333333*G0_0_1 - 0.133333333333333*G0_0_2 - 0.0333333333333342*G0_1_0 - 0.0333333333333343*G0_1_1 - 0.0333333333333343*G0_1_2 - 0.0333333333333343*G0_2_0 - 0.0333333333333343*G0_2_1 - 0.0333333333333343*G0_2_2;
+    A[91] = -0.133333333333333*G0_0_0 - 0.1*G0_1_0 - 0.1*G0_2_0;
+    A[92] = 0.033333333333333*G0_1_1 + 0.033333333333333*G0_2_1;
+    A[93] = 0.0333333333333331*G0_1_2 + 0.0333333333333331*G0_2_2;
+    A[94] = -0.133333333333334*G0_1_1 - 0.133333333333334*G0_1_2 - 0.133333333333334*G0_2_1 - 0.133333333333334*G0_2_2;
+    A[95] = -0.133333333333335*G0_0_2 - 0.133333333333334*G0_1_0 - 0.266666666666667*G0_1_2 - 0.133333333333334*G0_2_0 - 0.266666666666667*G0_2_2;
+    A[96] = -0.133333333333334*G0_0_1 - 0.133333333333334*G0_1_0 - 0.266666666666667*G0_1_1 - 0.133333333333334*G0_2_0 - 0.266666666666667*G0_2_1;
+    A[97] = 0.133333333333333*G0_0_2 + 0.133333333333334*G0_1_0 + 0.133333333333334*G0_1_1 + 0.133333333333334*G0_2_0 + 0.133333333333334*G0_2_1;
+    A[98] = 0.133333333333333*G0_0_1 + 0.133333333333334*G0_1_0 + 0.133333333333334*G0_1_2 + 0.133333333333334*G0_2_0 + 0.133333333333334*G0_2_2;
+    A[99] = 0.266666666666667*G0_0_0 + 0.133333333333335*G0_0_1 + 0.133333333333335*G0_0_2 + 0.133333333333335*G0_1_0 + 0.266666666666667*G0_1_1 + 0.266666666666667*G0_1_2 + 0.133333333333335*G0_2_0 + 0.266666666666667*G0_2_1 + 0.266666666666667*G0_2_2;
+}
+
+/// Constructor
+poisson3d_2_cell_integral_1_otherwise::poisson3d_2_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_2_cell_integral_1_otherwise::~poisson3d_2_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson3d_2_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson3d_2_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    10
+    // Number of operations (multiply-add pairs) for tensor contraction: 95
+    // Total number of operations (multiply-add pairs):                  108
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00238095238095238*G0_0 + 0.000396825396825396*G0_1 + 0.000396825396825396*G0_2 + 0.000396825396825396*G0_3 - 0.00238095238095238*G0_4 - 0.00238095238095238*G0_5 - 0.00238095238095238*G0_6 - 0.00158730158730159*G0_7 - 0.00158730158730158*G0_8 - 0.00158730158730159*G0_9;
+    A[1] = 0.000396825396825396*G0_0 + 0.00238095238095238*G0_1 + 0.000396825396825395*G0_2 + 0.000396825396825396*G0_3 - 0.00238095238095238*G0_4 - 0.00158730158730158*G0_5 - 0.00158730158730158*G0_6 - 0.00238095238095238*G0_7 - 0.00238095238095238*G0_8 - 0.00158730158730158*G0_9;
+    A[2] = 0.000396825396825396*G0_0 + 0.000396825396825395*G0_1 + 0.00238095238095238*G0_2 + 0.000396825396825396*G0_3 - 0.00158730158730159*G0_4 - 0.00238095238095238*G0_5 - 0.00158730158730158*G0_6 - 0.00238095238095238*G0_7 - 0.00158730158730159*G0_8 - 0.00238095238095238*G0_9;
+    A[3] = 0.000396825396825396*G0_0 + 0.000396825396825396*G0_1 + 0.000396825396825396*G0_2 + 0.00238095238095238*G0_3 - 0.00158730158730159*G0_4 - 0.00158730158730159*G0_5 - 0.00238095238095238*G0_6 - 0.00158730158730159*G0_7 - 0.00238095238095238*G0_8 - 0.00238095238095238*G0_9;
+    A[4] = -0.00238095238095238*G0_0 - 0.00238095238095238*G0_1 - 0.00158730158730159*G0_2 - 0.00158730158730159*G0_3 + 0.0126984126984127*G0_4 + 0.00634920634920635*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00634920634920634*G0_8 + 0.00317460317460317*G0_9;
+    A[5] = -0.00238095238095238*G0_0 - 0.00158730158730158*G0_1 - 0.00238095238095238*G0_2 - 0.00158730158730159*G0_3 + 0.00634920634920635*G0_4 + 0.0126984126984127*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00317460317460317*G0_8 + 0.00634920634920635*G0_9;
+    A[6] = -0.00238095238095238*G0_0 - 0.00158730158730158*G0_1 - 0.00158730158730158*G0_2 - 0.00238095238095238*G0_3 + 0.00634920634920635*G0_4 + 0.00634920634920635*G0_5 + 0.0126984126984127*G0_6 + 0.00317460317460317*G0_7 + 0.00634920634920634*G0_8 + 0.00634920634920635*G0_9;
+    A[7] = -0.00158730158730159*G0_0 - 0.00238095238095238*G0_1 - 0.00238095238095238*G0_2 - 0.00158730158730159*G0_3 + 0.00634920634920635*G0_4 + 0.00634920634920635*G0_5 + 0.00317460317460317*G0_6 + 0.0126984126984127*G0_7 + 0.00634920634920635*G0_8 + 0.00634920634920635*G0_9;
+    A[8] = -0.00158730158730158*G0_0 - 0.00238095238095238*G0_1 - 0.00158730158730159*G0_2 - 0.00238095238095238*G0_3 + 0.00634920634920634*G0_4 + 0.00317460317460317*G0_5 + 0.00634920634920634*G0_6 + 0.00634920634920635*G0_7 + 0.0126984126984127*G0_8 + 0.00634920634920634*G0_9;
+    A[9] = -0.00158730158730159*G0_0 - 0.00158730158730158*G0_1 - 0.00238095238095238*G0_2 - 0.00238095238095238*G0_3 + 0.00317460317460317*G0_4 + 0.00634920634920635*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00634920634920634*G0_8 + 0.0126984126984127*G0_9;
+}
+
+/// Constructor
+poisson3d_2_form_0::poisson3d_2_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_2_form_0::~poisson3d_2_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson3d_2_form_0::signature() const
+{
+    return "5632f72de90dfbfc3cc44b8f86ca996b11b812f9cd6707bcfc15d42f2b78d777beea6280ab7055e511165389ca4718c1aaa2b69298cb55dc03fdf4a76fc035d2";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson3d_2_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson3d_2_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson3d_2_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson3d_2_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson3d_2_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson3d_2_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson3d_2_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson3d_2_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson3d_2_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson3d_2_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson3d_2_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson3d_2_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson3d_2_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_2_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_2_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson3d_2_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_2_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_2_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson3d_2_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson3d_2_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson3d_2_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson3d_2_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson3d_2_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson3d_2_form_0::create_default_cell_integral() const
+{
+    return new poisson3d_2_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson3d_2_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson3d_2_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson3d_2_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson3d_2_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson3d_2_form_1::poisson3d_2_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_2_form_1::~poisson3d_2_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson3d_2_form_1::signature() const
+{
+    return "43145964686b6b70399e810d68d5808ce481de0ab7937b15e48b40c9c4e3f124b2b0cfc9e3998c7c2f4200754bde07ead6b75338da5888fb3b177a9b17db6f81";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson3d_2_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson3d_2_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson3d_2_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson3d_2_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson3d_2_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson3d_2_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson3d_2_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson3d_2_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson3d_2_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson3d_2_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson3d_2_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson3d_2_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson3d_2_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_2_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_2_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson3d_2_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_2_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_2_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson3d_2_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson3d_2_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson3d_2_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson3d_2_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson3d_2_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson3d_2_form_1::create_default_cell_integral() const
+{
+    return new poisson3d_2_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson3d_2_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson3d_2_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson3d_2_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson3d_2_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson3D_2.h b/bench/fem/convergence/cpp/Poisson3D_2.h
new file mode 100644
index 0000000..6537fea
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_2.h
@@ -0,0 +1,985 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON3D_2_H
+#define __POISSON3D_2_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson3d_2_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson3d_2_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson3d_2_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson3d_2_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson3d_2_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson3d_2_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_2_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_2_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson3d_2_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_2_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_2_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson3d_2_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_2_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_2_form_0();
+
+  /// Destructor
+  virtual ~poisson3d_2_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_2_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_2_form_1();
+
+  /// Destructor
+  virtual ~poisson3d_2_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson3D_2
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_2_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_2_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_2_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_2_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson3D_2.ufl b/bench/fem/convergence/cpp/Poisson3D_2.ufl
new file mode 100644
index 0000000..31812fe
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_2.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#    
+# Poisson's equation in 3D for q = 2
+
+element = FiniteElement("Lagrange", tetrahedron, 2)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/Poisson3D_3.cpp b/bench/fem/convergence/cpp/Poisson3D_3.cpp
new file mode 100644
index 0000000..84c52d0
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_3.cpp
@@ -0,0 +1,8813 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson3D_3.h"
+
+/// Constructor
+poisson3d_3_finite_element_0::poisson3d_3_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_3_finite_element_0::~poisson3d_3_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson3d_3_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 3, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson3d_3_finite_element_0::cell_shape() const
+{
+    return ufc::tetrahedron;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson3d_3_finite_element_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson3d_3_finite_element_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson3d_3_finite_element_0::space_dimension() const
+{
+    return 20;
+}
+
+/// Return the rank of the value space
+std::size_t poisson3d_3_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson3d_3_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson3d_3_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0288675134594813, 0.0130410132739325, 0.00752923252421043, 0.0053239713749995, 0.018298126367785, 0.014173667737846, 0.0115727512471569, 0.00818317088384972, 0.00668153104781059, 0.00472455591261533, -0.028347335475692, -0.0239578711874978, -0.0207481250689683, -0.0185576872239523, -0.0160714285714286, -0.0131222664791956, -0.0107142857142857, -0.00927884361197611, -0.00757614408414157, -0.00535714285714285};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0288675134594812, -0.0130410132739325, 0.0075292325242104, 0.00532397137499951, 0.018298126367785, -0.014173667737846, -0.0115727512471569, 0.00818317088384971, 0.00668153104781063, 0.00472455591261534, 0.028347335475692, -0.0239578711874977, -0.0207481250689683, 0.0185576872239523, 0.0160714285714286, 0.0131222664791956, -0.0107142857142857, -0.00927884361197613, -0.00757614408414159, -0.00535714285714286};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0288675134594812, 0.0, -0.0150584650484209, 0.00532397137499951, 0.0, 0.0, 0.0, 0.0245495126515492, -0.0133630620956212, 0.00472455591261537, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0428571428571429, -0.0278365308359284, 0.0151522881682832, -0.00535714285714287};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0288675134594813, 0.0, 0.0, -0.0159719141249985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.028347335475692, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0535714285714286};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0, 0.112938487863156, -0.063887656499994, 0.0, 0.0, 0.0, 0.0736485379546474, 0.0267261241912424, -0.0236227795630767, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0649519052838329, -0.0606091526731326, 0.0267857142857143};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0, -0.0225876975726313, 0.127775312999988, 0.0, 0.0, 0.0, 0.0, 0.0668153104781061, 0.0472455591261534, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0757614408414158, -0.0535714285714286};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0978075995544939, -0.0564692439315782, -0.063887656499994, 0.054894379103355, -0.0425210032135381, 0.0231455024943138, 0.0245495126515491, -0.0133630620956212, -0.0236227795630767, 0.0, 0.0, 0.0484122918275927, 0.0, -0.0375, -0.0524890659167824, 0.0, 0.0216506350946109, 0.0303045763365663, 0.0267857142857143};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.0195615199108989, 0.0112938487863156, 0.127775312999988, 0.0, 0.0, 0.0578637562357844, 0.0, -0.0334076552390531, 0.0472455591261534, 0.0, 0.0, 0.0, 0.0, 0.0, 0.065611332395978, 0.0, 0.0, -0.0378807204207079, -0.0535714285714286};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.097807599554494, -0.0790569415042095, -0.031943828249997, 0.054894379103355, 0.014173667737846, -0.0462910049886276, -0.0245495126515492, 0.0133630620956212, 0.0236227795630767, 0.0, 0.0479157423749955, -0.0069160416896561, -0.0618589574131742, -0.0160714285714286, 0.00874817765279706, 0.0428571428571429, 0.0154647393532935, 0.0, -0.00535714285714286};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.0195615199108988, 0.124232336649472, -0.031943828249997, 0.0, 0.0566946709513841, -0.0115727512471569, 0.0245495126515492, -0.0467707173346743, 0.0236227795630767, 0.0, 0.0, 0.0, 0.0618589574131742, -0.0214285714285714, 0.00437408882639853, -0.0642857142857143, 0.00927884361197613, 0.00757614408414158, -0.00535714285714285};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.0978075995544939, -0.0564692439315782, -0.063887656499994, 0.054894379103355, 0.0425210032135381, -0.0231455024943137, 0.0245495126515491, -0.0133630620956212, -0.0236227795630767, 0.0, 0.0, 0.0484122918275927, 0.0, 0.0375, 0.0524890659167824, 0.0, 0.021650635094611, 0.0303045763365663, 0.0267857142857143};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0195615199108988, 0.0112938487863156, 0.127775312999988, 0.0, 0.0, -0.0578637562357845, 0.0, -0.033407655239053, 0.0472455591261534, 0.0, 0.0, 0.0, 0.0, 0.0, -0.065611332395978, 0.0, 0.0, -0.0378807204207079, -0.0535714285714286};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.097807599554494, -0.0790569415042095, -0.031943828249997, 0.054894379103355, -0.014173667737846, 0.0462910049886276, -0.0245495126515492, 0.0133630620956212, 0.0236227795630767, 0.0, 0.0479157423749955, -0.0069160416896561, 0.0618589574131742, 0.0160714285714286, -0.00874817765279707, 0.0428571428571429, 0.0154647393532935, 0.0, -0.00535714285714287};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0195615199108988, 0.124232336649472, -0.031943828249997, 0.0, -0.0566946709513841, 0.0115727512471569, 0.0245495126515492, -0.0467707173346743, 0.0236227795630767, 0.0, 0.0, 0.0, -0.0618589574131742, 0.0214285714285714, -0.00437408882639852, -0.0642857142857143, 0.00927884361197614, 0.00757614408414158, -0.00535714285714285};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.117369119465393, -0.0451753951452625, -0.031943828249997, -0.018298126367785, 0.0425210032135381, 0.0347182537414707, 0.0409158544192486, 0.0334076552390531, 0.0236227795630767, 0.0850420064270761, 0.0239578711874977, 0.0207481250689683, -0.00618589574131741, -0.00535714285714285, -0.00437408882639853, -0.0107142857142857, -0.00927884361197613, -0.00757614408414159, -0.00535714285714286};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.117369119465393, -0.0451753951452626, -0.031943828249997, -0.018298126367785, -0.0425210032135381, -0.0347182537414707, 0.0409158544192486, 0.0334076552390531, 0.0236227795630767, -0.0850420064270761, 0.0239578711874978, 0.0207481250689683, 0.00618589574131741, 0.00535714285714285, 0.00437408882639852, -0.0107142857142857, -0.00927884361197613, -0.00757614408414159, -0.00535714285714286};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.259807621135332, 0.117369119465393, 0.0677630927178939, 0.0479157423749954, 0.0, 0.0850420064270762, 0.0694365074829413, -0.0736485379546474, 0.0400891862868636, -0.0992156741649221, 0.0, 0.0, 0.0, 0.0, 0.075, -0.0262445329583912, 0.0, -0.0649519052838329, -0.0151522881682832, 0.0267857142857143};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.259807621135331, -0.117369119465393, 0.0677630927178938, 0.0479157423749954, 0.0, -0.0850420064270761, -0.0694365074829413, -0.0736485379546474, 0.0400891862868637, -0.0992156741649221, 0.0, 0.0, 0.0, 0.0, -0.075, 0.0262445329583912, 0.0, -0.0649519052838329, -0.0151522881682832, 0.0267857142857143};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.259807621135332, 0.0, -0.135526185435788, 0.0479157423749955, -0.10978875820671, 0.0, 0.0, 0.0245495126515491, -0.0801783725737273, -0.0992156741649222, 0.0, 0.0, -0.0968245836551854, 0.0, 0.0, 0.0, 0.0, 0.021650635094611, 0.0303045763365663, 0.0267857142857143};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.259807621135332, 0.0, 0.0, -0.143747227124986, -0.10978875820671, 0.0, 0.0, -0.122747563257746, 0.0, 0.0425210032135381, 0.0, -0.095831484749991, 0.0138320833793122, 0.0, 0.0, 0.0, 0.0428571428571429, 0.0154647393532936, 0.0, -0.00535714285714284};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 20; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson3d_3_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 20; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson3d_3_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[27][3];
+    for (unsigned int row = 0; row < 27; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[27][27];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0288675134594813, 0.0130410132739325, 0.00752923252421043, 0.0053239713749995, 0.018298126367785, 0.014173667737846, 0.0115727512471569, 0.00818317088384972, 0.00668153104781059, 0.00472455591261533, -0.028347335475692, -0.0239578711874978, -0.0207481250689683, -0.0185576872239523, -0.0160714285714286, -0.0131222664791956, -0.0107142857142857, -0.00927884361197611, -0.00757614408414157, -0.00535714285714285};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0288675134594812, -0.0130410132739325, 0.0075292325242104, 0.00532397137499951, 0.018298126367785, -0.014173667737846, -0.0115727512471569, 0.00818317088384971, 0.00668153104781063, 0.00472455591261534, 0.028347335475692, -0.0239578711874977, -0.0207481250689683, 0.0185576872239523, 0.0160714285714286, 0.0131222664791956, -0.0107142857142857, -0.00927884361197613, -0.00757614408414159, -0.00535714285714286};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0288675134594812, 0.0, -0.0150584650484209, 0.00532397137499951, 0.0, 0.0, 0.0, 0.0245495126515492, -0.0133630620956212, 0.00472455591261537, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0428571428571429, -0.0278365308359284, 0.0151522881682832, -0.00535714285714287};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0288675134594813, 0.0, 0.0, -0.0159719141249985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.028347335475692, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0535714285714286};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0, 0.112938487863156, -0.063887656499994, 0.0, 0.0, 0.0, 0.0736485379546474, 0.0267261241912424, -0.0236227795630767, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0649519052838329, -0.0606091526731326, 0.0267857142857143};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0, -0.0225876975726313, 0.127775312999988, 0.0, 0.0, 0.0, 0.0, 0.0668153104781061, 0.0472455591261534, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0757614408414158, -0.0535714285714286};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0978075995544939, -0.0564692439315782, -0.063887656499994, 0.054894379103355, -0.0425210032135381, 0.0231455024943138, 0.0245495126515491, -0.0133630620956212, -0.0236227795630767, 0.0, 0.0, 0.0484122918275927, 0.0, -0.0375, -0.0524890659167824, 0.0, 0.0216506350946109, 0.0303045763365663, 0.0267857142857143};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.0195615199108989, 0.0112938487863156, 0.127775312999988, 0.0, 0.0, 0.0578637562357844, 0.0, -0.0334076552390531, 0.0472455591261534, 0.0, 0.0, 0.0, 0.0, 0.0, 0.065611332395978, 0.0, 0.0, -0.0378807204207079, -0.0535714285714286};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.097807599554494, -0.0790569415042095, -0.031943828249997, 0.054894379103355, 0.014173667737846, -0.0462910049886276, -0.0245495126515492, 0.0133630620956212, 0.0236227795630767, 0.0, 0.0479157423749955, -0.0069160416896561, -0.0618589574131742, -0.0160714285714286, 0.00874817765279706, 0.0428571428571429, 0.0154647393532935, 0.0, -0.00535714285714286};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.0195615199108988, 0.124232336649472, -0.031943828249997, 0.0, 0.0566946709513841, -0.0115727512471569, 0.0245495126515492, -0.0467707173346743, 0.0236227795630767, 0.0, 0.0, 0.0, 0.0618589574131742, -0.0214285714285714, 0.00437408882639853, -0.0642857142857143, 0.00927884361197613, 0.00757614408414158, -0.00535714285714285};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.0978075995544939, -0.0564692439315782, -0.063887656499994, 0.054894379103355, 0.0425210032135381, -0.0231455024943137, 0.0245495126515491, -0.0133630620956212, -0.0236227795630767, 0.0, 0.0, 0.0484122918275927, 0.0, 0.0375, 0.0524890659167824, 0.0, 0.021650635094611, 0.0303045763365663, 0.0267857142857143};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0195615199108988, 0.0112938487863156, 0.127775312999988, 0.0, 0.0, -0.0578637562357845, 0.0, -0.033407655239053, 0.0472455591261534, 0.0, 0.0, 0.0, 0.0, 0.0, -0.065611332395978, 0.0, 0.0, -0.0378807204207079, -0.0535714285714286};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.097807599554494, -0.0790569415042095, -0.031943828249997, 0.054894379103355, -0.014173667737846, 0.0462910049886276, -0.0245495126515492, 0.0133630620956212, 0.0236227795630767, 0.0, 0.0479157423749955, -0.0069160416896561, 0.0618589574131742, 0.0160714285714286, -0.00874817765279707, 0.0428571428571429, 0.0154647393532935, 0.0, -0.00535714285714287};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.0195615199108988, 0.124232336649472, -0.031943828249997, 0.0, -0.0566946709513841, 0.0115727512471569, 0.0245495126515492, -0.0467707173346743, 0.0236227795630767, 0.0, 0.0, 0.0, -0.0618589574131742, 0.0214285714285714, -0.00437408882639852, -0.0642857142857143, 0.00927884361197614, 0.00757614408414158, -0.00535714285714285};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, -0.117369119465393, -0.0451753951452625, -0.031943828249997, -0.018298126367785, 0.0425210032135381, 0.0347182537414707, 0.0409158544192486, 0.0334076552390531, 0.0236227795630767, 0.0850420064270761, 0.0239578711874977, 0.0207481250689683, -0.00618589574131741, -0.00535714285714285, -0.00437408882639853, -0.0107142857142857, -0.00927884361197613, -0.00757614408414159, -0.00535714285714286};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.0, 0.117369119465393, -0.0451753951452626, -0.031943828249997, -0.018298126367785, -0.0425210032135381, -0.0347182537414707, 0.0409158544192486, 0.0334076552390531, 0.0236227795630767, -0.0850420064270761, 0.0239578711874978, 0.0207481250689683, 0.00618589574131741, 0.00535714285714285, 0.00437408882639852, -0.0107142857142857, -0.00927884361197613, -0.00757614408414159, -0.00535714285714286};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.259807621135332, 0.117369119465393, 0.0677630927178939, 0.0479157423749954, 0.0, 0.0850420064270762, 0.0694365074829413, -0.0736485379546474, 0.0400891862868636, -0.0992156741649221, 0.0, 0.0, 0.0, 0.0, 0.075, -0.0262445329583912, 0.0, -0.0649519052838329, -0.0151522881682832, 0.0267857142857143};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.259807621135331, -0.117369119465393, 0.0677630927178938, 0.0479157423749954, 0.0, -0.0850420064270761, -0.0694365074829413, -0.0736485379546474, 0.0400891862868637, -0.0992156741649221, 0.0, 0.0, 0.0, 0.0, -0.075, 0.0262445329583912, 0.0, -0.0649519052838329, -0.0151522881682832, 0.0267857142857143};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.259807621135332, 0.0, -0.135526185435788, 0.0479157423749955, -0.10978875820671, 0.0, 0.0, 0.0245495126515491, -0.0801783725737273, -0.0992156741649222, 0.0, 0.0, -0.0968245836551854, 0.0, 0.0, 0.0, 0.0, 0.021650635094611, 0.0303045763365663, 0.0267857142857143};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[20] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[10] = 1.66666666666667*tmp0*basisvalues[4] - 0.666666666666667*tmp1*basisvalues[1];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[11] = (0.5*(2.0 + 3.0*Y + Z) + 2.0*(1.0 + Y))*basisvalues[4];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[16] = (1.75*tmp2 + 0.05*tmp3)*basisvalues[7] - 0.7*tmp4*basisvalues[2];
+      basisvalues[13] = (2.1*tmp2 + 0.54*tmp3)*basisvalues[5] - 0.56*tmp4*basisvalues[1];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[17] = (4.0*Z + 3.0)*basisvalues[7];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[14] = (4.0*Z + 3.0)*basisvalues[5];
+      basisvalues[12] = (4.0*Z + 3.0)*basisvalues[4];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[19] = basisvalues[9]*(0.155555555555556 + 1.86666666666667*Z) - 0.711111111111111*basisvalues[3];
+      basisvalues[18] = basisvalues[8]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[2];
+      basisvalues[15] = basisvalues[6]*(0.777777777777778 + 2.33333333333333*Z) - 0.555555555555556*basisvalues[1];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[19] *= std::sqrt(2.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[18] *= std::sqrt(4.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[17] *= std::sqrt(6.75);
+      basisvalues[16] *= std::sqrt(9.0);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[15] *= std::sqrt(13.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[14] *= std::sqrt(20.25);
+      basisvalues[13] *= std::sqrt(27.0);
+      basisvalues[4] *= std::sqrt(26.25);
+      basisvalues[12] *= std::sqrt(33.75);
+      basisvalues[11] *= std::sqrt(45.0);
+      basisvalues[10] *= std::sqrt(63.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[20] = \
+      {0.259807621135332, 0.0, 0.0, -0.143747227124986, -0.10978875820671, 0.0, 0.0, -0.122747563257746, 0.0, 0.0425210032135381, 0.0, -0.095831484749991, 0.0138320833793122, 0.0, 0.0, 0.0, 0.0428571428571429, 0.0154647393532936, 0.0, -0.00535714285714284};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771367, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.49909083394702, 0.0, -3.34664010613631, -2.36643191323985, 15.4919333848297, 0.0, 0.0, 0.69282032302755, 0.565685424949236, 0.399999999999998, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.89897948556635, 0.0, 0.0, 0.0, 14.1985914794391, -0.828078671210824, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.24264068711928, 0.0, 0.0, 0.0, 0.0, 14.3427433120127, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.60000000000001, 0.0, 8.76356092008266, -1.54919333848297, 0.0, 0.0, 0.0, 9.52470471983252, -1.48131215963608, 0.261861468283192, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.11769145362398, 0.0, 3.16227766016838, 4.91934955049954, 0.0, 0.0, 0.0, 0.0, 10.690449676497, -2.41897262725906, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.54558441227157, 0.0, 0.0, 7.66811580507233, 0.0, 0.0, 0.0, 0.0, 0.0, 10.3691851174526, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.59160797830996, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063972, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 9.16515138991168, 7.09929573971954, -0.414039335605413, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355964, -0.408248290463863, 3.17542648054295, 0.0, 0.0, 7.17137165600637, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, -5.69209978830309, 4.38178046004133, -0.774596669241485, 0.0, 10.998181667894, 0.962140470884733, 4.76235235991626, -0.740656079818043, 0.130930734141595, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 2.73861278752583, 1.58113883008419, 2.45967477524977, 0.0, 0.0, 9.25820099772552, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, 0.0, 0.0, 3.83405790253616, 0.0, 0.0, 0.0, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.19615242270664, 0.0, -3.16227766016839, -2.2360679774998, 0.0, 0.0, 0.0, 13.7477270848675, 0.534522483824849, 0.377964473009227, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-1.8, 0.0, 3.65148371670111, -2.84018778721878, 0.0, 0.0, 0.0, 0.0, 12.3442679969674, 1.39659449751035, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.20454076850486, 0.0, 0.0, 6.6407830863536, 0.0, 0.0, 0.0, 0.0, 0.0, 8.97997772825746, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[20][20] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.9580398915498, 5.61248608016091, -1.08012344973464, -0.763762615825974, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461895, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531985, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973465, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912986, 0.0, 0.0, 8.87411967464943, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.74954541697351, 5.79655069847577, -1.67332005306815, -1.18321595661993, 7.74596669241484, -1.2, -0.979795897113272, 0.346410161513776, 0.28284271247462, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.32379000772445, 2.44948974278318, 2.82842712474619, -1.0, 1.30930734141596, 7.09929573971954, -0.414039335605412, -2.04939015319192, -0.478091443733757, 0.169030850945702, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.01246117974981, 2.12132034355965, -0.408248290463863, 3.17542648054294, 9.07114735222146, 0.0, 7.17137165600636, 0.0, -1.38013111868471, -1.56144011671765, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.8, 0.632455532033675, 4.38178046004133, -0.774596669241484, 0.0, 3.14233761939829, -0.10690449676497, 4.76235235991626, -0.74065607981804, 0.130930734141596, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.55884572681199, 0.547722557505166, 1.58113883008419, 2.45967477524977, 0.0, 9.07114735222145, 1.8516401995451, 0.0, 5.34522483824849, -1.20948631362953, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.27279220613579, -6.26099033699941, 0.0, 3.83405790253617, 0.0, 0.0, 10.5830052442584, 0.0, 0.0, 5.18459255872629, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.03923048454133, 0.0, 3.16227766016838, -0.447213595499959, 0.0, 0.0, 0.0, 5.89188303637179, -0.534522483824848, 0.0755928946018459, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.900000000000008, 0.0, 1.46059348668044, 1.42009389360939, 0.0, 0.0, 0.0, 9.07114735222145, 4.93770719878694, -0.698297248755175, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.734846922834955, 0.0, -6.26099033699941, 2.21359436211787, 0.0, 0.0, 0.0, 0.0, 10.5830052442584, 2.99332590941915, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.7157676649773, 0.0, 0.0, -4.69574275274956, 0.0, 0.0, 0.0, 0.0, 0.0, 12.69960629311, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[27];
+      for (unsigned int r = 0; r < 27; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[20][20] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 20; t++)
+        {
+          for (unsigned int u = 0; u < 20; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            for (unsigned int u = 0; u < 20; u++)
+            {
+              for (unsigned int tu = 0; tu < 20; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 20; s++)
+        {
+          for (unsigned int t = 0; t < 20; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson3d_3_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 20; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[27];
+    for (unsigned int r = 0; r < 27; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 20; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson3d_3_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+      y[1] = 0.666666666666667*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+      y[2] = 0.666666666666667*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[6] + 0.666666666666667*vertex_coordinates[9];
+      y[1] = 0.333333333333333*vertex_coordinates[7] + 0.666666666666667*vertex_coordinates[10];
+      y[2] = 0.333333333333333*vertex_coordinates[8] + 0.666666666666667*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[9];
+      y[1] = 0.666666666666667*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[10];
+      y[2] = 0.666666666666667*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[9];
+      y[1] = 0.333333333333333*vertex_coordinates[4] + 0.666666666666667*vertex_coordinates[10];
+      y[2] = 0.333333333333333*vertex_coordinates[5] + 0.666666666666667*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6];
+      y[1] = 0.666666666666667*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7];
+      y[2] = 0.666666666666667*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[6];
+      y[1] = 0.333333333333333*vertex_coordinates[4] + 0.666666666666667*vertex_coordinates[7];
+      y[2] = 0.333333333333333*vertex_coordinates[5] + 0.666666666666667*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[9];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[10];
+      y[2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[9];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[10];
+      y[2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 12:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[6];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[7];
+      y[2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 13:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[6];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[7];
+      y[2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4];
+      y[2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[3];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[4];
+      y[2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+      y[1] = 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+      y[2] = 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+      y[2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[9];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[10];
+      y[2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7];
+      y[2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson3d_3_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+    y[1] = 0.666666666666667*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+    y[2] = 0.666666666666667*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[6] + 0.666666666666667*vertex_coordinates[9];
+    y[1] = 0.333333333333333*vertex_coordinates[7] + 0.666666666666667*vertex_coordinates[10];
+    y[2] = 0.333333333333333*vertex_coordinates[8] + 0.666666666666667*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[9];
+    y[1] = 0.666666666666667*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[10];
+    y[2] = 0.666666666666667*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[9];
+    y[1] = 0.333333333333333*vertex_coordinates[4] + 0.666666666666667*vertex_coordinates[10];
+    y[2] = 0.333333333333333*vertex_coordinates[5] + 0.666666666666667*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6];
+    y[1] = 0.666666666666667*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7];
+    y[2] = 0.666666666666667*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[6];
+    y[1] = 0.333333333333333*vertex_coordinates[4] + 0.666666666666667*vertex_coordinates[7];
+    y[2] = 0.333333333333333*vertex_coordinates[5] + 0.666666666666667*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[9];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[10];
+    y[2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[10] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[9];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[10];
+    y[2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[11] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[6];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[7];
+    y[2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[12] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[6];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[7];
+    y[2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[13] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4];
+    y[2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[3];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[4];
+    y[2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[15] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+    y[1] = 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+    y[2] = 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[16] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+    y[2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[17] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[9];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[10];
+    y[2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[18] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7];
+    y[2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[19] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson3d_3_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson3d_3_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson3d_3_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson3d_3_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson3d_3_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson3d_3_finite_element_0::create() const
+{
+    return new poisson3d_3_finite_element_0();
+}
+
+/// Constructor
+poisson3d_3_dofmap_0::poisson3d_3_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_3_dofmap_0::~poisson3d_3_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson3d_3_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 3, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson3d_3_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson3d_3_dofmap_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson3d_3_dofmap_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson3d_3_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0] + 2*num_global_entities[1] + num_global_entities[2];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson3d_3_dofmap_0::local_dimension() const
+{
+    return 20;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson3d_3_dofmap_0::num_facet_dofs() const
+{
+    return 10;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson3d_3_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson3d_3_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + 2*c.entity_indices[1][0];
+    dofs[5] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[6] = offset + 2*c.entity_indices[1][1];
+    dofs[7] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[8] = offset + 2*c.entity_indices[1][2];
+    dofs[9] = offset + 2*c.entity_indices[1][2] + 1;
+    dofs[10] = offset + 2*c.entity_indices[1][3];
+    dofs[11] = offset + 2*c.entity_indices[1][3] + 1;
+    dofs[12] = offset + 2*c.entity_indices[1][4];
+    dofs[13] = offset + 2*c.entity_indices[1][4] + 1;
+    dofs[14] = offset + 2*c.entity_indices[1][5];
+    dofs[15] = offset + 2*c.entity_indices[1][5] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[16] = offset + c.entity_indices[2][0];
+    dofs[17] = offset + c.entity_indices[2][1];
+    dofs[18] = offset + c.entity_indices[2][2];
+    dofs[19] = offset + c.entity_indices[2][3];
+    offset += num_global_entities[2];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson3d_3_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 7;
+      dofs[7] = 8;
+      dofs[8] = 9;
+      dofs[9] = 16;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 10;
+      dofs[6] = 11;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 17;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 10;
+      dofs[6] = 11;
+      dofs[7] = 14;
+      dofs[8] = 15;
+      dofs[9] = 18;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 8;
+      dofs[4] = 9;
+      dofs[5] = 12;
+      dofs[6] = 13;
+      dofs[7] = 14;
+      dofs[8] = 15;
+      dofs[9] = 19;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson3d_3_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+        dofs[1] = 5;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 6;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 8;
+        dofs[1] = 9;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 10;
+        dofs[1] = 11;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 12;
+        dofs[1] = 13;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 14;
+        dofs[1] = 15;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 16;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 17;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 18;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 19;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson3d_3_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.666666666666667*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.666666666666667*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.666666666666667*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.333333333333333*vertex_coordinates[6] + 0.666666666666667*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.333333333333333*vertex_coordinates[7] + 0.666666666666667*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.333333333333333*vertex_coordinates[8] + 0.666666666666667*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[9];
+    dof_coordinates[6][1] = 0.666666666666667*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[10];
+    dof_coordinates[6][2] = 0.666666666666667*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[11];
+    dof_coordinates[7][0] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.333333333333333*vertex_coordinates[4] + 0.666666666666667*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.333333333333333*vertex_coordinates[5] + 0.666666666666667*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.666666666666667*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.666666666666667*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[6];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[4] + 0.666666666666667*vertex_coordinates[7];
+    dof_coordinates[9][2] = 0.333333333333333*vertex_coordinates[5] + 0.666666666666667*vertex_coordinates[8];
+    dof_coordinates[10][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[9];
+    dof_coordinates[10][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[10];
+    dof_coordinates[10][2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[11];
+    dof_coordinates[11][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[9];
+    dof_coordinates[11][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[10];
+    dof_coordinates[11][2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[11];
+    dof_coordinates[12][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[6];
+    dof_coordinates[12][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[7];
+    dof_coordinates[12][2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[8];
+    dof_coordinates[13][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[6];
+    dof_coordinates[13][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[7];
+    dof_coordinates[13][2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[8];
+    dof_coordinates[14][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[14][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[14][2] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[15][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[15][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[15][2] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[16][0] = 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+    dof_coordinates[16][1] = 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+    dof_coordinates[16][2] = 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+    dof_coordinates[17][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[6] + 0.333333333333333*vertex_coordinates[9];
+    dof_coordinates[17][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[7] + 0.333333333333333*vertex_coordinates[10];
+    dof_coordinates[17][2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[8] + 0.333333333333333*vertex_coordinates[11];
+    dof_coordinates[18][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[9];
+    dof_coordinates[18][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[10];
+    dof_coordinates[18][2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[11];
+    dof_coordinates[19][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[6];
+    dof_coordinates[19][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[4] + 0.333333333333333*vertex_coordinates[7];
+    dof_coordinates[19][2] = 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[5] + 0.333333333333333*vertex_coordinates[8];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson3d_3_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson3d_3_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson3d_3_dofmap_0::create() const
+{
+    return new poisson3d_3_dofmap_0();
+}
+
+/// Constructor
+poisson3d_3_cell_integral_0_otherwise::poisson3d_3_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_3_cell_integral_0_otherwise::~poisson3d_3_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson3d_3_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson3d_3_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 1768
+    // Total number of operations (multiply-add pairs):                  1798
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.0595238095238095*G0_0_0 + 0.0595238095238095*G0_0_1 + 0.0595238095238095*G0_0_2 + 0.0595238095238095*G0_1_0 + 0.0595238095238095*G0_1_1 + 0.0595238095238095*G0_1_2 + 0.0595238095238095*G0_2_0 + 0.0595238095238095*G0_2_1 + 0.0595238095238095*G0_2_2;
+    A[1] = -0.0113095238095238*G0_0_0 - 0.0113095238095238*G0_1_0 - 0.0113095238095238*G0_2_0;
+    A[2] = -0.0113095238095238*G0_0_1 - 0.0113095238095238*G0_1_1 - 0.0113095238095238*G0_2_1;
+    A[3] = -0.0113095238095238*G0_0_2 - 0.0113095238095238*G0_1_2 - 0.0113095238095238*G0_2_2;
+    A[4] = -0.0133928571428571*G0_0_1 - 0.0133928571428572*G0_0_2 - 0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_1_2 - 0.0133928571428571*G0_2_1 - 0.0133928571428572*G0_2_2;
+    A[5] = -0.0133928571428572*G0_0_1 - 0.0133928571428572*G0_0_2 - 0.0133928571428572*G0_1_1 - 0.0133928571428572*G0_1_2 - 0.0133928571428572*G0_2_1 - 0.0133928571428572*G0_2_2;
+    A[6] = -0.0133928571428572*G0_0_0 - 0.0133928571428571*G0_0_2 - 0.0133928571428572*G0_1_0 - 0.0133928571428571*G0_1_2 - 0.0133928571428572*G0_2_0 - 0.0133928571428571*G0_2_2;
+    A[7] = -0.0133928571428572*G0_0_0 - 0.0133928571428572*G0_0_2 - 0.0133928571428572*G0_1_0 - 0.0133928571428573*G0_1_2 - 0.0133928571428572*G0_2_0 - 0.0133928571428572*G0_2_2;
+    A[8] = -0.0133928571428571*G0_0_0 - 0.0133928571428571*G0_0_1 - 0.0133928571428571*G0_1_0 - 0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_2_0 - 0.0133928571428571*G0_2_1;
+    A[9] = -0.0133928571428572*G0_0_0 - 0.0133928571428572*G0_0_1 - 0.0133928571428571*G0_1_0 - 0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_2_0 - 0.0133928571428572*G0_2_1;
+    A[10] = -0.0348214285714286*G0_0_0 - 0.0348214285714286*G0_0_1 - 0.0964285714285714*G0_0_2 - 0.0348214285714285*G0_1_0 - 0.0348214285714285*G0_1_1 - 0.0964285714285714*G0_1_2 - 0.0348214285714286*G0_2_0 - 0.0348214285714286*G0_2_1 - 0.0964285714285714*G0_2_2;
+    A[11] = 0.0133928571428572*G0_0_0 + 0.0133928571428572*G0_0_1 + 0.0482142857142857*G0_0_2 + 0.0133928571428572*G0_1_0 + 0.0133928571428572*G0_1_1 + 0.0482142857142857*G0_1_2 + 0.0133928571428572*G0_2_0 + 0.0133928571428572*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[12] = -0.0348214285714286*G0_0_0 - 0.0964285714285715*G0_0_1 - 0.0348214285714286*G0_0_2 - 0.0348214285714285*G0_1_0 - 0.0964285714285715*G0_1_1 - 0.0348214285714285*G0_1_2 - 0.0348214285714286*G0_2_0 - 0.0964285714285714*G0_2_1 - 0.0348214285714286*G0_2_2;
+    A[13] = 0.0133928571428572*G0_0_0 + 0.0482142857142857*G0_0_1 + 0.0133928571428572*G0_0_2 + 0.0133928571428571*G0_1_0 + 0.0482142857142858*G0_1_1 + 0.0133928571428571*G0_1_2 + 0.0133928571428571*G0_2_0 + 0.0482142857142857*G0_2_1 + 0.0133928571428571*G0_2_2;
+    A[14] = -0.0964285714285714*G0_0_0 - 0.0348214285714285*G0_0_1 - 0.0348214285714286*G0_0_2 - 0.0964285714285714*G0_1_0 - 0.0348214285714285*G0_1_1 - 0.0348214285714285*G0_1_2 - 0.0964285714285714*G0_2_0 - 0.0348214285714286*G0_2_1 - 0.0348214285714286*G0_2_2;
+    A[15] = 0.0482142857142857*G0_0_0 + 0.0133928571428571*G0_0_1 + 0.0133928571428571*G0_0_2 + 0.0482142857142857*G0_1_0 + 0.0133928571428571*G0_1_1 + 0.0133928571428571*G0_1_2 + 0.0482142857142857*G0_2_0 + 0.0133928571428571*G0_2_1 + 0.0133928571428571*G0_2_2;
+    A[16] = -0.0321428571428573*G0_0_0 - 0.0321428571428573*G0_0_1 - 0.0321428571428572*G0_0_2 - 0.0321428571428572*G0_1_0 - 0.0321428571428573*G0_1_1 - 0.0321428571428572*G0_1_2 - 0.0321428571428572*G0_2_0 - 0.0321428571428573*G0_2_1 - 0.0321428571428572*G0_2_2;
+    A[17] = 0.0321428571428573*G0_0_0 + 0.0482142857142857*G0_0_1 + 0.0482142857142857*G0_0_2 + 0.0321428571428572*G0_1_0 + 0.0482142857142856*G0_1_1 + 0.0482142857142857*G0_1_2 + 0.0321428571428572*G0_2_0 + 0.0482142857142857*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[18] = 0.0482142857142857*G0_0_0 + 0.0321428571428573*G0_0_1 + 0.0482142857142858*G0_0_2 + 0.0482142857142857*G0_1_0 + 0.0321428571428573*G0_1_1 + 0.0482142857142858*G0_1_2 + 0.0482142857142857*G0_2_0 + 0.0321428571428573*G0_2_1 + 0.0482142857142859*G0_2_2;
+    A[19] = 0.0482142857142856*G0_0_0 + 0.0482142857142857*G0_0_1 + 0.0321428571428572*G0_0_2 + 0.0482142857142856*G0_1_0 + 0.0482142857142856*G0_1_1 + 0.0321428571428572*G0_1_2 + 0.0482142857142857*G0_2_0 + 0.0482142857142858*G0_2_1 + 0.0321428571428572*G0_2_2;
+    A[20] = -0.0113095238095238*G0_0_0 - 0.0113095238095238*G0_0_1 - 0.0113095238095238*G0_0_2;
+    A[21] = 0.0595238095238095*G0_0_0;
+    A[22] = 0.0113095238095238*G0_0_1;
+    A[23] = 0.0113095238095238*G0_0_2;
+    A[24] = 0.0133928571428571*G0_0_1 + 0.0133928571428571*G0_0_2;
+    A[25] = 0.0133928571428571*G0_0_1 + 0.0133928571428572*G0_0_2;
+    A[26] = -0.0348214285714285*G0_0_0 + 0.0616071428571429*G0_0_2;
+    A[27] = 0.0133928571428571*G0_0_0 - 0.0348214285714286*G0_0_2;
+    A[28] = -0.0348214285714284*G0_0_0 + 0.0616071428571429*G0_0_1;
+    A[29] = 0.0133928571428571*G0_0_0 - 0.0348214285714286*G0_0_1;
+    A[30] = -0.0133928571428572*G0_0_0 - 0.0133928571428572*G0_0_1;
+    A[31] = -0.0133928571428572*G0_0_0 - 0.0133928571428572*G0_0_1;
+    A[32] = -0.0133928571428571*G0_0_0 - 0.0133928571428572*G0_0_2;
+    A[33] = -0.0133928571428571*G0_0_0 - 0.0133928571428571*G0_0_2;
+    A[34] = 0.0482142857142857*G0_0_0 + 0.0348214285714286*G0_0_1 + 0.0348214285714286*G0_0_2;
+    A[35] = -0.0964285714285714*G0_0_0 - 0.0616071428571429*G0_0_1 - 0.0616071428571429*G0_0_2;
+    A[36] = 0.0321428571428572*G0_0_0 - 0.0160714285714284*G0_0_1 - 0.0160714285714284*G0_0_2;
+    A[37] = -0.0321428571428572*G0_0_0;
+    A[38] = 0.0482142857142857*G0_0_0 + 0.0160714285714284*G0_0_1;
+    A[39] = 0.0482142857142856*G0_0_0 + 0.0160714285714284*G0_0_2;
+    A[40] = -0.0113095238095238*G0_1_0 - 0.0113095238095238*G0_1_1 - 0.0113095238095238*G0_1_2;
+    A[41] = 0.0113095238095238*G0_1_0;
+    A[42] = 0.0595238095238095*G0_1_1;
+    A[43] = 0.0113095238095238*G0_1_2;
+    A[44] = -0.0348214285714285*G0_1_1 + 0.0616071428571429*G0_1_2;
+    A[45] = 0.0133928571428571*G0_1_1 - 0.0348214285714286*G0_1_2;
+    A[46] = 0.0133928571428571*G0_1_0 + 0.0133928571428571*G0_1_2;
+    A[47] = 0.0133928571428571*G0_1_0 + 0.0133928571428571*G0_1_2;
+    A[48] = -0.0348214285714286*G0_1_0 + 0.0133928571428571*G0_1_1;
+    A[49] = 0.0616071428571428*G0_1_0 - 0.0348214285714285*G0_1_1;
+    A[50] = -0.0133928571428571*G0_1_0 - 0.0133928571428571*G0_1_1;
+    A[51] = -0.0133928571428571*G0_1_0 - 0.0133928571428571*G0_1_1;
+    A[52] = 0.0348214285714286*G0_1_0 + 0.0482142857142858*G0_1_1 + 0.0348214285714286*G0_1_2;
+    A[53] = -0.0616071428571428*G0_1_0 - 0.0964285714285714*G0_1_1 - 0.0616071428571428*G0_1_2;
+    A[54] = -0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_1_2;
+    A[55] = -0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_1_2;
+    A[56] = -0.0160714285714287*G0_1_0 + 0.032142857142857*G0_1_1 - 0.0160714285714286*G0_1_2;
+    A[57] = 0.0160714285714287*G0_1_0 + 0.0482142857142857*G0_1_1;
+    A[58] = -0.0321428571428571*G0_1_1;
+    A[59] = 0.0482142857142856*G0_1_1 + 0.0160714285714286*G0_1_2;
+    A[60] = -0.0113095238095238*G0_2_0 - 0.0113095238095238*G0_2_1 - 0.0113095238095238*G0_2_2;
+    A[61] = 0.0113095238095238*G0_2_0;
+    A[62] = 0.0113095238095238*G0_2_1;
+    A[63] = 0.0595238095238096*G0_2_2;
+    A[64] = -0.0348214285714286*G0_2_1 + 0.0133928571428572*G0_2_2;
+    A[65] = 0.0616071428571429*G0_2_1 - 0.0348214285714285*G0_2_2;
+    A[66] = -0.0348214285714286*G0_2_0 + 0.0133928571428571*G0_2_2;
+    A[67] = 0.0616071428571429*G0_2_0 - 0.0348214285714285*G0_2_2;
+    A[68] = 0.0133928571428571*G0_2_0 + 0.0133928571428571*G0_2_1;
+    A[69] = 0.0133928571428572*G0_2_0 + 0.0133928571428571*G0_2_1;
+    A[70] = 0.0348214285714286*G0_2_0 + 0.0348214285714286*G0_2_1 + 0.0482142857142858*G0_2_2;
+    A[71] = -0.0616071428571429*G0_2_0 - 0.0616071428571429*G0_2_1 - 0.0964285714285715*G0_2_2;
+    A[72] = -0.0133928571428571*G0_2_0 - 0.0133928571428572*G0_2_2;
+    A[73] = -0.0133928571428572*G0_2_0 - 0.0133928571428572*G0_2_2;
+    A[74] = -0.0133928571428571*G0_2_1 - 0.0133928571428572*G0_2_2;
+    A[75] = -0.0133928571428571*G0_2_1 - 0.0133928571428571*G0_2_2;
+    A[76] = -0.0160714285714285*G0_2_0 - 0.0160714285714285*G0_2_1 + 0.0321428571428571*G0_2_2;
+    A[77] = 0.0160714285714286*G0_2_0 + 0.0482142857142857*G0_2_2;
+    A[78] = 0.0160714285714285*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[79] = -0.0321428571428571*G0_2_2;
+    A[80] = -0.0133928571428571*G0_1_0 - 0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_1_2 - 0.0133928571428572*G0_2_0 - 0.0133928571428571*G0_2_1 - 0.0133928571428572*G0_2_2;
+    A[81] = 0.0133928571428571*G0_1_0 + 0.0133928571428571*G0_2_0;
+    A[82] = -0.0348214285714285*G0_1_1 + 0.0616071428571429*G0_2_1;
+    A[83] = -0.0348214285714286*G0_1_2 + 0.0133928571428572*G0_2_2;
+    A[84] = 0.241071428571428*G0_1_1 + 0.0964285714285714*G0_1_2 + 0.0964285714285714*G0_2_1 + 0.192857142857143*G0_2_2;
+    A[85] = -0.0723214285714286*G0_1_1 + 0.0723214285714285*G0_1_2 - 0.0241071428571429*G0_2_1 - 0.0723214285714286*G0_2_2;
+    A[86] = -0.0482142857142856*G0_1_0 - 0.0241071428571427*G0_1_2 - 0.0241071428571428*G0_2_0 - 0.0241071428571428*G0_2_2;
+    A[87] = -0.0723214285714285*G0_1_0 - 0.0482142857142856*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.0241071428571429*G0_2_2;
+    A[88] = -0.0482142857142855*G0_1_0 - 0.0241071428571428*G0_1_1 - 0.0723214285714285*G0_2_0 - 0.0241071428571429*G0_2_1;
+    A[89] = 0.0964285714285715*G0_1_0 + 0.120535714285714*G0_1_1 + 0.192857142857143*G0_2_0 + 0.0964285714285715*G0_2_1;
+    A[90] = 0.0482142857142857*G0_1_0 + 0.0482142857142857*G0_1_1 + 0.0241071428571428*G0_1_2 + 0.0241071428571428*G0_2_0 + 0.0241071428571429*G0_2_1;
+    A[91] = 0.0723214285714286*G0_1_0 + 0.0723214285714286*G0_1_1 + 0.0241071428571429*G0_1_2 + 0.0241071428571429*G0_2_0 + 0.0241071428571429*G0_2_1;
+    A[92] = 0.0482142857142858*G0_1_0 + 0.0241071428571427*G0_1_1 + 0.0482142857142857*G0_1_2 + 0.0723214285714287*G0_2_0 + 0.0482142857142858*G0_2_1 + 0.0723214285714286*G0_2_2;
+    A[93] = -0.0964285714285714*G0_1_0 + 0.024107142857143*G0_1_1 - 0.0964285714285715*G0_1_2 - 0.192857142857143*G0_2_0 - 0.0964285714285714*G0_2_1 - 0.192857142857143*G0_2_2;
+    A[94] = 0.024107142857143*G0_1_1 + 0.024107142857143*G0_1_2 + 0.0241071428571428*G0_2_1 + 0.0241071428571428*G0_2_2;
+    A[95] = 0.0241071428571428*G0_1_1 + 0.0241071428571428*G0_1_2 + 0.0241071428571428*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[96] = 0.241071428571429*G0_1_0 - 0.0482142857142855*G0_1_1 + 0.120535714285714*G0_1_2 + 0.0964285714285713*G0_2_0 - 0.0241071428571429*G0_2_1 + 0.0964285714285715*G0_2_2;
+    A[97] = -0.241071428571429*G0_1_0 - 0.289285714285714*G0_1_1 - 0.120535714285714*G0_1_2 - 0.0964285714285713*G0_2_0 - 0.120535714285714*G0_2_1;
+    A[98] = 0.0482142857142855*G0_1_1 + 0.0241071428571426*G0_1_2 + 0.0241071428571429*G0_2_1;
+    A[99] = -0.144642857142857*G0_1_1 - 0.120535714285714*G0_1_2 - 0.120535714285714*G0_2_1 - 0.0964285714285715*G0_2_2;
+    A[100] = -0.0133928571428572*G0_1_0 - 0.0133928571428572*G0_1_1 - 0.0133928571428572*G0_1_2 - 0.0133928571428572*G0_2_0 - 0.0133928571428572*G0_2_1 - 0.0133928571428572*G0_2_2;
+    A[101] = 0.0133928571428571*G0_1_0 + 0.0133928571428572*G0_2_0;
+    A[102] = 0.0133928571428571*G0_1_1 - 0.0348214285714286*G0_2_1;
+    A[103] = 0.0616071428571429*G0_1_2 - 0.0348214285714285*G0_2_2;
+    A[104] = -0.0723214285714286*G0_1_1 - 0.0241071428571429*G0_1_2 + 0.0723214285714285*G0_2_1 - 0.0723214285714286*G0_2_2;
+    A[105] = 0.192857142857143*G0_1_1 + 0.0964285714285715*G0_1_2 + 0.0964285714285715*G0_2_1 + 0.241071428571429*G0_2_2;
+    A[106] = -0.0723214285714285*G0_1_0 - 0.0241071428571429*G0_1_2 - 0.0482142857142856*G0_2_0 - 0.0241071428571428*G0_2_2;
+    A[107] = 0.192857142857143*G0_1_0 + 0.0964285714285714*G0_1_2 + 0.0964285714285715*G0_2_0 + 0.120535714285714*G0_2_2;
+    A[108] = -0.0241071428571428*G0_1_0 - 0.0241071428571428*G0_1_1 - 0.0482142857142856*G0_2_0 - 0.0241071428571428*G0_2_1;
+    A[109] = -0.0241071428571429*G0_1_0 - 0.0241071428571429*G0_1_1 - 0.0723214285714286*G0_2_0 - 0.0482142857142857*G0_2_1;
+    A[110] = 0.0723214285714288*G0_1_0 + 0.0723214285714288*G0_1_1 + 0.0482142857142859*G0_1_2 + 0.0482142857142859*G0_2_0 + 0.0482142857142858*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[111] = -0.192857142857143*G0_1_0 - 0.192857142857143*G0_1_1 - 0.0964285714285715*G0_1_2 - 0.0964285714285716*G0_2_0 - 0.0964285714285715*G0_2_1 + 0.0241071428571428*G0_2_2;
+    A[112] = 0.024107142857143*G0_1_0 + 0.0241071428571429*G0_1_2 + 0.0482142857142857*G0_2_0 + 0.0241071428571428*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[113] = 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_2 + 0.0723214285714286*G0_2_0 + 0.024107142857143*G0_2_1 + 0.0723214285714286*G0_2_2;
+    A[114] = 0.0241071428571429*G0_1_1 + 0.0241071428571429*G0_1_2 + 0.024107142857143*G0_2_1 + 0.024107142857143*G0_2_2;
+    A[115] = 0.0241071428571428*G0_1_1 + 0.0241071428571428*G0_1_2 + 0.0241071428571428*G0_2_1 + 0.0241071428571428*G0_2_2;
+    A[116] = 0.0964285714285714*G0_1_0 + 0.0964285714285715*G0_1_1 - 0.024107142857143*G0_1_2 + 0.241071428571429*G0_2_0 + 0.120535714285715*G0_2_1 - 0.0482142857142857*G0_2_2;
+    A[117] = -0.0964285714285714*G0_1_0 - 0.120535714285714*G0_1_2 - 0.241071428571429*G0_2_0 - 0.120535714285714*G0_2_1 - 0.289285714285714*G0_2_2;
+    A[118] = -0.0964285714285715*G0_1_1 - 0.120535714285714*G0_1_2 - 0.120535714285715*G0_2_1 - 0.144642857142857*G0_2_2;
+    A[119] = 0.0241071428571429*G0_1_2 + 0.0241071428571427*G0_2_1 + 0.0482142857142856*G0_2_2;
+    A[120] = -0.0133928571428572*G0_0_0 - 0.0133928571428572*G0_0_1 - 0.0133928571428572*G0_0_2 - 0.0133928571428571*G0_2_0 - 0.0133928571428571*G0_2_1 - 0.0133928571428571*G0_2_2;
+    A[121] = -0.0348214285714285*G0_0_0 + 0.0616071428571429*G0_2_0;
+    A[122] = 0.0133928571428571*G0_0_1 + 0.0133928571428571*G0_2_1;
+    A[123] = -0.0348214285714286*G0_0_2 + 0.0133928571428571*G0_2_2;
+    A[124] = -0.0482142857142855*G0_0_1 - 0.0241071428571428*G0_0_2 - 0.0241071428571427*G0_2_1 - 0.0241071428571428*G0_2_2;
+    A[125] = -0.0723214285714285*G0_0_1 - 0.0482142857142856*G0_0_2 - 0.0241071428571428*G0_2_1 - 0.0241071428571428*G0_2_2;
+    A[126] = 0.241071428571428*G0_0_0 + 0.0964285714285713*G0_0_2 + 0.0964285714285713*G0_2_0 + 0.192857142857143*G0_2_2;
+    A[127] = -0.0723214285714285*G0_0_0 + 0.0723214285714286*G0_0_2 - 0.0241071428571429*G0_2_0 - 0.0723214285714285*G0_2_2;
+    A[128] = 0.120535714285714*G0_0_0 + 0.0964285714285713*G0_0_1 + 0.0964285714285712*G0_2_0 + 0.192857142857143*G0_2_1;
+    A[129] = -0.0241071428571428*G0_0_0 - 0.0482142857142857*G0_0_1 - 0.0241071428571428*G0_2_0 - 0.0723214285714285*G0_2_1;
+    A[130] = 0.0482142857142857*G0_0_0 + 0.0482142857142857*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.0241071428571428*G0_2_0 + 0.0241071428571427*G0_2_1;
+    A[131] = 0.0723214285714286*G0_0_0 + 0.0723214285714286*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.0241071428571429*G0_2_0 + 0.0241071428571429*G0_2_1;
+    A[132] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_2 + 0.0241071428571427*G0_2_0 + 0.0241071428571428*G0_2_2;
+    A[133] = 0.0241071428571428*G0_0_0 + 0.0241071428571428*G0_0_2 + 0.0241071428571428*G0_2_0 + 0.0241071428571428*G0_2_2;
+    A[134] = 0.0241071428571429*G0_0_0 + 0.0482142857142857*G0_0_1 + 0.0482142857142857*G0_0_2 + 0.0482142857142858*G0_2_0 + 0.0723214285714286*G0_2_1 + 0.0723214285714286*G0_2_2;
+    A[135] = 0.0241071428571428*G0_0_0 - 0.0964285714285712*G0_0_1 - 0.0964285714285712*G0_0_2 - 0.0964285714285716*G0_2_0 - 0.192857142857143*G0_2_1 - 0.192857142857143*G0_2_2;
+    A[136] = -0.0482142857142857*G0_0_0 + 0.241071428571428*G0_0_1 + 0.120535714285714*G0_0_2 - 0.0241071428571427*G0_2_0 + 0.0964285714285714*G0_2_1 + 0.0964285714285714*G0_2_2;
+    A[137] = 0.0482142857142857*G0_0_0 + 0.0241071428571426*G0_0_2 + 0.0241071428571427*G0_2_0;
+    A[138] = -0.289285714285714*G0_0_0 - 0.241071428571428*G0_0_1 - 0.120535714285714*G0_0_2 - 0.120535714285714*G0_2_0 - 0.0964285714285714*G0_2_1;
+    A[139] = -0.144642857142857*G0_0_0 - 0.120535714285714*G0_0_2 - 0.120535714285714*G0_2_0 - 0.0964285714285713*G0_2_2;
+    A[140] = -0.0133928571428572*G0_0_0 - 0.0133928571428572*G0_0_1 - 0.0133928571428572*G0_0_2 - 0.0133928571428572*G0_2_0 - 0.0133928571428573*G0_2_1 - 0.0133928571428572*G0_2_2;
+    A[141] = 0.0133928571428571*G0_0_0 - 0.0348214285714286*G0_2_0;
+    A[142] = 0.0133928571428571*G0_0_1 + 0.0133928571428571*G0_2_1;
+    A[143] = 0.0616071428571429*G0_0_2 - 0.0348214285714285*G0_2_2;
+    A[144] = -0.0723214285714285*G0_0_1 - 0.0241071428571429*G0_0_2 - 0.0482142857142856*G0_2_1 - 0.0241071428571429*G0_2_2;
+    A[145] = 0.192857142857143*G0_0_1 + 0.0964285714285715*G0_0_2 + 0.0964285714285714*G0_2_1 + 0.120535714285714*G0_2_2;
+    A[146] = -0.0723214285714285*G0_0_0 - 0.0241071428571429*G0_0_2 + 0.0723214285714286*G0_2_0 - 0.0723214285714285*G0_2_2;
+    A[147] = 0.192857142857143*G0_0_0 + 0.0964285714285714*G0_0_2 + 0.0964285714285714*G0_2_0 + 0.241071428571429*G0_2_2;
+    A[148] = -0.0241071428571429*G0_0_0 - 0.0241071428571429*G0_0_1 - 0.0482142857142856*G0_2_0 - 0.0723214285714285*G0_2_1;
+    A[149] = -0.0241071428571429*G0_0_0 - 0.0241071428571429*G0_0_1 - 0.024107142857143*G0_2_0 - 0.0482142857142857*G0_2_1;
+    A[150] = 0.0723214285714289*G0_0_0 + 0.0723214285714288*G0_0_1 + 0.0482142857142859*G0_0_2 + 0.048214285714286*G0_2_0 + 0.048214285714286*G0_2_1 + 0.0241071428571431*G0_2_2;
+    A[151] = -0.192857142857143*G0_0_0 - 0.192857142857143*G0_0_1 - 0.0964285714285716*G0_0_2 - 0.0964285714285715*G0_2_0 - 0.0964285714285714*G0_2_1 + 0.0241071428571427*G0_2_2;
+    A[152] = 0.024107142857143*G0_0_0 + 0.024107142857143*G0_0_2 + 0.024107142857143*G0_2_0 + 0.0241071428571431*G0_2_2;
+    A[153] = 0.0241071428571428*G0_0_0 + 0.0241071428571428*G0_0_2 + 0.0241071428571429*G0_2_0 + 0.0241071428571429*G0_2_2;
+    A[154] = 0.0241071428571429*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.0241071428571428*G0_2_0 + 0.0482142857142857*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[155] = 0.0241071428571429*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.024107142857143*G0_2_0 + 0.0723214285714286*G0_2_1 + 0.0723214285714286*G0_2_2;
+    A[156] = 0.0964285714285714*G0_0_0 + 0.0964285714285714*G0_0_1 - 0.024107142857143*G0_0_2 + 0.120535714285714*G0_2_0 + 0.241071428571428*G0_2_1 - 0.0482142857142858*G0_2_2;
+    A[157] = -0.0964285714285714*G0_0_0 - 0.120535714285714*G0_0_2 - 0.120535714285714*G0_2_0 - 0.144642857142857*G0_2_2;
+    A[158] = -0.0964285714285714*G0_0_1 - 0.120535714285714*G0_0_2 - 0.120535714285714*G0_2_0 - 0.241071428571429*G0_2_1 - 0.289285714285714*G0_2_2;
+    A[159] = 0.024107142857143*G0_0_2 + 0.0241071428571425*G0_2_0 + 0.0482142857142857*G0_2_2;
+    A[160] = -0.0133928571428571*G0_0_0 - 0.0133928571428571*G0_0_1 - 0.0133928571428571*G0_0_2 - 0.0133928571428571*G0_1_0 - 0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_1_2;
+    A[161] = -0.0348214285714284*G0_0_0 + 0.0616071428571429*G0_1_0;
+    A[162] = -0.0348214285714285*G0_0_1 + 0.0133928571428571*G0_1_1;
+    A[163] = 0.0133928571428571*G0_0_2 + 0.0133928571428571*G0_1_2;
+    A[164] = -0.0482142857142855*G0_0_1 - 0.0723214285714285*G0_0_2 - 0.0241071428571428*G0_1_1 - 0.0241071428571429*G0_1_2;
+    A[165] = -0.0241071428571428*G0_0_1 - 0.0482142857142856*G0_0_2 - 0.0241071428571428*G0_1_1 - 0.0241071428571428*G0_1_2;
+    A[166] = 0.120535714285714*G0_0_0 + 0.0964285714285712*G0_0_2 + 0.0964285714285713*G0_1_0 + 0.192857142857143*G0_1_2;
+    A[167] = -0.0241071428571429*G0_0_0 - 0.0482142857142856*G0_0_2 - 0.0241071428571429*G0_1_0 - 0.0723214285714285*G0_1_2;
+    A[168] = 0.241071428571428*G0_0_0 + 0.0964285714285713*G0_0_1 + 0.0964285714285713*G0_1_0 + 0.192857142857143*G0_1_1;
+    A[169] = -0.0723214285714285*G0_0_0 + 0.0723214285714283*G0_0_1 - 0.0241071428571429*G0_1_0 - 0.0723214285714287*G0_1_1;
+    A[170] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.0241071428571428*G0_1_0 + 0.0241071428571428*G0_1_1;
+    A[171] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_1;
+    A[172] = 0.0482142857142855*G0_0_0 + 0.0241071428571428*G0_0_1 + 0.0482142857142856*G0_0_2 + 0.0241071428571428*G0_1_0 + 0.0241071428571428*G0_1_2;
+    A[173] = 0.0723214285714285*G0_0_0 + 0.024107142857143*G0_0_1 + 0.0723214285714285*G0_0_2 + 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_2;
+    A[174] = 0.0241071428571428*G0_0_0 + 0.0482142857142856*G0_0_1 + 0.0482142857142856*G0_0_2 + 0.0482142857142858*G0_1_0 + 0.0723214285714286*G0_1_1 + 0.0723214285714286*G0_1_2;
+    A[175] = 0.0241071428571427*G0_0_0 - 0.0964285714285712*G0_0_1 - 0.0964285714285712*G0_0_2 - 0.0964285714285716*G0_1_0 - 0.192857142857143*G0_1_1 - 0.192857142857143*G0_1_2;
+    A[176] = -0.0482142857142857*G0_0_0 + 0.120535714285714*G0_0_1 + 0.241071428571428*G0_0_2 - 0.0241071428571428*G0_1_0 + 0.0964285714285714*G0_1_1 + 0.0964285714285713*G0_1_2;
+    A[177] = 0.0482142857142857*G0_0_0 + 0.0241071428571427*G0_0_1 + 0.0241071428571428*G0_1_0;
+    A[178] = -0.144642857142857*G0_0_0 - 0.120535714285714*G0_0_1 - 0.120535714285714*G0_1_0 - 0.0964285714285715*G0_1_1;
+    A[179] = -0.289285714285713*G0_0_0 - 0.120535714285714*G0_0_1 - 0.241071428571428*G0_0_2 - 0.120535714285714*G0_1_0 - 0.0964285714285713*G0_1_2;
+    A[180] = -0.0133928571428572*G0_0_0 - 0.0133928571428571*G0_0_1 - 0.0133928571428571*G0_0_2 - 0.0133928571428572*G0_1_0 - 0.0133928571428571*G0_1_1 - 0.0133928571428572*G0_1_2;
+    A[181] = 0.0133928571428571*G0_0_0 - 0.0348214285714286*G0_1_0;
+    A[182] = 0.0616071428571428*G0_0_1 - 0.0348214285714285*G0_1_1;
+    A[183] = 0.0133928571428572*G0_0_2 + 0.0133928571428571*G0_1_2;
+    A[184] = 0.0964285714285715*G0_0_1 + 0.192857142857143*G0_0_2 + 0.120535714285714*G0_1_1 + 0.0964285714285715*G0_1_2;
+    A[185] = -0.0241071428571429*G0_0_1 - 0.0723214285714286*G0_0_2 - 0.0241071428571429*G0_1_1 - 0.0482142857142857*G0_1_2;
+    A[186] = -0.0241071428571428*G0_0_0 - 0.0241071428571428*G0_0_2 - 0.0482142857142857*G0_1_0 - 0.0723214285714285*G0_1_2;
+    A[187] = -0.0241071428571429*G0_0_0 - 0.024107142857143*G0_0_2 - 0.0241071428571429*G0_1_0 - 0.0482142857142857*G0_1_2;
+    A[188] = -0.0723214285714285*G0_0_0 - 0.0241071428571429*G0_0_1 + 0.0723214285714283*G0_1_0 - 0.0723214285714287*G0_1_1;
+    A[189] = 0.192857142857143*G0_0_0 + 0.0964285714285715*G0_0_1 + 0.0964285714285715*G0_1_0 + 0.241071428571428*G0_1_1;
+    A[190] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.024107142857143*G0_1_0 + 0.024107142857143*G0_1_1;
+    A[191] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_1;
+    A[192] = 0.0723214285714288*G0_0_0 + 0.0482142857142858*G0_0_1 + 0.0723214285714287*G0_0_2 + 0.0482142857142859*G0_1_0 + 0.0241071428571428*G0_1_1 + 0.0482142857142858*G0_1_2;
+    A[193] = -0.192857142857143*G0_0_0 - 0.0964285714285714*G0_0_1 - 0.192857142857143*G0_0_2 - 0.0964285714285715*G0_1_0 + 0.0241071428571429*G0_1_1 - 0.0964285714285715*G0_1_2;
+    A[194] = 0.0241071428571429*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.0241071428571428*G0_1_0 + 0.0482142857142857*G0_1_1 + 0.0482142857142856*G0_1_2;
+    A[195] = 0.0241071428571428*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.0241071428571429*G0_1_0 + 0.0723214285714286*G0_1_1 + 0.0723214285714287*G0_1_2;
+    A[196] = 0.0964285714285713*G0_0_0 - 0.0241071428571429*G0_0_1 + 0.0964285714285715*G0_0_2 + 0.120535714285714*G0_1_0 - 0.0482142857142859*G0_1_1 + 0.241071428571428*G0_1_2;
+    A[197] = -0.0964285714285713*G0_0_0 - 0.120535714285714*G0_0_1 - 0.120535714285714*G0_1_0 - 0.144642857142857*G0_1_1;
+    A[198] = 0.0241071428571429*G0_0_1 + 0.0241071428571427*G0_1_0 + 0.0482142857142859*G0_1_1;
+    A[199] = -0.120535714285714*G0_0_1 - 0.0964285714285715*G0_0_2 - 0.120535714285714*G0_1_0 - 0.289285714285714*G0_1_1 - 0.241071428571428*G0_1_2;
+    A[200] = -0.0348214285714286*G0_0_0 - 0.0348214285714285*G0_0_1 - 0.0348214285714286*G0_0_2 - 0.0348214285714286*G0_1_0 - 0.0348214285714285*G0_1_1 - 0.0348214285714286*G0_1_2 - 0.0964285714285714*G0_2_0 - 0.0964285714285714*G0_2_1 - 0.0964285714285714*G0_2_2;
+    A[201] = -0.0133928571428572*G0_0_0 - 0.0133928571428572*G0_1_0;
+    A[202] = -0.0133928571428571*G0_0_1 - 0.0133928571428571*G0_1_1;
+    A[203] = 0.0348214285714286*G0_0_2 + 0.0348214285714286*G0_1_2 + 0.0482142857142858*G0_2_2;
+    A[204] = 0.0482142857142857*G0_0_1 + 0.0241071428571428*G0_0_2 + 0.0482142857142857*G0_1_1 + 0.0241071428571429*G0_1_2 + 0.0241071428571428*G0_2_1;
+    A[205] = 0.0723214285714289*G0_0_1 + 0.0482142857142859*G0_0_2 + 0.0723214285714288*G0_1_1 + 0.0482142857142858*G0_1_2 + 0.0482142857142859*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[206] = 0.0482142857142856*G0_0_0 + 0.0241071428571428*G0_0_2 + 0.0482142857142857*G0_1_0 + 0.0241071428571427*G0_1_2 + 0.0241071428571429*G0_2_0;
+    A[207] = 0.0723214285714289*G0_0_0 + 0.048214285714286*G0_0_2 + 0.0723214285714288*G0_1_0 + 0.0482142857142859*G0_1_2 + 0.0482142857142859*G0_2_0 + 0.0241071428571431*G0_2_2;
+    A[208] = 0.0241071428571429*G0_0_0 + 0.0241071428571428*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.0241071428571428*G0_1_1;
+    A[209] = 0.0241071428571429*G0_0_0 + 0.024107142857143*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.024107142857143*G0_1_1;
+    A[210] = 0.241071428571429*G0_0_0 + 0.241071428571429*G0_0_1 + 0.144642857142857*G0_0_2 + 0.241071428571429*G0_1_0 + 0.241071428571428*G0_1_1 + 0.144642857142857*G0_1_2 + 0.144642857142857*G0_2_0 + 0.144642857142857*G0_2_1 + 0.241071428571429*G0_2_2;
+    A[211] = -0.0723214285714288*G0_0_0 - 0.0723214285714288*G0_0_1 - 0.144642857142857*G0_0_2 - 0.0723214285714288*G0_1_0 - 0.0723214285714288*G0_1_1 - 0.144642857142857*G0_1_2 - 0.0482142857142859*G0_2_0 - 0.0482142857142859*G0_2_1 - 0.192857142857143*G0_2_2;
+    A[212] = 0.120535714285714*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.120535714285714*G0_0_2 + 0.120535714285714*G0_1_0 + 0.0241071428571428*G0_1_1 + 0.120535714285714*G0_1_2 + 0.0241071428571429*G0_2_0 + 0.120535714285714*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[213] = -0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 - 0.0241071428571429*G0_0_2 - 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_1 - 0.0241071428571429*G0_1_2 - 0.0241071428571429*G0_2_1;
+    A[214] = 0.0241071428571429*G0_0_0 + 0.120535714285714*G0_0_1 + 0.120535714285714*G0_0_2 + 0.0241071428571429*G0_1_0 + 0.120535714285714*G0_1_1 + 0.120535714285714*G0_1_2 + 0.120535714285714*G0_2_0 + 0.0241071428571429*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[215] = 0.0241071428571429*G0_0_0 - 0.0241071428571428*G0_0_1 - 0.0241071428571428*G0_0_2 + 0.0241071428571429*G0_1_0 - 0.0241071428571427*G0_1_1 - 0.0241071428571427*G0_1_2 - 0.0241071428571428*G0_2_0;
+    A[216] = 0.0482142857142861*G0_0_0 + 0.048214285714286*G0_0_1 + 0.024107142857143*G0_0_2 + 0.048214285714286*G0_1_0 + 0.0482142857142859*G0_1_1 + 0.024107142857143*G0_1_2 + 0.0241071428571431*G0_2_0 + 0.0241071428571432*G0_2_1;
+    A[217] = -0.0482142857142861*G0_0_0 - 0.289285714285714*G0_0_1 - 0.16875*G0_0_2 - 0.0482142857142861*G0_1_0 - 0.289285714285714*G0_1_1 - 0.16875*G0_1_2 - 0.0241071428571432*G0_2_0 - 0.16875*G0_2_1 - 0.0482142857142858*G0_2_2;
+    A[218] = -0.289285714285714*G0_0_0 - 0.0482142857142861*G0_0_1 - 0.16875*G0_0_2 - 0.289285714285714*G0_1_0 - 0.048214285714286*G0_1_1 - 0.16875*G0_1_2 - 0.16875*G0_2_0 - 0.0241071428571433*G0_2_1 - 0.048214285714286*G0_2_2;
+    A[219] = -0.144642857142857*G0_0_0 - 0.144642857142857*G0_0_1 - 0.024107142857143*G0_0_2 - 0.144642857142857*G0_1_0 - 0.144642857142857*G0_1_1 - 0.024107142857143*G0_1_2 - 0.024107142857143*G0_2_0 - 0.024107142857143*G0_2_1;
+    A[220] = 0.0133928571428572*G0_0_0 + 0.0133928571428572*G0_0_1 + 0.0133928571428572*G0_0_2 + 0.0133928571428572*G0_1_0 + 0.0133928571428572*G0_1_1 + 0.0133928571428572*G0_1_2 + 0.0482142857142857*G0_2_0 + 0.0482142857142857*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[221] = -0.0133928571428572*G0_0_0 - 0.0133928571428572*G0_1_0;
+    A[222] = -0.0133928571428571*G0_0_1 - 0.0133928571428571*G0_1_1;
+    A[223] = -0.0616071428571429*G0_0_2 - 0.0616071428571429*G0_1_2 - 0.0964285714285715*G0_2_2;
+    A[224] = 0.0723214285714286*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.0723214285714286*G0_1_1 + 0.0241071428571429*G0_1_2 + 0.0241071428571429*G0_2_1;
+    A[225] = -0.192857142857143*G0_0_1 - 0.0964285714285716*G0_0_2 - 0.192857142857143*G0_1_1 - 0.0964285714285715*G0_1_2 - 0.0964285714285715*G0_2_1 + 0.0241071428571428*G0_2_2;
+    A[226] = 0.0723214285714286*G0_0_0 + 0.0241071428571429*G0_0_2 + 0.0723214285714286*G0_1_0 + 0.0241071428571429*G0_1_2 + 0.0241071428571429*G0_2_0;
+    A[227] = -0.192857142857143*G0_0_0 - 0.0964285714285715*G0_0_2 - 0.192857142857143*G0_1_0 - 0.0964285714285714*G0_1_2 - 0.0964285714285716*G0_2_0 + 0.0241071428571427*G0_2_2;
+    A[228] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_1;
+    A[229] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_1;
+    A[230] = -0.0723214285714288*G0_0_0 - 0.0723214285714288*G0_0_1 - 0.0482142857142859*G0_0_2 - 0.0723214285714288*G0_1_0 - 0.0723214285714288*G0_1_1 - 0.0482142857142859*G0_1_2 - 0.144642857142857*G0_2_0 - 0.144642857142857*G0_2_1 - 0.192857142857143*G0_2_2;
+    A[231] = 0.192857142857143*G0_0_0 + 0.192857142857143*G0_0_1 + 0.0964285714285716*G0_0_2 + 0.192857142857143*G0_1_0 + 0.192857142857143*G0_1_1 + 0.0964285714285716*G0_1_2 + 0.0964285714285716*G0_2_0 + 0.0964285714285716*G0_2_1 + 0.241071428571429*G0_2_2;
+    A[232] = -0.024107142857143*G0_0_0 - 0.0241071428571429*G0_0_2 - 0.0241071428571429*G0_1_0 - 0.0241071428571429*G0_1_2 + 0.0241071428571428*G0_2_0 - 0.0241071428571429*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[233] = -0.0241071428571428*G0_0_0 - 0.0241071428571429*G0_0_2 - 0.0241071428571429*G0_1_0 - 0.0241071428571429*G0_1_2 - 0.0241071428571427*G0_2_1;
+    A[234] = -0.0241071428571429*G0_0_1 - 0.0241071428571429*G0_0_2 - 0.0241071428571429*G0_1_1 - 0.0241071428571429*G0_1_2 - 0.0241071428571429*G0_2_0 + 0.0241071428571429*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[235] = -0.0241071428571429*G0_0_1 - 0.0241071428571429*G0_0_2 - 0.0241071428571429*G0_1_1 - 0.0241071428571429*G0_1_2 - 0.0241071428571429*G0_2_0;
+    A[236] = -0.0964285714285715*G0_0_0 - 0.0964285714285714*G0_0_1 + 0.024107142857143*G0_0_2 - 0.0964285714285714*G0_1_0 - 0.0964285714285715*G0_1_1 + 0.024107142857143*G0_1_2 + 0.0241071428571428*G0_2_0 + 0.0241071428571428*G0_2_1;
+    A[237] = 0.0964285714285715*G0_0_0 + 0.120535714285714*G0_0_2 + 0.0964285714285714*G0_1_0 + 0.120535714285714*G0_1_2 - 0.0241071428571427*G0_2_0 + 0.120535714285714*G0_2_1 - 0.0482142857142857*G0_2_2;
+    A[238] = 0.0964285714285715*G0_0_1 + 0.120535714285714*G0_0_2 + 0.0964285714285715*G0_1_1 + 0.120535714285714*G0_1_2 + 0.120535714285714*G0_2_0 - 0.0241071428571428*G0_2_1 - 0.0482142857142856*G0_2_2;
+    A[239] = -0.024107142857143*G0_0_2 - 0.0241071428571429*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.0241071428571428*G0_2_1;
+    A[240] = -0.0348214285714286*G0_0_0 - 0.0348214285714285*G0_0_1 - 0.0348214285714286*G0_0_2 - 0.0964285714285714*G0_1_0 - 0.0964285714285715*G0_1_1 - 0.0964285714285714*G0_1_2 - 0.0348214285714286*G0_2_0 - 0.0348214285714285*G0_2_1 - 0.0348214285714286*G0_2_2;
+    A[241] = -0.0133928571428571*G0_0_0 - 0.0133928571428572*G0_2_0;
+    A[242] = 0.0348214285714286*G0_0_1 + 0.0482142857142858*G0_1_1 + 0.0348214285714286*G0_2_1;
+    A[243] = -0.0133928571428571*G0_0_2 - 0.0133928571428572*G0_2_2;
+    A[244] = 0.0482142857142858*G0_0_1 + 0.0723214285714287*G0_0_2 + 0.0241071428571427*G0_1_1 + 0.0482142857142858*G0_1_2 + 0.0482142857142857*G0_2_1 + 0.0723214285714286*G0_2_2;
+    A[245] = 0.024107142857143*G0_0_1 + 0.0482142857142857*G0_0_2 + 0.0241071428571428*G0_1_2 + 0.0241071428571429*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[246] = 0.0241071428571429*G0_0_0 + 0.0241071428571427*G0_0_2 + 0.0241071428571429*G0_2_0 + 0.0241071428571428*G0_2_2;
+    A[247] = 0.024107142857143*G0_0_0 + 0.024107142857143*G0_0_2 + 0.024107142857143*G0_2_0 + 0.0241071428571431*G0_2_2;
+    A[248] = 0.0482142857142855*G0_0_0 + 0.0241071428571428*G0_0_1 + 0.0241071428571428*G0_1_0 + 0.0482142857142856*G0_2_0 + 0.0241071428571428*G0_2_1;
+    A[249] = 0.0723214285714288*G0_0_0 + 0.0482142857142859*G0_0_1 + 0.0482142857142858*G0_1_0 + 0.0241071428571428*G0_1_1 + 0.0723214285714287*G0_2_0 + 0.0482142857142858*G0_2_1;
+    A[250] = 0.120535714285714*G0_0_0 + 0.120535714285714*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.0241071428571429*G0_1_0 + 0.0241071428571428*G0_1_1 + 0.120535714285714*G0_1_2 + 0.120535714285714*G0_2_0 + 0.120535714285714*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[251] = -0.0241071428571429*G0_0_0 - 0.0241071428571429*G0_0_1 + 0.0241071428571428*G0_0_2 - 0.024107142857143*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.0241071428571429*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[252] = 0.241071428571429*G0_0_0 + 0.144642857142857*G0_0_1 + 0.241071428571429*G0_0_2 + 0.144642857142857*G0_1_0 + 0.241071428571429*G0_1_1 + 0.144642857142857*G0_1_2 + 0.241071428571429*G0_2_0 + 0.144642857142857*G0_2_1 + 0.241071428571429*G0_2_2;
+    A[253] = -0.0723214285714287*G0_0_0 - 0.144642857142857*G0_0_1 - 0.0723214285714288*G0_0_2 - 0.0482142857142858*G0_1_0 - 0.192857142857143*G0_1_1 - 0.0482142857142858*G0_1_2 - 0.0723214285714286*G0_2_0 - 0.144642857142857*G0_2_1 - 0.0723214285714287*G0_2_2;
+    A[254] = 0.0241071428571429*G0_0_0 + 0.120535714285714*G0_0_1 + 0.120535714285714*G0_0_2 + 0.120535714285714*G0_1_0 + 0.0241071428571428*G0_1_1 + 0.0241071428571428*G0_1_2 + 0.0241071428571429*G0_2_0 + 0.120535714285714*G0_2_1 + 0.120535714285714*G0_2_2;
+    A[255] = 0.0241071428571428*G0_0_0 - 0.0241071428571428*G0_0_1 - 0.0241071428571427*G0_0_2 - 0.0241071428571429*G0_1_0 + 0.0241071428571428*G0_2_0 - 0.0241071428571428*G0_2_1 - 0.0241071428571427*G0_2_2;
+    A[256] = 0.048214285714286*G0_0_0 + 0.024107142857143*G0_0_1 + 0.0482142857142857*G0_0_2 + 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_2 + 0.0482142857142859*G0_2_0 + 0.0241071428571431*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[257] = -0.048214285714286*G0_0_0 - 0.16875*G0_0_1 - 0.289285714285714*G0_0_2 - 0.0241071428571429*G0_1_0 - 0.0482142857142856*G0_1_1 - 0.16875*G0_1_2 - 0.0482142857142859*G0_2_0 - 0.16875*G0_2_1 - 0.289285714285714*G0_2_2;
+    A[258] = -0.144642857142857*G0_0_0 - 0.024107142857143*G0_0_1 - 0.144642857142858*G0_0_2 - 0.024107142857143*G0_1_0 - 0.0241071428571431*G0_1_2 - 0.144642857142857*G0_2_0 - 0.0241071428571431*G0_2_1 - 0.144642857142858*G0_2_2;
+    A[259] = -0.289285714285714*G0_0_0 - 0.16875*G0_0_1 - 0.0482142857142858*G0_0_2 - 0.16875*G0_1_0 - 0.0482142857142856*G0_1_1 - 0.0241071428571429*G0_1_2 - 0.289285714285714*G0_2_0 - 0.16875*G0_2_1 - 0.0482142857142858*G0_2_2;
+    A[260] = 0.0133928571428572*G0_0_0 + 0.0133928571428571*G0_0_1 + 0.0133928571428571*G0_0_2 + 0.0482142857142857*G0_1_0 + 0.0482142857142858*G0_1_1 + 0.0482142857142857*G0_1_2 + 0.0133928571428572*G0_2_0 + 0.0133928571428571*G0_2_1 + 0.0133928571428571*G0_2_2;
+    A[261] = -0.0133928571428571*G0_0_0 - 0.0133928571428571*G0_2_0;
+    A[262] = -0.0616071428571428*G0_0_1 - 0.0964285714285714*G0_1_1 - 0.0616071428571428*G0_2_1;
+    A[263] = -0.0133928571428572*G0_0_2 - 0.0133928571428572*G0_2_2;
+    A[264] = -0.0964285714285714*G0_0_1 - 0.192857142857143*G0_0_2 + 0.024107142857143*G0_1_1 - 0.0964285714285714*G0_1_2 - 0.0964285714285714*G0_2_1 - 0.192857142857143*G0_2_2;
+    A[265] = 0.0241071428571429*G0_0_1 + 0.0723214285714286*G0_0_2 + 0.024107142857143*G0_1_2 + 0.0241071428571429*G0_2_1 + 0.0723214285714286*G0_2_2;
+    A[266] = 0.0241071428571428*G0_0_0 + 0.0241071428571428*G0_0_2 + 0.0241071428571428*G0_2_0 + 0.0241071428571428*G0_2_2;
+    A[267] = 0.0241071428571428*G0_0_0 + 0.0241071428571429*G0_0_2 + 0.0241071428571428*G0_2_0 + 0.0241071428571429*G0_2_2;
+    A[268] = 0.0723214285714285*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.024107142857143*G0_1_0 + 0.0723214285714285*G0_2_0 + 0.0241071428571429*G0_2_1;
+    A[269] = -0.192857142857143*G0_0_0 - 0.0964285714285715*G0_0_1 - 0.0964285714285714*G0_1_0 + 0.0241071428571429*G0_1_1 - 0.192857142857143*G0_2_0 - 0.0964285714285715*G0_2_1;
+    A[270] = -0.0241071428571429*G0_0_0 - 0.0241071428571429*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_1 - 0.0241071428571429*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.0241071428571429*G0_2_1;
+    A[271] = -0.0241071428571428*G0_0_0 - 0.0241071428571429*G0_0_1 - 0.0241071428571427*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.0241071428571429*G0_2_1;
+    A[272] = -0.0723214285714287*G0_0_0 - 0.0482142857142858*G0_0_1 - 0.0723214285714286*G0_0_2 - 0.144642857142857*G0_1_0 - 0.192857142857143*G0_1_1 - 0.144642857142857*G0_1_2 - 0.0723214285714288*G0_2_0 - 0.0482142857142858*G0_2_1 - 0.0723214285714287*G0_2_2;
+    A[273] = 0.192857142857143*G0_0_0 + 0.0964285714285714*G0_0_1 + 0.192857142857143*G0_0_2 + 0.0964285714285714*G0_1_0 + 0.241071428571428*G0_1_1 + 0.0964285714285714*G0_1_2 + 0.192857142857143*G0_2_0 + 0.0964285714285714*G0_2_1 + 0.192857142857143*G0_2_2;
+    A[274] = -0.0241071428571429*G0_0_1 - 0.0241071428571429*G0_0_2 - 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_1 + 0.0241071428571429*G0_1_2 - 0.0241071428571429*G0_2_1 - 0.0241071428571429*G0_2_2;
+    A[275] = -0.0241071428571428*G0_0_1 - 0.0241071428571429*G0_0_2 - 0.0241071428571428*G0_1_0 - 0.0241071428571428*G0_2_1 - 0.0241071428571429*G0_2_2;
+    A[276] = -0.0964285714285713*G0_0_0 + 0.0241071428571429*G0_0_1 - 0.0964285714285715*G0_0_2 + 0.024107142857143*G0_1_0 + 0.0241071428571429*G0_1_2 - 0.0964285714285713*G0_2_0 + 0.024107142857143*G0_2_1 - 0.0964285714285714*G0_2_2;
+    A[277] = 0.0964285714285713*G0_0_0 + 0.120535714285714*G0_0_1 - 0.024107142857143*G0_1_0 - 0.0482142857142859*G0_1_1 + 0.120535714285714*G0_1_2 + 0.0964285714285713*G0_2_0 + 0.120535714285714*G0_2_1;
+    A[278] = -0.0241071428571429*G0_0_1 - 0.0241071428571428*G0_1_0 - 0.0241071428571428*G0_1_2 - 0.0241071428571429*G0_2_1;
+    A[279] = 0.120535714285714*G0_0_1 + 0.0964285714285715*G0_0_2 + 0.120535714285714*G0_1_0 - 0.0482142857142858*G0_1_1 - 0.0241071428571429*G0_1_2 + 0.120535714285714*G0_2_1 + 0.0964285714285714*G0_2_2;
+    A[280] = -0.0964285714285714*G0_0_0 - 0.0964285714285714*G0_0_1 - 0.0964285714285714*G0_0_2 - 0.0348214285714285*G0_1_0 - 0.0348214285714285*G0_1_1 - 0.0348214285714286*G0_1_2 - 0.0348214285714286*G0_2_0 - 0.0348214285714285*G0_2_1 - 0.0348214285714286*G0_2_2;
+    A[281] = 0.0482142857142857*G0_0_0 + 0.0348214285714286*G0_1_0 + 0.0348214285714286*G0_2_0;
+    A[282] = -0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_2_1;
+    A[283] = -0.0133928571428571*G0_1_2 - 0.0133928571428572*G0_2_2;
+    A[284] = 0.024107142857143*G0_1_1 + 0.0241071428571428*G0_1_2 + 0.024107142857143*G0_2_1 + 0.0241071428571428*G0_2_2;
+    A[285] = 0.0241071428571429*G0_1_1 + 0.024107142857143*G0_1_2 + 0.0241071428571429*G0_2_1 + 0.024107142857143*G0_2_2;
+    A[286] = 0.0241071428571429*G0_0_0 + 0.0482142857142858*G0_0_2 + 0.0482142857142857*G0_1_0 + 0.0723214285714286*G0_1_2 + 0.0482142857142857*G0_2_0 + 0.0723214285714286*G0_2_2;
+    A[287] = 0.0241071428571428*G0_0_2 + 0.0241071428571429*G0_1_0 + 0.0482142857142857*G0_1_2 + 0.0241071428571429*G0_2_0 + 0.0482142857142857*G0_2_2;
+    A[288] = 0.0241071428571428*G0_0_0 + 0.0482142857142858*G0_0_1 + 0.0482142857142856*G0_1_0 + 0.0723214285714286*G0_1_1 + 0.0482142857142856*G0_2_0 + 0.0723214285714286*G0_2_1;
+    A[289] = 0.0241071428571428*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.0482142857142857*G0_1_1 + 0.0241071428571429*G0_2_0 + 0.0482142857142856*G0_2_1;
+    A[290] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.120535714285714*G0_0_2 + 0.120535714285714*G0_1_0 + 0.120535714285714*G0_1_1 + 0.0241071428571429*G0_1_2 + 0.120535714285714*G0_2_0 + 0.120535714285714*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[291] = -0.0241071428571429*G0_0_2 - 0.0241071428571429*G0_1_0 - 0.0241071428571429*G0_1_1 + 0.0241071428571429*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.0241071428571429*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[292] = 0.0241071428571429*G0_0_0 + 0.120535714285714*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.120535714285714*G0_1_0 + 0.0241071428571428*G0_1_1 + 0.120535714285714*G0_1_2 + 0.120535714285714*G0_2_0 + 0.0241071428571428*G0_2_1 + 0.120535714285714*G0_2_2;
+    A[293] = -0.0241071428571429*G0_0_1 - 0.0241071428571429*G0_1_0 + 0.0241071428571429*G0_1_1 - 0.0241071428571429*G0_1_2 - 0.0241071428571429*G0_2_0 + 0.0241071428571429*G0_2_1 - 0.0241071428571429*G0_2_2;
+    A[294] = 0.241071428571428*G0_0_0 + 0.144642857142857*G0_0_1 + 0.144642857142857*G0_0_2 + 0.144642857142857*G0_1_0 + 0.241071428571428*G0_1_1 + 0.241071428571428*G0_1_2 + 0.144642857142857*G0_2_0 + 0.241071428571428*G0_2_1 + 0.241071428571428*G0_2_2;
+    A[295] = -0.192857142857143*G0_0_0 - 0.0482142857142858*G0_0_1 - 0.0482142857142858*G0_0_2 - 0.144642857142857*G0_1_0 - 0.0723214285714285*G0_1_1 - 0.0723214285714285*G0_1_2 - 0.144642857142857*G0_2_0 - 0.0723214285714286*G0_2_1 - 0.0723214285714285*G0_2_2;
+    A[296] = 0.024107142857143*G0_0_1 + 0.0241071428571429*G0_0_2 + 0.0241071428571431*G0_1_0 + 0.0482142857142858*G0_1_1 + 0.0482142857142856*G0_1_2 + 0.0241071428571431*G0_2_0 + 0.0482142857142858*G0_2_1 + 0.0482142857142856*G0_2_2;
+    A[297] = -0.0241071428571429*G0_0_1 - 0.0241071428571429*G0_0_2 - 0.0241071428571431*G0_1_0 - 0.144642857142857*G0_1_1 - 0.144642857142857*G0_1_2 - 0.0241071428571431*G0_2_0 - 0.144642857142857*G0_2_1 - 0.144642857142857*G0_2_2;
+    A[298] = -0.0482142857142858*G0_0_0 - 0.024107142857143*G0_0_1 - 0.16875*G0_0_2 - 0.16875*G0_1_0 - 0.0482142857142858*G0_1_1 - 0.289285714285714*G0_1_2 - 0.16875*G0_2_0 - 0.0482142857142858*G0_2_1 - 0.289285714285714*G0_2_2;
+    A[299] = -0.0482142857142857*G0_0_0 - 0.16875*G0_0_1 - 0.0241071428571429*G0_0_2 - 0.16875*G0_1_0 - 0.289285714285714*G0_1_1 - 0.0482142857142858*G0_1_2 - 0.16875*G0_2_0 - 0.289285714285714*G0_2_1 - 0.0482142857142857*G0_2_2;
+    A[300] = 0.0482142857142857*G0_0_0 + 0.0482142857142857*G0_0_1 + 0.0482142857142857*G0_0_2 + 0.0133928571428571*G0_1_0 + 0.0133928571428571*G0_1_1 + 0.0133928571428571*G0_1_2 + 0.0133928571428571*G0_2_0 + 0.0133928571428571*G0_2_1 + 0.0133928571428571*G0_2_2;
+    A[301] = -0.0964285714285714*G0_0_0 - 0.0616071428571429*G0_1_0 - 0.0616071428571429*G0_2_0;
+    A[302] = -0.0133928571428571*G0_1_1 - 0.0133928571428571*G0_2_1;
+    A[303] = -0.0133928571428571*G0_1_2 - 0.0133928571428571*G0_2_2;
+    A[304] = 0.0241071428571428*G0_1_1 + 0.0241071428571428*G0_1_2 + 0.0241071428571428*G0_2_1 + 0.0241071428571429*G0_2_2;
+    A[305] = 0.0241071428571428*G0_1_1 + 0.0241071428571428*G0_1_2 + 0.0241071428571428*G0_2_1 + 0.0241071428571428*G0_2_2;
+    A[306] = 0.0241071428571428*G0_0_0 - 0.0964285714285716*G0_0_2 - 0.0964285714285712*G0_1_0 - 0.192857142857143*G0_1_2 - 0.0964285714285712*G0_2_0 - 0.192857142857143*G0_2_2;
+    A[307] = 0.024107142857143*G0_0_2 + 0.0241071428571429*G0_1_0 + 0.0723214285714286*G0_1_2 + 0.0241071428571429*G0_2_0 + 0.0723214285714286*G0_2_2;
+    A[308] = 0.0241071428571427*G0_0_0 - 0.0964285714285716*G0_0_1 - 0.0964285714285712*G0_1_0 - 0.192857142857143*G0_1_1 - 0.0964285714285712*G0_2_0 - 0.192857142857143*G0_2_1;
+    A[309] = 0.0241071428571429*G0_0_1 + 0.0241071428571428*G0_1_0 + 0.0723214285714286*G0_1_1 + 0.0241071428571429*G0_2_0 + 0.0723214285714287*G0_2_1;
+    A[310] = 0.0241071428571429*G0_0_0 + 0.0241071428571429*G0_0_1 - 0.0241071428571428*G0_0_2 - 0.0241071428571428*G0_1_0 - 0.0241071428571427*G0_1_1 - 0.0241071428571428*G0_2_0 - 0.0241071428571427*G0_2_1;
+    A[311] = -0.0241071428571429*G0_0_2 - 0.0241071428571429*G0_1_0 - 0.0241071428571429*G0_1_1 - 0.0241071428571429*G0_2_0 - 0.0241071428571429*G0_2_1;
+    A[312] = 0.0241071428571428*G0_0_0 - 0.0241071428571429*G0_0_1 + 0.0241071428571428*G0_0_2 - 0.0241071428571428*G0_1_0 - 0.0241071428571428*G0_1_2 - 0.0241071428571427*G0_2_0 - 0.0241071428571427*G0_2_2;
+    A[313] = -0.0241071428571428*G0_0_1 - 0.0241071428571428*G0_1_0 - 0.0241071428571428*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.0241071428571428*G0_2_2;
+    A[314] = -0.192857142857143*G0_0_0 - 0.144642857142857*G0_0_1 - 0.144642857142857*G0_0_2 - 0.0482142857142858*G0_1_0 - 0.0723214285714285*G0_1_1 - 0.0723214285714286*G0_1_2 - 0.0482142857142858*G0_2_0 - 0.0723214285714285*G0_2_1 - 0.0723214285714285*G0_2_2;
+    A[315] = 0.241071428571429*G0_0_0 + 0.0964285714285716*G0_0_1 + 0.0964285714285715*G0_0_2 + 0.0964285714285716*G0_1_0 + 0.192857142857143*G0_1_1 + 0.192857142857143*G0_1_2 + 0.0964285714285715*G0_2_0 + 0.192857142857143*G0_2_1 + 0.192857142857143*G0_2_2;
+    A[316] = 0.0241071428571427*G0_0_1 + 0.0241071428571426*G0_0_2 + 0.0241071428571428*G0_1_0 - 0.0964285714285713*G0_1_1 - 0.0964285714285713*G0_1_2 + 0.0241071428571428*G0_2_0 - 0.0964285714285713*G0_2_1 - 0.0964285714285712*G0_2_2;
+    A[317] = -0.0241071428571428*G0_0_1 - 0.0241071428571428*G0_0_2 - 0.0241071428571428*G0_1_0 - 0.0241071428571428*G0_2_0;
+    A[318] = -0.0482142857142857*G0_0_0 - 0.0241071428571427*G0_0_1 + 0.120535714285714*G0_0_2 + 0.120535714285714*G0_1_0 + 0.0964285714285713*G0_1_1 + 0.120535714285714*G0_2_0 + 0.0964285714285713*G0_2_1;
+    A[319] = -0.0482142857142855*G0_0_0 + 0.120535714285714*G0_0_1 - 0.0241071428571426*G0_0_2 + 0.120535714285714*G0_1_0 + 0.0964285714285712*G0_1_2 + 0.120535714285714*G0_2_0 + 0.0964285714285712*G0_2_2;
+    A[320] = -0.0321428571428573*G0_0_0 - 0.0321428571428572*G0_0_1 - 0.0321428571428572*G0_0_2 - 0.0321428571428573*G0_1_0 - 0.0321428571428573*G0_1_1 - 0.0321428571428573*G0_1_2 - 0.0321428571428572*G0_2_0 - 0.0321428571428572*G0_2_1 - 0.0321428571428572*G0_2_2;
+    A[321] = 0.0321428571428572*G0_0_0 - 0.0160714285714284*G0_1_0 - 0.0160714285714284*G0_2_0;
+    A[322] = -0.0160714285714287*G0_0_1 + 0.032142857142857*G0_1_1 - 0.0160714285714286*G0_2_1;
+    A[323] = -0.0160714285714286*G0_0_2 - 0.0160714285714285*G0_1_2 + 0.0321428571428571*G0_2_2;
+    A[324] = 0.241071428571429*G0_0_1 + 0.0964285714285713*G0_0_2 - 0.0482142857142855*G0_1_1 - 0.0241071428571429*G0_1_2 + 0.120535714285714*G0_2_1 + 0.0964285714285715*G0_2_2;
+    A[325] = 0.0964285714285714*G0_0_1 + 0.241071428571429*G0_0_2 + 0.0964285714285715*G0_1_1 + 0.120535714285715*G0_1_2 - 0.024107142857143*G0_2_1 - 0.0482142857142857*G0_2_2;
+    A[326] = -0.0482142857142857*G0_0_0 - 0.0241071428571427*G0_0_2 + 0.241071428571428*G0_1_0 + 0.0964285714285714*G0_1_2 + 0.120535714285714*G0_2_0 + 0.0964285714285714*G0_2_2;
+    A[327] = 0.0964285714285714*G0_0_0 + 0.120535714285714*G0_0_2 + 0.0964285714285714*G0_1_0 + 0.241071428571428*G0_1_2 - 0.024107142857143*G0_2_0 - 0.0482142857142858*G0_2_2;
+    A[328] = -0.0482142857142857*G0_0_0 - 0.0241071428571428*G0_0_1 + 0.120535714285714*G0_1_0 + 0.0964285714285714*G0_1_1 + 0.241071428571428*G0_2_0 + 0.0964285714285713*G0_2_1;
+    A[329] = 0.0964285714285713*G0_0_0 + 0.120535714285714*G0_0_1 - 0.0241071428571429*G0_1_0 - 0.0482142857142858*G0_1_1 + 0.0964285714285715*G0_2_0 + 0.241071428571428*G0_2_1;
+    A[330] = 0.0482142857142861*G0_0_0 + 0.048214285714286*G0_0_1 + 0.0241071428571431*G0_0_2 + 0.048214285714286*G0_1_0 + 0.0482142857142859*G0_1_1 + 0.0241071428571432*G0_1_2 + 0.024107142857143*G0_2_0 + 0.024107142857143*G0_2_1;
+    A[331] = -0.0964285714285715*G0_0_0 - 0.0964285714285714*G0_0_1 + 0.0241071428571428*G0_0_2 - 0.0964285714285714*G0_1_0 - 0.0964285714285715*G0_1_1 + 0.0241071428571428*G0_1_2 + 0.024107142857143*G0_2_0 + 0.024107142857143*G0_2_1;
+    A[332] = 0.048214285714286*G0_0_0 + 0.0241071428571429*G0_0_1 + 0.0482142857142859*G0_0_2 + 0.024107142857143*G0_1_0 + 0.0241071428571431*G0_1_2 + 0.0482142857142857*G0_2_0 + 0.0241071428571429*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[333] = -0.0964285714285713*G0_0_0 + 0.024107142857143*G0_0_1 - 0.0964285714285713*G0_0_2 + 0.0241071428571429*G0_1_0 + 0.024107142857143*G0_1_2 - 0.0964285714285715*G0_2_0 + 0.0241071428571429*G0_2_1 - 0.0964285714285714*G0_2_2;
+    A[334] = 0.0241071428571431*G0_0_1 + 0.0241071428571431*G0_0_2 + 0.024107142857143*G0_1_0 + 0.0482142857142858*G0_1_1 + 0.0482142857142858*G0_1_2 + 0.0241071428571429*G0_2_0 + 0.0482142857142856*G0_2_1 + 0.0482142857142856*G0_2_2;
+    A[335] = 0.0241071428571428*G0_0_1 + 0.0241071428571428*G0_0_2 + 0.0241071428571427*G0_1_0 - 0.0964285714285713*G0_1_1 - 0.0964285714285713*G0_1_2 + 0.0241071428571426*G0_2_0 - 0.0964285714285713*G0_2_1 - 0.0964285714285712*G0_2_2;
+    A[336] = 0.578571428571429*G0_0_0 + 0.289285714285714*G0_0_1 + 0.289285714285714*G0_0_2 + 0.289285714285714*G0_1_0 + 0.578571428571428*G0_1_1 + 0.289285714285713*G0_1_2 + 0.289285714285714*G0_2_0 + 0.289285714285713*G0_2_1 + 0.578571428571427*G0_2_2;
+    A[337] = -0.578571428571429*G0_0_0 - 0.289285714285714*G0_0_1 - 0.289285714285714*G0_0_2 - 0.289285714285714*G0_1_0 - 0.144642857142858*G0_1_2 - 0.289285714285714*G0_2_0 - 0.144642857142857*G0_2_1;
+    A[338] = -0.289285714285714*G0_0_1 - 0.144642857142857*G0_0_2 - 0.289285714285714*G0_1_0 - 0.578571428571428*G0_1_1 - 0.289285714285714*G0_1_2 - 0.144642857142857*G0_2_0 - 0.289285714285714*G0_2_1;
+    A[339] = -0.144642857142857*G0_0_1 - 0.289285714285714*G0_0_2 - 0.144642857142857*G0_1_0 - 0.289285714285714*G0_1_2 - 0.289285714285713*G0_2_0 - 0.289285714285714*G0_2_1 - 0.578571428571427*G0_2_2;
+    A[340] = 0.0321428571428573*G0_0_0 + 0.0321428571428572*G0_0_1 + 0.0321428571428572*G0_0_2 + 0.0482142857142857*G0_1_0 + 0.0482142857142856*G0_1_1 + 0.0482142857142857*G0_1_2 + 0.0482142857142857*G0_2_0 + 0.0482142857142857*G0_2_1 + 0.0482142857142857*G0_2_2;
+    A[341] = -0.0321428571428572*G0_0_0;
+    A[342] = 0.0160714285714287*G0_0_1 + 0.0482142857142857*G0_1_1;
+    A[343] = 0.0160714285714286*G0_0_2 + 0.0482142857142857*G0_2_2;
+    A[344] = -0.241071428571429*G0_0_1 - 0.0964285714285713*G0_0_2 - 0.289285714285714*G0_1_1 - 0.120535714285714*G0_1_2 - 0.120535714285714*G0_2_1;
+    A[345] = -0.0964285714285714*G0_0_1 - 0.241071428571429*G0_0_2 - 0.120535714285714*G0_1_2 - 0.120535714285714*G0_2_1 - 0.289285714285714*G0_2_2;
+    A[346] = 0.0482142857142857*G0_0_0 + 0.0241071428571427*G0_0_2 + 0.0241071428571426*G0_2_0;
+    A[347] = -0.0964285714285714*G0_0_0 - 0.120535714285714*G0_0_2 - 0.120535714285714*G0_2_0 - 0.144642857142857*G0_2_2;
+    A[348] = 0.0482142857142857*G0_0_0 + 0.0241071428571428*G0_0_1 + 0.0241071428571427*G0_1_0;
+    A[349] = -0.0964285714285713*G0_0_0 - 0.120535714285714*G0_0_1 - 0.120535714285714*G0_1_0 - 0.144642857142857*G0_1_1;
+    A[350] = -0.0482142857142861*G0_0_0 - 0.0482142857142861*G0_0_1 - 0.0241071428571432*G0_0_2 - 0.289285714285714*G0_1_0 - 0.289285714285714*G0_1_1 - 0.16875*G0_1_2 - 0.16875*G0_2_0 - 0.16875*G0_2_1 - 0.0482142857142858*G0_2_2;
+    A[351] = 0.0964285714285715*G0_0_0 + 0.0964285714285714*G0_0_1 - 0.0241071428571427*G0_0_2 + 0.120535714285714*G0_1_2 + 0.120535714285714*G0_2_0 + 0.120535714285714*G0_2_1 - 0.0482142857142857*G0_2_2;
+    A[352] = -0.048214285714286*G0_0_0 - 0.0241071428571429*G0_0_1 - 0.0482142857142859*G0_0_2 - 0.16875*G0_1_0 - 0.0482142857142856*G0_1_1 - 0.16875*G0_1_2 - 0.289285714285714*G0_2_0 - 0.16875*G0_2_1 - 0.289285714285714*G0_2_2;
+    A[353] = 0.0964285714285713*G0_0_0 - 0.024107142857143*G0_0_1 + 0.0964285714285713*G0_0_2 + 0.120535714285714*G0_1_0 - 0.0482142857142859*G0_1_1 + 0.120535714285714*G0_1_2 + 0.120535714285714*G0_2_1;
+    A[354] = -0.0241071428571431*G0_0_1 - 0.0241071428571431*G0_0_2 - 0.024107142857143*G0_1_0 - 0.144642857142857*G0_1_1 - 0.144642857142857*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.144642857142857*G0_2_1 - 0.144642857142857*G0_2_2;
+    A[355] = -0.0241071428571428*G0_0_1 - 0.0241071428571428*G0_0_2 - 0.0241071428571428*G0_1_0 - 0.0241071428571428*G0_2_0;
+    A[356] = -0.578571428571429*G0_0_0 - 0.289285714285714*G0_0_1 - 0.289285714285714*G0_0_2 - 0.289285714285714*G0_1_0 - 0.144642857142857*G0_1_2 - 0.289285714285714*G0_2_0 - 0.144642857142858*G0_2_1;
+    A[357] = 0.578571428571429*G0_0_0 + 0.289285714285715*G0_0_1 + 0.289285714285715*G0_0_2 + 0.289285714285715*G0_1_0 + 0.578571428571428*G0_1_1 + 0.289285714285714*G0_1_2 + 0.289285714285715*G0_2_0 + 0.289285714285714*G0_2_1 + 0.578571428571429*G0_2_2;
+    A[358] = 0.289285714285714*G0_0_1 + 0.144642857142857*G0_0_2 + 0.289285714285714*G0_1_0 + 0.144642857142858*G0_1_2 + 0.144642857142858*G0_2_0 + 0.144642857142858*G0_2_1 + 0.289285714285715*G0_2_2;
+    A[359] = 0.144642857142857*G0_0_1 + 0.289285714285714*G0_0_2 + 0.144642857142857*G0_1_0 + 0.289285714285715*G0_1_1 + 0.144642857142857*G0_1_2 + 0.289285714285714*G0_2_0 + 0.144642857142857*G0_2_1;
+    A[360] = 0.0482142857142857*G0_0_0 + 0.0482142857142857*G0_0_1 + 0.0482142857142857*G0_0_2 + 0.0321428571428573*G0_1_0 + 0.0321428571428573*G0_1_1 + 0.0321428571428573*G0_1_2 + 0.0482142857142858*G0_2_0 + 0.0482142857142858*G0_2_1 + 0.0482142857142859*G0_2_2;
+    A[361] = 0.0482142857142857*G0_0_0 + 0.0160714285714284*G0_1_0;
+    A[362] = -0.0321428571428571*G0_1_1;
+    A[363] = 0.0160714285714285*G0_1_2 + 0.0482142857142857*G0_2_2;
+    A[364] = 0.0482142857142855*G0_1_1 + 0.0241071428571429*G0_1_2 + 0.0241071428571426*G0_2_1;
+    A[365] = -0.0964285714285715*G0_1_1 - 0.120535714285715*G0_1_2 - 0.120535714285714*G0_2_1 - 0.144642857142857*G0_2_2;
+    A[366] = -0.289285714285714*G0_0_0 - 0.120535714285714*G0_0_2 - 0.241071428571428*G0_1_0 - 0.0964285714285714*G0_1_2 - 0.120535714285714*G0_2_0;
+    A[367] = -0.120535714285714*G0_0_2 - 0.0964285714285715*G0_1_0 - 0.241071428571429*G0_1_2 - 0.120535714285714*G0_2_0 - 0.289285714285714*G0_2_2;
+    A[368] = -0.144642857142857*G0_0_0 - 0.120535714285714*G0_0_1 - 0.120535714285714*G0_1_0 - 0.0964285714285715*G0_1_1;
+    A[369] = 0.0241071428571427*G0_0_1 + 0.0241071428571429*G0_1_0 + 0.0482142857142859*G0_1_1;
+    A[370] = -0.289285714285714*G0_0_0 - 0.289285714285714*G0_0_1 - 0.16875*G0_0_2 - 0.0482142857142861*G0_1_0 - 0.048214285714286*G0_1_1 - 0.0241071428571433*G0_1_2 - 0.16875*G0_2_0 - 0.16875*G0_2_1 - 0.048214285714286*G0_2_2;
+    A[371] = 0.120535714285714*G0_0_2 + 0.0964285714285715*G0_1_0 + 0.0964285714285715*G0_1_1 - 0.0241071428571428*G0_1_2 + 0.120535714285714*G0_2_0 + 0.120535714285714*G0_2_1 - 0.0482142857142856*G0_2_2;
+    A[372] = -0.144642857142857*G0_0_0 - 0.024107142857143*G0_0_1 - 0.144642857142857*G0_0_2 - 0.024107142857143*G0_1_0 - 0.0241071428571431*G0_1_2 - 0.144642857142858*G0_2_0 - 0.0241071428571431*G0_2_1 - 0.144642857142858*G0_2_2;
+    A[373] = -0.0241071428571428*G0_0_1 - 0.0241071428571429*G0_1_0 - 0.0241071428571429*G0_1_2 - 0.0241071428571428*G0_2_1;
+    A[374] = -0.0482142857142858*G0_0_0 - 0.16875*G0_0_1 - 0.16875*G0_0_2 - 0.024107142857143*G0_1_0 - 0.0482142857142858*G0_1_1 - 0.0482142857142858*G0_1_2 - 0.16875*G0_2_0 - 0.289285714285714*G0_2_1 - 0.289285714285714*G0_2_2;
+    A[375] = -0.0482142857142857*G0_0_0 + 0.120535714285714*G0_0_1 + 0.120535714285714*G0_0_2 - 0.0241071428571427*G0_1_0 + 0.0964285714285714*G0_1_1 + 0.0964285714285713*G0_1_2 + 0.120535714285714*G0_2_0;
+    A[376] = -0.289285714285714*G0_0_1 - 0.144642857142857*G0_0_2 - 0.289285714285714*G0_1_0 - 0.578571428571428*G0_1_1 - 0.289285714285714*G0_1_2 - 0.144642857142857*G0_2_0 - 0.289285714285714*G0_2_1;
+    A[377] = 0.289285714285714*G0_0_1 + 0.144642857142858*G0_0_2 + 0.289285714285714*G0_1_0 + 0.144642857142858*G0_1_2 + 0.144642857142857*G0_2_0 + 0.144642857142858*G0_2_1 + 0.289285714285715*G0_2_2;
+    A[378] = 0.578571428571428*G0_0_0 + 0.289285714285714*G0_0_1 + 0.289285714285715*G0_0_2 + 0.289285714285714*G0_1_0 + 0.578571428571428*G0_1_1 + 0.289285714285714*G0_1_2 + 0.289285714285715*G0_2_0 + 0.289285714285714*G0_2_1 + 0.578571428571428*G0_2_2;
+    A[379] = 0.289285714285714*G0_0_0 + 0.144642857142857*G0_0_1 + 0.144642857142857*G0_0_2 + 0.144642857142857*G0_1_0 + 0.289285714285714*G0_1_2 + 0.144642857142858*G0_2_0 + 0.289285714285714*G0_2_1;
+    A[380] = 0.0482142857142856*G0_0_0 + 0.0482142857142856*G0_0_1 + 0.0482142857142857*G0_0_2 + 0.0482142857142857*G0_1_0 + 0.0482142857142856*G0_1_1 + 0.0482142857142857*G0_1_2 + 0.0321428571428572*G0_2_0 + 0.0321428571428572*G0_2_1 + 0.0321428571428572*G0_2_2;
+    A[381] = 0.0482142857142856*G0_0_0 + 0.0160714285714284*G0_2_0;
+    A[382] = 0.0482142857142856*G0_1_1 + 0.0160714285714286*G0_2_1;
+    A[383] = -0.0321428571428571*G0_2_2;
+    A[384] = -0.144642857142857*G0_1_1 - 0.120535714285714*G0_1_2 - 0.120535714285714*G0_2_1 - 0.0964285714285715*G0_2_2;
+    A[385] = 0.0241071428571427*G0_1_2 + 0.0241071428571429*G0_2_1 + 0.0482142857142856*G0_2_2;
+    A[386] = -0.144642857142857*G0_0_0 - 0.120535714285714*G0_0_2 - 0.120535714285714*G0_2_0 - 0.0964285714285714*G0_2_2;
+    A[387] = 0.0241071428571425*G0_0_2 + 0.024107142857143*G0_2_0 + 0.0482142857142857*G0_2_2;
+    A[388] = -0.289285714285713*G0_0_0 - 0.120535714285714*G0_0_1 - 0.120535714285714*G0_1_0 - 0.241071428571428*G0_2_0 - 0.0964285714285713*G0_2_1;
+    A[389] = -0.120535714285714*G0_0_1 - 0.120535714285714*G0_1_0 - 0.289285714285714*G0_1_1 - 0.0964285714285715*G0_2_0 - 0.241071428571428*G0_2_1;
+    A[390] = -0.144642857142857*G0_0_0 - 0.144642857142857*G0_0_1 - 0.024107142857143*G0_0_2 - 0.144642857142857*G0_1_0 - 0.144642857142857*G0_1_1 - 0.024107142857143*G0_1_2 - 0.024107142857143*G0_2_0 - 0.024107142857143*G0_2_1;
+    A[391] = -0.0241071428571429*G0_0_2 - 0.0241071428571428*G0_1_2 - 0.024107142857143*G0_2_0 - 0.024107142857143*G0_2_1;
+    A[392] = -0.289285714285714*G0_0_0 - 0.16875*G0_0_1 - 0.289285714285714*G0_0_2 - 0.16875*G0_1_0 - 0.0482142857142856*G0_1_1 - 0.16875*G0_1_2 - 0.0482142857142858*G0_2_0 - 0.0241071428571429*G0_2_1 - 0.0482142857142858*G0_2_2;
+    A[393] = 0.120535714285714*G0_0_1 + 0.120535714285714*G0_1_0 - 0.0482142857142858*G0_1_1 + 0.120535714285714*G0_1_2 + 0.0964285714285715*G0_2_0 - 0.0241071428571429*G0_2_1 + 0.0964285714285714*G0_2_2;
+    A[394] = -0.0482142857142857*G0_0_0 - 0.16875*G0_0_1 - 0.16875*G0_0_2 - 0.16875*G0_1_0 - 0.289285714285714*G0_1_1 - 0.289285714285714*G0_1_2 - 0.0241071428571429*G0_2_0 - 0.0482142857142858*G0_2_1 - 0.0482142857142857*G0_2_2;
+    A[395] = -0.0482142857142855*G0_0_0 + 0.120535714285714*G0_0_1 + 0.120535714285714*G0_0_2 + 0.120535714285714*G0_1_0 - 0.0241071428571426*G0_2_0 + 0.0964285714285713*G0_2_1 + 0.0964285714285712*G0_2_2;
+    A[396] = -0.144642857142857*G0_0_1 - 0.289285714285713*G0_0_2 - 0.144642857142857*G0_1_0 - 0.289285714285714*G0_1_2 - 0.289285714285714*G0_2_0 - 0.289285714285714*G0_2_1 - 0.578571428571427*G0_2_2;
+    A[397] = 0.144642857142857*G0_0_1 + 0.289285714285714*G0_0_2 + 0.144642857142857*G0_1_0 + 0.289285714285715*G0_1_1 + 0.144642857142857*G0_1_2 + 0.289285714285714*G0_2_0 + 0.144642857142857*G0_2_1;
+    A[398] = 0.289285714285714*G0_0_0 + 0.144642857142857*G0_0_1 + 0.144642857142858*G0_0_2 + 0.144642857142857*G0_1_0 + 0.289285714285714*G0_1_2 + 0.144642857142857*G0_2_0 + 0.289285714285714*G0_2_1;
+    A[399] = 0.578571428571427*G0_0_0 + 0.289285714285714*G0_0_1 + 0.289285714285713*G0_0_2 + 0.289285714285714*G0_1_0 + 0.578571428571428*G0_1_1 + 0.289285714285714*G0_1_2 + 0.289285714285713*G0_2_0 + 0.289285714285714*G0_2_1 + 0.578571428571427*G0_2_2;
+}
+
+/// Constructor
+poisson3d_3_cell_integral_1_otherwise::poisson3d_3_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_3_cell_integral_1_otherwise::~poisson3d_3_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson3d_3_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson3d_3_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    20
+    // Number of operations (multiply-add pairs) for tensor contraction: 270
+    // Total number of operations (multiply-add pairs):                  293
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    const double G0_10 = det*w[0][10]*(1.0);
+    const double G0_11 = det*w[0][11]*(1.0);
+    const double G0_12 = det*w[0][12]*(1.0);
+    const double G0_13 = det*w[0][13]*(1.0);
+    const double G0_14 = det*w[0][14]*(1.0);
+    const double G0_15 = det*w[0][15]*(1.0);
+    const double G0_16 = det*w[0][16]*(1.0);
+    const double G0_17 = det*w[0][17]*(1.0);
+    const double G0_18 = det*w[0][18]*(1.0);
+    const double G0_19 = det*w[0][19]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.000595238095238099*G0_0 + 7.4404761904762e-05*G0_1 + 7.4404761904762e-05*G0_2 + 7.44047619047623e-05*G0_3 + 0.000111607142857144*G0_4 + 0.000111607142857143*G0_5 + 0.000111607142857143*G0_6 + 0.000111607142857142*G0_7 + 0.000111607142857143*G0_8 + 0.000111607142857143*G0_9 - 0.000446428571428571*G0_10 + 0.000223214285714285*G0_11 - 0.000446428571428571*G0_12 + 0.000223214285714286*G0_13 - 0.000446428571428572*G0_14 + 0.000223214285714285*G0_15 + 0.00133928571428571*G0_16 + 0.000669642857142859*G0_17 + 0.00066964285714286*G0_18 + 0.000669642857142859*G0_19;
+    A[1] = 7.44047619047621e-05*G0_0 + 0.000595238095238098*G0_1 + 7.44047619047615e-05*G0_2 + 7.44047619047618e-05*G0_3 + 0.000111607142857143*G0_4 + 0.000111607142857143*G0_5 - 0.000446428571428571*G0_6 + 0.000223214285714286*G0_7 - 0.000446428571428572*G0_8 + 0.000223214285714285*G0_9 + 0.000111607142857142*G0_10 + 0.000111607142857143*G0_11 + 0.000111607142857144*G0_12 + 0.000111607142857143*G0_13 + 0.000223214285714285*G0_14 - 0.000446428571428571*G0_15 + 0.000669642857142856*G0_16 + 0.00133928571428571*G0_17 + 0.000669642857142856*G0_18 + 0.000669642857142855*G0_19;
+    A[2] = 7.44047619047619e-05*G0_0 + 7.44047619047615e-05*G0_1 + 0.000595238095238097*G0_2 + 7.44047619047617e-05*G0_3 - 0.000446428571428572*G0_4 + 0.000223214285714287*G0_5 + 0.000111607142857143*G0_6 + 0.000111607142857143*G0_7 + 0.000223214285714286*G0_8 - 0.000446428571428572*G0_9 + 0.000111607142857142*G0_10 + 0.000111607142857143*G0_11 + 0.000223214285714286*G0_12 - 0.000446428571428571*G0_13 + 0.000111607142857143*G0_14 + 0.000111607142857143*G0_15 + 0.000669642857142853*G0_16 + 0.000669642857142853*G0_17 + 0.00133928571428571*G0_18 + 0.000669642857142854*G0_19;
+    A[3] = 7.44047619047623e-05*G0_0 + 7.44047619047618e-05*G0_1 + 7.44047619047617e-05*G0_2 + 0.000595238095238098*G0_3 + 0.000223214285714286*G0_4 - 0.000446428571428571*G0_5 + 0.000223214285714286*G0_6 - 0.000446428571428571*G0_7 + 0.000111607142857142*G0_8 + 0.000111607142857143*G0_9 + 0.000223214285714285*G0_10 - 0.000446428571428572*G0_11 + 0.000111607142857143*G0_12 + 0.000111607142857143*G0_13 + 0.000111607142857143*G0_14 + 0.000111607142857143*G0_15 + 0.000669642857142858*G0_16 + 0.000669642857142858*G0_17 + 0.000669642857142858*G0_18 + 0.00133928571428571*G0_19;
+    A[4] = 0.000111607142857143*G0_0 + 0.000111607142857143*G0_1 - 0.000446428571428572*G0_2 + 0.000223214285714286*G0_3 + 0.00401785714285714*G0_4 - 0.00200892857142857*G0_5 - 0.00100446428571429*G0_7 - 0.00100446428571429*G0_8 + 0.00200892857142857*G0_9 - 0.00100446428571429*G0_11 - 0.00100446428571429*G0_12 + 0.00200892857142857*G0_13 - 0.00200892857142857*G0_18;
+    A[5] = 0.000111607142857143*G0_0 + 0.000111607142857143*G0_1 + 0.000223214285714287*G0_2 - 0.000446428571428571*G0_3 - 0.00200892857142857*G0_4 + 0.00401785714285715*G0_5 - 0.00100446428571429*G0_6 + 0.00200892857142857*G0_7 - 0.00100446428571429*G0_9 - 0.00100446428571429*G0_10 + 0.00200892857142857*G0_11 - 0.00100446428571429*G0_13 - 0.00200892857142857*G0_19;
+    A[6] = 0.000111607142857143*G0_0 - 0.000446428571428571*G0_1 + 0.000111607142857143*G0_2 + 0.000223214285714286*G0_3 - 0.00100446428571429*G0_5 + 0.00401785714285714*G0_6 - 0.00200892857142857*G0_7 + 0.00200892857142857*G0_8 - 0.00100446428571429*G0_9 - 0.00100446428571429*G0_11 - 0.00100446428571429*G0_14 + 0.00200892857142857*G0_15 - 0.00200892857142857*G0_17;
+    A[7] = 0.000111607142857142*G0_0 + 0.000223214285714286*G0_1 + 0.000111607142857143*G0_2 - 0.000446428571428571*G0_3 - 0.00100446428571429*G0_4 + 0.00200892857142857*G0_5 - 0.00200892857142857*G0_6 + 0.00401785714285715*G0_7 - 0.00100446428571429*G0_8 - 0.00100446428571429*G0_10 + 0.00200892857142857*G0_11 - 0.00100446428571429*G0_15 - 0.00200892857142858*G0_19;
+    A[8] = 0.000111607142857143*G0_0 - 0.000446428571428572*G0_1 + 0.000223214285714286*G0_2 + 0.000111607142857142*G0_3 - 0.00100446428571429*G0_4 + 0.00200892857142857*G0_6 - 0.00100446428571429*G0_7 + 0.00401785714285714*G0_8 - 0.00200892857142857*G0_9 - 0.00100446428571429*G0_13 - 0.00100446428571429*G0_14 + 0.00200892857142857*G0_15 - 0.00200892857142857*G0_17;
+    A[9] = 0.000111607142857143*G0_0 + 0.000223214285714285*G0_1 - 0.000446428571428572*G0_2 + 0.000111607142857143*G0_3 + 0.00200892857142857*G0_4 - 0.00100446428571429*G0_5 - 0.00100446428571429*G0_6 - 0.00200892857142857*G0_8 + 0.00401785714285714*G0_9 - 0.00100446428571429*G0_12 + 0.00200892857142857*G0_13 - 0.00100446428571429*G0_15 - 0.00200892857142857*G0_18;
+    A[10] = -0.000446428571428571*G0_0 + 0.000111607142857142*G0_1 + 0.000111607142857142*G0_2 + 0.000223214285714285*G0_3 - 0.00100446428571429*G0_5 - 0.00100446428571429*G0_7 + 0.00401785714285714*G0_10 - 0.00200892857142857*G0_11 + 0.00200892857142857*G0_12 - 0.00100446428571429*G0_13 + 0.00200892857142857*G0_14 - 0.00100446428571429*G0_15 - 0.00200892857142858*G0_16;
+    A[11] = 0.000223214285714285*G0_0 + 0.000111607142857143*G0_1 + 0.000111607142857143*G0_2 - 0.000446428571428572*G0_3 - 0.00100446428571429*G0_4 + 0.00200892857142857*G0_5 - 0.00100446428571429*G0_6 + 0.00200892857142857*G0_7 - 0.00200892857142857*G0_10 + 0.00401785714285715*G0_11 - 0.00100446428571429*G0_12 - 0.00100446428571429*G0_14 - 0.00200892857142858*G0_19;
+    A[12] = -0.000446428571428571*G0_0 + 0.000111607142857144*G0_1 + 0.000223214285714286*G0_2 + 0.000111607142857143*G0_3 - 0.00100446428571429*G0_4 - 0.00100446428571429*G0_9 + 0.00200892857142857*G0_10 - 0.00100446428571429*G0_11 + 0.00401785714285715*G0_12 - 0.00200892857142857*G0_13 + 0.00200892857142857*G0_14 - 0.00100446428571429*G0_15 - 0.00200892857142857*G0_16;
+    A[13] = 0.000223214285714286*G0_0 + 0.000111607142857143*G0_1 - 0.000446428571428571*G0_2 + 0.000111607142857143*G0_3 + 0.00200892857142857*G0_4 - 0.00100446428571429*G0_5 - 0.00100446428571429*G0_8 + 0.00200892857142857*G0_9 - 0.00100446428571429*G0_10 - 0.00200892857142857*G0_12 + 0.00401785714285715*G0_13 - 0.00100446428571429*G0_14 - 0.00200892857142857*G0_18;
+    A[14] = -0.000446428571428572*G0_0 + 0.000223214285714285*G0_1 + 0.000111607142857143*G0_2 + 0.000111607142857143*G0_3 - 0.00100446428571429*G0_6 - 0.00100446428571429*G0_8 + 0.00200892857142857*G0_10 - 0.00100446428571429*G0_11 + 0.00200892857142857*G0_12 - 0.00100446428571429*G0_13 + 0.00401785714285715*G0_14 - 0.00200892857142857*G0_15 - 0.00200892857142858*G0_16;
+    A[15] = 0.000223214285714285*G0_0 - 0.000446428571428571*G0_1 + 0.000111607142857143*G0_2 + 0.000111607142857143*G0_3 + 0.00200892857142857*G0_6 - 0.00100446428571429*G0_7 + 0.00200892857142857*G0_8 - 0.00100446428571429*G0_9 - 0.00100446428571429*G0_10 - 0.00100446428571429*G0_12 - 0.00200892857142857*G0_14 + 0.00401785714285715*G0_15 - 0.00200892857142857*G0_17;
+    A[16] = 0.00133928571428571*G0_0 + 0.000669642857142856*G0_1 + 0.000669642857142854*G0_2 + 0.000669642857142858*G0_3 - 0.00200892857142858*G0_10 - 0.00200892857142857*G0_12 - 0.00200892857142858*G0_14 + 0.0160714285714286*G0_16 + 0.00803571428571428*G0_17 + 0.0080357142857143*G0_18 + 0.00803571428571429*G0_19;
+    A[17] = 0.000669642857142859*G0_0 + 0.00133928571428571*G0_1 + 0.000669642857142853*G0_2 + 0.000669642857142858*G0_3 - 0.00200892857142857*G0_6 - 0.00200892857142857*G0_8 - 0.00200892857142857*G0_15 + 0.00803571428571428*G0_16 + 0.0160714285714286*G0_17 + 0.00803571428571429*G0_18 + 0.00803571428571428*G0_19;
+    A[18] = 0.00066964285714286*G0_0 + 0.000669642857142856*G0_1 + 0.00133928571428571*G0_2 + 0.000669642857142858*G0_3 - 0.00200892857142857*G0_4 - 0.00200892857142857*G0_9 - 0.00200892857142857*G0_13 + 0.0080357142857143*G0_16 + 0.00803571428571429*G0_17 + 0.0160714285714286*G0_18 + 0.00803571428571429*G0_19;
+    A[19] = 0.000669642857142859*G0_0 + 0.000669642857142855*G0_1 + 0.000669642857142854*G0_2 + 0.00133928571428571*G0_3 - 0.00200892857142857*G0_5 - 0.00200892857142857*G0_7 - 0.00200892857142858*G0_11 + 0.00803571428571429*G0_16 + 0.00803571428571428*G0_17 + 0.00803571428571429*G0_18 + 0.0160714285714286*G0_19;
+}
+
+/// Constructor
+poisson3d_3_form_0::poisson3d_3_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_3_form_0::~poisson3d_3_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson3d_3_form_0::signature() const
+{
+    return "eb82495e12a51aa1d6d3ccc3c8bd04c5fb6c772d895bbae2c3b485c865584b4e47c210c2ebc8c4a8a2beb7eddf317a24dde78e0cd3b93b20b9bab87d2d7101f8";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson3d_3_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson3d_3_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson3d_3_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson3d_3_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson3d_3_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson3d_3_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson3d_3_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson3d_3_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson3d_3_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson3d_3_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson3d_3_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson3d_3_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson3d_3_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_3_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_3_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson3d_3_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_3_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_3_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson3d_3_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson3d_3_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson3d_3_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson3d_3_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson3d_3_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson3d_3_form_0::create_default_cell_integral() const
+{
+    return new poisson3d_3_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson3d_3_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson3d_3_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson3d_3_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson3d_3_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson3d_3_form_1::poisson3d_3_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_3_form_1::~poisson3d_3_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson3d_3_form_1::signature() const
+{
+    return "f9405063f92a2988230194e9d18e524c1ee620ee1d76ecf7f88dd23e9553c1294fe4daae2ff79b61d09ac944a61874c56b1a10b111d117f93c964ea164cb2cd3";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson3d_3_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson3d_3_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson3d_3_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson3d_3_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson3d_3_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson3d_3_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson3d_3_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson3d_3_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson3d_3_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson3d_3_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson3d_3_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson3d_3_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson3d_3_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_3_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_3_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson3d_3_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_3_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_3_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson3d_3_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson3d_3_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson3d_3_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson3d_3_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson3d_3_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson3d_3_form_1::create_default_cell_integral() const
+{
+    return new poisson3d_3_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson3d_3_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson3d_3_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson3d_3_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson3d_3_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson3D_3.h b/bench/fem/convergence/cpp/Poisson3D_3.h
new file mode 100644
index 0000000..f1f8db0
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_3.h
@@ -0,0 +1,985 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON3D_3_H
+#define __POISSON3D_3_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson3d_3_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson3d_3_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson3d_3_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson3d_3_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson3d_3_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson3d_3_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_3_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_3_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson3d_3_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_3_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_3_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson3d_3_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_3_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_3_form_0();
+
+  /// Destructor
+  virtual ~poisson3d_3_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_3_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_3_form_1();
+
+  /// Destructor
+  virtual ~poisson3d_3_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson3D_3
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_3_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_3_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_3_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_3_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson3D_3.ufl b/bench/fem/convergence/cpp/Poisson3D_3.ufl
new file mode 100644
index 0000000..e105f8c
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_3.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#
+# Poisson's equation in 3D for q = 3
+
+element = FiniteElement("Lagrange", tetrahedron, 3)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/Poisson3D_4.cpp b/bench/fem/convergence/cpp/Poisson3D_4.cpp
new file mode 100644
index 0000000..a5f9714
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_4.cpp
@@ -0,0 +1,3054 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no-evaluate_basis:              True
+//   no-evaluate_basis_derivatives:  True
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "Poisson3D_4.h"
+
+/// Constructor
+poisson3d_4_finite_element_0::poisson3d_4_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_4_finite_element_0::~poisson3d_4_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* poisson3d_4_finite_element_0::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 4, None)";
+}
+
+/// Return the cell shape
+ufc::shape poisson3d_4_finite_element_0::cell_shape() const
+{
+    return ufc::tetrahedron;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t poisson3d_4_finite_element_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t poisson3d_4_finite_element_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t poisson3d_4_finite_element_0::space_dimension() const
+{
+    return 35;
+}
+
+/// Return the rank of the value space
+std::size_t poisson3d_4_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t poisson3d_4_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void poisson3d_4_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+throw std::runtime_error("// Function evaluate_basis not generated (compiled with -fno-evaluate_basis)");
+}
+
+/// Evaluate all basis functions at given point x in cell
+void poisson3d_4_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 35; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void poisson3d_4_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+throw std::runtime_error("// Function evaluate_basis_derivatives not generated (compiled with -fno-evaluate_basis_derivatives)");
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void poisson3d_4_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 35; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 4)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[81];
+    for (unsigned int r = 0; r < 81; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 35; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double poisson3d_4_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.75*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.75*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.75*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.25*vertex_coordinates[6] + 0.75*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[7] + 0.75*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[8] + 0.75*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+      y[1] = 0.75*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+      y[2] = 0.75*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[4] + 0.75*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[5] + 0.75*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+      y[1] = 0.75*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+      y[2] = 0.75*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 12:
+      {
+        y[0] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[6];
+      y[1] = 0.25*vertex_coordinates[4] + 0.75*vertex_coordinates[7];
+      y[2] = 0.25*vertex_coordinates[5] + 0.75*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 13:
+      {
+        y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[9];
+      y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[10];
+      y[2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[6];
+      y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[7];
+      y[2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[6];
+      y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[7];
+      y[2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[3];
+      y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[4];
+      y[2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 20:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 21:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[3];
+      y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[4];
+      y[2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 22:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 23:
+      {
+        y[0] = 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 24:
+      {
+        y[0] = 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 25:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 26:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 27:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 28:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 29:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 30:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 31:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 32:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+      y[1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+      y[2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 33:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 34:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void poisson3d_4_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.75*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.75*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.75*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.25*vertex_coordinates[6] + 0.75*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[7] + 0.75*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[8] + 0.75*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+    y[1] = 0.75*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+    y[2] = 0.75*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[4] + 0.75*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[5] + 0.75*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+    y[1] = 0.75*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+    y[2] = 0.75*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[10] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[11] = vals[0];
+    y[0] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[6];
+    y[1] = 0.25*vertex_coordinates[4] + 0.75*vertex_coordinates[7];
+    y[2] = 0.25*vertex_coordinates[5] + 0.75*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[12] = vals[0];
+    y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[9];
+    y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[10];
+    y[2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[13] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[14] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[15] = vals[0];
+    y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[6];
+    y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[7];
+    y[2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[16] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[17] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[6];
+    y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[7];
+    y[2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[18] = vals[0];
+    y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[3];
+    y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[4];
+    y[2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[19] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[20] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[3];
+    y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[4];
+    y[2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[21] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[22] = vals[0];
+    y[0] = 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[23] = vals[0];
+    y[0] = 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[24] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[25] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[26] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[27] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[28] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[29] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[30] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[31] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+    y[1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+    y[2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[32] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[33] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[34] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void poisson3d_4_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void poisson3d_4_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void poisson3d_4_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t poisson3d_4_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* poisson3d_4_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* poisson3d_4_finite_element_0::create() const
+{
+    return new poisson3d_4_finite_element_0();
+}
+
+/// Constructor
+poisson3d_4_dofmap_0::poisson3d_4_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_4_dofmap_0::~poisson3d_4_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* poisson3d_4_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 4, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool poisson3d_4_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    case 3:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t poisson3d_4_dofmap_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t poisson3d_4_dofmap_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t poisson3d_4_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0] + 3*num_global_entities[1] + 3*num_global_entities[2] + num_global_entities[3];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t poisson3d_4_dofmap_0::local_dimension() const
+{
+    return 35;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t poisson3d_4_dofmap_0::num_facet_dofs() const
+{
+    return 15;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t poisson3d_4_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 3;
+        break;
+      }
+    case 2:
+      {
+        return 3;
+        break;
+      }
+    case 3:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void poisson3d_4_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + 3*c.entity_indices[1][0];
+    dofs[5] = offset + 3*c.entity_indices[1][0] + 1;
+    dofs[6] = offset + 3*c.entity_indices[1][0] + 2;
+    dofs[7] = offset + 3*c.entity_indices[1][1];
+    dofs[8] = offset + 3*c.entity_indices[1][1] + 1;
+    dofs[9] = offset + 3*c.entity_indices[1][1] + 2;
+    dofs[10] = offset + 3*c.entity_indices[1][2];
+    dofs[11] = offset + 3*c.entity_indices[1][2] + 1;
+    dofs[12] = offset + 3*c.entity_indices[1][2] + 2;
+    dofs[13] = offset + 3*c.entity_indices[1][3];
+    dofs[14] = offset + 3*c.entity_indices[1][3] + 1;
+    dofs[15] = offset + 3*c.entity_indices[1][3] + 2;
+    dofs[16] = offset + 3*c.entity_indices[1][4];
+    dofs[17] = offset + 3*c.entity_indices[1][4] + 1;
+    dofs[18] = offset + 3*c.entity_indices[1][4] + 2;
+    dofs[19] = offset + 3*c.entity_indices[1][5];
+    dofs[20] = offset + 3*c.entity_indices[1][5] + 1;
+    dofs[21] = offset + 3*c.entity_indices[1][5] + 2;
+    offset += 3*num_global_entities[1];
+    dofs[22] = offset + 3*c.entity_indices[2][0];
+    dofs[23] = offset + 3*c.entity_indices[2][0] + 1;
+    dofs[24] = offset + 3*c.entity_indices[2][0] + 2;
+    dofs[25] = offset + 3*c.entity_indices[2][1];
+    dofs[26] = offset + 3*c.entity_indices[2][1] + 1;
+    dofs[27] = offset + 3*c.entity_indices[2][1] + 2;
+    dofs[28] = offset + 3*c.entity_indices[2][2];
+    dofs[29] = offset + 3*c.entity_indices[2][2] + 1;
+    dofs[30] = offset + 3*c.entity_indices[2][2] + 2;
+    dofs[31] = offset + 3*c.entity_indices[2][3];
+    dofs[32] = offset + 3*c.entity_indices[2][3] + 1;
+    dofs[33] = offset + 3*c.entity_indices[2][3] + 2;
+    offset += 3*num_global_entities[2];
+    dofs[34] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void poisson3d_4_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 7;
+      dofs[7] = 8;
+      dofs[8] = 9;
+      dofs[9] = 10;
+      dofs[10] = 11;
+      dofs[11] = 12;
+      dofs[12] = 22;
+      dofs[13] = 23;
+      dofs[14] = 24;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 13;
+      dofs[7] = 14;
+      dofs[8] = 15;
+      dofs[9] = 16;
+      dofs[10] = 17;
+      dofs[11] = 18;
+      dofs[12] = 25;
+      dofs[13] = 26;
+      dofs[14] = 27;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+      dofs[6] = 13;
+      dofs[7] = 14;
+      dofs[8] = 15;
+      dofs[9] = 19;
+      dofs[10] = 20;
+      dofs[11] = 21;
+      dofs[12] = 28;
+      dofs[13] = 29;
+      dofs[14] = 30;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 10;
+      dofs[4] = 11;
+      dofs[5] = 12;
+      dofs[6] = 16;
+      dofs[7] = 17;
+      dofs[8] = 18;
+      dofs[9] = 19;
+      dofs[10] = 20;
+      dofs[11] = 21;
+      dofs[12] = 31;
+      dofs[13] = 32;
+      dofs[14] = 33;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void poisson3d_4_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+        dofs[1] = 5;
+        dofs[2] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+        dofs[2] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 10;
+        dofs[1] = 11;
+        dofs[2] = 12;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 13;
+        dofs[1] = 14;
+        dofs[2] = 15;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 16;
+        dofs[1] = 17;
+        dofs[2] = 18;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 19;
+        dofs[1] = 20;
+        dofs[2] = 21;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 22;
+        dofs[1] = 23;
+        dofs[2] = 24;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 25;
+        dofs[1] = 26;
+        dofs[2] = 27;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 28;
+        dofs[1] = 29;
+        dofs[2] = 30;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 31;
+        dofs[1] = 32;
+        dofs[2] = 33;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 34;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void poisson3d_4_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.75*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.75*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.75*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.25*vertex_coordinates[6] + 0.75*vertex_coordinates[9];
+    dof_coordinates[6][1] = 0.25*vertex_coordinates[7] + 0.75*vertex_coordinates[10];
+    dof_coordinates[6][2] = 0.25*vertex_coordinates[8] + 0.75*vertex_coordinates[11];
+    dof_coordinates[7][0] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.75*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.75*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[9][0] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[9];
+    dof_coordinates[9][1] = 0.25*vertex_coordinates[4] + 0.75*vertex_coordinates[10];
+    dof_coordinates[9][2] = 0.25*vertex_coordinates[5] + 0.75*vertex_coordinates[11];
+    dof_coordinates[10][0] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+    dof_coordinates[10][1] = 0.75*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+    dof_coordinates[10][2] = 0.75*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[11][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[12][0] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[6];
+    dof_coordinates[12][1] = 0.25*vertex_coordinates[4] + 0.75*vertex_coordinates[7];
+    dof_coordinates[12][2] = 0.25*vertex_coordinates[5] + 0.75*vertex_coordinates[8];
+    dof_coordinates[13][0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[9];
+    dof_coordinates[13][1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[10];
+    dof_coordinates[13][2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[11];
+    dof_coordinates[14][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[14][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[14][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[15][0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[9];
+    dof_coordinates[15][1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[10];
+    dof_coordinates[15][2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[11];
+    dof_coordinates[16][0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[6];
+    dof_coordinates[16][1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[7];
+    dof_coordinates[16][2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[8];
+    dof_coordinates[17][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[17][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[17][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[18][0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[6];
+    dof_coordinates[18][1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[7];
+    dof_coordinates[18][2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[8];
+    dof_coordinates[19][0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[3];
+    dof_coordinates[19][1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[4];
+    dof_coordinates[19][2] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[5];
+    dof_coordinates[20][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[20][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[20][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[21][0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[3];
+    dof_coordinates[21][1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[4];
+    dof_coordinates[21][2] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[5];
+    dof_coordinates[22][0] = 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[22][1] = 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[22][2] = 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[23][0] = 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[23][1] = 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[23][2] = 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[24][0] = 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[24][1] = 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[24][2] = 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[25][0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[25][1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[25][2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[26][0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[26][1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[26][2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[27][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[27][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[27][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[28][0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+    dof_coordinates[28][1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+    dof_coordinates[28][2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+    dof_coordinates[29][0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[9];
+    dof_coordinates[29][1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[10];
+    dof_coordinates[29][2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[11];
+    dof_coordinates[30][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[30][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[30][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[31][0] = 0.5*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+    dof_coordinates[31][1] = 0.5*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+    dof_coordinates[31][2] = 0.5*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+    dof_coordinates[32][0] = 0.25*vertex_coordinates[0] + 0.5*vertex_coordinates[3] + 0.25*vertex_coordinates[6];
+    dof_coordinates[32][1] = 0.25*vertex_coordinates[1] + 0.5*vertex_coordinates[4] + 0.25*vertex_coordinates[7];
+    dof_coordinates[32][2] = 0.25*vertex_coordinates[2] + 0.5*vertex_coordinates[5] + 0.25*vertex_coordinates[8];
+    dof_coordinates[33][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[33][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[33][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[34][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[34][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[34][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t poisson3d_4_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* poisson3d_4_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* poisson3d_4_dofmap_0::create() const
+{
+    return new poisson3d_4_dofmap_0();
+}
+
+/// Constructor
+poisson3d_4_cell_integral_0_otherwise::poisson3d_4_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_4_cell_integral_0_otherwise::~poisson3d_4_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson3d_4_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson3d_4_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 6311
+    // Total number of operations (multiply-add pairs):                  6341
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.0379188712522047*G0_0_0 + 0.0379188712522047*G0_0_1 + 0.0379188712522047*G0_0_2 + 0.0379188712522047*G0_1_0 + 0.0379188712522047*G0_1_1 + 0.0379188712522047*G0_1_2 + 0.0379188712522047*G0_2_0 + 0.0379188712522047*G0_2_1 + 0.0379188712522048*G0_2_2;
+    A[1] = 0.00511463844797185*G0_0_0 + 0.00511463844797184*G0_1_0 + 0.00511463844797185*G0_2_0;
+    A[2] = 0.00511463844797184*G0_0_1 + 0.00511463844797184*G0_1_1 + 0.00511463844797184*G0_2_1;
+    A[3] = 0.00511463844797178*G0_0_2 + 0.00511463844797179*G0_1_2 + 0.00511463844797181*G0_2_2;
+    A[4] = 0.00776014109347431*G0_0_1 + 0.00776014109347443*G0_0_2 + 0.00776014109347433*G0_1_1 + 0.00776014109347443*G0_1_2 + 0.00776014109347432*G0_2_1 + 0.00776014109347443*G0_2_2;
+    A[5] = 0.00511463844797182*G0_0_1 + 0.00511463844797174*G0_0_2 + 0.00511463844797182*G0_1_1 + 0.00511463844797176*G0_1_2 + 0.00511463844797184*G0_2_1 + 0.00511463844797177*G0_2_2;
+    A[6] = 0.00776014109347439*G0_0_1 + 0.00776014109347442*G0_0_2 + 0.00776014109347441*G0_1_1 + 0.00776014109347441*G0_1_2 + 0.00776014109347439*G0_2_1 + 0.00776014109347437*G0_2_2;
+    A[7] = 0.00776014109347427*G0_0_0 + 0.00776014109347443*G0_0_2 + 0.0077601410934743*G0_1_0 + 0.00776014109347443*G0_1_2 + 0.00776014109347429*G0_2_0 + 0.00776014109347443*G0_2_2;
+    A[8] = 0.00511463844797186*G0_0_0 + 0.00511463844797174*G0_0_2 + 0.00511463844797183*G0_1_0 + 0.00511463844797174*G0_1_2 + 0.00511463844797186*G0_2_0 + 0.00511463844797178*G0_2_2;
+    A[9] = 0.00776014109347439*G0_0_0 + 0.00776014109347442*G0_0_2 + 0.00776014109347441*G0_1_0 + 0.00776014109347441*G0_1_2 + 0.00776014109347439*G0_2_0 + 0.00776014109347436*G0_2_2;
+    A[10] = 0.00776014109347433*G0_0_0 + 0.00776014109347442*G0_0_1 + 0.00776014109347435*G0_1_0 + 0.00776014109347442*G0_1_1 + 0.00776014109347434*G0_2_0 + 0.00776014109347442*G0_2_1;
+    A[11] = 0.00511463844797171*G0_0_0 + 0.00511463844797175*G0_0_1 + 0.0051146384479717*G0_1_0 + 0.00511463844797174*G0_1_1 + 0.00511463844797168*G0_2_0 + 0.00511463844797172*G0_2_1;
+    A[12] = 0.00776014109347443*G0_0_0 + 0.00776014109347435*G0_0_1 + 0.00776014109347443*G0_1_0 + 0.00776014109347434*G0_1_1 + 0.00776014109347443*G0_2_0 + 0.00776014109347435*G0_2_1;
+    A[13] = -0.0246913580246911*G0_0_0 - 0.0246913580246912*G0_0_1 - 0.0705467372134041*G0_0_2 - 0.0246913580246911*G0_1_0 - 0.0246913580246912*G0_1_1 - 0.0705467372134041*G0_1_2 - 0.0246913580246911*G0_2_0 - 0.0246913580246912*G0_2_1 - 0.0705467372134041*G0_2_2;
+    A[14] = 0.0202821869488535*G0_0_0 + 0.0202821869488535*G0_0_1 + 0.052910052910053*G0_0_2 + 0.0202821869488535*G0_1_0 + 0.0202821869488535*G0_1_1 + 0.052910052910053*G0_1_2 + 0.0202821869488535*G0_2_0 + 0.0202821869488535*G0_2_1 + 0.0529100529100531*G0_2_2;
+    A[15] = -0.00776014109347439*G0_0_0 - 0.00776014109347439*G0_0_1 - 0.0253968253968254*G0_0_2 - 0.00776014109347441*G0_1_0 - 0.00776014109347442*G0_1_1 - 0.0253968253968254*G0_1_2 - 0.00776014109347438*G0_2_0 - 0.00776014109347439*G0_2_1 - 0.0253968253968254*G0_2_2;
+    A[16] = -0.0246913580246912*G0_0_0 - 0.0705467372134042*G0_0_1 - 0.0246913580246912*G0_0_2 - 0.0246913580246912*G0_1_0 - 0.0705467372134042*G0_1_1 - 0.0246913580246912*G0_1_2 - 0.0246913580246912*G0_2_0 - 0.0705467372134042*G0_2_1 - 0.0246913580246913*G0_2_2;
+    A[17] = 0.0202821869488536*G0_0_0 + 0.0529100529100531*G0_0_1 + 0.0202821869488536*G0_0_2 + 0.0202821869488535*G0_1_0 + 0.0529100529100531*G0_1_1 + 0.0202821869488535*G0_1_2 + 0.0202821869488536*G0_2_0 + 0.0529100529100531*G0_2_1 + 0.0202821869488536*G0_2_2;
+    A[18] = -0.00776014109347444*G0_0_0 - 0.0253968253968255*G0_0_1 - 0.00776014109347443*G0_0_2 - 0.00776014109347444*G0_1_0 - 0.0253968253968255*G0_1_1 - 0.00776014109347443*G0_1_2 - 0.00776014109347444*G0_2_0 - 0.0253968253968255*G0_2_1 - 0.00776014109347444*G0_2_2;
+    A[19] = -0.0705467372134042*G0_0_0 - 0.0246913580246913*G0_0_1 - 0.0246913580246913*G0_0_2 - 0.0705467372134042*G0_1_0 - 0.0246913580246913*G0_1_1 - 0.0246913580246913*G0_1_2 - 0.0705467372134042*G0_2_0 - 0.0246913580246913*G0_2_1 - 0.0246913580246913*G0_2_2;
+    A[20] = 0.0529100529100532*G0_0_0 + 0.0202821869488536*G0_0_1 + 0.0202821869488535*G0_0_2 + 0.0529100529100532*G0_1_0 + 0.0202821869488536*G0_1_1 + 0.0202821869488536*G0_1_2 + 0.0529100529100532*G0_2_0 + 0.0202821869488536*G0_2_1 + 0.0202821869488536*G0_2_2;
+    A[21] = -0.0253968253968256*G0_0_0 - 0.0077601410934744*G0_0_1 - 0.00776014109347439*G0_0_2 - 0.0253968253968256*G0_1_0 - 0.00776014109347441*G0_1_1 - 0.00776014109347439*G0_1_2 - 0.0253968253968256*G0_2_0 - 0.0077601410934744*G0_2_1 - 0.00776014109347439*G0_2_2;
+    A[22] = 0.0183421516754852*G0_0_0 + 0.0183421516754849*G0_0_1 + 0.0183421516754849*G0_0_2 + 0.0183421516754852*G0_1_0 + 0.0183421516754848*G0_1_1 + 0.0183421516754848*G0_1_2 + 0.0183421516754852*G0_2_0 + 0.0183421516754849*G0_2_1 + 0.0183421516754848*G0_2_2;
+    A[23] = 0.0183421516754849*G0_0_0 + 0.0183421516754853*G0_0_1 + 0.018342151675485*G0_0_2 + 0.018342151675485*G0_1_0 + 0.0183421516754853*G0_1_1 + 0.018342151675485*G0_1_2 + 0.018342151675485*G0_2_0 + 0.0183421516754853*G0_2_1 + 0.018342151675485*G0_2_2;
+    A[24] = 0.0183421516754852*G0_0_0 + 0.0183421516754852*G0_0_1 + 0.0183421516754854*G0_0_2 + 0.0183421516754853*G0_1_0 + 0.0183421516754852*G0_1_1 + 0.0183421516754855*G0_1_2 + 0.0183421516754853*G0_2_0 + 0.0183421516754852*G0_2_1 + 0.0183421516754856*G0_2_2;
+    A[25] = 0.0493827160493826*G0_0_0 + 0.042328042328042*G0_0_1 + 0.0423280423280421*G0_0_2 + 0.0493827160493825*G0_1_0 + 0.042328042328042*G0_1_1 + 0.0423280423280421*G0_1_2 + 0.0493827160493825*G0_2_0 + 0.042328042328042*G0_2_1 + 0.042328042328042*G0_2_2;
+    A[26] = -0.0183421516754849*G0_0_0 - 0.0253968253968252*G0_0_1 - 0.0253968253968254*G0_0_2 - 0.018342151675485*G0_1_0 - 0.0253968253968252*G0_1_1 - 0.0253968253968254*G0_1_2 - 0.018342151675485*G0_2_0 - 0.0253968253968252*G0_2_1 - 0.0253968253968254*G0_2_2;
+    A[27] = -0.0183421516754852*G0_0_0 - 0.0253968253968253*G0_0_1 - 0.0253968253968252*G0_0_2 - 0.0183421516754852*G0_1_0 - 0.0253968253968253*G0_1_1 - 0.0253968253968252*G0_1_2 - 0.0183421516754852*G0_2_0 - 0.0253968253968253*G0_2_1 - 0.0253968253968252*G0_2_2;
+    A[28] = 0.042328042328042*G0_0_0 + 0.0493827160493825*G0_0_1 + 0.0423280423280422*G0_0_2 + 0.042328042328042*G0_1_0 + 0.0493827160493826*G0_1_1 + 0.0423280423280422*G0_1_2 + 0.042328042328042*G0_2_0 + 0.0493827160493825*G0_2_1 + 0.0423280423280421*G0_2_2;
+    A[29] = -0.0253968253968251*G0_0_0 - 0.0183421516754849*G0_0_1 - 0.0253968253968253*G0_0_2 - 0.0253968253968251*G0_1_0 - 0.0183421516754848*G0_1_1 - 0.0253968253968253*G0_1_2 - 0.0253968253968251*G0_2_0 - 0.0183421516754849*G0_2_1 - 0.0253968253968254*G0_2_2;
+    A[30] = -0.0253968253968253*G0_0_0 - 0.0183421516754853*G0_0_1 - 0.0253968253968253*G0_0_2 - 0.0253968253968253*G0_1_0 - 0.0183421516754853*G0_1_1 - 0.0253968253968253*G0_1_2 - 0.0253968253968253*G0_2_0 - 0.0183421516754853*G0_2_1 - 0.0253968253968252*G0_2_2;
+    A[31] = 0.0423280423280421*G0_0_0 + 0.0423280423280422*G0_0_1 + 0.0493827160493826*G0_0_2 + 0.0423280423280421*G0_1_0 + 0.0423280423280422*G0_1_1 + 0.0493827160493826*G0_1_2 + 0.0423280423280421*G0_2_0 + 0.0423280423280422*G0_2_1 + 0.0493827160493826*G0_2_2;
+    A[32] = -0.0253968253968252*G0_0_0 - 0.0253968253968253*G0_0_1 - 0.0183421516754849*G0_0_2 - 0.0253968253968252*G0_1_0 - 0.0253968253968254*G0_1_1 - 0.0183421516754849*G0_1_2 - 0.0253968253968252*G0_2_0 - 0.0253968253968253*G0_2_1 - 0.0183421516754848*G0_2_2;
+    A[33] = -0.0253968253968253*G0_0_0 - 0.0253968253968253*G0_0_1 - 0.0183421516754849*G0_0_2 - 0.0253968253968253*G0_1_0 - 0.0253968253968252*G0_1_1 - 0.018342151675485*G0_1_2 - 0.0253968253968253*G0_2_0 - 0.0253968253968253*G0_2_1 - 0.0183421516754849*G0_2_2;
+    A[34] = -0.0677248677248679*G0_0_0 - 0.0677248677248678*G0_0_1 - 0.067724867724868*G0_0_2 - 0.0677248677248678*G0_1_0 - 0.0677248677248679*G0_1_1 - 0.067724867724868*G0_1_2 - 0.0677248677248678*G0_2_0 - 0.0677248677248678*G0_2_1 - 0.0677248677248681*G0_2_2;
+    A[35] = 0.00511463844797185*G0_0_0 + 0.00511463844797184*G0_0_1 + 0.00511463844797185*G0_0_2;
+    A[36] = 0.0379188712522048*G0_0_0;
+    A[37] = -0.0051146384479718*G0_0_1;
+    A[38] = -0.00511463844797184*G0_0_2;
+    A[39] = -0.00776014109347447*G0_0_1 - 0.00776014109347444*G0_0_2;
+    A[40] = -0.00511463844797174*G0_0_1 - 0.00511463844797182*G0_0_2;
+    A[41] = -0.00776014109347443*G0_0_1 - 0.00776014109347433*G0_0_2;
+    A[42] = -0.0246913580246914*G0_0_0 + 0.0458553791887129*G0_0_2;
+    A[43] = 0.0202821869488536*G0_0_0 - 0.0326278659611997*G0_0_2;
+    A[44] = -0.00776014109347442*G0_0_0 + 0.0176366843033512*G0_0_2;
+    A[45] = -0.0246913580246913*G0_0_0 + 0.0458553791887129*G0_0_1;
+    A[46] = 0.0202821869488536*G0_0_0 - 0.0326278659611995*G0_0_1;
+    A[47] = -0.00776014109347445*G0_0_0 + 0.017636684303351*G0_0_1;
+    A[48] = 0.0077601410934745*G0_0_0 + 0.00776014109347449*G0_0_1;
+    A[49] = 0.00511463844797171*G0_0_0 + 0.0051146384479717*G0_0_1;
+    A[50] = 0.00776014109347442*G0_0_0 + 0.00776014109347442*G0_0_1;
+    A[51] = 0.00776014109347446*G0_0_0 + 0.00776014109347445*G0_0_2;
+    A[52] = 0.00511463844797175*G0_0_0 + 0.00511463844797175*G0_0_2;
+    A[53] = 0.00776014109347445*G0_0_0 + 0.00776014109347447*G0_0_2;
+    A[54] = -0.0253968253968256*G0_0_0 - 0.017636684303351*G0_0_1 - 0.017636684303351*G0_0_2;
+    A[55] = 0.0529100529100531*G0_0_0 + 0.0326278659611996*G0_0_1 + 0.0326278659611995*G0_0_2;
+    A[56] = -0.0705467372134042*G0_0_0 - 0.0458553791887129*G0_0_1 - 0.0458553791887129*G0_0_2;
+    A[57] = 0.0493827160493828*G0_0_0 + 0.00705467372134029*G0_0_1 + 0.0070546737213405*G0_0_2;
+    A[58] = -0.0183421516754851*G0_0_0 + 0.00705467372134041*G0_0_1 + 0.00705467372134037*G0_0_2;
+    A[59] = -0.0183421516754848*G0_0_0 + 0.00705467372134061*G0_0_1 + 0.00705467372134052*G0_0_2;
+    A[60] = 0.018342151675485*G0_0_0;
+    A[61] = 0.0183421516754851*G0_0_0;
+    A[62] = 0.0183421516754848*G0_0_0;
+    A[63] = -0.0253968253968255*G0_0_0 - 0.00705467372134048*G0_0_1;
+    A[64] = 0.0423280423280424*G0_0_0 - 0.00705467372134026*G0_0_1;
+    A[65] = -0.0253968253968254*G0_0_0 - 0.00705467372134063*G0_0_1;
+    A[66] = -0.0253968253968254*G0_0_0 - 0.00705467372134037*G0_0_2;
+    A[67] = 0.0423280423280422*G0_0_0 - 0.00705467372134043*G0_0_2;
+    A[68] = -0.0253968253968254*G0_0_0 - 0.00705467372134036*G0_0_2;
+    A[69] = -0.0677248677248677*G0_0_0;
+    A[70] = 0.00511463844797184*G0_1_0 + 0.00511463844797184*G0_1_1 + 0.00511463844797184*G0_1_2;
+    A[71] = -0.00511463844797179*G0_1_0;
+    A[72] = 0.0379188712522048*G0_1_1;
+    A[73] = -0.00511463844797181*G0_1_2;
+    A[74] = -0.0246913580246914*G0_1_1 + 0.0458553791887129*G0_1_2;
+    A[75] = 0.0202821869488536*G0_1_1 - 0.0326278659611996*G0_1_2;
+    A[76] = -0.00776014109347458*G0_1_1 + 0.0176366843033509*G0_1_2;
+    A[77] = -0.00776014109347446*G0_1_0 - 0.00776014109347441*G0_1_2;
+    A[78] = -0.00511463844797169*G0_1_0 - 0.00511463844797175*G0_1_2;
+    A[79] = -0.00776014109347458*G0_1_0 - 0.00776014109347452*G0_1_2;
+    A[80] = 0.0176366843033511*G0_1_0 - 0.00776014109347443*G0_1_1;
+    A[81] = -0.0326278659611996*G0_1_0 + 0.0202821869488536*G0_1_1;
+    A[82] = 0.0458553791887128*G0_1_0 - 0.0246913580246914*G0_1_1;
+    A[83] = 0.00776014109347445*G0_1_0 + 0.00776014109347444*G0_1_1;
+    A[84] = 0.00511463844797169*G0_1_0 + 0.00511463844797171*G0_1_1;
+    A[85] = 0.00776014109347457*G0_1_0 + 0.00776014109347458*G0_1_1;
+    A[86] = -0.017636684303351*G0_1_0 - 0.0253968253968256*G0_1_1 - 0.017636684303351*G0_1_2;
+    A[87] = 0.0326278659611995*G0_1_0 + 0.0529100529100532*G0_1_1 + 0.0326278659611995*G0_1_2;
+    A[88] = -0.0458553791887129*G0_1_0 - 0.0705467372134042*G0_1_1 - 0.0458553791887129*G0_1_2;
+    A[89] = 0.00776014109347447*G0_1_1 + 0.00776014109347447*G0_1_2;
+    A[90] = 0.0051146384479718*G0_1_1 + 0.0051146384479718*G0_1_2;
+    A[91] = 0.00776014109347443*G0_1_1 + 0.00776014109347443*G0_1_2;
+    A[92] = 0.00705467372134048*G0_1_0 - 0.0183421516754849*G0_1_1 + 0.00705467372134043*G0_1_2;
+    A[93] = 0.00705467372134035*G0_1_0 + 0.0493827160493827*G0_1_1 + 0.00705467372134039*G0_1_2;
+    A[94] = 0.00705467372134015*G0_1_0 - 0.0183421516754851*G0_1_1 + 0.00705467372134029*G0_1_2;
+    A[95] = -0.0070546737213406*G0_1_0 - 0.0253968253968254*G0_1_1;
+    A[96] = -0.00705467372134032*G0_1_0 + 0.0423280423280423*G0_1_1;
+    A[97] = -0.00705467372134016*G0_1_0 - 0.0253968253968253*G0_1_1;
+    A[98] = 0.0183421516754848*G0_1_1;
+    A[99] = 0.0183421516754849*G0_1_1;
+    A[100] = 0.0183421516754851*G0_1_1;
+    A[101] = -0.0253968253968254*G0_1_1 - 0.00705467372134047*G0_1_2;
+    A[102] = -0.0253968253968254*G0_1_1 - 0.00705467372134051*G0_1_2;
+    A[103] = 0.0423280423280423*G0_1_1 - 0.00705467372134034*G0_1_2;
+    A[104] = -0.0677248677248675*G0_1_1;
+    A[105] = 0.00511463844797178*G0_2_0 + 0.00511463844797179*G0_2_1 + 0.00511463844797181*G0_2_2;
+    A[106] = -0.00511463844797184*G0_2_0;
+    A[107] = -0.00511463844797181*G0_2_1;
+    A[108] = 0.0379188712522048*G0_2_2;
+    A[109] = 0.0176366843033511*G0_2_1 - 0.00776014109347449*G0_2_2;
+    A[110] = -0.0326278659611996*G0_2_1 + 0.0202821869488537*G0_2_2;
+    A[111] = 0.045855379188713*G0_2_1 - 0.0246913580246914*G0_2_2;
+    A[112] = 0.0176366843033511*G0_2_0 - 0.00776014109347452*G0_2_2;
+    A[113] = -0.0326278659611996*G0_2_0 + 0.0202821869488537*G0_2_2;
+    A[114] = 0.045855379188713*G0_2_0 - 0.0246913580246915*G0_2_2;
+    A[115] = -0.00776014109347448*G0_2_0 - 0.00776014109347453*G0_2_1;
+    A[116] = -0.00511463844797174*G0_2_0 - 0.00511463844797171*G0_2_1;
+    A[117] = -0.00776014109347446*G0_2_0 - 0.00776014109347445*G0_2_1;
+    A[118] = -0.0176366843033511*G0_2_0 - 0.0176366843033511*G0_2_1 - 0.0253968253968255*G0_2_2;
+    A[119] = 0.0326278659611996*G0_2_0 + 0.0326278659611997*G0_2_1 + 0.0529100529100532*G0_2_2;
+    A[120] = -0.045855379188713*G0_2_0 - 0.045855379188713*G0_2_1 - 0.0705467372134043*G0_2_2;
+    A[121] = 0.00776014109347442*G0_2_0 + 0.0077601410934744*G0_2_2;
+    A[122] = 0.00511463844797173*G0_2_0 + 0.00511463844797174*G0_2_2;
+    A[123] = 0.00776014109347446*G0_2_0 + 0.00776014109347446*G0_2_2;
+    A[124] = 0.0077601410934744*G0_2_1 + 0.0077601410934744*G0_2_2;
+    A[125] = 0.00511463844797174*G0_2_1 + 0.00511463844797175*G0_2_2;
+    A[126] = 0.00776014109347453*G0_2_1 + 0.00776014109347454*G0_2_2;
+    A[127] = 0.00705467372134042*G0_2_0 + 0.00705467372134034*G0_2_1 - 0.0183421516754851*G0_2_2;
+    A[128] = 0.00705467372134039*G0_2_0 + 0.00705467372134051*G0_2_1 - 0.0183421516754849*G0_2_2;
+    A[129] = 0.00705467372134039*G0_2_0 + 0.00705467372134029*G0_2_1 + 0.0493827160493827*G0_2_2;
+    A[130] = -0.00705467372134034*G0_2_0 - 0.0253968253968253*G0_2_2;
+    A[131] = -0.00705467372134041*G0_2_0 - 0.0253968253968254*G0_2_2;
+    A[132] = -0.00705467372134039*G0_2_0 + 0.0423280423280422*G0_2_2;
+    A[133] = -0.00705467372134036*G0_2_1 - 0.0253968253968253*G0_2_2;
+    A[134] = -0.00705467372134038*G0_2_1 - 0.0253968253968254*G0_2_2;
+    A[135] = -0.00705467372134029*G0_2_1 + 0.0423280423280423*G0_2_2;
+    A[136] = 0.018342151675485*G0_2_2;
+    A[137] = 0.0183421516754851*G0_2_2;
+    A[138] = 0.018342151675485*G0_2_2;
+    A[139] = -0.0677248677248676*G0_2_2;
+    A[140] = 0.00776014109347431*G0_1_0 + 0.00776014109347433*G0_1_1 + 0.00776014109347432*G0_1_2 + 0.00776014109347443*G0_2_0 + 0.00776014109347443*G0_2_1 + 0.00776014109347443*G0_2_2;
+    A[141] = -0.00776014109347447*G0_1_0 - 0.00776014109347444*G0_2_0;
+    A[142] = -0.0246913580246914*G0_1_1 + 0.0458553791887129*G0_2_1;
+    A[143] = 0.0176366843033511*G0_1_2 - 0.00776014109347449*G0_2_2;
+    A[144] = 0.203174603174603*G0_1_1 + 0.0790123456790126*G0_1_2 + 0.0790123456790126*G0_2_1 + 0.158024691358026*G0_2_2;
+    A[145] = -0.118518518518519*G0_1_1 + 0.0423280423280421*G0_1_2 - 0.0310405643738979*G0_2_1 - 0.0902998236331577*G0_2_2;
+    A[146] = 0.0451499118165789*G0_1_1 - 0.0338624338624336*G0_1_2 + 0.0112874779541446*G0_2_1 + 0.0451499118165786*G0_2_2;
+    A[147] = 0.0225749559082894*G0_1_0 + 0.0112874779541447*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0112874779541448*G0_2_2;
+    A[148] = 0.0169312169312166*G0_1_0 + 0.0141093474426807*G0_1_2 + 0.00282186948853615*G0_2_0 + 0.00282186948853593*G0_2_2;
+    A[149] = 0.0451499118165789*G0_1_0 + 0.033862433862434*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0112874779541447*G0_2_2;
+    A[150] = 0.0338624338624338*G0_1_0 + 0.0112874779541447*G0_1_1 + 0.0451499118165788*G0_2_0 + 0.0112874779541448*G0_2_1;
+    A[151] = -0.0592592592592594*G0_1_0 - 0.0423280423280426*G0_1_1 - 0.0902998236331578*G0_2_0 - 0.031040564373898*G0_2_1;
+    A[152] = 0.0790123456790126*G0_1_0 + 0.101587301587302*G0_1_1 + 0.158024691358025*G0_2_0 + 0.0790123456790126*G0_2_1;
+    A[153] = -0.0225749559082892*G0_1_0 - 0.0225749559082893*G0_1_1 - 0.0112874779541444*G0_1_2 - 0.0112874779541446*G0_2_0 - 0.0112874779541446*G0_2_1;
+    A[154] = -0.0169312169312168*G0_1_0 - 0.0169312169312168*G0_1_1 - 0.00282186948853633*G0_1_2 - 0.00282186948853641*G0_2_0 - 0.00282186948853637*G0_2_1;
+    A[155] = -0.0451499118165788*G0_1_0 - 0.0451499118165789*G0_1_1 - 0.0112874779541447*G0_1_2 - 0.0112874779541445*G0_2_0 - 0.0112874779541446*G0_2_1;
+    A[156] = -0.0338624338624339*G0_1_0 - 0.022574955908289*G0_1_1 - 0.0338624338624339*G0_1_2 - 0.0451499118165787*G0_2_0 - 0.033862433862434*G0_2_1 - 0.0451499118165787*G0_2_2;
+    A[157] = 0.0592592592592594*G0_1_0 + 0.0169312169312167*G0_1_1 + 0.0592592592592594*G0_1_2 + 0.0902998236331577*G0_2_0 + 0.0592592592592596*G0_2_1 + 0.0902998236331577*G0_2_2;
+    A[158] = -0.0790123456790126*G0_1_0 + 0.0225749559082893*G0_1_1 - 0.0790123456790126*G0_1_2 - 0.158024691358026*G0_2_0 - 0.079012345679013*G0_2_1 - 0.158024691358026*G0_2_2;
+    A[159] = -0.0112874779541448*G0_1_1 - 0.0112874779541448*G0_1_2 - 0.0112874779541447*G0_2_1 - 0.0112874779541447*G0_2_2;
+    A[160] = -0.00282186948853621*G0_1_1 - 0.00282186948853615*G0_1_2 - 0.00282186948853615*G0_2_1 - 0.00282186948853608*G0_2_2;
+    A[161] = -0.0112874779541446*G0_1_1 - 0.0112874779541446*G0_1_2 - 0.0112874779541447*G0_2_1 - 0.0112874779541447*G0_2_2;
+    A[162] = -0.0677248677248677*G0_1_0 + 0.0225749559082892*G0_1_1 - 0.0338624338624341*G0_1_2 - 0.0225749559082894*G0_2_0 + 0.0112874779541446*G0_2_1 - 0.0225749559082894*G0_2_2;
+    A[163] = 0.203174603174603*G0_1_0 - 0.0677248677248675*G0_1_1 + 0.101587301587302*G0_1_2 + 0.112874779541446*G0_2_0 + 0.0112874779541444*G0_2_1 + 0.112874779541446*G0_2_2;
+    A[164] = -0.0677248677248675*G0_1_0 + 0.0677248677248678*G0_1_1 - 0.0338624338624338*G0_1_2 - 0.0225749559082896*G0_2_0 + 0.0112874779541444*G0_2_1 - 0.0225749559082895*G0_2_2;
+    A[165] = 0.0677248677248676*G0_1_0 + 0.0902998236331568*G0_1_1 + 0.0338624338624338*G0_1_2 + 0.0225749559082888*G0_2_0 + 0.0338624338624339*G0_2_1;
+    A[166] = -0.203174603174603*G0_1_0 - 0.270899470899471*G0_1_1 - 0.101587301587302*G0_1_2 - 0.112874779541446*G0_2_0 - 0.101587301587302*G0_2_1;
+    A[167] = 0.0677248677248677*G0_1_0 + 0.135449735449736*G0_1_1 + 0.0338624338624338*G0_1_2 + 0.0225749559082897*G0_2_0 + 0.0338624338624343*G0_2_1;
+    A[168] = -0.0225749559082893*G0_1_1 - 0.0112874779541444*G0_1_2 - 0.0112874779541452*G0_2_1;
+    A[169] = -0.0225749559082893*G0_1_1 - 0.0112874779541447*G0_1_2 - 0.0112874779541447*G0_2_1;
+    A[170] = -0.0677248677248678*G0_1_1 - 0.0112874779541447*G0_1_2 - 0.0112874779541445*G0_2_1;
+    A[171] = 0.0451499118165788*G0_1_1 + 0.0338624338624339*G0_1_2 + 0.0338624338624341*G0_2_1 + 0.022574955908289*G0_2_2;
+    A[172] = 0.0451499118165786*G0_1_1 + 0.0338624338624339*G0_1_2 + 0.0338624338624339*G0_2_1 + 0.022574955908289*G0_2_2;
+    A[173] = -0.135449735449736*G0_1_1 - 0.101587301587302*G0_1_2 - 0.101587301587302*G0_2_1 - 0.112874779541446*G0_2_2;
+    A[174] = 0.0902998236331569*G0_1_1;
+    A[175] = 0.00511463844797182*G0_1_0 + 0.00511463844797182*G0_1_1 + 0.00511463844797184*G0_1_2 + 0.00511463844797174*G0_2_0 + 0.00511463844797177*G0_2_1 + 0.00511463844797177*G0_2_2;
+    A[176] = -0.00511463844797175*G0_1_0 - 0.00511463844797182*G0_2_0;
+    A[177] = 0.0202821869488536*G0_1_1 - 0.0326278659611996*G0_2_1;
+    A[178] = -0.0326278659611996*G0_1_2 + 0.0202821869488537*G0_2_2;
+    A[179] = -0.118518518518519*G0_1_1 - 0.0310405643738979*G0_1_2 + 0.0423280423280421*G0_2_1 - 0.0902998236331577*G0_2_2;
+    A[180] = 0.249735449735451*G0_1_1 + 0.0825396825396829*G0_1_2 + 0.0825396825396829*G0_2_1 + 0.249735449735451*G0_2_2;
+    A[181] = -0.0902998236331578*G0_1_1 + 0.0423280423280421*G0_1_2 - 0.0310405643738977*G0_2_1 - 0.118518518518519*G0_2_2;
+    A[182] = 0.0169312169312167*G0_1_0 + 0.00282186948853615*G0_1_2 + 0.0141093474426809*G0_2_0 + 0.00282186948853596*G0_2_2;
+    A[183] = -0.0211640211640206*G0_1_0 - 0.0105820105820106*G0_1_2 - 0.0105820105820106*G0_2_0 - 0.0134038800705465*G0_2_2;
+    A[184] = -0.0902998236331577*G0_1_0 - 0.0592592592592593*G0_1_2 - 0.0310405643738977*G0_2_0 - 0.0423280423280424*G0_2_2;
+    A[185] = 0.0141093474426808*G0_1_0 + 0.00282186948853617*G0_1_1 + 0.0169312169312166*G0_2_0 + 0.002821869488536*G0_2_1;
+    A[186] = -0.0105820105820105*G0_1_0 - 0.0134038800705467*G0_1_1 - 0.0211640211640206*G0_2_0 - 0.0105820105820105*G0_2_1;
+    A[187] = -0.031040564373898*G0_1_0 - 0.0423280423280424*G0_1_1 - 0.0902998236331577*G0_2_0 - 0.0592592592592593*G0_2_1;
+    A[188] = -0.0169312169312169*G0_1_0 - 0.0169312169312169*G0_1_1 - 0.0141093474426809*G0_1_2 - 0.0141093474426808*G0_2_0 - 0.0141093474426809*G0_2_1 - 0.0112874779541446*G0_2_2;
+    A[189] = 0.0211640211640209*G0_1_0 + 0.0211640211640209*G0_1_1 + 0.0105820105820105*G0_1_2 + 0.0105820105820109*G0_2_0 + 0.010582010582011*G0_2_1 - 0.00282186948853612*G0_2_2;
+    A[190] = 0.0902998236331577*G0_1_0 + 0.0902998236331578*G0_1_1 + 0.0310405643738981*G0_1_2 + 0.0310405643738977*G0_2_0 + 0.0310405643738977*G0_2_1 - 0.0112874779541447*G0_2_2;
+    A[191] = -0.0141093474426808*G0_1_0 - 0.0112874779541447*G0_1_1 - 0.0141093474426808*G0_1_2 - 0.0169312169312168*G0_2_0 - 0.0141093474426806*G0_2_1 - 0.0169312169312168*G0_2_2;
+    A[192] = 0.0105820105820105*G0_1_0 - 0.0028218694885361*G0_1_1 + 0.0105820105820105*G0_1_2 + 0.0211640211640205*G0_2_0 + 0.0105820105820101*G0_2_1 + 0.0211640211640206*G0_2_2;
+    A[193] = 0.0310405643738979*G0_1_0 - 0.0112874779541446*G0_1_1 + 0.0310405643738979*G0_1_2 + 0.0902998236331577*G0_2_0 + 0.0310405643738983*G0_2_1 + 0.0902998236331577*G0_2_2;
+    A[194] = -0.00282186948853615*G0_1_1 - 0.00282186948853612*G0_1_2 - 0.00282186948853622*G0_2_1 - 0.00282186948853618*G0_2_2;
+    A[195] = -0.00917107583774254*G0_1_1 - 0.00917107583774254*G0_1_2 - 0.00917107583774259*G0_2_1 - 0.00917107583774262*G0_2_2;
+    A[196] = -0.00282186948853617*G0_1_1 - 0.0028218694885362*G0_1_2 - 0.002821869488536*G0_2_1 - 0.00282186948853601*G0_2_2;
+    A[197] = -0.0846560846560849*G0_1_0 - 0.0169312169312168*G0_1_1 - 0.019753086419753*G0_1_2 - 0.0846560846560847*G0_2_0 - 0.019753086419753*G0_2_1 - 0.016931216931217*G0_2_2;
+    A[198] = 0.050793650793651*G0_1_0 + 0.118518518518518*G0_1_1 - 0.0423280423280426*G0_1_2 + 0.186243386243387*G0_2_0 + 0.0931216931216937*G0_2_1 - 0.0846560846560845*G0_2_2;
+    A[199] = 0.186243386243386*G0_1_0 - 0.0846560846560847*G0_1_1 + 0.0931216931216931*G0_1_2 + 0.0507936507936512*G0_2_0 - 0.0423280423280424*G0_2_1 + 0.118518518518519*G0_2_2;
+    A[200] = 0.0846560846560849*G0_1_0 + 0.0677248677248681*G0_1_1 + 0.0649029982363317*G0_1_2 + 0.0846560846560853*G0_2_0 + 0.0649029982363317*G0_2_1 + 0.0677248677248682*G0_2_2;
+    A[201] = -0.050793650793651*G0_1_0 + 0.0677248677248675*G0_1_1 - 0.0931216931216935*G0_1_2 - 0.186243386243387*G0_2_0 - 0.093121693121693*G0_2_1 - 0.270899470899471*G0_2_2;
+    A[202] = -0.186243386243386*G0_1_0 - 0.270899470899471*G0_1_1 - 0.093121693121693*G0_1_2 - 0.0507936507936511*G0_2_0 - 0.0931216931216939*G0_2_1 + 0.0677248677248673*G0_2_2;
+    A[203] = 0.0169312169312173*G0_1_1 + 0.0197530864197532*G0_1_2 + 0.0197530864197541*G0_2_1 + 0.02257495590829*G0_2_2;
+    A[204] = 0.0169312169312169*G0_1_1 + 0.0197530864197532*G0_1_2 + 0.019753086419753*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[205] = 0.0846560846560847*G0_1_1 + 0.0423280423280422*G0_1_2 + 0.0423280423280424*G0_2_1 + 0.0225749559082886*G0_2_2;
+    A[206] = 0.0225749559082893*G0_1_1 + 0.0197530864197532*G0_1_2 + 0.0197530864197531*G0_2_1 + 0.0169312169312173*G0_2_2;
+    A[207] = 0.0225749559082893*G0_1_1 + 0.0197530864197531*G0_1_2 + 0.0197530864197531*G0_2_1 + 0.0169312169312171*G0_2_2;
+    A[208] = 0.0225749559082892*G0_1_1 + 0.0423280423280424*G0_1_2 + 0.0423280423280425*G0_2_1 + 0.0846560846560843*G0_2_2;
+    A[209] = -0.135449735449736*G0_1_1 - 0.112874779541446*G0_1_2 - 0.112874779541448*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[210] = 0.00776014109347439*G0_1_0 + 0.00776014109347441*G0_1_1 + 0.00776014109347439*G0_1_2 + 0.00776014109347442*G0_2_0 + 0.00776014109347441*G0_2_1 + 0.00776014109347438*G0_2_2;
+    A[211] = -0.00776014109347443*G0_1_0 - 0.00776014109347433*G0_2_0;
+    A[212] = -0.00776014109347458*G0_1_1 + 0.0176366843033509*G0_2_1;
+    A[213] = 0.045855379188713*G0_1_2 - 0.0246913580246914*G0_2_2;
+    A[214] = 0.0451499118165789*G0_1_1 + 0.0112874779541446*G0_1_2 - 0.0338624338624337*G0_2_1 + 0.0451499118165786*G0_2_2;
+    A[215] = -0.0902998236331578*G0_1_1 - 0.0310405643738977*G0_1_2 + 0.0423280423280421*G0_2_1 - 0.118518518518519*G0_2_2;
+    A[216] = 0.158024691358026*G0_1_1 + 0.0790123456790127*G0_1_2 + 0.0790123456790127*G0_2_1 + 0.203174603174603*G0_2_2;
+    A[217] = 0.0451499118165789*G0_1_0 + 0.0112874779541448*G0_1_2 + 0.033862433862434*G0_2_0 + 0.011287477954145*G0_2_2;
+    A[218] = -0.0902998236331579*G0_1_0 - 0.031040564373898*G0_1_2 - 0.0592592592592595*G0_2_0 - 0.0423280423280428*G0_2_2;
+    A[219] = 0.158024691358026*G0_1_0 + 0.0790123456790127*G0_1_2 + 0.0790123456790127*G0_2_0 + 0.101587301587302*G0_2_2;
+    A[220] = 0.0112874779541447*G0_1_0 + 0.0112874779541448*G0_1_1 + 0.0225749559082894*G0_2_0 + 0.0112874779541449*G0_2_1;
+    A[221] = 0.00282186948853624*G0_1_0 + 0.00282186948853603*G0_1_1 + 0.0169312169312168*G0_2_0 + 0.0141093474426806*G0_2_1;
+    A[222] = 0.0112874779541446*G0_1_0 + 0.0112874779541448*G0_1_1 + 0.0451499118165785*G0_2_0 + 0.033862433862434*G0_2_1;
+    A[223] = -0.0451499118165788*G0_1_0 - 0.0451499118165788*G0_1_1 - 0.0338624338624338*G0_1_2 - 0.033862433862434*G0_2_0 - 0.0338624338624339*G0_2_1 - 0.0225749559082891*G0_2_2;
+    A[224] = 0.0902998236331578*G0_1_0 + 0.090299823633158*G0_1_1 + 0.0592592592592595*G0_1_2 + 0.0592592592592594*G0_2_0 + 0.0592592592592595*G0_2_1 + 0.0169312169312168*G0_2_2;
+    A[225] = -0.158024691358026*G0_1_0 - 0.158024691358026*G0_1_1 - 0.079012345679013*G0_1_2 - 0.0790123456790127*G0_2_0 - 0.0790123456790127*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[226] = -0.0112874779541448*G0_1_0 - 0.0112874779541447*G0_1_2 - 0.0225749559082894*G0_2_0 - 0.0112874779541446*G0_2_1 - 0.0225749559082893*G0_2_2;
+    A[227] = -0.00282186948853619*G0_1_0 - 0.00282186948853617*G0_1_2 - 0.0169312169312168*G0_2_0 - 0.00282186948853612*G0_2_1 - 0.0169312169312168*G0_2_2;
+    A[228] = -0.0112874779541446*G0_1_0 - 0.0112874779541446*G0_1_2 - 0.0451499118165786*G0_2_0 - 0.0112874779541446*G0_2_1 - 0.0451499118165786*G0_2_2;
+    A[229] = -0.0112874779541449*G0_1_1 - 0.0112874779541449*G0_1_2 - 0.0112874779541448*G0_2_1 - 0.0112874779541448*G0_2_2;
+    A[230] = -0.00282186948853618*G0_1_1 - 0.0028218694885362*G0_1_2 - 0.00282186948853617*G0_2_1 - 0.00282186948853618*G0_2_2;
+    A[231] = -0.0112874779541448*G0_1_1 - 0.0112874779541448*G0_1_2 - 0.0112874779541449*G0_2_1 - 0.0112874779541449*G0_2_2;
+    A[232] = -0.0225749559082894*G0_1_0 - 0.0225749559082893*G0_1_1 + 0.0112874779541447*G0_1_2 - 0.067724867724868*G0_2_0 - 0.0338624338624339*G0_2_1 + 0.0225749559082895*G0_2_2;
+    A[233] = -0.022574955908289*G0_1_0 - 0.0225749559082891*G0_1_1 + 0.011287477954145*G0_1_2 - 0.0677248677248676*G0_2_0 - 0.0338624338624341*G0_2_1 + 0.0677248677248678*G0_2_2;
+    A[234] = 0.112874779541446*G0_1_0 + 0.112874779541446*G0_1_1 + 0.0112874779541445*G0_1_2 + 0.203174603174603*G0_2_0 + 0.101587301587302*G0_2_1 - 0.0677248677248681*G0_2_2;
+    A[235] = 0.0225749559082896*G0_1_0 + 0.0338624338624344*G0_1_2 + 0.0677248677248677*G0_2_0 + 0.0338624338624339*G0_2_1 + 0.0902998236331572*G0_2_2;
+    A[236] = 0.022574955908289*G0_1_0 + 0.0338624338624339*G0_1_2 + 0.0677248677248676*G0_2_0 + 0.0338624338624337*G0_2_1 + 0.135449735449735*G0_2_2;
+    A[237] = -0.112874779541446*G0_1_0 - 0.101587301587302*G0_1_2 - 0.203174603174603*G0_2_0 - 0.101587301587301*G0_2_1 - 0.270899470899471*G0_2_2;
+    A[238] = 0.0225749559082895*G0_1_1 + 0.0338624338624345*G0_1_2 + 0.0338624338624337*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[239] = 0.0225749559082892*G0_1_1 + 0.0338624338624341*G0_1_2 + 0.0338624338624338*G0_2_1 + 0.0451499118165789*G0_2_2;
+    A[240] = -0.112874779541446*G0_1_1 - 0.101587301587302*G0_1_2 - 0.101587301587302*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[241] = -0.0112874779541448*G0_1_2 - 0.0112874779541446*G0_2_1 - 0.0225749559082896*G0_2_2;
+    A[242] = -0.0112874779541449*G0_1_2 - 0.0112874779541445*G0_2_1 - 0.0225749559082897*G0_2_2;
+    A[243] = -0.0112874779541449*G0_1_2 - 0.0112874779541447*G0_2_1 - 0.0677248677248677*G0_2_2;
+    A[244] = 0.0902998236331576*G0_2_2;
+    A[245] = 0.00776014109347427*G0_0_0 + 0.0077601410934743*G0_0_1 + 0.00776014109347429*G0_0_2 + 0.00776014109347443*G0_2_0 + 0.00776014109347443*G0_2_1 + 0.00776014109347443*G0_2_2;
+    A[246] = -0.0246913580246914*G0_0_0 + 0.0458553791887129*G0_2_0;
+    A[247] = -0.00776014109347446*G0_0_1 - 0.00776014109347441*G0_2_1;
+    A[248] = 0.0176366843033511*G0_0_2 - 0.00776014109347452*G0_2_2;
+    A[249] = 0.0225749559082894*G0_0_1 + 0.0112874779541446*G0_0_2 + 0.0112874779541447*G0_2_1 + 0.0112874779541448*G0_2_2;
+    A[250] = 0.0169312169312167*G0_0_1 + 0.0141093474426809*G0_0_2 + 0.00282186948853615*G0_2_1 + 0.00282186948853596*G0_2_2;
+    A[251] = 0.0451499118165789*G0_0_1 + 0.033862433862434*G0_0_2 + 0.0112874779541448*G0_2_1 + 0.011287477954145*G0_2_2;
+    A[252] = 0.203174603174603*G0_0_0 + 0.0790123456790124*G0_0_2 + 0.0790123456790124*G0_2_0 + 0.158024691358026*G0_2_2;
+    A[253] = -0.118518518518519*G0_0_0 + 0.0423280423280422*G0_0_2 - 0.0310405643738979*G0_2_0 - 0.0902998236331578*G0_2_2;
+    A[254] = 0.0451499118165789*G0_0_0 - 0.0338624338624337*G0_0_2 + 0.0112874779541448*G0_2_0 + 0.045149911816579*G0_2_2;
+    A[255] = 0.101587301587302*G0_0_0 + 0.0790123456790125*G0_0_1 + 0.0790123456790126*G0_2_0 + 0.158024691358026*G0_2_1;
+    A[256] = -0.0423280423280425*G0_0_0 - 0.0592592592592595*G0_0_1 - 0.0310405643738979*G0_2_0 - 0.0902998236331577*G0_2_1;
+    A[257] = 0.0112874779541446*G0_0_0 + 0.033862433862434*G0_0_1 + 0.0112874779541448*G0_2_0 + 0.0451499118165788*G0_2_1;
+    A[258] = -0.0225749559082893*G0_0_0 - 0.0225749559082893*G0_0_1 - 0.0112874779541443*G0_0_2 - 0.0112874779541445*G0_2_0 - 0.0112874779541445*G0_2_1;
+    A[259] = -0.0169312169312165*G0_0_0 - 0.0169312169312164*G0_0_1 - 0.00282186948853633*G0_0_2 - 0.00282186948853623*G0_2_0 - 0.00282186948853618*G0_2_1;
+    A[260] = -0.0451499118165789*G0_0_0 - 0.0451499118165789*G0_0_1 - 0.0112874779541447*G0_0_2 - 0.0112874779541448*G0_2_0 - 0.0112874779541448*G0_2_1;
+    A[261] = -0.0112874779541447*G0_0_0 - 0.0112874779541446*G0_0_2 - 0.0112874779541446*G0_2_0 - 0.0112874779541446*G0_2_2;
+    A[262] = -0.00282186948853622*G0_0_0 - 0.00282186948853616*G0_0_2 - 0.00282186948853608*G0_2_0 - 0.00282186948853603*G0_2_2;
+    A[263] = -0.0112874779541446*G0_0_0 - 0.0112874779541447*G0_0_2 - 0.0112874779541448*G0_2_0 - 0.0112874779541448*G0_2_2;
+    A[264] = -0.022574955908289*G0_0_0 - 0.033862433862434*G0_0_1 - 0.0338624338624339*G0_0_2 - 0.0338624338624339*G0_2_0 - 0.0451499118165786*G0_2_1 - 0.0451499118165786*G0_2_2;
+    A[265] = 0.0169312169312167*G0_0_0 + 0.059259259259259*G0_0_1 + 0.059259259259259*G0_0_2 + 0.0592592592592595*G0_2_0 + 0.0902998236331574*G0_2_1 + 0.0902998236331573*G0_2_2;
+    A[266] = 0.0225749559082893*G0_0_0 - 0.0790123456790124*G0_0_1 - 0.0790123456790124*G0_0_2 - 0.0790123456790129*G0_2_0 - 0.158024691358026*G0_2_1 - 0.158024691358026*G0_2_2;
+    A[267] = -0.0677248677248682*G0_0_0 + 0.203174603174603*G0_0_1 + 0.101587301587301*G0_0_2 + 0.0112874779541444*G0_2_0 + 0.112874779541446*G0_2_1 + 0.112874779541446*G0_2_2;
+    A[268] = 0.0225749559082894*G0_0_0 - 0.0677248677248678*G0_0_1 - 0.0338624338624338*G0_0_2 + 0.0112874779541446*G0_2_0 - 0.0225749559082894*G0_2_1 - 0.0225749559082892*G0_2_2;
+    A[269] = 0.0677248677248677*G0_0_0 - 0.067724867724868*G0_0_1 - 0.0338624338624342*G0_0_2 + 0.0112874779541451*G0_2_0 - 0.022574955908289*G0_2_1 - 0.0225749559082892*G0_2_2;
+    A[270] = -0.0225749559082891*G0_0_0 - 0.0112874779541443*G0_0_2 - 0.0112874779541447*G0_2_0;
+    A[271] = -0.0225749559082895*G0_0_0 - 0.0112874779541447*G0_0_2 - 0.0112874779541447*G0_2_0;
+    A[272] = -0.0677248677248676*G0_0_0 - 0.0112874779541451*G0_0_2 - 0.011287477954145*G0_2_0;
+    A[273] = 0.0902998236331567*G0_0_0 + 0.0677248677248678*G0_0_1 + 0.0338624338624342*G0_0_2 + 0.0338624338624336*G0_2_0 + 0.022574955908289*G0_2_1;
+    A[274] = -0.270899470899471*G0_0_0 - 0.203174603174603*G0_0_1 - 0.101587301587301*G0_0_2 - 0.101587301587302*G0_2_0 - 0.112874779541446*G0_2_1;
+    A[275] = 0.135449735449736*G0_0_0 + 0.067724867724868*G0_0_1 + 0.0338624338624335*G0_0_2 + 0.0338624338624342*G0_2_0 + 0.022574955908289*G0_2_1;
+    A[276] = 0.0451499118165784*G0_0_0 + 0.0338624338624337*G0_0_2 + 0.0338624338624338*G0_2_0 + 0.0225749559082892*G0_2_2;
+    A[277] = -0.135449735449735*G0_0_0 - 0.101587301587301*G0_0_2 - 0.101587301587302*G0_2_0 - 0.112874779541446*G0_2_2;
+    A[278] = 0.0451499118165786*G0_0_0 + 0.0338624338624338*G0_0_2 + 0.033862433862434*G0_2_0 + 0.0225749559082893*G0_2_2;
+    A[279] = 0.0902998236331571*G0_0_0;
+    A[280] = 0.00511463844797186*G0_0_0 + 0.00511463844797183*G0_0_1 + 0.00511463844797185*G0_0_2 + 0.00511463844797174*G0_2_0 + 0.00511463844797174*G0_2_1 + 0.00511463844797177*G0_2_2;
+    A[281] = 0.0202821869488536*G0_0_0 - 0.0326278659611997*G0_2_0;
+    A[282] = -0.00511463844797169*G0_0_1 - 0.00511463844797175*G0_2_1;
+    A[283] = -0.0326278659611996*G0_0_2 + 0.0202821869488537*G0_2_2;
+    A[284] = 0.0169312169312166*G0_0_1 + 0.00282186948853615*G0_0_2 + 0.0141093474426807*G0_2_1 + 0.00282186948853593*G0_2_2;
+    A[285] = -0.0211640211640205*G0_0_1 - 0.0105820105820106*G0_0_2 - 0.0105820105820106*G0_2_1 - 0.0134038800705465*G0_2_2;
+    A[286] = -0.0902998236331579*G0_0_1 - 0.0592592592592595*G0_0_2 - 0.031040564373898*G0_2_1 - 0.0423280423280428*G0_2_2;
+    A[287] = -0.118518518518519*G0_0_0 - 0.0310405643738979*G0_0_2 + 0.0423280423280421*G0_2_0 - 0.0902998236331578*G0_2_2;
+    A[288] = 0.249735449735451*G0_0_0 + 0.0825396825396829*G0_0_2 + 0.0825396825396829*G0_2_0 + 0.249735449735451*G0_2_2;
+    A[289] = -0.0902998236331578*G0_0_0 + 0.0423280423280422*G0_0_2 - 0.0310405643738979*G0_2_0 - 0.118518518518519*G0_2_2;
+    A[290] = -0.0423280423280425*G0_0_0 - 0.0310405643738979*G0_0_1 - 0.0592592592592595*G0_2_0 - 0.0902998236331579*G0_2_1;
+    A[291] = -0.0134038800705468*G0_0_0 - 0.0105820105820104*G0_0_1 - 0.0105820105820106*G0_2_0 - 0.0211640211640206*G0_2_1;
+    A[292] = 0.00282186948853614*G0_0_0 + 0.0141093474426805*G0_0_1 + 0.00282186948853598*G0_2_0 + 0.0169312169312165*G0_2_1;
+    A[293] = -0.0169312169312168*G0_0_0 - 0.0169312169312167*G0_0_1 - 0.0141093474426808*G0_0_2 - 0.014109347442681*G0_2_0 - 0.0141093474426809*G0_2_1 - 0.0112874779541447*G0_2_2;
+    A[294] = 0.0211640211640205*G0_0_0 + 0.0211640211640204*G0_0_1 + 0.0105820105820104*G0_0_2 + 0.0105820105820109*G0_2_0 + 0.0105820105820108*G0_2_1 - 0.00282186948853586*G0_2_2;
+    A[295] = 0.0902998236331579*G0_0_0 + 0.0902998236331579*G0_0_1 + 0.0310405643738983*G0_0_2 + 0.031040564373898*G0_2_0 + 0.0310405643738979*G0_2_1 - 0.0112874779541449*G0_2_2;
+    A[296] = -0.00282186948853615*G0_0_0 - 0.00282186948853623*G0_0_2 - 0.00282186948853634*G0_2_0 - 0.00282186948853637*G0_2_2;
+    A[297] = -0.00917107583774225*G0_0_0 - 0.00917107583774232*G0_0_2 - 0.00917107583774249*G0_2_0 - 0.00917107583774253*G0_2_2;
+    A[298] = -0.00282186948853616*G0_0_0 - 0.0028218694885361*G0_0_2 - 0.00282186948853598*G0_2_0 - 0.00282186948853597*G0_2_2;
+    A[299] = -0.0112874779541448*G0_0_0 - 0.0141093474426807*G0_0_1 - 0.0141093474426808*G0_0_2 - 0.0141093474426807*G0_2_0 - 0.016931216931217*G0_2_1 - 0.016931216931217*G0_2_2;
+    A[300] = -0.00282186948853612*G0_0_0 + 0.0105820105820106*G0_0_1 + 0.0105820105820107*G0_0_2 + 0.0105820105820102*G0_2_0 + 0.0211640211640209*G0_2_1 + 0.0211640211640209*G0_2_2;
+    A[301] = -0.0112874779541446*G0_0_0 + 0.0310405643738979*G0_0_1 + 0.0310405643738979*G0_0_2 + 0.0310405643738983*G0_2_0 + 0.0902998236331578*G0_2_1 + 0.0902998236331578*G0_2_2;
+    A[302] = 0.118518518518519*G0_0_0 + 0.0507936507936509*G0_0_1 - 0.0423280423280424*G0_0_2 + 0.0931216931216933*G0_2_0 + 0.186243386243386*G0_2_1 - 0.084656084656085*G0_2_2;
+    A[303] = -0.0169312169312171*G0_0_0 - 0.0846560846560847*G0_0_1 - 0.0197530864197533*G0_0_2 - 0.0197530864197531*G0_2_0 - 0.0846560846560847*G0_2_1 - 0.0169312169312172*G0_2_2;
+    A[304] = -0.0846560846560844*G0_0_0 + 0.186243386243387*G0_0_1 + 0.0931216931216938*G0_0_2 - 0.0423280423280429*G0_2_0 + 0.0507936507936505*G0_2_1 + 0.118518518518519*G0_2_2;
+    A[305] = 0.0169312169312167*G0_0_0 + 0.0197530864197529*G0_0_2 + 0.0197530864197532*G0_2_0 + 0.0225749559082897*G0_2_2;
+    A[306] = 0.0169312169312171*G0_0_0 + 0.0197530864197528*G0_0_2 + 0.0197530864197531*G0_2_0 + 0.022574955908289*G0_2_2;
+    A[307] = 0.0846560846560844*G0_0_0 + 0.0423280423280429*G0_0_2 + 0.0423280423280429*G0_2_0 + 0.0225749559082896*G0_2_2;
+    A[308] = 0.0677248677248677*G0_0_0 + 0.0846560846560843*G0_0_1 + 0.0649029982363311*G0_0_2 + 0.0649029982363318*G0_2_0 + 0.0846560846560848*G0_2_1 + 0.067724867724868*G0_2_2;
+    A[309] = 0.0677248677248681*G0_0_0 - 0.0507936507936508*G0_0_1 - 0.0931216931216934*G0_0_2 - 0.093121693121693*G0_2_0 - 0.186243386243386*G0_2_1 - 0.270899470899472*G0_2_2;
+    A[310] = -0.270899470899471*G0_0_0 - 0.186243386243387*G0_0_1 - 0.0931216931216927*G0_0_2 - 0.0931216931216937*G0_2_0 - 0.0507936507936505*G0_2_1 + 0.067724867724868*G0_2_2;
+    A[311] = 0.0225749559082894*G0_0_0 + 0.0197530864197533*G0_0_2 + 0.0197530864197536*G0_2_0 + 0.0169312169312171*G0_2_2;
+    A[312] = 0.0225749559082892*G0_0_0 + 0.0423280423280425*G0_0_2 + 0.0423280423280423*G0_2_0 + 0.0846560846560851*G0_2_2;
+    A[313] = 0.0225749559082891*G0_0_0 + 0.0197530864197535*G0_0_2 + 0.0197530864197532*G0_2_0 + 0.0169312169312173*G0_2_2;
+    A[314] = -0.135449735449736*G0_0_0 - 0.112874779541447*G0_0_2 - 0.112874779541446*G0_2_0 - 0.135449735449736*G0_2_2;
+    A[315] = 0.00776014109347439*G0_0_0 + 0.00776014109347441*G0_0_1 + 0.00776014109347439*G0_0_2 + 0.00776014109347442*G0_2_0 + 0.00776014109347441*G0_2_1 + 0.00776014109347436*G0_2_2;
+    A[316] = -0.00776014109347442*G0_0_0 + 0.0176366843033512*G0_2_0;
+    A[317] = -0.00776014109347459*G0_0_1 - 0.00776014109347452*G0_2_1;
+    A[318] = 0.045855379188713*G0_0_2 - 0.0246913580246915*G0_2_2;
+    A[319] = 0.0451499118165789*G0_0_1 + 0.0112874779541446*G0_0_2 + 0.033862433862434*G0_2_1 + 0.0112874779541447*G0_2_2;
+    A[320] = -0.0902998236331577*G0_0_1 - 0.0310405643738977*G0_0_2 - 0.0592592592592593*G0_2_1 - 0.0423280423280424*G0_2_2;
+    A[321] = 0.158024691358026*G0_0_1 + 0.0790123456790127*G0_0_2 + 0.0790123456790127*G0_2_1 + 0.101587301587302*G0_2_2;
+    A[322] = 0.0451499118165789*G0_0_0 + 0.0112874779541448*G0_0_2 - 0.0338624338624337*G0_2_0 + 0.045149911816579*G0_2_2;
+    A[323] = -0.0902998236331578*G0_0_0 - 0.031040564373898*G0_0_2 + 0.0423280423280422*G0_2_0 - 0.118518518518519*G0_2_2;
+    A[324] = 0.158024691358026*G0_0_0 + 0.0790123456790127*G0_0_2 + 0.0790123456790127*G0_2_0 + 0.203174603174604*G0_2_2;
+    A[325] = 0.0112874779541447*G0_0_0 + 0.0112874779541448*G0_0_1 + 0.033862433862434*G0_2_0 + 0.0451499118165791*G0_2_1;
+    A[326] = 0.00282186948853622*G0_0_0 + 0.00282186948853601*G0_0_1 + 0.0141093474426808*G0_2_0 + 0.0169312169312166*G0_2_1;
+    A[327] = 0.0112874779541446*G0_0_0 + 0.0112874779541448*G0_0_1 + 0.0112874779541446*G0_2_0 + 0.0225749559082895*G0_2_1;
+    A[328] = -0.0451499118165788*G0_0_0 - 0.0451499118165788*G0_0_1 - 0.0338624338624338*G0_0_2 - 0.0338624338624338*G0_2_0 - 0.0338624338624338*G0_2_1 - 0.022574955908289*G0_2_2;
+    A[329] = 0.0902998236331578*G0_0_0 + 0.090299823633158*G0_0_1 + 0.0592592592592595*G0_0_2 + 0.0592592592592592*G0_2_0 + 0.0592592592592593*G0_2_1 + 0.0169312169312166*G0_2_2;
+    A[330] = -0.158024691358026*G0_0_0 - 0.158024691358026*G0_0_1 - 0.079012345679013*G0_0_2 - 0.0790123456790127*G0_2_0 - 0.0790123456790127*G0_2_1 + 0.0225749559082895*G0_2_2;
+    A[331] = -0.0112874779541448*G0_0_0 - 0.0112874779541447*G0_0_2 - 0.0112874779541446*G0_2_0 - 0.0112874779541446*G0_2_2;
+    A[332] = -0.00282186948853622*G0_0_0 - 0.0028218694885362*G0_0_2 - 0.00282186948853609*G0_2_0 - 0.00282186948853608*G0_2_2;
+    A[333] = -0.0112874779541446*G0_0_0 - 0.0112874779541446*G0_0_2 - 0.0112874779541446*G0_2_0 - 0.0112874779541447*G0_2_2;
+    A[334] = -0.0112874779541449*G0_0_1 - 0.0112874779541449*G0_0_2 - 0.0112874779541446*G0_2_0 - 0.0225749559082894*G0_2_1 - 0.0225749559082893*G0_2_2;
+    A[335] = -0.00282186948853616*G0_0_1 - 0.00282186948853618*G0_0_2 - 0.00282186948853601*G0_2_0 - 0.0169312169312168*G0_2_1 - 0.0169312169312168*G0_2_2;
+    A[336] = -0.0112874779541448*G0_0_1 - 0.0112874779541448*G0_0_2 - 0.0112874779541449*G0_2_0 - 0.0451499118165791*G0_2_1 - 0.045149911816579*G0_2_2;
+    A[337] = -0.0225749559082894*G0_0_0 - 0.0225749559082893*G0_0_1 + 0.0112874779541447*G0_0_2 - 0.033862433862434*G0_2_0 - 0.0677248677248678*G0_2_1 + 0.067724867724868*G0_2_2;
+    A[338] = -0.022574955908289*G0_0_0 - 0.0225749559082891*G0_0_1 + 0.011287477954145*G0_0_2 - 0.0338624338624338*G0_2_0 - 0.0677248677248677*G0_2_1 + 0.0225749559082894*G0_2_2;
+    A[339] = 0.112874779541446*G0_0_0 + 0.112874779541446*G0_0_1 + 0.0112874779541444*G0_0_2 + 0.101587301587302*G0_2_0 + 0.203174603174604*G0_2_1 - 0.0677248677248676*G0_2_2;
+    A[340] = 0.0225749559082896*G0_0_0 + 0.0338624338624344*G0_0_2 + 0.033862433862434*G0_2_0 + 0.0451499118165785*G0_2_2;
+    A[341] = 0.022574955908289*G0_0_0 + 0.0338624338624339*G0_0_2 + 0.0338624338624338*G0_2_0 + 0.0451499118165784*G0_2_2;
+    A[342] = -0.112874779541446*G0_0_0 - 0.101587301587302*G0_0_2 - 0.101587301587302*G0_2_0 - 0.135449735449736*G0_2_2;
+    A[343] = 0.0225749559082895*G0_0_1 + 0.0338624338624345*G0_0_2 + 0.0338624338624337*G0_2_0 + 0.0677248677248676*G0_2_1 + 0.090299823633157*G0_2_2;
+    A[344] = 0.0225749559082892*G0_0_1 + 0.0338624338624341*G0_0_2 + 0.0338624338624339*G0_2_0 + 0.0677248677248678*G0_2_1 + 0.135449735449736*G0_2_2;
+    A[345] = -0.112874779541446*G0_0_1 - 0.101587301587302*G0_0_2 - 0.101587301587301*G0_2_0 - 0.203174603174604*G0_2_1 - 0.270899470899472*G0_2_2;
+    A[346] = -0.0112874779541448*G0_0_2 - 0.0112874779541448*G0_2_0 - 0.0225749559082893*G0_2_2;
+    A[347] = -0.0112874779541448*G0_0_2 - 0.0112874779541446*G0_2_0 - 0.0677248677248681*G0_2_2;
+    A[348] = -0.0112874779541448*G0_0_2 - 0.0112874779541448*G0_2_0 - 0.0225749559082893*G0_2_2;
+    A[349] = 0.0902998236331568*G0_2_2;
+    A[350] = 0.00776014109347433*G0_0_0 + 0.00776014109347435*G0_0_1 + 0.00776014109347434*G0_0_2 + 0.00776014109347442*G0_1_0 + 0.00776014109347442*G0_1_1 + 0.00776014109347442*G0_1_2;
+    A[351] = -0.0246913580246913*G0_0_0 + 0.0458553791887129*G0_1_0;
+    A[352] = 0.0176366843033511*G0_0_1 - 0.00776014109347442*G0_1_1;
+    A[353] = -0.00776014109347448*G0_0_2 - 0.00776014109347453*G0_1_2;
+    A[354] = 0.0338624338624338*G0_0_1 + 0.0451499118165788*G0_0_2 + 0.0112874779541447*G0_1_1 + 0.0112874779541448*G0_1_2;
+    A[355] = 0.0141093474426808*G0_0_1 + 0.0169312169312166*G0_0_2 + 0.00282186948853617*G0_1_1 + 0.002821869488536*G0_1_2;
+    A[356] = 0.0112874779541447*G0_0_1 + 0.0225749559082894*G0_0_2 + 0.0112874779541448*G0_1_1 + 0.0112874779541449*G0_1_2;
+    A[357] = 0.101587301587302*G0_0_0 + 0.0790123456790126*G0_0_2 + 0.0790123456790125*G0_1_0 + 0.158024691358026*G0_1_2;
+    A[358] = -0.0423280423280425*G0_0_0 - 0.0592592592592595*G0_0_2 - 0.0310405643738979*G0_1_0 - 0.0902998236331578*G0_1_2;
+    A[359] = 0.0112874779541447*G0_0_0 + 0.033862433862434*G0_0_2 + 0.0112874779541448*G0_1_0 + 0.0451499118165791*G0_1_2;
+    A[360] = 0.203174603174603*G0_0_0 + 0.0790123456790126*G0_0_1 + 0.0790123456790126*G0_1_0 + 0.158024691358026*G0_1_1;
+    A[361] = -0.118518518518519*G0_0_0 + 0.042328042328042*G0_0_1 - 0.0310405643738979*G0_1_0 - 0.0902998236331578*G0_1_1;
+    A[362] = 0.0451499118165788*G0_0_0 - 0.0338624338624337*G0_0_1 + 0.0112874779541448*G0_1_0 + 0.0451499118165788*G0_1_1;
+    A[363] = -0.0112874779541446*G0_0_0 - 0.0112874779541446*G0_0_1 - 0.0112874779541446*G0_1_0 - 0.0112874779541446*G0_1_1;
+    A[364] = -0.00282186948853612*G0_0_0 - 0.00282186948853603*G0_0_1 - 0.00282186948853618*G0_1_0 - 0.00282186948853612*G0_1_1;
+    A[365] = -0.0112874779541446*G0_0_0 - 0.0112874779541447*G0_0_1 - 0.0112874779541448*G0_1_0 - 0.0112874779541448*G0_1_1;
+    A[366] = -0.0225749559082894*G0_0_0 - 0.0112874779541445*G0_0_1 - 0.0225749559082893*G0_0_2 - 0.0112874779541447*G0_1_0 - 0.0112874779541447*G0_1_2;
+    A[367] = -0.0169312169312167*G0_0_0 - 0.00282186948853614*G0_0_1 - 0.0169312169312166*G0_0_2 - 0.00282186948853603*G0_1_0 - 0.00282186948853599*G0_1_2;
+    A[368] = -0.0451499118165788*G0_0_0 - 0.0112874779541448*G0_0_1 - 0.0451499118165788*G0_0_2 - 0.0112874779541448*G0_1_0 - 0.0112874779541448*G0_1_2;
+    A[369] = -0.022574955908289*G0_0_0 - 0.0338624338624339*G0_0_1 - 0.0338624338624339*G0_0_2 - 0.0338624338624339*G0_1_0 - 0.0451499118165787*G0_1_1 - 0.0451499118165787*G0_1_2;
+    A[370] = 0.0169312169312168*G0_0_0 + 0.0592592592592591*G0_0_1 + 0.0592592592592592*G0_0_2 + 0.0592592592592595*G0_1_0 + 0.0902998236331574*G0_1_1 + 0.0902998236331574*G0_1_2;
+    A[371] = 0.0225749559082892*G0_0_0 - 0.0790123456790125*G0_0_1 - 0.0790123456790125*G0_0_2 - 0.079012345679013*G0_1_0 - 0.158024691358026*G0_1_1 - 0.158024691358026*G0_1_2;
+    A[372] = -0.067724867724868*G0_0_0 + 0.101587301587301*G0_0_1 + 0.203174603174603*G0_0_2 + 0.0112874779541444*G0_1_0 + 0.112874779541446*G0_1_1 + 0.112874779541446*G0_1_2;
+    A[373] = 0.0677248677248677*G0_0_0 - 0.0338624338624341*G0_0_1 - 0.0677248677248678*G0_0_2 + 0.0112874779541446*G0_1_0 - 0.0225749559082894*G0_1_1 - 0.0225749559082893*G0_1_2;
+    A[374] = 0.0225749559082892*G0_0_0 - 0.0338624338624341*G0_0_1 - 0.067724867724868*G0_0_2 + 0.011287477954145*G0_1_0 - 0.0225749559082891*G0_1_1 - 0.0225749559082892*G0_1_2;
+    A[375] = -0.0225749559082892*G0_0_0 - 0.0112874779541446*G0_0_1 - 0.0112874779541446*G0_1_0;
+    A[376] = -0.0677248677248677*G0_0_0 - 0.0112874779541447*G0_0_1 - 0.0112874779541447*G0_1_0;
+    A[377] = -0.0225749559082891*G0_0_0 - 0.0112874779541447*G0_0_1 - 0.011287477954145*G0_1_0;
+    A[378] = 0.0451499118165784*G0_0_0 + 0.0338624338624339*G0_0_1 + 0.0338624338624336*G0_1_0 + 0.022574955908289*G0_1_1;
+    A[379] = -0.135449735449735*G0_0_0 - 0.101587301587302*G0_0_1 - 0.101587301587302*G0_1_0 - 0.112874779541446*G0_1_1;
+    A[380] = 0.0451499118165786*G0_0_0 + 0.0338624338624341*G0_0_1 + 0.0338624338624341*G0_1_0 + 0.0225749559082891*G0_1_1;
+    A[381] = 0.0902998236331569*G0_0_0 + 0.0338624338624339*G0_0_1 + 0.0677248677248677*G0_0_2 + 0.0338624338624339*G0_1_0 + 0.0225749559082892*G0_1_2;
+    A[382] = -0.270899470899471*G0_0_0 - 0.101587301587301*G0_0_1 - 0.203174603174603*G0_0_2 - 0.101587301587302*G0_1_0 - 0.112874779541446*G0_1_2;
+    A[383] = 0.135449735449735*G0_0_0 + 0.0338624338624336*G0_0_1 + 0.0677248677248678*G0_0_2 + 0.0338624338624339*G0_1_0 + 0.0225749559082893*G0_1_2;
+    A[384] = 0.090299823633157*G0_0_0;
+    A[385] = 0.00511463844797172*G0_0_0 + 0.0051146384479717*G0_0_1 + 0.00511463844797168*G0_0_2 + 0.00511463844797175*G0_1_0 + 0.00511463844797174*G0_1_1 + 0.00511463844797172*G0_1_2;
+    A[386] = 0.0202821869488536*G0_0_0 - 0.0326278659611995*G0_1_0;
+    A[387] = -0.0326278659611996*G0_0_1 + 0.0202821869488536*G0_1_1;
+    A[388] = -0.00511463844797174*G0_0_2 - 0.00511463844797171*G0_1_2;
+    A[389] = -0.0592592592592594*G0_0_1 - 0.0902998236331578*G0_0_2 - 0.0423280423280426*G0_1_1 - 0.031040564373898*G0_1_2;
+    A[390] = -0.0105820105820105*G0_0_1 - 0.0211640211640206*G0_0_2 - 0.0134038800705467*G0_1_1 - 0.0105820105820105*G0_1_2;
+    A[391] = 0.00282186948853624*G0_0_1 + 0.0169312169312168*G0_0_2 + 0.00282186948853603*G0_1_1 + 0.0141093474426806*G0_1_2;
+    A[392] = -0.0423280423280425*G0_0_0 - 0.0310405643738979*G0_0_2 - 0.0592592592592595*G0_1_0 - 0.0902998236331577*G0_1_2;
+    A[393] = -0.0134038800705468*G0_0_0 - 0.0105820105820106*G0_0_2 - 0.0105820105820104*G0_1_0 - 0.0211640211640206*G0_1_2;
+    A[394] = 0.00282186948853622*G0_0_0 + 0.0141093474426808*G0_0_2 + 0.00282186948853601*G0_1_0 + 0.0169312169312166*G0_1_2;
+    A[395] = -0.118518518518519*G0_0_0 - 0.0310405643738979*G0_0_1 + 0.042328042328042*G0_1_0 - 0.0902998236331578*G0_1_1;
+    A[396] = 0.24973544973545*G0_0_0 + 0.0825396825396829*G0_0_1 + 0.0825396825396829*G0_1_0 + 0.24973544973545*G0_1_1;
+    A[397] = -0.0902998236331578*G0_0_0 + 0.0423280423280419*G0_0_1 - 0.031040564373898*G0_1_0 - 0.118518518518519*G0_1_1;
+    A[398] = -0.00282186948853619*G0_0_0 - 0.00282186948853608*G0_0_1 - 0.0028218694885362*G0_1_0 - 0.00282186948853612*G0_1_1;
+    A[399] = -0.0091710758377423*G0_0_0 - 0.00917107583774238*G0_0_1 - 0.00917107583774232*G0_1_0 - 0.0091710758377424*G0_1_1;
+    A[400] = -0.00282186948853626*G0_0_0 - 0.00282186948853622*G0_0_1 - 0.00282186948853605*G0_1_0 - 0.00282186948853601*G0_1_1;
+    A[401] = -0.0169312169312166*G0_0_0 - 0.0141093474426804*G0_0_1 - 0.0169312169312166*G0_0_2 - 0.0141093474426806*G0_1_0 - 0.0112874779541446*G0_1_1 - 0.0141093474426805*G0_1_2;
+    A[402] = 0.0211640211640205*G0_0_0 + 0.0105820105820101*G0_0_1 + 0.0211640211640204*G0_0_2 + 0.0105820105820103*G0_1_0 - 0.00282186948853616*G0_1_1 + 0.0105820105820102*G0_1_2;
+    A[403] = 0.0902998236331578*G0_0_0 + 0.0310405643738983*G0_0_1 + 0.0902998236331579*G0_0_2 + 0.031040564373898*G0_1_0 - 0.0112874779541445*G0_1_1 + 0.0310405643738981*G0_1_2;
+    A[404] = -0.0112874779541446*G0_0_0 - 0.0141093474426807*G0_0_1 - 0.0141093474426807*G0_0_2 - 0.0141093474426807*G0_1_0 - 0.0169312169312166*G0_1_1 - 0.0169312169312167*G0_1_2;
+    A[405] = -0.00282186948853615*G0_0_0 + 0.0105820105820105*G0_0_1 + 0.0105820105820105*G0_0_2 + 0.0105820105820103*G0_1_0 + 0.0211640211640207*G0_1_1 + 0.0211640211640207*G0_1_2;
+    A[406] = -0.0112874779541446*G0_0_0 + 0.0310405643738979*G0_0_1 + 0.0310405643738979*G0_0_2 + 0.0310405643738982*G0_1_0 + 0.0902998236331577*G0_1_1 + 0.0902998236331578*G0_1_2;
+    A[407] = 0.118518518518519*G0_0_0 - 0.0423280423280426*G0_0_1 + 0.0507936507936509*G0_0_2 + 0.0931216931216932*G0_1_0 - 0.084656084656085*G0_1_1 + 0.186243386243386*G0_1_2;
+    A[408] = -0.0846560846560848*G0_0_0 + 0.0931216931216935*G0_0_1 + 0.186243386243386*G0_0_2 - 0.0423280423280427*G0_1_0 + 0.118518518518519*G0_1_1 + 0.0507936507936506*G0_1_2;
+    A[409] = -0.0169312169312166*G0_0_0 - 0.0197530864197529*G0_0_1 - 0.0846560846560844*G0_0_2 - 0.0197530864197533*G0_1_0 - 0.016931216931217*G0_1_1 - 0.0846560846560847*G0_1_2;
+    A[410] = 0.0169312169312169*G0_0_0 + 0.0197530864197528*G0_0_1 + 0.0197530864197529*G0_1_0 + 0.0225749559082889*G0_1_1;
+    A[411] = 0.0846560846560848*G0_0_0 + 0.0423280423280428*G0_0_1 + 0.0423280423280427*G0_1_0 + 0.0225749559082899*G0_1_1;
+    A[412] = 0.0169312169312166*G0_0_0 + 0.0197530864197529*G0_0_1 + 0.0197530864197532*G0_1_0 + 0.0225749559082891*G0_1_1;
+    A[413] = 0.0225749559082892*G0_0_0 + 0.0197530864197531*G0_0_1 + 0.0197530864197533*G0_1_0 + 0.0169312169312169*G0_1_1;
+    A[414] = 0.0225749559082895*G0_0_0 + 0.0423280423280426*G0_0_1 + 0.0423280423280425*G0_1_0 + 0.084656084656085*G0_1_1;
+    A[415] = 0.0225749559082891*G0_0_0 + 0.0197530864197529*G0_0_1 + 0.0197530864197528*G0_1_0 + 0.016931216931217*G0_1_1;
+    A[416] = 0.0677248677248675*G0_0_0 + 0.0649029982363311*G0_0_1 + 0.0846560846560842*G0_0_2 + 0.0649029982363313*G0_1_0 + 0.0677248677248673*G0_1_1 + 0.0846560846560842*G0_1_2;
+    A[417] = 0.0677248677248679*G0_0_0 - 0.0931216931216933*G0_0_1 - 0.0507936507936508*G0_0_2 - 0.0931216931216928*G0_1_0 - 0.270899470899471*G0_1_1 - 0.186243386243386*G0_1_2;
+    A[418] = -0.270899470899471*G0_0_0 - 0.0931216931216925*G0_0_1 - 0.186243386243386*G0_0_2 - 0.0931216931216931*G0_1_0 + 0.0677248677248683*G0_1_1 - 0.0507936507936508*G0_1_2;
+    A[419] = -0.135449735449735*G0_0_0 - 0.112874779541447*G0_0_1 - 0.112874779541446*G0_1_0 - 0.135449735449736*G0_1_1;
+    A[420] = 0.00776014109347443*G0_0_0 + 0.00776014109347443*G0_0_1 + 0.00776014109347443*G0_0_2 + 0.00776014109347435*G0_1_0 + 0.00776014109347434*G0_1_1 + 0.00776014109347435*G0_1_2;
+    A[421] = -0.00776014109347445*G0_0_0 + 0.017636684303351*G0_1_0;
+    A[422] = 0.0458553791887128*G0_0_1 - 0.0246913580246914*G0_1_1;
+    A[423] = -0.00776014109347445*G0_0_2 - 0.00776014109347445*G0_1_2;
+    A[424] = 0.0790123456790126*G0_0_1 + 0.158024691358025*G0_0_2 + 0.101587301587302*G0_1_1 + 0.0790123456790126*G0_1_2;
+    A[425] = -0.031040564373898*G0_0_1 - 0.0902998236331577*G0_0_2 - 0.0423280423280424*G0_1_1 - 0.0592592592592593*G0_1_2;
+    A[426] = 0.0112874779541446*G0_0_1 + 0.0451499118165785*G0_0_2 + 0.0112874779541448*G0_1_1 + 0.033862433862434*G0_1_2;
+    A[427] = 0.0112874779541446*G0_0_0 + 0.0112874779541448*G0_0_2 + 0.033862433862434*G0_1_0 + 0.0451499118165788*G0_1_2;
+    A[428] = 0.00282186948853614*G0_0_0 + 0.00282186948853598*G0_0_2 + 0.0141093474426805*G0_1_0 + 0.0169312169312165*G0_1_2;
+    A[429] = 0.0112874779541446*G0_0_0 + 0.0112874779541446*G0_0_2 + 0.0112874779541448*G0_1_0 + 0.0225749559082895*G0_1_2;
+    A[430] = 0.0451499118165788*G0_0_0 + 0.0112874779541448*G0_0_1 - 0.0338624338624337*G0_1_0 + 0.0451499118165788*G0_1_1;
+    A[431] = -0.0902998236331578*G0_0_0 - 0.031040564373898*G0_0_1 + 0.0423280423280419*G0_1_0 - 0.118518518518519*G0_1_1;
+    A[432] = 0.158024691358025*G0_0_0 + 0.0790123456790126*G0_0_1 + 0.0790123456790126*G0_1_0 + 0.203174603174603*G0_1_1;
+    A[433] = -0.0112874779541445*G0_0_0 - 0.0112874779541446*G0_0_1 - 0.0112874779541445*G0_1_0 - 0.0112874779541446*G0_1_1;
+    A[434] = -0.00282186948853637*G0_0_0 - 0.00282186948853633*G0_0_1 - 0.00282186948853624*G0_1_0 - 0.00282186948853621*G0_1_1;
+    A[435] = -0.0112874779541445*G0_0_0 - 0.0112874779541446*G0_0_1 - 0.0112874779541448*G0_1_0 - 0.0112874779541448*G0_1_1;
+    A[436] = -0.0451499118165787*G0_0_0 - 0.033862433862434*G0_0_1 - 0.0451499118165787*G0_0_2 - 0.0338624338624338*G0_1_0 - 0.022574955908289*G0_1_1 - 0.0338624338624339*G0_1_2;
+    A[437] = 0.0902998236331576*G0_0_0 + 0.0592592592592596*G0_0_1 + 0.0902998236331576*G0_0_2 + 0.0592592592592594*G0_1_0 + 0.0169312169312167*G0_1_1 + 0.0592592592592594*G0_1_2;
+    A[438] = -0.158024691358026*G0_0_0 - 0.0790123456790129*G0_0_1 - 0.158024691358026*G0_0_2 - 0.0790123456790126*G0_1_0 + 0.0225749559082893*G0_1_1 - 0.0790123456790126*G0_1_2;
+    A[439] = -0.0112874779541447*G0_0_1 - 0.0112874779541447*G0_0_2 - 0.0112874779541446*G0_1_0 - 0.0225749559082894*G0_1_1 - 0.0225749559082894*G0_1_2;
+    A[440] = -0.00282186948853616*G0_0_1 - 0.00282186948853609*G0_0_2 - 0.00282186948853594*G0_1_0 - 0.0169312169312169*G0_1_1 - 0.0169312169312168*G0_1_2;
+    A[441] = -0.0112874779541447*G0_0_1 - 0.0112874779541447*G0_0_2 - 0.0112874779541448*G0_1_0 - 0.0451499118165788*G0_1_1 - 0.0451499118165788*G0_1_2;
+    A[442] = -0.0225749559082894*G0_0_0 + 0.0112874779541446*G0_0_1 - 0.0225749559082895*G0_0_2 - 0.0338624338624342*G0_1_0 + 0.0677248677248677*G0_1_1 - 0.0677248677248679*G0_1_2;
+    A[443] = 0.112874779541446*G0_0_0 + 0.0112874779541442*G0_0_1 + 0.112874779541446*G0_0_2 + 0.101587301587302*G0_1_0 - 0.0677248677248678*G0_1_1 + 0.203174603174603*G0_1_2;
+    A[444] = -0.0225749559082898*G0_0_0 + 0.0112874779541443*G0_0_1 - 0.0225749559082896*G0_0_2 - 0.0338624338624337*G0_1_0 + 0.0225749559082892*G0_1_1 - 0.0677248677248677*G0_1_2;
+    A[445] = 0.0225749559082887*G0_0_0 + 0.0338624338624339*G0_0_1 + 0.0338624338624337*G0_1_0 + 0.0451499118165784*G0_1_1;
+    A[446] = -0.112874779541446*G0_0_0 - 0.101587301587302*G0_0_1 - 0.101587301587302*G0_1_0 - 0.135449735449736*G0_1_1;
+    A[447] = 0.0225749559082899*G0_0_0 + 0.0338624338624343*G0_0_1 + 0.0338624338624338*G0_1_0 + 0.0451499118165786*G0_1_1;
+    A[448] = -0.0112874779541452*G0_0_1 - 0.0112874779541449*G0_1_0 - 0.0225749559082896*G0_1_1;
+    A[449] = -0.0112874779541447*G0_0_1 - 0.0112874779541445*G0_1_0 - 0.0677248677248677*G0_1_1;
+    A[450] = -0.0112874779541443*G0_0_1 - 0.0112874779541443*G0_1_0 - 0.0225749559082892*G0_1_1;
+    A[451] = 0.0338624338624341*G0_0_1 + 0.0225749559082891*G0_0_2 + 0.0338624338624337*G0_1_0 + 0.0902998236331571*G0_1_1 + 0.0677248677248675*G0_1_2;
+    A[452] = 0.033862433862434*G0_0_1 + 0.0225749559082891*G0_0_2 + 0.0338624338624338*G0_1_0 + 0.135449735449736*G0_1_1 + 0.0677248677248677*G0_1_2;
+    A[453] = -0.101587301587302*G0_0_1 - 0.112874779541446*G0_0_2 - 0.101587301587301*G0_1_0 - 0.270899470899471*G0_1_1 - 0.203174603174603*G0_1_2;
+    A[454] = 0.0902998236331575*G0_1_1;
+    A[455] = -0.0246913580246911*G0_0_0 - 0.0246913580246911*G0_0_1 - 0.0246913580246911*G0_0_2 - 0.0246913580246912*G0_1_0 - 0.0246913580246912*G0_1_1 - 0.0246913580246912*G0_1_2 - 0.0705467372134041*G0_2_0 - 0.0705467372134041*G0_2_1 - 0.0705467372134041*G0_2_2;
+    A[456] = 0.0077601410934745*G0_0_0 + 0.00776014109347449*G0_1_0;
+    A[457] = 0.00776014109347445*G0_0_1 + 0.00776014109347444*G0_1_1;
+    A[458] = -0.0176366843033511*G0_0_2 - 0.0176366843033511*G0_1_2 - 0.0253968253968255*G0_2_2;
+    A[459] = -0.0225749559082892*G0_0_1 - 0.0112874779541446*G0_0_2 - 0.0225749559082893*G0_1_1 - 0.0112874779541446*G0_1_2 - 0.0112874779541444*G0_2_1;
+    A[460] = -0.0169312169312169*G0_0_1 - 0.0141093474426808*G0_0_2 - 0.0169312169312169*G0_1_1 - 0.0141093474426809*G0_1_2 - 0.0141093474426809*G0_2_1 - 0.0112874779541447*G0_2_2;
+    A[461] = -0.0451499118165788*G0_0_1 - 0.033862433862434*G0_0_2 - 0.0451499118165788*G0_1_1 - 0.0338624338624339*G0_1_2 - 0.0338624338624339*G0_2_1 - 0.0225749559082891*G0_2_2;
+    A[462] = -0.0225749559082893*G0_0_0 - 0.0112874779541445*G0_0_2 - 0.0225749559082893*G0_1_0 - 0.0112874779541445*G0_1_2 - 0.0112874779541443*G0_2_0;
+    A[463] = -0.0169312169312168*G0_0_0 - 0.014109347442681*G0_0_2 - 0.0169312169312167*G0_1_0 - 0.0141093474426809*G0_1_2 - 0.0141093474426808*G0_2_0 - 0.0112874779541447*G0_2_2;
+    A[464] = -0.0451499118165788*G0_0_0 - 0.0338624338624338*G0_0_2 - 0.0451499118165788*G0_1_0 - 0.0338624338624338*G0_1_2 - 0.0338624338624339*G0_2_0 - 0.022574955908289*G0_2_2;
+    A[465] = -0.0112874779541446*G0_0_0 - 0.0112874779541446*G0_0_1 - 0.0112874779541446*G0_1_0 - 0.0112874779541446*G0_1_1;
+    A[466] = -0.00282186948853619*G0_0_0 - 0.00282186948853619*G0_0_1 - 0.00282186948853608*G0_1_0 - 0.00282186948853612*G0_1_1;
+    A[467] = -0.0112874779541445*G0_0_0 - 0.0112874779541445*G0_0_1 - 0.0112874779541446*G0_1_0 - 0.0112874779541446*G0_1_1;
+    A[468] = 0.203174603174603*G0_0_0 + 0.203174603174603*G0_0_1 + 0.12416225749559*G0_0_2 + 0.203174603174603*G0_1_0 + 0.203174603174603*G0_1_1 + 0.12416225749559*G0_1_2 + 0.12416225749559*G0_2_0 + 0.12416225749559*G0_2_1 + 0.203174603174603*G0_2_2;
+    A[469] = -0.118518518518519*G0_0_0 - 0.118518518518519*G0_0_1 - 0.16084656084656*G0_0_2 - 0.118518518518519*G0_1_0 - 0.118518518518519*G0_1_1 - 0.160846560846561*G0_1_2 - 0.0874779541446205*G0_2_0 - 0.0874779541446205*G0_2_1 - 0.22010582010582*G0_2_2;
+    A[470] = 0.0451499118165788*G0_0_0 + 0.0451499118165788*G0_0_1 + 0.0790123456790123*G0_0_2 + 0.0451499118165788*G0_1_0 + 0.0451499118165789*G0_1_1 + 0.0790123456790124*G0_1_2 + 0.0338624338624339*G0_2_0 + 0.0338624338624339*G0_2_1 + 0.112874779541446*G0_2_2;
+    A[471] = 0.101587301587302*G0_0_0 + 0.0225749559082888*G0_0_1 + 0.101587301587302*G0_0_2 + 0.101587301587302*G0_1_0 + 0.0225749559082888*G0_1_1 + 0.101587301587302*G0_1_2 + 0.0225749559082889*G0_2_0 + 0.101587301587302*G0_2_1 + 0.022574955908289*G0_2_2;
+    A[472] = -0.0423280423280423*G0_0_0 + 0.0169312169312174*G0_0_1 - 0.0423280423280422*G0_0_2 - 0.0423280423280423*G0_1_0 + 0.0169312169312173*G0_1_1 - 0.0423280423280423*G0_1_2 - 0.0112874779541445*G0_2_0 - 0.0423280423280426*G0_2_1 - 0.0112874779541445*G0_2_2;
+    A[473] = 0.0112874779541446*G0_0_0 - 0.0225749559082895*G0_0_1 + 0.0112874779541446*G0_0_2 + 0.0112874779541446*G0_1_0 - 0.0225749559082894*G0_1_1 + 0.0112874779541446*G0_1_2 + 0.0112874779541449*G0_2_1;
+    A[474] = 0.022574955908289*G0_0_0 + 0.101587301587302*G0_0_1 + 0.101587301587302*G0_0_2 + 0.022574955908289*G0_1_0 + 0.101587301587302*G0_1_1 + 0.101587301587302*G0_1_2 + 0.101587301587302*G0_2_0 + 0.0225749559082891*G0_2_1 + 0.0225749559082891*G0_2_2;
+    A[475] = 0.0169312169312171*G0_0_0 - 0.0423280423280423*G0_0_1 - 0.0423280423280423*G0_0_2 + 0.016931216931217*G0_1_0 - 0.0423280423280422*G0_1_1 - 0.0423280423280422*G0_1_2 - 0.0423280423280429*G0_2_0 - 0.0112874779541446*G0_2_1 - 0.0112874779541446*G0_2_2;
+    A[476] = -0.0225749559082894*G0_0_0 + 0.0112874779541445*G0_0_1 + 0.0112874779541445*G0_0_2 - 0.0225749559082894*G0_1_0 + 0.0112874779541445*G0_1_1 + 0.0112874779541445*G0_1_2 + 0.0112874779541449*G0_2_0;
+    A[477] = -0.0225749559082894*G0_0_0 - 0.0225749559082891*G0_0_1 - 0.0112874779541445*G0_0_2 - 0.0225749559082894*G0_1_0 - 0.0225749559082892*G0_1_1 - 0.0112874779541445*G0_1_2 - 0.011287477954145*G0_2_0 - 0.0112874779541443*G0_2_1;
+    A[478] = -0.0225749559082893*G0_0_0 - 0.0225749559082897*G0_0_1 - 0.0112874779541447*G0_0_2 - 0.0225749559082895*G0_1_0 - 0.0225749559082898*G0_1_1 - 0.0112874779541446*G0_1_2 - 0.0112874779541446*G0_2_0 - 0.0112874779541454*G0_2_1;
+    A[479] = -0.0677248677248681*G0_0_0 - 0.0677248677248678*G0_0_1 - 0.0564373897707236*G0_0_2 - 0.0677248677248681*G0_1_0 - 0.0677248677248678*G0_1_1 - 0.0564373897707236*G0_1_2 - 0.0564373897707237*G0_2_0 - 0.0564373897707236*G0_2_1 - 0.0451499118165797*G0_2_2;
+    A[480] = -0.0677248677248676*G0_0_0 - 0.270899470899471*G0_0_1 - 0.16931216931217*G0_0_2 - 0.0677248677248677*G0_1_0 - 0.270899470899471*G0_1_1 - 0.16931216931217*G0_1_2 - 0.0790123456790117*G0_2_0 - 0.169312169312169*G0_2_1 - 0.067724867724867*G0_2_2;
+    A[481] = 0.0225749559082893*G0_0_0 + 0.0902998236331568*G0_0_1 + 0.0564373897707232*G0_0_2 + 0.0225749559082895*G0_1_0 + 0.0902998236331569*G0_1_1 + 0.0564373897707233*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0564373897707225*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[482] = 0.067724867724868*G0_0_0 + 0.135449735449736*G0_0_1 + 0.101587301587302*G0_0_2 + 0.067724867724868*G0_1_0 + 0.135449735449736*G0_1_1 + 0.101587301587302*G0_1_2 + 0.0564373897707236*G0_2_0 + 0.101587301587301*G0_2_1 + 0.067724867724867*G0_2_2;
+    A[483] = -0.270899470899471*G0_0_0 - 0.0677248677248678*G0_0_1 - 0.16931216931217*G0_0_2 - 0.270899470899471*G0_1_0 - 0.0677248677248676*G0_1_1 - 0.16931216931217*G0_1_2 - 0.169312169312168*G0_2_0 - 0.0790123456790118*G0_2_1 - 0.0677248677248672*G0_2_2;
+    A[484] = 0.0902998236331569*G0_0_0 + 0.0225749559082894*G0_0_1 + 0.0564373897707234*G0_0_2 + 0.0902998236331567*G0_1_0 + 0.0225749559082894*G0_1_1 + 0.0564373897707232*G0_1_2 + 0.0564373897707224*G0_2_0 + 0.0112874779541444*G0_2_1 + 0.0225749559082894*G0_2_2;
+    A[485] = 0.135449735449736*G0_0_0 + 0.0677248677248679*G0_0_1 + 0.101587301587302*G0_0_2 + 0.135449735449736*G0_1_0 + 0.0677248677248679*G0_1_1 + 0.101587301587302*G0_1_2 + 0.101587301587301*G0_2_0 + 0.0564373897707237*G0_2_1 + 0.0677248677248671*G0_2_2;
+    A[486] = -0.135449735449736*G0_0_0 - 0.135449735449736*G0_0_1 - 0.0338624338624336*G0_0_2 - 0.135449735449735*G0_1_0 - 0.135449735449736*G0_1_1 - 0.0338624338624335*G0_1_2 - 0.0338624338624334*G0_2_0 - 0.0338624338624336*G0_2_1 - 0.0451499118165782*G0_2_2;
+    A[487] = 0.0451499118165785*G0_0_0 + 0.0451499118165786*G0_0_1 + 0.0112874779541446*G0_0_2 + 0.0451499118165783*G0_1_0 + 0.0451499118165784*G0_1_1 + 0.0112874779541446*G0_1_2 + 0.0112874779541441*G0_2_0 + 0.0112874779541447*G0_2_1;
+    A[488] = 0.0451499118165785*G0_0_0 + 0.0451499118165784*G0_0_1 + 0.0112874779541446*G0_0_2 + 0.0451499118165784*G0_1_0 + 0.0451499118165784*G0_1_1 + 0.0112874779541446*G0_1_2 + 0.0112874779541444*G0_2_0 + 0.0112874779541442*G0_2_1;
+    A[489] = 0.0902998236331572*G0_0_0 + 0.0902998236331573*G0_0_1 + 0.0902998236331572*G0_0_2 + 0.0902998236331572*G0_1_0 + 0.0902998236331571*G0_1_1 + 0.0902998236331571*G0_1_2 + 0.0902998236331568*G0_2_0 + 0.090299823633157*G0_2_1 + 0.0902998236331578*G0_2_2;
+    A[490] = 0.0202821869488535*G0_0_0 + 0.0202821869488535*G0_0_1 + 0.0202821869488535*G0_0_2 + 0.0202821869488535*G0_1_0 + 0.0202821869488535*G0_1_1 + 0.0202821869488535*G0_1_2 + 0.052910052910053*G0_2_0 + 0.052910052910053*G0_2_1 + 0.0529100529100531*G0_2_2;
+    A[491] = 0.00511463844797171*G0_0_0 + 0.0051146384479717*G0_1_0;
+    A[492] = 0.00511463844797169*G0_0_1 + 0.00511463844797171*G0_1_1;
+    A[493] = 0.0326278659611996*G0_0_2 + 0.0326278659611997*G0_1_2 + 0.0529100529100532*G0_2_2;
+    A[494] = -0.0169312169312168*G0_0_1 - 0.00282186948853641*G0_0_2 - 0.0169312169312168*G0_1_1 - 0.00282186948853637*G0_1_2 - 0.00282186948853633*G0_2_1;
+    A[495] = 0.0211640211640209*G0_0_1 + 0.0105820105820109*G0_0_2 + 0.0211640211640209*G0_1_1 + 0.010582010582011*G0_1_2 + 0.0105820105820105*G0_2_1 - 0.00282186948853612*G0_2_2;
+    A[496] = 0.0902998236331578*G0_0_1 + 0.0592592592592594*G0_0_2 + 0.090299823633158*G0_1_1 + 0.0592592592592595*G0_1_2 + 0.0592592592592595*G0_2_1 + 0.0169312169312168*G0_2_2;
+    A[497] = -0.0169312169312165*G0_0_0 - 0.00282186948853623*G0_0_2 - 0.0169312169312164*G0_1_0 - 0.00282186948853618*G0_1_2 - 0.00282186948853633*G0_2_0;
+    A[498] = 0.0211640211640205*G0_0_0 + 0.0105820105820108*G0_0_2 + 0.0211640211640204*G0_1_0 + 0.0105820105820108*G0_1_2 + 0.0105820105820104*G0_2_0 - 0.00282186948853586*G0_2_2;
+    A[499] = 0.0902998236331578*G0_0_0 + 0.0592592592592592*G0_0_2 + 0.090299823633158*G0_1_0 + 0.0592592592592593*G0_1_2 + 0.0592592592592595*G0_2_0 + 0.0169312169312166*G0_2_2;
+    A[500] = -0.00282186948853612*G0_0_0 - 0.00282186948853618*G0_0_1 - 0.00282186948853603*G0_1_0 - 0.00282186948853612*G0_1_1;
+    A[501] = -0.0091710758377423*G0_0_0 - 0.00917107583774232*G0_0_1 - 0.00917107583774238*G0_1_0 - 0.0091710758377424*G0_1_1;
+    A[502] = -0.00282186948853637*G0_0_0 - 0.00282186948853624*G0_0_1 - 0.00282186948853633*G0_1_0 - 0.00282186948853621*G0_1_1;
+    A[503] = -0.118518518518519*G0_0_0 - 0.118518518518519*G0_0_1 - 0.0874779541446205*G0_0_2 - 0.118518518518519*G0_1_0 - 0.118518518518519*G0_1_1 - 0.0874779541446205*G0_1_2 - 0.16084656084656*G0_2_0 - 0.160846560846561*G0_2_1 - 0.22010582010582*G0_2_2;
+    A[504] = 0.249735449735451*G0_0_0 + 0.249735449735451*G0_0_1 + 0.167195767195767*G0_0_2 + 0.249735449735451*G0_1_0 + 0.249735449735451*G0_1_1 + 0.167195767195767*G0_1_2 + 0.167195767195767*G0_2_0 + 0.167195767195767*G0_2_1 + 0.334391534391535*G0_2_2;
+    A[505] = -0.0902998236331578*G0_0_0 - 0.0902998236331579*G0_0_1 - 0.1326278659612*G0_0_2 - 0.0902998236331579*G0_1_0 - 0.090299823633158*G0_1_1 - 0.1326278659612*G0_1_2 - 0.0592592592592595*G0_2_0 - 0.0592592592592596*G0_2_1 - 0.22010582010582*G0_2_2;
+    A[506] = -0.0423280423280427*G0_0_0 - 0.0112874779541444*G0_0_1 - 0.0423280423280427*G0_0_2 - 0.0423280423280427*G0_1_0 - 0.0112874779541444*G0_1_1 - 0.0423280423280428*G0_1_2 + 0.0169312169312171*G0_2_0 - 0.0423280423280425*G0_2_1 + 0.0169312169312171*G0_2_2;
+    A[507] = -0.0134038800705467*G0_0_0 - 0.00282186948853641*G0_0_1 - 0.0134038800705467*G0_0_2 - 0.0134038800705468*G0_1_0 - 0.00282186948853637*G0_1_1 - 0.0134038800705468*G0_1_2 - 0.00282186948853613*G0_2_0 - 0.0134038800705466*G0_2_1 - 0.0028218694885361*G0_2_2;
+    A[508] = 0.00282186948853633*G0_0_0 - 0.0112874779541444*G0_0_1 + 0.00282186948853632*G0_0_2 + 0.00282186948853629*G0_1_0 - 0.0112874779541445*G0_1_1 + 0.00282186948853628*G0_1_2 + 0.00282186948853593*G0_2_1;
+    A[509] = -0.0112874779541445*G0_0_0 - 0.0423280423280428*G0_0_1 - 0.0423280423280428*G0_0_2 - 0.0112874779541445*G0_1_0 - 0.0423280423280428*G0_1_1 - 0.0423280423280428*G0_1_2 - 0.0423280423280427*G0_2_0 + 0.016931216931217*G0_2_1 + 0.016931216931217*G0_2_2;
+    A[510] = -0.00282186948853629*G0_0_0 - 0.0134038800705468*G0_0_1 - 0.0134038800705468*G0_0_2 - 0.00282186948853628*G0_1_0 - 0.0134038800705467*G0_1_1 - 0.0134038800705468*G0_1_2 - 0.0134038800705463*G0_2_0 - 0.00282186948853607*G0_2_1 - 0.00282186948853606*G0_2_2;
+    A[511] = -0.0112874779541444*G0_0_0 + 0.00282186948853618*G0_0_1 + 0.00282186948853619*G0_0_2 - 0.0112874779541445*G0_1_0 + 0.00282186948853613*G0_1_1 + 0.00282186948853614*G0_1_2 + 0.00282186948853591*G0_2_0;
+    A[512] = 0.0169312169312175*G0_0_0 + 0.0169312169312175*G0_0_1 - 0.0028218694885357*G0_0_2 + 0.0169312169312173*G0_1_0 + 0.0169312169312175*G0_1_1 - 0.00282186948853573*G0_1_2 - 0.00282186948853541*G0_2_0 - 0.00282186948853636*G0_2_1;
+    A[513] = 0.0169312169312172*G0_0_0 + 0.0169312169312176*G0_0_1 - 0.00282186948853591*G0_0_2 + 0.0169312169312174*G0_1_0 + 0.0169312169312177*G0_1_1 - 0.00282186948853583*G0_1_2 - 0.00282186948853611*G0_2_0 - 0.0028218694885351*G0_2_1;
+    A[514] = 0.0846560846560849*G0_0_0 + 0.0846560846560844*G0_0_1 + 0.0423280423280426*G0_0_2 + 0.0846560846560851*G0_1_0 + 0.0846560846560845*G0_1_1 + 0.0423280423280427*G0_1_2 + 0.042328042328043*G0_2_0 + 0.0423280423280428*G0_2_1 + 0.0225749559082906*G0_2_2;
+    A[515] = 0.118518518518519*G0_0_0 + 0.067724867724868*G0_0_1 + 0.160846560846562*G0_0_2 + 0.118518518518519*G0_1_0 + 0.0677248677248678*G0_1_1 + 0.160846560846562*G0_1_2 + 0.0253968253968248*G0_2_0 + 0.16084656084656*G0_2_1 - 0.0169312169312177*G0_2_2;
+    A[516] = -0.0169312169312172*G0_0_0 + 0.0677248677248678*G0_0_1 + 0.00282186948853585*G0_0_2 - 0.0169312169312174*G0_1_0 + 0.067724867724868*G0_1_1 + 0.0028218694885358*G0_1_2 + 0.0028218694885361*G0_2_0 + 0.00282186948853683*G0_2_1 + 0.00564373897707232*G0_2_2;
+    A[517] = -0.0846560846560849*G0_0_0 - 0.270899470899471*G0_0_1 - 0.177777777777779*G0_0_2 - 0.0846560846560851*G0_1_0 - 0.270899470899472*G0_1_1 - 0.177777777777779*G0_1_2 - 0.042328042328043*G0_2_0 - 0.177777777777778*G0_2_1 - 0.0169312169312162*G0_2_2;
+    A[518] = 0.0677248677248679*G0_0_0 + 0.118518518518519*G0_0_1 + 0.160846560846562*G0_0_2 + 0.0677248677248679*G0_1_0 + 0.118518518518519*G0_1_1 + 0.160846560846562*G0_1_2 + 0.16084656084656*G0_2_0 + 0.0253968253968248*G0_2_1 - 0.0169312169312175*G0_2_2;
+    A[519] = 0.0677248677248675*G0_0_0 - 0.0169312169312176*G0_0_1 + 0.00282186948853595*G0_0_2 + 0.0677248677248675*G0_1_0 - 0.0169312169312176*G0_1_1 + 0.00282186948853597*G0_1_2 + 0.00282186948853693*G0_2_0 + 0.0028218694885362*G0_2_1 + 0.00564373897707188*G0_2_2;
+    A[520] = -0.270899470899471*G0_0_0 - 0.0846560846560845*G0_0_1 - 0.177777777777778*G0_0_2 - 0.270899470899471*G0_1_0 - 0.0846560846560846*G0_1_1 - 0.177777777777779*G0_1_2 - 0.177777777777777*G0_2_0 - 0.0423280423280429*G0_2_1 - 0.016931216931216*G0_2_2;
+    A[521] = 0.0225749559082896*G0_0_0 + 0.0225749559082897*G0_0_1 - 0.0197530864197531*G0_0_2 + 0.0225749559082896*G0_1_0 + 0.0225749559082896*G0_1_1 - 0.0197530864197532*G0_1_2 - 0.0197530864197535*G0_2_0 - 0.0197530864197532*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[522] = 0.0225749559082893*G0_0_0 + 0.0225749559082891*G0_0_1 + 0.00282186948853563*G0_0_2 + 0.0225749559082892*G0_1_0 + 0.0225749559082892*G0_1_1 + 0.00282186948853566*G0_1_2 + 0.00282186948853655*G0_2_0 + 0.00282186948853578*G0_2_1;
+    A[523] = 0.0225749559082891*G0_0_0 + 0.0225749559082893*G0_0_1 + 0.002821869488536*G0_0_2 + 0.0225749559082892*G0_1_0 + 0.0225749559082894*G0_1_1 + 0.00282186948853593*G0_1_2 + 0.00282186948853608*G0_2_0 + 0.00282186948853646*G0_2_1;
+    A[524] = -0.135449735449737*G0_0_0 - 0.135449735449737*G0_0_1 - 0.0225749559082896*G0_0_2 - 0.135449735449737*G0_1_0 - 0.135449735449737*G0_1_1 - 0.0225749559082896*G0_1_2 - 0.0225749559082895*G0_2_0 - 0.0225749559082896*G0_2_1 - 0.0451499118165797*G0_2_2;
+    A[525] = -0.00776014109347439*G0_0_0 - 0.00776014109347441*G0_0_1 - 0.00776014109347438*G0_0_2 - 0.00776014109347439*G0_1_0 - 0.00776014109347442*G0_1_1 - 0.00776014109347439*G0_1_2 - 0.0253968253968254*G0_2_0 - 0.0253968253968254*G0_2_1 - 0.0253968253968254*G0_2_2;
+    A[526] = 0.00776014109347442*G0_0_0 + 0.00776014109347442*G0_1_0;
+    A[527] = 0.00776014109347457*G0_0_1 + 0.00776014109347458*G0_1_1;
+    A[528] = -0.045855379188713*G0_0_2 - 0.045855379188713*G0_1_2 - 0.0705467372134043*G0_2_2;
+    A[529] = -0.0451499118165788*G0_0_1 - 0.0112874779541445*G0_0_2 - 0.0451499118165789*G0_1_1 - 0.0112874779541446*G0_1_2 - 0.0112874779541447*G0_2_1;
+    A[530] = 0.0902998236331577*G0_0_1 + 0.0310405643738977*G0_0_2 + 0.0902998236331577*G0_1_1 + 0.0310405643738977*G0_1_2 + 0.0310405643738981*G0_2_1 - 0.0112874779541447*G0_2_2;
+    A[531] = -0.158024691358026*G0_0_1 - 0.0790123456790127*G0_0_2 - 0.158024691358026*G0_1_1 - 0.0790123456790127*G0_1_2 - 0.079012345679013*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[532] = -0.0451499118165789*G0_0_0 - 0.0112874779541448*G0_0_2 - 0.0451499118165789*G0_1_0 - 0.0112874779541448*G0_1_2 - 0.0112874779541447*G0_2_0;
+    A[533] = 0.0902998236331579*G0_0_0 + 0.031040564373898*G0_0_2 + 0.0902998236331579*G0_1_0 + 0.0310405643738979*G0_1_2 + 0.0310405643738983*G0_2_0 - 0.0112874779541449*G0_2_2;
+    A[534] = -0.158024691358026*G0_0_0 - 0.0790123456790127*G0_0_2 - 0.158024691358026*G0_1_0 - 0.0790123456790127*G0_1_2 - 0.079012345679013*G0_2_0 + 0.0225749559082895*G0_2_2;
+    A[535] = -0.0112874779541446*G0_0_0 - 0.0112874779541448*G0_0_1 - 0.0112874779541447*G0_1_0 - 0.0112874779541448*G0_1_1;
+    A[536] = -0.00282186948853626*G0_0_0 - 0.00282186948853605*G0_0_1 - 0.00282186948853622*G0_1_0 - 0.00282186948853601*G0_1_1;
+    A[537] = -0.0112874779541445*G0_0_0 - 0.0112874779541448*G0_0_1 - 0.0112874779541446*G0_1_0 - 0.0112874779541448*G0_1_1;
+    A[538] = 0.0451499118165788*G0_0_0 + 0.0451499118165788*G0_0_1 + 0.0338624338624339*G0_0_2 + 0.0451499118165788*G0_1_0 + 0.0451499118165789*G0_1_1 + 0.0338624338624339*G0_1_2 + 0.0790123456790123*G0_2_0 + 0.0790123456790124*G0_2_1 + 0.112874779541446*G0_2_2;
+    A[539] = -0.0902998236331578*G0_0_0 - 0.0902998236331579*G0_0_1 - 0.0592592592592595*G0_0_2 - 0.0902998236331579*G0_1_0 - 0.090299823633158*G0_1_1 - 0.0592592592592596*G0_1_2 - 0.1326278659612*G0_2_0 - 0.1326278659612*G0_2_1 - 0.22010582010582*G0_2_2;
+    A[540] = 0.158024691358026*G0_0_0 + 0.158024691358026*G0_0_1 + 0.079012345679013*G0_0_2 + 0.158024691358026*G0_1_0 + 0.158024691358026*G0_1_1 + 0.0790123456790131*G0_1_2 + 0.079012345679013*G0_2_0 + 0.0790123456790131*G0_2_1 + 0.203174603174604*G0_2_2;
+    A[541] = 0.0112874779541447*G0_0_0 + 0.0112874779541447*G0_0_2 + 0.0112874779541448*G0_1_0 + 0.0112874779541447*G0_1_2 - 0.0225749559082893*G0_2_0 + 0.0112874779541446*G0_2_1 - 0.0225749559082893*G0_2_2;
+    A[542] = 0.00282186948853622*G0_0_0 + 0.00282186948853619*G0_0_2 + 0.0028218694885362*G0_1_0 + 0.00282186948853617*G0_1_2 - 0.0112874779541446*G0_2_0 + 0.00282186948853616*G0_2_1 - 0.0112874779541446*G0_2_2;
+    A[543] = 0.0112874779541446*G0_0_0 + 0.0112874779541446*G0_0_2 + 0.0112874779541446*G0_1_0 + 0.0112874779541446*G0_1_2 + 0.0112874779541447*G0_2_1;
+    A[544] = 0.0112874779541448*G0_0_1 + 0.0112874779541448*G0_0_2 + 0.0112874779541449*G0_1_1 + 0.0112874779541449*G0_1_2 + 0.0112874779541446*G0_2_0 - 0.0225749559082893*G0_2_1 - 0.0225749559082893*G0_2_2;
+    A[545] = 0.00282186948853619*G0_0_1 + 0.00282186948853621*G0_0_2 + 0.00282186948853617*G0_1_1 + 0.0028218694885362*G0_1_2 + 0.00282186948853601*G0_2_0 - 0.0112874779541446*G0_2_1 - 0.0112874779541446*G0_2_2;
+    A[546] = 0.0112874779541448*G0_0_1 + 0.0112874779541448*G0_0_2 + 0.0112874779541448*G0_1_1 + 0.0112874779541448*G0_1_2 + 0.0112874779541447*G0_2_0;
+    A[547] = 0.0225749559082894*G0_0_0 + 0.0225749559082894*G0_0_1 - 0.0112874779541446*G0_0_2 + 0.0225749559082894*G0_1_0 + 0.0225749559082893*G0_1_1 - 0.0112874779541447*G0_1_2 - 0.0112874779541448*G0_2_0 - 0.0112874779541444*G0_2_1;
+    A[548] = 0.0225749559082891*G0_0_0 + 0.0225749559082891*G0_0_1 - 0.0112874779541449*G0_0_2 + 0.022574955908289*G0_1_0 + 0.0225749559082892*G0_1_1 - 0.0112874779541449*G0_1_2 - 0.0112874779541447*G0_2_0 - 0.0112874779541451*G0_2_1;
+    A[549] = -0.112874779541446*G0_0_0 - 0.112874779541446*G0_0_1 - 0.0112874779541444*G0_0_2 - 0.112874779541446*G0_1_0 - 0.112874779541446*G0_1_1 - 0.0112874779541444*G0_1_2 - 0.0112874779541449*G0_2_0 - 0.0112874779541446*G0_2_1 - 0.0451499118165789*G0_2_2;
+    A[550] = -0.0225749559082897*G0_0_0 - 0.0338624338624344*G0_0_2 - 0.0225749559082897*G0_1_0 - 0.0338624338624344*G0_1_2 + 0.0112874779541449*G0_2_0 - 0.0338624338624334*G0_2_1 + 0.067724867724868*G0_2_2;
+    A[551] = -0.0225749559082891*G0_0_0 - 0.0338624338624339*G0_0_2 - 0.022574955908289*G0_1_0 - 0.0338624338624339*G0_1_2 + 0.0112874779541447*G0_2_0 - 0.0338624338624343*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[552] = 0.112874779541446*G0_0_0 + 0.101587301587302*G0_0_2 + 0.112874779541446*G0_1_0 + 0.101587301587302*G0_1_2 + 0.0112874779541449*G0_2_0 + 0.101587301587302*G0_2_1 - 0.0677248677248679*G0_2_2;
+    A[553] = -0.0225749559082895*G0_0_1 - 0.0338624338624345*G0_0_2 - 0.0225749559082895*G0_1_1 - 0.0338624338624345*G0_1_2 - 0.0338624338624332*G0_2_0 + 0.011287477954145*G0_2_1 + 0.067724867724868*G0_2_2;
+    A[554] = -0.0225749559082893*G0_0_1 - 0.0338624338624341*G0_0_2 - 0.0225749559082892*G0_1_1 - 0.0338624338624341*G0_1_2 - 0.0338624338624343*G0_2_0 + 0.0112874779541445*G0_2_1 + 0.0225749559082894*G0_2_2;
+    A[555] = 0.112874779541446*G0_0_1 + 0.101587301587302*G0_0_2 + 0.112874779541446*G0_1_1 + 0.101587301587302*G0_1_2 + 0.101587301587301*G0_2_0 + 0.0112874779541446*G0_2_1 - 0.0677248677248682*G0_2_2;
+    A[556] = 0.0112874779541447*G0_0_2 + 0.0112874779541448*G0_1_2 + 0.0112874779541449*G0_2_0 + 0.0112874779541448*G0_2_1 - 0.0451499118165782*G0_2_2;
+    A[557] = 0.0112874779541448*G0_0_2 + 0.0112874779541449*G0_1_2 + 0.0112874779541443*G0_2_0 + 0.0112874779541447*G0_2_1;
+    A[558] = 0.0112874779541448*G0_0_2 + 0.0112874779541448*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0112874779541444*G0_2_1;
+    A[559] = 0.0902998236331571*G0_2_2;
+    A[560] = -0.0246913580246912*G0_0_0 - 0.0246913580246912*G0_0_1 - 0.0246913580246912*G0_0_2 - 0.0705467372134042*G0_1_0 - 0.0705467372134042*G0_1_1 - 0.0705467372134042*G0_1_2 - 0.0246913580246912*G0_2_0 - 0.0246913580246912*G0_2_1 - 0.0246913580246912*G0_2_2;
+    A[561] = 0.00776014109347446*G0_0_0 + 0.00776014109347445*G0_2_0;
+    A[562] = -0.017636684303351*G0_0_1 - 0.0253968253968256*G0_1_1 - 0.017636684303351*G0_2_1;
+    A[563] = 0.00776014109347441*G0_0_2 + 0.0077601410934744*G0_2_2;
+    A[564] = -0.0338624338624339*G0_0_1 - 0.0451499118165787*G0_0_2 - 0.022574955908289*G0_1_1 - 0.033862433862434*G0_1_2 - 0.0338624338624339*G0_2_1 - 0.0451499118165787*G0_2_2;
+    A[565] = -0.0141093474426808*G0_0_1 - 0.0169312169312168*G0_0_2 - 0.0112874779541447*G0_1_1 - 0.0141093474426806*G0_1_2 - 0.0141093474426808*G0_2_1 - 0.0169312169312168*G0_2_2;
+    A[566] = -0.0112874779541448*G0_0_1 - 0.0225749559082894*G0_0_2 - 0.0112874779541446*G0_1_2 - 0.0112874779541447*G0_2_1 - 0.0225749559082893*G0_2_2;
+    A[567] = -0.0112874779541447*G0_0_0 - 0.0112874779541446*G0_0_2 - 0.0112874779541446*G0_2_0 - 0.0112874779541446*G0_2_2;
+    A[568] = -0.00282186948853615*G0_0_0 - 0.00282186948853634*G0_0_2 - 0.00282186948853623*G0_2_0 - 0.00282186948853637*G0_2_2;
+    A[569] = -0.0112874779541448*G0_0_0 - 0.0112874779541446*G0_0_2 - 0.0112874779541447*G0_2_0 - 0.0112874779541446*G0_2_2;
+    A[570] = -0.0225749559082894*G0_0_0 - 0.0112874779541447*G0_0_1 - 0.0112874779541445*G0_1_0 - 0.0225749559082893*G0_2_0 - 0.0112874779541447*G0_2_1;
+    A[571] = -0.0169312169312166*G0_0_0 - 0.0141093474426806*G0_0_1 - 0.0141093474426804*G0_1_0 - 0.0112874779541446*G0_1_1 - 0.0169312169312165*G0_2_0 - 0.0141093474426805*G0_2_1;
+    A[572] = -0.0451499118165787*G0_0_0 - 0.0338624338624338*G0_0_1 - 0.033862433862434*G0_1_0 - 0.022574955908289*G0_1_1 - 0.0451499118165787*G0_2_0 - 0.0338624338624339*G0_2_1;
+    A[573] = 0.101587301587302*G0_0_0 + 0.101587301587302*G0_0_1 + 0.0225749559082889*G0_0_2 + 0.0225749559082888*G0_1_0 + 0.0225749559082888*G0_1_1 + 0.101587301587302*G0_1_2 + 0.101587301587302*G0_2_0 + 0.101587301587302*G0_2_1 + 0.022574955908289*G0_2_2;
+    A[574] = -0.0423280423280428*G0_0_0 - 0.0423280423280427*G0_0_1 + 0.0169312169312171*G0_0_2 - 0.0112874779541444*G0_1_0 - 0.0112874779541444*G0_1_1 - 0.0423280423280425*G0_1_2 - 0.0423280423280428*G0_2_0 - 0.0423280423280427*G0_2_1 + 0.0169312169312171*G0_2_2;
+    A[575] = 0.0112874779541447*G0_0_0 + 0.0112874779541448*G0_0_1 - 0.0225749559082893*G0_0_2 + 0.0112874779541446*G0_1_2 + 0.0112874779541447*G0_2_0 + 0.0112874779541447*G0_2_1 - 0.0225749559082893*G0_2_2;
+    A[576] = 0.203174603174603*G0_0_0 + 0.124162257495591*G0_0_1 + 0.203174603174603*G0_0_2 + 0.124162257495591*G0_1_0 + 0.203174603174604*G0_1_1 + 0.124162257495591*G0_1_2 + 0.203174603174603*G0_2_0 + 0.124162257495591*G0_2_1 + 0.203174603174603*G0_2_2;
+    A[577] = -0.118518518518519*G0_0_0 - 0.16084656084656*G0_0_1 - 0.118518518518518*G0_0_2 - 0.0874779541446206*G0_1_0 - 0.22010582010582*G0_1_1 - 0.0874779541446206*G0_1_2 - 0.118518518518519*G0_2_0 - 0.160846560846561*G0_2_1 - 0.118518518518518*G0_2_2;
+    A[578] = 0.0451499118165787*G0_0_0 + 0.0790123456790123*G0_0_1 + 0.0451499118165787*G0_0_2 + 0.033862433862434*G0_1_0 + 0.112874779541446*G0_1_1 + 0.033862433862434*G0_1_2 + 0.0451499118165787*G0_2_0 + 0.0790123456790123*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[579] = 0.0225749559082891*G0_0_0 + 0.101587301587302*G0_0_1 + 0.101587301587302*G0_0_2 + 0.101587301587302*G0_1_0 + 0.0225749559082891*G0_1_1 + 0.0225749559082891*G0_1_2 + 0.0225749559082891*G0_2_0 + 0.101587301587302*G0_2_1 + 0.101587301587302*G0_2_2;
+    A[580] = 0.016931216931217*G0_0_0 - 0.0423280423280422*G0_0_1 - 0.0423280423280423*G0_0_2 - 0.0423280423280428*G0_1_0 - 0.0112874779541445*G0_1_1 - 0.0112874779541445*G0_1_2 + 0.016931216931217*G0_2_0 - 0.0423280423280422*G0_2_1 - 0.0423280423280422*G0_2_2;
+    A[581] = -0.0225749559082893*G0_0_0 + 0.0112874779541446*G0_0_1 + 0.0112874779541446*G0_0_2 + 0.0112874779541449*G0_1_0 - 0.0225749559082893*G0_2_0 + 0.0112874779541446*G0_2_1 + 0.0112874779541446*G0_2_2;
+    A[582] = -0.0225749559082895*G0_0_0 - 0.0112874779541449*G0_0_1 - 0.0225749559082892*G0_0_2 - 0.011287477954145*G0_1_0 - 0.0112874779541443*G0_1_2 - 0.0225749559082895*G0_2_0 - 0.0112874779541449*G0_2_1 - 0.0225749559082891*G0_2_2;
+    A[583] = -0.0677248677248679*G0_0_0 - 0.0564373897707235*G0_0_1 - 0.0677248677248677*G0_0_2 - 0.0564373897707231*G0_1_0 - 0.045149911816579*G0_1_1 - 0.056437389770723*G0_1_2 - 0.0677248677248679*G0_2_0 - 0.0564373897707235*G0_2_1 - 0.0677248677248677*G0_2_2;
+    A[584] = -0.0225749559082894*G0_0_0 - 0.0112874779541446*G0_0_1 - 0.0225749559082896*G0_0_2 - 0.011287477954145*G0_1_0 - 0.0112874779541455*G0_1_2 - 0.0225749559082893*G0_2_0 - 0.0112874779541446*G0_2_1 - 0.0225749559082897*G0_2_2;
+    A[585] = -0.067724867724868*G0_0_0 - 0.169312169312169*G0_0_1 - 0.270899470899472*G0_0_2 - 0.0790123456790121*G0_1_0 - 0.067724867724867*G0_1_1 - 0.169312169312169*G0_1_2 - 0.067724867724868*G0_2_0 - 0.16931216931217*G0_2_1 - 0.270899470899472*G0_2_2;
+    A[586] = 0.0677248677248679*G0_0_0 + 0.101587301587302*G0_0_1 + 0.135449735449736*G0_0_2 + 0.0564373897707231*G0_1_0 + 0.0677248677248673*G0_1_1 + 0.101587301587301*G0_1_2 + 0.067724867724868*G0_2_0 + 0.101587301587302*G0_2_1 + 0.135449735449736*G0_2_2;
+    A[587] = 0.0225749559082893*G0_0_0 + 0.0564373897707235*G0_0_1 + 0.0902998236331572*G0_0_2 + 0.0112874779541449*G0_1_0 + 0.0225749559082891*G0_1_1 + 0.0564373897707227*G0_1_2 + 0.0225749559082892*G0_2_0 + 0.0564373897707234*G0_2_1 + 0.0902998236331572*G0_2_2;
+    A[588] = -0.135449735449736*G0_0_0 - 0.0338624338624342*G0_0_1 - 0.135449735449736*G0_0_2 - 0.0338624338624333*G0_1_0 - 0.0451499118165783*G0_1_1 - 0.0338624338624337*G0_1_2 - 0.135449735449736*G0_2_0 - 0.0338624338624341*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[589] = 0.0451499118165786*G0_0_0 + 0.011287477954145*G0_0_1 + 0.0451499118165787*G0_0_2 + 0.0112874779541442*G0_1_0 + 0.0112874779541446*G0_1_2 + 0.0451499118165785*G0_2_0 + 0.011287477954145*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[590] = 0.0451499118165789*G0_0_0 + 0.0112874779541446*G0_0_1 + 0.0451499118165789*G0_0_2 + 0.0112874779541446*G0_1_0 + 0.0112874779541444*G0_1_2 + 0.045149911816579*G0_2_0 + 0.0112874779541447*G0_2_1 + 0.0451499118165789*G0_2_2;
+    A[591] = -0.270899470899471*G0_0_0 - 0.16931216931217*G0_0_1 - 0.0677248677248675*G0_0_2 - 0.169312169312169*G0_1_0 - 0.0677248677248675*G0_1_1 - 0.0790123456790121*G0_1_2 - 0.270899470899471*G0_2_0 - 0.16931216931217*G0_2_1 - 0.0677248677248675*G0_2_2;
+    A[592] = 0.090299823633157*G0_0_0 + 0.056437389770723*G0_0_1 + 0.0225749559082893*G0_0_2 + 0.0564373897707228*G0_1_0 + 0.0225749559082892*G0_1_1 + 0.0112874779541444*G0_1_2 + 0.090299823633157*G0_2_0 + 0.0564373897707229*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[593] = 0.135449735449735*G0_0_0 + 0.101587301587301*G0_0_1 + 0.0677248677248676*G0_0_2 + 0.101587301587301*G0_1_0 + 0.0677248677248674*G0_1_1 + 0.0564373897707229*G0_1_2 + 0.135449735449735*G0_2_0 + 0.101587301587301*G0_2_1 + 0.0677248677248675*G0_2_2;
+    A[594] = 0.0902998236331576*G0_0_0 + 0.0902998236331575*G0_0_1 + 0.0902998236331571*G0_0_2 + 0.0902998236331572*G0_1_0 + 0.0902998236331573*G0_1_1 + 0.0902998236331576*G0_1_2 + 0.0902998236331576*G0_2_0 + 0.0902998236331574*G0_2_1 + 0.0902998236331571*G0_2_2;
+    A[595] = 0.0202821869488536*G0_0_0 + 0.0202821869488535*G0_0_1 + 0.0202821869488536*G0_0_2 + 0.0529100529100531*G0_1_0 + 0.0529100529100531*G0_1_1 + 0.0529100529100531*G0_1_2 + 0.0202821869488536*G0_2_0 + 0.0202821869488535*G0_2_1 + 0.0202821869488536*G0_2_2;
+    A[596] = 0.00511463844797175*G0_0_0 + 0.00511463844797175*G0_2_0;
+    A[597] = 0.0326278659611995*G0_0_1 + 0.0529100529100532*G0_1_1 + 0.0326278659611995*G0_2_1;
+    A[598] = 0.00511463844797173*G0_0_2 + 0.00511463844797174*G0_2_2;
+    A[599] = 0.0592592592592594*G0_0_1 + 0.0902998236331577*G0_0_2 + 0.0169312169312167*G0_1_1 + 0.0592592592592596*G0_1_2 + 0.0592592592592594*G0_2_1 + 0.0902998236331577*G0_2_2;
+    A[600] = 0.0105820105820105*G0_0_1 + 0.0211640211640205*G0_0_2 - 0.0028218694885361*G0_1_1 + 0.0105820105820101*G0_1_2 + 0.0105820105820105*G0_2_1 + 0.0211640211640206*G0_2_2;
+    A[601] = -0.00282186948853619*G0_0_1 - 0.0169312169312168*G0_0_2 - 0.00282186948853612*G0_1_2 - 0.00282186948853617*G0_2_1 - 0.0169312169312168*G0_2_2;
+    A[602] = -0.00282186948853622*G0_0_0 - 0.00282186948853608*G0_0_2 - 0.00282186948853617*G0_2_0 - 0.00282186948853603*G0_2_2;
+    A[603] = -0.00917107583774225*G0_0_0 - 0.00917107583774249*G0_0_2 - 0.00917107583774232*G0_2_0 - 0.00917107583774253*G0_2_2;
+    A[604] = -0.00282186948853622*G0_0_0 - 0.00282186948853609*G0_0_2 - 0.0028218694885362*G0_2_0 - 0.00282186948853608*G0_2_2;
+    A[605] = -0.0169312169312167*G0_0_0 - 0.00282186948853603*G0_0_1 - 0.00282186948853613*G0_1_0 - 0.0169312169312166*G0_2_0 - 0.00282186948853599*G0_2_1;
+    A[606] = 0.0211640211640205*G0_0_0 + 0.0105820105820103*G0_0_1 + 0.0105820105820101*G0_1_0 - 0.00282186948853616*G0_1_1 + 0.0211640211640204*G0_2_0 + 0.0105820105820102*G0_2_1;
+    A[607] = 0.0902998236331576*G0_0_0 + 0.0592592592592594*G0_0_1 + 0.0592592592592596*G0_1_0 + 0.0169312169312167*G0_1_1 + 0.0902998236331576*G0_2_0 + 0.0592592592592594*G0_2_1;
+    A[608] = -0.0423280423280423*G0_0_0 - 0.0423280423280423*G0_0_1 - 0.0112874779541445*G0_0_2 + 0.0169312169312174*G0_1_0 + 0.0169312169312173*G0_1_1 - 0.0423280423280426*G0_1_2 - 0.0423280423280422*G0_2_0 - 0.0423280423280423*G0_2_1 - 0.0112874779541445*G0_2_2;
+    A[609] = -0.0134038800705467*G0_0_0 - 0.0134038800705468*G0_0_1 - 0.00282186948853613*G0_0_2 - 0.00282186948853641*G0_1_0 - 0.00282186948853637*G0_1_1 - 0.0134038800705466*G0_1_2 - 0.0134038800705467*G0_2_0 - 0.0134038800705468*G0_2_1 - 0.0028218694885361*G0_2_2;
+    A[610] = 0.00282186948853622*G0_0_0 + 0.0028218694885362*G0_0_1 - 0.0112874779541446*G0_0_2 + 0.00282186948853616*G0_1_2 + 0.00282186948853619*G0_2_0 + 0.00282186948853617*G0_2_1 - 0.0112874779541446*G0_2_2;
+    A[611] = -0.118518518518518*G0_0_0 - 0.0874779541446206*G0_0_1 - 0.118518518518518*G0_0_2 - 0.16084656084656*G0_1_0 - 0.22010582010582*G0_1_1 - 0.16084656084656*G0_1_2 - 0.118518518518518*G0_2_0 - 0.0874779541446206*G0_2_1 - 0.118518518518519*G0_2_2;
+    A[612] = 0.24973544973545*G0_0_0 + 0.167195767195767*G0_0_1 + 0.24973544973545*G0_0_2 + 0.167195767195767*G0_1_0 + 0.334391534391535*G0_1_1 + 0.167195767195767*G0_1_2 + 0.24973544973545*G0_2_0 + 0.167195767195767*G0_2_1 + 0.24973544973545*G0_2_2;
+    A[613] = -0.0902998236331576*G0_0_0 - 0.1326278659612*G0_0_1 - 0.0902998236331577*G0_0_2 - 0.0592592592592596*G0_1_0 - 0.220105820105821*G0_1_1 - 0.0592592592592596*G0_1_2 - 0.0902998236331577*G0_2_0 - 0.1326278659612*G0_2_1 - 0.0902998236331577*G0_2_2;
+    A[614] = -0.0112874779541445*G0_0_0 - 0.0423280423280424*G0_0_1 - 0.0423280423280424*G0_0_2 - 0.0423280423280427*G0_1_0 + 0.0169312169312172*G0_1_1 + 0.0169312169312172*G0_1_2 - 0.0112874779541445*G0_2_0 - 0.0423280423280423*G0_2_1 - 0.0423280423280423*G0_2_2;
+    A[615] = -0.00282186948853619*G0_0_0 - 0.0134038800705469*G0_0_1 - 0.0134038800705468*G0_0_2 - 0.0134038800705464*G0_1_0 - 0.00282186948853624*G0_1_1 - 0.00282186948853626*G0_1_2 - 0.00282186948853618*G0_2_0 - 0.0134038800705469*G0_2_1 - 0.0134038800705468*G0_2_2;
+    A[616] = -0.0112874779541446*G0_0_0 + 0.00282186948853617*G0_0_1 + 0.00282186948853619*G0_0_2 + 0.00282186948853592*G0_1_0 - 0.0112874779541446*G0_2_0 + 0.00282186948853612*G0_2_1 + 0.00282186948853615*G0_2_2;
+    A[617] = 0.016931216931217*G0_0_0 - 0.00282186948853603*G0_0_1 + 0.0169312169312168*G0_0_2 - 0.00282186948853567*G0_1_0 - 0.00282186948853633*G0_1_2 + 0.016931216931217*G0_2_0 - 0.00282186948853597*G0_2_1 + 0.0169312169312168*G0_2_2;
+    A[618] = 0.0846560846560848*G0_0_0 + 0.0423280423280422*G0_0_1 + 0.0846560846560847*G0_0_2 + 0.0423280423280421*G0_1_0 + 0.0225749559082896*G0_1_1 + 0.0423280423280422*G0_1_2 + 0.0846560846560848*G0_2_0 + 0.0423280423280422*G0_2_1 + 0.0846560846560847*G0_2_2;
+    A[619] = 0.0169312169312169*G0_0_0 - 0.00282186948853599*G0_0_1 + 0.0169312169312171*G0_0_2 - 0.00282186948853602*G0_1_0 - 0.00282186948853552*G0_1_2 + 0.0169312169312169*G0_2_0 - 0.00282186948853603*G0_2_1 + 0.0169312169312171*G0_2_2;
+    A[620] = 0.118518518518518*G0_0_0 + 0.160846560846561*G0_0_1 + 0.0677248677248674*G0_0_2 + 0.025396825396825*G0_1_0 - 0.0169312169312177*G0_1_1 + 0.16084656084656*G0_1_2 + 0.118518518518518*G0_2_0 + 0.160846560846561*G0_2_1 + 0.0677248677248674*G0_2_2;
+    A[621] = -0.0846560846560848*G0_0_0 - 0.177777777777778*G0_0_1 - 0.270899470899471*G0_0_2 - 0.0423280423280421*G0_1_0 - 0.0169312169312163*G0_1_1 - 0.177777777777777*G0_1_2 - 0.0846560846560848*G0_2_0 - 0.177777777777778*G0_2_1 - 0.270899470899471*G0_2_2;
+    A[622] = -0.0169312169312168*G0_0_0 + 0.00282186948853631*G0_0_1 + 0.0677248677248682*G0_0_2 + 0.00282186948853606*G0_1_0 + 0.00564373897707248*G0_1_1 + 0.00282186948853666*G0_1_2 - 0.0169312169312168*G0_2_0 + 0.0028218694885363*G0_2_1 + 0.0677248677248682*G0_2_2;
+    A[623] = 0.0225749559082894*G0_0_0 - 0.0197530864197531*G0_0_1 + 0.0225749559082892*G0_0_2 - 0.0197530864197536*G0_1_0 + 0.0225749559082891*G0_1_1 - 0.0197530864197534*G0_1_2 + 0.0225749559082893*G0_2_0 - 0.0197530864197531*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[624] = 0.0225749559082893*G0_0_0 + 0.00282186948853594*G0_0_1 + 0.0225749559082892*G0_0_2 + 0.00282186948853654*G0_1_0 + 0.00282186948853605*G0_1_2 + 0.0225749559082893*G0_2_0 + 0.00282186948853588*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[625] = 0.022574955908289*G0_0_0 + 0.00282186948853596*G0_0_1 + 0.0225749559082892*G0_0_2 + 0.00282186948853611*G0_1_0 + 0.00282186948853643*G0_1_2 + 0.022574955908289*G0_2_0 + 0.002821869488536*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[626] = 0.0677248677248675*G0_0_0 + 0.160846560846561*G0_0_1 + 0.118518518518518*G0_0_2 + 0.16084656084656*G0_1_0 - 0.0169312169312173*G0_1_1 + 0.0253968253968253*G0_1_2 + 0.0677248677248674*G0_2_0 + 0.160846560846561*G0_2_1 + 0.118518518518518*G0_2_2;
+    A[627] = 0.0677248677248676*G0_0_0 + 0.00282186948853633*G0_0_1 - 0.016931216931217*G0_0_2 + 0.00282186948853634*G0_1_0 + 0.00564373897707231*G0_1_1 + 0.00282186948853621*G0_1_2 + 0.0677248677248677*G0_2_0 + 0.00282186948853639*G0_2_1 - 0.0169312169312171*G0_2_2;
+    A[628] = -0.270899470899471*G0_0_0 - 0.177777777777778*G0_0_1 - 0.0846560846560846*G0_0_2 - 0.177777777777777*G0_1_0 - 0.0169312169312165*G0_1_1 - 0.0423280423280421*G0_1_2 - 0.270899470899471*G0_2_0 - 0.177777777777778*G0_2_1 - 0.0846560846560845*G0_2_2;
+    A[629] = -0.135449735449735*G0_0_0 - 0.022574955908289*G0_0_1 - 0.135449735449736*G0_0_2 - 0.0225749559082894*G0_1_0 - 0.0451499118165787*G0_1_1 - 0.0225749559082897*G0_1_2 - 0.135449735449736*G0_2_0 - 0.0225749559082889*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[630] = -0.00776014109347444*G0_0_0 - 0.00776014109347444*G0_0_1 - 0.00776014109347444*G0_0_2 - 0.0253968253968255*G0_1_0 - 0.0253968253968255*G0_1_1 - 0.0253968253968255*G0_1_2 - 0.00776014109347443*G0_2_0 - 0.00776014109347443*G0_2_1 - 0.00776014109347443*G0_2_2;
+    A[631] = 0.00776014109347445*G0_0_0 + 0.00776014109347447*G0_2_0;
+    A[632] = -0.0458553791887129*G0_0_1 - 0.0705467372134042*G0_1_1 - 0.0458553791887129*G0_2_1;
+    A[633] = 0.00776014109347446*G0_0_2 + 0.00776014109347446*G0_2_2;
+    A[634] = -0.0790123456790126*G0_0_1 - 0.158024691358026*G0_0_2 + 0.0225749559082893*G0_1_1 - 0.079012345679013*G0_1_2 - 0.0790123456790126*G0_2_1 - 0.158024691358026*G0_2_2;
+    A[635] = 0.0310405643738979*G0_0_1 + 0.0902998236331577*G0_0_2 - 0.0112874779541446*G0_1_1 + 0.0310405643738983*G0_1_2 + 0.0310405643738979*G0_2_1 + 0.0902998236331577*G0_2_2;
+    A[636] = -0.0112874779541446*G0_0_1 - 0.0451499118165786*G0_0_2 - 0.0112874779541446*G0_1_2 - 0.0112874779541447*G0_2_1 - 0.0451499118165786*G0_2_2;
+    A[637] = -0.0112874779541446*G0_0_0 - 0.0112874779541448*G0_0_2 - 0.0112874779541447*G0_2_0 - 0.0112874779541448*G0_2_2;
+    A[638] = -0.00282186948853616*G0_0_0 - 0.00282186948853598*G0_0_2 - 0.0028218694885361*G0_2_0 - 0.00282186948853597*G0_2_2;
+    A[639] = -0.0112874779541446*G0_0_0 - 0.0112874779541446*G0_0_2 - 0.0112874779541446*G0_2_0 - 0.0112874779541447*G0_2_2;
+    A[640] = -0.0451499118165788*G0_0_0 - 0.0112874779541448*G0_0_1 - 0.0112874779541448*G0_1_0 - 0.0451499118165788*G0_2_0 - 0.0112874779541448*G0_2_1;
+    A[641] = 0.0902998236331578*G0_0_0 + 0.031040564373898*G0_0_1 + 0.0310405643738983*G0_1_0 - 0.0112874779541445*G0_1_1 + 0.0902998236331579*G0_2_0 + 0.0310405643738981*G0_2_1;
+    A[642] = -0.158024691358026*G0_0_0 - 0.0790123456790126*G0_0_1 - 0.0790123456790129*G0_1_0 + 0.0225749559082893*G0_1_1 - 0.158024691358026*G0_2_0 - 0.0790123456790126*G0_2_1;
+    A[643] = 0.0112874779541446*G0_0_0 + 0.0112874779541446*G0_0_1 - 0.0225749559082895*G0_1_0 - 0.0225749559082894*G0_1_1 + 0.0112874779541449*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0112874779541446*G0_2_1;
+    A[644] = 0.00282186948853633*G0_0_0 + 0.00282186948853629*G0_0_1 - 0.0112874779541444*G0_1_0 - 0.0112874779541445*G0_1_1 + 0.00282186948853593*G0_1_2 + 0.00282186948853632*G0_2_0 + 0.00282186948853628*G0_2_1;
+    A[645] = 0.0112874779541446*G0_0_0 + 0.0112874779541446*G0_0_1 + 0.0112874779541447*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0112874779541446*G0_2_1;
+    A[646] = 0.0451499118165787*G0_0_0 + 0.033862433862434*G0_0_1 + 0.0451499118165787*G0_0_2 + 0.0790123456790123*G0_1_0 + 0.112874779541446*G0_1_1 + 0.0790123456790123*G0_1_2 + 0.0451499118165787*G0_2_0 + 0.033862433862434*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[647] = -0.0902998236331576*G0_0_0 - 0.0592592592592596*G0_0_1 - 0.0902998236331576*G0_0_2 - 0.1326278659612*G0_1_0 - 0.220105820105821*G0_1_1 - 0.1326278659612*G0_1_2 - 0.0902998236331577*G0_2_0 - 0.0592592592592596*G0_2_1 - 0.0902998236331577*G0_2_2;
+    A[648] = 0.158024691358026*G0_0_0 + 0.079012345679013*G0_0_1 + 0.158024691358026*G0_0_2 + 0.079012345679013*G0_1_0 + 0.203174603174604*G0_1_1 + 0.079012345679013*G0_1_2 + 0.158024691358026*G0_2_0 + 0.079012345679013*G0_2_1 + 0.158024691358026*G0_2_2;
+    A[649] = 0.0112874779541447*G0_0_1 + 0.0112874779541447*G0_0_2 + 0.0112874779541448*G0_1_0 - 0.0225749559082895*G0_1_1 - 0.0225749559082894*G0_1_2 + 0.0112874779541447*G0_2_1 + 0.0112874779541447*G0_2_2;
+    A[650] = 0.00282186948853617*G0_0_1 + 0.0028218694885361*G0_0_2 + 0.00282186948853601*G0_1_0 - 0.0112874779541446*G0_1_1 - 0.0112874779541446*G0_1_2 + 0.00282186948853621*G0_2_1 + 0.00282186948853614*G0_2_2;
+    A[651] = 0.0112874779541447*G0_0_1 + 0.0112874779541447*G0_0_2 + 0.0112874779541448*G0_1_0 + 0.0112874779541447*G0_2_1 + 0.0112874779541447*G0_2_2;
+    A[652] = 0.0225749559082894*G0_0_0 - 0.0112874779541446*G0_0_1 + 0.0225749559082895*G0_0_2 - 0.0112874779541448*G0_1_0 - 0.0112874779541445*G0_1_2 + 0.0225749559082894*G0_2_0 - 0.0112874779541446*G0_2_1 + 0.0225749559082895*G0_2_2;
+    A[653] = -0.112874779541446*G0_0_0 - 0.0112874779541444*G0_0_1 - 0.112874779541446*G0_0_2 - 0.0112874779541444*G0_1_0 - 0.0451499118165784*G0_1_1 - 0.0112874779541445*G0_1_2 - 0.112874779541446*G0_2_0 - 0.0112874779541444*G0_2_1 - 0.112874779541446*G0_2_2;
+    A[654] = 0.0225749559082896*G0_0_0 - 0.0112874779541444*G0_0_1 + 0.0225749559082894*G0_0_2 - 0.0112874779541445*G0_1_0 - 0.0112874779541447*G0_1_2 + 0.0225749559082896*G0_2_0 - 0.0112874779541444*G0_2_1 + 0.0225749559082895*G0_2_2;
+    A[655] = -0.0225749559082887*G0_0_0 - 0.0338624338624338*G0_0_1 + 0.0112874779541451*G0_1_0 + 0.0677248677248681*G0_1_1 - 0.0338624338624333*G0_1_2 - 0.0225749559082887*G0_2_0 - 0.0338624338624338*G0_2_1;
+    A[656] = 0.112874779541446*G0_0_0 + 0.101587301587302*G0_0_1 + 0.0112874779541444*G0_1_0 - 0.0677248677248681*G0_1_1 + 0.101587301587301*G0_1_2 + 0.112874779541446*G0_2_0 + 0.101587301587302*G0_2_1;
+    A[657] = -0.0225749559082897*G0_0_0 - 0.0338624338624343*G0_0_1 + 0.0112874779541445*G0_1_0 + 0.0225749559082891*G0_1_1 - 0.0338624338624343*G0_1_2 - 0.0225749559082897*G0_2_0 - 0.0338624338624343*G0_2_1;
+    A[658] = 0.0112874779541452*G0_0_1 + 0.0112874779541448*G0_1_0 - 0.0451499118165782*G0_1_1 + 0.0112874779541451*G0_1_2 + 0.0112874779541452*G0_2_1;
+    A[659] = 0.0112874779541447*G0_0_1 + 0.0112874779541444*G0_1_0 + 0.0112874779541447*G0_1_2 + 0.0112874779541447*G0_2_1;
+    A[660] = 0.0112874779541445*G0_0_1 + 0.0112874779541447*G0_1_0 + 0.0112874779541442*G0_1_2 + 0.0112874779541445*G0_2_1;
+    A[661] = -0.033862433862434*G0_0_1 - 0.022574955908289*G0_0_2 - 0.0338624338624335*G0_1_0 + 0.067724867724868*G0_1_1 + 0.0112874779541447*G0_1_2 - 0.033862433862434*G0_2_1 - 0.0225749559082889*G0_2_2;
+    A[662] = -0.033862433862434*G0_0_1 - 0.0225749559082891*G0_0_2 - 0.0338624338624339*G0_1_0 + 0.0225749559082892*G0_1_1 + 0.0112874779541447*G0_1_2 - 0.0338624338624341*G0_2_1 - 0.0225749559082892*G0_2_2;
+    A[663] = 0.101587301587302*G0_0_1 + 0.112874779541446*G0_0_2 + 0.101587301587301*G0_1_0 - 0.0677248677248679*G0_1_1 + 0.0112874779541444*G0_1_2 + 0.101587301587302*G0_2_1 + 0.112874779541446*G0_2_2;
+    A[664] = 0.0902998236331566*G0_1_1;
+    A[665] = -0.0705467372134042*G0_0_0 - 0.0705467372134042*G0_0_1 - 0.0705467372134042*G0_0_2 - 0.0246913580246913*G0_1_0 - 0.0246913580246913*G0_1_1 - 0.0246913580246913*G0_1_2 - 0.0246913580246913*G0_2_0 - 0.0246913580246913*G0_2_1 - 0.0246913580246913*G0_2_2;
+    A[666] = -0.0253968253968255*G0_0_0 - 0.017636684303351*G0_1_0 - 0.017636684303351*G0_2_0;
+    A[667] = 0.00776014109347447*G0_1_1 + 0.00776014109347447*G0_2_1;
+    A[668] = 0.0077601410934744*G0_1_2 + 0.00776014109347439*G0_2_2;
+    A[669] = -0.0112874779541448*G0_1_1 - 0.0112874779541447*G0_1_2 - 0.0112874779541448*G0_2_1 - 0.0112874779541447*G0_2_2;
+    A[670] = -0.00282186948853615*G0_1_1 - 0.00282186948853622*G0_1_2 - 0.00282186948853612*G0_2_1 - 0.00282186948853618*G0_2_2;
+    A[671] = -0.0112874779541449*G0_1_1 - 0.0112874779541448*G0_1_2 - 0.0112874779541449*G0_2_1 - 0.0112874779541448*G0_2_2;
+    A[672] = -0.022574955908289*G0_0_0 - 0.0338624338624339*G0_0_2 - 0.033862433862434*G0_1_0 - 0.0451499118165786*G0_1_2 - 0.0338624338624339*G0_2_0 - 0.0451499118165786*G0_2_2;
+    A[673] = -0.0112874779541447*G0_0_0 - 0.0141093474426807*G0_0_2 - 0.0141093474426807*G0_1_0 - 0.016931216931217*G0_1_2 - 0.0141093474426808*G0_2_0 - 0.016931216931217*G0_2_2;
+    A[674] = -0.0112874779541446*G0_0_2 - 0.0112874779541449*G0_1_0 - 0.0225749559082894*G0_1_2 - 0.0112874779541449*G0_2_0 - 0.0225749559082894*G0_2_2;
+    A[675] = -0.022574955908289*G0_0_0 - 0.0338624338624339*G0_0_1 - 0.0338624338624339*G0_1_0 - 0.0451499118165787*G0_1_1 - 0.0338624338624339*G0_2_0 - 0.0451499118165787*G0_2_1;
+    A[676] = -0.0112874779541446*G0_0_0 - 0.0141093474426807*G0_0_1 - 0.0141093474426807*G0_1_0 - 0.0169312169312166*G0_1_1 - 0.0141093474426807*G0_2_0 - 0.0169312169312167*G0_2_1;
+    A[677] = -0.0112874779541446*G0_0_1 - 0.0112874779541447*G0_1_0 - 0.0225749559082894*G0_1_1 - 0.0112874779541447*G0_2_0 - 0.0225749559082894*G0_2_1;
+    A[678] = 0.022574955908289*G0_0_0 + 0.022574955908289*G0_0_1 + 0.101587301587302*G0_0_2 + 0.101587301587302*G0_1_0 + 0.101587301587302*G0_1_1 + 0.0225749559082891*G0_1_2 + 0.101587301587302*G0_2_0 + 0.101587301587302*G0_2_1 + 0.0225749559082891*G0_2_2;
+    A[679] = -0.0112874779541445*G0_0_0 - 0.0112874779541444*G0_0_1 - 0.0423280423280426*G0_0_2 - 0.0423280423280428*G0_1_0 - 0.0423280423280428*G0_1_1 + 0.016931216931217*G0_1_2 - 0.0423280423280428*G0_2_0 - 0.0423280423280428*G0_2_1 + 0.016931216931217*G0_2_2;
+    A[680] = 0.0112874779541446*G0_0_2 + 0.0112874779541448*G0_1_0 + 0.0112874779541449*G0_1_1 - 0.0225749559082893*G0_1_2 + 0.0112874779541448*G0_2_0 + 0.0112874779541449*G0_2_1 - 0.0225749559082893*G0_2_2;
+    A[681] = 0.0225749559082891*G0_0_0 + 0.101587301587302*G0_0_1 + 0.0225749559082891*G0_0_2 + 0.101587301587302*G0_1_0 + 0.0225749559082891*G0_1_1 + 0.101587301587302*G0_1_2 + 0.101587301587302*G0_2_0 + 0.0225749559082891*G0_2_1 + 0.101587301587302*G0_2_2;
+    A[682] = -0.0112874779541445*G0_0_0 - 0.0423280423280427*G0_0_1 - 0.0112874779541445*G0_0_2 - 0.0423280423280424*G0_1_0 + 0.0169312169312172*G0_1_1 - 0.0423280423280423*G0_1_2 - 0.0423280423280424*G0_2_0 + 0.0169312169312172*G0_2_1 - 0.0423280423280423*G0_2_2;
+    A[683] = 0.0112874779541448*G0_0_1 + 0.0112874779541447*G0_1_0 - 0.0225749559082895*G0_1_1 + 0.0112874779541447*G0_1_2 + 0.0112874779541447*G0_2_0 - 0.0225749559082894*G0_2_1 + 0.0112874779541447*G0_2_2;
+    A[684] = 0.203174603174604*G0_0_0 + 0.124162257495591*G0_0_1 + 0.124162257495591*G0_0_2 + 0.124162257495591*G0_1_0 + 0.203174603174604*G0_1_1 + 0.203174603174604*G0_1_2 + 0.124162257495591*G0_2_0 + 0.203174603174604*G0_2_1 + 0.203174603174604*G0_2_2;
+    A[685] = -0.220105820105821*G0_0_0 - 0.0874779541446208*G0_0_1 - 0.0874779541446208*G0_0_2 - 0.160846560846561*G0_1_0 - 0.118518518518518*G0_1_1 - 0.118518518518519*G0_1_2 - 0.160846560846561*G0_2_0 - 0.118518518518519*G0_2_1 - 0.118518518518519*G0_2_2;
+    A[686] = 0.112874779541447*G0_0_0 + 0.0338624338624339*G0_0_1 + 0.0338624338624339*G0_0_2 + 0.0790123456790124*G0_1_0 + 0.0451499118165787*G0_1_1 + 0.0451499118165787*G0_1_2 + 0.0790123456790124*G0_2_0 + 0.0451499118165786*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[687] = -0.0451499118165789*G0_0_0 - 0.0564373897707228*G0_0_1 - 0.0564373897707228*G0_0_2 - 0.0564373897707233*G0_1_0 - 0.0677248677248679*G0_1_1 - 0.0677248677248676*G0_1_2 - 0.0564373897707233*G0_2_0 - 0.0677248677248678*G0_2_1 - 0.0677248677248676*G0_2_2;
+    A[688] = -0.0112874779541452*G0_0_1 - 0.0112874779541447*G0_0_2 - 0.011287477954145*G0_1_0 - 0.0225749559082896*G0_1_1 - 0.0225749559082894*G0_1_2 - 0.011287477954145*G0_2_0 - 0.0225749559082896*G0_2_1 - 0.0225749559082895*G0_2_2;
+    A[689] = -0.011287477954145*G0_0_1 - 0.0112874779541454*G0_0_2 - 0.0112874779541448*G0_1_0 - 0.0225749559082893*G0_1_1 - 0.0225749559082896*G0_1_2 - 0.0112874779541448*G0_2_0 - 0.0225749559082893*G0_2_1 - 0.0225749559082896*G0_2_2;
+    A[690] = -0.0451499118165784*G0_0_0 - 0.0338624338624336*G0_0_1 - 0.0338624338624336*G0_0_2 - 0.0338624338624343*G0_1_0 - 0.135449735449736*G0_1_1 - 0.135449735449736*G0_1_2 - 0.0338624338624343*G0_2_0 - 0.135449735449736*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[691] = 0.0112874779541444*G0_0_1 + 0.0112874779541445*G0_0_2 + 0.011287477954145*G0_1_0 + 0.0451499118165788*G0_1_1 + 0.0451499118165788*G0_1_2 + 0.011287477954145*G0_2_0 + 0.0451499118165787*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[692] = 0.0112874779541445*G0_0_1 + 0.0112874779541445*G0_0_2 + 0.0112874779541448*G0_1_0 + 0.0451499118165789*G0_1_1 + 0.0451499118165789*G0_1_2 + 0.0112874779541447*G0_2_0 + 0.0451499118165789*G0_2_1 + 0.0451499118165789*G0_2_2;
+    A[693] = -0.0677248677248674*G0_0_0 - 0.0790123456790122*G0_0_1 - 0.169312169312169*G0_0_2 - 0.16931216931217*G0_1_0 - 0.0677248677248681*G0_1_1 - 0.270899470899472*G0_1_2 - 0.16931216931217*G0_2_0 - 0.0677248677248681*G0_2_1 - 0.270899470899472*G0_2_2;
+    A[694] = 0.0677248677248673*G0_0_0 + 0.0564373897707228*G0_0_1 + 0.101587301587301*G0_0_2 + 0.101587301587302*G0_1_0 + 0.067724867724868*G0_1_1 + 0.135449735449735*G0_1_2 + 0.101587301587302*G0_2_0 + 0.0677248677248679*G0_2_1 + 0.135449735449736*G0_2_2;
+    A[695] = 0.0225749559082892*G0_0_0 + 0.0112874779541451*G0_0_1 + 0.056437389770723*G0_0_2 + 0.0564373897707235*G0_1_0 + 0.0225749559082893*G0_1_1 + 0.0902998236331576*G0_1_2 + 0.0564373897707235*G0_2_0 + 0.0225749559082894*G0_2_1 + 0.0902998236331575*G0_2_2;
+    A[696] = -0.0677248677248674*G0_0_0 - 0.169312169312169*G0_0_1 - 0.0790123456790121*G0_0_2 - 0.16931216931217*G0_1_0 - 0.270899470899471*G0_1_1 - 0.0677248677248675*G0_1_2 - 0.16931216931217*G0_2_0 - 0.270899470899471*G0_2_1 - 0.0677248677248675*G0_2_2;
+    A[697] = 0.0677248677248673*G0_0_0 + 0.101587301587301*G0_0_1 + 0.0564373897707228*G0_0_2 + 0.101587301587302*G0_1_0 + 0.135449735449735*G0_1_1 + 0.0677248677248677*G0_1_2 + 0.101587301587302*G0_2_0 + 0.135449735449735*G0_2_1 + 0.0677248677248676*G0_2_2;
+    A[698] = 0.0225749559082891*G0_0_0 + 0.056437389770723*G0_0_1 + 0.0112874779541447*G0_0_2 + 0.056437389770723*G0_1_0 + 0.0902998236331571*G0_1_1 + 0.0225749559082893*G0_1_2 + 0.0564373897707231*G0_2_0 + 0.090299823633157*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[699] = 0.0902998236331574*G0_0_0 + 0.0902998236331573*G0_0_1 + 0.0902998236331575*G0_0_2 + 0.0902998236331577*G0_1_0 + 0.0902998236331576*G0_1_1 + 0.0902998236331571*G0_1_2 + 0.0902998236331577*G0_2_0 + 0.0902998236331576*G0_2_1 + 0.0902998236331572*G0_2_2;
+    A[700] = 0.0529100529100532*G0_0_0 + 0.0529100529100532*G0_0_1 + 0.0529100529100532*G0_0_2 + 0.0202821869488536*G0_1_0 + 0.0202821869488536*G0_1_1 + 0.0202821869488536*G0_1_2 + 0.0202821869488535*G0_2_0 + 0.0202821869488536*G0_2_1 + 0.0202821869488536*G0_2_2;
+    A[701] = 0.0529100529100531*G0_0_0 + 0.0326278659611995*G0_1_0 + 0.0326278659611995*G0_2_0;
+    A[702] = 0.0051146384479718*G0_1_1 + 0.0051146384479718*G0_2_1;
+    A[703] = 0.00511463844797175*G0_1_2 + 0.00511463844797175*G0_2_2;
+    A[704] = -0.00282186948853621*G0_1_1 - 0.00282186948853615*G0_1_2 - 0.00282186948853615*G0_2_1 - 0.00282186948853608*G0_2_2;
+    A[705] = -0.00917107583774254*G0_1_1 - 0.00917107583774259*G0_1_2 - 0.00917107583774254*G0_2_1 - 0.00917107583774262*G0_2_2;
+    A[706] = -0.00282186948853618*G0_1_1 - 0.00282186948853617*G0_1_2 - 0.0028218694885362*G0_2_1 - 0.00282186948853618*G0_2_2;
+    A[707] = 0.0169312169312167*G0_0_0 + 0.0592592592592595*G0_0_2 + 0.059259259259259*G0_1_0 + 0.0902998236331573*G0_1_2 + 0.059259259259259*G0_2_0 + 0.0902998236331573*G0_2_2;
+    A[708] = -0.00282186948853612*G0_0_0 + 0.0105820105820102*G0_0_2 + 0.0105820105820106*G0_1_0 + 0.0211640211640209*G0_1_2 + 0.0105820105820107*G0_2_0 + 0.0211640211640209*G0_2_2;
+    A[709] = -0.002821869488536*G0_0_2 - 0.00282186948853616*G0_1_0 - 0.0169312169312168*G0_1_2 - 0.00282186948853618*G0_2_0 - 0.0169312169312168*G0_2_2;
+    A[710] = 0.0169312169312168*G0_0_0 + 0.0592592592592595*G0_0_1 + 0.0592592592592591*G0_1_0 + 0.0902998236331574*G0_1_1 + 0.0592592592592592*G0_2_0 + 0.0902998236331574*G0_2_1;
+    A[711] = -0.00282186948853615*G0_0_0 + 0.0105820105820103*G0_0_1 + 0.0105820105820105*G0_1_0 + 0.0211640211640207*G0_1_1 + 0.0105820105820105*G0_2_0 + 0.0211640211640207*G0_2_1;
+    A[712] = -0.00282186948853594*G0_0_1 - 0.00282186948853616*G0_1_0 - 0.0169312169312169*G0_1_1 - 0.00282186948853609*G0_2_0 - 0.0169312169312168*G0_2_1;
+    A[713] = 0.0169312169312171*G0_0_0 + 0.016931216931217*G0_0_1 - 0.0423280423280429*G0_0_2 - 0.0423280423280423*G0_1_0 - 0.0423280423280422*G0_1_1 - 0.0112874779541446*G0_1_2 - 0.0423280423280423*G0_2_0 - 0.0423280423280422*G0_2_1 - 0.0112874779541446*G0_2_2;
+    A[714] = -0.00282186948853629*G0_0_0 - 0.00282186948853628*G0_0_1 - 0.0134038800705463*G0_0_2 - 0.0134038800705468*G0_1_0 - 0.0134038800705467*G0_1_1 - 0.00282186948853607*G0_1_2 - 0.0134038800705468*G0_2_0 - 0.0134038800705468*G0_2_1 - 0.00282186948853606*G0_2_2;
+    A[715] = 0.00282186948853601*G0_0_2 + 0.00282186948853619*G0_1_0 + 0.00282186948853617*G0_1_1 - 0.0112874779541446*G0_1_2 + 0.00282186948853621*G0_2_0 + 0.0028218694885362*G0_2_1 - 0.0112874779541446*G0_2_2;
+    A[716] = 0.016931216931217*G0_0_0 - 0.0423280423280428*G0_0_1 + 0.016931216931217*G0_0_2 - 0.0423280423280422*G0_1_0 - 0.0112874779541445*G0_1_1 - 0.0423280423280422*G0_1_2 - 0.0423280423280423*G0_2_0 - 0.0112874779541445*G0_2_1 - 0.0423280423280422*G0_2_2;
+    A[717] = -0.00282186948853619*G0_0_0 - 0.0134038800705464*G0_0_1 - 0.00282186948853618*G0_0_2 - 0.0134038800705469*G0_1_0 - 0.00282186948853623*G0_1_1 - 0.0134038800705469*G0_1_2 - 0.0134038800705468*G0_2_0 - 0.00282186948853626*G0_2_1 - 0.0134038800705468*G0_2_2;
+    A[718] = 0.002821869488536*G0_0_1 + 0.00282186948853617*G0_1_0 - 0.0112874779541446*G0_1_1 + 0.00282186948853621*G0_1_2 + 0.0028218694885361*G0_2_0 - 0.0112874779541446*G0_2_1 + 0.00282186948853614*G0_2_2;
+    A[719] = -0.220105820105821*G0_0_0 - 0.160846560846561*G0_0_1 - 0.160846560846561*G0_0_2 - 0.0874779541446208*G0_1_0 - 0.118518518518518*G0_1_1 - 0.118518518518519*G0_1_2 - 0.0874779541446208*G0_2_0 - 0.118518518518519*G0_2_1 - 0.118518518518519*G0_2_2;
+    A[720] = 0.334391534391535*G0_0_0 + 0.167195767195767*G0_0_1 + 0.167195767195767*G0_0_2 + 0.167195767195767*G0_1_0 + 0.24973544973545*G0_1_1 + 0.24973544973545*G0_1_2 + 0.167195767195767*G0_2_0 + 0.24973544973545*G0_2_1 + 0.24973544973545*G0_2_2;
+    A[721] = -0.220105820105821*G0_0_0 - 0.0592592592592595*G0_0_1 - 0.0592592592592596*G0_0_2 - 0.1326278659612*G0_1_0 - 0.0902998236331573*G0_1_1 - 0.0902998236331574*G0_1_2 - 0.1326278659612*G0_2_0 - 0.0902998236331574*G0_2_1 - 0.0902998236331574*G0_2_2;
+    A[722] = 0.0225749559082893*G0_0_0 + 0.0423280423280419*G0_0_1 + 0.0423280423280419*G0_0_2 + 0.0423280423280421*G0_1_0 + 0.084656084656084*G0_1_1 + 0.0846560846560842*G0_1_2 + 0.0423280423280421*G0_2_0 + 0.084656084656084*G0_2_1 + 0.0846560846560842*G0_2_2;
+    A[723] = -0.00282186948853573*G0_0_1 - 0.00282186948853577*G0_0_2 - 0.00282186948853616*G0_1_0 + 0.0169312169312171*G0_1_1 + 0.016931216931217*G0_1_2 - 0.00282186948853613*G0_2_0 + 0.016931216931217*G0_2_1 + 0.016931216931217*G0_2_2;
+    A[724] = -0.00282186948853587*G0_0_1 - 0.00282186948853582*G0_0_2 - 0.00282186948853605*G0_1_0 + 0.0169312169312171*G0_1_1 + 0.016931216931217*G0_1_2 - 0.00282186948853608*G0_2_0 + 0.0169312169312171*G0_2_1 + 0.0169312169312171*G0_2_2;
+    A[725] = 0.022574955908289*G0_0_0 - 0.0197530864197533*G0_0_1 - 0.0197530864197533*G0_0_2 - 0.0197530864197535*G0_1_0 + 0.0225749559082888*G0_1_1 + 0.0225749559082891*G0_1_2 - 0.0197530864197535*G0_2_0 + 0.0225749559082889*G0_2_1 + 0.0225749559082891*G0_2_2;
+    A[726] = 0.00282186948853627*G0_0_1 + 0.00282186948853625*G0_0_2 + 0.00282186948853618*G0_1_0 + 0.0225749559082896*G0_1_1 + 0.0225749559082894*G0_1_2 + 0.00282186948853615*G0_2_0 + 0.0225749559082894*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[727] = 0.00282186948853634*G0_0_1 + 0.00282186948853632*G0_0_2 + 0.00282186948853608*G0_1_0 + 0.0225749559082893*G0_1_1 + 0.0225749559082893*G0_1_2 + 0.00282186948853611*G0_2_0 + 0.0225749559082893*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[728] = -0.0169312169312171*G0_0_0 + 0.0253968253968251*G0_0_1 + 0.16084656084656*G0_0_2 + 0.160846560846561*G0_1_0 + 0.118518518518518*G0_1_1 + 0.0677248677248675*G0_1_2 + 0.160846560846561*G0_2_0 + 0.118518518518518*G0_2_1 + 0.0677248677248675*G0_2_2;
+    A[729] = -0.0169312169312166*G0_0_0 - 0.0423280423280418*G0_0_1 - 0.177777777777778*G0_0_2 - 0.177777777777777*G0_1_0 - 0.084656084656084*G0_1_1 - 0.270899470899471*G0_1_2 - 0.177777777777777*G0_2_0 - 0.0846560846560841*G0_2_1 - 0.270899470899471*G0_2_2;
+    A[730] = 0.00564373897707242*G0_0_0 + 0.00282186948853587*G0_0_1 + 0.00282186948853634*G0_0_2 + 0.00282186948853617*G0_1_0 - 0.0169312169312171*G0_1_1 + 0.0677248677248679*G0_1_2 + 0.00282186948853616*G0_2_0 - 0.0169312169312171*G0_2_1 + 0.0677248677248679*G0_2_2;
+    A[731] = -0.0169312169312172*G0_0_0 + 0.16084656084656*G0_0_1 + 0.0253968253968251*G0_0_2 + 0.160846560846561*G0_1_0 + 0.0677248677248673*G0_1_1 + 0.118518518518518*G0_1_2 + 0.160846560846561*G0_2_0 + 0.0677248677248674*G0_2_1 + 0.118518518518518*G0_2_2;
+    A[732] = -0.0169312169312166*G0_0_0 - 0.177777777777778*G0_0_1 - 0.0423280423280419*G0_0_2 - 0.177777777777778*G0_1_0 - 0.270899470899471*G0_1_1 - 0.0846560846560841*G0_1_2 - 0.177777777777778*G0_2_0 - 0.270899470899471*G0_2_1 - 0.0846560846560841*G0_2_2;
+    A[733] = 0.00564373897707234*G0_0_0 + 0.00282186948853616*G0_0_1 + 0.00282186948853582*G0_0_2 + 0.00282186948853632*G0_1_0 + 0.0677248677248681*G0_1_1 - 0.0169312169312168*G0_1_2 + 0.0028218694885363*G0_2_0 + 0.0677248677248679*G0_2_1 - 0.0169312169312168*G0_2_2;
+    A[734] = -0.0451499118165784*G0_0_0 - 0.0225749559082894*G0_0_1 - 0.0225749559082894*G0_0_2 - 0.0225749559082888*G0_1_0 - 0.135449735449735*G0_1_1 - 0.135449735449735*G0_1_2 - 0.0225749559082887*G0_2_0 - 0.135449735449735*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[735] = -0.0253968253968256*G0_0_0 - 0.0253968253968256*G0_0_1 - 0.0253968253968256*G0_0_2 - 0.0077601410934744*G0_1_0 - 0.00776014109347441*G0_1_1 - 0.0077601410934744*G0_1_2 - 0.00776014109347439*G0_2_0 - 0.00776014109347439*G0_2_1 - 0.00776014109347439*G0_2_2;
+    A[736] = -0.0705467372134042*G0_0_0 - 0.0458553791887129*G0_1_0 - 0.0458553791887129*G0_2_0;
+    A[737] = 0.00776014109347442*G0_1_1 + 0.00776014109347443*G0_2_1;
+    A[738] = 0.00776014109347453*G0_1_2 + 0.00776014109347454*G0_2_2;
+    A[739] = -0.0112874779541446*G0_1_1 - 0.0112874779541447*G0_1_2 - 0.0112874779541446*G0_2_1 - 0.0112874779541447*G0_2_2;
+    A[740] = -0.00282186948853617*G0_1_1 - 0.002821869488536*G0_1_2 - 0.0028218694885362*G0_2_1 - 0.00282186948853601*G0_2_2;
+    A[741] = -0.0112874779541448*G0_1_1 - 0.0112874779541449*G0_1_2 - 0.0112874779541448*G0_2_1 - 0.0112874779541449*G0_2_2;
+    A[742] = 0.0225749559082893*G0_0_0 - 0.0790123456790129*G0_0_2 - 0.0790123456790124*G0_1_0 - 0.158024691358026*G0_1_2 - 0.0790123456790124*G0_2_0 - 0.158024691358026*G0_2_2;
+    A[743] = -0.0112874779541446*G0_0_0 + 0.0310405643738983*G0_0_2 + 0.0310405643738979*G0_1_0 + 0.0902998236331578*G0_1_2 + 0.0310405643738979*G0_2_0 + 0.0902998236331578*G0_2_2;
+    A[744] = -0.0112874779541449*G0_0_2 - 0.0112874779541448*G0_1_0 - 0.0451499118165791*G0_1_2 - 0.0112874779541448*G0_2_0 - 0.045149911816579*G0_2_2;
+    A[745] = 0.0225749559082892*G0_0_0 - 0.079012345679013*G0_0_1 - 0.0790123456790125*G0_1_0 - 0.158024691358026*G0_1_1 - 0.0790123456790125*G0_2_0 - 0.158024691358026*G0_2_1;
+    A[746] = -0.0112874779541446*G0_0_0 + 0.0310405643738982*G0_0_1 + 0.0310405643738979*G0_1_0 + 0.0902998236331577*G0_1_1 + 0.0310405643738979*G0_2_0 + 0.0902998236331577*G0_2_1;
+    A[747] = -0.0112874779541448*G0_0_1 - 0.0112874779541447*G0_1_0 - 0.0451499118165788*G0_1_1 - 0.0112874779541447*G0_2_0 - 0.0451499118165788*G0_2_1;
+    A[748] = -0.0225749559082894*G0_0_0 - 0.0225749559082894*G0_0_1 + 0.0112874779541449*G0_0_2 + 0.0112874779541445*G0_1_0 + 0.0112874779541445*G0_1_1 + 0.0112874779541445*G0_2_0 + 0.0112874779541445*G0_2_1;
+    A[749] = -0.0112874779541444*G0_0_0 - 0.0112874779541444*G0_0_1 + 0.00282186948853591*G0_0_2 + 0.00282186948853618*G0_1_0 + 0.00282186948853613*G0_1_1 + 0.00282186948853619*G0_2_0 + 0.00282186948853614*G0_2_1;
+    A[750] = 0.0112874779541447*G0_0_2 + 0.0112874779541448*G0_1_0 + 0.0112874779541448*G0_1_1 + 0.0112874779541448*G0_2_0 + 0.0112874779541448*G0_2_1;
+    A[751] = -0.0225749559082893*G0_0_0 + 0.0112874779541449*G0_0_1 - 0.0225749559082893*G0_0_2 + 0.0112874779541446*G0_1_0 + 0.0112874779541446*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0112874779541446*G0_2_2;
+    A[752] = -0.0112874779541446*G0_0_0 + 0.00282186948853593*G0_0_1 - 0.0112874779541446*G0_0_2 + 0.00282186948853617*G0_1_0 + 0.00282186948853612*G0_1_2 + 0.00282186948853619*G0_2_0 + 0.00282186948853615*G0_2_2;
+    A[753] = 0.0112874779541448*G0_0_1 + 0.0112874779541447*G0_1_0 + 0.0112874779541447*G0_1_2 + 0.0112874779541447*G0_2_0 + 0.0112874779541447*G0_2_2;
+    A[754] = 0.112874779541447*G0_0_0 + 0.0790123456790124*G0_0_1 + 0.0790123456790124*G0_0_2 + 0.0338624338624339*G0_1_0 + 0.0451499118165787*G0_1_1 + 0.0451499118165786*G0_1_2 + 0.0338624338624339*G0_2_0 + 0.0451499118165787*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[755] = -0.220105820105821*G0_0_0 - 0.1326278659612*G0_0_1 - 0.1326278659612*G0_0_2 - 0.0592592592592595*G0_1_0 - 0.0902998236331573*G0_1_1 - 0.0902998236331573*G0_1_2 - 0.0592592592592595*G0_2_0 - 0.0902998236331574*G0_2_1 - 0.0902998236331574*G0_2_2;
+    A[756] = 0.203174603174604*G0_0_0 + 0.079012345679013*G0_0_1 + 0.079012345679013*G0_0_2 + 0.079012345679013*G0_1_0 + 0.158024691358026*G0_1_1 + 0.158024691358026*G0_1_2 + 0.079012345679013*G0_2_0 + 0.158024691358026*G0_2_1 + 0.158024691358025*G0_2_2;
+    A[757] = -0.0451499118165785*G0_0_0 - 0.0112874779541443*G0_0_1 - 0.0112874779541446*G0_0_2 - 0.0112874779541445*G0_1_0 - 0.112874779541446*G0_1_1 - 0.112874779541446*G0_1_2 - 0.0112874779541444*G0_2_0 - 0.112874779541446*G0_2_1 - 0.112874779541446*G0_2_2;
+    A[758] = -0.0112874779541448*G0_0_1 - 0.0112874779541448*G0_0_2 - 0.0112874779541446*G0_1_0 + 0.0225749559082893*G0_1_1 + 0.0225749559082893*G0_1_2 - 0.0112874779541446*G0_2_0 + 0.0225749559082893*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[759] = -0.0112874779541449*G0_0_1 - 0.0112874779541448*G0_0_2 - 0.0112874779541451*G0_1_0 + 0.022574955908289*G0_1_1 + 0.0225749559082891*G0_1_2 - 0.0112874779541451*G0_2_0 + 0.022574955908289*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[760] = -0.0451499118165782*G0_0_0 + 0.011287477954145*G0_0_1 + 0.011287477954145*G0_0_2 + 0.0112874779541448*G0_1_0 + 0.0112874779541448*G0_2_0;
+    A[761] = 0.0112874779541444*G0_0_1 + 0.0112874779541445*G0_0_2 + 0.0112874779541446*G0_1_0 + 0.0112874779541446*G0_2_0;
+    A[762] = 0.0112874779541444*G0_0_1 + 0.0112874779541444*G0_0_2 + 0.011287477954145*G0_1_0 + 0.011287477954145*G0_2_0;
+    A[763] = 0.0677248677248679*G0_0_0 + 0.0112874779541449*G0_0_1 - 0.0338624338624334*G0_0_2 - 0.0338624338624336*G0_1_0 - 0.0225749559082891*G0_1_1 - 0.0338624338624336*G0_2_0 - 0.0225749559082891*G0_2_1;
+    A[764] = -0.0677248677248679*G0_0_0 + 0.0112874779541442*G0_0_1 + 0.101587301587301*G0_0_2 + 0.101587301587302*G0_1_0 + 0.112874779541446*G0_1_1 + 0.101587301587302*G0_2_0 + 0.112874779541446*G0_2_1;
+    A[765] = 0.0225749559082891*G0_0_0 + 0.0112874779541449*G0_0_1 - 0.0338624338624341*G0_0_2 - 0.0338624338624341*G0_1_0 - 0.022574955908289*G0_1_1 - 0.0338624338624341*G0_2_0 - 0.022574955908289*G0_2_1;
+    A[766] = 0.0677248677248678*G0_0_0 - 0.0338624338624335*G0_0_1 + 0.0112874779541448*G0_0_2 - 0.0338624338624337*G0_1_0 - 0.0225749559082891*G0_1_2 - 0.0338624338624338*G0_2_0 - 0.0225749559082891*G0_2_2;
+    A[767] = -0.0677248677248677*G0_0_0 + 0.101587301587302*G0_0_1 + 0.0112874779541445*G0_0_2 + 0.101587301587302*G0_1_0 + 0.112874779541446*G0_1_2 + 0.101587301587302*G0_2_0 + 0.112874779541446*G0_2_2;
+    A[768] = 0.0225749559082892*G0_0_0 - 0.033862433862434*G0_0_1 + 0.0112874779541448*G0_0_2 - 0.033862433862434*G0_1_0 - 0.0225749559082894*G0_1_2 - 0.033862433862434*G0_2_0 - 0.0225749559082893*G0_2_2;
+    A[769] = 0.0902998236331566*G0_0_0;
+    A[770] = 0.0183421516754852*G0_0_0 + 0.0183421516754852*G0_0_1 + 0.0183421516754852*G0_0_2 + 0.0183421516754849*G0_1_0 + 0.0183421516754848*G0_1_1 + 0.0183421516754849*G0_1_2 + 0.0183421516754849*G0_2_0 + 0.0183421516754848*G0_2_1 + 0.0183421516754848*G0_2_2;
+    A[771] = 0.0493827160493828*G0_0_0 + 0.00705467372134029*G0_1_0 + 0.0070546737213405*G0_2_0;
+    A[772] = 0.00705467372134047*G0_0_1 - 0.0183421516754849*G0_1_1 + 0.00705467372134043*G0_2_1;
+    A[773] = 0.00705467372134042*G0_0_2 + 0.00705467372134033*G0_1_2 - 0.0183421516754851*G0_2_2;
+    A[774] = -0.0677248677248677*G0_0_1 - 0.0225749559082894*G0_0_2 + 0.0225749559082892*G0_1_1 + 0.0112874779541446*G0_1_2 - 0.0338624338624341*G0_2_1 - 0.0225749559082894*G0_2_2;
+    A[775] = -0.0846560846560849*G0_0_1 - 0.0846560846560847*G0_0_2 - 0.0169312169312168*G0_1_1 - 0.019753086419753*G0_1_2 - 0.019753086419753*G0_2_1 - 0.016931216931217*G0_2_2;
+    A[776] = -0.0225749559082894*G0_0_1 - 0.067724867724868*G0_0_2 - 0.0225749559082893*G0_1_1 - 0.0338624338624339*G0_1_2 + 0.0112874779541447*G0_2_1 + 0.0225749559082895*G0_2_2;
+    A[777] = -0.0677248677248682*G0_0_0 + 0.0112874779541444*G0_0_2 + 0.203174603174603*G0_1_0 + 0.112874779541446*G0_1_2 + 0.101587301587301*G0_2_0 + 0.112874779541446*G0_2_2;
+    A[778] = 0.118518518518519*G0_0_0 + 0.0931216931216934*G0_0_2 + 0.0507936507936509*G0_1_0 + 0.186243386243386*G0_1_2 - 0.0423280423280424*G0_2_0 - 0.084656084656085*G0_2_2;
+    A[779] = -0.0225749559082894*G0_0_0 - 0.033862433862434*G0_0_2 - 0.0225749559082893*G0_1_0 - 0.0677248677248678*G0_1_2 + 0.0112874779541447*G0_2_0 + 0.067724867724868*G0_2_2;
+    A[780] = -0.067724867724868*G0_0_0 + 0.0112874779541444*G0_0_1 + 0.101587301587301*G0_1_0 + 0.112874779541446*G0_1_1 + 0.203174603174603*G0_2_0 + 0.112874779541446*G0_2_1;
+    A[781] = 0.118518518518519*G0_0_0 + 0.0931216931216932*G0_0_1 - 0.0423280423280426*G0_1_0 - 0.084656084656085*G0_1_1 + 0.0507936507936509*G0_2_0 + 0.186243386243386*G0_2_1;
+    A[782] = -0.0225749559082894*G0_0_0 - 0.0338624338624342*G0_0_1 + 0.0112874779541446*G0_1_0 + 0.0677248677248677*G0_1_1 - 0.0225749559082895*G0_2_0 - 0.0677248677248679*G0_2_1;
+    A[783] = -0.0225749559082894*G0_0_0 - 0.0225749559082894*G0_0_1 - 0.011287477954145*G0_0_2 - 0.0225749559082891*G0_1_0 - 0.0225749559082892*G0_1_1 - 0.0112874779541443*G0_1_2 - 0.0112874779541445*G0_2_0 - 0.0112874779541445*G0_2_1;
+    A[784] = 0.0169312169312175*G0_0_0 + 0.0169312169312173*G0_0_1 - 0.00282186948853541*G0_0_2 + 0.0169312169312175*G0_1_0 + 0.0169312169312175*G0_1_1 - 0.00282186948853636*G0_1_2 - 0.0028218694885357*G0_2_0 - 0.00282186948853573*G0_2_1;
+    A[785] = 0.0225749559082894*G0_0_0 + 0.0225749559082894*G0_0_1 - 0.0112874779541448*G0_0_2 + 0.0225749559082894*G0_1_0 + 0.0225749559082893*G0_1_1 - 0.0112874779541444*G0_1_2 - 0.0112874779541446*G0_2_0 - 0.0112874779541447*G0_2_1;
+    A[786] = -0.0225749559082895*G0_0_0 - 0.011287477954145*G0_0_1 - 0.0225749559082895*G0_0_2 - 0.0112874779541449*G0_1_0 - 0.0112874779541449*G0_1_2 - 0.0225749559082892*G0_2_0 - 0.0112874779541443*G0_2_1 - 0.0225749559082891*G0_2_2;
+    A[787] = 0.016931216931217*G0_0_0 - 0.00282186948853567*G0_0_1 + 0.016931216931217*G0_0_2 - 0.00282186948853604*G0_1_0 - 0.00282186948853597*G0_1_2 + 0.0169312169312168*G0_2_0 - 0.00282186948853633*G0_2_1 + 0.0169312169312168*G0_2_2;
+    A[788] = 0.0225749559082894*G0_0_0 - 0.0112874779541448*G0_0_1 + 0.0225749559082894*G0_0_2 - 0.0112874779541446*G0_1_0 - 0.0112874779541446*G0_1_2 + 0.0225749559082895*G0_2_0 - 0.0112874779541445*G0_2_1 + 0.0225749559082895*G0_2_2;
+    A[789] = -0.0451499118165789*G0_0_0 - 0.0564373897707233*G0_0_1 - 0.0564373897707233*G0_0_2 - 0.0564373897707228*G0_1_0 - 0.0677248677248679*G0_1_1 - 0.0677248677248679*G0_1_2 - 0.0564373897707228*G0_2_0 - 0.0677248677248676*G0_2_1 - 0.0677248677248676*G0_2_2;
+    A[790] = 0.0225749559082893*G0_0_0 + 0.0423280423280422*G0_0_1 + 0.0423280423280421*G0_0_2 + 0.0423280423280419*G0_1_0 + 0.084656084656084*G0_1_1 + 0.084656084656084*G0_1_2 + 0.0423280423280419*G0_2_0 + 0.0846560846560842*G0_2_1 + 0.0846560846560842*G0_2_2;
+    A[791] = -0.0451499118165785*G0_0_0 - 0.0112874779541445*G0_0_1 - 0.0112874779541444*G0_0_2 - 0.0112874779541443*G0_1_0 - 0.112874779541446*G0_1_1 - 0.112874779541446*G0_1_2 - 0.0112874779541446*G0_2_0 - 0.112874779541446*G0_2_1 - 0.112874779541446*G0_2_2;
+    A[792] = 0.632098765432099*G0_0_0 + 0.27089947089947*G0_0_1 + 0.270899470899471*G0_0_2 + 0.27089947089947*G0_1_0 + 0.541798941798942*G0_1_1 + 0.27089947089947*G0_1_2 + 0.270899470899471*G0_2_0 + 0.27089947089947*G0_2_1 + 0.541798941798942*G0_2_2;
+    A[793] = -0.135449735449736*G0_0_0 + 0.225749559082893*G0_0_1 + 0.0677248677248675*G0_0_2 - 0.0451499118165787*G0_1_0 - 0.135449735449736*G0_1_1 - 0.0677248677248683*G0_1_2 - 0.0677248677248682*G0_2_0 + 0.0677248677248676*G0_2_1;
+    A[794] = -0.135449735449736*G0_0_0 + 0.0677248677248676*G0_0_1 + 0.225749559082892*G0_0_2 - 0.0677248677248679*G0_1_0 + 0.0677248677248675*G0_1_2 - 0.0451499118165783*G0_2_0 - 0.0677248677248678*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[795] = 0.090299823633157*G0_0_0 + 0.0451499118165789*G0_0_1 + 0.0451499118165791*G0_0_2 + 0.0451499118165789*G0_1_0 + 0.0225749559082901*G0_1_2 + 0.0451499118165787*G0_2_0 + 0.0225749559082891*G0_2_1;
+    A[796] = 0.135449735449736*G0_0_0 + 0.0451499118165785*G0_0_1 + 0.0677248677248674*G0_0_2 + 0.0451499118165786*G0_1_0 + 0.0225749559082888*G0_1_2 + 0.0677248677248681*G0_2_0 + 0.0225749559082897*G0_2_1;
+    A[797] = 0.135449735449736*G0_0_0 + 0.0677248677248676*G0_0_1 + 0.0451499118165787*G0_0_2 + 0.067724867724868*G0_1_0 + 0.0225749559082887*G0_1_2 + 0.0451499118165784*G0_2_0 + 0.0225749559082888*G0_2_1;
+    A[798] = 0.0451499118165789*G0_0_0 + 0.0902998236331567*G0_0_1 + 0.0451499118165789*G0_0_2 + 0.0902998236331565*G0_1_0 + 0.135449735449735*G0_1_1 + 0.0677248677248683*G0_1_2 + 0.0451499118165783*G0_2_0 + 0.0677248677248677*G0_2_1;
+    A[799] = 0.0451499118165791*G0_0_0 - 0.27089947089947*G0_0_1 - 0.135449735449735*G0_0_2 - 0.27089947089947*G0_1_0 - 0.541798941798942*G0_1_1 - 0.27089947089947*G0_1_2 - 0.135449735449735*G0_2_0 - 0.27089947089947*G0_2_1;
+    A[800] = -0.135449735449736*G0_0_0 - 0.0677248677248676*G0_0_1 + 0.0451499118165783*G0_0_2 - 0.0677248677248682*G0_1_0 + 0.0677248677248673*G0_1_2 + 0.0451499118165782*G0_2_0 + 0.0677248677248678*G0_2_1;
+    A[801] = 0.0451499118165789*G0_0_0 + 0.0451499118165786*G0_0_1 + 0.0902998236331567*G0_0_2 + 0.0451499118165787*G0_1_0 + 0.0677248677248675*G0_1_2 + 0.0902998236331567*G0_2_0 + 0.0677248677248673*G0_2_1 + 0.135449735449735*G0_2_2;
+    A[802] = 0.0451499118165786*G0_0_0 - 0.135449735449735*G0_0_1 - 0.270899470899471*G0_0_2 - 0.135449735449735*G0_1_0 - 0.27089947089947*G0_1_2 - 0.270899470899471*G0_2_0 - 0.27089947089947*G0_2_1 - 0.541798941798942*G0_2_2;
+    A[803] = -0.135449735449736*G0_0_0 + 0.0451499118165786*G0_0_1 - 0.0677248677248675*G0_0_2 + 0.0451499118165787*G0_1_0 + 0.0677248677248683*G0_1_2 - 0.0677248677248678*G0_2_0 + 0.067724867724868*G0_2_1;
+    A[804] = -0.722398589065256*G0_0_0 - 0.316049382716049*G0_0_1 - 0.316049382716049*G0_0_2 - 0.316049382716049*G0_1_0 - 0.135449735449735*G0_1_2 - 0.316049382716049*G0_2_0 - 0.135449735449735*G0_2_1;
+    A[805] = 0.0183421516754849*G0_0_0 + 0.018342151675485*G0_0_1 + 0.018342151675485*G0_0_2 + 0.0183421516754853*G0_1_0 + 0.0183421516754853*G0_1_1 + 0.0183421516754853*G0_1_2 + 0.018342151675485*G0_2_0 + 0.018342151675485*G0_2_1 + 0.018342151675485*G0_2_2;
+    A[806] = -0.0183421516754851*G0_0_0 + 0.00705467372134041*G0_1_0 + 0.00705467372134037*G0_2_0;
+    A[807] = 0.00705467372134034*G0_0_1 + 0.0493827160493827*G0_1_1 + 0.00705467372134039*G0_2_1;
+    A[808] = 0.0070546737213404*G0_0_2 + 0.00705467372134051*G0_1_2 - 0.0183421516754849*G0_2_2;
+    A[809] = 0.203174603174603*G0_0_1 + 0.112874779541446*G0_0_2 - 0.0677248677248675*G0_1_1 + 0.0112874779541444*G0_1_2 + 0.101587301587302*G0_2_1 + 0.112874779541446*G0_2_2;
+    A[810] = 0.050793650793651*G0_0_1 + 0.186243386243387*G0_0_2 + 0.118518518518518*G0_1_1 + 0.0931216931216937*G0_1_2 - 0.0423280423280426*G0_2_1 - 0.0846560846560845*G0_2_2;
+    A[811] = -0.022574955908289*G0_0_1 - 0.0677248677248676*G0_0_2 - 0.0225749559082891*G0_1_1 - 0.0338624338624341*G0_1_2 + 0.011287477954145*G0_2_1 + 0.0677248677248678*G0_2_2;
+    A[812] = 0.0225749559082894*G0_0_0 + 0.0112874779541446*G0_0_2 - 0.0677248677248678*G0_1_0 - 0.0225749559082894*G0_1_2 - 0.0338624338624338*G0_2_0 - 0.0225749559082892*G0_2_2;
+    A[813] = -0.0169312169312171*G0_0_0 - 0.0197530864197531*G0_0_2 - 0.0846560846560847*G0_1_0 - 0.0846560846560847*G0_1_2 - 0.0197530864197533*G0_2_0 - 0.0169312169312172*G0_2_2;
+    A[814] = -0.022574955908289*G0_0_0 - 0.0338624338624338*G0_0_2 - 0.0225749559082891*G0_1_0 - 0.0677248677248678*G0_1_2 + 0.011287477954145*G0_2_0 + 0.0225749559082894*G0_2_2;
+    A[815] = 0.0677248677248677*G0_0_0 + 0.0112874779541446*G0_0_1 - 0.0338624338624341*G0_1_0 - 0.0225749559082894*G0_1_1 - 0.0677248677248677*G0_2_0 - 0.0225749559082893*G0_2_1;
+    A[816] = -0.0846560846560848*G0_0_0 - 0.0423280423280427*G0_0_1 + 0.0931216931216935*G0_1_0 + 0.118518518518519*G0_1_1 + 0.186243386243386*G0_2_0 + 0.0507936507936506*G0_2_1;
+    A[817] = 0.112874779541446*G0_0_0 + 0.101587301587302*G0_0_1 + 0.0112874779541442*G0_1_0 - 0.0677248677248679*G0_1_1 + 0.112874779541446*G0_2_0 + 0.203174603174603*G0_2_1;
+    A[818] = -0.0225749559082893*G0_0_0 - 0.0225749559082895*G0_0_1 - 0.0112874779541446*G0_0_2 - 0.0225749559082897*G0_1_0 - 0.0225749559082898*G0_1_1 - 0.0112874779541454*G0_1_2 - 0.0112874779541447*G0_2_0 - 0.0112874779541446*G0_2_1;
+    A[819] = 0.0169312169312172*G0_0_0 + 0.0169312169312174*G0_0_1 - 0.0028218694885361*G0_0_2 + 0.0169312169312176*G0_1_0 + 0.0169312169312177*G0_1_1 - 0.0028218694885351*G0_1_2 - 0.00282186948853591*G0_2_0 - 0.00282186948853583*G0_2_1;
+    A[820] = 0.0225749559082891*G0_0_0 + 0.022574955908289*G0_0_1 - 0.0112874779541447*G0_0_2 + 0.0225749559082891*G0_1_0 + 0.0225749559082892*G0_1_1 - 0.0112874779541451*G0_1_2 - 0.0112874779541449*G0_2_0 - 0.0112874779541449*G0_2_1;
+    A[821] = -0.0677248677248679*G0_0_0 - 0.0564373897707231*G0_0_1 - 0.0677248677248679*G0_0_2 - 0.0564373897707235*G0_1_0 - 0.045149911816579*G0_1_1 - 0.0564373897707235*G0_1_2 - 0.0677248677248677*G0_2_0 - 0.056437389770723*G0_2_1 - 0.0677248677248677*G0_2_2;
+    A[822] = 0.0846560846560848*G0_0_0 + 0.0423280423280421*G0_0_1 + 0.0846560846560848*G0_0_2 + 0.0423280423280422*G0_1_0 + 0.0225749559082896*G0_1_1 + 0.0423280423280422*G0_1_2 + 0.0846560846560847*G0_2_0 + 0.0423280423280422*G0_2_1 + 0.0846560846560847*G0_2_2;
+    A[823] = -0.112874779541446*G0_0_0 - 0.0112874779541444*G0_0_1 - 0.112874779541446*G0_0_2 - 0.0112874779541444*G0_1_0 - 0.0451499118165784*G0_1_1 - 0.0112874779541444*G0_1_2 - 0.112874779541446*G0_2_0 - 0.0112874779541445*G0_2_1 - 0.112874779541446*G0_2_2;
+    A[824] = -0.011287477954145*G0_0_1 - 0.011287477954145*G0_0_2 - 0.0112874779541452*G0_1_0 - 0.0225749559082896*G0_1_1 - 0.0225749559082896*G0_1_2 - 0.0112874779541447*G0_2_0 - 0.0225749559082894*G0_2_1 - 0.0225749559082895*G0_2_2;
+    A[825] = -0.00282186948853616*G0_0_1 - 0.00282186948853613*G0_0_2 - 0.00282186948853573*G0_1_0 + 0.0169312169312171*G0_1_1 + 0.016931216931217*G0_1_2 - 0.00282186948853577*G0_2_0 + 0.016931216931217*G0_2_1 + 0.016931216931217*G0_2_2;
+    A[826] = -0.0112874779541446*G0_0_1 - 0.0112874779541446*G0_0_2 - 0.0112874779541448*G0_1_0 + 0.0225749559082893*G0_1_1 + 0.0225749559082893*G0_1_2 - 0.0112874779541448*G0_2_0 + 0.0225749559082893*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[827] = -0.135449735449736*G0_0_0 - 0.0451499118165787*G0_0_1 - 0.0677248677248682*G0_0_2 + 0.225749559082893*G0_1_0 - 0.135449735449736*G0_1_1 + 0.0677248677248676*G0_1_2 + 0.0677248677248675*G0_2_0 - 0.0677248677248683*G0_2_1;
+    A[828] = 0.541798941798943*G0_0_0 + 0.270899470899472*G0_0_1 + 0.270899470899472*G0_0_2 + 0.270899470899472*G0_1_0 + 0.6320987654321*G0_1_1 + 0.270899470899472*G0_1_2 + 0.270899470899472*G0_2_0 + 0.270899470899472*G0_2_1 + 0.541798941798943*G0_2_2;
+    A[829] = -0.0677248677248679*G0_0_1 + 0.0677248677248679*G0_0_2 + 0.0677248677248676*G0_1_0 - 0.135449735449736*G0_1_1 + 0.225749559082892*G0_1_2 - 0.0677248677248675*G0_2_0 - 0.0451499118165784*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[830] = 0.135449735449736*G0_0_0 + 0.0902998236331572*G0_0_1 + 0.0677248677248681*G0_0_2 + 0.0902998236331573*G0_1_0 + 0.0451499118165792*G0_1_1 + 0.0451499118165792*G0_1_2 + 0.0677248677248674*G0_2_0 + 0.0451499118165782*G0_2_1;
+    A[831] = -0.541798941798943*G0_0_0 - 0.270899470899471*G0_0_1 - 0.270899470899471*G0_0_2 - 0.270899470899472*G0_1_0 + 0.0451499118165784*G0_1_1 - 0.135449735449736*G0_1_2 - 0.270899470899472*G0_2_0 - 0.135449735449735*G0_2_1;
+    A[832] = -0.0677248677248683*G0_0_1 + 0.0677248677248675*G0_0_2 - 0.0677248677248673*G0_1_0 - 0.135449735449736*G0_1_1 + 0.0451499118165784*G0_1_2 + 0.0677248677248677*G0_2_0 + 0.0451499118165785*G0_2_1;
+    A[833] = 0.0451499118165788*G0_0_1 + 0.0225749559082901*G0_0_2 + 0.0451499118165798*G0_1_0 + 0.0902998236331573*G0_1_1 + 0.0451499118165795*G0_1_2 + 0.0225749559082892*G0_2_0 + 0.045149911816578*G0_2_1;
+    A[834] = 0.0451499118165785*G0_0_1 + 0.0225749559082893*G0_0_2 + 0.0451499118165782*G0_1_0 + 0.135449735449736*G0_1_1 + 0.0677248677248678*G0_1_2 + 0.0225749559082896*G0_2_0 + 0.0677248677248681*G0_2_1;
+    A[835] = 0.0677248677248678*G0_0_1 + 0.0225749559082887*G0_0_2 + 0.0677248677248671*G0_1_0 + 0.135449735449736*G0_1_1 + 0.0451499118165779*G0_1_2 + 0.0225749559082892*G0_2_0 + 0.0451499118165783*G0_2_1;
+    A[836] = 0.0451499118165789*G0_0_1 + 0.0677248677248675*G0_0_2 + 0.0451499118165788*G0_1_0 + 0.0451499118165786*G0_1_1 + 0.0902998236331564*G0_1_2 + 0.0677248677248674*G0_2_0 + 0.0902998236331569*G0_2_1 + 0.135449735449734*G0_2_2;
+    A[837] = 0.0451499118165785*G0_0_1 + 0.0677248677248677*G0_0_2 + 0.0451499118165787*G0_1_0 - 0.135449735449736*G0_1_1 - 0.0677248677248679*G0_1_2 + 0.0677248677248681*G0_2_0 - 0.0677248677248678*G0_2_1;
+    A[838] = -0.135449735449736*G0_0_1 - 0.270899470899471*G0_0_2 - 0.135449735449736*G0_1_0 + 0.0451499118165788*G0_1_1 - 0.270899470899472*G0_1_2 - 0.270899470899471*G0_2_0 - 0.270899470899471*G0_2_1 - 0.541798941798942*G0_2_2;
+    A[839] = -0.31604938271605*G0_0_1 - 0.135449735449735*G0_0_2 - 0.31604938271605*G0_1_0 - 0.722398589065257*G0_1_1 - 0.316049382716048*G0_1_2 - 0.135449735449735*G0_2_0 - 0.31604938271605*G0_2_1;
+    A[840] = 0.0183421516754852*G0_0_0 + 0.0183421516754853*G0_0_1 + 0.0183421516754853*G0_0_2 + 0.0183421516754852*G0_1_0 + 0.0183421516754852*G0_1_1 + 0.0183421516754852*G0_1_2 + 0.0183421516754854*G0_2_0 + 0.0183421516754855*G0_2_1 + 0.0183421516754855*G0_2_2;
+    A[841] = -0.0183421516754848*G0_0_0 + 0.00705467372134062*G0_1_0 + 0.00705467372134052*G0_2_0;
+    A[842] = 0.00705467372134016*G0_0_1 - 0.0183421516754851*G0_1_1 + 0.00705467372134029*G0_2_1;
+    A[843] = 0.00705467372134039*G0_0_2 + 0.00705467372134029*G0_1_2 + 0.0493827160493827*G0_2_2;
+    A[844] = -0.0677248677248676*G0_0_1 - 0.0225749559082896*G0_0_2 + 0.0677248677248678*G0_1_1 + 0.0112874779541444*G0_1_2 - 0.0338624338624338*G0_2_1 - 0.0225749559082895*G0_2_2;
+    A[845] = 0.186243386243386*G0_0_1 + 0.0507936507936512*G0_0_2 - 0.0846560846560848*G0_1_1 - 0.0423280423280424*G0_1_2 + 0.0931216931216931*G0_2_1 + 0.118518518518519*G0_2_2;
+    A[846] = 0.112874779541446*G0_0_1 + 0.203174603174603*G0_0_2 + 0.112874779541446*G0_1_1 + 0.101587301587302*G0_1_2 + 0.0112874779541444*G0_2_1 - 0.0677248677248681*G0_2_2;
+    A[847] = 0.0677248677248677*G0_0_0 + 0.0112874779541451*G0_0_2 - 0.067724867724868*G0_1_0 - 0.022574955908289*G0_1_2 - 0.0338624338624342*G0_2_0 - 0.0225749559082892*G0_2_2;
+    A[848] = -0.0846560846560844*G0_0_0 - 0.0423280423280429*G0_0_2 + 0.186243386243387*G0_1_0 + 0.0507936507936505*G0_1_2 + 0.0931216931216938*G0_2_0 + 0.118518518518519*G0_2_2;
+    A[849] = 0.112874779541446*G0_0_0 + 0.101587301587302*G0_0_2 + 0.112874779541446*G0_1_0 + 0.203174603174604*G0_1_2 + 0.0112874779541444*G0_2_0 - 0.0677248677248676*G0_2_2;
+    A[850] = 0.0225749559082892*G0_0_0 + 0.011287477954145*G0_0_1 - 0.0338624338624341*G0_1_0 - 0.0225749559082891*G0_1_1 - 0.067724867724868*G0_2_0 - 0.0225749559082892*G0_2_1;
+    A[851] = -0.0169312169312166*G0_0_0 - 0.0197530864197533*G0_0_1 - 0.0197530864197529*G0_1_0 - 0.016931216931217*G0_1_1 - 0.0846560846560844*G0_2_0 - 0.0846560846560847*G0_2_1;
+    A[852] = -0.0225749559082898*G0_0_0 - 0.0338624338624337*G0_0_1 + 0.0112874779541443*G0_1_0 + 0.0225749559082892*G0_1_1 - 0.0225749559082896*G0_2_0 - 0.0677248677248677*G0_2_1;
+    A[853] = -0.0677248677248681*G0_0_0 - 0.0677248677248681*G0_0_1 - 0.0564373897707237*G0_0_2 - 0.0677248677248678*G0_1_0 - 0.0677248677248678*G0_1_1 - 0.0564373897707236*G0_1_2 - 0.0564373897707236*G0_2_0 - 0.0564373897707236*G0_2_1 - 0.0451499118165797*G0_2_2;
+    A[854] = 0.084656084656085*G0_0_0 + 0.0846560846560851*G0_0_1 + 0.042328042328043*G0_0_2 + 0.0846560846560844*G0_1_0 + 0.0846560846560845*G0_1_1 + 0.0423280423280427*G0_1_2 + 0.0423280423280426*G0_2_0 + 0.0423280423280427*G0_2_1 + 0.0225749559082906*G0_2_2;
+    A[855] = -0.112874779541446*G0_0_0 - 0.112874779541446*G0_0_1 - 0.0112874779541449*G0_0_2 - 0.112874779541446*G0_1_0 - 0.112874779541446*G0_1_1 - 0.0112874779541446*G0_1_2 - 0.0112874779541444*G0_2_0 - 0.0112874779541444*G0_2_1 - 0.0451499118165789*G0_2_2;
+    A[856] = -0.0225749559082894*G0_0_0 - 0.011287477954145*G0_0_1 - 0.0225749559082893*G0_0_2 - 0.0112874779541446*G0_1_0 - 0.0112874779541446*G0_1_2 - 0.0225749559082896*G0_2_0 - 0.0112874779541455*G0_2_1 - 0.0225749559082897*G0_2_2;
+    A[857] = 0.0169312169312169*G0_0_0 - 0.00282186948853602*G0_0_1 + 0.0169312169312169*G0_0_2 - 0.00282186948853599*G0_1_0 - 0.00282186948853603*G0_1_2 + 0.0169312169312171*G0_2_0 - 0.00282186948853552*G0_2_1 + 0.0169312169312171*G0_2_2;
+    A[858] = 0.0225749559082896*G0_0_0 - 0.0112874779541445*G0_0_1 + 0.0225749559082896*G0_0_2 - 0.0112874779541444*G0_1_0 - 0.0112874779541444*G0_1_2 + 0.0225749559082894*G0_2_0 - 0.0112874779541447*G0_2_1 + 0.0225749559082895*G0_2_2;
+    A[859] = -0.0112874779541448*G0_0_1 - 0.0112874779541448*G0_0_2 - 0.011287477954145*G0_1_0 - 0.0225749559082893*G0_1_1 - 0.0225749559082893*G0_1_2 - 0.0112874779541454*G0_2_0 - 0.0225749559082896*G0_2_1 - 0.0225749559082896*G0_2_2;
+    A[860] = -0.00282186948853605*G0_0_1 - 0.00282186948853608*G0_0_2 - 0.00282186948853587*G0_1_0 + 0.0169312169312171*G0_1_1 + 0.0169312169312171*G0_1_2 - 0.00282186948853582*G0_2_0 + 0.016931216931217*G0_2_1 + 0.016931216931217*G0_2_2;
+    A[861] = -0.0112874779541451*G0_0_1 - 0.0112874779541451*G0_0_2 - 0.0112874779541449*G0_1_0 + 0.022574955908289*G0_1_1 + 0.022574955908289*G0_1_2 - 0.0112874779541447*G0_2_0 + 0.0225749559082891*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[862] = -0.135449735449736*G0_0_0 - 0.0677248677248679*G0_0_1 - 0.0451499118165783*G0_0_2 + 0.0677248677248676*G0_1_0 - 0.0677248677248678*G0_1_2 + 0.225749559082892*G0_2_0 + 0.0677248677248675*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[863] = 0.0677248677248676*G0_0_1 - 0.0677248677248675*G0_0_2 - 0.0677248677248679*G0_1_0 - 0.135449735449736*G0_1_1 - 0.0451499118165784*G0_1_2 + 0.0677248677248679*G0_2_0 + 0.225749559082892*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[864] = 0.541798941798942*G0_0_0 + 0.270899470899471*G0_0_1 + 0.270899470899471*G0_0_2 + 0.270899470899471*G0_1_0 + 0.541798941798943*G0_1_1 + 0.270899470899471*G0_1_2 + 0.270899470899471*G0_2_0 + 0.270899470899471*G0_2_1 + 0.632098765432098*G0_2_2;
+    A[865] = 0.135449735449736*G0_0_0 + 0.0677248677248685*G0_0_1 + 0.0902998236331574*G0_0_2 + 0.0677248677248676*G0_1_0 + 0.0451499118165784*G0_1_2 + 0.0902998236331575*G0_2_0 + 0.0451499118165798*G0_2_1 + 0.0451499118165793*G0_2_2;
+    A[866] = 0.0677248677248672*G0_0_1 - 0.0677248677248682*G0_0_2 + 0.0677248677248679*G0_1_0 + 0.0451499118165782*G0_1_2 - 0.0677248677248679*G0_2_0 + 0.0451499118165777*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[867] = -0.541798941798942*G0_0_0 - 0.270899470899471*G0_0_1 - 0.270899470899471*G0_0_2 - 0.270899470899471*G0_1_0 - 0.135449735449735*G0_1_2 - 0.27089947089947*G0_2_0 - 0.135449735449736*G0_2_1 + 0.0451499118165786*G0_2_2;
+    A[868] = 0.0677248677248683*G0_0_1 + 0.0451499118165791*G0_0_2 + 0.0677248677248681*G0_1_0 + 0.135449735449735*G0_1_1 + 0.0902998236331569*G0_1_2 + 0.0451499118165799*G0_2_0 + 0.0902998236331575*G0_2_1 + 0.0451499118165792*G0_2_2;
+    A[869] = 0.0677248677248678*G0_0_1 + 0.045149911816579*G0_0_2 + 0.0677248677248679*G0_1_0 - 0.0677248677248673*G0_1_2 + 0.0451499118165781*G0_2_0 - 0.0677248677248676*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[870] = -0.270899470899471*G0_0_1 - 0.135449735449737*G0_0_2 - 0.270899470899471*G0_1_0 - 0.541798941798943*G0_1_1 - 0.270899470899471*G0_1_2 - 0.135449735449736*G0_2_0 - 0.270899470899471*G0_2_1 + 0.0451499118165778*G0_2_2;
+    A[871] = 0.0225749559082894*G0_0_1 + 0.0451499118165787*G0_0_2 + 0.0225749559082895*G0_1_0 + 0.0451499118165786*G0_1_2 + 0.0451499118165793*G0_2_0 + 0.0451499118165791*G0_2_1 + 0.0902998236331574*G0_2_2;
+    A[872] = 0.0225749559082894*G0_0_1 + 0.0451499118165781*G0_0_2 + 0.0225749559082892*G0_1_0 + 0.0677248677248677*G0_1_2 + 0.0451499118165782*G0_2_0 + 0.0677248677248678*G0_2_1 + 0.135449735449736*G0_2_2;
+    A[873] = 0.0225749559082891*G0_0_1 + 0.0677248677248675*G0_0_2 + 0.0225749559082888*G0_1_0 + 0.0451499118165788*G0_1_2 + 0.0677248677248672*G0_2_0 + 0.0451499118165781*G0_2_1 + 0.135449735449735*G0_2_2;
+    A[874] = -0.135449735449736*G0_0_1 - 0.316049382716049*G0_0_2 - 0.135449735449735*G0_1_0 - 0.31604938271605*G0_1_2 - 0.31604938271605*G0_2_0 - 0.31604938271605*G0_2_1 - 0.722398589065256*G0_2_2;
+    A[875] = 0.0493827160493826*G0_0_0 + 0.0493827160493825*G0_0_1 + 0.0493827160493825*G0_0_2 + 0.042328042328042*G0_1_0 + 0.042328042328042*G0_1_1 + 0.042328042328042*G0_1_2 + 0.0423280423280421*G0_2_0 + 0.0423280423280421*G0_2_1 + 0.042328042328042*G0_2_2;
+    A[876] = 0.018342151675485*G0_0_0;
+    A[877] = -0.0070546737213406*G0_0_1 - 0.0253968253968254*G0_1_1;
+    A[878] = -0.00705467372134034*G0_0_2 - 0.0253968253968253*G0_2_2;
+    A[879] = 0.0677248677248676*G0_0_1 + 0.0225749559082888*G0_0_2 + 0.0902998236331568*G0_1_1 + 0.0338624338624339*G0_1_2 + 0.0338624338624338*G0_2_1;
+    A[880] = 0.0846560846560849*G0_0_1 + 0.0846560846560853*G0_0_2 + 0.0677248677248681*G0_1_1 + 0.0649029982363317*G0_1_2 + 0.0649029982363317*G0_2_1 + 0.0677248677248682*G0_2_2;
+    A[881] = 0.0225749559082896*G0_0_1 + 0.0677248677248677*G0_0_2 + 0.0338624338624339*G0_1_2 + 0.0338624338624344*G0_2_1 + 0.0902998236331572*G0_2_2;
+    A[882] = -0.0225749559082891*G0_0_0 - 0.0112874779541447*G0_0_2 - 0.0112874779541443*G0_2_0;
+    A[883] = 0.0169312169312167*G0_0_0 + 0.0197530864197532*G0_0_2 + 0.0197530864197529*G0_2_0 + 0.0225749559082897*G0_2_2;
+    A[884] = 0.0225749559082896*G0_0_0 + 0.033862433862434*G0_0_2 + 0.0338624338624344*G0_2_0 + 0.0451499118165785*G0_2_2;
+    A[885] = -0.0225749559082892*G0_0_0 - 0.0112874779541446*G0_0_1 - 0.0112874779541446*G0_1_0;
+    A[886] = 0.0169312169312169*G0_0_0 + 0.0197530864197529*G0_0_1 + 0.0197530864197528*G0_1_0 + 0.0225749559082889*G0_1_1;
+    A[887] = 0.0225749559082887*G0_0_0 + 0.0338624338624337*G0_0_1 + 0.0338624338624339*G0_1_0 + 0.0451499118165784*G0_1_1;
+    A[888] = -0.0677248677248676*G0_0_0 - 0.0677248677248677*G0_0_1 - 0.0790123456790117*G0_0_2 - 0.270899470899471*G0_1_0 - 0.270899470899471*G0_1_1 - 0.169312169312169*G0_1_2 - 0.16931216931217*G0_2_0 - 0.16931216931217*G0_2_1 - 0.067724867724867*G0_2_2;
+    A[889] = 0.118518518518519*G0_0_0 + 0.118518518518519*G0_0_1 + 0.0253968253968248*G0_0_2 + 0.067724867724868*G0_1_0 + 0.0677248677248678*G0_1_1 + 0.16084656084656*G0_1_2 + 0.160846560846562*G0_2_0 + 0.160846560846562*G0_2_1 - 0.0169312169312177*G0_2_2;
+    A[890] = -0.0225749559082897*G0_0_0 - 0.0225749559082897*G0_0_1 + 0.0112874779541449*G0_0_2 - 0.0338624338624334*G0_1_2 - 0.0338624338624344*G0_2_0 - 0.0338624338624344*G0_2_1 + 0.067724867724868*G0_2_2;
+    A[891] = -0.067724867724868*G0_0_0 - 0.0790123456790121*G0_0_1 - 0.0677248677248679*G0_0_2 - 0.169312169312169*G0_1_0 - 0.067724867724867*G0_1_1 - 0.16931216931217*G0_1_2 - 0.270899470899472*G0_2_0 - 0.169312169312169*G0_2_1 - 0.270899470899472*G0_2_2;
+    A[892] = 0.118518518518518*G0_0_0 + 0.025396825396825*G0_0_1 + 0.118518518518518*G0_0_2 + 0.160846560846561*G0_1_0 - 0.0169312169312177*G0_1_1 + 0.160846560846561*G0_1_2 + 0.0677248677248674*G0_2_0 + 0.16084656084656*G0_2_1 + 0.0677248677248674*G0_2_2;
+    A[893] = -0.0225749559082887*G0_0_0 + 0.011287477954145*G0_0_1 - 0.0225749559082887*G0_0_2 - 0.0338624338624338*G0_1_0 + 0.0677248677248681*G0_1_1 - 0.0338624338624338*G0_1_2 - 0.0338624338624333*G0_2_1;
+    A[894] = -0.0451499118165784*G0_0_0 - 0.0338624338624343*G0_0_1 - 0.0338624338624343*G0_0_2 - 0.0338624338624336*G0_1_0 - 0.135449735449736*G0_1_1 - 0.135449735449736*G0_1_2 - 0.0338624338624336*G0_2_0 - 0.135449735449736*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[895] = 0.022574955908289*G0_0_0 - 0.0197530864197535*G0_0_1 - 0.0197530864197535*G0_0_2 - 0.0197530864197533*G0_1_0 + 0.0225749559082888*G0_1_1 + 0.0225749559082889*G0_1_2 - 0.0197530864197533*G0_2_0 + 0.0225749559082891*G0_2_1 + 0.0225749559082891*G0_2_2;
+    A[896] = -0.0451499118165782*G0_0_0 + 0.0112874779541448*G0_0_1 + 0.0112874779541448*G0_0_2 + 0.011287477954145*G0_1_0 + 0.011287477954145*G0_2_0;
+    A[897] = 0.090299823633157*G0_0_0 + 0.0451499118165789*G0_0_1 + 0.0451499118165787*G0_0_2 + 0.0451499118165789*G0_1_0 + 0.0225749559082891*G0_1_2 + 0.0451499118165791*G0_2_0 + 0.0225749559082901*G0_2_1;
+    A[898] = 0.135449735449736*G0_0_0 + 0.0902998236331573*G0_0_1 + 0.0677248677248674*G0_0_2 + 0.0902998236331572*G0_1_0 + 0.0451499118165792*G0_1_1 + 0.0451499118165782*G0_1_2 + 0.0677248677248681*G0_2_0 + 0.0451499118165792*G0_2_1;
+    A[899] = 0.135449735449736*G0_0_0 + 0.0677248677248676*G0_0_1 + 0.0902998236331575*G0_0_2 + 0.0677248677248685*G0_1_0 + 0.0451499118165798*G0_1_2 + 0.0902998236331574*G0_2_0 + 0.0451499118165784*G0_2_1 + 0.0451499118165793*G0_2_2;
+    A[900] = 0.6320987654321*G0_0_0 + 0.361199294532628*G0_0_1 + 0.361199294532629*G0_0_2 + 0.361199294532628*G0_1_0 + 0.632098765432099*G0_1_1 + 0.361199294532629*G0_1_2 + 0.361199294532629*G0_2_0 + 0.361199294532629*G0_2_1 + 0.632098765432101*G0_2_2;
+    A[901] = -0.135449735449736*G0_0_0 - 0.361199294532628*G0_0_1 - 0.203174603174604*G0_0_2 - 0.0902998236331573*G0_1_0 - 0.451499118165785*G0_1_1 - 0.225749559082893*G0_1_2 - 0.0677248677248681*G0_2_0 - 0.225749559082893*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[902] = -0.135449735449736*G0_0_0 - 0.203174603174604*G0_0_1 - 0.361199294532629*G0_0_2 - 0.0677248677248683*G0_1_0 - 0.135449735449736*G0_1_1 - 0.225749559082892*G0_1_2 - 0.0902998236331573*G0_2_0 - 0.225749559082893*G0_2_1 - 0.451499118165786*G0_2_2;
+    A[903] = 0.0451499118165788*G0_0_0 + 0.31604938271605*G0_0_1 + 0.180599647266315*G0_0_2 + 0.31604938271605*G0_1_0 + 0.0451499118165789*G0_1_1 + 0.180599647266315*G0_1_2 + 0.180599647266315*G0_2_0 + 0.180599647266315*G0_2_1 + 0.316049382716052*G0_2_2;
+    A[904] = 0.0451499118165784*G0_0_0 - 0.0451499118165787*G0_0_1 - 0.0451499118165784*G0_1_0 - 0.0225749559082894*G0_1_2 - 0.0225749559082902*G0_2_1 - 0.0451499118165789*G0_2_2;
+    A[905] = -0.135449735449736*G0_0_0 - 0.0677248677248679*G0_0_1 - 0.180599647266315*G0_0_2 - 0.0677248677248681*G0_1_0 - 0.0451499118165791*G0_1_2 - 0.180599647266315*G0_2_0 - 0.0451499118165786*G0_2_1 - 0.225749559082894*G0_2_2;
+    A[906] = 0.0451499118165789*G0_0_0 + 0.180599647266315*G0_0_1 + 0.31604938271605*G0_0_2 + 0.180599647266314*G0_1_0 + 0.31604938271605*G0_1_1 + 0.180599647266314*G0_1_2 + 0.31604938271605*G0_2_0 + 0.180599647266315*G0_2_1 + 0.0451499118165786*G0_2_2;
+    A[907] = 0.0451499118165783*G0_0_0 - 0.0451499118165787*G0_0_2 - 0.0451499118165782*G0_1_1 - 0.0225749559082893*G0_1_2 - 0.0451499118165788*G0_2_0 - 0.0225749559082892*G0_2_1;
+    A[908] = -0.135449735449735*G0_0_0 - 0.180599647266314*G0_0_1 - 0.067724867724867*G0_0_2 - 0.180599647266314*G0_1_0 - 0.225749559082892*G0_1_1 - 0.045149911816578*G0_1_2 - 0.0677248677248672*G0_2_0 - 0.0451499118165784*G0_2_1;
+    A[909] = -0.722398589065257*G0_0_0 - 0.406349206349208*G0_0_1 - 0.406349206349207*G0_0_2 - 0.406349206349207*G0_1_0 - 0.0902998236331577*G0_1_1 - 0.225749559082894*G0_1_2 - 0.406349206349208*G0_2_0 - 0.225749559082894*G0_2_1 - 0.090299823633158*G0_2_2;
+    A[910] = -0.0183421516754849*G0_0_0 - 0.018342151675485*G0_0_1 - 0.018342151675485*G0_0_2 - 0.0253968253968252*G0_1_0 - 0.0253968253968252*G0_1_1 - 0.0253968253968252*G0_1_2 - 0.0253968253968254*G0_2_0 - 0.0253968253968253*G0_2_1 - 0.0253968253968254*G0_2_2;
+    A[911] = 0.0183421516754851*G0_0_0;
+    A[912] = -0.00705467372134032*G0_0_1 + 0.0423280423280423*G0_1_1;
+    A[913] = -0.00705467372134041*G0_0_2 - 0.0253968253968254*G0_2_2;
+    A[914] = -0.203174603174603*G0_0_1 - 0.112874779541446*G0_0_2 - 0.270899470899471*G0_1_1 - 0.101587301587302*G0_1_2 - 0.101587301587302*G0_2_1;
+    A[915] = -0.050793650793651*G0_0_1 - 0.186243386243387*G0_0_2 + 0.0677248677248675*G0_1_1 - 0.093121693121693*G0_1_2 - 0.0931216931216935*G0_2_1 - 0.270899470899471*G0_2_2;
+    A[916] = 0.022574955908289*G0_0_1 + 0.0677248677248676*G0_0_2 + 0.0338624338624337*G0_1_2 + 0.0338624338624339*G0_2_1 + 0.135449735449735*G0_2_2;
+    A[917] = -0.0225749559082895*G0_0_0 - 0.0112874779541447*G0_0_2 - 0.0112874779541447*G0_2_0;
+    A[918] = 0.0169312169312171*G0_0_0 + 0.0197530864197531*G0_0_2 + 0.0197530864197528*G0_2_0 + 0.022574955908289*G0_2_2;
+    A[919] = 0.022574955908289*G0_0_0 + 0.0338624338624338*G0_0_2 + 0.0338624338624339*G0_2_0 + 0.0451499118165784*G0_2_2;
+    A[920] = -0.0677248677248677*G0_0_0 - 0.0112874779541447*G0_0_1 - 0.0112874779541447*G0_1_0;
+    A[921] = 0.0846560846560848*G0_0_0 + 0.0423280423280427*G0_0_1 + 0.0423280423280428*G0_1_0 + 0.0225749559082899*G0_1_1;
+    A[922] = -0.112874779541446*G0_0_0 - 0.101587301587302*G0_0_1 - 0.101587301587302*G0_1_0 - 0.135449735449736*G0_1_1;
+    A[923] = 0.0225749559082893*G0_0_0 + 0.0225749559082895*G0_0_1 + 0.0112874779541446*G0_0_2 + 0.0902998236331568*G0_1_0 + 0.0902998236331569*G0_1_1 + 0.0564373897707225*G0_1_2 + 0.0564373897707232*G0_2_0 + 0.0564373897707233*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[924] = -0.0169312169312172*G0_0_0 - 0.0169312169312174*G0_0_1 + 0.0028218694885361*G0_0_2 + 0.0677248677248678*G0_1_0 + 0.0677248677248679*G0_1_1 + 0.00282186948853683*G0_1_2 + 0.00282186948853585*G0_2_0 + 0.0028218694885358*G0_2_1 + 0.00564373897707232*G0_2_2;
+    A[925] = -0.0225749559082891*G0_0_0 - 0.022574955908289*G0_0_1 + 0.0112874779541447*G0_0_2 - 0.0338624338624343*G0_1_2 - 0.0338624338624339*G0_2_0 - 0.0338624338624339*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[926] = 0.0677248677248679*G0_0_0 + 0.0564373897707231*G0_0_1 + 0.0677248677248679*G0_0_2 + 0.101587301587302*G0_1_0 + 0.0677248677248673*G0_1_1 + 0.101587301587302*G0_1_2 + 0.135449735449736*G0_2_0 + 0.101587301587301*G0_2_1 + 0.135449735449736*G0_2_2;
+    A[927] = -0.0846560846560848*G0_0_0 - 0.0423280423280421*G0_0_1 - 0.0846560846560848*G0_0_2 - 0.177777777777778*G0_1_0 - 0.0169312169312163*G0_1_1 - 0.177777777777778*G0_1_2 - 0.270899470899471*G0_2_0 - 0.177777777777777*G0_2_1 - 0.270899470899471*G0_2_2;
+    A[928] = 0.112874779541446*G0_0_0 + 0.0112874779541444*G0_0_1 + 0.112874779541446*G0_0_2 + 0.101587301587302*G0_1_0 - 0.067724867724868*G0_1_1 + 0.101587301587302*G0_1_2 + 0.101587301587301*G0_2_1;
+    A[929] = 0.011287477954145*G0_0_1 + 0.011287477954145*G0_0_2 + 0.0112874779541444*G0_1_0 + 0.0451499118165788*G0_1_1 + 0.0451499118165787*G0_1_2 + 0.0112874779541445*G0_2_0 + 0.0451499118165788*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[930] = 0.00282186948853618*G0_0_1 + 0.00282186948853615*G0_0_2 + 0.00282186948853627*G0_1_0 + 0.0225749559082896*G0_1_1 + 0.0225749559082894*G0_1_2 + 0.00282186948853626*G0_2_0 + 0.0225749559082894*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[931] = 0.0112874779541446*G0_0_1 + 0.0112874779541446*G0_0_2 + 0.0112874779541444*G0_1_0 + 0.0112874779541445*G0_2_0;
+    A[932] = 0.135449735449736*G0_0_0 + 0.0451499118165786*G0_0_1 + 0.0677248677248681*G0_0_2 + 0.0451499118165785*G0_1_0 + 0.0225749559082897*G0_1_2 + 0.0677248677248674*G0_2_0 + 0.0225749559082888*G0_2_1;
+    A[933] = -0.541798941798943*G0_0_0 - 0.270899470899472*G0_0_1 - 0.270899470899472*G0_0_2 - 0.270899470899471*G0_1_0 + 0.0451499118165784*G0_1_1 - 0.135449735449735*G0_1_2 - 0.270899470899471*G0_2_0 - 0.135449735449736*G0_2_1;
+    A[934] = 0.0677248677248679*G0_0_1 - 0.0677248677248679*G0_0_2 + 0.0677248677248672*G0_1_0 + 0.0451499118165777*G0_1_2 - 0.0677248677248682*G0_2_0 + 0.0451499118165782*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[935] = -0.135449735449736*G0_0_0 - 0.0902998236331573*G0_0_1 - 0.0677248677248681*G0_0_2 - 0.361199294532628*G0_1_0 - 0.451499118165785*G0_1_1 - 0.225749559082893*G0_1_2 - 0.203174603174604*G0_2_0 - 0.225749559082893*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[936] = 0.541798941798943*G0_0_0 + 0.270899470899471*G0_0_1 + 0.270899470899471*G0_0_2 + 0.270899470899471*G0_1_0 + 0.632098765432099*G0_1_1 + 0.270899470899471*G0_1_2 + 0.270899470899471*G0_2_0 + 0.270899470899471*G0_2_1 + 0.541798941798942*G0_2_2;
+    A[937] = 0.0677248677248684*G0_0_1 - 0.0677248677248675*G0_0_2 - 0.0677248677248675*G0_1_0 - 0.135449735449736*G0_1_1 + 0.090299823633157*G0_1_2 + 0.067724867724868*G0_2_0 + 0.0902998236331577*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[938] = -0.0451499118165788*G0_0_1 - 0.0225749559082901*G0_0_2 - 0.0451499118165786*G0_1_0 + 0.0451499118165781*G0_1_1 - 0.0225749559082899*G0_2_0 - 0.0451499118165794*G0_2_2;
+    A[939] = -0.0451499118165784*G0_0_1 - 0.0225749559082893*G0_0_2 - 0.0451499118165784*G0_1_0 - 0.0225749559082891*G0_1_2 - 0.0225749559082888*G0_2_0 - 0.0225749559082887*G0_2_1 - 0.0451499118165783*G0_2_2;
+    A[940] = -0.0677248677248678*G0_0_1 - 0.0225749559082888*G0_0_2 - 0.0677248677248676*G0_1_0 - 0.0451499118165781*G0_1_2 - 0.0225749559082885*G0_2_0 - 0.0451499118165782*G0_2_1 - 0.0451499118165778*G0_2_2;
+    A[941] = -0.0451499118165789*G0_0_1 - 0.0677248677248675*G0_0_2 - 0.0451499118165786*G0_1_0 - 0.225749559082893*G0_1_1 - 0.180599647266314*G0_1_2 - 0.0677248677248678*G0_2_0 - 0.180599647266314*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[942] = -0.0451499118165786*G0_0_1 - 0.0677248677248677*G0_0_2 - 0.0451499118165783*G0_1_0 - 0.0451499118165789*G0_1_1 - 0.0225749559082894*G0_1_2 - 0.0677248677248676*G0_2_0 - 0.0225749559082894*G0_2_1;
+    A[943] = 0.135449735449736*G0_0_1 + 0.270899470899471*G0_0_2 + 0.135449735449735*G0_1_0 + 0.31604938271605*G0_1_1 + 0.135449735449735*G0_1_2 + 0.270899470899471*G0_2_0 + 0.135449735449736*G0_2_1;
+    A[944] = 0.31604938271605*G0_0_1 + 0.135449735449735*G0_0_2 + 0.31604938271605*G0_1_0 - 0.0902998236331568*G0_1_1 + 0.135449735449737*G0_1_2 + 0.135449735449737*G0_2_0 + 0.135449735449737*G0_2_1 + 0.270899470899472*G0_2_2;
+    A[945] = -0.0183421516754852*G0_0_0 - 0.0183421516754852*G0_0_1 - 0.0183421516754852*G0_0_2 - 0.0253968253968253*G0_1_0 - 0.0253968253968253*G0_1_1 - 0.0253968253968253*G0_1_2 - 0.0253968253968252*G0_2_0 - 0.0253968253968252*G0_2_1 - 0.0253968253968251*G0_2_2;
+    A[946] = 0.0183421516754848*G0_0_0;
+    A[947] = -0.00705467372134016*G0_0_1 - 0.0253968253968253*G0_1_1;
+    A[948] = -0.00705467372134039*G0_0_2 + 0.0423280423280422*G0_2_2;
+    A[949] = 0.0677248677248677*G0_0_1 + 0.0225749559082897*G0_0_2 + 0.135449735449736*G0_1_1 + 0.0338624338624343*G0_1_2 + 0.0338624338624338*G0_2_1;
+    A[950] = -0.186243386243386*G0_0_1 - 0.0507936507936511*G0_0_2 - 0.270899470899471*G0_1_1 - 0.0931216931216939*G0_1_2 - 0.093121693121693*G0_2_1 + 0.0677248677248673*G0_2_2;
+    A[951] = -0.112874779541446*G0_0_1 - 0.203174603174603*G0_0_2 - 0.101587301587301*G0_1_2 - 0.101587301587302*G0_2_1 - 0.270899470899471*G0_2_2;
+    A[952] = -0.0677248677248676*G0_0_0 - 0.011287477954145*G0_0_2 - 0.0112874779541451*G0_2_0;
+    A[953] = 0.0846560846560844*G0_0_0 + 0.0423280423280429*G0_0_2 + 0.0423280423280429*G0_2_0 + 0.0225749559082896*G0_2_2;
+    A[954] = -0.112874779541446*G0_0_0 - 0.101587301587302*G0_0_2 - 0.101587301587302*G0_2_0 - 0.135449735449736*G0_2_2;
+    A[955] = -0.0225749559082891*G0_0_0 - 0.011287477954145*G0_0_1 - 0.0112874779541447*G0_1_0;
+    A[956] = 0.0169312169312166*G0_0_0 + 0.0197530864197532*G0_0_1 + 0.0197530864197529*G0_1_0 + 0.0225749559082891*G0_1_1;
+    A[957] = 0.0225749559082899*G0_0_0 + 0.0338624338624338*G0_0_1 + 0.0338624338624343*G0_1_0 + 0.0451499118165786*G0_1_1;
+    A[958] = 0.067724867724868*G0_0_0 + 0.067724867724868*G0_0_1 + 0.0564373897707236*G0_0_2 + 0.135449735449736*G0_1_0 + 0.135449735449736*G0_1_1 + 0.101587301587301*G0_1_2 + 0.101587301587302*G0_2_0 + 0.101587301587302*G0_2_1 + 0.0677248677248671*G0_2_2;
+    A[959] = -0.0846560846560849*G0_0_0 - 0.0846560846560851*G0_0_1 - 0.042328042328043*G0_0_2 - 0.270899470899471*G0_1_0 - 0.270899470899472*G0_1_1 - 0.177777777777778*G0_1_2 - 0.177777777777779*G0_2_0 - 0.177777777777779*G0_2_1 - 0.0169312169312162*G0_2_2;
+    A[960] = 0.112874779541446*G0_0_0 + 0.112874779541446*G0_0_1 + 0.0112874779541449*G0_0_2 + 0.101587301587302*G0_1_2 + 0.101587301587302*G0_2_0 + 0.101587301587302*G0_2_1 - 0.0677248677248679*G0_2_2;
+    A[961] = 0.0225749559082893*G0_0_0 + 0.0112874779541449*G0_0_1 + 0.0225749559082892*G0_0_2 + 0.0564373897707235*G0_1_0 + 0.0225749559082891*G0_1_1 + 0.0564373897707234*G0_1_2 + 0.0902998236331572*G0_2_0 + 0.0564373897707227*G0_2_1 + 0.0902998236331572*G0_2_2;
+    A[962] = -0.0169312169312168*G0_0_0 + 0.00282186948853606*G0_0_1 - 0.0169312169312168*G0_0_2 + 0.00282186948853632*G0_1_0 + 0.00564373897707248*G0_1_1 + 0.0028218694885363*G0_1_2 + 0.0677248677248682*G0_2_0 + 0.00282186948853665*G0_2_1 + 0.0677248677248682*G0_2_2;
+    A[963] = -0.0225749559082897*G0_0_0 + 0.0112874779541445*G0_0_1 - 0.0225749559082897*G0_0_2 - 0.0338624338624343*G0_1_0 + 0.0225749559082891*G0_1_1 - 0.0338624338624343*G0_1_2 - 0.0338624338624344*G0_2_1;
+    A[964] = 0.0112874779541448*G0_0_1 + 0.0112874779541448*G0_0_2 + 0.0112874779541445*G0_1_0 + 0.0451499118165789*G0_1_1 + 0.0451499118165789*G0_1_2 + 0.0112874779541445*G0_2_0 + 0.0451499118165789*G0_2_1 + 0.0451499118165789*G0_2_2;
+    A[965] = 0.00282186948853608*G0_0_1 + 0.00282186948853611*G0_0_2 + 0.00282186948853634*G0_1_0 + 0.0225749559082893*G0_1_1 + 0.0225749559082893*G0_1_2 + 0.00282186948853633*G0_2_0 + 0.0225749559082893*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[966] = 0.011287477954145*G0_0_1 + 0.011287477954145*G0_0_2 + 0.0112874779541444*G0_1_0 + 0.0112874779541444*G0_2_0;
+    A[967] = 0.135449735449736*G0_0_0 + 0.067724867724868*G0_0_1 + 0.0451499118165784*G0_0_2 + 0.0677248677248676*G0_1_0 + 0.0225749559082888*G0_1_2 + 0.0451499118165787*G0_2_0 + 0.0225749559082887*G0_2_1;
+    A[968] = -0.0677248677248673*G0_0_1 + 0.0677248677248677*G0_0_2 - 0.0677248677248683*G0_1_0 - 0.135449735449736*G0_1_1 + 0.0451499118165785*G0_1_2 + 0.0677248677248675*G0_2_0 + 0.0451499118165784*G0_2_1;
+    A[969] = -0.541798941798942*G0_0_0 - 0.270899470899471*G0_0_1 - 0.27089947089947*G0_0_2 - 0.270899470899471*G0_1_0 - 0.135449735449736*G0_1_2 - 0.270899470899471*G0_2_0 - 0.135449735449735*G0_2_1 + 0.0451499118165786*G0_2_2;
+    A[970] = -0.135449735449736*G0_0_0 - 0.0677248677248683*G0_0_1 - 0.0902998236331573*G0_0_2 - 0.203174603174604*G0_1_0 - 0.135449735449736*G0_1_1 - 0.225749559082893*G0_1_2 - 0.361199294532629*G0_2_0 - 0.225749559082892*G0_2_1 - 0.451499118165786*G0_2_2;
+    A[971] = -0.0677248677248675*G0_0_1 + 0.067724867724868*G0_0_2 + 0.0677248677248683*G0_1_0 - 0.135449735449736*G0_1_1 + 0.0902998236331576*G0_1_2 - 0.0677248677248675*G0_2_0 + 0.090299823633157*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[972] = 0.541798941798941*G0_0_0 + 0.270899470899471*G0_0_1 + 0.270899470899471*G0_0_2 + 0.270899470899471*G0_1_0 + 0.541798941798943*G0_1_1 + 0.270899470899471*G0_1_2 + 0.270899470899471*G0_2_0 + 0.270899470899471*G0_2_1 + 0.6320987654321*G0_2_2;
+    A[973] = -0.0677248677248683*G0_0_1 - 0.045149911816579*G0_0_2 - 0.0677248677248681*G0_1_0 - 0.135449735449736*G0_1_1 - 0.180599647266315*G0_1_2 - 0.0451499118165788*G0_2_0 - 0.180599647266315*G0_2_1 - 0.225749559082894*G0_2_2;
+    A[974] = -0.0677248677248679*G0_0_1 - 0.0451499118165791*G0_0_2 - 0.0677248677248673*G0_1_0 - 0.0225749559082891*G0_1_2 - 0.045149911816578*G0_2_0 - 0.0225749559082888*G0_2_1 - 0.0451499118165787*G0_2_2;
+    A[975] = 0.270899470899471*G0_0_1 + 0.135449735449737*G0_0_2 + 0.270899470899471*G0_1_0 + 0.135449735449736*G0_1_2 + 0.135449735449736*G0_2_0 + 0.135449735449735*G0_2_1 + 0.316049382716051*G0_2_2;
+    A[976] = -0.0225749559082893*G0_0_1 - 0.0451499118165785*G0_0_2 - 0.0225749559082896*G0_1_0 - 0.0451499118165787*G0_1_1 - 0.045149911816579*G0_2_0 + 0.0451499118165784*G0_2_2;
+    A[977] = -0.0225749559082894*G0_0_1 - 0.0451499118165782*G0_0_2 - 0.0225749559082891*G0_1_0 - 0.0451499118165786*G0_1_1 - 0.0225749559082888*G0_1_2 - 0.0451499118165779*G0_2_0 - 0.0225749559082893*G0_2_1;
+    A[978] = -0.0225749559082892*G0_0_1 - 0.0677248677248678*G0_0_2 - 0.0225749559082892*G0_1_0 - 0.0451499118165787*G0_1_1 - 0.0451499118165784*G0_1_2 - 0.0677248677248682*G0_2_0 - 0.0451499118165787*G0_2_1;
+    A[979] = 0.135449735449736*G0_0_1 + 0.316049382716049*G0_0_2 + 0.135449735449736*G0_1_0 + 0.270899470899472*G0_1_1 + 0.135449735449736*G0_1_2 + 0.31604938271605*G0_2_0 + 0.135449735449737*G0_2_1 - 0.0902998236331569*G0_2_2;
+    A[980] = 0.042328042328042*G0_0_0 + 0.042328042328042*G0_0_1 + 0.042328042328042*G0_0_2 + 0.0493827160493825*G0_1_0 + 0.0493827160493826*G0_1_1 + 0.0493827160493825*G0_1_2 + 0.0423280423280422*G0_2_0 + 0.0423280423280422*G0_2_1 + 0.0423280423280421*G0_2_2;
+    A[981] = -0.0253968253968255*G0_0_0 - 0.00705467372134048*G0_1_0;
+    A[982] = 0.0183421516754848*G0_1_1;
+    A[983] = -0.00705467372134036*G0_1_2 - 0.0253968253968253*G0_2_2;
+    A[984] = -0.0225749559082893*G0_1_1 - 0.0112874779541452*G0_1_2 - 0.0112874779541444*G0_2_1;
+    A[985] = 0.0169312169312173*G0_1_1 + 0.0197530864197541*G0_1_2 + 0.0197530864197532*G0_2_1 + 0.02257495590829*G0_2_2;
+    A[986] = 0.0225749559082895*G0_1_1 + 0.0338624338624338*G0_1_2 + 0.0338624338624345*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[987] = 0.0902998236331567*G0_0_0 + 0.0338624338624336*G0_0_2 + 0.0677248677248678*G0_1_0 + 0.022574955908289*G0_1_2 + 0.0338624338624342*G0_2_0;
+    A[988] = 0.0677248677248677*G0_0_0 + 0.0649029982363318*G0_0_2 + 0.0846560846560843*G0_1_0 + 0.0846560846560848*G0_1_2 + 0.0649029982363311*G0_2_0 + 0.067724867724868*G0_2_2;
+    A[989] = 0.0338624338624337*G0_0_2 + 0.0225749559082895*G0_1_0 + 0.0677248677248677*G0_1_2 + 0.0338624338624345*G0_2_0 + 0.090299823633157*G0_2_2;
+    A[990] = 0.0451499118165784*G0_0_0 + 0.0338624338624336*G0_0_1 + 0.0338624338624339*G0_1_0 + 0.022574955908289*G0_1_1;
+    A[991] = 0.0225749559082892*G0_0_0 + 0.0197530864197533*G0_0_1 + 0.0197530864197531*G0_1_0 + 0.0169312169312169*G0_1_1;
+    A[992] = -0.0112874779541449*G0_0_1 - 0.0112874779541452*G0_1_0 - 0.0225749559082896*G0_1_1;
+    A[993] = -0.270899470899471*G0_0_0 - 0.270899470899471*G0_0_1 - 0.169312169312169*G0_0_2 - 0.0677248677248678*G0_1_0 - 0.0677248677248676*G0_1_1 - 0.0790123456790118*G0_1_2 - 0.16931216931217*G0_2_0 - 0.16931216931217*G0_2_1 - 0.0677248677248672*G0_2_2;
+    A[994] = 0.0677248677248679*G0_0_0 + 0.0677248677248679*G0_0_1 + 0.16084656084656*G0_0_2 + 0.118518518518519*G0_1_0 + 0.118518518518519*G0_1_1 + 0.0253968253968248*G0_1_2 + 0.160846560846562*G0_2_0 + 0.160846560846562*G0_2_1 - 0.0169312169312175*G0_2_2;
+    A[995] = -0.0338624338624332*G0_0_2 - 0.0225749559082895*G0_1_0 - 0.0225749559082895*G0_1_1 + 0.011287477954145*G0_1_2 - 0.0338624338624345*G0_2_0 - 0.0338624338624345*G0_2_1 + 0.067724867724868*G0_2_2;
+    A[996] = -0.135449735449736*G0_0_0 - 0.0338624338624333*G0_0_1 - 0.135449735449736*G0_0_2 - 0.0338624338624342*G0_1_0 - 0.0451499118165783*G0_1_1 - 0.0338624338624341*G0_1_2 - 0.135449735449736*G0_2_0 - 0.0338624338624337*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[997] = 0.0225749559082894*G0_0_0 - 0.0197530864197536*G0_0_1 + 0.0225749559082893*G0_0_2 - 0.0197530864197531*G0_1_0 + 0.0225749559082891*G0_1_1 - 0.0197530864197532*G0_1_2 + 0.0225749559082892*G0_2_0 - 0.0197530864197534*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[998] = 0.0112874779541449*G0_0_1 + 0.0112874779541452*G0_1_0 - 0.0451499118165782*G0_1_1 + 0.0112874779541452*G0_1_2 + 0.0112874779541451*G0_2_1;
+    A[999] = -0.0677248677248674*G0_0_0 - 0.16931216931217*G0_0_1 - 0.16931216931217*G0_0_2 - 0.0790123456790122*G0_1_0 - 0.0677248677248681*G0_1_1 - 0.0677248677248681*G0_1_2 - 0.169312169312169*G0_2_0 - 0.270899470899472*G0_2_1 - 0.270899470899472*G0_2_2;
+    A[1000] = -0.0169312169312171*G0_0_0 + 0.160846560846561*G0_0_1 + 0.160846560846561*G0_0_2 + 0.0253968253968251*G0_1_0 + 0.118518518518518*G0_1_1 + 0.118518518518518*G0_1_2 + 0.16084656084656*G0_2_0 + 0.0677248677248675*G0_2_1 + 0.0677248677248675*G0_2_2;
+    A[1001] = 0.0677248677248679*G0_0_0 - 0.0338624338624336*G0_0_1 - 0.0338624338624336*G0_0_2 + 0.0112874779541449*G0_1_0 - 0.0225749559082891*G0_1_1 - 0.0225749559082891*G0_1_2 - 0.0338624338624334*G0_2_0;
+    A[1002] = 0.0451499118165789*G0_0_0 + 0.0902998236331565*G0_0_1 + 0.0451499118165783*G0_0_2 + 0.0902998236331567*G0_1_0 + 0.135449735449735*G0_1_1 + 0.0677248677248678*G0_1_2 + 0.0451499118165789*G0_2_0 + 0.0677248677248683*G0_2_1;
+    A[1003] = 0.0451499118165798*G0_0_1 + 0.0225749559082892*G0_0_2 + 0.0451499118165788*G0_1_0 + 0.0902998236331572*G0_1_1 + 0.045149911816578*G0_1_2 + 0.0225749559082901*G0_2_0 + 0.0451499118165795*G0_2_1;
+    A[1004] = 0.0677248677248681*G0_0_1 + 0.0451499118165799*G0_0_2 + 0.0677248677248683*G0_1_0 + 0.135449735449735*G0_1_1 + 0.0902998236331575*G0_1_2 + 0.0451499118165791*G0_2_0 + 0.0902998236331569*G0_2_1 + 0.0451499118165792*G0_2_2;
+    A[1005] = 0.0451499118165787*G0_0_0 + 0.31604938271605*G0_0_1 + 0.180599647266315*G0_0_2 + 0.31604938271605*G0_1_0 + 0.0451499118165789*G0_1_1 + 0.180599647266315*G0_1_2 + 0.180599647266315*G0_2_0 + 0.180599647266315*G0_2_1 + 0.316049382716052*G0_2_2;
+    A[1006] = -0.0451499118165786*G0_0_1 - 0.0225749559082899*G0_0_2 - 0.0451499118165788*G0_1_0 + 0.0451499118165782*G0_1_1 - 0.0225749559082901*G0_2_0 - 0.0451499118165794*G0_2_2;
+    A[1007] = -0.0677248677248681*G0_0_1 - 0.0451499118165788*G0_0_2 - 0.0677248677248683*G0_1_0 - 0.135449735449736*G0_1_1 - 0.180599647266315*G0_1_2 - 0.045149911816579*G0_2_0 - 0.180599647266315*G0_2_1 - 0.225749559082894*G0_2_2;
+    A[1008] = 0.632098765432099*G0_0_0 + 0.361199294532628*G0_0_1 + 0.361199294532629*G0_0_2 + 0.361199294532628*G0_1_0 + 0.632098765432099*G0_1_1 + 0.361199294532629*G0_1_2 + 0.361199294532629*G0_2_0 + 0.361199294532629*G0_2_1 + 0.632098765432101*G0_2_2;
+    A[1009] = -0.451499118165784*G0_0_0 - 0.0902998236331568*G0_0_1 - 0.225749559082893*G0_0_2 - 0.361199294532628*G0_1_0 - 0.135449735449735*G0_1_1 - 0.203174603174602*G0_1_2 - 0.225749559082893*G0_2_0 - 0.0677248677248683*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[1010] = -0.135449735449736*G0_0_0 - 0.0677248677248683*G0_0_1 - 0.225749559082893*G0_0_2 - 0.203174603174603*G0_1_0 - 0.135449735449736*G0_1_1 - 0.361199294532629*G0_1_2 - 0.225749559082893*G0_2_0 - 0.0902998236331571*G0_2_1 - 0.451499118165786*G0_2_2;
+    A[1011] = 0.31604938271605*G0_0_0 + 0.180599647266315*G0_0_1 + 0.180599647266314*G0_0_2 + 0.180599647266314*G0_1_0 + 0.045149911816579*G0_1_1 + 0.316049382716049*G0_1_2 + 0.180599647266315*G0_2_0 + 0.31604938271605*G0_2_1 + 0.0451499118165784*G0_2_2;
+    A[1012] = -0.225749559082892*G0_0_0 - 0.180599647266314*G0_0_1 - 0.0451499118165783*G0_0_2 - 0.180599647266314*G0_1_0 - 0.135449735449735*G0_1_1 - 0.0677248677248676*G0_1_2 - 0.0451499118165785*G0_2_0 - 0.0677248677248675*G0_2_1;
+    A[1013] = -0.0451499118165786*G0_0_0 - 0.022574955908289*G0_0_2 + 0.0451499118165786*G0_1_1 - 0.0451499118165775*G0_1_2 - 0.0225749559082892*G0_2_0 - 0.0451499118165787*G0_2_1;
+    A[1014] = -0.0902998236331579*G0_0_0 - 0.406349206349207*G0_0_1 - 0.225749559082894*G0_0_2 - 0.406349206349207*G0_1_0 - 0.722398589065256*G0_1_1 - 0.406349206349207*G0_1_2 - 0.225749559082894*G0_2_0 - 0.406349206349208*G0_2_1 - 0.0902998236331579*G0_2_2;
+    A[1015] = -0.0253968253968251*G0_0_0 - 0.0253968253968251*G0_0_1 - 0.0253968253968251*G0_0_2 - 0.0183421516754849*G0_1_0 - 0.0183421516754848*G0_1_1 - 0.0183421516754849*G0_1_2 - 0.0253968253968253*G0_2_0 - 0.0253968253968253*G0_2_1 - 0.0253968253968254*G0_2_2;
+    A[1016] = 0.0423280423280424*G0_0_0 - 0.00705467372134026*G0_1_0;
+    A[1017] = 0.0183421516754849*G0_1_1;
+    A[1018] = -0.00705467372134038*G0_1_2 - 0.0253968253968254*G0_2_2;
+    A[1019] = -0.0225749559082893*G0_1_1 - 0.0112874779541447*G0_1_2 - 0.0112874779541447*G0_2_1;
+    A[1020] = 0.0169312169312169*G0_1_1 + 0.019753086419753*G0_1_2 + 0.0197530864197532*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[1021] = 0.0225749559082892*G0_1_1 + 0.0338624338624338*G0_1_2 + 0.0338624338624341*G0_2_1 + 0.0451499118165789*G0_2_2;
+    A[1022] = -0.270899470899471*G0_0_0 - 0.101587301587302*G0_0_2 - 0.203174603174603*G0_1_0 - 0.112874779541446*G0_1_2 - 0.101587301587301*G0_2_0;
+    A[1023] = 0.0677248677248681*G0_0_0 - 0.093121693121693*G0_0_2 - 0.0507936507936508*G0_1_0 - 0.186243386243386*G0_1_2 - 0.0931216931216934*G0_2_0 - 0.270899470899472*G0_2_2;
+    A[1024] = 0.0338624338624339*G0_0_2 + 0.0225749559082892*G0_1_0 + 0.0677248677248678*G0_1_2 + 0.0338624338624341*G0_2_0 + 0.135449735449736*G0_2_2;
+    A[1025] = -0.135449735449735*G0_0_0 - 0.101587301587302*G0_0_1 - 0.101587301587301*G0_1_0 - 0.112874779541446*G0_1_1;
+    A[1026] = 0.0225749559082895*G0_0_0 + 0.0423280423280425*G0_0_1 + 0.0423280423280426*G0_1_0 + 0.084656084656085*G0_1_1;
+    A[1027] = -0.0112874779541445*G0_0_1 - 0.0112874779541447*G0_1_0 - 0.0677248677248677*G0_1_1;
+    A[1028] = 0.0902998236331569*G0_0_0 + 0.0902998236331567*G0_0_1 + 0.0564373897707224*G0_0_2 + 0.0225749559082894*G0_1_0 + 0.0225749559082894*G0_1_1 + 0.0112874779541444*G0_1_2 + 0.0564373897707234*G0_2_0 + 0.0564373897707232*G0_2_1 + 0.0225749559082894*G0_2_2;
+    A[1029] = 0.0677248677248675*G0_0_0 + 0.0677248677248675*G0_0_1 + 0.00282186948853692*G0_0_2 - 0.0169312169312176*G0_1_0 - 0.0169312169312176*G0_1_1 + 0.0028218694885362*G0_1_2 + 0.00282186948853595*G0_2_0 + 0.00282186948853597*G0_2_1 + 0.00564373897707188*G0_2_2;
+    A[1030] = -0.0338624338624343*G0_0_2 - 0.0225749559082893*G0_1_0 - 0.0225749559082892*G0_1_1 + 0.0112874779541445*G0_1_2 - 0.0338624338624341*G0_2_0 - 0.0338624338624341*G0_2_1 + 0.0225749559082894*G0_2_2;
+    A[1031] = 0.0451499118165786*G0_0_0 + 0.0112874779541442*G0_0_1 + 0.0451499118165785*G0_0_2 + 0.011287477954145*G0_1_0 + 0.011287477954145*G0_1_2 + 0.0451499118165787*G0_2_0 + 0.0112874779541446*G0_2_1 + 0.0451499118165787*G0_2_2;
+    A[1032] = 0.0225749559082893*G0_0_0 + 0.00282186948853653*G0_0_1 + 0.0225749559082892*G0_0_2 + 0.00282186948853595*G0_1_0 + 0.00282186948853588*G0_1_2 + 0.0225749559082892*G0_2_0 + 0.00282186948853604*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[1033] = 0.0112874779541444*G0_0_1 + 0.0112874779541447*G0_1_0 + 0.0112874779541447*G0_1_2 + 0.0112874779541447*G0_2_1;
+    A[1034] = 0.0677248677248673*G0_0_0 + 0.101587301587302*G0_0_1 + 0.101587301587302*G0_0_2 + 0.0564373897707228*G0_1_0 + 0.067724867724868*G0_1_1 + 0.0677248677248679*G0_1_2 + 0.101587301587301*G0_2_0 + 0.135449735449735*G0_2_1 + 0.135449735449736*G0_2_2;
+    A[1035] = -0.0169312169312166*G0_0_0 - 0.177777777777777*G0_0_1 - 0.177777777777777*G0_0_2 - 0.0423280423280418*G0_1_0 - 0.084656084656084*G0_1_1 - 0.0846560846560841*G0_1_2 - 0.177777777777778*G0_2_0 - 0.270899470899471*G0_2_1 - 0.270899470899471*G0_2_2;
+    A[1036] = -0.0677248677248679*G0_0_0 + 0.101587301587302*G0_0_1 + 0.101587301587302*G0_0_2 + 0.0112874779541442*G0_1_0 + 0.112874779541446*G0_1_1 + 0.112874779541446*G0_1_2 + 0.101587301587301*G0_2_0;
+    A[1037] = 0.0451499118165791*G0_0_0 - 0.27089947089947*G0_0_1 - 0.135449735449735*G0_0_2 - 0.27089947089947*G0_1_0 - 0.541798941798942*G0_1_1 - 0.27089947089947*G0_1_2 - 0.135449735449735*G0_2_0 - 0.27089947089947*G0_2_1;
+    A[1038] = 0.0451499118165782*G0_0_1 + 0.0225749559082896*G0_0_2 + 0.0451499118165785*G0_1_0 + 0.135449735449736*G0_1_1 + 0.0677248677248681*G0_1_2 + 0.0225749559082893*G0_2_0 + 0.0677248677248678*G0_2_1;
+    A[1039] = 0.0677248677248679*G0_0_1 + 0.0451499118165781*G0_0_2 + 0.0677248677248678*G0_1_0 - 0.0677248677248676*G0_1_2 + 0.0451499118165791*G0_2_0 - 0.0677248677248673*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[1040] = 0.0451499118165784*G0_0_0 - 0.0451499118165784*G0_0_1 - 0.0451499118165787*G0_1_0 - 0.0225749559082902*G0_1_2 - 0.0225749559082894*G0_2_1 - 0.0451499118165789*G0_2_2;
+    A[1041] = -0.0451499118165784*G0_0_1 - 0.0225749559082888*G0_0_2 - 0.0451499118165784*G0_1_0 - 0.0225749559082887*G0_1_2 - 0.0225749559082893*G0_2_0 - 0.0225749559082891*G0_2_1 - 0.0451499118165783*G0_2_2;
+    A[1042] = -0.0677248677248673*G0_0_1 - 0.045149911816578*G0_0_2 - 0.0677248677248679*G0_1_0 - 0.0225749559082888*G0_1_2 - 0.0451499118165791*G0_2_0 - 0.0225749559082891*G0_2_1 - 0.0451499118165787*G0_2_2;
+    A[1043] = -0.451499118165784*G0_0_0 - 0.361199294532628*G0_0_1 - 0.225749559082893*G0_0_2 - 0.0902998236331568*G0_1_0 - 0.135449735449735*G0_1_1 - 0.0677248677248683*G0_1_2 - 0.225749559082892*G0_2_0 - 0.203174603174602*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[1044] = 0.632098765432098*G0_0_0 + 0.27089947089947*G0_0_1 + 0.27089947089947*G0_0_2 + 0.27089947089947*G0_1_0 + 0.541798941798941*G0_1_1 + 0.27089947089947*G0_1_2 + 0.27089947089947*G0_2_0 + 0.27089947089947*G0_2_1 + 0.541798941798942*G0_2_2;
+    A[1045] = -0.135449735449736*G0_0_0 - 0.0677248677248678*G0_0_1 + 0.0902998236331573*G0_0_2 + 0.0677248677248682*G0_1_0 - 0.0677248677248674*G0_1_2 + 0.0902998236331574*G0_2_0 + 0.0677248677248673*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[1046] = -0.225749559082892*G0_0_0 - 0.0451499118165787*G0_0_1 - 0.180599647266313*G0_0_2 - 0.0451499118165788*G0_1_0 - 0.0677248677248674*G0_1_2 - 0.180599647266314*G0_2_0 - 0.0677248677248677*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[1047] = 0.316049382716049*G0_0_0 + 0.135449735449735*G0_0_1 + 0.135449735449735*G0_0_2 + 0.135449735449735*G0_1_0 + 0.27089947089947*G0_1_2 + 0.135449735449735*G0_2_0 + 0.270899470899471*G0_2_1;
+    A[1048] = -0.0451499118165788*G0_0_0 - 0.0451499118165786*G0_0_1 - 0.0225749559082898*G0_0_2 - 0.0451499118165786*G0_1_0 - 0.0677248677248681*G0_1_2 - 0.0225749559082894*G0_2_0 - 0.0677248677248679*G0_2_1;
+    A[1049] = -0.0902998236331572*G0_0_0 + 0.316049382716049*G0_0_1 + 0.135449735449735*G0_0_2 + 0.316049382716049*G0_1_0 + 0.135449735449735*G0_1_2 + 0.135449735449735*G0_2_0 + 0.135449735449734*G0_2_1 + 0.27089947089947*G0_2_2;
+    A[1050] = -0.0253968253968253*G0_0_0 - 0.0253968253968253*G0_0_1 - 0.0253968253968253*G0_0_2 - 0.0183421516754853*G0_1_0 - 0.0183421516754853*G0_1_1 - 0.0183421516754853*G0_1_2 - 0.0253968253968253*G0_2_0 - 0.0253968253968253*G0_2_1 - 0.0253968253968252*G0_2_2;
+    A[1051] = -0.0253968253968254*G0_0_0 - 0.00705467372134063*G0_1_0;
+    A[1052] = 0.0183421516754851*G0_1_1;
+    A[1053] = -0.00705467372134029*G0_1_2 + 0.0423280423280423*G0_2_2;
+    A[1054] = -0.0677248677248678*G0_1_1 - 0.0112874779541445*G0_1_2 - 0.0112874779541447*G0_2_1;
+    A[1055] = 0.0846560846560847*G0_1_1 + 0.0423280423280424*G0_1_2 + 0.0423280423280422*G0_2_1 + 0.0225749559082886*G0_2_2;
+    A[1056] = -0.112874779541446*G0_1_1 - 0.101587301587302*G0_1_2 - 0.101587301587302*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[1057] = 0.135449735449736*G0_0_0 + 0.0338624338624342*G0_0_2 + 0.067724867724868*G0_1_0 + 0.022574955908289*G0_1_2 + 0.0338624338624335*G0_2_0;
+    A[1058] = -0.270899470899471*G0_0_0 - 0.0931216931216937*G0_0_2 - 0.186243386243387*G0_1_0 - 0.0507936507936504*G0_1_2 - 0.0931216931216927*G0_2_0 + 0.067724867724868*G0_2_2;
+    A[1059] = -0.101587301587301*G0_0_2 - 0.112874779541446*G0_1_0 - 0.203174603174604*G0_1_2 - 0.101587301587302*G0_2_0 - 0.270899470899472*G0_2_2;
+    A[1060] = 0.0451499118165786*G0_0_0 + 0.0338624338624341*G0_0_1 + 0.0338624338624341*G0_1_0 + 0.0225749559082891*G0_1_1;
+    A[1061] = 0.0225749559082891*G0_0_0 + 0.0197530864197528*G0_0_1 + 0.0197530864197529*G0_1_0 + 0.016931216931217*G0_1_1;
+    A[1062] = -0.0112874779541444*G0_0_1 - 0.0112874779541443*G0_1_0 - 0.0225749559082892*G0_1_1;
+    A[1063] = 0.135449735449736*G0_0_0 + 0.135449735449736*G0_0_1 + 0.101587301587301*G0_0_2 + 0.0677248677248679*G0_1_0 + 0.0677248677248679*G0_1_1 + 0.0564373897707237*G0_1_2 + 0.101587301587302*G0_2_0 + 0.101587301587302*G0_2_1 + 0.0677248677248671*G0_2_2;
+    A[1064] = -0.270899470899471*G0_0_0 - 0.270899470899471*G0_0_1 - 0.177777777777777*G0_0_2 - 0.0846560846560845*G0_1_0 - 0.0846560846560846*G0_1_1 - 0.0423280423280429*G0_1_2 - 0.177777777777778*G0_2_0 - 0.177777777777779*G0_2_1 - 0.016931216931216*G0_2_2;
+    A[1065] = 0.101587301587301*G0_0_2 + 0.112874779541446*G0_1_0 + 0.112874779541446*G0_1_1 + 0.0112874779541446*G0_1_2 + 0.101587301587302*G0_2_0 + 0.101587301587302*G0_2_1 - 0.0677248677248682*G0_2_2;
+    A[1066] = 0.0451499118165789*G0_0_0 + 0.0112874779541446*G0_0_1 + 0.045149911816579*G0_0_2 + 0.0112874779541446*G0_1_0 + 0.0112874779541447*G0_1_2 + 0.0451499118165789*G0_2_0 + 0.0112874779541444*G0_2_1 + 0.0451499118165789*G0_2_2;
+    A[1067] = 0.022574955908289*G0_0_0 + 0.00282186948853611*G0_0_1 + 0.022574955908289*G0_0_2 + 0.00282186948853596*G0_1_0 + 0.002821869488536*G0_1_2 + 0.0225749559082892*G0_2_0 + 0.00282186948853643*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[1068] = 0.0112874779541447*G0_0_1 + 0.0112874779541445*G0_1_0 + 0.0112874779541445*G0_1_2 + 0.0112874779541442*G0_2_1;
+    A[1069] = 0.0225749559082892*G0_0_0 + 0.0564373897707235*G0_0_1 + 0.0564373897707235*G0_0_2 + 0.0112874779541451*G0_1_0 + 0.0225749559082893*G0_1_1 + 0.0225749559082894*G0_1_2 + 0.056437389770723*G0_2_0 + 0.0902998236331576*G0_2_1 + 0.0902998236331575*G0_2_2;
+    A[1070] = 0.00564373897707241*G0_0_0 + 0.00282186948853617*G0_0_1 + 0.00282186948853616*G0_0_2 + 0.00282186948853587*G0_1_0 - 0.0169312169312171*G0_1_1 - 0.0169312169312171*G0_1_2 + 0.00282186948853634*G0_2_0 + 0.0677248677248679*G0_2_1 + 0.0677248677248679*G0_2_2;
+    A[1071] = 0.0225749559082891*G0_0_0 - 0.0338624338624341*G0_0_1 - 0.0338624338624341*G0_0_2 + 0.0112874779541449*G0_1_0 - 0.022574955908289*G0_1_1 - 0.022574955908289*G0_1_2 - 0.0338624338624341*G0_2_0;
+    A[1072] = -0.135449735449736*G0_0_0 - 0.0677248677248682*G0_0_1 + 0.0451499118165782*G0_0_2 - 0.0677248677248676*G0_1_0 + 0.0677248677248678*G0_1_2 + 0.0451499118165783*G0_2_0 + 0.0677248677248673*G0_2_1;
+    A[1073] = 0.0677248677248671*G0_0_1 + 0.0225749559082892*G0_0_2 + 0.0677248677248678*G0_1_0 + 0.135449735449736*G0_1_1 + 0.0451499118165783*G0_1_2 + 0.0225749559082887*G0_2_0 + 0.0451499118165779*G0_2_1;
+    A[1074] = -0.270899470899471*G0_0_1 - 0.135449735449736*G0_0_2 - 0.270899470899471*G0_1_0 - 0.541798941798943*G0_1_1 - 0.270899470899471*G0_1_2 - 0.135449735449737*G0_2_0 - 0.270899470899471*G0_2_1 + 0.0451499118165778*G0_2_2;
+    A[1075] = -0.135449735449736*G0_0_0 - 0.0677248677248681*G0_0_1 - 0.180599647266315*G0_0_2 - 0.0677248677248679*G0_1_0 - 0.0451499118165786*G0_1_2 - 0.180599647266315*G0_2_0 - 0.0451499118165791*G0_2_1 - 0.225749559082894*G0_2_2;
+    A[1076] = -0.0677248677248676*G0_0_1 - 0.0225749559082885*G0_0_2 - 0.0677248677248678*G0_1_0 - 0.0451499118165781*G0_1_2 - 0.0225749559082888*G0_2_0 - 0.0451499118165782*G0_2_1 - 0.0451499118165778*G0_2_2;
+    A[1077] = 0.270899470899471*G0_0_1 + 0.135449735449736*G0_0_2 + 0.270899470899471*G0_1_0 + 0.135449735449735*G0_1_2 + 0.135449735449737*G0_2_0 + 0.135449735449736*G0_2_1 + 0.316049382716051*G0_2_2;
+    A[1078] = -0.135449735449736*G0_0_0 - 0.203174603174603*G0_0_1 - 0.225749559082893*G0_0_2 - 0.0677248677248683*G0_1_0 - 0.135449735449736*G0_1_1 - 0.0902998236331571*G0_1_2 - 0.225749559082893*G0_2_0 - 0.361199294532629*G0_2_1 - 0.451499118165786*G0_2_2;
+    A[1079] = -0.135449735449736*G0_0_0 + 0.0677248677248682*G0_0_1 + 0.0902998236331574*G0_0_2 - 0.0677248677248678*G0_1_0 + 0.0677248677248674*G0_1_2 + 0.0902998236331573*G0_2_0 - 0.0677248677248674*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[1080] = 0.541798941798942*G0_0_0 + 0.270899470899471*G0_0_1 + 0.270899470899471*G0_0_2 + 0.270899470899471*G0_1_0 + 0.541798941798943*G0_1_1 + 0.270899470899472*G0_1_2 + 0.270899470899471*G0_2_0 + 0.270899470899472*G0_2_1 + 0.6320987654321*G0_2_2;
+    A[1081] = -0.045149911816579*G0_0_0 - 0.0225749559082898*G0_0_1 - 0.0225749559082895*G0_1_0 - 0.0451499118165787*G0_1_2 - 0.0451499118165793*G0_2_1 + 0.0451499118165781*G0_2_2;
+    A[1082] = -0.0451499118165786*G0_0_0 - 0.0225749559082891*G0_0_1 - 0.0451499118165783*G0_0_2 - 0.0225749559082892*G0_1_0 - 0.0677248677248677*G0_1_2 - 0.0451499118165783*G0_2_0 - 0.067724867724868*G0_2_1;
+    A[1083] = -0.0451499118165782*G0_0_0 - 0.0225749559082892*G0_0_1 - 0.0225749559082894*G0_0_2 - 0.0225749559082888*G0_1_0 - 0.0451499118165786*G0_1_2 - 0.0225749559082891*G0_2_0 - 0.0451499118165782*G0_2_1;
+    A[1084] = 0.270899470899472*G0_0_0 + 0.135449735449736*G0_0_1 + 0.135449735449737*G0_0_2 + 0.135449735449736*G0_1_0 + 0.31604938271605*G0_1_2 + 0.135449735449737*G0_2_0 + 0.316049382716051*G0_2_1 - 0.0902998236331556*G0_2_2;
+    A[1085] = 0.0423280423280421*G0_0_0 + 0.0423280423280421*G0_0_1 + 0.0423280423280421*G0_0_2 + 0.0423280423280422*G0_1_0 + 0.0423280423280422*G0_1_1 + 0.0423280423280422*G0_1_2 + 0.0493827160493826*G0_2_0 + 0.0493827160493826*G0_2_1 + 0.0493827160493826*G0_2_2;
+    A[1086] = -0.0253968253968254*G0_0_0 - 0.00705467372134038*G0_2_0;
+    A[1087] = -0.0253968253968254*G0_1_1 - 0.00705467372134047*G0_2_1;
+    A[1088] = 0.018342151675485*G0_2_2;
+    A[1089] = 0.0451499118165788*G0_1_1 + 0.0338624338624341*G0_1_2 + 0.0338624338624339*G0_2_1 + 0.022574955908289*G0_2_2;
+    A[1090] = 0.0225749559082893*G0_1_1 + 0.0197530864197531*G0_1_2 + 0.0197530864197532*G0_2_1 + 0.0169312169312173*G0_2_2;
+    A[1091] = -0.0112874779541446*G0_1_2 - 0.0112874779541448*G0_2_1 - 0.0225749559082896*G0_2_2;
+    A[1092] = 0.0451499118165784*G0_0_0 + 0.0338624338624338*G0_0_2 + 0.0338624338624337*G0_2_0 + 0.0225749559082892*G0_2_2;
+    A[1093] = 0.0225749559082894*G0_0_0 + 0.0197530864197536*G0_0_2 + 0.0197530864197533*G0_2_0 + 0.0169312169312171*G0_2_2;
+    A[1094] = -0.0112874779541448*G0_0_2 - 0.0112874779541448*G0_2_0 - 0.0225749559082893*G0_2_2;
+    A[1095] = 0.0902998236331568*G0_0_0 + 0.0338624338624339*G0_0_1 + 0.033862433862434*G0_1_0 + 0.0677248677248677*G0_2_0 + 0.0225749559082892*G0_2_1;
+    A[1096] = 0.0677248677248675*G0_0_0 + 0.0649029982363313*G0_0_1 + 0.0649029982363311*G0_1_0 + 0.0677248677248673*G0_1_1 + 0.0846560846560842*G0_2_0 + 0.0846560846560842*G0_2_1;
+    A[1097] = 0.0338624338624337*G0_0_1 + 0.0338624338624341*G0_1_0 + 0.0902998236331571*G0_1_1 + 0.0225749559082891*G0_2_0 + 0.0677248677248675*G0_2_1;
+    A[1098] = -0.135449735449736*G0_0_0 - 0.135449735449735*G0_0_1 - 0.0338624338624334*G0_0_2 - 0.135449735449736*G0_1_0 - 0.135449735449736*G0_1_1 - 0.0338624338624336*G0_1_2 - 0.0338624338624336*G0_2_0 - 0.0338624338624335*G0_2_1 - 0.0451499118165782*G0_2_2;
+    A[1099] = 0.0225749559082896*G0_0_0 + 0.0225749559082896*G0_0_1 - 0.0197530864197535*G0_0_2 + 0.0225749559082897*G0_1_0 + 0.0225749559082896*G0_1_1 - 0.0197530864197532*G0_1_2 - 0.0197530864197531*G0_2_0 - 0.0197530864197532*G0_2_1 + 0.0225749559082892*G0_2_2;
+    A[1100] = 0.0112874779541449*G0_0_2 + 0.0112874779541448*G0_1_2 + 0.0112874779541447*G0_2_0 + 0.0112874779541448*G0_2_1 - 0.0451499118165783*G0_2_2;
+    A[1101] = -0.270899470899471*G0_0_0 - 0.169312169312169*G0_0_1 - 0.270899470899471*G0_0_2 - 0.16931216931217*G0_1_0 - 0.0677248677248675*G0_1_1 - 0.16931216931217*G0_1_2 - 0.0677248677248675*G0_2_0 - 0.0790123456790122*G0_2_1 - 0.0677248677248675*G0_2_2;
+    A[1102] = 0.0677248677248675*G0_0_0 + 0.16084656084656*G0_0_1 + 0.0677248677248674*G0_0_2 + 0.160846560846561*G0_1_0 - 0.0169312169312173*G0_1_1 + 0.160846560846561*G0_1_2 + 0.118518518518518*G0_2_0 + 0.0253968253968253*G0_2_1 + 0.118518518518518*G0_2_2;
+    A[1103] = -0.0338624338624335*G0_0_1 - 0.033862433862434*G0_1_0 + 0.067724867724868*G0_1_1 - 0.033862433862434*G0_1_2 - 0.022574955908289*G0_2_0 + 0.0112874779541447*G0_2_1 - 0.0225749559082889*G0_2_2;
+    A[1104] = -0.0677248677248674*G0_0_0 - 0.16931216931217*G0_0_1 - 0.16931216931217*G0_0_2 - 0.169312169312169*G0_1_0 - 0.270899470899471*G0_1_1 - 0.270899470899471*G0_1_2 - 0.0790123456790121*G0_2_0 - 0.0677248677248675*G0_2_1 - 0.0677248677248675*G0_2_2;
+    A[1105] = -0.0169312169312172*G0_0_0 + 0.160846560846561*G0_0_1 + 0.160846560846561*G0_0_2 + 0.16084656084656*G0_1_0 + 0.0677248677248673*G0_1_1 + 0.0677248677248674*G0_1_2 + 0.0253968253968251*G0_2_0 + 0.118518518518518*G0_2_1 + 0.118518518518518*G0_2_2;
+    A[1106] = 0.0677248677248678*G0_0_0 - 0.0338624338624337*G0_0_1 - 0.0338624338624338*G0_0_2 - 0.0338624338624335*G0_1_0 + 0.0112874779541448*G0_2_0 - 0.0225749559082891*G0_2_1 - 0.0225749559082891*G0_2_2;
+    A[1107] = 0.0451499118165789*G0_0_0 + 0.0451499118165787*G0_0_1 + 0.0902998236331567*G0_0_2 + 0.0451499118165786*G0_1_0 + 0.0677248677248673*G0_1_2 + 0.0902998236331567*G0_2_0 + 0.0677248677248675*G0_2_1 + 0.135449735449735*G0_2_2;
+    A[1108] = 0.0451499118165788*G0_0_1 + 0.0677248677248674*G0_0_2 + 0.045149911816579*G0_1_0 + 0.0451499118165786*G0_1_1 + 0.0902998236331569*G0_1_2 + 0.0677248677248675*G0_2_0 + 0.0902998236331564*G0_2_1 + 0.135449735449734*G0_2_2;
+    A[1109] = 0.0225749559082895*G0_0_1 + 0.0451499118165793*G0_0_2 + 0.0225749559082894*G0_1_0 + 0.0451499118165791*G0_1_2 + 0.0451499118165787*G0_2_0 + 0.0451499118165786*G0_2_1 + 0.0902998236331574*G0_2_2;
+    A[1110] = 0.0451499118165789*G0_0_0 + 0.180599647266314*G0_0_1 + 0.31604938271605*G0_0_2 + 0.180599647266315*G0_1_0 + 0.31604938271605*G0_1_1 + 0.180599647266315*G0_1_2 + 0.31604938271605*G0_2_0 + 0.180599647266314*G0_2_1 + 0.0451499118165786*G0_2_2;
+    A[1111] = -0.0451499118165786*G0_0_1 - 0.0677248677248678*G0_0_2 - 0.0451499118165789*G0_1_0 - 0.225749559082893*G0_1_1 - 0.180599647266314*G0_1_2 - 0.0677248677248675*G0_2_0 - 0.180599647266314*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[1112] = -0.0225749559082895*G0_0_1 - 0.045149911816579*G0_0_2 - 0.0225749559082893*G0_1_0 - 0.0451499118165787*G0_1_1 - 0.0451499118165785*G0_2_0 + 0.0451499118165784*G0_2_2;
+    A[1113] = 0.31604938271605*G0_0_0 + 0.180599647266314*G0_0_1 + 0.180599647266315*G0_0_2 + 0.180599647266315*G0_1_0 + 0.045149911816579*G0_1_1 + 0.31604938271605*G0_1_2 + 0.180599647266314*G0_2_0 + 0.316049382716049*G0_2_1 + 0.0451499118165784*G0_2_2;
+    A[1114] = -0.225749559082892*G0_0_0 - 0.0451499118165788*G0_0_1 - 0.180599647266314*G0_0_2 - 0.0451499118165787*G0_1_0 - 0.0677248677248677*G0_1_2 - 0.180599647266313*G0_2_0 - 0.0677248677248674*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[1115] = -0.045149911816579*G0_0_0 - 0.0225749559082895*G0_0_1 - 0.0225749559082898*G0_1_0 - 0.0451499118165793*G0_1_2 - 0.0451499118165788*G0_2_1 + 0.0451499118165781*G0_2_2;
+    A[1116] = 0.632098765432099*G0_0_0 + 0.361199294532628*G0_0_1 + 0.361199294532628*G0_0_2 + 0.361199294532628*G0_1_0 + 0.632098765432099*G0_1_1 + 0.361199294532628*G0_1_2 + 0.361199294532627*G0_2_0 + 0.361199294532628*G0_2_1 + 0.632098765432099*G0_2_2;
+    A[1117] = -0.451499118165785*G0_0_0 - 0.225749559082892*G0_0_1 - 0.0902998236331567*G0_0_2 - 0.225749559082892*G0_1_0 - 0.135449735449735*G0_1_1 - 0.0677248677248675*G0_1_2 - 0.361199294532628*G0_2_0 - 0.203174603174602*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[1118] = -0.135449735449735*G0_0_0 - 0.225749559082892*G0_0_1 - 0.0677248677248671*G0_0_2 - 0.225749559082892*G0_1_0 - 0.451499118165785*G0_1_1 - 0.0902998236331566*G0_1_2 - 0.203174603174603*G0_2_0 - 0.361199294532628*G0_2_1 - 0.135449735449734*G0_2_2;
+    A[1119] = -0.0902998236331582*G0_0_0 - 0.225749559082893*G0_0_1 - 0.406349206349207*G0_0_2 - 0.225749559082894*G0_1_0 - 0.0902998236331575*G0_1_1 - 0.406349206349207*G0_1_2 - 0.406349206349207*G0_2_0 - 0.406349206349206*G0_2_1 - 0.722398589065256*G0_2_2;
+    A[1120] = -0.0253968253968252*G0_0_0 - 0.0253968253968252*G0_0_1 - 0.0253968253968252*G0_0_2 - 0.0253968253968253*G0_1_0 - 0.0253968253968254*G0_1_1 - 0.0253968253968253*G0_1_2 - 0.0183421516754849*G0_2_0 - 0.0183421516754849*G0_2_1 - 0.0183421516754848*G0_2_2;
+    A[1121] = 0.0423280423280422*G0_0_0 - 0.00705467372134043*G0_2_0;
+    A[1122] = -0.0253968253968254*G0_1_1 - 0.00705467372134051*G0_2_1;
+    A[1123] = 0.0183421516754851*G0_2_2;
+    A[1124] = 0.0451499118165786*G0_1_1 + 0.0338624338624339*G0_1_2 + 0.0338624338624339*G0_2_1 + 0.022574955908289*G0_2_2;
+    A[1125] = 0.0225749559082893*G0_1_1 + 0.0197530864197531*G0_1_2 + 0.0197530864197531*G0_2_1 + 0.0169312169312171*G0_2_2;
+    A[1126] = -0.0112874779541445*G0_1_2 - 0.0112874779541449*G0_2_1 - 0.0225749559082897*G0_2_2;
+    A[1127] = -0.135449735449735*G0_0_0 - 0.101587301587302*G0_0_2 - 0.101587301587301*G0_2_0 - 0.112874779541446*G0_2_2;
+    A[1128] = 0.0225749559082892*G0_0_0 + 0.0423280423280423*G0_0_2 + 0.0423280423280425*G0_2_0 + 0.0846560846560851*G0_2_2;
+    A[1129] = -0.0112874779541446*G0_0_2 - 0.0112874779541448*G0_2_0 - 0.0677248677248681*G0_2_2;
+    A[1130] = -0.270899470899471*G0_0_0 - 0.101587301587302*G0_0_1 - 0.101587301587301*G0_1_0 - 0.203174603174603*G0_2_0 - 0.112874779541446*G0_2_1;
+    A[1131] = 0.0677248677248679*G0_0_0 - 0.0931216931216928*G0_0_1 - 0.0931216931216933*G0_1_0 - 0.270899470899471*G0_1_1 - 0.0507936507936508*G0_2_0 - 0.186243386243386*G0_2_1;
+    A[1132] = 0.0338624338624338*G0_0_1 + 0.033862433862434*G0_1_0 + 0.135449735449736*G0_1_1 + 0.0225749559082891*G0_2_0 + 0.0677248677248677*G0_2_1;
+    A[1133] = 0.0451499118165785*G0_0_0 + 0.0451499118165783*G0_0_1 + 0.0112874779541441*G0_0_2 + 0.0451499118165786*G0_1_0 + 0.0451499118165784*G0_1_1 + 0.0112874779541447*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0112874779541446*G0_2_1;
+    A[1134] = 0.0225749559082893*G0_0_0 + 0.0225749559082892*G0_0_1 + 0.00282186948853655*G0_0_2 + 0.0225749559082891*G0_1_0 + 0.0225749559082892*G0_1_1 + 0.00282186948853577*G0_1_2 + 0.00282186948853563*G0_2_0 + 0.00282186948853566*G0_2_1;
+    A[1135] = 0.0112874779541443*G0_0_2 + 0.0112874779541447*G0_1_2 + 0.0112874779541448*G0_2_0 + 0.0112874779541449*G0_2_1;
+    A[1136] = 0.090299823633157*G0_0_0 + 0.0564373897707228*G0_0_1 + 0.090299823633157*G0_0_2 + 0.056437389770723*G0_1_0 + 0.0225749559082892*G0_1_1 + 0.0564373897707229*G0_1_2 + 0.0225749559082893*G0_2_0 + 0.0112874779541444*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[1137] = 0.0677248677248676*G0_0_0 + 0.00282186948853633*G0_0_1 + 0.0677248677248677*G0_0_2 + 0.00282186948853632*G0_1_0 + 0.00564373897707231*G0_1_1 + 0.00282186948853639*G0_1_2 - 0.016931216931217*G0_2_0 + 0.00282186948853621*G0_2_1 - 0.0169312169312171*G0_2_2;
+    A[1138] = -0.0338624338624339*G0_0_1 - 0.033862433862434*G0_1_0 + 0.0225749559082892*G0_1_1 - 0.0338624338624341*G0_1_2 - 0.0225749559082891*G0_2_0 + 0.0112874779541446*G0_2_1 - 0.0225749559082892*G0_2_2;
+    A[1139] = 0.0677248677248673*G0_0_0 + 0.101587301587302*G0_0_1 + 0.101587301587302*G0_0_2 + 0.101587301587301*G0_1_0 + 0.135449735449735*G0_1_1 + 0.135449735449735*G0_1_2 + 0.0564373897707228*G0_2_0 + 0.0677248677248677*G0_2_1 + 0.0677248677248676*G0_2_2;
+    A[1140] = -0.0169312169312166*G0_0_0 - 0.177777777777778*G0_0_1 - 0.177777777777778*G0_0_2 - 0.177777777777778*G0_1_0 - 0.270899470899471*G0_1_1 - 0.270899470899471*G0_1_2 - 0.0423280423280418*G0_2_0 - 0.0846560846560841*G0_2_1 - 0.0846560846560841*G0_2_2;
+    A[1141] = -0.0677248677248677*G0_0_0 + 0.101587301587302*G0_0_1 + 0.101587301587302*G0_0_2 + 0.101587301587302*G0_1_0 + 0.0112874779541445*G0_2_0 + 0.112874779541446*G0_2_1 + 0.112874779541446*G0_2_2;
+    A[1142] = 0.0451499118165786*G0_0_0 - 0.135449735449735*G0_0_1 - 0.270899470899471*G0_0_2 - 0.135449735449735*G0_1_0 - 0.27089947089947*G0_1_2 - 0.270899470899471*G0_2_0 - 0.27089947089947*G0_2_1 - 0.541798941798942*G0_2_2;
+    A[1143] = 0.0451499118165787*G0_0_1 + 0.0677248677248681*G0_0_2 + 0.0451499118165785*G0_1_0 - 0.135449735449736*G0_1_1 - 0.0677248677248678*G0_1_2 + 0.0677248677248677*G0_2_0 - 0.0677248677248679*G0_2_1;
+    A[1144] = 0.0225749559082892*G0_0_1 + 0.0451499118165782*G0_0_2 + 0.0225749559082894*G0_1_0 + 0.0677248677248678*G0_1_2 + 0.0451499118165781*G0_2_0 + 0.0677248677248677*G0_2_1 + 0.135449735449736*G0_2_2;
+    A[1145] = 0.0451499118165783*G0_0_0 - 0.0451499118165788*G0_0_2 - 0.0451499118165782*G0_1_1 - 0.0225749559082892*G0_1_2 - 0.0451499118165787*G0_2_0 - 0.0225749559082893*G0_2_1;
+    A[1146] = -0.0451499118165783*G0_0_1 - 0.0677248677248676*G0_0_2 - 0.0451499118165786*G0_1_0 - 0.0451499118165789*G0_1_1 - 0.0225749559082894*G0_1_2 - 0.0677248677248677*G0_2_0 - 0.0225749559082894*G0_2_1;
+    A[1147] = -0.0225749559082892*G0_0_1 - 0.0451499118165779*G0_0_2 - 0.0225749559082894*G0_1_0 - 0.0451499118165786*G0_1_1 - 0.0225749559082893*G0_1_2 - 0.0451499118165782*G0_2_0 - 0.0225749559082888*G0_2_1;
+    A[1148] = -0.225749559082892*G0_0_0 - 0.180599647266314*G0_0_1 - 0.0451499118165785*G0_0_2 - 0.180599647266314*G0_1_0 - 0.135449735449735*G0_1_1 - 0.0677248677248675*G0_1_2 - 0.0451499118165783*G0_2_0 - 0.0677248677248676*G0_2_1;
+    A[1149] = 0.316049382716049*G0_0_0 + 0.135449735449735*G0_0_1 + 0.135449735449735*G0_0_2 + 0.135449735449735*G0_1_0 + 0.270899470899471*G0_1_2 + 0.135449735449735*G0_2_0 + 0.27089947089947*G0_2_1;
+    A[1150] = -0.0451499118165786*G0_0_0 - 0.0225749559082892*G0_0_1 - 0.0451499118165783*G0_0_2 - 0.0225749559082891*G0_1_0 - 0.067724867724868*G0_1_2 - 0.0451499118165783*G0_2_0 - 0.0677248677248677*G0_2_1;
+    A[1151] = -0.451499118165785*G0_0_0 - 0.225749559082892*G0_0_1 - 0.361199294532628*G0_0_2 - 0.225749559082892*G0_1_0 - 0.135449735449735*G0_1_1 - 0.203174603174602*G0_1_2 - 0.0902998236331567*G0_2_0 - 0.0677248677248675*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[1152] = 0.632098765432099*G0_0_0 + 0.27089947089947*G0_0_1 + 0.270899470899471*G0_0_2 + 0.27089947089947*G0_1_0 + 0.541798941798942*G0_1_1 + 0.27089947089947*G0_1_2 + 0.270899470899471*G0_2_0 + 0.27089947089947*G0_2_1 + 0.541798941798942*G0_2_2;
+    A[1153] = -0.135449735449736*G0_0_0 + 0.0902998236331569*G0_0_1 - 0.0677248677248682*G0_0_2 + 0.0902998236331571*G0_1_0 - 0.135449735449736*G0_1_1 + 0.0677248677248678*G0_1_2 + 0.0677248677248679*G0_2_0 - 0.0677248677248676*G0_2_1;
+    A[1154] = -0.0902998236331566*G0_0_0 + 0.135449735449735*G0_0_1 + 0.316049382716049*G0_0_2 + 0.135449735449735*G0_1_0 + 0.270899470899471*G0_1_1 + 0.135449735449735*G0_1_2 + 0.316049382716049*G0_2_0 + 0.135449735449736*G0_2_1;
+    A[1155] = -0.0253968253968253*G0_0_0 - 0.0253968253968252*G0_0_1 - 0.0253968253968253*G0_0_2 - 0.0253968253968253*G0_1_0 - 0.0253968253968252*G0_1_1 - 0.0253968253968253*G0_1_2 - 0.0183421516754849*G0_2_0 - 0.018342151675485*G0_2_1 - 0.0183421516754849*G0_2_2;
+    A[1156] = -0.0253968253968254*G0_0_0 - 0.00705467372134036*G0_2_0;
+    A[1157] = 0.0423280423280423*G0_1_1 - 0.00705467372134033*G0_2_1;
+    A[1158] = 0.018342151675485*G0_2_2;
+    A[1159] = -0.135449735449736*G0_1_1 - 0.101587301587302*G0_1_2 - 0.101587301587302*G0_2_1 - 0.112874779541446*G0_2_2;
+    A[1160] = 0.0225749559082892*G0_1_1 + 0.0423280423280425*G0_1_2 + 0.0423280423280424*G0_2_1 + 0.0846560846560844*G0_2_2;
+    A[1161] = -0.0112874779541447*G0_1_2 - 0.0112874779541449*G0_2_1 - 0.0677248677248677*G0_2_2;
+    A[1162] = 0.0451499118165786*G0_0_0 + 0.0338624338624339*G0_0_2 + 0.0338624338624338*G0_2_0 + 0.0225749559082893*G0_2_2;
+    A[1163] = 0.0225749559082891*G0_0_0 + 0.0197530864197532*G0_0_2 + 0.0197530864197535*G0_2_0 + 0.0169312169312173*G0_2_2;
+    A[1164] = -0.0112874779541448*G0_0_2 - 0.0112874779541448*G0_2_0 - 0.0225749559082893*G0_2_2;
+    A[1165] = 0.135449735449735*G0_0_0 + 0.0338624338624339*G0_0_1 + 0.0338624338624336*G0_1_0 + 0.0677248677248678*G0_2_0 + 0.0225749559082893*G0_2_1;
+    A[1166] = -0.270899470899471*G0_0_0 - 0.0931216931216931*G0_0_1 - 0.0931216931216925*G0_1_0 + 0.0677248677248683*G0_1_1 - 0.186243386243386*G0_2_0 - 0.0507936507936508*G0_2_1;
+    A[1167] = -0.101587301587301*G0_0_1 - 0.101587301587302*G0_1_0 - 0.270899470899471*G0_1_1 - 0.112874779541446*G0_2_0 - 0.203174603174603*G0_2_1;
+    A[1168] = 0.0451499118165785*G0_0_0 + 0.0451499118165784*G0_0_1 + 0.0112874779541444*G0_0_2 + 0.0451499118165783*G0_1_0 + 0.0451499118165784*G0_1_1 + 0.0112874779541442*G0_1_2 + 0.0112874779541446*G0_2_0 + 0.0112874779541446*G0_2_1;
+    A[1169] = 0.0225749559082891*G0_0_0 + 0.0225749559082892*G0_0_1 + 0.00282186948853609*G0_0_2 + 0.0225749559082893*G0_1_0 + 0.0225749559082894*G0_1_1 + 0.00282186948853646*G0_1_2 + 0.002821869488536*G0_2_0 + 0.00282186948853593*G0_2_1;
+    A[1170] = 0.0112874779541446*G0_0_2 + 0.0112874779541444*G0_1_2 + 0.0112874779541448*G0_2_0 + 0.0112874779541448*G0_2_1;
+    A[1171] = 0.135449735449735*G0_0_0 + 0.101587301587301*G0_0_1 + 0.135449735449735*G0_0_2 + 0.101587301587301*G0_1_0 + 0.0677248677248674*G0_1_1 + 0.101587301587301*G0_1_2 + 0.0677248677248676*G0_2_0 + 0.0564373897707229*G0_2_1 + 0.0677248677248675*G0_2_2;
+    A[1172] = -0.270899470899471*G0_0_0 - 0.177777777777777*G0_0_1 - 0.270899470899471*G0_0_2 - 0.177777777777778*G0_1_0 - 0.0169312169312165*G0_1_1 - 0.177777777777778*G0_1_2 - 0.0846560846560845*G0_2_0 - 0.0423280423280421*G0_2_1 - 0.0846560846560845*G0_2_2;
+    A[1173] = 0.101587301587301*G0_0_1 + 0.101587301587302*G0_1_0 - 0.0677248677248679*G0_1_1 + 0.101587301587302*G0_1_2 + 0.112874779541446*G0_2_0 + 0.0112874779541444*G0_2_1 + 0.112874779541446*G0_2_2;
+    A[1174] = 0.0225749559082891*G0_0_0 + 0.056437389770723*G0_0_1 + 0.0564373897707231*G0_0_2 + 0.056437389770723*G0_1_0 + 0.0902998236331571*G0_1_1 + 0.0902998236331571*G0_1_2 + 0.0112874779541447*G0_2_0 + 0.0225749559082893*G0_2_1 + 0.0225749559082893*G0_2_2;
+    A[1175] = 0.00564373897707234*G0_0_0 + 0.00282186948853632*G0_0_1 + 0.0028218694885363*G0_0_2 + 0.00282186948853616*G0_1_0 + 0.0677248677248681*G0_1_1 + 0.0677248677248679*G0_1_2 + 0.00282186948853582*G0_2_0 - 0.0169312169312168*G0_2_1 - 0.0169312169312168*G0_2_2;
+    A[1176] = 0.0225749559082892*G0_0_0 - 0.033862433862434*G0_0_1 - 0.033862433862434*G0_0_2 - 0.033862433862434*G0_1_0 + 0.0112874779541448*G0_2_0 - 0.0225749559082894*G0_2_1 - 0.0225749559082893*G0_2_2;
+    A[1177] = -0.135449735449736*G0_0_0 + 0.0451499118165787*G0_0_1 - 0.0677248677248678*G0_0_2 + 0.0451499118165786*G0_1_0 + 0.067724867724868*G0_1_2 - 0.0677248677248675*G0_2_0 + 0.0677248677248683*G0_2_1;
+    A[1178] = -0.135449735449736*G0_0_1 - 0.270899470899471*G0_0_2 - 0.135449735449736*G0_1_0 + 0.0451499118165789*G0_1_1 - 0.270899470899471*G0_1_2 - 0.270899470899471*G0_2_0 - 0.270899470899472*G0_2_1 - 0.541798941798942*G0_2_2;
+    A[1179] = 0.0225749559082888*G0_0_1 + 0.0677248677248672*G0_0_2 + 0.0225749559082891*G0_1_0 + 0.0451499118165781*G0_1_2 + 0.0677248677248675*G0_2_0 + 0.0451499118165788*G0_2_1 + 0.135449735449735*G0_2_2;
+    A[1180] = -0.135449735449735*G0_0_0 - 0.180599647266314*G0_0_1 - 0.0677248677248672*G0_0_2 - 0.180599647266314*G0_1_0 - 0.225749559082892*G0_1_1 - 0.0451499118165784*G0_1_2 - 0.067724867724867*G0_2_0 - 0.045149911816578*G0_2_1;
+    A[1181] = 0.135449735449735*G0_0_1 + 0.270899470899471*G0_0_2 + 0.135449735449736*G0_1_0 + 0.31604938271605*G0_1_1 + 0.135449735449736*G0_1_2 + 0.270899470899471*G0_2_0 + 0.135449735449735*G0_2_1;
+    A[1182] = -0.0225749559082892*G0_0_1 - 0.0677248677248682*G0_0_2 - 0.0225749559082892*G0_1_0 - 0.0451499118165787*G0_1_1 - 0.0451499118165787*G0_1_2 - 0.0677248677248678*G0_2_0 - 0.0451499118165784*G0_2_1;
+    A[1183] = -0.0451499118165786*G0_0_0 - 0.0225749559082892*G0_0_2 + 0.0451499118165786*G0_1_1 - 0.0451499118165786*G0_1_2 - 0.022574955908289*G0_2_0 - 0.0451499118165775*G0_2_1;
+    A[1184] = -0.0451499118165788*G0_0_0 - 0.0451499118165786*G0_0_1 - 0.0225749559082894*G0_0_2 - 0.0451499118165786*G0_1_0 - 0.0677248677248679*G0_1_2 - 0.0225749559082898*G0_2_0 - 0.0677248677248681*G0_2_1;
+    A[1185] = -0.0451499118165782*G0_0_0 - 0.0225749559082888*G0_0_1 - 0.0225749559082891*G0_0_2 - 0.0225749559082892*G0_1_0 - 0.0451499118165782*G0_1_2 - 0.0225749559082894*G0_2_0 - 0.0451499118165786*G0_2_1;
+    A[1186] = -0.135449735449735*G0_0_0 - 0.225749559082892*G0_0_1 - 0.203174603174603*G0_0_2 - 0.225749559082892*G0_1_0 - 0.451499118165785*G0_1_1 - 0.361199294532628*G0_1_2 - 0.0677248677248671*G0_2_0 - 0.0902998236331566*G0_2_1 - 0.135449735449734*G0_2_2;
+    A[1187] = -0.135449735449736*G0_0_0 + 0.0902998236331571*G0_0_1 + 0.0677248677248679*G0_0_2 + 0.0902998236331569*G0_1_0 - 0.135449735449736*G0_1_1 - 0.0677248677248676*G0_1_2 - 0.0677248677248682*G0_2_0 + 0.0677248677248678*G0_2_1;
+    A[1188] = 0.541798941798942*G0_0_0 + 0.27089947089947*G0_0_1 + 0.270899470899471*G0_0_2 + 0.27089947089947*G0_1_0 + 0.632098765432099*G0_1_1 + 0.27089947089947*G0_1_2 + 0.270899470899471*G0_2_0 + 0.27089947089947*G0_2_1 + 0.541798941798942*G0_2_2;
+    A[1189] = 0.270899470899471*G0_0_0 + 0.135449735449736*G0_0_1 + 0.135449735449735*G0_0_2 + 0.135449735449736*G0_1_0 - 0.0902998236331575*G0_1_1 + 0.316049382716049*G0_1_2 + 0.135449735449735*G0_2_0 + 0.316049382716049*G0_2_1;
+    A[1190] = -0.0677248677248679*G0_0_0 - 0.0677248677248678*G0_0_1 - 0.0677248677248678*G0_0_2 - 0.0677248677248678*G0_1_0 - 0.0677248677248679*G0_1_1 - 0.0677248677248678*G0_1_2 - 0.067724867724868*G0_2_0 - 0.067724867724868*G0_2_1 - 0.0677248677248681*G0_2_2;
+    A[1191] = -0.0677248677248677*G0_0_0;
+    A[1192] = -0.0677248677248675*G0_1_1;
+    A[1193] = -0.0677248677248676*G0_2_2;
+    A[1194] = 0.0902998236331569*G0_1_1;
+    A[1195] = -0.135449735449736*G0_1_1 - 0.112874779541448*G0_1_2 - 0.112874779541446*G0_2_1 - 0.135449735449736*G0_2_2;
+    A[1196] = 0.0902998236331575*G0_2_2;
+    A[1197] = 0.0902998236331571*G0_0_0;
+    A[1198] = -0.135449735449736*G0_0_0 - 0.112874779541446*G0_0_2 - 0.112874779541447*G0_2_0 - 0.135449735449736*G0_2_2;
+    A[1199] = 0.0902998236331568*G0_2_2;
+    A[1200] = 0.090299823633157*G0_0_0;
+    A[1201] = -0.135449735449735*G0_0_0 - 0.112874779541446*G0_0_1 - 0.112874779541447*G0_1_0 - 0.135449735449736*G0_1_1;
+    A[1202] = 0.0902998236331575*G0_1_1;
+    A[1203] = 0.0902998236331572*G0_0_0 + 0.0902998236331572*G0_0_1 + 0.0902998236331568*G0_0_2 + 0.0902998236331573*G0_1_0 + 0.0902998236331571*G0_1_1 + 0.090299823633157*G0_1_2 + 0.0902998236331572*G0_2_0 + 0.0902998236331571*G0_2_1 + 0.0902998236331578*G0_2_2;
+    A[1204] = -0.135449735449737*G0_0_0 - 0.135449735449737*G0_0_1 - 0.0225749559082894*G0_0_2 - 0.135449735449737*G0_1_0 - 0.135449735449737*G0_1_1 - 0.0225749559082896*G0_1_2 - 0.0225749559082896*G0_2_0 - 0.0225749559082896*G0_2_1 - 0.0451499118165797*G0_2_2;
+    A[1205] = 0.0902998236331571*G0_2_2;
+    A[1206] = 0.0902998236331576*G0_0_0 + 0.0902998236331571*G0_0_1 + 0.0902998236331577*G0_0_2 + 0.0902998236331575*G0_1_0 + 0.0902998236331573*G0_1_1 + 0.0902998236331574*G0_1_2 + 0.0902998236331571*G0_2_0 + 0.0902998236331576*G0_2_1 + 0.0902998236331571*G0_2_2;
+    A[1207] = -0.135449735449735*G0_0_0 - 0.0225749559082894*G0_0_1 - 0.135449735449736*G0_0_2 - 0.022574955908289*G0_1_0 - 0.0451499118165787*G0_1_1 - 0.0225749559082889*G0_1_2 - 0.135449735449736*G0_2_0 - 0.0225749559082897*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[1208] = 0.0902998236331566*G0_1_1;
+    A[1209] = 0.0902998236331574*G0_0_0 + 0.0902998236331577*G0_0_1 + 0.0902998236331577*G0_0_2 + 0.0902998236331573*G0_1_0 + 0.0902998236331576*G0_1_1 + 0.0902998236331576*G0_1_2 + 0.0902998236331575*G0_2_0 + 0.0902998236331571*G0_2_1 + 0.0902998236331572*G0_2_2;
+    A[1210] = -0.0451499118165784*G0_0_0 - 0.0225749559082888*G0_0_1 - 0.0225749559082887*G0_0_2 - 0.0225749559082894*G0_1_0 - 0.135449735449735*G0_1_1 - 0.135449735449735*G0_1_2 - 0.0225749559082894*G0_2_0 - 0.135449735449735*G0_2_1 - 0.135449735449735*G0_2_2;
+    A[1211] = 0.0902998236331566*G0_0_0;
+    A[1212] = -0.722398589065256*G0_0_0 - 0.316049382716049*G0_0_1 - 0.316049382716049*G0_0_2 - 0.316049382716049*G0_1_0 - 0.135449735449735*G0_1_2 - 0.316049382716049*G0_2_0 - 0.135449735449735*G0_2_1;
+    A[1213] = -0.31604938271605*G0_0_1 - 0.135449735449735*G0_0_2 - 0.31604938271605*G0_1_0 - 0.722398589065257*G0_1_1 - 0.31604938271605*G0_1_2 - 0.135449735449735*G0_2_0 - 0.316049382716048*G0_2_1;
+    A[1214] = -0.135449735449735*G0_0_1 - 0.31604938271605*G0_0_2 - 0.135449735449736*G0_1_0 - 0.31604938271605*G0_1_2 - 0.316049382716049*G0_2_0 - 0.31604938271605*G0_2_1 - 0.722398589065256*G0_2_2;
+    A[1215] = -0.722398589065257*G0_0_0 - 0.406349206349207*G0_0_1 - 0.406349206349208*G0_0_2 - 0.406349206349208*G0_1_0 - 0.0902998236331577*G0_1_1 - 0.225749559082894*G0_1_2 - 0.406349206349207*G0_2_0 - 0.225749559082894*G0_2_1 - 0.090299823633158*G0_2_2;
+    A[1216] = 0.31604938271605*G0_0_1 + 0.135449735449737*G0_0_2 + 0.31604938271605*G0_1_0 - 0.0902998236331568*G0_1_1 + 0.135449735449737*G0_1_2 + 0.135449735449735*G0_2_0 + 0.135449735449737*G0_2_1 + 0.270899470899472*G0_2_2;
+    A[1217] = 0.135449735449736*G0_0_1 + 0.31604938271605*G0_0_2 + 0.135449735449736*G0_1_0 + 0.270899470899472*G0_1_1 + 0.135449735449737*G0_1_2 + 0.316049382716049*G0_2_0 + 0.135449735449736*G0_2_1 - 0.0902998236331569*G0_2_2;
+    A[1218] = -0.0902998236331579*G0_0_0 - 0.406349206349207*G0_0_1 - 0.225749559082895*G0_0_2 - 0.406349206349207*G0_1_0 - 0.722398589065256*G0_1_1 - 0.406349206349208*G0_1_2 - 0.225749559082894*G0_2_0 - 0.406349206349207*G0_2_1 - 0.0902998236331579*G0_2_2;
+    A[1219] = -0.0902998236331572*G0_0_0 + 0.316049382716049*G0_0_1 + 0.135449735449735*G0_0_2 + 0.316049382716049*G0_1_0 + 0.135449735449734*G0_1_2 + 0.135449735449735*G0_2_0 + 0.135449735449735*G0_2_1 + 0.27089947089947*G0_2_2;
+    A[1220] = 0.270899470899472*G0_0_0 + 0.135449735449736*G0_0_1 + 0.135449735449737*G0_0_2 + 0.135449735449736*G0_1_0 + 0.316049382716051*G0_1_2 + 0.135449735449737*G0_2_0 + 0.31604938271605*G0_2_1 - 0.0902998236331556*G0_2_2;
+    A[1221] = -0.0902998236331582*G0_0_0 - 0.225749559082894*G0_0_1 - 0.406349206349207*G0_0_2 - 0.225749559082893*G0_1_0 - 0.0902998236331575*G0_1_1 - 0.406349206349206*G0_1_2 - 0.406349206349207*G0_2_0 - 0.406349206349207*G0_2_1 - 0.722398589065256*G0_2_2;
+    A[1222] = -0.0902998236331566*G0_0_0 + 0.135449735449735*G0_0_1 + 0.316049382716049*G0_0_2 + 0.135449735449735*G0_1_0 + 0.270899470899471*G0_1_1 + 0.135449735449736*G0_1_2 + 0.316049382716049*G0_2_0 + 0.135449735449735*G0_2_1;
+    A[1223] = 0.270899470899471*G0_0_0 + 0.135449735449736*G0_0_1 + 0.135449735449735*G0_0_2 + 0.135449735449736*G0_1_0 - 0.0902998236331575*G0_1_1 + 0.316049382716049*G0_1_2 + 0.135449735449735*G0_2_0 + 0.316049382716049*G0_2_1;
+    A[1224] = 1.44479717813051*G0_0_0 + 0.722398589065257*G0_0_1 + 0.722398589065257*G0_0_2 + 0.722398589065257*G0_1_0 + 1.44479717813051*G0_1_1 + 0.722398589065256*G0_1_2 + 0.722398589065257*G0_2_0 + 0.722398589065255*G0_2_1 + 1.44479717813051*G0_2_2;
+}
+
+/// Constructor
+poisson3d_4_cell_integral_1_otherwise::poisson3d_4_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_4_cell_integral_1_otherwise::~poisson3d_4_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & poisson3d_4_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void poisson3d_4_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    35
+    // Number of operations (multiply-add pairs) for tensor contraction: 1207
+    // Total number of operations (multiply-add pairs):                  1245
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    const double G0_10 = det*w[0][10]*(1.0);
+    const double G0_11 = det*w[0][11]*(1.0);
+    const double G0_12 = det*w[0][12]*(1.0);
+    const double G0_13 = det*w[0][13]*(1.0);
+    const double G0_14 = det*w[0][14]*(1.0);
+    const double G0_15 = det*w[0][15]*(1.0);
+    const double G0_16 = det*w[0][16]*(1.0);
+    const double G0_17 = det*w[0][17]*(1.0);
+    const double G0_18 = det*w[0][18]*(1.0);
+    const double G0_19 = det*w[0][19]*(1.0);
+    const double G0_20 = det*w[0][20]*(1.0);
+    const double G0_21 = det*w[0][21]*(1.0);
+    const double G0_22 = det*w[0][22]*(1.0);
+    const double G0_23 = det*w[0][23]*(1.0);
+    const double G0_24 = det*w[0][24]*(1.0);
+    const double G0_25 = det*w[0][25]*(1.0);
+    const double G0_26 = det*w[0][26]*(1.0);
+    const double G0_27 = det*w[0][27]*(1.0);
+    const double G0_28 = det*w[0][28]*(1.0);
+    const double G0_29 = det*w[0][29]*(1.0);
+    const double G0_30 = det*w[0][30]*(1.0);
+    const double G0_31 = det*w[0][31]*(1.0);
+    const double G0_32 = det*w[0][32]*(1.0);
+    const double G0_33 = det*w[0][33]*(1.0);
+    const double G0_34 = det*w[0][34]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.000200416867083531*G0_0 + 1.63005718561269e-05*G0_1 + 1.63005718561268e-05*G0_2 + 1.63005718561269e-05*G0_3 - 0.000121853455186786*G0_4 + 8.39078616856376e-05*G0_5 - 0.000121853455186786*G0_6 - 0.000121853455186786*G0_7 + 8.39078616856376e-05*G0_8 - 0.000121853455186786*G0_9 - 0.000121853455186786*G0_10 + 8.39078616856378e-05*G0_11 - 0.000121853455186786*G0_12 - 0.000149644594089037*G0_13 + 0.000112233445566778*G0_14 - 6.84089572978449e-05*G0_15 - 0.000149644594089036*G0_16 + 0.000112233445566777*G0_17 - 6.84089572978445e-05*G0_18 - 0.000149644594089037*G0_19 + 0.000112233445566777*G0_20 - 6.84089572978438e-05*G0_21 - 0.000215915771471324*G0_22 - 0.000215915771471324*G0_23 - 0.000215915771471325*G0_24 + 0.000288600288600288*G0_25 - 0.000185986852653516*G0_26 - 0.000185986852653516*G0_27 + 0.000288600288600287*G0_28 - 0.000185986852653516*G0_29 - 0.000185986852653516*G0_30 + 0.000288600288600287*G0_31 - 0.000185986852653516*G0_32 - 0.000185986852653516*G0_33 - 0.000538720538720526*G0_34;
+    A[1] = 1.63005718561269e-05*G0_0 + 0.000200416867083532*G0_1 + 1.63005718561273e-05*G0_2 + 1.63005718561274e-05*G0_3 - 0.000121853455186787*G0_4 + 8.39078616856389e-05*G0_5 - 0.000121853455186788*G0_6 - 0.000149644594089039*G0_7 + 0.000112233445566779*G0_8 - 6.84089572978461e-05*G0_9 - 0.000149644594089038*G0_10 + 0.000112233445566778*G0_11 - 6.84089572978456e-05*G0_12 - 0.000121853455186788*G0_13 + 8.39078616856391e-05*G0_14 - 0.000121853455186788*G0_15 - 0.000121853455186787*G0_16 + 8.39078616856391e-05*G0_17 - 0.000121853455186788*G0_18 - 6.84089572978459e-05*G0_19 + 0.000112233445566778*G0_20 - 0.000149644594089037*G0_21 + 0.000288600288600287*G0_22 - 0.000185986852653519*G0_23 - 0.000185986852653518*G0_24 - 0.000215915771471325*G0_25 - 0.000215915771471326*G0_26 - 0.000215915771471326*G0_27 - 0.000185986852653518*G0_28 + 0.000288600288600287*G0_29 - 0.000185986852653518*G0_30 - 0.000185986852653518*G0_31 + 0.000288600288600287*G0_32 - 0.000185986852653518*G0_33 - 0.000538720538720536*G0_34;
+    A[2] = 1.63005718561268e-05*G0_0 + 1.63005718561273e-05*G0_1 + 0.000200416867083532*G0_2 + 1.63005718561271e-05*G0_3 - 0.000149644594089038*G0_4 + 0.000112233445566779*G0_5 - 6.84089572978459e-05*G0_6 - 0.000121853455186787*G0_7 + 8.39078616856385e-05*G0_8 - 0.000121853455186787*G0_9 - 6.84089572978448e-05*G0_10 + 0.000112233445566778*G0_11 - 0.000149644594089037*G0_12 - 0.000121853455186788*G0_13 + 8.39078616856394e-05*G0_14 - 0.000121853455186788*G0_15 - 6.8408957297845e-05*G0_16 + 0.000112233445566778*G0_17 - 0.000149644594089037*G0_18 - 0.000121853455186787*G0_19 + 8.39078616856388e-05*G0_20 - 0.000121853455186787*G0_21 - 0.000185986852653516*G0_22 + 0.000288600288600287*G0_23 - 0.000185986852653519*G0_24 - 0.000185986852653517*G0_25 + 0.000288600288600288*G0_26 - 0.000185986852653519*G0_27 - 0.000215915771471325*G0_28 - 0.000215915771471324*G0_29 - 0.000215915771471327*G0_30 - 0.000185986852653518*G0_31 - 0.000185986852653517*G0_32 + 0.000288600288600287*G0_33 - 0.000538720538720532*G0_34;
+    A[3] = 1.63005718561269e-05*G0_0 + 1.63005718561274e-05*G0_1 + 1.63005718561271e-05*G0_2 + 0.000200416867083533*G0_3 - 6.84089572978455e-05*G0_4 + 0.000112233445566778*G0_5 - 0.000149644594089037*G0_6 - 6.84089572978457e-05*G0_7 + 0.000112233445566778*G0_8 - 0.000149644594089037*G0_9 - 0.000121853455186787*G0_10 + 8.3907861685639e-05*G0_11 - 0.000121853455186787*G0_12 - 6.84089572978461e-05*G0_13 + 0.000112233445566779*G0_14 - 0.000149644594089038*G0_15 - 0.000121853455186787*G0_16 + 8.39078616856391e-05*G0_17 - 0.000121853455186788*G0_18 - 0.000121853455186788*G0_19 + 8.3907861685639e-05*G0_20 - 0.000121853455186787*G0_21 - 0.000185986852653517*G0_22 - 0.000185986852653519*G0_23 + 0.000288600288600286*G0_24 - 0.000185986852653518*G0_25 - 0.000185986852653518*G0_26 + 0.000288600288600287*G0_27 - 0.000185986852653518*G0_28 - 0.000185986852653518*G0_29 + 0.000288600288600286*G0_30 - 0.000215915771471325*G0_31 - 0.000215915771471325*G0_32 - 0.000215915771471326*G0_33 - 0.000538720538720535*G0_34;
+    A[4] = -0.000121853455186786*G0_0 - 0.000121853455186787*G0_1 - 0.000149644594089038*G0_2 - 6.84089572978455e-05*G0_3 + 0.00171022393244614*G0_4 - 0.00125701459034791*G0_5 + 0.000684089572978457*G0_6 + 0.000273635829191384*G0_7 - 0.000153920153920153*G0_8 + 0.00035914702581369*G0_9 + 0.000359147025813688*G0_10 - 0.000654160654160648*G0_11 + 0.000855111966223068*G0_12 + 0.000273635829191384*G0_13 - 0.000153920153920154*G0_14 + 0.000359147025813691*G0_15 + 0.000359147025813688*G0_16 - 0.000654160654160648*G0_17 + 0.00085511196622307*G0_18 + 0.000136817914595692*G0_19 - 9.83378761156539e-05*G0_20 + 0.00013681791459569*G0_21 - 3.42044786489231e-05*G0_22 + 0.000102613435946766*G0_23 + 0.000513067179733844*G0_24 - 3.42044786489231e-05*G0_25 + 0.000102613435946766*G0_26 + 0.000513067179733845*G0_27 + 8.55111966223083e-05*G0_28 + 8.55111966223071e-05*G0_29 + 0.000974827641494301*G0_30 - 1.7102239324461e-05*G0_31 - 1.71022393244622e-05*G0_32 + 5.13067179733819e-05*G0_33 + 0.00109454331676553*G0_34;
+    A[5] = 8.39078616856376e-05*G0_0 + 8.39078616856389e-05*G0_1 + 0.000112233445566779*G0_2 + 0.000112233445566778*G0_3 - 0.00125701459034791*G0_4 + 0.00238576238576237*G0_5 - 0.00125701459034792*G0_6 - 0.000153920153920155*G0_7 + 0.000256533589866923*G0_8 - 0.000654160654160652*G0_9 - 0.000153920153920152*G0_10 + 0.000256533589866921*G0_11 - 0.000654160654160647*G0_12 - 0.000153920153920154*G0_13 + 0.000256533589866923*G0_14 - 0.000654160654160651*G0_15 - 0.000153920153920152*G0_16 + 0.000256533589866921*G0_17 - 0.000654160654160649*G0_18 - 9.83378761156543e-05*G0_19 + 1.92400192400202e-05*G0_20 - 9.83378761156527e-05*G0_21 - 0.000179573512906845*G0_22 - 7.69600769600751e-05*G0_23 - 7.6960076960077e-05*G0_24 - 0.000179573512906845*G0_25 - 7.69600769600741e-05*G0_26 - 7.69600769600776e-05*G0_27 + 0.000269360269360266*G0_28 + 0.000269360269360268*G0_29 - 0.00101330767997434*G0_30 + 0.000269360269360267*G0_31 + 0.000269360269360267*G0_32 - 0.00101330767997434*G0_33 - 0.00102613435946768*G0_34;
+    A[6] = -0.000121853455186786*G0_0 - 0.000121853455186788*G0_1 - 6.84089572978459e-05*G0_2 - 0.000149644594089037*G0_3 + 0.000684089572978457*G0_4 - 0.00125701459034792*G0_5 + 0.00171022393244614*G0_6 + 0.000359147025813692*G0_7 - 0.000654160654160651*G0_8 + 0.000855111966223073*G0_9 + 0.000273635829191382*G0_10 - 0.000153920153920153*G0_11 + 0.000359147025813688*G0_12 + 0.000359147025813692*G0_13 - 0.000654160654160652*G0_14 + 0.000855111966223072*G0_15 + 0.000273635829191382*G0_16 - 0.000153920153920154*G0_17 + 0.00035914702581369*G0_18 + 0.000136817914595693*G0_19 - 9.83378761156542e-05*G0_20 + 0.00013681791459569*G0_21 - 3.42044786489236e-05*G0_22 + 0.000513067179733842*G0_23 + 0.000102613435946769*G0_24 - 3.42044786489239e-05*G0_25 + 0.000513067179733843*G0_26 + 0.000102613435946769*G0_27 - 1.71022393244599e-05*G0_28 - 1.71022393244606e-05*G0_29 + 5.13067179733835e-05*G0_30 + 8.55111966223066e-05*G0_31 + 8.5511196622307e-05*G0_32 + 0.0009748276414943*G0_33 + 0.00109454331676553*G0_34;
+    A[7] = -0.000121853455186786*G0_0 - 0.000149644594089039*G0_1 - 0.000121853455186787*G0_2 - 6.84089572978457e-05*G0_3 + 0.000273635829191384*G0_4 - 0.000153920153920155*G0_5 + 0.000359147025813692*G0_6 + 0.00171022393244614*G0_7 - 0.00125701459034791*G0_8 + 0.000684089572978457*G0_9 + 0.000855111966223069*G0_10 - 0.000654160654160648*G0_11 + 0.000359147025813689*G0_12 + 0.000273635829191385*G0_13 - 0.000153920153920155*G0_14 + 0.000359147025813691*G0_15 + 0.000136817914595691*G0_16 - 9.83378761156544e-05*G0_17 + 0.000136817914595693*G0_18 + 0.00035914702581369*G0_19 - 0.000654160654160649*G0_20 + 0.000855111966223068*G0_21 + 0.000102613435946766*G0_22 - 3.42044786489207e-05*G0_23 + 0.000513067179733846*G0_24 + 8.55111966223045e-05*G0_25 + 8.55111966223094e-05*G0_26 + 0.000974827641494305*G0_27 - 3.42044786489234e-05*G0_28 + 0.000102613435946768*G0_29 + 0.000513067179733846*G0_30 - 1.71022393244627e-05*G0_31 + 5.13067179733828e-05*G0_32 - 1.71022393244584e-05*G0_33 + 0.00109454331676554*G0_34;
+    A[8] = 8.39078616856376e-05*G0_0 + 0.000112233445566779*G0_1 + 8.39078616856386e-05*G0_2 + 0.000112233445566778*G0_3 - 0.000153920153920154*G0_4 + 0.000256533589866923*G0_5 - 0.000654160654160651*G0_6 - 0.00125701459034791*G0_7 + 0.00238576238576237*G0_8 - 0.00125701459034791*G0_9 - 0.000654160654160647*G0_10 + 0.00025653358986692*G0_11 - 0.000153920153920152*G0_12 - 0.000153920153920154*G0_13 + 0.000256533589866923*G0_14 - 0.000654160654160651*G0_15 - 9.8337876115653e-05*G0_16 + 1.92400192400203e-05*G0_17 - 9.83378761156543e-05*G0_18 - 0.000153920153920153*G0_19 + 0.000256533589866921*G0_20 - 0.000654160654160646*G0_21 - 7.69600769600723e-05*G0_22 - 0.000179573512906847*G0_23 - 7.69600769600749e-05*G0_24 + 0.000269360269360267*G0_25 + 0.000269360269360265*G0_26 - 0.00101330767997434*G0_27 - 0.000179573512906847*G0_28 - 7.69600769600744e-05*G0_29 - 7.69600769600763e-05*G0_30 + 0.000269360269360267*G0_31 - 0.00101330767997434*G0_32 + 0.000269360269360265*G0_33 - 0.00102613435946769*G0_34;
+    A[9] = -0.000121853455186786*G0_0 - 6.84089572978461e-05*G0_1 - 0.000121853455186787*G0_2 - 0.000149644594089037*G0_3 + 0.00035914702581369*G0_4 - 0.000654160654160652*G0_5 + 0.000855111966223073*G0_6 + 0.000684089572978457*G0_7 - 0.00125701459034791*G0_8 + 0.00171022393244614*G0_9 + 0.000359147025813688*G0_10 - 0.000153920153920153*G0_11 + 0.000273635829191382*G0_12 + 0.000359147025813692*G0_13 - 0.000654160654160652*G0_14 + 0.000855111966223072*G0_15 + 0.000136817914595691*G0_16 - 9.83378761156542e-05*G0_17 + 0.000136817914595692*G0_18 + 0.000273635829191383*G0_19 - 0.000153920153920154*G0_20 + 0.000359147025813688*G0_21 + 0.000513067179733841*G0_22 - 3.4204478648922e-05*G0_23 + 0.000102613435946769*G0_24 - 1.71022393244626e-05*G0_25 - 1.71022393244607e-05*G0_26 + 5.13067179733846e-05*G0_27 - 3.42044786489222e-05*G0_28 + 0.000513067179733842*G0_29 + 0.000102613435946769*G0_30 + 8.55111966223058e-05*G0_31 + 0.000974827641494298*G0_32 + 8.55111966223081e-05*G0_33 + 0.00109454331676553*G0_34;
+    A[10] = -0.000121853455186786*G0_0 - 0.000149644594089038*G0_1 - 6.84089572978448e-05*G0_2 - 0.000121853455186787*G0_3 + 0.000359147025813688*G0_4 - 0.000153920153920152*G0_5 + 0.000273635829191382*G0_6 + 0.000855111966223069*G0_7 - 0.000654160654160647*G0_8 + 0.000359147025813688*G0_9 + 0.00171022393244614*G0_10 - 0.00125701459034791*G0_11 + 0.000684089572978454*G0_12 + 0.000136817914595692*G0_13 - 9.83378761156536e-05*G0_14 + 0.000136817914595691*G0_15 + 0.000273635829191381*G0_16 - 0.000153920153920153*G0_17 + 0.000359147025813689*G0_18 + 0.000359147025813689*G0_19 - 0.000654160654160648*G0_20 + 0.000855111966223068*G0_21 + 0.000102613435946764*G0_22 + 0.000513067179733843*G0_23 - 3.42044786489217e-05*G0_24 + 8.55111966223058e-05*G0_25 + 0.000974827641494302*G0_26 + 8.55111966223086e-05*G0_27 - 1.71022393244607e-05*G0_28 + 5.13067179733813e-05*G0_29 - 1.71022393244607e-05*G0_30 - 3.42044786489237e-05*G0_31 + 0.000102613435946766*G0_32 + 0.000513067179733843*G0_33 + 0.00109454331676553*G0_34;
+    A[11] = 8.39078616856378e-05*G0_0 + 0.000112233445566778*G0_1 + 0.000112233445566778*G0_2 + 8.3907861685639e-05*G0_3 - 0.000654160654160648*G0_4 + 0.000256533589866921*G0_5 - 0.000153920153920153*G0_6 - 0.000654160654160648*G0_7 + 0.00025653358986692*G0_8 - 0.000153920153920153*G0_9 - 0.00125701459034791*G0_10 + 0.00238576238576236*G0_11 - 0.00125701459034791*G0_12 - 9.83378761156541e-05*G0_13 + 1.92400192400198e-05*G0_14 - 9.83378761156533e-05*G0_15 - 0.000153920153920152*G0_16 + 0.000256533589866921*G0_17 - 0.000654160654160648*G0_18 - 0.000153920153920153*G0_19 + 0.000256533589866921*G0_20 - 0.000654160654160647*G0_21 - 7.69600769600791e-05*G0_22 - 7.69600769600788e-05*G0_23 - 0.000179573512906844*G0_24 + 0.000269360269360269*G0_25 - 0.00101330767997434*G0_26 + 0.000269360269360267*G0_27 + 0.000269360269360268*G0_28 - 0.00101330767997434*G0_29 + 0.000269360269360266*G0_30 - 0.000179573512906843*G0_31 - 7.6960076960077e-05*G0_32 - 7.69600769600788e-05*G0_33 - 0.00102613435946769*G0_34;
+    A[12] = -0.000121853455186786*G0_0 - 6.84089572978456e-05*G0_1 - 0.000149644594089037*G0_2 - 0.000121853455186787*G0_3 + 0.000855111966223068*G0_4 - 0.000654160654160647*G0_5 + 0.000359147025813688*G0_6 + 0.000359147025813689*G0_7 - 0.000153920153920152*G0_8 + 0.000273635829191381*G0_9 + 0.000684089572978454*G0_10 - 0.00125701459034791*G0_11 + 0.00171022393244614*G0_12 + 0.000136817914595692*G0_13 - 9.83378761156539e-05*G0_14 + 0.000136817914595691*G0_15 + 0.000359147025813687*G0_16 - 0.000654160654160647*G0_17 + 0.00085511196622307*G0_18 + 0.000273635829191382*G0_19 - 0.000153920153920153*G0_20 + 0.000359147025813688*G0_21 + 0.000513067179733841*G0_22 + 0.000102613435946763*G0_23 - 3.42044786489221e-05*G0_24 - 1.71022393244608e-05*G0_25 + 5.13067179733824e-05*G0_26 - 1.71022393244605e-05*G0_27 + 8.5511196622309e-05*G0_28 + 0.000974827641494299*G0_29 + 8.55111966223071e-05*G0_30 - 3.42044786489217e-05*G0_31 + 0.00051306717973384*G0_32 + 0.000102613435946766*G0_33 + 0.00109454331676553*G0_34;
+    A[13] = -0.000149644594089037*G0_0 - 0.000121853455186788*G0_1 - 0.000121853455186788*G0_2 - 6.84089572978461e-05*G0_3 + 0.000273635829191384*G0_4 - 0.000153920153920154*G0_5 + 0.000359147025813692*G0_6 + 0.000273635829191385*G0_7 - 0.000153920153920154*G0_8 + 0.000359147025813692*G0_9 + 0.000136817914595692*G0_10 - 9.83378761156542e-05*G0_11 + 0.000136817914595692*G0_12 + 0.00171022393244614*G0_13 - 0.00125701459034792*G0_14 + 0.000684089572978458*G0_15 + 0.000855111966223069*G0_16 - 0.000654160654160649*G0_17 + 0.000359147025813691*G0_18 + 0.000855111966223072*G0_19 - 0.00065416065416065*G0_20 + 0.000359147025813689*G0_21 + 8.55111966223108e-05*G0_22 + 8.55111966223086e-05*G0_23 + 0.000974827641494303*G0_24 + 0.000102613435946767*G0_25 - 3.42044786489219e-05*G0_26 + 0.000513067179733844*G0_27 + 0.000102613435946769*G0_28 - 3.42044786489187e-05*G0_29 + 0.000513067179733843*G0_30 + 5.13067179733838e-05*G0_31 - 1.7102239324459e-05*G0_32 - 1.71022393244611e-05*G0_33 + 0.00109454331676554*G0_34;
+    A[14] = 0.000112233445566778*G0_0 + 8.39078616856391e-05*G0_1 + 8.39078616856394e-05*G0_2 + 0.000112233445566779*G0_3 - 0.000153920153920154*G0_4 + 0.000256533589866923*G0_5 - 0.000654160654160652*G0_6 - 0.000153920153920155*G0_7 + 0.000256533589866923*G0_8 - 0.000654160654160652*G0_9 - 9.83378761156535e-05*G0_10 + 1.92400192400198e-05*G0_11 - 9.83378761156539e-05*G0_12 - 0.00125701459034792*G0_13 + 0.00238576238576237*G0_14 - 0.00125701459034792*G0_15 - 0.000654160654160649*G0_16 + 0.000256533589866922*G0_17 - 0.000153920153920154*G0_18 - 0.00065416065416065*G0_19 + 0.000256533589866923*G0_20 - 0.000153920153920153*G0_21 + 0.000269360269360266*G0_22 + 0.000269360269360267*G0_23 - 0.00101330767997434*G0_24 - 7.69600769600749e-05*G0_25 - 0.000179573512906846*G0_26 - 7.69600769600788e-05*G0_27 - 7.69600769600764e-05*G0_28 - 0.000179573512906849*G0_29 - 7.69600769600795e-05*G0_30 - 0.00101330767997434*G0_31 + 0.000269360269360265*G0_32 + 0.000269360269360266*G0_33 - 0.0010261343594677*G0_34;
+    A[15] = -6.84089572978449e-05*G0_0 - 0.000121853455186788*G0_1 - 0.000121853455186788*G0_2 - 0.000149644594089038*G0_3 + 0.000359147025813691*G0_4 - 0.000654160654160651*G0_5 + 0.000855111966223072*G0_6 + 0.000359147025813691*G0_7 - 0.000654160654160651*G0_8 + 0.000855111966223072*G0_9 + 0.000136817914595691*G0_10 - 9.83378761156533e-05*G0_11 + 0.000136817914595691*G0_12 + 0.000684089572978458*G0_13 - 0.00125701459034792*G0_14 + 0.00171022393244614*G0_15 + 0.000359147025813688*G0_16 - 0.000153920153920153*G0_17 + 0.000273635829191384*G0_18 + 0.00035914702581369*G0_19 - 0.000153920153920154*G0_20 + 0.000273635829191381*G0_21 - 1.71022393244611e-05*G0_22 - 1.71022393244604e-05*G0_23 + 5.13067179733835e-05*G0_24 + 0.000513067179733841*G0_25 - 3.4204478648922e-05*G0_26 + 0.000102613435946769*G0_27 + 0.000513067179733842*G0_28 - 3.42044786489213e-05*G0_29 + 0.000102613435946768*G0_30 + 0.000974827641494298*G0_31 + 8.55111966223068e-05*G0_32 + 8.55111966223077e-05*G0_33 + 0.00109454331676553*G0_34;
+    A[16] = -0.000149644594089036*G0_0 - 0.000121853455186787*G0_1 - 6.8408957297845e-05*G0_2 - 0.000121853455186787*G0_3 + 0.000359147025813688*G0_4 - 0.000153920153920152*G0_5 + 0.000273635829191382*G0_6 + 0.000136817914595691*G0_7 - 9.8337876115653e-05*G0_8 + 0.000136817914595691*G0_9 + 0.000273635829191381*G0_10 - 0.000153920153920152*G0_11 + 0.000359147025813688*G0_12 + 0.00085511196622307*G0_13 - 0.000654160654160649*G0_14 + 0.000359147025813688*G0_15 + 0.00171022393244614*G0_16 - 0.00125701459034791*G0_17 + 0.000684089572978456*G0_18 + 0.00085511196622307*G0_19 - 0.000654160654160649*G0_20 + 0.000359147025813687*G0_21 + 8.5511196622307e-05*G0_22 + 0.000974827641494301*G0_23 + 8.5511196622308e-05*G0_24 + 0.000102613435946765*G0_25 + 0.000513067179733844*G0_26 - 3.42044786489219e-05*G0_27 + 5.13067179733824e-05*G0_28 - 1.71022393244606e-05*G0_29 - 1.71022393244618e-05*G0_30 + 0.000102613435946766*G0_31 - 3.4204478648923e-05*G0_32 + 0.000513067179733842*G0_33 + 0.00109454331676553*G0_34;
+    A[17] = 0.000112233445566777*G0_0 + 8.39078616856391e-05*G0_1 + 0.000112233445566778*G0_2 + 8.39078616856391e-05*G0_3 - 0.000654160654160648*G0_4 + 0.000256533589866921*G0_5 - 0.000153920153920154*G0_6 - 9.83378761156544e-05*G0_7 + 1.92400192400203e-05*G0_8 - 9.83378761156542e-05*G0_9 - 0.000153920153920153*G0_10 + 0.000256533589866921*G0_11 - 0.000654160654160647*G0_12 - 0.000654160654160649*G0_13 + 0.000256533589866922*G0_14 - 0.000153920153920153*G0_15 - 0.00125701459034791*G0_16 + 0.00238576238576236*G0_17 - 0.00125701459034791*G0_18 - 0.000654160654160649*G0_19 + 0.000256533589866923*G0_20 - 0.000153920153920153*G0_21 + 0.000269360269360267*G0_22 - 0.00101330767997434*G0_23 + 0.000269360269360266*G0_24 - 7.69600769600793e-05*G0_25 - 7.69600769600773e-05*G0_26 - 0.000179573512906845*G0_27 - 0.00101330767997434*G0_28 + 0.000269360269360266*G0_29 + 0.000269360269360266*G0_30 - 7.69600769600775e-05*G0_31 - 0.000179573512906846*G0_32 - 7.69600769600771e-05*G0_33 - 0.00102613435946769*G0_34;
+    A[18] = -6.84089572978445e-05*G0_0 - 0.000121853455186788*G0_1 - 0.000149644594089037*G0_2 - 0.000121853455186788*G0_3 + 0.00085511196622307*G0_4 - 0.000654160654160649*G0_5 + 0.00035914702581369*G0_6 + 0.000136817914595693*G0_7 - 9.83378761156543e-05*G0_8 + 0.000136817914595692*G0_9 + 0.000359147025813689*G0_10 - 0.000654160654160648*G0_11 + 0.00085511196622307*G0_12 + 0.000359147025813691*G0_13 - 0.000153920153920154*G0_14 + 0.000273635829191384*G0_15 + 0.000684089572978456*G0_16 - 0.00125701459034791*G0_17 + 0.00171022393244614*G0_18 + 0.000359147025813691*G0_19 - 0.000153920153920155*G0_20 + 0.000273635829191382*G0_21 - 1.7102239324461e-05*G0_22 + 5.13067179733836e-05*G0_23 - 1.71022393244591e-05*G0_24 + 0.000513067179733845*G0_25 + 0.000102613435946766*G0_26 - 3.42044786489196e-05*G0_27 + 0.000974827641494302*G0_28 + 8.5511196622308e-05*G0_29 + 8.55111966223094e-05*G0_30 + 0.000513067179733844*G0_31 - 3.4204478648922e-05*G0_32 + 0.000102613435946769*G0_33 + 0.00109454331676554*G0_34;
+    A[19] = -0.000149644594089037*G0_0 - 6.84089572978459e-05*G0_1 - 0.000121853455186787*G0_2 - 0.000121853455186788*G0_3 + 0.000136817914595692*G0_4 - 9.83378761156543e-05*G0_5 + 0.000136817914595693*G0_6 + 0.00035914702581369*G0_7 - 0.000153920153920153*G0_8 + 0.000273635829191383*G0_9 + 0.000359147025813689*G0_10 - 0.000153920153920153*G0_11 + 0.000273635829191382*G0_12 + 0.000855111966223072*G0_13 - 0.00065416065416065*G0_14 + 0.00035914702581369*G0_15 + 0.00085511196622307*G0_16 - 0.000654160654160649*G0_17 + 0.000359147025813691*G0_18 + 0.00171022393244614*G0_19 - 0.00125701459034791*G0_20 + 0.000684089572978455*G0_21 + 0.000974827641494302*G0_22 + 8.55111966223087e-05*G0_23 + 8.55111966223104e-05*G0_24 + 5.13067179733826e-05*G0_25 - 1.71022393244601e-05*G0_26 - 1.71022393244587e-05*G0_27 + 0.000102613435946766*G0_28 + 0.000513067179733843*G0_29 - 3.420447864892e-05*G0_30 + 0.000102613435946768*G0_31 + 0.000513067179733842*G0_32 - 3.42044786489211e-05*G0_33 + 0.00109454331676554*G0_34;
+    A[20] = 0.000112233445566777*G0_0 + 0.000112233445566778*G0_1 + 8.39078616856388e-05*G0_2 + 8.3907861685639e-05*G0_3 - 9.83378761156539e-05*G0_4 + 1.92400192400202e-05*G0_5 - 9.83378761156542e-05*G0_6 - 0.000654160654160649*G0_7 + 0.000256533589866921*G0_8 - 0.000153920153920154*G0_9 - 0.000654160654160648*G0_10 + 0.000256533589866921*G0_11 - 0.000153920153920153*G0_12 - 0.00065416065416065*G0_13 + 0.000256533589866923*G0_14 - 0.000153920153920154*G0_15 - 0.000654160654160649*G0_16 + 0.000256533589866923*G0_17 - 0.000153920153920155*G0_18 - 0.00125701459034791*G0_19 + 0.00238576238576236*G0_20 - 0.00125701459034791*G0_21 - 0.00101330767997434*G0_22 + 0.000269360269360269*G0_23 + 0.000269360269360266*G0_24 - 0.00101330767997434*G0_25 + 0.000269360269360269*G0_26 + 0.000269360269360265*G0_27 - 7.69600769600807e-05*G0_28 - 7.69600769600769e-05*G0_29 - 0.000179573512906845*G0_30 - 7.69600769600798e-05*G0_31 - 7.69600769600762e-05*G0_32 - 0.000179573512906844*G0_33 - 0.00102613435946769*G0_34;
+    A[21] = -6.84089572978438e-05*G0_0 - 0.000149644594089037*G0_1 - 0.000121853455186787*G0_2 - 0.000121853455186787*G0_3 + 0.00013681791459569*G0_4 - 9.83378761156527e-05*G0_5 + 0.00013681791459569*G0_6 + 0.000855111966223068*G0_7 - 0.000654160654160646*G0_8 + 0.000359147025813688*G0_9 + 0.000855111966223068*G0_10 - 0.000654160654160647*G0_11 + 0.000359147025813688*G0_12 + 0.000359147025813689*G0_13 - 0.000153920153920153*G0_14 + 0.000273635829191382*G0_15 + 0.000359147025813687*G0_16 - 0.000153920153920153*G0_17 + 0.000273635829191382*G0_18 + 0.000684089572978455*G0_19 - 0.00125701459034791*G0_20 + 0.00171022393244614*G0_21 + 5.13067179733814e-05*G0_22 - 1.71022393244638e-05*G0_23 - 1.71022393244615e-05*G0_24 + 0.000974827641494301*G0_25 + 8.55111966223051e-05*G0_26 + 8.55111966223076e-05*G0_27 + 0.000513067179733844*G0_28 + 0.000102613435946764*G0_29 - 3.42044786489226e-05*G0_30 + 0.000513067179733843*G0_31 + 0.000102613435946765*G0_32 - 3.42044786489242e-05*G0_33 + 0.00109454331676552*G0_34;
+    A[22] = -0.000215915771471324*G0_0 + 0.000288600288600287*G0_1 - 0.000185986852653516*G0_2 - 0.000185986852653517*G0_3 - 3.42044786489231e-05*G0_4 - 0.000179573512906845*G0_5 - 3.42044786489236e-05*G0_6 + 0.000102613435946766*G0_7 - 7.69600769600725e-05*G0_8 + 0.000513067179733841*G0_9 + 0.000102613435946764*G0_10 - 7.69600769600791e-05*G0_11 + 0.000513067179733841*G0_12 + 8.55111966223108e-05*G0_13 + 0.000269360269360266*G0_14 - 1.71022393244611e-05*G0_15 + 8.5511196622307e-05*G0_16 + 0.000269360269360267*G0_17 - 1.7102239324461e-05*G0_18 + 0.000974827641494302*G0_19 - 0.00101330767997434*G0_20 + 5.13067179733814e-05*G0_21 + 0.00779862113195442*G0_22 - 0.00205226871893538*G0_23 - 0.00205226871893537*G0_24 - 0.000205226871893537*G0_25 - 0.00143658810325477*G0_26 - 0.00143658810325476*G0_27 - 0.00143658810325476*G0_28 + 0.00389931056597721*G0_29 - 0.00102613435946769*G0_30 - 0.00143658810325476*G0_31 + 0.0038993105659772*G0_32 - 0.00102613435946769*G0_33 + 0.0016418149751483*G0_34;
+    A[23] = -0.000215915771471324*G0_0 - 0.000185986852653519*G0_1 + 0.000288600288600287*G0_2 - 0.000185986852653519*G0_3 + 0.000102613435946766*G0_4 - 7.69600769600751e-05*G0_5 + 0.000513067179733843*G0_6 - 3.42044786489207e-05*G0_7 - 0.000179573512906847*G0_8 - 3.4204478648922e-05*G0_9 + 0.000513067179733843*G0_10 - 7.69600769600788e-05*G0_11 + 0.000102613435946763*G0_12 + 8.55111966223086e-05*G0_13 + 0.000269360269360267*G0_14 - 1.71022393244604e-05*G0_15 + 0.000974827641494302*G0_16 - 0.00101330767997434*G0_17 + 5.13067179733835e-05*G0_18 + 8.55111966223087e-05*G0_19 + 0.000269360269360269*G0_20 - 1.71022393244638e-05*G0_21 - 0.00205226871893538*G0_22 + 0.0077986211319544*G0_23 - 0.00205226871893537*G0_24 - 0.00143658810325476*G0_25 + 0.00389931056597721*G0_26 - 0.00102613435946769*G0_27 - 0.000205226871893536*G0_28 - 0.00143658810325476*G0_29 - 0.00143658810325476*G0_30 - 0.00143658810325476*G0_31 - 0.00102613435946769*G0_32 + 0.0038993105659772*G0_33 + 0.00164181497514829*G0_34;
+    A[24] = -0.000215915771471325*G0_0 - 0.000185986852653518*G0_1 - 0.000185986852653519*G0_2 + 0.000288600288600286*G0_3 + 0.000513067179733844*G0_4 - 7.69600769600771e-05*G0_5 + 0.000102613435946769*G0_6 + 0.000513067179733846*G0_7 - 7.6960076960075e-05*G0_8 + 0.000102613435946769*G0_9 - 3.42044786489217e-05*G0_10 - 0.000179573512906844*G0_11 - 3.4204478648922e-05*G0_12 + 0.000974827641494303*G0_13 - 0.00101330767997434*G0_14 + 5.13067179733835e-05*G0_15 + 8.55111966223081e-05*G0_16 + 0.000269360269360266*G0_17 - 1.7102239324459e-05*G0_18 + 8.55111966223104e-05*G0_19 + 0.000269360269360266*G0_20 - 1.71022393244615e-05*G0_21 - 0.00205226871893537*G0_22 - 0.00205226871893537*G0_23 + 0.00779862113195441*G0_24 - 0.00143658810325477*G0_25 - 0.00102613435946768*G0_26 + 0.00389931056597721*G0_27 - 0.00143658810325476*G0_28 - 0.00102613435946768*G0_29 + 0.00389931056597721*G0_30 - 0.000205226871893539*G0_31 - 0.00143658810325476*G0_32 - 0.00143658810325476*G0_33 + 0.00164181497514831*G0_34;
+    A[25] = 0.000288600288600288*G0_0 - 0.000215915771471325*G0_1 - 0.000185986852653517*G0_2 - 0.000185986852653518*G0_3 - 3.42044786489231e-05*G0_4 - 0.000179573512906845*G0_5 - 3.4204478648924e-05*G0_6 + 8.55111966223046e-05*G0_7 + 0.000269360269360267*G0_8 - 1.71022393244626e-05*G0_9 + 8.55111966223058e-05*G0_10 + 0.000269360269360269*G0_11 - 1.71022393244608e-05*G0_12 + 0.000102613435946767*G0_13 - 7.69600769600748e-05*G0_14 + 0.00051306717973384*G0_15 + 0.000102613435946765*G0_16 - 7.69600769600793e-05*G0_17 + 0.000513067179733845*G0_18 + 5.13067179733827e-05*G0_19 - 0.00101330767997434*G0_20 + 0.000974827641494301*G0_21 - 0.000205226871893538*G0_22 - 0.00143658810325476*G0_23 - 0.00143658810325477*G0_24 + 0.00779862113195442*G0_25 - 0.00205226871893538*G0_26 - 0.00205226871893537*G0_27 + 0.00389931056597721*G0_28 - 0.00143658810325476*G0_29 - 0.00102613435946769*G0_30 + 0.0038993105659772*G0_31 - 0.00143658810325476*G0_32 - 0.00102613435946769*G0_33 + 0.00164181497514829*G0_34;
+    A[26] = -0.000185986852653516*G0_0 - 0.000215915771471326*G0_1 + 0.000288600288600288*G0_2 - 0.000185986852653518*G0_3 + 0.000102613435946766*G0_4 - 7.69600769600741e-05*G0_5 + 0.000513067179733843*G0_6 + 8.55111966223095e-05*G0_7 + 0.000269360269360265*G0_8 - 1.71022393244608e-05*G0_9 + 0.000974827641494302*G0_10 - 0.00101330767997434*G0_11 + 5.13067179733824e-05*G0_12 - 3.42044786489219e-05*G0_13 - 0.000179573512906846*G0_14 - 3.42044786489221e-05*G0_15 + 0.000513067179733844*G0_16 - 7.69600769600772e-05*G0_17 + 0.000102613435946766*G0_18 - 1.71022393244601e-05*G0_19 + 0.000269360269360269*G0_20 + 8.55111966223051e-05*G0_21 - 0.00143658810325477*G0_22 + 0.00389931056597721*G0_23 - 0.00102613435946768*G0_24 - 0.00205226871893538*G0_25 + 0.00779862113195442*G0_26 - 0.00205226871893537*G0_27 - 0.00143658810325476*G0_28 - 0.000205226871893539*G0_29 - 0.00143658810325476*G0_30 - 0.00102613435946769*G0_31 - 0.00143658810325476*G0_32 + 0.00389931056597721*G0_33 + 0.0016418149751483*G0_34;
+    A[27] = -0.000185986852653516*G0_0 - 0.000215915771471326*G0_1 - 0.000185986852653519*G0_2 + 0.000288600288600287*G0_3 + 0.000513067179733845*G0_4 - 7.69600769600775e-05*G0_5 + 0.000102613435946769*G0_6 + 0.000974827641494305*G0_7 - 0.00101330767997434*G0_8 + 5.13067179733846e-05*G0_9 + 8.55111966223086e-05*G0_10 + 0.000269360269360267*G0_11 - 1.71022393244605e-05*G0_12 + 0.000513067179733844*G0_13 - 7.69600769600788e-05*G0_14 + 0.000102613435946769*G0_15 - 3.42044786489218e-05*G0_16 - 0.000179573512906845*G0_17 - 3.42044786489195e-05*G0_18 - 1.71022393244587e-05*G0_19 + 0.000269360269360265*G0_20 + 8.55111966223076e-05*G0_21 - 0.00143658810325476*G0_22 - 0.00102613435946769*G0_23 + 0.00389931056597721*G0_24 - 0.00205226871893537*G0_25 - 0.00205226871893537*G0_26 + 0.00779862113195442*G0_27 - 0.00102613435946768*G0_28 - 0.00143658810325476*G0_29 + 0.00389931056597721*G0_30 - 0.00143658810325476*G0_31 - 0.00020522687189354*G0_32 - 0.00143658810325476*G0_33 + 0.00164181497514831*G0_34;
+    A[28] = 0.000288600288600287*G0_0 - 0.000185986852653518*G0_1 - 0.000215915771471325*G0_2 - 0.000185986852653518*G0_3 + 8.55111966223083e-05*G0_4 + 0.000269360269360266*G0_5 - 1.71022393244599e-05*G0_6 - 3.42044786489235e-05*G0_7 - 0.000179573512906847*G0_8 - 3.42044786489223e-05*G0_9 - 1.71022393244607e-05*G0_10 + 0.000269360269360268*G0_11 + 8.5511196622309e-05*G0_12 + 0.000102613435946769*G0_13 - 7.69600769600765e-05*G0_14 + 0.000513067179733842*G0_15 + 5.13067179733824e-05*G0_16 - 0.00101330767997434*G0_17 + 0.000974827641494302*G0_18 + 0.000102613435946766*G0_19 - 7.69600769600808e-05*G0_20 + 0.000513067179733844*G0_21 - 0.00143658810325476*G0_22 - 0.000205226871893536*G0_23 - 0.00143658810325476*G0_24 + 0.00389931056597721*G0_25 - 0.00143658810325476*G0_26 - 0.00102613435946768*G0_27 + 0.00779862113195441*G0_28 - 0.00205226871893537*G0_29 - 0.00205226871893537*G0_30 + 0.0038993105659772*G0_31 - 0.00102613435946768*G0_32 - 0.00143658810325476*G0_33 + 0.0016418149751483*G0_34;
+    A[29] = -0.000185986852653516*G0_0 + 0.000288600288600287*G0_1 - 0.000215915771471324*G0_2 - 0.000185986852653517*G0_3 + 8.55111966223071e-05*G0_4 + 0.000269360269360268*G0_5 - 1.71022393244605e-05*G0_6 + 0.000102613435946768*G0_7 - 7.69600769600744e-05*G0_8 + 0.000513067179733842*G0_9 + 5.13067179733813e-05*G0_10 - 0.00101330767997434*G0_11 + 0.000974827641494299*G0_12 - 3.42044786489188e-05*G0_13 - 0.000179573512906849*G0_14 - 3.42044786489213e-05*G0_15 - 1.71022393244606e-05*G0_16 + 0.000269360269360266*G0_17 + 8.5511196622308e-05*G0_18 + 0.000513067179733843*G0_19 - 7.69600769600771e-05*G0_20 + 0.000102613435946764*G0_21 + 0.00389931056597721*G0_22 - 0.00143658810325476*G0_23 - 0.00102613435946768*G0_24 - 0.00143658810325476*G0_25 - 0.000205226871893539*G0_26 - 0.00143658810325476*G0_27 - 0.00205226871893537*G0_28 + 0.00779862113195441*G0_29 - 0.00205226871893537*G0_30 - 0.00102613435946768*G0_31 + 0.0038993105659772*G0_32 - 0.00143658810325476*G0_33 + 0.0016418149751483*G0_34;
+    A[30] = -0.000185986852653516*G0_0 - 0.000185986852653518*G0_1 - 0.000215915771471327*G0_2 + 0.000288600288600286*G0_3 + 0.000974827641494301*G0_4 - 0.00101330767997434*G0_5 + 5.13067179733835e-05*G0_6 + 0.000513067179733846*G0_7 - 7.69600769600764e-05*G0_8 + 0.000102613435946769*G0_9 - 1.71022393244607e-05*G0_10 + 0.000269360269360266*G0_11 + 8.55111966223071e-05*G0_12 + 0.000513067179733843*G0_13 - 7.69600769600797e-05*G0_14 + 0.000102613435946768*G0_15 - 1.71022393244618e-05*G0_16 + 0.000269360269360266*G0_17 + 8.55111966223093e-05*G0_18 - 3.420447864892e-05*G0_19 - 0.000179573512906845*G0_20 - 3.42044786489226e-05*G0_21 - 0.00102613435946769*G0_22 - 0.00143658810325476*G0_23 + 0.00389931056597721*G0_24 - 0.00102613435946769*G0_25 - 0.00143658810325476*G0_26 + 0.00389931056597721*G0_27 - 0.00205226871893537*G0_28 - 0.00205226871893537*G0_29 + 0.00779862113195441*G0_30 - 0.00143658810325476*G0_31 - 0.00143658810325476*G0_32 - 0.000205226871893541*G0_33 + 0.00164181497514831*G0_34;
+    A[31] = 0.000288600288600287*G0_0 - 0.000185986852653518*G0_1 - 0.000185986852653518*G0_2 - 0.000215915771471324*G0_3 - 1.71022393244609e-05*G0_4 + 0.000269360269360267*G0_5 + 8.55111966223065e-05*G0_6 - 1.71022393244627e-05*G0_7 + 0.000269360269360267*G0_8 + 8.55111966223058e-05*G0_9 - 3.42044786489238e-05*G0_10 - 0.000179573512906843*G0_11 - 3.42044786489218e-05*G0_12 + 5.13067179733838e-05*G0_13 - 0.00101330767997434*G0_14 + 0.000974827641494298*G0_15 + 0.000102613435946766*G0_16 - 7.69600769600774e-05*G0_17 + 0.000513067179733844*G0_18 + 0.000102613435946768*G0_19 - 7.69600769600798e-05*G0_20 + 0.000513067179733843*G0_21 - 0.00143658810325476*G0_22 - 0.00143658810325476*G0_23 - 0.000205226871893539*G0_24 + 0.0038993105659772*G0_25 - 0.00102613435946769*G0_26 - 0.00143658810325476*G0_27 + 0.0038993105659772*G0_28 - 0.00102613435946768*G0_29 - 0.00143658810325476*G0_30 + 0.0077986211319544*G0_31 - 0.00205226871893537*G0_32 - 0.00205226871893537*G0_33 + 0.00164181497514829*G0_34;
+    A[32] = -0.000185986852653516*G0_0 + 0.000288600288600287*G0_1 - 0.000185986852653517*G0_2 - 0.000215915771471325*G0_3 - 1.71022393244622e-05*G0_4 + 0.000269360269360267*G0_5 + 8.5511196622307e-05*G0_6 + 5.13067179733827e-05*G0_7 - 0.00101330767997434*G0_8 + 0.000974827641494298*G0_9 + 0.000102613435946766*G0_10 - 7.6960076960077e-05*G0_11 + 0.00051306717973384*G0_12 - 1.7102239324459e-05*G0_13 + 0.000269360269360266*G0_14 + 8.55111966223069e-05*G0_15 - 3.42044786489229e-05*G0_16 - 0.000179573512906846*G0_17 - 3.42044786489221e-05*G0_18 + 0.000513067179733842*G0_19 - 7.69600769600761e-05*G0_20 + 0.000102613435946765*G0_21 + 0.0038993105659772*G0_22 - 0.00102613435946769*G0_23 - 0.00143658810325476*G0_24 - 0.00143658810325476*G0_25 - 0.00143658810325476*G0_26 - 0.00020522687189354*G0_27 - 0.00102613435946768*G0_28 + 0.0038993105659772*G0_29 - 0.00143658810325476*G0_30 - 0.00205226871893537*G0_31 + 0.0077986211319544*G0_32 - 0.00205226871893537*G0_33 + 0.00164181497514829*G0_34;
+    A[33] = -0.000185986852653516*G0_0 - 0.000185986852653518*G0_1 + 0.000288600288600287*G0_2 - 0.000215915771471325*G0_3 + 5.13067179733818e-05*G0_4 - 0.00101330767997434*G0_5 + 0.0009748276414943*G0_6 - 1.71022393244584e-05*G0_7 + 0.000269360269360265*G0_8 + 8.55111966223081e-05*G0_9 + 0.000513067179733843*G0_10 - 7.69600769600788e-05*G0_11 + 0.000102613435946766*G0_12 - 1.71022393244611e-05*G0_13 + 0.000269360269360266*G0_14 + 8.55111966223078e-05*G0_15 + 0.000513067179733842*G0_16 - 7.69600769600771e-05*G0_17 + 0.000102613435946769*G0_18 - 3.42044786489211e-05*G0_19 - 0.000179573512906844*G0_20 - 3.42044786489242e-05*G0_21 - 0.00102613435946769*G0_22 + 0.0038993105659772*G0_23 - 0.00143658810325476*G0_24 - 0.00102613435946769*G0_25 + 0.00389931056597721*G0_26 - 0.00143658810325476*G0_27 - 0.00143658810325476*G0_28 - 0.00143658810325476*G0_29 - 0.000205226871893542*G0_30 - 0.00205226871893537*G0_31 - 0.00205226871893537*G0_32 + 0.0077986211319544*G0_33 + 0.00164181497514829*G0_34;
+    A[34] = -0.000538720538720526*G0_0 - 0.000538720538720536*G0_1 - 0.000538720538720532*G0_2 - 0.000538720538720535*G0_3 + 0.00109454331676553*G0_4 - 0.00102613435946768*G0_5 + 0.00109454331676553*G0_6 + 0.00109454331676554*G0_7 - 0.00102613435946769*G0_8 + 0.00109454331676553*G0_9 + 0.00109454331676553*G0_10 - 0.00102613435946769*G0_11 + 0.00109454331676553*G0_12 + 0.00109454331676554*G0_13 - 0.0010261343594677*G0_14 + 0.00109454331676553*G0_15 + 0.00109454331676553*G0_16 - 0.00102613435946769*G0_17 + 0.00109454331676554*G0_18 + 0.00109454331676554*G0_19 - 0.00102613435946769*G0_20 + 0.00109454331676552*G0_21 + 0.0016418149751483*G0_22 + 0.0016418149751483*G0_23 + 0.00164181497514831*G0_24 + 0.00164181497514829*G0_25 + 0.0016418149751483*G0_26 + 0.00164181497514831*G0_27 + 0.0016418149751483*G0_28 + 0.0016418149751483*G0_29 + 0.00164181497514831*G0_30 + 0.00164181497514829*G0_31 + 0.00164181497514829*G0_32 + 0.00164181497514829*G0_33 + 0.0262690396023728*G0_34;
+}
+
+/// Constructor
+poisson3d_4_form_0::poisson3d_4_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_4_form_0::~poisson3d_4_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson3d_4_form_0::signature() const
+{
+    return "340d8f5c9ce7b303e79284500b0ce34da2ddca57afa75e9566ee945eb2abf3761d4355deb21c82abb632d72e2c5fd54f899691b5d2be9d1da4d99346ae0cf1a7";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson3d_4_form_0::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson3d_4_form_0::num_coefficients() const
+{
+    return 0;
+}
+
+/// Return the number of cell domains
+std::size_t poisson3d_4_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson3d_4_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson3d_4_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson3d_4_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson3d_4_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson3d_4_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson3d_4_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson3d_4_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson3d_4_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson3d_4_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson3d_4_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_4_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_4_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson3d_4_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_4_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_4_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson3d_4_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson3d_4_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson3d_4_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson3d_4_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson3d_4_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson3d_4_form_0::create_default_cell_integral() const
+{
+    return new poisson3d_4_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson3d_4_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson3d_4_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson3d_4_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson3d_4_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+poisson3d_4_form_1::poisson3d_4_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+poisson3d_4_form_1::~poisson3d_4_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* poisson3d_4_form_1::signature() const
+{
+    return "44447132910ec8f7653ba2be711d10970c8c7de03ec051406a760918bc0daf0ca0702a39b67205a5209b58c100823e2885a99ee1f0e6e9149320ea08e1e2cfb2";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t poisson3d_4_form_1::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t poisson3d_4_form_1::num_coefficients() const
+{
+    return 1;
+}
+
+/// Return the number of cell domains
+std::size_t poisson3d_4_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t poisson3d_4_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t poisson3d_4_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t poisson3d_4_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t poisson3d_4_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool poisson3d_4_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool poisson3d_4_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool poisson3d_4_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool poisson3d_4_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool poisson3d_4_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* poisson3d_4_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_4_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_4_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* poisson3d_4_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_4_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_4_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* poisson3d_4_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* poisson3d_4_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* poisson3d_4_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* poisson3d_4_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* poisson3d_4_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* poisson3d_4_form_1::create_default_cell_integral() const
+{
+    return new poisson3d_4_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* poisson3d_4_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* poisson3d_4_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* poisson3d_4_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* poisson3d_4_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/bench/fem/convergence/cpp/Poisson3D_4.h b/bench/fem/convergence/cpp/Poisson3D_4.h
new file mode 100644
index 0000000..627d867
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_4.h
@@ -0,0 +1,987 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no-evaluate_basis:              True
+//   no-evaluate_basis_derivatives:  True
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __POISSON3D_4_H
+#define __POISSON3D_4_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson3d_4_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson3d_4_finite_element_0();
+
+  /// Destructor
+  virtual ~poisson3d_4_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson3d_4_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson3d_4_dofmap_0();
+
+  /// Destructor
+  virtual ~poisson3d_4_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_4_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_4_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~poisson3d_4_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_4_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_4_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~poisson3d_4_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_4_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_4_form_0();
+
+  /// Destructor
+  virtual ~poisson3d_4_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_4_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_4_form_1();
+
+  /// Destructor
+  virtual ~poisson3d_4_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson3D_4
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_4_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_4_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_4_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_4_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_4_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_4_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/convergence/cpp/Poisson3D_4.ufl b/bench/fem/convergence/cpp/Poisson3D_4.ufl
new file mode 100644
index 0000000..ee902a0
--- /dev/null
+++ b/bench/fem/convergence/cpp/Poisson3D_4.ufl
@@ -0,0 +1,30 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2006-03-28
+#
+# Poisson's equation in 3D for q = 4
+
+element = FiniteElement("Lagrange", tetrahedron, 4)
+
+v = TestFunction(element)
+U = TrialFunction(element)
+f = Coefficient(element)
+
+a = v.dx(i)*U.dx(i)*dx
+L = v*f*dx
diff --git a/bench/fem/convergence/cpp/README b/bench/fem/convergence/cpp/README
new file mode 100644
index 0000000..bb5b742
--- /dev/null
+++ b/bench/fem/convergence/cpp/README
@@ -0,0 +1,46 @@
+This test program solves Poisson's equation
+
+    - div grad u = f
+
+on the unit square and on the unit cube with homogeneous Dirichlet
+boundary conditions.
+
+In 2D, the right-hand side f is given by
+
+    f(x, y) = 2 pi^2 sin(x) sin(y)
+
+and the exact solution is u(x, y) = sin(x) sin(y).
+
+In 3D, the right-hand side f is given by
+
+    f(x, y) = 3 pi^2 sin(x) sin(y) sin(z)
+
+and the exact solution is u(x, y) = sin(x) sin(y) sin(z).
+
+The solution is computed with Lagrange finite elements of degree 1-5
+and the error is computed in the maximum norm (maximum taken only over
+the values at vertices).
+
+Here are the results (2005-06-30, DOLFIN version 0.5.7+):
+
+Maximum norm error in 2D:
+-------------------------
+
+      | h = 1/2   h = 1/4   h = 1/8
+------------------------------------
+q = 1 | 3.831e-01 1.375e-01 3.748e-02
+q = 2 | 1.067e-02 1.782e-03 1.480e-04
+q = 3 | 3.675e-03 5.417e-04 4.243e-05
+q = 4 | 1.027e-03 2.644e-05 4.862e-07
+q = 5 | 1.639e-05 1.803e-06 3.985e-08
+
+Maximum norm error in 3D:
+-------------------------
+
+      | h = 1/2   h = 1/4   h = 1/8
+------------------------------------
+q = 1 | 5.065e-01 2.129e-01 6.127e-02
+q = 2 | 3.890e-02 6.874e-03 5.589e-04
+q = 3 | 1.088e-03 1.722e-03 1.535e-04
+q = 4 | 6.868e-03 2.154e-04 3.983e-06
+q = 5 | 3.821e-04 1.450e-05 3.598e-07
diff --git a/bench/fem/convergence/cpp/compile.log b/bench/fem/convergence/cpp/compile.log
new file mode 100644
index 0000000..2bbb588
--- /dev/null
+++ b/bench/fem/convergence/cpp/compile.log
@@ -0,0 +1,2641 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson3D_3
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG3(?)'
+  Unique sub elements:    'CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG3(?)'
+  Unique sub elements:    'CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.062732 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3600 entries computed in 0.0019 seconds
+  Shape of reference tensor: (20, 20, 3, 3)
+  Primary multi index:   rank = 2 dims = [20, 20] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  400 entries computed in 0.00161 seconds
+  Shape of reference tensor: (20, 20)
+  Primary multi index:   rank = 1 dims = [20] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19]]
+  Secondary multi index: rank = 1 dims = [20] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [20] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.011456 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000390053 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 1.33827 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000546932 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson3D_3.h.
+  Output written to ./Poisson3D_3.cpp.
+  
+Compiler stage 5 finished in 0.00186586 seconds.
+
+FFC finished in 1.41567 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2D_3
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG3(?)'
+  Unique sub elements:    'CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG3(?)'
+  Unique sub elements:    'CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0248919 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  400 entries computed in 0.00294 seconds
+  Shape of reference tensor: (10, 10, 2, 2)
+  Primary multi index:   rank = 2 dims = [10, 10] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  100 entries computed in 0.00242 seconds
+  Shape of reference tensor: (10, 10)
+  Primary multi index:   rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0128181 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000267982 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.191561 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000592947 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2D_3.h.
+  Output written to ./Poisson2D_3.cpp.
+  
+Compiler stage 5 finished in 0.000945091 seconds.
+
+FFC finished in 0.231416 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2D_2
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0247929 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00134 seconds
+  Shape of reference tensor: (6, 6, 2, 2)
+  Primary multi index:   rank = 2 dims = [6, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.00112 seconds
+  Shape of reference tensor: (6, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0100179 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000279903 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.10034 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000654936 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2D_2.h.
+  Output written to ./Poisson2D_2.cpp.
+  
+Compiler stage 5 finished in 0.000978947 seconds.
+
+FFC finished in 0.137541 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2D_5
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG5(?)'
+  Unique sub elements:    'CG5(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 8
+  quadrature_degree: auto --> 8
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG5(?)'
+  Unique sub elements:    'CG5(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 10
+  quadrature_degree: auto --> 10
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0581269 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1764 entries computed in 0.0376 seconds
+  Shape of reference tensor: (21, 21, 2, 2)
+  Primary multi index:   rank = 2 dims = [21, 21] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  441 entries computed in 0.0199 seconds
+  Shape of reference tensor: (21, 21)
+  Primary multi index:   rank = 1 dims = [21] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20]]
+  Secondary multi index: rank = 1 dims = [21] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [21] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0665851 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000237942 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.985738 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000982046 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2D_5.h.
+  Output written to ./Poisson2D_5.cpp.
+  
+Compiler stage 5 finished in 0.00135708 seconds.
+
+FFC finished in 1.11347 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson3D_1
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0238538 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00104 seconds
+  Shape of reference tensor: (4, 4, 3, 3)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  16 entries computed in 0.000931 seconds
+  Shape of reference tensor: (4, 4)
+  Primary multi index:   rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Secondary multi index: rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.012183 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000386 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.103147 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000835896 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson3D_1.h.
+  Output written to ./Poisson3D_1.cpp.
+  
+Compiler stage 5 finished in 0.0011251 seconds.
+
+FFC finished in 0.142052 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson3D_4
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG4(?)'
+  Unique sub elements:    'CG4(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG4(?)'
+  Unique sub elements:    'CG4(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 8
+  quadrature_degree: auto --> 8
+  WARNING: The number of integration points for each cell will be: 125
+           Consider using the option 'quadrature_degree' to reduce the number of points
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.205877 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  11025 entries computed in 0.00378 seconds
+  Shape of reference tensor: (35, 35, 3, 3)
+  Primary multi index:   rank = 2 dims = [35, 35] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [1, 34], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [2, 34], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [3, 34], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [4, 34], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [5, 34], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [6, 34], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [7, 34], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [8, 34], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [9, 34], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [10, 34], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [11, 34], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [12, 34], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [13, 34], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [14, 34], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [15, 34], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [16, 34], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [17, 34], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [18, 34], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [19, 34], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [20, 34], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [21, 34], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [22, 34], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [23, 34], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [24, 34], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [25, 34], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [26, 34], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [27, 34], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [28, 34], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [29, 34], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [30, 34], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [31, 34], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [32, 34], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33], [33, 34], [34, 0], [34, 1], [34, 2], [34, 3], [34, 4], [34, 5], [34, 6], [34, 7], [34, 8], [34, 9], [34, 10], [34, 11], [34, 12], [34, 13], [34, 14], [34, 15], [34, 16], [34, 17], [34, 18], [34, 19], [34, 20], [34, 21], [34, 22], [34, 23], [34, 24], [34, 25], [34, 26], [34, 27], [34, 28], [34, 29], [34, 30], [34, 31], [34, 32], [34, 33], [34, 34]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1225 entries computed in 0.0076 seconds
+  Shape of reference tensor: (35, 35)
+  Primary multi index:   rank = 1 dims = [35] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34]]
+  Secondary multi index: rank = 1 dims = [35] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [35] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0211542 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000286102 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 1.75841 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000604868 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson3D_4.h.
+  Output written to ./Poisson3D_4.cpp.
+  
+Compiler stage 5 finished in 0.00136089 seconds.
+
+FFC finished in 1.98805 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson3D_2
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.030242 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.00102 seconds
+  Shape of reference tensor: (10, 10, 3, 3)
+  Primary multi index:   rank = 2 dims = [10, 10] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  100 entries computed in 0.00106 seconds
+  Shape of reference tensor: (10, 10)
+  Primary multi index:   rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.009583 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000253916 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.306981 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000786066 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson3D_2.h.
+  Output written to ./Poisson3D_2.cpp.
+  
+Compiler stage 5 finished in 0.0013659 seconds.
+
+FFC finished in 0.349607 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2D_1
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0210779 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.00101 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000859 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.011461 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000355959 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.052269 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000806093 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2D_1.h.
+  Output written to ./Poisson2D_1.cpp.
+  
+Compiler stage 5 finished in 0.00107312 seconds.
+
+FFC finished in 0.0875061 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2D_4
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, U]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG4(?)'
+  Unique sub elements:    'CG4(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG4(?)'
+  Unique sub elements:    'CG4(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 8
+  quadrature_degree: auto --> 8
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.060606 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.017 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  225 entries computed in 0.0148 seconds
+  Shape of reference tensor: (15, 15)
+  Primary multi index:   rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Secondary multi index: rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0501802 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000601053 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.430382 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000629187 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2D_4.h.
+  Output written to ./Poisson2D_4.cpp.
+  
+Compiler stage 5 finished in 0.0014081 seconds.
+
+FFC finished in 0.544377 seconds.
diff --git a/bench/fem/convergence/cpp/main.cpp b/bench/fem/convergence/cpp/main.cpp
new file mode 100644
index 0000000..dbd1cdf
--- /dev/null
+++ b/bench/fem/convergence/cpp/main.cpp
@@ -0,0 +1,266 @@
+// Copyright (C) 2005-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+#include <dolfin.h>
+#include "Poisson2D_1.h"
+#include "Poisson2D_2.h"
+#include "Poisson2D_3.h"
+#include "Poisson2D_4.h"
+#include "Poisson2D_5.h"
+#include "Poisson3D_1.h"
+#include "Poisson3D_2.h"
+#include "Poisson3D_3.h"
+#include "Poisson3D_4.h"
+
+using namespace dolfin;
+
+// Boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  { return on_boundary; }
+};
+
+// Right-hand side, 2D
+class Source2D : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = 2.0*DOLFIN_PI*DOLFIN_PI*sin(DOLFIN_PI*x[0])*sin(DOLFIN_PI*x[1]);
+  }
+};
+
+// Right-hand side, 3D
+class Source3D : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = 3.0*DOLFIN_PI*DOLFIN_PI*sin(DOLFIN_PI*x[0])*sin(DOLFIN_PI*x[1])*sin(DOLFIN_PI*x[2]);
+  }
+};
+
+// Solve equation and compute error, 2D
+double solve2D(int q, int n)
+{
+  printf("Solving Poisson's equation in 2D for q = %d, n = %d.\n", q, n);
+
+  // Set up problem
+  UnitSquareMesh mesh(n, n);
+  Source2D f;
+  Constant zero(0.0);
+
+  // Choose forms
+  Form* a = 0;
+  Form* L = 0;
+  FunctionSpace* V = 0;
+  switch (q)
+  {
+  case 1:
+    V = new Poisson2D_1::FunctionSpace(mesh);
+    a = new Poisson2D_1::BilinearForm(*V, *V);
+    L = new Poisson2D_1::LinearForm(*V, f);
+    break;
+  case 2:
+    V = new Poisson2D_2::FunctionSpace(mesh);
+    a = new Poisson2D_2::BilinearForm(*V, *V);
+    L = new Poisson2D_2::LinearForm(*V, f);
+    break;
+  case 3:
+    V = new Poisson2D_3::FunctionSpace(mesh);
+    a = new Poisson2D_3::BilinearForm(*V, *V);
+    L = new Poisson2D_3::LinearForm(*V, f);
+    break;
+  case 4:
+    V = new Poisson2D_4::FunctionSpace(mesh);
+    a = new Poisson2D_4::BilinearForm(*V, *V);
+    L = new Poisson2D_4::LinearForm(*V, f);
+    break;
+  case 5:
+    V = new Poisson2D_5::FunctionSpace(mesh);
+    a = new Poisson2D_5::BilinearForm(*V, *V);
+    L = new Poisson2D_5::LinearForm(*V, f);
+    break;
+  default:
+    error("Forms not compiled for q = %d.", q);
+  }
+
+  // Set up boundary conditions
+  DirichletBoundary boundary;
+  DirichletBC bc(*V, zero, boundary);
+
+  // Discretize equation
+  Matrix A;
+  Vector x, b;
+  assemble(A, *a);
+  assemble(b, *L);
+  bc.apply(A, b);
+
+  // Solve the linear system
+  KrylovSolver solver("gmres");
+  solver.parameters["relative_tolerance"] = 1e-14;
+  solver.solve(A, x, b);
+
+  // Compute maximum norm of error
+  double emax = 0.0;
+  std::vector<double> U;
+  x.get_local(U);
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    const Point p = v->point();
+    const double u = sin(DOLFIN_PI*p.x())*sin(DOLFIN_PI*p.y());
+    const double e = std::abs(U[v->index()] - u);
+    emax = std::max(emax, e);
+  }
+
+  delete a;
+  delete L;
+  delete V;
+
+  return emax;
+}
+
+// Solve equation and compute error, 3D
+double solve3D(int q, int n)
+{
+  printf("Solving Poisson's equation in 3D for q = %d, n = %d.\n", q, n);
+
+  // Set up problem
+  UnitCubeMesh mesh(n, n, n);
+  Source3D f;
+  Constant zero(0.0);
+
+  // Choose forms
+  Form* a = 0;
+  Form* L = 0;
+  FunctionSpace* V = 0;
+  switch (q)
+  {
+  case 1:
+    V = new Poisson3D_1::FunctionSpace(mesh);
+    a = new Poisson3D_1::BilinearForm(*V, *V);
+    L = new Poisson3D_1::LinearForm(*V, f);
+    break;
+  case 2:
+    V = new Poisson3D_2::FunctionSpace(mesh);
+    a = new Poisson3D_2::BilinearForm(*V, *V);
+    L = new Poisson3D_2::LinearForm(*V, f);
+    break;
+  case 3:
+    V = new Poisson3D_3::FunctionSpace(mesh);
+    a = new Poisson3D_3::BilinearForm(*V, *V);
+    L = new Poisson3D_3::LinearForm(*V, f);
+    break;
+  case 4:
+    V = new Poisson3D_4::FunctionSpace(mesh);
+    a = new Poisson3D_4::BilinearForm(*V, *V);
+    L = new Poisson3D_4::LinearForm(*V, f);
+    break;
+  default:
+    error("Forms not compiled for q = %d.", q);
+  }
+
+  // Set up boundary conditions
+  DirichletBoundary boundary;
+  DirichletBC bc(*V, zero, boundary);
+
+  // Discretize equation
+  Matrix A;
+  Vector x, b;
+  assemble(A, *a);
+  assemble(b, *L);
+  bc.apply(A, b);
+
+  // Solve the linear system
+  KrylovSolver solver("gmres");
+  solver.parameters["relative_tolerance"] = 1e-14;
+  solver.solve(A, x, b);
+
+  // Compute maximum norm of error
+  double emax = 0.0;
+  std::vector<double> U;
+  x.get_local(U);
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    const Point p = v->point();
+    const double u = sin(DOLFIN_PI*p.x())*sin(DOLFIN_PI*p.y())*sin(DOLFIN_PI*p.z());
+    const double e = std::abs(U[v->index()] - u);
+    emax = std::max(emax, e);
+  }
+
+  delete a;
+  delete L;
+  delete V;
+
+  return emax;
+}
+
+int main()
+{
+  set_log_active(false);
+
+  const int qmax_2D = 5;
+  const int qmax_3D = 4;
+  const int num_meshes = 3;
+  std::vector<std::vector<double>> e2D(qmax_2D,
+                                       std::vector<double>(num_meshes));
+  std::vector<std::vector<double>> e3D(qmax_3D,
+                                       std::vector<double>(num_meshes));
+
+  // Compute errors in 2D
+  for (int q = 1; q <= qmax_2D; q++)
+  {
+    int n = 2;
+    for (int i = 0; i < num_meshes; i++)
+    {
+      e2D[q - 1][i] = solve2D(q, n);
+      n *= 2;
+    }
+  }
+
+  // Compute errors in 3D
+  for (int q = 1; q <= qmax_3D; q++)
+  {
+    int n = 2;
+    for (int i = 0; i < num_meshes; i++)
+    {
+      e3D[q - 1][i] = solve3D(q, n);
+      n *= 2;
+    }
+  }
+
+  // Write errors in 2D
+  printf("\nMaximum norm error in 2D:\n");
+  printf("-------------------------\n");
+  for (int q = 1; q <= qmax_2D; q++)
+  {
+    printf("q = %d:", q);
+    for (int i = 0; i < num_meshes; i++)
+      printf(" %.3e", e2D[q - 1][i]);
+    printf("\n");
+  }
+
+  // Write errors in 3D
+  printf("\nMaximum norm error in 3D:\n");
+  printf("-------------------------\n");
+  for (int q = 1; q <= qmax_3D; q++)
+  {
+    printf("q = %d:", q);
+    for (int i = 0; i < num_meshes; i++)
+      printf(" %.3e", e3D[q - 1][i]);
+    printf("\n");
+  }
+}
diff --git a/bench/fem/jit/python/bench_fem_jit_python b/bench/fem/jit/python/bench_fem_jit_python
new file mode 100755
index 0000000..7e94bf6
--- /dev/null
+++ b/bench/fem/jit/python/bench_fem_jit_python
@@ -0,0 +1,76 @@
+#!/usr/bin/env python
+
+"""This script provides a benchmark for the JIT compiler, in
+particular the speed of the in-memory cache."""
+
+# Copyright (C) 2008-2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-09-04
+# Last changed: 2010-05-03
+
+from dolfin import *
+from time import time
+
+print "JIT compilation (in memory cache)"
+
+# Benchmark parameters
+NUM_REPS = 10
+SIZE = 3
+
+# Create mesh
+mesh = UnitCubeMesh(SIZE, SIZE, SIZE)
+
+# Create form (velocity equation for "G2")
+V = VectorFunctionSpace(mesh, "Lagrange", 1)
+Q = FunctionSpace(mesh, "Lagrange", 1)
+DG = FunctionSpace(mesh, "DG", 0)
+DGv = VectorFunctionSpace(mesh, "DG", 0)
+
+v  = TestFunction(V)
+q  = TestFunction(Q)
+u  = TrialFunction(V)
+p  = TrialFunction(Q)
+u0 = Function(V)
+p1 = Function(Q)
+W  = Function(DGv)
+nu = Constant(0.1)
+k  = Constant(0.1)
+h  = CellSize(mesh)
+d1 = h
+d2 = 2.0*h
+
+U = 0.5*(u0 + u)
+
+F = (1.0/k)*inner(v, u - u0) + inner(v, grad(U)*W) + nu*inner(grad(v), grad(U)) - div(v)*p1 + \
+    d1*inner(grad(v)*W, grad(U)*W) + d2*div(v)*div(U)
+a = lhs(F*dx)
+
+# JIT compile once
+t0 = time()
+jit(a)
+t1 = time() - t0
+
+# Then JIT compile some more
+t0 = time()
+for i in range(NUM_REPS):
+    jit(a)
+t2 = (time() - t0) / float(NUM_REPS)
+
+print "Disk cache:     ", t1
+print "In-memory cache:", t2
+print "BENCH", t2
diff --git a/bench/fem/multicore/cpp/CMakeLists.txt b/bench/fem/multicore/cpp/CMakeLists.txt
new file mode 100644
index 0000000..7a6f789
--- /dev/null
+++ b/bench/fem/multicore/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_fem_multicore_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/fem/multicore/cpp/NavierStokes.h b/bench/fem/multicore/cpp/NavierStokes.h
new file mode 100644
index 0000000..e0284fa
--- /dev/null
+++ b/bench/fem/multicore/cpp/NavierStokes.h
@@ -0,0 +1,6836 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __NAVIERSTOKES_H
+#define __NAVIERSTOKES_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class navierstokes_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  navierstokes_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~navierstokes_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Compute subdeterminants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+    vertex_values[3] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new navierstokes_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class navierstokes_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  navierstokes_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~navierstokes_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new navierstokes_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class navierstokes_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  navierstokes_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~navierstokes_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 9:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[10] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[11] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[4];
+    vertex_values[4] = dof_values[5];
+    vertex_values[7] = dof_values[6];
+    vertex_values[10] = dof_values[7];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[8];
+    vertex_values[5] = dof_values[9];
+    vertex_values[8] = dof_values[10];
+    vertex_values[11] = dof_values[11];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new navierstokes_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new navierstokes_finite_element_1();
+        break;
+      }
+    case 2:
+      {
+        return new navierstokes_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new navierstokes_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class navierstokes_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  navierstokes_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~navierstokes_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[3];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[3][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new navierstokes_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class navierstokes_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  navierstokes_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~navierstokes_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new navierstokes_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class navierstokes_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  navierstokes_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~navierstokes_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[0][0];
+    dofs[5] = offset + c.entity_indices[0][1];
+    dofs[6] = offset + c.entity_indices[0][2];
+    dofs[7] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[8] = offset + c.entity_indices[0][0];
+    dofs[9] = offset + c.entity_indices[0][1];
+    dofs[10] = offset + c.entity_indices[0][2];
+    dofs[11] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 9;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 11;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 10;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 4;
+        dofs[2] = 8;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 5;
+        dofs[2] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 6;
+        dofs[2] = 10;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 7;
+        dofs[2] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = vertex_coordinates[0];
+    dof_coordinates[4][1] = vertex_coordinates[1];
+    dof_coordinates[4][2] = vertex_coordinates[2];
+    dof_coordinates[5][0] = vertex_coordinates[3];
+    dof_coordinates[5][1] = vertex_coordinates[4];
+    dof_coordinates[5][2] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[6];
+    dof_coordinates[6][1] = vertex_coordinates[7];
+    dof_coordinates[6][2] = vertex_coordinates[8];
+    dof_coordinates[7][0] = vertex_coordinates[9];
+    dof_coordinates[7][1] = vertex_coordinates[10];
+    dof_coordinates[7][2] = vertex_coordinates[11];
+    dof_coordinates[8][0] = vertex_coordinates[0];
+    dof_coordinates[8][1] = vertex_coordinates[1];
+    dof_coordinates[8][2] = vertex_coordinates[2];
+    dof_coordinates[9][0] = vertex_coordinates[3];
+    dof_coordinates[9][1] = vertex_coordinates[4];
+    dof_coordinates[9][2] = vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[6];
+    dof_coordinates[10][1] = vertex_coordinates[7];
+    dof_coordinates[10][2] = vertex_coordinates[8];
+    dof_coordinates[11][0] = vertex_coordinates[9];
+    dof_coordinates[11][1] = vertex_coordinates[10];
+    dof_coordinates[11][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new navierstokes_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new navierstokes_dofmap_1();
+        break;
+      }
+    case 2:
+      {
+        return new navierstokes_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new navierstokes_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class navierstokes_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  navierstokes_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~navierstokes_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W4[4] = {0.0416666666666667, 0.0416666666666667, 0.0416666666666667, 0.0416666666666667};
+    // Quadrature points on the UFC reference element: (0.585410196624969, 0.138196601125011, 0.138196601125011), (0.138196601125011, 0.585410196624969, 0.138196601125011), (0.138196601125011, 0.138196601125011, 0.585410196624969), (0.138196601125011, 0.138196601125011, 0.138196601125011)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0[4][4] = \
+    {{0.138196601125009, 0.585410196624969, 0.138196601125011, 0.138196601125011},
+    {0.138196601125009, 0.138196601125011, 0.585410196624969, 0.138196601125011},
+    {0.138196601125009, 0.138196601125011, 0.138196601125011, 0.585410196624969},
+    {0.585410196624967, 0.138196601125011, 0.138196601125011, 0.138196601125011}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[4] = {0, 1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[4] = {4, 5, 6, 7};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[4] = {8, 9, 10, 11};
+    
+    static const double FE1_C0_D001[4][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[2] = {8, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[2] = {4, 6};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[2] = {4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[2] = {8, 9};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[2] = {8, 10};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {4, 7};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 144; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 567.
+    double G[90];
+    G[0] = 0.5*det*w[3][0]*(K[5]*K[5]*w[2][0] + w[4][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[1] = 0.5*K[3]*K[3]*det*w[1][0]*w[3][0];
+    G[2] = K[3]*K[4]*det*w[1][0]*w[3][0];
+    G[3] = K[3]*K[5]*det*w[1][0]*w[3][0];
+    G[4] = 0.5*K[4]*K[4]*det*w[1][0]*w[3][0];
+    G[5] = K[4]*K[5]*det*w[1][0]*w[3][0];
+    G[6] = 0.5*K[5]*K[5]*det*w[1][0]*w[3][0];
+    G[7] = 0.5*det*w[3][0]*(K[2]*K[5]*w[2][0] + w[4][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[8] = 0.5*K[0]*K[3]*det*w[1][0]*w[3][0];
+    G[9] = 0.5*det*w[1][0]*w[3][0]*(K[0]*K[4] + K[1]*K[3]);
+    G[10] = 0.5*det*w[1][0]*w[3][0]*(K[0]*K[5] + K[2]*K[3]);
+    G[11] = 0.5*K[1]*K[4]*det*w[1][0]*w[3][0];
+    G[12] = 0.5*det*w[1][0]*w[3][0]*(K[1]*K[5] + K[2]*K[4]);
+    G[13] = 0.5*K[2]*K[5]*det*w[1][0]*w[3][0];
+    G[14] = 0.5*K[5]*K[6]*det*w[2][0]*w[3][0];
+    G[15] = 0.5*K[3]*K[5]*det*w[2][0]*w[3][0];
+    G[16] = 0.5*K[0]*K[5]*det*w[2][0]*w[3][0];
+    G[17] = 0.5*K[5]*K[7]*det*w[2][0]*w[3][0];
+    G[18] = 0.5*K[4]*K[5]*det*w[2][0]*w[3][0];
+    G[19] = 0.5*K[1]*K[5]*det*w[2][0]*w[3][0];
+    G[20] = 0.5*det*w[3][0]*(K[5]*K[8]*w[2][0] + w[4][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[21] = 0.5*K[3]*K[6]*det*w[1][0]*w[3][0];
+    G[22] = 0.5*det*w[1][0]*w[3][0]*(K[3]*K[7] + K[4]*K[6]);
+    G[23] = 0.5*det*w[1][0]*w[3][0]*(K[3]*K[8] + K[5]*K[6]);
+    G[24] = 0.5*K[4]*K[7]*det*w[1][0]*w[3][0];
+    G[25] = 0.5*det*w[1][0]*w[3][0]*(K[4]*K[8] + K[5]*K[7]);
+    G[26] = 0.5*K[5]*K[8]*det*w[1][0]*w[3][0];
+    G[27] = 0.5*det*w[3][0]*(K[2]*K[2]*w[2][0] + w[4][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[28] = 0.5*K[0]*K[0]*det*w[1][0]*w[3][0];
+    G[29] = K[0]*K[1]*det*w[1][0]*w[3][0];
+    G[30] = K[0]*K[2]*det*w[1][0]*w[3][0];
+    G[31] = 0.5*K[1]*K[1]*det*w[1][0]*w[3][0];
+    G[32] = K[1]*K[2]*det*w[1][0]*w[3][0];
+    G[33] = 0.5*K[2]*K[2]*det*w[1][0]*w[3][0];
+    G[34] = 0.5*K[2]*K[6]*det*w[2][0]*w[3][0];
+    G[35] = 0.5*K[2]*K[3]*det*w[2][0]*w[3][0];
+    G[36] = 0.5*K[0]*K[2]*det*w[2][0]*w[3][0];
+    G[37] = 0.5*K[2]*K[7]*det*w[2][0]*w[3][0];
+    G[38] = 0.5*K[2]*K[4]*det*w[2][0]*w[3][0];
+    G[39] = 0.5*K[1]*K[2]*det*w[2][0]*w[3][0];
+    G[40] = 0.5*det*w[3][0]*(K[2]*K[8]*w[2][0] + w[4][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[41] = 0.5*K[0]*K[6]*det*w[1][0]*w[3][0];
+    G[42] = 0.5*det*w[1][0]*w[3][0]*(K[0]*K[7] + K[1]*K[6]);
+    G[43] = 0.5*det*w[1][0]*w[3][0]*(K[0]*K[8] + K[2]*K[6]);
+    G[44] = 0.5*K[1]*K[7]*det*w[1][0]*w[3][0];
+    G[45] = 0.5*det*w[1][0]*w[3][0]*(K[1]*K[8] + K[2]*K[7]);
+    G[46] = 0.5*K[2]*K[8]*det*w[1][0]*w[3][0];
+    G[47] = 0.5*det*w[3][0]*(K[6]*K[6]*w[2][0] + w[4][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[48] = 0.5*K[6]*K[6]*det*w[1][0]*w[3][0];
+    G[49] = K[6]*K[7]*det*w[1][0]*w[3][0];
+    G[50] = K[6]*K[8]*det*w[1][0]*w[3][0];
+    G[51] = 0.5*K[7]*K[7]*det*w[1][0]*w[3][0];
+    G[52] = K[7]*K[8]*det*w[1][0]*w[3][0];
+    G[53] = 0.5*K[8]*K[8]*det*w[1][0]*w[3][0];
+    G[54] = 0.5*det*w[3][0]*(K[3]*K[6]*w[2][0] + w[4][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[55] = 0.5*det*w[3][0]*(K[0]*K[6]*w[2][0] + w[4][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[56] = 0.5*K[6]*K[7]*det*w[2][0]*w[3][0];
+    G[57] = 0.5*K[4]*K[6]*det*w[2][0]*w[3][0];
+    G[58] = 0.5*K[1]*K[6]*det*w[2][0]*w[3][0];
+    G[59] = 0.5*K[6]*K[8]*det*w[2][0]*w[3][0];
+    G[60] = 0.5*det*w[3][0]*(K[3]*K[3]*w[2][0] + w[4][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[61] = 0.5*det*w[3][0]*(K[0]*K[3]*w[2][0] + w[4][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[62] = 0.5*K[3]*K[7]*det*w[2][0]*w[3][0];
+    G[63] = 0.5*K[3]*K[4]*det*w[2][0]*w[3][0];
+    G[64] = 0.5*K[1]*K[3]*det*w[2][0]*w[3][0];
+    G[65] = 0.5*K[3]*K[8]*det*w[2][0]*w[3][0];
+    G[66] = 0.5*det*w[3][0]*(K[0]*K[0]*w[2][0] + w[4][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[67] = 0.5*K[0]*K[7]*det*w[2][0]*w[3][0];
+    G[68] = 0.5*K[0]*K[4]*det*w[2][0]*w[3][0];
+    G[69] = 0.5*K[0]*K[1]*det*w[2][0]*w[3][0];
+    G[70] = 0.5*K[0]*K[8]*det*w[2][0]*w[3][0];
+    G[71] = 0.5*det*w[3][0]*(K[7]*K[7]*w[2][0] + w[4][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[72] = 0.5*det*w[3][0]*(K[4]*K[7]*w[2][0] + w[4][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[73] = 0.5*det*w[3][0]*(K[1]*K[7]*w[2][0] + w[4][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[74] = 0.5*K[7]*K[8]*det*w[2][0]*w[3][0];
+    G[75] = 0.5*det*w[3][0]*(K[4]*K[4]*w[2][0] + w[4][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[76] = 0.5*det*w[3][0]*(K[1]*K[4]*w[2][0] + w[4][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[77] = 0.5*K[4]*K[8]*det*w[2][0]*w[3][0];
+    G[78] = 0.5*det*w[3][0]*(K[1]*K[1]*w[2][0] + w[4][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[79] = 0.5*K[1]*K[8]*det*w[2][0]*w[3][0];
+    G[80] = 0.5*det*w[3][0]*(K[8]*K[8]*w[2][0] + w[4][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[81] = 0.5*K[6]*det*w[3][0];
+    G[82] = 0.5*K[7]*det*w[3][0];
+    G[83] = 0.5*K[8]*det*w[3][0];
+    G[84] = 0.5*K[3]*det*w[3][0];
+    G[85] = 0.5*K[4]*det*w[3][0];
+    G[86] = 0.5*K[5]*det*w[3][0];
+    G[87] = 0.5*K[0]*det*w[3][0];
+    G[88] = 0.5*K[1]*det*w[3][0];
+    G[89] = 0.5*K[2]*det*w[3][0];
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 6760
+    for (unsigned int ip = 0; ip < 4; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      
+      // Total number of operations to compute function values = 24
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        F0 += FE1_C0[ip][r]*w[0][nzc0[r]];
+        F1 += FE1_C0[ip][r]*w[0][nzc4[r]];
+        F2 += FE1_C0[ip][r]*w[0][nzc8[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 334
+      double I[49];
+      // Number of operations: 16
+      I[0] = W4[ip]*(G[0] + F0*F0*G[1] + F1*(F0*G[2] + F1*G[4]) + F2*(F0*G[3] + F1*G[5] + F2*G[6]));
+      
+      // Number of operations: 16
+      I[1] = W4[ip]*(G[7] + F0*F0*G[8] + F1*(F0*G[9] + F1*G[11]) + F2*(F0*G[10] + F1*G[12] + F2*G[13]));
+      
+      // Number of operations: 1
+      I[2] = G[14]*W4[ip];
+      
+      // Number of operations: 1
+      I[3] = G[15]*W4[ip];
+      
+      // Number of operations: 1
+      I[4] = G[16]*W4[ip];
+      
+      // Number of operations: 1
+      I[5] = G[17]*W4[ip];
+      
+      // Number of operations: 1
+      I[6] = G[18]*W4[ip];
+      
+      // Number of operations: 1
+      I[7] = G[19]*W4[ip];
+      
+      // Number of operations: 16
+      I[8] = W4[ip]*(G[20] + F0*F0*G[21] + F1*(F0*G[22] + F1*G[24]) + F2*(F0*G[23] + F1*G[25] + F2*G[26]));
+      
+      // Number of operations: 16
+      I[9] = W4[ip]*(G[27] + F0*F0*G[28] + F1*(F0*G[29] + F1*G[31]) + F2*(F0*G[30] + F1*G[32] + F2*G[33]));
+      
+      // Number of operations: 1
+      I[10] = G[34]*W4[ip];
+      
+      // Number of operations: 1
+      I[11] = G[35]*W4[ip];
+      
+      // Number of operations: 1
+      I[12] = G[36]*W4[ip];
+      
+      // Number of operations: 1
+      I[13] = G[37]*W4[ip];
+      
+      // Number of operations: 1
+      I[14] = G[38]*W4[ip];
+      
+      // Number of operations: 1
+      I[15] = G[39]*W4[ip];
+      
+      // Number of operations: 16
+      I[16] = W4[ip]*(G[40] + F0*F0*G[41] + F1*(F0*G[42] + F1*G[44]) + F2*(F0*G[43] + F1*G[45] + F2*G[46]));
+      
+      // Number of operations: 16
+      I[17] = W4[ip]*(G[47] + F0*F0*G[48] + F1*(F0*G[49] + F1*G[51]) + F2*(F0*G[50] + F1*G[52] + F2*G[53]));
+      
+      // Number of operations: 16
+      I[18] = W4[ip]*(G[54] + F0*F0*G[21] + F1*(F0*G[22] + F1*G[24]) + F2*(F0*G[23] + F1*G[25] + F2*G[26]));
+      
+      // Number of operations: 16
+      I[19] = W4[ip]*(G[55] + F0*F0*G[41] + F1*(F0*G[42] + F1*G[44]) + F2*(F0*G[43] + F1*G[45] + F2*G[46]));
+      
+      // Number of operations: 1
+      I[20] = G[56]*W4[ip];
+      
+      // Number of operations: 1
+      I[21] = G[57]*W4[ip];
+      
+      // Number of operations: 1
+      I[22] = G[58]*W4[ip];
+      
+      // Number of operations: 1
+      I[23] = G[59]*W4[ip];
+      
+      // Number of operations: 16
+      I[24] = W4[ip]*(G[60] + F0*F0*G[1] + F1*(F0*G[2] + F1*G[4]) + F2*(F0*G[3] + F1*G[5] + F2*G[6]));
+      
+      // Number of operations: 16
+      I[25] = W4[ip]*(G[61] + F0*F0*G[8] + F1*(F0*G[9] + F1*G[11]) + F2*(F0*G[10] + F1*G[12] + F2*G[13]));
+      
+      // Number of operations: 1
+      I[26] = G[62]*W4[ip];
+      
+      // Number of operations: 1
+      I[27] = G[63]*W4[ip];
+      
+      // Number of operations: 1
+      I[28] = G[64]*W4[ip];
+      
+      // Number of operations: 1
+      I[29] = G[65]*W4[ip];
+      
+      // Number of operations: 16
+      I[30] = W4[ip]*(G[66] + F0*F0*G[28] + F1*(F0*G[29] + F1*G[31]) + F2*(F0*G[30] + F1*G[32] + F2*G[33]));
+      
+      // Number of operations: 1
+      I[31] = G[67]*W4[ip];
+      
+      // Number of operations: 1
+      I[32] = G[68]*W4[ip];
+      
+      // Number of operations: 1
+      I[33] = G[69]*W4[ip];
+      
+      // Number of operations: 1
+      I[34] = G[70]*W4[ip];
+      
+      // Number of operations: 16
+      I[35] = W4[ip]*(G[71] + F0*F0*G[48] + F1*(F0*G[49] + F1*G[51]) + F2*(F0*G[50] + F1*G[52] + F2*G[53]));
+      
+      // Number of operations: 16
+      I[36] = W4[ip]*(G[72] + F0*F0*G[21] + F1*(F0*G[22] + F1*G[24]) + F2*(F0*G[23] + F1*G[25] + F2*G[26]));
+      
+      // Number of operations: 16
+      I[37] = W4[ip]*(G[73] + F0*F0*G[41] + F1*(F0*G[42] + F1*G[44]) + F2*(F0*G[43] + F1*G[45] + F2*G[46]));
+      
+      // Number of operations: 1
+      I[38] = G[74]*W4[ip];
+      
+      // Number of operations: 16
+      I[39] = W4[ip]*(G[75] + F0*F0*G[1] + F1*(F0*G[2] + F1*G[4]) + F2*(F0*G[3] + F1*G[5] + F2*G[6]));
+      
+      // Number of operations: 16
+      I[40] = W4[ip]*(G[76] + F0*F0*G[8] + F1*(F0*G[9] + F1*G[11]) + F2*(F0*G[10] + F1*G[12] + F2*G[13]));
+      
+      // Number of operations: 1
+      I[41] = G[77]*W4[ip];
+      
+      // Number of operations: 16
+      I[42] = W4[ip]*(G[78] + F0*F0*G[28] + F1*(F0*G[29] + F1*G[31]) + F2*(F0*G[30] + F1*G[32] + F2*G[33]));
+      
+      // Number of operations: 1
+      I[43] = G[79]*W4[ip];
+      
+      // Number of operations: 16
+      I[44] = W4[ip]*(G[80] + F0*F0*G[48] + F1*(F0*G[49] + F1*G[51]) + F2*(F0*G[50] + F1*G[52] + F2*G[53]));
+      
+      // Number of operations: 6
+      I[45] = W4[ip]*(F0*G[81] + F1*G[82] + F2*G[83]);
+      
+      // Number of operations: 6
+      I[46] = W4[ip]*(F0*G[84] + F1*G[85] + F2*G[86]);
+      
+      // Number of operations: 6
+      I[47] = W4[ip]*(F0*G[87] + F1*G[88] + F2*G[89]);
+      
+      // Number of operations: 1
+      I[48] = W4[ip]*det;
+      
+      
+      // Number of operations for primary indices: 216
+      for (unsigned int j = 0; j < 4; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*12 + nzc1[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[45];
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*12 + nzc2[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[46];
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*12 + nzc3[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[47];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc5[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[45];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc6[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[46];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc7[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[47];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc10[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[46];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc11[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[47];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc9[k]] += FE1_C0[ip][j]*FE1_C0_D001[ip][k]*I[45];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 972
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[0];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[5];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[6];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[7];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[8];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[9];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[10];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[11];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[12];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[13];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[14];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[15];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[16];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[10];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[17];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[18];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[19];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[20];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[21];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[22];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[23];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[11];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[18];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[24];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[25];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[26];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[27];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[28];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[29];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[12];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[19];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[25];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[30];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[31];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[32];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[33];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[34];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[5];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[13];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[20];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[26];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[31];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[35];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[36];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[37];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[38];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[6];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[14];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[21];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[27];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[32];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[36];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[39];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[40];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[41];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[7];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[15];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[22];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[28];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[33];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[37];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[40];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[42];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[43];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc10[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[8];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc11[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[16];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc1[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[23];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc2[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[29];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc3[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[34];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc5[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[38];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc6[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[41];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc7[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[43];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc9[k]] += FE1_C0_D001[ip][j]*FE1_C0_D001[ip][k]*I[44];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 144
+      for (unsigned int j = 0; j < 4; j++)
+      {
+        for (unsigned int k = 0; k < 4; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*12 + nzc0[k]] += FE1_C0[ip][j]*FE1_C0[ip][k]*I[48];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*12 + nzc4[k]] += FE1_C0[ip][j]*FE1_C0[ip][k]*I[48];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc8[k]] += FE1_C0[ip][j]*FE1_C0[ip][k]*I[48];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class navierstokes_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  navierstokes_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~navierstokes_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "c1a30d8123246b455c4992f0cbace8819e978dcae09c23533fc94d9938276bbae541af15c5653df6f80d5c2f6430869430fa884aaf11cfe9c9afd212af180d16";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 5;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new navierstokes_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new navierstokes_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new navierstokes_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new navierstokes_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new navierstokes_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new navierstokes_finite_element_0();
+        break;
+      }
+    case 6:
+      {
+        return new navierstokes_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new navierstokes_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new navierstokes_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new navierstokes_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new navierstokes_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new navierstokes_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new navierstokes_dofmap_0();
+        break;
+      }
+    case 6:
+      {
+        return new navierstokes_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new navierstokes_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace NavierStokes
+{
+
+class CoefficientSpace_d1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_d1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_d1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_d1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_d1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_d1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_d1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_d1()
+  {
+  }
+
+};
+
+class CoefficientSpace_d2: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_d2(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_d2(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_d2(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_d2(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_d2(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_d2(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_d2()
+  {
+  }
+
+};
+
+class CoefficientSpace_k: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_k(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_k()
+  {
+  }
+
+};
+
+class CoefficientSpace_nu: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_nu(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_nu(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_nu(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_nu()
+  {
+  }
+
+};
+
+class CoefficientSpace_w: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_w(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_w(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_w(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_w()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new navierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new navierstokes_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_w Form_a_FunctionSpace_2;
+
+typedef CoefficientSpace_d1 Form_a_FunctionSpace_3;
+
+typedef CoefficientSpace_d2 Form_a_FunctionSpace_4;
+
+typedef CoefficientSpace_k Form_a_FunctionSpace_5;
+
+typedef CoefficientSpace_nu Form_a_FunctionSpace_6;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new navierstokes_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& d1, const dolfin::GenericFunction& d2, const dolfin::GenericFunction& k, const dolfin::GenericFunction& nu):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->w = w;
+    this->d1 = d1;
+    this->d2 = d2;
+    this->k = k;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new navierstokes_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> d1, std::shared_ptr<const dolfin::GenericFunction> d2, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->w = *w;
+    this->d1 = *d1;
+    this->d2 = *d2;
+    this->k = *k;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new navierstokes_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new navierstokes_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& d1, const dolfin::GenericFunction& d2, const dolfin::GenericFunction& k, const dolfin::GenericFunction& nu):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->w = w;
+    this->d1 = d1;
+    this->d2 = d2;
+    this->k = k;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new navierstokes_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> d1, std::shared_ptr<const dolfin::GenericFunction> d2, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(2, 5), w(*this, 0), d1(*this, 1), d2(*this, 2), k(*this, 3), nu(*this, 4)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->w = *w;
+    this->d1 = *d1;
+    this->d2 = *d2;
+    this->k = *k;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new navierstokes_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+    else if (name == "d1")
+      return 1;
+    else if (name == "d2")
+      return 2;
+    else if (name == "k")
+      return 3;
+    else if (name == "nu")
+      return 4;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    case 1:
+      return "d1";
+    case 2:
+      return "d2";
+    case 3:
+      return "k";
+    case 4:
+      return "nu";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_w;
+  typedef Form_a_FunctionSpace_3 CoefficientSpace_d1;
+  typedef Form_a_FunctionSpace_4 CoefficientSpace_d2;
+  typedef Form_a_FunctionSpace_5 CoefficientSpace_k;
+  typedef Form_a_FunctionSpace_6 CoefficientSpace_nu;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+  dolfin::CoefficientAssigner d1;
+  dolfin::CoefficientAssigner d2;
+  dolfin::CoefficientAssigner k;
+  dolfin::CoefficientAssigner nu;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/multicore/cpp/NavierStokes.ufl b/bench/fem/multicore/cpp/NavierStokes.ufl
new file mode 100644
index 0000000..ea6f86b
--- /dev/null
+++ b/bench/fem/multicore/cpp/NavierStokes.ufl
@@ -0,0 +1,16 @@
+# The bilinear form for a stabilized formulation of Navier-Stokes
+
+element = VectorElement("Lagrange", tetrahedron, 1)
+constant_scalar = FiniteElement("Discontinuous Lagrange", tetrahedron, 0)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+w  = Coefficient(element)
+d1 = Coefficient(constant_scalar)
+d2 = Coefficient(constant_scalar)
+k  = Coefficient(constant_scalar)
+nu = Coefficient(constant_scalar)
+
+a  = inner(u, v)*dx + 0.5*k*nu*inner(grad(u), grad(v))*dx + 0.5*k*inner(grad(u)*w, v)*dx \
+   + d1*0.5*k*dot(grad(u)*w, grad(v)*w)*dx + d2*0.5*k*div(u)*div(v)*dx
diff --git a/bench/fem/multicore/cpp/Poisson.h b/bench/fem/multicore/cpp/Poisson.h
new file mode 100644
index 0000000..2f3a252
--- /dev/null
+++ b/bench/fem/multicore/cpp/Poisson.h
@@ -0,0 +1,2051 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 28
+    // Total number of operations (multiply-add pairs):                  58
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1 + 0.166666666666667*G0_0_2 + 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1 + 0.166666666666667*G0_1_2 + 0.166666666666667*G0_2_0 + 0.166666666666667*G0_2_1 + 0.166666666666667*G0_2_2;
+    A[1] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_1_0 - 0.166666666666667*G0_2_0;
+    A[2] = -0.166666666666667*G0_0_1 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_2_1;
+    A[3] = -0.166666666666667*G0_0_2 - 0.166666666666667*G0_1_2 - 0.166666666666667*G0_2_2;
+    A[4] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_0_1 - 0.166666666666667*G0_0_2;
+    A[5] = 0.166666666666667*G0_0_0;
+    A[6] = 0.166666666666667*G0_0_1;
+    A[7] = 0.166666666666667*G0_0_2;
+    A[8] = -0.166666666666667*G0_1_0 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_1_2;
+    A[9] = 0.166666666666667*G0_1_0;
+    A[10] = 0.166666666666667*G0_1_1;
+    A[11] = 0.166666666666667*G0_1_2;
+    A[12] = -0.166666666666667*G0_2_0 - 0.166666666666667*G0_2_1 - 0.166666666666667*G0_2_2;
+    A[13] = 0.166666666666667*G0_2_0;
+    A[14] = 0.166666666666667*G0_2_1;
+    A[15] = 0.166666666666667*G0_2_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "485ee4abc20119b82968409dcd30845bbd75cf8eb2d37865cd36ae609240e0096d0047eeab6075652c6e4268052caed39792496313b48a8a3cb2824bcd9e32aa";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/multicore/cpp/Poisson.ufl b/bench/fem/multicore/cpp/Poisson.ufl
new file mode 100644
index 0000000..5fd6064
--- /dev/null
+++ b/bench/fem/multicore/cpp/Poisson.ufl
@@ -0,0 +1,8 @@
+# Standard Poisson bilinear form
+
+element = FiniteElement("Lagrange", tetrahedron, 1)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+
+a = inner(grad(u), grad(v))*dx
diff --git a/bench/fem/multicore/cpp/compile.log b/bench/fem/multicore/cpp/compile.log
new file mode 100644
index 0000000..9b73ca7
--- /dev/null
+++ b/bench/fem/multicore/cpp/compile.log
@@ -0,0 +1,1409 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0196071 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00097 seconds
+  Shape of reference tensor: (4, 4, 3, 3)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00837588 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000259161 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.078908 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000422955 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000681877 seconds.
+
+FFC finished in 0.10866 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form NavierStokes
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 5
+  Coefficients:           '[w_0, w_1, w_2, w_3, w_4]'
+  Coefficient names:      '[w, d1, d2, k, nu]'
+  Unique elements:        'Vector<3 x CG1(?)>, DG0(?)'
+  Unique sub elements:    'Vector<3 x CG1(?)>, DG0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 6
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.03074 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {4: {VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]]]), (0, 1, 0): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]]]), (0, 0, 0): array([[[ 0.1381966,  0.1381966,  0.1381966,  0.5854102],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.5854102,  0.1381966,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.1381966,  0.5854102,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.1381966,  0.1381966,  0.5854102,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.1381966,  0.5854102],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.5854102,  0.1381966,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.5854102,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.5854102,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.1381966,  0.5854102]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.5854102,  0.1381966,  0.1381966,  0.1381966]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.5854102,  0.1381966,  0.1381966]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.5854102,  0.1381966]]]), (0, 0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]])}}}, FiniteElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0, 0): array([[ 1.,  1.,  1.,  1.]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.99600361e-16,   5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE1_C1': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.5854102,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.5854102,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.1381966,  0.5854102,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.5854102,
+           0.1381966,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE1_C2': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.5854102,
+           0.1381966,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.5854102,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.1381966,  0.5854102],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.5854102,  0.1381966,
+           0.1381966,  0.1381966]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.99600361e-16,   5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE1_C0_D010': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE1_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.99600361e-16,
+            5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE1_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.99600361e-16,   5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE1_C1': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.5854102,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.5854102,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.1381966,  0.5854102,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.5854102,
+           0.1381966,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE1_C2': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.5854102,
+           0.1381966,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.5854102,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.1381966,  0.5854102],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.5854102,  0.1381966,
+           0.1381966,  0.1381966]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.99600361e-16,   5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE1_C0_D010': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE1_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.99600361e-16,
+            5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE1_C0_D001': 'FE1_C0_D001', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C2': 'FE1_C2', 'FE1_C0_D100': 'FE1_C0_D100', 'FE1_C2_D001': 'FE1_C2_D001', 'FE1_C0_D010': 'FE1_C0_D010', 'FE1_C1_D010': 'FE1_C1_D010', 'FE1_C1_D100': 'FE1_C1_D100', 'FE1_C2_D100': 'FE1_C2_D100', 'FE0': 'FE0', 'FE1_C2_D010': 'FE1_C2_D010', 'FE1_C1_D001': 'FE1_C1_D001'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0_D001': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE1_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966]]), 'FE0': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE1_C0_D001': ('FE1_C0_D001', (1, [0, 3]), False, False), 'FE1_C0': ('FE1_C0', (0, [0, 1, 2, 3]), False, False), 'FE1_C1': ('FE1_C0', (4, [4, 5, 6, 7]), False, False), 'FE1_C2': ('FE1_C0', (8, [8, 9, 10, 11]), False, False), 'FE1_C0_D100': ('FE1_C0_D001', (3, [0, 1]), False, False), 'FE1_C2_D001': ('FE1_C0_D001', (9, [8, 11]), False, False), 'FE1_C0_D010': ('FE1_C0_D001', (2, [0, 2]), False, False), 'FE1_C1_D010': ('FE1_C0_D001', (6, [4, 6]), False, False), 'FE1_C1_D100': ('FE1_C0_D001', (7, [4, 5]), False, False), 'FE1_C2_D100': ('FE1_C0_D001', (11, [8, 9]), False, False), 'FE0': ('FE0', (), False, True), 'FE1_C2_D010': ('FE1_C0_D001', (10, [8, 10]), False, False), 'FE1_C1_D001': ('FE1_C0_D001', (5, [4, 7]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.241525 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.047478 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Z
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: d_22
+  Removing unused variable: d_21
+  Removing unused variable: d_20
+  Removing unused variable: d_12
+  Removing unused variable: d_11
+  Removing unused variable: d_10
+  Removing unused variable: d_02
+  Removing unused variable: d_01
+  Removing unused variable: d_00
+  Removing unused variable: C2
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.269304 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.0011611 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./NavierStokes.h.
+  
+Compiler stage 5 finished in 0.001544 seconds.
+
+FFC finished in 0.592213 seconds.
diff --git a/bench/fem/multicore/cpp/main.cpp b/bench/fem/multicore/cpp/main.cpp
new file mode 100644
index 0000000..cc63835
--- /dev/null
+++ b/bench/fem/multicore/cpp/main.cpp
@@ -0,0 +1,184 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-11-11
+// Last changed: 2012-11-02
+//
+// If run without command-line arguments, this benchmark iterates from
+// zero to MAX_NUM_THREADS. If a command-line argument --num_threads n
+// is given, the benchmark is run with the specified number of threads.
+
+#include <cstdlib>
+
+#include <dolfin.h>
+#include <dolfin/fem/AssemblerBase.h>
+#include "Poisson.h"
+#include "NavierStokes.h"
+
+#define MAX_NUM_THREADS 4
+#define SIZE 32
+#define NUM_REPS 10
+
+using namespace dolfin;
+
+class PoissonFactory
+{
+  public:
+
+  static std::shared_ptr<Form> a(const Mesh& mesh)
+  {
+    // Create function space
+    std::shared_ptr<FunctionSpace> _V(new Poisson::FunctionSpace(mesh));
+    std::shared_ptr<Form> _a(new Poisson::BilinearForm(_V, _V));;
+    return _a;
+  }
+
+};
+
+class NavierStokesFactory
+{
+  public:
+
+  static std::shared_ptr<Form> a(const Mesh& mesh)
+  {
+    std::shared_ptr<FunctionSpace> _V(new NavierStokes::FunctionSpace(mesh));
+
+    std::shared_ptr<FunctionSpace>
+      W0(new NavierStokes::Form_a_FunctionSpace_2(mesh));
+    std::shared_ptr<FunctionSpace>
+      W1(new NavierStokes::Form_a_FunctionSpace_3(mesh));
+    std::shared_ptr<FunctionSpace>
+      W2(new NavierStokes::Form_a_FunctionSpace_4(mesh));
+    std::shared_ptr<FunctionSpace>
+      W3(new NavierStokes::Form_a_FunctionSpace_5(mesh));
+    std::shared_ptr<FunctionSpace>
+      W4(new NavierStokes::Form_a_FunctionSpace_6(mesh));
+
+    std::shared_ptr<Function> w0(new Function(W0));
+    std::shared_ptr<Function> w1(new Function(W1));
+    std::shared_ptr<Function> w2(new Function(W2));
+    std::shared_ptr<Function> w3(new Function(W3));
+    std::shared_ptr<Function> w4(new Function(W4));
+
+    std::shared_ptr<Form> a(new NavierStokes::BilinearForm(_V, _V));
+
+    a->set_coefficient(0, w0);
+    a->set_coefficient(1, w1);
+    a->set_coefficient(2, w2);
+    a->set_coefficient(3, w3);
+    a->set_coefficient(4, w4);
+
+    return a;
+  }
+};
+
+double bench(std::string form, std::shared_ptr<const Form> a)
+{
+  std::size_t num_threads = parameters["num_threads"];
+  info_underline("Benchmarking %s, num_threads = %d", form.c_str(),
+                 num_threads);
+
+  // Create matrix
+  Matrix A;
+
+  // Assemble once to initialize matrix
+  Assembler assembler;
+  assembler.reset_sparsity = false;
+  assemble(A, *a);
+
+  // Run timing
+  Timer timer("Total time");
+  for (std::size_t i = 0; i < NUM_REPS; ++i)
+    assemble(A, *a);
+  const double t = timer.stop();
+
+  // Write summary
+  summary(true);
+
+  info("");
+
+  return t;
+}
+
+int main(int argc, char* argv[])
+{
+  // Parse command-line arguments
+  parameters.parse(argc, argv);
+
+  // Set backend
+  //parameters["linear_algebra_backend"] = "Epetra";
+
+  // Create mesh
+  UnitCubeMesh old_mesh(SIZE, SIZE, SIZE);
+  old_mesh.color("vertex");
+  Mesh mesh = old_mesh.renumber_by_color();
+
+  // Test cases
+  std::vector<std::pair<std::string, std::shared_ptr<const Form> > > forms;
+  forms.push_back(std::make_pair("Poisson", PoissonFactory::a(mesh)));
+  forms.push_back(std::make_pair("NavierStokes", NavierStokesFactory::a(mesh)));
+
+  // If parameter num_threads has been set, just run once
+  if (parameters["num_threads"].change_count() > 0)
+  {
+    for (std::size_t i = 0; i < forms.size(); i++)
+      bench(forms[i].first, forms[i].second);
+  }
+
+  // Otherwise, iterate from 1 to MAX_NUM_THREADS
+  else
+  {
+    Table run_timings("Timings");
+    Table speedups("Speedups");
+
+    // Iterate over number of threads
+    for (int num_threads = 0; num_threads <= MAX_NUM_THREADS; num_threads++)
+    {
+      // Set the number of threads
+      parameters["num_threads"] = num_threads;
+
+      // Iterate over forms
+      for (std::size_t i = 0; i < forms.size(); i++)
+      {
+        // Run test case
+        const double t = bench(forms[i].first, forms[i].second);
+
+        // Store results and scale to get speedups
+        std::stringstream s;
+        s << num_threads << " threads";
+        run_timings(s.str(), forms[i].first) = t;
+        speedups(s.str(), forms[i].first)
+          = run_timings.get_value("0 threads", forms[i].first)/t;
+        if (num_threads == 0)
+          speedups(s.str(), "(rel 1 thread " + forms[i].first + ")") = "-";
+        else
+        {
+          speedups(s.str(),  "(rel 1 thread " + forms[i].first + ")")
+            = run_timings.get_value("1 threads", forms[i].first)/t;
+        }
+      }
+    }
+
+    // Display results
+    info("");
+    info(run_timings, true);
+    info("");
+    info(speedups, true);
+  }
+
+  return 0;
+}
diff --git a/bench/fem/speedup/cpp/CMakeLists.txt b/bench/fem/speedup/cpp/CMakeLists.txt
new file mode 100644
index 0000000..978dc38
--- /dev/null
+++ b/bench/fem/speedup/cpp/CMakeLists.txt
@@ -0,0 +1,42 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_fem_speedup_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(bench_solve-poisson solve-poisson.cpp)
+add_executable(bench_assemble-poisson assemble-poisson.cpp)
+
+# Target libraries
+target_link_libraries(bench_solve-poisson ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
+target_link_libraries(bench_assemble-poisson ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/fem/speedup/cpp/Poisson.h b/bench/fem/speedup/cpp/Poisson.h
new file mode 100644
index 0000000..a608275
--- /dev/null
+++ b/bench/fem/speedup/cpp/Poisson.h
@@ -0,0 +1,2584 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 28
+    // Total number of operations (multiply-add pairs):                  58
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1 + 0.166666666666667*G0_0_2 + 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1 + 0.166666666666667*G0_1_2 + 0.166666666666667*G0_2_0 + 0.166666666666667*G0_2_1 + 0.166666666666667*G0_2_2;
+    A[1] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_1_0 - 0.166666666666667*G0_2_0;
+    A[2] = -0.166666666666667*G0_0_1 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_2_1;
+    A[3] = -0.166666666666667*G0_0_2 - 0.166666666666667*G0_1_2 - 0.166666666666667*G0_2_2;
+    A[4] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_0_1 - 0.166666666666667*G0_0_2;
+    A[5] = 0.166666666666667*G0_0_0;
+    A[6] = 0.166666666666667*G0_0_1;
+    A[7] = 0.166666666666667*G0_0_2;
+    A[8] = -0.166666666666667*G0_1_0 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_1_2;
+    A[9] = 0.166666666666667*G0_1_0;
+    A[10] = 0.166666666666667*G0_1_1;
+    A[11] = 0.166666666666667*G0_1_2;
+    A[12] = -0.166666666666667*G0_2_0 - 0.166666666666667*G0_2_1 - 0.166666666666667*G0_2_2;
+    A[13] = 0.166666666666667*G0_2_0;
+    A[14] = 0.166666666666667*G0_2_1;
+    A[15] = 0.166666666666667*G0_2_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    4
+    // Number of operations (multiply-add pairs) for tensor contraction: 14
+    // Total number of operations (multiply-add pairs):                  21
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0 + 0.0083333333333333*G0_1 + 0.0083333333333333*G0_2 + 0.0083333333333333*G0_3;
+    A[1] = 0.0083333333333333*G0_0 + 0.0166666666666667*G0_1 + 0.00833333333333337*G0_2 + 0.00833333333333337*G0_3;
+    A[2] = 0.0083333333333333*G0_0 + 0.00833333333333337*G0_1 + 0.0166666666666667*G0_2 + 0.00833333333333337*G0_3;
+    A[3] = 0.0083333333333333*G0_0 + 0.00833333333333337*G0_1 + 0.00833333333333337*G0_2 + 0.0166666666666667*G0_3;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "485ee4abc20119b82968409dcd30845bbd75cf8eb2d37865cd36ae609240e0096d0047eeab6075652c6e4268052caed39792496313b48a8a3cb2824bcd9e32aa";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "c082c1c25a4ba7a938c9ca1a7b631eccd027000fb5b9464fb5a3a47fc51677a6004507ea7b064954f22fae9f9055a367b38e0d5532a53056ac02b6014df53e23";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/bench/fem/speedup/cpp/Poisson.ufl b/bench/fem/speedup/cpp/Poisson.ufl
new file mode 100644
index 0000000..44e4af0
--- /dev/null
+++ b/bench/fem/speedup/cpp/Poisson.ufl
@@ -0,0 +1,31 @@
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-09-15
+# Last changed: 2009-09-15
+#
+# The bilinear form a(v, u) and linear form L(v) for
+# Poisson's equation.
+
+element = FiniteElement("Lagrange", tetrahedron, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+f = Coefficient(element)
+
+a = inner(grad(v), grad(u))*dx
+L = v*f*dx
diff --git a/bench/fem/speedup/cpp/README b/bench/fem/speedup/cpp/README
new file mode 100644
index 0000000..713dbc5
--- /dev/null
+++ b/bench/fem/speedup/cpp/README
@@ -0,0 +1,16 @@
+This benchmark tests parallel speedup for assembly and solve.
+It is organized as follows:
+
+  assemble-poisson: simple program for assembling Poisson matrix
+  solve-poisson:    simple program for solving Poisson's equation
+
+  submit-bench:     script for submitting jobs using dolfin_utils.pjobs
+  analyse-bench:    script for analysing output from submit-bench
+
+  bench:            script used on benchbot for simple checking of speedup
+
+Possible future improvements:
+
+ 1. MUMPS vs UMFPACK gives skewed results (MUMPS faster?)
+ 2. Time assemble_cells and apply separately
+ 3. Use barriers between timings
diff --git a/bench/fem/speedup/cpp/analyse-bench b/bench/fem/speedup/cpp/analyse-bench
new file mode 100755
index 0000000..faf6bcc
--- /dev/null
+++ b/bench/fem/speedup/cpp/analyse-bench
@@ -0,0 +1,90 @@
+#!/usr/bin/env python
+
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johan Hake, 2009.
+#
+# First added:  2009-09-15
+# Last changed: 2011-01-04
+
+# FIXME: Not checked if working!
+
+from dolfin import *
+from glob import glob
+from numpy import arange
+
+# Size of mesh
+size = 128
+
+# Number of processes to use
+# NOTE: Largest number of processors to run is 2^EXP
+EXP = 6
+num_processes = list(2**arange(EXP+1))
+
+# Function for extracting log file
+def get_filename(pattern):
+    filenames = glob(pattern)
+    if len(filenames) == 0:
+        raise IOError, "Unable to open file: %s" % pattern
+    elif len(filenames) > 1:
+        raise RuntimeError, "More than one data file, don't know which one to pick: " + ", ".join(filenames)
+    filename = filenames[0]
+    print "Reading data from %s..." % filename
+    return filename
+
+# Iterate over process range
+assemble_time = []
+assemble_second_time = []
+solve_time = []
+
+# Remove run with one processor
+if 1 in num_processes:
+    num_processes.remove(1)
+
+for np in num_processes:
+
+    # Read timings for assemble benchmark
+    lines = open(get_filename(\
+        "assemble-poisson_np_%d_size_%d.log*" % (np, size))).readlines()
+    assemble_time.append(float([line for line in lines \
+                                if "TIME (first assembly):" in \
+                                line][0].split("TIME (first assembly): ")[-1]))
+
+    assemble_second_time.append(float([line for line in lines \
+                                       if "TIME (second assembly):" in \
+                                       line][0].split("TIME (second assembly): ")[-1]))
+
+    # Read timings for solve benchmark
+    filename = get_filename("solve-poisson_np_%d_size_%d.log*" % (np, size))
+    solve_time.append(float([line for line in open(filename).readlines()\
+                             if "TIME:" in line][0].split("TIME: ")[-1]))
+
+# Compute speedups
+scale_assemble = [assemble_time[0] / t for t in assemble_time]
+scale_second_assemble = [assemble_second_time[0] / t for t in assemble_second_time]
+scale_solve = [solve_time[0] / t for t in solve_time]
+
+# Print results
+table = Table("Speedup")
+for i, np in enumerate(num_processes):
+    table.set(str(np), "Assemble (first)", scale_assemble[i])
+    table.set(str(np), "Assemble (second)", scale_second_assemble[i])
+    table.set(str(np), "Solve", scale_solve[i])
+
+print ""
+info(table, True)
diff --git a/bench/fem/speedup/cpp/assemble-poisson.cpp b/bench/fem/speedup/cpp/assemble-poisson.cpp
new file mode 100644
index 0000000..77deeb8
--- /dev/null
+++ b/bench/fem/speedup/cpp/assemble-poisson.cpp
@@ -0,0 +1,72 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-15
+// Last changed: 2012-12-12
+//
+// Simple Poisson assembler
+
+#include <cstdlib>
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+int main(int argc, char* argv[])
+{
+  // Parse command-line arguments
+  if (argc != 2)
+  {
+    info("Usage: solve-poisson n");
+    return 1;
+  }
+  int n = atoi(argv[1]);
+
+  // Create mesh and function space
+  UnitCubeMesh mesh(n, n, n);
+  Poisson::FunctionSpace V(mesh);
+
+  const MPI_Comm comm = mesh.mpi_comm();
+
+  // Assemble matrix
+  Poisson::BilinearForm a(V, V);
+  Matrix A;
+  dolfin::MPI::barrier(comm);
+  double t = time();
+  Assembler assembler;
+  assembler.assemble(A, a);
+  dolfin::MPI::barrier(comm);
+  t = time() - t;
+
+  // Report timing
+  if (dolfin::MPI::rank(comm) == 0)
+    info("TIME (first assembly): %.5g", t);
+
+  // Re-assemble matrix
+  dolfin::MPI::barrier(comm);
+  t = time();
+  assembler.reset_sparsity = false;
+  assembler.assemble(A, a);
+  dolfin::MPI::barrier(comm);
+  t = time() - t;
+
+  // Report timing
+  if (dolfin::MPI::rank(comm) == 0)
+    info("TIME (second assembly): %.5g", t);
+
+  return 0;
+}
diff --git a/bench/fem/speedup/cpp/bench_fem_speedup_cpp b/bench/fem/speedup/cpp/bench_fem_speedup_cpp
new file mode 100755
index 0000000..c695fce
--- /dev/null
+++ b/bench/fem/speedup/cpp/bench_fem_speedup_cpp
@@ -0,0 +1,73 @@
+#!/usr/bin/env python
+
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Garth N. Wells, 2011.
+# Modified by Johannes Ring, 2011.
+#
+# First added:  2010-05-03
+# Last changed: 2011-04-05
+
+import commands
+
+# Parameters for benchmark
+SIZE = 64
+NUM_PROCS = 4
+
+print "Assembly/solve speedup running on %s processors" % NUM_PROCS
+
+# Function for extracting test name and time from benchmark
+def get_time(output):
+    lines = [line for line in output.split("\n") if "TIME" in line]
+    timing = []
+    for line in lines:
+        time = float(line.split(":")[-1])
+        name = line.split(":")[-2].strip("TIME").strip(None).replace("(", "").replace(")", "")
+        timing.append( (name, time) )
+    return timing
+
+# Serial assembly
+output = commands.getoutput("./bench_assemble-poisson %d" % SIZE)
+assembly_t1 = get_time(output)
+print "Serial assembly:", assembly_t1
+
+# Parallel assembly
+output = commands.getoutput("mpirun -n %d ./bench_assemble-poisson %d" % (NUM_PROCS, SIZE))
+assembly_t2 = get_time(output)
+print "Parallel assembly:", assembly_t2
+
+# Serial solve
+output = commands.getoutput("./bench_solve-poisson %d" % SIZE)
+solve_t1 = get_time(output)
+print "Serial solve:", solve_t1
+
+# Parallel solve
+output = commands.getoutput("mpirun -n %d ./bench_solve-poisson %d" % (NUM_PROCS, SIZE))
+solve_t2 = get_time(output)
+print "Parallel solve:", solve_t2
+
+print "assembly"
+for test1, test2  in zip(assembly_t1, assembly_t2):
+    print "  ", test1[0] + ":", test1[1]/test2[1]
+
+print "solve"
+for test1, test2  in zip(solve_t1, solve_t2):
+    print "  ", test1[0] + ":", test1[1]/test2[1]
+
+print "BENCH assembly", assembly_t1[0][1] / assembly_t2[0][1] + assembly_t1[1][1] / assembly_t2[1][1]
+print "BENCH solve", solve_t1[0][1] / solve_t2[0][1]
diff --git a/bench/fem/speedup/cpp/clean.sh b/bench/fem/speedup/cpp/clean.sh
new file mode 100755
index 0000000..2fc94dc
--- /dev/null
+++ b/bench/fem/speedup/cpp/clean.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+# Clean out old log files
+
+rm -f assemble-poisson*.log*
+rm -f solve-poisson*.log*
diff --git a/bench/fem/speedup/cpp/compile.log b/bench/fem/speedup/cpp/compile.log
new file mode 100644
index 0000000..2919ac1
--- /dev/null
+++ b/bench/fem/speedup/cpp/compile.log
@@ -0,0 +1,202 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0244801 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.000761 seconds
+  Shape of reference tensor: (4, 4, 3, 3)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  16 entries computed in 0.000677 seconds
+  Shape of reference tensor: (4, 4)
+  Primary multi index:   rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Secondary multi index: rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00854492 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000269175 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.077059 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000674009 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000755072 seconds.
+
+FFC finished in 0.112148 seconds.
diff --git a/bench/fem/speedup/cpp/solve-poisson.cpp b/bench/fem/speedup/cpp/solve-poisson.cpp
new file mode 100644
index 0000000..a990063
--- /dev/null
+++ b/bench/fem/speedup/cpp/solve-poisson.cpp
@@ -0,0 +1,119 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-15
+// Last changed: 2012-12-12
+//
+// Simple Poisson solver
+
+#include <cstdlib>
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+int main(int argc, char* argv[])
+{
+
+  #ifdef HAS_PETSC
+
+  //parameters["mesh_partitioner"] = "SCOTCH";
+  //parameters["linear_algebra_backend"] = "Epetra";
+  parameters["linear_algebra_backend"] = "PETSc";
+
+  // Parse command-line arguments
+  if (argc != 2)
+  {
+    info("Usage: solve-poisson n");
+    return 1;
+  }
+  int n = atoi(argv[1]);
+
+  // Create mesh and function space
+  UnitCubeMesh mesh(n, n, n);
+  Poisson::FunctionSpace V(mesh);
+
+  // MPI communicator
+  const MPI_Comm comm = mesh.mpi_comm();
+
+  // Define boundary condition
+  Constant u0(0.0);
+  DomainBoundary boundary;
+  DirichletBC bc(V, u0, boundary);
+
+  // Define variational problem
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  Constant f(1.0);
+  L.f = f;
+  Function u(V);
+
+  // Create preconditioner and linear solver
+  //TrilinosPreconditioner pc("amg_ml");
+  //EpetraKrylovSolver solver("gmres", pc);
+  //PETScPreconditioner pc("amg_hypre");
+  //PETScPreconditioner pc("amg_ml");
+  //PETScKrylovSolver solver("gmres", pc);
+
+  PETScLUSolver solver;
+
+  // Assemble matrix and vector, and apply Dirichlet boundary conditions
+  Matrix A;
+  Vector b;
+  assemble(A, a);
+  assemble(b, L);
+  bc.apply(A, b);
+
+  // Solve linear system
+  dolfin::MPI::barrier(comm);
+  double t = time();
+  solver.solve(A, *u.vector(), b);
+  dolfin::MPI::barrier(comm);
+  t = time() - t;
+  if (dolfin::MPI::rank(comm) == 0)
+    info("TIME (first time): %.5g", t);
+
+  // Solve linear system (preconditioner assuming same non-zero pattern)
+  if (solver.parameters.has_key("preconditioner"))
+      solver.parameters("preconditioner")["same_nonzero_pattern"] = true;
+  u.vector()->zero();
+  dolfin::MPI::barrier(comm);
+  t = time();
+  solver.solve(A, *u.vector(), b);
+  dolfin::MPI::barrier(comm);
+  t = time() - t;
+  if (dolfin::MPI::rank(comm) == 0)
+    info("TIME (same nonzero pattern): %.5g", t);
+
+  // Solve linear system (re-use preconditioner)
+  if (solver.parameters.has_key("preconditioner"))
+    solver.parameters("preconditioner")["reuse"] = true;
+  u.vector()->zero();
+  dolfin::MPI::barrier(comm);
+  t = time();
+  solver.solve(A, *u.vector(), b);
+  dolfin::MPI::barrier(comm);
+  t = time() - t;
+  if (dolfin::MPI::rank(comm) == 0)
+    info("TIME (re-use preconditioner): %.5g", t);
+
+  #else
+  error("This benchmark requires PETSc.");
+  #endif
+
+  return 0;
+}
diff --git a/bench/fem/speedup/cpp/submit-bench b/bench/fem/speedup/cpp/submit-bench
new file mode 100755
index 0000000..1a243e7
--- /dev/null
+++ b/bench/fem/speedup/cpp/submit-bench
@@ -0,0 +1,62 @@
+#!/usr/bin/env python
+#
+# This script submits jobs for measuring parallel speedup.
+#
+# Copyright (C) 2009 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2009.
+#
+# First added:  2009-09-15
+# Last changed: 2011-01-04
+
+from dolfin_utils.pjobs import submit
+from numpy import arange
+import sys
+
+# Parameters for benchmark
+SIZE = 128
+
+# Number of processes to use
+# NOTE: Largest number of processors to run is 2^EXP
+EXP = 6
+num_processes = list(2**arange(EXP+1))
+
+# Check command-line arguments
+dryrun = True if 'dryrun' in sys.argv else False
+
+# Iterate over process range
+for np in num_processes:
+
+    if np == 1:
+        run_cmd = ""
+    else:
+        run_cmd = "mpirun.openmpi -n %d " % np
+
+    # Submit assemble benchmark
+    submit("%s./assemble-poisson %d" % (run_cmd, SIZE),
+           nodes=max(1, np/8),
+           ppn=8, # Grab all cores on a node
+           name="assemble-poisson_np_%d_size_%d.log" % (np, SIZE),
+           dryrun=dryrun)
+
+    # Submit solve benchmark
+    submit("%s./solve-poisson %d" % (run_cmd, SIZE),
+           nodes=max(1, np/8),
+           ppn=8, # Grab all cores on a node
+           name="solve-poisson_np_%d_size_%d.log" % (np, SIZE),
+           dryrun=dryrun)
diff --git a/bench/function/evaluation/cpp/CMakeLists.txt b/bench/function/evaluation/cpp/CMakeLists.txt
new file mode 100644
index 0000000..8997337
--- /dev/null
+++ b/bench/function/evaluation/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_function_evaluation_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/function/evaluation/cpp/P1.h b/bench/function/evaluation/cpp/P1.h
new file mode 100644
index 0000000..66e37ae
--- /dev/null
+++ b/bench/function/evaluation/cpp/P1.h
@@ -0,0 +1,1624 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __P1_H
+#define __P1_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class p1_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  p1_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new p1_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class p1_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  p1_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new p1_dofmap_0();
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace P1
+{
+
+class FunctionSpace: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  FunctionSpace(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~FunctionSpace()
+  {
+  }
+
+};
+
+}
+
+#endif
diff --git a/bench/function/evaluation/cpp/P1.ufl b/bench/function/evaluation/cpp/P1.ufl
new file mode 100644
index 0000000..602a800
--- /dev/null
+++ b/bench/function/evaluation/cpp/P1.ufl
@@ -0,0 +1,27 @@
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-06-18
+# Last changed: 
+#
+# The bilinear form a(v, u) and linear form L(v) for
+# projection onto piecewise quadratics.
+#
+# Compile this form with FFC: ffc -l dolfin P1.ufl
+
+element = FiniteElement("Lagrange", tetrahedron, 1)
+
diff --git a/bench/function/evaluation/cpp/compile.log b/bench/function/evaluation/cpp/compile.log
new file mode 100644
index 0000000..4390fdb
--- /dev/null
+++ b/bench/function/evaluation/cpp/compile.log
@@ -0,0 +1,128 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling element P1
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+Compiler stage 1 finished in 0.000202179 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0113971 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  
+Compiler stage 3 finished in 0.000154972 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.109452 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000328064 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./P1.h.
+  
+Compiler stage 5 finished in 0.000749111 seconds.
+
+FFC finished in 0.122674 seconds.
diff --git a/bench/function/evaluation/cpp/main.cpp b/bench/function/evaluation/cpp/main.cpp
new file mode 100644
index 0000000..a474eac
--- /dev/null
+++ b/bench/function/evaluation/cpp/main.cpp
@@ -0,0 +1,92 @@
+// Copyright (C) 2010 Andre Massing
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-06-10
+// Last changed: 2012-12-12
+//
+// Description: Benchmark for the evaluations of functions at arbitrary points.
+
+#include <dolfin.h>
+#include "P1.h"
+
+using namespace dolfin;
+
+class F : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2]);
+  }
+
+};
+
+#ifdef HAS_CGAL
+
+int main(int argc, char* argv[])
+{
+  not_working_in_parallel("Function evalutation benchmark");
+
+  info("Evaluations of functions at arbitrary points.");
+
+  const std::size_t mesh_max_size = 32;
+  const std::size_t num_points  = 10000000;
+
+  // Start timing
+  tic();
+  for (std::size_t N = 10; N < mesh_max_size; N += 2)
+  {
+    UnitCubeMesh mesh(N, N, N);
+
+    P1::FunctionSpace V0(mesh);
+    Function f0(V0);
+    F f;
+    f0.interpolate(f);
+
+    Array<double> X(3);
+    Array<double> value(1);
+
+    // Initialize random generator generator (produces same sequence each test).
+    srand(1);
+
+    for (std::size_t i = 1; i <= num_points; ++i)
+    {
+      X[0] = std::rand()/static_cast<double>(RAND_MAX);
+      X[1] = std::rand()/static_cast<double>(RAND_MAX);
+      X[2] = std::rand()/static_cast<double>(RAND_MAX);
+
+      f.eval(value, X);
+    }
+
+    // Use X variable.
+    info("x = %.12e\ty = %.12e\tz = %.12e\tf(x) = %.12e", X[0], X[1], X[2], value[0]);
+  }
+  info("BENCH  %g",toc());
+
+  return 0;
+}
+
+#else
+
+int main()
+{
+  info("DOLFIN must be compiled with CGAL to run function eval benchmark.");
+  return 0;
+}
+
+#endif
diff --git a/bench/function/extrapolation/python/bench_function_extrapolation_python b/bench/function/extrapolation/python/bench_function_extrapolation_python
new file mode 100755
index 0000000..5414f12
--- /dev/null
+++ b/bench/function/extrapolation/python/bench_function_extrapolation_python
@@ -0,0 +1,43 @@
+#!/usr/bin/env python
+
+"""This script provides a benchmark for Extrapolation"""
+
+# Copyright (C) 2010 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-06-07
+# Last changed: 2013-06-17
+
+from dolfin import *
+from time import time
+
+SIZE = 4
+mesh = UnitCubeMesh(SIZE, SIZE, SIZE)
+
+V = VectorFunctionSpace(mesh, "CG", 2) * FunctionSpace(mesh, "DG", 1)
+W = VectorFunctionSpace(mesh, "CG", 3) * FunctionSpace(mesh, "DG", 2)
+
+u = Expression(("sin(x[0])", "1.0", "x[0]*x[1]", "0.0"), degree=3)
+u = interpolate(u, V)
+
+w = Function(W)
+
+tic = time()
+w.extrapolate(u)
+t = time() - tic
+
+print "BENCH: ", t
diff --git a/bench/function/interpolation/python/bench_function_interpolation_python b/bench/function/interpolation/python/bench_function_interpolation_python
new file mode 100755
index 0000000..4fdb13a
--- /dev/null
+++ b/bench/function/interpolation/python/bench_function_interpolation_python
@@ -0,0 +1,52 @@
+#!/usr/bin/env python
+
+"""This script provides a benchmark for interpolation between meshes"""
+
+# Copyright (C) 2013 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-06-17
+# Last changed: 2013-06-21
+
+from dolfin import *
+from time import time
+
+# FIXME: Temporary testing
+import sys
+if len(sys.argv) == 2 and sys.argv[1] == "DOLFIN":
+    parameters["use_cgal_intersection"] = False
+
+SIZE_0 = 21 #71
+SIZE_1 = 23 #73
+
+parameters["allow_extrapolation"] = True
+
+mesh_0 = UnitCubeMesh(SIZE_0, SIZE_0, SIZE_0)
+mesh_1 = UnitCubeMesh(SIZE_1, SIZE_1, SIZE_1)
+
+V0 = FunctionSpace(mesh_0, "CG", 1)
+V1 = FunctionSpace(mesh_1, "CG", 1)
+
+v0 = interpolate(Expression("sin(5*x[0])*cos(7*x[1])"), V0)
+
+tic = time()
+v1 = interpolate(v0, V1)
+t = time() - tic
+
+plot(v1, interactive=True)
+
+print "BENCH: ", t
diff --git a/bench/geometry/bounding_box_tree_build/cpp/CMakeLists.txt b/bench/geometry/bounding_box_tree_build/cpp/CMakeLists.txt
new file mode 100644
index 0000000..4f7714c
--- /dev/null
+++ b/bench/geometry/bounding_box_tree_build/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_geometry_bounding_box_tree_build_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/geometry/bounding_box_tree_build/cpp/main.cpp b/bench/geometry/bounding_box_tree_build/cpp/main.cpp
new file mode 100644
index 0000000..7334155
--- /dev/null
+++ b/bench/geometry/bounding_box_tree_build/cpp/main.cpp
@@ -0,0 +1,43 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// This benchmark measures the performance of building a BoundingBoxTree (and
+// one call to compute_entities, which is dominated by building).
+//
+// First added:  2013-04-18
+// Last changed: 2013-06-25
+
+#include <vector>
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define SIZE 128
+
+int main(int argc, char* argv[])
+{
+  // Create mesh
+  UnitCubeMesh mesh(SIZE, SIZE, SIZE);
+
+  // Create and build tree
+  tic();
+  BoundingBoxTree tree;
+  tree.build(mesh);
+  info("BENCH %g", toc());
+
+  return 0;
+}
diff --git a/bench/geometry/bounding_box_tree_compute_closest_entity/cpp/CMakeLists.txt b/bench/geometry/bounding_box_tree_compute_closest_entity/cpp/CMakeLists.txt
new file mode 100644
index 0000000..2180546
--- /dev/null
+++ b/bench/geometry/bounding_box_tree_compute_closest_entity/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_geometry_bounding_box_tree_compute_closest_entity_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/geometry/bounding_box_tree_compute_closest_entity/cpp/main.cpp b/bench/geometry/bounding_box_tree_compute_closest_entity/cpp/main.cpp
new file mode 100644
index 0000000..446db83
--- /dev/null
+++ b/bench/geometry/bounding_box_tree_compute_closest_entity/cpp/main.cpp
@@ -0,0 +1,56 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// This benchmark measures the performance of compute_entity_collisions.
+//
+// First added:  2013-05-23
+// Last changed: 2013-09-04
+
+#include <vector>
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 1000000
+#define SIZE 64
+
+int main(int argc, char* argv[])
+{
+  // Create mesh
+  UnitCubeMesh mesh(SIZE, SIZE, SIZE);
+
+  // First call
+  BoundingBoxTree tree;
+  tree.build(mesh);
+  Point point(-1.0, -1.0, 0.0);
+  tree.compute_closest_entity(point);
+  cout << "Built tree, searching for closest point" << endl;
+
+  // Call repeatedly
+  tic();
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    tree.compute_closest_entity(point);
+    point.coordinates()[1] += 2.0 / static_cast<double>(NUM_REPS);
+  }
+  const double t = toc();
+
+  // Report result
+  info("BENCH %g", t);
+
+  return 0;
+}
diff --git a/bench/geometry/bounding_box_tree_compute_entity_collisions/cpp/CMakeLists.txt b/bench/geometry/bounding_box_tree_compute_entity_collisions/cpp/CMakeLists.txt
new file mode 100644
index 0000000..088fce8
--- /dev/null
+++ b/bench/geometry/bounding_box_tree_compute_entity_collisions/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_geometry_bounding_box_tree_compute_entity_collisions_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/geometry/bounding_box_tree_compute_entity_collisions/cpp/main.cpp b/bench/geometry/bounding_box_tree_compute_entity_collisions/cpp/main.cpp
new file mode 100644
index 0000000..3f17b14
--- /dev/null
+++ b/bench/geometry/bounding_box_tree_compute_entity_collisions/cpp/main.cpp
@@ -0,0 +1,57 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// This benchmark measures the performance of compute_entity_collisions.
+//
+// First added:  2013-05-23
+// Last changed: 2013-09-04
+
+#include <vector>
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 5000000
+#define SIZE 64
+
+int main(int argc, char* argv[])
+{
+  // Create mesh
+  UnitCubeMesh mesh(SIZE, SIZE, SIZE);
+
+  // First call
+  BoundingBoxTree tree;
+  tree.build(mesh);
+  Point point(0.0, 0.0, 0.0);
+  tree.compute_entity_collisions(point);
+
+  // Call repeatedly
+  tic();
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    point.coordinates()[0] += 1.0 / static_cast<double>(NUM_REPS);
+    point.coordinates()[1] += 1.0 / static_cast<double>(NUM_REPS);
+    point.coordinates()[2] += 1.0 / static_cast<double>(NUM_REPS);
+    std::vector<unsigned int> entities = tree.compute_entity_collisions(point);
+  }
+  const double t = toc();
+
+  // Report result
+  info("BENCH %g", t);
+
+  return 0;
+}
diff --git a/bench/la/cusp/python/bench_la_cusp_python b/bench/la/cusp/python/bench_la_cusp_python
new file mode 100755
index 0000000..12e739b
--- /dev/null
+++ b/bench/la/cusp/python/bench_la_cusp_python
@@ -0,0 +1,90 @@
+#!/usr/bin/env python
+
+# Copyright (C) 2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-03-09
+# Last changed: 2012-04-25
+
+from dolfin import *
+from time import time
+
+SIZE = 32
+NUM_REPS = 3
+
+print "Solving the linear system for Poisson's equation using PETSc CUSP"
+
+# Check that we have the PETSc Cusp backend
+if not has_linear_algebra_backend("PETScCusp"):
+    print "Cannot run this benchmark since PETSc Cusp is not available."
+    print "BENCH: 0.0"
+    exit(0)
+
+# Function for running test
+def run_bench(linear_algebra_backend):
+
+    info("")
+    info("Linear algebra backend: %s" % linear_algebra_backend)
+
+    # Set linear algebra backend
+    parameters["linear_algebra_backend"] = linear_algebra_backend
+
+    # Create matrix and vector
+    print "Assembling matrix and vector"
+    mesh = UnitCube(SIZE, SIZE, SIZE)
+    V = FunctionSpace(mesh, "Lagrange", 1)
+    u = TrialFunction(V)
+    v = TestFunction(V)
+    f = Constant(1.0)
+    a = dot(grad(u), grad(v))*dx
+    L = f*v*dx
+    bc = DirichletBC(V, 0.0, DomainBoundary())
+    A, b = assemble_system(a, L, bc)
+
+    # Create linear solver
+    solver = KrylovSolver("cg", "jacobi")
+
+    # Use hack to get around PETSc Cusp bug
+    solver.parameters["use_petsc_cusp_hack"] = True
+
+    # Solve linear system
+    info("Solving linear system %d times" % NUM_REPS)
+    x = Vector()
+    cpu_time = time()
+    for i in range(NUM_REPS):
+        x.zero()
+        solver.solve(A, x, b)
+        print "residual =", residual(A, x, b)
+    cpu_time = (time() - cpu_time) / float(NUM_REPS)
+
+    return cpu_time
+
+# Run benchmarks
+cpu_time_petsc_cusp = run_bench("PETScCusp")
+cpu_time_petsc      = run_bench("PETSc")
+
+# Compute speedup
+speedup = cpu_time_petsc / cpu_time_petsc_cusp
+
+# Report results
+print
+print "PETSc:     ", cpu_time_petsc
+print "PETSc Cusp:", cpu_time_petsc_cusp
+print "Speedup:   ", speedup
+print
+
+print "BENCH: ", speedup
diff --git a/bench/la/vector/access/cpp/CMakeLists.txt b/bench/la/vector/access/cpp/CMakeLists.txt
new file mode 100644
index 0000000..aa3cbee
--- /dev/null
+++ b/bench/la/vector/access/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_la_vector_access_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/la/vector/access/cpp/main.cpp b/bench/la/vector/access/cpp/main.cpp
new file mode 100644
index 0000000..4f71586
--- /dev/null
+++ b/bench/la/vector/access/cpp/main.cpp
@@ -0,0 +1,47 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010.
+//
+// First added:  2010-03-30
+// Last changed: 2010-05-03
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define SIZE 10000000
+#define NUM_REPS 100
+
+int main(int argc, char* argv[])
+{
+  info("Accessing vector of size %d (%d repetitions)",
+       SIZE, NUM_REPS);
+
+  parameters.parse(argc, argv);
+
+  Vector x(MPI_COMM_WORLD, SIZE);
+  x.zero();
+
+  double sum = 0.0;
+  for (unsigned int i = 0; i < NUM_REPS; i++)
+    for (unsigned int j = 0; j < SIZE; j++)
+      sum += x[j];
+  dolfin::cout << "Sum is " << sum << dolfin::endl;
+
+  return 0;
+}
diff --git a/bench/la/vector/assignment/cpp/CMakeLists.txt b/bench/la/vector/assignment/cpp/CMakeLists.txt
new file mode 100644
index 0000000..09b67a2
--- /dev/null
+++ b/bench/la/vector/assignment/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_la_vector_assignment_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/la/vector/assignment/cpp/main.cpp b/bench/la/vector/assignment/cpp/main.cpp
new file mode 100644
index 0000000..f316ee5
--- /dev/null
+++ b/bench/la/vector/assignment/cpp/main.cpp
@@ -0,0 +1,44 @@
+// Copyright (C) 2006 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010.
+//
+// First added:  2006-08-18
+// Last changed: 2010-05-03
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 100
+#define SIZE 10000000
+
+int main(int argc, char* argv[])
+{
+  info("Assigning to vector of size %d (%d repetitions)",
+       SIZE, NUM_REPS);
+
+  parameters.parse(argc, argv);
+
+  Vector x(MPI_COMM_WORLD, SIZE);
+
+  for (unsigned int i = 0; i < NUM_REPS; i++)
+    for (unsigned int j = 0; j < SIZE; j++)
+      x.setitem(j, 1.0);
+
+  return 0;
+}
diff --git a/bench/logs/bench.log b/bench/logs/bench.log
new file mode 100644
index 0000000..16d86ce
--- /dev/null
+++ b/bench/logs/bench.log
@@ -0,0 +1,151 @@
+(2008, 4, 30, 14, 12, 50) la-vector-access-cpp 15.8298 "Accessing vector of size 10000000 (100 repetitions)"
+(2008, 4, 30, 14, 13, 9) la-vector-assignment-cpp 18.8627 "Assigning to vector of size 10000000 (100 repetitions)"
+(2008, 4, 30, 14, 13, 16) fem-jit-python 0.555803 "JIT compilation (in memory cache)"
+(2008, 4, 30, 14, 13, 28) fem-convergence-cpp 11.4321 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2008, 4, 30, 14, 13, 34) mesh-unitcube-cpp 6.08171 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2008, 4, 30, 14, 14, 50) mesh-refinement-cpp 75.8 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2008, 4, 30, 14, 15, 5) mesh-iteration-cpp 14.4 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2008, 6, 23, 14, 18, 43) la-vector-access-cpp 15.0198 "Accessing vector of size 10000000 (100 repetitions)"
+(2008, 6, 23, 14, 19, 4) la-vector-assignment-cpp 20.8082 "Assigning to vector of size 10000000 (100 repetitions)"
+(2008, 6, 23, 14, 19, 5) fem-jit-python 5.6982e-06 "JIT compilation (in memory cache)"
+(2008, 6, 23, 14, 19, 20) fem-convergence-cpp 14.7388 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2008, 6, 23, 14, 21, 44) fem-assembly-cpp 143.513 "Assembly for various forms and backends"
+(2008, 6, 23, 14, 21, 49) mesh-unitcube-cpp 5.86431 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2008, 6, 23, 14, 23, 5) mesh-refinement-cpp 75.54 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2008, 6, 23, 14, 23, 20) mesh-iteration-cpp 14.43 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2008, 10, 20, 14, 31, 31) la-vector-access-cpp 14.8214 "Accessing vector of size 10000000 (100 repetitions)"
+(2008, 10, 20, 14, 31, 52) la-vector-assignment-cpp 20.3453 "Assigning to vector of size 10000000 (100 repetitions)"
+(2008, 10, 20, 14, 31, 57) fem-jit-python 9.65118e-05 "JIT compilation (in memory cache)"
+(2008, 10, 20, 14, 32, 8) fem-convergence-cpp 11.3695 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2008, 10, 20, 14, 36, 28) fem-assembly-cpp 259.766 "Assembly for various forms and backends"
+(2008, 10, 20, 14, 36, 34) mesh-unitcube-cpp 6.17667 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2008, 10, 20, 14, 37, 50) mesh-refinement-cpp 75.76 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2008, 10, 20, 14, 38, 5) mesh-iteration-cpp 13.98 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2009, 1, 5, 14, 40, 18) la-vector-access-cpp 15.5729 "Accessing vector of size 10000000 (100 repetitions)"
+(2009, 1, 5, 14, 40, 37) la-vector-assignment-cpp 19.2912 "Assigning to vector of size 10000000 (100 repetitions)"
+(2009, 1, 5, 14, 40, 42) fem-jit-python 9.86099e-05 "JIT compilation (in memory cache)"
+(2009, 1, 5, 14, 40, 53) fem-convergence-cpp 11.4639 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2009, 1, 5, 14, 45, 15) fem-assembly-cpp 261.595 "Assembly for various forms and backends"
+(2009, 1, 5, 14, 45, 52) mesh-unitcube-cpp 37.4356 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2009, 1, 5, 14, 47, 14) mesh-refinement-cpp 81.26 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2009, 1, 5, 14, 47, 32) mesh-iteration-cpp 13.98 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2009, 2, 17, 14, 50, 21) la-vector-access-cpp 14.8237 "Accessing vector of size 10000000 (100 repetitions)"
+(2009, 2, 17, 14, 50, 41) la-vector-assignment-cpp 20.2998 "Assigning to vector of size 10000000 (100 repetitions)"
+(2009, 2, 17, 14, 50, 46) fem-jit-python 0.00846782 "JIT compilation (in memory cache)"
+(2009, 2, 17, 14, 50, 57) fem-convergence-cpp 11.3066 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2009, 2, 17, 14, 55, 21) fem-assembly-cpp 263.869 "Assembly for various forms and backends"
+(2009, 2, 17, 14, 55, 59) mesh-unitcube-cpp 38.0645 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2009, 2, 17, 14, 57, 22) mesh-refinement-cpp 82.32 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2009, 2, 17, 14, 57, 40) mesh-iteration-cpp 13.98 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2009, 4, 7, 15, 0, 43) la-vector-access-cpp 15.8316 "Accessing vector of size 10000000 (100 repetitions)"
+(2009, 4, 7, 15, 1, 2) la-vector-assignment-cpp 19.2988 "Assigning to vector of size 10000000 (100 repetitions)"
+(2009, 4, 7, 15, 1, 7) fem-jit-python 0.00636039 "JIT compilation (in memory cache)"
+(2009, 4, 7, 15, 1, 42) fem-convergence-cpp 35.5486 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2009, 4, 7, 15, 11, 21) fem-assembly-cpp 579.254 "Assembly for various forms and backends"
+(2009, 4, 7, 15, 12, 0) mesh-unitcube-cpp 38.1176 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2009, 4, 7, 15, 13, 22) mesh-refinement-cpp 82.04 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2009, 4, 7, 15, 13, 40) mesh-iteration-cpp 13.97 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2009, 9, 26, 11, 43, 12) la-vector-access-cpp 46.0397 "Accessing vector of size 10000000 (100 repetitions)"
+(2009, 9, 26, 11, 43, 35) la-vector-assignment-cpp 22.3038 "Assigning to vector of size 10000000 (100 repetitions)"
+(2009, 9, 26, 11, 43, 38) fem-jit-python 0.00593891 "JIT compilation (in memory cache)"
+(2009, 9, 26, 11, 50, 46) fem-speedup-cpp 427.872 "Assembly/solve speedup running on 4 processors"
+(2009, 9, 26, 11, 50, 46) fem-speedup-cpp-assembly 2.38776 "Assembly/solve speedup running on 4 processors (assembly)"
+(2009, 9, 26, 11, 50, 46) fem-speedup-cpp-solve 1.73264 "Assembly/solve speedup running on 4 processors (solve)"
+(2009, 9, 26, 11, 51, 15) fem-convergence-cpp 28.4034 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2009, 9, 26, 11, 58, 24) fem-assembly-cpp 428.812 "Assembly for various forms and backends"
+(2009, 9, 26, 11, 59, 4) mesh-unitcube-cpp 40.7715 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2009, 9, 26, 12, 0, 50) mesh-refinement-cpp 106.01 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2009, 9, 26, 12, 1, 31) mesh-iteration-cpp 35.84 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2009, 9, 26, 12, 1, 52) function-evaluation-cpp 21.8595 "Evaluations of functions at arbitrary points."
+(2009, 9, 26, 12, 1, 52) function-evaluation-cpp 21.74 "Evaluations of functions at arbitrary points."
+(2009, 10, 12, 13, 4, 9) la-vector-access-cpp 51.7174 "Accessing vector of size 10000000 (100 repetitions)"
+(2009, 10, 12, 13, 4, 33) la-vector-assignment-cpp 23.85 "Assigning to vector of size 10000000 (100 repetitions)"
+(2009, 10, 12, 13, 4, 37) fem-jit-python 0.0057328 "JIT compilation (in memory cache)"
+(2009, 10, 12, 13, 13, 2) fem-speedup-cpp 505.45 "Assembly/solve speedup running on 4 processors"
+(2009, 10, 12, 13, 13, 2) fem-speedup-cpp-assembly 2.48958 "Assembly/solve speedup running on 4 processors (assembly)"
+(2009, 10, 12, 13, 13, 2) fem-speedup-cpp-solve 2.27064 "Assembly/solve speedup running on 4 processors (solve)"
+(2009, 10, 12, 13, 13, 31) fem-convergence-cpp 28.1976 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2009, 10, 12, 13, 20, 34) fem-assembly-cpp 423.846 "Assembly for various forms and backends"
+(2009, 10, 12, 13, 21, 16) mesh-unitcube-cpp 41.0422 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2009, 10, 12, 13, 23, 1) mesh-refinement-cpp 105.34 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2009, 10, 12, 13, 23, 41) mesh-iteration-cpp 36.28 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2009, 10, 12, 13, 24, 2) function-evaluation-cpp 20.9444 "Evaluations of functions at arbitrary points."
+(2009, 10, 12, 13, 24, 2) function-evaluation-cpp 20.86 "Evaluations of functions at arbitrary points."
+(2009, 12, 4, 13, 32, 55) la-vector-access-cpp 48.7269 "Accessing vector of size 10000000 (100 repetitions)"
+(2009, 12, 4, 13, 33, 17) la-vector-assignment-cpp 21.8355 "Assigning to vector of size 10000000 (100 repetitions)"
+(2009, 12, 4, 13, 33, 20) fem-jit-python 0.0060514 "JIT compilation (in memory cache)"
+(2009, 12, 4, 13, 41, 51) fem-speedup-cpp 510.404 "Assembly/solve speedup running on 4 processors"
+(2009, 12, 4, 13, 41, 51) fem-speedup-cpp-assembly 2.25234 "Assembly/solve speedup running on 4 processors (assembly)"
+(2009, 12, 4, 13, 41, 51) fem-speedup-cpp-solve 2.30526 "Assembly/solve speedup running on 4 processors (solve)"
+(2009, 12, 4, 13, 42, 19) fem-convergence-cpp 27.954 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2009, 12, 4, 13, 49, 34) fem-assembly-cpp 434.896 "Assembly for various forms and backends"
+(2009, 12, 4, 13, 50, 14) mesh-unitcube-cpp 40.4804 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2009, 12, 4, 13, 52, 3) mesh-refinement-cpp 109.09 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2009, 12, 4, 13, 52, 43) mesh-iteration-cpp 35.82 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2009, 12, 4, 13, 53, 4) function-evaluation-cpp 20.7841 "Evaluations of functions at arbitrary points."
+(2009, 12, 4, 13, 53, 4) function-evaluation-cpp 20.7 "Evaluations of functions at arbitrary points."
+(2010, 2, 3, 14, 2, 51) la-vector-access-cpp 55.332 "Accessing vector of size 10000000 (100 repetitions)"
+(2010, 2, 3, 14, 3, 13) la-vector-assignment-cpp 21.8265 "Assigning to vector of size 10000000 (100 repetitions)"
+(2010, 2, 3, 14, 3, 17) fem-jit-python 0.0240756 "JIT compilation (in memory cache)"
+(2010, 2, 3, 14, 11, 34) fem-speedup-cpp 497.496 "Assembly/solve speedup running on 4 processors"
+(2010, 2, 3, 14, 11, 34) fem-speedup-cpp-assembly 1.95726 "Assembly/solve speedup running on 4 processors (assembly)"
+(2010, 2, 3, 14, 11, 34) fem-speedup-cpp-solve 2.28999 "Assembly/solve speedup running on 4 processors (solve)"
+(2010, 2, 3, 14, 11, 49) fem-convergence-cpp 14.6188 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2010, 2, 3, 14, 19, 12) fem-assembly-cpp 442.546 "Assembly for various forms and backends"
+(2010, 2, 3, 14, 19, 53) mesh-unitcube-cpp 40.8975 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2010, 2, 3, 14, 21, 38) mesh-refinement-cpp 104.77 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2010, 2, 3, 14, 22, 17) mesh-iteration-cpp 35.36 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2010, 2, 3, 14, 22, 39) function-evaluation-cpp 22.0025 "Evaluations of functions at arbitrary points."
+(2010, 2, 3, 14, 22, 39) function-evaluation-cpp 21.89 "Evaluations of functions at arbitrary points."
+(2010, 2, 17, 14, 29, 56) la-vector-access-cpp 54.1729 "Accessing vector of size 10000000 (100 repetitions)"
+(2010, 2, 17, 14, 30, 18) la-vector-assignment-cpp 21.8163 "Assigning to vector of size 10000000 (100 repetitions)"
+(2010, 2, 17, 14, 30, 21) fem-jit-python 0.0254639 "JIT compilation (in memory cache)"
+(2010, 2, 17, 14, 37, 29) fem-speedup-cpp 427.685 "Assembly/solve speedup running on 4 processors"
+(2010, 2, 17, 14, 37, 29) fem-speedup-cpp-assembly 2.20183 "Assembly/solve speedup running on 4 processors (assembly)"
+(2010, 2, 17, 14, 37, 29) fem-speedup-cpp-solve 1.66403 "Assembly/solve speedup running on 4 processors (solve)"
+(2010, 2, 17, 14, 37, 44) fem-convergence-cpp 14.9222 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2010, 2, 17, 14, 45, 6) fem-assembly-cpp 441.941 "Assembly for various forms and backends"
+(2010, 2, 17, 14, 45, 47) mesh-unitcube-cpp 40.4403 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2010, 2, 17, 14, 47, 30) mesh-refinement-cpp 103.46 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2010, 2, 17, 14, 48, 10) mesh-iteration-cpp 35.36 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2010, 2, 17, 14, 48, 32) function-evaluation-cpp 21.7258 "Evaluations of functions at arbitrary points."
+(2010, 2, 17, 14, 48, 32) function-evaluation-cpp 21.65 "Evaluations of functions at arbitrary points."
+(2010, 6, 19, 19, 52, 6) la-vector-access-cpp 48.4456 "Accessing vector of size 10000000 (100 repetitions)"
+(2010, 6, 19, 19, 52, 29) la-vector-assignment-cpp 22.5369 "Assigning to vector of size 10000000 (100 repetitions)"
+(2010, 6, 19, 19, 52, 30) fem-jit-python 0.0248256 "JIT compilation (in memory cache)"
+(2010, 6, 19, 19, 55, 12) fem-speedup-cpp 162.58 "Assembly/solve speedup running on 4 processors"
+(2010, 6, 19, 19, 55, 12) fem-speedup-cpp-assembly 2.52128 "Assembly/solve speedup running on 4 processors (assembly)"
+(2010, 6, 19, 19, 55, 12) fem-speedup-cpp-solve 1.67775 "Assembly/solve speedup running on 4 processors (solve)"
+(2010, 6, 19, 19, 55, 25) fem-convergence-cpp 13.031 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2010, 6, 19, 19, 59, 43) fem-assembly-cpp 257.852 "Assembly for various forms and backends"
+(2010, 6, 19, 20, 0, 24) mesh-unitcube-cpp 40.8275 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2010, 6, 19, 20, 2, 9) mesh-refinement-cpp 105.19 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2010, 6, 19, 20, 2, 49) mesh-iteration-cpp 35.39 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2010, 6, 19, 20, 3, 11) function-evaluation-cpp 21.7684 "Evaluations of functions at arbitrary points."
+(2010, 6, 19, 20, 3, 11) function-evaluation-cpp 21.69 "Evaluations of functions at arbitrary points."
+(2010, 6, 20, 1, 3, 51) la-vector-access-cpp 48.4401 "Accessing vector of size 10000000 (100 repetitions)"
+(2010, 6, 20, 1, 4, 14) la-vector-assignment-cpp 23.8249 "Assigning to vector of size 10000000 (100 repetitions)"
+(2010, 6, 20, 1, 4, 16) fem-jit-python 0.024965 "JIT compilation (in memory cache)"
+(2010, 6, 20, 1, 6, 56) fem-speedup-cpp 160.021 "Assembly/solve speedup running on 4 processors"
+(2010, 6, 20, 1, 6, 56) fem-speedup-cpp-assembly 2.49474 "Assembly/solve speedup running on 4 processors (assembly)"
+(2010, 6, 20, 1, 6, 56) fem-speedup-cpp-solve 1.66284 "Assembly/solve speedup running on 4 processors (solve)"
+(2010, 6, 20, 1, 7, 8) fem-convergence-cpp 12.7508 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2010, 6, 20, 1, 11, 30) fem-assembly-cpp 261.657 "Assembly for various forms and backends"
+(2010, 6, 20, 1, 12, 11) mesh-unitcube-cpp 40.9106 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2010, 6, 20, 1, 13, 56) mesh-refinement-cpp 105.5 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2010, 6, 20, 1, 14, 36) mesh-iteration-cpp 35.35 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2010, 6, 20, 1, 14, 58) function-evaluation-cpp 21.8163 "Evaluations of functions at arbitrary points."
+(2010, 6, 20, 1, 14, 58) function-evaluation-cpp 21.74 "Evaluations of functions at arbitrary points."
+(2010, 6, 21, 1, 4, 0) la-vector-access-cpp 48.4561 "Accessing vector of size 10000000 (100 repetitions)"
+(2010, 6, 21, 1, 4, 21) la-vector-assignment-cpp 21.824 "Assigning to vector of size 10000000 (100 repetitions)"
+(2010, 6, 21, 1, 4, 25) fem-jit-python 0.0251855 "JIT compilation (in memory cache)"
+(2010, 6, 21, 1, 7, 4) fem-speedup-cpp 159.221 "Assembly/solve speedup running on 4 processors"
+(2010, 6, 21, 1, 7, 4) fem-speedup-cpp-assembly 2.52128 "Assembly/solve speedup running on 4 processors (assembly)"
+(2010, 6, 21, 1, 7, 4) fem-speedup-cpp-solve 1.70657 "Assembly/solve speedup running on 4 processors (solve)"
+(2010, 6, 21, 1, 7, 17) fem-convergence-cpp 13.4156 "Solving Poisson's equation in 2D for q = 1, n = 2."
+(2010, 6, 21, 1, 11, 39) fem-assembly-cpp 261.596 "Assembly for various forms and backends"
+(2010, 6, 21, 1, 12, 20) mesh-unitcube-cpp 40.932 "Creating unit cube of size 128 x 128 x 128 (10 repetitions)"
+(2010, 6, 21, 1, 14, 5) mesh-refinement-cpp 104.98 "Uniform refinement of unit cube of size 4 x 4 x 4 (5 refinements)"
+(2010, 6, 21, 1, 14, 44) mesh-iteration-cpp 35.36 "Iteration over entities of unit cube of size 128 x 128 x 128 (100 repetitions)"
+(2010, 6, 21, 1, 15, 6) function-evaluation-cpp 21.8412 "Evaluations of functions at arbitrary points."
+(2010, 6, 21, 1, 15, 6) function-evaluation-cpp 21.77 "Evaluations of functions at arbitrary points."
diff --git a/bench/logs/milestones.log b/bench/logs/milestones.log
new file mode 100644
index 0000000..9606f43
--- /dev/null
+++ b/bench/logs/milestones.log
@@ -0,0 +1,14 @@
+2008-02-18 DOLFIN 0.7.2 
+2008-04-30 DOLFIN 0.7.3
+2008-06-23 DOLFIN 0.8.0
+2008-10-20 DOLFIN 0.8.1 
+2009-01-05 DOLFIN 0.9.0
+2009-02-17 DOLFIN 0.9.1
+2009-04-07 DOLFIN 0.9.2
+2009-09-26 DOLFIN 0.9.3
+2009-10-12 DOLFIN 0.9.4
+2009-12-04 DOLFIN 0.9.5
+2010-02-03 DOLFIN 0.9.6
+2010-02-17 DOLFIN 0.9.7
+2010-07-01 DOLFIN 0.9.8
+2010-09-02 DOLFIN 0.9.9
diff --git a/bench/mesh/iteration/cpp/CMakeLists.txt b/bench/mesh/iteration/cpp/CMakeLists.txt
new file mode 100644
index 0000000..463d733
--- /dev/null
+++ b/bench/mesh/iteration/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_mesh_iteration_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/mesh/iteration/cpp/main.cpp b/bench/mesh/iteration/cpp/main.cpp
new file mode 100644
index 0000000..8a1ecfa
--- /dev/null
+++ b/bench/mesh/iteration/cpp/main.cpp
@@ -0,0 +1,51 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-11-01
+// Last changed: 2012-12-12
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 100
+#define SIZE 128
+
+int main(int argc, char* argv[])
+{
+  info("Iteration over entities of unit cube of size %d x %d x %d (%d repetitions)",
+       SIZE, SIZE, SIZE, NUM_REPS);
+
+  parameters.parse(argc, argv);
+
+  UnitCubeMesh mesh(SIZE, SIZE, SIZE);
+
+  int sum = 0;
+  tic();
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    for (CellIterator c(mesh); !c.end(); ++c)
+      for (VertexIterator v(*c); !v.end(); ++v)
+        sum += v->index();
+  }
+  info("BENCH %g", toc());
+
+  // To prevent optimizing the loop away
+  info("Sum is %d", sum);
+
+  return 0;
+}
diff --git a/bench/mesh/refinement/cpp/CMakeLists.txt b/bench/mesh/refinement/cpp/CMakeLists.txt
new file mode 100644
index 0000000..7ae4d20
--- /dev/null
+++ b/bench/mesh/refinement/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_mesh_refinement_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/mesh/refinement/cpp/main.cpp b/bench/mesh/refinement/cpp/main.cpp
new file mode 100644
index 0000000..e23a43a
--- /dev/null
+++ b/bench/mesh/refinement/cpp/main.cpp
@@ -0,0 +1,47 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-11-01
+// Last changed: 2012-12-12
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 5
+#define SIZE 4
+
+int main(int argc, char* argv[])
+{
+  info("Uniform refinement of unit cube of size %d x %d x %d (%d refinements)",
+       SIZE, SIZE, SIZE, NUM_REPS);
+
+  parameters.parse(argc, argv);
+
+  UnitCubeMesh unitcube_mesh(SIZE, SIZE, SIZE);
+  Mesh mesh(unitcube_mesh);
+
+  tic();
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    mesh = refine(mesh);
+    dolfin::cout << "Refined mesh: " << mesh << dolfin::endl;
+  }
+  info("BENCH %g", toc());
+
+  return 0;
+}
diff --git a/bench/mesh/topology/cpp/CMakeLists.txt b/bench/mesh/topology/cpp/CMakeLists.txt
new file mode 100644
index 0000000..d885d06
--- /dev/null
+++ b/bench/mesh/topology/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_mesh_topology_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/mesh/topology/cpp/main.cpp b/bench/mesh/topology/cpp/main.cpp
new file mode 100644
index 0000000..8fcb121
--- /dev/null
+++ b/bench/mesh/topology/cpp/main.cpp
@@ -0,0 +1,55 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-11-25
+// Last changed: 2012-12-12
+
+#include <dolfin.h>
+#include <dolfin/log/LogLevel.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 5
+#define SIZE 64
+
+// Use for quick testing
+//#define NUM_REPS 2
+//#define SIZE 32
+
+int main(int argc, char* argv[])
+{
+  info("Creating cell-cell connectivity for unit cube of size %d x %d x %d (%d repetitions)",
+       SIZE, SIZE, SIZE, NUM_REPS);
+
+  set_log_level(DBG);
+
+  parameters.parse(argc, argv);
+
+  UnitCubeMesh mesh(SIZE, SIZE, SIZE);
+  const int D = mesh.topology().dim();
+
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    mesh.clean();
+    mesh.init(D, D);
+    dolfin::cout << "Created unit cube: " << mesh << dolfin::endl;
+  }
+
+  summary();
+
+  return 0;
+}
diff --git a/bench/mesh/unitcube/cpp/CMakeLists.txt b/bench/mesh/unitcube/cpp/CMakeLists.txt
new file mode 100644
index 0000000..97b73a9
--- /dev/null
+++ b/bench/mesh/unitcube/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME bench_mesh_unitcube_cpp)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/bench/mesh/unitcube/cpp/main.cpp b/bench/mesh/unitcube/cpp/main.cpp
new file mode 100644
index 0000000..cc6240e
--- /dev/null
+++ b/bench/mesh/unitcube/cpp/main.cpp
@@ -0,0 +1,42 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-11-01
+// Last changed: 2010-05-03
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#define NUM_REPS 10
+#define SIZE 128
+
+int main(int argc, char* argv[])
+{
+  info("Creating unit cube of size %d x %d x %d (%d repetitions)",
+       SIZE, SIZE, SIZE, NUM_REPS);
+
+  parameters.parse(argc, argv);
+
+  for (int i = 0; i < NUM_REPS; i++)
+  {
+    UnitCubeMesh mesh(SIZE, SIZE, SIZE);
+    dolfin::cout << "Created unit cube: " << mesh << dolfin::endl;
+  }
+
+  return 0;
+}
diff --git a/bench/plot.py b/bench/plot.py
new file mode 100644
index 0000000..cbeb795
--- /dev/null
+++ b/bench/plot.py
@@ -0,0 +1,230 @@
+#!/usr/bin/env python
+
+"""
+This script parses logs/bench.log and create plots for each case with
+the timings function of time (date plot). It also creates a web page
+index.html for easy viewing of the generated plots.
+"""
+
+# Copyright (C) 2010 Johannes Ring
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-04-06
+# Last changed: 2010-04-13
+
+import os
+import re
+import time
+import datetime
+import textwrap
+import numpy
+import matplotlib.pyplot as plt
+import matplotlib.dates as mdates
+
+# Change some of the default Matplotlib parameters
+plt.rcParams.update({'figure.figsize': [6, 4],
+                     'font.size' : 10,
+                     'axes.labelsize' : 10,
+                     'axes.grid': True,
+                     'text.fontsize' : 10,
+                     'legend.fontsize' : 8,
+                     'xtick.labelsize' : 8,
+                     'ytick.labelsize' : 8,
+                     })
+
+# Write to web page index.html
+outfile = open("index.html", "w")
+outfile.write("<h1><big>DOLFIN Benchmarks</big></h1>\n")
+outfile.write("Last updated: %s.\n\n" % time.asctime())
+
+# Open and read in logs/bench.log
+benchlog = "logs/bench.log"
+lines = open(benchlog, 'r').readlines()
+
+benchmarks = {}
+pattern = "\((.*)\)\s+(.*)\s+(.*)\s+\"(.*)\""
+
+# Extract data from logfile
+print "Parsing %s..." % benchlog
+for line in lines:
+    match = re.search(pattern, line)
+    if match:
+        year, month, day, hour, minute, second = \
+              [int(i) for i in match.group(1).split(',')]
+        #date = datetime.datetime(year, month, day, hour, minute, second)
+        date = datetime.date(year, month, day)
+        name = match.group(2)
+        elapsed_time = float(match.group(3))
+        description = match.group(4)
+
+        if not name in benchmarks:
+            benchmarks[name] = [[date], [elapsed_time], description]
+        else:
+            benchmarks[name][0].append(date)
+            benchmarks[name][1].append(elapsed_time)
+
+# Open and read in logs/milestones.log
+milestones = []
+milestoneslog = "logs/milestones.log"
+if os.path.isfile(milestoneslog):
+    lines = open(milestoneslog, 'r').readlines()
+    for line in lines:
+        date = datetime.datetime.strptime(line.split()[0], "%Y-%m-%d")
+        progname = ' '.join(line.split()[1:])
+        milestones.append([date, progname])
+
+# Get Matplotlib line markers for use later
+markers = []
+for m in plt.Line2D.markers:
+    try:
+        if len(m) == 1 and m != ' ':
+            markers.append(m)
+    except TypeError:
+        pass
+
+year = datetime.timedelta(days=365)
+month = datetime.timedelta(days=30)
+week = datetime.timedelta(days=7)
+today = datetime.date.today()
+lasts = ['week', 'month', 'year', 'five years']
+locators = [mdates.DayLocator(), mdates.DayLocator(interval=2),
+            mdates.MonthLocator(), mdates.YearLocator()]
+date_fmts = ['%Y-%m-%d', '%d %b', '%b %Y', '%Y']
+xmins = [today - week, today - month, today - year, today - 5*year]
+
+outfile.write("<h2>All benchmarks</h2><p>\n")
+outfile.write("<center>\n")
+outfile.write("<table border=\"0\">\n")
+
+def get_maxtime(dates, min_date, max_date, run_timings):
+    """Return the maximum time between min_date and max_date"""
+    max_time = 0
+    for i, date in enumerate(dates):
+        if date < min_date:
+            continue
+        elif date > max_date:
+            break
+        else:
+            if max_time < run_timings[i]:
+                max_time = run_timings[i]
+    return max_time
+
+# Create normalized plots with all benchmarks in same plot for
+# last week, last month, last year, and last five years
+print "Generating plots for all benchmarks..."
+for last, locator, date_fmt, xmin in zip(lasts, locators, date_fmts, xmins):
+    fig = plt.figure()
+    ax = fig.gca()
+    num = 0
+    ymax = 0
+    for benchmark, values in benchmarks.items():
+        num += 1
+        dates = values[0]
+        run_timings = values[1]/numpy.linalg.norm(values[1])
+        ax.plot(dates, run_timings,
+                marker=markers[num % len(markers)], markersize=3,
+                label=benchmark)
+        ax.hold(True)
+        maxtime = get_maxtime(dates, xmin, today, run_timings)
+        if maxtime > ymax:
+            ymax = maxtime
+    ax.xaxis.set_major_locator(locator)
+    ax.xaxis.set_major_formatter(mdates.DateFormatter(date_fmt))
+    ax.set_xlim(xmin, today)
+    ax.set_ylim(0, ymax)
+
+    # Add milestones to plot
+    for milestone in milestones:
+        milestone_num = mdates.date2num(milestone[0])
+        ax.annotate(milestone[1], xy=(milestone_num, 0.1E-10),
+                    xycoords='data', xytext=(0, 30),
+                    textcoords='offset points',
+                    horizontalalignment='center',
+                    verticalalignment='bottom',
+                    style='italic', fontsize=6,
+                    alpha=0.7, rotation='vertical',
+                    arrowprops=dict(arrowstyle="->", alpha=0.3)
+                    )
+
+    lgd = plt.legend(loc='best')
+    fig.autofmt_xdate()
+    plt.title("All benchmarks (last %s)" % last)
+    filename = "all_last_%s.png" % last.replace(' ', '_')
+    plt.savefig(filename, facecolor='#eeeeee')
+
+    # Add plots to web page
+    if last in ['week', 'year']:
+        outfile.write("  <tr><td><img src=\"%s\" /></td>\n" % filename)
+    else:
+        outfile.write("  <td><img src=\"%s\" /></td></tr>\n" % filename)
+
+outfile.write("</table>\n")
+outfile.write("</center>\n")
+
+# Now create separate plots for every benchmark
+for benchmark, values in benchmarks.items():
+    print "Generating plots for %s..." % benchmark
+
+    outfile.write("<h2>%s</h2><p>\n" % benchmark)
+    outfile.write("<center>\n")
+    outfile.write("<table border=\"0\">\n")
+
+    dates = values[0]
+    run_timings = values[1]
+    description = values[2]
+    # Wrap the lines in the description
+    description = textwrap.fill(description, width=30)
+
+    # Create plots for last week, last month, last year, and last five years
+    for last, locator, date_fmt, xmin in zip(lasts, locators, date_fmts, xmins):
+        fig = plt.figure()
+        ax = fig.gca()
+        ax.plot(dates, run_timings, marker='o', markersize=3)
+        ax.set_ylabel("time (seconds)")
+        maxtime = get_maxtime(dates, xmin, today, run_timings)
+        ax.set_ylim(0, maxtime + maxtime/2)
+        ax.legend((description,), loc='best')        
+        ax.xaxis.set_major_locator(locator)
+        ax.xaxis.set_major_formatter(mdates.DateFormatter(date_fmt))
+        ax.set_xlim(xmin, today)
+
+        # Add milestones to plot
+        for milestone in milestones:
+            milestone_num = mdates.date2num(milestone[0])
+            ax.annotate(milestone[1], xy=(milestone_num, 0.1E-10),
+                        xycoords='data', xytext=(0, 30),
+                        textcoords='offset points',
+                        horizontalalignment='center',
+                        verticalalignment='bottom',
+                        style='italic', fontsize=6,
+                        alpha=0.7, rotation='vertical',
+                        arrowprops=dict(arrowstyle="->", alpha=0.3)
+                        )
+
+        fig.autofmt_xdate()
+        plt.title("%s (last %s)" % (benchmark, last))
+        filename = "%s_last_%s.png" % (benchmark, last.replace(' ', '_'))
+        plt.savefig(filename, facecolor='#eeeeee')
+
+        # Add plots to web page
+        if last in ['week', 'year']:
+            outfile.write("  <tr><td><img src=\"%s\" /></td>\n" % filename)
+        else:
+            outfile.write("  <td><img src=\"%s\" /></td></tr>\n" % filename)
+
+    outfile.write("</table>\n")
+    outfile.write("</center>\n")
diff --git a/cmake/modules/CheckOpenMP.cmake b/cmake/modules/CheckOpenMP.cmake
new file mode 100644
index 0000000..50e2aee
--- /dev/null
+++ b/cmake/modules/CheckOpenMP.cmake
@@ -0,0 +1,55 @@
+# CheckOpenMP - this module defines the following macros
+
+# check_openmp_unsigned_int_loop_control_variable(<var>)
+#  <var> - variable to store the result
+# This macro checks if the control variable of a loop associated
+# with a for directive can be of unsigned type. In OpenMP 2.5,
+# only signed integer type was allowed. See Section 2.5.1 on
+# p. 38 of the OpenMP 3.0 Specification.
+
+include(CheckCXXSourceRuns)
+
+macro(check_openmp_unsigned_int_loop_control_variable _test_result)
+  if (NOT OPENMP_FOUND)
+    find_package(OpenMP)
+  endif()
+
+  set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} ${OpenMP_CXX_FLAGS}")
+
+  check_cxx_source_runs("
+#include <iostream>
+#include <omp.h>
+
+#define N 20
+
+int main ()
+{
+  float a[N];
+
+  omp_set_dynamic(0);
+  omp_set_num_threads(10);
+
+  for (int i=0; i<N; ++i) {
+    a[i] = i;
+  }
+
+#pragma omp parallel shared(a)
+  {
+    #pragma omp for
+    for (unsigned int i=0; i<N; ++i) {
+      a[i] = a[i] * 2.0;
+    }
+
+    #pragma omp for
+    for (unsigned long j=0; j<N; ++j) {
+      a[j] = a[j] * 2.0;
+    }
+  }
+
+  for (int i=0; i<N; i++) {
+    std::cout << i << \": \" << a[i] << std::endl;
+  }
+}
+" ${_test_result})
+
+endmacro()
diff --git a/cmake/modules/CorrectWindowsPaths.cmake b/cmake/modules/CorrectWindowsPaths.cmake
new file mode 100644
index 0000000..09bcdd6
--- /dev/null
+++ b/cmake/modules/CorrectWindowsPaths.cmake
@@ -0,0 +1,14 @@
+# CorrectWindowsPaths - this module defines one macro
+#
+# CONVERT_CYGWIN_PATH( PATH )
+#  This uses the command cygpath (provided by cygwin) to convert
+#  unix-style paths into paths useable by cmake on windows
+
+macro (CONVERT_CYGWIN_PATH _path)
+  if (WIN32)
+    EXECUTE_PROCESS(COMMAND cygpath.exe -m ${${_path}}
+      OUTPUT_VARIABLE ${_path})
+    string (STRIP ${${_path}} ${_path})
+  endif (WIN32)
+endmacro (CONVERT_CYGWIN_PATH)
+
diff --git a/cmake/modules/FindAMD.cmake b/cmake/modules/FindAMD.cmake
new file mode 100644
index 0000000..5b2ed26
--- /dev/null
+++ b/cmake/modules/FindAMD.cmake
@@ -0,0 +1,62 @@
+# - Try to find AMD
+# Once done this will define
+#
+#  AMD_FOUND        - system has AMD
+#  AMD_INCLUDE_DIRS - include directories for AMD
+#  AMD_LIBRARIES    - libraries for AMD
+
+#=============================================================================
+# Copyright (C) 2010 Anders Logg
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+message(STATUS "Checking for package 'AMD'")
+
+# Check for header file
+find_path(AMD_INCLUDE_DIRS amd.h
+ HINTS ${AMD_DIR}/include $ENV{AMD_DIR}/include
+ PATH_SUFFIXES suitesparse ufsparse
+ DOC "Directory where the AMD header is located"
+ )
+mark_as_advanced(AMD_INCLUDE_DIRS)
+
+# Check for AMD library
+find_library(AMD_LIBRARIES amd
+  HINTS ${AMD_DIR}/lib $ENV{AMD_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The AMD library"
+  )
+find_library(AMD_LIBRARIES amd
+  DOC "The AMD library"
+  )
+mark_as_advanced(AMD_LIBRARY)
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(AMD
+  "AMD could not be found. Be sure to set AMD_DIR."
+  AMD_LIBRARIES AMD_INCLUDE_DIRS)
diff --git a/cmake/modules/FindBLAS.cmake b/cmake/modules/FindBLAS.cmake
new file mode 100644
index 0000000..a80f418
--- /dev/null
+++ b/cmake/modules/FindBLAS.cmake
@@ -0,0 +1,629 @@
+# - Find BLAS library
+# This module finds an installed fortran library that implements the BLAS
+# linear-algebra interface (see http://www.netlib.org/blas/).
+# The list of libraries searched for is taken
+# from the autoconf macro file, acx_blas.m4 (distributed at
+# http://ac-archive.sourceforge.net/ac-archive/acx_blas.html).
+#
+# This module sets the following variables:
+#  BLAS_FOUND - set to true if a library implementing the BLAS interface
+#    is found
+#  BLAS_LINKER_FLAGS - uncached list of required linker flags (excluding -l
+#    and -L).
+#  BLAS_LIBRARIES - uncached list of libraries (using full path name) to
+#    link against to use BLAS
+#  BLAS95_LIBRARIES - uncached list of libraries (using full path name)
+#    to link against to use BLAS95 interface
+#  BLAS95_FOUND - set to true if a library implementing the BLAS f95 interface
+#    is found
+#  BLA_STATIC  if set on this determines what kind of linkage we do (static)
+#  BLA_VENDOR  if set checks only the specified vendor, if not set checks
+#     all the possibilities
+#  BLA_F95     if set on tries to find the f95 interfaces for BLAS/LAPACK
+##########
+### List of vendors (BLA_VENDOR) valid in this module
+##  Goto,ATLAS PhiPACK,CXML,DXML,SunPerf,SCSL,SGIMATH,IBMESSL,Intel10_32 (intel mkl v10 32 bit),Intel10_64lp (intel mkl v10 64 bit,lp thread model, lp64 model),
+##  Intel10_64lp_seq (intel mkl v10 64 bit,sequential code, lp64 model),
+##  Intel( older versions of mkl 32 and 64 bit), ACML,ACML_MP,ACML_GPU,Apple, NAS, Generic
+# C/CXX should be enabled to use Intel mkl
+
+#=============================================================================
+# Copyright 2007-2009 Kitware, 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 copyright
+#    notice, this list of conditions and the following disclaimer.
+# 2. Redistributions in binary form must reproduce the 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 BY THE AUTHOR ``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.
+#=============================================================================
+
+include(CheckFunctionExists)
+include(CheckFortranFunctionExists)
+
+set(_blas_ORIG_CMAKE_FIND_LIBRARY_SUFFIXES ${CMAKE_FIND_LIBRARY_SUFFIXES})
+
+# Check the language being used
+get_property( _LANGUAGES_ GLOBAL PROPERTY ENABLED_LANGUAGES )
+if( _LANGUAGES_ MATCHES Fortran AND CMAKE_Fortran_COMPILER_WORKS )
+  set( _CHECK_FORTRAN TRUE )
+elseif( (_LANGUAGES_ MATCHES C) OR (_LANGUAGES_ MATCHES CXX) )
+  set( _CHECK_FORTRAN FALSE )
+else()
+  if(BLAS_FIND_REQUIRED)
+    message(FATAL_ERROR "FindBLAS requires Fortran, C, or C++ to be enabled.")
+  else(BLAS_FIND_REQUIRED)
+    message(STATUS "Looking for BLAS... - NOT found (Unsupported languages)")
+    return()
+  endif(BLAS_FIND_REQUIRED)
+endif( )
+
+macro(Check_Fortran_Libraries LIBRARIES _prefix _name _flags _list _thread)
+# This macro checks for the existence of the combination of fortran libraries
+# given by _list.  If the combination is found, this macro checks (using the
+# Check_Fortran_Function_Exists macro) whether can link against that library
+# combination using the name of a routine given by _name using the linker
+# flags given by _flags.  If the combination of libraries is found and passes
+# the link test, LIBRARIES is set to the list of complete library paths that
+# have been found.  Otherwise, LIBRARIES is set to FALSE.
+
+# N.B. _prefix is the prefix applied to the names of all cached variables that
+# are generated internally and marked advanced by this macro.
+
+set(_libdir ${ARGN})
+
+set(_libraries_work TRUE)
+set(${LIBRARIES})
+set(_combined_name)
+if (NOT _libdir)
+  if (WIN32)
+    set(_libdir ENV LIB)
+  elseif (APPLE)
+    set(_libdir /usr/local/lib /usr/lib /usr/local/lib64 /usr/lib64 ENV DYLD_LIBRARY_PATH)
+  else ()
+    set(_libdir /usr/local/lib /usr/lib /usr/local/lib64 /usr/lib64 ENV LD_LIBRARY_PATH)
+  endif ()
+endif ()
+
+foreach(_library ${_list})
+  set(_combined_name ${_combined_name}_${_library})
+
+  if(_libraries_work)
+    if (BLA_STATIC)
+      if (WIN32)
+        set(CMAKE_FIND_LIBRARY_SUFFIXES .lib ${CMAKE_FIND_LIBRARY_SUFFIXES})
+      endif ( WIN32 )
+      if (APPLE)
+        set(CMAKE_FIND_LIBRARY_SUFFIXES .lib ${CMAKE_FIND_LIBRARY_SUFFIXES})
+      else (APPLE)
+        set(CMAKE_FIND_LIBRARY_SUFFIXES .a ${CMAKE_FIND_LIBRARY_SUFFIXES})
+      endif (APPLE)
+    else (BLA_STATIC)
+      if (CMAKE_SYSTEM_NAME STREQUAL "Linux")
+        # for ubuntu's libblas3gf and liblapack3gf packages
+        #set(CMAKE_FIND_LIBRARY_SUFFIXES ${CMAKE_FIND_LIBRARY_SUFFIXES} .so.3gf)
+      endif ()
+    endif (BLA_STATIC)
+    find_library(${_prefix}_${_library}_LIBRARY
+      NAMES ${_library}
+      PATHS ${_libdir}
+      )
+    mark_as_advanced(${_prefix}_${_library}_LIBRARY)
+    set(${LIBRARIES} ${${LIBRARIES}} ${${_prefix}_${_library}_LIBRARY})
+    set(_libraries_work ${${_prefix}_${_library}_LIBRARY})
+  endif(_libraries_work)
+endforeach(_library ${_list})
+if(_libraries_work)
+  # Test this combination of libraries.
+  set(CMAKE_REQUIRED_LIBRARIES ${_flags} ${${LIBRARIES}} ${_thread})
+#  message("DEBUG: CMAKE_REQUIRED_LIBRARIES = ${CMAKE_REQUIRED_LIBRARIES}")
+
+  # GNW: Add special flags for static BLAS libraries for function check
+  if(BLA_STATIC AND UNIX)
+    set(CMAKE_REQUIRED_LIBRARIES ${_flags} "-Wl,--start-group ${${LIBRARIES}};-Wl,--end-group" ${_thread})
+  endif()
+
+  if (_CHECK_FORTRAN)
+    check_fortran_function_exists("${_name}" ${_prefix}${_combined_name}_WORKS)
+  else()
+    check_function_exists("${_name}_" ${_prefix}${_combined_name}_WORKS)
+  endif()
+
+  set(CMAKE_REQUIRED_LIBRARIES)
+  mark_as_advanced(${_prefix}${_combined_name}_WORKS)
+  set(_libraries_work ${${_prefix}${_combined_name}_WORKS})
+endif(_libraries_work)
+if(NOT _libraries_work)
+  set(${LIBRARIES} FALSE)
+endif(NOT _libraries_work)
+#message("DEBUG: ${LIBRARIES} = ${${LIBRARIES}}")
+endmacro(Check_Fortran_Libraries)
+
+set(BLAS_LINKER_FLAGS)
+set(BLAS_LIBRARIES)
+set(BLAS95_LIBRARIES)
+if ($ENV{BLA_VENDOR} MATCHES ".+")
+  set(BLA_VENDOR $ENV{BLA_VENDOR})
+else ($ENV{BLA_VENDOR} MATCHES ".+")
+  if(NOT BLA_VENDOR)
+    set(BLA_VENDOR "All")
+  endif(NOT BLA_VENDOR)
+endif ($ENV{BLA_VENDOR} MATCHES ".+")
+
+if (BLA_VENDOR STREQUAL "Goto" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  # gotoblas (http://www.tacc.utexas.edu/tacc-projects/gotoblas2)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "goto2"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "Goto" OR BLA_VENDOR STREQUAL "All")
+
+if (BLA_VENDOR STREQUAL "ATLAS" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  # BLAS in ATLAS library? (http://math-atlas.sourceforge.net/)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  dgemm
+  ""
+  "cblas;f77blas;atlas"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "ATLAS" OR BLA_VENDOR STREQUAL "All")
+
+# BLAS in PhiPACK libraries? (requires generic BLAS lib, too)
+if (BLA_VENDOR STREQUAL "PhiPACK" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "sgemm;dgemm;blas"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "PhiPACK" OR BLA_VENDOR STREQUAL "All")
+
+# BLAS in Alpha CXML library?
+if (BLA_VENDOR STREQUAL "CXML" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "cxml"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "CXML" OR BLA_VENDOR STREQUAL "All")
+
+# BLAS in Alpha DXML library? (now called CXML, see above)
+if (BLA_VENDOR STREQUAL "DXML" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "dxml"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "DXML" OR BLA_VENDOR STREQUAL "All")
+
+# BLAS in Sun Performance library?
+if (BLA_VENDOR STREQUAL "SunPerf" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  "-xlic_lib=sunperf"
+  "sunperf;sunmath"
+  ""
+  )
+  if(BLAS_LIBRARIES)
+    set(BLAS_LINKER_FLAGS "-xlic_lib=sunperf")
+  endif(BLAS_LIBRARIES)
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "SunPerf" OR BLA_VENDOR STREQUAL "All")
+
+# BLAS in SCSL library?  (SGI/Cray Scientific Library)
+if (BLA_VENDOR STREQUAL "SCSL" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "scsl"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "SCSL" OR BLA_VENDOR STREQUAL "All")
+
+# BLAS in SGIMATH library?
+if (BLA_VENDOR STREQUAL "SGIMATH" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "complib.sgimath"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "SGIMATH" OR BLA_VENDOR STREQUAL "All")
+
+# BLAS in IBM ESSL library? (requires generic BLAS lib, too)
+if (BLA_VENDOR STREQUAL "IBMESSL" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "essl;blas"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "IBMESSL" OR BLA_VENDOR STREQUAL "All")
+
+#BLAS in acml library?
+if (BLA_VENDOR MATCHES "ACML.*" OR BLA_VENDOR STREQUAL "All")
+ if( ((BLA_VENDOR STREQUAL "ACML") AND (NOT BLAS_ACML_LIB_DIRS)) OR
+     ((BLA_VENDOR STREQUAL "ACML_MP") AND (NOT BLAS_ACML_MP_LIB_DIRS)) OR
+     ((BLA_VENDOR STREQUAL "ACML_GPU") AND (NOT BLAS_ACML_GPU_LIB_DIRS))
+   )
+   # try to find acml in "standard" paths
+   if( WIN32 )
+    file( GLOB _ACML_ROOT "C:/AMD/acml*/ACML-EULA.txt" )
+   else()
+    file( GLOB _ACML_ROOT "/opt/acml*/ACML-EULA.txt" )
+   endif()
+   if( WIN32 )
+    file( GLOB _ACML_GPU_ROOT "C:/AMD/acml*/GPGPUexamples" )
+   else()
+    file( GLOB _ACML_GPU_ROOT "/opt/acml*/GPGPUexamples" )
+   endif()
+   list(GET _ACML_ROOT 0 _ACML_ROOT)
+   list(GET _ACML_GPU_ROOT 0 _ACML_GPU_ROOT)
+   if( _ACML_ROOT )
+    get_filename_component( _ACML_ROOT ${_ACML_ROOT} PATH )
+    if( SIZEOF_INTEGER EQUAL 8 )
+     set( _ACML_PATH_SUFFIX "_int64" )
+    else()
+    set( _ACML_PATH_SUFFIX "" )
+   endif()
+   if( CMAKE_Fortran_COMPILER_ID STREQUAL "Intel" )
+    set( _ACML_COMPILER32 "ifort32" )
+    set( _ACML_COMPILER64 "ifort64" )
+   elseif( CMAKE_Fortran_COMPILER_ID STREQUAL "SunPro" )
+    set( _ACML_COMPILER32 "sun32" )
+    set( _ACML_COMPILER64 "sun64" )
+   elseif( CMAKE_Fortran_COMPILER_ID STREQUAL "PGI" )
+    set( _ACML_COMPILER32 "pgi32" )
+    if( WIN32 )
+     set( _ACML_COMPILER64 "win64" )
+    else()
+     set( _ACML_COMPILER64 "pgi64" )
+    endif()
+   elseif( CMAKE_Fortran_COMPILER_ID STREQUAL "Open64" )
+    # 32 bit builds not supported on Open64 but for code simplicity
+    # We'll just use the same directory twice
+    set( _ACML_COMPILER32 "open64_64" )
+    set( _ACML_COMPILER64 "open64_64" )
+   elseif( CMAKE_Fortran_COMPILER_ID STREQUAL "NAG" )
+    set( _ACML_COMPILER32 "nag32" )
+    set( _ACML_COMPILER64 "nag64" )
+   else() #if( CMAKE_Fortran_COMPILER_ID STREQUAL "GNU" )
+    set( _ACML_COMPILER32 "gfortran32" )
+    set( _ACML_COMPILER64 "gfortran64" )
+   endif()
+
+   if( BLA_VENDOR STREQUAL "ACML_MP" )
+    set(_ACML_MP_LIB_DIRS
+     "${_ACML_ROOT}/${_ACML_COMPILER32}_mp${_ACML_PATH_SUFFIX}/lib"
+     "${_ACML_ROOT}/${_ACML_COMPILER64}_mp${_ACML_PATH_SUFFIX}/lib" )
+   else() #if( _BLAS_VENDOR STREQUAL "ACML" )
+    set(_ACML_LIB_DIRS
+     "${_ACML_ROOT}/${_ACML_COMPILER32}${_ACML_PATH_SUFFIX}/lib"
+     "${_ACML_ROOT}/${_ACML_COMPILER64}${_ACML_PATH_SUFFIX}/lib" )
+   endif()
+  endif()
+ elseif(BLAS_${BLA_VENDOR}_LIB_DIRS)
+   set(_${BLA_VENDOR}_LIB_DIRS ${BLAS_${BLA_VENDOR}_LIB_DIRS})
+ endif()
+
+ if( BLA_VENDOR STREQUAL "ACML_MP" )
+  foreach( BLAS_ACML_MP_LIB_DIRS ${_ACML_MP_LIB_DIRS})
+   check_fortran_libraries (
+     BLAS_LIBRARIES
+     BLAS
+     sgemm
+     "" "acml_mp;acml_mv" "" ${BLAS_ACML_MP_LIB_DIRS}
+   )
+   if( BLAS_LIBRARIES )
+    break()
+   endif()
+  endforeach()
+ elseif( BLA_VENDOR STREQUAL "ACML_GPU" )
+  foreach( BLAS_ACML_GPU_LIB_DIRS ${_ACML_GPU_LIB_DIRS})
+   check_fortran_libraries (
+     BLAS_LIBRARIES
+     BLAS
+     sgemm
+     "" "acml;acml_mv;CALBLAS" "" ${BLAS_ACML_GPU_LIB_DIRS}
+   )
+   if( BLAS_LIBRARIES )
+    break()
+   endif()
+  endforeach()
+ else() #if( _BLAS_VENDOR STREQUAL "ACML" )
+  foreach( BLAS_ACML_LIB_DIRS ${_ACML_LIB_DIRS} )
+   check_fortran_libraries (
+     BLAS_LIBRARIES
+     BLAS
+     sgemm
+     "" "acml;acml_mv" "" ${BLAS_ACML_LIB_DIRS}
+   )
+   if( BLAS_LIBRARIES )
+    break()
+   endif()
+  endforeach()
+ endif()
+
+ # Either acml or acml_mp should be in LD_LIBRARY_PATH but not both
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "acml;acml_mv"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "acml_mp;acml_mv"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "acml;acml_mv;CALBLAS"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif () # ACML
+
+# Apple BLAS library?
+if (BLA_VENDOR STREQUAL "Apple" OR BLA_VENDOR STREQUAL "All")
+if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  dgemm
+  ""
+  "Accelerate"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "Apple" OR BLA_VENDOR STREQUAL "All")
+
+if (BLA_VENDOR STREQUAL "NAS" OR BLA_VENDOR STREQUAL "All")
+ if ( NOT BLAS_LIBRARIES )
+    check_fortran_libraries(
+    BLAS_LIBRARIES
+    BLAS
+    dgemm
+    ""
+    "vecLib"
+    ""
+    )
+ endif ( NOT BLAS_LIBRARIES )
+endif (BLA_VENDOR STREQUAL "NAS" OR BLA_VENDOR STREQUAL "All")
+# Generic BLAS library?
+if (BLA_VENDOR STREQUAL "Generic" OR BLA_VENDOR STREQUAL "All")
+ if(NOT BLAS_LIBRARIES)
+  check_fortran_libraries(
+  BLAS_LIBRARIES
+  BLAS
+  sgemm
+  ""
+  "blas"
+  ""
+  )
+ endif(NOT BLAS_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "Generic" OR BLA_VENDOR STREQUAL "All")
+
+#BLAS in intel mkl 10 library? (em64t 64bit)
+if (BLA_VENDOR MATCHES "Intel*" OR BLA_VENDOR STREQUAL "All")
+ if (NOT WIN32)
+  set(LM "-lm")
+ endif ()
+ if (_LANGUAGES_ MATCHES C OR _LANGUAGES_ MATCHES CXX)
+  if(BLAS_FIND_QUIETLY OR NOT BLAS_FIND_REQUIRED)
+    find_package(Threads)
+  else(BLAS_FIND_QUIETLY OR NOT BLAS_FIND_REQUIRED)
+    find_package(Threads REQUIRED)
+  endif(BLAS_FIND_QUIETLY OR NOT BLAS_FIND_REQUIRED)
+
+  set(BLAS_SEARCH_LIBS "")
+
+  if(BLA_F95)
+    set(BLAS_mkl_SEARCH_SYMBOL SGEMM)
+    set(_LIBRARIES BLAS95_LIBRARIES)
+    if (WIN32)
+      list(APPEND BLAS_SEARCH_LIBS
+        "mkl_blas95 mkl_intel_c mkl_intel_thread mkl_core libguide40")
+    else (WIN32)
+      if (BLA_VENDOR STREQUAL "Intel10_32" OR BLA_VENDOR STREQUAL "All")
+        list(APPEND BLAS_SEARCH_LIBS
+          "mkl_blas95 mkl_intel mkl_intel_thread mkl_core guide")
+      endif ()
+      if (BLA_VENDOR STREQUAL "Intel10_64lp" OR BLA_VENDOR STREQUAL "All")
+        # old version
+        list(APPEND BLAS_SEARCH_LIBS
+          "mkl_blas95 mkl_intel_lp64 mkl_intel_thread mkl_core guide")
+
+        # mkl >= 10.3
+        if (CMAKE_C_COMPILER MATCHES ".+gcc.*")
+          list(APPEND BLAS_SEARCH_LIBS
+            "mkl_blas95_lp64 mkl_intel_lp64 mkl_gnu_thread mkl_core")
+          set(LM "${LM};-lgomp")
+        else ()
+          list(APPEND BLAS_SEARCH_LIBS
+            "mkl_blas95_lp64 mkl_intel_lp64 mkl_intel_thread mkl_core iomp5")
+        endif ()
+      endif ()
+    endif (WIN32)
+    if (BLA_VENDOR STREQUAL "Intel10_64lp_seq" OR BLA_VENDOR STREQUAL "All")
+      list(APPEND BLAS_SEARCH_LIBS
+        "mkl_blas95_lp64 mkl_intel_lp64 mkl_sequential mkl_core")
+    endif ()
+  else (BLA_F95)
+    set(BLAS_mkl_SEARCH_SYMBOL sgemm)
+    set(_LIBRARIES BLAS_LIBRARIES)
+    if (WIN32)
+      list(APPEND BLAS_SEARCH_LIBS
+        "mkl_c_dll mkl_intel_thread_dll mkl_core_dll libguide40")
+    else (WIN32)
+      if (BLA_VENDOR STREQUAL "Intel10_32" OR BLA_VENDOR STREQUAL "All")
+        list(APPEND BLAS_SEARCH_LIBS
+          "mkl_intel mkl_intel_thread mkl_core guide")
+      endif ()
+      if (BLA_VENDOR STREQUAL "Intel10_64lp" OR BLA_VENDOR STREQUAL "All")
+
+        # old version
+        list(APPEND BLAS_SEARCH_LIBS
+          "mkl_intel_lp64 mkl_intel_thread mkl_core guide")
+
+        # mkl >= 10.3
+        if (CMAKE_C_COMPILER MATCHES ".+gcc.*")
+          list(APPEND BLAS_SEARCH_LIBS
+            "mkl_intel_lp64 mkl_gnu_thread mkl_core")
+          set(LM "${LM};-lgomp")
+        else ()
+          list(APPEND BLAS_SEARCH_LIBS
+            "mkl_intel_lp64 mkl_intel_thread mkl_core iomp5")
+        endif ()
+      endif ()
+
+      #older vesions of intel mkl libs
+      if (BLA_VENDOR STREQUAL "Intel" OR BLA_VENDOR STREQUAL "All")
+        list(APPEND BLAS_SEARCH_LIBS
+          "mkl")
+        list(APPEND BLAS_SEARCH_LIBS
+          "mkl_ia32")
+        list(APPEND BLAS_SEARCH_LIBS
+          "mkl_em64t")
+      endif ()
+    endif (WIN32)
+    if (BLA_VENDOR STREQUAL "Intel10_64lp_seq" OR BLA_VENDOR STREQUAL "All")
+      list(APPEND BLAS_SEARCH_LIBS
+        "mkl_intel_lp64 mkl_sequential mkl_core")
+    endif ()
+  endif (BLA_F95)
+
+  foreach (IT ${BLAS_SEARCH_LIBS})
+    string(REPLACE " " ";" SEARCH_LIBS ${IT})
+    if (${_LIBRARIES})
+    else ()
+      check_fortran_libraries(
+        ${_LIBRARIES}
+        BLAS
+        ${BLAS_mkl_SEARCH_SYMBOL}
+        ""
+        "${SEARCH_LIBS}"
+        "${CMAKE_THREAD_LIBS_INIT};${LM}"
+        )
+    endif ()
+  endforeach ()
+
+ endif (_LANGUAGES_ MATCHES C OR _LANGUAGES_ MATCHES CXX)
+endif (BLA_VENDOR MATCHES "Intel*" OR BLA_VENDOR STREQUAL "All")
+
+
+if(BLA_F95)
+ if(BLAS95_LIBRARIES)
+    set(BLAS95_FOUND TRUE)
+  else(BLAS95_LIBRARIES)
+    set(BLAS95_FOUND FALSE)
+  endif(BLAS95_LIBRARIES)
+
+  if(NOT BLAS_FIND_QUIETLY)
+    if(BLAS95_FOUND)
+      message(STATUS "A library with BLAS95 API found.")
+    else(BLAS95_FOUND)
+      if(BLAS_FIND_REQUIRED)
+        message(FATAL_ERROR
+        "A required library with BLAS95 API not found. Please specify library location.")
+      else(BLAS_FIND_REQUIRED)
+        message(STATUS
+        "A library with BLAS95 API not found. Please specify library location.")
+      endif(BLAS_FIND_REQUIRED)
+    endif(BLAS95_FOUND)
+  endif(NOT BLAS_FIND_QUIETLY)
+  set(BLAS_FOUND TRUE)
+  set(BLAS_LIBRARIES "${BLAS95_LIBRARIES}")
+else(BLA_F95)
+  if(BLAS_LIBRARIES)
+    set(BLAS_FOUND TRUE)
+  else(BLAS_LIBRARIES)
+    set(BLAS_FOUND FALSE)
+  endif(BLAS_LIBRARIES)
+
+  if(NOT BLAS_FIND_QUIETLY)
+    if(BLAS_FOUND)
+      message(STATUS "A library with BLAS API found.")
+    else(BLAS_FOUND)
+      if(BLAS_FIND_REQUIRED)
+        message(FATAL_ERROR
+        "A required library with BLAS API not found. Please specify library location."
+        )
+      else(BLAS_FIND_REQUIRED)
+        message(STATUS
+        "A library with BLAS API not found. Please specify library location."
+        )
+      endif(BLAS_FIND_REQUIRED)
+    endif(BLAS_FOUND)
+  endif(NOT BLAS_FIND_QUIETLY)
+endif(BLA_F95)
+
+set(CMAKE_FIND_LIBRARY_SUFFIXES ${_blas_ORIG_CMAKE_FIND_LIBRARY_SUFFIXES})
diff --git a/cmake/modules/FindBLASHeader.cmake b/cmake/modules/FindBLASHeader.cmake
new file mode 100644
index 0000000..c17997d
--- /dev/null
+++ b/cmake/modules/FindBLASHeader.cmake
@@ -0,0 +1,50 @@
+# - Try to find BLAS header cblas.h
+# Once done this will define
+#
+#  BLASHEADER_FOUND  - system has BLAS
+#  BLAS_INCLUDE_DIRS - include directories for BLAS
+#
+
+#=============================================================================
+# Copyright (C) 2010 Garth N. Wells
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+message(STATUS "Checking for package 'BLAS'")
+
+# Check for header file
+find_path(BLASHEADER_INCLUDE_DIRS cblas.h
+ HINTS ${BLASHEADER_DIR}/include $ENV{BLASHEADER_DIR}/include
+ DOC "Directory where the BLAS header is located"
+ )
+mark_as_advanced(BLASBLASHEADER_INCLUDE_DIRS)
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(BLASHEADER
+  "BLAS C header could not be found. Be sure to set BLASHEADER_DIR."
+  BLASHEADER_INCLUDE_DIRS)
diff --git a/cmake/modules/FindCGAL.cmake b/cmake/modules/FindCGAL.cmake
new file mode 100644
index 0000000..0aa0966
--- /dev/null
+++ b/cmake/modules/FindCGAL.cmake
@@ -0,0 +1,132 @@
+# - Try to find CGAL
+# Once done this will define
+#
+#  CGAL_FOUND        - system has CGAL
+#  CGAL_INCLUDE_DIRS - include directories for CGAL
+#  CGAL_LIBRARIES    - libraries for CGAL
+#  CGAL_DEFINITIONS  - compiler flags for CGAL
+
+#=============================================================================
+# Copyright (C) 2010-2011 Anders Logg, Johannes Ring and Garth N. Wells
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+message(STATUS "Checking for package 'CGAL'")
+
+# Blank out CGAL_FIND_VERSION temporarily or else find_package(CGAL ...)
+# (below) will fail.
+set(CGAL_FIND_VERSION_TMP ${CGAL_FIND_VERSION})
+set(CGAL_FIND_VERSION "")
+
+# Call CGAL supplied CMake script
+find_package(CGAL
+  HINTS
+  ${CGAL_DIR}
+  $ENV{CGAL_DIR}
+  PATH_SUFFIXES lib cmake/modules lib/cmake lib/CGAL)
+
+# Restore CGAL_FIND_VERSION
+set(CGAL_FIND_VERSION ${CGAL_FIND_VERSION_TMP})
+
+if (CGAL_FIND_VERSION)
+  # Check if version found is >= required version
+  if (NOT "${CGAL_VERSION}" VERSION_LESS "${CGAL_FIND_VERSION}")
+    set(CGAL_VERSION_OK TRUE)
+  endif()
+else()
+  # No specific version of CGAL is requested
+  set(CGAL_VERSION_OK TRUE)
+endif()
+
+# Add flag to fix bug in CGAL 4.1 for Intel compilers. See
+# https://sympa.inria.fr/sympa/arc/cgal-discuss/2013-01/msg00011.html
+if("${CMAKE_CXX_COMPILER_ID}" STREQUAL "Intel")
+  if ("${CGAL_VERSION}" VERSION_GREATER "4.0.2")
+    set(CGAL_DEFINITIONS "-DCGAL_CFG_NO_STATEMENT_EXPRESSIONS")
+  endif()
+endif()
+
+# Set variables
+set(CGAL_INCLUDE_DIRS ${CGAL_INCLUDE_DIRS} ${CGAL_3RD_PARTY_INCLUDE_DIRS})
+set(CGAL_LIBRARIES ${CGAL_LIBRARY} ${CGAL_3RD_PARTY_LIBRARIES})
+
+# Add GMP and MPFR libraries if defined by CGAL
+if (GMP_LIBRARIES)
+  set(CGAL_LIBRARIES ${CGAL_LIBRARIES} ${GMP_LIBRARIES})
+endif()
+if (MPFR_LIBRARIES)
+  set(CGAL_LIBRARIES ${CGAL_LIBRARIES} ${MPFR_LIBRARIES})
+endif()
+
+# Try compiling and running test program
+if (DOLFIN_SKIP_BUILD_TESTS)
+  set(CGAL_TEST_RUNS TRUE)
+elseif (CGAL_INCLUDE_DIRS AND CGAL_LIBRARIES)
+
+  # Set flags for building test program
+  set(CMAKE_REQUIRED_INCLUDES ${CGAL_INCLUDE_DIRS})
+  set(CMAKE_REQUIRED_LIBRARIES ${CGAL_LIBRARIES})
+  set(CMAKE_REQUIRED_FLAGS ${CGAL_CXX_FLAGS_INIT})
+
+  # Add all previusly found Boost libraries - CGAL doesn't appear to supply
+  # all necessary Boost libs (test with Boost 1.50 + CGAL 4.0.2)
+  set(CMAKE_REQUIRED_LIBRARIES ${CMAKE_REQUIRED_LIBRARIES} ${Boost_LIBRARIES})
+
+  # Build and run test program
+  include(CheckCXXSourceRuns)
+  check_cxx_source_runs("
+// CGAL test program
+
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Point_3.h>
+#include <CGAL/Polyhedron_3.h>
+typedef CGAL::Simple_cartesian<double> SCK;
+typedef SCK::Point_3 Point;
+typedef CGAL::Polyhedron_3<SCK> Polyhedron_3;
+
+int main()
+{
+  // CGAL points
+  Point p1(0, 0, 0);
+  Point p2(1, 0, 0);
+  Point p3(0, 1, 0);
+  Point p4(0, 0, 1);
+
+  Polyhedron_3 P;
+  P.make_tetrahedron(p1, p2, p3, p4);
+
+  return 0;
+}
+" CGAL_TEST_RUNS)
+
+endif()
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(CGAL
+  "CGAL could not be found. Be sure to set CGAL_DIR"
+  CGAL_LIBRARIES CGAL_INCLUDE_DIRS CGAL_TEST_RUNS CGAL_VERSION_OK)
diff --git a/cmake/modules/FindCHOLMOD.cmake b/cmake/modules/FindCHOLMOD.cmake
new file mode 100644
index 0000000..3dc6c17
--- /dev/null
+++ b/cmake/modules/FindCHOLMOD.cmake
@@ -0,0 +1,230 @@
+# - Try to find CHOLMOD
+# Once done this will define
+#
+#  CHOLMOD_FOUND        - system has CHOLMOD
+#  CHOLMOD_INCLUDE_DIRS - include directories for CHOLMOD
+#  CHOLMOD_LIBRARIES    - libraries for CHOLMOD
+
+#=============================================================================
+# Copyright (C) 2010-2011 Garth N. Wells, Anders Logg and Johannes Ring
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+message(STATUS "Checking for package 'CHOLMOD'")
+
+# Find packages that CHOLMOD depends on
+set(CMAKE_LIBRARY_PATH ${BLAS_DIR}/lib $ENV{BLAS_DIR}/lib ${CMAKE_LIBRARY_PATH})
+set(CMAKE_LIBRARY_PATH ${LAPACK_DIR}/lib $ENV{LAPACK_DIR}/lib ${CMAKE_LIBRARY_PATH})
+find_package(AMD QUIET)
+find_package(BLAS QUIET)
+find_package(LAPACK QUIET)
+find_package(ParMETIS 4.0.2 QUIET)
+
+# FIXME: Should we have separate FindXX modules for CAMD, COLAMD, and CCOLAMD?
+# FIXME: find_package(CAMD)
+# FIXME: find_package(COLAMD)
+# FIXME: find_package(CCOLAMD)
+
+# FIXME: It may be necessary to link to LAPACK and BLAS (or the vecLib
+# FIXME: framework on Darwin).
+
+# Check for header file
+find_path(CHOLMOD_INCLUDE_DIRS cholmod.h
+  HINTS ${CHOLMOD_DIR}/include $ENV{CHOLMOD_DIR}/include
+  PATH_SUFFIXES suitesparse ufsparse
+  DOC "Directory where the CHOLMOD header is located"
+ )
+
+# Check for CHOLMOD library
+find_library(CHOLMOD_LIBRARY cholmod
+  HINTS ${CHOLMOD_DIR}/lib $ENV{CHOLMOD_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The CHOLMOD library"
+  )
+find_library(CHOLMOD_LIBRARY cholmod
+  DOC "The CHOLMOD library"
+  )
+
+# Check for CAMD library
+find_library(CAMD_LIBRARY camd
+  HINTS ${CHOLMOD_DIR}/lib ${CAMD_DIR}/lib $ENV{CHOLMOD_DIR}/lib $ENV{CAMD_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The CAMD library"
+  )
+find_library(CAMD_LIBRARY camd
+  DOC "The CAMD library"
+  )
+
+# Check for COLAMD library
+find_library(COLAMD_LIBRARY colamd
+  HINTS ${CHOLMOD_DIR}/lib ${COLAMD_DIR}/lib $ENV{CHOLMOD_DIR}/lib $ENV{COLAMD_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The COLAMD library"
+  )
+find_library(COLAMD_LIBRARY colamd
+  DOC "The COLAMD library"
+  )
+
+# Check for CCOLAMD library
+find_library(CCOLAMD_LIBRARY ccolamd
+  HINTS ${CHOLMOD_DIR}/lib ${CCOLAMD_DIR}/lib $ENV{CHOLMOD_DIR}/lib $ENV{CCOLAMD_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The CCOLAMD library"
+  )
+find_library(CCOLAMD_LIBRARY ccolamd
+  DOC "The CCOLAMD library"
+  )
+
+# Check for SUITESPARSECONFIG library
+find_library(SUITESPARSE_LIBRARY suitesparseconfig
+  HINTS ${CHOLMOD_DIR}/lib ${CCOLAMD_DIR}/lib $ENV{CHOLMOD_DIR}/lib $ENV{CCOLAMD_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The SUITESPARSECONFIG library"
+  )
+find_library(SUITESPARSE_LIBRARY suitesparseconfig
+  DOC "The SUITESPARSECONFIG library"
+  )
+
+if ("${CMAKE_CXX_COMPILER_ID}" STREQUAL "GNU" AND NOT APPLE)
+  # Check for rt library
+  find_library(RT_LIBRARY rt
+    DOC "The RT library"
+    )
+endif()
+
+# Collect libraries (order is important)
+if (AMD_FOUND)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARY} ${AMD_LIBRARIES})
+endif()
+if (CAMD_LIBRARY)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${CAMD_LIBRARY})
+endif()
+if (COLAMD_LIBRARY)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${COLAMD_LIBRARY})
+endif()
+if (CCOLAMD_LIBRARY)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${CCOLAMD_LIBRARY})
+endif()
+if (SUITESPARSE_LIBRARY)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${SUITESPARSE_LIBRARY})
+endif()
+if (RT_LIBRARY)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${RT_LIBRARY})
+endif()
+
+if (PARMETIS_FOUND)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${PARMETIS_LIBRARIES})
+endif()
+if (LAPACK_FOUND)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${LAPACK_LIBRARIES})
+endif()
+if (BLAS_FOUND)
+  set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${BLAS_LIBRARIES})
+endif()
+
+find_program(GFORTRAN_EXECUTABLE gfortran)
+if (GFORTRAN_EXECUTABLE)
+  execute_process(COMMAND ${GFORTRAN_EXECUTABLE} -print-file-name=libgfortran.so
+  OUTPUT_VARIABLE GFORTRAN_LIBRARY
+  OUTPUT_STRIP_TRAILING_WHITESPACE)
+  if (EXISTS "${GFORTRAN_LIBRARY}")
+    set(CHOLMOD_LIBRARIES ${CHOLMOD_LIBRARIES} ${GFORTRAN_LIBRARY})
+  endif()
+endif()
+
+mark_as_advanced(
+  CHOLMOD_INCLUDE_DIRS
+  CHOLMOD_LIBRARY
+  CHOLMOD_LIBRARIES
+  CAMD_LIBRARY
+  COLAMD_LIBRARY
+  CCOLAMD_LIBRARY
+  )
+
+# Try to run a test program that uses CHOLMOD
+if (DOLFIN_SKIP_BUILD_TESTS)
+  set(CHOLMOD_TEST_RUNS TRUE)
+elseif (CHOLMOD_INCLUDE_DIRS AND CHOLMOD_LIBRARIES AND AMD_FOUND)
+
+  set(CMAKE_REQUIRED_INCLUDES  ${CHOLMOD_INCLUDE_DIRS} ${AMD_INCLUDE_DIRS})
+  set(CMAKE_REQUIRED_LIBRARIES ${CHOLMOD_LIBRARIES})
+#  message("Cholmod libraries ${CHOLMOD_LIBRARIES}")
+
+  # Build and run test program
+  include(CheckCXXSourceRuns)
+  check_cxx_source_runs("
+#include <stdio.h>
+#include <cholmod.h>
+
+int main()
+{
+  cholmod_dense *D;
+  cholmod_sparse *S;
+  cholmod_dense *x, *b, *r;
+  cholmod_factor *L;
+  double one[2] = {1,0}, m1[2] = {-1,0};
+  double *dx;
+  cholmod_common c;
+  int n = 5;
+  double K[5][5] = {{1.0, 0.0, 0.0, 0.0, 0.0},
+                    {0.0, 2.0,-1.0, 0.0, 0.0},
+                    {0.0,-1.0, 2.0,-1.0, 0.0},
+                    {0.0, 0.0,-1.0, 2.0, 0.0},
+                    {0.0, 0.0, 0.0, 0.0, 1.0}};
+  cholmod_start (&c);
+  D = cholmod_allocate_dense(n, n, n, CHOLMOD_REAL, &c);
+  dx = (double*)D->x;
+  for (int i=0; i < n; i++)
+    for (int j=0; j < n; j++)
+      dx[i+j*n] = K[i][j];
+  S = cholmod_dense_to_sparse(D, 1, &c);
+  S->stype = 1;
+  cholmod_reallocate_sparse(cholmod_nnz(S, &c), S, &c);
+  b = cholmod_ones(S->nrow, 1, S->xtype, &c);
+  L = cholmod_analyze(S, &c);
+  cholmod_factorize(S, L, &c);
+  x = cholmod_solve(CHOLMOD_A, L, b, &c);
+  r = cholmod_copy_dense(b, &c);
+  cholmod_sdmult(S, 0, m1, one, x, r, &c);
+  cholmod_free_factor(&L, &c);
+  cholmod_free_dense(&D, &c);
+  cholmod_free_sparse(&S, &c);
+  cholmod_free_dense(&r, &c);
+  cholmod_free_dense(&x, &c);
+  cholmod_free_dense(&b, &c);
+  cholmod_finish(&c);
+  return 0;
+}
+" CHOLMOD_TEST_RUNS)
+
+endif()
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(CHOLMOD
+  "CHOLMOD could not be found. Be sure to set CHOLMOD_DIR."
+  CHOLMOD_LIBRARIES CHOLMOD_INCLUDE_DIRS CHOLMOD_TEST_RUNS)
diff --git a/cmake/modules/FindCppUnit.cmake b/cmake/modules/FindCppUnit.cmake
new file mode 100644
index 0000000..bcd7c2a
--- /dev/null
+++ b/cmake/modules/FindCppUnit.cmake
@@ -0,0 +1,69 @@
+# - Try to find CPPUNIT
+# Once done this will define
+#
+#  CPPUNIT_FOUND        - system has CPPUNIT
+#  CPPUNIT_INCLUDE_DIRS - include directories for CPPUNIT
+#  CPPUNIT_LIBRARIES    - libraries for CPPUNIT
+#  CPPUNIT_VERSION      - CPPUNIT version string (MAJOR.MINOR.MICRO)
+
+#=============================================================================
+# Copyright (C) 2010-2012 Garth N. Wells, Anders Logg and Johannes Ring
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+include(FindPkgConfig)
+pkg_check_modules(PC_CPPUNIT cppunit)
+
+set(CPPUNIT_VERSION ${PC_CPPUNIT_VERSION})
+
+# Check for header file
+find_path(CPPUNIT_INCLUDE_DIRS cppunit/Test.h
+ HINTS ${PC_CPPUNIT_INCLUDEDIR} ${CPPUNIT_DIR}/include $ENV{CPPUNIT_DIR}/include
+ DOC "Directory where the CPPUNIT header is located"
+ )
+
+# Check for library
+find_library(CPPUNIT_LIBRARIES cppunit
+  HINTS ${PC_CPPUNIT_LIBDIR} ${CPPUNIT_DIR}/lib $ENV{CPPUNIT_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The CPPUNIT library"
+  )
+find_library(CPPUNIT_LIBRARIES cppunit
+  DOC "The CPPUNIT library"
+  )
+
+mark_as_advanced(
+  CPPUNIT_LIBRARIES
+  CPPUNIT_INCLUDE_DIRS
+  CPPUNIT_VERSION
+  )
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(CPPUNIT
+  "CPPUNIT could not be found. Be sure to set CPPUNIT_DIR."
+  CPPUNIT_LIBRARIES CPPUNIT_INCLUDE_DIRS)
diff --git a/cmake/modules/FindEigen3.cmake b/cmake/modules/FindEigen3.cmake
new file mode 100644
index 0000000..c1999bf
--- /dev/null
+++ b/cmake/modules/FindEigen3.cmake
@@ -0,0 +1,87 @@
+# - Try to find Eigen3 lib
+#
+# This module supports requiring a minimum version, e.g. you can do
+#   find_package(Eigen3 3.1.2)
+# to require version 3.1.2 or newer of Eigen3.
+#
+# Once done this will define
+#
+#  EIGEN3_FOUND - system has eigen lib with correct version
+#  EIGEN3_INCLUDE_DIR - the eigen include directory
+#  EIGEN3_VERSION - eigen version
+
+# Copyright (c) 2006, 2007 Montel Laurent, <montel@kde.org>
+# Copyright (c) 2008, 2009 Gael Guennebaud, <g.gael@free.fr>
+# Copyright (c) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>
+# Redistribution and use is allowed according to the terms of the
+# 2-clause BSD license.
+
+# Modified by Garth N. Wells <gnw20@cam.ac.uk> to add EIGEN_DIR to
+# search path
+
+if(NOT Eigen3_FIND_VERSION)
+  if(NOT Eigen3_FIND_VERSION_MAJOR)
+    set(Eigen3_FIND_VERSION_MAJOR 2)
+  endif(NOT Eigen3_FIND_VERSION_MAJOR)
+  if(NOT Eigen3_FIND_VERSION_MINOR)
+    set(Eigen3_FIND_VERSION_MINOR 91)
+  endif(NOT Eigen3_FIND_VERSION_MINOR)
+  if(NOT Eigen3_FIND_VERSION_PATCH)
+    set(Eigen3_FIND_VERSION_PATCH 0)
+  endif(NOT Eigen3_FIND_VERSION_PATCH)
+
+  set(Eigen3_FIND_VERSION "${Eigen3_FIND_VERSION_MAJOR}.${Eigen3_FIND_VERSION_MINOR}.${Eigen3_FIND_VERSION_PATCH}")
+endif(NOT Eigen3_FIND_VERSION)
+
+macro(_eigen3_check_version)
+  file(READ "${EIGEN3_INCLUDE_DIR}/Eigen/src/Core/util/Macros.h" _eigen3_version_header)
+
+  string(REGEX MATCH "define[ \t]+EIGEN_WORLD_VERSION[ \t]+([0-9]+)" _eigen3_world_version_match "${_eigen3_version_header}")
+  set(EIGEN3_WORLD_VERSION "${CMAKE_MATCH_1}")
+  string(REGEX MATCH "define[ \t]+EIGEN_MAJOR_VERSION[ \t]+([0-9]+)" _eigen3_major_version_match "${_eigen3_version_header}")
+  set(EIGEN3_MAJOR_VERSION "${CMAKE_MATCH_1}")
+  string(REGEX MATCH "define[ \t]+EIGEN_MINOR_VERSION[ \t]+([0-9]+)" _eigen3_minor_version_match "${_eigen3_version_header}")
+  set(EIGEN3_MINOR_VERSION "${CMAKE_MATCH_1}")
+
+  set(EIGEN3_VERSION ${EIGEN3_WORLD_VERSION}.${EIGEN3_MAJOR_VERSION}.${EIGEN3_MINOR_VERSION})
+  if(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+    set(EIGEN3_VERSION_OK FALSE)
+  else(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+    set(EIGEN3_VERSION_OK TRUE)
+  endif(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+
+  if(NOT EIGEN3_VERSION_OK)
+
+    message(STATUS "Eigen3 version ${EIGEN3_VERSION} found in ${EIGEN3_INCLUDE_DIR}, "
+                   "but at least version ${Eigen3_FIND_VERSION} is required")
+  endif(NOT EIGEN3_VERSION_OK)
+endmacro(_eigen3_check_version)
+
+if (EIGEN3_INCLUDE_DIR)
+
+  # in cache already
+  _eigen3_check_version()
+  set(EIGEN3_FOUND ${EIGEN3_VERSION_OK})
+
+else (EIGEN3_INCLUDE_DIR)
+
+  find_path(EIGEN3_INCLUDE_DIR NAMES signature_of_eigen3_matrix_library
+      PATHS
+      ${EIGEN_DIR}
+      $ENV{EIGEN_DIR}
+      ${CMAKE_INSTALL_PREFIX}/include
+      ${KDE4_INCLUDE_DIR}
+      PATH_SUFFIXES eigen3 eigen
+    )
+
+  if(EIGEN3_INCLUDE_DIR)
+    _eigen3_check_version()
+  endif(EIGEN3_INCLUDE_DIR)
+
+  include(FindPackageHandleStandardArgs)
+  find_package_handle_standard_args(Eigen3 DEFAULT_MSG EIGEN3_INCLUDE_DIR EIGEN3_VERSION_OK)
+
+  mark_as_advanced(EIGEN3_INCLUDE_DIR)
+
+endif(EIGEN3_INCLUDE_DIR)
+
diff --git a/cmake/modules/FindGMP.cmake b/cmake/modules/FindGMP.cmake
new file mode 100644
index 0000000..3face41
--- /dev/null
+++ b/cmake/modules/FindGMP.cmake
@@ -0,0 +1,87 @@
+# - Try to find the GMP librairies
+# Once done this will define
+#
+#  GMP_FOUND        - system has GMP lib
+#  GMP_INCLUDE_DIRS - include directories for GMP
+#  GMP_LIBRARIES    - libraries for GMP
+
+#=============================================================================
+# Copyright (c) 2006, Laurent Montel, <montel@kde.org>
+#
+# 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 copyright
+#    notice, this list of conditions and the following disclaimer.
+# 2. Redistributions in binary form must reproduce the 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 BY THE AUTHOR ``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.
+#=============================================================================
+
+if (GMP_INCLUDE_DIRS AND GMP_LIBRARIES)
+  # Already in cache, be silent
+  set(GMP_FIND_QUIETLY TRUE)
+endif (GMP_INCLUDE_DIRS AND GMP_LIBRARIES)
+
+find_path(GMP_INCLUDE_DIRS
+  NAMES gmp.h
+  HINTS ${GMP_DIR}/include $ENV{GMP_DIR}/include
+  DOC "Directory where the GMP header file is located"
+  )
+
+find_library(GMP_LIBRARIES
+  NAMES gmp libgmp
+  HINTS ${GMP_DIR}/lib $ENV{GMP_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The GMP libraries"
+  )
+find_library(GMP_LIBRARIES
+  NAMES gmp libgmp
+  DOC "The GMP libraries"
+  )
+
+find_library(GMPXX_LIBRARIES
+  NAMES gmpxx
+  HINTS ${GMP_DIR}/lib $ENV{GMP_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The GMPXX libraries"
+  )
+find_library(GMPXX_LIBRARIES
+  NAMES gmpxx
+  DOC "The GMPXX libraries"
+  )
+
+find_library(MPFR_LIBRARIES
+  NAMES mpfr
+  HINTS ${GMP_DIR}/lib $ENV{GMP_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The NPFR libraries"
+  )
+find_library(MPFR_LIBRARIES
+  NAMES mpfr
+  DOC "The NPFR libraries"
+  )
+
+set(GMP_LIBRARIES ${GMP_LIBRARIES} ${GMPXX_LIBRARIES} ${MPFR_LIBRARIES})
+message(STATUS "GMP_LIBRARIES = ${GMP_LIBRARIES}")
+
+mark_as_advanced(GMP_INCLUDE_DIRS GMP_LIBRARIES)
+
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(GMP DEFAULT_MSG GMP_LIBRARIES GMP_INCLUDE_DIRS)
+
+
diff --git a/cmake/modules/FindLAPACK.cmake b/cmake/modules/FindLAPACK.cmake
new file mode 100644
index 0000000..716ac1f
--- /dev/null
+++ b/cmake/modules/FindLAPACK.cmake
@@ -0,0 +1,350 @@
+# - Find LAPACK library
+# This module finds an installed fortran library that implements the LAPACK
+# linear-algebra interface (see http://www.netlib.org/lapack/).
+#
+# The approach follows that taken for the autoconf macro file, acx_lapack.m4
+# (distributed at http://ac-archive.sourceforge.net/ac-archive/acx_lapack.html).
+#
+# This module sets the following variables:
+#  LAPACK_FOUND - set to true if a library implementing the LAPACK interface
+#    is found
+#  LAPACK_LINKER_FLAGS - uncached list of required linker flags (excluding -l
+#    and -L).
+#  LAPACK_LIBRARIES - uncached list of libraries (using full path name) to
+#    link against to use LAPACK
+#  LAPACK95_LIBRARIES - uncached list of libraries (using full path name) to
+#    link against to use LAPACK95
+#  LAPACK95_FOUND - set to true if a library implementing the LAPACK f95
+#    interface is found
+#  BLA_STATIC  if set on this determines what kind of linkage we do (static)
+#  BLA_VENDOR  if set checks only the specified vendor, if not set checks
+#     all the possibilities
+#  BLA_F95     if set on tries to find the f95 interfaces for BLAS/LAPACK
+### List of vendors (BLA_VENDOR) valid in this module
+##  Intel(mkl), ACML,Apple, NAS, Generic
+
+#=============================================================================
+# Copyright 2007-2009 Kitware, 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 copyright
+#    notice, this list of conditions and the following disclaimer.
+# 2. Redistributions in binary form must reproduce the 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 BY THE AUTHOR ``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.
+#=============================================================================
+
+set(_lapack_ORIG_CMAKE_FIND_LIBRARY_SUFFIXES ${CMAKE_FIND_LIBRARY_SUFFIXES})
+
+get_property(_LANGUAGES_ GLOBAL PROPERTY ENABLED_LANGUAGES)
+if (NOT _LANGUAGES_ MATCHES Fortran OR NOT CMAKE_Fortran_COMPILER_WORKS)
+include(CheckFunctionExists)
+else (NOT _LANGUAGES_ MATCHES Fortran OR NOT CMAKE_Fortran_COMPILER_WORKS)
+include(CheckFortranFunctionExists)
+endif (NOT _LANGUAGES_ MATCHES Fortran OR NOT CMAKE_Fortran_COMPILER_WORKS)
+
+set(LAPACK_FOUND FALSE)
+set(LAPACK95_FOUND FALSE)
+
+# TODO: move this stuff to separate module
+
+macro(Check_Lapack_Libraries LIBRARIES _prefix _name _flags _list _blas _threads)
+# This macro checks for the existence of the combination of fortran libraries
+# given by _list.  If the combination is found, this macro checks (using the
+# Check_Fortran_Function_Exists macro) whether can link against that library
+# combination using the name of a routine given by _name using the linker
+# flags given by _flags.  If the combination of libraries is found and passes
+# the link test, LIBRARIES is set to the list of complete library paths that
+# have been found.  Otherwise, LIBRARIES is set to FALSE.
+
+# N.B. _prefix is the prefix applied to the names of all cached variables that
+# are generated internally and marked advanced by this macro.
+
+set(_libraries_work TRUE)
+set(${LIBRARIES})
+set(_combined_name)
+if (NOT _libdir)
+  if (WIN32)
+    set(_libdir ENV LIB)
+  elseif (APPLE)
+    set(_libdir /usr/local/lib /usr/lib /usr/local/lib64 /usr/lib64 ENV DYLD_LIBRARY_PATH)
+  else ()
+    set(_libdir /usr/local/lib /usr/lib /usr/local/lib64 /usr/lib64 ENV LD_LIBRARY_PATH)
+  endif ()
+endif ()
+foreach(_library ${_list})
+  set(_combined_name ${_combined_name}_${_library})
+
+  if(_libraries_work)
+    if (BLA_STATIC)
+      if (WIN32)
+        set(CMAKE_FIND_LIBRARY_SUFFIXES .lib ${CMAKE_FIND_LIBRARY_SUFFIXES})
+      endif ( WIN32 )
+      if (APPLE)
+        set(CMAKE_FIND_LIBRARY_SUFFIXES .lib ${CMAKE_FIND_LIBRARY_SUFFIXES})
+      else (APPLE)
+        set(CMAKE_FIND_LIBRARY_SUFFIXES .a ${CMAKE_FIND_LIBRARY_SUFFIXES})
+      endif (APPLE)
+    else (BLA_STATIC)
+      if (CMAKE_SYSTEM_NAME STREQUAL "Linux")
+        # for ubuntu's libblas3gf and liblapack3gf packages
+        #set(CMAKE_FIND_LIBRARY_SUFFIXES ${CMAKE_FIND_LIBRARY_SUFFIXES} .so.3gf)
+      endif ()
+    endif (BLA_STATIC)
+    find_library(${_prefix}_${_library}_LIBRARY
+      NAMES ${_library}
+      PATHS ${_libdir}
+      )
+    mark_as_advanced(${_prefix}_${_library}_LIBRARY)
+    set(${LIBRARIES} ${${LIBRARIES}} ${${_prefix}_${_library}_LIBRARY})
+    set(_libraries_work ${${_prefix}_${_library}_LIBRARY})
+  endif(_libraries_work)
+endforeach(_library ${_list})
+
+if(_libraries_work)
+  # Test this combination of libraries.
+  if(UNIX AND BLA_STATIC)
+    set(CMAKE_REQUIRED_LIBRARIES ${_flags} "-Wl,--start-group" ${${LIBRARIES}} ${_blas} "-Wl,--end-group" ${_threads})
+  else(UNIX AND BLA_STATIC)
+    set(CMAKE_REQUIRED_LIBRARIES ${_flags} ${${LIBRARIES}} ${_blas} ${_threads})
+  endif(UNIX AND BLA_STATIC)
+#  message("DEBUG: CMAKE_REQUIRED_LIBRARIES = ${CMAKE_REQUIRED_LIBRARIES}")
+  if (NOT _LANGUAGES_ MATCHES Fortran OR NOT CMAKE_Fortran_COMPILER_WORKS)
+    check_function_exists("${_name}_" ${_prefix}${_combined_name}_WORKS)
+  else (NOT _LANGUAGES_ MATCHES Fortran OR NOT CMAKE_Fortran_COMPILER_WORKS)
+    check_fortran_function_exists(${_name} ${_prefix}${_combined_name}_WORKS)
+  endif (NOT _LANGUAGES_ MATCHES Fortran OR NOT CMAKE_Fortran_COMPILER_WORKS)
+  set(CMAKE_REQUIRED_LIBRARIES)
+  mark_as_advanced(${_prefix}${_combined_name}_WORKS)
+  set(_libraries_work ${${_prefix}${_combined_name}_WORKS})
+  #message("DEBUG: ${LIBRARIES} = ${${LIBRARIES}}")
+endif(_libraries_work)
+
+ if(_libraries_work)
+   set(${LIBRARIES} ${${LIBRARIES}} ${_blas} ${_threads})
+ else(_libraries_work)
+    set(${LIBRARIES} FALSE)
+ endif(_libraries_work)
+
+endmacro(Check_Lapack_Libraries)
+
+
+set(LAPACK_LINKER_FLAGS)
+set(LAPACK_LIBRARIES)
+set(LAPACK95_LIBRARIES)
+
+
+if(LAPACK_FIND_QUIETLY OR NOT LAPACK_FIND_REQUIRED)
+  find_package(BLAS)
+else(LAPACK_FIND_QUIETLY OR NOT LAPACK_FIND_REQUIRED)
+  find_package(BLAS REQUIRED)
+endif(LAPACK_FIND_QUIETLY OR NOT LAPACK_FIND_REQUIRED)
+
+
+if(BLAS_FOUND)
+  set(LAPACK_LINKER_FLAGS ${BLAS_LINKER_FLAGS})
+  if ($ENV{BLA_VENDOR} MATCHES ".+")
+    set(BLA_VENDOR $ENV{BLA_VENDOR})
+  else ($ENV{BLA_VENDOR} MATCHES ".+")
+    if(NOT BLA_VENDOR)
+      set(BLA_VENDOR "All")
+    endif(NOT BLA_VENDOR)
+  endif ($ENV{BLA_VENDOR} MATCHES ".+")
+
+if (BLA_VENDOR STREQUAL "Goto" OR BLA_VENDOR STREQUAL "All")
+ if(NOT LAPACK_LIBRARIES)
+  check_lapack_libraries(
+  LAPACK_LIBRARIES
+  LAPACK
+  cheev
+  ""
+  "goto2"
+  "${BLAS_LIBRARIES}"
+  ""
+  )
+ endif(NOT LAPACK_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "Goto" OR BLA_VENDOR STREQUAL "All")
+
+
+#acml lapack
+ if (BLA_VENDOR MATCHES "ACML.*" OR BLA_VENDOR STREQUAL "All")
+   if (BLAS_LIBRARIES MATCHES ".+acml.+")
+     set (LAPACK_LIBRARIES ${BLAS_LIBRARIES})
+   endif ()
+ endif ()
+
+# Apple LAPACK library?
+if (BLA_VENDOR STREQUAL "Apple" OR BLA_VENDOR STREQUAL "All")
+ if(NOT LAPACK_LIBRARIES)
+  check_lapack_libraries(
+  LAPACK_LIBRARIES
+  LAPACK
+  cheev
+  ""
+  "Accelerate"
+  "${BLAS_LIBRARIES}"
+  ""
+  )
+ endif(NOT LAPACK_LIBRARIES)
+endif (BLA_VENDOR STREQUAL "Apple" OR BLA_VENDOR STREQUAL "All")
+if (BLA_VENDOR STREQUAL "NAS" OR BLA_VENDOR STREQUAL "All")
+  if ( NOT LAPACK_LIBRARIES )
+    check_lapack_libraries(
+    LAPACK_LIBRARIES
+    LAPACK
+    cheev
+    ""
+    "vecLib"
+    "${BLAS_LIBRARIES}"
+    ""
+    )
+  endif ( NOT LAPACK_LIBRARIES )
+endif (BLA_VENDOR STREQUAL "NAS" OR BLA_VENDOR STREQUAL "All")
+# Generic LAPACK library?
+if (BLA_VENDOR STREQUAL "Generic" OR
+    BLA_VENDOR STREQUAL "ATLAS" OR
+    BLA_VENDOR STREQUAL "All")
+  if ( NOT LAPACK_LIBRARIES )
+    check_lapack_libraries(
+    LAPACK_LIBRARIES
+    LAPACK
+    cheev
+    ""
+    "lapack"
+    "${BLAS_LIBRARIES}"
+    ""
+    )
+  endif ( NOT LAPACK_LIBRARIES )
+endif ()
+#intel lapack
+if (BLA_VENDOR MATCHES "Intel*" OR BLA_VENDOR STREQUAL "All")
+  if (NOT WIN32)
+    set(LM "-lm")
+  endif ()
+  if (_LANGUAGES_ MATCHES C OR _LANGUAGES_ MATCHES CXX)
+    if(LAPACK_FIND_QUIETLY OR NOT LAPACK_FIND_REQUIRED)
+      find_PACKAGE(Threads)
+    else(LAPACK_FIND_QUIETLY OR NOT LAPACK_FIND_REQUIRED)
+      find_package(Threads REQUIRED)
+    endif(LAPACK_FIND_QUIETLY OR NOT LAPACK_FIND_REQUIRED)
+    if (BLA_F95)
+      if(NOT LAPACK95_LIBRARIES)
+        # old
+        check_lapack_libraries(
+          LAPACK95_LIBRARIES
+          LAPACK
+          cheev
+          ""
+          "mkl_lapack95"
+          "${BLAS95_LIBRARIES}"
+          "${CMAKE_THREAD_LIBS_INIT};${LM}"
+          )
+      endif(NOT LAPACK95_LIBRARIES)
+      if(NOT LAPACK95_LIBRARIES)
+        # new >= 10.3
+        check_lapack_libraries(
+          LAPACK95_LIBRARIES
+          LAPACK
+          CHEEV
+          ""
+          "mkl_intel_lp64"
+          "${BLAS95_LIBRARIES}"
+          "${CMAKE_THREAD_LIBS_INIT};${LM}"
+          )
+      endif(NOT LAPACK95_LIBRARIES)
+    else(BLA_F95)
+      if(NOT LAPACK_LIBRARIES)
+        # old
+        check_lapack_libraries(
+          LAPACK_LIBRARIES
+          LAPACK
+          cheev
+          ""
+          "mkl_lapack"
+          "${BLAS_LIBRARIES}"
+          "${CMAKE_THREAD_LIBS_INIT};${LM}"
+          )
+      endif(NOT LAPACK_LIBRARIES)
+      if(NOT LAPACK_LIBRARIES)
+        # new >= 10.3
+        check_lapack_libraries(
+          LAPACK_LIBRARIES
+          LAPACK
+          cheev
+          ""
+          "mkl_gf_lp64"
+          "${BLAS_LIBRARIES}"
+          "${CMAKE_THREAD_LIBS_INIT};${LM}"
+          )
+      endif(NOT LAPACK_LIBRARIES)
+    endif(BLA_F95)
+  endif (_LANGUAGES_ MATCHES C OR _LANGUAGES_ MATCHES CXX)
+endif(BLA_VENDOR MATCHES "Intel*" OR BLA_VENDOR STREQUAL "All")
+else(BLAS_FOUND)
+  message(STATUS "LAPACK requires BLAS")
+endif(BLAS_FOUND)
+
+if(BLA_F95)
+ if(LAPACK95_LIBRARIES)
+  set(LAPACK95_FOUND TRUE)
+ else(LAPACK95_LIBRARIES)
+  set(LAPACK95_FOUND FALSE)
+ endif(LAPACK95_LIBRARIES)
+ if(NOT LAPACK_FIND_QUIETLY)
+  if(LAPACK95_FOUND)
+    message(STATUS "A library with LAPACK95 API found.")
+  else(LAPACK95_FOUND)
+    if(LAPACK_FIND_REQUIRED)
+      message(FATAL_ERROR
+      "A required library with LAPACK95 API not found. Please specify library location."
+      )
+    else(LAPACK_FIND_REQUIRED)
+      message(STATUS
+      "A library with LAPACK95 API not found. Please specify library location."
+      )
+    endif(LAPACK_FIND_REQUIRED)
+  endif(LAPACK95_FOUND)
+ endif(NOT LAPACK_FIND_QUIETLY)
+ set(LAPACK_FOUND "${LAPACK95_FOUND}")
+ set(LAPACK_LIBRARIES "${LAPACK95_LIBRARIES}")
+else(BLA_F95)
+ if(LAPACK_LIBRARIES)
+  set(LAPACK_FOUND TRUE)
+ else(LAPACK_LIBRARIES)
+  set(LAPACK_FOUND FALSE)
+ endif(LAPACK_LIBRARIES)
+
+ if(NOT LAPACK_FIND_QUIETLY)
+  if(LAPACK_FOUND)
+    message(STATUS "A library with LAPACK API found.")
+  else(LAPACK_FOUND)
+    if(LAPACK_FIND_REQUIRED)
+      message(FATAL_ERROR
+      "A required library with LAPACK API not found. Please specify library location."
+      )
+    else(LAPACK_FIND_REQUIRED)
+      message(STATUS
+      "A library with LAPACK API not found. Please specify library location."
+      )
+    endif(LAPACK_FIND_REQUIRED)
+  endif(LAPACK_FOUND)
+ endif(NOT LAPACK_FIND_QUIETLY)
+endif(BLA_F95)
+
+set(CMAKE_FIND_LIBRARY_SUFFIXES ${_lapack_ORIG_CMAKE_FIND_LIBRARY_SUFFIXES})
diff --git a/cmake/modules/FindMPI.cmake b/cmake/modules/FindMPI.cmake
new file mode 100644
index 0000000..2c657b2
--- /dev/null
+++ b/cmake/modules/FindMPI.cmake
@@ -0,0 +1,660 @@
+# - Find a Message Passing Interface (MPI) implementation
+# The Message Passing Interface (MPI) is a library used to write
+# high-performance distributed-memory parallel applications, and
+# is typically deployed on a cluster. MPI is a standard interface
+# (defined by the MPI forum) for which many implementations are
+# available. All of them have somewhat different include paths,
+# libraries to link against, etc., and this module tries to smooth
+# out those differences.
+#
+# === Variables ===
+#
+# This module will set the following variables per language in your project,
+# where <lang> is one of C, CXX, or Fortran:
+#   MPI_<lang>_FOUND           TRUE if FindMPI found MPI flags for <lang>
+#   MPI_<lang>_COMPILER        MPI Compiler wrapper for <lang>
+#   MPI_<lang>_COMPILE_FLAGS   Compilation flags for MPI programs
+#   MPI_<lang>_INCLUDE_PATH    Include path(s) for MPI header
+#   MPI_<lang>_LINK_FLAGS      Linking flags for MPI programs
+#   MPI_<lang>_LIBRARIES       All libraries to link MPI programs against
+# Additionally, FindMPI sets the following variables for running MPI
+# programs from the command line:
+#   MPIEXEC                    Executable for running MPI programs
+#   MPIEXEC_NUMPROC_FLAG       Flag to pass to MPIEXEC before giving
+#                              it the number of processors to run on
+#   MPIEXEC_PREFLAGS           Flags to pass to MPIEXEC directly
+#                              before the executable to run.
+#   MPIEXEC_POSTFLAGS          Flags to pass to MPIEXEC after other flags
+# === Usage ===
+#
+# To use this module, simply call FindMPI from a CMakeLists.txt file, or
+# run find_package(MPI), then run CMake.  If you are happy with the auto-
+# detected configuration for your language, then you're done.  If not, you
+# have two options:
+#   1. Set MPI_<lang>_COMPILER to the MPI wrapper (mpicc, etc.) of your
+#      choice and reconfigure.  FindMPI will attempt to determine all the
+#      necessary variables using THAT compiler's compile and link flags.
+#   2. If this fails, or if your MPI implementation does not come with
+#      a compiler wrapper, then set both MPI_<lang>_LIBRARIES and
+#      MPI_<lang>_INCLUDE_PATH.  You may also set any other variables
+#      listed above, but these two are required.  This will circumvent
+#      autodetection entirely.
+# When configuration is successful, MPI_<lang>_COMPILER will be set to the
+# compiler wrapper for <lang>, if it was found.  MPI_<lang>_FOUND and other
+# variables above will be set if any MPI implementation was found for <lang>,
+# regardless of whether a compiler was found.
+#
+# When using MPIEXEC to execute MPI applications, you should typically use
+# all of the MPIEXEC flags as follows:
+#   ${MPIEXEC} ${MPIEXEC_NUMPROC_FLAG} PROCS
+#     ${MPIEXEC_PREFLAGS} EXECUTABLE ${MPIEXEC_POSTFLAGS} ARGS
+# where PROCS is the number of processors on which to execute the program,
+# EXECUTABLE is the MPI program, and ARGS are the arguments to pass to the
+# MPI program.
+#
+# === Backward Compatibility ===
+#
+# For backward compatibility with older versions of FindMPI, these
+# variables are set, but deprecated:
+#   MPI_FOUND           MPI_COMPILER        MPI_LIBRARY
+#   MPI_COMPILE_FLAGS   MPI_INCLUDE_PATH    MPI_EXTRA_LIBRARY
+#   MPI_LINK_FLAGS      MPI_LIBRARIES
+# In new projects, please use the MPI_<lang>_XXX equivalents.
+
+#=============================================================================
+# Copyright 2001-2011 Kitware, Inc.
+# Copyright 2010-2011 Todd Gamblin tgamblin@llnl.gov
+# Copyright 2001-2009 Dave Partyka
+#
+# 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 copyright
+#    notice, this list of conditions and the following disclaimer.
+# 2. Redistributions in binary form must reproduce the 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 BY THE AUTHOR ``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.
+#=============================================================================
+
+# include this to handle the QUIETLY and REQUIRED arguments
+include(FindPackageHandleStandardArgs)
+include(GetPrerequisites)
+
+#
+# This part detects MPI compilers, attempting to wade through the mess of compiler names in
+# a sensible way.
+#
+# The compilers are detected in this order:
+#
+# 1. Try to find the most generic availble MPI compiler, as this is usually set up by
+#    cluster admins.  e.g., if plain old mpicc is available, we'll use it and assume it's
+#    the right compiler.
+#
+# 2. If a generic mpicc is NOT found, then we attempt to find one that matches
+#    CMAKE_<lang>_COMPILER_ID. e.g. if you are using XL compilers, we'll try to find mpixlc
+#    and company, but not mpiicc.  This hopefully prevents toolchain mismatches.
+#
+# If you want to force a particular MPI compiler other than what we autodetect (e.g. if you
+# want to compile regular stuff with GNU and parallel stuff with Intel), you can always set
+# your favorite MPI_<lang>_COMPILER explicitly and this stuff will be ignored.
+#
+
+# Start out with the generic MPI compiler names, as these are most commonly used.
+set(_MPI_C_COMPILER_NAMES                  mpicc    mpcc      mpicc_r mpcc_r)
+set(_MPI_CXX_COMPILER_NAMES                mpicxx   mpiCC     mpcxx   mpCC    mpic++   mpc++
+                                           mpicxx_r mpiCC_r   mpcxx_r mpCC_r  mpic++_r mpc++_r)
+set(_MPI_Fortran_COMPILER_NAMES            mpif95   mpif95_r  mpf95   mpf95_r
+                                           mpif90   mpif90_r  mpf90   mpf90_r
+                                           mpif77   mpif77_r  mpf77   mpf77_r)
+
+# GNU compiler names
+set(_MPI_GNU_C_COMPILER_NAMES              mpigcc mpgcc mpigcc_r mpgcc_r)
+set(_MPI_GNU_CXX_COMPILER_NAMES            mpig++ mpg++ mpig++_r mpg++_r)
+set(_MPI_GNU_Fortran_COMPILER_NAMES        mpigfortran mpgfortran mpigfortran_r mpgfortran_r
+                                           mpig77 mpig77_r mpg77 mpg77_r)
+
+# Intel MPI compiler names
+set(_MPI_Intel_C_COMPILER_NAMES            mpiicc)
+set(_MPI_Intel_CXX_COMPILER_NAMES          mpiicpc  mpiicxx mpiic++ mpiiCC)
+set(_MPI_Intel_Fortran_COMPILER_NAMES      mpiifort mpiif95 mpiif90 mpiif77)
+
+# PGI compiler names
+set(_MPI_PGI_C_COMPILER_NAMES              mpipgcc mppgcc)
+set(_MPI_PGI_CXX_COMPILER_NAMES            mpipgCC mppgCC)
+set(_MPI_PGI_Fortran_COMPILER_NAMES        mpipgf95 mpipgf90 mppgf95 mppgf90 mpipgf77 mppgf77)
+
+# XLC MPI Compiler names
+set(_MPI_XL_C_COMPILER_NAMES               mpxlc      mpxlc_r    mpixlc     mpixlc_r)
+set(_MPI_XL_CXX_COMPILER_NAMES             mpixlcxx   mpixlC     mpixlc++   mpxlcxx   mpxlc++   mpixlc++   mpxlCC
+                                           mpixlcxx_r mpixlC_r   mpixlc++_r mpxlcxx_r mpxlc++_r mpixlc++_r mpxlCC_r)
+set(_MPI_XL_Fortran_COMPILER_NAMES         mpixlf95   mpixlf95_r mpxlf95 mpxlf95_r
+                                           mpixlf90   mpixlf90_r mpxlf90 mpxlf90_r
+                                           mpixlf77   mpixlf77_r mpxlf77 mpxlf77_r
+                                           mpixlf     mpixlf_r   mpxlf   mpxlf_r)
+
+# append vendor-specific compilers to the list if we either don't know the compiler id,
+# or if we know it matches the regular compiler.
+foreach (lang C CXX Fortran)
+  foreach (id GNU Intel PGI XL)
+    if (NOT CMAKE_${lang}_COMPILER_ID OR "${CMAKE_${lang}_COMPILER_ID}" STREQUAL "${id}")
+      list(APPEND _MPI_${lang}_COMPILER_NAMES ${_MPI_${id}_${lang}_COMPILER_NAMES})
+    endif()
+    unset(_MPI_${id}_${lang}_COMPILER_NAMES)    # clean up the namespace here
+  endforeach()
+endforeach()
+
+
+# Names to try for MPI exec
+set(_MPI_EXEC_NAMES                        mpiexec mpirun lamexec srun)
+
+# Grab the path to MPI from the registry if we're on windows.
+set(_MPI_PREFIX_PATH)
+if(WIN32)
+  list(APPEND _MPI_PREFIX_PATH "[HKEY_LOCAL_MACHINE\\SOFTWARE\\MPICH\\SMPD;binary]/..")
+  list(APPEND _MPI_PREFIX_PATH "[HKEY_LOCAL_MACHINE\\SOFTWARE\\MPICH2;Path]")
+  list(APPEND _MPI_PREFIX_PATH "$ENV{ProgramW6432}/MPICH2/")
+endif()
+
+# Build a list of prefixes to search for MPI.
+foreach(SystemPrefixDir ${CMAKE_SYSTEM_PREFIX_PATH})
+  foreach(MpiPackageDir ${_MPI_PREFIX_PATH})
+    if(EXISTS ${SystemPrefixDir}/${MpiPackageDir})
+      list(APPEND _MPI_PREFIX_PATH "${SystemPrefixDir}/${MpiPackageDir}")
+    endif()
+  endforeach()
+endforeach()
+
+
+#
+# interrogate_mpi_compiler(lang try_libs)
+#
+# Attempts to extract compiler and linker args from an MPI compiler. The arguments set
+# by this function are:
+#
+#   MPI_<lang>_INCLUDE_PATH    MPI_<lang>_LINK_FLAGS     MPI_<lang>_FOUND
+#   MPI_<lang>_COMPILE_FLAGS   MPI_<lang>_LIBRARIES
+#
+# MPI_<lang>_COMPILER must be set beforehand to the absolute path to an MPI compiler for
+# <lang>.  Additionally, MPI_<lang>_INCLUDE_PATH and MPI_<lang>_LIBRARIES may be set
+# to skip autodetection.
+#
+# If try_libs is TRUE, this will also attempt to find plain MPI libraries in the usual
+# way.  In general, this is not as effective as interrogating the compilers, as it
+# ignores language-specific flags and libraries.  However, some MPI implementations
+# (Windows implementations) do not have compiler wrappers, so this approach must be used.
+#
+function (interrogate_mpi_compiler lang try_libs)
+  # MPI_${lang}_NO_INTERROGATE will be set to a compiler name when the *regular* compiler was
+  # discovered to be the MPI compiler.  This happens on machines like the Cray XE6 that use
+  # modules to set cc, CC, and ftn to the MPI compilers.  If the user force-sets another MPI
+  # compiler, MPI_${lang}_COMPILER won't be equal to MPI_${lang}_NO_INTERROGATE, and we'll
+  # inspect that compiler anew.  This allows users to set new compilers w/o rm'ing cache.
+  string(COMPARE NOTEQUAL "${MPI_${lang}_NO_INTERROGATE}" "${MPI_${lang}_COMPILER}" interrogate)
+
+  # If MPI is set already in the cache, don't bother with interrogating the compiler.
+  if (interrogate AND ((NOT MPI_${lang}_INCLUDE_PATH) OR (NOT MPI_${lang}_LIBRARIES)))
+    if (MPI_${lang}_COMPILER)
+      # Check whether the -showme:compile option works. This indicates that we have either OpenMPI
+      # or a newer version of LAM-MPI, and implies that -showme:link will also work.
+      execute_process(
+        COMMAND ${MPI_${lang}_COMPILER} -showme:compile
+        OUTPUT_VARIABLE  MPI_COMPILE_CMDLINE OUTPUT_STRIP_TRAILING_WHITESPACE
+        ERROR_VARIABLE   MPI_COMPILE_CMDLINE ERROR_STRIP_TRAILING_WHITESPACE
+        RESULT_VARIABLE  MPI_COMPILER_RETURN)
+
+      if (MPI_COMPILER_RETURN EQUAL 0)
+        # If we appear to have -showme:compile, then we should
+        # also have -showme:link. Try it.
+        execute_process(
+          COMMAND ${MPI_${lang}_COMPILER} -showme:link
+          OUTPUT_VARIABLE  MPI_LINK_CMDLINE OUTPUT_STRIP_TRAILING_WHITESPACE
+          ERROR_VARIABLE   MPI_LINK_CMDLINE ERROR_STRIP_TRAILING_WHITESPACE
+          RESULT_VARIABLE  MPI_COMPILER_RETURN)
+
+        if (MPI_COMPILER_RETURN EQUAL 0)
+          # We probably have -showme:incdirs and -showme:libdirs as well,
+          # so grab that while we're at it.
+          execute_process(
+            COMMAND ${MPI_${lang}_COMPILER} -showme:incdirs
+            OUTPUT_VARIABLE  MPI_INCDIRS OUTPUT_STRIP_TRAILING_WHITESPACE
+            ERROR_VARIABLE   MPI_INCDIRS ERROR_STRIP_TRAILING_WHITESPACE)
+
+          execute_process(
+            COMMAND ${MPI_${lang}_COMPILER} -showme:libdirs
+            OUTPUT_VARIABLE  MPI_LIBDIRS OUTPUT_STRIP_TRAILING_WHITESPACE
+            ERROR_VARIABLE   MPI_LIBDIRS ERROR_STRIP_TRAILING_WHITESPACE)
+
+        else()
+          # reset things here if something went wrong.
+          set(MPI_COMPILE_CMDLINE)
+          set(MPI_LINK_CMDLINE)
+        endif()
+      endif ()
+
+      # Older versions of LAM-MPI have "-showme". Try to find that.
+      if (NOT MPI_COMPILER_RETURN EQUAL 0)
+        execute_process(
+          COMMAND ${MPI_${lang}_COMPILER} -showme
+          OUTPUT_VARIABLE  MPI_COMPILE_CMDLINE OUTPUT_STRIP_TRAILING_WHITESPACE
+          ERROR_VARIABLE   MPI_COMPILE_CMDLINE ERROR_STRIP_TRAILING_WHITESPACE
+          RESULT_VARIABLE  MPI_COMPILER_RETURN)
+      endif()
+
+      # MVAPICH uses -compile-info and -link-info.  Try them.
+      if (NOT MPI_COMPILER_RETURN EQUAL 0)
+        execute_process(
+          COMMAND ${MPI_${lang}_COMPILER} -compile-info
+          OUTPUT_VARIABLE  MPI_COMPILE_CMDLINE OUTPUT_STRIP_TRAILING_WHITESPACE
+          ERROR_VARIABLE   MPI_COMPILE_CMDLINE ERROR_STRIP_TRAILING_WHITESPACE
+          RESULT_VARIABLE  MPI_COMPILER_RETURN)
+
+        # If we have compile-info, also have link-info.
+        if (MPI_COMPILER_RETURN EQUAL 0)
+          execute_process(
+            COMMAND ${MPI_${lang}_COMPILER} -link-info
+            OUTPUT_VARIABLE  MPI_LINK_CMDLINE OUTPUT_STRIP_TRAILING_WHITESPACE
+            ERROR_VARIABLE   MPI_LINK_CMDLINE ERROR_STRIP_TRAILING_WHITESPACE
+            RESULT_VARIABLE  MPI_COMPILER_RETURN)
+        endif()
+
+        # make sure we got compile and link.  Reset vars if something's wrong.
+        if (NOT MPI_COMPILER_RETURN EQUAL 0)
+          set(MPI_COMPILE_CMDLINE)
+          set(MPI_LINK_CMDLINE)
+        endif()
+      endif()
+
+      # MPICH just uses "-show". Try it.
+      if (NOT MPI_COMPILER_RETURN EQUAL 0)
+        execute_process(
+          COMMAND ${MPI_${lang}_COMPILER} -show
+          OUTPUT_VARIABLE  MPI_COMPILE_CMDLINE OUTPUT_STRIP_TRAILING_WHITESPACE
+          ERROR_VARIABLE   MPI_COMPILE_CMDLINE ERROR_STRIP_TRAILING_WHITESPACE
+          RESULT_VARIABLE  MPI_COMPILER_RETURN)
+      endif()
+
+      if (MPI_COMPILER_RETURN EQUAL 0)
+        # We have our command lines, but we might need to copy MPI_COMPILE_CMDLINE
+        # into MPI_LINK_CMDLINE, if we didn't find the link line.
+        if (NOT MPI_LINK_CMDLINE)
+          set(MPI_LINK_CMDLINE ${MPI_COMPILE_CMDLINE})
+        endif()
+      else()
+        message(STATUS "Unable to determine MPI from MPI driver ${MPI_${lang}_COMPILER}")
+        set(MPI_COMPILE_CMDLINE)
+        set(MPI_LINK_CMDLINE)
+      endif()
+
+      # Here, we're done with the interrogation part, and we'll try to extract args we care
+      # about from what we learned from the compiler wrapper scripts.
+
+      # If interrogation came back with something, extract our variable from the MPI command line
+      if (MPI_COMPILE_CMDLINE OR MPI_LINK_CMDLINE)
+        # Extract compile flags from the compile command line.
+        string(REGEX MATCHALL "(^| )-[Df]([^\" ]+|\"[^\"]+\")" MPI_ALL_COMPILE_FLAGS "${MPI_COMPILE_CMDLINE}")
+        set(MPI_COMPILE_FLAGS_WORK)
+
+        foreach(FLAG ${MPI_ALL_COMPILE_FLAGS})
+          if (MPI_COMPILE_FLAGS_WORK)
+            set(MPI_COMPILE_FLAGS_WORK "${MPI_COMPILE_FLAGS_WORK} ${FLAG}")
+          else()
+            set(MPI_COMPILE_FLAGS_WORK ${FLAG})
+          endif()
+        endforeach()
+
+        # Extract include paths from compile command line
+        string(REGEX MATCHALL "(^| )-I([^\" ]+|\"[^\"]+\")" MPI_ALL_INCLUDE_PATHS "${MPI_COMPILE_CMDLINE}")
+        foreach(IPATH ${MPI_ALL_INCLUDE_PATHS})
+          string(REGEX REPLACE "^ ?-I" "" IPATH ${IPATH})
+          string(REGEX REPLACE "//" "/" IPATH ${IPATH})
+          list(APPEND MPI_INCLUDE_PATH_WORK ${IPATH})
+        endforeach()
+
+        # try using showme:incdirs if extracting didn't work.
+        if (NOT MPI_INCLUDE_PATH_WORK)
+          set(MPI_INCLUDE_PATH_WORK ${MPI_INCDIRS})
+          separate_arguments(MPI_INCLUDE_PATH_WORK)
+        endif()
+
+        # If all else fails, just search for mpi.h in the normal include paths.
+        if (NOT MPI_INCLUDE_PATH_WORK)
+          set(MPI_HEADER_PATH "MPI_HEADER_PATH-NOTFOUND" CACHE FILEPATH "Cleared" FORCE)
+          find_path(MPI_HEADER_PATH mpi.h
+            HINTS ${_MPI_BASE_DIR} ${_MPI_PREFIX_PATH}
+            PATH_SUFFIXES include)
+          set(MPI_INCLUDE_PATH_WORK ${MPI_HEADER_PATH})
+        endif()
+
+        # Extract linker paths from the link command line
+        string(REGEX MATCHALL "(^| |-Wl,)-L([^\" ]+|\"[^\"]+\")" MPI_ALL_LINK_PATHS "${MPI_LINK_CMDLINE}")
+        set(MPI_LINK_PATH)
+        foreach(LPATH ${MPI_ALL_LINK_PATHS})
+          string(REGEX REPLACE "^(| |-Wl,)-L" "" LPATH ${LPATH})
+          string(REGEX REPLACE "//" "/" LPATH ${LPATH})
+          list(APPEND MPI_LINK_PATH ${LPATH})
+        endforeach()
+
+        # try using showme:libdirs if extracting didn't work.
+        if (NOT MPI_LINK_PATH)
+          set(MPI_LINK_PATH ${MPI_LIBDIRS})
+          separate_arguments(MPI_LINK_PATH)
+        endif()
+
+        # Extract linker flags from the link command line
+        string(REGEX MATCHALL "(^| )-Wl,([^\" ]+|\"[^\"]+\")" MPI_ALL_LINK_FLAGS "${MPI_LINK_CMDLINE}")
+        set(MPI_LINK_FLAGS_WORK)
+        foreach(FLAG ${MPI_ALL_LINK_FLAGS})
+          if (MPI_LINK_FLAGS_WORK)
+            set(MPI_LINK_FLAGS_WORK "${MPI_LINK_FLAGS_WORK} ${FLAG}")
+          else()
+            set(MPI_LINK_FLAGS_WORK ${FLAG})
+          endif()
+        endforeach()
+
+        # Extract the set of libraries to link against from the link command
+        # line
+        string(REGEX MATCHALL "(^| )-l([^\" ]+|\"[^\"]+\")" MPI_LIBNAMES "${MPI_LINK_CMDLINE}")
+        # add the compiler implicit directories because some compilers
+        # such as the intel compiler have libraries that show up
+        # in the showme list that can only be found in the implicit
+        # link directories of the compiler. Do this for C++ and C
+        # compilers if the implicit link directories are defined.
+        if (DEFINED CMAKE_CXX_IMPLICIT_LINK_DIRECTORIES)
+          set(MPI_LINK_PATH
+            "${MPI_LINK_PATH};${CMAKE_CXX_IMPLICIT_LINK_DIRECTORIES}")
+        endif ()
+
+        if (DEFINED CMAKE_C_IMPLICIT_LINK_DIRECTORIES)
+          set(MPI_LINK_PATH
+            "${MPI_LINK_PATH};${CMAKE_C_IMPLICIT_LINK_DIRECTORIES}")
+        endif ()
+
+        # Determine full path names for all of the libraries that one needs
+        # to link against in an MPI program
+        foreach(LIB ${MPI_LIBNAMES})
+          string(REGEX REPLACE "^ ?-l" "" LIB ${LIB})
+          # MPI_LIB is cached by find_library, but we don't want that.
+          # Clear it first.
+          set(MPI_LIB "MPI_LIB-NOTFOUND" CACHE FILEPATH "Cleared" FORCE)
+          find_library(MPI_LIB NAMES ${LIB}
+                       HINTS ${MPI_LINK_PATH}
+                       NO_DEFAULT_PATH
+                       )
+          find_library(MPI_LIB NAMES ${LIB})
+
+          if (MPI_LIB)
+            list(APPEND MPI_LIBRARIES_WORK ${MPI_LIB})
+          elseif (NOT MPI_FIND_QUIETLY)
+            message(WARNING "Unable to find MPI library ${LIB}")
+          endif()
+        endforeach()
+
+        # Sanity check MPI_LIBRARIES to make sure there are enough libraries
+        list(LENGTH MPI_LIBRARIES_WORK MPI_NUMLIBS)
+        list(LENGTH MPI_LIBNAMES MPI_NUMLIBS_EXPECTED)
+        if (NOT MPI_NUMLIBS EQUAL MPI_NUMLIBS_EXPECTED)
+          set(MPI_LIBRARIES_WORK "MPI_${lang}_LIBRARIES-NOTFOUND")
+        endif()
+      endif()
+
+    elseif(try_libs)
+      # If we didn't have an MPI compiler script to interrogate, attempt to find everything
+      # with plain old find functions.  This is nasty because MPI implementations have LOTS of
+      # different library names, so this section isn't going to be very generic.  We need to
+      # make sure it works for MS MPI, though, since there are no compiler wrappers for that.
+      find_path(MPI_HEADER_PATH mpi.h
+        HINTS ${_MPI_BASE_DIR} ${_MPI_PREFIX_PATH}
+        PATH_SUFFIXES include Inc)
+      set(MPI_INCLUDE_PATH_WORK ${MPI_HEADER_PATH})
+
+      # Decide between 32-bit and 64-bit libraries for Microsoft's MPI
+      if("${CMAKE_SIZEOF_VOID_P}" EQUAL 8)
+        set(MS_MPI_ARCH_DIR amd64)
+      else()
+        set(MS_MPI_ARCH_DIR i386)
+      endif()
+
+      set(MPI_LIB "MPI_LIB-NOTFOUND" CACHE FILEPATH "Cleared" FORCE)
+      find_library(MPI_LIB
+        NAMES         mpi mpich mpich2 msmpi
+        HINTS         ${_MPI_BASE_DIR} ${_MPI_PREFIX_PATH}
+        PATH_SUFFIXES lib lib/${MS_MPI_ARCH_DIR} Lib Lib/${MS_MPI_ARCH_DIR}
+        NO_DEFAULT_PATH
+        )
+      find_library(MPI_LIB
+        NAMES         mpi mpich mpich2 msmpi
+        )
+      set(MPI_LIBRARIES_WORK ${MPI_LIB})
+
+      # Right now, we only know about the extra libs for C++.
+      # We could add Fortran here (as there is usually libfmpich, etc.), but
+      # this really only has to work with MS MPI on Windows.
+      # Assume that other MPI's are covered by the compiler wrappers.
+      if (${lang} STREQUAL CXX)
+        set(MPI_LIB "MPI_LIB-NOTFOUND" CACHE FILEPATH "Cleared" FORCE)
+        find_library(MPI_LIB
+          NAMES         mpi++ mpicxx cxx mpi_cxx
+          HINTS         ${_MPI_BASE_DIR} ${_MPI_PREFIX_PATH}
+          PATH_SUFFIXES lib
+          NO_DEFAULT_PATH
+          )
+        find_library(MPI_LIB
+          NAMES         mpi++ mpicxx cxx mpi_cxx
+          )
+        if (MPI_LIBRARIES_WORK AND MPI_LIB)
+          list(APPEND MPI_LIBRARIES_WORK ${MPI_LIB})
+        endif()
+      endif()
+
+      if (NOT MPI_LIBRARIES_WORK)
+        set(MPI_LIBRARIES_WORK "MPI_${lang}_LIBRARIES-NOTFOUND")
+      endif()
+    endif()
+
+    # If we found MPI, set up all of the appropriate cache entries
+    set(MPI_${lang}_COMPILE_FLAGS ${MPI_COMPILE_FLAGS_WORK} CACHE STRING "MPI ${lang} compilation flags"         FORCE)
+    set(MPI_${lang}_INCLUDE_PATH  ${MPI_INCLUDE_PATH_WORK}  CACHE STRING "MPI ${lang} include path"              FORCE)
+    set(MPI_${lang}_LINK_FLAGS    ${MPI_LINK_FLAGS_WORK}    CACHE STRING "MPI ${lang} linking flags"             FORCE)
+    set(MPI_${lang}_LIBRARIES     ${MPI_LIBRARIES_WORK}     CACHE STRING "MPI ${lang} libraries to link against" FORCE)
+    mark_as_advanced(MPI_${lang}_COMPILE_FLAGS MPI_${lang}_INCLUDE_PATH MPI_${lang}_LINK_FLAGS MPI_${lang}_LIBRARIES)
+
+    # clear out our temporary lib/header detectionv variable here.
+    set(MPI_LIB         "MPI_LIB-NOTFOUND"         CACHE INTERNAL "Scratch variable for MPI lib detection"    FORCE)
+    set(MPI_HEADER_PATH "MPI_HEADER_PATH-NOTFOUND" CACHE INTERNAL "Scratch variable for MPI header detection" FORCE)
+  endif()
+
+  # finally set a found variable for each MPI language
+  if (MPI_${lang}_INCLUDE_PATH AND MPI_${lang}_LIBRARIES)
+    set(MPI_${lang}_FOUND TRUE PARENT_SCOPE)
+  else()
+    set(MPI_${lang}_FOUND FALSE PARENT_SCOPE)
+  endif()
+endfunction()
+
+
+# This function attempts to compile with the regular compiler, to see if MPI programs
+# work with it.  This is a last ditch attempt after we've tried interrogating mpicc and
+# friends, and after we've tried to find generic libraries.  Works on machines like
+# Cray XE6, where the modules environment changes what MPI version cc, CC, and ftn use.
+function(try_regular_compiler lang success)
+  set(scratch_directory ${CMAKE_CURRENT_BINARY_DIR}${CMAKE_FILES_DIRECTORY})
+  if (${lang} STREQUAL Fortran)
+    set(test_file ${scratch_directory}/cmake_mpi_test.f90)
+    file(WRITE ${test_file}
+      "program hello\n"
+      "include 'mpif.h'\n"
+      "integer ierror\n"
+      "call MPI_INIT(ierror)\n"
+      "call MPI_FINALIZE(ierror)\n"
+      "end\n")
+  else()
+    if (${lang} STREQUAL CXX)
+      set(test_file ${scratch_directory}/cmake_mpi_test.cpp)
+    else()
+      set(test_file ${scratch_directory}/cmake_mpi_test.c)
+    endif()
+    file(WRITE ${test_file}
+      "#include <mpi.h>\n"
+      "int main(int argc, char **argv) {\n"
+      "  MPI_Init(&argc, &argv);\n"
+      "  MPI_Finalize();\n"
+      "}\n")
+  endif()
+  try_compile(compiler_has_mpi ${scratch_directory} ${test_file})
+  if (compiler_has_mpi)
+    set(MPI_${lang}_NO_INTERROGATE ${CMAKE_${lang}_COMPILER} CACHE STRING "Whether to interrogate MPI ${lang} compiler" FORCE)
+    set(MPI_${lang}_COMPILER       ${CMAKE_${lang}_COMPILER} CACHE STRING "MPI ${lang} compiler"                        FORCE)
+    set(MPI_${lang}_COMPILE_FLAGS  ""                        CACHE STRING "MPI ${lang} compilation flags"               FORCE)
+    set(MPI_${lang}_INCLUDE_PATH   ""                        CACHE STRING "MPI ${lang} include path"                    FORCE)
+    set(MPI_${lang}_LINK_FLAGS     ""                        CACHE STRING "MPI ${lang} linking flags"                   FORCE)
+    set(MPI_${lang}_LIBRARIES      ""                        CACHE STRING "MPI ${lang} libraries to link against"       FORCE)
+  endif()
+  set(${success} ${compiler_has_mpi} PARENT_SCOPE)
+  unset(compiler_has_mpi CACHE)
+endfunction()
+
+# End definitions, commence real work here.
+
+# Most mpi distros have some form of mpiexec which gives us something we can reliably look for.
+find_program(MPIEXEC
+  NAMES ${_MPI_EXEC_NAMES}
+  PATHS ${_MPI_PREFIX_PATH}
+  PATH_SUFFIXES bin
+  DOC "Executable for running MPI programs.")
+
+# call get_filename_component twice to remove mpiexec and the directory it exists in (typically bin).
+# This gives us a fairly reliable base directory to search for /bin /lib and /include from.
+get_filename_component(_MPI_BASE_DIR "${MPIEXEC}" PATH)
+get_filename_component(_MPI_BASE_DIR "${_MPI_BASE_DIR}" PATH)
+
+set(MPIEXEC_NUMPROC_FLAG "-np" CACHE STRING "Flag used by MPI to specify the number of processes for MPIEXEC; the next option will be the number of processes.")
+set(MPIEXEC_PREFLAGS     ""    CACHE STRING "These flags will be directly before the executable that is being run by MPIEXEC.")
+set(MPIEXEC_POSTFLAGS    ""    CACHE STRING "These flags will come after all flags given to MPIEXEC.")
+set(MPIEXEC_MAX_NUMPROCS "2"   CACHE STRING "Maximum number of processors available to run MPI applications.")
+mark_as_advanced(MPIEXEC MPIEXEC_NUMPROC_FLAG MPIEXEC_PREFLAGS MPIEXEC_POSTFLAGS MPIEXEC_MAX_NUMPROCS)
+
+
+#=============================================================================
+# Backward compatibility input hacks.  Propagate the FindMPI hints to C and
+# CXX if the respective new versions are not defined.  Translate the old
+# MPI_LIBRARY and MPI_EXTRA_LIBRARY to respective MPI_${lang}_LIBRARIES.
+#
+# Once we find the new variables, we translate them back into their old
+# equivalents below.
+foreach (lang C CXX)
+  # Old input variables.
+  set(_MPI_OLD_INPUT_VARS COMPILER COMPILE_FLAGS INCLUDE_PATH LINK_FLAGS)
+
+  # Set new vars based on their old equivalents, if the new versions are not already set.
+  foreach (var ${_MPI_OLD_INPUT_VARS})
+    if (NOT MPI_${lang}_${var} AND MPI_${var})
+      set(MPI_${lang}_${var} "${MPI_${var}}")
+    endif()
+  endforeach()
+
+  # Special handling for MPI_LIBRARY and MPI_EXTRA_LIBRARY, which we nixed in the
+  # new FindMPI.  These need to be merged into MPI_<lang>_LIBRARIES
+  if (NOT MPI_${lang}_LIBRARIES AND (MPI_LIBRARY OR MPI_EXTRA_LIBRARY))
+    set(MPI_${lang}_LIBRARIES ${MPI_LIBRARY} ${MPI_EXTRA_LIBRARY})
+  endif()
+endforeach()
+#=============================================================================
+
+
+# This loop finds the compilers and sends them off for interrogation.
+foreach (lang C CXX Fortran)
+  if (CMAKE_${lang}_COMPILER_WORKS)
+    # If the user supplies a compiler *name* instead of an absolute path, assume that we need to find THAT compiler.
+    if (MPI_${lang}_COMPILER)
+      is_file_executable(MPI_${lang}_COMPILER MPI_COMPILER_IS_EXECUTABLE)
+      if (NOT MPI_COMPILER_IS_EXECUTABLE)
+        # Get rid of our default list of names and just search for the name the user wants.
+        set(_MPI_${lang}_COMPILER_NAMES ${MPI_${lang}_COMPILER})
+        set(MPI_${lang}_COMPILER "MPI_${lang}_COMPILER-NOTFOUND" CACHE FILEPATH "Cleared" FORCE)
+        # If the user specifies a compiler, we don't want to try to search libraries either.
+        set(try_libs FALSE)
+      endif()
+    else()
+      set(try_libs TRUE)
+    endif()
+
+    find_program(MPI_${lang}_COMPILER
+      NAMES  ${_MPI_${lang}_COMPILER_NAMES}
+      PATHS  "${MPI_HOME}/bin" "$ENV{MPI_HOME}/bin" ${_MPI_PREFIX_PATH})
+    interrogate_mpi_compiler(${lang} ${try_libs})
+    mark_as_advanced(MPI_${lang}_COMPILER)
+
+    # last ditch try -- if nothing works so far, just try running the regular compiler and
+    # see if we can create an MPI executable.
+    set(regular_compiler_worked 0)
+    if (NOT MPI_${lang}_LIBRARIES OR NOT MPI_${lang}_INCLUDE_PATH)
+      try_regular_compiler(${lang} regular_compiler_worked)
+    endif()
+
+    if (regular_compiler_worked)
+      find_package_handle_standard_args(MPI_${lang} DEFAULT_MSG MPI_${lang}_COMPILER)
+    else()
+      find_package_handle_standard_args(MPI_${lang} DEFAULT_MSG MPI_${lang}_LIBRARIES MPI_${lang}_INCLUDE_PATH)
+    endif()
+  endif()
+endforeach()
+
+
+#=============================================================================
+# More backward compatibility stuff
+#
+# Bare MPI sans ${lang} vars are set to CXX then C, depending on what was found.
+# This mimics the behavior of the old language-oblivious FindMPI.
+set(_MPI_OLD_VARS FOUND COMPILER INCLUDE_PATH COMPILE_FLAGS LINK_FLAGS LIBRARIES)
+if (MPI_CXX_FOUND)
+  foreach (var ${_MPI_OLD_VARS})
+    set(MPI_${var} ${MPI_CXX_${var}})
+  endforeach()
+elseif (MPI_C_FOUND)
+  foreach (var ${_MPI_OLD_VARS})
+    set(MPI_${var} ${MPI_C_${var}})
+  endforeach()
+else()
+  # Note that we might still have found Fortran, but you'll need to use MPI_Fortran_FOUND
+  set(MPI_FOUND FALSE)
+endif()
+
+# Chop MPI_LIBRARIES into the old-style MPI_LIBRARY and MPI_EXTRA_LIBRARY, and set them in cache.
+if (MPI_LIBRARIES)
+  list(GET MPI_LIBRARIES 0 MPI_LIBRARY_WORK)
+  set(MPI_LIBRARY ${MPI_LIBRARY_WORK} CACHE FILEPATH "MPI library to link against" FORCE)
+else()
+  set(MPI_LIBRARY "MPI_LIBRARY-NOTFOUND" CACHE FILEPATH "MPI library to link against" FORCE)
+endif()
+
+list(LENGTH MPI_LIBRARIES MPI_NUMLIBS)
+if (MPI_NUMLIBS GREATER 1)
+  set(MPI_EXTRA_LIBRARY_WORK ${MPI_LIBRARIES})
+  list(REMOVE_AT MPI_EXTRA_LIBRARY_WORK 0)
+  set(MPI_EXTRA_LIBRARY ${MPI_EXTRA_LIBRARY_WORK} CACHE STRING "Extra MPI libraries to link against" FORCE)
+else()
+  set(MPI_EXTRA_LIBRARY "MPI_EXTRA_LIBRARY-NOTFOUND" CACHE STRING "Extra MPI libraries to link against" FORCE)
+endif()
+#=============================================================================
+
+# unset these vars to cleanup namespace
+unset(_MPI_OLD_VARS)
+unset(_MPI_PREFIX_PATH)
+unset(_MPI_BASE_DIR)
+foreach (lang C CXX Fortran)
+  unset(_MPI_${lang}_COMPILER_NAMES)
+endforeach()
diff --git a/cmake/modules/FindMTL4.cmake b/cmake/modules/FindMTL4.cmake
new file mode 100644
index 0000000..2ce4273
--- /dev/null
+++ b/cmake/modules/FindMTL4.cmake
@@ -0,0 +1,88 @@
+# - Try to find MTL4
+# Once done this will define
+#
+#  MTL4_FOUND        - system has MTL4
+#  MTL4_INCLUDE_DIRS - include directories for MTL4
+#  MTL4_LIBRARIES    - libaries defintions for MTL4
+#  MTL4_DEFINITIONS  - compiler defintions for MTL4
+
+#=============================================================================
+# Copyright (C) 2010-2011 Garth N. Wells, Anders Logg and Johannes Ring
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+message(STATUS "Checking for package 'MTL4'")
+
+# Check for header file
+find_path(MTL4_INCLUDE_DIRS boost/numeric/mtl/mtl.hpp
+  HINTS ${MTL4_DIR} $ENV{MTL4_DIR}
+  PATH_SUFFIXES include
+  DOC "Directory where the MTL4 header is located"
+  )
+
+# Check for BLAS and enable if found
+find_package(BLAS QUIET)
+if (BLAS_FOUND)
+  set(MTL4_LIBRARIES ${BLAS_LIBRARIES})
+  set(MTL4_DEFINITIONS "-DMTL_HAS_BLAS")
+endif()
+
+# Try compiling and running test program
+if (DOLFIN_SKIP_BUILD_TESTS)
+  set(MTL4_TEST_RUNS TRUE)
+elseif (MTL4_INCLUDE_DIRS)
+
+  # Find Boost, needed by MTL4
+  set(BOOST_ROOT $ENV{BOOST_DIR})
+  set(Boost_ADDITIONAL_VERSIONS 1.43 1.43.0)
+  find_package(Boost REQUIRED)
+
+  # Set flags for building test program
+  set(CMAKE_REQUIRED_INCLUDES  ${MTL4_INCLUDE_DIRS} ${Boost_INCLUDE_DIR})
+  set(CMAKE_REQUIRED_LIBRARIES ${MTL4_LIBRARIES})
+  set(CMAKE_REQUIRED_FLAGS ${MTL4_DEFINITIONS})
+
+  # Build and run test program
+  include(CheckCXXSourceRuns)
+  check_cxx_source_runs("
+#include <iostream>
+#include <boost/numeric/mtl/mtl.hpp>
+int main()
+{
+  mtl::dense_vector<double> x(10);
+  int size = mtl::num_rows(x);
+  return 0;
+}
+" MTL4_TEST_RUNS)
+
+endif()
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(MTL4
+  "MTL4 could not be found. Be sure to set MTL4_DIR"
+  MTL4_INCLUDE_DIRS MTL4_TEST_RUNS)
diff --git a/cmake/modules/FindNumPy.cmake b/cmake/modules/FindNumPy.cmake
new file mode 100644
index 0000000..ff8c019
--- /dev/null
+++ b/cmake/modules/FindNumPy.cmake
@@ -0,0 +1,80 @@
+# - Find NumPy
+# Find the native NumPy includes
+# This module defines
+#  NUMPY_INCLUDE_DIR, where to find numpy/arrayobject.h, etc.
+#  NUMPY_VERSION, The string version of the numpy version
+#  NUMPY_VERSION_MAJOR, The first number of the numpy version
+#  NUMPY_VERSION_MINOR, The second number of the numpy version
+#  NUMPY_VERSION_MICRO, The third number of the numpy version
+#  NUMPY_FOUND, If false, do not try to use NumPy headers.
+
+#=============================================================================
+# Copyright (C) 2010 Johannes Ring
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+if(NUMPY_INCLUDE_DIR)
+  # in cache already
+  set(NUMPY_FIND_QUIETLY TRUE)
+endif(NUMPY_INCLUDE_DIR)
+
+execute_process(
+  COMMAND ${PYTHON_EXECUTABLE} -c "import numpy; print numpy.get_include()"
+  OUTPUT_VARIABLE NUMPY_INCLUDE_DIR
+  RESULT_VARIABLE NUMPY_NOT_FOUND
+  OUTPUT_STRIP_TRAILING_WHITESPACE
+  )
+
+if(NUMPY_INCLUDE_DIR)
+  set(NUMPY_FOUND TRUE)
+  set(NUMPY_INCLUDE_DIR ${NUMPY_INCLUDE_DIR} CACHE STRING "NumPy include path")
+else(NUMPY_INCLUDE_DIR)
+  set(NUMPY_FOUND FALSE)
+endif(NUMPY_INCLUDE_DIR)
+
+if(NUMPY_FOUND)
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} -c "import numpy; print numpy.version.version"
+    OUTPUT_VARIABLE NUMPY_VERSION
+    RESULT_VARIABLE NUMPY_NOT_FOUND
+    OUTPUT_STRIP_TRAILING_WHITESPACE
+    )
+  string(REPLACE "." ";" NUMPY_VERSION_LIST ${NUMPY_VERSION})
+  list(GET NUMPY_VERSION_LIST 0 NUMPY_VERSION_MAJOR)
+  list(GET NUMPY_VERSION_LIST 1 NUMPY_VERSION_MINOR)
+  list(GET NUMPY_VERSION_LIST 2 NUMPY_VERSION_MICRO)
+  if(NOT NUMPY_FIND_QUIETLY)
+    message(STATUS "NumPy header version ${NUMPY_VERSION} found")
+  endif(NOT NUMPY_FIND_QUIETLY)
+else(NUMPY_FOUND)
+  if(NUMPY_FIND_REQUIRED)
+    message(FATAL_ERROR "NumPy headers missing")
+  endif(NUMPY_FIND_REQUIRED)
+endif(NUMPY_FOUND)
+
+mark_as_advanced(NUMPY_INCLUDE_DIR, NUMPY_VERSION, NUMPY_VERSION_MAJOR, 
+  NUMPY_VERSION_MINOR, NUMPY_VERSION_MICRO)
diff --git a/cmake/modules/FindPETSc.cmake b/cmake/modules/FindPETSc.cmake
new file mode 100644
index 0000000..d1399bf
--- /dev/null
+++ b/cmake/modules/FindPETSc.cmake
@@ -0,0 +1,363 @@
+# - Try to find PETSc
+# Once done this will define
+#
+#  PETSC_FOUND        - system has PETSc
+#  PETSC_INCLUDE_DIRS - include directories for PETSc
+#  PETSC_LIBRARIES    - libraries for PETSc
+#  PETSC_DIR          - directory where PETSc is built
+#  PETSC_ARCH         - architecture for which PETSc is built
+#  PETSC_CUSP_FOUND   - PETSc has Cusp support
+#  PETSC_VERSION      - version for PETSc
+#  PETSC_VERSION_MAJOR - First number in PETSC_VERSION
+#  PETSC_VERSION_MINOR - Second number in PETSC_VERSION
+#  PETSC_VERSION_SUBMINOR - Third number in PETSC_VERSION
+#
+# This config script is (very loosley) based on a PETSc CMake script by Jed Brown.
+
+#=============================================================================
+# Copyright (C) 2010-2012 Garth N. Wells, Anders Logg and Johannes Ring
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+# NOTE: The PETSc Makefile returns a bunch of libraries with '-L' and '-l',
+# wheres we would prefer complete paths. For a discussion, see
+# http://www.cmake.org/Wiki/CMake:Improving_Find*_Modules#Current_workarounds
+
+message(STATUS "Checking for package 'PETSc'")
+
+# Set debian_arches (PETSC_ARCH for Debian-style installations)
+foreach (debian_arches linux kfreebsd)
+  if ("${CMAKE_BUILD_TYPE}" STREQUAL "Debug")
+    set(DEBIAN_FLAVORS ${debian_arches}-gnu-c-debug ${debian_arches}-gnu-c-opt ${DEBIAN_FLAVORS})
+  else()
+    set(DEBIAN_FLAVORS ${debian_arches}-gnu-c-opt ${debian_arches}-gnu-c-debug ${DEBIAN_FLAVORS})
+  endif()
+endforeach()
+
+# List of possible locations for PETSC_DIR
+set(petsc_dir_locations "")
+list(APPEND petsc_dir_locations "/usr/lib/petscdir/3.4.2")    # Debian location
+list(APPEND petsc_dir_locations "/usr/lib/petscdir/3.2")    # Debian location
+list(APPEND petsc_dir_locations "/usr/lib/petscdir/3.1")    # Debian location
+list(APPEND petsc_dir_locations "/usr/lib/petscdir/3.0.0")  # Debian location
+list(APPEND petsc_dir_locations "/opt/local/lib/petsc")     # Macports location
+list(APPEND petsc_dir_locations "/usr/local/lib/petsc")     # User location
+list(APPEND petsc_dir_locations "$ENV{HOME}/petsc")         # User location
+
+# Add other possible locations for PETSC_DIR
+set(_SYSTEM_LIB_PATHS "${CMAKE_SYSTEM_LIBRARY_PATH};${CMAKE_PLATFORM_IMPLICIT_LINK_DIRECTORIES}")
+string(REGEX REPLACE ":" ";" libdirs ${_SYSTEM_LIB_PATHS})
+foreach (libdir ${libdirs})
+  get_filename_component(petsc_dir_location "${libdir}/" PATH)
+  list(APPEND petsc_dir_locations ${petsc_dir_location})
+endforeach()
+
+# Try to figure out PETSC_DIR by finding petsc.h
+find_path(PETSC_DIR include/petsc.h
+  HINTS ${PETSC_DIR} $ENV{PETSC_DIR}
+  PATHS ${petsc_dir_locations}
+  DOC "PETSc directory")
+
+# Report result of search for PETSC_DIR
+if (DEFINED PETSC_DIR)
+  message(STATUS "PETSC_DIR is ${PETSC_DIR}")
+else()
+  message(STATUS "PETSC_DIR is empty")
+endif()
+
+# Try to figure out PETSC_ARCH if not set
+if (PETSC_DIR AND NOT PETSC_ARCH)
+  set(_petsc_arches
+    $ENV{PETSC_ARCH}   # If set, use environment variable first
+    ${DEBIAN_FLAVORS}  # Debian defaults
+    x86_64-unknown-linux-gnu i386-unknown-linux-gnu)
+  set(petscconf "NOTFOUND" CACHE FILEPATH "Cleared" FORCE)
+  foreach (arch ${_petsc_arches})
+    if (NOT PETSC_ARCH)
+      find_path(petscconf petscconf.h
+      HINTS ${PETSC_DIR}
+      PATH_SUFFIXES ${arch}/include bmake/${arch}
+      NO_DEFAULT_PATH)
+      if (petscconf)
+        set(PETSC_ARCH "${arch}" CACHE STRING "PETSc build architecture")
+      endif()
+    endif()
+  endforeach()
+  set(petscconf "NOTFOUND" CACHE INTERNAL "Scratch variable" FORCE)
+endif()
+
+# Report result of search for PETSC_ARCH
+if (DEFINED PETSC_ARCH)
+  message(STATUS "PETSC_ARCH is ${PETSC_ARCH}")
+else()
+  message(STATUS "PETSC_ARCH is empty")
+endif()
+
+# Look for petscconf.h
+if (EXISTS ${PETSC_DIR}/${PETSC_ARCH}/include/petscconf.h)
+  message(STATUS "Found petscconf.h")
+  set(FOUND_PETSC_CONF 1)
+else()
+  message(STATUS "Unable to find petscconf.h")
+endif()
+
+# Get variables from PETSc configuration
+if (FOUND_PETSC_CONF)
+
+  # Create a temporary Makefile to probe the PETSc configuration
+  set(petsc_config_makefile ${PROJECT_BINARY_DIR}/Makefile.petsc)
+  file(WRITE ${petsc_config_makefile}
+"# This file was autogenerated by FindPETSc.cmake
+PETSC_DIR  = ${PETSC_DIR}
+PETSC_ARCH = ${PETSC_ARCH}
+include ${PETSC_DIR}/conf/variables
+show :
+	-@echo -n \${\${VARIABLE}}
+")
+
+  # Define macro for getting PETSc variables from Makefile
+  macro(PETSC_GET_VARIABLE var name)
+    set(${var} "NOTFOUND" CACHE INTERNAL "Cleared" FORCE)
+    execute_process(COMMAND ${CMAKE_MAKE_PROGRAM} --no-print-directory -f ${petsc_config_makefile} show VARIABLE=${name}
+      OUTPUT_VARIABLE ${var}
+      RESULT_VARIABLE petsc_return)
+  endmacro()
+
+  # Call macro to get the PETSc variables
+  petsc_get_variable(PETSC_INCLUDE PETSC_INCLUDE)          # 3.1
+  petsc_get_variable(PETSC_CC_INCLUDES PETSC_CC_INCLUDES)  # dev
+  set(PETSC_INCLUDE ${PETSC_INCLUDE} ${PETSC_CC_INCLUDES})
+  petsc_get_variable(PETSC_LIB_BASIC PETSC_LIB_BASIC)
+  petsc_get_variable(PETSC_LIB_DIR PETSC_LIB_DIR)
+  set(PETSC_LIB "-L${PETSC_LIB_DIR} ${PETSC_LIB_BASIC}")
+
+  # Call macro to get the PETSc 3rd-party libraries
+  petsc_get_variable(PETSC_EXTERNAL_LIB_BASIC PETSC_EXTERNAL_LIB_BASIC)
+
+  # Extract include paths and libraries from compile command line
+  include(ResolveCompilerPaths)
+  resolve_includes(PETSC_INCLUDE_DIRS "${PETSC_INCLUDE}")
+  resolve_libraries(PETSC_LIBRARIES "${PETSC_LIB}")
+  resolve_libraries(PETSC_EXTERNAL_LIBRARIES "${PETSC_EXTERNAL_LIB_BASIC}")
+
+  # Add some extra libraries on OSX
+  if (APPLE)
+
+    # CMake will have troubel finding the gfortan libraries if compiling
+    # with clang (the libs may be required by 3rd party Fortran libraries)
+    find_program(GFORTRAN_EXECUTABLE gfortran)
+    if (GFORTRAN_EXECUTABLE)
+      execute_process(COMMAND ${GFORTRAN_EXECUTABLE} -print-file-name=libgfortran.dylib
+      OUTPUT_VARIABLE GFORTRAN_LIBRARY
+      OUTPUT_STRIP_TRAILING_WHITESPACE)
+
+      if (EXISTS "${GFORTRAN_LIBRARY}")
+        list(APPEND PETSC_EXTERNAL_LIBRARIES ${GFORTRAN_LIBRARY})
+      endif()
+    endif()
+
+    find_package(X11)
+    list(APPEND PETSC_INCLUDE_DIRS ${X11_X11_INCLUDE_PATH})
+    list(APPEND PETSC_EXTERNAL_LIBRARIES ${X11_LIBRARIES})
+
+    # ResolveCompilerPaths strips OSX frameworks, so add BLAS here for OSX
+    petsc_get_variable(PETSC_BLASLAPACK_LIB BLASLAPACK_LIB)
+    list(APPEND PETSC_EXTERNAL_LIBRARIES ${PETSC_BLASLAPACK_LIB})
+
+  endif()
+
+  # Remove temporary Makefile
+  file(REMOVE ${petsc_config_makefile})
+
+  # Add variables to CMake cache and mark as advanced
+  set(PETSC_INCLUDE_DIRS ${PETSC_INCLUDE_DIRS} CACHE STRING "PETSc include paths." FORCE)
+  set(PETSC_LIBRARIES ${PETSC_LIBRARIES} CACHE STRING "PETSc libraries." FORCE)
+  mark_as_advanced(PETSC_INCLUDE_DIRS PETSC_LIBRARIES)
+
+endif()
+
+# Build PETSc test program
+if (DOLFIN_SKIP_BUILD_TESTS)
+  set(PETSC_TEST_RUNS TRUE)
+  set(PETSC_VERSION "UNKNOWN")
+  set(PETSC_VERSION_OK TRUE)
+elseif (FOUND_PETSC_CONF)
+
+  # Set flags for building test program
+  set(CMAKE_REQUIRED_INCLUDES ${PETSC_INCLUDE_DIRS})
+  set(CMAKE_REQUIRED_LIBRARIES ${PETSC_LIBRARIES})
+
+  # Add MPI variables if MPI has been found
+  if (MPI_C_FOUND)
+    set(CMAKE_REQUIRED_INCLUDES  ${CMAKE_REQUIRED_INCLUDES} ${MPI_C_INCLUDE_PATH})
+    set(CMAKE_REQUIRED_LIBRARIES ${CMAKE_REQUIRED_LIBRARIES} ${MPI_C_LIBRARIES})
+    set(CMAKE_REQUIRED_FLAGS     "${CMAKE_REQUIRED_FLAGS} ${MPI_C_COMPILE_FLAGS}")
+  endif()
+
+  # Check PETSc version
+  set(PETSC_CONFIG_TEST_VERSION_CPP
+    "${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/petsc_config_test_version.cpp")
+  file(WRITE ${PETSC_CONFIG_TEST_VERSION_CPP} "
+#include <iostream>
+#include \"petscversion.h\"
+
+int main() {
+  std::cout << PETSC_VERSION_MAJOR << \".\"
+	    << PETSC_VERSION_MINOR << \".\"
+	    << PETSC_VERSION_SUBMINOR;
+  return 0;
+}
+")
+
+  try_run(
+    PETSC_CONFIG_TEST_VERSION_EXITCODE
+    PETSC_CONFIG_TEST_VERSION_COMPILED
+    ${CMAKE_CURRENT_BINARY_DIR}
+    ${PETSC_CONFIG_TEST_VERSION_CPP}
+    CMAKE_FLAGS
+      "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+    COMPILE_OUTPUT_VARIABLE COMPILE_OUTPUT
+    RUN_OUTPUT_VARIABLE OUTPUT
+    )
+
+  if (PETSC_CONFIG_TEST_VERSION_EXITCODE EQUAL 0)
+    set(PETSC_VERSION ${OUTPUT} CACHE TYPE STRING)
+    string(REPLACE "." ";" PETSC_VERSION_LIST ${PETSC_VERSION})
+    list(GET PETSC_VERSION_LIST 0 PETSC_VERSION_MAJOR)
+    list(GET PETSC_VERSION_LIST 1 PETSC_VERSION_MINOR)
+    list(GET PETSC_VERSION_LIST 2 PETSC_VERSION_SUBMINOR)
+    mark_as_advanced(PETSC_VERSION)
+    mark_as_advanced(PETSC_VERSION_MAJOR, PETSC_VERSION_MINOR, PETSC_VERSION_SUBMINOR)
+  endif()
+
+  if (PETSc_FIND_VERSION)
+    # Check if version found is >= required version
+    if (NOT "${PETSC_VERSION}" VERSION_LESS "${PETSc_FIND_VERSION}")
+      set(PETSC_VERSION_OK TRUE)
+    endif()
+  else()
+    # No specific version requested
+    set(PETSC_VERSION_OK TRUE)
+  endif()
+  mark_as_advanced(PETSC_VERSION_OK)
+
+  # Run PETSc test program
+  set(PETSC_TEST_LIB_CPP
+    "${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/petsc_test_lib.cpp")
+  file(WRITE ${PETSC_TEST_LIB_CPP} "
+#include \"petscts.h\"
+#include \"petsc.h\"
+int main()
+{
+  PetscErrorCode ierr;
+  TS ts;
+  int argc = 0;
+  char** argv = NULL;
+  ierr = PetscInitialize(&argc, &argv, PETSC_NULL, PETSC_NULL);CHKERRQ(ierr);
+  ierr = TSCreate(PETSC_COMM_WORLD,&ts);CHKERRQ(ierr);
+  ierr = TSSetFromOptions(ts);CHKERRQ(ierr);
+#if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR <= 1
+  ierr = TSDestroy(ts);CHKERRQ(ierr);
+#else
+  ierr = TSDestroy(&ts);CHKERRQ(ierr);
+#endif
+  ierr = PetscFinalize();CHKERRQ(ierr);
+  return 0;
+}
+")
+
+  try_run(
+    PETSC_TEST_LIB_EXITCODE
+    PETSC_TEST_LIB_COMPILED
+    ${CMAKE_CURRENT_BINARY_DIR}
+    ${PETSC_TEST_LIB_CPP}
+    CMAKE_FLAGS
+      "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+      "-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}"
+    COMPILE_OUTPUT_VARIABLE PETSC_TEST_LIB_COMPILE_OUTPUT
+    RUN_OUTPUT_VARIABLE PETSC_TEST_LIB_OUTPUT
+    )
+
+  if (PETSC_TEST_LIB_COMPILED AND PETSC_TEST_LIB_EXITCODE EQUAL 0)
+    message(STATUS "Performing test PETSC_TEST_RUNS - Success")
+    set(PETSC_TEST_RUNS TRUE)
+  else()
+    message(STATUS "Performing test PETSC_TEST_RUNS - Failed")
+
+    # Test program does not run - try adding PETSc 3rd party libs and test again
+    list(APPEND CMAKE_REQUIRED_LIBRARIES ${PETSC_EXTERNAL_LIBRARIES})
+
+    try_run(
+      PETSC_TEST_3RD_PARTY_LIBS_EXITCODE
+      PETSC_TEST_3RD_PARTY_LIBS_COMPILED
+      ${CMAKE_CURRENT_BINARY_DIR}
+      ${PETSC_TEST_LIB_CPP}
+      CMAKE_FLAGS
+        "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+	"-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}"
+      COMPILE_OUTPUT_VARIABLE PETSC_TEST_3RD_PARTY_LIBS_COMPILE_OUTPUT
+      RUN_OUTPUT_VARIABLE PETSC_TEST_3RD_PARTY_LIBS_OUTPUT
+      )
+
+    if (PETSC_TEST_3RD_PARTY_LIBS_COMPILED AND PETSC_TEST_3RD_PARTY_LIBS_EXITCODE EQUAL 0)
+      message(STATUS "Performing test PETSC_TEST_3RD_PARTY_LIBS_RUNS - Success")
+      set(PETSC_LIBRARIES ${PETSC_LIBRARIES} ${PETSC_EXTERNAL_LIBRARIES}
+	CACHE STRING "PETSc libraries." FORCE)
+      set(PETSC_TEST_RUNS TRUE)
+    else()
+      message(STATUS "Performing test PETSC_TEST_3RD_PARTY_LIBS_RUNS - Failed")
+    endif()
+  endif()
+
+  # Run test program to check for PETSc Cusp
+  include(CheckCXXSourceRuns)
+  check_cxx_source_runs("
+#include \"petsc.h\"
+int main()
+{
+#if PETSC_HAVE_CUSP
+  return 0;
+#else
+  return 1;
+#endif
+}
+" PETSC_CUSP_FOUND)
+
+  if (PETSC_CUSP_FOUND)
+    message(STATUS "PETSc configured with Cusp support")
+  else()
+    message(STATUS "PETSc configured without Cusp support")
+  endif()
+
+endif()
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(PETSc
+  "PETSc could not be found. Be sure to set PETSC_DIR and PETSC_ARCH."
+  PETSC_LIBRARIES PETSC_DIR PETSC_INCLUDE_DIRS PETSC_TEST_RUNS
+  PETSC_VERSION PETSC_VERSION_OK)
diff --git a/cmake/modules/FindPETSc4py.cmake b/cmake/modules/FindPETSc4py.cmake
new file mode 100644
index 0000000..cd9039c
--- /dev/null
+++ b/cmake/modules/FindPETSc4py.cmake
@@ -0,0 +1,82 @@
+# - Try to find petsc4py
+# Once done this will define
+#
+#  PETSC4PY_FOUND        - system has petsc4py
+#  PETSC4PY_INCLUDE_DIRS  - include directories for petsc4py
+#  PETSC4PY_VERSION      - version of petsc4py
+#  PETSC4PY_VERSION_MAJOR - first number in PETSC4PY_VERSION
+#  PETSC4PY_VERSION_MINOR - second number in PETSC4PY_VERSION
+
+# Based on FindNumPy.cmake
+
+#=============================================================================
+# Copyright (C) 2013 Lawrence Mitchell
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+message(STATUS "Checking for package 'PETSc4Py'")
+
+if(PETSC4PY_INCLUDE_DIRS)
+  # In cache already
+  set(PETSC4PY_FIND_QUIETLY TRUE)
+endif(PETSC4PY_INCLUDE_DIRS)
+
+execute_process(
+  COMMAND ${PYTHON_EXECUTABLE} -c "import petsc4py; print petsc4py.get_include()"
+  OUTPUT_VARIABLE PETSC4PY_INCLUDE_DIRS
+  RESULT_VARIABLE PETSC4PY_NOT_FOUND
+  ERROR_QUIET
+  OUTPUT_STRIP_TRAILING_WHITESPACE
+  )
+
+if(PETSC4PY_INCLUDE_DIRS)
+  set(PETSC4PY_FOUND TRUE)
+  set(PETSC4PY_INCLUDE_DIRS ${PETSC4PY_INCLUDE_DIRS} CACHE STRING "petsc4py include path")
+else(PETSC4PY_INCLUDE_DIRS)
+  set(PETSC4PY_FOUND FALSE)
+endif(PETSC4PY_INCLUDE_DIRS)
+
+if(PETSC4PY_FOUND)
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} -c "import petsc4py; print petsc4py.__version__"
+    OUTPUT_VARIABLE PETSC4PY_VERSION
+    RESULT_VARIABLE PETSC4PY_NOT_FOUND
+    OUTPUT_STRIP_TRAILING_WHITESPACE
+    )
+  string(REPLACE "." ";" PETSC4PY_VERSION_LIST ${PETSC4PY_VERSION})
+  list(GET PETSC4PY_VERSION_LIST 0 PETSC4PY_VERSION_MAJOR)
+  list(GET PETSC4PY_VERSION_LIST 1 PETSC4PY_VERSION_MINOR)
+  if(NOT PETSC4PY_FIND_QUIETLY)
+    message(STATUS "petsc4py version ${PETSC4PY_VERSION} found")
+  endif(NOT PETSC4PY_FIND_QUIETLY)
+else(PETSC4PY_FOUND)
+  if(PETSC4PY_FIND_REQUIRED)
+    message(FATAL_ERROR "petsc4py missing")
+  endif(PETSC4PY_FIND_REQUIRED)
+endif(PETSC4PY_FOUND)
+
+mark_as_advanced(PETSC4PY_INCLUDE_DIRS, PETSC4PY_VERSION, PETSC4PY_VERSION_MAJOR, PETSC4PY_VERSION_MINOR)
diff --git a/cmake/modules/FindPaStiX.cmake b/cmake/modules/FindPaStiX.cmake
new file mode 100644
index 0000000..be2f60a
--- /dev/null
+++ b/cmake/modules/FindPaStiX.cmake
@@ -0,0 +1,159 @@
+# - Try to find PaStiX
+# Once done this will define
+#
+#  PASTIX_FOUND        - system has PaStiX
+#  PASTIX_INCLUDE_DIRS - include directories for PaStiX
+#  PASTIX_LIBRARIES    - libraries for PaStiX
+#  PASTIX_VERSION      - the PaStiX version string (MAJOR.MEDIUM.MINOR)
+
+# Check for PaStiX header file
+find_path(PASTIX_INCLUDE_DIR pastix.h
+  HINTS ${PASTIX_DIR}/include $ENV{PASTIX_DIR}/include ${PASTIX_DIR} $ENV{PASTIX_DIR}
+  PATH_SUFFIXES install
+  DOC "Directory where the PaStiX header is located"
+ )
+
+set(PASTIX_INCLUDE_DIRS ${PASTIX_INCLUDE_DIR})
+
+# Check for PaStiX library
+find_library(PASTIX_LIBRARY pastix
+  HINTS ${PASTIX_DIR}/lib $ENV{PASTIX_DIR}/lib ${PASTIX_DIR} $ENV{PASTIX_DIR}
+  PATH_SUFFIXES install
+  DOC "The PaStiX library"
+  )
+
+set(PASTIX_LIBRARIES ${PASTIX_LIBRARY})
+
+if("${CMAKE_CXX_COMPILER_ID}" STREQUAL "GNU" AND NOT APPLE)
+  # Check for rt library
+  find_library(RT_LIBRARY rt
+    DOC "The RT library"
+    )
+  # Check for math library
+  find_library(M_LIBRARY m
+    DOC "The math library"
+    )
+  set(PASTIX_LIBRARIES ${PASTIX_LIBRARIES} ${RT_LIBRARY} ${M_LIBRARY})
+  message(STATUS "PASTIX_LIBRARIES ${PASTIX_LIBRARIES}")
+endif()
+
+# Check for hwloc header
+find_path(HWLOC_INCLUDE_DIRS hwloc.h
+  HINTS ${HWLOC_DIR} $ENV{HWLOC_DIR} ${HWLOC_DIR}/include $ENV{HWLOC_DIR}/include
+  DOC "Directory where the hwloc header is located"
+ )
+
+# Check for hwloc library
+find_library(HWLOC_LIBRARY hwloc
+  HINTS ${HWLOC_DIR} $ENV{HWLOC_DIR} ${HWLOC_DIR}/lib $ENV{HWLOC_DIR}/lib
+  DOC "The hwloc library"
+  )
+
+if (HWLOC_LIBRARY)
+  set(PASTIX_LIBRARIES ${PASTIX_LIBRARIES} ${HWLOC_LIBRARY})
+endif()
+
+# Add BLAS libs if BLAS has been found
+set(CMAKE_LIBRARY_PATH ${BLAS_DIR}/lib $ENV{BLAS_DIR}/lib ${CMAKE_LIBRARY_PATH})
+find_package(BLAS)
+set(PASTIX_LIBRARIES ${PASTIX_LIBRARIES} ${BLAS_LIBRARIES})
+
+if("${CMAKE_CXX_COMPILER_ID}" STREQUAL "GNU")
+  find_program(GFORTRAN_EXECUTABLE gfortran)
+  if (GFORTRAN_EXECUTABLE)
+    execute_process(COMMAND ${GFORTRAN_EXECUTABLE} -print-file-name=libgfortran.so
+      OUTPUT_VARIABLE GFORTRAN_LIBRARY
+      OUTPUT_STRIP_TRAILING_WHITESPACE)
+    if (EXISTS "${GFORTRAN_LIBRARY}")
+      set(PASTIX_LIBRARIES ${PASTIX_LIBRARIES} ${GFORTRAN_LIBRARY})
+    endif()
+  endif()
+endif()
+
+#Find PaStiX version by looking at pastix.h
+if (EXISTS ${PASTIX_INCLUDE_DIR}/pastix.h)
+  file(STRINGS ${PASTIX_INCLUDE_DIR}/pastix.h PASTIX_VERSIONS_TMP
+    REGEX "^#define PASTIX_[A-Z]+_VERSION[ \t]+[0-9]+$")
+  if (PASTIX_VERSIONS_TMP)
+    string(REGEX REPLACE ".*#define PASTIX_MAJOR_VERSION[ \t]+([0-9]+).*" "\\1" PASTIX_MAJOR_VERSION ${PASTIX_VERSIONS_TMP})
+    string(REGEX REPLACE ".*#define PASTIX_MEDIUM_VERSION[ \t]+([0-9]+).*" "\\1" PASTIX_MEDIUM_VERSION ${PASTIX_VERSIONS_TMP})
+    string(REGEX REPLACE ".*#define PASTIX_MINOR_VERSION[ \t]+([0-9]+).*" "\\1" PASTIX_MINOR_VERSION ${PASTIX_VERSIONS_TMP})
+    set(PASTIX_VERSION ${PASTIX_MAJOR_VERSION}.${PASTIX_MEDIUM_VERSION}.${PASTIX_MINOR_VERSION} CACHE TYPE STRING)
+  else()
+    set(PASTIX_VERSION "UNKNOWN")
+  endif()
+endif()
+
+if (PaStiX_FIND_VERSION)
+  # Check if version found is >= required version
+  if (NOT "${PASTIX_VERSION}" VERSION_LESS "${PaStiX_FIND_VERSION}")
+    set(PASTIX_VERSION_OK TRUE)
+  endif()
+else()
+  # No specific version requested
+  set(PASTIX_VERSION_OK TRUE)
+endif()
+
+mark_as_advanced(
+  PASTIX_INCLUDE_DIR
+  PASTIX_INCLUDE_DIRS
+  PASTIX_LIBRARY
+  PASTIX_LIBRARIES
+  PASTIX_VERSION
+  )
+
+# Try to run a test program that uses PaStiX
+if (DOLFIN_SKIP_BUILD_TESTS)
+  set(PASTIX_TEST_RUNS TRUE)
+elseif (PASTIX_INCLUDE_DIRS AND PASTIX_LIBRARIES)
+
+  set(CMAKE_REQUIRED_INCLUDES  ${PASTIX_INCLUDE_DIRS})
+  set(CMAKE_REQUIRED_LIBRARIES ${PASTIX_LIBRARIES})
+
+ # Add SCOTCH variables if SCOTCH has been found
+  if (SCOTCH_FOUND)
+    set(CMAKE_REQUIRED_INCLUDES  ${CMAKE_REQUIRED_INCLUDES} ${SCOTCH_INCLUDE_DIRS})
+    set(CMAKE_REQUIRED_LIBRARIES ${CMAKE_REQUIRED_LIBRARIES} ${SCOTCH_LIBRARIES})
+  endif()
+
+  # Add MPI variables if MPI has been found
+  if (MPI_C_FOUND)
+    set(CMAKE_REQUIRED_INCLUDES  ${CMAKE_REQUIRED_INCLUDES} ${MPI_C_INCLUDE_PATH})
+    set(CMAKE_REQUIRED_LIBRARIES ${CMAKE_REQUIRED_LIBRARIES} ${MPI_C_LIBRARIES})
+    set(CMAKE_REQUIRED_FLAGS     "${CMAKE_REQUIRED_FLAGS} ${MPI_C_COMPILE_FLAGS}")
+  endif()
+
+  # Build and run test program
+  include(CheckCSourceRuns)
+  check_c_source_runs("
+/* Test program pastix */
+
+#define MPICH_IGNORE_CXX_SEEK 1
+#include <stdint.h>
+#include <mpi.h>
+#include <pastix.h>
+
+int main()
+{
+  pastix_int_t iparm[IPARM_SIZE];
+  double       dparm[DPARM_SIZE];
+  int i = 0;
+  for (i = 0; i < IPARM_SIZE; ++i)
+    iparm[i] = 0;
+  for (i = 0; i < DPARM_SIZE; ++i)
+    dparm[i] = 0.0;
+
+  // Set default parameters
+  pastix_initParam(iparm, dparm);
+
+  return 0;
+}
+" PASTIX_TEST_RUNS)
+
+endif()
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(PASTIX
+  "PaStiX could not be found. Be sure to set PASTIX_DIR."
+  PASTIX_LIBRARIES PASTIX_INCLUDE_DIRS PASTIX_TEST_RUNS PASTIX_VERSION PASTIX_VERSION_OK)
diff --git a/cmake/modules/FindParMETIS.cmake b/cmake/modules/FindParMETIS.cmake
new file mode 100644
index 0000000..f174d12
--- /dev/null
+++ b/cmake/modules/FindParMETIS.cmake
@@ -0,0 +1,153 @@
+# - Try to find ParMETIS
+# Once done this will define
+#
+#  PARMETIS_FOUND        - system has ParMETIS
+#  PARMETIS_INCLUDE_DIRS - include directories for ParMETIS
+#  PARMETIS_LIBRARIES    - libraries for ParMETIS
+#  PARMETIS_VERSION      - version for ParMETIS
+
+#=============================================================================
+# Copyright (C) 2010 Garth N. Wells, Anders Logg and Johannes Ring
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+if (MPI_CXX_FOUND)
+  find_path(PARMETIS_INCLUDE_DIRS parmetis.h
+    HINTS ${PARMETIS_DIR}/include $ENV{PARMETIS_DIR}/include ${PETSC_DIR}/include ${PETSC_DIR}/${PETSC_ARCH}/include
+    DOC "Directory where the ParMETIS header files are located"
+  )
+
+  find_library(PARMETIS_LIBRARY parmetis
+    HINTS ${PARMETIS_DIR}/lib $ENV{PARMETIS_DIR}/lib ${PETSC_DIR}/lib ${PETSC_DIR}/${PETSC_ARCH}/lib
+    NO_DEFAULT_PATH
+    DOC "Directory where the ParMETIS library is located"
+  )
+  find_library(PARMETIS_LIBRARY parmetis
+    DOC "Directory where the ParMETIS library is located"
+  )
+
+  find_library(METIS_LIBRARY metis
+    HINTS ${PARMETIS_DIR}/lib $ENV{PARMETIS_DIR}/lib ${PETSC_DIR}/lib ${PETSC_DIR}/${PETSC_ARCH}/lib
+    NO_DEFAULT_PATH
+    DOC "Directory where the METIS library is located"
+  )
+  find_library(METIS_LIBRARY metis
+    DOC "Directory where the METIS library is located"
+  )
+
+  set(PARMETIS_LIBRARIES ${PARMETIS_LIBRARY})
+  if (METIS_LIBRARY)
+    set(PARMETIS_LIBRARIES ${PARMETIS_LIBRARIES} ${METIS_LIBRARY})
+  endif()
+
+  # Try compiling and running test program
+  if (DOLFIN_SKIP_BUILD_TESTS)
+    set(PARMETIS_TEST_RUNS TRUE)
+    set(PARMETIS_VERSION "UNKNOWN")
+    set(PARMETIS_VERSION_OK TRUE)
+  elseif (PARMETIS_INCLUDE_DIRS AND PARMETIS_LIBRARY)
+
+  # Set flags for building test program
+  set(CMAKE_REQUIRED_INCLUDES  ${PARMETIS_INCLUDE_DIRS} ${MPI_CXX_INCLUDE_PATH})
+  set(CMAKE_REQUIRED_LIBRARIES ${PARMETIS_LIBRARIES}    ${MPI_CXX_LIBRARIES})
+  set(CMAKE_REQUIRED_FLAGS     ${CMAKE_REQUIRED_FLAGS}  ${MPI_CXX_COMPILE_FLAGS})
+
+  # Check ParMETIS version
+  set(PARMETIS_CONFIG_TEST_VERSION_CPP
+    "${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/parmetis_config_test_version.cpp")
+  file(WRITE ${PARMETIS_CONFIG_TEST_VERSION_CPP} "
+#define MPICH_IGNORE_CXX_SEEK 1
+#include <iostream>
+#include \"parmetis.h\"
+
+int main() {
+#ifdef PARMETIS_SUBMINOR_VERSION
+  std::cout << PARMETIS_MAJOR_VERSION << \".\"
+	    << PARMETIS_MINOR_VERSION << \".\"
+            << PARMETIS_SUBMINOR_VERSION;
+#else
+  std::cout << PARMETIS_MAJOR_VERSION << \".\"
+	    << PARMETIS_MINOR_VERSION;
+#endif
+  return 0;
+}
+")
+
+    try_run(
+      PARMETIS_CONFIG_TEST_VERSION_EXITCODE
+      PARMETIS_CONFIG_TEST_VERSION_COMPILED
+      ${CMAKE_CURRENT_BINARY_DIR}
+      ${PARMETIS_CONFIG_TEST_VERSION_CPP}
+      CMAKE_FLAGS
+        "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+	"-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}"
+      COMPILE_OUTPUT_VARIABLE PARMETIS_CONFIG_TEST_VERSION_COMPILE_OUTPUT
+      RUN_OUTPUT_VARIABLE PARMETIS_CONFIG_TEST_VERSION_OUTPUT
+      )
+
+    if (PARMETIS_CONFIG_TEST_VERSION_EXITCODE EQUAL 0)
+      set(PARMETIS_VERSION ${PARMETIS_CONFIG_TEST_VERSION_OUTPUT} CACHE TYPE STRING)
+      mark_as_advanced(PARMETIS_VERSION)
+    endif()
+
+    if (ParMETIS_FIND_VERSION)
+      # Check if version found is >= required version
+      if (NOT "${PARMETIS_VERSION}" VERSION_LESS "${ParMETIS_FIND_VERSION}")
+	set(PARMETIS_VERSION_OK TRUE)
+      endif()
+    else()
+      # No specific version requested
+      set(PARMETIS_VERSION_OK TRUE)
+    endif()
+    mark_as_advanced(PARMETIS_VERSION_OK)
+
+    # Build and run test program
+    include(CheckCXXSourceRuns)
+    check_cxx_source_runs("
+#define MPICH_IGNORE_CXX_SEEK 1
+#include <mpi.h>
+#include <parmetis.h>
+
+int main()
+{
+  // FIXME: Find a simple but sensible test for ParMETIS
+
+  return 0;
+}
+" PARMETIS_TEST_RUNS)
+
+  endif()
+endif()
+
+# Standard package handling
+find_package_handle_standard_args(ParMETIS
+                                  "ParMETIS could not be found/configured."
+                                  PARMETIS_LIBRARIES
+                                  PARMETIS_TEST_RUNS
+                                  PARMETIS_INCLUDE_DIRS
+				  PARMETIS_VERSION
+				  PARMETIS_VERSION_OK)
diff --git a/cmake/modules/FindSCOTCH.cmake b/cmake/modules/FindSCOTCH.cmake
new file mode 100644
index 0000000..880b908
--- /dev/null
+++ b/cmake/modules/FindSCOTCH.cmake
@@ -0,0 +1,324 @@
+# - Try to find SCOTCH
+# Once done this will define
+#
+#  SCOTCH_FOUND        - system has found SCOTCH
+#  SCOTCH_INCLUDE_DIRS - include directories for SCOTCH
+#  SCOTCH_LIBARIES     - libraries for SCOTCH
+#  SCOTCH_VERSION      - version for SCOTCH
+#
+# Variables used by this module, they can change the default behaviour and
+# need to be set before calling find_package:
+#
+#  SCOTCH_DEBUG        - Set this to TRUE to enable debugging output
+#                        of FindScotchPT.cmake if you are having problems.
+#                        Please enable this before filing any bug reports.
+
+#=============================================================================
+# Copyright (C) 2010-2011 Garth N. Wells, Johannes Ring and Anders Logg
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+set(SCOTCH_FOUND FALSE)
+
+message(STATUS "Checking for package 'SCOTCH-PT'")
+
+# Check for header file
+find_path(SCOTCH_INCLUDE_DIRS ptscotch.h
+  HINTS ${SCOTCH_DIR}/include $ENV{SCOTCH_DIR}/include ${PETSC_DIR}/include ${PETSC_DIR}/${PETSC_ARCH}/include
+  PATH_SUFFIXES scotch
+  DOC "Directory where the SCOTCH-PT header is located"
+  )
+
+# Check for scotch
+find_library(SCOTCH_LIBRARY
+  NAMES scotch
+  HINTS ${SCOTCH_DIR}/lib $ENV{SCOTCH_DIR}/lib ${PETSC_DIR}/lib ${PETSC_DIR}/${PETSC_ARCH}/lib
+  NO_DEFAULT_PATH
+  DOC "The SCOTCH library"
+  )
+find_library(SCOTCH_LIBRARY
+  NAMES scotch
+  DOC "The SCOTCH library"
+  )
+
+# Check for scotcherr
+find_library(SCOTCHERR_LIBRARY
+  NAMES scotcherr
+  HINTS ${SCOTCH_DIR}/lib $ENV{SCOTCH_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The SCOTCH-ERROR library"
+  )
+find_library(SCOTCHERR_LIBRARY
+  NAMES scotcherr
+  DOC "The SCOTCH-ERROR library"
+  )
+
+# Check for ptscotch
+find_library(PTSCOTCH_LIBRARY
+  NAMES ptscotch
+  HINTS ${SCOTCH_DIR}/lib $ENV{SCOTCH_DIR}/lib ${PETSC_DIR}/lib ${PETSC_DIR}/${PETSC_ARCH}/lib
+  NO_DEFAULT_PATH
+  DOC "The PTSCOTCH library"
+  )
+find_library(PTSCOTCH_LIBRARY
+  NAMES ptscotch
+  DOC "The PTSCOTCH library"
+  )
+
+# Check for ptesmumps
+find_library(PTESMUMPS_LIBRARY
+  NAMES ptesmumps esmumps
+  HINTS ${SCOTCH_DIR}/lib $ENV{SCOTCH_DIR}/lib ${PETSC_DIR}/lib ${PETSC_DIR}/${PETSC_ARCH}/lib
+  NO_DEFAULT_PATH
+  DOC "The PTSCOTCH-ESMUMPS library"
+  )
+find_library(PTESMUMPS_LIBRARY
+  NAMES ptesmumps esmumps
+  DOC "The PTSCOTCH-ESMUMPS library"
+  )
+
+# Check for ptscotcherr
+find_library(PTSCOTCHERR_LIBRARY
+  NAMES ptscotcherr
+  HINTS ${SCOTCH_DIR}/lib $ENV{SCOTCH_DIR}/lib ${PETSC_DIR}/lib ${PETSC_DIR}/${PETSC_ARCH}/lib
+  NO_DEFAULT_PATH
+  DOC "The PTSCOTCH-ERROR library"
+  )
+find_library(PTSCOTCHERR_LIBRARY
+  NAMES ptscotcherr
+  DOC "The PTSCOTCH-ERROR library"
+  )
+
+#set(SCOTCH_DEBUG 1)
+set(SCOTCH_LIBRARIES ${PTSCOTCH_LIBRARY})
+if (PTESMUMPS_LIBRARY)
+  set(SCOTCH_LIBRARIES ${SCOTCH_LIBRARIES}  ${PTESMUMPS_LIBRARY})
+endif()
+set(SCOTCH_LIBRARIES ${SCOTCH_LIBRARIES} ${PTSCOTCHERR_LIBRARY})
+
+# Basic check of SCOTCH_VERSION which does not require compilation
+file(STRINGS ${SCOTCH_INCLUDE_DIRS}/scotch.h SCOTCH_H)
+string(REGEX MATCH "SCOTCH_VERSION [0-9]+" SCOTCH_VERSION ${SCOTCH_H})
+string(REGEX MATCH "[0-9]+" SCOTCH_VERSION ${SCOTCH_VERSION})
+
+# For SCOTCH version > 6, need to add libraries scotch and ptscotch
+if (NOT ${SCOTCH_VERSION} VERSION_LESS "6")
+  set(SCOTCH_LIBRARIES ${PTSCOTCH_LIBRARY} ${SCOTCH_LIBRARY} ${PTSCOTCHERR_LIBRARY})
+  set(CMAKE_REQUIRED_LIBRARIES ${CMAKE_REQUIRED_LIBRARIES} ${SCOTCH_LIBRARY})
+endif()
+
+# Try compiling and running test program
+if (DOLFIN_SKIP_BUILD_TESTS)
+  message(STATUS "Found SCOTCH (version ${SCOTCH_VERSION})")
+  set(SCOTCH_TEST_RUNS TRUE)
+elseif (SCOTCH_INCLUDE_DIRS AND SCOTCH_LIBRARIES)
+  if (SCOTCH_DEBUG)
+    message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                   "location of ptscotch.h: ${SCOTCH_INCLUDE_DIRS}/ptscotch.h")
+    message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                   "location of libscotch: ${SCOTCH_LIBRARY}")
+    message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                   "location of libptscotch: ${PTSCOTCH_LIBRARY}")
+    message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                   "location of libptscotcherr: ${PTSCOTCHERR_LIBRARY}")
+  endif()
+
+  # Set flags for building test program
+  set(CMAKE_REQUIRED_INCLUDES ${SCOTCH_INCLUDE_DIRS})
+  set(CMAKE_REQUIRED_LIBRARIES ${SCOTCH_LIBRARIES})
+  #set(CMAKE_REQUIRED_LIBRARIES ${SCOTCH_LIBRARY} ${SCOTCHERR_LIBRARY})
+
+  # Add MPI variables if MPI has been found
+  if (MPI_CXX_FOUND)
+    set(CMAKE_REQUIRED_INCLUDES ${CMAKE_REQUIRED_INCLUDES} ${MPI_CXX_INCLUDE_PATH})
+    set(CMAKE_REQUIRED_LIBRARIES ${CMAKE_REQUIRED_LIBRARIES} ${MPI_CXX_LIBRARIES})
+    set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} ${MPI_CXX_COMPILE_FLAGS}")
+  endif()
+
+  set(SCOTCH_CONFIG_TEST_VERSION_CPP
+    "${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/scotch_config_test_version.cpp")
+  file(WRITE ${SCOTCH_CONFIG_TEST_VERSION_CPP} "
+#define MPICH_IGNORE_CXX_SEEK 1
+#include <stdint.h>
+#include <stdio.h>
+#include <mpi.h>
+#include <ptscotch.h>
+#include <iostream>
+
+int main() {
+  std::cout << SCOTCH_VERSION << \".\"
+	    << SCOTCH_RELEASE << \".\"
+	    << SCOTCH_PATCHLEVEL;
+  return 0;
+}
+")
+
+  try_run(
+    SCOTCH_CONFIG_TEST_VERSION_EXITCODE
+    SCOTCH_CONFIG_TEST_VERSION_COMPILED
+    ${CMAKE_CURRENT_BINARY_DIR}
+    ${SCOTCH_CONFIG_TEST_VERSION_CPP}
+    CMAKE_FLAGS
+      "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+      "-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}"
+    COMPILE_OUTPUT_VARIABLE COMPILE_OUTPUT
+    RUN_OUTPUT_VARIABLE OUTPUT
+    )
+
+  # Set version number
+  if (SCOTCH_CONFIG_TEST_VERSION_EXITCODE EQUAL 0)
+    set(SCOTCH_VERSION ${OUTPUT} CACHE TYPE STRING)
+    message(STATUS "Found SCOTCH (version ${SCOTCH_VERSION})")
+  endif()
+
+  # PT-SCOTCH was first introduced in SCOTCH version 5.0
+  # FIXME: parallel graph partitioning features in PT-SCOTCH was first
+  #        introduced in 5.1. Do we require version 5.1?
+  if (NOT ${SCOTCH_VERSION} VERSION_LESS "5.0")
+    set(SCOTCH_TEST_LIB_CPP
+      "${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/scotch_test_lib.cpp")
+    file(WRITE ${SCOTCH_TEST_LIB_CPP} "
+#define MPICH_IGNORE_CXX_SEEK 1
+#include <stdint.h>
+#include <stdio.h>
+#include <mpi.h>
+#include <ptscotch.h>
+#include <iostream>
+#include <cstdlib>
+
+int main() {
+  int provided;
+  SCOTCH_Dgraph dgrafdat;
+
+  MPI_Init_thread(0, 0, MPI_THREAD_MULTIPLE, &provided);
+
+  if (SCOTCH_dgraphInit(&dgrafdat, MPI_COMM_WORLD) != 0) {
+    if (MPI_THREAD_MULTIPLE > provided) {
+      std::cout << \"MPI implementation is not thread-safe:\" << std::endl;
+      std::cout << \"SCOTCH should be compiled without SCOTCH_PTHREAD\" << std::endl;
+      exit(1);
+    }
+    else {
+      std::cout << \"libptscotch linked to libscotch or other unknown error\" << std::endl;
+      exit(2);
+    }
+  }
+  else {
+    SCOTCH_dgraphExit(&dgrafdat);
+  }
+
+  MPI_Finalize();
+
+  return 0;
+}
+")
+
+    message(STATUS "Performing test SCOTCH_TEST_RUNS")
+    try_run(
+      SCOTCH_TEST_LIB_EXITCODE
+      SCOTCH_TEST_LIB_COMPILED
+      ${CMAKE_CURRENT_BINARY_DIR}
+      ${SCOTCH_TEST_LIB_CPP}
+      CMAKE_FLAGS
+        "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+        "-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}"
+      COMPILE_OUTPUT_VARIABLE SCOTCH_TEST_LIB_COMPILE_OUTPUT
+      RUN_OUTPUT_VARIABLE SCOTCH_TEST_LIB_OUTPUT
+      )
+
+    if (SCOTCH_TEST_LIB_COMPILED AND SCOTCH_TEST_LIB_EXITCODE EQUAL 0)
+      message(STATUS "Performing test SCOTCH_TEST_RUNS - Success")
+      set(SCOTCH_TEST_RUNS TRUE)
+    else()
+      message(STATUS "Performing test SCOTCH_TEST_RUNS - Failed")
+      if (SCOTCH_DEBUG)
+        # Output some variables
+        message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                       "SCOTCH_TEST_LIB_COMPILED = ${SCOTCH_TEST_LIB_COMPILED}")
+        message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                       "SCOTCH_TEST_LIB_COMPILE_OUTPUT = ${SCOTCH_TEST_LIB_COMPILE_OUTPUT}")
+        message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                       "SCOTCH_TEST_LIB_EXITCODE = ${SCOTCH_TEST_LIB_EXITCODE}")
+        message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                       "SCOTCH_TEST_LIB_OUTPUT = ${SCOTCH_TEST_LIB_OUTPUT}")
+      endif()
+    endif()
+
+    # If program does not run, try adding zlib library and test again
+    if(NOT SCOTCH_TEST_RUNS)
+      if (NOT ZLIB_FOUND)
+        find_package(ZLIB)
+      endif()
+
+      if (ZLIB_INCLUDE_DIRS AND ZLIB_LIBRARIES)
+        set(CMAKE_REQUIRED_INCLUDES ${CMAKE_REQUIRED_INCLUDES} ${ZLIB_INCLUDE_DIRS})
+        set(CMAKE_REQUIRED_LIBRARIES ${CMAKE_REQUIRED_LIBRARIES} ${ZLIB_LIBRARIES})
+
+        message(STATUS "Performing test SCOTCH_ZLIB_TEST_RUNS")
+        try_run(
+          SCOTCH_ZLIB_TEST_LIB_EXITCODE
+          SCOTCH_ZLIB_TEST_LIB_COMPILED
+          ${CMAKE_CURRENT_BINARY_DIR}
+          ${SCOTCH_TEST_LIB_CPP}
+          CMAKE_FLAGS
+                  "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+                  "-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}"
+          COMPILE_OUTPUT_VARIABLE SCOTCH_ZLIB_TEST_LIB_COMPILE_OUTPUT
+          RUN_OUTPUT_VARIABLE SCOTCH_ZLIB_TEST_LIB_OUTPUT
+          )
+
+        # Add zlib flags if required and set test run to 'true'
+        if (SCOTCH_ZLIB_TEST_LIB_COMPILED AND SCOTCH_ZLIB_TEST_LIB_EXITCODE EQUAL 0)
+          message(STATUS "Performing test SCOTCH_ZLIB_TEST_RUNS - Success")
+          set(SCOTCH_INCLUDE_DIRS ${SCOTCH_INCLUDE_DIRS} ${ZLIB_INCLUDE_DIRS})
+          set(SCOTCH_LIBRARIES ${SCOTCH_LIBRARIES} ${ZLIB_LIBRARIES})
+          set(SCOTCH_TEST_RUNS TRUE)
+        else()
+          message(STATUS "Performing test SCOTCH_ZLIB_TEST_RUNS - Failed")
+          if (SCOTCH_DEBUG)
+            message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                           "SCOTCH_ZLIB_TEST_LIB_COMPILED = ${SCOTCH_ZLIB_TEST_LIB_COMPILED}")
+            message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                           "SCOTCH_ZLIB_TEST_LIB_COMPILE_OUTPUT = ${SCOTCH_ZLIB_TEST_LIB_COMPILE_OUTPUT}")
+            message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                           "SCOTCH_TEST_LIB_EXITCODE = ${SCOTCH_TEST_LIB_EXITCODE}")
+            message(STATUS "[ ${CMAKE_CURRENT_LIST_FILE}:${CMAKE_CURRENT_LIST_LINE} ] "
+                           "SCOTCH_TEST_LIB_OUTPUT = ${SCOTCH_TEST_LIB_OUTPUT}")
+          endif()
+        endif()
+
+      endif()
+    endif()
+  endif()
+endif()
+
+# Standard package handling
+find_package_handle_standard_args(SCOTCH
+                                  "SCOTCH could not be found. Be sure to set SCOTCH_DIR."
+                                  SCOTCH_LIBRARIES
+                                  SCOTCH_INCLUDE_DIRS
+                                  SCOTCH_TEST_RUNS)
diff --git a/cmake/modules/FindSLEPc.cmake b/cmake/modules/FindSLEPc.cmake
new file mode 100644
index 0000000..13c508e
--- /dev/null
+++ b/cmake/modules/FindSLEPc.cmake
@@ -0,0 +1,270 @@
+# - Try to find SLEPC
+# Once done this will define
+#
+#  SLEPC_FOUND        - system has SLEPc
+#  SLEPC_INCLUDE_DIR  - include directories for SLEPc
+#  SLEPC_LIBARIES     - libraries for SLEPc
+#  SLEPC_DIR          - directory where SLEPc is built
+#  SLEPC_VERSION      - version of SLEPc
+#
+# Assumes that PETSC_DIR and PETSC_ARCH has been set by
+# alredy calling find_package(PETSc)
+
+#=============================================================================
+# Copyright (C) 2010-2012 Garth N. Wells, Anders Logg and Johannes Ring
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+message(STATUS "Checking for package 'SLEPc'")
+
+# Set debian_arches (PETSC_ARCH for Debian-style installations)
+foreach (debian_arches linux kfreebsd)
+  if ("${CMAKE_BUILD_TYPE}" STREQUAL "Debug")
+    set(DEBIAN_FLAVORS ${debian_arches}-gnu-c-debug ${debian_arches}-gnu-c-opt ${DEBIAN_FLAVORS})
+  else()
+    set(DEBIAN_FLAVORS ${debian_arches}-gnu-c-opt ${debian_arches}-gnu-c-debug ${DEBIAN_FLAVORS})
+  endif()
+endforeach()
+
+# List of possible locations for SLEPC_DIR
+set(slepc_dir_locations "")
+list(APPEND slepc_dir_locations "/usr/lib/slepcdir/3.4.2")
+list(APPEND slepc_dir_locations "/usr/lib/slepcdir/3.2")
+list(APPEND slepc_dir_locations "/usr/lib/slepcdir/3.1")
+list(APPEND slepc_dir_locations "/usr/lib/slepcdir/3.0.0")
+list(APPEND slepc_dir_locations "/opt/local/lib/petsc")    # Macports
+list(APPEND slepc_dir_locations "/usr/local/lib/slepc")
+list(APPEND slepc_dir_locations "$ENV{HOME}/slepc")
+
+# Add other possible locations for SLEPC_DIR
+set(_SYSTEM_LIB_PATHS "${CMAKE_SYSTEM_LIBRARY_PATH};${CMAKE_PLATFORM_IMPLICIT_LINK_DIRECTORIES}")
+string(REGEX REPLACE ":" ";" libdirs ${_SYSTEM_LIB_PATHS})
+foreach (libdir ${libdirs})
+  get_filename_component(slepc_dir_location "${libdir}/" PATH)
+  list(APPEND slepc_dir_locations ${slepc_dir_location})
+endforeach()
+
+# Try to figure out SLEPC_DIR by finding slepc.h
+find_path(SLEPC_DIR include/slepc.h
+  HINTS ${SLEPC_DIR} $ENV{SLEPC_DIR}
+  PATHS ${slepc_dir_locations}
+  DOC "SLEPc directory")
+
+# Report result of search for SLEPC_DIR
+if (DEFINED SLEPC_DIR)
+  message(STATUS "SLEPC_DIR is ${SLEPC_DIR}")
+else()
+  message(STATUS "SLEPC_DIR is empty")
+endif()
+
+# Get variables from SLEPc configuration
+if (SLEPC_DIR)
+
+  find_library(SLEPC_LIBRARY
+    NAMES slepc
+    HINTS ${SLEPC_DIR}/lib $ENV{SLEPC_DIR}/lib  ${SLEPC_DIR}/${PETSC_ARCH}/lib $ENV{SLEPC_DIR}/$ENV{PETSC_ARCH}/lib 
+    NO_DEFAULT_PATH
+    DOC "The SLEPc library"
+    )
+  find_library(SLEPC_LIBRARY
+    NAMES slepc
+    DOC "The SLEPc library"
+    )
+  mark_as_advanced(SLEPC_LIBRARY)
+
+  # Create a temporary Makefile to probe the SLEPcc configuration
+  set(slepc_config_makefile ${PROJECT_BINARY_DIR}/Makefile.slepc)
+  file(WRITE ${slepc_config_makefile}
+"# This file was autogenerated by FindSLEPc.cmake
+SLEPC_DIR  = ${SLEPC_DIR}
+PETSC_ARCH = ${PETSC_ARCH}
+PETSC_DIR = ${PETSC_DIR}
+include ${SLEPC_DIR}/conf/slepc_common
+show :
+	-@echo -n \${\${VARIABLE}}
+")
+
+  # Define macro for getting SLEPc variables from Makefile
+  macro(SLEPC_GET_VARIABLE var name)
+    set(${var} "NOTFOUND" CACHE INTERNAL "Cleared" FORCE)
+    execute_process(COMMAND ${CMAKE_MAKE_PROGRAM} --no-print-directory -f ${slepc_config_makefile} show VARIABLE=${name}
+      OUTPUT_VARIABLE ${var}
+      RESULT_VARIABLE slepc_return)
+  endmacro()
+
+  # Call macro to get the SLEPc variables
+  slepc_get_variable(SLEPC_INCLUDE SLEPC_INCLUDE)
+  slepc_get_variable(SLEPC_EXTERNAL_LIB SLEPC_EXTERNAL_LIB)
+
+  # Remove temporary Makefile
+  file(REMOVE ${slepc_config_makefile})
+
+  # Extract include paths and libraries from compile command line
+  include(ResolveCompilerPaths)
+  resolve_includes(SLEPC_INCLUDE_DIRS "${SLEPC_INCLUDE}")
+  resolve_libraries(SLEPC_EXTERNAL_LIBRARIES "${SLEPC_EXTERNAL_LIB}")
+
+  # Add variables to CMake cache and mark as advanced
+  set(SLEPC_INCLUDE_DIRS ${SLEPC_INCLUDE_DIRS} CACHE STRING "SLEPc include paths." FORCE)
+  set(SLEPC_LIBRARIES ${SLEPC_LIBRARY} CACHE STRING "SLEPc libraries." FORCE)
+  mark_as_advanced(SLEPC_INCLUDE_DIRS SLEPC_LIBRARIES)
+endif()
+
+if (DOLFIN_SKIP_BUILD_TESTS)
+  set(SLEPC_TEST_RUNS TRUE)
+  set(SLEPC_VERSION "UNKNOWN")
+  set(SLEPC_VERSION_OK TRUE)
+elseif (SLEPC_LIBRARIES AND SLEPC_INCLUDE_DIRS)
+
+  # Set flags for building test program
+  set(CMAKE_REQUIRED_INCLUDES ${SLEPC_INCLUDE_DIRS} ${PETSC_INCLUDE_DIRS})
+  set(CMAKE_REQUIRED_LIBRARIES ${SLEPC_LIBRARIES} ${PETSC_LIBRARIES})
+
+  # Add MPI variables if MPI has been found
+  if (MPI_C_FOUND)
+    set(CMAKE_REQUIRED_INCLUDES  ${CMAKE_REQUIRED_INCLUDES} ${MPI_C_INCLUDE_PATH})
+    set(CMAKE_REQUIRED_LIBRARIES ${CMAKE_REQUIRED_LIBRARIES} ${MPI_C_LIBRARIES})
+    set(CMAKE_REQUIRED_FLAGS     "${CMAKE_REQUIRED_FLAGS} ${MPI_C_COMPILE_FLAGS}")
+  endif()
+
+  # Check SLEPc version
+  set(SLEPC_CONFIG_TEST_VERSION_CPP
+    "${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/slepc_config_test_version.cpp")
+  file(WRITE ${SLEPC_CONFIG_TEST_VERSION_CPP} "
+#include <iostream>
+#include \"slepcversion.h\"
+
+int main() {
+  std::cout << SLEPC_VERSION_MAJOR << \".\"
+	    << SLEPC_VERSION_MINOR << \".\"
+	    << SLEPC_VERSION_SUBMINOR;
+  return 0;
+}
+")
+
+  try_run(
+    SLEPC_CONFIG_TEST_VERSION_EXITCODE
+    SLEPC_CONFIG_TEST_VERSION_COMPILED
+    ${CMAKE_CURRENT_BINARY_DIR}
+    ${SLEPC_CONFIG_TEST_VERSION_CPP}
+    CMAKE_FLAGS
+      "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+    COMPILE_OUTPUT_VARIABLE COMPILE_OUTPUT
+    RUN_OUTPUT_VARIABLE OUTPUT
+    )
+
+  if (SLEPC_CONFIG_TEST_VERSION_EXITCODE EQUAL 0)
+    set(SLEPC_VERSION ${OUTPUT} CACHE TYPE STRING)
+    mark_as_advanced(SLEPC_VERSION)
+  endif()
+
+  if (SLEPc_FIND_VERSION)
+    # Check if version found is >= required version
+    if (NOT "${SLEPC_VERSION}" VERSION_LESS "${SLEPc_FIND_VERSION}")
+      set(SLEPC_VERSION_OK TRUE)
+    endif()
+  else()
+    # No specific version requested
+    set(SLEPC_VERSION_OK TRUE)
+  endif()
+  mark_as_advanced(SLEPC_VERSION_OK)
+
+  # Run SLEPc test program
+  set(SLEPC_TEST_LIB_CPP
+    "${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/slepc_test_lib.cpp")
+  file(WRITE ${SLEPC_TEST_LIB_CPP} "
+#include \"petsc.h\"
+#include \"slepceps.h\"
+int main()
+{
+  PetscErrorCode ierr;
+  int argc = 0;
+  char** argv = NULL;
+  ierr = SlepcInitialize(&argc, &argv, PETSC_NULL, PETSC_NULL);
+  EPS eps;
+  ierr = EPSCreate(PETSC_COMM_SELF, &eps); CHKERRQ(ierr);
+  //ierr = EPSSetFromOptions(eps); CHKERRQ(ierr);
+#if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR <= 1
+  ierr = EPSDestroy(eps); CHKERRQ(ierr);
+#else
+  ierr = EPSDestroy(&eps); CHKERRQ(ierr);
+#endif
+  ierr = SlepcFinalize(); CHKERRQ(ierr);
+  return 0;
+}
+")
+
+  try_run(
+    SLEPC_TEST_LIB_EXITCODE
+    SLEPC_TEST_LIB_COMPILED
+    ${CMAKE_CURRENT_BINARY_DIR}
+    ${SLEPC_TEST_LIB_CPP}
+    CMAKE_FLAGS
+      "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+      "-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}"
+    COMPILE_OUTPUT_VARIABLE SLEPC_TEST_LIB_COMPILE_OUTPUT
+    RUN_OUTPUT_VARIABLE SLEPC_TEST_LIB_OUTPUT
+    )
+
+  if (SLEPC_TEST_LIB_COMPILED AND SLEPC_TEST_LIB_EXITCODE EQUAL 0)
+    message(STATUS "Performing test SLEPC_TEST_RUNS - Success")
+    set(SLEPC_TEST_RUNS TRUE)
+  else()
+    message(STATUS "Performing test SLEPC_TEST_RUNS - Failed")
+
+    # Test program does not run - try adding SLEPc 3rd party libs and test again
+    list(APPEND CMAKE_REQUIRED_LIBRARIES ${SLEPC_EXTERNAL_LIBRARIES})
+
+    try_run(
+      SLEPC_TEST_3RD_PARTY_LIBS_EXITCODE
+      SLEPC_TEST_3RD_PARTY_LIBS_COMPILED
+      ${CMAKE_CURRENT_BINARY_DIR}
+      ${SLEPC_TEST_LIB_CPP}
+      CMAKE_FLAGS
+        "-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}"
+	"-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}"
+      COMPILE_OUTPUT_VARIABLE SLEPC_TEST_3RD_PARTY_LIBS_COMPILE_OUTPUT
+      RUN_OUTPUT_VARIABLE SLEPC_TEST_3RD_PARTY_LIBS_OUTPUT
+      )
+
+    if (SLEPC_TEST_3RD_PARTY_LIBS_COMPILED AND SLEPC_TEST_3RD_PARTY_LIBS_EXITCODE EQUAL 0)
+      message(STATUS "Performing test SLEPC_TEST_3RD_PARTY_LIBS_RUNS - Success")
+      set(SLEPC_LIBRARIES ${SLEPC_LIBRARIES} ${SLEPC_EXTERNAL_LIBRARIES}
+	CACHE STRING "SLEPc libraries." FORCE)
+      set(SLEPC_TEST_RUNS TRUE)
+    else()
+      message(STATUS "Performing test SLEPC_TEST_3RD_PARTY_LIBS_RUNS - Failed")
+    endif()
+  endif()
+endif()
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(SLEPc
+  "SLEPc could not be found. Be sure to set SLEPC_DIR, PETSC_DIR, and PETSC_ARCH."
+  SLEPC_LIBRARIES SLEPC_DIR SLEPC_INCLUDE_DIRS SLEPC_TEST_RUNS
+  SLEPC_VERSION SLEPC_VERSION_OK)
diff --git a/cmake/modules/FindSphinx.cmake b/cmake/modules/FindSphinx.cmake
new file mode 100644
index 0000000..e1df317
--- /dev/null
+++ b/cmake/modules/FindSphinx.cmake
@@ -0,0 +1,78 @@
+# - Try to find Sphinx (sphinx-build)
+
+# Once done this will define
+#
+#   SPHINX_FOUND      - system has Sphinx
+#   SPHINX_EXECUTABLE - full path to the Sphinx documentation generator tool
+#   SPHINX_VERSION    - the version of Sphinx which was found, e.g. "1.0.7"
+
+#=============================================================================
+# Copyright (C) 2011 Marie Rognes and Johannes Ring
+# 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 COPYRIGHT HOLDERS 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
+# COPYRIGHT HOLDER 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.
+#=============================================================================
+
+message(STATUS "Checking for package 'Sphinx'")
+
+# Make sure Python is available
+if (NOT PYTHON_EXECUTABLE)
+  find_package(PythonInterp)
+endif()
+
+# Try to find sphinx-build
+find_program(SPHINX_EXECUTABLE sphinx-build
+  HINTS ${SPHINX_DIR} $ENV{SPHINX_DIR}
+  PATH_SUFFIXES bin
+  DOC "Sphinx documentation generator tool"
+)
+
+if (SPHINX_EXECUTABLE)
+  # Try to check Sphinx version by importing Sphinx
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} -c "import sphinx; print sphinx.__version__"
+    OUTPUT_VARIABLE SPHINX_VERSION
+    OUTPUT_STRIP_TRAILING_WHITESPACE)
+
+  if (Sphinx_FIND_VERSION)
+    # Check if version found is >= required version
+    if (NOT "${SPHINX_VERSION}" VERSION_LESS "${Sphinx_FIND_VERSION}")
+      set(SPHINX_VERSION_OK TRUE)
+    endif()
+  else()
+    # No specific version of Sphinx is requested
+    set(SPHINX_VERSION_OK TRUE)
+  endif()
+endif()
+
+mark_as_advanced(
+  SPHINX_EXECUTABLE
+  SPHINX_VERSION
+  SPHINX_VERSION_OK
+)
+
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(Sphinx DEFAULT_MSG
+  SPHINX_EXECUTABLE SPHINX_VERSION_OK)
diff --git a/cmake/modules/FindUMFPACK.cmake b/cmake/modules/FindUMFPACK.cmake
new file mode 100644
index 0000000..e55dfdf
--- /dev/null
+++ b/cmake/modules/FindUMFPACK.cmake
@@ -0,0 +1,132 @@
+# - Try to find UMFPACK
+# Once done this will define
+#
+#  UMFPACK_FOUND        - system has UMFPACK
+#  UMFPACK_INCLUDE_DIRS - include directories for UMFPACK
+#  UMFPACK_LIBRARIES    - libraries for UMFPACK
+
+message(STATUS "Checking for package 'UMFPACK'")
+
+# Find packages that UMFPACK depends on
+set(CMAKE_LIBRARY_PATH ${BLAS_DIR}/lib $ENV{BLAS_DIR}/lib ${CMAKE_LIBRARY_PATH})
+find_package(AMD QUIET)
+find_package(BLAS QUIET)
+find_package(CHOLMOD QUIET)
+
+# Check for header file
+find_path(UMFPACK_INCLUDE_DIRS umfpack.h
+ PATHS ${UMFPACK_DIR}/include $ENV{UMFPACK_DIR}/include
+ PATH_SUFFIXES suitesparse ufsparse
+ DOC "Directory where the UMFPACK header is located"
+ )
+mark_as_advanced(UMFPACK_INCLUDE_DIRS)
+
+# Check for UMFPACK library
+find_library(UMFPACK_LIBRARY umfpack
+  PATHS ${UMFPACK_DIR}/lib $ENV{UMFPACK_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The UMFPACK library"
+  )
+find_library(UMFPACK_LIBRARY umfpack
+  DOC "The UMFPACK library"
+  )
+mark_as_advanced(UMFPACK_LIBRARY)
+
+#  Check for SUITESPARSE library on Apple
+if (APPLE)
+  find_library(SUITESPARSE_LIBRARY SuiteSparse
+    PATHS ${UMFPACK_DIR}/lib $ENV{UMFPACK_DIR}/lib
+    NO_DEFAULT_PATH
+    DOC "The SUITESPARSE library"
+  )
+  find_library(SUITESPARSE_LIBRARY SuiteSparse
+    DOC "The SUITESPARSE library"
+  )
+  mark_as_advanced(SUITESPARSE_LIBRARY)
+endif()
+
+# Check for SUITESPARSECONFIG library
+find_library(SUITESPARSECONFIG_LIBRARY suitesparseconfig
+  PATHS ${UMFPACK_DIR}/lib $ENV{UMFPACK_DIR}/lib
+  NO_DEFAULT_PATH
+  DOC "The SUITESPARSE library"
+  )
+find_library(SUITESPARSECONFIG_LIBRARY suitesparseconfig
+  DOC "The SUITESPARSE library"
+  )
+mark_as_advanced(SUITESPARSECONFIG_LIBRARY)
+
+# Collect libraries
+if (AMD_FOUND)
+  set(UMFPACK_LIBRARIES ${UMFPACK_LIBRARY} ${AMD_LIBRARIES})
+endif()
+if (BLAS_FOUND)
+  set(UMFPACK_LIBRARIES ${UMFPACK_LIBRARIES} ${BLAS_LIBRARIES})
+endif()
+if (CHOLMOD_FOUND)
+  set(UMFPACK_LIBRARIES ${UMFPACK_LIBRARIES} ${CHOLMOD_LIBRARIES})
+endif()
+
+if (SUITESPARSE_LIBRARY)
+  set(UMFPACK_LIBRARIES ${UMFPACK_LIBRARIES} ${SUITESPARSE_LIBRARY})
+endif()
+if (SUITESPARSECONFIG_LIBRARY)
+  set(UMFPACK_LIBRARIES ${UMFPACK_LIBRARIES} ${SUITESPARSECONFIG_LIBRARY})
+endif()
+
+find_program(GFORTRAN_EXECUTABLE gfortran)
+if (GFORTRAN_EXECUTABLE)
+  execute_process(COMMAND ${GFORTRAN_EXECUTABLE} -print-file-name=libgfortran.so
+  OUTPUT_VARIABLE GFORTRAN_LIBRARY
+  OUTPUT_STRIP_TRAILING_WHITESPACE)
+  if (EXISTS "${GFORTRAN_LIBRARY}")
+    set(UMFPACK_LIBRARIES ${UMFPACK_LIBRARIES} ${GFORTRAN_LIBRARY})
+  endif()
+endif()
+
+# Try compiling and running test program
+if (DOLFIN_SKIP_BUILD_TESTS)
+  set(UMFPACK_TEST_RUNS TRUE)
+elseif (UMFPACK_INCLUDE_DIRS AND UMFPACK_LIBRARIES AND AMD_LIBRARIES)
+
+  # Set flags for building test program
+  set(CMAKE_REQUIRED_INCLUDES ${UMFPACK_INCLUDE_DIRS})
+  set(CMAKE_REQUIRED_LIBRARIES ${UMFPACK_LIBRARIES})
+
+  # Build and run test program
+  include(CheckCXXSourceRuns)
+  check_cxx_source_runs("
+/* Test program umfpack-ex1.c */
+
+#include <umfpack.h>
+
+int main()
+{
+  int n = 5;
+  double x[5];
+  void *Symbolic, *Numeric;
+  int i;
+
+  int Ap[] = { 0, 2, 5, 9, 10, 12 };
+  int Ai[] = { 0, 1, 0,  2, 4, 1,  2, 3, 4, 2, 1, 4 };
+  double Ax[] = { 2, 3, 3, -1, 4, 4, -3, 1, 2, 2, 6, 1 };
+  double b[] = { 8, 45, -3, 3, 19 };
+
+  umfpack_di_symbolic(n, n, Ap, Ai, Ax, &Symbolic, NULL, NULL);
+  umfpack_di_numeric(Ap, Ai, Ax, Symbolic, &Numeric, NULL, NULL);
+  umfpack_di_free_symbolic(&Symbolic);
+
+  umfpack_di_solve(UMFPACK_A, Ap, Ai, Ax, x, b, Numeric, NULL, NULL);
+  umfpack_di_free_numeric(&Numeric);
+
+  return 0;
+}
+" UMFPACK_TEST_RUNS)
+
+endif()
+
+# Standard package handling
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(UMFPACK
+  "UMFPACK could not be found. Be sure to set UMFPACK_DIR."
+  UMFPACK_LIBRARIES UMFPACK_INCLUDE_DIRS AMD_LIBRARIES BLAS_LIBRARIES UMFPACK_TEST_RUNS)
diff --git a/cmake/modules/ResolveCompilerPaths.cmake b/cmake/modules/ResolveCompilerPaths.cmake
new file mode 100644
index 0000000..92541e9
--- /dev/null
+++ b/cmake/modules/ResolveCompilerPaths.cmake
@@ -0,0 +1,111 @@
+# ResolveCompilerPaths - this module defines two macros
+#
+# RESOLVE_LIBRARIES (XXX_LIBRARIES LINK_LINE)
+#  This macro is intended to be used by FindXXX.cmake modules.
+#  It parses a compiler link line and resolves all libraries
+#  (-lfoo) using the library path contexts (-L/path) in scope.
+#  The result in XXX_LIBRARIES is the list of fully resolved libs.
+#  Example:
+#
+#    RESOLVE_LIBRARIES (FOO_LIBRARIES "-L/A -la -L/B -lb -lc -ld")
+#
+#  will be resolved to
+#
+#    FOO_LIBRARIES:STRING="/A/liba.so;/B/libb.so;/A/libc.so;/usr/lib/libd.so"
+#
+#  if the filesystem looks like
+#
+#    /A:       liba.so         libc.so
+#    /B:       liba.so libb.so
+#    /usr/lib: liba.so libb.so libc.so libd.so
+#
+#  and /usr/lib is a system directory.
+#
+#  Note: If RESOLVE_LIBRARIES() resolves a link line differently from
+#  the native linker, there is a bug in this macro (please report it).
+#
+# RESOLVE_INCLUDES (XXX_INCLUDES INCLUDE_LINE)
+#  This macro is intended to be used by FindXXX.cmake modules.
+#  It parses a compile line and resolves all includes
+#  (-I/path/to/include) to a list of directories.  Other flags are ignored.
+#  Example:
+#
+#    RESOLVE_INCLUDES (FOO_INCLUDES "-I/A -DBAR='\"irrelevant -I/string here\"' -I/B")
+#
+#  will be resolved to
+#
+#    FOO_INCLUDES:STRING="/A;/B"
+#
+#  assuming both directories exist.
+#  Note: as currently implemented, the -I/string will be picked up mistakenly (cry, cry)
+include (CorrectWindowsPaths)
+
+macro (RESOLVE_LIBRARIES LIBS LINK_LINE)
+  string (REGEX MATCHALL "((-L|-l|-Wl)([^\" ]+|\"[^\"]+\")|[^\" ]+\\.(a|so|dll|lib))" _all_tokens "${LINK_LINE}")
+  set (_libs_found)
+  set (_directory_list)
+  foreach (token ${_all_tokens})
+    if (token MATCHES "-L([^\" ]+|\"[^\"]+\")")
+      # If it's a library path, add it to the list
+      string (REGEX REPLACE "^-L" "" token ${token})
+      string (REGEX REPLACE "//" "/" token ${token})
+      convert_cygwin_path(token)
+      list (APPEND _directory_list ${token})
+    elseif (token MATCHES "^(-l([^\" ]+|\"[^\"]+\")|[^\" ]+\\.(a|so|dll|lib))")
+      # It's a library, resolve the path by looking in the list and then (by default) in system directories
+      if (WIN32) #windows expects "libfoo", linux expects "foo"
+        string (REGEX REPLACE "^-l" "lib" token ${token})
+      else (WIN32)
+        string (REGEX REPLACE "^-l" "" token ${token})
+      endif (WIN32)
+      set (_root)
+      if (token MATCHES "^/")	# We have an absolute path
+        #separate into a path and a library name:
+        string (REGEX MATCH "[^/]*\\.(a|so|dll|lib)$" libname ${token})
+        string (REGEX MATCH ".*[^${libname}$]" libpath ${token})
+        convert_cygwin_path(libpath)
+        set (_directory_list ${_directory_list} ${libpath})
+        set (token ${libname})
+      endif (token MATCHES "^/")
+      set (_lib "NOTFOUND" CACHE FILEPATH "Cleared" FORCE)
+      # First search only the HINTS paths, then (if nothing was found) CMake's
+      # default paths.
+      find_library (_lib ${token}
+                    HINTS ${_directory_list}
+                    NO_DEFAULT_PATH
+                    ${_root})
+      find_library (_lib ${token} ${_root})
+      if (_lib)
+	string (REPLACE "//" "/" _lib ${_lib})
+        list (APPEND _libs_found ${_lib})
+      else (_lib)
+        message (STATUS "Unable to find library ${token}")
+      endif (_lib)
+    endif (token MATCHES "-L([^\" ]+|\"[^\"]+\")")
+  endforeach (token)
+  set (_lib "NOTFOUND" CACHE INTERNAL "Scratch variable" FORCE)
+  # only the LAST occurence of each library is required since there should be no circular dependencies
+  if (_libs_found)
+    list (REVERSE _libs_found)
+    list (REMOVE_DUPLICATES _libs_found)
+    list (REVERSE _libs_found)
+  endif (_libs_found)
+  set (${LIBS} "${_libs_found}")
+endmacro (RESOLVE_LIBRARIES)
+
+macro (RESOLVE_INCLUDES INCS COMPILE_LINE)
+  string (REGEX MATCHALL "-I([^\" ]+|\"[^\"]+\")" _all_tokens "${COMPILE_LINE}")
+  set (_incs_found)
+  foreach (token ${_all_tokens})
+    string (REGEX REPLACE "^-I" "" token ${token})
+    string (REGEX REPLACE "//" "/" token ${token})
+    convert_cygwin_path(token)
+    if (EXISTS ${token})
+      list (APPEND _incs_found ${token})
+    else (EXISTS ${token})
+      message (STATUS "Include directory ${token} does not exist")
+    endif (EXISTS ${token})
+  endforeach (token)
+  list (REMOVE_DUPLICATES _incs_found)
+  set (${INCS} "${_incs_found}")
+endmacro (RESOLVE_INCLUDES)
diff --git a/cmake/modules/language_support_v2.cmake b/cmake/modules/language_support_v2.cmake
new file mode 100644
index 0000000..aa5870b
--- /dev/null
+++ b/cmake/modules/language_support_v2.cmake
@@ -0,0 +1,65 @@
+# cmake/modules/language_support.cmake
+#
+# Temporary additional general language support is contained within this
+# file.  
+
+# This additional function definition is needed to provide a workaround for
+# CMake bug 9220.
+
+# On debian testing (cmake 2.6.2), I get return code zero when calling 
+# cmake the first time, but cmake crashes when running a second time
+# as follows:
+#
+#  -- The Fortran compiler identification is unknown
+#  CMake Error at /usr/share/cmake-2.6/Modules/CMakeFortranInformation.cmake:7 (GET_FILENAME_COMPONENT):
+#    get_filename_component called with incorrect number of arguments
+#  Call Stack (most recent call first):
+#    CMakeLists.txt:3 (enable_language)
+#
+# My workaround is to invoke cmake twice.  If both return codes are zero, 
+# it is safe to invoke ENABLE_LANGUAGE(Fortran OPTIONAL)
+
+function(workaround_9220 language language_works)
+  #message("DEBUG: language = ${language}")
+  set(text
+    "project(test NONE)
+cmake_minimum_required(VERSION 2.6.0)
+enable_language(${language} OPTIONAL)
+"
+    )
+  file(REMOVE_RECURSE ${CMAKE_BINARY_DIR}/language_tests/${language})
+  file(MAKE_DIRECTORY ${CMAKE_BINARY_DIR}/language_tests/${language})
+  file(WRITE ${CMAKE_BINARY_DIR}/language_tests/${language}/CMakeLists.txt
+    ${text})
+  execute_process(
+    COMMAND ${CMAKE_COMMAND} .
+    WORKING_DIRECTORY ${CMAKE_BINARY_DIR}/language_tests/${language}
+    RESULT_VARIABLE return_code
+    OUTPUT_QUIET
+    ERROR_QUIET
+    )
+
+  if(return_code EQUAL 0)
+    # Second run
+    execute_process (
+      COMMAND ${CMAKE_COMMAND} .
+      WORKING_DIRECTORY ${CMAKE_BINARY_DIR}/language_tests/${language}
+      RESULT_VARIABLE return_code
+      OUTPUT_QUIET
+      ERROR_QUIET
+      )
+    if(return_code EQUAL 0)
+      set(${language_works} ON PARENT_SCOPE)
+    else(return_code EQUAL 0)
+      set(${language_works} OFF PARENT_SCOPE)
+    endif(return_code EQUAL 0)
+  else(return_code EQUAL 0)
+    set(${language_works} OFF PARENT_SCOPE)
+  endif(return_code EQUAL 0)
+endfunction(workaround_9220)
+
+# Temporary tests of the above function.
+#workaround_9220(CXX CXX_language_works)
+#message("CXX_language_works = ${CXX_language_works}")
+#workaround_9220(CXXp CXXp_language_works)
+#message("CXXp_language_works = ${CXXp_language_works}")
diff --git a/cmake/post-install/CMakeLists.txt b/cmake/post-install/CMakeLists.txt
new file mode 100644
index 0000000..7ae46de
--- /dev/null
+++ b/cmake/post-install/CMakeLists.txt
@@ -0,0 +1,22 @@
+install(CODE "MESSAGE(
+\"----------------------------------------------------------------------------
+DOLFIN has now been installed in
+
+    ${CMAKE_INSTALL_PREFIX}
+
+and the demo programs have been installed in
+
+    ${CMAKE_INSTALL_PREFIX}/${DOLFIN_SHARE_DIR}/demo
+
+Before rushing off to try the demos, don't forget to update your
+environment variables. This can be done easily using the helper file
+'dolfin.conf' which sets the appropriate variables (for users of the
+Bash shell).
+
+To update your environment variables, run the following command:
+
+    source ${CMAKE_INSTALL_PREFIX}/${DOLFIN_SHARE_DIR}/dolfin.conf
+
+For future reference, we recommend that you add this command to your
+configuration (.bashrc, .profile or similar).
+----------------------------------------------------------------------------\")")
diff --git a/cmake/scripts/codeexamples.py b/cmake/scripts/codeexamples.py
new file mode 100644
index 0000000..66d6700
--- /dev/null
+++ b/cmake/scripts/codeexamples.py
@@ -0,0 +1,217 @@
+"""This module provides a dictionary of code examples using the Python syntax.
+
+The idea is to substitute the code examples from the *.h files, which uses the
+C++ syntax, with code snippets from this dictionary."""
+
+# Copyright (C) 2010 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-10-14
+# Last changed: 2010-10-19
+
+codesnippets = {
+"Mesh":{
+"uint num_cells() const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.num_cells()
+    8
+""",
+"uint num_vertices() const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.num_vertices()
+    9
+""",
+"uint num_edges() const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.num_edges()
+    0
+    >>> mesh.init(1)
+    16
+    >>> mesh.num_edges()
+    16
+""",
+"uint num_faces() const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.num_faces()
+    8
+""",
+"uint num_facets() const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.num_facets()
+    0
+    >>> mesh.init(0,1)
+    >>> mesh.num_facets()
+    16
+""",
+"uint num_entities(uint d) const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.init(0,1)
+    >>> mesh.num_entities(0)
+    9
+    >>> mesh.num_entities(1)
+    16
+    >>> mesh.num_entities(2)
+    8
+""",
+"double* coordinates()":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(1,1)
+    >>> mesh.coordinates()
+    array([[ 0.,  0.],
+           [ 1.,  0.],
+           [ 0.,  1.],
+           [ 1.,  1.]])
+""",
+"const uint* cells() const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(1,1)
+    >>> mesh.cells()
+    array([[0, 1, 3],
+          [0, 2, 3]])
+""",
+"uint size(uint dim) const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.init(0,1)
+    >>> mesh.size(0)
+    9
+    >>> mesh.size(1)
+    16
+    >>> mesh.size(2)
+    8
+""",
+"dolfin::uint closest_cell(const Point& point) const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(1, 1)
+    >>> point = dolfin.Point(0.0, 2.0)
+    >>> mesh.closest_cell(point)
+    1
+""",
+"double hmin() const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.hmin()
+    0.70710678118654757
+""",
+"double hmax() const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.hmax()
+    0.70710678118654757
+""",
+"std::string str(bool verbose) const":
+"""
+.. code-block:: python
+
+    >>> mesh = dolfin.UnitSquare(2,2)
+    >>> mesh.str(False)
+    '<Mesh of topological dimension 2 (triangles) with 9 vertices and 8 cells, ordered>'
+"""
+},
+"MeshEntityIterator":
+{
+"MeshEntityIterator":
+"""
+The following example shows how to iterate over all mesh entities
+of a mesh of topological dimension dim:
+
+.. code-block:: python
+
+    >>> for e in dolfin.cpp.entities(mesh, 1):
+    ...     print e.index()
+
+The following example shows how to iterate over mesh entities of
+topological dimension dim connected (incident) to some mesh entity f:
+
+.. code-block:: python
+
+    >>> f = dolfin.cpp.MeshEntity(mesh, 0, 0)
+    >>> for e in dolfin.cpp.entities(f, 1):
+    ...     print e.index()
+"""
+},
+"Event":
+{
+"Event":
+"""
+.. code-block:: python
+
+    >>> event = dolfin.Event("System is stiff, damping is needed.", 3)
+    >>> for i in range(10):
+    ...     if i > 7:
+    ...         print i
+    ...         event()
+"""
+},
+"Progress":
+{
+"Progress":
+"""
+A progress bar may be used either in an iteration with a known number
+of steps:
+
+.. code-block:: python
+
+    >>> n = 1000000
+    >>> p = dolfin.Progress("Iterating...", n)
+    >>> for i in range(n):
+    ...     p += 1
+
+or in an iteration with an unknown number of steps:
+
+.. code-block:: python
+
+    >>> pr = dolfin.Progress("Iterating")
+    >>> t = 0.0
+    >>> n = 1000000.0
+    >>> while t < n:
+    ...     t += 1.0
+    ...     p += t/n
+"""
+}
+}
+
diff --git a/cmake/scripts/codesnippets.py b/cmake/scripts/codesnippets.py
new file mode 100644
index 0000000..d655e14
--- /dev/null
+++ b/cmake/scripts/codesnippets.py
@@ -0,0 +1,143 @@
+# Code snippets for autogenerations of SWIG code
+#
+# Copyright (C) 2012 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-01-17
+# Last changed: 2012-07-03
+
+copyright_statement = r"""%(comment)s Auto generated SWIG file for Python interface of DOLFIN
+%(comment)s
+%(comment)s Copyright (C) 2012 %(holder)s
+%(comment)s
+%(comment)s This file is part of DOLFIN.
+%(comment)s
+%(comment)s DOLFIN is free software: you can redistribute it and/or modify
+%(comment)s it under the terms of the GNU Lesser General Public License as published by
+%(comment)s the Free Software Foundation, either version 3 of the License, or
+%(comment)s (at your option) any later version.
+%(comment)s
+%(comment)s DOLFIN is distributed in the hope that it will be useful,
+%(comment)s but WITHOUT ANY WARRANTY; without even the implied warranty of
+%(comment)s MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+%(comment)s GNU Lesser General Public License for more details.
+%(comment)s
+%(comment)s You should have received a copy of the GNU Lesser General Public License
+%(comment)s along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+%(comment)s
+
+"""
+
+# FIXME: Removed date from copyright form 
+"""
+%(comment)s First added:  2012-01-18
+%(comment)s Last changed: %(year)d-%(month)0.2d-%(day)0.2d
+
+"""
+
+# Template code for all combined SWIG modules
+module_template = r"""
+// The PyDOLFIN extension module for the %(module)s module
+%%module(package="dolfin.cpp.%(module)s", directors="1") %(module)s
+
+// Define module name for conditional includes
+#define %(MODULE)sMODULE
+
+%%{
+%(headers)s
+
+// NumPy includes
+#define PY_ARRAY_UNIQUE_SYMBOL PyDOLFIN_%(MODULE)s
+#include <numpy/arrayobject.h>
+%%}
+
+%%init%%{
+import_array();
+%%}
+
+// Include global SWIG interface files:
+// Typemaps, shared_ptr declarations, exceptions, version
+%%include "dolfin/swig/globalincludes.i"
+%(imports)s
+
+// Turn on SWIG generated signature documentation and include doxygen
+// generated docstrings
+//%%feature("autodoc", "1");
+%(docstrings)s
+%(includes)s
+
+"""
+
+swig_cmakelists_str = \
+"""# Automatic get the module name
+get_filename_component(SWIG_MODULE_NAME ${CMAKE_CURRENT_BINARY_DIR} NAME)
+
+# Set project name
+project(${SWIG_MODULE_NAME})
+
+# What does this do?
+get_directory_property(cmake_defs COMPILE_DEFINITIONS)
+
+# Set SWIG flags 
+set(CMAKE_SWIG_FLAGS
+  -module ${SWIG_MODULE_NAME}
+  -shadow
+  -modern
+  -modernargs
+  -fastdispatch
+  -fvirtual
+  -nosafecstrings
+  -noproxydel
+  -fastproxy
+  -fastinit
+  -fastunpack
+  -fastquery
+  -nobuildnone
+  -Iinclude/swig
+  ${DOLFIN_CXX_DEFINITIONS}
+  ${DOLFIN_PYTHON_DEFINITIONS}
+  )
+
+# Get all SWIG interface files
+file(READ ${CMAKE_CURRENT_BINARY_DIR}/dependencies.txt DOLFIN_SWIG_DEPENDENCIES )
+
+# This prevents swig being run unnecessarily
+set_source_files_properties(module.i PROPERTIES SWIG_MODULE_NAME ${SWIG_MODULE_NAME})
+
+# Tell CMake SWIG has generated a C++ file
+set_source_files_properties(module.i PROPERTIES CPLUSPLUS ON)
+
+# Generate SWIG files in 
+set(CMAKE_SWIG_OUTDIR ${CMAKE_CURRENT_BINARY_DIR})
+
+# Tell CMake which SWIG interface files should be checked for changes when recompile
+set(SWIG_MODULE_${SWIG_MODULE_NAME}_EXTRA_DEPS copy_swig_files ${DOLFIN_SWIG_DEPENDENCIES})
+
+# Tell CMake to run SWIG on module.i and to link against libdolfin
+swig_add_module(${SWIG_MODULE_NAME} python module.i)
+swig_link_libraries(${SWIG_MODULE_NAME} dolfin ${PYTHON_LIBRARIES})
+
+# Install Python .py files
+get_target_property(SWIG_MODULE_LOCATION ${SWIG_MODULE_${SWIG_MODULE_NAME}_REAL_NAME} LOCATION)
+install(FILES
+  ${SWIG_MODULE_LOCATION} ${CMAKE_CURRENT_BINARY_DIR}/${SWIG_MODULE_NAME}.py
+  DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin/cpp
+  COMPONENT RuntimeLibraries
+  )
+"""
+
+
diff --git a/cmake/scripts/copy-swig-files b/cmake/scripts/copy-swig-files
new file mode 100755
index 0000000..58b9eaf
--- /dev/null
+++ b/cmake/scripts/copy-swig-files
@@ -0,0 +1,59 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Copy all swig files to a destination directory
+
+import os
+import sys 
+import re
+import shutil
+
+script_rel_path = os.sep.join(__file__.split(os.sep)[:-1])
+script_rel_path = script_rel_path or "."
+dolfin_dir = os.path.abspath(os.path.join(script_rel_path, os.pardir, os.pardir))
+
+def copy_data(top_destdir):
+
+    abs_destdir = top_destdir if os.path.isabs(top_destdir) else os.path.join(dolfin_dir, top_destdir)
+
+    if abs_destdir == dolfin_dir:
+        raise RuntimeError("destination directory cannot be the same as "\
+                           "the dolfin source directory")
+    
+    if not os.path.isdir(abs_destdir):
+        raise RuntimeError("%s is not a directory." % abs_destdir)
+
+    top_dir = os.path.join(dolfin_dir, "dolfin", "swig")
+        
+    for dirpath, dirnames, filenames in os.walk(top_dir):
+        destdir = dirpath.replace(dolfin_dir, abs_destdir)
+        if not os.path.isdir(destdir):
+            os.makedirs(destdir)
+        for f in filenames:
+            if f[-2:] == ".i":
+                srcfile = os.path.join(dirpath, f)
+                shutil.copy2(srcfile, destdir)
+                
+if __name__ == "__main__":
+    # Expecting a destination argument
+    if len(sys.argv) != 2:
+        raise RuntimeError("Expecting 1 argument with the destination directory")
+    
+    copy_data(sys.argv[-1])
+    
diff --git a/cmake/scripts/copy-test-demo-data b/cmake/scripts/copy-test-demo-data
new file mode 100755
index 0000000..4054a73
--- /dev/null
+++ b/cmake/scripts/copy-test-demo-data
@@ -0,0 +1,71 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Copy all data, tests and demo to a given directory relative to the top dolfin
+# source directory
+
+import os
+import sys 
+import re
+import shutil
+
+# Subdirectories
+sub_directories = ['demo', 'test', 'bench']
+
+# Copy all files with the following suffixes
+suffix_patterns = ["py", "h", "cpp", "ufl", "xml", "xml.gz", "off", "inp", \
+                   "msh", "supp", "rst", "ele", "node", "grid", "edge"]
+
+suffix_pattern = re.compile("(%s),"%("|".join("[\w-]+\.%s" % pattern \
+                                             for pattern in suffix_patterns)))
+
+script_rel_path = os.sep.join(__file__.split(os.sep)[:-1])
+script_rel_path = script_rel_path or "."
+dolfin_dir = os.path.abspath(os.path.join(script_rel_path, os.pardir, os.pardir))
+
+def copy_data(top_destdir):
+
+    abs_destdir = top_destdir if os.path.isabs(top_destdir) else os.path.join(dolfin_dir, top_destdir)
+
+    if abs_destdir == dolfin_dir:
+        raise RuntimeError("destination directory cannot be the same as "\
+                           "the dolfin source directory")
+    
+    if not os.path.isdir(abs_destdir):
+        raise RuntimeError("%s is not a directory." % abs_destdir)
+        
+    for subdir in sub_directories:
+
+        top_dir = os.path.join(dolfin_dir, subdir)
+        for dirpath, dirnames, filenames in os.walk(top_dir):
+            destdir = dirpath.replace(dolfin_dir, abs_destdir)
+            if not os.path.isdir(destdir):
+                os.makedirs(destdir)
+            for f in re.findall(suffix_pattern, " ".join(\
+                "%s,"%f for f in filenames)):
+                srcfile = os.path.join(dirpath, f)
+                shutil.copy(srcfile, destdir)
+                
+if __name__ == "__main__":
+    # Expecting a destination argument
+    if len(sys.argv) != 2:
+        raise RuntimeError("Expecting 1 argument with the destination directory")
+    
+    copy_data(sys.argv[-1])
+    
diff --git a/cmake/scripts/download-demo-data b/cmake/scripts/download-demo-data
new file mode 100755
index 0000000..1cc8da6
--- /dev/null
+++ b/cmake/scripts/download-demo-data
@@ -0,0 +1,70 @@
+#!/bin/sh
+#
+# This script downloads data (mostly meshes) needed run demos
+# Anders Logg, 2013-03-21
+
+download_mesh()
+{
+    OS=$(uname -s)
+
+    DEMO=$1
+    MESH=$2
+
+    echo "Downloading $MESH to $DEMO"
+
+    # Use zsync if available, otherwise use curl/wget
+    if hash zsync 2>/dev/null; then
+        zsync -q -o $DEMO/$MESH http://fenicsproject.org/pub/data/meshes/$MESH.zsync
+    else
+        if [ "$OS" = "Darwin" ]; then
+            output=`curl --output $MESH http://fenicsproject.org/pub/data/meshes/$MESH 2>&1`
+        else
+            output=`wget http://fenicsproject.org/pub/data/meshes/$MESH 2>&1`
+        fi
+
+	    # If download fails
+	    if [ $? -ne 0 ]; then
+            echo "$output" 1>&2
+	        exit 1
+	    fi
+
+        mv $MESH $DEMO
+    fi
+}
+
+download_mesh demo/documented/eigenvalue                     box_with_dent.xml.gz
+download_mesh demo/undocumented/mixed-poisson-sphere         sphere_16.xml.gz
+download_mesh demo/undocumented/advection-diffusion          dolfin_fine.xml.gz
+download_mesh demo/undocumented/advection-diffusion          dolfin_fine_velocity.xml.gz
+download_mesh demo/undocumented/advection-diffusion          dolfin_fine_subdomains.xml.gz
+download_mesh demo/undocumented/contact-vi-snes              circle_yplane.xml.gz
+download_mesh demo/undocumented/contact-vi-tao               circle_yplane.xml.gz
+download_mesh demo/undocumented/multistage-solver            dolfin_fine.xml.gz
+download_mesh demo/undocumented/multistage-solver            dolfin_fine_velocity.xml.gz
+download_mesh demo/undocumented/multistage-solver            dolfin_fine_subdomains.xml.gz
+download_mesh demo/undocumented/elasticity                   gear.xml.gz
+download_mesh demo/undocumented/lift-drag                    dolfin_fine.xml.gz
+download_mesh demo/undocumented/lift-drag                    dolfin_fine_pressure.xml.gz
+download_mesh demo/documented/tensor-weighted-poisson        unitsquare_32_32.xml.gz
+download_mesh demo/documented/tensor-weighted-poisson        unitsquare_32_32_c01.xml.gz
+download_mesh demo/documented/tensor-weighted-poisson        unitsquare_32_32_c00.xml.gz
+download_mesh demo/documented/tensor-weighted-poisson        unitsquare_32_32_c11.xml.gz
+download_mesh demo/documented/stokes-taylor-hood/            dolfin_fine.xml.gz
+download_mesh demo/documented/stokes-taylor-hood             dolfin_fine_subdomains.xml.gz
+download_mesh demo/undocumented/elastodynamics               dolfin_fine.xml.gz
+download_mesh demo/undocumented/auto-adaptive-navier-stokes  channel_with_flap.xml.gz
+download_mesh demo/documented/stokes-mini                    dolfin_fine.xml.gz
+download_mesh demo/documented/stokes-mini                    dolfin_fine_subdomains.xml.gz
+download_mesh demo/documented/subdomains                     dolfin_fine.xml.gz
+download_mesh demo/documented/stokes-stabilized              dolfin_fine.xml.gz
+download_mesh demo/documented/stokes-stabilized              dolfin_fine_subdomains.xml.gz
+download_mesh demo/undocumented/plot                         dolfin_fine.xml.gz
+download_mesh demo/undocumented/dg-advection-diffusion       unitsquare_64_64.xml.gz
+download_mesh demo/undocumented/dg-advection-diffusion       unitsquare_64_64_velocity.xml.gz
+download_mesh demo/documented/bcs                            aneurysm.xml.gz
+download_mesh demo/documented/navier-stokes                  lshape.xml.gz
+download_mesh demo/undocumented/mesh-quality                 dolfin_fine.xml.gz
+download_mesh test/unit/fem/python                           aneurysm.xml.gz
+download_mesh test/unit/io                                   snake.xml.gz
+download_mesh test/unit/nls/python                           doughnut.xml.gz
+download_mesh test/unit/mesh                                 boxes.xml.gz
diff --git a/cmake/scripts/generate-all b/cmake/scripts/generate-all
new file mode 100755
index 0000000..785d2b8
--- /dev/null
+++ b/cmake/scripts/generate-all
@@ -0,0 +1,20 @@
+#!/bin/sh
+#
+# This script runs all the others.
+
+echo "The following scripts will now be run:"
+echo ""
+echo "  cmake/scripts/generate-form-files"
+echo "  cmake/scripts/generate-cmakefiles"
+echo "  cmake/scripts/generate-swig-docstrings"
+echo "  cmake/scripts/generate-swig-interface"
+echo "  cmake/scripts/download-demo-data"
+echo ""
+echo "Press return to continue."
+read x
+
+./cmake/scripts/generate-form-files
+./cmake/scripts/generate-cmakefiles
+./cmake/scripts/generate-swig-docstrings
+./cmake/scripts/generate-swig-interface
+./cmake/scripts/download-demo-data
diff --git a/cmake/scripts/generate-cmakefiles b/cmake/scripts/generate-cmakefiles
new file mode 100755
index 0000000..e5a25d3
--- /dev/null
+++ b/cmake/scripts/generate-cmakefiles
@@ -0,0 +1,179 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2010 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Generate CMakeLists.txt files in demo and test directories
+# This script should be run from the top level directory.
+#
+# Modified by Anders Logg 2013, 2014
+
+import os
+import subprocess
+
+cmakelists_str = \
+"""# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME %(project_name)s)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+%(executables)s
+
+# Target libraries
+%(target_libraries)s
+"""
+
+executable_str = "add_executable(%s %s)"
+target_link_libraries_str = "target_link_libraries(%s "\
+                            "${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})"
+
+# Subdirectories
+sub_directories = ['demo', 'test', 'bench']
+
+# Prefix map for subdirectories
+executable_prefixes = dict(test="test_",
+                           demo="demo_",
+                           bench="bench_")
+
+# Main file name map for subdirectories
+main_file_names = dict(test="test.cpp",
+                       demo="main.cpp",
+                       bench="main.cpp")
+
+# Projects that use custom CMakeLists.txt (shouldn't overwrite)
+exclude_projects = [os.path.join('demo', 'undocumented', 'plot-qt'),
+                    os.path.join('demo', 'undocumented', 'csg'),
+                    os.path.join('demo', 'undocumented', 'meshintersection')]
+
+def generate_cmake_files(subdirectory, generated_files):
+    """Search for C++ code and write CMakeLists.txt files"""
+    cwd = os.getcwd()
+    executable_prefix = executable_prefixes[subdirectory]
+    main_file_name = main_file_names[subdirectory]
+    for root, dirs, files in os.walk(cwd + "/" + subdirectory):
+
+        executable_names = set()
+
+        # For 'cpp' directories, get list of .cpp files
+        if "cpp" in dirs:
+            cpp_files = []
+            program_dir = root + "/cpp"
+            program_name = os.path.split(root)[-1]
+
+            skip = False
+            for exclude in exclude_projects :
+                if exclude in root :
+                    skip = True
+
+            if skip :
+                print "Skipping custom CMakeLists.txt file:", root
+                continue
+
+            if executable_prefix == "bench_":
+                program_name = program_dir[program_dir.find("bench")+6:].replace(os.path.sep, "_")
+
+            name_forms = dict(
+                project_name=executable_prefix + program_name,
+                executables="NOT_SET",
+                target_libraries="NOT_SET")
+            for f in os.listdir(program_dir):
+                filename, extension = os.path.splitext(f)
+                if extension == ".cpp":
+                    cpp_files.append(f)
+
+            # If no .cpp continue
+            if not cpp_files:
+                continue
+
+            # Name of demo and cpp source files
+            if main_file_name in cpp_files:
+
+                # If directory contains a main file we assume that only one
+                # executable should be generated for this directory and all other
+                # .cpp files should be linked to this
+                name_forms["executables"] = executable_str % \
+                                            ("${PROJECT_NAME}",
+                                             ' '.join(cpp_files))
+                name_forms["target_libraries"] = target_link_libraries_str % \
+                                                 "${PROJECT_NAME}"
+            else:
+                # If no main file in source files, we assume each source should
+                # be compiled as an executable
+                name_forms["executables"] = "\n".join(\
+                    executable_str % (executable_prefix + f.replace(".cpp", ""), f) \
+                    for f in cpp_files)
+                name_forms["target_libraries"] = "\n".join(\
+                    target_link_libraries_str % (\
+                        executable_prefix + f.replace(".cpp", "")) \
+                    for f in cpp_files)
+
+            # Check for duplicate executable names
+            if program_name not in executable_names:
+                executable_names.add(program_name)
+            else:
+                print "Warning: duplicate executable names found when generating CMakeLists.txt files."
+
+            # Write file
+            filename = os.path.join(program_dir, "CMakeLists.txt")
+            generated_files.append(filename)
+            with open(filename, "w") as f:
+                print "Creating CMakeLists.txt file:", program_name, program_dir
+                f.write(cmakelists_str % name_forms)
+
+            # FIXME: add command line option for adding files
+            # Add to version control
+            #subprocess.call(["bzr", "add", program_dir + "/CMakeLists.txt"])
+
+# Generate CMakeLists.txt files for all subdirectories
+generated_files = []
+for subdirectory in sub_directories:
+    generate_cmake_files(subdirectory, generated_files)
+
+# Print list of generated files
+print "The following files were generated:"
+print "\n".join(generated_files)
diff --git a/cmake/scripts/generate-form-files b/cmake/scripts/generate-form-files
new file mode 100755
index 0000000..068487c
--- /dev/null
+++ b/cmake/scripts/generate-form-files
@@ -0,0 +1,81 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2005-2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Recompile all ffc forms (use when FFC has been updated)
+# This script should be run from the top level directory.
+
+import os
+
+# Forms that need special options
+special = {"CahnHilliard2D.ufl":       "-fsplit",
+           "CahnHilliard3D.ufl":       "-fsplit",
+           "Poisson2D_1.ufl":         "-fsplit",
+           "Poisson2D_2.ufl":         "-fsplit",
+           "Poisson2D_3.ufl":         "-fsplit",
+           "Poisson2D_4.ufl":         "-fsplit",
+           "Poisson2D_5.ufl":         "-fsplit",
+           "Poisson3D_1.ufl":         "-fsplit",
+           "Poisson3D_2.ufl":         "-fsplit",
+           "Poisson3D_3.ufl":         "-fsplit",
+           "Poisson3D_4.ufl":         "-fsplit",
+           "Poisson3D_5.ufl":         "-fsplit",
+           "AdaptivePoisson.ufl":      "-e",
+           "AdaptiveNavierStokes.ufl": "-e"}
+
+# Forms for which we should skip optimization
+skip_optimization = ["HyperElasticity.ufl"]
+
+# Forms for which we don't want to generate functions for evaluating the basis
+skip_basis = ["Poisson2D_5.ufl", "Poisson3D_4.ufl"]
+
+# Directories to scan
+subdirs = ["dolfin", "demo", "bench", "test"]
+
+# Compile all form files
+topdir = os.getcwd()
+for subdir in subdirs:
+    for root, dirs, files in os.walk(subdir):
+
+        # Check for .ufl files
+        formfiles = [f for f in files if len(f) > 4 and f[-4:] == ".ufl"]
+        if len(formfiles) == 0:
+            continue
+
+        # Compile files
+        os.chdir(root)
+        print "Compiling forms in %s..." % root
+        for f in formfiles:
+            if f in special:
+                options = special[f]
+            else:
+                options = ""
+            if f in skip_optimization:
+                optimization = ""
+            else:
+                optimization = "-O"
+
+            if f in skip_basis:
+                options += " -fno-evaluate_basis -fno-evaluate_basis_derivatives"
+
+            command = "ffc -v %s -f no_ferari -l dolfin %s %s >> compile.log" % (optimization, options, f)
+            print "  " + command
+            ret = os.system(command)
+            if not ret == 0:
+                raise RuntimeError, "Unable to compile form: %s/%s" % (root, f)
+        os.chdir(topdir)
diff --git a/cmake/scripts/generate-swig-docstrings b/cmake/scripts/generate-swig-docstrings
new file mode 100755
index 0000000..56625e9
--- /dev/null
+++ b/cmake/scripts/generate-swig-docstrings
@@ -0,0 +1,460 @@
+#!/usr/bin/env python
+"""Simple functions to update the docstrings.i file for the Python interface
+from the intermediate representation of the documentation which is extracted
+from the C++ source code of DOLFIN.
+
+This script assumes that all functions and classes lives in the dolfin namespace.
+"""
+
+# Copyright (C) 2010 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johan Hake 2010
+# Modified by Anders E. Johansen 2011
+# Modified by Anders Logg 2014
+#
+# First added:  2010-08-19
+# Last changed: 2014-03-03
+
+import os, shutil, types, sys
+
+# Add path to dolfin_utils and import the documentation extractor.
+doc_dir = os.path.abspath("site-packages")
+sys.path.append(doc_dir)
+
+from dolfin_utils.documentation import extract_doc_representation
+from dolfin_utils.documentation import indent, add_links
+from codeexamples import codesnippets
+
+debug_output = False
+
+def output(out):
+    global debug_output
+    if debug_output:
+        print out
+
+docstring = '%%feature("docstring")  %s "\n%s\n";\n\n'
+
+# Dictionary for mapping C++ types to Python types.
+# NOTE: KBO: The dictionary is not complete and is only tested for the Mesh.h class
+cpp_to_python = {
+"std::string": "str",
+"string": "str",
+
+"enum": "int",
+
+"int": "int",
+"unsigned int": "int",
+"uint": "int",
+"dolfin::uint": "int",
+"std::size_t": "int",
+"uint*": "numpy.array(uint)",
+"dolfin::uint*": "numpy.array(uint)",
+"std::size_t*": "numpy.array(uintp)",
+
+"double": "float",
+"double*": "numpy.array(float)",
+"real": "float",
+"dolfin::real": "float",
+
+"bool": "bool",
+}
+
+def get_function_name(signature):
+    "Extract function name from signature."
+    words = signature.split("(")[0].split()
+    # Special handling of operator since Swig needs 'operator double', not just
+    # 'double', which is different from _normal_ operators like 'operator='
+    if len(words) > 1 and words[-2] == "operator":
+        return " ".join(words[-2:])
+    return words[-1]
+
+def group_overloaded_functions(docs):
+    """Group functions with same name, but different signature.
+    Assuming that overloaded functions in the dolfin namespace are defined
+    in the same header file."""
+
+    new_docs = []
+    for (classname, parent, comment, function_documentation) in docs:
+        func_doc = {}
+        order = []
+#        print "cls: ", classname
+        # Iterate over class functions
+        for (signature, comm) in function_documentation:
+            # No need to put empty docstrings in the docstrings.i file!
+            if comm is None:
+                continue
+#            print "sig: ", signature
+            name = get_function_name(signature)
+            if not name in order:
+                order.append(name)
+#            print "name: '%s'" % name
+            if not name in func_doc:
+                func_doc[name] = [(signature, comm)]
+            else:
+                func_doc[name].append((signature, comm))
+        new_docs.append((classname, parent, comment, func_doc, order))
+
+    return new_docs
+
+def replace_example(text, classname, signature):
+    """Replace the C++ example code with the Python equivalent.
+    Currently we can only handle one block/section of example code per function.
+    """
+    # Check if we need to manipulate comment.
+    if not "*Example*" in text:
+        return text
+    # Check if we have example code in the dictionary
+    examplecode = ".. note::\n\n    No example code available for this function."
+    if not classname in codesnippets:
+        output(" "*6 + "No example code for class: '%s'" % classname)
+    elif not signature in codesnippets[classname]:
+        output(" "*6 + "No example code for (class, function): ('%s', '%s')" % (classname, signature))
+    else:
+        examplecode = codesnippets[classname][signature]
+
+    # Remove leading and trailing new lines in example code.
+    lines = examplecode.split("\n")
+    while lines and not lines[0].strip():
+        del lines[0]
+    while lines and not lines[-1].strip():
+        del lines[-1]
+    examplecode = "\n".join(lines)
+
+    # NOTE: KBO: We currently only handle 1 example block
+    new_text = []
+    example = False
+    indentation = 0
+    # Loop comment lines
+    for l in text.split("\n"):
+        # When we get to the lines containing the example, add the header and
+        # codeblock.
+        if not example and "*Example*" in l:
+            example = True
+            indentation = len(l) - len(l.lstrip())
+            new_text.append(l)
+            new_text += indent(examplecode, indentation + 4).split("\n")
+        elif example and l.strip() and len(l) - len(l.lstrip()) <= indentation:
+            example = False
+            new_text.append(l)
+        # Skip lines as long as we're inside the example block.
+        elif example:
+            continue
+        else:
+            new_text.append(l)
+    return "\n".join(new_text)
+
+def handle_std_pair(cpp_type, classnames):
+    """Map std::pair to Python object."""
+
+    args = cpp_type.split(">")[0].split("<")[1].split(",")
+    if (len(args) != 2):
+        output("No typemap handler implemented for %s" % cpp_type)
+        return cpp_type
+
+    arg1, arg2 = args
+    arg1 = arg1.strip()
+    arg2 = arg2.strip()
+
+    if arg1 in cpp_to_python:
+        arg1 = cpp_to_python[arg1]
+        if not arg2 in cpp_to_python:
+            output("No type map for '%s'!" % cpp_type)
+            return cpp_type
+        arg2 = cpp_to_python[arg2]
+        return "(%s, %s)" % (arg1, arg2)
+
+    elif arg1[0] == "_" and arg1[-1] == "_" and arg1[1:-1] in classnames:
+        if not arg2 in cpp_to_python:
+            output("No type map for '%s'!" % cpp_type)
+            return cpp_type
+        arg2 = cpp_to_python[arg2]
+        return "Swig Object< std::pair<%s, %s> >" % (arg1, arg2)
+
+    else:
+        return None
+
+def handle_std_vector(cpp_type, classnames):
+    """Map std::vector to Python object (numpy.array)."""
+
+    # Special case: vector of pairs
+    if "std::pair" in cpp_type and not cpp_type.startswith("std::pair"):
+        try:
+            arg1, arg2 = cpp_type.split("<")[2].split(">")[0].split(",")
+            pair = "std::pair<%s,%s>" % (arg1, arg2)
+            if handle_std_pair(pair, classnames) is not None:
+                return "numpy.array(%s)" % handle_std_pair(pair, classnames)
+            else:
+                return None
+        except:
+            # Failed to handle complex type, fail gracefully
+            return None
+    else:
+        arg = cpp_type.split("<")[1].split(">")[0].strip()
+        if not arg in cpp_to_python:
+            if arg[0] == "_" and arg[-1] == "_" and arg[1:-1] in classnames:
+                return "list of %s" % arg
+            else:
+                return None
+        return "numpy.array(%s)" % cpp_to_python[arg]
+
+# NOTE: KBO: This function is not complete and is only tested for the Mesh.h class
+def map_cpp_type(cpp_type, classnames):
+    "Map a C++ type to a Python type."
+
+    if cpp_type in cpp_to_python:
+        return cpp_to_python[cpp_type]
+
+    # std::vector --> numpy.array or list
+    elif "std::vector" in cpp_type:
+        pobject = handle_std_vector(cpp_type, classnames)
+        if pobject is not None:
+            return pobject
+        else:
+            output("No type map for '%s'!" % cpp_type)
+            return cpp_type
+
+    # Special handling of std::pair
+    elif "std::pair" in cpp_type:
+        pobject = handle_std_pair(cpp_type, classnames)
+        if pobject is not None:
+            return pobject
+        else:
+            output("No type map for '%s'!" % cpp_type)
+            return cpp_type
+
+    # dolfin::Array --> numpy.array (primitives only)
+    elif "_Array_" in cpp_type:
+        arg = cpp_type.split("<")[1].split(">")[0].strip()
+        if not arg in cpp_to_python:
+            output("No type map for '%s'!" % arg)
+            return "numpy.array(%s)" % arg
+        return "numpy.array(%s)" % cpp_to_python[arg]
+
+    # std::set --> set
+    elif "std::set" in cpp_type:
+        arg = cpp_type.split("<")[1].split(">")[0].strip()
+        if not arg in cpp_to_python:
+            output("No type map for '%s'!" % cpp_type)
+            return cpp_type
+        return "set of %s" % cpp_to_python[arg]
+
+    # Handle links to classes defined in DOLFIN.
+    elif cpp_type[0] == "_" and cpp_type[-1] == "_" and cpp_type[1:-1] in classnames:
+        return cpp_type
+
+    # Special case, e.g. cpp_type = boost::shared_ptr<_FunctionSpace_>
+    elif "_" in cpp_type:
+        args = cpp_type.split("_")
+        for arg in args:
+            if arg in classnames:
+                return "_" + arg + "_"
+        output("No type map for '%s'!" % cpp_type)
+
+    else:
+        output("No type map for '%s'!" % cpp_type)
+
+    return cpp_type
+
+def map_argument_and_return_types(text, classnames):
+    """Map C++ types in the *Arguments* and *Returns* sections to corresponding
+    Python types using a simple dictionary.
+
+    Current implementation assumes the following format:
+
+    *Returns*
+         type
+             description
+
+    *Arguments*
+         name0 (type)
+             description
+         name1 (type)
+             description
+
+    possibly separated with blank lines.
+    """
+
+    new_text = text
+
+    # Could perhaps be handled more elegantly if we rely on the formatting?
+    if "*Returns*" in new_text:
+        # Get lines and find line number with *Returns*
+        lines = new_text.split("\n")
+        r_index = ["*Returns*" in l for l in lines].index(True)
+        arg = False
+        for e, l in enumerate(lines):
+            if e > r_index and not arg:
+                # First none blank line contains our argument
+                if l.strip():
+                    arg = True
+                    indentation = len(l) - len(l.lstrip())
+                    lines[e] = indent(map_cpp_type(l.strip(), classnames), indentation)
+        new_text = "\n".join(lines)
+
+    if "*Arguments*" in new_text:
+        # Get lines and find line number with *Arguments*
+        lines = new_text.split("\n")
+        a_index = ["*Arguments*" in l for l in lines].index(True)
+        a_indent = len(lines[a_index]) - len(lines[a_index].lstrip())
+        n_indent = 0
+        for e, l in enumerate(lines):
+            if e > a_index and l.strip():
+                indentation = len(l) - len(l.lstrip())
+                # End of argument block
+                if indentation <= a_indent:
+                    break
+                # Determine indentation of lines with argument names
+                # first non blank line determines this
+                if n_indent == 0:
+                    n_indent = indentation
+                # Get type of arguments defined in lines with name and type
+                if indentation == n_indent:
+                    n, t = l.split("(")
+                    n = n.strip()
+                    t = t.split(")")[0]
+                    lines[e] = indent("%s (%s)" % (n, map_cpp_type(t.strip(), classnames)), n_indent)
+
+        new_text = "\n".join(lines)
+
+    return new_text
+
+def modify_doc(text, classnames, classname, signature):
+    "Add links, translate C++ to Python and change C++ types."
+
+    # Replace C++ example code with Python example code
+    text = replace_example(text, classname, signature)
+
+    # Map C++ types to corresponding Python types
+    text = map_argument_and_return_types(text, classnames)
+
+    # Add links
+    text = add_links(text, classnames, ":py:class:")
+
+    # Escape '"' otherwise will SWIG complain
+    text = text.replace('\"',r'\"')
+
+    return text
+
+def get_args(signature):
+    "Get argument names (for Python) from signature."
+#    print "sig: ", signature
+    arg_string = signature.split("(")[-1].split(")")[0]
+#    print "arg_string: '%s'" % arg_string
+    args = []
+    if arg_string:
+        # This does not handle ',' inside type declaration,
+        # e.g. std::pair<uint, uint>.
+        # args = [a.split()[-1] for a in arg_string.split(",")]
+        for a in arg_string.split(","):
+            arg = a.split()[-1]
+            # Assuming '::' is never in a name, but always
+            # present when dealing with e.g. 'std::pair'
+            # or boost::unordered_map.
+            if not "::" in arg:
+                args.append(arg)
+#    print "args: '%s'" % args
+    return args
+
+
+def write_docstrings(output_file, module, header, docs, classnames):
+    """Write docstrings from a header file."""
+
+    output_file.write("// Documentation extracted from: (module=%s, header=%s)\n" % (module, header))
+
+    documentation = group_overloaded_functions(docs)
+    for (classname, parent, comment, func_docs, order) in documentation:
+        # Create class documentation (if any) and write.
+        if classname is not None and comment is not None:
+            cls_doc = modify_doc(comment, classnames, classname, classname)
+            output_file.write(docstring % ("dolfin::%s" % classname, cls_doc))
+        # Handle functions in the correct order (according to definition in the
+        # header file).
+        for name in order:
+            func_name = "dolfin::%s::%s" % (classname, name)
+            if classname is None:
+                func_name = "dolfin::%s" % name
+
+            functions = func_docs[name]
+            if not functions:
+                continue
+            # We've got overloaded functions.
+            if len(functions) > 1:
+                func_doc = "**Overloaded versions**"
+                for signature, doc in functions:
+                    args = get_args(signature)
+                    doc = "\n\n* %s\ (%s)\n\n" % (name, ", ".join(args)) +\
+                          indent(doc, 2)
+                    func_doc += modify_doc(doc, classnames, classname, signature)
+                output_file.write(docstring % (func_name, func_doc))
+            # Single function
+            else:
+                # Get function (only one)
+                signature, func_doc = functions[0]
+                func_doc = modify_doc(func_doc, classnames, classname, signature)
+                output_file.write(docstring % (func_name, func_doc))
+
+def generate_docstrings(top_destdir):
+    """
+    Generate docstring files for each module
+    """
+
+    from codesnippets import copyright_statement
+
+    # Get top DOLFIN directory.
+    script_rel_path = os.sep.join(__file__.split(os.sep)[:-1])
+    script_rel_path = script_rel_path or "."
+    dolfin_dir = os.path.abspath(os.path.join(script_rel_path, os.pardir, os.pardir))
+
+    top_destdir = top_destdir or dolfin_dir
+
+    abs_destdir = top_destdir if os.path.isabs(top_destdir) else os.path.join(dolfin_dir, top_destdir)
+
+    if not os.path.isdir(abs_destdir):
+        raise RuntimeError("%s is not a directory." % abs_destdir)
+
+    # Set copyright form
+    copyright_form_swig = dict(comment = r"//", holder="Kristian B. Oelgaard")
+
+    # Extract documentation
+    documentation, classnames = extract_doc_representation(dolfin_dir)
+
+    output("Generating docstrings from intermediate representation module...")
+    for module in documentation:
+        if not os.path.isdir(os.path.join(abs_destdir, "dolfin", "swig", module)):
+            os.mkdir(os.path.join(abs_destdir, "dolfin", "swig", module))
+        output_file = open(os.path.join(abs_destdir, "dolfin", "swig", \
+                                        module, "docstrings.i"), "w")
+        output_file.write(copyright_statement%(copyright_form_swig))
+        output_file.write("// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.\n\n")
+
+        output(" "*2 + module)
+        for header, docs in documentation[module]:
+            output(" "*4 + header)
+            write_docstrings(output_file, module, header, docs, classnames)
+
+        output_file.close()
+
+if __name__ == "__main__":
+
+    if len(sys.argv) not in [1,2,3]:
+        raise RuntimeError("expected 0, 1 or 2 arguments")
+
+    dest_dir = sys.argv[1] if len(sys.argv) > 2 else ""
+    debug_output = len(sys.argv) > 2 and sys.argv[2] == "DEBUG"
+
+    generate_docstrings(dest_dir)
diff --git a/cmake/scripts/generate-swig-interface b/cmake/scripts/generate-swig-interface
new file mode 100755
index 0000000..87f0406
--- /dev/null
+++ b/cmake/scripts/generate-swig-interface
@@ -0,0 +1,591 @@
+#!/usr/bin/env python
+#
+# Generate SWIG files for Python interface of DOLFIN
+#
+# Copyright (C) 2012 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-01-17
+# Last changed: 2013-06-23
+
+# System imports
+import os
+import re
+import glob
+import time
+import sys
+
+# Add local site-packages to path,
+# NOTE: We need to prepend it so systemwide installed dolfin is not picked up
+sys.path.insert(0, os.path.abspath("site-packages"))
+
+from dolfin_utils.cppparser import *
+
+# Local imports
+from codesnippets import *
+
+# Create time info for labeling generated code
+_local_time = time.localtime()
+_date_form = dict(year = _local_time.tm_year,
+                  month = _local_time.tm_mon,
+                  day = _local_time.tm_mday)
+
+# Create form for copyright statement to a SWIG interface file
+copyright_form_swig = dict(comment = r"//", holder="Johan Hake")
+
+# reg exp pattern
+_header_pattern = re.compile("#include +<(dolfin/\w+/\w+\.h)>")
+_submodule_pattern = re.compile("#include +<dolfin/(\w+)/\w+\.h>")
+_module_pattern = re.compile("// +SWIG +module +(\w+)")
+
+# Get top DOLFIN directory.
+script_rel_path = os.sep.join(__file__.split(os.sep)[:-1])
+script_rel_path = script_rel_path or "."
+dolfin_dir = os.path.abspath(os.path.join(script_rel_path, os.pardir, os.pardir))
+
+global swig_dir
+swig_dir = os.path.abspath(os.path.join(dolfin_dir, "dolfin", "swig"))
+org_swig_dir = swig_dir
+
+def extract_module_header_files(submodule, excludes):
+    """
+    Extract header files for a submodule
+    """
+
+    # Read dolfin submodule include file
+    code = open(os.path.join(dolfin_dir, "dolfin", submodule, \
+                             "dolfin_%s.h" % submodule)).read()
+
+    # Extract all headers
+    all_headers = re.findall(_header_pattern, code)
+
+    # Filter with excludes
+    return [header for header in all_headers \
+            if header.split("/")[-1] not in excludes]
+
+def generate_submodule_info(excludes):
+    """
+    Check the passed module to submodule mapping and sort it
+    Creates the reverse mapping together with additional info
+    about each submodule
+    """
+
+    # Extract original modules from dolfin.h
+    # NOTE: We need these, in particular the order
+    original_submodules = []
+    module_to_submodules = OrderedDict()
+    f = open(os.path.join(dolfin_dir, "dolfin", "dolfin.h"))
+    present_module = ""
+    for line in f:
+        
+        module_match = re.findall(_module_pattern, line)
+        if module_match:
+            module = module_match[0]
+            module_to_submodules[module] = []
+            present_module = module
+            continue
+        
+        submodule_match = re.findall(_submodule_pattern, line)
+        if submodule_match:
+            submodule = submodule_match[0]
+            original_submodules += [submodule]
+
+            if not present_module:
+                raise RuntimeError("Found a submodule in dolfin.h before a "\
+                                   "SWIG module was declared.")
+            module_to_submodules[present_module].append(submodule)
+
+    f.close()
+
+    # Check that the directory structure of the combined modules
+    # corresponds to the above dict, if not generate them
+    module_dirs = []
+    for module_dir in glob.glob(os.path.join(swig_dir, "modules","*")):
+        module_dirs.append(module_dir.split(os.path.sep)[-1])
+
+    # Some sanity checks
+    for module_dir in module_dirs:
+        if module_dir not in module_to_submodules:
+            raise RuntimeError("Found a subdirectory: '%s' under the 'modules' "\
+                               "directory, which is not listed as a combined "\
+                               "module." % module_dir)
+
+    for combined_module, modules in module_to_submodules.items():
+        if combined_module not in module_dirs:
+            os.makedirs(os.path.join(swig_dir, "modules", combined_module))
+        for module in modules:
+            if module not in original_submodules:
+                raise RuntimeError("Found a module: '%s' listed in the '%s' "\
+                                   "combined module, which is not part of the "\
+                                   "original DOLFIN modules." % \
+                                   (module, combined_module))
+
+    # Create a map from original modules to the combined
+    submodule_info = OrderedDict()
+    not_included = []
+
+    for submodule in original_submodules:
+        for module, submodules in module_to_submodules.items():
+            if submodule in submodules:
+                submodule_info[submodule] = dict(\
+                    module=module,
+                    has_pre=os.path.isfile(\
+                        os.path.join(org_swig_dir, submodule, "pre.i")),
+                    has_post=os.path.isfile(\
+                        os.path.join(org_swig_dir, submodule, "post.i")),
+                    headers=extract_module_header_files(submodule, excludes))
+                break
+        else:
+            not_included.append(submodule)
+
+    # Remove not used submodules
+    for submodule in not_included:
+        original_submodules.remove(submodule)
+
+    # Sort the submodules according to order in original_submodules
+    for module, submodules in module_to_submodules.items():
+        ordered_submodules = []
+        for submodule in original_submodules:
+            if submodule in submodules:
+                ordered_submodules.append(submodule)
+        module_to_submodules[module] = ordered_submodules
+
+    # Return ordered submodule info
+    return module_to_submodules, submodule_info
+
+def extract_swig_modules_dependencies(module_to_submodules, submodule_info):
+    """
+    Extracts the file dependencies of the SWIG modules
+    """
+
+    # OrderedDict of all external dependencies for each SWIG module
+    module_info = OrderedDict((module, dict(submodules=submodules,\
+                                            declared_types=[],\
+                                            used_types=set(),\
+                                            dependencies={}
+                                            ))\
+                for module, submodules in module_to_submodules.items())
+
+    # dict of where each dolfin type is declared and in what module and
+    # submodule it is included in
+    dolfin_type_def = OrderedDict()
+
+    # Add UFC Function
+    # FIXME: ufc inheritance is not used for now. The ufc module information
+    # FIXME: is globally imported in shared_ptr_classes.i
+    dolfin_type_def["ufc::function"] = dict(\
+        module="",
+        submodule="",
+        header="ufc.h",
+        bases=set(), derived=set())
+
+    # dict mapping submodules to included files
+    submodule_files = {}
+
+    # Derived classes (Used if a found base class is not registered
+    # when first collected)
+    derived_classes = {}
+
+    # Iterate over all SWIG modules
+    for module, submodules in module_to_submodules.items():
+
+        #print "Parsing headers for SWIG module:", module
+        # Iterate over all submodules in each SWIG module
+        for submodule in submodules:
+
+            # Iterate over header files and collect info
+            for header_file in submodule_info[submodule]["headers"]:
+
+                # Read code
+                code = open(header_file).read()
+
+                try:
+                    # Extract type info
+                    used_types, declared_types = parse_and_extract_type_info(code)
+                except Exception, e:
+                    print
+                    print "###################"
+                    print "ERROR while parsing:", header_file
+                    print "###################"
+                    print e
+                    print
+                    continue
+
+                # Store type info
+                for dolfin_type, bases in declared_types.items():
+
+                    # Store type information
+                    dolfin_type_def[dolfin_type] = dict(\
+                        module=module,
+                        submodule=submodule,
+                        header=header_file,
+                        bases=bases, derived=set())
+
+                    # Register the class
+                    module_info[module]["declared_types"].append(dolfin_type)
+
+                    # Store derived classes
+                    for base in bases:
+                        # Check if base class has been regisred
+                        # (should be as the types are traversed in order of
+                        #  declaration )
+                        dolfin_type_info = dolfin_type_def.get(base)
+                        if dolfin_type_info is None:
+                            if base not in derived_classes:
+                                derived_classes[base] = set()
+                            derived_classes[base].add(dolfin_type)
+
+                        else:
+                            # Add derived class
+                            dolfin_type_info["derived"].add(dolfin_type)
+
+                # Add collected types to module
+                module_info[module]["used_types"].update(\
+                    used_types)
+
+    # If for one reason or the other a base class was detected which was not
+    # registered we add derived information here
+    for dolfin_type_name, derived in derived_classes.items():
+        dolfin_type = dolfin_type_def.get(dolfin_type_name)
+        if dolfin_type is not None:
+            dolfin_type["derived"].update(derived)
+
+    # Help functions to recursevily add base and derived information to types
+    def add_bases(bases, commulative_bases):
+        for base in bases:
+            # Check if bas is a dolfin type
+            if base in dolfin_type_def:
+                commulative_bases.add(base)
+                add_bases(dolfin_type_def[base]["bases"], commulative_bases)
+
+    def add_derived(derived_set, commulative_derived):
+        for derived in derived_set:
+            # All derived should be a dolfin type...
+            if derived in dolfin_type_def:
+                commulative_derived.add(derived)
+                add_derived(dolfin_type_def[derived]["derived"], commulative_derived)
+
+    # Build class hierarchy (We need to import all base and derived classes)
+    # First extract all bases to a type
+    for dolfin_type in dolfin_type_def:
+
+        # Recursively add base and derived classes
+        if dolfin_type_def[dolfin_type]["bases"]:
+
+            new_bases = set()
+            add_bases(dolfin_type_def[dolfin_type]["bases"], new_bases)
+            dolfin_type_def[dolfin_type]["bases"] = list(new_bases)
+
+        if dolfin_type_def[dolfin_type]["derived"]:
+            new_derived = set()
+            add_derived(dolfin_type_def[dolfin_type]["derived"], new_derived)
+            dolfin_type_def[dolfin_type]["derived"] = list(new_derived)
+
+    # Collect used dolfin types in each module
+    used_dolfin_types = dict((module, set()) for module in module_info)
+
+    # Filter out dolfin types and add derived and bases for each type
+    for dolfin_type in dolfin_type_def:
+
+        # Turn all set data into lists
+        if isinstance(dolfin_type_def[dolfin_type]["bases"], set):
+            dolfin_type_def[dolfin_type]["bases"] = \
+                        list(dolfin_type_def[dolfin_type]["bases"])
+        if isinstance(dolfin_type_def[dolfin_type]["derived"], set):
+            dolfin_type_def[dolfin_type]["derived"] = \
+                        list(dolfin_type_def[dolfin_type]["derived"])
+
+        for module in module_info:
+            for used_type in module_info[module]["used_types"]:
+                if dolfin_type in used_type:
+                    used_dolfin_types[module].add(dolfin_type)
+
+                    # Add bases and derived types
+                    used_dolfin_types[module].update(\
+                        dolfin_type_def[dolfin_type]["bases"])
+
+                    break
+
+    # Over write old used type
+    for module in module_info:
+        # Update dependencies
+        module_info[module]["used_types"] = used_dolfin_types[module]
+
+    # Check external module dependencies
+    for present_module in module_info:
+        for dependent_module in module_info:
+
+            # If same module no external dependencies
+            if present_module == dependent_module:
+                continue
+
+            # Iterate over all dolfin types in dependent modules and check it they
+            # are present in the present module
+            for dolfin_type in module_info[dependent_module]["declared_types"]:
+
+                # Check for dependency
+                if dolfin_type in module_info[present_module]["used_types"]:
+
+                    # Register the dependency
+                    dependencies = module_info[present_module]["dependencies"]
+                    submodule = dolfin_type_def[dolfin_type]["submodule"]
+                    if submodule not in dependencies:
+                        dependencies[submodule] = set()
+                    dependencies[submodule].add(\
+                        dolfin_type_def[dolfin_type]["header"])
+
+        # Need special treatment for template definitions in function/pre.i
+        if "function" in module_info[present_module]["dependencies"]:
+            for dolfin_type in ["FunctionSpace", "Function"]:
+                module_info[present_module]["dependencies"]["function"].add(\
+                    dolfin_type_def[dolfin_type]["header"])
+
+        # Over write old submodules dependencies with sorted version
+        module_info[present_module]["dependencies"] = \
+            sort_submodule_dependencies(\
+            module_info[present_module]["dependencies"], submodule_info)
+
+    # Return data structures
+    return module_info, dolfin_type_def
+
+def write_module_interface_file(module, dependencies, submodule_info):
+    """
+    Write the main interface file for SWIG module
+    """
+
+    # Generate a form for code template
+    module_form = dict(
+        module=module,
+        MODULE=module.upper(),
+        )
+
+    # Create import and include lines for each dependent file
+    import_lines, headers_includes, file_dependencies = \
+                  build_swig_import_info(dependencies, submodule_info)
+
+    # Filter file dependencies
+    file_dependencies = [os.path.abspath(f) \
+                         for f in file_dependencies]
+
+    # Add global SWIG interface files
+    file_dependencies.append(os.path.abspath(os.path.join(\
+        swig_dir, "modules", module, "module.i")))
+    file_dependencies.extend(os.path.abspath(f) \
+                             for f in glob.glob("dolfin/swig/*.i") + \
+                             glob.glob("dolfin/swig/typemaps/*.i"))
+
+    include_lines = []
+    docstring_lines = []
+
+    headers_includes.append("")
+    headers_includes.append("// Include types from present module %s" % module)
+
+    for submodule, submod_info in submodule_info.items():
+
+        if submod_info["module"] != module:
+            continue
+
+        headers_includes.append("")
+        headers_includes.append("// #include types from %s submodule" % submodule)
+
+        include_lines.append("")
+        include_lines.append("// %%include types from submodule %s" % submodule)
+
+        # Add docstrings
+        docstring_lines.append("%%include \"dolfin/swig/%s/docstrings.i\"" % submodule)
+
+        # Check for pre includes
+        if submod_info["has_pre"]:
+            include_lines.append(\
+                "%%include \"dolfin/swig/%s/pre.i\"" % submodule)
+            file_dependencies.append(os.path.abspath(os.path.join(\
+                swig_dir, submodule, "pre.i")))
+
+        # Add headers
+        headers_includes.extend("#include \"%s\"" % header \
+                                for header in submod_info["headers"])
+        include_lines.extend("%%include \"%s\"" % header \
+                             for header in submod_info["headers"])
+        file_dependencies = [os.path.abspath(f) \
+                             for f in file_dependencies]
+
+        #print submod_info["headers"]
+        # Check for post includes
+        if submod_info["has_post"]:
+            include_lines.append(\
+                "%%include \"dolfin/swig/%s/post.i\"" % submodule)
+            file_dependencies.append(os.path.abspath(os.path.join(\
+                swig_dir, submodule, "post.i")))
+
+    # Add imports and includes to form
+    module_form["imports"] =    "\n".join(import_lines)
+    module_form["includes"] =   "\n".join(include_lines)
+    module_form["docstrings"] = "\n".join(docstring_lines)
+    module_form["headers"] =    "\n".join(headers_includes)
+
+    # Open file
+    module_file = open(os.path.join(swig_dir, "modules", module, "module.i"), "w")
+    module_file.write(copyright_statement%(copyright_form_swig))
+
+    # Write the generated code
+    module_file.write(module_template % module_form)
+
+    # Write swig interface file dependencies
+    dependency_file = open(os.path.join(swig_dir, "modules", module,
+                                        "dependencies.txt"), "w")
+    dependency_file.write(";".join(sorted(file_dependencies)))
+
+def write_swig_cmakelist_file(module):
+    """
+    Generate the CMakeList.txt file for each module
+    """
+
+    # Write swig interface file dependencies
+    cmakelist_file = open(os.path.join(swig_dir, "modules", module,
+                                       "CMakeLists.txt"), "w")
+
+    swig_cmakelists = """# This file is automatically generated by running
+#
+#     cmake/scripts/generate-swig-interface
+#
+""" + swig_cmakelists_str
+    cmakelist_file.write(swig_cmakelists)
+
+def generate_runtime_config_file(dolfin_type_def, module_to_submodules,
+                                 submodule_info):
+    # Extract all shared_ptr stored classes and store them in a pyton module
+    # and place that under dolfin.compilemodeuls.sharedptrclasses.py
+    shared_ptr_classes = re.findall("%shared_ptr\(dolfin::(.+)\)", \
+                                    open(os.path.join(org_swig_dir, \
+                                        "shared_ptr_classes.i")).read())
+
+    def repr_ordered_dict(data):
+        """
+        Make a readable repr version of an OrderedDict
+        """
+        return "OrderedDict([\\\n%s])" % "\n".join(\
+            "('%s', %s)," % (key, item) for key, item in data.items())
+
+    #shared_ptr_classes = filter(lambda x: "NAME" not in x, shared_ptr_classes)
+    runtime_file = '''"""
+This module contains compiletime information about the dolfin python
+library, which can be utelized at runtime.
+
+The file is automatically generated by the generateswigcode.py script
+in the dolfin/swig directory."""
+
+try:
+    from collections import OrderedDict
+except ImportError:
+    from dolfin_utils.ordereddict import OrderedDict
+
+# A list of shared_ptr declared classes in dolfin
+shared_ptr_classes = %s
+
+# An OrderedDict of all dolfin declared and its meta info
+dolfin_type_def = %s
+
+# A map between modules and its submodules
+module_to_submodules = %s
+
+# A reverse map between submodules and modules
+submodule_info = %s
+''' % (repr(shared_ptr_classes), repr_ordered_dict(dolfin_type_def),\
+       repr_ordered_dict(module_to_submodules), repr_ordered_dict(submodule_info))
+
+    # FIXME: Create this in build directory
+    open(os.path.join("site-packages", "dolfin", \
+                      "compilemodules", "swigimportinfo.py"), "w").write(\
+        runtime_file)
+
+def regenerate_swig_interface(excludes, top_destdir):
+    """
+    Regenerate the whole swig interface
+    """
+
+    global swig_dir
+
+    top_destdir = top_destdir or dolfin_dir
+    abs_destdir = top_destdir if os.path.isabs(top_destdir) else os.path.join(dolfin_dir, top_destdir)
+
+    # Check what part of path dolfin_dir has in common abs_destdir:
+    dolfin_dirs = dolfin_dir.split(os.sep)
+    abs_destdirs = abs_destdir.split(os.sep)
+    while dolfin_dirs and abs_destdirs:
+
+        # Check if dolfin and abs_dest dir has the same top directory
+        if dolfin_dirs[0] == abs_destdirs[0]:
+            dolfin_dirs.pop(0)
+            abs_destdirs.pop(0)
+        else:
+            break
+
+    if not os.path.isdir(abs_destdir):
+        raise RuntimeError("%s is not a directory." % abs_destdir)
+
+    # Change swig_dir for generated files
+    if top_destdir != dolfin_dir:
+        swig_dir = swig_dir.replace(dolfin_dir, top_destdir)
+
+    # Check the submodule order and create a submodule to module mapping
+    module_to_submodules, submodule_info = generate_submodule_info(excludes)
+
+    # Create dolfin type info and depdency structures to be used when
+    # generating swig interface files
+    module_info, dolfin_type_def = extract_swig_modules_dependencies(\
+        module_to_submodules, submodule_info)
+
+    # Iterate over the modules and create a swig interface file
+    submodule_ordered = [submodule for submodules in module_to_submodules.values() \
+                         for submodule in submodules]
+    for module in module_to_submodules:
+        # Sort submodules
+        dependencies = sorted(module_info[module]["dependencies"].keys(), \
+                              cmp=lambda a, b : cmp(\
+            submodule_ordered.index(a), submodule_ordered.index(b)))
+        write_module_interface_file(module, module_info[module]["dependencies"], \
+                                    submodule_info)
+        write_swig_cmakelist_file(module)
+
+    # Create a python module with generated type info to be used runtime
+    generate_runtime_config_file(dolfin_type_def, module_to_submodules,
+                                 submodule_info)
+
+
+if __name__ == "__main__":
+
+    if len(sys.argv) not in [1,2]:
+        raise RuntimeError("expected 0 or 1 argument")
+
+    dest_dir = sys.argv[-1] if len(sys.argv) == 2 else ""
+
+    # User defined definition of SWIG modules.
+    # NOTE: Order of modules are important, but not order of submodules
+    module_to_submodules = OrderedDict([\
+        ("common", ["common", "parameter", "log"]),
+        ("la", ["la", "nls"]),
+        ("mesh", ["mesh", "refinement", \
+                  "ale", "graph", "geometry", "generation"]),
+        ("function", ["function", "math"]),
+        ("fem", ["fem", "adaptivity", "multistage"]),
+        ("io", ["io", "plot"])])
+
+    # User defined list of headers to exclude (add more here)
+    excludes = ["LogStream.h"]
+
+    # Regnerate SWIG interface
+    regenerate_swig_interface(excludes, dest_dir)
diff --git a/cmake/templates/DOLFINConfig.cmake.in b/cmake/templates/DOLFINConfig.cmake.in
new file mode 100644
index 0000000..7dd5f5f
--- /dev/null
+++ b/cmake/templates/DOLFINConfig.cmake.in
@@ -0,0 +1,53 @@
+# - Build details for DOLFIN:  Dynamic Object-oriented Library for FINite element computation
+#
+# This file has been automatically generated.
+
+# FIXME: Check that naming conforms to CMake standards
+
+# Compilers
+set(DOLFIN_CXX_COMPILER "@CMAKE_CXX_COMPILER@")
+
+# Compiler defintions
+set(DOLFIN_CXX_DEFINITIONS "-DDOLFIN_VERSION=\"@DOLFIN_VERSION@\";@DOLFIN_CXX_DEFINITIONS@")
+
+# Compiler flags
+set(DOLFIN_CXX_FLAGS "@CMAKE_CXX_FLAGS@")
+
+# Linker flags
+set(DOLFIN_LINK_FLAGS "@CMAKE_EXE_LINKER_FLAGS@")
+
+# Include directories
+set(DOLFIN_INCLUDE_DIRS "@CMAKE_INSTALL_PREFIX@/@DOLFIN_INCLUDE_DIR@")
+
+# Third party include directories
+set(DOLFIN_3RD_PARTY_INCLUDE_DIRS "@DOLFIN_DEP_INCLUDE_DIRECTORIES@;@DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES@")
+
+# Python include directories
+set(DOLFIN_PYTHON_INCLUDE_DIRS "@NUMPY_INCLUDE_DIR@;@PYTHON_INCLUDE_DIRS@")
+
+# Python definitions
+set(DOLFIN_PYTHON_DEFINITIONS "-DNUMPY_VERSION_MAJOR=@NUMPY_VERSION_MAJOR@;-DNUMPY_VERSION_MINOR=@NUMPY_VERSION_MINOR@;-DNUMPY_VERSION_MICRO=@NUMPY_VERSION_MICRO@;-DNPY_NO_DEPRECATED_API=NPY_1_7_API_VERSION")
+
+# DOLFIN library
+set(DOLFIN_LIBRARIES "@DOLFIN_LIBRARY@")
+
+# Third-party library directories
+set(DOLFIN_3RD_PARTY_LIBRARY_DIRS "@DOLFIN_TARGET_LINK_LIBRARIES_DIRS@")
+
+# Third-party libraries
+set(DOLFIN_3RD_PARTY_LIBRARIES "@DOLFIN_TARGET_LINK_LIBRARIES@")
+
+# Third-party libraries that are not required when linking with DOLFIN
+set(DOLFIN_EXTRA_3RD_PARTY_LIBRARIES "@DOLFIN_EXTRA_TARGET_LINK_LIBRARIES@")
+
+# Python libraries
+set(DOLFIN_PYTHON_LIBRARIES "@PYTHON_LIBRARIES@")
+
+# Version
+set(DOLFIN_VERSION_MAJOR "@DOLFIN_VERSION_MAJOR@")
+set(DOLFIN_VERSION_MINOR "@DOLFIN_VERSION_MINOR@")
+set(DOLFIN_VERSION_MICRO "@DOLFIN_VERSION_MICRO@")
+set(DOLFIN_VERSION_STR   "@DOLFIN_VERSION@")
+
+# The location of the UseDOLFIN.cmake file
+set(DOLFIN_USE_FILE "@CMAKE_INSTALL_PREFIX@/@DOLFIN_SHARE_DIR@/cmake/UseDOLFIN.cmake")
diff --git a/cmake/templates/DOLFINConfigVersion.cmake.in b/cmake/templates/DOLFINConfigVersion.cmake.in
new file mode 100644
index 0000000..1d3a16c
--- /dev/null
+++ b/cmake/templates/DOLFINConfigVersion.cmake.in
@@ -0,0 +1,16 @@
+set(PACKAGE_VERSION "@DOLFIN_VERSION@")
+set(PACKAGE_VERSION_MAJOR "@DOLFIN_VERSION_MAJOR@")
+set(PACKAGE_VERSION_MINOR "@DOLFIN_VERSION_MINOR@")
+set(PACKAGE_VERSION_PATCH "@DOLFIN_VERSION_MICRO@")
+
+# FIXME: When should versions be defined as compatible?
+# This version is compatible only with matching major.minor versions.
+if ("${PACKAGE_VERSION_MAJOR}.${PACKAGE_VERSION_MINOR}" VERSION_EQUAL "${PACKAGE_FIND_VERSION_MAJOR}.${PACKAGE_FIND_VERSION_MINOR}")
+  # This version is compatible with equal or lesser patch versions.
+  if (NOT "${PACKAGE_VERSION_PATCH}" VERSION_LESS "${PACKAGE_FIND_VERSION_PATCH}")
+    set(PACKAGE_VERSION_COMPATIBLE 1)
+    if ("${PACKAGE_VERSION_PATCH}" VERSION_EQUAL "${PACKAGE_FIND_VERSION_PATCH}")
+      set(PACKAGE_VERSION_EXACT 1)
+    endif()
+  endif()
+endif()
diff --git a/cmake/templates/UseDOLFIN.cmake.in b/cmake/templates/UseDOLFIN.cmake.in
new file mode 100644
index 0000000..fa8d68c
--- /dev/null
+++ b/cmake/templates/UseDOLFIN.cmake.in
@@ -0,0 +1,26 @@
+#
+# This file sets up include directories, link directories, and
+# compiler settings for a project to use DOLFIN. It should not be
+# included directly, but rather through the DOLFIN_USE_FILE setting
+# obtained from DOLFINConfig.cmake.
+#
+
+if (NOT DOLFIN_USE_FILE_INCLUDED)
+  set(DOLFIN_USE_FILE_INCLUDED 1)
+
+  # Add compiler definitions needed to use DOLFIN
+  add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+  # Add compiler flags needed to use DOLFIN
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${DOLFIN_CXX_FLAGS}")
+  set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} ${DOLFIN_LINK_FLAGS}")
+  set(CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} ${DOLFIN_LINK_FLAGS}")
+  set(CMAKE_MODULE_LINKER_FLAGS "${CMAKE_MODULE_LINKER_FLAGS} ${DOLFIN_LINK_FLAGS}")
+
+  # Add include directories needed to use DOLFIN
+  include_directories(${DOLFIN_INCLUDE_DIRS})
+  include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+  # Add link directories needed to use DOLFIN
+  link_directories(${DOLFIN_3RD_PARTY_LIBRARY_DIRS})
+endif()
diff --git a/cmake/templates/cmake_uninstall.cmake.in b/cmake/templates/cmake_uninstall.cmake.in
new file mode 100644
index 0000000..1c6a9e1
--- /dev/null
+++ b/cmake/templates/cmake_uninstall.cmake.in
@@ -0,0 +1,21 @@
+if (NOT EXISTS "@CMAKE_CURRENT_BINARY_DIR@/install_manifest.txt")
+  message(FATAL_ERROR "Cannot find install manifest: \"@CMAKE_CURRENT_BINARY_DIR@/install_manifest.txt\"")
+endif()
+
+file(READ "@CMAKE_CURRENT_BINARY_DIR@/install_manifest.txt" files)
+string(REGEX REPLACE "\n" ";" files "${files}")
+foreach (file ${files})
+  message(STATUS "Uninstalling \"$ENV{DESTDIR}${file}\"")
+  if (EXISTS "$ENV{DESTDIR}${file}")
+    exec_program(
+      "@CMAKE_COMMAND@" ARGS "-E remove \"$ENV{DESTDIR}${file}\""
+      OUTPUT_VARIABLE rm_out
+      RETURN_VALUE rm_retval
+      )
+    if (NOT "${rm_retval}" STREQUAL 0)
+      message(FATAL_ERROR "Problem when removing \"$ENV{DESTDIR}${file}\"")
+    endif()
+  else()
+    message(STATUS "File \"$ENV{DESTDIR}${file}\" does not exist.")
+  endif()
+endforeach()
diff --git a/cmake/templates/dolfin-config-version.cmake.in b/cmake/templates/dolfin-config-version.cmake.in
new file mode 100644
index 0000000..1d3a16c
--- /dev/null
+++ b/cmake/templates/dolfin-config-version.cmake.in
@@ -0,0 +1,16 @@
+set(PACKAGE_VERSION "@DOLFIN_VERSION@")
+set(PACKAGE_VERSION_MAJOR "@DOLFIN_VERSION_MAJOR@")
+set(PACKAGE_VERSION_MINOR "@DOLFIN_VERSION_MINOR@")
+set(PACKAGE_VERSION_PATCH "@DOLFIN_VERSION_MICRO@")
+
+# FIXME: When should versions be defined as compatible?
+# This version is compatible only with matching major.minor versions.
+if ("${PACKAGE_VERSION_MAJOR}.${PACKAGE_VERSION_MINOR}" VERSION_EQUAL "${PACKAGE_FIND_VERSION_MAJOR}.${PACKAGE_FIND_VERSION_MINOR}")
+  # This version is compatible with equal or lesser patch versions.
+  if (NOT "${PACKAGE_VERSION_PATCH}" VERSION_LESS "${PACKAGE_FIND_VERSION_PATCH}")
+    set(PACKAGE_VERSION_COMPATIBLE 1)
+    if ("${PACKAGE_VERSION_PATCH}" VERSION_EQUAL "${PACKAGE_FIND_VERSION_PATCH}")
+      set(PACKAGE_VERSION_EXACT 1)
+    endif()
+  endif()
+endif()
diff --git a/cmake/templates/dolfin-config.cmake.in b/cmake/templates/dolfin-config.cmake.in
new file mode 100644
index 0000000..28b01d2
--- /dev/null
+++ b/cmake/templates/dolfin-config.cmake.in
@@ -0,0 +1,56 @@
+# - Build details for DOLFIN:  Dynamic Object-oriented Library for FINite element computation
+#
+# This file has been automatically generated.
+
+# FIXME: Check that naming conforms to CMake standards
+
+# This file is deprecated
+message(WARNING "find_package(dolfin) is deprecated - use find_package(DOLFIN) instead.")
+
+# Package found
+set(DOLFIN_FOUND TRUE)
+
+# Compilers
+set(DOLFIN_CXX_COMPILER "@CMAKE_CXX_COMPILER@")
+
+# Compiler defintions
+set(DOLFIN_CXX_DEFINITIONS "-DDOLFIN_VERSION=\"@DOLFIN_VERSION@\";@DOLFIN_CXX_DEFINITIONS@")
+
+# Compiler flags
+set(DOLFIN_CXX_FLAGS "@CMAKE_CXX_FLAGS@")
+
+# Linker flags
+set(DOLFIN_LINK_FLAGS "@CMAKE_EXE_LINKER_FLAGS@")
+
+# Include directories
+set(DOLFIN_INCLUDE_DIRS "@CMAKE_INSTALL_PREFIX@/@DOLFIN_INCLUDE_DIR@")
+
+# Third party include directories
+set(DOLFIN_3RD_PARTY_INCLUDE_DIRS "@DOLFIN_DEP_INCLUDE_DIRECTORIES@;@DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES@")
+
+# Python include directories
+set(DOLFIN_PYTHON_INCLUDE_DIRS "@NUMPY_INCLUDE_DIR@;@PYTHON_INCLUDE_DIRS@")
+
+# Python definitions
+set(DOLFIN_PYTHON_DEFINITIONS "-DNUMPY_VERSION_MAJOR=@NUMPY_VERSION_MAJOR@;-DNUMPY_VERSION_MINOR=@NUMPY_VERSION_MINOR@;-DNUMPY_VERSION_MICRO=@NUMPY_VERSION_MICRO@;-DNPY_NO_DEPRECATED_API=NPY_1_7_API_VERSION")
+
+# DOLFIN library
+set(DOLFIN_LIBRARIES "@DOLFIN_LIBRARY@")
+
+# Third-party library directories
+set(DOLFIN_3RD_PARTY_LIBRARY_DIRS "@DOLFIN_TARGET_LINK_LIBRARIES_DIRS@")
+
+# Third-party libraries
+set(DOLFIN_3RD_PARTY_LIBRARIES "@DOLFIN_TARGET_LINK_LIBRARIES@")
+
+# Python libraries
+set(DOLFIN_PYTHON_LIBRARIES "@PYTHON_LIBRARIES@")
+
+# Version
+set(DOLFIN_VERSION_MAJOR "@DOLFIN_VERSION_MAJOR@")
+set(DOLFIN_VERSION_MINOR "@DOLFIN_VERSION_MINOR@")
+set(DOLFIN_VERSION_MICRO "@DOLFIN_VERSION_MICRO@")
+set(DOLFIN_VERSION_STR   "@DOLFIN_VERSION@")
+
+# The location of the UseDOLFIN.cmake file
+set(DOLFIN_USE_FILE "@CMAKE_INSTALL_PREFIX@/@DOLFIN_SHARE_DIR@/cmake/UseDOLFIN.cmake")
diff --git a/cmake/templates/dolfin-get-demos.in b/cmake/templates/dolfin-get-demos.in
new file mode 100644
index 0000000..a3cbe10
--- /dev/null
+++ b/cmake/templates/dolfin-get-demos.in
@@ -0,0 +1,34 @@
+#!/bin/bash
+#
+# Utility script for installing demos in user's home directory
+
+DEMO_DIR=@CMAKE_INSTALL_PREFIX@/@DOLFIN_SHARE_DIR@/demo
+INSTALL_DIR=$HOME/dolfin-demos
+URL="http://fenicsproject.org/documentation/doc_"`echo @DOLFIN_VERSION@ | cut -d'+' -f1`".html"
+
+echo "This script will install the DOLFIN demos in your home directory:"
+echo
+echo "  $INSTALL_DIR"
+echo
+echo -n "Do you want to install the DOLFIN demos in your home directory? [y] "
+read answer
+
+if [[ $answer == "y" || $answer == "" ]]; then
+    echo "Installing demos..."
+    cp -r $DEMO_DIR $INSTALL_DIR
+    echo
+    echo "The demos have now been installed in $INSTALL_DIR."
+    echo
+    echo "-------------------------------------------------------------------------------"
+    echo "To get started, enter the following command:"
+    echo
+    echo "  cd $INSTALL_DIR/pde"
+    echo
+    echo "The documentation can be found at the following address:"
+    echo
+    echo "  $URL"
+    echo "-------------------------------------------------------------------------------"
+    echo
+else
+    echo "ok, demos not installed"
+fi
diff --git a/cmake/templates/dolfin-version.in b/cmake/templates/dolfin-version.in
new file mode 100644
index 0000000..eba5777
--- /dev/null
+++ b/cmake/templates/dolfin-version.in
@@ -0,0 +1,4 @@
+#!/bin/bash
+
+# Helper file to print the version of DOLFIN
+echo @DOLFIN_VERSION@
diff --git a/cmake/templates/dolfin.conf.in b/cmake/templates/dolfin.conf.in
new file mode 100644
index 0000000..f08a0ca
--- /dev/null
+++ b/cmake/templates/dolfin.conf.in
@@ -0,0 +1,12 @@
+# Helper file for setting non-default DOLFIN environment variables
+
+# Common Unix variables
+export @OS_LIBRARY_PATH_NAME@=@CMAKE_INSTALL_PREFIX@/@DOLFIN_LIB_DIR@:$@OS_LIBRARY_PATH_NAME@
+export PATH=@CMAKE_INSTALL_PREFIX@/@DOLFIN_BIN_DIR@:$PATH
+export PKG_CONFIG_PATH=@CMAKE_INSTALL_PREFIX@/@DOLFIN_PKGCONFIG_DIR@:$PKG_CONFIG_PATH
+export PYTHONPATH=@DOLFIN_INSTALL_PYTHON_MODULE_DIR@:@DOLFIN_INSTALL_PYTHON_PURE_MODULE_DIR@:$PYTHONPATH
+export MANPATH=@CMAKE_INSTALL_PREFIX@/@DOLFIN_MAN_DIR@:$MANPATH
+
+# Special Mac variables
+export DYLD_FRAMEWORK_PATH=/opt/local/Library/Frameworks:$DYLD_FRAMEWORK_PATH
+
diff --git a/cmake/templates/dolfin.pc.in b/cmake/templates/dolfin.pc.in
new file mode 100644
index 0000000..bd26886
--- /dev/null
+++ b/cmake/templates/dolfin.pc.in
@@ -0,0 +1,17 @@
+# pkg-config configuration for DOLFIN
+prefix=@CMAKE_INSTALL_PREFIX@
+exec_prefix=@CMAKE_INSTALL_PREFIX@
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+compiler=@CMAKE_CXX_COMPILER@
+definitions=@PKG_DEFINITIONS@
+swigcflags=@PYTHON_CPPFLAGS@
+extlibs=@DOLFIN_EXT_LIBS@
+
+Name: DOLFIN
+Description: Dynamic Object-oriented Library for FINite element computation
+Version: @DOLFIN_VERSION@
+Requires: @PKG_REQUIRES@
+Conflicts:
+Libs: @PKG_LINKFLAGS@ -L${libdir} -ldolfin
+Cflags: @PKG_CXXFLAGS@ -DDOLFIN_VERSION=\"@DOLFIN_VERSION@\" @PKG_DEFINITIONS@ -I${includedir} @PKG_INCLUDES@
diff --git a/data/README b/data/README
new file mode 100644
index 0000000..dcec783
--- /dev/null
+++ b/data/README
@@ -0,0 +1,6 @@
+The data in this directory, including example meshes, have been moved
+to the FEniCS web server to decrease the size of this repository. For
+a selection of meshes, please visit
+
+  http://fenicsproject.org/download/data.html
+  http://fenicsproject.org/pub/data/meshes/
diff --git a/demo/CMakeLists.txt b/demo/CMakeLists.txt
new file mode 100644
index 0000000..3d96c86
--- /dev/null
+++ b/demo/CMakeLists.txt
@@ -0,0 +1,32 @@
+project(dolfin-demos)
+
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+# FIXME: Temporary fix for whitespace error
+cmake_policy(SET CMP0004 OLD)
+
+# Find DOLFIN config file (not used here, but check that the demo will be able
+# to find it
+find_package(DOLFIN PATHS ${CMAKE_BINARY_DIR} REQUIRED)
+
+# If config file is found, add all demo sub-directories, else print helper
+# message
+if (DOLFIN_FOUND)
+
+  # Build list of all cpp demo directories
+  file(GLOB_RECURSE list "main.cpp")
+  list(SORT list)
+  string(REGEX REPLACE "/main.cpp" "" list "${list}")
+
+  # Add each C++ demo directory
+  foreach (demo_dir ${list})
+    #message(STATUS "Adding C++ demo: ${demo_dir}")
+    add_subdirectory(${demo_dir})
+  endforeach()
+
+else()
+
+  message("Could not locate DOLFINConfig.cmake file. Did you do 'make install' for the DOLFIN library and set the appropriate paths (source <build_dir>/dolfin.conf)?")
+
+endif()
diff --git a/demo/cmake.local b/demo/cmake.local
new file mode 100755
index 0000000..c7516dd
--- /dev/null
+++ b/demo/cmake.local
@@ -0,0 +1,19 @@
+#!/bin/sh
+
+# Configure for a local install. Build files will be generated in the
+# directory $toplevel/local and installation will go in the directory
+# $toplevel/build.
+#
+# This is useful to be able to run demos from within the source tree
+# without needing to specify an installation directory.
+
+# TODO: Add -DCMAKE_BUILD_TYPE=xxxx flag
+
+INSTALLDIR=`pwd`"/local"
+
+mkdir -p ../build_demo
+cd ../build_demo
+
+cmake ../demo -DCMAKE_INSTALL_PREFIX=$INSTALLDIR
+make
+
diff --git a/demo/documented/auto-adaptive-poisson/common.txt b/demo/documented/auto-adaptive-poisson/common.txt
new file mode 100644
index 0000000..4b7b2b2
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/common.txt
@@ -0,0 +1,138 @@
+In this demo we will use goal oriented adaptivity and error control
+which applies a duality technique to derive error estimates taken
+directly from the computed solution which then are used to weight
+local residuals. To this end, we derive an :math:`\textit{a
+posteriori}` error estimate and error indicators. We define a goal
+functional :math:`\mathcal{M} : V \rightarrow \mathbb{R}`, which
+expresses the localized physical properties of the solution of a
+simulation. The objective of goal oriented adaptive error control is
+to minimize computational work to obtain a given level of accuracy in
+:math:`\mathcal{M}`.
+
+We will thus illustrate how to:
+
+* Solve a linear partial differential equation with automatic adaptive mesh refinement
+* Define a goal functional
+* Use :py:class:`AdaptiveLinearVariationalSolver <dolfin.cpp.fem.AdaptiveLinearVariationalSolver>`
+
+The two solutions for u in this demo will look as follows, where the
+first is the unrefined while the second is the refined solution:
+
+.. image:: ../u_unrefined.png
+    :scale: 75 %
+
+.. image:: ../u_refined.png
+    :scale: 75 %
+
+
+Equation and problem definition
+-------------------------------
+
+The Poisson equation is the canonical elliptic partial differential
+equation. For a domain :math:`\Omega \subset \mathbb{R}^n` with
+boundary :math:`\partial \Omega = \Gamma_{D} \cup \Gamma_{N}`, the
+Poisson equation with particular boundary conditions reads:
+
+
+.. math::
+
+    - \nabla^{2} u &= f \quad {\rm in} \ \Omega, \\
+    u &= 0 \quad {\rm on} \ \Gamma_{D}, \\
+    \nabla u \cdot n &= g \quad {\rm on} \ \Gamma_{N}. \\
+
+Here, :math:`f` and :math:`g` are input data and n denotes the outward
+directed boundary normal. The variational form of Poisson equation
+reads: find :math:`u \in V` such that
+
+.. math::
+
+	a(u, v) = L(v) \quad \forall \ v \in \hat{V},
+
+which we will call the continous primal problem, where :math:`V`,
+:math:`\hat{V}` are the trial- and test spaces and
+
+
+.. math::
+
+    a(u, v) &= \int_{\Omega} \nabla u \cdot \nabla v \, {\rm d} x, \\
+    L(v)    &= \int_{\Omega} f v \, {\rm d} x + \int_{\Gamma_{N}} g v \, {\rm d} s.
+
+The expression :math:`a(u, v)` is the bilinear form and :math:`L(v)`
+is the linear form. It is assumed that all functions in :math:`V`
+satisfy the Dirichlet boundary conditions (:math:`u = 0 \ {\rm on} \
+\Gamma_{D}`).
+
+The above definitions is that of the continuous problem. In the actual
+computer implementation we use a descrete formulation which reads:
+find :math:`u \in V_h` such that
+
+
+.. math::
+
+    a(u_h, v) = L(v) \quad \forall \ v \in \hat{V}_h.
+
+We will refer to the above equation as the discrete primal
+problem. Here, :math:`V_h` and :math:`\hat{V_h}` are finite
+dimensional subspaces.
+
+The weak residual is defined as
+
+.. math::
+
+    r(v) = L(v) - a(u_h, v).
+
+By the Galerkin orthogonality, we have
+
+
+.. math::
+
+    r(v) = L(v) - a(u_h, v) = a(u_h, v) -  a(u_h, v) = 0\,\, \forall v \in \hat{V}_{h},
+
+which means that the residual vanishes for all functions in
+:math:`\hat{V}_{h}`. This property is used further in the derivation
+of the error estimates. wish to compute a solution :math:`u_h` to the
+discrete primal problem defined above such that for a given tolerance
+:math:`\mathrm{TOL}` we have
+
+.. math::
+
+    \eta = \left| \mathcal{M}(u_h) - \mathcal{u_h} \right| \leq \mathrm{TOL}.
+
+Next we derive an :math:`\textit{a posteriori}` error estimate by
+defining the discrete dual variational problem: find :math:`z_h \in
+V_h^*` such that
+
+.. :math::
+
+    a^*(z_h,v) = \mathcal{v}, \quad \forall v \in \hat{V}_h^*.
+
+Here :math:`V^*, \hat{V}_h^*` are the dual trial- and test spaces and
+:math:`a^* : V^* \times \hat{V}^* \rightarrow \mathbb{R}` is the
+adjoint of :math:`a` such that :math:`a^*(v,w) = a(w,v)`. We find that
+
+.. math::
+
+    \mathcal{M}(u - \mathcal{u_h}) = a^*(z, u - u_h) = a(u - u_h, z) = a(u,z) - a(u_h,z) = L(z) - a(u_h,z) = r(z)
+
+and by Galerkin orthogonality we have :math:`r(z) = r(z - v_h)\,\,
+\forall v_h \in \hat{V}_h`. Note that the residual vanishes if
+:math:`z \in \hat{V}_h^*` and has to either be approximated in a
+higher order element space or one may use an extrapolation. The choice
+of goal functional depends on what quantity you are interested in.
+Here, we take the goal functional to be defined as
+
+.. math::
+
+    \mathcal{M}(u) = \int_{\Omega}  u dx.
+
+
+We use :math:`D\ddot{o}rfler` marking as the mesh marking procedure.
+
+In this demo, we shall consider the following definitions of the input functions, the domain, and the boundaries:
+
+* :math:`\Omega = [0,1] \times [0,1]\,` (a unit square)
+* :math:`\Gamma_{D} = \{(0, y) \cup (1, y) \subset \partial \Omega\}\,` (Dirichlet boundary)
+* :math:`\Gamma_{N} = \{(x, 0) \cup (x, 1) \subset \partial \Omega\}\,` (Neumann boundary)
+* :math:`g = \sin(5x)\,` (normal derivative)
+* :math:`f = 10\exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)\,` (source term)
+
diff --git a/demo/documented/auto-adaptive-poisson/cpp/AdaptivePoisson.h b/demo/documented/auto-adaptive-poisson/cpp/AdaptivePoisson.h
new file mode 100644
index 0000000..a0e9e76
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/cpp/AdaptivePoisson.h
@@ -0,0 +1,15101 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  True
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ADAPTIVEPOISSON_H
+#define __ADAPTIVEPOISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class adaptivepoisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivepoisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivepoisson_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivepoisson_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivepoisson_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Bubble', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+    
+    // Declare helper variables
+    double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+    double tmp1 = (1.0 - Y)/2.0;
+    double tmp2 = tmp1*tmp1;
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    basisvalues[1] = tmp0;
+    basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+    basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+    basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+    basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+    basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+    basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+    basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+    basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+    basisvalues[0] *= std::sqrt(0.5);
+    basisvalues[2] *= std::sqrt(1.0);
+    basisvalues[5] *= std::sqrt(1.5);
+    basisvalues[9] *= std::sqrt(2.0);
+    basisvalues[1] *= std::sqrt(3.0);
+    basisvalues[4] *= std::sqrt(4.5);
+    basisvalues[8] *= std::sqrt(6.0);
+    basisvalues[3] *= std::sqrt(7.5);
+    basisvalues[7] *= std::sqrt(10.0);
+    basisvalues[6] *= std::sqrt(14.0);
+    
+    // Table(s) of coefficients
+    static const double coefficients0[10] = \
+    {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    
+    // Array of basisvalues
+    double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+    
+    // Declare helper variables
+    double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+    double tmp1 = (1.0 - Y)/2.0;
+    double tmp2 = tmp1*tmp1;
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    basisvalues[1] = tmp0;
+    basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+    basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+    basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+    basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+    basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+    basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+    basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+    basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+    basisvalues[0] *= std::sqrt(0.5);
+    basisvalues[2] *= std::sqrt(1.0);
+    basisvalues[5] *= std::sqrt(1.5);
+    basisvalues[9] *= std::sqrt(2.0);
+    basisvalues[1] *= std::sqrt(3.0);
+    basisvalues[4] *= std::sqrt(4.5);
+    basisvalues[8] *= std::sqrt(6.0);
+    basisvalues[3] *= std::sqrt(7.5);
+    basisvalues[7] *= std::sqrt(10.0);
+    basisvalues[6] *= std::sqrt(14.0);
+    
+    // Table(s) of coefficients
+    static const double coefficients0[10] = \
+    {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+    
+    // Tables of derivatives of the polynomial base (transpose).
+    static const double dmats0[10][10] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double dmats1[10][10] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+    {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+    {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+    {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+    
+    // Compute reference derivatives.
+    // Declare array of derivatives on FIAT element.
+    double derivatives[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      derivatives[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Declare derivative matrix (of polynomial basis).
+    double dmats[10][10] = \
+    {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+    
+    // Declare (auxiliary) derivative matrix (of polynomial basis).
+    double dmats_old[10][10] = \
+    {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+    
+    // Loop possible derivatives.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      // Resetting dmats values to compute next derivative.
+      for (unsigned int t = 0; t < 10; t++)
+      {
+        for (unsigned int u = 0; u < 10; u++)
+        {
+          dmats[t][u] = 0.0;
+          if (t == u)
+          {
+          dmats[t][u] = 1.0;
+          }
+          
+        } // end loop over 'u'
+      } // end loop over 't'
+      
+      // Looping derivative order to generate dmats.
+      for (unsigned int s = 0; s < n; s++)
+      {
+        // Updating dmats_old with new values and resetting dmats.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats_old[t][u] = dmats[t][u];
+            dmats[t][u] = 0.0;
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Update dmats using an inner product.
+        if (combinations[r][s] == 0)
+        {
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            for (unsigned int tu = 0; tu < 10; tu++)
+            {
+              dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+            } // end loop over 'tu'
+          } // end loop over 'u'
+        } // end loop over 't'
+        }
+        
+        if (combinations[r][s] == 1)
+        {
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            for (unsigned int tu = 0; tu < 10; tu++)
+            {
+              dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+            } // end loop over 'tu'
+          } // end loop over 'u'
+        } // end loop over 't'
+        }
+        
+      } // end loop over 's'
+      for (unsigned int s = 0; s < 10; s++)
+      {
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+        } // end loop over 't'
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // Transform derivatives back to physical element
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r] += transform[r][s]*derivatives[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = 0;
+    vertex_values[1] = 0;
+    vertex_values[2] = 0;
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivepoisson_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivepoisson_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivepoisson_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivepoisson_finite_element_4: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_finite_element_4() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_finite_element_4()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivepoisson_finite_element_4();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivepoisson_finite_element_5: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_finite_element_5() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_finite_element_5()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivepoisson_finite_element_5();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivepoisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[2][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivepoisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivepoisson_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 6*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 6;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 6*c.entity_indices[2][0];
+    dofs[1] = 6*c.entity_indices[2][0] + 1;
+    dofs[2] = 6*c.entity_indices[2][0] + 2;
+    dofs[3] = 6*c.entity_indices[2][0] + 3;
+    dofs[4] = 6*c.entity_indices[2][0] + 4;
+    dofs[5] = 6*c.entity_indices[2][0] + 5;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 3;
+      dofs[4] = 4;
+      dofs[5] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivepoisson_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivepoisson_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Bubble', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[2][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivepoisson_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivepoisson_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 3*c.entity_indices[2][0];
+    dofs[1] = 3*c.entity_indices[2][0] + 1;
+    dofs[2] = 3*c.entity_indices[2][0] + 2;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivepoisson_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivepoisson_dofmap_4: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_dofmap_4() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_dofmap_4()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivepoisson_dofmap_4();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivepoisson_dofmap_5: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_dofmap_5() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_dofmap_5()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivepoisson_dofmap_5();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 1
+    // Total number of operations (multiply-add pairs):                  4
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.166666666666667*G0_;
+    A[1] = 0.166666666666667*G0_;
+    A[2] = 0.166666666666667*G0_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_2_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_2_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_2_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W6[6] = {0.0833333333333333, 0.0833333333333333, 0.0833333333333333, 0.0833333333333333, 0.0833333333333333, 0.0833333333333333};
+    // Quadrature points on the UFC reference element: (0.659027622374092, 0.231933368553031), (0.659027622374092, 0.109039009072877), (0.231933368553031, 0.659027622374092), (0.231933368553031, 0.109039009072877), (0.109039009072877, 0.659027622374092), (0.109039009072877, 0.231933368553031)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[6][3] = \
+    {{0.109039009072877, 0.659027622374092, 0.231933368553031},
+    {0.231933368553031, 0.659027622374092, 0.109039009072877},
+    {0.109039009072877, 0.231933368553031, 0.659027622374092},
+    {0.659027622374092, 0.231933368553031, 0.109039009072877},
+    {0.231933368553031, 0.109039009072877, 0.659027622374092},
+    {0.659027622374092, 0.109039009072877, 0.231933368553031}};
+    
+    static const double FE0_D01[6][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {0, 2};
+    
+    static const double FE1[6][6] = \
+    {{-0.0852599980736871, 0.209607191730006, -0.124347193656319, 0.611401985706872, 0.101159138711827, 0.287438875581301},
+    {-0.124347193656319, 0.209607191730006, -0.0852599980736871, 0.287438875581301, 0.101159138711827, 0.611401985706872},
+    {-0.085259998073687, -0.124347193656319, 0.209607191730006, 0.611401985706872, 0.287438875581301, 0.101159138711827},
+    {0.209607191730006, -0.124347193656319, -0.0852599980736871, 0.101159138711827, 0.287438875581301, 0.611401985706872},
+    {-0.124347193656319, -0.0852599980736871, 0.209607191730006, 0.287438875581301, 0.611401985706872, 0.101159138711827},
+    {0.209607191730006, -0.0852599980736871, -0.124347193656319, 0.101159138711827, 0.611401985706872, 0.287438875581301}};
+    
+    static const double FE1_D01[6][5] = \
+    {{0.563843963708493, -0.0722665257878755, 2.63611048949637, -0.491577437920616, -2.63611048949637},
+    {0.0722665257878767, -0.563843963708491, 2.63611048949637, 0.491577437920616, -2.63611048949637},
+    {0.563843963708492, 1.63611048949637, 0.927733474212123, -2.19995445320486, -0.927733474212123},
+    {-1.63611048949637, -0.563843963708491, 0.927733474212123, 2.19995445320486, -0.927733474212124},
+    {0.0722665257878761, 1.63611048949637, 0.436156036291507, -1.70837701528424, -0.436156036291507},
+    {-1.63611048949637, -0.0722665257878757, 0.436156036291507, 1.70837701528424, -0.436156036291507}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE1_D10[6][5] = \
+    {{0.563843963708493, 1.63611048949637, 0.927733474212123, -0.927733474212123, -2.19995445320486},
+    {0.0722665257878764, 1.63611048949637, 0.436156036291507, -0.436156036291507, -1.70837701528424},
+    {0.563843963708493, -0.0722665257878761, 2.63611048949637, -2.63611048949637, -0.491577437920617},
+    {-1.63611048949637, -0.0722665257878761, 0.436156036291507, -0.436156036291507, 1.70837701528424},
+    {0.0722665257878763, -0.563843963708493, 2.63611048949637, -2.63611048949637, 0.491577437920616},
+    {-1.63611048949637, -0.563843963708492, 0.927733474212123, -0.927733474212123, 2.19995445320486}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[5] = {0, 1, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    A[0] = 0.0;
+    // Number of operations to compute geometry constants: 12.
+    double G[3];
+    G[0] =  - det*(K[0]*K[0] + K[1]*K[1]);
+    G[1] =  - det*(K[0]*K[2] + K[1]*K[3]);
+    G[2] =  - det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 366
+    for (unsigned int ip = 0; ip < 6; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      
+      // Total number of operations to compute function values = 8
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F2 += FE0_D01[ip][r]*w[2][nzc1[r]];
+        F3 += FE0_D01[ip][r]*w[2][nzc0[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F0 += FE0[ip][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 20
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F4 += FE1_D10[ip][r]*w[3][nzc3[r]];
+        F5 += FE1_D01[ip][r]*w[3][nzc2[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 12
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F1 += FE1[ip][r]*w[3][r];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 14
+      double I[1];
+      // Number of operations: 14
+      I[0] = W6[ip]*(F0*F1*det + F2*F4*G[0] + F3*F5*G[2] + G[1]*(F2*F5 + F3*F4));
+      
+      
+      // Number of operations for primary indices: 1
+      // Number of operations to compute entry: 1
+      A[0] += I[0];
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivepoisson_exterior_facet_integral_2_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_exterior_facet_integral_2_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_exterior_facet_integral_2_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    13
+    // Number of operations (multiply-add pairs) for tensor contraction: 10
+    // Total number of operations (multiply-add pairs):                  33
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[1][0]*w[3][0]*(1.0);
+    const double G0_0_4 = det*w[1][0]*w[3][4]*(1.0);
+    const double G0_0_5 = det*w[1][0]*w[3][5]*(1.0);
+    const double G0_1_1 = det*w[1][1]*w[3][1]*(1.0);
+    const double G0_1_3 = det*w[1][1]*w[3][3]*(1.0);
+    const double G0_1_5 = det*w[1][1]*w[3][5]*(1.0);
+    const double G0_2_2 = det*w[1][2]*w[3][2]*(1.0);
+    const double G0_2_3 = det*w[1][2]*w[3][3]*(1.0);
+    const double G0_2_4 = det*w[1][2]*w[3][4]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.166666666666666*G0_1_1 + 0.333333333333333*G0_1_3 + 0.166666666666667*G0_2_2 + 0.333333333333333*G0_2_3;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.166666666666667*G0_0_0 + 0.333333333333333*G0_0_4 + 0.166666666666667*G0_2_2 + 0.333333333333333*G0_2_4;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.166666666666667*G0_0_0 + 0.333333333333333*G0_0_5 + 0.166666666666666*G0_1_1 + 0.333333333333333*G0_1_5;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_3_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_3_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_3_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    1
+    // Number of operations (multiply-add pairs) for tensor contraction: 4
+    // Total number of operations (multiply-add pairs):                  8
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0321428571428572*G0_0;
+    A[1] = 0.0214285714285714*G0_0;
+    A[2] = 0.0214285714285714*G0_0;
+    A[3] = 0.0214285714285714*G0_0;
+    A[4] = 0.0321428571428572*G0_0;
+    A[5] = 0.0214285714285714*G0_0;
+    A[6] = 0.0214285714285714*G0_0;
+    A[7] = 0.0214285714285714*G0_0;
+    A[8] = 0.0321428571428571*G0_0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_4_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_4_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_4_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W7[7] = {0.1125, 0.0629695902724136, 0.0629695902724136, 0.0629695902724136, 0.0661970763942531, 0.0661970763942531, 0.0661970763942531};
+    // Quadrature points on the UFC reference element: (0.333333333333333, 0.333333333333333), (0.797426985353087, 0.101286507323456), (0.101286507323456, 0.797426985353087), (0.101286507323456, 0.101286507323456), (0.0597158717897698, 0.470142064105115), (0.470142064105115, 0.0597158717897698), (0.470142064105115, 0.470142064105115)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[7][1] = \
+    {{1.0},
+    {0.22088075779229},
+    {0.22088075779229},
+    {0.22088075779229},
+    {0.356378717426369},
+    {0.356378717426369},
+    {0.356378717426369}};
+    
+    static const double FE0_D01[7][1] = \
+    {{0.0},
+    {0.0},
+    {-1.90376021590477},
+    {1.90376021590477},
+    {0.0},
+    {5.20988266488436},
+    {-5.20988266488436}};
+    
+    static const double FE0_D10[7][1] = \
+    {{0.0},
+    {-1.90376021590477},
+    {0.0},
+    {1.90376021590477},
+    {5.20988266488436},
+    {0.0},
+    {-5.20988266488436}};
+    
+    static const double FE1[7][3] = \
+    {{0.333333333333333, 0.333333333333333, 0.333333333333333},
+    {0.101286507323456, 0.797426985353087, 0.101286507323456},
+    {0.101286507323457, 0.101286507323456, 0.797426985353087},
+    {0.797426985353087, 0.101286507323456, 0.101286507323456},
+    {0.470142064105115, 0.0597158717897698, 0.470142064105115},
+    {0.470142064105115, 0.470142064105115, 0.0597158717897697},
+    {0.0597158717897699, 0.470142064105115, 0.470142064105115}};
+    
+    static const double FE1_D01[7][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 1};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 12.
+    double G[3];
+    G[0] =  - det*(K[0]*K[2] + K[1]*K[3]);
+    G[1] =  - det*(K[2]*K[2] + K[3]*K[3]);
+    G[2] =  - det*(K[0]*K[0] + K[1]*K[1]);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 406
+    for (unsigned int ip = 0; ip < 7; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        F1 += FE0[ip][0]*w[3][0];
+        F4 += FE0_D10[ip][0]*w[3][0];
+        F5 += FE0_D01[ip][0]*w[3][0];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 8
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F2 += FE1_D01[ip][r]*w[2][nzc1[r]];
+        F3 += FE1_D01[ip][r]*w[2][nzc0[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F0 += FE1[ip][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 24
+      double I[3];
+      // Number of operations: 5
+      I[0] = F1*W7[ip]*(F2*G[0] + F3*G[1]);
+      
+      // Number of operations: 5
+      I[1] = F1*W7[ip]*(F2*G[2] + F3*G[0]);
+      
+      // Number of operations: 14
+      I[2] = W7[ip]*(F0*F1*det + F2*F4*G[2] + F3*F5*G[1] + G[0]*(F2*F5 + F3*F4));
+      
+      
+      // Number of operations for primary indices: 6
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[j] += FE1[ip][j]*I[2];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 8
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc0[j]] += FE1_D01[ip][j]*I[0];
+        // Number of operations to compute entry: 2
+        A[nzc1[j]] += FE1_D01[ip][j]*I[1];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivepoisson_exterior_facet_integral_4_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_exterior_facet_integral_4_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_exterior_facet_integral_4_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      4
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 0
+    // Total number of operations (multiply-add pairs):                  4
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    
+    
+    // Compute geometry tensor
+    
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.0;
+      A[2] = 0.0;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.0;
+      A[1] = 0.0;
+      A[2] = 0.0;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.0;
+      A[1] = 0.0;
+      A[2] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivepoisson_exterior_facet_integral_5_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_exterior_facet_integral_5_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_exterior_facet_integral_5_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    6
+    // Number of operations (multiply-add pairs) for tensor contraction: 30
+    // Total number of operations (multiply-add pairs):                  46
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.0;
+      A[2] = 0.0;
+      A[3] = 0.0;
+      A[4] = 0.15*G0_1 - 0.0166666666666666*G0_2 + 0.2*G0_3;
+      A[5] = 0.0166666666666666*G0_1 + 0.0166666666666667*G0_2 + 0.133333333333333*G0_3;
+      A[6] = 0.0;
+      A[7] = 0.0166666666666666*G0_1 + 0.0166666666666667*G0_2 + 0.133333333333333*G0_3;
+      A[8] = -0.0166666666666667*G0_1 + 0.15*G0_2 + 0.2*G0_3;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.15*G0_0 - 0.0166666666666666*G0_2 + 0.2*G0_4;
+      A[1] = 0.0;
+      A[2] = 0.0166666666666667*G0_0 + 0.0166666666666667*G0_2 + 0.133333333333333*G0_4;
+      A[3] = 0.0;
+      A[4] = 0.0;
+      A[5] = 0.0;
+      A[6] = 0.0166666666666667*G0_0 + 0.0166666666666667*G0_2 + 0.133333333333333*G0_4;
+      A[7] = 0.0;
+      A[8] = -0.0166666666666666*G0_0 + 0.15*G0_2 + 0.2*G0_4;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.15*G0_0 - 0.0166666666666666*G0_1 + 0.2*G0_5;
+      A[1] = 0.0166666666666667*G0_0 + 0.0166666666666667*G0_1 + 0.133333333333333*G0_5;
+      A[2] = 0.0;
+      A[3] = 0.0166666666666667*G0_0 + 0.0166666666666667*G0_1 + 0.133333333333333*G0_5;
+      A[4] = -0.0166666666666667*G0_0 + 0.15*G0_1 + 0.2*G0_5;
+      A[5] = 0.0;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// interior facet tensor corresponding to the local contribution to
+/// a form from the integral over an interior facet.
+
+class adaptivepoisson_interior_facet_integral_5_otherwise: public ufc::interior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_interior_facet_integral_5_otherwise() : ufc::interior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_interior_facet_integral_5_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local interior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates_0,
+                               const double*  vertex_coordinates_1,
+                               std::size_t facet_0,
+                               std::size_t facet_1,
+                               int cell_orientation_0,
+                               int cell_orientation_1) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      12
+    // Number of operations (multiply-add pairs) for geometry tensor:    12
+    // Number of operations (multiply-add pairs) for tensor contraction: 180
+    // Total number of operations (multiply-add pairs):                  204
+    
+    // Compute Jacobian
+    double J_0[4];
+    compute_jacobian_triangle_2d(J_0, vertex_coordinates_0);
+    
+    // Compute Jacobian inverse and determinant
+    double K_0[4];
+    double detJ_0;
+    compute_jacobian_inverse_triangle_2d(K_0, detJ_0, J_0);
+    
+    // Compute Jacobian
+    double J_1[4];
+    compute_jacobian_triangle_2d(J_1, vertex_coordinates_1);
+    
+    // Compute Jacobian inverse and determinant
+    double K_1[4];
+    double detJ_1;
+    compute_jacobian_inverse_triangle_2d(K_1, detJ_1, J_1);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet_0][0];
+    const unsigned int v1 = edge_vertices[facet_0][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates_0[2*v1 + 0] - vertex_coordinates_0[2*v0 + 0];
+    const double dx1 = vertex_coordinates_0[2*v1 + 1] - vertex_coordinates_0[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    
+    // Compute geometry tensor
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    const double G0_10 = det*w[0][10]*(1.0);
+    const double G0_11 = det*w[0][11]*(1.0);
+    const double G1_0 = det*w[0][0]*(1.0);
+    const double G1_1 = det*w[0][1]*(1.0);
+    const double G1_2 = det*w[0][2]*(1.0);
+    const double G1_3 = det*w[0][3]*(1.0);
+    const double G1_4 = det*w[0][4]*(1.0);
+    const double G1_5 = det*w[0][5]*(1.0);
+    
+    // Compute element tensor
+    switch (facet_0)
+    {
+    case 0:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.0;
+        A[1] = 0.0;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.15*G1_1 - 0.0166666666666666*G1_2 + 0.2*G1_3;
+        A[8] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[14] = -0.0166666666666667*G1_1 + 0.15*G1_2 + 0.2*G1_3;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.15*G0_7 - 0.0166666666666666*G0_8 + 0.2*G0_9;
+        A[29] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[35] = -0.0166666666666667*G0_7 + 0.15*G0_8 + 0.2*G0_9;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.0;
+        A[1] = 0.0;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.15*G1_1 - 0.0166666666666666*G1_2 + 0.2*G1_3;
+        A[8] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[14] = -0.0166666666666667*G1_1 + 0.15*G1_2 + 0.2*G1_3;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.15*G0_6 - 0.0166666666666666*G0_8 + 0.2*G0_10;
+        A[22] = 0.0;
+        A[23] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[34] = 0.0;
+        A[35] = -0.0166666666666666*G0_6 + 0.15*G0_8 + 0.2*G0_10;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.0;
+        A[1] = 0.0;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.15*G1_1 - 0.0166666666666666*G1_2 + 0.2*G1_3;
+        A[8] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[14] = -0.0166666666666667*G1_1 + 0.15*G1_2 + 0.2*G1_3;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.15*G0_6 - 0.0166666666666666*G0_7 + 0.2*G0_11;
+        A[22] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[28] = -0.0166666666666667*G0_6 + 0.15*G0_7 + 0.2*G0_11;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = 0.0;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.15*G1_0 - 0.0166666666666666*G1_2 + 0.2*G1_4;
+        A[1] = 0.0;
+        A[2] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[13] = 0.0;
+        A[14] = -0.0166666666666666*G1_0 + 0.15*G1_2 + 0.2*G1_4;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.15*G0_7 - 0.0166666666666666*G0_8 + 0.2*G0_9;
+        A[29] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[35] = -0.0166666666666667*G0_7 + 0.15*G0_8 + 0.2*G0_9;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.15*G1_0 - 0.0166666666666666*G1_2 + 0.2*G1_4;
+        A[1] = 0.0;
+        A[2] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[13] = 0.0;
+        A[14] = -0.0166666666666666*G1_0 + 0.15*G1_2 + 0.2*G1_4;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.15*G0_6 - 0.0166666666666666*G0_8 + 0.2*G0_10;
+        A[22] = 0.0;
+        A[23] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[34] = 0.0;
+        A[35] = -0.0166666666666666*G0_6 + 0.15*G0_8 + 0.2*G0_10;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.15*G1_0 - 0.0166666666666666*G1_2 + 0.2*G1_4;
+        A[1] = 0.0;
+        A[2] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[13] = 0.0;
+        A[14] = -0.0166666666666666*G1_0 + 0.15*G1_2 + 0.2*G1_4;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.15*G0_6 - 0.0166666666666666*G0_7 + 0.2*G0_11;
+        A[22] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[28] = -0.0166666666666667*G0_6 + 0.15*G0_7 + 0.2*G0_11;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = 0.0;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.15*G1_0 - 0.0166666666666666*G1_1 + 0.2*G1_5;
+        A[1] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[7] = -0.0166666666666667*G1_0 + 0.15*G1_1 + 0.2*G1_5;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.15*G0_7 - 0.0166666666666666*G0_8 + 0.2*G0_9;
+        A[29] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[35] = -0.0166666666666667*G0_7 + 0.15*G0_8 + 0.2*G0_9;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.15*G1_0 - 0.0166666666666666*G1_1 + 0.2*G1_5;
+        A[1] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[7] = -0.0166666666666667*G1_0 + 0.15*G1_1 + 0.2*G1_5;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.15*G0_6 - 0.0166666666666666*G0_8 + 0.2*G0_10;
+        A[22] = 0.0;
+        A[23] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[34] = 0.0;
+        A[35] = -0.0166666666666666*G0_6 + 0.15*G0_8 + 0.2*G0_10;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.15*G1_0 - 0.0166666666666666*G1_1 + 0.2*G1_5;
+        A[1] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[7] = -0.0166666666666667*G1_0 + 0.15*G1_1 + 0.2*G1_5;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.15*G0_6 - 0.0166666666666666*G0_7 + 0.2*G0_11;
+        A[22] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[28] = -0.0166666666666667*G0_6 + 0.15*G0_7 + 0.2*G0_11;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = 0.0;
+          break;
+        }
+      }
+      
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_6_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_6_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_6_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W6[6] = {0.054975871827661, 0.054975871827661, 0.054975871827661, 0.111690794839005, 0.111690794839005, 0.111690794839005};
+    // Quadrature points on the UFC reference element: (0.816847572980459, 0.091576213509771), (0.091576213509771, 0.816847572980459), (0.091576213509771, 0.091576213509771), (0.10810301816807, 0.445948490915965), (0.445948490915965, 0.10810301816807), (0.445948490915965, 0.445948490915965)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[6][3] = \
+    {{0.09157621350977, 0.816847572980459, 0.091576213509771},
+    {0.0915762135097701, 0.0915762135097711, 0.816847572980459},
+    {0.816847572980458, 0.091576213509771, 0.091576213509771},
+    {0.445948490915965, 0.10810301816807, 0.445948490915965},
+    {0.445948490915965, 0.445948490915965, 0.10810301816807},
+    {0.10810301816807, 0.445948490915965, 0.445948490915965}};
+    
+    static const double FE0_D01[6][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {0, 2};
+    
+    static const double FE2[6][6] = \
+    {{-0.074803807748196, 0.517632341987673, -0.0748038077481966, 0.299215230992787, 0.0335448115231483, 0.299215230992784},
+    {-0.074803807748196, -0.0748038077481966, 0.517632341987674, 0.299215230992787, 0.299215230992784, 0.0335448115231483},
+    {0.517632341987671, -0.0748038077481966, -0.0748038077481966, 0.0335448115231487, 0.299215230992787, 0.299215230992787},
+    {-0.0482083778155119, -0.0847304930939778, -0.0482083778155119, 0.192833511262048, 0.795480226200906, 0.192833511262048},
+    {-0.0482083778155119, -0.048208377815512, -0.0847304930939778, 0.192833511262048, 0.192833511262048, 0.795480226200906},
+    {-0.0847304930939778, -0.048208377815512, -0.0482083778155119, 0.795480226200906, 0.192833511262048, 0.192833511262048}};
+    
+    static const double FE2_D01[6][5] = \
+    {{0.633695145960921, -0.633695145960916, 3.26739029192183, 0.0, -3.26739029192184},
+    {0.63369514596092, 2.26739029192184, 0.366304854039083, -2.90108543788276, -0.366304854039083},
+    {-2.26739029192183, -0.633695145960916, 0.366304854039083, 2.90108543788275, -0.366304854039083},
+    {-0.78379396366386, 0.78379396366386, 0.432412072672279, 0.0, -0.432412072672279},
+    {-0.783793963663859, -0.567587927327719, 1.78379396366386, 1.35138189099158, -1.78379396366386},
+    {0.567587927327721, 0.78379396366386, 1.78379396366386, -1.35138189099158, -1.78379396366386}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE2_D10[6][5] = \
+    {{0.63369514596092, 2.26739029192184, 0.366304854039083, -0.366304854039083, -2.90108543788276},
+    {0.633695145960921, -0.633695145960916, 3.26739029192183, -3.26739029192183, 0.0},
+    {-2.26739029192183, -0.633695145960916, 0.366304854039083, -0.366304854039083, 2.90108543788275},
+    {-0.78379396366386, -0.56758792732772, 1.78379396366386, -1.78379396366386, 1.35138189099158},
+    {-0.78379396366386, 0.78379396366386, 0.432412072672279, -0.432412072672279, 0.0},
+    {0.56758792732772, 0.78379396366386, 1.78379396366386, -1.78379396366386, -1.35138189099158}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[5] = {0, 1, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 12.
+    double G[3];
+    G[0] =  - det*(K[0]*K[2] + K[1]*K[3]);
+    G[1] =  - det*(K[2]*K[2] + K[3]*K[3]);
+    G[2] =  - det*(K[0]*K[0] + K[1]*K[1]);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 546
+    for (unsigned int ip = 0; ip < 6; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      
+      // Total number of operations to compute function values = 8
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F3 += FE0_D01[ip][r]*w[2][nzc1[r]];
+        F4 += FE0_D01[ip][r]*w[2][nzc0[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 12
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F0 += FE0[ip][r]*w[3][r];
+        F2 += FE0[ip][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 20
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F5 += FE2_D10[ip][r]*w[4][nzc3[r]];
+        F6 += FE2_D01[ip][r]*w[4][nzc2[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 12
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F1 += FE2[ip][r]*w[4][r];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 25
+      double I[3];
+      // Number of operations: 5
+      I[0] = F1*W6[ip]*(F3*G[0] + F4*G[1]);
+      
+      // Number of operations: 5
+      I[1] = F1*W6[ip]*(F3*G[2] + F4*G[0]);
+      
+      // Number of operations: 15
+      I[2] = W6[ip]*(F1*det*(F2 - F0) + F3*F5*G[2] + F4*F6*G[1] + G[0]*(F3*F6 + F4*F5));
+      
+      
+      // Number of operations for primary indices: 6
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[j] += FE0[ip][j]*I[2];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 8
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc0[j]] += FE0_D01[ip][j]*I[0];
+        // Number of operations to compute entry: 2
+        A[nzc1[j]] += FE0_D01[ip][j]*I[1];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivepoisson_exterior_facet_integral_6_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_exterior_facet_integral_6_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_exterior_facet_integral_6_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true, false, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    22
+    // Number of operations (multiply-add pairs) for tensor contraction: 33
+    // Total number of operations (multiply-add pairs):                  65
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[1][0]*w[4][0]*(1.0);
+    const double G0_0_1 = det*w[1][0]*w[4][1]*(1.0);
+    const double G0_0_2 = det*w[1][0]*w[4][2]*(1.0);
+    const double G0_0_4 = det*w[1][0]*w[4][4]*(1.0);
+    const double G0_0_5 = det*w[1][0]*w[4][5]*(1.0);
+    const double G0_1_0 = det*w[1][1]*w[4][0]*(1.0);
+    const double G0_1_1 = det*w[1][1]*w[4][1]*(1.0);
+    const double G0_1_2 = det*w[1][1]*w[4][2]*(1.0);
+    const double G0_1_3 = det*w[1][1]*w[4][3]*(1.0);
+    const double G0_1_5 = det*w[1][1]*w[4][5]*(1.0);
+    const double G0_2_0 = det*w[1][2]*w[4][0]*(1.0);
+    const double G0_2_1 = det*w[1][2]*w[4][1]*(1.0);
+    const double G0_2_2 = det*w[1][2]*w[4][2]*(1.0);
+    const double G0_2_3 = det*w[1][2]*w[4][3]*(1.0);
+    const double G0_2_4 = det*w[1][2]*w[4][4]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.15*G0_1_1 - 0.0166666666666666*G0_1_2 + 0.2*G0_1_3 + 0.0166666666666666*G0_2_1 + 0.0166666666666667*G0_2_2 + 0.133333333333333*G0_2_3;
+      A[2] = 0.0166666666666666*G0_1_1 + 0.0166666666666667*G0_1_2 + 0.133333333333333*G0_1_3 - 0.0166666666666667*G0_2_1 + 0.15*G0_2_2 + 0.2*G0_2_3;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.15*G0_0_0 - 0.0166666666666666*G0_0_2 + 0.2*G0_0_4 + 0.0166666666666667*G0_2_0 + 0.0166666666666667*G0_2_2 + 0.133333333333333*G0_2_4;
+      A[1] = 0.0;
+      A[2] = 0.0166666666666667*G0_0_0 + 0.0166666666666667*G0_0_2 + 0.133333333333333*G0_0_4 - 0.0166666666666666*G0_2_0 + 0.15*G0_2_2 + 0.2*G0_2_4;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.15*G0_0_0 - 0.0166666666666666*G0_0_1 + 0.2*G0_0_5 + 0.0166666666666667*G0_1_0 + 0.0166666666666667*G0_1_1 + 0.133333333333333*G0_1_5;
+      A[1] = 0.0166666666666667*G0_0_0 + 0.0166666666666667*G0_0_1 + 0.133333333333333*G0_0_5 - 0.0166666666666667*G0_1_0 + 0.15*G0_1_1 + 0.2*G0_1_5;
+      A[2] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_7_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_7_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_7_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    40
+    // Number of operations (multiply-add pairs) for tensor contraction: 26
+    // Total number of operations (multiply-add pairs):                  69
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[1][0]*w[0][0]*(1.0);
+    const double G0_0_1 = det*w[1][0]*w[0][1]*(1.0);
+    const double G0_0_2 = det*w[1][0]*w[0][2]*(1.0);
+    const double G0_0_3 = det*w[1][0]*w[0][3]*(1.0);
+    const double G0_0_4 = det*w[1][0]*w[0][4]*(1.0);
+    const double G0_0_5 = det*w[1][0]*w[0][5]*(1.0);
+    const double G0_1_0 = det*w[1][1]*w[0][0]*(1.0);
+    const double G0_1_1 = det*w[1][1]*w[0][1]*(1.0);
+    const double G0_1_2 = det*w[1][1]*w[0][2]*(1.0);
+    const double G0_1_3 = det*w[1][1]*w[0][3]*(1.0);
+    const double G0_1_4 = det*w[1][1]*w[0][4]*(1.0);
+    const double G0_1_5 = det*w[1][1]*w[0][5]*(1.0);
+    const double G0_2_0 = det*w[1][2]*w[0][0]*(1.0);
+    const double G0_2_1 = det*w[1][2]*w[0][1]*(1.0);
+    const double G0_2_2 = det*w[1][2]*w[0][2]*(1.0);
+    const double G0_2_3 = det*w[1][2]*w[0][3]*(1.0);
+    const double G0_2_4 = det*w[1][2]*w[0][4]*(1.0);
+    const double G0_2_5 = det*w[1][2]*w[0][5]*(1.0);
+    const double G1_0_0 = det*w[1][0]*w[3][0]*(1.0);
+    const double G1_0_1 = det*w[1][0]*w[3][1]*(1.0);
+    const double G1_0_2 = det*w[1][0]*w[3][2]*(1.0);
+    const double G1_1_0 = det*w[1][1]*w[3][0]*(1.0);
+    const double G1_1_1 = det*w[1][1]*w[3][1]*(1.0);
+    const double G1_1_2 = det*w[1][1]*w[3][2]*(1.0);
+    const double G1_2_0 = det*w[1][2]*w[3][0]*(1.0);
+    const double G1_2_1 = det*w[1][2]*w[3][1]*(1.0);
+    const double G1_2_2 = det*w[1][2]*w[3][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0_0 - 0.00833333333333333*G0_0_1 - 0.00833333333333332*G0_0_2 + 0.0333333333333333*G0_0_3 + 0.0666666666666667*G0_0_4 + 0.0666666666666667*G0_0_5 - 0.00833333333333332*G0_1_0 + 0.0166666666666666*G0_1_1 - 0.00833333333333332*G0_1_2 + 0.0666666666666667*G0_1_3 + 0.0333333333333333*G0_1_4 + 0.0666666666666667*G0_1_5 - 0.00833333333333332*G0_2_0 - 0.00833333333333333*G0_2_1 + 0.0166666666666666*G0_2_2 + 0.0666666666666667*G0_2_3 + 0.0666666666666667*G0_2_4 + 0.0333333333333333*G0_2_5 - 0.0833333333333333*G1_0_0 - 0.0416666666666667*G1_0_1 - 0.0416666666666667*G1_0_2 - 0.0416666666666667*G1_1_0 - 0.0833333333333333*G1_1_1 - 0.0416666666666667*G1_1_2 - 0.0416666666666667*G1_2_0 - 0.0416666666666667*G1_2_1 - 0.0833333333333333*G1_2_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivepoisson_exterior_facet_integral_7_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_exterior_facet_integral_7_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_exterior_facet_integral_7_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 22
+    // Total number of operations (multiply-add pairs):                  59
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[2][0]*w[0][0]*(1.0);
+    const double G0_0_4 = det*w[2][0]*w[0][4]*(1.0);
+    const double G0_0_5 = det*w[2][0]*w[0][5]*(1.0);
+    const double G0_1_1 = det*w[2][1]*w[0][1]*(1.0);
+    const double G0_1_3 = det*w[2][1]*w[0][3]*(1.0);
+    const double G0_1_5 = det*w[2][1]*w[0][5]*(1.0);
+    const double G0_2_2 = det*w[2][2]*w[0][2]*(1.0);
+    const double G0_2_3 = det*w[2][2]*w[0][3]*(1.0);
+    const double G0_2_4 = det*w[2][2]*w[0][4]*(1.0);
+    const double G1_0_0 = det*w[2][0]*w[3][0]*(1.0);
+    const double G1_0_1 = det*w[2][0]*w[3][1]*(1.0);
+    const double G1_0_2 = det*w[2][0]*w[3][2]*(1.0);
+    const double G1_1_0 = det*w[2][1]*w[3][0]*(1.0);
+    const double G1_1_1 = det*w[2][1]*w[3][1]*(1.0);
+    const double G1_1_2 = det*w[2][1]*w[3][2]*(1.0);
+    const double G1_2_0 = det*w[2][2]*w[3][0]*(1.0);
+    const double G1_2_1 = det*w[2][2]*w[3][1]*(1.0);
+    const double G1_2_2 = det*w[2][2]*w[3][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.166666666666666*G0_1_1 + 0.333333333333333*G0_1_3 + 0.166666666666667*G0_2_2 + 0.333333333333333*G0_2_3 - 0.333333333333333*G1_1_1 - 0.166666666666667*G1_1_2 - 0.166666666666667*G1_2_1 - 0.333333333333333*G1_2_2;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.166666666666667*G0_0_0 + 0.333333333333333*G0_0_4 + 0.166666666666667*G0_2_2 + 0.333333333333333*G0_2_4 - 0.333333333333333*G1_0_0 - 0.166666666666667*G1_0_2 - 0.166666666666667*G1_2_0 - 0.333333333333333*G1_2_2;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.166666666666667*G0_0_0 + 0.333333333333333*G0_0_5 + 0.166666666666666*G0_1_1 + 0.333333333333333*G0_1_5 - 0.333333333333333*G1_0_0 - 0.166666666666667*G1_0_1 - 0.166666666666667*G1_1_0 - 0.333333333333333*G1_1_1;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// interior facet tensor corresponding to the local contribution to
+/// a form from the integral over an interior facet.
+
+class adaptivepoisson_interior_facet_integral_7_otherwise: public ufc::interior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_interior_facet_integral_7_otherwise() : ufc::interior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_interior_facet_integral_7_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local interior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates_0,
+                               const double*  vertex_coordinates_1,
+                               std::size_t facet_0,
+                               std::size_t facet_1,
+                               int cell_orientation_0,
+                               int cell_orientation_1) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      12
+    // Number of operations (multiply-add pairs) for geometry tensor:    108
+    // Number of operations (multiply-add pairs) for tensor contraction: 279
+    // Total number of operations (multiply-add pairs):                  399
+    
+    // Compute Jacobian
+    double J_0[4];
+    compute_jacobian_triangle_2d(J_0, vertex_coordinates_0);
+    
+    // Compute Jacobian inverse and determinant
+    double K_0[4];
+    double detJ_0;
+    compute_jacobian_inverse_triangle_2d(K_0, detJ_0, J_0);
+    
+    // Compute Jacobian
+    double J_1[4];
+    compute_jacobian_triangle_2d(J_1, vertex_coordinates_1);
+    
+    // Compute Jacobian inverse and determinant
+    double K_1[4];
+    double detJ_1;
+    compute_jacobian_inverse_triangle_2d(K_1, detJ_1, J_1);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet_0][0];
+    const unsigned int v1 = edge_vertices[facet_0][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates_0[2*v1 + 0] - vertex_coordinates_0[2*v0 + 0];
+    const double dx1 = vertex_coordinates_0[2*v1 + 1] - vertex_coordinates_0[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    
+    // Compute geometry tensor
+    const double G0_3_6 = det*w[2][3]*w[0][6]*(1.0);
+    const double G0_3_10 = det*w[2][3]*w[0][10]*(1.0);
+    const double G0_3_11 = det*w[2][3]*w[0][11]*(1.0);
+    const double G0_4_7 = det*w[2][4]*w[0][7]*(1.0);
+    const double G0_4_9 = det*w[2][4]*w[0][9]*(1.0);
+    const double G0_4_11 = det*w[2][4]*w[0][11]*(1.0);
+    const double G0_5_8 = det*w[2][5]*w[0][8]*(1.0);
+    const double G0_5_9 = det*w[2][5]*w[0][9]*(1.0);
+    const double G0_5_10 = det*w[2][5]*w[0][10]*(1.0);
+    const double G1_3_3 = det*w[2][3]*w[3][3]*(1.0);
+    const double G1_3_4 = det*w[2][3]*w[3][4]*(1.0);
+    const double G1_3_5 = det*w[2][3]*w[3][5]*(1.0);
+    const double G1_4_3 = det*w[2][4]*w[3][3]*(1.0);
+    const double G1_4_4 = det*w[2][4]*w[3][4]*(1.0);
+    const double G1_4_5 = det*w[2][4]*w[3][5]*(1.0);
+    const double G1_5_3 = det*w[2][5]*w[3][3]*(1.0);
+    const double G1_5_4 = det*w[2][5]*w[3][4]*(1.0);
+    const double G1_5_5 = det*w[2][5]*w[3][5]*(1.0);
+    const double G2_0_0 = det*w[2][0]*w[0][0]*(1.0);
+    const double G2_0_4 = det*w[2][0]*w[0][4]*(1.0);
+    const double G2_0_5 = det*w[2][0]*w[0][5]*(1.0);
+    const double G2_1_1 = det*w[2][1]*w[0][1]*(1.0);
+    const double G2_1_3 = det*w[2][1]*w[0][3]*(1.0);
+    const double G2_1_5 = det*w[2][1]*w[0][5]*(1.0);
+    const double G2_2_2 = det*w[2][2]*w[0][2]*(1.0);
+    const double G2_2_3 = det*w[2][2]*w[0][3]*(1.0);
+    const double G2_2_4 = det*w[2][2]*w[0][4]*(1.0);
+    const double G3_0_0 = det*w[2][0]*w[3][0]*(1.0);
+    const double G3_0_1 = det*w[2][0]*w[3][1]*(1.0);
+    const double G3_0_2 = det*w[2][0]*w[3][2]*(1.0);
+    const double G3_1_0 = det*w[2][1]*w[3][0]*(1.0);
+    const double G3_1_1 = det*w[2][1]*w[3][1]*(1.0);
+    const double G3_1_2 = det*w[2][1]*w[3][2]*(1.0);
+    const double G3_2_0 = det*w[2][2]*w[3][0]*(1.0);
+    const double G3_2_1 = det*w[2][2]*w[3][1]*(1.0);
+    const double G3_2_2 = det*w[2][2]*w[3][2]*(1.0);
+    const double G4_3_6 = det*w[2][3]*w[0][6]*(1.0);
+    const double G4_3_10 = det*w[2][3]*w[0][10]*(1.0);
+    const double G4_3_11 = det*w[2][3]*w[0][11]*(1.0);
+    const double G4_4_7 = det*w[2][4]*w[0][7]*(1.0);
+    const double G4_4_9 = det*w[2][4]*w[0][9]*(1.0);
+    const double G4_4_11 = det*w[2][4]*w[0][11]*(1.0);
+    const double G4_5_8 = det*w[2][5]*w[0][8]*(1.0);
+    const double G4_5_9 = det*w[2][5]*w[0][9]*(1.0);
+    const double G4_5_10 = det*w[2][5]*w[0][10]*(1.0);
+    const double G5_3_3 = det*w[2][3]*w[3][3]*(1.0);
+    const double G5_3_4 = det*w[2][3]*w[3][4]*(1.0);
+    const double G5_3_5 = det*w[2][3]*w[3][5]*(1.0);
+    const double G5_4_3 = det*w[2][4]*w[3][3]*(1.0);
+    const double G5_4_4 = det*w[2][4]*w[3][4]*(1.0);
+    const double G5_4_5 = det*w[2][4]*w[3][5]*(1.0);
+    const double G5_5_3 = det*w[2][5]*w[3][3]*(1.0);
+    const double G5_5_4 = det*w[2][5]*w[3][4]*(1.0);
+    const double G5_5_5 = det*w[2][5]*w[3][5]*(1.0);
+    const double G6_0_0 = det*w[2][0]*w[0][0]*(1.0);
+    const double G6_0_4 = det*w[2][0]*w[0][4]*(1.0);
+    const double G6_0_5 = det*w[2][0]*w[0][5]*(1.0);
+    const double G6_1_1 = det*w[2][1]*w[0][1]*(1.0);
+    const double G6_1_3 = det*w[2][1]*w[0][3]*(1.0);
+    const double G6_1_5 = det*w[2][1]*w[0][5]*(1.0);
+    const double G6_2_2 = det*w[2][2]*w[0][2]*(1.0);
+    const double G6_2_3 = det*w[2][2]*w[0][3]*(1.0);
+    const double G6_2_4 = det*w[2][2]*w[0][4]*(1.0);
+    const double G7_0_0 = det*w[2][0]*w[3][0]*(1.0);
+    const double G7_0_1 = det*w[2][0]*w[3][1]*(1.0);
+    const double G7_0_2 = det*w[2][0]*w[3][2]*(1.0);
+    const double G7_1_0 = det*w[2][1]*w[3][0]*(1.0);
+    const double G7_1_1 = det*w[2][1]*w[3][1]*(1.0);
+    const double G7_1_2 = det*w[2][1]*w[3][2]*(1.0);
+    const double G7_2_0 = det*w[2][2]*w[3][0]*(1.0);
+    const double G7_2_1 = det*w[2][2]*w[3][1]*(1.0);
+    const double G7_2_2 = det*w[2][2]*w[3][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet_0)
+    {
+    case 0:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.0833333333333332*G4_4_7 + 0.166666666666667*G4_4_9 + 0.0833333333333333*G4_5_8 + 0.166666666666666*G4_5_9 - 0.166666666666667*G5_4_4 - 0.0833333333333333*G5_4_5 - 0.0833333333333333*G5_5_4 - 0.166666666666667*G5_5_5 + 0.0833333333333332*G6_1_1 + 0.166666666666667*G6_1_3 + 0.0833333333333333*G6_2_2 + 0.166666666666666*G6_2_3 - 0.166666666666667*G7_1_1 - 0.0833333333333333*G7_1_2 - 0.0833333333333333*G7_2_1 - 0.166666666666667*G7_2_2;
+        A[1] = 0.0833333333333332*G0_4_7 + 0.166666666666667*G0_4_9 + 0.0833333333333333*G0_5_8 + 0.166666666666666*G0_5_9 - 0.166666666666667*G1_4_4 - 0.0833333333333333*G1_4_5 - 0.0833333333333333*G1_5_4 - 0.166666666666667*G1_5_5 + 0.0833333333333332*G2_1_1 + 0.166666666666667*G2_1_3 + 0.0833333333333333*G2_2_2 + 0.166666666666666*G2_2_3 - 0.166666666666667*G3_1_1 - 0.0833333333333333*G3_1_2 - 0.0833333333333333*G3_2_1 - 0.166666666666667*G3_2_2;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.0833333333333333*G4_3_6 + 0.166666666666667*G4_3_10 + 0.0833333333333333*G4_5_8 + 0.166666666666666*G4_5_10 - 0.166666666666667*G5_3_3 - 0.0833333333333333*G5_3_5 - 0.0833333333333333*G5_5_3 - 0.166666666666667*G5_5_5 + 0.0833333333333332*G6_1_1 + 0.166666666666667*G6_1_3 + 0.0833333333333333*G6_2_2 + 0.166666666666666*G6_2_3 - 0.166666666666667*G7_1_1 - 0.0833333333333333*G7_1_2 - 0.0833333333333333*G7_2_1 - 0.166666666666667*G7_2_2;
+        A[1] = 0.0833333333333333*G0_3_6 + 0.166666666666667*G0_3_10 + 0.0833333333333333*G0_5_8 + 0.166666666666666*G0_5_10 - 0.166666666666667*G1_3_3 - 0.0833333333333333*G1_3_5 - 0.0833333333333333*G1_5_3 - 0.166666666666667*G1_5_5 + 0.0833333333333332*G2_1_1 + 0.166666666666667*G2_1_3 + 0.0833333333333333*G2_2_2 + 0.166666666666666*G2_2_3 - 0.166666666666667*G3_1_1 - 0.0833333333333333*G3_1_2 - 0.0833333333333333*G3_2_1 - 0.166666666666667*G3_2_2;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.0833333333333333*G4_3_6 + 0.166666666666667*G4_3_11 + 0.0833333333333332*G4_4_7 + 0.166666666666667*G4_4_11 - 0.166666666666667*G5_3_3 - 0.0833333333333333*G5_3_4 - 0.0833333333333333*G5_4_3 - 0.166666666666667*G5_4_4 + 0.0833333333333332*G6_1_1 + 0.166666666666667*G6_1_3 + 0.0833333333333333*G6_2_2 + 0.166666666666666*G6_2_3 - 0.166666666666667*G7_1_1 - 0.0833333333333333*G7_1_2 - 0.0833333333333333*G7_2_1 - 0.166666666666667*G7_2_2;
+        A[1] = 0.0833333333333333*G0_3_6 + 0.166666666666667*G0_3_11 + 0.0833333333333332*G0_4_7 + 0.166666666666667*G0_4_11 - 0.166666666666667*G1_3_3 - 0.0833333333333333*G1_3_4 - 0.0833333333333333*G1_4_3 - 0.166666666666667*G1_4_4 + 0.0833333333333332*G2_1_1 + 0.166666666666667*G2_1_3 + 0.0833333333333333*G2_2_2 + 0.166666666666666*G2_2_3 - 0.166666666666667*G3_1_1 - 0.0833333333333333*G3_1_2 - 0.0833333333333333*G3_2_1 - 0.166666666666667*G3_2_2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.0833333333333332*G4_4_7 + 0.166666666666667*G4_4_9 + 0.0833333333333333*G4_5_8 + 0.166666666666666*G4_5_9 - 0.166666666666667*G5_4_4 - 0.0833333333333333*G5_4_5 - 0.0833333333333333*G5_5_4 - 0.166666666666667*G5_5_5 + 0.0833333333333333*G6_0_0 + 0.166666666666667*G6_0_4 + 0.0833333333333333*G6_2_2 + 0.166666666666666*G6_2_4 - 0.166666666666667*G7_0_0 - 0.0833333333333333*G7_0_2 - 0.0833333333333333*G7_2_0 - 0.166666666666667*G7_2_2;
+        A[1] = 0.0833333333333332*G0_4_7 + 0.166666666666667*G0_4_9 + 0.0833333333333333*G0_5_8 + 0.166666666666666*G0_5_9 - 0.166666666666667*G1_4_4 - 0.0833333333333333*G1_4_5 - 0.0833333333333333*G1_5_4 - 0.166666666666667*G1_5_5 + 0.0833333333333333*G2_0_0 + 0.166666666666667*G2_0_4 + 0.0833333333333333*G2_2_2 + 0.166666666666666*G2_2_4 - 0.166666666666667*G3_0_0 - 0.0833333333333333*G3_0_2 - 0.0833333333333333*G3_2_0 - 0.166666666666667*G3_2_2;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.0833333333333333*G4_3_6 + 0.166666666666667*G4_3_10 + 0.0833333333333333*G4_5_8 + 0.166666666666666*G4_5_10 - 0.166666666666667*G5_3_3 - 0.0833333333333333*G5_3_5 - 0.0833333333333333*G5_5_3 - 0.166666666666667*G5_5_5 + 0.0833333333333333*G6_0_0 + 0.166666666666667*G6_0_4 + 0.0833333333333333*G6_2_2 + 0.166666666666666*G6_2_4 - 0.166666666666667*G7_0_0 - 0.0833333333333333*G7_0_2 - 0.0833333333333333*G7_2_0 - 0.166666666666667*G7_2_2;
+        A[1] = 0.0833333333333333*G0_3_6 + 0.166666666666667*G0_3_10 + 0.0833333333333333*G0_5_8 + 0.166666666666666*G0_5_10 - 0.166666666666667*G1_3_3 - 0.0833333333333333*G1_3_5 - 0.0833333333333333*G1_5_3 - 0.166666666666667*G1_5_5 + 0.0833333333333333*G2_0_0 + 0.166666666666667*G2_0_4 + 0.0833333333333333*G2_2_2 + 0.166666666666666*G2_2_4 - 0.166666666666667*G3_0_0 - 0.0833333333333333*G3_0_2 - 0.0833333333333333*G3_2_0 - 0.166666666666667*G3_2_2;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.0833333333333333*G4_3_6 + 0.166666666666667*G4_3_11 + 0.0833333333333332*G4_4_7 + 0.166666666666667*G4_4_11 - 0.166666666666667*G5_3_3 - 0.0833333333333333*G5_3_4 - 0.0833333333333333*G5_4_3 - 0.166666666666667*G5_4_4 + 0.0833333333333333*G6_0_0 + 0.166666666666667*G6_0_4 + 0.0833333333333333*G6_2_2 + 0.166666666666666*G6_2_4 - 0.166666666666667*G7_0_0 - 0.0833333333333333*G7_0_2 - 0.0833333333333333*G7_2_0 - 0.166666666666667*G7_2_2;
+        A[1] = 0.0833333333333333*G0_3_6 + 0.166666666666667*G0_3_11 + 0.0833333333333332*G0_4_7 + 0.166666666666667*G0_4_11 - 0.166666666666667*G1_3_3 - 0.0833333333333333*G1_3_4 - 0.0833333333333333*G1_4_3 - 0.166666666666667*G1_4_4 + 0.0833333333333333*G2_0_0 + 0.166666666666667*G2_0_4 + 0.0833333333333333*G2_2_2 + 0.166666666666666*G2_2_4 - 0.166666666666667*G3_0_0 - 0.0833333333333333*G3_0_2 - 0.0833333333333333*G3_2_0 - 0.166666666666667*G3_2_2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.0833333333333332*G4_4_7 + 0.166666666666667*G4_4_9 + 0.0833333333333333*G4_5_8 + 0.166666666666666*G4_5_9 - 0.166666666666667*G5_4_4 - 0.0833333333333333*G5_4_5 - 0.0833333333333333*G5_5_4 - 0.166666666666667*G5_5_5 + 0.0833333333333333*G6_0_0 + 0.166666666666667*G6_0_5 + 0.0833333333333332*G6_1_1 + 0.166666666666667*G6_1_5 - 0.166666666666667*G7_0_0 - 0.0833333333333333*G7_0_1 - 0.0833333333333333*G7_1_0 - 0.166666666666667*G7_1_1;
+        A[1] = 0.0833333333333332*G0_4_7 + 0.166666666666667*G0_4_9 + 0.0833333333333333*G0_5_8 + 0.166666666666666*G0_5_9 - 0.166666666666667*G1_4_4 - 0.0833333333333333*G1_4_5 - 0.0833333333333333*G1_5_4 - 0.166666666666667*G1_5_5 + 0.0833333333333333*G2_0_0 + 0.166666666666667*G2_0_5 + 0.0833333333333332*G2_1_1 + 0.166666666666667*G2_1_5 - 0.166666666666667*G3_0_0 - 0.0833333333333333*G3_0_1 - 0.0833333333333333*G3_1_0 - 0.166666666666667*G3_1_1;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.0833333333333333*G4_3_6 + 0.166666666666667*G4_3_10 + 0.0833333333333333*G4_5_8 + 0.166666666666666*G4_5_10 - 0.166666666666667*G5_3_3 - 0.0833333333333333*G5_3_5 - 0.0833333333333333*G5_5_3 - 0.166666666666667*G5_5_5 + 0.0833333333333333*G6_0_0 + 0.166666666666667*G6_0_5 + 0.0833333333333332*G6_1_1 + 0.166666666666667*G6_1_5 - 0.166666666666667*G7_0_0 - 0.0833333333333333*G7_0_1 - 0.0833333333333333*G7_1_0 - 0.166666666666667*G7_1_1;
+        A[1] = 0.0833333333333333*G0_3_6 + 0.166666666666667*G0_3_10 + 0.0833333333333333*G0_5_8 + 0.166666666666666*G0_5_10 - 0.166666666666667*G1_3_3 - 0.0833333333333333*G1_3_5 - 0.0833333333333333*G1_5_3 - 0.166666666666667*G1_5_5 + 0.0833333333333333*G2_0_0 + 0.166666666666667*G2_0_5 + 0.0833333333333332*G2_1_1 + 0.166666666666667*G2_1_5 - 0.166666666666667*G3_0_0 - 0.0833333333333333*G3_0_1 - 0.0833333333333333*G3_1_0 - 0.166666666666667*G3_1_1;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.0833333333333333*G4_3_6 + 0.166666666666667*G4_3_11 + 0.0833333333333332*G4_4_7 + 0.166666666666667*G4_4_11 - 0.166666666666667*G5_3_3 - 0.0833333333333333*G5_3_4 - 0.0833333333333333*G5_4_3 - 0.166666666666667*G5_4_4 + 0.0833333333333333*G6_0_0 + 0.166666666666667*G6_0_5 + 0.0833333333333332*G6_1_1 + 0.166666666666667*G6_1_5 - 0.166666666666667*G7_0_0 - 0.0833333333333333*G7_0_1 - 0.0833333333333333*G7_1_0 - 0.166666666666667*G7_1_1;
+        A[1] = 0.0833333333333333*G0_3_6 + 0.166666666666667*G0_3_11 + 0.0833333333333332*G0_4_7 + 0.166666666666667*G0_4_11 - 0.166666666666667*G1_3_3 - 0.0833333333333333*G1_3_4 - 0.0833333333333333*G1_4_3 - 0.166666666666667*G1_4_4 + 0.0833333333333333*G2_0_0 + 0.166666666666667*G2_0_5 + 0.0833333333333332*G2_1_1 + 0.166666666666667*G2_1_5 - 0.166666666666667*G3_0_0 - 0.0833333333333333*G3_0_1 - 0.0833333333333333*G3_1_0 - 0.166666666666667*G3_1_1;
+          break;
+        }
+      }
+      
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_8_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_8_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_8_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_9_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_9_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_9_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivepoisson_exterior_facet_integral_9_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_exterior_facet_integral_9_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_exterior_facet_integral_9_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 9
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    const double G0_2 = det*w[1][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.333333333333333*G0_1 + 0.166666666666667*G0_2;
+      A[2] = 0.166666666666667*G0_1 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_2;
+      A[1] = 0.0;
+      A[2] = 0.166666666666667*G0_0 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_1;
+      A[1] = 0.166666666666667*G0_0 + 0.333333333333333*G0_1;
+      A[2] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivepoisson_cell_integral_10_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_cell_integral_10_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_cell_integral_10_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 2
+    // Total number of operations (multiply-add pairs):                  8
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.166666666666667*G0_0 + 0.166666666666667*G0_1 + 0.166666666666667*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "382b9803f2a509ae74c16c63bdf4f169f7badc063ce177bbdddb2734e3d32c16d8a809f391e8661c7076ddf293d38a47aaaa21a5cbf54337d67ed1e859993c70";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_2: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_2() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "6e035dca9d8c4cfc991db0e76f5630afd58ee1f27054a74633cdcce7031cb5bd9579f8e3e13ac55194662a42d680e578a4bc2ee573d5976921af7bd2520c7823";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 0;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 4;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivepoisson_finite_element_4();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivepoisson_dofmap_4();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_2_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivepoisson_exterior_facet_integral_2_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_3: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_3() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "67b203854f3ca1f9feac5fc13d4efb8a74a7fda43626869e0658070789e73f79bd72796cb8a56e81cdd5eb5a78de4000403b13f300eb31724ff2d74a8f613902";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_3_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_4: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_4() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_4()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "262d582e90ac0b556aabf76120c84262cf8eacdf0deef325eaae164dea53db71cf34ae19bc37851a9bbe75ea3b5b8ce05fab5bd50a214f83630342dc10636c62";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 4;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivepoisson_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivepoisson_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_4_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivepoisson_exterior_facet_integral_4_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_5: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_5() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_5()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "e42ae4034361a3a536c86cee63a5b8cd51ce72e50484e6cb0b39ea29fe25610b3114d7a8e35e1b7b2de50a46fb89df40008a6ba248887a12af934a86d465e707";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivepoisson_exterior_facet_integral_5_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return new adaptivepoisson_interior_facet_integral_5_otherwise();
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_6: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_6() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_6()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "0bd20f5aa0322b2f114265fdb7709713d1fe5f3e18483d8c302ed7577e0a3bc170008fbbde54e3303642ffd332346114a88c418a2c18b071cc1f66f462d0bb01";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 5;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 5:
+      {
+        return new adaptivepoisson_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 5:
+      {
+        return new adaptivepoisson_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_6_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivepoisson_exterior_facet_integral_6_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_7: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_7() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_7()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d8e27cee94bb9489ddf24c8b415ef7e35c2cf0f31da9eb510f4fcdbe2dc35719f2874a3c25a41d87a819735bb19961d24b4a0ef32542805b17facd8dcc071c1d";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 4;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_4();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivepoisson_finite_element_3();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_4();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivepoisson_dofmap_3();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_7_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivepoisson_exterior_facet_integral_7_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return new adaptivepoisson_interior_facet_integral_7_otherwise();
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_8: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_8() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_8()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_8_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_9: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_9() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_9()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "5ee927682358c6c0426041ab22b70a08e5ed403f78f13005173589a5c00c41be670a70ca85fa21afd8fb8bcee737b704b4ee42ec7f4dfef9f5aa6cd90a5c4283";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_9_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivepoisson_exterior_facet_integral_9_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivepoisson_form_10: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivepoisson_form_10() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivepoisson_form_10()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "48296b40b4112bae76d08039d80fa19c044f0e681d94fac9844b1e50c5b7605ed293905a73630c6269104fd6116b5548e42a6c39d223bed5904d3a91431f4e9a";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 0;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_finite_element_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivepoisson_dofmap_5();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivepoisson_cell_integral_10_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace AdaptivePoisson
+{
+
+class CoefficientSpace___cell_bubble: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_bubble(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_bubble(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_bubble(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_bubble(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___cell_bubble(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___cell_bubble(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___cell_bubble()
+  {
+  }
+
+};
+
+class CoefficientSpace___cell_cone: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_cone(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_cone(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_cone(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_cone(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___cell_cone(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___cell_cone(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___cell_cone()
+  {
+  }
+
+};
+
+class CoefficientSpace___cell_residual: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_residual(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_residual(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_residual(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_residual(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___cell_residual(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___cell_residual(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___cell_residual()
+  {
+  }
+
+};
+
+class CoefficientSpace___discrete_dual_solution: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___discrete_dual_solution(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___discrete_dual_solution(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___discrete_dual_solution(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___discrete_dual_solution(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___discrete_dual_solution(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___discrete_dual_solution(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___discrete_dual_solution()
+  {
+  }
+
+};
+
+class CoefficientSpace___discrete_primal_solution: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___discrete_primal_solution(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___discrete_primal_solution(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___discrete_primal_solution(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___discrete_primal_solution(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___discrete_primal_solution(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___discrete_primal_solution(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___discrete_primal_solution()
+  {
+  }
+
+};
+
+class CoefficientSpace___facet_residual: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___facet_residual(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___facet_residual(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___facet_residual(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___facet_residual(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___facet_residual(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___facet_residual(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___facet_residual()
+  {
+  }
+
+};
+
+class CoefficientSpace___improved_dual: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___improved_dual(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_4()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___improved_dual(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_4()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___improved_dual(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_4()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___improved_dual(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_4()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___improved_dual(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_4()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___improved_dual(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_4()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___improved_dual()
+  {
+  }
+
+};
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class Form_0_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_0_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_0_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_0_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_0_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_0_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_0_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_0_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_0_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_0_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_0_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_0_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_0_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_0_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_0_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_0_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_0: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_0(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_0());
+  }
+
+  // Constructor
+  Form_0(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_0());
+  }
+
+  // Destructor
+  ~Form_0()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_0_FunctionSpace_0 TestSpace;
+  typedef Form_0_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_1_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_1_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_1_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_1_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_1_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_1_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_1_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_1_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_1: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_1(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_1());
+  }
+
+  // Constructor
+  Form_1(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_1());
+  }
+
+  // Destructor
+  ~Form_1()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_1_FunctionSpace_0 TestSpace;
+
+  // Coefficients
+};
+
+typedef CoefficientSpace_f Form_2_FunctionSpace_0;
+
+typedef CoefficientSpace_g Form_2_FunctionSpace_1;
+
+typedef CoefficientSpace___discrete_primal_solution Form_2_FunctionSpace_2;
+
+typedef CoefficientSpace___improved_dual Form_2_FunctionSpace_3;
+
+class Form_2: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_2(const dolfin::Mesh& mesh):
+    dolfin::Form(0, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_2());
+  }
+
+  // Constructor
+  Form_2(const dolfin::Mesh& mesh, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g, const dolfin::GenericFunction& __discrete_primal_solution, const dolfin::GenericFunction& __improved_dual):
+    dolfin::Form(0, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->f = f;
+    this->g = g;
+    this->__discrete_primal_solution = __discrete_primal_solution;
+    this->__improved_dual = __improved_dual;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_2());
+  }
+
+  // Constructor
+  Form_2(const dolfin::Mesh& mesh, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g, std::shared_ptr<const dolfin::GenericFunction> __discrete_primal_solution, std::shared_ptr<const dolfin::GenericFunction> __improved_dual):
+    dolfin::Form(0, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->f = *f;
+    this->g = *g;
+    this->__discrete_primal_solution = *__discrete_primal_solution;
+    this->__improved_dual = *__improved_dual;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_2());
+  }
+
+  // Constructor
+  Form_2(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::Form(0, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = mesh;
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_2());
+  }
+
+  // Constructor
+  Form_2(std::shared_ptr<const dolfin::Mesh> mesh, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g, const dolfin::GenericFunction& __discrete_primal_solution, const dolfin::GenericFunction& __improved_dual):
+    dolfin::Form(0, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = mesh;
+    this->f = f;
+    this->g = g;
+    this->__discrete_primal_solution = __discrete_primal_solution;
+    this->__improved_dual = __improved_dual;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_2());
+  }
+
+  // Constructor
+  Form_2(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g, std::shared_ptr<const dolfin::GenericFunction> __discrete_primal_solution, std::shared_ptr<const dolfin::GenericFunction> __improved_dual):
+    dolfin::Form(0, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = mesh;
+    this->f = *f;
+    this->g = *g;
+    this->__discrete_primal_solution = *__discrete_primal_solution;
+    this->__improved_dual = *__improved_dual;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_2());
+  }
+
+  // Destructor
+  ~Form_2()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+    else if (name == "__discrete_primal_solution")
+      return 2;
+    else if (name == "__improved_dual")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    case 2:
+      return "__discrete_primal_solution";
+    case 3:
+      return "__improved_dual";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_2_FunctionSpace_0 CoefficientSpace_f;
+  typedef Form_2_FunctionSpace_1 CoefficientSpace_g;
+  typedef Form_2_FunctionSpace_2 CoefficientSpace___discrete_primal_solution;
+  typedef Form_2_FunctionSpace_3 CoefficientSpace___improved_dual;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+  dolfin::CoefficientAssigner __discrete_primal_solution;
+  dolfin::CoefficientAssigner __improved_dual;
+};
+
+class Form_3_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_3_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_3_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_3_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_3_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_3_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_3_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_3_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_3_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_3_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_3_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_3_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_3_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_3_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_3_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_3_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace___cell_bubble Form_3_FunctionSpace_2;
+
+class Form_3: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_3(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_3());
+  }
+
+  // Constructor
+  Form_3(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& __cell_bubble):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->__cell_bubble = __cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_3());
+  }
+
+  // Constructor
+  Form_3(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> __cell_bubble):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->__cell_bubble = *__cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_3());
+  }
+
+  // Constructor
+  Form_3(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_3());
+  }
+
+  // Constructor
+  Form_3(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& __cell_bubble):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->__cell_bubble = __cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_3());
+  }
+
+  // Constructor
+  Form_3(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> __cell_bubble):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->__cell_bubble = *__cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_3());
+  }
+
+  // Destructor
+  ~Form_3()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "__cell_bubble")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "__cell_bubble";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_3_FunctionSpace_0 TestSpace;
+  typedef Form_3_FunctionSpace_1 TrialSpace;
+  typedef Form_3_FunctionSpace_2 CoefficientSpace___cell_bubble;
+
+  // Coefficients
+  dolfin::CoefficientAssigner __cell_bubble;
+};
+
+class Form_4_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_4_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_4_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_4_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_4_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_4_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_4_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_4_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_4_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_4_FunctionSpace_2;
+
+typedef CoefficientSpace___discrete_primal_solution Form_4_FunctionSpace_3;
+
+typedef CoefficientSpace___cell_bubble Form_4_FunctionSpace_4;
+
+class Form_4: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_4(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_4());
+  }
+
+  // Constructor
+  Form_4(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g, const dolfin::GenericFunction& __discrete_primal_solution, const dolfin::GenericFunction& __cell_bubble):
+    dolfin::Form(1, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+    this->__discrete_primal_solution = __discrete_primal_solution;
+    this->__cell_bubble = __cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_4());
+  }
+
+  // Constructor
+  Form_4(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g, std::shared_ptr<const dolfin::GenericFunction> __discrete_primal_solution, std::shared_ptr<const dolfin::GenericFunction> __cell_bubble):
+    dolfin::Form(1, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+    this->__discrete_primal_solution = *__discrete_primal_solution;
+    this->__cell_bubble = *__cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_4());
+  }
+
+  // Constructor
+  Form_4(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_4());
+  }
+
+  // Constructor
+  Form_4(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g, const dolfin::GenericFunction& __discrete_primal_solution, const dolfin::GenericFunction& __cell_bubble):
+    dolfin::Form(1, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+    this->__discrete_primal_solution = __discrete_primal_solution;
+    this->__cell_bubble = __cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_4());
+  }
+
+  // Constructor
+  Form_4(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g, std::shared_ptr<const dolfin::GenericFunction> __discrete_primal_solution, std::shared_ptr<const dolfin::GenericFunction> __cell_bubble):
+    dolfin::Form(1, 4), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+    this->__discrete_primal_solution = *__discrete_primal_solution;
+    this->__cell_bubble = *__cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_4());
+  }
+
+  // Destructor
+  ~Form_4()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+    else if (name == "__discrete_primal_solution")
+      return 2;
+    else if (name == "__cell_bubble")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    case 2:
+      return "__discrete_primal_solution";
+    case 3:
+      return "__cell_bubble";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_4_FunctionSpace_0 TestSpace;
+  typedef Form_4_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_4_FunctionSpace_2 CoefficientSpace_g;
+  typedef Form_4_FunctionSpace_3 CoefficientSpace___discrete_primal_solution;
+  typedef Form_4_FunctionSpace_4 CoefficientSpace___cell_bubble;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+  dolfin::CoefficientAssigner __discrete_primal_solution;
+  dolfin::CoefficientAssigner __cell_bubble;
+};
+
+class Form_5_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_5_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_5_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_5_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_5_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_5_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_5_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_5_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_5_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_5_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_5_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_5_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_5_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_5_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_5_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_5_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace___cell_cone Form_5_FunctionSpace_2;
+
+class Form_5: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_5(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_5());
+  }
+
+  // Constructor
+  Form_5(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& __cell_cone):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->__cell_cone = __cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_5());
+  }
+
+  // Constructor
+  Form_5(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> __cell_cone):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->__cell_cone = *__cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_5());
+  }
+
+  // Constructor
+  Form_5(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_5());
+  }
+
+  // Constructor
+  Form_5(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& __cell_cone):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->__cell_cone = __cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_5());
+  }
+
+  // Constructor
+  Form_5(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> __cell_cone):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->__cell_cone = *__cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_5());
+  }
+
+  // Destructor
+  ~Form_5()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "__cell_cone")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "__cell_cone";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_5_FunctionSpace_0 TestSpace;
+  typedef Form_5_FunctionSpace_1 TrialSpace;
+  typedef Form_5_FunctionSpace_2 CoefficientSpace___cell_cone;
+
+  // Coefficients
+  dolfin::CoefficientAssigner __cell_cone;
+};
+
+class Form_6_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_6_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_6_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_6_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_6_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_6_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_6_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_6_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_6_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_6_FunctionSpace_2;
+
+typedef CoefficientSpace___discrete_primal_solution Form_6_FunctionSpace_3;
+
+typedef CoefficientSpace___cell_residual Form_6_FunctionSpace_4;
+
+typedef CoefficientSpace___cell_cone Form_6_FunctionSpace_5;
+
+class Form_6: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_6(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 5), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_6());
+  }
+
+  // Constructor
+  Form_6(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g, const dolfin::GenericFunction& __discrete_primal_solution, const dolfin::GenericFunction& __cell_residual, const dolfin::GenericFunction& __cell_cone):
+    dolfin::Form(1, 5), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+    this->__discrete_primal_solution = __discrete_primal_solution;
+    this->__cell_residual = __cell_residual;
+    this->__cell_cone = __cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_6());
+  }
+
+  // Constructor
+  Form_6(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g, std::shared_ptr<const dolfin::GenericFunction> __discrete_primal_solution, std::shared_ptr<const dolfin::GenericFunction> __cell_residual, std::shared_ptr<const dolfin::GenericFunction> __cell_cone):
+    dolfin::Form(1, 5), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+    this->__discrete_primal_solution = *__discrete_primal_solution;
+    this->__cell_residual = *__cell_residual;
+    this->__cell_cone = *__cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_6());
+  }
+
+  // Constructor
+  Form_6(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 5), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_6());
+  }
+
+  // Constructor
+  Form_6(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g, const dolfin::GenericFunction& __discrete_primal_solution, const dolfin::GenericFunction& __cell_residual, const dolfin::GenericFunction& __cell_cone):
+    dolfin::Form(1, 5), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+    this->__discrete_primal_solution = __discrete_primal_solution;
+    this->__cell_residual = __cell_residual;
+    this->__cell_cone = __cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_6());
+  }
+
+  // Constructor
+  Form_6(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g, std::shared_ptr<const dolfin::GenericFunction> __discrete_primal_solution, std::shared_ptr<const dolfin::GenericFunction> __cell_residual, std::shared_ptr<const dolfin::GenericFunction> __cell_cone):
+    dolfin::Form(1, 5), f(*this, 0), g(*this, 1), __discrete_primal_solution(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+    this->__discrete_primal_solution = *__discrete_primal_solution;
+    this->__cell_residual = *__cell_residual;
+    this->__cell_cone = *__cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_6());
+  }
+
+  // Destructor
+  ~Form_6()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+    else if (name == "__discrete_primal_solution")
+      return 2;
+    else if (name == "__cell_residual")
+      return 3;
+    else if (name == "__cell_cone")
+      return 4;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    case 2:
+      return "__discrete_primal_solution";
+    case 3:
+      return "__cell_residual";
+    case 4:
+      return "__cell_cone";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_6_FunctionSpace_0 TestSpace;
+  typedef Form_6_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_6_FunctionSpace_2 CoefficientSpace_g;
+  typedef Form_6_FunctionSpace_3 CoefficientSpace___discrete_primal_solution;
+  typedef Form_6_FunctionSpace_4 CoefficientSpace___cell_residual;
+  typedef Form_6_FunctionSpace_5 CoefficientSpace___cell_cone;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+  dolfin::CoefficientAssigner __discrete_primal_solution;
+  dolfin::CoefficientAssigner __cell_residual;
+  dolfin::CoefficientAssigner __cell_cone;
+};
+
+class Form_7_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_7_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_7_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_7_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_7_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_7_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_7_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_7_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace___improved_dual Form_7_FunctionSpace_1;
+
+typedef CoefficientSpace___cell_residual Form_7_FunctionSpace_2;
+
+typedef CoefficientSpace___facet_residual Form_7_FunctionSpace_3;
+
+typedef CoefficientSpace___discrete_dual_solution Form_7_FunctionSpace_4;
+
+class Form_7: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_7(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_7());
+  }
+
+  // Constructor
+  Form_7(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& __improved_dual, const dolfin::GenericFunction& __cell_residual, const dolfin::GenericFunction& __facet_residual, const dolfin::GenericFunction& __discrete_dual_solution):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->__improved_dual = __improved_dual;
+    this->__cell_residual = __cell_residual;
+    this->__facet_residual = __facet_residual;
+    this->__discrete_dual_solution = __discrete_dual_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_7());
+  }
+
+  // Constructor
+  Form_7(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> __improved_dual, std::shared_ptr<const dolfin::GenericFunction> __cell_residual, std::shared_ptr<const dolfin::GenericFunction> __facet_residual, std::shared_ptr<const dolfin::GenericFunction> __discrete_dual_solution):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->__improved_dual = *__improved_dual;
+    this->__cell_residual = *__cell_residual;
+    this->__facet_residual = *__facet_residual;
+    this->__discrete_dual_solution = *__discrete_dual_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_7());
+  }
+
+  // Constructor
+  Form_7(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_7());
+  }
+
+  // Constructor
+  Form_7(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& __improved_dual, const dolfin::GenericFunction& __cell_residual, const dolfin::GenericFunction& __facet_residual, const dolfin::GenericFunction& __discrete_dual_solution):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->__improved_dual = __improved_dual;
+    this->__cell_residual = __cell_residual;
+    this->__facet_residual = __facet_residual;
+    this->__discrete_dual_solution = __discrete_dual_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_7());
+  }
+
+  // Constructor
+  Form_7(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> __improved_dual, std::shared_ptr<const dolfin::GenericFunction> __cell_residual, std::shared_ptr<const dolfin::GenericFunction> __facet_residual, std::shared_ptr<const dolfin::GenericFunction> __discrete_dual_solution):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->__improved_dual = *__improved_dual;
+    this->__cell_residual = *__cell_residual;
+    this->__facet_residual = *__facet_residual;
+    this->__discrete_dual_solution = *__discrete_dual_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_7());
+  }
+
+  // Destructor
+  ~Form_7()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "__improved_dual")
+      return 0;
+    else if (name == "__cell_residual")
+      return 1;
+    else if (name == "__facet_residual")
+      return 2;
+    else if (name == "__discrete_dual_solution")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "__improved_dual";
+    case 1:
+      return "__cell_residual";
+    case 2:
+      return "__facet_residual";
+    case 3:
+      return "__discrete_dual_solution";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_7_FunctionSpace_0 TestSpace;
+  typedef Form_7_FunctionSpace_1 CoefficientSpace___improved_dual;
+  typedef Form_7_FunctionSpace_2 CoefficientSpace___cell_residual;
+  typedef Form_7_FunctionSpace_3 CoefficientSpace___facet_residual;
+  typedef Form_7_FunctionSpace_4 CoefficientSpace___discrete_dual_solution;
+
+  // Coefficients
+  dolfin::CoefficientAssigner __improved_dual;
+  dolfin::CoefficientAssigner __cell_residual;
+  dolfin::CoefficientAssigner __facet_residual;
+  dolfin::CoefficientAssigner __discrete_dual_solution;
+};
+
+class Form_lhs_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_lhs_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_lhs_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_lhs_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_lhs_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_lhs_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_lhs_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_lhs_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_lhs_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_lhs_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_lhs_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_lhs_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_lhs_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_lhs_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_lhs_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_lhs_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_lhs: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_lhs(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_8());
+  }
+
+  // Constructor
+  Form_lhs(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_8());
+  }
+
+  // Destructor
+  ~Form_lhs()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_lhs_FunctionSpace_0 TestSpace;
+  typedef Form_lhs_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_rhs_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_rhs_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_rhs_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_rhs_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_rhs_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_rhs_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_rhs_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivepoisson_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivepoisson_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_rhs_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_rhs_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_rhs_FunctionSpace_2;
+
+class Form_rhs: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_rhs(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_9());
+  }
+
+  // Constructor
+  Form_rhs(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_9());
+  }
+
+  // Constructor
+  Form_rhs(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_9());
+  }
+
+  // Constructor
+  Form_rhs(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_9());
+  }
+
+  // Constructor
+  Form_rhs(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_9());
+  }
+
+  // Constructor
+  Form_rhs(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_9());
+  }
+
+  // Destructor
+  ~Form_rhs()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_rhs_FunctionSpace_0 TestSpace;
+  typedef Form_rhs_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_rhs_FunctionSpace_2 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+};
+
+typedef CoefficientSpace___discrete_primal_solution Form_goal_FunctionSpace_0;
+
+class Form_goal: public dolfin::GoalFunctional
+{
+public:
+
+  // Constructor
+  Form_goal(const dolfin::Mesh& mesh):
+    dolfin::GoalFunctional(0, 1), __discrete_primal_solution(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_10());
+  }
+
+  // Constructor
+  Form_goal(const dolfin::Mesh& mesh, const dolfin::GenericFunction& __discrete_primal_solution):
+    dolfin::GoalFunctional(0, 1), __discrete_primal_solution(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->__discrete_primal_solution = __discrete_primal_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_10());
+  }
+
+  // Constructor
+  Form_goal(const dolfin::Mesh& mesh, std::shared_ptr<const dolfin::GenericFunction> __discrete_primal_solution):
+    dolfin::GoalFunctional(0, 1), __discrete_primal_solution(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->__discrete_primal_solution = *__discrete_primal_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_10());
+  }
+
+  // Constructor
+  Form_goal(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::GoalFunctional(0, 1), __discrete_primal_solution(*this, 0)
+  {
+    _mesh = mesh;
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_10());
+  }
+
+  // Constructor
+  Form_goal(std::shared_ptr<const dolfin::Mesh> mesh, const dolfin::GenericFunction& __discrete_primal_solution):
+    dolfin::GoalFunctional(0, 1), __discrete_primal_solution(*this, 0)
+  {
+    _mesh = mesh;
+    this->__discrete_primal_solution = __discrete_primal_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_10());
+  }
+
+  // Constructor
+  Form_goal(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::GenericFunction> __discrete_primal_solution):
+    dolfin::GoalFunctional(0, 1), __discrete_primal_solution(*this, 0)
+  {
+    _mesh = mesh;
+    this->__discrete_primal_solution = *__discrete_primal_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivepoisson_form_10());
+  }
+
+  // Destructor
+  ~Form_goal()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "__discrete_primal_solution")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class GoalFunctional",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "__discrete_primal_solution";
+    }
+
+    dolfin::dolfin_error("generated code for class GoalFunctional",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_goal_FunctionSpace_0 CoefficientSpace___discrete_primal_solution;
+
+  // Coefficients
+  dolfin::CoefficientAssigner __discrete_primal_solution;
+
+  /// Initialize all error control forms, attach coefficients and
+  /// (re-)set error control
+  virtual void update_ec(const dolfin::Form& a, const dolfin::Form& L)
+  {
+    // This stuff is created here and shipped elsewhere
+    std::shared_ptr<dolfin::Form> a_star;           // Dual lhs
+    std::shared_ptr<dolfin::Form> L_star;           // Dual rhs
+    std::shared_ptr<dolfin::FunctionSpace> V_Ez_h;  // Extrapolation space
+    std::shared_ptr<dolfin::Function> Ez_h;         // Extrapolated dual
+    std::shared_ptr<dolfin::Form> residual;         // Residual (as functional)
+    std::shared_ptr<dolfin::FunctionSpace> V_R_T;   // Trial space for cell residual
+    std::shared_ptr<dolfin::Form> a_R_T;            // Cell residual lhs
+    std::shared_ptr<dolfin::Form> L_R_T;            // Cell residual rhs
+    std::shared_ptr<dolfin::FunctionSpace> V_b_T;   // Function space for cell bubble
+    std::shared_ptr<dolfin::Function> b_T;          // Cell bubble
+    std::shared_ptr<dolfin::FunctionSpace> V_R_dT;  // Trial space for facet residual
+    std::shared_ptr<dolfin::Form> a_R_dT;           // Facet residual lhs
+    std::shared_ptr<dolfin::Form> L_R_dT;           // Facet residual rhs
+    std::shared_ptr<dolfin::FunctionSpace> V_b_e;   // Function space for cell cone
+    std::shared_ptr<dolfin::Function> b_e;          // Cell cone
+    std::shared_ptr<dolfin::FunctionSpace> V_eta_T; // Function space for indicators
+    std::shared_ptr<dolfin::Form> eta_T;            // Indicator form
+
+    // Some handy views
+    const dolfin::FunctionSpace& Vhat(*(a.function_space(0))); // Primal test
+    const dolfin::FunctionSpace& V(*(a.function_space(1)));    // Primal trial
+    assert(V.mesh());
+    const dolfin::Mesh& mesh(*V.mesh());
+    std::string name;
+
+    // Initialize dual forms
+    a_star.reset(new Form_0(V, Vhat));
+    L_star.reset(new Form_1(V));
+
+    
+    // Attach coefficients from a to a_star
+    for (std::size_t i = 0; i < a.num_coefficients(); i++)
+    {
+      name = a.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether a_star has coefficient named 'name'
+      try {
+        a_star->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to a_star";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      a_star->set_coefficient(name, a.coefficient(i));
+    }
+    
+    // Attach subdomains from a to a_star
+    a_star->dx = a.cell_domains();
+    a_star->ds = a.exterior_facet_domains();
+    a_star->dS = a.interior_facet_domains();
+
+    
+    // Attach coefficients from (*this) to L_star
+    for (std::size_t i = 0; i < (*this).num_coefficients(); i++)
+    {
+      name = (*this).coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_star has coefficient named 'name'
+      try {
+        L_star->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_star";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_star->set_coefficient(name, (*this).coefficient(i));
+    }
+    
+    // Attach subdomains from (*this) to L_star
+    L_star->dx = (*this).cell_domains();
+    L_star->ds = (*this).exterior_facet_domains();
+    L_star->dS = (*this).interior_facet_domains();
+
+
+    // Initialize residual
+    residual.reset(new Form_2(mesh));
+    
+    // Attach coefficients from a to residual
+    for (std::size_t i = 0; i < a.num_coefficients(); i++)
+    {
+      name = a.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether residual has coefficient named 'name'
+      try {
+        residual->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to residual";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      residual->set_coefficient(name, a.coefficient(i));
+    }
+    
+
+    // Attach coefficients from L to residual
+    for (std::size_t i = 0; i < L.num_coefficients(); i++)
+    {
+      name = L.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether residual has coefficient named 'name'
+      try {
+        residual->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to residual";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      residual->set_coefficient(name, L.coefficient(i));
+    }
+    
+    // Attach subdomains from L to residual
+    residual->dx = L.cell_domains();
+    residual->ds = L.exterior_facet_domains();
+    residual->dS = L.interior_facet_domains();
+
+
+    // Initialize extrapolation space and (fake) extrapolation
+    V_Ez_h.reset(new CoefficientSpace___improved_dual(mesh));
+    Ez_h.reset(new dolfin::Function(V_Ez_h));
+    residual->set_coefficient("__improved_dual", Ez_h);
+
+    // Create bilinear and linear form for computing cell residual R_T
+    V_R_T.reset(new Form_4::TestSpace(mesh));
+    a_R_T.reset(new Form_3(V_R_T, V_R_T));
+    L_R_T.reset(new Form_4(V_R_T));
+
+    // Initialize bubble and attach to a_R_T and L_R_T
+    V_b_T.reset(new CoefficientSpace___cell_bubble(mesh));
+    b_T.reset(new dolfin::Function(V_b_T));
+    *b_T->vector() = 1.0;
+    
+    // Attach coefficients from a to L_R_T
+    for (std::size_t i = 0; i < a.num_coefficients(); i++)
+    {
+      name = a.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_R_T has coefficient named 'name'
+      try {
+        L_R_T->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_R_T";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_R_T->set_coefficient(name, a.coefficient(i));
+    }
+    
+
+    // Attach coefficients from L to L_R_T
+    for (std::size_t i = 0; i < L.num_coefficients(); i++)
+    {
+      name = L.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_R_T has coefficient named 'name'
+      try {
+        L_R_T->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_R_T";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_R_T->set_coefficient(name, L.coefficient(i));
+    }
+    
+    // Attach subdomains from L to L_R_T
+    L_R_T->dx = L.cell_domains();
+    L_R_T->ds = L.exterior_facet_domains();
+    L_R_T->dS = L.interior_facet_domains();
+
+
+    // Attach bubble function to _a_R_T and _L_R_T
+    a_R_T->set_coefficient("__cell_bubble", b_T);
+    L_R_T->set_coefficient("__cell_bubble", b_T);
+
+    // Create bilinear and linear form for computing facet residual R_dT
+    V_R_dT.reset(new Form_6::TestSpace(mesh));
+    a_R_dT.reset(new Form_5(V_R_dT, V_R_dT));
+    L_R_dT.reset(new Form_6(V_R_dT));
+    
+    // Attach coefficients from a to L_R_dT
+    for (std::size_t i = 0; i < a.num_coefficients(); i++)
+    {
+      name = a.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_R_dT has coefficient named 'name'
+      try {
+        L_R_dT->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_R_dT";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_R_dT->set_coefficient(name, a.coefficient(i));
+    }
+    
+
+    // Attach coefficients from L to L_R_dT
+    for (std::size_t i = 0; i < L.num_coefficients(); i++)
+    {
+      name = L.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_R_dT has coefficient named 'name'
+      try {
+        L_R_dT->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_R_dT";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_R_dT->set_coefficient(name, L.coefficient(i));
+    }
+    
+    // Attach subdomains from L to L_R_dT
+    L_R_dT->dx = L.cell_domains();
+    L_R_dT->ds = L.exterior_facet_domains();
+    L_R_dT->dS = L.interior_facet_domains();
+
+
+    // Initialize (fake) cone and attach to a_R_dT and L_R_dT
+    V_b_e.reset(new CoefficientSpace___cell_cone(mesh));
+    b_e.reset(new dolfin::Function(V_b_e));
+    a_R_dT->set_coefficient("__cell_cone", b_e);
+    L_R_dT->set_coefficient("__cell_cone", b_e);
+
+    // Create error indicator form
+    V_eta_T.reset(new Form_7::TestSpace(mesh));
+    eta_T.reset(new Form_7(V_eta_T));
+
+    // Update error control
+    _ec.reset(new dolfin::ErrorControl(a_star, L_star, residual,
+                                       a_R_T, L_R_T, a_R_dT, L_R_dT, eta_T,
+                                       true));
+
+  }
+
+};
+
+// Class typedefs
+typedef Form_lhs BilinearForm;
+typedef Form_rhs LinearForm;
+typedef Form_goal GoalFunctional;
+
+}
+
+#endif
diff --git a/demo/documented/auto-adaptive-poisson/cpp/AdaptivePoisson.ufl b/demo/documented/auto-adaptive-poisson/cpp/AdaptivePoisson.ufl
new file mode 100644
index 0000000..ddd2ace
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/cpp/AdaptivePoisson.ufl
@@ -0,0 +1,32 @@
+# Copyright (C) 2010 Anders Logg and Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-08-19
+# Last changed: 2012-12-05
+#
+# Compile this with: ffc -l dolfin -e AdaptivePoisson.ufl
+
+element = FiniteElement("CG", triangle, 1)
+u = TrialFunction(element)
+v = TestFunction(element)
+
+f = Coefficient(element)
+g = Coefficient(element)
+
+a = dot(grad(u), grad(v))*dx()
+L = f*v*dx() + g*v*ds()
+M = u*dx()
diff --git a/demo/documented/auto-adaptive-poisson/cpp/CMakeLists.txt b/demo/documented/auto-adaptive-poisson/cpp/CMakeLists.txt
new file mode 100644
index 0000000..fbd5787
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_auto-adaptive-poisson)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/auto-adaptive-poisson/cpp/compile.log b/demo/documented/auto-adaptive-poisson/cpp/compile.log
new file mode 100644
index 0000000..a471b5e
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/cpp/compile.log
@@ -0,0 +1,3326 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form AdaptivePoisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 1
+  quadrature_degree: auto --> 1
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   0
+  Arguments:              '[]'
+  Argument names:         '[]'
+  Number of coefficients: 4
+  Coefficients:           '[w_0, w_1, w_2, w_3]'
+  Coefficient names:      '[f, g, __discrete_primal_solution, __improved_dual]'
+  Unique elements:        'CG1(?), CG2(?)'
+  Unique sub elements:    'CG1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 1
+  Coefficients:           '[w_4]'
+  Coefficient names:      '[__cell_bubble]'
+  Unique elements:        'DG1(?), B3(?)'
+  Unique sub elements:    'DG1(?), B3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 4
+  Coefficients:           '[w_0, w_1, w_2, w_4]'
+  Coefficient names:      '[f, g, __discrete_primal_solution, __cell_bubble]'
+  Unique elements:        'DG1(?), CG1(?), B3(?)'
+  Unique sub elements:    'DG1(?), CG1(?), B3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 1
+  Coefficients:           '[w_6]'
+  Coefficient names:      '[__cell_cone]'
+  Unique elements:        'DG1(?), DG2(?)'
+  Unique sub elements:    'DG1(?), DG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 5
+  Coefficients:           '[w_0, w_1, w_2, w_5, w_6]'
+  Coefficient names:      '[f, g, __discrete_primal_solution, __cell_residual, __cel
+                          l_cone]'
+  Unique elements:        'DG1(?), CG1(?), DG2(?)'
+  Unique sub elements:    'DG1(?), CG1(?), DG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 4
+  Coefficients:           '[w_3, w_5, w_7, w_8]'
+  Coefficient names:      '[__improved_dual, __cell_residual, __facet_residual, __di
+                          screte_dual_solution]'
+  Unique elements:        'DG0(?), CG2(?), DG1(?), CG1(?)'
+  Unique sub elements:    'DG0(?), CG2(?), DG1(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  
+  Name:                   'lhs'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'rhs'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, g]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'goal'
+  Geometric dimension:    2
+  Rank:                   0
+  Arguments:              '[]'
+  Argument names:         '[]'
+  Number of coefficients: 1
+  Coefficients:           '[w_2]'
+  Coefficient names:      '[__discrete_primal_solution]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 1
+  quadrature_degree: auto --> 1
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.082557 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 6 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 6 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000733 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3 entries computed in 0.000454 seconds
+  Shape of reference tensor: (3,)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {6: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 1): array([[-0.99999999999999989, -0.99999999999999989, -0.99999999999999989,
+          -0.99999999999999989, -0.99999999999999989, -0.99999999999999989],
+         [1.1102230246251565e-16, 1.1102230246251565e-16,
+          1.1102230246251565e-16, 1.1102230246251565e-16,
+          1.1102230246251565e-16, 1.1102230246251565e-16],
+         [0.99999999999999978, 0.99999999999999978, 0.99999999999999978,
+          0.99999999999999978, 0.99999999999999978, 0.99999999999999978]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.10903900907287697, 0.23193336855303098, 0.109039009072877,
+          0.65902762237409196, 0.23193336855303104, 0.65902762237409196],
+         [0.65902762237409196, 0.65902762237409196, 0.23193336855303104,
+          0.23193336855303098, 0.109039009072877, 0.10903900907287697],
+         [0.23193336855303098, 0.10903900907287697, 0.65902762237409185,
+          0.10903900907287697, 0.65902762237409185, 0.23193336855303098]], dtype=object)}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {None: {(0, 1): array([[0.56384396370849277, 0.072266525787876734, 0.56384396370849243,
+          -1.6361104894963669, 0.072266525787876068, -1.6361104894963674],
+         [8.3266726846886741e-17, -1.1102230246251565e-16,
+          -1.6653345369377348e-16, -1.1102230246251565e-16,
+          -5.5511151231257827e-17, -1.3877787807814457e-16],
+         [-0.072266525787875513, -0.56384396370849144, 1.6361104894963674,
+          -0.56384396370849144, 1.6361104894963674, -0.072266525787875735],
+         [2.6361104894963665, 2.6361104894963665, 0.92773347421212327,
+          0.92773347421212304, 0.43615603629150668, 0.43615603629150723],
+         [-0.49157743792061637, 0.49157743792061592, -2.1999544532048594,
+          2.1999544532048594, -1.7083770152842432, 1.7083770152842432],
+         [-2.6361104894963674, -2.6361104894963674, -0.92773347421212338,
+          -0.9277334742121236, -0.43615603629150701, -0.43615603629150695]], dtype=object), (1, 0): array([[0.56384396370849266, 0.072266525787876401, 0.56384396370849277,
+          -1.6361104894963672, 0.07226652578787629, -1.6361104894963676],
+         [1.6361104894963678, 1.6361104894963676, -0.072266525787876068,
+          -0.072266525787876124, -0.56384396370849255, -0.56384396370849243],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
+         [0.92773347421212327, 0.43615603629150695, 2.6361104894963661,
+          0.43615603629150695, 2.6361104894963661, 0.92773347421212327],
+         [-0.92773347421212327, -0.43615603629150695, -2.6361104894963661,
+          -0.43615603629150695, -2.6361104894963661, -0.92773347421212327],
+         [-2.1999544532048607, -1.7083770152842441, -0.49157743792061698,
+          1.7083770152842432, 0.49157743792061592, 2.1999544532048598]], dtype=object), (0, 0): array([[-0.08525999807368706, -0.12434719365631873, -0.085259998073687046,
+          0.20960719173000564, -0.12434719365631869, 0.20960719173000567],
+         [0.20960719173000553, 0.20960719173000553, -0.12434719365631877,
+          -0.12434719365631874, -0.08525999807368706, -0.08525999807368706],
+         [-0.1243471936563187, -0.08525999807368706, 0.20960719173000567,
+          -0.08525999807368706, 0.20960719173000567, -0.1243471936563187],
+         [0.61140198570687188, 0.28743887558130055, 0.61140198570687188,
+          0.10115913871182745, 0.28743887558130055, 0.10115913871182744],
+         [0.10115913871182744, 0.10115913871182741, 0.2874388755813006,
+          0.28743887558130055, 0.61140198570687199, 0.61140198570687188],
+         [0.28743887558130055, 0.61140198570687199, 0.10115913871182744,
+          0.61140198570687199, 0.10115913871182744, 0.28743887558130055]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.11022302e-16,   1.11022302e-16,   1.11022302e-16,
+             1.11022302e-16,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.11022302e-16,   1.11022302e-16,   1.11022302e-16,
+             1.11022302e-16,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.10903901,  0.23193337,  0.10903901,  0.65902762,  0.23193337,
+            0.65902762],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.65902762,  0.65902762,  0.23193337,  0.23193337,  0.10903901,
+            0.10903901],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.23193337,  0.10903901,  0.65902762,  0.10903901,  0.65902762,
+            0.23193337],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.10903901,  0.23193337,  0.10903901,  0.65902762,  0.23193337,
+            0.65902762]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.65902762,  0.65902762,  0.23193337,  0.23193337,  0.10903901,
+            0.10903901]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.23193337,  0.10903901,  0.65902762,  0.10903901,  0.65902762,
+            0.23193337]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE0_D01': array([[-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978]], dtype=object), 'FE2_C0_D01': array([[ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.10903901,  0.65902762,
+           0.23193337],
+         [ 0.        ,  0.        ,  0.        ,  0.23193337,  0.65902762,
+           0.10903901],
+         [ 0.        ,  0.        ,  0.        ,  0.10903901,  0.23193337,
+           0.65902762],
+         [ 0.        ,  0.        ,  0.        ,  0.65902762,  0.23193337,
+           0.10903901],
+         [ 0.        ,  0.        ,  0.        ,  0.23193337,  0.10903901,
+           0.65902762],
+         [ 0.        ,  0.        ,  0.        ,  0.65902762,  0.10903901,
+           0.23193337]]), 'FE2_C0': array([[ 0.10903901,  0.65902762,  0.23193337,  0.        ,  0.        ,
+           0.        ],
+         [ 0.23193337,  0.65902762,  0.10903901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10903901,  0.23193337,  0.65902762,  0.        ,  0.        ,
+           0.        ],
+         [ 0.65902762,  0.23193337,  0.10903901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.23193337,  0.10903901,  0.65902762,  0.        ,  0.        ,
+           0.        ],
+         [ 0.65902762,  0.10903901,  0.23193337,  0.        ,  0.        ,
+           0.        ]]), 'FE1_D01': array([[0.56384396370849277, 8.3266726846886741e-17, -0.072266525787875513,
+          2.6361104894963665, -0.49157743792061637, -2.6361104894963674],
+         [0.072266525787876734, -1.1102230246251565e-16,
+          -0.56384396370849144, 2.6361104894963665, 0.49157743792061592,
+          -2.6361104894963674],
+         [0.56384396370849243, -1.6653345369377348e-16, 1.6361104894963674,
+          0.92773347421212327, -2.1999544532048594, -0.92773347421212338],
+         [-1.6361104894963669, -1.1102230246251565e-16, -0.56384396370849144,
+          0.92773347421212304, 2.1999544532048594, -0.9277334742121236],
+         [0.072266525787876068, -5.5511151231257827e-17, 1.6361104894963674,
+          0.43615603629150668, -1.7083770152842432, -0.43615603629150701],
+         [-1.6361104894963674, -1.3877787807814457e-16,
+          -0.072266525787875735, 0.43615603629150723, 1.7083770152842432,
+          -0.43615603629150695]], dtype=object), 'FE1_D10': array([[0.56384396370849266, 1.6361104894963678, 0.0, 0.92773347421212327,
+          -0.92773347421212327, -2.1999544532048607],
+         [0.072266525787876401, 1.6361104894963676, 0.0, 0.43615603629150695,
+          -0.43615603629150695, -1.7083770152842441],
+         [0.56384396370849277, -0.072266525787876068, 0.0,
+          2.6361104894963661, -2.6361104894963661, -0.49157743792061698],
+         [-1.6361104894963672, -0.072266525787876124, 0.0,
+          0.43615603629150695, -0.43615603629150695, 1.7083770152842432],
+         [0.07226652578787629, -0.56384396370849255, 0.0, 2.6361104894963661,
+          -2.6361104894963661, 0.49157743792061592],
+         [-1.6361104894963676, -0.56384396370849243, 0.0,
+          0.92773347421212327, -0.92773347421212327, 2.1999544532048598]], dtype=object), 'FE0': array([[0.10903900907287697, 0.65902762237409196, 0.23193336855303098],
+         [0.23193336855303098, 0.65902762237409196, 0.10903900907287697],
+         [0.109039009072877, 0.23193336855303104, 0.65902762237409185],
+         [0.65902762237409196, 0.23193336855303098, 0.10903900907287697],
+         [0.23193336855303104, 0.109039009072877, 0.65902762237409185],
+         [0.65902762237409196, 0.10903900907287697, 0.23193336855303098]], dtype=object), 'FE1': array([[-0.08525999807368706, 0.20960719173000553, -0.1243471936563187,
+          0.61140198570687188, 0.10115913871182744, 0.28743887558130055],
+         [-0.12434719365631873, 0.20960719173000553, -0.08525999807368706,
+          0.28743887558130055, 0.10115913871182741, 0.61140198570687199],
+         [-0.085259998073687046, -0.12434719365631877, 0.20960719173000567,
+          0.61140198570687188, 0.2874388755813006, 0.10115913871182744],
+         [0.20960719173000564, -0.12434719365631874, -0.08525999807368706,
+          0.10115913871182745, 0.28743887558130055, 0.61140198570687199],
+         [-0.12434719365631869, -0.08525999807368706, 0.20960719173000567,
+          0.28743887558130055, 0.61140198570687199, 0.10115913871182744],
+         [0.20960719173000567, -0.08525999807368706, -0.1243471936563187,
+          0.10115913871182744, 0.61140198570687188, 0.28743887558130055]], dtype=object)}
+  
+  tables: {'FE0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE0_D01': array([[-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978]], dtype=object), 'FE2_C0_D01': array([[ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.10903901,  0.65902762,
+           0.23193337],
+         [ 0.        ,  0.        ,  0.        ,  0.23193337,  0.65902762,
+           0.10903901],
+         [ 0.        ,  0.        ,  0.        ,  0.10903901,  0.23193337,
+           0.65902762],
+         [ 0.        ,  0.        ,  0.        ,  0.65902762,  0.23193337,
+           0.10903901],
+         [ 0.        ,  0.        ,  0.        ,  0.23193337,  0.10903901,
+           0.65902762],
+         [ 0.        ,  0.        ,  0.        ,  0.65902762,  0.10903901,
+           0.23193337]]), 'FE2_C0': array([[ 0.10903901,  0.65902762,  0.23193337,  0.        ,  0.        ,
+           0.        ],
+         [ 0.23193337,  0.65902762,  0.10903901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10903901,  0.23193337,  0.65902762,  0.        ,  0.        ,
+           0.        ],
+         [ 0.65902762,  0.23193337,  0.10903901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.23193337,  0.10903901,  0.65902762,  0.        ,  0.        ,
+           0.        ],
+         [ 0.65902762,  0.10903901,  0.23193337,  0.        ,  0.        ,
+           0.        ]]), 'FE1_D01': array([[0.56384396370849277, 8.3266726846886741e-17, -0.072266525787875513,
+          2.6361104894963665, -0.49157743792061637, -2.6361104894963674],
+         [0.072266525787876734, -1.1102230246251565e-16,
+          -0.56384396370849144, 2.6361104894963665, 0.49157743792061592,
+          -2.6361104894963674],
+         [0.56384396370849243, -1.6653345369377348e-16, 1.6361104894963674,
+          0.92773347421212327, -2.1999544532048594, -0.92773347421212338],
+         [-1.6361104894963669, -1.1102230246251565e-16, -0.56384396370849144,
+          0.92773347421212304, 2.1999544532048594, -0.9277334742121236],
+         [0.072266525787876068, -5.5511151231257827e-17, 1.6361104894963674,
+          0.43615603629150668, -1.7083770152842432, -0.43615603629150701],
+         [-1.6361104894963674, -1.3877787807814457e-16,
+          -0.072266525787875735, 0.43615603629150723, 1.7083770152842432,
+          -0.43615603629150695]], dtype=object), 'FE1_D10': array([[0.56384396370849266, 1.6361104894963678, 0.0, 0.92773347421212327,
+          -0.92773347421212327, -2.1999544532048607],
+         [0.072266525787876401, 1.6361104894963676, 0.0, 0.43615603629150695,
+          -0.43615603629150695, -1.7083770152842441],
+         [0.56384396370849277, -0.072266525787876068, 0.0,
+          2.6361104894963661, -2.6361104894963661, -0.49157743792061698],
+         [-1.6361104894963672, -0.072266525787876124, 0.0,
+          0.43615603629150695, -0.43615603629150695, 1.7083770152842432],
+         [0.07226652578787629, -0.56384396370849255, 0.0, 2.6361104894963661,
+          -2.6361104894963661, 0.49157743792061592],
+         [-1.6361104894963676, -0.56384396370849243, 0.0,
+          0.92773347421212327, -0.92773347421212327, 2.1999544532048598]], dtype=object), 'FE0': array([[0.10903900907287697, 0.65902762237409196, 0.23193336855303098],
+         [0.23193336855303098, 0.65902762237409196, 0.10903900907287697],
+         [0.109039009072877, 0.23193336855303104, 0.65902762237409185],
+         [0.65902762237409196, 0.23193336855303098, 0.10903900907287697],
+         [0.23193336855303104, 0.109039009072877, 0.65902762237409185],
+         [0.65902762237409196, 0.10903900907287697, 0.23193336855303098]], dtype=object), 'FE1': array([[-0.08525999807368706, 0.20960719173000553, -0.1243471936563187,
+          0.61140198570687188, 0.10115913871182744, 0.28743887558130055],
+         [-0.12434719365631873, 0.20960719173000553, -0.08525999807368706,
+          0.28743887558130055, 0.10115913871182741, 0.61140198570687199],
+         [-0.085259998073687046, -0.12434719365631877, 0.20960719173000567,
+          0.61140198570687188, 0.2874388755813006, 0.10115913871182744],
+         [0.20960719173000564, -0.12434719365631874, -0.08525999807368706,
+          0.10115913871182745, 0.28743887558130055, 0.61140198570687199],
+         [-0.12434719365631869, -0.08525999807368706, 0.20960719173000567,
+          0.28743887558130055, 0.61140198570687199, 0.10115913871182744],
+         [0.20960719173000567, -0.08525999807368706, -0.1243471936563187,
+          0.10115913871182744, 0.61140198570687188, 0.28743887558130055]], dtype=object)}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE2_C1_D01': 'FE2_C1_D01', 'FE0_D01': 'FE0_D01', 'FE2_C0': 'FE2_C0', 'FE1': 'FE1', 'FE2_C1_D10': 'FE2_C1_D10', 'FE2_C1': 'FE2_C1', 'FE2_C0_D01': 'FE2_C0_D01', 'FE1_D01': 'FE1_D01', 'FE1_D10': 'FE1_D10', 'FE0': 'FE0', 'FE2_C0_D10': 'FE2_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D01': array([[-0.99999999999999989, 0.99999999999999978],
+         [-0.99999999999999989, 0.99999999999999978],
+         [-0.99999999999999989, 0.99999999999999978],
+         [-0.99999999999999989, 0.99999999999999978],
+         [-0.99999999999999989, 0.99999999999999978],
+         [-0.99999999999999989, 0.99999999999999978]], dtype=object), 'FE1_D01': array([[0.56384396370849277, -0.072266525787875513, 2.6361104894963665,
+          -0.49157743792061637, -2.6361104894963674],
+         [0.072266525787876734, -0.56384396370849144, 2.6361104894963665,
+          0.49157743792061592, -2.6361104894963674],
+         [0.56384396370849243, 1.6361104894963674, 0.92773347421212327,
+          -2.1999544532048594, -0.92773347421212338],
+         [-1.6361104894963669, -0.56384396370849144, 0.92773347421212304,
+          2.1999544532048594, -0.9277334742121236],
+         [0.072266525787876068, 1.6361104894963674, 0.43615603629150668,
+          -1.7083770152842432, -0.43615603629150701],
+         [-1.6361104894963674, -0.072266525787875735, 0.43615603629150723,
+          1.7083770152842432, -0.43615603629150695]], dtype=object), 'FE1_D10': array([[0.56384396370849266, 1.6361104894963678, 0.92773347421212327,
+          -0.92773347421212327, -2.1999544532048607],
+         [0.072266525787876401, 1.6361104894963676, 0.43615603629150695,
+          -0.43615603629150695, -1.7083770152842441],
+         [0.56384396370849277, -0.072266525787876068, 2.6361104894963661,
+          -2.6361104894963661, -0.49157743792061698],
+         [-1.6361104894963672, -0.072266525787876124, 0.43615603629150695,
+          -0.43615603629150695, 1.7083770152842432],
+         [0.07226652578787629, -0.56384396370849255, 2.6361104894963661,
+          -2.6361104894963661, 0.49157743792061592],
+         [-1.6361104894963676, -0.56384396370849243, 0.92773347421212327,
+          -0.92773347421212327, 2.1999544532048598]], dtype=object), 'FE0': array([[0.10903900907287697, 0.65902762237409196, 0.23193336855303098],
+         [0.23193336855303098, 0.65902762237409196, 0.10903900907287697],
+         [0.109039009072877, 0.23193336855303104, 0.65902762237409185],
+         [0.65902762237409196, 0.23193336855303098, 0.10903900907287697],
+         [0.23193336855303104, 0.109039009072877, 0.65902762237409185],
+         [0.65902762237409196, 0.10903900907287697, 0.23193336855303098]], dtype=object), 'FE1': array([[-0.08525999807368706, 0.20960719173000553, -0.1243471936563187,
+          0.61140198570687188, 0.10115913871182744, 0.28743887558130055],
+         [-0.12434719365631873, 0.20960719173000553, -0.08525999807368706,
+          0.28743887558130055, 0.10115913871182741, 0.61140198570687199],
+         [-0.085259998073687046, -0.12434719365631877, 0.20960719173000567,
+          0.61140198570687188, 0.2874388755813006, 0.10115913871182744],
+         [0.20960719173000564, -0.12434719365631874, -0.08525999807368706,
+          0.10115913871182745, 0.28743887558130055, 0.61140198570687199],
+         [-0.12434719365631869, -0.08525999807368706, 0.20960719173000567,
+          0.28743887558130055, 0.61140198570687199, 0.10115913871182744],
+         [0.20960719173000567, -0.08525999807368706, -0.1243471936563187,
+          0.10115913871182744, 0.61140198570687188, 0.28743887558130055]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D01', (1, [0, 1]), False, False), 'FE2_C1_D01': ('FE0_D01', (8, [3, 5]), False, False), 'FE0_D01': ('FE0_D01', (0, [0, 2]), False, False), 'FE2_C0': ('FE0', (4, [0, 1, 2]), False, False), 'FE1': ('FE1', (), False, False), 'FE2_C1_D10': ('FE0_D01', (9, [3, 4]), False, False), 'FE2_C1': ('FE0', (7, [3, 4, 5]), False, False), 'FE2_C0_D01': ('FE0_D01', (5, [0, 2]), False, False), 'FE1_D01': ('FE1_D01', (2, [0, 2, 3, 4, 5]), False, False), 'FE1_D10': ('FE1_D10', (3, [0, 1, 3, 4, 5]), False, False), 'FE0': ('FE0', (), False, False), 'FE2_C0_D10': ('FE0_D01', (6, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00196 seconds
+  Shape of reference tensor: (3, 6)
+  Primary multi index:   rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00165 seconds
+  Shape of reference tensor: (3, 6)
+  Primary multi index:   rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00159 seconds
+  Shape of reference tensor: (3, 6)
+  Primary multi index:   rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00253 seconds
+  Shape of reference tensor: (3, 3, 1)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [1] indices = [[0]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [1] indices = [[0]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {7: {FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 1): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.33333333333333337, 0.10128650732345648, 0.10128650732345651,
+          0.79742698535308731, 0.47014206410511522, 0.47014206410511522,
+          0.059715871789769934],
+         [0.33333333333333337, 0.7974269853530872, 0.1012865073234564,
+          0.10128650732345637, 0.059715871789769795, 0.47014206410511511,
+          0.47014206410511511],
+         [0.33333333333333331, 0.10128650732345634, 0.79742698535308709,
+          0.10128650732345634, 0.47014206410511505, 0.059715871789769726,
+          0.47014206410511505]], dtype=object)}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 1): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.33333333333333337, 0.10128650732345648, 0.10128650732345651,
+          0.79742698535308731, 0.47014206410511522, 0.47014206410511522,
+          0.059715871789769934],
+         [0.33333333333333337, 0.7974269853530872, 0.1012865073234564,
+          0.10128650732345637, 0.059715871789769795, 0.47014206410511511,
+          0.47014206410511511],
+         [0.33333333333333331, 0.10128650732345634, 0.79742698535308709,
+          0.10128650732345634, 0.47014206410511505, 0.059715871789769726,
+          0.47014206410511505]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.33333333,  0.10128651,  0.10128651,  0.79742699,  0.47014206,
+            0.47014206,  0.05971587],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.33333333,  0.79742699,  0.10128651,  0.10128651,  0.05971587,
+            0.47014206,  0.47014206],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.33333333,  0.10128651,  0.79742699,  0.10128651,  0.47014206,
+            0.05971587,  0.47014206],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.10128651,  0.10128651,  0.79742699,  0.47014206,
+            0.47014206,  0.05971587]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.79742699,  0.10128651,  0.10128651,  0.05971587,
+            0.47014206,  0.47014206]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.10128651,  0.79742699,  0.10128651,  0.47014206,
+            0.05971587,  0.47014206]]])}}}, FiniteElement('Bubble', Domain(Cell('triangle', 2), label=None, data=None), 3, quad_scheme=None): {None: {None: {(0, 1): array([[-1.1102230246251565e-16, 3.6637359812630166e-15,
+          -1.9037602159047706, 1.9037602159047724, -2.2204460492503131e-16,
+          5.2098826648843648, -5.2098826648843612]], dtype=object), (1, 0): array([[3.4373799093713836e-16, -1.9037602159047682,
+          3.9672666806617637e-15, 1.9037602159047715, 5.2098826648843648,
+          2.1527793290222102e-18, -5.2098826648843577]], dtype=object), (0, 0): array([[1.0000000000000002, 0.22088075779229027, 0.22088075779229013,
+          0.22088075779229016, 0.35637871742636851, 0.35637871742636862,
+          0.35637871742636917]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[3.4373799093713836e-16],
+         [-1.9037602159047682],
+         [3.9672666806617637e-15],
+         [1.9037602159047715],
+         [5.2098826648843648],
+         [2.1527793290222102e-18],
+         [-5.2098826648843577]], dtype=object), 'FE0_D01': array([[-1.1102230246251565e-16],
+         [3.6637359812630166e-15],
+         [-1.9037602159047706],
+         [1.9037602159047724],
+         [-2.2204460492503131e-16],
+         [5.2098826648843648],
+         [-5.2098826648843612]], dtype=object), 'FE3_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE3_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE3_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.79742699,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.10128651,  0.79742699,  0.        ,  0.        ,
+           0.        ],
+         [ 0.79742699,  0.10128651,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.05971587,  0.47014206,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.47014206,  0.05971587,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05971587,  0.47014206,  0.47014206,  0.        ,  0.        ,
+           0.        ]]), 'FE3_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.79742699,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.10128651,
+           0.79742699],
+         [ 0.        ,  0.        ,  0.        ,  0.79742699,  0.10128651,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.05971587,
+           0.47014206],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.47014206,
+           0.05971587],
+         [ 0.        ,  0.        ,  0.        ,  0.05971587,  0.47014206,
+           0.47014206]]), 'FE3_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE2': array([[0.33333333333333337, 0.33333333333333337, 0.33333333333333331],
+         [0.10128650732345648, 0.7974269853530872, 0.10128650732345634],
+         [0.10128650732345651, 0.1012865073234564, 0.79742698535308709],
+         [0.79742698535308731, 0.10128650732345637, 0.10128650732345634],
+         [0.47014206410511522, 0.059715871789769795, 0.47014206410511505],
+         [0.47014206410511522, 0.47014206410511511, 0.059715871789769726],
+         [0.059715871789769934, 0.47014206410511511, 0.47014206410511505]], dtype=object), 'FE1_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0': array([[1.0000000000000002],
+         [0.22088075779229027],
+         [0.22088075779229013],
+         [0.22088075779229016],
+         [0.35637871742636851],
+         [0.35637871742636862],
+         [0.35637871742636917]], dtype=object), 'FE1': array([[0.33333333333333337, 0.33333333333333337, 0.33333333333333331],
+         [0.10128650732345648, 0.7974269853530872, 0.10128650732345634],
+         [0.10128650732345651, 0.1012865073234564, 0.79742698535308709],
+         [0.79742698535308731, 0.10128650732345637, 0.10128650732345634],
+         [0.47014206410511522, 0.059715871789769795, 0.47014206410511505],
+         [0.47014206410511522, 0.47014206410511511, 0.059715871789769726],
+         [0.059715871789769934, 0.47014206410511511, 0.47014206410511505]], dtype=object), 'FE2_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE2_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE3_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]])}
+  
+  tables: {'FE0_D10': array([[3.4373799093713836e-16],
+         [-1.9037602159047682],
+         [3.9672666806617637e-15],
+         [1.9037602159047715],
+         [5.2098826648843648],
+         [2.1527793290222102e-18],
+         [-5.2098826648843577]], dtype=object), 'FE0_D01': array([[-1.1102230246251565e-16],
+         [3.6637359812630166e-15],
+         [-1.9037602159047706],
+         [1.9037602159047724],
+         [-2.2204460492503131e-16],
+         [5.2098826648843648],
+         [-5.2098826648843612]], dtype=object), 'FE3_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE3_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE3_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.79742699,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.10128651,  0.79742699,  0.        ,  0.        ,
+           0.        ],
+         [ 0.79742699,  0.10128651,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.05971587,  0.47014206,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.47014206,  0.05971587,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05971587,  0.47014206,  0.47014206,  0.        ,  0.        ,
+           0.        ]]), 'FE3_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.79742699,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.10128651,
+           0.79742699],
+         [ 0.        ,  0.        ,  0.        ,  0.79742699,  0.10128651,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.05971587,
+           0.47014206],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.47014206,
+           0.05971587],
+         [ 0.        ,  0.        ,  0.        ,  0.05971587,  0.47014206,
+           0.47014206]]), 'FE3_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0': array([[1.0000000000000002],
+         [0.22088075779229027],
+         [0.22088075779229013],
+         [0.22088075779229016],
+         [0.35637871742636851],
+         [0.35637871742636862],
+         [0.35637871742636917]], dtype=object), 'FE1': array([[0.33333333333333337, 0.33333333333333337, 0.33333333333333331],
+         [0.10128650732345648, 0.7974269853530872, 0.10128650732345634],
+         [0.10128650732345651, 0.1012865073234564, 0.79742698535308709],
+         [0.79742698535308731, 0.10128650732345637, 0.10128650732345634],
+         [0.47014206410511522, 0.059715871789769795, 0.47014206410511505],
+         [0.47014206410511522, 0.47014206410511511, 0.059715871789769726],
+         [0.059715871789769934, 0.47014206410511511, 0.47014206410511505]], dtype=object), 'FE3_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]])}
+  
+  name_map: {'FE1_D01': ['FE2_D01'], 'FE1_D10': ['FE2_D10'], 'FE1': ['FE2']}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE0_D01': 'FE0_D01', 'FE0': 'FE0', 'FE3_C1_D01': 'FE3_C1_D01', 'FE3_C0': 'FE3_C0', 'FE3_C1': 'FE3_C1', 'FE3_C0_D10': 'FE3_C0_D10', 'FE1_D01': 'FE1_D01', 'FE2': 'FE1', 'FE1_D10': 'FE1_D10', 'FE3_C0_D01': 'FE3_C0_D01', 'FE1': 'FE1', 'FE2_D10': 'FE1_D10', 'FE2_D01': 'FE1_D01', 'FE3_C1_D10': 'FE3_C1_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D10': array([[0],
+         [-1.9037602159047682],
+         [0],
+         [1.9037602159047715],
+         [5.2098826648843648],
+         [0],
+         [-5.2098826648843577]], dtype=object), 'FE0_D01': array([[0],
+         [0],
+         [-1.9037602159047706],
+         [1.9037602159047724],
+         [0],
+         [5.2098826648843648],
+         [-5.2098826648843612]], dtype=object), 'FE1_D01': array([[-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0]], dtype=object), 'FE0': array([[1.0000000000000002],
+         [0.22088075779229027],
+         [0.22088075779229013],
+         [0.22088075779229016],
+         [0.35637871742636851],
+         [0.35637871742636862],
+         [0.35637871742636917]], dtype=object), 'FE1': array([[0.33333333333333337, 0.33333333333333337, 0.33333333333333331],
+         [0.10128650732345648, 0.7974269853530872, 0.10128650732345634],
+         [0.10128650732345651, 0.1012865073234564, 0.79742698535308709],
+         [0.79742698535308731, 0.10128650732345637, 0.10128650732345634],
+         [0.47014206410511522, 0.059715871789769795, 0.47014206410511505],
+         [0.47014206410511522, 0.47014206410511511, 0.059715871789769726],
+         [0.059715871789769934, 0.47014206410511511, 0.47014206410511505]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D10', (), False, False), 'FE0_D01': ('FE0_D01', (), False, False), 'FE0': ('FE0', (), False, False), 'FE3_C1_D01': ('FE1_D01', (6, [3, 5]), False, False), 'FE3_C0': ('FE1', (2, [0, 1, 2]), False, False), 'FE3_C1': ('FE1', (5, [3, 4, 5]), False, False), 'FE3_C0_D10': ('FE1_D01', (4, [0, 1]), False, False), 'FE1_D01': ('FE1_D01', (0, [0, 2]), False, False), 'FE2': ('FE1', (), False, False), 'FE1_D10': ('FE1_D01', (1, [0, 1]), False, False), 'FE3_C0_D01': ('FE1_D01', (3, [0, 2]), False, False), 'FE1': ('FE1', (), False, False), 'FE2_D10': ('FE1_D01', (1, [0, 1]), False, False), 'FE2_D01': ('FE1_D01', (0, [0, 2]), False, False), 'FE3_C1_D10': ('FE1_D01', (7, [3, 4]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00381 seconds
+  Shape of reference tensor: (3, 3, 1)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [3, 1] indices = [[0, 0], [1, 0], [2, 0]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 1] indices = [[0, 0], [1, 0], [2, 0]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00305 seconds
+  Shape of reference tensor: (3, 3, 1)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [3, 1] indices = [[0, 0], [1, 0], [2, 0]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 1] indices = [[0, 0], [1, 0], [2, 0]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00287 seconds
+  Shape of reference tensor: (3, 3, 1)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [3, 1] indices = [[0, 0], [1, 0], [2, 0]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 1] indices = [[0, 0], [1, 0], [2, 0]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00233 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00201 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00203 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00305 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00319 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.0029 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00352 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00306 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00296 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00287 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00277 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00289 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00278 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00283 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00276 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00278 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.0028 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00313 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.0029 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00284 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00264 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {6: {FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {None: {(0, 1): array([[0.63369514596092058, 0.63369514596092025, -2.2673902919218314,
+          -0.78379396366385989, -0.78379396366385934, 0.56758792732772056],
+         [2.7755575615628914e-16, -2.2204460492503131e-16,
+          -5.5511151231257827e-17, 4.8572257327350599e-17,
+          -1.1102230246251565e-16, 1.3183898417423734e-16],
+         [-0.63369514596091581, 2.2673902919218358, -0.63369514596091603,
+          0.78379396366385989, -0.56758792732771934, 0.78379396366385978],
+         [3.2673902919218341, 0.36630485403908319, 0.36630485403908319,
+          0.4324120726722791, 1.7837939636638593, 1.7837939636638589],
+         [-3.7747582837255322e-15, -2.9010854378827551, 2.9010854378827475,
+          -2.4980018054066022e-16, 1.3513818909915796, -1.3513818909915798],
+         [-3.2673902919218358, -0.36630485403908342, -0.36630485403908297,
+          -0.43241207267227899, -1.78379396366386, -1.7837939636638598]], dtype=object), (1, 0): array([[0.63369514596092014, 0.63369514596092069, -2.2673902919218323,
+          -0.78379396366385989, -0.78379396366385967, 0.56758792732772034],
+         [2.2673902919218358, -0.63369514596091625, -0.63369514596091647,
+          -0.56758792732772045, 0.78379396366386023, 0.78379396366385978],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
+         [0.36630485403908286, 3.2673902919218336, 0.36630485403908286,
+          1.7837939636638591, 0.43241207267227894, 1.7837939636638591],
+         [-0.36630485403908286, -3.2673902919218336, -0.36630485403908286,
+          -1.7837939636638591, -0.43241207267227894, -1.7837939636638591],
+         [-2.901085437882756, -4.9296699827375906e-15, 2.9010854378827484,
+          1.35138189099158, -7.6450782352261042e-16, -1.3513818909915805]], dtype=object), (0, 0): array([[-0.074803807748196033, -0.074803807748195991, 0.51763234198767138,
+          -0.048208377815511877, -0.048208377815511919, -0.084730493093977774],
+         [0.51763234198767349, -0.074803807748196616, -0.07480380774819663,
+          -0.084730493093977816, -0.048208377815511967, -0.048208377815512009],
+         [-0.074803807748196643, 0.51763234198767361, -0.074803807748196643,
+          -0.048208377815511891, -0.084730493093977843, -0.048208377815511891],
+         [0.29921523099278691, 0.29921523099278691, 0.033544811523148657,
+          0.19283351126204784, 0.19283351126204781, 0.79548022620090597],
+         [0.033544811523148282, 0.2992152309927838, 0.29921523099278657,
+          0.79548022620090597, 0.19283351126204779, 0.19283351126204784],
+         [0.2992152309927838, 0.033544811523148269, 0.29921523099278663,
+          0.19283351126204784, 0.79548022620090619, 0.19283351126204784]], dtype=object)}}}, FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 1): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.091576213509770035, 0.091576213509770077, 0.81684757298045807,
+          0.44594849091596506, 0.445948490915965, 0.10810301816807004],
+         [0.81684757298045907, 0.091576213509771076, 0.091576213509770979,
+          0.10810301816807004, 0.445948490915965, 0.44594849091596506],
+         [0.091576213509770993, 0.81684757298045896, 0.091576213509770993,
+          0.445948490915965, 0.10810301816807, 0.445948490915965]], dtype=object)}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 1): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0, 1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.091576213509770035, 0.091576213509770077, 0.81684757298045807,
+          0.44594849091596506, 0.445948490915965, 0.10810301816807004],
+         [0.81684757298045907, 0.091576213509771076, 0.091576213509770979,
+          0.10810301816807004, 0.445948490915965, 0.44594849091596506],
+         [0.091576213509770993, 0.81684757298045896, 0.091576213509770993,
+          0.445948490915965, 0.10810301816807, 0.445948490915965]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE3_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE3_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE3_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]]), 'FE3_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE3_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE2': array([[-0.074803807748196033, 0.51763234198767349, -0.074803807748196643,
+          0.29921523099278691, 0.033544811523148282, 0.2992152309927838],
+         [-0.074803807748195991, -0.074803807748196616, 0.51763234198767361,
+          0.29921523099278691, 0.2992152309927838, 0.033544811523148269],
+         [0.51763234198767138, -0.07480380774819663, -0.074803807748196643,
+          0.033544811523148657, 0.29921523099278657, 0.29921523099278663],
+         [-0.048208377815511877, -0.084730493093977816,
+          -0.048208377815511891, 0.19283351126204784, 0.79548022620090597,
+          0.19283351126204784],
+         [-0.048208377815511919, -0.048208377815511967,
+          -0.084730493093977843, 0.19283351126204781, 0.19283351126204779,
+          0.79548022620090619],
+         [-0.084730493093977774, -0.048208377815512009,
+          -0.048208377815511891, 0.79548022620090597, 0.19283351126204784,
+          0.19283351126204784]], dtype=object), 'FE1_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0': array([[0.091576213509770035, 0.81684757298045907, 0.091576213509770993],
+         [0.091576213509770077, 0.091576213509771076, 0.81684757298045896],
+         [0.81684757298045807, 0.091576213509770979, 0.091576213509770993],
+         [0.44594849091596506, 0.10810301816807004, 0.445948490915965],
+         [0.445948490915965, 0.445948490915965, 0.10810301816807],
+         [0.10810301816807004, 0.44594849091596506, 0.445948490915965]], dtype=object), 'FE1': array([[0.091576213509770035, 0.81684757298045907, 0.091576213509770993],
+         [0.091576213509770077, 0.091576213509771076, 0.81684757298045896],
+         [0.81684757298045807, 0.091576213509770979, 0.091576213509770993],
+         [0.44594849091596506, 0.10810301816807004, 0.445948490915965],
+         [0.445948490915965, 0.445948490915965, 0.10810301816807],
+         [0.10810301816807004, 0.44594849091596506, 0.445948490915965]], dtype=object), 'FE2_D10': array([[0.63369514596092014, 2.2673902919218358, 0.0, 0.36630485403908286,
+          -0.36630485403908286, -2.901085437882756],
+         [0.63369514596092069, -0.63369514596091625, 0.0, 3.2673902919218336,
+          -3.2673902919218336, -4.9296699827375906e-15],
+         [-2.2673902919218323, -0.63369514596091647, 0.0,
+          0.36630485403908286, -0.36630485403908286, 2.9010854378827484],
+         [-0.78379396366385989, -0.56758792732772045, 0.0,
+          1.7837939636638591, -1.7837939636638591, 1.35138189099158],
+         [-0.78379396366385967, 0.78379396366386023, 0.0,
+          0.43241207267227894, -0.43241207267227894, -7.6450782352261042e-16],
+         [0.56758792732772034, 0.78379396366385978, 0.0, 1.7837939636638591,
+          -1.7837939636638591, -1.3513818909915805]], dtype=object), 'FE2_D01': array([[0.63369514596092058, 2.7755575615628914e-16, -0.63369514596091581,
+          3.2673902919218341, -3.7747582837255322e-15, -3.2673902919218358],
+         [0.63369514596092025, -2.2204460492503131e-16, 2.2673902919218358,
+          0.36630485403908319, -2.9010854378827551, -0.36630485403908342],
+         [-2.2673902919218314, -5.5511151231257827e-17, -0.63369514596091603,
+          0.36630485403908319, 2.9010854378827475, -0.36630485403908297],
+         [-0.78379396366385989, 4.8572257327350599e-17, 0.78379396366385989,
+          0.4324120726722791, -2.4980018054066022e-16, -0.43241207267227899],
+         [-0.78379396366385934, -1.1102230246251565e-16,
+          -0.56758792732771934, 1.7837939636638593, 1.3513818909915796,
+          -1.78379396366386],
+         [0.56758792732772056, 1.3183898417423734e-16, 0.78379396366385978,
+          1.7837939636638589, -1.3513818909915798, -1.7837939636638598]], dtype=object), 'FE3_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]])}
+  
+  tables: {'FE0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE3_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE3_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE3_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]]), 'FE3_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE3_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2': array([[-0.074803807748196033, 0.51763234198767349, -0.074803807748196643,
+          0.29921523099278691, 0.033544811523148282, 0.2992152309927838],
+         [-0.074803807748195991, -0.074803807748196616, 0.51763234198767361,
+          0.29921523099278691, 0.2992152309927838, 0.033544811523148269],
+         [0.51763234198767138, -0.07480380774819663, -0.074803807748196643,
+          0.033544811523148657, 0.29921523099278657, 0.29921523099278663],
+         [-0.048208377815511877, -0.084730493093977816,
+          -0.048208377815511891, 0.19283351126204784, 0.79548022620090597,
+          0.19283351126204784],
+         [-0.048208377815511919, -0.048208377815511967,
+          -0.084730493093977843, 0.19283351126204781, 0.19283351126204779,
+          0.79548022620090619],
+         [-0.084730493093977774, -0.048208377815512009,
+          -0.048208377815511891, 0.79548022620090597, 0.19283351126204784,
+          0.19283351126204784]], dtype=object), 'FE0': array([[0.091576213509770035, 0.81684757298045907, 0.091576213509770993],
+         [0.091576213509770077, 0.091576213509771076, 0.81684757298045896],
+         [0.81684757298045807, 0.091576213509770979, 0.091576213509770993],
+         [0.44594849091596506, 0.10810301816807004, 0.445948490915965],
+         [0.445948490915965, 0.445948490915965, 0.10810301816807],
+         [0.10810301816807004, 0.44594849091596506, 0.445948490915965]], dtype=object), 'FE2_D10': array([[0.63369514596092014, 2.2673902919218358, 0.0, 0.36630485403908286,
+          -0.36630485403908286, -2.901085437882756],
+         [0.63369514596092069, -0.63369514596091625, 0.0, 3.2673902919218336,
+          -3.2673902919218336, -4.9296699827375906e-15],
+         [-2.2673902919218323, -0.63369514596091647, 0.0,
+          0.36630485403908286, -0.36630485403908286, 2.9010854378827484],
+         [-0.78379396366385989, -0.56758792732772045, 0.0,
+          1.7837939636638591, -1.7837939636638591, 1.35138189099158],
+         [-0.78379396366385967, 0.78379396366386023, 0.0,
+          0.43241207267227894, -0.43241207267227894, -7.6450782352261042e-16],
+         [0.56758792732772034, 0.78379396366385978, 0.0, 1.7837939636638591,
+          -1.7837939636638591, -1.3513818909915805]], dtype=object), 'FE2_D01': array([[0.63369514596092058, 2.7755575615628914e-16, -0.63369514596091581,
+          3.2673902919218341, -3.7747582837255322e-15, -3.2673902919218358],
+         [0.63369514596092025, -2.2204460492503131e-16, 2.2673902919218358,
+          0.36630485403908319, -2.9010854378827551, -0.36630485403908342],
+         [-2.2673902919218314, -5.5511151231257827e-17, -0.63369514596091603,
+          0.36630485403908319, 2.9010854378827475, -0.36630485403908297],
+         [-0.78379396366385989, 4.8572257327350599e-17, 0.78379396366385989,
+          0.4324120726722791, -2.4980018054066022e-16, -0.43241207267227899],
+         [-0.78379396366385934, -1.1102230246251565e-16,
+          -0.56758792732771934, 1.7837939636638593, 1.3513818909915796,
+          -1.78379396366386],
+         [0.56758792732772056, 1.3183898417423734e-16, 0.78379396366385978,
+          1.7837939636638589, -1.3513818909915798, -1.7837939636638598]], dtype=object), 'FE3_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]])}
+  
+  name_map: {'FE0_D10': ['FE1_D10'], 'FE0_D01': ['FE1_D01'], 'FE0': ['FE1']}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE0_D01': 'FE0_D01', 'FE0': 'FE0', 'FE3_C1_D01': 'FE3_C1_D01', 'FE3_C0': 'FE3_C0', 'FE3_C1': 'FE3_C1', 'FE3_C0_D10': 'FE3_C0_D10', 'FE1_D01': 'FE0_D01', 'FE2': 'FE2', 'FE1_D10': 'FE0_D10', 'FE3_C0_D01': 'FE3_C0_D01', 'FE1': 'FE0', 'FE2_D10': 'FE2_D10', 'FE2_D01': 'FE2_D01', 'FE3_C1_D10': 'FE3_C1_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D01': array([[-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0]], dtype=object), 'FE2': array([[-0.074803807748196033, 0.51763234198767349, -0.074803807748196643,
+          0.29921523099278691, 0.033544811523148282, 0.2992152309927838],
+         [-0.074803807748195991, -0.074803807748196616, 0.51763234198767361,
+          0.29921523099278691, 0.2992152309927838, 0.033544811523148269],
+         [0.51763234198767138, -0.07480380774819663, -0.074803807748196643,
+          0.033544811523148657, 0.29921523099278657, 0.29921523099278663],
+         [-0.048208377815511877, -0.084730493093977816,
+          -0.048208377815511891, 0.19283351126204784, 0.79548022620090597,
+          0.19283351126204784],
+         [-0.048208377815511919, -0.048208377815511967,
+          -0.084730493093977843, 0.19283351126204781, 0.19283351126204779,
+          0.79548022620090619],
+         [-0.084730493093977774, -0.048208377815512009,
+          -0.048208377815511891, 0.79548022620090597, 0.19283351126204784,
+          0.19283351126204784]], dtype=object), 'FE0': array([[0.091576213509770035, 0.81684757298045907, 0.091576213509770993],
+         [0.091576213509770077, 0.091576213509771076, 0.81684757298045896],
+         [0.81684757298045807, 0.091576213509770979, 0.091576213509770993],
+         [0.44594849091596506, 0.10810301816807004, 0.445948490915965],
+         [0.445948490915965, 0.445948490915965, 0.10810301816807],
+         [0.10810301816807004, 0.44594849091596506, 0.445948490915965]], dtype=object), 'FE2_D10': array([[0.63369514596092014, 2.2673902919218358, 0.36630485403908286,
+          -0.36630485403908286, -2.901085437882756],
+         [0.63369514596092069, -0.63369514596091625, 3.2673902919218336,
+          -3.2673902919218336, 0],
+         [-2.2673902919218323, -0.63369514596091647, 0.36630485403908286,
+          -0.36630485403908286, 2.9010854378827484],
+         [-0.78379396366385989, -0.56758792732772045, 1.7837939636638591,
+          -1.7837939636638591, 1.35138189099158],
+         [-0.78379396366385967, 0.78379396366386023, 0.43241207267227894,
+          -0.43241207267227894, 0],
+         [0.56758792732772034, 0.78379396366385978, 1.7837939636638591,
+          -1.7837939636638591, -1.3513818909915805]], dtype=object), 'FE2_D01': array([[0.63369514596092058, -0.63369514596091581, 3.2673902919218341, 0,
+          -3.2673902919218358],
+         [0.63369514596092025, 2.2673902919218358, 0.36630485403908319,
+          -2.9010854378827551, -0.36630485403908342],
+         [-2.2673902919218314, -0.63369514596091603, 0.36630485403908319,
+          2.9010854378827475, -0.36630485403908297],
+         [-0.78379396366385989, 0.78379396366385989, 0.4324120726722791, 0,
+          -0.43241207267227899],
+         [-0.78379396366385934, -0.56758792732771934, 1.7837939636638593,
+          1.3513818909915796, -1.78379396366386],
+         [0.56758792732772056, 0.78379396366385978, 1.7837939636638589,
+          -1.3513818909915798, -1.7837939636638598]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D01', (1, [0, 1]), False, False), 'FE0_D01': ('FE0_D01', (0, [0, 2]), False, False), 'FE0': ('FE0', (), False, False), 'FE3_C1_D01': ('FE0_D01', (8, [3, 5]), False, False), 'FE3_C0': ('FE0', (4, [0, 1, 2]), False, False), 'FE3_C1': ('FE0', (7, [3, 4, 5]), False, False), 'FE3_C0_D10': ('FE0_D01', (6, [0, 1]), False, False), 'FE1_D01': ('FE0_D01', (0, [0, 2]), False, False), 'FE2': ('FE2', (), False, False), 'FE1_D10': ('FE0_D01', (1, [0, 1]), False, False), 'FE3_C0_D01': ('FE0_D01', (5, [0, 2]), False, False), 'FE1': ('FE0', (), False, False), 'FE2_D10': ('FE2_D10', (3, [0, 1, 3, 4, 5]), False, False), 'FE2_D01': ('FE2_D01', (2, [0, 2, 3, 4, 5]), False, False), 'FE3_C1_D10': ('FE0_D01', (9, [3, 4]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00236 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00221 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00244 seconds
+  Shape of reference tensor: (3, 3, 6)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00187 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.0015 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00182 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00153 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00172 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00152 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00169 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00155 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00255 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00219 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00252 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00219 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.0025 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00231 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00277 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00222 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00251 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00214 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00255 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00247 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00261 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00241 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00272 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00239 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00265 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00244 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00356 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00405 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00471 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00364 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00289 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00235 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00272 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00238 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00514 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00307 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00272 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00231 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00275 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00229 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00259 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00226 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00259 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00224 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00264 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00236 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00268 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00242 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.0025 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00214 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00256 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00213 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.0025 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00207 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00241 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00204 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00237 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00217 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00247 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00249 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00266 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00218 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00248 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.0022 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00249 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00213 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00251 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00213 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.0026 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00221 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00264 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00222 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00306 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00388 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00438 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00393 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00262 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00224 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  18 entries computed in 0.00258 seconds
+  Shape of reference tensor: (1, 3, 6)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00211 seconds
+  Shape of reference tensor: (1, 3, 3)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000698 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000684 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000994 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.00177 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.00169 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3 entries computed in 0.000634 seconds
+  Shape of reference tensor: (3,)
+  Primary multi index:   rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.722986 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.0103931 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 6 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 6 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: det
+  Removing unused variable: dx1
+  Removing unused variable: dx0
+  Removing unused variable: v1
+  Removing unused variable: v0
+  Removing unused variable: edge_vertices
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.366092 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00279093 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./AdaptivePoisson.h.
+  
+Compiler stage 5 finished in 0.00198698 seconds.
+
+FFC finished in 1.1872 seconds.
diff --git a/demo/documented/auto-adaptive-poisson/cpp/documentation.rst b/demo/documented/auto-adaptive-poisson/cpp/documentation.rst
new file mode 100644
index 0000000..1d412d9
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the auto adaptive poisson demo from DOLFIN.
+
+.. _demo_pde_auto-adaptive-poisson_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/auto-adaptive-poisson/cpp/main.cpp b/demo/documented/auto-adaptive-poisson/cpp/main.cpp
new file mode 100644
index 0000000..4d616b6
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/cpp/main.cpp
@@ -0,0 +1,99 @@
+// Copyright (C) 2010-2012 Anders Logg and Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-08-19
+// Last changed: 2012-11-14
+
+#include <dolfin.h>
+#include "AdaptivePoisson.h"
+
+using namespace dolfin;
+
+// Source term (right-hand side)
+class Source : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    double dx = x[0] - 0.5;
+    double dy = x[1] - 0.5;
+    values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+  }
+};
+
+// Normal derivative (Neumann boundary condition)
+class dUdN : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = sin(5*x[0]);
+  }
+};
+
+// Sub domain for Dirichlet boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS;
+  }
+};
+
+int main()
+{
+  // Create mesh and define function space
+  UnitSquareMesh mesh(8, 8);
+  AdaptivePoisson::BilinearForm::TrialSpace V(mesh);
+
+  // Define boundary condition
+  Constant u0(0.0);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, u0, boundary);
+
+  // Define variational forms
+  AdaptivePoisson::BilinearForm a(V, V);
+  AdaptivePoisson::LinearForm L(V);
+  Source f;
+  dUdN g;
+  L.f = f;
+  L.g = g;
+
+  // Define Function for solution
+  Function u(V);
+
+  // Define goal functional (quantity of interest)
+  AdaptivePoisson::GoalFunctional M(mesh);
+
+  // Define error tolerance
+  double tol = 1.e-5;
+
+  // Solve equation a = L with respect to u and the given boundary
+  // conditions, such that the estimated error (measured in M) is less
+  // than tol
+  LinearVariationalProblem problem(a, L, u, bc);
+  AdaptiveLinearVariationalSolver solver(problem, M);
+  solver.parameters("error_control")("dual_variational_solver")["linear_solver"] = "cg";
+  solver.solve(tol);
+
+  solver.summary();
+
+  // Plot final solution
+  plot(u.root_node(), "Solution on initial mesh");
+  plot(u.leaf_node(), "Solution on final mesh");
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/auto-adaptive-poisson/python/demo_auto-adaptive_poisson.py b/demo/documented/auto-adaptive-poisson/python/demo_auto-adaptive_poisson.py
new file mode 100644
index 0000000..54c241b
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/python/demo_auto-adaptive_poisson.py
@@ -0,0 +1,64 @@
+# Copyright (C) 2011-2012 Marie E. Rognes and Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-08-19
+# Last changed: 2012-11-14
+
+# Begin demo
+
+from dolfin import *
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(8, 8)
+V = FunctionSpace(mesh, "Lagrange", 1)
+
+# Define boundary condition
+u0 = Function(V)
+bc = DirichletBC(V, u0, "x[0] < DOLFIN_EPS || x[0] > 1.0 - DOLFIN_EPS")
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)",
+               degree=1)
+g = Expression("sin(5*x[0])", degree=1)
+a = inner(grad(u), grad(v))*dx()
+L = f*v*dx() + g*v*ds()
+
+# Define function for the solution
+u = Function(V)
+
+# Define goal functional (quantity of interest)
+M = u*dx()
+
+# Define error tolerance
+tol = 1.e-5
+
+# Solve equation a = L with respect to u and the given boundary
+# conditions, such that the estimated error (measured in M) is less
+# than tol
+problem = LinearVariationalProblem(a, L, u, bc)
+solver = AdaptiveLinearVariationalSolver(problem, M)
+solver.parameters["error_control"]["dual_variational_solver"]["linear_solver"] = "cg"
+solver.solve(tol)
+
+solver.summary()
+
+# Plot solution(s)
+plot(u.root_node(), title="Solution on initial mesh")
+plot(u.leaf_node(), title="Solution on final mesh")
+interactive()
diff --git a/demo/documented/auto-adaptive-poisson/python/documentation.rst b/demo/documented/auto-adaptive-poisson/python/documentation.rst
new file mode 100644
index 0000000..dfc469b
--- /dev/null
+++ b/demo/documented/auto-adaptive-poisson/python/documentation.rst
@@ -0,0 +1,151 @@
+.. Documentation for the auto adaptive poisson demo from DOLFIN.
+
+.. _demo_pde_auto-adaptive-poisson_python_documentation:
+
+
+Auto adaptive Poisson equation
+==============================
+
+This demo is implemented in a single Python file,
+:download:`demo_auto-adaptive_poisson.py`, which contains both the
+variational forms and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation (in
+:download:`demo-auto-adaptive_poisson.py`) of a solver for the above
+described Poisson equation step-by-step.
+
+First, the dolfin module is imported:
+
+.. code-block:: python
+
+	from dolfin import *
+
+We begin by defining a mesh of the domain and a finite element
+function space V relative to this mesh. We used the built-in mesh
+provided by the class :py:class:`UnitSquareMesh
+<dolfin.cpp.mesh.UnitSquareMesh>`. In order to create a mesh
+consisting of 8 x 8 squares with each square divided into two
+triangles, we do as follows:
+
+
+.. code-block:: python
+
+    # Create mesh and define function space
+    mesh = UnitSquareMesh(8, 8)
+    V = FunctionSpace(mesh, "Lagrange", 1)
+
+The second argument to :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>`, "Lagrange", is the finite
+element family, while the third argument specifies the polynomial
+degree. Thus, in this case, our space V consists of first-order,
+continuous Lagrange finite element functions (or in order words,
+continuous piecewise linear polynomials).
+
+Next, we want to consider the Dirichlet boundary condition. In our
+case, we want to say that the points (x, y) such that x = 0 or x = 1
+are inside on the inside of :math:`\Gamma_D`. (Note that because of
+rounding-off errors, it is often wise to instead specify :math:`x <
+\epsilon` or :math:`x > 1 - \epsilon` where :math:`\epsilon` is a
+small number (such as machine precision).)
+
+
+.. code-block:: python
+
+    # Define boundary condition
+    u0 = Function(V)
+    bc = DirichletBC(V, u0, "x[0] < DOLFIN_EPS || x[0] > 1.0 - DOLFIN_EPS")
+
+Next, we want to express the variational problem. First, we need to
+specify the trial function u and the test function v, both living in
+the function space V. We do this by defining a
+:py:class:`TrialFunction <dolfin.functions.function.TrialFunction>`
+and a :py:class:`TestFunction
+<dolfin.functions.function.TestFunction>` on the previously defined
+:py:class:`FunctionSpace <dolfin.cpp.function.FunctionSpace>` V.
+
+Further, the source f and the boundary normal derivative g are
+involved in the variational forms, and hence we must specify
+these. Both f and g are given by simple mathematical formulas, and can
+be easily declared using the :py:class:`Expression
+<dolfin.cpp.function.Expression>` class. Note that the strings
+defining f and g use C++ syntax since, for efficiency, DOLFIN will
+generate and compile C++ code for these expressions at run-time.
+
+With these ingredients, we can write down the bilinear form a and the
+linear form L (using UFL operators). In summary, this reads
+
+.. code-block:: python
+
+    # Define variational problem
+    u = TrialFunction(V)
+    v = TestFunction(V)
+    f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)",
+                   degree=1)
+    g = Expression("sin(5*x[0])", degree=1)
+    a = inner(grad(u), grad(v))*dx()
+    L = f*v*dx() + g*v*ds()
+
+Now, we have specified the variational forms and can consider the
+solution of the variational problem. First, we need to define a
+:py:class:`Function <dolfin.cpp.function.Function>` u to represent the
+solution. (Upon initialization, it is simply set to the zero
+function.) A Function represents a function living in a finite element
+function space.
+
+.. code-block:: python
+
+    # Define function for the solution
+    u = Function(V)
+
+Then define the goal functional:
+
+.. code-block:: python
+
+    # Define goal functional (quantity of interest)
+    M = u*dx()
+
+Next we specify the error tolerance for when the refinement shall stop:
+
+.. code-block:: python
+
+    # Define error tolerance
+    tol = 1.e-5
+
+Now, we have specified the variational forms and can consider the
+solution of the variational problem. First, we define the
+:py:class:`LinearVariationalProblem
+<dolfin.cpp.fem.LinearVariationalProblem>` function with the arguments
+a, L, u and bc. Next we send this problem to the
+:py:class:`AdaptiveLinearVariationalSolver
+<dolfin.cpp.fem.AdaptiveLinearVariationalSolver>` together with the
+goal functional. Note that one may also choose several adaptations in
+the error control. At last we solve the problem with the defined
+tolerance:
+
+.. code-block:: python
+
+    # Solve equation a = L with respect to u and the given boundary
+    # conditions, such that the estimated error (measured in M) is less
+    # than tol
+    problem = LinearVariationalProblem(a, L, u, bc)
+    solver = AdaptiveLinearVariationalSolver(problem, M)
+    solver.parameters["error_control"]["dual_variational_solver"]["linear_solver"] = "cg"
+    solver.solve(tol)
+
+    solver.summary()
+
+    # Plot solution(s)
+    plot(u.root_node(), title="Solution on initial mesh")
+    plot(u.leaf_node(), title="Solution on final mesh")
+    interactive()
+
+Complete code
+-------------
+
+.. literalinclude:: demo_auto-adaptive_poisson.py
+	:start-after: # Begin demo
diff --git a/demo/documented/auto-adaptive-poisson/u_refined.png b/demo/documented/auto-adaptive-poisson/u_refined.png
new file mode 100644
index 0000000000000000000000000000000000000000..69489da331505d85b07408530e0685fa8acb760a
GIT binary patch
literal 39800
zcmeFYRZyE>^fnqO#fn35cUs)t3GTE=Deh9V1a}C9pv4`6mKKNN6n6<$+`YIvU-+Hx
zKXc~HnR9h6znNTQCwbp@`CjXJcD`w-$z!6Eq5}W`OhpA*EdT&f4*)=jLq&vt@~Hc5
z3;>`8D9TFdcxE27I#se+e_g&6{deeBPOX4QPeMb_8Alw^=Rr+K)5-oyn({5AH?Ckf
z6#KjDh~!9jd9|Iwfh%5HH@&t;7={((P>^H;(OhQQGm}8Y(9+}w-a=kw66!&}<ZBh&
z_p@5a>hwsv*-OXX+g%1upd6nH$-pCttGnr6Zub{QOU<BTzq`H5oCFO5IZXm^<mZD|
z%#r!bkx`0hrkVtDF5`(fgzzs=RR7QN|5)Sy_h2wwUUVB1tMHyK`_ix$URKd|_qM{b
zX9=|OXvyF9{B+;`41cBDm)|Bk-6rQe&gCT4`dz%Dx&fe2J>T@TXA?C+m}yue^BW+y
zCt!((e4<v=KN%|z+W}W&Pjhc|4PA!VelLFg`*~+^cFFj5Q1=N&^$6p5TIX2y+R2i*
zgG$^Tf!ckVJ4OUn9`dmLc4esU#{b?*rx1y5c;v$KpaF8TeEhilue|vv>)5wA4I%F0
zmBh)boW}#}fDHlvje}^3n-1({|NFz7+hJ?C4#)r}uc1%=w<!U)ApafE=yJklpZHbP
zj`($>@xq(WMk+-2fS2^Di1*6=?^3vMG-?2a7kS14p3c>C#QpZCN_py^`{l*Yte+2Z
zFyA7btP{20L_7Iz+<N9!1m|r2eOjytq7nih>XyUc_ZmvNKWZLZdJ)P=SA2tH4B-6y
zc%9Swm<3wCeKFxsMb6z+arRkaab_%0QwwucC3EDu>(+VBvuNP^iWb-Av;DFP<dZNC
z-?f9oPxgST`^Og-96vv{KUY!RS5ZB!QHfJ=xO-_z>%o)2OD6k-oqc&oe!T;Q%J($N
zSaj^XRJ+*dEFmScov6w1KaU8qmN#yvZ)|M9Wjp@m<o8e6_-+E*clFiE<I;*>6&6s}
zaGZEe$oOaIi!f)sOTT;5nge=@<655X{yncrJb<yqF2+|Ln**+mpZ^8;WgG2Quab3F
zvPI?#N|rb6zXM>4p8WCH3c(gfUHzu+yG}wDa5tIrl=6ILoLzOsSK&3%{`mX(s>&~K
zC<d?dKQq}^w0fi$sr#ROUq}kL0SDMv{WbDABq3YzyIuk<y7a-V+;cbx*XiW$Uqyg}
z@oqKrKj~bzc6WE{7ryumeOj*eWMODMbaZOIocUC2i+D0FgWY=UcN_(NQJ<WGqIHYS
zNk9AO2(Ixb<E!cvzef&teYd&xAh-lF+p139lkkW<d%5bWu7a<|_`c5AXUu20#@(m!
zdfDf=VIyXj`f8I&;&#Nz{~Y^i726-KRoh04NZUmr$K&GI<06yz={Hcz28HqS8^4j=
z$O<<UV~QP>WS0ND%Dw%X!?VNb`O4||`u=bG)1|~sh{Vlm2=>!m#q-^--^<>k(a+l}
z4;gToeI%YvW82|kJjPSq##@V@r%^rb%2zZWHT6A&v2*<RYxA-Jz)o`7bFWfcpUBh7
zEph*^y`Tp*3a(C6xbZC9h0*QR|1Cp`UW}D5XruJMmu8{xjiX0y1F;WvOi};8g_QP7
z1Zk4<GW_o)*NbP?^I;qZCd+PGg#Vvg4#UvP7DW`@h`#^w`1N(I|M#15=}P&*CD$}G
z{2xjFw_xvpFAq25y((tE!cCO>PZGiZk>vkzuL17=gf|b^UniPM!65{X9zRmhts<h~
z;m`*HsDEX6Jum@wJ3&vO#y2u-k?X#aj?Xhu>wt#)V=^Q}^izDKZc;o_#NUryaWlqZ
z$*2feHlp4`8A_y4>t)*#eik4a<0IPu(}1f%yv}v99PH-`#yqaCqjA+te^7<`D*-e?
zh@)B^f57DE)Uek*$+DopxC!S>3XbRd!YH}ZBo=tpJMVXDYb22@tR|6)$BCCF9+#5-
zvxtk$c4Jk;iPW?BK`#`&*_k;%@CakYZZ?Yg%d<~mgxqO_@0~f34r<PA3;e-=n?KLX
ztY>)?$Qsn9aov@#9c{7+X7T`mxqoOpPi^`s1&%ZTN4BrgPd-?~7~Qd<8dV)__{j24
z_wOZUI3DJhBb77Z$>lkG(;iSy(lNzfYdI&?DfSgBiq0KZ6s!p-(cr^%#>J>I|3OV(
zxS|8-cLyT^k}XpJ2U(N!C_FI=2O^Tgh!KCE6j;nO>EXUOB|ZswoctCn^&LT4CfyG(
zHCdoMi32dfeIq+)Y7v<bH*Rf$hJI!-Q(~=$8*fNzTWCrREVpd{@^RaA;t(`(@(G^j
zvAcJKVYRdoR0(>*Lty>iy6&>L3)fQwq46&76Y8JbxZd#=4S7UA%5s<{Bkn{mjb~{v
zG^Vqz7mJRTIDdCgk{XHVr)BjpZBP_#IIwfoB*hTWNF@6({>*K>dj63h1uN%f3Kr(u
zxFdRhbCARk+G9Deuu=sbFCmbwl-e(iAV;?jWSRIhwd3w#)izv-8#XO$NZ|5~;BJPQ
zd<bzfjTL|4(!UcOW6K^BOL%pHHnK(=DLhCJo99%1S;JM2oc6^MAI@vq-DOKih9?OV
zi*Hns3Wp<TP(6)9o%KSy-q?+=)4c{3K2#E<v=GPCY8vmqNgLAsqz&Xsuy3-)!%PL5
zhGIJ^1!ekdkA{X!d1O)`svXmGwQcl0UkMos$el(j!8<zNw+~Pd#bIjtUkt_$DONQY
z22$r+LR0!MegGZ2P1jAv&M?tPBJtQIU64-ypf_Sd><10fu=O|@Q=Lr^SQ4ek_A=@&
zZrab-a)NOf3#X4K6Y^K_pT;aG^5&aB=EhhZbKB|5b|Bvq`+QakOs%x%RN`6x%Xv>a
zjk;n!K&pzuBBlOmoMOsAiWt)}dEP7L0(Rm4<$fr0hz~u_Y5xeCOFM*~)GqvSr4;z9
z_0`fO%RcRbLOIQL%pA=`*c>dVaich(cC+#ZdFT3RH&|`^@hU?tr?on?vZ3I%%D6Ef
z7c&(#WHl8P@q3UK9ppre6d{j<nU}dGSCiWmN*Fh%;fRStx(4m`&z5gaQ^ob04Q}K_
zZMQjKU~RD_MUWozus@aO!zR-VEMOl`mFixT&k8$Q?H*S^u|gr;PE$Luj<~sP_luEO
z%D?H&h1VI%cq;$D8^w(HMd8RW7^=)eB5pbt3C7@l#3{a?4W)^e#R#iDRC$n@6A4f0
z6hCEA<6Eej&SalA)hF3cd=B)S7CHbfP_6BUjwAc)v?H9V98-KGE7h<r1T{f%tbcK0
z{G+L~J29ZgEHKA-DM#cR1-KhCGoEih2UywJ$<obQ$_@qCB{Q1zo4#_G4I>=jHk9Kc
zs2Vf4E3?$6kq<86Kb%QE>*$eh($R(}-R8!ocR~ozyT&5Re>P)-Y!s*g8Qj{yVEfsy
zDsVI*dM1SfuC|3<=#rb)(ap4g|6Z^kx||Ebi%)rO$=Yv1Z9AvNOG*)H(mMjJGIpuQ
z(+vv#T&P6Ta61#%Q`3x;dcjnYv1&ABu>p~sdDrl&mi8zoWSCnTY(6)Jiit($dKv``
z-d%Lty6J0FE)XHF{&rOAyT*7(Q>Y?0JghYlMoGAa!8go9{y^mPupagx8@b-{QumoW
z4>^pc(@D8hO>}Ea-|**|*F96yjhiO2>GR;8FO=yQ4LH|g*FkpUHF75Prux&R2v^@1
zaof_5vcfv*j<5K&N=9_hjS~sZPg11IM(dKlXrXwk3)mh6iCl~x#j}JgPfm+~fXJ!^
z(}FG!oS6p{Si?Na&)7;>QBFwy*KP0FH;0xU65T?H;T1+XSofJqm#k7G@=TnBiv+^`
zM$Rx=Iwk=PDvgK<wLr8b#p8ysH2c}Vu}kX+ji*SD@4*o=Tkd<-=c5{t9owy|KQL!C
zPah|GuYow;!{7o`3WB7gXW$T;-iR`|2Vs7O(5FA1uJch0{zceWT<i1?hn!QMbNQcB
z`K=-P3d^}X!5xAQxN&;g`#wB{kywNrG9MZaxl%2PK+Jz%z)k=|wK#ENVb{T$Kg{zY
z2j+eJ$EhNj3yQW#`~EdFgBLcg9L+nPImnxw(w@1@H{miNkKTdSqYx>y5vD1{6>I#N
z;1A1NE?F+&sa&}-(km<~*VLK3u8v1aERQ~443vPKfcuBA$L`2=E_lZz=>Fv~%|1Pk
zuMTZDoslm;ZI@G9P)`1Hu7O2IDrugOU%^PV3q(^Ktl7YyqOWC6U1EPIC@fskAqRBQ
zRG3em-Y6h%vQ|Fg-@5y771wShWh#sLP275HLT`?OeZKYznzjQ=8W~`b#aiNFPt`A?
zz`DXB>G~ynU5m;v%Hu6hv@?0LJ0|XFDqffGiP1<9>f973uR-vs?Y_9&9!UB?d}J5B
zMAP51YXl4#qf-SE<drje52qLBe=lwt#<?;U6+_v%a{tcFCc(`#6h-c8bKw<D1QbYP
zP~~Ool*7Vw9lpm8L6Z^uZQA*h(IONXI!No6%@tdU-Rk~_@!iF-XEbg#%;$&6e3<0Q
z`)Vtb%-A*Mt+v_Npk61xrRnR3Nfh>*K0N|sqGHg)AX%0*Jb<G9j7YdVy3^B*2#zh2
zS{|?iXlX{Ugctc#O=qgcaB=C8GzoU;JMERw)HLjXUvUcvxTJYVyUtz#ayl}{--q6C
zP1?m_{tbVVDC?>Eo9_|{l}fCUZ)S+F*yd^q+1(o(AdURS+@YclM`v){dbp2FJ3$f(
zy4a|to+BP8jEe5>UG5sE$7n-gO6R2N^6))+zUlUdJfFloy9P;&=QsR>_Z#fI0c%u?
z<E*}Zf2!t3rx;39LjfVe7<Lu}zd-WEkf<_^ZOEuysWIaSjnx5rBruL%vP(2-&=_2-
zQyxKO6$8<X6pm!bxUjhGHY322XGUmz1@+~;iwW0upVAyRF!%}!{1n=M;u|hU%q0!F
z@J!~JuI<RONflXyiI{nuaBoQGnn_qld<-SKH!{5z|5qWQ7@hM}DA5|2W2b4@3&$yl
zVs;)|Gm5f)!jcGyRp;dcIl<EXmc1oL&S0|6F|_<+OXT41a`+DK5-c+b`S7ZeQ=9XB
zJ23zQ@kBBjySYuSI)2Gx#cquGVdT;ETxT{GlE(E4*gwKU2<BX(_oyk{vaf7$i`>1y
z^lFKP0@JT4I0^|iL)*Zp5=Lice~^I;y>aTtyPx$tslLo+CsBEQ$wJI|O1FR7@DT@f
zh%e?h_`aACXXVU%MU)~<8CC?LBw@8_)(LJLVzri1h#OF7Z0aK8aUq~~ZW+7K<N+p*
z(hLvRb0bOd07$1#FWM3(<R|&e2y{X%Q`t50j^nq&8iBZ9x{F{c;jdB>I^?j__263&
z)y4GFD<P`laN9(!3onQI21Pl2wesCQx^bIv1#(R6cM8X=1W+#25Kvf%ZXe=JZM*9)
z(9>!A%^1;H2zz8jB)B+=imo=w56~lZ@>4)`$oe8}c`qy23oI|b$+ex<I%#>%bw?hy
z1L=-y)UG``FawQd!F(n=uslrL`}||QwyRwUn=5mwa)dxf*Mixwpcse0+#({*q8pyE
zUcIN3#n-bS@?&#$yv)?FgL7Js;_sg`&F}DFVdaaiS&TtnTQO*3uV;_>KqEC*ed*Wp
z$1steDSx7vSXh={xX8B9r|PfrIW%DFOEJ^bSeVEiCE{Jx6qf`mjz6o=Hn@kA*Sw7*
zk3B<jpQWPVXg<Xl6yJ`}bGw=CbL2H$X7sfSQ^3&gavBaaygzEYKjNr4ZNC+G-o9FJ
z3Yhqw?GFFCWt*=8KF^ES{NKQaG0&r#>`T_{O**REe)DI4c0u?ww39;iT<m09YypJP
zH%g|_qbOd@agorYrCRpxDju@)kV?vcXZP6Y(mJFs)oK*nzUhao4bfZ0<<lZEUk@`d
z<X4NU0)-UgoyXR{;TMJ`Tw_qN*WoXim>PtNtw2Ysu?inX=Iz$luJVs-esVsPoU>*C
zFI&5MoHKzIT%_X`;dW$V8fbv}p@!12>a5F+13Z)vA^N5eAgN8mw&lu2<MYnb`J)RF
zQ8sqKO&3SN?T}OJ<%~f4?Z_nW<6y<Z;L9+Y(SDn;a+|f{b=7+u@O=M*le{1r66ZV;
zZtm_EG4Nqiq-{gQ|M@!LxhUgHB<7d4+wB*y1n_ib{4``Odi}=urn6Y$aWCijHs`tC
z>Av1_E9c%V;Hagw=8gO`+)VMsPuOF1+x0RTiyqaCJii$;Ot!76(SQQMItv3BiNh8!
z*<RV$hTLHj#+woXdK?yLKXR_7QiSCqUIEWy9^IR8I^){ow_=t+8)rJO`KD~qfUIRt
zQSrRALt0%(oBOXIP;@YQ`Q=;XinLSrv31~ukY8SAN%WK4Yq8z}8I;ynKv2W1wR2w^
zILZ%O<)F`$uljh+M|d`Nug|$S^O5&?$mwyw>$Wl~s{7ji_}U1x^!3<xM}%!1VFLT%
z54P`BP0nNV%1v~Qfd7$O&V9>{*s*TFrEW?z9A0UEo+{ODzff*>?@gwcxT=a3yKWr&
zJoAD(39R^@!@-4X)s+j?*tOGu)s8-iaG(3gmWLm17mTb?m4e2iTTZ@ZbvC|?L@=ok
zlOr`LHNLyd$)w@&YmM)?)Q@_OX71xL6F1^RigYG)>IE`7vFVYVn+k_DcEQ6^AxO-?
zh>>d&sp0u=!;J$6sXxm=fD^UG<k=p6d-rJEBDsF9AO5?UPVQeU8fMv>1{~_*#IfnL
zRuk`ceR?#C9f0$wY(m_DQj#lRBArx0305>eY_)@82C7G`4GQ#v2D)og?frcsv7TnX
zC(!dvi~n6um}&M7w*N^8+(f#lWPk(^9J_);Ne`37>N&z+^K&k9p7wJ5*YR_1`krs7
zoCN%r{uy02{cSyhwakcJFS=b$>l%ZW%nz)d*N@iacj3F=d1qb4Ex(AI5SnL7yp3iK
zwf**z=~R^iEl@F#gnE!+AmRwI#D>e96E9Rod@{GBG<M!gYWE`kwRxH_Vz^o_v9t`8
zV*?jGPTV$E1|pMhUcAx|Q#xRktaxoH%SB;>hA1pS1j~O<gKoGO?2GkJ11J3PH+_!<
zUUWZNI)cfv^5C5}C6`Pfdtm0wl~X;L-yi6=KR>5Kgf)HQlmu*F1u=;}-+_<VCr_$(
z;043&+FIg%ZXs#RvzG_381VcU)y3nv8idkzeBX9_3rF!hwl*lQ8=fC>s6Gf!!&N@d
z+!2+Zpn5)~GX6UKLEW<xzwM~2T?gK?QJQDp3?5f%SJH)uFrFWcU?hSBq`zP>jqHuA
z@{H#%2DV~H;mE%7DR9@426?2UVep24V@51KA^|H7r%J`~NsY7vC5c$kDX&aX+1KUY
z>3si}h{n<lv^P9anZyz1sxk7Tu+Nz>y)l%pblw|h>nI{$CJ2YdgdH^W&IV#4`m&S(
zTHfb}`2Tc{cFp&;n6yY|MjFxAQ+x&CvQTon2~vFZnYTJ9E~}d9p@+=Z$@rnwhw7d~
z$|djSVMhXcb?|+~VtLEmei?%A+8b+ri-2vOoZGSITL}sCEuWS9WulhV*Rk7mM~yq#
z61U$ayn1=EU5;C?)8}3)M!=c+)4=b5``-bF@&N-H(t4uFhF|ZEYoW;>wNb7rDW=!r
z4tIS_gVVe~_+mN;fzVg{KmO5zdaLmvQ{3{5s@+2G5Ec7bspgN}7Lla1kUrz(juuJ=
zOVbb9BpS++yU+zmdg6o6FyC_;3`0sxQQ`*Dl>J)0#U(yN6I5??j>+%CL%k#rBTXNo
z*U@`dXxDhoRw-z00db1;!629Xv9p*;0wF01_ELQON+MYcDrXvD6xoX@1$@kz;aE8o
zpMZyeOJ0dz;O8#uu}R(h20$FsI~>BX9o@|r82Qu6-OP2{b!)8Eh7Vl-AQZ}*(ww`}
z1*i7Mm-l<{ENQ<;d7AhPTDttTa`(&l64%%a-o(U`sC&+hco1YO-5hvWa1Jz+Drkdx
z1HaAjaX~G8^yx5>8)d@Bv7;>Ttu0D<Wpdt9OiS;WRgKZkR`HKA7H*UzGLhKkCx#Fp
z$VF4v>4nZ>7)06+v`}5GBv5QbM0%|N(Z>`rX>h*Y5jW=c*^?R^51HwC-a4q2e#Cna
zT+Cc#oRYQC2<{YUrhDCJhP`Zwf6p3}-hrI+7L5B(`zEMGN6C~l*z6SrKWwS7tJGTJ
zLk&g1wuIRBO5}RN78DL4zBf9Jd<pjU!}<lvkt?Tw`-O`3r#pDb^a8wq&@Gq0oR*HS
zU+TvF%Jb8?Z^2F$9E+-28}l8D5+tD&>a|uw1|9a$4X*jj#T@-H;)lI<6Eqn?Dt!eD
z#Xm9cS^Z2$%y(I1V!CfiAl<JZcPpDJCgxY5DNZF+h*t}a#k+S9_>tL%lt=YS!3S5*
zEEMuF-*75k13aep?%#&yu~4r6*Y9@UHH4G@c9VcZ>mzcCpWWbB7j0^N;pq4AR&_*K
z;qWMM=;LMHLFL!_ybrnUbPbE+QCrpM6n&Kp(|4-Y?zZ5)v87nLnA(u|L7zT^4O%e>
zYKzvDK!jJgF~{Fa9(@#`hhOcNzbUuMTHw&FnE43y<2ZKf>T3=`adB~BVebohA7t#`
zO35tj0hFL~(5XVEg7gyK8xid*ORgS=*D~AQ3E~zQ1!KV>KwR-515`qlU3OthS_CGR
zgFUW<<<!%fRt3Ea8dVf}zvS4xkkao;M5Z}^y}w<MSzWN7E8kbu=SSdDThM#34{)Rr
zr6;6~?f!#y*pLd;<E+9gMKI-8KGFuyQ0E;dF@!@AR11FJP#&ST4kKxDEoZ16;IbN`
zyzAw%4OLGfsmAm`LQBsY8Q$&76=BrkJlV}~8n-=sZrD6ITm4a1j(GCt6}IS}qPoFH
zaX8it$iC@j5}&Af$@-KR*xGAA*?*15e+}dJKHX`>({wxHiP*}y*g}#z9I}s%jXiFE
zej;;fIkgvgQVxYj!oT&%od5yz$jG!Q#aFMbIz&mQ=#sSKDfWG4;}u;6LaHyuwgO2Q
zZj2lVv<VnWb^=kM3h1a}$|BgVQY3=IImt$n7GPp#-r?$!z_>gAXo7IzUUP$CDX^8}
zuRo5wr;xa{>JBXpREHf>rKrv?$oyOBSQ&tldz&?iv|4rq580LCr!c}#A)<8gG?D3V
z(SB?2e;h&n!6s7>A7ByO=LJKZd*_n|%yGr#+He7FOkPxuJv$Ao6^_>ZH4;&sgoF13
z8BT3p`nO;>%V6bkSob&koF(7{CE%nwrS+h>?O*fqWjRQ75}FhUPy7|{9g&sWs#rgV
z_nGb2KJB2bB;94_E==RGPYnbOH~h9Px32pOMu-{tHGEC6UnYka{dm5HMhviM=G*LZ
zNoCWxifiX*iq}wq&ts_luvg^MZkah#x%x<9@mrgIqj#s3p836B_JD+bW#-AIqJGQf
z;xjGAZ=O0&XGOMK?~G2ny{HCQ^a*e~WlY3pd=1Wx#LdNl65*iXzT1ki-M;<4GyQYh
z9#@HvIk4+}pOL;ZA>F$wPLGA_U7s7HHeHG2CSRa?=&AWFYtEXO^_#M;>j~D_hCPg&
znpQFvq0L4N-5Z6P3GVkiviPgKux?~~6a10J@2cyY9_UwsYJXS8v)vzi9%J4bXG5XT
zg)hyAY;X>39V_Xg{&(x)%qJ(zc%R)o@G`uZvMoG!P(5_KP)S5>Ct=6_*Ug~jC1^mN
zZu{MI&ci0t%G1?v4*P8{{|&O0n|=7Fu$^tgYB<#I8%^%_Z>VNN7gXCnhqCKhrHM5%
z`pwn!BRhb1unY2?FP|i@5|It4a1e%!YlZRlvX%CTC|p&7(2*rg(rDv)0`(G8MpN9p
zG-YQ(9FuzXS}0pX43kFIFDxYfcs|7<)f0WDWn5LY)n~K#r=N8_a(=8ql%-b{q9U_F
zc=n>_X}hZy5J~K=L=h2WOQ95@sB(*l6~x<LGv@hz@_)_(baO&uB7!3?TOp}-^Z$19
z5%6I>$O-<DGr7pITv}F>Uj=SbuAVf$9<|AOO=c{+!^ut2i*cC>zeD?xgTMZVf0xg*
zuUQ=}k6N#nMUEQigd_a+wR61ZhKxMmG1az)>2w2nK3Z`EoxzFH-J$luoagg^Cno=O
zrk4iI?*dBI`gpY<0q<V_W4Pda)XL)#C?Kov`Gg@C3P-thM~?J4`mizsXIA_4NKHEX
zE(JnSg`ml*=MW0TJD1-S)UNr*&1hMby*9^+U_PbXyfIjw4leE#E1r9FpsoYpqA(pX
z^dpt+jr4h3+R{{Q#8#?^4SX`S*hP=E=_Z<Nos-$*ws)U;7vB92Yyi*^S27Fm)_I@p
z(98eu1F$>v6fYsasEPQK>)ZyQOGr8&lbVFbj9Lx+$~MVnLc%>vPNEwVgE!u>t8H$c
z5YEXRb(X3^uxQ{$<iRT)Z8sH@Ia}^!_iX5;#35&N5=``P1!v0Ok<$CZlohLGd9T6y
zl7H<_|KL2?zqwCON5@Y`FWexUAk50TI<xV1d@-Wus9W~=cX&V3e)6W>8J^wnAOAXr
zw>vM4XWzD?p$?onJDuhdd;CbL>JY>4hN8Bv=CF=c8?(*-ZQDG$Pa*^0#<N48jtW~O
zwF%BlRHf}fcK?m6H6x2284bO((RpIo&?kQ#oM`2u5^hYGoCF)^S#Uo7ix|cw!1-Y^
zB^d1gaZrVb&i!}9dfcCB!V68xhN?H}wHb2-y(X!}_AMH=LkJc_NoA)3cI+u$*M@iQ
zeTsI5q+Ubkx<p%ZsXAr^j6eF433lBIvb8Airb|hJOSLK5P%PSrg#9=U3nyEj1Eyn(
zJXyW^9wHRQc0!*0?>MY0;N!~8yVNf&n3x(wX6re{v9XC`oWz*RH3%NZ7E=TF3M70Z
z6!=o{$!vTX9fo`3QF~`vU>_^xPSgR4-3Zt@4N|t7cgh_KqH?3(N0g#ZuHTiu@1+7r
zi0-BdH?8hHkIrzUd#l5pP7}-Zd7_xZ^U~N91-|hROEvk<Y*YH`xLHKniX^~Wd|Hdx
zYUGhF`6gT#&3BnbnYDrgyqL9l3byvf%s@}ZAYv&8bKa?LQH^wj{V%)}&1tsWeDFF`
zVtyQ8@cO1l01F<<&_c0Gel;jFhkI9Y!>S4${nxSgdwA4~_juG7bB^2^X9vlc(Csgn
z5pi!r<Nh4fh7&VT>Dp=GP4x^r5AW&{Xma*&+TZ&c^=eq8m-sTT1J8qrn`AL=kph{m
z)Q@T9r>Wy6s+nnN#|5wO-(o1Y6Fa!7`avUx)C*Y6Sh`c&k?KDTFhrzY&t<5Rtyq)R
z4w_-mXvxY&VNAGqDzhLb?*#TL2+Ps&xte^s)8vY0$1ZjgeK(%J*=}3C$0D%bV1N8H
z?q}Qu+C%)aH)bPV)2HWxrp48{UTuae5k;+Qv<&r#{znK%e#2ufjf9X|D!-L6yX*5C
z%{g{Bo%bsctTFP1knaqs0L%Nw=khdMc5N%R+;w!yiUHhL=VCbDO0YI2a0t%#OcB{x
z_`}6N0tZ#lzvacI8qWu356T#CMC>hz>MJp0P7f#9mk-xdT~~Khuf}&FMnF9@H4&?s
z>-b|PIS-RD|5jRB^hgG$a-_u=h7F|+Th8C~19(jcS@(Ggu|(v)4n$bZiYV3<L5s}m
z?7vK%9^|xdJ``SU5*Z)JFtd}vheLTepZ$R7<X@sSN37sZbigk(v3s$547&7E5QK3&
z0V?uo>MxiueG?}ylM7YK=Qpwj<gQbn+GGw(H9=Sli|$y{HhD`4q2QQrLe>p~2I=eN
z1yW>M$h#HmKOB!>WWhWC4`ew(@edpK8rT|9w1{z{mmC)A$|RyQjE;E*8RARm|0-3f
zd-Wiyzxjjr*GQHNlEhUOev#zfK7ortBNijN{U4$_x0aMVh>7Q9PYK9i<Aei0yQJpd
zQhAG~<*%N$k#a`;vMq|4cRy53|9n5!?yN{0aTU6A<|0sA>}UL}{=9BRrR+lTG5`tp
zM=bwROd~O_Zh45EQXZ$)C1M&<{;Hy!UwRF>C7GhA!Z0gH<2<93k?^JWd)I8j@igY(
zGr}N@3J@>8VOx`2*?AqHInqxtg1WBYv*$xx3)#ec@AjlMxMoME#YM!D9uO{#J1z<o
zxh0+uap0!geiRIl+~`lCA$8O7Ydb}T$RtsJLmm!<eJs<AXd3oxXSdf&`epvME1H?T
zs_TI(IMI;XUdA!y95pu{3)I6bi?Ja{KOUn(v1`UNLSdB}R%*&msd_jdV0)C>9B{hM
zOdFfsx%B;{flMmU*k`3;J@;kmrT7)*<8nBKW-)-ol0%|<w+uZbGIb`(#7qxUOznD;
zuDgFR__a7}weXF5l1%sR=Wbs#*<aEZDN>|TEdF^BYi|x=BbZa^o1JS>1-R^jcP)w}
zBN!y83B@GV$r}K^@FP4M%zJRpuihI{LqlN~4lJ`{`@YCRioPZsiIgu$e=KmR!dRgY
zcvrp5#5;a%qW$g{cq{dIGK-fD7godCefc&7w&ruLXxFVK7YEx#Dd)t0O-xO<NFvls
zs@XSCOO#=Iyr?>%=HsN^goZV;)b6}CVdvQ+;MPPc|F?q**i8DUOmt8fHIxqTX5UX{
zd!W#H6V<;Bvl`E2INIlYMR8=4T>8E1OarBO%}ALpHeGBXS8gJJ=(ANG`h~us(fbLl
za1jC;2dJHyJ+<9;7HE%glZz`b5yDO#b;=XmK!EBUNhR;h7D@;Z#Wy|UH%X1fVbmV2
z_*==6MmmY%S89mSI6rk*Xy!!OvnxvZ$&MI0vf9NhvlDTr$YaLoBAP}X!s}bmDyydY
zQ4zP^pWP+AP;`D8^4f+DanGKgh0M&5+on>Kn3OK#8}Mr`iAAcMeL4o#MXA_r+CH2J
z>w79Zf2*_!)An)~i)}+ADDHa|d}X8lMWD6l8Rj!O8ATY2hFz0j899U)?oQk=5C{?W
z-cUeAOT+2GWeJ7s&Ht0G*$oUP=PBc@SHT$Ahta!*){*C$klHoteZsiZ8hh`{Z~1CU
zp7Z@dPiriMSnfexxjmI3QUF|8IAV=_N#h_1!BWe>Gt-lgLSGMMm>2X;vn!bV;!WHu
zLm?bb``cpE`MoU8-{b<9etvf@Ede_F8R!bc^a47U=qf9OUKqnb!@N)qL?8b6&_Icu
zJneE(MfJ&GI#iJYPVr9iTjgsHYhh_-V$_&(_s_C0dE2XdC*NV9+!>w2$DWI_Tf*#D
z*>_g6xHRHNB!T0UIReIq=(TjRI}7<YN-r~fuqjfQSqISCF(MD3{M#0V^-Mz5b^8Ok
zv{mV5C^aH~5rbC&Fgz;uV(l)fb|70#J7!4uypWE<)iA2@A#hucx@+m3+@a_s-~PR(
zw?v}D0)<a}_*Wh)ToIx$z2Nv$R#Uq&V*;707JGrh9zv*<u$w+tL7WX{e^8imJdM<a
z>7KseHwtQ-G{S$`Vg5?G<+N<PEvajl7<FzKzbLJ|xBrHUc#qVRq>Fl2GIY_Ze64lS
z-Q=>2G(kOcCcc>kO4>u3Bl+`0iqN>-Lr_0U1+;vAJUDrlmW&-;FRpuDr1QsINLt03
zoCeqw1FEt*j|Os0bOC_OL!J2zhm#Hbqt$#*BzW<zko1|Sh#y1<t(aJ&7!jx{2|GdK
z?zBuafjsncBCKg84lC<>m{QY$7{jrOm|R2#m@_M)ZV;$<kM<~D<A@KB?=rx<x{<;=
z>Z{dCP4^%I1pq0olx0RL@y+jUnY6kcYfo_=py0YMAqcf!z7@*H4xM3?IZnkuO|k78
zm1Z3mDN3Hkbd$FSaDm%XNW>4sBavlN1&dTos&W`C8hboZkW3>w-`MifDg=~-JGtp?
zm&qqu%MypN7U-2p5szAuh5Iz9n?^#>3JFZY*-=wTGo3Mo+)Jdmw9QcvJVm`x%4^HA
zU&*cw@wVyQQfzGGB*|Me!xlUQ+R`W|Pz4Wkewc_LPJMZ>e_Vb(FT0;0LII+go+c^W
zkM;N0(37bC(LyRns{$}h2qj;EvD@{#8z7;pLg86RO(w2|f?M4TGKpdeQT4zwKJ3r#
z4$u%pu*lS3kKFDe-|Q}@vMOaumpsEk&DM!KLpC)&?b-**X01B~usYA*Vs;!PZ<L_V
z7OZx&!Jp-!e*=yM=h;#~xRt%LR(6dWrBagDRh&xn8xIFNr}j3Ry{`Dg|G4gMEfCff
zZcp_vL_h^ccf0keiY3akctdj#jxIBY-lynrUUWK-+0WcX)2ONAC6pV`T*^c1pqZ&G
z+R6}SP(-GOhQ$nC<fMGqN}6LsS{Jssn&kp!yu)flMRivUwIojibo#?lLXlZ$PobL6
ze1P&N*4&e54~vdvPD<{lZJBByI<m@gquz%j!v{#V5;7TsBi(3fJ?U#JJ}=@gDyQGQ
z-x<%dLf*R)JI?9zR_rCWo9XHD?h6tiNv5lLX+)Lwu@Y{2!s=vH2ayMcDICpFf#hly
zZ^AO%t6sMbVKgI$);P~JExtDSEA4F-WQ&D2!#O5{RZIhx1sxc$R}T0>Sk!n_mhwz7
z-i?)aT6px!)+!{t{=`d>6vihcT4?`B+xP0!V*<O`_tgX;fnw}4hH^e;3R_>g)vh`A
zuP{xlxO7_PcR2G1D(&_y(Y7dh==2VBkqSgM>^|u9pEhlxGl*2iJP#kzjQv%fXd|5z
z;5ouEw2wf($6Tc)MsBY$_O7;t@vgrzFqOvyy3hWaFJF~}0s@n#BX2+>WPf{+hJj{j
z;ZhI_oL7FgB`Aq1bYiB*Ny>l;<@2x_!9cNM+;*N~A+1XSvd$Ib&N$dV_M1J+^)y~X
zu5fLXBg0LqdYpssD!(ZkI_qZ(JT`pR`>2L*&~*Ud6d9)O?2U{4c95sS6_uK59kGh^
z*IBPTEiZEBE4rJgme|I|>NitWYToqGZbh=ojIzJ(S(*@4##m|)FfxJbI4Sw2Oir#X
z*<WbT>BDTjh*zvnY%12z@lG5G-1-pTx;HhKYN_Wg`(2ylM%sd&=n<s`a;IDHW}pp^
zp0y~|eitx_4xfMX=P?Xg?dTU_6BH@9A_~afgt^hm`hv>f=+qQL+HFGgz2&G&b3`iL
zvE>PG%-x}@Rhurtd?K^->NX=k@DDi$r;8m2wvm$EyCvXQeb3o~szvPrrS9z#`~2Qd
zF6qsn+`6Aoi8`0)dNfDGK=D_9O6j_HR|S90aDr5tYY{>ChLt_~>6DtI6#RLr&R}q%
zXQI}8(nQ0JT94rQMZ~RslM=Wum768A4Hm$*94uwVk3+mB9}25`5JoJEAS_8fE65hN
zh})YUDOo#dOE3I}R(Mr(#!iVsh9Xrdm1hUDWA+)hj7!89L<l?<c>B)HhF+hjX?;j@
zC3YRxR{dVQp0MUTHJ^Z}gfkK7?#y5a)l6q6rL!oGhgCIAaT?mmto5FQw}i0o$HMjT
zva7d*zo}~PaT0d@sB!tc4O|Auf=?pUV)i4dDsQAo{56I0OI$R?WkqTgdiwFiRPbq3
zlRr||&WD*ks&%0+W)12dQ2a6#A@&v6B0HvNejjK`(aXOC3x7gO6%j<h_{Yh_Cmd8s
z1Vzr-6~i~r+~r9xH2vwK<{c}WPOcpf{?~;P1G5jOqX84sjEpzAjBcoK_$i68b)CK@
z^><BK1jo*q$?C*RM0{oky<g`<M_aJ$bHON+(EgnE@t|RncqQA*w_Gd?e`BV!1)9Q%
zUFNqHO)29U^A$dz(R~Ld$KExlR;War{lp#C!RHb+pUax4smGubVeE3yqIXLj_2iQq
z@G&-o+Lze69R4C2)|8Jo{>Pd>UJ`&BwITbYT&oyT-NdRhnY{ILPY+Y}dw$kvb&$RX
z%2r7VcAA4ZQ`9P-^7|7T-rF-QdmBeZ-_NI}g0yEgF@f=Xc9=CGe`>oHb)lRG<Zcmy
z;>ctk;oqE1+QEls!z1y0(%#-?eI%a|z0k>Um!U_Ni%?d9_sOG&G+`K+1&;Fwkg>=~
zJBsit;C@WLL{9aE^G#W!up<|}pz`Ol#IU9Gx_o*=hj0h>%{}*`%~D^BD0>4&d~5P%
z#Vrc9Hu4w!yW-JP-<g{9f8tjda$FBEkxc-)!TS3lMf69!9elzz=G}>BB-Azrt&s|4
z>~GrXeEWOEC)Xbh=HqA$T+Kbj{R(DH*g`(dcg0t`)U7m$5w$bpjvBzm9W1&b#Z(kq
zVQu<?#(b8aran-pJO2E`QZZJR;XdT~4xoZBdl6%sf;F*=j9*m1)pUv>M9}2C9~sXm
zLw?LffoW{h$6LtB#u3j}lOmeF`<RvYQArsjuvM|gM{)S!b#VOOgn?3J0u8-mPuk=Z
zGFcPPT3F2i<kh$GU5-D)9_TsOoG>Bb2Mc`t{_voFh6@Er3?h$ypVX++t#7O>-SU2>
zBQfjM`S6280*Af2FoW6znvHqni9cNN9;Gc<6}Ey*bXpM%yrKAeq^Bx0J{b)*xZYDI
znME`xV@cMDprMpx6Wik1N(mxm_QFvhdx=vd73yR<Ye-8QVqQR(h6oGzmOq)#lu})L
z`PG3zn>X2#g){*)j_#+Vi7Zzbe-;av^f#g&lGC6!n)0a(*=Z;HS0+G4ASx1KpHFI@
zh=+*aY{arQ5qYXLf&-@6u<oGtEYypPo|_&R2P(2vD2Y`fhKzlO-GRNLxLy4=65q)u
z6sSrp=J9(}|2hHS&@u3=fo`P>=?8^ayB>7BnLaIF{ydlK{ighUaAR2G%=D$Adeqwc
z&N%0Jqr&%B08Wnp_e(tB_`_8CFl3w+2@Sg~40|S5eupAJHPj;qCAOmP`&S8kErd)C
zkZw^o_QgHg`fUlyU22`se%pVkBQTfLU!ia)J2R*8pLY&IwBj8Mmzz~H@NfQ1>Z`9U
z*clWh!zT-?b~aL;Mhb$m5G`t3($pfy7A-S9pYbj`S&R?I*dmf`#|Y-NzM@lW)C)az
zJ4&OQR3N1k$3$4nL-?F(eW2#TOzW9A)EdIJ8SIA)(hH7=93W2vBmpf7elVkGhR<LQ
zsR+4P5GO$E9DH}Pvp+P_$#MA>&$WnHRx0zS_k=x9hldyj`rb&TEL6b6zqFE($(12G
z2=6sgV46lL$4253rm#coCtRT;G$QsJN}-B)`wW69bC_v-C3Vw`;g~7WGiq(K>4Acs
zkx}ggbg#`%KbsXe;S9;~W4mgKvu-4Rq;v8b>G5z7ty=E&sY7F&trZ8^&8fApE$~w3
zhuar$W_gdG{t<h>^@%*)KK<-N1Lf(DiBtPy?u{?f$9OVCTP7K~{Sl^-#@%n`#yxgB
z{YSINvj+Kj@5LagG1azNR^4i{HWJyC6|>CJkpmH$3=(#1^lnWwm}1y<28%zv?g|{*
zQ@nViusUmS4F%cuT-mM6nvCff`hcy##Zx`Td5G@p-RpJG*g?_Svk{v#yF>~(+b74q
ze8DLA6iHr7W<25&Wc`teb%2B2f=nF{Hw%cM8*?^{1=^<5<NJA@&J6h*IC1}4QsGW!
zh`!Nc=KyAZWb4)#EF6ukHzM$=-ljQhhY_*9lj^0MoT^C<DrF9;!KJLbV0g!E2_fs-
zo0V6Ij^ixE{kGK2i6X@-GaGtjGr4{u;_}%8O!Bj8XV}QVAe5R@q+poZGUPD-lC&8r
z0x5f9>%p63@0EsE#!!B_Hl}T{d3JHiVIRF$Xk(qvI<nU~gOylxt%+hsJ_=@2*4=rr
z=Ov;;<T;$a7MgPPwgqoP4!We?0fSxUowPg}21aXe^4a3K$hY?7k!_R@I5!271m3?-
zOjFl#m%>x1KZ_yUDS%f76sAF>#$i>7q3|lzKxYCy2uj_Raqq0ZD7`!oB}Ja_!|6p6
z+fg0v=Sjsf$uji9Gdr(Rd>~=9^(Q;ih~o%SeslYO&J2>1F+xL}z7BJ*k&#%o4m-?n
z@g|uwc)I!z#%{<1_fU0WvYpt5);sk{<%zM=It=RH)*;)^$@Uf*dew%6vNu?haobPD
zoy_V<>bB`4WHzk4>OMlHB^MPRm2u@%!pKii1(_fhsZj1y#N)r~wANF879^}`E&iJr
zczrRAr{NKaCZx4IXA_E?601WB>(-Pb6(%z4&5J_(qf&x~!dlI4eZCj&9HVYYKQAf1
zc;jUa1f;7oHWA9fPrzm>HlJ2-{u_WF$1-~&C)~r^99}pnOjl=#G$qYE3`+>l*@s+`
zoNw6BcaC^xR{2W*<Arp_Yu9}JYNsQGv9)}oY|9q)kF9(PC(!mcniRq$43#0Kte7u>
zJF386#gUwphnKi*k`uU~)eBUCI%{MLgM0KuNrz~_^-3n0{kt7YZa|m2P$u)SOuU9a
zC4)Aw1N<79+&9hI_6W4OOPZol^VZ^OZ5$ztIL?2p>w1};PxSeFc8!55xM>7@ZLf)2
zk2)=k96H?f<r|z?eg|rm)un=<9~MyAg_FzeNk|Pdu~o{v7G5!Z0iHEWk{Ndri`Ct1
zZG=+N{Ol}#zBB@wx+K8!f>p2xd%N<g5}zN9Wwzn9o2iSHnfY(btx3;8r7tyuwDJ&V
zeZA}$O~I<SHF;k4w8Mf0AD)3+SFV*aAIYW<x^cq<^$q-K%xzcny0j?btKJu+;7Qus
zKGv#^{)o2c#{BiGi+5f#CYwo%!d&CS0z#k&`D&sZSjuiQF(lT;mcZ&?HU(stVo5uH
zR<JJO%Cw#8E!fbV-Aw~+Hs;)j1`OK>!^+qNSR;^s7A?i9f$VxAodk=!CRYb7^fts6
zE%YC~>Esp=R5z*3MgUeBdrma6l*j!cwqAqyRCzAN4a0hD&g(E=x%rmEVxyr9pRmfv
z&8s4n!zcYszgvz@uQ$V!0Y99EShp}Q7%-YB$!eu<GzwtV&nkm#h3yvTx_#&)5M>uJ
zTy*a0CsQX$|6NNzM;u0c_q&b^td~#(gxuKyD#@J?0Q|qa*fr|EM>*0OPZ|6$pm$8L
zVWUeeBab1#vnTtWC@E+NCf}~^;3=j0mDlHuxY20(+8Z30ye5fL>O2=H(p;SX#-WOe
zKi@~qK29F?TJFZb!J4T^`YURxS`|X8`EnO0Y4KN+$W2w?Ux5tjaqB>?c$Ptl@DN_|
z7HIo0_axV3sQK;*Ni`Fz7jIV*j@9}Nq8%RzL(K7pb6attjq<H&_L~^@)!o5u<@eX|
zqy<LHuyqIar-!KZg#4u&T`>B(EdD^vaGeV#>2lXJSWp&ArtITea=eCA7weXXN~VvW
zH?OKNBpuh*ISpr6-vA8=3E1_zQgPM!Rpcu(>lI8?_?$>KYk(Pm&LURNN|sNcI<)#%
z#O0$9^?3rA;J67JX2MArdSKq6iDRv>y-7&^cl#$gQkW}~BN5p+qicTWZKJZb02Usm
zBk3#Lu97-mZO4>i?kRT=x?_rUviZrRAd`bg{pajY_La5=j-+jdY$zl<9+^e}9JZ$(
z*O-XaiB#&NuMS=jwm;G;%aPVGezpZY7{v#hZWLcxra=~s*#<OK>|ydFEa5f0>4~Ja
zhkMTyk!CXbp*@Pp_UOKJR#7@OxU}U%dFtYksOmqcD~SWTs_LfOKj{AzXCUEF!e^^k
ziV{g=N=~6O><UfJ7P8n;Vr@2s)~9h#mJp&y*7h>Ybz%J4T4N>2)64`0v!$0nTqP|B
zLIKi_4%n>uA`gX<1evo}gzo*7`Cl_(^UmL6I4us|S$8h1??kQ1_1Aky+NXAXu|Mc^
zM@QVw-lkjNTu@l)V!X)&<B)JA=TOzDN5{q%jGZpCblmScLLIceuY~QEiQ`$fM6vB7
zmev(9dY`kTH))yYZw?kUaDt`7M5f<<$Ntu@vFwYI^ji&Ts7Z_<&Gwa_d|5O2Fw`fX
z89qPr5SOAEe9AMqc!+Sg{>A=f!^@f!B!fO<G5WQJ+{t<L&BV8c*!3U%awDT#ovVW6
zWJG^Ndo>eK$5}5qkO7}Ws)|p%?2xcZb*Swn>4oZtmu<A0bW(~<v|E=j@U(Gh>8$9$
zly>tI2&^ljym#K=^#~at(zRBCmWHz$Rp(rv?J0Nlq{B9ykAHe~7&C~Y9g??atI`6O
zLN~wyJEmYSY(TvXr1qF%+%pN4Tn$q0Bpy5OU)Y#bY#!sQiJsfXyt#IGaGJ)xtO>E}
z>`#uwAal0;(xgZg_Qu(!)-H-iX=8VlQ|;qLJBff)n~n%pyW58uV>40TAoI|jd_!oD
zQuAKLw%=1FYG2_pPgA`x$#1L0%7JA0nP);D<&2%IlF}7)n{=SH%@2O@*^&80{uYaR
z#pG{}GPsJaUn!C6t7bXRc)H}iX}03{L<o>DhW3}}^%pa<)mLJP1g5fdXQC1?vK3#X
zY@dA@rlWO0S?Iw0vUff;vtt`5g^VJcpT~RN_Ggtmt?+c2sh?WL0e`8u%fe#F9MG5k
z?a)SuB(r?g{q;cv&F6Y^VcYYp1noP`U$A*^#yJHtNAU&cE9u+(DEp~iYa}+OXh;2u
z6W<A(uDs5}0ha|{@fjBhUjHRlNQHJi>AYyI`zEy7&({|`Bw~<Rz}mTv5&nn*85*A%
z^O|XIFk$~vVOaCAZbw{K#7Wfh!yx{%nk<T!tCx;aT!cqT)LB*pZj3xyVD)zapMRp~
z5oL0D^@Z_V1?<Xy9e&1g5ybc5m$FkEkcF>u;s;eF=u=BrNp`T}%bE*CBKGA`8wSpt
zO=PKAfa8?#326+rrRPg1EXaDzh}G8wKQqc*IRJ6yc+*R{rhZd!4KY>E*$Apl_JaS|
z`jU#pj_@Hn*PZT-xX`*PkMtXoVpZ&|s~!hh9{M&Z%B0o^WUL2HYFQk`c{DBj&shNZ
zG@Uw|<9-&o(KOOq9@w>`BF@P6Ds7FwrD8tX*X}dqNJKbzQqRd?sZG)FL5lq<2dMML
zYmfA5uHk@&YRG=SX=}jIb?7_cY6KQm*c;uy>(7SA*JH_&A%#YWrbVnqwXD$*hiNm4
z<V$G=5yS<QDNoFW&X!ds2R;z`#8`PQ>2GsHy{;+;cv$4@^HnY0seM9U1rx0bwGin}
z&@s>~lGQ`Y)UmjdxTA9-xVL+2kuP<Wf?&LAZf%PtiN-r<RxEOQf6h_e_y@;#P-Cn(
z^m1g>5FmD1TNqy7=8)WdZ{oM{-PoWAWHrA8!t%19-%G=dEW0vvWPuA4TZEW%mNeY~
zE$QLyVn|wDkyF*&ZEuE7-@b;EWURFrPwyIA$64!eGCY^lkk_yN8XCD71%7y)!X^M(
zUt~QU{+9s%W0pO&*=Md89+CWCXOKF@ADrc@bDTW<G5u6H2Ghifl|q*4Cgw$5yoDmX
zqJ`P7u_5T4Ew%6dt!$`l>(RMvguKls^vz7dpBb_N))b)Bu?k>7-y!S&2`}iOr$ZqX
z^!~xtlsaM)PLbx_?nx%%u)ZkMrGT-4XJT%TBS`fM@M-hFSvyc3KR?%Ob4bHavtXKQ
zq=5>}>y0MawxvNRl8CISyQR9rCk`%QR}L*JXc%T((J6^B^@4#nDOXRt()ZtZYkXEd
zclLJyzSxmbBYXa*mb>dzQZBYt^PkB6Zq+~0_}gvPnZr7xN7;OckH)8Qy{o&nN!V30
zA3$)#C7uKQXGroNd>TnJG@S4R%pe`{H-T^1ELqsve?}RjBY?wpU^YG_ns44m?!B`B
z67B_hZ%2(nmprJfx$Z_;DW(EdQL>4XdDS@OwNT};`KdeOFzVi*LA<*c2dX&>cib*h
z_&vv(Zq^JL0%s~ED05swNVZOdBy1NtvXC#lGA*dG)yw^1#2#daR^ugJJdIv1hHALR
zR$p55dIJqGNXc!v5mS<@C-jz6{k(*GOVKn5-Y#iw>D|>~FZk;vi%XXdvrE?=QW$9J
zRI4BW4vX6BEf@*{3s-Q+WLSF~kg)nH%J%A+%?w|s$p7}4Onc^kOJuFEcJ)EP9{A<;
zSrEQuaC`(8MndBEwID--d}rA+tu>%!9$%BSm#2s8H-fi;_~YCZjNYF(RLgw~NFl?R
zq&)4&X~YR=+{m)?I|`AC@;2moG}R{S#q!pgxlwt+ZM?@MB8Ei05Balsbc3@bPaigi
zaB=&i#Zg48#MNqrcxDNX<6#FMBHfAg%$N0eoe4hDev!p+m`hq>oR8t}89|2*I^PD;
z)-cK=l~Wy@{N~A6DM(9W;$9B2fgU+qa628e%_<V&##E$*!yR(rdR^<ecTQhd+`bKa
z_)4&H0zby&Fn1#d{=(Kvt{y=$%1wyCy8ORrI?J#qyRHonJ){f_-92=N^w8ZP-QC^Y
zE#2MS0@5wrjUXi@C`gG2eDl1=@%^7ad+xngU*}S1+2-@EnYB03arG;`s{b*D`(?tA
z&4VNXdy|FvN`kfOd=lQMvonh<|2C*&&Oe4`$GEu?%*u-X%a&DB5thX9`SB21lg1SD
z%}@Zj1RdZND_nElFAZ7cDs*S$usly)(qKHE3sj35R*}20DLRc_DAPqBxe7~RAaMF`
zTJkAJ{Ou+(9vLuNik>At4GJdY$!Yy{i)m19uJR(hcVUm7CL|L)=WV$E8@dQdo40jp
zf8slCTAuW1_*OnXAbjx0FsN0Z+gxUO(Ve+tPu6J=(z@OH@_>h;glYyV;6Xg7pZhXC
z^;sQS<jI=El5=leyc08@*2Nz3a-cWpEL=HLo-ho@lG<|9PF25@qB6foKGWu7#jb`R
zo~>_C3|SJ=*Zh@BnZ5?rl*t3gRQeTX;vRp<C4VNu>HZTC)JMQZ#{Y#8B;%CNI#XZ1
zB}2f^+ByX6!F)T-`I&N$uziy4jwfwBnIbyo^1cv+l(_86J$t}AhYatj%3h=Fi6UNn
z%i3Z^oSrqB<Y6gA@iC3q>N%Hy*d)U>NhZV1u8{91i$I#H6=#ZH>_M61)*Y{NI;5c=
z1dLTgbaQL6?^h?5=gAMF8~;xjU$T3*!G}|$eXPU(eLW^FskZCI>*$Hpns{L|7=d5W
zMh3-gqItv~1UGbc8TEbRN;DfJC%FT$6j*r%{z+2*4SbeKVgCEsb#(-ND}Ec0zi8vS
zI=DcFxGgn~O_kV}zZOh3ShNObgPQJc@lcWB%3DKlq7EvuM{&>bPX$shs2uA>W3%$f
zZ|1qBXA)+ea}T{O?Cl^Kxa)ifcL>Qn{mMjDt7h;|_sk}=3iAj>;sSdDgDh)^+S03j
zSS;e}><l*dpDA4W3E{hh;%jCs5=U}U404o3grcfag9q#|SEYbN^_BH&0!>qX30)kZ
zLN_K|t=41FtV^@srr0+hXVer0?Yf>WciD06B4NMZ$5S2|%o}?SSFFVQHs_KuQz_zl
zeg;dSHlu0YVn;;QRXc^rewCwr%X3g-<=d_MRMZzVN{vVi>a#%tdMDiOvJJ$_P5NBS
ze?5PxN%@?j^fhw4k?Cy97T8%5EKkC}>;)c}osCco;}A$zgnX`K7AdZ^8QOf!up8tu
zo^>WNK>wT$L86<VTGzQ!9%mLAE^^=O?w4dw=cESu7k5*6Q*7Ls<BU+l+b1=#t@Q>`
z2ZEmVes(bLTYi``m4KHLBLI%Ak`vQQcpyvJki&5s{0O0WJ1>?qeFUe1lLnV#^Crk=
zq5D#cJ==JwEEwOUx3Zy5B{{0{tyO!$(bM`3yTpw?Bb2GUn2+IBnhAsso>w&in<TH9
zaQ4D3$*tE|!G}27B(J(JM?B<R@4%l5NpIxUt^#BR*jDP++ewrKm~ub4{9T@4u()A#
zUdrl5w169->**tJ$;8_2N@6c)o%7D);R+EMpFPF>CpeZ=y-gkt<YOD(?4aOO?~$ap
z1b)>2Q{9haZ8wx=NO@NrSAs<Q$(&G~dF;N7I=Lapgy$mB3|RExt1K0gG@?~~DRF8e
zTRTBMZLADh3#(?Qik}9}2X`#0`kT92Y|}7x4P^F;-us@k14^@=&^mN`T{A)A(<pE1
znCrK=4a+ONkq)L2wDq$*QQA?2{dY;WPwe9YWeb#F;kipQ`J|<4%<X&y`P3UkB7m3#
zpI(l~enA{nr0J!*B3?AO3FECax;oj&QVkE&lBIe5YrnYeHq$CldHP?KN-Ku(sRq4i
zu|ND+f85A1E!g}OySY7qbZ_J}_n1}KWiGu?gMCc%^S2Q#b&^|(a->T-E*Gxt*d$4t
z93>_t!bPGVa-83Zp?nW&BdS1U<{2T+ybMcJ4z2<ue^Pc=4ZuG$-c}3+#n*^2UyOp)
z@D#M98*8-x0T5Z-_7ZGMD8q<f^g_?pt*aMQ<N^af^vJ}kBTwe|e@Iogw3W~VT6U20
zyh=~oR<!K?6GxObzo2<>{CMaz+{@HF_GoLr+{AhL@M|%2D~Q{X-)RRG@!ON;TiT=3
zmVNm{a)P&KToj0H*gMG1vT5z96Epl-U9HI8DkPt+^iy0EVu_sTRc{lolS&^Ws0TX8
z;{BulP<rq?KcDp~d`BG8^*<_c5^_bPVav#$kr63(5~g?dL=pn_F%~lD@|u+D3Kn#Y
zq_z(51ec`~u}^&>n>{3xfz3gVKQszaH6rBw6ADAUCBN<O;(RmALD!~<QxGSGwe5of
zOE$m!a<AaS<Ui&B1FRY0hAyo5vJZf1U(Bv|2-mZM9PKq^^}^5?&;HK;nQAGFwA5PV
zExjYc^ULaNuY&t&{3eOwdvkOV5}S&7waCdgibKGbMSOrm0G%XyC-k~uV%?QDNh|(S
za#(bfXs6=WA;xoHTFq5?O0~X9f!wD`BLK4{uv61qrKi6m6{7_ia?x1@u4(_chL@`G
zJMV&JrLuHbAi>{yt%{I%7W@nSsGHKU7JtwX1+x6s6E-qqkn+#-O1RF#SZMIzT`OtB
zFiCoxAln4LEJKL5y<?3CQpcsaow97BJc(`e-!o6{a9(GnhSX~0d7my$fSO}UyTCLt
z4Tf6AeBnjMfPSy~6dWxk`VPS^9{S^goxKLlM03NA>5lnQFb~=5_Z`lh^MUHD?mKh1
z5k<kTvLE;D``NVMhZajM><#=Utoa|7*Prp4Y<xkgUcYwvQi4)!32JrQDP*tAbsVE9
zfMw2hHaPz%F~Ra@80Vfv>%=<+f7YZpEBo7d_q6VpEdc2sA30^@O1AIHs6@+=x01>;
z8_T~jspRInQjq`2&Gh~N&kc&MR*P7GqxyB}x&&zM?+j&Pt3h3fvR_z~mZ^V=8*~fv
z?nDDEeWt4KYAixH978qXNllegMk$`NH|NZ!gu1CxA+<|p9a+6ol9q~UT-?5Szr({9
zt28taP)A>PzJZMP_aVXi4(B5hko{(|Op(TB$8QO1s%NU_YRi_VeUK9~v<V^h_#Xc%
z?UNBBk5!Zt*>l|4bi52F9lNg<LA6|~H;ZYUxn&NLyzM<FID9?P0Qn5@)58j013<6m
zjR6CG2G|IoLdy@?Uty)~(fV>=w;_e;+M1XS@u5@@#p6e-F%$l^#R+%I@F$~&ocM?Z
zRBDsDZa7zfGeu9rhDNETK%$t_$DzIg<_y+EATq+bfX{^=%CCHC#S$$|pkjNNOKe=v
z`N<Mag;NcjxA{$!08m$}__=}k6vxyW#s_jPK$8jYsI}<%Kpo=b#*g?$_V>r{0yej}
z3HV6ZycwC4Pxf3RtxfjI1(-(;Id|8l#YOD%S2?QRrK;vv-~H1<uF$?-E$BE`4vM#6
zmJmpNUtrP)NTKPOA;;Oq5qU{T*mMfpr!Wm!)@U#&KpEk-;E8u|2?nJE*?zmiBSnh-
zfw#5f^r-Ii@Z30Mf%DEj5m>r`Zb1v9NN)AJmK&W#90gVDk^b%xzi|((n0h7h@q8LC
z^}@W5@x-MXAv2>G6Z7zCJ{0~)jT6C$VWQw@Cu<zZWZlKDiBcExC6xthNOGf*UM1Z#
z;CDLn?o>Q$MK8NU>pNn)pF;2|1RB1j=G={JcT_Cm-BKUJUsJAM^H785fraoV6U+U9
z4o9M5cuEuaU1P<fww-Vi&FGlakflgE13QHIYu&IBoW!uTw(^cvzj5Ck!2Igg?oBv{
zE&^Aq3XcjSfLVIvANEyO&j@)985~jt3Fo^Ts;H)9Q~?Y$TNHY?<?SNOA=(ONtLwki
zT`p)ip_s%kQr!C`o<I;mpb(&$K5Nh9*S#?EnF2FWPja+&52h6Ik8UULSnnP461sKe
zx&7?45<+VzlvAkhnBa;|9N{<p=~b{Y&JIMk%*ER=Hx^P$%{u2cSSd7p`?YAq+n$GC
zU+$oi1RdLWde~H?)E;`w+68MF=aCW|2SGN+-Y}=k#jdnPBF?bFOqmpqOsZ7v9BYA2
zdGGi2)m8xdVQQHDt7*lNaHAM>iedABv0@xsFKS&h-7Rj3de^$NPrSrl+~yewAmC|x
z7Nxe?Y|PWtR-6^Q-L_rIgBHAQCt)M8D_%g`MyC39Tqk!vesTlZcD*}cROAf2GI9CE
z9`b1je4TBqqGrAYcWK`?N=o?fZcK}RwViBZHH1c}p%LG<w>6*Wq%pFQbIbl(Op$MA
zFOb<gO2kf~ETt6ZY372)`TgSa9n8Uab@)wxV0W|o?+)8Ke#{T${wzAmcqSa)YSr)+
zCD_QD=MlSQ<Ev@yz<JRXyErQYa1$5_57&PJ#$6Dptx={w!l)FlKV7Ti`_Kz^t(qX-
z(ddcti_l=vyT}w%?2_oTHY8LbB(=Yvx2a9$%*t|2c)&)iP#~Eycxi-dUMEtr{zce<
zXexBClbF~>flASoQQcjr>69W9N;fbrB^pgZp)RC^is9js6@k~7s>a)aete6-9J;*=
zM|#TTg39151&N3^b^g{TwJsQpQn<eooVRneLW|6=&w3rBArK>J7Zc|6PUdy;_e;0~
z+t!jIA3kMYM!8L-fkWqQ85tV==#O<z$mFY;wOVDb_Cm_*6)|<!w%N+Ouf&QeJ7Aen
zLQdv0l9yTyCQ^r|Z5;D0pwJe%x1f2)7!Pr^!3$6!7z0Vo)V@zwLoWa5U30j*ozXAO
z(^gK_&Vs2)XUWx&k+YTm74@1??lXDtBS@&(K$UU#^4B8a9_mqea@$@7Pf^fxnpwmY
zhyLp31Xhz2N$0;Jp3?eL^Fy}S<JdcyodymvwIkQ7^k=ekaow+Ko57qfZ44CQZa))L
z(sy1iAJl(e?eZ~v!CA0#tU`Y$N$?8H>ZYU`ArA?iP4LFvq%v&(I3)_cM2-73X;Q?b
zIf3pMEi>UfG3pO0x?@vDTV&g$6DEP5kF-+Y70`oY>R1LdFE5E|E2#Ls%S}AU@>$$l
zw2yqiarl7TZ89R3C>WYKIbDY%P9z0v^xS9hn{(P$*UA`v&UhGCp*Kh~L>9E4RN%g)
z<7A-i$Nwt&Ty&olqd|RCpd#h(+^&sAM%J5F8q_>)SMS2O%Wtow&}Wbzq6%-1m4x#q
z<q>%M%8RIh{I#b-x^YSWG2K>7zK5C9g!%QyS*!)6?W=iDF;#ESy^ooQZddW!deAmb
zwhoK9FXKd35cXy`|3`BA$1sZhHJ%T1h{9Cq#X<Z|0Z`-G&Jy*w5#;{D46QK%tWLzx
ziOmr*2)s^BCb9#q`oU+lx+#Gzj{yxShIKUj852G)4D1iGf=7vFlAS0FpY^FsQS(aI
z_7@j05y-Zdpo*2-f5dHkmu5(STb6J@wCKzaEt{1;4}Y_T`t&-#SeZ(-Shb2U5^GD!
ze#3G0pO6SGE>;*7-Wh^eIJsOFHpFF-Lc|fyyQ6C1V!%YpEK~;jd9z$0Wbm@Re^S7X
zslr<-3>o1H6)GJL$=Lo&fqH`<JuAGQx6ASoExTVE?@Psoak6z`hn|vQNVkhqMoioq
zRiTVuz4&E812TxJQz>42_$Y%Z0=JGU7ODfJy+SkkU9#O9J4`?|;(0ziyg*y%_+79K
zV-fXJ85jr1YuClkgWKPj3Yol5T*PVIv*5lh;2d9U{&TZ9S*C1#M(X=IGV3joN~A6&
zS>V@3^JCy0KwR&tJo+`WB~I?8*as!b<azg`EZMJ4+|EJ6d~`oV9R!wf`H84SFiH6{
zklKN`7!#YF=x;VYJQ4d6=JE~)bv|*gN^=w)5-laJpTuvoz#HPw+(!j0??c<KQ#}t+
zjxTjMM=LSiW0iO?6C6)vb3K?vuxlQFwp#J>oxlww(+iJl<dLg;uH3P8%`0#A$kyRN
z9>*h>@^d~R-<KGwHNC&_9>gy!UbF2O$al7;6zS~C&QrmN<RzK3$9aZd!&aKj;d^#D
z-i%zZ_HL7>ve6*k3W^)*^ic+1@n~u5B>J-<>ST*MDf~#?W+YW`@<m@%!Wfavv+&U;
zw_(I_aGpe`@?D|q$aQEfrE-zNx6n{!Qcq8w%6jF$%BGxE-I@KKS*YG~5+oy^W+TKr
z-A}C~R=;LYSAK@Gd(?QXN0Zt37iNTrbSw&(HKH?|eznQ&=J_u&WP@QFLjn0$(S}JZ
z+j+rIY`!?BKBZ=}m}W90+8&8=0?PscY(I*5S|C7)UJ_m-uo6)4QulKoMLd$5SF`-u
zP8ra#OjuN@YBAwN>a_@kYwTkf0sCZF`hL1m5yBWv8|wp)$jRcfYSEdT?Sqt;fEm<?
zC$&(TennFG$s9rI^8u2O6+xHXxXIX8wuuE_Wvzrdvv1DG@_$I_U-DblS(9V;B5f4e
zk4AanrKFWij%uuFa_tkZoVvjb1Gw4#T<tN%rtw&Ql~N=>0hi?8xwdlI{~ef~NUQ`A
zZtWuKvTQA#3h?FMM~OySVXRaVI_`G`g?XJUG92_cRe*-0^U^w0%h>6kF)urV-kvqj
zRes5c=jEp;*h3s>Js)V9?b?)lur+M#D^;NUcJR0ti1UlN;`szrEjGhwg=!44P%#LO
zWe>8K%<gDkOi!538Ac(e3x|uE&1zux2Dwf^XPL8$p3Q7}bMsp9Zy)uOtq*fZ>Ui<C
z(uEu@9I6etP9G36BsyKj=VNtjtv*Sv39np{Xye_gY2YdfN<!$MoVbUxX$O42c&=<w
zX0RL`xqploM3LP%Jh=pX4aSGhpw^4_G!=s(cj@9MAEF$X`^_x5k`*7s@{1+^ZR9Ra
zW{nEiy8Zie)7AH#b;HnOuGQkpPZ$i6J@_U;%=~B}@Pr%ZhCk$%|GDVp>#3;E^HtY>
zEP?-i`JaFs26!yGCm}1*4ZU8DuePmUCk5GP!67A0yhnR@+__@9h*vwwx=}I_u-uWM
zl`AC+#fI0B2vcCd$gB~kTkYca!eFZ1|4K`o9EkhAT?lev`A4eoUoqWxF5D{aAJIK#
zUi*j$3nf?jPMB7G6b8bprr8f1V%$RGV!T{EFr$f<Fh$ueIGLMgUBscfsDNzc2ujWp
zET31>y}GG=9;wjzaMt3|gKuEZ+nv-y*|}VS`9{dH_!|I6F$~6iSd1UJ)KM^1A6h1Q
zlsXTj1Y*z)top8q4w|AZ|C9DZ?P{I93Uc`t^29loWaPTkG+D@x0pKw7NudV^zup#y
zTsfGa@59993n-%3VKlPIeLuaLdw&f)2X8+7$KQa7Ap>B{fug6?|L7Ai&1A#IkH^8c
zm;V%d-abAiFBc!g{#}pSJj$RzwmI_X*rEuVp7B5uJWW8fQn1rZry8VFSv`(*e8b1!
zuk}C@cw}OFLJ|aT@UBn@-$ChIYLTRI%f!hcFeu5&SEm!~`Va%fp)8qit!j)ks%W&#
ziECF{`#dADO<dRuu6N?@h!J0z)U{0D4O!Q0C=ya$&mgTzq+W_%?NsGZT<P!XO1=k7
zD{!%I$_e)RQDnW5(nuCI#mOa6Cj`Q|U_LE!izzBj{DnX|Gl?<MUOC#Tc8RIU^`+I$
z#?9fPxX&$e9C4y*b(J@JUT_R_Ld={g7VtN3jy3OUzgPyYF+J(`%AQel!m5<M_2g9F
z0ami#?yC6zlcoPzj1kp}w^{p7Lo4=slBW3et~%rnUHaI;<awJJMujoFo&GTJTN_5}
z{Q@J0eqH;Ia8OuS_#atj;Up>8^WQ)Ix2<-+C+?($zB~2>!_TWg_D`_^m);Ivo4V!?
z5+9sI*6ufwzvieXOrVpHpyq9Yq^5`yKV39Q*-fb`#wdU(rTYZWb`027AvAr745_{z
z4kbCGA8|Cdyxgs~)L4I~z%$qk8x$~GsV~~c&8~B_ww7C8bHqLMi*HoV(U$k`4&-MX
zYr5LROi<dTz*S^$wy2Hou?>a_;wpcZl9;Xw!o2z5DY~N9dOv5yP0;3p-8ndEB^AHC
zAfquFDHvjV5+jEsm%~Z?0l_@!(So@NOBs7xMRSt}824y{rQepx$p4AGeMX$4FS?~U
ze|-+D=Q?YE`lk2yH2#azT3DQ4(c8a;w|_812y^K<PO8tqZ6W`j@6q1g-u(Rh%C|MK
zf1_gmuD-oq{rWfm>#o=Ti_qT9e{`L%14{#&J0i~;MfI=;j1zy*V`7I&{gLf<EB}qQ
z*~2Y2^OYUWOD-YFKqYgRyv>ilQIi-hZ5~Oav@Xs&RKJmltw&<rSJP|T#+=B%Cn1Xi
zLG7_XK+t>~PlJKp(AUEW5iMTtewWu4U*ufCq)J%R(Eja4aTue@O*9eiLCuB>BPu7T
zI5Bv8f;h-E?NddqDB84|4w~{Cs;Mg-v@;?u%dwrNEJ&a_adX<3%cB|*8MOfYWaH^9
z9q`Blnu|L#oX&Pqd=njS{CT;Yuvc33EbWOy0+`dJ8lDiGN^Dl;OA6(WiwScH@=P*Q
zim({`#`>JxA8b%Gs#3T8;HS3TSSa8op>6W|JNuE@<v)n>N727$FnrGAosSo+4*Val
z2=+%>4E{b_Du+=;9_Oz}j3QeB2XuHaQd*oJjHT7K$tS)5ksxlr*Prq8x|XkCTm2Rf
zsBILn+xrwirt(s^Qx|b<X`pjXe2-{KYl-$`d->&|fdoZv(A39ozQ^t%gz>5;TlOOK
zL%-=FJ$jWASe&GTwu*9Yql{t`T`lPixF79*`_HUX#%*4K6dfAx`LgNQf_tLO;kaO5
z)^He~yk6X{g3*H+dALef=*f2Wt;r2a=*i<C1xDI=R{=E&>@8C7IGQIA%uMuj2wtEI
zjDg;nyFfA9@qynci<9o3XCjU080tfD#FGAf_8c61KvEP+!*|;7^8i1OgvEZL2q7JU
z0j-ysg}pBcLp7^aM9Pi&|3d=9SizrNzW=9DUQy;R+~My5!V0~L+-dM-RAtRJJ};Zm
zU6eQv{0#<(tHfht{Xud#Jj|&<J-lo`*3UHiuDHd|*0YS*z>H09VUUt#!cw<^Mh8l>
zA6F~>-*|fsy<g-`x7aTlKPw3njj@pn>Ns(ZWVB}tr-gKe*v%k_^V8_I@$@(%05Xf9
zyl(@I?G2_nbmjE`p^hfp(FLf4|50R&ICI1k=QE(ASq#iGq0x2STu<Py&Pr%DQp8{4
zR$N~G!A3su2-Q<bf#Kl@xDhz8c(X8YS#247wXR4l?|`zCI{09G*UA0r{-D$$l<N9(
zl9jFdMN)vURh2PgYsQA?Kl=`|<$M3x{J_B_r2ooHnXzuTm)Fg`WjwL*Ge)+?q1f}s
znw!~gvjM+abaO1rVnhZZbb{Nx$jV?!M6QMbiYg7y2XsewQI#8xoMI_^p4TsTuUwtK
z1mUiu%e)eF>FJ+{Z7eEeVzQCL0BsxI0YF6KrsU10Sh@HKB~yT@Q|A?OdMY%NldE!|
zRU5Z|qsB&yIp&km?*MX{d2h}~!^*@^DR@nQT!cusnHV|R0a-_o%QBr<msUBPJ8IHd
zTBV8^ZdV@txQpfC<1*7k>(b_@_5Ys*pa{t!JYg0*In_xrzqjpV?F{|)ap37kKE~pQ
z2Q><-)oR~MRPFtJOW6g@z^56L|7g*BFya0;?;WSp`y{>qf<4*p{~in3LPC8m)FS&z
zX`6s>T|sX9+yoxpBRBFL`XoJ<n>0(4%DG0NeI(a?Swj*QJt@60{C+{UGecm(E~;6{
z*@?eZ;ZZtVa>&DH=98^j1x0u7lI~wW*G)D*eT?g1C5*MT;)ocvBLFlodanZEVl!V1
zq4tZ|@3nWTnOZ@NC4kIzp;bq($<Gh);<KT#hbE&f)6LaJrw9)~P<aK}lOmpNjL`6t
z?YEX85E~^GCC9?R7(vlsV$B>pBX&|VD@Bp|?d^+?A%|$hsLeoR5fa~(A~WbqZE82t
zkL$THIk(VY<X(i^g`Wven$9SUDXblRHImu^?p5csB0B=X|Ni_(WjQVM8TeuJOR(9+
zGj$AB*ii9QDuEm46FCF5evvL1z8*VAOj08Zx)VXc56AMousx;kZQ)e&I4bey)|5DS
zS6I0jB<gi^L3o0<s&psfoo{09O#9AFT2>ZrS6P)Z4i<|sM_5!eG9z(4?FoYf+nwH@
zYMRfCqFHgs$jSCHQJ45Apfk>40IVW0?#OvW;o|3qnL#3oR@YXM##Qr_gkuR-yKp#$
zpo<o1Q`Z8A$c4#o1H4--JVLF!Rhvs=0xPM!%CiaIV&wJ&KKn=@Qt@K~E(Um>jZfE~
zCK9r5+U?oRtOdpg_)Zo&OBu<~&9W9%xGZut-t;`<29ncc+`X7FecdK9KNzF#A5W!!
zF!IuF3cPIn0uX+CS`h0EA{Pt(2P1Cuf6p=yg@Ns@+3o`Smd0^mxfagS#I+z2;_nG^
z^@*LB44|2fqyhk3Q!j%_hE9Tb(kR@Blt@EbW2vOqc3F{$oaAMjg5R4ci^6LY6DtJ)
zEFzcYpU_o2VvE~^i_*ZQk|BJK^7hvL+C!a}7Io`fP+Q_tL>yFiQKHf+JlXR5pH199
zhEOgAd$k$t!{t;&0YxGz1gTE@NIv_eq0u`oV`b9WG<Jv@63-wG7BkeX$WqprADI+h
zTql+r)b*Y>-U<=9_zSwJm@&PHl#Ps|%CIw4q2C!5M=%7l2~c6lGaY|pz+-6h8mQ1(
zth+qi$Wt4It`>2cdHAB({ug4_;VO`LbxYMbW%5{Z6g38&Og4rQ1CIpuV6-n-OzF`S
z2;+SzFn%xzy4SnBu7|~tBzxD<|4}4ha6s9KR=BbEA>|27Sn{<VaTEkLhXqB$=(qF+
zB5TJ3v7xHAki)A9<8nsgQ9oHVr=N}42#tDqM#c?Y@yI`Q^fw5rKR&oxgTPca?q&Q5
zoPPyUalOoU%To$!NY0|asxka!d#njq6<HTqH(EE+b;%P{=P&Si|I2;vsLy6*5z}$_
zZ_}0|noa<on)+tZA;!VO@5|>^)Z3=FdfXEumEP4{L67b73D|^vH?PZ1)O?PQ-s9wZ
zoP|uF;i`i6>J)LGpN#<e5Ar5FuL!|b74dG$K2zq!T>ar(!7yS!m9UW1%m%f4P_(#B
z{MqG$Na~*c5iR>(svZ)!L&H29-O6=r;w7LBVvy{MNc_D~a|$~9c_!#w$Al(LCgHA^
zGI(=YY}-5_?FH-aj_57rPlSU6w)G$Pu*dn(JNVq2TS@x_1LdH=wjGdQP89hb#)-YG
zhy~>ZJi~A<FwRETz<+GUGg+}7{l=mt60$RaYYNji3X;Mg?4*BQ*qc&3I;TIDTEA0x
zB?xqmn4OuJ7FuCzEc^D_I-G2&+|$-Alowv%Ts8U4=Qc$E-+#B73<NR0df3&-%)Psg
zsPj-v_g>|gAQ>+l0BDr`BiQL(5Gupa=>1_zL>rKvHH;__y2%A%)SM^$KrPwc#BBSd
zL4?E&%mR&`5#!^Im-HM!`7@xF99I}t*L6iexFs|UsZ5*=2$P|$B)>I$3YCA@_8%Z!
zJ-YqjI)A8?zN*0X!_=47q`=lHO~LPvi>^z1gQ<T9G`$DEno*?*Z97Ot6T6TJ=21_A
z;$9RxTUtC(o!#&fp%tuNsuKnkI|Jo$IG(qZDI>6`^4tGNdt<n&eX#um%$0%vA^0}G
zh-U2?5Bx{mf^C>kt&Z5_AGk^4?>oSREyoylc|CCnhA~ghirePx#r`JE3!X@`w2yh<
zG$tN}2o>7M;`RzsbYx=a!6`sDJC>1b=erh(IL6AdSk^8ZtasY3T)mAj`q^r7wQx&S
z5-}J+?-v{ktaS;!XzX1XPo?OwozCPn7cJ9&c=PTD+hNRO&tOyzpQt%vP*W1ZBcW!f
zJNgAx5TW56BLb|z4|&T964QYB9A+zkRD(%PB80aOo7*cI13qkhXnY&7G7E|R3?(DS
z#%xn3?9jg;tDYq|CHUsuCVKMfbo?u`{4d0`erbB{5LL{seUA0y(a)LRa6$6V8i=GW
ztGv>Re0Dq7e&Pn!sL_Yfwma$lXUG7<2q}7i&>yD*6I-Rq2uqZighBL2W&Yi}|JaU$
z_XdOa4ucO4LPA2YZ4wTm_qD41H?TDvRnJfVF=B8TR0;&#4q@hU_c5ce$m3pyz>K9|
z=3NNJ#*6y{`W#z1^_qXYM4t(yr>Y!Yx^<6p$*04TtwSLoGaEyCRmcAT@;AB6-hr7|
zZ*g(FMqmk!0h1uImxdDjMb=%#*_<UMwi@F}pAok~Q*mV*sX^uwd-KOxVbkGN1O|@C
zh~Q6Ye0nV&>pOgLv4|7ej+CKt&UU}m%bmv!Ldz0^bMOCB@BE=9`gfZ>oJ&oG73^xr
zQzp_71&B^bAId2%(QRJB?i5!O|7$XWnOU11$4X;y9?1gnW0Pe9yuYV*O)zTZc%@!f
zd;nfix_)b;6iRqNU7nt8?tCffr$yw#6ev$nmWA|URburAned|-@gD7HN>Uy%OX?}+
zvOCN8E*=#Jzp^fT-+37nYag@&;LG@)mCq#D@8u!nzRlJ<a8=2LamD+kX^Y>Y0a`Lh
zk)mS}%Uo$AQ?zXNO|&Clw#oI$**=#n(sHaO-J)=6maM3_d!KRruGXX#!}BWRhv%)8
z+o!-=Iqv%BUCr+V|0^67qqIp@cou@-t@`YNoK&xETG8!BU2N`@yUexR<}-R`-}|{N
z@t}%O+6Ii9!E`E;I_zK9nz+bh6`8pDKL1cn8%Enx^4QwIBzjuFDI<i}GPO8C3lpE9
z54id0?5HuO#y5rU^pmEX2vgjN3_Ay2MU@=6e&*7)i{3ro=%H=5!_jH+xP008a7tqZ
zUH+f&cvz#NqfEf>#0j$Tpm^5)Dd(V9v`|tyIsg^l9hY`p67lcDg=DrH7FfV8N#Up0
zCVOtP@OF@{svViW08ovD+@#IM*11Xbde-TZf7-NSah^H&W0Qz`sGvSbxv-}xgIEy$
zl~K*^2~`_xwmZg+TT-;QjM`x(UHBC!b_E*BM395D@E<*^7PJe;z-{}(ym#XVPaqfr
zp<|i@xqD({Uft)8<PV5&Vis%qvI*5)LQkHkY?7fYEWuk=4Y@5|XHxvfm<Z|lz_vZ3
z&Y%;cL-TT6Vf+^NEaG&J6}#D%{_Q?DD^Xl{Sl}#a>8<n!>rVF)$_eT+D*<lBT?FH|
zpD*DNNtBxgK6{1Bm26c&2ksAuEpT(L5q-@Gg<$c{pFTbB<FNxEqQvb6KhENm3SKvh
zr*Ld2Ry1e~5C5T%ocJklHse3B?@(1|Oni{gR@kd&ZqPm3%@bKb_4nzh0W*#57`F?W
zD19v1yn3yO?yeN)_q(c?F$1GrOc0gMcPgs%2KUjA3wK7tGYo_TH*46eW6{cdGxA16
zoCrfqCWQ+%0|SnTSM1a{5^Hc#FAeD%a+sn)9=zVRCwyuG3mjQhnMcV8nM?EfROO1+
zmXwsYY?VV^oYL{%KkWX7+B|a4=!XxY#tMEO6uwA!kWXnL@TXC|-gco?igXKz==`2*
zw=67T5Ie~_<S@$u;?%X1eYX6TcbstO&H~_TFT&KJ*|{1z_fs*ji913ZN>-M!;>Zff
z7keB&z=;vSrxczA`7OP2MM({~4#(IjhOfydHfIu2gxca;VB6Aa;6+vB@zA$7|I7%*
zNs-Xv2DJeNn28KsEj;2N+xM|sgmjTAJnhlSE0yMZN4Ln>zIVbj-##V<EkdY&fC2&t
zksCgc$~Zo>ct`;gY0kRkXrjDu0QKeK<A!=NwRl|Sx~WWD{@d+|T))(1V&C7LW_)aG
zm^&EaLX$6y<gi8s-^lFo<%cKxVWt0^Q(ZnWk`eNfuaGBW40mBH%gSH-q?>+@G~q79
zkNHNde5_;aiGIz6o=3aPYdqd{{#X#47)XHGW=jGNJKepC^dwt9azM9IRxD5m?ixXk
z0r&zs$`yt4VFeLa*=u1bnT!jcH9e0RtCQH>EG$gVhE5jB8mbhkv5BVV5+ew!to;mq
z3Ml2`7z)rqQd*=qmZ)v_DXtB;V=}!zJ_WhEOjw+<t@+KDf03q1$R->9$@Y<ayu)TR
z(~=M_ESa*~L+fOBf*=MD%`#72#vNHoN49~pHdZ`SAw!)~w6E5gg&<yEZ~c%PMAcwQ
zhYX;;8T^#bEJ0&;xx2U&%>&Id6HA=}SI+~(oQ`i7&do`^h1sVxTZUxN0*ryj?%!5d
zO-Kl%8!xP@$*z3bD%n{Z@d+U$-;`!v^xHPgIO;>^fiLKmXbL;0-^ZKDj1IS8$w`bT
zalOzeJjDQ#MOYE;?R^m_3f>->RaRkCy)i{xD18(*iL~~}czoQVFFq5MCPlYqd}a*X
zO;Mn_Ag@_PZO~2qCgyh&{_R}?IXDKYLz7HC+;QNK0*KB`WLD~><!InofH0eJ+Q)uY
z&?`+W@J0$vY`{B829|Iu++Yb=vC4E>g{tgJVMw$!kd9h@CzsN&L}V78Q?TXD1A?Jp
zmhFotwIv3`_9d#;%9#+icWW%zn<&1Q5L4Ovo_Tu_f4W#|jRrl&3~F@;M56_w#m#r7
z7jeef4s)24C0<$FJpZT|w^k?r<ehobxKH%5xFuT{Bj2*Qy_$DFWD{Q!JxSKd^oFdG
z-x4bkUxt<7Fexy4KJu1Zc@KQmp8zXBPb4b4q2zl4Now);s_J>@63p)-GH=<cM2tH}
z-UYkLH3@wBi}K!I%G<~74r2e^nm{%g4X%+;CuQU_TG*O;^PV>DOama3tIS!vq+wDI
zm;vfRAu6S;%iygDjmH^f#yDN}Ddm=T?X)jbMWSz*!=#(T1J0d_!d2f9P1+{yuR_p$
zZBaEkdiJw~T<ak@TdP<!0rX$wEG-3BdD-Dx4^7Zq4?{^RtZv@5N=75|UN>mtgDl-l
zE_kVg`=bGtQ_19qu-kndty>)|5A-zjoR=N!%tTb|L0n}DSC_rpIh$>MIMx`Ea%uUn
zs|nQx*0PkM<I!c*6!5c1XswFqqq^>mEByIm5rg<PpSaTdx>V$&HIbRLF|IqVU#s3N
z%H;Jf^0C^046jgas7}IFn0no<F;RmbLet3Jnb?$^3M!x>V_K)n)M6CMB_^;|$sF7F
zjKcs~jTCJc(4(p$5+b0dr~7?VA9863=W;$b@675tE=P@*?vsb=;((?iAL_8TWs2H=
zfbFF^WqH2=ZU#`zw<e=oNh3F1DBKsU>H&@b(hA?Hr2n1Mb;9+Eo!<|AF-(s>1gz$Z
zE9*dg@#^0Ul!?em8N&YLj|%hkd%OltTU4&`NesM?6gCUJ=i~{YBs%vx#mom5F$Az<
zY91&Hdso_i*Nwvai4MYGUe(i)<@}X8R6<QNqi|xBg(s)pPBK4|%N4JKCG^uC8&!?8
zBJq`X!>IU73de#{=bR-J=esz7E&itBEQ`AoIs0}bKeWQj(M*8!(B;U&Kqi2vKym&H
z1jV|MQ}a_$YLlu8GQ_$3!{TsV5+l3~j|QIvs+f5DEPu^y07Cx7&T{poP0FO}OY?e+
zs6SgUx}u>WtS(7~sd{ys_~&J2?+J<c0m?0rV~pIw0x6@mHCk`*i`UW3(^_-7kE%)4
zOp3w|Ps7!lQqXdIh@JK$P!$c9o5(3ND!}*?GQ6hzr4(;;vWEe2dRik}gP%4?3K=2@
zojQnB)00_>Lu>tvuLE4&ih859y2Iz@l8S4>iNqK_t)szL_;8hwASTom5U*%3kdYdH
zsTlf<9(<nXbEmL=RxBp`j#EaUwj#o6gSd*udkRP+QY=8{?20I5hzQ103z64BG+^Ut
z-FYUAy&37y=p^uNnxdOGV&NU3n>Vp-2J=P}OcgR6x~{cOZ0=oa)Pti<)cOT$5Lc@%
zmvv+|a?JhI^F;+1BXi;ua+D?1Vfke&rfQ*n6CLZo<0ImA8G*cZqP8cJHkJcax^eHL
zwU^e(N=ByZiLcgJ&7Q)n0y|ADHB!e3?~k-jiMqMLaBMEYo)!rkb8)>)YfKD~GS3GG
zqA!!EX!W0LGIii*YwyItNSJywPmD&nEtuK1*Ar5`(f05a72~E2NqGxOE|j?NPn~N#
zKe1Shbyzynf6~17OXAf7Y27EH&T=p>iLZ+uJxC?cVX4D<=RgaX^*LgKYw;h!wRI;n
zz|xdbEQnX#a?;nddoi~?o8$m-xmSCiihY)eZr2EE(AdSs^U78Yd`qhe6%$k`xMqGq
zH_@sgMB^vHa5%u2$-pWFYdbV`;%H^y&B{V(h}1stXTZ-7QMP0`dPfz9QhhE-sUh)S
zxtgVHBSBL?bokg;f>G%<*1<oPhpe)dUtpyD@lallE)}xbF2Zb1kOH%>C~_(%o!1R`
zzx1<n1r8|#=YL2ka7tQ!0rU>XBo{_h%WDcS8PSNsWhi>zslmo~VmN8twY0!F@0nO5
zsBzBKIDf~KHRat{%>?R5Liwe^205JKkzBgfYG@hl{;Z2%!MN&rk6QdSy~06uHqc^q
zVSfoYLl37`E<+-9{xS}3>gjkdnj;W{t3EW<425szgAI<xI%Q)jzW{Coj6`-_ihuGc
zg+r^`Gp0i&e@@6`*LgEOWR2Ngt159tdy*Jc)%>~EGNZKDEeoGWQ8mjuQ*36L7{$rR
zx=bmD1OOMTl(z|HRi^K8%0=0Bx2zZ?PK}GlX<G$)K<c*Z@g)yR6On-L%z%qTRF}o5
zqV=^9^ZszWaX~`d1~#(LaC-s~f*A}jla>{rZuvon86eT`bJn0XAAlB>G$Hb`2_I&I
z`!R54VF$Ara?7@nJ>{7<Ucr;?Cdz81+?WELM)NW!8aIkyJ|nlHvv+jC)`2hEa?WV9
zJWE@$-?c$hD9)}QQzMPRpkHg5SmTK{Gmf9(DR)pvG^*;OOW_KRj!Q<QjJ8C2p^P0E
zizP?Oy~zK`x`<HigLwvRELOJ4mk-0))}QpnCGu>xC+ko5LN5RQJ6*H@W;V<c4z^9Q
znt1gca@T$0K|OE7V`cX4Y8%P%kd8JrEi1~JvUm<qJj6!2G(}AUuU(^-q)g*cpzv@n
zedhj<bS%Q;17KsYOpQZrtdeK`v_hPpG&z<j$oF8(>`PA?G7Tx2#q|D`dT5b=w44kx
zl{jOG&v%S>1Ao*c0a;pz`kn2_xSA4D@hRg*LBw0K&Ku~MWW2n*y9H?3><J0)dmHQo
zK#G=rPW|3>M6~=@`Qd1@WK<__laZ{Z@6(1XV!E7)PIEPmGM+g!CVqr?8Ml?6vf;PR
z;+#@-{`-AEpoEu5r-(`B^uE*6m{3atgRHSMPiL_Z2cTZhd)c+eSuiDH^?gs?86POT
zakIFAH-y<tssP<})tw2<vtsr5?mIS%r%``yQt=Z+BOobbiakHH*b<#tF}c5`m7NJj
zkZv2J6bC8ROGGk3rk=`vGf;6bB7J&~9^fHTAywT$&%7%kb?Ul{2#x7atC>)%MFv-n
z2g4lrTGnLZrEP~iNdb$0R)x3alDu=Q#d6#*>$M{F=K7E`BuhZ)zmJ0sCvqNnmbXp-
zObGRuR}Y{6S-xm*B|!veq-H`GqD)wS%;TBq$_dw+lJ_d_IS7mosD>To<IO&7?cK(p
zJwR`LWV$WuVh=hb)YN(j#IvG96p&n}RF`RHoTlWQ-?$>8tQBWO>_a1TBH&2x_-9|E
zY6xXiYq65TWC}<6+f13sWi|7**Z`K$rx<j85p745rrZK2T@bBJwvE(BbHyU6JU4aF
zN$2Vlh9%y}3zOML2%FDny@FkW@?&#cZ7EzBamjliV!`QjSSlDBuQ-5BqaJ4IQwS!L
zKtwwM`uqISJ*Fs)29x%(`IFjH;Rw9Cg8F(%2iP=wUBI+RW3_!y-~7iPwX#3L!xxl=
z?>_yVYu18zMLfwDYiauoD-=Rnf<+nvR^tF(l8_(K`c!<O5^!`3@QVumE-vx+=)W?u
zqR|VKg>!?tkS-h-W-A*8_TL=c&F%$FzJQW0GIe|`$})7{H0AzDl8fJN=U;w$nGxwO
zFYn;x@+1k^;%ZUEQD&tf{l$FM=+rK%<U>DsFnM%8=wCE=L07b*OL%aA1|2HGgSRok
zme6V|h0O@hsp&R)9>25bj@&@M8qve^@VY9%X}_qr#q9}jA09-<{`N-#>3TVT0)9Oy
zgSXTm5xWFqgvbizA`x3FOPh*O5^flcC=$Ccu2fe{!~Z}HkUDJ1qP%&Ixe2s&m5pv0
zKdw?)LW>_#h~}(&KS34eVy)jWT?78PknGPSiOAbto`znrB;<*zv9QTk6?=tNnJz&{
z<7sy$YC-LA$(31&cv{8&sqc(B_kFdx&&Pj%lIA^F60fhvV1ZH?+3zi<&y;7T`j?Vr
zraN-5Zu>7q$SIM2C8Um+F{7?#y4Jnfy~|y-_|HRM$$nIlOR(9%o7f!u1#&}8?>w+{
zeGD%)Mo`mc1SRNC1~cV^I8Fh)<0_DvLn;A38ks0`xZ)+63BC)XU4i-66J@~6muwDU
zT_#@Bg$9sD=x{Az6pYab^QcH!ZP{ifhdjx8;Yi6t01WY)q#*VQWue)KSd0{H(jkCm
za4AicF&4lwiff{BSs@-_n#1s|dHxqc-<Ss>I*qUrl##CLoN3Gwi<j62SMal72e#mh
zExmQuI|VrV%rdTU52QGIO*m#WPG+t9j&%kvpBrgIo|~jM9)v$%noTk@&!l)+F(3#R
z<kQJ#QhKP9J*QY`sNs-uTTjDsu8ImNQ1MU8U&E#WIL1Iwh9|x^eSCF^zik0KYjor4
z#@~4!P!hPNv%(gmEmkDbRSQx3Xlu5Ox`NZLRrU{0sD3__;}eI@KX1LHenTOIGAAXe
zPaNxK8Vth!J$WiL&G))^YWvdAbN_h!Fy+PXEC~DG$)X?~@N3XiDxx(sUbdRAnkxPm
zOa7%|$2h8>#}IG$>$Z(%D@&22Hkux&UIe!li`ukq{ES&>i)u~ju4Dg733or;qY}nQ
z94!YLSA;IYwNkDI8iX)DGoQ?H_9Fy|g*s|G5WO%AI?KLvZqgY8+V+|Xdc2G)G2jx;
zeeX^0A6At{CqlS1i5zW?Ahj<dM@6e`;Ttp^wpr@lX~qOFs<SsFu`THy8-_JP-^s&X
zdRZ(Z5&}ql+>0|(Yh&^(QDSJ~)EajQO$RL97^=a1qAyd%)M0KN)F%3L7Fa5Fh$BW%
z{^t^Th}n5Zy|SUC7a~-~Z3T7)OJnSDpfQglKh0-+N}-)YkG0Nf;grX<0&5kYsvt!l
zMp@Sr%x7@<&f^C4V^gZ5X$?tG_T7>N@jREbi+dw3@kReoi8x*&i~RhxReT{?VUrZ&
zUx&O*0HL>4?I0pJmYQnCqxYhnu#x&qTrp!fDUtf<{>?u4?9KP*;F%=8*A0lxO@&4s
zTRiEZ6uy?T^g}<kB|X}xT%NsF|Db-OL?sh{yz*Moh28GUums{erNEaW5diz(m7E^b
zW+5S~wMLI#XD@SyE1XO4%|WV#t1xQf3BD)MB=e*#hsH|qG)o0{M-z=9IZhCMd(s?@
zhqoB$Py!gwH+g)qO5>W|#Aa4!f|cCDWfl>6!!5(ae;=9!Oh;c;b$B1i*&JYd)TPsV
zcaG3uNyFkuU5Qy55q_hZN*O2#1gHXN6a-Sm#{)eTG$0K%Oox1^Ve7kpkK>|%<dc6U
zM0x?nujsN~8hUuU<(ELfF7`<k31Z^qnH15i|Jj!MQ50oG&d9j6z?dVA%eD^2lK{e#
z#6n&?x++trB`>0ylsLW|70@fmHhoB-3q8RsTl6ZUk}-hDofu5D7~dhov5!A_Fan?~
z_rX{@#Dhk@E!mlyJ>;1=1-OpuElLej^9l2`2ByYPMLT@MvBLH$=h&ZZ7MB`E1A(IE
zbqb+{CAb~#MU)pKOLh~6>dcS!LFUk51d4BeR?l66FL*MncyJk=2H@k>;@}zKc{?J&
zsW{&Exd1r|B&1VyXj+AMJi%(B05N3Sk{uqBO2e9Le_pPpW<<07`9(&fCfR#+c?}+A
zQZ6wC#8pH^%Bn12AK3b00M%&~(a&0YJDm))`yyr45s})46>X2(h(l8jTQ{fZW!O<3
zLk+7d+lCucT1rzjicb=gwvOz#s7VcP&BPp%t?JgZo*9ofsETsE{NXn|3>`xV`AZv`
z{c`v{@+_K5rqZ=);j&PYcLiP6NQ#CHEs5`IRjs2#g*G;BK@AW1PJv2cwve!suxR+B
zjfu$VR7MZrrUgMPF~j#WutNr}4OKQ*h(8RY-1AIEygtfiO>N0W0Z!kF(`@1I%rSD2
z4y^r@JfeGO`UMt&Q_l*yAdOIq`hS=OsRGq!_bRE;W*3R1)onmgT1#k+@K)NncdI`5
zVByG{A%-G=>u7%So#i=ln>%CDvVo<EH~>KMPF@PCCC#a&m^%@!5iNlUl<F|!?v0}D
zL(2J#g~W!2322wH2kZfWdTQ}qeA2Spgu?8FIED6}=m+owRMdQed#<3uh77%_^k_d)
zwP<==UffauSNOCbuVcCHw=j<FM{I%6(0Rq$>#Z;5H72lt()G%q4<EP^J8vG5<vEST
zRfDU$!bKJ3Tu{SZMbz*$|9<Lx_1hI2#JBrsIOI*2C@P*yw^v<F4|$T(m_C10L;wMM
zp2sOc4}k=lxLR{7ape8UfiC{=axtw~VWE)8b|nv-0&A8f@?;0$zsW6>z?90GLf)Gg
zc!kvxI%8;U;fc=m*-OvK_1#B%LS2<?6MBqV(9|~kR>ow$eY;4EYo%Jc7+G294?{Mq
zzE>xL<9fqG(uon^J7|p@6ixt%G4eBV<<Mj?7%(k}KEfErRI?Z_XwY^x<>JD2hoX1*
zId<^bhXKy;F<~KF-LovQjKo}8Z5bL%RS*^NM@vFdG<{Y8AFY0g;by{dU2hI8(z(*-
z31iL+KmxY_7*w*rmur>T6NS$XOBT23Q4NF#*x$c&^U$*pb)pbVR?vPjc(B7M93SCW
z$nH9aTjGS34$^|Mh|kyQu)JX=qQ$~@DxWG8s!ydxCvxBKpk_nS<e;ZHzqo~RyY7Ec
zx{LnuKFhc1=s@)!VCde*$Z5_>H;4~mjs8(Xfn)*wuc`m7^s!_!n3@4xRl#lS(3Yp<
zD`UUPXmKooAdt|-<M3VbiWF?MqZt;oa#2ohha~2$u*x$|Ll4&f<yfqV5te^L#?B02
zMABNn>K%=a<=rEooFLib6Z_*b|LoH_=9d8TAA#MnizjkJiV@ff7}+iK+apARaCiuf
z5TMTGoNBNGbXbv}{O{&B1mCIVzQwK5I4kS2*l68}!l;fY3A*VNf$Xal+gf#0m<xPY
zA`9KT>c>B8<|6!oRJQCoPaxy-RZ?7LiBpzQL5nV(OJ<ON$S=QDl2=4oL*w}l-m{0W
z5vwBF<H6esg=1Y8?p8`Crz6I!Nty8+#|Do;GRYNg1c6)!z9X+VhsRR}`sX`d&amDD
z1kF7fr{U{tHHDy8>Br!>1nPko7YZcTIU})J?$nhl6jz-LxGgtizD2Hc)AJ5)SNlm@
zM9n4PdzIZo#-v%Bm1Hbsw{%iasoq@D?y;$!@|X4|B4rrwpQUrX97k_4ICqUbROgCE
zSd(P!$In;+Nj5ViKqAn`lE-LAXyMxe&Z!72?SV@^$P)@v&?<rV2sN*f5z(xJC=`~o
zm!L6Mq27jvD_(w-6@4IMgs%jHvJ;Vq2+6=^yv}qDqScFY;WC$M1;tYU#`o16CrD^|
zv0;Sp=qPQW2<{w6$gZv%roY7~oCKr}T0;4F%_AG6WQI5G<Es{LJRRTyF{C}y<r&Wx
zlj?NGf1j~o@e4GCE^%smtF4z3V~$cY3*_Uu_nD>6lJ3JIW+)b1iTOHYRO}ZL-tjx!
z_?}YoCNhzip(*sBuZo5hH<Pl1nET^zFZYCFwB_^YF~dd=Cw|zlA`PJ+1PLvL9{*|<
zFNzB79tqPf(M`5^D?{f|N8qmZGx^@f#&Z8kudno>OZ}uBX_adI2VHB#N1yb#ctDJ!
zq5?S9F)1Z+yahPSfPIX{6fb<x@Mn?n%KNe5WZ0ea)ap{o5l7~ZXS8y>)8O^O@I<yr
z?J3#EQDqo-4iQD%m-gw$05FW(BZg@-z=0H6V-`E`(6l2)hn-HgWLL)-b7@$ExYBcZ
zog`LR5X<5uSSyLvpnL*}iMHJ51dyP=fyo-b`5Z4;vi`5O^9*XL>-PAeBSk||KtVvH
zNk<_R>CFd0s)7_jy3&gjAtv<DK@<d}i=rS%4+tbw6@dU!6+wXzIwBY#A;~>>=bd@p
zFZbKcOfr)_=j^lg-fQi1W}o%nzljM24_j;KVaq`A=ew?qwP_b~XorQdGbj0Yq_3`z
zR2ZUqZ-4mpSY7yn%bXa)pa{p1iwezY&a)Q72w4eK@0ScN!AJnZI!83C4*6irMt9fO
zz_*O-tUr=n;dhl8v%V}F-}w^YH2Ao2Huj_KnOemQ>YtxH@-e7h6)kV3^7D61d#-vp
z4crIPM_)whC-uKTk|SpP_dcCHeDdAJ?&H@hN{D+#;(+W})<ih@+j8QW&6Vim#ScFe
zZ0@6AFY1TS0h4tXoAo%KWf*$LNp5dcHc)6W68_r>a3D_>Gsb0?r9##_J!0}R69$}r
zyBP<)UwE8niHNyWM7#Md@?n!4;}>u#vz5U1aWCz?@kL;MdULbu?1OZTl34986DrUO
zu1*V~@rx1VtOJVbENO15EI<f!B#<7^*u+;>10|XfMd)PFVOMFFyx4O}#<48XO4s$G
zubHw)RAbsnf3_W0^c=xE;5_wH;JVo2*fY!2pMhd;GeRqJ>7-ho$SGRtNtTxuT0rPl
zgHD%uSNMMAlbMVC#vm=_Y<lKC&Go%pzNoHS^_e*#j&vgOv{D~WzWdEU*j_NbUkTiL
zYbMDkL=3U_hTdlIkaGKeHN86Xw3{i*gO@ilpNcGSGRcDv2SVT^iw3My8P1%myK;!E
zD8oqKl3r>jr7<w%sxa+1QJ18E8e&C(-F@qBccd`A;=(0fNyjw#4z9jdp#sU6v`zNR
z?hWZ=2-3rpqkJ9}S&Y3wb-7%SpL9M=<SVZM61A;cj%Kri^W8RhDgcx<V8%5D@0z?G
zKH(Y9{V{!oQFq1TQ+koX-^Ekq=~Wk>YCjrtgEuxz7W-T9C0#)rXQE6eb-NSzaY+5G
zq}dInm+l2$Bj-hrd(rEapbn!$hejKTe9P>ke!fUuk?3d*31!o?19e@tpDT_dZG=+p
z0+HvhEojG<UN6TBx^{AEP*-iezSWcx-qF(Dj?VViMs5Jk8t%yC`h>00>eB1Q-E@4{
z@9+KS3mDScR}E5z$>ZdoV?G50Zm-X`jU=}AmZk|FB~p)K&7y|iXPo^#6QDzTbIARg
z%nxn0t+6T~{=RGqZECOf?dVw379rL~ZJ7yGK*}TGvPt6W{L<4rs+cdO6&2cbbTvsz
z3eWULcPsgW=Y)xF(g}VMO;pJzA(pfZ^`X2qTn`pSP6>}EN$Bg$@a3F{|2tgTt`}se
zsx(}Ts3gegXZu@D<^f5&=Ru-YE>LrXZ?Q}WFxQVBYP_7TK+ounIrGU<1i3)bLgBke
zb)|7H#nc+zEuV}fFeHqKJ<jR)JTe#ZeIQacD9b$ULipYDbTKE}t|YY8*(6m9i|jRC
z_ZVP#?#5fn6*sO?5-zU%y?jffqQfOA<tq5*74g&KL|{YQP$7oiqySA?j@Lwq%DxTX
zz*78y-1!~W8zeU&(Y7Q-H^o%rIe<^6tn9XQzDXlQZ!jI3x-w#yL};}NyFG1jjVVrt
zChKJKMi;w~0Jk@M><#Rq+r-yI-3qorlh?PL!EH3$n)K>sC80$(E40n@5cN4=d^>}W
z2N)OB@=50)88#1Wit*`{<?ZvR5u=t~(X(bpPQ`6UJX=1<ipKV`DGs`^lK!97B4=HR
zQ3{`h#vDe&F8H$E`oNdpH^*rF0x$RKx3a(Cw78ufp9+(ET9?VaY;4Q|_k>Y-!h7X=
zk|sp&06oZa`pkMd8r6s@OPY1Ao(EwQiCP4QLK2-|TMN=XC;Vj>Uwq>Yh1jNt&$}Xa
ze@w~kWyu8o^MR|l?Hp$J5rs!mib<G*yFf_gAoXJHFHyCVn3dr3oCMqMO`D6LCV|Ii
zXnOEnF$!7J1O=v%m5_GKxwi_zFGMnruxb@IZ8{Hn@`eS%yj*M8g+8;?Gm3Nl&}P<P
zXCANsDqnp)0GH-(fE_YY#$2Kh`-pDF<dgt<<U?aG=lNHfyC;BL^3gXSd+ZvszR^4L
z8A+`~UImrrdu=b_pH>MouyJL^Yp3CtxL&O2!$mQVhn_}<eEGJL#4E}ivMUNPb%Uh2
zPHKzO$cO~c&(iTB!|8#LDfQ2g5pkNXfV?N*SlCLx8I9%cF`L^u>nE&|w6Zrs4J$o$
zKS`AEA-nhxYDPIsEM;hDd)M$%3l<>P-n~>}t<Cz5(P+P+;7{ivPH*}(gDr<tkihUh
zr{x%pS|g2_ns%a437zWWmt9%5%`!$ojTWb^g>5=FE}xvjoaL@$4BuW-VKq00YU`+8
z3eq<j6`_+4*qsj8taVtCyPM<*0hd*56~Ywr)HL=gSYcPMOYi6{?!k{-0VB!`m7Z_b
zw6?-sQ^{wWKc<7P!(M6e2W8UxLPsmay(*wGIAkVtKw>Kjo9oTZ&h&1At-LkAZ(vJt
zR7;8uMFZRl9-#xw^g>PidLFV|kjT|TKIB})Rhm7=H$;ZJD2&VPu(^cqY(oA}ue;|9
zQWoMh%S3YycIrsE)N_bJ>K0sqL-LF9cAAGFPwpk>TUT4ORfhA3*3YobXYb<cq2MNx
zPrFHh*};4DI!iVUdeC;KR8NJJ&z=rCu0vyD=H)+H=&ZLDFR}Ou<+dU`h>=JH0<z1M
zNefY9mx~A{6VPzk8#|m>H84U|gySj$@&#M>bp;1FuU~DLCROdz*ir|nYm%lfss!$6
zhSVA)1v#&N9pF}@a><D*r<7vM6(QDkKOsZL$jl7md(FBfPub3Cu&Hn(ypa}q-9#J2
z4@NaorKCg%4^9zdeL2Gw#s5bE;H~Z5JB6pV%Le*^T0A=L(<6sjSjUwfTbHDU)FC{a
z2}4vu<BGxx%rl;`c5(2st*zwePQH^FD}8JK+RTggtdhR4q~`Dmdx|cdUCAfUr~*y7
z<Y&?nnz0aX=92fa!SS@}!yK*aMwYU4+(h~%=C#H8haBts3dP;O+VRWPvO61Kicl;^
zPs%)f-kJy%8?TuuniJk!cZl6?j-N=|-XbE?Y5c23(C=DBn$^-ze(%}P$yUYcUiUXX
zK`Nn{8)28+qxb5)Ho0|oKDJ=)MSoQS1G3H(Cm8)o*xN|o`=87Fi+eDn_T+R_Soo;#
zpI#08zR&q16mL{q%KbfOee%|;^)SkUu3#VM_2-|TbspG%;h{DSImSG;`}p|2WdK7B
zf@AH?4W4wO{L6(gD}S{%MjOmohgfxClcz5wec^9!u41MWr02d~@x1yPF)BM8IbUs&
zPNR--&y*6%)qxhh5uk7^Nen2M%NO>p#bb~`e4#acQERQL*&i|l;h*j2f`*i)_|-!<
z($%*P7I@%K5I>Ckk6N*?Es)xcUIQ7FAbRcnR@-_Pli)@%3?$x(ecP#!gRS1%I&=Xa
zDRaT0V&(giJFf)8L0{87i4NwJX&$;=M{9HUfy7`$;>l=*XPFAENp$ZPmzg#oMi?cp
zQyKF3?+p+U_9N>O!pO4F9Y%hJni7W_4u-A#D7O0v$pYpjTuTv{vpAM<c8SV{RJnel
zXl0}XmX2XJTP0{SIDl3QOsYl`nraz-745g<=>!ijSt3TqsJ&yghG*T*|EWhKY`nI5
z)p<DNPx&cG`Pt#vzHqu$C8Y;7t=nwfdtJJ&7u*%4pGr9OMNTI!cI1`z-s;GjsS&AJ
zv5}>C^OJWR+lLO+9mAE=A7_EF1lI0;7CPi>f^tK^8EfQ>xQUTfQW|0@o3@0TxyuR@
zS5IrECrD>D0a6zEpEp7~R!!x?yI3{%N>4p?(O^0tw4ljZM&}RrK*+ZV^brnJgT1lo
zSX&gNhHH{0TRI<jdg6NoDe?%?*8A<{0)NfGh2CSruV(}=%z>gsP4tXpDf;K?PBc7X
zdEkFXBSp3!{u|BptGhH}qQ&R*sz|CZ=c>Ms$BEJ>2`O>5hY-X!0Z9JY9$l+qVoKg`
zi+SU|_oT0em*vYHP8M;}ykjEM#7TG~ek?xgv`3TQW4n^_@e!aIp!n+jPXD=J+%b6+
zgo*}+g@u8|tNu}I<FAVkl8O%+v`7udbi`uvadSZZRS)M2_|XUW(K+<aIgm%Yk4rrt
zgk6y*^tpp%-{H0LV)v_uS;bnxxC=SAU6Mp)+n!NBQ@vPwv?yMP+y2EycoB!lD!*&Y
znvT+!r0K!CE{r?m<;o><0I7gJG;ddEdDbvOsIPCy4C0g50SXZuv$3fXaxsG=;u!HY
zJt|RE-2zM{HJ`{uAK}OY=loDKnDPwGhu<GeX^_+K5s!8Y=4VCt5amW0k3gME18(s{
z26fzw%>C(@P;PT40*A|WdK8)%$k7kx%^e#!SGiBUPwsatO{u$ef7-ICQpw_SD2jFp
zldPh<=R4gd=6i>O?a+jq8CH?g%x>t^?~d68!!TVZ{ZO+h=7I`~Dr0N+AN8OJ*oq?-
zcNlTB^MMA;7CucLaQ%=@qw?TB+8Pgr-x%1%*&ub(jIv}#z|Mi7MCkXBY#BjNL+~C1
zN3ug_e?87^Uz)CS1$$hJ^t3h#Cw+49LMpgp(XsbNj{84cAO1Z*D`P*`_59Yg?uU-7
zuw;K>ND=YTMJ|_F&gSzjPFdG<v{}qyal)*<1T-fftV|f{+?0j>^RuNeF@w_R;#4#C
zCItIv@mS&6u?^b>Bg^+x2515(8=EI}%)bYLmS#m)4?##f=`YY8L^+c8%&2>}`TGq(
z4f(MpOk#W6TZ6ctZP*Z5J$icMS0y^vANDC*7!49jd@+8J>mu3e3Qg(FYvl;uu77&j
zQY-~2Jors6r*{XxbJ0;C=(nBpeY+E+9s3Lkl1BwQ4*KLCO;p`s_+cRTaP(N2bT5DI
za5!u(7#qEBEUS&`<-E@SvGUaWwNi&&L7fAy*-0l;mpH33p?db$=Lm1*D&M~9*W2Bg
z${e@V8WZr|<i^rw5;yIO3(SbFprVCX@dg{T2ztS>z~`8v{C;jiv7=?Kjk-%A)>4UJ
z0(0Yx&+vl0VmJry8jsMiPn-;05ouWpiU=eKnK%q4D2|3bsf*5FZsskWboo|vCmM7I
zj5s4eESxGtV}F}0f?#j@0I(0MYT7Q@XcDGf0Z`kBFaF*S&d2CKV9s+ZF6S5mpSO9G
zf<9mcwDyCwrnY|(*K6l}l#kVWm(@~J<j?%?war$-_RFm!e!>8C`E`%OWNk284|}H4
z6em+7^Cw7TZxl}Chao(9kL469>HG6=>JW7Pxs)IXRks`fY4NZ#=iq;;oM1hm$btxp
zEJQ$&g^DubU<2f^m!5*HfC5!JC*~tiof^~!YUF~4ly<Lbk$X_guHYMkx?bx1FgZ@Y
zbt@2n3v_&StTgy~p|bJ}`L@1n4RY2rNzd+%-K?qX1rZyvj@Lw4;kj5L$cbvxX0JH=
zegmXklZ0%bjBi#`<ryV<28M}i3p<0)<9YI|@Tr$??cXfMdL9mMN6dY=eSm|a!x(ew
z2n2$X_v8{hn+!UBtrNP4Bo--_-5R;S6-~#KELrsY`D}xynXBvKpY<szDXHCUMOD>S
z@2Q%ut}ZabhaK|@3r)qc&nf$$f^Y*d>O8-u;B%xp|7&-hD1Y|-<<^*Ka_T@u>GJZj
ziP)E!nY?Qk4Gj$w5)<)@;)OTDLP7?iR~eF>+QaL@w&&K?*1o(l(|WikK|Nz?YN{T#
zwXwdwzO@C4p>{f9q&YNPOI|+n#w)AW)(RgagrHU{>jbKxnl1vj`Lid{6I;{)r#`xQ
z^CoC5cr$wZX=(O4wn*b!ovRTAWV}n=sIW{tDM0KY<8w38(~H!@{Gy`TYiepLDk^Gg
z{Wrfh_3@V@Zc-1n%c#E$o>BJaJ3AymVc3u*bGQ3$yb*A~H~9DOGY+s-%=tp}LS8Wt
zM9B$VAZGb4AK<bG{vh-IQ=G>^3n`eDd&<f~c2ffn5&O?M9&tdgXMZXLa1s4?kr<Se
zi^?bwp%?P`PpyAXNpuI0Sh@2#Gzi<{EB!6w69(!&4fPA^{a3|1a1~Z<6lkN+oqyM0
zcVuM@#5^sK$sjR<$9MmiA^52SQr&?W04Q+A0raL2TF8~ly1;^~Av3V^UnRTVw`avi
zz&0uCFl&#{3j;b_;0Z%Lia@Uz9&Gp{l(<<D|JCpSGVxDSQ`6?==HlXFiqu>uEOG`K
zx;^K(lxD1Em`X2<N&fw#EB58fmlDat#ai&g-?*Dqx0ImJjI=bFGL@&sWc+@9e!jB*
zoWtPP$LSok^$xN;`+UH`-N&EYU@-DTl?_*tKDR-uLrqoH`cMHhY-{##c)_Ojj_*u8
zZt|`D+qZ97Yh;4(^$)Zt0un;|Tc>1MbP-QoLqnV2yt(h=Q(anmm$J~?tFNcmv$q#=
z^X5cZO1Xqu@bVy7nYg(4=Yav1S{XSxxqJBVLoaS;TsVo~t6cEC?SVI?&$K|<z+!Lf
z`_y;yfBKv{qgq2&$C9|j2L=YtIM|O3*X@o=U<P&$ckvR*Z>p+x<t8U54K1!HDgDvt
zo2qdv$jeiWItbYDPMK8=1>N?kN6ozgD71o9wBR5+H9rqu`j}M<LRXI4Eg~Qcu%f`A
z04=@rG?^r%6)!|@Tca6ukf{}9-?9bIaQ0}JIU-0E44s*N@oa%Yp|~lw`hIJEJed=c
z$}2N!cpAaL&d$F1@$!``)>c+r2BY9yxcgZXM&vdaU7M&v+ud;sR4eQZT<rgpEuP|J
zKc?U!4n}KLQBjct_$_K{YfDZ}#$$`|xgAl5idomjCnjJ`?H?CXc;x(MQFUNPA2f*y
zh=j&KoN<-a)jqzy9RWYPkMNnT4t~zgC16;Um0d_KGZDM2re^0B$ZhcD%a_>LSkMfx
zcjYLCeH-l|(yeqfzce03MivwlT+TD`^z^)t#mmRXcm8}4RU<b<?fdAc0@dnLJUB$g
z6_!?3R*sI26?0x)g}IshfYj&dX<K`HdvLA*J%d6f`OkN1P{+VI1Wm*`m8cX9DPOq~
z5*8-6V946p7IKiJ1jKk4{>y#;`uo5A`Twn;aUS^5r!jKMvPKyIKmQoq(67;Tj`<(c
CD~Npn

literal 0
HcmV?d00001

diff --git a/demo/documented/auto-adaptive-poisson/u_unrefined.png b/demo/documented/auto-adaptive-poisson/u_unrefined.png
new file mode 100644
index 0000000000000000000000000000000000000000..f1373a9bcf24b78ad560f425258f8ba8e4e8b0b9
GIT binary patch
literal 31880
zcmeFYQ*>ofyDgfeqDod&v2EM7ZQHhOS8P>mqhhOKR#Y)6w%1v;|Fc`WXFuF_AMWFM
zn_6@BZ;Vg9kFlba6eJPgaNxkez!0RR#8kk*Ahf{1z>{DhKvzCAqi4auh`^-9gw?!q
z&wG4Z%+>v`UOs-c&aNN(pM5|;l1a>Igh^S$O2Db;Ip|yCbK;*QZN^!Jn7aK=K0?IW
zb{^{)-h?kRb!ho2k-`<%Y0dWKf`SESaU1+MK5wnwZ<T&6aw?;wro#NCpEK*e^)G(~
zkN$G5>i8C@imT_*JYKQ39sYLx^{^TFqQA5A{;M-8tB5M5m})3S`wUeHO<Xy(R4iOc
z8BHA9MhzAnbXp|we^3AKX#D@~3^Vp^_8X7APd$!95eUuA&AM%N-h0uM&}yG6?Y-{%
z@th2Xy?&ru?VB!B@QmF=tC#D|$D9HCoHM*v-LVW^Cv6)JzK3a=3a>)P$TVRf4?bo}
z6#RVV-FZ;}BLqH=3BIk*Cd9|<`#&t}wmaC@yq}aL8u(tcmXwqfeBPG}zDy|2{Q9LI
z@N&r5`&_L1)AMS(x~|LScqZ>@+xJRR@OAzw5cuX8__k4kkv|taLm!ou@rw5^KvE7O
za2>RId>%fYb{ylt`=|ds=y|#MGESPfL~H1CTAHEnu^x&ffJM9GclYbU<L#~h$QQ(W
z*|85oH?!LN*s4(tWfTzbi5Yl<x${ux`Ef%Cyon|_*%bK~YlnKJtAATJE^2k#4V*{N
z8?PrQ3%d7WXpfGLeqXfJbO!=I(`Yq6w{||Z(&=?gc1aWYTsG|6JHbxRmaBnBj-M8H
zN57mehL8l`b^9LvStd~QB@Zi5jI!@S`g#|7VsWmbm};_fvQGbJO>2gpOEg{g^&mX>
z`F77wm6tyQp;!J_zNO#6u?Puwnk|unKHi?LwtluZJyuoM{cg6L?e%|CI1xI=t1T4(
z7YD&5<Mw-I3OYTt*5=~nh5vIhUy?S7Y3O$&io~x*?f1MJS>Jst19o?J2NqMDWSh5a
zdW6a|#~sNd0vbzK++w<}lh<pEA=5;Dj~)Lf{{vD&@CJviuB@!A!1uAhRP=nWy=ZpZ
zl^UJaGj)O!I!XK@5O}8BB~?ZH^`^tipI07vA!7HmeYdoM&yj&%zt~r~!fB^&^L;O0
z{=f)&=_rPd%~%l{?+^S}KAW+xX<f+Gw#D2u+i0`T;dJahEz7y=zMIi{e(M9i2|l?B
zK27z#PxamL_L<i9fPA3<^!>h%jXr;N7#>Qmcr0BIY+^GD3+VoVP#E*wBGE`NI^DLK
z9SzX?Hd?F~TUQO<I%oYABzR{9f$w94fw@_Zormd2fzLyRZ@*UsZj%!`K5{pMXVCux
zNL`~=XW6DT-~Ult`}zHD7T45d%pm+?qutPR%Y9YP^%rLEH58|TlFPg}Cjb4MC}=i-
zbCCk~N1S~xqJ*z=(u5~?|J!fO-Q3(ja}NUT7^lK=S1#~S`M17rJ9;yjRI>Lrt$z4*
zqup@_gmE+;m(c4^aB^~Tz)%0(aLj)LAo$iS7%S8HCwRts<^>*93a~9MJCF0L>w90v
zlS$jReX5y{rVKxCG5elJxHhH|@Od4&PANE@CtYXx{~?uERNQeM!{7P1^gLA9+_Xlt
zy?_z84%T((JUkBkJjM(xOo<pXI7Czc$ftwqi+8OvD0~C%a(24^*8LQC9zbf_xQNH)
z40xzE?D>5C`<K1%<HGUkcdPAcoqi67eO1kO)wqwB0^p0PBL71vqyOm-B)6F&)f#G0
z?8`=cOk-aZu@c&iyDbZV91G37V*a0($26I(v2IANS$!^{(10EkjfVrdPYlaa1@eDR
zAOGvJ>?rmnsh!wA*ZP0l``?dR5&pZ}WR`0AIMN+oL8=By0ueaq|M`kC@&9o;Z-)Kv
z;}a*RK|Y`Zac!OdQAJx4{}oql79XBM1JHqTI>!Ha(ZzqgKRwRDw{lkKKY$MY8|?qU
zPBBF#!<xA1(C<X(K^U~PW;mFx_?uinP~2O7&Ytlj$j9WUQ~*X?+vjtt@1|)?Xi1Q%
z6DY725|uRo*?|OhYv}lDiY_kBEgkTBFrLM?>FxM;1zsIC&G-QL&i}=$`Z(So6i%dq
z2-fI`EKH1uX>avM?A6b5y-8cuR983<Zf;b+LnHte-V&n1c8BmC3+YKIvvt9fKl@=d
zmRRRw#+8b)TB<Mz{iO9S@OeKZ{OId(<mQWV3f$|Y9r)z^3`t54^x+Uu)_YoDNpS_0
zdcb=qD@_=tVVOup_e$rnXl*RV^|02+i!$LcCgisp+wY@#tC_Irib9V#2qvj3z|Y5R
zl}!S1?!QXJYN@KDS09R`Wy9jQLKLvOh0m1il|*51JmULvxUdkK;Y<?*^e2cg!^(jd
zflA715t#oBfO_8u<hP-V8wvj#4M=H3HI*Njm0-*?DbK=0!&z-lWKtDid+CGPBo<n0
zMgn^z9Ofrf<yMP80sYpy)$iG`JswKC%ZWd^(JT{?n7A5OcpZ`@Kdo<iAHskUqc=k1
zANJ8=pS%_6`xGH!1O(Sgg8G;z^q9HFS4$;7%sQ5sJ=op$k{${)p$P*e<O|OPY}vA~
z#ttL=tdJi3T({SibEq6OrWHIUuD!4~SQsp^V~G7gFF?0T5M4hJd{aO0R&cgp0JoA#
zHX7s{xd7mPB&8nRlK+gMt=zyiA_gDxM0|ET7b6ufRO5+&NTnZ}5XIAFJg_I(kccv@
zK@M;QpGWn1N{A=e{G_g&4)$+Mm>u5QQ$`0n`wK&$(CtFtzBi(#eB>JXLqY``+l!C<
zXx*oZsc%Yjnl&gdrpC+W9W;W$#>gTGI4T*N+5AvXWlaD<p-bO+_f#E(dW|~qwuPsu
zVHTj0flAqpmaeNLVy`SDq{}qPQd4cz!}KR4#@K*A!Fap`NA^K>{kVe<(=>?QJFX$t
z<`Tb$4|JbRW_3zIKb*en!JIwG@!s(f7VQgF=&H^A@?IS%XkTL-dvDwzuHBDiGGrzc
zE{iQbt5kAys2>3dty@MSg`14b7}GU=eV98Y-WbI;-{T7oR;K;_T^KSm1TG}=&%qpo
zGCpuwe-ZHdz7;t$e4&v_EQ(*`qTxDq^~(p7YOrVqt!~HYJ3gIXFBLYg0JVBjwi=W7
z03UD5f+W?gQ1q4<Yiv`H@5hAZLt=$63OE>y-U?N@AGRaR`k0h?!@Vr<=8tvvevFF+
zH!fZgT#-xqEhBKKsp>fmEo0T53P(K&j-a3dslf3z#JilRxEMuqBtZy_?ieHK48v*1
z;7SlB0Z?ost&=8$*i8bNSUowGyEK0|&-YA-m^-RlPi2V=nltM^{GN=n`b5~VgCQal
zT?h=q6c6y<rP7^6#_`<Bz6-}p!)t8et8eCcIxGBwj>}lfSP%{!J72`7lIfNp@Ch#&
zT>kkrh00~c)=C%&`1!f`L`yZ9B@F6Ds^0H@YKq<1#zdK1ylTjxrg<>Y#VG=?c%`fx
zjNEnDB<QtAeTB;nH|OAC2YdMymR=+Hd!}E%Rn_y{!!fG76dR^ivH=fC-xN0Li>S);
z9ItSAQzC!bT<G;ErI@ESha0|zs*e^kQ%BHu*3+)GPY&XI;Sh_c1j8;MMa5KU0<fUV
z)uYSJD3XmM7g1}E`kNmxnn4JywPS*<fg;l`2=c)Y3YspN+$o*t3%r)gBqnKb0}-x@
zwFvubDX?QQ<g<Qf!}WInwzzkEiAV(<f8TRtbsoG}-52A5K#f{L>Uj2uwIG11@Bs!u
zc^5NI*!s1?XjdIUo3U_-&!i~U`#j}fnDs69L`m?b`T>4rc-H<(L)*mh4HjcqesWB1
zmm?`&yDZKK;pXz^s@9y~X6xUU51E+TZ1Hd<ZJB^i!CL2USad|@9!%LHqcIPprN*ji
zFtSO+H18qI(@-*^#?MCLP^J=8&MWXzCg-AMu`Cjk>6s0INF@u)$KnpchE!}Uf2qR=
z8Bs>+k6vgdF+)mWakBC;0zUIw0k8GI&%?!gU+PKQZ|EZC6JBFuE4-p;8*hAg**~0L
zc*;Yj%P`;(=9NwRq2lF>YLK#!43x~mpy_L@307gyAjH<%BU9SE$!*Utf9OarjYp`1
z8O6&c4Va`dLdyDkBP(#;53c&XNv`V7c>=d)R6kRwC#fw1!Z7OGvO$F}J)&B`2ONMR
zrzT)4uEYi<)o8M1WnDup(q}Y+h{FMm7O~9Bi=~c?L1lI%>+soxWj&eT9D3sUo<zOY
zH{+Z+Sm2#1Dr6C3;*k~?WuY2fhHwbs9p5tik(Nj^nIWmvW7B(UH^wbR8DICC{K{~d
ze^T(}d)WfjBm}6W$o7YG*6MvENCQ3et{`lMm7#U%bUAf!6c)##gesatU#3~85GaXT
z3Lz@Yd&N@5L@)zi<&ej(1w<%S^Y)D`vLpm4_ljX2C%?_mz;own+gBwd?Y$Q_q@rCO
z5~dk!aAgYCyBeh%P8gcWfLTH?GlSQ^U1<Oh0$2HP#IeIbfh@rd9Ca_F(zMTQv>On6
z=%@h1u*isx2Emv4WLpW31~r>ur$%%WXerHOT|fpK_>_g|df<EFHA(y9rEE@79VNb1
z&T(b-_vVGTAFp!Rgg6lqx&<0xX7Fnr&G=or3O`D%P0kIB??QekjQpYWaNr=I9nE2Q
z&ahq2#z*RLa}mrc?mhxd!wlZ>mQy};!|kMY+e%I&kuL`%%%SCDx3VoA<&CU$@o12o
zXom6Zb0HNvHR=6f`P9kvU`WADc<ACj)3><^<Kqs`c-Ul>vg~K}-@|GP?Y4911YX)5
z5`$73KYM1nVH+s454i*@)g(PbzAP~Z%)B{rHn8*dHSLE5u!wVSO}D1^CeG14e5D#1
zj4<p9iqh0;oMzFcu$|B`u^o=gjIIUB6|A;Fn+ul;TPxwv!1oy;OhS}?trp88P`18a
zNSw?F(7Jp#?!1fiI9^N_b{O{2lA@-p8%9v@ME%KRddZck_a`08A<IN-K}C!9nE8P`
zKoDS4fm+qmlv4t?f^EGxj-_L|g!6^P^t4Ee3XgPHg(E>UAm~BYp#5?*R$*STDwp1F
zqwNAjYjz?Ka4jq?+wInGhfx&)74Nl<{(nbt9rb$sUO=}%y=pq9ftT^kPoIy!hKk&Z
z0xt*Foj+J(LDNm46}S~H*8Ofj)dS~4&!$0D0Ay-pUp$W2F7h*160n_9#1FhRb9`z(
zoKnnS6tw5I$;pW%M--2$Ov_>@3rp?X&&-)3n^O@#`(7n3-h$@Nmj1&mPs_!KlW=VW
z#$%am5@nMTUUt<+wOXFk9$BfeB(3};hDReMNQ@kL<+FLUAb&?&8-gJ4{l>HRE)PuL
z^CmIyvAF;r7x(AuS#`U^)^Dwsc}c>a$KSS+l9GZSr;35MDFwMXIX~ZTr$BscWaRt|
zM9u_3zZ1O6n&qSL8p7RnlBm1AF9vnd<r%H3?|@br)l}N;Hh{y-9G5*#O{OHhd_|9)
zsO}6t4kk|78iyQI-}?a{xG5{q5a|UPL@Cp@um@xeR2iLC%%!uYAYwIa4l1hO%E`n7
ziqFm6i27vR?0IxgC<`!!y9ObAt5c2GF6}UO^ga7hc?QtVZWrGgVZWRH<o6L-z9*@X
z{vFq$!}#HB`DrJxj~N<_wGa4lwbSW(45GLy^?o2?ZQ!wPjwJAGR0AT`ob4MIvw@#?
z@Rv4!S86r&-IqaxcBMw!6>b)28%d$CyNz*>VS%&lR_h-&X>ImvSx^=V)oWc>Lz|(8
zHN=_UV7N@c$;n3a=lu)g`mnY3UWGBs+CxtQG4dL6{0#C?h;gWp^9igQzEu%0QCyNJ
z9Lg;*5>v@+%ZXVxd~Qt=G&r{5ZblikJE)z~a{ZNLBWh=^b@{c-i~(EToRFahi#2PK
zaEq@8Ic`b?sm(Tvxa-;eJI}%&d}*#B2K7%5^@08%;0j$}$nzKNI{_o;n$xqh?HlWU
zD<F;+c$8%+a1*UKKH0wI0iyR?ZJGM^Ad2bX;Q<<;^2cup@pS%1E~m3X-nC7yc^M&@
zQ5ikv?5yU5JHlGgQ40qV&e*W-H;TGRzrGYP`q$qrq~J3#e~}|qjTp*#zYQusK@rQX
zn0ALOBN%wuC%L8OxieEr)k*EvQ9U+<O?h?YYKX;EZ-C&0HMF-kr2r2W7T*ZeF;&yX
zHf*Ajr7c>(V$r{;<7D)znp~gwe^V0bJNDqTxda4yEobvb&TT*@IQs45W_g2@7RdxW
zZUoI{GZ3dzfUoB0jfSJxTj#8AWR_$Du5npyhR{=R#H9&5Q#XmmG6@YDT|Fh@nz$_L
zp$0San2$ft5q%-GZ?dL?)EpHF+O<cCZ2!f|<I2pAmZ~e%&n+hS+nD)lG5QT}mKoRW
zac6_jQOoFi4!rN(fWb-&(*_M9IWd^l4ZLIH3ZB<_WeS(M`PcssO2*`WY+&qrzYWJU
z=rA2aG@S;~Y2Y5?=ia|$QrS~X4r-jZN9g+YTxeuenNViCt@EOyRKyYY(MncKTt2+4
z?Z`23V5H80pUfm20c4@5^aNQ9dR$9mFyI@Mx7Z{}yY@0fB3MMbvt2a74kyNX=B02)
z{$X|3f9jyUt0aXn$<E2^3Ea4OCG2y<O01@+E#~-hOKV08E9A@{wCjeawr@CWV?}p9
zXZ92{xOIspKaEW6T!jgI&l}%BddY4ip}}+=NUZR<{xcx>k|Nl7Gm48u!1r7p_*#DD
zHOAZKu=RSxS#XB}g)VZa)^vVLn}<TSmo>G*x-ku<Qxu+Vvij%w)p>^zD`FaV$nJXb
z(KI46O8y%(X9W_-z19;yV(T+4i35y-lMm)RQ^nCCRT8t_vn$RFhv3r?%Yu;`r|N?T
zipNzBvVGv*E;$X^+uJE`6{5j6pjZjL102r2SH{5Gtx*O?S#E!NF#Ou3{OtRLQ8R$&
zdstEh35A^?D>xmuyE9({A2b77L1NJq!%sjzNGiDcdDZLC?)!GpF8F#<QvM>R$O|G?
z)TWR0j-E8Id#9WZRtZtiwo(p%AWf&MjdJNCCjO*dNalSy!(x2bBFJMf;bI#F>PZqE
z?j3(7lOFyYtKA`zHpGAmpFNn+aGsNGhq8Q)>?k=0zR_xmqv6sS)e6A7^R=~`CD>$4
z6TX$dIH6y*DvKG(>GMsRKaC6i8Zu8}k?(fs)Es8JCgH8EZ11@nPXW63Yg1byt>{>9
z)#!Hw`uv|tl=!91Vwrqep5KWmVb|>>EpOh;$;pXyJ`a;7oqtsfs1(^`dM`@Yc%$dO
ztlx1<h~@ae7)Ki$G530qh>O8<K*O{X5{G>4@vS6fcnXo5UxQqSmu0x69+{Obn??Lp
zQuwhb1|HU;YB*I}Eo;Qp7j}}5Yjp5hPZ8v7#>m>-;)yrQm0OMkkd!_5;TgJsGdAs8
zt%M)bYg(AcJWA;4AYAEC&awNo7NH*Sr?jCg#jz*5mizGo=y^>}B|APn4G0Q_K?2FQ
zd>8~gZm|7L=2Nfst)SE;pTnUK5?~A7Hjho{+^*|-Z{i)nyq<pU&_CUEt@hL{o`Mv}
zH;@7*7>?=wudy+pPjP&PQcV?xy12(>Xka1vEeRhzfMK2~aB;F28D$hTp-7nb3bB8C
z@<TD+c-NS#11Bg?5e`52{9w*n^ePj6E#?kmSJ)W2+SVW6r6<T_StuBl_AP=K9FG?k
zEYf4+5e+Kkc!>{IpNsW4I`rhNIzdEHx^I{8+aQXnA?3p2z`@^Kl5A5!?#p|}&(f{w
zfMH^~_!@1(H<YoRdxo}=&BZ{$laMrWljSP)T8+Q!mIXa$Rn;cDAQK$pv|DY|_bEVv
zTi<2Z-@4ADY(~Fb_*#wcK?6Tu|0#@bSA9Sj!RO#}vG?t#UQT}g9^;{iMJIDhG<>D{
zZW;;(?+j`g8kt3!N-E23Cj<ATZfavX+*p!yt;_|jxI96HQ3BuBLShaFy&^))lUFF=
zVn4S@Wai{>V-kuXF@WhJi*t2e1Yk0J+nH80$f3cH=7zB>DkZi|U5u-HgJ5g6R-BKS
zfdQZ5<JiNCbFAs$1s2dkDed+!@yD`)f=8@G-b|U*!Te`ZiAJXU=W<{|j~AYGF|VpN
z#}tDT&bs&G-`FmhLjY)c(+{UIrj)P$iKHKUv5Z~H*Pz7y@=s2E>OSVLyM4Ua;I#kU
z;=Df!L+IB)FpJkv4U#we9%>ywrY!~Tf|30C)h{1>I5(Y!pfL5WR|7v*>yO_1ma@Fr
za|)<96A7v?t3VYZ|0Z_F9<IRY<g@jQo{_;C|H3K%7IW`YydI%ZDI*g@JB2(`NSafH
zCLwhDZ#0n->jtq?U&z18bG;bX;{*xooRD}MWBxP@Qjby8?K~~K<Tc-XXa6oIMF-8G
zSo(czVdu&5UauhcGO}e09=TbnjI-%=aebZX^XcOX_=IHrb-@M4V#GPR(2u1Bt?hda
z)fTaiRvpl`S)DSUtG@|SK{XBiA3#d0L(hYT>2yZl`ype%O{}v{7Cx`XrrV<Y%r)QB
zrt7M{=hprGJ-+AW&DK?b=H>9O8V(~(N1w$Ufyc(gf2AHIZ!X1iZg)8D^eXzFsq%W9
zgQQv*gTt3udY-X|`=SITZs}2mO)+unm<6=b95MU72TTiz2B`!ldNhyA7ypvKqq)cM
z`w&^M1Mkd-hcoblOvz7y*9>zKj8YLFXv+Y&P^!s&fhjQ^Axidn2nepWa<>>FI}%tw
zw*pPEFANx7(H^gfRzm#cfpt6+lO}ATy4Wy0M0X(p%j0B4^Q4pJfk;Y^7>BU_md0B7
zz*CfRKL-<zrF7%UP2jZ2r$Q=g|Gx(HC&=w{cHS+1Zf$os?_YghUTr%KAvi2ADhm3q
zn`d--d<Mf1JTDu5ERXVw5o0ybf*HO{YJQ$1ex5{A=4-XuEI+Io0vi+k?G7i?>TeH#
zs|Gv0(~AR+Er?71R7z9}vkyVm+V3&>nghjbwJv*mu~ki)sDquDj|p|yp*Ii~{Y8dK
zCx&z|sExQRSLYU@Tub576W@1D=n$~!5}`CH595nx_f386F!1AFCFS}X{W+jygIA=w
z?|UigV=BC?6uBHO#TSRI@Jw>7+p_7-PiGwatCFP`D`Ejn{7aCGz)1?)M(vk(*~oPq
zr|c@U^EZ?{yb$@9n3=h<Tt3TCWE(3rZe|@@V5c>6E;qb`-Fb*?O)F8<#284T%a{gw
zF=F#JSqvfsm!mnDF<%l*q1el}jd#@GX5o;A1QSD?eC|ApA*YVfsk6m&U)&`ytuhg2
z0t^!_+f(g-Gj$N<`34q$W>I{^M#7%*P499s(BT;}OZ{0RjnZPRC9!Zz)H25QHe(sh
zUTYcmSX>5wxX)wT4}#?w!Y}U$_?<N}GZpy`>0u`v5l?Ju4A9lB@hg!PYK3V->LQJC
zX)6|~$ORiY3q;|CGVS}b_9D0sGqd^=nm*X-v*0mF*mjw0sH;UOW1Xwe(8;W6#E3Y~
zna<Cq+tihyP5cQ<^+cSnjndV<kykDXk2qcoGN|OOR=P-8Y!{Et%iYk+3W@Zj0J*#B
zbEF=v3kF=tN6IJz0Y^MeghRfU#{RI6<so6s3_HsnX?iJ}ZkRNT?}05Gae<+kKnyvt
zF2`6lz4GT@WGHUHRt})aNR_T{=|$Z4<So=8s~C1BLO=x6xIjkvyF07YJ-!J3rBt?k
zbu-w!Fi2n0VLx??*T<V{&Hv~zl8Xm#0taW_5#^F8AagmP<X<1s6!b<Ey*|^p)H*=~
zND3im${j;Lq4Io?rt3OWc)>PKInCeT=vDfn!7^{fFaoTFay6W9T^OF!Vew1(uvx%L
zJZsD%05QeXT5xrc3Zk74wz|#x(`p1fM`G#YLG&ra$7os6c8%xqcI$yJ6aT#z;H%yF
zZXll5tOB#exe4;(?O##wG+sep3PmAqNl+ogkZnBUSMx%5OK9lXjsKuf{(J6~B_|yL
z?ogZSV*0+B#MvKaU0+IgH>fGsVzWDU*6$6M!}9z*LxA$74NDqs453(@{pWslCxI{|
zRJ;s^rM0#aP)}SYWK1jU^QCt}somt$t^=*OqC6ml=^{SIZ`nR~lt`oZyI@&hd}@4T
z%N|44QsqfN#hIKC5l7wAiYBcE<sYbpdygw9)OdwKrkZf(T|)+oo#~aJ34)jH{-0jo
z=hj9(w?UF#y(=gE43iTNVpaDeNTtV+pI#%Q*qeXI&}n;cvU)1#ok*p6w*}LsEz6=u
z35|{x;W2H{N4rNca-yv$<RxIa!{mV+088lEeAv~tK*lTyU9O^t2S6V^x<=(`j7lx_
z=m$`OalvPvIhFij9}&UsUt;To?q<D`BbuERe(p#z6m^ck)4bFpOyN?)@j=;iND?Yw
zCnexodo~PO55k_FmP0?Bx>PSqP7mW@LDBwVs%xtm;(saEX_<&A#j%ua!XbuXH+`?$
z4{3YeNC^W}2`zg3yJ+vkN`|}`^Y`5bUEuJ?KfB<wQb}2xF6CRJsC*bN3I_)}JYqmb
z39s~_hLqHQT`c(lNUOpWGlwGLy-Vm@A~#_H>rdbBW|==jxP)~JAA8JLa2pM>+2+mk
zAhurW>-r-<b8uLho#^Lr#5K$<9OuFN%jyi{=(y@T1{o9f@Ep4ovBB9$%NcC+5G`&A
z>ElKgvUYfm+5(sZ+|L*xpLjBefsSuqOhXfRFr`Ma)s4PTw5eTgT&OP|LSV8I*_Lg?
z9it=)28#=oWQ6%n9(=;?I+E9RbG*aK6N7;XHSV^v^HkAA!4)-8#i(BuX($b}I%1$G
z_p3P0DjLyYKWk)nXfc0j>#al-o^Lph^nL4Ggsr{7NOsLYG!zb#w+>k4OU|UA@AYaB
zv53#+zEo#AHS9@P5|5k{yut*RoAFYICmFl3RU4>MMf-;Jw4cEROCB2hn8|5+nRMs6
zX@vYCus(%DE*a(IJJbvwYQz;LJrw5vVCuZ=y<S6(aBleJ*btqUatTqJAquT4tBk+i
zM9#9L(>nUqrt`|Y0g4crb2+myR(NU+CtuOgzc{%dy6HGz=2|k%0i)KZy<sJ-fPPyv
zJ|UlVIvKQ%b`0l?)4U9n7f=bA<YycXzSxFm$N|^oY~hEGfnH8Zug98IH9g=Z$8!C7
zJXj&@%%TC18Hc?vtR<cE7woP7k?N`17@EZx*KoMa*Pof2@bib<L6RC1P)9p<M$dsz
z{O(d!WI*|Ev1M$28$ZU#Kz&w0J@&9u=>!o(gpn#2kB{@Cpb1x;bMXnPQWiLa5xu6r
z@pv9_(p0i@({XXhr}rrG+OtwssmWniN0I*_xt2+r(U)z-2)Q>Ci~U*p@%&i7n2lkJ
z*44g<<k?UHUo>-LHP|%qT^BP6jUI7}u~gqcIq_4Iq8ZJg4lRzqKV}o-|I9^-56cDM
zu=Rf}z;+DZ^3Ih%KNleQFchyShI0Y1Jc>RS@4pSg`e58Be%CE8OAT6~g3T11uGMI+
zLP!@f<3P#dPMRjF-5AijE2jR@lJp|pKIcH1Fkx26O1OFqJr721;-=QsKN)g(t_Ft1
zIReH?!}#bdO1TE1{P;(W>BsUj3cDSk5h*c+edP9mm~(mUiy#y#Ah|V4Cv%6W`4#iy
zC2EIH{MQ?dI4KUkItFN8l6I!aLtkNtE-ho?M~DaT&P;|<Y91a!Z+fQ7W9{K<m+?2b
zx{Ps8m(It$tk`Ij934-v&2`sYxeIob>x+C__vlxF_f=f+)enw#!C$1R+80w_AzLK6
zd2oy_nNWwKyePsP4h_Bgbr^#y+OO9s92n6qk(b#RAA%ydRfj~rjnB93fJ8%&qrv8&
zdJXqrV(aDD7;7}C{;q5XUP9jZ%ef@@lr8|yejf{}cF0Z4iCV)#xfb2Vp9P!qBFtpl
zBJI06r-5a|tcnRV4K|f+Z1>nn5s;Q08`RPIZa)M6`-`B9>ks0%O3ArF6A$jSF3d4r
z$?<a><A^IdGPuNRib^8SCxWNDD3z3KaIm$A8vx56X)vSV{;%E(V6zvAsFOb$%Jrxu
zCZ5eHSBZ=+m2mnRvA))93}1Hhmh^tZ!W^7t*(;`j{~~V;>*6yIWpkz>Kh0B}(DY;G
zrqE;tvkb~40)5Ijm=5*Jp`SbvIJB;dV2pbuvzgpE7odp}Rh||7-am#a*8#J+-ZaBx
z2ojC0w`lfi{W?-vzuI`g6#=w(Jp(>n^^_Sxk4oqVJ*pC15g0H-zh`2>9cS(_6Z{V7
zoj@UR!w89vX+&XJ37P5{3j^ZbU(cA3WCi@l7iS9Uq$4e3;en`CuJRUx=KebEDydk(
zJEtu~2obLu^_V6UCJLBqdsQEe3_3y7E&0q{1O8<-)8d+#XXZqL=o%Bp<2aYaqstE#
zyeP(xSPreh{f<O<XknR?WtTB9%`xpX6m(N!p;wp=SR?T-Wpc*Tee{pH{zzcrds@6l
z{*Lj^U)FfH@S&A^ZtbRq9S2H(U}Do2g9P5cEr$!wpklKQ1E7^jegp?YT0F`(*}6uL
zXEthh0+Z>0tb#Z}Tt#qTZ9&mAndQ-==7gKF^u?+JYZ5%tw(<Sct^sQY4@Zd3xhB6x
zoKo<*Xq0z{SG`CSAS$IHa7l~N5EUw5_=engTD4A2wA6S5x0qv9V|*SDl4eo{*jOY0
zS`wahuYN?;s+&}~<j3uTkc3&_tb0F_*Ft`-oML0+F4zEuzTbSg{<`u&+SCe`Ol%>#
z(nQ=qyzvE_6Ui`ceUge{_DZVH7*@8tpvymBLNX2Y-x5`nNl3-LJ@<=SMn$-Vk9g*f
zuy@`Ym4u4bk-}uVL{BdVfyKTfA*&>$DH0o!rN%a8HW}A98B}`xvlr5;D64Ij8NxPc
z;AWd}F^*}G3IwlfFB#W(YMV}bsI~g*nS1%SWjy<G<qSEgDPgo?L%0&skRWF!-vAy>
zXVIZnURe&7BR_&JS7Y43_o~^+Qf44})IJ$IAPHPzlL!t1wX1G_{yTXDaZo%I>iXw`
z)n@zw8&bhj9YQhI4~2Vw4-YcsxaP;W{JVN3O$Azz)I$`*&Pm$q!)axF&pvVwmw~Zs
zhP<pC3V>ivi%dk(w!x*r@Hdih5VBFcXMf4X+zJj)^oxlyY_ZtQX?D1aY!<Rgts@JL
zs!GQerVcLp{Z+QGnu&*ojWLRTimHOwJ)ybx@X$e1EQ^NZg6xDxRH}B<)^^$x!9(9g
zencM;klU2ADRh*I)34JH)*sazJ<RX16{&z?TtiEl32hyx%_{wU=#V|O_&!h=ZR4+B
z0ppkHk=LgT#t-z==0t7-zn@MtR&b%9jPQkc=a8(0$!nl8jhK-_%E*4Hklzi>tWrOz
zk}dtq*DHJ(6lFHx3j`CXQDJi*n+UK9Q<*Rn94wPJ*Q6+nt%>AyFge{;6EnTPVU8%+
zd3SL2aABN{9STB*HY7LfI6u)8BE&6R$TEqU*t*hYvhUZ@%*c-+e}GMvoEb~HQ1u0&
ztB>n$RknlQHyIMa{kEHus~!*RBzZ?DXO3h$<j(wulBf7+3zSi$b|NeZBnH!V2AACm
z<tR}WTCn1qR_c=FJV8!_;9|3XwnSqvSrbn$$zV+h7(xWNi3!-u5peJA6!QMQ{l?|g
zmLb+kS=AN&#I>vY)Icu63|ASLDk*8p>nx#UmJ}mobqSvm3R%Lsvo@hAkKn%*PPQTw
z3;@?K@}beMQxk?Z2>d$XbaFS#t|Q6`+qVbYoFHqQ$|qBbmnIcp^CBE4rjn`U(C%k?
zI1=yR&{Lw1j|8`b6whij+LsCA2^m<5309pV%4DJ;99F>52ii67PURBD*Sl+11`x^d
zjA4x?^c57}gF@w0w(-#-b50-<QrQx6{{(g?dH)S^f<ORv$jmQ<D83B?qi-!;7t!<%
zoajeT$Kjbon{9Na?@EhGnhgmRd+Ta{H&e)ikd>82@}^jlkjTiv4HV|fA6+#(H~|Ll
zbgQ`cSS)6C`630JiSb=86)5bE6H9=|L}G!tF+vGl7?8BwVghx{l?pD^Jc?W+#fjSr
zekA0%b(zAVNr-!g&x7A02(B`AB}rdeL_!`suETQ^l~sARE803&n+!TG=kKT|tEBRe
z=;hDyqr&ll&lkot$~vMwP+fg35~%?6iwmm;Ey>m0G7h@FQt?1sG=33tfb~fd+WQ0b
zAvlbnEW;?0PArM4&OW_=j}*~4mV1<EEdz;O$4pR)8b_p}QlZKFZIr=31k%9CISR@m
zAqkn@`O=iz>suCZu>Zbg_77~r$PP||eyBDNRqo}8GYV!8F+h<B;#zT5N2G*(x&;|8
zuQ4v$C5mwLP6#l1WSAu+zJUcD>O<U2VPN6$mzDki+MUhF_Uou4uD{vTGg?l*Idlzz
z$uG#_N_FNVZ2ba3(aHS+6{zS%_G(%_-FX3#!*dEZI3Gr?#@~r(re0sokdyg+lH^)s
z0YMTHVwrIxeZQVFq@qIJ*@B3I&A>t~$|_gSbi<>p76jWpKAFnH7WA%(WHt%PESZ_b
zYc;H_LuaJJ;aP~(K)pEZjYJ<8JG~12U0YXGh;>#r9Eh`R8;MvTWL~Ebk_$&6QB7<_
zpibwb6jQxQhIF9i*{hSrE+t|`P&oDOpphaR)f4APNNKCcSOks!Hj7>dgOZ?lXQX&H
z(3%-+*&Ps(aQY~)`K_e<S}0P%rdrdpzRtT!v^b1oK`SYFee=bP?(MXJyYok~#<j4>
z?5i7cM5oN{sCLAK55~bSL#1IiF`G`)Nk#Vt+#m%Ud}S0q#NrcjGaKwpsCY%;wvJGK
z!|7@?<pCl9q=lS3ICE-N>oRd;$#<4BM;~@M92zBkeBq8imhyCdH<1{f?9)q(2bl-a
z;+@5fXd~CGG4<jbO#O1qHaI}~Q8+|Ls(aR09YJS+E(s^I?s%RvJla_pO6qi**i+_D
zzJeHbp0rE-hhPYQ&FEH;yWxQN>??{P)c{)?MXzdf)XOt15iZ5veI*;@oD}?MxG3$w
zM1W+}X<8-Ki=bd^j-evtWm6zA$${A>!Xxtncdi9?DU%+tJ2|v+u8xGWqp4~odTrPz
zG>u87Tv~Bh&@MSL3B@{-mLi;i_zO<Ds^ebJ<gvcZ@b*dh?Aj}Aj7H9;*>8ZL-=GUD
z1QXqOL#)HwZbU$4MUDydjAOF-T!piKUfcdr%*{$d_m7u+fxud{;;hdMgg&_3-Zxu7
zAHrBX)}PDdR5TtI_15K^<N7M2UJYd%P@eNAf?kWOcV}FEm_5IH%dCl2^oiZuz=%MK
zM1%{rSUREx&-6{-`oWsE4nuv9NCNLUX}?ufVF~Gms9S(W+LqGGbY`fQ-Z)X^3exCL
zjpUW*QaK=uTz*U2TW#LW&|&XZ!{_(CeW)o(6;=qfP8wl`lGOy3oO<;4Z)569ZOAj6
z?M0rB!LIY|0`y&E-dh)*AJ*PZ3BkIP-AbUd`pu3@2g7+$x4)yOxMEq$6$Yll!V3Vo
zauEl{eEEgZ@}N~|`JBgj|31lCqbt<_g<ckp&jN)enLxW{*#6v#Tl>}K2%x#X8Pml<
zjqI+^!?HyAmmA3!hz$DHB`lvSIo02<r2G+-vbATN9@9@2lIaPWVUh5}N-+^LG^&|S
zX%_3fqsd!)Hgi`KnwQz-_#Tt#+xyH&1%+2$R(#{48omr&8p$XoPeVmofWWdom!nnN
zf65)c7^#t~ICFimF`%NQ*Me)@T}=4(jMFk~p1HTU+1+89YS7LKEV|upzJgH3kym*4
zkE80Q`#6Wk8-jiXT0Q~npKnxqiI*g0Y134mz)nxHt<)8_jvqQbBZ3vwmNDMG7AfZ0
zWzQPKYS~0(jqcMJdH!a03-kq)C~xanq@-f;5=?FP!aR5+yi0!z{7&nv_QzWr^l6vp
z$3}8(Q^&p;@<i$fs>R{IrsQS1Un!LnVMI4h*cBS^h0YyF&Qh8oEmKvv`dohWbV9`~
zte?Y|{wWeZD7G$zqUpfArijg|EY!0oK0JQwKl;R9`J2FLvJK@!iF=gb4zGM3E*a<W
zP2{$uW+1N1h`MOV`F9JJl$6b3>87rPr{|s+%k4xIjSkjm2;|1>3BE@l^-NB2=KM(o
z3l_RasZ8UMMO^*<j6*S5@PPX;MhvLvl|pv4{`xYb$C&6S=1U$m@nas%q1{?=nCQ`)
zd05+*;6vCi0Z?nRN<I>%bIIB}jl34r|I2=N?FZkRO+4KnZY31TvXtdJXy!VAec-J`
zCnH*ZJ<dDeNyn?#2Fk@*!83jSUASw)%Ux`M?)7Kq`Flu~!Mbw9mMS1%Wtri`e1x=%
zkRJ}yWY!Q_894}LAEJCSI-N!Bjs>>>SIlZ@%%oZ;^E~jGe=sp6zw2Gao9ciRB?jBd
zO|24CqL!HG-JX!YZb;G{jBqwD;h+ye!ieX>7P-^OA`fXSh=Ioh%lEk!V48N{l~~cy
zrlUlmcR6Hs|7C%Dl@#v7!OofP5&PYUR18I%lf73(@-2#)IS*2$WgKiFDY_w<Gm?x}
z7Cm(j6Z6$<SnGHxNi&@$vzsWKbIJF6A&XEZf1eRDEB=}?#j0dQ6@F~BB0+LV#$7t{
zu1Zf9WT=TnEjF`2S_`Tp!&vKJhKQcFI=tyGH+~iPMf9+p5k~`(9tUk@KAJF@ydU1%
z#T_1^3O!pm()Kka3vFcXW|xm9a21Y{tmvuqol}UdWV|RN6fA5wNH}psU$As7<Op7V
z{7_!E_95kJke1uS6!Fm}1~W3j8R&ifXzU1QQ6}YC_~Y((Xn~HFuZUO*W&$J}WK0c+
zu4z`PG72ck(^Ic0(#`xD<K-mDNHH$f3eQ5Y3^zbphC((t8{X0MW@;38Q-s500#dj-
zY=>&2AKo3uRzd)SglYt6r4saVmcl}|3m-lGJP+uBaFgo;oB#GogLa%xP_1m^SVn&R
zr5>{eUbs?0NUEIk9$s?R@mQw$O`F3Tt^)57Io?8Rgg?g}Tf}S5OMpxRd~0ZhX|x+?
z`+dKx{({<i86zT;S0;-kEV{D89SfDXs~E@Mn1zaZglyc`0USkrE-^cd5KAkit_se=
zCL^Hp04fwRLbjwO{g0#!*y3?}=0phM#R>VZ8)CVuPZK9rxbKUdPK05z@S$(!f+lY9
z7Q+qX4XR=V)Tj|wqlOHbQ`s01x^On~PF^YysB2MDY%r3DU?Z<PbcV09@Sm5HNuYXr
zpcZdLfcYTNKoUHN)8$dNYKr=(q|8oi&3tsK;k+s_friaY%$9ALl8qq;4l!yWUl(^;
zgQMQS57n5{dr9Qe%cdlR7Ey#U4^)0FSnJ+{w+%PI;9e6B^khLt`($)SULh?gLS?3{
z7nct;I9!?IrN_8ykkZcM={p=nB-oxu@F7vL>gnjzA{Y6rc%uZ=x<wZf)3RmmCoyKf
zqF@IIID|S-r%0h(Sk;BI@gy)w3A#td^nu?@J<%$ofkHn-3a)lk+_c<i@R;t|qjc4L
z|Md}>ptmH>e6*xELF`X{>6*h>=;$O_Un8|p_)^{(!<)aoqI3aA6cr6M9L}(V2}Qg#
zX32hu9)%&54-rh}$k90#u1J_Vda5F-GH)s74~ssnxIqN+8r`9okk=t^cQL<!EI!9D
zVab5s@z%vz5}n94lNrHSq*6Dla3#{+auEojZ?Sca>PgLRTi^6T;Fv1-5gEO1R9_lJ
z1<ieWMW$ELA21#`3js)=5Fr^BFTsnz=wQztmHI)!Ibfdg-VwzG)Q<8i{qQo)h{byY
zEM%gk%ueR9zd=PA>5xUFMQ%m8PV~LDUQkz|J&NN@JEbYWQ(6o@aK?uq{|e}JKck$Y
zA+@r#09U<ko_J(OgTt@&5}xFk-poJIt**0gh>#x4Vs_rH$cZ=_SNvIl*oZX2sn#ir
zclia18?wCLI#v1#r;^DCXaX0P(2rBNa0l-kl2#y}Zi%EMOyOT7Avyc)XsR@$s8sOF
zAzg@w9@+$KF*{ARiSptpA?rBw1)xj3$VL5eQ;_+7a<h4zNTd(XpBQxw?O?B10e&RE
z2?XB4R+6&P&{umsmTX;kGC~6E<-}_jxJMtwJP4k)FAaZ{R&7L&Ql=s09d5yxDK5WX
z2-!H>KqEh>qW_n)B@3Wvht&$kiobC>HeHUbnfET8hbpW9q4ZoSIm9ccCjifk(rCPj
zk8_Y5^|94bx)Y<ruBfTntENTmSW^jL2mOJn5CgNc_<~X)CBORoo36)Vyi5)i3-{J)
z3(DaID>y&yomBKD73};w&jj7(&*j>TexHpIgr<zZ!}*CCx-K;BpS}Ae?-|U@`|MQ{
zK=6Th^$)|Sv~N!5QWsRl8|#N)MmndHy!Z|c{%Yvmqau_7?x@<8DY~MJLq=+dI?)M7
z8_>9uV8(W$Ip7vNpDHi|h~K}?%kBpX0f|F!Cz7GJTw`K=Dghr+E^?#`iT#^*S9T^4
zt;38sG(>NUcPN|C+-hh-;Y!hHe;uHr!Ov@zku`at>?5-#ygFlglp*UwCVa`_cZpm+
zdHoWJiZ5jC8G~U*k>jReqxnOKL&Xl3#+$28w0*zZ)Dv4(tu9gV@Nx-=0+`=0!HiE6
z@Y67}Y1EKN-jGs^htFeT;!sc}emAKm@!aLE_o7|YU}zk&qG=qkE`OC^$LFs@pP#St
zfZL7JT~9DaW|h!PXdt&ZBcM`+MmV_s`VtzI<lM61Y@rHED-W;@mig|_MZIB49Mf8$
zCUCB1u2NDGBO0!R0*MZgU}7UQ0NM~MsdXEv2=73CR}<TrB%Y?ziFQ;G-i;3}>YK|T
zWu@`A)B8-@=tSY0m&&9D8@(y%OspWkAqrz#)Wrz<8IxvuR!QqA!K9i2-AW3rV=4`T
zUD<sEWlO<glY^y-#n!|V!epPLCR<ZWKGX5Uz#RIqR6x9m6HvS|9TjWrf%NF-h1y6v
z?@7wJCOkZVp1L68@5Uw&{OmeepuhL)A{c=+I-Q<BVCl@(P3;EM2M4e9V_dA|x~xw;
zC~}PWtIq*-Q4m~6;jv9D*dg@b<m4JBW-15}<?}S;M~uKqQc_3X^I#>Be8BVdvszQ7
z7Y3>9)h0h&m;~J6Pt3uZX@6MDZBXFH3{pS>z))L9SxV1mR@EBj8R4X3Lz$cQRkGR3
z=YbF3&qsdkyT>M#@`_z9=q@Ut$X^*LZpOy!eo;zH7)<Pqnx8-8j~%bH8_GM%Cydw?
zZ?r(J=2cFQd)Z!?np-FccH#K5Uo5_XkZ#GVXarmkW`i?`3VBo=U~(d<F~3Ypm3KI7
z7NX7^ndI`xz$EqfF4@`C6+J(}CX@80nIiT<YGh%KMw8x@p>u8qF6yoR==YO>o(P<E
z3YUyYV_e0Eh7_X5zlz3uUcmurf-yu`1cen{th7OKPfkf-FY^|)mV80G>(B_Y+VnYW
z^IMRK52Rd==$1vRC_fJlN4#~}3deN9ij%6X${2qT*cY2{T4~Jcd1WY2!X&~H=4FI|
zh$z(m&c7qmX+d^{X@|!pJPdm`^6dBZ3(IaApn^&dOR}JkMjWv;qa4sz=?EuTJ{>gX
z*SYsBtRVUj4(FoM!S&PP7X<X(665WuuEUix)8YX{Gpa2PH6tGJ1kXuH>I|bqDOvyu
zOLlg?$uR7o0Sp6U%FuK8JLFr3%M1K4)F~JDMtZP`&r(lYuV=^K*nVM5+>#P0<%Om4
z=xfq2_yj{ysL9!1K$C5XZ?0%+@d-3Ra77S>T5q;YkeAQVi(%EeM9=GbnG?7frG$@`
zLSkmcPBLH30_h+C!f-Isya!LHD?hx}Pf{xtX;p|Z1$VWAPSXP1yhh}QIT?j?`bQ5b
z=pl`LUPQ{%>gWZOqy#A~awoQoYu34Him_06iQSIBuXr5)d41gLGjf(?8NwuFT~GoR
zW<0cZVwC!lUIp!lGP9p;n;Y_oyY+Fs<)oh*ZL&@<3{L(^0mKweroc9;LP+2|RRhpL
zV~$2vS6Qf=V{6<4k%Ue%3<I7@jxwI4D1qK6&rGecfXyNnfalI$wB)#khL4|T<Fjlb
zbY@7pNQ_65XQ*f8M{SUDZeG%govEFCVFM-&)f_P3Ct{y0Oqyq?P91CqDXuhWGA)^d
zy_8qoo$ILl$w=Vfbm-QD2gEsp$U4JRwXcto<k^dlK>NXDzS=PRTY5vKcgSdIUvqNx
zXhUUpM`K*C=Iz(*AyAK>{ZOt5wEuNI*cEN}hCk71w2VDAcJz;B166TkA{bK!Ir`wX
zdR~E5!ys94ssy<Yb*+ph-;fd$i@Dhs%&B8U9k_JoeoG(naBkMnNLfdPiZy{#?LleS
z^;l-Eqj1wA^x_TlDKrO-rS2}3Bhjz4p;T1WDUYL|zIF5DdB5JNL*yG!L#}8i=B?(}
z6LO`Qd&G`9jfp`?rX4G8n;Jo$WWkBmCr#OaL4!sx+^ys452DzcN}HR$wA<fe;ZAGR
zD<56g-jryV_6E2RnFsDsVK3EDy6-fuM7PlKH0&d<$=N8WuNiM$5#g0xC;$^I+GRQ;
zrAa56G`nmY2{}R3?37$X^Xr1^spWS}6w+Ut#=oU2{){mErEoLcn2LjUnZX~=C#Oln
zw8kD0W>uD}Uqj}U!JEPyxivAF_7?MX3m7<|Djh4nzI#Rw|LdS23IG|`hj^oo?EqR}
z(|cs8<TXZzT<bAg&X`&&!($OH#^!8l@bFm5rDpvW@pb0-$dOsW&ZgAYSe(Hcy`C7t
zejWmvUhGUBpu^=K!l3k>S7fr4zHpP`?7#N{Ah|>LX{pMnnfwUal!4RLI?|H5&~`CQ
zB#g2yCi_I-v??^O$r_~iCHwb`p{6R;!eo<nuaVmm(`H`T8RwEcHNE>nHqfmpQWKAu
z+?E+EJ^_)NCQLLjF&27%o{>RE5e^-7(hJ=To+-=bTJ^be3C;J0m3UCfTYOw#umVjE
znlvRM=q0q2DR5a7;hBr{M1efaRl00~NeN9|KTZcLA6ZN&jj7eI=+AGVRb|frl{+E_
z@Pmt~CFM~;7`o=A!RG^HnPQTK&0ww)r4nH5Q<6)T^a55L0`=|qII!=PJ)^@-*4i(3
zjR}>IKYs<+@nMtZX8L>QhTm$FE^~V*4!%AQ&sOQIrV25hjfh@L!3Ao5B29IZ{CFkN
zOZLLcSHYBUi3xYY@3qhu@31iu&8>HGB`0igepWM3wRCcIa#^KxdKM)|#M=GceBq*B
z`<IGYO`wt8dbRJEgs2zyr5&h}9rGvszriguerHTIl(d9jWgM5ggPDrKkBd;j8n)T9
z>R_AfivS4_8(Q?`nhRDrL$WlTn5EgF-RhrKVN1%j!+}$>smA6?U3n~!OFR&)1Ai%#
zmR&4333IM3Nf>a@l(ArdgJo3(Q>iLw8FzNRH_NE*$-0>nX%v@+1nQS09A&3qoh>e0
ztk7i|b4ze=z3%gbXLl(00n$*^?vCLwki))b=SqByd{Y`-r!96mklGAK@aBcD>~wL{
zEfN;7$yp+NGim|N5%qv^T>4Fdht{|o#Gi4CO$P=O=Fv?DO&QcULgK>W$rO^9g319R
zr=Hd6N>QVzp&eRJIZ6@e?qNgmfB+7%@W<%b2n2uCi4}R|Y?<u+;_LX%N;m^HUG(#A
z@*y$1n6s(~S(IKS1}{>qdiul=4hBm@afvwEK=!TR_yY#y8%pVIg;#NGB5@tWjmg7l
z^Wrk6kMqKFfmHaCW_k;g(f5Ic0*nP|vxv<tt{)GL4Gc2Yoh=Q+a&;x06T8c`xFuFE
z-I-0(p40)iGR8eRLzUE`VQ{<GDm8EJK(4spgoZ>+veiSehg&qvw0QyK6ynS>49ch2
zHq%gfh+=<0NiXhlouQqriF%CpeOlM=COx7?KN@nSt_3KI_^*9p<oIaT>V4+0#<FiU
zvUw*IHS4`C$n^VBnqp^oXX=cjj=Jss>a-JJPjnkZzL%D0jE?uSbhjRsd7UnbkU?^>
zCD9C1PSsU5GB<Ku4hB7thjI(23_Sq)4{Rz~NqUAe_+%Y=8x3Jt^f-cKuts#s2Nxd8
z_qT~=3d!MXJId}Vfz(VAEQwVqhCxgT3e7`}77F(pf0UaV?sN^d?_i@#lZ)oqA@I{_
zbmGEq6n$XS`B{&oJo@vJ)Njv&P6UlE1xD6O^DEP^teKU*6)-#HSeIt|X&$wURX_X?
zI7xwD{#SEv9Tms3b%7FGg1ZGL_~7pD?(UwD;4Xu^yF+kyhd>DK7Mu{=h6HzB=XdX0
z>$~4~*Zcde)oaakO;>eS^{I1us?XlLVmA_PVL)@d`AMx?sXAMsE>X;$FiU`cup9%8
z?Yi9-hx@$+fJ*{3Wa3XaT4@+ApjWjG97y&nynyuOD17wP6(?)1(Zg%mnZ(^-CQPED
ztw_`KTm)K**v34@e%{eh7!`D3<{00RUscOtBCwR@zQ0WWqAb|QRN(tOQ2Bi#!bipG
zR+aud<xKys-?x^kqtZ+(S3;y>{G;yVL1As^3yC6%V?^Y5r&lb((&1r!u{iG+oD=^V
z3KnEbV^%-hxS77nHk0n=xr2i+q()oUq-r>%5GUnt!@HmgjI@e}3XX;`PTkHo<C-9k
z+5`f@9!jFkL3$@9J`&ERk0d&%tiI2`iU3T~yc%Y=u_lk1TM%QH6x)2GQCO@K<wQV<
ze0h`8=UV&E5BWg?6;3qc6$EC)>M@R)RUjR1)i6}t0SaqXL)QXibqR=KR5Ycf4EUL~
zzuaJ|(M>*WG^rouA(>$$Jw#=u$9pH8SaM)cK6sVWaCd2Oyh8mwb5nj`bDbD(i$0xA
zteDo^1ML8lGG<kF8Hdv$tzq|t7Ub<pZ9Yv(X8&Np(gYnx$8P#&A%r}$0>$9^;MkzS
zAM{8P;kU46rY|{|W~$I&5Z0S&r>jOmBK`EczxT7+oz~PG-=qb+7cOjqoh1#+aaQ)K
z0<~kC>zIr*o#CLIg*Ty}HPl6XL^?bS|MvT6y%78_Ojp_f&Lh5>;#4sB=I1r>j@7M;
zKMYQT2~)Ee=JUl*#Z0jVjSeXIv3CO~If%;L;#;M}o#%17it(Kl3qIjKFpzKLCUi@Q
zTc7((Yzy$T<81UHdp(ry-u7h9DWONM(&-O4t|Z$D>X+bPl0v%3*PHlgXb26Ke`c2u
z<feT-`UTXw=8Qo~7-bOpfkSFyQ#E5)dRRvrfq)w%fIB&c^i?H~2>?l*hrS;-5^3!6
z*ChHOGFJA?(G|9CGkxiP`*&Mn-lcteZ&WOutfMpdK-<yIZ8@en_PwWesoAL2XqhEg
zL%uSaKkS2)wBks#nJOEXzG6I{MoU=TyV;lkPbD||zE6HyJF7z%s<zTk2PA)K9su0e
zBe&x+tAIckkgfba&(mCVug>qx0mt*<sEpC!Zzl4F=T7W+I%uoj>>G32`o#bWDCa6@
zib4}H91DvD!wnZ_F)(3w&ZeE>!l=Iol+g2X?XBKi6kFx`M=fYZEJIQ`M0$@QO=<T|
zo}+i}%XyF^U%ECFNLa7;&hq^Gdmn+k)1Es^xt|SkMA_6o5`Mfrq<`eK{y}tmbh~rv
zwF&X-UBB$!xa_VOU4vF1{zMu58|jE!xgl%axH0(1>rFY~aO3!rAAg}U(bGBlv6F{k
zT%QzYL_aN_#s`i?meN)0#tlzwx-Bs>_^vj82ja06_x=}+>etDjE};|8r$560?}!KV
z9l(n6vNG-O?&x@WTvfN(>E_V)@E11)aBti!Tf{Hw2mz>x9{@`VfHx@n3n25qNOo~?
zNjLGoj|TO6IwSChBRY|4g@u`K)OAHpj_6{1)1?e+Ag66)eTz&(XJ#MTm}S<%$RIj+
zc)d>NNlA-L1+5Xu3O1|vwTi;c7t7M&mZD)9+hL4dXb-bG&<M&^aWBUC9%;3%JVZN+
zJA?qG5nsiOLu)h<Al~FKcPSM!(TQ4fMm!-2xzX<KE#IBp#asyWK^`|&<t@GQHv&a9
z2>O*Yev|zrfBI2tnL92tLO?PjW74X0q#x^LE1^N%$f`nct^z-7gQ&ynD$A^Y*JMvW
z*xsrSY0bC~b-L!`!2blCK`2tTUSDp{*E=o~W!@2XQ(!&=3?l7Ua|#xt0QAfo$XXV<
z`x*RMhiA*zrEBBm=|JSw9*r}@<l#@3@#Oydu^%ii;ogNem}nHKaXqv$vTs{ibHda^
z_M2Bd2y)H!I@xgT)N#z}l4z3hra8a#%jBM5e}@kI3C)+5RK9&fIH-d5)wJXF<_r2B
z)_XhH%F1C|{=`+jTZ@&|6rF*iR|Gl6&@4@Xi{1kTL^A{T&nT#$)!u4K-azBU4V7Du
zr5K^jcR?BBe4Ce26(i3SxfzdOh#+4K^a#4x9b};JA?M)RPaCJYyf98^ON9Bj8rX7Q
z`P=+~)kVp<9|l}+!_i}Weq!?auvBA^%ln4BXw9kbIf}71BR}7%EgRK?>VJaLjQ)j5
zb6=|vQVqTDNZz{9EEMPU<t2n^^vz^q84Em{r_a!VAAyowKPjDsuvO|I?R?i%XZ?9f
zRdiW3D22IO$?f@OhfzuE9tsL1vY4uFGwA#s6eoowITzx3?Zx5g9Q&)0OH=5a7T(s_
zICiIE)V}Vi{XNa6mG3n#9UO~Oefm5UsYbV8&ww8iI%MMLWCQFNoJ={SpSxEwNlFhe
z;$G#yrQ`6U<Yz^)i9F1xd%3c7A^Dwa1~4}Z4PIhSTcCC!;d`L%#X(kE#`S$hY0^i4
zN#Bj}6|&I<YX1rTet!IKDxCibVAJp^Xu`l9*rx0WYb$jTHc1&5Y$@8u-vLu#xU>-m
z7db<0`=-a%V2va+F-o{qYcU(&$67>0$JH_A@O=_kf7aBYGt{uvWTJu--&w;dQ4e#7
zO*b%`^`;XqcxnCqA@sE5NMXf#5uZ60)dBsfeV2}*VC6>}5f0lqEmIdsC)SEdPaVDh
zelp3Bs=ccG76OtJi5!tkfScGFIX_||qsfB)A03S1>X(|3-7WbMSk}e-IQ!exn}JN5
z`PM~<`O7%V{`MZz&hPDSP^D#MR@<kiOo7ER@p&_~EWLNX!ryt9tKa?phHm1ums)ls
zYD2*g@=cm+kz<~Z#SBatg_FTr3XWWFN8}Nmac(;)TZ{YPH}Pro%ru90GPW*0|Ka}H
zfU9-x)XUzuQs0VD9COE6SJVe9g&G565qukIz_r!-!h-{qR`aLEzM5Bd&iQsu=F+#M
ze@@qk(VoP!7vT@bM0YQ)M6uP6Pzk+q{qB<#XR~e_yut+n6x^Xiid_sl45`C$oH*8L
zDkW>RD63#4YWUf^kRKx!!;y`?BmwrVum*iLw;Iv>D;v?Zx(kJle@KEagu@7Wd{YGh
z7k9hiu?6rV`F5f=1EeZwglf}7zlusC(6yf_zv5WSyYLThun>aW=-aR>zHqD0pr_Tf
z_waV;pDAX3y?h+soNXlNZy=pxzf-7ief(}^$F`a*x2wtqHZ;P0?K1wt^ZNnciSV|K
ztZ);ld==^J%W8p*xx&|{H^kT<CL;Re=rtCm_tM0Fh;2SS?_c?fr=qGw77vNx^e>mh
z^Ul*|XACBBG=!`p#Y#!#1T!}Yi;R7g`WB0AGjmIeEg`c6^A{KbFg`(gA0d<3Jo!s7
zZu{x}0H?$@M&hrc*{b^h=FrIb%K0d)<YamgnYY1TH{ulTu7+k4@bjqsDSqP43!`i~
zWVkI*TQ<^(W(1VD67%C$D;SBaC`gB~a=($S`e6xMRYjyEcIKL1hlW%UtyXRAwj1`m
zgp5xUn=`1=t+0$ASHsGNvY=y=LdyDBP);~0p2ft%L`Fpr@M22R(OJkD*TBQJS!6G5
zyZM=5{zD_<xTCq}>T#++I#uxk^4b(x9l@_t+Of;>w549=3yMR>0e!~F%ocaiz3=q^
zL=5QG7J!uT*z`KE6PnQjBX6rx41(m}7-US`)5zG4^m&O94Sz(S)xzF+`f|4?CaqyN
zq_JK@33pj{RpfpXmnP}>r2C_H!#~yP0C|YkrER$5(^8D7KE!2>Wc;!8tLE8{fe&`7
z!<`Gcfuy^~g`_*mPYKb<f}Wk`DVHp=$Q-|%Y!10%YT4Ec714s^nQ%6Fk-w9s5NUjl
za@GpgW&d2K;}@5-7N<OjPk8zCIUoR@P;%;{!6Fs+D@9J|#KZ&?ujlWd7klFt|1U4p
z>F!O(|Hi&uxsn{7ZgXL6YvD<~L!&7JU+0NKV^Z7+^4WuZNY9}|@1zjYT!*-1rw|_m
zv&IGs%N;lQW==>(G-m>pZ2i7f`8HWmaaavd4AHW2Q+$al-a(uK@qpRlg}FLgrlS^{
zeYu$HEc*wu^$m1gTi|vZd*#%jYFk%!7$@$KIa&u|YFO<={kXU|xnAe|_{<mu4Bgvv
zYy`-@FkCMViD8PNNnxSt?xyftMZH<{%+=b%c4tKok3wK$eawuUInlZ$pXzm{vU7zl
z#wN%un2ij3T)9Kk?zw*Z%f;OCxl*f2zh<dvT9^?fKj6j7Vge{oHV^+lI5=ndvL{g+
zU@h&Ncmw1I6oqH~=NQQdFy$3A@)osak`JkT9u}^Etk{#egv83s)ldA(uyU7zHNNE|
zl2du4Q&MJBaXPLTG0v4%|CKvqX#!8AiNToA;N4XQLV8?Uz1F62o%xH!=j%GP5pbLA
z;)8@)Fg7c>_#~}%MkMZ#TtT1eyKa%!t}wbHk{!BqvxAkXrnCBpP)h3AkY~+g+kt#F
z);LOfdD}c4;R1RwT4Qn#1xVUqYU*&(YLonOJ#F|)j127vy?OGB+TOT1=LM6+e<$A>
zUH&)u7L&8n|7PEEZ0&$UcU5+oG6{5srq*i8T)-3)ju_TLy!Iib4MWNW7l8x%LTtr+
z$8DbS>_4EutP9N~=7PPL7TkFF^`xpoE%_6_u#q4}1gRE^szcAaNf;YmGPGe#nmFpq
z!Bb~Dv3wg&e5}Fgli-wV;coLUsQ)@R_;nCDIkP)-lL!;k>1^%BEa|<dMj-mFp7aKk
zVmc%H$*~_%JVPWPu3wDu3MB3H!{k26c=h8-8(BxDA%19CO8VH_7)A28mU~kTjtEC_
zBU`sQv)_CGsxaV@QrLNSq^51tKIZ-cz`uP5`Lj*kG+GSDWq<6nW8;Vr`oH+MT4#<b
zRN)!9`FTsiy@~C4f$9wQFkhCpOuu*suArkZ@ME`CL-5#RA_B>n=+sFgDhhTxLNKYs
z&rRRwOESj_D>4u`1It95<(e58F}|{BIPBt#SOjT&c7Dqkey~Y_=T9Q7pIVXIU(%mX
zp`NWk29FGt%<F<3`q+%V!;Y+?(N{UKPI!_R>SD>@%yG*CEWh2j@p=k-+#}ApzyWzI
zR3Z(FFXmokgvllkCuBOkn!>0p6%Uwp<(%x9@XoIBi>)3!fuG}c<BWljx%ITqa}Iz#
z(fxl1pSk<&48@u}AM4chy*yxVOt%4iW=37^X8=t3FT7VvSw>|sXiD6*cDArU_tt?N
z{`%>(0N(DGD$h=NK5q&mM}#w<iht3pum3D70zF|ujtpl$??R-Zm#uKV%z_Hdac|nN
zFSs02dZv#EflfN<bdiP?9*H={^aE~4r0)f>u)>n+$f4p3)9uIWw6sqjRL6Eh2gAI~
zbj#1iL^5=#5oo`}1x4<edCF@xI%b_V2kOfuza%b4o*zVaFy~03ka)xL*%RE>h*C-A
zOc9&Q&!uRr+H9&pmgTntL!TIr_l$S(m?A%~>Qe;I@adbl-JooDOic^D^m2H$pLZAY
z+d(a0qG6YiA#P{Ac*iN~n_{TCFR${dv%*OQql5%Bnc8M53dg-WgnPyY{fy-+$wbat
zwhbEfK;Xw!d<G*<U!KW<BLbKmVF^|IigA7n4;4f}m{2hz^y$FvZ#9Q8U}Bt}oM?2A
zx2K0bJVp1-jYU6CFl%Y(`XJ{T8lyY1oD$<}%2Q<e!w`xndgc9ko!bg2&q3jPQ%`!5
z60c9YfMb-}l8Ck5QuJy2#J*_%W<ab;<vP|M(@Z*hEQr8XsUw^X@{TWDym+iiCiHiU
zO2duz-7Yp7;I(JEQdsX@qoQy2&3LP%i};it|K#(k=OONGSHA3FMUV#x9iV9Na`J?-
z@FSbS4(Gr|X$$@k1O;uq`n<0G`SjTl$|C7toKsA{<2ToFW}irdbGJz&Zu$!-XIaFT
zz9%T{(mv6oy<=~xT<+;tBL4Axa@ktCXVkAbJqUwbgltI#Vp%yk!!XT{o`YD6Dp`Y$
zr$uGLJmcNi@{^S!0_p@kVeR&`A=HOZEy9JYxZdA65pj9*t}XGZeApqzUoGzvnpvAP
zm3h1`A-Q1nQFZ}>o1MMkz^{AT9rBWzhxr74AWc^OzHW_~^g%N$sMTcuvFc9D^_PJ6
zqnMqC2JIQ}(Y(LgARl>skfi6D^qWp$1L>TES8jWIA--5(l1GZy*PAJ!_PFDz%RU!K
z%ez*qdkPU&4qg~u<8PMMO6KpZ%T2rM<LFhkD+Vodyi$;Gx^NlF-EDZfQk_32F=rc<
zr7;ZSqK7~!Plzfep=v}rxWf>bL#OsfEN39@m>R%`Fps8L%IVDc<!!ypmUT@ZK^|wm
z^>()P<*P?(-yZdr)lEDf-ah8KtfIz_jGeL19-&D+1nV>uoba?O1V5zXf9IAjlMA+i
z6M^)I7kkZgGP;zlEr0ykHDh1!O1PI2hn7l)<6RRxU0mNAMa`j*i&gkx2LWX4nq2f|
zhbXS>D=u;|zr>qk(g;@gkTcwg=uYBLrY0=^Wt*_zhpxKj5OO(&RO?Y(I@KR&C_7$a
zyV`H$Fgk+BflY4vKuQU&_nbGrM#Y<h{`g8QYueVl%5Sht7#q{5Yve71(GRa1<Su4)
z=ZSp<zS$}?iOi6CY!BsDO&*NFg?s1CN2}^hR>mtnvhGkyO?B0)?2Z7zLq-FEl@q#^
zbL~iYaD=4BT*dE3Eb5Z?tpm0nvHJ7>_@~}Q#hp<uQC)9A@3>l!peFtt$k1+tSY~>V
zEWE)m%T3n3!DYm|S~NS5imXVW7&Rt#7$rET4<7R1%EAOsCbFv`TdD-%B7nVjzVTf8
z-^o98Jr|BcNZT`2D6y6f{FZ&6E7<cLc%Bmx>Bcs=du6bk4K!hXL<b>;#gK*Y`m-LK
z8n+boHz`|YEwsDtF48T0HQ>sQc%resT00HbE<Ik)<-aA_5apx^O((jhwhZxT?3hKl
zThQe`ZE75#-xRHXji+-}PNC|_ed&KHPyIa8M?p)0rL(TXd+XY<8AJq68S`eKo}93u
zAQNAUa4R6}cgTh=A|5IdmSH<DgALL&SPExk02#JsyCCSepyOaCE(hnMIK!Qplc4-2
z^CMCtd%mS_bNZrj22WSD#>Z~y6n1kp0qF|PJ0CW4HXF2}IML<HrO05t^B=7jani3J
zSRv}Kt&SR5AE2Mv9}ar6d_tJ<kBhZgR&K%_mFuye8ceN3v_~f*!d}=DCu2{iju~UD
zV>hLxeD>;J6A-_MZg{fgK)d-*#oxaXPJEO}xTQ_4=>u0J4F`Mm(+n$IAW=H+2zrQM
zs!<fr7f#)&bdemENkk4-ha?oS@+zu(;k~6xV1hgDF9~hvo(k~JS5JeJ!;tH@z(*FJ
zG1Z|sBBIO)ywnz<p>*FnXgwwCpw8C~SGi9&@~L@^tav51k`zFxye!Vcg!AcAte!T!
z#i^k^NWbmxkGTvV<?`UnItZ<YJ91pMn@c$J-6D_)Z5yA-Fr{5dL9C@ZF2&0{Mb57W
z4~(F$tbdVNiLo+_&oW6(eG7A5+A=R2<ULz<lh5k!vitIJ{pThpWw`_SfHy5A=vX@B
z;oLHnwl2nIEXffxC7)o5RmsX*lrK<7CZWp&I%b$bhaE+I9MPvrv3&yP$?$rXl4m9j
z$Sx<&>rq`E$v<J))p0uIa(-!Vl<ijMG`1|3Dt{9y>{X*HDbov%j8q|=sCO7ssd2Kt
zY<yF+MeSr*&Sjr6Sqxd(S6<0MoJPFzwH8jw>oIY<=L1VZeiN=N?2=$HEqIphf_O15
zk(%lf+v<2+q@Qf4MQU7xP$&h6h=EHllQdpX3g;II8;*$5L&8e>;@n-%f|k5+2?<rZ
zN7<8Vp-RO@l%^5M6*_tWV=&R6yW_&Df$1r_%X%L!h|9w+$1au-wCjZ1<fRWpNSV&O
zrv6B<TxvcyIC{^bfP1iWRtgktj0rt{b>n()hR=Uls#-36+cEQaD`q*k9k~yiz0YwC
zteGk1->*p;nqsk^3R-;YE9jue$_l;h+&RMPL)?KF_GNh-BeC<8u0{M5I5Pf<iZGcw
z5;p`BQC~}+hwqji^I6F{JlI@2DTMNTNAuJ6ulj5htwu2%9r8re5}5wOAl9RoZdOh2
zhAQ$*Y8UZ@oQhROg<+)Ee#d+RW{GX`#EuG%a>oO|+^slVMCA9LHXdtE5I_4939=q`
z2#xsbC%-0P46fcGBJ!Pm*=xr30LIK06eYWQtoVm~Wl0WFT4aWu?#7^ETgRKaOy%^~
z+d?N*45X>plYrotu5&3L_vHg?nNR^T_?6jl82gZ)SVfmb+YzcIk$SSU?D@SXUqq94
znL4cp<LqrCsC{tzzs|94+kxZYN{FF}EG+4S5_lx!bb_ceWTa0Hf=hSWLEop1-!oIC
z#S+yJghCHo3b(^yKIU&|bBL`!SEl_+Jvq<?^#{FrZ}VWPnYZqWCe26eP7tsdwsAD2
z^h*?B9l%-0`+Rd^BC^g_zk0yyZaL-U8}rz4n06U@wCe_8nvpdYvq4i<JGcT%ajFk4
zZ$^o!l5_U%rgNDgAz`&}8!ghImb2tV@DWLf@Zeok<q@>qD|xn$<em+T=L>{1mm`A+
z?n@X>eKtY^k6|Kl7v^*r3shieC&ig)@3L%ruI|Gyb{i8ytJ`$%?`JL(meuJZikvbJ
z(*dF7hPLG_wj&eAp0YVsS~}L>6!W>Kmcr-wPj?)%Mj{hJF{h<8--L1;abVos2V0%?
zi6oHLc#sb~d?)^Wv?r*Q6=Riitvh3x1dCGGts(fi(u@?P^G`m5I_VelAX9hNGL(=_
z2?khnH{2XLR;?e%F}rPjmpz`}Y}RQM27<`5U#)C9G<1|d#&HfrGlfLh4k=Q58<V;%
zG+FvZV?TMZU&{MAra=a#I9|NxHd>FtQpy!GUWs}dRAt+JDurLwChV>8B-J@5DDZNQ
z+jjWU4;f4)nOM577#fTJKv7n!JayAyVkXOT9Kn{p<Z(6@EQKI{=pXnkMUk48UnN12
zf-#^?UhyY~O2mo9_seTY0mXX^OZgJb+1lZ-t=_7w5KsVHe<!uVW~Z=x8FeUj8RHp|
zQHNHXYIU)9*=4iUEx)%!;%_vohl?ULERCHcX=Hi^(~5|>f{#wS;*&uPLEUuWXt)|i
z6$^AyUGoZSL~M*~k$fNGe&_U!EgXja%qK!iJBX<V{Zz1&v4E1)?IXaWmK#8YrRP(K
zNO<i&S7zdMo=wYNDs;q<cAG(hbrA<e4Ru7X2F%^&Z?=2Vo~OXb6n@2c4A3Vp0{P9p
z<g;CM7`fWe$1E*%C{oY$Nc5M}KtYi({?!Q3lVONeAW~xPaO*9I8elU~^@NnvEJ}u+
z39{^WkEs`nF&acIs=IQQ!YE-)MhnScA-xl*<B~IWU-11lQ4un<7J7O}0~2iZl}1d&
zZ)P;QQ9y&0PXUp(;!4u>Tfj>KAtjfftUA(>a)XCV6E6$32<R9NObvGc-{e1*aw>V4
z*-b9b8XG4XRB|_}aw&O*Z<3{TPk;LS-cm;G!Zy&=X(^L@`RDftYrA^e3H&V3HYxH{
zV@A{^bcLGxvy8D$Y#WuWm`*}3mDDBHRw9$<Q};F>hX9e5WXRhSoQQg3GxZ(i<@Z>q
zmL;OWFPFVliDCfs|J~3@J97s9BHo0_gzbUcR=^x~;m^X_ZcCzIXvTdTkx|T9A(J`u
z(hlGJE^q|h&QJtubas)saH9_{CVrTNwD!K{z#N?TtA7pZaPCL<jFA`i!D=TeN3piH
z?cyT4$d#Dk$A|>dSW*l#qhGM#smqPrUx^^W++UIPKLg1S^)D=_K=Ss2AXt1B>)ejt
z-nKD>h{$+@5+k9?K>-hPX%XB`%+EQkNkN+-$>k85%m}*q^v_IORW+lPDDWiK=?~C+
zDgoJ!_o2BqCR?kj#u^-hZ||nN{{+H4=k7w9<5njnci6WQ6>}ihU6H4@&(N4l#QY!z
zB4`-1oPHRb#sX~o%7s7{WO=JGmBX1CLQ*Q{1L<#59IbMQ?}U@F6_LbQTq~b`4eL>^
zHn+^SWYr6Yzc1@-T;^&zy^l%0%xSUZhJz7S@Pr6Hmupr&cFTYa4D{?5$Pg`-m|(cs
z%Pt+1k}7yGo5|N?&aB_aL=7=k7iYe+lqt&<@2prg3Pe1?IC%XT_!^_4CIG5bhoMg4
zGTBVZe_`7avF2Ct4l3X=5wFJ(j4?cP1&EHOFlPID+8WWL=iIAja*fqzNTuZ@S5S81
zijq)ly2PWVLRS;>L8*~%gCdz=rAsAH;gko!(q}V0JD<KB-o!=_)skaHGD1K(K8-~t
z2<4c7pDG^tq)I7dKXjL<0rOE!6>jf+>Q3wKz|fza1MFDJpWR<?erM)b5`{y9Q2Ts^
zl_X#HH}@NvrFg9~EwebCG4aN(eWY_NLLA;CukfieYztD!9OpauEO3+gd_-BN(nx{J
zEymTIiKnN>q3`@`)0!U94TZme3Rpv;ZfC3|>zN)Cs8agznW-FcPYUimJ~wjV(AJ3p
zXC&P#U+{0wT}5Novcj(l)8o_e*t4W2d8C3rt7?m;ZBxxwR69!qWJ99%p<SLWlqE9^
zS%=5DmyKPA$20aM{N$)2k8z=+N2dKtlYWQ^z_%<&QA}&uibV;_gByDi1MmVL0QU!q
zdW(R1Ahl@Qr-ri|h?b0!mD3TnbDp2BE=Ny#kon^Bh1Z!j{aqL|h_UXJjH+llz)LyP
zT?)ECBB6nEPk98rT{=hP2WjlD$BA6OpZI9chcg6-7Ad&jTE3RM+I~7M@4&hH!c0dQ
zXZ<j6&eT{uFZ<>avHwbg1vF-X&r2sF1@W96e6prUC8rfT!tPP8luX7DCw#et>A(6^
zXx~QYgLXznQzY^@?#$0wt{X%ViieIm>9CI=lL^N`qi-<LZ7a#AdUP7nTTLV4fMzc0
z?~e~{qen9uctC3@Ry<8pBnlgT4JWB9LY?-3ky~kVJo;i8?qIaD^vRXd)t`e8nVPcy
z2wRA~5NlHGl@EDBG>9YkM*ye1WZTo8VStV%`Qb^WZ%@5vG&|*WT;#xaoF-EmteQ(%
z6`JPZ0nag{a1ZJ4v(@CsI;@wq{ROJ9p*q|Lgl1x5)G>53o;*=FN@Ao?m`m6Y^&*^H
ze65{>p4mcv(G+=E<<=?M(U&L=@O<BSVp6E4I-*P5;7BG34lm68WW2hh>rQK05i<iR
zNTb$B()O@~N@^wvj4VM_9g@Qnf7-zM=C#4BSDkQHm4AUKW5=VcF~=qaj&JP%Esg$C
znnFNdMKr`ML;zZl9W=HI9!tzG{<hoAR}0-jIvfz7Oq-G*FPrMf{vPEb)FQKTgQz_4
z+jK0(>_O{f*KXYxw~--qv7`?*)znRvG`e!L>!(iw>J@Colmv7LMBi+{7cM3<%0<$l
zNu3Hb&Up`XdNO?TI_xPd7qo$$fJtGy8ZR&xXLzZ-JD-ooawU@kg~*5C$VwiePsvq;
zXwKcwHNhhVnWE1AS!czpxtC|eOjMTBzRNVSTbA7{8NC>+{$4WyPPL?2_9BRMe*SXR
zBsX}9XFjJ+LfR5O>UnV~pvf8WRvY7N3U}0te{y+qG_yD1Y@!W%WmW-&b|KhqP>+(A
z0L32VI8-9FDX!enj^g$W&O?Qw<dH_cY(<FWFnH7&3#_4P`oVd3g@W=Sxo)Bl_QwrO
ze^?1~-i<Dj_8UGulO;`r_v15yDhi1q@+C1kba|Luz!RzaNG&Nmlk5w;4~+y~%2D(k
zz)Z;|H4?Xkj$tO00L*7<K9**t3<&O=FBo>bgIS!xW;2a7?OG-O*qyydouQ1MF62-o
zt#(r=$nNKI6Mp33L!Z9sSuENU12O_}UB=EA{+<z#qrhdfE`|W(M};3|VO23rl1<nH
z$o=B6r4upbCUBhW<=+`16miVN&~#N*_q(mS=IB)|Wll&V>RCQj27ioI&A`L)9?ckB
z_u6HcVd_fwIdSw+h*O$@J{80M@Rkl?2|f3fS61@%xDM}*us3S@gTAnVK)lpS#`K+Y
z^LrsG<dPn%m}s`}QQiI=+mF|&eB4;v`2m>N0q>;bP)et>&x1a_Yuhy`TIX&ozDAVP
zC2RLmJ7}WWIKhXbdB5M>8Bf7U=21+>mVflHT#bTU5hg53t{dL{8Xqj#d{KulO?oAA
znEhH1sh31{19v^7@05hPoygv*P$o^^9q!npH-@8Bv#I=!xOLAae~(73<(1C1Uld0d
z+ENBYRgMX^`#KhlrBV8W5kLoFBIDFTN7Bt-7iMCT3Ug^M8oWu*LC+&3FLHRXPHeNe
z(L(jFOon5ecMr3GZYV&e6)(=dpW;w2mVy=&L2gbx;=)t9bbFTy7mrT7Cz1Y@Kyw=G
zjw1{CWA~d9{Ozwb`vESdbT|_PvYF<=r3>Kzr#x#3L^P54+geM8tHf&GOMl(_wb1KN
z`7p8dTKMi@05gfhIlB;E3R+kpYHTVoE;hQ9&wW{D+jGjWZ_WJ+h17e$Ra;p$p<SNV
z@WoI2-HD@2nfExGbc>BEvr(wX_ON<qXn_^Qmqj^e6r+t^y|#IE3N*FQ8;0fi_>=yw
zLlY5b`C)Jt!(FduJ6q4dW6z-Ws=Kjtv*pV?6KW@%_@2N78XHX$C+IuFPt#GR>+a}4
z^OnBc`4U@QSyYsAvmjgDpIXR#et8@R!M7y1U!@S-O2maUf^*t`y+rn$o9+ii)VI#Y
zXOHAq0H+VahT}(ewL#EFb_EZt%h+_s*d9;Fwm3m+CQrR?N=a6|p2%M`7QdOU2*eb6
z&&L5bo&w*a5t1jbD~u5n0lkucuk&Om#$>xhnP^KnOKn~Escb@E3l_Z_x7*87#s&(R
zOPo~;R-;vhli4*-hO9!=jE?p4b2<;5w0!Err}kAIC~Mf^*8>E}=Hqj1;$wzi+yVnt
z)DHGpjpd7!(jmymMq8i0_;lJStuX1<=MgGE9FY(3LUlhCw?W<}3iN8WVM~5td6x&7
z<t*S1M0Ci_u{E@0!9J#A&A`W11UHi9ry=QL;Oq^)3M)%8u8CM2&k&I6GyIHBGH2Cg
z!kWMZA>iqhKI;!shd8<~%2qd06Hi9WEXQFKHZdDGIfrNSf1py{E)1AOh`pc~id*8x
zFhfn&?OY_K$JR9E1!bKH)6jea7ch~Xdf%?rz1nI1elOw80Y{i;XcnzB>a5KuRJx#Q
z&5J>e9Fo*48Cl(N|6S^^dAESKMq{wsfKr*z+u~u<UlopgAZy4oPI9!{7LuH7EbUtD
zQ@^?a&ykzlwM9`>_4;fR4Htl!Xfmp0Ew9JyZD?CD8ru8YvI!qk|B*_HpfSs*YYO-2
z>`)_0HYI#hH1iX~L<kXubnFuQfG+K%swp`rOW^Sh6C!Q@(eNh3`-yo=T|R_Hhti5@
z%7y)eEk90p<8$FswdAw-n9wmo%FX!b3UyX+<6FrnnqFGHqqiIB#3;12%f=ffcp1nM
zhz_ZPbD)lZp}UG%RaMyz7cx)6*#;H($`uRM?40|TY)RL}8<A*NIV(ye79OIJ5AbOj
zY&RJqoic9Zvf8P$@zBrFlA#{_?mOmubHB<$sKnp-8=afZP5**wL6X#+_l%GK^s3W(
zS#+O=t<I3Cx^uvy*;ZVzbZ>ipB6)=n;MeuO_0xn6F&n44wXY)QR7*8pi*(jrcZ9QP
zvWT9rxW6T5nq>bvEq<H6ZC5$sb>}8kU*3xcp(fH7X@{i2q?$bFYZd`I9PowExd7qp
zAD2SA?@)?S5F7vN(WW}-imBJBA^kNmy@w+uIVPCtI@18<9#`x#X(A2oWJlz%m{zW6
zT2{u%0BznN^?D~UlOiBKumGci{fZ=yLx{8Qv*lqeA9MQ^Y?{UQSezbdyMoUneL`KC
zqHB%U&7nQttei;4%0Mc=-A%`#Mj<gk9I7TfU6Fm?1QW`G4Nw#@s)o>FQ3~+uX~F~l
zwRX1;3liFAJPhSik4{42`b&xr%3hs*?O3^z6T~#H)6MueC%+T3kO`6|msJZkk5a6S
zKt7kBj)_5}OeIhACqIm3|K9xY*VPHh?@M)j+7_bM+V@q_dPFoA+nRp4e-a_h81W<o
z7PqKrU`jt@m#s#m*rH|A{~FU2%Z~KL?Lv%yT8$u80{-=TB@oq!!9G@~iGapJFVB%G
zETQpW(^FAIUimPYp9V})3{7a+MXxxeU-UK$RH^PzV(KC%qL0~__LT$d)&39$?V`PL
ziwjdP_6}4$Zn<!RZ7k+Ok<<-748`dwNQf+-*`oh4hU%-n*BjK%{yQK*TJrL|J3Z#w
zO8j0<PmgcL`Ca%PK0BqssCuPgh<^U=yI3rWGUMnB_GxfvmFl4rvZ=UG25TgZ!5P<L
z1Z>62RzKL3_S2t|gK#tmy3T4h(sgwXf;NG}CwzJYe(!8W{$?=WwSQevKDFb-1L7cf
zR!YoL#(`Keq$R9El#)UhwHpNmO!)nG)il=Z`q~ROB|Z@vY;n<7Renx>5K&7b(LLo`
zsSvdjTjI5C*K(b(+i$%yo@&@Y8`u%`OP|W*c)irPJQZbAiBD^t>!1)5AFk0OZEq$`
zTBvG7`ReJv@UwHuVR}c)hD(#s;7t%xWR3U}V5>=8(s^Db2<wkIfP0{+u5`vlLs~-o
z*F%VLE`ByV{gzpT;6RlSJf@drIr)la(<c|{T{hQRx-19y!!>x~@CH?cc&q9i?KROe
ziN6!V!OF%&^j>XxI^dBtZ0Py)@tm{U;|~<@kS_V>vdH&O?$ht^MF=|79-+w7v+MBf
zQ@G|x=`XyP>gAPS2XWxVk=2#vz*w&*0Bu%tAyGnVHw;z~wXrz>UcNT@-d`*&EdfNl
zq<qenbFq&P4*=J5r|oQ!O2ETBkOWA;ku3x0J=vSNTpiAix>-oS!Cb-tyS*{LLu5j<
zkDf>j7<spWok2=KbZIUfgvlPwP9qhYOWz04cjXyETj{|YO!U~{DSw!F08->G_p_a7
zi)6_Bt^ffuM|*qywvR?KGQ-qFj3s|lSpKTD0sOaOK0c2;02MHxGUjs-7Z>O5<|g!K
z5W9~}x5Iglx|3}l<IQ$3p@R95HWu)R42V?O-@*mj6>K-X7JKqHk1S`Z7h4n!O+}O<
zYZME*kLaqzjyjn$+Yqdi_c^Kz2quCI+^=f8Ao|^&e>kQEsY<9Rtv3M$vy~>Bzm)iq
z+`>S@2EgAf^7Q)~Kx2zN3s9K@(qSFn!qEi|++AI(jk;Rf+B`;+Xf#g4M%Nz$gi9Xt
z$t&K!3U*_24G@9lSeX!y!%o+>T)C~EPhN4esCZKwIEF6i#ugE;^>+H^{N}9sk|ZQ@
zqoaSJvg|C+`U(dCwA*oUXfh&_)FHM`P9{y(O0>y#j*dC1J3uPdUyZsrxX8mL1E-A!
zi*OHb8yg!3hm&95qsx|Kq3nHcEYJN{MeUopWtmpSsQQ?59z_-*h*0w?ki&pc(r0N%
z?kmYubfX>)Qxg83soE#-bTPrBmfT6E!%T{!YV5AQlT)4gah5|Zn@6o~132R0;emFw
zy{G3HNR7Hi%jI{oKbkAqjL*%@t<tVB-v{*GO4TdmJS^aWWeWJvUb3nNjYS9?RC?Na
z*DL)kWNXj=maHbqwBAzJ^7Ji2mJ|V-IcEFkCOTc}7)Bw*FeMmcNai&aK&7xSH)jrU
z{P2OMXm)lsl3SS?Yt)iGeVkO-_wJ}H-yhJ41K7KT>#TtOs;Epy;WE~CUyK3P`d2_~
zxxpg&aOf>;g&Ne?7^>UNfKS{>RlV4J!9})etO?{=gjkbO2bghv`o4i><omy56s%-W
zgj7@xt;^!-IU0=pot<OD!^53=u9tj;x0aVZ0fKO!M*#tW@USp|srKA)z5TPT?O_+7
zU8cmdu`oOP`T6>XN)a&!as&nxtIKG<=kl7eaaY;MGGP%NmAw*P6=tc)XON=~ES2@J
zj1ncMYLAN2wXh9VG#>MqbyH7I4<Nc{+~@y14(js-xcf0@H+y{2nGIUKuk9)IJ6(@}
z97C55L%{MCKs}mgEGoFbc~psaRs1JcWS?etN{U2Vho?fM2nZ3=j7f)d&6RQk%)KEt
z532H++v)1|QL&*I<7v!~fK+0td`a*9q*E^-`XJft|NJ1@1SIht0s@62)=kNWVF=TK
zNY@w?Pz6JDuFnECRG$}bsbWX^gNnltpG6a{{Ko?@XA6&CH)%Q(D>$4s1u2P$i1h1C
zgW6m?Ju@Qqr}IS$hm4GjhU3Wq*|=n{F+dRS5m4R(DoKP#90IzA-CkFKEFjQnKR-Y0
z<Ds`-texATpfC!4&%%VppMzYt&iO$0;yn$y{#yBZ&d>N<zuSpC4N-knP<@?f4H6<&
zS67opcSn=oPv(}X<fo~(wzMdf{{d2FxPhzT=C*!E`tF@^t0N)iUro5b$`7WS_YD@q
z`uh55AQR!jj}xNg;!vWK8h5+B11o2tO=}9MBuafmeBZ>3o)FyrumKy_p|6ntN|%Ti
z(6_%rcR&(`mzS*dCSclt<VVsdHD-x=1q=e3=G@)Qnv;{Q?Q)Aly2s~|1>i27x9^})
zt^yp_z!ly?u62+`4lV&g=H*7K=#)lB9&28%87U~Ja*V~xw#`;YpR^I9@0>0(s8FFq
zFCV!&-77qI6J>yW+I0Dn)(>m6CBA^xULKGY<s_62f&5M4^GP&}974fo@x7Xr>APvE
zb8~b1u-Wb9>kH&;lZkx(H3+z>h(jQyWDQWkfI%1h4ai>t*4oh57ciYCw6U?VN#t14
zr3O8fmh~~f>noN66qM>(_w&u#U)E?qMU#k_*s1%^P+h?D382xJ?s5odR+{v9x7_oY
z6tQ8F@_sV?mkfhmv+XP}819gDI~E$3pI?KV0O3o3#oNxo!6lAGzqx#X5x@9odMhie
zt-yRv#DsVg2@?>sEhpj-3n~BmErRQx51^n>Is&j}DADR5#5Yh-gGB$a^EM4AQ{`gS
zg$LAd%h>_TgbLJ!`Hu#29LnACG5#sy`7gh}(_8r4ZeS(!ziR#KkYJ*}Emij4>n%c{
zDaC=t|G-ni0*2@Sm<JS8!@qa_Ij`vTh*|wxpj1`sKYmoD0xGC-@tXLdQv8>?mH9bv
zK!Ya#90pa1B8dnf_Lf9LfQHOb|FxspCyxXawtf;;J7XdLrwyn7ata~j#rWaMEf}C?
zLDYXVP#_I7THyW92b3oMe+=C}-PVi;m%F3?x6%3cIP|jvtyaQY{Ow?%U0GApB@oT@
zdVRfs7*eW~4G3<q9}NLS<t_Dm-dDDv2g>EdTCl*C26q0M<k{-J-_MRb1Vm)~E=J#H
zXJrAV`(t*NEpiA@O$FS5ir}9?r?=X*hI*qN*vHatm=lI)!oc}5xc^eze~-o&xt!oo
zm!~w}2l(Cdg?w(l<D2Bz?f_98P;tDuxna?3v@AN%UPi_IysdzED|H$I+{yxfU{1xx
z#*&hf0xF+>+}{a#yG~{SG|in24WGqh0ohD4VIVjM2M3G8GJ2IvD^X*mdK4d%a{&^|
z*Ao9Hnt^9kSBCyGdW}uzs`6B#{k=!m-$q6dF<Y9OGXx9_3?glToV}u0AQ1R?duvzg
z{#B%GZEf9j9%mkoBdyw9M{+AZ{(FN|onYBBl~X@r{XG^48t=Sz6Z7)&c825YjJj@0
zvp*i6o>u=3rCo?+0DJwlh@urB0swA9yUtiiQX!pXqsPaCCEdZvDF6_$soZEe`e)4b
ztxQe7GIe-a2&Af8-<6~=d``rQ{ZVH^X8SZFfxZFIrLQ=)CgEoRS3mL=RTD7#6sxUX
zzbe$fjQaof*6i7+=;+w9PxqHFW$7P%4`%?+j0UIN0SFN^t~i>Qm>jvhUx=;zJI6$8
z<~BE{;Lpy^K79BvYIy;;UF)X#G8F~-wbfN<p!U<lNu3CQa0sGz2m0?|XZP1|{zv`i
znVFeS2e}@9Q|8Ad*e~;hd;nNYf+B4sU8+3bObU{Q0C^5RuZvwE-t|NuT;2oJ_l_%#
zQu2Ba>x~;3Y7^~fKqoSg;{`89I^9mxD;5B^_$37d=+6SL63%N5<~BBZye_RlQ;f5B
z{~ultfFjiGhRT!W>ahZ5{!mn0yn|wLH_+{Mi3c+F1+u(ff&9ZOG*S_N!QZ2Rr{j42
zh2PhH*1EPomHSu$u<BO<iFu(Y_zWU#SF@QgX}Z8%#Blg$X8$jb@gLLo|Cc-auQ06h
WP#sXoS^9wCLCHxeOV)~;g8v`(kkj`7

literal 0
HcmV?d00001

diff --git a/demo/documented/bcs/aneurysm.xml.gz b/demo/documented/bcs/aneurysm.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..7660eb8bf038d0b7eb3e781618527e0bc2d844ba
GIT binary patch
literal 703208
zcmV(&K;ge1iwFQ6^h!|x1ALWRZsRZvMgM0Nh8Lic6e&_g)2?NZxYG>Mq)3eEWA&rh
zru=2)BXA&{+{>q*UcTN>-M`^_J6_Ja9s~3*&%d4ym(%O<+?BKQ?Q#CG>)*!l<MH9)
z^Yb&j4(H?k_Hn)Z9rk0mT>tdXzq;<}eYm}K`{8sNzdwduKMv#d_uFu|Ue0}YIKJ=t
zINd8Zi{g0P54Y}i{3$mTA}&YE;qcWR&xhe_*F)cxZ;>D>+IQdO83Qq=zWdqrIRIp|
zzI)if(Qy-|8HbQK(}Y`jw3xPWay$vFI0!B30x9t}9%noSCQK8~7Gjc##uzY3!#mHk
z2B27BS|UdZ8C14uaqX;9wUODig`p96s)0wRbI4H_@f4J-A+BrQkUejRTyapvZQL9u
z0(Er;7RQUJ2A*e}LpGk(Swe(3t5Zos`80Y4oL93Y`0^Z=s*?ueR@D)mXM<dMQgQt#
zNDZEx2eKvn6eNL7e8hnH{=b`ibl$R7USp2V3vtUoSKh04*Duwdc?b&D;+NK=5<e~R
zQ^2VWXZ<Xs4L&)a6z8eq!kDf8QCl;w&Z~O<ur#vrs;`aSM{^!6vHK@k+V8Hf)QUf^
zJl6P&=c;cpH|kH|gU@UFBw{T;r`(u5!n!wdl$!py+6RRePgS0M`tGG5^YZ81$Ua5K
zi_4llC8*VBjj_Qm-B<Pnn9Y1FohUf-B^0(s_t4yZWnqwUaz2qb4yiFal$=)b-YdH@
z#prl((sHl9cFXGuefO9WIWHMn?yatETV7a&Png(wp5}Oy&y{Da`l?j@V_JLvKjYPQ
z-B1j|R>Hj5f3cGEBIhIJbO0T&5EA~9SkRvE#d}@)lxj;nh>uNxZy!YeP0LpQ5nu19
zL;ER@bvHbGL(6O)iDG(6eA%mwJyGC`pdHeR!832kAvbi7VR|Nt`d+lL=fKNozmrRE
z|5>@cKZgAi62Qx>ZrAtiT9U-{8146qA)W}`$``~FV|-oSKBgDBET2MrqzXJm0bhNu
zE%--#^;!~}@wND29q|_OpLia;*92dO@Ojv8AK>j+R6%)~_NDiLeejyLs7G<|^-&4+
zc7)a7Nw(>!4L-+syJa(ow_|S+zxu$-1;*R0pnYDgLt%ZL4>9a@)Pp|WszZ80W4w+2
zAippD4G--l*_|C}pt{<!dIs&e-uk`y_w~HhHyEFm;O0ByyM62HmK%o9<x-HRVrc)A
zFE@k9eg17fT<m|^HE8b;oxyva`+Sp)z7OYfIEN9+^Cms>t6WBPp-OCyZ5O9q>7{}F
ze9Q0`@4hUKJ=*J!0S?aImO<<5l336+XwLbl@rwqmt>t#FIgM>JUy01)Q&V1OJJ%h`
zb1t|hSMuP~>$~gz@L_F9f`lOKMpG)t<7j*PMJ4q73<pTjtsy3P_=WEuq7|3I;^+K$
z{;v=H6HmZz+4@<IUGrT!!zPb<2jluwoBUi}UcSZ}b#X`1@X5~_#K4EmN_>!Fbe2m5
z^JDV__{ETIJ=H@a+oHg4tlq)9BtGI^r`lrp{4iEYz7g9x^7!Iccz3_=z^e=@{Dxya
zvArX|4&X(RR>zN-Pv9qYVOuBgb|3eLpKHDC;ZwJCj$0r7_z36X!aEm!QrB~6l`KlL
zv|~x;jli$98|BneKAQAPxglL~e%?7=E#<T8O;fw>%IE#5cjqTq|GB@mAsFxYex~l(
zRW14OJ<Icw*Z+H)x72_S&XsAR?ce#g6`3ag;+r*JzQdW7Y4<oF>hLyzU&xDReQZAd
zg%on<IW6fI63-<bBjeTyo~+I8+xq%JLQ|kK9oJ3$)|{OY;7nA~Jz+Y|GjNUUpLnjG
z%r|{aL8h%Ue{|YmDSgNl|E}Cb)_&4=3{;y}OmKK(CU*iKE;Z+eq;;!f3OL&aT5hNL
zrkix0#UAtSZ9{lt3$Kd3=_*}MW)8f$zSF0pVqnhc{5sd+19&1O;CYY2M~3e3RW7s1
zgmOhZ|K@AQ9xw8_!Ze+h6y%N5x9;KdV&5KG$~i3i<@2KO>S|K{&zBV)Pz*!Bm531b
zU+mE${doq+H9<Ldt&;*Z?diei9obli>NEaSKVG4Tcb%t2L;g&z&Im13Es#DBG&FuY
zEz?R4t|$e_!L^-_joH(iz17D_>+4R3#=dV>=V7t-`GtL6&-C*+&o16%VkweS$fR%j
z<nbIv04xB}Bz_Lysd&3rY~h=E0_c4gI7eTIu9QM`r~ovD0HJ5E?35ZALbWV_?cJ9q
zfPIH2H-N0<evV5xO2xoea?o~Y=pn4n4ZN@M_ynmSZmk$ls7xzwpnFY{3qtQ6sJZq=
z8f*25t-yG68@dn=;HfO^?BQO9sxW4;3sIpwt`NGkJTCJB9qkIZW>5Zy;jwY<KN_3!
zn1nJsB$%?+4HVCN1AL_1$*?HLLt+JK09t|tunDGL0k6|`kUIvPmW2b@#DNgI4vC6{
z`Zl;ShDd&XjR4&X&neM7+{Hufw~g8lVz0nJMdMHCAL)5Hr6ib454_4V6p!?k5Ysh5
z_Q|4S7F&8IkiLOWlU+BEXUzNuXbFZ_@_}IWf^FOFJ%!-<9=NSv;OuwR3y#?Ig6n+f
zCj?rn0LC9Oxt4gXk2l?EJgR8Dzy!u8Tp4Cr8=vrXE}wt&KR|CITT%fI07?<f0aVTy
z1HM91twUZ@n%g*rE7a}mN2r-4Nf3fS^hO=Bx!nI^jg}-IGesXjqNEhaeEzpStr(4=
z;24r4*863v?lO<GBjPHJPv9S4KV_9E#4&6j7+#QBpMSu%<$QG&6M-1~486?j3BarJ
zV<;Gi-=t~qaYN5@zjfh#J<8!@eP8|>lLd!bcn^TV&?pGt21+y{fRr{q2`0luQA{?$
zy`#n60+o$jfPlM(lkNhq-(tevmD(tCU|`smerRi#19<?oN)=L|kd6Kbve^FzAo>Hf
z-UDDfRF<B$*44$lTpCus1_cb+7JR~#KEl`8CPmrR1n&^iR_xwaZ$0z?e9ZZG4&MNh
zg#fbWOcLzZwK@j@L^eXZeRT(buj*})%4!fq#K&?OV8NC=s+9Jmk|aNf2<>A89LMED
z2GzeLo<2%RGne)<gLsM{AUd7^9l)_lWk*nqhb^YN?PwfB_<q5nG6e(fu#F^|oK!}B
z90Hirt`hMDu8fiiwn}AEk`XzL>^aAD5_h-2R&Bvh52xmPn!!QjWml8xHyVy%SA#|A
zIx)ePm9tIK5pTbs$}MDqoR?JPixl)_(FQiQ&Zu_zL@OJ6@)4#9zCttckZ}1X#L$;L
z9iVHA1^`iCm0YD{B(Bv!h}hc79B`RLH0D9KF@O0qvm*gQ5DI3rB_4qJC$`{l?9aXc
zbaV<8y7}aCX$nSil-iQ)G0HRSn>+B#72b#E_5!-MVP$Hv?1_W4jJOg+={U4hvq1em
zjCRnb<ZLe7W{aLl>WSf5Y*j+Sr>+wU;^pj(Cpt=8aX3X9xy*#kcF3V+q?9Fgoye4;
zt)fNy&xEg9+7h=lQn>c$sx90N{~_miswd?^C#eO%wnXA~b?X%M;hS&L^;{9|pj%{C
zV<S5sB}`tj`v3UO4^Q`)B(-ydw2*J16eeCINc*O}$~O=k-o^6ZqGpu&?SA|Og@AOi
zyeou8RH_z^OJH+j`w|-c|D6%!_hrHKIE0BO<@YwWE#^*EEx<z%#>ATwlG|A{ofIAp
z;9;>I#>DU6+1yxZlrgy%=GRgoxG8f>`)?|mE6}mw3N*R<*U1=L7~IYR+IC85vb?*7
zatk)7Ca?zsMNwLlhwEzmIpsZA;W18a;!m<h5I+H`$(}bf9~9<fzo)n0xjo60@Lw*x
zOT(Rb6ufT8Z-V)kp05GBG$Rg&mBf*nxvO5$ui_Qcg%?5ElksCa(3;?eIeqLx(NPM0
z@)Y6j2_idoBg!zX(Q1>nGOudwnMIa&O~O(;1j+;G-RNsop5_Dt2f;7jW^^q<2*S{o
z1ay?rUiVKN3G=flK#%LJN|Fl%%CcUdZw4qDup_OG9nRs=^cPxbx3<+F7id}LxC?ig
z3sPFrINTFFD(n+hgz`)=R8<RJfpE8^A{6bbSl2XPdstQ!_4b|?`Wy`lNaHfthvO~&
z9zSxtX|D`rrO1q5z;^%w<;nOx<Wjo_If`7N?~x-vZn=Uz!C0BX?IO1`=uRAU;Tt#n
zU3~M(gC3SFHE+EDnwBch<3*Zj+dV>o<w{ai2W&f?x2}^Xk|2gG-y|h6AF&T{UOIE=
zq$|*zz)pO2KjZjdvqr~Tj_+-0DSZX8PP<epMiC#V3O&)k9+nj|-L#=9T=HR%dJ3!%
z8iOM1C<|L}1+Bv@iCzZEP2U*h>|hxU>0Td*snab$in3B6?tir397y)xK_B`Byn1y8
zCeRaX-w6ggh$>LY&2k6!sh;Ed@1YHtQ=pZih)s0t^gM_fAjhKIKMKQT4IzfwE$wxe
zIKnP7trTU#E!jF@=5?G{(eDYWb3}_`w3)8oN%!d{!ZzI3Rxbp$q4j1Ch7_p4HdL%Y
z0>G>03FpldAC+7XZ4wz4DW9>EB;Z(G{G%=mG~L@s^m_vTL<l$uGwtiWf<aStRosTl
z-0CuWATajx^u7rHd|O=_!ypK|l7d*h|HTF!guN^WsGn^WLVo@%0A2Y?-{ooL=$gUC
zv2P$4ll4BRW_wmgm~lnuE5K4XFyqX?gBTHxu;iSSj1s4}3;HQfX6)u+eOXFIIe|{w
z8MGAuTNh(aMUbHLHex+zp9YsIG==lD9H;OntX*?rg!yPeY9YnJ6*7Ezlf0hoqx2MX
zLA06^Ls>sfSSjskKQhYd1sq$!jelNV{r>`>Yre{5IupTs`VI!)fwU-_r@#w?Ra0=(
zDtFK*6X4-4*3TDMQWJvzPbz7Ow!v#;pd`rnr7L$Z2gOFB)|6FhQC=KPlI*bHvY99=
z+IrrTLryqmWYjm9o7yWyaSqRWc)ttmjW=+>L;oTQ;+bjBeN~~vR+05kHff4BJbce|
zIW#6rCgW}zC~J5)FA(m{rsNmF7X1PX^-y-XT%x~}!Q(MHq{sq$ZPpeOE$Y{i#iV&m
zS<PP8{x#Ln_j#XpXfa!WhXQ}bh(ITV^|P4{BMTl^k<Rn#PylSZe1Ud1JR3XkkxQYA
zPYUlA+Ok@~vv6qTu<y|15t{4!$(MjN^x{4*>fyagKO*WO%zAz$Zq3Smrzo=Ne91V5
z=XGT$H#A+N@UR0W4(_mkoNQ^n0W(HgNsB0O`+fL0qb!L*5C~pLK|t<*v6ZZ}`?Gz3
z<e5wckt*==LoZORV>7b_#hz~HDX&_fNUa84KSJTktLW4VZ~;y|frPIAwV0quq}0a^
zfDw!4hKAfwLr}f9o+VIaZ2Aq_>nq09qXnI+8!sBl4Ltcoa_FA6y3Zm@x@U379#2Nm
za==$StEXMba_LDiY(qj4(~*?Lpda9+C!Z9o`yDbTMDY~59bbA<R`Q-e53UO<&`AUF
zr6<2y_J(jgI;*Q~n!ke8H!vIUomC7KJK>v|qjWv|%Ko1++`_mQCubRj!?@n5aF){?
z#`PXSe+4+#YPa5_Urdu;f%22OqjtS#8}lb5xT55>l~!9GKgqll?ZomeF?%;zbR>tw
zcmzW2$#$1So^$FB+F{-Zr5gDY2m|JCHP~;O*9E$a%@Ry~`g{`#c(tG*%Dm+49@1Pe
zq9Eyb4e73vZx#RwM)vhq|K1>U(?>8+s5Z^MLy7*u!TcqnVzcbQ&<qFFS5`Wec+qer
z?DN&;ZH43SZ}I;PFlIr<JEIK?Kz*m$sWe2%LYY93;)%vHolLfqhA4USfEM^O9ulXS
z-K8jH=$Ye$60hy>Y^m%w==PIwvgkjf8Zay2MEVu<2^2S&4HJt1_T_8PkLZVxbIWod
z1cB(5Py}WF8=IzEtNaPG0CUWV;c+Qy!E0dzV979Ji)Uqrw(Nq>px2*ZdQ-bO$_s#A
zKY0wOLG`?W979z#$-2}voaKIFn|)r&NU(qngOUQjH4U@;A1{cnyEG{6`p$_@XkT?S
zz9uNmpi&D60%mHmtCY4!C?idg&OASbvK?bIE8F}%L3wHO!uhAk#(D85FQE8<IQhg9
z({YPO%Rsb8DEacba*j9mZ;%;H%EF3!D2_#nR1|EDR<i3+_E&-KWFC{L*ET{y@8>@^
zV0RJ|z7ZWOz;AM@&M#_axx?4z0xB^nb8-+G`k+WGCNA);RsFX8faj6<2_&AN5btnk
zRa&VK)>ub0x470YOX{dXjaR2s&rd>(ZJ_h}JelF>IR9y-_64kpr7DnkeSRYwpC55g
zD)3{J-@vF9^vmuGU3T*do2uX$j(N~=Qj>-ckgB#+q5Fql0<E<}LDKhD4a8NbteFCV
z*4o01o~B==dkJSKu8wFLPI^CDRT5|u(k><YZlQF*s0Ml3*d*)XA5lbUV^G`I^iv%-
zY6{{EFy4;c%JWoS%Z`Sxk5?RGxNKF<XWH-z%~>2jHNC?$ZdOZ?%1xAZh+%?`?${vc
z{kTv45prz_4uc@@N<mQJ{uf(G!;p`5_5g9)u2JUseE~4n6F@z67XjJx33vZq;B9L_
z3?uxxQZmCpz290I%6a|g?xWyE6?{0{-wU9D>qGE9>^+=@$u%&js->YwhCi?o&q&_@
zVKL%Y2Ox@F4(GEkgQ9zm2=*fmK$LBxM?<MT6Ujn2`V|0C&R;@`LF-z*F^<wt(AEZM
z+F2X8;x(MIm$5Yzjd&ULstYP{FaHXi&07J8GNNGG%CVc>Y6IQ|@y=K4R%mI9TFvy)
zP}0>R8(?`=D@@u?HybT<ARQm06WSt<jP&F`qINu9t6jn~4%a>_r}v^_K-~T~RL%nP
zYL^nHEL3qMUPIciSN$Nj&54CPwN;ceQFXBFK}o49Q+I~8h+?MTeygBi$kY4r`+1y*
z(>j}HwF^d~R{A^|8XT#xY%2)wf)F+ys$v_?BEIf&pSqR&pP;xZIvN~ho(ErxpkhRv
z?&H!>lCSeFMvH1!%E6T$$p)OV@gLkP;8Z(@89NS5I-mJyICeKRZ7jg74Qfptc14W2
zL5*eOwVJl8z(JiK$gdRziZ$s1*nu*=D{jD@M+RBg7H$DWW1?i^yh89QUQS;^Tdh6-
zXnXNZ>2>6f_h>k}lrjGJIJYcCVi<<*XpSF=o$P;OgP|<fPip}Lnhq63lCK;*1msdI
z;5uXek5h5ceE)ofdgv#ZuHjM`UJ$3{yBKrtePahMbNmT%6TRi1hxzvcgC<1PuBK3)
z=g2Am3sn`{rZ~Q4j0NuTeWn8bUcg@|*Z>=>Tf0R9V5BMEGp4*}xYH4%RUAxz#+{*P
z@j&4hohuMVpQ{UdkaUKk|3nqKX4}S0TkcK21K5VPC)AJo@~jr!i5ucDL*6rCs9c&E
z-ADi?eICGwAuc+fh1X@SpU)UdnE7;sqEBR{jK$Ci)DxHeXy!^C^i&napyC?4Qo`;Y
zy#Fy)TlPTB>-T^A<;k~|VIfrbB`Ma+G{XX(PmmTRkmx>+{hE-SV#X0f`Wp177`USx
zKRJ=Ucd1~R(gP`Sq@^Lm=t#Yg2bY4qV_FUCiPYD36Zx~i3JP8GfMau4f_!0d8eEYS
zTILg?m>9a>A&EKdt3pwspx0br+v<2~WI|Cz*voB1SxonQ^(F61jbPh2LCX}0kt7Wt
z@h^jweu5c=Qket6o<W?CxOW;Td!qE3G7*Z&n9sr8hK^85%x;`%rc>TtRMsWPagnAo
zOV#;9$#kU)%&Dw%&xK=_6ddMx|MPW5Ns_}L48747G1$QUFE&fYNckBK&|RIRgRvx@
z@elZ9&l^8firc9EYd|v$C$d8Fs+MnKKk7{ZP<onufe&cx&!k;zFwp@2CjYgA^?C}^
z-3vlP_yX#Ec*Sjr`PUPfnSl}_J&NZqWqgF~ZU*Gm!?m<0u_`7xY6Qf0Ee+V&ve;D4
zf@2`sC4LYr3bCf|$TPOZ!Q?-ZSv8P^TbO&y)F|B(v91Ae$968P;+gCdrF~+`GQ0_!
zSZgvdH8Gi-uUmQ%T)v@kn2v8?BKYr4_~Z7(#_G((>O}J2+XAd^1P)T=;m3!VD1&<$
z+L`qnjFhU3g_t8K#xi;uSyE*rN8vuPJwBh!>57e9i^d4ezV68{HIY})Hfl+Kb4z&b
zlL}RsL!pSnXiH{}UyzL6+vXHcavJU>{QM2BmQPTW;P8dd&$$wlhYTqH5@-<%Ntp&X
zOc1$_o}sCrY2z{~D(55mTDTlHim))~O(Uz#x{aSlHO!`<Ry5!t!fEfxKr)iN+_ANZ
zed7eH*2QUqX~G?{I8>h8edb7(>O5Wnd2+6xuKZu5y#sPbM}D>h&kbQhPy4)=8ixxR
zA0iJf$%L8g*2t1#kxv$uk>n-FWR%L<4o>w~--`aj*SX*}48t(=MuYW<EnjV?-_+V<
zfnhvA-869>eaNT33m9Rf1Oi@3$nU$kN`AkCWjm<Ipv0~HRYNWSQ)o;OB_I3^8kV8n
z$!W+;Vh}ho>%LOscXOziFh9B{McqGOzAq%W+{Wyl*oQgY9G{mphBVlqHek{XEaB{w
zm`ft?3!0W-AJ*aI>Qs5jTex8bD`xn<htZ3sTFL3eh2RRhD_m&*r1bEl<1ma`oE~&G
zfpv&FCB>ikB%hl>!AbD#)eKk9(CG@T$<T1z+@=-$s^FN;I?V!@ag7Tm?Gwu69e4<4
zJnrn4nvKKMZOK;YTQJF%Jgw-b4K&Ah(3J~mok+S*Y~RpuG&*eGxm#Q12I&k9FO~V}
z+R#bR%{5sz9ism=oE)^X2`#=PWFlkGlRBLkHN)4(qvYZl*n<xW=3P}NoTMSyv>6=Y
zv{*2$H6cfMKaKwv;1nkxPA+qiGa(H`8A&966a{*dc;3_t5Lr{Kcg}fTSTCrW{0R^=
z%rKzA-;J=-yOL)q$C(6lIeh_1Jn`Q0A+Sml^rw3v!E#qsqU1o69UoH>)`I3bOU1^?
zi6$Nk9JR+bVH;CP6f-HS0dA#xPXn-xl+&0potlnfiQsiGe*f@wWyg-gFs!2;9Uvw3
z-`GZp3Haxs0Z-yEqDWjni7JNu1hbYL*`O^+FANnooyew|fR_St{658t$wHoCV@<%G
zOzh-}BWvY7!iMO94f%7im2Lu+<`&n%%f5hBBuUvUe_gv23)9`60bol$XT3E3LE*yg
z!+r&V$gM2$zed|fb)0U*!-JjNKVRAT-FwwbAKtcY$?;|xCQ;}npM<^bSrQ7FkUsvL
zdWTmMV9(>2(q70bdo*xa1-EfVAt%>!hT4T)X3gJ$*`~{cd>W*W&z1ZirwxKc(6go$
zPxM+X^~uAyH@CEhB2HvA-p}hKv>-l&nw+f~>`*S(wqD-|al5Ggxh2FjN?3{{1e!!s
z9%by*oy;M?NKPhabRL9dI`k=^1xHFkp(Zy-XYmb2%8M{8{)j?N?y^m!B&zU!lz;mG
z&L(3fIhuK%ZZvL>u+vq>YvoRD`Yid&&80kczDyaezkn<B@)g|=3Hk2_kjSv6((yLw
z()*vk6{fN#lrZ&kHF%u6?4}6$0+Ex=EZZcA-0ijvi@dHw$D6OYEVB`J*dK9;@jp97
z&1)T%(ee)%oX=X5sQIOe?sn;mMausiA=w0CiPz;QidZt${Lj~!9U&0IFtnu{zS4hV
ztQTzM2Nghu8J5^9TTcstE7mb(d6g>t2CZA$k~WrW!?K^!M15RRktf-WDxO0tDrat7
z(u(R`l6M>+F;6G{I5mDq%}qvHw~#S;tT)qKsoLc&Tz5+osroc5#GO$h<Qkn+OY@R`
zqBnJe{t*L7ciwPZE7C_IJ%ctyn4BCFaFeE7G)h{J1GnLv5YCSwuZ#{qBs%qJ*V6ue
zA;}$`LZkAE-IW;`1{d3vIx~1wV07x!kcvLZ$c563vrbUO74WW8cagr_x5|e0P0cqF
zf$3Eluu?UG-Z-fzS^{8K0oYYrGTm7xXk;Ed$+g+{GM0ZT!E-=ten4A7$0z{W%lh6>
zyJ%If@ky@cmGqx0@2i&~2HhB!8lU81S^bQe=TgfUdC}81GyuHhV6(~;GuT7XNpg_7
zxNX70g!ngeT9x5Gu>ho5HjH%N0{8y_AZr4c=%bhW#MvBM4#@vKI;hTc&Ri{{55W~V
ztNnTL!gr-)$;2wf@MKLm)2k~;2poOC(s7NEFK4;@e8owDTZ0~OB_87!@MiNque-+D
z3LP74-hKkka%ASR%TzHt8IHhk83$-yYF*KxkiFY8VAb0`<>(I{`NP+_B}xo}Fmy|T
zqPYK!-Rc#>&tw79>BC}`<RpKe&Uo7!f_wE${C0DC1uG7a!3&o&z7v%`8XW>90|nml
z<<C=mhJy;d0(6qYcX7W4dkQ4K35}frtS8aAxSFWkFjY=~GdNFt>|CGp0BRlpT4&YV
z&^y^u3{<{W(W<jsAh}U9a-&8{{_1>Gz~2WLNb>9X8pL;{eM|gF{~tkk-t!S?m|6eP
z_lq51LXRN`bP8DeIWMJmFlXecC`1R*6S6cJN+VoBxL!NExS}<9e$YXXqwt%xz*tB`
z!r4Kll}HOSX&^!+=EJk?JlG1$v`|8N2d3ne5<QK1HXB(<f1jW>?c6WCL9p}^3akdB
zsI@}QqF`79yQ?MWTpl0hW%^MAlOY1dH)5chKp@GhIhrRe5*5F>MMDvBnmV+a>O!EZ
zrdr%h24IS`oNFD2IKTvK-X?P*T1|mhM2o%o;4JWzeO((;;L-gUSI-o+z^FvlfbL3d
z;nB73v}HT%f?CHQEQX1-HA(T@$!KVv=!DW*JLKxNX(@o`#N89}EhGBCN2NsHWHe7U
zVjtF8KvW2QgdH8cDozaE(5dW`EiVkF69HyC$z!*1(EkX#qGN|a7`D+nY^(tLFZK$F
zrTo+#04}8=V9AooK<P=`-wn$3T(l9Ks2WW1kSC`*(oAH&5%;%NMq*2I5-VFuHURyo
zPEM#-c_4(ng3WqPFh*l8nU}H+gugNZNh7WVJ@@$XNDNjdi|<ey(!br-n%{><u3*2y
z)EE^@I7urfc$tJK+PL{(i!91`Jp>WMmQ41s?BREyk2+PHJvB%g`0TwPd4#gUgmfn@
z1}FHG>3o7(R*ux292ulsi{?`t9H^%P-T^{}6HXS?!Ua}&#lS)7C!Y%j*Kow52+?Q7
zzyXA=dwNW7kj`RCn_pfEM4lkwuDyunoS@a8bFn9$QqcW3cG+B9y`oQ$^hy5<JwPxt
zVm`5Z-^cSk>}d{g*056mH=@D`0G`P+cf#JuZW)qj{$mY!Cf|K*PeVh>PPSaTzMVo9
zib>snXCvQ5S}Q3mT*M4lpA1&J`vq^<wU-_L5QSo6hRV!fncGGMJwwWq7-~sC6Zn05
z5q+P49oNowU4K%3({aBXua<@>uqJHre%;INEL`*#Mq(A4#BUi{e8P3AuYrUoJ(@|L
z|JW{V^DD1R+;FK#!OJ5;A&aoGPL=QkbiCgWqbQ^ntNaB@Y3%=eok?!RFbqSl<UxaV
z|BE$BY|%jRx$DZvPvc3X9v1+`2l|s<SDKov-Vm6sbvhk=4=^k*t?WBQ0*W66BPVt%
zrs=c6(y8S54g=7fkMz5FEqqPi8p?YUkUE-}pzQc1eElAvK15rfh0ng-vUxI~%_|BG
zMNaDZGk~3$@b0lJ>r&k=XGw`LBKwk)QX0*H(bIgA8KJOB2I8QcN(g!~P!bt`;lB_^
zH7Ms={qh-l*+N>N=oOQ`fmL^93qiS{NO*a9VKZrURD3R9$~>+L-;GJX2e=yXMrj~l
z4%jz<^TQ43UC*)rM1xe_)+i%Ff$xgdpePrDEn|Tu{ROBSLI(4~7G+Z}e}xc~Mc_{A
z7n9QHwhR%)rC0I%gEDN$wXxoOUFEI0^FKx_F?3MZxUOQzHNh(w9UQ*rU&tN+9Vptv
z5%Rd7;8_h9P0CcH$j3lhXcsMJ{&TWn6FJJ^H4E3Ce|N<b&@CxS%Uj)QL7!&T9#8qm
z8c3he-3axr3Weq!!o*D73d$?_%|ejHxn-n^6m%un3QCros|hE2njEI>N!LO|$%pib
zOfncF7F9D9Ve(q&r|d`7iaS-KO99g4eT)law@Wr7Q_<L#W)1NZda7n=-1Nf!==wJm
z{|LJh<cL8S_9feZfd7B2brU2yopnFpf!%~)S;wyebh+-Wk+JLON71@#Q%zhF6dHY-
zVsBF+)veq@`(u`#ki`bs|NEaUNS7R2HfkZ{(JPV~G)6I#LqN1nmY92#3&833r-N+@
z=4P{Lt5WsC2-*Ncs7-UG^I5CTLl_x0)`L&7FJpmL+WtcxUh>3D!>0Ez$o%I~u0Vs7
zY05}E)656NuNI&|${+xp;cTy*EPI4<stv!ol+Ax}nX^FjiX8%P@_S#DGDSP8!sEL9
zxq#9q4pnUYxLOK#Dnm%%#BCnGv!g2PR|1EZTOi$V9>0~GWaCAy@|I9CpW&1y$GBXB
zjw~_RGRw*pNDM_Avb3i-WVMmZmFiV+a=oU>nzPUMb`=?aSd9S?^t<*ghRN=m2&j+h
zl8+#}VW0b5LM21oYl~_Wf*`vASXzOD1!ny+N{BKHS8#4fT3NCl5nY%;@Q%B#8{Pv+
ze=eZ>33DpS)|sWm_cwdb@<$ZA!A{Gcjo)N}hyC)o0ND*sV9JY|Y-QY)AS!}5_RWs?
zKB}iY1<MC9h+~f-k-cB^jMBIt%0WS3D&)?HgYQ|Xi6AY?V~YAtbL?$Y@@rQr8=-MZ
z9EM3wM!J9Tbw)`Nf<O$tQUgtZ`(JDqg~Xr90mjl2l}XYs>lj)+o3m4J?3BHbQ>C#j
z2Q9grVb6d=%1F5x|9c|h@Vd>Lp^?>4C)5aZ6LULbk#3`p1|h$LgLP#rJ_*%E?$89T
zspSJpF0_>3e=lxLC?yh@(3teHSFo6vyV})$9nHeX+pzUsxPD5Ufai%&U%qGCxJCO_
zNrqohg0@_%;xbM<9||?0)Kw{7y&s4(i!t1wHq?ZY1cd&76wnm)3FmAgQzJ!5XLAsG
zF%CWU_W}54Wwb{A{-AWU6(PG#K9<TuLY%CAZ5`4u)8B;;Y&hyi2WHJ%rhOsFQ^~7^
zKby>?`qllTkcv5ICBLZjqaea=^g9>g91XH}L0f7(kHzl;d=_HmTvnY|IoU<D&fbN(
zP_kWy(!)zxcbD74c`^{nYu@?Dr(7$!O&&IP2-Ts~x)=eTaaGhu3b&V_6n3d9@{Zf4
zF?Zs?o&iJ<3MM_G+%WwH^Q65C6mRD0UnQACK|Y3!PVwet&R_B6s6QJfX0>c|syC$w
z|NbVm-UBRu2@vPCbQREcbs)IB51=B7(mCE2ZE6}|IeZA9B8n*p5+%ePqwaQprb2nF
zN+~=qhG~bs%*6j6U)Pr8FbKo01P&4S{ukSI5=;Hk0h*aM6pWtr08NM~9QQtxohoS&
zG(eGZ6dJ4wDW+o`!_KIHWX#H>3zCZk0oaACEU%1nWCu_gcG%!<KxXBXyX&Iqzxaf-
zUm<0APsN9HJY`*5oaY`tlu8PLyJN9jDy;AfvZWxUKAc!QnTG>{u~|ehwv0V@E($ok
zQUY7)>l2iqjy8GDC+5s8<jwu?jhp$h!@KgaGCD8&62+*D1;U^+l6wKR9desdDRXOz
zoMbX#SzMfM3~EGK=MwhP$=fv{rX7zqb=U!wNsq3jiKhY2Z6}-S@PbrFC%!B1|BpCq
z*B->FWVcB_x3yrP(*JPd7UEB&7g?REkiL0q$8;1ij=~!f6z}2c5c|S0?S6DLA_nA*
z>3X6l2+h6)<$5jra0&>y<N*7CTS21}vMM$uu&WlqJ^()qE4S1=KzmSxosT|R<yrs1
zqkS=@vmh|{Upn+hom7kNTi4nCBEOD!XMWkJPf_1ttq%_4^3&0@%7buFs?cT1g~VQV
zI%;Q1e3|Pnezh|NfZ4u2BvY@unf`jZU{8O3Syu;=U1e{s?ME>;NBta;j$1?Orb68j
z%2Y(T$330)3aNNGEUK9?HtQhbkFYDdk{E<xE%^Y1`)_QMnMLAfy#<5^1Y*b5(bvC3
zOtB16ZjD!Yx6rFq%n$SEjD9?>xP_Q)awb}eEeVUw0Bexu)*b@3m`Clao}ZK>+AWS2
zYN|wvZ|daDKZm2bxC|520lWs5uFS-`n1tgi|5k1;NPak31=+p>7~Ofs@eX~K9X2Sz
zk*x+lY{=dx1eHk2&sWX%c^N6Q!CG%dcZ6IjyLbST2f+3vUv~Lnj1~<JV^p3;ef|Rg
zJfQwJ&+2Fq5I3c^4Qa{PL0VwUb^<J9)2!}gRZKQSP+eyaE^D5xLxin<#+Y6G5Pk_?
z8-F!32D5@5I0ki800ni7-~h`<y9Dv0mVDu9@f05nNp}yNr_eE3N%uIwuV*%G^$mxd
z@*1UONV~f(xJtE~xFp2l{FW3+Ua!G}w=;m`cqC?1IWDzXZ})(o!*8kOH>fY;0N=#-
z?*XW(<OTNW=h4vc`HuxI!ldyRWY0f84@tF5@2VycJ7v3kvR3LYW_FD+1XYzBSB6}J
z2MO&0NRe{72>a_*MvhZhSARrE%O()=G?!W@cD4gd@>OeGriV!dg=o#J5i$_9BGw_s
zB~XWU0#HMze)zh!YlmSFwo)(<@cxV4xQ!)$^lE{gG{rTb7ni`3eCRtBSE49R@hC9Y
zEDQ`t?~vbs+W87NO^&P$XFPSLTC4JlMvdvm>I|}FD@9!^0xH)QntcSP1-;}m^{JD@
zVEHd``la0DdzP2;u}pO-ce;P)!53k^ka^1|h$Ag+9E1~0yI+3z{~wS{Rp*=)6N=AU
zUP=z@>li_$8_IAQO2~gRM~-dH_g-ISxsBMt&Xf-TIK_%Yheo2wQ&G}mubev@(EnC0
zeW5v=5@W9*u6HqWuj;~#A{V$tYp*JUVX1FM`BQ~{E8bNRO)*&NEb-@ikj9EFR5cXN
ztyNQH*6>2P<&0KGth|qd`eyh5?~rehBv>Q3Je>SRlcy*SY`KwFXGo}8&hTpWSb@!9
z;zG-XEhGN3r|b#>RhZV}5IdqP=&64Lva#o8U47CXV{=W$ltr+y6n_nrcAAAlE7)pf
zRNL8WN$ofwcrcfxTOP!O1NM~;ZHONtrMqN<p3X3c!Hv(@HiL_wf6G^JV0!yLSo)Y(
z-m-)dm%P%Ff>9)$^`ifA)SgOxUU^tJ7zgD>e>{dVc&h~4ruPDRrAoz?$}N{C+1@5p
z0TvT=XouSGt{*$AKf=!F%9Rj?p)Fw>F!bNpTW?~CpVccMbCOBIfF)f$7r@?-bgSA}
zU8CPe4L_57ubcB}HEFX<g_o2NksFgkzifwJjg2jl)z!o%N%-2`1^nBA5QyC_llOpx
zFWXeqt_6}_HeB9=iMF^#c2+z5p3F|m_Q>pd`N}02pfqbA%p3NQE9!=(7jd1>B*z6l
zXq3M%0RFITy7JFux@5~0b)ztko~ivL;A@N^|BIAT90GkMLL4)2xt=D#uVYQjUOzpQ
zUm;{FuS_Ovup=YL#OZy-D0r~?3K&lLIk{tB;l3Uiy*wgNN}2Zfg%G?gK~2tl7*4Ur
z2D`$s7#t-^W|G8ih>3NZa@9VbAz#jlD6&LG+b?T)Wbzl#GD__~s7ufI;>BueC%r<M
zq|99|#~(HPTgp8Z4=0mtd4P$`dZZz^t51ms!|OGgHMq)XGZ7gb3YnV69w7)@Gas$v
zRESxvBj?F22i`z*U!Ip<Egz{TsK(7lkZjjp4MAOg0@m2N8Pi1_U$2g0`5mwv<)pvL
zIQ&|YB%jn!R!*F-a>gYlPj1i8W3xG^fHj(>QW6C6X_jA>WGFOu){Bd;mQv!q9JjD6
zCSL@#-Txrg@^WhkcSL#X1ETIfzOL-ZVi<&Vv}1e${WrGZ#g_7=1~LxgghNPj$uaXw
zO{u&^M+Ccu20wO<ocCm>t`Hy4a^VCLN%I^WosLBuYC?oT%ItY!xuFL&JLkChG>c)O
zzJml`G_vCoJk16y|8|po`oU1%<!j(bZ-sM6X2WF&-fQ@ZnsMK3IUZnA#oG^xQhe*N
zI+3gin%kNoPr!S)2g~!t$*F8{qG88o5leguEPP1XC@c<!Qi)?3G~)JU9oHx=6pj=h
z5M?z)AfOFZfQtH^Mnhrflg1v?8u;@TDPIBn`3USln;YQROtl{pB&KxZ1pnozo=#tu
z_d#oU`}F#`Pifn0QEJE-VtTzs=4V3%8L6p!5VV$eV@3<R5JIbRPlhll$g<I9rr-6B
z+C`KhFpO*LF5{Pu!`K*J54CF+hMY`q`chb=5pzflgSaS4c}-EJZj&37rY5&xxP@11
z@i#2lXpf{?WEjb!mMm&8>!|Y&d451B(aAP-l-BcaDc*S4{w!@KHAgqvtD*Y4F#oIs
zkokUvr3!(OXl@u?lsmQfeL$3`N6HsS8ln@$^6Sb`0g!fm(NPz|m7^lK4R?4+nY|z*
z<+*mw7S}roYVs96jFc({{|P&@BZpxahPEVA2f_Xu+h`pD`a%k@Cvh?~1%eM}BEDwI
zSK)dJgt)IErp@9A3N|tj!9rN01QMYIeX~%?J^^yrbIC9nOC*uBha;T%$u_6S8q<+{
zon?jn3PRef)HJm(`irV}`x~$n4#I;sB685_W}PL7s}dGH0Y&F<{i+0=E6a6JII0@s
z1SahDj|@_!K!xK!-+F^B1f7L2^6II+bzpz~W&gw)p7f9}1?#Z2$_Ma5vy%o0gQAeC
zu(2l4E=n=1Z99ci_z5eVLu{{4O=3&MY?%M0^J$+zO1V#_A<UDTxZh<qjT;B<wT)cg
zt@Z!@s!^%3BRKTB=w!4VucLJR3}ME&oHd<jt`~Fl+B$ODPjIun&gHEKT_NG7PY~Ga
z^ZsSL5DrNG*>Ma`?t~Um`r%T&ggh>ypxd5u+{{;&k#z_n`-oq*pV9Dy)1xg=eh(J0
ztx2|{8;os4Z%gb3syyN3S`6Yto=_r4OJy!j+f59Okwc#A)~<fWsyrAHX-Zy#ca-*h
zl~@=NPAJNwNRYjMl-$Gd7DG&)j$0_|jc3CbU21Q@I+&0~vW{rKZ(w~nm;yIoNiu&L
zA3>$9<bQl!*^vby2+U|pMG^B)Y#%D!{tN-ERXfiE=<6aU-du)xws!>v)7+lwAM64r
z?kT5t*6H4i#UO@~nx2Ben$Rdk64Yew%ay(b14#h=c}!FQ;PtdE86di9=YU{p;onPI
z4bau=Ff%W&s6>0deH*fySj%J8NxRfY1#uj^lym`TP$UQ;{uVS6I!-|M_X604BdjiW
zk}6r}=X-oFAW*?D&;De--h#-|0YOMms;ehB@SZX9UpKkwdjXJYv<X@}p+}&m*2|`_
zZD?yeHQ{CW`6rZ_{s-V&p8`HuJyof~$&LX{y^0Q+N5`~vI7KPj#`N^6=+67!tBOp$
zpe#@mw`~`U{I$~orq;AAn4A=X3gGV7A?)<BJo^B%QK!x%@RL7&89A0d=u@7QF9?il
z_-VO^%}5)IiL0=M4(bF-AR_Cxp|evk9}t<d${MZJmJp2eM}W1QJ$?r^o(D05?rc(y
z7yWG<$?IB?U!~KC;L`TuWNn@WELB0-L{TVVisnN<UC4N9X{?JGz`MT6pkJ#YN#I15
zeJ_B!utf^;Mk1M2*Cpd3m^EToME}+*AShN%s}h6Nrgj=tj#+?Wub%d&2JetQ<YD_R
zsJwsMFkRrO3j_VybEXxv{aS*|@K4y4AV~<qz%M0&B>Dfxb`a^NYIb`cpi_gGVEX#~
z27}D1B1sagoIb7e<st&W>*$Fy1D78Mrl%B4M!9$R=d8^eLcE@2ZMhE+n70%guXk}Y
zu+uUWvnUG+<u#kwO00|1Mw9PCIe~)?YLg+{WvajB8c=^?qa)zv)7DW=barJ@fU+=-
zbv8q|%iKuPBryvE!#K3D*KkDJ-@30C28OW<%0mfZw8|yLWLemWSJ1C?IJmOiN<Kvd
z%SReGhJZnz)IK>WD6ko}vDtiq9hWz0PM1VZ!pKp)v%zejNffmV1+kq2!wl$0x}3L_
z`S--Jzmu<5X<rI{Dnn!LN7~pOH0ZOghOT9FVn0G9Jhop#{__lqre4FgbMI_RuLNd(
zfH#+a;XdqBYIl`B41F!U<RX&LkaUN;qH*R}L*5`*Q3FSV(UPfoO<fKvB_p#ccRJ0S
z--iBq2v7{*&!>pz08v$@_LUnCck~T$%37DR_TSh0VYYxg?nQ}Pc34gFwacjq?NGuk
zxMv*>>rx0}d1G)Qp_4n`QaF)x=`&DUequ+;)Z>PQXp@vGrt%{ss?l#^XIe}_ll(|4
zAC#!?O+44FVGm1rbvc->!)RFh!`B%dKn#K~bR|Vl*?+M+s*wIP3wUi$MIq!JssBCP
zv6$|?T$F~x1W6k9a-*hd-phx*mvQolgAsJ9)Jopd&TGN`CT`lps(vN3q0*&VLQhiS
zitGAN_`R}|m1prJHViFo+gwtOSksKY!V6+M>Kn9b&)y*wVLO2U-PoHV+j0Me5Sr?y
z0~i{_fdn@zqPG}3AG=JLj;#G6a+gq5X)~Kk$r)Bsjv|h4aGEIC-UT=1R5m^48Fv!=
zmqDY?4|hYALQ0t4tZV2@C_vO<=GAr8C8@2H0z7e+{R6jn5??CYdLsZVobQd#LR3%w
zC$tHgG}4aCmA*phty`a^uw4CyGig^K^F4s3>x#Tkx|+S!kuGtePk;hS0(Oqbbd{ch
zr5!z+Pdu`%H4EE-9Ha5yU)4=0*v_?RV<EHHbbt+M7Wg>UGG#VzUHy9iFJY8=`FySf
zrbWt&GKyTG?edQHosBBwv8VbTpd3REz9J20!7DRr1MgaPuRV>A<FcNps;HxCqfY<}
zrP&LhdHkB6wb*R2goy(zzbBTGjoi&1r#2Rq^_{XQMS)s!F(SN7`U(&k+N-m+B@_Cw
zQ(-e1US0=fe%E3`ME?U=r&C!m6C2=-vaJrczP}ULKf<m6$6*+ReJLR!g#Ul+N*7F|
zX}%9cYL`*4u^k6sMp^wpkAWJ=K|H#gou{7%D6qqk`sz1NJ_+?Ov0xk5u4oVMpd#!D
zhWLU_S*~)K@1Qm6dO)9Wtfl#xUS3|3;^IK-u5zTq=qmt#{q&a@R8<9GPi-rGgi7|7
zfqV3HRG4&!(DqOf;ApUFkg|vjg|^TkNv#4_9GK0NIzT9=?TR7g=_%z(A4Em_IP?EL
zz^_%yg5FHQ>MM1__rs)ofDHg1y_GVyIeiC*Nr{m($Fw)4rj0`J+0L>rsWrV~lXS20
zFrrQN!kpq>?{KCPDzpbC^nfyz+XdZ~rtxXjC@bv?6>;o|Kci>1M;Mw>0g5kN#H|hb
zk(oB+A?fQB@>sZt>+;~<b5{~5|2D5(#w&FV1~OtI)R=bZhfIk@<Ed!#U2{F=^-g95
ztwQG8F5C<SG43H_bKC&h47oPPlZpr?V9`%=xp_%1H?P(embbF$XUPEC%q%B?610ZB
z=|-(vyxhEoru$9Y{!^3RJ$9!DXhk3zbdk1m(0EF<vsF2_ayLx(=hx2YJVFnhDE}3$
zI5k6iVk!0S?Y~*0+`K#`+JTjL;$A{M;oL5h%?2i6r<CiZrs*GHW6f*J@UJ}9Xp{f=
zy0T-5K^WGO4dGD#jlDRFWqzItz`K)V0LwaLBrY~7HfvO~N8)yb%E?}@@=@%v#ha~&
zR&uI}5}`C7oQS~}Imb=v7qEFQ^HdFUw{mBc<N#bgUMSDumc3q_6EYecn<Dv^)1*)S
zR8P?LPO!=IB2z8sF2}6aKR;)=eiJW9?tdV6y^(0Pn|=f!KjN|(m;=St8_H$?XOI$L
z*KF0TT3xZbB#PmRm`BMMFdJ=`e+Kpc7ifv$dxoh7?A;P^Xh9p3|A6#{j?z@ljZ54s
z*YhjvG#%;ZM^6FBy)g4paJjL4F7TXcPJP1$`3=4o*?v3y<UU=L1YkkxwXF)$+`VNY
zE&#}vK%ULhOGNTGD#B1t0V*HmM+izWlyf^@rlL9ADrMehHoUP34=>XXrGs%Z-Vbe;
zgU`Dmmz@~Ye(+Xct1_zVf6}-lM7Ij}c-OO2S)|~9Gwo4!14@J7W~4d54^bm1UwaVx
zfJ6}8YMioCRTfAz23>@@1To!gUboamFua|w$wODtbp@Wy_Egt9dh*V~0LJvY+-1Ho
z=&AoB@_iLLO!a(k1zen+nH72(FGRwiE6R%7nX7y=&F*FBUhxoJ8alb1$x2Lfyb$fd
ziz?K3^j-c(*p+2l41%yNfhgksH}<ZrCjH9WfTvX)fDEALtwzW8m!AAy4_)4nFWU5Q
zb)EH#p47i^OBs;P+}VlcE`tDaN}lL%06J83w(4WB8fX%H<wj|*yxgSWWXSmzO>8n2
zsO?qr6aaQDtareXBVB*P=dnoa4D9s0Z<`Cf6lk!_F+p#c)u`Dib(q~6@|JaBbo<2#
za>j1>haLgs`C70`p0~fT4V%;D0oPDeOz3;<_GG|%=Z#u10@(BOTBhtgC}G(gO-BRm
z=Np{37TZK_$HrHTK*__ROq$;d|IyVbJ&#HLcH$fSYP&yzBr+hW@?|wXg$TNBOuY{E
zv8SZ2O?EsShlKFBUDuS&5TnKBn~xq%YzfMA3xFTiN*075arJnK%V`WG(nhP)b{&Lb
zo@7W2fN-4S+_$^VStpHs1O`&>%7D{oP!VK8d~*#siGf(0_u;l1s9;I>J{@H&#-PZ*
z!`1C~!ngZ!o7VLoAQmkK$ggu0j(Dpjw`2gAXvGR~-RAW!M@aQYw?J{R8!>I=7bN{V
zq4hs})NP7v6F=eXkDHF1$J1}=k9I1EYnkjmFX=z??%j8Uxz_l|(?EML{<*Guqv>o%
zG^`6J@?TyhWro~(Fd^QX<Bza&Npctlf#{8<kjzKi|6&<ZRyQlM%PQq4vVaD?zT=Gs
zO~FUv))H+B<Aw>f-;|-q5@&v=*mQYr23qs#>(csb@bQc%v_fOl6wKDyy@^}4r}E>!
z024NrY)<F3Z}1=AKzlQk=5=)<+HBi=I4Sk+CzYB%t^RV&&tN<tEiu?6icq(7+|$Nr
zeccMb&=o3NXU}g1TQB=KGN-j~>qQGqJO2ifVF}0G8DM|q8F!PlXdPI^^%#ud&q(K8
z(tK2!C(-$`CteQ`8)GGXR7}ZAIq<Kj>|;J+jpa3m5_X&$Wu6&jxP<2P5p03oLLh5b
z%?YfL@qjxZ<)|${3HqG#H2fC~vHw52z<yNcQ0EXEPc*R*M9lotJ=Y@azF0flSP0ZI
z%o)e+zhqtH(^g7gTGDl{W?Tu*7s4(e+7|jl=XIcsg*CIe&CNJxZX|&De$WEaJO2HA
zk;C&7Q20(y&Ko+o?WS{a?aUs7ikBxxkKN{jg%?^f93EGBNyDpx=p5>zso%nj;@j{H
zqrLf(=&pN+G9Cxc(8uPNDt5CpA;Dj+U0OK|`xqkv8*)AGGL*(3FAA%Atv_^*z{J>=
zMez0;u0M>OZMMW92t&6d0)qSB*c+Xa^cV9s;OU308c6PSmsvl6LqcA<86`#Vp7-m0
zFtE7x(AVZKNEZBjRQ)9cG3n+kXDt>YemzI%;A1e^FL5Bs)7{*UfF0yeWlc^Z$ad-f
z(KNUC(!~n9qIJ%-zXsN02E2|ZxipY-Y1V62PetaY^Oj%JpKABFxB!hna=$9lpG*@o
zav{oQK33gFZOLATO`st6D~VlW$N!AKGU#xb8qi9XlvZ*qGS>d46TonPF5zx{jbw`G
zCCmb>oC&qyewH%K-AO(A5waeGTA`xPNtZEsnf<PT=z86ZA&{!Eo<ospJ00k9+0!@m
zznA4K`d3jlm&umcqwAx8=|VBvyVx)oWUv=-6|nlU9{MM_(a-2kFsDesWs%;mcm&ux
zKCIIfx{)}j)*sEtTA311QgfD-`(jJmb$c&TCSJ)bB}g9%TK0Pn;#NK<4<3@&K$^1t
zcopPAmY{t?B`Vncl$^A`2jZtHxzg>4&%4R)V_H}979ns2tq*>Yg1cn-)t(K7z?E-6
z;bSN_L5U@!BcX{5tlElD>ZAD#j?il^LXLg7!;?Ni_&m6b)ec}-GL0GkmVp%4=w&A%
zb!BW_uX@`=%8h*X#eamIQIhQ-2t>DJi;C=jV>4tzcis>0|5mDQG>Aa=>7H<etHl->
zaX>Xh^h@CqFR9@cq06Dg>X+hv07B3h3T-$~Yj6&zM`IKnq-IKT&eNuF5X>Gfv|uWZ
zShVTWA4vQ%ju@Aqh%F0qw_VFpzoZEJW9GTVh+Njj7Q9`W$0?89-;n#<y!}do@$oO^
zeP{a&As@!}b_dAmU7oOEm#EPdZLI?Zv>%yYXk@!6+>bnT_b<Vj`xFlAQR9C7+uGa*
zrGZIc_mLzM;1gzRl<@n*s3%w)`h0`xhn3yrb~8-YA+hYpE<#!|8_~W8F<ADH#CcTJ
z=gH>!uWE9<>=wZ|XF3XPmYt^A-byf8hrEo^Db9kps}}8ANC{)d$Q~HDwDI~+zYLPX
z#Mb;e2$o8^$mrjsFntaNSuAP2`*s;7Z6ikUZ}V%cam|N4=k1qSaQpLCDc%hgbhbRL
zof{xQjGHluyg~A5tp2RB4>3|GW|S1-8N%-)WGP}YzgW!1ed@?I_jW@XuQfhCkTVW7
z<N$XcUaCzq(#?q3xS{^VO+7}tr6r2-bzC8C(j3rtI~;;))!1(+^D8kyu=X={AE1l`
z)5BALzr!l8p5gv;G5R6wTyPu)VIX>=6$abD{V%p5jb|cNnqI(7Q;PrdzAa4dWGtc-
zmero(nycw=f$>`}y3fgssw({f^GXBk)fCP5^lDZ`Pj^ryEjXOEw~4woalC(eKE+;O
z7ATk>TTdynx3hyOUxN4Vjn`Wh2t&-Sb6jJmW?)tD@)|9XlIRDZio~dr^5vfVsUu!-
zPb_`Gda(5wWx(Ji&K02#f@4X`bED6LEd3-jsecCCj@L)cx);`9McAZHpqXQ7H3lJ|
z&8Q(Bx(96zj%f>mIc7{e!<@1XX~C@oNOs<&lSQ<L%<C*5Y7#A8q@zI=YRHm{MJMBB
zaByuHRtDXtyxquXNm#hG0~cMLc9ww{()%XNbHBtO@`nY+kR#*8%;G$N>(`LviB4Q@
zbJVU>JAttNF#)Zz!fTvRy5JPIexCkc2V%$%CGBxlzJXhhu4BljRdX{e8OJ72i18;U
z0F8oUqc(8Q)5J@|Rd+5e$&(Day47p6<BF;y<=-m%3o|_^h|nMdyLH*f5(jegJW_)5
zT-Q1yNhg_=+Ix{migL<nP%F`~bBIfpJkN3D_MwG-k4e;Z-&_zdB$vDYumD<1L~tG3
z=4--UX)6B{c5T-Vgdnh&TY)Gd^xxQxMrQmX4Q$TpMv!@ZUA=N0lVtN8vc2zvuii_>
zn;LZrP{kk5nG!pc#XP^H#U5^jF>b?36j&}+qbH&r>)<w#LA6#r?zmXZ=2$m=(*m=b
zPaCyLUaVZKW{+c?L&TN#S!2^8>lQMxngat%qCHb@v6<U$rk*@42&=uZ@9;smXPT7%
ztCY>`THguxz{zgE-K_Tl#-O9ECmB#_^Zlb#(1`4FwOf$xq|<}wH7F~dKqs>G?1ebq
zV*cphh}MJ!Oqx+^;!`S0%98lgL~?4Afch9WMz(lBC;d&SEsnfpZ|jO)uH(gOPU|rs
zWOEJB{_V#&)}gSrc&<g+i|<ybj5`%^STlx_;GyO;k+OOo>ku!DE(9syo4;<NN$~^>
z#!U@ozkS_{)vo)!uG;Q&ebC8-xq;Dm%=(04n2Wr`0MHwDR#VBml4$gGQ~tNJr9Z9<
zbxWU8n*F;SyE%iDOdEAe9{47^1O!Q=-FhR(xVl`)KmsofSKB_{p<tM!z8^BvrD>3E
z^YErtnH(w-xM;Il?7nN#MPIdE2Z{^HQf@=(##4i!LafHbDS>Dtc76lGizhfro-;vq
zrvLIdgwy&Z;_siZYs<0_gkf81(}H&Y8=FC;;VX9o96<%r=CMD?-I!l@sN()|E7`n*
z!7dSg(cg`4;+A1?4s+6F{D2j+?SH4qFA~OGGVaFuw|y<Ab)A|@dhf6xI2yghfzd3o
z_5`B|#b77ck_5EO&<`+}X?=L=Y@OxmfR3q`u?dk?yiQ-6<ohtte!Ph8)zm>WuKG}F
zElwZwEGVcM`^bI5jm9pTm_BU4gqLZD$ZU>Xdx|M@?j7Fw8jjiKJhelO7qx8Y0h%!W
zwshYCrrVCD{-1+vwSZP-SL2GMK>1Egf847eM+h=@m{VibXy0@-6wcCkq%&$K8x*{P
zB{4!9H>TSmoTb6fCDVQ!K8g0p-H)KVdky_tQc^QXESN=nmNJ?5^#}Z#Ug_+V#NM4A
zS+-sV+BZ&PhFvq2*U0jm0Q$_fZIb`+t(jILodg_g))e~o6x-e9$sN(lh)(Ctq$5P<
zHZ8u+b?Zk6VodrP+c?|^G`0eg;!j$%cQ1Mc<e8pCSAIM!8L4R``AU=vw0j;67}tEh
za)B@OJM^183**%W)sbyb9hba?f|43W@63f2M{9aa?@sL1Bml<oRV!F^!2w^dW)&G;
zqxC<+&NkbD5QL#yQWTW^Z|prfC7EC820WdQG72}z(~G?R3Zs*EVSzyNV6f#AbI{?e
zx;QP;6+F~<wk__hLz;XS7CllBdS0}(-(JD5JRI7B;&6m96fgnWtSJXIw)_<ukOYnr
zNaWSxC|j5uk_;{4`@jWnXdSODSc)E0H!t&b?3_&hg3FIYFia~5EFHW0N#b*Dhj(Fj
zeXaA6$q9im1LpBf{HmE}qQ=jow=H|Vte*gEpJV{WkqH|AE6_Y@4Cqh2Vdu}^<LDLe
zLb@$%osjTYjVw)u+A9jCFQSNwfaWpol#k*&tEmHAe<o_*c@p(8<eAELa1hPD_L*cd
zHMMS>)mShM#ys&lX%n#j6)uPAuYO4eaBCY!zfMW8Ay}Nkpn6P~@_M77W)7+#!tS9S
zT0-OIaI3g2D}SyX)1IwGxYo0pD)OXt#++y?Kh0UO0(nT=v@?q_Us>?-PC7+iZ7Nst
z(`iUY`k_KF8k%{B^VD9xi|ohKP1ku3#=&m@9tU}cWmLBHRUDcnBs8qIlT)9NEd3kU
zh(sH)D7wzo$X^_u`O73=1DC$hv6<B<mt?6?STmuJsyyCS=9Ium!ZsEtl9_~UKJB1C
z!p<=1b`XT2TT-ZqOMAP2L%)*vD|Z9V)V2x%PI@1f)G{py^4T2H_oVZq{m5}iHp|@b
zjEj59U%$*iK|5MMt8Sh7NiOjYx64m5P|(h{-K&ynn|hZ3=UVTeO$^EuMfRDTRh#;R
z3QFTmW3QvtoBcWpvZwbk=}ylc-8PCTsMXL?K^&UPFDRMW9g(xT;A9QdzG}^jd6+or
z&){_X{Bhs0S~G(bV@E?`&C=?hV)KJsh83Q}kvoqcPvPJYZ#z6@A84U}h-R_E!<iDs
z9?Lcob)Py0+jm-nD6oB(N?6@G^w{jt4f0D@qgY;WrECVYjWE&ylo@3%in_jOVuS6A
z6fnV7_qN!sW<Z@0Y&MNIZm&d}p0hdy9Fr9S%gfI)5J2VAs<eF<fLMXE*|x7vzJ8Y_
zh3Tszk=Nun$ywTOHYdu-M0Oonf)sEDXmOT=*`}7y64t7J6ySyn?LJ$E>nxkNvwVv#
z|329IgYlv;t-mEypPAP$5%3kADVt?1F$jA#R1Rb5FkHu92~|9Byw#oG%!pCG33`Qt
zNOrF4l;=LWh7}l*XT#zuc{x)Glf@!CNVAcgtwIS0U@)<?Tycy55yL%^{3HC`s{e#t
z+mXaD2x}>TAJBheckIQIKW?-Igt0TkF$hT_04|Zg|Cw?5brW9rl8+?SWH@<)qv+Qy
zld15(_B3pv4)?JujdC3UEU$40Eg#Xspz*x~<h>}rx9NGXNhp4nt}Y9X(`B^QV;gk6
z%JCusTrOcY?9FGwa7CB|yMm0Ggx_&vRS!u1Qn~Fn00|7x73u^2P;o!LN+}~;(>_!o
z+;%yS=hkaLHvaX;-`B7&I6ma;S3JnZ$jcvY6KP64aTE`b?DWDo;sl!By^qilAO~r7
z4LZl+4>SrU2gZXi&5UzIcb_HkU9U&t@j*(>KHkZn>DqUgaJTyT&}(2uk_fwfky)fu
zI*hEt#m0PWp7P_7-G(r*4(A8}xF~2o(3gA*1`h?Jq0O9!d)d-3ruP8ZiW&=hz>IQ}
z&gD>N5TqHk7IiD=d6`<=C=N)|XeT$Z4|3V1<qEw9Tp#Oljm(00{T%vvTpryj=sH;x
zz9>245|-@CA0LH2RgdkXe^bf|yUfrDq|f6;VGVZ4zI-@9L*JB6pZ-9XC#A})g_D<!
zvaUUe$S!xi0#q|I*P=es`@Hov&}D!?NtPE0WTC7a_P<E$4`J7J1u+Q2R>H_&v;Sfj
zazV<Mvj8uJB5V~7;AenXPS7*3NR<Bj6cr=Lh0j2@1bYtaz9R|B+8g?m0sSN`)sN5X
z-N34Mh0fb`v&A)OE_2K}7{wqpO-z-v+sc$hQ@x}*ry~NK(8x(E!QM&)3n<tllI|NF
z3Y}~9oenUGtJHhV5hBP$eNZW4=DGn%`{|Rw$5#n_05-96NIe?20V<jI^)sl8-4#ij
zZ88qvZ^TuMz$rPikw)n8U?<xmh^YU?6s`2ksEz*zNueJ^A*fA*(UdSUo9+VTvN~;=
z!^Jp8Rf`RdR+@ktKwC(sSa0tWU^w!qfjnHckm&5$tz+_ZXQGyc4mgdb*uK4qPx=UD
zw5~x}GjSlpj=E^U+MR!(7N;#FOnmR~WYsGB$4j^zKor!CR3Im!KC7HoD$9&u9vw{Y
z!m441bCdi>GBCO+PwvnKiObEwLvP{o5Xpn)@fdFwBczD)(huY*NZ<O=dTF~VK1%Z=
z`);#)OHnok>pe5yH<BQ4-bcMf4wD9Ak>#8NgrFB1E&rvQ&sKXyEX-hVd@BR_3<EEp
zQ3e!H198jaKfZ%2xLvX3eORcDS|7SU!mcdIVh{x0Xi7yu?|-owCZYR%^}9eSi$SC}
zM-O=sb30z(>3I)JGXl(kWbeJeYaJ73>@N}q`v{)722#V{zK{6&n7VzU`Ps?^D`#Kt
z74l!Er0)R|hTF!91w{88wer)C96?$P&gBiq%hfJP1<h-lO$*jYM#WlQB=gzSTTP%w
zo*h`z9@HN^;F-7r+Q`RP^;r$G?a8YPTzb2TO$hd&3$#Y`R|R<MIvpTGK1qfz>~{ya
z6+=dsOrrtX#Z<kr?C0Tzr~isbMu!l3wBeUYle)f8RTJy78+Pj3Q$s}-sFABD(nS#M
zH269rr=;Lnk}uxo;MF>8$J{1dvfeF`VSU43;4$E{R4hsTEt2fqwE$i^g7)T*me^Zj
zNzP8PsgX%@$DY(b`CBBGWDNVLvOPtth%0>ow2|{{s0Y9>E~GysT4hPMsh!T?(Jl@p
zm)9#Y5m;!GhE>CxB5Xyc)b~K0SMyxzh;iN-TrudzmrrpSqI>WjJm2>)XW<U&0%!1u
z=xBc+DXuZ#mq8*mHTw>n&wM0s=+tPsQB<?rDWDYc-Mmy%+t!=zG5(lzN8FoCmy^0k
z9<VEN_b{_E)-R_|R~N|x0@??$!PZNGtA|*wAL6Z%zl5Dpw!<I@M7N}X3j5#KD|unY
zFS3AoTAK*Ma3_b8Y>|sIQNN1Q&K9XdT(PT%yB=q)^9J4YvTWZgXYFUvQMjCCvL4r8
zOFRgAr}e;G8*-o1%f&Siw4H(Cmr4o#hyHwwNr|$^rHmz5=d|<<4PhS2!R$rn0_kgj
zSC?iw3Fo>2EFC?gQp1>bT)K(?C}7$6*acp*jWoU?5Z%k_GoK(vg>g!XNu7fOWA@(w
z@!ATb@^Fy7Zil~Iq*YUD@L5FlDyhf|CYavq{xx9e>cScxkT~hM*2XCt7=i^cB0CLE
z{9Dgku<FxjilMOr?uJPl)fV$)?9<FTm>zTFsFb61otwrkjj!0GL9bdsc3%~@VZ0&V
zf(C^MQ1xRQS9Q^k9}4jFppxkyKVoBn7#Lq2h1`D#G41JW14G$(DN_uxIS?Iv+GK;l
z+9n2p_jzlf{wPlRjSNCIF9SajM9STsOh)jT4!ODuoZH-OP1+`?KEKzWNl%$2Wi7Am
z(bxpk2i=L(^HwSK5ujPWf?~Q%I76~rAm97<=V(^ItYL|SvH|?=ft7)F^LgB6V(2x8
zyg_@=k4ItBec@b)&SjVY`Cx<FBwW0_6LPlbxp4jwc1A}MgD?#3=mu<qasQ3okSr2k
zN&}fJOTb|1>6uJXAA^AGuF3)RUjd#w{&fCBbWFx(P_z!XiJqHW`9;x2^Ja9Pp5w6{
zY@VJhSHe1Js~IE-mQhVARg_`KO6u6Ac55gW(@3U%hf7jHGf<rR*ET>wZggR2V%zY#
zbeI^2($#CwNi&gDZ2LHiHu$T=7EhR@5f-Ai;yB~?fy(7&ZWz3;H5N*aG1<fpt*Q;f
zjC|?tzwT=>HQP<fwZaI7ypTG8TkgeQuaCr@*<=wv?aE4$`J_FZX>zsrSyXc}sY^e>
zm`O4Tc5I#UzmH*XFe}=#@f|L978wJw(GxV&j5Y=v96XXO*B`gDk6i?euM-rs9pTpX
ze}MvWnN#c(IH3E-R^wPAqp?BJi@Rk{U3~eX3FJ5?^JhGK4Q6YkeuttMly|xLv$*X;
zs?IlzKmpmQADoMsze_uKBTztQo@l`BpH3hv+;r6u%)j=DqM@Cho$b34JsE=Dg_VS6
z6#QkWQO?19n!Iq*<(U`STQ2lL%+&d+-a9KlJ(j84UBNERf;xGN-3_;(ri<9)rrEM4
z{)jf6T%eCppc%VUe76pIcXMDKu;f2sXOt~52*S`Ufk4&$Z|ohakiMVH20SxU$07+g
zWCajZ#(3}~yo11%Mv<#SrCH^k%P=?{;A`@nAOC>QR6a2ht1sy5$LSOU&A<D%Ole?S
z*FG-Po$S#Zz9`q%tJ$H3e0Un1N1u=rCc@PSm7I&G{9lhi<$<XrS*{46rH(5H`0VH{
zH?+y_>uzK&#^x)aB`zD@;HarfyAecW1+>HsLeXwLKYLlc0*k(4yJ3z+1lW#Pbojxq
zO7o6^m$&!HLpGZ7X?%eusFcw>fjSD0ia4*Hu1Iq%scqF61*%HDjHcV4gn?@T#3;0_
z(L*Rd=;Z!5wiD)%!>#|>+c*CR(G0uVkU5V(2l#KQe1-0ai{E#CcDu|Qw`xDmd4$wR
znOu?xQ#ir2lm_p1K%)^`3iWh1b?ne#$O;He(us>v^=#gPp8gCa(ImwXa(?fI1kr4M
zOi#d^_2L9yH1xGrXf}hW<=zoevsTs8Ip=k~J|pj0{GB}wzANq0#Tyxxmcq@y1ro9!
zm?3Qf!Xi!`OAe7H+DJIw1YSsXd^^m(Xg`mA{Ab{}OyReZ+13i*U4<TE+j$he`Ne2r
zxND)0c~Jakg~=)Dj#(NR3jwS(ZkPq~Klbe(VON49K?nkWv_XUh{{OKZ+qP<w&C(w*
zof$<b>iD|?wKSrR*(dz&7v$0Zjtr@Z6A5?A*&Spb?H|I4KoC3gw)IDp0oTu~jSa9f
zqWPRZ0c5hv)-G`N0)C~@k*5HqdRctg3ATHIS{lP3d_ke%+>iaqJ|h}gUe3X38EL6%
z-hTs1qzWfh9)@|_+XDHevIAft#l%X9c0OSVzkAn!1D#AXH8Xkut%O#9le*FI6lq<9
z*wz5WioA*<JH!Nb(x2<2ziNv43p6-4XYx}--xd|buNM+jYZ3a8D4bV2>$1X~T_crZ
z=wpB~moImF>zC7Mi!>d?BwnxYw*px_nWdZNC=B`X^eJvfM7phc-NOaYB|Gzeg#^v{
z`1mal?@)#Aez^ztpDE4V+!vZ;F9E4EXA8kO<uoJd%f0)t$KE{K3hP38Zc?HaInZW%
z@0;NQC~`x8&!L!yBQx(Z->xtz^*h-Ia~13pvlFx0lkI{MnMxp0=0h@GY?mwhZ-Aa=
zB-Jn(0&k>>mapWrJ<FkZcnr{U_0wUtu&@iDNG+1iCzMJ0vrYAz6{x3yq0JJrOyCV$
z9o(!yivT4-_Zorr?j^9%Ijh-t-!aCXs1EUu=l(BYXOv|z2*S`E%|S3w_rI|j+nUT5
z-GHaB^@#+y;R?J)2CcSZn^G`TcweW0xMyxf!^U}}>2c2mc)LQ#tA}G4lXbT(yR?TS
zh7L(n2{viTJ6}7}W(8*2HHM;1B|RJ>s$YRy@&O~iHwVZCB4PcDEWw4u@<T3pkfPsE
zgVw~4soq<)N({L`w16XMsHP06mc-(Q%Bvl>gHw#mIVtMaadq?gc|<u$DzP9N37yoD
z{f}^0L48WvUPMleY`g#A4BLZs;Ki`-8{^h~NuRoZQOoqx_3qo}x}7V63k+#u#;#?|
z^}X-*hK6biN-!<olK#$6qx!cfP^q~<F7{?M_xxL{hC<vkt2HzOdlJkoBW1q=Z;_9m
z{fjqRrw&_N|7iabVe&mM!cwmjt#-sj+vkiBskCHY@Bn|_qoK``A@JGB4sS&^+2xX7
zPe9@4FWW6475|yLWUJdCrc&I=p`3(M1`M?MC4w{AIW$_7et3lTGd^Nfq)G%vg0R`~
zV7S@y{R-+loAD2@Ndx-Xd%7Vmc{RGmS&AgT>N)KQA_DRX>R-8Npk+O671QLcviKpc
zLwvm<>#cwWfzOB-*u9wYR{5Yw<0;kr@^x)T41^%CB@_Yezp+G57QeOuCl?(=_Vsl>
zihbxlVeur3qWbpuo~hL|*5NX`Z18Uwa3f6e+sW!os3xvGHdz7Cp^nmLg=oe54d*+7
z<2b}enbqTk%n^AT@#IxPi7fWOz(ysoR#1&6a(D=M3YbJi_;0|_XU&T6TCae0@iy2n
zhg6%dcoQ(N^Q+E^DGrv(o(|kUvL96u-3Y^N?U0pk#lpqB{x_903YwXL?Gx*vbM`1%
zxl&fFmF?M=v-C~RzM6HlQ7iZgsE;ekdbbZpG9IU6nmv&qirJN?^71R!d@IVyS?ao7
z=>>QcvAl;Zq(&PS7_hn8DTl@vSZHBIL7SSbk_)8q*QLX#^c&k|0IDGE(Smm!WqKCc
zV9`Ef;5{;VR--w_K9cX#&6~2Tl-q}M^5;ZBHIc?^8wE_e)x(VCTj9`Uiwy8HJRM)p
zTy63dz7x55Ay5u%`{sLH9>YdjpBydZ(7*$?EeF^$8n4pndbS(!X2t(<G!3TwzVxR?
z8vF<)8<*DprG^S9te~36MBPpBookiHCNFVOaQ1}euuF#7ZnrP~B)U+|zT8s^d?Ldu
zd%bfWot2tK;iGcmaP2x}MPHMDMA0jbkIs*<t2=`bgkdXDpp@>v*a;^IPjP|!Jgl~+
z`FXL1eDRLOh}51D9#`&WceaY7<?UabN)M=D<9Mtub=BY~u7goLkaB2+DTi4NOqbLq
zc+QBL=kP8E-~jPHTsNDzlI7@k`ZrR2w?*=qh~x)Jg(Xfs;?I2}^c76<#alGSqEw`2
z7Sk0y2}Cx+`}LS&Z`QMhY%bHY^HH?y@J<-*8fioS02$-ytVeqnpml3EWi?Iu`V>wc
zqgTKs-E=)p)?@1&0U;`SZsnBNx=-?bIumLFwq;A3qhC)m7-4^FSsMPu{CK-iP17e+
zQR2vHc6|KDIiMs<p>0`f4YDNHIt)+hveOYj?=|^u&@OtOm?I~OdJ{&N!qs#=WF_O8
zX=Gu8%1a%-?g?ked9r>MMWejX)i&?c4|gIG#Etw2hlcg(;QAba`-F{7Uco_xR~nOC
zU^*o=H3O@^cDzpaDd<j-kYz)Huz05a*0gQ4k3Iz;<GmRuk#<~d)<mx@Ks+%=KJ8^(
zOH|B}HYJ!kD5@Dq@!Enx*a3bdK8|8+`*txBCp;T$NW^2DZOt?JftO&NoJt)lH%g-?
zHN&g?Q2BQ3vP7N+S2d%u>DPsD{|LLHEQvu7b|nRgc(pzKj#Ewg#ay7TwTeJUa;7rf
zR=tcNfz82^;E{d*yUH&06U6ayl?0KE2ixoIgbUStR%~dlAn3ERsqQ6gh6~kfMal_<
zr*6_>ne|F8UKKML;6B;7OuS|pT+pS)m!aay7n`B0{s_@(Ml2%gxL#)C^r4CeP+vT6
zVf5`%G-l&g%lD$Yn#x8N0`gcTe)iL<*%*-cSp<{<4w)_bEJ0Ls?nnex?Cet2*0&!x
z$_KE}eq3PAw9YyaGB<8y^`Dqh(u<dV2ktw>4<ZD*q;o?tc6d@Os@Hlj=r8Qh$j~26
z`f1Bc{1W!EZx8Ch*wv)z`>>Rm2c&)mW*)oJzP={A+AQxHm^_onP}*kaoSkoVsSY7E
z_Hv~=&8NP1R(&Rnjh{A>Nu<Ty(VG@pM`=Mdi8&;3d56Y#yP>?YA*d!CI#uhY!uz+D
zV^1(%*^OWi9!0ogpwP?O4o2WGiH2{uaWan$&w3%(Yx1415Z5tjV-#NY*5OT|fg;9c
zB7m+MEP_)Ta&jVao7hSmGFk~7Lh5JfqSs?)N(_3|AMvvAni6yAVwOj35Cf^7J-%xv
zZ-AUAW<41Ssh>T})ANMvT!)eUpRhAZju-}E=#{Vy818?umf1wwpQ;yNympcWBR%A6
zNn4HW*hHo}BG`ZXfL6@`oN>ymz^^dPQqIGhA9P9vFclC3`YpW=NFtXtQsH~aC;tdW
z{*K__IUh(O&-C;$RM&JHHXXqGy9$;Pui9S&gXB(fOidPzF$HMWoUH!P(^=C&OGrSa
zI{<!JmZYQ9?zM?=>leE<>O}o+I-f}lgPr**0gL+4w;t&%Y%XPJz5{}t(B#&9J2rbX
z#kBr;B0_1YOFBj;EtF?76~r#rV0sP6BNwR70}l(f?^+6WGMGn(7pZ=Qv&hg15D{o~
zS=bzN4zWski<UIke7+UWzvgY8g_bL4K=QLU$%3Co%p>4hTStJ#!uR5k<aaRdM9`^d
z1c#$E8+eDE)LyPP5{B4=&ebTj4~{|_<uhPD{7vqmFSTtzM}$j4Q3fdE$5~XogzpJp
zp_kBvxfD8xwHx1t4(Sg{PN}Khh>-7K;E7<aBP@amPtxqw0BD@61CYoE6`VhM*(ZX@
zi{(r{j$P!Yaxh#UDKAap&+5zJZRerkjpj(2dosU}rGaN5Y-1NbcZDKCQVVF`X(X=K
zExCpt!p;T9VGstQR{~><egBJ9PQZiIYI*_GO}eS$`MjSez^7YyJWb+YnZI6SEjgin
zwBeP>YNlE~>7UsJYE9F=U{t|%lt#mchVnBXdg1YK0I#pGb%8grgBt=*r3&@y*t!}b
zN8L+zbuf>p^kxeUk)r{Jp@=09zLB+scAq|KoQ}X>@uGIg3A5U<d(ELp+UF(VGvK<a
zrXcLgL@Tp%Dc6vzX#wk$73wh8{f&QyT8_`TuE|9%XDGiD0jwJ|0{2;MC`<X?X3I6H
z@|}{(@jyyy`4mdCtacbRsh*EIL6#I!*SHXCTdv8mZ|zsiR3n>Ig~gcsRvbo621x~d
zp&E!_^14rRMa6bQx@Q4z?7^Q;UcPaQR;C~Cg3w&!&qy~QyCI#m6J|}r1;-nkmw>2K
zDh1FF^yuL=^AXU|q8q64c+0`}8cz5y?WnL&gzashtuvhZT`aKsQ9R<bUwK+;4z(y;
zb_)a`+rhd$Bq{!$i)@W_Odcwr?SxXSo1Jh?<QBEYuQ9Do=p24&N3PK=WADbN^G1-H
z?*8XGRO!?!^zDDm-Q<xrc3u;1hg6fs>QPM|Zw_~NDsv2%1xi%}EU{JJ=`5rDUh;nk
zyB1>!LJ-!H_yhZI>^)o{dvi0n2Ao|*MG}&a5g=jlx+}``(eI7@V=+M+S5Wv@ws_w{
z4n1cz@EW&=KJb>?SrNV7STqaNz-#U;CpD8ZPX|BycqvZ<ukkS4AG$0>!7^S`)m8}N
z$S3B|fGyG;gz}%X6*cmdbk<HAg6q@EKVa1dWFzUNPg#jZokMq(Ht^5}dMM|@FU)3q
zDG`wAK;?U}rqK!In=b?ca^j3#=rC$L9<@Q%d7=CymYOPVLQnUlN+H^FqqAnev0$!T
zuL5SIfO%eBZ`X30hJqBJZRu*^m*h_AS5FS<>rMqk-4`T2_o!z3M|_=(fcp3{Bo3#S
zZh}qz6Y$>5+s<2LX6#Cb_%|&TsFZ{I?yDs6x<w+Y*Ta;L0Aggy+bp-Cw^S_ckHiES
z0TLE!Whn7X>f@cH{DG))zEtDai?Hm)cB9~%cIfh@C9RuUbjfd!A0{W->!CeI2nAg)
zg(#`I=p^rX(_Sx|K4)nOxAgCH9d=GVQUEq;twh9zMe5-V@Lb_W0ohn~le!F9lE*#J
zgfd067lf#(F5?(t7Ra6Kuzt)#$*OFLL(*Y~;DE`05@>@@gTmHqR!H_ZWW{}ZXdbHQ
zty#?u<}qqdZth0A5B~@|w=0H07>2F{#>TM!Vy#J#`lT+w33(8(<g1>>ECz7QiYM0L
zdEOyQ(>Z92v;_q*Z_T2gGLXE6!Gt+$Kv3+vPL~BfWV2WfBM0|7uu2J^h<bUrCt`%b
zOp3evInlhx#hrha*}+m|ZgfC~O~{xYk~Nf+Y|zen+9vNDa!WjRQm{$KP1v`QwATZY
zKHH>Tvrx+X{we&9P)L2(H-X@(r0sggi-zfS{0;peHY>X9m7fb@?$QyU=~yAnH(*Ck
zzsloW>RpyB(mN-?cL5Z#8o{LVJDrJMvCyPsckfc}^XPgO<A+Xzifnt?4R-T)!~jrh
z;x6+i!|8?2AJ>okrpQ6d!BC858!ohm<0D3x{HB~h;)Ya>r{_itklX?KPe1NUinNoD
zDnBX59`bvhplj#?Sgpt;rmtbsjE5s`&yD!?7E)EufCsH1!l|Hm0dqlU_*MqV&dFo;
z)ARmDzz@B1VRwy3V+rjoMOKcz4nfGP)ErfSP3mS4_RURC0xmRbOtR_-{cfc_$rmzU
z)a_s_mLDJ|^=Q31#bhcOal8xutx9m$Z)89{95=$Vj<^)8Ml?N%MYr)l4wbdt38(pU
z8z3GU@ex>~Pu{lPN>5lU{6pBa9We~Tu$6!Wg!f;pbpjG!$^yQWOR;0U_*qob7Q5*Y
z>^>F3YTl7~@d2mI0mI|CP*_dt<*+P}@xtZflOS=;YwoxNxwXhJ-Mivp9N3}2$D)Ir
z{`++3f|O|$XO0&q@dbvI5RJRgEpkez#^=9d93c#cyt^Kc@G;5@s%a$Pr&<iE;8VjP
ztfrE6low<daOZ{k02_9JqO^h;^eG;++$kI`Xt$u2*2S{*Zvxn^5v2-6#t;O1`wEJe
z3y7Cc1rU_x|JKT>QTF81qp88f^>GRuA3?fw@_ai1f;YIuR2Z_$99)=?otg@l@VC6M
zntFIo%-G&rDW<TR5@3oce3Q4-2n5dzBeL%_Xg6M?b6Zj4x|Ck&w_h8qNil`?9eo=%
z<ug<ZA7aYf8C$WI5W_|Liu>bNOumz)K-?*I-1v7~zj~6mCZg&j4-1Vko3C)ovs36_
z-1-&MyXs+sHTgxMgKUi`$9qwj0-PZ`)F@s$(}Ea=-*-q`Q|YXH?zR8T(-VFmtcFfS
zPqS*IOv95qv3=0~<I~PgdN#t1qFj6o9t*2^4BQU!;8Fo(fse6aVKsR-$KC?sN7%Jx
zI}C!r9o-{}id*aIZ-_GZHCaHZNgE@~>nOi|$BOf#LQT5zz|lo}z#Oh4<G0~pH4b8n
zV!U4<>wWWP>2noWjlWd}Zls2{pZ~u($#n)+;}Ap2dvs)lsl3e&u;!@{cH=H-uGef_
zDdBk@u*T0TniZrRY0R5FLQPy}SfK@%VpnKD-d-jb?e!N-RjkJ@>7%d|2J<vi3#_Ji
zFiA&&o>sOh^Z;cAT86Ne@dEMnJH?QE8mw_y(Oyoc%eIJ|o*XN(0wKd{>8iKd@pP%~
zXU3PHR~&10mmMoGo?&GvtkG6r1frqSsxI!N8?2Sf+S$Oh5u_)%0n^7_NQWQ1CLF|#
ztML0vXVR8HO)D4Gc&4&hd2?ui)I6`GJj>UWqT-Kfhshn{o;=}RVE(XA%cKH&ni0;-
zufjMk!t-1^Uqgl+LJQl2BI4rSNre<9I71GLh`#DOWvoD-PE}|H(0!0%<xtVW0I(Z>
zrV^*w&gbC@(=dG#ZhB=0r}2Z2jr6RVNw4jL?+SwWB#r1I-)gTMtB*OV9h}B1%*%h`
zB8@Nm_$f1t!7_EHw4UyUywA6aBcw@60Cup#an!4nyJhvt2dN{ag974Ik;N+@ALNz*
zC@f_4@1L+MJC+~>ff>CL1%><*d&{`c^VORG<(z_jIoESIa2nUs2g0M|7?}XdDZY-#
z8tq)P_`4|7tuTddmX64pVHN(9tflXGD4r>6^o;^eBb|&}a+>SC6&(3<05vDP?IWZh
z)F;t_Uj*nrTf2ab-AgbIS2?6LpZ4vY{nIXL+%40A(~Pyi@wHYceY#ZoC|4gt&I3ET
zZSs-_@mG4i=4|ar-(WK&+`qzCGjt>1IvP7Ra=R(R#DUUyIlv~Nu`K-4^<DXH2M@I4
z+B}(|h@_odi0Z4cY)AOe9O$F(^hXNxl)d`&EFDaW6Ohini!Y(4?AY4UYOVJ1v4r3S
zIv>RPFD>xb$>ngKvBLyS50>C!-H0!K=;GSS!#LW3HM=~_9(EpmouI0j2Pt`0K9|oY
zF1$j|*jLqYzw1zag)Gy56JQ#Bo97oRArHSeFVun4?DlR=PJ!V-c>JgUq1Ohh(*sKw
z!3!L06W-(uEAxpwN;7Kz<-lonS=-!r;_7|Uq?<p9fDCnY_jI?dXALqq+T;csU9J8r
z^Vz<jU1n18NG~^e@&8X%*r+hCjT5N=(zp~cA}w{k1HttKp?4CRniIH_ajXa;Ly)rk
zPuR5`F$}`6m59Nw{TFLZvBgKvS%6E@LKI1s{;vQOX;h^-;^&BrVZImegBY}*=5l_E
zjN9}GBJln$>WHL_&<Mj2pPgxu4A(;!){7G^lL}4Gu%tMF`u~Gn(~DJ{=yG^O-xY}M
zIn6LvB*D)E&4;1L&o&Rv1T}MuYXzdClY9X=OY0vqfw>~RTfB`WT8g~2vlJ!-jX+QX
z5A-D768v_})u>gw?vg}sJHx%*SOOwanbD3*_{#0ym>8@XM2?bSy_DpB0Sq1zQmcN|
z#+jtsx)DwEnzXO@36nDcuq%{$wm@z}WC`jkZz2THJ`cqN9qxj554uFyB|ZAN25S^G
zn9Go)tE=_EnHG%v?!^)?d1=*wy7XvV2{9Z69L9qlD3$&nt)*tKN&<=6ZLUfOd$?Z#
z4Ix}m_<2@cg7*ZT9kC`9!yFa+CHoQZQ-4Gru_heNnM|_@`BmxA-oJA*1ud#xQ2xj=
z3PsMo#>p}TZO0<QDotGd9_%mA(Q^f+Gi)|P6Fx(GJ6f&>^ftgLTLm0)D#_bp(4VoX
z)kN}KQK@d(X0<uZc2`+B#^+e@d(*6&ptnny`5072bs-FWK*sjr_XerPlXnScDHrwg
z_Y3#K*R>rn48pLDdgfuU_g}1qg2a~wfFqX#u=RSzJ5dty0IeVE`(K3{E<w}?1cdx*
zvqxC%&a^(Mq>YQzoXqiq=tK2ajv<$rAUMJ3Pt%1<&_GSl1T8KjbLU76ct4CG>1UB>
z{FoJ#htySX4XE586OA7?_A=8Zgse>)eMi#40-C!;R3;uir~V+54i+Qm`e{x`USA?F
zP?PjP+j((=!a)t8#szBf15cJE6muB4dFWf{#c9@NjH0GF9wDb5jvxjLL;ub0HMsSY
zMj&QDOtIa9VrPSNdd6$GE9ijsSDT(PeLfmeofVU2Y$|7eG&y(=e|4&u0gds%i>RwY
z4frY#sb)!|Z>c>$Rb!l1FH)(N#y(^=($8*&`3{KF6M!yWz)M~2!0Q>hX{Guh0M*n<
z7qxJs{8A%sX$U>658@Ub=Zp`z!{$M1c6{g|SF}xREXW9!^=TfUW;bfMfEGOIx*VPe
zue8Hz-H2Z#&pCPPN$P3l4d7h2xKrad)1DQ{n3@@ksp;T`EY}P9Ef<tBt<t8TULDG^
ziwN0sN~Y9!R)$%0a_2Pmn}rR?31Tn!42$@ty|J^vYRY>&4!jNjLNBJ5fLi8D*qI$c
z48kz9B`~M^Z)}&t5?@LKo=gG+TlUi_-Q4nF<YOBF_YvXsU_b;qqBUKt@l2;fqe26X
zXFGXi{Ur%>o*6l%jcf0c>sq7oNHCm?DfdBDpd&fYx}xre<#>#~j{-fX;nI~{=7er+
z@`=&Y-98ZDv9b1qd=JJZpX84%+lc<=k)(j^6ljjWVHlGn3JX5<Bhc%xca+q-lRuL5
zz0HluHMkk;o@5|KeArg{6=?Qo9g=_)qs$8~m}R-hjg8^~n%ZTvyQ>zsLEDPBVMQJp
z<gO?4L7Jar(Kr<vGc3p!i(yr2v^3#`D84!|`Y<1o-mwxC5gr?_1|(t11u(x;;ujHM
znEgK*piPV#1h+L@FHhJ9eKyG<K3Kh5qtFaFFR%rv)(dYejzq%K)Db$3MXb`SIx~?d
z`Yj-p8BZ1vT<Z;?`v`zk=6~ShS9fN#?h~}3-y?e}dVB0Y=~(nZuJuQu$&*4=0kJ~6
zf_UYmp(lE$58_fkz-eA-y;+|xSvw+h(|hU)G)pRNw?AfG)n>*#xaFZE01ps;w!3F7
z`a1qU8a+YcwXyS#y?Z4lfVbJA4uFf}=+Tb4PL`*>ko5suadUKzw5RGn!mjMdVGxS7
z1ekaA-`EBlB)+r-gkdsZKqtEO@}Fk}`I&x<hU?2R*~9u<&~i(WpP6-tuH5-PAHdLc
zg=rZ+kCyj=ed@N`-r`~e<W+>RLTmU{)}v>D<!C2@<>lZH^0<T+U5|jYioio=nQwPa
z=+bnCUQLIcSy11#t=oXo{7H#%l+pNVNw1_G(VEY$fA7?RUiLVM-drbimZ1-%s-uK;
zwu!im7Sg9!maH2pK<Rxr+(_S*PK;1|54MMfC`bRoG=0dBnR$wNW$l;*-*^K3sAWYB
z7|VrLB?At^^jh%i`WVGpySgG0q&%mb*#Ny?(&hw^oi_Cxt|Hh60K?3aF0h<oQukJl
z_4s9>@3XQcgKV^=y-3b{NxYi^_XD54`80YCR{=u<VixnH$gC0c6xfwLu1q0ELc;Ii
zC%>>xt`IA7-KYmF%qe-53UnOyNj*g!hU#fsAu2}bY=9UT;p=@o#i4phlbLy10rd+z
z){CWW)!Ql_0<b+OGT*Gm(#@G<8!M17HEI|GGZM^7*C|&;BaLMcW|&ZCx76oMI8)w<
z5}<kg4SJHPwH0wCV=~of%%noR^dHG+0CzrU+J^1??S1?s?8>qn2tnYL5OLvXbNgwG
z6#ep1IY3C#EvQfn&54B-DJcjPL%V)KLQ%GUB*jLJG^q$9c~x<>>^v`bL42APl3>mh
z?FfM>9s$iqlL>KgOPL7$VNB<{tg=-~oIF`oakk}+Y~Sekcpjsl2q1r~z%uYlehp_d
z?YfWo<W22%gbMg?D7kwKXJ*{j7eJI;&&PLhv4I~9Zc;M)&!gl|5=|dB!J4+0UTjn0
z@AAd$DlalOVE5FixPaGirt~$RukC0=59dWTXEX6GU!V6@y>OZl4hg<xWjHQrt8#qN
z_?5_ejqn><XQnCh?$@uHL@4Q$;W#xk*z|Z9{m`{g1~op4deP)cr^Ic5ON6>(J&IQA
z%yPffW9Go0Br2r5u<re0AwvH}`EvAfUr5Q?NK3gr$RnA_%e?!y!Sk_;yioU0Fd1ya
zRT0$3wQIaHcFG7o8!@$_{c!m%lL%bL6>xjQ36Qn_o&Z|>k=uF;HK1|t$5AgRUjGAI
zy%VP5O$={oq~S*EqsnVGqYL<=weBv_(%qLtC>o7BAmTO#>Z8)hh>F0s{ZrZh^5lv!
znNcvRih#B-OQvhW^D-#fKLUWYFlXs|`pZ(TYv+Fg<<Z97s)8muz*<%RYBc;4b|p3v
z!yvFF4Dr{0V;2%&td(w3z@o%i8w2zF1OSW13=Nxc@I9$n(W|c<1@b<Og7&!J+CKRs
zXcmVh=jiXy47g%?|GOg;$#BDFai!{rSC`ZpS*2A+y!8@iZ{@n~hV-o4qH>til$^E$
z2cviAJtvyzUiGCY(XWGXnu+RZ(0{x{LBywFTdthiKCH`+2&F21f0R<#k}0XUwuI`e
zs$fR5lGyKxYq_bK1QYoG2v9p4+e#8?X|f)?!rDB-QDpB6#-FJzwI5V3jQ|0@5)HYF
zwDjh4Z)2+Zc1JKo*oE7(R1tKR-)!_Bbr{qXePjggGQ8B}qWcPJXRQH2xm&D*K6=*l
zYijA-zeLqEHA%^i>3Ni|<SYf_Ir{-ismqTven2T`uUc@kbX@YM**x26wS8<UR8l2|
z6W)qbx-pLt%|OOB?IlopS2uJKFr#@9#tAC{_qS92u}aKnyeDDf&~KULs&c8)BQj<*
z4$kQlz?7zNRryF(F{JUnhIXvOrNsr}Dm1TgZq&$%eur9&NL((BI+~~$yxYgd{c9zx
z*e~Y%5m3_PJ=obFK_6*8s^F={Kzz-l@96CO`J(g_6+2o!+X`qul7f9_TjggHCNw)Q
zZ!MT)Z*AHay)yg}c12eZgCJ}rQ9xboroW>V;#Y2gK3lC~5|RdrX02U8Y9r+c5x7hh
zoV{H=G&&Vk@S*E|yTwb^lP6pS<Y5Lvx;V0jCZs~V3RZ<VXsa>2z8Np|+GvPbZ(1D-
z?pk;BmPAvm1!_Uqn_kK7THNcfgJSkTPK-|`^1H6Iq%|F)2;<wE7A`(Fa%G0DiVGK`
zCzWmhSEKMd%YM%%4ufwDXrhrDNF8aW9WTe11Da?oz4k-PT&}$u$+~<DQ2EGm<nfxo
zdbrc?U>E2EclMEV*W=hFd<+16Dzf~^zpbfI<ChvU<Z!@$@9m`jBs|UE;)2BmA=6So
zsIJb3fR=>;Kv?A{QKL0{4!Xrz<z%}HESRnEV3)~<u&ZWB2bssx9X|yRpy<sTpsy)V
z>A)7V|5=faBiqKEd0x#Udp7zONz_DE!YIh)cgZRpr~bL<dmY)^K-9dRq?zc;D?o?M
zeI<u3Xei_OZbH}7A!_1pd@=zK51l>j&m8glp+f@MR~f*(rum16Hoj5&6$S$RTo!N<
z5Z(A!fdAfvG`goxeh`tp^C#?zku4Quq*k<2zX`t%On6n4w|bbBXeAc7@%n8R>a#cc
zF4n!tPL6jRqUOuk8C^>Zf<Uw-B#O{~V=p9O#xM3Y;EC=g2n=(xJKz&najmiZhYZ&z
zxf=>`S#iACbnx@G7^|}9k(yOzW(7;SL+;e*H$mZ<4-}5fzS>m=?YP>vY9pud%jtar
z)3rq0N`DN%66+Kkq}2$_PrnP54J@(x#c?K&!>yvf1@0jJRM2jME>}}l*XLDEpL=*2
zCYt(d4<wejwXak0apbtD?XOS#rm1&nPr)Irur+9SyN$MQ+JB{;AP`ddqB{CnjQe#6
zM<<)YGgCXDF41pdaRi2^VBwH`c{?(oQhl1dy)Hlxe9@G0x%Io)$nC^oDj9>M$k&Fx
zSpj1Umkd(ZFQ#^Lwr`amc*B8Bm~%RA_D?`C4O$#o&iy1V!xMJd{tyMG$-65BrL*LB
z$)xCu9l?NIxTYt}pwqO+Y$JZPX(SWM$^UZ|V^iGG-yqqhF-V0xO^CHBSG$#(-z%_9
z11rUJLjMc^AJ33JB?+<(BS@2zps}Vz{|t=R2b(Z1D0{6nm%10==W#Jm+4WBpoJxS*
z^~&^LZLpi7AiUaQ>?otNWT7Y=<HXAu>d`mPc7=gSOZl##`3I<u+go0?b_HcG{s1Oa
zyiTxe>jrtRaPVK@FZxH=l^shA!my6sAe+PV-`Imqkoa;6SZ3HHV9PrGo^0BuKZSd~
zi>iiXk~4KK{EZ-{yb426)@C=_w33prR*06i6F3r@^{d0n^&e=&!lwrEO;Ge&!)PEF
z2m0FYW*_;Zh|`f&?_D`;jdgTHdOkvKXVr?S0Cdw`m%mV8m%R=YF>5jJY{7g5cG(@O
zI_fA_GGHc%GDu7FNDSU#e6L*vV9i%h=0dy>;4UZodtGAZSEZdkG^&{g!rPz4eBs!&
zf~O8w2F+@$S6cXu%UPh!{Ap@dQ_ASl)HimAC?8K#G1;R*lzHX}TRw0CLP8Wm${vbU
z{@8(1X%1s*qaD+D#x_rHJ6I7Ade!nc^pg3J6<{#B0(2Xa4UpDa{vz@Pj1$}w9rpVa
zL-e<l3%OQMC=He5n>f}a!mepYgKJFFq&YP*LPw6vLrR)*#;4nHf09vPmP*kLQqruN
zfp(DIO{Q_Rq#uNaG?R`-*bty7_oe6mBQc-q;n#eEtpC)0*<i$cCTph+YY&!hktU%S
z{EB}S0%##(tfltL28Vp>tZN!C&VAIhgoLCtqXeg)?Norj(4e%Zf)g08rgq{nWO-F2
zAD6!Kg<Q=O83B(m{@%quVOL-yF$}_13Ly#U{)>HSgI(!g{s9j4+K7NLb|wt@DLAEh
z4WbUJJqE69w|^pVx67%#ayN-68~T!vjnS26^o<kQn$e$8E+BWK+L;HZc5N4MmCHd*
zrbxQdTs+dg8v=wJeHu+^_GtDIuB*Cb>B5I|nzl|qlG-CBcDoXr-Z}z!kVe9L#Gd5U
z>fifEt_{L3v8gFAmkuyK)!#4Eu!pWAKjNS_Hr>6)m%1m>BBRP#AT5m}TynC?(6!^B
zq||cwu*7!sbS@2+?g$vrbnNctwk<{7r|Z1LHJTlirtf9)lpUhfP431C&9zAKxr+rO
zNTDyv$)O>v+IzB-KwG=?Y{R%n)AsinY6IC$+btq^T{3ghPuXh2?(xx(h`OB#&9fj$
zIJ^j3iS}%now-I+V0hZc^)iWS_hk|KHIn30^g+wBIV-@M`a}TEuh#^F@%6eq5&WMB
z=w+_xu!gi6z4`;d=s$7QTl76~PdbQm*|5q6-_Cp{DYfl_2&17JN<~f`0MKI_e1yA(
zL%HA)Iszy@(;LmXBOvvm>ppJLG$-*c9GT@6G!g*@w>|sEk=pScVud`73((_hwsA5`
zts^Dm^#|VcL)aA^OAdpumW+vQ=)bWGdyC}vqiw*GaS}ivq(3LXjb>ff7?Zn}Q|i1;
z+vtV+a-8rqD6M)>Mg`7hRy^cTHkGuRE~(KRXESq+d9g52d+r~%(8HM`rXOlz1@`mY
z^tW*EHO>sma#?`Jc{It%4l?yw3#^jd?Tz_{DA`Lln$bM1l3Rp|4X4vLLP#=$9Re8;
z399Y$P1Y}-8(TN54x;0*#0hVZ$?oC0CQ8}4_+~dMb*>AH9~XHQj#T?tPtqdl=n9-m
zH1kvWf2Xd|kgn=yIUh1E(WFz%3AB)kn?I09z&~!=C4>Z#+VkIVKpcSa^<x~9c^4h_
z@vD&65QH+eDd1?$uc`Pr^fNe%H`{bKqNdf*Pe8A(n;X+VMV)mtDh<*p++p`MdvZK$
z5~^_st!U1r?)skA>aOWS1KVH$x#-umKm(ZH&Vx81x&gWXr9fK0{mYdq3M3p<%ENx@
z&nan@IwA4zJ#Ku91~*C3Hcn@jxAb#myU~oVqEN|qk;ZqCc!t%Jwo2Yx7Y)5fQ>*+5
z24k9`eHmlPGPu2HqEZ}E?lPxundY`wf&+<C{9|aeCl$sts!U2ZKbN<6_Wnl!4V`k6
z(#`O<EI<(m4nyUue}tXUk;EVjLwmUjupk)vZ|p)6B<4PJ4R{zf3pTc%eqKG<Hzbrw
zJt_xmo^r`vy26}YQ1cl3zqzPP;qxzH&h8|IO`>a?nAA11Z@&i=JwVb(W$Ee*g$JYA
zokURsI|j$CUeYI3$bJnvB{v28!JNq@{WaAv5jf<Nw2fU&k(~g=ms6Ms#O_6eNIID;
z?&|D*A5_*{hfik?o|9=^!+;{KA>SaE61}tS*!++W3g^x+C)a>>h1O7g1a=Jv0WNDi
zVsnue!6E!U$O0sb+OKS$KINJH9=;~cW7_e}`8-e}ses=L-9(53_$HsIHh9`Mf5ISG
z+01P`_WI(~J(n>p_wJ4$LclDdQReq5j#V?;jg0oU%zbFD$zK8;eg!fB85J^99-I{a
zcOOX;uX$3mvG1GvoUpehPC1Qc%?H|^w9XOTui+rvt4TBZenMQW^x`*Cdh8N;P_lyZ
z2j5=+m`cv`vJkheSojFAJ!$%yp5yCNf~9)+qX7b_Oo$Pi5`bX(1<3Vvc6l0-!g&9}
z7Lx!Ryff+!wy*hT?mcYw0(EIRwrA?nJ``#$-*&Qz(3Q;|5r`aK1xxc0RN55X+GFRU
zkCI~e2<v<NCG6Ug7zAP9l^`$R{ugUevddRIfSJK+OtY`!us;xYH5!o9m)2JlSX>AP
zr1_F2+I#y{PQ!9Qntk`Lkj?yuxH(7K%OfZv4M&a*n+CZu21QTHDk?yZow|XC(ArU8
z)-7K3GC#pUKYLmd`A0gXh=O!BrqfT|Y2eqiekIg-hJXaP30A3PzLJQ-NBm_Syw`VS
z7R)O%Dk^|e5hh^RtmPn@k68~L6w(+5pS{6th-{S_@e{q`k(9)_Xf%cIb#Eg?^U9|V
z6JSjkBl)bKN278<<l+(p^8{<fq!^V8VC;{RCv+-!{aYCJ;?slCK;4v~(j`<ShP`+Q
zdQ&%MAxF(sk}HsA3MT1h6FkZlABW&(+y~M>k|*?7-qxcyk(vx^*l1bCb^Tj^kGe4&
zpytWApXB%uFSL*AA;lg-^JsU4MlZB}Ege=BYM1qMV@~`kcX;A(^NGd+ukF-%r=(<2
ziVKtGFOHBa(W+6-JPtFTVRV{k87H`bg1+jzU}$bLg3T$vl>evkqqQVV)AlkHjEL3^
zoZRRi6~M_23%bT-s?S4BDG5HpESeW<IM``MU2OqLd{iKU9gUv}gopS6Oo|FXu+5Y4
zZ$HA$>^6cJhM^q=mTVpFzp-QnW71zt1IA*Y^&ydbAM*2Su7@-sd*VHl-8d-fB-^k2
zk=PCQZ&34wdu5P<JV1=~D!DP_mEVk}GJ=c!^(M)^iIbYOC$Wr8gIjF<qDo3CoQ|fj
z1#AA2L>~7<MeemAgRD3jooCo13o==dn{(^{MQ^xt;doMSwjKKFJj#^6EAT4QD>VIa
zPVCu6-bUHb3(&IAXvWsDTRtrU-9mJ7Xre}NP*Z5O^gpFgQ25x+i}8742>U<JgO@X$
zig<KrykCdDKJSZ0Y)j*l?#wvGXXF$su;EiX*mN4u&F$FwJ1{L58Pw}(RpG#&txuY|
z$RDs7jzbooFDF}n2BhU?#JW<|?GkzGpU@P<PN<t_Hw61Om;R8O+Pz#f@+5<F^rfYl
zzh{NNwH*-6tJZ3{$v4~LZ8)*L9piy*a(d|uJ8QTE=Qn}-@aU;qC5;Dmfk*hrqnvp3
zsq2X(n)Y?o^o2*4FhF;XYNiEf53x>G#p7X>11qPE=I>?5X09<GwDkS00sk<_Q773*
z^LXXN3M6b!jLb%ShvgI5wsZ@#QIJ*h0#2OQ#KXywDjVmZX4t@sW<=xS@=MsYWjhRl
zz%2=4l&#&>-(bRwKP4OBG}g4hysnZmrHRw*d?zXuY0PP5CeU2~9pp%E$F>@4$ojf!
zFkHRUUf^P0LSGP;>DOn#eSA8NgbtH{7+bHBr>=x)+?f3~J=x7O)&zA0a>SD?6#v;h
zP4=U8syiQNO8Wt_%#0_G3T@UW$rjS6C%=+at8qJ9UBMZM2#m$kuQoJ(tNelMjphJG
zjHQk2Vnd8jewn=;$RQ;pQ_@Oji$S!kpt*H=T<Bgny$OuE9(7Am0n)Ce!suH!2Cmvi
z1&-K8^m57qk<ew;=P;llhLMfEa+1G;3RhIPvKe3g3Za9Wk~{G|S@rrUkhyS=wTB$s
zxqfR}-v{K!^+8|qk%5LAfAjh&Xu+4x=KIxTIQWCE|E?hP;FC$sW@d)PjVg1d?g~O;
z>v5@Hj)+ENLj76@`ba}uS6C<uG)c485O*qRL<yi8qzeHq)E7zsW}6<2`7~sVy{gs)
z=ux^T8$CpJl~2ERA-MwBL<Ejacspr1-}V=w*`6y7SESLB5wNq;XITO1NVc#H7MmCi
zKis9dARoz_)1S&5qhb4aA(%;H*8sI*t+Yby;U-cZgEDiWrCu^NSB?s%1j7FbyS5|<
zVGwqumH@5yzt~!}i61+70cKoT3(f0q1)bR`33A&&)nZzgF--<#(zH$QxKh-fE0>ke
zIm`VL##`}wD}7#ODAaM*@GXqm*UWbe$q;iZ%KZ@ba!(nYLT&3t&$$6LWgY@)Mw183
z*c9WlLK(neFzLFcNbecW;itwYVC=}-gX95_4<iIUdwH3Qt)yuWfd6>uY=Q}{NaeDC
z@`p2}-f+AE=)A5#?dx=@st(G@W8uH$KO1aFT6SEvMyk+I@~!}7Vt09zhRoS(XH6ia
zAF-4(fH9244fTs)JI-UO!uB{_EN3sN+5r8fNN`z`^uC0g-@QO#7u7_UMo&3@H(j8p
z@N)Ap1yk;?(;7fN&Ppd}cn%#y%>Y)gS<d2cnx~AB%zK3yt<}#(qx`lAr3w0NtW96q
z{`?prC8m+;bZI1?J-uIa#`<><t0G+J>mWulEUkWukYh(EI?OtKE$<Z1qC(2JH|8sq
z+vKfT_k(k*>C~dEK#jpjmm2PZYs+pOVy6ga`9ON$itS1<WR7%2VtWbuA$Vx_?A(h2
zlCF+kw?oiX9Q(LifaQ*xTK7<`RJb7+K|Jt^ISSCvXZ(vh{SkIX*A9a)3|%Q8FlPV7
zUYv(5zSIRcX`6zv<g0rHuziKgno(}+uGw*z*DN*$Wj|`T&!ZQ(bVHD0GuSJT;l1wy
zMp|rckzXcY%l8pOA2k$e-ZQBa;+FzLNFUM^idl|vzvt|HQ*Ihle+nAUoL8FWL~CM8
zYX`1qni@m4sA9@a*)*X5Mmj(u8KZh#++_7hVGLbx_V;_TOM<xIvXcp`*Kw}SvSD(N
zc|&$9V1pdNSq_(xJnhyZut5HnDbyfBrU>h=6t}R4$j&&DcNUqP(;5BsR5*_Rs6wr<
z;{PFvXQrk?u|r1Gd#sUj-}hy%W!C1<S2JVVr)S6H{VS#C>Pvo*EnzI;Dw5P1cz|gH
z`Yg#{!Qu<~U=q}Ij{R^EjvvoZR-a1tj=--)vryNr1S}A3Ih{9LlF7F&z!r<h)$5md
z<|+(~>+yb&ct#*&1YwUFg+`ZCk4UX%y!#?Y)eK%S#!JiLAo0x7y!H(^@uIDRW!@Fa
zocn(hIkWYi&oF-kfpi?PCTg{()xBmW;Awn;q4Ik;YE4|H#wv5JmC9k-&Ixaf|01t!
zWpLJK#+3b79Ia;fnch8>Y{FV2C|-|~z$@Eu<6KI<AnRTvnyo!g_#^DvjwA+QSW7mT
zVES+D);W;)xYHJ}o=n2xhh&LZO&j!|&Dl5;p1RM@tFbW*B7ecQ4Yj2HmI-pM8OCP`
zS#hg$r(eU>X1iYiCfAXtP8D>f>GP5Sd>j$R{PH51v@wVLqzxK*r0aTq@rqnT4?oQ!
z@}1|G2;lqpGpHlj4%$<fth}BMSW_2SptXt&1jr!)@xCCzH)xNTW|zr&=trQrA!Nl%
zcQ*&MLv+Sn7>vi+Vy()hQy_Giz8TiT|3n}{JNhN9_TzPDMXYAD$I0p3!}(SUdb)~S
z;6o;ugr!=140g&aQ}<@XY9iRHuY*RHT~C*lN6?&RMP8tMLp|?ZR*^xlW_VyBX0CH0
z>v`mn47>O~j^^x_g1xm0q^({H1L0>qL{Y8pZ1u7_<?n;*QD;>xt3AAwjY0-M5!omG
zwZ|d&7JJNw{t)n{X^ZY(mVvFH?sA7Cj4AshyNVFNfv0u-2+*x~ARbp9$WGM>?O+iG
zer}IHY^&lJfc_uBxxCQmn{YTHua|*LG_i4-YDBxk8K%J`yhziMBN7{^Dc<5y&F!xN
zJ-6-j_GN6Krb_s1psdFk@K>Xtja|ZdAd}LTP$_-A(&ffqI0!%Ehp=l)au|eRR|>Xb
z@cl2gB^#uEsTc4}ftp~wE~PxSG-h^wh8L;Xv$`Y;uo$6HTMpnil1R;e!uw0x*L4m5
zHpJlf<7Cq1p5QfKmp(){Fz6GomMUD-mTzwq%acKT1%Z5B5@1_dmtV$Ua~yP=-PFCH
zzO20t7a<Sl(e-snFhlL~dP4}PsRhXwc-1{hQrlkTc(!ma8CL|S(!;Y#5x1aA!A)_9
z4f()szCtOxHHqNn-6fDC{W{D8dG!K`GI0#vHy&^29SEMtt8|{mt$9az4`+lVuzkz8
zZ4xE<5xf8aHLI7BrBC3~w%WJER^$+?RBj2Y^(xEocV&i12@qn2)Xc_rhEzKC$r5?;
zaAeUGZK-2ODD-}D8S996KgGOx9g^RVi=oW<=B~f!XZiLjJ<X>P-WukLH9sCu%v6{P
ziIj`ri9mY_{P+>_%mp-0J~EPRb>#`ZNH)j@T8=o;GK2AZ3A)^KOn}GYoP>hv@D&C}
zUt|>QX?)!pzuA`|K=o@~V$H|d%&mT%mfHd3mkprOt<N7j_DOADK^?MY$R?F6zBzv^
zgXFJ6fl)mr@T$uK6p-^-GSB$4fr<Jf?AnqXhC$ekc4C9U-2Y-*r$Ne>dI4tACSa^r
zBR#28`P|VU=jJ(lv_H|TNAo5sye#<UdpCR$mLy5o3Dk@r&&IaDkUw34lA5>8z|4eE
zL7E;EbUypKtaXnx9G?8rZF)^ce)8k~W*R=@PCJYHLcZZ;t@k??AVsc^Bn9}wHRO)O
zxnb30#P*cysS~N0`4Hca_gSNtCq?Z?fuOf}B2>9{2X-F9_m2um{L{cONg$|qNVj~a
zDXE#kiCfu6xOLi#u23}J;7viG!o8i!ryx=jSy&E7HZSzhru5W~!I4S!K5T8yy^*%&
z@qm>|JA5A6Q-j$zhe~GRc>v5dGxSLAr?<Vf{3rrbyM`0`>tLBPZA@N6dPma?X2IQF
z3lq|!OEWY)m;n27@3`Orce9rCQ=m!iixjpn%InkgNjB(Ok<_#lOyFuS{ZACO%h95k
zvs2K)*mdBhKS<4K$8+O%v=yjeLq9{}7@0vb<7ZIALG3C@b@oK|!n(?sLOTFaxVCom
z1VcAxVCH7$rJo8~cjz=gOYC>28m}vc7Fl^R-*7Xf@iQ_Z=J;w(L<PudEEz4cvhY>7
zzV=DHkY8^2Gp($xT=w5TVds`CK?uUo9o-TEk^OJ%jy+A{7qbDY`eh>tCqIa%R!Ys8
z>|rcS8mgb++24f(mM~~K7n`7eNK1{i4ZqL2m=#(rmt+2l*5GR!%nA)g9ce{mpWE2m
z@NB~}zSK55>+EaGk0Nk0d?C|l*DfQUA7Qlp>l1)BLau`i7LcBZV<ps_QH(hmNcWEA
zoF@^{-v;&}FN23p1xqG&zc=h46flsH=w-^3Cttc>VG~S9{6{^B2kX-s`D|m0RKgC1
zgX$f9#G+j~%_biGJ1~y?i1uAb;P@g1O&6O%1$OlXTypNvUX|n_hi<Yv`s7nfrH;Ij
z4n3+0mDAhp588<$QY#_xjvkfy_x)~~6`XW)0(4_0(jQz~9oZ5a<V0`&*h$$mvEDvr
z8Pv>lk}AEZL`U{l0cPo17qiq7W7XNmep-T~f~NA*Tc<IhXOsK5ib!+DOOtFkqTOVD
zKsx;P1mFMVV(%#Wj)M<qho3hC|7@u*TOT!bwJYG2G`W~x^=0d?=DZK&8?Iq+706rw
zI`5tk?gN9_3pSP0(Q{~r($l$pz+Le<*5D#Wr8Le%*lEwG&Y_y3Giu>PUSmTq13PDG
zTnJ-9hQwJxP|yDpc5O!v#2~CC1C}5CH+IL~BIV<TG~h{yV{A!C|F1wOa-R>Qbb58B
zdu2-<!h}UmVUZG<q*Agy9AMm$5g*~F4sy}4S|S)PSCb%v8@ZZEwkJuieotFSB2txn
z#x^H~Q*Ez+sG7a@QD$eAF?PS3j3;E6sGePp%=1yRMZ1FX4Uft=*lTjy#`_{rG>+jK
zt6>pxYVb=H$Q=d%U4)DB%EZRoZ-y(hU@+y!>{cvF%rBooY|Z<w%7dz=P%~#}v<8)M
zX)ETY53oxQxqDG3+;zh0+OTHvB$>b664`KCO%1`RXJ|XyZC?Y>OwBlly>6AM;uCc<
z`xQuK`w~2F6Y^N<f5;EtGsg1WOc|tQ*c^SYb4e@85iz?21?PQOIh@zW->%74xk{sK
zPj+kjpR9?R3<fj}J=W2d`u7$>L?{VlfaV+f)NGXR9=<~egESENikg7P-Q35~A*jv;
z4LTF1zg*$;uMtGZ^<OSiR`zp=M_LQ4Bj|Yl7c%oI8MiSQ@LFF-NLp(IQaA1tkox6I
za01rX;UEYQ3?sg?oft$BHR)UNUO-bscsE`6&`Y%uiX&bUbdL4T4&)2FkGDoBY*YT?
z>ja;5ot^U!VOL@!APmDcIzihcbhVrQ2sC!3lgt7Y^v&ZZ2N*<)hm(`DdFr)G_N#0F
z3+dD%4CtKpObg^%4&W-Hdf|Df%KR%2RZRT}oz7Xj;(g&$dWykxJqu$qL=Fy61;qQ;
zv=fH0PXk~^=2XzVxWhnM_p;TdN!(y`x;mG8?8~Q?ksI4Ivl(h{4tiCJ;Dug^i`31I
z7H-TXC)18JD%XE8OOWQZlvvvdV57u`NG^+QZJO4dQhrR3&r>3%toSq!<;00fxDa~X
z%OaDB;?rcH(ohwD_49vMTl?cLHnjN3dP`rC{GF8z&3m-!)AS$2O)1^G6>PNBf!W4i
z81z3V8pp%<)2G6aVIOFqrt;jue!8~AGo$}&u~{<9$2Fah_m8EZ)>H`+K7u5LdCzA@
zzu5-XVHB`6UnpdT?eo?54V_E4PcNB)M9^uWb|a(aepCEEHsX%oK0+UApPd_!&^H;n
zmvSaXz?N)B=S<dqIMcUD-}D=&ro^DLw2J~>8W`vu<tRh459~{%e#vi49ZLIVC})Vp
zC%8pd%JRxf&V%lNV5djTLRMIH>_YXk4(8-Y4e7}Q`O>q1viNY8Qb$bSS`RHDVnM<C
zt#df8#%}o37gSa${|Gx5+lXNphHg|Oc4$faFV<5Mi3VEm7C4}3KC(zYzAn0Mht4Mf
zJ$fvYJU>|5E9OLyTj3qbnVNS1>q8BQgFeo;7B6iDnl%q&XZzv?aLg`!hjtj_m1%Oz
zhS7r8=L=2*iDtIqm1*)EJ6PgS8U0%vkU9^{NE96Goxh@+OOG#KZS&3K+`n)+I)Qqf
zaw!elcznS_dJ#_(6(!{^c)uZMRb1y&Igj>MTqZ?3_(}287}CdJaXs{9aN2#!Tzd}=
zq(<mTxbifKqnRzA&bo|w-qsZ{cvYGk2Q<6rJG!1FGgI<jaQqE%WK`=tA*Y<L$>8u_
z`HV$Fz-QdCmKQW902}*k5h)mJ(qXK1Y<RDHF5d!PSB=6smwmYz`hJ|)>Q^g^lCz<f
z+z>>mm~~^iRU6s8jgs*y1S4LfO9Q-kStmYYs5As1_{FX)%A*t1wnJyDK=zq0GA>)4
z$mE#o=_^{sKC2$){srGE*{1#*Knk73)}+f}-1VCwwwlAB{#u$_u2glA2DXZtHEdfa
zM}6zQWCy@J&9K#)+hhKFoH`>8eI0@i=6^|)v^dBe<RbiRG(zP38R!VbI^?@y9Zd-s
zMKaD|hyTl=^Em5h?^zKle+j#?Yl}e;*pi@*QrheOT@o4mA`Rr2O@Z0`S2QvD*wqAI
z1V*E2HSdK_M4dm;p(SjHkkdSrw>wac0Pe00j&ML4w?&dGl1&Cr%f8G18jS>9S&cdn
z!-+m{W9*H34J(iV38R5$ls;%y)mBNmLL;$ajHc;2W@J{VmGfXUevo~y1gpaF!HchY
z<blYi@n<e+?XzbJd99o`KuE2SZk*fv{xBwzptkLYa1?3V2m<fWmj7z;4_9gkxjs`C
zpX6xS>yKIm0l7l5m6lmekHlV{;F|KQ7H*QSeDD}g^o&bfyS@pe%0H>jSlUy1S+8KF
z20~bh_YT4|QZt?)*=ApHi-YBt1M5<+fz%2cX*TsXGVjd9b~%y71=FmNqwO=xbXS~S
z@3Bg5MF;pQ-@t<R3RCLMK{XvfI$a}X3pD<*8!bO+WtY7!-w7tN`2ejH*h7=*gVR>I
zda#{-;PLD%M+G=QjlVxTge5<yhmq6SP3kout}vIf6ozIgY_&)WO3k4~hQnjvk<L70
z*XNybkHp&9;>tyBRjr>xw%K-R%crc&vZ!~sL~EewdD??~?~}wjVj1aw_Qr?&McYrZ
z^!zw0F8{OL$+iZf5Oq=R#}$%(7UqtAZeaWqc5YV^gdh-22}MBiPi&XAE&8h_0Z)&I
z;aOf5#L|3Z<UOw0v&pRiX+$wkDMiE;l}%pxet8PC=<9x{b5L*swlq~R?&NJeo3Htg
zKrhnn3i`@_;?<ap;!P$u2Y>=x2WkS9iKXAF+(~LS1LTsaYmbIw1ZqkJ9==f6*l668
zWMfx__ac44OWK;q17+C<$71}1_L5Ut>O6N-jwbh#pNBOjJwcp~mlS9HAUR>(&P{Vj
z{%_S@^2CFG=e~YHUy-I=D&L@4J!1dy4Y0|Ken2@zVAPYZA@v2D^gW<$(7Q_2w(t+Y
zK3L$fpG;Kn_A$A@))x#iq#N{OO^6AdZwGdh1|~SxP3IeIO7hA*q`@2oxP;QOIi3wl
zY<>a+k%IEhKj^U1Jn@KWXhg2j4>&`634-$y)9nNIN!;VfijJ3-&120wuBpsX8mtow
z61of?Fb!E`U>uz#GXN{<|HtubKpGkM34=Y92D|-zOK#7GpndxIP*fsd8dn^-b?XP1
z@hIhWf}X*pgx=GdLqNR~?Tu3V@UzGX=tbHzn8R|{UPw#-RSt-5gaF`?*i$%bPEFms
zYd15k@&8wQU#{*)-r(IEAJX|#1l-&HBkbCeEe2uGmNY7f``_5T_B7yE`rmOnt*<};
zuTOn&gCrz-sK5mtcOQwi03?`e<D%6qNBGD}gvgrF_tZONb@sH;ms3)7&5F&VW~43P
zxs|qhhXVJ=Ukc}IBC;es466@q#nk|cw20Of)ACUjD6VFiBBa*f02ZaM4P2#m7VBq~
zrZeGVXIwT!!j%n@e#WQl-aTVf*Q|Y=;Zqn`P>_oZ-8MTGPUUpC9MIS|beyAJ0IB0m
z5G+O@9vMwOxQjtp2RO0%XOgg)zNOW-&Nho#YY&lx&HwJ~(vc3&UcA$jhWb0mF91P_
z6A0cMQ@;A(52b@#BB>rq2iY|f3wfX|R}jLoH8iPf&>@77-!5tcq1K^#n~clac?uiu
zP>jK>7nYPY!K4;H{o5mN!(O-aAqfA3yAp3OAz#0bcaR=-I?o%l&g`J5H6f6+#?ff;
zgM^n)2vaS9L~u?vUSN(o8i{-?d|bnVt!PHB;IS*0<ZYD9I+C<GPY(KqX8ZjA0BhFw
z;Z1YrpEc)8;o-^)tVu*{Q`(=VWXpWF#~P+y7Mm#f&*l8BbS<Xnin4zR64$iRw+a(C
zS>e_{^AgvD`gROjR?kNLN7%I>Q3}GaE76t`xc|lWp^!MUv)u#eh$#IeP5ynoq@DR&
zJxH40pQ83>8wa!5UCeQo5RaWF%>pe-SbQvgkHcj=KD#!e)x%<A(S&nG($Xu2TEnQ%
zCup?BF`0ZMi=$n4m!eZ>v~bVcrhjtaDb3F)<2J5g%{I<7&1c)k0khYO2-X!~RnUA%
z)(=rX0X^n|<bb_$3RUJRX+vl!8kyTin((s`WzfbQtl0!O8Jl$*#B8#L-_SV7Ft298
zGXvt(53?+BaWo0(GVDJSy_$2c<s;CRnjT_$<d~cS2rFARkXw!Ei=JZ<34LMf;sz|X
z7sZmc%u^D_Ts1Tgxz#kgTe1D%dB{hZxxlE%mvJ(eeb}}G;B8oZl!XoK<LGr*77qvM
z#Qfa_2-I&O1?`gvxBO(|zmlTY-Au@?#+*dkw}e0LlQqc#235I9gWz9yB*9_kf8GKy
zZFJ}v><)VEbUf-sEC$Pz25yea{QjM`R)VpRUyVV?{0q3fM+2-Z&Y;N}nED0Q8kunE
zS>J(mjWdVb=i6z~+ZGTj*`08Hk-k0wd$yFHL)o){Ae)!MbK-6HkVQ!yCp<-9XVwv(
zkh@2jIzcLE>!Y`1y;HHt{vOWxL)f()Nf3g-ln_)f|HN*bk#6tfxCE@yodu;|zZP)Z
z{|2+{6?xINC$;rC2C_NSVC;9#eoSY*iNzEsN@1O$u3o!*y9p~S#b&Y69OrqO)pA@v
zc+D1630W3q6C|=P*05MXa|KU^!tM>LBS<PD>Rnh~8YFX$H;%nJB1)b<QGQMbuh}xC
zp+o?$oMW%iH#bZpn;3hxHC!9CrY|`YYx<%u-<pc@;<W+48<=PyZof_-$T9ews*45a
zU(uG5w;iw$vs&}!l-G2`J&!Yi{8o@v&QzWHnuYOrI~dJZpS%`^cqezf2mjhrfigrr
z5%mrS3z3Ffs5OV*d7r&r!Qi5i1?r7Tyj;j?eYR6!<AYFYw0sfl23&s*RM@P=JS|aW
zMx503B_%c+H=HytU4jB*qV+lOT@wn_Ns*81n{ixzlL^^81!f4;2%21vJ$qQQJ_kr_
zW-uKsRsbpRR)Q6tkj*v-6#Osrc5SaS$bBFh)_cQ1Q<^jMCQ8nW56pf7Nlx3u_e?CF
z1}r-3T^Iu>`CGj7;{$~L^D??Hn+S-$`bd_;vj^$*F`#XC;ZW7G@xSJkCGzA~XiZ`j
zev$@1!Il5>uwiD6r6TneLSCj%e?kpEgk9Nn#2^f83DAZ5Z!E!v8RsLS0li&gqic>G
zfnc;wO*(<u@x$GzPvWCtv1JmM%^2ON{Bp&4BdK-ceIKIo$#`pKU4K>%&X+p*pbq1m
zv9fOY7#x>m9;4s~oQf8+*YKrquwr$xbZEyAbv3DVA?omjZQXE9PdG_k^>M;UXXq0p
zy^hnE$ZDDDrvS>A8FjYj6sVZBSvLg^eP=aViMlJMR~M1Qpk<9W@)#4FtA$ak|3uOO
zi9<Y_fkykCFa94Pz8*@PJ|!bquU{uFZ2BP5BT|VKY4!CKF!k!10IEiCxqm?y#NOCE
z9zTtqrh5|k=+M`xCQwH<38UI~1IS`rE*I*c4WoObQXo2V)B*e>cusK|8X2V2ZAoB*
zm>~Tx#`d7wvRM5SXzFEbwdFI4l&I_RzzgZgYTDz_|CZ5KooS8`+R}PYeA(%OYWhWK
z6%h#gF>(RiVS;&qiUb{NH2(<FAy0^uFxB9;=C#XyvmM^(F}47D5dlkWlLU+`04rQa
zRJUgnzK5aO3A31xS!{ke3P-Aejrp3w8C0WQ@_P{>PK1z-*P(mEyr5}4Qr+8{HIp5b
z7xWp>D$-$fgx^#9A?)0)AO=Ao+7d)j=)bYm7zV#)8}Q_zg2LSS>cRahl~~r>-k7}>
z1^=5Nb-(VI4=duLOJWFri<H=G5wDjj7P{K~c06$i&`VnqdEcIwUbd*T-ZKk@mfMr1
zn)jT}qEk<<d6Cde@h4_n#TpJ8npLa`fc&5JMYNS5!TEQ@9(h(mYJ)T6ZiW~SxiPC3
z4g(y5##t05$_MZYRt+qSNVdzX1>osZluTQ_H1}qZ)jGYDbpb0fyx~u@DD3A!4U!Rx
z6$w4*Hex7d(~v(S;C6g!&8Mb@sDGg1WQ6i^$F)gp^&~n(gNtJQ@~qLqxvj8)9gdr4
zyOa~><+$uo5wmmQnWx5P!^vk!?#1CpIvTxFb(!U=T2|<7fDYJrRo(?|#lsz%igmgG
z=Gx}qj{wga>AiYxrl19Da<H*0&e^B?>}$aqcQQ?*l`FEy13CVjg5@JHY*vr_8R02<
z7P8Q^RM?co==>d8MjGn_wPe#kd*&a*8P`kD5El}7Vm=y=xL%eu2PB*dz*4)fr5kjF
zfqt1Qg^PEVeEGZ?{|=atZUA1+47jgf1kFQTF(Gk6eR}}}FR{{7y1^-SNVfu6=#!l6
zU7@D~Jn&FDFxDSo=XNDA2*c2p%v<!|*p3;H=1bc^P7X;3wxz3En)SjV=y!f(uE0Nb
z6pb*sj7JRbZ$UD&5cYGg8;_AW0Nr*>AcM`MQ9K#0&pY?2Rl2Q7pwya)fG`%fG|O$q
zAB9mF6B6$bnG-~fAhE*!?NI5{j=E?QqQfTTh1JS!AQsv;E%C0yE$+(c2ib3;5<Vp;
zU3Mi4+YSEshPnmw_@M=L^^KYhL4rbS`mUq~)HiHNDZ4kFp~<ApU)9M_V5?wPi<*S&
zHDiKfiiyT!M_)Dz6pg*{Q6w$ckNni0?Z#YzJ0!cxr=z=?!0lG}gf@hL7$Vt@COx3f
z0f5FeV3I&~1RtmI<p0=@qA{zu2ZW&*n?-K;iUN0Db1F=QrF^zU2wo8WS!~%s>4ThP
zm*(>LU$(|IF@p>FISBKm{^xDz<nzUTU)6DvjHgiDo=*e0YZm4ZCi~WxnPWa}Jpj3D
z=2V7wpZCj5hfnj{w5B!v$*yzs`QC;kCBmN@?zASWv0aJR>#^CF-pg+<U8=|sDSN%9
z$w{ZRfIf7oEPj$sY7l_Gs=ot)Rf@`@H6G75pX>Ik@RRGc$`3!4lE`f(Xc*ig2ZRkM
zbjM`cgtb~>aD2#lbe2V_>-!_@N{%1~VOUFmgDv`RYzG1opLH7W<OFP8`$ZI_I!bi9
zmj;2iWsS{$qUIC}bkk1ZtYAf)NY7(}(WTO+)M_p+WV@K<8?HiY-gEyJI2U7gSkr+C
zx(mQmka~p7bbYk^5+tu7rEwYSo&uIb>gdoP5f_F3oLf9T&J0&%&2ZA^aX`0ag_}Rd
zjnu4tJ|Hu-hf;NqbTAH=Yrxqq*Qy$_Oo!*!&;&-Sf;AJ5?xQ7<6`E1{H(Pc$rC_Ff
z8(dasiWZ9)EHHBYA|$RU9$ekJ7iCH10v|YyEO59}D+LP#K&^jN2tG(Mz%ZTGiOEM!
zRe_+IS2KDNvG(L?4Y~7g+Ar&=t`4^qCOHjHkz~jV%~8m(fbE?ItHn(hmta@Zj-kiv
z3mh_&P4RF9_iSfpHCg*k`-C>~WjfT>)Qd~k<>ZR`Q9*rn6$@<~@NZ_#)qK~Nx~3MV
z9c?=k-RT(Vsn7`_8d@#<s%v><%lqW>iVLnG+ju5nD%If)G)^igJ-a(kKb?obDFVpP
zp~2a>H*t3AVIIw!TL{Si3J{<@3=+QWlkB9wd&*sca%=iCNFy^pP84MlR@1wHX5$3{
zw8x-l_>ZtFORgA%VK-`70$BIISf2@&_^ICoJd=&svX+(yD4J36RjN|fK0_THIZB>G
zZYFd*1Q~8P6Kc-t;>7&RI{TWPks@<oiw)uiob$t8`<faIc*mcbQbAGje%ka-3ZNe}
zJ}<`#G$~+ghU?@W74sZ0+hZ5`>j0@rKnQHmI1@iDXNVfa9lusaPhV`I8dhF`WL>MW
z(V|tf1MFWOCYpe}MsC0}wAp_Jz)1xe2lOkecdyhAfjxI7F^E2n#_$`|1Bqh$bETh!
zOwnMR@IW6`7b&EiK!cRpF&k|~#o|Sjn$Ox0_+!f732BQX5%Ws{ItLgQGh$m29nbOr
z9|JRD2l1!oqdx-$FjA5QWQn$(i~JN#RNYptNGk{)pSqDFazcDk%G0A!7+O4^+2z1)
zWL|#}5TXzupJQH}V<VZ)a_dWkz{XcT5()Ltg*X{22X9cw*2R<|{}Yi=JFhowM^QLz
zKQ)Yx97&C}lSf6Y{8=cQAtZ=ym^i{-#gE*yuZI*i({#SvIYd1-CV><-Yg}{YXndM)
zT*dztDu3LqFIv1{oh_u_$n?*TO2yafN_a?ItB|nr<or(5ro`XguYsMgY)$ibP?@9s
zIU6J|o`sWY*{qn~Kf<mBN1_mfT}coW?tigeU2RP!%Ur<B`21i?+y6&kj`np0S*2v7
zK)IL5Nm5}G9zovfxHRvKva*^@8LVb$>R|{A`5i5-o(B3nqv^($vjy(`r~^w<Xov3&
zaAIIVuHR6?7AfpRllHhQ2i12{zD-iWYR|#W>v7$t_cpILg$fg187eieBUxM7Gv(<*
z&c=q}W7>^XmmM%!E@?_^X5zLoIY{2zW7Pv-LHc;|57S`fHKPp5NTmo-^TD@yG+516
zq(X!^gl<0q8;BK|R__XBjy7D9mr2_Zb1v8+N=uH^#|__u?@R+qAFV!JNZPp4N4~k!
zg0pVv%gfp<%8WrmgOTPV%XZ=HLNBn1j~UWwWv?X)m7RG?&L|=u!yg{99sy4q(Jq7?
z3~O4Xu3kD2$%JpwYVp0bOY2{z5gei_L!~?$T9=}3P{@uuyLC3?HMojwjZXa~&^+$K
zX!y9~m#jB|)c+#zJj;WM?kYZUx_r5C4`Z`Yth2NC`Id}Lo+UG%hBDH6XTJRbkaUIC
z*YjwAf2>hfYd0@=8wQoK+BAk}KlbUJij2?_6iw=D{%GjKe9e6N`RcmEupG@B-0e&p
zT6O(U0R9kmF1QiHAP~J$z<k2}FIJJ%GghUN3s@U(g7E-v{;WX15FtxLwV2S)PPt`h
z9<M7&RFi}_oH|Y_6)kLB6!l!$wkeOb^*!$cs@nIxoZ*R2@%G;gE3mA6)KXuN)9<N2
zo4=G38~OVay2LFC3~791!hTFMEa6CoEm~2|`8;bjhB0mLloScvjG`|;FczE<s%@ay
zN#v{^l>-{-a^G~i4V<`MBYB{l&`4;*t?KcskeL4n@Tb-lO2s0Md(p>35YV?fBfSMg
z;O%4vR+obrskV&$>xZkr+>Tc)+7z5$8XRq~^jtYAU=`r1l*G}2B{=hK#w=GLMAprX
zjNIg=_Es1>Ba8kul{?5bM{~Q*b<f2p+*CmN$z=CZZ6C*HUOnc0u!H9T|3BERwG#NT
zkx+iZon`UOm+3HV9}f{!EbMUD;+LJe<`sCYQ6>0WK;*x4&Hw{%q-=fsEiYqWehyB7
z_!z46WG5&($8Nq#yp7iq=W%;u6Ln_8RHCH4b|KWB8>L|=MCMHV@UDSZNO%46itII?
zmZYI6pt_6g%B}9&*r!{G6Z<k+b?oazd%DlaraE9~sLMYX3Ut}NEXsdZ_~Gm7&L9Rs
z*h*MXVgJRh_B8P+1DxNrQhq~Hb6n1ej$uzqKJ7n=u&7B?WP^i_D~Fv;7c>+3<3O1C
z`c6*Gy3(()nEo|<lYSTipS8)RLtPRU2^Gc#J>w#Sl_cpYQlVuesjtqUWQDq^tBHIF
z^rif@C#PQeqr8aF#=tXJ4Hn2vLdYuV9D#~l9NXKV7oTpJ{tsySOb^^ddnm6uQinPc
zp;?^NYgu>T1S|a-FO+U)LpXLL^qWVAzDgM6pG$amOAhLL8K>UHs4T9OP&wvLuluD8
zual6-rz#^a-e4;=ciQr%VHUbqQ5Wx2Pl}rsb_d(gS5c5a^b@F7Y&qN23jnOIqAu2P
zCy)K%{#=`kp<95Iuj#&>bpIC4fL76S{VJ|!J00X(*8{trUDqSrtclh^`qZ&0AG^^k
zPJl&vFmp0%=o*=ZK2;@2pE%?Qr~Guft}Y80iwVB&MXJ$=HE|WI+zc?Z=R#(BB~GxR
zh8%9zSQA|wIlu$1+9Kou7sR5FiO)UiS<qRj?eHGJY4*HCxSv3@>qD^>xf!O}<En{T
zYv4UsYIAM|%+EyT^R=xS?m_Msx!JflH(`&4Vbf~8$luS4tb6<jyRvIbLJ*h|iVNhQ
z*fc7|{dqMBaM~6(s0HL~^|D5#aKbM_HEG7L=6P@RE}VQGN=~=DdanoF+1$Qa5Sj_?
z=Xt#lp$VvqK{KGgp|uihnzQZ<>7Emwdy7XX*tnFhL(7u(iqCOAib}`1ps{HCfv;N7
z%~?nPV&9%+UMfunY-tMQw=SH9L;x99-Ea-w2{jIM=@PoEvrVH>;zIFlsY0{!n<GAo
zN=YeG(W|$9W^>qbx+tnmV@dUjxk%X3F*T$)-SDFEy{k+xJJ#iOEB!k{c4^{7QJ_>b
z-3X2VsL*f7E=`#AH87h+Q?e<T8IvYd2S0nwa(f%iAOYsG_$cbgUWzx(Ox1%xW_G7L
z<m=N!BHNFanrHRxcr()7p_I^cn^xCu6jh#@*WAMY6)l+Q#C<qsP|x!J><%3wKW+|F
zP|H&4I0AuuGA)lwOE2%ZhOUi*%cAHCl@9Wui32!(d%F*{t^BZ2sgg|{cN>=GLFnLX
zTcH@xKt7b`;*{zSMiWYl?UlPjG{4$g+aXU&s~ukiMcWP}rEs<AC;?uY42b|$701Fl
z!2MlK+)a~O@va$oAI7{qntIo01M^V;@S}5hNen8;s7kMqDhfZPHhfjxXri<}DY5vA
zU}f&`BK#xlI+7d+Vc?Hk0+jgw$JQ87bLzeMM9o+OD0KLt&ySsC|NhR-pP`1?-=G0P
z?{|gqne?^+x5nHHG1N;tbWvuEuh5D$H@uWPwVmQ@@ua9M%Mg9Q72t7N14>1yea;Xq
z$GMGE+WTr&$3hOZm8<}{$QXqu%%0`E7diO<V9%ZTs2#!O)siP+3d^~R5n0%MaQBqD
z%WwL~5eT#gmsyDC#aL=|TWJEcG;vpmBt!>z`l4m<WuD`)2t$2Gbu@-p&9djat*%Y%
zVu^SDQG;HS0^roQ<n>Dhb>)Yo6$A}F+Uv*_7@bA(w}7T@SOMv_?$_p=W%6iRHGi5a
zTv~OO(2sO}-B_iP?M@F@^Ul$LN)7%Dl}ZMTv}asYz|yWt9tt>VXVl<M;!c9sT_Jo0
z&>0HL_tPpU06fL141s%1mUGPFewEyJOkQ3&gs1Xx2KAFq_l1p9`Y}ACno&(SZ}E8D
zHX4UZubH0>B0aodxi#iu!|~(=^cpk**L+_g<j+q?uR^<DDYYF3n1Ls+t}v-d?*(1I
z+Q$E?ZVq{b&;%)*dlbVb#^8?taK)4fg&n&MumwKiE0i*ysoB$>M;e)fN1{&12&iYx
zQ*8ecc5PV}gCJ~2b5N_u{x>$oN7A3kEZ}l(TSOiqSxk=-;L*&%VNrm*>YTNtRIOAR
z*?RCNwlqekehIi%`V=xDcQ(gwv7Iu=egLwWcu4YvX3qAw6a5vJ>ai{5KK&FZwx3Qh
z$pB|l<dj?9cV}F)Csimb_GZzUTK!Y#I%rjzO-QWnNOLSqodlkFO<I@%v`xLjRIi1N
z*Ax~eh1Kn|aetZ1E!7tEn+$qXa5;HGs${$8-v%xh+S<DyJ@V*$h9b}QM0eaC(7-}d
zYAGe?3X#G!cH3x4i80R6UVfnq<%ughpiR0~YmobtuKxmAe$ZEbj^fTq=Uqp*JFZFM
ziVx#AV0e)TCT)S;@maA>TI=aql=dSxi<?olX7gijUx+xf=$a5u*RKJrD&_&C%;N(I
zT<Gg^QY7}aBNz3Rf9B~rf8(^KV^2NtOTCdHM|Y0`h4v^F0JQf<&ZSzNcLX82wNO>z
z%GSJJ;u+E(gWbrF(p$%e^r6#WZq?Yl<M32>^Q+|j-s3tnajV9xx6d3Gm43+mq-IpD
zaU6-1x9T`l^`9y`pc3-L1OZqdSHfrk+oXXBenLVUYDH-4)}%WJ+CBwZQW*;Xjqsu7
z$gOavrah#iD^Ae+R>WHtehIsh<c47w_M?tSYW@GmYB?gHLyO#Uv1aU8v`B1!uV8Rp
z?_{j^0F?bnD-a7X)eFgD@zV&p)vB-O6cXWy_43huUXWJ>DOP}ODWoVHmslKJRg;y?
z3Z{@P-7;TA@L_a%`NFe)Rv`6kIpC@o8AY{07uR>eM25}}Z8mkU?WMe&0U>38g;?V3
zr=7hxWpiu=AL<q5n(a>rX{Q9!pF;s)!$q1-YH42o(jp&$QE}Mgmf3^9H$$R^W>>`A
zVso9P)yHW|#0o)%GmTScN)Pt_9uh0EgVXGfYfl&5ZKp=<=B!h%z<H1Jw6Inn^x4YL
zE0CJoXhbs8xPGTNNn!T0!XQ1EZ$oPZ0U^`B{1+52yzUB#;ClM4Pm_iPVTSU!ih(m<
zO2+;5T{h*$rkuu0;Ow_5Ek}##^5zJKozd`(usP714tat$_iIc+zxBoL*z}~tZaK}M
z(^3*`HXl%f1Ll>AW;WQZCZBVQH=BNt<W{t()JA1_itXJc%Zuam7~luTW-nqWF4M5W
z=z#VK12~Ok92D2~Z`Y3jZ{%kva!3i5{?>1`ll#h9BVpU{?21{}MJbhc5ooZ7b70ff
zg$;znNGy!l0L~0`IL68SAEM1KVP}x+Fbu-bD}e#qx&Os}Ne%L*`nzuGnWh;GNId$0
zUV6AjfEe2QCsS0W>7N=FXbZN9niWAKt3rO+V4P;IfDy2fES9AJKLKRtv0$y8s|Aid
zls|_is#Fs+*+xDwI-s;~rM6%z-Dqi}g{cqi!>aYAt-Tc^FKujLl0m!bYVAJzd~Daf
z)<Dk4AwK#TUC_uiMU0ic@06<(ig}t1ETEK%oRw(^4Y3Yp=>^-|MG?t({qQsx1T<M|
zUJC=gu6^57vQr28zVf$JMRazj#1>Cp9Mn>Q`|P_5_FS0H=6}USEp=>`wTnx$c_s`3
zS~zO_Pudlg$IeBoTXpn%Bzk7iTI||NyP)b1__Km3+))fQJ6k1xpAbEg9oylWDz@R<
zo1XNAjIOW0{-r}~nCH^hOh|Z5f^9X?j`Q?N9T9mXij2pWuq%b@ilW(u`tF9H2Q(#M
zDu6J{3g?n`dfEilfc<PhOJ4!dxcw96!9W`W$oHx(M@oVG`xlU}%wvf+pN)f2p)F7a
z0?iA2@q#W}LVlFTmZQ*Q(p@5S&gY++<^?VC-!NM;^d54{g*yw&{&@B_@irE(>IK8V
zBjXg_@i_tg@C#oiL!iA59-_Yr%^zWBmTXA~0?{oASRy-n%kRd4^egWMjIaj81oEu!
zc{*CA6!no`G6803qM)vJOnvY8Dh*Ae<VU*}Nqx1=O(Y#WJdUSZT;98#-Ow_E=kmh=
zgFwB{txl?@{IDEo^cmkX(G9hPQxi?#e`XVg6H-p+xe0zj^#*<bSX>fg0GrL#4u}5O
z)d0smRieJSw&((iwtKBqK6I1~oCwt)1qB+bcbNzF(eC<B5mj!1Ci@@+ShQ#4u~FmI
zjl=sp*oj{B@ULA}e+h9kM#KKh?+Oe0GX)0?&mbM5PrEI6dg>9YoxuM;AHKqTqP)Ql
zuU!~df*bkUtdZ<Cw6fS;INJyAXIv{d6`E`aiB{tWZgox99|z48=%^2Dx!T{dqo2q5
z>webrei}d!bZo+vZvu{dO%)aaM*~a`li(Lr)M#8BX@|XToAj@kaGI*Y%^Y65L*0?A
zIr>GO5>0;7QTXt7#flWzmG;I8CTez^*iT`%(k;6z@80-R062RN&`D&Lv*AZ4{7qnf
z)(elD_Mt#IOnx<t27Y+M+-7`*@!VPtS)qW3@<nZ8B9{+7eIOv!%*tX@v#~m}U3rKM
z@Z};v^Lm(M?wzkt6WN>Q^pCJ>J7O3HVJq2SFy4Q$mL?#7sRP89OE6DKyzKh8q&tM7
z0p{r%d-c5>Y0{@gr-Mp&JS%11mTo}FMRXy9JAY2-B(emy^RE;gCNW==Qc)%dHBWRX
zxcBPf@a#Xo;#_RK4!IWKl`BVt%D602yQ{ndyG3{^EdxciE$n?f){GoV<9)EdbuCe*
z&nj@!UsF{>6%cBcVZE-$yml_qY+gpk?BmgH9vX59zM<VS8DM1lZV$N(%`XdDph^vD
zvONSJYXynWAM}mCLuZlE*xp^@{i-kYhCB~-$RbxIC_}7)A<BV}GI}$JRj5j!ya#4Q
zlPT$`%<lT^1KHJ6t%k&%@zJMToEju>x;6-?PQAQfQ_YaF=*YBBDtU6FXeXK77hhX?
zzufRz4f5Ms!cTxf+NI>;XI*R5`3dbIy;7fK4DPvsH2U))9omkN2=GhCcY5#>cB8)h
z^bFV3x(~THOj>4uD>r(0=%q9D6GEk262YiuqbL!1eS=tj2Koxpvd)j7z$-^n8g!5R
z7d_x2c|n-b@7-|1uT@QIQalfhb=UR`-<Uy7x&}4+HGtKKgr(t^3=2PDwVX}Ci!*8K
zx!u<wod*hm6rXNTqLbzFA?yllB!)rQN(2%}_FwFeUcr%G@(obbrY#}H*tOgJS_TZ%
z3|KjYSQD<?c!ty#8jk~SUDxtSPQ5PU>#+Y}%K2r1+IyTQxJ&o!j7z#>1)Kuuu}Dq8
z?N!L{$6G``b~!x5!L3H>i_D(Oep|^q$DHViLalRTjW#`_<x(zGYdOCjJjhXKY~rdQ
z`h0~TNCc>iYheYCze&wcoXuYZrfE(g^XVI1ha&r&4ETl(*|Vl{9^h}|F+HKF$-p|(
zDnXwvjaLLw=Pwc{<kF7t?ZkZ}m^ojChJ8lFMf!hXAKj_&MC-RH*e;=SwFin=q3mKs
zo5q0#dr=V6++@&$oz50f83NgSGwacIUHnZ<L*-=1uy9dW981+XuPPWiE~^Si`B}uy
zh9P}l>fnvWrbr>}HR*JuXz6htZDY5Q3Xk-kg6i3EX>vx?89N0?!udU1US7T7&+;R)
zM{JW`56v^PW}17H`*{uyQs$aM^Gr<w5l*0#r>M5BagFhI1YOqmFgTW~=+a<pAUO$m
z3gKgyx^7$?9tu4WostuqKSfuNaNkVR<_2ShgR%N{X;S-50!V1%;-3iX$1SwreGF7i
zW?)#y*Pr;0u(QFj7zBavl@yep`(JF=ZDmL{Z{7t=5L;UqzWKO-V+>|SD~m(NXvs5y
zU+jc;(-I7DC?zzh>;yr0B@`+!KAMByR0b|&gTJj5m@ftYhBa`e1`MS1PH>zkl1Fhn
zHF9c~APD=cWQGfmqBwkyt?GLm#4C!;<soAA3HkgXUD|wLCpCB!9qd!vkh>PxUmglj
z&s<@4^ZQNKT&#E|9BOw3dBc&*#U=Y<kot&Lt7j~2LGWUQf$LKuyu&J6)&8`}Zz~_@
znf0G+t@nIPe%E*nz{*6|Ep$(uC%!-p8}>1lQG*A1a!C)QE4Z~lEUkG}o%$*p$qKML
zbVKX#PNx5D108;lMm{r0$9&@T;z`Te0`l2(Es?UDL#pHas(?|AmyGWe9}_DqUas)2
zJ~MzucOVL-M-uF_N6heMGgj4}9&@SBD+D|kyl4x%CTR7*=4mpc-jUlOQ#L~~lk&+`
zqDgc?jn%}PKKV$tG@qIaggG0T6$DqD3(#jN=;H1imCC_u(gO6E0U$DO-|vuEzTDYi
zD7e7&sH7Rk%Zuj`r?JiE$8M%a_OBQIL)evNIS_)tE2+5P{Vz66D^;DJnhWquVgR9*
z-v~~jDmu*6@x>uZP-$}r``Ds@Fy1tA1`WV#xu@Be{(MW7jY$UxT`o82*n_&a)mx+J
zzfRJm(o|YV^hNgTG(Geom1b~!H{P6;j3k}iHjqB05k=^!&>5?u?K;B92*7GT5$2?+
zZ2;ClDZgoY`j!?oFCiTJ2}7L-85aGQxNDkd98>!vBA|JCsY)_{1FBsMSW$<|dEuC@
z3(em2PN+m$TheKEOmfs2tk8YI3g~4s@pAzeAF}(h0w1qKG`Nt^<OH3e+K>_G<F!aC
zIwOj!Eu<w-?8B&mn`;koNIHQ@<H$3rO&vT#sp>wAW<RdKNtEp8C4)NgJm6<Wm_>gG
zWXQcpD|+f41d>czE}pS_5^6d!T&lDOb9E0Lz|s0F=fi3gU<wZSNJQ9)N@!&PRq75g
zXg!y=3Y{q!XvH1u6ShrVIwYH=KTR|{mAW0UgAMwE1b5iSpJveS$SP!*wQ`7YOEUqB
zXu%Z&nWbob0jsoLFv`~UZGb{PJ?4}VZh~yFL;x<LU-Cj!POth1GXv~?A@kw4ko{wS
zfnV}6-6hQ{<v6j<KR@3&!<zqG2J8*{=&*)4EB2IBl#il6!p<#;Vi1I(TM~nc``_5T
zSRwtQ8|c`_P$l66SETWBGL)VD$S2n0vMh_!RcTH!j?c;YJ|j6*QhQv`X+G;L^TPtm
zI6NJuyo=5cvgste#FB$N$E?@DPm+90L|gqpY(E|YS<aIYflrtJPUdU5fkPjJof=zs
z<MsfZcVOjC9G!N^?An}WQBtvMEggN49CEEb4}oQHE`HZ<!gv!St*ukSUF)Z<k2k@-
zcx=Vpdxj`a9+_7*0RcvDMylMv9RoPh<&;*APyiX>t}o`lSd23J9;Pe~#GYA19J}sh
zfzgv)Ll!`pX6a7y?PJb7R~UV)dI>zzghFxB*n03Omq`7?#tXzZ7wNkep-sI$k^r25
zy{e(>pq3KyS|7Cqd8R?U1}8Kka(({`*!2pS-;R}5q37s+uFzK9g#?jjt+xc&Va-^B
zty*OPWg441vt$twg$IIKKSveD;z=xFw)+^w$AjuBPv%(<^zQMoMU<M8%<2nJHMEy0
zHHIdAlz7(9QS)<D*{M7JOSFdHyh*)zQ(7TaQ#UkG>W1~ULm4R7B!@r*IeMV=Y(A7n
z?95m8V`f~zDY&K112w{(h<t5KUYNCO44VBOWHZ=pF*B7*-BR8JWtz6ekFaw)q8J2$
zXh(M<2x$L}T}=Y(*QS6t(L6*J&K8WvlW?#mG5E1e0X%b=n1t5#*7)_6?uj(?-P&nJ
zPB*NKzt0e99FE~5D~;MdFVcbrwGK!EypkTg{WC%Y-y#f7+3vNBk4M~7tJI8kHK{ou
z#xOsP%*yW(IA2OFKsUb%malmr+QsG({87N)P@CgO^=`IzRRs^;pwe`+N+-*JiN%U-
z>1PSx*@IboYf=+EBEH)V={h(}U?;p2*6q|Rl=o(-%Mtz+lE@NbED4k&BLL?kb3%uH
zlfiPkCGlAtN_Hgxr5K~T50z$()B)hLiCl0xM6VHi@Gsl_;61?js*R%GJ+<p(go+^T
zI@-#mALfGmCz~?O)&tPKYE2JN7mxpZ!p#Fl7^P%iKkAdcf)3cz6cc-kjT5MQ%I(l-
za3BM<ZJm{?CSkUZTPW4AJFEdc_o}Ts@~%ydQVmB(9itTSU%q;9HJ}<!sg7=Ij+}Vs
zw_qr^f{pFW7PGr8iN6bnJB_Emq5je_YU={RH#@k~h(fBmLTeRxwg#;<!zUc^%1C#w
zE~O+W1RA?qN2gxYlML#0v_e??AFrdxx&!k55yB3<jtwp4b4!(f!p<nmVi1I(TM|K$
z{cmgrrx3p~8{oXwK5GfNsRGJ-9S~?d9?xYcOzARsg??ktVLj6j0lh9b)LYLpc7_(F
zEbvQYQ-7F3q6rA64vA;euD*hGwz`*`Ta4go6y9?>{k{%En%&$7!YMbu>LbzgM8sUu
zqo5H~=TaoooMtSfOtpHt*(aS%R<O>FJDjHu@bF&-C#fJf{&{ywmbHmxa#EQ-`b<aB
z<@V~0E<Tg*Orb!R42*nr=6g<Z@(=uI%>5|Cqz1ru*$p%PkBCle*UGlJE$~37%jSz&
z3eE51v<7&&r~B#Zi{D7hRII*_zDuo(59&w?w0<pO-EjJY+7zLRf7HQ8;|D7d+gqRs
zqbp%0(4-R{D`97D#5K`_xD9+>SAuO`g{i{rNCj*gj~#m>X2^?cB*~38TH$rSI`Y<M
zYa3?@zY42va+tTR-KKW%)jy<t`ve-h;GTAuNs&Pl!A0M7_6anX2D+QedA#_hl2YQP
z6)<;ZOW>WTW^&^9g#U(97a`T^NWY^N87axblmCXO3hD=N(Td^7_7OdLSxGcG(*(q-
zeY^afN92!mDKwXo+~!$1$oMvT0JTq`xm2*xnAlk+mOC18)!!e&t}MG@7zEy^Pi$K5
zf3XHvF#c$#2M8~*<rtXl?+Vt~gjgHs`SH$<Q2u1Qw0+7h@3^!C*l<=_i#Bgw5Y70i
zU37jPk|?1>0GAdmj0ax31)$~L!Y?AMDiof>QZi~yZYzHtq_>ab9E5A1vYylI1Nlkl
zW%yVd)=)CL!sdK`hlnO#jI$}y2CK#$q+Q|OETB1A3G6hpSqA?OJzXz@c0;9R<G4A8
zqyltZ^0MiQ%SU}AHFP-k!e<gn0I}r9grrCrl-%OlaqUuR1rL*RwHQdp<lmvknOK*i
zlWW*fxMxzv`I%Ov8=7>5C>itTw)j7<D(wz3%Ahp#8a+J~f_o&mf^k-xl9N#=tJZ&E
z{B>&s1!^Yyv`z&dOA4CkVYui_qETkB@}Axl$m#q|XC0Ij0l!|G_Ht>Z_u;}bnY1)Q
zG1`LjHa4|Fbigw*XM>({E{W0~oguxG)(zxtW=baVj;2aU@UwtW8aY#5snGpQ3`!+%
z>j)4#9_atz^tv{`j=*QML4mz5p;nRwMu!OpJmU&2(2y(m%nHFTBQj}zoQJN-L)1Pz
zt(WPR!U4}9E+J*BrF2Z6Rl3!8;4`b~3@N0q^`m?y3*J8hpjiVuc`LWGk^hyy{D^PD
zuI$Ky5CmqlB?^l9C$_~?y5|cMpqz_Q`uY_3;MayJtoHj&gkRb&&!$RzM(j)KHRzGt
zW_=qb)s`I}_F76Y_<mI23EN0OwDkFkO;CSa1+%e{);|6|lF{{8!6p;c`ImqgJn{!h
zyin<OHb3D&l1b~q)v8Ub)c{{FICk_fyTDOEYAUE2j@TX1gmHjKE`r3>m92pgjibv8
z&0>GXJmtJaO*!ij#FuT)eY9MTaZ$lYXtmD(vVkQu9)C*%qhcGB{hq_SW5iJ}f!T)A
z5Q;PXip!!;JbEl48riAd4GshXk!_dCE+s-UpnGUc0*=9#m1-a*LSvhTXU8z*PQFGt
zs!$>{+i1;1zp^JWSc%Z=y+G<Xy1E<jxJp<+iO?+H!Z_l56d`RX2Z%b+Bi$Op$2_I4
zziqzPS3y_t(GVNa?-HW9=;Jm_Iw;>)`iHgfHXQbMQDN~>C{n&Pr}Ckxv3m1EA<Z%e
zJLV{9k2S#5#|wofDQO*NKZE$R_Y7>atU$}N=43RiX3#;O-$qdZO;V6d80M<Cy+rq&
z^`KzU5;7y(qk`uW<PjpGYY@!u;Ffs1MDf7NYCftiB|&C_<TG;cBw>|aE#aTAYq7By
z24O3agap`su`7MWu5=PzAgWS@pN*}y|3Rmz5nmjik$NJn$buSK6?4IOVxFZhFur|O
z#xbPB@x3-zQ=qh8NLOyr45MsF5ynP3%Jq-Rg7J+eBtPZZ$AqMBkqOaUi5?maKdIlR
z!Hs@e!X+B9fKJ44r#Iure{j^0ekK5DLz|w`jD5<cBaN2mZbI1bHB5QPeg^5vHhtlQ
zp-(lwa+2C-J7P2@M1NHYI+}jm1Byu1@hUtP2>UMmqjD@`JF8I9Y2>N5TchfLu(jAy
zxihc>T=~;GW~tK!WJ|nMXz&f*%M0j((<D-Org1F3F_J#gPp=-F=C)m<X@O1B?Rz?^
zmf+c)7nOFzicgsR28ov7Sx(~x5`NXECoSOgIlo|<#L*89fce8sPVTGF08c#1S7#Lx
zTPL)!p-`IKPApAvOIv3nH+l5;2%h*aqC6~b2{NqD$DeSJ-FG?QTGGxiK06;M3vrq#
zm96B02AFTFr*&*$n?1>wsyg`UaIH5(*#Z<>2(d)D&|Sglc#90|0%=CBVx5<k_TdRF
zBVr4zh}8x<GrL23X(Y6p6I-CaXF-vLYOAur9ns$chCV};5($&>agMgZ-GZUdj{Qg2
zl^shA!myTXzy|tn?8Qlt^0Rskcs9o}u}+eH`{Of||A;VVRd_@0T*BUVeF~bs35&uK
zHe36qTT>GQaTuC9O!j2umjSnWT=Tyt9E#?e(AMNNFwHUb%XBE3a^-!Ru{+fW4+|$I
zpk#9g6FaO=C-^4m+c+FeeJ2{$+rAnmbp0Thb=J@tTd!cpW*C~}31^@<Vfjn~h&$v7
zAD$G-Cm3X;x5OJwC<aWX)005XWc>07J%BAqn>l5H61+R<Og{%Y7Th80c=RkMM^S=C
zL6W8!L;9y5ZAz6;NeN^$6dJbUX0N<sbMSR(az&4qq$yx#A7fd`=3r;?COMjTIhq^U
zS<asT7thp+h<GWQdWTPCLv_9(BkbBFmg~Fl>3q%PRtR!q*gt0zD`^&N*uCO^7iDvj
zqKU?BW;y`GXS+IrFMT+%lO|dq+h7c)>~~G0$A_aa!k}#<Wuj@NQgmbbGAn7UvD>?6
z>Iux=8|+(MHsCmY7C$io>vgW>MDHBplF()G(L0$YqL}lGq-wk-`X{JjVznIhy1L3U
z(Dflr6U~}b{Ex%)cv;hzz6!P^Az}U|2RK24MnN0R#z#Zxvd#YpJJ)Q9K@bM-=$?vz
zcK;i@gQJPRG8^#pVUZH}aw_vS^~;>>(jmZk^pm|6aZSf3>NL^V203D%RV6QIQdl^B
z4FS3T1p3~cqzk<rod4Kw<V7dIac8<599yTUb9!21W5$jSU!0(P4wo%W?hLSMXL-DJ
z%7{!S(#}C_kWZGN41Qmi4CtUv(<di!Vl?3Me%=K6d)Yx*eb?{JUg6Ps16^r)B)+R>
z?8Bl}i>Cgr9M0I;s4u*a!`C`>PeG7)W`o0$y<q`QorcD9+4~@ycR!a<NxoFFBj9dm
z4<YyOz#qxbJ|Gdsr!XnNI#=jZN4P+rIQ;bb-xp!AFTwPS2sTzU!&j9@&R-^OatI|T
z(>Sa)ONKsGqvZ!IH)OD}0!GFq=r{PjK0g+?zyOmAymVtuJyjoDrddRT3ve2z-6@Jz
zrr!j}03$I^4x9Bg@UQn{0u9jY^qtM!r?q*xF6S*Hkwp&AYo^`btI{B2Y$A(%&$wi{
zE1uM&Dw3w7G-Votj9hG@oj8<~tsA$3GEE#0wiTWNwFW7eMUp5!CI$^{oLcNBb<smn
zaa5Wr6&exuu*NC*N2gDT4cTD>Ttbnf$GPirNrF_7Mp8whJ9sXZ;y+>MV#6>D0@0NK
z8w2|<*1C!BB2^*_Ah&ffpX1S5sAD0NuEFil&h}VvE6(uX<SQ_QL4u$CNW86s4CU15
zfCkU;Q`l94Y7DRjX#-_YoA*=o^Z5NU5g?RSYB0N-80Jy!BbUH^)FM4^R$wN|d)lnC
zOY`-Lgb2>Wze=pX)7(q5>`{3diO417<)=ViBWgH9h(XUO+Gl4$X09y4Iaw7CYc+fx
zB#I|DQ(rqpj?}yD;Cjmc=G9F<6r3TwPtG2Vno-=kaJ+PWZ%I4O<LuM;WIH|{ihz0v
z;F2&O;}P_Lbhd)32dz4BXHyc(>@YXFr{(+dS7NiFE<V|k=<`^w+w$aM!<-P%g)c;3
z*=MM1(o7|>Bf}s)^U*(ci3qahq}F^=KQ~@{Y=SOjAzb`m5UWe{N8m7xL#XqOzGQ)L
zFKy$|i^SX-4;15s0bT7VjF&yi74Y&JXFt$hjHdmEz;#?RfqA&Z-4|{{S~Y+drI2Sg
zk8ce5of~eu(Q5d-;2$rl{VnaNTlTf5y!$A)7Sl2+JK~7`cZ2?=T2Y)dtic9J9>~KG
zt^RAIs$wM!=(<ZTKbBlym@f`@K?*SQZqe)zD*xVy4`FAN<S-1v&>QUlwuOEFi*205
zQoiT`$~0}_Qjng$uZLDNF&d4tlR<R3C!wRP@WI<VE5L(V%B*ikn2gwj?`?O{q08?O
zswfMPy*If)-U>iUm3;mvKxdbyWM{bs1$@y;Jp#0&!QndXewY<*KXm;b<m`f{q;H)=
z?N+~@<h{8*$hp}_-W#Pl8OERL2Az%E9`D)Ps0%Df{+<1Xe-iIoxfp<(hU$x~4L7Pn
zM(xmpyZHKpt>YsKd^NSLv`)ZzG#ZX7ccb?Fz+<j%yxj4?g-uDtJ@huuGktx!v#!tu
zEk0R(_SX*Q_O>5JeHBXofM{(Qu4Kj-bp>v)-L*ZQnOws!D_Og6sUV>f9w%3Ot1D}T
zG!#cO4#035AMD++T;GKu>k7OhV<`eSdt<ne)tggjOM@7^AD$uc3+%|U14byP-I6fL
zHjRYUo@L{OkaOW!h;KcqHbv;Aj~YSi0)H#-gmUBA@PqM%;0f6dN9Rt=TypTv`nmX6
zX(o618OE6PtWiD){=x1|eUqn7m->6iGbwr6y%(ZL&#3<*Wgs~2v6GR0T{jNA<!*+1
zU13Sr3xRI=OtqSZ35C%l6jZ=b^j;;FT7-LY`%l=F*f<b_z?RJN*zUivTN1-qiZs^%
ziZ%%I%u~}jc3v~0Mf1KKaT1|X;$E@<{v3h#Q=GVjb|_wJi<Y(;g-!nG4Fr$S1#*cf
z3d2$ElX2{tNQ4WMySn9gn<c5IX7Fh!6vK6!->#%1M>~5vrEdfbY2I{d_@54kk+Dwx
z9l$jljl6rF!}v^^pYzV^@}t>ss`7oX?uj3q^hy*EI(w`#GFg_=5p?sEv=+A?55`Ih
zXbwAvaz<TfKB&`1h6vVXLunr$*2Gs=u%J!7)lrT2z#!7N;^t_@V9v?N_-FKAuA>~5
z=653VSo|mSeddc0KGXTEU9=^ym?p!y&m<Ab9EXXsgH4<gx3G(Ip0Rz2mPl$MfXYM9
z3So`$8G<(aK7tSK85`c?%=?~cH-M#plh9_a$P^A?QniLQw_1k04Q=pY!ohqsZE{)2
zNodLK1y3i}OHdPI;X2$|N&W%PCkIA+4S?-;+okR=q@P6aOU<&q;=P<R@@_L1kI)C2
zSw?z^qAR>rb}gJK7=B4X4#3PO(Dw76(%=iCo=>;Zv7`S@=Mb6jeI2U0ogdXoOY+3%
zh#t|jh4+O*gxa=9N+;88ON9K|ou=XDLEpVa_Tj}L;MpbnkFaaI5g3GFD<wRVu>WFL
zdc{UM$+rL>E#zg#_G^vVIYgB^0}+^r=WG{dm`OSEE+2Q`N>*!_fyNQl-0I7zYjG~p
z*hR6ff?2$q{t7__m<8^fn{({d^uwefO|yXo-Z}y5WnAfe$vv9F&gQr*&bQr_uH|V+
zbJ>TCqmQ*SpXnAiFH*&&$$n<?uk?a0Lz6roqdI`iPu=v5*}4YI_ScO0$#(}H**QoT
za0y%NJjm&b>%j0KwADc*>=wKmTmqg-47kFt+PgRbO}3Q}a&*2La`U5gN0La{?TEy_
zqIGA1_mvgYC*+x^cPBW~%E4~wY5GSLIjw74rm=$#BGOwZlH&Gj0D+#du=M#<u`)n@
z0L|voW`jI_w*XG{loRqh6fkUG1_7AgS>A_q>8*n(F24>32hiOyzcX!@71b}rHQG+h
z0(GserB4{}jkPLTJ`gOk(wDl>V;hKPyS+o053Oh(g|W{%1GL@Zp1x?m@}`3<Eoo+F
zkRB~T3DqjtQ8YEQNhQWL=nM4E0hE_&g!1zkl<)dWdwvBWn$fvjRwp*>6NbLh3r$VX
zV9CJw-*gY%;x3vHw?w9aa><sv(5Y&{gt#Y)d9No2{t$L0ITFMm>_;QW0^$E3o2DwU
zBejOP^$Ddb3kfzh#45_pFblkCdibTCw-ZgW_i9-ti~02`>ZxNxuhLrW!ony`-)Ley
zC(KI6s$X^iO2vqNIj2!?E&llrpj1HKDg&&}#<1G{*Ww1SQC2qy9K<GQ{u#jq+N6qv
zot4y!GFFT6xG4J$DC;RoLqgMXQ@NmXVKx+$#U^%TtNW<^U^KGHNn4xL7f5HZv>pPq
zNg-(dYzaq`-{%%we@Oau;ocJI_z(wZnl;?!0tnlJD{>4PbBmOz$^|LgIww>5Km^xW
zf62u$u!^{PXM|yO1Ohcn+vNw1+LhHs8z)jD5P`|xhvk#h-trdeN>9T<|F>zE``Yw6
z0#i1qC7n(Id3AYwXp0CuBggT`lmw|r4xS|&z>nZrUg0{M?3A7~Q|cki6JRuU3cfZ$
z+ZLx5sCR_`-#OtvD}YbC#PxeU1Y~UO4#$ONyV~#|4P~xzrSI#Y{aSNF5m0NFb=SB=
zB|G(QcN51a!mtv(^u~7V(YPXYlMq`T+9g=zr=4a{GB>9JB7jN8^m+^+p1sYJ8#Fsm
zc<xdwr{dr=kBB&so>$}cy-Ryd?R83?HNRk%IAo{w6TgIAfsMo<3|k38z_9;f|7n{T
z=_UUHh|@ty?AX@9j4(pur|-Z1PGKD)?*!#EzAisUzjbzc2i0XyZ}j@wt<!o$A4sbM
z=|rB+$nShSnE#vwN?$i!+bm-zejhF^Q3IKpw?j%~{S&!`wqHlcfmBT&XVYKcl*xXB
zH1q+*G-kIPhY_2vI904Lu4wHV(nk3=yUQvTG(6j5GUPMEi6Wy@m*N-%#?Pu^zKY23
z`fB<{jPeFpdoa1oQyBHzb!v?olBfv=ms60<z1-=|rv4|WH}rLNcF8?Pe>(IEWNJXT
z;<c1ZXH9(~sio=m$uDALD<`fVB3m-q@N!RSsY!n#TeFG`2<V?ZRH$LY4g1WR`kz`-
z4lmqiHdfOpk=lcw$n)@VHL-_<x)om9&zNl3dJpuga0-dtcBf`hVkYn+4_^}RI}f;g
zN+G*5P)xHi>d~I_qhX`MHRxYKTk*aZ=MYKv9Nm`qHC(aF>fz-0+hdd^v2~EGSqA2*
zWavWR+EagE<|Xe+Gr_nDr#MtIso?;FX+~w41PI%zetI8Lu>u`^D$AtDTT#)7K6EwB
zWSX6EdXFaCD&G+%n@lj7=Jo3M0RD9j*}tr0e+av>Bnx2>c%!KZ36T3=Y(%BopNAJn
zMYBMlmmeb_YM&7XaLQe>-l-Mzv8k6+qFrGFVla=L=W33A1a@lxzDiIa4V70P_t$>8
zJpo#<^`Q>zzw@T=^Kqlp{ZN{<!{@v(ip>ZIdAK83ULT;hhxN}hdwC_%)!A)<oqih=
zG$Wu}BZu&Y0#PnS6#9epl05@fMvJ1KC`aon4(!!zndleYc52|s_5Ts=Lkkfy!~#u*
zt<ui{8xp*v>rezF5vTSW^6A#(Rd!55hC<jW>CeQ|thvm#3O04AjKMp0XrIK9PviP*
z$VA{5QSL}nj}}hoPRvgksw8)?^wp2-Zud!;zqFhW7!z)r7(wR891ymLI;|5JwY^^m
zN6?0L$1V7eBQZWcVbuWP6V3|)d!7uKEgI1s#mGuLk~tEO;+Q70wtt~IZIXnCDkjya
z*X-YyMW#s`7D`iY-YoJ_ZE(<E2Q(*g`6-p^(Z3D@{MXGIoE9n|lc!$2&S^}uHa`Jq
zNc$pSc(5{VgB}`I1vF2@N&6ewsj1}aT8CoEWewtE3TV`b5s>Nb_>I;Zo_aNEG~I{E
zBGGbcN;qW;-1oqCl%<%%Hgf&!hm_$zVdr)wF$lxZmN4K~|BdZJK;p|&Ksb|}46%`Q
zg%z+p+C`Y?VxA#sQ&j5u?MbHbz;s1irDbIW{`gD;Ysec|x+(t-lyi&H80E>Caai@1
zo#I9l?x>Y=0dzH~{9b>@i^o0Sbs<bU&FIt!j9hTHy1Ap9Mv@LSxGwhuQz<2TzKu3M
zb$uvm@j5@v6FG8jivCisdv*0&^#+>|vsFo~m^WTW^f(EM71+`YayRs%VB~*)tZjDw
z*lD7}blHQ_;gEWPCu#E;k97x8XVhv>G$w5tgS!N(*-FW_ashe9Wc;F9TL2gP{|w4O
z>u6-CIOF){RJ@N?mydC@ntdK`kkjYoO)M$1RI;Ptb#yaK&Fk=B_H3)4<15uL?(>`|
z=Z3D;Kf%bN>43!Btr&76#_OlxC>aJp4WY-5vY2P}@mJhjnpjuG!-Pz7*UIY?*BhM!
zgUGWs%8x_{A<jzIXnVE=&9dYOA;h`y7Um5E+yz}Z_Z5$$W>94LhUvZ)yiNoRfpj=0
zG&jixvXR!I)<Nc3;7EI%Y`(7<i7Y3rLvRe)2Qe~cP9JmKP=y#bSVLneJ&7o-BhZ4`
zG>$B~e*Q=&X1)Emi~T<S5q7QF8iF8jOA45<|Bc=3#!SEF+kmIEj=;SBQ*RUdu&2Si
z#HS<@<^)66poI1_dqG<l+C(ouf||+H)!~lJ)a?>MO`FVw-n3pD8@z%TmtNr$-9^&+
z=wQPCXV7l}<S>hqin-n*^vL^DvaQo7fGy`>J3Dsuh`aS!7+gw`1b0k$E;@fKeNntX
z&EwngY8KB5HAxxQZCx5#n!21G1^rvx+c30;T^c6itA~gW@9JuX#~!k9Nh=z6FwpLb
z!b!MJbxx;CX&4+UqHXl%afKdwg~`a$cTR99d0y@5JzUd$@~f&bFr90RW?SEvzTO81
zXFSab{PmpR8NSGBK0oO+04W~GgCS^IW|od3GK)oISU_f0B_W3Fbea<f&g_Lo!=LY4
z0(a>o`~(?rg~ZU~u2cFE(A3mm(xiV7RIkv7N#8Rwh>J!Is17Y;YnH@n;xd#T@IXFo
zx&#lCwr6fZpk)X90WFEnAb9uzIqrKB*S4819RfP9Ipd<vt2?v1*VLZc8B7CN3kv<&
zlD#u`GRZQ@7pi#@*a)bHEn}vMoWEs&Ua`jpId#M1=`h-U>;r_^vu*IsN3;!p=62mw
z1m`}CU)>!-YwOp<BLf_?`^x;|>)ehU3Sk)9(GCyWnEo5v@daD_L=D_YLJ}~Nj%v%4
zfer5%C4N6a3oSlI;i$Xga~wQZ<630#<HJaIMXT%F#;0W0a#yJD@@Mpn;(mdB>RWf@
zYEGy&ztgxDKV4kp3FvEoKrUOX?0}qT=n!g#O$D((xBYSJa>x^ahEywGz<PS4_MUt#
zkzy$2FBUUtTY-h6P#)JBY!0vZdKwEh8iYl@mUS<_Odflx0QqlxMztsDC2)U@94lHV
zk#s4Ls@Z*2K)s39q`mo#g+r*BEd%O-aK1;d&wawD)GO4S?{p~)31j~HiTSo~f)Q~%
zS4Y0U@}uD*w<1@FuG%VO!EmkIIOVC-gsld-nlVsH+%{FS-3sh8`|}!9p;vKUfm?xn
z90$>+1HbIWuPjoj(Z5Vm#NX4*m5BR1>hbUtYFY@ll^}2f8B&G+&8JWkvJz@L+x6iE
z9*J8Ud_C|ADXjHrdb)v<NdxMRcACD?HZGQ@>95v-e+;1Kb}fjVX)g?3v(4WH=9(<O
z3dBLin!`rLGkboe8hK=nQ=U+lnVkzI{?yZKsas{WyvB>e7(Ye=d}agCe#@T47_PYL
z=4*qOii&C(tx6<h@wo(IO>@-1{u6d3NDhP`@Jk|y@c)nPI-}iIr9vJMD+gh)>BEiN
z9xDmc5va&8^0(yZ!`Ir)>Zes)Em8o(4Ge+nqE&y9p@cJ!(rayW4GtXcvwjbkl3}2z
zz3*~(0E1G_5lpDDaIB2{Xrmubk-EbL7(Wt>FKAc<$F|iiPMCx}I<aXnaLC+C#!m$G
z*(c?CUGR`!|BOQQZvps6oB0)@3WfLUaQyv*L`k|DVKC)`-@K&1M`D2}#s))X!TOWc
zz)5xna!{C}hdZ@s-&y($Me3))_d|HbHd(X=m#MCiU=-{W^te{%h(*$kPtHSEw}xUP
zaa!7BMq-eZi~00k7WTTN)+Go1&pc5LiMa0m`Y{x*zjBH7@=``@yZ>mBOsM%ESCnE3
zXw6<O|JMVO>lzt?tJRna3yt2(8891L<QUN7wnkG!v63T_XJ6A6riyYj_z<sUiPfJ%
zX(LB>?>0AVvP|5xgaWe}86IqrvmGVGS{js%J{u77R0o4UVb61vI>iajA&^<y6N~+y
z0?K4c&A5hPX`CXxlo(|TCU;U=a|D=uiBe~M01C3htyH&b=!-^*l}$S3ij`}y)5~Kp
zE)PermnV=oo)_sFcl|%Y&MZk{5Qd>Q>WUW(zW>FhA+eSDQD1<{0tr}_-Y1-X<x`Ny
zw@?UN)wR8o|DA5YQm~C&(9}oKesoVxD(mMf1Ff4Xx8C(Ah}-(dOY|v73#iPiBe;0O
zje}F7Q$RV4=zixZPY0Tw(ine|6Mhc#`C3;a&!&{$1<YQsadxb=?GOhl0j9h<(2z|t
ziUYB|LcwpM6q{p2X}ACP!h2a=RF=;&)|@)*ghPC_EoNRnE}<C=QKsU<guA+gHX`^n
zG*!;EYjEyJJXLOhOm&<HIw`57lI<Mi>1C-9v=u7m-DLVW=9J2ysqyOZ@Se~PAV&(H
z3))-A5jao0Uc*ZM5b=35MFg9R!K_9P6sfIf>&kYA%aHC`nu8YC6KahG_%7D5*t=Xo
zAETkc!r+C~;#VE76Lo2&wToeh^rG~NQr?Mv&L@L4Hfc<2MB!zKdvfmPNNa9V7P5S=
zhy|PdCA7Gn22l1@caaaZ{tmWToPm`V0EU<3ln>(P9>J9l(EsZw^W)ClD4_3Ywl@AM
z0LmWomDXfU)1`V-S{KHbMNftS`qU5PW_m-DmOyBUS$p95ae6q-7oet6h<6RjDuQjd
zUDE?mLa7-Qw0SBn&yngo!u*FD|0C=Svm^#V7<{9Bh@$5H7u&kk#2>TF1$;Bs7J=~P
z!wQ;Ua6xIhDO}Io`3a53(GQ_$NjXobToQUqD=s*l8vJ0CDRaHcrzdT*Kr=P3-hY>r
zTcb1H9BDd(#zELoWIkonsr`S=L6Q|TcW6b7qo6?7@*77J+b4vs2s$&zCJO(*LJ&4p
zn)3oWE@zf6GkXY4c^$d<s(v0<;w5y>ThR#8rreDpktY}A-3^f@h6u{VU&rnJR+;fP
zc<zRV5Z(uB)U*f%nm+S=VC(StIEgmZq|lADAdI+7U=Jz&IT#%BdLBhih=dw7BTCg3
zc9u&vpKs*U$Q~%8D}5J@${%tx{})h~B*@yVzHdG&VVr5t3|*`M0`KEVCn_hiz2pH`
zof;o%n$2UjSg=W=$qIhWsxhl-=ha?@<Ccf)u9DAXc|^Cy<>plLZMZzV8ZS@e&o1w&
zv~-5ffNiy0HieZ23?tXxqZ2Xi$Jy==U{W~G@&&btPFvz$on73wPQL+YGk*}wX8_4{
z-r&2{);aG0{XzwpGDBmPz*>HqhBEA`B!74ni8$|GLj1D`C;7{dnHs)%TtoOXR1xpJ
z89T5&mnC3OGCnA`zK89~l0bbv(7$}0i*3X(3_~|6{Fk)<Vm;+7GC)x-VC0gEBU9pI
zt-x`g2IpjhlOsuuTB#ua3}oya<fA*h>*RnioUd&<l-!sc7wRE(`7j2-KK%O&ec08X
zu<TptAHhgDC)lR%vcW!RUAakHkX8W8;jl?mK-2fJx-@BqH+-u4X)wwA);mMt&vK|B
z$geFpV}7>U(ANOOcpC@)EL_58mp6SMnNPEQK#AQma0%<kF}(1X;^R0?jKLI$p)n-k
zP<+m)=4Fml-r<Zqq|4gL39eX9Dfga6vJ!9lQ0AEQIWYipITe|i-wTcJ2#15ApLlVA
zUjPv4MF|J4v@IHeF|{>szRCX!kbU+=BwRJRB&#gsj_g85HE6Q@GkTj4^=&_<j{;<$
z*&=H`j=xfV<bx#p4Bn`Gqh{dm+_!!wZ+j+nu2UW4bEzS97xdP2`!jitDo1u|ZG8Y1
zf0k@A1@mcM4`N#YEi}89!*6>gnf<T0%(fgPm#)X&BS5^5%FBF`8E@H?>ciGLE;}^%
zGdwBR69c|YKFrnFqVd_O<H9!CZu?5C(Alk9c(1Ka`B{0Hnl4%GWvOxIJBJ^7kyR!C
zO(`$2WsbkoN>2j&kSmbrJUJ-+t&P7cd^QPvBk%V3OW2jzNDzatmhwOXon862nJo55
zC;1vcJ6ZBzjC~AdCLT_?(`nindLb9hPa|IiGRU>w)%(#}b!d(Z&BREH7hH17vLz!x
zkk4MQ{(?`=`kKm%2=F*uYf=9es$b76v0TXxM0`TZ_-v7mDcH!aBLIXPHU?+340e^_
zA@kwYr0E0wHm{rFp#g50lbww5*Uq#U^vW^0E7+r%?Io-;I2t7Ra~C4{-gb>}viD9p
zrcOw9Xl9~;oGtK%jcqa)I(a^elb2VH_Zz{t{t4juWGv!$g%gbDoOc-^|5{YXDTz={
zG^s#xG%fIgOk#*v<hqz+TV@kYY79o(=ZmNYb4N8q1YX+C4sw>+_o+@pL8+ez^Cgr?
z7lq+QicH9r9AM{~Q#j0uVth2wQh$VVz&@xvHcK}DSkIXLh?|jDwGBeV24$d>!ix7u
z`}v9+Bns@9jS<$+zaT1t?}cLEg6%a-{7*74At#&IpZ5;<F+EHkZxbvZ8?+LOY1mfR
z%s@oA3Hd0r<|NS2;C^cUPXuaB)g;J?HVjwpr5uO|lkZRiXw=Ir=aA2(CiEu)gaTrd
zxnF<9F-ew^Th=IlR?>_Qsb$yM67G5t*uw6Gs{aypZAk)xFziYN`hfdiY-N?i{n&T_
z8E2F}(k97AQ0~UPmg@*P0E&A}rilZjUTMOl@V^^pG&x!)Q1C?QZLRD&Pf+~qwh}zD
z6$M=VW^Vm|f&=rh@z$+a=qbiW1?P>nZf_PU-3O|4XmCVGL)DNQ&1L2C5n~-cq^-ga
zY1WfQU?#8jVbtuw2$lN>)V2L#_=pp*cV^J>-5%2gQgX^m<;i_1E3Qco^k%oelQ^Nc
zkHAaSz%sjncP#xkpoRq7Zlm!Nm``6HuYeLVS`H4(3bUqYB|l{tjkYK7l7cdIJX0TW
z0thwPDM*teSUsibcL1Sg7B5A!2}iZ7P17f^(LR@Ack0;1+_c=3nIaG&*Ri_UjKAYi
zy@!Y<Z&g6@KKdV9ILM%seu0GbX9N~8BL}D~OFs_^Y-TpjZyiS8*R_=uWK4E;#iiQh
z3Db3Z${Ee<lx(%?K(6N0RV>*wt%9`4QAn04*R5{P5tvrOi_9hje9Lt^az-?LGmtxV
zXA4B$)pP;L5skyv`1iAbq%RF(Zr1pjgAYbWtT%5UMaS2~6x#+Wr}o0ct2G%OU#e$D
zpn<5qOXBDCJkoX68gv>jCb}QOuIxHu7zDN?5aQ@8<tMVmpqCF^!FpwkIOgb!o|HV>
zk6moVB)C0f|BolY1kx@Uz{D?Z6+qVZ3~N90LP?I|**g6>ZC&rthSH^YHj9t#DU?N9
zkGj95O7YB1fh$otUlcuVH|;lhF=;TTc$NvCOd6NbW|mse1Y~FbDxeI8XGTE%NnRo<
z3w_}m!-s5W{Y7W+++1FguM{OgLfYT81_)#j1L{PNTtIpS_1Bb@$`n8mTZ>t1$0KcO
zGThdd0rgt)t#WskHXPESX7>z?RX!z5eD@d}?KAl00$cR_p>@|PQJdWy`SBeMCFe3X
zr}6nRy+kY0#9<HSmtinJMxPwcj%NQB2gc$>TA0yamS;orNdF0j;<6ZB9mmHxqI`t=
z6>kcWmDi*6hfw|t#&{9B96j0m$PJDaw)-qu?MVgdjeeF}s%J)5lC}d>-}I)BswIm3
zYEqO-mGa~8z9Y&l4Q-|Yv>G%@h)=Aq83F;RvS#^E0P5a57sv?c@Qq^d3J+8*Oxphk
zbTe-kdlq)ic5Uq1+!Cb^AoG$pVwB<5PdWmE6$=(Me~qQ0d~K0VZ{YqMNe2bWDBv2k
zvrM!B9c8|tT3CBd2iEmpY4w+|Yq6CWgkdY;gzx@~y@rBa=}EZ-q8>eHuw(mw1)1Hu
z6je-b*r~!<-vkBJw6>H<chlVBO|BHdMB(vhQoh=y1!7{%dtSh#r@AjP!hO#fA91`n
z{D?w09ADp$8?0w>w@RTB6rPSxw?oVdcQmDL0A!>U#9%YuIfk2^1oFzJNuL5;(hZ@o
z4h(UxKNgY=<V`CNvIb`?B<yB$kOD;shu3qgZGNmVd|~{kuoUca+qZCNXMPt}+Cc(E
zY}?V$Y{8-N5o+qy`eNW0z|@wQOzDY#cm672;>w5+yeo1rhWuy(csdTqZ?=d<U*`D}
zR7Ki-@_g-*w;sHLrxlupItGzDj6xw$v7SGJ7{e~caMr?c)R}s>Re+3PCu$bLLhwF;
zH0`JY{6kuEqGonIMxU!`N$+F;6Ap(9<#^rfj@3j>nKBr?0j5c;S?Dpk%}diCA=5Kh
z|5%otD~&~3p5+y&p)rc;8#J0y)4MSwpy|bFH@2p+fLn?X!05ua+_|T~Pu-SN<jdGt
zVM@T<Zklg&e`$>E`&~c#x^*a!<jRkqy^;<(RUCq5PqfQhpviV5&77(*j#P}UsLIy~
z>C9ll^Hm@{Gf7fKLV)u^RFQSCe}r8NuEQV<yAmOW!2K`wmKE$uPs$FkYAv69?AS2p
z{rDbpd}_oiJ5qlIr+Zgu5NPjs=}4ELfH^tha|FRYtP^LFh&EAfNGDu4Ojw=u;6(lW
z^&g~hf0a+Z9(%ZsD2`py8BFlZ+F-Qwi#VDc?fT*g+>rf+Kd(kc#l(-7;Qjb$@Sd`8
zG@glAb;Nh7OSNFjDd^vtqrY{a(GX3eQ)EiVcIv-GZ{?N-0c@ukZ`wJ_+HaPMX)uk^
zppoZ}ac~Vw>CjbvN4$n!J9R1jx(oJ}6ytI!;bLS6Yl{KVg8Pq`z%|0f)KFIsmB*`>
zJtKpBK!~nv0oX}cu{w9c)J*>Edp(%TN#1;wM*^heKH6!|KZtp|cc18A;u;2eE<CFJ
zry^P;1p`*E<W|nnL`98G)!qH$SYNTTr1XNdv1AB8*<UMbV;dZKwYax@rvI*$L>=%i
zIFqtLr`_`vYzelUu*#;D4JD9NMt9+j{i}&oK7fXsHlTt0V1bVseYU~;(Kpm$ke{Bn
z`u9`F@k?#3jj6HUItw49Q;;T~Ckmnw>=yMptpB!Ib|hzVFJwhl->-w^^_-ji?7$6F
z+0HKe942(8&ovdO?sQ!)WL;k$bmps8_(#~e9ZL*@FtjBTV}tu|>|Q)U%9pl*o!LAb
z5Yk~og^f-bUK+BTvl+)TCxbkrm`H)It=qZ{i}=`trX24a&?sD{yqgU>E3E8-Sh8$k
zg6>m)Xb3xt91L|KaT@=>y!F4pyfA$cseM?*4w+zf>kLgN1Kww{<HMI&uTPf^$>*GS
zh*wxhg8PrIs)sZ;IFA}Kn`&8#ja)A17WAAwAA54s(Mz%k>8P+UdJ*gc6I$pEw?x;u
z1*o|_Vkxa+bs(x}nYta|kOuU;3mAP@<J8(F2?}!y<P0}9c4h&YPnXgo^eG$sWWyR<
z>tqjdVW}O`79SU+Z5kr-<B$%0A!&oOg;&#IuqlhKe5Qjv_IQ%4S3@D3+9hP47)`Ic
zyg<PYRh34syTgPE=}rPoM$f7$9V6$4mZaulRb=g(f4Eac`cW;B>q<CU%MbDL_N^u?
zS}7pyY#G(u(PG8*z#VxZ6QcM+2Dv`9j+o%lr%RG`kDYqWpnH4dM^|8pm775r;~Xp;
zBJ>fNFjY*av3K`dRi%f_KDZ^Cn&lgZi}e_~+yp<`q9ht%I2F9d(ADS%`W?|!$<<4d
z%gxe_+08I$1@IlwREBACQPD<oSW=uW<_}}96CCM3!p`hCVi<;@9c6gv?7y){YYWiF
z1}R`UKGv2@5O|vu$~S{vvnRf3rqL4Loaoc%RVOMG{+sNI+vs$ycKt|9PKh%m?7SU6
zfr$F&jT1(O1-l(c(Fa|xABfo*5;2_H&_R0ZKRxl|quEj=?L-w6jdg5IKh>{B^Wh*9
zPHlip=8sH;S{Df;x#@%oMoudEL$*P~{96uCKYjVFEw~iogGpyL8i9OuBILnSuJ~bW
z`V7i#mK08H>XTp=Bt*+i;_Xaw9CGUv1{-$i1EJ*Y<ffDjO)B~%NPis_*sOK}!M$$6
zT#*$n+k&HWRc(N;(`x8rz!tLSMTV&p-7~$D4ughmWnROBn2mlWzyB`acBPCtVF4Xd
zl}m8Ls^FIehT?6q!jKS-RpBCcu~ooffSrjfHNT*V=JCM3efj?OgLhDDroIkXug!0C
z7Z}|pJBV@RoDql|?r5Y|?V1Q@Dgg3!$7RXiJT|#+3h&qSV4~-9Xal}8v!=d`1KEG|
zGWAEmFwm<mFp-^n0nmC-y`4>0cr}{6UvqXlS~3DrV}@1*Oyp)590#*DOyoWURZ$_1
zI1t$=vgANx-b<4=^O$IMh!H#U>)QlUeEB8p+L9y)LD-d)hsymgwo9)Bzp@8ts-~w!
z2q970kBC^0NSfe1qUoqElm7~kAlGhE#qstDcjswdz^WLgvu#uT5&7bIUI0TLS!gHD
zJ=nPp;m%*fBfNJ&<<x2ozbT9G*U<XSh!81M3+<IXX;&pWIzmADc$V>ek{X;gB%)9T
z2#emgT*dM^3Fp!Gpwjyv3fyPLZ7#n-4bLyCy?5F&incd)4nlZ-QQ+cZ*5{D9X75KW
zm;M*epr(vvQg2nR>(tEZlvh96{)PfKIk^qV@AE$R<G8VhU8%EdRQ2{Fi6{%tPuk{&
zd*RNH%j~eU(^CF5#Up14hi|c3Ez9*fiiOG@(<Ij92eVJXvHWZUc!XIItn~l%GYN!(
zVAwwqFgP4wX3V5wLWt+DG9(eScaVF3M9XbGD`BUNne-OT(%vTz!+soJCzoeRa~w)O
zHc>l`ZTu$y@o~BRL>BgPA;g(*E*;=XYn?@@|K*)AYgm;62Xp~hTI(!Ij?%xvLn=b>
zi>Bu^v3uyZwfz-`@KfzTe1@xZ4XWN?3C}DocDC$hw=5yN&UI4p_}ApXAd7;S?M;)N
zrtmZ6PzLyOv%cP8`(n9im1#V`y0u_iAUExyn0@+w+le2-&M4V+5Qd>UdIJU<*#E{}
zO=Bq^chm)xNfQ!4mXH1zfhfqJmfJ>k-ljuF{+_P00=!;Cf5m<7AH<GnzDPYb_*uW_
z$p>e2e*6b^(L{sPVd(Hn)k5z<E0bn0a&%mbN{245xd0aMRqWsyJ6^R*H`ya-f%%A(
zfaDpu^GqaFD+>n6%?VtaJ-e2Z86>h|W`XS2UL5anS!<_ct8em=7-6!4{JhtBxH(me
z&nKZbvBA1wumPk@-noP}{TwhKTbUTspxceXsV>{|EI`U_zG1iWO5sf$W$XGHAV7XO
zTF(e^5Om;2@4VPZ)57+v4+bCDX42DOPmN|?bP{-P8>|ffCz*Ah0iZx)6P*2hlLJg?
zk2ZqNmct*j>O|B(`*<k?+Zyy?cKR^q%QH6hU0e`+X2oP)aPLC@@(&-Su|U(-fMn#m
zn)(w(t_Oeu33v31jXHAmlI0m&;N)&*N^d}uZ+%{00VZQW!AxuWf~4Oiq-@%P8vZ%q
zqqs7_5=z}n?>II-j;kBy0uoSq0-B@_Ya1U&uXOI*vp5&JrQd3nXW&h_DVw$0XY9Kc
zYhLA<MLpah!)Bh~(Ie26+lj{C$6hy5zts$*iB9NUOot|awsHgfC+y5}BZgrZdZR*H
zB<ubcD?AyK{;7I_Ac&Jd3&|Ho7)@OGlBbiz3H|3V(O%av{(dIQMxBw(M{%J)5*EEY
zQMp@9pliMbwllSy$O=I?LfI&TG)A3O3EFE}Un{$Ae%p8w%>g9dhP_cY5-aB7kNX)f
zh8fvY@O1q%tU3Fc4}Y4C1S17<{xQ%&qvpoCOPO*z&w85JkDF9_4en-;P1qH426)M*
zu_9Aw1lhdugF~BOI@eR&u0)N3FQbR%xw2U!9iexra}nNn8|x&c?V(FH(hJ|{ia)R5
zf?-d$5FHYf>#t{=1iRpMe30mr8*+drxz@OuaJpy^=ouwoO_Yp^GiS<K=SgGV>AnZ(
zv*&^1ki!L%vv6evt)=v}jY|PP>zPePH+1*b24`HV%m;zo=5<Wmds%mYWBX;Oo}U9e
zhSiDwUR0nm>e>9^f_b=FV1z2koHWldGsS755nGI?sHEZ4#tEojE*c~3D_rp$B1gTJ
zb3tRMqSw!>MteVs7^xfK-v!NQVf+0scc_FeSgN!}?VKzAka3YA`$X;TVatm79)d+M
znH3(?jJ*)H;R;tjqbPmi=ooh;KbMfMK(%K#_`45X`TfXzm<2)VFJb3)B{2xY(3bE6
zaQbg-mjoofGzAPNWWvL?d^HYNYI$KB+BbeAg2UkX3L)f2RDd|9bXGr%?s4<}D^8(l
zi4*k>=O|+T-*`#1ynsqmx5S6TJ+7RDhHOAYWa!@`{a7QBa+;Yaw|(R=F+vdc(L3Ez
zJLmBHm;+IejmeVH2FdjDA|3RiX+EHDeulFPrpW|k_+aA$W1`HCkmS)z!Y4^<4+89A
z0A++O_=SVJH=9GLKD;`E0llXDp*nf{WG!axA++{Yf7Z`%dC@pkZ`Jo%^GY)HNkKE3
zFA&<*6&L{5A~(xr8N5PPUOK0V0bGVO5kc!WV}U15N7K?dm7YZ6z?>aj{nHyzw>4$r
zEG{n^GJNux(1lEyv<i07{I5hO6Ml;a7rsz-Fh?MsvFNZVZO5(EUOt$93HTn}+0$>w
zK={3i5B&@`2Qul;G>~lRCB>*g${9WQf*$LOt)*piLCRUt!`RH}YpJPwk;p$jLHdgo
zeOz+t{c)FP-rb<F+Y;`atMDp=)5yFSI0Q+K!lL?8vSI`t*oZ9`VAsKc)V^&QyF#-*
zfut_jj^V^=K%M$?*cF;pIkyIw__rNwOP!MKyKy>cY}1mz5%Q0)E5Q*M1c6^t5s?3X
zY(pzdlg-Y4z}SXbWG*Yo=FW&vUJg-vc<rdJqWwsl-o>P<Q_%rq`L)2E^MJ=c|J5jz
zU9Rg_aN5K2pxCQu)6VQ;@~W}>XXRW7Es)ZTPP)pENxE~{|FnS6(x?D*Jlk57^a^vx
z3SE=2qk*F6W;&aDel^lY4Q)&u4+DOdG5G<bZE$~LcTH}w=4JfD%ase$Wc@E#<nOXD
z%wZbmHw)x62iIh?n!v4V82a}DHUPzgB6Cc8h3V8~K}t<Ca@=%~P>us;QmLRAt~Kib
zYO;IArMQcxG;JxE=CQ$S($*W={;qJSDY`&Qqo2Xefs5nfqk_U{B%`3)X<~GG@W^-;
zdeB?vy&i#yVh7MYc{awM!9SD;1@gISh!{E#U!jS)ws9*O;s|WuO(Z~?*EjLbq}w4s
z1^>L5yvy;G;@-<)fi!6=Irxi29L=^GL;AgHzQQWk!S}F`y`c`q7KEpp3(N#SjeZPP
zcZ)9`JvaTX9fR=_;3moAYSQ(QH}NfW6KTtv-x6iAkl|}ikxRKiO)7_5L6VVQjznys
z_RaEfI~%k8pNB&<uw?M3fc&+%A<q=H_$`qyn3qHJ9*W|eM|*+L@k7{^Wl0Xguq&|`
zu<w7dX{WKo{HQO$t5i%d)|Pq(xqwr-P^VoEz)s^lwadBobV$2uTjh6oGdnFzw@(i9
zW~*(LO~@#puLKx$Ni&ef><K4d^vcyFo$1U+iv14v(YR=1rb(P;H0G`P@kw&=(JO4`
zty0w<)sBDM5PeuW^1AviOQN)vyrkAd`L&_syg*HEW@OrUZp(?puc7PFgRSu6m|+9F
z3j1U1L$|a4JX$Rl<B9ZB1XDJR;gF|on4<r@7g>=(BpY61IgPvDr;j5c!SorZ$WQA5
ze<=seTHo{o1-T|e5l=gGf7X3)nVrqw0G=x$Ih7!i+-v<N15+P!3SoNZ4b?*uoaYls
zvjUT+RR`{;gI)3){n(wgy4+>PlEW1<w%*tQDBHp@$YiGWPDP4(6V?#=dWtIkt$<Q!
z@)_&`H5o_{gDT{Wa^6~-0Ifh$zh)Pw$>z-)Ns!1r%UBmVnzswp<WGS4Ud|8$mg-Xz
zE3DzXJ{Pu2E%3TX%}T|g?8B`=i|xT|^EOM~HvUjsTIpz#s?=z`d<KTOL&wqB1#0q`
z8H-6%V<Pd@*3tihlZn|uAl!8$>R&_K<qC8=i(ux&vInS<cL5_%<K3SS6D%;|ZN2^x
zb|ps+10gUa2AVnYPi%!OXg#)20+h?f3`ZaT1fW5ZqlQz@bw?mE`_m&vt$nV-uwOp~
znfbfzd+^+8Vj#^$!7WJYTq26~5sHevrc^WU2d}GJ3v$78rwKV%e_4aqRy%M*-sbe6
z93=gJ_Yjuo(Xyg23V3#vg957CPETzKouEDfP1=u^1k99VmyOV>ZT}U6dXUZw#as!-
zjAeD(xIpW{rbNOyTIx{ncCbS-X#y&^>297>!@KEdSMyLx1Nf?iF3K`?d`Tog%Y%4L
z65KT9DsH2LJ|SsG^Yb`+fI3Rl)zpvA;FM_)Le;@j&-us(CD*VdRALCx0%Pu8LIui<
zH0IM*seGE&uEvp)XD8-UYW7a0hV<wIFd>E7BSy6`*Y*gEmmkgHUfU0yM(0PBwwh>U
zvwJ(Q`Syb;2&;@-BE&-CA<11|>5rDvM5v5Jsx(A_b9x>8z^YAzDv{d<<#1B!HKJL&
z8Hbfak{zL@&+^)g4{NvcuzIxxa`@g2g3o%02Y9SmIi?4Rz%0K>IlUtw$fcow$1T*3
z68q|*U!Wz;PLIl)Q1Vo$p!)T!a)7V)I-7i+2fr2%z-aq<fMD@S>)ES+wp@73|G1}r
zgk9OO#2^go=uH4ynEo4kOD0J9QVIyOS%~qW<Gn%`z5gO=skbMYZg*Z}&qJ^?PQ1>w
zsU!R>*08OD2qAu6KE_Sco&|qb1Vtf{8k=<jt+#Eb{}Z4>UursiCJVFjljIPYCYn5L
zkR?UNk9{bq$gr-e1&Tng@acR=J*9)dh~EhslxFugc3wKq=eyn*hY7Vi>?>$YgM}eM
zM_t*&Q<5U-K|H$Z+i@tox7w(Ee(?DcW@=rH`v~9iiKId)N~$AAeR%_qyf9Ow(2#At
zyh;}vU+|#+(2QpFQw`K#3X;0K3Ss1w336k7oM*Jqc4V@8xsflwuIhqjEU|gYCtn)T
z(1Z9sfS?d!_{jE*Xm%}jO2a#AEV|%TT0}uW&|GG3`9R(t-`Vil8yFkog_$3C!oqI_
z4{QxcJ7q|VJI{!w->fLR0FPq<s?kSDxx@<^1sEFxDzQ7CpC9KL;u+>-pJC)8{O<b5
z9zl81w}}b$5q4bZcDfNLT@c_-l7PH(77ySH@UHIATf`E=rA>=)30cwv4I4ID;1VzE
zvJ{S(vX5KE40L7_Qaj;)0~?UZ*4d^}pKix(3~a;OGo$$@?257&20_@B6anG>7u)ER
z^eel7Z?AO)l91Q~mttcxdO7Ud1XCDQx4r^fJEMI}%$A#jZ+b|YXMY9Er%wQY-xKHu
zZuf{S(|XJgS1?U`@h90N&AMxPPyhbv<rjypV0VUOZL3X&)*FfPpV0MMGZSr(^tNIu
zWtudaHq2`xQ%HJ4SGCMb`3VgK$ffsVkZX8RNR0A|eOa0!^L2t77|o=6^1cNujc+KW
zw<GV~{|rTe{VvURS(rDuY?i=~I-4u}&O$8_d2s6810iudIC`X6!xhSTL*^E5L8FVd
z2HdbC5NRk}NT?Aw0j?c((*U0cIOP`#L$=s!|6n^@+vvvu>ojAa3;uac9!E&7_ST%>
zSlnO5qMzfR=@cYQh;G=sOP?T%19&hz+o`YK<*t;kQ-8?`jf-pUzE0vt-&>#>H;mN;
zk$q9bVp4C^XhqNpb$3#v(x_VtRBT+!*|OlL7cv_dp9v>wIL?-LhVyrc7?6mTE6Ghs
zDw8YWWji6Q=!~OEz|a;vZSH_<ho^bm3z5dWWj2vLjB<7crl!r6%KRkzfBCy-<N(~r
zSQBwmh{aZ;9EBaGrh4HHUMQgcYE-TSo16e2=W4+|gq_*3B_Rw$Gn&E%8%XU%KTS7C
zeCZ}Y-32gSbabX`4ZZZwcU&xhPPW-ZcG>#w#=rNiUI6pC(=WSwqlBWR3|3J(sg`-!
zbkerV`;UKufB*pSRzrE9-SiwV{TZ0nj6lVvkG-YWGqTBQY#42bXLBNf64o}lOA-b_
z_Pm@vCluYwN=pWcFsBo;Uy|&7!Q~<Z=rds;1dJoYeFt<6Lx5cyYlp$~HHK4J1bEyN
zYBVn_2tA8=8ZB#RZYKp#j+%N$8dZlFFsc8(H}c<xGY|a{U_<;NF!!u<9QxeKJZ0r7
z40ZATwy$?3bP%qoCmF*q=>sC;y5`~VQx*_d?k6v#S?5)A>8L!pOU^;im?ls(dEu&f
zf2F>ioSH-H5OVaBCO>DQx@<lM6*bXl!JC7)hpNYof{L0ftU~%A=fF(ncj1WH76q7i
zJ2ae?oVmUm91^d3j`kW-%7%%~I=lWI*r^$~rR$X#O-<Jfhc9+skH}_M<L}pgg4Jd_
zzNst9782U4o^lClY6f7|%Pw*wYghZSOZ{e0Q!{IY3^rN;HO;GR7X_JTouJb^wt_3_
zXVnX^^kc;dI<0ip{_!0+e3piGlMObkKFOI_Ay`tzW_lylf5NUMSz-_bUP*;Uy#K}C
zGtnlip53fcnN)&6|K8VP%JCA$4swy9yaR{gR+bD2v7kU2>yt+v=v}vUxX}NAikg@C
zd5Ez$abS<m+Bq0jZ{x>nA*_?vkX=r8@Dd!xcdNaqsQLdbzX+$`aH3WPEjuUu)Ok;E
zCNI1e+GnVVayA-6s+-_e7V`xTJX@r<gPcE3ssd?{W!1GV+O^#^wG|C6O4GNyCMPqP
zF^ptJ>c>F3I7N>;JZg<{qHg*YDk+Ij_;%+Z>^O86?6j<C?4$Q88<k6_#iMXGkgYXd
z!LB~5?_G{G3BZMEPRD&+PIDCjPd>zp()f-TEtQ%_DL+kje<;h`nRE$QpXI)On=eYU
z`9-q?Af1Kf1+c^goEt>{lr~>veWli@0c;+}Gy)t0#}sos3H16NxbQ)g!zo74J=s%o
z*8mRK-*Cp>K@-AU`j9Fm&04k9Za3Oym!=;R5x5tRR?~>zT}OWwfbvO3g@9xo_hUH8
z>e)?Sf#tD%O7yf~)AGZ40~JgIHVivE%x9Uf$jujm820kX!Vs4n{E*G%R~dz2lU?kG
z=5Z$MF1;2IHP5)Q2_8v%QiN2=At+t2kIVgkPhSa>?R*t~gk1@e!!QW@lCdoV|Nq#o
zlUhn=XUPM~G-*n}y8f%64Vxm|%d}sk+bR(X2&u6lNe~Zg_V_rWzL6>2Kzjt%53W?L
z{wZCKkZE)_@<)Xi13kEDZfQJ&9B!l&^g6y4N~NK*(dKV`2G}dKvs8Y<X`|AV=oiPr
zd7qEh5o!=j6A;_|_baf%4SW<8=%PXnVgCwrhL=h~_)=b}^p42Mh$6R_3a*P-M8f^>
zVr{e7OIj;j9`|Wv*0vBl5p|38eE6CZddx%a-85?}PeBo+RUl0Xx{rME*-A7XVbVTy
z&W|@*Lb7;SpeufC&?Bn#Hbko^F*}5w#}3-2&6I0eog#u@e_ThbxSJDJ$cL~#BnUo_
zW|NHhWxNTad3_B;vMm?ST3S!W=|znq<B>^&j7N+xmt)i}Q;_GG&5!<e%O_88>z3d4
zdYK5mvCWkZwC4F=?wpqrkB2~-7?MTZpSpJe8>RaQk`1y2l#`CdT$>km2U1K(n7aIM
zzN=Op@QvgU=~uTrynT)x{<2@^)Ceed&O3baR*~F{nW6%TkUdQvqcpSGPilRZE8{Z-
zU~J0}?Utw&k4WV%VDc*LSOi>f*WV8LL)aN)K@5U0^h!XL>isV^L)E0KbUO>DwmwBj
zKJNhrO>#K$=eS`?&#4dWNruYUAEJbvr<?KfRi(rv&G;4!1-CfD+G5<t)FY5GWiRsD
z;ZV<g*%kwEJpwZNFymN+_Rx=j^@uunsRnoORX405(}!t|TuIVwmIYvC<xOw%X}r{g
zBLQj0WmicQ9W|tpF_i)GZ}tvc#77{VhR%kkeETS4IvZX|QEjqBGvVL$+(PsEI<4#f
z=Y?ht98?`W=$iJyq#JhyZfzb%09dWS<gSo((x6Lw0qF-?9o)J<QPM~gK^^8qb8r9Z
z<(JMjo9HKaEg{|!*vLA5dLz|xQb&0;ARW7XJOX5Amr>5pVVx)-iA-guQ+Q^HPJCB%
z^vL|*uU(Gt(m@V{;dww4^|P*Xr4LFmN!c0$%egnx1E7Gt(9=8h_hMrXeILrO7x5Ms
z%Z~C)r6QXg0MX-OEABMIAc-(^x+MeQqql$!2IA<79`zLH!=8!w)lcHDE`=r$qZtrX
zEEvOP&5n6|{e{8RbHLuXa?VGRvEzk0r8F%ggW)4ETe)!yFbwEf+!O#d?9Z?hJ=W$+
z&w}gm_^2P;91`l&KVHLHk3Yh$>^fi&hHcab*f_BNVyzP_@ue=n%fVr+Yo<?EAgjt3
z@)pLD7t=84UcW5faz(F-XK6ZW6f%=;E1M7SFpBSUF%~0?3&dxZaxcrasil%(MiU(x
zl3P`6sjc#^M*w!+FR0KF*ZQ|4-`0f~VHSQ~hg53Y7P&dC%PV0NHk0=DhA`({pE1cf
z`dS+HT*;E~b)VMJsoA<=6;#l)R`edD0pOEii*h|2Z00klgA%-h7?av+sR|2k)I4mq
z?JU6e|2u5uZ1PTbQPexW;7ia<e*{NHds`bu8LQ$obF0>5)+l7Ao!?iqy|qcYlWn_j
zhzxg-n`7;)%A{y7eM~v{kKNfwE^hNnp3?h@qt`RmCFDky;5-aGF#;7`QOi1Qm`*Qy
zWg}BI2%^B5Jlt$Btrg0Rri-3(I(yQvhlyhV*>-}j@(Jd}5oapUo(J3+*-h6)&jh*0
zg60U_3_J$cRvS^^O!^jGOo+Ohzbt1xohAvn*IOV3Z=^AlKBlJA_GF=gEz`N-|MC8U
zMrV!?<?%BfC<dD8^0UyHWQA|cCa+G-OX8Q(jbI#2x5j*>N_gsNgRB?!M0^|zuXK+a
zS8(ps^Jz1a+tGvl0;A3bIrU{E$TmY6|Lo_Nuq!*37zSY-z3~wP?!U3OBti0*(tszs
zIS`-&%DSb)<IETyS6PC0`@r4IBR3K!K+@ILVx`)~YtS8`O;(9o_TB6vXu?+0&Al<J
zYfmgCX8B5GPxtXk7-o;nIIcqWTgDlF{S82mZgU^e7bW%lA-9iT0kYX(<U@l;{*^9@
z`dNr0Z51&n@cT$%nGV%4<1pN&)4IjclKpx;`CdBUW3TPbGqnQ%4cEBE2_TPVqz^;#
z+6PC<{IJW#02PGZvGP%u_tKAkW??^cm8;Vu3zHv6CerM|QFMo=c^due1L#gVz_TwF
zYHn7B9=UNh)3yVK+x1q7%&cu6Cpc))m~*5P;WpM=-46MgW=H|dDi`cb2GYYOr*BFj
z(7X|aqf;HHr=P~<%=V5PX2i){uaZ?9&}l0`LrnwQt^X}ev$7bR`*pzRx!$HOZIVp)
zWI^LSS|flYmAVh@fn$LWr2C=;b!*Is*U%|oQZbG|n=o9#TptHefIX?kpA}h~so-1R
z2bOE(DgMf4@nA=OSoCd(Bjhw#tx>G6t{=wOBtkd{Qc(alDFmTm)4Q0-Nn4b;Lz0tU
z*pt9?N-BkIn5Ohfow&WMI!s05?w|h&JHsRkVGsu2Xa}%u<o*}iSCz#5vAhd(tU6Uf
z_|mMvdM2Qd`S7F#6+JL`rP2&dHZQN==y63fwMR>`zK-L3rDZ`jeY8^_t1xG~MY&$Q
zxv5RGe2JA5!tKRPzGEUDyz7_3Qi(J+LGdwjl^E||8VY%euP-3ySORg6e&}N<kjCDF
zx3fMI7gw~q4KR8svZ~v0*+|H;wB8#I6PUD$+jGaVF!ti?iFHsOO_p%CXTL{i6a5r7
zjLeifhNhfaPy}9#eiJ+&=SZr!Ve0#4&&P*aGY9=e@pEe^Pn)i%LctV1?E05qbwpk+
zDevzCE9|JGsQs<0iPg`uxMOXb6(m2_5YUz_Mg^4~-vk?IekRJ;vR8=56S7<I*-B?{
zli2ZUcxKSvlYJO9{KW;JqvJd$>xt+yx#0`|nK7k@v!3t`x<b3cp%p-@*73?&nmvCS
zPR+*|`?a=;DIVtNAExGKRHXaU-+Nxke)bpDp)tJ<yGj>6u#Y~2D}cDr@>}`xNpH>Q
zCk5ay5+v9^x2bEezB>X>VYtDLXT+iz;wDr6zd}%hJTj?>qmb%hpKEI+8-)C3HEDS<
zwI8(n&Xu;-qYk0Y7&f(AwTs6z?2n}VOW2j*Mht_%F9m}Q{QqN(xA9D*s<R)kayW)C
z*WU%8Rw(FAcZ_l)O6Bfu^(CNa_l#F`7*iigyFcduKiq6K9W57NqThHLu>v)Qi)4m%
zBw@Q1vM(?5mC>GqCG+V+bGOp^K^C~peWaTA;|Fu^dT?d2LZ21x{t3jEfa~y<am!5X
zq<&`f>p?nW<V>S9>7eA^KLG%-D}xefje@6R3>olI+zgRI_H7OQZ95bTb$%)~dRu->
z(YGs<zJ_3eFAYvR9-jKAY{=a}0nIqw%bq=+*w>G2RvHVWBloqSnz%MU7jRe2)-Mx^
zu90RmJ|^V$+tr8_D54ooMuIt`y>(Jk`pXv}F?;fUl#*Nfp}pagK#gCHQjr}mnvsO<
zGSEnJ_B0;A<C%YHldq)HS(tJDH7+=vO`V>R6wz3+i}Mq+{sBVueh8kDW0G^$7~*y4
zemd}{4dc7L0_k3^6HhZ1@c{y`ZX~#@FJ(UvZCKe5j3T#n18D2gH^E@+*_2c*LvTb7
zear@FJ{H7DUeVfjRh2t(qK_=dhj-It04d5OCpIU{Q)bYm-wTJs)WV0HgGP!Rq1`o?
z3FC4zO%!c29~{9Ad{oyzJoO*K&L~M@5Coz(+7bo9`(JEh61x4EA{U^>IEmQM4@6Mj
z5J`|}IWM8ddqpWC7y-;2tb^9#y`FL-X`@-e1{s-eGwQVsS0-HknT(cK>qZRYTO{$D
zU|X*tIDzfRLlbD(Hv+NFzYJMq^M-?>8)TQEB}3XL>7*(sc*W|_#Xq=nJ|RTP(eouL
zOs1_wA3JGhFf{G5QL5T)o6O2rYC`$xh_E}u6R&WS_{vvm;>7lBkG?guw{xwJhY(o=
zfCt-9CAn7K7WyJuJ)zPk0r%SAIS5bB!JfZWizXaNGdSygt;EjB-!o*l2ta)Ep?^t!
z9_7jab=8Xi6+jm`|IyR^u@mG{*LH6N(AYc-Q5;KM-}GI64Qz0ae&j9XB3P%fVIYl-
zuHdRm-4^VmosHlq;h3a+T}f#D7!>3c7dQ=90_tySd|AG9$F0V)G5E1gLw)kP+~lm)
zjBI1Pe~+^#z&|2T92ZK{OIsZ5l`_DAxKFgfJ!76*@gacGN8@9m%jE&%zqVDYldpgl
zsgs2IWfb9NT`uwvS|?Zs?(*t3*Vn~IorDHX>?MTQxHgE9O-u8IvsTkYgAU}$aRVPI
zBxz@6ZSkr;Amh!bPt34?!p`i-VHk#?9qq`vNcP{@hLH*A3n{>waiqw+@PJVp=log=
z*4K|nORTVI7#cj(qhU_mrbIfLUjXMuOTQ<8C(x)^yZSYaF1~$N(PaMht``V|v4ex!
zj+7)VJoMixfGC~i_nFfOz%uP$j-htZ&Y<&)48W0+*w&vb3Tb@4+ORK(xx^PIOAybG
zYrGiIQxqR7$0Ua9Ujbt5#|$m~S>lT?qDg-+-)>E&(?#D)WOEpeGMBD~2BOIAgHq~h
zi03uEbnH^JvsB+W!0NNyU$Z`_ZKaL0vsHsG$p$E?;gb{ZuJ;1{nq84>a<!`4l4wm0
z2=&HxHcVl@`Q?H#KjhuuZ@(sY(BAWO0NkjVOc}yCl{CE&fGfk|{Q|N+x3Fy2c)MJ?
z28s<wD|LzuyU82U2|HV@p=%Wu7@JzL^$Lr=gnbee);Ojzhu#UGD!Sb&<Ul#}hmV}o
zn8xR{t3D5_&b?(x)|=DXX3#;S10dr~(gD0di#?1=l+Sr253<X7A7{5_Ila<jlag?z
z!o&*5Yt9DNxDMXodrZaigq>AeJ~yS8q$xY}Q@_Jt=t2jMS$AyD4D-?NK$OquivvTG
zx_a#t;13R@!GbL^4)u#FF8|mMu1GikC+ys=BM4y_+7g(DMgNUuoh%YxN&|ED%ramk
z`$~cDBU4T5enHBv84}kUrKcix+9Mks@;M-6E{)hIyrJD(y3Xtq9Oqu^x?VMxWb05w
zlW-IyL&X8*ujP^42=Y_VR!Z4Uc}^|-Z(tRP&CdI?v^9LbT)P^A$*-+xlaA}PRO1V*
z-hh~*gC0B=MAE5p`xO~WKJ4Omd2S+06wcTBu+Tt_nkp-*d@@lvy^aXc&N`DwKIhIP
zOJ{F;BS1j4^q?5Z>)q!@aJH=*5J$30r<D0OS9aZG%eaCjYI4MrOW1@54O=&0bV1+F
zb702ZrMu5+!ZmA((0-_`uLSL$dHjDVv*w&HDZf6_%TFmg&GYv#ruHWdiN(!(iki@}
z3_uL_M7A{ro+GKgio@=ouphR$0v?wb1L0LTT(@S_aN5%L@(gs(>Hka!jG1~uYFKV8
zUx8h>ro5%4+GR4Du-jH;%q9dgU*lg$_4l~5lrB6YH9gtJmfu@;B~ke3SWGg-^LGFL
zVi1>@mL4^RIixC61<d^oW2qKjub4ozv%Ozv$E0dAviYCD{V^XdQnGxj8pMhXm|Tr<
zh7t!B*k-chpBKs1xcN;*A<lmYJG1i$LKp_O1Q;Lm-&mGxM)FHE4e;&ZVSGrx5ejZn
z_+GmK`1T?P5l*+#Im3o1GVK8Feh#O0-}d|eCvYpxIL?_HBpz2PEn6<-lc~6a^J>e8
zjgv~5@+KG$w9nkh5Y%exqNAp)VIG2s&wPnT$K3GqNSx*>=Z>T))z(Gg+2;~OE}yV|
zt~>UT(d0oT-VBavlA@*a@?W+kNra15SA6@+FImhw4Bx`eARfwfP2)%*sXD)S(m)<O
zbeUekMkKP1D^*PbA%~plSHQzCbMUD!&t_ZHp8+8`4G+aIZi@=7R<37ObCnzc-MY;Q
z-Fl=HW>z%8PtlNqg(%m<sIMmy&*n;26ku~+;+3u_IIQ{HD45*YI9S5*EqBEU*+$Vs
zBQ^Nk3SAxs7lHVOvnQT<p#Fd`;sCUL)*jio!ROIlO+EFh99*25s0VO6+}L`_zLLwa
zpT5yAXa7JN8af~oE{46pMc+><ekWOa<3S|?GK-ki42Pd&P1h&zjs&>lti&a4Ll<`R
z)O;bCkM=9j79Sc9T1gi}o#2k3%_X|28&7Rg6SbN$B5CE-y@uo)+p19||HAP$gRFiC
zJGU%{K^TT^$&Uog{x>#tf-UApSwJ~GDJ9sJuK05V(C4bus{{wn>LKc&z5PHgO*4to
z1bM?cDZ#sEfmlOV_?sMQ@9U#s5{-n^MtA%+WZ)Y8b!`YpA_V|EziUI<MvapdP|~<6
zqTq1M>*NIqd^Nwva8M=T0q~EK<}lXG8*YpRU(2g?B`Zv*2}{C1lh!s`-}<#eKzNSW
zD(Tp&gpbkrV<4DDhJsS1J+~YDr4QuU)tJ+yF>f0}9yFXf5t!7h&eSuMWlxY7FS3`R
zq`<|)I&vy$B)qUH<k_=#d(d)FPDPY|h2D@p9XB|$L%7ag*+8CYy{qzkvQP*^d3_7y
z*?Wa}dp0`vut$?HNW~2S<e3Eo*P~i4mK<4r`PrkIwh<S!!7#WR#(#<ySokgNi;gHb
zQEJg>2X0j`O{zpLO!Ws2hgZTxR%o-=s?gHx0{Sk_u7?C@bcKFt$HXx!#VO6vUC?&w
z!mtLxsk*(Cg`cCn%q86$7dz&-H8#uMlPLcVy(e#+k<ympXa0E61<>}H2RGtA3U#NS
z2iHf|5oa6#DsrR$k^`mU9aZkJ=|q}hMB@*kPssO=uw_dX!7={lkNpvLM#&L_FbusC
z27=N3FV;FO5+6I-3oywf%f`lf@52H?QPMt8n>XG6kBNE#Cw6y1gu-H%KQ<MT$MfYH
zx`cM(I0Gs$ZG{TOYBDD?oEbXf81DqMS%Je9yFVIXJB+7-<=Fo^#B(_hSdeUqmi`I`
zv%sQr9*gHRlZPb57@htS*cG1y%DmkZ_FRS^3q{Dc+4=<!4kE*l!#_zy4@cYpk4`P1
z52E5|Y3f5^aCb`*Wk!jp{0bq>(M7Xv49R<qE`&Y9BOBiHsJQ%#7?>3l%%1X6XC^yO
zzg3le5`Aj=e_wqcTBVo&azekT;-Lg5d4^?+@;|D6p#nr7ZY1}XqR0XbA?{gQf`UJ%
zk=bjS3jQwG6py1Kc?a)90@%^~T|n)xhnxI7&a2v6d_)R^p!;#P5piC~Qt5UZaDuEf
znT>T(#_ICg*ft=<K8p~$Vqx$odWC<f2Wcvq5(@W2*sRULPme)f8rEiYaC88drP!V}
z8jT?l$jXbg%0t`+iwA;IHEV`Q&P~dyFE$e>RkLG@KfD+71Je&JVQ`P^vuQ42ZuZu<
z&!OU+)6Ck*bZ*C~%yOgHegl-MStl`9<;Cgg7TNK$j^u~1E4yMCgkdXj7$5sD)<+T~
zzSIHAYX}f*T^xai0i?H%{&m0hWuWVcv~dxxjk)&|1dZ1(PmF-*g_Z=8$7F1QyS_bL
zqMBmVQVYiVE$zowcKJ;W*iW=WR^AT8S}InC@P#M_$0LpIY4MwWilC*RGj8)x*v6MD
zCkDu~wfpSQxo1-6ZmDOX$eSWZxB4Y6>JoP=ifViq4O3?W<;XR=q884`yiT}&6e-&u
zG9)5j2d&v&2_0`@CL8=qn-tYTE3!})?af$h2}>nKEue>4)Hlt>US@=@?H0oq%<#eU
z){{B7dS@@EEjOvk&5c-#cCe@gitb`0$~>&hEnU<StD>%k3vx?>k5&ECp4HPp;o%%4
z@SoWBxw+uFy!^nLC%yIP7{D)SIrWbjY?#+=el(gvcZtOpahfou$BsM=yzSnrZ-9<A
z<d|Gb%L>Qiu+;y-xDtw0z7<wN{3%a;U0iF>Y$Cw3X*$5R93SjAYa6!?m{<IJ6D+YA
zlQ|EVzBxNO+NNlJW&pA`XXjYLY-eHF0W62vR0J*J-5HKkOE!%vAo5D*2rVhY@CrQw
zfI}aJ68pX7f6GZ%mmf^?BkbI+BnDv^+LFQGNB@m&m;{NRH4ShkOagw$S3e}S^C3E|
z=&aY51mS0?O5oKnyiG4%q*wv(<J3k?fuI@gQ9r{smA$5a1(~6a0i91?a_nQG2B;=o
z*bjpdT-`5AI@9bb=(1xAw97KR{slpu&@m5f1DkLun>q3sPe6=k%Jv~1@8S9X0zp=(
z^~04~!O`=Y#FDh7G0nq>m~nj6zONb3ohi6seI4~+o3|`mO&MgBro%8m?5iFwSWf*#
z1$~Gi6<XJ}qIzgvAJ8$6tS;bDxdH8KP%e7CkwzbpNw{Q3qbXXQVAGf8#e03n<DSo7
zpHxj%%%D^}Hwbx+87hdYPvB6mz~P0?d?*LoWqJv_*ra)O%&?L2@lx9ozt>R{n>32v
z=T>82AL<o&J`Q%O_AT*qbg6H;MC{o1M*d=GLCHt5KHd@~pF#RAhW!@BzYg0H6-bd!
zr@dt3Eu4V#x(J#?1oUQy2L=Ksz5NkvV-Nalo|ElyDFxG(Cc+@a^cc)cFF753X~HMw
z<ZNq07A)VZY-WnkY13&CK9i+b%}VGqMOYG_T)~7jqgIL<o)y63%K@Es+y0ENkyyO|
ztlASe8UG{f%91DsLD-c9#pV7Nd(}P?ztRgZ9TzH)WlPA+tSjZn?`6=W58N^uPEpt=
zq_kp`0(J2y?$_@Y1`<|XuOn3ghI5kcsbsf4p3zY#e%6C8r`NCiKe!yBzkzyuMk0!@
zpuM7WoO-=!|1Be;Lmd6&@d0;wZVa%H6UdCsE3TLFhRdz6ySzrv$;Q<Vmb~t_Nt#}A
zLD&~y5t~O+<uVws;y#_6#|95wmt5i~q|?M`sPGF=shdaA<)ygjG)}REj@H}Ga32w<
z=R6$p;O`kat+z1OxxvVQO&8n);Oc-fMqPRxfUB5x!3d4RSF25L1>m`5ks#kv?emDm
z>l{fw%`3s2RS_NMqkKd#puO{2JWr1vhT71JUP%sWJUOhp-cQvC+fCJ>zX5~8TIMBi
zG=YY+q0_9>y{iuN_H)>D$e%jBkWW+b!`t3=#^-pKr{NMmD|9f+6nV7bWrie~hOW+g
z$W~FE`clM!C&J9aY^D#zmdi>XxBUW;<!KbBN`Mn?KKd=0Z!$s!I5!{{`rKw9$2QWZ
z$erYrCR$tU<feqk5mJ#`$tg{rB<KUr`2?6Dk7I?G90X~0FE}O2kG$`cdA>GMi4Dsz
z5>)Xc?A($i20<XYqgyC~y8n$`jnbW;A^%fUCQ(Elr{^64NDLV9NP};|Fdrr#TS}b>
zIVQvb_Ic9!>1v7+%@$hF$@y0Wr*j2^`6IA1w{hN3D(eE80z^y{mzwp<fn7a`MLd#~
zzb!OQWH(|^Mz09qT+?mc&<a^*Hx_W2y&FB<5e<E39Xy(?-W5mwgM+oy0zyc^z~Ym4
zV0&?@Qn@U!$)}JrRi<HBaF(8aiCdxB6ZKAonj@fb{bT!h1|-A{fXe0T0vNGl@mcb3
z2@g4itg6=OTW0@w2AtR?1hJe+`&+oI`DxkMEba)NYCxe&w66a)U~GkqbK=q3o}o>x
zXPz^$fJ=>O^A{8ve<BsdGqK8aa;=<rRPZUix75Rud?vLZpDd+O48!yIjS@AgQH0*2
zJ3+MB!nEmvG_WB@t^UGv(#2YSvAPwST@MJM^20dokd7K9w*VJuUG+sPCBoNx{u)Ni
z>WxUuKZ~#dy>UEHVqr3yJCwyTL9(ExbLA#4jT&K_^ufa1t6A<M{e_xh6XFWd(Fkc@
zj{sWfX|KOoKowkS-1B=n%QS0g4FbLkBowT-)K5DV+b2nST_U$X|GcCt(s5)T7Gr2|
zRm#>!$?%`AGdhwW1c7Kuq9T%iVmCNK&&O>iU~SDJq7AQqEU+>dv|;Y@McF5Zg;&9=
zOhJ}eF{RCrV;6-jgvD)Ev3+aJ;{bOW92TdW0^>B&@dzm1F>E&n{g4=^k-X_g9XrwM
ztrQ!k4dXO3?Wbng+}vo060q?C&d_|eTER+PE)4m}PwGyytl^rS`t9*fw=_zWH6~x7
z$Ud4*Innx;B)gCcgx7Ewsp%h%@JyTUV`R$Htd)^h`yfc9<j<!N9i6WL8QU>^VBkGa
zYM3^|OXQOMF(62s-&(wMflJLqH-V`a@#_`RelGy2=GjP<Vx_uLpKl;M%|oj3p-8cM
z?{;Ak!^_yK)EvO2Rilsz=8}v*8|{ilb=;5l-Z>>VO!)t>=Vwp#B3<R4da5Aryb^{|
zv(~OIYtj3*F2~uG{|1;av_gOMw8uXFe*B*VWlE)Xl%^BzG2P({z%xmtKzt*6dnGi)
z%~!yAov^J_24`Dr6ts<gM%dI?Zpov+YE76m;YBQTn%--osAz({g#bk3*^3ac+HKPg
zi7G`BkA?)gC%wY)MWDUGq<WRd9l#5o+WZTdLWhp-I`D1rfc6SUX*lY9-t)SL%c1kn
zuz-*2b<2Ne3~z$|-`MVturtcC7zAPHmH<U%{~McUt4Y5y8{o7(Rz%1RBVcnh5cBu&
z-2hkUp9NVkIjqJq-;#uYko~TA((G96+*bBJ21h46cgW4jjU`R9kM#4>2p?)}$_TiF
ztn0zG*Ar;<zx{Cx{S3(0tC9-ZBXRTJhA|XmAl(4sYagHQx^>x}^O>e!0!$yDRB*(_
z$8GBYIgy%fOxHzlT6)31)KaEvH?$7RI*DQZ)HJc7*z$7Uji&8I{7AP2sh&QyIQuj(
zlI_n>@<L_ThJFOjR%Bv5In~rnS~aFS7UZ<``7ckE{!H@em++5i`@L4LV=MFS^R5%F
zQ%f`FLc$%Z-LZu1Hsop`_iWvS`?y7S9Ac}cehZ}RhH_xTDGg>Am7yarWls(OMl9@+
zuhLpXzyY#1``lL0aq{)Q77->*X83E5W8tu+RZ}+I{KGw?8!iD)^Gp<q090ff=}PlT
z)O<tM<;A*(5zW2O(l3-%`&i%Qcchvo=y_@PCNwtfTz`ciUc6{O+WfS#V|Pnrb?HGe
zWOSUw@3hbsBInQnI*B?1J(9d`-&-lDzhc6jIXK4nI&7ectRoDj3C@Gs{Rj{HO|ON(
ztPl8_k6scN^G&K1^8v5?5q4$S4TCW7N)|#Oj@H{ZIB15CzUc)>Y%tnpfjl{TkYf=I
zy5zmkprGQnV#c~uJ7gAZ&g-$%OE&(hWr4P4OBrR(h~^FQe|66MKo!IafK^y7a%YQm
z`XZ%e7Hm!&WRh4P+4&yzpvg$2c~+;t9}%h2fi=v71rfjLW{cMIQergh%xFG8^?8r%
z7+HcbVA7~N%n7R?r+p6Mv%dn9Vu8zh!8m}f>Us;<cfA0rYb!XxYsPx;2(|?dn!MSl
zceZR%3g@}R@~6&OI$g3SjfSAWx0$a)N2!uLo5!Z<Sb@0FVNj~Rg>|P8G@(YG3Gzm!
zzMwk`>`B1CrK6(BDT@K?IFSpA{d+fCCp=l!Bi08y+H9k)4lTq-da8ugjAnDoIQaB*
zh#@Wu{SbiWW}DcG0cp%#Duvz(5WCzjDMQ%XY;|VY@iB^?`DM7&`Xnc+=_6S~nwmA9
zG&%#s19zQz1;Duhp@!{C%)gL2+LA`&{scP>=ml#p+AzA)M2Rfyl4xFZ?$ie|fIJ&O
z3cdSExKq;~1!*+j9`reo<;}OrijpY!bu&Dtp#?&|j{%{Fe+nAXXa*X&uRU*6uVPFc
z@`HEeo5%h95_WD`5`-WO-IDk~-P){v3QLmuN-v-}cD)n=xfhYMv)U2rhJ2i;(L5hk
zm|U%v`ACT3vgTt~q&e_8XbUa*$|tF+^4M`TnotMxacajY9owDjjK~{(jV5xcZUZdZ
zZu;!SNg7Wi?>NPdakbL`Q0X<01M9cD_qf1a?bL(3paUSmZktAcrO*JcH2qHaq$MMJ
z-`EuqCZ|hBfC=BM_TeRU!nd>zZq6d4(YI|o`|qmjq-@g1`O}r!$A_RQ{rcazfV4Sv
zXjNsgwYK~ymk?0n*sSciCIepiZ#hszXslHfOdphfzmffPjpzuZf$U0`_$+;eNm7%y
zf)Y*37xVbObX4Dpu9kd;X@Fu2_0Hk<TDv|2()6r4d6jcH*6@0ViwJ~)w88l@&_rU-
zu6hlh&a;LIU>kQN$U<XLzo$miKrMJax0zO1D5Cm#{Ae`E(Ky8S%aOHcE|7m=an^9B
zyb*bQN`_Br_#>mBNVArM0z2!i5`=MEnffwx!W#_qhXvU(j%9k&Uo?fxyef7(Phxnz
zh&2(xvu(dFcBGaCdrsX|VL43`x7?B0mE>i<6PJ1g5U~ODjV*t(+ET{W5oma3v=tvf
z`<<Q<c_%hTvCAM}ryr^D@1L+UxMCQDVdzTO;9&M&tc8HYNg1HLrqBSg{Pk|WA6o7J
z=zcWT1`@2*MVORNG5CUXwt+Bfa_TU8E=Og&pk1+12FikK<G&3wcr~v~Z^%ZJpv07h
z4MO;!+5FeQIEV2`3or5&Ij*=QrrPaZzgc`Odb7LQX@YIYBa?TUs=q*9=w2vi|49ME
zFLdqH*iF*`qL~-PLJFV^PYu7aY2X2z`XB1(Rr)%-7%!KUQA>HyOY@Qj#R!b1sZ=Z8
zo53DIhTDV_clJ0rgpX~9jMw=qxEz6isoJl*;ofg&f>@U?X=gXh8xFj48oeXMOv9P}
zBRtpX3#-8o#LpL_QqN^4O(&WBe)z*vGRdKzg02c@lx}9Q$`kVQBm)GAj`lQIq`S%c
zts5k9!|QE&WRDs=g<WZVbF<4~!}H%+4Qtntl}l$cO>bn3W(G=4SwEfvE7Dto2-xaA
zx6E_7_UO2wkPVylY=CVrwaV1ba0}Mr3$P=_DzTK>nd?NJwbMJXqP3r3P|?sMbOd!D
zR_j8oIfEW012BBoXxc&tA;qj51K@0g`Iv}t9>NdYX?4&h{Ghe!zolcxwg~7Y*$U*2
z)SXq%Xqxs=!Fwq}2idW7$RA<XmSr&r!nP#f1NXnNQCku}=F$a}Q%_rqNl1QIfDp0^
z!7rbTZGRl&lY6+#Q`G1`T$ICEsgzQcxOi7Mgbq<ib01tZsn9N4@Cphz%y?vX#VHP{
z<Y`7|b5B-yO!#j?`C}E>A_Z|t$EK{|9!84JE5m6<d=^Kb5R}`dq&0t<lNFd^p>eod
z|J-L->~{s@vBm`o<2m1hx}GG4bQK(@aZ^Onp&efp^2?P$MHXL`1&jTJ3+5|;X>N%G
zioG=m^n)MJyc$%Hy-j30kJzJ66l=|Ip<#auBf)i*wt@!I{bLc>A$u9*ieM<@ukCA6
z0cmnG(A*R9R2d+V(^YERAw$8pB_)ib8~*VoK<G17Fh=4n2(PxYP10L<nVRDZ@8JC)
z)7h+D8n*N#@V*ry+-6IhBU5;Th^aPM>31fDb5S-0BAae0JD?<LR`<+<8H_F0b4?xi
zRt3V4QqXsJbH8kf(gMJI8oWPNyAy)>RiN0&p9D`dm6H3`8IWi>^re-KK9kVAah|7Y
z-pyC%%qD#jx*%*^B~_;=M`^0`%S_SvzxDK7r>$I&4S=g!UZQ8~O!5=5((X*y1sjmB
z-Q%b4Goxv|TrDUZocB1wKdP}m!mcFOf)E7W=tn^i?|-qcKCS8%t~(*dc7huCMj*>4
zIDmpZ`Jm1TL7Jv0s`m?h)<rYVa|t62ax|!Sr8meW{gD|O8zlwXz?q)qTvrdaJS$^k
z8jrh}Vy-KJf;fui5$JW+48p8mE%1&Z-%<ypS=Z}TxUJ*y!aTcac*;Q(hlR8H(N*b&
zgJI`AgQW}lf;4jsqIkr@`D1f59}xs&7z*iXA01%2JvNo|!X6DY#-dEiQhJIwXpp9Y
z5!f}TTBNg@pYcw20Qv?STI1MhQ=9~FN_nV>>aF1&-re&_V1iv}(-4XPZuvz=jHcm$
zUfv}IMqk=fWI-G#cBjNHt_*q!sq>tyBb`w=4{wbnZC+E;4<SHPD(xueF9G*&Jhl`8
z8u7vt{z^Vq1W&P7AwZ)RpZ;YBwv@#xOrZ(60L>N@Iw9y=$=!n1^jCHxvx7HffwR)0
zeC5X*MKl)5b}9vL;Me<;8k#!9S*K{s&^4b0c$3O48109%K{M*RsFXxNeqDR}Jb|fh
zQ%U&<av+)o%hZn$8WH+m$?ur}&Bwnw!(gvZ&6Tebp!qnCmNFv<H0>qlOUZ#~R^_x0
zG*k{}gb|Nvm|y=1JC_3pLJ)?w1fnSYH@539@x(OXVLrPINnVa(cq1h9+omdpztQrS
zf;k%1@uax}nJO>&E_i@d(TkDi7z$3Tn5RDu1JT!_5N{p*jI$3pH6fNkR|VP?m!rY1
zN4tJ3zDPX7#%INt$+!>AZ$%(zxGj^1?sO@D%lDq@L?z&=7}pN4I=%xZXymuzMro$g
z>%hLIF5~15_mA=G*3#Hf3NK;mi3wUhxEzgU#Q{6PAvX}TmYDe}mRTBSvCWP<Y#X80
zd}Tz5W@`Y~CVu9(GAmf~jdp+z00PV$8{`Tc|4${!zw4;dcr<@fdN{#9{;q=ASFFzL
zq}q-FFXh)Y6E1w7nn(piT4%C8(i2eFKA?7$li@iD-rQ7b0_Rzg$1x>LR;5(PT?KHt
zy#x%vU_93)=_74aY1#u+ltva#k94bUETwS(oaZ7nI$5tHKY`tb!Z>$VLH9#Xt1ka1
zkm%Fe(}C7;8DylPBx5g)3&qm{Nazf6q{E8|R*+KT!2^(3+r6YWlhCtGZMd3S#U%Uj
zW|}JBZ2~JQYWZYlQq$*wI*q`l>}QnOirGi>z!Z;UbtB~SeCU@&ZAdR9n`v0wFpD#c
zB^o)Rzz98yA7NK^Trms+TS9<9^xs&_$gutiuK~u<QxL}<B;bHBYPeC>e9LO=88IYd
zxpr<jNb?_`(64ql>PT4*S)s7`mjF7KFt8v6^OJvEhQ>nj0jj~sp<g_Dd_Py0fRa%N
z0s2R6HE522sZV)b?wn*pENs?o6DXeDcIXD6LOHKYkz;=-;L^y3YAwr~;qn_o<_O4<
z46wJCnJ*{Pd&Eo$<IyJIB1$Bb^E%B*7F!xN%mBHr^b=tz&j;xrU<3o(@fO4RN9_4N
zad$Rm3zqR+Ooxp1m%KX~tzPs#6kp%cJ45(Cf^=VFf~UqD5(nxd6IqH+lUp`u%!evm
z+~(v|TbgXGsLSzHYC36Gpf*Pks56}=WOG5LlHD_!EnN<M!K6>?-tvC4{L`tEjiewE
z&|i<YrsIisj+pyDnKPtdZRpaP8(y+$xr5{%=YUCMDKfS^_KiS0=5uIcnv3+PX1@kE
z$<&^2Lv#VBkd<8RPW^n2jax&}wo1BQJ=LqLKsa|UBDIC?d3{{agcqz+#|BZfXFtjy
zVT5uo7}k&SNl`^EJlTGt6%}d8d=4Lmm%;eTqW`zU<|M0amGtBx@bh<3N&Lmd4H24A
zb6WaC{s_CaB!@v5cB36Y*uecSws8tFKUFWlgeC>sdWHURrLssDKPjns3Xi*l%eN`p
zJEWq<dK&(-)qal`=uL1IX*2yx%odN?rp3(2WSTNS&QnQuOw*!87`YW#;7u_aNGolo
zZ!06W!jSfH?u|^uVp2VdOHs3OGVRQqieTTSpMhx28lBS1atg4J66)T}IE-wy(S>C+
zKj-wET5g96t!c-{1-n0g9|7w}-LTP`xM6ysV}xT6b~71h@~kk=3aI_EvmtT64c!<W
zMa}xF1mv-UK{j6q5`Ba-3}n=LMLVZ0kWS(-IM2v>UPTZhPpn=T2uu9}JQZH8^JrMp
z_(4KTYT)UcdwHcY75RmMi(Vn~7lvPsVU<Wn{jrJk%|%iX7u)1;O3?oa&!nV&5mYu3
z9n5{x4S`?u+(X<7r=>l8dRAyMINsoNQDJ)-ZBg>JhAsUoEXI$ecU<wD+I;4_-xnCn
zNor+Xd`i#cgD!z!Y`Eslt(}>%T~jGHT~9m)vBP@!xq%&)LaTZ}m-B;8rO&5N1k}y~
z!90<e6Vmbw)j5&16OZ@-u=FPA5kTCn1k)oW)sU0`403&pPJ*vf7Q@5Pb@8;(nrH}U
zs91v8N{!e*VONwTF$lu0goqaIf3Y2QYT{Ss0>0W>1VWM@MfQUf(qOywuO5uw`ildK
z6(Dv0_2NGCEDv7!a$spDF6>W9iNLVVcy8lnS`d5Y#b2OFq;qC!Z~Yqb*7PBL!6V6T
z*A)frY08WcW?Y6Onv60JTGPG5eL2@J^v^z7tbT@t6{6@|pB2<=&@uX;HBIuQ9dJEK
z7Yma&)d6d)ExWLZh0xGCFglA(z}e3JzFj)?tMoOIP`b~UPN6FU3~NKj=t5DmbF)?8
zgUwXka;eL_izhmv9?~QD`a=|?oWqT<*)Uw#W9#CuV7BSbLY?9r-E0oM3yh0@=V{;Y
zWDG7#Q`2Xm4><v&w!7tIY=}qi0ynlTww@~SSGk6ZCb611*JX~#7M@1#W>M1TGENx5
z@iqNh*F}ImX-|*y9STS21U3lM>@(!jgPHl}pYE@ouUG+1@l29Hs$MYLJ2Zt}!8yTK
ztm>%!;q~JY$XzI25)(y!A5w{Tg~g@l=sXCtQQKqd7fJf-PTE!#6>Dq#*ahmDQCA|5
zG`s_y<a7twG`=1j=g+}J`llV6Rv4O)Pi_Q;@;#`#dk>rc5q2%f4ul}^N`j3J_rKT+
zHP3DrDRO|YFb*pH`%-}yNZ&Fhn$ws+5xwjZ#xZ1gUU)j4jjVT)hF$4hkY&Y6IhgEr
za)k?~Sqit_1Sm?<(_TSw$!UCF5XYvu(HL!Sf^eGPd!#052GO2cMkXvSxJr=$8WX&<
z(WZc~>~-O%p`r9{lPUwUJadML?BYh+5ij^`8yrlE>~Q%P<NwRFGWPL)Kc&Ks4mY-Z
zIgPB&jsDyA%d|q8?l+S6t&q{TIOmZ)E)ra1LO^o68>FY15JzNfse*nG_u)LTpJ7W`
z!c;b8_KN@+Nk1~%_y6{U^((#$f@wBH*0FWT^V?*<PX)zyN#Ae#m<N|H-sqQ+=e4Cg
z2IBB@>tF3<<&c<WJOW8_9@c%y7up#lB&JzQ8MG1d7+C$t2a`y)6KooFe`f_)D@(!=
z)0FGATI3u~PQc5aXev;@uo!$_crG(ldMyhMPV?Esnf(2mV0DZHXI}vn$A`Q>EX0h+
z-U$Yi7s#=uST2WfRKqv(ejUj_`*bHMs?V0Lp?Gh-i%A!i2nnOc@kamcEQG14_#?62
z9*d8n?ft!B@=bH63nux9UQd#*JMxdPbGw2V1c7KvB2W8oY*!;pzDNU}O_r!Ia3@!Q
zP%{R|;_T@`wre(RN+N=(Y_At70!x&jkDpMSQu4tso?%^|K4d$QI<q}c1)abV_QY9%
zO5=uSn8Fw=_x{7iJdM0e>u1$Vj_+t2PMD{OgdiUvPN1hC+R~R?mF8>*D{JDB3hZe=
z|9Fk%-j$g9gJIS}(a8E(U=`s>ytv>~q^7g9XDSM?XO#SrgO;>{w^={8DOy>L(+m_L
zy~NMacQcAkm_{Y=Yj<9!<<mB|>o*r=5KJ;LitCp647AK%r4fbYrlVxT3i`+YV%Kgi
zT3cjwmOf<g2|8u}U264=|1)zCzwUXt>&%1uhX6KL83xnIx8wsSYy(PPY{;k;bWshN
zQ7gv_ylEB_7VxN~X0<gRv6o4<Rlm}Iv#p!7_C4cb2*?6rpYi(YjCee?niY^{2Sbim
zgXl*swpIW>3qm-l8LA!e@f6r13IBv7TIkruw=@1?igE*i_uwz*tTq;`PHbkNq}70y
z<kjaiP-z}s)RjK{rkC4<cJ;SV3s@alb$6ufsK*VsUjUZGbmLKvyHQ%QY&)ekAbsG-
zr`LC_z*~NlD~?R_BkYWFBnDv^dZiLVLXNh#-_jNvX(jL9{0w3!Q$pfAZ<aLpO0l=o
zT=Wq6zos*d1q3RsefNpFSHbnwFqss$g8D7@iM?i^J7RqI)GTpru$b=?^$GhY>c~N^
z5c6-%I>EIXVdsfEO~BtUR=`D=j3)kjCQZzk54Of8FKrb*JdqWT+?0YP{bLeRb4Hy_
zHK;D!SJKxl`OB+MeN;_|A>Sq0t!^!k%#)nMJR-;jyyb-h_fbR2g=C%PqRnGo!DB+N
z0<mZ1%p!IxJ065y1;{EA!i>IjXh#uRzoUsg>t-aCIyXbtWFena=Q>9SPhh5Ar!+AF
z)wy*r6}y2m^%}m25pbsoXBeB4{N6c3|B52IgMLo~xc*qq<8p)o*Qf6=bZOysM)$!w
z%J0K)vtM9*X8DGbUwSjLMpM?=TVD)&yh}Z&7gRnzSmntPluKzil9PEh4y;hGWZ}~O
znFHd-fH%$axoD6rE5Obg%^NR&nN$mEY)t2!>IfhMFNQYhfsw8Q$iji0<J(O4Npn9U
z+p&CheV<^R#xB}c`35nsIp{{Uu`4wz(?>s(dkes`eQLt_xEi%a;eTsQD=3rQmxJK5
z@rXx%ehE9XBZ)y6h-S2<6XE<5o5eP2zS;o{HO2=zUbmhsy=IqvoCl#P4onAWz8Q2N
zQT#7-N>g2nUG7%!Ykh!avO;dQ;~H=fj;2FaHb4W9d^<G@_um|%PfTBp+pRw63h>S~
zs9ALD%vP6#+tH+e&K(9B$8;Q49Q8>kYBazUT<tEtZYE{;QU$ycM9n%!e`DigC(){r
zQwXxLhPz}>H&UC<^}w_vL~ybi3`SRQ6jR~a|B%DaVWs@*klM=Z$mjseKs3MqFb+c4
zoT7}Whjj%UM5Z|U@%&yY1Pq7b&lLIPhnq~IQzO#~Tm#Hbh3XelyD;t-_~2?u&Z_$q
zzldgiLNN)WHZ!$mi19budS?4DOhulpIb1H0{H;0#HC2ZbA8>JQ6_8NWm|%rx<jV_2
z@B=RmxVUEr<5xi9UUl((fO+mE7%5U{Uw-T(taEepe8bw~yZ$5TESg@X!MI|!nalP(
zTVUtpn}`&<F`ZRnp98ku!B^-2(gfsLC{S^k$uFUwMnA+^32$-^LZ%~p9Mbbd=030M
z9>_&Mua1fBg%x(E>GlMn50ZBUa@3p8+zHYC{em_5CA7m-9%!+(?XLg*2s@)Bhd~&I
zUWtHh!u>C{afv1Nqv`>|q?3eV%hHqDhL=LKQl}!Aa5i+DOdH(16q?L_WJT4T(5+h|
zeta<JzLA<5#Uf7Kvq@8v4^%T-f_SSsBqiL>L)E)8oir2OzpQNR2!+%O@UQx^ARdQ9
zXFEXQ`wDh~Kv0tHVe1m0Wl!CW=GR6$5Hbcn(H#=I<wn?Myp6MjQTtd&4zykYkv=hr
zI_lPN52krdemH5Ytjzaw4>b&sNELa#A4eVo!)+M?p7sp2SOG8Ow2qN6Ga|xGOVDlr
zfoz?klBlUoxaN<!5#4q5d34T3ZSZ!>?w>RBY*pCS$2j`V|6SKhasR#ojWk;@e}fXd
zV{;ip{|Y*3c>IjrqbVStE{Gf@_KsA4_ou1^(nzCI{M?~pTTmES<)2O4=8vMxk1<F{
zhP-@#9pZBMy5iyjYj#BVMYw(r=s(_Ng30r5&AO+ZMK?;E0!<?|H7Xo5&rJHOc7}={
z!_5O|oQ%n7`VOENwh|^%{vVBLj5;IL1MSBS14_<&cQl;h#}^SKZT5xtxdAZVk|ivk
zMBsJgnE10xtc7EnYlMaer*bDxJ>zCn*3d$}Q=l1iZ^TXYcl|3P{s_Ag90@`Y_$5&h
z`2WXt*&eD)CQCnHCVkkT)b;&))JNYEUn-jHIez-*NV|$1m>7vU;(4a8{wYvKV|5LY
zBU$8)`dIy4c&RrEn#kpJ49;)1`Zr0Lq4~v34#WU!PdQV@(mckoHF+CCE9>^7GPG+s
zqz{H)c40lvr8cj94@Y;v3lrvOl{{*Ty0D<ff;gmUTUtew8aO^@QxzY>FQ=@&VVg3?
zO{s#JoCA9gj;P@*qjfAz1;Y>^*dE&d19-UzGfoLZnL?(KO<!A#71EilW3v|IA7Ihe
zH@iq@%mq}dkfJpD>8reR2MO&(;&tV7m1nh<&!7yZc?gk(G8q_z)^8vkE7HO#=DytH
ztandQzY8Rpb7qJs-!I!>x}F6HHt8Y*d#BxpUg-y*NqL(DKFmGQ^4HM*MKEj={Wi_@
zt4*x8cy4uLxX!>9beU`>VDtkknx2he^nN>JyYDmmYruk>5tm6lp@pe^nGa4Mg?>H)
zB~DH$TBirS5Sqn&p5oV}j>cNLyat0nwqQu$2r$dl(C=IVkl}#Seo7}dZ~=Xp9mc*K
zKGE$?<)O%WbF$IExX0^k_|PLNjqdkr`$tIq!`B%lNf3fC^h%(Da{r5Mv%3(!a)7a>
zt1TK0d8rj(#jZ9u3vLluzK1(v{6AdCmUm&AU{{i_a{#hMpRrFMSNiOYI{%FChQ9Fe
z2F(AuC$JrqY7;Jf|0tCnku6|h#eX$NdiUpo5-9*dUqK+TIBllAB%18hAo~4{W|#lM
z_*1kO`#jJoU%M3(14BU%E<IN9wse*K8p^(W+e&MkgL-CS2q(NF2ABSPK=_(tQ=X<g
z6Fu6vIDlujiLnXCJQutT{{Oo^u8V61yCpeBMm1i#Lev!HUO3XU{F`bKRXtsMGph7=
zN-m7Ee~(EPXvF;q#U$vK7GA&JmhPl~aVFor|I4OX5{rJ9SqzJMfqdF%KoR^ZQ_IK3
zNB4Z-&J=7Y8Mh2UPh}1ljlQ9~+R(r`0NG)qc?x=P^eky|7dC$t7YrI50k&~QnhM_y
z5B4;SLxjq>&gO3-Fq-TzE!4sAJE!nW8DBkdwr)Ty?7VnQu|eqyVEN2RfEWg3PU-U1
z4WwI)RA_GmpmEBn4;PK$t^y@KQw6Cm;OpRQIBW}(YDqgMUn93mFaddx$SmBv>&ub#
z37(@GMAPH^OIHHT4`J7K#4rfMRx%h1*nhDW0#d%51#;=73D(2XY5{pY%z5?eKitl#
zTvSnzXlkswHu04u{qb5=QjnO6^{x=Y^_gx?z)eJI4aJpp$<H-EXq*%zVs^z#-9>7A
z6_vv!VAsOawlSq)ttO|#7j7|)30CcC$5q{$r>@~P)9lU>7OI3fb8tQ~M&SfCc(n<8
zyb=yZI*UV_G%qVbWts4bE%5wNbQycagmwqhUQ5gGfMuIz<j$<fa@O$iAg0I)6|y{O
zStp$!^(Ld4-ibj9u@2#~k_$z+wKO|P3F@{!GS6-)O!aFtwqv(;K9Ng!uj+xDbL78*
zG0se^-6S&TuX*;Sk}GJ{u$L-Gb3U?b@nNJ9S!jeb!C3F9s`Ikkh%>(jLK@Vdx%jb&
z9Ltxb@-3RSv3<%k)+c{Ou5Ump&3^)<0TJVTo^~u#KD$Vz8Mh>S1x1YOGmnyzhzOH{
zEL1l8@tL<(YL;I>cxH6+cMnK>rdZ20XvEu3K_t*Q1<#&O;##5!M&~V%51uogn-LJQ
z_fUcE14KiXdz_$Nn&^@iMm3d3q?|kg+Psy;$p_`W`Z4z0oHJW1U3?>-N})5!=X;Jg
z63sf-?|*sMUHu5VvSf#05OyUm7~}h2?3FY~{(0&Jm}%k?EVK*&kYnlozF?QzYKxvu
zGL<(Uk5!lKZP$vXNa|^Nwt&O-?~+<nxFX~X-k|ldKB>)-Bz1S-J#B4TgPN6Qp&yOp
zIwdsST3jJTr6doN_@ldB&g_T>s>760bnT(z6ws_f7@mZiQ<fpF!_%A#8t-%|8>{^3
zlisUe!!G({b@$w^lmSl4+I7ICI~pT0l0IjtuL=i$f&%nY<m?FX$^}LD`7&1iudu1;
zib3eF!oA1it{@ALYG&LQp8j_CEU+Zx<rL63(8s(XPI!sOj{=w+w;Pk93TH{0#gc0U
z-&e#Y?Hxw_hD>bN4*{94vq;SkleWX0%cq`rxSg@M{*r|pCZ>7xU54A4R^IeqR_!Sn
zQJZ>R*&v%Wum(RBtaePF$y}!x`#y}vr1_u)?c%o9IC?Zf(Ffye_@Sq|OGUm%XTT7t
zw8Kd7X-)U07$m}yDTU6EDxj?~r%OQtTdBvP9UGn>aJUCfWNh9F+nJa?hZd~*rJ(Ui
zxoH)!xA%(z&Vb8?jG|Ut|4a>C`XUer*=+MLdTbl6*V973%qx|K9TF?>bQsW|x_3YG
z%m&O~GdswqoVNUruq!zZ7zTkY0XjhaHx}a<R+Go30Y<WABVZ2}0rMGAby&X67N;_y
z<CT5-7wLkY{x53(H-Zjc*`Dr(&+dZ0%221k-6p&neg=FxC%oRHvei@6(bI(S%yVhI
z#E1&c@VZXW6Aeq6F)L%I%E<SV)zqb=Q}hi_8sDe8(boAg0dN!^voW4A85a=<_CPiU
zkAR#V0p~B-Z4Wf&<huamY+W4c0ztlPXgZg0f#HImOYdX0s^_B38W$L~s{&smE8uaY
zGyp^a%C9P^NF|V;)H?fT2{?~&MNqE@X~S@61f0m#rLh!ZED?;frgJErX@Kr9<5PvQ
z>=rD(f|djjzaoe<5LA>u1iy&rT}<p#<-KHS!Z!h%&5vA{_rG1=l;lI;d+3b4>$`rd
zd#m^G6yJ0}<JuWJ7Jzrs<d^vVQzQb|Grr-UrXQ%oQpJsCY=_X<4phg_S2^%5`Dws}
zX4q<j^HCN4a|JYxCGcxP)80U@f?ew-ub{UE$B4#VIzr43q5Z5uZ1d;PC3gEfCC%bn
zf+cF6G9?}Knbqp}ulo0@2ut}M;!<bm71W%{5-t>c1t7e3%PUP;Mz27*TCc;8W?kgt
z6Q@(%_*>Ha5OyuN4udf4N<ac3_rKUHqu6ND^DYq4v8E9Jz6w-27!H0b(~vw{v~ne=
zo=H!dj13^S+iq4AAfLiIaH^Ta`<m(IM0{q9PNNOvl|Fw*GhLxWynIaIR|N}rwN;&R
z8I;ddsvc?tQ(N_!A&AfP!2;){Tvn3yV<TWBZe|y$caWZwKXxKdg$mP^B}xPpwROD_
zR){g3B$s7>_jcIvX)N+*q<{wT0R51=`*YLMe(qryg>Sjjz8;s8RR0-XhJFOQ+*x53
z*H4s;fAk7^4Ss-?8jb;K0bIC%Cpr8JL(sy20A^jODs|*7^;7V3orXd7gm$?sTLak`
z?COqWv!(}*ZkrS;D!`c33hn(JSy}y!qZ1V{fE<k)nmyiqX)QVsCoXsfgxIG)Ud}O9
zg2zFRvvCb_r@<s`=)lx);MaXlHrNA7ERK1T)4y;~a%blW76H7=nnCO0!kwgEuAzXO
z^StjmxFa0oo-&xK*y^R?(FTY?4b6m=QF(2RULvTbafS!=fvjM#hgeNV_h^RE<cWz|
zIs@qOm!4Q302xN(IZ0V-72t7b5Iy>31W9sBL`8B(Y5J|8h9;{sI;|zvu;Uj0sqjbG
zxn)5J!Z3786eubC-`I%S#IMc<I6hFINp8;wT|F`})cH&(NULEVP>7~Gq`ZzMo_XC~
z5+BYPXSE*_9w|I?uKGD}%^s$vtBA(L>0?_eMo_NHnhdSxA$)WFUATI+y9rJ|d?>bC
zx_sav*>ehdVv~5R>(i`9;32z(a)MwZmg7{e-=<J!510Q{@-gW1nRQ7Ql4+bxNUpzJ
z>lD2HB$BX5%Z-n@WTs#KX;@lc!;k?nWW>Dn*605aUV65$KKn?)(zYqO;QP;AsPNM^
zUA1ecV%8tKZZW`8Wm{FiNTyO8VY;rEEKbQaof5PqFE?%huf7HX?k({Ocfh|VCTv9i
z^C~`wdvTr67q=g4)XOGxuo+I&*yA#NN3gQ?1ek2vbI9PVEl||$4)7IgKrNmPw)csr
z)C(`9WH;lJG<%cGXN1y$hwMpnOj4kw6w6q|Yo$XPsn*=c7v`co7w%JgnDrGbB|!2I
z7YCNIX{wm@ei%@>VN*X{=wu53b?peM{7k1`o@gmM_5FHEL#~Q6eVu(oMi)+^s7}d2
zu(Osu1@E&-BwETk>e5fp3mLFbd!WRnot3|y4bf$O6Jl$2oh+_rQof7pQ1&D2%B~}b
zVNgq!4_PWL-DkWTgMPv^pf{&&0fGxZjfAfCS)X9pwzbTAldO6EY~+QGYX^A<$d~;p
z7`16d%Gd%GV(O1Nyx2J+hh$kb^fvuA8Q6{ljFVW9w?JPnH^K3)>2&-En3Cu2`U<#2
zHs^`@PWPV)chh?=$r^_$^?>~jl3}E7whLK<NtWlz?N6$GKsdcPBv(i$k~puyyybI<
z)A&=;pR_wF_@e5*Y5$j9*qVOTK5;^Ufkl3u!bOEeY@5yUxEPrAH@(p=hG%K0&~KWa
z*-1Ip&jGvkykP<7;Lxr}<a3abzc$&Ld6fa@<ghMD&`*n|uK~e^-IL97rg3^yqPo$5
zk0+ebk0dl_X-#AS`kk#_s5b*<Ftod8(C;ifm{<zC+C!tty&_20tmJ8UPfozPR6Rw5
z`Ygv-^io_1TH0FO8;ujNS+W%e=KFohp~+}8xd(D$M_Eg{Mm9FVahe1te>kgRYo4;X
z3eq*J=!*k3)?F(~qtW5M&*D$dhw#;({9nNuTZ%ysmrck)4~K=7fo%3>Oz`-SUb;f3
zrR5@$hw-$WP2a+xaLbFuDkB%%Wp5V-Kgj&N)Sq9%&L{~&5Qd>wf)+}+|HXDuNcgH3
zU>p&FHhI~1+^Qv+76MU;gB%yS<ke&CuQ?Y(q7qk8iqZ8ct<A!%TRs9yKX2c4yI<>I
zxuKVmkHGypa8xRT;1OFwvh*kqnQ6kVo|&;#(|W4Mgb6Nng)t8=!m{Vtw-D(}Ih~Kr
zzaRBjF2aM|UnAe*iCeHmUr8^>5a;Z@h3=UgPW_ta%wQNhhp?a$k>QZGVvN($Htb3v
zb}<gDQFmqj@eI<RRdaFKk2U}4?x%}Nu(N5weXbr!=Thg5k2k5^TF?$Vky{UbF1-uD
zSQ~GI<u0gt<0H&GQ4ng@boo|iy;>!?HWz+{b_q2*0vw^{`e3-sT_ImoXT<scK>V?;
zo#w8hbjj%lom`feBYlsjTNC?-^eVp)!Oq`XqfSPkAaZsmBMYWTn#d(4aH`MTKos}?
zq$62DANgELeb%<L;fc?!jEefWW8-vd9yj+S4!lpwI!B~_aQM8a=#qYUTp*itvlH;F
zG^GmGLeMPoumd!uZ1TwQ*u2<;oq4t+8mo}w0Miz00&+o@e8X>q<$^BiV3P9xEIjjR
zXe>e6R5v|lqZj<6dWXiccq5EwRjrPD;z!sOWl0Ewuq)XXN_w?D{SFQge+CaA&#J{j
zLh_14L+XD$F{{Lvk_DY_Y84QIhbg}NwLv-QA*c58BA)&qjBw)2;0(Ia-vYT6spa?y
zP<oh=^nPE@IT{ipQor$g16Qvf4Gz*!`owXvodIOEl`RO<KsE^`**Kfdy6=;l63k9G
z{66(W|8crVQ`=;K3X@xa3r>buMoQ_+A}TwIhR4&bAXvYtv7`^MQ`qTXkeYi)?pVDB
z4RV&o57APo?NiF47P0zWsg)chcZ91@Vi)|mdY?~dadVM$C4Y`a#kDi~RRl=m4VuH;
zBBej={sS#wh5%{&Gghq#gOZloTOuMb8t<=7sgFU+GR&vm`l4``8YD{c<C9>gF+jhm
z0;2JpD4-H}D#-Xdw*G?*h{n$u>#7I_<5;}5L>mM~;}i&+rIDax);+widy(Tb-dWl;
zoAs4{{fnuT)2{;g98UI&9N;=vP1#|#{9pt|<28BCFL*(l70s=q(*Lgmqq*G}qZ;rC
zixJG)MlOtUxknbAXD{JNyftux(bF)qgQVSTOttU+UD$&S$wurNq^Vpl^{vUnw}PFH
z#EJaivRm6%*aJ3Xr$XmNOPXGS4}@u^3LQZ3P}U4F#DBuh?Mi|W1fnVVM94p}Ra>k4
z*_r^xV>{h|P+b090U00b6diRUs-pk+Go66^XMD#|z^(B_x^>kD#T5_GF<*V|S|Lff
zk2~l9?GjivIk-aT5<};`oZ<@0l|5nsv5o723+{zl?RZ5dP|<}>>^nPZn)PQ72}PRR
zwWa4wnwrT2`bc)4h0-&|-5+Kyzf14<eZ-GvV8`KeyR?>QWrr+PxsONI0MYyOk|_EO
zJ?p^z(dP~n9#a{BN`{%<!z~*k0KJ;2yeE^$GYmGrb_Ag9_CDlYdXn~)<(V0<q4at#
zg?Y`d*S7Jg&Va--qb0)zT$VgNknM51Z}Mt<J@$PrFq%&1pW4j!i1gOu0%SG=PbWZw
z;p2rrFDXbla;Yt>)C(Ydto0n?igdyl{1u%Aj==zQpsi|LiuQ7U&Ga#VO=@O%h!O?I
zFdc_}mk>Ute!)(@60&IRvL-KeLC{$TmVM)BD&bNxV2DI#UC7=;<3X*z+UkR#GY(>&
zu8orfzY#%V0lbm9lTJUs1K3tGStX0qh(zazrs%9|B;8OH3HNL7oQGH;w^~xCrdKfH
zgqZuwnJjQE5(@UxeCW&L>}$rbuIm3@CjJOJqicsj7>2F{HV|w7#a<!U%9q{%<&>l)
zu_a%<D-d=TL?pC?LE5PW^u4V5`Zbf>Uqi}`zZHf??4wt^C-{`}S&?P-$aXlW&N!#J
zJv~OhFVL1WD5D$GzBuQ%JeV_}pD;*yW^2ss>5pioFyWuSC4*?}VW=Z|=iupby^G1|
zGVTJ2s@<^tfL@`@;-h^!>gy@=vFmASTzzJoDPl5OXB#xm$zvM5%;Hv8a@&&UWMw$@
zy{J4xZ>{XX0orTe`gF0Xuvd->?nbUx*4ENyD_9lSNLa-=nR^N7O&9sFs<2nN?#~md
zxa`aH9y}N5U=mGKHu*j><QOuj(7<d`Wg?1kY7rksz&(AK)d$}Cmvj*z^_hJZulhBG
zGjw8wv}waWXi_gqSfmg0NG<a7!I31A^A;thsY_#Ab!N-{{UN2{VrpN#N?yY&&YV$!
zD884c^nB)UWgi$<ojK83$$#0oh+dmmQ>t9ZVVZ4B>tw3iQ*-&_k&H1U=WKBDb-(zm
z`v!hcTY3|NE~#l`AdW;gFYO|LGkX~ES>Ouj8~&_g2H=F-*K_I&3MBJm=q3l8)}D$b
zI(|+DD2J>hK+M^TDZMgTpG-{Cp*-*c<=P)%=XNYH2*c2hcEH#M_utqqnILh0bPGr(
z4+4&nj{Z#X1FW{uWCOF#=FGPC(OniNs&yj_LpC{zyEAoKcYa)&FYZFCILnP(&x=Oh
z3r$q-dO$if;uBg_<}*El4%wq9=j<4c$<2!Elw0XDz)G`>uKHOEd1a}kgXI^Tw44G;
znsIDMS5q;LCLxmg)v!Ie;pju(1@(`^uY`BQlPuSj_ysyk3RBvg>~d(GRb5sZV+3EH
zfiqZ>|MwLrA=AcUf?i@!d)FT~_h@=JR?D)t6n{ES@?{1k6+v;#Q8R3Nm|iG?IG+QI
z+s9j=<u#{7YF3agg+#{<2RhJ?$5pHE;bJ!vPT$+R+}cihbbSWqe^fAuWxXyKdvcTX
zt0d3|A@R@aBTUEiEE^D<<!BJy%}C0W<nh@UP1FV*EP<ec-`63ZLUyMAb|O0(UC2XQ
z7K*ep_p5!0fApuUmjgPXezdlN$(W7A-WK{AoR-NVDgu-2CT{4$BPqze_|KORU`{>9
zW-^A4W@;}QyV7+9Nf%8I#%(!RlI^qp84c^&{YBW;(HQm3rPOtJ-n0rL{{1MUx3x^}
zY!m}&W==eXFJb3)B{2-b(3T8-LH~{Il8GgMDGhKYP6o_N*AM=~OZH2r=p@q2##;74
zWqGL^ei%Rra;zTQG<;=2{TacNuafN<pM*L_dzX<O3-aPZy)z$-677uVc<tLu5$oK%
zLv|x*3J&t&3~3ACe~jKSQDL3Pua7aM+{m!~lGopMWo51-)ux({y?@JxjlMyQXj2~~
z<;2&KgY=484!EW3`d_q5{m!`-mdC<>cB_;8;8K?v_?YuhM&l`A$zwR}nbHlP@bYn_
znJVOe_}IW5vKbrkzoNst1MH!ng1fH}KPg=7paiuZNXQ_geQnSV`cWyUX7Z5Dg$(Y#
z9(qTWip(zya^@^!6TV?Y`z)>tgf0CWaEaVLxqrJCH1dCl4`Crm!ke6K?vvmP?H#gl
zOo-Kv(<tjTekPm0nTXj9c%uI=<4C4Guqu6xO)3OHaiV73IN0%92@w`9L{bvbz6UB-
zzCJAAi|l^2kDYg);j-<SIVq@!px=!IlBqWiGEo(0pfJEr%VWDfM&vY`yakUSM5QhL
z1OYZB;OaGgW`nZ9+QlZnMzaevH2|mF(mSozu(DvmE{%iOT7%c2EilV&{Q^ZD-!lLB
zy0T;kLJ)YP6rwEN|6(shZQfU3fQlK%5qc{qE@%aCAPvo7eX||^gAb;Hb`g*u4e9FD
zC>ja~o2$DBL<<8ZrT=$B&9^7707uApmTNy6#*;A1$(SYu+DtqbDum=yjJnZG!-Evx
zn{*~@P9^Umyb{P5htcJtG&SSM0r*s4=vW|@@n;E=&&n(1uCL3BF|MZ)i~fcIl23+U
z5E*(?4a+f0_>SyQ8j-*lQB7cFJ%f?FT?W3{3qB3scRO0sm302)GH^m3AE$fFTR_C3
zLAP|vXx8rZj5TL=Mttx;vMp3*;trVBL7z^=yWa{pAxCtB>dkIWszy3qLQlI38)?6A
zSE)UzkBmzjo;mWQiw6O<=eZ1$0vkbk+k23yi6w*yUBbg?_UFV$JYk!_CQInG#pQuC
zyX=s_7!wsJ)5Pf_w8!FUU=-*J3HXh{_<nvMjeVZ<w<d18#UCL|zU*=_nrehH!2Vli
zz&DOn4XI$SpBN*6mg)0$pLX5<Nd@#YV|Pj?T**s}E>7PFg=issXltl%uy=Ju&W~6H
zFE^}Jit5oy%izbnA^;@SI?Xwus2`iIVK%K|8(?sFN}fvteXE~}Mk@!gW1jFNDjM48
z0Xwxd1I@J(1R<AsT~D?D2)nW@$zc$7qkdo(oBLm^<LZ>;j~RS`;#C}nO+x(B0{6#F
z;<xFF5f&SLm@v#O)D%71Z$SMtFHaFv4ko>17)K|h&pM2PkUEMwS%##cWe=u&ff{*2
z-E_h%lk2XeKLjZ74X6k{7Yha+&!CqV0SCD<h_Zagz&{dv-R~U)NG@2~o!EgnAPsFD
zgDbCsQc@fg?fMzf{{^Oxkz7u`PASEX+nmA~8mmJ8?{BE+74ot66dl2O8r2=tk377h
zy-SYzdW|AhC0zMh7w6^xu}c<0-BVseYfR&Ekf^U+=VHqzlgll=b<qyoaDBTa`=hiR
zbn@1}3iQNPC+Gx;4NaSS(^oVh>{I|r7uFIc{bdNcN97LVN=0E=)(3n-H1k+G3xsBK
z0s30vfM@_3?$jG8$Gl_=LFZ^hHxx=``jU<s3rHTJg6)(f*w9^jl?c$}!D^m)oI%UH
zO9>P+Zj{a&8H-yTv%QQ#RjC;0!`e~~w)G(<ib$7Yba<_o+&%0K{QtK=owHHYhR7l^
zA(!ugI%g9@+`hRw7_N)9gPD>X>O!~YGiV13dU=`LM>8p$r;ri)a1k2=zl5FHwZt$8
zLt6qbEd4k39+?>VXEY7?Byqd|(#6CUbipXlgdvVdI+M2HU4|%Q_SRN<N*)Vclrx1+
ze<dD)d*e)wgC;Ljt-g+)cTw7piHI|TFSx)}w*x!O*M#K-dhLiV1D#HjYD-LxgC;<b
z9#!+|HDSSbS9GKqSIyG4p#vT@<eQ*E^MCaBIR#QkNwl3#g+r99AjN7ssLS}vFVQg2
z?33qsG8O<BZXOSzLW30Q)0Ob*e@t&Zu+Mm8i}h!>c$)me0mPYfWd0~126{vd{sw3q
zw_!KX6UnH()&nv^OMJZ9JEaPlef9fH@b?iyPyio@t@lDF7vVcY^kEGPc>O?Oz{K)s
zC^{MbS-(fQ2b1ClenLjT?Q!~bb@Ps8#^Q(V)sIGYe}@olxR-3B{{!qZnXv%(dR0ON
zN%Kj6Ncd;&3#cD^UztF8vIvATTM&Y(gJV6Fr&>;RrmV89wU5&%s^k!A{2dxmv0Is3
zr8aP17IkBpWQ)%9#>_T_s03ephdt$)0#9GUH-SQ1?Z*h6eDubv7HDI(>6Nw}Gsy`#
zECM2YhRVSu{gB!G=9v(Q`veMUEgnl;)tNuSt}IJ}5QJSx5Lxbjv1z+X;?JZnz^g@3
zLP)|cCO{t(F?nHG-7YMTt3NXlA^4s^e@5Ic1l2$+DSk|#L9@D~+RYkm1U1a~uYjgh
zMBjY;s_?5AYwc6McaEH~{PHGW@O!1#H@OUHuBii<-tKJ2xBxCgA=?L?wugH4Mo5aa
z$bh9`!n3Oihkj6z`v=B2XwA6(MGEx2k_K21P|U<~fZu@`O%5_(k#y+E&(QK!Q7rxp
zJ%*jO;1+OfaUP4Dq7m{$(0q@p-SHiPK}(*e<#cFv<$(UmFmy*Adzt?u2rwU580#24
zcWb=GBO+j=&d$?*Ohh&ZkvfICh{8Ab717xkzn$C5d}l#O1kAi@wBJ>>{^1u3=5JxR
zIe;XsZQ-VG<{}Z+)#I6nusVWK0U8(SEI9|})2s!g=MP0Bm&=q!ApF-1=e^C9uZHf?
z<k2(wI+<W!W&HRIg&J3(sZ?NPc+l&(XxG_rUDzn*1Pk%UzS1V1MUH+3DeL0Q%jv#?
zEzNXPMpfFdx=<+|7ln9=2bO~?ko}~2T0zYXyIx{7XDg{V{3pWYLkvCg!<X9F7uDNv
z(QA0&y?Xrdb!Ar)gdi{_5fBM&v)^`A%Ac(Ont46#NnHyjG+Z!^FHdkf+iqYNEer6@
z_&r<t<K&~D#nz|%qg(L*5mvc9YB*(sJHjR>{9i%Q_!;p`?0L64?@9L>Se;GlPd-qV
zOTW@wna!9uv&v`rM@v}o3DWteKr)TF7XQw@-3s5z$v*|uG#hOExgBmh`8wZk(94x*
zEs>xhF0RTb?W#0-oED%o+bZyI0B`pxzjco$XbeFz&1@m4aLAO)_AL17qL6o8Q}mT&
zk#Z|c=P<Ou>nuZ&1U%5q40;k305#UKn$jENKVv#*KUE%}W<qROLcc|EHae}KrfKs5
za06y#V^G9ROab6pc{}OMf_fU&$$b@IRFR-4S3sox@#pD?w1?;e05&@W-NWfMRct(=
zRTWksdDK<QyqU90#E=4_qekQwGVTfzoxjC=awA~PIkMX8GKIed)C&Sj%Imk$mz5uT
z+~JiQQIAiXb*C_DVmQPFYU-%mi31xhfsOIO<o)qSEsK7UbF=c*fT7KK@rQO+O+YPX
zuP&^Lzd{`$aZ_K-Y^jq^P=|x<*nW`5QTuJ{QiqP=e49Wd%}AVLtv}?uR9>OHa@9a^
z&UW>;zl2>`mct+nyHN+T*yjEho45^9zLX2}LBnFKtxOP`UJD6M!^364;9p&@3w>Qu
zO4A!>5glC2(7ZJxQWHT#^*GJ>GBfY`IY6XlM?=`>UJJPuSLLI}zzXsp;UxiScL(iy
zlGxD2Jdv7lK#IydjUyr%_f`?Vz_f*qG?+Q=0?_(PK%|><LGFPsu|bL`$g9b3>13Uu
zHD07~1~sMb;+X@;-cGc~vhh{4LeB!?E_<+aX42Dg<;(v7LH1Q&fJ$k8>wv$WVY+Y$
z+}M3g%%U~68}`<FJ3!4{))~|UdDr;(%Mh?4&3VQjzqL{5Zr39KRP!rvj`oz~;5l^X
zC>|vwQ>A}tJ~t`hWe9xI%tR&KjCSHvS^~KRTjP_Nr;gL5_Nd-fv^rbhhg4$ZF~TnQ
zUVT{wT9K3immcJ9X7;QWoU9;Ya~3^mX}%^IsrpevHO<(}HarkPQ7d#~+LHcKi#@y;
zEr^=w(kU4vH!05Qr|_vU$f!%Vq{0295zY0u2(Bl|;In)PV0pR(Ao*`ljXb8Gfi!f!
zyUHE7mzeAB)x+&<Qv?!-M_iwu4S@KC;0u*DFpZHB!}NWZSdr0)GWce;VSeod|NaR(
z7vqLu7>2GyQnEzuzgVp}0@S+}9w5B<NAdgczXdV^I&WlTp;gjN2VjLD(ms`ky-f3~
z^`<Qx!;n;5m^CSU;qt@eGEFA;c@D%tGZ_Msc}DlN$a!qF_)E>E(9DiO#OX9@6+E0C
zVS)RG!y4x~FN!P5x3LZ>Vu)q!cD&m<r}RT$f_+qT`=l04<;#n3XwgiBP6qn&!oldr
z064(7_IUD2VfcHgN<G5h9CQDJH4zX;a@%AK8|H^spqyamLeY@?z7cjvzXmfhCs9*>
z4M8QEJ3k8u@%8T+F<0$C#?fKOuX76(T*p}M0?U^i6b~-acx$NF*sdpkmeUk4ZG>SN
zJ9$R5#AwDN)g*q8geHxeWeKQfF0{)fEx<R9BcT}=2c&z2z6PAuzJWgLBJ4mCy;vaa
z41>Lkeq&D8D9_p;?(F%FzJH;0SjbPJDlCvyVccP{(EuojOLkzxiBIvtY5Cqj9?2<#
zw{Y;p_ZZ<qY|Vm!r$H(Vuy5FkP|LZiHTT8oT5cS2G^1lfE`i+ebyKy4NgZKh?3ROs
zSM8k~`AnZ2Bdj81A>``pZ2_|tZjSW!_GxW<$X<U(@;`)KTeia>2;33^LfrqxZf%ko
zf9`YxoW?2&%;SyVsApnO*C>-CmfN>oL>QEm<V63nYStsEBltlf1`Mzq0YZa)+-d(|
zlz&D~{EJVPQyzC<D^^mD=d#1@OQ%?>owbuS&{hZYwe&~OtSg)!5sQ{(A>SPC?D<3x
zCj$fDFUVEz2K0Q^$^*5JpD?8CaXE=J9YNKPd6-+ua>fG*GHijq(T6sCOnp(Del#Rf
zdks_qmq~1fb4W9063U2{_(r_y^b~kMCNBNG8ya-*Y6*<+IP~`n)rcQ9#ula5flQh%
z!p&dZ<E=@g`*$8iGB>u<XZgoLRn*JCC*&(Ov6XCIHSv7C%S8l^4HxIw^O>aYKF;;y
zpP*btH&J{G=0u*dqwZ<!wsagihKSH63v7QzG~1Qj28ez(o|<f{CH%-v32N5}!klZp
z{^DC6R2BnH#k0hvzhR*XSm@FNT&LvO=X#-H2DxFGmtM%pK@$N52L!K8zd=tf4c)SC
zD~IP`>rSjE66EwEBH=~Z?CMybN>XWhl4m$^s(t-f1Ej~Xh_M+#h18oq_J4#4EMyF#
zQ=%8hJganGxF<A!gq>j)gD?n#uSC-p+WTK@Lu=wMJizwe)L9_O$0fGK(+pS&*UvWU
zOnH@;ank3*?l`NCHAqD=l-^oQwlsEJ8JU&?s}@_W{`^pwhXlZWRMW(!*11;*cGhi)
zj~b_7$UQe+np-gWFpjl|J=q3U(d(m<e-xUGG4WwC0sz;^M-^Yd=t5tzIJXAsRDIVk
zcx7q0A0Ue@iKZV44_w@oDSF?X2RW($$`CYMY^jg}zV@IgBfP$siqhN?>=EI)J?`QW
zmQRzvraj@x(txdie;g97(^~kyn+$Pe(_No)K1EehD*=Tk!mPd%E`QAwu&p;)Q@nJo
zL9Dag2UVu_EE#RN!M8plT<L{PDih-L*M7}X>mMN)<U{FCzjQk<x1=kyx^xTW3{4Ta
zdwOuFOkR#)5o~9`v}A_tz!~hWgR2Ny#eEAW8JrU2FsdXpAYPn`7f2EG+}DXuNS^Vr
zrGdvOqObW=>5V}!X(*~wzMV|YmRcx-^qFR}sfgY(V(wO7$Iu8>sElSxa@QggB+vZ+
z)~+e8l38nf+)5gJI{JIJrCe*Z01fS;S>$NvkJuc@Pp?ngC6o^)FGI%`N2jj+B+o2H
zVeH4)mEcGYgTOD@fI0sEu^o3h6w*kw^MNRByMrm}xY48s(MEIzE*Q_OfFx+=?qvw)
z7-qKiHM7xh3vd2lIi*_3h@#o!Fz7l+Hlp)q8CseRNxQz>m<P$_Pr!jR#4xWniSM2#
zNxl_mXA+~^Ite<e^BZI~1nDt!^+SQXsK>qwyv}wjN3UJ#V5jh6SIEOgcbq$$)~m)V
zP08r-{g=(_^T(z;f%#16av*2ft6;@jfr1|-1RT*GUHYH!-^ViZ?MC1;p|1y_ei$Bn
z9noHkjRa#GGGzXM!SRW1$?Qe{u2Ti4M@s?kF$1+2VjL+BCd2DY1fZ37Na(r;gS~<-
z#JvV|qm|NJ(hw?y(beZsO5j@8SIBigF8m!Zz?QwCe%<Y!e2i{|B9g`gByTk&5Eqx$
zD<Wy0E7!MJ*>1STd7)6uXlg^_7GLJvmHj34Wm1@(orN!hY=k6<DE|>~-%DU`;P{-c
zeFJ$yqT&vez@$cp%$K3SRFV$Quu*Zd==Do6q><xDzCF0WIdwI6g_b7LNA6kt6)8|m
zY5aJX+<JwZA2Y|`zhZnNp-ca{SATZ%A7NL58!-q2e^lWk98c@-Tfp{2tu*_9pg;`l
zj_0^+1o|nYLN+Ct0NeAe1wZ=aMp1JplLE!X0Vm5qEH}+D=_bI$`vL?hFC!c-Au$<1
zY&ryH>h%tvK4l$|Z8kx$PMxu>JD)=lD&$cNu<CR&8p+sAD+J_8i~Q51!>{?rcrj@~
z;#bb~9d-p;5qSP#Qz@ifihkS5Z7F+2gug>cyCms<8+P)jrp<z!bR89j;)zzAp88DL
zLgV~w(+Bc2O=hts74*67dGa{S0rGr3eqYfyeRi-SuV&=Y^o-lue=}$FZudqtdfggS
zG~;zDs99yL_DA?E>Myp`g}u)<h#eaj6PdjLas2d3AMHc@r-kqq(TwpwZDD(=^Lxq^
zq1<4L-Axc%iZ22*G)pjmBx&w<5*M{6BUCXqZ>1I(E2yaJxZd$)EO&d&Ww>24ixFf_
zUeD0bc+FydWlH^ao1oc1-4IE0vzUV6W5JW!h8N5EB;Y3AkxjW~W<!p>sp-LD2xvE8
zZ==U8rN>5*e#~gl93P^9TTV9Qc%>@RW$*&TU4TXpodtXir9>z57b6$K`Y34Ku+`+x
zL(}Eega0jU&jH$?<QhYBX85d(_-2US&_6fr4`JtmBQXfW&>O7)1EKf7*fxA@q}8Se
zC_)_uN@Dx{89{0@vfHK{f`p`$!onG<mg6YO$FGfZSpN861R^%a$pxJZ8UpB68eTAf
zmgBX-W^73Om}1)aMY1Bk8UQ=*w`^PfJDYBy2^uX)*=+RZm7b5*$~)`fdQ^kveG4j7
zKv5GdPPl?hG?u{in3+ayUl(ksLDOovkcL7ejUFnU(5m!a(#eyj?XK>ydWXj2dgOY^
z+!bOtK4#DrrX!8|!PNVSQJ?sy<o;+y{NrYW<g<^eJWh+oU779ZoZfSW&Nz#kb!a5M
zGUNeMuE+mGM<@}3JT%RUG?e22MEt%PpH%YDr1Q<;x~<*qD{$~_JcV*)dNQ&t9~@1Y
zeyDH&?vI1j8fOG;L9ibZh-(C0fXz~rjh{e(a7EatLciqU?PNP)$FpWXcSEBlt_ICG
zIs*3^?lNw6uR!>`sl^1I_U{#!Gsp;wj}VLIF-4tONkjpzjLKjH?T%Fy3J~MB(!BqF
z-pIo4ruO%V>X;6<PzV9z)@WU5B*NpS89V-ZwQ?m)uxwW!@N;2dBZ3ilk?9BU<QH7q
z_YilxKJoT!*J6a2K53u#!|U{+2^^;EJxc7KpQit`)p&2TU&5{^$zl+MT}een?tihB
zzLM~>^a2diR*DHEn8qE#S=f7*2E1@DrF9CBg8Z40MjJ1f#`s}cMTA4QuZ|8FBTjCP
zq#rpLS63$NmE?UBy}hPc{|7kfXU!B^_&|4GHmqAWZqKYq!-=W%6;hpbgfwlIDod~m
z-8=I7V3VFPYpBo`_9Zt$?eV$gWOpQu9JUEG-H+8ZKJhb9O?j-+-#*^YRY@|*;r)6K
z7;mU_JcnC1>l~EjNuj?t(8K!oP(v-`XJjazq=x6%@M)hK2tKJqCLnkyc&fI`^<zo=
z4D|PWTQ|^0bIFP_2Lt-p2P3R~;3mCR$$N?oA{E<`)dICPYVj8dhQ?Vw=AcG3$a<tg
z3^(i*qb1K+>bs8RLX}!lhGNtN7;lAI55X3I(O4hM!pqQj?;MM_-a9t~@@5}Ug`rBC
z^)wt!S$A!92WS+`O-nQ(6niVw?Vaj3VU$MLu-l3`_vd7noy+7B&E5&cT@$_2y_W4V
zLQgVbY{kP9(GN(uaWJWMW?0pH_Dv@)`Q`s^HVR8^q3j$4C7sPKi_6SAG)nzGOsRJl
za+5LwE!vYeQJVu$vdYJsz|h$qS$1v_w<^KxNq**!urs=L7zSbJN;Y7F_h0Ni+C=h~
zx<F2wIF3QmWx%f$&kT*nrCw9tNa!=vMmkN+h+>_o7XzpOwHb)26@ZCb$!<qnsI!ZG
z9FzG#*VdAtK68SGEw5p;L`d^pP@gd$SDKx0`MFYGf%;6)v6abLS6T8n9g`WuInX<E
zUvQJ=lx2Qg0!@;sR7po`xr~bjS!V`-U%TEnVA^i7e;1Qn0F))23>&0C>zrXwqB-w2
z-M;}2nf`4@-$|~?!S2@=YW!@|tK_R`q~_v2bO)|B4F!5l8hk$A#_!|$g30^y1()vy
zMVed}mVDc}T!ivjP^7`s*Tn-=`xvDcGwd>+af4d#De#kM(rcQmv$`ZhgDtl8wjWP|
zXsMZu`DILQ^+R6)=SX5tY5;?1+W!}ZSl0$osRxK0Smn3gTa4V4Sfs6y;9T<H6FwLh
zaCXk#W<{4~nv)Suiw{Lp$Nahej_dEOUrW*81wEN>AGO~|eFbzNJ)Ux)uV9ZSqk4!&
z>OT>biS}l3_vFyKxZ4ud5m$ufFgN?1K>rY(rrubn(WC?Ya$e}~>A|bA#0_dR6$_`g
zgHr#$rqR~BV1y=fLFM@)>`bmChhZ3+k|l!_mD)t##V#ArWzY%msTRxJ@NscQ(`}pO
z&!C#-0=o^Fk1}m^*TuHgArZ|r-|BGp-uvJgJl+&gon4B6H8g-8HWkMKI-4mX(paLy
zTi-K4kcwN@6%{uv7nZk)0tBgukkLFX5$8i6F%d%Iwz&>?j3Qj&BZ!wvpZ6{YlFA2<
zcL3G_Amm=jcLDUDdfg^K9e)NA=W5<$l7}B$LQ|Tgl&GN&&jR7t4|M<k5rUn_S?}w*
zA2Gbm)Nd|g0vvsxog(!=srcsz!#6__>WU9F<_pih*7)6RvF`~DX*R@U8Z}6Wh(CS`
z4QW2<jdF43UX9Qj{tPT?YHoE3$dK-i68ssYq!DI+Q+eCBw_OZ@gfyz{8lSy5tIF~v
zNys5-X?2bsoqY!HmI^6pFi-D_Tl_(Pze!1hkj>M5vaP&15Rx^`P4e;YZZSVZ_$e}S
z9)fmWE>$J%gl$A3iQY?X<qldHS3{lrw;;=|kcDxrP37%ZWnv<PjBmA&dcC((4=#Nt
z6C$0(A$!ewg$vb7vG#6AfdR+}YX)92!Y7gU5oC!imgV9jwf*1{DF@=xn<}o&1Q0)j
zT?>xIAPBq?A_(07V!O1;n7o8ufLOIEFrVlj(MAyZr^*CO>`E>BD<3jvaui;Z6NO*u
z#X~g#N);fG)D6~!S)e{Z?MAvhkZBscTDhMDXo)lAU01DRUc&uOfXvy;LED+>+;~{d
zf3@9=V9}^XSs<VO1V7C9_Lc#OMg*o~C3?)V*(^<jDnP11Xl<_j5Kq?Q`dCRIAl>1p
z7*@qMnl1cLyl7oa9=}Q1NXMP_h~Ir0S!e)f``u4!8;L+`zhd`k()XqC)szjdB5X#l
zt{}TllVezWEgs_as0gOge}$Yeu<aZFv0{|!4a~MIFRnP;MqGr=O3;^nM5yD@g#a~T
zt_abq<_TytLO|3SDc-R2V<O?vK44v@B|wu9;l3j6a5S7;#Wyca^_fEF?HB?=kjiD9
zJ0l>8K3nq)2@tz9O1fDtomuZa;3RNi7fOc{EOs@U`W!hXoE<NDtA+C2>m}br5YW@$
z%&11U@^b$b;2Mg<+fm_#*8@}})}`_l^%g%)%EP``^#ZLkn@7>e3)K3b4v_W_>2MIC
zPeJ)eF}*{O@iC9^TaZ!s5Ib%OiSOv?K#D#MV6my!wUg{@!BXX?e}r9&jm01gTZse=
zbpOTfLLo-Fle+-o(Z0|){`|j!o$_L%WO=a+JNWIZ%Fui8<SSK6#?vu*SP}Mm2k9kl
zZ8O)Fm-t|Gn9DaBg(b4kjT|Wl|9uiu!X4OinnmxKsh32$;KU$JQpK_7G%Jd*G0nwx
zf4V%q<);TuCQZP8Ei-9GJxzA3Q1m%uCe2Gt+2P=J8vQV-ocbIxljh~fzAHSZ#f@(%
z4T@tAY8Lv*1y0ueG6s@h1uXeK^Py2~J9PII=+@){v=i@i{CJKDPE_nEr*^P<g+{Qm
z8(^8&FQhdhSEN$H?P?7rt`DPGu2sJjBy<d(`em@r$kT_YdiPFCbNT%Qnw|NeODz0J
ziJa?<br>gymE+HTOy6R7**;caZWo4K%7NTNt8)H{%k8Yu;}xCC0fU4J;G7&f&B{6>
z)Y>C~BRIvcY3teIcE}m-m{V`zvfry$XOvs8uPso#&}nht>Dm$YM*2xyQkrRlhD1Hf
z6Z~Tjgduy+OW&~-a&I)VEG|^j)J%^JKpiP+`XHdelP(T(-ukvx=@x={*`8rfYU227
zD&&Cuw_3~yT^#nPrY$g)l=r@S{RIK(A5pWhLD|&*h%-!PYYB1q--G-i?A)#-24NW5
z61EYK{u|qY1c{$@8t@4TV~<}~w*@Dk%3OPXCq>-a_4%iGdo}yB8&BcUX`$w;rwH-^
zYKRBkO>251FS;POz|e+(X+gs1(uS$|o8*<$I?PJ_A${)g@eEy;x|n!p#ujeL`OSzS
z5cXtoeO%OxI`bDfFUTpw)fl1est*q*O&UYd)H|v?y{G9Ju3inP8H=^ixg$37MhPmz
zcDrhDe(EMGQ=Vzf0Y{YPaLHcb)2Z5x=dyr!n>BUyDurJTVFbfleh3a%%n&&)ShQG}
zoSr`d=g-h8r~mz|9M(@=9GsP!jj3>XD2-glUZzYejAP-!L%tSDrDQ^D`F)!5vI5lq
z3@F<4+{HmRa&#uCP7$|V(@kFkOmk0QwCR3PB|U990ixzw=Y0|-f04{QKLx`!<|K0r
zrnKT&l1?lLq7qUAe#j~36nT0ErrMK)(Cu1<N2>WR6Jp%gn|r1%LwNpA5}ZL(O>_}I
znv`_M$JeBjECF$SE<}C#xKQ)rJqRSI+BEWoKd4({oR5unZuu0!(q=N$tr=(OaD`8k
zh2nY0yo6~&Vo|?e1&4L4|KBV5<Llg#ECxX!x+M@1*#E}nnnc=~kKTY)F}{H2^fLnd
zU)#oQuTH#%LwU*p+_Qy`(7;3Tw<+kaT;Mp%mE}Le^XIbRXXJtaO`^AU4nwrg!(8~%
ztcka*OpsQCQ+*u1G*;(9E*Gm|AN0!Su_GIAg~d){t}eY5N3A-*XJ8ZU)>nv*UJC~@
zf?o9Co4nCgtK!Hn4+Pt%fAj4p@5Junv@Az&&2N(@T5(qkZiHjzJ+4mJ2{qwq<{eu>
z%rCq^C#)erdrk1(j*j8{(v7B8WL>Jt6XMyUzUCuzw5{oiq-u2uFgT;r1MXen1Gau3
zjVjMTp=e`W_K~g37-vxz7alp#XQRah8^m(u(fCU=8^t$OdVn|ysJ*Yad6(y{`3dNJ
zy*0KnsDR58=3P_J)ojw4lMKEZ5@%#&!PF0!&iD2tBQ$Di!Cl8u(Kh3OP4*EPYFF9>
zI2#U$_eAo?FbU!i6b_C@_w4037Vzk+6j!zxUknA{D!LcTtDi2;?RmW9|1@sdxj4i!
zJlKaTjVbU*E9CkHD)MmH(##gI&9CY4lYDdamZM%{B~7ldxFGS#kCv}q^GDbj9Z3wr
zFtjC%ZGro5?2b)r@#Pe-%t9s!MAFlveDPAU9&z`NN2)cpVN|4}A_P<W*F=<p7~@j!
z#Hd=u=;u&d$fqpfb-_*cWP1N}3|e%N101*ZV5>7eCQ;{XU#yQ<da<Ba>#@b)<B`w@
z*-Rk#?td?&v)g5`V5JIrBoD4;nxNf#EN0c#i2gqmsC2p1Bz$hL9lQM^3&v{R9m8=6
z%w2WJ=o7(6vF6uC^qfwQ`8*5#{x7P0EaQ8|9*5~Za|DZ3DCiIH1yZXyfG@8zwnkF!
z&n#MI1X8P!!;J6}N=A<0=ce>_gveQJL;VMvuV3fP!dm?isnz^IXP)a28nq6yf6YLI
z^^D9|iAmiO))TEE#ktqmWzkh73>tkx9jvA?z4V@7)wyZE43<#s?F8j-p^?vf<2qio
z=Ij!X66OJMpyF~fJ}w2pka6WWl(^N=lS)CgW+?&bp~an;^J5u`E&c>w@@*?+xba?U
zfshQTD%|#X?H_j^AqB;n;m$H*U&X$#UWWxEHKR&de(B4Cw8w7WG??YE(7Y>t#|at|
zwU-Dmm7*2vJ|Cn>s>!W}iCH$Zr|l{OQmZ~*#T@+zesvu^Bm5C|WycbOFsvoOcmIv;
z<0WhPOWQyu3<=n>j*CRP^q(pA;~n~wl)<rm(s#d+q0V;`q{za+=gHK5o)Fw6$)T$$
z#4@i=c)YB(&9|b^;hug4v5^tU-2`3MQ05Fb=cP!xqy?M{(vkwJhzPhc^4`#8<jKW|
z!9W6paR$E&NIz=LHU6tkdlk9q$jGHX$uk&zGSW659|7`&=IQQ*{`3jf{_05iuPNY-
zpN%<1qK5n7Fyt85=qcz1vjWKU;j3sQ(z1Z!H3R>4uEkf;$7DqpaXxEdo*?TO*CblA
zFdH#uyoS>~RHTK8cD4R;(<a-IPLs9+szLC#w(vh&$3#1EM(S#1bn+pCYeN9+Koh^?
zj+UZLK5tqg9a*`8gSHLg%Wu;7)%Ng{K@o4*m(^wW!d06CHm(6+eJiXd-Zh-d(4!Eb
z4_!^-wyWLSaE|ef9I!Yt8Z{H!z~dMEoz&b&5?R2lD&XwRxqSXkYW}lI;g^rx)GICE
zR~2+Mdxe30k6`FfDzb8e-Mwm`kE+@DopE18M?TF00Jx4eH<W8R9QibQ4n~KKr2fQ=
z+#F>`Kfu}qIX{G5*^z}X4C`pexop#aV@n8;vL7o7cpk_LI9S(R!1XQQ8@tes8ixHj
zVIF-86lKFO>v@j%;qBwQY@k_p2!SWNCNPffLr#p`?Fh5Oc>xjQ`QzG;&}n>@L8Y7R
z1l-94*Pr-DG!4%iJsN&LG-KSEOyfXkrsK!9V4kE<ecspz&Ar}@k<!r*>{Ro%-02aJ
z^xTT=PB|;+E8sM|Qw@Wi=r0vc6aYYTzd}z%HZH)1?hcN<SV|`_k%RNgDj6>B2=1yu
zN%fKZwGg!b3xqKkaWGx{z=%wnI(h&x?48*Wwo|X3lp^^@M5S#8w?cOZ<hW2XQ2~A0
z>C{karHRUDdKJ*7EjukjgD+N-L`G*WjUCRGE!gBnNxh7RO=%?Qm=2E4M<SpHh-bD#
zSLZUYz(T)7fjmG@j2JEkR*j<fbD&YjBN5#;3x+1ynlv5r1T!}_g#Lt5Zc)$FLdXXq
z549mSW7L-<RIfJ{PZT&#jkNcyP;J`OcE}Esjb?yQgfGv{r3m+r5k=Bssuw75myOTj
z|1D1wQ2}2u;hYxL!ZFF^O;;c`lZ{-2%aX1i5}|T}Ghx(c4dYp1$;kdz_$BPRjx2^j
zU`rARF#R`ng9FR`>}x<{$+k!v{;hz-(HvGy3v?R!aSRY~PK>X2!y(F2gcni?A->O{
z{4VBX)Iq!voY0usI-^8@3&Ydjlp%8fYsCgsluABDb9#<&je}h7!-trXp*=fsw01JC
zu{n52p1inE;2=NE*>ktlyDS#t0Y9gJ3gqMZe!AUH`7Q!_*qUJU0E?NNPvbeXO05S2
zVRp6H|Br+0^f3eoozpb68bs4SGgkL{j>B&BAw0bo6zzBgRL|_=pH>oNFM98>$xONe
zB6jyL%ivGuctz+6I()Z!#N(Yb$P3CNE1Utg0=Q)%SkXpLEC@r&hS`$`E|+Ee96?@C
z9Y7~XNhroo0lmjI>#Y9(dB-}+cL9h`K;~dc1WLk-KLf1V<DHvUMyqd|rH+J~HO1}^
zQrnrZ3|%H)ke0@=yZM-U40Y+(XDJc@?J>j#<1iqJy|VEXaww)FcK045Ms@C|F+vv?
z6O4T@_e62+%kV)7bzY6#QQHu5k6f4$(L_4Ne8wQ^`0V@}KPP_?(BbR6p;WHWH&i~D
z2(W3QVQ)IHF<LAT@+$ubJEJ3pVGxF{1Q;8<|6(oI1o5Q~P%cS*7-R8tVldAPb4l5R
z_A*B1$py@_G+2SC?e2Mr{)qrcz<7(RHpp!}0IEnE&<oSfkSi#LC2&8Jqv^HURr)pf
zBN2K*x~@jxnPyiWzG)>JfS!qg#w^<pV1o4KG%!vheeYRI0G9&az;r=bpy?Gkys`U?
zEJCqk0dpFcffol6ap&fb06XH;3xY}X<U#z|vsdeK0gA5;CVR%rxo9mwKD!qY@)hmZ
zl$t1i2E*xYjJF30uw(RG60oO{M&i_*VP|QTKQDnj`(n5HO(Z;(EcYFVF-;RVCBt#P
z=9TzfgX@_WzFS|RmvmO|i{_^V4diwx?+!X99+$sFLhyyc;fD-(I#+u5e+lwgK3<nw
z;H#nqD&l$CAvz0C$I`8fm%PR!^ro#L==<b`Z|UJF4%0OHOmGwj&(G^f@-0I6hx9&a
zn^<Gg&pVqQmEfp0Bpf+1T6K2A4QA*3_k$4tX|cBvT%osU2QLQq?5=^j%GM(sE>#NL
z(5zOSm7c`A5BWo`lL!fqN4xNuwC<|&3eczM3|*ImsmgV#-ivpX#y*5yTb6|&4BHX~
zN?>cV`nf1H{fZ0Fqa2jBdHrfgR)EV9=ftYIj=fSE+fhS<)zgTG$D+GKc+`-d=E>n0
z`>P>M{~0`v>^k{PjQ|||-RI&40bj2q-{>K}*cw9p1WsZJb;L*v9q+oSagHGe$@Z4y
zX_}}6;xm`{w%359;G&%tKoQNFwAAkHOx1UfrV&ecvby)=K5`EH{e9|WYA~CoCzeqQ
zs?<LG^)gaM)5~O&K9i-+&_C#e(ezTO8zs`!wXZh_(zIm#Hs}{NP0rsy*E4SxFHsA?
zz<AS-;K}hdj)<Go*`CZ8dHtZFPWq^Ch}x$2m>iygAWaFl&fX;H!!fTCK*tCVzSlMX
zi2MdBt*AeiF)$hu?Kjif$ne(DE+9zLl5C?hs@)}Q3&zvf4L$G;*B#*a$>ETbeSk^C
zJ_GQZ*ST$na#+`Qh~4P0D0;kr&PG#CF+mAUZHSI&1!HZ~m8O0MN@zIoS(LwgBpZSl
z&1$PL8}amHI|KNm-e5XSxx>2${X5rNX&-CA-H5@E%CIckQ)XR3W05Bx!<vegI$ODh
zRL{)p?X+fPS1BzPFiGs`l_m|34cXs6Vb_-2FbD&$BoMJy_rF+6F<Sj}a{(q98<6*T
zAOdY!4KzJ2RRnAB>w1_}KL%)e4VIj*NtgmAr4)fh7g1|&FnT7Y)@KJZ&)C#%yJ@lZ
z^`k93!OSx+so8iVQ{S1#^a0Dvv+(TF!^&BO>(_yakPqnGMHAL&;Efzj&F~w+d??L1
zsN(-Cu$bo5C*KGd;*aV2(>Mncl%w@QM+>siqhGRip;EFo+(!G#37Z!yILp0JbI;5|
zy_Rknid+<{F?Dx3f{3{36>5511*vaE#hdDQ2o`x+=EDvRBk$;|D4O4gDK`ZzG;Bee
z-s(`alROf%;It9?)(X14bhKEZUdYupwwG~tU;c7i!sx=z;0%28rFPauNarrBE^Kdw
zbl3X3)1kC$0!GU#sj`!R@m7{X5}#l(P5%YB{XSdmGbFhITg)`d;2`hBoAS$_;Pi-A
z&toXC2R8JRr~}es1qb;>@GvCJ1Z#3LnnmLiwZa!f9IctAToc=cJ!=RK$U_>IyzUrG
z?#U_Gb=(F>(HsrmYnpw$fZUG`-o>cTYyUe@Za5~mGqo-nm!cVs0Nzy9Gntb0SwDoG
z*^vYx3`0`_n?vNE*bY67MD2$r0g9?V43?~CS4d@>k1A)yd%LYWj>Ny!$~;RBJzxj7
zfh%~E4U~B{P7vVdC|$9b_aCs*04njXIW$B4mGTb%6@G;&;ZgAjGwE@G@Asf8&F5yN
z&)(#cv7I+m;o39Q@i_*-C!)dDTtpGlMWJcgA#Rl&!$HUe2|1fbRtA=(Hxxizn&cEV
z6lh&Hns)g;=u(4`qEiQRkW2Zog2*%#5N)Y47oav<@gR|A$mPCH$&CGG*p4_ZFij8Y
zM4#uE+=7QKL6K)`N;Vv{A?|QRUo3(^;;&x)riD!~%()c*Q3T623Q@d~?^hLDgtn(2
zB%3~8#QL$9fK8tqb{rikVEg+*?vRMnl*fY!_gi4qE~Su8)9QN;-Ry?&U-l)@^g(E6
zoZ;I|pzzR6WD}O<s@jddis8k4B*_btK;eBM(_y;*IC~`jkh3iDaX_?SYc~D`g40x{
zx1{_|&u!BREJ)D}>6m){Z%c`3%kM$=?9{O2n$o(u&mTr((eCq_M<=p#U%BkaCz{NV
z<vPlCwv$`2##(5Erk$wOhn&#WfAf#BNyUcJ4O$8%_fLrbBkatMB!pognvySBQvQkU
zcn9>T`Dg-w!ca)I`ue?oVNQh|cCL~+HjUlJGW@Y7k$ec_EL}eVu?rg%-L@^(u=PuH
z$OJ(&p=XgQdP<-yR<V4d;wO%u5%Z3we~1O^jO)$sY4kYorTmTtfbDop_`@n+OR2&-
z*hpsxy1amabUCsK;F<C8tKH2?G^;lppffE=evO3zvuSN$0MB?(8}EJB(Vl2UTG&I)
zH4JhL^28U*-7q{VI+bla3IDFEiZOxgcl6gdp_zGMrV%gI)rwCMkD&3nT7^?D(~Z(<
z_n3FA^O>V|(yf<-He$1R%<8o5E=!+H_zV9qkkEYUN=?LDyZ)&DZ#N<jhPz6mZwK4(
zn}B%q#1bhB@R<=0Qb>(_PSex}Lu}6aqC9>xrmkk)r(Oj<XXy`-rI)S1e5vre1co+o
z@%fq&TnFUtdKHem4^i0~6JBrXBNawxp7^~rBa@}4Zgd!(&2scU1fA9a%XGi@hJP}m
z-A}36DDov#6$oi&(rlyN!@m4<#2p5mhF;|}NyjlM`whod%3!9%#fKP2-jaF|)v(i|
zY<TuYyS$sy;`|YIZpjhDAP~F~NJ4`9Uo25MrpXUJz^c4{3Byd!?+SPfjijU~w`8=9
zP%qgu2hG_Cay*WFT+0I^!V8QD)9l(GE06@Tz;VZnJch7#PUB@xlVO?HlS1^XwIXeI
zWVr!NdoA=i<Mf|(cxnD|&LkGRkB=1?)SQ#M{wUY7#|OGYsZh%WtYFTx&&qUXh@A--
zdUwyP<WC<A?aXP071w|`KJt%0vESf^=iL3B#{jsy`iMvO+_Y6dj%W}!(B4ZJX*BS>
z%4<n_W>x)#B-v1Dt3L_quh^@vJDAc)%xrY%dcOs3$EXFgI#U`O1=OFvpZz9*jYf|x
z)X`wHy_YX~OlAwSV1R~}h@rN819Enb6<?O*CSh~*$6!2Bs5r&Jw(QZDK9R4-l`x}g
zfOdK{t(w3Cy;->zrWnt|M+=lx8rx$7hnSNwQC|la8;z5NvPBEDxK-!`HX2<gW3yZh
z3gm9*w;{L|jJicdb2Jb;`W1@ej0Ceh4d;4TqFn&a8O|`#nRU<ZEAbG3DTl15K$@~v
z+qer!2BfB){<7SQ0CKf2hG0f>VG}=moePe{APhrqw1RvHzW>EmY)f2eB_Cjrrlk;w
z{oFvNqM)E$cI+^ELQZG!gyDnT)1^2@D{^b`qNKW*Kf)Q;53(oZqC|YPBkDw?NId~&
zYkbfYM|)dm_d!Z)8R(+PJ*fj7*7alRIvTSPKAV^Nj%=V)CG?;89%)!}Y{mfZko{lK
zMN{K0E{A|fna~<ipn{oXT=2eT5K(J7GZm8)vX}XI@RM)1P3xLL%Gs#VHSl9!xQWjC
zO?ChX@GkPlp=Yl$`b0ME(hmVm&8zC1CRBFHQl!+qfs`|RuEXm_5&PYA#0cc>74=%n
zSD!|p#Q-4XtZwetpT31BqQ@d6M)3cfwBsxzA1t-w0LBE6!5q1O2mL4d%eIzPtj&EQ
zrx{0()fcQi3+wg;4)kQszDwSwcRM4iBE1+gP7m?3(uffVw{J(&A^K3DvUS4_#x}Nd
zjob)ITy*9G{6lW0e`H4yr=-73XG#)g!~b~9w>Otqj9`}o)a|;1)6Ty2$&e)=*r5rd
zwd~59|IqY$x1)(BI2X2ayIeXj6i(e)keQds<!Ndl6P$2>Sd`!0(g{Bv`u7x7B!xzH
zik)A=&h0v45C)<xfdRqv-&pKytgHOYHlVX$mWSr`$}aks3I}(6LQnVW3i@RGec2&L
z`Zll32)NfUe`_5JfonFxxoPFb#ZBHXX26-IhF&y@lus~_UrNQ`EYs7T?ufF&(ef2|
z(YzrlpHaL8rhnjT(t+$mHH`F$>tF1}gn(vUZR7RZa|~0K{wDyM;6sE6_1Txd15dg=
zISCIxyG0Sb`lWzvb8+B4bb>vJQou7x!{hsWEsWS5w(}?OnU!8d*8^B%^VY3eRI3-D
zY;#hcq$!10uLy&)5A*fU;bAoP_vSw(5Y3rFoYy7+P1CAJL=??B?^EF6FHCmF>A&Sd
z^D2DAyBNj!h0{z0WZ1OSXHSob%VVBeyU3T}<i_d61l-TUDMF-N4ZV<?y%Ug@3UCY$
zv-Q%xw8{?!H1ScJu#vxE%*$8k><lntTHx^DO;Htjd%PzcZ>)iR%ty{^D&+Qf?`ZUa
zUuMjM{dz*Iq9|S=#%v{U>r*}jJ`;_G(HaYDSpO)D?Dm|J(U3tpTK=33)La7<`Z)~1
zn`9`8rxac2wh@&5e+vB&c5b;2!Y~lsQb^+1-v7pKDc}>Sy2Ed!B0wRr$Mg94KQQ=$
z<#qWY-FVlbD>f%vlP+XVufF;vZ#Mnd5*~nQs_Z;ptu8ygsE^pupS_fokg92Su*Bi4
zZF1eYtZWOLOEPVGHP(GuY}U91^^7T17m3H&74mf7Ls`0>BvSnlWOQ|0X*(%|7i=Uh
z0MKJwA5?*}-+8B8PRwPz^yA09KRo&B`jlfX)3#zE!6#fYv@#kmfjr1h*?<5?yWJ&Y
znVdNObz*y6Mnoh-nHH!UZH^kzwbb=L>Y3hGy~UPMYbmrramIv0FsPV}@V!HKK~YJs
z2|tVQnUjm552!%s>i9~;6SnsCxzJVHW^gtzILn1vS96mxf)j4`jbo2w*>x)yoYS3=
zG1fb$I8iUA1m>9mgSB9u@9%PR%LD73YN_3b5gMBHm}qC53}~yZ?Q=+V$)U}}aL>Ic
zEw=oz0a#P}<z?1#>`!K|wR2>=@a%iJ2l^Q2vu?4fRCvJ!kj_{dOgXC%pZU^{=03FE
z@+=QfaIKY1v@=#j;P&}E<^X%uJ3Q$#u^9{x$FBNH%l_{Q-u?(Xm)wS85Q=W4J18Gx
zK<aLy3?gNgSyx}bs^K!C!$=8{-^VuiaxQvjQXAu#qehWFEfP+^n=#x?iKtLeKDq{<
z08sXn0O8VPz|K3yLpmo?sO1a_ee&9Okx$h&C(zAQKqTD++hL9QIvV6jS<S9adqKi5
zrS>O6t=5uOtF;RVA*MPH!W;a&w$D~p8&^@C<_J{?KO3h))w%fFhv#g1_8bB2g`w5x
znX=mP|1?9MKLBr!;9%%wZRP(s_MQkhDBRLcTv3G1aSM7PG(;{0oB@)3toio}+6y|;
zR(U9%F|f^70nOKreLP3P0%!Rg!5UrzC@A78lf>S0gx%zB*aRn@NKG4`X-2y%qsg*3
znAhTK<J`bKooVnNf}llooSxu6!`k{?c~w5LQpZ6Ew77&Cwq;2%c>NQAAwzAV>}Z*F
zj$;r3(-dQ1KnGQAoFE11%<@_-lb~W4{aKx)5V;Zo4(B_!|Fv-R@uh_K%od!tMpH4k
ztnpb86dv14WgCcG8Cmj9V4JyXSubZvw5~jr=Q|Mqi+QsZRp3NNhLV$@4xTkXa-zu~
z)|8q$;ZR1y0Im*o5X74T;Op}W@VMPyf1hvn=kxXPdVJrnFaI!hHmMB*F%-T_PhdTb
ze`e9c6dK5?g%EuH#?hNMI1E*G-sl@i`6L^R$??D5I_iG8-@dMw@7wQBJMVGWK7D>X
znzGyRiPo`Ic08{hS?>P4I_<&%!~$Xgfe5n*OF}>pCZ-VtD11)BJ;FW0ON95+w<Nqo
zc!}`dflY*(5auAvYU3tIZIENn{0mtEvIJxef^s;&m>q<#5xz#a5;)>WKtkApu(c{+
zg6Ow6KdB8MH6WFciHM#>$!wyN)@<lm6hSg0tT|~arU)Z5ka=ko)7pSIAw83HI4Gyl
zPV0HBf@Fpo6}6&rR$;m#nWjchO`;N_Ogxj+XsJ<CQyxbsA(^U1S8Z*1_#})>@yu7F
zuvP~c7bX>s%32e@4ob?j$Mn+LHh}f*)`HH0;<xeZ!{?dyps#4VSj*TYy{F5V#zJ=m
z*G_cZ6+9CkbQV6qbm21fF`u)64@ydNSzcPpzQEsaEu95N5G)40BiZ<YzJiWmQ7N*d
zq?XWDENZKKE%LQJYW;Cu2DTByPzYVA4UpdLzgVRT^X1AXu3aD^_T!Pfp3JrUuHa=}
zuSwGChsCRVb4`vA%hnq#V$)%US>|@wIt=VtmI%fsJ&AdR8NufvNBt5pt;p^$yfVD9
zRS@PCh8}(hvO8?Z!@R=vLw1KLA6xlgVv*fpe9!C-8~8A@F!(U|qX9MSX<lLMksJ#2
zYS7cfBD<puhC+%O_`J?p@OVE7_9S@xC&wZ-Uu+7qN(I%xr_NbMN<GQFCmALECC4H*
zDo|9QR8UO?G_(9ToXR|=HJQ)-m3Shhy^?-Y>!aoS%*xEtMp=3sDXG~+=9RX|C`lPF
zHJ`}DGIOrXm!`+fC|W;THVQqXoFw&U%e>My;p7Ohck_u%EHk4Dvv+RiuDA2G!?yG|
za;%_f@#^|<RFJ{ATLEQSIV$)$*l$kE?FwNShM_A#lSt0~i}B+J4FQ!7Kn|9#B%j8Q
z{Tan89?N!I+CDFD2hX#xeQvg+WJM4=H`_`3K}7+a+2PxXAgEA++76u8;r6RYLTyJG
z5b=E=FKX0w5_~8N!kHcI=QGNJ;4)IXGm?Fgwq2KYVK$%WmwDx586}S#w9BK=i5+?5
zplxJT;Pcq~_-!2JVzxz*e#67;ALASwRpdBhpKKLMGTDf;A{9x0BpZX)@hjP=@}4WN
zzT#>?$t&mCe${_(zES40AQl@BXK7Fcq&@f2RufBM?KlfNctci;gykn}%o?TqFTrep
z?`dC6OohEg#(HHS?=>d$RE1&j4K{B_W)v`eOht-0v+!67P0D^$p=8c0yfP}1n8Z>Q
zhRqja=Yrcn41~}txtq$s{V&#P%V0HHi5$Qqync*7NQsMN!$6otNI_#(W_G)y46&y<
zqIDCQ*KOGL(UDUD8*DPMJKjM~1q>-{-qGuAI@YrB`E<VjE7^FMPSs&zHy);wLk^pF
zG|bvN+eME3Sl{f2S9=HX4nr)PcVuD_?=Z|V-eL2O++~ro60-|3z_C8NFGCA^5Z8m4
z`u@MZ-oA{_D7ZfUF86Oe+)C_1cs|Ik!TSEc%q+|-vS~1z2J7?xGPcNG%3L-Wa8)ya
zWpXiDmGMWks73(G*uwN9N)+~06M!|TSMEK^WnWn%y=t9-*Xv9>;P_B|olP!n03IbF
zPCd9Xx6BKo!oNa{D!G$@(LNe89{N>1H1QWr?s1~hD^=N@1dKV5D(zB-m`d-2U^KmS
z-{xq!|I4$~Fu63j93}TySE=ky2*&B$f1|G%?K+j-$-!uP>DH~IrII@#7)`E@lHajE
zoSgxR12GH(zZ7SC3I6}b4jPZl(o$XT0Ty1YIH4M7saWrlf#uK_UDA1|8|z+Tuq^jx
zZQbl%eCArt&2nybCrc{UyF_7m>5G(hj&_W7FKJkod$Trgb}!bsL}6LZ&F+M)`~2Ha
zqf*{YMX!VR!n3+`ta}N=vfP`sd9!=5&Ls`Ya&C4fQ!3WG1Y*h0Jg0h6T{_miWMb#i
z5AN;B<$GkTc`uO%?B3Ds{7A<dm|*Obhsr1ACFIco@PmPg2OD^FKi0y8W2ZW(o>Z5P
zwJ{0VDG!xT%8!r*U4oSC-MrQp^I9+STK}3CIKo(;=4A<-ATB%4lHgr2c^n)Wd$=yy
znO998bin}Ik~r~@pLM<j1Z+j$+Y>qDW_La-v~)b76=Y^iN?_18m{<^-h2Wrf#M<_F
z5Ybr(5Yp!9#pCfHqO%YnBtmG<ZpR*U^0N>nv;_xjaYFkKoY20ZaPiBj9o;w#!!Q`0
ziB=O`_h0OQ!2AUyIIz6|WavS%oAN^&>2nSzCuo8j>51YxYa>T!(i6rt(4ez9a*QU_
z5$tIC$?E6;g?T-v9iTvGcH}%wh@l1xT;=<qxS$8)>;+w3i#7ek^>n5t^A@dXhaYcI
zxX8hp%!hXQa``?eu7$%jL5NU0Yx;>>;c!h5qBZTX6j2b#37c$pcKLGoJ}C1!53~i3
z*wR_jS0;2GXABRTuSteG5*|5f)8adXl=>>)2gQLtVU8YXEKf~8ahx5u3CvT|4!3Hw
zJaXoy;%kJ+`YPWC#esJ2COA&{mapk2j<a(&6%2IR;g*jgM-JXp-121C{h9%a1AYGd
zL1gO-A$z`WM7I7VWF5h2jL_n>m^UyQA@!Z?!UYE%e$b9b+15yPKD&wBNDbTN&*piN
zAxC{=>dG*CNwGcvn~uOn%_w_CF*Z${-4BrROUWJJFbu*l0Q^$TQd0i^u}PC`BD&7(
z0~G`s=zQA!Ioiv*6Drb9g|}&y4VcU6NLK3!`~iWvlcjY6Hwm0JX#}%5gnl-gN3zn!
zv{VMy>Ude@X&U`~h3TA*^=TRlDYhkMLWgKyfV29br8{6s2jQLIyB@PPw(VR}=zP^f
zpGl{VQ7c5is1Bj;$Ws?FDUs~H&fLsWJmQH0IBBs77}tSmDr9g{+9bQ@=-SM>7j|tz
zg{o;2{LepdR7EOaIJN~T7}`noO`Y4fT_2d+O_Nu&RogasV00(N_FC7;Gd7HspcN|B
zw*?wTtjkm>+qJ(;V<i$CPT^9vb1}ZtU<#Nzx6ucN_VD=PB-GctU#aWCJ(fxN(Tv4l
zmPzds%*G6_PU>~5j-OOxjJE=06g+I<{jsoL6g<4|IUA!qoW~D^oZVL^9=p08^XA;#
zk`M@CAb2Gih3Ne+=7*IIF6!VOU@5XB!(%#L)phAdRqySDsw)k>*4s~2x9unC>8%yf
z_bDh{?#JBeI#CZwSFcU*9;g4oCT!t7(bopP2i`TMvRy7Z+u*yX^B5&wcDZP61FU*|
zuKfHpQ24H;>-V_EA93B5xW=it=y4lA<Fa*{CSR6&3gHC6`7sW7@I=71eHl!PZ$jYO
zx<_oR)Z;xOX7i7HrNhT$KDAKzxu~rw*cNhZLj}|4tL)1%pIA7XeYzg2e8S=G`$aCY
zxPZ9IKCbu{h?7X;RKX&k`8yVhlMrQgP@ZJq;=*!q61P2`WFX@LGA_a|SIY9J&RniE
z3}g2Q9KTUlBc_AuSU^r#ejsuIA{SBXWfKU`Z}1FK$1jGl>V@MssP&o-;$=xWrRDeJ
z<cx9{gkczZC5RA7?|-rFC(oVA<Zc(J+SrK-esIFdC2(27%B5x0g3M2pnm`?vv34f$
zy9Mg79iEIVs1`(iH?J>>*B8KQX`!qj^OIf*<$uttmO38~digT9pYwRoi`$%~=b|$|
z;d9HeJUkcI`Sn=0a2tOtQojib%)gG+eoiiz$S&3G*dX?!Jep#_g}G6mwsSHziaJjP
zvSWkbFNr2}n`0Sk!;25<b(v#3*wBJ~LGqXAUf57n((uBMPx@?<E4TTxAor78xe#a@
zauNJxE(qErm&FZ(<PYAEF4a)Av|*6@HEwtoQ$wVbB@Tn&ub3KwrGO68LWe=}2X)9)
z)ljv}VUYVFducn^c|-TMbJ1QxrX>9E{|;zB!yZ<*m)hNuhe7UF{M|v@>Gmp19|pl+
z(OyITIatWH7s($4A|P*RKW`CUl$?tVgFp;JSLzukx&0TbRO*+0<ubrUX)q}#za)gQ
zoDCq3>U2b$sAr77YCWSLFvN-&qHzA;5W#t8=M&|O?`I5g%uZ(`PSi8T-$c)lQw6D1
zm%M&re;e0XPmk+}iM#dpyiUFz+x7c4u)_yk9@vp>zYnCb`&T3yWy=quvAfp^piy{!
z&3b|t?Q9;Z$a>1AAD0}^>n5-B6$i)9$mp0{1@=~7d{kI|le@s)>f<&4qs+*dI$JyN
z*Y!u4-IWcFj!Dz$DvvB3*7neKFt7`Jv?4w#Oh5P#cT+XZofpht`58l1)7(qfCpNEQ
ze-Ho0OBZM*P!y1TKbdQkyQ#XF=ACMG{bUSPFx>?!SCK-MZ9hSw7K@{b)loHap||f~
zx1I>|oXz!>>lR4t8LV6O`~(ww9G8zjepKG+<E1`^Vr2+b<Wmuel`TJ+K^5uTPe0<s
zm(;f3aeUl3IinneVHk#9sd3QA?td|Uunl9ACl0X6>XJ5<pRCWp&)*BhF5OkljQ1gg
zin5;Aqq}OE%~h78VvYzZ=>0*=%ZMo(L1h!M7ts9!ITMilL|IR4E_#0;`H8X|HCH4*
zLHiFPKS!L&zy%ZwS_U9F9FYBlS?EaNfc76s%jiKW2XK(rVLc0^c*@2Zv7ZxJieBp?
zvu<wl7`^Jis>~mub-i%Ni91iNi#by=01pv*aOCC<F^}&EJ=FF`f?h9`@%F>bY(iP*
zh91?i1Tj&p{I|0n9?RTh2*8;SIeCv&#(I&oU$pA;$lx^XKR7y0v3%AOW5H<t!O47<
zqnR+0wN3XA@C#crp*XpTY;Dv217|0Ytp%(n=7W{80(o4(a&(JEvbO2|L1gWCb`th7
zk*#gof1EAB(-bCj<7C<N{y;((CUkvE<d8l3e=wozYeJmd+=$wn%iCD_pJ%u6i<2|D
ztr&)3;7*iNu=_98pYjysq2+5A2qZ(6?C{LzXFi|PSpLT}9#PKzZ5qGf{zpA0p!8JD
zE>Djq)f{42bTOX|r*2cMF9C)PQ(;g!cmKXMzr?mOhuztD>Mq6nGQ_ZE!{KnyZT#@R
z1kyF6oI$YMjr?%I3`wJ)G=j)?MQH{n%t+A!$TwoNs~A0)VFK40Ioin4uAJNK(?0^r
z_*zQ0p1uc5%+OO>N_P+6m7f}1F_+TiNrxe*e05vQ`RR$=Ew6f&oPGKC@sigc9>~pH
zFL|v8@oj;6UMc916$&>jKwVd|Vg^&!jAck&Lst0e>yvth)HQI0p<rA|-H8r(%PY5&
zGw<gW6_9uYaCy(Gh7%o7AZGWxcEi^O6d_Q7%oKE3XP2k8pU8j;IV^BggP6I3!xJ4)
zfWro_Fnon8Iy~okT;G(ws%@+4%R@Qm^n7+M^PT#Scn<aa-G9C~IRhMqK^O*pX?4cv
z{{OLQTJ6vj$#f5(A`t|ocJ5dXE<ZlxS-3jTe3w~Qk!97I=YldI=<<O~KD)eg`^!^x
zd7kAh{4EEUA0M(8wQZNUST`Eh<Dw3z{XnjxF)qIyo@d#P#<+AbtnVmV0mOqoStNeW
zHtj(f5HwRE33S=BTQ^lu2ShUHkk>2Ev)@oJ&3~_B3k%)9M8ICB7RL79-YtoMnpzn9
ze=JWe#H;?%(3^87DoKEPawcK<*^rP1I0>t(#IJ-EWoV&Q$nygB`dNJ1eKNG*chV~6
zc^F!FEDt{f<v&5ik5ZA~dEekr`KwtuQN?{;_H$lNSn)fVdC#fuLqs+!RQ{Be_7C>G
zZ<mNB+;<-lwLftkQN70=>=@Mj()>9?J9^^!vs#ZwxMN?o9tV}bi^mo>?7s1p{XU$X
z0dB+~3<SS~>?oN3f2>l~o#oPNP5Xd5VM2(_4Dh1ZhV|n=7`7?y7xs@Wx%uOJ&>-$V
zP!%DD9c(nHgWe&j&?sh~!RN2P{-+(tMN&bsG|5gl;H_H8HUWQ*OU0v;(mpP*pV|}7
zNw>KA=8#mZH*rx#w9;<^{=~yW+u6doWXr=-*e|5~2FgL1hqumeiu?u6Z<&W<%T+7=
zrq~}xqd^ek*iB1uKg=Q@Ft{C#)@C@ho{HOkI@&sR+*06AYEejt4sTLv#iE4z$%l^n
z`gXEewK{Zy{cht`k3qle{ml^?%r}>&XaR#6wOSuKp?){r!-5m$URB>ejAe^gEI1*w
zRx3m&+|O}oE_8x?5Z8RPC(yI^xccU3YR1pr<Kks+1?`0UxzOi%t>Z%f8skx*2fp}T
z=(pEw494?%Q|SA7wU<ha_z@e=ag2?xkxy(q$3L*~CHxn2{DzI|gR(O^f*1sWXiXtR
zvH!;Ii?^9GGn;fE#shTs9d^nE^xyd7@4u*#3H!%8+JhYF>HC!YHy$wl@mh{d^uP9t
z$K-QS0n4w4ewok3I~oSkvdKA-|L}_!4$>-pE<33Z{ZDaqnuo%95f|!TuP0_c#O0UM
z#~J(jJuc-j`+Gm~|Bim{cVat*2KG-x?6u#}FCW&}@5He)vGz`!=zqMMcgGTHSi+Aj
z;xu=$m}B?!EWaF%GtZuq6|nc0wfCo{-Ej=Ndd+%G`X=gM`|@K7mScaGpU1>;)*mmh
zK{5_oV}61GZY=aIE?>Pw0UldiA4up#{!?63ulol1xVqbD;2^rXhng148zkyq^9E5m
zKBOOu8zl0da08sSh1Ir}-=IFw-O5J;2T@v&P0tL&Yu+GA%ON{k+#od(k90^gU$WZT
zTS21#HE<A}R)cD>EN_tK`J?QNk{E<RAbO>gV0G_*v3~K$#ObVFAOmS6+T91WOqCz#
zE8&pU@WaaLZ3EmuSY*X#fh=&4=zj$qL;(k(j>jHn)W6~lLLJUz9ebXU{~9;IA}dU(
zvcN&2{}pf$1ssGr9($Zo|H>g7>TtfSW6v}4ABK3*8C9bXkUh}of1Ou7U&`lsq5fgo
zZDakCmk+02H`-ah<aM!-eZJrTV;job9d`UXI1pg&9l6%gzCM;)N3M0auO4^gO2ogL
zStPoqrr+di^NIxc!W*kdqWys{TrFy1C6&b&67jF_g{Yz$)Kpn~A(8$HUkLC8fiKA7
z3yJmzz98@gfiLLe$1cuWUJPN?i@b7+Ct%9fynHxSo9V{A=0z2=97Ll2otr?=+DrOf
zJ~w@!+f1~~;HQS7{dJp())|iHe}d<se^<_2Zc@89-?7~|bGb-gTsWov&Cxekm(+tF
z>qprcpgIi0F!V~xm-idr|6+rIo=Z2T?E)o%RB<fH${+GjBMXFNuZiX+jRK*9{Il0Y
zbCJ?W=;$>m2td3hO(&u8nsoG<6da)a9kO#zbK^vJN0|bY-5r_>2VHYVdq+V7GGe?D
zHaGr`&QC#@K>Iu75#zeedU9T?N5R|(OrGU{VShQY)l=peG2RH98%1eHMQI&Zbk-um
z`3G<|9jHZ$^BZiAE|EGQvvH8F*%$v;Zur3o?rR05NlM5Mo#TF~pfpJd{X+$1PEb@n
z<E%baP`UVl6nqi5>LifPpV^n1MJIjq_X5{Cn3$*!0@sd8tTHKRldboJiY8-*=|Cd}
z#pVB+>M|n6<|Lz`SyNvQV&vs;lv$ADw+B#_*JEUMYgUMH8of#9&g>>3owp=<lcrbP
zx!E_vKl#;-gp);)W1cqx4OAZeGB~!Q<D|?7YRzEXJNp6&mE)^@l<hc?dvqFPR*tWJ
z9^?mSXPE0S2*cnj^<mN}_rKVF?Ae~eroavWN~esH+F!!ee_TDd`hTDH<WUDu5hn>h
zmyVv6IGL0L>p*%8Y|o>glml6tVBm*&^pkQRL=NBXCF<G)eLV4n7{}Nj7di7T#5mOG
z{)8BxR0E+#_n(OIM88qRr$DR+R;l__PNg!B9*b1MAhLye;!-Z_yR|roRLA^md7Mxm
z&?O+KWZ#Krlz5<u{VW`2v+$r)yVVpPlx?*Xk^@btEw}idQVY?5W4Xn@Q)=y~`0K8>
z_;*Te{}vyY5}JoIeWdU^r!|`e)j*Ikf?qi@n`Mg`1?51%e|MER(+S=F&>HerM%fMb
zz-zzmh9>+~$H&nyyO0*>7I+_~+4Y`}kQlglM}U)UX0eU{zc@#NVj#?NJ?s<HVc424
zLonbH5R9a5#PcZez(nd%I80{P2Bq3fX3%`yy`P+&0dB-V2m{}AXSg2!|5&A}o{h3;
zo%R8Vb`b~`8}sXr@MdRZQt~PgVoGjffg&fb`e0SwF(<ddK+*CUa`LR49D6>EBItR)
z{XsrBTG>e8E-QN637?HqyL#~JAHt$-D3I0gkH2dow_!l0DEewMe74QU&yvW?I(IIG
zD?5*(bkFec#3{gj;>hkDFgrX<t4!p3xA0^-yO?>f^ThGJ)?>SupC+37_tNup9)U0%
z@0E|^G6RI+crWr_L>O9U){$JUXbm$*F~>FvC|+(X{rLL&`#AYOE;CsA@kZWl*4r)8
zjv5?r5nWwA)qSFCg94hMs=6Y&#;`C9sJbG$Qa;7mj%EQMf#GsRYmHKl3!{K4o^G}6
zo|#CiX~Tf3+IG)OuYixKqId<mj5o<pG>s;*bJ{4NOfnQbqhSbeBFV4|f2NE_WqBYO
z&MO-lhjzeQGey156XTsFfHj|#ozZmzF$e@}x^PR5{u|2|gM3QfDh>F7jU}<G5$(WC
zIQ-o$<)$0zgySyjd~vI|ta+lg0z*(R{r{Tf$L~9B1V-;Wp$UhBkKc9#dxFWprd&A%
zWDB~j!1xdguSG2M9}yp7;kAf`&#_o2@V`YYd^WMrk8BhVfuhd!>rtWmctWCP0AR21
zx_=pvXbWdtz?t0lwM`_f^m#pRm9NFQP#%kX5{29gk8;=eED58elIP_^N}2n_WtkD>
z^|~Pzjnu>-HTHg(Z~=v9JMW23UiNp#1{|bjZm>XC)VB}lPxK@fq{h}yzR{CdkeYM!
zMA(1}QnRBcWsw@;19o0PUO8Wn&#TLsyg+J-yy_q?CPE<Yl2<Kx*(DVpuzUZY_s@yP
zu7*&7wAwl0a6s_AHZ~y7=oh_zO|xzJ3gH880mbY%2l3pmcw#o3e}&U0jhvS}X$jyx
zYB-i3%FZZ<VHkv=SK7o#%Kb04FF#k^CU+O8q7+DoZT#~?n42i!r5mZ`^~8MNgtN-e
z@^Xmhs2b@_Jky~tfO?ofJyE97;DB@}lD?J8Pwr3-%+qjS^Kyvi$g^)jfrYwj+@V0U
zpC};c<Kmx&^;zw@ZJ^fn0o3o>_2HnFjn5h^5IMs-nf3U0#e4@0lzyN#s&Vg5OfNx!
zwb6}}Ud+Ru$d7NZK=|>)K<qI=HS*(IV4$jov|Z)t_qk{Y2qZ;4{GOVza*o;v5IH<G
zV>wADf9QE>2Wk_9bH5n?2jt4)66Uia-&ueH8KOTvEPQE+to8;B<Q-Jx_&T2V-$4Zh
zmdNo1IsWtxI(dH-%#h<x@1WxiirEetC~|y>9AA**Cz9jahJb7j*c;^dnY=$L&5+~A
zW2jB!jO6&mM9|M31!`CBQ5Hi%=~19|{nMi?z(A;7Uwf2D?OKnk$4N;tTbw!B<77Qv
zCr00!vn$A97=&S8DzJLv{~sIDuv3v%Zg=a2h@=6cI8J{5Yfm#yd`TZR`SYG;oT#R+
zZWgBk(ZIl|7#hY5hRs{&y`nHNgW-TudGC=s<Aj;qrIz1NzYKYUqhUi{lx>YLgQM{v
z<OR{d795Qn@(#W1xey+hTC25S^x5Prga*FkhMzxLtATJ}iy0NUwc60DSwYjE`Redx
zZ+h5Ky%1f_M3Tik0qa=CW?ohf?`APiP}L2cg}~#>o0*Zu1d_8(){%(=ezHd8zGVah
z9yBT^rm-3&QedPsdb!OBL`^A;UJ@nHr!+tyu=U`o)itFt^s<humY|93*rJo(4ZZfO
zjL##gBPtgA9Q1mU^Ffs>Gt5whYY#_$TQR(sRpH7~s^97<$KIy`16fNomsc*Ig6xG#
zG*EUX4W_B!7T(N)0?C4Ds<%bgsjws%2n*B<55)KcHsl{)%W3~oc1B4I!XOa6k`{`|
z{V!H$beELqK>qp@#wCdfeF6`L?)A)DDj1avWlPdcDjE=#3{^|MWkO{{f!#ZEIl|+#
zryqWs*c*FuT{(I)IbL<GkT;VSbu~tBYr1-vuFjWXt5271;c=w5I9-*eAqng)PS-X3
zHk57)pg_n%sI;aEOL>14b^c0U%*24RsB3sx6c=+x%i#McRoqZdGwIy`6i|`dqqv}6
zqi;L8d)R!KZDiOIV%vSza|gAETajU=p8T8QRwD&;_v{h3R{R4DNL`Lw{~VO+Vp~8Y
zEh%!Jbn`A&>0So~R5#;otbD8Ib_903jTKL>!BBbxk_LLwXX^Tti#{7!;N+gM=yO4r
z1^<jipO+kTOp%E|m)0YbZwp0@m8o-MWRknNLzg~8CcJ5+2_wd&z^VGLdbhgt>j5JR
z#J{`e=pScibOa#?#L$*dxUBZy*nMq+h!eB{hX@1cCT~Bme*vy%bvqQ@mUk9gl?Lh!
zj!a!xh9iTuK<UB+j_h@%g|1)%N0u&og(4S}EU1JyRl)sjGz?h_l$%O$f4S^!u>vdx
z3hpnPy{Z+>uR|{A$QRA|;tvFyEktmC=6ta&+s-?J|Dw!dU}Lk2va=7Gz9?<B5V7BM
z<@u$X^MbBAjHhj7qRS7bWi6*nbn*PMAw|S*gg)mFC=pbx<pVLonyc8d9rW2hCkB_;
z1^Rq0+r+^BfaLe4?NPeCYYprUn65|Zl55Rl6~I~`b;-3BG{r3FI<^O1#H;DbO5jA+
z8(IVy3!F^XJ6Y|q0ba+rvWEpJp+aThLjydJ6527YCJpdT|Dd>Kg(7#2Z8<9h<^nV0
z)09Z=vO;z_XEm@Xk=$j4wEbL<oj+%1l*TX!!r&_nWToE!VtY!`={D#tz-O$j*nt0s
zK=1?kzd0$(+vem!GcYO3H+Ql&6^}_{+c$S|PRS~h!}*mEf6G0YD<S@qds1J=ddwg0
z36bL+_k_KH8w35Ss~%4-2=uG2J^}rZ8z@~wW9fM{bj<}>&(nL@XcOy`t${eahm93j
z-#EJ`+`up)$91SwvT>Gye9>jP`)%IPHNKMOsjGpSPjLe0s_PbOK4Aw2wyyvfGGqpp
z+gHL240NN15tr&rGDkf>__<-^r8=|B!3SUVqbK~pFn-9m4mBPx!|?OWb*SO+wJ0l0
z6Lw%2linftFV|t&dz-u|6n_)Ka?#ab_NMtZJxuEC?9UJEzz~p;fXM3v)w)>fj6i5j
z4i!2#!XS6X?jA1aGb^3T?LA=#h70=4Qs>Y*e3pT7)AjgA*ZEe}@Z#)@k|PFT7<wfN
zO0;|bi*<h_bxB*Ly+8(KumNkH{e!L>%X$8yYaRD>$rptB5I~O|<PBHb5KyilgeD_?
z>2m(5XfkCB!gDW&C)kbUbGefL%&5S<a|yl-K<uBv*0=-{|L9vn^MMnWZfnn(K&=US
zo?8_XiLdi^4U%#Nk@)g&PTuJ8C0h`l#5s~T5?__Ir+h(`Y^2GiS1pLrZ9=8UmREXZ
z*D5BLcd{+7G|Nsow7v+qyp?t2=mbO#zzWAxh9CsT!y`Bc9HAACrz}Bu2IoKqyt}MX
z;dsgu{CIGq3=xie^xt!Clp(^Ak9nIiq%1*%BOi083}3qX_IYer7Id;>-KVlBM-bw_
zu`W>7YdLiv$`iy21!a2(*@rdMWeP&|M+g8%GIOmyQkEdZe<O(*zKK=*n{ox=*`fo!
ziX9G&ir*5r=sKl~f6#So>%rnTy83dIm{k^g(`A40y)gF4*%{y<48t(+OIyim`2WX1
z0^5aAx$uBZjh01fE{?yxND0ll!A4ZMphi_ONCk_Hs4CTsLv<rIqChNIqB@(*>$XD)
zoqtquLB*xIQTuvaq=Gt6$r53VD<6mXEKh_nF4c`V0S9uySNh0b@>m}60*N3#%s1ag
zykg>LL#Wr{4<lY}*?towf;vu}W6Gz&%u;kbOcWEtIM7kGKTJh&OjWKW6?s;<qJOGf
zODghTRIcdC<2F~hKJqWWsLjNj<IN=g57q|O`DU^%<pgoycr($+P`|C;Oe7B6_v!wV
zjPW3C;CcUvF<z!`kTg*HPmJ+?*?)q5otb-F+(?hw9M~&ROUbrBtUVxUpuX4DlfYKz
z<nN^wp&|qv>??aC=UPY_*hB;Ejch)U>yL1ty^(FEVICL(3djSgeWPNnw4<R%;Ty;T
z+5LV#-0qy6QI5kP5JRt2q6vokUu-Mw&YK9jb=trD1c3r(h_Rh7|21PLbCQ99MMEFe
z5Y?PVRcR4v6lehQUZf#}fq(`eUm}egpdpHka}#M?K*NLlz)~YoHLLHydr7|dh6~K%
zJBTP178dfgH@ZNAtc8b#f^)X@un?hvgI$NkHEt(qD9OMG7S~vlG@jkD-#yvDs32=h
z-yfaDWiNdQm(ZPNh!1|pLk2=K#QcV4NH#EHzM~oZDR9h<X6RpxE6Ko?Z0U<}J)i9K
zneE?k{l0#8T;&p)K$hMmQI<#ktetFNq*gJ?@hE^XD^^s}fpHe=%Bi$d#QUmlo=Xwc
zaCN<i)_i|3)@ZwEt#H+MN4sdPfVJNittt7y#-&Ak*4cODe;2|A;<H|%oEV|V-Xa*#
zffdV%5sJz+*@_GY!GV>)lXzH`M-ShhV@b}5ay+`^1{}5>=JW9)fv50r1?V5j&M3)Y
z5Qd>wYKRHy{V%rtsGliKSIGq!7>ohSlD-Fu#bh?}QyMgVc#m0u2Bw5gAn=04>}xu*
z<K%k-ffr$D_c-eQ^7}P@ur;DAlb?QBTG$#<mdQ8R8UhV0%j7e*h82ntLZM?3E{)>r
z`{;oixRVWwJJ~MFmI^Si7k83y4zi(@tr6tF(yQIp?ecoHLMjw&sTy!6z1qW$)7R~q
z^=gkB+w~4-{F}0~IG}h9ONCOo2Iiv|ir2usNw%+8i3J7}uknD*QsDOR@$-qDz$3qd
zo(O`V_TTu4=aH-ZgP*`7zkr`8p}-BZ(L~7SE7`^}o`L*yrYm{7{M8Xi;B+N#-+!Iv
zC)8IH!yp%4H!)OOO)#UMnHbtL0TS5HObja*+T;urnA6FsHClb%oI#DuoK<V2`i|*H
zxOb`&3k;Osk81cBRIRO)lXheX@&VPThE^2XQ?XN|`|w@<<Lr!*7=%F}dZpA5g7?2z
z`{C}+n6|4PAWljn5*8jCRv*u?_UZjJc==eqVfn?$%LO@bW!i`4E;qlQaYEWhz8(<m
z3u<7bR6N!hcKz|zjX@4%!25-&;RD|4zo{AucrSRvzW)w*?@%?0tWb8vpy?w7CAZ0}
zq8Nxi%n+4aJu$Wsv#17&N<OIjPi7LP-w>Nn;Kq{YP$7c#ViW_D=TH%XoR~K=LXA|Y
z!32OX4dpk)v4MEuS&t_KbNKzt#XL$x?KkWL=bTDJ?W=(-nXJ?$h>Qf_Num3IZF4S)
zfuJWv^7y=%kFfNlq8bRo*|B`X^5a4F>qS=RLQjgkPEV@QPxPe7C-kHmJkNjVNuS?k
zKZIkP#=4*`D`vYq*QKBcav)30whVUh^H>U^V9d4*cG)}6PkB4zJTsw=a`Mpq*5=cT
zJ%Xs-4qb1RPPgUT1yL}l=`_xaXeuXPRGl|xXOx663<A+JiLuc8U(65PM{GK?84u8m
z!9ajzH|s)=tHiMSYqN-#JwC^Jn$H`FVQc2&M#SrRbDr%n6e_6kcARS}|E;qN5yZEq
z>Oc0o2*<Hj|FO0ad^rh2Pz7AP*cOPFFW&$Jm!8k(>)oag{6KV*E90N8k03$z)lH}z
z`}=|*NE0f@bzfUQN4Z9h>%QhDl!ZD=kYK=A6hm;d+N>oAmH@#JL2$I#Y|oZjeqad`
z9NCC+GfZjMSd^eZ1wjem3?=5VAVDR;S$}(SCpSjm-86~K+{q_*a&u6;qe2nnZL>*)
ziJHj<XE4E@DelRJ+^^vZfV(Ffaw+1<DnC>Kamzp=IuC+;Spsf>2{K?xkgw=R9{oDX
zH3;$*{mLV8!w307kwDn1O68VZ_ij;Z<_yHm)1DitbCEiOmB(w%ox?BmJ<qa^Vn(%y
zmp9G%Ynso;@uuvIavX$VAbKSdTw>q<VvDq$=L)(S_OCy&(gaN6v7a^g>DovSjBJY6
zZE?=6@`fmO)qNn=wYl~3Q3T0>12jT)?1<o+)swUKYjf*G9APzi+rmc@L6B+&ZPs|q
z;msmhUz;^<7~aDsW~IcyfE3yo-lHKy<>w>EEcdR+T6S|Gzg6<e3an)}7h-J=zrZ?V
zWH%RLbvnP<rXm!W&=-^jeY7A-FDu;EcE!;}642nH?YV6wB`}hJ1~={e_-LgywExxZ
zD7tsW%g-k+&4svU|Et$gp#&aqCqJ6H?2m8Sg%qerR;WTX`le*#SVdu=gxlzgl046O
zu-dF0J<ecDH@TkQ;cr938j@$GaC_i0I2_nC!x~U;aT=TrNHbivPP(K82At4En&Fb3
zGlvxw3r?seG*tjKyL0n{`P?BfXjF4Oro<FlAWe93t}mDv|G((8rWZq`(5T*a`(98O
zC{k#U=rcr@I)8<=qvu&%&G+!B;cr9VzsNtFol$awFbqVmRK*gB?tignChSuR?JVgZ
zKX|+#u&rIK-Um81!AxzMbNn#V&qx1f`C;bRVdhLEU1d;PUAM;FU5W;ZQ{3GWDDF;i
zr$}*kcemp1ZUtH_I0Sc!Q`}uH?|1)XKQlSWOfq}cK4+~*z(bs_fw6_q#2yj;-iFIi
zI1~}2T&2phvy+YA(TVx~eYfKtLSNbM)wBD%Thrzg?DsX`Iq-_EIvX@O^{v2Z<1OsA
zp5`Nu{sFZb9EJIfOs@u#Nb7Cja5B>#DzS4b!0mSVs!bwLzgW@mb(1cKh1Co3r;mt>
zzH*IYF_<-_M*FRQuc-q46X6^?6ZJb;n!jx&tjYiyD?v1Bd$T>cz5oVX`!)>gYfknQ
zjQ$7nIN3ZJ6Ya<W5<2-fP$z(gScsZ?jjYjT>{`&hB;+CjNqlvE7D+%qoJaI^W*}7Y
z;P&!$jz(uLp+>2bxfz-Iw{))l<D0Q`gvjH6*BP+>g}vSWI$D%9KiBKl5O_PdW6VC-
z%he~EH^&#v_ltd6h>}!n8y0da3)Ipkamdb#E7alWTnPnk<{13J?q@^N8`)(<`WXKL
zV}}#J7LZYjFh#NxaI7eu_bYa-6p<jca;g7BiQ(`}^vl17PTPfchZ;j=9=SgKQvbUs
zU!)($*3}k+VSt2~-K=aVP20r~9ZdoaHC3DR!dUV8_sLua+~+njYxAbbxPo6*M9T=O
zDDzh&aas11CCV>n!FGVkKoA3-sE-Ay^9`)dpF!k6iB9C&rg6kM2==0t0Qrvg;H{?*
z=3E$iiT2I|^`*^X`Y2&!dMvHs#}|HpSE@_rG+5;0^7`h@UpE>XihVP`^f^6*%j>zm
zEYkGy1mHJLv!TTHWaWp9JmIMk=k&wopnNtp_5N2BfA!s>wjslo?FBT(-?c%ed}oBD
zV~U8UbS@Us_Sh+y-yB60?@Xyp-p-ewBhR6SvsOe-WIm`}gheda>pcf!Iu<xQac}TU
zMrRX9>0LaUx6ENCG*JIvfd;UDq(CvDpL*$jY~<G~)47=46GKWAe7qp^H@@M}uvKp7
zE*b7j>Y;(qkYA!0f`hi5zz#<q0{XP{1#x4(R2Mj<m2ZFL(lo8Jnby&eNRl-FQK<jp
zAt<M&^}mp)U;`9XBBH%`>VxV_cuzR+hJE35yiQg+;?{{9Z<aJJx)=}Knqh$|$rqii
zdvQ;GjK-C<U!t-e1s<+%rB#w2Msw4iy(l%Tm~0R-obMA|3kWY=>-aQwADb`5@EJU5
zOulb3u@>8YhWl4lJCjW6hECoNQi?Os@oEGLU+AAaMc<f_V%t$VuO;N<Y@SZQp*VmP
zYXgUiNO}A%ot@F8L>!1*oSP<=dp(s-ZNpZt$HpS^h4PCs?JeD<29a|eHUg(>H(&O3
z09sB`W$36!zgfcxnVOhXxsS}%mG^CsI(>6ZmvS+kTcEdkCL8Qvs;_0ig~+E1Lk0E<
zhhETVJ&#gPdmnciG#{o*UbJF@k^hY)<U3{gGlN!O2T&qPCnP<rQPwZ8xq*L6n3{9c
z3BJ2<(%NAaCTeW|ss2SCuA-nFiP)s7onAjPfww52WAQCo^U3a4Ql)1iD<`}xgDcoh
zzNgYILKQXJ5<@oA>PSX}s1n!54CXHN6z=FB9n}w6Dn`zTqTCW3X8@&?)hFLkRpf~w
zu{rXB@0nNEKKr2C8#<bpnqZ{HIbjmkz6A+5og<O#j)Dzo5Hhx0?5LYVpR}O~Kd-aI
zMI4=nHyXe|{hWFr<S)EW%uNf=$ubh?Y)R55LzF>eY7;QOfw6j}6+Dh)+B~bZKBto~
zjbwWAugWjCrA`uYpkY(@O~^l6bIRYR0*keUdEp3sj7GA3u2K6~GHmW^>@O_Sp2LKg
zA}><_d$GCg>sY;D<>Hh5;=fqpF27aR{l_-b#g&_SIDtl}eid)8rO(re@I-M|$1c3o
zl4vJUd@u1$E`kn}VaDISrk&0kyr-IfW+$L{%l`}yO7rmv4l#={9N!SgFW8w2xxiZ0
zKCnKzMX~@9VK&6J%+5tGgAup~(#0J3snS!zql5hg1BXjoZ>osTHk(}0>>>h($2{H_
z1jym2zf811zt_0hQT8#f1Y#f?QEf35qm2ETH>s;h?ZpRpwLD%&lO356cI)=O+dW8Q
zx;9y37t|j99zzhK!G+A>&W~^~^<EgG?C0H1Rll!VPj!9{$oTnHRaa)Ew8au1TXgPI
zxA3&4B*uvfrBqVB|AJ`KThlD_N>Ic<I9h;=y5&9dl1W4+dk{G&x!ZCCBL+#jP5z1I
zQpcO%6e=>qz|s-kt5Byt7+?~aNj?l`JC#I6gFP;hZFG(@!@SZXLLc&}q@>O+?*#YH
z<OOaDn=E>V1v+vD63;gWrnq!`u<Zgi1?9^&bs7DnIM1<T!6139zj9(-_y?i?ishhH
zz&XK`-{`@W#?OB@ypdDR`9IUtR0%anpZDlfu%=SQD)B5VpQ#WuY~#nY(vw+`#6s`A
zxnOrHEIZi8q5a6#>{uBM)kqB`@^8OgN>d*mqK;@3Choo&SEJvbDA<v3&n?@@C(>M!
zfI)4&!DUPAfxs*J?(LUd>=V5LrvT=Cy2QT=%(X*lwV~ux7X9&Q6QRo&gN+CcR2at5
zM$FGfo2_V#RBXv;MeDO5%6t+=zL{T&TpEpuB18totHI@RrNKKJ!ty-38;jZkm<4tz
zRD-LS6D8MJa$5fmHYQLQ`9R5IKcc|PNH$gpPYE>hTm0?0fTSTZzBa@y4!mDB=aw+U
zN=kj^j2^^Caj$7YDauZw$W)(H0KRymd`VbWA%3Ury}al-D)k$-uad_`Mk`$r2{PnQ
z@Wy#h0(XRvTYaq5z#j3(5~Ce|ycs^_6ME5GLFDJf4eL<uQI2lDZh#_s|50~?GcbqT
z)^;zxiSxHOWk}%PbnS$lkIn@bL=l(IehTrEiYm&#)~4PCe)o}z+QHN{3>|HMjt>oG
z!ZaQjGdLV|?cb|Y(pfP~_#Er=)V=$oA|ny5S7j@(sDBnW(<`ZhzXGF?RweIJC09t)
zgUiI5RjYD}FX-Yk7t4Flgpl4gA(_$EcoPG<rKa&4mcX^$Q}ARpOq}{y2%E{yF-OD~
zZ^z;k)NF6m-G2f&k`WUV@NPYm5z#J;<s8j(D_`F)-h!~})U;d=E)aqf)7{mP?9SPU
zx_WSvoM>dQdAAw`Ni1pJbd7$Do!R9GHkQacoM3>7f89{{Sy5cdIl2YH>dqj>bK06T
zDcBd^V~R{xPa?>lw9HFD?aHsQmh!$2mMBy4=~`)3UEOUZ+5K83!q-h~!_+dnWQwr;
zCGmX#`tF2};0NX~z_5Y^L!Hle(<wixS-{swTbVYdht>ke9kcTOep9IYXNrONM>r7L
za}qYz(|i1>F)xFfMcFO1fF>f9LUN9~mxQ%8J8HKk$<zW<Si$#yy2qnh5%O}}E&ncc
zkB`0^;#B-#a6_IV8_}*@gqPwS{juo6S6tB0CrG_{2pTFbY?yFwy8yYvSzB7eCm@6p
z{4C)IF{LiN2REmeT(b3T5%Qq5vPZqFCfnm#cPpq^?R;Uzyoxo=E}Wh`FLvE<3&M*!
zxm?oG+Vb2Db6?m~#C~MNU2UJ=)5Lz2Hc+K^HW5#oll<hx3P4yP6RHTO|M4#Z_2*o`
zl8geJ9Ozf3D&Tvt_z!?@J_7jX(2Y_a#S@4J<B2tvVZpfq-r;e9zBRGuYunqx=CQx~
zs21@*nV<9If}9ptn}`)d;K_tc&B;n=JmdC~@n#||HBct>T1!e7V%NlkxT~UHApj{f
ztH_3bcu$ThK;6_uoduVFQA{VUl4@t>7@1$%bkb%G@?VXRAVLT{OqD}Z=y)HTvv${V
z!h5-<Bc=*z)_L-n<W$R}He$LLv}tDGD4J{6bny5Q*IU>iBAm}17wny<G|1c^HB`y2
zcU_TTuKg#M!u6Y)4PF6bIaczLB}AKB$Y_>pBOsZ;27R`i>k8rJZ^>-5wX2w_jZpbe
zZ^lqFf$M(wLPU@j_@}FDM&+16ECmZp$j%X)tD0N&PNEzD0)AFlR=Hey`1<BRyeDqn
z5@#H7B>V_;6INXJ>X)!64mMll?>R33w0OAAWwa*<G_hj_lOSeg2vlnl>G|fXSm3FL
z@1aPY3H!|}u5cRJ1$@20G#W=^+=+M<{Kj0(4#Dix&S*h4wU{REzn<^$5MQ`xIjHje
z@cGm)ue(F%D2gVc+3%aVTJ)q4*cq@LA7Bt1JhuBa1Tv3-I}i>x!sXV_z5KQK5O}E|
zQb!yjgL;Q5k*0C!YC6AQxk=?)*V00Yxm?lm-F<SBO-q6Zu1||mqxr)-_Z%!hk==>B
zOO`KFE$x_*S?BPe)2oL$|D8vBXNCGJU2)aWHF`d_G3$@M+LKQLiH~QYKg^HCaEN35
z3wX_lbFosXm~h>8!az%mlA8O+@;0%+Vh*!FLpDN=#Ey*EUPcKLgGv?F20EavLtH0X
z;3RzuUHZyLE{aP*CmOWX0EwmC_1~tq4%KdJ36fI@Yhbwpo34J5)90K^ET(59i)dri
zc$EVnQS2YPOOq@_lRF|;_`sfum1ff=)Ov>-YZ#Jv<1fFnl0H{A*xsYomzGCzoi+^B
zB4-$<q(iTPyd$4*gC-eZ+Y{e#DrPlAi~de121nu@jW%hXi_XdDikN-FWwP;!nHC6j
zOI23EnBcuiqy&CVQj43&Ln7ssQ#p*a$R5fAFSmktP&cLCgeKF0&Ma4!pNAp*w$@28
zqnkOgO$7I2ugmZFD=T){{-FfupWwoF;-~w7qRkA`PD3yM^^hn-#EHC0c)EtXK90Y5
zp`17jS4>LSR#h5g^mHT^(k*ZM@EirJWh6`?1y_}#-=Eq5q+5Yyk-F-xsVri^C8`8^
zqO*!DDJq({`VYjgL{+JS2jddc`0itP`C|P~Pwxts@tk>41hvj8PucT8A@RGiC;YzE
zP~v966=QgSD>p*u$(CyTwCb#3ovv71oXdpg>)&Aw7yI&XsxYNEeeTM{Cw;X=JQBFI
z^a9_{FlPo<sBrr5`yPb4IF9KOf^BZiR0ykywV?H2WvIB|b&yubafSZ96<$D5ht&e&
z_|LJn-oFr!i(!6e`@sTJ=V5-A(^OFttyyp<4Pdf4>y_qKHXZ4H!(LB|7RA?8`Fvfq
zgMT6O9_1GVy<2`%EyEBn4~*zhQl&hoU$UoawoiiTc%)!RfN|oQxf5haXue1~j7pdX
zQN0MyrAA2gd=8DFu+$0&7DMXq*+tMid#9Kku=S?uuzLysFimnC(jQ@CmCa9l&K$M7
zy=cOD^z)BXuZ#1dz07EvE>wZUw1*PJ?;u*KlcBSagZ-z6G;5Sd?0=UUx;FfDmMNJ<
zI62z;N?T-TRw2;WYS^PrT@^dtiBoWb)M^&6q2Xws5*q<pma|Kj`4@0Bo_0oGbtz9q
zuCLl<I9n`~Wcvply^p8cRYKJrj+YDR`9^@sR;2JEqF$vAS9LcpHsNX#hZy266_;b$
zBqj5*6Y)YEkqTOp8Nk>K;yHRpN(J(`jc~3EE4R7s4e&_HAdt<pmL9eMf)%ZWfh=aW
zwuaMsL-o-oHsjn3+1ZF8Bn0VYorW<#<?M)=zc6q$Zj7s_)fg(~pjcyP>3NZ2CpI#W
z=##I6!d4Pz_W?W<UHtN1-ab{ly;cZG<S0;mGL$4qQCP?R<rt4Ap4D(ndN2DAn<41s
zr^PRZE*w%g6QWj}_CfGzFA->t=ZK0HZ93wUZ{boyi=TAmmtk;&hF!{Jl5dFaZB{-|
z&T>RVB5&^)ab8ew34lHca~2tIcls2B_W<JK&gEtzEW9*9^(tPmZFZ)bIjifk#kvDk
zxK-ayKjBx1*#30F;|@+*p_&w7hrJnE(2>M)JwMU4LcE!5#Wf6o)$=RZj}$-L$t6~E
z(wY;#l=+0MIe`%eWe}51S{Lyf?2UJ5vVLN@Yo)&;L4j{|w0Tf}tp$k52Qy&cg?IP*
z+;7_8;Drb~FTISpzfa&`WyFGDC~97d5V$1sYg7HdNlH%`v%wu@jL*3cVLc3Em78*M
z8r09n$bX7gxLNpdOJp-w*mlmhwsgck$H)0)aVcJc!Wv>Ww&Ax>H%DUh+`<0jU%c?`
zrvL8_H#g^#UIntRyp6@pduG<WI(Jv@w#SV<aKovd5WKT3IKvnhD&njk1MG?3k!g~-
z0L+DFF~0KcM>lf*PR07~7);Sw{-_nc$zL$l)&mghm+R+D5I3ehr?tZiZulgzViDSu
zzZPAf-a?3fk}%a_?=h&J>wY5WIN#G&YxE`c<k~k?K)$~v1nZW^*A_oNy=vQ@BqmVc
zcMm=FQ7A-NlNDl7+}<J|zq~*E%hM+WbSZp0xb}=b$TmALrBxL?0wgBT+$}sv|7wy2
z^+-XDXx9+ymB+Kv+a{RB{GqIpHVv*tNy&7oB~;!w%_SXujT~KT4-Kk&3NfE_svQb9
z8jcqvZzW2M;VJUNU)f=iK(06s0Y$`*WiZ^Ho6zJCevdOx_nYkum5%-lZv5Ky54FG1
zlnO`CzOW-i(YS^D80*ON2RY<RN^D{55FqsKFeO1ukJT6Gid=z3K?cC?{|0UhStEgv
z_pV{Iy1&1PbdcF8krwyh&v(jSU!^%fjzh)Qw2?7rA#ouu$}w~LOdsC?t$U3*I6NZv
zP;{d2`2VsYtMdOSfIRkonNSRSQ0lK?JaMN}`irD9e~Wln0o1<JE|Lr2&BL86oNTmM
z;DQLd^eYWHWBKRjyx;o+(@V>EmgYFlV+Hfj)`K0Bb*{K&$tFBD#k^>uJnejJ;|P9T
zMYUHbP$2DV*s*nXz7}p<k#9nVohi&sndHR&#XwmO?<FcXp57L5B6045`Q`qAOQauv
z-Sf!XQ+ihUSEG+6OPd##QDGB0uNkB*>n57bbeclh`od`b=xSL?0W6xHXtW!wY_qie
zjGB0Hs+o+XI^J$C!D)~I^2c>L2fwcq$H+VJ)HBYPdLP-!!a%455E3iUVK}Gwsh2?g
zk-xFyL^;<-Gq)UlC;q5eQUsOixim7&hxFfW6ISE*(X^w#@xzr3)%asc>S^VP)u8V~
zeo69=es9@D0x^`0l{W$i`U<m2k@>O1M<qW6mYZ;I=K_Z-&kH3UE>(nGp~R?PJoJ=a
zKW5hsAAdJxr)nfF>_=xVe)PPsc`gi^(SROq`&#(G-Vnhol|&DYAXJwrAd%$-h<Q;2
zvdw0+<9~n%xbx)V+kwz8OvhH0s*Px^ebzuT+D6G-BILBz%xEAA|70%D^z=|zPn3*n
zD|3}GkvgqbvQSfsx1IY@k=`$L@_)eG@>@IYPQ@x`?Bg3wLXoOOZ-B@2e<0ZW!c%xz
zH`<YTHg%ObLh1VVGnA<BiQ?Bs(Wh1i)c8G%?36`4N5(asJ=RxGmByk7br9oB-lHlO
zFgM9t(N2V_k$v%_o+3U68ptLA8UtL+aG3Z=bU-bXMV25bj_#x3$t6e`j_jObWYZBJ
zO}!X!8AYiF*YP=Ka~9XVMJ7gRn)dbn(E@M3XozJ91BSFgb(H#^C>1t5mTyXLoC4#Z
z^h^|i^(b&+vmwTz*ge%No^QeB{3yGLb2Jbu<i8rhj{nh*TOYV_g-17kzXM7vY0qX(
z?%3xp919a<UbN=lx8GY01z3*PhHY@hn@0ZKft2(`PMb?CZJ!Nog*g1X8jv`OJ4|CW
z5&(QBdqrm`<e4#`GsHrw`VWM|u(z?fs#gE2l?;M%R@;}C*b+9md9)Wekg)%;i49B*
zduZdCG}86~=9RV24`uZ_fd<GM*nYt_1XND3pmm&D!BJFW+-s#sy>ETYRb8r#jiqj=
z3Lx#59>0t1;_QPn>uKM-9x5eq4!nd&2eExL&VDZ+y(tj@KXz|1aj1VFpxn#tLDYL2
zY0^?L<osa(JH$negQ<o06DVf)vlS)v?IBkJ(TG9Nho9#w=nNxZYjlAY=)5-su;JTZ
z%OW{zHFb*I7e{}8lgoizR)!f(mCZYv#P_G6J(=177fy%sMHP8&wocX(NhAJaR)j~F
z6o0sISwnd=UnM9WpqM&{`vw3{B~BKz-uTqsTH>{uE?W*PZi*YJ!(vEyFzvzWno>od
zw(nHcQ38idZBir;->7o%D}elB$(o^4&catYK?p*q3c7pFyX^46XKR~v<)Q8PPTOds
zzyD15FUT$N=}&w3gd36yj7R;tLhjDevGyr~ovJdY@q3zPIut_SBrlseia<OR{3)l_
zSER9$d@y)hH^XJEAw|bh{mH=&o$T&}itL{I)XGvaqAQW=Kvt<K<nx-e@D_$MIq}4F
z+(bB7h7GomoH+P$nH}wVk)3GTW4u8AtY(#b@LS>JjD(UPYwFPI&xWTi5+t7#LXHJo
zHbZo())Qm(<q{p_mYF9hC4Vj5UpyX9+PV{pl0!QcT!F&5GZJ-^Cw!WUy#g+a0*f-H
zdpA{_M!&W5FEeKACNq4Utq*!{#+Hd`WzmAfZsZ6GAs@qk(N>S{9UAy$*nvWHDx~#?
zh8aFQTi$7uDDL#DOVlhpTUx6{WQC}f^l54<V5s>Jwuv*Jji>LRiik{>Fhr5p)9t6F
zU@WlojJty;vUM-Ab=DJ&_^z0ZT6ENPDefw<FJdhsIBzc$yX<l}gmGsVe8PSFNJ&?A
zO>YJ9RPECY<iUtmHhm4$<e(SIzWfoikjXrMov9OdllW5?O3k>qejdBwPe~sVY^5eN
zp+ij{5^iOh<DMw@cf^L?x?_p~zxYy9qeZ|+dvcJ{o96Ca#EAB;%f+`-RAMzWoj?Ih
zYL!i-8pNacv0UMhTx$YISXf^Ix>O^iA+F7Xp%ltmtptoGDg(BO-&!@31nTQ$pGRn#
zztBd@2r^4NUCrc+|1uOyHiSGZT%A}giDQSa2oIhpHr`T9PC|u?6NMCN%>>bZ99Bsz
zLh@bkYtRcR<A-0~Z?6r3pBq<kPA2(|hAJ>O6Fmf`_>L04tUQfP*?|wqYf56f&&aHo
z;%u$+^6tM1mdzl9zm=6FBH}jztjGjmuB?QBfnpE=H#nN{C(X7v`~wJf0%GC*C}N|g
zj=m3^A$0Nn10{D?AzysJT)jF>Cp9;yW=oi4x)Vwjm9k~dFfZ)UW6V(S9WvxLE}W-9
z+U6x<A=+};eK0#cr0=8OYL=P4v<%@s9p?CQxf~`DYi3BDT#C57Fk=;yBmXBF4a2$Q
z_qSg|3aQI+Yn(8_PFAxuJyyjB8SF%sGK*=vu{LNj{eB_ikE*(`;}ABA-jp<b#j0jg
z*3-TLKkcjuXW{LC<EMeTV4oi!7Bki7v7tn^-+sw#8zl>CRhs+rB>=dKSz<gSB{??O
zF{pWEUP`Hs(YxsdgFm5&6Ga&Q1HkXT5k7xjAy#FJ5#+@}j3p586`tMwphFKA>orbr
zCe-)V6(jcozG)H8v}<V<FIT<3RyE@=cZ}%3r-C5ew2MOT85pPwhPuvmOk0<2e@{zj
z@5$@3ygxp=WE|`o=3x-fzRce+iB+pbPJR+CUjrbrPTc0HpS%*Ww*!eOKD5NU|A2d1
zISPY&$SOF&_B;W6Jo`o?feR0BGF*PwCH|rMwua^!Z|1oa;)MH+JnRKP^l6|ymJ8E3
z(FbwlDL;a+qeuCfp42s-e_Q%&>xo4A*D$9D^NgXccopy_@^;R~92oR!tRVgbK_^Ki
zLnewoBO}=hXX^s8-U`2YQrU~D`AItXr&vIDbSIQjwnZOM5Y8a%w$e=WE~EdUU%6Gz
zy0{4>6i@#q*DqzD4frcfkIrd~xZFv3N^*B_g62s2k;?l(E6CXY_HGWlkcdK!rur0s
z(t13gN>Aax`D)Gc8Yy{gHuYA7SuEnfV8W%ugNc0?L_{MxBeX0eZPh7%!<$C=+JF(s
zb4VIX?*J%#eI&;?ED;MEBXY;>k;M1SLKhS!X!~4hYPR_gx+=ay3e0P$knl2WP7B~q
zPnRaKE55JMEla}gwDnc4k~{*W@BGTSKWN%SOnL#4y@s#ri1xlm&xyXed8xCKbUr+k
zV};HGIcIIC1TI~}_rSUlhB51i^CTxX+By4mYNRoT?_as%bM~EbTy37SzjCp8Xe2N)
zPHoG17r#j}-6oDUwa<``2tE_NylyO8$M4ph3NbzH<1U@6D7Y%Ck-Zw&-7B~zJR!N(
zL;l|7k{$S>lG2DeXEJ559Gn?PlW#?_;f|ifXfQ}az$$6>qyIuxQ@#cKAt_Le!a)n*
zFF|tJSXOnlfo;X}Id^(j{*Tog{K4u~RZqBkBRmGK589AiKneUE$Y`%W_qs?MEx!AB
z75IwI3t$`DtB}FH7{G>kRAE%&_6nH&avk-BQ{#aJCUpp%^UH=s>ynWKl^6$&gk-lY
z4ZezAe!&J{8=5x1fU&WdXXsr*Qmx|85nAjPx^KpI{okJ%i1FM{eS<oG*6E^*nx`p7
znn-t;hAbo9P@r*m{lZj<zI!)6^eBaXvCE-6@oMf9t!~GYp%NuwSVEZEJAYtT`(<7r
zN+O?*j=wRKR7v2?$}|TIma?oar*`RV)h<#Sj@P80nO69vQf%7*Dx0Q=L?cjtm^|DX
zz`>?maKB+QK63JJQ1#21?jQ9kNV-4QIE?oO<+>kNM7%vA=OHwcpu}H-<N8+INff}a
z44x#hjn|3Zt;6WCpRuv>>^ce{54EwP&$*9CS`qH+YSH&3b3j%|j;^Q<z(Doc(M?(w
zFNpF&F6#1wcXGmA)Rm?Pd%K7k8(j+5E_iaTh$3!kZa^5uVSYsajEDBr6q+C7)xIt?
zs#JP?w3AY}z5bZA<Ngir7Ce?PgE2voSVC8^xf<~DI(&t};*b5TaaD^#y5!gqUD59a
zmv3y$S#G>vPu?^&7H@N+?Zb5ff9FK^59YLy(n$PSc;YRDAluJ7<j(EwSi*&2e0~Wv
z>#O-~Vg<>n73&n8KdJbmid|91$z4&+==;k^7YZG64>rKnU+kZrj&F60%@2(ykvty?
z4H-Zuqp$mOk0gQ{&m0BIwNRhv#5fuJg38{{SbvhVSd?^?OHVEQJs_;gTRq`YJntj4
zxA_>-EdXC2MGeCC*X~AwioNeH$6;ftMa%^57MxUCNHxW6Y{HyCBo6HyZqd;lAhV&d
z@8kRoSHn(XJvCkY&>R#6L*weCFq7BlBKRQ^4E!dCz=AU=+VEOm<{J7Pl^=?p903iW
zuxS8TFBcmmOQMkc5qy|ov4v>v{p(M{8&R&WLW85$V^?XP)z^~5^E2Rz?oEgv0fJ!K
z?!n>6i_p>Xl;o2s76%ren&nfIj&bv?b@IkF6l=3f-ulk2s7L^+)+M9kpZHeBLQCD;
zZfMqaxZz2c(#az1f8C3Bw@c2S3L^CftI853ePeDmcD{#{B?d8WgXNAw<-S#jP4rbi
zO3>D;=a<e`z+v37<Cj}wGKvR29uw8|+02{Mygif<^Z@*tM0IWNBFgQbt0KMzp!qJl
zKh|E|>#p)vymF0|+Tz#QeXr8uG4QrbJw-~$MGR>Y?vG<K=+9IA4hZRY#Lx9^!U6ir
zixC9kKXl+B>BL<!YC-siL?fyt6b3AgYZP4&Y8&cjNT_2=(R2Z*6PCsSH@o1wL+0l3
z;l{qZjH{iQ!owZu;9}vK{6pE6CucVVzK^ni*F95xQ}l6D(8%QzGZZNNJ8iVm58>VE
zMyOPZHP6QNx^rJ7x+~v!9(;7O5lXkZQwYtvd}Y?v<elh|@4Y|b2H_Rb(Y}QU3XwVb
zOm87q3D;6xVNB`AthDxDbAfntbI}2@WdIHTH8z+k;k2RI#7ciFqR6S{QQqwT(AGa9
zy4U)nov38Zwn&;Fh4UiEx__h@T#Vd2V+C&#8$F9Aw5qbBthi3z`no=+dZ&q0B<W$v
zME^Run8oE-YEGS*Te{ejP5#)#%Qwv3^y`Gd7vQkZFY-s9Y#oYxjs6ah&>FMDQKwkK
zKX}nTi9dqvItrA=lAx7<Rlf~1crlW~5l<QcdZzP=$R%{@zCF;ZvG;8NJ&9-(kGO{-
z{@8>xk1Hv>JX!d2X~xozP=1nnh*aUma&F{rDZ0w`%X@crtNov7qDS=_ru%*Hspu@c
zXf{X~N`6=hXE{_@Xs^R9u{jiif@`eoyn1!VD|xFTgh|1UND#tP=1KGb2xjHAGW?=W
z0K~Y@gc|m?Y7$1VH<ZXeotjqGeZpU<B9y>wti7sCmI-2OBz&Q_{14!e>4bifdMH9P
zHakG~lmk3MO5asXE6Q{!_fblLKV{%V6`$C(u!OBjMo2jn9(M4~PwLMbMa5Qv%HHf{
zQERQNrFR+&2isr6QL_l^&p+O)>+}5#g_GM7*gS%p%gsp-c&(b$U3Ia>HN87Busk(2
zn%Cjnu{zda^5u%xwHU;#jQ5g^dyv>x$<DLeimxp^G~P6Szf4J&Mu$?p&$4X;G;6jm
z{@QFsileyKHIEMwm9dKTK5dpwot|6r&SD(jWDnvB#aFo~azZv>0;_DiTR60h7VIFu
zrpuiwL+vs&D{zAzJ=NUofoQ>Ob|qJhxvw85ml6l!sSX+CC+ff@f+Siir*W%aPlQ%|
zA;U8_U#7LcRUw1EzR&XsxF+lWtLfRXP7&Sy257tT)IXiI|MMkV7<q;u=AKB#9@&<X
zQjk8v0j*gZ57Riu^N?MQnh5ekyfo4O6LS=>3oldhfg<!ZDdKE8#OWpBV|h!6&>cWO
zO^cA5KI|31@V23-C@sI&eX6^<P-2%pyqiOKgDlV13p*{VVH(FL1nd%sC*=;U!n9po
z49on7Jdc~ttSyTvW<8#blO`;fB+Jc{{RcL!41R}<Bdq}zEe+RGTi~xy30W-e@Npcs
zdWMVVX%n3evM=_rO`3X=++CP!Sif3foI&UmGCm+~);xd;2m1b(*mMb4s;a^g@wQz|
zxNJ~rRf5D=;-Q+(H?A!s3|WCJQeXr;DT8wy_Iccj%>KmP%I&7X-{n7ZR9GssbyYeV
zr}H=7h4{H}`gqiTFbK#g5Uk)+f7qIXxrO9JUnXu5`%SLD8h6%3pKC^nfY5b~ilkrN
zeEnT1@0U1h*o#|09xVuip~pqW5nNomQCw>*TtnD_`(ec$(y)dfyO(KJIjXro|F}nq
zT*T0WyD@e1!e%bxT-AGjp1xVj+UiR;iD1R!J^R_36%SS|ip#Og_25O80~ZO9H>=@u
z;9DeVtdL($4Ln+)pE&EYhAlMeKaF%NahB&$0>@ynI^-~-=xr-#x<J3VuH&o^er=P*
z_h$2OGAS~;Gr4B6^TosR{tMxE$wY0#!EKl_w9;!x#156hkg-6XuN7TFx|Z4<B`L(9
zSSE2JeD1TTEvDM_Rb^gF^xRO_Wwp4kP+4p4_c8){b|QmY%CEzpD-oLD?jf_5RN3_M
zHHG9NOja_EI{kBul#n6Cl8gRj;yt#H?Rq089n$_$3ho90QJSHrFc7P>=A|J&0|wcw
z5DZUI8?l;-2F19Dz0COlUA0)|pO`h*>@Y2*SvqinS+S|jgN11>3tt+_ue{wSpKzjA
z94B$ks*Frj2oI{SU$Tk(n>*-wa5|iFX~86|bUh;9wjEvvw8TX}04R>>vc>qIXqSR;
zT}2{ctTuPbt}!0hdZE#_L_lB@C@X5S%>60nYu5a7ONg|pE8nyR+{^5&htwljMhp8w
ziHKcasi^s79OHp*jj?t{BM00+_yUlU*?2X)Q#}}EGnzP@zGzHmq~7tl$9+09|Dqv<
z;O@`mhm*{8r@OL#xX@?xwafQSb!F+lMN8N2uT8*1g6uq$*5C~w0y9w^zIKK968i+O
zH40y=OC{2D*{s%;g>Gi{od${B_9k9dMCL9&2$ORKXxkh=BEopsFml8dV(F*3XS;%6
zL5o&$;m&p3zl?9rjuuqUwEPhmm1jpmYOJ(M;vMi9)`NnRG(MIiNr*Br<d!xQA`uX8
z#nal<)B7&{`K1IBK%#OFAcISF-5!eTq+nSGUu){+`B{SFQSO`VITv0(`!tiee_jWz
zTJ2rDIz-<wcZy%I+ZPEM+T%dLkrZ*Q;+TkWf#h*_A0m*Tc%KLox+P}Z)(fnXJ4Ue2
z(TQnKn56jWyufqDK}Nh|biRVfKL7qKug^I4p=ngvfZcwY2MWk91~UHjGKKM^MKq!;
zA)bLgCg22Ui&;>^o4vH7VPy{B3X1nHNYyHUf6`{i$R*C^{3)#+?(lVdDd$oir8}Wv
z#CMl@JQ43{e5nsMX{CzNVmRisGllf<^>BPiM7AT9`jcohc3$zC+$ajFlJ0$1sZv<!
z519zzpFCl$c27R^f<<cxCRh=MBeACaA9AXSl&c|gQt|hz9sFSTRCd!aBg{^jusbbC
z8EotsI99&D)_TT5ftuBf#7!ZYM+3jk9sSnHdZx5;d!^-RzUL=0303B&C4p(psA03;
zrG-j#`QHHEYxxSZZ3{@q2EtuzEbA4OUmo-h<K4%K?yqVO5<{UP4<J)d{@LV@M93>K
zoOj781L#&F8DBZoqTo)S(-$#ETa|<E3^x^$Onc-28aLq-cEt`wSJM>6+=!%}`o6k5
zJCicxi?NGbOA(x}iTzHFqJqrOq+Q=-gX{aT9dBrnfB|bcQn9^uFD@1}4}9zKe_pgc
z$zWJ<U%TIcK@e#4{ml{Vv#KD3Ypo=K=|jH(Y>v_8A)oBJ&aBe{(b{s0)%^tD-EzNJ
zN2B#mjqx;2!6PKghX4K2xebiwTxyPr?#fwr7!)4r7DB6J<jm_Lny2lPHD}VO|Kbk8
zN*{5Dsufw1>U5!ZUqr>pjcRc@*{*S9!+8`m^x96aobBMPI>l{%?S#acHmmPllMOxW
zl!BY!{|oD@ZjKDf@eqT!BQ)=a;@{dvm(R|sYAgfT6QFChpl=&x@vW|t1zwSN4uH@r
zPgIKjefN)FR&EwX?C`?qKeEX)n)*Ih@Dv(X3iDAFed(&Fc1Xxc(3fUAIjyQ+G~-#Q
zBf4{Q@GH9L`iznkLX(KWohB#20o4&`p(UX?gM{F`nwkJWgSsX+!iDGOmJoGnDe+jl
z!uG<2=1=U-_gE8x!6yj$f=&$}PxN^6yj)T?k{%$|T0M2ew*0unv1R>jNWp49@Q~z^
z*Fj<qvj%JAi|^4jg%xgp$u;)MV%ZCNVBoI;U;kb-1-#t^xPzG;BMj(uRHvKoQo4R)
zTY3G_JcQSr><MGUfqia8MNI40&anl(UgCn6bAI7>yZ`AZ;6AA6B^=)(K6DhKb{iZ^
zB!}>yG_i1bJoTp<WOWy-Ph|ll{1nCWsX9Av7}<90YU<fqv))7r?Ixx9Zfs3g@Wceg
z4Ug%6CT4>4JybI>hoCj-gNHGPauGleSlw%wLoQ+=u;0*!#y!|rO{6h0ouH}{&48hb
zY8vZ7Z1sJ4(sSzS;kG&VqMi@&B^BiutL=#pa#TQ+p7pj&AOU-<2K2)fk>ClKAa*~5
zEAQc%ae7!3^RP+-O62W@E2|EUds=IdpxWK~aW4FIn2Drhc}Q^k3j7qyaws@+Bp-ri
za#w)8cW|S4zcWVHxC;sy_gr=WhopUqOfaFF52afEZha8f?3e8JMu$#6_ejrTv?62l
z-Hcl0U|u69Q&2hXeQDXEVE|)~>Jc0dT|w^ksr+cg>bhk8plSfrsE*j3R1JAWDv9Gb
zq|(s?HF$Zexgqc%^|N8=M-I?B-5H_5Js5JOo?uLus}H!oygolzgZ;E|OD0j<@Ho&l
zO`+am;w)M3`EE3z-lFu9Ank1U=+MrL->o@>aenu*32dCi$DUbjh;?`##>ehk85XQv
zk!{E0;+|pdxy=<glB1ZRh9DH}z-mLrkx9s(c32~Loe&s{cCaW_2C~Iq+i09H;b+J*
zG#5AS2+yp}8|Lp;V?VEgH||!Y({l-FW+-A$m538T+2?+1@yV{mkj6(;OV<M?Q3Sxv
zP;0a58&D!J2k#wgkt>w`)02~^3@B@RQ(k4xQzpyQFGR_1w9qiZmS3VjJ-1vdcWaBt
z^)U5|PdB^Zr=9U%PYV%t1qUNmFI_!qrcs)vz(Ba3PprBqtIybbdq{|85kKZy&i8sl
zugGA0Q!VYI-lPMYM`u6pQzki6y9LXwdSjUAOl!%mI~p#Jj*OV{Y9b}fdYZfUn5dn}
zhzRLZz+Vk6r~VZ~3jY12B`WRl9n8}eR#4$uAo5!V1iSaanR(e{kEm9&KZS9S0iW>B
z^NjjE3rI1qhEWHv=-Ssd>J!W@D96#2J6${TY?uVXQr7gj_4MQCvq$)=hm(%l6RL7-
zw1SbMO_`boiXv$AL+JW;S2}0--l(!gqk!0dNJq`oYb6t>#st6yx~tnR+G4r~?O$!}
z<_7TL?A|=wtYcFwCouvCzUYka3pa+;*jWwan=jooIK360Sf2Pr<J4OG-X{?fAM1Ne
zP6;u$UlVA(-+>7s-!*J`Ttkzf(4wMza6%~1qH~EdnAqB(DX|tQ3EZvvIdh{R2Rovr
z@m|cuaM{wj1z3iTIC7_2ffIz{Ar^bBl{`LyLY5chF|=J<f_6JY`8xg^A*oK_^3UTa
zm&CxN<*eMeJO-nvqCAtH0sF+pQaw?hq39x^zYzK#ejcx1B6a`uwvmmA;DU^7l6cVH
z-!tMSSa{-KpP(`js9O=&Mt+U@2t+l>oU3ed;-^K9`FTavwPwY`4*-40Kb@{5N4_-2
zWAS_XKhw%QJ2&^?46uMAi~iYMJDZVIvfbknf?6pQh7&!j5#zQ|kRL0_%<TWl;$KM%
z5qZwc%Q$?!wpHxz0^8^zJXUJLJ)(4smlZwKAzf+2vdKR)KL2Cr0ojNUXli9lIP+h7
zWcJN@F^^kx<UEpgXn(RD)-srUi8Zj>v2r2~^w9t*%u20`-K^?TOP$<Ko?uG#PP9<$
zL<*>#J5fH_v%YzFz3mvCDkjS$ZwFzlBCi?Y-h-<9B>o3;xi}NK_2%G8eN%lkm3~ti
z-C`>Vs}etAD+&I7ehRu@ml49nY=-e`!=6e4zQ|7iw|vWyrwjkF|4ATwUW9Vp^;g9f
zSU|e%d?hS=s}aHQ?^m1yrcr26fHmJL<84GR1bmgA5iJjb)+o_nAxz8pzn?xDiSovI
zoYU&mhyj;Mo2kwIhv2oF*;kM3p0d_CQYr8P>+Jnp+V|3P^x$}#G11w3Y6@mPo=WMg
z^ky&H`cu4=#0DTShI!CA@emp6sC~pAU?M&-8e)V9y8T<Twg0bB>b|lHDe51h0yx-y
zn@wT^e~U<Tuq&Vadqv;WvEF0LV!0(2_zHu%98Ofwb@~Z2H@yCY5&7VK8iNLEvi;$A
zelZ@u11dhNHy_m~F7w0)kMe~*<;aUp3EWeniBu+Imo2jWW-m;@b$#CH#!#ehl^|YQ
zGD_EF-?|sB3?fCKn6C&uG_&SzOS2vJ?TzY{O_N5qlYWX79&M2bGJ8~bxHc&;zEDYE
z2IeV|R!po~g+suudLrv94euwSud_9|V6ATM;P|zb$Jc8;TqVI@G^^Z0^-_N#+3x61
zNNC2Oy(RHZvi<<Y8$V6+4m8`se-F6>-n)Xg7GBssS_()Xs@EP>NrkT;K98>Be#eKH
zd{FWXAy|gb4l<5L7Lr`%GAX0KKHYOZ`f)jDGKv_+J?o&lC5*=mX;d8nh!003=en*)
zA1yWOuCQVsBu}Dc@})0Tmi)6tq&5fN^eRQ-viE`>oAw_#sq`-S{b6_{L7mhykxNV6
zUP-5AG}{R^4f`G}@_Je|FDe)mi9=IEmdAddM5y$eV^LKH!Rm;!rI?WKiY=0=w@&mr
z*V7=yuuGbwrlBVd1v7IZrJyEF471aUUCA5RC#+Wj`-L2+;p7Dv$O~6oR=kfJWtP#<
zg03W2#|hidkQNKbSypoA%Py7LDY2|NryS<vHlTlj%WVcmm{rehA;xTZMU9Y)-1m^T
zY=|z9wzRoDE1xqa)p5aRuE(puSCW<}t+c>T8bCQxW35ecV>Id7yUodOPa?xi68%?;
zC98}AJ68I_fyg?7r{0d>PnYrT*Jc$L)&7X10vF?i@!QEELiX<g;v9>Dc{v8i7#|9t
zXH^uMqWAZu(u&p+b$mNakQ7ElF#m9P+>-?PujTP$e2PkcO)e=DX1oN^KA)se?P{sF
zJWnj-P_{g?9VOf=QBquJOTgj@$#)`umKvwTNqcKN2IN<PuT2fIDN=sAx<E>{gpnZw
zU0t?!mO?6=2v<Q0*9n2^hoV~F@HSU;wBjEV)NeD~$_XRWxIT;e+-J6uwkHeG=UG)l
z!nxr(qB4|}vl=@;-!z6k0q4H(jMY)U+EcC47_|I74kviofx%PIV)6Ltw*V6uApe2L
zMgLeyvEUGa7Mx94dG5U?o~D<c6FZjHj!JYL>Yk=whGv-Oop;iCNJcSXuAo}Zpjupp
zZ+P91n9<ozKXJU;H6Nh|eyb0c7Zt4G*xaqxwak3+z-5?EtOlq!;FJg?y?(~3j}S=W
zhtAe_Rml@Y0{v}4em_!WlZUNoxCOjaeTA@{G};!mzA*PxS`i(PIzMWCsI8!J`YDl~
zlN1|1_|P?7S>K!l56P9|9anY&Xz~<3zfUYU17+YX*C!*P`Uz4pUg&GbBxVJH@<Di7
z7L}&NHlo!E0+ty)E@01b<2!UgV1`n)!ep>=n6mOqc8hF{UyaPxJWFw{NO52UO=g5w
zg+F`<#1y=}-3X&oMG*hSU3kTKp9d{Zu1{Ssf#Vq2Es>5|<&I&4H8Y=fAcvxnDkk-y
zW16nGgl*hpc_UVu&2C$SadOf*xVADGtQ|6q*L6QpTO&s)OH@(RqKV-7nQ`Ofy^7s~
zIaml6|GP!qm*;7#r}hZmrsech%WYAt7;;WuoC}jwOJ}$ZM1=UDJ=(p@Pd2oPFaEAf
zX_n6Asc?wCB2&8({=u45-@mLGB8dm*GTa8ptmK#M8x<|c#}QaXHu4wH{2{5cG&O&-
zp%Fpv{oVK1iOyBtpp~e~v{SmeI_~jRO&6TvWmv#ooMc4W%xk%5qR)=huZc3mUjJ^g
z$C|h%VFYmvcyP?Y1hw7(a~iA53075;3E<?qm(p}6GtmS^6Y|N?u?#}r<hXQYk+8@j
zflJuZMX6FKbZZBdiJo@NNuWJA5*!`EG`whQHAlZ0g*&?}C;F^e&FiveI}YeVYhP}E
zj+e!s$I{nj#F0Z}4-4D7OKJ=T0q9~vBp7kRsWZ8Igp;wkdf1F5g2zgjCWQIi%JFWo
zQ?Emxi#0{>NwddZhd2|yzYgucAM*Z8Jfr1?jT_uIWZ_n<tYcZuTmjTNqcq={S=!X`
zMf)T}MM80Np&@R>YT$}VV#S9o|L$tA39g8}-i#PGHJwLLGtG0vPJ=sQpI%q+4ptAU
zS$xDNzB#2#7;FfgbHcvE`bI8jPk%hv056BqB_<N%ntzXwfM1JwGs(v%3^R<fiQrX(
zBu0<{zOc`~?|2h7MCGlhS&&(303J@t)NzB|AvqC7F|mFpi@ijGgdd|!tcY55lkKGs
zni6P2_(}x@mPluqg0FpNFyXfd{dq80)XXI<<)(+|7x3wum^bKA&8bfk_gs}FF2<j9
z&-u~;w3mq>(-v#l%{LXJkP0phuR+egm!*gy6biA3drSC0v$Ch5=nUgOZ~pM*&iy?~
z+w?2CqW_D;62G-o$lX>1r^>cZNp$&5xHc3WnUIRecxCkatFiSM3q!Cva6-0I6bf<^
zM$`;WIKvd08x?@>qAKvcprgZ0nw)tJWvS2!fz}BpHre?}_bM~5;twcr!jxwQTcVHt
zhm@-?1@{XYDo)y=!Z4{5r%$Iau{kLa6G4Y}oYn_wj@bW?5cO|OAFa(!iY8qbW69{u
zM}x>dNBqkaMpi>`|B%F02za3#qkcpJ*$*bI4`bG{*i&V*U#rFLGZvXjasz%)GLfpf
z%J>q4pWp+I7E?9qcQFfP3A5%$rIObtpY{t;A;o`-{H`IPR#%I%Mw7L0k>W&fehhHx
zSMTvHYE97!r((|me1$bsCoP7^hiE*0gPxk!%$z8zBFaGc4z=7HcdvD{DN#TGS?cgf
z{^CT0-e`jk^cnrP?9CLno0s64tCr^An_4;R-(<Hi0&VYd{rYeK5Xqi^G*{?m3x~L!
zp4rjC)v^cyIiyl8UD%oC5IF&L-g4u{HO)7_841V~(-_(aOd(jdVjo$Mv+fxmICzS?
zozHAnzCW~!L)(0-sb<UD!bcy2AKS#=Puuwmvjzd+W}~<OupB~vhNXSj7C?OvL-Ef*
zS}?`Z$+xi3ssTcs(#fup0pq~wzB%AD1HFzjg7Sg*kE!F6Xp@oHwCrLv?SfFYyCt>?
z<rxOUV@vBtH>q`iVnIr{r&N#b)@g7nqmONj&mKeb?F%uscg(QXPYJ#FwzT)xwt0*w
zd0o1<lrC|FyhWzOg-Fp*V)Z~ElNd$rLo!BTf$?4gp#w4{x;r*jBe9I@e)*cw!Jj4K
zzaJ)uA4VrE(>%`~4>XaFG2e8rpy60psp9O7fPFxnxdiEXVMSb)O+QGyxJUVc^)!(`
zc}+dYCOV%ztx6jW<vrDuU<;5zhWDmPL@37e#EuXun${JrBIq(Vc?Wu*-a7x$JnH)7
zYqh*(btgN?kSM|)yps2if?V&XCq6rSfEM+iH^(yD&`l9liu-UugZ@!-CLb$^u*uHs
z_HF+Gt0>i=Xp|q?camabMG?0j@f%zq$*!;JJh6nNGt&g0Hkwm|3ATy~N=0(tpHP$~
z@99aWiGD1iwWNM&SppLw(W7(6h{dPoy-vr+EzSLoC>lml#(m`LmTGN1py+CpVU+nK
zy)PCuM!jd*dk9ugD^$yS`)wzBMGV1sEGJk0+j6e^gQ+<`K^RAR-{c3XsP0x8($RcI
zz6j7M@{NHRoBeCw3GE}eG43U7KxBxPe54aYS&v>uT9iBqal%c@G{<-JM4%mcbDn6E
z=fIlbfx`Cthh2xP306pumM(G8$?F%Mikj&ubCGWtl;&vSus7FJ(@YSeDUaw&0}@jx
z5g8^H8{nkLRA;i=Z(&uQZ#88k)}*e%<sx4CGB+`8MDN-*)pwIeKfKHOL6W&=tvj;n
zlb8zpwzi||VOPex>Sef+^AUCtwQ<G!l*5jmr;Bss;8d#qy{ejhN76<#Vpbyx8;rUS
z&%IlAFKzvgf&SG{%!MrsjbRAusT~}s9O#gkfi$ZKKb+-D<QQM<Q?zif@<>W7S`Qw6
z=%D1Ze~nEs!lUs0qhxaq{FpZ5n5y`y<3a22wSs5r&`+?<w)i9tZ;e_C_+lKzhp?qX
znCCVlUK6fSBRRZ`TRD1SiKRKR4Kr#&zAP6lXDEBz5s1n@fx6i?v`?9~X0=}K_&Z;@
zg<th?uQBr_+KeuK1m|;9#vk613jaiu&~Tq4X%q1SUGR0jHeFlw$_9cVr|&WW2S0^>
zPP7gcDahi_`Rm;6|Hn@G2v&HY?M$eDc{fdE^sHW^ZCS;n<U`K8tX>SHAQY*`Zl1te
zQCXD6zi^Ts=i#&hcK%+V()&ZvO&kkWKKWy7pF5NWGy6Bg6A7SBWxGcA0GJYa`8^q6
zK6fqxAHe1J&GI+L)s{O61;cI?h_RnwKoHoo;Lh`~qtzbdaWK57U*1CnP1)_TYg;?;
zy;#wfMyS9sg*Jw=-0lQvXI`2}9DX9q;x$Ma3iMr9(wZYTbACa1Xy#Y7S*Iaq<YBes
zcwCV=hIrkTKx~mTPf*8ep_Zq)aMPve%=J+YP8{K+i2VFkL=P}O!qr`|q9OuDY^77M
zjD~>!mJ9+G@BZ+9cg<S-SYN>Th73@}!v4f_T{e)8AhAM0$uAalJ!kTNC=#QWk4pt@
z%Lnn`W^~3CAx`@VuKaqGpfjWiE|S-%-u($fsU3yEUZ-YXal|k9@5`2mC~%n)Ag-T&
zH=zknRNpo~96)jU{&TffuZs<P_m{U^vBP#m63LI@)5T$J(;}5#t04`Me~=1+`L}>B
z5k;(&ZHp-2#i`KN60#!|?&na$GfUIj+NM`E!Sz)y+J@#c5ewt{bMfut|FLvV;gN3L
z7LIM(w$-t1+qP|YY&#v>NyoO`v2E+r{-1NT#zoy!)rU3L9CN%t#Y_U?M*)P*Se6Q2
zPOXZbgoWI@1>J|^O%am5B}l7n8mQ)1pK<QwD|Zx=I3Sa6o-7mZO^Q}XbgK{1Crxk|
zVPGA&4y{!2#4qV@<jsx(Bch=q*Nm<b9E6cbFl2|{!ak;sVs_a9o5VufcN0#6wL`Qr
z#DdSNkv#fd{JoWmL=krrw7O8lLeBl(pF%E*r}0BA@RkTse_L%F?PXocK{ip?Acge9
zvWLEe%&u~N-ty@~`)MssSZ5894%M=%A(Po59gt<3wGuRn$455LdUlb~-$}!I5qXQE
z1_<vf0V~>fE4g~30k0sV4i2QJxoW^35WdGN4E$}AA{yz@G$51eKh(;toS@a<k3g$c
z6=Qk1^admnJE|%0FOJxN2T6UgefTrb1fDM#)B0Wd2UO;|S{V*H&rlB=nH(e}NzGfT
zoA1^9ieVicBvWR7sp+x4T1F>MVXstk)7=%$&yam{up>2SZgdaeQx#T}pBi8xm|zz0
z#ytxT23rs!IeQQYlWI_*CzKo86b<q;zuG$O0P*NHj-L2Ue@5SW%Kf$OTVN<t;n#wq
zzvlyxf(h}Vh?O7w&Y$2y%*4KA`tcb7huo+;ZJ@1=3Mtwt8jv)%ij}`wS^*%(Wu{S+
zUCU}SGGvRcl;Vz<X2>TfFlQQ4J8H>H77#FiZ38yD#Q`g^@YyH3rB}lWZOq<oC0d}N
zMO4QGD=S)yxW$$djsQAG{Pmy~wgwe~Qe<){);)#R$kDm^kS2);PF*O$5o>jc1#N@|
z$XU+LnCXx5CPPK;g+U2L(M}zVA5~W?S%eXiJNd6AM1Yt2DxM7S8sQLxfZ7ZvIMhve
zqqE2sy?i>*@*=#EeFw;xb-*!s7$eC_rnunsc3(~L;-Le!QIH<vSu3GQe|=>`FX4ga
zYCwc#gkRrkr8Z$$Pw+96$wp&j|2N&mjSvJQ-icN=g1P_in8)wq8!64elzE2`987AL
zqp^(l$h%HX24w<{-hrk+)A7GkBywtCoR2AMe)espYQiletSBnFqnrHTV8|-IVw!3c
zFX+j1xMOZ>Ps9JBvqL2ykn*xOkgi)FihG8DoK4r7Rtb@Qo`OqSieur!uSQ;^=KfgV
zf=Pzh3_VS(An0D>FjFPeYP6>9w(@YyDr5mK^zpZrry|i`9#u=q1$y((uu&xx9si~6
z-h2qpf~0>4seN7&eJ~&dIUIediE<uEdTAc{t$`?)B7#vWc$ii01bH7!w%#5(214Qx
z0C*lG0jfi>Iy5m3=bztp78^fna(_UtfL-SzlYWA3cCectm&dSV^<bQ5|JMFtRZ56#
z840S(wX0bf<^8w*y5W^<{nW`F85I;mDrNwzc~-CwD84^(A>If+LVn>MNjOF}^ePhN
zi=QkvIH0AJ;u*=AV{gP;EqEDd4;H=2gYD)EJ?Up}r5_uN0r8q^W6r(s*6lh$KD3Y#
z)$QI9j;*?z6y?Kue&PtQ_rMZlQ%UZ;LItTmqu1ySwKv_Z+tOwcEUeiSA$!9iufEFG
z)%b~`9d4CKK9(EJ<6!;<Ni9KyS7r;APMZBI4%KY_wJa*siI8-GNunr)6YD|-vJgf9
zP9qg!!e;$CHY5lEKoGFkk?o!=oMWNDDAS2T86xHti=z}r1;UkzfY&J<GkNDCni&&;
zrjqFZWtEe8kwzClDZ4?+^dbqJ?<u9@XF!b|*&=`aE$87n-(W`t#h#e+iu*YNyx)ib
zU6ohz3j%t;`z<}^(wGZ=8B)@cJXqFaQvydyn~{t}(hKbM&z$r&DG*3PwlHmzM4u8{
z8%|^yGC&G4c7BAlLeM3E(;|~;A{`uPxWW@DeKLr3>#6ZbFdvl*{E$dpZuQ%hWb%_H
z9g%Y&ql}rq$4I7e-cDo*1wl1tntCn3r1lq}WD8)IxEA?DVe%-o$AlfIQ(Cj5pbpf?
zFIn>@nD+@Rrr==~lAEhiJWX&nL*Ao93FQfYtk#tX|AsdE(AO`pO%R;met<EftY#&K
zKLnp3*v^DbfoGAdl+WQbIZrX{QO^woTF|;6eww)R<lNKgWkZ%E493}duQ0I@?gb%{
zWN)wU)74HqbpQsDgq<oyw{|c}Y!62ZQneB*Z=|sHbL622F3}`w$II5H^O1uaq!nNo
z{ev;7AHhO;_w0s|IO&H!0Y^VN#25>wd8CYUAMxhwPXC|B>QNd-^U(O$Pm&pLObx0>
zAVtC-4BuYRbY=HXCByWeL*-73W0yJsUFi^HB^2^`-6WYtc1hCAXkCSaBwP3eNv_u$
z@^xQU!!LdXE~AB-7V38J`<~)mjBsF^VlzjXt0>T}3zqg$1n177zX+h}ij|2ZoXu(F
zmgC_#FcY65m&D29KYJp~q6wH}>zY>eCO1#BaG)!&wD9h>P%c!!Lfjx$Opl~gE>K9S
zo4?*0jDnUjnXoE$q9#Qki9-HU;$8zpxbn6o{<vGvA<&n7u4+k2+!f^t=-8=0F!$8B
zws*wqG<`9AI=V2nv-Jz@_`E&-TRY}3NrXm_@$m+O)%F6*P-F>M;%rmr0|@>CF_L=~
zE$1&<5jEp5H`v-TK>W%Zoh_t85)-yXCjP?OQ1^91n=jeO0>tp5r?UrjoMsj&fbeRN
zd0I7|)}wFC&G;>Blp0uq0?}&bfxZKunA(3x2BcY5ziEqFA{%c0p)lGFn04(ocE)KV
zq=!)mz%W#4$FG?DvAfpBb<5g$p~zBF!U%$@o)Vd^Rol211P1(38~4_=M(b&97utmV
z2~#4rLBz;N>K~xtj{^i-0euPnt7lP`vlA^fz8G1EwcUqJ(zWXiQx;)1slFIwLXDQP
zvE26MCTxPh3v%vEN^I|1Ohc=Y;PE0PU)X8)z2-7Yl5C9VM8Neu8%2CeP$hzuXNU0Y
z0JzwFm=-gPFr!{z251<)clfqFCed+ZgG{$$%p;DHg8P)7vWLfPh_+&IPWmBDL{)Vp
zNQwGkW%#CUg8VakOZH1-<Aac4<XJqOiSbvE&Xhmhnh}^(!;YJoNH8ERhESDgYX~QC
zAM~6Skn{)C7K{W27y>|l1N??I$y;7*-yFAy1;8HYP8oZnE$_DmpBouuu69Q#>~#Aa
zBmkjZCZw)VvI&)O8cx&PVR`euJPIaM`Boe~eDn9h9z=tXB$!Z*R(`=F-v7A5qi34*
z!e_()XGiWs_SIy;;HjSiuG~AfP~iMo(*KH$>n<zSZh#=<bHmDUf1Im+MAq7w2yJmb
z6zmL}J<=+e0AFrw92g|r%WJS;wSU}e!~n@Xs|1fVrSMZRBRX|JG1hDUKhde!RL5jC
zKwwhHlv-<+s$ddO&`UG%zS`G9XHfkDc{v(nqt!iT;y`+Y`iuozz==fLxzG|W^|?Wj
zj5g0gZw+Q66fa~7=DP-Vu>}=7KmZzcE?2*eje8NSjry8#Kk0aS0(m|O@r8`=^(o@p
z;XlUlsNpq<qecDwTf~6S_A$WMBNj40&Ss8q=LneJWm>^(FF?17G^=lPl`D#*f$H`T
z%yV{=%Os#(9dw#D0;Tla+whiAE3@G*X%2ix3dtwfU&DB^)<}tx`*!VaA~z&Yf-CGM
z@6`f#^;N?+yG$u%Hb$=>R{Cg}?}c8Y7z$+QH&|uKcm5Yf#MigKL#)@R%cxqQG6R0>
zqs`Ht;*Oc=+B?F<g)yh3b`1NsIadzf1RutXvX83aFQ1gNT_)Hc$;7Kmr9WYVvK)$g
zWbkhlv=Hk2QYYPWsJMUErDLFrXG+}|KS|BjM${qNR_<(`g?;P{*J)=$oj3aBXJ-As
zrpfpbN}KzLzxe|M@t=Pr&q-Y)M_(W-ZIBU-9!O(|tCzLlI5aRsG(Qld`%C!4iJy+}
z$Tp%ear~1A;}LvuC!mxah;cKgehXp?os;8o!@RwRvIH;5a5(Eyk$%kOna~THQDCHR
zIQ`&B`NDZI441l2dDI{!oJa4bx>5`CIb87rZk>gj#ALwp`G%60-tbN8M1k^Nbuix`
z(cpjS>;FYqYV*iu1IC01v#(%ykP#F`6;qp;z5Mkh^JMnbG!Zl~ywDq=mPZZIp~Kxb
z@VgX6l+~BePA}uGNR**tu{W>RYDqYn4HOPIE8~T4rxTxq>+%;4L`=7!dZbNPv9vgY
z9T*$&pmRn+$6Y!|E#L1viM*^uYU&lI$P}LPHzCGR(FjB2I=Q2UTI?5u7UNY=-uU(9
zND7`aTCbIp?P;U>p5t%&Gmq`RH8m|<|432K76$zdW`zeBax+d7_<dad^lxNBp%J2I
zK`o~{5U2`I1}XZz9R~^1B2^N9S2_?-v7uJdMwHx1WHFF4=9GPg&cXgNChR&JUh&A+
zC2Kg=Cwer0aDdm7(+*;+e?|=+mO!`tUTCg9U?@Br{p035pjU*6v9Hl8>k-ox3OT)M
zNi_6^$dF|hLJuPy|A2f|D2B|PGk^1TMC`}a6-)+UMD$3GIy?j*3`HOy#k#HX7vv_$
zuVP?iY)9=ETaRns1S};9y;XG!EG5xLfi6dAv*^U4?jWxdzKvZsN8#Dq|0Y~dc$7>Z
zBObSGT0+eh6}-9&G|s4g8ncP^oCQTA^niSOwrRGV&MDU;wQix(jlkL&DqE?WZ<L?L
z7qLd2dxc!MB(_UAZZZyscNbV_vgDrx)3F^3zSo$xhzi@Tw23`{mbz<D`ekWM3~6~c
zmG)Rpi&K!w>CrqrH{mOVZOP>!Jx6w1sSHx}&G&7aLgn+<9${5LJ{DzX)dH7X@M!+y
zW)hChi70Ei#jZ#GgqmKT6EbxaIrC-b4kWWt13$0mO!Iz^dQJ4jiYG1mHpLS|$(NUE
zK6gNc7avt(|G1K+zY;`x3pk~nMAuoYyH!62x|O2fj<a>eFq*Z0>SY9ujY<G!L+<$;
zwHeXEB0GfmKWfO`9v;AZbrZkZ3PA>kNF)`)Fx6P5YcZpr+KjW_64Xs&rE{qk@+E0(
zFXZ-^bTFhF@}`+VtmCXOHBGOGzsK)A&d2=n^QmXC%1CxO%87NG)@%|8e8R{CFkiW)
zJcj~Hl=K(xImH5o7*;?c*uw=H3+IQj2BtwAIR1^wpxQ`t`mnKG6v2NmU)*mHO@r>x
zO^sq&>DR$qITDgjUpz_S>{a3Tc4M;G-1TdOyp1{9Ha)Yvc3#Kq@@KWA_iJEWv3sx2
z`2SgD!tbPp?_fJtvHEH5Ul!(1buU8?FP$$I3goq4rjlX+|2FUUH6_VSI!wX>wIL{<
z_gfMZ5`tJjS4d)Ai%)WY$FyQ1j9)xiP&WMNo+&L=cQ3)mSILol8xgS!q_$@xjL(z%
zHjG{soBTPr)Kvt4*#HR`Q@s=bx4NOKvy{&MB@nDrTc)v=LT`xi!XSez;5+kli1@?B
ze74*3L+vFF^xd4IX8R}flgg4X7M$Uq9~f5GaP3ixo7vGnd1nzGr0(fz^14LFdxX0%
z<e{$&^X^q$wR*M=J3iMYe^i)cx=(%`$_5NETqS>uS1V@qcIDHNYtyH=e>cbClK#h~
zbE5sU_+V!L**$DO8j&n~WBpD{K1jnQJsV<_jRVZF<oxMR;hoOw{$7zZFq6(RpX3N{
ztIlUXtCD7b8{bT#_6loLI*%`T<yX9>Ej{~n)U!Slb{P&~`HXn9ZRH=jL|Cr`Z|%At
zhRfWD*%|bpwYWxV^D9pz0MC&>KOYmN480DjD*1h=k}07{IG(3!fLK5uWGEiDswjbo
zV2%*FyS<*K7J0vs|Lh^nYG%QjGl_aJr}WA!3-VDS?K#6rpXzFI9eo!-xh-HM*CL+y
z5pd_x>n~$V?&d2{%3P_0fV0)t#H8M?CwKU{8Z|$O#I;&WYP)&bNLSBp3~2`>=dL2w
ziK8dCojs~~z~B`e{Q^n(^b9taD*?0PE6_rFgUbRNyM|*po2{R<h#TPE7bg=K<j?2E
zLrAEaP5FlU@I7|q3XF~5`-v_{ClvdbE+0h@uL8Q-(2n|M)vjJeX*d|SyqlL%HEdq%
z5CW~OD|oXx^hT^Xsk7A%;1#?`R96aW-A*-SDA-OMpKpzu0{2x(95=Ebl1Z7K)h<~&
z^7DDTC-s#fu$~g09l+0=eO5eJ9>wNN`615jsRX|7@%P;IvofBRA0S0m{#Nr%fEt%H
zNDV+Q6CL~9^LVF`k4kv1n;DS0kC7ZF)0IWlVh_ug%tLMmrzo=KT|7piuMuE?yj}NW
zGR73J(4qoHaeuYB^>AM}?HJ7Og}VXV^C^RXH1IiEC3fgNz`hmofwnjs$30Memx#&9
zIzQjv3X-dxlj5^R(f@I@L}fO#S1CY8VIUlA?2r3&9)Fag)|y0j;-ge3&UBXBrMTmx
zQ=}qkqU+{4iK=9XC?;vkLuDO$Wg2H>?YlOA|7pfkOO9aWKb%oQa(s7ZOq|vzA0t9u
zajdyM4kuBLI*Z}KTl5hQCsU4il`ZgKGUSD&Xs9D{u&*h*tw=zRFvBmS{Oa|sc|iO<
zXo%J0;`NQqo#w9%xv+cCq3kOvn6oMo3a-&WK2d^Gd6!z{2-t;C9F?u9Y7M$QJO>H4
z2x5{;?TaQP9{626s_4l*i}(Ujf4Py{2NGFS0wx0W@y&Cf2oGD=PWvfjgl=#A9MM*f
z<Ct%sIJs~qF+qhj|LI-lJ3%iIPx>nJh67gj>JPB8Jn_O;JklA_kCMhCyJ)AQ&;pS`
z3V?q%$OIr?vyCzz0BTmym0K=X+!DS%u?@E9lHziMbV-|+bV(VoE2|H*hZfrY-aBsb
z1bGrkYlG4JsN(lR^ze1)Z#unb{q{7%aij$jht;(Q!`JRK&q<&K@@HNwKZ6WVHfdYX
zF{{td90A|&CzVwoZHk0JK0@m!+-84vZ+?))cHh8igGXQUt=n|qLwa4_v$rX>Pn#Xy
zOhE(*(!V+C?rm(w$diP6{I!?%N-L(z&?Uf!6W17K3K*w`Yz)vERDT)hZzG-%*=r;3
zBw#<0PvM3y8hgGV651?ZY4y{~S8<~VAL85bi})ssmPaNN0TgnJp$qi7L2;%5Uo}c{
z4)1r%+1e4kuAQ1>|F}pF*`Q{DZ#?8L^BmP#Xsh@a<oV&q+g@?eu(!&lYBQ=ofAMg&
z(%ueOP*qT%S|#IfqQ-%gpLcv_2>E{$0aPxd9&e&KmdS$Lme~;v7n%WHimPfr@dCA<
zSU4iFUpD#3mcv@j{-4YSU!7k7mXK1?5D}DUT?vJ7`_FKzJL{Jupb3FkfL=^8=lbBI
zmint8umyP*%1`$OZHVukRl%>ikYCxy5XR#A?usmQca(gqq?Cy)2F{c|+Z2Q_y(oc+
zB>@$?O&lrszA`Z=XRN(HV3S?kBA8GibCh+Ow1^Y_f$H{7_95~V{@96a%EYh^xx1e?
zjx9d+H(;OMndolk68Dz^7kjrDpkh9e@7dku2wGh={|FfK7e#1C4ucEWi=F=&rCLy{
zJ8&h86qbr4<#SUms`8K4JvG6y;yF*h;TVp9k*Unw&MgORfl&+*C$x_EiqsAxR!g4#
zv2KAOY$pK@$&;X8rl}p-NlT}{IaMq%&qh<d!t3Z86-mspV^Iv}EoJ{sq!H&>*4p^-
z`Ly`4;8XGSTlm)3{t|QfyIpj$Q2VWNC`_0y6Cxhv@K0-lY%ikdH`pw1h29f7@~dZ|
z=dsk4^g_`x>Y1sJa#vD|<glck`T<p4r8$sT{B1z9gj<S+8p|!`XG9b0*#GhnGyfr|
z0saE>#Pb6RSWCp+zZREk5X5JT1a4+Kfb5C*ifq2~BII}5?(?2Qkxlay2J;eWKL;jO
z!u49S5^4YVsd7d$s6DmRPl5`i6|beAuY!1gk=+&A#<_16lsQuSZW7oneWZ}gH+qsr
zMXX09`))tj-*Ef`1qS2pG29{g;RG6u_y-dO1`_#vP?t(hW^?%mvlUMiNZx|njteK7
z<#Q3F5X8nhP4CMvLIFR!48k7EhOa)Kg9ke*7sX#C33jH#mX^X?<9Y8i?eUy?_bnAU
z&z9xV9;qTF<#jt$$&<UJHB6d`#}u7>uQNNt0vw$4SF8U7)lX~fi#F@BLu?;GVpv|W
zDCQw1mUtUA5Q1axiYIB&L@_zCX(1<X8Y53bhRj`3S=<n-U~iEnY*1r4MGo`}Rj~wk
zM9m2Cjx6{hk!Ru|ab$tMgc6J$pGdpC2lF0qPqjF|O}@i<VV{;kul!|qez<?N;R3j&
z(X~rUePMuEBn3Y_A+jz#py6ngU49?cAN1{ji)>BB%eBRGV<Dx_u{gdfBv=d(A+d*p
zW)V89sDkdsg@0}d7w<OBdIv9T+Cux33mSyt7j<`omh${rBK+c+qNXo^*#Rp55?PYQ
zkB;iP0mf{=3Fq}mtG|rgv<WKuVR0E{AzCkY#r+P{w?xW5jEs7fM&d-rD0Pz2QXIpA
zI+rj2-x!Z^R9-rNtkh`z6WjXiyi_(1b5!npe}`k|GVcLvPag0g&$nN6gRwMG*>!sK
z&xCWSN;~5B_r$!L5I>I{+SzaaVrtzOCxN7XPzoB9J?GK_2z+DwY2-x5Xpr#%RN&vb
zdGsd|iQ{DkYrk{6ZNV($dOrJDT-4QO_-dg$aSSQ?wTkO!_W^C4@=raYeeN2H3<-~?
z9?S&K`pS+f4UjPi6hv(|M{UM`4NL;=5wX3KY!Dxc?zP;2UNT(Ig61MG!0|@bCl4)v
zf>3XbfM0q3Itk#b6*MoM%$1_*DZ{v)Dxc%1Sz^MqyCl2`IiCq2LJ)GZe*$&fmaicC
zv%JR*Maj%)O?2$>$^SFtwdXh_B}S50utQvlGRBBlRGD=D?5|VUnLn#&u;acmzJkXI
zxua??MkS+4g)Fvll#tj&hL%3+IPGkrbhs6Ung<hM^WZpQCT3|5F}!yY%0x3m#K&9O
z<!KaFefIa&C!wF<pAA^GESZAg6`6B&Orm*b1gkB+{76?7%Ddgw#~(S6sw7g>w3Dx_
zZ;x)qjg@Kq=?lh+m0)8S|1J#XEppIh86ikkZLq{L*L71Q(~J*wOkhGTfrTf+!%zl7
z6>3i)RPFDF-IE`x5$56-3=Q+uZ9{40s5n$xqkW&RF>Vn=`_oZJiGEKb>taF}5D#kP
zxU^Tn0JKPVklbAi;FM!>ji=p7otyy|98y|X1pb$l-_NMFU={ZhFom63+Nw4OIR>_$
zkTkjF2a5*dFO`p$?ngx)kHb7?Oj%dE%SX<ma<B^G9@8NdHFNp5^Djau+mZ9$GWd*&
z0)nuc+y2Xht=#DKP|)n8t=ypcd$+wCk-aDwE8CYo=XXNv*J@YAJkIb;d`oy)BF2wu
zVQ#5XnP^`ewPNeH2C3tyl+N$p{>^yR1oL61*0)Re^pGkXEiDLWm?W0mju?CaKhaB6
z%20iy#i*c}vpwnp+)4#;5G?t2@X6}SV}FtKrXRG&7|B@#aJo1UD`K<1QnL^=$JDIh
znM5ON^-Iz$B`I5g2=Wh4Btqc+u!uA)k7h00FlS6m4VmB8<FE_6rb6<YNB%B=spp6*
z79>DU%c}P}BYFCb3Vz8&VXNOM31Cu@BK^N;^uo<<?Y0<+{ueM|OMr3cKT+M5_lkC>
zV$KNLi~RW><5~tdP6x!)0>TVH!pH&s!IB#HN+#$VV4^Z>DWatp9|~QxAe$fSW#94r
z%Z;0mIyZKM#t6bWui|UlU+x6YCB%w9gTCYQ9-rUp*7+{ezp4t^E%Mnf*br%KU2`!j
z*-0a3c)^6)o1&ekE$K|p=$68~;r%3}_fwA~ETfBBoVNW?$pW|i{<h9#5ayS75VLiv
z?4SQ?!a2bnXykw@7E&i=@^@6j6;?OdM6M6>@g05r(D_A){D@CENs3p^V`Gb2N$QG^
ziJ+d#gfh8r2@@<%th9CTYov;frtFF)H;jlnQ(f7ziAws9S~vx?cB)lsAvwN`p*Ht>
zoGVr5t$E#NnF!S<LlV3;vy(R$TBhO)`D23}f|&RLSpUel1+Ac|{R)X+*Q`gVpZ0pS
zSPXnbwe8BBdkhvXD-Wkl6?Brg8J~#q(366th7wxCK|Q$;7e*9*M7Q<~8E=W2?T6Hw
zt9IR2;}u|nk%0p+YKNppE!c1VGfbm)-vlnqr3ZARoW=FeK}TYx*ez*Q*fwB4Rql+`
zxDsjertUH?kfTi;<UyYQ9%RE)p1cHDTiCTAg`dAs$VW}2vY0_tp#^m3RHX-TeS~M<
zBaZ(liIbOh$mEtfefciuj+(Z1w5Q%Ej;_CwIyK%s0xz>kp+cv*a|!f=jqi{xWa`k5
zLa)*?mJ(*H%T+4YqxwH7xsl4=&=6(>22OT0F){OPCcdRkGfA%Y$Oo*wA8l(;d;>k_
z%hU6-Tyh0iS2*V!`Lx+8oX&;swYzXdQkT?<m%?^i!e0ud_Jci*6=-xc$K%CNMMCGq
zRc7YA_caz-oB6i|vvHgGzk|ikX&g2X2gk-Z1uC)$u*FAKK2yqzl+CcPbskhGS*^$j
zBuDtYE7WWPgqje?R%YhT&kCMp0Igw3xM0OcY0H{az}XpP=6A&6IK(j!PC-Sfzvm@x
z?oZds==(6ck_I>x&SQGS!X^v`_2i#k-V}WxF%B3AC-&e4*n%-j<cu)HlEcwI`pa$c
zT{c$}I%?@d62hT2H%CWUUOw&abw6;*!|aC==099F8<nU{7)xp=dO8L})gUL<h5QTi
z*hAHe`+Bq)CFY>$c<zE{7C?wF7>Thl64-v58QkcrwG#M#n+4p!(zCE<>0o1}znsnr
z*I0ds1v~E+O?gLi*5~UV#y#y1N#Y2i!>3LEX1?^aAC8KgYzW1cV`m!p*LEz8hQ!IU
zvh)IT9?)@>se_^pS1{Mt48t{Kn&kWg%2gWL_rxq|N^>A1Km+E4UD85pKm*~wW6-n+
zl(*u{db=ve9dE77NLb|rnN;(1r-=~OZ^K$2t8<?{a^pm}&R8GobssIy%->=lzURGU
z?mlYa_HgIcTqzY{={eHhY3bqV9WE8!#%1Gp#oJ}+<);eB(Gx-#V1oNl&Ps~|lrcm#
z?wvr=Bk;t_(G_T&-tIkuPx-87?(Sh(;=U>t79J*lVuWJ;)*l2l?ii1jNVDAvIlCT9
z8C|UPL5|O7od}h_frbgi=>o+9!32uc0)@#44xQ%g=<3#IMVw;!B}^B=sw2LbAJK<#
zNN!6j+iMLTM>A-K5Jf#~-r61fUVaPvZH0)@+oIplV|~y1P9*kf-(ubTmK)THy>u{O
zM=NEzP0T4E%>&GEX-$qFnw7W(b9N=UK3$OKG|&+FgUx$^8YkBs_MvcuXux}c;ZH-A
z3|oLKnEASyxSlQ4vZK~5u%27VrrrYdT|N;{;|a0DnE<1fCt##V1xdmKaq{Yo_d{1d
z7)u0DI6tlhAZ^&T8#dj>e#?LCY89pD(6iaxr~cuXF(^78;OJ01@WD<LIkA+mJ<CG)
z+AkRMmoGsuDlpjuKV!}Cdpo%^NdD)b?^Z4k0suM9C8h_NTaXavWI2-&6U<)5?jAlo
z{wm>IG3U3+BdOj$V~yf9N@au!Dhc^bv<@i5zK?I!&K*IbEmW7Cnu6!%6(s-6tut2S
znGDr1EFZW^#)%$$eKo4adw`%D?OYKz3Zs)-$aBjjc?gS?BxXH!&V<uKb~tuR=7)07
z-AKC}0k}d3RHZ_Np47n>B6hu>RdM|-*9J$f($)ow0iRX6Q5s-`c4$Lr>ln0$uQ-#u
zD`*<tOF8!#a2moGd-o+Q7LSH&HB4%ubhmHtl%#|3i_YS`qnl=3eXA}}yc)fIs}c%^
z(D^OU283?kV!jjxUc!pb*{{MyOxuhhNt;7uvW0@<ZlwCi`O0C4+s?#iP#0qkvAR~G
zwcxS3gbEp!hdsRpD`RdZnZ=!y81APHCNL^J3MAter!b3;x`&7}GYpVHNDu=Wm1tUk
zNJ*=ruMt8xy&Yfc4Cyp?Dpp1-Z;{p6Lu!oEca0*NQ%_MV68O_fSu>j;Ho^WU<Xz#w
z@Y>!oh93qrHCTRXEJ1c|LG(w2gWH{|&YyD&^<@E#C%D_u%GV+jJ6a2xai+NLR!7Gg
zXh`67Yc3D(z0HAa>2~$O&c$J2wDy&d0q`4nO!$5;-sgkjM9yq_+~z88w>NV1_ogT=
zqMFXnBvS}g%jL3XZW^IRQ01zgUJ6(`@(AUbj#aj%7KOJZj+1{jI2+0nFDKjo>4P2I
zCBb6Mq&&jMoJLHpB@h_+LD2(X%SiCZE=I?N<Rr0LEs~pIsT;i}5(h39x$D+GbxoAw
zomQYxS>>RA2s(i#G!+I4fxjmsT(_X+I+jZ>Nb0yG0^@k4I%i-%9qRj~&>ZLpf%8sb
z3X>>r3<i7|>k?qWVB_hKk6B?132lseZ~@!0116+_K1QLOYYM=&L8^?U*4tX>C9uF&
zIx)oLLxlVmMk`OWlUGDd4VgrbIwj4F-=)Dg5wkXARJAepH~R0t4&<nvn5|o!o?=jT
zLJP-S{vmQbY079@nU251U>T;cJtpaBqAz8cvob)<%XQKvz?EgZ4YP~<H9?x+rI+`P
zjN2w1ebe1ZJ#382hzuKX3_&$H3EZu51(AKd$WNtu<Vt~;K-9ryEr5M+o57>6{19QT
z+JHh&o+R`HWCaz$u*7oWW-0K3=3p7nnR2ltYJPHSJ!ee(xVHq8tH(Zld8(2m%0yhw
zwnE;dRHSkKrF{3;Kuxx#Z;AXENHIl^!FsOqdFpTbQ5SF(5L8aat#NxQPC1q{=onK9
z8F9Ch8%FarB$qH@K-e&y$huGPfx|rf9x+@fE#u;X(;G8hs=>gZLMVV4NO;;k0mTF)
zW*1S7JkZs98<C+8<Q(Fm87DNQVjPoEh0Jsj_C*xJBpO+U_;dX##)B3H%tKdr3pV-v
z{GJ|-tCQ`5p3?7&grNaflR6m0i!IDsAjUjDO20U@zDhuPtaFZ|uM^=l<+uhP%sU%}
z$=5hp6TccAQvgvS?`kvC!R>-P9ly34S0}1m*L041v%Y+XyVVBut*%=AR4j0%Z&6Uy
z%fKwcM-8VTq{2Lot#UUe&2!C$N1An7kGk+|Lz-17cWJ7{IESPEn{2jG{UKh?igr+c
z%|5Etzt#{(Ir+Y87bnpac&^z-G`sc*AVvq=;`m1(l~VnAy@Pak=o%5;LUiwNRA&8n
zbS6%r%3YcYF{l-CCX~*j^Fo@kV|#H!lz|e~#A!-(=jEYUW{OwLd*+Rl5j3{pXjQy7
z74jk#GB$dBO*N|u$3eWZu;G||O085t`^ua{pEyeWtgx9r27F8_(Kk7O08M0CoXVj7
z#2^`E;#ZB-)@Vt}OD~1l8Y}YO0&yGX{;B(5K!yjnB)|i4DWe|U47jxa)_@^yW%3u~
ztW(8`3nRKsv0>?q6ggPd7iAr2yUc^bQ$*L3EOwK{NL-f>#Fj%B`p)qF&<jrU2EZrm
zz7_h`0+G~F1#(QLjw#kO>#mdPX_@$fn06$MDUx-qgy~{qcb?GK`bO`_V0eaO#74<}
z5W*DG>|txOQLyy;HD4MWVPrB`ri6Z3MrnBc6gnND{$}ZB;jxz^I?)j4q?5A!*<qhP
zrKz3z0l7V$gE_SGILZC@W<&g30MBRd;e1j@tOcudy^Cuz4}%8pOL;Z3L;8hZ2I}D-
zZKX*7Sidz6T)hiOJ02KE&n~y#e8?>5<XJC=DDYP^LJhGQJoarryn5ar4)@&SLuul;
z2N#YPuU4KrLNR7ERm;gid5x9ql!3*4Q`Lb>GU#vj2F%CE;rR2h%#@Cc4EH;?S7DAt
z*3s7hzUz7eci=xZD&GONl7k#H$w_>M>_{7PYfiz3a{m;IF08PosK`!KhZoqDr56o(
z*-S+9R4+Z{2?mTcw%{;eB<h=Uy7}NRbl1>(cGn3YU~4Z%=y2(BBpahv!DU|3%cg<A
z$!_+(ADeL{jWZOG1qyX5Z@q2PM-)wldLde{Rq0fSk2f>DQX+(N1dA-WnUCtsN(Oc^
z(R1;d1As5V+KVP<F`{_Zi{8=kTR)i__TFfD%7xUTuGa|Xg=lgFicO^K5i1&!N|9Lu
zJZwElMx@ii(JmrMcc9~Xl1hoE-!Tg$)A$QB4$oB@!}GFn9l`Oo>*|B^vOgR+#;Fd0
zSam-!$KRcBUE&6k$gWHD<+99v6(7e#aWvZ^TBs`dB(zcV*`G{ft1S^2rsXQ(w)$x$
z`C6iD+lkpV6slRafgdq6!@D<MHWFdnh?(9iTcWw^3-INt=0NF4#o&c6{*xSvs!t#C
z1T;cX@Bp&~&*V8%j{qiydufH;A6030!Z|2X(f$#HD_<qdeP~|~Mrd&ONW9smpqN4p
z-eB5COO7l~ao26Qi>7(rjkqVU5o@;i;YNMjX;c)Rw`g<>$}O-W-=VC8!o{4hY{8P8
zXm$(W$sF(HmfzoN(^{8L5JZ`ar>#GQ2R(LMpU`?W*@HAEs5}?P_^#2NJN9~Mb{&0*
zvCR0KH{tY{`8V0ev7zkpTqp#;eTrLk$;zF2ru|;$+w5tS9^jym!~LIXvZXUVEN$fr
z7ok-$YeD)!G%6r^{&svCVCdsx-rDySZ%q$W9e^C(5w_gI*yO~)5;eV3&&9w>h7JVR
z4nn7PVb)=;;o#ywP4l)4A+l#6t*TzQL($)fz*7vdOSR%km`Fw+9wPdJtH)E0zI;x#
z-$p<eHF6&e@QA?cV#{pmqZj~Qm@jQ{E9_BqcT25p`mrhOv&?N*UwfC<O;`{@YpH0I
zfPGr)H}TmeWIOC_utRYoTZP8JKCOQ7$_gQIzkg;(32jMmViz>@ChC;#AjuyMge1@7
z&g%88L5Ts^34sJK3LWT0>K{SZ5GKC~_8-9vF3p8ENC|2MPnYZE&zI>JIE!GPjz8;g
znI@8MlrPcb)8|RYfu?NZ-36Adnk<#Imiol-Tf$42q9Q+FV6<SLNs5};3$Vxn|FAeO
z9^l*l)eH-ZZC^I04-4n$`lvRh4}&z>p#Bbv9@5%@(<ZJlWw7C;)thJ*)*d%h*X<!w
ziW&+XuYRqsPEgm@t)wrAxr1E7WyxUb8!i1Me2((tMQu{l#c(O_-nqD(s|4E$BF26-
z!zJw$o?N7iJj_n#<nbpi>IRc)dryhX??N`Glkb<7KTb@1F2c;B))}FETCr-km7@I&
zjrA>{g|`Oq_tvLF6~=u3tW{by6fYonK*H@sHWK}MZczPqSdo1K44z2t`jE4C$y->^
zxHgSgsA}jl7fCGI&4N(~8;kXa%gBx+d!Nl9zrv7(QPv43W}0K~4p)^z&M7NhK-TGB
z@FX5{J^${vxTV_{GGy{N3Np^ZehN;1RN7oZd3rRNpiiz_bGZ`9c^D!%at4A-34ev9
z3@XPV<(3!9ym0ZK(;4~<S;4`yq(HraRyk$Q)79hxm38I(#|x=>DeBKG)g~WSZCX8#
zVz=ynmc6|J))GF|p|pR0?u)N3j4)s^9tPdE3ad=EA|NBY!fHvlWraA;Lu*NXT@rUT
z{aTR^hvd+)aiMD~VD@0)%}6fgT%q8-lrk|^bT2U3LK!4Qqq+CqM;>;a7WQG=gGVQ$
zSY(I&0#M$o7un-e=gQ`Y;9Y}oe~wpPROT|Ew~*$#sege2U|LvE{!&8q-#;d9Binf<
zR;UDm;l&)#9fz+RWGGF9b-ky?Kd#jQ^UKh#mW$Hj#gmIq$CL&KpqLTsM<?D7zw7)H
zDZU4Wjoj@8WJ&ce1oVF0<;&xl6E9Rau2+NPM?#P=Rp@a1?)$YsK9Oe3g!^^lFFm3*
z*+_<P_Ebe-W0{$B>GT=Op_WL`lp%<VZi+ewgGM3b8$!3M7LD;^D+YHgNN}T_pECN3
zez^>3YqYPLciYO^r^qE_36H0g>N*~$@b^QVvq~9$flGiY1U@wkUlf>AC0GkNKS(K+
z{bGTnVs;lw`Wg!L#0;E@i%wC9X9g#FVrGb34eT^erkt1cBIuFivz&c28TfS11ZdwD
z=ux5hjunibwr)Gs5B_r2T1YxNVr}PCocZ*0P+bG@$TjDX6@9Sjgg^ti9`n&L+M%HP
z_HScGN|Iz$koA^Ne^H13(rASNejSS<krY5|Vz%!lu@WaAkc@OpP-+h!<_3k?==%df
zY04d<JW!WmijB*pKy9&5X2}WE+N*&-5bi-;B*mY=*immsKa@4gf(YvH!?0#7;*Qk@
z9V__+S*fZfHb}{ylvY_FDN0iB6kef(f3z)`F{fJhz{J?e$S=wlIpl;$N$~Xf<dAw(
z#61CpjL16?Wo(R(@ONLK{1S`O`PA4S@`PJcVGbJ{{8=w-YEe7Q{V8G;g`!%OMT(NK
zdZZcNd*1k^vXZHG%|q$jR3+3_=msQ=Oz@aPBKxHyciNghl7Cg@<Yme9iGDS~LLX3~
zEoLkXg<l|EM*uJ8DBF1|*tX{@%7#dzTe%~$T>AyOQ+Q_T<g%zOnMXRf6l8XI+w_!A
z7hLF0t^cDn`eQ->K2tEA5oc9UNbN@TmCX}(&+w(Mx4s|83c+wyeLcF4eG0&&3qGbd
zF9rYnn6NtiLnd;52e#R;OOp1v`38PGH%4lGct+7V3a;Oxn#ZFqs;T$$^Rt4_#JGXj
zBcv)CKi6!kVN^f@x_HN7vCCru`V>=6vE+aQBAm}3Aa>J?_$Fg`LH~G&PVv^gM*Hp<
zIij#xYbO0<WeS4YtJ|)(x&tlx*vd#nfjQyc*ooD;t3ci`h~v26wr%h01pQYS>hemJ
ztD>-BRE^cBG>Z-?v&W<!vt4E(5EfA<&yJ`V?5X9rzrOh!$?8U0M4F9NS-J{U&Qz3@
zR2xYOx^#OAs&p$Kb2_G0@_Ww8n5EJ+%PA(8f};3_M^4%5g8l37B5zo=Go;Dv9--l-
z22tSS7w|~lN;Wjc31|%8Jg4Ssk#lc>GSx(Iw3?=31J5$ulBv+h1UR~ZO=FCt_Nit^
z!TyqIP1ZdjAmreH32JDLwiJv7(6O(gx#DdL#jrqB3{_I)Kk)L0PYpP%MrGa-D#>k<
z_R=T*^DD9$6?fTltfUrObR#OZGQ(bCgITu1-Yvy^nkt;ZTxu~ihT|B;<mGPXM&KiZ
z-s+1s=bhN%6-T}s)6E=X2JDWI>q#GwXsubJ$K~O^(}LP&s)f3wny&YSU{yJnLme;)
z#<sljokoIk1rUc0RwIg5g>oc!nX-v0I(m8zZUvUKnX$HR=&)l(bRHb$)>T!Wf?(Aw
zt)10Y&UWifZ88fvGO%RYX;4<WTGj05n^adNBBH+!B}r{uMhJ#DEU*}&H(2U&9(*qQ
z7Z^qFxP9h4xyc+^pWL?muEz&6Q3RIQ56($Zu0-{GWcZktl%Ay|kYDbJXcxJrEYzB4
z7{k?3bC250eHFY_i0PBZ%o3sE+{|2NC(KRxc;W!eVwSn&CffcWfX&<hMG5lfr-41Q
zv|3}xFA&}g#RT8hf(Ykx^VjCnA%~-bq?1us9tGq})0KC~eo!vDn9u-xHyg$i_~~0m
z^njG^z)+o`3H9=PWur$3A`*@T=WF<*to<!8aUQ4rEj&ycjbsQVnJAhH&S**=L}_op
z?X{$Y0}O@b+2>^>bd)*|MDUvyOQur~rkOAZOk=H_`K~@&bTL_Mr$(8rDMS#C6i-{E
zrzLWE_v9C!G-%7sdyf=@wHH#&@^cFA^u%kOmCuB5qxoo_v3fJ?c$S?)MO;w{BB&vC
zKnXA#9$%T{`Y7<wu3)qgAtX{F%%$U$gCZN+(`|~|Zk1I09&Z@_XUdR8vK|NSMr0!O
z;sN(|{bD*lPhO*;#1n7cfaG@0diTZG<;3F^6EXl-hP_tPh^KpLntxPq$)A(kj{so7
ziUd>)hnWHH@B`y6l(5h(_vj?4#Uh^Ps(QQ`>79=={RTXsiELx;spb%#$vwKIy5<nt
zN#Zj6oYYpxv_aWlW4%<nK}U1v<H`v-4?J76X`s7E+RYMaB1Sy?Wr_})9X#B3bmB%_
z1m%uS&ih)DCTC&Y<M-yLz4D&7H~I>^pht4CtxzsiF&x)}|9G{Dr{Ifs;-6`z;Fma#
z-e6I=C>{*I7fTzlDI8^wg|IcW3ricA5GN+hK_rX{%UU~FJHJFUTr${tF|~`dlAUsl
z=KdOEC6+k_cbaFg)?tZTZsL1|VunN6HNPO;pr4nYcsU~3B|FwBihR{~Q!<(s|6y=I
z*!02cME4@U-tleI-rhgCQBTP0=p0_{Qrp8ITw(RAsV#WYXnQTlqn2J<*(6M13ba06
z+2kX?{8Y6((^MJo&(Vv52ZSH$K#w_veqq|EEpzObLjgLu%4+Se9|UTMJ+MON807=e
z!7I7I`#wq;K@)T^+8)OdO>ck8`Vf<EP|0r1ydt}TS6-lf#gi#gqG?_27}eP7GihDr
zWVV5L!lqI57PDU9@E6H^rAyljFJ|~|9iaJ>k&!s%rn?D51+h-2vj3Q?9npXkU8-$C
zaJVol-xnut@G9R6NGw1cWlAd@Hf<-fL2xwftM7UDQ4h@o{R%T`T0`J6Tg$x99diy;
zJ)WLXsPu?Fan#uTC}9zLFmhX$uV0^i9{|?1EV1G6Lp+r~hn*HQZyX)w<NKEvgo6p1
zewIgIuh7!28>G=xWG*MR%2PSAl?TD^qUGVTYsS8iDY7;Fq_7nmHKXgP715au#50$P
z|6OXoF>&AB#mR)7Y`*M0blxZpsj@W+oEgpTC7`CAQ8{o4in(+WhzU5t8e)P1bQZ<>
zB7c4~Es_S-%h4YKS-4q>D{|UaD{@A;-{m2v#(9_{>@u|W)`5<|BHvIvOCGR+@8|{9
ziEx1XIp)art*X715y}^>s^7mpEUS4qrJC#u&HPZSW&qQD`O&~6|H^ghGC3B=m_l*g
z%!(CKA<m^&%M*C=7~J6Ni5r*H-au{Fbj}mlFZ#l}`Z(%??8?2!rTL%1(ml51HPLDG
zigodU*Kn;;+|Qx<wzE8zmS?hVEDW;_R(u;W|3v2pSrKSH%({`klxn{3#k22xr=+{R
z7w+~P_W@0_+aqE8TeZE%J;w!YHmp30Y%2ujfy|r8p-$5(-$evDP6lz9?a}BX1e+Qy
z+-&5K8)puDBMb1^MXZg7J)DEAj1;2W5kilWW5ag6Cs0E>SK&D>FZ!c|>^9zE>z@uT
zLhn|!IByFJFzOQlO3v^g1CSy^K+U-!(rpg4Gy|Ez^GHNy@$_8sdI&c>P>HG$2>X^1
zEZ|e0GmF0qHFocOepCGE5H|<4v?Nq)R?7+&z#*yPSv0~DdBh^ppFfPoPFCNLWhk?E
z)j@mhT^&IHOUt@ya&OuMP>iU2t?Dz-!zkty-nQ_3X#qLogVU{ygTWJVPYD6pR=Aj|
zyJ`R?2rNzKoCPysbv!H$cb)W{#g{}2tgeSOPxoSbMy>FH@|?x!*|DW=Fh8v2M@1oT
zJc(%Uv5E+{=dy5R=@l041o7MqTMDP$N$isK?wDQh5)D@K0kx1deeObrt*~`2Z>hNV
z%`qtFgi(1*Fx9OlD~^Vxv=x_e*aSMV%|glo(-1>0ZAWs&ibHXx&EWVv5$%gWF?wiW
zL{@w;{p6G-1E68<*pliV6RgBI%ccO!-B+~laCHm_<|JZ<3K6`Ona6_$WN&TEqzsOz
z&LJ`ll#e_9yZ4IUr*sCQ?<kxewO^_Ob?WZWScEX>+9XAUdwbnFR+r=S#>cwHQ>cuR
z&_=%J&Oa2d8@kyHm3uM|BHU*iC$Yx>q7*;j?6U`MjFAuYND-nlpoC8@^Hk9Fp|<Zt
z70)lwHrhBYQWTKS5G@=5uYA%kG`+4|x-YK+N#?ZaIIoP!7y<upxf0g^r*M4785VPo
zVvlC>a!JKMi|M#L{J|OST5pLecCDYnoHj`z`ZCRA^e&<zr+aXOp?5PZ+&nSNj1MzZ
z+-*La+asX&o;cW3%;@YWPjcp9Qz>noR#Qfp+pbEg$eyO)fvh<T^X>H`b7n18ICA1#
zgEJu$`h4T@OG9~?Q3MgV-ghXSpH#QNh`%XEmP7kHO-Hb!L|W;Efrzt7eFMZeGt&nl
z47fIF(XB1l0~!L(qV&K;rxAe$fGg<beNQaL`^IW)xS3#5@jr1Ak#eo>!w2Du*g#zt
zGAR@Se7KKOP%V{{bA7|)xu->^1~=y|cUG4m`}7lTx=(KC|4rLO`KNEP!+0dK^VIzm
zOEySVu#3>L!!&_}x6=az>_b-&Y)vSMB`&k??&+@oYZH?qn4PV%^;d*`v?Hej4Evl+
zjW9mq<AO&Rj$qbN5VDnEYoXILuJ|F)dfqIl2z9fm=rtR#0W%3QhJ|bSP~CRrV0?pd
zcvnRZSgzk1w^<2vU~v}D`<#tRjv#X!|DHX<JUqQjQ(k0be_CnmJp72vh1LevR((&R
zdkIo=t$$DHE4AfZz4@f=7%_xh_RE9NS(8l1VS(NGiB4>UHfsI7c<x{oSnPCFC$NT9
z#bBy$1$}hgwa9u0U?TUws8}g=&i{;|e=vSYa|j_aL8vYJ#t`l(YO019;UQWfvVm%_
zM>OR3aSQ`RkuR#rk<Muc12?C~2dzL_SZeDicZS8f+O?LDnVB&#$U~P_PfY0IcS)m6
zz?4|ytWvVmDmPu-kw*N@I#(}g-+G(!`Ku6QD(6zu@&L5FUbAKsCGsXd3?G>z<0ulr
z;Pw#%YLqEMbUy#|aj6ReC8D$ZYnaoBw}7DEOs*)yUoD-8xiIEu8G0zCa;Ehh%-CC9
zZ;N^V1c6M!aEKW0ssnZ0BF2+Mb<_KA9ndtWsn6fNM)TrqIR^UVJJxTa_VV?^1r}}r
zF(8GKp{@4ucWMZ(UdTH>U^1Ht>@poo(n+RgE2Bo+bKRM<J?D|()w%M&ig!;B2y?uB
zdWIylI&&FF0!d@ZV7RC`Rn-1uQIx?ZD_GMI)60ig+Vjk`s(PP!U5#(|5XHq-dUHy5
z51fEX^H$v$DZIby9~k)(9^iWYm>;R#%}w$E4YUs3fZ+eNF1jbp;fJBB!1_k<64&SY
zXCPk=L>$Bd=556DaryArG<9bwkd3mLc=H%pVR<P~HMA8ykLKA6mTV{k%va74mhQ5m
zqp#loJsb;NQ*$lPTyj8?$`)9CfHZZ5)BF{fwvb6pk>(~9`&niGUanSk!!5OT??}y<
z=8D?tt4%Gs2-VN+r$IvT;gby)zv|=0P`o={%i~9=qIoLhrBK9DsO;?~!#4X_Ew|+}
z7`4kT`Mmbd&8?@hi}JOXXWMB6xT@<)Oy9o;hKEzksA5cI#YEq2H&J?$B>s(w?NT+G
zw|@FK!(dsBr5~9yC!oA*WOdnycJAY{x8nC_%A0;v*`FoBNn}>4RF261Bx$%BQC^?w
zhWjl>5Z;RAd)~>@<oIU_(cm@3xNAx5z$Ucpc??C-^Sh!ugd{=;AUs}KP{{`{ocrtG
zr^LzQi+~7$i=NEab1E7Oq`jrv9aoW)c61&`>{|Tl83hD*Nv;Ut+-9$iwmc-VG2vWB
zOArC1f<H-YvdAGA&%Wf{Z=RE@J4&l6={M=w7S=#m+bH|iU)(|YYpbA>S<oIv>3akh
zWGa4FG`MX6Pn5N=4bbN4IPZSn?YmD~wCxDT8GD>fbXpn2RHIth0R7YKUM#Z?Dh-y2
zd~q#?2|j=~SpGVw7Ov+DL+LqPo`{~ukd^R|DgZm!=WYs;d)&Zzu`&TMvbg0p4)nZk
zCgOXK2``Zoj|J+9ID#)}mS7WHW%jA6Fk~~bnH5MOV}ZT9d0Dt{GkHNB%zA}EfYy+d
z)Hq3GwiPlZxdQ#Y8K1q$jq0?oR#<U8P^r`8P;~tRG2W2aIPJj9Iv&<Qgywm+=o<GX
z=pX`;JFs8!b_-oZuGeVe-s|WuO#LH%haG{OT&4f=u|#LVpvwV)rvVd#Qk#O_pa7?W
zp8LzmHJeYz%=L=c{Gs!Au_X%#$I)LUHY?D;e`C`MV#(*A-D%TR!s|tWDvCTHX0Yaq
zMZPWpoPLdLl^zM%|90f^=wjsDt{v*LZLegc&aS2d(o*z%x3m`8Q4IuWs9p4VmV+c3
z69N~lR6};~G|6C*x&Du(a|)Ae>AH2<HoI)wt}dJ1W!tuG+qP}nwr#5mf9~&`t2I~V
zO=dn3xgutaF<$7<U(w>m#<2#Z^6(+Dz~+{<;+h=qRy-1#h!L9$JaI3Q{F%iB)&Wh6
zKOpAN>qV0Ka%4RA)~r--^UNg)@rqK32G38y)mBPb8R6eJJx*rZ%M8Lk3y8Pcs%Vqt
z5O_GGr6Z0UZzeMS0%lz<ks>k2XsTWhYxvI`gMml92T`X9q~2l|BsXpI4WyEV$Xha+
z(i7}>TyQoekOH}ifg``*Oozk|Zj)N*bxOs#3uF&Lhl3*Wg(~}n5nUYpsuC?|(uG`o
z_@o#Bez9@=|N2i3%5VTq@Qb0kyv$kEHY{U*QrkS}Ia30&k*$*KDzXpid|3<9w<rEO
z2XF)KI+pqWD>!-C8f=xEP)!|pB5ucJoYN2N&~_8kcf7^#SvR*5(&Ls7BaKSXHoM{n
zQ$4fM4@X!e5p-{yF{0A7y~}yqYq9x(tj+d7VV>=4f~-S?;43PutxqeN1a$VxD%gLr
zA=qk1!1VczOl9I*c7eY`COjy$H-;p^JsogS#1DT{G_=!WMpT<pB;zcR`ZOV1@$r<y
zVOH#T)X54awOvcl-<TZ6KVhg-5AD%d6zI=b@y2~eJfa^DWk^zsF6k;#)t#qHW+c`M
zif75@k#i7{KG<AXmE!ubl0Dj7TshTSW^?>zT|V`T+rl_+;_9Dj<iByK2HBnkX`l2~
zC#sjp&MltX3|RKewVUQ$wR~EB8uE70ti4xR)Vy@o&ZX-26&M06VCnzMV;WFLNsb0M
zovvk$2Q7H^GUc&Xh@b&|(NXG4U#&}2t?yk#f&-X~p+K&Ey&>dFaX*YO)S2JBOglig
zwIO^^JRvj=s}_@;W&06CSE6=}wsB`$-^wH{(9aILdzItBnGP>z+N0DktkHOk50e70
zcxM;Y@~3|t3>h!Jj^+30)C*(4d+wW~h$)$R_i^up3y~eFqqv~Qu`rgSss>_Y6}Ldc
zEyR?F$la&i%%;PFo|JG}c$hxRGAAgXrKKy~M*e=6g{bmK-^UoL9sOCT_~>|slR8-E
zO<Ur|+Tg{}=jArBOBwy8V=~j;fg<OW7d?Ymq(K$IRHevGJHc{lWz%4<lfbJ~szF6M
zr7{>_C%>R20-yR%b%5X8u{?x>)T-TPL#tvxaC;%HUo@C}hLwz80{E6wS<Nf}QK`?K
z-1%<*AWUus%#N%lgIHxOt(QB?YvLpmUyii%8K{1J247AmE88*#;EN8N1xp9M@oo63
z-+!!70^a~dQ%&EyYih+K%x5nVX(M7=N`Rde|BZ_ZN&au(9^+<{PDb8=ffv!gu44G-
zoS&~UIjr&f`&%P}k0DLuJYfcyQG4ixrOXMG1<~!CxFyud&g24~(+s{s&`|KXYhZHy
zwy11;p|&2z`1?xLibTlX4KjL&>reDdx+`OXTe1Hm&K<j*>~yaDv<%Utw5As6I;@e9
z3M$i^W#49>8XP}iAzP{&<Ct(w#_Yk`?rkuQ$eput+d@alIsH&CjQZSs25Ljv*kv0m
z%b}!`IEz*&{ZWx;TiYcSC#J&!A20V4HkY((_a9M`Jr#+TvTL+0^&>{gj<l!W7+f;Y
zGgPROdZJuYU42Lj3mITyQekrGW;=RNXzbT_zXl=nU~Wv*N-2dg&w$`+CDEE4N<g9h
zm{*6E)BxLpt}el;J+WUNj&skD?t*B~tzBVWK3(eFn>JX9b$#q#ML1CYcUGlPa`46Q
z!cRWDkFv(&SHwn+n*@?#Rgi3ZNz0;a;U$?SVHr23JV~gem`LMp!ISq!H+@k)ZjxxN
zTV`IZAS*J*Lc!1Q8zoF-22G~JPZ?~7Iwsl|-+_FPGN8XqhJA#@M}pe4A;Lg5TNTNB
zQbxj{!Z=6WiC}g&zKuuY^rwx~T5^7*iT^z<c-&rhgOGFm4J&xuD4sM%B}Oq#21Dwh
zkP%W9(qay`6O7y%u9U;&ZIL!yVilI>(>z7~YNPRBRmJ7(4{So&8+_Gr6I}1V2wgfl
zA$S_14u-ewQ+0KvaFXy!W0Vz6F9UXb!gGp7xL*?KUq)*2mO2SxMWD)cbZFC`0ammx
z7YMXVOL!G92}~?%BV0><BFYrUwU4T^wGu2bPWVe0Mfx4~AsUWhA>$*s&0vJqEzHYq
zh3xY&XaYq9#-@IFfMCKt2K2?e$sd808Lg%nvek`OAS^~AL)yR00oY|22hPk7$l5GL
zMxP0WJR_l_ud~rho+th19(KL%V)zs!X&XWw`a3bGv(A;K2gzLSw^?pAgx$^9L4Ay&
z;Nr2+1E_e)%dQCWvQx7zjP^=+%kF+~20gGzlqgLg&D$VkS0nszXuY<l<d8<6zthdw
zdVrNs9XZNT=<Y@}_Qgh+IG(034N$1;Si}r}-|)3u!5ot#&4+0?{T^XTy@mEWb9{3w
z7-3^dYPUOt<@^+qHz}(xa(n*c8hpoOx~s3<W@e-QRg#P&=$tJ1Nbc0E1V*{cdFh&|
zkona^CFOm9&mfXc@w=R3=e`>KoZ$8?v0!P3vuQMVt0E6JQY{stRTUM4$V-J=J7I(S
z5~W_rE=4Xi+->$~wj0O1{C;X0E&B-Q^hS&opcX^0yP=OX&E_oLqwSnL_zO|d%wxz`
zMqwfpOTGN2nQ<1{z#<g`AgG=tOBgZ&R&31#m!-6lkk`NidZU5i#S$7&w8~%b-z`Pq
zQ8d5Jv_O0{7eq5oubWAj9g15pEZmC6aG-M|)$WpsH@(aEq97xzda1y1y_T-<c5Yi#
z0w>%nXs&mC_0zgXk_w{XCBJS<lm0T6m>G&l{lHPdZ~VcC8&B~d%be@NANGxEn+!pq
zSoVg#{`y>vY6Al(KXI8!uCGVkOr4z$_kMd8R=|g64+$toQBHX5q49^-7j`(vA8oQa
z2Q#;rdYzb6f&yX!Qkad{OXx)~ZLmBjm9zmo&q=zu;;N)g5vLL1(}a@Pvl-h5G{pJr
zR?)xn&$AgSY;1qj<Ww<S$}KG3Fw5w(EfV@@e~QZ(DT161dy{CN9>^f#&FYB`c?)x%
zRH65fnP-&wuH}LKQ-PNlAmZKXJ)iSLjaxns-cdd^KM7C&4L0OWnl;&KwUYbXU%yNa
zGZ>rd(EtYYTrx~?+D-3TYEQ=LMNLN$ETOPDBWVkPSV30c^~wN)&n17)V=ZR#Bnjg%
z@aktuKWrTFMapOa?GYS8fmtvG)<w#+6Uc=QJQXLpOVSfld3eJuUB^V$fh>~ouBMYr
z`RhQ^48VL;da2D&pvjsqIApa2V;8&bsOp^_wl1R#dc7f92Gn28jBEFblQ#;qT1+w8
zso0!!f>;{T&Ajlozf=dBZE9Q|!%!N6fA%?14!~R(19NyN0`dLSM6XN8ow61Rg09JT
zVx5{U7hoIPRf`OJ5w8{wBz8@+dgFUS)%87MCQX$BmDU;t1LYfW3$}eTfJS{7kFvB7
zovb1yY6PnfEMjM${9P)-c(OX4{uFj;$tQ2#GmTuOIrfl_AU=VLV?27o_I*(6gHjyC
zbNGmQGDu#fE3JVMGl4z6vq@J^U1o)~yvdgP8M}LV5<dRfJukYsmVBf&?Q~$?-iXqo
zM|v6s*j5Fh2I?5#;}pMt>L<yXq?b6Kfa%LSfGyS4{3d{Cmf}N|G=md4dEtmgOdrT#
zNtt=%MeLgK4S@Ir;QO8awRRvd`O(8a$4lc25ih2@&uD)ywHKbaL)NEl9m>adv&kTT
zjF=YkX3>6m^gO(ivF`e@&%m0kH760@=o<nD?^~@lfT%#MHCy^ynM$WR7o>C}OFeo~
zLmsgpmSi7R^fmEb3UV*ntLkMW)EvKZ7c51BEG9Wk>rgTZNja9Kj?<m0j9b0)!;rE<
zCc0J_w452)7%^Z^mj|pD#Fsx^yZ3`p$&y7PM!$DSVK8U>@_mzSu+pLgU7t>|LqbkQ
z=a_)ob=!Ybg6YX8Ddf6_)}BrG1uJw9tXbtas~DoZs)5N=v2JJM9y1x?roXS27OvA5
z0(PIakZ}SpgR9H44!WQ)dx6JsJ$!+ptF_%{_JpnO^?&(62k4SD|I;ORDrs(zZT%P!
zR=2?7ON|f+{2A9fC#m-qt~X}zjwYgv%~$Db#;7Zv#wCc{Y?jMkN6kaY1Kta2KoQZ8
zG_WFkbO_GbT}EZnk1c3-jU%4Doh|esCbb#vkH`Xo2V&`b`y!J^6;d?zou)@c^~fB4
zy>dc{k^GRWUMJ(p4%$4Fb7908>Rwam9%7U<NSK=6yb^gvX(SZ`Q63j9`r&kW5(7c4
z)yNz!1lu`R0tY^d+&UnrS)Da~iq~krk1J#8EKzGIO_GWxw>p5M=6Sy(i~EohNb=k<
zbN|R!Hg7?|zHiR<!OBE!&&c#txs{*gQCxRbLEVcjQ<-3ph%dop&?%qWx5{$XHR6Na
zhB{#LH_3<$Fv-UT&Ym>@mnC=xVDms&fsB%uz2{gl_<lo=63{x|gY^`SpC^!T{W+IV
zIjhGDSGH^U)%8fCm@geOgt8u;J92CL<YD~zU2p{#2hhC`z7=D^=K%WUJhGg4Y~TWY
zQ%vQ*<x*NDm<{9FYppErdCpwOwavf5uo%a_r5v>m4gO6mm@5AY&pM9nxau7WA~MCi
zaInO^n7T)s<RUPP@P_i4vHqj{XT!exW*fOj<XynfaK-_^Z{1r0k}nginV_M5!TpLT
zG$2~t@~pFV<SF}u<*df3J<2Y->Ul?CEaE*|NsEA~X5`PF-I4RPKM*0~f`IAB7mS_`
zc=^YhW9fN{+n#WGN%bb;v6u3hw>X_!_HAAk@9m<(`y?5PFO!qe`8$_szwvOW|CbS1
z6R)&SX_Tl5g5b+l0P_MoJ{Tp5!s6r7rD+LAmIRpa-b;CkX$f1_m@WvX^0DS1p(i_X
zA6S7r&Mm_-Bx63xrHjMvS{41=)Bsaaxw?3d1F5`3BR4|9fXz9uvxU3GZJmX+LL>Yn
zWRtlqnIrR;>yr-vazhFQ*x%_$TA>5P%Ga|G%!M}rkaZ*o&B1Y`1V1y?%k4o=S4e+<
z^&lCR7UpmxFtMt-F)Ld4JTLDH!^wWW!$mTx@2{UN`MKa===TibCJX3Nz>e9U=*d(w
zZBJN6(FpR$PBX1)ns+Xx69Q|5PQ#3m@fp_gm5Z2BjNf7Dkzga`dBZ8V{iWyw1m?P}
zcLMppcyGliJN~)JE{?%<ut1pPD~QbsVKu`a4pfMYie5akB0Fe54Vsy<TndWCD7=?i
zH{tpV$)CXMfO~2hkd4Z(!I;w+tVVrHLsLIPBIKPK7BN|EwgfBGQF`Foj?N^hsLPzf
zYNl=TTSiGj1aM|kZLL*+diKTM<qqCWaA@hbW6AS9bgE)j{f6?ut5A`~jjK>mhKnN|
zce=Fhrxg5hxBf>;z$uBkDO5GTdZcu~*G{LrT+G|#S#)H;RM`*dIQ>IWpga$-wF6q$
z|1U)70~oat(3B{BoTMLiDS|9hmLZRj|K(2VGfe^A0TTfh^r9YuH0F3=IFpcYRi5@Q
zzRMzXhZnuE7C*qMX<WHqX12Dc6vUrTyogatua9o7US6+{d&d7jll}as>)zzoa;w$C
z&pX>kk1?LBq9CFdR5cUA1lsZ3XDAo(y-fZ)vt;&MfLjK8c*(GqyTYNsU)6^$h&rsi
z$|HaC)&kKmakj35t+t$)z8t8$$W68O*_>12JPI4lZGPTy&R5m`yeRf|Z?`0SgO_c7
z!uO;}8T?@9{?dJB(D71kn8m_GEtBY&0i<^$g1yU@;zGN@!a%~@EosE_d*a2-+oF9H
zI?egYub)p<)Gl8aAwJpGw|1~u#}{zRJ7TYYXz3i}W?r#T<90L+j^R=3cd_x>%{#~P
zjIj=BV%@MRvs78)d@>cT>xaB!^3noP8dDTmuSQsi6En|YfPvf3lB_=W9r;{SZiFCV
z1p$Tm3<-~tdqu~VT4wbOuA!nQdMc*Nzo3r6YF4JmwWz*ORI91Ko6dV8q_)<os7_p~
zqO*ifa}`OeN^xgiNDsoF4=@fx@DDF(&+aXjbMM<;;T^OXs2RQ1!Ucqz9<~^W8L3mp
zgKWZ}&ekBD)F=>#GgkOCAd=^#&#Z~zc<I7jlxP<V)%=mr$SD>oS<7dQ<oVHIWy!0u
z$ra>bN^>?L7yJuZ);YT;m-_W14ZpeseBr}?|Nc{p??#qE#ZD?^_ahE}xJ`kgaGh5!
zugVm;9U}T}Cs38DHfMktZ`VIl^{vTtiB{#(DoZeEp|`Le(s@r)l|oEYjQNLdecMeS
zUT_li&Z)UWZs^HSj<%3(G&~K1{+|if3V?2$ZPjK%cmifP1AO}7js=K<9s&e#L)3^$
z_Pu;ZHY*)=f)%V8`Kf6IA-(lr-u)syGUZV>fLeG4-c1PF5_D>rclzFZqs0w#O<K%~
zj#g%*i=bVbiSBQ*ql=j8aSX=~fB?*+4{0am>v6h{p~2AdCf743XnfJ5od=hrPs(Mx
zdjupIxNS=*CcGTJ`i(KO%OVVf*<WGNDCg(o9>c@vM8SNaQzyKy+y>Is5~Tq~0i8$f
zqZ}ZmoSmtZ+wHoRTlq$Ec0295G?|K)29ldcKGjuX+V;H}jai+OSh$9&el<-)n6`o7
zA3-%u;D}A<S6X76&*Na(!l%Rh{F3Wmoch#Cl2eKbwdbYKfvvD5lw|g4lsW0(Jv?4y
zS!9}4o@|5oTY<D<)+gcyvoTza<?PffKLP^Zls!K2t6=f{MRHW0I_c&!mM)8-@2e?k
z(+MkAx)U>JPzHc$PM4oI^o`5oYsAL}jH|abZ-llsn)72YIV1L<OKGX`9ZARMnfilc
zEW22W_2ft)uS>O_*a1Y=*+1;A;QD*qhFxoMq04AC%7_5AGuEDn#U6!l{iWG%aP8zG
zbO4<!lVH;YG0uu(kw(;gzSOU3YaI90PEZZuV$HkuN#Y?t2KaAy8BHW^UH&8M=(Hc-
zTw8J8BkQeB-+@cci$upd%(@%Eol}aZ@JdSyc6s+H0!}KRpqUTKLPZ#y4=NmvP~_Jn
z1nEW6Jy&KaR|KiRTzizBnCLgod-iw_$A{*7wg{bwJx3u;^_Qvfpdg8swIU-T9z9fv
zS^Y;)f9NDXX$tEvG8a?_eMAtud;V|z1X}Blx-t!r&Q*4AE50i9m3F@##hs}`S9S6T
z@U*_~3<r-}DEAFb@v+!O7H)(8_FGb<{ouE~f8Ohd^l>uj_e6>%0R%Mb;!Qy2#djhU
zc5xM1{$ByqBVejz6c2$y1?M=(AQhNCPo^V%l?S5afRs+uBO<u+D5c(U)W)u<ybWon
z(;!|ZDd*Z)rqDp78A{`7qibPdjzL*{nN^HR7SqPe-4a4uRo;Q-(M$A4cJ#gK2#Pjh
zaH?>MwJBMNLHCz@*3MfK?<kjrqww7W6PueN=<K1WCU7VY`z;v3Ehc0ev=7c0P2ezG
zi8ioN>!gAF{1$X*SKl<<?gPw{_RNVJGgK-diMEut{H0u@06n6sn3O-*O9xOG1Aup^
z34bNGXU>&w9pjI)*ebiPv?@~YeG}IGI}yvaOH5TXl`!#M5z^*mOG5eKDV5INqSX7E
zG{H$1(r*vQ0ad~(J3i%Qs%SaeoY4`}@lEG@ah#pXDXmo4PHmv+^T!Gj(yeIJ`1%>0
zF;ZvD82<1>o;P+;+p~GjJEu*faHVfWaS6lY^g*4x2B}D1CSY#%p#M9+$J(NG&Kh1g
z-=`xkWa@IC@(+7|Oi<Y`qjzs-!Hknp!6?rRM!|7a1Ix3bw6<sV=eM3e(SEL@JilC9
zmD=%VdSMD`ru2YuGxhz^A#gBr@jgoD9wby|B=~obv@WZ9w>9)U@OZLR@@#kpntFVA
zK?-W6`2EMWsCy(T_eG8|s!^`-5-8My*E-m`iXtYTFT|M+tk4VW9jBl|9ADl9Hzl&>
z`7p%q@rLTp5~1Z&ErYyaXdhp{QQ(8mz3SLUUvjU)n{k{!{Ok|V;I(9E)v_}Rtaa9P
z*23!>K?<js+nHHWu^FGglz90q2>EvH7ahG+09+(GtN6xLU}sbgzC5S>RhIL0`0fYu
zD5iQIT*I<86CtMhPNoqog_lFXLKGcBpVEy?fp+|hfn4{P4kP=>)6c}ue4G_Fv)!?x
z?ZD62Lj2x0?#2-#lvbJdK+MHp+<l(vmp#e9idL4KTuE{M#QQ44Hb+jD8AftE)>pk#
zvyzQQikCfTo^7u5@|&xTz}O*b*|m1Watt3{77>e5qVAj@eTjzE3ThW+4bDEP@QO6O
zQly!M1I?4_w+#=PHB0mR>JKx_fpAT)ScR7M)()I(db%FeW{Jnd3%I3bx8VcMjw$F1
zjUj_Cg3BT8ncuW4t<DoNGYk~B7{cZEvYHxQY{b?bRqB4Ok7~3@IQf1;E$OWtPqHa`
zoZs4M%~u)qjFzI@{8P0*gi{vau5{a&?X6u?4Bu~B+e%3leP>YpDDU9TbcFasX(;u<
zgx#u3&1Ln)oXq}Ck?YdgOUiPLp+nTl!%}r>6pv1VRVe6Ub((MnmhCz4T9~TWIlu`J
zHEPDS&mZ0{v4b_f{x<;F2?8K9<=?`cQ{s>Bl?=J@p~~GaJrR~dRI|Up$y_{77b9!g
z0#|d@os&1rS56g|<ee6!9WiU~s4BQ93~PKP9T02rOd+^&u$+Tzco_-GmTgE}8h-|_
z6B7C8<s`MnCKksyq$WhwPD>t|JiQgpR^lR(OP&2%7p7B7jfKaR*HoKF*9}AAh-=s4
zeT^!7ufwu84n^0(GnAFWVoi}6HbZlTNXxjMv4a|3{belouthI)X~cyf-2?(H_GtZl
ztF@q1BbMR3-C(vLm9DE6E{7FDMb1+mj(xc(x%BUV$~U`vD16t&sT<?Y1TlY87A*!X
zt^Ob<tOTG)X=4=?3pm$YR0ydaF2#IxA1>uk)te(@b2US9i=H`7Wp6YK4Y^v_O0dF~
z&tgM|Cdo)}pA}UD;L7a(gH-n<5dHxWRa=TstJXd`VB;W3DnE}7lZ$u>xUpT-mNpFj
ziBJf$UpG;h7-+)PbuGb#H54RTL)nIxzYJ}$Bn08<TK-o$NhyJ&ES_eUTxjXHaYL0i
z%)m(7&8a5CiFSiS;_s+jaS|Np5xB8eyn=slc)8n#-@raC0%_ze_SHWVF#ag#DHFK6
zK&cdVP|m&X^2Bq=8T!}Q9u!4_Xp3YKo=yz8q0dfZMycoXU!%!SkGUO#6_ub`ksLm=
z`n7D8&+=%iI3N`A`5-G^sGDhGQMHu~{F^m3TKk5x;{f`13b$EE;9mwCa{XPa{0KJK
z&1i*PvJXRt-GXP=<{470K;Vfm9h&fM&L5ZZcd6kWD4hFO24d*765%wY_nI)NZVhM)
zlH?!;F_#VWmhh*Y3q%`AAix2e(AEKPR=fbfk+W6P!ml8rbJWHm`^>>n)s{BsAm4J#
z_`A@8xpfv<rM0EM6Efzv&w0J8A~MuIsYnbjacJ_kj4MI}4g=buzq*i<I@B^ylPtsn
zPq8b-1C*xc>Yew`CBFG1mkYLfdg8Y|z39w5PVv{f1qeHF_b7~Bzfsq>+3%EBa~i!#
zbfMU}d9$x^xmAQKXm|MMW`D<Z!Yvu^F{ArV9y(jNZk8wFTe@--jxWmPU&(fMj_`zK
zRR=Zff(VLF!y0oamr@A6W%~k5MOeF^G{@n-k59EpyPulSQ77HW)!#K$7x)Bo;b$<<
zuEwfUp3+OZ@lEJXe~U<ENj95?DlS5O>6P5(Z+$1aht05`Srjr|`9|iWuybet75=v~
zxdQ9;KX|W#z&HsU^Y^V5`7~8)#646aYi(5GZ}?Ap04yCTfD!2vrK;@hCpLS0JPC;6
zn18OW$l}_jlg|6VjOJtpgC?Rvx8D{onb^|$_c8;j|Ge*XOa&IX$}xx16rv9(Z~jRs
zwaQtaVdVhF>zY)3#&;Bc4|;4hTD~y+Zq2+ZmvC{zc(>VZYv5_DB8)idUI0-*u{b=I
zS>JUG1fHmwAbc3Y74BX<!j$e%FcdgGi*MzbL*t!K7(J(yf!Q1~x2F58AO-HX=rdl$
zQBggs?QrD&tO6NDG})tJ8b#?Jt4cw`@lULZBi_^ei6j=?BV_(@d)0IBTr2%N$laa&
zL^?RFLD$cz3NnIVo`rRj<vEG|WYza!iTyg;6(@>5{EG|Lrae@$dJz#CTww5A%5WO^
zYEXhoYxEW!E3ft4-OrV1q-%L}W6-Z00LidC2go;z8W|=PgE}~>i_x{?5z$orKat=-
zkBV|UfcRwXN|SHwa`1~#91V{p2tj5YGzz?ILttU%urmDa$VxNDd4FFO!gL!2VckkI
zN88wHMfz2Hp!jgS7(~iOnf`fiq1|Vj%x#@m^c3Hpm($8onH-3%ptO+&+RBX5F$YpC
z)P<eQ{|oLLh|p0O?GEbn)btI6a3?7!h)S6&lPspGD_<Hbp-z^=$=En|14#RQqYRC^
zI~GRC_VW)G`csQz&=GzN%tTQwVhes0%mdiUko+&nd8ir&eG(EW^X1&REab0X8RjwC
z9@l>m6i6yXzm0P`#6qb7RqpX=rt1I^H1&cbpOv@TZ<vJqPF{0g$GIoTf1ds+bKe0S
zv%pPc*9<Nwq5~+4w<sxkj<OJ5Wz}!S11M1$QS7%d!p|tdWLRw2vR}-SX~KQ0X_T2@
zZVVGObbze+5bf}eE<kSszWRvBEb={@RT{xy;y}+ARFa_vldLEmKP(dE@DJrE0=GmF
z44E1&(mRbol;=P%1PvkE?kLu)lW*^AJG6^&l;;Hy5)kuExzI9^{-r-Ya^13Djk*iH
zZlr$d0Gdg0_Aoh*qR{hIR^ZvndV0O}J7;HepqVJQz|0I+81vNulITlc3>2}Y;CXU3
zc)b19gD28DJ<s#+tFKh^i-#u;Ob{_<URlM|SG#tzg&hwf_!1wf(=A{^An%!u?`+g(
zmJrtWd12guK0^FN0=lQ!iR<Tq_jxg+%<{87d}_)w_?k;o2&DVP77kg4`D!c!Pt=S(
zbBFQx(`#7+PQ!`PH^G0`vWe0&&bPD^rYM(5Mf-gz#I8mlW>dFLL=N=2?5N<i%3)cs
zX>8lYC}h15F3T>?Eo<R7f34L^y`K)RqW;U!0%S@Gnfn8>FT7Z1@r|WBU_~36^p$Wu
z#nintWm2x%1=Ww1q4PvuSk=vM-ED$oed5=#nzlQP!)<HAq<mVh(o{}_*Btwn=r%tW
zfu>Pss~-At^BWDd?Dt%q#$!PV5-(hx&QTzL35~K4RhBG;^nDTcxu8GN;excnj@iIk
zK}GW=s!!W(m%tO<>6%jto@DG`9vk)qq`Kd>Gjxn1-Ms*9Q*Ehj8$!8NFv0%$-7sJ+
zkiIo#cv!m6Fb}rrvdI+XK}Sh6bU<!zFwad(E`*nZuv?Hk-jpp!R&gRycCrbr@_>}0
zEti*oUW1dDAjhBO{d{&&HE}ffKBvI;&*$>OstpEV7bqE1I~!iTKVE0QW`@Zkb1qx8
zz_*V^phF^f_Li9LZ+Z)?mwboBDCNyAGe_?dZFLdckJBRPtn?Cy31@mHC_y&5W#$eb
z)B@$db&e9O#?ueMCLgV&CVu~ypCJ~Hv4jL+hzNlxM`iGk<{7HrTW}zw1kjQpD}{LV
zFCaSp3$N7+;JJt9g+qMfwS4EjCQdnK+KVBR&?Wyt0|@MuKNopV&CfDJnsNHag$tt7
z*;oGSYjD|QH%@eO^H#KhGh$AxxSJxOt~wLMJ*x(`D#r<@q&=&8F*u{I7-Y5K*Yts0
z7jj;=uavo^Z9r{Y>O1+iDSy5z<t*4qA%(YTw@@O(9r*T{z;d!Q4P+2#?@te+PN1rn
z>CB$NtCt1x-67Ppg=o}4a4`3LE-|AIO<5o9UCYNVtg`qEQ^j4~e}z*khJj~#IHl(0
z6_L>&N1cGn86|YmGCAfojA>&u5Z99n8Bb|rED+<iPyU7!*_6H%2x+<SBA;MoYm!|y
zH#VCTo}TyS1Te$^gEFiJjETtjXE<W%LnleJ`5Z(Ift26$-;P4WEV`QT%(#tN{izY@
z28!%LTIevy`k_)|=0aEtVFu|7Zk1NzaN}HRo!e9k!G}jA#fmA7z_EaLNsz;W?)`@o
zAYHC@q=mvHx5gv&8z<A-#H-HiGvsM?=1MxN0s(F}aye3I5o)(H?j?N|8Un7rRVRFN
zl^lx^Y**^Vatq)K;S8^!nAE1tTFPg2kVxzN!-;nx(^WIp;_ST(G7MYv?4I~|Hv*Bk
zJ0)#puREAzy$L)59;K*B!t`!!v}w_3gep{%`Pm{$MW8re`yssj>t`~fl~euV50FGT
z4}~)=5U&bkyCYa2hjAil4$Y_~SfJ%s^x7;IoDb#$5v_G^GxOr2<pJ(IPZn$z4^Z$>
zcvm;{48G3*Xx2aNGPs2m&ey1>cdGAvOfOw1+nE}mRRAwZTT*bV>t|T!f#SMg(&z^y
zh(1y!|9FrJA>K6pTLI~AB!^Jo1`!<C_DWA6J-`ovqLG>rwFh|0Xm~oL2SikjPN?Y2
zM%r)BNUI?kWQ{^ZpX$nXzn_1f(hA8Pqk*6d-kfR+<to%$t_;4?jt~$fFCvng_&0fj
z;3z4)%1YH_=O`&f-2{iu#@0bfGbx?QkAL^|H@F9OJmRZ&7_VwxD)JOl;k5Hb4%NWn
z3k)Gt9<pB0#%@&Mrn!(Vyz?zi@LT3z$-31uXPk>1gL1vogG15nz%kTDED}F4KYw~;
z>YeHAs0~w7is$ajc6`!PeoY>2;1R`U0o^mZ$}<Rkpb~rRy`7Em81DVc(r-kax)f#I
zId^%lhnIkvfA`?pQ3PT|HO9!Bt1@|cCt5dC-N)z!jGI5lPp!c#J!)YCQ;!;+kuemn
z)&Lf!l1+!_J~ZGF0QBFJ$Y0kYvu@x=fZZI`RE>N88dwBc#vE;wok9p=fd4FRF&oTs
z<wZ#GuhzP;HF#~9bgfuz*qF6IIXe2x6WJYT{ANMNcxr4-W0krdh{tLD<8k3NE#mUD
zGh6K%B-4Qr!dRB4<FDGE@#bI{X4VQXYzox|!xYvrFD6J<DV0z`=nJ{LweWJ1JXerm
zm~kY^m=<}E;Wx!Eas@nm(Cl5giG`WP<~J8<fgY{S3C>;qEN5vH9Hm~6MA5zVjU1AU
z5A-rp;;+M5#Z^t6`K8*dJI`}<5Nb&*byZLCZIf_p*@x)At#k5{Q-a)b<sVhRO<N`I
z2maKHgiMB0sE(Tq^mJ{NT~SinsVQ4EC)BsOzHLpMJJjLD6pUKSEj6s(D~wt$XNgN_
zC;^>1Hpe&#S`A5A=nGc~#aAFkb9UoWOx%zTx9^DU9RB>`CIj&8uafJ@055M~UoxB)
zzUj}fM)`4_u+kN{g6JZaqwbfn5YJDz=b=oQy}N{`PlcpMJt1fx>G=|A_nH^A>_X&>
zq5fDseYfC{2OzZXV8iB)kC0=B#?>p<V@_~wYXW}PaHDtC*Z6#0i#+OwGx0gOg<!Tj
zW7=5FgRSPj>x+l8&N*cKFFNHZ4_N`f7E6z(T0al};iofssvFHHq_lfX(Le7ix)1^R
zbatxAXieLeTId$D-5(f#Zqbz%TuiSX0U2P{1Wu2~*z<1R%OFma$UlrIN5B$aTo+tW
z`tFltJ9*!DS%Dq2Ne+{mx|?_;o&@FePFv=!B$@<N4Bu*(YfM7<!meOSZnN;0B%Ej;
z56#nO_GHAI3bxir?>YZfdGTBty+=br$@;<t$lN&U#Ff(RQ>gA9`P#Y5tg3%<bk0^x
zYqQV)hdl!99tH1Y$@e$`XKclZu4mdxLbt#|WU7oNsoPI)QG$Q2^F6sP3xzn(L^{*f
zoi~2x=gF^ouhRGA=OGCwfjm@R;n5JyP|F4TH7V0DwU@Ht<rC7B#;v%s3Kw@FRb`{a
zNnjmY1#$n{YPErOktyE#at!F*YQ^cL{w8k&{Ui}Wo@V2k?JyT4P(z&2<}_Q81$}2c
zImzxg=dx-q%e1e|tb8nB<=XYfN`)Z3z;?z0&d;~**Gu?$d}F^Ur_t6Ei&3)|q!@H?
zT1xaXT~s!Z`}b%ZCSX!syB8pYc;2c*6CHKWP<E`TO?cM4FpBj9!YXPa+wQ2J=U$1j
zj$LN&WWxX=h#U`WhPS0HCL%Hd?kflN1WVJK6jz@icq=S`x$#`FJGkcmRC(VDeW3on
zGn<*Sd&%Pb4)Kq5P?x9qQs1ZA!{;`U%;fJ}krQ8`k>yjDFuy7FDvKn$hE8QWcFsl1
z2nx$8C=Uu_yLbD4;!3~)QBZ+q1scuz&&W=w$IVg`Vh7Nz3<^<*2)!$n4}!+*O!||4
zMAFv6G{=h*xpx|Iu{2dInxZ`Sz&%(d$mKe^&HK(Fb#!$eE_VUiggCDI%&|2?YquB7
zZy~eX0cSx)^Qgb(vjYeOGHQxd3L5!{1+M`p#pvuM^N{nM24uTwgz|-m1&i*uIOTD#
zLY!lX&=2ZaNZsh4_SpoywVc==TD?gRf3Uxd&ZPTV1e5dsasG`%l4F4x2QSz&%z`q7
z?qUfB8L;QIp8kYDKPZom>qP<M6A%KAkp(Z?yKfT#6o5O#>!)u5l`&0RzAH@=^N)<0
zqLgV~Njh1A#ol8K8Eg2cZ>shnOdAyee3UvivyoG$exm+E=M5ZMf7j5UfNK9kb4zv`
z1Zbg&$SwJyKnx5kT$xqZdG`d!23l*`|Ed6Mk$qKKY0ZmJ8TMQdX=;Hr5&qeXH3Cz0
zJwR0EfQ|*B(-DBXXx<;QAv1@sph66WMe$~+6${ByPqdnzCK&U%E)xZ7P4v~B8SbuM
zguO*k@HqU89~*!=k+Zc^A1*uH>gvRto4KZ9b4xiyo-Pl?6j9JXGnjX$E^!tyf#8pK
z`&rr55cm-kHpNP)ua_b9m<0YDzN+w;1;nK(q(7W@an6$E$GO>#rZ5Rll;|qRyCUxr
zPST22#`2*CLj}dSGq$P5^Pwss1oQwACoCk<-!_gxiMW}INd$fiuFRxp|8t&gMqj8W
z<Z09O&qw!lrgldb)YpxJeuqw+zO6{r9<hibR%^-TTh%9`sB~jmV06-HHq#4s;Ze&b
z0pZPc1=3)IttIW1ZZDBT@{uXUKDs)mH9U=^j5joQ#pbms18KZs_0}AlQ=TYERXn#}
zIdu!o(H+Pc(r_fS+9tRz!WAuE>!Tnqv>=r%mBUm$;J@FsCuweO?#I_ELv8cCKKKS$
z$WH-<F|CzwfoQ`xTvDGj$-U(igtvXDh!G{Cq1!#-1c+C>cm?+nMQS~kjIL1WF%4yh
zYi;%C@4~@K4ESb5imS_n2~3MzRbw`6FZJ3=4>?$M=|n9|OYY<PLM`Z}s2>BV!MfQW
zVJWZs*;A(-q0MojfA6QiKqe#~%;*HGTddq)%uc%~F!OFeVxH#1!OLdc<pT>LKF(%B
zG9=t0I4O{ojRyFJRM}#!5IhZp8$-(~#$IuugYU2rnN;KNQc*Lkdrn579hAuIVq;3k
zSV5i^Cze^i-A>?|<boU-qXmAwQk3jJjD+^x!vu}YqwWItWybttXN{hT(3RC{_2Up3
zJfnS6-D$CwE*n}SKdhyywe+Al{U+})m%5U8z;<$*Lgk_8Feg;o2FC)sDnO|bRs>hE
zg6}S@`E?+{3DYd%6w~1m7Wj|;7FS$1N!uC&pla`25WPSAkL1HH$?*?{&yV*o2_0mA
z6$uPURfL!8Cc*m*!&EF=Hpg#-?)e^O<6~2ifTw9Hq|fT5UPQSxs5*#DA+t?NE?CD<
zu7uPEB~7+e__lth?z;(1mvr@6j8>;?PE+d##GY2p2X(!&_<)0&-%}b7wZmWKpIE=?
zDVKXzr-S+00Adyd9E2Qt?i!-s0UCEXO|OVJlY^&l>ihKyD&Ur4PH_Zd7$w^Hdc^Q!
zs2K$zq|up6$3!rMmaK)8Kn_BGED6u{bD0!*v-vj|!+tXzaob>OIMmvvd+03+ve6yW
zMA1MJ8}JcH40?%HceX4LcBz8C#S56Ai3-lCl7qyZQU87v8*Y{gMO(_GjJ4cA4b$?0
zVJ4prCsgMJ_9(bJJ=x~CSHw=eQe`+I6JxdvZ@xnb&SA1>2qbN3zFi5<AUcEsOHHPI
zT^9P#Wjo;eOYr+}b%Njl1Q0J|=@_kmRx`cg#^f~A2f#lx0|#R**G2qihHl7IX!z#0
z%SQVPZNMRzWYKSc6#1z|O`_$*{JdoPx2<8}j$=Dl*x}KKyJ105&QkXsTRqu~fiknQ
zw)B0lfij+{RX`T71{kNvF;L*4)x^gYxdnJ2kzM`cfb0{L0^4}dl2xeFc`AoZ0aOa=
zJ%=Exy6Z1Jnon3tGwE$+W|9)YU?pm-ne3r3ssyJ=m>~(IEc+l+qmy7z8O2TL^?Nt`
z^*0e0{vW*cHp>#;`h$Tsvl1;gd({l8!fiMEFIHt3apSpkm+t;hov|gCKt$4e={LrG
z9+0j+%!|JrLgU5A8|>2zSOy%&3sBcb7Xk5@Dh3=>^JglfXAb61!W9KKM_?r4K}$n*
zUIFvt)(*mBYfS92j3=nV^s<}D1%erRM`7bRjYz-XPG5`plm372KH)$Q(6-tp<Ivzp
z1r?b4GccB<#LLsJ;-^`_92#&4(+cB9fM{GVJa%RQ>jSeNX<sQAlKX+$)E4y)f`d*^
zT#p#+9_ly&;uaQFO?&4_LHgIQ%SecJocY#HZfPlbr$q!Fx+WHByKETp;fCD6sZfnQ
zKt&%xJ$KPT^>hA5v*V!ZC`L{~dPw)n7iis_%g}MrSsT-jvrkpo11=ca8%q^^>ozGd
zQ9P>X?aTQ6_=q%*6xnHuI~j21iITGW2Kus7^1*V1Wtgw-c_8zJO_?4730Oam4BSB4
zA*zIAzp^8$hh;CB3L_{O_^0)+q&&!!0mD4$(<#D=Vz3GN^H(Y6ltY)j)RE?71^s5b
zm9%o8l^Xzg{%LCD2Mzu~ANwiIeh%VB{j6bS@LeObi3|~%;cywDd&G9});CSN-7yMf
z;-ELMjbkX-S&y_j0QfRbxB)J>H!0bSwoO3%4*_g$qlA2(D==7C2?D|i>oD!9vm^dV
zS0ZNpDOyb)m*-WyHiQS(A7G3wnC9d)ZKkb{Of|D97If0nHM>eOoOjLU0O_UoCNUDx
zRC`N$<GfAhn=IvAn^nHxtbd%P{M$92S&v=(@y*u-;P-O@cB!nlAT(!k%*Xb5XN2sk
zD9;Gbh%qx*e{CLG;s!7SORQt#kI8Le?>QCt8>;4g0yn)3`gN$dAG6<<mS^uQ`297O
zX773+Qp)itJseN1qnT<NR#a&F97?ztF8}>io^Ksd@29!YI<x#(G4t-F2sIY+KtMa#
z;YBT+cR98_V)LV`0s9lIzosOCR`<IOX0UEJIc_k;{p(!iGR2>YlWp^SiTMt(RO=jd
z?)>3MNLvnxrcB-%2JQ2`=z}%qgwyma#edhnYXB}guJziC>shusP`S-7nBxJpVer~K
z(zbFB-GjzP{&H}w{a6hyh|x(JzCGZ|*ZAwqF3N#sA3jeK?6Iyt1q(CcnTI!fY*S1s
z3U=6|e=#;*jSh7*{PR)YPV7&RJu#yD=D+Rxcg(#jm47*LtDT3BU||S*E?xk<*DscG
zu;6(nz(rOY8m72#bZVzCl`(JZEEi}VSdP+A^;$L3rcV%rOX86ITg8XOpOYG_0~i7&
zjablLMbF59*uRt9dSb%yEh0Y8`Mt*=UEvGoy5f>Rx1LX^*jBUb)yJ=bZNs=rJQMVK
zq*f`jvkCNNq}B?gY3Z2$9th^0{Tnqghv*qlsik(>%bQ^&k^4wmgV_u=bKIMHQz>Qv
zK86-qgy=TAL}0>fI{k_q4q>~n<s&7(j1k-&JkAr&aA<gx3~kf_Dttt*Dv-)5We*=}
zp3rCoBjq9_cjZDE1%mNMUp+M_SX^H<Tvr<vF9>iJ;uUnh32jb%uHZ6{e*AO*KM7xd
zg|b8C?bGM+6-*3(o%BZ<0m0?0x8B=M!t>3gPz#uGY>*TOR@(Op>;VMx6ZuJV_!-S(
zP#PLsGFOp9*?nZJrEfkJ=_1W9@QG=4mOFcZt&fiYYdyr6+0l{#wFPH0f5rwp+o42X
zllK*u`<LX{X^cIZ6WpS)U~7O)Q*6w*xFJN117&R@CtSbxK^h*C2(E}-;i@Fwejp^%
z5=4dE0d(L2D=;A!_s=Eaih`#yVUCK(zCxCQXX4P~4kTe-h{it%MlB%D9w0bhAjWAJ
zLDDil(6o@IWF1^oH{+|<+v5cdYni?5`a)m|R`P{0?G+J2anPG;Ci|Z`&VA=hOSAmj
zvlz}`?&oefAdb~b=Lr0*S%}_CQUI0?oL_1befWG<)-ROd1AX{n7F*j*U@OO|BX~J?
zkTrGjI$&9M;k?C!_arcCG>Cd4YV=cm#Bkw+J^lWz;7ZGp5FnNGD#lQc2efH@tESQ}
zFn9$e@8g@`9_!QZ&B9Xyw1P77tQ(}e7ER}~ORkQLvM<Pa{yLY+xLg-6riH-BiY_!S
zro}`g${B(msC_)InB(DYIh($19bx`Fo*MzKt_RgBNH(RPE;|#VJ~fdmHuA(7bHgaE
zR27v4qy^ARhC+!30bwO7zj=_#3E5zL&8vs=yY@h4{E2uDMwus%zP+FJpzjUELOqFj
zyqV?2fbN0*o`iQ$YjkHBVZI`;JRMjhbdX#8uT+q!V6s;y3YQuMh)@zQrn@6=VeeYL
z-FL|0VC7A`pe6>&;sz4eAEIE$c3SR?5;%<9JHk3hHMY<e=S-<}l)I|QQ^sRCKV*Do
zBLxI*v_IP=`IbzXV}K5TM|Q}B&vkRQ!DJ-vu9}`GW^F*o@$Rph)<9(XhURqrfYR=Y
zuiza1gL}P^jTsqy{={BOkf>LufbJj?`a?C9H*Myd*>xKG`C{DOKpKk!&o_<2ovip8
z`-O@+#WxR%OlnF`wX;Y_h#K;+Jp*wpIo;3cmX?s~Ejt}9fraXH_^B>tWw^8Ff^jan
z1o^llBAh;wm$qMTGTinbSjjG9Np?T%*|(HvOx4u0SSB_eNs<L67RL`^f{U0cLFZ4b
z#tmm-YGFmt>WW~nq;0#40E@sbD?3b;r|>6!<c(I3!&#UUYdErtfdp3+Lz~McV&iCZ
zD4c1(zDJ)=A~+S==VC&2GkI%UmG*n{;}m1#J!!c4x6eYV#R8H%R|st3kx2{kW17h$
z0uls?u^0Zb;6jt$TNz21PP_WiV@FiaR||eNx~!XC=EFbL%Z)`>bNIPQ2&vmxc@y0>
z65U1y^h_N$8CraG@IHP<5o`!vr)fl2^nyC^l!TxqxsJ1@CMHnN-X<ubCB1hGg2>zg
zKpj$m{-ghywg*U{@ZC4&rFf<lwPK1+pZ+`(C`0G|kvq3Rw>rgX7E~F@oapu`a1*yk
zo<9eKi;~+;*;pt1T~Sn5Jm($B?TQUbFJc?(G%`oHm{1}AlT!}ON6f$P0Rrzwf?p`M
zd~pI7o9ZnU+SDS0mzouD2txNS2@?uwWY3`!KwD!f5P^Bi4(@1rEB0AahVDz^UIBjG
z(TNfH2amaoP-Ps~62mI@BOKRd$O`JO*76@BJN!=^#vftd<iEG93lP6#lX@TngZ)BK
zAz-fq`-KGuQ{gZox->iaDY5wHa1r2!TIU#aq9eF?XmsG&pfs3FDef(x>Q5y)WxH?!
zxOj%dupyjlNBm>5(Q88tCQiTime;}pRV6y{yK!)FTuyZ0pPM%8%1GkHX)Ahm0LIt<
zv=XAVM){q4|1Aq}A(YJfb^73<>xb-ry&6prR@}$h?^u_~@5WJq|Dpt%H%BYxN7@3O
zPN3}4r{}z4CslM~!@Nj6wSb`HUB4#}E69Psf8|ONDXT}>K2`XJeX?wH3N{vJT-BJ1
zi{|DkIPoHerZgKJkwa3@_b$N2l|+cUw2_(q&>{=Y_oI_^h(|L4v5{IZCeIT`{ac*t
zu*8I!LWwXX>77!RaqS+!Eu4swQno^qubG}yC;IhW_N`#zC7i@9Mz69uXEd0RO^jK=
zB57)f$$7@EVmf*pZar6V<9Lt8*snLMtkB4J%tOEnUb72!NradKa>(4iPgS;_6JFNG
zZyTNgEtahtUQk~*i><zeT&QD9MQ~-#$~BSo6hdw}PUW~Dl-T*O;`3jo4S+PIHSP!c
zUmSk(vv#q9RfAtJNzT}7HFYz10s;pYpWs4td5-aDfP|Cl^&cd@*?_tY*X`^&!YO_E
z=XNJd91S69tl47t^c-Ok8VTs&eW&|LXfiY4h?w5e3A8-q!NHTdQz@(07s;uJ>nLFb
zm`xK;;ue;V?HP!VlC2<X<%2}=J;(YA?q?%a4^7oz{N?=$M!kF4XF7%MzE+j4N<VK8
zvKjwaJyge|ML|-nK5|t}1Nn8|wIgLh*i5V_TkRHCdu|uvO%~2w2hNtb>tr`h6Aku;
z?gtjUNP%`@li}atO%Zw%6B16RVxo9Pj7G+DzT}GG13tb>&U3yYC#U!B_D87O=-7vU
zJ;Q2^ZB`0;e=SPNj+XS!Y*oql`s5y(ARE!dJ*%Q}z~;#dwSfH9Ez*DG)a(cHficD|
z?ENneI7lBWM5o*`l?~tw7Br|Yb)h}~e#@643<&tbOLIfULAeCJxS;r8`6=&R%dyOb
z;6H8YeEU&Lep$kQ%TjUuR~MLZpI|9nhK@&hKxW&jKyg5Zj(4_=VL?Y`E34{|S9USu
znOSi$?&(=hjq$E(a$8M|?=bFJnIvec<X+fF_sAuK^py8RW-DP_3~_N2_~>^5`PuWY
zWk}JQP(Gs)t&`S|0tR>~o4ZqHYy4G__iXK%3f1Mo^INixREqmMMa8<jh(AT;+E}u!
zsqe@_Vv%l6mX^Jp`e@c+obSj8g*%+0aZzt(oYV;<jg?7mNg#R-T2CqC??D_;@b_PY
zogjM#7J98%+kqm%_R>YrVru0hx)>-`m^=i1^^-B&g<ZOkx@GXWn---(B_fFSX1e=t
z_W<InAel!?#^eZ6okxCQ-BaLYL^r=4e!x6#5FvsRX(dIx4g0tIN8m%Eikr;^G=}k6
ztuIkVdKm1gU+x=WEfUX{Se8dmegYMF4t)(5rC2l-R3R*eJ*OKNG<EFW^l*OjtyN|J
zEZFznwp`8WCuQuOg2Q-t^)5+ve?!SD8ZpztRQ`VNDe+#2to*(ve<+o}N$N(~-};W5
z>xV54xEO46&n2L?4z~P)h4x=>pDumgKtuead|qF24+;mRo!*C}Za6$l6=_638!lQ}
zctXJ=Yo{RopbeOwD34_<7`Xj<3{aFA<rjDj6Xy?Dlv&x=I2#P3!O<t`J$R<E>%MVg
zuy(nulPYBmWoT!3jS`qtc#UsC*h`YG!VtnoqQZRyu?COGF#h8#e8iiM;BRD41VI8`
zP}Zcz7@U!rWJAbL^D<L>wy1k-J!JOeUWd?uZa}%8{99s~rFRDxOh)IwzeK?N7O4gE
zuXqErO=c~`<C5!ORUBE(Ev<SPi!&r{{l8{`^bQt0!}GW%x`$N!9}xS%jAhpUVmdkz
zZ4I@eN>9xP+g<A^u)*waFqcJfzvuPyotL~Gc(=k(`z?@IXr<t9CqlsHMNc-&JBKAn
zwr3!%`L4`m^@!$!RQPTDdBR_w6Qr$qV*6%TEK~Zp=`%e;bMt!+<j%`VzNFyEC1Rpc
z$OGpGZ8ZAV0#wyy2RjQ^0VZXmPs-R&2e#i9-`Agel+<S$dIP24jG(mHEH5eKQ+6{Y
z;#w%`Clz&(k+`%Ax%TL1m4NdC@z^W<>jbe=7fDB)(HAOKI!GPrkpS8|?IK8F`)^P~
z_up8x6d`DZ5oUc8g$7Y@N>7v~9|dUV2GL5FIw$20_QCzq4?7n!Nq}bOPTI^*^1r||
zp$^L-rvA)Ql_J`{rx#5rIXY2gtk9zpY%8x67!>2G^hDW%7Ni|0p#n#B(>%kD%5MQB
zhvv#zHl+vJIy@@q!Y<*_2Kyf)Ij<=RKXY}C6axibC)&|nZhVJm5<H~Ek&=7Ou1jRh
zZu=G9iPo-0@(Ws0=J&%YPRoJ|m_@UE)5f^}<LMovE9;`A;n=p-vDvZJadP60ZQHgx
z#);FhZQJVDPRB+kdCzn2cfVh&_8#ZY8DsCg)~s2xidMrxbnbL>`F2UO!+ND=27;wy
zf!N$K1Q=?~S_AJ>Scxvd$s8{f&Z9<YmuYhVCgoSB0bEqoBe0SGIou}+f)>FBR2I!6
zi>kDEDKdilvutVhO8*v=F@FxJn=k_@nFNn3L}A*eN|Jw<_)N=%%v0|*`hRMK&f?XT
z;hZbJ<oqn7*=xk1e{}z_4%E7t07I9ML?l5*JK*IwjQ6n!)WShRBUekgE|s4JPF!Ui
zL$n{zFM*=hjxLaX(L#Zw5>#mD&R;Pf>X=e01HFObQaB}6`UhW50OL592ziy<3V5aJ
zlH8f{`0SoN_p5P+gbiMmlTF2XCz|tkax5bv*||9}A(|qB2^E8p@>Oq@SX#vGDK5jm
zu1HX$)4|*>$QhBOQi75;u41mFc(yP+$g<%RytW^th5Rr)_OTecz($N}hX<HJg3B_}
zWLY=63Xz#pQ$YEG8XI*gnMKNUl&q?m4FLY|U}7A@z)i`(?@pcO4XKA7Y7BTv_)-xs
zH1P2)JX6hc0fCJ^-BC&h5GG9%S|Z10UH+S(+etQ&ZAu(_`;FqkRn^1U=ud8kqm<Is
zWLCM{UrPA5+X7}MgR~On-@5xzzK^c3dS-YmhmKM*Qv`gm%2BWfa<eGk)b_0!#yrPE
zIb_`=1xp0o<X=xb-0)eLN<gIj|B}mC>)~M_ayf~>F}(<+{{6#P-9J3^k1Um|laOpi
zQRj?r=$l^;k<;!swYRwA$n?&<1nS!;q+4g?e7SwZfACA#k}_Wj*_o1F({T{gO=Q>}
zhf+$Ie0|gIf~_VsaNE56un^8aKjtVrPcHEKMg~PZFp}CL6x2<wOWaVSdyN50=v?l&
z(XS-@#6r?cd3AF3OtbJ_ZJ6%x&6{SL1!R+4%0`7HTX4S+O!u5Ine5;xBPxF~Ebv-e
zA-W0h)RZtRE!X?Nr3$)hUk)^xOZO;_!#lNo<M%#If$N-QuddTrz))nU`cb09U<=l1
z6^4x<TatmofjRXXd$>D21#{nV_Mced*55tsXni<#oEBKP1vWHOM%$flWtw?zp3?kw
zrX$~+Q2tSNzg6)TnD!ie`0|4yFvVz8VrVuj0SnseEM}U<AoIRK4Kd`8CxZ)bjFzGz
z=>Z6pI9WvZixm9z9ZfnO@iQMcBK(cjYHFP2>;Hg4GJ>?R%G=NW^xsy1f_s;d2-e}b
z=?WtF4DHk*<)?{ADBo84^vFp%?HRM53!H28Vd0WDi`{vx;~n4kT@V14nx-155oyLB
zk+XDE`x;)Bbbl%}shuW85U4sXcXzS6o>+ObUX0~F=$A=vy77s+WR2=JN5H4y1*2Bl
zE{Nuc=2h=dPQ7U{)5-IyLD#oYuyn4U3PTD(K0k)sR`(?~y*DwPh+DX$+A6WUozd+%
zEt}W?6o2;rLKB?k&yI{m;uXc6qdPds=EEQ#(<>|QcHrzYDH_mz8ZOsOwC#MybQ@8!
zuZwxNYy2G&qFLevLKnBWHAY<iXZZnQ$=J`kb;BDN>!oF|u$R8KiMlv7`M_Q!I@rtg
z-5s?pRI`=fL1nmsnnMGSNW#29+G!%&F%Z2IN>$&+OUI1(x}bxr?y9`1;q!C5ZK4Ba
zd;nUQQsC*Psv);zJ-nuW`b;7M8~XuOug#;@bkF+K@R+lJ@ST5jZ7e^FEpvx=W*i?O
z0BR++K^z;W&b9Z1%+K7P;}z?N?k=61gHf80dTT|oM*O=0^pT5GrL1kqU^SmyDn|>z
zsd9T-qft$e(GWo-1iC7GeH)w^hZVEWzipgve>?}wD!bN)Xf)p*zgGMG!igxPLw<#K
zhsDSXEm{;<XDxWLkGG`#o+3^cTy?2@rkALP;)ZK#V>xP(RvM_82rQY9x{)d4<bv(B
zxJ(X}QRP4NV`H_F8KTM`JOW4nSQANq<ZZGdbXcC@;s{~8$|-ihZ@nZZUx|-)(A*M9
zV4O!L936Qef%X|mUMx_+fo!nq8c1j>Ph_SPxBvOnIMN|6N(Y3rnln})cGB=CN9-`o
z8~iD(Th`&kz5td}afN`*KT11pfK&wN16t_6O12-<G5ssFE!4e`-wAlmMRU`XjNH}I
zl06e7Cjrv{E2WVL!?^g1E*byh{udSEyYPsvsPtltaPYgI(!ei6Au?J{@(f}0rfj8#
zF(k=AQ?@z(%TRhwiaL9+Dlp^;bgd#f`=#?;*g)*vAm=G{fb>`;shVG~YU{Vbv`y4=
za6{-D)Cw>J#jUlMJ;;%d4l+NE0E*-qP%pps$LWCC!ec#981Zr?%x8Y47n~<mf=&e2
zI@(2U6&1-A5XhXuXp)DwiX}brc^<=0u!=RgO8nKJA7YMx=zqbp8p!NAlE4eRnS|_x
zxd}2ji{`XXdF`zfBzkxdsP6%#JO6b2A7_mrQjn^#n@VZD+X})5HgOJ`Sf_rgR1irI
z(Kgd7%Z$wx`TpUvNgDH;7^;k(kIzst#!dbYYv`A6bh&4SeXNJVM!(rUaJ%rZvs8d|
z_Ya}Zu?E0jp5R%fG+h?Tz^&^is-SOTD{RWZ?z@L7|FX|Yn;g1zT{*4QHh7kBKr?<z
zGqBhir8snlxvn~_;g-8^-DeQhEHogDb%Y)gPUZwF(nO$ay@Ye@M?gA@Hqs;Hnn#({
zdd=h7pW5p=5!qMr6pp=n`8)vwniB-mmBYEOIqC#<-s$TAsPi^}$kXC8;zz=tK9}{B
zsL&Sk#@?WnJQ)?0({PrQ6d~*|`<EtbEtOLQE_av9!fd7INCCG6@s3y5ovG#z7}2rd
zfl{CRzeFj;nL;9U`BB@8uz`YguZ~m?P<4wwd=PcEVEj)za)FO~p5<y_{(GKY(Ch>$
z2z{`llXv_mAoG%oU!eIJ5Q`@A`S6KrWB${<TC2b3wMmtIsUK_yq$404o%ALH8!eCj
zPD}nT_}#jn=}o?CCUq6(U%FF_B3wW$rapji4q1+4e*c@2XYz|CcrxO`<66iMsecL#
zf1pbOuwL#4tydngNIl(9BuK%zf{G#Mf3a`!ma_c4isZMWMkxofiNNkF9z2*S{cw}s
zw0aP|Vwx`21{@F>tSw_Ev)_VLErM+Dx6{9P9;Pvq(RLW`$5k#3s4_p*6SPUy0&q?K
z(#6L(>Kep$LoW>D{RBz8D#VRPd@HEb9Wd_U^C}S2MUpa-8K<P9)&v6oM!TgVIBwR}
z;28>-cNHHi1S)B1>Q#|Pr#{9v#~KUDM{)m2Ph3MaVk*)?RBfwcCSX8MK)hhU{Ud4h
zidD*Y)0RQ3?6CR!_9jq^#Z~osLrToc=5~dqRb+4D3CGjPT~Zq<nDs)|5c=>FH~V^;
zQhxL2Q){izdEF8<B_RZq--av<4rpAg--D&8>~7G*!AZsKZfnCW)2H9#8VQ>Isz=Eh
z-S$HE_T37spr{JQZm=EII)8kHN!fBx5B#cuz~4PktUQ{c9K3z{NkkA9jlKkg7AU?y
zi$qbN(YI<Vv=npBL9ieN&LJ;2Dy<P8=XtA*_>EnW#Zac`Wj65t_@+Ho<F7tRQcfyF
zPK60etWCK=YQ1JrX7byAw;-VI2ZRoSI1anVs=OQ{|LYVGiL9w1J59s=oW15TeTh=9
zAKW6{sahcI-z<knfdKYMhxXz?{hV!0HkZPQSh2k<e(UcuUA*((N@8PR;$FfB>rm6S
zd-u>hv?D*KFFr4wKkp3q1M{a>?VPQZt(HxF$S_u;C|o_xYv;4trQJn(C(#VRzeB-I
zpry;hEzt(A(G}c~^mW6wZht-PgK`u>93|dMiLq=xC^bgiBW^mlN#+_d$z2EjeDy%%
z$M6=S6pg!#0<9^e4fx3rvzIEXcR~eWXK@xQ?T<#eE0q(m0E{LX{TZmwa_kb}_v7Q7
z7bUi)a%?B3t!dudyb;g6W5yovqn{s!u0a*1vcZP`?su~l)d3VxjJLm0q3Lb0$wlT)
z`~-#)W^wc7%TV=3;Z9;9&#QG~?=}eB^6t)<oQN@T(rp!w7PD(iqH1lzME-L7b&TrY
zI|B_K&is4kONWO`gtlhC&K7&VI2~4uCL4(|PH*Fme#+$@^+IL4CGy<1{VSeF@3zOD
zb*Ib)2Kac##6`VAJ;H>2q5D2si3y1|i<+hnjX+vH%JBXw8|Vd}tv9@-Wjwm&d=R2~
zZohl+LG#mTa582}7-cbI%qoVX{d4DumJ*I`z_A;nlr56ws^U^hC@xJHABXjZ^b#6B
zQalG!BUE{%92&3hjArJ)^CHiJ2jr9U-HT{&skb8w2MsLZo-eJwv*3`$k;V~(r9j8d
zMY_EuRn2HGME$`Lctr$kl_ya-DSZaps;#~3TbTs%C5W*qX^d9fW`ai>S+T-pq~Di~
z)KZuQjSI5GHyBw>AO6V-K*9AsOG$=~>zKo&oMZ4)XS8ga^Z8yAE!?5;&Z2jU&bu=Z
zw5(D&yx;xE<jPJ*5+_%x(=)6{J&a>xJ*3F6-yi{WuXDesTA?rgTj$lEJscg6oSmM6
z;()`zXaAk0nOn|Ub*LLPJN;EzXPylj+0}<@ck$GL6po;5vJx!@$)C#ul5~>Mm=ITK
ztGcU#Kbal%Vd)rdy5+m{1gA2dVZZM)p<O)I{j6c%J5uBF8dfcA7shea8);t6NW_T5
z9Olk7xSj9qOU$)P-}B2KG*>=s64!}==xJo%ho3N+Vp{cUFXz&OXq=#1BcrN4gqqFX
zOnJQ)eB6YI=7d2!{`x6EIcHGzszfd4ueyHF<a~ojZE2u{@o02Ku9K0UK^}RPF-IFT
zrfVHHGhojV99Mp>zh<=x2G<kxreJW%a-;uIS`xUzWI}gWS~?Fx#YN#BqHNsglfLZu
zo})-hV$rJ<%2E*1Bm{I73)v6H2{?3aIo}UQj35kU$(d<B6W1kuxCqTXA9-5xvX7KA
zxxXxbjxC+A?6MMi$YoQ<XYrmzfq$-;u3NIR;;&gplG{pOKYZ!>Dy`O!y|oSE!$KMa
zQZ@1EsIunxDgOug5ur^C9@Pb0ht_~$!SyUTc;{Q%v(%@#^@WCkBZiWkV#BsU2r!mN
z%BmRleP9tbgel<GvI7RJeOrWIBy4h@`=xDzyqS-dDUI-1_vf%lTUZuWoW(~LIeqrg
zjYH<sf8Z{(pcE#IjP=vt(BpL7A(G{k%)lvrm<h*uE3^ouzo3~mkb2Q`*94yh&}M(%
zp^b@QFL_UGAf2f>T?HvqtJUOL>%NRXEGfIC7Yg0MuOx^>(wJBfi5a$f#gFIw#&WS~
z?86W#%Z)Qfye7T!l@F4Co!B<XY*yZak8_lJDxx6eRZOsA{Ji*JJS8Vyapdd~WSSb~
zB1%R%e#gYHKG|`Ef)=t2I0*f=G?U{{AnAwqcZlDTTyi{E1J{yV^i0n3W?3vq-&zU=
zwWy(X7I7@6+z2af{O2}BeeDWzv+s9m8?U&~aFybq8kSS<cXZ;r@Jq~&b!69j$d2`1
zQP}$ArcX-#RQGI{l87mI`|*+MrJ^Onv^k!&XP|d7$%6|U?dDvcb85yIVa}tu6o##3
zMPgU~+2{<V7Wd3|nH*0ks7qCS#GF^ogG%zQ%r@__lfpXS!Vldz|26u3AEsT0WvyEv
z;=dhw#GNj-yZjO(g`Kf)tB2Yhct+cJUKatobk3RFQY5CKo_&J6{DY>@Vt6nHGPHG|
z^MjAD`}^?x@*fW{{w2{7PKCQ_H6#@*TA#(8iSiZZwEN$^B_eCG0SDFptvheowb6qk
zZ_i56gYjdH^`CyFJey&#s|hU8gVTt*%0y3we8@()<}+mi*|^&~WPHFj6p7rE6P5|i
zZn*G`OYMA>eCeRZCHj<K&Up-Od%#ky<kS`P9;BG>C0VpV#wTH7Ot)Cpg-{4JAP<oR
z;+0idksMJYp%!*{0R@qq%-#`=*8n!m`6$-@HH$|&GNC)b=!q(q$(0u0vcKT6`Yvf{
zFc?L{6kC8R&Wj*2Y&MSRiRG98jSGcD#H(zv%<(wkl+9=2y|vIeSH?_u%#8R<Wpvb}
zpE+a3%$TLFg#RiSIC0o9gx#+fBS<(2F%#jto!l;ar!u`_YKDj*mx!N;S&NX#ojJal
zqf<mFgp{Q@zH8?h`FCew-!5CL<KY?eobQ^&=x`cq7(S)f)^_<oS=cYKb68r}0rlL1
zHz(GXay(!vm~WWF@r^CmyQ7d9F2{hj;pA}lzrrM{dG7sKn!L+%Cg+PVFXNR3;3H81
zxzD##f(!Q_ogUY&)WS?sJlESmnDgxd2n3vEzlT%U@%l2b-D07}aM&{Zm<a|>@Bx{q
zWA-`IU3PV?)QWv$<*wNEy=?+$@dJ`FMTQGcG};>lpVp2>2L!c#EHm*f#_VV6;`jk^
z=#F+Thk>(Q;QF1nL7=@<#A3Zuqw)=5n6LclF&dSjJWB_c<lP6Qt&2Qr2bHA0(tguU
zcL>_9NNQK|lHE#g2y+Wr@5b{$mV~e_V@VCs!Ph(D=2Yz+>!=3S{-Q{7P|SLA1W~mP
z!5>Z;Pfsw9y>ao2C!CV|d*_r;8x*A-_ty0yS~q8Gg&a<F*rWKg#ls>Fy1y@nIb5!0
zJ8}~)&IvCPosdRriz2BmI1t}E$8a@fQSf>vS+0ivC+dR?338rcFN4zYE2diQCL5=t
zc^F!XXCIUO-~=s8)4K)pMK4kx>vRp}?-Lp;l+f8)EqQPz*4|)SndF+Kh#!-*PFof~
zHXQiU3S3w0rn5)Y^oZ`Q)UFvVnlW_wJ+lSgZD3aenEMVwFQJjGzYc921vAr<w@#V(
zZok-LfCAv&?T-Q=y^$_|kuNW!nAyW6bq68UK%`V9(b(FBawD6y=Rx=wr8T0PH*04g
z_`SwM?UN7fBrSc3d`>K%0O#R`$A@yL1EYn=T#E$lzK*A}FqpFg@0GPut#o=~L?gC1
zq+-(PO{j^+B6<E572~P?ro6EC9`sj!!sP&7O^{C0FgsQA!}{n_1D>upgt$&Ob$tm~
zHsLqi=3eO>ftmVk^om-iCjNPuGYPiaqZd;zSV+e@LC|=yO7AMWgh;=Y$=Y<Vc{V&X
z$SjV<(F;CMX6SMn=MJrg{(+r<#wMYqLHZusl0e9e58S^+lKYMrDa?IF%p)kjO0FS#
zOY=TfP=+^TcwkYP6tfI4(kc)MY0NSZ@bz?_T#1Ty?aaRG>>j`kQ5Een>FLn6${bvF
z+r%J)rQFtk)}sRU2kU75lEzy{E0qV#bq=d2fNs-Cb0yA=6iyvuDn!s_4-C&-fq;Uf
z*G{kURSVWogtWDLo&t~CPe6Ve47)DoIZn_VNt>fxN_BBD(y)Dhm<<?Aj%u%D<P4-Z
zizezB4eP_y+2#fL$Jm_94hu9{%Gt_XA5XYj>O;|<#bd;~<hr_ln?V}`l~qR=*w$t3
zdr4kQis@|e4Y!``LSV?T3Gs18F=fn6!scJTsU#Xb3x+q=2xKBo1hbyF83$?gZFn<+
zVSAQBAFc{#6r!fSfy799y_*GngKGhRh}v0jx}lM0Oc^Ms5|<F<YZ6&=i0Yg?%ok9y
z+7(m5naJ#j5UJ%Ge}GhSILz>T9ySK0<zNw4@OB+_dp2Pp<D0Uz`fO=zn-ylfV+i@L
zz;6>TSfThlXq{!Ibc&{+yUa8Hi2;r3ASlcV4Z$tuaS*<)N>1YB$}cJvRVN4+{DeIT
zh0tUUf(c@#q+t)^Yj|YB;#u$xdXC6Yd&PuyrSowWOH+}ag9|-N2nPE<lsYEwcqH%L
z+QpbUhNa0|z;1H7^>#Rz&mpidSI^h8=~`Zpe7E>lN?bZ#R{KP>hC@DD{sFkZ<!6FI
zKY&8mqGPm7PJN-JIuYE1Iax(Bpx9+(6PJsqMBEx?E`IFjC2+xA?d_~%3Bd`gMT+ec
zEqV%71_r{)w=RJTb_cT?UmUYKF+Z()>S`=>h3u>T{<NOaI>C>5-sc{_N5z7E3LV``
zSJgs>f<7JA+3a95wSN~;4%Gh#e)GxdZpVuj3Zil1-BUoL=I)s3X{WG6hGQ=jKkPcC
z(;Zw!MY}V;Tl38M-(`9+A;XHsO{sP$U0r{LF#Jn;;*rr~EMarKVMOIpY-@``ks}^}
z&_!|<$Ud!GBFECzW%V8MREiYZJ!ki26nP*+ThG?}9O*FBVX4~b_!sBa|DD1bI=}>}
z^N=|<@#hV9%>{JJ+)26f4bqdLkK$H@XD&Is>Tj`lxG+Yl+!H9S+*N!O8J-=DeJ?<n
zR(lwISGx@Q*qv=K8;!c>_@)7`7})vN6&Na{D{5VYMOfyY2NQ|Rh#3G=glbM8ZjzF^
zj%}gP3BQh+4ct=^Zo~|l4Sei_BXXM7r-5!0;a$X^K{k&w9KjmxH7V)+q?k=jImGa7
zimHRG#o{^ZzSoy!2eL;0g-YXia;+J4N2Z*87I*e`E*<#;o8HCx9M_&TJ_6$c2#LG6
zO}}{AR1g$n<&blk+gM3nu7epC<Uo8|&T)C$+2+g3U-bXYx-CT|gFX<jkAf1F$Lr7(
zv5W^VGYJ(i7%F7Z6~bfFJhCz<DryUg_H|#eU?+aUpL2y*UV)vYq;Q2=@^nmke@Ubg
z=E{%N6!(nkG6<SW7TeYA@adG{n};n+U+yg;?0G&B(fnUuFm^LWRGV4AQQTXAV8f71
z`nNT_hAVNiGGSRw7pB4Xz6F_ax5#0hl}<Ns$aW~~Mt&c=CwXEWx;&<IN7mgLI2aNv
zL=7p<RL{lz<cRQv3H!P|C~Zz-e{v@0s4bV3y33;smTB`!!s8q4<TooSa_imgB&-TB
z8!MtM9!PJtRRE_|x!(K5Fl;7GOH`qXu}f&?ODe5{o*S=<87k6Stbhn7HEpNA(SoZV
zvb*6@`f1qd%e7GUWkg!F{?Jn!AjD|+Xw&V8OBF)jF_M2&dMXQLH>E8k(MsroBQb|M
ze>tU{12QNY7JU8QJKcyTK*v8wi6DvwXCUL1?*`)5gzGm_&b+~4h-}ba(%K7B@b_t%
z&s&KRpa-0hPDYfL9QZjA+K9x<cYeVD)k;fF<FC&-3zI7rM_-Az%-#6-^OH_BO?nnG
z+iL<`*S>7!HS2T=jD<!*U7;^$N!=OLrbbtp^gv`yi*Pwiwvb(UKc9x*Z)tHZt>J=<
zvi|*ain4ybQ2WNKTrH;}*2J5I(O<K^a$M&SkE%4I0`IwT4I&@D$tD9f^zXTl=`DsW
zfiq0H1Ov7<=@5Fe<Wm~*5o?9=SR#K>(`7P7;_m=p-AJ|!fiUQE65A}0X)rYoiZ}E^
zuqzI?@F9OiAyTBnURq#QLZE2(5glJzivaulB*hx5V6W_Z)Wx}t$cZcne6=x=DwBk-
zg@ug{WCkjK7t7B-k(6Ab<+6DX90De4$o?C0>y8SR0VT0~w;Hq$igx@9Kis3dwwf8<
z@KMX6=BDHMO?i#83DdXoDw-|{@2o~-z=z^?UN7iF#SOyJHcLpBQtXPxN^^D;*)Y^S
zudM@|@{$}>VI>lV4XH!rPuN@KDtlWjCtu2$6)5DXZOf!Mi8ox5%8NbGM6uid_^$p6
z6A3_Rk{34{gzsWUPDTFKv#PwLiS(^U4tQP-T~^^2l+_)9vG|Ej)A7-cKt=siK1i8j
z$z^g?zi`+UOLk}(#?{x}KeA>cuV!Kfx}#yGAU|ybx}y-}<<@Z($ZlWCX!O<`0Cn#^
z<~4=!iRuY+1)(iwxomMymj;@d`rRcgYeU<?^pH1B_n{4+U&OF9Z9^YGjXePg`G`du
zCY+2!b-xbz?G=p4ZG5ycPb8U~Q<>6or}mlfdhq{(DFJ<QuV3{FKTR~vn2caKqv-%x
zwlwIpo=Uk%`F_1hq<{_PUoAlXRmJr-rX-9Vl)q(hMfug!9(AIPb|rBKfk7iG!ti!P
z!H*IFj=DH<`GegD4XeQi7?)f;%)E*L(@s%_f}No=GtMGKa2U9{-<2%{^HrcQ_?{&I
zT?bc0Q?n<hGv0G20W3e1_8LEgeGdif0tQZ^P}DH(19n|>1~jkzYIF+ln2dIyfceEj
z31E{#nwGOP5t}`nFS?Zhm~K2{vlY{LZbKIL(|Bml+S0zir|~k2)?xo!?chmETATFl
z&i+t!15dD~Xw(dK7j%A|MPYo~U!>}$%4RmUnn4WKpJNqxR;?6~IorI6%@=$xSI;j@
z+5SfP6Pj1l<f$J$Um_4vZ$IBrq2dQn*0a3$$E{qhtZ!*CqZ6ucA1pzS5cqZqP#a~C
z6(o$p%E7q#VEL1fkxB24AS9w}fUEw!@#1FK&kIkF-}n`pjb&8*<$*#8<<=Yn_xkzX
z1UCIk_Y@)y@rW&dIMC?VRBv|u0~8Pr2g}EkH3$KaqUoDfO3R>-k0>Ng?GVLMGbO%q
ze5G2VJZWZU{l-XRT%;UQQLU_4{GA(tE7Cz*afyLtg2Z)-V5j(AlWGrDPgJJt&)1wC
z9egT`vKd&#wE4*<*Kf{1fS!CK2lTi04lO?;_uq!0=lh!%RsM>B1Iq1!BD%DIyGF34
z0hK?GsQI_FI^d>%IJVtoV~G_g!!Y3#@>B5mvwqZlyJ#QMGJ+5km;F<B+zT74qA64%
zO(2yMgQB(o_ZQ-RWl1GGQkK9-kE~Jt?u&s>B+M;niakiPyRJPN`_!##u~~y>(HNX>
zacg$vOh~DN%`o8#v~6vPfHIU*-^jv2R=sD5#sQqxsyHGq`KLs}clr~@72vr&MHS$x
zn9NEBYFvrDezpT~6)>)E80}UjFiX|ggApDfIo;QB*dr9Wq+7^<Cq=5Ir)2&%48E~d
z{#0cXjQOWn;+oKzIqOo+ygrx}(Fo@>rFWS4#k5kUxj4TLY~~Pp>7OdShd)#v;#VZ&
zA9^r*v2b`7o*~wV=yYMA<>V=RtEueIwRde8*<|(zF?&WZk~w^tLkZ|q=z`|0m7@B<
zEa`$4qf_AC9ax+0RTUWk6ibk$*t&43?MwsdtgS(OmZ3_=Em%U?H}i=B(X%uszhXml
zr<+%pRjws#j(?f@Qt5|TOf2gzF(){4IpV9m6iQa&`vOEmBr6BfwVDu?_kQuf?aUXd
zE5lXiuyYIcef3_Enw=Pfo<GR>RI)_Gi(V}T>?^e5RiwlTnuXnKm-|X$h&8Jk$iud+
zK}MHbt>GLw@}m%e>_W&UO>pt#e5Z4k_;t=?TSFXXdE^n5Y;(?{gHzUU&$gg+ehb$n
zW8KSmEJqAi)^q*C_E-S$RR1APYOR!pg89*Grc{Hfl;}+h(eD;#v~KnZr{8KWsG+Ft
zdPpZUzYXD?vzu%pp7<$fSXpI4ADWN(#q}C08gPsrNnCOvzsu1W2NRvB0plG@&mj4O
z0n#cZWCapivYEXunM*o4F-}Gdg<l>c>N|=&hVws`8>HmWt_um@QA#hU-#rG^_`?z|
z@`8}K#6Kh-259f6E?+B!cRVwmvdM&)5qnejEUU9j>w6LKlRNMZ4f4iK+JAgLR$TiC
zZhV=hN@@D_lHUCN>%gbU7CP`}vxnG*ur&Zwr7?z!qPdquBm8GjT0~WUrQn3Si@w6$
zpLhdR;pt|DH~lD<X4iSK%qYu7n_Ift5;Lb|YcLj!chm?aG$Zb*E3$<9!g%BMr=icH
zJ7>4DH!66D_X$iTziBKCA}HiSS|TVI4?Fgl;LmgBZGiQcS1_KL2K?hA80#<W7Q2ET
z5-^m4r(QD20w|tPdRQ<ZVXEu|%k25&(vy7%g2E~BZb?rUq(F)RS-C(ZOCCs9TzD>5
zLfusR&{$A)E+))x-ppctmW=3S)%&?HTd`O~ZD+Qi4Ux1yQH)7V0iLW_LZ3nnWJTv?
zKT|_1*3Zjq!q+boXyhct+QQNXN}^2k{I}lbi=DDwQFQIBZ5!LN{leZhNV#Mh!AVNJ
zQlP~mX<xfEg_5JV22=9sbm#z*Pxl1Zz7Rm^2RfICC~Beo+<xBqUvVu=&}k~A1}lhC
z6;APMu?`Uw$=n|@LcaJG(A$U&5^8_c1o#A|floZL@E1!TFd)K^;u#Rz(B8M-r{20T
zVr$^gPGlCw<jnY9d49{W2ub<(eP)10uONkV6^DNwd#o1B+7Yh3kRg#YKYXD`*2mIb
zRoZ9b&OD42LbOQm$SY({doI^Hj^H;p9I!8H1cf6ap_7rOTNu%mIBX%FKSlJ9%)MXA
zQ}A{~LbiLTpvWYcPuZ<c)m2&44`bq6y5Sf4(ETfD5P(ZE6}Y?HKlr|-H!7zYBISff
z`e2*rPALqlR?=NJK7E$pET+D$eS{N+>3y2;v`F8&`?pN_-xBF^-vadOps_&Rp<g#m
zfGv2%A!<a@BvCs|8cC9{Sf?0nJyKf0Ld+TE0!u?><U_`~pSyID{<!@o1z2Zu09aoV
z6QK1e<ZI(<1Prvp1R;ZBCZRMDVD>@eX*EKR5;%HeU~0NN*6oRhftBCb7uS8)^@&l^
zzRh;I+-eqc$P$U}bV|q5u62(ZuBzmGX3g;TzEagfjzN;kZx5OD6)Y4F-IJqc6=mBJ
zr!-kPzMD~#y2WH*iuf#K?jsTkWgxg0)C%e+YfBZ>-t=wkD{bq_iWwMoIHi)haF1l0
z$?xz$78>!Rmukf^-9&w&=rkq$*1{L6eRyu5<jemUUkHj-2hbU9yo!uu6Iqo*T8Yv+
zI5%BFqYOI!yUhB*?9a>qgTPZVZQ@6Otd4@^I8ocTr{C;E=fs?9_kF5F0%fU{W|TXc
zXr38Zp$qj}v01+;0DZMYHSU|0?p_<*W~3_R8#m3|tZS0h4n}}2hHDZBvGsZ@R2gMQ
z8C8uzW?`W0A=o8!L;kM_x{lR{zR&dAaQ#utZj-M7=!T1426Eh|0G7G>FVdNrQy5Sj
zRRIS$Eb}{yJE=ztdbz|pIQ<?RcH|zf$1~}j1W=RJ9;`TuE%QVew9YW_%+f(R<ARmn
zBgm47AV50v{`T0fGy3UJY{pv6O293v!&*&e<*PDO_GsS~9DlaLYen27*4fF$_uF7X
zmF~nI25DrO?E{c2TmD&_gNx5s0BFsx$t|}5cf(#bQ`Tg~<*wj3r!TE>K>8GQJ4OA4
zAVTP>OyrG3UxshDN`ab|6HFhiNpT0pDN1!YC~4jFDnYO(p<Ad{DEU*SO4(Ut18E_e
z#K=5a0#>by(s2XQ?Hr?xa_$q#N=!M=zJLm7B$odUzeS^CC^Jnx+P<zwE&P1~yXjJ)
zOBEV8t5vvj@=6d_E%kM6fEA^h{rUMI3D+O6zP1gkp!5vPVO>AGqIpwfg=<APj6i==
z<fyNlb5SPozXipH9bLr!0wv0V6lrvAbkDu3{+0xqdUPZrBPXmH^4UaZvilcu!<g0~
ziH+#yxyibY3gHneu&ITWUkA(+-|2Hcj+X_>z_xaV^hBadBjlr$G2pZ?2PYEu*Um9_
zc@V(};JP7o{b1&511ozW4{dTRhS6M6%`4>g%YO88=xYB5%edinG{&I0r_|Cjex|e7
z49H`r2xLo5cXtmivZOxsotW66TcY}Izax=)cuV9-;7S;A|CFH(&fh+pw^v>@>C)?+
zO^a{krG$2(lXw^>xP&>4D*4C#MroazeUz+(=9SN=9<8i$Bl8=ea-kL)?X09WgNaU`
z{|Eo*9}JV~%+_aNc~0rvIljV?F9y>Hkhk7~-g9D!#6c!Hhm^tMedzMdujKac0?Sj>
zJH!Zd!&8)Fj>AOP&TgE;x!hVRndpD+`A+bcU&1Xjj0###b{`_)v1KI%@UDsyYacfz
zo&7ADWiHJBR_!fWUNUFskSBPLfys`{g8{yYyqNzB^E-sE1;|{e_jJQWAE}u7Ym3NT
zm@9)<DB;63hQnpo;GEUBo{{k9cxCDi(nLq2I3()6t{0AESw=+C6-S%pxWTtQ&QhRb
zi0`22qq4NzaTq_%xeM;KDrmccZrEr1v8m>G8Fob4@J~vjt%a~;aaQpy_*s3ysh9S|
zGu7qneLgGl*NTLcx9&BeyGi0sY7qpT(8rTwwhwDHNYC5qIuVHwKzcPIicXQ;#Nyk&
zEA`z(M;t7+s8rm9l&i5IyFdp%7LvV$*!&?E>DTw1-)+%tEZOF75b|Yv;sw&%EqKMc
zys}Q9Dvb-q3IYo<a)b<C&k1{N=CrZgOCSg8qdIqk1m8`Z6%C&%2d106>`Z(Oe@g^u
zfYr4GLw5GR#5vxJio>iruz??vW%VDv(!0%YUF1biP>KYT7E!>AMoL!h9K(1)Y<{-F
z`Au$P8bhj@dfE-aXyD<_9g&|@_IcqO&i9h>()CWs$E}SN!ETdYXj^9G$9N+}A<1r@
zIS79#|K1GGC?+t=8}bzH#6Bsoxn1$GTJH;d`e9;+x4Sw@JQ(Chx)%NUh}PA&+@2^o
z*Z#4Q;E;>3jW8o+6Y&toL_Lv?f8%i22N<wxZk;y<{@}3iC_>QXu~0Z<sdKv=Xr3Wz
z8c?|m*S{XOvLQw>9WCgK3$(kz+6Ix4Cpx3eAEjz>od3dw!cf&U%~wHlEgTBd&EKX&
zSw^hL1ZFJG?&d%J2sFe<fqm35{K{7(z_6fu)XE6f6p8~!bjEkVR=qKf{q$7`@~7j6
zWP}j~>F;G67eGCx4Ukn^^&2hj>9=g9Vk%+H5<ydh?+p`*6#DF{Xi$e5uT2mG?2x%o
ze)-D~gU(<|6!mckNjCr5sN3;-`szYs^Pj3}DQ$(6nJt$zVX~E^@?fP(&zPEv6Wa47
zlO3}Zv4rjJMQKrprC+fpNve>OZ(fDIN!2XgZuU=FfVxea2#{W)bcsnjl@Mppes;4E
zmDBHP`M3{KyV_(db&@%_KA6L;0yBsa9jE`QeGz$BD7`VIc~Ve#SnBvQcvB`2>4Rzl
z>KNgQaUYJ${(W=op?7lb-h|WTrJqEaIK0NmM@X~GeCW4aHe<NrYFW(V>$QcRmTX^J
zRSc+L)}i{IErfeict}Z<h@Q#yXsbLwAsK5ae**NO%P%O4M9--eYr2c&6F717Cy7g&
z-IKWgBATh}b4H;_K{@Z5cxAddzCf}i1C2AZVU&b*yt6$0K<o6Tz`zSkpDL<|HrcTj
zb|hxG)!{b4a@HdDV{+G;UxD>gK(UcB=svS)V$(lw+(esR=WQOf?^&&awwnhb|BXNQ
z<$`7Onx;xw%`Vm~w-s-y^iJcY82z+mmDdXN==77ov62lMzqb2GPkObPG>jn<kbv$+
ztt{sta<!305!&s@IsTjRtUd0<!Fz0NoMWT}>0>jY)YxKrADpOqd%REsvCEsS_IxzS
zn0uEqB@HFJ(9$#|)rN{_+Wjlz270m#f-wa?3Qg5Fbkm^BVn1~1s3K8zA8XxQXfx4e
z6e;tBv<|6Fl<<N|#1+f-Wv(jXi<f6(Kl5MC;!RjoDq5bYt7y=I3x(t;h_ypvmr>;L
z9nRXGRCv~!SX9hi1FN5p)jF@gm2j-Q<|5j<P?~-S`WgBFORuH>&y@#m*l9JOUbeYC
z=AtYS+?yW9tzxrPbWhQuqe%rhU^mR{v$6o!6}K8Wu)=bBJPBrt4_rUy4^dEi95!pi
z^z-;NF78&sd2!(Ux%5%&lwkQo(?=Qoeb@~&j=Jc65gCV=OaHGyRQmNlMFe0Rdg9Jy
zE`k;C`QXaJ6+KfPqO#A<U2vMAzpkwKCR1Heemz+6h5V{v--@G*d*q~?$O<%`#MB|8
zEGJiS2eSl|FB@nDh)h4`fDwRU(i<ox7GEgv#oJUG(mzo1R*ENpkg)?`7FgjQGlgs-
zj@t#3ugbMDz$>#*R)ma^gtC|?Nj7+<!uh043>-9KjUKt{<iG>)@%aeUkDOG-E24%k
zrFNFDDjYT+*18jKE4$Yc5+r9iar>YQb4lyRIB^%8jW2Qu-~og$m9ms4UBZCX1*leH
z$o_p|S&2IX&fo5e`cYr#6~_7#5x&^`>He=OI-kn|jd}VxP@mZd8^ZQ!5@WI^I)XB4
zg`lehOhTo_C2a}zIWxJ1*8WMMN&GL=ehh0GfZ_G-M~}Y*xX2>h()uPIM!BDyrl3(E
z&b#A$dJajIZk|ydUCsJyvcLAg#X$&N6zoiMzPxS=^^8ZPu_O1O@JF<en{uKo?pCf<
zRUS^t;iKW}$ycOXp)oyVoGg(scT5Fa0;NlqlJ1c~egvwGrGRr*#Qjo7WqU(kiO@g)
zviK2pnn=ivHaynTO@i^9vkhFhg3j_Ck68%Gm@8_S>rS4Xkr3~WaCuc!SRL)(72m57
z(mGXF$E!z6$Kwhp=|@jR3|$*SwHd=HMK^p30?Fw+n&RO?J0{Z07&%EWnl^eCd+0?G
zjSE5hCBqF4>J0y(sKgTc5cj2_+Ze8Cq>;qZdjEN1E0U8aKc1L`LN$dgSG=&{PdGHL
z7J^a2-%N&;cr)tTtkoUM%%hBq%cSr3Wv>Ps?|}c@O+j9<{{ZUN2_VOatfr}~9QaMx
z@0N@;jJAS@$_iNy8Y>9N$MFOm+FOvy2EYsiNo!11l_M@;U|B)L*`3-^DoSG)^pFx;
z>dVV-7%)Y>+*cV?uBAfkv9u@aHOWJ5jwWTD^~xh0(a-5-F=+&1J$rP@-I8uT17h*Q
zf}6dV1*FFDBnDrhGe>v?Gf#yIEt7U>AP0ptxsNNh&6FkCm>DW6o!T!?wGM|H7*R&s
z<bQcy%Kf7(UP$o}OQv4P4KnY2yQ1p52bKk$WwAo@0JXflGCaI5ZhF}0034)TFK?<t
zj)R#<%Q@P0LkGu-pU^mNqLXfXbk?GU=G)u*v;{bS$cbs5VR!ZP$Z3gPC5M;inpDEd
zew@a27DVk~ss}-S3;U@B>;)491J$xLp;)qKffN16iUSO4C^tjHX^X6gf;hzkxqoxS
zd2nfS^6#9O4MLS8CzZYDi#<@9GxpEL{}eyplLyf8w;qCG9^mxh>$RjnRVzJq<>*>5
z(tE2x#V~53x#RsurGJu>SkQnT;y=dWn9am>N3rMfm$tB0!?zWslPA#x9aqHS-rq9Z
zg^MmdB5yW1O@%g$Ze5bxNS@mfdot{^5ig21x_9^FJ*qcdioTr3$1s2*#ZE_txUZ&X
zri{kDf$F(_-Rwq0QqG)&?KzByw;BSP%*zn!!2nq4M@KvEb4oYy{a?De8_37q-z$)W
zXl?6lz;_UJZ<i&pNL}F|d&-c{dF<2}*_?2jMTtwPj~(;~S;fTtZmExJt;K;0Y+_U?
z?e@Dk;Em)ddm+{)#H`i;F>Mo*I8*`=5L%PtuIo5ooFX}<jNr4M;2mGQxW1@X9-W4D
z`BiEZ3KLima7@`-#fbpA*w=nl4i@!e60EfP{n|FcI#yd2eHI65e<tE8nhs;tR!t!;
zwxD|-kih^>jO<YMITu%OUgOpN4U78D3>$z<xBp8}ea8Sue0?>zRZ?&1qOPMJrg*Et
z!;_W`18yf_o#bMg^-O_@F;}R6xmz?@$y+~Q&TYhMMt&S|E0=DmuMh@7puS1l^peJ>
z{aNqK@l-yZeG;*`h9Fs@9^?jdg@`@Kj8yNo&0L@N=`fps=A`WoP<RhXqr;6w;i4_l
zJ3s%hfu}{W+B*QgLZ?^M1s_1PTk;;^>Q<!uzHzD=3opEb_=aOw`VXU4cCuN&6K_X*
zk901~TLmv^{o<;tWW^nv*t)UP1?&_Gk5GOH!3tR0g1ijBs`r5L)glr>0tOAn2R>4P
zQ9pnUBhK~aYfTIWNsnIXE)#Nbs*?rd6l93SIR@4y7t+>8x59%}QkX6=PiE<~RDhQ{
zfExLRcpAJ)wG17tV&aA78nhU=wjYD-r6RB9dIT#`UNmx+aUj02o^Rv2bQYyvjocw6
z4a{|zb6fLVB?t3_?4spgAp}*lFttm%&R!rs@cr8-ksgC6uE+@t_;6qzWCwh2gYPNZ
z_kWOv$CV>4f6t&iW07g(ryT-g9MwM|%D#T{YgjFnmtWC#4<*2|RS4-G6nd0m*42cP
zZ(*8&K6h|h)QD0<0^O|V7bl0T`Ji;R!2wG;MHEPqg*6rw&&^4@b5A?Sbfk-jn8B2>
zdD-N89@l6r9j+%ZSMiu{rRVunT*D34`^mKWL!S<y-`To4-BP%#owaSjNL$b)#qnnP
z5E8{vsXl#!f#q6vEHj$%$J4z~<~C_pQ)M*kFaTf%h#E@iG}4VY^Di#}StYj?@Fp*F
zs%`<t#F}sv(zQl!#s)KwB-^p1N>jA!siQc#sQR-!Ue3I@y*Waj)47rgFC~`qav$6l
zkd;j{SugD;;+I!wRzNkFOw(Ot6{$w;2H}UR{p6Gns-F*p#487Y-Jz(T6R5mJUv*KK
zc4PP-!A}J6a(S(OF7C`fKzd`eZos#gz7H0S(yVmFWsvcOIo!9zS#yutw6HdmX3xCn
zy4*H^F&~y%_ip3g0?xT(TyO=IBomLTlzG|_8fROFXdGdNW&WP6A}qqFqJ3hOwrxJN
z(tept)o#0RqG&l=;fx=_XLddx$EYc-;xVqZ&v)Rk@<`1q-P@BW%wq*1+;Z*<KKO0|
zb3WPz1|bEbnaMMF=R?0HE}5I(R+!IX3;f&UgoKBt?f|sA1Dk-ifBCE!9atE289ER(
zo0z=#rtQJ)RJ#*;lmITHXtH6%KrB6IGie32V074$V|qOP3S%S>e~r@+S+X*0leWYD
zs4uc1QJ}hesD}tIrWw+8aLu<a$O*cXUdBDWAzBgMu)Fj<y~1MziyC1S+-*B*%<%JS
zkN0P<>puq9D3GXKCiw$&H^@IRuePZge;?pF;JgZoIZKsgja>w@wHC-&gjUEMKHp2u
zL%WGWn|II&>&dQmfgF?w!$t9)0DuOu&j8!x->YS=3agNCnB~YVCTVVksIUQJ>HaSQ
z3D_^<BS#dz!L#@BHII#8H6LIrAFKW5xVBpfU-`q*n+dR{8kRZvelT*|iMys{8?=ds
z1-{>*c<|4^hw?^3JCXsETgj(Hq0+U>vstz$r99dm8=mjf6a#<ZHv2#7ljJ@tA{;Ho
zdc*&qxhrgMDJBB%hU9rwLj>DEaJ(zG2X7+GJ4f!*JyPy><FFUrwI0qdEd?je3oFEh
zRcC<V6};nJa;eZD_l*`+jDR~C;b39psyXfBwJj9qXI46Oo)A^fol|f>A_5MC5q=cx
zPROve94P<+&%R6zj~+qSzwh`<?-Z2F>X9LlEOrvBxm;)aAMifsdB3aCl8y?$%AIVY
z?XM!5Ry+Sob`g&>q0#wU?Wo44iLT$!p98d_uc#}nCsDIKn_k1;m4yotd5{I@B!bR%
z3ZExN`%;c9hO&}!nfT^ey=%0+(iZ+ZWm2wFV;=^K?0oY{*@bRYOhKN^Md-*yV&y+e
z?5oGeM)vyABrZHr3FhOLkosI;rSd*?T>F5Fqyzj-pQ$vPuT)*)C)qc_!G!RVgyNxh
z7B+{NhBTDmqH&(}qN@aQvZlhaXEDeSp<;xOxA3c8kIZ8$E6>czYuAk*CtY5+oaXO&
z2@@4Z$9j&y%bhW(zL_`xWXb5OeL)|$EOOrra>t!A&&}ylv;7}9!xIpMTgL9VQ^8z-
zs>4M8Z1-zZV&$3U13&)Cp{5I21VmmxK8j;pAbDCBW9%#j`8rh5cQD!r4Yf825xNIN
zIutlv42_0v#yS)@`{I)RR7MON*)iF4O#a1J1aTFsLSXMH6Ba8ee|}BXr^sDZylRJ;
z_0x?;yN{3ia3v(hduDA}B`=Scn7h5^<_n9t1$Si))xsk1FDod7k|D`;diN9eeIeXH
z`JHNkIKQmr5Bdd<Z<?5C!553=2+7)+>dRpAmY21bs3~Jo!tlta2VElvd)ip5aje>{
zK3Vj3YI6Ho$c^0yhKUlEN9Y~ERui#nLM{o)tn=s1EuiF*{zLJGH^g?^Ug^e4*Rq9i
zDwq#XehX2uZfYi-enn*YRBlkrh#Wquj6iTPPOU}=VQwEHt{?0$+Gftwy#g$}Fx0$T
z`Rf-L6&*y=^}XA#!xOn$Uak)6F+}Vof`fQv<X89wvAC*|wOku*pr}?EdNZdxjqsED
zmb3J!sZQaawI4sPkg1Xvy-H8tJ%L3lVMVY1P$^}!@y{a<Eroc<E}p3cX5MAKC9=}f
z#Ch&05(I_cUKEpO-zU1ccy8A$C3+*+%4yto>6I5e%!N0$ZZV$hOpN3qw&7$nkLS|9
z=4^}NdbrvpC^FM<R-a}G?$VX+P<NPX7Jf=TkAfcPA0TDhjhuq2>>bDx%<3Ai(7e;>
z84^xf9pQVwYT54C-g*eH>sTf|R>)}%9twYh!W(;MAk(p0j>m?TJ}`Vxtnti09WYKz
z1dzS__1}uBI-!C2ol!8+DlogYR#t81Mg8i<^|8rNZ%2;Y>8j23(bdq*+L*~MC6VVj
z7p5v!!PZm2?r%kV{csMfqod^5i^A@z_^$j$9VC7)zH<!xE}3d99k#eb{b4jHD2A)t
zNOc@cDf00C_b>3g$!yt~fsqaLyxDA7EMKQ69gRDA0X%ap2#*{VL9dUI;!}gbui`&>
zScDF!e5Y6Ph<Wk?aKx^sIb0P$>+ge@(LiP1(GUo|Y9*BOjCnRQc9N99nJby6CMET@
z1Aj$IpY>9qZ);x1<4BwQzq;)wRP@?!kB|601tC&VPvcAYR~$~d{Y0J-@(VY_&uy)M
z-rCeRga1iiLEPDkZ2vzl5T{FhX{1y{an>mks-liw*XxT{%25*vDWCr;KL`a=WzQOP
zd{4?6<Uxl*Sh(C;Np28Bf7=c_;pxtGXrnUJq#lz1%c@se^=#(6E(HB4OU~SkhAm6G
zbt*@hVz?r@qbWvLG|TPx5Gk;vc`9TYu0AVLm^nNyM0-^3K^8P`StX}cMZV62YR3LY
z&l@%?N`0Bs@BEf@q6mB*_59~1YvDsk2la!s)YgmLtgTT3;^zG&e)I^X#&*oxpIqeL
zeSq;8FTWs4J@x90oN?tTMV`qh)!Y-Wi4Tq;KXcIW>UfeQ8}pu?tTgU#N#2H2#B?;D
zYSG>5g*q48H$IHi^A`1mmDKQQTlI|xw-Tdnf%(?`DN_aUDzZ4K)}g`?g^Lt})KuRK
zto<!^2EMAzA;kk>Y_HZ`;RO7~k&QBc2n*2h43`K-3=Khl9JS^OBp0A&y0^81=mtYS
zp!gfo&xF2c#m=#PA*DGL;{f1P3NaJb)$_&o%#LPZYHQ67Ftu>KviPSOKy$y2Ja%(s
zV60NiBII{5D7;l1rT)s_{=8d;KAC8QS#2~8t@LPwPj8FgfEB=g3Jgck370?fjzsm&
zgSGDnRz{!Z7*P;bD7Xqy-rMpURG7spSm;oEi^|T``$DOwV~`HB0r#lq#~a119M!)>
z`6K)!`>-+H|JJR^3#;<X)t7X(NNE3?Qhtri&wFs%QrS@<gMh|fDkS(XaCDk8WwruJ
zCzvWk)tsVVqo@>XGDZxXYL%g$-udx=5P(s0U-z~6q_sef6Q^PT(;Q6*+N6M1_nVET
zFHeLaBUYG=`6WgyRXufpLGfMjW^`_oSo~0->lC)oSy=HMr3(GrP@h>PPJUN;0byqK
zU54V=`<{WEa#0pqTWJ95%uHXn5gt@9!!jk?e+{#xH&WiDem$_WR45^cc!$6aA>iW&
z#J>VmUgESOx3*cZ{0Sy$9yo+&d@!{!)iCbv#csSBPYNac&C(;u_Qp{Mh9CeO6+=*4
ziWY|FCiFgF|978@@rzr@`vd#HHKt|LYwGc$MQ~muHpP6;jqGz+J3_{+Z?B@1IF|1N
zwN~ObcyR#5t#1x9+}Y=ZFoB_C9^6@c$T2T@HzI4B5tfWSV<iKrB!<2JFRW0KEo`YI
zXK8sfW-Sd(Jjn&VN!eAbVSmbWTt!X}!JP!Gqg$N}+$N3>N&^1bVW_>ryfeHKk6?3z
zYi}*E<}eY4f5K(VPz3&DvJjWlb2pInbaT>S*Ou`@ST6!6aoe=jVpZ36gY;;jgy%ll
z)netJ_%3f5V0(juj*}|N5k@XT{PL}68g~~}JO97E#S*n0B<Rh58ss4SG42jtEU$;S
z>i?-5wS`C_1*cI6bQ2xIgRly@GhK)yi__;l8qdnostMzyr`7B4GK2VkJe^Z?C0!e>
zW81ckj&0kvZQDu5wr!goJLwo5+jesH_m6YVRn1XVS9?^|9_w9mK66hP2R)@uPVnMW
zj16otj`b=7OL92bXD^+EjDtBLl2WAtFRWS!y2N^+RFTV-En_nXF6gm@V9t|YZhNFN
z^)FN~4q`=RcLyxG4j^_*?7h*Y*w}P@5+Km%$VL>AMF`oGE;8djFjOdBTF?#L2}uP{
z)y+kNdxLp77nXdLAXyFtLn232l7;(6mP}VPOHo=4IYqa`=|~7#e?#Cemz81#diNO&
zg$O2u2P;1NpAA<Lj-&<7*GDCOw<8Z|d5lN6KEI$X(qg9#+gE*Q9ZZSzQOm8TE1NfE
zSKb4f`SRRj)hYNB|KXvjeoOh*6NZQT9T}?=7KYi&&VH{q|HEB=LKG{|j%x`6AscGP
zFDLZiq6OIkwsMpS7@1sJ%Nc`||4UYyGaah}RQrB3-pO%nqIm;@jzUe|o>owJ<F}OQ
zkz9q={9$7Gw@Htv<t$KPW!lq@TNB9!E6(M!{u4Z)*AMIa6%(v>lCK6LW(FyvPV55=
zI5wU~;)#)mI667X#m95+aK5JW3I3rfVYKErgXR3KaTYT@2p-{--FGM^dPP$CWm51a
z^YeR<ZzCk2a7fwvmhsoWSBqVYr*WCkU9l{gy~Dow|CBYgF0n9H2oE+YOF;#<@F9q(
z68ZL%Ix&5LS?7$pqeIL>ItR>#5hx6HSZYqMAdji5Qz!>be>66HG#xB+7ldSTPcT)N
zuo=(@kTnba)T9C>xw6r6Mw*$^JgxfOlW|sY{ahG9FVfB#%vB#hrd;xM0ljX%_^vj|
z6~e~Ulh#^w?A?pUCCQhm`)g*vSTu>1MA2#{zW+N9J50CycT?amMxq&^?>Cnvft+06
z|IAsS{Y#;yrGU(0nLOTl5_%V6ftKuGWz<(OTD`Cz4I+G~8`&`-$=RBq<``4z0R%}B
zdr<;nb^sy#Z)j~1UYazMKj~hd+`pXsn4(%bm(ktvtyd$ojdiG<2z60_m+BC2Kq$LV
zC_y5rOA1shR$u0|#4D07z`N26e>220%r_qAiIl_socT=>E4(VeI*1&tmE+wn1aJdN
z=Q<7(;=lj0<%)dMsMW!>IRIa}v9IZa$fhL81a9I7UTrRDW0eHABx$lIUC+|{f=Xx`
ztyfU2+<>R5CaAMVa(}!u0e0z=<7{uHcd{D$^?Z8VDasNF^7N`4720OKjk`z_*~5IA
z+*T$S=%WbDP%5)7+r=?C=D-%&y8J=$-%lg!ej?<LbrGNbsyuWO+~1;Z$1CJI^GVly
zM0M|1Rkw}mO&*U~e4dDs@O`|N03x7RfJNAADY!BYpy69>qoKJ)xd)M`LOFGG*GA0h
zE2x=W$n6D1Qpk%ur&Y;y$3(wg(j=^zJ^FgL2gY%QR+YhVB}$K5IlMXC#KhG&Jx+J8
z2BiDfr|C`-ZH}99Iy-swJv@C71t%k-dnG(^IY_pPF2SYpA068vy(3X*w^zgg#N>l}
zpUSa06DgXrZdNtQL)EW0S2$m}31P3@6A`yt{G7NTMf`8k#!JB_Sg+zC+UZuMB)xH5
zu@I(bQ_ONMhJ{i~B!~$HhEQu6KSJS)pQBV3n4t?3H=kh}&KW1dD$oP9>N<8N!?is}
z|I=kjtsPu<PIn3X6~qEd9OmRs!g<$?gO&ER$js?3N+%<TF{5}HcFF!k8Soryz<oLZ
z6{XV38k(Fy+xdt)Kocm*0MBUmYeA*o5OS$8&<To<tz-f7GmsmD2>~w*$rVYmn2(t@
zz8GoQ)^jua)l;h2tu^wkftKAq<(ebLVX}^VRR{}0pW1!vS0A8zgy2pVt!l$z%o@y!
zD*TPli7ESF%tV@DrIHBoqChN`xl^+o!$7L*u&Dq+TXk0-6~PSQYqQ(YuY%)5@p!(!
zcYQkRhn$I;gYFtu5Y$l5(1>(+Em-rlw!@XFh<W=&{Dmq;29gw~R#(?sXhK9bLV?4_
z$?B*EX=Eg$V|D$ak~CnBy+b0E`vPjW12}D={z%dN*_#0fKG3?pJP6lr$yllOq5<Sk
zo6g1;aYWxy6IkCDk-mmI95Vu)s6`Wy-Y>`#nfa6R&q{Pz>!l30$oWiU*-QIxeX;LM
zX>M=A<LwU6vc4p$*Q2n#?@j=qpXhoa_U2;|R%`b|_B~#IJoct}NNeN~<RdwW!8v>)
z4i9>X>Wsu9%XVv$wLC_avzJMZ-Tnx=t3r@8o7W7e_W_vmoCPQ(sKtXHc#ImfBMxR0
z<{+jx8NnWCtXB7x+jcNEt`<vc&YpF-2Wx$o@C)?S(H;ChO3|gvqId#;3xl|bhMay5
z+GcWoX^5Mo`)6hr#LkoILYXBzI|{IGOHN=9!F{}8H;#IGamtRxdLEl4+CGBQDj?DB
zRcw5EZ#qYJAkNWb5k4j1$Gzd&WP#ArXR>wL24W0egsX?ekrnGb2^kNWB{H7n1(K;G
z?Y@mW<gk6=oe0S>-I^D()3qAwD_w9R9$OW=iRxM@U68<E#1lX$5rM2ndkehHkF!?t
zJ~99?xitJfH(<_JGpMzY85B!mZwP84_NEwNfOa_#o;Sh2@Kt0OfzV>8`E!$lay1`>
z0e1w>tz4Alhw<bR-!$2(i&=+T>wm4JuEiNs_lBs*0rL@R2R;nbqI^*Y8uFrHtUJK-
zz^KSx^>KIkP2LK2dt~v#SSaB%j1SupQ!>F#4uK~Y+E2vT#buXaKV&eGjy@LO#L8U+
z04*BIAVM3yJ6wKc@IWZWL1c)ElhfJihZmu9%cYmlwsHFQzuD~;3ABjlQ*;QZS&{pZ
zN4k$o2Ok#6B3&gQqKYPWV(38}JY+gRJ%ql&(rDAzAVEDa`AJo@Nr~O%JINaC69nGo
zL(_0uXjJEut%e`c<SiQ6BZ++YSg)4;4&_V7t3A()Zzwk8*!zRcyL3=gSFC#?)zj2p
zZnIlhvEqePznf)`UiGwF=pq@<qkuq-NUZeF11Bl=zRx0%7DDmJ4}%G9N<9P2d!DF9
z8#GLqY(4~{EBS>4xY`Z^zJ+pA0TLdADMg5$IT2-vl0q0!3>Z~Q$B^Vvk#|TG;};qY
zZN1mt@J4_Cpm45C{%jODeg7@QL6zmruyC^!ogWxwTC398q9nF_3IjwC1Mwf>vm^)N
zZpPB7{Qnwjk^T#SlQlvCj0^sXGWLbTXFx|a^Q?GH`5R7$i44c~RK=~CHNCJ}{0f~c
z?ZTPWy)Fl_jT>yp)ppmR*Sel2qswm}4^~VDo~#_g_2j8IP}~nmTM*k}hX_EqrAZx}
zklUQx7r+yI{Z96wNsnxtRgGZpEbT%OWhVBV1{Kh5p1Zz<By(?oQ);Rz74`|~R8<CP
zqs9D(>7(>SuBC`OG6!6KJ9o}Fm>kA2sAtZ{6cuG7Bgv*6x>B++IzXrQ=%|yGI=fOh
zz+JX9R|;-d9P}y+UeMZQ;DOg-+c@-p!<!;+1?R6a1m*~#yYO}L3T!yQwr3wR$b;)T
zVPTy6q<G-p&$qzX>LSi7N^Zz9DB@u_;I<z?2qjV%AU%Y#KVlUxwqDKNC3R1~1R}Ig
zMj8KZ4bwd^fFrv~rC|f4b*@Vj9Dvsb92Z6eNPCA4?7jf345s}(#D-~In3meIiafa*
zP+fi8^ffMrg(aVVy=I?crLMx<G7B~@x<L;Ki1ZBzN3INGrf!|K!rbOs6^)P7Gt2Rt
z(}%2n7}DN4Aw_uT!jj=Nf>>`*EUN=l(_gxU0Ytv?^QM2Q7TyfYW?#)+*pd7IRslGo
zp57PUC~)iUJn2Co&S|IFO3s+mz_?H&ayw<}E3z^7F%(d%nKwg#FvK0m((Dx+*^`!F
z4<@Kati3qUFfFbKVG{@<-Xx64DJa3KnYy}wl^jPF9l)d~{573!htsnT3xCw>OP^CX
z;+G~Yvi>jHFJEl*M0jRT=LdIJoj%@=ie3wzAMHbpRI7D4LU|)g?XYIHbAV^yP$UWs
zN??^|<OB56U-<K%HyctEPj2gsw4g3cGgVMEmVX@zQhIc(!nEr(x~&^@OXC9U0@rqJ
z8X+LT038JI&}nSI1U-FYK5UkdT2FyvofE;5`FT;TlM;^Goh;=bj<XE#*wt}~1QjNj
z1$t=nJH&ogf-?jO7jCBXZKRmA-tsK;ik(%<ajAQWw-1$c%$MU;^A=}&x8Hw-k(^?h
zdmj3rf3w<k#)$W=BCz7^pG4o3ewjUU@4&*q=`n8lgtEJSsO+wo;Vuek2yfa4%`{i?
zxy6B%&L8FGNAReeMAE>>{ZmzN4n#@8!O7~O&W9>U;qWT1*R6}8)A+@T)}dPfMU#|^
zWFY;UF5!~ModMY(`Zw=Uo^2RNeP93WD;I|6XLAe<_Bgqs(dkHBfSVCI^J5_Wr6=wf
zWq99ETm)@F&1{!xc<;R{Zf^fYcmC@`7=!P%_Kr=Uw_h|*KtIg_2T~I$?2d_sU?sdJ
zRD9^7>_e-Rr@dr+=)SC3%(%dK=!vs3B;m{@*$++rQfw1zR}c|ckflsfjO9=4b_9!y
z5^5tbNnZOt5TclgWw14cAvTt#%2Qny^;#!L8gLWgp8-?3?Et<8mpwvEHKsS_eZqxK
zy9m4a{`sOwh|Pk46+%PYXxmeRL=Usm%mcB1lPmL+^Q;bH|A7B>7qO}G&1OS1;buVo
zYS3sCq>gzxh<1E6*c}~WS{TlpY9pa8-C=HxcCFauSynn*VYOh`=~u}^Aa_oVq1lP?
zq1Y^%Y=6VlL9^EGo9Q<)RMr3~)Abts!^oz4MO75b`#F!FHU9(!fRgN`U;V?V5IqUD
zjEvY}Vq%Q=*g>RLT6KMMRLDa@hqdg=L*lbb5&8>nr@F~LS#ZX0kLGlmaCl*4D<bG6
z<WsTqXAOe1<m;Mfp%ZV@FtkPBx1A!HxE>ZS_zDIR1RuROObyo!JBlV~?$kgQs>2S5
z4VgHrys%Xl`{p45Cv@yBmtMDBcn~3AFbhCo0tT~kt}cL;m%y8J`*_MAIEHi)mdwYs
z0B2M!cfM7&kDwK3lNGMIpLigMUnUe1DIw1319CxVA5Ljh8@V4klwQh3r#ls%)`21=
zDWP;7K8yqgF-Q8Vr;uA+Dv~a!G;RVtv0+EC=vemvNz@p`wI$IlP68&CLeNVfc+hL1
zJReeMqF{OwR;iv5CutCa8A!%pg9J7>ukx*18Aduz-%9CvaU8v{j4iT|_^&mZF$^i&
zRLubU0gTKInjoR`HIh{IH4<a+u2lXt66q+V&p`~OeO_;o-Gq%Q_hJq~Lu<8;d*eq4
zDA#J7v6c}WS7OBp-%S^B!|pY=%NyH70TFX1C=9Cs4CYIpV0scA!U*>34>TRoEGZZ_
z8aKJ^e@COBZiJn8gk~BkBTP^sb*jaq$N%9jL1x`k^@$XGvtxw<Q#U}nq&VtQCd*@Z
zQDAP`q$Je$BnyOFZtb&OO^*^A@|nH&ZpjTaH1hIByK5C`Sc{n<I%MRnK9~d3JtgI>
zmP(+0__9t&xJs3h?<u%Ol1a(?OwQ;2?Xo^IegW^Sy;#UUY~lI>PJ#JK#$IENK#Vq)
zLff1JL|G&FO*Ob$NHXCJ;!68KeGPFaVp?o}Oc9Zo&Qd2sbaYC4Otf0!J-wlppjwIN
zeX*kzp<)y6E8Aenb}~LbQWLIh5rS)@8>6X*<_XUKG@E4DCF0|u#9bel{WB{!CQPeY
zwz;b%Qi<QW2H?=4gwo|(0c&7rvdg6U?so%wNhA>)^hfc`<MlhA__JU(M!Nsc%g^tk
z>PNnb1<9KT!HzvVnC6JpxaEG|+0e7DfX-y>Toxn4SS-M|^XWhT@gVJ8M+ab5^>Pr2
znwSR#`m1UgqlnvAoF5h99FV)X;kr3|T5}QitIYe`(5aMv!^Qe;TF#AWLdTTNBIE|q
zyI}k~Y{9+CMMUNlHqf$|`v=Apc%gt}<MfTWybQ<DC5KPoHjv82x(b*Bl4C(s9)9>(
zFT;93&y}gZE$`=6<Z2<l@t@Tb)K3~2(Aw^sA_1fpcov4{1Mdl9!gB=`SDll5DW*ws
z-h`8)&!dv$DC}zIQyvvrK<8}#MYFC2lzZI+jpK}4_(rj+Mt5zV$NgHz+WlLR14Wv`
z*i7vE@o*S_3`T6l3(e87jQF<FP4xiVIsT)B7<`3VfmP6xcis;8lSC9>-M09VL&q4C
z&ytWQ>8od6MC9IhC$cXuekg~N##&L)Fcuqw3(ehYix`J^>{O1oB@fwBZ2EL%L|X_R
zYk6Nz?gBC>F_fr}6nM0B%g^Y2qDeXz3urn-hDfm%7{TlkbmQ}{48%Xr$~9MAVyk?%
z9*yp}Z-qksuFQ#a70<sGlwdXoXOHljPxB@D$7I(TalSrqDn2;=G>4vk&I$OqJAFia
zpc?iltqa6nngrfKyfBuNRvetb<mt&961E4U?3*rVnrv!pKH=#2<@>~5ne77VkL)MY
zW2GZNSD>%cdo;v2JWmHkRdO34N&7441iW)NO<*B3%fX%6sP*TED-3hFoze)i;O`b^
zc;NrV4k=9D7i&_SY$N$K$>a3k7QKX3d0Fg-c^ayRCg`Xkd7a|o*FX`sM|<uL5wiR(
z#<F6Hgf!>U(_gJAAE|$5ZZ5o6v&8>mYYsxI0dbO!2ZNLv^#0W>lt~D#8y@Rl{qpX}
zCgz_a=T_~4gn0cJ><#!S)+;;VBC$JUkH$vti~r78>C_`yoOlB|g8%HMf`mdn8`K0?
zM?s)uGYk+Lj0X|E%kCgsJnP}l6{0jVVpO>!re^qc7iI~$YH4EG2A&R_EzouI%Mx{M
z`MI!-i=<C;FsbXg`}ya=s1x=&do85<nHY?VcoZ_Gw-w*yJT}7mYV5#taS8x|&Wi!g
z-vQwj#-#Tzfib)XG1&70867D#7C~5>S39YraSC%Qvg-6U7YP?8#n_{=vC1t?NAlAq
zq=im+H*b_DcthJ-vtWENB-jO2JW*H{>10M<gk3e>8$K}>7)H77<<JBnpQx6+(>cy@
zq1PlT?|K9YfDQTnnnsFQ*DF-{Bo*nXC?a!&iJFu!6!1;L2vU($RUaMBPYg?y_!!Km
z#7&BjDc<1$l}l(M_3HRVad-L!%Gw~7nJu}$U;{MyL)yTbHG2?-9scoaE27zD&<HEk
z=rr}!i~%rAEvs$pUQ{>*#xYV2i%d8vR=gTwg)_g?l7lLoqLg9s*~f;sNq8m+i2ilj
zjPZ)jWSjbkJ*ZSziv!hV6ZoYL{`l6CI7g2ho=m%%ax<2;`=xZSSvN^;=B;q@(XO|a
z5%az+TK3|4yjf=-q-a)dj|}Q8pS!~h1MF2$x1F9xB=jPgi>D`izSTa?IwW%pPcsby
zJ@`>fbI0z6{UB5_j4GtzrX}@(!l;_=74X<P;qjK)<G)u*=LgJa*5X>|Fe!s=d>Xfl
z!fZ~ui(={i3;y>ymm~D>JlpKPWlgy(lldTq)rd30t;#fny4eXx0PsEtWaKr@Zjj*E
zA{WQ_CrZJCrNYY+k!MJXR@H-{!Z58^Q%bu8G=^sX&zv%F0}x#<J@smvEZu}pu`#}H
ze}Kz>D1Z>6Tj|tMd;k#hx!BBHMJ^1mZ-N?Sr2m5_#Z8(ILD`F7d-;%yv{o^ZVKy6O
zZ=$d+9xxHr2V-gyzEGZX+AYXMi8G0o`$zElN{R&z41bOZ>B_;{i0JftYiA3b4#xC_
z<Mbd5ML10<7zL!Lm=?!53I(LFxP+LIn%D=2g&*~()XI6~{Qy!g+2wjJAtR@0G54bz
z=J4ZU4$||xhAeIf6pgbh67B?aS~Oh5ysO8Je?Z%m6NJ!A-Hz42TE?g~A(P=}xw=JL
z;j<b%o?+4Y3(rdu2RL3E%02g=&*<BkPcH)qo}2a!_E<TGlm828&~Am3uQ%#R`clF0
zD;cM>@Su}qxzxkYG~W~EL{hS1LING&7BU%mVIip|u;AiEi=9)Z!e=HFi~F;pl0C%g
z+9NSPYMx@U|02`+)NU7n0DO%<8LyYkjUa+z856b%DH(m@Xi~0`DLZ;qf*w)v@rEG2
z?35xCL&-@K9nODBTzc9C6A{%d#Z3M8Mjg;g3tfQm+bFg641W50uu99Dh23?>^dxoH
z;ud)|Zhhti;7YF{w;gc2JiZqxvhvwDNxVIoa9P|IOu!^&RDwvgf&!WF^hjSIBjU{7
z48MZD%YYJ8zOzFM)!P(ovC70b3osMe#3$#)bu9aaf;;Nish0cAPcQXE-4HX&#ChF1
z-$PjoG?p2*=q4|to!W8v)I5-$<1zH8G|z0i7o2I!7{UR5fmk4qsy|Z5?@_L4bcdXd
z7EJlQKrtUU7f4$qsk9c~v<u*9gmEGY3kIfzyksHWoCVLnFk`m6pl_uk8X8J9g7rHZ
zdSZIfUA*zJGE>x8tN{cc#O|(-`)w0-ie=v_WdiF@ly2M{>v{%%)0<f*|MzldLQ!V`
ztQ3T`_`@5C*FZ7v^X#RZjpZSe3syQQq~pCc=5wWlQNowgK3ctbb8`kiG<F77HTrWJ
zz$QU8tE^<<N!M6UjNH<NM$vu}=}aTyl7$?u7%C3f+}9Wj8XyEVeqH}IHl+oviuUl!
zx>rf)M|JiSmufSP1xiLdJtLOC=EArwf5c9(yS`;lZccB-PJR|+$^8keVXYs0-+8G*
zg+)>(8}o-w{OY|2CbLWg!sa9{g-ON;(1b(c=<z?%@pRDJGH-F){L-Nxj#A8j#a5Kc
zN2zq`dR;hYIMqh3e2wB#1-fHTcd(0AWBfb+X9%%ZAOrkJV@T&XaUK=1AIn84cXKK&
zgZJuLMhgQqH9sN1aT<*>^lw24Xc^1(??*gd7d<n0?CsoDHF}#B)CS$%2;7gZCH7xo
z;pQIn=eMSh!b@34vTz|l6$;^S$j?vXvbBgtOB%#IaEg0TAXoIxg&v&hUxx49c%8k>
zx`46A;rLBY7x@doffJ#sguz=&mCD}KzTLav0k7SLza_DA`#ea!(DNu$2Qm+rV`Osx
z3iRcOSAfQ(zKF<xvu8$s<g-E*=*knI#1@oc2yPlhQ+lI|O2-dU!NglYJj@!B^!Px%
z&R4LJ@iUbF0)-|A<CcAME&T%8Gc~61fSZoQ`Hdr%eXm}9o6jP-0K;)qw*p>Vc1w@c
zbPBG|WQ}G&I|REGAsE8)C|zJK3STl#?bz0%v?Fwy2l4}#0<IseeeE##!TUOvR-VE)
zS@7>9NPyieg?>(o+e~pUUJi+_ahc}TWc4@IZ<#jSo@B_H@xIdsb*87cqPcZa#Rbgm
z4kb|?q@qw;s-<~e>w*}<<+M5F3?^6s8Vb>N=j>=ya}#xDjdC1IOwop9vncV{J%Jp(
zL1X~AUWZyRWD9`!piJu!H2w?Dd1!-g6qLe=I3c8Ag5jXL>`Bx#oKZ@P)wMtrErYJd
z9v5(iCIqVo7Q-tIjno)Za2Hi!O&%z?Ua6K31ahQbjVHL}3^q8OWsS=me2hbdrKMsg
zk8I1=NRBW~t-FGVh@dx{;xwZN>UKZWBF3~%DWa!H5JR?~M4fbzPm|<1rJvZaOMk`q
zFW5`B@0dPHuJ-|BbC>><@zqj4Z72epaC?gVZv9ZdZ5T5K?HHzFLfh|^DF-e*E*m&M
zoZwITp6Rb&I;usgEOSrH->rgA;B}DI%wpvrReEZMAQ>CzrT&H>P}@<F^eM71RKUU>
zBz<m>M4MccWmlT(gp_IfrD-N+0W}eZcRS{{bE#jA1i^M|gt+AML*^sDGm#C8wASPQ
z`xghS$WK#Ky3PSBM!Ajq$_(%qkWpee)2UmCI(6{^V6)M779c%jOTo+|K_UgAZsBq^
z7L|i=lmNP5c12LHPc&}1sAAVM1A_h__$4C$&-w2cTW^nZmKgTrh=MkGzwMTZ<;wbf
z*T17H)TD7U9X&}g`+Grb|HgB9fyM4F2WY+%V^I1jIo%D>f5yciF9o5vG?I#>iz)95
zROZDw-uX3iPN}*UUXIR7o_c+mzzM)r1T{pQFlChv=J>~{TmfQAhzZ;k<J{rN1*pV<
zZAGUNa_>>y<%#GMfry{zLP&5B#U0wt0E{4iybBCb#0aOiQ(R9u{sWAPOJnU$4=z^^
zw>P5}fgs|VMF^gop8*w7M2@0@cq~1cyA__xKN&hp$)mQH5?f_z{3Wj<Yqqp3ZO?n|
z?fCMyJrRH(+J%BdW%@I6UA!bttu_Sjh%COm{A-WvRxmLq`(w%{&a7hO#{-zF9sUAS
z;i>W|hQ|-Nzk=w*{t?;<0@=?pio!QiPR5vm#QgK1A0@Y&%$&mW0(lIZYN1n*%st%b
z0i!HHR(%V;RB+)lU$89Z*dZv%m$0PZ#2)M)_&&%Tb*_`<&;fmq8+;86d+uGhWwZOJ
z(ei-)o>l*DEo~s$Z;nS)8&#&!u+7`Fpw#YoB1K&UwMM9#j~AEY1x(5jk_Pjjd$dTB
zhR3rw{(bIu_=x=~@(hPzF{opjE1fN2Cd4R_KTy+wi;{CAu<I5ORA-%6O$;{-OmE0R
zwKyvZGayIQNY5%o^=fRv2QECCYH~XVg%?$yF8M_~FgEH;5AN&)Ri|<GZC|PdJ$9G!
z1?^V?|G(Ee7)cx8Y?4dH!Hta#<tu=yR)u%=^<pgL2|AKAG;lz~N~-`nAh$>S9bv3l
zgz|f=(fzJLlvMa-(XB?W_a5~g4tk-9BzVGKvOzcY+VbcKI7pUD5DXW(3q43y3we+Y
z!aB3Nc!?6oKIcqCT6MB@frCY+HMWoVNp#0$1zhe9^#GPDvxEBIZk&81<FIL2UTeqx
zsja|^gZZ`gpRg8k_M_Yw{c(g#sR?n(rN--61Y4;nalv~LRvnTd@Da8o!ss5kD5XEg
z*Hp``KTDk)+#Bk8vZ;+S?&t4`+>Cl#u#Hhaz`H)SVHvo^>~{hKK9HN$WAgEXn0Eg#
zAL)qt22da40^qJ=;wbu;t#a0xJ;eGeRSH~G&PR*ngJ$_uPw;{GXUajoIA`AC47R_#
zhVoBF@)Zd0vU@vo9{AE&?O$S=Sp|i$z>Ig(sg4TXe#Y=pW$21@KY*}8auNRal3k!$
z*xI`*^DJPjnG57ENNIOFOPZ0?`sJdK^iM!ydbo?WGvCpaH~FWHiyrxzyR6&z-9#dM
zI@$g1Imb2KA;R$jw<uDLuzgu#o*DYCXl7djjyjdiO?4I89?XswK^slXnuZJ7EPR-s
z{H2_nDbzsi*r}*lHw_moCri4$;u7wNH|hIg{uwzH8Y|et6X*1)n+kQ#966mILYMNN
zng{YOK>?l>PF2VmXJl2819=-Jf{`nejxm|0oMpQe(zI6`&B8hvwNWV@c^4vraf9Uj
z7{q#PXl?z$r$NEz3%ohv%Q5;Ya)FaZH8jZg^IHOkQdZ3TxRIjmzl<eZ1o;-{1kIJ|
zHgyC$UptyEI|uj?zlKx=ulwXKXCpb(Kv}z4D_ts`x><9A7iYiF-ghshZ2^12yV7mc
z;5Yr6q@`P>g(xksL?S3WuLS-YE}KwrkJ=Sv$M$HG5Zg}886U-pv0`Buzv|T8Wf^@v
z3d*_NR)Y2=a<JeM9Ko>_WquDq04cT%+yK#n{L<MaMQbS-$St?vE}t2#8W??&J!z3L
zKdlncGUt(J5&3YH#|09k+=~M@%<Xn~!{00*a0S+cBsdA>De<qgjKlpalKwYO`;@H2
zjmlGV_xaf-SX)3yTDYGaYHU?KI0;qtjd8GpwOkE_S27f)ZaY$x|GJ9<)*|r1Y$x_J
z@5S5*8rzza;M{x<%FIhGgJA?rr`q^}OC>m6Ewx`+q9PZigf74(*pgIew_xbs1`vYN
zZQ#-ecWEIKB{d{sL;JJ02@pcnyp63Z;bstmlwP&irVA1%v)&zXg_=oxp+wys9KaLD
zJ?vAg-Vz+AV*Ho*pA&?&pEMHWktWq8v$RQr%+77m<!|TzHr>5T6Mk8_0GNo2Lk~;t
z!QWSqU}|942+sx@f!|9R`kQ(fG)g7|Lf!FgSzz-81iS&{MfbG7t=?T!)*G}A>Sxm|
zH|=R~4IpjaQ9Xnf4i~d6jzZ&lCP&Yz^zS#xw%-}}0zw&%Rw6DZ2{26-4*5+rO182l
z5IVPxDvQ0%EJ-#J9b0C-BpxRdM1Qf{Uq;TEt0-}}TH)61I%YY!IT1Y)S3EF2+)-3`
z!CP~A5~f%>k1SIgQ!l|zMhbKt6o9&s=oy^)yA7+sU@L9wTl%Y=i$+b7Af+5@l**TE
z$`ri;2V=~T6;!aVu!|QF00m>H$H%tD7G@6r-h?BnXl!Htm2CLrsnB97sHp$&m7o_@
zM8g1O8~F`Tg;nJfb<a&R7s`{)j^y3Z%^?)4ouM8AkXsSev9DO1-*0Rj9QF2nno#>&
zYw%B$?^AtUUnIy;K6%CYJ%;Jl+Ys}bD13vB3Q;S$&j2I<SbH#5XrTs4f*D}YY4cRh
zt5NGO#3x8XPK?XW-uko!trSs;=A1ajv<+=!N7-f)<!`LtxaWePRpe=M)TE2Rf0957
zGkgi~tLF3Fp{M?*17E$hOp2}v^DKPh$M$6_`R3xtpS{8f+#k|Uv^??U(Zcr;Z)YCp
zbP>C~uTZ{touPAn@CYE^K23b@w6m(J-~4?QAiwU+u6dh1DgWxWU!qx<xK?g~yi&7@
zSq3hQI|2Jo${=GHLVem^rhy3%le`5}pXBVt+G+{sD|`s~%sm_MEpH;IZGlgd*)^79
z+_yS5|8p<MH%IvyFKLj${e!C~^aq_(d;^Q&F5bI}>^H3)T>2~I&&B8rG(@!GIuup1
zkYnCxe&Xc3AtvM=b!Ag`V~o-${Jx5^neu)=?j1CoHLe`?t#SFV9f!TKv<Q698nx4=
z?nw8YB=2J2Y_`#X0dVw{2B|12^mb)zBWrpKG4@B5feB{4v-O0tZQs(urqz1^fFOYP
z-?L6`LW#BWW4xIeT5kJp<Q>RDp1cMUR3a!9!eX?gAQlV}D{MXSNP2t(WR<7H=*uJ(
z93E0k8J(Q;Q1wa99o<>s4S9;aTUYUXs$bMWkEwVnNMyDE!-<3P%d`SI+}L9U*3OeF
z9H)l6yZN7KMW;Y0u}~$-=z;Mq;UpM#IKMqaz$&yKx_vnL`2G#|9*pA-+=oWApQ4Dn
zGn{!vr?ADP09MBQAa>1LVU+M6nw-JK5x#j_@gk#K&v=aJxe^gf5khH)adI0(|0H<5
zN&9iKn8J8zcViK=q>=fECZ6YAhV^-0#1i+NCM9cqFZdOmt3D<7S0l654=c?u_HzXJ
z`-qLNtyO#oY@8Dv_&y6cv#_c^nvi1feJ92<Paj1%pTDrfj*VyVcl&XCZ82^53yDPZ
zo@+b<8+(zI#&15a51M<C7S8>Ala;78VUe%4#|Xh0Hk07+xsd5Z!+Yy$^*xmngD$5c
zJ%MLo1E&pz%|vUk8(<T@l-$L+;6jOzdKa54^{xXNuO+-py5tHliG<M-GY9|ObWI_J
zkeJ+w_|oPPsE<JtEg>S;?dmy)iF3){u#?+b-UX24dc^*vb(@>Yh|TUs?K-skG{#Zw
zEk=RxqxbS)hL2|40<2yaiB+2+eIDSvR+&;66&oRS8Qma$YyDaDj@+QA%?I`=z-Zkr
z3xx%5?)fCPZdNLv6%`Ws5lOf!t1i{mNy19`&7ntcwv6+X2n?1x+aMv)!cX+PiVtSO
zZ{Kz;EMT?!uY$)T4e6AC%AWQxyH+qZ!XwGyI>_1+k|9M-!y2P}%&yu9Dvhh&xXdOi
ztIlo4cpyLJjS$oV=XDD<*3Qw7%}!VXaYL=x!UWnsT%Mq%njV}(KF=okM8r>KaC4#>
zGj;bwnGgQLMA^|>PXU(&;Im+^<kWj|{e=OJoF4sGO#w2}g;Mo^)<qoRd~P^%*Wys^
ziPd3tR4okQQR83E!6&K1ySED<<Ow%Kgx0%Qu?Xl|v88w?l;Kcm1C_j2qdEfpk;fxh
z`}zxGmC~WmLL59J&@U+hhx&v~mCfc&jMvL+;4(~cjA~ieHosGFWqW_~GM`l|0@HGW
zX&IZjkJ4h-S3(IYaagOncxA`Rpi;64nW<s43%ByO9g*ecm*ZC|xC+cc8UOM{>;dJ<
z>Q;NyU5OJgBNw57N>}hj^xYP*fp-C{btj}RzT7<c@~entAWsg^wM{?z_S?#(^y|u!
zR_Xe(BDfoh<xc;v?z-Y6sJRsD9iKdxI2apX-KKZ1c`oi6xaHWVk7rqBJYsc<07yu^
zy`mfb1E1foh=eYmq}O+?fYr$X!H!iyoI<<&GP7hZ!hxqu;qN_WbjkXY?7Vt)$y$r7
z;NJ{3Aq1U|4GD8mPnVVco2;hFDgR*8Hfp?`uq{~>ReL#Q&9a2mvNn_&TxWc*{2KD$
z*a<Cs{QD`xvfe&=0hVjPKmjRIzj9^&1n@mCOKi`L!@mVGGDZra>$a5zhH~SY5AZ5t
zpG$Nk%8Y*D6%ez_6G8YrXJ{UbA(}?hOJZ#EJZz>ptS~QBT>O~V?T1OUUm%3Ey4&m)
zG2j4d6Le?c@#<1cq9+?7jAHb6sy_OW#j%RSFSBT%NQxMdIww(5XTKIpmlzU3IHAJ|
z8ZsJq(o~AnJ`0cY0152tm!zE>LJrIz=Qhw+NpBeod{WKlJKS9z$Y%{$Gcn6rXX%_M
z6R1B9Nl32F`_eB-nai*@LW$n#Ro*!5f}r4H2GB81Yay)F9+yLC+*kGn3@l1mr~~`Q
zEQW{rkj0gXes8&{fl7T9MyLavUiGiAw&i({gBb)&R}JtKb1@RqaM*V>fErOkN7B=+
zb<hEyu9;gPz8R=RDPz}G5;qR;h9T9nE=C>saG3gyyAmVn1m8#Id6&ZA7Bhz_AvBZO
zQyj!dRH&%!i^2o(?)5FVj!ndc6fAfv6McIABal|DbJeM<9ON6Qtf7Tgw!RZ5-AO#)
zW-JNDM1*#Zw43!g6xseJ6|^W>#dCABBsmgWQWs6I<P}gZE*)E9t$VAxjQOa_`(s7s
z2I=r}xnGcoRuQzyM#)Qh#j7*4Bw8lxDZb%#kHw4HZ`#m7_s(uOHjro7abEU|s;|_E
z?_E0IQf#B}NhrT#{~|Fe=0iNc!<8@kDJq=iQJL0x(oyQ+S<OV|TRG=Am!r-h`tNVi
z3c~ybcwY4KRump^+ImN>cVi7ka`^NQX1Cs;z|<edPB5@b7S%%ktV$S$7cgKMS;Zdu
z!tO(3po39~dBrdcV$yjFxVT-*J8iWv#snv>V3G02L?&>@snV>_ZLyKj-y(b>=-#*$
zSPdqI2EeE`rMG6pOk(+*Mjo-AtU11x)yCBfkLfWzp1v7MVHoa~#az!UjcTYN$^yDs
zk=biiUG$W)z}wtWBpHPGhzDt}z9*^3#}Z?MkxKspdWS-qSqJ``M((D=kf8xgno`xb
zat*1jgpvD2!GlpQgwSlNxNrnV`dq{yg^M{U6Xn33g(Yjt7r{5Am0#Ju>Jn71J?H+}
zi>SWr0+TA&#|?9&NE7MK91;G`0qsEiN?50qFCL%<+Y#In$RCYlZf@JUYL~#ic2egs
z2@-*x%EnCcVm-HNP^aJJ)c5}unK;rEL;_yy*uAKV=o`JW-eOF#I4zh))ld@)u`$#g
z`VUfBibYEO!tIw1Nf!M@RzV53Zsv&>#pjm|aP*2+X$lt1;Nfc<*52dA)6HUZ<mF%!
zZ|XTTZHX$iP_MYF1u-WkOux1;T}uvwiYFI?XP4PO5Rk+<Ocy9tioT;m)69TZjAa7E
zgr`|Fr~3LyOrkElQvzG@E@?jqA!N2ly3u7Jxy^<?WH8b?G7wxRLzgZ8foQ>R+!q1N
zuK0j?g*SPYpa@`UzEhuiVr5I-D_A0#Ac(j5I8PfG3v@;R!_D0jD^jf?cibQK7}xn{
z{NqI`B9Vx}u5hg#p_yNGEv(CzgvLaVE50s>Sp>OVeYDG&AXPzhpPEi=i`eIw$fO>q
z9?aw`qQ@vKZ{dZPcFA1*6n&SOcBv!^R-l%%izoJ=Q@q1YumqX^U=a=6fHqO{f|Wr|
z$uUI|rK5$dS0@;}6mZ36Yg=(djJ9ArY^5^)!VfwGTiaCRVo8B!Iq%i5_iSHTpi;Hl
z)^c@<h+R-QfHe5d&cWGN>Tql~?D}68oxwQcf|N(Ep6Q#gf3AZMneY|in_F$HfDGc@
z$rVMnb(G{6MR!%}ovizq18x@UXJT6+bj(EA5zOsU_%YnbQYmvvL67Y$#CBG;DJXHR
zZa=(`C*$oP$|_=@s|eCR*ifcA12PC85Xt{3Cg9gq#qWdv+{6$<RNkdQYJ1<9I;bB4
zW!oT|z+{%I=x?`@a!)t<c57Ej8VA?QqubvL)o;7@3diKS7h6{@=uHg2D~q(s5X<yn
znAKb(#DQ2dJecb_rl`Od`2p&Cg)}e|T*WX_oN#p)HZo|~*b6>ZnNSZR6ao#R?v_>H
zk?5%JwvyQtH7$ttb6S9HUcyA!f~XLIz2F3uTS4Y4D3p6G@cJGUMLHyPs>w1PQL>_k
zPP;IkMi|h!66S%^C`<<Hmf~m(z0sOzm-Ht}LFTXx$-^!*Thc^UH&VYKo}H6T$@;KE
zEE-ccn3KCupVLMrXT+<PNM8`oEiH}H<^hM5oR5)SDY7_vpm}dl?zGQ1tO0fM^dWNP
z{vG>i6I<`%hqEMzfKnC<Z84jt+ygU@f04eY!6oNaJD^qY#9^W=+I{whf-34$V=C1$
zjAl}x^H!=*RKtC>A}U+~hT3~mf3RF!PL){9VY3<8)_Ot?7`)efyB`4bA%hY^iq@wt
z6$U)j+nKQvTDYEpc>Zb80|#&fid6bW<sUbkEWwayk?D4{*tdanXw!qYO?pQl1oNIH
zb}8nNyHZxqUYmC>N?8;Ti<nlo0V<1BzUC`*PCee{GDAiFAst@EF^9zV!hDubJs4hr
z9U~70lLE=!wX7J+gCwu6%@7j<<=uiu&%F8abgx>e>NTpouuNf`i9&Rb>%F^~D4oZ-
zJNwQUPDBhRg8+%A+eNP5fp9)c6;?VoZsU;xA|HMsgFUhiM)~I{R}rQ$nHb|UbZP?#
z#CcN%Ra3oj-Xa8Y+-&aV?I4;WulJnIIR#8)O{+V-dW<$Gj9*EEsAzifVe8?(sGi)P
z?*{t4pnihCIG%RcglvRflg?HBS7RjVt1A<k9dL@6u5rB}lrKXIxFXIOw~)61Dq|Jm
zd9+uS^|~pw(|sYJxE-)KCweV4#N+w;8Pl#bVsBCta_AhsClX^e*V_M$;#F1zws~?k
zjoHK|UEsIFC=pdf$$dv*C4O0fIj@Q!oPmscUT}nCJqC=)#fS5A^WkA8@I(08X*c2C
zG88vzJ@_Vg;RY!`_Wc~Rq5(RKqivdg{tYun$tyHQS75bhw^d%)jGK&I7xn<O(jGo*
zujrYb17%*<?D7;?=U9kK+xXPhROs}D3h(vylzsV-5<sR$N<;SXS5^xpMqN|7S%7UT
zr4o#VupNYOmC|*`fQ2xfjuP`PXPEpS>wY6$k^wDARi-|*8ZgcYRp~}=yTD}SOk*|R
zk`*r|%H<B?B#WyCyaerXCo!_W8-r9eXJL8^GRRhsy@D~|_W8A+0Z6U0LFzY#C6|Aa
zIabf#)?XASQdZvu3b{G>+xsG_hA`L7*Z5-_XcW_%PU;jGK({^~RFazr&k1$<`Zz33
z(k}nY&eD@}lAHbDb`uIo$o`GX?FPb%kuats>vMZt3H117kQRUU>Sjb3bKDaV`dEmj
zw8Kw=1BH?gP8RJ_An`kPti!LLk}(Jzj`G@XX|e4HGe<#yMA59L*-zzTU4@uTCqpM_
z=M*MLeYPL+vn&{<=2F8oEMwR{D_4J>8Wxv}4+Bb2!&UlE`1%<PH@Zr=^FPIF*(&An
zp<%l`<-A-5{i3pHT~7>Sc7;_2WR;OAhsUEGAmr>dqgb8>U#aN7kFQu7K1_nfzch5O
z_=VAR>Fl7Lj$e1TJ6{0iR8e#Gnx&(1H@5yXH-A_b&zt1-xGueTyHb7_;#|UV{PV7l
z!4kDNo_%H>Ojg9QnWEz~gK0R==@75xicTkH7uxCUusjUAAK2~9GN=B9D+~GBaII;c
zu3SH55ljJm-4{&A-@zd^ME7tX&Pp!6hr2ip868$L2wB`2OLtEbU&WWY4*xyEJxL*V
zHa{cpq<gb0O2n{4ajI2UA@Ti%aKP3pq)P26tHu|N-b?h$Yy?WIVOjEe2gs?oCoJbH
zL7O?cjT-{H?A2Zw$;t5Bd+cHd*ugOK^sCQ6?Ou?czn4X+xRN&7TYV=h-|grbN|$Un
zsoQO>Pp`~$WJsuS!JFiz=?b=PpJ?q%YK~2fe-6Xz4e%RK<SK9x4EnhZ$+_=e-@A@8
zQxZ~up1o+OTT1>X_O`5SEo_`TzbOMX18ex%I8b?a%{lVaZg278<7jJTyD`vsc}xlv
z_CLamJDPWwu^)VcVZ~z@pRLU)`0)!Sx?7OPtR$k`tqx>jyVBWp6O|XkZP1QMvMxl5
z8=R|LV4oJLa-hSSCjrNvu;>7=V@ne1!^gwSREuy5W#hsMd1dMeEvhQi4y;OHr-kx`
zsGFaV|2%SZ%z)O;C6c0lKgKtH8S@OYf{2P12W#|X8J_{fr%-(NJO|z`IA(;7FChfE
zKRs`&g2YzxTbJ8&uz5S?Xkq!G1gQ6afj1^cD8ur+0^2H9(h6n_EbWKBk#T${i3y8)
zdL(Cc_LjqvItkElAeBOg1?3AXw}=r&LTBma3y;naVCY@aLmvWV@5MH3LI4S)DTFiN
z^kMp{-JuM%@`iJ%CA!`Xsv0mHUEb)dR*hnw9XxPfTUIR}HgP3|_@Y@GMs)V9?h+!G
zuRzMMXb_xZlj7;C+SQ2IqWs!o)E=7p*vSPpeHHa{1&m-fZ~r@)N|S%-VTQT(u5`3`
z)Y6#*HGgB{%<}M35RGVur^UMNLg$>V6{yYgZn4isQTnj(Oz~3QBN6F1Lx8%&^VDh@
z=7-Og=9{CZ5K==Lgy(1&c-E?3YGCA4n5CSBJ&r=iV8mPittAYc2q6H{1`4OVF<>lF
zhvu2go_cu=PKRg>%|sX=v}!m)b4tV(RyP>^6=~m#$+EqAHzX<0uT@B0mxUu2;qT9C
zPNP#ut!p<0WO>-72Tq}u9>9xP8zt~``3+r<d0E*fIkPFu+y~}iZCALDx=nZ6r%3L)
z#iq2MJ!RD(Kc7f@=a=rRE+66+ijeY}SS^Jo?_xj`s5PJ-1Z!9a;^>s+YBoa%G$*aG
zX;KSzD+;ZuO&b8jD^+P+YYp@=7Kxz|9@Z5tOpWDhrddI&e4(9Zv^UvdHqJ<@T?gV4
zGV$VymlLX*IqeRqpTS!)>G8JVxM@TSFI-jBFi3TTp<{)ljLy-n=f9pFlH4f{k=p=I
zp#8vUC{Qvq^up$8NnTIx%s*(vSr3v6(gq`IB>CMRw2wD5_Q-ay(1v+?r?Yy%*A$h2
z(1xD1{}^mbBI!=pKKAkX2tC2IRulI#sDnmHTF_VUv3dRx)8rx)_n%iOlfC0VyU4Zd
zez|QE{Uq>^rqL_b`l5HqC+;?XU~HY|Y$dnSifl=W(uz$u#O!ERR0<1B5zJ^7wleCF
z9B}WsDs5XL9_9{opA^ixw+~3YsCwJgd$IiKkY{v4w}k_TtMyKcf66a`$`a*Dtnxol
zpoHrc(j%Ps5YF+Pb*GWc4j8wfy<;V+(+z=$o(jNZRT_`qKtw&1O8B6@KrKaC`=RgX
zyZi$S(jDI#sQLjZBG~qXyxZ8_j(2&Sx#TRJSfo7i7D_D^&N~CxTJjc~@lHEbE2x$_
zUgEr=qv(F$pfeprf?ob16y2DRILkC+-=SJS6v;QptKBMhxtidH%$)&!?EyF%A^SX#
z7Bb53&q<28gWYI5(7%Ma=QeP(6LUpf^IAPo6uakeV6aGne{0G7)3W>`UNw2|PE-f{
zfYQ-kjwAAg_3$vDd^*0e|MI__{~t021qK-4W7^0}Yo}kM@CIVlf?(_4W@^qzLHqat
ziOi-vy+rBiD`?I>6_x&unN3G!ZRL)S(j8n{WZk6d%e5oXU|M<d=9R8%SU9cu-N!cL
z!(r#e?<@0GE)&+kbf}!EM<W`BsaG^Glr*{0;-$UHvb*%^EkhFy1WuoN4r!Ry;-3Q)
zM&dt{6us`N0!CGIZYniGB{<PnX%gJt{)NE{W~(GE5Qdo`%>iaRw_BJ>5X{k)JKcwu
z;yX-q#|WG&f22r~pvfD-vX-s)iOe%m2$Dub(QnYz0s@<(@Wr36p!+rn+={NDFHaQ;
ztA3BPMMxej&)3{OKyGX{ZwaA1duba2wFGG^0l=?OP7x(_aeT*5h!>+;I!{=42F5Pu
z>LvS`0b@EtFQBm_Lg$jpJ-_X2;iJz%nw%to3PFJ^(7MqUya=q*ardwsfG`-6DG{$Q
zCffUj2u;;66A=c!zJrIPL4%pL77UTEnm%d^3eL+M>%{BlX;NlyOnp~hT%9#RIG5rM
zcv@+Kb{=MFZ6h6wn6|G~Ff_^!w~4TL%$gNLlFf6KIG<=rXX^(rd+z6iKnabsUq^|^
z;S--iyAbGPd055bAN|R_!?&>7P~?N681_mFH;a?i<t{xkO(HGb+oKuUx1Uala=;;|
zBcZznH*(@o-@r6VjJc<uCx7%J$%#P(cBLc;E<Rrg6}bY%XAKp<Bfed+00N{~Hcf|o
zKecx~4$h$wBD57jRqi#Z-h2ERN;g&iQ+QFPvCAEJ)*=fhl4Pm8>ag>?$nv&QbLtW=
zwG%D!_9qMHr+o=lJhihcYTKZh&z5ev=ZA158hD@+igdz$QF8U15J`oaV7>cKQVAk<
zR2alcM;Z`Gu|Be)l#Rfz0q@>bzGncqd>VjV0=hsiG&y|s&Ef7Q;0uu|?amRnA3i@A
z&-x(@tqA-Bcz63<a|sgeTA1YntZwt0+mKY#IKqC()>@A(RTsiFx4n_YPQ_JX4mtA0
zu3amPEydKOgL4$`WmM7G7D4}mcyO|ICkt{kh&uqpM05)78Z%_3D!B-s13P_VRamF8
z2B*tno6p9zn;YkOe>b1$>g280oNS27sRWtzW?r(-)>ZmWW>GBI!MwMht`rvZi>@kF
zn=krD*=x+lmflJX0@)=HBGJ`$6BqKfN%;%Tx7e2j^1K+BSPfcjPXoJv`_G841Q#6_
zyeI-ipgptH7!)+N{7;qe6+$3PXl^v58!0oN90l~gTg+9NlNk^Z#n$Zo_VoK^`2%fj
z3U4voDYpzTC4{@cXUsqL&}F<AUwbK?J`{#$=IeOIMi`f8zjcmC6xCm!C1$qh_>#R(
ze_jrs<i?p3KaqW$v)SjNv4Q(aPdI-Y>;gh_13_3|LA&Wo7&U;%GI=_SjV<aKWTY-{
zRmY`hMX&k1sWk3<1dm`0kVnN=J_P|=ZnAN23gQ0bu$0pLtjrs6ohc*P@vCfE3%&y6
zGe|Mm*bc1)=DF^}LE1N)fGdq9u>OOLZVYp&-%R{lx2pewuqj?U)Um6vWC!6G8w7WZ
zp*&?;s3X14zKVBj>X8qmB{I>}eXHlbYn8B>5-J0)5<1pd%FlEtY`Qf`bH(#;m<*dy
z-dGs!?riY4N71@S_H*y|YQ}kv<@0=5?uS~ixx*iV7ON9~w!fDzo6+s^jd0dHD==9`
z*lS2$pPIB4nh>>=2qFjCw5R{s_FTc2P0J&TsCsZ}lfaagj#OfXU>hD}(Y9%ObopE1
zqU1%DYy(gXEh4txjKx)PQMve<t4!D~D$nWsSxE0m>O~@pUPU~--mf`A#=1|SLS^Vd
zrVQ5%`R-KCkXQ*g?Vf->Yr`Ij0mBEX|FNnmH2;J0P#AuILT6)YvZxMsJ=d0=hyP83
z0tzy_77V!h#h|C-tBYerNKXjPA20LAHPWiw=`8O{xs9ztu-ySZOMGgxa8R%amyQsp
zrU*j<=Wu4WeV8!2nreW%;qqnnm<Fcd+KC+#j&{)>Lvu}+pBXOHLmJm~X&LP;c!LPd
zD0`8HRT|f~>!qD`(^T9lq*zeZ9E{X<CqDy@fh>C%Nt23Vjipl&2}v=6*5CF2@brzr
zk#*tL9ow8>V%yHd_QdAIwr$(&I1^)HYhv3I+s5tpe)!XS)#<9!UDeg6_Fm5dNs8h4
zw3$*QT^%<hq+A`vh3_S!Jj+Gm*0BZS8EJj<k>!m&*e9Zz#2dqc_g90|#PU%=Qvpvi
z8`p-v=JDG^&|xP`m$IRP{hN16UGA0e)t<{MHHf9_O+AagwbT;CfKLNE!Eo{W^&&^D
zDf4#TJq?+8Dl41)xO%{LBbrNmMkSdgCy`8gW?qm|F4R((K{xHW$dyHWMSbY?LCptY
z8vY;GPE!#C>QVT}RNroq_v=Go4ulQ-eLmM=F-ty6i5ZFKB!aO0sDQmZ_%kvg$Nr5p
z+xuHa=^kXr<P!G!2K%)p^dY_+f9lwanw(D0i)4%#?^!<je9eqWytAm>dSO#F2;E7@
z@pZTDrdIty@JTpTUKT&%hQQ(FCHGozo&9!A@`<%m0305hHH;r7_rk0tcoC5#8l4vI
zWV-U&lTv$wpU-yhip%AG8R}5zQ7mxUs(w&RC#Ps+phcz_M%FvaPhG|S7Cu)3#QO6F
zF6k{ihbk>IZ-bw$y+h3)GH(`%Y;Ia4syR~*9_mg-Yg8dr{}$;!-)ml=vZXvrvgrp$
z>;pE(a?+A*@y`x$5<I7}=Vj;yRg5Ady9y}I-Bjf9h;B6}u<1d40@^n9FMYW?pg6iK
z%{2;JTaXhM%P_DQ*S~AUK!$joS{ho#4IM=tC{`i*0SkB}!2PBY{Qt8u4uX0TdsL<1
z?!SomPGp7`8NK%(!NlQ2C|2ql_2F-*Y+r`!+<&URwfLkzCmUUrmLnsnt#AL0_;CdV
zkFcO=h#W3;uJ%Tt<~dP2C3aA&JPFkuA@hK+oJRJ*dygP*^TvOHtp`tN+HX4FWUu0o
zxp7(!tPX^087w^IJ&mw73@VB5L=V6bI}tX~ukYR|d%_QWZ`3rno=-XTR@&@fc(#;z
zP``U`8oyG9^bzPG*&&1~f3%YBHGdrYBHg)oRScRP#vMgZ1`VGxswo0W3S_>82=vt6
ze0-!#5YS>VXH+{brwA!mUuKG-l%^D9#6FBNV*I==Hd)be3sIdGTVy%aaf32^N;4{H
z6eTZvLOc=9{4?kcy}thQML3ho(uDOzxhDi)`QV!;6Z1MVy0UmUj_o7mn>=xHi+$r0
z*efXrVu0~z?1eM_TNm~N@ZdaV!~Ky($-C$30f_(r8X%oekw!xa{Q>CtkZnPf{Xo}>
zL)<-RG2T0Y_Ltv(?=HeLZ`o%K{z%b&*~dGOm5A4p=veDH?riX$Jsr*9xY*YrB{w6F
z)=Rx`GD4wp++mM;Mk5e{`D?Zy8M+{Beu}NvqI8{O=WRyQgSG>D17QK|q&wsVmhEql
zKq}7V*l}?`b(o>zfstTRyfH3s1?t+K^|mFGL&{tyCJgR~Z^%$)pn20laCMjht<hSr
zc@xXpsVCcF3$7wnYS^ke%6y(WK-Z)Lw?~q`eNNE2?XJW22;fxWyA-wnF=`u)JwYxh
z)D1COf{JD(OZBlsM)Hq@h?NHI+t=-ZyzKgWoV~bd%5%iiJMP=RfF&J)%w=O?cDL_d
zZwiOi=lr;|6_0f-{<-eoi?3C6W##Pv0z}PCoOS@;E(8uC0kBsuoIG#|o!qOf-fjKX
z-A_k12`*5M6slh2APzmqL_$O{jaJyO2&KRRmFzUtk@zH_tMbp4ELv(ZVQd|ou_6tn
zkpyZ-@Qd{<)~2up#ykOE$HS^rvK`vop(su_Q^X+*Vgzf7JtT*N+XS=t@Vy4D3qS*>
zIH-zB3JiK9kR2qBjQ0t@Aa<fqPz^*UI<Jf0*uHm=dE?Y5AdXP2nQxoKf^ErgC`E9F
zic_l;<_DVs#S0O5{t8m8Qe{u?ZZ#Pkz|2B`k$l^W(<7KO5h=XxHB3boN`qm->qI;Y
z%}u!A!Qx#{PEnP1a)_22d?csvg|e%7hZ&>|O>sfEr%|GyXge`e`zYz{uN=0=TxhR+
zr*1Pzt%3Rs4Z5{VovJCoCYF^#4=rW(RcYSQ1W#&};y(^uPo6|Li8>NL6i$$G&iEtx
z7m2^J<yIzI#pS-b+e~?cTI#{v_m5CM_`|D1LQWrBxBj@vc*d7ENL0YqD@+^$+BRT%
zVSj$H$Tv08;ynrqX;ZkwYpn$=DiNt9p+zr$KJqS7r!Uj-)O$F3U*vez%}q(=ngo?m
zolbB^JtVnU(JXu;bIrP$g{BvvJpC=WmWR-pwnhXGB^!)p9Wkvm5d9I+Os|?{0fGpz
znrux}u};CuU^w!HqTc#3@@jRe!f^340(9lwJ1hs1O32@3H7jm`6o>fV8*i&}6<}PG
z22}s}*QM_jV=D7M$DnrMQ5HfbLx1-vt=4CO6L4bVTzDR>mUYV;ujXx+a{C;$#lwOY
zd8PY9vue2yO=9c8u2WM}Vzgl&k#KmbjTaOB?F~oU^DNrhl9}mO3`R{!NCKzAorFot
zcc)dnA8+-fI|<`%&#>I$Qa8DlS+jiLoS%K~M2pb}Ys#@#<%6x$5*$62w=fxk!pV)q
z6*VSgs?U`K_{;T~NsP2UYH_ZF-bd#$pecpXO8W3D^nZ~j`1M-CL+4<z%;>gwM4cf$
zZVtua2)x>X$53nG_M82@l54Tqg)N(dk{thD0+?WXfCW<K&q3Bn96m=3y~W*g#5P#B
zvJ-G~S9d+_>VxTnC|3=Ys?d68Xt=y8E_ziw;$z~IE*)b<W65?npr5@%y&uxxMe>g|
zvGkiXj&B8DGGm6ca}kp(>xuSJHJ+wQYoHG3vsJn30x5E1Zr5bY0*-uBM!MDr4gx8M
z^dA7uo2ykM4Rk8Y@VhGNEm6rh-9P398tCA^Ymmvq@1on21&%y;_57ZWoi85dPT}vz
zuprw&8T$-9ZWl^<kO(BZm~oAyc7-8)#Yu8a=~B)4VI&3>$FBUS;`q6fjqO7y5!bZ$
z-p7SxG6JPUeK4k%6>`ia@-sCAIz@f1Mzv4vk=Rb7WGh845DBC>_l``ka|NY$X2Ej;
zvyuc26N6-=&Yuxnt2z+_1i>m(;U=&vrj3XaOs)y?Z5*)!q<j*=ViMgX98I@mC4O!W
zN$~->RpR<yfY6OUXqW8`lF~IcAMjHWUz0i$TExmnlX2K7n2H(DXj3}(F<mWuE+@a|
z?y8;73RfvL3ACF(9$Tyc@c}=GDzOP+#LncTQ!rSa#->xmiqQ`s!>x|x4vGls1YY5h
z7cC|PXvR)n-XSI)k4Ya?rUi;k=>|s(+PyAGXtMYCoT(|9OnF1-1Rpo5>neH5?3QGa
zmme!Cvx#VdCyj23;(9N1IBtrI;#jT+wZAvVzdXWxmCpsMch#^<q>qmTx`%v7zxKN}
z|LIIny#_zGe;ie0{5r$&pe+bX;ZFs-&L|6F9E;|?WKZAQT!#Mx@djMx{ud3i^R~V;
z8BZX?57^#r!RZYUL4MfUZh_bd>JM*lmMubsHabqje3N?Wsef~novY{FfzH^oprhc~
zx7JChTHhBlbu7LS5V$FCt-=9qQ@6>wm1R2--aTiZzu&~-sde07!qo|Tp;kDy`n}QX
z$((r5b+boAV^=elus^VI)YEpK-`{bOa%h*F(sO19AkDd|`6@CuR$g%W$~$POb&iw^
zS3=Uon!MYoz`c@Nyp~Q5=Z1R5t#Bb}OHU3HhP|LLSM>}6`w7E%ATnS^`<ZtIR1Tj4
zUgb(8r!M1ObsJ<01WBeYMcwk1@(sfmxRuoV_a&6cjp4XVDN2~zlriD>?)ptpo7SnL
zLUKEpc^p?#G@wr${7s>SqnsoYki*&h$P)Uqfdk_l$!uDT$yw#g*km;Erf7}l1Ga1y
z<P4<0R{hp}1_$XQ8qThpzV-6=`XKEMOs@kqW{1#^f~%ThLjeV;3%ctZpzoKVBWtXj
zb=bewa%wF7WBDrnRC2X>MFz3IE>%Xw57gaI%va}4qnH6z#7zw8W{i63XJ&SZR*;5O
zO!fquptWi~eJ+v;>i}8zO$bI4xMoGblXZnEZflz$70V`h-BLm!x<38H{(8~B(K6?S
zz$R&FZ?|5M44x0fI6@>cRgt8cf;Yf<Cg#0lymr0A@G+^yK?UQo&zCs0F}UxSkf<T5
zVB;qWS*H?kk6rkdhZ1^5l~M^gT=jzhrWT^#+N$`&h}%QFd%VHHXU<`{@VD-BU*5<O
z!+FK$-d*oF4kbk|aGTNNrN4Nz3szd~bJ`4To2!>w@6miKMG8k;@!OMc$#D*8$z{OX
zr`9Y@qJn}E<nvHEqyku6$FU@3^M2_Q85eA^Y1+ot$0&FsWX~qQv)3b8u$GLB%Eh+b
znW&3^n-0_L#kxM;q?^Vu_cS#*2h<$zBFE=+(noy#{|h#tJBxbUUeVi|`nTsR1cr_Z
z9PI_@NFmqA_W`|qO}Z>UbXsypj)a@NMX_&xw#fVF!=edE;s?r-Ie1EOdYb_)I7t6P
ze3y4o>cx79H54010vqXHM4@q8d(|Gss_RhrWAv~^YP_Ffb%nj2Gw`#5E5`+>hJBth
z{GVbk64hs_W4Q65o)je@?)X)^o++gv^Ql>ZSE~LB%Me}Zk7A?K_5e><?zBFBXd{h<
z3nHIESC^lAg@^E*bGKJ5AUWW+iVAd)v*!ecpCaQu23_H<ii^3yAn>)i>9g=c;B*Ct
z5*qSpmwWAEmJdkrgiKDf`cj?IE0WL`76FI&m9@;rh%*i%cOTf4o7hOBziE+&F;I!<
z?G#=2)A^71tR3>uy%$-kuJR4fUmnyJ^fS8l@wNZV$+|M^r;#hu3la;2k%-5~@Ssv$
zp$97hj>N*Xizb%E206z46SAbaW!Kc2gvS?DEMe^VoS>t55TF1V&d*zoaG{GBq<75j
zw>1UjI!h+WL-2YnIGV)I!6s%mm&4-28~hG03B*;OV^SYJ7QgR^qA?_`{#`=H<#-zW
zxqC#aBWrlCXP9<+q*A2KyKB#@WoA9SUmQ-(oAAwVKtrZT<qgK5@Iq?$48L1s{RWkY
z&fxk{4_?yR(@s9cm@lAzRy$8;R+$x0s14t^Ovf9w|8;k<c=5W`T7p0Y;fl@>6Ha;B
zZqKS{zS`>AZQpLm)oZ=oTJrXb?~5)07i)fX;f$yH`~|}#i>Uh7w56F5ulJt3a8rm2
z2ZAPM#`DznjFK4s>d=8pn0)`Gv)in63}YFa4f+-M$vllXyA66{@6n0e3c2opYi*A$
zF^!K*%q1u4?)Zuj=!(0~v<<QT`8YTaL0<CU&q++<W;AxHz_KB5&qvN@R;@pm*iw(Y
zTanvx<%QH=WaW2(5-Bqu0>v|EgD*m4A`gF@o<L^@C>SGLP#(&u|KtZ#805Yuvluu|
z#A$^#7N6Umh+sp6glfmAihdQ@P3n7GhpA7fI!2zj$@(#rcB%;r#H5;1f!a50|6tAq
zZ(~n32Ex*(m~b6LtfuTowK;FAR*F1Mj*5cu^_A+~w4lc0h*}KVa=_H$Cq#Mi>?4$6
ztd7>t(o2|tRCP|Mgjk6hOxCtFoQ?^}J-NKj*3|O>R%g5ibhb@SOoB;H5L8Jy$LR6=
z**81(jy@UW%#TdU=2O%d^@{}R@4ksb3i_l|E5Eg=-)>E}eRmY-d?=)#mOe4^E#TjW
z>NI#Q;Aa{7VgnNZztST*mED=b<%}lp^cA;ThJR>mA@@IoZvQ>I3W>r6E36hTvz=Ar
z&mhu6etXq-Dq1)LgLrWiXTp0i3Zt{La|~G}=~5v*8{b@CV=7vjmWRx<f^j-q`rq+p
zZSiRW%H?ky0YUlKKj>o#Be!lUg0}wC^}&G(*!87Z3fjJgepO-XPlI?=o&Y@wjL~pE
znm|G@x<H#vUbiJ03+6}q<80!cYL>^kD7@rl0GRy(u72!aI`!Fdh#Sm0^wI9sgvvSH
z<crt_)@Ml_6Lre6^0BcUBHM5q`!g`0^NdJ&X+WybXU~I1x|(W9o30zGZq6T$q&G`<
zF==>BI2SaE<lvcd(zpNaMb!G8quuL1R^v_)0)O-LUJ(hiwsgMNgHx$9>k7|9-N#6t
z&ve7QwjFKGG1^Xa%9pb$nB(GAA^=XweMhIsQ2q=&=(qQ=xY7?=zcqojFZ!mXD@Y~x
zKi+m<zTLSJOdUs$n9tb~d~JGVg{%WXI_`l$eEeUxQQ(~J8qx!w;#26#%M}Dfn1W$Z
zP59fDh&boTowLMx!xh7_xr%tj<J?%jc>9>j%Vs%IFh~u7mU*bIvCp2=!b%Dq-471N
zScKu|kOxh{&#Nm(pgWPABJY`(RO6U|vaneG<K1T)njJtkgugZRugixfOhN<{@@D(9
z4~tqH?=#VYV5xa0ci+lgs%k$eVavTiRh7s1wK_Y^FBR{Qnm>O`%6o}_sQQ8bp4}+G
zOU&Cl`3|sV=b}!@e-JRuC<0#hL#|!1{%EQV<pwsv(iyxhh}lzXy%-svG$_j7hnW~`
zm3_B*qr1F3$6g4HEauDK6yKW5dVe}+yv@teTd5O2!E`OmW3f7un62B5YM;U9ZoZGS
zTg6TjTZO9P?E5O2!7ou;7gZLqZ_M^oy0JM3NN3g-KlpX4a)@C#JBf%Pm0n~Xy*l~Z
zpd`d7rkz@`u!ATgvr9i!s=aU<l9^2@kF&~In0yn0d|H8L>sg-Lz?C{H$^yYT538-E
z%Ld`B@Hh(FKx}<#=5XV*vz;6G&utxdEoU!!U!<H94pb)jGw|rjV_zrm!DIhB?I#*8
zlMdGN;W>N)IkfOfIwp4|i1B^+B|B%iDRKo7a}uEj{@0+~^Cn6;qTWgu174p62*p%6
zW4!3Gk=JRgJ^lkTTzr>bwl-t<d%(S8M|cuK`+U)s=57q7m(Ic%LRk~F_jP|})4=9!
zEZ|p@=!nct@<r}apC|24IUK>&ElWZh>RX&{tSTmO9AnYM{M6}p1KNMks50N}!KSK`
zM&J#F|C;!Rw_E{!fQ<oy@d<w*OyWuE*c$0nY;af;*fxW5CRRlg`GW8owmGbw@H|n>
zaD0M;xvqAG-U*KEu#bNyu%DtF$2fCgx$Hs$lD!u6_7o0OG|}96<Xkz~q2OMR*}wkK
zjWb%nqqEP^RC&IzAoeI1P7OspB#V@P4!+L%xQ*Y1%Cwt)41V>!#zKcJ%s?1oFuAX7
zKD`&gge_3U(GbAq3IGItlqw)rh#yeYoaO^ydil+QNU((AE=Rk7XlLn-bpH|RMg~rC
zETF=0#`MOaR{9+QArm<CI;`&EJ*^d(dunu?u{ytT7=f%eo@3?8y5ZNj2Vls=2f@9?
z(QnA6sI0<+JUF`)%B;eR71)Vm#0#Thbar$gORDQ2xUj41hQ{TVhEMSKHQlW(X{SOc
zeBtczaXw2%DZb|ZgIFHmSz-uKPnK%#K#V2W=1%BbO>C9LvJSf|1HqGhMJZ$xV<<Bq
zmZu5TWtA7FM60v8qTboAkQD+0PtkU4Y+f3EU(t4{H^j|1{8#9!<QpA($De{+(Cb%7
z*b&y)aw3d{`NcoaXBZgT87pf1WzUG^Y5-D}^JBF$=b<(BHZuGSYNO=^6?+x#x_+V7
zN;~+ZhQ+ylD;&~(S)hcg7@D~{X;MDyL>XBWw==qzTMxW)$k&g|q?u;_vk?VPOt1@S
zi?Do2AFV3k<mT0oM;P|{|1$0Wf#yPeOkha$AQv62-Zghn)8hjeF^Vv%$%;JWLOM%(
z;pPD)dhj5I`Mx>4q!CrHD!K!8Si9=zUsv-##@09bXSc0s_fyDOuFOz!d&SELc{Rg5
z5R^FuP1o;tVAqF`sbDU?8_7EA)$fo}lRp)7dPbr&zSw1eahg3NGVaa!pS3q~*FjX~
z*g-v_H$R>cLH42rChV{Hslzq{dcT6R$YPNL1ihzXQc?3CTP?FjwbGA^R>r_aZF4Rj
zKd0KNmvib*r(lkaG53rN-HRg?ocKR#yiW<IfvGyQ#VsN1>tCqokrb=a;(m_>$Oh;y
zk&8Sq=y-m^Goh<4gFg*hQ%R$vn6sJX#|c<lDQk!s0<5!$SQiGrE)y6kDQl6Kv9QMI
zZ`S~kl@-GsdC_~|)Sclfi~NSo+GVHaowU1jTGgGOKD`~hqkC#rx%ME!aYPswI>;dE
zV$cEf6i}nhRO6{Z_URo{GPQ00g|wx-1B%kzy9oKVS)3gdN)M!KwL_r7GuUZAAmkPV
z3R&!RJ59zobw8+Cls3$a!YofX6#v>Bl}~K_o9-32w9)))>r~|jRr}-`S^J5T-BS0A
zxUEyxtpn4s2;~uYZXu}ciaTwACI;C3CyQTUPp`e7`})F(K1Jmj)d^#pF}wwFi76<S
z%^==mxQzbmIiE?p79Roo2x_~dmzO9^kVmz;kn05Y#MOTH-}Dk{j!TG3YNdgz_+AoH
zVvWk{c&nd!YYzCiX6+LID>C}Y3k+A?yEbgn6YQC>4w+k&?hs%x^`cJZJKdG@<%5-l
zaTtQdUOJqkhp0b{bsjddnt|u+#=>1S<XrVOe$QPvUucuS)e!P0AH@~(d0&S&#YOgg
zcU->z{P_V?S%`xl2HF?YU}B8eftW@${H?+zT2rt=acV<BcYisSy%bj0a4BKZ<u=xb
z@sz=c?>|VFRZ6!czMo8RQ#c9i>TeGgE0uGT<3?%h3ez1NMrpiO=WhdoH9~Q0gHdn-
z(!rb|Tmz^l9NT7!%Y?VGyh(7&=Su!Vx{MQ@p3C4Qmjz9fxNdNH2eVVZ*}Poo0f+i5
zXZ(lt0P5OXf4QAOETPM_sS9YKd{<;9eg%fw0&ug?_5rHgGB*v>K-TK(xc+cs_aRqk
zMu<abMzd7@fwuw-m*A)`N?!Y{pVzfBT7^53OfI2Q1rm&f&PCW)l!%(_KM<Pi^Swx5
zkF%rs(OeP?HMhVlNC!8CVc^1Cw~!_KRNtJe?y=f~NJM->ktv=;`pO;6g~C(bT0^I@
z8Iy*PRM*M(8NM7@ug?RmvqOH5tI~nu4u<}44wzN8w%jRb+*KTTIJrUn*GhIS3xRd;
zMbsg?V9d$2@}0O)0x_rrHiNKRsy6_leIPs_a(5m<(C!wFsC4&xR1Cb&PEbb0zGVKa
z5XwBgm@?cxi}9E0D)&ZA5&EdfpqtQ#ZMc;MtHcv@L8X5oK86c~5{`sBz_1Ol5IXw-
zzoQi+l}5wh$WkQHh(tS{kXD6@2GgMFiB7g>CKa7eT7cE=C_~-lFy>L<AVclzG<LX)
zzJ)AR{Vh0=2X$;GaH?%|4z~o($LOygJl}euuYi%j^n(eo(*CcCi;wZ&7Ukoq)PM>n
z5y@Ay&Cb~eFv4cC9hEN0Wu(E`Z;9ac-+uND5;4H(4lIV*kyPXnRNEPDz<lmD1-AY)
zGQ{1nG|afQjyaC_b>JNk3BJDd{N0cX6((Z}5FUsEU`w%?lNiB#82h^UaCEETLG33-
z?MAPAbOlw6$1}3U+Cn}7(1!=hCp0MO)sT5gGc@*c>AwZKzA;oTJrT?g+Rx_Uj=8Am
zL8oQbyb9>4r3W5FyDZlDZa{s)XW&R7xH!8A<v$1MaZJ$3iV(#G!vA42)YpQ~Khz{z
z+RKW^K$MmG6?pQ4Vi@ikRF~MVRoJVlp$R~;4h3ITlhveSmZGUMHWzcYrl7h`bZxu+
z9UX^p=JYYpPM!XbSJUU0p7vf%e03EDPww%U1NOa`0+Zg*ep95~eiQTWBP1T%%LL@I
zBUNtv!Ei~-$kOBQ!bF1n8MJ!VMVL5~yKs;q8qytuHg#>%?Z;$mUkXGhqpQi?8K`Uo
zFaoD!Yx%QB3q{^^hzSf+ikX8;QEk#=?<;%H3!Q#@6!lEDF-RQ3+T;m1uXFk6>2vF2
zxt_ES7sI)B2B6awoY8-i85!b9kez3Kwr(AbVF4n<h_5+V%OgYjRqzX;6<9Kucn=O*
ziUaw6PLPYM_<Fil<it&vu&9Qopv#(+Cd4DSM#UOy+gA)=QV;8v)Oplb-G9Tk0gqON
zkH+bc$xkgrX9ADLxl{XPMvcvM!vu{@1C^)VyoC-Mecx2Ih_K+naEeLl)FpJFy^ta_
zBt;qnY|rVP#VEY4P0<l0ahTzrd*+jqV1z`*lia||LW?+ozaIOoRp;1BdNUDwX219A
zpAD3y8Jz8#c)o=2%F)o&6-j^V8guYMnQAIQmzd12c+wKzPd}NlP@Udm#}DBVy*%<H
zk;o~*0LnPEmOVkhE~Ev<2(8XJM1(zNh>vdFn0nvf7R%i42J`X(jD>DEn@ID;TF9h=
zG&Jtc-lb2Bh`vvF3BaqsNmSR)gfjKap;T5l!(%Dm8OSj*7K<7NinTBnU3msMq?+}%
z#3nf(ALE&#h0!qhcV9eHnPwXq>NT0w=*6<8O<1T1bD;#&&I?JEe(T2aQ+a1VVPBqV
zHiT;xEH}dRK+KV47!W%H{J-|=O;a_`Sz)f9Vzp3|J#^qw5k9+F&PYs=yXvsjyTAAX
zdA7eg7FJ*}w|mGPMxMUph-oV1C$L$DPpB~;z4Ruqg+WMeB5fnNqn}Jd2J}{(2bLfi
zoD2$a*cIe3HGh>e8FK(`8sww6A>vzpulHC^)mxDC%*Y8;^6_c6A$qW5aE4gp2Dy~X
zo8bmA<t$=ygh<7636ogNv(%P&e*H)Fls9sW!%%Tmdp@|C>tJ!&r~guYNnc*;3{-1~
z`aXnZ9aWgH<qH^zhMd<I%{wh9B`m$SUvE}5eng@`>r!XA8O`D_vzKYA1^_353h7s&
z)CU?9SRWcMOH-AjFjp4_>|9!mQ3e!P`XJP8OOmlnb4S2YNsx(`c@7K9X?m1>pJt1)
zP0nDJAp3$&GVU*{=)h~z{vd|-#Y=h<sctG@Loid+p3yDG<n4Sk2OmgxfI01XR$``P
z_JMaV05=84kc1&K8xKTJfJ4mh9}3TVl8IE5GJioPx-^h7Z|hxV%X8r0IV*0I+Yzm5
zVt0CG?F@dG`zJ7<Ucu5C9HR2Kis(zIMdo8}pOx5d2mT7~XR9*Niqo%vENYt>T0Jn;
zh67VT3tU0k2fk3g`Jlc;IS-1+#302ZD{l$Dm;zqLFeE9JRb;$z*#cSTxztiDA9LLG
z7ESeKK{LyHAPV<x{uWhr>@12)?`2*C#i`xgf!hpNhxaFvuF0~a)~T;b!FuR`>(vex
zDsw7~j~;sIDf%`@12Yx~3XVQboe4?-`6B&W>?5pO9>51Jg%UFb!F%`Z?~%YsKP7k6
zG}-PG1>ri=y3n}&A@yZLDm1|VHK9?;&7VQ}cGaP2pOvZ3EvGNbnynOr)@@m}S#zW0
zSDHHkznyrvB!+D^Jl|p%_XPqB%Iv>BS1(Egm5LcQly_Zh3!~wuT)yAaO?~nk=~4D_
zHW8XD&R%3V<y7E7;P<{tVbB?PS%8hAv!<@+=wLtT1A{4eG=hRKQ7GIHJJscm13WKD
za^?sjz1&=Kv>3^o&8bsJSg5#6rkgA31FdUNT1Q22d6`J+0?pIyhhzGkdw<5Lo+U!G
z%im{UhaoL-3cf!yt^15VGZt#nO}gZZe7SBnf`~wOa=0Yz(!XHA{7}yw|NA!0cr0JJ
zyJTN2L|1mR3a858-9%39#;gWaUa?7_L@DQ-Fsn*<dDAbw_&@$W+#Trnpqk4T6?jXG
zM}u<(tGcTDKsT_E?2Smn;4&qr{6&@4IKJf6DXsc2-)yy9>lHL1exa5yHLZNpJA$jo
zRE#L;xnP@adjr!uT6(<}nAOg~>@F-|F;>tCLV)%jXO2_KJ)#3j0<;v>EV5Z~vmzju
z9_uliZyWiO$i%Tn3njVOhyS^Z^)Va6Jy4fM_v?27g5-2-(zB|AHY8m|DO>NC37eph
zQwazO^wuTC_)qT35bnSde<wz%(=&DD?bB8N_=H5!Dp8pE6+qVehVi>No|m5HU4K@y
zWk{ZhLId6%0dJhs-YZgzl#YF|t!`}@#A=2avUO|h$iO*(fjy%W4|Wg(Y5^@7fQ5EJ
zfQ|MxAS4=LFj1$X>?UWhR0c|`J=F_uy020uRjd%YA>|*>Qk|1e{kuopoc2AaV`_yN
zv0uo6q8D=R1IN0g@`<{%&or<+zJPV*DZUqC`ghuCm=H;cOEBoPw8PtZdRO72S0!A~
zUqxyy-sqBq!Qq7i$r%jlODMW!Tp5kzy(r)65c14SDFSQS4oS5tUqOh$Mb4;GVRB$5
zfQ389xC(le+c{||Un%cmgVmtrv~q)nut{llafY6s<(e`a*MM{=WeNbS%`h==!5T{C
zZxRP&zY3K{%2%`_{z5$s5Uh)-95;k6q~t8A<~p8XoFrZtEM;d54#X$8m@A@5Bprm%
zG!>vQ4k%Fr3utZ5lZ!0w^)G)dS@{o=Ljh{SZ>p)N>h|BIh)qw(rG&uAgu$1_{R6#)
z!5^(N-I9LC{-I1|Y55g{)Ux1Vqw>u}Xt=i5<mZzaqGjVYO2~M|)<&&U=yCS{ni3%k
zk5e&i0zv=izqI+L)eznRXj{e%SnoYqsqZvmiE0(7SY2RQ4;rD=UZqG$Z!UW}G=n*}
znM@MXDGENRxKk!OLe*_SY~edKyZq4D3$!=YDWH6@ObK-Y@DKpK85Wy?6NH$$=?e!B
z@}wT1GK7uf0`SUEoSAGS7xJNeIfp>=(yPJEZOnxI`(6~`3qzgv(YQ}0ery)ryPivq
z@RB>;-N6q6?r}oVLGNyv=v+L1r@aM<Tl6L98^pj^$UfPD04t}qqNpBN<-C&3AII8n
zhTeElw(r-{P25k{8@f$*S#hmO%ByXq9pDQm@5a!c2yhL-@Z%Fc5E4L43%_4ZA3o5u
z1w&fEerC2#uE4ZE$k6+4R9Q`rVYa;*P0btxzUx$4<k|yzV5bg@IhSJ?5DNEX6EYGc
zGrC(uQ#B0#rTFPpBnbWeU}}-3cvP*VJh%T5%`Bq!y#;7G>Sg8d;V&`AjgF43h(wzf
zZvggdq;0tH6-ke0U(utWYZSkG3;lT*p?j<4x~~R#ke8pv^*~hmdMp)G-9dOd77niO
z**uuMr>(r=8=&C_mGQh+bt`-Vx4JU0p=Z3A@tSdOdC7<wH{|Tj&_1ylI#!?C*6~_^
zd5p-_9f|xms;j^{6XA!!497g7%e{gm2l@WQJm2P?(lH}E&)t6)if<${>^in6GQlcg
zG6+APm)d?}mZ8r=8J?=n5JoZr94oJCpKFd=5CWjj%zmze9V-&5*gZT%lyoSra{cAo
zlX@-=CRta0L6K_1K-8*UkoP|LfowzM81{Q1tJi(&#!>N*vb+BLuTO9KYH|f`lHktU
zYI0^DRq=(2TgXNzhZ{eO#_I(#In(cYK0KKv!JJ$KCs44dXss#!?G31mYwEY>+Hh|F
zBRF2lAhM?Bz7jc8GRpnFkflf+7VH{!s_e`B>@Yp*LNl2^x=(cF!C3ydJr^uv02;tG
z$c2s67O#|KI0Tp}o6VS-a_39?h12_rdz-7rC6npEp6%7zrT@~g8`_7^`7Eh4elMaB
zBXx@N1#6Y5ps;cK%Q$`0Zem>vKn6&&NjVZhm(IlgKoGWmX|h<hn9bcmC{UQmhs5dq
z0V~64Y=TQFr7F3LREdWrT*O;$^;-yal^SssyB9W~84^M1>HA_`tRW4p)tnK&u=wKL
zFY0tD_&z&We>Z<2B`%q8Qy5O=zZ-3lG1e31mvP^W)9Rt`?jZdew}w3aY6iFSsgFj8
zkat;JJ7zJUywL8W7s-+xC=-H`WFP+mdGp_~d#5GU_T0t4^|gINU=HY>f60T`^k2cv
zYfQI6?BVWc0r?AY-6%pLKrHb^cmi|4`Y9A|=|2n0?@cP!3MMrp>A0dUVXD_niT+UW
zVJa46J%Kpqn_N!s5KInaS3y)~XxWU;y2?#On=apE%;M;x)EAzH{N__TbTF&SuVin}
z&V<5L0m^$^0n3%*8vqvzw8G;}Bq2*QJ-`|3dp_pM4Z$wnXZZOhdp_Cl?l#L6(rO3)
zv0M8)<Bp(Y0twVh5K=FuO*eo&)ef))^$uWxuz?Z;s6xkxb*5lDoGBB2F|^49dx<|J
zed^54(jl>^GMy}im+SN7Rd!wYDuZQxIUV2huhy5fS~ULK%4C7fw2m@7D^=dlEgcN8
zjuN^uXfi>aIhhqxyAdL|LB6)Cic;nrM2n26Y`Pgxrk&h+Qa2=xv!R8^C8X#smaW?A
z<MS?jjk$Cv77_m2fzVC_GQ9;0!HUi@@GzIueZ^Xm=ExqB5PrQ|tyw_YT>)_-6sZPT
z!1U3jNf}~b{9sd6h~ok<kvFca8>a}5HW8(Edp`sd9^T<Qce9fqZfn6H{5_>)m|*si
zh`uEdp0E?!KZirak>j>KQ7^)sk1x^f5K3FBS7NLzrwG?!^Iu8H2xHHs2rKPJ)C;EQ
z@LXQh97dmCWPN4Ccj?)5du1`%KW_VMEWSk^+-};=z%QA~<43EcU)Tk!6Js5(xh<P^
z$gYLSLbXTkcUH?Hi6TDleDfD{B2pO(EG6zVoRJ*v|0DGE2rhpy5)-OV91A`h17)H^
zo4|!%k@5gGYRy!?V3e?gG5YqRx>Vxw^G9IkHuy*BcWSk(j#J)P2aSuB)D%*bj-&^>
z11I%jGg`-zh<c`6Df6+9e*v%wQ;0^EDwjksgL1qGDPvR_ew4Yk?$nRjAbHgPn&Pt!
zCm})X8l`IvT5Q;h(1Iu}&5A;!$}$9M*$R!}Z;&>5#xV+Nbq?~HaR*{=!|eTAa6tD6
zMojf2Kunqx?|oQl@t*ez*r!}fZe+7~Hj(qx{=*|2`nsh%&x%s$sKQE1kppArUiIy#
zd_fj`!u_3IFATva;8i|#JX{S0xJ{g;zUrg-Fk{=>%@Tfi)esqG2Vr{0(o$8J1*$Uu
z8#DLu8L$X&>R)F1SGY#hEr_JVDf1V0021D5xCHHOjmlTVpQfZRP2#+YIk4ZNyu8$m
zAlVP<l=}K@*K$3*Qc-9lKRlrLqIF6d>}i=N&?*bu_^SzE61z*Ow-vbyU1T|TP=;GG
zf4~ujqo&ES(a88i?C0|W$+OJe^(*xP5dxH+V~eqLDLtl(xK4eel2qw(c%!u}XqsuH
z5tZ#B3$k8eX-gN%*LU>vYt~7WXMTS){UQsdjH;ukB!vTZRTRNey&3oja0F{$7DAg^
z*`KBXRxSaV7k+RFwCIhSbOG2@!Fow2;037{NWFKJ8uSjol|sUAR2~L-3h)Y5P}Xu_
zMn6Aj?EWgr!q`qh=z@q7pxF?odAR0S5`i<KxrL*+k_;hO|2I7N2JRonGt%Z3#OX0_
z@+vb915`)b)pX}XlvY;Ldb`}jn^@Gz4Rkp$omcQF(vh|4UpupBYI(C4ijF_aWZH$?
z2@)j37r_d$`49=!d+^#YdSD6?9}B_2vRVh4WX_MS<DnrPjN;~KW&RHL;e<=IQ;*@9
z$CgD^E*DKfd{ReUImQJ$iMwMt$31)tmsk@j>-c1yX;(Go+$>BOgQPf8F=8hdK4_!7
zoNH6fKuUzO8h=0h2&&P7-;DqN2@SmP79i6wXSIVy^=8rqggRj%xMSV4&`-8@Uz0zB
zY^N6mae1o@2RLp&2`@M&)rnZQ{zfSHqyRevO*@m(<mc(9BJ3i7uBT5B1#$r_`bj$)
z+t04vK|QnCfs&ltj4P>PcSvUUQF`?+X+}qcDdXU|zsO+!qy;z~hHhcDXfXxMO2*p{
z<6RnOH*@4Re#@6u)f>=*y;b|8P$?Hy5HG29nyZ-!(Kn$nYfqwnC{)LnMev2mzEP5{
ze^XJj3ER<nj(53dtJ8tzmNQ{uzy6Dp#xaafC=*~JLfw5?m>}bDV5;s&uZU*a?92*O
zNB6PQzex)fk*Owch1j<qvf`pGslaDBMwKjK$DAwmjIlG5C?Qu^%DPlQvI3;QF}FlO
zrf4ybn+KW6+URzZ3Sex2-9n!6^?_Z(2oFe4%FJS}Ng}{emwhA3`M>(Iijc%!P(b1u
zUI%znhyd!Y6lOVLcIga(wxPPrdsopJqpr>y*-J#}Ok~SjD|@Odz7NBVcLt`V-VF!s
znX!+|vfhrh>Qe5`PjhLQ1%N6tZRFFlbqN7A1Lh+jKep3JiD?)b1k`vm(VsW2hf+yI
z4e&j%ajcwydB^9)%I(7DvOtyNi93~DTdxyn{h|Xz+XW;+Fa7k^g_RxPkt<IxOqi+z
z3${&9R7mZ2gBUEt3d6U+?q}>)*`Y34)_ELvup4l#SCPI1J9Sr-+Y*fjZ7Hl6^t_tN
zNnl7&p;i)Yrm~1@m}+Oz-we?}nQ2U?P+k-~>HxmELMxvc3oX+4OYl9YhC-p!`|^(%
zmoa+y^JB)jiaasiir<Bj4?R*;u5Kx1Z$n%vfj6$uM2u%XWPN#PWgRO=vG=9tx=EmJ
zQc%zwuEi>-YV21cG{ur?RyP2O{vE9F53G2k7t%fasmm?VUwo}tA}yr5+~34ni?P#o
z>PL6O=FoMBGhH`ex$e@{D#yy<+E8y`0<XpD)i4$gf!}>qs@w`B9R!!Gf8)rwwihL)
zqIXNVw(qSSry@LAKtErqRrM<E^7jdeYg)h_^#N6a0_|{i-|L|v0+%}eL_2)qx*G(?
zZ^Y*<$XfeipTTh+cUC=UDKTwUT=^}T3!ks3`;r7aeA&qJ1-M?9tJ=zMgSEGm!g{Y|
zO##+hN=K1sJXlPb>TR2c-GA82Tu`)BOXR4RsfpU?OzLSbRx(MRm0wkAcf|A4G@D%1
z2lCQ9$i6FYgOwV3eZ+y{4ruMn0pkEYf7Sh@CeCMw@RViE9WwV~8_X)YLeVm1kRD$L
z86<CntX0*A2E~?rRG80~A}KJT)?=&0z_{6_B=h3Mix#q;1|`F9?EL^+981takmIe(
z2Uv9#u77N${9_aiCF@9iP%&2iC#qLLe_F~P`h5|>m#(qgv(VmhF7ai-IvXQEmls8Y
z*RMJfV4A$m$n+l^IvDKw!u0DP>{;4lUs0>geZt=y4Tk#+_f_<#=A^1GeeF;}xXq)%
zEKm*API$@=JuPIU2gk&fBt2Lgk<&7qEA8Z_{1|WZPt0&0wN97*+9NEYV`7}mJfX0B
zH#*eXlw-#als@CH${x5{_^Wt&cs(srvH(R5W#W>o%zDnratSZzb!<R)o@V+W_eGn&
z3Ex4X^)b_PS-paozS-)(%ZhK4v;MTqL{D5XZd>PQ6Ydy4k$yadKjKFG$3}4MGqMDV
zGPV7&tUZINMb<TP04wIcs{OO(^6zTf4maX|_2h;+pP;DS4!UefJdV%{upr(DT4c67
zIGNQss5vP;>i8SCSZN@#cqL=Xh)2g<MJ9K=d^}uT#}0Su1$g*!O#GolBJw!erqI<j
zdgy7FvWClRzC<(E@%>gg0k1ma^RT{gRH6yUh$*-!y{2({Tn~@vXM?<424h?>Ld*P|
zp0npMQz(gKaB;@xVLoAPFn#QYqJCq;2<j+8D4zYswFZsO4I4hZNi2=3I6ib-_q2h8
zeoHTDTwEZL4JW4%Xbh!rF802}X4SNISp7}>=-Pz>+g>8Z3n=s_f10audo~xGDR!)o
z&9~;J8zZ<aE<=HxMfq2KbdRp2EL9Ytg7iB%RrK@R&vOTdDW)5uU$}Je?Uc7j?M68k
z7%u?|#-CPFphZ_UUD!RWb7jQUL{`GIYU+92%dlZQDQ0l#<6QzLUne~Kyl5&1*Egyx
zctpE>cUj_V%MTO-EsPG@Xuc)s<@^E-alK~9<FpHX1NgENwTTnXbxyD~8_F<Gfi?$b
zffU{{t7BC+uQ^SlniRGN2Y&0n<M%RZmT<1Fs~=uTe>ZpsD-u;;3py4Jm(?!BKaWN>
zgf}@6yM;YepY4znwL4Y%h8<L6Wdj|F+AqQutFf{w4VJPrLPwR<&ADb0Vx6}P3WaSi
zvDtG9h4n6p3hO)im-wiA6I~X+0qr^m*r~(mEe8GwbRT6t*r(H5sGK+;@}-4@)1T5M
zLO!HYdz)BP<2z0UC2fYewJKGwAfXq8m0Ipzya=*~wVZpQEavL_Gc+JI<d2-%oz`-_
zE)ou#xmo|%QQhP)PTDV<=>i}3zizsZKL9gW;=z>=+>t#nB=pfoQuAgwbgH;g`m;=Y
z$#&>Ob6rsX{2NCF^`FX)u*r?3@Fp*QxP~ayb&a4u`19^Ld<-$9(TWUl%HC)6N3K-R
z-ufQ60C-Sn6P(CF`Wp`z@8wa}KGe?Khc4gK-+c{e8u}Zm9#999FoJC9K3C<x#>$_i
zaQ|wtdvh&=-VisqPyo>;+X-(z0L@l=0)TT4AdNO35cFolZ!R0?IV|)~`W&mc;4&db
z_@8uLP@HMZzIm-HAB2rSujlZJKWsvN#Xe3z$A?$dF|sdsYh&d+gc4N%Uls2%;IVS!
zcioMI9=bMu+$9Sgx}aNSZb5UPpVN>!pYrKR(SH!iifY#J+V#_UkjjCd3E`Qz41Wh0
zS<$}J_$RjbO;ztYG_@jVR(3l8&B;45CqTY{=1ojlFliL7x1pQ2L37vJ*q{e6{>sZe
z&$FcX6;J!i^sPpD@vVFcKqLVLk15XJdOdD3-<o?J2reMC(GrBeQVaPJZUZ6q$0DR}
z>c2gbEiN>OFe1R0yYz36j`r-SY!P-3AoZsjF76$`d51A^aL!$f#3{BD>|=)J!au2%
zXjQ;g1uvWaf(tp^yF&?ls_BskS@;m%>H3Ee$c`hNL#VKs>X>D{XOjTyi>Qm6VYzcp
zv$!0a&_0|YLT0$4%eAGs=()~?vuwy3eqTL2BtBi<BJ-LCUNo#OypY;m5-|D>;hTvR
zitAHVHzZZ#zLc^-iq(Sq*EKIsd;pyUF%YYBXQWqI<LzN0%t~4G6DrEYTDkN1mPv^~
zYheTFi!{sbG#jL@f$;TxSsqXGo;{g=9$f31VdXVY$RDN}>sly__bES`I5aUV4FuLc
zs_u(2O*d3|q`Uk2BWi>lzDX2bzW90rL*~s$U5h1WBpw#bmh!K{OQM7v(m5U&78u%9
z(O|EfEM(j+W`^b|l41*KRx4qD4>a=mjU0I2JH8a^EAQS4$mo9JfD|0-%!mWMOls;@
zvtM7Dft;jB)49#QLd=20QgWxQge8;5&q(P8twQ*+_<*zUFG|L)nTV^o-|_vPYwni$
zV6K)=Y?qcVippwk2FOf^GGs164^SWDJ{6crl_XJ&J)tnkXfl=RmzkEKcz1pB0<=MF
z`FDMNShJ<yvHCJ|54O##xI$*la7?(zdsczQsZ@biPS``|kb6FkNS6_pko`bLRMHa_
zV*XDu)MOGoI_ci_g3fB@F^!~Nfr5hoT4?~vBES^48?9+8OMznwcv<$5>GBJ<X=;dv
zZy+-<jv7+CCnMmJ9g*(zelh9mV#yL0zR7PGmKaI-J3M&1lHQ4&Ww;en-l<2iTkg{y
zNd)6!z1J}tsKaf^Y10sKo@wFRrr`ng&x~SU#R$6}Wz0t1bKO*8e{^c+yFqtPA9Fi}
z=QA@rIF=x^23noIqPSjxF-=V!!y2Q81TlQ0_zqGw`;s&2x{&Ha#7whD^#1t-)(~kG
z6yf|~&%Bi)C(J}5X9;Dh6<?w>$3EdW>rX$*Kyvj&RDUl_R=!9iUwAKc>P{pl1&-O1
zM`rDj!-eKqzs7N{>VUsW_?K_%PPJnEjLkdaOm}uMhUQGq{IMXse>YVghV*fS)LN~4
zvX8_~U<RFN@MF1Tb&8Rla3Me@7GmU;N*j?@JAWmGu2-*I7lD2RBijjPR6qzbyXao(
zu1}}-aWogB_0#S+aZT4V(9*odl$1Hv84GR2nsI+5GO0{xFv->L_lhV6g<@a?g>G*-
z2P%9zlo<UkyhO=<=F&OMg}|JIKHt21OK+tW(<?!&V8Jw?{n(lPmBH6I9x%g6YKh@M
z?7C_AQ@c2_ICecnBVZku2-eJxRHl7~Rj}3R!*z@aBsC0X#_XS=^Ibg}_)z@ia>;RM
zZHPlm$5sj~d1v5o56CFD10M{ldHzEL(6~63k}m!MV4U;N2F%9d!VvBU@otcvIw~~~
zdnF`ZIm8<hu%E`fFHFvge-CWD;=ITC=`6{vLI6aOpJMch|4j(|8&$3i)!iu6p=MFM
z^M?6sr-qPkN`~&xj0HXEhfh|il3~z<4Lu!K0l6VjD`tYedi+`+zSNI*zTz60$Ys$D
zrYi|lwdq3d4W(*Xtl9uD^4H&2!X(fER=g2;2H~<I*S3-)io*!@ASXi#<-LI^+<g7{
zh4SO(Dh68$Vk!cuEXp{&OFxB83=zRce`;~!24BX3GwT8VA@^Eq-A76MNY<WqKJq{~
zHN7YQ$@M&=r-=~8o&}<mdm@?*rGUGlT=>VDT|0-nqYR7A+Q0+tuKz$oscrKjtBFlT
zUa}Bx<G*40%f&M)bBzEH<JsT6pjG+&6@OtTGH1ngESO;3`W-&8&IJ}Hr~=uDZW~UY
zHv}$7w((|;#7At#)-`jf&<1&+ak}wLO#5h%I%V=yJ{~L~H(V{EcyZhwf*RTIeUC3D
zy11F>$MeOFHtWH}F;dS*v%u~$j^8ngz&=c3lhSu<f+68K*%UNX>5{+a!u)`Vb*gS)
z?oyokIrOf|M&1+gQgUsLLAcC70+Bkx!U~Ku3zrv06<9+2BFo4a;4=cteW9>bd8&Xm
zPjZ+>q7A5UXu|=pnU&hBa+y+xRw5wIt=6SeoAAC&q3l!K^Hdx<rWO_Va{-$UsqDe_
zYXUPbXMNXY#`-}DNi`TaXDge7%9uVT5p5%t94Zy5XpCRltC6SFX*_b&fKWQ7%)KB5
zE-Q5cNB(|Xo(P$iFn5E@txP7&grzBBEP4y5+vK>3kK0ww$NGuOgV)7nc4R!jj0irP
zi5f`=(j2L%ZMC`TjDn{TCBFaN?Ks+bsGwa`!LlmB{}6#PK9S)PL|810#+045>B^&L
zkjboD#ibT6mYwR1lSU0opT(6%lZey63`=iVt=Y~Kr!5&w&ocowN_bfoB*(>0!7^Pe
zTKdd&L3_}t#>e5)OwLVZdus@3Z_*RW5G>;T4q(qJ8Nh2KmDC2a#FY$R+F6?>lWTK{
zYUOk9ZP%cmc+`eV@K!HVzn#Y-#;Gn*C+t1<|2y^j?+=orL_M+uUKNI1Q5|ZOKL`CR
z_&-%zFZ(u8@Z<g-oh{^Gp1fpFo%u2;$@a|fyy-_@t{vz2UQrT)qgVSea-C6tH6JEx
z)BXoiOJ81_H44&d;L6!2$0ysn9bl{~NcDRlIDZ}ZgIyr++%WAud?&U91OpNLMn{Gm
zdm4279sUc%1s$Z`Rgy|AKR^fh`84N6x!?;3sZwQO!*g?LZJhfA1F$v3>ra15kv7Q@
zPBhAt-{Ayrlu@n~U~7F>k^$NT?}C5{?&p&RMm>N&;X69us9hEHoc7dW)6JNrPk|F3
ztH1LRgRPHIkP~fv&h7^b#yNa{r#Y!=&%gDx8zMo!GlB@8{<6GhzkdjV5040fytu7|
zgtRC6x;y_WJ69JYPFx)W&0mwKOV#HY7_a3F40)Et*w~j#kO*U~@DN{R%zpz(T1phK
zp7p`zDvWjDyWInHDp{Y2uiZw~{0gX1hvdZS={MVnsL{ochLwE8s5@d=;WUC-*x!Zz
zl?7y6nr7caZCFIc5IwPfTd(6*r<6YmvehK8E~N>dbdxx+8`E~@`xq9Lcu8B3Jlw-w
zAt?1gps+rf`n#h(Y1GiK!vAeyE6owEq8(X(k9Q#No;2#>?|3k1r2c;j$YkJ}Kx+Bd
zdLtmZ@)5X&y*3v%-(#kf*CV#P{!+2I(e2)Xba1&Hz^b;ANqG}6A@0ie&t<(W62#<5
zl8~)Cv~tFJ5bi#*s;XRVWJz=)uRDZf+Z-*qNS0FtDcjk}BS@y=<gzTViF1*wn3S6f
zxx;=*7A8ozz=#T9@lMQ1GMe(d+<!y*=vTJ6D9TI;^Gl(G&38UL!E=XD%3>Dq-R@x(
zCGV;w%x~*;w|}1a>C=6^E0Vg8Pf8<;X>A=Xu0^fvVo}`OJXEB+f<rr@pHYDj?PO$d
z?0WpmP_mSfVFfJTu+Qy0QNkw~N@v%a55X<2mg(Q2$Z8?w@Z<^^hdO0}fh8W7#%{GS
zijeR0fj`XqOLtFIm;~NJlY)<k{Qt1^m0@i*(YCld1lLmBi@SSqcXxMp0!0hO-HQ{v
zxJ#kM-QC?CZu*`3oL}eHyGGyHd6JpT%-(BNihqiG49}bgpL_NefJ5rELXU*N8_)>}
zn>2-uNn{SX3|-<z!DPi(Rl2;#CxDH3ze3g-IN*lZx}{Z?{<d49hm*(=H92~`t;Vok
zgobu*=~?{=^(fHnhhm^Av?NQ=;|Nib`$@J(!T9lg99ewZm$zcYb~D092(GM!$z)M_
zLb5MxnJ4sN>bI7^&DWw?z14l_`ik-QsbTV`-KrIXovZDM>^va-%Tmbh$K}64-(E6m
z>wUpbljBC4>~G9>t3gSQ_M2g4!WgwnroUWg_g>hu3baAL{k2M$^OOVO63BJk4zYgC
zeq}d3yG&cj!Ci&N^1)6j!#7%iOwKE!teL^;g>&J7O)a+rnG7+@bs3h!1Zy3;E+nUe
zi*yR5IxlgpPFq`)90#aqDNlX~r1^R$OJDuR<Pv(264F?arIz8cEZW0xJ!EDz+i+8J
zQw>cR?6Vam`k&9%r(Ljw!Cd+Ep|zehI(d>LDq_~DY1%?_tyX>XRZ&C?X7zL+gykwN
zw5~E9xqRGk`V_1iWc|*QSq`RVhalE6-d~z7qr92`m2H_SZU25DgO|`J^C1?rJQdEl
z5q6OVhy#a9iJ!Nb<zA1f8OKJK<!%B5{yPy$Cy(eGyYW!rWT>LOgbvoG>cmj_6tvn!
zs2+VRxr0VkQfxIUG_Tq@3y*oC7HOe|zXJPds1yOKWu>E6h=lSP>P=@6N|V}z%n3QY
zR_>S@+LOxwT`c-28Rpw<p_InfvOX%Dl{Iluys00Xvu~K29c;L1;aoM3^bWUVS6AgT
zQbA#$xQs`k1uK8)U=ATODT9;TvF^%!n#S`7nMQq{FCq3_c5A;lw;v9KijavYnS+?M
z>dUYA`qQU`K)Dd^vd1%U)X|iAH?zFB$)ic@*Z-blGhq!3BB2;CAx8Ac&|tAFJ1HH$
zv(V=rH2Kt_Q2zYW4$~lUR8=PNE>pPy^GaelCh<-_in#&b>v(tlt0QG)+lNVvr(j#`
z_8p%Y2H$k@HRQF+BtoYmny{&qJawO*367~Df0Z%dH1pL`NotHObF$~s^xP`+XlZPI
z<DX_tH(tXWkLrRM8;lx(D5UwAQqh(#(vrH^tv`VIzLnwVeHIAIjkm+-#L9&+!aa{+
zhHJhm`worJDAK);u)7ZHQt%K2BECeN1~@<y_qcc-KTe_X*78EUs86dQiE=n;yeiO}
zl7(P0c%nQeTfb1UkB6mW2-&>qW>EkTdk(_;xWPkY3yQ@Z!>ghjMgvRb=m!H$nRS!m
zUIh~jpnCqdMsz-65zLOR-DkYV__Co5cQwhS=ijiDH^<FQOo~b6g`rVC9t*mwB5FKB
zj_LGmswdQ1Mx$WgP4GQ?h*2Q{#xr;g%FJXh%90Tdwhs>;kj*~O#B)sgGcWFXwqJi2
zX3%GG!bp-sdyT-+!hMYyr4Vg|{GAjoo0+mz!n!1*tr$~Z(RDP1dK#f10`4b8h|_j+
zB#!D~LKk=9%<m<^PpGpwzioEyeMFdxm8nTn`^t%nn@8VI#2c*XGQ-6kV`^Jypp=s*
zk?3g{-x-|&TU5$TPQJwQmaO}~@AkB9)BJU5UEp4u<%O8$a!*z94-IDp0+k{qcYSUL
z@&HyUoI;ur*qTVE*m*RZQU4(Q>D=SuL%tYfj%ZwpAzCuu$MEO{^6a}SAt)uUb2ctY
zEN>g{ZBoU4#^>NLt)9KNW{__;BrzNDj_C>~{Q1aTo*=R7D5nAD^9MYlT>^1o9eE%A
zE?qv)CJ)bI`7B4#i+`Ru@=`-3e&PCC!P#o}R#|Qe-zvA&LZ~<eN?*<A(?4%4_g`~y
zcCsrCgB#7+h-SH<3ONTb1{79@f~`^6B=&;vH{?s?Up>yADc*fql0k88G2K52HAuHX
zMJhP$$G8ON?omtPo*+Rs)4nsJiPUZUM+p2nmCSEb&|J9$KRqocUw3)n29_F;+h_NX
z`9%w@(|Gyo_COWXS$~(_kZVr|9&$$X3`1m5Pv=SSHas;&RH6A%f>J_ozAM!BUus=(
zmm;cE{1vqrm{ZO_hM=dc*{7mCY|_{9#ZhK)UQEYUxY!x<@+M>DHd^XSvGb<LcIt8n
z81EPV^+}-0q-4Rc17jd9uXB$k@I)u%o6r@qG;)Ly;giS9&;<9(IpmU3udcH9=R%B{
zodRG;4>VeW1?8gT<0lwW=U_$}roYeZKx-9v3zGm?PaJ9(_mLj7gvPG|KLf#(FW@6)
z1W8bFArp8x(wo2jeN1?SrrgJkoBTbGMV_mGNdHob)`)6S)PH*2#LaN>Zmxsxteoor
zw&a#WuCIh^?;jXV>Ie?5;kTgIa_7y<zEy86L{3}QCL6I!$o+jFMft`W5Q_E%fvE<|
zMY2F1>vD3N9#ada4Th<vZGEpG_XI|Nr}MYTW-LP#lSK{ZzByhTlxpFO83|X;^=qB-
z@WT-hX|zG2DDtgIS<%Ols8d=Q5k=j}4=P7#YA?#$D%W?1Loiiopt>+?B`264m4n-P
zei>Vl;+x~cp*bC@C1B_Vo=+4Y40Oz!M67s3pUTP7e;qHo+EKx6xJ#)+s*rf~QXjOZ
z@uF^4iv^U>Tk?-2ebiL{(U~Jq0$)DFcW>S)*Wo`r?#@WGexZ7JM1%J6XA{HgR79J_
z)cK+V8ZH}jKw?U~=WxkCU%}D+bY>Hv;^{a7=wn4$Q~gT*{mrS0tW#(dHRls91h!9b
z{_oW7!BWZ8)~aJ=yl@D<N-=m<qHu`mB%a(Aa;OnENc>pTa@0PE^dD9VgKotP+LyEg
z{<s1=+Y7{gPV2i-ZYNKS?crjQJ}ETg)iiDLZj*DUBqocLOuYim2SZO9RJA(U!gGom
zh}M6iA~Z^fJ;og%pT7`IC)Y6)Pb2!6_&s&5IzYwQ*{}RLcm|Ow+xf|6s7-#U6eXSr
zNhPGoKrr=2ZnRycZ6>UqJkI)L^4)JVBU)+`xyG9KZSc$M$db_z?EELIii7w01VP7%
zk*C5_^SfV)(Bye8dmO(9Vgv>ZQG?G68Llz-m!LJPpV2Pe!m2gVdg?wP@di0M3XxEP
za0fYFMFE*A6^8ExND6GIa2g`lvlXVK+`;n|=F_gL5cL&i$p<uz3q(Cqqi2(sKcFwc
zTm*IC2;-1Lx!xe~R!BvURD&4sMI>QD&c3gg<UG2VF*oVS*+)TQ+u$MlZ{!~vQ{AX+
z6reu0=m`fKlWYAV%oz$NxBoif1IorS%GLShV1ze4?e6+k);eKYkJawMwv*CYKN|3O
zpul*xv_fx@LRq2MW#9;M)@pdA9TQ1*7TdsouF6-GhR0P9IGo;aEBwfzq98%?fR;DE
zgV^PQ`DD%2IX&{zEb2S^cq5PJuO#`RNZojeAK)DZO^VdU&duwAqtfRrsUWC0Di1d(
zIZ^iOBmkTB3p7&$`HoOV!&?Y7{@|cnGrd$mMcU`YRJ-Fmxlcd1Df+U?g6P-7@jsN=
zE|zNHi5z8P8nb0yvB;zKs@jg4z)_Hy!Q9PpP-`zwuTo>E29;(jV7K0J7mlyM)E2Qj
z&mo*{)^obs0l?@l>|@^{2lzoI3Azo%mXnbhP>a7_?1wp@e6itHPSgtbWK2DSOz6L`
zw&_`2@G5m?B0t?Uo*5X-hJu6*_0Aq1S&DFB*K>z6%GKA7^6EPp>IKX9J5eR#n~aJ&
zaYO-%TLnfh4}y!i9pKaKyE$<<PkjyNofI)KblXb7J+bxe=HQMpzvNAy6-o3R68MRy
zYukZ4M!AwV)##N>kR$1=H$hYo{bd1$$0)6)vuLP5yUyO<pzS_hZe(NrXEWr6Z0IRf
z2jkz7?_-l^c7Z4!A7NnqNS{O1KTw7QsB1C32BmP$*Vu$@cwv85F~)lEl;F}@DR|DU
zSX+L>(OxM$c|jXC3zxp~PZ7NG--aE+tTDWk<Y$(|>E`^1{^LtXI&ojx$OlvjRE4#*
z_UHk&08Ii_;pD2(+A#N*AOP(n6P!iQr_}W?yjRn4YwjKHv4(ARSr;7xKY$=hhiALo
zhOwcBzK{vuC|P0f+=>+jzP{^LPl5pJ>&=z#)=(}E1a3xn5M#Qwwgk8IBt#q0NNlCX
zuUq<S34zr!V#!h*v5mKyFA<b8&~?utJ>>0?fA<+c<U;v~WMSC@l6>(ah-el`RZ;ra
zN?G+kFUozdj;crKKZ^)JPx9SnT@@c)W3)!qzFNxlK7K(L>Yww81}XVR6o*>*6O-^A
z;E;Ap5(_0IEZ6V?#YObVGt?G=CN0}8DJ&04c~F$TWrM0b(bHgk(pU$HzVQhFxq}2j
z&ll*_XEJhr;jQ_eUKs{GJ?!AxrcLAGl<I0{yU%D+#3Z^Z9Rv64K=Gh$Vb~LP^4H+e
zo?94lUE#V43TMc#RY-{~qdo3W^+VWrgRmvacWp%*d0y^Eobrr_zoOSUBbYlatN5sK
z!+#@vsB#wBVXZg*P^QOgJRS;(w4Q_SoAcv%tC;{3%;OP-o8W(|N#=o~d0~-KIq_;#
zUSc%fQw^os81@3bk}e15vWOy!!}_enY3$|1(NlWa5JpUJaW1D5N4v=X*-8vw3B%(-
z(#GM5c;fBK7Z2L9ySxGTPZsnoTuQ!2q3h|xc)Sgz!Fy!XJCD5f{jR^Wes(Fr5qcjS
zwJ0LP&T6@)%N31`H#Un!DevrIo0!-@aX+LH(Km`+mxI`I%w1^bgJgWIn!l@2gcv6C
z0zxNy3KZWMoo2E$ngO@u4!RdPouXgpl2yMTx9_8_0r)<0k@J}jl`j=EXHl!ED|?W8
zc{5JLvqrvVggz~Vq3jigJF+Nump#g(ubT!a8>e%)F84_Qqapi?rltrFP}1oT7Ot$_
z8;4ALT({z%+DL5|)N;2p&^Q5O+eVK(v-cL)R#oKsmx9Vq?e#~<j}j52pvQ7fRZN<V
zwHs+-^+Pqg;!ETf`Gu@s1S$m=P~cPMK^`-Vh~9R0sJ{NF2cs%4h1(}58T3-<9tsl3
z;l691Ul&)kX$kC@N0B(uvL(X#dO<8(p(p5v%S5^N@a_(u=z)qLmlXP=eKq=Z><p|%
z<r_Ne3#rORGeK;$mc%HpBCX{qBlGQ&$k3WNyBMz<yv^bWE}d$4dE=GU`C;$mkY|!*
zUZDvr7oSH84Q6-JjW`(DEdlk`$?^w+tC<!dL;>5~OFrVO8JV=|0pNib18>^JBu$4z
zw5skQyh=#C?*opCP*Ksk;5WH^JDGywASB!gRh9)8pO`O`Vt6h#X>r&VpXZBE$8lL>
z5rc+|Dtfwd5&f*nt<%XN?e!+6KQ<4Db7-tr5!!}6!YBmIFj>_KR~99x!oG68UVmk6
zRxbElqYJfM5QW2!C%0Vz><l!T*u~~}hQ6`>9H!7mBi}Z((OaDsez^o-e-o4T+w}N5
z+x&b7maZXT1GAL5Q}sZef|YTlPYw)c2F9UyW1NE%5`_JNv)oxfnt;}-_|9p9H0#|`
zeQATizr<u|#U%U*6h6b%l%+`fM<M6sQzD)jSQ2C_IccSuCPV2_z$xh8#;PD$heypz
zAr=y-1NWF@zQ;rH<to*7!JeovYNp&V>4x<A;(SjTsc9f3C^&y03QoNt-C8>k4u-p;
zgG|O2340WPIpo4!l#9^=pc!X20Jiq5z%breuCg{~14qUkY7gaSBhrdXWg$@MjLbi&
zaV7F{^+(GKYFiC3%9#7Gtp@&3|Am;;IM7~~-)nLYa({dDpl)i6?+}62sTE*^Ayg9P
zSljQ+$U&E%bW%udgH}=)ucng35g94j%ZUf4h*n9hoYyxLe17!veQ&0Rn(e-|#7O^E
zf1Pn0jMD>#Mi&4J0uESa-<PZ|gKads%+sg_^In*b2A5ht^Zs|6-&;@K_Ay8eXeT4E
z(idyEfz$X!b!!Ldg(`dbRc6V>E<yF8c!#U7qHS1gSoXrcg(S+L&4OyQbw&1Ubwq55
z30Y;|Z1V|0sV-?73Hld%y|ONBvXr-_XJQwX&IVFl3Tla3+T^!qDf7J(yDrXzai2w^
z`>fN69TO820VfI_B8G$^z>lUY78$_{<P4S((|gCw4wh^sg&fmwFg{V)*G}mZdCkqa
zSI(b?8St%yNmEiARoD!Bd5Eqr{oDA-HnDhtHZ;5opLkRLe&Ssq+if1Ez0KZ8;wLOi
zqFlcbtJ$F?g>{@j{#7M;QYWF%n>#S$<IkRzR!E|NbiiFK(ojkMX<6+X)Sx3~g6i_8
zMM0^ddE1-0{ZIopv@EMqo2am*6VO;G7GhSrCQmxa{xAzYqw^0=6VGL*dJy}~#$T+d
zNRUR^AOQU6J&QYxY+&dO!GJL}f`W4g2e*4-7ig%I2j(wjQXPK%PVnQq73waE&(Ww(
zQGY}I?^Gse)=5NeVv^htPB3!u;X%LPidd$;EqO?)hvWcGz24+9jO9q#lb2Z!#G*|k
zZi-S;WBj!Wg^ycg2u&v4SNRzQYXdOMvAHV#ij6!i_r2z_Tdc+5s13Z7C)*6Qo{wn$
zR858t?Lz3T5W;ZZH$#FEM1cuF%tN>zqn3(flTLLk`lW+UVp<n9Vht@rlCMB<P?`bA
z`zD7Pux6Vcr;EdE8kzHyYp5S~nLjGni7Hb1EBlBu82z?owHTf^&yH6OV0mx<Xg&i0
zm0)X<JO9equ!RjN)097#r~rKf@p&gO>3hIuT6dfGf^ETGgS4Mw7&^bSI*V8k`w$L@
zr9Sl{AyMG1|J{6Ch4=)a3UA&2dzgQFc&QZ})Db4)P8HM>51vd@puD2g5T_xduM<j^
z{m;jh?O~sK`bF6`qPI3OAHf?Z&k$$I&YL@JiVo0|4B(0HbDvr{AE`eH*4BbLl~`+i
zs(fFKlrZey*5Mzu+YaNBHW<&UGw6)(EC5fwBY6d3R=Ke7t}*$J1s`QI?E?F<YdFva
znFXYyf9v-?+lJ9`FSuIeDD@>#Ct69=)ZrEZzHO0y=sJO+JrxA~afw3b00MndVBem(
z52L7;z5A_#U(7GhjYcDXf(?#Vgmt0EaR{5P=tRJdS`e86&Tp(RK`4+?5UGNC5iYYR
zXCO(`FF~3L6=bjc=wX%bl`7i~6Ew>Yv){Sx+v=7sK7#u_G0vHU4}GI9m{d*7V+d^0
zza#y{;2<@`<`6=jUxBqmh~8=%@NLh(Ld5n0vrY$J4O*=d<!K3VO%Edr-3tDh6x87E
z!iu!@t8n!96#r26l#)gXV?{A2r;7;xH>d8<=uQ`+V4%4OnKH^Z$J6^v7(lCtbFt52
z&uiq1ToO>^5ga2De$$OB`hhOr>y^~eb}c0oTe8gEH5$B|_1H2-_6GjLRLivM?H7Xn
zhYQ^(Z*6K;vV(JjgsJ#ho#<-b(yQ?f`-^hGkJCJ40XInQrSG4G(b-Z9g!Hac9qo~#
zg=ekh*FOzSBPb{4iGo3W#gymU0mB`-P_Y4S7uSyXvIq8tkZe2iCGT{N4AiY`AhQ$y
z4>}q?KSlojrFeCEGdKQNGbHN1smip1r}uY#8<I@fAhgMGCN{_E(9~5Le$&NWcn&jh
zy0rWwxA2J30>Vg%;36!$)hsh!QxXX0yf{BMMroYf#S=g5=YL37ra!1UGCUW8@wmAI
z{xV&T8xJC9T0!Ci)tPpU2jXN$a*2S77rZdt$`#`~gPm~SWZse^&KEl&!US@L`ciSA
zBPWsTdp43GejtxCO6AiazbZhIAC5_N^*DX$(11WlH41}$*U8u1X-(lN{@Y&gC+M)B
z)Z$rWA+UVrF|@`3NM8`sG~m791uG*mr}tjv#0KL**KKlKed9uxfIck<|FzRYh*>od
zFWvX6SZi|sRCtYRY1Gc7o%nEyq2{Lb&EjNlbq)0BAvN`z33m9@*R(PQFZkwkU@rcc
zdsG|oo4O;1*`YwYgh6~@w86m)GB7&Cnxkf8@=k1n@8IKb_C9&C8Z~D*muw1{?=yJP
ztLlub-;3-O9o|y1iCY$W<D1~bmAPLa!D&_<L~@x5yGQli=P>%*xVpKBfdifmwdAXp
zJAxR!$26<@q4KzL86jWuABtmlm6l-A6WZ(nGF}H9=KKXnr-MSV67znsOIp)2Ui^~1
zh{B)wN{(|`!jS7uci@SDoDC&Z`BLs%-fwU?NCq`?xh&-wEPk%pm(l(`KUy@#X{(Uj
zl;yU;4tp+S0jNU+4BT&czUQm`W?ndJZEm1PhKcZD$ML88lY?g#f8RZuRdW~XhA+{4
z<QP1_1?Q70CHee_l|LTk#N9p>TX3lr<InLBdGdg1?n_-Xh+Sn(X-*y;WX3il;VUG_
zHvD25#O%>k6xc)4gj|V^Jo7iB9uy6}TqhV?BQF8Gzmr5Ee!;aO+~Nd{%e_T!)EMmQ
z<dT0N>`Mmh<`tj{^40O(Jq#Nhw|iplLXg-wIJFJH@M_H-GOhRcp-Q!YmnT^xtAP*d
zH4y-#U((2SzU&tqz+Pqap1Kub`7M;QLHy_l8}U?`41XA{r2M<i!jmA{9<Mr}bOhBD
zai-=0Vwgp0p`fhb;g-C%dc;rTR@B%m)mp~53jyZ(rn1L1!@C;LUZ(B;$vp+n>L3(+
zKMKCmXEOhM`;NEL$T>0BhS-KozKSl#%7u_k(uFW(amg)Rv*D@ld{M?6*3Ap&uR>Mn
z1LZx;fAvY^tSxQ>B2VW|VD_G9lV5~j^OGdMT2t05alwmgS1%qFANLZk*h5CF6f)fr
z3iO)Q7s3*U)bCc$g_7-uII{q}t(-Z4(WS;LfSG8O9eg9lCp7AtW``KlWsN-kntb-S
z$%XW_l!?cnh6-54Q#*s3&Afp1ll`VSUpy{wq{8EKQc6`ZqQmkQ>-(r&=46C)8#}x0
z@|N;%IaA(r<ax*KU#UTPG595l<!DOPyi7PSyZOmm<(#F2YqZHG)>Hjx3pq|Aclx1R
zLSK;7C#0=`;hKJ!b2pfTFE%$^RV-5Oti;wFG$`GIl^sEfNA5I?${Ccy-#hrXFbbQ0
zc0E8eL!Fx0CPvzlJ;G_}W&J|FT!b7QONI9kdAJ@8aQ1ZIMd)Wem6P9S$3K9dT8dC%
zA_#gd{vp1g9%tsqu;*4NG+B~;{uxP+*j*^a9lB@@%DyYwvW%V&e$W2!ov`fCKEjoG
zEaDubz!eix@{E{6P%`DzxAR+)8Sk+TbfHQY+}^j~@f~T?OdN;md#bJ_4mw##bY$RR
zEcX!2fKsUHl^5@vQ{47e80-X6<m&6YucT7)q3Sy}$?!AF<PrjoqE7I8VHWbh)D~@|
zi5bmPzkBjaL>%C4lDUbCWRJuCFK+^kY-U4m*Ug}=tpig6txV%4K|lzz!#jiTpu{26
zS}b}|rKeOHEs`&`0hQL(<0+DUGEyYV8#^#(5(=B@$1z*}{qx?%XD%^r*W;t^Rq~UB
zb*bxhxlOts7v7s#RXxJ<^CKC(SEsiZr^H)9#qcZ)<lRXxb23wl0mpuO__T!9Z3w55
zXj$)ZP-994Fo)7#cF2@Q#}6a^aSbp~4e)q_FHKdh6y>JH;K~MM%kAARYy2=}Zm?}A
z-7q#}<qzD<k+zE(`Cz7Ip8S(j3BC#1aEzuT_uCEQh2?vw#*4Rj81i@JXO8AtcX<9x
z_{Q(&r)#HHCHuyWxix>_6f!RZxF+a^B`g;c3^}2nlmYnCVSKRbO;gfHK_r~1a2E@X
zO(afIOm&5N-Zpb1)iazSQ=dIN7%Zom1^(nnDW=RXanP5arXY8z{_*&m7q(atqJEq%
zVZOB2n1|TYiFIy2uFyHmIFYnhn+Th-GI!sTHxHs9EHTkz`k*poGXCaCeJ<E=ww%6M
zPlK_myNbS%HMt+-#Jt_RpVy8!C*+S36e+U!Pkyyd^8@=3!vA2|fnLxth53^?v6!F{
zoRi(o-<hZE;d|-4IqN_x)LYp+$OES%ey3*?z7P2TFfHC-1eoEbkRdUc#r$KCzG;_$
z6M+b>XS*u8rS-ckDPb=oeqng+*cagm%)g-&a)-<MVor56WBG!ESgL804Gmt^b;rYS
zXRVYHgkWmStv0G5TCPAvgJ;3q^J!y&qv@;H7-k1<MV*bDT#O05Un6uU?K5P&7S(pk
zIe~l03RSqj)|my6Ga*wYK=(0*OF%1%sY)Se0UumB(tKk9S!3qknbECS!a|9#JF*Bj
zD*5qH(sVKMyr=`Fu-XEq=?iV2<*M05n!F$|X)4wrV*yFJr)Zmoc@V@?uW=6Ot{yyi
z%>i)?SCVO!{jGIp`V!3p@@HlLV3|~AWj}VwGnr6<bEPlT_e(t(M~>t0nxSVF%s_dt
zAP#-j_Ln%<zNAaL@vgX~8wR6TdbT#_M~AOIaak|nMB0NNF<jdxvWQ;X&H{TQh)P+8
zqdJRV5+--BFHiqu3L(nR({63y9;MD=CPlnS3V5tg^Th3gG*MX~(8y8wt+21p3CdhU
zTl%7kr<xvezEN(uAFBb$VneyANW&G1(QWL0Vq%J4k1-Qg8Ok_-{Jv7EGhe9+dDmHU
zhDr#r?7CAEo7{lmi*xxL)MJt6m3#%Y@6Ma7ri3gb(Oqc0l2`qw=+v>mymRwSK2$yI
ze3+ihf+&?c?Ct`54YUxoThp`}9F23z5CfZxQtojeRy$$>bFxb_?Fk}<S>){ETmCFU
zwAvhcd0l<(sgcIdGTidIy4UFJ3csSFtemG-#j%U4%CF_mNgIpeO?j_FB!Pj5YG(yZ
z+CuVk;!jmuc6R757$t2VT;T0I>p?e7`Hx%w&t-8=ymcP8M6+VI1ELC1=OqKa-*RUU
z)nx1|WGH;OnkGO9u{9jy0l=2?8_A`nHIaYJt`!in?H{HOE(0~eNDV!7QhYKy(z?ZC
zVJ6v&JosXQobV!lw+BW=GXuge3O);96F@UeBs}43^HQooF_4%a#GaC9my@>(3v$8{
zwQQDOJ;&w}ia!n}mJTHb+97mnd)uC_PjGbfvdyym+T<cET&V;Il#l;IVcMd+rJ9!R
z7~WU;pWQuFy|*X}fHjxbp9QMfbm?%BKmpv7_<uv6IQo4s$^sBS*3E^C`1Eiz`V}|V
z)Koa_2TB2w?Fn&@@4}M{To>P?Uk|+T^u2e&H9o~t<+UI)3%HWfctNK5Z>QY!q!Wo_
z;u-RO$$#sUxba6|mJPTaXK<F2M|gIFMeA&UV_q8r=<?L0hE<rc<X?UkUK#>a@Zm?X
zG`c7v3#*g-9bn0>N0bzV=KI=!Hbr$4Win5=_P}}qj*X}KC;NLVM|tkv@iB5u(UB|X
zz+{P@z|6`MjoO$vWVCMZfVU2Ki8_7GC-PWj<%O?534P1P`M%D|yKwz2F>uER?OY7U
zHgU(u94=rbCK}?64v`t=IP&{=W!k3dR9-jZ?EBl3Sf>ykJ>+|xa-fJimy{q1Xpap&
zU!Yt}M1z^+>mx6%4d9mMjua6CHbMFA3F?gw>`CdOvRLtsuCK@~i`B2m*1WrU0`*ZY
zQtSAoc|g`wxK-gYPYlrzw;Ne+E)Uf`aP-*Aq!LCw2v<BfT69)j$1ynkxQGNw9c2P1
zIul86&WO+E?LQ<bw)QYL;^ti0$O%~pfmQL{(=Gq1uL2m>42HVG+&vKFNaO|2)(^z1
z^icA_wEz0anODL-QMwb=o0I1MTISuc2B89h_#d`?KML30_@Bh#jHsi=`Zx_5)>)EX
z%7#BF+C33GwR%cbColiPN<;`g9B9^0<@`P7PI{b7Z2@A9QREWp*gOmA?j#sqxz*WO
zZ15x#KQr|YZ+8tqu`E4vK3@SNc=Be}eJk8{k{TDU{=*^z?>j*8@CA~<lVmsuji;uH
ztLH8lU0dgDcnp#*n^;!ENRxl;&ynU#_uOCQvb7^kE5a#cWASPf;PS+79_pl0Flq@H
zkGx~n`D9vZ5Fj;SXO-G$YWh|6e!|d7BGlJx_qfX`SVm=d&cCRnsZ!>zMCZ6m(=ZHB
zUM$GG?FBCD1Wev!Nti@Nw;*`_;j-kHo^Zhgl8kyT4bkp_-?Z0fqsbqT(1LLPCmy~b
z8AwJ?&E0qy#(W^qs`6N%d)sTFiKCcX$?~c^|Jxxr5X!zxpXafFyDF3T^dT4!NDDRy
zzDoIJTSvVtN6A_+$cg!Nl1Njb>p8bJQ%jR*6I!z@z-8o{ycF{RcyT(576o&*GBi=t
z^?^Uu(t`^0FhpeMLT%dKR0XCl%-;efCLy%E=aM1*dV4_TFA4oXfU0fgF3UL67yca@
zQ37fnwqswJVvr}hf7G-RZOS+!zFpiQ(wWpesNE~1ogwI#D!Ht%?JOkYuvbR{AvG_&
z6SdM465ocNana8ad~K!Y)2|dYXZ(%#TSUH00TJ^XieVbEh94UlH&kNpiK&`c<#4E7
zmMjb}bs<Q?`D5+=0XmRU+sQBTY$^%inr~spVL(ZYa>xaHe*U=ippc0JACoM#OBUv&
z_2Af&-v~Pi;mfD@zI>^>KqTiH2x7z@A9S!4N|5uPW<D0*VV#YP`Ns<KAX+PIY9KgP
zzz=GO6Fe({_>?VV<7$+hjMKS5c>*bU2>PW;=wO!7aoQ2EKUsm6Z8luu3s}y<g>-#Z
zj|$J2mD0r0e2Z=NxiSW=dP3aYFKEHmIzXw7mdH&UWMnWKv%YNF*V_>|>k|`}RWneY
z$M@kpi4DKU(fF0;_ud}K-{t#{KV1W??2q-sC%X5fn?6fRSwyxQ7#2ZRe~5HKJX3mp
z7gc2vbeI-GoZSiI{|ru*Bo6X1AxHfR$y7NqNzfrsMcX*@Jiw^ye($#q47o+9#mLWr
z^rih*X^+YqeR3Q^Fj?9UXF0<h>zk(dy;CnRgahlFrN!Xq9XuigXq(T(s~P5=&U;!z
zvVV4iV{P|XT3kegaHuLtH+_4+L%6q3g8owR^!8ay2DOV<5T|q}Sc73gG`l$Dh7Swv
z9OyYAntCYJ*V{Q6=<0k2RW_+QT$OIFs#FhkR&^OW`<X%MU|Kav2S@mE6lr2kxKGQb
zJcF!noOUqeA8Bx=ORBZ&M~nx>{Y)wIrLw3ava7i|X7D)Ls4)Hah6eS~&kt2!^hJv5
zS8__mnZ==PA>u}NP8n0g^ItBN_O&%giLJ^b^JdL7h}8eVo78ql&S0s%UYArk>7)DW
zySfT{6{~W?E+I{z<V|X2cFFioJlre<VanP$V@lkT0^;=j=5Cx0uY3uNjh{1*W2-CT
zkL;4^8~=aZSo}&ViFWi;u<5NFuBcxbQRQrcMJ<Empl{D%)VO&p_}@APtaZYm|EV(g
z-a%UVEb_0Z?f4h&d^l&7C&q@~s!q=y8dt|Bq8k5o>bB8{XCzWoxFTGyuHfMJ&n#Vn
zyHHma!Mg~M#+wC>W9jgW);u1!kLLQw$8S~M`T1Z%ks?p2t@~ffO^?BvC9!>H9N$iw
z=(|>K+GD>nYUmSn{i~rUwdJYVIzYcLmJ4>GP>CL3MG>FCsSNY~NOB-ZFBOaAYY2Lx
zhgy+~G0c1@vP`ZVQAHiKP-YIa@u-=9rEMcgme1FR+MAAb<<zMVZABT~i>_z|TaF3_
z^c?|Gt(lB-|0-aeMuHos<<jF@EtYNaodaUoU)4qH)farLHU+}W%i&nv*uq>Q2w3gv
z)$!Qzt(4mWa>2!T>}Br!>^#txIgEG6ibt<r-bJA!sw@EiH+Zn>qWZ!KWa(^O0sR`O
z#%b79rI|Qj4efs4luV!y%mf2&{X#Ag-LuYN=9I(8Nv)P18@MUiK7E!Rd){$4ba$wb
zYP;s6a^4}J)i9D!LKr$u7V7v^XiI8UukIGs!cyTKl8x9#E#LI0A1Z^%{mpI&ECrsz
zF2@j=Tve7ioWaOh3I^M-u0Q+0MsB+yegdk=9oUi**Q-OP>k#*=sjtBu{EO82#~!ws
zRpY7s02U)EFK9>+(XAn?MR7Ili_Ny9z4ts9Q0Ha9RmA-ZKJwUZ2~SjQAxnX62q~!$
zB+uIUk>>WVfd0IF=lz0Y6D6gRBy|*a(<&IW0by09e^#qr;2JejXKVGZfS!7|A_qX^
z`d?T3E#VWF*v65gnu|TEg98g=C=bv-G@ARsomH`N>TI#A|HBnO6*k#%G_@@l?Ek8Q
zsGq><-m*fL<&NcVEJ^;$bB<P7@jI!R22Dp7cABJKPQUI&HEY#<*57>B%u~|X88u>z
z9vpA2ol@?KLrRcR<kJ<!_A07eQ5iM<A$tFaQ82f&DsXfVzvSQG(;9Rth~5g(Yj#@c
zg=^IzW18Y)=#2<)(HS+6jb`IWwe@|KwcO0s8e(*30xng|Q;(hC?An5=US5~cwb~u4
z{5+@Zfn!^?rTlIdAhhnv4kL%u=lxSOw|`pn5JpEHM=@*vD6zQs39CX3AOM)(5`<My
zovnk1{el;i-$wEo0p-Xb(qxp3!b1)GloBxkL@@-JAPu9!QPlzt;v<l2)cuN%4!uMx
z6tjxM0jd3@&T$4dhF{HzHJ?1w?X2Ogc4?`5s&2<2TR~|+6TduD_K$ufW@kB5)&vV!
zhSJkY108y#A$I-PIKaT)kun9G*afnHaaGt5W!Ci#KA2BnD%AmSwy_E94gX9vw!XFD
zxau0UKrhKpd5dxjuozs40^`@qHkAij^)6u$&$A~EeRn}oIV0dHsOY@tKz4VhSz%Wy
z%lPZE#QQAuVT0hsvc$#nA*07C54@}RWa5*K76|g5JHB3hF(!I7Ja8Jn6OYQ^Oz630
zYpip#59v5HbK!D-J?USNJq7~!Yspx?`u<_&P?*u_{nJ=jgr_&I4H_<3XZG7>kGuu+
zSYj{1D4@!T*g+V*MUW@IbM`2BB?!KFCFJTHU3+6ZS3YN-dYwUWNf~bK@@(F7LV-hl
z)~$SqPLO-6iVyJjE_gEHN#<D~4ap(h3tBp-%Dt%YMU03`T^-y~mjeVAvPmdCEjeF5
zdD11Hi1_l`u)<}uT=L0WWhc2l4M{O$Gr4N*IfBrGwvi<JhXucMFnjW`vcO2N8XON*
z)@D(igY>=X%!!nNXnlo?+>*S4Rzg(|op>Bl;n`*~q$0s)a)Ff5)Y-e20FMQlm4;m2
zX-TNszO$x`QJmVSAw7?U2oW5Q#q4I`Y00%&6S083UV@!7SiS`k&y9z{aNG7DhTkwB
z;3jAV9XtL?<I_m6QaRBm4Sl(*&x5Q1WHY~jwS|7iff*n+)9Py=V!*Lt=yj2h^{{K`
z7|kWl=-DanKMGfR>GA-p5&8tB$scLQi9;LA>AjMPC4rs!1?6GL@h1VI;%Xml`3>si
z6GvAQ+C~<?)y7rHoSGDV1`C{QR%e%-AN2~`54OUls&f%om5byi`DmyKX*jCX&yMs|
z(B)Mmj8g9~rohS$4qZaAR-WV&?8k8Vt4~I}@_OF~YANqX5|L^oI4*ckMNA-Bp16T0
z0HxQ-KTavt6FT&VN2`ZNOtr=Jcf9gzheufWdYh@EhvnHNzBMiSqKYX~YP|9u>>@w#
z7WGIt!Wz`CP(wRYvM7p5T~p~n$)+U5Ibi%r-eGd4nLW5uLrO_9bs2Aid{HkXSM$Hb
z>5KIcM)Utsi%8G_$_yF&1w1n^@0^-ZGP0k5`KXD_jb>~TReIT0H+BNQ{7u!<a|9C{
z^&pf)&<=R$Uc8478a3x1^jV>ai-g^l!0IWnl~+P0=MoXUTME1?8Csir{2P#pXJq?+
zB6QNQrhlAw-r#dCB=1&!L9cnC%&$_n|F=DQj(;|{T-%LzrTTGCb%3>Ti6L;NYgVb0
zmgrJI@NIL<j(6oqD@+OZ2<PlWv_&0NNT*mWdE6PpvqhcvG>onZ;qgFr5l{KHl8N*k
zmbOd?w5i%O*bj?Al%M|`Xu%A)i`TxR^@E%j{W7_t^ADw(&HWMrcl1Ywn1S@R6Yk5F
zDiBW99wUXw6%_KdMZHc;-5YWdbahwh6yRJ=C~&ys$4Owt?H6U7DIf3vg<?RA1Yerz
z#UcVJa1XT`*+4?4<y>u1yn8w~g_u^c`Hbm4<y`gb8X*q|V;(FIgg~lbv1(CwAaR8p
zfTJzz$_Bp<O-B?pLTN6IUB3d~z5KE~`z!#puLNoEg1aXMOmgXhj{p|sC9E0(J5at%
z?Y7!#nk*xe<FK((3TLz9SUC?R5i-pMi$pwf4uC8%%BECNuk5}VK|<M32NE&OVRS>m
zV13KC-2PQmvj0(y(TzqgEUwmBx{L@=CuP#mMUZR~f5p|UNLIe-T?(-4);Y=kDlH$-
zuu)}n%FVA!KXCDJpLNqaVt71<bGx+&3o>sC$P6Wg?BarTXjEU=5#w_pAJZL)whj6d
zeV|%`k6T~(Ylr1n&VZ^CIHB0I!$N<>s>0X53d*)UV2<uCTiTyQ(dE{yxWeOHA%<$4
z|NjXv-(G0Q?0*S24Tj9vA9JgqN!7Td(v+(7adzu9>vAE{6UrWNq>b2E4uvi~ze~iD
zXZjh?j!Cz|q?yE$AKS{Z8EmdeGrNm1IVbzd+C;l3=-G7gA&}&@A`ebbw?e}!>|OH5
zhl(d$GipC8#%c++#QmS=HyU{$^+S!F#3>ZIs`m_sccHNSmM2w(VkmE=hWgo+ak?#T
zZ00hJvMZCybvbZjiM4`z{krIK+7`ANKNl?=P^7uNjHEm3<r%9R6@zOoo1|2&{l4ZB
zLsbM-G*b_sq3cb$K60se9#x6g$SSB7^e`al)t>#V#H2rwtHO4VXBNZ+IaI!Pk~3hr
z=>WgJ&fv1;2f-7$K0e%o75p-9T6Mg+qK}USlO5m3?%r1Pe1LQSB1Y~KHc)lo=57AS
z#!H%Wi$B}%py%E8)5h~!e<5Eb1oBO7`x(Bnu0nZEm1S%BPh^q7NngtS%O6sR_ZM*y
zFHJ21xpd;x@M>;HUj!skdYIxIFW_#>B-OglN{?46cc<58Ru@Gm;%??k6$G-Ga@t7`
zPRsRnSmXG2pDiej?^6nQF8|5PRzuz(dpZG-h-5~olmWl$pq^H_V^dBfbm#sjp2dpb
zXX7v}@)2ZT(YVBsKkq{xjcLf&v;W4pD>y_Mut^l$Jw@$I6rdRinP<jTX(m+Pp73DZ
z$QL2ozEur`Hu4HtIc$`QrF2kFVlAAD_Ip!IXG40h{p-iT8Y<50++MOrlGXn@X=Ahm
zD^$309Ok1GK=^nlw$8mT2y44ZNxjp?@W2;cKa@Mmc3}~BQkD3AuSSY}LI_1xZU_{j
z#^w4tKdf)HH;w8p`v-qQCtcmteso0?(k`TK>nwqF8kNV|TnNa})kCoi8L9Kpi7`U^
zU<+h<*F<?i<`os+tZj#6b~B;*b{RJ^ZWq7c;1h-gVjDhb?lfUCyl)JqG*;i<<28gV
zVj4VQWW{CR!HMm~eM~?5*-!jZ(_zz#w>VAi=bi$1lwq^8VR$*11pBVng7@<wn_m&a
z&ff6EMW>81ajy(|qSeg0o?>3|%*pC<yRS~A*Mf(ns}`S53AUK?1WjcRAR79inF)Jz
z(%cn~1HPfBQ-6q$2g)8?!m1g#KS`z6#kLJcDA=_Au$<-?r7b$YGD#!8i;s=>bRGBx
z;5R%xq>?r>;He|P<2?>2LwN%Nkoyy+U9C5`j^z#Q5y@EUC?N+XrHoPt^yrx22O%Vu
zhMcnKdjGgftmUXEydD6gs~&`AFz&BdNv9@_E>^dO`~3%Mw}vq*71dA~O0-(#@0@K@
z+R_ZigyJ}3xo+uG?Y}^)HdQPYP7MWajUctM6ik(nk~rM5eATI&DlzGW++G3~jN0lt
z_jp4||C;KqwMZkL)0%qFj0Xi6u=nK_H89`3_!{oY<gq^Eji0*C_qxUMTaoCzJPpLw
z=6Uc;sCa<vkWO@l7eml#tc;;4z#-!)SfV|r-HVmJCU}QoPq2kQ<FF3r-uJC<H3mp-
z4^{&s-kCHF%Y_f_iH<i+%g;~XUbOJv47+-Bgom!-IUVcv8!87eh?K_H%%rW|HWL!L
zxE<@%AN29u<2M6&PfXXu4_ZDLaLB0AW-efD%C%^_<Z32)2?ceNoBt#>gdu%lkT%hE
z_B^#*iX@Knh?+SUix!W^HX{fyZ5NW)=Fb9py9raMt~@agYzFp?xR9<wS3!5SOkE7x
z4${&Jgmh&POHpXc?;#coP!yFp&kwex-G+ZHr4=l9o(DG23W<VTe^;)yvfzM9ba>4*
z(dLfb6pFp8S4RtU4G55>s$S11CJ(It4ky1ht$>2Q!su2VWl|oPbsH(hzm69$!!?=@
z|9oDK)vogMtv6E(s0*^d2U~~ihxVcsNXwr_3<uuj8%DwCZ-Gxuh@M09ktbjai$~Mr
zUo+x#M=m)1(ASej1AU*5^KreE7+;Q#kUKzvW#H@@*9(k#M_8})P!Q)iKK9@9C$yAM
zUCHXg`CC{;nE$e;PQ~Jx&RHuq?fVx9!(vA)A2zjM{m_l<`j$Esj9&A~j4!tA6!_Ye
z&5_R<_!j*hb$1fku1<%l3efIJyXLLy<MhPS&1ZYp!OhzvzM0@&TY1zzTsA!rC|TZ)
z#&!z6w9yM#p*$Zi`F&(0-YoX|WS8o;GWb&mcwN_rwu_DFRbzMahv-PNI2+GhXm<%c
z4~CqD>=#6U0!|`Eo0twGY#((S{|tFI{3N0Wzr2GtB1x*F3au8SYhK$a_HHO_io}@0
zzxrw&|03>ky$qT$9K^X#WYUGXPvj8{{5KFUO94&Ga8L=Tvd?X(nB_8;1~!mAke9!R
z7#v_0k&7sHxC_2remfK@3L$9q3n{AzC8<qX#XQ%Rs<Cyb<j4{D8X$YHaqx4D$;_zu
z2%qn(T3FS7m&{Ctk~<K0!AjAt>9YBz+wdaWQ~D9U6nJg;N*nt#6`68gdA*;6Lp8;F
z<?=^UK}RIn;7Ui9IX=E%^1~(N1+^@LMnniu+y@=^o%2^SRw*z9c-SPlq8c^Bx@v{r
z8f~a|sw6}FAiJST_^=#dsK=;Gi%YA%;6-qN+1bp>p|#)@0yHs3^L3~bqhMRJqV0}l
z=Rot`;Qc;vN!r<rKci36K{iAn2C5!ki`HO@0t&}*Pf>R^qcvq`isbm|4jKNrvm-Jw
zo^vhl=x!!}lV>`ZHJY|VH$3?f7sOY$ugRX`|N6aSo+;%4#A0|ttjOq(WIV3V3ZIt}
z#+xbHVT>lkz*@?m&Ytq{SQSY53Xa32Me7$q@lU#{@Ou6jmfPa{QjD`FWIW%i@=1O<
z00g_w@zHhIG!$mOZH6YLq=x4`k<-pi?4zpn&+v6;a{-y{af88}Lpg8U?=^_pyyE^y
z-_ONBoQMoJr!!l+YMb=F)lu3Guh^eVOX!>do%8&D{<YGz%44Lxeqx$v>pOReNUz}f
zbPQW}m~;%~JyDI6a5SV_n*4@&+iQx#+s>6FPB?WV5qfXCtL$propJruv$IXzw+@%*
z@EG0mnesbu>>oRdI}r=Iybtfwt)jN`Z4$_7@cM!r{oAWW3z;^bggC_CM>IC^e5>J^
zg8zQUr}+eU1RA~+)a+SjC>R_z&EEa$6FvqHB7>LhK*D@~)){QFbj{5u|IglRN+rKN
z606#V9>m+_%Xs!BpBS(F1wv3E!Tz@Y3=(Kt40N}<daxAsAPML6w!hl_w3F1pQ2Q?g
zmxT$1{rba9@7HJzQsq~&TJmV}-gwBSoJ|zcOzfAys}P&Crk^*8%#qtFCk?k@NAU9g
z)qgo@jMDjZ^DvC~k0U;v5Nh(CM0kdKtSKje6vl*qy0Z#sp>{f1H+t%8760t6_SovE
zA=w&lOMaOCQ-@cAMxY2v81=hHs(@6_;^7oI?y%}m&nnY$wuQKEk|p_~4K2bMeD$t@
zW;r+;{7Z<hkf_7jXCP>2hb+{_zr!SD3cGU{^<W3}gtw)O`}#LS%>|Jr$u?(0z{55W
zdBbb)&kE&D?oHFkhbY!4$kLeY;z?9S>}k+%C0&bl*ACmC=HL_;-;aalo_C4Tk6|`N
zFdDR1<yfeAZ(Swt&%~RvL+Z0Yn5`HknuaU;@}NFuemEWdsC!qKKpK3o@Tb=_=SI?7
z&C^mA?BsybiN(WHeICRXxH-bUC9Y3CL)E0lG@k@GZtt_IHr`k<;%}VK-g_pi_E<9d
z<L_|CQtfexngKd9(zP3R)vBKl2oFWfNs)pv{Ff_fMYWI11E_+|(Z~QfkklE+jaNV`
zC}e;JjTmk#mjew&$wEPZXN`~&&i7@s+e%oY%CR7L@jaq9Tlm~Xa8alD=LqYUwopDu
zBd}24au@Tl#3mloqi(MrXJ^q=t5=U+%9E~d=H;i6JBA~heY>kqQ7t*mT=f4icXoV}
z`Qa)*uTs@;;*g#H9pR&G{rpXj7AOQ%BYZh`&AJl;3Oxu0)j$|kC!**{8&+Q)*FX$c
zVWP@k^i=Yjx`%z7>8?M_65H_y#CIk6t<q4-`F@+^ph>p|TaZWX?*@(Cne_0xYnXe1
z<-!j<v_$#|j?|09hHN|cd=|!=ChyVk(yD4JBmoPHu6tiM@UI>PiVed*sSbQU^r21n
zyJ}9g`7QXfD_&An|MZ`yAnL~gPFej8Z-xvl8Q<XHoL@hDfO+1P^@esoPobTfpng_W
zE&M1_<h|}HB<6i6C4O>D+KG0(ZM9NTjQ_(+Etqtt>q&B5V@9l{tW~|>Tgn<A<3@Ih
zGwOTBO4)Fty-o-7s;mR*9BvxfXr!%a8}bm?%4<1vyOh^i_vqoQ4ql@_X<}9FW0l-#
z3FQkhWFS`Ki2rjSREB-n6e_8E-C7z5%c!aYy0hn8l|I&@X#n_E8%x4`EdJFbsr>{r
zWOy95Y_`=-MDtERZjYm0Ps_42B^q03Xs&$Py9)Or8xuSVs9xwhT9k1seK-q_q&sQC
zk3r}XzkWeFr}VAf<cHaqdW3iH@k+kaeT*Lx$$t`VgYGK&yP)bu_^$G|FlCn5Z}{2K
zj9GOyTkib6U_pqtJ(Lpc^w6xTtcrKmt^EQ~PBoS@4eQ=RU`B~ZErtz6-Is0_I@lCx
zQ*1id%6eonurSS;<Yw{^h+?YY&s3g0(@92BDLT$(bi!}`#BUuW?Hq}6)l|Gtsp$24
z?#G?$>cSCPYcWZU2sg}4)3ulKJKE@mN=P^Kww){pkCPdJL5F3}?}=aTJ>J$3WQ_hq
zv}Dwo!V#k4MAda)^y>%prKOWamu6;9UZ+MrqJ;2=%;1sA@K5$LneoPW4H`a-uI^$v
z_ri4lGm*#lq*1;pBp&faqnBO+RX2O?e~{npRz#b(pS+9Oh#zDA0n!~!a>v(jVR!LV
zQqJ~zePP*){8c4MsmqgGe{L7xooL*3|GG}u?9hFM`|0n35OL*;(S@MtbrbZ~apy3S
zfNFjKP5Y3Cb^P?-3&i;X7m~gomWIARks6P@^Mt?}3uoWJGw9hgV(srKunWnv3P$-_
zB>3aRrA8C|O~*L?*DaThCyP|sbb>F^aIK7Y7cX9H{UOgn>B=_Vh0gHBVGrM~<8ypv
zcj_ClfYXr1Ta%-_FbyVk&{>T!s;j-iLD#LD*ky>%Mr4QYH@9j&>5tWqwnGZfm3{9V
zUc=)cpQEPQ>zm$+57>rrKLqW7^@{=19C2YIgob%TUx!a9pYk!V?67NjBK<E3=*jS7
z**BR7a}NTZdaxjY2`A5Q>-W=k*d`d@gf@k7UC@SyyG=yx%$g*%vB^9NHYAYTE<#BA
zAoktO%&sa2TdXGjtby5gyX>%V{e7967<5!9WV+Qt@|d&}us&>v7kk&){Qae)M#6hd
z+QA^_q3hHve?nu6pwMuol~DS17&GVL3Rr}^;g3FAvk4}4jHs5_!7~0BJa;ipYi@JH
z`?gz#gce02@!EqhkBANq#%LXB@WUhWaVO*xhw)LI%97d7<s?+>(!R(eg`33)qFk-Z
z_O}pb=$`6g<7;poU>ngwYj9;TItW&2xaKlKlQN)D&ru%Rax5)4fL6Z%#I)zkMi&EO
z1S0v{@-;taX%GF<ywUYJ;>Q0D%MxI1$iIKGS8`!o70_j9_-yyIOw$SQL3`?)(Suy_
z>)*h9ULPIlTz}&{s{ZYU5{Kgsc6?I!uJB7ajs(-%Fl+ZKUqst(R{W?J+3Nzuh0Gfb
zw<mHwLu1@T2Wu*9o{zQRiZLU0o)0|bNkDQGIFnFcG17XE#p}8|`@9xkS8g_7wR46f
zRTtOu|FQJlaY=XY`<0qGsm!gYkEKtUD>cPgS=v&wp4@>WCppQ13Z`b}*33~kGBYy=
zn&L!ouN1c^?ui?mfH;2i`TqX9c*E=P=FNGXbME`T?&~6dg%@v@4&B(C5@uk322*c)
zd;@+8OjoU_{aHj^O)3~Ra;w@lNjRKcxA|)YE);mh<y;XnPp4Y^`|8V-a<01;{{^qo
zwu&QQyuWM3$BOY<zY~Ym6hjTx6SSx0MCwcCYp)fFq<GI}gi`^|aibCu6Q~-t>xlhi
z+(oeqJ8>bs$4#P-AO(xiklDDr>5E4ZXK|^B1lzpFA}LtI`NE2+n{n$w|5;o$zzK+q
zQC*hf22`_faHTQ$TZpJ@_m*ueooEY87U|TF&$7-G3T)E73*2s*FATv{9WWU?@3Ppn
zb@Ni$Yd{kco$Oxs93bT$<`HV@vcc5MH3Yy1W`X;t!-JGZybQn@Hoo|8D=7}S@gUA&
zCyAd-I7?uZ(L3s&<a&X{>pa;6d<Uv-(9pJ~k=T@`Z<SjM)@Yy0!E)h{81G?bG@yEI
z{?6vx9SzqOTuvlB80Kft$rG-0zW(CvXeBDnLi5?qNUN*!pk9b8M)FqC_j{GAJO<TL
zJ-HD{N65;|>}4ZOKu?+P`eBP}jv|+?p7JG9-~8BXLm9mHoXa-a_VB<;o1RYRFj$1n
zcCth73k}Y?0ao5G@HpIztM}%;3K{PdJ}dTn8;z$2c%gWL!-Cwsb<H&A*|NidKHj<l
zM`%YEgSXr0MiI_nwOvS?h~_An1;TTbwtvSNxE1so7#;ZLA^n$10xTr!_%4IbK@-#Y
z%Cn6NlIJuff}&U3J$73{%{$tD$N7B)C_TmgItXeP2sZ9AUy)i;5HZ%y3Eud10VKcc
zI4hcKDt&R609I<-$rgg5UeMWccOdg7u^ZB{+d<VEl4tu~4E0@z>O@Mkoa*w-m45n8
z_ts7Nk*3ya=W&GYE#W|MI2^bC<HgXItY!IjvuSjUF;|vfe+*N_CF%S-yX6!Y@85IB
zf?p(-YM$*k+eo@Sv2RG7oVJ=dg6nJpxjcS`V|c}hHAHxT#H{Vb60;F#eS((~wgelF
zVD4Spn!yl+B4hNn{A)Rlg`1J<+Wl|zQ}?W39eBRINfzfDh21)E@j-t;x<2o*-OGA2
z%phy_yuW**W6tR*F5SrMF$&~;{-Lm5sXyQT)bV8Vy|nD05`Zx3D!v&6kcNYa^|k&H
z^y2eDzG~Xk1?^Z|q<K}iHX8^~bF{8g=&2neGE=WzXwqxXKF0kUEQbl5=ot(!(Q3T2
zhMo&TH;Bz68iw6&P}!D*$em8hl3#8o*C;CG(-m5Rh@sOjMxbdxb{)LAP8OqPlQSrx
zv!)?v)4(R^E`x`5#}Xy4l;0rc@Ooy2z)Fs(i41quE)%Et{03Xw@@9>`OIv$cRZLLO
z2?GtI0x|orN&ZUU35cn34SQh!zbAX+wlR?zn!k9`dERzmv)2AYsHOz{!JqQ)gaHZ3
z9#ggU<(#{7&|$ux!3$=~9Cy1=8zk)&eUq<Sh`d9hUq7D)7knU5;&<Dg!vO&Hx{aUu
zX)MxP_{4n$?Ha#>>VEYKU<3D5=CT1*M#xQPKOuFMt<+@$Z0Je{pS~UvQ<Cw{a`W6Q
zTj=@vtm20ms(pm=l*4yFSGb`z<KN1_bV-niTnhnAle`i)Y#GTsF0fy9ExICc*>-}Y
zwxOHm0p?Tcg&Q&WR^dkHA%CbsMu#^!!CxdHUtXu<8Dg8c;^Jp>m_mmnF9~_^v&Kgs
zz>g*$*4$47Lzm4YAzDbxGF6bVcqc2htyaE%zf~(DG5-o#ll#T#97MdfJe(laHdxSq
zfh*>t8!v%3@?IFtYFMm9+&&4fMrs}to>V&DEcrUm%+I@=se&7Hw`--vH}qH1#n_%u
zR0vm={zj>wYjehTzpn(|PrZZPnjPMS-_38KGM#=j9B+Ix|M}hgytZL*<YQx_v2ekK
zp$aNN!R>QELRKRywniX8aVpnYX}^bUS_M5rWs=iAw2_r((((G(f!Dit$u0<EBg3P#
zAA@1jg=E#t@2FuL7frHWZ$~|Z{6%G7t_HHU6dOmrteJa+<`Ia-I{bOWRqE9c)bIZa
z?rLi{!`RrWuS!Tkj$^0aIv9)Fcw|7`6P%wyiwT+pBG5$R8REl<?<PViO^#$G>nj?v
zkr=Lu|KxA<XsK`nnyEtm+!l-u^Sn!hcLeyx(A^qw7f~Ks0Qh*TlT9Xj-6-*xnC9)P
z;8(_0eXv)b9rNPVjN3r71^^x#QIfFM2;8d#%Msdr*G&nj<$Jm7HVJ=s8qCEO0CU4W
zkWHyhd|LJf<*zX$xx3;o-wm?W0i|Ey@NmAib2lMVki(xdTClT#Fc9;$s@WNQIUhXU
zg^w9Zv09LVm>BOo?-)%yfNFz!{3F(^Z!f88?GX+1ZXD>=pg4ngkI;N|T4}!jjZPW^
zZ}{qBPiK!#HeoeiS+;+gd|@(@L`QcVtnsUWf{kPXSTgBoCOk|y>-m+7Jc0O1o()lD
zUL{{*J;_aYUUh~v`(M>R0Qhd4N1hijc>Q%@)Q;q`nQ1_F_;t@Zum<4j(62R+`<(Vd
zBS>DRJ~boKrq}hyp+ZpS@FF(wL!qc+r#n_o+s8LT1@Z*tu2@sMtHyESdK&0sJbk|6
zjQ~4b^LB`PxImwM=iq}-4na05RX$Za^KM%J=i};s7v9^Zs!U12z(*%M_Z+8pct7o2
z3!EFFF#Ef?c$pnY`Y2Uhk8)=5{INaqvE+hJ=+FO>9%Qs(6C5%5hLy<Oe>4^(&HMFr
z8PTu&N6!Y|dkfsYV_ac~{pYg{>2<HgmiCT%<*fvhDO8>eZlL#pn~#zI0cdD}qr`1h
zU5%cOjOPvPXk%<zp27ljKxtdpFY1ldP@PiSD$8!@7D5TBM!s2fOYWYEFR#V2jeNlN
zDXve1Z*@;83vEp^la=WN0qvR^-YIunGEA7<GcD+;)nDY<S@Rl;3QMz&-2CHf-1w(h
zkjih1x5JHyJ+2A)9{DNRqK)BmVu4pA3su|-GU|qg)J6xrr3>06@E=NSp>&`q_btN;
z!rKsegq6-9cyJDbvfe<y!KIPV0RdzF&=}NdfFc|Woi5gCVlL8ib$PA6#w!c6S5BY|
zxtgHusiX6CfX&GurQGuj^tx`fKRL@ZSZf&INc!B&q#n<xxVN7F+m2+hhPwC|rg%Q(
z+N@nW{={P82#pHF_o_Du%h4gQ`NooAS*3>DVL$k^8DRf1dAv>bJYe5?ioM1S;a(MD
zoDcN0Ff27mN7c{Ds24eCHy8~O&#no{d0fOKMPNt3LuxZ;y7kO{w;hX~92mUcQp`c2
zdxOi<)>IB3EkU_LWV~uVCyZ#A+mtN*Zd<PFBaGOLoKsLgV{CQDe5zYow7khvtB>$-
znLEyMw#vu^_7#;9-1`Yj>Kk0Isg<6wV})=5!l&G}aba3-Fw?nJzsZwI0F@8KR4Sve
zviBTWj`=$}f_Bka;p!zjThF^qxDF=RAZt}F%6dIV5&hQxEgLVtfGc|T3j|dE9L)C$
z@GGT??V5#7y`Z3XRdcH}({HD@Z0oSs4>xk(!Ebzhr&;T>W476Q)yev@+K@Um$jQ3;
z9n+5H_6O!uWyM`8YrD@hsi=MWt(~8wR9BVp<I=~DfLn1X(=eQ$TV?Ck!G~!rt2x#I
zg0~iIfuynZt2e+s!X-kFDe2+d*$Zzge3u)M-OQb#xdn{GsLprifUPM;BZ+D6s4lxK
z-vc`I%fq*TYV8d(JXfgDR$0B)E8&srl+I^6(7))qE?fu^Y^h1^WzW{8kf9oD-#l7%
z2L^*zpi>#;35T1*Avje}<1HV1ldST;z$(~K7Mwxd^}~<vT+nmY+zO;9SKX-y>xu7v
zkX25B4UHF&a_2)_ksC1HDP*=kX(lhAV|6@h3k3=&2;6w<TJX8zpi<oA_8xJcX21J_
zvc^Xaj&E;2BKG@Ii_aIAqGJzZ0+|81O$Owi$J4U_Q2xQC85Y&5nE_dK<pc9)d&DJy
zSIh@c?06VCBLxWP(2HEv*M!9)E&)J4_0HCa>3Bqzm+Zxf-s_>%mq76Nf7$K+a_#=H
z7WJp%gcxr~IlLczLLa`1Ef|HD_~h0eS=EkOjeAs^^2cdq6Y$Q{G@uS&g!B6&;+sgZ
zm$|Hk#%w?zJ#A{H<zfh5fa|r=FoyEp&Fp*`5p>`9#26}0eVXdq<m_3_89a?gx@&io
zBu4OKe^zz{H})z&nhpl}{}c%BuYd$?@pt$3hoKUer2ZU=P0~11$}1ntkItLKZOSD`
zh*&o!8<PoBF0bU%RPj1lyB?Xa8v>e`fg|+xL_$Gx;Xqvqp!X<U6LUbBFjtKyb2Ft&
z9Hi7g3Ict;ZqZ`wGS&%g5%dXJ$Za-=>KKYg^_|)WakG2U476R`%g6|W6xHn@fSiTP
z&^?D)VSAj}dL27xfin4vV*F?y8ZPET^JvvFiV*W@(&wEnwv~z&`_1WJ*n+yE5|Tyi
zPv`nXe~G&}vwSvoOedQ;c`q_$bXcZe){X9-NQCP<vt3oXR+V+bw9V*}wb^?PY4*V(
zC`*E+>k_-fr1EQhqx#hJ0A%ChYY#2ur0AexLDJ1B3x{32|Fz8m|Cu<oyuBN9a(iG9
z9CV;{MmNdd89YF0Aa6m8HkBNgm9_Y(3$W_uOKQzmor{j+l@0v;x#o+65-uD!p2HbZ
zX&es1we5IBkIpqnx>SOtG<9?pH3^bfRJJzXj);@+>2Rq0k2D{w`g&Ym@8vdV4kT5d
zk<`1Qxs#Cy_L$@BZ3KY6r+v}b%3uyZ9&Nf4h+Mo9TaRB8nibDgR}3&-;+X%aBobuz
zAX`OGEwt^#f?;B03+`jBJWPbBhSJkyN(%^;fn6ViSRFJ;^Qmir^|p`qK7!V+=)F|>
z5!kgW6Bc2r`7(eP+!)$cEVfx!HeDXln&Tbh<!4aCtf_O?KQehT&ap9dVlUUX-ft8Z
zIt9V9awLk~`PkCjlmv-_;Dfx3*+{e_&I2mZW4HLMPGPO$vUMi|&9ctbma$j-!G?|G
zB^NMKb%t>k6E=!U>60TPVatrO6Q~*J@X=BqHG)yxsTUX25i$Nf1^y!;dQ7%$M*b~I
zelyRz_g91U-dE?mNpk&8*74gQR}SoSCKacVKUlunMm_C$WgqJ4M2EWeMpz=@xYV(*
zfvl6yiv(V*XWOYP{j-d-<^G>(M8X(~YHk^obYyj?c|EvYh<?S(ST0S7u@uO?J#~Oi
zKC8Mnx*Eot^}63(_j-ofS3X<^!^~6l>x+cj#tj7HjM=Zi`d$K`wdUFpPyh>RzDqWr
z&{yaYYOwlK(mtcNaAakV88pP(2Os4mtPAlWUczyHv5#V*2OZlw3v-{?NxzhDG1bf%
zJvFsDe@kx@%wDed;DVy-PpNvAXIhYo%Wkzh(QmjP9&$U=7Ea-{S+UVTA9>g*XW;Iz
zB)iZaIZE8cD)oTx!I1`r`ad+3z(*Mr(OIyfocSrijwG@kRsfHtR01WU60|_M<a%ln
zty;%n4zd7R*1_+`PPD%<?B9ms0y}nL>Di+X0G1d5@GWJ}-y2fwm^Zo$paj1K_gQM0
zSGMwdeRgb0t=vq<6{qx};B}PFU-WaDUBf4a@XfVmH^^(@0W+nTJwMTxTep2|zm&t5
z{Y0-lQ=wb?=NezPs(Qc%s9U>%YjjiU_(5<Ob?Pt%arz#(`okd?()|VTAKlL(8!ZBG
z{Jr3Xke(5<8NNC6?&*o6|2Fv_tXl0RPX0wXB}RUF=zxt@j2PmSzn;;Xn92Zo?UmXF
zi^f5jnFs2J#5;ny4TER1c3EqM<iU(xSpl8&gotsoZF284of$dQx33*K=+;g`xNcIv
zt;c>4V+z3p=GF4NXU^lJ(M;;-??F?=#Ky~&{4b*{+Z}ZS`6p~VvKaGofYOB}P9p=4
zlUcEyEjk-M>I9{;C|z5_hksBepb;6Om+2i(g7QO)AH{Yz28-uvHt$KbwbzfeAL+*e
z$eYh&;q41k{F}Mv4?p{dV5a$z=Cqj3FLifjpzI+aWq3!<rDLDlkV4PK8Jy+}s;x?L
z8%;y;(jHBRT{<pILbZnY&YFt`Bc66wvmxAhSAS_3PI~4*IS+^zNUshgEzM&PA5oLL
zw||$^CbZV1p(bOKrtCcOqmlv@QE&1c`wlPne43e<cNJFE+jhNr;I{zX7#BUv)hS*c
zPeM)7ZoV`r_Y?%PFuw?*5DWu=S*`{|bPzTd&QC$h88-KLb5P=IgiTnIzR^(=08RmO
zsnnJs`KK@a1NpN~nHf`C@>A9l+ePciVKlVD|4!p`$bx8occ$)>+O6?V4ZP9MJ#{Z!
zlH{9tS}u0C`pAG5|J(}}iV_d-V<T@i^yCF-iP4BTyr(?XQsMkmAl9$JI?fTi8yv9&
zTtc%*eE-SPVa>0yQjHrCM)sMj+|*7v1JMe@iX08lA~~}Z*{NBU^e_fbuzPgPoe4<L
z<S->RWPEh^Jl#r7E-<401&=p4CImmgZqxH?nf?zXsArAt`)YAdgS5vts|WWcf6`M3
zZg5bv+T~0_MMwen#qrP>q*ijE=k%<HoABHZa{5$|_Nd;WL;+s}{u144N*lAhFlJ}*
zP2#sEyoCEvE~5?ZUc&t+#`t(_0gZS5SUjfdfPd99u5$C0(b9Z^%DeiVNnv<oEMUND
z<T)twTM4!sT3qO(nQU?Is5Xea_*$myXJJIVFr63<q}!UW>>3$uc}^p;nXO+nSCpA`
zCCX#CR5dfw>i?S8=l78-K$6ASz7yJeZ6m-f*pPRXD&p1f>GX!yZ!%iCGlG)n2#M_O
zwUY^|053Vr$=k}*tzqRU0v$(ac9k&zLz5y<u~0KJUGAR<OW*ihBuLN7fTf4d)Jww+
zcZtsgGcT+P+qH2X=fnjX*F%k%^y|?xp7|3HXtAroPv^H5&=2sA*29c<Rm`48){~n@
z=+*;i-G!K&X_)zH!aLmxQ1Q^a%8i(t`G)TQS}SUV?w8nDyvIk#)3N*0VpaZc)8}OZ
zI!JJP0}E1h6dk<~ba*OF_+q2F9nhx{P})2$GtGWd$^44?&@a7@n*ir`&pxCKbV=Y3
zmpfs5dKq*(J*TEmX?s>0JI&Wy)bN;PRGxZY{mwF4jiSN<^l?_GCYA2;-%MRb`EHc$
z%Ze6WK^x9Kvklp;cQCBt+|MZ>U^TRIMI)JKtjz(AjF#w+Ox*{Bjl^Wzzsm~e|9dxR
zAw%E&5t{P45OJI3&j2>f13j&#6z-hTMVLZQ<49Dt4fQqJ5b`9uwB$&JPBhXkd}LKK
z<vy>M-*Q^e<fAA1k)IfzINzI8#h3M5Y%WR@+Kb@TF0^%eGP7}=G-V#>uH>&<VV>uy
z1x@haCl(G=*{x{#j}Jh(AnhEFvJd@)Kfk^Pk^4bA9-nBy%)DQpUOJogj-=YEpViHy
z&FGqFcpF(X_Wqt()olNs+hynbW@&pOZtDhS>aF^1xrHKHV<MjQ8q-x9$trrgW_B-!
zo@p<HvhY^DSvRv-^PLPVl&rgg#|&COhgKbXo8=Db2?TBw8SEt($6Wz#e-E)KHqB^A
zV_*3wVM{4doww}vP5z6#vXrKB!Xhy|Q~Y>7+Uc(9M{-+<b=7i+r@1?I+gsn)V||zz
zDrWk5plp`8ph~(U6yzk9&Rn=4^`G~)_L5Am1jwh3f7$gnSZlFkLtuw-y&Z|m%(gga
z&AQ{Gg$lfW{m9;=v1*6o5o829wz0c`u{_{(3T7tYD&F9=^6O->ZeO1Q1?&t_ib2vg
zW&4r><c!8g<I7a%w{m8bptq61vHo^Ba>4KbHXU~04Wumu2tH^AJl;oTYGW#Bp;v(5
z&jB4ub$%EpZT5gGd&6m>m`%`|v82W#v$$HSSi|~#Cv=b!dm_A}coXQIt?3#<>*>^f
z2_2}HN5Y~EGl~fNm9!r5WhKr4{W+{zrtayga?BqI3hrgSfQK_Y4L2bhR$B#z-dv#=
z|GmQx<Rt3RN9mIUO3|go`?xBBQ@s!IWgn~@<2jh%g8Z%1y$>mg2|b8m^ut~bzt4*d
z;-*y|sgynU&Fw49O5&(!kWyG<$wOU&UvC*Nv}iNpcDyIE=exu1{Mm2v9CqFhPvZXS
zcs8nc)}D@wxGjl-k8h(=QVXo^$FF4IoHpitJC*xy)NfhUDF(=B7k=!W^I;aNb!ROd
zJN{TZc&;ZbqlLG(voMDH?X$6jOg@?>TpR!jm9O`URm^C3C_AEVY`YlP!0~Dl#h=Vt
zFWtI+BmFX>`^!|4y<gM=`(<$+0H}5SV)8;B$ZlPH8QqAB4xPF%$Iz_jr$SlkrCX?Z
zRaST`VnSmk`yAY$6f`3b+)fk}MZ${On*$S0=(YWNt5c|Qpxpk{5uY8^S7qsF5xFq|
z!_a#2wodNm5<bkgdMXSzTY&Iirfq&j3hy;|mOR=6qrH9upOZ65*GBp-r>@q!<*0yT
zEL=1Xvj-`*MB2@vyg-OH;U7ah=xlrOqdnw>7#Qz*!p%`=9QaEqL1f>sdDJDmeuR>E
zQcVV)4&vEwKg@B&g0xsBqM6FN-~!)=`ihl1o&zJK`zM9l(`?^9oRKP1#z7k&=|gSx
zd);hC$~m`x?Ire?i=^!pX~U#{8X4~-MztRWH?yBR<ihN4cb7*1ZfTz--s1t+ZJ&PM
zUKY~8?s5Qiw$$(4I+vywFz(Tdl5dx`L2eT?l8=5*54Jx%7V#?9+UDr3VzMST%N-P~
zzTAFg4WQc^kiVg$re*1Wj?kN5U=sH%)pazqCLmnL?>$JpK&um7iXz48wbqGQUwxDL
zuko=#U*4TFsa0018JB_1^`im9`zE4|#cn~RW%va>Ji91Y@W18#WUBh{zfLL9buL#x
zpO39f8E&MyKGD_hPImy7S{A1Q_2tKfXx9RYXGrHZqpSU2H@t8?fU^1Do6xe-g@$La
zfaNyD<+IUv(Cw_{`OqCnLWJRO$X*jXk#vM?fxGM`wmyFApApHsOZ$9GEIg7ZfW>BN
zd);L|<8U$Nx_cJc`6GOk$=s=pY%RS%_-3<MR{uJyrD;o4@3$%c1F;a<k@B1cqzyhu
zs630uTd!mRS+t+iUpMkaWCN8M*q6R;g&GJqAX_<$9A!%E7j@M<1SEDF1wevQVJW~j
zpuzh~k7-agF7MZVcWq=1E;6M-N^lS~KLOLW7t*BY4I;0Yzrc+?vX+i2EXlG6x^WrJ
zWAbVY!nO9`H^Kc?zzt5|?-^EO#^=#ii_@~DpMlzrH}nE!MA{?sAA6mlYCEz4EWOT<
zwH=|CPXu?wOu6p$Y^gl%BV9VSiu%l=xS?&s<?JN@S3DHo1wpHqie`#@7kQ`M9#=O<
z;P#E@hsts<0Dr3)i{o6^j}D5yp0ze`T4qX9v@(eQgZ1zvD=z^=yl|i=__7n{X?;}f
z&XjjQOZCaYZ}y$Jb?(0ltt9PAtw%W1g`j`%`Xvtc8t-5C7c`C9vVwJEf=>jfMdL#}
zz89%q=CjIq#S}KG0U2Hn;5v|*rPi`3<aRvp0J>PukE~%sZP<FMeVGUPt79tbt2hsR
z9KehXBRxoj*3_<dh&&1O>jbmHf?|F&7Xf+GE`-tFmzobRbDnZ2`pQ%%LuV-_l&yzH
zEv?Z+9K3-W^sct*619Kkco{os9z*ZBF=hd;BOoObSqxjFZ~`aJMsLP!-A<G8CytDI
zaSU0Pco8DuRhWY_D^0En8p=L~+{Q){qCZEnRk@8mU?)9(79X_jmSkSfdxf5LY&9Eu
z-WR<QETJL&?%0YSo<iJh6YdXv^lG&lDVSyAi~poG9YL{5nMYbwfwIqGUOIqd(u%kQ
z-lP?=V0D(zOX8(IvwRy1qHm6^8oMG)DtffScA6R^i!!PGnC2pF%1|r=TI2s{BJL;R
z#FTx986$W|GV|QEPq|KiI1;SGk-(tL?lbrQtN8KY5QA#1krgeASi-&DjH4zY-NW}j
zu4X32rMHPeq9QYf5@$ciZvp>Ua^d(jD_VkH8eA3=Z-UhQ4-E<WVyTowSt8R*sL;!}
z4lMwer5K4=Zi#QCx7k=l;B`P*F6}QB<l}_9zCpf})~V1!hPpA0ZPykFXQ_93y5;2l
zP*#TeYSI+n)Tjn)x^@o>91}k%s`STOu-mL%1bnjbT0DFY-JtP5JR(|%5;Q@Dt~w0*
zzW?Dw?mYQt+3~vRF|TJr&4%f5{GiT=mf#9pHX+&O`v;tv|Mn;>sYnZSL=*^87??NS
z9QrgPC5x^oe8&DYTVT>M1{9$nK4(4pTwVF~IiOGYBY_vbe6Ks;RVk1{V&$&)`$_i<
z#X~dzA!hGCEqibdP{UJJM}8rZ>F*L90wC13d=m7hG2n=QnWV_~x6d;p-bci1%yKod
z2rvEOORS(|%6W%SczJx@QO2P*d=qz0I&}-5gf-KqUXXHP{X)tbAiN83l`^uVC}1+l
z0|-SUOPgA**8f)9CUjc$<3aus7wip$%3?piiR2C!cb^dm*BNi3+O^vH2f9W?Vr)z2
z88e45-%vUfA;GlA)U<i`q+%SYFu*#1-sOyqu4;9{9&Bxn39S!nX2nHeQ$JPgyHT}8
zli|fefpJ+{Dz5rF$=%Sglev1UeMDyP3YJuV&Chh~#Am8-PO5##H1?dbbgYH(CfT3-
zu?bFb`=(R>jFV*7t92#lWL{eplWiNVRnNPNR<Fr7n{5)QNyFY$aN}3FUZd`&RztSy
z{zZ^VweWW`nv<$(!Y;;s*3&$?a|kuT|D-$EO=~)T-&70vjthht%pc!@jOPt+1d{G&
z`=wganUr$PZ|Bd3+CGZD@Zcn_K6nGPs^ZL|9{W!e$NCY$J_Hgx-hKV%X4jYgAc8N1
zi<IMSK2?i#cgU6oZtIlvb$=5y$F=c)wmiH<sP%$~b{>pAhtVQGWk>NA?`@vu8N7iF
zxCJQw;t6X>X5Y<l1y%f{ngIK}D!T^4_}(ize)mbyS;7FETujN&K#f4yv!1K^F-HiW
zcbI~ue`RZPu7E$!*&{Ah!Mx|@aAs;&6UIHEDLa^tR4=U+KKbEgP!;S&I`dzteE+><
zK(=<npyUQb^r}35(N@kJWVH_a00WJ7Js%))%hPom!jlv~SX|u+!sfJsegr4AJapYg
zsky}mbX=K+(+Qip(k?EG*1edes^$*VUNyD58FDnFqF3>edQ|L;&2XMZ744j(70M#*
zM64)@EXS)+ke@qEH>RYi=+hy4Uy=OU>DL@K-V@-3^O~M}^Xr_6LT7J}rd=;*KRj`O
zRVi#0?bz!ja>?K0yf|W!43`U0^&BouB+-1PuCYSUu!^ns+d~EmAV)_BwN?YjsD*oP
z8%@u8kODctJ#X&vu3Wk^npF(qWT5-fH;#+F5)|*uv?4b$(@dey<{hOKb4QjG6c<2!
zY5It{7%#i4%&O=6!uaa0jH?mVUC3hTk~?2ipXkS5n!CmvL5622G5mn<Y6e<yw^;1+
z<;l%_J|Z`#;xen>0YtV!`0Imzwz|Cax+84$Sbg=nO_d;8v%^_->lAxj<$&y*l;VMo
zQ%S)i1EY&q4D<mt)1W`;$$>9Q?1rt2o3&-NoFhDc4v=BLVFJ^BoTQsn!Zz>*)T|o;
zVEaQ>lN*r@0F0$j-v<EP2WE6$jubuB82lMI;VSvHJvxXpn{(z%xymhjA=c2Dw2vZT
zOwt}SxklwjrL$gxM(j7A(!&aLUJXuxo3#;Q4LtI-le|uk(SBK)b*4y`YvJ@qmAk+j
z7A686EJ~hpcMikA&`|ADJ2EeIp3lm&1AQdSLCt^6=C18p<;%q3f+Wl%%8lv;&~gYH
z#Ij1S&)lJvn`WpDJ4vp3P7wne1+e_M;ym+qTY@=`t<~nx>rue72r4TB+8CjuiQ+~)
zBils&mYrCtw~k~(`xo*ANCZ_GbN#8ec6Zs&9OoEGF80zImz+yN!>xp>GoM#${Ujjg
z{LH4rql*!E%nG!)+zY5<uw(>*);D1~JJ;$*L=f-TT^|>rJ(_<T$V=+~u^Bu=JoV4$
zwxZQ7)9uHZ;2^>o&bj)pY!$bKcYN#jJ1Z+nZj`K5P<m@A_|qZi86f8&-R)^GIrpqn
z+kx0_zRp!G7EvZ$?_9}C$vDb!Oy2zs1na*C*D2AW(c*f}+<;fyz@?h+tyX!SA7)(&
z@OH%m>iuF#+|I>I-JXJ*{;1Doc9e04Wl5_p@l~BH7h%RPnpGx8%b!;h@~L)3QD8v<
zZMQKcLc9P8mOk(2T+*rEL$CL<0l|M}>cVu+Iy?zM=L_i>09Q%RV%H(ySkaP<qc!(f
znwkB3Ej75C;_Hh4NMBQkT!4|ZoGZASTT2~i;ei`iEf1u;ju2jQrEWxnT}6^5D~5W1
zYLmt(+!oY=D(>c3r*U=)f9IaZ$>Yp0TCg)vpr@P67J55!+aiGa`cP^~if~B_C6wnl
z1X9QP*&RUIN1cC!h~_r#0-E=w+IZQQS}g9^(3^G;d%n2mLROATbR_2<YGyk)*YZ(p
z?R0e3nfmzaco;e&B*TH3qGAza?&)WdQ9q!Mj!()$SxFp1D&s6g)jhvd3*rhwY`$=+
zi{*vvYE<$Wu1IA2EMO!wxe8#_`M$a8|9wa0VF6QDUvKNi9bjF+G5L<N<m7|@{{rCH
z*ITe)e!S0a(bzyF6n=nozEF)r8ry-b{S(T0r2O9U{OM5afzIByk<!U-F9XhVuF!Qs
zn%?yd*965xEhZbD>akDbEyad=y+^>vj=7&mUR{qBFEOwG^w=e;F16d)_81}zA3r<H
zC0ihux$~?0{a?!}^gtDN#p}5t(`B}^37wx{tz{s_zj_N?@o|V<jS;@~HeKDtfAwBY
zN#<dNFVO@=7#$ctV}#1T6va!a<;=nu=C<2Ci-9c7H8pHI|G<5?cTaou9g%{3?<*(m
zoQAIUHF_fD(@*nr6>fRb1rODo&Fxv3D#T`*XXyKo^=oKnL&N`SUYu%`kLFgE*{wOH
za=;WZ?N3@d!zzDrq41Q$_nJ3AOfH*l;}JS<+IIcU$scVGCBNMXwOBQ~yCHMR1_ya|
zgl^lCrruv1^wuMEcnzmsp#lDTi%7${zu>J6|7-oFZpJ&9ukBqP>E(CaJ80e>jQ%{+
zQ{wZzjws1q`W{S1b%*aW{VFC#<S0?_q-i@od8a;Ar;tb1JkZQQZ-GY^5@^OLOA2<^
zC2aAKa$)Eb*ozBO88O=I<PN<|hVbk`LemSOiFpoB;Xu^w@c-(zB^qHG*=Kp4E|xe7
zZex)j&KCF(Zjc69c|Le!Q?aF@vC%iXlpuA@_uW6f>*s6xnm?c)n*?Q}=^Q-G=Qz2r
zgZ7AZtTFrdVbME_BCTtiVr>^!dDl_mTo9e!y}b3<c*%3Og@}KiOU~60Lma9gQL^jC
zuNqFb1Kuudk-5%KF^{Wx7IR#-^}kxw_#mg&hLK-!>XgJ;L_mjW03R1%42%Ihjn5#+
zOhpcgAqZCEi_22UWI31OI0iK5Lcs##4s;{Tpyj}y;I3!|%{O@YulHVNM77r$@enri
zgHt*_f5GqbY{oMPfmN}>(1`oSGeupD&%K9DfkK4men`8Xxr?+2CkjDx_f#`n-~e=I
znox~PWoWr^yb=zL2*_UK$agv`@U5Ysrq?Z0USD9YtH5-V>x9_)On?qD>WdONLd$Q%
zh#GaMj$T*k8pW&aWw51<CgjWCH(#u%c!Rmbxh=mebk}_iSEfNTwH{h9?y##w)P(T_
z*{w({X}H<0ID`E1oSHB<|0G>U$Qy3MX6!yK?#!=qr;0IG!GlMqZGz}0663%R`H#Ph
zJ@;9Qk}7FWy>PKEgqOPSwR(zzE*#^V7<YJf-MOC98#*Zb#lAmg)=QHnW#VR52$v4W
zbro1P5)`ykI1lrJT!b?08VCYey|s~NnZi&mlV|i6VlY#<rA&;b?ha8}yE7)x_z9$S
zt)PDf9Zpum?FSi5XdQ1mx7^#MZMR+PX{uL|R`?b{o_+m2SED$s3^xN^du_bjy`rVY
zMk8v@W-JvqfM#c+1n{nI;uP^F5N}rBA+a+fTR35=<0{rHD_qcXAuR`Gw1xf)wAtgR
z4sJ+!_=}Zd4CZ*i`l_O#XUcdrt&M))Gi6&}H+bTAgU>yA_ha(B00+d{w&q*v&Hh<`
zP*4~mfwXfsa@w{=!Fgk){VqgwS4Th%>$s~U6YSmxvFLWQ*ws<U#VO4~*C=LF(hC>t
zP7LNlS^)IO;|!*~(7znFnKF3h->gN}j}(_8X##ASi)TKyT)pDdIsU`DaXpZ=Y?<66
zuB%kn9nOJN+(`s<D_96D@v?u;AqG03UJPk`aPDBB1=T*+rw&_$j6(gP-+NtMin<f)
zt#h+l?6aDSM(Wg-hDYw>1rfZ5Vmoes%89@X#a%0sW5`Q_(4r%7+s0T;6V)J5!%;t?
zCZO_?A?>Wz#Bu$wm~;9T<EQ6?>v+VhsEfp2Pg$6j)%<u6Ea9vF+o7QHs3T(WR(67C
zA_g)Z4*Idcm?BFB`UGEfHgWsjdqIc(<;!t2B|1fWd<44408VyIZxuHprV-P*)^si1
z>J^o~8xi1fJCxDk85yf3?uy60nZZMX7<t~T^+s$;AN2oVx0~FkKQsLt^joD+KFIp|
zgSdHruvWNM?;3#p&<`xjO9Rf{WXBYQ99Zixb4r)bGIwlb!Go_|Cwe3JbN;5KuzeO`
z1)hgIV_NX1h>(RJ4C_zHks14b)--F5HG7=E^`mvqh<bUYn;FMwMX#kXLt~MMBa7fJ
z^AQ)5ZDwJAM1v9PDq>1qc+aZywe$I<Dc5uq+js(Y#*j5-!#QgS+L+pSxNm^RT&<ZF
zSo_5l*Hyb8MBW*!eM>TT<%%PRV0wG_0Aot+t4zmSNE3IAEbupE$M^1X*;|!odr)j3
ztHg!f;5@pO_0XzH+#*)ygF%6e+fmMzol#;WcSt`X*!jk9Vb-=H5Ch#-=da>W`7enP
z%}955>K4c#7y9g90o2&tJnvr|4!rUZJBn(3vG&z4N;x%AaTm(G)MlZr!XeU+;u$h$
zvK0=G^M(YMpe))8xAcnnv4d}qm_a3Xb}X>b@GbBW4Rs2*Ex?q&Iu&{6Jd+Xef#)xu
z$MZ}D>*0^U&{lbsXI%$M5<J&EyH!mdZg?y9c(p}-T8g@Elea%3Jg1$1uk=Dr`%^c_
zF)3hJ3ENdx0@^<(;qw-}29)qAGNna^g1HoE{QOp@_6J!N0!ot+0C`)AvDMpsn+E|^
zCi{ps>MAX@kTPEKaAP(yxXJnW>+$kS5jnKUI1sD#scoedh`o*S^|BDt-I-`cJt)vQ
z$O^Jm7fZdq9x6<QdTLz%q#OExMwY}0X!`sxnGxlEq_j>D;97gUMtuCm_0C2P!TyJ-
zgxiJPPiC)%BLi7QFT6x_bm8S>bHCsD!WXdEC{uqEwZ0Q&uAuZVED6Hp9*^<4@$kd8
z`whC(PB6c}xr~HY4o*hz<;07eNbd#uuK|cguP|a-dh~tYwBce6@Q|D@#&*K6-5Vt*
z2hrz3Bw_=L2OsH?shufebzlZ_G4*1af-`eTwlU24>GwJP#Xl~oj9bq>%K<n10{6~X
z^me+B76_h=$^Qu%-yr4sMXdkhpa)U-j9L^0?W>OUl1Aq+{5#%SyNFjANjJ7l8BhR1
zLe%+thsb?nj79rGy;XX`q;@t8^&wJwt59;_17u@`;BGgmm>3z`XRL!4Hd}O1dsUVt
zJ+=RqZWA}f@sw_>ONg)9phbkzZ9s&IwqS$kd;_ZP#xvY%3l`g6IJg|RMbuTTE!>)$
ziZsq{4oX39bi_jjNEEQ6yVmz!<=5YAaRRrU(sn_g1=UvhY;k@~@ANhVvw5<mfIiQ4
zQ$t26!s~>v?vi>&@ihtm=2RMWykUUco6cjc+)}9L0FE}#%uohwZR4x!adcybMZnJO
z9klIq^oh~PR4{Yw#<5$Q2CpUvL)>Ovc@(<0pTPs}uv^UDuUG#LF}b;V2LrC+vVo`1
zzWp}2{wUsxC=q0}{|$T_apxr1eJmz0PHVlO531JPlT+p+Q~7oJE=}qSGmdXt?Lv0c
z+WVH1)D$cx>w05O&@X>hHfI-z5GT0Z^lv~IKdMf-dwhF<YRG=zh)*OxS6yKvW6$tB
zz9-IynlS*^)Z-0J@T?eq_~M;hp-K2aqplUI)xqyI>A|x!uGgjokfO5TVznkhU|exl
zNk7)q9GW3*DUIM<qGLD3%GEk8uw(=&y?8cAjn0!ph(6AEzysgOOvXfZ6XsN=JFY@^
zS@8|dV4rwd#(k5S*T!v+_mf~If6=>|>94X+meI01M77QUFa_NWm6+|steOi>8vb;6
zYaz%VEKg5Bz!U~D58D;Cq3Wc6G8go)W?tC!$lwnrG#`bhec3xX%zT>|vxHRp^n!tL
z1+ymaDiLw;#zElxb@Kwpf$y(tHzy4TQ6hzL_Wh(M)N3L7yZsL)n+efl@8gW~3mD)|
z@;S&K`oFI=@mmk^?SUJNd+~y57d8Zu9r&$pGD}D{P%6oK(l&v8C+SlGp|dvD0oY>y
z1FU66(HWt~L?QnXn?9#3bL}wEIsOc!9=KS2v#7G4ty?VFH*`9eD;>0b^V$ql?J%*2
zjoCOy)@Ked4U4=w9XWI6!^xe)#OGP2X9RDZ42PPO3n1`3g0_lW75UDxW${K-=*9{M
zAbA<-h^?GC6CiCr=_%_hazMoGcBr&pHggYL_%zR_^P8fd1=<W;xNgXhn*P#@=>}X8
z>Za)LkIf2S37k<;+(mC|n?db29;F8B)1(w};tF1;f?l!OBp0FN|03E3h4Ub22fg@d
zedbg*bTx#+P-l8oGo@RYKI*1txacSCH(kE~`hWT8z43C@7m?kkT5j!Tp5!3xRk67=
zA|r4QyE7G-$r9U-N{cW(0x7CGHU88{!e>1}nz+B8`gzx3r15@MZcWWy2Z7i&@v|pZ
z-Zc5wRZn}(M8uFY5Ybxef?l1@Pu#qE3j0SVC+Q215Asuz8BK(<;HmLbxjW$Q%vUV2
z0dUc2)4&dYCdhsyG)7%Wk1m`$)0G|)8xw%4zNYZC?~=b;#~f7O=9cSm*-t4gn^VW=
zRaqRpY?T`X)bM@|ff0n8SlWL{<wjoD%Nz=vblWtJw{%|u$;G}St&=Pntn(j8uef#-
zBfOVEP`m#yhE=vRo@gy<&S$#y#<GAAQr5H{Hyn>|{(yV_9yR%WG7hi*Xz5I>%75nh
zJAEH&-Z<PQNwp9vUn<NjzXtl;Kv90IPsB47t|W;UEzZmzi`Gdzz`KRPoG0HnUB3SD
zJtElt${{f##Oh1HZz#czmhZTRTic7aCCH8cklv1`V8Btp?K7gojh4PEzTC2@ULDa_
zGU4zUjk346G`#j`%EdngghPCp;?n$}Sfi9PL$+OY$srmNl<aUrqF${3LgO>VnG|-a
zxlmBeC7i&qA4NeV&8fIwe?Z^hi>gA8)v>j($k(wwkG-)*C1}Fes&*gyMwRbX;dNf6
zeB#EQj{xxP<M)CcU#n1qQEE2<%ik2K9W0u&1OY^iD8R)KqOb@Fnm_$wcadAcF&ZL@
z*r`d4?|4jN)ZWa7uDpM|#h*cxa33uHJXe~r7Mk^Z8*IG=SvUW~be879?VksiWaLsH
zZAYy^?jK<-LAL@xB(WIa4ThMVc>{04(ohT;Jj!3%%p#stt_9j=Aiv?FH@mK`cL65D
z^q5@7{}XDoI>WKg6tz!q%5s|bFr4C2diP`Wz9e$|12SGie3RF;$x?TFvRnf6or5ZE
z++M9U17+#vd@))T!QipY;L=&ReMIYQzp>ihMVoWTESr}OE)FhIIbLy45b`-!J}?Dm
zIl0zD;QWhLw1v{2N1=xQqI2aU#_KEkKT3E4&+y?(<7z8spy62!Z&hBc5<N)%ti89n
z%Et63c3F)bWO99Uy+L-ahF}MlG`Su^R-j58TN<pi;sbD7O~A%ufUFe>Q`mF3CK%@H
zLN0K8L<bgyPt7WS<cjkQqZ424mo<eNZCLmmkE53zrlx=y!^7>@SENu|f!3q%&GqI}
zC`#j7A|Y!6Vq;phY|nQJti7y93G)ALp@%w>kDChA-#n96fsC(~|3hLeGYL0TSdmJG
zg^kMY?Jq8f?It>S={@y?EMy!vsMRxBI9Hgb&iBVpQ|?nvLW(k7>k>G9%{;SiTn{++
zU|+c{I_bitKk^1oW>6_)|E_byjCz!FtmH6R9BItFl>e%ve~jVx%e(HocecyKrt5z=
zztEjqykCWrY%(pnrR3QAxSuw`y?jm`qCek$r~!DvG*~aBBzBs^RqmtRBO`>i3A!_H
z3M+ZI%0$E{PjHpN<Z*GXvZmAio8#!Lp(4#VW1UE(yK8P6R820R!zE*=NIP!Z`bzyN
zd{R|-+{EQiIFcA#D;=BS9lr}rt_okV_Kt50$zJ<vx@N_7c;}G=sAP?A);zaLVLQXU
zueuObYQ6S>{8FOkWz5KPo)E(hW{xwYUV8Kp)uFwO)4fo#gS(^s(lr>Nrd&7jNMuX6
zavr%SlBs!1G{CjKZBasT<H1<X)GekDNI;%;$Cb&DGDb4ecsv9D;*{Ngd2brm-IGX{
zD#A=A!yaWhEHL}yp5rT)KwC1-B6ZrbKu~fDse#}$yt!=o+|^x^t`jV;-Cgm-m`fKR
zjjenp4Ku0D74;Povv9$s)=E<=8eM`5=b%AE+v}(~-&abhhM4QIL{!T0FOLA<z0<Ly
z<&ZDF&4q=4TbPXF`rX93gHtV!)G^%0$}`Z23%G~;<{oyjb&$a({#;VpcE(miK<QwJ
zkhTx=7J90E4^9m{?%_39wemy$Qhla2@3emSb~lk-rPfktg++)+ISu)e?)~R8hmF!P
zwJ>itmJp^4ZYgXeln6QSp`1pq;mD>Rqrt_ngl~C)I74N549>8h8OefRn(`k9n_8Az
z9_>)Omv2rz-?RNZFX$_ec6knX7qmD(-;zbnI+>pV(`m~uh8cT{On%+@w|0_&dBoqN
zOge}rC*%AR^AlQEqN~%tV+$J$i=!unJgBGCcfYN~83$JXU`E{jgDj)7Wb@6~!Fi1n
zl|=*r7?2Y@wcE*p563Vg-0D8r$ekx2sP?FdX+sTwl1-Ry&5V?1aM$|j4PB=uTY>=!
z&0aw=x~c0JDiJXwMO|5b=5*ZB{AmYTw8r6#J^mz(_1M#o=iEGX2c^?#ie<SAGTR|<
zO)HFaO=drNWM7l*klng^{8n3ffJOI5A2g<BB<sS8Q`Fwq-pc_UvY?xI<t}f{g;9-m
z3D~YqBuu;0`!4Cdhwm8l9oi>>cmH1|=M(zw(c4;s_iFl<sN&2?_-kD^wJ5cCt5XyF
z$98ArZ><xW)K_-ET<H%R)Guf+q!hdrpv0E8aJn^VFTgj3r?T5>J+CYQlf`sG^yneh
z-8w`;?a?pK!qeI&auJO>G5x8a1<}8570gY&PY(SZ=yejq!{O#!amPvU{pv3VI#zpp
z4k@?EfAyv0_49)_xUIWMiJ`Z$S1P>r8ijCDTZvLXuD~~6N?Pdh!8<;U*BGg4dfH2D
z%0Y`fH)HmQMP<BHN7q-r3n+zd(z1;~+?mg)7jt-@p2O$iAqfKhsn8{qOlmr;WdCPb
z{lNREw*7nqB)Kyv1FAZuvxa7ij!b8N0@-K>rOjC(axGQX(KTk=c$WWA{G=Shk}+4B
z{QRWD@7^aE!=>C}n&}RDPUm;8PHTd3cYC1wD~6EXKB!qg7p5>$tV%9967NoqG-U}7
z=parvYQtTo#N*`;K;6kZ2)2_!-nce(=NphZzmvji2`k-%ustH00hzn@gHH51RD9)M
zVs9^%CBCO%eqlihRmKh9ZmLOE3Q&>+zz3|)&)I9heO#F3?bj`>v<-RMQ$GWy0oY&p
zhKSOpBgIO<jBwmTn4+zb@IB+OjT4LY;v1T-+gkhBX8H@0LomWHsF|#{)#qQqj`W;>
zbfF@W0ULN45Iuc!lVb&1S6VSWqBCo&+}rr2Lf%;Syi6(#TTT9C@)3XR-DC6*XovYB
zEk^rd<KMTo^tu3WdL!%D7Zy8PVWiR?7O68^Qt4#&47wTEG;CeF%{t;6&=jFkeg_gW
zh4^P7!gg)4a38&GMD}`PyumZQdkrDau-a@2RVs`1ypQZC+~<>0d>gem1Vo}Hio3<$
zXw^o*WR{^RJ%h8Sx+XdE!J1UBQ-{jdKf!0&8vyi?pyby}dIIzH4^pr<GwBJAe=^nG
zrni$$EGj4H>hy%?baeidPUPX;IDdWLK|+bjg>61Wo<C|GD&1-Q;{*$ddpQiuD&O1W
zAgf_^Gp8~SiR`GIf5ao^eZgadIbZPi+(hu~pRtq~ro~FBqMFp(eP-IOLgA*>*uo}@
z07yjedhDF<R1QJ2_md{RQx<tC;5`+(;(23B8bM|ShJn}k^af<le~xcTpy=b<j&JN<
z!`r^C+Yt|Rzx74y0_ObG(Uk>Y;6{|~Ey|q$hpWo_g}wS4ky$}qTDkzlw*HUyu`bf>
z<)A6liv#VM<HT+EXQ&qxhoM?k<adc1G-bCJ>U8BCLe{xyy0>8I`kdqG6OQbuX&`56
z$bkuM_xL6`l;fDMri?s4=jhG7w06GKewJVt(spjLYr`=1Dn=)<4{EOL^v7D6*VcQf
zG=9{RA!EDIU@vaCm*%ik{j{CMA~$eY87Ag?Y2VD1*4v0lC=O{G{j5ah3*5+1#7>t@
zcM9%WwTz1N7X1jms{EVmUsSl{CRFzMO)DG%Q;V%>KiocFO38K*U42jABZli~XbFmO
zFzJh6*DpU5>Q7qzF3&jXy1ZOEBk=LOTG{-%MRUVHn`3*ChJH@~I;F88@99KsXOr+i
z7ekHGAEEaq)VJN9NE;sM8wdCIUO4tyUc8ujN8Jg^3eoESb44>^z~r^QqAZR0YMuL<
z9yX3RIWzej*^!Clt!@8qCS;KPpp}4+=Adm5A<$(Y8{`X*xX%V^@;!%xfX!)7{%*YD
zzIE}OT`bK$WW&mZ%WO-jo9z%Z?Tsb#gU-+0Eu}`E(_3(k^Uz`xQuN~u%uNy9`%~?~
z{mUXux#@#+MUfYi%MP4+FUzc7ofVVAJQvcn4nx&zpu`*X6lqrYwOh1B%r+D}oQWZ}
z-vbYO!qMhfLKVi1^6eL$$Yt`UrE2h#q1m*qwmjc7J}4`-2>{yKz)&iJF}dFC_jf@7
zmY21C=<Wd75XZ%!O}<^20ZG@6(h-I-IsoOuvX@UXGNJJ;lHB2_3LY6QCN<%BB{=on
za7QNB*Hpuc?Pr+>5~MK$xe*olu;kN4?aTG^IYDm~Dd&TWqcur)2;QcGGTvvfW^J69
zMg;<d!|V-;-?Q}3URv3m50Nv_=R=_I9gSdMGMz{Uf4HI{J{&xAWsHIj8#EnDXo5)$
z$xzU9nRI!#?bCwicM;=Ms7bLshu+HF!qExTy>|ZuicR4t1$_;3VXMn({6wf_7}To~
zO2)Y9MDYzWvdUkq#qxzZ73NcQY#MB*t;_Qk>iQgfAhS5%3@v)ek)3!xBfV2|zqc%Y
z5Yg?tHabPM)g`r`o-%gh+az?+z5ARmrYm+PU?PjmGhqo&P!~4K!YoEdqy`mR3M*o@
z%(fHuwL&FsY~GS3-bPi<LjP2=WV+;@SUs59oNk6xlxSieCT9gT6Gom#nim}1Gk^Mr
zsrFJ>LG~{`5z?yqJ8jQ_qom>=F!OlB_n$;Kg&dqQJA-W7+?SV{dQPNBLAo7~%WNGc
z;6`nyaFm+j$LxvYCm#i|w8Vnq_<0C8osvw=o8qhbwDvQHhiy6w=`IY7ym@!R*k1mK
znSbu|;2=rQrt;Gi>4|V>O(x-XHRs{frv-f`UHNC^Y73A>8#0J0ZY=r47c@a@YN>?K
ztWI+MEBpY*(lnyTR6jBEM2KRbc0?QiA__C7luHfiiQ}WUCmY4OQ)t6^Q^_VuB&7WR
z<LRu!ntb1|FCd^&Uqw15f}ql=BUKbs1jL|W(#RwyF;b)@MkqNz1O+8VIC5-&bc|+_
zBL<^4y5W6%fA8`B^<2l;aXf77zS(_U=lMCe)u$O3zfZZ!WG$YEWTyfi?=Sj$W(i4y
zf3l;pjn}Ilh%L_OA3vl#6l;h5bqD_h`4zI?FXDi#_~TdNrf<fP;*Pi&y>#w^F3PeN
zEfF~DE_11T-CKzZhJ0ZgRhN@zqxTAY?;+(bws`w5`~YXTx!{81T*Vwiy3$=m$<|Um
zwISfbkFJh4JR|(uyG=O!=(s%F)UTM3_EuSrpYG57b2k7}PTw0c4ATF^HJ<~VDh3VL
z=v6(g=r<&P-x6%8kn`f?+A^KLQ1bW?Vi~7lWG>dE87C@r2;OH%oRe&d+7UETJm6U<
z^!;tUW3+R3k8#Ji8%kMrUq>yM^=VpWWZm@NY#y}Z_W$9uc`$PtnLqW$E0G}^lS&ZH
z@(me%@=4#t@lVQjJXf8|>h&8Ziwa)1qT$YNySfT5*-Ls|Sfv8?_SGA9M#mnRvP!+D
z{T>#n{$at;%26o!7+T{Bb>SFzps+qZeAZk1z%)`tJ=KiEw|%GW<zj|KUL3=)jL)ST
zYPMbp%Dk@zeq}68e+&X0tMvWKSiSzGf38qHd+t*x-TI8_zgKmq`aM1vnu%l@_A|%d
z35I|L=kBwCr?0iV$G$!U>-z1pXK|bX%>?sJR9Hx;<(OnszoC+o%AsPLJm^B{7&v^F
zd3*;xInUk7Q_-in0FQ;>OXwr4{|mKvJ15(B1X&GOFwGs+nWVoUBg_1@i#yFv5^}1|
z)lo08cr3DkW;}}8e9Uz#HbAe2@aPaZobpDTaw3;MQcg1BIdS65+HX<Mk2@;N53|>~
z3-Lj<95_+*aon<JiFhs|G`JBq4LTa*^kt_CsZbFC&U0%bS8;AcE|0|=$PN99(!ErY
z=7MU3YEOalBOSQ|%jmS%Un`Tgkk2<Co%*>6tv6q{Vi4|TN;*WVls!&ud}GP|qd8K|
z)}xefK~zg3@wsLLK@@FYs$)MXl|~haLbXVxdDht;>$9)>5yd2~>~MT?W-`uupJ6@m
z)!C|=3C*1|&OCLKR2VILeyZR-XluBIn@8v1V;mWsJN};v1Ewcx@Ukx$;n&^!_I~Se
z9y#*hE$4`=#**Eq1mnC<yaU!n?3_Qph1YU(;8-^!{UtHCRJ=uiabBe5Mfo>TM-Yj(
zn}+N)#@<p1#Wa|)UP!F=v2?Ccl}~$wzwPfWN6(aCHHHIpM0Z7$p*IH`*PKc+T+&1y
zApf#-xs9MrwI)6r8cikO531++6wRiPa<c;sY1TwZS1B+k$rB8R32Bf(BO3v<V$x|B
zS_OMBN*%V48|=YZZl};RLP=uOJ^hJk5`!i8B9uL=NjQ6A`c~*RTHoJ8#ydh^FrDy8
zpLO9hPG4{l`g7x{8`x*uK6dk^<MGjpIXSnQYQ8h<P_-A<7cvcw;0+oZgwM29MZ6Ra
z2uigR+>N4f=<3VT>Oi#!J2s5gR?``;(Be|O`_BPBf%3+Awk7BWO^W_jf_DP!j+JFy
z`>@(}b6V4UOjhI%@ocW@i3!*D^OrZn=B29YN>l~R<KSx(7Did!d4r=y8=6uFZ!_x5
zu^sx+i&z7B(B>dAh<*vWr8&wo4}9qYf*G&2Ujz05(PGsKG-#dv8%x-gckjCDRHT4s
zXQCN<d1jd#i$e9e1;5e-thLrLWw-Bs@CMC7=~iXOzj%AEukQ;vkbC?Y{hG(6k*-34
z?H5sQ(`#J*OhEkBe1y4ANGQ?9ZG@GqB7`+OG=1AiI+>Y<3=p2a<fM)d5R{E2{hir<
zKMwK!Ht-pIbUDB|v89siePK^=H+~y!78v11B+wyZbB;}a*V3R$$==*J@kUsmcRYNz
zMx!XJfK@%ANfr!E>k#LLcv2TXXE&w)E9rHZ97OdO_zw#|0Fr|w?|j^g8n$jQMvT(w
z<tfwuSwqxY+^$YA9TsExI?(whj&9WeTdGHlM$Nkn&ok+8w!dFDoP`<{S3I!bz@ID*
zbq1+DlRR!~tyx>N0%oNK_Dba4LPrgyTuy)IKfS*kHROWAUKUO{Ca@|Hwt_j|HW8+Z
z2nfy&6O=0v2Ug+wC(gN4a(<s3z)KW=UPgu&$XQ(bM02CHm*Q`Nl9nEr^35@8^i40#
z62-8Jlh}hTRjkx>eFPX*IxeZz_7Av*?a_=RZCG0N0Sss2uaiiFOM)TyPywF|n!T)>
zAsMot{szecfU1{b5q9q7%=p8AnP=NbhrjEpVOtlo{n4eC0W-JS+fC$M_*BCdp(mDd
zTE9O$JyG{vHgxW%Eg*JDv@Aw*x>19WJh?{Js+<h8o=G`VO57I`PECE8hQ>SZ-MvkY
zKA!qlEJ{m|o+YT-!WSW)9yK3ZdBHfPBcn`nyw{--onX0g4N`3z#p$%}o(5U*MvXtO
zF8u;ebKfAmVEn+OlI!X-Nn3B222%?OxVn6fUdt;Fm#iYE{wD`a9=q*8JLyDHmm{aE
zltb<6@9u&BRbneY8?qzIHU}0Fg3GmyI!tf(P8WOGT`<2N1ii<&-UlLG)+(*8F?^J~
zctyDQ$W;QQWq;xBJtY?Iy>FC<9^Qcqk2Maga7g0Yp6UX#ejQHZcOKLqH4y~_23HAy
z!Y;2n(|dIXO-)#HctBCtPT#qnojY~1TeLZ8usE5E9r^o%{C=qJPML1K*BiWE9|P|=
zJy~oB$|b+JyWXymdjCG8&UesGNy`4YyJ!J{wR^OO`Fi*z*YM|nWKl{Pr+y-soy$Ww
zi1rql`&QEDqiqi?=QsH!rS-zmXRnXrLG>>tw5w~43{bI$rhAu5*1xY;jcMc6%qMjw
zDPwKdD~AcZ2(}t++@lPiSCD8iiYkf8NL2~it3tkCST~zsZrZ37vtv5ic<9-#^=|fZ
zz*@~nv~Qa=BiBk8*2`8{%Bytc^@IShO52HTU=Q!BC)hGeK63kHu$Zf54?w#sy$nCX
z2F<9o8Ocj+?%jbCGww84M=P$}AjJN)d?%}@5rkODD3`AWP8C+u&%7ogM}x`&-&xYA
zbxORc4*pi~Ep8y9daneCl-~fjS=bS1L|QpmCI2POOVKSf%u6r7`}3`(j0Qsb;4OK(
z+9@~X2PixB+KCi#0;JLZ_cXL$uXBfMt3TN5`jHT-V(VSDOz*{`BGPD3EpblXEHi0e
z?Gl!gfzp;+X6d7_yza>wh+t#3Ok{FhF|5rHyU4%7vHzjVS29b)ttjP4G)gS04?4+M
zJ#nW@>`8OkrTP)SDo*(8W+M;jHZ|ayva%?GY9a^<+W+r9*F>kGOU_*tnM3SPK<t3n
zVlC7pFYEDPDgf&_CVujz&0ffBGa81mGBXj!M1XEyQ|a@JyX2UA;sAbgJsB3xlbnFj
z{DxRk)9Ahybu!*qPt~+%c(O`t^}buf<?d?eJ*}d8%opO|TF?0-$d_w;^E57WDMi_#
z8iS+z0r<`L=7C8oA28e6ztQFCv;mxdKe%XrZB?!W{WmL;ENLJDDmx~IEOiICQE#Ur
zT;|aE48!KdcN7Z7j>k5=hqQTLO`cM~AhFc#9-{1BP$M+LGyNwhC7>h;i;6KzFj|8-
zXD)~kb0aXTFkK=^@5ERbF12u#AvMlZrN6I^*8F!Pbl&tTOFfhM_ERT=6`|Z5Z;n*_
zd;F6rE?7IRqEtgQwvBfUCa~(f9luB7PYfs#5dW(=jn>(%@hakjGVjJ01+hu_ijgD1
zdy6%THZT52$dXyB0HVF{iV%~!+=RU|8Odrr3@fVXu32zNY`IRXGwPbmqgECq6eakv
zPH~1+J?bwko_;oHoUaw%Ubt|=z<XZ~H?kkUn{)XUjk?H+5ER6FpI-e{uqd)s9Jl%1
z+ZVx`4>@=dL^6_E5h^^}6+g3_JM()Cm<}!?v8b`2n+1>PabAbm+XC{zsD*v(O_hp&
zoZZN*i~RZp07xZpp!dRa?|E873Gh4g>*91jXJkVo9L+=7b8>G`vEE58qq3rtg7nsX
z+UB=Y#l7U_1in|vm9nF8vA9ox1!AfO5xCn_(``-turQpH+k1M;3|q5j$FJ|!7K67u
z2h7&glubpxV0ZiGimK#%&!dU~!_9D^U_T+QKtie9{%@6Z2<$d>thGLOcWuCx*jf*~
zpTS~Jma1H-&fm8zs8@Y-qJ1l@u~+pZ-;1#mxw2^aMLN=={C4<!Z*S|<kGnpu_oodx
zaO!p<XHM(`fApl|I1!w%c5xW4H<cEpyQ$*g#?U~l;yDnYMP+)BXM}KFnOuisA-E2t
ziYqmqV?)yW^b0O()>Q3DmPq?vmdFE$nMtCU{uMEu7hwcJ)hAl;CLZpvPPQ6MvoWk(
zp*cJy)q3kP9JqTJO8xp7(!!twpeEG4P+9h>IcrIMXv1a+@;I35;w_MWBA`MsR^Bs7
zVsk6e^cK+S<r;#z2HNfl+*Ao9#anh^>Fj2-y$)HI(Knei$`9j~->9ATj$x=}322^9
z&A><)_2r2DbJQcN%)!t{c-g}>$Igo)`XVD?y~q43d$Z=ep6YHThCHJ)7)@Qk(ggdp
zdDVyQjSuMK>DXmosbMg(-}6u*lJc7Drd73E6Qj)d3wAfR%i`K=&$tA4&b}IbsfX4U
z+50YhW9EI3=m~MT%W)4=jazH-Eu*_}*%!30Ka-f7fCfpPtaoAJX5Q?$!Ub|&NuHsb
z@m~nChx%}VoD(#XhEd*L2;u9F6+Xz~XIc9$F?%s2_b1`oz{_OHE|Zlt&zV3b)?-R7
z>$~LLwnpVsDj^ew7dZW9=|@IxCE--@OKY&Rxgq=AJq;~_`B>En!r3561Hf*I0P4Tp
zAIqE>05M<9vFXxW=*c<Fw8g853Uj7wH_i+wVS1;+izqdPx{S2d0k3riSNa~!g#fcL
zyi_is#`O;Kzrq_u?=03%cnVW4?C(c@^j|A#{gD=;7ds0zu^H@cY~lT4q`v6XOUZ<b
zxj7xH?s*oMPKrycMhC=sBwSMiQ{FN#GT=4sW4WBNjXj<C-HA4ehHgPa=L<KQ>*1E^
zOkEh_k(6&%&eVKNKtH4o_TxqP)O@vci2V73G3NR%1G9$iRvG(J&C@YG#I2%%LMZj^
z^FYba*S?-AYCqg}zpDe3OR265W5w!cududohoZGY7FRUS8cM<y00Y}G=$2#Zd7<q?
zI=-M6X;OL=vt`)dByE;7Un?KbxgD^g?J|8mo0YB0y{-5=2Mazyuh^!KDJ_KL!w2wA
zQpQosNlJzI<B$I_SV3+-*E%_Ct7H`Gf6-Q5r6!vLWG#jk*_7eP&v?iSeO$NI8v2=}
zn54l@)mJc4Dg43WN@0a9{*tg~KG)y<W&1i`&9O$1;8ZT(%>LkFSJs!%$Z{({VNVG1
z-quYMyP{lvXA#Y0&N^w)sAxSJvl2sPlfn>`acg<4o#fO9MK`C0q6F?QmH53x7*|uu
zgl|qdxGuX;R9v+rw!wPYP!e~M_B>`e0Q5I|aA|8Rkmv_R%6FTP>zrT|Ow^rq&A5Uw
zezjM19=mO{DFl8F^O3CjdoI<X6=ZeWg~zT0Y0GP3g}&rU8<c8IgLAf-Am8-~_$E`;
z<Y(i0DoN!;Z;Ua^znL~jUx0yP*x}lsTOia;_)$?=LrhW3L#iF}w`IY%pK%sB=Y$s!
z49(|^0-HR$tMM0ls{@f1!7RWq!S9wxo(}L?Okz;tEnHZqVH${J;8#g8o`w$g*IiMC
zJ@4|IQTd2+Zbx}-nuihN6Cps7CpO3`+{nPy?t$J1lx{cm_Hyz5>CVymdL<P-Z6y;e
zS-+k2@(vk}@EwLyz$cR_N|ra6FR)xtzsz8G!MKm`z}vb{Lv+D_|2ygY35;8Mf2xsg
z`{oVH?jw^f0qQxmPa9V@nF8CX<vy9Ee{E9N?Pj#FoF|2;^))^wuP*qVhh$h~q&zAM
zLNj^dXCs*PuWVlfQ`+;X`q6;`s5?!uKJyM3h9-@Tk07}kQ4iQw7H7mJh!&DTTCi8!
z04zdWcz!Axyb={W&2IJPR+)yzPJ6N7DME0RWed78L+~Xn-YAORf_kfYY}e)tx`%+|
z2=fQdh|XH;LB(P}Ob*mT7*e<DKBySw*If*1kd>Y`)cC-+jovOi8DKky8xwONB%hbP
z&{Xp9J{Pci?&fATtBbAC^A|kh=$L~SW7_DRqYNAAsueej8xrJJg?|$;pQ{THOWKx$
zwN1VwQcdauIL<MsC6&qe1zFMg!f7TW{s(&%E{RF-u1lXLURKZB!)N-T{LI9<du`I4
z>9q8g3>7$|x<h<^i0O9<<`#5DAPN1H2%l!s`T4pVz%Y}8r6opw4VW3QrI|L`L4JR{
z<0<*)lDBE&+oy3mUpbJ?84?f7Qwee<U)9ffe4eGnDHX7N;7>Xg(5w!!SQHXFQE4Y9
zdBo)I4boy4RVeu^a9iUU{L#-_XGf4AYGArg+Edg$HCyY2C3o<ALG#WB9UJp8@OIs1
z)uwc{!ktYh`{B9No}GKWMok)wTc&OAN*H~y-_$=)>t#@D!QLOfsh{%`&oN92D9$d+
z?EB5%nQ?O;&0fi#p8Ut7$?Fu@H~%SrcW+#KN(TU_e!WHKhs#x%=^Mm6zq;CbAizX1
z^)cPOazNC3iSNqZQts`m+EiYL2V6f+;yUu{RoN+6s`kJwvbR@p?5cm&OKlqV2$I|b
zD!1(4;%e+<Xg?XKV3d#n@^-pRYfIOfb*QCEe*;z~y(!4k?9IeLgXvPoon?#wiRQsx
ztP{O&F(3R~w^^f2?rl$W1<=@k-F9@@6J6^@$srh$r6|HnhL<mCEgEk7|6sdv9De<3
zj7im{eU?W<0s$8S+fz4?)(T-de4fDx71yt{_H)W-)p1K6p)4^SS!Yh-Lr@eP`}1ts
z;LFx#*x9nm$7S8I&bwK%>zf|J>)iPmWO$jh5BSZH4|o~9k6^1XBNO^g-k642uCy8p
zA2j}Bas1C~dn@tAoqxOIqdB4YuNIY6Nbbf9%-}rj{<!2r{xZ9E)!)B6`wp9X-vTLu
zr{a|xf%VuqvTZv`;D|9WuFBG_fl29B%&61`4RR-)Yvf+a{<--I201FUu9>kw9{Tm0
zK=Da{1tNd{SIJRLiRMg1Eftz^&@S_z<)w%bh2ILeWL0oYoKz3W^Y{LGhyMGGfE#I&
z!Wx(N(H2x#Vt4W;`x%j?y8*TK!eSrseaB<@TW=1IGB8$HQkU~6`{h0&_U!LIqE(~N
zIMBHp&|PmdBg@B^WnsL2aSMcHy;bFC>{V7tn`}T$jph=(RC9H;!m$A$B|J)}(kLLT
zxohJ3j!pN^rEAM7*$w{bYpR;nX!!eCH@`P6j&qB7Bk<+%FiqV!HINRc)B+JGt*fyq
zrRZ4%VCy_@l3ut`T<r3E-nv_%Jfl(;94Dn#(NY@&S+0jbht-4s0?=U<WgjpBdfDsR
zdpv8;#Py{=L|%OuxuMf;$@c)|Y=2MMTES1ZgJ;aAeY-NkCXeB{TX?soU|a(4z3s}7
zs)9bK-wV1(occU>QUI8;VOGOHRgwHjLnTyFO#Rb7f{IBcVG$Ft#7lv{{R!$Hfy{x)
z>Lot%48xt1VfW)+c=hxT#uLA^h-Z*>E69f}@x`u=EvU53s+nxbo<ww=ES{b5Sh@A9
z!;S5+fewxB3^BI_02OzP-jA>pkHK-gIP2?sKlLX~8)Q0<VZ-kt$tLg6*qIV$XWzBM
z1`BZF9za9jn)s6IfVbe0V>|d5_BX&rsTX+gcxAD~)i_df5k0vR99A$5DV`Prb?cS2
zno>KU^bUT5(4JQ7bqwr!pK%zjaylsmM#~a(A_Cn2RV?Z&D1r~r9|f~lQFh_=WbUHC
z7hVk2mjM*-@qkrB9$*s_r?=1jsF%TJEE`Y%PF_?!0q^6Eg={pv6-o{pPreNFCZHP2
z?oagcS*>NP7H?Ca;<EJnqE%rX*>0^XhrM^wIIT_G4nz$Ox#HT1+&_9RM<w!U+nW0H
zT#kBxtwh~j`2Am36H?n|bqAXa(^K6ClR7hDdbeF~1hUp_UezHUNDbR0itCqcxAe-6
z1ni!~O+=}wucN~QH?Wo7C*y=bZNXO48<6poDGf?{NYHry5hI(4Y@t@RT(vmJL9nGQ
zFOat9r*+WX^xQqPqaMeR@K3O(g2UH6C@B4;o|4Y!p^I04cs3S{h{Y`0fXe+}1r^ft
zehRqR@=S50`K!A2v#t<CKfl>YG(zad_jwx^_3+eW=>UF}qsq*?wRrEJdNa-auQdeP
zMtXyD3j>v<@75Z$6D*qr+0tKTu=@=ijp@Pyf!L9MboYOdlgKFd+B56<kf%~2YB!h`
z8?>XKbNM-6iQs7=l>j;eKMb5KayDkOQPp{h{xq`eI=?s*@p_WzRQ;Ii=DX+nJ5^&3
zs+syx^MV~|#ElZoaT^IFygAzM)!i+NmDITwwM2R8Rwg(r#;ty)*wY3R>gkT<Wae^h
zm!;c@`VX&mh(6u9#dm2JFlRl$e?COF)3o1v!}8+-krhu!3~u0Mc4*Y>e-OyVhH6f|
zK_?V?w6aF<Czcr|P{z??o|yHGfI7qO4c<%ovz|p$k>Axfv{p_15hiDF;Y*a<SXGj|
z>qC4U6HaK(Uvf%yb=p*=UL=ga0Z^X5tGH9%+(*a05K%;(NYV)x<gOWM%HY++ja+f9
z!*@G`K_}72p`bN+f~j(0vQN7@ta!_0^0V4(kmO2OxQWHcyqBFtH6`|RefJPxpZ!lG
z@ZyQ%FF?_v$zDF#6hBJD{-@>KNgKFMv009~z10Nk#q#^Db5P>@Qsj{YWsD;J)M<db
z$=J>ul_%>p5=}-w5yq=jTPA7+IrRL75Hw8W1KRxFghEW@rF@tr<_U2o@~nv9c*Q{h
zGX(q#6VDBkTsdj#)kWF6ZSdEPHgBi|``B%DeluRmMd3(K#rImz3r!boHrJmvhh7#L
zlHQCL7LB<!^4iX_I^tP)RuV^yT21Mh+}0f;ArTVHT>rBFvAXCk$#$`<N^*OGg^V7$
zJ0}F?HBz;8{CpUuG$W)rC&*S4!~rs2$tpYy0I9t%@#JGt*R;3yV>Vy;HT2q{9uW++
zNK2EP2vd|6_u9+S0$fO5dk=FP)?I849@yA>i`(>j)9SrBbPYor?S^%uT3}}Yoc!JY
ztn^Rz*KvPypim>Xh-X}-P8a{vb+fcSO+Y@fo6H5YNkJkG31@~6)|>gs^;KcoM!S^&
zTY|C6Z0oNmf;D;XN1M-ayE##@@VUP*%-I{a`{KfLZh3-kUsJ90sW418Ij^*8?z1><
zInPy9%Rfa@HTjq0_pr7XUCG+p#m`fiv@^I<ObWVq4$&mLME5jVF3o8>uVQ6cDftEK
z4=F!or0NVaR0RQT;6v<gK_xZyi(*1klZ}gAoA4%@M1L2E7||B9(=CN$i0z(((@cH(
z#?h7~1gFXWI3fT0VVnaW{OZXw%}nzG8{R|ow1N30FYyA^PbDqBtjnb7|FQ=YdttAu
z$*P;^nKNduCEc&G5S89H<cxbu0@=VKdF#(!eJ7+I8g}armyOSt4EY5p?h;^rXaV|0
z=f8<xzB1l%8jXH|^mb7n_|A0gxml41b$!OgC2Dr)t_HDZ?ec0}%|jH+8ky=P0^3|Z
zu7uWL1UiryCyh3^3JKEnuhQ<mV565+iwb*`xw&Dh-Y-gqg+@q#^cUE5B?8DA<v#7J
zi%MnN!j==uqQ1pWn4L;Dr_VuanN{={XK56sT;j(X$Tiwk!u{d2XVIz`phoZM&<UI$
z&{I0RjbWW@m2c5hUk7MBs@J!%PTPJy?XxB4{cCKc$Zkeg>XrUVewdMSGcvskFLns;
z0;nRhL0}kodrTI!^dk2Qmntb#rHHo;6NCL^S;(7FZQGqz#M=)g>zdv}njGqISGh!4
z*4YB3UuX#rFY)z8Je?smlv9Q)`#Vu(8ii`tjg3RK-!Tj*ai?-@IKAV-eb7DZ>*Dn^
zV(pskqaJy!1hy>$4y2drpEGH$gk1ZN4tE~8OFaV>$`7-kf5(E_eLAn1OI-{^cbm|U
z6}L=N`TU*j@VEP1ByUl!+u%~LoVr@ScSloThpAL_rz+o}hvQIecZGns`VmmwdE1zY
z<@YakD%!NDG08nl9Y^pEjshoEJ*Q^}CB}*idl=#g6>^Lr3KT-N0@*^x;W!n}6Xe6f
z@jiSPWg|$`k!cC~vbSaO_Ao4n+jyIDKq%?fCX|q$(nZ7YaFp7AV^MBzJn6(mPYb(+
z$O31>+{f{0n)tM{W&1bo_>Q!*+ZFVajo-5A_QnM}s}ePmwy>$a2@VevG}!l?Lx^z$
zD7Y@;1C`4Ym>--}G)F+&1Ep`6=7B!%(BpU$_RT9@jb@|9>;r_v*wm1!a=d73EoxK8
z1}AOT)B`q7Z<Anmi95ma9swgUx;qhj+7_;EFav_PgK>vYU}6739Ln>Iw8|VK4oseF
zUz9!B1bWDoAfInf{KRTMu-VRDpd0u^P;Q%OS~;|fJ80<2$n{qh>wUXvb@6SIa#>$*
z!pObH8J`8SH>9p<QkcK%K1Jx8(lMMp#X~i&s1+_{%IPWlq5c%G3kkSc=Ri;5WDeQ&
zB$m}`N63IE`F65_5uLzg|AbGQkq&)UGv5PQ;mz`oP3cm;X#22c-5=ns{@muaaH01W
za;bYqv2_d{x53hZ+l?|plm;8s&3ysD1+y*iwN9f^Z=`bw%Kj4(w?47Q2vJ;4!9$lk
zi~JSuRJ(dunpN)^`xsg3O)|=iJRHGoEMHclDzE#*UN~!v_G=%wD1t!0CC(H@tt7OK
z{iZ|~yGIeB#LIiCBQKD~zxH6}`;X~W4+~BC%76vwC+_neA*1jy#<lM0ndKR)|0Jig
zhK=sm2!BCGlWz3}H);TmBD203<k#r$;l=O|y$QtMJnZ^>c2>setjgX%U%MtLCah<h
zKD!>b4xKz{4%2W@l8Dv|lwMXlMUIwA3<c7$;8+j&?G3+A<>*_9>=n4otFvU&GXE0q
zQ+X=r@uy#4pJ`ZymesCNbG<H*h1)?|uHESD%aC+0%K0~YZ{S#Wcw)fXCK81IS1OG?
zi6@rW)u+hnVCh_6d2iNt6A~#6e8ZA9O2+J2knu$UNt<NMg8`dggidyVLf@+fC#0kP
z6&6{JFK{HGy`EKGYEgJrgZKgHsN;&?LV~c8VGiLmUOUhsiaxCzQ1scJAI5FAd)BW1
z+_O#iK^e<S(L@OVRsF?!bH;S59D-hIvaU1%X;Vt~!>&V9eY-1XNhU?b&;zjzUI<L<
z641e!mty;%Vz3&Ur4$?d=OJl;H&<VEc>FLs1Z5-YCyqy{t;pUvz&5RzHrA#@#Gq`-
ztI}8WVM$5q4h;|ZRT1L{%M|%SHoy!SW%b|rZ$>YEMgjp5NBtPx@$UC98c~Kv!IL*Q
zs}-t0SG<Bek{|Af$cr%lg_67Dc9WAgFb^^wS*Yv&Wh+(B{5xd)su37*F<&FI`YF!K
zLy(=NPqpRsAH*zSVSmHMAt<a7z%`>cfvV*em*??Ki@$#m?wyZ1tOhoOYfFcKC2FQs
z^YP_N;{hE_prUmpdaNrPqAOnc<x#LRTi_k(4X9$_t6K4Gz1qeN<_+lgx)*MAiiJac
z78il1O*1$d{(Nu5jC8z8IeN&Y^gTxmgLD^UviSQsJd5f<XNEtc&8`Sd;rsiMeP!Fq
z$->{L&Nz3=VkaO!ph$Lo;w@Tw<bqMkof>p&vGR}K(GBF!)xoViW9f4j)$^NKK6@o>
z#7&Lu%`%izW?rz;^<Ev&R4?Tg$V^W;;gkPLd@0Arsm!Tvf3HoUl>0u;YowQX@f`V-
zTTkGe8c77TX0|7+%oel>^hzA!SMFT^G_5RY55oXWg%PjMLQ3qog;Daow>q<b155Yo
zL5C+z<ea~E-0fvHHP`o5uUba#Z-nL0)iDOF?JD*2EG5LA{k{q*#BAyzy2nMBUBj<J
z#+MQ{;E_5G&*;R}0|ckC3tn&D<j;=4_z(yGT!mkq)f-r}df~rT4g63r6y7RV+Lw9t
zko7m)tkvfH1ef1iM^N)05#)Q;d_X@*aA|xP879-aI8nc_=XP~Aq5t}qoEp6)XzyyU
z-<E)q59u>V&NQ#bd%tis_}$vy`@T<%u<#`nV|QD7!oqjrarf#{fqyVHh%u^rmH7`@
zVFt=K+Ni6()g9mmThBVE_g_dm+GWVL@0NWT*bddVy59UC)nSz(dD)UE<n+aVPX_bx
z<pFvENbh883bC8y+CuJRrCullG^7TQS*Sj%#<Do8hJJwa5Q0At(3Hj#`%{BvIQaE+
z8wgHSTO)jL-rH1dAu8nC4Y<Rt7r#7S7VSBaZhfqoEqvp#l#1bHt$RVMuHz1GJ4oN#
z-b}4A+n=k!d6}=c<U4#=EUJ8C3)+%xwFAMTWk=gS11(u@9Z7^t6S={J#k;2(Cp=w5
zIyL=Q(do@RJEdeste&#orFY;aT+4Vh0#%vR->3Z{Kz-w&vrCv|O7&_;V@fKq18in+
zv^<xdMOPyRNYCPnSs0LuaUK*4IEgHi7U(mJ>8Riga;DgHz;EtD5efcct%+ODsRThy
zHV?s2OEbOQ_y_>gFSvNA2{OK3cSJ1gb*(d}k`$}!x_q76BG~jTYw8GZs$MRlxm3ZY
zIcMzZSuv!5wBEP23R5t>xh>@+2j0^$t^<$Q^`59g7KOJtgi0>{@*304d8f?@&SSNy
zgTSNCuA7cDYG7deh<tFL>0Xd3Eu_ZwR8aEV$;Le{wIme~yuI~r!(vgeD>w0TW=8_O
z5VPh>YuWG)jWTc#`_>8D_2803zMCn<^Ji6e_uk}La<$I9c@^kv7(*9hSpOL!E_Ifw
zDBUo<$#^uzU9mtP+2u;=3EM??GCeODS7n3KG-4~I-E(>O5>Dp4u;{KSwNW$Yw{k`D
z?$wA@Q2$JYH=;lDEOP48sEuZ!$`?laZb8ih^k(eG=!8Y9fxhMNO{hxRD)2$a8sI0+
zYmo8~E<qJJOmpuKA8ez4rO4pbvzIyO=T<9*y8cvu0zC^MxF3~pdtV4}{=d~Uoy#i6
z^*t^khkrw_57i<{HJkg0&AdGM=%O%14Y&?(+4Go}1F0hZMh(?@NnXogpv@Y9!%r8(
z=$aOfRRRiqSDr5M8-EF+wIAYL$p&oGLpp)&-9{*Hj<|7!si^v=^`Y*I6J|S|AAt*m
z@+%|(v#IHN#YgQ);gOx#N!Mr%ARZ0@bSx&Cw}5!;jG?8PW$kib8ij$FQ0{SpF~;Vb
zr+Uk<^SWsG2>b&<&)qY_`<X(_c!M4-W_OYAf~#Kj7g@IdrqMKU{7uEI*kCOSdKAly
zAtUkLQWLKlv(MVi19LIIFR<}X^eBE}`c?11cJf$37!~?*;y@@HT2IIA_ib}FTWJyG
zDgFL<@LMH$M|nRVzVe#9bExf8VL6TdZp!ViZO@T;hn_n2P+zEDWGTngaT`62juO4-
zFeYe)u%pW5HWpKVNcE@|aPn5D(^#6N!=Fn&>{5(Li-;F2Uq9zq6K*evQ~~^Mon<L&
zc5(2=h;@(ORG}pyBI%}odsjjLu7RxCb$xNN3k>=m5tIC=uZ|Gf>rh0vt!BGW<n&Fk
z@7Lbj=5MGkyQa}bdOfoC0fy8umyOP!;KjswH|r?ivHK|!5kB)EVM8Qrh;n#B%=S3`
zr+#N`0)miUL_!|}y{uxd8C_1JWhz0sODpV|wZjzI7~TsEJy2Tm(o4t}bCA%jjJalO
zb+MYl@j_`6-s8A;heRVtc?+L7lB^glJvtl9q3_?}!M;b69nrx&Fx(YGtT;fG_3b6`
z<mqsQ`=pH`F{zr^_g0Z9x3Y_^7Mq&cOyIH^*rCPw?}5(Jic)YeMfk*Y_~sdkMx~`N
z0RTOPH6FIt2@D=^4xm^@+5}j;Y}Zl;J9NlkH&qiA(G{CJcO{<Sypm35nGeFSpzza9
zsWbj<wU|Vq6FVf(xHi4(;}9D7s1)pTOT+fy-Ao<r%ibc{OWABcvYZsQd?(X<f4Kwy
zOrO;cotP>tjP#Lew`?4{S7$RxlXLGjZm865VdCoAMrU=rws#xmB$f!DI8Y~ZQ>}D{
z{vJ5Pqqh3krcd6x2%dqxS-keBhL?@kT^n)5M8Xl_`1u^0ol*Qh!^YG@!tbRs4JDBV
zJ-&Mjl`pTReEbHk%!YnJqbizW3|6Ag$T6X1S4Upp3m1-A@#nUsuX;UX_IIA<ScJ46
zv)VDd2`r995*vBGigWulwb#ex8VTfTI7sUA+~|byufTPAZa~VDV*}gy4t{&&W^yg~
z9SXgy<Ji8m7Q#vdrXc7o$t5bs8pZ&^<iZNzE(+XWS^&%BPj@Eco%~Fr&6gJ@_<ME!
zL<T$~;Z=4!_`D{b{k<ViMaTIOOXswt1z)bK9mgXs@!kGh*mTfifDbGRSi`B>ygH<X
ztoVTFwA==MU=V!-hM4KRSU<x{tzS{}g!5~fVL>zhZMSP_*gAr4A2UT%BoA=yk3p3V
z8t<GGxCP=ukL<ct-nw$vZSs%vX*oVph*7f%H6)2^>BC{|jpLM#N>a}W08;pW)E*@f
zNuc*HDx1j|*|ADzU><d4xa_2E#0%ee^y;qtG8pUw&@hTE<aWmTkTw&52JQAs*UU4k
z&seX_J#L%im*VTP>l}h_n%Q`IOX%4`uNVpHK~~9MIc~Yn+m;(C2W(^smmr_*Hqqs%
zoS6dWoXqXG-AGyH%=h0=!|;nX%@tc?Qrvr&BDOYVKA~Q-PJN@u3hsA(-$qAc+wLB9
znPj;E_m{+<diaI0Y2~9DP&Ogr5gFnKo_7Oe$v4?^NQ7Y5&tbB?%AfW(V_%4V%*lPc
zjUFClyw+B+SQr7b#MmUxnQRYloYNI<laE+HatNjcobynv%Sq^L%xVI5=S#x!KVV#m
zkh<?OayCsp-*bfUKfz*f$b2k9^^c1Wa{jaa*WK{xg>=>Jn7aS4N`3jSlOnQq!(%EU
zP{pEbYW@-5^<h&1`3ruhh}DvIS4WI%9+!i|XFgeG+J5ntziG|DS6%TNN3HIr9DA;~
z|L%&vdt<*p&UtKFD!z#y4Q5Mf59@}`XI9XG81zg;iSj5(M|Howq)Wz7yHoZP^wAUg
zB6MZgq<$S4O<%Ob=sG*8FDbVdzY|YX`6(!CfBcDuZzs~-PHcE;g-v$Ta*|+uOgj2w
z+PHb*80Rpn;zjl&A{KlGAU#7elN5fK>JqAH36Wm*2(%@Wjp{+J`0hT7q3SthfC(vK
zd|lb?;1SIqxXz-b^7sXFC|v~q^n`_XUt#P+*T>yZeS!duJywv(-ykQV=$t$RktRKM
zJ%=o{k8XCvJupbNepdkj+DtJ|fQ|KGnhi!`qVjX;cR0>3^7L1DI!g3i0wrS0qo++p
z+0zmOqqTr4l(%guvsWHc0t0{<O<*Ic1vTEJaSU)%LB*ey0=4a77mKgTq9$#--v%tv
z`MY~PQn?UvZ#88)-0tWMG<fs3$g{yMct=b5nyt~;Hx+KUl<tAykXcS)a!8r;>AA&U
zo}$Mz*RaXzwM=civw5+nXezoE(fR21#W;@Fz4aamo%k{(viDnnq5_bLih10J3tC`r
zw=K=&XMIN6`W_2yPYh}zPFC{vOu0?nLKnb0Tw0no=MIF3Rz;7kRJ~#*hz_!q6v0=h
zLbaLufJXFyh0eEWUbWyJma}nhBT@T5GPt!y;U>;-%kPlx-YI0*M0&^Xgw3K3^b9tl
zbCP8lNh*GDdM-SUwi7i8qqe@j!^k#37;wFyeIU-rHVY*`vw9V2V)aI0mwgucv$(NQ
z?ZW~jypn+gZH%$RGih*WNjlV5_ok)C7zo*i8FVf7GeM5_gUh(560Sk~BFeTCn|xfj
zyGS<&xKV3$Hemfzth_!Re@*8B&;v8#WwG`<i{AMre@0%C_(i6L3t7`%ef1r#Ef1;N
zPD0d@1q_1T|B0B$U5B@g=?ju%fE)nQw=BUV4+HO56|Nog89%9Isgta!FI;=S{+eIO
zh$KiIlY;*Gh?0j9Tc+>K_dD46dh=tMG!DF#miG?1Djv6DwPzs{dm*Ps#Pmgnuo^?^
zkH!dQM#r4XMvl#|n`p*n(Y*mZI7K2MkVr6}(Ky<~;z|>0KK!9@V-VBmKc<XhoEEM9
z!TNV0(Up%<+!fGq2}O^Pnuv9~VjDMYMzz|2zWjUmDig-%8j>9c&Cp`Hg6toH#xEGp
zp~Bc*Bz)hD(9j}L<8blbti7^TcP6|brZOt6cGZ1rHDvEHrZRdjfl|#bzjhzt@+ZRo
zREFY`X|7u@LUCM49lMYcR^62R_c1c}M^^Pm&&_);Q8SwMknz{22v<B_h5(EQ8jY+)
zbjN`s*U4A^taG{x7T3}Z7-C-nM_})=s?OaH2`Xmu+s!@=?U}`6mR86+h}OTMW%X1?
ziCuKrMVmTbg;s_A#pPwcwc_e37ErxPZ{bQHz9+)tY@k5JUk_2pHvg+Mo8uj*vx%*y
zomCXIR8T6Tj3%-FZKr(beX@bYZ#^)=Hj?vvAabiLJ=Oqc<<<UkD-Cgpm{xDT0B2X9
z#CULqPf~apm*g(G{z+Yn-^Y4CZuR^d0g_XBjZ<o$-ZABiF{lUoD6}qZ;E;U?fx-=<
zA%L8_><FcGEn3<R-9?j@&QBR9Wu@Xrxim=lqOUQD4+gXGMbs~lE==qXjT+%u+s{LN
zU<Ws{kPFX^IBX?VlVR>f>KWr)wbKwtR+)E)cZ;zViIUMfu=%vo=f{EXoKXfc+?bQx
z3}=;*Jod{-I)@u2n({FTsOO8&qlk$HG}p--kdyWgiH>1nj}L8sf7UXseRPW;81aS%
zGKhJnli)Hb=x!r&7VSxFSSXTbOL-SVs%wY+--_8Sl_a5H*=2H5A$y)z6wK5JeWWhr
z|ELy&{aD9|F-*$(lBx|=XQaG8Z|SF<F;mtrmc7ezELeDq<z#uTd&JOmgUM$+OtAb%
z0NqTY3EitFMTNZxz&6jNrLNI(WLnb}!HEtC^mX(8yfOA9Yb#I73n4wtnsNe-&F|QH
zOa!8n&!fJO6R^@griCP;-y|2e_*P_!!K|dA(b*X5oqFjN@#zf?pS5>W<3=UcOg?Bk
z%x*)~-i4FMQiS{YvM~o71R=Y5BuO0$8wa0l9Th9#Z6<_~)tUX=h^^D5L-$bxANU@9
z88yIocTS7--bw0e+rn0$Fyq%i^Ie-w+;UM^wU60j9AF1Iflfk(Uo**W#NVWvPO(Xv
zMh>0~PoF%O^lc}JQqosjMmhfea~7s3Hz9%K@(fWYeU_wd!N^&q&<{`itv;{+3{LQu
zB%jw~S}T`1ksA>{F#Vur7rR&ZbH}mSDEga<e(^qhd~O+^e+V5V($s^$tRFA=`;CAj
zf2s7I#x0PJ!ij-BW;cl_%#otx@f_C*|8r=#{Fn48&$~zQK*V4_@;lq=Q2)<U(*?&j
z2HGlM<*R!I=I3DVVVlid5HtLxaqhW5Lt`5S{H0r1udsxTc`JXZyM`@JE^b9nu*sOk
z-)>~%SYr-Iw7FYR%<KGCk}7FqntxIg9N~KK=fJXv!dC2zohM^hxhq^N#Me>0(;aXD
z|E{xE$5l-dbl%AJYD^ZSh$4SUYlk~#a34W}h8d_afSCBWhh1AvwYR@H)6AJ?kN_sT
zqgkXkNKb0@<{0PfWQ3E44fe_IFV~&f)l2_K$A6zb%5w*rwtfwx=5KGnm>%Xm75Zdj
zc51j;S?Zf)d{RtuE+e~!IYw8tgy6o+JJZafztlg`#nZgldXRfZ$g(ia@5e%zioEv)
z)OQH{&!6tezq%3oXyp`{%v;)IbN9BJfga5aTEScX?Fq&oWCX;uH}wiGe_oz%Mky+M
zycg*F%i#)cx6fj+**Y6QuzQvE8WdaV1w6U)OR~;3NjqxGg&j34HA*s&+X-vMW!mlB
zOgn6<oiU)@fOc%;C7<5=R*O$&kKR)=-W&Rcy-fy(C#$!kbf0VFdt||uf)v(~s+2L1
zW_B%^n{Nzs4X2bRd$g0cd|68(*YKq$Xccx<2knH>{HaDd%(8jpjy3Y@Ez_pLL@c}b
zwL>*LLfyoD&3>1!CPmDwFvL6j?JU=qDh`&xv|LlOT~E@1UW=RfE5>+$KB+u??&VT*
z3Fy{NzDNp>t2>LGWLr%8`n9lwL4xnTttzT2ZfA5}3l?|(MYJEQ%7G(ZcG@Lzl{Af}
zixrz<Ca-Q}Z?|L(_A^wPZYAXQMpFU`6+t}eNwljEYYG0g`_GhnWBqN1%eEgW?I_p`
zrJTgi5dF0FzSzEmcB0hUhr?C|ONx2=%^JbZZt;3|^VO!2zmP_(+UN0a#X_FbFg|I8
zc4)2I{`cwVBw<x_8qIhb=3^6ZKqnILc7r$dgy#2*;@4lG({rX6hATnmI8?(TDC4#<
z!=txoh(>IdM?d=t`m!%kOgko<eTscx488_LUD~(|0AFLT0D1${qMB~e1md}m1t}Yp
z7{W*lKEP2&v`$gNMkK%@TCkNjnI`*I|DSdrXK&Fa^rF=jmgv=pRlXSTmgD5@8qW`e
z!;|unV*ikfQz&H&Ir3Qh)H_uk<m1J0ICiwt_WwZ*m~@XLX|JGx-WsJZNV9Wk1>f2k
zk_y1iGh1%lWq;*A$EhBu%4E1KwhPsJZNlFuStytH(*bjipJ6`3U(Rb7#F}z1qA#Av
zHtG+ZKeJmz1Y2g5sQtN|V}7~Sn=(C%9Uiu^_o@o?c<<J-RsVzkXv8mo6TD0I1A`ZS
zSI@IZr+B--wMV?!q*IKlFtM($eVr{QH|<^8rvrou-sWMM#_YgUffq>pqR)mk33)H1
z{c_S%v@Y|0aaezrUN4azvVz%zRHQuW;yW>FXEU+nWYO1g*BtIJP!Hbrn7BQxx?r{K
z0sK+`DhdJb>+;k@#a<Uos(mUgM*N7#38wd5qc!?T7A)~?Q@nm0qT?sFTE+=qd`oHG
z*U$@WU-e!LY~v(cP6B!Ok(DJ}=Wmi#2tuxQ(JPTTgg|iJm49ZHY8|l)jURvo|BIz2
z_g-EulQHtkL$CFjVVB_Ab*_2LCw_|=jUOQ>T`}@&(xS4Lx=>J42Z58cIF-Io_~2+E
z^||;n^3(3}o1QD?`&07r--edV@3+UeZK4~vugfM&#wZ<Hr6(UnC+t08O23zn<4oHb
zUGn^c7h7G|!|sk8RbC=n<P5*?g=C#*YH)v<I{F5gkv@wLL9NLqKf;}l>DF8*nf5W1
z?Yd!S^cBbH9c<g}@pGIbG%y&|lRE$65$<;O>m0~7;rgCSLWpg|w1Ia8nLn@aBQk`P
z+{&M4Xr;l}(MaH3f2Tk?zsnuw&38Ih0uj&}Urv#h85@#jnJd!N!r}GuzhX3}p=>rv
zhTNX*vP{RhA*itAY-Q2~f$Y3_Zz{Su64uXk%{r!{?cCWLWyzxVQhaFj`jK=&x?uU^
z>Y^!RCJk%ozhPotbkpG(Vsc(JU-a9pzz=!pAAYZIXGNF;BUYq<phu6lD(RJFhQ2CE
zW+5UGvztPigd$@oew$+@T89S`v9m%t!YBSAyenT)DziKa-+o9*CZShuRi&3;6xv=s
zw`B5j77AjXH*A4hZu2C1_k|s0e;tF_&Z#9527sQqP#njq)WlUb6J|Ag<H|qmCoa>i
zr;jZCMvN_;^7gEx5WKM`I;y0SR{s8*f*uBtL9Me~-;7v?UVmrm*+YdLrMY2cKcOvj
z<K)w=ZzfjX?|K7pmY-XfgA^BKjgb{02c`#w_YuL$$r3>vf*#L~<$Dhzai(%e@@o(P
zSNW|<8WB_gGDan(c~u0<e<t`9V`&WM1(r<|ri9_n5rx&LH!zNus<yty_5pOv?i@hw
zslk;HnF|k5uQZ1NjKxmw5;lfpGsq<KuKSvBSA{(4k+5aCZtOCQnpmu$T+a{SGPE$Z
z$y%pJAF7fB&w;Yt#S~C17;ym*NG-{oG9%>eMP5qN8-AU8Hh}R;Ap9lmY;`(V3O9k^
zjhdVk*&S)hf1qp3Q#RQ??L&U5Y}Q=h9rd4kK7!3s>C5%~WD(Uc;LUp{0UYe4#iVzk
zExrRsmt(DDTIzP801HcNTm@C=7-NX<8hTt$fL&d=wOu@?{%@#feLITgFjj{9EB>TY
zjPCtIN8AM^It4{km~QRBV(F8YM`-cb(kBA39f8FPO`?;-++n)6M;4kH-Tvl*H{wxE
zjMbyJ{8Y;D|0_Uz{vU=gUe@vw3d--okv{FO=bG(H6?VVL_Cn3(B7lr-cka;O#V@oQ
zx4QvU1?VmDYog&FdWrD=LY)`f+dc*%^z(fX9KeBr-kWxKRXpOQ=Bdxj;M@Cb&w6(J
z))RpegP8buY_JVodvts1_T<*}p9ccHD-m2v7yJjDcK$@aHxKv|Epm(w!R+>`jnJTS
z#bB<)s9tueaxKsOj)@~A9V$2DGHL5!so@5Jb+c{ITyDScb(EH*gwd8!^s%f}O{c2u
ze&M52$7E;|<h5%y@Ay|e?9Yu!RKTPCA7vkvYq~W9`;1GHw0WWPoYmM)i_=iEYe!Hc
z%e8LF3(JLo&`gB#wYRFRkmF>`#3pE3RfM;#Gd1%r+Zb<(;9WLTo{ElBPeCRdPQ5Kr
z8^c|~fC~Igw-(Y~_jD{w)=xW<rvga&@ox)meQW+iV)y9Z)mr+QLisw;@4bOeoiN5a
z;0$yI2JGm7f{(#6YMW;NlxtjC&hgK6Z|UcXUv59JL6|_#@OhW!1DLDn@ssN$Gdsgu
z6SO}5_<(M>v$_0;`pgDP`O{4FD~~GLERIoYz1Srbi;tmgv|a27HkDu>&ZQ_wEs6<J
zpFssI8*zxAEH9!Vua60+CQU=kc43^M0X2RQ)z`6U*~!%R#^rko<{XbHbL`v=>3g<t
zGxF;lFdY#&_EB9s1haYURlpH|x8Gkl&t_7*2&+tjM^qRd7Mm_C<12hh>R^`gM@Tql
zuV+LD6odK%clIq&d1g6fRLrYAN=RN+blTokjMmQNg+Y?FEh-K>wS8}S|AiXHwz<0a
z*3BD)zMMPgx$0V_`ss#C?X-}%e8_dM3!$#VO`&J3s_90?K5cTfZ4)FKn6m3|hL31d
z<3ZK7!6W20<}<)vIt}FP%20L0`wY&2uig*689L(+?!DrQQquKMZ~evwZyfxabzdE5
z4ptTrr0kIg{zco3MIBQaboc|~r4ZRU2{33zD2dGztsQHi{(DXc#}G@>oC!qVpL>9a
z+!G%xQ2BA=B<u+;N)@8waR8E&M6(_rL4Vk7#ytTD>nnKNT$<J%`Pm&_okX*=2>+b2
zyH%eQPN!f<am;G8$lu8)C2s`F0}{^HWxz?^GB($?;^~3XcAuSi=5!^xcKDLGPd$~%
z@reY>6rBq0oRe78-iHFh`Y~-m=41V1+K0eROpNlsw(^d@w=_by^>LR(AJs3L%yC*B
z#oZW1&EpXF^DBO+GdS(6+Vlyl?#Tk$$XPvg`8(RI@{C!pzFC^3(ur?h)9t}-b=0aF
z>4BbAP%r_LAA?wT#(s`^PhnlQ8_h}I0F}?ph~R&t=B7uh9%s?Rc^%Kpn8PeT>>tZS
zS8qL#JcjuF0W%qm@Xbk(YE;PRztVE};W24EwDGRd1d2B|TyWH9VcXZ%LGSAgwao$~
zxEmOZxBvM*D13D2WoCYTPP!@#W+^W0ZdUZ7SjF9}0cWwPes?P#&i1CCXkeUjX#wrj
zPrNT(eTMfpv=Wr#UZUR{rh2cMa$#i^t$q_JuvaoDHCf)N#9?lSH_hV(O1S~@f&w=b
zTff|W+HUOjdDRpVS~h=k6umxu6TauIz<;AI8FVbrXz*ggyFi8wto&5{SRm|#SJ?Bj
zv0BPILhY5-<Xl_AK!cCh=U3eB*&%5&ZcIGBgSTU<+ur{xQWc+@5H9ifrn=&8^UH5%
z{fo&4y6Bpyhg&@Vs7F6zEm$57S~NWUU4|A4w1f`-Y~v7<A<V_G`>brh9W1;0z16TY
z=bah@Bm>g$MQIsr^6r&0C{O#I3DvA_wVt6HOb9WUzS-0q_;+dc+&<+3qBg$DLL;qq
z8pR@21eA^E)+F5p-67D%(7LN4SEWXhM1H3_JjT85He&G{c37D1`$qi4e`ocY;(oDe
zZrFj^-#m1q>wKT@!Ul_^D$ypna$9|<ncRLn_GOQzC^&S_%2A*~`dm@4(G;WP|KaJp
z<C1#+_g|JH7x^~#%FHbH-lMd%GPUJaaGR2o9EhWGWv<NJsHK&a1I=&?Zg6X<xF?Fa
zKv8k~JAEF%$M>)EIw){Z&N=t}y07bbNn*1?j5tpvp7=a-JOziQes@p*-mRJy;wFA7
ztNDw9eA1NV4!+5F3jWXi4GrDHvOGJ}szrXkSN0ns&|nnJbM&-kI)#%2K&1HVbGwDt
z@k7IEI{c);Ea6TA!{iS5cD-<-AV+TI)&I1pD_Jw<sd2}m6-p73E@L7#z7VMjCDcjQ
zsK~gt78L?0%ouJ0nPO5L&-T}_nOB|qA6|`Ru?x9#!D5_NDn8@K_Jd6%qtA~mTF>uO
z-h$ivNoHrExG?jF{WoA?PQG&FY%c19p;}#qOY?<IBNBBMIb%5nqPon|2qk*9zQTqT
zz))1ULy*n<NV(g=Mal~g)^>g!SW2`q{5_=9K(|?96H%(X!-{%YDY)=Rr&VfJnr9C@
zRhAaCR+Jh}EHl?W^cYTluvoltkOEng=qSu3mli$XQgP`HyN2PC2k~i_yVdsZ>dA1D
z#rDv>BMK9tFBA9`=Qxhhsx(u-AbMoJ;TmKFQe0C{*9SVOSGy*g<sQKry?4F5Qm>AC
z>HG+r+|3W0nQ9GZ2HU7~brya=u^r1Zfc6E|jtWiHQSPo4ccAWIriB;oVeVT6C%`a0
z3+-ck4x+%dZ~MN$op>5HQ=3muGloHK0H>*{pL1=-d6-&H=`C!lV}TvaKl0y{{UEF;
zEN&asEiC?MnSlB5;LwLL+ZT0jI={jj7y9W!b&uZ-2rWEOMn6Liny8T(HoAHyhx4Px
z;l=3i^#r%u>57?QzIjkA8AcdC$_#tSX_csDL`93~YMf3m07O^w<j}2&BT#;5qRP(n
z8)x0x$ihK`@Ta?vbn~{VnVm)c68g3_KVZ$vlO2&b*I6H~wZa+~(=ex6nlRW4ouSiE
zFbgRTWz%lx0a_)(V4wZ15vINyoqRu#MthLd&2<NiMVPMkS~b%;D<4_%*rs9LHp(M;
zz=<!@E(9M3w5wg>Ebgn1-VVVpzZbW;Au5~@X|hakyOr})J2O@t)S>H%;g+_HUVI7(
zC>Nxn&8<v#%sn?e7Fm#m2a+nZOX;?!)xar!_TMRf4*TKVm6lVzDi29j$>#yIv$qFE
zzE)_=py;Q53=ik0W(HiJ2@PB5zt^K#_xA+pyY-H<lASUs5z(i!AdS=}#<;UL<|cc-
zSV2qSynZ~It%**JZTP;)fs+vo@p?(tg2FOyFpbA4VFQ0J&7PGInEt?@WvLsYQ91bx
z)@8Ha#jIN_Gg^#i4o9WU^v9PtY&LK=rkBhXkruaaIE>uVJ+oA7zbqjbvi?CYYTq+9
z*$giNK(*rcJsG7k_YL&j9@gLhAV|JSLBGPGdEtPw=JvQ(BC*z3B}q3{xLT7}z<qpM
zVnTm_OOOVI{><kkD~C+Jy>WQIK_vFXD%cD+YIfayCZi-~R>#8a%G0?ZP@`%vV{#S~
zS6->XsO1<@_i1odaI!gk+5n}ao_`ZG;9ETwwI7uc&4MU<*ugBxquNm3f0nG!2@yKQ
z@wi*QJO_MHF>R`E_D+*?<Hkdp{MtdvWuEEJy?DxotQf$bgHyQ#W5U*70*r$9Ed<q0
zX7FNhK51>&JI^_(F|Bt=V=*Gh)~aVoL)>CXgL`CJQfTD*q@+%H=wmUZn`nM#|Kb<u
zj>*O6I*J#yw~?jg*TWcI8|7D~MNKzryTtN%#LJ#*jy|peQeHk4%YbGCx6az_iOivd
zC;?ZbDd_4@dnUQP7R*SBfwkhH*mmZ<ZyYD%oXsz1)mqRj7f-zQpw;KG=K6^>g~BcD
zGm5Z6&zyc@4dDev+_ztw*fo7C(RO+N0i(sO#Ol~~POSMZdo;?l$l);ecrHtg!wxPx
z9ndP9s>Xpl@mj3?*8gf_@bAo5ti^J2mS*(0r!cE#<~c}kviR}R>g|F3*H~`gc!;a5
zW3@n6kxt=-xGrPVF^`m_uc6&T6P|MUxJz%Elk<QWk2`s}obmN{=M@(eHjq}6cUG9C
zC8|6+!+AWeM}2RazVlWXV0p81!%rL;)k;J2<jNyE_a)r}DLbKadTyFjE3Mv>A`2a=
zRXts|b0YA&Fnje&W$+RcD28@WDwGI<$o{u$(NnF;_=j(<y!v;g%We1Df8K^bZqY14
z(phskvc_y(;eS_|I>gjueYGPuYjy+V`xOL|p%A0mEvpBy;FemW#ftxgLQGg_(8#$8
z&)B@Zrr?qo+z+7;`&Ww<h7jaj8wP&KEw>Q9o@3<ebR!uL<ym@u^2b>jZsb2((RF8f
zP6cJc4!x!Tk9EhO=}#5fi9*7N==%-D*#uc(QjMW%D?<9P<{hY1_`9DDLiblliAY!9
z<yau0@-^g#A5-V4p2g=6*0*f}V5=U{g_i`^gz`Zv1`5Ma(8wLkeG|=G_lR%aK*gp9
z-~CI}7=p@0-~7ZHot$35^B6T119_^Xrfc`3IL3!an->*PQyuv-+c&vvGtt#CPH_b@
z%L)`jhXpEEjT6`_i=pdSXJnSWMS@qNpIe|#!luCKN#Ad^J(~Tho%`$q9qRmyfReA`
zHDN{Y=K@46qx5kCr|B%EsQr~s8NCiQMo;D&L3nS;W<UwzI705Ldw(jXL*;TiE(>cJ
zg(+h#^6pHfGKM~ARpZ$rtmK6v(HXD13pQ-D6q0P<&1xBS5<z`7E9iNYp?Shzs%1Sl
zX6pwpY!T%KHBDHfWuKjD^EXd8ojKf^uTR%4wp>|zh{=wzkT=kGkKHm?zZ+v#)MVhz
ziC|-YJUr&dZ&RzddMM|AW;ixMm!`P+uJf!i*-~l#w>1w<qY&gKAiV+vu{g8>qi-->
zrT)RG^Td!-;n(p79f#g$uRr^(an8*?TXtxIm;P$Cjc~~|_X{T^>V17-@!JN(DD|`N
zz75o)sxI=*@o^q{#FocsAp*N6T13^nctm|K;?INIBR5DMjtdhSAIM7;dv&M<4Fyhh
zYjenRtTjH64#!gkwzv;=@zuMCq-GZ5L-fKqoct0RNPS?z4QRRe3C1}u3mv40(MpLD
zHXSCX&n5w8>iU}F$VrM)XkqNDqjwo6DPv}9j>r>^E|mFkK<gl-#AhIUoeh_}lYy%c
zPdXHi@c+zSJNx7Gb?Eihf$3Y}cypCA0r-HUkEe7`Ne^S~b^^;8<lSP<P`gOS=2}!O
z<^Unz4PZR1<^DUmj=ksb#60`Oxp>_xLjewbpFvSDo=J6-#e0a6jD}p(=Fc-UXhtag
z5<R}V1#kK6orofpZkoxgudJ!#)y0_7^QIfGj(H9<Y}TGoC9-5MwtutxmO9!FX`U_o
zbUc2~EO5W#KWF}W?>EvU@q~L**U1e($OezqR^E#gN2ibl{e{Lfuw7b1vu*Q7VWcBT
z@<TDgAZs|?8X?IPd&Xag4G9U@P(4JS66r&pAm9}cE$<oRzCHMcuKRytI+5Npf(vV3
zVx`R%t|k1Ag2@|x7aDR4zC(dB9-<2?iz>?=YqexzjUG$*Qi=8<$+f5PF`u&d9k3Qa
zP3nxy{_eP}!$5@8L&vq~0;6baxsU$%>yiQ{oOiZt^5IjvRv_woVSi?4(t}y`QD=G@
z^w!K$v87B~Ez$~!TQg_zlZ6-YVlV7KzelU{>?kbUWZ9In;7+(G7xX4Y`|ETxm-7RX
zeekiibLbuQCiN~;zH-d?jmRTtMP5*s6F>6$5NgqMOz!{4<B6Y@7XjYI=a#I*3t6Ds
zLgk<1oCQqB5*%Pawjq3xrQW4WgB_(^_ks>5PI{vSF~!6}ijiU)p%un%$JNbHv&nru
z4cuYk`ZW@=hB{I^qP1~Ui4<!{7uFcukcI1M1VJd{=TS0nJ(=KmjR2;GD&p}A0Ic2u
z7D+sH#%?NU_r7D(YfT85>Uk%!&*wJepCu}xK2yo(kH@AX*z0(kk9A{V{T$%#aP|`q
zrIr$*4$Qrmggzz~j`=s`SffJA>-)B^f*y*b+KnQuWlqqM2bshc28I#j0TVcf&0bNy
zJO=V-X<MFthFQqIZwDSTE)+Puu!|_u(HG=6f?YtRRXtEt`&513y-H`a-+GQA(38;$
z7;uKM1;^Nj@gHg|*L+dJokw{&oZU+8sH|v2l8r;~v&m962f=z_nm(kl%A%JiJkw@M
zExNP-C!md01aRFy5P@@lK<bswg*l*ik=(+0Z`|7NteMkgPjP8;$+nVNH$7K*Nbz%p
zBeIW%t0@+ILaRpp+&G+Zzl*Z>?;4<U5-XBE*SLEzVkSCyzABOAgxOtgG4h+x&X@yT
z+!IyXNKMT;{x08FSRwJ5a39LtC<enOjeOo8AJED>3NnKFt3TSd*>W_D&IFe9&sD2H
zq)r93>xn5-NFT?H{MQHVaH6f1VCnbOAa)YRDe{V3*g}%`i>1<8%ZZ`Sh3_?T7_iyP
z=){K9`%BMTP)nz9iL7OGT95Tswk}u4bE@mmTb@|fz#&x~F==)UW8Dhpr!_D<d!UPG
zHGFH3CAOqt23U6ngkyWbroH7|&_B&MAi~BNxO;CO4Cfu&Q2eSP6b;hm5Zy?C@`fmB
z2>OM-WHmUAP3AHbj#@AW+q^_4p-)D%0%?*V>x7`m-&#L^k|#u5NlyQUpo3}If>&Kn
z+ifn8gzk6-*f;%5xu8JvJA4)7qT;=F-5N;Ljuj5#6vsUBoDO=Oai_>~EOjvXs+@1J
zDe9+0;lih)S&@V$sK_)eUKp+@l`z|P6%Z5YY`IwQPSYmdlj!vrF@km{O8UdRNX}Vw
zSxUq7xw(aW{$^-r@s-e#%*A${*m@-N(rL-1$;I>F`cy*S#_SEi<_D&{+r;O+E;I(q
z>@kW_#(~EK1UYuwBq;*#H*GZJmW=k{;&2lu1wGm0UA|9F^fO*Z??~BPlKK!1Nef@@
z0+f((<><icY6E2SE4N30Kw(;BUfQJyTtJ_(gO1Oz;5c~u(8_H9GK*e1_i|1kB4O{$
z`wd=<ABIKbax>-2dJ@%s@65c=eP3N`h;alP0iTzjz70IJEJa5z@nq#u;>KYvjRPDD
zolMOO4yQHzEt1n;fr|+R>1Dp9U`dJ0s4%}khE9$sdDf%fuN}34SOUe^PxX?u*K5~1
z(cMmtV$!)xkxbOv!4b~o;APQ;WbF;5*wfG}BB_&xpnc5d`Su{_%6Hm5Oa}Q9-biOh
zx91z9Pa!iVaMsV-)=ov_T#qBBs;b6Qx4?sM*@*BTxz|WpM$T7dK<4@}G%LtQS!QBd
zCv&Dud|FA$iQLzKSa)gs24gS7a4f}9fZThdeH(>X;o4!CnLHzAx4>xQOGb4_LGySk
zVfS~pKu<I0FS?V8ZPamC#%`NP1Q3Hxf@Vdmshk94SWwW7$UBc&26Z@wG$`mwJA|(}
zSb2;_L3_za$ko{&p0NZp-?FpQL&YQhT4RvOnF)~0M#=V{dk3O><KRi_zeUb^mwMh_
z3iVnoqP7doFi5<%PN|!uAtzR}t#}v?AoKtMUi+OvfS)&`CJ5Le$&3j&<}vw{oWaV@
zkcRq|*1vPXX_*d5Cup^UGf1I7wCK*P-H#(`fWYhDU|~S&EJq<gjJ5Ef^gR2Lb-dpF
zmd{x<t`~2ag%}F`q}<l`k0AWSZl_}~o<%SEn_3dgt^-IKl}a)nU&;<tR~=UP%Qrt^
zy;-39o|6aWaZgwlsS%g==~FlB4phqBw1q{Xd!}s^k_dmGEY0WTaNS+;AoLYx*RfHT
zNnmxyhEObaR0-aOW-YL6<M&V<)<~UO;d&lUSx>IFDE7tOgV+u*FiWW(Sw@DJ&c8is
z8+>C-CM-!L5sT*>(inkF1x{gP+_`h_GMAfh$#~%b+FZ$Y-vaU6)a2HIjhpaO#Pgv`
z?9NM~6a#Lf`8xJhog}ZsVzE%z_I!&TsRpL4@AE<3YHucgaz7?%{-7<lf50ww8YM*g
zmGqE7AE$^h`U}O?gM>b@MkTo(72Shq`3dd}f5fc#C8(4omHQtF5ppUkn=61wOG;Xo
z*)ZS(^+_F0?r^L86Z9(Xr2@X`A_aXbY{%QVp!oVED*gmnO!hnKER;-YsqZ?mnOEls
z6>WIqyh!6RnpwykycFR_2JNk<V$FBhS?b;bJnS{Czr$K<l!+Eh>TOW1-1<b^EWnvj
zISZXSG!44~Iyj5Z(#K0|QLx7<m4?HR&QO_?Y^Iq#mgyhO6$Ozl7NIuGRz%wJ<t(mz
z2At&bWpOIH!|o+WedJcY{&muPqdQJ~M^0`dh{;B~Gqkjj%Wjg~1Sz~ha>^Igl4U&M
zPlR32lI6ryZIYiY>s&kibn!&UI#gyyZX0{8^)z05QVy~F#pFDM>F0^1&6?_TKqp{a
z`l*m#=kg^Yf>;d8t>3j73;rYi<QL&TOjSs1BwxDQ!X2`&&5r0FGSrzYlw|zP%Y73q
zMayNvT)c+*xCfm=P<NNnvI6x3{U6kHh*U>06->nO&KzK{2aIHwgTI{VW&ysj2b&J*
z=~d&~blg?Qmus5`Ud4jCj~6DaR`Es$==KncGM$1jEjk^kTFC0S*m!koh(+_n?GXd8
z=9NGC_S{QT97lyvy)nlZrE2W8;uR4>bt3|?&jZz$bHAN5iBe^66Ex?;(7lA86R!_`
zXa<cNz2_wA?3j<%-xI-%)nDFS7Hyq2VF|E)1Eh9gM(P_JOV^zP%MP?4%dk74pOy*Z
zxcbv%xl2?u>OLxTc(PmGnA=z0DMIGp!N0fvS~@EX(2(Vg4W|k1X3B{~J716K!VNyN
z6@TU$8*9**Qr^(w(=tX)Z_n@<s!saqWN&Iip=)lFxdEnEbOI+;VV)H1r3+rT*H9As
zTm<FUCPl3fs=XiHJC>_%IR-HfH(>!t(Oq&oWU7H}nddJ?szCu{qSrdhU_%~s)?NGn
zU9CZ6r#kelB%iiP0AsTSz--ebS0Spr2E;!7=ITfr)v6VFbNALzyt6HOwv<5$lwJ8-
z&|ky-H4VuVULeX^PE+Wv0WM#*Oy}0Zj!G$c#!B1rfYep1-rM|*z2nZaHL=ijdevHQ
zH_I0@TBGMNyDc!v0w$J}lTj%<C%Du(w|^}!a!Lc@EV%miTcMGUJq7*9C>f9?y%;e!
zN={WPjti<L6fVI40r8BGn)*2Y-QB;?W*V8fLQ1-9a<7pX+u*nT<6?bF9gJ0w4KmS8
zOy(1}DBY7QJpW+B#ryM~jq8V(o!IW{of%uD9~AmRljNT$Z3qG!zL0|f7v=r){HGqv
zQ0T1dAd!;^>qTMyeq<9y)!AO&)4qBzUL<UAU{j1cT;|A+^+80Ta$SOlXG`YC()zT%
zZlfbB-@02$R*wxlx*F;=H<soSyfa_IpJ#soGBF^g_BVxw)R$v4`-t-TEk@ReP9poF
z^tSQ90w;?%z>&U<x>TOn351*6U&oAjR}FvWxp`J$R$k;(kR_~7>{J&o#J=+-A#fxw
z%#3YdPXyu7$f^x=VNP(@4CMH=`A=|9g%$Zi24^eKmWkQlck&{Qn0rIJ2*gPb3i_N^
z$ZxgsG?m#S+h)SGuyeN7=brrm8AxPP(45+)FOuo8jY8V<s9Xv&P^HDs9Z3NphvCFh
zJJ#T6jy}QFoig*Xev<BYt)O)<s#bSKtOv&wSZ3zEeyC5oE+@{bsQvf?1o0B5UUo3N
zILi^?C1`oPQgBT#QTWIA6ZA5STV-EkW7(23!fQD!Ed-q&(#A)UJQ+VTfgTbwb=H{q
zqD}9q(TIACVkg-}qqt(0;$~KaV<?0lxW^C$mmRD7i=tAtG1a0wR&Uo!!mt_=Ct60+
zuq6>#4{&t-Go(G0*E%@OHrqM2&>v?9&hzt~(nAhE-1|9jz92t1<K9*?060|#x-{GO
z&notApYTA@Ed8Hvr~Sc(TRY$XFAA5(WlRzbq5GSksd(>qvnP+>f>F{IUx#H<&MPj6
zhIh5P=ggm?kCSNzR=rKX5A%F*%^Ehe2Qk-#meHq7^ii4@H7$6pkgx#}7XISU5|8EN
zTf+V+xHBTqf{L%7Dj4ASt(9y1&@N|(J*&c@FS2fTk?NWO3fQVDmZWVjfiYG9@d^9v
zQ@<#av~ZF)U0;`iy`P7Gg^=kQ1H~eCcxlm73Wq^?<tt7z$tQ714;l4I%R_gBw<rYe
z5H2&p+|$k45<-u{MhQ>IdXIuGp?l#CSU^-HQ(duoY0hDISgwl|RglG0AK4zpuGH|>
z?FwGbvxma`7Y(&1Lk>&p<}1sRD8}{;<YX2R=n7mJ<3SW9^-VV2a86(IF60p#faX6*
zml~S_^|EP`5C5sa1x5b_OWeAd3Ak*I9jG6wK5#U?bpO!lmgstqhCb+Tcxe``D%l1<
zJKj)qMsDT7dBu;2k6{->*S+)k6+dd(q=-|#bA)=OoShncD?L)Tb6$*!=zq6fXuD^`
zsPyO)Dz~BDXk^A*ba!K9388l|yu~`ETc@*ZIY{7N7&+8a_*pb?c&@|M#4{Jfn-LHZ
zoq~YqB6cmigRZC}R-t40*Zs>-d^_e+dtMWuEaYmjz5tgl`ZaZYVn(>56gf8fU%~|0
zI#x*l0_W`x$4eX-`FDM_HYx`c-{U(qaM)-T$^m?RZ~SksqdR70IL8^2o(ta~RI5oW
zXU#%0?#(zR6!vS__+v9kB^~Mq$kv0Tn{twS<4(K5Rx^VM3VSmn2Or77BpER(dRc3u
z!S%ne*k3xq-8HB88(gpMUNZgV{o1HQ?S5xaDSq>kwql;WzSx(znUi_oZpIr0;9|a%
znq2+|gEGjM=(twNa+~)oTcA?}>P~*7yXDU(=~@Scz~$v$zS1bmMbMcJ`I=unnlmW1
zgtKNFQ>c?BUJCJsa8q+lGpRgTJ8LkvXPPY%_uwzOXW2ARghA=U`gZg(I&~_xnbp;2
zi(eiy_#3(dDNg9_63C1Eer)4vm#%&Cw@}ENsWDJ4c&l@oJRfrf>8>B*^;f7MqYw)+
z$muqjLG+E=5V(TrV_UmBL2%c05w4COzC-?bak}JIJEs@Bj{XrxP3nXD(h0wz##)3;
z5yM4-MJ{@#BBMbXX+teJ76zW+0L9+WBfig|Z<ss~VU|GMSd1-szH)_>tt-(|E4zn$
zEVCt&X0nb%FQY*RNCyTF=&&LXay>2qV}5d?5iFUeQ1ougAU(n~m8WUaS*tPb=v_|3
znI&O?Q>5>n{<e+d?N)63qeHaID8%7*Ys8~K219lLAhWh8RnEpV6ye<2unF!UM)a{g
zlcu{}^#XB<lZ+q*8wS4<J053GJwMZwCw~t~zP3V`7Z~LP3|bR&lBzq<f0aO)Q@~O6
z#Jgm7S(~Z6ZAv0MRkfpFc>Nv-GG02b%|i=Q1YKUY7$iSiLmZ&*&~!9~+_+{U&>dlB
zSZ;>2%&YF_b8Zc{8I)y<a|XFaG+p($F~g|LCwgkM&D?hg@Qxpm1u0hoT{ICYJnX?7
zT8aoDEJ<zi-CQd9uv#$JD$E+yFNiDL;fMGO(smSKF6`DSZeJK~20c#XSNe=99XhjY
zDyj0d)txyQ-?P=vgyV9|!#TFKkR&Kl{g|J533)G`Z*8tgt$KV6P}-iT7*5+!rbuOw
zVwywVmdZ?O!Qs%n&bev&V;eZU_36Rvv<7(kQ}}xO(`*iJ@O1AOWVuu_kBJbv?J{?a
z(c@QvHyOC;+Gu0`-iG-%CFk?FlLCRM+qvd+igDYqT89x{IFcUeaWl2oNHP7zYCalI
z5bn}F4<AHKQ8w>b>%6*Am=eGeioYR7@=C5KO+Z!$@f~K1{66Ba%uN+x-a^Y!af2gA
z?-U|f_unyAYV265L?{P(7L=SIqXxG~0BSJm(TQNHU$1R%1Ya5|x}uv_gTpseb<;BC
zr%OmbAiO?XIyUHW#8+w8Und4VP$fe}*J}%V$Qu)GPy2k!v0bK@bq2lH9vTjV`L$kc
z-`2_lG_^}l7g@(7a7q#HrX)M^^k)t7wigvU9Jd!=!@WAx%P>gbEi4iiR=U>}RWY<g
zEq4}n9XqomF|8VGAh%sWO`d7t%04C`qI3h*zVpK3n`N}S45@ag|5LS2fT5d66F%tn
zpIQrdm)*1YAnku~9RLy`1{{YLmjNi;S9t@!y5v-{Jhh_xj?Y(%@?uyJ-U71i4}{K5
z@_&)@42$-jZC@)6I>#37<&3-hmqB(>`T%`T&9^q`l`rE<NVlmq#I^;=HI0gbtY%df
zHlfhVgr85A_Rw!3Pzu!ECrN`?&>^>vAmlvRqN%P`b~v3(GlVQEZJg_gM6xa(+c=6i
zyf&G#bQNi;i4CPGLL?f<=U6{wcpP%8l<BE#yrQN;pPrP~#3DVkJ^B6m$0$D0Nb^?i
z`OX)6aBg)yytT@6QSj3@tI~6bt5|N^H;r>MKh~oYBkGTBJc%$3@XN1$*MJCAWzT-D
z;6>9ycMucp!XBFKdBv|}>GF2g<MCg~57;Ya?+MV}jTv2wtr;>>-9rof%mr2FN7|LX
zTUXwKPKC4kql>im0ic90FYwpf6K4?r^3VCj@qFZA@7lSP$<l9EcklFm%W1dMsQKIT
zEuLR$$$%od&~sLxIP-V^+=&fR!=aVN3^rDW0sl2(N~69o*HK^55q8;t0R{9UPCaKB
zw}GfeJZ=iRA`l%SGiRGbwJ9ewMeii)|A-hi^>^%sK{luj=M(=lsBSNY&^OBA;OooX
z@MygQ|4hPT=eh7=lf<1Yl4;_9{ZpB!M1D2+hN19QyUt4H-;Wa6AAprYv|*lBNWq1$
zm(r9;fK)V?yvq!KO7S@}*CPtbg1KzLc9q}9J_zsAcYeHKfF#H&U!%a36UB*&QaW|6
z5*Z#y!tX*`Cs`#HVSA_wpd982Hwt-CTrf!2O$Q#8>x%>kwo3A1Zhetn@?s@udQ$Th
zC4CAHKNZ~oGC3NSN$eq*9+`WF!U7pI*duRVJo?W;NeD>2zx$|)pI%jKjZs=NCG2B}
z=X_HI#}YaxA>+6>E1^)P<Y-GcUCct5GTx1_QY{I+y0qVN2vsWy)gC`91qv?h=W3MW
zgORqTmoP5dwb_cNh3N?k&C@s23KJ$t6q%C1_fhskS+K+zggm*k`8mjN3Eg8yJHQGj
z%%bUy7Kp1K^EoegiwCd&uktNUKpD8Mlg>}xe*!6!$lGZbQ*`agEspqmITwDLxNoD_
z1$Z6V-_N4es6sT5(sQ8=u;I1BW14T!Bs6+IDcd2&2~)KImg)(58d9LL=^ejs<4){5
zRt9d;xkBKHgg7Cv6DBZc&`vqcZ}a^4Iw49xcj3aN2GvPgJ6p1Z{NipZ+{-IJuPJBh
z2Ce)0CaIEgKE!912yfz4SHxzF91d5f67P-iiHowf+}ytZ?ms$U!M|^4L(yb-u^+|C
zA{j+d&1c#=_ACdpnEh8iyL!CxutO!)(EX&Qh-1gb{bcWB1@pdhdBl2TN7vD#!8akL
zm3j|Id}mHL>54dsP_6zmlzfK>UJpBM5^DqFN4+ytc2~PRW!<vE&lRUOM$d*u6b?xb
z7dAAL>hqTmIUBa!$0(d^g?iUEJl$&#<MM=!PMs>iTGmEi)o%1*x=!w5xWmHvN1NPS
zrp_nMLIwU;v9~=|ZUK$G3$oKm>}PV9UOdeU^}46iF@vRV5aK?#OTTZkX7DN~)FLP(
z0rwcySaYTrUs?`A|LC#2I#QZ3nQHGiHP1Ukf;vw9+Ru*5DI_#4g*Jn-8tT=|)*4#s
z8CTHL+7(pdR51mZR|CD<lLQCL^I5r|A*e=~cOc<<63Yyt^3FnhCG213BOqaXeL)?V
z+4GxsYG1PPST2)_zt@QqrXJZ@@;3aMoOrUpCAz`H!f)RH2vX`s$i-$l&mJYyFnX#^
z3b>nL==QjP>*<;H2fI@&6$xQ_NR*Bn*vLLBKOKq6CDkWW|FFs$wiuMHi2s2FcwrD-
zs5{QkX9?noJ8Cm71IrYXpC*DSw-)$kuFi?JZeZMH@(-i3(^72xFcz4Wibs`?lLY(F
z?lVvR6~T*1h6lelXjLoM23d}aI}mrnz5XcG@f=tNwJUBI1>>VnhV3h|Yv?<6-a`&u
z?FT!dr2*|Qd&{VZ5%aX7Xl2#SOWTc}LyJF)&2E98$b~tfGyp+RtldEyxOgkOfL}wA
z1Z@WwXA2$0IaCrJQ=#pRQgLdrhDC1Cka%Dla=T=8CtKyW*lRV?vkwp!go$(oH5|pV
zhVF^W;0CN*^s#`I>yss&jW6JjGvUX}ewNyhz4+IpB=kS*2XUP#Xu2`$8X^5(<sQA-
zqfmxm4fW`)UD^Bna?)|~Wb4bTW1HM!^V+SL!96|C2pRIkQDard1=3{fN2+dRy7t|k
zJbvn#mw7PaExLS|`h>@JY*TnC(zpHq-}6Y_RJ|NhU!44amW}i+9yBtvjzlERu=F!m
zA=vI9a+1$31o7{oE%@dAzmB=|yh>5({gZ%jc)lxUrYP*E=kM}s_hR9!nsdF#m=kMW
zlWgI_h1&}Tvggb`wp$tHHQh7ZKz$Kdy?<f)=c`UX=T9BTPl0V;G*gvsoAf`QHJ{5<
zdhzqsHx0$ENaapEIdkjs4sW8M6wzQqp)1lw;dfCJ852@HFWdm@SVUXYHrj^$-~ITz
zo(1eQ-s|yPbm`^V`kTa<H(&Qh`B)Zz&0<TJ2`fitg4~!Hi{3r6H{o7$8_#mXTt3Np
zP6`2?m0AALD9rUBBSp8#ONVIp6Z0`8L2knhC=pTsK|~h6aJ#K-x6VUwoD;FDaL2Pg
z_Pu-?{A{f*F5GLG{vs_t<m~;h?8w?dmhvTs58EX?zFCoe+jJjx-R)v!lM>^@Woq<u
z+_`v;ZGORJsT#Gr^j^Yuu<4;Y0eul%9L2R7HNk|IL~$pTRFvkVRRKimU)7R0oXuJM
z3BpoV@nk#95X3{(2*~f_t?2^D=w|Lwl~5}ybumBC>57Ta?1BMb)h<c1soa5Z_EIPw
zwU=~I%>MDcg!f+QNRH-B#ph|A5Q64Sn@z$Oh(N$g<^66g=fg#2**Giv1!nH!@uxG$
z+*N=Zd@<6}Gg$LbZbXD$fd1_R?s9hhKX}Yxjatd<JQBcj@s!NARIa$3bpRj6)y2!0
zK(|+%yv4mG2;b^nH?Oz7j<x%#UPtTXXB1W>I}TcxO6Z=+B)l!v-g>us)|Ss$*gto)
ziyg$*16^p^=tDKIw{4dID5l_m#Y6(fnAm)<(3_m_o{uN`MIxMjD>&Bq=eax1SGxM=
z?4O%g)*W0^o966-`oKMoBA)uxQFB}OZR9PRzSJ#$;j5*~BorLdOhjKqe@$a6rR0l`
zcm`NI4TP>YKw_m8K5tK=zEa$<%Ov8u-OJ`DFE>#3z4RYaYtOuiEvbFE<t=;00Nky;
zJ`cO<gWoJ{ZrCmIeFVH#6|Dp20*;^N9KED(`OK!nCkMXX6a(UnoN{U{Ttov(yZ?Wl
z+FY0Uw`_NH8CKNd68MVAGE{$Uw6P_F@o<?9fPZ{BdUwdWR8qdpT*Zj6_zMGL<@sT?
zC4iS#Jrv}eqX0BNfM&5EW@4W1^+`8H-FThwmWAm+Zjq1Q?xw{QEm~T2FX<JFd>ISI
zg11<iN<6aSZ71B%G3`s1mu2YBprDb2mwqX#QyQpd5Ik2ys1b`4t}In5;-q*0Q<lF#
zmy3Z<+!Z_f0%`N4Y~uYbIUX~`{`be@tRWg6lbMHQrXq<V{<{%_X^lOFE!N$&WyiW=
z-c8FcZC`ewu~g3p*S1A&&W`Jrq{Sg8@_D`DR><jq_8O6%w}0ST82dQg)*t?Gi@Bb?
zS*R^pf|<X%uw`GHpZsjk#?d8XOQAz`QOeHY*A|!m#D;<-q`3_rA!Bz_V8h(af`R8<
ze)v}J|H1?#%jH~e+ygWwRrgH1EG&BeGD<&4>2hp|Yqz@7|F-((2djW3jb-ai?z?Zy
zn`xN@i=*lYUu}OP)~bihiOX_b6|9!R#ZjUPr*MS%V|EY?iaS1Lm%;1_`(tMOF5_uh
zg4FSkLc%2?VYjr_CQ(8qB03(iCi8f0T<XYp)8P5i0vI@F{YPI!sS_dCem$GXZ0)r!
zX=uhQDg?mGx6AgFUM!B$z1bQheZRyBJMtQH5pnj-aKRAT5ggxmrp@yc=HZqlwz^m|
zFh`|+x7eO@F3uhg^E_*`EZiD&X+?B{;50Jyt@1UuGmo3eIqJA!F4r&K<r|^*r(_*O
zH#TF0Lzo#`h~FF>QG&IC(;CO~-yFO;At}y~t&HQ@(NwH*l1$@{%TSqg<IeWd8tZdj
zhF82bkLjXuhjJF*A4atOX?yX?QuYl~`)J3b)@iVd&OL-cUaVkco-D$)Go)n@@L^vQ
zqjTQR7~C1R?RetoBJ7VHo<X0<X{^&AT<Mu_{Pn!jvf7MSmwB;vYi(GF^LNnewc+-C
z<^-00G~Oy4QI`8?%dYhpo#OWg#<qfH)R7)O%4w~%d&CRJsGTlRq>Vtv|7}FP3h`RV
zWn41bzOaxZ)>8mp1x9Qc!&SV0Q6@*p)-v*eCM$jx*)thR?B>SdkRj-w_;I_6fhW8B
z5j6Gq+D98)pX4ePaBN@Y(+8f6WG*lO34?i7@}M!Td5eVmMuOjfblWiw3B{^WHC*4C
zy<t>9gG<jwY2hJM$2qVf>3)aw7Q8YkBf&a41&&`EvQ^X#SZTbWRrn7!4NThpV<rNp
zDr1{rdB6s}bnTz2hq0tjt{~yD??rHFP;Q8iP6zTyVfFrx(F@NNQf)WhT10dEV=_Bq
zTZa5^vA|4wh)+agTad7*8GR!9Mp3RKQmam_`17JxYp^8o;XA&Lz6Mn>7I~sjB3U!a
zJ-H!p4C4BgvtIZ2$qzA9W7gl%fDIHgIR**$l5Zy*o4aY!J()})fE}johIhT&{6Iw1
z$QUHv`?hUedd}9`>U82WV}k#xTpfoHTt<g`<8tFRQ+U$8PqO$_7ik%*!%jaX2FH&U
zmwsPA#(&+WYEW%<U0!ZN$}Nju$Y@c=+566I*vi;<(=kqV8f?sprYfEO7F$C2FPSBO
z^<Bz^um2syXA!jLr!Sm{B$C*DJMH!(ZiAuPK`)J$W)H6|PBtH+XWzqbMd185E@BKC
zAn`|=-Vn_l;Vm4<-96I)&?3%Cbq2qzKW(1|S;v3;8uIFzI0KL6;jLnCmV6(F701(W
zlzn6v-UX=c>gK<X+#Dr*<+tZXo_%}=+!rOwf`aFrt$Q8)TKC-S>G<0Q<edz9_m|K0
zWqYA;%IG`XkhUz$)N*g0<Cx}9VGr-=LVWuvaq%$ewlLJd?Bjfj2GMJYAk2IW=Gur$
zgG_KqUvddA#bE*|qv0pL&Xov5^6VqWZOy}Xa@rW@ZOv1ZD}&%nr>z?{&X-4Z_f0v^
zIeVv`m+p%V@}%1YxMlgn<x1q%gI_GknP<z%1KP63G;LI>(c)T|F0etsz=vI%()fVc
ziK@2E?c6YCSGU*fg8f&Cn!rbFJ};!67uTQBbUt8Lv=ZXIlWAXDI2PLw0>I6Jr7Lk|
zly<RN?~}G#%-_LdSfGsR#mI-x#7~Ehd9+fgO;u#+fLA;U9)&M`^8!jj%96JWNOg};
zuKhbHRUu^p+v8^<Uc45${0C@$76N;1m<I=wMQXt<(`rkG%~;LG=7mGAIf2(;sN;i0
zp^o6z%r05OWwdMbpgFzR3n`>!qnKHe>G{P5VByjzPcWB>L!%BnCb##SPLtz`{|g<s
zzpMSS*VnJkJ84oOMz*_YPyWDnowg&s4O*I-kW3)^HD8d_cLsr4aQwnd__Ul9$a)l|
z3r&knIQ~yz9@+ZfKez6ufv)C`++_4gS3syl0>X>KZE6pxAbND|n;q`%7wp!9=~>vN
zgdM$(IQQT3HlcmjfCGGDL21)ziQGnNjJm(-&#EyBe)n#WH?J0_8&47hYA!*%j+?9f
z<_Ih|iz`7^teA9QFgCpOkSVfU%FFpD{4`#N6P^20yZ$uhSNIvu>x0}hT_UY-&9Oh=
zUJLBAu)hgVeX^ij3r#K|&}G0NH%*Ld1~NLr&Z^McEoyxgsyfJ7aQ!sN&8@Dl#~6_L
z$z2$xIek7tZ&|cjzG&fFE0Yd2wp4KGMFV<N345bzAit8PCy3ylMhrpS1+`Ak-4%q+
zj_!*%q=-?GInFWHI%66^U-txi2unRa0^^F+{TeFKdS0L8*bpLXyBZmin{ez0S}~*D
zQc7VA3p~jvsVN{Y0{i?E*f=Ruq|S6e(J21pWRiA}B=j1K3zZ4X*K=a@JbS;-MKw<7
z8~sq2I1mHNR}*T+nZzu+D_V5HX!h}z+=?hj(2v_>;y)bsuWwT_J;BU2LpYT+Y_<Ht
zJ(-mP;)AMKzJ8bBq>^5)vpg&4wneZ6ti;StudnY+wbMmls`2{bvyjvHb!bFbneH%g
zo$ir=hwr`Tdbkw<iQPVDnS9Q}w_G6Yk#UU*i=+jrsi@@al{n)uB!Cf(ioewJ@=s2;
zvi!B<@t`QvsG2KBZ7YV-OEB5B39~*NtpumW;9D+tf|ejT)AOEzP!^E@FOlJ2C63B^
z;WSun<KPds`}(Ub!ABr`{XNe0zVU<1$!{9J4NMO##2@H}^_D$XsuCo@kCcpj``}0E
z&T1pz5WJbj?%tE69_MSCcb&cYnR?&SV?<zoZa(8=pH|*IHUaU0o1!8m$W-4EjB0XC
zG}gS6v$>gb8_IKHA#Qda-lkG$DA!BE$Fs?>jOYph&=~HBXhNB}y-rv}^mF4wa6lS0
zC4va<Ktw@ooA>d0{uxGbk=R*+>J-Y;FbF@>6`TwJ#gys{PAuvm0Z#UZn3$u|7uc>w
z<P+>jg$^OLZ0EQZa~&|}zPZI)^_XRtV;8bEaA8gG6_COeUF7w)q7nC#2Lc@t-?LFG
z;SViM$q!tD9^1`AEmxT${Jn&_8}m_r0;HQ6Lu-?Mho+$J=q9)>zra(o%E`?Hn;6sB
zY1R&1qhO;yAo$+Fizwxbn(2y=f!u-o3&OXe8}zwD9&Dj!_kEMb>YopaeRGV4^)Tw%
z_KDrq#7PJAu{!mc9f(tZWZm*&j7H`sQS$korbS3C5!m|%Tp7#{l(-xtteKr}+h5S_
zo#&<6@xZ2zc)!%?m*t3v)%F-KcYa5GS<0SC;_MA*J-8i)dkmA&Hn0Gz5bhAf)TAc}
zci7^sEOS>2Vitduh4k{LC%t2M{ln42DyV@lSMxHmUP`ClcPrg`%KlLZ=Yc3{qpSvj
zZ>eO%jKI$il2hD6!#1!V0FMyh#5F(>FYA#bD#WFJoqyUz&!45D_&k>2Q%V7&@;I&z
zOC{~B@ZHMUxxa999yVmZ(&y0yTU0P=l&tysap@b6%$|ktv|SUKw;WVT&2DH$C2oiJ
zt1tB-B!aPlqliXt`dV;cO$FH85ep7%s-_cZ5_=-Yzl&25`S{Gw^eiIQF+y1}zwu*x
z1Ls<@;gZr=%3JPWJUgwlEY3YZX+7PBC~Br%e80UOMoJ@fiS_^Z_r6;tZ@I~7N|qV!
zQrpCq2!oEJ@t#Vq5dS_KDYDMdctU7#n>DmgyJSD}4xr|4HOT+Nn@B5Je7yRp-y@+z
zv-JC}2Jn=jzGTbnL&1#5k6hD;p76xj0xs-G&9F27u}xVD>p-u{7FZ*UcTEWYmS+!g
z2WZEHXyV^W$gN*$;1mOCI5J#VOHQ4>XYp%IRLt9EL65oy*zIQlav9)qG5MY5cN+g{
z`GEDoGj5)8D?QOt`$K-Ih=>IvLnO6+<xl_=6@jUEVp;vfeu@XA6lNq>Q3aHQV4=P*
zf%Ya-q!%lmTEoNMi9Guj0wEgy0q1n!?2Ig!bi1jWW+(cYDhJ*}`g`Ly&GODQPIe9F
zj$N>{ibo~Bf*9E%wC1=ZyO+-bvxNnu;qH?Hnvh4yg-x`Jo_NU2E0G5=n|e>THHsxb
z@bk^_=`i89EsTP_+6~YAge6<WmgDX;lD9R8((@e3jThu9YWg2tYe^LBf3Fs)l)QY&
zn;4wlz&A^W43X0#UMYT>#k9P4uvBv41%7+bdj7?B+2p^K!OFJ3%l7b>t|f7@)Az|;
z=cN5KJEmh$UcrYduD#DdY|g@S(43!czhYy`6LhX(xO=tpd^zVbjojC)X>}R4<m&uC
zuM7z_mCVxw)2K6|JS~Gt8dlr1ZH>c;MnS8-I&#<kpzypdqdhLNQmF~ZmUUcCyKc+}
zjFFZm<l%2&gDl%|D2uyYKFSi@JA%Dr2Z+%()JP{V#U3MY5X){-wGuE%cc-gu#<~Vo
zlF^S5C5GYR0S|heONWI2)(fmnh>tkWfaI?Xsl1*7UDP<V*v|H}%t!c*WFk-=w?_|z
zk_eZ+hxI|Xw9YI>ZIbb%teNKHjD?`vyJO_plhy1Qj(O3_YU%)4K18c9Ej7EfvfdK5
zO!%=xSqn!m4WQPMPXZsp(pC7$@!_Rb+(fe>)1)`eKdqb``}27@s-#&W^%Pc&9iwEr
z=}MySE(mz8^ou&5vk|Kui9ubQ7d3!hC1eLR&mC2_8!*(4L~9d=_!BGj5xL9$Lhw5o
zi1d3It9V2mV1~wX+OsENB!&IcMg}()e=HH+)+>@$XyKF@tG(Rfg_w%m;w|VW(!B6&
zr9m((kp3=Hr2LxkuO{i!(@d@CsLrA1BFid*t9MyC5se=j9+Fx5&QPF|6dsuzUxtqn
z>lDQmj?ml76;TH&K<hp~pEfz)UfKku&(8-&(lgb}CSMp%@M^9tC-V(~Ylp(kMp0mL
zbeP@}dZbBfd4^*)*<9mrK1}9Vi|(kRAcA}!75PueJ8&ugNb7Bjhytqj#%a^&gKyE9
zggnRR+!^xTEFErsoD0s)ZyK~c>!K8NsVf{wyyynszV9B*R^LD$ed&9kV;Kf=y%ON!
z?Zt1g3DXO0&>{r7rP@S?=xGco`$)681fEDocnA~mDv+8Cw@d<qhJP<U9x6A4=z%)#
z9c?q|UfH&4IcaH7{j_v-%cyX=@F8p&Vtn#!2oZIX(IWCa_W8exKs^0cVyV^HZ7P4#
z-~HrZgYN|%%IP$A!4SK^Hw2Lt3c(+u8a~Dz5!dW||CfCteyvF!&<WUnr)cL}s36Wt
z#a(>IyVf9Yz`i$LrMEO##OLqLZc*D`Xr@G*v{)KU`J5kV>W~(0Dr&?CJp}_HP5O=F
zjo@>0dOMoJ2gL0OzoGfnRBZXd6glX!-A*SPc7|{PUzfk5`8Sm`VBd#-6oOAZoEl%N
zE~G%3DZ;#RW1LI^ObQ$f>6{tcWKQt(vJq86^?3I)zgi5`4!$xB_J1+|9%Xy{uJEK+
z{2cW3-}cKF!7*}{jyF>1&cT`bNP3@kVf)XZmkj!_-Di8_SHjLHU(9|{$`-DrznX_g
zI>2>VuMP=gb|0QvWqs*99b6U>d(ofeLl=J}GOVXs2&SMtRyObGi(Do?8OaS%z}@~|
zwHc@~J<Jg5g)b^uSRaQ!aqjUvhq2K3&+;~;yJBjApNSyYSTn%!w_k8SXltbNG>#t9
zeK6i}a8USv>s@z^n1J;z)l#HXKz0M@wjzCYTL+w++Cpj`g*2en4Nj9<NU!#p`%W}}
zky-K?m!xL*kK~nA&O)@7zp#1GZJLk`<z#{(TAwepsWtvFUIq4uvD&jDjFWN7uljV(
zLJ-Z@$s2kKU8mtEEziPm`z(bG^)d;2q6-FN%38d=q3M;oL|V2`f}8H9+=B)Cn|Kgk
zZzy+#vexK;QZyhcUH}Ij#XcfK&4VTtLIM~=*Le~Mb*(LT?c+17#CeAoaylA+(9nDA
zmXAT5#?Li*|B|j!tt9N4E*Xm9E<w5<obSz*^RHDAObE!)f)M?U-6sYlWA<$PYrj;M
zVo<5wbFs+!{vqgU%z@@p5FbK6bbW*^m&3_uZ(D(F>R}V1tXC`_*i}aqbYRb6s^%Og
ztJOlU!bt8)ePW?rv6gq2`uYv+5$aGmAw}K0iNcD4R)QVJ;y{0&9<>wVA84p{F;bq@
z{(ID=nq!{&WZ`fLF41b1+X3c3F5-5zlaZnehx(9sy)%Nk82Y|OZcLyjG@Q%HqQ;Yr
zu`pPwVVkG6?r#HP6J2aK)n+_1%9&{4U0WBIagu5`#kz^Ua~gMrjLu$JM4m?NjlZ_E
z|B+Fc4m0C~*gk0#L{ok!spmF<YLnPHeEX`l(NYP1BSyT3Y|h9X@s4$E(!FUrL)#u0
zHyk#iT_lpzP>Y2p!D2LPdz~W{5_F=QK=4-zzlvrZOVko9qt$o^Z3lCnu@4L!^EX}y
zm9hT9misFt)p7FAEHvlWtG%3e=9);Fc>c{mEd!g+Pxj?wBOiq&ZOb1&)n%>E{p)a*
z?9$iCSfBg5^=YIQa9`E76q|TG_Ks@zo1pqrMj1=0Z5d5uK6)q70Rhzh!VXC4VRGng
z%!mJ<9ryi$an}iu9moCreo?Qs!`!8BO%)2n^9+g?ALBXvmeGHZHyQNDN01-E@vKq5
zd|>)k$vRkH!Bcj`IJZ&Xp>ruAx=^tUGqT#EP_+^b^CGTTZ?h*}Njnt8Kn|Pu`1tSS
zRn1ugcFsav>BZ2?LwRCrG_$1}mos|c;Ze!v_zc)GdYgAUDmh@QjTv18&Y@J8=2>kF
zwv5Msp*5T)0Q{vh^;3eB&(2D!gjn@TK$#%RoQ+(f*amDsjxdVl@3DWhB<W8#_OF`D
zkv%0i7lH-;S5^#C2iWTuZN%aa8sh{*%60_03DPV2HAEXJ>!IWrZDLZmKhY-Q;)<4}
z;O2B(J1D8k`j^mVWMOM8%CASjC>9ivAr=}#(RG>CWkh^p(YeAFBBT6QpYrOVm3>o7
zSYI%-7Whb)j2!I-pn9egfCTHMt>{Gn#2FA&JPT+BuZ`2f)jSljJeO}i^mB-@&G|s{
z{64`)WC>p{r^y6pHJiB2^8`Rv0$=AeY-6}ae{S?PqPr@mZf(pFs;o+b9diypT4WId
zUj-;z#aem2G(yegiqwF%N@vshuS4_@%rY~~V2uzVsgRgVf@*{Rwx&0WS%O%3z`DW;
zftc>XT}U0DpZVdLtU&FCdkqUOc+FL)oU`55Sc}MA(fNUfUsL!^`bPUUvh*EeH=hxZ
ze6sQ#BY27@Fh3WXWUuOXge2MLE6wtjc;q{q$dlFAVDCc*NtdWet-84EJ=W(tGvQ%s
zry@T40qfy9+$VE9)N$|fB#+Xc5Z<0@U}wKTtc6yA6F9=5m-?(jrH|(I43X{a4ONJ>
zBiuv_r}INdAG9&<vT0c!LOlFazL@Fsv*}<?(WcISuLMNu0Y4I6GnCm!FT__Ub)^6z
ztmU*oflN1mb8PJ~r=xtlNq^;S0&}1fqTiAGUYXdw&uVOfoMCqWWrqFds^Q;QX~J3e
zJAw8?EVj0&V}wmD%_+^UYgXqekbDJH_h$@lp`5-GHcn9HbK_hVr7reF)di}rZ!$4x
z`|d7OyVht+i$6a$3L(8?v!#`(rBQ?93+Bz(M;oyVTdiB>MOHUl3;#wjjwTB>oGCsK
zB?qlHot|J@4mw=0HKc(Bi$3~g>c#CEE-HG_?xils7fp7-eyt(powGc2!~WM;H30Q-
z6Y(Y!i9VL{hYzW9Vm~GA>h;&e9xtOC6)J!lc&Rg-Pfi7YK1rh9)pKjw<O*32LmC|@
z^qSu5D-7{cYNay+<KPeE2m1q3z7v*u@2vio@C}bxs3=SEWj+wiQHy0<e);4LX0yG4
zYhT`=<TqCH-1_GMXsp$jh=8iRhO-ts24DYIIjPii%QWt`{vQ|Qi>NZ-?_i)?GZ}kV
z4|>Y`N%HFE{vN4b$-TdX0t=#_hJV4}8dU!(J*V_J$Nr|z|CACtIh%`P|MJIuG_BGQ
zUS?RP@=r!0-kQgsB_ZQ7N_KZ0#A|!FjT-YSppIK6rm?B6udBVb3BL(#tjjm1s~mw-
z_hphrs7cvmG*L8iRmlqV8tP>~h!1-(bY|8@!0q?fp<*Nfcr5eYgag~<AxI{{d-roi
zeSx3$vo+l!g|~(-$0kshKC|M+q^mU38f?KZ*yufiq}0gX13gzi5+^Kz5RzT95eUXl
ztj}PE!adhsM@--ime|FW14W*Yp)&mS$y*rZL`tqaqEaTBmKk4=LOXsOoZPu)@=C=4
zI4HoOA(g7~ks>TJf1_BLkd?*0g!ZxivTtee_s(S>^*Kw6?=1Ci87HWB0DUXKHvBjL
zVlw`x8+=sG;hI|eQYFK)Ks}r_dD&Ls{}J`y@oYWrA2;4s(Nfe~sjaGLYi}`&qOH|M
z%%pZJReOYp+FHA62St_E2qm^CDt3$__9kk@7Gm6|pYQK?-+!IgBj<RWlRS<yuIqI@
zUw_h6?l*PMaEvZW8D-t1U=rIA_OH_0$qKOE=?_28ZJLtdwEn`n6(iK}4OLUB3A45P
zWi(w?(E9B{gu3DBcuad9FH8fX44>RHWsM7J7?Fzmd!pk&)J<)_wg=0c>0sctg3(Ua
zzk*Es8jza?0r9bEU&3~|w}iX2X)c|ElZe_`nie3rxR$)7kL`8tPIbXd)M+nRI$#Wr
zCc`zcAC87^RQkqtdg=F|g*NTLD(=7pKh$8d6Yu4zL67>iR^k3oDQf9&&{a}sqvCC=
z=7``P=BqpLRHPq?T&%PzsSlc}a?}@_PgfQDzH0{FjVJiIHYwpf?o0o*NG)Pm#w;KQ
zN@ull(0RGWfxGm=$zd%L*C@p&Eg$UNa1y{*==}N1swOVD=O_8Ow|EtED{#y2<QxBR
z04=`wQHA#tRhRfJ6hpRF+U<K}bH_Fb|I20*2%)AZO9lVS35RRNWM1FPoq(hD^tZpE
zu6pGqrkf1Q9?_k(;O_Lb3yJjDkwYgl4`=<X$)YWceJ@7pXe+ZK*nA{uK?~luZM9FT
zNN;cktf;=jtQF6Ww{rBIoJV}KjpeXf1?O?iW^GJqqMgX;nVcfE>FR;$>@BSrx%mL)
z9wtG5XtCR`zo~q=)pT1x+_)N}?DNGkZroz?+aMuQD*lp`kZ_()?^iZNi4=&Vu^S|M
zQRpVZnTkr*)8ha%b(Q8l+IhwL<1R)U;?Tc)6<fub4ogV+@b2CI*Ab*sf)a<~a>;G6
zPeMdww6Kf4*r2|&t1Pr33G=9l)n@t$^dx?63#~e&zI@RxK&+x{crTsyks_j*VDbmX
z`(OzxpjdQ?sOZ5aK~H2~e-Dn|$LzhqOO4`D49Bv-MtRll%c23}#|s8~5rEqRn5hM>
zy5oi`#Iu`RckU?b)44me|7gj-9p<P&Fl|TU>P(Ja2%H`+nJvHti~YC8V{ow0P#i~X
z;X<51vv$mpc{`u(Z0<+leqVr0vvyn8TVK}{n3{tKoE9Yy_*ObHEg9r(i7&!CR-EVL
z@Iwf*LLP=bDKq5`*fzHh#`ekKFw}{*w(zC$FPO-&8iHFlT(?@}FwBdjD6LZ0!7gea
zXarH78_>qRN+8hj-dPiT&Ar~4^(PV`rfR_z^U1N>m)Cu0Ma3c=mooWSpcU*cJfgMv
zHDQhjh}yotD{Z*9x3J2e&slm1x$nRS$S3xu*N(=!rj4Xp-68ip)U#zo30FQGne(?k
zU(o<oMxVm|YK+^NhVNwRK<Ycou4PS~ezHCS9!Wvhfmo`>Ppm(Df!b<&Db=$o4*!cX
zvcK8CxolOemWp%=EqQio$-f!WM)>z>G0Jrny?vgE+!%KJ=DVkSsX%Lz<qtXrsXObr
z{)_Y!*Z>u~(Gw>nH{SKva`rAGh^OsreABE{xj;bEuJ%XLISPMx8LLCaP`_n3s0TM&
zlrq1KF`qJh0w|vH&#OqWX?HQ}d-S`>A<&GK9iEi0rT)W94J+lPRXe#s+oD@t9FUhK
z!W<Q96|1xy6?E9D$i8B~Pf~i5(B)lJmR*mHgSH*R-4k;{{>reaKn^{kBv;rb<^|Z=
z?-Ihf*loIqTD5ujZpKWIDn|j5_QYI6&0*Q++Wh%zp2LtCDV*ZA@+^=Up`w>PG@NLO
z^#9&HB6>P=6($}y4dug^iqUFbkF<LH>OMeB+R&LY0n4_jH*u!3YkrFZ+5W{k8oly7
zxu8RPsgUq(g?zDw^p%sx?<wC;hqy_f=Th^uzdob6{jrQuw(uRV$ULdTwi`y=5eS|y
zkc`4-cAM7U4QhKN%PO0au^Znkg&YyMjH^R1k<$x^K-P_~bXqgG%1KAI-SLla9NFAD
z2&)h)h&`J|qqo+hhl-9=2~j~wn|=GIPFlpSbK*GjG)k{-*eHYk_#rryr<>d~8li6>
z?7^#A`1ie^bHCQufTxYL%I8M_X|jTUG@WrMqUXd`sb@)NC+;cVj<vW?r+Tte&r<w&
zz?qv?nMe2+2$wOB#_Av;i!TIlx%E#jmJuTYB-@&wt1s*Gr15B^XRs@;Yc!g06O*Ct
zb}pX}>bw-$TES7#w6WU$Q%c<b=zIT%Q@VWP4^Y@E8H{X9DwUy3fIoX)xxO7mG@T^*
z^lE%me(&&24W$}^aLx;iaQOBl19I)0F%m7<dfVAA!N=8o#3>sVtq?ZM*-4OhH%I{r
zKv)3dZI)LfRG@PJTk6EabEC4>uR}8iV}$EvjBZ#oZrh<b=sB&*pp;}nv6lR9-2i_R
z(SGGdnSs(Gv$a(OFi7ag*6_5QxG^vf1FfNyu-a_g>x6@Tqv$Jwx1*KcvxsDaG8e!N
zUSF$P{yqR4r}57-Ks@Z6cRHG?dQps=r`EiNkbQqhyMkpmJ+VP2G;n8LRd^38p!wm-
zLZIwOBiX#S^0S(7)E}vl`xH$59>@$8>tL?57Df6$<y6AyC`Q3J6IIiZ7c-Hs+Gdx3
zA)O1L58{rXNz+v53X-GfG%3Ufy~oR5Kol7vno$=2Uw^-M$z#BQwPE{8fRo?n<^#ov
z>qWckC*~^cix9CP7wvcNIQ=nSp!6G0KV@W07L`QE_=`?XHcT7f<qc9YsA7fBeSb_5
z`7{9jdKX#O1+owpIMkpL<I$PAfjJrGxO|LhOisannLpu8ia>eNBr(Y=g#fttLsqXl
zoSBr{j;6Y~3HoL-Se6}_3uou&zf->l3svp1W<<1%0+ev2aw~*z>Aj(XywdQ^9uYR)
zqbq88%JRN;mdK5mTJhDpV>YGyO(r~oA|4yPdhiYrkARGn`~;-4J@2)8t2W;%$(>gZ
znoJt*a`erxzJ=V_feHKY+K4w4w)zGGa6@l<Z)c}Pc&v2&e=%)G+22$aAKDHarQ}Ox
zMLROMEm=eh1G^`0gl@lWJ>n+PFO2CtX77^#UU~kFrv8!$W1}UXx68jNX}zoOz!!NV
z)clvDqgj-nGu`IEJc<R5X=xHT!LSjz9l9?c7EUI>P#&pbERzDHj_Z5Qp74$;d~$-R
z_ETVXtJ||Uw`C@8zIml?4*iznCEwUw?8Z9C&Kf<kV~Wnw61P~BTZr#Y-1zMGb`7*j
z3Yh0QlMQW3t}|Y!pPc6Qs#KhrA-Sh{B)G4bbk$obk07xt&vr6zonVf*{U`T!gZ#w&
z8}1{}DI)?xezfq~%EW=l<vblXPso-b>FG!mxBGpT#*hZoY~F*SHSVqr-icH#(8jaQ
z9M1|qRflDxyQ)h2=ALO*YCDUdt0yUcpcX&kRE`Q-_N@#wOFR}k(RA%r8q1wiNPNH-
zhr*r!*H$HeXOGPgUEZC{M)^#Nt0THm@&BKOP1pP{5#v6?`ghOFv66zjF+ctT0<&T<
zMh*IrVDSKuZS{pgEtAHt61tFYV6^;Ncg)mWoSzx#?)i9bExMsWE>3>uKZuB`+VMN>
z*PHcR<vYXBO5F~D;0+17zx;i0ufAvMX!0gdeg!ukXB}Kw!xoJGRvxG|C`O@>>=c&K
zy(U6*96M~V)){g58#bX6omAt$#QlY{g8w?YaX`P<U|btl8-r-A{^ULI$>Dw^LH_vf
zjeXF(1&5`=6?EpVQg&5-Lzf(ycP_hOlz2_Q4%oS7+|r`lLHw{SjgM#N)P2LatMiy<
zo~bW7d44^1>np*&&izKh_emX-0|vNawjK0Rz!hD6)SAO&#DfMlK*8LR(`VP4Y?5T%
zN;{AKGO~yhIqjE|hzsN>FylPt2SE%y`5g>jOj<kh#R8U8nYtjrWxn!6>`kWkdE4f~
zf67iz`)aA5if(I2svz5y9KJ0b@csF3p5Fznua{RH6BL1x6tfL`b9Iwovfb(Bk?et3
z@|69FALup1Z?kT9GT_t~2?suyD+2<Rf$7`gJMsC?YU>IUC>W{rkNTXAmaI(h5yizH
z1qrAA?({!uL?)j}r0j~j{USM9jdr}9G1WnSh_GByhcqY%Z+?6cIDj@_KVMZfpH$}F
z?<9jsZVB5=+wuOSa_vao=1tXL<i=wo;f#uL1|!-XSR$y%Dl2y2FbqiZB(CpxCNCEQ
z|FxX7v75O#X%A197)ITj^Zde`adYx<dCz?KYT7w}fd95CdNCft^a{nlGPP!mRsY*(
zqrXulu!EdocSA$VL|jbusEOQQ^}JY>zCiR8XFs}EHn@6J?f<)#XxFTt-L%Lr^;R-n
zT6cjyLO)kdjE`u$%eRA>Ib-kIgh(q=oPpbdVq(g*uCQS<*biHzNeu{JtR%FeCA6?j
zA1K{b@SavjQBLG2{$}*6-Y#3anU9q5{~AUzD}r!`5H*02y@_IYdlh|K(*Ke|mc+x<
zOogmd2$lo3o>ai@vrOq1$>zv}fP$Ie4%Zspqn;fm?G}5@QSN3JCU%aYH#|j{jvjg)
zetW@^#8m6HY<^h&&W|sq=Qpy1Jxcn)rvxG?>7oO!N}1z<+G5(aC4X}VT;%wbe6e(G
z!cw?OP?5f2L{?(JFq$C^#n_n8wYbNhSRRf_w0rC6y-%wnLhOiWcy$fbZnNH``nmnw
zMbGyxKc6%S9bi>q@t8?4+#R3PDbm-S$)e%XReI~H&2^f9$F>H003W5bw7(>c5qXP+
zahUN6;{0N0y=@t>py8Ela|CG!#uB}JdU-*VOUJ@R%24Vy)7bXALj4t!tva*2{>@;u
z9E;{Phjp_X?$!aH+AXIa*!I~_6Zq{I6i+c**D1Y4QAqYMj|j+`f|2O4^=QiXE%zQR
zh~>CTi@Jo*Jxk8LaXX0}_j$-d?M-;?LgR8`3dNvIPGfoLlAkk`(KK#S=}W<{MB2S^
zT(z2^x-`PzQVLs-miKYO9Bkf#Z;tolpnSAhA0~X;?{BS;j$rkzcYYhO+r>mBIzJV$
z-K0FqV{%oV9oF4b9m4{JOEMj49=_;CED80bbKyjp%v#9l5!a%h^Sa-Gcl`2Ajo|Kw
zaY+~Y@e>BzN*S$9TGfI4_*f6GHy*}Yx3%-%4ZD?!JC~09e`cZ}E_t8}(Z|=%JexL8
zeMQj8ZUb9B!cW#(K{{haNF7=_3J$*aU{mz!N~wK1YPBtKI$QCuo~<V`>gG0T0*Tpw
z0v5k{52k*0#Ndf?PU~tvy&+UgX~0`NH!=Us9j3ImOB?#$VI|SC{4NeZQ`Tu^#x$Db
zO^pO81!?QInBe^#C#&CasXjI?oM9*TR|xOqq?>-c`8_Fd+_1FW^f3hatRGzhK0)Ie
zpwr5i#c6^gCjE^j=)lmN62XRvMShZWoj}G*MTrA~&6a6*LA3b#c-dnG4y&AZmyQAJ
z+{Ek8((feC(QX|zZ#cU@rR;uIcWOwfuTPWky0Em#ctA)$dQLk#b$VoTWoBgsZO`+o
zQ?Llaw0hwSl#4Qc)G>%vX(V@)OSI{RqxVtcqeyjp>2Dgq!%=brO9L1T4DXMwd{O#C
zotyqcHkpO;QrCM0vq+cb7ZJu%dZAJN1*xpemHLI>4loSZLuB9N&YRBJ)8EosR;X;g
z3&b1ljWg)@{f%Nj9n(8!7jWnMRU#drES2IwR~-z=_&f1o3N8?M1EHLW>=?~d*wH=q
zrmNpIRJS9`EFFs%^yCnB8oWXFgYakQsm0IR4YJXDFFKlPZ_k`d9A90+&mo=pNx!)H
zNG*EJkw+9$sfovDkEZz%T0Lm1iWd&i!A4&^n!F>n?<%+HSx5~!o?Tn`O2|#oGMfI+
zUuX`}hIH04LV_dnG|_^4`u(tp)VNL7`NDqKRU$P|Icrs%Qw3to?oRShFutV_{#ZKN
zzA!b~T~N+{0yBB8MwWV;TE+a0T>-9}gz!BSaNA8gDFM=6$gbYvia;FQwZ=i5#Q%J}
zkuh}RlaO0a?tC1)tR8VQW2WC?EEjFCbswXPeMA#b;>PH@rQOxV{c4V%gnh)}apCU-
z4lAF3oTmd`7TN<|v{#nAif})N6>qD2FMmfexL?WCJ;9o<03`ou+Lkp~X}Ii|VEL6B
z`mQn!GixC0ZAJ;aJI6@UkqP89oe;fsOJW_Se2h}4WJ*#KeZn-GN}MgOYVl`<=yaKd
zVXIiDi?*a&%nZ7kF8Ow-`XzGkYloWU^=JGBy6<a?c0Lghjd^pfeGIBL0up4oHs`Xd
zz(xcim&}bKP&wAjeiwG)MbhrL5##Soe>L3-cz?)}Hs9NEhk28m7+4ar`#|Wbclf2&
z(GIO|Gu$U#F-U{pkzOTGP(Q~Y`UBGANndC{iS^9Dib6!zJrPPQ)-5lU(Be1fBuZ#t
z8)1PB?fl?c`wJ8em;TRc05j(VZ23X#6(V&(-F#5y?=*BZa3fU{(0(*e!%K(=xPe_`
zTor?dsI{gx?7FupIA%SC=#dZ$4dZ^|zC>V_Cq?)4YrCXc+$(^7Zfj??!c4_<v?BHM
zY*-+b(A92EyS)1`j<pL0EEjD9kVca+<{RVfb>K2m<a>CDB}3<Vr-nnyf)hXqYm1{v
zvvQYHJb8T=Em#pHPSQc{ZQeXFi>e*o=BoAd>sqY-m;t0LTXYH=2y40?Ff8ENy4I`d
z@K}DMvE`xL=MW!5myJZ`A^8RTz3|iVgU&1CBBKbQ*G&f<cc+1K@s&*QuLcv<<z$(@
zuGME06VPt)s4W9=ozhcb6DMc$x53^0^WLYxUiYUEiygmYf2_M-1GLZGpV~hea0Ig?
zk8Tw!iAp^@+9@tA|NZ5392`dL=;%rHZ;U(X?$sfRkvHGdj1X6Mm!P{kNgp|hwdE~*
zj$Q#fgLL9)-=$`1?QX`z5;*7iZ*mfA>`afcT7ACZc#;EpOk3xu-tUh8pAJF1Uzr=q
z1;+AC0h!m*X(Eqr^zE3;>=SjTV(6o)fo7O3(zyE|r4CrHZ=`W`OdZ*0bTV8fVzi-k
ze7)Ft)pNHxbi+)XW7yG&t}Dbpp3kL$@$6<*mQG3IY{s>i65?ev)jU5_)r{F3UcpUv
zKI_foZ}?NSpRM1Ufxd(r@8`H4{RLM=rr8FQqYi`~y&EqIVHY0}J&Js-AF@Ha9Zw%~
zk1sl3ikI_+TI%DNBfLSAFPQtClDh~(@>JrT(r>MAKK48_XWg{6DD=?uRS#254#>`X
z<$#2O>s?!)Xf4gU4WaXqh`Y)mf|oVf!_Pk5pc^|sm&zQQvZEcks$kSuNIke0Ci*+K
z*naadSC)e-q^M$H0Ia)-;xQY+D!GG{i?PQY=-#FEr%>ncz)Ob>CZwFfv==66r*@4I
zpOl1lf8DRhCi5O6q|f3|1QQ2!Y9G_v-?zOA*iKV-YH#i+rAlRuxY+cFt`=!dvc6@L
zQ$(w7LVS%Q>j8uP-!K#b+1bKsf$M6~4(tV$+jPHmn9~I8>FTueL(vRX*D9eCk{(sO
zXT}j@)Efkwee}n%CD*E3ywaydHr`9H_9nVb!t=FA{3)YTZq`WisrgUKko3aJ*yS?I
zfu(lQijjd1cV{=n838u62dm=kDs&M{@5Qq;)6A%t)E>BPy3g~cSduSj`+$fWc=*Qa
zK+hc$hI3V&laWqf%*T)s5Br`7Wj*k6cLmDtu;&nvY5}VbgawxlHthRr){GZvmqQ15
zc<bl_$lPmFVOJynRN~K~nt5Wfau8S8w&a{wM-xO#t{5;+pLPkLNQFR?_EC@nxIM88
z4*lWLzrO1Gyi;#**65D!Mi+~f(r5G);+XY1`UVqdF0lxIZ@gMZEM;r(CGp0F1$hzY
za|4oLRWr<^20Ageomqfd$i8S3CUEk^jP*o`uXD^<*^Uf^^@e79SjsxkPTqyZP>6{3
zirjaBy*^*J#vdr}bR%??e6&{h1Jg*46dwVs@)Owirr*M(SHd{XG;|vn%-;5T2#WK_
ziD+;j_FXBzjVg~m6>RYCSHF)o+`f_iN1YBml>{#Er879SRfMyuE;>)C%J0WD2jC@l
zQnto}@N95n^3%yoA0|jqL)~|I4ae@zq7{CZ7QSse3Hb2nVGAtolgIpv>OVWzy5QSK
z8r2oPG$1wgiWUC8D98TD1==Y*0RK6^zS}XF>_%pJ;p_bO&sQ;-ZuQ0D@)=%K<^ThL
z9?=3T{dlkhG`G*TEU$V>S6}#4^dM2OoM_g=zi{#N$DiP=LLq4VpC@oUnyTamyeYX6
zWPF;Rben9R6yR0D^k9nFb?|r;eR3A$cKMti-sBzPmU=Tr(y3X|fp7K(&}5ge{VD+-
z*<_UTYf3&#=^CHHu}|_-2+5fGn1p(sp8G!r0IS4a;@k8LTRxC)9yQb-l)^&k$UMOc
z&P==YsksX`9X84LM*{$fqUAND2Tr56pbAec#F_6>SBU)NbvJ{)E3Oa`XkMu)SQgpg
zK4AUNNVS>p<3uMhL(wDz`=L0(auF13d}wg#)ZYMm(B@K&UFc$oCMO;8fZw@fEf$Zv
zE*&g`=DNaoci04Y`#EssHovKkZwR=>(eAO?mZ^WGZ*rG?{BCaMBGZc?p%1e#m;cF;
zJ69{^n^2h(AKE0ZJ+%0lPtG~xnn0s!XRixQytjTZnk*aliBH;ZQ7`KbgVp;SUGW1<
zC*KQX9K9Mm-@}CapQv3Ph@G*045iPu+<kqd`mK4Q)D9WA+jOiM<yrpcYRI|q2mE!h
z!8SwT#TYrB=s}L>MLRgns3BA!KeA&rVPd0=WyQLfxAr*@ZZ_Qf;%S^pbw~n82+6aW
zP~hI2Sxu$BC>)(|O0TnrY3b0P69JYzH?kznWy0z@s_RHAkZRi3{ZY%Vo3ED$En-(1
z>S+->)~@s)1Dt24RA&?8_^=;5l9xd&=M)v#@R5wwPE%inNt$l;o5`YeSfEo9+%tpn
zqU2|_lM8$ImVv|p#)v%${mPpA^j9GwERKDQ;9c`Ehnr3MOG>k`=pH7gfkpbuKBIHU
zAHX;8>0*h`YY~#2GJAWF6d_P*KB8e-as=5<*8N{c>tB?wp5~)}b=$nP-68uV|DZ>u
zcQ0}EY>(75*DT9K_t<8kG&?KMVjN_&5=zsN5wtab^#p88Q3`PWM4~!39>)5LfC~a2
zq78g&`AKreISyOyB3?5eRq2j%gdq6Nut8Yg_?>iL5F8D{Tt#+NJi3_)juzt<7o+qY
zURv002_YqcqqA>{&vdsa%40=V;>M{1K`za<^W9CA^k+-;HYXD+n4**z(nr5%c{C5u
z22;AzuZqKC8@>|WNtzt>D6<d1!pgfG&-if%6$_xWw7{x`+DfQi?DU3jcw(Mz)7bVk
zhviJ3KDpFBYj0}4tuCbVnqjOCy7%TG>+{2e4<F`#U-szuPU!#^bY6-sa}nHoCR-q@
zLr;{S&FXaL@3=UBrSH>S9iSBq@Zs}D*6k&P#1xt}Wu%QNvR&53n1ZoVxxm?WGvz=X
zJB`Y;hy@53m(dStaQy&fAlIre_SQ2cN;|l_%8q7vz+P<Cq{m106swA&y<$_chB@>~
zdbMi5#!2wvp*uIb=_Qit7vT4vcW4V*^4>~#74u?StXh)tUbp|s@x!Gf^PK@MUX9kQ
zhR15-KshrwTov9cb4?}K4tSK$rH1LaBJa;eee`o~PG?4C2h(Gzi#f)aYC98KsTHUS
zsF-Y@p`CXwIQKdBJ-Y+HK!9x=skFj!12LZhpY6i>rjxXC48v-Cw1ZvtWtEMlx}vwg
zIO=7g+h7kIqW!&*k1J0yJr2BjvN8+8`F!7RN-Y1aYj1ZN=~3{X#LTLt%6ZHzoXK7)
z@oQ>V50f~Egr={(*`VB=@Bi=hQ2>c@*N-<+E89b>K6&Oaml&j2d8{V1b~{jgL4tTJ
zaQ+4+Y`zw?8%%jn+>3|RZ*D)W$pYtU^CqT_Eb`i;Kle$M2oqqPs$GzKzbo4_CKs3-
ziNV}b|6qF5yFh}v$v3G!F;B<g#`iSJ*HRxP2ii7U$W@BOs7l$OO)k<0Fs4Uv%02jP
z8g|Nx?081?F#0ubB_c^iN0#ZYF2k4KH3tE25W0Kr4B5*?B5QQm<YV6KWtYp@{0Wyu
zS1DcurC_nk1b&g)cHKLERD_<l(6xob!r#74ctXe*B4D3IfLdseg3*|0rsuEYx2!mf
zYm`No>&8kOyUC0xduL6Zzq{%W#21uLZWWH#e=uIr{t-b->GdxZ7R34amd!LoC{0fV
z(^7ut;@^CLd|lgmg|<>`nuReKeG1P)h{oYmKK>M+#^i*Usje~w_bD@PI+MrC$<DfE
zVYB1P7wOd(Q=6R0L|GO2(4z?!kw!e&;jAhd{nj7LJr@Er49}WR$EWm(NMVz)TBt5r
z;ZV7}(8GMI<D`h8ue9`4TZ8-YCC$8yEr@^L96=<45x&mZMcdqm-bImf0iWSN^n+ji
z_TPWG)W%M59sBeKdQ<iR+-2dh^7+3x4a}<#T~$8|o8&HSc||VtWK_DbI|d(*-;S+7
zu4vYjUyHR;D#-cYI?02q!*PUOhHLe6rl-Q+o<aTjZ(Lt}SX0(Qt{P^7FVnk(Dlxwk
z6;RvUg~7Nd6J}boq5d}C<F5GF?dV$_4bK%vAsD@utd5MAnRw<<=uyfsV(#_cKB#<$
zwmlym*P3u>?)H{kb-vi)zrntvv){<{T*-7Ov*WN(?a@7#&u*K5>0?jhi34p>c)pTp
z!0xTEWjxH`smxyEF+Xgx!GY%cxs%e`C;W#3+V9;JUZLCP^FaTGm2W^_sC{%^fP!(Y
zoEO-~tP@(EZ4Zn~timS#s~#wNo#;7|e{BBOxbpG+cglXor}6Fdv5TGg;MP&f5yS!)
z{YLPmM~rY8NXi+G-pCLxdq#hD60U}_in`i%>zd_bgWYI~#6f6!)F_?fO+`*gdH3uF
z+rL^Ych7XN%%%okgtjm_#<GbRK8_Nb_F%(iyN&k8MZR)0-6KfuD{ahVWb`RUh@u=p
zDcvHdkx+l@3weJWnb}sj_y8u*4i@99B(1sKhsppNv+mg1uIr-X^u)gTsigGMd)WM`
zB#+)<+V^(3vxBVcik>0hJ}#F9M=B*}Q=+FbW|8#X@*nNL;i}x5sFk@~E+<olZ@@cP
zYe&w)YngFog42ju7?ivry^-J3<C7E+<9OoT{t1H%+RE2ikqS8LV(|CkI*7V26UcFp
z6vF2;DnS?Lcusx&lpRsBHh7u0kIQ=K5z3ed^XM743JPLKf8i9%h-GV>`T}a>7E}LL
z-3ndHItzNr4Qw`fI17`(JH5U{jJ`FGXohm7{{jg-g31O3cHyZNZ2m>l($NsM0mD{O
zU4U)dgoFFVJKS8%%dIoz<Fs*Kux^+Bd<X4l(L`LW5s5>@L&}|$(MD>Irs4a6h<HT_
z8C}Gsz|$KxbGMq`lsYu<1F4xIp%D<d%G<p)MY9+drbegN+P^iFVw5gIxbn>l)2RaY
zvkLmPj>mHVY0RDAANUO{dW^aVXlBG+$~6I#33vU!U3|+O+%M{ORNGOwv52j4)%NTw
zOzvO%F4EuK2w?Z+5BE4&F|34I&xS=F>`6LkU4$spLL!5N(FY>zyB`25wkkY-T42&T
zPnc<I{7Iv3P3zubgj9QUf1|E~t`YLlA?%e0zq;M(5AP&AQtekYRf9?WlQ}j~vbU1Y
z?VT<$Q}TuG(!sgKD|{78*lr7%Fj;Kg9%c}~OM<|U>l^%k6NVEPdFFn0Pt>vWkT4#3
zL+E({cTz#W?EvA2&VoR0CKu^=-vDqEJpw#1TY3gp>bK70tn!nke3I_Z(2D-l%eyXo
zpq#vlx_bUd-LHE9clu<Rl$Zv0E2hd^mfpOK*Z^~{Jt(N{r;}Iw_#WMO{Zgpq6`yDv
zi5hA_58EBmBIYpC7x8BKt*BUDDJ_67k<C4M--XU(`Gw=Pn6@z)5L$TB*jyGqGv4sl
zKZSjBnPVpY1V*c7pP>`K^JAMq(4(Wr8#m6c#`kvpbCO%>w_~+2XNQ8fMFBDA%vkwU
z|F;$!QQ(km-j8hr8q{7|z_J!q^W0Y|tUOFj_WDOiJDJ@_)34)&nthKqvWxIQvHWYG
zM5FE-v#s#QwDi+YI4fKYVj63aic-k)Rkj=cgExbVEc&(1FzH3cc#ic}#eLvgz62E0
zo6?a^fI90j3{}t+59R9a0PUa!aXC{*=WV8gO)f4{y!hI2i|FypYMZZt&=qsxMqR~B
z_sz>^81nP!E49~4k$CtSfbaiB1HAtR0bwwIHr2=S0{u!~{?4GjO&#{iru~R73dvOP
zqTgsJH(m0~dKRX9Xe|_2%b0BfaI5xH*0$c%G1;y(<rZ$%dc?4qoVnL>jDjhcJ>x9G
zQuo>EJLLdYY}K{KPF8C^X7NVUwpt5eo*__sRQEE03k$fVsT09}JC~RjU%8XV@2l3T
z1piumhH`|0<8Dd99~osCih6dO)Zg6b^@5voV(6e2l?sHVHy=#gJe)KYb+eLRE01M#
z_ZIq-&6n8Ii4EPr?=RbD=An`<)5i?0UnWP*5*5kguk(yTH_Kj!BNPKJVNHBYWwq3{
zq9r%WP~~0H|77ZB8N1BlFQznZ7vdr$_DE6~9E(S({8U{ezcb|B!Zc4$s?Bkixo|dK
z$9iYGGWvA=msuF%k^X<`uA*?J4;R*ZhwdA(VTVr5w%kR#uXdO2%+;Gl@fv`ZJ{dIq
zM59)9h#ogrW_h!;PIV=(#DL#Xv#V&*mzp*U6byE)U_3`v6u4gZG+KXiey|jJc>R#@
zsX33pa$xti%ZHPQ+4F13iVkXif&C+i&RoRcXg14LHp;Sp20e$kwbR%{H2$KI-{pdi
zI@U-`8YmcH%XCBSp`)s76p$mSoFOZj^;}mF?H-U4*k3rgq_Bf2zA0Ne^-uJ_-g@w=
zQ8vcHW~vxp16oqJ$hW1mu&k*3%;qRGV`1GcEJG&lGuS0T_6eN&FiCf?qv4}_>^DAX
zS?@it9$JLcc3I#PyHT62U7T?#M;{*_^BmkreKB0^DDSMz7dY}l)c|nev!c`FRqdGK
zMiX?Ftc`=>klvpa#cpavlb%bivEtgDQ33k@)Y(Jd#(VY2-1OG$-uXlK`hg;UNGOgM
z6Y1vT!a5xA=+^m8&vABK_@249x8Py0a6qok`KfAAFT0oc%QhOFyU?QZavR+1tSE$G
zTXcCvN>ldS<jnxOJv7!%Wmo#7=nI7MX&WIl%3)N<lor5qQ?9HrT6o@E(tCq6`de`n
z>KpLtTF80uaXeHqyv~v*dI*+erZODV?=DbrWffCUGoGyHFwkkQ8PFk?5-t4O)`q=e
zMQd|j33)VZxGBX%o98LAy1B^v;sgu==<3Onwja+wZ9?$1c#ehBwOhE!mJYQrWY3{s
z^da#Hdj$>wZ6WKA)}YN1h)jQ~bKgr0e0;ZfJ&Lm)9FuRyI2s3Z>|Fjy<R9%@^u46f
z$hMti%i}7!tQ+g~O1PbFPq4kqiXj7J^1z?3Lxy#Rr)NZ#SepW|K=?>n{8<HDSj`Fl
zb77_KB_04hx;MsI%-RAnHzQXsh<)F%bN>cfn^$+lnfdgKkkwm0E~&JaTlXx0qxZDb
zu-2kFR$QwQC-2J<5bIEMz}EHl2mVA~8>+w(@;LK$VuYe>(}7AgI8;%f*pyKRv6SBW
zTp>C?F#41pd+<r(_^EfVHPBQhv4cZ_r^4t#{yf^kNq(ch@tIz3arYSCK8X<JE83op
zLT3*0cenp=ndoRd!H~N$Rv9-32e*=F5za5Bnyt)*RIj6e(MfX$yu%>X+;boHqaXIr
z6xq58tocn!Bd~n8<`k}@utf-V(~gvBp$DSw7x>@x1U#yFuZAL~x`wZG&Rsfwn$5Yu
z^{I(X{0r0m_Z)9Ne7%xFbmuj63i})^kpp7Ht|y0&jcW34H%+azwtkzw(0S6HH%YWe
zvR)x;BE<anzDt|{!QQUdX@YL~3D(zC0%xVu*In6HGQL4Eww4yD(Ck@ndsRn<Q<H!e
zAFzpewg_!>^VGs^+_8n$RUJJojy*yw`%SseK}}Up>Vrp)7kpeAbQjRtuoyHqPjn6@
zR%tsaFGK_8OzzS`h_U<NJ7DacTFcQY&88?Bcd?u7^p1A)d7f`}Mr12TVi^62^~7_?
zVUYok;?BrREf`PIAw`C$p%iu)ss@vB*jTN(W1(|&L8Co?w{~UwrP_mjx9?NpI2ndO
z=YPs1dv0p>k0!$TEts8&7<~<@-0b^VFnS&aECQvH`H4XRmfi3xN3gMWGkgdpZXV_c
zVp`8zcm~`m?R^SVvc6+yGIE%Kp@DmGjz36;-_|#KYb9<#Gl;4Wvab_E)w+EdKcF+M
z-wv|<Ly!b-%gr_agLhnMEtAl&^g97U1H&Bz%<rc#J={;F`>;V~)!D|B=u0}ZYH{xn
zy86I7BItK7Pf5GKi=viKAaCY}PmRkO>ol<PH5Lx<ndLylu0HlYI(l|JQtk4)G~?)X
z*qFsqz!yOeKam{_obPq#s708Eu1J%Kx%7ca5UZG3JUS`X<^90mHucf?MO;*DUu&c?
z?qO4lv<{xs=5h%6TFJo;t6Uh1@-*3M%EK_#K5cpu>(v`|qr{V4cdVHgr_{;FrX!$C
zwkYx%Yi_Ce%!7CjK!M-ZuYx`)2T4uPoMMdo60)>it1^o{-ekQvGB7MX>942K5j%#Z
zeYjO3R}tMG&Et3rD)LX>f+pr+!Vmb*<>cbgkImOw`-dK!jd#~pDeLT7Hjv=Dfr`ph
zqM-nYBI^T9CUCB8g3=EdM(H76;_l)H%d$TcK9A%h;<D>;kmiP#a9q`<)b7!<6)B)W
z=@vhK0?dBi-j0VO7b!d+LhhgdUy=Owk^^TL?*(cj&JYRVH^oMXT7wvLkVcZJQG(mO
zk~P(zS+^HHtvyeDa<@Iz?TxdY>QxnyestzeaR=9PUz5AeC2on1)LiZ=L=_S3JPIZZ
z(bF<kC6~ReF=rcmgh4qU(k-(d>uZd%G;4Vq)qy3^{n?-vkCs)dg(If3vljvZMJt`U
zF~gx*+;fCjPBa}CC)|jCN4e*4b&hmhD~;-xO%~NM;aLAh!py~`-H#{cO-8XDq{zdq
zu%nwDT80&jo5Kb%d$2eY0%zY$QW^L!!B7^$DlcoZ@r<3cqsL1f9C1>#wX{AS3wZrU
zpS(xW0(>H-$j|e<1)dkPryyK{e!h-jUa^;+stJ{I9|mi2x@tvS8yW%&2xU7|9?wIn
z+2FYE$-AltDhn^yEYsaqJp5SBN3+#TLKAqd9>J>5_R1lw@6HBR0E5)fE$y4<k<@%5
zzX|VLkalQ^266%sdu?3=n+%z9KOySU9GPF9-T_CwD8eqGrCZxNp<ySOE~tHYxB1!q
zTw&3O2k8SX?&DCddwefU@sx%qUF|oLGt?wtxZ44YQV$3`X@2@e5?G?=RKoXm(UuE1
zm-<H$D$`0eMSDM7XA)xSm5;__D13+I!nR6$Yjb<~rx-^-jGjk&D+UaEs*TKnYwnYY
z0!QOxTKZPH#lDgJfhC?D+ud4kXFuc~avyt=<zIf)D#ZozADQ?1=9?oN%}ixJqNe~?
z$G=qLYnPimf9jCWyEp%Hi$KK}BfmUmXlbeXvw-_~3mD|*_w8^ni(mNF_6VCofiaPb
zMv7vl9|)GuzW49TQMi8QlndS<$oo;vp&9+;M)T(Q^DY(+$gNp^p!w32%sJJI`S|+%
zV(A5@qt(t8<}TKpcDgfX3Wk-p2RCLN!?E@1G824Zy$mPI<iNB#Y2Q?JlxZ0;!%Occ
zXL@)5OXD)FwKy`UyyHWCV!mmDWU+tu<rC&3)IT$>b@Bnc<UWY6h|*={C^uJn5=`SC
zdpdsAXDRx+2lz5mS~{Fyrn*pCSar@_uN0WL@Nj0vqh~LGQtZLKAMh#f)I7B>e+b;;
zIEEI>FHP%n^8Zf{w!F*1f52zo#1`k3Zo7k3B4fNZ%ELjtu(*A<*v;yl^SjHp;X;}Q
zBTk2~CX|&%EWk;nbYtKDN40SdObR;N`n(@VZ*==<b5Ao!@jw@QNrpN0_zsj`NZoGQ
zVz?ebokyxgTLqIo45{KYr}`Q5NM6v4y7r(lp_Z-xJj!%tm_ju}<(P5$o34wf#JZfr
z7kKyg%iIe*Q!53(u(Yy7+2i}10et~tUqA%|;DmaiRz8`P2>sX}u#%p8yNbNTI+_+*
z-3sxuK5Ih`kawt>k>ajXB5&e()t?HHuir18Enk@;d~*apda)ZN`E$PY*ZuY37Rx)w
zW&;&4g-z=(0VNH;2L)cwuMD#~_7OiUtP57Lo7T8aUccGr7`Na(pkr+Bi&+Sgr<)|0
z*!w<n6m-7vqjkGxrFf-pi1}?MYYp1U<{U}cIvcu2V?sev`kB`!XgiqF4taRyjy9<1
zcDum#7N5D|%nHPp)c!5)E!a;5)fYQ$O~%+LRB>iEP#{L#sdLv!Bm|XdT?#bdL(rE$
zm;oJlfAufk!(UW=ZbmLfYM2n94nm|Tov2Rw?f4>GQ0Lm4m(xG`F8HrxvMj#M)DfG~
z`=cz}F}A7(mBAbIpN<!_;OPcLRGQk)o3tXGNA8M`{m?naEPiTq@~p9oB<DV}ls2+W
zwqnpYFt19QVta*^?|^ih_*kHlakkTmQtMTU>V%f8YyIdXTqbBlvFvNYuBu1zI^hct
zS}1#jK?r><-{&qGLl*%TQNJf|=~YA|p&53nf>m7=(xygVpc$k0`&Q$bZ1>c>jQH=T
zM0->wQm9YIQ;<`vY{y}>P@^#DaXvBYu+s}2g80^5Q*hxJqjWwmK3N|ea7MiyPkH;P
zr=E!jjgZN>3)M4uvI>b{e~CMH2J(N9k8PDxjs=_K+bWAsf68{D1I9AliDgru<G2c$
zF3k1IHY>^3Y2r^^)&o=&8$X2KP>`H^C?H@z9uLtgee`7Mh4&ND#wtmAHIYSQ>rEb9
zmQZ8Ww6czX)@@lR1vlEwZ0j$5u#>=?{h(4v_RY~svcpLf%`RqVu}$}|DR`rkYe$Q*
z5_EELv2%^QLgQD$PLje(<r1cC-?A6wMCtT$;r!Z|1<pV{yT+Sddm86nAPitFIeW;r
z2kqIl!kvD2fZkXu-7k&@hkdsIVa5fFbX6aGM#dMgbfNQUZ)NDhm8P@8A$sz0JDx*S
zreiA4+Vg0AZ7coWC(B2#UKG{YGne{7t7!KS-D~HvoO}ArY#UeKg>W88(|l&quv{HO
za`GqJ;_2YVWv5a=9Fn8eJqUZI*FDl52)kKILIwLEERY?vR)b>}AgLmGVrqA?WLtj*
z#s>boJOU>mRnzaE#X;wRZy)6m=|&efsh)}D$K%{iK7>uvS;55y%l1sISGs^e4YoI?
ze#P;`@Lk?u^l+{D%z)ynJ-oJh1dn)2p+{JGt03@jB$b*S`SD)#Q6sd5zz+H&QB0_X
z`aUG*K}~;n{AYC(T#CY?5`i?CxSX@+=n$Wh7lB?_6Qa`XhjEf_;`<(c3{M-BIS<P@
z>VN--Jy_uNJYYl)I!a@KzsU31N>qDc=u2C0z<<b5EzmNiJW6(HCD1LzG$no5j%Z4f
zG(R(`#bRwyd(}_K<_ML;b>Nu=+0pgkHUOVlA7I$blX6Td+R0L_YYwo({{X4_kj*zL
zG_$MP9kV)**cgw;Y1s!dhoVU)@8(OkL?oQtz2C|f98ArxzVHqi*uK}T0rhWFB!4zz
z-wk%#x|i`gvaip(;E(m;cwAb#!v7mjGw?L;e@&rRV1|qy@$1a8&gQ{0FG{L9{>C?&
zc)KeV_;%2a!R!<MNY(rmhId4H{B1<ROV89&rn{Z9=*J1X>D_Ma_p|D^A&fnQuFOHd
z?lHJ+R><u*M?l~`el&+@d<QA_!SR`~o*qlSTk+j!-k9}!z@_P+WBoh9meNc+x{+`W
z+t1YMlbdNC;>9}#lcZ|FUyAlhCC_{m4~J(;2cPjfP)``sEy0$a_NtmQ8sCLx_#>2F
zX7aXaCC4SH98U4BO;oU_uxr%Ft3>&dVQJcze8LwqP&j4w4ydwYZk}cj-GWa&CuZD7
zVo9-RE&uW^CW<n?_dJ+lK20dx>I>+F8wym<qGZA%7Nnz3um9H4c^un)tNM#<!AJsk
zibnW!udF9eO5`Jzfg(rwzY19^5kEz`{$V4)mnJR%p)?Z_cl1%{#s|;^kHl|xj!Lwx
zj%xiAyNqrKKJQj=87$Rr{Io69*6iOg_(=6t^y{y#l{cdYAGJvyFyw8Yi$o>V?bt`C
z_X%}9t7iMF=dq!ZaaVV$vNaA7v5Xxl<g2^SUD0AJvNf#-?dHKsuP3tSqp2a1=I_sg
z$LMv|1j7atNEnSxw;OjF2)6>nYTKWc!O`#-6|{4yRRaNKscTo-mW$pv#Fm;V#JZhi
zSA(N-u)xDlqm6#=gzIXTFzt(o%})svRTpTfh^O3Bf&$gf@qwQ7LrU@z^dTpC7A?e!
z?+&r|z0!&R4u-@sp{oLd<jI5&UYxpGiB5vj`ZO6@Ib5@)01%?nM#4iw(S{ih8#LV!
z%2e?P)kP`N*(_hNicz7!u|69}KFQ>WDN;m*%mZLfDQGsuuY_y=oUfkB>pA|piTYDZ
z`kXssnG<IBSz^M*(D~1@GjNyU_H%HH1o5?B=Z{KrrF4_W0TC|cVb^|MD9*&OEb6g1
zeZF!cVW67jH@p4v7^cg~2Ui(h;)ktndt%pc)ju>c@9q_IA0%!OXuNX!E1n#@@LGMi
zs9Z2TYLuh^S8U8--zqss;rs)w?~_&1zptI~I#j~R$&N2Ent_~KFthxsfPFs;E`}Ju
z?^Yy~&uwWB_rkb}pCiZ(7rFc5QVCV*lO<iM@+!}DPM-vBBrSMnJw>zN1B8e(yZBm_
z@|ecTh0tAIh8O@Y5q4^ISB=NC1}|QmN+|vNCn$_Q&*zPy%iZ1hkSw6sE*7AqBc7H@
z_=Xdk&&Qz%xQ7cic8vFT<7qi>O4F*wXc)<+#dIR)4bG}V_Llxf8MMBo$U?1becpCI
zX_5Ed%YeG~f}&3>DFIEfUI@Z;%$2GG@mc=7#`@dqFp{Q<T_eb*?1im2vDX@+ycEUB
zlC3QPo#&UC!S%V~Q#^Dw2w6LSYW+>Fq8DU6O`01_P9=8aZd)Q)7ABe-k`Y$S5TDQ(
zMB73%gTd@3$DD2MRm;qB_Viz`n!LSmx8K!y=?ow4d3<zo?>$1*|2Txm!3RTfvTe(P
z^NR4bfpJ&qrP}Dc&zSaiwx*Pv0(^ZzSPTAh^NrJw3`W==<%eA9g!wt+POvjEJOW$>
z^}npl@md*EM49tDiEeAuo%n7wr9s0n?S-qSV=}9++dumjbLGJBtt2|;Tm46x4^zwY
zd-3&~s+@Na)gM*9Uklgsobo4wa)5Q6vl(}G$A9@C+x+g+s4JxrN==QZ`R+yRe`aB-
zT~HvL*{BNcj-yPQUxQb+8^3Yx0+sOpU)qV}`_5CNksnT3B00lKfv23Ta`&$BQckU+
zuvMv6{1)F(tlZ=-uQkjJT_&9un0yx7$vNjc9k4<9bE-BH-e}f&2*jx!mdmdj?BwYR
z_T5AlG4Q3GtUTM(8rao_uGR9Jeu_cXf0FY)BSoDh^bmI@pMI$?^2pX&_IRe}P)>as
z-wzXZ-1)1ox2qi@Q`-+KkP+*>xuicGy#B}x&C`Q+7jm)FMXCs%k7!o6w68YWQW$}q
z4wn18o#9{D)<0m(A-wyi_NJvi7c)aa07fIVLi$`PRgVSU0h4mHKNEm#@vdX;s~`5<
zYVKa2KVf|xu89^q&Ux%&ueQUwr=^L`EY)V4$Mhx|I>m&<A)I%=wo|G71da>){yW^g
zlnVNOi;$jn+FA?QxF}<x4)1U+1uLhHT_u|1wY--Z#$Aepm4MAlPOFr>79UcQ_Q#dH
z>>NnbeNIoi;T?yZ^{S^tPUz>%i?M*4j_TZ9;=$E5=kxP&lREooPeK>vqR6cq`lwWr
zDfzuRjwt6X{Rdsz2RqTODcA9hb>w68WlZ;^9!K}XyvU_tf$#(V6{}~h9&{wRJ~b2;
z7UB^HQ8rP35mS;qiR96MXrp;7)N4<bItGH0zgMY$`=@||{;9JHTFE63H5|GQU(5<R
zySoe{ekES)yFzHvnFSTT$*P#1C=Fy#p=Di>H22%cupQj(?@=4_+x7Y~2OFnF`EZ_K
zH+VoSqQ~)bht8x&C*hyB{P)Js=Q+KmKk5a}+c2JcTkg%IoL9}BuK4ImMo28fsLwx9
zJhozsLjw(V{j-go-fW@ijy*h6i7K;;49R^?*HiY#Z;PMZ;vT7X{O{%wwpO{=#i*Ti
zl83f#c&Dl9x)Z;psYcf5NqlF~$*|;Bn87NGCOTiujekh9rtDKAaZ&-{)!I@alIoSX
zZ+_;C1lXdGQl&u1XJ8~PRPxG0^vkfpe`vY(5e1>rvF%F_$7!yIr=3?t9=7CDQ#Myd
zJgF*-GnIr#Gj*%K(Wf}<k$-%pxW0!b#eLWe*)|zNPl>Au)iJ%Y=Hb&LsSN~Np!eS%
zC}&mRi>SE{J-#AtU>WJdCnFDdEGy!m^b&|0j2xxH)}5Lt1-#D(^$0b1<Sxx*m6UF2
zZXCxt&40q-Wp?=U>lDlf`Te&aK|?~}@?Ia9YVR#S&G=%FX~@g@o8n>QXEtg?->oY^
zaDq(yJ}REfX#_2lF#ff;=kwad5Y?x%$vy-cryp%Q0$$!$Uz6htj@@(oRr(*g;`O#6
zhrVAvJSg>Y+R@0Q(tY|vg5VX0AM0}zBfV~6Fd){yt9#eo;x9%@9|FA=I2+s%w@o&C
zLFV=?X_KIBa$(=COdoU>TK+}i+LQWo1Wp|SIigJ24*s<43`DZ@z|g4VJ#e#3fMWfn
zJ3t-jAYbW={XZCz!hd#!%}jfib7jth4+kpuo@8lq?o0U_=rxOUuNm-F5Gq5#$v;V(
zUdt2un@`M-b&lm-Y_ZdbjIiS<3Pub%rJ(jc^U+ZYa^qq3Y>n_l@Vg)%U$N<7!w7fn
z>R;a@Cb!x}T1IYL`WScI+#2UN?{+tz4FsLQlzWM&v-!ZISfzrEBq%dYFERIbZXeU>
zCGzr@v*!+4zhHU(9!~=W@fSZMa`2s7c19?wt=?xy!Wn$#G!n{2KD3tKtcNm>98Ud%
zE1{Ln`MyhuY=NnKo$dQlq}JZYK4SC3N@5Q?ZhAfh!d1XKVM?@Wq8tI^V{@qT&xj-m
z#pnSe-Cx!%C*iH^r=H2KsggsWy+3YSuM|Ce1P@b*PhB!9+BKay1lcxK9pl2rrB&Kz
z_QBWDVnfMuAe(o$UwHtY2BkUvCj0>q3a})9?H?a4*4Y?;Dp6&P;jIuGO>IJ6H4!kS
z(SA<i2=gfA;&p$7-U^LC(R%UCf;Pe<)`wCK2oUms4@imlF<Yt31%#vGG37;PaC-%+
zc1r=Z#}WMkMT^Ga3A?>Hgzm|WE!Q{XS|7=<R6|jO^|lA;6<rQT*qlZD&47|)fyO+C
z8x<Vv`qJoLLsB6}n{vx$9M0;l`eMtVcPNDUz(;lyolf9&oJ-AassRrKg$3DuJ0Jw#
zl=pn~%wI)UpJ+K0uzlm-rrxpLk%CA@veSKCNs$7VJhbz7?&jj(Vy1?%4IaP9;WgBH
zAf^5MT2_+8UsEj=yS&YOpqeW8TWk3=$xw6}#Lp|ut1(#4S<&;G310G$%XC-w4O`QR
z&RI+tzRbJO`wbfv+QTuzsf)=B^N|4mq72G3=a~h$@~-ftOhw9|&d>H?eYxHOhBay?
zq<AbFuQZl=yyEqSPEYw+NBI)qYz_fN1vTeH9%~O!pl>^W@ac^>qw6o+`*y#Ba<AGQ
z<pRpx@KMlR#!&ZtiQ<OwJrN~i{^~OKT#^TWt#e;)SmBqUA62^T7`kMC2gUL|qQU==
zb#9b-1o;vhwVS1Cw_;8y^>6|oT;Da{Bb$WU>c;PrFCk0*h<N%P4lRg0$*dq^<R?z%
zIrbK3Pom|pzBHMlysUgYJ+MDAg<<DQ95-TWjj6K#EK_G$l1m-332V_`&^J%U!74}D
zYt&6uE!2E?F6m>?i(mQFyW?|vZ&rwR-c2NBq3tte`qO4Gs9ngY)`ze&)yZ^Ry~{=7
zyB2@XuK<l7OO2{;E|Hp>QZOF@&2|nXOD$_z9Sc_>4Hc0dI<czTMJ-baejWc)<ld{6
zTPs5#;6rjRPg-8t!4^!!XWTgUMeUz{Eo_&YP}bwFff;wy2gkZJfd-aV7VG^uCOrNw
z5ZexLJy%~pnFV;q-;x|Fb33R0ADYfPEUCwR|CO2LqO#m#W@cq>O>tJ5zRS|e+zOgo
zGFR?Z&dRNs3oWzKa^S*=;NGF;z&%miAgG`?ey7jx`u^j2F5n!FTyVzo-1qBdzG|t#
z|4KXro7E*>i8IRha5?{Oj!4MQO|&r38c&IP?^e(wS`Hz)q^;*$`+$#nx*t3O@~Chr
zqKfvKuAB)U07&W3r$Yt*J&pv6r3IFD>-?I?3k}A+OeMQgIzgT80Qo3uFjOp1`_4vX
z1Z)x9GE0(233G*{2C^TV*qO7A=$ivGY2F>qxw{6YPI#HusZmjrWW>)Uc-!!Z=N1C2
zfBYl3(<qaZ@uYQ_pWoC4;}hvYS?1?egsE-~Yzem;bAzXtb+n?pe)?{7a&9&Wt}UP3
zZ5d5Xjyuw*<jJF!2p#9P%q0%MfyZ&I_AivN4TgnK+4zw8J32eG4(V7<{5xoUtMXoz
zP%IhJYxhF#>p&81a~lvCQoq%Q-U`AkqTvJZfuufQ<x+2g9p(-{|JoYp=zpGI03jXl
zBeA>{$hp`p+j(}=YH{<_4gJJN9CxDK!~-87d~XN44xi|~c^ad^9c_7NzHR(YT2s&y
z^S4&|jd;aD*A~l-Cu5rkcoEGgQ*LPy&B$bHZ%0q=0duq=$Phuq&(jm7st5_`{9k3r
z=$@s&I5hV}88Uu1r3lpi=4R80J7CNE4O68kwLjL1`MwIkur)7$t?f874#JdHxHeW^
zakf+X#+I`MXT}F}V%>2@UaTF}yOrYM8PR|G{a7{aE*n4th1*l6xLtUF<?w4Zq7ZQ9
zJns68<kb4{w^x`OKjJd=@l?SRZLE(>b@2zOx8vUhCKH$OF5lR`noMU*=-ck<FT;D7
zY#f#5<E5-CWImS&mT+600H58HJF<xomOHF$Wt!uf6X=2P1mQ;AWTO7QR|Ni2F6c<|
zYVC>Z&=D=i5`e<d>>`s0aD8xzFT05WyPbL#1W!)Tm%4k-?9#IRMjs3kPq-r-{q=Z}
zj)(qoyLjQYsP^qSrB;j&;g#xDQ=PNY59jJxvAf!iA)iB8YIM2io18$LQ_i``ye41a
z`w8pDR7C3)J{4*n`Ehrs$iaBjQrzW^iZ|M)|D276!P~ZO3niVY_P@1r>PyPF>4he_
z`-Fm_9ujeUvr<xb#ge+9KjBHR{F`me81MG@*2VT2)_ozQ*v&L{U6>=7B8AQqQYWyu
z!E9guRk|H@kqxG_biIN8jcns!=($c46c}ee6Kc_0wu?##Y^V~v?0N<nEEyn_YAX$U
z^b0zBX|}9tNI*_ca3;4m3Vi?{C`7ex6`!3;$sG!r4^JZvQ*V7?U&5T4>DB}B0hDlO
zj}a8x`AvlbICcpBpnt6m^Eu!_gyt%sgU&D=UA`N8WV6S7)|a0#?xr3qtCSRwuAvdY
zYx|mF3mV+o^ABY;=>B&^;El*NaT&b744m2?TIA$8q)cLiAIN@GX|xUvFs84Rx?P@Y
z%?XJ|-yN-HU9xVTWnX)dBkvMv&3T=`d{G}w-kOZ?fXVXL*)hZP(14ax;{(qTimP3n
zv_+9=20To>!oj^hmn>6KY(FAX9q;T9q^Y&{G<61X{;S4ftd#Og;^?8sDC3X*fPbVg
zH<dz%4xzF!mSy3(4Z-{YT4L&iEf^yNH8V*&)SGT<r|AI+?a_NV{q5(zRJ)L6+Cnx^
zU8;TrSkt-{Z(vj;*poxb8u_&E<DOtRTY;UF<WR*+jr<mnH%s0=q?h=HF0yM=j;O#f
z8XR0R&gFR-7mdqtweQ}w_$e1^{i?7kHZqA6Y*O54soTuV+pzIB#8nQT<bLvpd6PeE
zmDtF9sbXZE@26qC@ATox<I(ENc`5Quc-+>hh0#3n{P4ubq>M}mlv8I#r$Jd&;8GOe
z0EPW32{r;~wM`+(9k<1%m|6K2a<7MQOMj(KBjqMIg|X1P#D*Dp=_`VJf;0Xn4fh*X
z4?<>jCV%O4Sa{_PL<o2Q#C5hfBoC*;)%--voLag&Nof{eq6~@(#Ih1anpufW>svfT
zky04EAcG$>u)&aAFBy6~iS+J0nfQby!R_&noU^@N|4PzfGf^^kHxd>&!DQj|Vz=??
zlFouF=<(m>2cn)b9sC&`t(>yK66LE>i<<A$t_MqalB6bmjDjR6iP=GrNuM8XKZZQX
z@Lx&tky^lzu8Uyh^y-mxW^i7T*@GtwH`HeyyLZV*e+s}5gbe;wc76CK1t*gcjqi>w
zOx_@~N!x?}0O?@e<#)M#&em3T7TjjDi`LCzxg9ebQruGQQc-?8;#EM%!8nj%`$j+(
zFgaPN+_R%ygCDnjJSF)>8Uu1T+4Sb3S-ds{57!AQjAycaEN(mr5OaCy&-od{cx9O=
zdgppt^aUuS&qK&^>H@9~qe%|Y3myn+WVmi8whasY6`%3Pw!Hs=8NSBzG3MG-y&t5k
zlZHV38naovAKr)GhA%SC&(Hn{dOtYJTe+R+8$09)<Xj$%&leSgc;mctqYp^ow5Vr}
zuBvN)j{}{VTfFNZReU^y{56b>T=RL@B9>y>u5@V#qNjMG?2Qj^Fu@qh9ZbobRLxmV
zsoqB^*7_p$34{IUmDvW(oi3stE#Bv4F#}B!9tRrl#P_f)zca49)UFV~d}7mUi@hC7
zhHuq=PT2o>K>=a9Kz=r(5Js-e(J%6MIX&kUXY#qJ%V|Y~M-iev($*WEBtDD(Yirf3
zmMD(!{)K_{suf(%?-*}qD6XynJ+Q`m=c8UOr&`<IC56hyy+Z0;`yTKvN|Q+6ug7cT
z@tUu-$=59j`7Mb`207>NLHw4oQAKvhOd!5;+N?)TQ`}F=uTwmSUkyZ36vP%+H5!T%
z@hXG%Mfe~6v|#s=%xJZdLWxhg{hA$wT4hop*yS-D<{7f_1c=zPF}7v=_Hdi{qUbp-
zY$uwtUC5<(d-+KacK16h+w>&@)`dZCLqvND{;dyZpPm@jh}?f++t|rXgS)}6b;$o7
zP_x7T7f(!341lt&{ZcNx^f{#2>5>{@zUaB>z6^iiXYCjbmd{7`mZA_w{F7#vsOA;h
zs83kaeP9osgH88cIWSr{WP{C0=%tsRF+dls%h5Z?qidwmQEU_M@=`r%SZ1#%Ok-Tl
zuEuVSP;pDsy^G+#;qY1|nDe-{dUo>{;4X~4;&91TDMd*+?~fLkfdTfFJn#tJB8|gI
zve}$}pKDPrbE@JvZm*4_3SsMh?w65#!sNq6_%Br-{+3^=>G(|r9RXeb2`$^ot^D?Q
zmRX!)@BT0oFE+9lzQqLtf6b<!19Ejh{os)1{m@GwvsZlnl%|mQGV#n_IFA8t{rgAB
z1wYTN#Ek40W%j={bX#;&ka1n>x3s(@=rHN<u~c$mN3#kM2kMn_l$PWHQ`VW@LwGYS
zAcyBDC{iuxX<a~q%y##pnsiY7zlt@Z&1D;GNHymTh^(LWo-^Z{(WRi&+gSBi<4?`B
z`t8n(c)|S>L)l;7iK3SHEEX??>RN8Q_?xu+s_w!|@sFjc4x5s8`k{G-AW0friGSs$
zAAhae<#q2H`SPPDeO(CpxTg@IB`u>`m~Dq-8xS`6B9-xjWiW2<>F!ql=-hjROD}_S
z(KxR{D+9nUD3ojM87}<m*8U4rolRps{T|4(TYKDc3qSqCMRWF^GmAh3KEaf390Hdl
z>Y{%VLSE92r}r)(KQKN>rZ?PVpbDjD-#;~p(6TL^Y0)Zap(YhS>y-fQN*|bKyPS|k
z9_%&+F^?gwV%tTVNqemF)(Wg(%1C;>QME}Fv~iIqq<D3=yWf^m&)`6$52>h?0J$v`
zdc$V<!_oLDq^%O{b@tT6W6w+m{7+hV0_4xwc#8KkVq<OuiSge3Aik?^oLcwW`a`a)
zW!hf)q1l47m8kWHE;YiBt$#ZOQh<&?{KTJS=V`7Arjk|#sfk8XtB4H0jBUJm-Z))n
zp=J*MJB}@`LA<OxvYk_2vEMJDt#*V&N2tzHXfzUivuu=<t=d}qnStEX@Quy#?|eDJ
zPJ>ZDsqS9k_Qp{{Vj>bAYd(g5(3zg;nPL0+Bk;kai!my?GLlmg&kq`oX7WOBs4`tU
zV{`s&NY~J{&SOnuN0;3<nIlvtC9z!hGs+QdjNpQ_SG}cnUnRX@J(FdAeM!5zUnN_h
zWbP=W94zZy6?<S)R;4ClMoirfV6@KPI;7DAtvjBhdAI>t<J%jYpARq#g`zsq^S`;o
z(~+(Lv?p|zZ&TUrp%ww1=U`7N>mkS+xUm+miyN<T63f!;9VA6qVE06wZcUd%>xc3u
zn-^YxL%U9iszqB(#~t`#Isy{ff;R48RCmv-)791U;Tur~Pmz+#$pc>d_mq`W=D3zc
zczphQfl-|o`{HzFWZ&L4GDQ=Wbck}Ne2DX2`S<GVQBxid&z^RT0da9nm+01c>kA~d
z5Y7DzseM9x9R0A<nJ3uOFE?ed0I#n&`em$O&)lQ-R~)DD9^5wY<$^QDI6$V?_tP+5
zg~YaF?!e9&0f>16mN;IQH+!+l=lsg?#~tZDA^sVwUHV7#qdyW+V+CwFA)iJozjjS9
zf2)CCtvesuXF97fixKoC`zfi5<r-K+E#@8s>yqEg_^aG^?LhnJ{P%wLg3U-?GS8B6
zx+Yk$j-ndx#^02gq|lD`89qDGo4~I(PM7H#HL1WwI~$LZ#!RT~(Y49_UbE5cBQvqU
z%Iz1Yjn?rLjT6VmS5=iIcHa9-Dz~z!^3qOT;`FG91fmOcD&w>!zdMFDj5V>DD47k6
zHT`)sQ&V>is%FQ+W;x{`i_E@|vu^F_EiHyj$JhC;*Lz7f&Ru?WADWI=p`8+hHa(m0
zPj`okVY!3SFQ9^TpVrp>aS0(V#%cT)qa!9w?oRXl=H_3!y}ou&6fK(Odw<}pCbQpD
zZ@KW!W+Rs@AlCOxQe+HOyX$^muCQEfowC6tx$ut{;jj2fZb_OziXorie2Pw_)?{o*
zXT6T+`viW?PuY6OfVx&2dHR&z?xFOZU#w{T$lC!vX1`wPj&iK_nXyeh{Oa3bn-`89
zmzf5Rrow7>I(@Rc)f>RJn!qgxI``M)Ae$z}6Em?4uP=9?^bRXhLMmjD#cE#OsWjE@
zl@BVO-g;*8I|-Ikug>Ad($y}8{)~^mD)<=4@7Z!(UDglF;r-)h@W~ygv354#<=ZE>
zVrdNri32N*9)ZJ-cZdjEIb`HQ)veZ&QgXwV=4W@#3W!=kvV1zLt*bn;__<GMsh}EW
zqE<IZTLY*xwu1(nJn15|4N&R7bv6f9&aJ?S8HF)0^T1e48pgP`j{aliRcGh$pX-{0
zU@JpME#cZaoOc(fwk3i4i(v01+%yo^BdM`x$9<l%D?d^N5PU1%UI~91MCn;Z3N#G=
z2;TT^GNAFjEb2QlGWww8e0}pcUZoF8gg6P$CX1;NSQk`*k0$fz=)XeMXyi&Cpj2`8
zCelZ?u_2JYqa)m{RF>xY=Dwo808--gzxF}!uO)r}_<6_KTJ)WYukia%3h&#m??Q}U
zL4U9v(_0HGtq4Gx#@4LSxL}Z?`-0J}qXF_Q*R);u%DcfXi<5s@?`(=}p$Nq%oS9Sd
z-2Dn?Lpi@+e*9V=of;n6wyQ6~99(?`*WaX#g7s8zcto{o7kX8N`{7#ibR!f*V+G?d
z#1L0=G#Zwb5AD+r^&r`8aUgb9W724(K!Lwn4h{SBi`hX24QEzG44K~8F-Db2-vvpo
zd2e&PS!LcrvCP~Z?&&ELEZxAziwMv}D`ACWk9a9zuBtO-8@zI)4*M!O8M~(-h{udN
zm*LlT9ZuykhZ$lFg43UQlb7&zkgL_pG;otQNHmt}Gz1>%%cx+;c4TIo)^wHO#-@6b
zf{Hzhs12kAL2Ai`Pd%Fa_r91?wr>0K-)rw>*+PlOeZ9yM_x0Z}{4|h~)Gsl{?G7+M
zM?gW|mmTJzR|c<yRXwR|ccImw?PeAt^Dgqt(8g$fbECihoFmzez@-IMQIOEKq`J%F
z4i#wOfgGQ?U~L%uGffn@u|GyN=P0kCn40dAxooV@!AT)BsF%ZkXev~-RPGBGoP>I=
z$=XrA3zhJDCV{bI88I}`=jin^{`@sXqm)1A+H&T>uM|!Zx0g8@vm3u8#ND39l<zKg
zXDq5O@Me{ge&KP-XDZNQ@n!1&mN3s&P%Tw(OC=%hAlN8JbjQ30af<fz#}{XwqbW%`
zZVvo=TYe+M@ad)q@TC--8qjnRT+3d#OOLkQf19S*LI2MbK_k|#DyGM1gRKp5!$tUS
zuCECv%d!2x|Gn8A%84<UlT(&eCll}f_(RK<!Kd*t0g@g+kn?Lb2b+b;=MS{$TSf<-
zK2eZM%~#klf30P<0GW{9P`R?zKKd?`=1->%Jc@g_8#!ju<iLB#>9DIv$TrP5j7QU!
zTje`~c2z0Uq7*qktX3&3rY<K~;&;gpx5zr)nMdnQ)%W9xp_o)_Ecb0$Z?d(H6rV@c
z93EgqCFw;?8ZN!6S99-546HNB(Hm)X4AGCHH}|cWXTStV2Z9ojD;`aKkV~c^`dsVy
zs}j(p%QFdg(su;5HgZBFm+m+CFiDip!)=%D(@_B%XN(E?LaZJ2d9vPZfmZxoQr}j`
zN#5D4!mD90fg0j8c}6L@38!X~^>|&;<hU8SX3i=JE5)~_gV(|ut{eO9n&Zm@t%%%*
z#k#+xu%x*Jb@MqIx!yP{uu^Vg&P!e2KPpU>Dju5BE5B}jvN!_(qPBETW~32B+#pDY
zJM*0<4n2I%n6iffsFP&Z%VYrG>Go*e&bEn-kfiazX^jMvq$Ji7i$Lo0$K!4Y!+=Z5
z`9?h~;Cx^aLoNP%5(G(hKf_B&6m?Yr)w=Ac5gHG2Z-PCCoA)roa3QpLK<w2aILD58
zYYZ3^`N7XyjbJz@56#pileUBlJz(C1uE@HATqu0fM980F%oA6%4kL)DQV0e4_M3$w
zh$jGbx2_*_H(|Wa54nR|u(!Ie`L+zomf*kmxIu04!hv9K^HgVs?#ym-gl~a+iA62V
zrv!1&soOV8%}y6|(cwHlg!+8_S@rlCaGqV;!qLP+?$^L;Aih46E|B`B(DBhYE&V#3
zX4J#LbPQ2RsTf^R5Z~53`mNqf-X&>*SHIrpajT|*HLg=i4K5-HAJFGUyYIcOlkkmH
zpBn4V4^xV)9*HTJZv+mFHnUkSPHe&x45c^^op25slhH@*q1G+?N0rwPP&^(PdxGt#
z0|yOI2P#DVi>5fc{FkhCB#P8}D5zGZ*gs_-TFii?PFDqs-_z7x5;3Xt9BXM7n9Z>o
zvTGRe7|U-Fs;F72Fo;$K&ws?2s85wOZK%=Td{a#(IXbwErlM}zS-_+qF+qLtTjgt;
z6X(9Dmvzz1``_FOu5BPrcMhocPeo#lr!Q2)7m=Yu@*o<?X%1;*bEhG2=^a0$zkBfz
zH6;%k>U3IU-G>0dodv4<C4ZdTyr#nIw5DMe)`+><&5#+14?Swk4sQ-IX$`OM;oe0D
zHAQKb<C8-R5Ub;&fvyo8Gj`zeF*pv=lUae!L}Pa?>l0+RGrRYR@wTY?UM-CEGRO3@
zUXhly8%t(ms>1XnF_L_QfIUeKovXnN(Or5Ez@aUu8gpCU{}C7eXAZqEei|@`=3ajF
zHFfD|L*k=i@f&4-%#wEGOx2X1b2e{HIsP=%ywH2Ix9LNJ4m7h-@D=Ky9jdj|-YR%$
z6#kkFM^0cO2yextuN>dO9gW-y+&w`(Rl@4Bd$-VthJFjR`2#*rIW;+pzi)fgPx8wL
zAa2{LV1>F_Uta%C5Px<^^mmV5Vr!SB70&x@WC3DgR-`4b)6m%Yiirtiuu&_g{L$9!
zH@#{Rp07cG5O29BXtKxb#k$6S!E=Y;K>A4sZK>W;ll@z>p*FN!nHCM3j=Ou{wI`zc
ztFJDY0a<-J?MfL6kAj<!i&m0~;1!OU)@6Kh^`Bsg>8u;aHt}frqrgaSoR#%KwK+nI
z6P;o^lF2ac4xA&yySScsuivqd(R&UVOozdHnX9wK$2HFNNz+j_h;yw6+741R<O7xN
zlB8g>9bf*nX%l3roZ%15EdJ$m1iwY3w4;gjKQ<#YtpEDPal#Y+-kh^pkA+KJPTx@W
zjy<l@Y6=TUn2f$raFR?a-44;l-eGk)v3;2y@+vItuQG@)7zo%BI2JPAL~>y~ojUtZ
zwpaVWYD=-BNUI`~@Tj8VwEP{H{zP9q8v`7m-+C3R)$awQ!@qwJ!m=X>(4W-omV5yW
zpAtoN64=`K!td*DX<<gkLxf)Q&n}+ZaI+M7xPQg<eC%h(f=|HI4AGtQ7F+d6E-*=@
zd71gfnl}#m{hhV&>9H8Q%`wqb$RqI0JnS8>gWdlg3YvsSgmxy?{^1N({ELV-B)9S}
ziKwnh<NW<ZV*~Gx!k!HxqT_*e{c+(<u(h3|KU*@3?76V|+0hGkl)>^H@5m9N+krh}
zH!nMOW`->~-wA5tE3Zn*p6A}Su$mnuHS+*qOD5T~r<$bs25td_#vQ2*sdI7FyG#Pk
z&#!jMr8Rq}aZwJ_KPY+)nG|Ih_VCQa6!EPDMh16gC|2w>%pw<GXPE5^jP(AB41(>4
zDGvVrX3sYAxbOk7RPZt*v8A??bT@XqHj&f?Eaxo4W*VY`JENvWr<1x!i7#6%&A+e#
zw*%3KCU7ZJc`kKdll@5fy>979*O6Yc<kU;H3%v)>SOVVDL8Ifw9$A7WLgdW@!TvU@
zU8ic>#|8EMtWOq4c(E2Gxk&<mrTuhV2(Easw=hnz{2MbA608DJ%l@`~i40}54&K~e
zxp6E?6A8~ZTpk>oTS1uTycC?1s^-d@Yw(Gvw~QZ%s7Guy?272H`PPa!<%TBsd+w_S
zeKlV0uD!jdD)<UNz=*=OG$OrAt+1?s2XW^gpR7sZ-edoD?C4J4n5Eb6-cv@gw=T%+
z9UyFKW7Rnp1AggwsX(pNhkrn_2kUe)2l-ys-tro$@nRvuyB4uoXB|Y7$L!trNN&N$
zfw#*wJJ<QwgJYUlP8^OubiiAaEItPD^3Kc$>jUT)%ZGVX&NJP}#ej#lUzE+H_fdaG
zyLJWw{Q37dGipIz!>xA<&QSR%aFZwO5x*x{!j%9J>&q)I0GV<~<J}WPIP$?yF{&IO
zRnc7tl3NRv3-3Nz0j9vKd%q^9@8~!@)%}#;-T+e{<W-~<hAOBW-nt4^czyW$#{~l)
z-#2Bq{q(&?r@q1_+R9Bu%j)wW{9G(Sw!XSCOq|NfFx8bZxt_Bxf8J>cJ$-2Iz;~~A
zNauK<Q*QMNsP;^S<g#W}u6(&659Hm;gBV$XN#Qu9*XKcIv17A9QqgOi8v8PSM0x@w
zjKj4>*_=P~P2ydG0s8o*t5IojO>w-Gd-u7p#xIVAznok6Do#&;Mqq5V$w4oD;kK3J
z@Tp=|<lVCRcb`Y6>Zq*I>#t2iivwQ>g$BIgq|@g-WQZ=aB8~}pBccg--*(O4f`=3R
zstchv5%NcKYJ_Yi3)b?>BT%v3h(&ldyx3ScxE&Ss2RYnmjI&(RAJP>iC(7gNSgPcx
zRvQ`?kAKUDH6!F+3dKcRW?#6p^y$N*DsRF<3qr0eNOz9-Ngd@7P@nea1x5M9j*sp#
zQj(^8*RMW7=RgamHSO{C#}$ir@l1{Wof<6Cfvt)ks#9rrhXgm~Y1_0*Yc)TQRt6Rz
znKdI1V%J)V@@RN|eBEgF!xoi`|NaF7RTGPObI=lwK!tm4$o!uD3Up<s;n8W${u?rN
zGhR?uP&e+xhkNJWzk}V<Rt6xo<9v$u2K4ET9JNUS+~p6868l(niyelNNfG`hTW;&l
zd}w;Ya)`1|UtCr_x5&(kr5Sl~s^{dQPyF$02haOU;)rWc0|(x3s=?Hd_So+p$WkCf
zt7NOdeIqSD$tym+uZ|1IwwLEgj-K=ue|lS1_DeRc3J33cvHDVDP5-Nhn*eGGzw>Fv
zrlb%{^krZ3q{H6#SuN;DjlB$Ex%z}Jf}(ldp2}+}+z*rZVslmWM(2)4P}F%)M(o!s
zR5Ohh_ucb{DCf@o1x6AE5}okjM(F-!t&uN=h5Cojj}~08Kh;_$Q~8E?DC`n`(1|vq
zb*~&7*&1J91GVqIwkO+)D4pNNJ5>6{Ii1PpQ$q&#*O-tMKSuW+)BXB_%@z#fiQ9+E
z1ivE}SJF&EnxKI#h(nDa?MU>o_}8;fo&PT^?~n(sIj+T|&$cgRt<9PE-z8x;NRBR5
zbl=>)S1iFuzC6;l9BBkDbg;9J@u%&)lBW<DC_<UJVsl?pjBd`a@DLQcbk6b=k550+
z7{}B%<g^3flGdKi3wo0sayfV-i?)%NU*m0jV6~7-bL|A}ea0*tmFjq^NtdG|MR@#G
z&h*{lKWdO6Ts2^cl@?^L{ULwtU&YNnw!GMn=gzSLS+4!)P^i%;ql-|5pC|CSYqLLA
z_<?M53^^@$p=QK>S&ka^#c;=9+LCv?@e^iO%uQ;^`>XAf75JQ48(O0~OK%qy>6o^Q
z`t8A+W7UQ6X^`IQ*%=7l2<glVz)BbDY#X0+h%~T1*1-E_`3N|wBZik%Gp!)$sZDx4
zV%Vy&)Nr#VJqcSM17H)fixd9FqKxrRZbYapXCCa&m*9<mXP8s6?7$huYT>#o&<0g?
zTKzm8v7>QC>huLgRV4pCT*A)*fDtIpx+k>0_(^4sF@8UUB@j~h0drm{q?qPutOYCB
z_8c|ur#Dl$6*s*;D=9v@?e?m}(l&XKV-pTLu&z;kc3|Cjj1u!>7C*FZ40fer|2x3j
z@gc40$K%tkKeqA+_7ZWpr2&PjE^qD_7>fp<Iy|$Id6OL$G3co0SBOE{AO1E0x$E?=
zrIFw(fBMbicJx+GcFXn^Zae%!@5>`E%q5_gqu13+Ev&rz-rpiO-qo}VnAV2Y8qM7i
zs+vvxa={L#2%zS5Bh-+BQ4nE=UV9+7s7PZ^2Eie=CsVqM;D|fB`0+|#lr>}3r_HT6
z=KGfEq&e}m33=@k1{fOu<D3JcGV-Tn2CPU}vQOcw(_c1i*^g<nW;oL|NuRbxb3HbV
zd`x-Cbc_cD85hIb@~f~5In~N*W>U<%fJlI`>_38z?cK2Q8+FuB0q;Iix5FTNI|9MG
z_d$@uq(H&YJyD6B#DyBN?q~UwLKs~%CS!6e6}}GF)1~TYv6cC({$_t&F^c~Po%mIF
zpSm=+ZB9pJ*Zn>*h!{`Ow+fzToLI_j3XPz0dE#P%H{$EXWI&w0dMhxtX>DuprbqQQ
zL4(MPrf6W0UwE@=E^GczWLHQ08}7)uK%}L0f<idmQSL)*0a_plolP%t=FQ8JtI0Ly
zc_FA)Vr<|E^pS=EeY%J5*x7YQqL1(Etn)fOwQ$(}Od}(RB2n$|mfMj;?Lr1+o<tmr
zY$xVp8V0P&_I)UDr8)`2nL9oiZb0fQ(B6soX7c;~@Dz~v_R{~2_gIMU$z+3<C}BT8
zO5$9JLO|7~hlwEAGhq^|&vo4CfzNzcD~#x<T0gBA#KnU)Hvr4!gw16s%a?WQKaGx#
zZKtA#)#Dn1#sWX;I8S${M5A5MwX`9F9rMkN^?Pz^%(<E!UYI+9iDBoIL<P$t7)b%H
zA3}OX@5i0hy*(!|wMCk1B1;vida1C2+JE7VS5c}|8M5`O8(_Je@oazId?^)jVvG!E
zft(mvepufA5oF!1>No|<Qgw7Z?H^h!4&oDT^dl0E%<YLqx(!v^%W*10P({`~exE=1
zto99K%t3g&YggLOBww69a>t3Sej@W?45Vd%+lRJ3odGT<TRj2Gt#9(>>YUD)+IWUk
zcP^Ts8!jw#s~mrS_A)zg1a1-s<U@Q<+5-T_@hUUVsGE&?Tz*1140y^yRQ1#^kgMj>
zjT}Ta+iQT;rj67t6^aH_O+TvC^8UP5*go~X?CzDm4lI12PqtEmtX1qedA~+01-Wq)
zF_0A@3uIGQeb@@>Sl*c7&2Ss;VVrP_EU7vd0EtF=m#?0w1H!LLZmK<A6cMKu_xB9<
z#+@(sJB9IS`Y$K7gR}iD(!0_ZEG)x%JlqJ=YcP&IFi8zyJ~D3+a54*c>n|KV%fU`J
z@A=Er%TSg=U%g*qaNEC=s=?{dc3ecx7c$;`aGc}s^+m?v7OIaW_TkUusI5Ai$GfPQ
z3)sv2Q#i9?cAp1K0Hc1AAsH^jQDfC@R;*@sAd}D2mnL9Fl-(P*eVh=WE0103jV_n2
zABJ~jBuxHJoAFu_ommrm$sW*2K>h__46Q!7L;$%Uu1?4sa15K-1b%Pv6bso7u0xmV
z%#Pnfg-d?P4ebn5-r}1(SH%-)WitE~ZR>NvLC<_%*K)MToJU`@{a6-!9D~x#KKJ{|
zsO4Sqt#{g6vOVVe_|F<S?k+XLqH)n4xL0Kl71craIQ<bwSNu2Py{g`8a6V!`^@@dq
zr9_P?0x86IueGq4_=;lHn<{{;%BheG3p;LQ1DW-i{d*?m0O$zCS(WEthC2PFTNdNm
z9c7R*l*AdQpl<hv3eS;Ngets;tK}N2=fq$;1mBL5@|?I#(C!G3v|J0*yFMX3XPyAq
zrr36>=+E;e3mD<;-q+xNSmN|RAN~^!iQ+j*Sd10-HGfJJSVdXk{5<nL@Y7v;!z0C=
zNKgDU0!B=7x)$0uu^KQ6muyk)|F2>9e^ojvEC_cS@-7thwr#>?O#TZ3){D;(KO_ui
zwR8F<gojEpcD|L(sXH)Gcj7om1BcxTxFx+YgM&A#0<i8}=!A^r=6KM}&>0X33yg=o
z{s4jy8*=ImXFtG-%%~Wzd?;SQ_G0ueH(Rna%`HhF5-Mkx0s*i;XzZp}x>rrdU@7Ba
zH-s2O>q+!dz>=YCSaygbUb@c{N0%o0p|O2l@t!3!kPaVD&S|(|+-#3Czq(87L{~{W
zH{J7>&fG?8Hlw>K!*Sy-_TdF(sy<i_&a(f6RhfEyudS9+$nxv0yqn&}c}lQEpVzP~
zy#GdaVVObhnK-pHz-8yA=v4WL^ZCr*_v)J2US8+$0XJsuhvJgli)*WOx*oHE`1ot9
z+kI+A;`hd<J2$01=*%e%?GGZebS5b9Yy6V*AI`1E>KXHs9o^Y4y49}};XDqfS4A`C
z^C^;)OHYM~88V^~`=e`K+$)8<CC@S*c#;!&u<K_l{>uR3N&Zhz=ko574-l|1ULbT~
zBm-zrG#6+&dmOwhzNp~I-9<|KmIS%VhgeIb`Q=PB*RqBb|45|Ki~EV05kxls&d$K~
z%YTjT;Q|#V@y{1*c5-zHA{Gq;^sc{0CNch<TyZlBugyeBaNhuz9N9<gR20Lf<HoOU
zhA1V`F*Z5Vm{)A1o8;|H3d2YV;2#{fQtILdGzTQU7ly5Wk?F;U<pvy;H?lqD{XNoI
z4HQ?j6mK4$rY5qf*IB35VV=@K4OOa3MGMSl8IcV04um)Q?d7E+S%5!&>Uyu)LtD;6
z7q25k<zM7HrV0|O&wA+cEJu1tgm`Ixc>Vy=oYA6Y*D)3FyDVOP=|$d<?NyNf&jEX#
z|M<5Ka~}KP%3fm2$xr62!E!{?B<GASJ7EP3L^bbU`gK%^c5-*aCU!K~5}wy=^pj27
zBSQOWGgZx){c%sScp$N3Jl517Z(2O}LuU^^e@`?v=Ntu@?WEnFtaF4+4ITffBp2wZ
z>|cgWgI%vJeQ;bEW+=VqS1!&nCQRv3L&!HBB4ViLGkxFd8J{7ZjAPK$xaO0MJddX#
zTmxsM%#y@@`bW2jwI~9f&J^Y2`?iF}qA$*G(s$km^xtr3$baS~F)gI(ZyZOfYI1n%
z*SWo91Ea^dQ&bQEbJL;O7bqXCX|VUfy?P-hhd)#H4`w1a04oPNJ~wRvJTotKyHhJ?
zD8$INeUyPyP(cyVKEGx03M0#LyyJmt+|xq+$K#Dtj%73*1+)?%s-+dFxM^?ds%pdl
zPY7o8*}eMILWo>K{qkiwE*pv6J6Qa`ZkQNr6CBVI83~L!y-8hxVXuN82)Mjtgi20%
z71&Dh<n%>#@D(60FW}r*V`3j1(Iz--O;J?>?KezqZVy>J<heppTzVdr%l393MS<om
zIi@$rZ_5BAC`HYd^{Ls0rJ@*WdZbs7rO7va6+T~BDNNvBnHi8y?J`R{@bVMS2R;AB
zea?LZ)fc;SGmoPGnvVk}tX*f@dNJ=Haizg{vHowMbs1kUZz;^;UmZ2WTKsv-qBCS;
zfS6$(IVqvAf!><A7wp;(+WRQWS9cw-+_a@9rt!+kUMB#_d`mca#xEH!<63Go6-@LB
zz2Tb!$r-5y{SlG>SE<m3)43jy@Hw%?#(9VKZ(LjlL*ion?Xl@FRk<Z+teOtaHj2_s
zCFq^uB^KU7su^JHzOYITE;7I~|Fd*nIe+^2FVER#@X@iY>$mmsZw@OgQs7@4p6k6{
z#VYPyyR5Y)rL}fnvBv5n<p*PV%2#`W6TVb;`9-_blRS_z1EMs@2YI2*C&?5c9GGj~
zmU5uC$N8rb(eS~qv)k9{j86M2Uf&z{z;b-Y9UFU(btBiRPDC+i;s!eJRVNX|TjAoO
ztwKwDu?t-%{5$QQIiB7-p{C?vIy8&s7MbZ%DJ`h*0CRNumM6ofXeVmBeCH3Y`{fLp
zF@3<)K5lO}Pp*Jc@SJAd4b5{%#Ur*Ar2S_~L1G}Ys@{kHv=Yh=$MTj?6NU-;&`X(k
z=(chi&x22}4tiH!2rgCNxDen#TN1i^B6Nj3QYDB*g3eb>IG5lV*=Z@ka;l&`xWSsD
z9r4f3_+|wawq~!!Lq(<1z;K#9c&4sCzn5Mj26Xu~J}us~ZLdJ#v&#SPe8Jnd4oHd<
znjK%<`qOY%`})Z2wW{NeZeO&zDB*Hb$HcM-$YC)FcR2jAx0|s93*1D0F0wLR5NKEt
zshG$>u`wJ%Q7uT0KQ<pLbLcv%$F5uOn93aT_rHQaA+#7@90ggtEnafgu&=uSMTRp4
z&vXc8gUjhC1IS;kDo<^Ye@_ya(gOe|xL3@csWu8J1|v)-16^2Z7Cy=VF>|&J3-KR!
zU4Qua)i8x@_>}A%jeBn6m`hSaB_Xegp3^V@q@}BHzT~X5r}i;)R2`swCp0&0&g0K`
zN$fp)J5^scsCLmyLisiamcr=^=N0^%^gXn1+V-h%)<H<t1vX28p^ocV7zPrRK<r2R
zc<ehyps)7skH(qqY;#MjrgX5ml_gc?f7S3uOuuYba=f-dJgs5B7A(EdIe_pg4#6oE
z_PyCJtz13Won(aUmnt|s(F7V2x<HTY9qilpwtx8%gWh~Izv`12@7}*KIy>tZKg*uy
zGp&4^1tSri<8E4svWWk)KI;g{gu#8t>K**=Og>f}sRIs;aKS&WQoQ|e()lA#l@!xu
z5|8GFP%iQ;-b`dR-`T5y7~6aMZ>ysO1oUBV++fXxj&xZ2>uSYuJe<Gwt*<FG73?+h
z2Vq3n7!b*FThxfI@8Bb6+JzJ|1UJF?d&Up{lnKlECJY7@wqUX!78#MENh)M<p7F4p
zp>uRp_@3+KfD^0Q%+!gO7~@Fr+mLVRGbPqDBLT>%rN6h1sA3gqrccH9>9cwc(q+4i
zX^*X{A=yH~+b~%9HQhIzJ(_j+eQ}lGH_q3OPoq6K)GUEm)A&BE#5^KAqq^?u_T{<a
z1-4z?C3qGso+3o~;C7GPFpJNO8zn~wOsk&C4qK0oO*<k_ziXGYIRpaQ{KOkRhwKoG
z*bKz|S^!?-a&W%C3Rc<|kZ;}iALh@I)rTFp^eG<M5^ydw%0KMkxmZ<pj!7OFtgvsw
zg|7OZujLjnh*gnxY@kH{1RqZ<Tm=g~X*i7(%0-vXDDGge2<nd`L<oLpf;-0&Hwx@p
z^qZTc(EZM!jVf|e$KG#=BNqt`Mvde_lkO^QTRr|<ANq}2+JY!>I)(pOs2$bK`~3M|
z^})fG4e9;T$#X_LIN_neECHjm>Uj=YFKKD|-gd6czBP}Y*wom1u9~lZSA&1+EVTYU
zTEcxL#<wlK_~8;ft@2u1y<BVk%Oc=MEIFMjGJW}ID!ZB+ZG7O#5vnhrw@L01^K<nI
zRopk8@2}4uJ%e=JE^f_@Hf}*@R|Js9P0<r;gvZae_amsUXPS%k)wnC(HPvs-Zk~f$
z^qx7xA2GY>rQ(>nH~!XFtiX&}&BES2`I?{W(+XC<s$2FwrqXk$eEfdd`Hp7!a7TJ)
zkn8)v;?AxW!yDpJjc~`Ll)?O`3o+$h^<}&f@0|2_N<EgbWryb+`zi9ySHjNnW%<uF
zI27xV(zA>B(0FbVCTg>qQ<I>b&*aODnS2xANgm%btdcn7+0UIucyGm@lXm^4yZL0S
zL?^Bt=wjs|7dD+>OPq^%u&*vd(^p%?mnEc=!|iY4(teF<ER`8*0YbTBc{n}tn#o*}
z2Z{KS0j<e`MgxUxeo0M&IvxXCX0W;S*&)u6$1nLl2#nAiVBdW74*zqP*U6yGs%-ZL
z`t$8O9wwE#S`yFcB7IIK*Y9ssj}H{fKLe`VrZu}+<&3jN6vI(sPC%&LRd&ayn=ASu
zCeTJMO3<AV)YiDD^z1o*4PrF<?I~pN{hU7kMdpay2e;->32NullLmYv3`tG!w9?1h
zLS+=Tk}H~a|BCj@?2|xRBs5ESYI!l9eVLsY`UInhWMBS{tqy>Y&F$~TEc}F)6nWq5
z;JSSm`kqXha6jUyNkyNZ89Ph>CY2t%X8;d$;|Hdr<Bov3>lF=#!>={oo+{sRu$ilL
z$Cb+{KU+oluXOtc41VFpRkw5&F2e`%Irg<f*WJjp_PuXV)z3kbv!skg{`iFD;{H|e
z`jVN5u#m;J$RPEKtM&8fbNMA-10=^AzjJbJt0|8+z65(h10n~TVXoGE0g=G^D3b`w
zbk)hK@Qm+BF`gyP>f(m0`cjt75d87NU~|oFL=|RcV?>P*$9Fv55|&^?juhIv4n;eY
zBlXdlhbYRk%u&1_MB{n&MUn)9Ya1!m!A*oJN1HK;P2(FO#r~bW{5Ot-wUj#=2ZTC8
zUpw`tF-(<eayfTI)-<@w#B~K|Wm-gxav{NKs-tC3iXLd=>BA@Hr^x<z8i>tVmwQBZ
zacaj7i2i*jEa#`#NMKRFy4cDVTufPwNWi3-s78`HqS2Y{StGTforRD!9jNOn%5C>!
z?ASz{#=uW#4>SqJ2Evs%vE1j4I80_Djsn9WtMUPU$HzMxIhk6_jux}PYu-XFnD`}v
zgqY2NPaBmWrlTjlzQ)@`{2I!*-hM2dyYv)kWh;0#AodqNnMK(-s$k$E=zKm9fjK<I
zbNK8pdy5~=Y`f!~4E0&lIF%u*7!=OalBl&A79~6hi<#8n<cR3vxQPb`i}yzhLf2Z9
z1)v3xNmy3H)xly_pEG6CY_+Z)3pD!%lJo(l=@7-?NXeU_2S@HRH+(*nv1nn)I@;C$
z1##(rIW?Wob(1|}#qfNI`jSW*;nMXmvF0G-NR@X-=B-Y;Gn(z4do+etEas-^j)>08
zej)GHq!wdwukZ!o>9Zq~dQTKr)5UvBF5%Qf52;pYH<!u8C$C&DsaLg|`W|#^wbQs;
zU-2(}yR}QT6Mgef6GcqOgxMk&N2|+}3x}w62~rbdxnDnm(Rnn!t;+zu!*`$G_?Pm`
zo%?h%R5trE6mhur#r+-bN?3ZObS84x(qCym&rppp#Wby8G96l(&@ME!jjj6T-54<M
zTM%W)b_mwD&PDE4H~&?Ml^^Q&+Ep*RrREcf(jiv#3H<bXHWKR<HI9~Piz#=APoL*o
zhID88zc&KN(B#33*ebYiK2B7lydohJnXQrlh|O)4JPo+Op67z>cFR%%RoK5sSHmpM
zs5HJXzBzVtc;F-%o?rgRM%VbwTX)<YHNq*?@^4HL<&UDN*}O9iGbV>><Pa__H_6vX
znHKVIw^;_$YeP&-;R@4S^CB>a1#+KySFZ<p<XL4L>4h`?82uPyWDmV0RKby#b~~_P
z5ZrdbV|sv&5*`OGR&~d1cWa8aU>gJGqKA-rQ0?QbuC9HyJP>3Ho=+#(9ky+1m0ZB_
z4@aYeBdtdyTg43)fH}Tp=S?^hmdW8zX6ZW@cGqg|;aDvJkTKrfew0p;rD07a#Ly2@
ze`l`Om7j8!ky#*Kxj%J5U-RvjB{?ztNQ=wZY7USo-j10J*!W>!HhU6u0Mq|cu8rhS
zn|*hz7u@}G?xevEatch=`%<ozt=8_eE;}beWc!nd7W&(r#l@z1-Cy;4s+aH-0?h$}
z{I6R6v+yT)+C?o5XPn@o#s#MQ9b46nBf8^^&5nlrIJ1jm`TJf3Z(OWki@W@!j(b7<
z8=ljnm<3#|J6#_UZMm!Bp+n!D=5WmJ6c8sr2&MHQkKS^n58<JZ*N5%r-YCC52ddS^
zdYnQEDmlikd(pwsenN!Y)u4oVkr@2F>5?bwijJ63VxxZnP!&UTikPK~4Hq&>@#HK8
zN7#F4p!V6TLqc<Eq5@QA(BAv=+6Ai35S<0hvYl~LBf+VS4A}OK6`YW8zy^DEwE#ax
zxen)5hRxS~=r+GBwbb*0S^7!c@YBt&$dWvZhe#oy1$%?Vh8HmCxr~=6(6GG1Z)Yms
z5<K4BFwWiColmXMqOCR;BZ5ys3)S<RiV5Pk-M$5Fl+~z;ebmWEUV{ldQ^?tuGre1N
zgWr}Kiw2H*BW!He@dol1+-#k9x&>iHMy7A&JJLA5RIsx72|BUoefAWWIf#Ub@yt3|
z{y>^U9{qC9lMdpnJ>fh_Db&%qm5R*nzWS$0<zpGY+4oDx>~QZ(wvqPy#HSQ>f>=9i
z529#6#^u5ASzS#21t^>D(KlK4ctj9rFQ)yis0BaK&0#dvpd#JIGjyY!(GKgCX@kpq
z;~(P%AI}G8V_1<J9XTd(4zPLSK&WEQKI_8cp3cH{Utlk0;lP{G5$!p7zCuxbT~JSP
zrkoKnL}&Bb9`Gfo=M2(!?2|px>c;=9xj!-4(j2tiQn0f>rFm18M*t9vyx;tLjw1St
z1}jRvLUPI-wtvT^W33hR<pWt3?i<k}(N<fs5jX-qYk!qqv0I50Lt0wOIp`ww;}#q^
z=XPGCEhQc#W(YM*{}CbXH5=Tky-L63U_ZxSUt2&YzBx)tjV!cGnzP=@mTy=E9u%4@
z@Q^P(T7k<4@an<@l=jDC9S<`xcYs@2w*Vp{$k%WJu8?E20^bUUY;>=1b&<nAj3etk
z_q88++n9jqB98PEH;30sCTE!<4ie|Q-z<u@NcWyWivE5RH7QL`Uxl^N4cPWX3^pGb
z9^dNLy;CD0OG81vXN4<$V#&GIp5auA+#p9$8dC`0v*aCI7gVF!5gXsL76fNktWkP#
zPY`=;{97k^9FKms4+$0><+oqMp^X;k+4kG*Zfs^c15yx8mga!Z&zxYY%4=VV?8^Bq
z{jZt#$6Fc7tQfmUHDhA%BxRv(jE?{?n(vbJn4;2wD~H|0r{E8Q0lQ2|_pT{#`0Nd+
z^j~U4rx1eKwG5vQ!!vx7(FyN<%Cwk?21iMITn?X#feQkQLwwCrlQpO^o)0TC`XF?}
zRAoQf{F}G(9^NEW(qI3ZcVZ~yPz%UUyI8!?Qj1j6#Z@d<-vZHpXH-lCDzPIIq%gEX
z2i#_$(<c_o_Guna?M9$ezgO@eanoO=UA=M*^<*P*?12GRUfkFO(JK|O57#ehS$_^V
zDt0=QGpwBb8oitP-botXb~%cEsaz|4h-&*LHL~|sa-p=~-!tAC$}mV*UbY$wxIBz+
zVM1USh_sG#Zi_t5;nU+1?rnwL$n&|niu(VhLi%g^KZM;z(2kj__(;9+Yeb-5r!>P`
zvuQ?p6(G4&BaYX3GziRnE^8+mmg;?ps!78pAx)b{jr8cLjpY+Y$REbj%=H37*1RZB
zdocW338o-b6@HMnZutrjKV7N27`h6~QGZ<Td;KuW_Fbp=g;EH^hK_3W4w^H}<L0q6
zMSJ2$e^R?555Zv1hdW`^6M>R!@Ke}3o?vUF2j@)$OAAsGGzv#(;rwNCXIj&d9Q-yK
zBo_jhYl-?pM=T*^JCxsGsiI(j;q@NgFAv*N{S<H(dxt_Nt0E$A6iaW)N`ypLoM%cf
zFyq=)EeWTIci69}mNW`Z#`aK}1!ED7=q5phmTI|xrM_B9IG(Jb8llDyrno~T4+&E<
zS1vh(^!j%a(t*;h<e`mD`pyGeYqO^o&iozS<zJ&b;>>}3mm!%F+0xse_|Jgl9#8-6
z-8<21spm0gkwHC~UVFVHs4oz44tqz;p`@!z9^K)A<-xTE6~iM8EAqE?B=<>U;w1`I
zjAM_V<dBWuWjp8}Ng8&$jDQg#dxQq8Sc!3%QX&5+9uVj)r(O(fA^?pFeG!9+Ph&=m
zjx=$~-Tz*hsn|a2_;lt5_~Ng_BWgn)KNY14zW8CfN}<ixmtrK*4(-)kBJ^bNZmHTF
zB?UED_x91oT{4l2IoD$$<1k7jSgr!p;2>S`g{ysLZJa$8XjB4oxBI<kO^R$<FB+WG
zfB=*?X9roJqghdMcqXr+q~kYspJ{=-V^X-Yac04E$K*-uGO?E*CXItcO1%=~)R_*%
zaWP|MID_8zjAEDZ+y~8H9n%rwa&hVbyKs`s?tSW5Gp}o#-vc^}&JvsrL*i&hiZ2MT
z?q$EH-3YbYlv!y_4lPy-*sA((3oI17UCckteRDcbEg<eNW^a66<IR5-I^*5;L0a4J
zRB4;XXnu6iuyibh5hT3_7&kjwV~PvBzuFwUe<Q<LS+I2~!~3Uvv*H(rB8eYq+)n1t
z#q%9fTj;)DqY+k)l;F1X1rC#~uCZD%)$?I@-{>vCb#}33S-(4-<sS}j5c;H9pMHu~
z_+~V-BZhD|x@Erq4a?2P6Pbm%&DRw9q_?Ew7RhKQOjmXj$pOmP+Z^?IJ9fFPRCgaP
zP$gvT^S}mEZ#&Vf6+$fhEAf(|ND7i<#gf}XA5%P=4mSEje-4&zNTDmc>$7X)4M{$-
zIBlMs`}>&u>5W#WpdvwxGVMUp?|H#Po4Fa^aN~Na(N)K*=+0&Gg9c-7+7lfhFvlig
z2=2=#emJox!57Ij+QrZh@;ngiNXvsxL^(X1Cw@iJv0q3kL$JbwTl=i56CQjt?T)^O
zYU!tP7%{Q!X2S>OEAW)9eI3}p?I1z>a(2A|u8^kwEPq{-QcH`C_N+U~wB|(?>0(yV
zdI6#yAVb+4`SvuW`L~;DP+Z_Eqb}X*@Zidq604}x<3bij!RW1z7bMszkoCNmg|o-2
z&KnB{=QTMk+BLgNn4^K)3M=Q9lK?_Roh!KbqwEy(S^GiPpz-=*j;aHug^Tys&5*%O
z@7?}uIjccX3Ym#lioNN`LQm`>O(bz;&(r>JulF@s?j5fy-$tN3=Y-?-%yr`w3*tJ_
zq+9FAZa~yI>Q76Zzszh)oJt#if3ZD?f*k+q<E~FeZdUcD>1@p2J}As9?uI_lbl^T3
zZfPE~xH38)B<bLd%)Dn9Vjnud{yXH{9^(~3O9#fXH073g?;|X|n$^80_IBpkoMt8M
z!||jCTuoe)a=F&q-#*OFhJTQ;;<Bl}Y=C_wme%HE7?P_QZONT?8H;8k+8R$qH%=l`
zdhR#ZoLo3QviGy7l{Ju>#7ga$qg7-5J;^mU-FR_$ekx(sgGt!a#FMoE?<v$&9o%xG
zNOTnyi@%)rqz#U?u5?6e$3g>(f5lV=?U*0mP^}mIaE}+T=f0~-1je!^nJbQ`o$$fg
z(LmBLHKt+wCCI-NHHNBs^>D_e0<J#lxvBj{mOFcmnw5|g*jG!C#u*iRaqOcyV$0;B
zw+>RbWu^U!zl=U>y$Q|Qiqqd9s?nf``OB^`Js*T_f|JBGj4LIjUUodo_IidNVSr-O
z<PB`0^(}tR*IjMUJhAii(3qq{#Qo4PTBnj%<orRkVQ{b4$kLuE9oHRangxMVgCsw7
zgcbgwT7*2qbGs0pEAeL8NEnB5@J_IWwmrMUJFzOwCK~AMuHfTbo`Q7neU)n>^~8rV
z9Fe!R&Z*<4-D$%0WY;irT}O&1dUae|Nya!<=k-OhNW#%`gYBS2B<5vA=u2{1<TFxt
ziof~oaf1PlSh9%Hibd|>C7}`(V#pT87<h2*cM4|sIB-+a4;DDcHDz<#khBHN4)uJ1
z+2Qi%6I@`%%;@0_$jkfr!y9MR{vS=}9?#_e$Nfq|PDyemDJtg>b1W+=A^AGwG+B}J
zVa|-4i!pMRLr$q2Mw+uZn;hnB&gWB3vpEbK?yKK@-+%4>Fx$1q9=opV^Lf8tujeaS
zR7j>WpIp8`)6tUoJ(9Rrb<dajF}^|0*Szv*Gakw$dYw#mQuALj4%;tQ>U$h?&?%--
zBRr<+Ze#gn=OsL{oEHEf^s#dJ*Pe!!=hHy-@Ge~Qc+F<0x%sVn8yinjE{cPb0hPvp
zsy7ss+J?=&%iSVJm8o<TvPGX|+(LHyTFEK4smh`Z8^YLF%3q_rtm>butuMa;OfeMc
zwKw;V+2u3pe@FIYasXAn0hFrOgz6>ZTBBZW(?`#~sRyUyfAPxq7jbmBlB_MY8y+AY
zSps?6kxU&;g0J^U(j7yxcRtHKOT>FvH!H`Bd?INymRWREf&DtGSe93~hx4D^kJ(il
z18b%@I#RW&pSB;W-AD2Bp0P<@t$jNJf&uSDsLItg@>~g6Jvk5$l)#vQcUe|0zZ*iH
z=4~>0a9s@MI@acMzj<~BHOs}^Urj!y;k+Dg<&Qrt4i_YeGzibZi3`ub1o~zCB~?}*
zV*XyNeE>KHBe&0@R}<{oInvx&KawxjBvj<B2=vNuZ%Tg{zIkjc?e{o$nFGq?Q&Y(G
zrz#|+uDLqDxtrE+i@Bqrg$A)h-UG%ixK`-(P&#^&L!`|rO&{;E{m@awQY7D!_bm)p
zdZxl@6%7FU;5ElKDG#;)O}@|#t40w-`<#--5gJZu0Zeo*jZ2K(pg{wJT6a%=#9_g}
z|0<AHp7-rnftR~RmidZSo@Ab^8zW5duXbWc(#}9&6^ELP--bq&(#fF+Vk7PwbQAvr
z-=RoY6Si>adlM|>vArf=dK91)?q}q>d*t^OFXF<!9Fow7Z}I(7+^wK_|9O`65*$U%
zQAXhWt$TyGlGNY6S;9n0-9qMm&N(ivodxc+xJ!{5fC$xC<7FVAFSpIz6K;+pNtP8`
zd*nG(#g5GSZ{>ZQ$T@!O<ELMk^#R2^`1iZuy+cl=vm6|rg-g$;Xr2!^J<vNwt)R-x
z`Z<S4Sfb0d`XpFvIE8PT;?=9y;-ahsPv1j>`dv0=$PZoK?eUYqqiUH78k=l0fs=>c
zOve+f2wzrcmdr|!%>C?&HWPltnlA2HYfF#OPnM1cb|$HA+C4qW-nl#IbcPo_Jqljg
zynRIi(e)wrFQib4%N+kfw^s^|{I{SwF`1k7MY@)QNunwt-(mT1S9=f<UGr-7DaCc3
z?QH;T&S5#5T}mb7zg5M04GH!R)9!38&uoM43wiV1L0Ef61ZkNp{eWon1ctQ0`u+X@
z?Co_wqWCFt)blO6*_R-^J9PAd@N{-D252@z&&d~A>-uawvK+8J+_(rd6m^>n0Cd`e
zA1szmgC|W9^1ro`X-}c;L`z<+m6hM*pQ6A6sX;Dw4K#J<QFd7rhUYnduiD$aPoJz9
z-^^59UDr59bHL><VPZGs@6P^~VTt87Zssj;mD|SKnA5sk<145ZCkw&E7-I#)e!LF<
zfF@xEsxI3wjSX!|?v-pl&%RL0ht3$Pstx15-VN^@cGsP~tfwQFlPr6TZj-N4Q&o&|
z<M+?|ym&pOOkq7{1OvL1mG0z{*x@z;>Uoxe`5il$X<l+!ixg<b&)$5!rR^#y>u3Vk
z&{J>6H}x_4UOmu7_cuSG)4DC`(c|f`(k!#+e!e@%^=;wRT`&*O<>#Hj2}BZP!u&?o
z@Rq79v(T5Q8E|tg>n!v%!r6;f45I}V{8gyd+@tq*T(9n;_$h($bR_FUZjZs(Jp{wy
zIZv-r8yjT!ol$~-zrJF!`%OS#hx46nBEX;poMI*4gvU>$BChnfm>x-Ue*D-r`1{j|
z=8l@s(TTvfEbk^dzGSP>ThzFcAU;<Ut99CmhvTf{GgbKA0a<Djr82)J3z;>)2<Od2
z9txSA9TqQQk5ZTDS0nvgN}OdmnK4d#XrF`!F#UBnDSKz?=e&1D`DK^ErO5~g<7A6K
zMfT*YP9V0@vThRUwTHPs9!h4I2c$n;Z>zA5E{`(HFh<)lw&YBH>e^Rq;wrj=f@3*-
ze0Xr~S?n%QY4&pqy`xJhMtQ2|@HcAVN4{s5VZ5+}0Z%lG&+;F_&w|p?^QijMA4P{k
zd8lw@Lc?#JXT{KEoIlb94B=g4dZ)hRcC3nHw){}D+dzAQ=hKeGXHijnC8&mjC5Kpj
zLbM<W$@dpt!Pi@*M3GXBu3d-M<ezCk%!UmK-D&$NQ&r)D?*0%Q!g99CmX08j?yAxd
zEri2*7Xx4Mhe_ZoZju`Bal8vOYCp(>E?ES-30@H&Hgt?u!i*+SV~72ZD4mph{<*PV
zXTC&E)uVoiUXFDZ-FE=KeV4}pf*rrH?_TCjquR-DUih24>oLlinXV0fQ<bbKZ1$fD
z9@PSz3@IvNq#l{qoRk^FxK?ZyEvtR3Zzqz^*FT^9WqA$W2Z|)4e2*J5+j3`GZ-0?)
z|KjgN$MZZb5~20173^$sS2g6UUjzB9F)tGK7?z$PL;N@RjrywGvSH3uUjX>a*)8e(
zTPhOO6Z6%ff4yVZ2xnh}Yvoo1)mKuds^*1)df0lw$->7OQa;i)7bQ}Yn=^jT38ip9
zV*GX+HmF4^ncm-q!JqW=3+>lP4xl({vDOwn(E^#n3_hJZ5vBCC!fo|JNhe((l&SCq
zm+xL>lE>&TH6NT%uc-MPYkA9oB@NFx1yZsYxtcMk#p#3-;InD0|FN{jcun%M1ugjo
z!n`E!04O!4hF4JhCqS}QQf7F$`%ahSOV>L`oyjwoV2j7s-Se8XRxr<3BE-DE4Wz(F
zIyISQ$BqA@ZX0vH)?;ASoLje?)tJ5fTF)xG&wTpjC<ZgWD*Nxb!ra$65Q=bU*Hw(j
z?a;0{fKiEzV0DxV?fQI_I=6o5fNw=h?Cc^H?Y0|PoDh9+J3#wggHIobb6Z88*5G#z
zB3xNdr@8Y9&-0iQyDYxl@Gg~_Ws}uE-Dl~dRZFT^!IeL|S7xMl@V_)|C{Cj$8I9yf
zo+L;0qJx)t$f+OYJF|<MsXj0tm+Y=_eGF;kf&;PwOpG#_&tgwa!;Z@kS0Y?(FEn1C
z$dg&zED`FO5Z;ZOM}^0N?2tl-4kg$5VS@s#NPhm^ZG0t*^W6Ak%aDv+LtNz4WJ`$*
zsVVG*wpL^E6pt_~ldtrJDjUTUw0BI2TEjQacdH@7|H7cf^rtQWW>T-;xqVE<zgI5k
zv#Yr;DrVX0z=o|Ye5W^-`Q$H@0&~GF&WD1#3N6uo<!7f>EaNkJ;orp9m>DpYn<p0~
zi^Ip0&Kk1S$`P>sM2VhK5AyQo)oS(QqIa1r%5|SlfA-^(J(V^$-Ge+4`3HNjvGL{8
z^@oM9i^_E#1NabF@lZ3$T=f$zu3VR{(LI=vW6fhYD{%P&XO~juIX!x~ldlbimuAPw
z<xfq2rU&#x%=FH|MP>~45-v@du8)2L;i`sRGC!R?n^$H<Nnf!1ZwJje>q}*dv^>NS
z?B_B-F7BGuM>x7&5&JA~1feX_*!Pmkp+GNwqP0kchGmv*@7iyk)lI-(=G||gcwsBq
zXyw`p#nXn83DuiH8It`h+&9gF3{e1V&gDcOC9XyBnGnW#zxATfnt$uZOSb+i$A=WF
z#ek(uuZiISbUAkFv&o@Z$z~4qEd_`$pVPb&3M7?*_&%?k2^I}oMy#hhH;{wrUp`<Q
zi!c@}3Aj*SxnQXFi>@!4lj6{g4Wlz4{t5sfV2iy2=fxCOYP97=cRnQ1x#%j)F#J_8
z5~v5Auoy}1Or*aKTB0#gTj3DAv7jj+5yL1*Af6Aycu5|7XT@mQK=)V1o@B`$3eb6K
zO?oXy!Wuhamw-|=JYOJPQ{vtpx@cskX+l55BEs^~9C}t%MN#O0K~FH|%!{tdz78M%
z$SHhu%i&dDqwQapy8kHCs&&Uj7Jck9<wc~77_-|v^=$j4O66KE^5e!Bf^l(r#k(ER
z{{RRu8MES8&g%G@9PO_@aI<+?YRitNK`sZyKO7*t_#ugxcmb8kO;?;jomra|6Z}^M
z_5isJ{rJ;4n)eOubXR;Nh)TQXi+%RR)E*v~skLD9ZTA7J;)>G$APEoOYXEX4GIYmx
z;)@9Rg8r0|Tw82w=^<AS?UFmm8Yw!9|IpnNu2-=OZ^pA!_vAnLQDBPugjU<-nb;6P
zSXxfFpikfYXF2^tX9s+}<FjN5mL2f}1YU`38v9H1TvbcVAX{y^9-eHeEm`H`Kp1@k
z?|};d9U{fUjw(om@au5JxBx?J-ZR4hUD1Y|G@LI|@V;7M!c4zdOCXY^<G770({KN-
z=9U;zkgNNLF%f(kQU2Xn0?~snWmMD2+V64J3GHS&obWtORc=va^AcYa2jGZ&1SJ2P
z40_%?qM$YAI$~g8Ri(Yt7pb<&+i_16wL#YrqD+(??28v<GTk_+%<l6&=)vcroi~}D
zA2oCF#5b|ll*`^B{&*&L6O>`g>JqL=wh8>66UqS2<K015sU+=OW0k8-87i_M^}Uh0
z$}_E<_570e)g83d2}$tXYVwryl?%;cZ-UFK&)P|BPJKp8?j4+8!|VmcY4%(K4Jk77
zF1)L4KS03~NQNL@or&+0xB|S0_*8dGxwttH7F@bIjrC-OZwdQtb$!C@muF<G9Uad>
zo8J%vRL*|=AfK|V+~aXvH~!gZbizNb@BlqD8{Y#Cy!GPZ!l#nP)-@XKLv+RZ<Jsde
z&CK^WVl!4maO)^lLGVk!UX@xDL~KR;Mc7r*QANf9he-cB&ofLMLFE28toTf4jKp@1
z7YVb67brtKU}0p+aQkOv;f)OUv3?+s>bAnPk@deyQT%N3-rmGp95o?TrQf8G->i+?
zwiMi<BoU~^Q)xneUp%znUAD~}gU-k2CKas+$+fm0Lp+Oo>1|qQi75uVFCX!{w^lwB
zGwucR_Qd2iK3FROX%kpx(DPLPb=dQNRR$>5>y<XDL0qNGRh$t&EfXQpYj8NfiE!qM
zcmy<O$A)ze0LQ_P*(dJ*S=61oAg>|GM_9_d{~#-Ak@gkCnSf-mkI`bHcN9_C##yDP
zTyD<z;ul-P@q>DSR0~VX6UK^-tQ6w3t?KZhU`5dmioZzj_Z8@Mm+0+1h6A)vhxp8O
zRpK9Mu8P|N_y1R3fsW4Ar1*4N(>5OPG}I3h$UI4S>Ae@X1%6SL+b(CRkI=LFX1%|V
zmJsQ)9r2)H3DTXRQa$wJVTw)99{`*-_4mK8+E88ReT{7gJ!(1+buHT7wKp#&YiO_0
zsJvgL$v`okU3-^Lj&<i+>^Bq5><^KAq~pZ~o`sKGmO-?D<=>Lo?eWsSZM`w0fV(T@
zhSVPeg5fG<0h3(sTn8F?zdQn)?ERs+yu7*cv#LZ>v5-8SVJJ+^@T^E>zhnrcHr2a2
zY&o#24vA`*v6Tuqt)&5J)n9M7Dpzaw$uUd3h997TLD=n2fS)?Y`!55DO$4~7P1rrk
z4SV*)`?YVecnDPWi_zi_KhIat6^jCFOouB@Xd5hG$Fv_O5wk=vJ`g~P+0y2@T-XAu
zm1b~sW{5!5m`$WIIMz?VPrI3HX>s_heSZkwa@84^b!3e9>?Sx_RKm+AdnZ2!-nq2w
zV{EkXjJKW-u;q0Y`E&<b4y@jug)5<^D3c||S+-QCew5*?_cI`ZNB!3jnfAZcwSZzY
z>KOB8?|j^n*~o-KLK?Doci=l51QClV8k+~jJX2Zm%ac()Lyw^N?R(yqsK%_3o9nY;
zvj)%y%^w1{L|ZuXCO1QUmDSXtPx{u9>CIxSWNYWt-mb_m#P!xYD=vvhMS?Yz=y=GD
zif>&pm46FvZ}p}9EePI4YY(1g=u7o}PqW@w&DRbq(JWidXQM1W8|N4UhPP!Ym*uaV
z2012NdcdD<Bk*zMV?<9gP7mWsH4+rY9BC|X#7RAtm_72dYSYI&X#CCh(jtbYQSLt?
z=x0&+Q30qH0+hpv`o@yeE{fy_`)HH;cgGRL`zuCqg6@0Fi)f#2uA}tb3EF?v+(oEC
zcB?<-x+ZYdJZtxrkQW!$$YRs%b(6MtZYRXoy4#tw{MGr6YAA^RJQHQE<$VlH#W<qP
zwNf;@qR_jb%oBSvYi@J8lQ?Da9LH8omcY0-gXr}W*zeVJHTm%RXZKeo>9^qD1EjDn
zX8xs_XW(JHd*n$S_-%GVX(<1}TzzFx-#mqq{9j%SB|fk-jX*Ga6=ReQ9X31`!Y(ae
znh@1gtj{>Wzf!-2I2TJYR6v}o4DjXh-S)(Mf711g(v-1#`-~44zgqm4{Y`zJ8;)~!
z^+n%DHlaRxn#D6&A`n;n|AsPdhugqJJiH$K^*Nqa_d&jnH2Ke=kd&zc@x0_-K*Xqo
zHbhLVDLhN6NNaI2g<?t_6w#=suh1%#47f0mSWpZfW*Yaw05VlHGF?cFb7~CR%(pwp
z^txtlLTj<nbvRFQyJ=LQq;_s~j-hJrJL2<pF<jmMKTU>uQxul?#Q-J-X`UZWO!U(2
zeSDa0VDR}6)N?-3po3D*Lx^pGZzbd(>|8qz)I2@C5D|PkOJlaLleJ~(?$jltnZ8bT
zA<K&tg!xkBRDO3@WbtO<d@<)Nh(qAluj~kqG@R^tb**u|sa|x)_`M8tWOk_NGl`w$
zorm<T3Hi5{YnxMAX@queF@y@g@_<CsY0N#l>iRf6r{wOM1HN`)bKvJj#;la8q^CU1
zhMIp^-QXVYFTY!>bQZpSzGRVxq8u?PfOwPP?J`LB#;-te!w{%GU6Be|);Z4k{}Sf{
z7VC7tgY>1+I&aW<1qESqmS=lGJt#rz@kkvOee0-SMX~VkpWeG9Kq_{NX}rARkZ{JR
z)?*5*ltqkt0I86#9dKTkRtGa)J6zib%~?GBVq204|4yB2!DO#r;Jp5Bp+$gWw5H4o
zbN!@;v&%)yZ1?FZ9Q|i<rtNl-*vx}ez!`SCsG@3`Ns_w_yj@(Ir}38~wqbNkkP)^V
zXIqe!Vfz-Ud%hmk`%(`lOOovCGU4>?d}6y~k;UQfUfA~rlf2=lzWh3`MiMuxl_k%z
zaeSB=<k0?lQ9ozzG9!;0h9dE&p5yiK=(H3Nc(zi~nJcgz*xD)oNad}2Wc#m=!_=R|
z$x@JAz@V+^Natym+E9`vml}H;7}HNr8WfM|!5jHqHXHKJm$LP_{1UhzC=aFxSA7MY
z{PgL31c}XvtlUtZX+-_o+5*nF)+Pnos~SLaMrXpyCQ)aFMt?AOa3VI(#J6KGd9Wtk
zlSW(YZ~`dg-`LG(6p_HXiu`4<iifH^vz!52=cTT3eyuO&A;T;Q^rH3sUD`gndh(Uk
z=R#%0j~%2&1DR(ok4_Xd8fD$8=Ws4<IGkWrBgXDnKwWe#H;U1hDxx-dO*gJW7;QMH
z4h3j08`f)qoy|a6pF^*}dok1&GK=aQqx$y`%HCsd3CMzq<|z;*+qY>w-hGnR%l?TF
z)x66QuqCE(<;~G!pEsAkxHYB--Y0(&a#He3@Y-fS6jGp!{eb`1SXT}t3}jAd?bk`Q
zxs!7Hq=^;Qg2vmRt@<ZKuz<3xt^9`6PBOQy_<qucQ+QR6)k^WM(OB5(oCKKFty??D
zbJRh7b-(^o%nwZ|DG$57lb@Q)Nt&}R^O40oW`2<4z@U-Cxy`9kVfr^*6R$>BWcFrF
z)S8SLzOXv+^fv=ptu2Et;vN_NjHK?W3Cd=ehofRZgk3jb$CI^Xt7W*FK-is&X915{
zYyP<Cs=m_+Z0zt3LpiPAbs$laW;4ozKA{R`0YKv{-<f;sABN+SpK5HAtM7uareLH&
z_Cr?Ccdf<nIyRQ%^2)+f*gb;hs(&g4+h4TRj>p*8Q5$VW7-@o*93wh{Qi3G>z=y&v
zVWIDOI0Gb3JL!Zj&%5e$_~kcVkG*+;f118pr0_wQfcw`x-X&GOCu&2V*k+>Y1@A&E
zwu*35NPlyg@0|BEUCa+NUrPOl;4xO(*Elq7uV%}=qV_S~zhs8yyWr~+yGxDJ17OQ_
zEu$a_>VfnOi}&HgLlksJ!0Nl;_>WJykr_MuL2aqs^UC>=RDng!!y6r5Sf4AW?80j5
z%(}MEcDW@^wyoxkG5JS`WHlF#p(uR}>-)d>X}EAk#Uk8%HZgO988FR-8ZYQy9SbU_
zcxH<YEKbqJnHM<mIohf_Y}btqqul#!i8%!)MtenXIj6nKxlin`ZNb+lk`MNaWMV3I
z@b(y<9W6PtkyMnXK8qqXp6Tb$qjkrQ*Ao=i=J+&}E)n}K!*c)?TVhnO@w9c3dkX*a
zU!{_zTcY_%2OsaFVptSgDx4UZvG~=3D2)sCdcwuO^*qtD=}@=s>XOjx@67iy>n2ja
zGxgE<n4@)*FO?NsrihmUB%n$--FUvrf0LCvQ)6TH2)^;7o@G(_k$}4`-d%6m^C{SF
z_#PRpnuHf(zJ2!luL|lb){zboi<SM|cyL}=K#zTKN_v495W{9E2G?zNNm@Xk`G0GI
zm|YGmx`ukE>%3+UCZj(g4UaRvH56*X|3DZ!E^7rw#}icfju@ake4s=i&{f8m5=?9z
zt1*`Wv>Ro&ub6b4C?tdX#eH#ac*p2iV)rNK8<V%IesX;sK{%_Fon*|Iy9YTrSl`o0
z?enpYN%xOXoMT^+%^H*Z_L&H0I$~O;EzA-=aPr1+!Y=y^gEuE757Ki0`BPE9{>N8i
z#Gk}^fC`N)b_k<R;sl8JU!^5Gby_YK!?2%y-kWX%tq{#@sd*v25rV;yaK&4kx0%XY
z-(lje{0M;=>DK~|wMs_#>?dnY&pC;zEH%SnTD?El2Ns{%T5MQUgeX({Bi-zce0Sm!
zlzjd1#Y|_=1ysyn)F(ofsHcc_w4!Z4V^bc+Do9S4v-fWHn`LQ08ZOM)0K7Huf06Zz
zqpusRIJpVJClj6<#g=8!oyr+w-aoTo&5v#pZX8$)4J@1mcJg-CoA(l9Jgh-S4)RjQ
zumDK-){xAM(7r=7ypALH+5urr#h;3ff>lr6thSZO<T@85p^{p1rNC;}iu6jAPBLwQ
zkGj3F!xaD|d-Bmg;-U{^cx*~N!%Ehy6*Ek|+ouV8qEYTx*od95(d>VfS1#&DDJoYP
ztd^2XPT^6uWjX7#nBpKU;e7l2ojlx(I}>0tE}FBE9{?s#Gq3cs%4;;uV?`DxU3BHb
zg~|`@aP_fwN7q?iejh<wm-uu}oxhB(jY5y|&mCBr6{Z@^e<+MkVI09n)c^I7@l*L^
zw;)89<x6sZ#`j!Q;Ua5IQ$KrE#W(w|4B!1vlXqEsK8M<kdM{1iGc+&~buMh3WFf|R
z;|x`HNneJy5$!;~vz98dzQv;}$t>Wm1Nfr6n0<$0)YjwQ<q&-eWj1;$Ozk|}rFY^|
zc-kv|$u0CXM+Pu$86MAZt1Znn9B@q(?KQJk4b9EcsVw>VruVT`0z!^FB5T49taG)0
z=rCggPhMMs`Jf64iB1ja)m-xk`EUF73)ZgJEjRXafF&3p<hW7$>gq>+LL=AH?}V2I
z{hq;{x)1lsGiMd{yTk>4Rl&x+xGL{NWR^uy_N>0z3>-__w=;&?>XB{O^|diZoJ^SP
zl;pc;2&SD(U|(P**Fk&nw)W0u{#G49AAu+Rk!W^3rqEsXJ%<tKyU|rx$TXCB3;&B#
z+MZCZBr6{*;2z()r+In@^F5)p3^K_}3_Hvn9KXLu07ibFSgyi4$2s)4W&x+Q@cbnK
z*_(OQlsB8bK;Yl!2u5%9u`geA%@0RV7WKkY4;M7F&cw!0Nywcl7m8vZbxT{2|J3Uv
z#D9L#VAix7JC*uqt6z%mN$jR{Xh@)w168CmzMUy*ehN7MmO8C3(ZVhdb;ehqd$l%e
z|2*j$?ens5i+@qq;UYP>dhtti;+l}CskOro%)JMm+_w6CuYaPVbbzxlgYrsMbl#kE
zpKra0utsek=U95kbRkCyWY14ILvH1;coh9z2>fsj%1(PJ2#OZf@+xqI?b#Z4ea;(9
zTG#|zx^DKv<zoY?e7EWE_vqhx7xX$^DWoT!e_NUVk+aI`SA1<B|D&kJt$F;6q7m+<
zlY3i+kZt^Rz628MYxsPsV)QMy$Aa#fB3F3a*O@buyS$rG;Sm8sOAonVIyz0cS)tU&
z9toE8;69o2MbKDu!x7T3S!tH4g|QPqMB>!m9wSFiNrIVy60pmf{O8C{LWOgwDET~=
z53gNUu7#xqHXfnleRmXRA@renJFM^aRv*(P5i>%?U;l^<dD8e`UXq7`5!i7EhsCy{
zo+LZo01oV}|7I4Tz^l&u;d0F83vY-bJCs{O_{gIh=B^od?FExKFv~Pv<u^8iPwB%~
zir*s^ZUHXkjWo8qAqQ)zsCTxivNv!4#**eYd;Wo|fbi(+p$Y$h1k5fIB2gj@=Sbkr
zmdUY!V!gdMsZIOv>E<j8qJ#0!c5R{8GX?wh&P*O!)8pxJi<Cj|Oh4FC1|qiR<c-zR
zX7z0k&;emEa#xO}tugtQMSKv^QvTsP8GMjZKc{I@tPEo8Ufz^+$LYs-zY;F!S%OUG
z>i3kO6H!yB!oHl}QG%ZnF!9X+DUNhEDkJu0^FWFNhuJ;yPO)c~sSVqwAu`2v*$Rl9
zx+<>SwmbY?g^1yj{z1XRjAr#hCamOf91#>6#6nQ}xd@YkbgM^tpQ+6&cJF}Jgra3e
zH;oKp`>fvvZ51A9WpPJCjn5iTdYX1YCgg$|ce#+YWz?P=eqB13QH(hyM!<FJSk~{z
zz^_wmMostqM%bd1ZQJBeyuEQNZC-_$cp9p~de~V8>837&Q^RmUfN&;vU<rG%@glt=
z@eJwtjm1B6>=}|(dg3DEt?E`AmHaBxiAeW7?~X&b`rlaq<E<5BTd(P}><`tY62Z<>
z5DU+V9MfiN1n*+M#fFaN(Fd$;hh-+uCG{n`4okyUfZb1cE$BOm*57@iv?08T_Wazq
zb6#&0D~>z+9?-bbFw^vm3h#Ceq#WHY{k77-nL>^GR3sksZMxdSvTi*GPwy1t3ZK+f
z1v<6jK?&b1wRBce=3U&~EsOq@_^;U2J*B-sr-fbVHR8a=Q(M6pOmelU%?wvV^-kZP
zdYOBr^TkLKI6|gBG3Kfn;&An=R-hF^darX8q%LbIe25@{zu9uE#Vc?FNh~WotUq-$
z_t5;TKSevP>Y5Y7%O6i$KlUCRLwzQQd2Y#VQ?fGfEF^eAX=cvJPoh)d0ccGSOd0u~
zS^3e8i@C<84}*cIisKyIEoX-g%MUvf%(*@HQ-v8P>RL`r?_ZKDbm9K%f<CiB-0g9Q
z-knGye*7w{dq8H;xuGgKKFequvOAF}kg{eh6SVir+Rf$Kv0;xOe{IgS-?Z|JI4<ah
zI`>~nKP%$y6tTEQUD~EYOmpoTUpk#uW0cZ-2&QZf@+CHq!?Pu{JPd|}ciN;1(?N3}
z%**6-?+)ob41wzl*<l`g98(?!a%c6o67PxU0OBx4=V#|rX7J_4GT*+2Z#_CW+0RsA
zl&701H5lU_2vwpT=JTn;IoP(XgjklkH6|l^x@#daE1y$xvd`tEa#AudvI1<l)jX2=
z!9t!|b$5tm^|uVEHA2n5s>Ae7hCi>j-hpfggzc@~!M7j@(t`4RZgjl~p(;Gy_b#E+
zsa$&H=w#zx_x~k*3y=kL`R48^Cq-mVOop286Ktb%DYnLo|4s1XBOQTy<=+O#@i*XE
zwz_rytzjqt8q#`j94@53w7NCJHW=Cu8|n1lLqp9c!}8cU$tP$X#e0&AxPh~YVBy-D
zl4933RuG3uwtRL1(e}Q5f>n^yK!9#X_A}Yu4#!7dQ6p+m{Vyt3U<mlNV8LIC-xSr|
z^MjCD2VskFbtRK!b!<dg6WbY|%CoCkKb*3v_op&5z6K#}@5%Nu=RiSj@nqWA;Q{?6
z<X<ZbLiJ~Aqh{<Sqhy?GNBL)VmQl5NlRuws$5K(M=&IKOn}^l6p~gmEQAu<hsu*y(
zAU5>g4)|M&*VA1Xi@;`w_nj0nce>ji?#l5519qOtmv7?>RO_%MUdgub^m&(|pHYW%
zRvhNRUE{y6bDE1HR+N?^&DUN}(*rEo8w@~}CH&8mC&04kpv-9@F_xW7!{qi{yZKgC
zB<IQf@Cqz2`ItIF4A2TV#6c(_1Aj78q({Sm2lckplM=^)J`l0$@|w_OZg#>+$+tmD
zWoF}u`5r7RFoZIZQqMF+CxLqE%WY4QlUiH-S}E#B`k?7`2R&V0W#6xnK_ie-oh|(S
zE!_dSkzVj|nR1J#rAV7b(5#z!;ck7IEZ_6u<F><3Bq>c5^1I0Lw9m$~R*qf~@qTux
z&HYFYGNFhRyFIK8)?+C(YuB}<uWfy#x-^Mgh_dny+sHHsGg-<+Fn8o+G^8+hJc6^+
z3Ll}H6u-N;N3i*I#!grUc!Jms?Rlva?Zzpx`T<oIEn|a?N$BH+BC&v~iXe%TzzrpK
zLlUWQ*2Tg$7s%$B7k)#1<)vA39uNaG48H$w2hgiHtsf&ajnf)WueCq@F6Xrwi$bea
zp2p8R=+)Ozwn_p%2EK`w9>o5Zx^&WVspI)J`wse^yJxe>LHpBV_B;vCm@h+V(l(y+
zG=VTBc1^tD`9k4CQ>gehs69X{f@qixcDXaK`d(!X)^AGq3wx{n_V;MtamHH$))XI_
zrBb9V<wyEaDm;$rqlJ1O3?*lo-*@qZ!KRNh5_Y-XUw9JeRHe4Mr1BXac&kBcTr_U?
z>A}$(xb9bEvVHs7c%%+udlspH2=3516jHa|+XRQPsfyGm$;R-)L{;ZK<{UEZrc#yv
zhTFoMlDd!3Pp<RUB<5wfa7>-w0avmP%5T*XLT?>TID`iU#9^{S2>nZu^@les#M;!J
z{t_fv;9dOsA&6%d=q1)(uD%$mkWOHyIsp!_P9FdpA*PH^D(3^w+D*~(84=&*Et;a(
zKGHRA(T4S%3L%A0O;y^kxga_n?7&gK1M&%sC0&=kyGB%Q_3PiTGPzZ*zALAuiV?M;
z1oy{Pxq03l1Ao_a{-W7qExgN`Wr+Cg!ICw`E7&o9ag4(Vgb^F({BDmnA0X&(4VDaZ
zTDc_>9v``HsydT074ca!kyeea3IG1Wf@OxRfWA2X2ml>0#!x@qVg)h|R~_Crc$Pv{
zjKPPi=IfpY*KhhG_i)D0pqoU%h<NQ#{Sju$G)6T%v9WR+ikafgX{d@0HtYzfiFm1d
zQ5hmh#Cz3v%f^n>SZ*l9b~RKej*4jooc9KOF1+$qw(Y(>Y@<kfTl6|8cwImdU8A7U
zdVkxHihd7c&dH#!d;nl#$$Z^UhRPLl@y}%wzYW3UaJPe;)D)FD`N9CJisg^L$NGQ;
z>sDNrm{HU6g%N?G>+y<SlfXvVSL;4XBHWR2gyrCVHt)E4-@;6hS6K?^-VqW<)(-64
z^of0bn)j<OhQF_vJQc~Dmqdy446reG7gXtRsbMWd^pspb<MR@{bn<DXUTa@wpn&<9
zJvt~>zlsQseWW|SkS(0;yGX80HOpb2mhl3MrXLCsxRlir1r|M_o1oLT`PtyDJ4?>A
z4LPp%fblbYs^sZ?$+}|^&8_PEKB2{5MJ^$;P(|Bb?~aLOyj$l}L4!bk-VSN1(yQGG
zX6PO4(3`iGW;^ULPi$|W;NN8w)VrTleLmHG9i%xuT7O+IKlluvm~}T}bzvqUp&Xi_
zS^1>$Alz-#w{6S?;o~GA8|&?~nv4A}xhij~#|sa=*R7m#+OTVm@;{r~H2=Tr!<4LZ
z+zBlwQlrlqTy7>AfxTb9W|EmB9IADjp)(scdujxZKq!^tLkG(vfJQ(;ry6f>8B>7#
z0t|$uLqv^s9JJ2-f~vKc_5K%Zm^bwh`3r`q%KI^Uj|fZvzbo`tGtL7OQAy`P9Yh<f
zO{cagHCb0B$m)e#f+<%yVIC$0esC^h;Zio`2E;7F@tk6NolklUu<F@DG@D<weqQZ(
zPU||+-;Gm3I%1J^08-b&rLcX|)?%Lq+OJR*9q;$TW^RY2VLwbsZPl?gGC;*s;K!nH
zCI9s66cT#KW}Sm#DQnA|HS{RRDXsSSbiq=hC&<GiDZnXsQtD%kpn>tm{NeVF5S<Je
zy1ssQ-cOLZF*%?_+G{=Hfy`&r*6?+4X`64tVi>5(ZAYu(rT7hR#OqAi#~80*Vq#fv
zxhfD5@AQud4@NycymNTUxp4}ZcPGbx`k%j4!%Vz!wEWEtwIdia1-0q>J%X{X&&Xl`
zz)?zamI2VIB7E&xtbaHj06@-Pe6W0;#NylXQ%o2638Fk-+CvLm`&g~&hjtuRLvjF{
z%?ExvX<zUz`u*n7R$_xOL^$JN*4Ew1*(;*`hkA4PS12%ae*9paR-Fz9?qhnD*%Qnx
zOverY!1#LJvN$&R-qB<c*>MnkjX1xW!w2Hh60Vms`6vbt2SZ(Om<8j8{PM+TX8SDw
zi6mCE#P2mvXpMV4N$9M+RaBv#)P&+E38v+}?~>&{g<gcSz^>`|icqn3Jz|fK(UBdu
zomW$Mhz{*r0eR)TQ@D><L7uwm%w$a*MN=xp!SLPG&*pY|>IB`cU03zUV(F+Nu!R3I
z8#yjEZ2pEEF4#9>IEaE*p?)fJK_Ti67G(Gj@`*b{4_A5)n8Ag?8R9RWoMA`J<Q*sO
zZqtB-iyeZmgkUNUS-jR(#^4U41dL{)Xze*KpubqU*z)-iXH)5)u>o4HBel2B*)2Yl
zkZX9G8<VAJPTTbH@)$;KQ9cgYIhoi8uET9X?vGWm4wHpJ-oI^e@fSex0lLkN$`f$@
zKeLS&K*50$3Q~WfnwWE}X}1|Eam;Z2n;W30_cvnu@mF8>5jDSC76i{eI7ZKzuvH5=
zx~fFLRNG{HN`bfp$ZAxZK3yzr`mbrlT$d4hyMVKlMl>rX+x%utRG`zY@}F(H41H~}
zYl<lp{BfZBqu%Kg-CJ>xe!P;_lQXvj;bV0AyA~M~1*w@K$|rk_l!@Ir(qEe%8h41l
zRi?Ms(z2_T*>L??ncjcmbnZ#os3$+^r>^9h-V!FGXt7}pZxKgpTw1&;eXbBeK44}j
zg)40W$ea-kkA?D=&ag&5l434{zp*~94xRrvhH+@8_<M4t`HH}$)*Nidt@j?@>B{<w
zxgL-tKyNl~ZCs+_b0bj_iC!0=m(YiFAFVNHHh;;vz3w2&rF^Er0L?s9Y12ZeZ5pmO
zJ?InOLk|b{;_}42o$R7_*Qy-~c1^7N)pe!s9b=Pg$rG@gphW43@_uz^Yq|BV_`=0C
z!5rhx*Uj|PpYnpjEQO$!INdiWF9Mpy0z~rAJwSHV_T#O+Zgb0v_qV3@vp#}+NxjV=
zXwkYEC3aR6fC@*JzVT{LyUpE|_1*=cccG0FK~x9lw%&RB^!I;57Z!~o+6*^7i1GzI
zo}*#OGH40&rzfD<uwPcEI0Pg`sj;4OAlkGJZ`#b&CRXl^bdsTyg=e#Iou|a%Iugh#
z0*nrTY3D2A7m#><oI%<DG&DzhOn+0%DgCW@wmYcspgI-hwGQH+#>Kmct%FLfmZp#a
zX8L`ghQ2C^u(~qa*(g8U-x1fxKDh6UXF^hhjbBd*qSDVdNJ|CdVKVp;@FD-S2!fYN
z$(qr-s=3mo7Z~fg_lKrr&Zet&uAo5lj<?6+l$riPG^~$*T9KR<<hdN{l`TEmK>ZZ&
zThw3<brcT!*G^>RLeevG$@b;2yqp&*9JS#%2uzg9DEX?Oka)r)D<!ekE8$kTUB1b`
zcp~=e40x^BBub|8B?(n-0advvZq+usUaV?_RW9H;m43cOY;U}dh){n~fV#0|JSxMh
zRJ+GPdLcJI9V~F4t3)QdGD;@(%LYVRO|hfVx<G(LhoIAb-SM=s^6Rr#{jPTpM}3T~
zo3*tuQb%EV_<2tAF<x6hBqsAOae(;D#2rZ9eJXe0_}6Qy=0iL9`|_e<5W1|dIneqB
z3R-6LcwBF;AsNxy_%2Kx>%s*&a}Rf;_EldKkUpJrV##_~j0#aHD&71udyLP$#OiCb
z*HiZ!v!>mBlxsVawrm=9WDS?tSn*PSh`fTk+zH0)(1_EHuu5zHt`Pi6x3Q81;IQAo
zCAd^KwKX?kEzVqD<j8@oV{ry~GWX8}Y{j4!=XMF<XIEw%QZ&Lfw8IPJ!(8Nc;{ZAQ
z%lAKAr(WNM39h=K%f`6F-3;sTlHu&a9m}m3OKN3r3QtC=S`{Bznu!M3-S&4mNKSK|
zR->fZJb_D4F_FMqd9F}4$#A>!QWe6r;#@ov6*F{AQ(YFb4~2IrRt6RuBQ(@UUynB)
zgv6hi$ZH<Qx!H19wT({~-j@s{G=Hq9(;GG0GHnDXLhit1f~N5;_+!FZP;utxV&~X8
zBRuQ-E4V9;<JQf7JKz;FRXG=0tvt(A5?HOBXs+nD@k)?X<2qd1)i1c)%<8Kp#);h$
zjva=D)E{Kg)RB%r$SG!VlIcvsw{OyHBFQ;o`6~{-6uYnGEFQFl-{S5HvMoFf@(>pM
zx!o2|E?Gl5FM$jEJ-BQ=o>$cpUa;p((;M@hVPp&TChQ5IK!`cw#2Rxzi~TeQTRJgS
zw4^_qztbp3%3;wOIqdqFx8k787dioD!_K=VIzQPe|G0QXi_QTunsj0UeAJtOH@8K9
z<6fSv*krkDaqy|)u@)bQKwMzx?S1AgsL7WGpn7`edv`)z-*B(~+?!xlFA{19&5~Hf
zg$a_blWuV{Vx@ogBwBU{euDOgE^Xl}U77sienSMbMqqMCarL6P-tp<Ci6CO^<}qFk
z4uSk5GXb}9n#RXhpZ+~l2cihKO3S+TX!K)7Sr($x0B?^>=owmUJbpTtm4~tZgJI0!
zbSq=3-HV)6XY|zj7kg8;V}McWeO5La_O%di>kL#3SL#F2-5X_UMo_B@nLXew#us1b
zPfhK`DF-j1yj)#BG!5*RGc|W_$4vSd-C+M%@AS90>B#hcaOb32CPyNC{x0j$7;3b&
z_3Xd?KK>mCZ7BsFgPl8wT{L?P15#t~qsm+Ro(9$7&LdOz&LvoCws1fm2(n==wXzxq
zHX4nl@ck=R{O<MvVXuDtw7W>>Nc_@s6iuL0Gc`|GwuQaHH28c~2XL#OtS%A)opE)+
zg26TqRN!J$%Ci^MCfpaynw9N(BD@QdEq2diI0E5fLV|M^-6$TXRn>RVJT&O_pcpsY
zxF4{ospk0K#!&BA$n`AR>D7FJSjk(j^NiXO_D)z|>@fzW0wB$Ep}&HZZ6vo2mwJ$K
zY%&M<j?EYR^lEIEl6P1JBB_t)6u+TdZz2MIyROdR0epe5*0N+93cj?4WznKeFlu>x
z(24EACvQHoj!elZNSk}c8|YLB>+c_Qk9^E9kNdRAc6YDzYtR7b&R_N(`~tU{TcQd$
znuH@RaR0yT4_2*!qBPLHlxm^#TY<2iAGE5$$u&;*SwZX@Et%{;R^xm-(@c)zzA*Ly
zVtZXqYgFYX;k^cKddI;Z{Z3DF5%N3CT@rHeR_^o(qs7OTECi%@u~f((wRvyLjOTvf
z)+ehQ)R8!C_U%u}v*e-(b5q<?07-FT4!!<F-FT`mX;*r3)t>B|8a&7TC@WItI1c3t
zGV^f1EoG|;v#VTNN~xb3J39oA*ZdRDJoG3S!_fiquAe_KV1}qz+ABy6$1=jPnvu%P
zpU6Pa$ypw|@^^g8cY&&R9kt|Y9qvqlsyIPXSo!j+2JrEOX24_7%%yODZ?19jT7H5+
zm4&S`f?#Ys9VK9q>Et2WTT_>Z;$K1U)8#3k0vlPG5v}zI%FBgFan0Xzjckq`k0JgS
zSM^n&7Q?yR?hN1`?B6Iq$Wfpbc3z!}qykBq3gHvi*E>H6{^Fv{IW%;95A4|uCn{$8
zW=bI<14<+`sn;$vvdG~%Pu&f1r#Bl#M=cM#Ih4xmafGLV$VPLHK>oIg>1wmvft@tM
zCq>Z+A;I{qm;oQ&=X+=a&6x<54!^Z{QP771E!{nI0-sgCurlaj7i(Jj@4Ze3(8JRW
zv^7&Zi#sTRXkC0#ZYe!VrU1&g%b#ytd^48v{!08=kR$6vn1$zq<6zxI>1&g>P6Qp4
z;ZoLsoT7nn`^<m&iNt3=<RxRabi6&P)DOvSJfH}O4~z)<n9(JYcOID@=MXOQ-8(2M
zo~*jRox;VODJO?&XyH0x>&P&RnOfu)wjF#w+*{KAsU4PGK@z@jzlE*)`{Xc?9aD+d
zID3!lYMpZeI=Tjy@iXxduFQH8hIP9nO$I=X@tQt=2~mdj?2h~>_$_U8y!yht-C*mx
zwi^i$&x{ElqJfwF<kt%0MCVC1a^)cpu0o;3UdVFEOW6znK*DNDSf!~GCY7m6(vcp6
zvF24V9|_T&TzlZhNrVetn!PxTkB#w<Kg6(h>NPi2CsOL|=Y!IdfJkuX3ADN8N;^eh
zFC{cUpp*Ch3ivCg^6i<xI%kwEn&-sd)v_os$Hz!)Um9rHo{I!HiNTQd=e%9mgVSfl
zs=`*C({$o|9Ph7U-PXfvhNE%!`oBD_7%3jZhC{o~-1A+MvK2Mm6f5as^;Z<{yA;&&
zDR&Hw?N-Q%8aJ`}La{y?X8r%AFfLAigM8_~E;q8QA)9pxFt4=B6dfr3aXT*-2s2OD
zU+ms<a8V3o6H)w(HyR<NiD6TUBSH&~RZRs0{&<DW1j&({j)WGqjlh<x@8QK`Rbtq<
z(b^YoQ@FknHeJ5V)ypHWt|Z}A3}}|&NXVd3&nK$Tkirx**3HVTNBnJ{EkvfYD;7;a
zx=*oE8Upkd(QlTJJ@|+NdAIE$v2Tj*+XEl3plGn`Q_DMG5lgz*q`C}FslPIRB8~P-
z`mL`mnsE&iSOdZDWyXS`(|?vDRs5{@g;>K*3DRXd;F;f%%Mnn|Q@eCj!+f=Hy?Ta4
zFf(v-@wa>U_22T_Zdfx+$A<N>o9UyWv2sK_C5~M+)H2ArO(6cyY*bwx5supH9LAHV
zEj|5X!eXnO2STEo1M&x*F?DrG6AF8Fcvi%-BS9Vb)+Ojoh;GXmO~+%*l#phmV3F30
z@X@)hBVfhhi(I0q=HC&36%uHqYoE;Ik+vA&PPE<ymYC){D%d}bqY7NR`VEeuGLe3E
zTw<h!K+-iCuY!Yqv*l|txt!>mQ{Ys*F4sV`sht*AxmJElP+hLp19#={I-1=H%Wfs*
zqsLt3VSYyrnVAUsqfcM^bibmem*hPVewMzy(WYIC^<6&;<lcWQOpDDe=oyQgVxDQX
zDIy!l+#TJW;hX`_$(e<28`ngt9Gb=ad%d6fba`nUzN1yUrznWLQ!88#a60)SfZw0x
z4=a-~ARRdH_k)`wHeSJZa9Shh4koR9VvcnKii%nuv^vaTP!d$S?>W<#dqfrFG^nOq
zMm^YJ^>c{n%aJp)0F#y{XZj}yKCcZ4R|`O)l8<vyc6BJsaeC?H{ZcDR`d5{=Ze90h
zyXF%!(U_eQ5#6-rDjvnFv-S&#PQ((NDRo96i}Rqkya53?Lu#Kv{omMH-X@lmUhb~v
ziy`6NSB2}g{bmWr7aj&V{UwY*rH?KwC{X?uj~F4Fml!|3=M|vohfMBWqCQ%DlaT=a
zm+6wUxMGLM*9SS*@f-!I`%b$9&_+vz9n8U9=z}Fs*%?X*8Qql{6G%;xVFbc>h(rCx
zF<c#`A54ep6O~ok^kBeAY`V<Cx+3IYnWdREOV^inDDZXa)HE#qS;$Ym9eLCNc${PI
zA$?1kR1PmU^$coz(?K7XA7GV}w3eU8&k-TjxU)5PVtP2DStxZD3n_VoYIkgYNNMr8
z!!_B04`Y+<<$=K4KhA^&JmWGz!Ph$XDx#SA$K!yz!b!39NIY#L3p7vyCo00v9mqf5
zRqNP1R#s|(=&6cwL2M7!t}ArZ0exSfm#+jLlF3du%N2QR13^niBK(zZ!#xO>^F)p9
za~kyor}gK1E<<M?kC8hv1lN$6YP&s8u8z_+90)=<Ol#UWsd0ad!;LV1Qd-pup}44;
z;GTODEmf`Mgf!mH;=vG5(YIlZpuXZ)Q{BZeWaY5cwN!)7nYUlz)^Y_3&l-{gbhsn}
zqERN&riWjo*n~+;yW(5oF*Q&7<Lg3XD3l*$&$Z6Xn!*-JR$wO!e~m0T5i@!LvImYR
zd{;0lEEjdN=OfqN#PddMQ46vHR{rmTxc1yGL*&g_`@@iWS&6S=jE_~jOI`(SOR!!{
zeKh)d!Hikuiq)k*gn=<tW@=nQ#{o)nJ#{OkqxVS9pz$D7Q|3R_7+~E!0i9qR+hLbK
zRbGnBIJoeD`uK;ck~avrUKO>oZ~L}vVC<&|K(nzu1O7wR-UBxgOY|EWL$v|T%V$va
z_U@sNg6{3J3T~yM;tv2_Pvb$dBA)#^FI>MBDOI}y6A^z<kH5M)(dmCA)XH4ndr+vk
z5@$;(CB{c+mL42gEbfLe^6WR*#v-Zr9D?pd4A4Xi%`jBZ_B1n<TVzsmA!eze+}3r2
zgtZR77fc6T^SwzUvM+eN3p)TGkk9QHia^T3h%S%!ac)!!fZsV<e}<2!f|Qhn#$<VX
zghW?C+GTSq{7ut$%_pit_|1vDA)ll(y+59q+KHz#)PIk!w-wpZ9p@fX0_-dvw+G|y
zjR%#_{=~xe6P{yeuZ(8CJO>q&#&l&6`E98kho9!4#c-!DYp95T)%lCxhU&CgUt@M%
zFTk2by=O26-pl*R+SEH)q)Y|HU<)!@I}kQlVU1be)b)VyrW0i#P9#qlCT|ARWBesx
zI^Xu)Fay;gfwzynL)uwInT!@i3`?;uPDsCM+_nae<A1**YJq}r)y|$eG#<xmx*ehD
zkx{Nh<IMVgZQeoARmc-tHN><Fq#m{-rvBzd;VPK*C`{&Wyeb0Pn!4BNEo0OW)RacZ
z<V_}-tPhRTz6X+5*nU(I5?x|)Kw~v1{<W9($(8+ljzfPOwtQozq?LSc`*lK>B8XyA
z;80ah2&3lVKsNn@jwKAx94t9yvuKz07)pR|8J~URbnc{?_|DGFE43B1(-`DI;^FOR
zH`|uf{M&*NrUHxcr$Cz873x)ursFdt+TdN^y%JmXxU?t1x0XJ;AbNL}Z}zHlnLV%K
z8o=i=nhdk1jawHeo~5k#j6$i^reoWtq53CrbwQ1<JEueV)g$)M(k!HN0(mR=tle|U
znxd>%)+1G{>Qm_G0a3Gar3vV`C|Qty5dTw(TZ#W@pdua;^Mn6n#7c9@zWKm7G_X_0
z|9z85hH5@};yiRf;1^d4JM`IK^^O<jW=FB4WktfQ%tnF4dfali+YCydu&%|sQ9z!s
z#8v^vZ}D2;^49t$sk2{1(_z092drw(Lk&-Uwwvf74EKu^xPO3w1S8_`>l}g)Ijr_~
zdyt+>8UsAi=88>T)r<Fm62~mPH+uGx(=scrz_+r>H%xfXQrbUaDhGI@_m8dQ4z3W;
z#dtbsLxts<gYRlLQlPM58#HqV;f;9+p`-%f{PU&%Yw-Se<0SyQ(7CrIyMdqWk+f=m
zc|lGDw}~FUb5AX6oLg$zfkvG_Kt)s?3>DBmxni8Fw$wgy+LqM6THMhNqJ!(cP>X&q
zzy#L?F7U-l$ROl!`qh)ied*1{;>RCfIy~QF=QoTDez(bQpuXg<nj9siD4<;j!>qzf
z6b~xTI@o~W?2aIIt%F~ri!OFx_o~*6*>pn)%z;|*lT<B7Qawe}2nENvgo){KQC>bx
z5kYpxWVEXNR(5kkP0w-d|0(CgWob4f6R%=}%cL!_35(%7YL?fr_xMS@GWmT!e0mk#
z^ij-zVfQR$+tB<h$vBWtuQc+@9td|7O-8pR0ld74SLVmt-3g1=jJ@1-OY~wNsiy`5
zqh7eKF>b&wk^C(l_8os<r`qLj0K%Fe_rSV`A%sZx*wMWB#<fV5nJLjRU>CSAI9pcg
zw-sF>+vUUs@Ng{rLNt>l0K(Dahf(CC&&-Zzq}!>QR=n4q2pnvDAQs#x|2M0#a?D_#
z0KgJ~o%{cZ)OjGgpz@~-y?C#`0!i4Y?Ew&BInulf`h@&_>fx${!f{X<{f@h?h=x7J
z=wFrn?k3R6m|u35W#hAS1_nHVjSJccW%PmzqJ%pw<_C2`tizaAaB&^)tX#`t=Mfq(
zkfkdzLtcRGC=otI49>%zD=meWC+sV*V4`rfqrQ-sDPNL@T*Vj@++z@xx%BtFO?eJd
zH%~N^1fKanB%OOalkfk>D@h_MVa`eN$@!3&W2LBsB$nfx#d1Egku#Z7avqYTa#(22
zoAV)uIh*sDId6``9DaA--(S17Js#VAKOXmeU)S}1zh2MR?D^ir{B4iIz~CL;tYaoC
z1tsvwm?Cm?UI0m@wc0;mn$Ll9**S-^Z5udg7j3L}lZ&qv1aEZ5Z>z=1vP*9DXK$zJ
z%op3>yo>|J6Sn*L-ql~N+d$1pRVk9=#E;9f+0>`N2Rd*1IxkvrOfiDnd`%M$h#&e)
zAj$#qiXq$p+5A$#&xaQl0b*}b^@wg$!+KHvf3Ytv=5e6ko(_Yyt1k|JNQkJt&#Ck?
z>oOf@qO-drt$QJsM{*?Q6q6^Er3hM|7P3&4(wwUbX*hin@4FdJHR_silogioQ9m1t
zQTK_C;uN#zo;n?jJTxk7<CxMPH2XLt!=9VF|2FOld(+)R@Y-}z)E=l3q&A`fgl_y@
zLlP`d=%;4JW)blzzz6f5jH)x9@|!TV?03ojv0wV+b}%`_SGo6mF%#}T`m~RJk(OX9
z?DdG8&yY<@gB)2BorR#0ick%PK4i6Y&2FMHP0-E+-erL&aPMFig`Ks#S!Ubr>fgu9
z<u9@46knE(Zfj7(xvJw<VxGk`a*Vn{xmKUXED7y3!X10xWvvO?H&alaQ^h>f5DAyR
z;<L3U|Fr*rt`FpwC+;}rdKMitvaht<+{FiFV|s0GN%;G;O820@T~I_Ld)U(RH#sjs
z(;!yGQEdd9*$Qqr9aB1L(~Py)jk|~451zNDd}wjal+W^FKK`rg&)0il`LN?F$M#94
zQXZjyXO?C1+J51AItIS&uN=}wAO5h+pC(;rX~QGtps}olM<G_AfW#+g>>Owz!-sp+
zxdrv}W+r$+3FQ8L0pWO0!M)wr96uP7dHLrFCIkqO^QPVK29@Oi-CDswPt=mz!g9DC
zwe5|Bywl|Xti$0_r2u@mbM9@P@x7*0FgUA-qL^zex;QNYNx&K}tHnl07i@x)4C&5z
z{N&`gMe)=Q(nv?MRC-9#^qzt%P@*)$9yLpmslUv4HTG358i5tM`uq5<GQT!hRG$r5
zS&s9GA9MNbQKu2u95T2NBDG&5M1mcfp>?e0d??r~lxbf~%PmIZd+e9BDA0A4a~Y6L
z;T^U}mv8DV4PNM{(?4KM?e6-Efx&=6;jM(_t^l$(^W~X8$@kSHfzz4y;u-Y|pW9q4
zqp6;nnQeN%#F5opH_dU{4a3Th#rK2{xfg8wMvoyy!r1)HZ|_eFE@Azzke&duj!(7~
znZD~29XC|;5OW%=JIgDuPCMVBd<A4RFQr=9CV<>kTdGAjN19eilh_erQkD?BFW(EX
z1LDkP0GIOf54u$~YEa{V^{ct@rtHzUeP$%D1_;fQ+XjH*NmUt|4hdvO5em~XOpKHt
z=z*4$ei0g2C0OSLfPY?k70{jbJyKm*c_iDbfFHvKhXsCLI-?XodZ{f4$A0E2_^1Rq
zb!2C>8zqg>9NBqll{I^Uf?^wI6h6CSh{v3)aD!eVBxK6L!IExF2f6<>>LhR7#Q7Gm
zAF6%5!$g(vQr$cP-%$Q*dTz++>9h03C0=uypgwoG!;gTDff52dEU6esUYn7A;sCoR
zJ~j^_GPJP!G{X|ylczxEnD+f`zk(dzaUVv-a=i_y8EQFee2sbwr&LF8*Zuy@C6B6M
z^=oIZ&OC4q6gXZILXym=nDuT?kN<R#>L*VD1Zm24{adpw44-6jb4rA+it4+>Pwr$^
z`_5D$z5_yee8h?E_wef8zhL82gA9&4tBq=MlkF@SST~QQ&JGZd#6(WOMh9rCQTA|^
ze*U56`xZsywulCCc3A8OzmBriC3t(C0oW+Zuj>P|kj4P|s_$wJjY@l8nS9BDU8M6Z
znH?eZ2x>c=2Snw<eT#sbuSZER<N{bS!_qM}l4~i+sp}KKMRMHYO_M<N%ekJ)JO{8|
zjrS0Vy@oIsow{;Y6%`AlDsdiw26YAj_x()L(FYHIpf3?nU->X>0{igW&-nBkZMfkv
zC`gf#+XiB8#h+Amv`<`dv`bMvj4xP|bTG>hs;XWfaMn200Bjl)({0$Ij#KSq$jKPL
zqE81%z38|D#DGlbF!mzf7VsDHS@AwJn*Uqlna_rZg%|0CC8*>pU{VQLqZt}uZU*v4
z)Hq#{O{CT7{B0}$B~@)u=5ZTn38T}>f7WMdJ^dp6;XXNWdx=rY{2f3gGBB7z-4AMY
z(wd1teU=l_x<$%KMj0(Oj8tq3<sOqd8RnhVn?ko?LP$lbB(DI1$uAMf_8>9L_$u~!
zJ2S_m*IkB+uX6USrd)<9LA&Q-&cMs%#y}U)I5X=G-9}i6Q@GG`Ni+|hLABtj&W*L&
z7u7PntWLy5Nj8u6{P1n>wN>MmHT$nQ|5QP8j3JWOOzAI3{XLD|%UxBzIk5cpoNGJ1
z`MS5S=%LER5@8_fSvj#!lY{P%yCkc6HSJP~Lvu3;TYkwzdMmuw=f2%W57AGHleyA*
z*zak-Prcv(&=+T=3>r3+^<%w2zFnzDfD(QZ*7nA3v5O(F;1}ne)xzd7X}7q(7x;!h
z?g>3o`#A<OYf5Zj5Rq@v;1Jcd>9q}R@ZSh-5RX}^^|Sn~Ie#}qd4|8u$Ktm?=i+>n
zME_H0)yPvknC@&W8s}CLeHVI1L%<c<0&QWB!nxTMD%y*ZA(Z>8*z$U4H|MzICZ=yK
zFlPEXJZ6{haoksHTA<d^PBfF0Pr5!;4wpt%MnrJ0BI>Q8D!uplv4nl9mX%m+t54tC
z&aBpi`>V&8BHd$uB|DAhm|-1KH?tiiLk)=FF1~YthoU-4<u89i&hrTpG>zQMg%L`A
zWV5t2+b2_OWtYJ5KqAfec;fp4E|l#vW<&Tkt$KtG(<Tf8qEo2~lRBGEbhZ@Td9MhY
z?t5T6K7%N#bzwnNgpYc;ZVLuzXLy~D*HM?jL2J>bhbK337b($WQ&LVxCzfOYx6Y(J
zExC;=|K+XoYjHVub9b{Et@UqIJT+NK`mh^Ms(K#hGIjmP3GV~FrD~TGsDtDP_qzUS
zO3Li|1Ib~bR^C|#bsV+Oa11=z9kvtrMAS!eVVnIu+5DEW^;9?QSsV>>>xxAsS}Px}
zB<ufKC;Yl51>=q@z8rwNt-LcN0B>jCiy!|Y)PZH)i;vE+3A&~larl+jjbk?r1^<c9
z!P8(wFH|!~P9dHNk$u|U#^z|8x_XH}zX2@Eu{UDpnJIN6q6)q*6cdH>Bpw=yez>9T
z7dw<K6>z(@Ufuwy5ek*ef@`ar64BMOK?B^pdK8Qc50{Cf$WHfh9@S_S5pu@q!ZYxb
zvdkainz$*s^DE-IvbF8BCN8uu9g!C?K?2EA{SL?aeC3s2kl&682mbxF)q~YJ*1j@D
zb1YbJFf6YUor!P^3;8*5ZNBX7z^pkQQ6#x)YMiU;2O=I73pC29lS~1Um4?O3%AC2~
zw$HJbWi^x@zR+m?0se~;;JuY6@VML6=R;`EBN~r(xof=UoSa`W0oL~(v$_nFD$}YH
z$_^U;xD`oeXvJ%V@5f~-@+iIG$wDC<8<j8Nf|67Qxi`1wpcxate+P#8uZQQGX#nlL
z9)~|}O`ujr$=kzlQ_1lA4`bjl|H&cwufDR+<O0$8wa4IimiZ$pV{@I)biFRA11to_
zi9D7&cUxD0ySP{k{n=&Eus#BQJ_PxVYDA`VD6<k8CZ<>d+I2ru&k=%J&H3DP1av!l
zKw>i_h?LvrED0@Held`59fp>C;Bg*|JV9BR>-b(wh>HI!b@`CLQy}u?#YK?MTwUxB
zn~o<Vea+QM!8a6s%kN|Mc5Js2spc+{<BCm3&SEtyDazCrb$`%#&`YG6F?2|etCu^T
zw`yDYjqy^o$L8$K171!C!Tt6egkw{nKIV^x_JT9rk&y-Cakzn02cL|Sq*K&H5ojA`
zhve#sx(Vo&d2N>B`#^&ip&$c0rcvLxO<X;H+e`$b1mPrDO&g`3ap1q!e<@hX+jPO_
z1=r=)2R_O+M~f`~UJq}mdn|Sgh4tKXfy*YyvV7;(QS2Gh2_sEtPs9!Pl<gZg#9lcx
zjK;C4jO|Lim-5n@jr)g9;{G2KC1J!I03av~Oe&RFYqroTCEVpJS$}pm{Bbc{;xO_p
z{AtF4@V)}?cFWmV?xc0eqQmi1;p6x^>k_Q+h~fK|+GJFzcNo#|y`ZY~{$J=jRjH*}
z6s%_3voUpD!yi5rDm5y^4&_zfcmEux<hA5KWBP}4w4tT8oM(63=W5|QwVDzcXcvqI
z9mMMR&Utq{obb?w$~6y;?goHtY)GPLc?8G`Z<!%wWcWU*-(9`f>91yB7o$LW6T4sR
zAEQ!JHI7j2?7IN@KkC(`oIgft**^-`s{9;I|3eN}c`5m(aOAp4qbLA4I7}DJk*=x$
z+EOc?RU54c53l`_$D#7MrPd3!&GlF_cY0GBDxzwAEEN(!t!VTQ90Eg3q*jZ)j-|Aa
z;7R%|)?bSg^rwW6=vQLC*2eG{?jFZlgg=r3nFgT7Kn1;zDOB<@Rj`e_9Y7?d`TSug
zrmbe^d=reedf4!JB!vq5$?n+|%iRn5Z;O2o6FZtPvX{~uU7R!1!C-=z`)~F!)=SO#
zJot3(#wnn)`6S?l<YV)Q)i(8Yy+0M#Yiy$@?=@nnQhgd0g?cRP9iiv_+IiuLHovcG
z@s;8&z7z{pWMpSgB_q{>cfPTzt&8}+E3paM*hTz+8y+Fd?%=j>9w}Vd8*8!S2`ELY
zMUkwgAX)2ckwOZ`fRtwImrd>1UtWvEx?-<V&C`zoWr>-m{qn<SyfrO_Xq0An)<b?G
zFR*`3vb&%hboJ!ri(;C+F<Kcq9_KKREc)3(brg6Ldin`~Nv_CooA#clFI?4d-k@*$
zMJN}Y&R{J*iFv~vF-QGH2oSsf_IIgE^TG{r94vbNA=ay@w$0*WQ9#Jrvi*q*AmP0p
z3P^Zw1ig|5nChy(R0eGH)3Ejb#j0PkY}=ae5GXDmj&RM<v{L`YhSE;4!zNPEWwB;$
zHBAM%ngRB0HS;<=j>nX3HSzuKq=U8sZ#uYRhsMIyR+l3d9V(qwyGC<E<re1Zi9<lR
zE)}-5fg0a5|0A*jXTW(49DOlusE|RWo4_5v{u@0gigOK+f@+!|I#L*sW+uB*i<+0z
zTUa}zU_77@idB0`SK~8Px{WI;vg4Bp+I;75UgbNR&+H+{w9-aqLvM{2HT}+;vHhn;
zOC3Z#G^o3B2A1vDQrR*TbA)Rq%tdq|8+zEqB|la)N{D$ZG0OAM2?W^Z$k^4d%>1<W
zaWv3V{onAu$I|DmqA)L7r{Z}D%9@r!hdhJ<w{MF3wWyEF5`eBpVY`8baArEZROZJX
zfQLBu7f@3LK^vLA;m=fu)6Cx5JR|*@qLYr~2aT8Bcc(~CErjuI*US8n3V{s9H>Ea7
z?8bAU2EK-Kcg>O}4cU(<KDTR|d_W3Lc>x<-NV=@cysfTHJ~L5du~x$#u&sD{=1$V!
zVt7Kd!85rlf!3>Txy>w|cy^`#AGPp-QCL+2q%mwG5R`^KIcx-EGBUk<b*zEr6Md59
zlHcJOKV_a4dTV>nS^b1^l}v$6w@UKMpa`sc^_*4DNrs|Oo1>|qS%jp~n&s4sS|$r?
z)5#gno2M9d<lovPA09UK?XgjGw~FV)Cz+C~xlrSu6lK57<8d0NH=vW8Pk~}*`wtW4
zIQ=%6TEz^IK|<6j1FrexifVeQAksi9XPHn6ZTyiQTm@ZjyrI}0fd`RSlN3ur0>ln`
z1(}p>*MC?3ep+YXx*QZ2RQcP08&HY_Z|#zNUVDjy|1Bo5nmYAuUMRr3q@UOIM9Lw;
z6cVZNtNo%3DZKz6=^tKJNXYE_T!Qacgj@Y7+6%5Lm(oOzN{>VfPxB^HV51}k2^&ex
zm&+8bCH`yzFL-%dy^d6&eyTVe8hzESuFH&O-XpAU)i21kQ6r})g}s$NkdB~fg?z0+
zcf#XOWjcU`oW{1`te&kUsqXWHoHE%=2LbX|Lc7;Zb$c`XF)CNm&Ft=hMZdoVw@+-V
zzxkD18C5z@CI_&>UiCez9Q-3O4PYAXNxp~S-i}`xTw5NM9(Dur;atr$TSJtCGLT!l
zqT(E^J(fUTUCXncudVGWVQY1qF-}hwUI~-vQ3Ul|uIu2>AlPL?oquGt!v#?EXvMvQ
zNf|$jZv@B0>qHFky(-A`AU3TXFltpFvgInfLsaV4_r3$$L;;|XQTuv9$oZ`0%Adb&
zYR3_#_19?I@)Mt}7N7qCVVP!?LSs#IUZLk|`XR4%B++84`f$jpb|oxvW=aMvt3Kzj
zx1MlCYLy34Rz3<UtNh{K`+#eHv$!sJ`u=fzivQPx$Tx>vFYwZQEMl(@xup4I4zg{5
z8LC^Bq|qwmLPuS)R$b7(N?z1#rO2}&=i5`HPP52y@NSxU*|l~^cmjntt1+Cw@7Jz8
zbMLb1!qvdXyYbWyH8;pY3n!TW4PQ@*e43!&e=u)fl`#eKXZYjP$UJ)ZiL#U98NHq7
zXH~1?vnbLK$yYj&;(w5;l}$Y1eBSfXcjN84N05-hL<++}s->BT&(|gd7%pY&Ce%yd
z%$@(GA;D>BqG1x&S`VC+QbjcrasW3R)cSB4)>hh9h+(b;2YG3B!BmH5^)zI>`DA)$
zJ9ozZW|VD6!FU45OEVGgk*c3f8Lj{&jhfddZ&Ikx^@fqxX)00d*Yv*e*na|JydywW
zXwSAwR<C`)pRcwa*yV;N9C71gqd6|qL=<)b>vjphdvr``Ww{S%tunyY_}CZOInDgJ
zI-r!AbM*6=aatdRQQ9ZG+ZX0X#m})Fal>VwRq48~KHjicDR|_k-A<w}y+qG;CUdc>
zO~F3i4YH|k8?c8c=rPp~U^O@+z-AyAzr$~%R|59_m>uISdRB6H9vpRqWzlTH{NF{y
z;N136{Yey7f03h(QTI)jte2X3W(Ss{gE}Zn#z4pNtF7W)OyB-Aj6`Rff2&L8Xyq8R
zQs*uGWP#)dqC9-t6D-z)d0C>BtiACXer!of*1b^Uztd<*&d*~NSJedq(H840>Q=VR
z_tcLVN%*te^$9nTOF^LOy!wl;Nr6^Lobv9@!NO(d83ONcf>d$t|7lt?Rfgn2m~5if
zrN{o}yjkL>8~vuI6Ci*zEarSW0n_8c%#2)h{M-+%nHkaJvT;SSw`t4GiEAwR+n#f+
z=uhIci~yj5>B_HH_?L>!CyJVJ2JDIkwjWw2e{mc=9$M?ZJ~^LYc*NG0O{}`q7?SHL
z?$Mr>m(A@?uwEy#9u(mxqP3Ydo6bO!^6V!VA>S)k&#XND{C2}9?VKD3KGk5*RDHR^
zWKb)ADLuk8_CULrO;kRd(J^R*ATB?3nTvZXvv<dxSUp%LhdAa57cv-y`jed=t9)NR
zjGA+~qZ0&w+1J7*IIYDUdlV-yr57!5I>sF9qaz3Ihx#XA%NO2Rqv->SmQgJ`dM#ap
zqM}QvLo@knt4~1bzE);=bq4OL9-q!U1(3dt2jQi4`v-Xd1Ol*kf~s$%rT{&&fIB8E
z{meG!nO@V=-sub~nd$kNEvatm3kIk<H-{lSLQrPpX_Uk!hVAer>ip|@vw}j2eSZhO
z?d|VSfeGc&uoB=I<Xca={yxT~j-R1UU=L&d=Y@0g=N)$BGA79+;9yMh?jyyt1^y;N
zxKu(XdJ8j*wW%G>>7IS$27I1j#wAM_{2kAbLF?$G&MVD(N8+Gd&QV*w6A%m6uK)55
zFuzG`37B4QuIw)Gm>rK*vKA6a9gBF(M?-H#M9B=Bz3a<=zsLJuOPDhkcKE9fhv&_f
zrUB7o<}kBP(;Oe4bTC@jI}8uDiw}}q<wG{g4X#B4b-2K}f|G`2A?R&&c>CJb)*FaH
zHHLQ`TrZa~ySmI`U#=eQXxWGc+MmDb{3d%RgiVsFB()T+W>qZR+Msy1>bL=7{{FG}
z8S=>J;0p38Uv@L0h;S;e$if}|_*$gd&z2KF&;M2F<;nAW>^Y0OmmazJEaGzP7Iz9l
zs9RXAnS!F;7)vx4Wqv|Ka_v69cJryxW}APE(Pykv$H|CxX8mg?c2F1vZNQB4LLLg?
z#%NpN<UEUA@IrbdIPZW<T9HfZFKLCK&EPGXYMd&SPan{7W~9o}8C(@MlzR<-(XV|-
zwuRlOi4djRE(8Ew$+BY0@V(u?gi<myw2SyVqNTU=w~u>@<k$QU$zf09E+Db@KqBQz
zOK&8-?sL}MU>JqgSXuYTx=V7l1{`<_NK8lx2P8}<vTuS$-HR5W0&~g})QMbuFHZI_
z|0B$jd)&Xj&fEKT@O1hLPerhbt=(qdMV<<&{-EoVHH!tY3GO|rSAc6lxY`?-$Kj5k
zzEsvjOYI=T(#SAfW1BqQE6UcE7J~-hr=%y5VHv!ognz^4fS*NKzKtPeWepafi#g<^
zi?9X&b$-`WHF-p9g4WC@!5|>in>bEnj&;lgEC?zKLa{Lu!VRwGf167Zj2&IM-`4in
z@ABnlsfl_Q?&O&DqA@>+*E)F?)I3eIL2sME&2DtnPO__D<&dGfv2(<1Zr`{SqIc|&
zW~<P;VjF`+h=BXzdYwe(+u}x7>{)<$&f0L)qA>Sgi}%Xt-ssTjrUdTRNU8CJ86Y1o
z(X??gp-fY#CbY(iAbw;p!LzPeb8X7~Jbm`HZ6jO0-F<q;1Bhj~jrmhl$R+;M7Di1^
zon!Z9!h>DDG>fWhQ&fb^+x@0u`8JfP$|x(b5(de}_hoX>5Hj80%yGw1`UV&8-+#k0
zEkKPAoBZ}QC#Qq*gTC%;nIL@znii;eE@ngEAxgFhi}z*7+z+`yxpsv4|Ka1nc9yq&
z71H-Z9tTEFp^6Z5Eu&S7|5SqH7Y*8yKw#j821o9PF-P$aN-w%#8;c;n4RLV>w`b8J
zo303TpBs=VD`_-m0FT9l)s>wT-3X;sgyziNO(2a%ER>Y$=h&TY>wsu?Olf^w(P6~r
zHoo=7js4XB2xb9C-`<K(@SgO8TOe=4HFn2%tY)y^rD74<F-axyYQr~Mt0lFa#Q>UF
zSzU6)+F0XqqjBfSLjYl9gC8F>GCAQT*oD%$=J83N*y}Dks%*Wh4fSPJUEoCVjndr7
zm9@Y>LMy+8CH7Scp*xNu%`%X!%D#E*CRR%9>T~Hkx|X$@uHA>1bJ-xKJJ(yaoxgmJ
zTgD_*|2IVrb1xEEv)U)jU4_aM{8qn;qb&NFM>Vjh`JHQq^InIfl3p0muPRCRN6MN8
zAbkT7{lGy|C-D}jwZ%8B|G1?z{FiC^M1Fn<11?E9L!TyLsd-w?h#wCXv!P->SNfl8
zQtQ_%<n7#6V0j4hedBM5UQ-g=FiOMOD(mTCfiCil{b)?MXOOm)8}Hsi(<<8YhQSJJ
z(d9y#vRp9J<Z~BjW8tf?-jx~;$0eINqFs<zutE;-@eXtgfoL8368#{e%sI|?gSTH*
zT=IL<TZvta2=e)n27?vO;$^=ouK9;=(Q*Hnn0tBXRvjdus8p;SCB`pSx#g&HhzZd#
z3qM07x1}Y3sYUwE;1Us}MG?ZkUVgFp-!9y2X%*MhUR&O=lO{88*Xgr+vKo|H@LO*d
z#OkLrIHLIY81=y}jJR`NRRP>X%g2%pWO96z!dOlWq!RFJtSGIqf;|N^$Um&p&k(ew
z*(6eVXVLo$gM6mZuKU95<Ga+)ro?qjBA;~iIUB;?rbT}AanoqkjQr)Me~DdifUfI_
z3A4ME_tNjYh{WUn(ne$kEpZR{YJW5h^xJ`IObHl$c^QYbxf-;Jq(SZL(;aI*SPpUh
zC}oeWn!Bv}<0)X^bk6CNDp)%}RhL3h?&P_s+UfP2&U?tc4xjd;44e0A!_#!?f@?h~
zWHnxnY1X@-m7Y;*n!&tNQtx7Dz+LF=y5t)D$0;Hxp>(&3IqZX+PF6fiQEx`^G88u@
z^F7Sd9=Xy{seceA1<zg2l7cLvfa=!n))4RMf{$_)IeP}nh7KxftcHwCRU~;zIS-Nj
z+yL$+=Z}ub%)>DOfs=DxvoOFgFPYsMkO|7}p|tvoQ9Uh1S*SJ#{Q2!vF`tWJD*VeY
z%gJ>T6BTONk+lHMEv3$=*4PtB_*?%arWE|y2#5xdF0<n}oJJoq<j%Aaz5bod)_jc(
zT-Qrb9@q@6Yii!&25KI6uf8`LSqP~AWgq&CTL@BE-GjA4drBiVC+VU|{!8uU-Pi)d
zsG)!!)=R-U7r_w8WlS0;>^C#V4uUpj=nG-roKJd*`r1n0GRbdaH_6VA@oOnFnBnb;
zTw9A=zH66vY_#*{y|xj!yHISfb8&`l#jhPPIqLbst&_aw)j=3t@c9Oz#*v<U6#LOl
zg{7{Zw<ot5MFkD0LGyz}zt!~TFJsxJ7e{jZX8(h;?~ZY!X*7JEesnRzSL(D+?wGCp
z_xNQ!bgdGSVnnz7=leuK7Ukcd)nESy4d?_DWG20jQdxLgKGqwR`<hD{9Vjo3;g1qH
zlA0wl`0!ov?oPb{9ig5hsm&I192^$XpC#<XSHW6;3(-u`v2Wkk^jH1fbXMthbB_1a
zD2vb`m4yNhBFXAK(R1$L`~QF#K_EZD;d4OML*#tVy_h!?G*m$8<Fe?;X>6W%`?67I
z?m}>)#X9Tl<FVVkr?f&=I{})KeyOQH-S@f8pFUG;Oh<E03sa5od#6L%$fc?oj{cpe
z-3s!MciNk6Q6;_k-IrC=_c1?n_d?m`t~qa31nfqVVIoG6YPDcEqveB5Zonj$!9^bE
zy<8ofAh7}S-k^q-T+H7OgHk_~OgP+Suu_&vHtyaP0_YK$hfh-Mu9daTpcqt}#CvYp
z#+^r;n|HJu#Ie=6)pFW~=8Y~cn5kr)NA5MJM(F8$0V4TAUDe4uc?idxis0yPa6^!Y
zzewc{`yPAsZ?GMZaH0HfB-2<+DuPS(a2%{QX6h^y(9YKxoMPslMa79C0Pnyccuqib
z8p8ea{ou=WSVQIQZ#=WiNI1o>;MqpTH*hL9auvpswZ2~A?93XYn2vA^R-7hhX5)wS
z)>c^N0aZu61z?z(Nx5+GAMWirjrh=*lLg;z%O|>=A&9uefOZwNWCjiTu6Vu9ls&gt
zw{(8GVFv6lxWhi&q(Xi!CEPCMvVwF~_0Vk?=?oLV{9Ok6R401Zt(fqsz<6ujVb|?@
zko(uFz*rUcH$&}ydv>uj79sOne_d}MH}p+tG%G((jw{~sDp<IjOpPq8S+Vs&&)ze0
z`*JpiDB_rcap-)i#pSp?`Q71e`t(itYJX4l-9}Z<5>nDc#2!iIT5HyiAm<DUCfM8h
z*8$ZHQj%A1CcBi%8VL39-k#jcWIbVF$bR^5OxLL7et{S&Ro4dD3eQcxDG#Ypa_7G6
z8oP{fd2^iR1^xup-1ptQI{C|9iF*7DAP$B*wJ6#zjt}!LFDfALzhJi)!X!Pzo|*1_
zB8eYZZMyAFENzEbl|9T3G4pRLNl*-2I+$BWei8sWzJ7vSa~G%2EKf!b?1lb%4Vis-
z^fKK1;c}VSZqZ{o+m+7ee4}aJfct77B~e9sCwA$$B7c>8DXvSg_h`Ih1iVoOmBMXl
zpGLY)`3mWPc&46bA2PItz)2Q&rkN*`A34YR<mn~Kpp`HAx$pA26C63(B!(!*eBP7E
z7R137<wi7uEOOUfqz7Gn<Y{ye2c0-?=ai&a^E>0uLmZV=%lpEpsiE&z!bilCcgz&W
zgxX!erMCQ89i1QqNO9dfUgSckchzHKlbJyfpx`D#k#vI8X)~}RlcD{NPTt6Vz(t8W
zU-zIg=v4vXy6o((@$|(#Wo*vlh{_Rv?(T-jO&b5rmMMXf>F^TbKW2{9FxTPkQ0spu
zV|(fbwV_g-J_2+*MstEl35I}Lg=u9a9)}M<@K{GHh*T=!HO)n(ChlK|7|vU%ghpa#
z&KM>B?sDfavmG%RnE%!K#Gc=K1B69M383zN{C*$@l|%gs%Rze=xmn$J<m33Mn8V%^
zx<!uT>@Brx)w2jn@DZa5xKGBOTs&hP;S<z#&KtbcZ)djEXK;apCD$dZ?0k$Xf9z;}
zi|^qbQ;q>M73q%@Js+z<PKz!HAYcTvMd@Pi7Vv(`7zlkmGtP#tnCl9ylZaAM0o3W#
zY4_xL@giSUm1y8i-VnPw!^AYh))+^wqkUA#Bxr@9rsEmHk!KIyhHhm<t52HL6D8})
zV||Pu@j1Pi3nccfF+KjATWUEy<d5%chV?Dhz2S%=V)ca{skJh!b{MUHQUSKQk=?&f
z=oLa+R5@5_`pzr%TV_yAl#bFga7KS!S>`Y(q0*lE(TZBPto9AO{E|<x^bNF@RV?vy
z-yJe{6af!%?Akh(0d`9?|6KT&0`7J9djSIDTMhU~{h6&G;bdWj8^mL(=y7TX?8V|r
zZ-HZL=6}bjKb3g)rDYZG5k-%|ZM<)_y0s6SF<k!Ue`}NB1$pWM)2qp{xOZ=GN%^i>
z_l2idf2rf#mlNA&Lwx5ullp{omN4h#UT{~uD6PHf^hO%Z+NQ-g?|SU*E$<XpHugMs
zwSU~g9^i>q?|MDUg|JhyD%3bzQp%=c@!r}Ik7R-C*c?4O7^VYM?Lr&O4$P}(-F1B0
z&xc^i4IZU>>M{Y4S$_2D6?tPbQ|eFgw=^kh{Ww;Cck61#{X_2IhfIezKaWN-bDTW^
zDMo`o+eI>im!nF{-nQcOKSpr>t_caaPc@iK-C2}Eci*8{<hYJUY-wo+Y&`y-(3YCt
zN}xY`7s^FT4D#Jbc45tMholj_;P6rNE;q<{cNH|<xFL11SUBSdKbkZndAaGg#G^5>
z4ZwDxrM&*}mL&CqzVZ9eR_zzB|FoSbBMf4}&nEWr2cgS^tmUEW9@t)Vm>JD1Gq$pB
z|4v-3Retm*DM=mvxLO_Oqb8+NFeS+u;%nWI;naC*q-rZ|5c|Aujc4z6o8WZL@?ygL
zCz6lqTqM<hmv46TMfn12C<X8!r%ozgdw&~Ai6?VCt{axz;V7$-vGqQ40Mo+axDUmS
zkXAW-1I6-JRCGmFK3eT*aF<YW=ClV_(y}Qp9pk3O*w+00mV^wZFOE#{=!4n!eZKY(
zuD`#{*i#$47?i6OH!fd*zdntTrNh=s4FR5Vhh7G5#o%Jd;uKw1n%xrTo`XAV$}$IU
zvBc?VA)G3MKAtXvMps|U8mP4{POAR>U7&5zWL*Hp?JmzwZD072xyE|bzA$o41^Pd~
zGbj{$^OouIS)AkR5HZJ<rS<bS_4@ipKuH>2>uATpPeF>a>nm!#pTI<zqK|i1mdX!7
zJs%Yyon)vNIm2oZpcu+|0jkJ(syI_Ora*ai63bdNNnHDQizu=jVRD#$eSe2_1iDt3
zquotIykHU;rjoC>Q(tv%Fur$MqX`k~Dt=D++!2*=(WFhWl^`MS{h8Ys)Hgk#!G3sK
zJuz$kpq*Wc6XB5u-{MV7=X~dpsZ{DFzV7&4o$yycPj82M!m578z1^-K_dKTf%LZc^
zZR?IIvW0-ZTmcGGO#OWjE_KA#iX-=Vl6k6T0VccJgAnG*#YPS9%Ox{3PF3VSo*BiP
z$oVM|pDg{hRFYXk7vVd^B_17C?mo*}xY+sESkOy#$Q_v&5ce2YPcXaAc)j*^SHNR1
z1WTI#HZ8Dkvy@mS^84R}F5xLfdvs=%@n=|FFtdv{(&g9V&m*z-U#sITcq4P=R&KXS
z`zPK7@i@N*q$%d_=h%%vYh`RJdft|gqC?*$dKHvGYQ8_cK*VG!_q~jMgT&FxqiL%^
zGiKke=en}Lh8DnMK%Fme<QJ03_n>U*Pa0iwB@Cl!W4Ywf8@uMyMt8X7a<e`hyN?K^
z<iAdlOWtyJH&Z0X`xeJ=>M&bn;xW4OU~+tsyFJvm#_CvIe$PM~S2_Jli}K_RF0OSd
zU8it9KnHbw?&Hif3yNTXi*x-!)IQ@TBDjy^SN1%HQVT#o(Kaz@7NPo9ub~;{p$=}$
z0-lTdsE3;t{N8z-+}B;qI;+XZYmkd|;)AC~Zje7#&pl_IG7Gvv6(>4KAYwhxf|01m
z8wZ;HZ2Bm<<<{kzPhxk6fL-M=G*R4^EzK07GRuGS!YnGj^IdIuObT<WYfTmN-TDh1
zJD6?+rsDT^L}SBJFy)=f!uXC_T**1k2#$v1SH8INq{F{$o!L8^_Za5lDTLEJ3BPji
z0DHhnbe7{O8W%h1{juU)%Kq_}0)tMGEtW=@B2c=Z=8z0O+NVCBcwklobAfV@SR!1a
z6+fjR+cpgw4-dLnBIKL1o6-i)hZ5%cvB}m%QO2Qz5gMixX};}0xCiW05Or7eTR*AE
zMA*+VeEC3+p`gimdL46mv}x?jF?%DJQ4`yw>HZfRJ4xx^%(qD)DsLMwFS@BkZQ4-C
zUAMc>ub#ve-cj+xCAU`8fNR319t5AXmjVB#+wFiDz56F0nKXhW8&%SA4~hy(j6(#g
zg2`hl&2oeJ{_$O|<*z3nQW{}3-qjvdeIE^a<4*z%=ncIyuyK|nbd~O{^Zniw@>n<S
z_X#BB%q@ml$FiUiR#NdCzBx2VY5#8W`6WDuJf^)xZB(w-g#N|_zlGHfAA0G+B}Wj!
zd>m-=&5BUM*M@z}?L}rAyZDK7mx1t|^W{$u&e}TulzpwJu0W+ev>ts_eqgA%TlsTu
zng?6XR(4wuUcWYzhbD28iAH2Zt%{1W_)U|MS?Y;P&&xDV-K$eiUU>{ZMh`VgXwjKX
z(p-HXhgW9tD_WA62tli5`%5tA5SHjval)(qRm4YNMVM<`+P>xv^-9W<cD11@mZxa!
zTj9!HsRfk<&G8tYC+Kc9Ra?P;@${yu+(f=?GynCLrgb$#Qsw)}NT3QcF;EiY{Dyv-
zHD;J1y_rUf-g5)ec+)c#t#`+iR*s^N%&bnL-Fsoqhe?Hd2U$mExgqqsW0#Mfr~y>Y
z1^%IT3$Z(^+;wV7$E~lA))fyPqp|)Mp`Ck>zD{U9M#F_KR-?zpp%Sl4$Fhu(D>qFX
zP%~UX?c3Mt-dM&M9%L-g@f@n(H>u1GiE@N%&7aOIE0lAU$y#6^)DC~6Y#L-7$Mz}s
zyO89rcbG*A?l{~(=4HX|^RkyX23BPtOgd$2Mf?3WW&>nXfK05>BBQJL=euK9YE|zn
z4QvYGVRE+L`u&O!tn<;OFikh$83ef?pa^)2#S)*)<qjC`UEmO+J>-WNjcuSNFnAoQ
z^2<a{rr7GmrG)^GhTfi_-FQvvxt%Ts&&?(>)1^bBcRKe|wtGKp&%0!KBHB>3p?yqC
zAK+r2I4|Erd>?$@zG`s`R~`wzykP|W#gNhG{Sdw}bGGEA`PUs?MQXh-AifO%w2oN1
z;$ln=@lLI2x1iDLG3vW-c)Cv>i{uBv#Vp@RZ20V;c&mUz0iRoY9N#Hw-?{z^U(dab
ziLY2Y-5Y88yo!?iBk&04b%!+1H5=2n@HG4F8De<PHA2CEp&yAxnKF8GyQlvlEN6$C
zn~Z+n+3?*=fiot<E5hB<=S41TV>l*U$9-i(DP24R%L$KgY;iQJrdGV@{+rXY=6{Z1
zA!bvGNr7bhu%%i7>R4C>QDnn#=#}H#LG>fQ_HEXNTzj8s{>cqnA76nt(|S#n3ho+D
ze>`|j<dN;k(Kf%NydKyhv5gu1OTZ=ea*+tf7I&`zZx3UuBB8Wy=1Ie4Z>9^TV+WdE
zX?V9enDZZwZCQ7ycHsZhumpwXKwi97O9!5Kx#c}P_7EcgoBr;89)0<FD9N?*EGsMh
z9j%teGKO<kS%tBUQmM9#p<Y<v`cx8JSwZnHJQm+Jn~8mYY8oZ++O|Om_}0i}bJj57
zZP#mC8@XD5f|XmR;xmC6Ub19eTC&D^1t$#fhVq#>+OU}{V_YTuIT=o*uqmP<?uC!h
zlVPPqZIi?`Y(>ut(d___d81=#f!+)Idi+AYFwgWl=cUDBAQ)G)i*N;NAO!dDP%{16
z<hjn0dn3BmyT{(A&iTQgs`p{a`P*>E>Nw|yL=7QGF8YP&Dk@yU=B}UP7}3ta%Znbn
z|MPZrL8Kz2?icX8L*y;wBWJ%6%6<Krzl(=s_ogvZ8~IKXx<7?#nZY)WOjs`~U3{Zx
zmk9&bixB3bc3RH&;IIRILEQjEI1)v@>#yq7wiQ`!zd``-Mjjh#^fYF18lthv6Pr9=
zBETSg)D3l}9m?Q>g~Y^(HDbB&7>c6Mh;mNl$Dg#=hvDvr9dgU3?wYlDFfRr$B)vV1
zo~O3c+mfB$965`wQor+c;02#s0-+X=U~>*Yl5|(rUip_F+x)uU(??%U65dCHs|Ua9
z?C@~XI*HG~Jf)^DBCI*+DiOAeyixAQ1{hPFVn^lS!Y(twjkuOREwkJD&8fz^uJmki
zAXEo-@aF}R9;%7YZ!lU8TKv(x(51%v?!oJ}d`<K5FqO<_K(td_c|co3-6k{%F*=pM
z*8is~iFi)VkQEBU89;s~uQ8PQn>iXReF{4qi^CaebZ=02!B(H~%LgjtxR{Am^Ej}`
z^b{$}?1iqtZ2*pYb4vIK^RAQ*1L9vBwthMwfA`=dEK^<vNjF`v%@>TGY?b0W-f3Vc
zYWn18u-{UXuWp@_%ZrC)i=Iwn-jkS}r0Wa4vYp@Ko2P2npKH0KWt#k%t5`u#(v`Vs
zmG!dfZt(tvHT>O~0k1YgX{k222lxz7*P>1v3ujTO#DS3yZb{{%;%KCtPwb(QEM?V}
z6WYCa+BQL3tkgva5dNwVSx+7N@m2_pG3BA7@VID|xv3v%*E_HuK+44P{DQpWn4#2v
zMt^l6kjx`RdnWEj84wt+PTDp3qx`}2)-&$F|2}<X$OzadIM8Zudnu%;+6$XKXr3&l
zOBgJxZkm=j@LzS5)=Q**b2oDTN>)ClLLQTU6t@xO6fo~rFjB()8@~B-1pyZ`Kq{1n
z=$Ky?mL=$7bH~mftnF%3Vea>j5NPWjso@8HMHf`k%dD=FLuU(Ot_DICrqgim3dyNW
z4Fz({hv)aj0`zsKSiy$H07lE;f!alRjiI)5grb#>Y0YeS?}hfqU5jL(>6WORuK1>B
zw~?~EUa*XDH^I&aseE4VYvmNiK5)y8Hp?<8)F5&{Mqge1V_N;LG2<H&BX$I{t26S&
zvisWGeZ4wwc%q!u`=#8C99miD)io{$K`2b@3DN2NnAQ8CVh~0iYNUQo==*PXOzRT$
z`;^n*rgnHq`YAcX<vU{MqQboXK|pZbGOT}3UACz$A1Jr@?EPXLjJ8vFH{grjOB`pC
zuEF<jo*lJ91G?79(68ao)kGl9q@K2X*pLcePtWOr^*W;q;5fc@AlT+p0#JxeKZlkK
zW{sVkb4akFQLJy0+51I&DUXY-L!or?2)`P1>R)9^i~^zBr0duR(R%W6CPMqHq<M>x
zuK`en?Zgu3)|0Q%3e&wMYhXX3Lr=&{xbq=ylRCQ1U?&JZy^V8rk!;zrw-oul!^eJ>
zz<tTUwaj~RCj5=xhA&UWFX~-Jd8vAj0LTg^mv5`#s4LSLeEJw2mi=ll?bVlV*$};J
zevWt6uTY-MBR)&XJkBF9tuD}rxj)&k8p4=v<cqC>n-_!wZ5aMQt$N~Kp!MHq?Rrc^
z8_{{bv~rG7*ix1{=MVdoRqC<yi5{Db5E{eYj!I5bXUfH?9I-kfW@3eU2axg_nZ8%L
zUM|98zVLnL!alolK&7?Qms(Oj+_8wb8kl58l^{-4<?`T7moZkPE$d=S<C+K76Jgh(
zu<_d(58yh18~-tZFO@~ByN*}e?jQeYsY2tbWN3=Kxr`5`M_6f(PlSzkX%}vzJ#DLm
z_p9>5QRLJNO&Pz0Q;=fr0uXf&Zbl!ucn7H3rj-VKS2Z>LkT!X~Z7b256@ArKjqd_^
zmu1kO$R%v%FIT+BCE+pt4&lbhZP)@MmC@L~Exd>68&ar~sw8|`6M%;cC*Kn)Gi!nA
zd8&NxrIyxNDO6<&n~6xd+j&pI#O1D%l0On!AJu(iS8CtH511<i6U_D;&$gPr&`H{k
z2NRg&r{69_4dY|-8v_sq-R>7o96k#PwA&kq6AhQ+?RpBuj}4X!Q3|@X`z;A}yRn*^
zaoS=xcc|U#3BJ1~?;IGD?;T@mKu>GEo(~_s>xSspKDgxjHHs3H_M_4K=Ib?5nqiLr
z!b|_}4A5+S(n*yf9Xwtw?chJ8^X0&e&6Dv_8Sg0xFwk@2RwC5gH;%J9U4bwY4P6Rs
z71q7Fo6D95xjnN(v~OlMVvLQ=2kE!tNBO1Hv&VmbSlM-Jfz2zCk3~l&984p0bIaCF
z8kmMw(<%wy%ZM5+Fx5kR9Z9+H-p?>?+fXur=?I1G%gX^zs+VVfQi-T}Oxn65Kot)=
zBQyf@2(7Fo=+ak+n`O*xpekv4+0W>|&nvW#ftGVt_LQCHB%NV#$zLI7ZoLweouCol
z=J<Ss???ork`Woxa`v%dqCpEaVId2p+P}&;T9p~-%&$#<m>bwY;3Y5j`Vf63@&jkl
zSp31aE$de-oxMzJX#vo6%)9?06s5M!cah>TX<s((QEy69UnxvKtAp;;`SEOdFL>c`
zWDG5DH;OT-{(vz%b_TZ6XOw9tD2q$42-#{NY~oGnYj>)9*%ikAONe-x_0A+Cpogb5
z&0h2v!@Tn!(^R_5$*KI>v&me&S45rVUUzGkG)^4brd-I;6^EhT$jC#?bEX4jAMMjM
zmC(BV-BCyw8s+QGaS5Q7j+NP&JyeZ8Y_DQe(ds7H2IXZ2pd+f7r?9z)Mh!bZjq1`l
zGn4e72QazAyBQ{o+YEd1R4-R_3rmJ_kE9(>Q}2C-K*w3udw#p&Fe5xTztt}C!75UM
z#qo0pJN|e~;{A^vXtYe?P+dBDh=<C4s=tm2>?TqH7=0qZ_rC=fRL|o9LhSZ54qo1^
z(Z{m?7G}D>Oou9q^xq74m4OOqAKgi8A=oNzg`M*9lv?{t-U!@~rKV6G(NVCOR7>9N
zGzdehTsx23_O+dO#c9`|jF)~OJ3B8nXbp|y&F|+7GTto>kgXSHVWWz5SD@W@{d9@l
zhJ%!M|BaqiMqgfioQq>W9jjN&*4Kc&3HTf`y++0?>TvbVM3A$>XCrib3EI0a6FEkA
z?FW89!s?Qz5U(<jv32v(J}NCfZsCE0xF&g#>`IcR#Yx}<q=m4lVMe|(!!m(jAc~Sv
z=5)K3m;5)_CwrpY4O$R0x#sNS_}d2^ixY&S?c*o88sc!-fz<9>$C$^8+_FtJcd{7i
z<aD=yY6Ia!d%r0j#zP88jX(`jx?YT8xfHC`c5WSvaq)rtpWf((chsAE%*r%VGV&xQ
zFqS8+OUHb(F!Wr6nQ)IzckO^Ppj#DmXHbv_!`t5D5!Wf1Q<<ZDuG{f_&J2MYN)*qd
zSUGe%Noot2%V*?)cKq&(7{`~u`ikx6o_o5fV?O&s-HRa`hh&@q1=Bq{K=@=V8Fr+y
z;fh8eik6<9M32cuqbF^Q<1@5XL#J1-?VcNji}8B8#ordGkkMLZy@B%@%w!9}mG5Z1
z9Hkt<a(!s+oNo98?CY|Sfdep<p_nqtXYth<ci`lFL|l^OUObT2%Lv^DW<nV61`Ar;
zS&wwX_cF}WjFWhsXWEb?y7UU4doo1{dT{dT`B(El6--sX$)EfQ=}SKgJ--MF@Fh~x
z3->6GRUS4HZ2gbKHYxMrOy`AWV8+gFF5cu=;(+g-YtgMlYsmt^j9nCTkP=mwj2mV#
ziP>bm*|l{>4*1Fwa2aJ$URMq;w10H+G+dL(rf5G&r?mN3Ebqkl$9&aU*wtxLvv;HM
z)s+i9DM8Z?IdtaYDdw{`cT?%1ohQpaY!a0DpEC$5EN;nTnUCF5TX=fW``9lhnbkpg
z%Pcid5WX>|bg8WEVa@G5gFe5PO>!DeLIISmwz{(%U=9}m*!Kr{=I`lF&q@-<{7`qX
zUeq9#h}-p3lUq9#+w47Rg|;%6r`i1+yY@9wQl>Lv1P{#nw}2pPukA};3|_ev8v1QO
zUhK}-L?lVGkD=YPzW{nx_q#He|6a@gGHch{V}F<Xn0|aBt^=&==lI3jM9G-TmXJIw
zJH7Tb;B%bB=XHZ}v*={|MK!OTrOtb6U$dJg#1sjLyHsM;3DJ2mB<NcApKl~su(M(x
zER74KGJL|@0ZuykwWBho7vf#%dqw<2;}{&``IK_d+mTcup|r56Y_z84bs93BmPb&J
z#rrgd1lij^))x9p$daW_Fpt1eUKYMKPC#$Gmr?e1?pe9%feVdTSI31=Ao7^t8L{?Z
z7_)=Os^h*$`MtH^I1b6v*)H!o@-rJ!PYprnHZO0-$cv)-W20KytgT(P|70$g?T)QX
z#D$z9yu=??MYI#fRt;t5BSw`PO&OSd^|K_*ty<<xmmg;<^}*OtMFsmcy^M9}wWnkM
z?t&2DE{Kg00+6W2_FTNWrjAkj7k<Pb8@eKTN?N}UIWF_%Z7rNy25x+j;0{_bDciaJ
zeiB_m?y*M<5K6t*7PF3Ifky<Z^XW@5UpQ^8+6+d-?b%AmeP^YD7oyW12Qj?oaDNM3
z$~~L{>=Q@l!^#Z~p_YM;+lYYzyxXSnidH>L!{OWG2<J8}7UOme4euKmHH`=eSIHmY
z%3ztc<}(p&upLU@(B^dUXT=qj4_v&DG~Ch|>@Fb0lt0i<@3K`D%_cdcwbbC>)jRro
zer?w*lh{ue=*o=X10rL3Iq1xveAT|Uz6|^v)F2zxK0u3|&rI<ig6Yj*>Ljw**=Yjs
zN_xh6QM3|QB~F42D8rrlrvg5X+ja6RULUDA>FkG4SeF)~S=;-Q^AO!=EVGN$`+7Tv
z(|VdWGZ?&6G^=-xVQmGm5Jhc<t)xBC+R3Ui{lT*mv3{!4^C*Z=oP2bDck{)m13w=@
z==9`J=<GD2ROV69KQc+u+|y6)XVI8z$F0X<+7h>3KC`rcfGE(PgQd8|FO&MFCDa67
zXP~dzYloPujTo{q-`KYkBU8Un92Yd)#Upe?4q=qq%nopo+Rim~v0ci$B8ggK2tA8f
zZt~Jt)OU47t{pxTJs!ANy4dE%4AyxC#W3};M(r>)k>k55zAV3opHHTbx;n)hF7agn
zEw&dnfr;qp^)cHx`XWSfK9bPT`InOQvN9_9y$8S!GUDk%?6f;3Ncra$U>q8ZbF$xt
zm>_@pw)>D~VM%%dI_mL)UP<o7K0CCGv#DKbc;2}&_(pCe9Ji6l951q%k)bZOfBc@u
zt%D_cUwmL@QuEYkw?HecXFY;LUE92YpzXHAAi8l$0;RsBHH%jEc3K`^3M8QzaOGtc
z>Xj2S0Up~5FW?)k4s9bR1d>hy<3%fjA55|I;S*cN&q-XvRqgcOdN|I<!9$ceu_m5m
z6fLD@#Q#P1e3zu>0W6KLk7faIv;JkaAzA_iyyjlh)DL%3<R=5At_hN^B-NYVav0JP
zC+_T!FuR%PYu;`|Qr8E?!z+!@jJ;pUc3T48od+6(b*tApy>c9beJ!bdtfyn89+cjo
zw2$HryWxYM7-~)n#y<oyuN}*xkG;i~r24c+DwtJ{T~?zmsoD**sOB#qGXMbq;gc3m
z5#BlOk$0)@pWU%%UKIS>5nsu!N-bh_Y20&Yajx!7X*pE&HEemW#2p<!p;vX(f>z39
zW<zVvruB}UeRr|>?16GU<-T@}Sd6n=gbn{OCc^(^xin#sT%L4lWD8LTsMV4TFv)A7
zW|~*8iBZp`_!t=ZIewdx@*&ZQ^6J|a$t!EzqvW_Qg4NITX<p*v@HL!5bwgj;yvfE_
z?MM&NMKYs&U+t1kHFC3nEvcuMPJl(EAzwrUum%&5RkKA1`$xzqitdh$esZtQ$uv3Q
zo#mg8p!YFAaP8hq-%`HIT$R|=|F^=D>ANCH`E)GBeZ`c<W%HG7{@{2B;N*1#U9y}>
z;x01y11yFvXvyB6iIc=W{7`G{@RuhbKx~P!c;>Y=y=0c5RIvps;H~*=S}|2W<IT*>
zp}ljHo7`fT?UFvUdn`FGA|KR+AYO6fDTQhdNBEBgOVt$LiV*c_mlGpQJyoddbK68u
zc0~qyI{`eKQjjca;|ZGg5#Ds2VD_%+JhSiradaMzRQ>-SuM}lg${wlkDP)gpR+7p}
z%62ai=_cbE*SsMlLS(OyQN|5j^Sal_=GrdTxb`)#Yu;;Jzw`b51Gwip=e*v}*Yo*!
zQc4VX{49H5ly6hT5^Ku~F+D*p94T&U**m0jr>l{?8JrWy%=S)wPx;xy>G2e_?sm$X
zB{r~_e$A(GQNVLYyywFx<;{Avpk@-HC)B8}ndn4r0+shuX}LIrO;)YAs-@ebWg~t!
zGqLwCM4c3ZN|U@4rY})9mdk9hN#HIsP+_BnRH|1$<cOf(?Sq*;(EuMdGbHrrg|;j2
zb=-}4WdA$+D1a2OzGD-KaRMrIdkUmCd2Tz!q!80j9uPa5-v2i^K#A*n%+Lr@Tti>o
zh=TYl`ABSYk~^1eos4Oy5gb>F7iRAt@Q?4oFU!g>kmT@G;TN61`)0jgrCYS^<VOzG
zxZQw480ngZmYT2$q5gRR+-K?Co<t$%I?z$NGyCl;6}Sr=>@Q^C?hmO8L~~%2I`v0-
zK&rfz>^?7Ms7F~m4w=~Sq`GIBR8@`Bs!#yi#d;7iz7y1}Xdo_sv-pDykH@(!E0AWU
z<Ti{;lbO7%t&)%<)zOP*<ozK|*fsI*sKd@cx2*fv+rOB~W~hh##44@G-dDcHB9)qO
z<@+{1*I;wOKFI%dCN<3#bzo$M&O3cZBe-hZ$I>Ot{XTv|zH!BhF=qZ?*vQO@#pMS{
z)Qv4azfP|2@;y42&GUA1nUuiT+5f!Y7&Somy!qqRU)3vL)E6|H-mNSd$NDKR1<oQz
zw6<lpE|dHyvDOrna$3Y4`oMttOOrm1dTn3k>l_}F?{-kx|Hus7+el46rxhpp54G>M
zt?u;wo?2$<rj7be0g)T>>~vW#{xOO1B4wGnxc$FL6Nqa9?^qU|6u|gdS~q9#`{nBT
zg_|J)ujR4Xo8_YZh{FsQS2%A=dtXERNd<=r%(BJjLhox2yvQ1~4{bAJ8W!83=DSXG
z8X(1CzcRY2YUf^XiYY;AR5qIfvZB_&b%*TYroLe5>J?e;jI`@Lrst40aQmk0qL93L
z<bq&rUu|!In=D1!(2sMRqju)~x2K{WQ{b~qPnV&y@n63d!V_UX<I`?nP1~wVi3RPf
zG*B~#udv3pK|Knzd3{+}C#clR78WnXNP6&KQ-VUMqv&yJa-i)wX!@&V{@XgU1qpBd
z#=n2JS7`L3l1X#t5>VRcGG_K|@;<TYWks1hzAJT|31Q80Z(XRfE=#oq>p1X_^kB-X
z59F>cwMJO@clVdH2KlVgX*>RpmTv{5kUSuP##5~HKt4arF2gsxmi}%^pOO5b0*g=k
zBP<t)`^4gZRCpn1q5=S4`!{E&pzY_Xr6`tc_TiMXhvHPRb4bBn@aNrylc);$C-ML9
za=IZ~bpW)7#N{iZDw!4;eqBraSiWHD9wEE`3f__M{*f%7#J_!cj5I(u#0bLk?o~va
zs;%i{hPoatSy*XGko2{YY&1}8-@!myzpyl^p}%w{{lADe?q+T(b-e*DnXse0zP}0y
zv%@J1_zyJw?8D1@tKPu+Vue{IQAlxioFy|&pg~FTR#<gH<><DTg5Snt;dpXcy}ueU
z@a;5nc=s>Z>rN|~jJ;fpG`YhqaH%&S&4kDl*prTmu#^1I<o!;6mte7=#4XSJ=S2p3
zTMVmYQW<<=RFGA^zl;)@o{u+;VRV!k;}`M>+ZQ<0M}cXuv;)FZ%)<oH@gugQyaA|L
zfdA%~gAEyT^}t<1Pm4-7-y}44+PKBGS<%m>s869C(s%r>5Cc5n?`eUfiPt=pkI=E;
z`uzi8`7QO^hgB_q*G03=rCx*^a(=z}m2Reoe05JHZTHjlb@(J7P;$n^<<>|%h)X{p
zL}q#WIcsHPK8OL($LFz+{+uNNgqtVhFJr~N0q=5<$Q9YPv5i&y!S6%V@MiJ9x9?rw
zG4DdfgG!7v;k~uh05P~cYvwMadf4m&rU$RNd)?!T_-h{kI>}-;ZGG^FLZ-YEG&#@+
zDxu+&r^ztbXb9(jhVtO|g{!3D9yO;BkajulbVUu)gKx{1W_7$13P)VMb7~z0k7ci2
zu1~Jv>HQqG3-yt8>^%FAFJ-ahI^~_u@z9J&%Ye&c=^tF0T5gXD$n0=tyX8kLLfg6;
zX&Jw0t{jD$<sbGkL|j*ER218#N&cnveTqBI6JlRKyOU={d=#DtR(a^QD-VtXE_RA6
zr__7wu2`yJ^k_h-I{Nd#)2Z8;mCvx=x`lD+JnLH_cffl;`f}RL&_e>HuVo>{K51lv
zVYaKjQ|v+S8I6$K-Qu+iEj7>l^cx~52-e+V!`P6Z(s$0ZFUJ^kpJiHQyN)5dS$QYt
z1JK8v4WK2FR@{E+L}X*qL*V@D8}R%s^=QD?yTO#|aqanFy7d{ht338TW{4JdmSfaY
ztfeXdQ4+SuZ^Bf;%2E=kdf~sfr>2hxAo-x(n-`7<0ly)wre&5zlR#Rh_x8c8Wqscr
zEsq%yCCA)|K_V%UU$KAsx|#7|K|bUFlislO7*j6+<J?D8%U|&D%1?bb3X64&vS~C9
z&~Mt|TtvPRYT)9%npbf}i)dfv-7=8{*{XtVLJPkcxEKdHWJy0LPASFi7gx$x-kg}5
z91KKrsfRU4AUyX1efB(XUP;&_4M^zFx&u75Km9hHaDhMQRd#5^*e67a14OM<fnz^S
z@s{&Y!ZCp{s*Y(7niJ~2XiXVpv<#vP8*!|xteD|+V#M{kL*K75RAtLmKHEoi&l>$$
zTi(-Twj5KacX(=<7nI}wlBOSt-TyW1-w?ad^2wu2Sv^db`FoeillpEi?aEias$KGS
zJ)1r!+gd=X6c4}!bIfuTe)a;mOX&?N@1=rNn;VvAOAR*EUETf*#oQ{T7M&htzBd~S
zf=6UlTIb-qw0&C!Gz6q7Q;^sDPO>5<qb<8!#5R2vKV<$D6W^@fmr(v~<bIGUELS1L
z+^}yR^ijL^rq>+MAtThVAI=0zgT9*`9`rGadHI}0&{4waYuDDl!niqLc+)p5otKB+
zuy4z=^d0f^JAFEIXV;Sau3pY9#Y@kr?FUfA#%oL7PA}QSu!e&-lGR%-b1=50F20iN
z#osef?N<vC_~j#hfZ`$v)M#cNEkC{&pD_EX3)wJU&56xGx#r;uD)?r)zdrEJ+!0cQ
zNDyyjG%5*i0OtN}#MdUttC~EdvZ^|=EJzng+QSksK>r9=M&sknm{XP@90am<T(&}c
z2a~6H<R4p-tC;j_9%BU`yT0nd;}nb2WpEyi>vvmBOqNl+6zoHP0{x@5MGqe11Ob1~
zjQSsp^^qB~7Skryy!h($E0=sQ*PpAOSZTPvuuBLpBbt@ax7X{yL;NddJM`$JSH3ig
zlcy)|2I;$%|G5UGBBJu^$Y0kO3&m0)>3^bBT^EGr%2dk#wF^L;m{{$jWYd>X;{JOs
zL4;Cz`%i3D7t9jw(~sSd!Ch@oQmr&8z(o1~9iXNI4i;C4pjCHuX_k&S*ItGVQ%yy{
zl%Q3WuJQo%$ckfYtMja|^DykHkjG$gv3zNhvyfrdnBT_EpT~&FfP&>$b@iMQGi(OO
zXDH#6k7|5S_PxaU$`H<!?epwT8(Vi8!9&s0>T`@tcV<P*-kBz(zSKE>)e`zW=SV}p
z`{oogTTdtCL3R$Avk(I%WvphPfJ<Kx73e=_<33h>iQ_;SXl14rCoH&@&{M@N*UbZS
z@ff)_qIr*tBi*|hqhXu>cc}!Bl4yCYzbrh{P-am(vGp<Ig-aidr5_o={(gLf)L;>M
zHih+Mf92G0b+aq90@mchb3SA_QARR~O6QLHo~CR%d3T5fu+#-C)eF_d<R8eXztBOr
zuq^3;W>y`P6`q7)tA1-7>TttxR)Ms=>O-Q?Uht@D#`Kcq{DAJ2<?x?aEjIE`3f^1g
zn6(D73+V<i#6{?DuKc&1I^DCH_-i3r4-mLa`PXVp<@`@VkZcw3*UiD-l!pcNXP1yV
z6Tb|(r*s65qv(V)?eAw&e0NW02GWteN?SNr8_RojQc0B@O?bz<QA`<6)9yQE)+~xt
z;s;ygR%*dGfAuXZ#l7-eEGbJVQ+{X(iriU<U3y^iKI3dg;6+T;b&Jm?ylu;!nVW0p
z+k0s1&wC#fMujD`;P0l}{rGh$OSaVMQF0aKgA37h|Chd=lQpd?-|3m}&kkm9+yZb$
z|H~tLu164ZU;gi(3y`CuDQ2OzCLr#s+3(^b=V$`{>CvY1;TjB~a3VZgDj;A&w^SXk
zKPC@~B=1B6DMjz?DW{oQ&CH!uprM&ZjhjCLSf-E%FA1DBoW3^8*_s!*XnXJe?eK{w
z*PiNVd;`-Sq7~VbtJ+{pF&=7&bXPKX*tdPfp|)yiS5Ob2pRuCyk}b*Wy0|;C$jrIa
z83VDM9M7IJY?4c+yV|QmWxX2vb{fgMAXi^gO*4M;3pOsToZVnI6{>H^CPT5N&lo~W
zd(fUsO<d+rKk3Jn1CqQ0Mk75`2h2A;^mOTmUl^<nVaxUogbrTMbftZ3H|Dr(PAg?j
zyMIzOi^VBA+PZHhPO(91`bpp4PrllYL&bVIE6-sdw`|&A-y)(5*R#SMmxi^ZYuv%y
zUhLp+VlIW-;xX#Jwuv^~E>q7p>oJ=)nqOAcx&6~u>^$NT7qjlDk-`jv8w!7KN?2Ro
zW#{sBK4kxPpzbN21OtcqNJ?9~RQo10rma7o^itq;(tt|S-2RMKD%Fl}p(Wz2SfI9d
zIBNe}dwL34ujXs>-SBl0)x(N=RNYlyN?p5H61X|Qz0X2)?ZkXg`_o1GUz>>gjsKbB
zxvriA%(6a3Zz@)wMIePgkDYUN6FBPJ_=zDk1ny@-%9rtE0$!C`z9-T*T4Mec{j8y@
zmIF>!`tEuj>oXmD1p+TDF<<_yPvd;M?7Nx};elZcD%tgH>^upNG!)?q&|j7Qlk=ai
z*l#xs>oL76@KcoRmq{b5a>~K@Se3zFNoMP@vUU4akwVh@cL~i>Jg>&ucab{K#{F6<
zyVIKLwvd_RX^XsCi0jLDV$f{gy(Kjc?s=+~fePetW=nw7<gTqv^O1Y&L-9Ck6`xqe
znOc^V<}Zmf4MonqK<!&clL_GRc;E|>RoCnW35s%)gG$wQa!b}qy&e6-+Rb%#<FAo#
zomdvbgFkj#;BXQ?9VX&&<E2pqpMujkw`x~9%GR0R1fHYfif|A$o!89Wj7kd1?m5<<
z{V;??{mWyqHa~RM=?q&I(f!4Nkl5VMrp}Y`mJ^`%bC9kdMEBab%~Yg;;f>?BNZjUi
zk{3X|P*MSqsMjzrE)cqaH)~uN(n?{=h5JU)4XMpOfgr;@!G(W(0^b~)54XDlYxbF2
z_7Pqw6mk=^eTm`asDAds3--l8U+ln>R$;zhid>jKy0ZZj5{nyohfAL?p1!3J(x>0`
zWEyOgt-I`^j0N00$`I=ZN??AMZ0Bz@@2m_#6F=%A3rj($qpVg%Qdq;rGV8#K07X{K
z&%x{+h(dU(^$1*G<caN@4uY11A`C<E!DcpZithSfMDNdN*0oH~b=0tJtK2{ip#(z5
zbfJqjo2s`wHlAj4bqSqAHuODraVWY=EC*o2g!3QH`Y!ef{8Ti})h(kB)Wn9H<Yfph
z;Nyw10`x~Kh7Z$#yJJT+;pm~~;&_<ly<(g*?R}H>2l(<GqAYZ3KJnZs3pnlLg_839
zI#(`k8^=a}&-@rhq{}2j<0AF#@R_cu=PS?^HABy{?8JZhPLIrD!d1L&R17@_?V87f
z0e12|-heZLM*ha$_mtRMWLRxFtB#F<7K0~NT8wz@mV350%J|x^3LjXq*ziH`@RuiO
z#C7{VK1^X_6Roup1qo*!-3r+F-Ib{eF;^KXFsA;}6w`31u;JGHPSroH<+27%v(mPD
zZwgn-tO6>Y;^CR!{=3xP6_F_9NzbF_OW`?})ba5U0$ninvi*-^ODF7iS5Ym^nlp~6
zt-ipLG3G*j>%kZWyNR<otF^G8`InD~p;;OgR%fmfVINv%g@+rwba5Qyh1L|b#_UWZ
zyFIo8xnZSzZBj=YvoZyWNWnA0!fyDiwY!Qfp|&q&tg;zXXLrqJp<BuRn=d9he`&3A
zt1gsL?}Cl~JfWgTYDZ~K04tIys7Td|1HylV)!@(A{fN|P9zQz4Y{E4<t(FFvo{)HV
zq?wc$(al%u7k3Bm1-SfZf3)M4Dlv(FbR9CWSRNe1ak8558*QTplW@c)PFKlYiB^NW
z0jrrFC;|1J5Y!L7TP(^08cLqdd)?z(KY-Z1;3uG_I)7{?WgTH(eP_Y^+?4krUYbSc
zf`K|R?UhQQ-|K2!V#cK-fly>V_sZ)4#D-2<rE1#Jaa?ycxmj|1FvC@$!HVBfCyXRd
zBgjY2El}`=-`Phr4=+1@^-pSD!`Epkx!J7~%aImSP;SSER+NXNW$_rXo{Dz0;pMoC
zyI~>}lxcv}>CvEuqgP$cw)L*&%$>^BNy^}PW+&H~3}euY8%)nN-k{$Ih=64!8U_8)
zgI3U?xH<6Jy1^Id!}|DU_HoHgn|M5b;P%A&W<DvTni-ds;i#K!AK?LJ5SEyBteX==
z-_11JLgj}xG3}?bw`HLJt{&NFW(o}~WQ~EMG#q`QjA=u%3t8D9=<Lztaq2fV4o+>_
z;~_}>&;}o^%iiwe+g}-hi^PP1Ck3LZzXmmW(Zn4gBx4g5wimY}L;@}arEa$ROV^mn
z`E@7-WoT5wpH<OTW?ECvPbXyU2Y0V)r=VzrvEuowy`eeODS8tpA|ul{=6_=*@>7#-
zz-iPg<L1hWiCAOlk5``+ZIlzy_zG#v&a!huXT}m#3a8<xYd)fS7jbQ0sG%x=q6ACL
z`WJR5V<Zo+snF^ZI}sinmxG=^?jA(^ez$39$*tfV8qpI}i(K{n&&Ylj$Gb~3flN^r
z35K=8JC-a$a$cadd`07S>#iW<zVTKk51vzos%SSrB~EKf5)pHy;lr=WCnBUI@eY_<
zzmT}gL4c!le86)#H9}D)Uw~0a&X1shMIa`I#dGf*g@N^4n_MN!p;B`KH4;AGx3?M6
zO^W1s)faBW2(6!dJe&4Ry(wVhwo!{2RcuR>1O{=6BLR?&U+Wn$e?}W<Cfb`9%m#lU
zTGIOxBeF{{JrM)w!g-q7wJZZr-K1*s7WpGU=PVlGQ(w5gTQgu4_cZ%0H+?7t*?KzA
zkjNqAn|75u7yrS@^b@=}Wk_~WzfqeU8IH(;mZWvRTs^al%7dFaRgG`FUA)&SCQt93
zc_rPZ*)#kWGI|*2EmU=-<^JXOk+U)Cd&Crmtjel47ojz0=eAx?!iA$wzzvGJTC!_1
zVRpU#$0)aJM6%f2)K~eh>I?UGE{o&EpEW#r({qVN5FtB+Bq)1D@xsnwl;9kqf#S5E
z$$7D4J!-~bvet&Z<i0;SjE#N$oSp<}-F)Hm$E~jkpqeVV?7|&EZgT>><M-NV#+a7k
zO<76^)0ELfW89J7>XxMQP^Pl5Z^xS3Am{s|MW20i@1{LqPl#<QZm`YR4@qX~GmoX9
z-kQzjD!Vl&Dl=%4DX3MS*fqK#KfBUxOcLzvTpmxCqnn%lG3t&`!LOk(f!o@ygVaz>
zaZ-NS3(~3OLdGCVmQQSxlEO_vj48qHFeo2u)Xp(93mxf|?+`tjw}`?jS;X>7zsR*&
z!A&&$G`Zhi=>J!aZ%Ac`f>#>#*6WqtPVM4l31rvM3dPjEj%8;Ok3i}e(XFPvM?HeL
zgCyV>wk%HcbxmR_q|GmHJ^I6q|Ho6Dzxd{~mHd;lZ<)a16Z}L+;dZ&bR{P*_md{0-
zR^fa5^9bHrw|Ue_NZ%*Mx2ACBp<gU0$kB7|X8vvRZ;GXY(n4ha)>MUK#|+ANmR;V7
z**OE`8**Z~i+!BW_;!%VZ8}C2>)~v%UMcM+)SRl38<C;o6iXJ|K`!kwM+G2eCE{0g
zItSW>bToi19eO++D)Locd=x|NIeYkIBxU=HGCe2pl<%bxJ@ytG{gDnw?fi}jm(MHW
z@~+G}9@oOeAyt0BENn@Mt7d;8Tul7?rl3ibg<|Pj{z|5$x;(``B&w<xqya}wHU6}p
zM-gG*9+s8TM!DoB<;YyXoI73mbdcrbxwN4q#ZqR}ec9f_tdggECf~Ww%|@B%Tj;|v
zi!veToW*fVPv`u%qec2F>AT~Z+D5m3kFHYOlUbJ(JCI;Q-)e+5eH+>Fn#~=Fya1Lc
zz2?42F+Uuow%H^iTyjyo>+leX=sd^6=fDe>`Jc>XmpfSw8}CoQikv?RxXQ%J_UH=#
z)zhV3fL~<t76{Q<4+!722O9=MK$GX#cD0iY>jXB?X%YIz*U{Qdn8Bi2;PDag@tU>y
zH;xf+%q^18w70yq619Po;XjJ}aU~as_&}@o^X3JPgLU{#KX6Q7Chj04J9PRP<(fBr
z(Ed6dWv|H3LX=9GTbYDV;>6QhJEJdx^L0B_sDmt_cL~M2CBlv@=Q%(JS}_tx8wN&y
z9#FO=WJ2>r@kw>$VswDj94129GtTN271}*+20Ql)SuuK_o08e?17Wf89gRqhaCtkd
zgRL6gI-e$NT<k>_IEF?Vc+BX^_FLuWFmS3bOl930W`V^Of}BEvHl8i9)NaN?t7dW>
zX?006?5^q;2cEW=bjSrE$@p9i9p&VvgNkX(U6hS@-v}XXZOW8~dh#CYv8umZ`pCeJ
z2S$DfDK1NoyOsU6EZG<`Qi9<5v9<c<JMgLb!?KXH7*46hpf-py;EQUvyA1fEZni1?
zuLSG2QeV+qvr6v!2G1JzkLh3*h&heZ7B-P_{DLe(v7ARpl5PHW)m+=Z8`Qx@Or*~+
zPiI?{)_Xj5JwWZbv@BA)O0P_FA6hE>i*$X-S92uLWl0b8Ic~mkg=|S7H1b13@TT5V
zFIN32mhTb_T?Qpux)akT+rOQvFb14~2N=w#^BfZXL2VngmHy7Gy_m+Q?o^I(x;0)P
z&ia=Q;wv^gJ$=<aN2cCGqA1$zOCBu3&pgEqYM}%8kf(@#4gdazJ^>ToHp8!%v<MPJ
z=C9v9fPxw8?8m1now6y<I5@>Q4j%H4Nl56eOf^9_X1R7Xe2N2>5{Zhp5kyf6jTK!L
zFc~trbh=d%eN4E(B!EcxudMIoyN@LS#Wy%}0^ap!Da}UX=0sX-E_pC?A`R@8KFpxP
zjBmrl0t|PqqN7*?U06KBcRMas-}pZL8_0W{u61<x+?g>=a(4*+&fS-E!DACC+=jc+
z4xDR)As)9u9)RBisB|*_Vg9{3E99ovoAH|w*lZmHBHm{Z4lSZ?><*;izdUF?R817M
zz-@K}vLB#WTwXT+h6UILW4-@~F{T}a#5!j}xA0k%#eZTha_Fx9TBZZkT1eREHmL#K
z>YPeuct>rY;3X?iZRPK8IO^*UC~CW3M@6iYI}+(}n8Brdx3lqE0i#s72@IH)F!+%{
z2AOpEW5HnTeq32nw0m!(!1VJ*ZFW!c1>qkv=aWqGTD3pCDe^GA%+y&s!NrkUQWDOl
z)sd&dDrFG|nHWX}$GFZRSX*4Lr{U)gI-7jcVQG2UpIhr9tj;7*GZzE0?SNJR;0GQI
zEwjW%KK|G5(*A<1oojL#8Jd=WtLHWf&Jvi~e?-#E2uk#I(KmnnT0?OAsoEyXN#GVS
ze2oD)U;7Kl)9)b+EkuRXbrHgpIDh{`NOr$2V!@SPkqP0le&8LimhDqP>#ax`8dJM>
z&}HQ3QE_DeY3PJNW461*{Rz5NYe3_#w}dQ!(?~LBWuy|vMqV|iChp%#V0<2OO%4uT
z$>0RKoMBus7|M*)mJCjfeOKSJH80h5q1%N?mmAg-nwOW7pD4#yUkMq!^Mjfnn<$Ad
zSt>yVRov=auS@gY?0G;EtOa~HRwrcJo+Y<y3nF@b=OJoI9`B+L%oN}fzLa6RSlzBB
z>I0!|ZseJmpmvE*htMsalIKRewCR)tCOQF0w%xX!_GCIm>aeT$ZQ~lMfM4nE6WfCC
zV$s~<ap-Efikl9FeOX843!#;LwM7t8nt!}KQ9dCL1a#^1mV=}?$Y-%Q$@2Fr>Sj6F
z&*=bleAT<xNs^m_O7+uK;DG<^>PP~7m(<jzXraN^6k!4m<|Su6^RtOFSm+0@{J=+~
zOS_ePVF1?iz8ZCdCe!|Y;jv)!uk~17oU$j4ke=S4y0?6RiCb0k%SWVW#0$F1;&X7>
zR6A-03c^<5r0LE(^Xqter*Fz6l#?yq%kVQ&r|*$#Z_T0b>3?eV0ugqXFG4z%X5xS#
zM)Af{deLvfI9~J7H<5cXTI!q4n~L|JKqQ23qhCDp?<&|S=`2a&n{h}g5Y!9jy3+`4
zkK}%xW5kJZId)}&yC@zDY!Dwq(pS_aq>bF?Y6dO~f5{urVmu_gZFR@`C6M2^EosB0
z(3SxQl~vo*kwB^NVncvgqg=P@Q8@lvhQ^+Tsx#odp^5Ze&`mxt>q_n^O1=4=O7nV-
zm<=;8+;OSIn)<UY+X;1wWb=_4M$=s{vSuG*GF7@bcm)^{#AkN2ZeQdv96S#pwPt1K
zfX>jVk>KIZOZ)gGTjf22Je-Ez+jQ+iOGoES8dn@AR{txqFBjQB&S*DERyKXoN1Eg$
zKv<^B$67pwaQy0FXOL1`n^pmwxM|8_Yz9)pgKc$Lil|nIVM4w^5Mbcr2o3{Bna2VH
zc<<(oPYlyN*9;4R7Q6{=yr1-O6^EmC#E{SAE{X!1`znq!VYsb%lR{%`I4T1?v8^=^
zZZPIbo%N45I#K2l+t&a!$(Qi=^DsmN9VM9?mdaR~u_yRASGTp%Pk?P%Gj^ZTmA~(O
z6hoP@nUZ=XQ4;MK9Tbz>=U-}>LlW#M9UOb`;zxDvV|H{lB@G1QB>8+J=GhHwcd5dH
z-WhAp-+_0iopPf$IzU+4_y5h18h=Z88dxdm^+dL6is^5?$E^%%E^KPleGMx^`>=ee
zUB*Q>FSA`bwd7fsrF@>~2a+1fSLmqS!E=zQ#t6}jOp_*UF4WPePy;2-hg9nX=HGbr
zMf|P5lrXOP*0`S4Brf^tHj+N@8=7z;pzf!&k-z~epLwjYjllg}g}qkAKgkL`oj)u5
z!$-EO|8nsjYFD+$4yRnFF_&@lB#6UGtiPr4HVCVYQ<ST=^q&X;@t`M+a>*_wzFRjI
zqJ@|aKCxyc`hh11j*7%;%oz3h4k4t{tDotKM~|G}#Jf|=UGjXdzpcj-54D_xdaKi6
z0DksCN|fp%nG?yjYue{D2Uwu=K3rx5#AV68n?Qqu=(Pc;8g7t2uP0h?pLJ;B;N>j;
zbsXkjpPdwqbGw0mahN5mncP`9lds|Tk#Dnq_&De!YtLsf>A0TDSDYd%v1Q}iktc&&
z{)$)HITDL1^~Lz91}eZ^=G%Q%*vmHe18(_9^yAyEoeH_k4C)UTal<#xK@XprD3u0o
z><F=eV*_I~EG-`6Fz0L<>7=zw;%<Fs-|?n+N-n~isXECP7Tz(WS}u$+&B%Ic2xdfn
zdxrt7)Cx1(=i~*i^w9e8VyCg4wP|jFA0kYS_HxahV4OoOBJ#`tmU05;M5(pgVkQp>
z7!Vc}gHOEOV!J6nn0HYl@MXm`^EZjA8fV}x--0X2bJIDQ%71%<F<k4)16GTIICP8e
z#YOy}QOBBkj1L;e5GbYEBJDV_7?|$8v|h`#lksVj-|b-b`LuvQ_%Y!(e2aeZzybt2
zvy0lk8f8o*=KOYhhd4Ht-kzG++IvbN3|f<SRzrb87k8ddfd7ooo*!_(?%&#j4L{!S
zl>YeS;bpkG>)pI$`GP+ffd=pCl2;_0&l7uNtSkEqD%W$Eur@EW@$Y*s4vp`QTI*qS
zN;Q3?M0H5i$^Bx3W(<}qW+GD<#PPt)ZI|$h`qzpb&i)2WE1k*kxTo*8>EZGQyfy+m
z36Lv3pXXF+$_x0Y<F$K)HYV+UqP~Fn$LW?h{oV6-N&Z+$+>YXoB;)Z>gn~4VI&Mv`
z<M<}x{yPHFo-3RXIEPjAX@~gNMH)>jWkEfu&*^~uDKqbbn^~H(b4c6jGD^NkcYZ2u
zSSa}p5r})#7c?GiFGYsSm>#i0!Q-{Pe-iO8mvl4=EAOMTuLy_zxKQIoX3!{X=XX`B
zawEZZEj{Gg+S=c7-z)h;wn8qxzq*jA4`&wXEnZE@OF@I6kY1<~Y8!J1uD9!{BB=&Z
ztm|8u+D^mskuvm?1aP{Wp~<f%6?F%R={SJbeNTn`f0)!4Axswm0D4)~n$z&J-i32X
zgCS@8kijPvrV!?x2}?W^W5EJjSckWlW9~ypl-aXFQgj{ZQ<FIN0ZRTv{G5SB&tNdG
zJdY@NqPzQb2#4ad^U#b73wpoHQuPZoleE8S&_ioD7sQ_0X2lM64=mXEnh4R8lKb&$
zlU+Mjau>y-(X+3G6R-2Q4p#H6FC=<L7g^ibYlYxr7A#NIJ}4S?btG(8ah=dZstuOL
zL%Ol|Nc`ONuv$|!KJ@k;FC*gNZ;%+Td!nFq>czGaz~{+u?4G@~$0V<LNh@r9An<*f
z`4WVY>qZj*tf?hgew|aW(%?f^^{Q6)QP*eORh&vwNR3!=eq)C^^s&?jXgRs_=(_)r
zgU|-8nK^Kywkti@m%Z+zjLOd7-YdO>+c51g{OC!sO5OU#hnd_}imVmRc5b+Rx{8dU
z0SHc(!$AFM@@UX`q|Jha<R7Bx&f8GfZ=p@iUVe<m3a7gYYQ~=KMF)y87ixle7(?!C
zow+Y}`tR7hyj^rn*5lmoMAKL22Vm;;BIcZ+?{@1Y=K$rzc2>41q*sa*!;0)Jo=?}+
zTq!;1_Pw`wCqwJNV^!8|d+{8&zW@0>Z^2ec<%|O%a6KuAgyP6Yc{v+*U1`z|m<f1m
z*j<aCL*_G(ytZTgx3#k0y!B)N>zO$(E|O7)^qVGkDEM3{_#NgfQZp4$&X$p_xAu0o
z=q<Od116`|CtkijE8+mG3|-|V8?b+-r?{n-qX~+C$u6qq@P^2DG9d!?r}%iHt(L`C
zRW`o`8tNu{uWBd%bT0skf;vvS9t-K4l;v&-Nh5oYM|{J<F%8x#@|@@@N>S9U*jq8{
z0lI!c1i#I#p1Pw*Nm9uxAvqXM%;(LIOX|4)i3{v}UB%g-!=!ChV7rSb7>C059{s0e
zH+l5Uvq%>MY(vEx6)0N)rygdzwTz))$V(SEb{>EnRyg*u1}m2rNaxX2%Mrh9UF8;!
z6dlhTLSe^o04EsWfde-HgVI;P>-Q~w>D4tZlf2q9&!o@2!N&?hZV|aRx;!c8>4cHa
zD`!cc0&H<7`RWdf+X-HV99#OgZvD3m^j*>5YUeUT_PmR*-mt|!gB^0W0HPK)THfB%
z1dai@gnNw!zU~o?t}Wkmqpa#8N`b#zd*SnBIQA9=FP1enJ|jG?p*jvNKOns4Cl;z4
z*UNH%XqcZS%cqN;&yF&@*B^27K4_T{X22w6tvRJ159a4^1}?VK{kSlkG6@v?OX>Vd
z|H*)jc{KDmeVSl6-R_1lZs=X@&L9f?l5{FO15s<O4>ee@;|(_ynSpYTRp<Fz+l=er
zEP7Bg0*67B{T7Mth(#udp6d-8`7TbE$KF2i5&A-qjy|938MBMWW$dSLVNmbjW42I|
z-Z4s)gC%f~`v8LzlAi@Qv|Wrr3z*@NnE?B_DT1r6L>=FE8-<L@j!O>Wd<JzQOYHX5
znSfijXIOJ>rc|I;TQgt-2+Z38vL-`QV*D7y_Oz97mlkb#JL5ubQUB$MQ>t;T=iTIA
zeFG2KZY`l?iX3kFYfm%-8ru}@V2nF(`%AWw#u13#cRSeXM?(d2D?P{W?l2=W>i0bZ
z4bTkyb0z)(@gH-ExF`qjs7XCsZvTSm7ddRwdm+;4e@1O3*GC@~&M0Hf;3CatgOFJQ
zZg4@hz*@@5@8s!AOQt!#G8`_2cgDIZ*#oSj>bS%%O?nE`(k$(`egH_jg}j3)p$yP2
z>@HE4?GOZS^6wEg3fowZG~EY$9DZWc(xT8tX8C|w<W&4gFv)2q@U7Jw$bzN}NuC^*
z#k;S&2pslWt!Hmg&k7Nb>om%AFxN@{1f4L=w~d$ZRa!}{q#!((ITwH+w!s{EPG{0%
zno|?#mOKyKN)v_l1_RF_N}FQ$Rm_I+G{=Kup-o?(37hX%t&CXOwcTAp4U;_->da!E
z%!1~S8vO<H!tvs270>It<C7V!#N_xFU35ZsM{Lk{fKF5<yBp!)JGbZ0k`d)6=34@h
z&%C5B>wF$`IDW51xFmmJx4n%h%TQ&qi&x#LrC7JT_Ka^3TSHOK=mBiM5i!;1DqvH5
zdpYye<(~L1frGUC&c~5S-q^*jlz3@}O3q;0e}mX)#<KOjtPlp#xJCm`w5FGHL$g|;
zx1mzUxw|v7E^YW>`56Pi23!`~Bd<vPdqqRK!NZWl!>laaoxc-PgJ-W`?0G#Fb&Znp
z5NYFvS~T?LQN94;xXE#_AJ_rnfOo|oeCp8Vvf!c_`fVDq0N4bL&W7~e7huZ5rBhKL
zdO%k=HYIl!0T3m>ofMYXrrYxnd5fqZ3C{)1Wkd!Up+9=_G|N@N;&uKCFQg&~tN~xb
z8cvUVI*l)}O1)yYU(?1hS=A3+WSwuHC<#4A%7eH+oS+uAw$P)M$kPH05-QtwCnb#(
zK)k8@D7fvn6bEku7yE%E_2vbv$Qmj($)dNxdvgCN;*^UHR4M{kLmAfN7rJSGPfpw8
zcr-YIKg}`>DS1Kp)JT$aYCTCP5W1MTUZ`2(#QK-$*IjG4hs`*>>$mZKnc0$aH?O7N
zv*KUh_-53RU#g1|eP9^{tt|hoWS=Jn;w@IA<{t`a4VC5H>Wr`$s^!YKzo;lUH~mfG
z1x`L55@qx^pEj_@loa$OBH(QmZ-adWUNul3-qCdI-JzB9{t<~ExW>D2oeJbof{)7o
zY=H3v3|dYz$xz&3NJPLy^r?!)YHYv-$7+EXs}BuItujIzTI_G$VYnC{HnrLs413~G
zlsFdGrXPKt0}&Zn|EVwhGfQ8CQ(vp>{d*oG?!O@_Y#}K$&pQC^{IcoZIr&4${cym<
zi`_3`^<k!3w0b6b0Y7(|Yv%u-`~;{l2d`A);1IkEUPl=c&o?OX$>Wz}^<ayJT1*XG
z_u61z=;8CL)(}9NV6v9aq8Zq>M9lg=fp;(v?Ki*#5b8wThle=N)L<Gt9u~VfQ5{GE
zB0Zd+fk=-i1m_)piYR&F;uu^tSjBPUp;+Vibmob=p0D^8j{mpc92+kxA_84>@<J%(
z@1Jn9pJVtrXxA{JJv+bv)hQtkvoE2MEV`;6#`5-v^Off2Y?SmKXGN>*2?jfM&oW#C
zvIA$Xza7d42{H;-&WJ$%>>^t#{Q^+42$Tsj^0C8?dO4-eWr?%RW&|)RH;Y<HuBdsd
zP+1_g-msn$E<TFgx||wjZ8Lvu?2lyCfR)#0PL&Sf=DafNEB54xZD0rME=+$UhecN5
z24U<}Jy5xxBwh}8Rf}n<GQ~~iekQ%V53^75ljYo71(JFN@Hqzlremmz&ucpP=(W?^
z(Vzx@Bdlgv^0CO;_)qNs{eA7-4t#3<D?Sa#JTlX$XE?nCzAxDJzJ3v@6ZPQnQ}Le9
zX}BZ4T|pAH*v^>P6W-k4tOPie>tfp1Y`5o(UG4AT*P)#my}szW+8WLnda?AjVGP$k
zc;Um>%y9Bn=wDd**Z=i2KHG|Y2JCR}8*B05B^s+(c#@+M%x|`mP#K&>2#-5q;5BrN
z9azju_X23=As}3MTq9*X-OxOzRokJxzwTUoP&jTP3pq+!d6+fA`d7@W=0neuULYE_
z6QEncMHi@SwJnq+af=-l$GT4cx8~dcg2^0U#e4%~(Ea~?sjaO`Ahu$}k3uayuL=CR
zJ}g7<+eqf$*qJClfmk{`zD<AVi}9Xy&l7)!c=ct}!*FKDve2N3RJ_bbJ;?HV5@oHk
zJ$QGPaWw_G=qovv?pVP@$e6)%1r|gyWxU5G%7iL(Tv7<_?|EO@dd|gg2`|L!v`b@`
ze*DL50Lmmp;d3nV_Dq=>7uqLs(~mSb*LL33$3rKNvc^rmJrJdaXC+SR;y{0-?qLLV
z+2iAnKA&QmpoGAL@q32@MipGJMYycO3}f?8zD^9$Z)0`1Lpc@Qu)@ukGK0r#841*`
zJj03g;HTBKIf80Ga7}P*E^`28KtN3X91J;k&Je)T7(SDpfBEw3rsl^q=J+=oduSv|
zYFtiv|ID6QbLVq$?)@~g{&1hgkGB*V5IHGGLE1Y#h=M7~0cnX`WMw1Egi%+Y{y<nm
z#huptbcdK^B*0E)8}6m9*3}`^m7-1^JE#a!DUE$Lw(P0K>;a*LwfUq)-Q#&eLPWq$
zy4xlt6M3P*g>9#6E0SQQcdFUBJ~)PPxa&*oTjpIMwm4)jkgnBy5cO+&kR-t>y?W_r
zk`ocr54F>}Wb+^-85EjT-=R&GvB@xaXJjx~dDU;jZl80U)oO}9sQduw)o^#004`cQ
zN343uwO`vI?TLA6M9y7CEij;0s}O(aw~sd0{DcPni`RGm7O@`vBRyHT^yyj1OMo&U
z6lHWx&_dKUI!b+^&R-~%wI7;gL`vUwms&$D$G#0`Gct&0y0uHVG=Y-ke*Q-3^&d0o
zhJAb2bi(abUA<zX;8Xfy&&eBjDRwQQ0@j&x`FzMs;(gnX0M=is@m;9v0Jt&bQrB_a
z;T~|<p}o0hxG?%pj@tlN32aEB#Y6VbGH10tUf=X}X{b}-m=vT83J@du(ffXD-zJ_D
z|EWMuHq6RSkhY{8RWGI;LbHWva@4cF-=G8T9YTT4SbB0*)j}0VIj1y@ipt*GA4QcA
zx@bmk!QBm0%L&|nIXWqEpEZpj6x-~TJZbn0#Oi9A&R@k#fu-{zSAZw>WTIa$EVl3U
z3ebIoZe^}ZP}*}*qXPGL45IxbjF2zvafnI7PkULuJT?>qvklb>N5GvI&J4B$5K?0w
z2y-^P6$fiibKxv>AZl|)hFM4saCeTc6i}G(xf=K0eKG_7jr7T!Yk0y<wjzPyb412r
z=UZ!swheCEe_6g#gor)%bS4ItfnO2-w1YMuYowrYA708J6TLA*{8zKlY~tYK%}#@>
zM+<YcR-iLGmSaDqy3H1v_F>a3SWfT8Q2B42usJvq5ROA8?*EU&+~n8Wcp^ReM5<4L
z|J4wS`Gf7N^9O-t`4Nx}ueYps{fAN(nUSqgOxZ(tUU8uxhKSOL_R|@*A>Woy?xeT#
zC<a&BgZ+b)x6sjz;Z?W58JCu1C?#+xWpiZmVEVvj3%7yJqp<IqPBp3x3mqM04-Y~t
z@<-`lng|J#XTK#hhkM$-_LL?fjmgRA0WA+bR&^R?DtSsnv}*kkn~e})Lf#@CEP&Wp
z^%o<ek$Y@TLSVw%@WPtA*eV)i#?)R`m;dOJ3)*|PbmcV5IS9_Y9``jfk)n<9F1=x|
z?qNTOB-ck<ZZUD^?P{~P-Q9-nP-NKQsDRiZ&@J^aovPN}(_8As?FnXy5dUSlZmU|j
zprKL6P~F}{Q5g9=HYfb_1f=VeH|j^JvTrrvn4jcaz=IdQdj$wF9^?W}a~8A`A7N?x
zOzGr(ZJ(PI0y{D<bT+TnkZJQW+$B$Z8F@|qAo4<hEHKUhhbLg15efbSfQ2)M?a_A|
zMuqR+&3*qweg71?xD}Y;ka!o?()sf)&_-_0J{_B^t~7Y?b(mUDRhf8^q&(>g+sA-U
z&Ysh7{4o)vdLh6D8rTtJ`DcfH!a5BfzXO|{jpumtfyc*F9p{G{>U-d?%m&WMZKx>x
zmQ!8tXwVj<qXh)F^TuB*B|qjUI0u9kE@0bjOPz$8@F?6N{VRLhYGl$jv{OBucK+U9
zV|HnP9iV+Ul4J348r3Gq29ZD-I4`Lw-gm{Nn(MZ~z1+pw#9GFsaVHxam{V<T%hv8?
z(zO5=leYL8u{XU6PNjiFX*slq{7JP>=@36~>E*Xng_q6j?qn)^h|*J*OVVmMHyTXj
zMO81zY6Vn_*Tpz5S4nhkMQ0ZC8yqW@e1>7-4}&7@Ks&-Mwoqn__XaEScD3)!kh(CA
zY79`L&BS^4y>`ZA$jI0o!ZrT4Jy2*LRF^EY{ZE2cZCKd1+inb;T0gY2wcKZ27rkzN
zZS(#<F-1#~+}WbfYQ)zcA#^*e^(+Fy@<E4wUZ^W84_IsX+$1bz|G>_xUdV=~(dJPd
z*oeY6Gp+Zt|9E~Z!f?`s?Q9eLg&7eq{}mYh7uCYLuRsDVjcN@?DGq43eS($tB7{Aq
zAcoq?dBzk%c-4tHX=FljaCZ5Bn;1o;Tg<iy(pp%;$K2u+)e7wl=QvKmfmwh-{N<b^
z{(_mxqIGeOt~~yq-)UpL92@(sC8(O<rvXH2i}Io2_e9Q`v8V0w5Z;S1!uNadrqY8`
z)F)z*JAKI`t~%bz^vLoGoIQ_#MWnQgsS)qmd1Bs>NKQ${eFdMTv<lDKA>SC76$`|-
zW)o_stiBV1j}J5F^SFpbCWQS5cj;a&&C#A~JBX%&`K#;Rjudk{2Q`)6#!+QYSH2F;
zp=3M8AL?~K!1s9WTOLCBQ<YJLfd?AQ!g5q_lvV*3L-*`5XfSKQoQ}-%)IU+@Rjd4;
z`So+v&!`9hhNLx`S5CMw^zjNyZl_xrvF|RiXwE3ZAFCIo@O_6sl;;<8`4REa_|Y6o
zw_#H(sggTJa>U+av$pstSJ^k@4>;odp{2dq8s(Z2SbcCj4>^^oAx2zo{$?=qysZhE
zZ8*B(F#iX&mlci~r6@nGxZU1nVx8JKbn3_?t-f2rB=EEBxU421Fzr?N-3Dz6CmV$j
z#%+W~<C@HYgq8q$bihg@fu@o`+c`BZa-k3&g_0WNl$8{3qwQx=(i(Cp3e(?AQe~T<
zvuvfSf-?axmfp`q^pwrp`Lf4by!znu5g)Q5iN2NXY%8R{O{yFt37n3M3|yX&;I;-y
zW2kOw3^-GUA>-|#+-+!IG^i8}2RhSgXUYexK&Y>prMwu4b6TqViDsCqK?)hZ&W>HC
z>I>a0?xLv=o;liw;K`o~&$wPZ$@9q(s{9(|`XUGgKh~?Axdc8EW>h+d3zgV}&zcV5
zqCsrveE<kAs(bOD4CPsLJHs5EyPK(|!J_H~Ve(`9wXvjp!+D4V01Ah{?yD;sZ5&Kt
z05B)FImwMIS&LqJ?XLNQQ2dYT5Lry@)>q}{G^m!FIe4dJLH%ealiO|R*}d2YK}{@|
z{Wdb(h9!h;g%(Cs8|vHO02<+vbb=*rOA!Ecg>tN$Y1pCL2cfRb#KnAv>K}^C^HxRQ
zMza#<(>dvu`<-gtH-TZ$Csu7z%KN|6d_}Ah>;GUm1}c)kB*JQL(b7SGzJl^$A1#Vb
zERF~k<!v+k(GML6O13?5p?GFUzRSTk2R`vj$=JwLMt}G+-5wngqrUZ2+Fmnf6guF^
zwG&x(RzN7FL!13w4_oX51?`a{@!?|vuKiyGg1mrKB}t452My#oY0p}ljer{Fy?0Bz
zD}-HoVAmFix}^7l9Ec6TTb@I;p{unXbzQn0+U2)T%5x<2osQ_I^}2+YzdZ1udJbns
z{@x?3US9%WOVaEFK&1KD0w81?rQcls3`Eq#Tw1calzfGYEcyOx#T{%#hwn!Pt(x{s
zXIO4#Y6^ND#O;X7H>YS1LbZ0a9G@g8Eh!yAJH<9^+g^O8^5Ebbb?r;dh6jUOW3Z_V
zr=Lb5sh8?Di;dicx&RkD>94yV%g<ikApN)qNh1Skx#&d5+WKM<e$JqK;oy_{lkVEl
zjnGpGq@<7p<m@2ySMSJvvmwROZOQw~tqK%qo3=z)dlaS!?i6}`7`V8x;Oohw@uDLX
zar(^4FRR;G*kyRt3Q;;%z0uJVKFf6fZhOLX;<6d0Q^2tF1(NMBPjAxBL#QGn&76oT
z(6Rt1U23%hg=hR^|Gib<xp;%4c2@`lzPPulN*xKJyi06NdMwQI7+ZmJqGUMh_lo3+
zwGH^ly+A!9_IqNqhoKYTJV*?tcpo~fu>*bZf%ICq7>;t536WXtuLjcnZ<y4M{8v%X
zQ&%UVe~<p;9kt5&a6pi$dK4MaMCXqZzbX8krtQWc;Qz>KtaWj{W5F;EVWga^bT453
zt-_P0GE)jFVRE+(TxQ^t$XK~7<Eq#nfBld2;qphdE504Oim&!TQHbB^UViGubDNEv
zdP$f)F{d~S<b&*4GAmy@IbMJb_dIy|(Y#4SfR_MR&4CiAhs!1YZsw4!S2Nq9@@ixO
z%k4k|L1L#uUvdwbAwyoP(zUSOEx|t)yFcky;240|xp1Cf=Ypx?RtfM|AMgH}Is^FW
zT?K#p$69on#;Cr$09n%%TuU83<PKD=z*eagvukkDH?Gpm7u6jcCD2dShU<(1)uW~z
zx6i^kY)%#Q^pXN}_d#eiW^fno<k_K`1Hz@$O?)B!$3%>`HVwMbq6K#NxWBD4T{Q!R
z^aMm`CHuslbt*~+Sj7oGn|T_AcPM|Jv?JF2XD1f}&&Z1&9rfZd;@m;8%T<N7#6~8u
z96jyoslv*qsih$$wk{a&9Fo=n=c_REUx(8-7}FjUOE=*1W~^fSC&OypS>=F5oxau?
zpvyiPOd_9qygk7G<w=&Nzi^6;;Zz=;eOr)$Ymd42(N{no5pa7n)ATRoQZ-xn^fYC2
zwyd#Vt<--XFDD**70<^p=(Yr~&15_NG`bJ1%Vr!EA4*%^FH`juo)y6^b}wFne8|H$
z_dS*4y(8=a`^&j&c{mcO>*HlUJni!@`LWiOE{Vp4%os+~xzGRQVd#l=<E_U*RV4IV
z@Sj_SO|4_gC~Zs5`Xuqqc~%na`d)s6RaY>Iq4d{3?a|3c7B=PZ=!17CGlXHY$J8+i
z+O}!_Rg+0j>|YpL?_ifo6ktJor+3iKMDBW%A$qC-Hs8&WcMQzIgD;W3A3>X?+zvAU
zW$1!@$Z`MkQg2d8Jy|XA@3wRK+Ko-{GAi>3It8vkf48&1SuAw9(jSd(Owgx!juKty
zNB2r%q)XfTjw44hNv(83@y@zkynam!?zs4$Hm*I>N%(uF1v8+CJwiHkZ|4FvePQv+
z!S_>-_qr9@xGEg${c6ANH(9U*vD0p4*$^S5Fu?q*84NFY-2Cb`$&Y_$WOX5N-VQx$
z!M5b#Ofh(NfEq>`Hf)j%*ulYg`bMWzjMdaGileV-eK^tvr#wi6RV&LEb8R(C<TpaM
zKIx&KlKMEPg$YXZWMBye$?mR%-q9QUJs=|NwzM##y>QtopojU;zh*Ql8te&^V2#eb
zhxRsf%nhctXKg=|#Q|GW_3TAZk#fb}^u29p=z)giPgkq{nu#HEJ(8vnc-R2MYsm2t
z<2|4&ER)%rj#N|R3v^*3ewZt02`wk*Z9^IEwLOHffhSm_QIAhe#IN2%sGfY<McLX$
zp~yTb<&YT^wEsv>PfaBD@x1;={L;;O^6vp(#x$LlgzA3$?`h%VcT7Pt;u#H2L6B|G
zo6(#Snj7w)BDSvprlmq%RvR3bUSZ8Awyiy-7q?ifHDR-Xt<#0}2mb?a-TdcH0b&fr
zZ*~~3UpMeS`)FuJB@3c^bb}tqNB#REXhU=-+Oh-f#wRd!72Hj~yCeo$Y_;F@pot{B
zxmIGftPew9mLO{e2WVp<?23LqS)y4Xe?TgAY+3cN521J=w?{FI^qOuxqOUZ(W3tpS
zfON?WC^QK;x3WlK>gZkBY=XjiRq341`si6fuT|Dit0&g#Deqw;k&nryuu*7-a6)Ag
z$Rt@BTPe;3R*T=f0(_B!ynJ8=QFKxXmMyl@B-?ZK+gCrMAQ#A3=NnV2u1Et?!$M&r
zhWkT)YSEBU2Z!%$z_&}nANg#;!)xvZb!@H9#%u31&mOlO#NE2yTpBI#i?3_zyuFQ+
zOS0J?d1~pFC(?yeFf90%*@x<Y6b&+lC*qrwX%~{s545YTp*5Qh<i`y#EpLPPj$esa
z7c@eZopnOe<Xb^rS=To!O*DrKuftv9Uhy5g>HAKB(di9<v#hlZaF*pr-1&kaAj-LF
zcJc<U{l_gs5JO3Q3pm{Ek*1x&S<XFHTq^fqpY``lNoqYNOj0A&)c%jBbB|~G{r`WZ
zsGKUvnWU&B<T%GlsGKTqgcv#2a>$(7Bq2GI^C{$%!yKBkIiH!cIgU9^PMZyz&Efa@
zeE<0U>9(60o7d~Qp4a1XzvB<?JWQzwh(&Z7ieye$?Myb@ls$=NVn0kVd7I=0Y<`;e
zXIk+}_Ds26Zx6eHYf$&$^Z7t^UrV&tH<7QIT`BVKzpGoTXnXf?uzngo<;?~TM>G5%
zb<5xeaszuq`SrKeI=lZ<{W}al+-5z{&IXE<axc(VES*AtsBx21?NRFBSm!qxte<xe
z2Bm%KWfrerJP)?my`#~nCewkX1Fuv6;Y~w93%8Vzp+D7@^fGBrOKZ<sTW=Vk1nkhz
zS7g`8lo+JTW#;b9>{^BGU(sn+hIkx2-8b3A#x8i)W+0Ot6nmVvQwci_#*Q_}N&m_Y
zB0fUPvh|;7HYTS*D5Z09g~J0Y>Hk3iPHMu-ZfvWc!y=GB{Malj3%%VqBmK1n0C19=
zv>(Umx8-es_)%0BSRTH!UA(PtTodKL9S+buVgbeKV#1v8rC#8}{#^M#ZQ|9TcP&fS
zEw$Sp5A=z@+tTpO%Jq?*nYi+3TB+TQj{^grTGKPT{~E)=h{-LTlpdo4$Zo#8c<p|f
zWbJE?CeMekc%f5>OH+0C3)aU@U%@RY)~^OZStplETcsWjl>I!W>sU7>dZBGkUzdN4
zjt$EzpsXb%?Q;?IF8E6L5L7dwG0#U$o&^RtSqIP?HxYzJ1<u!5a)u6*^~=neBQ>1s
z$R?^#-Ew3PrNaKbbo2`e1*-|5TQs#9ZSsH$DtFOb@R|;rA8NhZc4E9Lrz3B$vkYg`
zs@TFjQuubj_ee%Amg6gP|H-Qg=U`*3wrHYN?XTlE{S)m+h>m?T;Fm${*WBnboremR
zz3uLYfQBD!H%vfo5mrxBE53;ip2WQAp0MQAoT9XTYEJFBbOhnU;)4Vi`dnYA07Tu$
zltY|Pe6UaksQYX|h@jA1p*7nmD$2Nr-&H2!n5ETsh624V)O7H_rdlL7W8fl~c8*2<
zGZ3nTq)DZ_E6rC6J-$>aUA{#cll)XFCi||(MD;>IASUY1VI1r_2*<c{{bWQL>#~+|
zIpC9prh+hBuDN<o@79K{uA;Zju%6H)9paayu)q8(q*r1ty9?5Kj$c(=c1q^WcaB9Q
zl&ogF!#9r9nfiR_wCO!9(Ael;ve<stMdD~Clc{{}bo#0SOXK9ZIf2Nnt&E312z-dV
zB&}_=-sZCO(_D!)Lfx$6r*{HoMhMThIHW=9)hbtDBX#S3+OcCe)ZjFe_PJ~8@F~t&
zq4~zKk=uYr+dps|A&jz~FG&Ljj9wRFY?c>QVsA2JFY$kIqJ)K*J=74lyDQBEl-KJ2
z1z%VZ9l9!e5-Mkzw&>qfFp$P|b1HRE##W1qf4WId{##8oamMP#vQ}_e%9=)ZXh<MN
z-`5!OT13VK;9Qn@uTBD>S!d@+SJ70kd0lU5<1yXB^<I)&4KpI+g``B`Sj1s^%#kL1
zNNw`wTKWpAK)gB%!DQzUw*s&ZS|vSn3S)t{;q&>s;pOaxbBgzD%M&f{Z>F(-VZ!0V
zcp*@@h_CoTSTAqto+ogh*97b6Kk*F~ZkqVaZ4*hwg{i&g{_sA-Pnb57hw5&@I5|qn
zPKxZ$++%n26-@PKC<U5<S8E=>WBGSC|Ef!W^9@E${PHTwt*Rrv!c%>%&Xj>Yx;EF+
zyTk4|IGo8n=MdD<={k9ZHdAHw#d*FLAI9(IwbrQ`ni&d(5@@%;iit9kRFFXCQ!&9e
zL&m&*!uvB?B~rwDX|5(_|M%7Ytg^oc%fdSr2g?;gXNXImL5n1R*L;$1DK$8#cA2wT
zDtE<2Zi)~-_ljEA9l^T*S5iRk$Q3_ifH`&Z#d5E0Xf@EG={^9Uq+wKJfBP}>j=%OX
zVHa;`kzIJKMDaVs$h#|@Wj9r;=ugJH5UNCpK$HvB<;AL>f|=RZfVNxbVQoYMp$ucZ
z)8K;pY}$FKnBgTU_((3JtARkuKWQ$D3HX`O>(mJ>am=sjl^!c3p1-=lO%2uMy<)3T
z{Tw|xj9JQxZ&(8>i1!X?{s=)Gd@9$aj`X#F(9N%CGbcs6KOH*8BB7^k5HaW(TK07<
zoQg<2hktbx`r~uSjV)$C?Xc#%FBK-V@Vo#BSu%H}LUZ~%*t>{NXqMtFsj^~22CSKe
z+RLFV4yf+O;pf$^qazT+8Reny4bFf`vr<{RVpICYo(AcUMzQ!w(-?a!nAzb(KPoGg
ze?djcLBehRvi8nEuOwk`rB)NLwDIWljrsV<D#_&^#k9Vq$1#0f6Ya8KwoLOzcu>L0
zMh4st`|APfyHEMog?5uY{ueQCZ%7jBeO%>eYp>nT?h_~BSzD7tsu?rYQCoEVnCyf<
zZ&Hrss*k4$I*6-m2dFuZu%TYRaJg_Q{zFosf$RhfM#fhN4_qpFLw22naK^4J5HLn=
zl_Kai`P3yr2^@ZSzWxkEf(l|9yrm>i``U&N`9k*a-m8EKQ@talF0%II0G9*)tBCN$
z^CRM~hkyB<h7XE9MChgu7_Xgsc6GLT)2lRCvSco8aXJ`#zsD08v_7==58o04K}A~N
zt4C&vfmANbvS5?rACvc0zN#pk4XwlVh`fcMMkd|e&+Zkg);(OK3|wd1gdCb&^xlah
zL;gYYA?}fLWYcqqRsV^bUXW3QC^aVa7`oN`N87Xfgffyaj5#=FoA+2H!o;Wj_K@Mn
zN;tYc6{R{YNu2r6XzWNV3Cn0bJcn>{h4rb}s(1gAyzcEJLT{WN8=c$BoD(^s4}N%f
zGWH|A)91EaH@xRSVOn)fYUodtZS$7M*Bx8BX=Kn`OBIuc(H>|3#-)_8?68W3$Eh?k
z_0P!!e|ENXS}Gv=HO}xooX(VC-FVh=Cq4o*V-w`Xm(^m_T4TJ3WM&&RBTLWf*IsxE
zZtz48fm3HYQzRQ3g2)pYn_4IG{IUOBw7)bktJ}_3Mhw4+n~1SGI|HPBH#%yL|Fl3t
zXEY48@^@)Jb5EAGbX~9i@8C60QSB*k{n7k-55aw2)&J&G4Ya3MU3Xg+$9`)2Y0^Yw
zk-y&_{Src?=fYg7`OOmT(1PIy9cv8laBZm|GK%a^)H9Yz_-0lYi|{~alQKEVsze6U
zkJad?dTZ824QwCf$C$t(#_WqvCheVMrTHES{yPs9rFlA|u^j#lYE}ih)kj#$gpQ|X
zUe68H*Jm3@00l<Xb@N5KSPoMMDEB0l6jC{rTJ%5=234`$__16sSA`c`2kU6e(j{G4
zFPixHHCb`yBT)O0<=ca&t;`TDl)MBO()^(q=HJGfV>w&07&i1{VCi`7#^jY_h&nlB
z^k)V3AE@!LPjVf^$nG<oG}_4XUpeD>*hGE6_EzIv{@cl}cLp!Hg_IXkY{9D!YZ8t#
z0V?JERqC_w`h=zFM<iq}ESma}*#LSEzufKbG?+)xMn$iV$3~xyL@Vf?=Xr04Qr(|H
zXGTpBx?QGI)%(yl8vs6gph?>o8#jR9$ES5P8hmnrbS>`7lgV|mS?}p{r_nr@c1Hk1
zimNeO8YjBMd%X!c;a<VqHzceVuO9XHc!W>+mTt8DHj(Ze$v~fauOnx}$9wgQ+70ao
zD8v~0!Ha19(<CZ~bvjp9kh7e1o1Sm4==2S(EXTXe2kKD|=e}Zi{D850YySnZeM_)h
z@=M^H2})r&N(863c5s0(SE-Py_KR)mf0M;Vi+Xzzu*AQ*pH2Qt<0b=1tNVLSvQqmp
zdHaG1vk~|L+!&6>9JGM(`>-l3_{eW%XG;@cRKNW`KEffmz>h{MHiJi5aQQ+57i}7e
z7{(@B*aULY(_#BdDE|hCv*Ds;H(in9v6{h8h6$LmcF}70XFidBu+X4|CISMY!;tvH
zV$UwBciszSi1x(7R{a)JzlVQS=slF5cQov~PW6#L>f#Y{oTDlXqIYT{ZUa~Z7QT%<
z$M)t{$vSMm^}@d3f)aZMP+7a7f1#~UZvHR5dN=DFr8zn6`2x3G1)t<&`G)U#2pMvn
z@xVQnMvU>CvV9nK_(538V-X;fgvtHZl(GHse`-%{h_uW?hqY&aqu&~IF?tlByvC<S
z%X@Egp^ksg9FpO&bgAAsD|^e-%EUVLhpTGW-Jt^$Ii_1F4Nr+?AK*$pB{qu&nIlKZ
zdq{Al#KF_5WGia^k=ew`$?JIf{V>9JlxL_V&UblKZGf*H6ogS~Y{waEW)`Jnwk4i6
z9s3ysVMw#ade{-N1(WyEJ621-cg(CW{brkoA9!!?zOE*|Ry&lc*+`c-^?US0VT)@!
z(av|4DjXd+#BfX(){0#e;DnWKq6GGjp<?NTS`G*g{^N?5qnb86dRAu02saxKy|p$s
zQFXrv{{v>wv?0245~l;=fb4q-^#zvsKk$uKtq{B4IJw-Mi^zZHdeGrAM1x2iwt4zX
zTdiJrm};fO3EQ?U3;HCuFE+;^_gG>aq%ROTIasG&tq`!lWaIFKPxuNjudHC3t~@<`
zn<uEOwf>vN5X)A3H!Oaa@^%k7Kz;U51;-WjD>G)_Ect5xv4|@8QTO=G1)()WeZV)d
zR25*e8hkn&O^9XUC*I`hJ3*pY_beqE%1s}vQ6A}hf>`ODT&C)3<SzK-M4M_uHB`>c
zzg$OdTd;g|gSro;sQB$bn9Mj(iw81|Usc6hH8Ra}6|J2-d$BiqUH)ceTfLfgVS~F%
zWdT25(OJj7JXh|5T>N?U0%DqsO*^^GDp7QArftl-f>}8wz-U+`oNneFy->?7WY7~}
zvpZh}e!FEljquNG4Oq{{C?OsN;Z(~Oqn=VRqvSywia^$Yf7RD`ilflbriH;@9*16k
zqop!_m&^}phSOP+g=dE$n}6As8@|jpMDzGl){%1$4(te4JDP~QH&BC<EGczdHRj?|
zlGjg=Oq85Qn9z(;vlk`4ei%72A~gEHN=){9Nhd$``H4YrhK7KJz>4G!giqezMU+rl
zJ!zkXt$>4+Irsqh{l)6*Y>KX@k$0}yPgY*Di)V~cC&C)YKBbLAS{^DVNszsNgH~JG
zM==Z*V;w=TYY0#LyH0kW!jrs|$BmikrV)kfeIpHGD#poMpbTyfnA0?wgH^8!)KI=>
z+*Or?s(!iIrMk4gGT!_Z?$jn-s6yxeAsrbYact&&7XOnlx){sOgUog$vQXYRt?dlj
z#gX$yOfJ%pk@dY+rMHBL8;#wKe)$`MU<@ZQGy<9ccWRPanhB83-$MdQ==-8c232Ii
zXk`Xk&e&CknUR0MP=+`^(M~YeX#B_k#(brhQ#{pHBJUU|+8jJw$FzAmEgc<ocuEMv
zC1~0c(71PdxD{inuu$;PRe=*1ndc+B-MSS%!-Zh#2ed~omvP057Bv76vUF(=>9T|v
z<FU^Gbzyf%ku&@2EC(VW5^g1D17lgcNLLl4VdR(TFa4kK&V}}Rv1{b8I7p!BWhYlo
zw;z_JRn*`xo=fx*K&?x*_d8O50VMlEtgiscKH)q6Ywu*#tI%E>C3*(F(3v_XU%j9n
zUN5Oad(1T1XKq>;HVQBfll;_Yrh_xEKgn*j3-j^q8FQ|pnnMmmWZlX9Rp~wCym<WO
zf#a@<%gD=M`l6oiv%%>6bX7Wqn)Zsq#JdD72j;6p<R$s>INkFqxHrTsDeBBfPx`!|
zLvCeILpk1gHFU1EdN+h%3`agay#R(dswn%StaiQ&4_qc9BUO_x6a-<u{1#U@is5Q#
zU!9h#QYrkFdU0*$m~Bv>U5blRxadYiQf;D;P3rLHoBM2+JfczZwcUm96hgI)v9i<|
z(#s;<Kg?CNL`huZBBb|x6G=T_`kuGAxawonn!Jft*rJ6kK&}X)l<fXzuST6&I^<`q
z$n`Qg5M)Kkx0H~c@5I8NE{?Ilw%h1I{ww4TW$!4WkOj?b?XP}ms)<?zNnjZ#@Rgxm
z`}PHiyjG0T2{^2~dAUaQXPpfh>C9gDe2Z;}fb9XYAN?NO=ijd<o@u`Vs36V5T-QXl
zOB>F9d(~#6qIRM*>D%3`zG+m8FfK?8u}qs*St`*}vzJlfVGSsKNg~YVu3__KBuyi3
z7O$ab4iZ+^kN4JsLeoDz*g*;0c;7Pu6sbkIM0o4!MW7xT6;lKQr^4KZg-@~D7reT1
zqIzfAB_nKwdFyT=afm^+k&<}H6Q|JPyGO_s49eIUg;Q0svBO?cT|Cmr(f-Yi2Xc*G
zCVOjj4iBlS2<MgOMmWTsvD)^K=7zF)O9&1jVJpF;Hu>umJF@o8QrzwBGkJqxX5};)
zNfL{JWLHMcn4-*}O2&Pll2F#2+#As{`w0fdsC$UkiW_IVD8j@!yd5&-8-Lc`gD?IX
znhuk4QlVSzshZSWZc0>GK>x+!ub7Q(p&O?NMFt%m%P9j-Y@%=YO4NTXOBK9V>B?#u
z3jDSV)}@=Tb@)Qm^;R(GWzMktfxh?A^4J{U2^TtQYh^N&?T`LP2w`cHx?*ujQ7q<|
z3u2V&_1tLICh$8^+H*%CaizYH;wqSKw2|KV@*^8<W~6rwhvhodxWsNciCG$J<VUyK
z7+*w(d=ql3!B=gX)Udy~0NKSV;2GO2KA^EI2hZW#4_%Xey1ewCxVTVlqnl~`_Nc<4
z5o4ju+f-BJ*&9-EyiK?O7iXoawziTOV#r?@F($3a&e?8I1+&CIc8J{CZP~oHOW~x=
zRLF=AV1K)~u2CM_+$7GV){%K_-%NDW4AmdINDybjqb6#BgX<-|`+G>S{zas=1G(gc
z{ld^y^%ZM&E-H8@*N?=X0cJ);in(~GTrq1YPS{5#Z9&&&mbDHJ@3(fR&vEi_S(M_L
zrKG0Wc{22In^o2I*}K<){%>XyYWPqpObpQiVb-0Qd0bYkc`8d6UN#Et)+%;mv?j6!
zV(Qo2$+=9bKELXWr@4$5$jZ0a@_@1FigUKK)XCjDen5$BgzTXhh`3B&+|rHWzG!_j
z`P%cR4J%p6Ldlu;XYH89S{&Hj2XqneLZbe6Fy9~O@Os>cx6#Le;ZwmumBSS-^3&qE
z*)53N=JUTtHL~R3lM#mFrq;t&bD6^4G^5O1{}6hULwCI+dGplhUnv0Os+Ak4UT({^
z?0xKdgyd+tWLjpBgQtbuci3mA931uM?vOAW*nE?6c%06fMx)!o2Zhwbt4v42T+PP(
zDjNt9^n0%(WNB}669n8qZZTY2!nDOa{|Ajz8ELa@#bJ1PUoP<Wed(0HZ+X=Ltdn))
z#eud-rqQZCA6W<eZ%R!{Qi`u39NZ7RU8R;`>HgnGQiln4Dx(E(oku!bi*67hd3pwK
zZ#s_Y_^BEEi}@EjV)G;8O^Rwg6?qmBRyX&HtJJn#`DErrm)4x4;ELv-Be5yWeKKgy
z5(b^V4+Q~B%aK<2`rjyfunyasmH>axI21=LJoCa(jA^J_FH!A*Di%@o5bIZ^Aeg+*
z<lqpK`--J~SRCn*mJf7x%9BwyAB)H+8(+M#;qspD1FIUErb07!&OE8nT-8q>(nNW-
ze6wMH1sj!)lwlGirMvrp1wc3E3hh>u|5I7%QRn6>P;TY|{1R6`%;^!&d$zmeL^^k#
zoY;P5p7P*EnE?mW*UaNnTyk+<L1_<Z5c8i*DkGY>cx4LUfzuFc=$ZU`X?Y=Ktdhn;
z@S3yjTgS3=W3u}&Xn(@oFY|%kj{7+Loax@~Wl?^W3u2r3#TfXW8NyQe0=}uoyp@la
z8dB-on&GFv3N%x#!amFkMDQb`AE~WhrUwlDT?vRTlZt1%MCzGM0nW<AEVJ5oD)wYe
zvo;&mY8*t`M{#XR512XGQ*^g(nq-!{Bta>`p^Z3N$&zQAzh|SZ(y~)hHLpcpIw;CP
zXB`;?DjhL0JEFU<WgF7{DhtxVEBb;#e?H%c11vDfQCvaq3>A4%`i*Wd_`S;uP}q6)
zy85XdReUH=ODhE~?28Fs<jw<e`HiB!+Kv9u1m<TizP)`rTa}d-3;WQj226@L^6g}b
zqXgY@#A6Um1ERqqkE~_VTU>7KnMoU%QRbTxc}`m`@8TgNhw^n_JQu$(rLeSWSb9l1
z8Huo04K}_eKA2R6pYe<Nk>bF)7c=pea*$ue<yrY$T+!fSQ*~=3@5<X%5Rb$mc(WOi
zO9ihs(qEA*F+mGnjU@UXoZ({xC%Nw*T`M&^8B7-g>*&pneF|ALZGsJIV{2Sy$*~R>
z)NETd4l=6-qeF7js3Ff#2fYvrwA#Q5A5IGd9W=|>lQ#I(P%Kk(cyP1yY3`Jii2kdw
zXQ;&bWAj{ay52Y@2;<vGG7I<LURC;b+JCs+VVG+UWb;!oof(9fUPWae1li-^gCi72
z0Q!>b<yeG(*Y@4Y0=dDdi!{(v#J1ygjrGg+GPgGYU-umD#c98pPn*Dv!x>VEoo_V9
z=|`Od;A0h)PaZK0xU0;?ANqv*yJc7h17Pl%GH%$Fx&KDlFR<|U<4;49P2uZ@Ec0P4
z5R<K>Ei2kge;xC#hT!_$9y)C9$~&jX7RYRzq_0zBb~|Wx1(Qj|ztU!^nt?0eVe{jt
zzz}Zi6(qsQHRimfGMR<-wLu~0LI+hX4%|SyX*a|q>U4PXlKP6wKC+FeQK9h-f5zV%
zjW>2&TRyjIxR?!%Hk|CfI8l9Z68Ya#IP3<{Ud~pUWl(!ub<({Baab~5ehUNyXG5Z%
zzDB+7W+LP`Q}2C0n)$UbX=}_ZHoTkt-zT-j*YF$(JVyXWsmqYrQOvHyW9_T1`oL?w
zZvmRKZe;9P^O-2_;vK;-dOM9b#-uoMPa&?SnGkzu#Y|0(ULU~~1gJ5cHok`9vb;A~
zbhZa!fzqh@OYT;$Y}AB1ZA(rn<`B&`VbaZ#CH&wM(n)PWRo4cjoBnR+1@Cbaa{;+w
zCo)an;x0AVl0DwrshRYU-%OTq+)XPai56nM51bR;?ESy&@cYLMxKp8iYmDlDOF`*k
zR!Pzkzm3~0dV^w}R1h7Z52z^r*^Cq6(8xO^B<sWJ(yTcmNxT@tdc3>z>ZD<Q4h4=y
zH2u?7s}+x86eS^H*>*ch^vU^op95-4xB+&Nw0!k5txq#Rf+gvR@$HdViIDI(C|WNd
zlo862Yhtnjp^OmFmOTRbJZj>==SdFS)X4qO+qx9$z8eFgi{dAOf*seRZ-MDAy^RBz
z8rO8uYEMwrvXd<o?$;`>msN8x2VV>x9-Vp3Z{ZNBP)FjzDx;hVil3|_<-`#5gSq8i
z7+;fTd-C9@ri03Q&1fDb@u3pK@$1eY=_B1+;506AO=i|+%n_F8;n=CLpb%iw@3?Ou
zI`=!;1CWQXI79}ea2|h%_t)NkS5Tz|gI1s0am6s86W0-XCm)!bayboJQ|`5BU`r}$
z+xOV>+MkSmjqW|(-O~CNxVSa40y+H~sbJ^u)m#|BpNre2oX4MVLGEneC9|vBFWma}
z{JX>UUv8}8<4llpI$kOI!NzMy)2NyFu&|eumz(ta>z0mN+bfWo_1f!nX*Jrph$dDr
zUphxA=R=ce%`U;qM1I*o!@TY-m-46<7mtIiLvWYES+JiS<JViC<0ont*zuMZ!Lz-7
zKYNxwOkDanaJdt+#3hiDl`DRH+09$+f}&`O0^c#_p89|*3PJV@#mvvGW{prG2H4(!
zI8NtM1MS)W-8eAlOOsDdI?^Zj9FJ<^5%YR0GOK2EGZ#0LpZ?qV6l*V~>E7m=BY!0W
zReM};o}nv=Z~@HcK3LKYKTk;rqGxXGKC24GhdOW2JE&fzn<I6BCM$lacE(b&w*U>F
zZNMHoOt#5cD*#v$pf{wsSGW=bdRj(}8M<}1=bbz4a>Ts$M2o32hJr;Z&~G(bA&G$f
z=?>jy2|`Pm+Sy`vkk|p)s(E3Pj6LKOA^(7WNpPgMOhKvfAqD(1<1A2vWnpL@zm}eO
z8t^IpSJDTmUiz6oSN?u@pJm<u%YnA&(PIh#?+yhDzHW_^+QnSZ^@RkJp<||Ev?=Cy
zlCc9*=H}v-)K2ur{rTLYX?&#l;+&Ati5U&tI(;?J1-*_h<N_8{YUS5c$7B_6-4EFA
zpnm~d|ICuiaA>{M!7-bhpr9!CNX5>KJo9NYVBiW!Jze8NDRaitVTT#(bR*}g*IYm)
z?2FzH)T@Dci3LO-*c`-D&bUZ>t83Y+Ay`ThqDv4kDRv(RAq!~?9>S`@ch`QkT3jX1
zOz+mmM(ZLp+zuxC5HMS8%LjR??$=P2VOk6C@YH6&&)t$faWMw5U9aJw&u-t5MzA3P
zpXyMTHbn?dnCbMD&E!u<cPKOyxk0}z4wtgYV1WI7opw=>6m+urAIw7Vy@SOTWzL$`
znklm8kDd-}mhZhco8z8CWr;+E0j1xFEo}HIjlJe^0=NNd5_dKu-n0d`MZo}ev+0y6
zMV9u*<w?aYakV+~0XD6zlTzOUt(F<je*<o!%>fJgun{{?hR~7P-BJD0VFt@oAh)3*
zXk(p{q`n^}$K%J>=n0kyZgEgkO4i>&n-QUl1L4!25Hgb_ERqjUv|~_o6_x_aMdPrf
zw{~*GW&^xllo08ePRhV)4#}NGE&nCBAFJQ!V*W_O^J6ox01x)r&>z0=rJ`^B@V`T(
z-)CzE_Jh#}y!5M$2Zj6$ZfVLqN!nhMKhgyA(TIgTsdI?=KX`_kKTY#(MaLaF5%7k}
z&h^j|GPC+hF0N)?ocTO!MPT5iM$b3&n_T{(1-}MOndg3_N9d}&%b~h;xjbl0{FIsO
z7`x6nS|@ZtQg2zt{6WW|9ZY)<S*5bM8(lWgwbq!+W$6cM%i@Ont*`>;1GmLdNrEXU
z6VB`Id-(_pa(bebUgUr&9;*fBBZhR$df6~m@hDdIAOv(o_LGYXgE5!ixkq^v44!5B
z;8}3cy%1grtpg$nKplsq?bdkuUiB}W#q7ErSC25;r_k#{U`pGvy74oA*VOi8klxWu
z-S2zrJIo?IM9#`_hv(SK#}L`$aNg6NJAeyHq~xq@acb1$6O_E1VNm`TLZ;n-w%DN=
zO$hqS#yJy6f@VDUY~6W#n$T1rH|7H#z|WyBp=V+kZMMK9NJDMA!zu53Pt#5BJwIx&
z#|Tolp#R5CqvRT42qf!icp!W_Yy$n<Oc?l{?uWi>4;wucHKu1CrUaS7yAAp;s550I
zJi?SLL&fNaCA-;mUI%TX7U(*zHVtRuS<#3tX2e`?!5zSvu{O6`x^vpob#kZqV4w{R
zcmGo4{INhtG-=Oo2ULD+m7nO5kHhR-{3}a6vtEpjaDM2v>b|!##w35Rdv~;VBcFs+
zul4FuvRwKS&dE}RT5RR6vMutL0DT}`9<smIkfyW?@oSsT3B8kQ|1901Vxiq|%3c1)
zi}$6=k)iy=m_yN@HII&>fYtk#O(0M?EPhs47*H;N%_fpQmYy_P{Cdh~bEi5>b)*!1
zh$)G}zNV}F^pI%uBI;G2{(SA_-E+xM1t%-y@}8;6lB(LK5yDDv{n$9AX_%s#Xc;aF
z!?BI|$p3_LHhKOM;Zs3%W+tE0?&!tvzRN0R2kkmBFD#b{8Z=&*J6u<R=E?MkgXt|N
zHyb!d1sIzWQD1WT7A0JeKj}c_gH7bFUjy{;g5C^(ZTB}0@^Q~`No#5ROoNE~nd$Bl
zxT{c<_Vj;f4kPNy$V{o9%&vi=gZ1TzuEz+E69_~fYrLxb(*vgye(IJY89?cF$iTy#
zW!uBpc~I%hWO|{$gkPJs+TN{uSzLHki-3$zkrwv;ef2%&yYK}AA-6qJ`eh}zUl<z5
zu>3Z&^WKl-#h@@x{CWG99l;aLA&=|q(|-ak2FO}Qh*EQdPG(4~JYFkC{%(O!I0e*1
zQQNxq8m`a$?{2<_2lO7Dm+?{z6w2J!o~~PyztZ-Y`m(jF3P5V@Yxm*rn#zqa-@Ngm
zRd8sz?ndKZW(y9*!-VZq&MvcUkw?U<AHXcGq6}b8cu$ZQozZWc8?EpLfBr<*D(BA{
z7w_qE3g&)Kopb5VEfX(3B%&*WT~UoZ7c7&GEF=V-#Ihg)**<aCg8;%Yhx!V<<{xKY
z3oIDr`IX^a#>lMCb+iRF4lM3(GKv4Bk4CLSc5nOe@4V#X*5%p%(}U1FP0mPZiZjh0
z3BO-U03i+%dr{4!Aju}k@3@HmFs>m(iG2?VqMzG686~cw&mafz0E9Vm{6Y<fUWuVL
zGi)2{U7JpR;}Bs^f9W<)>_PR?#Cf=Z>j4ax)&h1yh3!wqfzuYxr0F)j3dnseV+Z%v
zW<+u4ol<G*1CTTs@Dn}MaN*E)IuLJ@690RvS>MVhy#-Zvr`9VdGa8=eqYd(~#$z4{
znOO-0mld&C#1CUUt2ad(9^%Rr|EIOGU~g29YM$dKR-cl@0F~OiPkbSP-1Tt}GVc1F
zcE0&FoO_jvwd#viYampJ6kGM@cr(L6folLT`b{=HMT8oNZF2T`==%jk8xCB*?*03}
zWt{1jWA&B+pLm@Jio?FgyDapOqFSW4D9o-BUM|1sKB-F@3=A!K!YDkAM+2KHzh_xh
zP3-7T58jS9|BDnFBB2s#*nzZq)S>=QGE33w@VKnIl(-KN*^{h1sa-aZ?pIJ69=|B~
zC}K<Lu+;NF;1XGD3zE?(`mt`J5XJxoD)v7t;=P((^>gPD0~(?-^c_{X0#Oj8%_?+L
z28SOOzfG3(0YkFTli%kaDa0M;HX`g8$NI=dFkI->lNpbkv)ao37%ow---y+c_kvAZ
z(ia<l0;Sql2K=E=p~V}wPX$QWJ`iIX=5y=v=8GXF_Gy2T@uYTIG|%`MDuh{UdCs@)
zO;xC3-SVWcR|>~Ph09GY{{^Iks+9V;YF(;xezAaqZSPp$mJOu%uQX?EYW{z@%cYo#
zy3@}4PHp6}sXt@PzaC%V9wI;=xE7;U?XdS!<k_|QBJuFR_JNWuF^8yimMVg2-ex2}
z8@uUim6g$dTikCIRZ)+<+K#D8vsu0gf|adVKxE^~*n^KGTJ$3#TW6+;rP7aas<v?v
zz*`!S!XppU^KpE6Bn_=)9uuE0Ihv0iC7!nwZyo8xKQRI7%%CnpYSu`<a;380t={u@
z!X<iIK6vQ=4?#1N>-PPh$8CaHXs$Rg|HAfpldutm4%?AUmo58eyo^pQ*ELyDVR2+Z
zf-|+49kUD<S6m1dBGuPus#U&kvR*P0J^|f;Uv`<}T<ZyFOt<9q-oBzL{<mHXt}%%k
z>QfdrWIs(05zJTia8Jbks8~;v{V3X<_QX`}78P4cS&nb}XYX=ZeFZckS7E8WN(OBL
zPyRv(`UQi+MKc<g^&uppo@*2{Yh&ui?CDFAH9OgCUbUe8^WNL7ma4|=_UW5D+zaj{
z>OV8g0ch)WjhbhRU(=3VN`!>F-^du&@jZq;Tlu=Zj5phtldOmLgahN06z2X6zED_B
zSlMGBjx0_+f!A+J(u8*JQQt9>8E<%u2i52gfmT9^vh4V^pDG-CM^olsxPnme6G5i>
z#F!EH>bNnNI}S2{X{f)+nW9{(_m*b+9V~8IT!oMESXTCx)ID;0ipW?uc4q>I9m24J
zt!9+E8!k^+8{0h~N(tV~z-)KH6fpjwU9_8zX|{PR|9W4(s8xH!p3<<*82>xDH(u>B
zvOsbhX(cXHj``~IbRFqY58>%zR73Hk&wF^I17)HQW_xelBfjrBG)s1crW!aCTuF6P
z1SY!br;s)V%O?jw$ua{F{Ki}FxJudl@Rz_glzs%$<TD;7_-m7l`;Ra0ly@s!Z&Y?q
zX3%$$$?$b*Te@V=(W)W8S)?cP;+ejZk7zQ%g>6;T!@`W?XnnCvqx&!bY<S#Nb?q4G
zEiG?dq4D-8yl5|f>z(U^Z`R!2d2yoOu&3|EORH`Eva6;r|GK;`S<yW-q@<>rIV<8(
zb{v3g2RW@`UN+M@bj;DUi#88GE1Q~V_$YNXL?6X1oHZEVr~vMVU%}oivh3-4Gqflw
zO9Ci7@qzU#55?s;!g<xTUnh4m6RI%qP0ZvAftG(5`Qw=pslCNdFVtg0v}*ogx+J0#
zJQ6(Gb`ul;*eHmHi$;%Q?DeJ?;{Eo{U;s(Yk)OjtK3MtZ!V@P)*U-9%hNsI2AnsvE
z!1Ss>XvivH$DFV$+Wl)6!+3N_TI5G+TV)p#L-$#}cUOdMAxx&G7ZF^Q@ZwmF7OCA-
z;Qe7UAm6fcfU9mXviabPq(ZNaKx%Y|b73!n^`n22%*E5A7tQqC>=CCUqz-Rij-{e|
z&7(B{d7hXY<O(#&r!l_9ZAtCj_X+o4;@X7S7Xlo5i)R}O3r$OLjfi*_N!kZ7TG-k4
z&J>LmjJ=LzfiD|!W_Efdv<j+R1~8i(b>7}Q4<ww}*&SfZww3XWD)6t3LkrQG3oi_7
zG)E=>U?1Zf<!k3sq?cz-+e$8@j2EtC`~oGBs1YDul)OeQKi1IOE0iulih-h}DAVg|
zUQ!fb>*r|lw2r&48@OU8tY81?EI7&U!7i&2{<=>?i=e#7Qv7rE<A7Tj;%Lv=t}Q|G
z^Vxo%sC|tSjQ0oTbhh=ci0wT_#&om{qP?!`Sk<dmlBWC>%L_S)Yp%w%jy2MTU-1%v
z%t0X5_E+cndQ51x(SuziQ*>s~!1r@}ZuLGNm&Cd9zht?DjhUj4bMScYGO_93(U}o$
zYnP6YPbgnx2ZfKnRh6}2un`Lm=%Ry}*Jxn-`IP~}8eQP3>mV=8UMFN=YS38Vm1Cm5
z?HeE%o+)Jan(QRT`x3Aul47{%HZNVio}9RqM*$zIEH)koM|Zr`U+xRwG{<M8Htn-r
zct^oMSnnt|P9(eOsXrA$xiF+1p#4)S*zcH@v-Qq}59p0F#@%}JyYlqC#NtN7dB(WS
zb4PZ)<ErXI^*D-4y7g(0%qQwh(K`sr$SpJ}I8P21;s{8DE<M^y_s@6sg+FZy^oB3O
zlgNlpFkL0HlV1~Yk$=kF{vNwee00h>ELaAlDC)n>LN$9N5zfL@AXA8gU|OpUeKg`J
z%bw+I)ET8@$B}I_iw!MVbnX$-y9_7{iox{$ZGl#V@i_PQ*~PHToxlV%&zk_J*xhJ*
zR7**I)xt7j!b0(7)$l;546{XQZG0)5d#@OMqAB?3*guRS+pAQgG(_tJhieN&$$2*@
zTlDJ%NLc=E4(WTLVV6#s#F*k6gcgI@l`KBSLpNNZB+QzG@*}>eiQNL^5y1ZMMa^iq
zh%bZbZJ0H^;=;0K98ro2(MaYLxR%y1yyQ;Aj0Qpvv&#g|lvJ}=n8k<ki?}2!)9A%c
zw9N-Jh(c{|*Fwcq3d_(^7nslRRQs>(ipRI?;`va(s8QZ5Mo!;8oZO}X-Lw^{|1*`!
zxBj0+EtPh)C`-3tv(N2*sFfA=9l{93PL=c6G2Y|Uwc>UFB86)N6SVuOW~71D&D$!r
zVCatd6(}(y$^SctAc^HY+X+(Jjy8Nj*IHspRreZc!m!aqF>tyMADXG(6iuhLn%pi1
zGq-bRWjW3XDd1*fBWbXf)0~GGqRGW<%+F$A4|qLOR>)i+A3rd8WwH%%^qcvYq?yX=
z)j2PJI1AS1ko-B|Z<)&SL8r#jJHBgZt`nqwgr~i<66i1&;Rj&m=ePuT=1PCVI{Q@~
zd->tUfA1~GBxyxtZq8P4a!sCBGfYI?z%J8yvnnP1;Rk;VT2ivgG3VLd<RBze2i_e!
zNeaE!WRDjUtZXWx&#;3Y^WrmkNq28}9Fi~j=(lNLb;4KjcHQ01-~<4e7^P*w5*vo9
z-jP~0;&n}><Zp>5Q!Hc(+KIhyeS?cu+<?bQ{Zf^o{sXc?1q3%B=tqPJR1dUxopb?f
z9I1=vp6tC`e5eRq?DanSKmdfT-`V%KzAA$YPG6fJ_Vo_igz(Vr5MHkcFT;A?^7t0S
zFQ7|IeiFW+INWy}><u4a)-cG+-OrX8qo$KJ1;Fv^h+|jwRW^bk8gx~m*+@_h^OZq1
zD0E~AQdQNg6+>=OxsGe>?#+BGsn89cId|a@G;rC;qXDI)Jr94a`ERtPcUS!e<}c42
zViBS|uVP!5KiQl<p?>=axem4OrZi~dR)9H$G4-6<=jJH9cCQcnkV4N>{sf5AqUawL
z+rR%l|I5%0AZ!5?aVCqKd=619*GGrf?{_P+5ntZ&fooXJvatb*YGqXnaPH*W$3GZU
z3FzXjhQp##OIZZ9OqDLU&8=&lKTVxZ$G15oy9d6jPweG;B*o1M*71C;>};CmP&|S`
zDpBvJ++J_~rrpFh7e>Sg^6_4kU5qcIO1VehV)q$Wd1i0ok?=<ul5mpQ^yj!Mqi3-O
zQ0QP(WpP4TJrux_+3R#S#CkE|y}Ef8P~0(9VGoj(nA)ko{G+AfPAqS|&uAyysZ&hi
z%+5<dH4oQq`~el`dwuj2UlnCw-Lz%it6Z|Bhu4kqdODO8WICf$o&1@L(L;YDDj%O4
z1?NtA$hjP(RpB$X!OpAMs!=Ah`IablaQXAO$ORGKZ4b0b3$$76&^g~SEVM*ra{hEv
zGpLbcidd?uu~z(Vj&hY?)<V7<oW(#v`;JW^1O}jSGrw1nf@q4-!rtEyK4h}05{M`7
zct%2q#ZOFXFTeG}!#%UZvsS`?7{9v%THG1I<)p);Tyvv0_?Y%e9Ck$fnUYKQ2*l+Y
z!2p}^Z@_98Vwh4@1Ulo-Q2+=@E%uBz)9HTX`FStIb@k90E<|*t;f$5cbzi6cWzUZT
z$y*uk(Dd(?Y29Nb5qZUCbDa2+xXpaQkOx<ihZ-`fF0&s7=F1RY>F<7IHGm2<c}lJx
zCwkI)52fFF0EBE_sjqB98;2M!V16(w#R3GJ>JsgAfPfRzCy?{S;Y#|Kk@L<E!dEV3
zCbUMC{Fv1}(EbzMyJdxE3$j$E-mveXc$dm$_yXgBM|`m<Rp12iAxGO9U>(LX41Qp;
z56jREn5g?48c*I8Cj1yn(m+_)GE|MvcF7PNudgF}KZTd_i(~he=ah#bI8t{#DW?J`
zp!O7U9nRcOzN+DW=4d6PARl<_{d#lL!EJ~2tuR2qr|v89RwZmF6YT}Kt{A#_9L(AT
z(4LcD1ELpfbL=t$MVm6bnq3}r3^$UZ-+tFb84K3*3e;&dnK=ZE3<-1nn(-3Y$ze1s
zqIDU*b;t<Vy`FlA)JSiEbWw$(cjPB?(5=j~-mtjTx!yO`BqWt8j~`xxCA?+;z(rFl
z^Ej<+9=O3>|At9O0Q&G3cq$d_w~a{VvJvSpX4~{?J!|kN+@E<h%XR8^q$RV+-Jtq%
z9ktgE0Taxb6Zt1@Q}cQ#PhD?g^&#r*ZQZ!*j9<B_dDzI4Q|aV#WxJ5}@5y`xmm|`!
zFJD>|X<*=Tg_>}QxdzadcxblCIn^&)h=eBg74Mm7eyL5PZRJ+=^EJQN@bXNAiX4ru
zTy*kVAd#VVXCa*5U~>-F>hHx4{6|ZjbX#NP>$`345I$!|!~Ivhb3U8DJkgloCw8lw
zGPHrsdrf~&{;9ECWBGVVUuK}JDL>=Vr=*Za-dey~F?Urmld!9Hp5|Bw?w^;Zr5jeb
z{UZcPTMLrVeH-h|v_OjRF8NZxc7~mFPmEO-M|!L#d|RlA^td7CAa?f1xY$2-_5ls)
zL4hYVEv|Mc>SV^!`PcZf&niG<%m9?NCwjK3mDkFDKkmqqmT~HBf8G)*Onz2=8h4DG
zV;yW29DC65rBj3s0aU7n2q-?&b|Vb#G`l(c*8Y>M!=5OTm>`M1JR2{)=2rGxN^~8Q
zx*OoIo_&W|WupzOV?XSw23A1GFS3OL-vmoOfj)x2@qAdv+WtQ}pG4SCpVM$T#{q>4
z{4Mbo#!s!xuXi3=Q2yrmM3I{dDduKZ|Mji<;Y%j=;i6S+m6hm&C%#qff|w28=<exF
zlWfh=xsIv-<tZJ$OP(e`)Xj5`YA0Ly7ZWeU0W4G~zBtcUvTXlMzyn{7T&5OwpZ*~M
zp?QL$9CDHgAtrUX(y&^(>OOIXn-ra||2zo42kJxQ4GG(*7~*4~o?kFpn`_qu;LZm&
zdE`d@M;CV$`BoN35K6U<fj|om_Ot5l11oNo;&X_|U?$GYA^L5GZerD+#RiPu(RVTk
z5}77OXkoX%DD+6G{3)2vmGIQ^ec#&WkFws|%0?uF{-U%p(KSp6KfT~4bWR_7oBt(~
za?vlWIOQ)Wka=i4nNhtSAg|kN#10S&8to#Exrx$zxjg}g#v8E66r(^)=3EW?zS|zh
zYI-zP*kEt=^?+c)pp8}Y1<Qt>R*{9{_g4lFykPGDDE@MfjQmXLc|4RRNrITzgpiXe
zp~{{>nAlOridlGn;q9ZO&8mTz=sbq^x}UaXMBi@zJn5gJkT5^`BYfSNLaUlr5Efov
zOa~R7B~Dd<ny;cf=Tq!IJ1;2x$BL>pY+`p@!<AN>!~a$_w@BA9u(%G~5}Cz~DNQ(B
z)GvE*EMw`;TSGOIqVR8c2Gc!U&#Vdy?Qg}zF!oMUmLR>Z_dcYyer!*HB!sfqPk4Wy
zz^zjCX%Rvey8}6fFld*;U+T>GgVf;DiX~RYD(XxNf*5_kI;_UGto*OWjQT9IGsB-l
zaJvMiT5rMbW6&GnT5sXEi(IftD_In9YAsR|Sg!jS8c}_7eE^-dHvX1ABV<-Nt4iy-
zpg45FCGV5Bthr_q1y_<pgZO0#xMK$M$)C7=<1PKS5p!R~OBdUe(s@izW)^kL37<u$
zYxFby+A;bn8+_zfUp;=u@&IRMySD@w1P0c<M?kY12u-Ncuna4D+sz);iLuZ5+~8($
zQa)p$n7^B)AxO%TJqAP!iq`;0V$-!4FyLa>`#rB>vi;op;TK+Bq*eJb9&skXJhiCk
ztv>;0$GhLuDo#krba^TEik|H4<K;S#8FpvEes8W<6*agiCwdZHrKb98Rp$`;fXJ_6
z@l~z#FV!01slQt~#UZg|-peHUxj7jVb*7p9pD@(KkPxeSVZ&%&3gw_Qh!{AY*@rD;
z{)b$UeVk|R>R(o#7EtPac9+EbUB*OVV8sN@BWW$LvKevjn>3;+S%hm3#;O+w?}}+3
z)({j`%W{t?gbhK1Ig4`?+*Li!ndq%;(e2%$A3l)z*N+paDv&}aPyEo#U=ZA%rQibG
z()Mc1Di(PzXWbniv5@l-r8J;i+6b#jb(A@iJOz%5wf<=2FV=+~leTEN0US@Nx7BK0
z!>HDa^sA>cE+<l?bUkYOw>lz!W6+49<LFs~j93)F=&GlD?2in;9yaF(1C$u+SYp_-
ztQ%_!2Qj;>b5-%ynbfrwM5#r+xT9(XLna`$$qwb;1xA<AB8=8I=i;t(eFvn}>{~AJ
zA~Msmi@5TEOWQhX?2anIBB%2R`@ggckaO)Oa5F_ZQmrCiNX>bbUTe1)`k?H6bBb^f
zInNNNrja--_E1ky4cWOpz$K>Y_koLwDmuc)8X%#!VH{e0F8YFk$T5K^&lv5`%{;?E
z{1F!E!q-^6(%g4sDR^2HL3;x)RViGI_bOj-E`<oz6|f#j;}FJP2Pl0t5Om;`x^y~i
zRK-CM{-H0R1khT+Bz%)YQ&J?~le}43mQ7dGVu03{rpX`U42Q6!F4*@bgt3}s+F8p6
zQNfFjX*I>;nXQVO^=ftE8q*AW$rN|A;~rA;bfS5chwT9C6D=krvzRaDzwoZ>)Dz=l
zfI2sQ11g)PlNg9P_zG15NFP1tozO0~DS;Gj!rV&0(K-tbSv1GH21*B0>;P^*rcdFe
zU=>$m_9t{bsi#~Led*u4pVH=%W%z+`o!6G6m5r5_o(d3l|Nq#DJC82|oJ9E#OA+}m
z$!cHBv_fsf4pNHKyu*w>G)E9V7Xl*p;^O)ny4Vb_|16kKX5h%vLx#UMn-6;K%^q!h
zF{J(%ppG$P2W@bvtd$*(DuEaMRM0<j%Z_A47z#8432FW@wPVQ_vQ|s(sN2?>Wo}B&
zH)-|?$)Gl~rEz+d5vLR9@LzJ7o3~q%N`lEzd&2EbV*GA7!27A5NYXDnj4N4<)az>#
zr3yP_7g#Lv`>vTNpf@HVo6h3`%nR;+NoHthEd7_?bM7+&UBo+(K%vUoY(AGaZt#!T
zF0%p5<QsXp>3hssh6QDv?1x=s`$daqYh4M}TU_v-*ghvV+UmNGV;A8&K*)Tq4P@l+
z$+&5n-38R_Q+1o$V-DhxW@npjWF4w?A|9@l@(Z3(U%C5lXHP4T5Za!H3-w3e(zB0E
zc4Aw`CR+MADlNAbOixRC>(XF4upP$|A0EPUxP;7x64>S0{J&s1B8EN-=+*$L6TpN%
zdeb5;53Dc^xVW>{U(CaAzP$g@swvX~Pv5}AA=5n))B39ZxNwSv<JtE7On|?y?X1cL
zaw_32x>20ac?chRU6Mgc;R?R`+cD?0kJzlal{r|h@rPQ-tL9|D6Sl}YIDfKoba7w&
zWiz3?V>mZuEJe=;p#qcYKOU{2Yp&)~!r|MUmJoX}KFIGk&~=RHQToz=j5&u1umvR}
zZ97=qRJ2|3X?-XQ72BO1DSLsTpn@EHi-xnlR<Bz8slSB78M}bn&67Q{A)VyHKSQ)P
z?jRbnqRC5q@T4YMB`wo>0r7xMvCdhl(0S^&UY)sJIx2g$e0x^n@0$L%(^qcj-or!@
zO;6&wo+$_Q`XcSw;%o@nRlI(#gx^4U|B?ZT(>YITh-4ELP<gevhiltpAF=>J_ci^5
z=<h>P7OGQsJEDtVBJZYNAc~R|at~xzYq~>q5$V(Rq00wXzN@Ph?;tyeo>1&22NOKl
z*+Ind7Qc78#<RMU>_fiN|HpWey7KA8%_lF{n=5Q}p+h!zav^7gmULRq`Z1A_BsR3F
zhDw~ziu=aOofFu}LXB$VN!X21NJDbsIQ6OJP3w-hW~2GWsr5_gp`Q)TtE_N!o*p|x
ztBX9|4Uu!2D*)L4^tH6VF9DoiqW5K1`AL+?suRv}6sRTRFzzk?rCvyCPJc`FmUj!*
zFMFKT(0axx&@x>6ox1fGcv&vFX<Y-W`tyb4^ev&rI<F5M_x;}&rL{1{u=iV!e`GkF
zSwZu>U$-F9x3wPZN;AXOzZsy0JXI*4kW;=+Wk8F=&qqFl#AYLqham+7;B-I-^yIPH
zT!yA<BIK#K5J^ZWqERFnp?C0&yGn=`qFAvuc)I)3Qrx+q%4E55BBm(pq1Ycvn*Cg`
zIbs{S06K0{ep_NyV98C4!5^$=Kt9qTsA@ik=VWAg_&5cy1Tbb5Y353@>hU&{q$fhR
z(w+8Zo(%o#i{*8%H42iR1X%3x@BVfPVO6@6mcV`?Ywp*a$4|rv>^|G<AMjt70ao#d
zc<1M>Z$PI0^{k2)(owmPtNhH9@@}%v<PY_fC%xoUR;OQI5WI&-s~#JD?+><x=%VpI
z{6mdI;3QNx?*?#{|JW<!#smfT(KWMz*cK|iH9D^z&dKo5W~Nd*V~NnI!Fwsc=CMaH
zxb?VM{$n=akQ_4dgM|qU`)!Mo&FoX90k;KjY^_^#0{yWleTNw~QTOL4^d*?tK3L4f
z_ApK_8*B$QKb)=G4f8vkb&xnP9?$?SzW?>l#iA$}edXjM(V)s!%QHL6mFV~A<)Tyb
zEB1wmU<2e7M!vF0$LqZu=JMP*8!%s&N9%SvlmD63>1a64s0PVyX}a6?;3I%%#S1#7
zWyM#d65x}!DAvoM>5+oqRt`?jRpUb>oev0LH3K31bnZRSYQxh^+|sON_B$>-Oc~X2
zoke}+%#f)i6^3mgL>`%yiSsG{cxIA$?zH~^C7+@>WOHuo>Q0|9@mc8s(j>i91NR9)
zu{hUV4U)P(KRRW_LSJ|*euuw6=A*|yM(Xzg5sE1!Tc>~2lLXdDgxp^!ra|gLXV8(n
z2vYcczq>^9&tA1gNnYy1pLqP8a+SRo+qE6!u4g1Tp$;;?K}2uJ1nLV1n|6YgDHeRw
zyA{Uyac)|`2+;e{QlM&%!!_AkH}>S?Ar=JsnrrhpL8m>;s5HFz-jLkSkY>-Xt%}&t
zOO|)tA2+mOmW1K%5n^w*|J#WQZT4I~1BF_7v4>9at;++X7|~?M7#YbGrv}zN5b}n%
zFo+zh=Z*h_I<TKb=qDWrMc2>vP@-y!*>~#4;sC5T>tjLEl+s9I^qjl9l*OUt%7P5V
zHh_N##RyjR#{bfbHpM6X607OcfE!uzW>if`h`NR(o@jgZ#SRhuBz)(4Uh>%9jF{Mu
z&{Ckz)Y1GLUj09g&OMN+|NrBaqH^n#qFmF3%KhG4D@C~`xwBPdv|Ms$LlP?YMD9YU
zTt>`&=6*MKbKfxLZfw|W_?_?XPycM}%sKD(`}KT29s`Aib74eLnOTU-)`p0`b2Fj|
z_tCiGC;P8j$4gxJyWCeb5<>4t_9T?cYV9Tmu5H2J*e}X}zC)riPR6tX-+Ihx(fgF+
z*qNsl3w6a6J8Xad=3JQfV;)-(uX?!ZihJ@x=&}_bq=Sp8TuVbq^1I;_Nw30!szCYM
z{Z{OCa4CDkMr|YKlzwLGfaJRSs?&B{!Ik6QJi|q-z%FiAs;Y*}{O;+a9<WhtlezxV
zl4J+ZF5BG34S8mH-a)1ZHq(I`fYF#m!G87JX@11cGESm{(x7yDzgS_)nW;^V6F_$;
zuPID<D;31(AluZmUi#u&QxhII{ZCf9lqHySQ~#n*{BZe0q+vaGs*rH0-`}WRGh#;R
zCi`ATxOi;_`U0BQ&TAyR$w>LNB|h@#&{LD^pVT+WTxVy`c~Q)SJVu;#otqRB1&-v_
z5;*+QD3BbJbVpcz_b_>6kTxtCjatn(cUM@x-uecQVotnoj=#au)~juUf*3Bp&b68w
z(5DekmkgtJ0jR?rbP^q2?H~~?Y@oQkRfCh?udcgCz{2wuw>o?1;Axl&#bd`!g`PUg
zSmlO7y#V%B>p)`Tvx@*S_c=?y*^Wse`?WLi#A@HlEEsU(DE!=k35@&YAhn4?up4`D
zr1Qm<p16#7Mb`pPL}r!W#RfJSokp6KOE;FAP}vg>0iVK5mZfQ-Mc*eb$>fep^_3eb
z!#)Q890@3mW$({S>wQDk*%=lWLxC=Z90^j%Gl>+agH6;2t?qi>nCVCikW2l@$R(hz
z<MrST?sV3`w>#g~HAtBgYF<MYs|%~!w-{%TkIU~tcIV{Of*8H}qm=!z)*Q~8J+}ul
zeq-yn7eCn8Z6-)aNLaFi)vC5;JU-z{YLm9~O7|i4dynj2;?>5^-^==?%R2W(+^r*6
zsq-Mg0Wu!cZ@lKH+NEK*3~N)driy>vHCF;mulwnvIzom)F2AZS)|)ejRnc5o$X_u@
z>#_dohZwF!t8W(%tmpP=$R%sCb^MmJd}xKg%kbG*U5fQmWh4VsviPw9N!Ip}iiqfO
z&)0w6a}KOFx7kNx2g7j`^i#ERLAH?pWsjxn_<+QB{KJE**@zcneD^~JD&M<gA<gLK
zp8FL)3mzYUBrgVa`h6oBP-S~P!YwjBHSB4dk0r+KV!P#Mk<qxlpKdCv8uhxcEnuj<
zO#kN=WVH8p-^lJU1g==>f!)jD2Jx$h;M(P~tgJxE?87OTZyHOjH|i8K1(1fi?9xC*
zE_OYEIoYkK>@oAJXlrs+o3KgfoS`l8_({<_(U)-%nnc>j?H=(sh3|fhCLV9EOU>N=
z?`C~C>iu2>BrmBWw_6{(O{kkBd--m@Zw~!azq3dE`Oi=GZs0}<=uh8T=Xh<t0TlZH
zqBi%X<Tt1`Fr?s*h;dfLNtumFJzMA$q2z46PdWv6Tn4A0LnF`E`-J#TL&XA80Xdm=
zegS%BE$qiZBs*+f^+ix;*rEBXjM|mLB|?O{t5q<u_OWwX1|ImhLes}75HRmUh}r}m
zx$z(|5^ZaV`xs#hP7@$SVhw`uHGq)BQH7)V{sotFvD>4;_7A@LX<xj~$w~fC*-wLn
zhl05M3-Ps+Tnz!t6HP_H$j#RuSKni^+Ix6Srccw^5ye{nn*iJB`t4;4F54goa6)V*
zJjtw;OSWqcm<VK^S~cHJWidoZA{jVb-~1-Y8C0jf{3wn9!=L|G<p^Usb$!HI0Y_xN
zB3<lcCH9($N8`9-=JH#SwWOB_qUaO`{oY5N;s%r5_afYL`+aFatm*i@WtKv)FOToP
zeuBmjq>!`ZoLe-iMS=YMtGa`CMaxTP8Vs(#d7iIf3@&PCMexvQDk8w#n6ccHMaA~M
zqsQQlRAa0Q&6=9*q8nLO4tTynj{s~w^vMyfOk;u1P*#G1!lGG1t(@rkAHNv+6`Bs)
z9!kpXKQJ%#+Cg=k$S!{vS|PB{Sq-uSo`4b`L{)YyLSw*PN0WM*`E*5E$0M7c6Ahjg
zn)ifg8>iWliFXE8hK#VKk%%1y5*0{bE<OQ1ajLZEsnT;jhce3Xj((T#pkM4m8se^*
zl-f<L0lBbJ{6ZO{g7Sw!N06*3OBMpluR48??fWryu))Y33|@g~`^BxG$qd-<aeI!m
z^qa(<KnnSB7CqgFG*V3uf}4=ybVV~qpCJh&0IXc=rJ<QsPXf5<w<oWEcrUQR$}ly4
z0gI*C&v!|bysp?gX(9IuiT3jihJ%}7Q=UfU30uNtFG#JN!IJL6;R^6eV0|$s*feUS
zAwuq0kBS;9+oNa1C?!JJW04*OoSQ(14^*=~3GO7n<=eV`ueKeb6iGFQ=gTg3+03&*
z+D;=m6<LYC6`=<`^i9))$*-iBpG{jb#xlzB-q>d`mxQ4^>vzZe2XQ%<uX;~IQLLMp
z1Qa(S@W@oa7Lp}NyYu1cLV<f{TGO`a6J{LL!}llq@_ahKLc?h!P=DSi0d|$s&Gd!=
z+{d{pD>BAH^B+pry)bfLifQH^=DDDSNzY(+1s<)Bkf)>G6M(RH-nu68o1WUrnP-}D
z<C*w<)clgo2e6_90}(-~Pqv?@rweRt&ilBM{N?(a)I1P0{151%;+U#y<~&GWU|iVm
zD|@|9J#6Qu_O3y3;EGq&)+4+{l#(Wj+fP?@-_lPi^>O@~ScQ%AGF@?e|0%C4fh{4A
zF4q7epg4sg(;%Cx;Q(hFmoq$geV=L))N$d!TK?<}ac|K;7h{sJ1hO7N>4wSxY{dPu
z;Hkz}gm33IoP9{O<NI#LvrcI2g@cYoTU@P&5s4{IdSMT#$+&2FUtfdZ16&)LOADr-
zD?Ip$cQ)X-I-w>S@z{ZIZ}!(I;0y9)<Ftb0JM41&EySs=EvK#WLl1fNGLMCKk^Wq$
zuDf<8(wA14!vJEdJiGC@fwHySE@`+JQQz3zR5iGges%?iih;{~74Q0qeIH=rJo6Sm
zBq7Nh5@edtL|de2Qn7d8<r)Ou+l|HJ`@y68TIm^)F0I!tJhD-}f-GaWNt&E>tB(Ah
z_UoiW3jQA@auvP?%Wx^%oD9`$G^p`YGmp>@H{Z_}|Jv^ycZ&|<U7Kw<lcse7`ic;8
zjTy%c<$h=Ntv)^hbsj9C_<Ro>+OIfK>((KEoGC01^H!&_Z6vKnO!q<M!TLrzxA5MF
zANvNOe?Mj2AWy<67~L!%vJrc!SmNOj(DPVMWVf;SnSpDDZQKDn)bU!)#uro%;D%y@
z=Bq<)i0|T(Ao|89?LJsSzT`vRWZkz9Uw~LCJcKaXo@Mv~#=EVK^VKbP4?tl)Jz(DT
zj@AVO0_umKO<4rL_grE+BrNOHmB+BzSobAe`B)W1O&;uR3z&t|xQ7rt7x7Lw3ND*b
zgt^9sgw3JGeBUvVC&k@QXWmo|KDd)E(7}m@d+5m2?@fhbq_~f)>^%z3OpMqS_&YOY
zR@3bSuA~<dP$h=l2i6s?x;sWJNSDHfEYH2?#*fg7%s5?7NJ(b>N3DCn)AaP~E8*Zj
zF7hkAhcc|EcA{F@!r7xN^}6Pvb+sGIfgABQ4J)Murjp;@8;_7?zY6EGqJWHR?<{U?
z)5^uJ&tbicDj=^3oY%@~eKDGovg!2)TF36RA&uF>m;a<VTwas{!V~-M@}PL_dJcTz
za-fS5BDb@$)BEk#rn<hT!GS1t^}587$EM5%Z2OklcY#g~xdKly>j;Fa*JfzFM|FP3
zrPZ}^g3&CKwhZg?dI~)PG8lFWXtCSedoP41u={>7++Z);V}GBp9oU>&E5UHIaIsz*
z8z?Jq-P0U|>lr9H9n?9rtV4Kg=X9G>7({?2SWDB8iJ8->+kh}WJ17k#W}D!RUx<h*
zpcS(CFKIGIe5nn4x8<Juy_59!RYM6PT)KKr3GK8NVz&*sX_Jw5!{O{_>DwU6xgD62
zcx-h4o!z%rqaHXxY<gcNZ@av)c}KFcBV9^e`jE%5ofGcsKy6SqUB8pMWb5=Oy~cJ6
z2Ag+#ZgYSXfI>t67d$3Nn8^MD;(%gki-s4B_<Fl*{E9qJ*T)G$*x=txm>Z%7@6*KQ
zCw1>%``Gc&Z>ER)6@dO#Yr^TWC<E0#=Zbn;749ogR1X>#4Cu^*NzGmTPL_+l`mYh7
zp}}>Bp94BXogzDYr0^04;*Ngsy!&gH`n?lK&ei7IZg1`Lf10a1td2en#J}D8B~Z2u
z<KvHZYC+z%YjbW*oj#<mn<}RbOz4r+<`=Hg%2=;RC?qFguP(e1uMEAKiQb#ZsMD2k
zp*+&^yDxKtmzh3;<5I-7zwWrNlO?tX6F6v4@E`u25-!*Af{x2E)|~4l-H!Pj&qKq>
z%LvN-Uc4(F1^S>2hL`QfXa%)k89SEUi|HoI*Ft<hD2*Z>w%0#n^EOH<xvsI(XVD6}
zQC|@z)^%hTdC1kHs|T2)>$yBG2Pa={XM&eSjhUy!YR7o`q;>7J*KtYh6Kbw6uGm`6
zL8g3XA;@_x%}W5J!1pxLa8n;QO?)s>b4`WglpIx$wUreQ<P;Lf#C(NfkCWV?!F5i%
z)EU$H9**&DfRNg>`wCp5ssYg-TU3o$zjQ^~(YjJ$LIxr3^m0!rg(tb!`z(44Cr@gs
zsr`a2aD~tjP^)^e*^bZ(k$UaJy-Z!XPBMQwr^dNA$6)rXxoFQ5Z}aud&2PbtAw343
zKNv1caiQh9bI7n`Gl%gX<>MDc3M;`j9kUGfD$4y9<OijnP3fnOI<W5wteVap>jRss
z<4L2E&wExKFZ9RSZ28f*J)K1Yc;5)`j6Du6JxrJQHr;XEm_$ol(=mG2+BPr-6Hj?i
zo@-;L&Z_%wf7!g$?N4qGbJ_FOTC*Ff_t?Wn7Ui}RJ+{qelMlENn+&1{U|ru{C=|Nl
zb&G%UT|S!p;v>KBJ8#C_f!Z2_0f$Dj617<R%@+N6I5(beD+#fr`4Mqu0upJyiPp*(
z6xh(9B=6a7rP|I+Q-2+OjOZ;_owKsb9KB47_=MS`GFuO&j)90&%>O*%lNVo7)-Yun
zH`U*Ki>wUEIQQyH8L^-ovnP^S{0M2+v6e96(N!}UNikeoTxk2fv)vW>iacE|QI)dZ
zciz|Ut<UT@k5Jab-whFkXK|CS5*#gNp9YgMTAx?8d1T6MFMnfv*sJ@!n9l6@4lYDN
z(MJoSByHs7{;zeX&>a`ClfxaYk#b!JYs5p<Ks@k<oUE6@Yv1O-@H38<QCCBuw(eb>
zudZSzb8$wiNT>8dVxn3N;c1Y|6WII_jaYI8Zl><g7c%$5^jIQ8bNI7w%!nZtc2mzz
z^9<?gwy1)BN;f^k)0)#zH5NRTMk^#2B{?=_0E@0oZHD`)KZ}w+4#Ma?Y<5WmFei1L
z`)>jZw-sS+UIN1hw~-u93%w7JQsl0VIGvL>rs%H52Ox=A&v2aAoJOQW5g!E=>R<R&
zXol{lR`a9_v0=|8QfwPkW0H<<{!vNyX(Sd?Q?94)Hpia(0hxXER!l<Sb{8@uqWrSf
z5VlPR*hXbb*~uq}Qt?-w)cMC)p4P$LzxgakV5;A}F)P7s#<12?GiY8^Yk!m$5|K`X
zh3+>`?;wJmPPPYp2dB}5Sq$06?kkd1hNh;skhW{_w3H$8w_5=lpVkr_jH@&=+}q!l
zmQ4yM^TMX+CAT0`iCfRciX++V*Fg$kwb1J|3Y_wXb49>`U&9`JC8t0^AxVL<X1VHZ
znuQ(u6=`4vg0j)AnZz`x#7fugP+Yv}^lhqQ{nwNIccbbb=HQlU`B*jgpT(fmw#0}q
zZRY5mN_o#w5D<n)^H8PM_NhUO<0HEAaGU;TmVRvR8-YcCfD0QwjMx@`5^{F$x`?h^
zw)p*i<7?F>ksP;j3iRc%(5c8CX+7$s3K$l6L!@L4X<vpP&bBU0Q~hetUMv9T3fM^A
zHO88MjhOb=PQnEY)6<XFn$M|28H0uFxr3cp?(Mj3zD@Ogh=;f~ebQ&tXxUhzz#buq
zR*w0#0Z23(-(O&TP599)#zj09SzGxVWnwIz5_BS)_u;?2am>3u4`mk54=>xrX_Gu6
z9*`rE-Jc83`xtP`{{oD;NzJSzMWyN;4`1>ui)8hO)?A4-l+(*$+xzgL$X~^{+1jj<
zcK<YV*ZIAD4`KOKs*OzvTD}8R3)pn3jpW%PNtv_7tt4rhwUB!_jh*d?@e67a!6<%N
zGFYsN(_0z@TENt@p{JvavCBcOvVLNn+R{7X<ZBv4dd2Rfl^Po&rYS1cAn!8KxD&B)
z6E|5SL9N}@3qsN-PzZR{8SQj0$DV*<rIrw#rry8bc6$y{SnVbCn~X>O#0Fk4ho>Q@
z-HYYeraDf@6g;qmXO;HIM!&?HiQk&-W8M_Ld6^FCvAgEb!{K?UsV*7}??H(5>(SzL
z8{YsvhIhhr&CtQ!pDNFYqAglRjPT{<4Cu~G30*w+BW1zHJBlKH8WPF3w{|3YSu^aZ
zrWk3%Ux-`rd?JnkQ09^r{uj=XXdAn+39v>*zC=7`UzdlUWO3nmkkpxN`T9`C(DRIX
zScq`KdclXb1S7k!2zByD8B0<}&aB$ur#;lVC7TBQiJ#C)`eld}Cr^-3SL{0{uSn)(
zbA(n`x{y<Dy03NEQnFvkpMCulC}5`AYpCp48ljrewNNcsE0Q?=*Q+Zk__8%G?CY2s
z(D#&8aclaf4mwsQ>y<FIVIjW1lpsnP>%}A2YcR9uD*4sB>JC@V@`>;K1<_umSDED@
z#9!lcAVS^p@|%HrS=yQ+L510pPf3`F2*Ep2?VEv&OS-MqJm=U1+pQX7HJ3fZP1(0`
zIr{Ma_=gKirL1=o8KqF|_i>SrWU8VvUd;jET>SGODdGAR>i)c_ak2{WiowdG49y6p
zwc>Y9mWsBEaF8#mdY|YZxqYeifxP2pTZ2!tP>jwNBh~nz`FSt~8td0hjHsEl3C`T@
znf=RyM=n@N`gL~Mx^4@IV8u5B|K}3?upoPurAg*NqcSiroK%~)`U6_&W&4|d>t>NJ
zG`K>VdM^1tXuYUCSim0;MwVe09A;XyGpA#v&CkCZT255j4k*2v^QEtpOa2YeF!d5M
z)_@l3S7BdR0<^QP=UnQwEp0JHMdub_gBAr?^JTGeDw=?oSeO{7%rpKTB!lQ&IZpNJ
zoBmF_D=^!M+vI^4Y<QHvF;bQ8^Y2gbkIpPQX#u%k(XI4V;PICBft=euVpPGc7dDqZ
z>(<1FzBkGx*yCTk#h|GqJUHHi&6nRL&O`%ty$2nxGUI}Fj^SsJv3DTsb#-5?vabG_
ztc_h8beSVt$jG%xFwh6E!AoL-zZA6cox$uXhi{Mi%=gYS#yr4`AMK>R!$%A3vz`PO
zSk|(>?RfX`6>cs1g$}72%_*y+EofJ;R_E8oiJg07ovW0|!Y@C@M9|#k$$b-V@fpxn
zAB}Z&1;5Th1z+wrul@7Qu$}B$`G_3tOh+0hF>sgS<!1^^3ps%5Ec4>63!TSW%Fa?h
zTn!TUPd<|P%Rg0SA!4acfLoMK8_b+H%1$a4Fxfusvji9c&{qof>mp3u7Y%*^6r5jv
zm77+dyHh@3NSThHmTyN7O~+o(o;RX;JsKVT=I?#|_Lf9t$s3Q$TbcKpvW5p?p0lgT
z)A2lfcaziUlOiD3U>~Xv)p}>K<olumBdHhK6gk+XT@q9E@>hxMans<*28dtIFoWRm
z&hOJs6!G+sp-ZGd?a0?Ek^7*+2bjygg|AXl_{oE(l)sdbya)Ev{DlnXDp|A~mkx^5
z!?*)&{M*M7LS(VA0eQPl_w8>%y?Ji2Pi5{gR!?P;PX*%}4fKc0UP8<|$K4NL;^o|&
zB?|_ZKxN2(NgE&~zf<D1ALYe27FWRV>3};CrM&cgP9ZVq>vHx-G&lJ6RzrRaX>JVn
z;tY0X1*ud4)KN_vvbD*)v>{lry#2E#P|BSWYR0_)sadKrL0BLeah?%i;^TUUs|6U0
zJb%}P8$D7Pd;T}~)!9c!YZgyGnh4@M{-aM`MhXNK3sDu>(dJ}WqUyiF;`(>KC9vje
zp9<k^eJT+9z<4Ao1QK%<?KNcc(<IP2BseEon!fI9U-A`EywGp5*uB!hoZVOm9*kfX
zu%$~2BXTk%tDhs4yi7c2Q9Uc?qOhq1^@v%o{nfMoLKS?YY5fs&lUI(<Urnkz8&>x@
zz`kd=%PY26ETlheL(Y^&El=g!`*_#d0z{JG$7s)zprAe$Wx$bv-qtyz(7{g<yBh@b
zDf_`N8){E6tM<e4YFAsnHGP<{tlsy4;=wga%GYHCl`|R(EL8$`niR)0=+^JUd!zOy
z6Lh`C?t)r=qtAgkv_)2JEp|m0CML}%Wk4<Mz7a(<^AKeVgo8REnj`YvY^jto(*=Qw
zcGCn1_cg~Jdmfm5+bUg)Wt7g+0d{S8g(q=TldT`Iqh^c3U{w3rgSiA*JpC@oCbhTN
z273BPS96Bmzkt3NK2rvSa`L{lr9JsF`Bdh^J6XpG`i%Wx|MrC3wkMm2bx4dE0Yw{?
zb|(h?yrb`@ZB0z17=Cc;q2~++Hy>Ej_Lqz+ey0dGspTLK(|<gb;v;*$pcHG#ZLBQ>
z89h(?fCFbD&l!gVVV}uEXs1<mSHsp?R9RCwLU3S#gd_iOM>o%^^9KfZ8K;}0Rg2`v
z88YMASma~M4Q5fNNbS|P!7*oKq9rd39)A=m);ro4KuSSvd9CtJk<=2(CU-T2C#F1~
zz1c9|F^q%Qq`Cd;ZaCw<#3P~-f}6ZCb@eaa-=VOnn0zm7`tjqKkW<)tfEuI~7M`VG
z1lMGP*JZe&_6IUlJ#i4f?es3h91B<0pY8gq)Li(@HNOT5?RQu4@XF6B0BICr(LFdl
z;|so@(PgC{w1EJ@b}{9=fg97by=Ib^)at`q-ikq;V_Nez0}fB$itW3s0S#~I`rm0m
zbMZwt4kp=Wx*iK@a8*z+RQ4>OsSgyZF0f!OS-vJ5i@@@}zRz3r!m{Puy#8vtq@!W%
ze)+?-`?0Rr9s@-QCTbtl;zYpj9VI)208W^2%)$G6-rv+$FMK{mk9{Hqtv35CvFlDT
zn$qi*akK2w?bk6ZMtzqxat~3xc^R2lCl4W^A|MIZCm!+VCf-6GdW(rtp=&SU;j=1#
zPm*!2(1OOSWZKf*!Ar|HY%YFnwU@!=Y4I_b>M#?@A%j>P5&Mr1@K%iWwdd%D-~;Wt
z6uzcTt7}62-W%yR=pLZPy1K0DG08W(YC?mgGRKEjB%;n>WV?EK)rmQo*VNt^Ai_10
zRR%r4bjOlV{u7#x72Jc!H?GTeHS;dB#^c@c+;k5NFK4@L)`uTrOw^gWDFkRwapp^A
zc{|c*(^k*xL#s{hBAroQ;G!-WW}Ze|?WUuMPdJ<2mqSGV1a={dTOQn{OslEhzg2tg
zX!2mS&ycwpt@Iy4dr8!@@}Ugk9?$Iql*3#@Vac|FOo7(yAy6HEU~~<rjwkMvqkw~i
z<x9-zW}`LRYb}zZ4pJ*C`_>uwxIjcKD@%5By9d>}MZkO4VcE_pC9%H^$ZN>G#uC{%
z-|<~}VbtIwJ7pAYHpe5i*oc76-qm>W@#NcHVRraOgcSeUhG2Q~8gM&3!{#jQ80&Ni
z?Xl$0puCwZQ`M=UbviWAEK>u~8!35jrbI}?<uVo?28Q>y-CGqkUlY-2O`BL)UicYd
znT_L5U$RhZPw<@N3Xp#UEG!Dm_F8`ZC?e>aE~6j<PWb6A+)210InFJhn`1M>e@;ke
z8FgdJpeQeJKJ-6e5e|YVArP|u7K{F6TZ!n9(hJ*P%>M^ZsNZf5n8uhpj#$hE+Dt&y
zUOSHZdgPLK_-F>JppI!;?#j|!@b8>6XVJX*c~(8ly>lvhL|8CwaX^hcdQeqK+p;d(
z!adpe0p~h$lJI+UDWKTD2Q+-`Mw^x8vhW3U;vjPdvdkmaB}w)K5IxP2@q%Ow3jaU)
z)7t+h5gxqzAKdj&I#uQD-9u+zyT@lvzF$vK=|>Ha8vmy8%qZ7f_g3AH)Lgm)=1(<!
zgXLHF+73x8)cUVusHq;^Shn{e822zDYX8!n^?RKXWycgLVUMqHoYtb`-e>MzTqC8W
z+#0L2q`;HineVzA7rk#nvEHGx*1Bv576&qb635oT=vyYrNYjA(UPv(qykboDV{@|7
zZYu6BEMII|ZAGqtl2Hvn_a1brZ(Ip5kA`t<%O$Q{uavKK(YBbP!TR-ernw~Y8ft*@
zvNl@Rd3ZZhSO=NgrmbVFnVd-axo1e?r_bgtx&gi;E<gT5h9eLYla7#wwiT%aoEM5s
z&$=&e&Bp)hEGf8Hl{B3>{qaKoO!6C`vL^&-)O=+<1W!*ZPojYemH+dMLobYHsPYF(
zfmWZQt>p-KwXF-3Np3J1w~z?&Yf|etWF%7NR|>FlSm(a_O4fRpl}p4xcdRUM00IGB
z9Y8{Qmt5f+B5$Bc)4&3MK*Cw{@d|Km?`W;z_buoeAK5Sd)`goNj*)GG@{~f#o*Fn&
z4qjoRl|)4~fgTx)Hzl`NK}@z%qnvyVPnY`&I|6PEd*Kr<*8=y`vA*ge^r;Bz@5~L3
z(6!ru5d{AV(UtG`HYOWia;bqW?RNQgC;OnE&JIlA*yl^AiL$Y0X8d6$N|lXqxEObX
zbH+9vVq>RSz?`C<8k+cDP|8{_!<mH(luiMJaznn2By~^usB&#Oips(5J$Y}((S26K
z)0r(RH8R(}#a@|>ZwT2JDF@A|;>T%`P&NX%97r8|!?RS_0b+PSlJ{^jhLt;OScWtW
z1hQWCzp5m-%^z0jD36^!nDmhw=5O}6we^H_b*nbE&-Zj1hu?`p9|$?QcjTSAsr{Zz
zg$;^~!3YQN2o_6Dd#SepTN!N~TTEu?$>YS?)bZX?pPlZ7a&vdt##1C&7R>=I?4N@{
zKgcqSN7yvb*MpqY)-#CY^fHWQ+}$?dHqH|n!k!5O*cI6pZ_{HFfGkd^l<}K4KVA85
z=bigw-xYw*x=ftSc5};GrljA8$$R8J4{&L-=&5gRJicrs#EGd)m>a68`vGvLRy5=x
z0;%x_C`>9}gPDkEl8S0p`PLjx{+K3q+@8;D*g~{77&Ac$sm@=Wqp&3A@N@t33*SKZ
z5(k&57Kss2y2J}CwUOuEB4nu6)!a&zn9}wS8ibLCUR);JIlYkfwipbc@lzy)GtFQ%
zraf{HfoYLk1yix$>~hQiV4HKt$P4hG&8^ag<a=HVMNbr`cVi-^>ie7HiQ9R*8*_f<
z6=Iu0+WWdByeK+p_SuWYUQ^>M{;@SN`eXEFEz$na1cj_#oL<j&{3p-(8euHF4Jw5r
zTUVLjGBTGxT7U;&D#izoQz$r-04Zz#mDHw40m-gM$PGU)IAKah!OKI~!;S%p_I{TR
z;i>}t@W^e?N{@PkEaqgzX4|gO2rKIM)cB?WmMbs?x8nc<Q*d)bzl1RpwaqheVNarb
zHMjOrWc<QJ&O)%G#qlAYVMc^8p5?#GLSDmN(vbngC4sx%>sv9PgJ@gRY}{V4Z*Q2J
zlZ!EB#l0yKA$3*VUpUh?J%ZF^rC;wMFS!Z{ToJQtw_g2k0+St~LRXVGQuKRy3(dPU
z;SgT`T;U3-2CL%fu^qqGo?hRH`!>3vu<}Ar4j@ce|DaoZ!<$S0jA8(*+Gyz#fx|*W
zA!vKb=W4%Kx&wBfe)M*o`M!g)fu+`<R}|_jdtMcVabG=to4wNd8Uutp&%dAHVkXxQ
zKL-r)H3P+7;%-AmojCrW{IB%#VUNa$lx1i0f;ZW?p*$IpUQ6;!3#gC?!`xOeHq=Fz
zl3~%Vn6KWio<HWP(xC|20~eRi?jU|Ez#<(*CVjqf22ycH;`Ov4fW3@rItes$%M^|5
z_bdS#-BxyDH?Eyi%kc|D!bSSH!1q#MXYqHs$v)dwNB`jg0Vp#I0_o#`TNgv+_A!=u
zZ~a4Sr+g~-?%xz0m&I(^FCvA1Cho+01OJTwGZFE_-GkCaH~vr>TKj7>-_#jF4U6{u
zi!|7SDni_VK&hXLuvOkpmis@wwMJN1gozK(BakC!e>JW)(*w*09Up##LoME6wNHE3
zT@@rhgcNE*FQr-@FsA-Ei)NmhB@>)?_${j_n-rztdyOLS1*4`e#gb^;QY*Lrpe`~`
zc=)$-Q%&Va&z;EV;M?h_?pkj7vo(e2>b2x{J8N%`nei>t08JXPWhHl8yPZPEYub!%
zSqP2K&1AT<*O!sClOU5N&ZL^LKSBgl{E$POeQCcCDBU`;VUG-bc;hlz&i-D1XOI@r
z8(aTtMh|Lepjh_O)9=Hqc1>S<X8HD{$l*8z`!_+T9(~nO0kL&H(8Y%MX7=SvGJ95X
zQ&m|bOnjD%{_Ya*^f?+T*uDLNb#6D}82vxT#F_T)dRF>*K$k4l0o+_dEcEVb{Q_ET
z?C%t9-<|)yafTT`Zglf`3qRI+zkbJ*UxFfQguiKn%%B-czuB!~Yq{#Ns=EX84$px;
zmhN~+bq=UA_k5*Gsl<H<KDOG_t^`)>vkMYir7c26)JcAaCqJ(WQ%@Ehod&8(uSJ`s
z_3nKS=LYdn%w;bqPc)tUfqyl+Sc^k-JK(BvyRF!bUc!n@h$f#cY;?Bd5+VA1DnO+~
zEWOG9$s$hP?N$bN12T`Y_&i2jvXx(Dc0ie${RlXB=`2K#@j>u!R-kJrt>Y8ivo|!(
zRGjE2hyx_*PAMa?rc8KC==WvR>t(6>Gg)-na|$ZGL*YeBDJH5u{}D0_CNw=*w$daR
zUJ}=h90iBHk(;y12$zup{_KUOL$fsrz|6V<U+v(*Ot)iJN3`Kb81aV8;-^b6K01PJ
zH_q`OH=T6L=w;cK60*_SD0U0bG|itBX9$YyRLm~Gj}8;c%bVgaoPR}5L}*<DXgCU1
zfe<L}X)F4~m%(cl6&j_J52cuKd1pj=!=^ufXNo@r7KWi*xbJt6A<g?h-)hpo$D3_I
zC$?l+{ziLS@aqmXTe!<DoKz>$Wykd89_J##?BF!8-fhivg<?=4c|jsWiEP3X-NPxy
z_s&yM)7Lov&G+~8u5vzqgy^zZ{=qSNv490qw;(r_%3KuQ79yh>_OhS4Qf_YH?jG@o
zHuxMygii&{$p=$kSD^+nWbL^YTb8AZ<?#iGR~CCbSEAI^vMiR;+i;mq)7dTf<lGJ(
zTj{ytvA~$A)j?MY8NxH@^w{&vZ1OTK?T52fQxRD^X4jZ9+eH`EDxSyi58;B^iul1z
ziPi*=m`rA?E)mi0yH*_>d#7Qni{sSVm33K@akb|`oeuuon~!Ra<@@!DgC^*mpVI^a
zo6k=+K7y>V2uW0#2!Si+Q7JpxNl4@JU}qM9oejaa3i3?vv#6wmSrd|-9;<p%d1bn>
zw{%}$06bu)1e{in_|hJ?_eTofQR2IQ`}(=XgYEjHav3IS@k^f*M$Lb-Wq=PT?9a#<
z#cZ+}QY!Y$NJo!gsc90rKO6~M-oYEUc(~AAPU%ba+CbLO3suNO)YNG=(|ErgO=1Uy
z__*KGe~FygU$b5wS~j9fNQ`&&4-%&pWYXPVPJs1T+}Im@e(rNF89YTkx#G*C1Y!66
z_ec{I;6Z{EVzqU+@9VlrlPh!EE+94p{kjJ@cdOj_ujsVlj;?<qZNjS=JHcLim-}qy
zOgdx&_6~F-(91|WK5q7Oqhpbb82!rt!Y{_#3(S9rkat9_syoQyZ-#0le^Cu`Xu`Q3
z-1c#ve!dtnF^RP<*4L)oPm&P&!MIWl?A!1FO0fJG;hanUo?&Xerh99*miIvLK)$Bu
zme3x9-_HiP)W7M657L698^k~)_J*Vs_)z&c<DVm{ds9tRU@hl83wM|t<T7F-YV1y&
zHfUM6bWBfC$*GY7;`tvW<QovQXF)nFuq_|)*(f&^J52n&9Zb*p@T?O0%lXh~p?DX@
zj%|3mhd1?&`*O{bJ%>^2`G{~g6Jo86H!4}I9cvI>tw3qTT%;O43UUcSo2O2|s1_{6
zPswpv;?=s*^?Mx+m;3$1`k#R5LtZ*z`r*EB_I|Pf3SMsNq$^%IGxZZ)atZbr6F1SQ
z;`)Fb=-<H03P%NhJbuqjwU$Ef>3RJ5^;3%hI*c^ni-**~xgd^t16gO8pdEx%O)Xg%
z`Q>Zn-=SDss;{F4>ftTEJFmvr(R=p>jPw|5=roN#fK9sGHy!h`W+%$D3s4Gfs&Fl~
zwYWrnWUN>daX$4cp7h0~lL;0fCD(wNI&aj9_o-l``9Fh0Fr?7ldq^Qh6_xGAcJ(6v
zQge=PsT-wXiGvyTx?zmDjPq`urM?V)gxoa<4!Jy?0R$boQjmuvL5+2BJZz`o9%;OT
zgfPjJd)2~@u9SoHq<SWC%dW9Nii>a_;2DP?FM7TYv|&#}dp_cyLZb_SLnHiHwft8M
z@c$aEg(7*!leteno}c{pL?~?v)U_ph6x)jfFHGI=knwF8fEf?Q8f|a2Ny|6fprD}5
z_d*Z<8!3zlhpcS{VTHEbQQ*2(aeQxv;8G9_v?a`SkK>uVG^FAu$qH6vwggK6rn@0$
zoiBCx@4LU^10O~6HkP-ySQS3jvcCFhd5Rn!UJkrRKQCnovB{HUoc#;O_5SVZT9IMF
z@o0dHBT2I4qtY{O^$=F$>;V{CdSf<+lgCKQ3cx)B6WzG|>3>d2hX&d#qfSm4?<>BA
zL<(8Wi?Rvo`CI7B64H5rX`Wi|8EB;XSYmj-=@1O0hHd{5ZrrrWQUOlm!Qbfp90u)C
zi-@T%b!hW6=0WbsD`vb!E02rM2ArQjrQ=LrHdI=t!R3b_>L!ROEE?EaxCQa_70mr7
zSKo3=SpL9XtVU^B2vf6ntXYUVOp28u<PG+}XC?!``}(Z-{7*_>HbRr+yNmYmIo1ri
z{Xb#As|#OCJ~6hNjv|%JQgwgnDOsJk6B8DFoM@$EFW2(oz+x4a5>dOD23IE^e+`R0
zTkXW>D>ke8VkJx^Q0nT%jR;TcwLzL_XhDYRa5>WP$fxOs+I3HnPDLHYhpOH`Iry>K
z&HdNNfPlMFj>+9=Y6sS2m*`$!HrUQX@cp023=7P@zw@v3qM^+^lz3GNqJip!XfFqz
z5?orf5YG*Q2K4)^=k>!Oa;UT4x1WsY?u>KwNz81n;N3?C4Vnd06q6)BDbj`1HslWa
zx3AXQcni(0t`AzT){&?7B=qZ*3CpbD*Z!_s`>Q6AHDgrW$X{sakKUa_VX1rm7?3Yj
zgWHM~4CF&!qg6BA?U7q?AviI%FHFUF#sGVewyxBUk)Q$emU4&6-yM;aeHKC1dY=z<
zHiZcLpX`nMF-M6<!0Cc!cj}>^{mkYG<N7j(Wmra_R@a#=>X*v9C~z>XkX6jZ#1c-n
z_IRuaajzU$x#TsZD-}_<V?|Q=U%vsEpA1TXUdjT`;b`SKklA0K9Q289whQA5ZnFxZ
z@;9V^l`Y#eed;mzp(*UpY8DzXJ?O)KG}*+w=rL00vK?k~!gtYK|4@)UkgKNe#_!<w
z!IuJtMhT*74GG~sd2=Q*-AwDl$wR+ZVVBYiU3a|~YY3vcV{ulow``%KW)h3}km&kI
z50QVO%#M#nqLatT|1m6Su(`B*42v(lThH39DM6JErBhODGT-R{h`{JyROj@#heqwr
z#$X<*`u%O#KWyIdSvEn=Asuc^Q93~ITL)%0YG{1W97A*9*(RSoB78&`N#7JQ4kvF6
z12a5CiSSYOYgGzI*zOa|n1z;9xqIx_%2j+x5*<~zwCQ({!Q9vsD{?tN;SLMSgH5!}
zv0=b8Xh!u;a4?i-6~fz`vhocABLd>q2P(wu-g8tCWl2GO=ytzw;ZBT5b?FGLy|>qD
z5da~XnzE2CHGIj@FAT?2-r|YzT{o^^j;edAL;e>9WDy0TfDW>(dq;e0dYo=KC6^2X
zPJS<4B5kX;%!gb~pO%9vjKv+`GV8Z`7MbEzfma!K12!JZ+^D`{Pq=(_<{mJKP7oB)
zP-$2T%nZT!2%C2&3pswO;91kcMr0<rTQm#}%eMn0m)8l+Yt==`ajus~YC5#+&FF%g
z4MflD0Oxk8VV;GO|0Sh1+Ol}>B~xa%aV4NmfOO+%GVtv*SfvL)>9rbISH`D@%*bNK
z>LA16lAHU$i`d|oHYsvjW!3mdc!y=(AFhe3k*Y+ULq0_Q#UJlf<sRT8Oxe}=g3bi^
z^=+*0>mvJ5{x;jQNqk)|$Do(!g6d@t0*$&LYpp-1)^FKa)x!)k)sxCd1Z1H7m6pkM
zL<hJ%lZ87aAYYCsa=pKz=d&4g@{I8V{x)f6&-UqD+*{6QEADV`-hVvvqFLz-js4O$
zyl%;h%#s8EkL^2Ma5i&%5V7eVet`QLQ52-gCz<)CsN)Bip*@jed542VuHqJCd;Cy^
zwPzlAA?EfO0$<~{9Dm^91`oN&{IJli_lx_ccA)S?m9ff_1Y^wFGYQPdt5RUjVpD<p
zE+~`u6w)LA_fB^#cw9q#AQ?iA<Jr2fpPgxiDJplnO^QG#@f(<PfAi$Kg)!HlJT-Vf
zL;qS91SnygQvNobCM{1yDX|4_<WJwHFLee!nPbK-bZ#K>k@b7qSEsS5WL(lSA)W@e
zP8)lKE_JdKsLAqhf>X^fBE-bVf)B_)k)g!&tuEw@9RK#%6AQoFXA0~`?ODCjMsl|a
zAm%dg0!N!X8)I(A?O`*oJ8srAhM{9oV+_sZb0eCcGWVYNsR^+gUE_xpZq+`#w+pAk
zy3~29ekQR8SR2w{5lejQ+yQFG!+)^t50O$tH=LO#Qk2z6WiLAqS6MXso7;+WVgf+K
z2Jc96EhgIZKh8SknG;v0IM}VSRzqlhE&!N+KC`E#2QrRo1ONk@!2k1&+wNfjzVVtK
z0orQ5`knpf`l+UrGQ2u^CzE2%SH4oz6{b<(*C~|r7&6`Q2N<);LF&3*r4;T2MQUXi
zv15`nlXHi;pD~>l*TH~9x&-1OJZ-(bWx9V$`!#i*^PFma9%M>)6JmkupSbaHkLDYc
zYNM73_li@~a@}n;A6vwfMiM>?j;bhz!SaGIIRO#dr@lr0r<Y+*L$M01y`1fKTX%h9
zN4*nAp?oV|4~Nu&S}u{iEEijD_v4z?9xO~z@8+;@yo#-?#54#|--R8DlREnDb|^qO
zbb=xfb0OzA?y4-oZXCm7i@Jm`%Bciyt3_P%M!IsQg4U4LNKq!^uOWevW3T)s>l!8r
z#GI<JpVK-YsO?Ha<*qXNYKwMmr@9vp$<47iDEIHejEl8v#t_&uh|IjB@W3@7Kj*b0
zR7xF`v%kIeu!Cb~CZTP31<e?7Xs+u+xF}L(lHH}?^c&&sBHO^F+24fJZaFopQMCaC
z=KZsw00Q&b&r#siOvQ>(_C-rjX27Y{=RAcx7}y&YByji)K3n~4e;Fn&I5XB_aL=Y&
za=0VVHB5NvVcP2SObTx4_0bhSll~)-umgUo+?+yoaZSEaS%Fb3Oi3%^=yd8DOOV&o
zeiQ=~CKC*==BPH&ZsGxk+<9#^Wwvm<v_f`6vn%7#;j3P3-le_eF(9NDS<L=~MK{e|
zWT%m@QiD2h{pxJIUhwD?cg;2*qc!J;qZm{B{Q@3R#1LsW$Osk@rjg<>8Y;TJ?d$J^
z7u8(T6E@J{NMjf*=^O*#2i_dMHCH1L*n4MMO+5euNsoORe7Tp{t@hEA++iRez=J;}
zlPz`;Va&BnP!pc8)_Ws$knG<0=S$J`;N?quW<c@Ir@bt>FJ9)Z!(ku}C?;>7##8^Y
z%*G9P?)Rqo4vs^0SrPeG%{3V#8dqM<W$)iDq}BmRHt~tHUix*26S+ABr$cDdc5`y)
zlFDXVC`L+AQ4GyXCQb(;_i6#6`c2)CE8#g7U+vXe4rO$n#z7xtZ_4-->D{~=wV|bv
z6^4~1csEWN(Rl2}8P=6)GVQK;7P2#ZEu31!ZUsrCc)eui`fzYoo2`Ju+$Oz-XVkF)
zka#JH?{M0O!HTJ2ixC{b&5n#OTCWHw@*~LlK+t$L5{)Dq5ozDbKB<_`pyegvAaxT+
zSD*9DN~H0_Xl!$Fa{RE{(V+cpsH7c8le@Q*JdINLh*MSg_k%b6c(P<fkUV+0Z4vLQ
zk@dl3d|5@akr-9@_SIc{j}~PHIad_#b_P;%&if;Ca&TL3yIYgHo*Je}BB08C4+<S=
z&?>+6lUTu#?bmqA%@(iT<!8}`sBu*h3=>Q=DRPMlnVJQ@vMoP(n`H#0N4_+}%01!<
zEOGX--+fO77FTt9{fU}A*M67E!z1$F!8tEai-ObAf2kmz>D6A;e<+Nu{ZFz5XZ@ZH
zuZ=x4(XK{j#|V2gOIbHWyx;Hpv=7AMSyPV;wL+jcCQBOJ-N&(tlSS@=%hQ`b;8eV&
zrXX4_{WSltkTdUwFZvo~0OYZnQc8Q58qG~0<LqTJs{B)$t-3|mk^3H;X0597b@Tgw
zUiWSK8F?Bc_pMH2mk~+m@pAx5*4<(d)dJ<P-|W%`yVJ~8MGlUlS|)S1apz5+{Cj>r
zT|GnX-vP|+@NWQb<R%cy+S!&Qr`u@L^Hr?ef_&}GeUHBd>g%4vAHFZ`&<I`+izhy7
zK1?b{x_Ufn^({@a9csE_{jU)szz#W~p%rRyD<X}Z4x8)lD%>!H<mWE1)2#arA4VVs
zk);_m;@nnhjgBf$17HFClrs=Do{Y<WigtM!ScZvzXR1tTN3QEzHUZV4I|N3XMNk*_
z0-*u0D@B}-LU#S}-;LJDRH6$Fewo)W(_Hd#PiUbCYjLQ1RF!UcV4HnELgR}<<no!?
z?b8z6{+=SIAbD&^#>ABEIf$CF_0coqt6RDY(y25Ux0-3}F49hV4u%Y?eEDrVxKoN|
z4><&~nD1_czxp2vmR<+Y>fAf+OK{iMPw5DD8c8O^ZrP9G{VyG_BlCA)$lw}HLfVss
z%1ksRk%-fIR#;VjN?3iZM(nuIX^FjEQjn~UWjy?$%!tqokY1V201b82D^j%8ljr|;
zuZ2ozYqr2*N|iB%+K0^~rSC+X^f*}{c(TdYqp0k=TO0av)X&G^e;1I3OcZtTpt`|X
z=;%|+r@|LOQj)Ds%b0;3wIJe63~!99(A(?U^<2;xs@!(1RK{?Ht^nh0vo@DHF1yIj
z^7Y~fZlj?RfX0Y(LQ2$Nb%A?Zd>Vs7?n}{iJFSqqL43=gkdqgb-#V%lGWBxQd+Y`?
zov&^Az2s`pS7R=|(7@~I8f?K*Mc*xqSD@Sz0~+~$okJzJF_rIujns)R7#}b+Ij2DO
zqMfxNRB|=b0L=;XBiIFWif4CV+mX+C7z8yCmhn*_4=#c2>_)nn8~*GdrX{%-?@Nh~
zS!z$?eE#{1*{<<By$#xa6J+9}qjCX2irD=*`7rg6uZ}TS^L*>(zxyNRPtRADL10Zd
zR!!H)*~9ELr{XgZ_OUYZezeWjcs0=3H^kb1Gh1D|#@64r2yoc>|0Q`Q?^%#)#`m4%
zbe;inI&Y;tKE%e~Be~q2DpSoTYHF|$dsjrIGG4fNesd&@jB?6-{X}19&(sH-%ib@V
z`zal^fSGCXETUOgUDN%GP!rnp^+8y0XgS<-W)s-)zq9af8%@@3XtK~&IQ+ZFk4U|P
z;f>`y=+HGckLalw0Q`YpW7DMi&Unq593_X=^rqDq^lABI!Wx*WnJMk!K|(-jcH8u)
zh+aL;`shSHeR5<%XMy!di65*E{P3uX(@5Bi54)J5Q5NjPzD)nkt~PlpZAV{$IrLU~
zSRblX?uj?vDJJXJ(cE(XIKL7yM-;nt;2)*5yRuEb3PpOm?|c^{J7xAe*2^Z}?{V`N
zdMRs;*r>|?V;$q)V7pA?pWwx#e(AFm&b&l1M1WJ-bq)`}%?5y^9{rP|1G&sokzCOg
zY<nyqMZ==Fc`^e<w24<x|EJ_fTbb6~L9H+E!C8TxpEj1kE-W8tXyqn!ZRKvpREh=P
zfrfu!%KX8)$UmjB5ekdiw+WztMx>n=#h44B9RS|btXIhymGgaf+0rB0Sv;}U+i@v@
zZN!Yw8SI8_Wc}q@+b8<D5w|#Hu8keMEaii`ymgxz0D#)o|DHsa453^%tksT@L9-pA
zV(09(J@1in{W>Az@qB7ZKbrosGbdF&UOIU1W-Kj(h%gpS)2{-z#_j{^&O;QN@8W>m
z8lMo4u!qZr`oO5Wx;A#}G5%cb^rya`fgk3av~?SJH{ydDi0ijWb)g8Cw@0rVvPx~I
z1}o=87gmaFQbasbxccuBajq+3hs2Ry*M({6#cm{ti*~$JHDw<c0x4WKPsqI@n*}Vc
zh&WdDGkbx97RQ;Q3wGl}o-aqs3a|JcXtZ7>!pd6(Qbp2J*J!+fKwPQ|U|Mj@JZ~g4
z0%<93!tG(T4KtO-ORUdr#ug~nv^*u}v``M@62nFJF=R^baQ#OTC|zTTFZhG>VPz=k
zCo(X=$9e2hknrOX1*D;$to~HP;mOGqH-YjU)lP3Ungtkvk)J!QYPpeubLHw7x}nc-
zKW<$6-3#09h)UbSy-q@coBRM%rtf0eb3EQJ_!7y*co#KtVq`yB#bMW+Tg!pEX_tO~
z6x5E+qTx+-@h`PmHubKgFR3O{OlRfx!z$c*XFxJcxxC?QWJc_|ILVh&@%e(j*vAF5
zx%jSzhQ|s5GvM%R8zRsPE2xhgsI$QKtf)PtSd-0Gn>UWu=ZWv*Eu^y?Ws@%nYkV!^
z4JeG9aAOfC)eCARR}*9JU|DLe&wu_^uImxBTxHgCtNJOwrtAB~tXU0g#@UKmv>7y(
zkWBkbY?@Xe|97>m214HI$_OU9DfDpUwsSD!x>$ISJ{B+De``9jiS&2rI?BXVj3iG%
zTsO8KPo@x*0nGzh|J&~y%;S#K=Fy_LD}DKgCtkITJ@5cA;6(?|p?7;*dRs*%l10A$
z4d4<6|3RD$tSAp})s{}z{!+q{WC=5pr0%D=$uIW_#f&JEM13$mL%Dvg4r&&ic3GBf
zbPN%~zM%CMv%}7<G&E&NEoRkdv6D$>KMa&6)d*XZ>~i-V{ATIp2Do2{jS1rb<c5xm
z6aT@NxL}vRZ0$kFt9L@tyfmCqg#@KF>@sPDhMBYj3j`050CGmIGL3tSaJCQU!S?KE
ze3=`y1Poe&4Bwjycr@f9X3kIEb|iPgiqYg&ZATem%{TR8n=RTZ&>pgG<7UEc@Oz4r
zX*%8bjMR^wY-cw?U-GRy4M(Qeyk3t=u>FbcJ6;`X<_gum+KUs*e6SN|S*u{R1%Tgg
zw4D%Au?@0!8AiHvSxNNW3Az;P{<>@bf%Ri`m4TXq!33@Y6pOO9Hh>wL_t;}tTDWCe
zokxhh6~Yg<0{wj(j}|~`f^>+_5eBA*YJX5q=40nirIzJ({yOpc7y^se*WoU2#p_6@
z1SA{K%wN}jE_);$Zk84o(VOB~pjIE?uq5B17^K^Wla~M3*&wypa}{m&4bT}ZeN=$1
z7&ZL~tXnD`STaJ!bt7E+{M$`QBfnUe=lhy^D`)vU#SJO3X$oxUmI)ppO5I~17r>&7
zQYcSeMwx0h{OJ{V`=Q5Q$0L{K(<!4eU^z?}BM!p0qUL-&Lfk6P?EZ-V^F0;$#{37P
zdDUG$)l?xHXWpm@l|B({<gLB+ggW_gzi!}H%8IXFQOYe>$_Hq5CdWDLU<0Z(v!PpN
zJpru9;UYZ<L$2ce&x@cxmM5*kSDQK2@)p?Kk79|U5ZyEZzpnP1o&$ukqmo-%Vpi()
z40M~Y>_K)FeX=n(67Spf!*PAI$)DTanQ!(s6Vg*XWwZoqi~BroEK^jz6|rPQ#Bj@F
zUrMPlf|i9%8Q>#9kLmO}F6yLK%=lUzr*Dw(p8x+4Ue*7F-Ukp~tu0$XV#G|@&HQP_
zF8D;)&1+ZSnFWK$YX`7b_@xx}07oSQXi-qHC>!jyYKrt55dOXGZbuSb`;V4%fg^zG
z6SaKZ``*3E!%K6QYTrD5?~teLCFcuL6le#m&l#@C<lPPnHtW)EFSNYJatTYE8Hf)9
z+axG8+9{G>e^S!DcU`|~T|9&NWzIb!49p<H)vF~w&7HdxAVr`0Sa4zaeBbsnU|6%g
zWcR@0nm`#RX(m=6)|lGDv2$54sSp@xN39!Pp$*^mD|x*v1hlrVtPwE(N7A{+GyT7B
zyb=moedLtGk|H7J9Oh7|R753bSwhO3&uj=GIiGSS=gMJ;VeH_LV+=Vg$B}amo70TV
z{N8<kfA5d&G4^`juj{_9=LPb-`(g0t^8=A>3<%p8Ne#|F)a}Si*++G=KVD2*vU%OB
z5YXkHh5D@L#r8S!$i_``K5%a7vR&H>-DHvYCzD*GGkiX0$;nKV^b_2qbjsF6W7XrA
zV;4@Nn_uMH(+Z7afi5L`sm?!smp>?r*&$Ugvg3sXzkY-oE~6rHV1X@gd&9_@$N^YB
zZq7^)i?=HP;JWV}gCQ|McUX;Z<o~+E+65Yp+AURP)gNASp#9|kdplOJ|7ki;`zo*r
zgN@G9lmcdPQziW-zz=rsGzd$HeSEMiNXKb;NbKnTVrEekh*MKS7Rgo?(~eivzA688
z(wh@pN|g6QF2jy6x+KYofGCQtVQ5Nth`NtS_ua3{Fm{10RPb(`V1xoPqTl<gB)1l6
ze*)b2g@~e@lj>FEfuEREJ&lb9O1kF#|EQafj@dqM4muOG{%Mh`p)E}v$}_EJXJf@r
z-Zapo+3Hd_V+Kf89Hgr>b<uzqNk?k$P>j4=zkAi98p;-m83~6T;H>2=2_=pz(3URb
zuFq&7x9d`4+kN%w4ouw@P1*2l(T3>9cmTf=W5y9=d&{rTzr>syOc_Z5`J<E;O<RRK
zGKh7dc?lYWGknS|H9rT4ALB!m{cW%G%NscW!t*t46?^f(%`<q*pS1TUM+fr-sSlRP
zz>QQ8`+&pnA~QmFKYk6~AdoZ&IWWY9Eo^pO!+P@mTW@iPUp#-O{+;~WsiThZ+Q5#;
zQo$p}rE7tq5G2I<u1g3*ApyS<1noATK`rucu!cY}H+b@8P3ZSR)B34xMG9!(c{ga4
z7S^xHX#HFTTuIqMn(Oxk_FuQ8I1YcPZtc(1_KUTz;Eqfni)cQnRe3tVe%9Y56n~8h
zol9o@uL89UdtMZ^D-R+r+l%gjFMPqxmtDbdKi`7!8@>=)bdiLyAB=Zf%+5(2j^IO{
zvy$@|<0tZ7kvGs&Un7=bFopW&AkPE!2XS>^MQiY!ZsiJ__GQX=bV$5bdtcl`Pepqj
zd+*~Spt%n?-)otA)II+XZR#V(=q3;HJg#Tn;tgWYJoV&NVl%9=Wg@5A{*3<C)Lhi0
z-_nO?fx2gqsWWtdf6Q%AIidPN$>6Qusi4X`pnx^bBmG+&;RD3@ZE)j^>1%MICdU{E
zJy7#fB+H)d%HiwN+KbUTJp$$tN4)ERgR=zxbzMzITMEK60dT-i)%|eXFFxwH)cnW!
ztWfvY<GK><b1T#)o<D9-<_wnz#?-y83U-@Pm#M_+U%3_)>zIzVC$O4rX`QrbYJi!M
z+;S={l7p0O;ETtyW$NS*lgYpi0t$n!_6XjVJbdcRpj(CXl2OgP4|lBBWwXn|#F5O)
zARuoHRz5Uq&!8xT2c1Md7m-uIoaMLv&R0pK<$47{9^n7-H=>*EOxpq^caEh6%?p*X
zTAK?ZS@o{#sLdGpqfQ`Eqm=_nKC35A$Tk4xl%K+9xEHjs<X!8Qz)<1^JCQyO#NRve
zx}(ZQwr%(_Nk?qzu-py`)s(;nk&4KC{kW*?ki4HTFT+i+3tKs*WB;vm!UO2cy&0==
zI%xf6<YfJ-mgx24asWaE4T(Gy&CN}=p8>w`{Xy&>7DA5ZEQu3iii1R|TVcu{VD+Fe
z<S7Ammh3ara~zt?2po0Dpa7|-#5#uxpMDqnAFTdA(h1pZ@(R9+=dcf;P^<kzC_FqX
z!~#5LrCqjOrBx1h+Z@{sKQ^J{Mi`syu$sdJ&5HT?n;vhw(nw7Q?9aWc8)`nYI-))S
z!8v5LjmB}00Xalzd0(_BkKv5-^6{=J2p9H&B2cVYXZbg$S=?bAxvOWDSR%Z;-5WqG
z>p*jW)PG>U9Ll*qtMYa93t2;cOd_VzU_>!l!C*gTr|Y-s|3p3Yu|>#3ANOgH9W@(h
zb}=`~dh*$5WBAP<v7@Xfi7B^8#BMa<iilz`tKuo$fb)h&`kMBPH!mNfzOoBq(Z!v`
zRSQ+TN7{e|C10#2C2mQtrgUQ%C{r}t)S&pu>{f7*O#v$?mIRw0oa^S&0i@{V%pd9c
z)3`T5*QfV5*-Tm-3)zhg*9jQk!thMW9r{z3g^G5%C|NgLmd6U-`Wsl$1Q>CdzjyrW
zX)Th9gz?6P92opU>uJqsN$jI&U><Ioz@tFVxtwMwJ=BAW%bG9o4o2#iCEEYSUxg4S
z*lu4uRsZ97%?wjW|9q5N1$_?9mKf`dff#w({>=AaZwgyOmJ}5$@W-#a68Um`rm&6M
zxiS+*uui<0-$}=$vbR;HuNAt~;L`7Lc@a#eLvHIJ37??=PxQJ*8#h8uTyA>LHE?VX
z*x+9~$fBK5@h&v;hVG<+=E~P5Fy)Zu$q_(gWCqpa+vo#ags^%`LdIRU+uE-{-;^_v
z3wT}1#w8xtlNzkE$jWf3XJw8a>Z;cUwm5NACrY6|i==3{bk_^wER2&p8s%H!Z^pC!
zVG;^|<>|7MfxtW6+iSPck0M(753e*B(70QO*AbZ$@F>Wqv`Mp2{w(mHjrF@(-4@ie
z8o$IblRU35L1TjMjXYh_q>?PYmuLv<KEQ4poQ{_QSWr}K{l1tX5X#dy)xKdP(*Nhw
z_rsF_clVv9kvEDx^BhpLu;UO`^2Oil-qti2S9iy?ad~l!r9%97y$@~N$?>|3rUTxM
zdrE3BNP%>u5d1%!0x)0RG5bY+?E$p<)NU4?WA7^AJoR0+`+Nd|_$67WY<pXY49gh|
zr!kYm2h06F1Ve7>#G`CS=lI{+NY|1^a~x%+J}9wQVlaP(mhE^CQRN$Nen^CjWL;N%
zxQu#or1$$SX#^d^9Pj#@a*t&WLmpKk2*m`p8MOBgynF)tGZzr7C(AG&+z$@(vU~K2
zSjQ^<9<j54bD5{T3vmGnILg2J$?hiSXybmui}ai83B2ot9*5{w^90IsV*O9TTCen%
zqb$FVzgt1Q4OU-(2vLT{7IgaMZKTU_e(Gx^+9gJ{80h(hQhZadTLwjTs8{#w9d|Qh
z@LuR`@qT&CzpJn`a<AkTK`R#v1POP^?^SzGIob@9@(<rA-Cg4pD)(EO;#cKZe}{?w
z8tenHo1&@rJ0;yhb!nF0)sDZLqs#S;a%SxZ)b@4ee?gLK1-Eir4R^#O2`zZvnvH}R
z?b>K^uK(>3xAv^}TT1paZH`ZtQRhHCgkyklCo&Y;$R-SgARuq}B}Pm%&_<u%U5s1b
z46oVEO<i-YSw@~wl;JUY<hi5<c><L9Lf6X=DhD80+uR~p)142mxAJ|7cXO3OkC@8|
z5ZT=^7I#xSHBuM4OwvvSv_K7Pz;U<ex<1Jp>TneTe=ksp2J&bf6PgxDH+bbVI!rX@
zx9F`Lk)ThuuO%N+)hV1yV@g-{?)0GXGh$}bU#AP!HWx)ML9Ox@M`JiSbvgsU`bdXP
zJyN%;4t=`3WB)cXt|ncddAA0EYNK!ic2HdW`te{A_De;M81r^xyKBXH^(ENhf^zvb
zUaNb>T<O&cYNyO6ZNspX)D`2T3D=x!HL|fbZ%dHcLa8@!%6-4&eL+r_^K9UHXJ5^}
z`f(83qs|%M4+xjO`87#bY~QG%_cA!a^;5O)5*X0f9Bum4Y*ycGzfib&H^fDs;c2#z
zWP3({c{=W|G!$gm*Z+0w$8VNI<n!b8HH)o(d^Ku-M0$u6gn#~jV`cZn%m2tN##Tme
zat&|rzi?*bw4lSi!R+S8d`@TwTs6P>2c=*RbI?)PyqUqV)G|nnU&CK_UQD-{{n0*M
z<xqd9$T(iXI3BrWJ+?F>>lLK#_<R9zT3A&MGdj>{^6GIOvcNw@!(Ub~oxcg)=2~aa
z7uYn47-aDdB=uB2ncmdybk^H<RzcLIV*9lnRsLSXNx#U{W_1m9qh-9Fsz@7k2~KpF
zZ<_L40xb?kSoyT%cXI*-VC-`dv(iV1H0V!+isy~<_nxbiq_Y5_A*Gzm&q;G%ULRl?
ziD$GW_IxE%f=*`zlOn7(`=hRZLR@X~Bo-n|?g=Rkdbks>Aq@1OoH~xp{hQrr(y#rm
zfeA)uE?_bnQywc`K7sKqP<U<B2*rsN7y{KuD^Z8r@!^_nJr?H!Q;s2B{6lIZd_^m)
z2QRS(cS);*2EPoZSog>-8~zbEg7@0kRDbPsPR04w<E`(yt@2d8ylg|C(!9cV(?}H8
zZO7|GXj3@=QYa661lYo6(sr^xdLPAHN&MWQsdFEmo+f|qWA2Jk5PUH~^?9hCJ%3<#
z#j2%hX-xdRO~52E;!uGiYgx_r5I0-Q$7DsYR6Kg}eeY)>FLe_{S8oNMGcjo8`I`>Q
zdDs#&8!4i+bc}%0L(29Zck0dyXaN00Uq`&@HDfXCP~v+(L*y`(a<1M>chFAgU_K0%
zeZCaRcJJtG+RyWhaSseD6u-1I7P)Ggi%K>NCbZrK`S-_P)RiV)0VEoYE}7P#Q*%>d
zG?e_qu;7%8?qMax7^mIRL)V7B{otIAy?2(>R_;J=h^BnCS)5YiEI!Injp9O#yy4iZ
zaR+z9k%JXbfxe8`%50&85++_5PH+B<o1KJvO7@a%1<z=zfJ2V@QNPkhyRFNRzS@+M
zl|o`^X-XsAzj^=Mz9sdCd3R2`5iSmm>>_@B#m;NMuPCFaEH8q+@lZ_f+-k?NY{%LY
z>{O5lqy8ZwVQ%$te{k=-Okqr6XoSZ-;L%%e6$Kb&t5Q1@UC4NIou^>7dj6|5H$%_g
zzO*T|jan9+0QSti9z2Nk6>Sbz947>iL$w&pAS<!RVC7~r{%nYQa;CtVg!_x|D*py_
zUGfnucxprB@XjC<azgYT1tq6(ogGe?Iug*FTZHMqHe9OogK0KY-Vxo(A{5po{PA}O
zoyPg16T+-lqiwFw+S-T69-P(~gQF)d4U_^-y!~rq>})ol?IqTbSCGDg=k%zR*Tx>r
zz)*Yi8_fzr)&YM;co8n^LAxZGAD6|g7ACJM-t0atY%eV-k{*WC;+*C%syNh*b_9w;
zhOlFNf{xy9RKeG_tk809HeHEsdx_*&3w02B5~|;+hDkdSYlJ;quaxrE1<O6}kv<ht
z*<6tY=WD5x9$N@J+WL^=eQCG_B8i6NL}7foRGsO}*lvRcV%)}YceJBGY@?U0B>EeK
z{A3LW1l@sQi!qR4?{dQrbdqecM=Uf^cJ+Mwa|A@1%>M4x;v#S|Y&nf9@;HDJ`SKxv
z=Zc9E`q+0f=Gq2h)Pj=u1zYpnXt7f|^X>wA^zfRXhkx?$v1}gyN|ft(AZ~O}=3bN7
z4vKpD4dqcqw2Sx`t$oxmY-1{s1DkWAUnrDVxPl+53*J-r&$)u&=?;*bK?F-QUrpTs
zX8gZv3bR}3FS&I5!MV_wbXN1lKFa-S0{|j~AMdcKir?z1_y%ydHg7I3S4te-Np>i<
z&A;i%bt9kQTdl6D|98$}*>J!i89vUr-zB>ba>4j2JWDV8g{#VEA7<nfQx8F+y}Oq1
zxMM@-fZU(9gz!0$(HJ(2SSZoA_R^|LV0RTToDUHHz*V~^GuoPJi*42v`cTteQ4*x+
z%*nYF+^DD{HU0-(9IXd%x!`oS)tjK9l-#TPs3>gAz^FBKAck<MKJyS8faq(0f7(BH
zVCkD6z300t5muhDlL4ePd+XyR-9q=&2*uREp}yQv>yVOvU!BsJG(?)dY;)9`0C>c&
z{(JfYH4kk60m=fksLjhnIk}1dChxPe@7K$!7dP43aDhLM*HcXv#LD;dUmgCm;bB^?
zOv0&UgrM`Viop46(<Dw?!iC0o^Y!jYnnw3{)r_-<L4^{#roX<`mV+gUwg2oC^}MQk
zB|jI^e6Cw`*<G=bCeIDOm>MN)U&<DM`o*H=C$I}tko4~)se{FH$XOIH+V8Q^Nx!}R
z&P=&|E_9Qh;w&W$qTMF5tYEt>qo6v#qO9ALeAkCN>(zlsi?%`>?w^+D-%}iLF{JgE
zrv178v+?KE%Y61IdIBoOd>&xR{q^d?ns{zARX=<k2y_25Xsx5SilEWa(u^i--BWR2
z@YV3j@7Fr`o5GmO)m$M?A0p^BO;2SWIO1qz$%E5Q(CPCPGKW8)RzL21-U@58P-YZH
z<LkIGY8EKOczNnb#robp?Kvxa!w>HpTj|K5I9vECB#9?ui&!Xoe~Xq1VZ>~2>x~IY
zKu(=dpgsI_lfvYOD}nZZjWX}ceVhCAJ<&ON&vKcoJ6d+~u9eq4>+d#m1yZoS$!<B(
z>)*kOqDQxRtSZeKl6PCdHQF^yHtbwZcVH5f^SWamGH-D)EJP@1{j%fW(lR&G<b-VU
z05Mr*I}Y{%a~9BMZsm`zpm=e<_fWAU^4QL=Sfgi@=wefGeNPgkDta_-lATq9qlJiD
z{Gj=2sPmkEL)U@jE5nhT31^**7e|WF7}0yI{lhC>hEHPx3~1{blTkgOEUp$}9(8wC
zOG8cx?FKY;wjc<$M<Z-NXOrnAJT<1X!*kU9=<$qdaUYTTq#Gg@^4UtrJbCF4Lg%*`
zmXxBZdLrim1=Z_3Ri)nPD`d0EI}<UESkJwRB9vPZi*2Fp#iKNg-{cS+sD{xFHGUxL
zvd(yM{mhx4DDs<!{(b<hwrB#9x7#YDJzMM(DC&jy6Cr2rvNP32G(AY{aw&DwLx+YT
zQIQ!~cd0119LE0Ck%w<p=ebt-v#zHnzVjWp$*B5m*4uX(%q!1;FUA%JY4yKMP@m;4
zVy$=GkfEKCTH|TJxm=kxpW&!%{&LR0(qn$Ru6(KmC>wDZPf=ZSP`JUE^!bUrBJTQz
zYfCc&694egOg>BLHVN@0!e?PJ0;aS1w`k`5vx6LpwGeITa`1+oc)bNpET!{8xL|1!
z(qu)(pJS$Lv`j%7bDh!(uf=`TG8UKg9U#>MJ!&}LlUga*oxzx|zeo`LN5o#o(dG|h
z#-Z|&X3U}1Brlm$Xdm%)_*!rmenvi<ej8w<=SNXEN^uXj0p-ZX-KjYV;%5jHRW8Hm
zZ&|pF#0Eap0tU`iSpFnI2>j_!bwLD?-~ogiuLxe@%`u{hSsi8Uly?(?o^8OlU^*-I
z;9zbgE_F7&&^Za<kp0xi$IMWg3gLA+fw@5wrEf9c3oh4l3Pf}v*Ex%5gm;J~oz|MK
z?u!mVF3Ao*oK;@A(va73>CLX6C$d}6Dmtsom};-SIG|mRl6FGk24K!i8{btO^exHd
zq_F&FzqlVzxm^G*t?tB^3e<y3XJ9Nw7BkZLh$Vr;Hzv#HKQx_{`*r&#`L#D^h|ASB
zwN2^TX+QPD307zmWEByrh0C}^%r~7ELq2evyKKi-r74Us3Fyk5KwrmzbS<Ph)jJVn
zr}r#%S|=XWDCxx@pTBlG5Z0ydt`0C7`L?yxT|<4<x@bBRV{(f*F9@f1FY#JPb?BS~
z2%q#9Y>x>m>kNR=rZ1w;%52Y>+gUl!9FM#4JnPjyEH@{r6$%+vAP6m<IBJZG|2h7*
z{wW)rxw>e<9XW|`d4(TRESpZ~<%#qwUq)6EUL#Pek1{4+FH%=6=kJ}_L@g_%h0jlx
zTd7Gju2cOqH*#j(C26n}LQUwALW@^jo8M<VwI#+gekOy@ZMRET8*?|pV%AT!b_H-m
z3`)s(%kx`k4$Uskz~q8>q73a`y;b%f{0~}gh>h;_nhQ~8pnQ~<5=}a}+>7A|?=l9U
z<JX;Om*=wXhCXlu<YeXDbDy8QvuM6A+?FJ>MLV+es1{6p62><9QfXcn`g8IjbNy0H
zb<Pp@KI{t_Duc<#cIsj(YYq}+KYn|_Ldt0vCHI>t0KJS73bT>ljbq2_0g1%Wf1>BD
z=*~t$f$A3}B=0K1VNe{j;IBdQu$fHrps5dbg>Z#SS~}V^NpBt|gT&olTp;tbWB8b6
z?jb>4M_+x3>Jf{8TK;;WBFzk$XfLC(GiYe4+YN<m5xj48);HDg?P-mNJqt?M8=m#$
zV~%quyL#+xyy*pVhR6!qkbE|1+2QrzaDd+x<Pr{gTg9jKwvG8Y9-!6qiNy=KAq?Z6
z%_7%_JyR}xl701}ZQpug*g~Ctw<^0q03;*2GY?nCi!bFN_Ts3natmQXdqA%uYPO~M
ztB|Y?B{hwKa(4=Rf9`VJ`|3U2B_`#?vhAgTWOXw1N{DQ%bHfV0b}iubm>aPWN2EJ_
zmLLWlHR5qsA^bxBE?iY71;WOF0HVuQ)io0zi;I^|gXidnA$$yB2mk8GV*W=g{C%UU
zazPI5=@L2uj@C1#_BV-ddG1F#na@4Vvu!yN#hwsO${^H8Xt8Qum__pK`<gE4cp}?j
z+q!e;A90>Ieg-@+fdzY;h2ICW!-Mf{4L?rOp8EY9L_Kc<-}HJ}ZFD}M!F;ZePykhH
zD2wCZn;GV*-nYvGDmINvR}(UUj&|R<YvmLl-+|5wHrKS{Ai=(u36CZa=G)qz$;MtM
zz)AKlkR`jTOM18ut5IzIpC3_lMRz#a199Jf^m|Nu%(lc+Lz|WhM878?6Q4JxJQw=i
z;~`!z0rcIg;Ncvq>i2;vJd*{7U!9l19kW%J55_y5E4RSR(t;-f^cJ-=Bj&bh5!1Y%
zy|}n^=rn>9WT<;OXv?F>C~uw^JQ^`x)H0Q;r5D^KeuJ>m>l^NswG0z-)H4cTO`$)|
zaqGwOCB$_zIC2yEIW}*N2`;Gpk68Dnm1~j7KXEv#{@<@Ec<ATCGZEE?4025u@rGzI
zv7#u*?9^!aq~GoM6ZlC#1GOaNuHcK-H^E&`B`%bA5e*&9Z=@6>_(fV|9yv_?)h2Ub
z5~K$xCO#BN2Db{JB|+}s>Sliiv0*{q9(1Nv@Ov3(Zg1FnK+z`*KMlYnWkfBI5ozC(
z>1P8gZ6<A%2$X2Haiq<@<s!6qK~wIT=SN+n$eMazMYxQE*%ovaA-mLC9kPe-4~yfS
zAF{{R(J3XojMh8gU!ySCdh9J78lJ<=@k&j6Rf=tF8QVuDrpg{WV@JT_IwdLDpL3OD
zG`Hoy_x-+4kZ^%ssIfc<PS04n4CmIIU$j|8`Q_WTstt|8;D6vhjHc)J7kMd(0L-MB
z>eX*F2hZtdE-=T}0|d-w#~N)LF2f0$aPWqNsve$RmfXK^7%U=)v0CMPq_>P}uP~j5
zt*_ocNMZ$L8ibH2L7RL#Acv(e0Qe20%On2#mxiNz2Yji0vwi*X;I)Vs5bA}V#%A&u
zo^Ki!ci?IER~qM`fq+L0ou*kLg}?lw0}RX7*uaz8mn_ORa^AFCNeQN(b3=o+<&{$@
zrUh&2?ZiJU+UoT}+g$}SgT2H;b&(QDsHtPr<Gs*?Q#S9F_SfT~onvAQ#3;K~Y0_Y}
zwpE$p_EJrk%PWbwzh*IP-Dy66n`Z}VQLgn_&UgdJ#<?i!q&jBxn`oh*md|7aEH&+U
zs(85^O%7ed-&pe25L9c+NHMLouin&`)`^%ec9fF~S`bn7$rp9RZb2%Touw7!_<-fy
z06Qa1$8-X~y647a`Fj`p(tN}bqu5XR@3Vl58>W_#K4#2n{1z$8_}Q&V=Q(<bqkeL9
z@|X6L&v+c@NwciAFGAd@5_N3Vxf5I|s0r4{Xu(&`>_PU&L*>?-cht3NR!fsPakDV~
zjFH=Ob=_ol<58b)AqAO|B&R=>lM$J*XP`pe(mC)}X~@EpAXOk07X_R*1!g^dzW~04
z<>{^1*Cv_I&EDTT{qA?Lc87E<Y&}4S6ZW24IG6w93Zrwq-(sGNe=Xq|$i}C`W+~(E
z+frk>zu|6!GC8E0{1?F@>(XV^)k*$<^6S$#aO+>SbsaHV!BD$*G@gVF*eVL!7fjBE
zto(_pe<4Ub*zn=0VOk)qenG8fEZL`gUb<*xd5`Kaa#FY#x4iztQcDi6Y2`hiYUv0t
z`~`*EhEN!{Sz_ds85JSwm*)2ylj?h}#h=1i(vI<PKlRE3$}!^VR8~$YxKTx4@P=bQ
z&cpPcOy{}@e7B01$mPdU&6u0f=`!^;kcIY(WKrI#mtLbc_ALpMI`|jPGXcwNZEAzC
zm3_fbe$$}H_#5dv#L>I`Dw(S`D-Z>SXS5CE_foAGl>Lx{U=5(msQXSv7)Ban;M?NK
zAjud}O@-A==(N8Sv}uDm(m(pnuQEyMXN*nx?t96za*-+0MmyvD`|+3RwgSC?riU|a
zH@Ps$E|pg{nf%g;=DOl<jyLk3+L>Lhz8q!LVDGdMG(cLL=qkUug=&I0c01IiaCsya
zJ*MX^IcGN+zeqkgeF8{m*U*lRZUnBwBgi-?X2pMzCogP9%&&$p*u$<F@lNE+Vjeh<
zYuR>e#-i^c@$wdme#@2n2IK8s25oXAcz>h2dTR<`^p1S3>z_8R(do$*0<`u%T^o|q
zZVBi)Por{Cl@Le}$}U=b=24^G>LtIIi%N|np?dR=zhC!^gq6BKYPDh9ZVBYrQEt%{
zl@FU-y`c{}fV{JT3>Nq4UiUj>b+hNSHmBx@RIV&gq8;VGk`MEoy^ze;0Aa0{Ud`sn
zekg)X_9-BaJC3Ns)@vR%*xyE8iGuQwKak{km%A=O^|dQIdWbgD8Or&kCB*4%k;zB%
zICL{n>;Tpslb4dWs=dy0hWgsSD{dd#^anntl{!i8CQkpZUqv9gaDd1jOdQ>{0`&V^
z$$%5^B>o-ishy*Q$`o_i^gYFHSxNr*TW|0E4LEEqlS%b^7h;4Vqd{>2<(<#+B3#oP
zJ#})FB(`mOe2Q%#@amWWE}_OSX}a%Ulq=`QyH#S)riR?xy)F1U_PGltk`EdGIqkR6
zhgbpu_uE#<Gp8)TNEUA6Ui-EUKidNM#XfS)O~)iy;6NurE)Bron+s0XK6#Hv0RReQ
z4o{F6exI==qMBoz@nuIKc7ZgXxr|haQcXRWyUCyX)Vc)kyX42nED|cGWz7Hj9aX`w
zP2K)`P5YI$v>H$ZME%l>y!-ruO$fK7dy#|h0zogtr5~~-D6bfzQ|T>jYbe90d`ea;
z;zNsV4RWN*EF*LM|F+Z$(^MX<TX4!Y=P|pMc8?o+887nh)7Ow9E+g8{wAgw=!2KF~
z(%~;Hrh*k#BUGLR%3`hNe_eNM>ld*Q;0M&_mgOL1$<o0`IW7llYQNlevrgsgb7E>v
z>%ICyD&aF$+O7J_+M8w6FgM=fX~@3-5OC~ABHt;@xC0%BPICzlj2-GY&Ev9P^d1E+
z8cbFeDnZ*pW1k~ZG~4hVyfuu(dV+jpx|^g|DL3D@O-nD$FgA0E%x8nMTav+DPC0Mp
z?XNZfTcR9*uZx{zB@eFJOi<h(Y{6FHvA;gNJ*;B8o)t~_R;xmz2lmxL=y!uF3-oYm
z^{Bv7?$LL+kHS8C57@+nr$%P7?F;KqkOkm|qAc+fukAsX{VOFWcYgc~I~s)e*;B@i
zRB4-^!jz1RuIC0{+U%T1<Ycoj!#T6dYxn}CX~(!bWtTJWl^xxNX494p#bB8RC$-=q
z89>^O;^lOsm?HTH0|lD1ijYB%C9mWjPATOE6iUpXTJ{=d_^<W<ra*&+=gBtQa%LDe
za;}{zT)Q5anDTPo9PP;Ch+$<HcgnMMW+RW@<-&HbrU;@#;BG{6uA_Z?bpOiZ{ar(4
zTEw0uKT4kRr64%%-V_8jxHJ=U{DxziE~a=Ba1*r3A+A+CwOy+E)`{xTvp=c=ddI>h
z<xlAjN>`t<1;jOn|90kw-)wswKa=vd`9R1o%8~k(^2!pGK}sRrx|dT=TijMp^_k`5
zEZaY`p}i=!7JXoZuh)o~CRaZ5f723yQc@x2h}p8$C{WFGBJ@i|G2AV9_mQ3)u)k^V
z@n0dRhw!lA1is0a&*4YZPUo9y6Z}DyB)|uYxIa^3@g~zRtY1o?{j{k~*0-u*A~(HK
zY~zLGT%r?7Rn$=(@0h0)p)`EZ2PG6O?d))TJOJR+W*g7LC-zzQTp<WvCiY-Jft}5l
z4XK-ntg>85_x(f%mg-%5?>vch0o&!fF>E00$kG_~Yg&WJH0lMOXYEda(M*(c==S<r
zJG&&%7L?yQb<ThN^J^)q#U}zJk>_7b+yvjvv#u$(ie?oippwguv2_G6I3U$wIKKSK
z^{U;!>Q`ybl>piZP&jJzIurUIt?We;ORG-Hym+SBl(jWMCk6e<eE<2COeG-Oh!^?g
zNRD6dUTEE`<E4yCN>ih%y{bKcB<}LV(4qwFzdCc8!t!x;*MSSQFQYG^w|O%*yPN2q
z1W|Ajr;!@NOngDmmZ7(aY8UnVY81{X(6M(es1m{3ofQz+lbhiDVwZw4VK0|E<1rUr
zJFW(&jbBU%dmj55adp)**o;wD^qH!{X2c#?P&<vH<d}U9el$n-r;Q8mY;3<M+>k;D
z0-g*PeW<?S*v#5Q002wZ?4G_1TBF}iMWVt-cFnfErlGvFmUmv@P2G*-a@TaEoouhq
zWq;hlgZwkvX7N<X9LPy%Q+-lhdd61L#FF=)hYM-!<CQ{qF$yo6#0+fEem>DPUbVEE
zho&a7zQ>O>Nos1h>2zY*v%pWAv*PN+M{7VYhD~VWsp-;!YTX6}ZY+Bg6eqdxli?ky
z?cNsRC9s7TbRU_VzA`KauoC<n6XbMjxXbvp5bJPI<QR20Tk6bY5mHuOA=Br4pkKLR
zB6LExv9v?UB<n5<&oXRo2XVL5gV)DLeLMPPu#R>ra2)-AH9?&&u;5yKC^T)KW}1sV
zcKh8iDr07|&yo4Kc=I}d&v+Npg4OC$FehXSV@%Q85lb`C!A)h`A`AH`ppcZa#6Y#}
zR(8amlhOd=M~Am!j_P6uOwM{m35IU2JdnrDMQ_+64@;&3R)-c<ePn~X_CyuOZ|-Xv
z*csi2TJ1zWoSypSs%|$Dj(=!6`snDl(OgI>SWyMqCbynQN*v<RS_tX4a-}bu&JInc
zdjy9Pul<B4snk3T6qw67hI}+)I*ed_^?G*_xFDJJ@h5nx<m8Q{5)v&7w3I$_trd@-
ztpD%h15@2u@t5`v*p3s(yJacM%@?fOlL(mKdo&+!1}8}El7|5KHY3qZLw<w1wh{Tg
z!-78NcIIb6u(u^lCwO+5jSTk~iaR<N<nl}P!N&TrklMh66k(%pq%gN+O2w}hUcgHA
zo%t>;T>6gcM!Z$<dY)Md@{g*TrwSv{Yi0_oUX~6Ia@{)!=?o;(!94^SVDbcb3?HJq
z0k#+Kt*zdtX)AKKPZhlTowwfORmS!fUSD$wnx6(9&(iSNvqL4g$>k(0!(xa{8^lZ(
zq{Yg<2HLfkJm>~*`|0z901!zwKaN$+@|*(KT=hCevE-~W0`;i`X#C2$ST86F9+yQf
zQ&K!#_bA5Aot04?$2LBE1E0avg;|x1S*dHQJT%O-T88BZo9-7YBu>K$KCaGR>J$E>
z3G0<vHjK=h3G1uWw-*exlKPzk&^Sob9Anw@uIPbnK&=b;QY2ED&FND+8-=mos-Jxe
znJ&Iw0oR2JF>ZfvHx#tFU6*0?;Q%+c8vg2BRYG&VfDI3wE7GPm_Zzy44}L@v+DElG
zewh9`Yc)VZfm~-$!_d`@U6n<ior&AeU(ZHa2k-ZC;zofN);iM;{c{+0)X$i7lG5(O
z+wAv5@1FBCpKONZ?rYT)9PJc_*Z9qf!R^?>jka6v2M3vA$px_=w@6y{>jm_?I_Dcn
z$p+?o6I#Gu;8>^a+4rH)m$p&>HyQG!S<S^zgT(&$;oIchaj)-$O;_H(^JRG{Ll%3x
zN%=L;b;0}U@gc9JJ<AOZ^Lf#2kI=05f>gS6H+F_oi`j)Eo$B*qv?KI`x?UQ4<$qg@
z5l(8;oY-GlZK|X9e&V8`7A`^l8{OKHuRyC(ix?=8NG)6n$|^nHnW6Ims$aJihki0L
zx5()5!n^HQ@++pLhEhDKMKn}>9=oFK7i44&cn}5?TY9DrI<mELzBEL)9?{Cu#IZ>S
ztNHQlj2pT>(?J#F)W=?&vre;-w&BrSF{M;r*rmUP(qr_lO{Av(3b;OcczHF)ZQgm-
z5&h~tAYJtzufNx5qGl(h>hx47Y_>#ma0SyDo&H~ZAU<ywzJ$?3ikN84qy>uQC>Du|
zP+%)2lRxqU4Tp9`&-BSF;?(^gq1#%_+m-`PF;G(Z1p@k$3r>C=FQ-5rJ;kBjq}kXs
zkXD?*&&mo^QN^J;-+l(aO8HF|9#HSV6yVzAndGnqT9>3c^#7ecW@7!PzWN3pe|P`A
zNdK#4SorvHqK2X03OPvb#qmhos2lSbb6Dq9$zyN}?64W;l{*+*>v%_s95MYt&_F(&
z(`o#1V6U(o=xep|p(^Ow7w%Bv=qL7z@QWwNt|i)a;H|$wa=BwGx9(nVXzm31DwGnI
zo+~do8^(PDVzuo^s@K6~+6_z9P_WB-)a3reaKU1)ThD$3_&ZWtvP&8-T#rz9J=~Y^
z)a;&=XDmpdQ+3gx*{EKfd2XmH*&w}O?erFx<J`uuo>S-bUIieh_S*{Yg0!ZbrEp6x
zX4EK*Qkl!@Z?|kFK=3eODLF0D;X^4MM?{64VolFF7@@8U)hDkC`LWUr1bZ~Xh;>I_
zXFXoUJ-K>#2UUg0<?)YJ&sn_sMr0}5>X@Upx!xDmFNX_miZhmyHc~aIWLBG)=^i*U
ztxxVe0ltH>*O{vAdtT2g8tW4*>s4wgu<CfOd8qUo*^w?qQ~F77%_roo?2&idf1^L$
z1MK=c4`F&A=l@ZVqDeQ6d#sz+!o>BnNI@R~Qzk=LX2ydJt@Jz=A{HcT@pEuBt<Tud
zh}#CT*=`Q@Xl~)kg+nRl*@8v<pD1lRL~S?yt-n6gy_T(ahSIyyLHDPOk35P$kBL`l
z7xH9^W0V7un`N)o&dg%o%o8_Su2-gB>F!-Z=&~aZO+UA>H@jW!zSFh-FNs)O^$HNm
z+*;iK)p~trFO=NZwFe<`n4&@JrhGz>3|Yhknui@ZB6_ifqBI~=H>9Tz<>WhNq#UIf
zo)hr71oA}mE(XzD6B`J!5n5C5`M9_~Mz9c)F%Cv7?`PPyj-kVee^hs9Kc+5dHnb5S
zwF~)eO=qee1MZEbiRqrr^Lz2nFNivF8+i+3d@DoA99U~b;^;z7yJ$*%k=3Lvf-{H7
z8RSxgblE}4233Zyyd^3Ufo$!ZSyM@fazn1}!MKjoti2iJCz|K**I9nyp5lAZpXxD8
z?fLT0GG`B3LpF#YJI9xk7r9smKmOSAX*lZ0IZgRk%>x%2xPRl+n|_!~5>Q{c82?It
zUeE09(kYzpdBHe)i}MJV#9Jn<&?c**n9dg-IMORcId2Y-ya1-mQ`^{R(F7TE-jTCC
zRO*}2Ng6h5R~-_xu#*~{_kG4jnr5je9w?Zu<k*m`@@usY@4!m(8q!mgLqvN2t-N)w
zj?8g<1Hh>+b0%PRz2aCBhW!{efD{0>@Sz@#?jcfu3iwM+@0sg{dJjO}g<(jS-Q!RZ
zK-?4c43(1ED@!6z6p}baw%pyk;H#E4-AAXO5b)yF3)pRUNom2DJTNXHo1EYed-W;q
z7XbA^fV=ZQ*>&f3d>DOyJ<h8j0EbdA)z3Ta{RWdTS|Y0)Dos&&K;s(RL`#ke*2p$T
zo`jYQNj?H8Sgu}-+HwYKD~Dc!9Sd>sVmf_WvIds?LjqvN4U6|m&2?8+z5H=q6W0+M
z52?UZ)#Uo#@G+JC&JOVReS+@PuWpw3;h5?vI)I&4IQo{rso>Lyv$Ug5-;#HVMbWib
z@J+!8e}s3sPXDFpnl_v|Ls(!<s@Jx{zl%}?!M%;iYiiy-t+WNF`v0-r54wP{x*hCB
zNldY>O6xoZifIny2#;bgg^WpdXW0OCxNR95wEkYm`2Aon%<PTmj3r!wnKt>O+lyL%
z=>Cj6eO6)VKb)RkzA;*Ex9*9w!4<<)JYVTTm=ftLAFsL8;<5s$Uq$;{8~oZNeH?)E
z$b;a_QDuH(>wxS2UH(&B@5>)8Sw^h~tiSeGWP=--g=bzHHtoPr+lN9R`wk&ltOxX|
zqYpRB5(#;$Uvd_9@HA0dW$qoGaSQi5rt9cZ{6nqc-XShgPi*Hcg1z)nfzWp?q|c(M
zcJlsNjq=AE*O-<&^D0IV&8HH}3bI{ZFStK~)+Pfa7-ebrk3kg_POm>hr>~@kM`^}D
z8+P{+Y<lV+{_U^PfIOrg7S?OA1(izmCY=dcx0i4!!5ek<Oa8dcK#hGhy%{x`*@VY*
z0<6cY|DMMMW?{B$T>w!3sb7Gh)tiN{{9StIFUGDf?Kv*M{GNN1PI)e@O!7X&DDTv^
zU|G)eE=%{H1qmWwCUKg}-#l~AH*&{PqsF#W!t1SpcsPGO)3Pz3(H}Jl$*KlYXM5X^
zde0jRyDi;7yz$r>&s^eGl2m8p?yLx?e|U_mqc}%T9X^2GWZNJ2SR8x+UUlyEs;ki}
z$5Uw)AGmCi(AUE&8AL@|26}0i)TFvqsIZ_9gZ}L*U|KS}=~wW=fl)QcUr>FVoq;(E
zN~hcJBw(?XsF@v<{mm6WeU6eS_bNem`szMst_6GG`a_H#MdRtT?WzThYz+K7oM>{+
zgmF{cN2PT?UhVuhQ(ZE^2O;DQ*;>SA6FdF)=3#@jineGzW{!(J*UM^>s)G1TN*l_C
zFnJPNhpM+WPGc73dY!_4)c#QIzt^*3zHPE&S^Zg+^iDH%0<ClXfNL;HqGG05^6&B+
zF)ZJ!A6K~55NI>)#eYzJafMTD&2p#)F$$m$dCT&6YgHn^pX;vbi&b}q=y2jq!p-1=
zc;v3<Xz-j^+jI3yzvjsPSHoJG_D&{WERmOylMSG_UnC`DUytHJ0u#pz+CPsK`(14R
zRK2(A#z8s;ib*w`CXalG>P0{PCUeqQGba<!+J9X$#M~c|>|epmeTAD39}3Jj>FpQC
z)mQ_7ijdg-(Q6vo3{%Z{pS-hzSP<(THCF)j0e>Tdl~OsiH8j6gK2Ll|<L#2}A2-Vl
z3JX|Ad3PC=>RA;pEyX*p4Jrl0n&CW$a<4R2a*8qmRh)BnDf@L)*^pz_d|Hj((yx0{
zEA|O;%>kqShgHUmD9gUAoZT#>a~>TVqIPNdPSjxk;1gkY&A+`_cfd75j-D;L+Ub7f
zMG@<vz77{;L`8<Ru;ceie}1%en@noQn5JdMRowvW9a8~%-d!-)D;e&CgCiQ2<|Dw~
zE=WczK-5aEFTixcpUvjsLB@RF8#R?Af1}xww2u`|FPqvB!2U~^{r11+tQV&Md1&3K
zDd3B;%L4jX)}<cFI;eJnNuvp~152X)s@T7#v-ru+Jud-7l`GR0+ZjKjOLqQ#NnRER
zHa|t?8X1j{)Zc+hr*%7L^vaW@q4PaMHCKN341Ey;81eSQ?euDX$DfpFz%jWn^p&mV
zbBo%Zu*s2S$6rA8X*4nS0;eBJUo$q<h%E?>M!1~!Te!unMwmt}JzGZEXCHl$=y$Gh
zwa+#=gsH9uC)tL2NEC5j+_5ZigACa6S@bN}ON~riu_|JLyG(VDo)YzRIDlq8Tq|eO
zyR(cciDAnbf?MBh(cQRZvs1x2hZl6S_wkgJHx76H)PZ}#WAYbe_b1bB1j5QBej7b$
z{W~4S0gpRMoNEXCo(BDlj3-QbppFLVF2S9uAL;KosxfW20+Fj!OC^}^xEPXrXU;{l
z)qhfl7dYXOa4~hnZ`jYzF4DW>Qkaz}2oD#PbXtB<6l;o^vKyM<jZ>i?G9UZ;J~##V
z9&k?;9$nqTXT&GEf!)1>w!g3pM<yQ9aeN2^4{}#BBSDC_0K-#zpGV|wcT8sh^;fPp
z7IY{{c>$ia=HI4=YwFU}eNyvH0u|1amXdN-?G16u3#CJJ!~LZJyD$gWEBVHD!1&5(
z5J=8!{jt5+YfVD~y@*1A5gSEDX{~AGjY)B|YmIB(N6=sFwhM1cAToBdI5<sHHZBMV
zt807+_0<p7<(@t_gF;cBtN+&Xm$%Z`J7pBAR4XYU;Nv48oOBWITVYlDbN7nJ;x_@Z
z9%Vf3m-eTjmTid~jifBQ)`EGiZmSNBiDg(yg+D_>0;tk$!E)}P{%8*07EhZ45p+)>
zr%GI0D_s@R;l&=JEwH`h>D)29y$r|O3;n3Z{uaN6cYRXOmcgfN{w`7zm*ySsf^!L$
zQ%mOs2VyL;7IEAmmzrUq{pdfdMHtezJS^e_iqAY?TR}P&ZT$)PXdxHT+RWAGqimDS
zDcbv1|D&}THdssj-@pF9%RqNDPt^3$OA~&E_3@`s*qe7)zv$TY(}PUQz;SZ;=d0@@
zX{7hA4m7@<t#t7{6VFlsRZS764C=eGxi3UQWcu%{d8ld7v4sk?el%EpO<Q#s+>3^<
z6AP=U#3TRn@!;>gelg=;9c%<1Ek_5Y8oh8jZpSMgKed1M&p_i}Q|4FgV@G?fHl=e>
znw#NY)CHVyhc^y2%ZmgRhcwsz^ed+|VL#Bn5wtSo1+F~rKK>MW_|jM}Fl6n{-|*v=
zn*7YYG5p?Er#&I)hVAIM*$8T`LysRRxq=>mjR7(^>pN)=A?(NTYq7xu8PZkTrA}j{
zR^dzWYs?i9cb^hk!>kZ%TMV|e`?`NaA#18l4Etw?O8Ls)?|b%83h5mN7h^Xw+EX@q
zEZTjt(?z5@+wP7fdG3t!_Hye5@GsOm^#mDUZ%`(<UwMa%_CEdn64#z7Hp}^ZnC}1W
zXt{(~nC50G%yJ;{5UjL2u8=I~4agnJBmHm$&~%^&RC}Ct=~nzN9`OCJXV>ScMLoJO
zbBybC$)SMY*YxcE{pp`gr`EXpd%EukV6}qwkLGjYRgjgrfhQ_AQuzyuiUefyPB7;w
z$A9F1ql)UxUnb=SxO@zh=MGNA@!{Nx%zn3UyqRB#ElqeJF)}&tQHoCUFoOrrDtpCG
z%9Ts#L7T$s^?Hzev1>2NgSEb6^oG+BtaC;%|2H(PuV!#SzGF<L1h{-R9b`|e`Vtpl
z>AIOIu99k1L#n;+P*IYTAGa6G7;)@TL1O#Bn+e)w@kB;-9Kh}rUN)S0>lVa#JCqzC
z8=Md@)8v`DWj<sMdm1uJZlWDCwmER2ByN`?7szk3MO#q|IYs^)oPI#7hsobfbvXVY
z!yiq!s@UHw?=ox<4OT?YsEQgqCPlR@^uO1`Hp*4FkFdI8v$k~a?LlVHs*MJEWhpS5
z>=gXR*oJGlMPB4VA{+Uy^iI_^I^qJXpq`^a+g>L(FVl@cI0=kA03xQ)Ukq43UOTht
zRVE^Z_c|_p>1`<9C12J7v!#XXepRWLox`bjZLS@obI>%SS0B7wFnrt0RYg*`?~>nM
zWf#8Ehv~t8ND}FQ;OhuH=?}fV68+P8Hc;Awf}Z@(7i@D_WE(ggCERrE-Tf2;+hB5&
zQaSY~wWR^rX67Dh8TAl+0vTZ>%E{RDW;{BH86714SqR*pab{F+E2dd?XJ5sAoByD>
zJW<dqM;SjkWHFOagB4HHYNU)q;RQjH`^8xI8*(l<;#RZY-LDQ51^z|}+8`2ftiY`Z
zsWt2497kH@4nO2Lu<Qh>&z`A{th%Eqtv5AcxgKTh=!tpi+;ZH^(?|qUceo&t88^T3
zLp^nq<KS$dfFwU=iCDnsWKb5|px?>v+MS?GRRR4`aY5{6(Wj<L6S8{IR+i##GnSyN
zKc|-fht|HYC0$Pr2jdtUjt6`4srIx)U7zlv&hrABPLv%=QtoI_ga3gV%O_;S(#Cp(
zKxay=7rGLl0Kd>rMHeqHg?=u)5olJIvAIAA<#P_DXRdVJSiB2X%**O+)2n)Gc3pg1
zd}q8_zawaOuHPLia3OfT5P$aLo(fi)5ON=&_4u2;_}qHU#}{!MIdz!Mo^$v^k)X9d
zK7->hE9QWXn-DNF{;i4^Lb!7;qqvX>UBo|wk5(YKG!C%h*bsaF=s{YD@+%|UjZGzo
zq0JD?if6+m;5}ZlE9GTnOciZc%r+jTn_SyM3DWNLZ#-#-%Pc{T<8PGWDFHUj<%uro
z&l~(T=cvXl{3y-)VNfB~pY*j!mC2!o-0gOB8Eoc3gNpq@y_cyFcq@4Q4rFlX7ux6(
zv1&fAZI2nIGG}izvU9IM=Z}YR$`YqIsOVJ)*ju@<&!u+D)7Nwv<<0#eZ_$!={<?aN
z4!pNRH=utFri^f;_Em)g#!79iOWdlDwS<jodA`p?MB;PdJIg5fF}%b5Q`oxSO6&d4
zHvszPeNVvPHj^%Y>NNAH`cY45no9QgW?$JeL7qhAtWkQjfH5UaC{WgUK^j-Czlrsh
zo~?R>^~Kl27bmKQX%u4Kxj!p*aad+ah1oYUItsDR1vT37xf;N(IUn3yU=1(aUGRbI
zb>s07NMRcn@-R)};IZ-aAYSRW&Z72JF5j3n<Ja?VeETb{ZMQ5RcX~4l&jc$w#{cTK
zrzFBgX^1^*X@rC>(xul&TK;qLQAuz8cMoT+?U4B{n^Zr85Lu;L2_?CVEzoI4V0t|<
z^!?uGoh6q1+AARSqXY=Q?%%lYw-BU^w(lFAWlQ{lmB8L|-g-*XvNVoHzywU)pGOn`
z&X;V?aXI1o(7k7~TH_ghhBd_9_`Kcavj=1si6c?BGrhwVM(+mdfm10ZvnRGh`&W7S
ze8MuykW|+)FDpnlv|R@l_3aIq%CrXxe-Q%N^Qa-R=tt2jbGK(90Ig=LmLmk^@aWl>
z78&g53VyHNauZ<SiKuevDtx<Q^XUsy$V)<*KXX~vokcikU<dNH-L^MbU+}eP$8Mt+
zd4|tm#{ii%d0H*BGyO~TXh=t9)y*1}-^5nOU+*#l2gM~D#j254!23!QlUkk;Nm}7G
zpS?H?)Rum11y{acUZJ8YmHO2oEBz8d#ADrlJ_j!SMYbtVS!zGMdOABjH}#)SfnZ#8
z$o++nb7Pz0M~qO2ACBFz!1$BdRUDKj-|&<1S*GRUJb{18J4y}uYz;Os=)7C0dzec%
zZ16Mll=LUt{%r8;M9RZwNTydhc^*BI-YJ}Skl2=+Mf%vhYTsr_aD$u_?cc&K?Y&=O
zKO{Qel9dF2v(9fegM&K9lDA=B6#8^G78@$(n|gKmGHX~RPH&IA6)$w+R>ShHbybFu
z_4t|oe7KaqxwiQIeW$IeWT=&)X`8$62PM`2v`Q&Nn<2qD_sQNP4ku_e^3a(74{xUb
zOZcZue){;+nUW+~Hck&C7jS=A`r=rT7v;sMBwbHstJ2VS3h2<f2Mn737y+)?vVif2
z@EJ4HrH6T|boXjOH_o~#c3?2KB1ye1l-)PuXa9xpO!Had-{hk|2FG6oUFo+|FMFGR
z50nQ_`hIjyTS9Qk#@jWcJ9~0(hnTEyJcMjUk=Jarg3X7iNmFf#EJsghsBMHF*ADTu
zvT>^oPq0hNS82j|#`MMuU!d<3>|SYxhVzJs<hXF+>mt#tkOL;I4LNdiDbcIUNbgZy
zjoJ5m{v4w`YY{(%DR)=~ppfqD_kth8co8RYO%xcaMfR=2YEA7}H%gUV_>eXH@9z9O
zJ)I7ldeoO^hkNiV_Yz|~+oD*XxOED5w;i!=Nsa1Swp@C)1?<qfj84T@<)}WO3e!=l
z2FV)RP;uLzud_JyJCpY_dOu5w=mX^6nwd2yv}UIJf)Gh0zDu1>c`%D5n59|MSvfsE
z;VH#~5`*w;09#q4$5FK_vHc=hC5t6qVyVgZ*8>#0jFSSC?kbLW`p?b@*iD{4cxsSa
zd-U?mufGa6xl%2fzp=LA=JtH3?p`l#M2>S`9Q6B+wW=oasfWt?OU}UPo<y)n`p%Qs
zhk56M2%CSkCCwa_KFx9ZvjY9T4(sw+>~Ql}p0Yra(iJl^0~HUrw<!F5r>_h}*n>$r
zLRBrfFrmwLkT=UNCM7)hD6L-Rh8{I*E_*Oa8gj5Vyr2~T+FCdXU7fUTY3d(3{Z(Yy
zi4{7L@dyy>77UVS);5WTNlh=g_RFgrW|1xg4sG-G1)Cn&<^C>20@>_!_XX=AE;U47
zHbdBV(39WlyB}r~Wq(qgb8so`1;@M?XfJfO#cIveEV1k&Z9FcdsYs5oE04jcpLSJ@
zTdGJv4`?H<&>s(O>w<r`5^Ecf#r5~v;bhU5Oc9>k+l61ApqI*igZJHvuIMuouF)$8
zw5W$k&xgZhI7f1?pAk+WI~jcgoU_?Bl+G5jqq9Su5Ax}Imh-J)dVY@Il#D8x?SQvc
z2v&on3%v&{R&{se?LHlKP;W92(dQk7ZjPV)_<tmwhd-6?|HqT0%t}aBDpd9e$E<`(
zXp(vCgJU1-7)J=nCVM4CWt_yZonvHg;@HPH9NV$Zah!wS{rUd>03HvQbKmE>-q-8(
zeEOk7y!Yp--QM(_eH&mNy&aHG=BG-z)Df{JssW<W1bZ<yotNX_X6#XT2W+k&JtDGA
z463%eouLK88A%tXAjFp0<k^dYswQo|q<}(fUzBs1ATUgs5)9ygdaBg4IKg?FJ!2sh
z@T`r+g8EWS##<%|F=I*FbNUr?Gwcvz9ap34{0OMF2@(-iJ0`{>`4uzPoFK}tv`SxW
z%f=L3s)Nh|)v*b}i#TU(c2TNSndYSh)n7>&zk<{(4Q&g*!hd&9L?BTcck;<z`Nif8
z$gDXiw}7>$*Ju~~hr=CI^Y)H!OzMeH<uwa9sTY-xIW>jdqoH^=%9HILR^{EBDeFEl
z0byS5hfXm{CCRcI!`YiPh8sa*HBx~t1Pw^x3ED2MlWK8rKJG5Szd#VaK<*Jc^#wfH
z4NAzpO9RdsXNwkDkJTnvw5zXy_GXzfe(DSChV`%gD0UU^V*;SSrv(6njqiNOjY-{m
zXL!%AV9K*U6Wb|wGNETc>#VceS=<t41KQ=HGq(Z~vAJ6zFFVA4??XLP7x~cq(*5@;
z#w0pt+7O%0y&pHmzcpXn*nHyb23SDf{4?qazm-JO?f^|;EY%#%yjad+6xk;NA~wXo
zKK#M+ujB(lf)*ut6yG!192LBY*u)+GSww~u?#PP?cdDFYhnKhBl)IG5v(bE7u8g!J
zM5>MHs}Y{i5M*fH#6;Ls?RGXpq-@s+9^rC;eiQ&1)hdCF?)+SpWeUjHIA4aZ9Sm~#
zr#vU0X2rjNuN{kQoFk}8a8LCdp>k?B<1CgB*>#L&kvacLBDUYwtVSU-BLiC?lhd5}
z14TT4(X#9rG>@0OUr(>Kc|O9BcugsvjlG4Hm`@tJ4I*^i4VpAvd+C2PRjLktR7oO#
z#1&i?MQgTYZVVZ_7jXG!Y?zs@OGPbttzt7fIvV&&LRR7;BA-i?rnL3aldemEif6X~
zbs1X=z~jOE9s9R=aw?OcJ;0IN6li(&b9iO>fScZ2x60)}4#)IpnNUauFT;8i)d3Rn
z<`qXDn!^i)X1vj=+uZ-+5X#K9^bP4VoBv}g%bUslj^Z`R{#~|)Cx0-cTt*)eQ#9!2
z!vPs~p2n``nL)NJ`L45xd(hG}&B*CmO@Xf7bL_Qh#I>aRBR`{fq_4jv4tLt-*+%zS
zNxdRYEh0y?^HxZv^U3-rf>6wo-B-rJ<@$~X8u@?Nj1{>K`UCTR|9JcFSXl%8Y&sJz
zZ`zD7oyE4$VekynHgR~>N)jp!Fy&E}K*||(<5=aqcwbZ2D$j-BtEzZ=%-II{^aj!L
zWkN+<R-wIkoN3mE%2$hz7}CPFbTDV1Vav0`W7PiJhP@e!Zmx|HTY=r`W1GL4smCbk
zJYVdw>Pm5!Z;8S7>UZujE0;G!Hg6mbnGrZFdSZhEo*3weU@qp+tgAMaHYrI9B$iyC
zjbsY6H0bV^thTyzp~a|0TmYCLkKK{Py?HtshogOPh8s8c=VgO+wcU!4C;RJ9oH!Bv
z%TWliLY1up?(<wUU`*n8`ba5+InFec=UGQb43dA@V4qh`Jp{|<$4}qqoness@7J1I
z@jm?S3?DJ_Fg`@Ykfdp$j;m%@+kNK5*-(|`)*|4a(3RV3v_zX+rkQNT2NwAMNhN@^
zB!wa1$`GX5(Y6Umw*a~DFkCb$sX-(kIofmzg{gFW(C`q!eMI|&VD*oVv&XRK4}cqX
z^*$0rnK9`8Je8?|w1F>jafReeN18P0CLbq6Q;hNrY{tsZnmvRy5LQ`eMtKJA2}#D+
z{Who5_Z^5=<MMg48TF1A3|u$w8VBEkOL=DPn9~K*a!Cza(p`viNEFT{SgE*jYaifh
zxPWl{d>L}DnWdQ|2DZCurZdM)B4K5Kmzf>TSz&VM$$?AZS`oC<u!RY{W5(@Y*uHdR
z0!@_6oeSq#JAZPAXu^4*RW_CK#7rgeFdl_gQmN(z`l1)AzKPyF0JxjCS@{>;EsE%b
zUR=q-d-{$UCvse%kIc#R4d9QkQ0cnth<Aa!GuHYk0~pzF?NRVlAA8Mc_<<krJ)BIt
z$Xq7r9rqh+bqIwx`3e@#C(4Gq*~xiY{nS&%X<)yutL3JgTDetq2E0K7*yM3h%s&4F
z*nNftApwu)R?j1l9*HULCQv69r@Ug2&gY{z-43B*1EVj;B_4<gcJB!wTpCxTmqh#H
z^+>~PI5q#`oQs89|G~~J6~4}!+8GuTXIK#u14t$gFW*63LH`pyrIX2Yoiw6dA@Sw&
zdGTek8o(MacF=p~^Q{#ru_4Dg-YiV!R{Ilap)2s5IC7I-UUUiFZ*e_aa52ZepkVLf
z{r8K=#v_&PoIH_od%ni8AKN2c=oxBs^h2c&73qW*a>oaPPLHJ44xuyYQ~|vr{n_~3
z&(u$<4617vtKLQNU!Dha0bQ@hQ3KtBVeGf?+8}?IeI_2Mq%pDoO_2XfG+RVjs<4qU
z<AzRf4m;H3D#J~t_BK-Bz66nMS|Ah9VPrw))<5Xzx}U%<{iK<;!?OCFhv0Xis3{;N
zV_(?qal!V~E^@T~Qf~iE!zmN)V?N5BhhQ?yOWHJOKiPDzTi(wu-*KX7k5|gSbGKJJ
znHx7^++R0_L`PL>Bnk9N`&qJL6y_NIHX#G=5U!Pf3YMUCs50^G#->fQS2y7dwr(}b
z@0YB3ZWSz}rgfH99yap#&*JtIhQ6M!K>esL&h{SV5X{+Cm)a3*ose>8a_{~`JD3Ul
zk%8^MZ7}D1WiFz7ZcX6?^$@3Mk`3K#+{v}HP-!xWzvv6aqTFVWf^kU#yN{?o<YDW4
zw}t&G72?ig6<N`PszBKoU#ms1DUE%Um7}v^j2Psw19i(@FO^apaI4wl|A!iWePNaB
zh3~b!NqdW)EZU;j&X|Oy&y{`<Q~X^E`%rk3;KZDm{N7})Uvwho6JL(ub7`a+C-^u9
zsS(5i_zk%EA|Kv}u(;dA@*g1P`{wR6=Wuu9nODQ|8S%$7vbfS*q@w&$OY}M4@l};i
zw8{58A&Sz2!Amv{%j+9ZxzDH9+((9PY;I;V=sczv?lbA3L4?Ln06n@1sY@hWpAY^%
zgazt6eur+l0ip^&N5p<3ITg)kDWwAKKZAC#=QCg12ZHKIf&GnyAY5mS>criQZdGW%
zG4X0A^AlOguClC|pFtDYPbptB%}TC{N>z+wWy5#?77R%`uB_@6dN+dL4;DD^L~Cw9
zi^dbBPoi<<DhEz+VtdXKm7jVa=k!)|*Q~8v<Zz89D`iu)az@&iL^R*-IcQ25{Zxju
zTvx)r`;FzB@hL}2cz&!-H>Wp<*qd(EbQKH;_mGj`4|XX>wzbL{7AZUo-d@RYnx$oz
zmS{Lqaxz-3O0l|x)Tk39jux}qR2jj`H+up`PeQHCx{+$Ar}DDTCdX(!ep{j-4Tn3?
zwQl*1%tay)aQ$F5IwNEI`3KU#G+Aqc2M^c{WQe*SSdDj2<55>OYVKW0H#NBY#^nad
zKhQk-SY4^r-CS)H3{_P*Ps<Khm-aUpeVrPyoqLE{85$DnxZWr~q?v&*gId@JJ*wSJ
zuy8OllFb{j)KTb{{{4!tU3&rB?dz8L@MfChCV;dNo%y$32Ja20I1mKpzq@qr_Za;+
zP4HfBMQ*NTEviAn!tnbc!m4<43lZ`)>s3>%uv(<^jfzj*W-8BnK7*&IdZH^{0FK(^
zAXG|k@|L+=KSD~tQ>Kj(PS(7vjN6WFbT8Vzjjd<NP3(HI1YLJNI37*4zu#s1K?alA
zjU_<^3R^Ev<Pd-)|L#}*pabWFIHv=I8FSo)qrd6I?Y1^|1b7MSnmrRg8(#tOfH!YE
zqnRAd=-d)Lj?+!u#}2>TJ$|#D&WIKMw7grxMa#b7E87<LIM1E*h&D-Q3TlgSK;};2
zq17Vo;&OBO*>O8F241~f`*R*#=HI`Ap!tNk){hSl7FTKI;_5LuQLI4DT+1l*sA&Vh
zBcW7vT)v$!T)G*>PeW2s8zNI@UFo(T--US+O&|)74S&9c*xmJI*hkGt&suO14`)C2
z;!ygH1B>%XA#M<^1B;&knu~Ed^fpp;=+!-cayVL{6!tM*U|FWA^z$s8Mb^{fM@H&9
zF)wyG*S;b*RXh_KyUg_GxVii!rt2>pDdeWU+WygxRGY4^1f=WN>E|s>8Ikur6P@!W
z7T4RgC6mMmZ2_3UTfBVkeki7~H*=`os@Mq<qwm}M(cyx!$2(uO>PR|vrQWR`VFkRK
zx`o-?>NgL2jTZSgpw4z+MTDatn_;Ef(J9p?1l#|VD@zfRaP(aj*iQ8E$!QaK7O+D5
zac7a<l_4h%jSi5%5>^t_lL+gOdQ)%1pG22ra8?9*ali8U7XPb0I;1yIDAM#2;dC~o
z)~%0pS!S$7<w{9c%F%tSufDOQlm0xorrMK41ID(S8)7VKz0!7I-k``+&$IK~lUh_F
z9#F{feh9hY|9ujgH4gwwzJE}B{K9*MLHzQ=%2`SSct9DrLRYQ({bw-q>c$dKQ&2Pb
zvZ^`-+yY7jqMsHmU9CWdQmX)6VM&SIvbY+%T<0sMMp7@!Wamwn!;&P(es)-Olfdm<
z4~D(QPONKdPT2Bs%L?n3;hMW@2AzGP(U)6K9uB0|xn5KH{b2m=Z2@<0s>}ramzVq2
z3KwahN62tauu4e=Kf;80T=gq^Ex&o0TijqzHEZ&{!DYbMTA@)?+ghV$S@dJ$byM0{
z=iZK5+<P6NeUm;PE4v~3lcTdIs!)p~=Jmt8!xbr(S-=nBs=&@a@d&BsPgx3-$c`DB
znYWg>L1_#`y4Y4L^Kk7~zQ0^F>9#BdgXY?@e6Z*-_ZsY*Q(HE9*#BY$6&+V`x)y((
z+jURERJ?1gJE*gv*yX6PL*w!x-3N<+U7sYiW97}R<O-sVK+XbcWy-L*kWHSc8M(QC
zuSLt>t#`dM=p_4~Z-U2G@xou}{bww40?|N*Du^MtDC_a2q?mw^s=N5=`f>RhIxkx7
zzXZvJYK_Ik@^PCn8Yi8g+{(048Z3A;yW%K=-n0-Xsb+}QVX7Ki3#cqRg}ll!nUQ=K
zdpHLgI$vHpc?%e<Hw1i#!?=kuvClJ}A!8YEAGY>1WUs&V-?UYr_%h~aMzXvP{BmCl
zEM;R<Tz!msDxx4oXvj=6B>!y-#F-mUO#nxmcEQF9(C6P+FC|=J5F2{aK8Mjlwj(+}
z)-?sslB}*-!=Rt~3J+ba{`6$OgF9ycgd_=J%c^Q^nKhcEeH?Fsc^L(WA&l82TV7jI
zyD0j?VdLCV0t;mIu3$W;ZS^E$SWzL#a~1y$70}<j2uu`>v1KQBj-VaQa*;gA<iRob
zxNw6I@?r)}@Fvo-4~&P3^89?5nk1Q!P_D^EnOsH+tmQ&?zeb=Xj-XjqF?p+0j=Gfj
zhp$#q@%<`aWM`)D$nz6?KSTzO#!xD$v~HdgViyLOGnj>2-HC9$E0xziaoTP<$Y;cG
zk=%Dp=z+Y4H8>BqJ=#?^2p;cB-aEY>CFvz7OD&lA*H2%GcLoMi!qFkv+jVPKwtkA3
zRjcnbtt?eDrf%?$)XLkd_IWikuRI+1DWZ0hm{?!?Ibhc5PA4v!G6{c2|0N^yAc)8^
zk5$MUsR?jSxi30IK16}XvmmD6?%AsdmzkM&E-mjRr*~2^0(JIE|5oVve#4I9C%BZ0
zNYstijE_$%Xp@M|aF9xL?R^q4Ea(D;bR)7C0F&*1;JtH*awq5rbr{XP5>fv{go-wf
zr5Mlj7|Rn8sN>1}M}mUcf`REa3>gpRu}S<0%&<;><Lx6T73JpGa^f(%{f>RS3>c!J
zSAJ{_sR`gqDvyH9)l4IDA=7wuTTjE&gBjpYf3H}rO!l<(($PauFJ{#teqT3{Gf<|O
zje$(%-Y)Ck1BG9~3up=M;)oeYT)o0Aj1OlXwEA>Bg3w)k-p>Po>|X|EYc7snQdBo_
z!K@&&zYiYN(=|tm4>ZG{JE2-IW6p=x2I7Z!wU5k82#M?NiS;T*?;bjT{i9DOq2XT}
zZZAf`enM;t7@clv1?EYgygkfesa(Yy(&zn=OGXjJ2-(+SEhx&0l?<Vgfi*f6cG~re
zL1muDh?ijxryLPp2BfrfgRDc>)t77qhTJm+b2s#^#flEnUpSp?2km^8DzZOT3qosd
z`%=};4=|satUulq@`xX}O~tmn_WMQVRK=r+*G~Uc;gVlsa4&W@6is9+#r_Gft9@ef
zrvnOz(LuV;T_q;QyG(jh3WV2VL7H1K8CEalxVc<J(Kq{0lkY=r00Td2^xnymlJdul
zbL<mAL&lr0AlI8uU(Os+gRI2r5y2K+-m$^Qkz2o`{}I3uJN9wbrh+*RURs!{DY26t
zLQ$tm(z-QnalnZ2{8_nIul}ThZsz&tA0u!TkpNut;-|lWI}U>{2wFK6G#!u9rRR7;
zpcgrpyf5_gNGMi4R|~8=dx>R*j^01DS0grP^J*@X90*b0nYg6}hz|Z(#z_775f*?v
z$8B~9%~I1?N!T1QR)cZv1=O&+({Hl!3B$JQ_h9{e92WL(?58q}Gwa|>9F1Kft?#5r
zfyz`9=;N&#SHYRiMPodn$!8NE97RK>j{ANLa)BLlmMu+3i){U(pcJ!XYD?iy0t+Uv
zOs;yOVu$94%9cI8<HH$@pI+3g`O9G0`9YW9AfuF@8NJBHA@7naQb+RT$Q+=giL+Qf
z2CU{x>o6iulAX*@wtdZB3z%8w_^VB&TuRL{M+P~ZjYn{NUxPK*%D|TUt{E<w<D-wA
zhv=(=b0;Pc2F2Z=>OC3Aa&0GF5s9Bwo3COsX`IJt+z7pzICS(S0~ckSIgT}y|9s$(
zd8-7h=l4y%SMJ07+Z`-dB`wOhv>&Z7*UzY2+|x)pmB`K@+%%wLJrtq0O4IoNmMD<b
zf5zgm0KDFxBq%;{F07Z-ePlkhXJaT`^P9mUix}~!A^&HEB0^J2!`2@RWRvEH>-O{=
zf^jPV4N@$!En_6&DEr7#G^N|eJGZ>)+q{iz{o>EhRzxG_28B+W*conh1Z$b1=64dA
zKSw^@3bLh?y^W#<&;(##ULucY2kiZFjD~SxFaN$dxkPr@m==4xoiUT46&54By)lnV
z7HSUeh$44*TeQ2~S%nchMclTW@3P=(b=HnsOfxbIrh#tEwBP1CQ))u_-`Bv&GKV6Q
zLcI|T-v8Qt7q-StL3Nu5AO#+vSG60tE$Sh7h{|>8GS`x>9~_559l4QZ1`e`-Jj7pn
z9<_3I@a93N;O2C}F7)Tn@sj9~0oRj!q>IB5qw=SAv#Fd$J_>3#ox#YDQdlInmycv<
z)nF%~n^h~b5od#3d@76FtJvV&#se2lEgIrFk!4+jpROKFYO%i%K33o}hd>xCRO<X3
z$?#)<?0bvR>c+?AKbPH~+)_UM8v`AJ*5gB8p51%ceB*%P!%@J|mrcj!#pLzlJlSP$
z>e-5n_qY)o$wB|RpjOwk)f{wZk29}8bU*|z6iHR7(I|6x?9|iy2RThGPIR0QscZX3
znY_afISM3AO;>DF(c>LV>=nu8m7<3_{B`TN-0n1h=Mz9c)#>Dzr#BBPgL&sbL;lNp
zAM4+W@LD_yHo%N7XJ@9ksf5WjV`qKEM_Jgu$S&WIxPH|AIz46W5UEwM6!<;{tG9*Z
zr!M~*#6kS4KVV3a*v;wQjt^M9KPS1)8oxV2F+REu6k%3=kLUnmlhY!l5pz<A1NEWZ
zcom}{rPk&f$fXTkGF(C~GqX5kv%cU%T#wi)85fzC(S{c7Ik-`=-s*cL!?=O0V$4M{
zeGAij)@zNEl3Am(m+kL2_Gr~mph<6L_-a6E$sy{$Bl>^sX$m*n<yIV_ky|&!H@ATx
z__!fUtF*f?g*V`|?P&0w&OU=f&HGEY<D7MGN;Ud*a*P-k|J$~5<EpGnnXJm6QJ$5e
zlOQS*I$P60zUwO8?8dOK(@^L-qSWWy@#I6b>nDo|7-VyT5<-IRE>%kNYwKB=YgY(Y
zJ>)KPofLDpz4C|6|6Q=qwaBT}i2GHyP0jV0o(g^16uLfAjoFsBZl>I&W=)I_o}XPC
z$G&q{-ML)*cV$$yHn{-EQ_RZlHcaeCR_&P`3UQae9t$^O+Iv3J$+3X_N^fdyHy<)s
zy|c9xnGHp?-T}S&mn!fWSw1;Z&%33`3a_~aMUfbp&m9jARaO0~LbqRM7wo=p4B*y_
z_RRM3C~wPu26$LUK{{vil|iu1R!ZbrvhORKuLNEMyYu5VZlBkRR<3tGqB6_fbir9H
zD^*36b-g!OMY#};$;K>!caYI09kR1QB&g1WyWlHE5-72AuRTf&cMnsriv{j?_KZkS
zjcU<!Ng)9SLX_)<<^<9uI`9;@qFs7&;lC)pZFw?qH8^r*e)No>c@Q15xUD$0J$Hn+
z+NBk0S#hR+qbNd~i7n}meRi-*SW%N1>oPWUn|F18y|nt*3L;sRztz<K))|7pOs?|k
z8xma7hAR|%9)9(1TqkfER9)9V)z~CW)O70qv^<=lYy|{)GJ9#pHM?3*Cn(wnE=Z?I
z@#G%xd_NLsr?Lm^Ex8e^$gxG{YbQw5!hIvr2?FEMraQ@DA4R{_9m+TYBsL5&?XPd4
zM%Of;->M=H__r?&G=2)G24v39)!?k}d6LTIqh$)hRF=<<JOr!2%hY3M7b98HFoHr-
zPOGIcId?m~O>O5}%;yn#qpL=h)!<FbvW0M^R=AF*AlJJG55>;n6m$3=9GT1<p51sn
z@v&_+&9BovQj;fbcn-APi5Q5xtEXYiDylOFmDnQRl?qatYoQGPY&%BxMEfT##l{^-
z9|3O^NnphqsF*-8h-e3UEwh|BUj3UizfGBaV_ysKj+gkaj}>Yp`!xISe{-9&6;JkU
z0_fh{6Fn@S1;KD9-7>K=BhY8mMo|%1xT&tfijA^=Va!tmuFV?iFg<5_pK#h@5R&`o
zcSq)_JBuXh#oUG9EsZ}|`L=WS7jlm$Ll{TdHnEby+8(tmIo{VZAFS#PzTcjwNm6jF
zKHs%-4_%~+*uTIf8qRoV{VI--nZ2xmzry=6MycGs8*Ug--oTrCn~2~~C3lt9dA<(`
zmVf?YnQ4CC3G0{FQO};RJMpJ~Q4QHADRKTdfWq~8B+c|w0DMeP!#+YgPzLD|?(==H
ztSMWq1d`uzd%$?I>%vibpVE}Bnc};hhQ(WHyxP-p$hKr7)lbjSQ++=ZGq7V1<GSMN
z8uojBQqr+bCx?T$3dlRhzvpO^T!&@OJEbR<MYf&naJQ{TJ6dhaGFwy$jJzk<i5%f;
zt4wY@MBzE&)f{Qcg(LA1V3omL166ndF_uXbJ+5+hAMe1~CMRA5LACAB+<nTPvV;QJ
z%cQ8sOTekMXs$YEw_wWR{pB|ovVxk@UQ3<n8-QP@I&o_d9_ZwoecOd47Q%WCtBnJ8
z3gD8rU{zIRd<N}FkuuX(K>Qr{PqfIGaH-J~8h1!&(!(9F|3uDBYjq(T=SI)_4v9PM
z_5hK2#|0BcHOF0j@#i6k&3@yl&dj?cWFyFChCJEuc@Jj8lplDFF<u*7Ouf{I3)M6}
z4(K1~wYzrRTJ_TBTMTg-ILh;Z@*msG4GAn%+s2rUy{<9DjMd=2=yXc*(QKza4`F8-
z_WAUqHb3|sV^~zF#H4)#Hq+_3=9Fqctkg#0bSW$Ngz4a04(O|x5&ulr<MB3(MojtG
z5qchzNylbc3II5dv3WF*A=v3Xhw~G@+qZNYZys*#oIX>19lUNAafEUskjk^C9OsHd
z1a}z#eQ2B@HSqErh*90tJ;5_svguvG5_VSL;YhUyer_mPVarfR!?wY%NwhGTILM#`
z<HH??RlptsX&kGS6zS#HTfyae+<yAWIc1Z~ey_e*>ZTq%9(=Tz;VPh%`&n*iUh8xv
zOsIo)0Hr97^~2h`#B#Sk86Ul+!~z#kE`4EjKKlmN&Dg4@$E#EAk?)531<O}D{&sL^
zv{v|j@+352?P>391pb8CFsVoDh-3Wg8UnHHSO0ht@SWQkLCmSCYW8eQr<;9P<=ly_
ztPzjp<odyadW*IR6}~`;qs{AeAUnZ=vZc*0zQQ3k_q<D+v0q0^K@IEHRba#Zdz7Fm
zvDB*cl!>An(?cuJ(tnEHCYvpj)OvJfqWY??+_F$)HB@H+lI!J$U2;_0iz2c`sO0+y
zKFYDrLYluWfav%8&%YiMY*F{m4)7z-qK9rt4fID5nvNBen21P2U;*4RwYFO9{pM=k
zM@>EjGoOrNcAb>0+p-_HgX$fvvo5Cp;H0ta{B~>5)W_Mp@_avtHEHaBR6=j@ulRSo
zFc|fOVIX#RCE)qlc$!%xV23+X9dhY>DEMp)EBQ43{uMuQ;gmm{j4vK<v7it7mt!sn
z7_4DGTDRQAh^;qzxSlQ`V+;2UD{5Z$u9z&{Y=$S0a{c4k7V85u4yKt8pj_Ns7Nt9-
zTnedGV<&TkMqFDraps+>^?&1GWIO$kZ9F^Qx2+Zxd|QXO{v3^c;26aP7!@<8?pZM6
z5>iY)VtkrK4)D!~O|KOM?Id);57y#Cj1)V2ElQbB0WoNl`qga5nIZkpDuu7NGuEZk
zQ&T+dO2ehFv<+_Y=zp2cBkWptprvG$_sN%i^-o5M?luCSzFpQ@Mb*DqaL{VTonV($
z6#iCG(Q~W9*{frVDm?BZ$r|OaM?lY4k<cNmp~i;@jh%Yrr8Osa%mC$)3jgSkRp(11
zC;dQAtBg$=FZY;=|K>u!JOoaF3#L@i3wRd8J>{iU?IflD0Cp3wX~u;O?pzjJ{BC`x
z%EM||FEP#P>$(%jZpuU4EWYk-o_+V;K?9Xic2jXU7EWHLQV#)7;`j}q`{wn1*+z6W
zSSG<lgPwEY-Hlhj6dDf^v8wopv_B~wasvT!+$ShNPwS<<!(Y0a@mXyc42_0y;=0re
zb4}g*{^Hcm=LC10#W7RJ1E?mDJDu0{EK|qjaNiW5-f+&9cpRMBbRNu1Lgo0i5XwrF
zmvU+d+6Ssej1510a1qE@HMj9^UWR4a#bRivQB3am>$Y8JDIVJA$u_5LP?GHS=PFA=
z;3ldf_1*eDjj!apCHQdiVWIHshz2D;0>h;j8$cR6tXjMKnxv!wYMn5ecc?jISNI-7
z($dw&1UPopdCs<Chqu)O4sx|A-QjLO4kx>(^v(Q)-Qu6mp45&Niuxq{JeOCcx7{32
zrp2a2;fP4p=p0n}Tz~dt@<J}Ra&a7a{sqzKjimShAdJ!yT)*Vy$QoRlC_FaD+0V66
zk^D?)dmh?oFFlHUA#m4D0D$aRRTJ(LKOejxIpFVw>ZN-RDnjz7p*vVo9}POXF{HKK
z8df2v>v`>*^-4<2yX(NqCvaTVPDJjh3b*^j)$l}<9!kjrXlxl5xak9A?IPG-h<)ND
zzr0&<0$~)~V^BKaWShgii&2N1Gk={0<GLipe<f@-GY0*lU(<D#OwGOk>%6sRK{5@A
zoSW{6;q?UpH9B#uyU(|ZryMZbdF1yIyU$7%C-Gt)T%X_)#{Y~07U602Lj%}wOzO!d
z3D2E^%E>qg9SAvf8Zno%eJSc?sI0W@iv@4C$6H<#mY-9e+g{C<;1qmEUoTc}LBgK*
z2cd_K`FYe$a<RkMs}9TD6Ei%{!ZcLzqDp@JC>5=>%qwQD&A}cWU>zT*u$nS(fLZpM
z9n1!DCgbFGM^^F7o%(3_<^@93SIl-@KKZRo*^+ChhTi<?iv@983o&w$8k}pQSh&I>
zYanB45oB$Hm)S8b{V=A37m5#(;(NP~4J}=JR?>JfeAl_;#WXTu(BLE7#pMvHs1LOq
z%AJq+b~II?#MIaqTk_f0*cxD)wpCdH6?CzQ&rdR_Qe!vcW;xwI3DmuRf9;CqE<#!N
zguF2NHBs4bYBgIJ(T^?`o$zjH8vaQJ{13bDFyN-!@%LjY=I+j!%Xd+_mKBx%vqE}&
zg0#8vVmgYmRp?FywtoNa)#56X^Zol}HqTw)sFs6Y-+abz({$d8S~w!-A=)zN%5Y@j
zU---~UeDsSN)X$TNgsc~0vM+A1<4x7tPUmQxM3({y4jb0KIZ@UB2PJ2pvcX)M%5~P
z>n;U313qZA26<W+*dp95xOORE#qK?pM9H>tUG5qm>CJ--;a(RE?Hv<O?-iY95)+z7
zUa6`tMPE1h29zW=0>F%LJ&vGF*&21=n~}Jg#CXRf5twk&SxmWiU1<!sC)!Fe$Qm}4
z_|u@M{@E4_;!8|GbAeBEGX?zubyR@B>qeuQevK_r?^kxF9F{}y)poSOp0v-DP*ACA
z46lK1Wt}$HQ~)^;(=kJpRC=;I2>V@l$s(Fy35}0p3^;zZ4NNV$r~gYwSwvlv#sgcQ
z(GQA_QNJ9e-us}8tp~_d;}+PUP~@&<=WP#r(BUMvWCfWkcuqD<70;mu6IT4ybe{*_
z>03CqBxEtJFtC;rZMjTE<c=zqdan}-i`7~vX8SyBKI-x}8Qd!F%Oyqzmeor`=gsT)
z!3Ed&wDu{*X@3$oA-%=sL8AMv<-VQ8ru;10ftv;7tF-9pI~^RnhtQ!LsDjYDPqum6
zeLrJ-yv2o&M!zMi6@}<T9-4SkDlT$_)63Degn}h9p7oxo9yo<=yU(J2s%v`R{MZUP
z?@pThHsHSb75>~$j22h{AOp#2D!tLOx1maqyQ0K#dG?F#iYzXWk4TBh>OGAadS3z3
z67!t^Ql#o%Hj>gxHPcBvVOqI@KPO-iOic}cH~9TNW8QnDaQt@S{BGx0h05O#gC*+U
z_R--yE}Y8dQirN(QMTNAG(-K9$Kq&GVl}Hkj(M#*n<OK6s;Pil2fH`pot8}PFc!?t
zG5-&K@d0_R>gn8nYcGK-Nqxq1AYt(2;l=S>3{2t>L~fo!EXo;^2PI}M8rOuRiA`k9
ztXefeUkjY>PeDDol&Rt9)Bq}LkGNCeR&RpnUci#NbA0So!HQvk(g*q#G<BTUPzaQD
zWPWBGR!6En$bqvRO~#Rcpn}=m0$Zh11;5ft({Q&p5W{tcYT)s?d+N|1mB##`XZ-?k
zvL*N{6Kn3SYz_|#qVpob%2{GKylB{)*JS1a01PwSi}$6?<J8MW^<qEo#OVe}1Q=-i
z+Y#OFe@^!wqr*0ubHW;V?x+JbXetAcB<86X`%o~%Q?RaKV3%oxT%9jOf(EMsn@GZI
zhod84KvX{kXT#ef+uXz=0Dg}x%Pb;GO!ss31C97UyG<eo*sBA_6jQx@6sH3bUrv|S
z+pNXWkZQ7p^}g|<0$;W*fPIBdsj=;4ZocEM1YMd><liH93iOOqAA{@1sS)<&^KB#Q
z{&=bG{-*yRk0D~0`I3I0T5CDM;v7cnm>V2~LQks)@}M%9j`d~!^oeg0<1a4+yR55{
z|A_p?8}}Ifmrim1kY>+i&1x@g4Q8eq%4SuXOlADDMg*rP&cJ;K#m@P2%p>{n3i0&%
zb5_Sr?h(sq!yLH}BE$i;JR+8hdS|d%o@8iu8~a`AxS-J$;wd<RP1OS{)d>%N1csS;
z18JS!#iZP^6?Fv?Q#j%R*Uj4d1;VFB!HaBpK=%Ck2YlW6+PZ8PPwy<AFI{kXAba%`
z+W)b&m^aYCK~eG7G(1oY<F4y80Yr_=ns2oQ+?g+Pz~PoXZPz4VwKqEUe%a*-p$jQN
zr=EOH%51@7Uy*iF&&oc=t?D3N-3uNI4UWf_j`*gpCm(h*u*180Y}0C`#|v;D*?1&*
zCbD+TT$$0#;TW#iDczKc0w3M`t~W7NUpKwjc7kCb$NKGWNQ?ZY0V}EN`(KklH-9VC
z#*=>J>7E|WZ8*ErpR>9XD4dUK0?M^^-Q?7ozBKdq*WQ>Moge@O4m!%H{)gt8OzeLX
zx@Sg`0xX0NZ&jM0x59llU?}3rwHdhNu6~t)UURX;{M2YR`A+Uxa!0J)ELt*6G`oV_
z3+oiPR<GXvIq!!|JR5N`nQ!3{GT|`G%ch-MDEN8c<D>}%-(p8%!mSjelbZVAvQNl(
zn0Aqus4b%#`-e;MNFHDEC5x$nNb;o6wkdru3(-VA*Y_(#C-16h-hSN}2hx1A$XRBw
z!C;BDF=3;BBBaV_q#S^u^2z@VKXsCkDw(Hg0u`K&$tFSGqsi7eu5-Y%#qRQH{g&(J
zA)6#{aj)F&veSE0R(d4sF0`XvCA30%DHxZ1vTln2+q%Aha%WTQdj&KpC{~P)^l$a%
zk!-30qVv!iUwecJlsT(`|C{XVDrxL}ATlyR-HTUcIs_Sg2Lc6V)i!FfyqHxLmbfQh
zkd3lklG*WawuVV0n&b^UVN4b-EwT5|$gF|=<_VrTg-b1f8*%P{KkYQQq%^eSrGZP;
z@tG@KbP)&rC+cHivtC<<DZWWV*U|H8oc^0H$vSF&9Kx-$-PKnBVdn`c+UDvid@myA
z{s#-*D6R*yPpSI0hn#QxH`OVkqQU>VFzW%3IQSmTwsbQ`B>!2mp9&Xwa%lE-dYJni
zeyJKFw*4`E0I0g2bRR9{*SS#5z3s^edesVNbP(_?&1X4${#9dg_29DqW>>D95f0iV
zq;Pb#vfX7M;~!q8LoiU(NkF!dAzBSG1l^Q=5ROrpfSnJJFHw%}0e;)B+5Ns+mJ4gY
zXiL>L_eB$~-`Ea(pVI%XFTAflZMTKnvM&)W@8!EIn|C{@ZxD8(Lo>{g(2i@S3+NkS
z3Ae~{51RAFKl4A!N{XBW>xu--F$~y`sjOdaB(1I;uI2<P9dMsa_A_V{WDK+pFr4y<
zp)uYKhbnPn?^xNR=Y-hhSCa*1ik&!$4IXYHIeR6Kk+{c3gdAxd^xJX)jO&gd06g*p
z;t7wDA0AwQokn{XR^<*WjEHkvhK7}YI}Wm7p1v25o@U`CBen4?h}~ixe?PI+Qw}8{
z5VPAbclV3U{bdkcyumz<ooM174(i#<FfRRfYrET<_aBEJn<v4nJ7b(AmDk07_?%wD
zc9|R>wr-I3S{UL1Sh$Bm;FP;W*MY)~p;eWYnF=I7z23%W1h+Ta?7LF`Vq=qMOTjTX
zWtu7MbcML{I=#Ds5xFG!xR|%!<k?p1orY8pe1NC7fha8J7*CDwaE_D{g!1|I`cs5D
zR3s<V=aS&920{VF4k3jslBZm27lEJ7O;6#m4Rgz!gRRY>_$4uo_<l0|_7g^AqoLIy
zg^g!|OUPlSfm5(T_NVfF_~P^Q-@utr$u*)7BWUNU<mb|N$TfZTkNNivOHmBK9j+{a
zon`efYw_)5Mt-;dw11WSUS;~Tnux`E4mzy2qQh~6^pMF)A|P3>&-gp;WO+2mtoU`7
zG-GGR4=JTO@aG)!IAHBRAg}%o0f<KulONoC3Jh}^4!W3rJ#iiYSM+~mKg^B98=w)K
zK8Afi7!2l{V3+h^c?Pl&jt0X$1!Gn$$I(DI_<BQ!fMvvno<+NJN(*$}xS3;9h|SN#
zDIcllIHPc$Yay7G5S&de!KC}iCAbXnVJiQ!Q*MCsor5+p;tGo~bEsdO8v>fSilhIb
z6L#NTW#`F#t9Tf0+_f{UezUk@E-1K?F?XPLXR;^dX#aWmR8+21cD+PH)yEFSp&!XP
z)*H%Kf+Q*&3=cV4BCVAme7?_*;v+r6Au0XjmwpoIR?^t2#fxq#>kWGmh8j@=s+oVR
z9AuMdCVws$Y*J*#Yx9mtSd$GH$@d5MyyI{`uhR2~-O|ocyVKEmId2=Ov|+4k|LXnK
zoB+=q%WRWFo9-ewIlUO}%3kSu(L!aVi#ltt&+Xf}MmLB>Zx*b|1n<ltQSFf9!Az}M
z;EG&y9LLCa`_Dpnt5SB;Uv?00Z3tc?xA#3TbGQ=;)C~c`!X*cwZfN*(A;U%Rz=ux0
zPT`zNmAL?D9w3VM+}i}~n5%&RYO3v4Sa59N1|4DJ2?a+sh~E%V75xP0%=&*7vj!fl
zF*8GX)IfnQ&Tx#SWABQgW?0$^bbwAY7UFc<w|HdYmLHpUC}rh*WbmGKJhW6j5>y-#
zygyDW$jJ-?N|ZO<U{i-t$|(08l#yCtyf*R$m#?P^M6Gl*0|P!?Jl$3clt8)vkjkdB
zSlJIB#x6X4l-vKKB_YR+H^{}D9H+kX?5_KgzP|H9B;TB;`w}+fp>`BXXSH<jmal3|
z^W$Qa4v~*`bp;ktSrkWhX~B|gE%bRvS=^`{VEk-0_fAuey?aEa@;(4s=8_%?EgH_R
zuP@g*oIIBNRU%F+$<8dGO<vlT1hZ^)0!W+AAj@U17Ir=PHLDe?E9fej>YPkR^@YfW
z<g4Ilh?6JV(!buYy@n5j!K~gz6~Xp7{VPE(iG;l`WEWt^!=U)+KiC(O?e5O8l;O`g
z!pxsxeJRWQOQDOD5TNdM4M1o8lKP+_BnwHK_W+V0;Sbo836C|?K&2*hr_n010$(6~
zk8^@`R-qH%?}_&egmrES(-LZ<*M?y^_$wB0QGJPJa=q%GjGe^z>73w6U4%s7nJuPn
zcz=q-0V?&xQ-9la@7vVIgbSiH<@ngvkhjYb%@@4|&);DU!6LdxCBQMRhf()-O!_$E
zH~P9~oPe%=bWr?qT?&qLvuEm88@hv9;CWZaE}G}aMA(A5FvH)q7|@d`a|CdDZh+_C
zyL}y2@Fmph`$-e0ch;|!qJ<XKwido$WD_Rbo9?%AXMT)uIc>_j6WptweQ*;i(QQ+3
zc*a(oC%uvhsm1+e8mxR}WN0GW1kfOUjQ;|8<#8vrv5vfGmUHM$Q~o}?zSPiB6#wz8
zMmkB*O#`6wCHDaNX{)BQsm*YJ=5G+U^|3GLf_m*}Pl}+ds%-;SzAMMAAMgpX?Y?`R
zM$w$$8CPO?B;%Eqb>^%Hu<d-C(gVBwtK0m{{U6WN#}OyV6?GCrcTx%2k3@VneB&Xz
zF-Hl(W&s-Drj0dXLgQG?K?ftbO!WG=vZ6iqn@;1`dB7c$b7JCkt&8F!i;YZbjAT~v
z(`lu1b00C12JpqUa`iQ*CigUcD*(wPajb}^-bx@7Nf#(l{?VYJ!}-!f12}3iRZ1P7
z1m~Iz&`HNF!3ML98F%}|jS3*Q!R!63B<MoLJvn3MQ?<RnbrnxEdy6lcYA*{F%(LU@
z2LbN!Gys7G93H;n{C-AP&W8fpRye+&TI>!<`7gc%MRyU<g_f9XWH?XA$&a(T;E=)s
zf9JXt;zm!k=6!g(TkY=7+^jH$SwkcnJ}-(fdxfpOH6i8axOL~Jw8TzUZ(<4Rpw67%
z_0%_>z@Gg8;5AgZ*5YKRbuQDki(yOIGdnwapwl0g5=uAytlnDM%!Bxw;ZLe9))DC>
z(nbT|4dS~9<iIT)7j(`810M6sX4-qn%V)VBiOBfW)+?d+!Zn^>hvOz^q}dfZr8stb
zOr%PE-wisHP)M&tC)$5CXb_E`pCs-z>As=}WMI`%=htXV{!E`NOh^r>nc0(g!yhJQ
zkqI0d*tl7v2ZBvRukw6V?(DMxC64<E6V<QmVO<TRXb9;D`c8nfV|^+!q#1!C8N=`&
z%eqnmvW_R+-^pI9rc)_d*%9{dWQz=Jy1`R_liR!^R_heq@L<}heQjk_@_xKa$rf%;
zP5Fe$U0R69vD){&nd{3b=NQaa*bq>7yH-q5)<crPAyfJ!XhDAzb?m;YInvaZmszrO
z4cR3yuBr3*s44?{J+ndEJe^2>#x63X>6$7o*kIOR*(JMztDb$agGTIb>CGin979*X
zgU~nArp8K7zpHYq=lb1z-XFD<75KTqO$~2wvet5vwpz+8hBx}KkSwDK5*<hKx9J!x
zYjSMY!B-VrZJNL5H~NU=R=A_O`wh+q>gRxVI{xRZJS(&R?A$U3@PBwVwHtx>rws7j
zKV6p|-<!Vft7&T`%=!Yc*)B{4=S~-6QU$n{Bfl=DWc?{?(Nx%Sf-DVRpN-meX$7J$
zIQwQ@n|tWcfE^i-o8a&BmY*V<B#1!3)R|{l>((z(n>*XZTd-92)(NNa38VvV4H@2p
z*>v<Ol5bY=@at?m%KSxu<Uqd%h>!!<q0b`ihRXKugAfwv(OUrr)w3fg=Q5h))^?YU
z;*nRVH;VZ<P+&6*@=;W6FEnkn7l<lDyfj8xEcm(=D-W<DnW{r)4pH68z$bF2X|Cl6
zAC&V+p&7{^9rAnq;vqRH_kzFR`MTe`&r@JV{n9;1ej;<n#VNOhDS_dN-Dt)tvK<rE
zW+%bOzDGHSH$um%444pSz74$neOndZknnaNe<Bd?y_l4EQS~ZoQ=m&2^OUl9`F#yr
zCfHyGQjf-_eDDcSvQ8~whjlaXRYM}a=EOZ?(&vB%51;c@mjPp<*(zt&4)nB*X}|RK
z`^q~b3};1USh~LXy;SW{(|FwIuRIV60CQp8#Wh9TI(kwk6!E~$ATG(Rt1Hl)45-8!
zbvG#}@Wqr-G`3?<ur1JKzzysbu9I2mk51j_6l4C7q1DP*FbpNTvine9-VHoKOEvn)
z7m$^R)UWJ)USn-$poZu6-h`Xb8!THtXBQ2rNm=Sy{2R9CE;e#irB4oAJ=7Z}sxcv4
z&NsdtG~Fq=05K=9Pau-b1jm;Cfr!w^xu@7;>=ylus(L<_6l?~k?P)B#w9EA@Dll%)
ziP`|A@Gu^(@w;n$ilW8(Kt}C&Q8fB+Z*wt3=P|q(cHSb!!@UfhEs&v#=gx(X|I6w=
zFsDZB#qIebGBewj@x9EAK0djjCL>RsK!kuqj`5R=`yF%oUOWhqW@Hd}ylg*k@o9U>
zpLIT3x}OozCYP;Rdj*xI_L7DAP(m@s8B?)8`4nxIM~0<DzS7qojIt=EechP$<Ub#B
ztxos`hv-JIO=De%9A^*+mvSlg$@`u0NI82eoIWeA#*G=V`B30_PGEZCwZq`^zfW$}
zjg}ytZW++IeL32S;XD-F`J5<fl61??!SWH3^LS{#7W_1|pk35PycCzs%HGrG7RLm-
z*~=VHz#*qqN(kNyU3a7}BrEz7vI~Zdw7V=9OJlCslpHO{#aM2?ueE~HrvTAwWm(*}
zd1F;yh(&BreenF}@N(?0mY^qb4;vQeKsK@7NS`LwZ2wZf>d{yW*|%$CI3ar9)gxH`
z2m>7Xh77fzI%haKt{DEBh7M_U#a=%^6(a=O-vOreR`x%a+;-o+tzfSW>_-{O_%r{L
zJ<Y9~-v1nnuPj#VPRIU(2HOfL8+$(smZ<gJk9yWssNkd-3J!SF&%vqfwtH3|VnOWQ
z$=%9$nuI9cQVlqQ`L9hKd_UpT)_bD|Mdbh3xw{fpKD(I;cXSZ_ClfC^n_VGN=6yQ1
z5#!1CA>^9BaMDvVU~}){Yc>1k>lORcBhH_k;mtN0r?0L)PQ9Y0>^FAZzw#HxXD}$Y
zr0Btv`Yyp2vV=BtkK{BfUcfZ+s%XANr)GQMx;_nd)Wwi>v@jbg%H}szwx{~hngIT)
zWHyg@V?NJ)c7}ny_N}jUW(!2J$*)k0BD1R2Cy?5D;7zLM#XjDG8mt8^ZVgTt)|@;l
zNAf#N^_~$F=<Yj;+oyf`p3kk0CwvTa`34cQP7zF=iGt0<Zw}`(ZF{s_P?jC6hNR@a
zHZg%GSh6X@=2x(6qu8S~q#=DU8~?B0cJ_`;^QzDZtZUa5m67vm$qb_Po#_RP0mZhT
zI-VoFpN}W@WOS_}&1n|&>hJ>JVjh+kv2J{cYpj167kfd(gw@EQCsGkUO80v*08l%c
z=v`?olmxIAIK*~QLqy}B@5**8Bay~|y>Yk?GZ*WSBgsO$sJ1ts41-FjVcBtWLOMr!
z`p;;2YzeUa`J_6vVt>^U-utVRd2w$@dmt_Yz-m_GFIe3;Z*dW0OFiM%ef!5Xu_@A%
z&WZasPyDysf+CNy##K!}{V?a)PVC7W0tRbi=Mw)7kZWwV#b`rV9{0(IK|w~dg41_A
zFrPPyb&$tO+8Ai>+16{pUdGKRARaFFER!H+w(Nb5yuO0^Gy8I)pok&@)bRpK<0L1s
zKSkAF^9~!c-UQd5>uIStxo0un6m}bMAJ7iye>4wfb@>8oAI>hF?P7m2$Wr-yW*OUZ
zaF>_>GDW4(Iw&hWdgRA_{!U%6Z+WkOWK{7y^iv5d`KSsEy}VoUZunj)zjPm&R=bx)
z?g{F(WKBeJQZ}dH7tmdthb2IfaHniv5>vb-B#J3k^BRJa-mZUrcCGy;xEQq>oO2yE
zxB2`XAvBUUmIiZkxQzqAS$eZUf{moSJr=u0QlFHLftAic;&hiSI2=5_(|lX}aXwbx
zQ#l$nvk}fJ%L7DE=V78a85+OSQ-cr+%KHTsfXHnAyP$d#oSid~NH4_l_;u*RCrYP(
zNn!H`0+RKO7hjP0Sk~m0kXpP97Jl1~uD<R`kqw!$5+H;3LPd#r$wU<U{u#}8nY5`M
zW9aUtgOplsdwuE2B;D3j7r8B94R4K4(zluq`VkBle07ZSI?jiGoLCP-_x=SJ&r+CA
zE)N_SUTQRD2Jm$nEk!eHrH!c`f;-r;A%ojk=&k%}?Z4xqc%-@QOYoWsU7q_gfY9z<
zgwCahnaQqec=l)PWVOb#6(;nn-bQn6J_{498+@Uh8TkRJw;OSuKxLEUjxbVOLI#EQ
zl#+&~Lohy}+&-17<~;5F@KB&72hQ<B_;+wX-47YSS-o4$w3@l@oZL32U|5qVJaFyK
z>iImwSiZ|;Y8FJk-B1Ha>E5*NNUufu)MB*^*|Ef%$QMZW6x|iy`%!xACL?X5_#wh8
z<^>K36C8kP3<Sk2m`;6*y+`m(<ZYWSAG~X}AEFlH`vbuDA5uOc!rk~uZt||cY+=IX
zFQ6wjO?on919T2U&mrXJ%q^$SXgKr#bB{YUnImI!NaX`h7jp_Hg4p)h{=nn<cjSNT
z%<QAwnSEf9jPD}L(SuknM5k|ju)8OHG3U{w^580;?fH4oieE2N(B>J&xiWJ#IkTle
z>RDI^*!93UP7Pl&dND4_?cZbe*UbEF^MO+Cy?Uh%+h4!M`<yI#&oa_R@w2ltay$tB
zHJXY1-<w9?ye%E~&sbaN8sx6XR#1vZ(o>2LP<}eO#9?KPQkHn*wp-h`cg&3$xLfB(
zKfzrVj4@JDe<x+Ywr$b0NrP=RRmPs7+)wb*uQ-19QZmI}!v}~|57dxI+o0xJ6MYFk
z$BPD6)j_rQIonyDd#EdgY^GcRS>Vfm9Ve(@xL9h-g*w)sf>e*IvQ6*`$(zbGkwj0_
zerLDe95@IO^_-jW^vd3(cS6UrD(K#ly)tU7Ro8h@V@H3WXsUsWmJ2r_8Xg9;1^ql|
z{V%Nc{~~moY#^+*_s}o=pM+kY*%{%FZG{T4_jfKlN)|%G_L){o09JW)wTWjL7`405
ze9hOSlQFwCxKq&oZ=+oQ+j$f{pS{f?9Xh8PHtPnMn5J^^KcwWFNna&t2~%4$ZRW<$
zPOAH5mQOkX(E=3jrm@K07!ZPO;q{kGma@2K9bk5>Ja#x(B<w$QV{y2vS&Wu&>o4OO
z9T9`Nnf`ag;hGWU+}j?9I9}963hFMu7_~fXb-JDE1b8NEJ~2q%W7WNWXp;!0nopTI
zWW`dRQE-b7-#UEU(R9@hiWijio1CZ@tDb1mXKGN8+EHEz!w$t{=d}PcBkGURQGOFJ
z+dyLzbbYXHXN$MHS<Xph7s{yqq+-!PpG}tsZkduzc98wkI<c_j{wGzJf^x8)_d#!2
zLN%06Kh8cwb&Z~4qYDo~rqoNO+b7Du#c`ZAGX_VK3-uzPwSUj&v%zyfY9dd4PVY$G
zhF$M4JqJ<$cYS4r6OH57_@7PU#-+zdTbuC^AeWp3ovnHHHr7An&Zi3-{bT~f16NTr
z`ay6vCZk~raQN70vdhjqDBRBYDT-sJA?B?dy<W|4r>D>?`Y-+!ZB*ltinA6b%$`gx
z@ZYSiNOpvaKv2_=m07rak)@&9;L!zO*Dz*~dEiUPP>Br-Xn}Y3XAnvoMb!R=EI<5%
z>*jeghX?i=53oYU!5X!&hP{v;;qin)T(VL0SY3O6`|#yCvZufw6hk&LIq<zh?hSUz
zeeO_h|Hvp(Wgk}ksUA5;^Q4hfUwW(A()RyoI`?p<|NsA2lAP<U9LgaHZ%NLF<x~lY
zsN~F+$Z0v`%!ZI8a?F_tAvr8G=gleSa}IOf9Ot;rabv^p_5S>>@1HKmYu7wqkLUey
zzu)dT^Uah7GT@&R^Air}s_*M}#n|OlJ-L^1Yb9%OP;K~pRTvUY-cu#LYy35Ze;STd
zzX$HQ*%XgHc<it<siFF0U|+f^xerS`eI^dwb#88KGOHA6!&dLm9*0E2*v@Tz?$UBg
z^)ef3O*Bb$dIZpGf%harNNruJrMoCVlBSv_3xbHWoW(<<ZGNw23)z2mbiAroM0VfM
zvXU8>hIjHf62his*nkQrP=e;)V`-&tB|<gd%_nV|e;A7-i0*7xr_fQqur7`l_Vc3?
zT-BuMsOSE{=N!(@Bs=uU0YdhJ<Ewk67YHR;bz=yu#u#&4MsY6l5{KQ`8Ac}S!|5Ui
zaRO7FTM1q#SIYdX?)Nm2$X(6PsUJfwYRY+~x#MutsG$Nqq3qYUhaEkMGD}#8pUNLP
zo*ohn<BSeb(p0gEu2sdklF8A|@7M>X^p`88xn~D`DSWL{^n`rk=u%XZX<*&Gl`W0E
zE?7`QinsF@i;+AfXCeDt`y|5$P0_)^xZmJ`DjXrW^xc^JQ{KQ7ghV=a-DYB95#TpD
z8CI>$V3YNghHAgCIL0j$<TCLtA$*rZL5^XKo@$y)<7(NmcXvUYbCd>z|IfIPsvl@n
zERP^Jv1{Fj7o|rGaJ^Of^;Mkc@z41>!$au2TA$15U&43)E^!}@L%8vs3gYHFdIIuH
zX3P4v=*iR#R%O5bD=1jpagXEC!hhrD1zRBKc23CvxY2&8o(H+mWP2E&J-op?y}Lp&
zUn1GIN~L*htZ+d$b4@o8ftDVT5`g)GIE)=w`1He^Vae>vQ9c=Y75?6IkWu%~{QDBK
ztSUP(sm5!0J7OJvo6C-$Qim62#3E-t%2Lp9p`p+5RqJ$8_MG9qC1uonEtk#ZUjGpN
zN2<F#3il`c7w=?my0l8Ds#shF$n7}@<9(o{wp0x(L(1d(9mASjW+ES<ee;A7PHf-?
z$X&?5;e=#dvGm|(@S+YM0r=8T$eI1$YOB{jdw00x(8s)ZR(L`bi{wrBg_&aBsytrq
zTrV~8@A3n0`7a&cT1Rz$kZPNCDOOQ*j$u@0A)WOn`f=weLUxmm-(5)Q6gi0ef!&GI
zSbX^VF}d{X0DQ}*iL7&laPT2$x-~%8zl(}k8OlG(&pYy3Et#DvD-l`HbdZCy0l*0F
z^y6<ue4MbN!6&282=MQGiz^gY-I5YKxM5!_)o^hu`s<SHM%{^uYCb<J;2r@N|Ng@c
z1kHng3FI@C@En}GdTvz7ci|8w<!#`QNpbk-0&9tSO1E_Ip?v$ec4B6=th%17oL#^8
zZSd!}%v-yt@WAO^ROGHWOTAuVB%7HZr{h@vKGM`1XOH2QmdCF(?#U&o+2_Q0YOFNu
zUT!+*Vf_@ceeN%P3T8@9zeF!#HyOVM?AY~59!6+<|C{)tU+*-O##@atlN*?WrS6Eh
zj;Fs${)yKV3+Q4n+>CIo@N^l~U9OuTDc3$;;@+I|dKmyY{1wt(#Nly(39(_FV?Ivn
zhbinY{=4+7kQiv_Jt!%YW7=h60FX68TGRkQ!Du|De5_k~&tOu$>DS*(AU5pLl0U4k
zw8+k*)~@bY^^r}>=f$qc0sk(vzppw+$LPy#6m17OmMUIW7ijCl@9$MW$P-FR7gC_`
z+S5#^(-MSF9suI&6HeHKC{`I8b)d38WM-wJT6k!>ak5N$Z1lAB4i@MuXzu`8xN{{Z
zV>SCuqEWR7Ayx&abjC3F)u=1oq|Tp^rq0~~$|uah?M%nRV8#=W<-u7(6FWseHt^4`
zbI<|>z20gj>n}b8gkUb*UV1UEnxUNwC?a``cb<A&sS?9}GP-eWrY+eD-ii*P2HaU!
z=grwhMpW0OEM<S2Gj6i<Lnxf)zPC%xnr_@U4`V?-*(KRrQPbT;MO&`gOjw<i`~&M+
zTC?7|eSokQ*%w5wW}beCX*us>vPU7ac!B&*VjX|tq3tuzCnjB%fae57k~$SplLMkx
z$?l5s3c+0`X=eskvaFRUpcW0F-t@Za*TwfjH<^q=<30gJ(CnuvYo3GG!9Z2J|7RnI
zC1<08RS<$~x=N<;3#B_gS^sbx-{N)eP^<0uQJ8#o2T45roBz0U<woM90H!*Js=g5Y
zeCSVgbB^9BG;{YbhFxGl*l?itgo1}$k0WwvE+zH>OOLoUgYyo<>LRD}37mfioFX4w
z`kdSJ{r&6H)6QxGb<ukJ*@G1>SsnaCcO%WX_PXl5Of&nv=eKbBX2%uxj5;me>V@Q9
zKyz~xywWirVIDV`gs6H{9~osy0hWNdsG)=)L;aQbJ}pEx=ScAS#w9g-bA~~2$}_|y
zw<6h^HDt@Qv?5XbsgB+Pfh({Kebe=U86Hv02+bv9GZNGfUjK48>eifZ+*u=0{!s+s
z<}hanct)S!n@BX}JkiAo9wNPg+H1|gRxJ1#!9RKiOU*^f$rx`H7<BynwO*(>nUFDG
zkgeGKzz`NtGXx-DU-S>ugbki=OS|Vtc^bse8XTLYjyFIbw5t~mLCxeYzuMs-{N~<t
z4vTD@*zjG4cf#WcN<a(NXV+!)N)%h`x4SRrn{X3QNs8wx3$w9a#1W<(3y&D@KYcO|
z99Sgy*=U%dz8p7(YcCgE#@Bjs(dA4o7Q<Jvzboh!Ami%>0um2wjW04b3xUnZ#}A{j
z=QQA<Kfh}H15+P}ZKtab#>2QZ{bfQA{-s-bHoZ|NRAR2Jg2E!-BE~{{r4hRQONblp
zj5zGcVmcVdL~<fPyNhHQPKLkKhFP#BAh+HG8&;Wl=-jS705Yw(@+fheUwXQDtL{Tf
z&$A05S%?QL^^HKU;~L$9phoNbU~_9XzWZi>eUoa+0rSe0Ju1q^VYP*b!P|))a!9G*
z`_z3a{2WiyeuYIq8n*xajHan)8R?f}4~a>{Xp0TsB7JYL$2nVzw`t1J0q-x9t4$8d
zYQ?iiyu?=aa`Y~$&uB(wqt}MLJ8)qes;th}z%jEIwv`GWAw#8qD^%^x(w>PQe%S;5
zK3AwrmYGb$%_AsJ@YL$j@t1B`Yw*@PY0)EWRcvf6uP0`F>JoIvLCnL{^UfZBVDPw%
zUmE?{w*uy-Y5>7}mT87gTgn_Ksy?6qSJ@@of4&&)VcjT2bxn)Mh4AM96zy{O{Y$RQ
zLU(!(aOU4%&1HG>yqP&u`K#X%bNy8A0JtVPV%+Q<DStFtylx*kQn-TCSlPtbW@<Qq
zR$X136R9I;`-SCTga)CpGgnOmka$CJJn${2zfn(W(1PAMsdUuLp=V;Rbhe4guFn7{
zU~gC+l=&~rRgpmZ$$7d66RfPn##AgJ-=I0EvF~X<fuC40-0A_4QjiCAeo5jAeCs9R
z-{6uK*zXh9Bk1%k{iYGS`=qwt9jy?3w+BT`?(ZTcL`EvVMwa$D{?1;v>!0uAIYvpa
z|7DFU+M^73i3%=+M=hAGCcz<{oW^9-vHdvii~n?7O!@fGvlQx7jI_Yd!*5!7U0Qed
zFxscj>`2sozGKz#{TiWwoEKYn{`>=B)u^~YfK@7ukQJ{6bP3#*$A9O794?m*1I9St
z*zE&Nr9FcI^Rp|#^L7!q3#TpvHp0nq7WO*-#*y~FWftvZ4#rpU2Wa)Su+BrfuLF0X
zK-&DKbv*BRV0aNVpr!#+d-hHD>}vV%=rj4BSSI^52D%iz;`Xwe8B{sazKv4v80%{x
z%VY*wKyK`VjiNhV=Yq>5>{2SeGnyA7v_f3Pt4ew|+APbMr7dQtD5qs=P=OvS%;efC
zs>9MJ;P4PDn6AzhC^b3TZ?wODJLy)1X#uvpYHYbYz0cxsSq`g6UHN5di#Jftmd-o!
zEp^BIK27V$Ra?45$!*K15TZvs2ywllcJpZfOVh8x@DodwJ7#iyeNEzaB2}k};NF?k
z!cEQrmMFCd^T4v{1-*v+V-9on;{B_mUR_Iyp7|WVab^(?ssORxc<$d5fl=AxzP_Lk
z!uZTlf>z@WqVDcCTQNgvhKcflK|-<m$67Zh@n4k}NWNk<@+n}Lou2Pb{65;qLk;!-
zsi*>=l>~aNWYDDPiq#r9xl3L8l1mn%3Uq?`lEllv*&k6#<5=Ew*cC#jW?F|U9yJF$
zhYa33bVCMXY-MhB<?zCA2g~%3F+rO{gI$ouW7UQwz<hZD5+!7(1VnzELkB1O2EJ9h
z2khMXpfZtIKr+4^oK6tLeOflMfo`n&TCVnG{=+ILM_~5Q$R8X%ukpTU8t!`HA?BE}
z0~gC_Jkrf+94T?l5^rRNhO|K~V1q&q-@lq4u60h4tEt&S8=m)14y)&TeN=Y0ahR{D
z!6jPk!PZJkObLoaz~OmW8&lFJ9@#{XH~Z@>W5ROUz*{ZG??o1#ln#A4Dyr^#9cIY!
zkJnRwMU@Hngx9$_;qG2K?oI>eq7e@e&Cq;9c`ZnJ%W~5PdOKW-zWRK3xygwacnK7#
z5y@FzTXl7a0d(%=Xn35?Gk=H3rm*+!z$f>)gG=#U7~EnBE6z8no_o+j1wa4JBAH^|
zMY-PQw=y!b&3b9QbFJjKeB0gM`Y!6Ue(WT!qKhJZG^}c5zKUc4hZx%hj>)Xr$!%Ql
zo9O>w-352e4S}$ubrmidbOUB#r;v%URy(z$h}NJ`tlVks`byOEZzD4iL2)4fl>MVf
z2(T*w`aoqa(f<*B@s)lWH|Er8`<c6|uqKObBG=xsA**aMa;24J5EIa~M`1l4o`1&T
zNOUg19x*!*N|?yu<6n!_q~XpcT=NaEzB2jtkwyy5GOnM$(ccd)&oBp$CQUI$*RMmr
zIM_w(G!B*Z<ZqC>7Z<MU;G+tY!LS;IF@|r+npfTz`I-M<-m`=f$!`Tf`|@cDJ5U~V
z<43UW3A1Dv+e#VW;a%;DlpnTho#Ft1S|I|pzxqwGp2T&-r9jb$zT<_<78Mbe+Q|NU
zOphHMhQE*$xaOvT-LZEG4SPGbtK+(2#6GXbxhlt_T}?+*=RT~V1GlX`6DXRJ`NBM|
z4BHwZI^v(6gf8BTAjfl=lK1As`E!1dHRT`;-D=a>&lhHCEU2kNREYh3_sW3R%!(CV
zLH~vrE^r;cJ(yn;p;j0@sve+J8eLQz1{UDsi!qRZzf<b1Umn&}4w(Ibr|AYSPeWV2
zcn&;L<^wM>j2{L`(Lo(>%Ya9(<;{XWzThHXA*;cGNPqWb00oXtocKTh^y8jy;#mI|
z#BN4v^9|Phah*W*LuHcg9!j(-V5jUoXF>egt(D~!p;;@>AOlL=TxojKUKawS*)xk-
zg$^?|OJ}9Vh`uR1X%T6dQTVf1uz8G!&-(~^?L>3_O;<Xp<qqOd7xSO;1HEyJ!Y(i~
zX*$9XS&H?ngt-xM8GjZ<#XrUQybt?ZIO{I>)n?9jTah2WT#3M=6xY|?dDu<`pPs&)
z%fq9nK5x&T&|^Ky^mz_~$Ne;imj&w4m+G`ken6^bT@(T_Hf2^XH#$)&6j^;QYJ{Y=
z<=CD20?a|P*=3CN%5L(_8R0#YBGFEj4Xx@PQMl)cM-^w56wG;kcQ6|di{$s(2`!%)
zE-E7(*N#W4j!q!c?CzG@257JnSb@Qjv~~LCaV;ab;k2G~6q`CA?XBO)J@Zp`u%!VO
zBasy)67-18{SMI3CO~|W!vI#DUoG@Suw^Z~Y}W$PRT2|oy!r4uf_?@-F&su#$amTP
z50SiiMu&cC_k|^9MC`@ExbfJ_^D$V}4OQcJhuZU5w+VJT@moY3=14B$+N%xJm(BW=
z#@{8T<)z4N+=hzg7KT4#U^ApKh$ql>%U{BlBQYtrPr-<|oMkdYGgDCcy5#rBY#?_@
zSX?s$#7jhFaD;=cMjEuU+wQzoy^<YApZd%sJ(%lMNK-Yvy+{JRTy=Gf8~pf7tP5GD
zyQ0||@V@NM{zsjoo@|ic%B#H9&8}bXuw^j;N#P(~vjJf`Dz#3y^2zQjcUq(V)hu{Y
zCPFFXOOG<M5nAbx(w$;kuC+FHFVJ-slVq|jm`N`N#F?bX7)Y)c>ED^Fr4oa+8(9N)
znuePOgYqtts;~QS)Vb}MF}Q^$R$Ou0Zoc?1QjZk=O{5`V(K*1#j)Si-vAGK@xjJ1E
z^s1E+^yXX<Xy#)pMjd-h)0kgHl^OSLsqT31NOKgBLlPjcZTtAEaghbg@Es32%5ddv
zvAtev?48!^L3J-7pcV1?e?~RHB*@NNd)i+8qBrx$aXR|`*GrGz#vK>_kWauG?g@*S
zUG(pY^hZ6PM#O>H2z&%(nw^0P=T5cEgwWMK?A`u1d3-%p+vbBn*CE=}VB0#Q%@6Ue
z&EXQ(l5J>hkg>5`8!}ZE^;3C0pIDn=C<C!l=8-yLg-D3PUSB6%7WAA;Zy%rp#}piW
zr~q@KtB<KK4CnGkG%v5Bq6$aE`!4=|Z}%sn1-?~?J^EIW=r<~RG7WsxihB~E8=jCo
zKV$YhReuGF)T!8B;Tr%J7i`FUvTE_2{c;r=>nw}VLe&rTar$7$W3{E;TYSu!-an0U
zuRAtCiRbU~#poRJ>F{kZavpY1J`_qE@Qa~z!KKu1UR@$a*Lr|txdL7DD#We<6D!W6
zTrrsUqMneamZbamlyT=R45xy#?6piTfGSQbz;G!1x}6hAFDGCYR}&#g6Xs6h{S%ZO
zWO4{ook<(%R%Vs>ALIA7@Vd2pBUy(pw4+s2$oK5C{~7bopZ?`}B_nox+IdZ4JFUTV
zz3}+V-*<X!2gHH7l4FB|k?bexa>++n)G976ByhIedR1~-`nW4J<xZDPl+VRek=?0q
zHs9U#D8YMvlBGNG^9{NKS9P92BiIh~<vj=?CgW!u4KO8`uV~#k<~Ha%p=+C|@y>i7
zo5nW~9eiGki26!M7Rh)QZzzyK&G_ymOrQF~)vzD0KXPZ2=frZu-@I0YC$g3~P^>qg
ztc^R<HPJ^y($3U^HP-RyoSSm9{)Oc4Fo2L7tu~BMPm4S<DFMR!T6>;EIP24)ZNA;9
z2rx%%{i3W&4s2Q3^c0ctvD}w@%u?X{cGt4@rUewuJ9I9SP(Caz=)*~!j#FE=<wDrL
znWIa|FD%T2ELzRWn%hv;vY-hfVU*wdJM%S6mfCF)D-^fj#JIjZ&s=V^d%FSC$DgXD
z{#?KPfF>x9KvbjFSjp9$__o(4c<91i%WLGqO|wR<D`D=P2LG|%Z0!EF_7tDJEL#{5
zLeKl*0W=gN^)$*XKKyPdhY!BK#OL6!9qi(fS%VjN_j0$-atXGV-zLs&lQS!O;44L*
z;_}lJ>un-*b0Gq?nxWSl4OY5QwVG)g@d0ICmj3gInP$X23K@$2cvold>6N&|M>ZFm
z#)mKdv$Aa2$NnbJITY*3$t<XHPVBhc%njQ*_-s02<n(dsrbk;KDFK7b!sWA2tL<Hq
zhO`_o9%hUayF8Y!qfXGx$mO~53xmIO`xWFIZ_=S#Mr;N#bqfCXB9wQU^KV_%rK04$
z1-n2W#gpI6Y2i_L=V@g9f^$Q7_m<_V#LFWtM|YYQ($`_&4^vZhD{>#A@<&(us6Ys9
z!VokTH@A>Bxp>Bp0L$v@jTm<jLryi0a&6BM@ho}i>Yl`T>(nl;I0u(M@cr7CwQer|
zT-%JY<~>1mWIN0_Q{D7lW1jKP{<yZ!!~a^6ldQW<mXtp27@qEl9468sPB(tT(6QTj
z0J!VYM_b;&f|ZfC=+pN5*Mic|FnfhYJ(#pqJ&-?&*Zn>I;A6y$o?wr9qGY60$|Oju
zt@jEdVhPH04D!Bh0?q4TOKd^*qltFgvrJxEckS8U4#zQ@QD&;1pN)I{ai_c;*`IC1
zO4X_<f6Aq1+KG%vpS=d*_$|z{$1H>%4Ap#;qiV2Na(qZY9n|OaH?JY?*M=GoorV7n
zZgR9`?WkqCW*|Z7q8~pz&697nJ(dVATLhHUrhY;EH*t^eJ9R^{=?`{h`JU^YJYUU)
zgIQz6t!t)E>=5Jf^*y96Ys+6vkyk?$YAjUzsOAuritUyt69?PbAukop*2Js<FOydR
zO$QvQA7{{Xd-73ZS?SmT)GGV|SGN7p?v?TLhf|2EdOvphVw*n!+Ti}lBIX10?O(;x
zn(OV_uccEx)F|o$!pE`ub6!XAqJ)<GULO|0G%HF0pnI+=7ZaCL%l8YI8q+`pgwgYw
z{oBy8LDOHCIcfP;by@JO8~V;_tl|78N85(5XMk<zKUTPP_kw<9<>_limyOjz?Up;Q
zc%!&Ba+bF1O=)A@Cu%rV$;6q|N{+E5<?l!N?i_Jl`3(1{o84HBqZP5NjJgS<m?cYC
z`PJFctg~*GkPKS#N`sDVTo?MOfscl|f0vB4ea_V*JDDP8bhS!STw4PNNj#C1fDoF`
zRqH!w)90p|q4uXNsj}A*k!y32Db~?hwl&y{6XCfykqPzBCzcaJKHM|jbOUCZ)*d!v
z%MmdKYNW8w0Y&4eV*|gRJDKhBYYh4b={?KZHdNPh_#Xj8SmX>#ux+|UoR~nLz(b_X
zxb`H^-AXH|dZac-j(j0Vu^+sFN3(NIq93;|Ru5ebl-XqlygBkG6pM0scge0l03}X+
z-OO~=QE21YuW3_15(8g&nbj=ETrY#5S_$wA=#WoXCY?peLv;;6w5Y=!&-lS*^g8Za
zA<^Qg)i5QTLmG>MDG0)v#KZa5>7EApMihK2p!M!UTF~U_ew^b*bfs6n?WOZ!<YaFf
zZs5^-q($%e@H-v+t>SiNpK((=3|B6oC8j*v5-&o@Y7W0EvOl2gh;X7BPK-2DPx@@4
z3N_lgr!??F!$;nP`qzs!*N<qKG_S)gCu)y)0Ltl{R`$yQwX+bKhLz|>Ld+ykMoF+F
zw}!Lvz?;h0LM#;y*?_41JxPZ;4`Qlkesgt_bqtdhF|uWs5$-x<7K>AtM&u`5ze+|u
z@J%@AWafz1DSUCo-%!_4l)oxYldkoACt34k3vSEebTylF9*9j7GG^wNO)>k!9W}p#
zm(G_zdLl3GQGD5bF33$V+!(<Yj*B%5*&^y1ZaaUh0euEJlIJunMx&FJX(P8;1mq4Q
zm~|7@Eq%u?!KE@rzUR0r66-QXZg5(FzW!xr_w26E9gK<<+&y>tTFF_h({n|dI(0U7
zay}9dg=P)-yep4jRVk_rTWj?pBk#_AR(rm$>B0_zMIJ$gtnW&zw0)Cz3Ldrt814DD
z0Qkj6FmsGBfDN3^mQpKtsxgYb@5mA*T)nq<Vx>j_xd$_j@pmFGbyAn!7RbG9T6`O^
zf^v%Q!NWfsU+(CWA!9H2;eM>X>T1^0g7EerU1yf%+$YQ1*N}2ZSM90!-H_vlz-kop
zetb8H8O!cVx%U)DpKgMDd*I6gczdUdJTr$aOR(>3>#otd8chQs{p9?%uIh2Y*o*0t
z5@Oax(u6GFGG*kQ=j1*8HKZ#batVpHuf#?g_&RQFV_VO-?tLsY=N>R%0`jy%dUM_J
zE4jQIio*p7rz+kMDI7Heh}Zo|O`jgg5$Jg9+7XgfPZ;vbS?`r_ANWzy2c?~unzNyJ
zdc!OVN3MrO_SKBNU_IViEO3848l{f3`A#sC%JN&O8ZmB$lo+5ZtBfn-b1m6JbU#HJ
zWUIWA=Xbg~GNntUj3TF|%TiP3OVK+}N_Hd3F|Rvm{+H6U7O;yzXp1WCLUkLcP}?^7
zNMWyhY~*GUpzEJu{x1#(NxV=FRPU{^ZRxZRQ$u653$00s{XSB2FmHkO%_Z}b?FwM=
z?|5&P?R=oK)wkl|{y>9)R`G%2AZoYZ{P|X=J5`!P3_lXp{|<&qd65MYH?mSTD;8<l
z1Rg&9@V(5P^bY`RjH?&!^q^!SSxwr@);23S0CmjCQILjhl@U}XrP6$>b?GP}1$_8M
zUboL--MHf5GyCI7ahnG@dQ_;@p<Bd2HvfX1(YPhfF};m_$l>Px4^p_-IYGHPw{V4t
z#{+8nT-{YjD2MF+&yA=*;!?Zu5r(!Wad8jXj80QF-|22Jh&YXdOjretL`mx{HFgNd
z8|mfGSSh^3#gH;kfA+~wb!=3T0TpTn&DeHNihc?6;4xWjl!mpWuYC*n@ht@T@dP6u
znVu1;EBf(*L~YxDD`~~>KY=c?eYf<2vC4vSGxPEfhy+WYe*07}^VO(o`?3?^98TAx
zr5mophX7aGIwwK$T_vAdQgDzNDJvWLUmgg^fPy~&^7FXi7Y$KohsrHRg_F=<Lzp>i
zeel}Vd;VK$y-h<Zke}*e)+Z4MSGMRf4iHiB^?YiCy_Ld2#7Ld^6G$ekaLdu#-t!NJ
z^o1t5J+*~D^ul!6OJlm7@o~3<wix1&E$EU%jTp=AjHa@r!xN|Wvwj$8;^jy}f2P`6
z+mQe5?Wv*jMr{qW4`v(w@{gDJxOo<D8>x7HO5L>~|0T<4lpi2%GRRus_GvN4=SzCM
zLwqhT=a^xhzl&JQ2c0)bCc#~Guq!8AstnqbtU}N=MIN<Uv&C8$CE37>jlN^_Wd2!;
zN$&Z^vJ3T|wb=;`mQo2pZkuL6gmn`?e660#B_dRj8PEjA`YnTYZl%xnouLX#;<|8}
z%D=>Z)%6Bw<{=9r3lpb7-C6sAKj`rzr%*yH?l5kPv(a@va;8}E+RV8<fmo$y5!eO3
z;bCm-zof_cH7!tg)A?+XF)$%ZHFDlgYCv6eiNh2_j@Y_Tb01KLv~@b|wETq!m^4eI
z|NdW4;%3Y)a1w1iQE-3OknAwV`sjS<mVIytQZe{s+7oPCC2sv!wF`+(w)X>E%gv>2
zW^xSgu~XqLiCaf}X3wd@gHh6_JC?f)<#|Kc^&6=>p?u>^wGF^`G;8DDgq7PP?n5M1
zcH{as4Q<$oE{tHSj^->?AcvT|IZUt|9H!Cz$z|nN_c-YBOcY=p_{iNv52(lz7+rNn
zo>i+XNkpZQ(w7VInG+><$&UX7ce(o$O;$2*oep(CX%*`2O^OMAXg`E48Bn~G1_bOY
zd{$Z$sN2rfxO%Z2Ic>p-<Sc-B!Qn-!<}S86^=G8!leK&=7=lW^QpU>drS?qO2MJrG
z>A|E%-2D*%(T<+d42lHayeAl+yT3X6AVrDlK=Oo^A0UHtagjzW)!_@aF=FNp@<Q@!
zaR*v+pbN)0G96VY!p(>FnoBlbIy~}Rjj^}v^zbMn#J?0zIh^tjE<CDjPHrYCUjk6g
zpk>kn|M%L<*}rc4FQoDo@x11C75e_~>v=$|oMPFuO4@dFeZ_(+3yXuUl~Jyg>!~8z
zy*&)5Q?5QD>-Vw4Xt(88a4J+}lBU@E^vJt>^lK*yOwdrRDw#lzk7jWI4FF2`b73))
z_obCfaS?;@f<E^yGVukPnaz(_IyNq1OitSXg!SL6IlJT1mO`u43-GN_hZ1r&yn~Np
zCqBvIt^-U03+o!j#kFI_0*HEqx8rXSgOk!bSGY|xS6$?X<qPBqcw~0Fg$){?`eGy5
z{q+n8Ajgx@{V*%>-48yPuFK5Fd%R9~dGAWZ1-NUXWAfOXLwzONou@!kY%K`>SM@|#
zSNZ$u9MjHOw=`8tp?s}}RHzqWTD|KE6PHw*h$wYx!1HP?@|;jfOZ4p_34B!lxWzl3
zlwnbcBj|8u-%aD<sX@n?k}za8Ic^5hLnO%8Z=8peyuSM=$E%s|o}&pF)rym4Ff1B+
z{dOSamhSoTEI1Bp47MKOc|!<W1mM-fl4tpnfXkO_0lWK8V$lfj?zecQ)>MOA@AKOH
zqFsm>`nvxea5CI=L4D@S35sOkNNk3-e22a(7xcHdb)?_}aEHyT2IPQkZ!yr<R^NC1
zVQP1SNILB&76)d)aWKeYb%8*jJ9Vv&d1g<9{NP0=6Mx??3yA*HzHdyI{LAF8*F_52
z9MiuOw<6iNW#%~`PUbrA8=$|1)B~(mK9PMnWwdgUTYc0HB5R2SCzprW2OtooEI}1p
z;VFNgBLdXId3)8s%zkEa9a&C7t5kE0@ThLhaZPw37u)IE?)v7k6h*{<q;6Btt&P{Q
z-Lq$Pm$q-CDf&@`21{6uM!pUV^i3SQ_C_US3cfE@J3Ak{)p0_!TEfPb`C)7EnF@sQ
z^NtFKsAx(xsD8w&?-lsp9cbh+Y2LSo;DWCJq&%ZT8LDeYN<_&Q>^NvPWPXJHRXSsn
z$7gVEM7M++-JMJq!Tj=wY>#notpfZc)}A8&-M>VwQbzlL=RjVCP;~d5PecZhZRx~+
z6Jsd>t;nY;6`?7ZJ(o`J@q{2F((KI|OYP%c(DYxeyDHdZA^N!(cQya5!I3X>B8tP(
zYjxLg|Ek;9e#N%1sb&WL=F)X+^cqb)3Tj_73U5m!LnGdJ^2~kep5y8OKWzuGbKf7}
z8C|~XSQ-X<(!@N+U`(I#=vW_#egIYt=QUP*PPnV)@0ts%Iepr+TTr$2M~n>R5+Doi
zyw?f2ndS2}_TpS7*}R~av|1}lx1590F1A1Coj4xu2>1X|{n5+rJ=4)$=6P*@tkmCw
z{E;f-6eT5Y#06FzgzF`pZ|d`{y~*69)SZ9~=X0ZA8kBnikVklvCyhV(JL>XFgzUZ?
zk<8aS`8m-XYw{Md%`MOx?v*Wp#vc|EDe|6-<SEuT74M9OlhM+cH0DMnaX;Ik65iI}
zFFqe2B}b1IBrCx?><TMj`V`Lu|E^+Pezv8h5?s<df3D)aI{?=NdO!bzYjR=VkwRo|
zKbU)T<NI2yiRkBwH-jXb5}ng0bg!jt>A_F<*tNbbsiu_4vlmRwVE7sVs_;lY$!N8V
zyuddSK>2Ica(Yge=w#G8Ia_rC9nD`(n)ZE<^@XprN1)T3W5q<c!LZZr;WqrnNGft4
zjRmaphr&qQ_HBo)p27j|bzuK;#1g=mL!}*fU>09#v=$G8r-$@ZkAqt~&nLM#Wwsl8
z>?AM*xfT)F_DyP^zf&1p2ySvCrjyMaJ9B2p58235>W;EayTN4!2WOC5z4~wW9!CG^
zpWW7v4mds$GQQ?R6&tWA|I>LZ(wy&rQ5U-g$`ta<CzJ|Y&`jI)aIkzg*s^<go~FJW
zJwN)BZ29J~jL`M^LWTbUO6CPp6%d<w<FtonhAFp>a^Lp&)gbnh9I3XK(1anbxo4wv
zj4Li$(7Ih}WTIG_O4(#-?U9^fi2HIMa-E!>K@|g{kFu&ukueVM@K@oZ(N*#-u0Zi2
zKGoYpd;3&Ka_FU2&4p|Cgl@!}dt4#P`rAs9oc5+>eDLpJUG_CgSS8+rMplN|ClLne
zZ!k)UuC~fz58IXP$xttflm84iMi;qR9S$>;^B7`79+xDOp!4YHrkH<hc32qW%G=A7
zdoBb<cCG!$i`F^1GIdNDJ_u)vW+Vv4o~5kLsAD|Y-5rV(YFe?EQ)tM(&;VQ0bri$L
zKigxzjeg0r4_#P8UsPU^#Y{d>XXozNA964Gk#gHkPw5_RvFf#^?Alq%LqVNAVNN0@
zsr(-0_?z+*UF6lt<_KL%YgQSZ=V}n3TOUhnu6Q@nb9)Y3<Cu*Cef>)%HSMJPS|j;o
z8i!UsD4E$BOYWi^r5*R4Syo<qNe)?CMVXO$$Z?I50O8y=%*|h1s=;0N4fiocSDtR3
z$@O3AUV(M5lX&ti6|#zAz?f{T%BZUECKE1_?CnE1V4mhW4SW2%Gf9l6-Tgrcz-op4
z1F%~8=LYl8v2;r9ZM833hpWXi?_XaIn*-PWi@5bLM2ISkbL1;yQV-Z`oKMPs-ifnk
zrr5p5I%J+MB{BI+&6y8(@A&S?XccoYA+yW;^Ym8kgrFvq-%W~#++-7sNf38EH-07G
zGx)R67r*Drl8+Z(<Aer^L4k}#I*|&LQQB^GJsszFvi$YGp9+R0eZknNb(JxbE!FOy
zf*-i6?6?b+^#!#~hUG`&7C%6x%0v!P1Jga*Qnh`l-&ilw<F}b)8jtf5xKxwtYPQ!J
z7B)tiaqRHNAgv|rR557f3!LK0S-HRvw54&+bUNRAc^OblqgtVHj;U|v<Cfj?X5w_v
zMZtV?P<oxN;TwUHIaLhZK6wR>7rzFy5{HOMl5UbXf8VqX@bZIi^gLZ-9mZZu^M1xU
zeBomrBj+9}xqVzE&b8$!Pc7qv;4-0^pla=EDBAXG#^OPNt{d>E8n6A}a~@fCa)KK9
zuaIN<6X2UF|Js%EVykIFz++fsNbs3MDExy;p}}W<dPMNP$DHh`JvLck_phDheg+AX
z=3_j*BYzq-3g1e>U9uGVH51noEe3Z5<4q8fUD=S--PkX_jCYgJ`ORXnI?CNh*R}M(
z16{dWJ=-S0G{nvmPoB;o{W^*r%@T$)`S0_;t<2usz138`{qXJjRo189yg1H4t_w>G
zo>2adS)vAUg4Y?5&sq((_PYA8)hecYT-vdLsxYbGF4=n&0Qu4>u^(>6ZsS@AKerf7
zkl&XZkoBTYsoJjGIwl5;8!SW`eEiee<N;+DFx31`pX&ZJ?HK-)+~L9$(t>?L`9$iW
z=`2}+HWCh}>~)^hDGtiL<iZ>zmZu07rX_J~SW-X5*HwUwCsGx@8lro4uHVZ7+ft|8
zRgQcEs^0wu5Whhcg84)50q0fmp`~2-()46svQ-*0Mk$S<jkc(fYc+Cw43nDAI>Z4$
zqwD;v4|p#^^qT(@a1LC*x`R!*I?-pI=M{LLJkc%D*BoXSngz0k7Yax4NkuDM9l@bk
zw=bvfvQZ7cA7_p*+-X#L5*y9=f^lT+0+ZSh)-8(XreDPHOS5dh?}K`WwDJI31qb55
z@wPrhzp1|4Dt&ht-*WyC<*`zAN3ahRanJkSKn;tLa4$Pp6|!W_<i90QeyIx6eDz$T
z=~PCjLq+`LDw%q&(f5vFe^FCT2&#X!Mb6H8myOb13__D*cZUP+!kddJW%86{BGyu0
z1HX_IO`?e@%XBCX$}DGc9Bix_hS33CEl1?r%#3P`<wdZSY0C5Sf-kS)!rZ9b=Z~h8
zKD_bWWAT^g&1!Du1g)7hROWoA`5XbW7)$IOL;2mPwuYs5QvNKfJ&xI@JNwM!sRuUM
z4aBY;xY7X_ASag+a1I@QOD-Da+6dvg{;Lq^a&%#+2-A_J_ftKw)%1Z`(}*BzeLC%e
z7#f4LvAALQ1+hS&6Z<)x9l!qn3Gy=A2mqAY_=zVRuPPaDF+Tf8yTkvZGSk}iXx3i!
z&m)Isb$$=4&Bcu}XnC48<YUS|fn}AaQvv6ZA*e?Cj>c!j*w0yVHpLY##m&fTuA8VQ
zXr+5qzte;Jz6F>4{ydFJvvVk)HuSVm(>VA|EY%J{p323vA5XpeE3fF#^{aw^_Q_NC
zwEblhx|o+%88z)}QjJ=_$D_LhfkAuuTlxn6)hVp6vS+`f|G*0`icTAjEEfaNK9|_o
zgLmVy^S3o(P_a#erY@uWPYHEDD3d^cn7O*%lj)5`HM8aVgogIFkFnISmb*L9-rm!@
zq?+rLgnh{-rNcCT((A;e`7Bi+DhC>jx~NjrSK3+(A;(+247Nl>ejsWH4yZch$R}1*
zBwd63mD$wLT}3?*66nkCma}|Y(|`)x{u@?$VS-JjGO_|tXMGoxCDhA?Lx2`0@Ac#N
zLSG6+;HXI1!ROL$SKxK`{C>H|5lbVa%eIX?bYe~4YUT&GXlbk@Rmk^z`5)Tuv4hNi
z^JLstWl7i3qjL!pqUV1dvzfhX8MKvZWaEwldg<<M7X4A@0tZJL=QjkfEZMHII&r*k
zbBwvpAxbInSV=vao{za4G7wRIzouO*AMugNS}4%fBe=1Pa~Sz53#yH&20hm6e1RN}
zRerLHvYYqPB>Zk1trJ@WMBZ#3g7A(2XT{2}`Imq=FfB2JO`%Pk`H)n#5}m^jF0*9y
zK=^omBvZeuHytl6$6TKMeDb?yF5~Ked(-Lb^DP3tybo?dROcmbk$godOC1&uCi%%#
zj;}+6l8E)wU2UJ>QnazY{vhxDWAwIWBJ!$$=o2beA1qR!I0gwO!@TEMh@a;>uLQd0
zww<3PXvYPr(6S!Y+?GQmfkHo$R;M2#3#w!{WRh3ji?7RsJpv+3I3CMG`<Pfxi%HCH
zV)gr3fim~&u)ep5bB;^9W$fco9={>ESU0t=;U@~iLBu_4Ac1zRQ~W1Jxj4VS%+}-F
zehK#EneSaCwpN)-vjtpBj^dLc71a^}I=5Zo7~{`qWl@Q9RwYwZ!b=6bAH7SEZfX9O
zTn27Jc4={AglR3?Z}lT2ywrf2qKp=Wm1!M-#P}ApYZ)FikTKqMe`p-o=!JtkZQb4^
zd@0zxnuZ0x8<pJ1H-+p`vega5#V@%(eQ~s^j#Tfum#z?FQo?<rFb`zcIaZwc22k^^
z15c!Nf&Rpi@Ef)3tSc6#184bjgs;`e&EL#ze{2%~UiDH5w}8$kl&mV()(Zx7EsbV*
zl3rDa8ke_YfV>XDO5P|(#5q4p&0b5~MP#C-CFqjNSf@5-<_3gAz~IF?bg=Ap`V&;V
z^W-+Cgkl8&<)a`sulBob^utche_GiZPmDe(tfPM(Yq%niRNDVJr0Xk%+K=4#T;NM=
z`nk76g@ORfiI7!G^k{*jQAk|s-(dyXoFCk~B?QUXnIu^ChrjTA^i!ZS3R#vl#xdZ+
z?hr3Q>%?Q-n!*^du8H}o(K~{K#qJ3{ybjwrpoZx_cM4!)Fwy7D*Du&*8WI-ex0qh!
zOgWj<99?FTIrs#Im1K%9EsBhgW=QkGsn1T{HJ3(eO=jU3g{qn+5`a$0wYUzxFJP<T
z$W_@(LazcUo61E6clNufB=&0D=76QgqkppFII;>U!*#m(*jV*AqJ2v$!{Q-PX25CB
zQmsCpaqgT-fBwC}4|K}R*(Fg{2h#y%+=sYsL8fcwpQY^l%`T`dRry83nJi|f@#Snl
zsvLF;d&O9TadDQLlaC}2Q&knx1@x*yp*bY*<-`1J$7J{xI%lkwrA}-O)i#+AXMtVt
za&4N?;y=x_0O5#xSi~u6x&7z$f$XT0sb?3E?@nKz0G-r8U5#Xy{igg;TF6sJ!&tCt
z`j~0uZm5zOo3u`=)<BO1uYKmWJP2Mm6S&nh>$CIL$L?<GDr(rL+)$;z=d*!b+3ZFN
zEx74kcQCf6(vi5fN56H9>bnyAcK3Y?(LQsx3;VgVhJ^9nEuH%%4Lt^yS^xVtu$K7K
z!9fEQom-BNN)9Z}<aU)sod)HUd8%Dkdk&Y8iLrUr`bH9R4SvQm_+!<Em_Mn~zbi*=
zIO*m+SfnSov-9mIg9AN4f^vR1+om<3Shd3e9hu0#*aFR7Ma`7mg^3T7dtG~A`_iC_
z(bVK39Tj8&mS_QM`qdB=&16t(-;{Fr!QDwbHAZDw8911gh_q?1zdwoYj%%pRo9ruG
zI>fe1ym#w>B=>qC_BhmZz{dL`c;gYWjQ=%VY&cz*Qa+01MEg3tD-Lu`0r#H7Z_#mH
zVBuBMC@?fs==}-rFOjxn$~pz3?p&2UU0KEf?5xDLpMHh8a&rP*7D!Oxd^#@k1y{Qk
zc$ZnkY$>s!Kt`&nGg}K(gbsQN8^lQYk0jA8OJcw~Bm7O>s)IyQ)etll_s4}3cdTb<
zk%z6m^HCNzEK{jGe_g&C$=(?fm$K&HocVX;b0pnlq=G5KFcAWa2dSFQY7U(Pf6b2m
zuLbLo*-gf`j;HOG5<RN7zAx3kPcFPqKGZOiS}~0%&zd{_YV>Va)7QgbdF^~1euk9k
zmAc`zxGL7Duuohr9n*%ecKE$d5^@@C3xH4pjLIKhG&WZ_9`}lhjL{VVA&T8Ia#i(K
zP?APp!Dl%V+qj;tpp36cG~VIxc(0UgSqfXxI_r?!7g^dsnt(sjX_I#C${!AZXn{1T
zI#)HU4&w+<6Cu486KmQ9LOTNw>G2G1FULB#j>}*K<<B9~?5q><mF<Q_<95MYiK5P%
zxzDdNNo<R?OD?|_L65g`rh{{j5cA7U-#xpL5mlmeRyGh@j5I00)iGs~6&F@7TOuiO
z2tbAzYsXhd@>+~9I%?hx?xHA{4SgNEkHqiE7zZr3c6a+EnPP{&E-xXp3@scH<I52$
zS(X+384KZq+!N2d4n&SDJ<Y|gHEMd9zu2|3jr$v&m*DxUGpna&p>AlN)BDQSSs2|D
zIPNb3{y`fF&FSuwXyM_Ny4w%c&6~p>a?#*IE?Yrc-2%w#A|Um!S|P?#rN$?d<?e<<
zc4Z%x)il0(usS&KG0)W`98Jw;dQZc5f`3@k46Oo7BZ%h>cfY4X@x#VztOD7>yLJLw
z(py^AJJ79Ii^D1P!%(pL_!I#x-@tTgBExIElL3J9hBDvtTsw3IU$GvTFHlqowVz13
z>aLYucJnZe>@}4AG7w@m0O+|(d<Q072@f4tdq9`>K;*MAL6Ne4f1bI_7sXSQ>T!ML
zRxF4%jBokqr6Qx<4@@GB)3$!rZq{m2>Do3eg2s^PmcL!dr*9v3<6<9&7^vytZ<p_J
zx%T*FQRrJ<t?J%?4|=VEo{FGZAF6mbZOES`CpyS=(XX!&7eT;3`xT2uDvD5kU#Zog
z&Bf;JEpgEiupfa(M&D0=0)(=Ygnd82xaasn?Ib)%%KGH_kekT?QR*w<&F0~FWaK-1
zZViA3r316*1*REk%rA&T+W(Zx`xk*M+_v5gAPs6&+~50K1U1L{?eP8Mx1GTdR-uG$
zu)xx1Z_nB9sB>>&JJ!cs$_a9VzRTD|<CT1cqESp(th+p9`Yle8b6KbipH@WX_ux9p
zML&Uw(>uL(^}RfW5O<xW-Tmj;1ol99P_+DSR>yz#mS_|Gy?NxQB*hi4N)o}6dj9T;
zHrI8zBL&rRxHNz$<yQ6U97}q12v+o4u#ce_LF72i4tO;1>3$0u^CRRFnPoN`z?ipn
zeh{=LaCasy0luZ+?MyaBj;5#U$!cOB#-(c%L5HH<JaAHdYv<uxrCHhzYQ;gKAv;d^
zv^`?W46<cc>H!m1H&(+<uJ+7c1S^|^;<7*$rYHoymz}MCdDOE<wcJQ5UD@URsdM)^
zOm+5-Xq)oqzAw%_Ct=6}v6>e8Gnap#4v$^fMM<LUcUw8<(S?0~F2Ktcf#Wlb-J7W2
zJR@>A1>&%%_192_Uu}4n1eo*t)~8l$ENt4DB#xBT3;RzZYK|5+**rx5XDxS?_)3Gk
zO(N~MjM{gGoXvZ5dnjF*QZZ$sN`E@2v>tEmb>QE1bzXxBV$9{@{TI3A6kp2I@Gn?q
z@1KyZKZ|P&Zuh1JnvBN>D~9Z@1-yDNzH=uh_gD2Amctu9I)>~qR`;{tj<?-DzYq1V
zSkI8*4(#hm{LtO7eEq4{Ut~}Z$-mRtP!eo;*n?G`_n5hYvu@S;$R4s(D>&Gm?w;8*
z(}{9iUE7qMca>Cc`wp?%c$fFIW=BbKW4Pl>KN*L%{)==CO-(cyDpkDYbTuhhs`M)t
z6aU~~LMIh^hmJDM%2+mAot7|r<PW6Tf-3$r=IkUyTOealN2rQ*vl;>4TX&*`(TiM0
zp|HZ8dI=goVDr2C#sHp9AF(E15<i(T-yM71Z`S)-m)PTFf@A5pbF|8lIhq`j!6PK^
z4mS{i-AE2JYD%GHr8xyv%R<Oae+fRWOmof6l<B8r-dk!*-Ra1ycGd8+sa{)=mGaGi
zl4grf&3fdydK&V!`9*eE^+X!ydDn!V%Etmtnyf;e{lIoYE~&9^wid8B?L5eC7Lm)G
zugt3d3~nHg=^V~f!3x{Rw9m&=7L8kJidCQae)(tJ3kB2OXk3PuLtku@swPx{jHSQe
zy*A0n-O^nfTyQ}HeLYSO{632`K{KTbZQFeg@{5H0SmifbS4U^z-*XnNe8YaeQ!RR6
zZY!_y);||37^Un24T7nyEhkbCATc&{-QsYvZ0CQS&8u740Hlz>Tcv;kvx>l^i8i-_
z_J~=4qr}2`f@h7=^Y1VN23dKSCT^Yc7n)BIV$b<eN#j>jEYNE@z?Exs9&XLIa!*T(
z?Y1Uas$^-1V`-D`>~ww6sk!s4f;%4;tJmk=?FE<RM}MYI>Dx{{ODjKoq&AeHaJuj*
zCi8+rBLq<X9lFB3R5PzHXT?>~_!~9sIn^@9J|9~~H9TCtuyV;-n*dgA7;KToDn@Sh
zd#nK9Ctt&kd!4$59RVYUfQ^A+1`zQt1b0V?TAiGBT9)q0I?2YYF~x|P*z0}oY8t$W
zThvW(TEp5SyVKd(caG!1QaF)QyK9ZVUpH~Hr$Q7LbJP<4K2%tMx*)9s^ZuMiC+C}(
z0Xxd50)OX#?F?DZ`3@*->u6)0bl2_ch@`=h<(TLCh}*kr7WF0JJKxB?eX58}M)38d
zH1p#ip_PK>9g@WY;aP}JAg_vBY>xNSZQ1z()b_G`tMNtn>xkX#1==+bQ==)^LI6G0
zp#kw)&q{=V1V#OsaBXbRMO3Ip;cq^~<tLn8DucC)!C@6I>^ce}D}qxG*y>a{#vpj-
zA}`ZQ9*-T&lpn?S3#Cr)kygXwqcp>u3*hUjINjD<wJuPRF~b!)KXq6Xd1s8PH%i*O
zS)Tgw+??+m`L@&nG}2peg^uS?RU5X<uzQi|y+<`9>WZ6g16cab&8ap`1(<hWNpEo3
z3W)mr8S-Ni>#!Dh^Q&HxpHx6h)51y1WIA4n?ZdOZCv9&(0%;Z(F2R&4Y6;K%3dI(N
z5E?kzD~FP$K3~A-Z+TJB5$wO!4J)(R^}eN^BMzoLV$odIsKqPdSD~CLRvtkJHA2EP
zW!e%LP&6H}Y;7~b9;7^z0Zyt?BS#y}?jlKJ2&;5paJsJ?^#{t6{w>;IF)1XMnZD|j
zylBCzjbI))Rx(4p!%&a#vZ^!N#_=v?(yEdUOOXH`f4oGf(x;YpRU0KAib(<cAGE(W
z7TKdY&5+VnS4&{{Vuiw;2A7b*pqn7K204!_VBPoF*r{IaH=%$_E9fTB=5WyJyymFL
zsqhCaiAsa+5>@B9uP`~Io*{r5#cOH+{f+9bY?}kDRR?I57QE0m0q(h`%Y2E0oz@Lq
z8PC0++R}dV*u?cMHEEm`D_hlWn_ITp+FJ~-LN&Z#6}s$AT~b2kn+@dc#84%8k78%)
zI5iJ5XF_Ti8V}N_bIawv_xQjpH8%pcWG8#)gRJU8n`kt^JR%AT<^7avwu2i71m%}$
z!Rqmh83K|#&mz_mj`VPYH#No0zthS&{q{5lXs<Dms*`(vKBGIGS3O&iWsx`~i`R+)
z8sW0f4zPJq+{D%KTJf0j3&RjrFZ7e0={}GlA{h_$()}<q5Fl68o8~pzbyoMZRj58A
z4RY!{ts+UJCF}+T>v-?DI>Db{xK|uo=x>Q87LF}e!=Y7`A=lLdc^kvXP*yL)>wRK%
zMX%7(2c#;}_ocp3p{4UcDxCgITfdDbDB%%gu!r9xNbZ92EVdhCLPb?2PAYaeU70j*
ztIKagW^;XvKvZfsCGWH455SFl{fMjF^$RsEh@T_V{CuZP(ytwQ47OeE?IeyZy$e5H
zFdm|2sWV1EV8httrDE>U>g)#vK)~)V;TYsvzWe_0a<FSYSMD3}bBDu*aiJa5nRl69
zc@_yib1^nTK(5cF&j1?>ATJ{{=DjOfF)1@)09E{?x#l1EmQ))r?q{xqidqaAn#7>G
z8X-=MI&K39Yd6@=J=l9v(0dMc8twdYPN7(qOM2+flYckih$IHdy{St{pO1r|2+7qx
zjsTbNYg_Gwhz6e_APV7I<JuxMJR(c!oP;cq;H}pjXSnuM+STO$b3M*n3vTAtR|}o9
zQ3#>Dm*?`q2&|&?1Etiz_FPgGcp!?d9uEH#j9V%OWh+)-gG3^Y2FP++zI(Ax{69J^
zpK6wr0>(13?GyUc*6C+n|LQJYm4JwATS~C3^>1O$Z~I>X%s|B9H;Q3k<l<m)uAm1z
zj@}V_q7u^x%f+_V5gU;NJ}m^(;&doDGlKKuoxk@PR7V21(a(!x+4qDeBy9aj06MIV
ziGfDfA_Vu#mQe~C#|G-#!4$N(<%-9NF5H<0&a?pw)%)}NK50R+%TA{23N0O$stN^e
z6(CJ_A7-0<$?|^sE_n4?bNE+p`8#b^&-R3)Nq~ut^ee#Sw%Gvspq3V|dyj-TMi|b8
zgGL${<{wPeEy?_kJ#xPp51cs(7YBblPj+tDU`hCQd6BQ_c^xBWZ|X}$LUHdK1$aco
zJUPBB346t&Agept6a4>JI`43*|NsA2Lb58^D-Dvp9qUv=nUx~*5IJ=0V~-<Ak`=Ny
zp)yX!u^lU$V>{W~v7KWb$Km+B-k<O9AAfPVj&nJ$=kxKn-*314rmD{!sgnkQdb1XL
z1tQaz_}67@Y~tif1I^yRHSzEoGwR(~iU4;{!^fD~_eQLl{_ROd-z&PCv#28KMy93}
zjQ-$vx{>|SL6?~B6)O=qxnaP;?D(_0WPO~p#0Ig**<JkWbnKAw*OvpF>G0b)Tqf3o
za)YA2h7y}O7NkuNlmG4~aE8)ntSwvR5fM5{Pr~ad27b0J<Vb(0@-#64`UHuZcUpp<
zi+45;!D23HB~dDWdfpAr!Rbc>i?1UrP@AAbcN^*0h`vLHhDA#BTdhN$F~vjgZ2?bf
z`xKgeyWi35?CL4TO;Tb@6pnpq2g}WL7V|d^U&Z!%D&~{+^Rdo-Czk6oAH|ji)Iu{K
zBjv{J%Qqh!jvY)V`9>$qfeKLyX!3PXS(xN_RN?c&5$h8@%l~L2e{Wq=M_#7t1`y)o
zW0wX@Q7;=BFK7?qD>{!R;2Sb?1g@f%7ajpsd(5*vByl{?3I<T4v7D#Bjm)p36{1zR
zs8b&~JtB%nEk7gXQtVHsqg2*K!;mxgt*P$?*hp$1y4pB&>R9mPTUy#R&){hK41v?5
z4UVYzZ>Ywz)%`cXxALqFQ(s26^%L!UqC8J-(xAWk+zP<urBS2VvQq2cJB{SQmd8cK
z2B3CJp0thLdltf&H`BYcfdTj~7Ds<w=uXS-z|=+?R?9`rMpYZq8~E1UnSI>r6?6xH
zE-zO9qAS^!+~7kSk#f(Gug6p=x_aJ%H3gDKYY&Z?ToQ!Lilew0XSX9YN~e6=rVmti
zZcc>Gai8A@FVkm@JR9e4{4)!#f>@rUPeBIQYn_kZivC!%AZ|fsK>Q0ZLqwNVZh~mH
z2L|X*<;*VVqwkyhu4AV2lv@mP3`l!R#^gw(9o>2fejrvTd`~%DRj6i8NU6=D2>d+*
z=0z=VC8YYt2jrPcF;VMGy0ALNgDRbq_0g?vmWZ1pc&8JTn~(R0G#K7VOX29c+H%8T
z>jT%}2(-U*=eR0ytUJXyb6@*fKGeRL{RG9*aKE9gwu|13qn0k9tMD(hok3CY>*`;v
zb!=|T^um(JM(7Md;1HH{EcAzU^kzYY<>JM{L>kDXt$w9)*_}}3mazHqwZBYMBITx6
zp~)_(uc(}xu6KA3A)TxYQc{qw0^f3>8PSP6**8Z%jew>US?*E%?W+E6w(0i2$AF~^
zKOnX(hpnwO|C;#YQC4pw0#9EZVj>=rM%V(bRu}G<pzA%gl6<U(3ef*nFHf15r3adW
zr+(LXvW$#VR_X;$K?{GG7GQ-ZSMC3{==lxT2+@#KU6wiKQ$MYHWB#r|4z2l4jPjn%
z^^~!?pqxBfpwjz)+VD972;G36!Z8%%O!X!s#kRJ-(?OMH$)i|=Q?QKVXv$s-tK;<0
z0c>IGH{~RYxd*ci94SBLid>J>1LEK%%dTI($IOa9M~S<AAlH?}kI&cQ8G^CEd@ip-
zA+L75=iCP^o0-;F?P*n5O3-a%2F<H#_DfPBFh;uPC&jHW8>zOtMD~;DMiw&3WSiwn
zp`tH*VD`zHF+qJcJ!!^Zo+bHUNIkhksVT9q;?cnOh?AFIlE(sCF#fpo$T0DTK71{(
z###=!J7K7#&6~3h#{$ZM2c=#TVTDrw*oj;XF2GV?mpRY|D_gKq6!icvvj1-9!!G)#
zRLH|glPHXbLr{GF0eT`pR|OO4?L?;ffp=7}G=uV6dh&;mXJ7sVmQkL;A}V+-MY$f|
z9AqPqD$6aoILD^4Fg(f33DK}AJrmhgU<BK$9PoKtFH#}QTm7#z$j_Uggy=lM7AKa|
z#I+v-Cs87Jy7V5*)rKngn}0IfbO#vg7w;2z29`XL2%OVi*!Nnt!0i@GjFLn}Er&Mq
z2ekZPz1AUQ({+!5IcKK@w!jn?uiS+9zbPBxu#BbQs{rWL)V0>vfS^d+1p#2SnEI@D
zs&YMY#k@JhhWgV{n7+^t*resZCMHV}J;#9k{7kuEbXBv(GqXPUJW~ku>E2C=Q~n|B
z5gn3^SEM1@p?+^_WG=*P;oWuH1Wf^M0zni=-kudxw@GB6=27t}V_ZF~*InwL7aa>o
zl>4SL@N`O)7~Ad4qa-NHjI&;?EG6^6`w}Ls{u))cQRB~bV(NCk{rW_4kui`Xsj9w6
z`J&*E&CiwK9jTy~!XJ}OkoGU$DoO(hsy&UWZx!3op6obB_qtq}p-WG-sBOzehURe(
z{~YiP$xHLXPfErYL>AMWjMc23{75^6>$|i%+KVbOyOqGSlhACDt%4J2%QU77mYZv^
zPBxm3lmgM+R&S5IffjzNg4tNUir3?E6!#~HWC2EM3$SHG(m?LO3nr-=*3@<fOHwpT
z$y4=sH`is`tT*-Lr6af>e+mX_#@C0j6l0dgx!-hSsyuhyOT%P+8lM;KsUvoVAU`sK
z|Ler52RR7PeLp`h)6?>uKn?egoLzY7psly{Pt)_Xlum#>fFqzJR@G`cHe|Xa3?C#*
zHMeATE#bV2bnjT0p<)>4;cn15#w<t;PPX>iog-(qm|2kH=h)s~0{lDgD``zP`>B5n
zb4#znpkT^Glfv;NT8fm?T6g+{kes2dCkd&qjlZwzyV8G_KE;o{g!`UY49BUTztb*h
z#h#4UDj)Z*2Z>dZ+)DO3i%otkt(x8HyWKecu{w22)s!L^TyDn}S~nNqB&+ym&(Hlx
zr`C*<gvwi}j;e+rBX0!9SM_5x7yRG9{S}HK=am!BVzvsa&u;9X#yhs>V(s52n)Ri|
z-oVfSG&3#dl}8#`=3S}2C2}sRL({5768^cX`8pylD@sE6$(#5_kYc9`TBNWocTGZp
z0bO-(pLdMdt}sJ=_NfJH_mai+X2KA+aD$cve=L>x7wBJ))gK9s14VY5{R+Qj%~TVh
zTYziiR+4nxzUqVjHto?uP@G?gBm>n#!rP_MbxOnwx;<X-H6GDxkH%`McB$vQcj4M~
zwX!uYg3(6_O}}@&NC-)+2_D{M!jrFJwC)jEuZM7QK|iDZhYXOKZ2n=hgfe!sI;Rf$
zShwM0<M|EJYq@js;DL~QvqnaRbDF}FvsU%p=NXFWT#Uegg1hIh(4ToHW$&NKuzc2*
z-rH+=z0K8BfnrL3a5oR|Sys?@Thl<`<N49*cQ28^^R?)gS$SJ}N4nEFv6zamu!cdO
z+}^)ruS`r|A&^f%e56=XF03@Lw8E5IQs*6GZ3a6iY6Tubhb?VBoHdWLk$M57g!q<e
z!qe<?KejrSL!x~P?VHtDjLDk*Kio|dLd%SPVG<QGaP#a@zf=QQX*o=n84pEh(fT+!
zXSS*g(PWa;qoHAV(*+|k*yw)eND7d*Ep3i5sNZIvts>M9V#VEIKj!!j+(*_^2C<p<
z&=TpszRy9sswbwW$Ig2Lbavi%)N_}@v9rR;NdRjKa5M=EdN~5Hsh6)+v~nY?J8%4c
zyGTM1@5??VHV|j4Ed~uZ0>qTdxq;4x0<I_Xb5qr%F@juDDk6>fULkRY>TcjaHLf;)
zvl95DDbW(|+X~(Z9PSAmTJl{=hA&n>CjQLGTY&9bl?wiopMd40uk6Lrb3fA@EHeLB
z8HLQR-+9QdR}H(*!2tZ0JzJzFY$nfLuoFU7cM2kbY-K$3vp-TbWA}JB_!3<Mjvq7Y
zn0jR`Jlvh~HF9n0AwT8Y`+77V+#B1H`B8tgoG&oN*6~x+FXFobR8t~UwqbrD-`gku
z^%6+sj$dE<Dc472H_+%%T;=Ew&Jp8iP5*!_IqW)|@be5c&yqc!R10GKQ@O^(^RCng
zcUg)2Er<4l2)oaV5ad}rEYM<w{;Y8b0^3p#Hh?Ocy!}|(_S=7^Ifc!Cvg6$YVmm0z
zqOv&;c1Y4m1}zH^`%F9{2Yi;or1rikCjrHj@o<cG3Ir=b0Z18++@Gy))x|yCu-R^U
z^RWYgy-nl3e(B>K5$SHS#YCy?ONXYx3?8NeD$BGD)?*jq*;vE3Q`5avnz|3z{(wE9
zbd-{k!}v=}7E4cS*KQ#7F}#0It?&_m$gjh<!dy_nW_+*0_W3}>(~j(*QSbU<;+L$}
zcEkIG<2BaL3y@=T;54eZ&r;k#KSv1&y5}RN)?c`>Z6Kc;Z}SI`K#;D6o^M3Rxt-Ly
z*oXyO0t`9Ub}i@bJ8MrMW{YntkFlz;+Z|wNc6h#^!YSNHKERqeK)<`2V|2N9@Q-cV
zIa&vLB`Y8=-yDNjDEuIv{nsKE96toMV=>6V-w5d>_CjY(=+z2*V(eSEQ!4tC!v#+!
z(_A`}*ED)TMLkF{Ny*isU~IucC(#@r_mr2@Op0x^O53Rm14i*%e-$1e;o#Qhk{jUV
zA6ljAlMmnbd1OW?(GGlh<P5*OKeoMv4QN|kBk6zNf$rAB1@TQ1ir@S4*k@;Ye+KeL
zX3$3ipEysDmzVwt1B5T5Twl%5*SJg99b(H=!D0>acqL%}Qo{ec|AgOn7o=m)hJ5pZ
zU`~$|lZJ{AIz>+d8Rrgu9jUXORJLy(Z;9$V2fu)uLZ(18qhm$j0s`;LX=y(*mob$W
zML-0I#vgQ&?#TQc8YB^G%!I6R8_JmdyFge6vP~VssU_MKL<ol03{W!L`fAZMBHJ&r
z`-u4tzZm5SxHMq9o(1Jy_P)yp-J*wXvPLTBA~jgZrJ&B#l4erR+Ab@(+UV~4?JBJ}
zxg~pzO8jJu<#9UeV#kzt2>bzlvg|lH7Dg*0U(=R0GzUDp6^jNVt~v*Y6bkPJGyjRF
z7q79^JbT}8v^dm-`5GDb4Xzc?JfUUa{$=d+waw=j4bE>KqLsY)APl&vi<bV)q3@t_
zaTHiq2QNR+9%xdnt$Vj@-ZU`DZ|D7o#SaAa!VaGE%rq=>asfzfB;z55H*>7@l5{#J
zO@r5}s__rsu6-@>6@Gv&_<u>BdsR|E7JU1?+3eGj-_b{xUR;&^mpQj&vIYavcQF((
zpJoO|2GOs(XDPUYdHoQWssya@c(%xrTEu{GlL4Xs6f*T&iru@D6lKI~vFwwZHbrgl
z{bbW62CWKn-Jws90U5f3l`N@(`Q7hP+<np+Poh0GBuE1B334ed_r1{>l<R@pQOLIh
z{>i?oFqGvn&K@CQ&}&3f=?0wBynA7{EM>T-HUKMH!bOWPehbgp%~;O;Lz8{I^W?s7
zF4DiMP)B$;-o9bMab}Ol!_ON(`6MKXmP*H=M_k<n@cF58h^V@YpD<D3=nqhIxXO01
zW}ES@_sMR+TN9o27!pdGu)(9Q!#R%%2iL9&?!Vl1-m($tWDy4gy0rwe{cyxchKk9?
zdCf={^0lR1a7N`Sh{ld%9+hB^=rXmmy4j}0vQ{$xrEh6B%|9Fp01!?lm&~501va#=
zcw-vzrZwyIvv(R3@;xJ-LFzkT(I<CQ&(@QUd>et0a?&zz{{L+GEQbORVr0rl*$(v&
z8+v=<6}g_>C0tMy*(Hh*TXQnkT9+Kn23pw@Q#`;N4cpL<m=D0PBcf+DwqPRJg_eYJ
zYI_lh&GOaqJX%Y~@~O$GT75Ag&J2$JO>f%VPD}KE?h=92AadBhf1o6Chu@Bdgjy5A
zs0sSsjLuY<hv~F2*J=-ZqD?T2XvKb|nsWUds#L<wU@3`g<jGX?c0c9g_B569=mJc@
z&22sf;AZ<!hOxy4iH*t8phj@_0I!&d0;clb+)wi&8K_c{&h|Fex|r^Ga)g_nkJGu7
z31?Ef0|1>7i4H1MXs;pot}hcxytI2=M(iN@So5`q<Xry`DzuRte_%n;a6KxcV*)TH
zzKOjPf)}xrO~&rno@hNUbc67YfWm+$age8svHdWW;@Rs}l<m{|#7CSr+D`b}v8^sz
zv)#04j@{6$Q_VewBKIE~U_TIU2JlWJy?Qp&564<bmc`^ozAYkf-=%j4ASCKYTjXgA
z@TXV4he&&=be|n>C4I3XE)#)7QJ`L^sw@_v#!YLngfw#y=Rn{3>D>o>SRhlx&nX{(
z^pIDY3wVqSP1p;xY{v#`{k3id`ldX#{BhS0R-@dHuF$4CNBo;%6RR*Q0{MT+QlER~
z$Xr8%u2jeHb&f&qCl9oSO&7MjdKpZ`=du5)K@Gn$nn4bgU<~B8?2P#6FI}IGVl%m0
zXPDe_GqzV&)*%+@L`}oG)fE6%QnSs$7O+WbeCFWS6~)z2HjM812B_>tQMP~mE<%@3
zmHZkVO-)x_99S?<-rD(qU9c~HjC6{%h;z+T;tW{?B4tshULnsOGnb7hgA>kB8Rvr-
zv-MldhEd*OU0A^|X}s`{razvzx^cPs{D*l~6i@j;aEV5clh^*Mcixhg3`?p%x<Gd2
z2_r!ewPQ^-KPTHPS-#lTzTez9{}y$=zMCE6)|R-0eQ(*!qBWF4aUJu%<YQ#u{+Dbp
zlbwTi#Wo<V*&YXyoVjAboyB_RQTJ{f_l@1-SEq^%ZJx-$?N?8Gx9%WLFgfbEw8Y<M
zs7<uQ9v{7Uh321q2LdWkQDFuydx8|3S03d%NjFP?udMAk8M~IYWBD@StFq85OxNZ^
zKO*1ZM3l6}3-Fj2CNxkz?3gA*aKU3vbKQfS^5!xuW0zbzG~G)nckcMlJE=kJo2eoG
z@*a|#88tV@y)$1+rhS>EwPTSj47DuHok*fg&RE>)W3g#{ahdD-dXC}R!P(K#o^SA6
z{8CjJ7`?=L8KT?`&zg6)y*#E%8Bu~Wr8b9vI?)Ap+cb`_<%PWSMM1}vs-Pr*k=R$k
z?69D#N_cq{eRR19RqE9&cX*56Famj|Kajh0gD0MhCN7&V3pbx-YDnCeh`s8nyMSzm
zpJk+UPiYo@vogwU8lSs1V;}(^p@vNP92pzDHq(3Lkach^V4Fs(EY<|F!}oND?i5w;
ztp<FlFTccNxC-k9#(;m|L1#qjfd4S=0G;ZJCEeXfKu_6A`*WqIAg-JGRee=N=hKmW
zxY)S=-X%?7!N4wg`K-4H$oNZzG|bhB=&nq}Px0)B99E79@qQ(aRzS$6O~r2ft?CVz
z89NAAd0Fp<@12i)1B+X|Atclg_(-5;T_}h+V0sKwuCS%qoPNNs`7^X>+!B8ESU++?
zStFzyv0Y&Z2YdhP-D)M@I<V&9b8iNTMep49x4P0GPzX_8duHrqp?e@<t=74Y)qJ=A
z?fi|5oQ_FeM40YeU;^>GzZQKy;1<K^!sE5dKxw)wzEWWfy@!tm*4qP&j-pBQVBB-~
zvWdn3V%sy#<7X+&*z0$-en+sv72m_-=p7Q@%#&K|F!CK+TNLT_F=Xcwd@v-SD0MU2
zTe{<v_Pm!$T-47)s$QO<(Oz3@^_#LkS3uudAKR5k#!i5pG?)1&fqiQ#f6e{HCUCQT
zQ+imRSnkrMu4!1K{V_kzm9q5mJ*(Cy7r8UZJ9stO^|XI;zNkDmyZ0o%EN{C(Al&e_
z?Y~-9!UgV+L`ZSM{eke|0ndw{?z{Dq)cCQFA<B3<9(@Z9t(@fyj+4pSvS`cZVnLoC
z*L--ZaHx#^I-i>Pk>Ug58cfGPReG1Ha{h*0D8IYIu@{%;$8*_r?#B@SJ+6Pr3GLy4
z9-7+VqS(84pU<<rdIzzH{#_2eb$BxNWanZesE=C67^8-^y1F)#bmtg}O2*oC#4Wux
z9?D=?@n@JtsmdgFiDaeFJs721MV&@xn&KOZ4A=FNv5Vd0w-Lo;YCena`+M9$V_gK%
zd5HS2qFCP*tFD7(CdBR~2nMgN_JAbWr_9urHT~(Ny}?T=MTEC|k{!6Rs8#~6BR%rP
z$6|1enjzk`?5UbvSWI{lwafAYD^%wGqyp#f_1A^2VHv(+&@2+~K*`6sv~pyh%w5>$
zRGW)P_2%J*e|kbQ&C^0P&)82M3pL53>U`Lv#-$63>0k?YKH{Q4AkJ8&ufoL%=od7`
zvGrHky`W&#|NOZBd;WIwKa1WCDq~#R`*&}<WBbx$L&a#(;TSO16sz*}3#&x(b^Vg1
zjiG+=otZ3^I$&F&g@&+<F);aLV>g^-OiUn!#l8sPppsDMb{Vzu=S`$;F+kRcW#j9)
z`sU<UUx(9Z>aJ>VjK%EHm&<-ma<bzc>EX5EdFz+`wr#VL@xxd9|0M3$e>b-D(I>E%
z3#Ok|uJr_dfzfyfswJoEm%wM1Rt8FC7y>Kv_No20KW)l%+hi=NDDDDe->5=C<p7As
z3nArugRqz=B2!62IBdH?oeH5JvP6^R5X)J~=p^m|*t+>PS?2zlu&Ad$+^O#!QTcmA
zW_+V-YO5?BnLQn5qj;X=)3x8z@mtftvfo$pgba6n*-~utY{c#8^$NCJ>pUriYZ^IY
z0addz((|5)^tP`u+X;Z}nHE9B@{F3?Ruibp|26UKxMpK>%T`}$(h-%bMtXCwOf@34
z?eNYB!o*mhtCt{vzj)4I@ht8aAgwXY9<&j^<-vZ<irh(AAf1Wgc@Q!Frr<}_Z#<&b
zZvOUv(-0rStz>I)l#r$BxA<bN5bTtAqYt3tz*56hv99oNT7zR4EoJiY?9n{$jJ7mn
zZP<1j?;9QA;zU=eb^~;KCbOL>Y}Yw+xwr?tp*DWBVZ*DMB7v$Fjd&(6tk!nF_c0!|
zC1~L5aI6vU64upJsMTnBzFBgeG70LQ$SrhqAHVvCDK_l%QPI!#=oEWa;A2a<`Brs2
zUr6a1B1cErL^wuKFm>c|=Xa9nDazh@cSje{E%;6?#|3+ymNi2LE_F_Cvv%_I@3Y!V
zEmJ1H>R;T7HK(YBL^=Y@SYy{dhrS-ghaQRW=33&oO&w8o-s4HownpN=l}6W18t6}^
zXx}69kdMJ1Bn90Rhx<Z7x12FSKS;A^mlFEU+>I=JcR3_39{ogv*Pg83e-shB_JkUu
z94$CVBATA!02X9q`L$2hw|wqRitE)R<A_ulx7Of?msAG7ILOy8;aNX5C7wrzNfSC<
zxErf{l-7*Eej1knX&7gVFSlN25s)bD>lxm)T~Eqfoo4s%qUVH$kgx_S4msG|w!WdY
zya`&4{$F&8VAoQuciu%9BTb1g%X*_-ol=x(e^mx_T0C8v6_=X&FOtWCdfINbC>|O~
zRo&sEc`(^*miHOQCH~I)eeS`e0$I>xLV95ucxT_l#f$!Z#<b#kGG-M$u^PJ6jR|Qd
zypn8!>}}<n8<%hJsFlA(98uq&__gk?=D!MZ{SkLM7RvKuJ)ISgU40l9tUB1Wv!g$g
zhvoB0Nl582@!%l4|5jP{LoTl4OzYtbo2dB&Y;mIM(EQfUmI)nTmUf-oYtmJ`hbUUS
z(}ts81<j-&3oxSB%BU!<bMhPLQ&d>s2a%ZDQPb87$o_okJDIAaOsP7VyXn9p58;eE
z9m}W-tcL@vSth{9)DXuX=Qsys)Ux{}p9cMF{1994$L85GzQoWqlip%d4jJeq2xJzI
z3k<Pwkor>J$wFzrIUz+MhG^$5h)9WC@pomBfB#~RVa$hs?F++cK|>|L1j@{qPR&tc
z@!XcAXzjt^t>;P`s;kUfJBmGoh8_2)v!~I}1h^(YVV8Y^ZK=Bnxs=Y*2U}q57Yj=D
zQOAfr+@CZ{jIB8h-NpJs@KV3RD#NsuIB@!y2Km9UuOsQP;I+>{0Mh*}kb2<O+m|{4
zP5gw>B9c|n0W0rHH2C)?r^b-Ak8@Ixl9d?%*}cKEyu3jAN*n%Tp-)!?CoCSzDDe&i
zbDM4Jbd-#w-yN4it9LgT`6`{4XvF)9ZK2Eza^R4tg<{kK`73TVi{jL4^KBVhdW)8M
z#tXkw-Gc6)%?ymM?Y^`Sy?)j)Te1b$a*12U&YlP!6dR4`cKV91@2<zU8NLySe#!wr
z23zwiwK$i8{&S)LEUzbqi{CzVgUim|kWsMX^_0uz$>r29A>RGr(wOL*mc4a9Oaj(d
z>nch+&(Uoc!!`|vIW1}IlIKxn3nstV8CNnC{RdRS&I!i)R!4y<I<>dyEloLmKZBN8
ze3tvq3j1cfAvR5#;Bv~wuTZ)9TZ|ztajmeHRK#It-=iI>3E?!)@M?=*Uts0X1`_il
z{uXq~Cd|Z~9%QF3wTu*0evhVotqsu`hZt0v)oGb+<|5lgH0tKESD(O-HkD3Sx>|Z$
z@BEa*rTwGD`n7DnNj2e=LH}ho@l%t{{8iC5w7(+K#KwQO0qj*GQ9~`<;FYV@VGJPL
zc2*khfWWp3J5gSlsqvV`YYj%T44c0|@w!W{9>t*c&QB7Zr-;D_AlU&**dK`o8GaBk
zr!f$~DOED}gr8y5B_N2d7SNAOX38f+`W9H)A5gi%AvjTL^XVQ88t*;ySw>>(?;GQv
z$Q5UIY&y6HbHCI28juFjw(9!?EXIHTZU|5O4WpcdK6&+2wkm6`iOajv?Xx!WY#1z?
zk`J=fpoaH-ctjoJ5+hvNgPnzgJP)=P37~Y}A;=WJiNY}p`+yFHk6@E{Ui2EvkM3OE
ziaifZhty;!pGvf-XPQ_LXk|E@eD1TtEg~#?`cck}MhP-E;RTyN5o$}^ERFJ3-Z6VM
zu_QMY=9i@1p`M8A-)k2(zadD&YvCyAvf&tC{d5KPC7B75H-Mt_NXV4aX&YF^7Xu*r
zf7O4^PWq;;<~GJ*S~?ACeK+IM4`l7sAMi<MhCTJ5u2CCGSH-Mg78=jis$4m;xjI{U
zHL1AwS5@AezK%uar$N&XK33DhMr!DFknduAvpI)Duo=)8%c;B)=$8sr20^6e3Inof
zu1Me?Y@AoM(!ME|%5RW;etG0Fvx$l28|kxSV~IO=?j1}Dg}DzqUBtE23el)g+fD7V
z;B&Y7+&KWlm|s4PWG}D_XKv*lee%2ZVM2*y-@gGJ{(jQXdank;Db%8pq7L#inizcW
zn_B2k<ET5kpWu?JG*T>MbE8lHcF>eb9?%}lIE1<F?#%QbW&jwJe_>tIHFC<n!k!e$
zxOxy|p2?*G6qXO@mAMN+>n#rG&-+^-0FL&|M|${5Od(-r3Aycqz}xm+zUD6|wu)jj
zk|bR<9P)*)X84<Ls-F0-d<|2KrCmK}8gDR4;mW3I%Lh_6Z}R+?Pd_1l0p{%GW%;7`
zO&a4e3#l}Ev6L4E&A|Qee%EN))lGkzRdZ}e45=WdG;Y6PZBA&z-j8?f_!Xl>oZkU_
zu)uJRxw5VMS9c25?f{ZcP5X=YSQ*fKF4Rk;hhaFxTOkomHa35N`-b~QD}mG>KYK6)
z^&M`7aM#X{4u#dubB%)f^lzk>^il4Eh{+J?D>4&o>$gIlAHzb`pmwkIkyjXOpyRR!
z^94b|%IrLs9|L3fa0o51{*!%x6y(ZiyfE?S#~?<c@eWmHt1|`>>wRMsDWhW;GNO`^
zGG-TTvJl6scYfs{w|yO$PsJ~N{=8yx5mLv3t8WI5C7|V}2^lAq=ZBWzSU~ZNPaLvC
z*D>m)G{bZT8d&_iOX&GtT|$=7#`Bdd1Pz#2Oqmn~xi;$*va4F++6WNV6Vn_mqoZ6O
zEhUrQOUT!L9|~|Xe16eKufnl3`>$m=@2MU{a+S2!&ZSHIsr@J@zno5YdJ{PDx*M^(
zd|2O7h3m?4(mUzx2_?F@&;#?-+~|Yc(r#X_acwn0Z(238zA98CF^S2N8?Tp}*E_v7
z6DHMUyokaJ&9hCXSstT1xDDq~J_VZX^koCSk03={{K?kO;icA}A4ABA0<k6p7sOSJ
zDgN64g3jfb-0N;WDDvfWQbMk7Nu5+Y9)vwfAb&eMlJyhGLEiI+&quM!?F!()AAzz`
z5vU?}j!CG^lJT6Z#SG5__;ezG-p%LUEp8zo-d!?UZ8M7gy+i%&A?dpRR>kfag!9U6
zDuLspWr4ilv80IOkNf<3#B);dNzOCo6Agm~YS!b6mmx4qYY&76iBD#M^^>LlpcJAO
zH<>cf(wN?dJ<2Q?BQN28qpa9MP}ds0;wn(&ro1Y0bF{6lqQccGPNW=8;vP>?2cgl}
zmJLVN6Q4+l1SVJxz@D_u&%=&(_n+VPU8+ZtW$xfTrgHf)zio5-&zrZKp0ASPps&eR
zculc`&ic+X?SF<X*kQw?M5-bg($PsHj5H>i;Uz}jcyt72$Rv?vnOXX@4klH*qa6oA
z#HG!Rr1^(nGv|uiogUs6gXi~&*m5x6!O!|BPwL_?gRo9J3k?H!^(OC{!vnt=alaXS
z+SWQ^*@`I#`#Z2J#*I0q_|wRXO_U4gz&UB<U=7($Tss}pq8RT*N0OaZX~8W1rg858
z4O#cu?}?H1t*QB0W1w`N71-;o?*DIur+7#MfjRq69IyDlI+ehm|A?5SH#!yHi;Q{m
zf4O;y-g;ZAE@xGD@I*c4G0+#?r&tG-q-Y1TsfVi39;M39E!Xl`-@1z<D?#>u$jx8Q
zMH$7BZ=ImLcX){q$%Pw68F(y{PZxV;`$ZOUV16G|k~%TtUn=htLpSmg|BcpWw-~%?
zY?08gbULr4cD|yO=-cHQcydd|e%?SiZug2ouuOc7(5??IA-%g_eRi{KP8!-zWc1mY
zJexF&_9N_Kd^Ai<ZZ}oAoF)B(t!xFSjMAkft*Vw-?&f9HoBiR_XbhVIb-lMg{$ciV
zmw@%k0o`lLn{bhf-+hV@>w5*I35V<F{)#1|*5FU{HHBRCpJlirwl5|*?hDbVo#wwh
zKLJz~Jk`ux`21TZN5$)KCWQAJmDZ3X+rlr1?cu@FMk4@3W;|Fu{3J=!fR<_aw`r5=
zSF6%tq-Vcx^XC0Zk!Sj!*RX80^S7adKS|PD5=0mXS^l{X%?sU&hRvRT^P;KwkBEGF
zLqD?R{QQk)olT^6{?;%4huV*CIPPN5eu>*eP-g^vkz_knkQ2u#kK*lxgW?~s<pAb$
zG%FE<Uibi9f<Be-MBJ--XQvYg*@KZk&@MsQrtEu6z3i=1yaQf=cS%)vvGn%q3uaIG
zLTA>D6HeS_Y02aBds9Cd=oTP4h;0aZt_ZXIkxkxiU5Wtaa^&35`c)blrVHq^hE*<`
zFvj+n2m5Y^X6?QQM(DH!2fHcQz1=V9O6u5N1%*`M0k>^(j{th`*23;u(o3w}`fexK
zb0>C-tm)!kMAF{B)i7mJ+wZk}O<9#g1A9Gu_fwEo`ECY7cxKO8ZV>aGpBx=<n-5pX
z5x^b4U`E{>4auL?cjw=51ezO*fyu*-NH~+y3l;F(yR!CFtdegE6S%Y6*k|A&A69$s
z2REPa`=J-U!viqJRTNFoB_n)Tji-cA_mZiXEqL3J<|O$N*{0Zcd&Y?mm0(;@hUbCo
z_5yw8Z%Yra{B4$y8nik-?>zdG%X2Txvy%VI<u=<julj)93zG85hYo#CG4@fR1ynBe
zhV_Pp_jDEIaAq@bFkYVdAV)Rs>~^)UnL(bBmEiMW=X(dH3Ak=*<Jf>u`=}%Axc@mK
zHvxGauV>qs=x3j225M6yeC_gc3gM4pPjAd(wWaB%n4(d~m&T<H1Zt31`J{PzJ_efo
zaltuua}hEI2OMa3BxUxWA&r>fS0ggV2pOjVISKTQi97?Qt1Za{q-_*ls+-_3LtqGO
zNxV)mm7eJA2+`W6C`TROT%7Di7HZ_|QVGGrAR-2-YWw}Cn(E8oCZl5*Zb3Kug@=q`
z2<P3Du!i}dT7@SDvP1lUr7-!>*6w{+3RgqSjQJanp(434QMh#o?kQqB8#=ag9;k}X
zD-t5hfp;#jG>xh6y50AU?webpSCsH(sj=-===a-pwHs80gy{Ze8x8OyVAan1dR}_(
zv<WD$?5*_3d~caOcm1zHdr6AHg6^q1=m=8$RBYhstCIFhKXZvv1mx0`3atV7q;;&T
z%lUXxG!VE6O=Flci18rMG+kzv^ePMQK}P!Aj?`ly0jh_oFKqIPqbJL%BMs2<ggZEQ
z!hGz2ExwBpl4jrBsUg&(J37xm{*PrUnV0|i)9$~L^Vm~={O`I%_SNKfYtw1K|4vZk
z!;s6CVs~7AcB>a~6OMBi5u@qTEunNS8cnP)PsimNljBUvBwgk|!Me$ppEJv<_e+}!
znYZ%(dRJh$gSP9!<7uc|!KIq|@WK;)#odT4IUifC-nk@->CsWjYvQw2|2b3#=n<c^
z|9xq^+>kPuCo(0~W^tW1&Gx|@)`VrAY{XA(eqmC-(7UKxU9;$ZKu|H0YYu#N33<=(
zSDgOkhVQ%Ut#i-?<ZJNUt8;nIs5X*?Td%|HpjTq0_lPefyp%069O0RG5}N_d0eCXB
zoKXAwu<FcEK6nB$yg}C2U`Zj-|Am)kH)F^{hQ=Goa=o+XZ_iwPavcg^i_fS0i@xY^
zcwine-JPqP3^(N-9**4o<kPi0GCKD{uUK!X(HMP{q<>k8D?|U&U!>T$Y326Q@lI#^
z+}g9rq}e@N&j=Ig13GBntDx;84^645?!NVman#?7S$%8eohqjSOJLyCEhC|2eA*DL
z`hif|gH+v<tlyMKF|=Pe)eI1Eh`EQMqI~mgx-o7yA6!C26!~+&9l{}IhLq>oEs@O0
z7Q%dct?c(kkh+>O?n2=ZvO!p5taA4jxV-MsT)NNIaWyXB?7lFB{PTkV@{ixfB5WAH
z3A4C#Suxsn_>YUd&!PHe;!*BQ$LyO}lR+*X1kUwJAuma$vdh`f7k>KQvgmE>EW27?
zT|RQrTM=ivhl*Eak?D`Mt?n7Js)CSng}o*Z#l1=glx$VB2;T@{+6?S=_cLlcKZU8p
zz)Q++lP=aP6JSH#HcangWtZ$!fbI}I=Cp2|@FavYDBT);Upepp#*NRS#dOf;?ef_p
zhF={y$XJOy`M5W?HOjH3w)^w>E*VizcM;z!yc_DHpqCuiDh;yBJ1Mh<RFX@pYnQ|y
zRdBRp>+)LQKIoDCqE=CpZxH3iO!COAv}^G&`3riy{A_osx3y*XlWHq=XZW=5N!Gae
z2VptTiD^R_!nvBLtk-QCeWdPHqwBY<p$56y;Gd1WXG|m;kFgXIB&er8Bcoa}K4Tv)
zUHEknvy4@0d>r@4CwQzbyZY(@%JOU}a`C?1w~QM-7XHbdJXT#9A>RA0FEA0iXAk)7
zh<q(iSkIo{g!m7<ui0W}J~}5R+r_AS6)m=LI{LZ%;x4dw)WE?6w-O*z=ddfVSn`K~
zwz1kmIHLK*-GFVoaiJ~`(CCoP{G}UcuUODjh4-_Vt%6fzDO`~pLA)LWY8R4RfU)Sd
z(D(?*%!|8zcCf%nD))&7%{E}aqxKdiP*dbQjAajpLEAZHD=Zpt>&}<z9h+7L!wt1!
zK8=uUN`TGNty*B|3J@_hUgiQ}GrnQb^qP@i@O((zec6kmYFVMqaw$Sx!QuViIvOYO
z->g;JXL~;OviNWf#PPEj^nV|?$`+I3E$g@aoYwkTP(bVX`vX%qDM2o3K77J<`q|0&
z8$eFVtaR8q&n{0g^^vR<lJOm6wmGIx3lLL5KPB<4duJ8Gk6fSpNLXs*wzum2N3Qbe
z>Q}k$x%n2Z6vf?mv~u}$%Sr8}?u{k*r?7OxM(4M^^Vg-MMHvAv<m+v3;%d(~=8l@(
zF-UI^ZA0hpvmY|`3j&26BC>y849{fjF9NFB<DhLbglaJPBBXRdU`e5yWk>rxCI#a=
z<Lf|wWLl=Pxt`8m_u38lRam^Lyyex#H3_GALk<P-h`Sxjf$5tTc8Q>cM@kHzEotZc
zl^SvnW`~&T#JC#e=RoW9BQH<KWRKj%8WS`Bh0G1w4J_LVD}Pr`nX8Y!T~y!Nbw|N(
zyP@xbWY&tF!k$q{z;+g;btx+|66llM1!!EKbB({o|ND=|b?qDOt2VyghBfCw$Trvl
z+iGx;|Hs%+y|G=Mi2va&kqC<006i3TAo<Z)8z2%6uD|iU9K7#oEttw;;p<>PPzYbV
zMQ6Tw8F^^OUQ9>9a(kZCvmL7X5#ysjTDBxqC!S84q;vo~Nwrh2Hbdbdtl#%ADT?4S
zSp1?)p9x&IW<AeuxyR%B(OCzqG3w-KlsG-4^Q#+ROMccD!v8W^tFA9M8Y89)_yn|l
zy>mNV>-3w*(r}lQr1bT~W~lZ7Dx59gG6yyEeuB6C63Y5>rz0*Xqx|0|?=FH)Uf4Pr
zeeUx!3M;YT=+bZ$uV{6b=^#V#7H<45qKmgQCJDzV=ldW~%*RQo=2DG)#o{et|6F%|
z{Hsax$m>3RCoj>efPXBH8#g2p@_dk{fFFD+B$%AD$Qk=6qfPaNN>R!Z&A@{;@d-~T
z^O4t`dhrln{dtq73bD6~dP<?B_cWeNq^>nQl$QR=N@g=NNs%=A-H3gs#~6Gt58Sx!
z(EKL}`q%<Uf*gyyd|8}CwjCv|U5~iDMLIhZoq^XF{4pN-Yo`?Gv|6O~d@C=U7pqkl
zuYCx_S83<?G+Yvr3?(SU<)@55K8_<fKI7${x?0U+Am0;pnTnfc_Qfz(|JeQD>hiU7
z*S<Nm2sGPlRRG@(;3c;>ZuMG4&#Omyr(<*<A-YlxvNgWG;kQj-^KlaCSL)(>=)d7Z
zxCum&)S^6B*r2n=RozGntBcBV=eb81o(q9aIX2sSF^L_`>#U!!d(pfDIQ`O{@*`{t
zt~rUUWW65*6+4+MOHLaUnO9cH;2C%fnVJu}r}XFVl4!agZ-bHP4AfNb-0R)fyk6NF
zZ(vo{2GO5;F1=Y3$@A;MN=CMTvpp4|nBS;z6(&fIzdrU1>Ro$EZRtNyOJm%O%c(Q;
zcjqsUWzJJ$>_-LHvy)J<>AZV>tpkCa0JFtsyJ1fu#zlwT*|qz9y!Rzw;#l;$D!GmJ
zK1qPzW#vN*XHQH0QVcUNOw)P{`1Xu*9Rx>#{1asmHzZxpBL3k?>~E{ifgrF**H<6h
z!hEJr`JM7LB%_KtEAcn^k||DO=dxNY5kBmg(xE@^9wb(8%kQURMi$g@ebQCfSOxXj
zR`g8K{;v~Rf5Y8t)}$Kan}cicO?f=v7L9@f`Ds^=ZVXgx|4Gvvi_$doi$Yj5h_t(Q
zP`CaEVc?9JzJCO_3)vRhL#+p1*t^;Xc|GCV>1!iWAG0XyUDIO3c8020Qx4YP4R0#J
zC`-?c6e%m%c-hrTRKSmpjaCrLZkxMbK11*Cp(L*r;HwP+Lf`wW0EQELR2eZ3Ng1v^
z+(8Zu@0y6OJ7JVMsMunvAZZs1Qv$U1<_JpM<j~uYG`w*{1v7k_>!fjBAZRaDGn3g)
zmvNKmmUgjkc-O<M3*nSQaMD|F!c{JDUTvy+d)AitYYgPS%2OK=#q`>4FZ$?baCA3D
zy~X~Z!p;M|^pVii#hD8FqUPpc1Xyi@oq#d@W$*RNY#PrfXY3-+%{p&0eRN^J5}8~j
zJiC9s?~))PdPp61{cz=&>WU@zfv$Zjw2fUpod_ImVhk8X;nK9OH6L?ViDXqNeAcz%
zXP64!f$1<SrskahZ$I4@Sj<M#385}VrC#d%1{t*+5v?BtAvqMf%^DF*_f~)Gm+5e}
z)t0WjqX{)+so&{#JoWyZ^f+dQ<ZTLrdRw-`=H5Sfz})wf4k(V_C9SlFG=;CU=k>#c
zPS(OZoJtq3>btxoq0+6naN8P!_3_lV_h1zPRfBKMF;m6^wkk0wNN=fGNTHmMDVN^`
zCrdNacAX?2+<e*Gb&RLffQjGO^VQbsY)+i16F^5n1y!CN8$|Z}P|7%2G}oC?P`O6&
z;om=g&cca0w?8G~CmrQ<l=)O^m&$T%qn~{a+)T*QWJ?<{XohK6`qGf5F7|q$r|^?%
zU!Tb+2s3-xAS8U8npxlOwoOBR=ul-s=KjM~{Fn4IzTF~7phU3d>@f)^)QDeW)&5w!
zOEz6@)j#a-R*s>}&Lc!TW+O(fOI)>kH-oG_aQ-EtHdeUQP_3?-*$44(=1Fa0ka($j
ziaNm3P?-Ki%LWW5^zVHKoshL%b;~jJ2zEp$C>?frAcuVF-H}qpzk-|@VqXj+NkB@M
zkx@3?6dw;??l-2w%$$wSzA60RTXgpE1e|b<yVWfP704~sPfbP^K{>Mz@ndD6fy;0v
z&WSV1tlC#lVLA~Yq@U)kl6CRnmE(0yFqt)d;mT7FQIKWqN8~-7t+ZA5vzVS_Cyc2I
z(e}@-Fb@lFWD6%-!1iD80p2;d7v$S@5ABt0(V{$;>JfmEi{l=fbVnqd@?uET5N=z-
zlTLUbTnNXoS&TZ6-{sw5pH@Kfea51ChSJiBvx-7As+o+Cf&(Df9X;>|7^sj~<qv7J
z2W+<lRs=?rgP!7|tM=6=IseyN!|PmYo<9#NPMGY|%nj3MTzRD-OlP;9k)eqc777&c
z$?d5g?o)TeOtEC;l($=n7%28f?*a<;s6$+z(J<1Yhhfp2UdvV#XCBdX<fh-Y5BJdz
z2@8mIdK9!aMNR3$DZ&y?GE=zzF$@iL*XOY>B111uT3?Pb?F=^pej+7rc7F8B*}`<v
z3F=^VaOLW0_+mib3bGN(H+h@;1?g)0ysDsz?K{qu(fS#t^2j)ZnD2^{*r~%PO9^OT
zlQJ8&nisY~=WzjAvWN`C8xuWU2*&X3!$7SVzD6E=)xH*DJG3C%_X4o-ZdcbNzT@|U
zjD?WaK82Y(_p7em5n&chtN<?}OHeMLvLtt0hALx_7(=6GhmR0MfXCTy5$U9Yyqb2A
z_tsa#-h6k&vTA!_+w4%<KDZ;(A@azlPVgsuaM}|huzTu0etADxy|^$tv)Sew#ziX0
zYZqm9v>H(+Q|AU0^4GL~Z$0gyM99@d@JB4SnLe}+886e@BN%AS?qBTDJtdR&G+RPI
z0a@|lAz|sqDRK3cZuU`pQ6>l2MICq$JkN1JP>kG-jnlHs98pf0K1fe|hI}1ls!e|@
z-pwoXjIc4*|6?;I&?7|1um7vD%dL!T!@!iN*=86ULKo8|S<ZZDD_i+N`d~8qd}!?i
zzTP#Fl7GnenGZ4dxHp}A{+yFExonXJYf_3L9{t0W^!!!-?3QR-YM7q75g?9J`OEov
zKW{_<I&=)q#qtSlZd_XepO|mL*ftwaLv5u`)f3%4GLr%v4#tbO+Fl7I40N~vXrdT!
zs&aC$^O$0Nk}$-7u&GfRym2{-hFGerVp|tt;0MDzV+v}D5jPAH;|gtSAbe~3Bh|az
zEz$5R^!)VkY)l5U>0lDyo_$sJ^ywQ<sQfr!ksy4&q<M!(#CqlL^U_xA{SxV0=F3)q
zp-(UHlUC;0o_N}IXW1A8VM@#*^Nk##)M%#D3wU^I(|@HwDghuwZ2Ok`KM<PsciesL
z1P6%^UM98;nOQk=Mw#^I=|uvWR19Ezg{k=H+L1cuuqR3hWA{MeH$#J$Y(WLroHHK~
z*=PvNQ-nmhfcv{c0TVMedVE|_?R(#ogfqWA^;P|;BYu9o^d1b>?2uVv9h{feqa3%n
zdVF~imO(?YZ}q<0lvwXIUJ_a%HLe<(N@W>g>`LPw<E2JDS1*k>ojbMxtU{t0aMRD|
zL~oVGHd6E&tC#Rx89<1wkJ(A#L737vj1T>#neYtSgNOmegLoazcv8|g9a1A(AZCT>
z{11^ShS{a~Cg#aJH#KA@SYdpTf5M`s8Yqfl1T@u8FTk|(o0#2a#4!qllq@D@lZ}hO
z3gWc&?!IHr?$i8Ic}wn$ZUip0BcL^*;wxG{%7kkcpYhICr)K1B)83Q3<ajg2K<Ag^
zC#FZU-FX*qY5AiPr{8e766R#oxpva{20RF+FS$e|qw=M%6V>HZHJ*_UKX0E%nNehD
zdsunTq~PhV^A7i00X9}aG*b`fn?Lp~m}g-e(Nh@zzX0K_TKx=Vs6>sct{ixT%>mK!
z|8xK2zmI}RQr$f+!{C))5wn}TL|3%(Iz^9)n5tg#?Ok6D@eVVn&#3*TvYdRtywJu!
z&5|V38yjZ+%u)*$c>6C{$>$3Y{b2dY6rO9NB95!|i}5`vw##kQk^ZR9f#VC>z8i8C
zp*;R#07c+i0k&ZFj&4nT7pf2Wy9XYnmGb?%Bi;;xEDPuq{j7BzUh?HBz5pR_Wfbl+
z#EhDDoQ(xIEw=$q4(&Ix8N{bSPTFCSVWFkRp4{I0u`G%U`jc&YHs0ugmFXcoO2A;N
zDU05Mi!bE%+$Zt8NNGD3Ku{)~m9KN>ymvBu5t#tAYr<aEjJHUlDDwhJ;@E<i)>ic%
z^#T`t6Wk&zgA<MqkIIw#9+Mf#GqT(LFYh1jTbe%FWf+vUvQ@Q??0+TrEbH|;A0wpM
zKfpRGk0+KGZ~$n1{(pbLA@J!=(;IqOKlZy9-7T6W9m8{dnv9tn8En8;k?r(u@=9OD
zEK^?qE8d|5iONEMceMh;JZ8)KUo7=Z3J(a}J-sKE^MFnD=MZyHSrdR`1TqG92$Q2G
zX13-^-pP+$+8w`$=Fw*P@CZ_{&=#FLg~iF?<vT(C{7YNcEXj{-Bq!9dUYVh@SDPx$
zmtW=@&_luUo0fdg5LDf#JKQjUT$EX-^tE^;yi?O`7r^1$zxj&3re^~3Toi6P8hzZa
zw+tQYeN!}yMZ>7D%?dMvG~;8Na$14CyKZo;ovELoV*!I2weVGF@fniX3Kse<#YFMR
zi}&)|({wrfz6p?)&dV~?3Pa5@>en)QVjmkj&j+}5gJ~rqK4#@v?$qyEQ2T5*E4%Yp
zkfs+~xj5e3Z(^H%A8aPJVALThCVoilc3hi|Rmfbd$N*kmNKlrUV&9(3ga{BiPhiy(
z^fzq!yx%x4th-9IN?FtddCHXrj9|{6dkM-j0B1?_?zpU{001pJ+~DHN%B@S9e9C1S
zv9!iS_n|Bkl^)LpkwUfD{Qk16YaDLY$1o~>4L@Jl&mcOKKpO<sPO>&oTeEQJG1owr
z^tDhyd{^@GpX<n+qA=%D_(Ik~(N8WpEl9ocgCUX;p`_rsP<09RsGSo;oM?=902P+=
zmF&Usr`hYxx6IEJloc5ePH|^LU#V|Uu<2H_Bb~-3Cl`&4yM~!77S*1|WNyZ0$(YxQ
zpTP0!y2lQU6kc_XUhtvtAmqxFT!R0><Xrr-a?j9+<2&w%*7SzTN0yWGDjrKu>ENsg
zCsPt)UF>J0%N00lqrCSyRt)U7@M7Rsq{bOqy8dU2ESk7me+DwzhAX<Hfu$o$L<S<@
zV&um{bIbNY%Y9)9mh>X9Tr*bg7gn@kz6iogE)a9rbEx!zDWG_5bno7npx?dTIBuO4
zuMv2oe70CL*qZ;dr82v!nUjh~^4KR-<Kg58r}sL_pOLrMBTJuyG8zBy{6Dxl4-n$>
z%kN4QBU9MZE@Y_C=&?QVwqPZJjPAzm=J9Gyg;R>Sxni3k<ehwmIi1>%D$AikUl0di
z>W#L*e;q+%A@s8gcSMlmR?fvAAVo?iZx+??s>`Dn`e6Ah{5{umDB3ua*L?2Zin;>R
z*H#iMT!aF3OSa!P&2&04Ck{C=61H~^RxSmJ)lI_X!sX)8rC!vhlVYkP*MjQt&y;aL
zr+*ej+ZpJ*BYZN{YC{Hg=cojAL+w={cv!uM!x(yks-h4c-P8F4^QcI1&@`s)P0TZK
zQ3m8&K({y#M8v3qN=^j9Czp&Qk)dbb6HY$oB&K29Uf{Be5{L)ah%LWTfHD<BYt_Qp
z%b<50{@Y#b{0P;`7b8kqd*5o0==nAaaL!}PeXtOonbB$01Xjm}COo$45kz12@(E~V
zi#G(plycWq+If1!9q=;4km+Ij!_6kP1tZmN=GX?W%Yl7$J4?FnK5(fLYe=y3`^xeE
z{lx(iPMlLWK*Hh5CR};yXXT>GYR`h?iA!jY|D&d&#j-lqqfS}Kb4^~&+3FsGv1r=n
zfe{s>ubrpXkR`>zkJNnc2tBu66|3pI8}j}Yjk3*s3)1ca+{*ZCipv=Lw;q>1DErjm
zy8Y)zoi!qx@_tT5rNehSqa2&061+W|RL<H@=GT+n@GJW{4Tj@aUOB6UDRZ!|w&r0m
z>&xNgUW&Ymj}1D?^RQkAokK(T^-)8=H;F4`^UbZmKsi+^50h5mLGGvQJGaO-^6wZH
zkR=G)rM~J-(FcFj68nf-dGWfv)9o$y2d+~x%_H^g{tDWtFH|uGm9#j5{0r)Y<}O88
zuc6XOevY&LN4gfEI}!mafU|EP`~`97Qj9}FSb+O<ZjQ*`+NIvrR^>-Q+sVhugQ-eq
zxkYp~_J`OL4*TN_LQUPC#Zv$1JnSUqm((fhk+*gtGx!ZKN&`aMQ2`&q!A`9zKe9Rh
zA4%sP&h-Dk@sEVcsS<L|r=oJo+03C*R8B=XW>e&}95UybW30$2IW~kOIV>@9oI}pc
zAuMy4^PD%#VK)5UpYQKam&<iA?>+Z=-Ou}e+{8f`=Jbu6>{VNWrD|~94w2W{`NQ~4
zF1<mS2g7#(8Q*x4I(R>fRt?6S(o5xv34N$S%M4Z3;6+h1QnXo)r>LKAQ2v$SDHvd#
zMrk!s5sMdJp^7h_z!Lz;XtB@Opu>iqF!NBZHAideR~BG>PJdV$j_J?k=(Is$p~hAS
zs?8i%if40zawpa@#acMPU5{h*2IjQM=LaxT4>+0U&!%_jT6o#8CdT?#^#r|D*Cx{d
z6}rSiWg$s=p%7k}$?1*xm050u&5V*}J*oWPU5nQ}$mavjL`!&o*`?vtbNBd_<R!43
z^l*s=<sKL1W1=Jt6y4}|GW#Lg;O7;BQh~rPerH4;vdPnS^W1CL1WX#1Q&ZS8xLsOS
zFIcbQQ-V17q??@hbOktJakYT=<PSB)O}n$H1TIXWX6yZJGgYC{zk30Wo(h;+T^I7?
z8H`+xFq1O)V@;Bp!Bt;XIZYMM(fpjm)d_`d;yQS1QriFF3E-pJ6f<qyQl?fG4W(#<
z>=0Y4Mc?@2@RuQsI3&<<uEFzPldaj!zknU;mF4)Bl-qZ|-4pk7FTCofVATRY9b2_$
z{DW~1SdQ(#qN`(22+(^TBybU&pJ~*#kDr^yCde;Q#9I0rR2R%N$(-2{i+oF83M6ds
zA-R|+UBxCJb`9v)?Kt27dh{@eZTWfXATQg2&CgVWarhRgRS~q;e#pPoFF9vs1*)(?
z!Nj^TQSk5BkAZ%v70^JOWj+c1Wr(i7xHo%g{V?e3t(~~K5IcYcG}VD+bhvHBzrs`Y
zwEzHkz#wlCxp*WCfG)FVtAAHS9I{%zRS#JIoPFOliDyp!Nl0n1N!x3_{z(9Z9Z*{7
z0Vfm-da_^cS>j?QMiQ&P7^ITnnv4R_A~W$hj!RbgBQ(~MI_L=s0A(F;BG+fvHDY8h
z*L%vK5AQhNm*0OR4omj01_FVGtf=chy}G^xUGr-!!>*#?aK-QHM|zpsn*J&WM4Q>o
z$E-Iwyee%ak?x7f<(+<Q>PTTvBJWG*k6&*6*JJYh1PhRu#rn<Mb1tl;Z}*t#OJ148
z$Zf-_b^FGTJQZvbJ!7T`d){tgF}TPO6Q$Ltkoacc0&s_u5zNn_6C8<R)<R62{6tGF
zpH=i*&eBPsH_>JTBQ_0lq*knyKV;KGNXzlyAH(&1ThlLP4%c!xNnQ83&-+Re>&`l{
zj8bileO&9>Y1!77BEGiUECzV<fc7d~r2QQivGK>}jHh4Byc3;#-V1xKW6)Kh<~#(T
zaj67>gJSnQ7LxCCg(3gm5WIB5#MuA~z{%fF-q(fI+yhU4y0}eTLc883om6=Fcx9;<
z6UCt{3!kJukYU_4)LDFU9r8RTfwe4Q1|#NpHqSYxB?}{i1Wugs`hvXW(w_I93j+0@
zW7ES;qOvYsF`oyqRG8ZAzcKajyWel-|F{*JgX~>W-<F&K>F-jik6@ogzF!T6cEjf(
zU<pg@Tlr-1uWNk!Fv>o3t{L)eZ4d$ZG?9`Pl8d*a&#X;&UpV#RVn9Lml|Ko<Ge3AI
z&A{bc_TgM{)Y+R^f8}+7P*eTRx@_QyHgDB>CJS%P%(-RS<KbU}BR5$aswC#0YrvX?
zt^Ne)e85B@ZBx1dv$!UlBgnn=*mu*$|EEVZ58o2j=kTTY%E4Sn4&FJzG<@S@gkI56
z2Q+GC)f(BK;P@g|-1p@RRBm0zz_VD&YZ9{GJ~U?mt*Xlqhtkyvdl#vRBAGtZfmTC4
z@0kvt3Egx0>N~~>wx0<tE^8blhI~6tx%EEg>K@|IWE$kVXcN%s+jM1Yucf1y;K>;4
zI@~D<>Yq*tdP{jpjR-DHFS<N)fbJEGP8FJmDWJ{Evwx?)-kqO^nQrBg8$+MA5@zO4
z+@ah2+%~7gA}W)cIRQ(o`0SO~O0@(}73VTLBKe2;tsWz%sKvF60hlxro}7VcPM2%7
zJ-dX><X;NWTpq4a0&s!?y9Rd|Boh|#tsGIiV2fof*dQ!f+*gT^uxzT8-hW&SXqUD>
z|HC9ypS<{f?6^I%MqSi-$fS5z0h;}BE9Q!!b<bv{5$PJ0G5;mSbG{cqrR04w1tVnE
zC=UV^XnO&I3qhjU=@CE3O@!1l?8za)0W#_{JoZ#<IfI%-+P90pZMB7EQRx0#{Y)>S
zabO8!M-7INkO~>M?Jgo@=5>0{q@5lOXLmjIEG*@yB=<_O$^gl-NI*mCKmoec<?NLG
zG&hyBhn|ylH1Qg>aIIgQj3rwou!e?tQblDp+4&aMyd=7r-RK-USQ6WLbb{m>A3K!M
zou<oJyl~jiOel*@l|YM%*Z37!Ad<kk8yYnqz@ft}f&%V^h-@*wi7%(In!gmrhSvs{
zCXVY)>W<z?aNQ4`$@$aV75iCCjhWbS6s_nTg8v>Q=i{0YB{C<Cb1&YUC)^faExKJ^
zsztZr)FRIgx&)|rCy2K&-6kk<4Jl)|ffsMKbcdj}P2yrD`Mtxwr&eEYW7C-NRmxs(
znDHFW&S9%J|AUV{HVOkiYeR>+4G9~tDfuv)>jjB_Lol$?Lx}QrhCO?d-IKVw6t}wN
z{GRV4$vVWru;TV(o192?_pK&z*v_hG%?wQQrL_j!aR!6T7YX_v6(3kyZdwvp`i<c?
ztGh85tL6A~OL3WzHwV7o<uO{5PKeKHe6XnXIp>?cf-!In)VAqzKZ<bGy1H*MfBi}2
zGGES&&q{2dyS0CD2iQXCn;FcV34=pE37z`!bErZCz5Ql(h4S`;@{dl+U|>fG`B|&-
z8uc1i>fVJTqCiHo338!fbV>V6$hyTYY;=*XGan2X&u9ABWD_qX?>%^bSUH+W(3h!Q
zB;_2;kJkK{43=(wkM*QgiB&~W2_H(C%6zwhwm~O@aKT&c`aY{QR3Us*K2HLFc6@#@
z|28p0Q)fTHt2#*ipwVrz7pm&!+Xr*-KudR?2J#r_*J`fRZbNSg&0}J(h_{<>7Mxu(
zsvVv?CcMzsFqZ&OFH_FG313PPuqgswc3tZ<^+ku-0G5bz*DABrd#r|GgK7pjhsC-;
z;@wE~1+mIIKY9u~fh@H`%t-QDnMy2<K>9e5?kzhr9zT07;|Fx3nJ`;9XOkAMay;6&
z(Ia5H5;>Bk;jD6mmHU!qiBqU0ZIryL-TYG|;^{^PkS$vFQ=Q7E<U_4Vo!T6D*P+!v
z-#kN?`%N8YpdwzDW|=w5`Hd;fcJHh)hu2F@*Dd6OqLhBIDIWBNyaAU4p(=n5Eqw!#
z`*IZ{0jdfs*rDmcguss)s`&b8{iJdEdUN}Cab6qVOE3kxi}#tK9~x-X#i6Vp7Dc?S
zo+8<w5pPi?!74|=#^s}9dUIC6Nij#FFFLxc0)!2<<})H6{H=aqd~oHWR(!#c=<?*I
zVv}jmD&DG_w0F;Wf6Lu>6Z2H!{gfEv)83;ljHvr1>{lMt&_Tj5jBnjF?|NjU<Fd~Q
zaqnwi`$T&evUYP2dmUpne}U`lEuX7~U#<lnw+T0mf-m16G!(q_>Na$W0+&136ZwR2
z*JJQd=L<mCCKzfTYKyrU$P20oXMxD{{p(*7Vacd<5XN?5;*x`PHpTt3@m{}L%ZZe+
z7yf5HYU5Ia^QRweaJAf)x})k`-vr|f!Lt<7!+39Uh4xz2!}#!{SIj9-Qj^L72vHZc
z+opRdMSM&Mv8bJ`Uh%Q!927}tBuU#;OHw>$&ftjx5XQ7ShqFy^^El9>rwW0K9v1_<
zJc<i!*pM^OLFo7tgflypV~lKU<K=uz3~-nAkw$h^-$GQHb7r5=mQjlHL@w<3sgIrw
za32qh9vk2-_}M1f`zWMy+O=j!?<(e_Qb6A8535!E@e$+J^B<r3A2d#5?X)f){Il7q
z?b`@zaDa#NnyLLfl6}RaJ1<H`91ZmG)K9sFlBCb;I;xbn(97iU+Pi<gVfPqOUtbO3
z(r}pkWz%I?mzKj6VQmWsc*ep~<~j)Ta~AXEZVJp9!1gW59u90}KXd+v0-@h$-iYBZ
z(h|INs$9ixoKj9(&sFD8T{IAH%XqIk2A#%wb!mpUzFRbChw)CSP>If<fD@Q3JVVUh
ze)u2cRT!myi>0wI^ldgHezYe*&RXAb`a;I%(@>Lnf(bK!^A36h&C7?*<-{N<ZwT3c
zkH`7u3F65R4z2Wijdy&+2MK;buI@8`jH*`8XmO0t33*920R<n?UD+jqnyv0RO{?-+
zwKXwa_3v$SyFPbV_KjT!UyKcP&+zmvMMhTJg+rc9W7{OYGEuJfn#vi3qs6Ir;y>|0
zEe(7D?&Ni<7&6RL<{Kv)1eQ?2+W=OrIl+89jg5TP{dnVgCC9~ds-A~n&a;5zGYOx^
z`W+j5wlhe4xXOjh>luVB)ccNOt-xwN%KdOcPzjHq-uz1`v{No-GJrWQvyehe3@UIz
zs~^sN?sq(N$TR(O)1yuM@w^Af;rf#AQVWdW6YVx;d2W&-f;r4zoA@C5pZ&NXK->@T
zes7(d$crJy{R)dcs~nw?N;|fh`^tHLLz}RWrPm8feifUh^m&1GW7uU8ds;ekMKT|G
zt<Yo|B|CLxKdygqBjr$iPK`69WzZIwfUknEwEUc%2~MOOC|0^a{Lu<@7atJ)5n8-=
zN9o*@t*7ectiysmgbzzvaHI4yg9lKN%oGwWSetvaaDcG8;SghtNremtN-KDWEWYk}
z9J&hbD;m5SY7~Us*N%S_|M9W(L%570@6d0amG9dkGZ!F^W;3w9MvB+2;I_@yJyVX<
zOOjgEtUdkMB?lAlx6j@5^C&-#4EE7Ije?Pth?^#h`us<GUN@<Gq{^mbJ+<syft*%r
zLlga`GFh^y+vXl0uR~)sZy)OY!ByS)_1B{uHN4GZ<y=`lNl<Y5GS~i{mnoX!aaWOY
z$QqBJn~pC_y*IR(+5}%~n2TJ#em;g<ssB8;xU-Ed$pR1{bj(}07i<KxnE=!B@1_5y
zO~DsGJAa^)+%3>j@}#A}+q?X;{f8krY!Dgot<Qcx=HR>Y?<AD8o#gf}*{Kjr6gVJt
zEvIEGr}@O+=X2g?CW`Rh@S2~sEA^gop<yM(bTWcU#hWrDQlQ14xJ<R?MNu44c3rXS
z-Vl1!-<!+qzy@EtbnWkE+eR>gsTe4IB9zozErAco>jXdVA9k6vd8X8AaK%u|QOS<_
zB(s~L`s?v&h^-_0j$y2iM@>S-`{T0#>uvpKJeswG!BK<{aIq~G=Q3_qiH9>-ujd>W
ztxl8t+&B)1`uQRA=f#;Lc^)E^1}gF2e9OORtr;}2JZYP?AK6{(QKqi-9$u_~E8moV
z7&(`^1cSZh1Ru?|NCmjp2PI$Ppag=>_YTxR!M<+~Z_xGBSJePd15Cl7v<>C`dJ1C^
zs!OW*!NIz_w(!0V5cE6$NX~h)p*DB_na0|NQg5YqXQ{8`Q*9P`g85~pwRNt6`Nm@a
z>rL6b-c~tKJRZ_0!TRN11{;^iBU#k!<_tHpP9UiGu!$48nB8tRb(+a25ZyUy`J*)I
zbFk|Z5L`a$09D8Ir7?)SaTl<eb>A%Fkhz$rQV7=}!tCosT4kK+v|9rD=ck-+fBt*{
z><Vqgm8!EUmJV_ojBWRXpq`1djc&sYi`b>o0UA_ciW9*_eqT@FB}*R6Od*SRhYp4J
zv=4|kph`^X#b^!(7qUa7Lv{^=u&~)3idJBX>um!jE_-YmD>h-o!>gBFUF=y|k~(?*
zY~dny|J@mck*frk$L)vE@y=hrDdjl_52XdQ3NUsqT<KY|0eN*G=QZ4Xodh%|ysZ8r
z$n0HXRT%dOPw1T;Y;?H*6CLS(ob+-YeU2%fu=Xfh@(47tZ`$*3*356*S&4IAz0da@
zoRSjWdYg8=dZR!N@OPfUr7{hiGV<lAE^}GQy)e|z9O~N2Wk@eqa-jQ&k@PQ4-G(^;
z+}#b({hlwSoU*q8<~i~b<hx?g6x$=qmls};1K0W5>k=eDx<4XhroaZQ=39vpsw}JM
z36ztIam+T_oXW$QP{!r-W&mc`(SO&t>H8l$G)cq$*DEPe>tB~wkGxlaRKaY0X5fXZ
z$eZnA)=OAra;7+1cyTfdNRMJ023Ef%A88|=zg{VJ(&dn|cdWX{oIyNU2*#il|I!nJ
z!Ku1)zNJCE%Wq$mk1dY?9QHeyr{Vp-tv9;gU(J{PUP^E?9u8*U(kY4C&-O2z@VGsI
zm^d~7g@AGi@=p<pXVdAq3S`Ik#Y)ciQwKF2o_x48o{b5%i$&)Ig@8Twi%lAV_N6@?
z-buHn+uq*IBhz7X&MOlrkArz0^Jli0!=m!9IZUMhJ-{8(<xFI_L06uSca>mZsy{hQ
z`YjUKl(<4Fs~|EP!TC+<@3J$3@HQ<J5e}$_qgubul;xJ9H2n;1p;N*;xbsD$pGx!h
zRzkD3oCi?o#Apu|o=UL>C?DgcfIxHCR%r@I&U>zfoW*}WdmS$F<JKjFw&_M*mr*=!
zbOHmeDBNth1(w|>Hqb43VWl&u2&41OgpCni9OI{s^Z=<i2admze=csL=zv~harMAu
zJ>1lQiuLAIgvss2oJ_A<!c5L^^&l?*s^edHr(RW6MVH-c-kwyn>prYcRjd^W2PpG!
zk;dI`2fcy60!^V^834d5h8*Eg>WA_8k=mr#wJS0zDY3{Ec?`foN4FGcQI4dtdGIX8
z&d1|@IOa4{rYkaOC42<G&RLa(7NcTC#LoBBEZgg)^hWK&JbzJC4btA5o}75sNF(rU
z+~mtzGTRbs2Jl=r0}f_FoWn2xXrjF}j5}p#u&bdpSdLgX(@S=hzw{SA4V#P|MmZ<1
zOEld7mp22Mw?w_+M1mU})QmEFPn{p5QYt@Jc*<*lJM}hfoiE!+)V9?o``2$^ITOe_
zzj(2mE%RbK>6Qxa2NKTCsh1_W0AVI+S`M%@xtt8tpWJ@j%XapziPy97$%3hjwL7Kk
z+l;ZGbo^37zk)e4Llh~u{Zzs$ak16>K@nzF=WYmxuWoTgWQy~8t*2;v#hx1E(}}d+
z<XUGnA9*T|hDR<f{j>yd3<xLO!UyO6dA$YuRKaFSduFd`KJ5^cC)44{_&ujfb^cjY
zl7?LL<OsR>{1ZZY!4rHyY&nLl8NIpba{+eBS(1)T1_dU1?!>bK(8c<+jt%1t_4>;D
zExO$GRlB0oCLXmvjDn;VaNH2vd1m5Ep8`k7YQb9WDB(lRV-Zr-Kdllc$j!xv7k0%T
zZfq!!rPz*-G#Z(jMBet4jHhG*9$6;8u@P-B_s9)f+uyAG!g~=|9X~9sY824+E&=LB
zZ--7}qjc#9mt_pC8CMco(m#EEEZr(&OxMRFevqP^31f7Nhr9y;>x(^YgGWYQrT_hT
zb667ETx2sEzOs&DF5w2sl|()S{X->QLQE6LyQp&Ihw=ZLH~)z60rMv0Rbcl=zwewk
zyLg_LztqkeGkIP0{#cR@OK24Pl&MgwRP-JJwA@N23~#nxVY*<T0W@Ogu#qt?I3phC
z=dnVZyBC8UELBk;PgrgeoDwl!_@(=9#VP@=+bK{PkKxY}aiq!R<~1bZI*3!6YtEHQ
zDF*st3ZplodQC5?dgl^`(im}`X8E9gHeC*0&fwk$qrKA2bQ1P=)YBYhc*dEWU=Sre
zlw9uAkv0}L^(dFXzT-!AH~m|E8I8p^hMo_hE&Dopu8?IN<Q5e-9oM+$jOb#~lxiRt
z1>$7IJ$<v)6kQ>`Yr4DckKG*nG8hskZUh8J_pP8Mg#{D0=4yWHN$LID>GR-V&;;*0
z19T=UN{c>J#1GjE@@vgsQ<}98UF*tFMq{^LEbC(G|6vA4^O)NqjW)cg3#s)Vd+6({
z-9Hri9C+3h97u*3y8x@q`r02epSI(du)*V74-5r;ojA`lq>?kC=&acPd}VhnKipk;
z1<>Rk{|@rexh8MdbV_t6FF+UDUB=p@vT;**9V=Dl^B$%9hi+{A8FR1rQvkzw|DRMp
z!+ApcV%gnS37<<2GNZ+<=Lti4AWzYAyL@=i8;PyXA+wE|A3)frsr1PKG0Q)%D$w;j
zy;CXpnksEn@5L^+*F_G>qh%N?USRtqJ;CB@EEOmma}>k5=jNXxBN7_bf}U%-u=eB+
zf`H2O<`drGt=H1?xz~#Z2u`TF6Kc}P<dlMMAZG{TSZ0UnV2lRfp|qiirERUua73zk
zf%?03z4p40on7JseY_wNGjZ^x+na6OGp~3O#*z<&Qw&{)ZvbUFFLd#s!lzI`o)6hr
z$hDmK29yhNns94H9oiYsY!AH8iZ~Db+YtG#nX!^jbJf>%3O%$_p1y?b9#;0-_!lSO
zaj>woJOA?e>pwueb>W-D5=wx9Kq*Kw6XArz5#!^f+>&}eFGnSLkt67zj4scRPMqms
zE^u!;3xNEB3ff<z7moy4A8&m<A8e!$_E4~6_f?wyjWOS_J`nj)OlU%=O0d++Z4J#B
z;GVQbxx9pHvH}uFCoos*Jh+1CpP16<%*e*w90gr+{sQl#Y3!PDW2bxA1jKq%zwb5_
z;ckEl{8SqwPy|wSp2JcycxC^|5#IR+1^3|HPd6u>7481$S-a_;k4fQhagZi1Tbf2n
z+ss)yTX|V#zr>H8J<gVWwsnutr%SAnUoM^Z{Q0YF^A_nbaO*-y92!p^^(J`TEuoyN
zuhN7Fpt096_743|_9Z38G5IIt7Os%oK!?DKtaK{5_p{MY^Oj}YLoK!qZN%5py3U|F
zNvciYtEOVH>&IvSIkQ;6Ci>-`o!$N=>m6}jN9KYO6{q{xA$7;3$^0KmI&rgE&Z_TQ
zu{v@+`}rGxw0#NLXQP2hQOBntHokpHgL}W_tlv!?pBQ_$CF%geUDaj7+qk}!c+C$e
zDwN*N2MQf!qd~X<LKQs^XodODOT2$o<Gt9?ak+(C#=WkmlZ;zFf-H(K3Le6Dc~doM
z({r*qb~{_E_(8*WPj{gSl<bP=uYVn2dY2*HBHmMkQAGy=pL6u<$0Ts=vs{N+FsR|<
zi&!B>c_#~Md8@@1-rSY0PttC~AX}Tds&uAh=C5wB);<`d*!%4-3>WXiP)g==wR=7#
z=%y>Y)_cSO=8Bo$m+g|~k{u>vJn4DBFkh$~B#8o6+Wu#0FW&OXCcz{iBN=;!!IZ9{
z0lAv$57KH2insWD@u#;E$J6~Ot<Be7D?K|O>fZE2(7C+1W~0Ztm<F@e-hJfvQd<c2
zB8l(qSFhpX?SrtijAGp>B)d(f20MNV*xb43bu>f<jSO}z{71EvTgr^fY!@=d`8EGq
z8?U%{8{_Ir_E!w$6<m(co3L+FFJy0miuAr(a2(~B>f$2nj%q8vaDmACd)(HTD*XbL
z$*NE18?n|vD|3XbKT2K2%iUkFQFkaE^~CMQ{!}gpoM_?p3YOtJk7V{pR$R|CL@u)2
zQNML1^`7Ab1^jgmz1qzL638YqSKCADgH$xUpL?!OLp}v+CPOsxb9kLLPGDYIfIm`x
zb8U<Zr`Vw3CmK!!8gur`-&+VAr2J`JDE+py9~<Yx&#;aKeZ}7InnM&mv`~)o{R`-_
z+g-u@p14UFteV!|uN=-uU#70)QHk#q$YT)AfBbe%iiQPd6}*vBE-`@`9uVT$eKaa;
zU-DX@UUwMn|3W?*N#B(Fw&u=|Gz~c8Le5#JJ&jyHDdS1CuktNn)BbrL6W2L5@Nb<*
z5}Vnqjm#!-<lD&f(hc(9s_X>)ZpgZtMA-YQKkG4NR@MdqXGG8nbiUTZ#+K7h;CR!r
zxt{_P%%u~Ja#S1l0M}*Sv#kdmE!7rTfjnA+JnU6{A~$*$h6jaO;Ct5cy;ym)^qWSD
zPbA-7gh_iQTfay+Awt!T#8~6w5S~3FVUEXOrRE$wKY5xJwTbcp7VH6*YI|%qI2R}Q
z|Fx*U2V~fsnt)o=@q{<(DQ4Hpc2B&uxEA?}8JvSzkNrALvQ$st+W0|*bv@{KveQ>?
z;lIl!!FPm=%s3c}bzGC_v|aD*e`VmSrc})xXG$ZqAbKY#6Yx~e1?Jv7Y&()1AJT6m
z5{<vYB*yPr)w>rtp%f)%Bv-F})iBc7aveh>b4fWtH_tv)@Yxvr7b>&C$HDdHvFO9g
zt^aOee-K`zu$z-wyzqpGx}oVCsnW)Ke}FIOy{gTT%i}V*pC+ELB#d^KtiHhIw{(~N
zn=P2QKJ#xzp;Bw(s#(YxLJZ}1qv=F%a;)bI;66s2N9g|CFYc8jXPav|dS8GeSkzag
z)mF*ArJK{f=z2J&ItI@W<>wU|4V0K~8pw!-?*Um-%jL<B6Ay0xvMcx=EGHBhhMFKM
zWI0Em>Ma;~1#P@GneESAZ~mdeRAVkj2sVj4{CVH9u4mO|zSK|pDH^%DM`OO1C#&a?
zX~%vanLwBgbiU;#5N0cI9|9!e%iQxBBf%v#x1vtIIXkY<bwrF(|NicQw;SGZ!eAMD
zIpo)4WUi16A<83)P@9ymv3b(3(BwWwTg4C@>Kz?VQZFD#h43xs(WFX2&hOINvwyxZ
z6aZRg-$59ivEOkyncPCyo0T2rd*}MK=<&~cCz21boVy&tM{mlX)7_MpDCWK=6l6<k
zXM#}=G2B}>!#%;k<K9;zzYiil&O=_H1pTvx%}?(~T2y`Q-_q)xp{38mDpXnx*fGt}
ztR7Hopvey3xs>O0<zuClyUSR0j-yo$ptqtMkJ=1Qfq+dn_XDKVb^t4j)d$Ro&Q0cC
z8f<6xt%h^+X|2lf6O&m-Fwn8Z5|${(4&KV+pU5_!tBZrwO~0+Ym+Fn136rK1$vmRv
zo^xyrwLzFV5?^A}p5D743UU8{(f<9!EIT3V^Efs1YS4OFMTC*H(ch5qKp>qyb~R8D
zyJ2&!zvwYMbvHl?@H|v=XwA>%gf;@J*i;cou9Jf@GX=}LKtl{KwfNdy<u*21Lsq?U
zY(1=0UjQ8feccV&1fOs4Yi7&YH+BkbEq$;FTiAP<y=2_W?Od9Lu^Z>xk6jnu#|<rM
z_Qx1VcYRUDzV4q7pz}3U9faDkuJuq0uF{F(0mv#HpB&+}iW78VQ{madeKD5|e6>Kx
z`oElwyG&p8^4i1V2aQ$3@b1Y+UoNJ#``>30FJW#`yx#7uqW=uQYzLGR3Z*iTV#b<X
zgqBz6Lg0<XFY4rwN7#L0+1;41u?EvP-kT+q%{4!NcRHVtk<m%m3XXf$ySEfPYGfke
zZM!<SL&I|<8$PQ(<mp1FQw21{p47~DphGFr^5i|_@eUGNpfi8qCD8DV8%l69k$#uL
zra&W_eKi^r)?5{9e40y`P5TrV?0&c2{<1*Ox|VNQf#G}S7eXZ&cL0x9ZH@N*e0JsJ
z-0+djd1fa#cp&!N0uwlF+K~)2SG(B7B{oU`YN+5iV83}=cH!{bHsGgs`R;$uY?vT_
z>tdCCQhg5WU7a3Ar*G%4JuXFy0NNX&n*Wo3ZL#uXKA>EU>@2QZ+7DSy!{lh#(z(+H
z?dP-W`)L*9HadH#KNHiRUin<8`#_FB1v}}Gu*LJ%k{SS4j{KW9T8D@({gPmDxtczG
zCco7+BtTa&nPP>}{IT2{hg)ts31Kj_KhDRTLb~sT&gRhblpy1TPkRPQY#*q&Hxk}_
zXkoYJIa`@u)i059^&M4XBu{F`=QO^6(uN1saB63mIE%X75-d(AK9UfUi@NS~Z40Kr
z%+M6AE*?w6abT$|f{i*?oi6&_WZ5$rCFHT;rmfwz{vy1AC5uVFtGzv5%h3D!jvQ{Z
z@rR356O0cd?R$WB)#hTH-Yag_F<^xd+v^xKBUYWJ3eLvTdpVKOFC{|5guR|SZ#51O
z@cCUAV_y+CtV8*yJH12JFDZ*aVM?C~g<FeN0!JWbzO%nR<<08$wm<Xp+OrQA{&(8^
z{gYX9-1hlCEi>F&1#D54=<R4N*KkxPaJc7!;}iSpyJM<x{5p79&$%hV<nN>j&!ZrB
zr@YItgKy*4dTD^|8Q<}#9@*AHEH<(8XxL077nV`|3?R`0KWc+RmQI(z!Ap7}jS6#X
zz?h7H9DT>=gr38_KWbs)&0sugIX+10s#Ag5_N%71;%Yl7=&rweL$DdvCeV67Ah~KZ
zB2C|pN3FGq)A3ER1JEOSxM6NX_t{cdgdK1H;;LUQ34jK<^U?z>bpL346WjpM%{5!b
zrIDV9HyZcbZHhp8R=%ng0j8n{Fhx(*C(@|X2Jd+yLvddSA41zcNLWcvi70Z2d*|c4
zUh{MnKiBkkq!A$y{W0owhT>Ej1o3zjO1hj$)B2tks;N`Xc}y%qGaq?|Z*1s8tb*KM
z`4sn+i1;RJm1;lsHFA>B&)&CvcYERY9U8G}6Sk7simF)njo3`AA+!|L6bfRd_#H4n
z#UFiQv#EyhA#bT)0;YWpoOT6u8$h<4=Dd>0fXWtS&UC%}ndomFnABpGvq2zNtbr;H
zEQgp25B3Bzh3{=q_Q3N+Vj&AjX73|AoYn2*;Jptqw?ayj&#4DicYXC!a6$2-<VzLY
zzDE1C*)CYu;e{9zq{<jtf+DAlRRK<5YOYONF~j%Ubg}@@2!8^HlV_e8_KwP^>%?HA
z8ol-sNHTE;#am+CKm}d@tJqtF$KB0;rU(ZUI;~-Y7jFvdMNOioCE+Ch@j8;uH(bk&
zV}eF7%RKYfu6)HP0mxCniD~xCIdGAqhs&a9GPBZgL^UX?yV}7C+Ot6*CNx%gS&R{O
zyXyL6<%B+0m>IO{9ktDI(*EHW&-qKJecV&pI}B4uuQwY79XV=G(m?#Uh`$6iXPz*M
zx`4lrBuu|cFS_nU1`gTNBFEg@hjqM38LD8ncX|o}I?TB#!A`dltQ54$ABL8$I{Gz?
zXI%sRyW07ovX{H0SMwvh7b%4<iEb;I8}kSFp@Jf)+n3%}Ikx=#aj2e}99&<HzMG*E
z_UgT?y$<EjsyoXIRl-z*`GOE(A52+Hjd|ONu-WG>3x;%?+Osu?-diy5+OugiBBudz
zf^v8JxeG2f*j;rKH6J-6v5p2;K^T-5ZYslB&Qbf#{gnf-k^bMAonvDp3A}$VB6Ma!
zw;AjN--!N=$#NWSYm)59#M?wc8SS=b_e<Jm(5Pv`EMg7Y?<#3xtsXEG1u^t6u}*qD
zgqbM0KZu&>`t7%yPE)aER-VW0ez=|=c?LPYd5J%0{Q}9YajR6c>Ru7AkX%?<ALRPt
ztBVfqq4D0*<$HUefypeL#($wA`}^Lr#VKEvv*?*xf<m+SqYyZ2Maj<2P?`X%+D^%?
z9@Hk6p!Q4kUYRKVg*+LYM_|uVx1POh80ym=u^LU<yM?N`8Tnq;Y!JnjUyZp!3KtyR
z97#P$<ft9lW%$*WAK}N_Ct{)F@%=_~=8}h+qrVWS{NdYd1}g{grrr2|s>9E+M?hQH
zgLjX0Q@?}S-9J1W=e-ow#In1wMsi5<KjEyiSvS72b9K!CmUW`W)+=8M#4Z^y+;b3;
zpcdmxvbIj@o-oIuC}3014GxK0U0>xrb)<wE47P8MB^Y+;C~U#_B&@Q1L&+LC74<3Q
z(=BGjSzeaATcP{iJz&zxgmGDHCcm@I4MtMPI)~{P25t3nW6zd*QHcgxy6{mLz}2cU
zZ$5CpMlZXeowZd)YW?Tlag?dE>9V>M#b8QrX(3PO^U#04!I<i@tq^(cd}Yi%oSz6b
zHwgo&_G)H4q9!)@j{o@0t~Dq*Zwn}Derh{+pq&$j<jZtyU*rSt>!pmF5ea$IlC4sQ
zwFN+<dqKBVFr{CFo)HyHai1D5U?$uakcUeEAZpM<`2Z{ciQr}J|Nf1{dz%$PgXI%Z
zlpjK!!|<1lRNLnDXKNjI^<3}p0>)TB2`5I#oWM1$V$DM$IEl>o^auUNr4g+pK)3iI
z^vl5D^Rec$HjbC%2q4u4*g{Hkz5tLe_ES575vMaapK$rYGXM7D2xbz=H7Dwctl~Mz
zhSos#fd+ly-fih|2yOP~_h{ZoHt_O$V;-uA$zr*DD!S)`_@5e?X^ip3;{fX7XR;2r
zodF<Mr5X7hM0s_UWV((PmieKZ>2HtA!8lHFCCWfW>bOnF$lfUUcYW#v9ijUkZutn1
zOwu~GWy^)$Z=Vz2DrG;ti<)D|Ef8X!R>MO+%6u3^J3rZIWhwSxghZl$`nVbO!3J;S
zDTsD|c*cHQoKEm-+_PS~JNW7z2$tmhO?38ah@@)RAC54Tk)Pdtk*BlCV1~@55JX92
zthk$7r80|+7bK!=aZ#jO`5C?@Yxd*^gw3IT-E0Za@j=eJT*EuV#w%^`eOi*Ve`3nb
z06h1TO30pP6J4?w2-?~hF7Acpf7y#u&~d8BK1b?0{fR}vECySH)|SkUPzp-H3>;Bq
z0H4Y&Xa0E^*~Vgp^}a}8q4M}5`-`QN&l!%h|Jl#n7|(7OsD>WixfCU}`8VV^L;%?t
z`Cc=y(QQNQL1_Fzw6j$<VTCh0m)P(aE&Ug^&XRDHK(61#_|ES2s;o>F{<vWu*u%7`
z#b*%8B885UmZI>4yk;My*KlD3GjRe{-@#q6xye@XxDVvK*{FNy9f@xayt@h`dEMjL
za*bl=TNCS}9}QPQO#?Ff3b>qDUO?)Ep*G5}7ZPUExU_9-B>vNKi3o^!*BSWEpndkl
zJ%ZF~YRS_rtW){SPSI1ZYW*#d)yPAiWtS`cX#t6M8~vKx+xvZ%L3Yj0o@5hJ>&ky!
z{zDjKf$RBi+aOLXU%)IOW^g3hhvsY6OHzZtK$>swfqK1ASPQ?KV-Hzfiv-i$nyT(s
z8uY^k;c67ocgp6|h>wiKhQ_5^OW`E-F<6uY-)OIt$bHl4CqJc5?lq$&Xz!$%xfx4F
zG)djgAJc&W+PO8-lsjW-PDhvP`K&Ghn-mt0-#1U4#J!1=oH>?&eHpEITJ~X?<B|76
z?=XL7gE`TfY00`pg9FTUT_f_u8S$-w_yqALvse2jrH2isD)-+NuAT2c)GADQhpI<x
z<*bi5>X8w8{w1nYz0FoP+fpPIOW<}(iLCl(mA8I1^sio14wjx@{uRVmR_s(b`Y$Q~
zuJ~eA+6>XF37g2aX%6hTWH3n&u|s+sn9GokI!*<M5e?Mwu%3_5o{*;*ryO$%v#|cA
zatESXzxk@(Uyr0}d8Pr)=IzGx;32K~8U<NC-oTl6s$12CO6P=ehdLNzE7riI<kvD}
zvYQrkA9nmACb?$QSWtI#Yp<7FZhc)mKtfm<I`(Lz73CMu#TkN_t3jdG7&tX<eTO__
zoCR5YyEKin6(zBT(^t)Ag!2Tt`k@|p%Y2d+#{PBiuqy@7)ZU%Y@frhK`mArF;LR~s
zl><iM%weZ*>^sUHw8rD*J}i_$|0sCNX_sD7|9;yh7%(Yq!at^r1OV53Uh<^A$WE3k
z<K9@!RdueGM?Qv1Cmh#99hSd%&HrAW_hUVvhW+q?Hu9H3VKb<Dc+x>Q4-Ol;@AoyF
z0MOj_eN}D-H}lDtmiLcMg>b$Lo^p56@ob@g2M`I2mab}EyS+~q2R3zx82{Ef#)Si9
zaR@IDpJU<8?b8`gT%!oHaN#;r4Xwe!kLvDo*hsP7Q@@tOA;Y{gh(JbD;HjHTbF$W#
zTuj?>vHE^7z;!E|aL3WZ7><SZRNP74?<yVYF~L!e{T~CEoOBDIb1Tms;&Dnr{8UU8
zh`WBYnQAbB$VGWsG{bZ^SeOG9!axIgLr_?r<uy;U0!##<1x}eBkL_9+7g~gs&XRwF
zb)6OU7b<K3IW)B_5WaNHWX6~k)3>rG#!SlkM$2J^fH?rrOl;Y*DViSQ7KbC}7I+=(
zT(EQ-q$mVNuTjR{={)|3!Om*u`(NE|JWxKZm0r1}S7tra<SbrNWV}!!6}0z&op#i}
zJbY%Mlno<hA8ipdxP2Sw;?)0NIb>LKIKaRhl&XIxT$I%iR&ceXTw5X^<GYo%OK7>u
z3e&78QekiR7hU4o8&9%y9^Sn^S&k-M#5FwV(0JQc(wc6NQ+@!$$ZIt|M%6!y1G7ND
z%_m~CE{g~A&6#k~-wvl0E_@{15=Nq!iGipXKl9deMLq9SixkImRFgMHc}74(vJu-)
zHNs7_llJwSMb4<08Ea;}oIubeV?~};7IJZyCtD5@q?j&~n5%I?7ybF`cmE#Fl{OyH
z#Ck7q$+zD)?a{_nlLyQEt>h<{Q{EoCow)CN@_2o@K4A@GOpX7dX6>R?mn_``+x+`W
zOBzRbTyg>emYM3_=jqrz*HwZai?nrL5BAx*;n^{gb0i3OTtYUqo51tr?2%3oFS3-0
z+`J0gDptjdBi%)oQ0XIn8sX8Y-uyHy2jiZD1IyuK1F$nM#84r~G#5iWsX*BH{oxoH
z_?j~!WIQueY?gd7+b)Zkw(Y$LT7nIFCe(wbfk9;L{lCQL6#<so<F@mb(S))s1ESz(
zEeHMcwB5{%19j|Kq#U_}1d$<K+c)Z15}U>j(F%h&#)ijhI4<EVgueGmDZkOxB)iXG
z?H9mQi^XT-e*&N!5Miyodv;mfF{b&2V*7h&{sI4B@;$q7iJt*^sJf2p{kNTg=a8Ll
z@c{1|5i6|8JVPZusY>^OcPqcb+w_9EjCj=D$}Q92mOx}6P$u%RO0Xr~Z}f&rxl8vq
z=%)r^Rs}eqbc<hU@SBXo^*AJS)<JE<nBDqAK#vB)Fu>g)-z1bvsXtozQy3wlyo@C^
zV+mz)@eo)BJm4&A?3?uC&0o9_a>miz|M>;aot{8_FPX)6zI3DfCW+SO=kusw=bEUF
z_78#yNh6QK8wL8C4GIPn{>;n(nD9nwWcYtI))oS9H|vOPu;av?!oqO2de?*Ma)F)3
z$jkoTR{K>9uTisx4$}O_$o2jwtsSL6%!50a(y2tWgx1Z4uIpjbB_`?!p}Vbrh5p{;
zioE4jV9)iJ0fcT#6TUqzfHt}DjkAbvBuK0}R_R-Fnp|pN>op5`w%Dlr($-4mxL?-^
zsLPvaR1fHkZ?7Eym%!(9wGjKDeKn3?=*8Pb!^T_<eo6|ph_A0yK0WyhHNbEOBs?BP
zo9`Rl;c=iQiWxh%*oC_aNxJN}2fJt0q6u`JpurBZxpl10eEtKDY!UzH9*a>oh;V~H
zPu(|-ggfrz@AtDc7lC$3DUkOKN)j?*kABa{B-H1XWr*cqae#Leo1ogKPx8YTdWn=T
z8MBAT-v-@L+kb=Pw9=zYtyep*54&+UjH(-HFz+QRKk0_t!%VIV-Br*PJ_4T+zz<yP
z&n{g|{^Mz89*{syOb#A@E3MDCcxv;FA{6mdCnz)W_}YGir^u%Lqf+zY!^FbIy@nss
zL5-=|i{LaaV}pScT*o%34%Eg*-=JNY7G?)5y)Hr$Ze=y7wamaYP!zm%wj|AW-|&%I
zT~sQQPs6=roJAT^Ggbp$`{}Fyhnlv#{{1SL7+Nlqd9Zo;TKDP+{r4(WH_Q?yXJ0%L
z6vjS#)lk)$l(}>U-cn?(FD9mkL%2a-ULKP6rx6n&hWMQ~oQQ?oPh;eMEcJTg$d4*#
z7@ACL_yKePv*frgjqCdZF0yZdGK)S{(K)g3f4i+Y<2!%l>~*VD;Sn^Odgkf;a(3;g
zR;ok$D2x<8lZNv;99@0;z8@re-1BbzQONr4jnqXYX(VY=yZS4uxKb@5DGg)@$Msmt
z==OiZxjH-i!8evYtww-jnJRe1>eN(_JMdXhD*D1nAdaggzLbEEeYrJz@VOQJLzYMv
zH$P%DbXb_Oq_%0I$q^#=5-2RK3yHin@As_cQ*vIsd)y<(^frlm2dVpgMhbC@9xR53
zKPD#*_Hgx7{CtzJJTcx&Xff{pjXNVUwXz9-^vyyzl+D6ZGf)*BwSkuHbJA0O9NXCI
z7C+LjypS|;PS`tYIFfm5SjBayn2u@iRs)i6f}(E#7Zs#vS-tMKE&U{tJ^GD*xLc%&
zu>+Z&%=hhB5sm2hwM$vxu=1T+B5?$*f2<CZy}Un<UmHC)D+&Mlbdld|j2s;=+Ku5S
zoh&nLIRnv$%1=ugk~Svz&u6<(@RTS>Pa}#&GjgqPW^E*J=53{Xyok7+gTV4Ln3C=r
z!PM+K0)cL5|0h|j&YTo6P&SX@@iQ5PLxqhq7?bqL<2x8JFUkNFF{I$5^=~+2{7H|h
zR_#1qoxElRoY2Sa%P(9T2AT9#e)N1AI{&R7eE4(=#@Sd|uHC2IHMNGX22z$)zpsEg
zmCSaN6%Ec&6IGLwXc-Tu*M0CjG@F-&y?3JB<aNOdZ%YXw`)&(-1=Z_lY$ir*<<nZ-
z9giwfvM|$M&O4;@`E_cBlns4G%kl>4p-$sYpMq!`mG$n?ED26V%xwyhE^lL1e;ej!
zUy|wB6x6@bpU8#&F01B7S}AF3G+@NdPf2cM<<1zmk#se{`J(?*danO%|F0X^O(Z)%
zt}<f-ihFb+>5P`LXFBGCBu{PNM_IE^Da!L)VG@5bSeX;`;)J}tT#W9|k4Y`+Zy=v;
zzE@aNrAa;j-^Rq<YL&)mThP0run#el)?cjBHdvg3yODKUSRc9mS@+h@9~PxJ<=3uN
zNr>BNjulRuy8x_GJ7uTMe)5^d^;yi;@jcufzXc?);Fx-}^VrKt>0UK4XuXIKicdeP
z<G`3Mpd%rxv~6w;TS3zb;KzY|PS8rY;9S_kO1E`<uw2$D3KX5+h2JCBGnBTlqsx?~
z6oaF71?PE~816J_fDy9>cs{Ip?6;(pqe?yJ;Qd0~aK#Q;CvE?|z%f2MD;W=EHh*tv
zn$Vfa=AJ5uNMHA5vm+OkGc(MW^RSE_x_3YV?MKOzDZ;Pvl)*2NJnu~L$FED_B<I(b
z?W0ZJvmm>&wUNGl5RYc$FWZID$&@4F%k^K&<L$vIQ-4%$3u1?0&kg+kPX2gS_rbr~
z9D{uA$Ns;(8}t0%)A0Z|4fa$~1gkj-(G9aX$+9*%CLQaltkx;;M|^7$@J}}G!AthI
z-uY@G5Dybh>jpt2CcY^J8M6Q-uZu<6PYhMr9C(YMhESTJnk%qPh)}R>L-HTqO;v^x
z5R+F#j=p=d8i2Ri6u8?%W%xd-zt3NPpLmoVtmArZM!?9qG<pTZ2-c#qaVd$U&7gpy
zn+H-YcUg~cnNO#IWn0DNMfH+C9wxR17xkbKu^W-Gf)>kVXd4yWvk=HcCE+QvKoIT{
zJM!^s#cpdpuY7x+G7<RMtf!!3;3kSMxL`}aWJ!1~quahhf>{`_VQt7dlA&@nA7eG0
zzT+KTx&Z4uCB$I&l60zQs@Ecfj-@8Tu1O2v>NZU{53moME{Ev6{zFh%f#!zD1@n!r
zfWC#MY#%=K{?yeY>vLug5~eJm(`qj4Rj(?jwFgK-p{Ao;4PmS~v|<4!*=nBffmeCv
zYjveR9y$AZ3J99B|2hK<{Dz^_uaXVNZH>PR`}y=*o_#*SJ#^JCyPAg;28U1lRG{m%
z`#a(+lw|_xDdVrSft{B>k6GKMp1^p_1ziqLmiqOgAWvl3>$%P5hc#RKXt3P&;#F{l
zuL}6(pCS+uBX$!nK6_)9#eW4LKjw;F{}r>Qt9gXB$5~LI0Tj0zhC?-fwk#;eFh(rA
z+ay}ikaG)WdZ4m{4KJJip&P*@I(39)!bhsPP2ryjA@)5+-d3_zMooGqzp}`z3Tq)a
z)5`{KQ8Z$BVa>p`0i_(9V?xDWjPZt~(?%b<YkCWlz9#g6W7Ny-!|@|<!?hrH8IdGN
zC3#C(-tsenUF#yPLpY$c=K$GkIIc7Ab`b9*=!%7>(ui!Z?J(@SoGvOi8y(xAUHBAH
zWw)=`Gk8xgNDd@>8)(EhxJ?3vm$xretaDp7dv0a|dsSX`Dk7Wmo;$WdfSPFVwyhP-
zY?4?XMl54z-+lEn^^Y@gs9sF?32y)_oZ-}mZ7g$ZIIDcAU_n*gAiGOH&z_w_08jz>
z(5(V~(1vK`wh8WGh`a6K@2;KNt;w#7{u}5hLcCzec%;#;y}WwXk<N^RiR-;iOZ(lw
zS=p{FhLM)Gj?*eyIjCI9DJt<<;DT7rVs3AoyZ=fHZ-)9-2glLY={KeuC4ejTcYi}u
zlZwa+KKm@B_;?_*`5FI#Zyd_Qqou#5e<BM@ZnP9HX0m8bJTESzqc=A<t~pt>P7j|v
zu+hSwmm9)416=N^Bu_TMsyXQc?_JAgL%m3jsiYF5U!nT-;QY?#8LRO+lNR`j_1>yM
zLW`>oWNLpT#?-^>F7Q8ns1ZKQFPS4;D8HX>{LD(jV~M{z@G@x&HYbv7A=To7N1v{@
zI7|zw8P<MYs$H9Gn|j6h)7nQTs-?pWmenp$jah|SY-E=b1Db~>pP`C1%xk9GtNpf2
z&K$QC2u?aZ%yF8C;>2i=>TJ5o@7_qK`84te*vzWlVvqk>6uJ=52m(h=0Q(joZa(y|
zau*OE9uq3wajW=vf=<6pvXV&>6^FH@WE>n`-@I;w>$n7_6B~bt+~Ah*81~R+%#zVU
zk=ea`v50>nV+YOE7r9@_`r^;%GL|~9epUk8#B+s@cBVn3*OTdyX!@I+2OlZ~w6piC
zWX9{4km>DU%>me$1nH-T>2Aj@j9he&rZZF#qp7VcWV=vG{q<Vh&F7n1tAv=y#J4R2
zxFxtNMx(Lg67<tP=kcd^+%)2sd`H>(EXQi1*XWR{!zCpGuQGc$L`Kt@Ey2{~0{f~~
zWUzbFm@utQ`IG3E*aX<?P+W6G%c`<WzQ=^}J(*A**lD@sz^Cm(AR@BS(`A8g{fm%|
zd6S-nm&tf>U72nt@4d~$=l;A_z9adKT)MXsF<G>a-0AAG)hjN*tj%CBYEnAZXDW2b
z=r?g}67WRDbe>4<0T|TEG*7zfVg;U2Od|?PKovPwW!;$7U4+@IU|KUt=pX$732~|d
z9^cgdpU^BPRuZ0n+<yLgN4j93YYO|>hwuA;?8?HP9$cWFbWh{acTk)fda`{eK9x8G
zRiPWTdnP~__fW2BLlV~QHYifpqV(jlo*MH@;Q(y&5jTDgo~h%TyQ%AOgheF;-IQM6
z|7My?7)`;c@hWIcI~fh+v^Lr^w5Q7DCCt0@Ohy+o!OIUVyfhe@z3e6%ojcMLmRy40
z3+(hcOQ}5-Y0TG9Igo)ND(R>HU;5Wvf}7&A$_DNvikL-~5B0)S0cHPP;UyX|=@6=}
zBQ%C1qOrsoMR9a4?V|r*s!fo4VQAhT=>z$Q=PH_;Q4mI(h~kT#=E@gdcYg=FOL&!T
ze)u9-^|a9G4yGYv6YYXas^^*OvrC$|<}ImuE2C>eZ5FnS9kh%Oafu5RiaX;B<=6SA
zf_H*{h|^KHqLxS_swxC=FFsF~seYmQf%8*#MKCx*DAH>*51&yVIx~`}8s>4?Vh|=X
zLDL-YN!LEaD69h_&lM0rNTxl!^`{*`;?Lbc6*6yJ_JcgOp1x=^^k>z^E1ycLZVT#G
zn#Za&jvpqoLOxEmnDgQ7DvL4bdj5*_&v1u}*4?)-eT5ka>AI(f8`DDXc!hYc?!|Mw
z?pf$z3v$2FLHsB~0h4l{cq(%>NREPZqE?t?JlodVu^k8!THPF2)HUtaWeZ$h0(Nr~
zN#;yZE3IBl;>2_9sDRG7%j#*7_;y)*_C8QDtUZJ9!AmV+gHQwaFs=WPY{*6?jk~dA
zS`ctp`|}xBHQ1rK5Oq&Nvv5-)4$>pEttf^g&%+%|#DM~V>mibm)jX3&4xtY)R~>Gt
zn<_bXtNh$%;RXFIru}&3y$D2ybGNaH{ch4=32LILQ^Hd;2Yzs*rmj_Q<Mx!>=7rf?
ztqF@IZ4G{|7Ywe(4v%clP0*JxVq)wr0_pYpim?>}M~M2E`D(CHfh~jKU+RlrUPacE
z1FJ)4->fF%ZD>rF#dw{Mj%BN9phdvP944Z8inUqc+^ae2al+1*XYHVG!wn(-+>5y6
zK*4VS>i9)km!b5-b?`^!aGaXW0zL=U5Oi+%_!;b#<{ryx(ZwLUB2MMK44)6Y=GK=U
zdWrxwL!URORba-&?z;SdPRBrSaBsLtE+>({m`SYbAopGaU>|Qkud6VzZDJu*N{?aD
zngbnHlizCJJEht9h*s=JBvu49&^s?VW~bWG<xz@;;;Ssh@nD<5cf#Am@6z#u>iGZT
z>D=R){Qv*|DM^L&PB|amQdE-j`BW(?q>|GdM$VSw<hV^GB<JKjgpeGT!yIRGC}(pB
zb3WUgH;irO@VnmMKYoAiAD8R4?b`G8cs?HY2j+{1J;_2LwvF-<KNR&8vi!4&NpV8t
zHz^R&u~U&L!xFX(vu+TyOcKyBP~DfGee(tIZANq&Kb^u-hJHz!LxubBBv;XgL(iXx
zYdX$MlFj{b8o6FsKfH~BHqd7iZ?S;{9?~ny55eOJA>8s460e9cpm(6|<S&NOeoyUi
zXh|Ml3^p4KhZ-ZK5qy!!J9aNZO!l`C1b+*buF~SVHlt$PoEX<}ZkXY7$z8+rqM-ax
zW8;?etSd5QGQsttcs%QWh}c|n5O-}g4afKR7q1<RgZI;=uv?-`#@jOgI{vfuN@3W6
zdVcq4F2e%bm<>PoT!ZM>j^xI;mOj}ScpQcBOkTw<bgJ-dfZ2eVdbo`Xx-L23Sa&cB
zlx&{euTIN$q<Xg7K1&9Nkl350TJQGF&qN)9i26660s`F#dBq|ik?`kaVMZ)aSiVx=
zcN33S)c~i>(~ADpXVM2qc#a7`Ht3Z1^|d&|rFOYYX?M{p2<pzr23zbd?nNQW9(h7n
zB?Tr<ADAkUn6Jx)9gCiqj3xH0;9ebrG<E*OeUGoH)4qmN9@y?1IT>pC0j%1N2<6Mh
zK%O5@#%`ghYNyCATyGZ52k_D+-gRZJoa$a&4TPNG3TnL~+9i@iYl8Bc{=V;m<_YHZ
zbBoh|>O-{xq-*hO^+MNKkKjGL>Ftj1`D!Ivbjz)6#wZz6_DE|RR*YgLrb>8k5QHbG
zYcaoz2K&~r29QS-TwJ~aC=p<f6?9el22h2{=7?~ITyY9G6{;F1wjQ;_L{G2@af)DS
zw33B3!vNEI`?t<ajqQ8qT*&k2weiMK{1>-v(DZNvci_a66R9lpgy`<rUOc_NXt2aI
zAwWJYwP)gxU076w6>jMJI*hh2v>R>c@Myi8-G*@rB4EJ1J`CWURLoU7FCNE9{WwYp
zh_6x|EaD8)xgALGkKjES_&Bct=)}89sXJnk;lX=PR~gkj7-cqc+;T20p_qh$6ll{Z
zAU=yc1;0b1GpHLn9#1KtEm!^-4iH8;@^$9=WBPOcH_!6$Ei6<EcyG_%%>Gg`<)8V|
zi(9Vlg;M{J7eQ2VJ$X>+R(gD#?|w7`>Cpee*qNw=B#)6qc$(h?SAgZRs)DfxQOARy
zCH1zMse&%(qXaLi$l#0Kak%fI#xuVNYF8B~<f-v+S{NYNAv!g3vE-=?``%f|OVV(5
zyfq6Bq)Yf-oF!G-)c<|o#(EwPD9JZDe#=tthMayp<Ol>0?}7TD=wyqwQ$Og28isFl
zaJUpYZ7Jh6c5V9h4*E4~hxYD`J8QF!YdC@c#ONb*3wW%u8$+YI403XJ!55oSHee!5
zwM4dz+@vg-9drfpOFkdpIk&*B&&LzoIvG`seoM;ETO&S$9Dhun*Ep+%2xu<xw6U7W
zV&d8c85f%N-+NwtBBBS!>6I4`K>9;K$A_EU4YNqvqnQhO`3*5k>wKg)BdIfNt7w$Q
z|N0MAXOCVRH#Wg%G$0G7Qe$ju6J4}*=6ZR9Jra5}muOns4`cg(z&vvKeZ8Wi|G`^+
zg?U602fZ2gAa&Tg42*0Jq@S$gsLdN(<~-R107&ThS%@V8pVNZm3&%3_!Dj$Sv}u1&
zJy4b+H=?uT{mg(daW4rAiHnNEAeCAgQfr|narJgt@wrx4856%nr~6{!NpRq<f;T%w
zIYsTpAb-^Yz7YyF8^rrzSq+uhfOdQlz$XBe<59vCKt_oFs`9FMc$M{e$*-~OO&VyH
zsCJ~*??VKeFhz7|$xq&9TS+8WNJ`MOK>uI}JJ~|h4Qh*T!U)9Qp;u3s+;`uwlXQG%
z{}x?UHB8L$7dZYOAmI;uNW#Hm^>mho2kBx`qH5-xmsllbIkbZemjgcpe6v?;CYGX~
z)?F3Q40>^rd`fr)!Y1N^LBBsMBV4N43<(llyf*vuuhpLKXdaf_?fwn5{05Bgb)QFj
z5m1?ef3oi-%?Glw9e|wXey0>m<_Ihv-}aqenAbRzoW1^3Eqh&azpr0-8u^}}SBzf`
z{Kboqbsf&KweLaM9Qj)vuB-^w?grST8EIdGb#%c__j>caeWtuE*F_2w)iSW$b}GGb
z5<-^<oavk;bSXaDfk*}iY|AYhsSh!1;$bBLKSzr6{Z)J^mods+w*=R&4n&Kb#byBl
zJC|@^PcszP;6u88FmYM*ok}cb_6|gPIV(Z%=9{>qy@d^q=Td-aEx16U;y;VNVCmj&
zWUQF~`!5j#!zqV;Luz0Wn^jP&?RtH^$4aLFJwc|9Z#d7`oNoVxFNBMWVYmf?ZDqp3
z>yU4O1ZB^HisyYkEj~^>+{p@a%YSyZbwP{_QC)8>YPPiTzNt~-Cx9>n92o1?FsS;;
zwz9h;e2L)erLfEGSizaEa-9gNI^<?Q`{2w(R6gscLy&LngWex1`7hd=q^T3pmXzO-
zm_Yr=^q)fzB@GmEX3<hh$FY>X$$vI9=%El#9-!iC{xXD_$^IdGXOF05dv|r#aU9Fl
zCZ<bMK}3daEAdV%u_Qos{R6v!a{t6|p7%ri@`e@(tMF?6(>DT9PVqvrZDziE8rR8M
zI@O)?=mqyPJ5qqqfv;A7DqiEu;&_!6J;IZ(J<dOG2=exGd^&errfLa5A)`YZa!h7E
z5O}woe-~3HE*%M#?Rz90IZ~Hj1$%tcIi4g-5h1#iuHr|J{3+G@wzA1~J<Z2~NNMob
zEUPacWjR<-OHuinKsxBiZm2Ng=o0U@cNd~6MurNi<gvMTvK}1byK$dc0|4?E#&-?*
zFcY7i(teUZ2SG#n(~EMrSB6rmBq-;Xru9SD=&dXIC5t)GT^eU~7PAljw$2yxM36}+
zr8%uU99f<9%1+FP@^V!T=6-v4rSr`jZ=+LELmXQVdm$t{&+wCnlKGC7gxhfZIC-+X
z)QRdF;cww$t3fdoUg_$vcCBduE)@PpM>1^6S@A3W@C5}eM+vjvx?3I4v%*=t16d8V
zxqkB2pUP{9yAp5MWR^iRAAjAz5Ub*C9i3Vi%Fn*3<48^GwWvBSLn1|62oi>&*}L1s
z-2vo;IsH?!QlBkMV8cwE0K{lq%I;RCcriNh#|3M%@oc)7&k)}O?mR3C5$CRbh75QW
zDCi(XrKg%+&Q4VIx4D##k1T?LNqC$3qV|IiD4Styrn&%rU_Db7*jfy>TfYkAtd0i?
z4>uZ)jQ5*Gok+f{a_8EbQ|RY6js+*V7cqSz)tpN=K3@7&Fu45AMV%Jj{|jwybCLKh
zWl&?#7ImV$i{R=1slhZ2?2IJKNk!Hv_UUQoPzc()-v<@Yd-}pAbO^Wf`0svmv_7PK
zYhhMptwh-D!uoIDc5N^yM;AL%iZKk+y|n`gNH_@`uibssG%zp|h1hfeR=zI)=+xOC
zw{iQ~SC!Q&8gE!X$~V7zfWCjxAfavO)r|9^R;zB|zN!l0_Vj=s@%Hh=yP||A+8i@%
zlKJLzNYyAxV_%``<|;nuT&TyF^BF74r~SVNNK<Kz@=t#-zYJ<18_qM(!|8q$B_nE@
zy=>z{oPRUseF08yd6W-?7(~H?AKBHF9!Hu#{G+?2WP3mUbo|$<j_=^cwcd_;e>rlk
ziEc!s=4Iv4qX0wS#8Q}4IF^BZTE{v?NU1`wGKDOL%i_Jt;;$iHG`&Rmns(kl6DxCx
zQDILE#z$1lFDb9@LqZ*6LjS*Ne135ZP>pM*J%YHMq()Z3xJ$QRyxvF;Vn#1zmhQSq
z?<5E}Jqb%*raY2@g(u+r30ODpThaqOR}{bA7xDEUDVbsnyhA<hhu>mD9-GT&?rPXl
z0HXypfi1X~XEEZUgxO(_o2?v{>A8r?Dmq+gDSe{-xfL3kLD+(;Vc*rG`39u|q!<vE
zyMfJ|8&ixt-?$xuyuxoCzXjGS*&{%(FtGdbXihpt>4inKI-8!*_#^$I_BY|`>Rq}Q
zs{>BS{9W-dmuIVr3dplYI3?{1j(_jMDDQLhavvwaB(KH=cZ1n+Z7ZP#@@y{4LR}{B
z_|IgLlE)5VsG3$#@GKV$=W0%|Ix6r9wT9Sg9cc?~VPMMzP*}c!!`4i4qRonBL6pnQ
z<NV5(OS8Zi(R{RbcZM<K(8?l3UH+oE^vLu6vp_p~q~>jA9(Go#dC^=l|DSSCH*kki
z+n?2>#@$d;XGyp12&th?fnS0Raj!&nwn#!ah0mfx_~shGsQg~aG9{-HsQI}sC>*BF
zy5e{0)RQZ#d&VN>$KsmUdzp8MXjbU20hBW7^O+`nIn-O@Tsz+B^;<vsa13yyLdxxd
z+ZRHm4@csac3<0C$$r>)3z_t3TbDRQZ&`BkeOm(f{23%PYZ%-qP`GkNC9UtgNF`Yj
zALTxZlpy_%L&2KLM2v0RC9pCcU7%qa%dCt`ZYOCyWQV`Q3%Bz3#z9jGF_u4#LP!aL
zQRNJ%>Ux#t^S4xsI7BU!<ZVtzL?8Hf@sVB4dj|x&7$beBij?0=f>t6xFIoK76G%F0
zo@)f8D6MPq8#oOK24G*j!rT`N#^trtpbb#bXZxu$!)h&B)kJjs1;}<pJ3~UnTLO}+
zo1J<x5WhH|-j#hAhk<n6EZ#hHm5>hXY;~~+l=rXJcA?Cq9HAYf=e4vRn(4O2j~XDP
z$KNiEZVabgr5gRl__yYMeT#ODbg7iQ2+bdz-hMRBe_f8FRhD8P_U<td#41dxT;ou?
z$#s*>c>RJS%D?JK*SlxLDZo8!_|brw!Tl-wv0^<9vR$ixgBQ~(WEgCpKWjeww~p{-
zK6&ZR&)DVC_grCM!E9E^0ZU8cAZW|R=R)vg7vgddR34?=g&Ltk{uowKD6FBTT9oN<
zu$BFG^A`5+-_Se1=Ni|JCSuc@8QOy&edFr~GfeabU!XF)Io()OxJ6gFs8F$=vtqqQ
za?ckRfbg*NwE#8ez5>5}R;w(ge|!71BW}N1A_s)G?72}NFh|HJ1|t1e`C@NB*#!D^
zXs?fLduPc{a+*;`iwBDR??h#Yr_OMVt5uZqj*|$Y2G3=J`Ukws-rE0?G*nFlH}=s+
zu<@0?&D<XHM-%IJjw9Q3M-62~rPJf1@b_m^wQU{y9&cnNaEG*-ensY_3?ue|f`{q~
z^47+CarNi`L)E#B4<{1kTfwYHhyyg5*W#@pxn$}Q_sNU4LnN7`4MabEfL~T1W}YJ5
z19)LG-_2gGyS^Y`$LDZ3=uU%&cARFDIS9jwi4K*m?6ve4ailt@1BtUd(cNDC8a9|C
zFD?ZcX@oJX`<hLWqT9`|HJql2Rld}G=`f3W`)+X`N5Ew}&Zq`^Kr7c$^rry^cbUtm
z>mhn-de%uR_NBtCT)C!j=6Z~q30ye+=$|Hkai$rE(4j7>!uU}41)^VQ%Dl{v_$~6_
z%3Q+>7l9pd7a~wY&c22I>5!qh7Pb8a=(fliGm+e{=pTmXH+3!M>({18l7yDUq<DD>
zvn$F|&P=wpopef+EmTMxkm0N7p;~aLTF_+gNDQhg4AE<vql(Pe$mf*_Bm!%%NjsgE
zD6N~VHLB-Nv>+)V@m3Z6YvCr?9W=3e`BCNSLZ8!2i7k3I?DU>Ov`Y_?+@<R;TH9Ox
zG*+fSDj_l^baHM^>2Ol3jpzf2@lte`rq75WNY_>hc>dM;<6eMLYx`f9l3?V2Jd5w0
z=y5=p*O|~fn<~|P$BvKF-Rj!j*oyF0eUhXw9nK5%rOT+Svb>ofAJ%GtOCY0$GV5p@
zF27gTxh6>FaPXJ1OY`yb7X)?g;qlC(-l~5}{{(pnM;t%g7B+A8HDzFmX7+`&gFC8{
z;NziOC$^52qBD)?)5odqwhZnST{KcWc?05P_~je;W<Md1pXW`w<x&wV+&7B~IxJ~q
zf_ocSXZ)_hdKa4-0Gdp%c8r~b86_c_KTI9LH1X`q=mJgZxLgc6WuijW_kcUK<*3dD
zW`w;l2ddLYEB&wS=CgP_8->)@MvpT>kj|E<8{q1By_R@H(qBY5x_rFcqlSa#KPNLx
z#BlG*4MMUE_^DSMoBS72#YLSxWTnGwGX@}o&(6l2v>@j<mhNmEFyln<|H5!T{ssW9
z>S7ITQ-`F-$kF(<V=O9?Qs=}}KS*0Bhfj2L94?C2i|Pb#Mpr`bzXei;bIFG<s)3Zx
z{)Jc<(KDZY-w%8jOF{4S>J;^GjDq@G&8#_F!Ge;1>&<Ir3~)`Be>)-eNw!aPB!6dn
znU?QS8(87>=a_$Q_ebxddo2r?CEi!1rtE#N{tEq$E(vOVO*>idBJV)m=SY4BX_i08
zk8Cp|Idj6MK5K!uPMbVgLffaXLd~*;&BRd2N9ZiX#c^vF>@NVFw=<#UJwH@+Imn}A
zI2;f0`Ej<Y?S0S93sV|d82`I`C&V-RBetr+Z+9ky0&k&`#7Q5nTBnDPSaZ!dK>fck
zTK_3>%RYT5gm>yb9C;9Lyo9#;rSk*#I+4qCCTc~;`pbDQSMyQO&IE)xg<>ut74CSu
zf5e$hV>-_2pV7XTTlDYFL?08~SNxvK+a@{0503K@SZt|kE1~LSuxKObH*Z6Auc5Mj
z&9`x!8M7#(Hjd^W3sB?;u)i`_jzP$8DmM^9*ABD#u9mZMjWZQBQpTc*cd3%p;<;mB
zhMD^GU&bK{AhrT_Gtovw+;20DP1Z}F-@S7=EVRg+UT@dooYqQ}mw~yB@0lvfy5~vI
z&8w)O$dkR5>4qQmMRTTxft}8Tma)2e<2OzK>c1xR!^A+N@nUl94;WK*$8UutWNFnE
za*Ycs<M2mmhb!pRc`gRFxZp*q0jAAlAQDJ!O&&MzuiL83Xa8jYQNlbZLISPtRF+4G
z!zTn{AoI6wdcB}djIU$cLBIHIf36ZLC}N9Y<5Yrrda(G{pphUQ&qKAAX<l##sM`YJ
zNEqMPXxNhC-S<b<_nj>NdqdNayixReMB2g2AfSE-0{^R1?X?yjUwS9^;-#!bx4`Ck
zWb5&BRV$#ot<5_M9ar0W#iBgQcKr`JTU*`h;@yaW^%OT8O$u|eTs3qK7iUUp3fPzM
z(q5EyH%aHkR<9*~Hl0fL)@*pGRkQ~pBSqJiWXFu^9VFHfG5Ohlg;dOEbOGK%sVUyn
zFO9F2vDfy0ji_PwC<d`WF72cvxZ&&g4|N-}qjw_`a_!9<5p+=9Y`FPo>*A0-;@X<1
zk?P(fVWYaofhEom#MWvizjyHRv%9H39lp%=<fmqgC=%7L&6jnuvmA}E^nY9405E;a
zTHf}Ew0@tu!gr`Y3Lyo4<hfd5^4w#_A$4PV#X{B8Km%E&dyE$3avhQUZVc?Q-pQ@h
zfx0ZMF#4ps7r+_=_a5*0typPskpfz*<hW!F5T`za^^iCFNCOU!6dq_3R)^D{23<re
zE;MP5hmt})2@fQHtz%8#+SDs}lO=!Y1N0E=xRNILr-{dS@wUZ3TQK~g`?pBV?fi3o
z33t`|p7j<Vbv1aXwrR0t6i4iP_~G{Ra1E9Qw*NZ8!Mz1<jr_8vQwRO<nLU2T;_B}y
zy7`RFT7lN|*;#VOM-*I^J57^$MbI^n{{~DNi5FtekspD_!mgcAfXHR4@+ud9@7tf?
zXs=!C9lehuN>~&uf%HxCwy+JcCWq;)13cn+g;-zzXST`t+5q50t~~|o{VSc#{_xz2
z;o{PGBaga7{k07c*!OkY3WOD`!LDVPu$eLbI^yED5Al!ZnLlN9u7YFcf%qJ)xS(QP
zH{$1?hNvJ9qy1`MaI)tV+*F~1+w+;X<O=o=1N8;We922|tXX7B5-Q2fJg2jCe$pC$
z{4im;34T9xbj|V7LYeivpV?YT`?v(I#w91ka(k&wRpg|Vi!nH0gcqJ0tm{!C0c|dm
z{n@52*lE(>l*;r;)#z_rf{S0};|->n8X7n@>WlQshfOE{^Q>$yy=i=#8;-Rj0kh{E
z#QYn}w_9I(go60dYotRtN`F25x%#et3!##ft?*eTe*=H>47eu<meU&1QwbO8$0&c1
zdpy(BHdm~MZZ}8CN-)qKQ!7`8>t=a1pL9Bc)4M!Z!n=buL$ep!w$1))qG9oK9u>`S
z<*PDmArz{>xTk~y-nmm@A5bH!8V^><2G1;gw1F}!ANl^*UVF?Cbm-Tt7nfWAPcKu<
z1riR#$ep1I^>SXjudV;<0<z-KAs4-t?#U2zLw`m4trGIs-kpr>r}N0KN!$*VRxc65
zybr8JA|DC=IYqj7PdZlQkBQ|m^bSmtUUqgP{v_=>pn%KV5mDu$%L~`UPzde+CJ8^A
zyGPP4+cQ<m4)I$5$S|BiF0z<-<Mg>M{nByv_U8-sZPC4(V{hW4K|AoJ8-CulFSRR^
zaNys)n#}w)({xQ?0BD{6=MknV`+=(lwB=ZKE&MZPUHv!HCpi*89{u^J*!ufga@#rI
zE$|3xGeA`8sN<G+<RdCX!^Okxv_|@d0G^ze-DY(K?`G!TZI78oGttS?Df+7qyAs{?
zaJtFho+E@XHF98Ex{VhoId<)`y--<k)e$8SBS)ho042xJUHV;2$1)7)epKj`B9&d@
zt%*^f4a*f9UkClkUhb0Je~uS~m|#RF@%1$pncYJLiDDIm-)}bb*Rh|03XEyKa}P)&
zU|$x|uUY5g0JZWF>Xob=^duVna)DHx=#04g?)mHH9x#@0U?5s0J7*G93jzFMdcK+Z
z)vcDdAZRO(WqPvCUxR2<^*LnjlIM7YiE^^SN0G`!HRb|`N9YwA1tPf{r}g8}{ClHi
zd<(8-UWGSG#nO)5OwkEUg|0C5W=d*W^rb`=-;4Mb6%Eu&9)yeESo$BGkO!tmoe9>R
z3MY2cCTbD6PGxra)EZWppDMKEJ=qN#U!tMPSD@z~xExp^yf-SxJ_mp0`!0hp;}g#|
zu}#&xvLJ%+U=;1`Si-*B3)u$t>djt96FA-!)yViYud-mCDtxGaz$@!{3OBm_(3Np9
z_MS{%<YjJtn%Ub4TO4L~JatF3i=2e={%IMIV3e|T|D^oUl(8=`52<MW%H3esTKb>K
z;$QM{{8I!MZdBig<Ecuwh_}VU0@&c#DcnHZELk8u$iuDBw%=h79$wXl;W7UB_xyZ_
z_IK|C7KBF;&OJ(3ThbzhyEF$q^EK=Km$v^B57$qh-ad(6zN}QdXD=!0J?><n$Dy^0
z;laKbmUt985|W0PZ`4Qa*?F)XTnZ{JL_QjXtnV9L-ntGDr*EI+&O<sJQqrB<WQ^?P
zpCzpmsR<oL41**fO9((1g^ffN=E@!vpPGXZR?LPaBGs@a-3l`d<d|dfg4{Y?^LyoN
z+ke&3ZCO{;b6TH>QYQxeFm~M$WiLiAG0^Pgt5ZV7*BkHZ7B9~MS5?PQywB4+#OdWi
z)QR@UFG|&!F*9YZr;PB%bK9X25D-=JcorwnG@6#PVt4j@wimlrxCoX<R7FOyO=%{v
z8{Q<s*usl=43|8`h9rSAm+&aQh~+(&qQ3xyL|k`abZG{%V-Knul|Y?Gow73Kag*v#
z;|k^8M^URqgUw=X*TXwbM&xx!_mWBLC4@p7uKnLRw~BF<tP(Z6Z}Gn#_wxLPaeo*c
z*2@+{pNHJsHhCN#<w2jw>gDw<FPl#c5A|4#<k0^|3;Sz>7OM7H#mU8Q@xR?v@|!N-
zyd&Pm(;gx$*F`a`G2fneSYBhy5I*dNp>B2k({<~j0YBu$EVTCL6)ujlejv<>z?+6H
zU!eNBPIV95QaqmcdaS*cSOrk^3!MRf=*5|X&CJ<j#nIpra?VtSo0d7$GY2{8dUZS5
z%R!kyhrA7ttgYh79;+P9SW*~Fb%^JgY#l6k`)RVY^pw+~luHj?B8|}6-TlF&Pz}s~
zFwzbd<fSRD>K74Z+teUlhZ99bCz;9fGm!#_%@0}f>^2z|Um~k`7-^KUwQq#`M`(_H
z69p9K!4hYQ;*L&waV#$72y&GnQLC0y73yYd5RU>H3tmN3Y)`kLv?RwxSD+GatN(Iu
zLTpQ7Ho)@!)?H&dUf;GwpVo2dD&5np{>AjmHh@X_YAkPG2Yd4Ex%Yq#B6?a?^!uuT
z|7V-P)8w%YjEaiNc(I*?!BF_j3{lJ1SOK%kiBlejz6`mTz3!tr%e!~<93C%P$h-li
z#8)UZ#sX8nt3k@mr_Lv_%WcHWN6M!P--i<<)kruT&|6j}Gv!LusjJ_F{Y{~&QMRZJ
zMou0AQ%~kmT1#5pF7$NBrVt?jmFZk~PdEK+B$!ITXQme`DOuWWrS9V2qlB&aIJC`{
zlQf`Wu+24W?^rD9j5?nI4%A0zUmDLo!g2+_T~uXW3hJB-mzswxGtRSwlorfHX5;h{
z+1XWGHuDxB$#C|XrunjnT(C5K;_X+Hd}|BLT!eDd%O=nFHB~6_iAG@b-~@*ZH$}A@
zDg5=`I!^~RRE{D8TgL5?BE=t2N8%xy9wu+A2)74kbM~zIzp|C>`R#WQA<#Q-xxU>n
z!F|{j2KwdP7~4w1jK8J3ds#Uw$9pxGG_{2nZKu~fY>`Z2b0w`B!x8H_k7^3hN9-Kt
zoSbuhtI@wW%GB=qpHutyzp63TF|A;$1!5sl$bWDVDMMl2FIR%G1p-m`0kFolHTc%-
zd7wk(#TD2l{8s<Z9Q}qAg_(7F+xYnAzd+cBo~(Q`9D5S&CUoS!@H%cL2z^PYR4er8
z_|Bmjx0af~Q=+zO+EtjxyQs6aiE_6yUok|hP@L{b-75Sq8pP~vmc&%#od<it_z%+o
z=hj=n(fj2gI$npcRwgSLV&}G>vS|*IU$&&8!_r+SZkv)GuMC-#fZiqh82*o6aN-og
zg1sCu&{O---mf#qAk1#~i0!$}E&GpThh;Grt!<1hcZlDXkolG=eL@8`(h*9(4cq*Q
z6rh$gnMzB-G)5yY2FW(!`*)P3LULebqCpXu{TX%_fHO%4ITwwkYr8?F!Y>qYFNrC{
zqh+>MSYkgd^u%=Q#$_D6O5Zzsx2QDwKm<R~40UD@zwXvGLtjoZ4wqd;R?5Dr3t;`1
zsv1!H<_N!pNTKn7H-4C9$C=GG^L_1YWOz#GTWYwlPRz?5;JsP3-;Wt3@L#UHa~eBZ
zhIJchyMs|`MYI5^4qrBOSLq$|0`q2YhzYOl2K(Fju&SyS`%52lDalt{TY#{k!vs0q
z^+6T8ViJc3^LP|Jz%TEmp|Rxa%9a$Q7kGibb5fG8dNFkFf~i{cA=#wvG?4bNkMI>8
zaI7|r=MOAP9eANyW!h2ut>`~UXRKCpV3+$!&$Pp|@+xH8$AqWcT()f)>peQLeUDGZ
zBIpT}-B}uD-{?yjXlz5*d|}x1qJ2a&{Un2VQ=GVDAxd=t3vW5L^7pyZt2*@0z&Zzh
z3mmpKPzBP^6x}#1<*E1~T-2sv))3GXH<rI=3erE7YAFMMGCwU*n%YUj)TgM)z#guc
zL#A>|syg?$XF)5FlElV8K+i$sm^^wP2#iQ@IqdnSYkb6xevCewb2!AFZ9Voo=oZcl
z83Zg1iIxE84%CbGW)~Q<CN(yRrn@LAp5+7|@1#ZU-xyVdsPQ2-+->-<s-D?(lXGa8
z#?s=b-joNl2YD3O!V%ka-UZA}en3Sp@eP}J_#X7+)`EN^acIwjiGwAvr2J#CP3r`{
zGym1pp1DkUtrc3(U7q}NoqAfs|FhiEuJTh*Cv;B#Mb`~ou$Yuw<k3WVGWUV((wFet
zzlA6XEWywp%)6&jI2@K$<oj321BRZG4BscJ;6zL{qtk@)DdRz6c26XKw{<&zcS!t~
z!tjHmm?_@3z8gj74YvzT;}N*b9x|`~!?_+M>1<{N*g$U|9_uxDnrqy@x8*(iI!)w;
z5k&pOpD)MY^WYSU)A6~zf0|m*^XfSldK>xo?SSte19Nuf{zO>NJEP0o##w8tsLaI-
zu32|Rv*91?%G$3x@+O&P^-G#*y+N)ZO06%|J~%F2)m*UPBoXUrcY9Ab?98ll05@KX
z29Yy|Xd&vwJ4&D8&xrVLH1;7~x+5kQzhmOl8CqNMX}WhC8<Q!U&4@BJ=L95kYrab*
z_GrR2REKwswo=h*b*H0Pv&*P52jVfUYr_tg`rUdSUSiC<xkvo}En?X3btkVqUaZ*s
zk8L%V{al>Utt&woT1dG%M7VA)Jm<8C;9<Zkm3`%-iF@nf&)U1}q4HQ@CKOy)yGuma
zI|)nXd;@Dl9}wONJ|+hg{KIX9;l_`=#)|*>;+M@n)76(x!i0pd?#8#N<^Mrlbr9lQ
zzFlDwbBKuc3Xks`A(j5SMN)qK;Alcp{O%8}cE7DH3S{?FRUl<ZpS=Eijfb$AB`VKI
zg$5J>iz1fzYrzVm7Z|NG+VXFA-bG!4^U3|Qq_#p&8;R9UV+~kS%Rq4|Hr)4Y?OpKp
z<vu{G{fTUmVzrs@-rAyzk<a(b{!mC{IqaJ`w1k*I^~uqrr0~9~EHa<5*U-4=jHm{3
z_NJ)!LFeE}0M9~XZ_tUni-oyKQs204FCklk>$&>{quIeg8WqAWY$#`v;@uLWGGo54
zGL`XR{IQ{`OD+*IINUoleWY#9Aue$lSN%=9Vu`DHqfHs>@OigQ<N@2?eO@QhYhb`+
z8BFf(I14OC3Z7=?4}9)9Z8mc6b?<cJZIX3ANFs=1$c!KdVT9hbJU<#_I#VLO)4gg`
z7kQqzJJYWMk?U7`yVW9a^9Whb>&BG`z@tqpKE)ARXh9J<pe2GWpNs6gNI9@XBv@bH
z61DpEBN?=${Vn9<ABWW;<^?ifn_o&c$H$MXz#}Uq)OSO4b%UIX0>fo!d+*;se9E2T
zR$E|t>{eg3e#19qW*p>_g5s-q4uqULvkv1le<IuDA$v>?qUt;%$Khgs{EkpRqbV_J
z;2N#PPA_esClS0}8iK>%Y>k6wJ5hUS1wM#};xB*hH162of`4$xKQ%M5l7(D7oP^a1
z*1zWo{@*-K^zEKw^Lf}pR~mX$jaU-n6jx7b#e?V^^948JH%@JJCx?Vr5VMvj){88V
zZV^C5+r|sVC~Pr)qd(s*i@aDUoxxVX_IQaf+Bq9xHJ}yPDKY#(FuYJrIHnz#CjABF
z06b~RW01>9?2TvNR3dgOlFoigwucta3kCGsqY~_gzsQtk^I9J-ljf%XgU%pOZ{&73
zir)9!U{3f~2A!QrT+D4zIR5(u?r}B!ZYHy)+R9A&a7ZLL{9USq44jmu8u&~wP%&;H
zTlvI?WN?_kVtA!&@}~37I8wpW57*1>T1zqE>uXMzPltZN^hTyiS<90G3cL;dB3SO;
zX{d(?%wA%G7`>?!rf`kdunqg6?UY7kO8$3FKm6FSyC!@2!hBud<07-rkkJ5YXMP&=
zCqMi&eDmxga~lckGYnGeXK%VnySQWDKo2)p%pZNgl${-K$sb5Y`MG;2zKmQqp)xto
zR>dCqSE6iSy7yDQ!|Z#SPgO33iqdBn``(38pXKZ8>_GmUk__P%{oap&1xO!4JO7T)
z{V%YNithfwn!P)a{iR-Rxx^I%-T<s?1J}Z23-@L9P9A_uFosk#ypm*<3e}^l-HO|4
zvFm((WK?uu!JZ{%eSAFK1*keKKnMJ#&$hR&zfS`c&Gm9k^@;T3rvK$9-)1y3S7%S*
ze%(@gkKp1>K}>9Hyj0GWP&q&+!Uv<Br*iq@zw?L2IvJB2RFrRlBE1pSFG808w71S)
z;EK96ymXc;$OXZv`4r=PQ~K+AhPT|pyi46r{A#O)Iul)xY5i>cgkZ!W;#-j{DPZ_j
zM0)ulQR_{qWw5=2xueRmNPHuXY3w#J0QK`E@t06T4$$=k#oM@so!NHW{yBdRo>C*t
z>nQ`XH49>bvllV<rfN4%0^8SU7SLgi%g4HRT_^Q$DNXO9hpDv975SXi7*j;VsiOL^
z#No8NnjKHFOkAY=A@1h1M#)xwDG?@2ILoaiWXhl`YR{f%?<4X-=~6fJ4vzbE+3~<s
zk?gv|II8JN^=vv3xp$sOUQB!7u>*8vGfXvJDuq>_@tCBbJi?HC?0px6?-j$3+77kU
zogeN!`)Iwl(5g&Vqt@1!Z+4R(Wwp&jwJrD@<oVyEtppS<1L;9e6^=03D>moD94N=p
zXwx>IVd`QH`@av*jZK-GwW}VkSa(l!NVXp+1<ZT}UBvAF*lV>4N=V<#?S+t;VN+$e
zejqZo9^>D*ZecRlVsS+$GB|m!;lTJ@$Z3rKys(=$QEJxxwu|C_08x8Rt(~W8QpZZb
zd3ot`@ANJsX6N2>qABxuD@0|0TJ$nB8S77*bh%)mzkE1~mvR^+2=Lzs)Z*NS-zEdG
zU-&m(C)?=KJG^y{HQN&;)=xQCZC}5rw|dHXX(I$5;tRPp&|vgF+I|i_%q>1|TpjK5
zQx@fxqxM^00kalpAb8rVvl&vN?=K%L>~*$SUjjE881g1?#pY-#JX8?lZ*y3~F8aFZ
zs{pso5(}r#8KrwP(Ll6vbZSkA_Dp^guMQ|^Q5;vZE$rZs-ePfC^e+JAPp5${+T6QM
zg0DixxeHjt*_Rl?;d`f1(#Ds4GljJazr%mU60*y=&wd!MUEH(`Jx>FOC1j0*`#@Xj
zy>mcYYQb1N)9a1->6w4&`~sg6eC<NY-<?XA{g=xo>4ou4-2Q@Q^%GRW9B`229wJo6
z_p&pWPArP5%sO=AH;h*Q&fTi^+fNL7mKeVk=!OtNJi9|rn}c078gE@M)@W)S3X$2e
z5o;^?_7;jKAc$Xu(;bUyB82wbkWn_-Y6K4%w}T)_q{bQB=%SZKiZ4x@8ciHL>1nRr
zziGl0kuqrLuCBAR5BUMicTqbJ#fhP^aHamvROG-~zgf=el)RKB7L?ATTw9><#u%J~
zRjvY&VrTw#BR<b>ECw^mWd+>_57_QnenVZ26Ix+l>6yb{!qtnu)jQ+;dTuMx{|CVQ
ztExlyIC#S*0t61K&!B`c;Gs5H2=ubf(&IX*-l;+5lagJ}(m$GPo>zj>BQ^R~O%`Fi
zyU3n^<ur#JepTw^$hbZQq)1?m-?&4OB+8DSMm23Mp7Rd(n#eeVy1L)^`~FL1W7S#o
z>Z4HPe<B)SdcryOM1DO9ee*(5n8)as9rIM%IU&)@YQIZ*8qI{dJuqdbLpP0b$eUCC
z2e83pm&XxJ@;0^z#}eL4l!V3hk`PM7`8F<YDn$HGzgUiO`UX%|Y6CM&Q`rbV<pL3K
z(QnpG;ld^R=?*U=wTetSUX?jCPwJ_>>Pa`xL&s%iB>UyzF>6VEvML8rUSk~b6`daK
z+>`Yvp59D1`qdAJO+(FSwu#ew8r}Q`4T|!`57dEdavMGJnkS!Nko_A+!FCI3*^I?&
z`pvmF%dYJfD^~;p{uhW2%%lOKOa_F#Pm^Zq?pBhaAmi7WoWp?izrrdQcUaJN2s|5;
z0RA;uyZxtuR)gKjeC>pT>TX_k67^>18KVPPw_*6=2nzmk)i}rA1|R1~WCgGot1@XS
z2DUb&$@r5s+6|iwC7DqzY;TxmR+&cqu1+_&$5wSAZrll|+(W<SjgpHlbS{7vW*trF
z4B`K+e|-t?Zl4z90LW+u8VpV8${+Gg|4UN6<S_mP5i~??R?KH7Vq>tb&8SUeZkdL2
z(rnbWjN!i4u5VX>Vf7s|)rwHMm6OmN>10UTTwwbgLWdSgJ99X}&Y^b<Yg&BbG{=1(
z=kE~|J-_bnyXi-1y~m|i7wV?n@WiS;?c@SrV>+ow1KYHc%L3;Ed|@s6BGMJ(6wA{2
z-z6eJjSsM%>qavoKOq{szQdiae35%`6iD&3e#mfVRZSJoTj}iaR6jqp$$8{vRCeo2
z9Lou)uA#5l9N5Fy<wZF^w6-%#tuQZ$L~_|SlcLLcG4C$nc(|CF6(_!5cmK@@E&p>O
zGJR7sHav6K&_x=SnF-5GUp7Z5((`-{(6i@rLToRBy|>g#kfb3^iL|RwGmi_4&}{bE
z$jdVCL>@hzC3H?wAiSEt&dYq044%Y~>v7e03Tte?USAK_HUU;MT(%Z8o9)qsTuBcq
zA`DSRiF!}t1{sea1sL4hqTTrafN1AFfIn2Y7y=HEcdyOG6Lq0IU7tS^Y*SNovOx&h
z5?MvA`=K5zE>CCNWJtU)>1k4|$in`qR0C2U8<>56Oyy8G@OA&5E7FZMTNmY7764N6
zxq_d(fHl(!9O+t2+Q%Qn&8bC4ra%2_QC?lVC%11(2W`<vGT!x%H5~Q@*o90Q6!)2V
z;FiIW_611Mvp`bH!J_;&E1%FKj=f~4_6{yCxa~>DO1!mb(7`-Kiu0mQgtsB__a(E&
z$@G4L#hQX+`Iq}>skX6kfTh2+#5qlQpnf+J2*6H3J7ZiSIcc2Mw&YQz(F_{B8<HP-
zb8w~r>hcA*@9*-mU&%U2L2?OYv?FO|-p08;#-U}>Oc*k<IklzH8GOJef=R&f;Jx)j
zYJoyJBrV|pqNdRhEZTWR6d(L5R62u!R~v4@4bAy21k%f#4UFe7zDH)Kz*cK7I*Pa>
z_s=_Uwh)ecu1Jb^E_?@CS^dmT8v6fQOoF@d8=veioz0UL`)z;Vbw~8PSC?wi8v)9g
zke;i#aq=;G$o}k6*|WRpa`8V=f54xNt2-=CVgRSKBq<KBBA}hNii}@DPuaIO;~M-C
zuhp^DPvM)ZD#fCQ678CKglF6N_MlOz<GGPhCC}ri(LZDV7R@b1yaI>F<_wm7=DUv%
zY3Uz#@rVwi-Bd1Ci0__lb0e1jqG*;LXed9SPCVgi9a@(8dN-KA{~Erf|H|j(vG};-
zG}hyzf+o(epD#7MewRFfm({I?XT*H3agNx%1G^ym<gD%bPcIG^%nyxuoWRNjee#t>
zSnrO<w9d5WR)cY1XS%oF_M5jAA7orailrh=^$}>(;7b>ESquPQY7UIqHS7L1b~`WB
zV?)TdqiXN_X^f_4yT}6+C#-Wx@?atEP1$)WXrVQZci-+`Lvcdlf>_B+(|oa7@JluF
z$PcDRfL_h(-h~)=WZ$oxf{>1Dkr<A6t2~1HhGekEyl9q=MJ87_{*L|wzO#AePpvIG
zk7SfZ#rmZaf`7``y}#nUG2t)mCrPp6VZ^h0^vMR7t?dm5&U~634gB1Q^4XHAyE;xv
z;%MzYF5%bEeiY;@;#uwPa&|;imFvRJGxv~H1lx>!l?HGI&^eSz%>9W-7KNFAWuQgV
z@7rBjdKm#V8zkJNqVoa_F#unyL`Us?)0qi2=RsR!!1exL9U2Ce?~eq8R2~tN7sr+6
zc^AT#=sY*~(8={Fp>gt)XjPZ1;IU6K*uyyUU(FCH5y3n!V^yV|RoyxC`z;klnh&0U
z-953AdMlZJ<ae;RaB+^V_0%i-bP%-5WThv~{vpDnZC$9ZfAit|f$<8^nuMvZz-PlG
z-%UXyw>jSv@YJ~LV6m4;_JH&=oLr=@JazL|k{J>-MgE&P-<wzVC20_O@^Q?8IQ63W
z=GaJg^VN@7|3WVMcndYQ+Y6tvZOw)fmK)F!nOU@mjFyYetp|{Y>v=kPqV9I3yT0z{
zr-hmp136u@;r23MVzmws+o`p`bS}^QG?yr_tx|f~oq6+Fa<R<2H|)Jzhog|qlcqTf
zuyanMvB5!{e+zU%byQkYp9tY){I5}&F_KyUl9$8PNXuVR#@?1s&ORg(&=kT}fDkuV
z&y!i7xTQ%HP5r>9-ezs3GrkltI6I4vy$qAK<SA<)<!4*ySEl$FLPTye4DH-b#oswZ
zp9V_@%Adu)<9D<?hpl<;piG}|p7ru2_%G7%X65wAm|NHTAHj`L16}=zy{u<Q|6psr
zt^Yvg7G>Vg>^W%QVW`Ojux0#Ru7BLZ?<*p|Tgzry9&T7CUW|)?<~NfYN!M~qjJ7-u
z(c$S;z7gzW{tHpb3=rvH3d#KU5G@RQeFZ8>g}sk6Zma)=$sa4RLpz;ivSUY~^0(7g
zPUP<?X)o)|m$eA~$krqre!DRV2W|IOxrUAhe9#L>aC%RymKYNc>g1djPgl8?Iqx$S
zrX|OiZL9dwKg<hS-;D=tMOG>FxXDJmrz9_^t{=(h6^zcFyZL&q%sBCQcwBRmRPl4G
zXvWO-7A;(3qc`<1A=&hxJ$hmdAlPhybj81RT_jgnIr#M7&#5UeZu6Q1%0N=QuD~Vg
z4qHSv?IdsMIA#e4{@dJP{kOU7GG-s>-OV`+SJ%>-M`qk}d0Z%>-4|_mMyl~HI{=%w
z3RalunV-rDp-jZm^kvGn#=J!`-YXSQK+AK>N1x|)0@lGDKaUWtRiC5G9%_|%V-vNV
zZ$b)ZCR2CiIHqpLZ>h1{NWj1c5^eP;kpmjNZhI^6uojlz!fixFdwkMWJNc8_+Y0HB
zAZ#iI>w3$jKxH(Cvc5gKz!2*Yh2>v{d%UD^#y$Rs@rvF1gjFu|OJC{c8jIRB`yc90
z5pg>j#<$$Sum1Tuu(m($Jylz+^aR++<WF{Of2Bo+w^<+1TCX-U(oo4~&9Zq#y?sf7
zM=NHq9W)a3hbz6xVFsiNd0s+Lt1UojEoPoI)-EFd+Tp_ErPUq))>iW!U589S9Nzth
zrkcQ2!TXKJyn;i#cn>q$pfD!ROcb2Hbup~T1?wNW>n4l<V?|?yV^&Zej??NPv(eV|
z0n)I}!@G5(w>Rh+iBjfn0quH@k|P@J5uJp>6ieT;&F1T_(1~CVuTv&MM(Qgg9%scL
zub`!XC5l3}w|NZ1b_tSXMFE?K1=!M|lv%LGiRuTE5C3jzC*j$F--?9*e2ujhh|so!
z>pC4D9zbJ+bKHYgE|mQR$O{bF!=<0AxX9FYW@5dpvkJaMo5)-gneC$i7rat!nC6|I
zr=yOL@MtpopmsBuBo*|cqvYle@W_K~9mi?g*L|!AxuWTak@^`nlaaXl6S_|sat|g`
zjOW;Hwr5+fpk4I6PJSvprV_pc#MfvQMV8M|Bp+gHxTa~`I+7w@TR!XP5B%GaMVDj(
zFFX~g46NzeO=frgxO)<AD@ZXKb>=)g2%WlUDjY2R=FV6mi_Cak(_g@B`NH#z7>6!O
z@lxA=ERd&G*)Ahb(Ew|m>x@|3(XlPNr@|gEu6ArtX1cHvUTnaN!c*j0R&>+=#7i?f
zHi#QK{RJDffr8WJC9C+hM$QI2Q$Zn-Y&&GHD(5e|rj%z5P>mo_djY8xW;bwc_cWLI
zsYZTksULOXMQ<G^sc<oXe4h*GTT&;LbY8ftfbpl)zHHHGF<`i97g7lBmXWtq3DK~m
zZ}|JDk?XtZIy>&iUXm`SaaVi4Ik#U9z+X5Re1Hmnve%TkE}mtqk4o;8lp(68nIbRv
z%6-I*9y~9?f>&VYLjaS1B(w|9r025{2E$HlqK}Uvsvg_8`ctO5u)Q9I=Iki9mQce=
z9ml2=hUt#F;ze%1n`t3mkI*G2YbdO>rcAs`B|w?}ma2CWjoDPoL-$H`K;c`aHs0TZ
z4Mx@Xj+Ow<MB5b_{8eV>6cLKbBaGgZfAXOoWQkffl=a&2m-rBJx@liqOPkc&AB|g4
za5)CdfIU9{o_Rf&>?#`%B$F-OB7DDYIA`Kuxi7xTa@O>Oq5y!67ExgIJK;S6G#w<B
zcAeOI&}clxdA><mb@yr|m#~+M@znNt5ntWE{2Hl@-KZn&`Hrtaou*5VByl5%IUv`#
z`T9g&*GtKzTfU!_i{B<!A@h~<j^X~R6*QM>-;K0o0fl?5>*6%RGhe9eB_eU9Q2nmb
zLK{Jj7Q*~PsJJ}++Ba1CSjM;Xr}LpCom(ETJeQ8K|GC3^Ui#h&TK2<3(UK3li%;nf
zotjcEGAs6Soh7Uz77NP=HUH4BbOy}H2%#NEuYnEpr|uv%Ce-IF-AchQS?{R<4h5m7
zExL%k)>iNBPz{Al0I?K;rNOD<Yxm<DdUc6!Oxvb3XlI>){c}lQYNOZfyXCJnR%U@4
zdWnJhJ<@BEQeXjkh%x^#I!bQLAqW!t=XVprn6BzJy~mIHmY}dDN;Dj{0Ztdf5>>KK
ztM4TDFaxBS3AEnfpGRr5<AT0Tm@hyBxg7TIrKT^Sdm$&$o5qMBhnlXt)9eYOe2@5u
z@VIahlP1F%vlgt56nQfioEdVhLA3%|QeZJeTC!XbeztKb<l8UFl)z<V_);4Ext@$`
zMl3=aJ>juAh#VcwMtFDuzBL6W;VM1@hL-Io1CadMQh55KeDHd&r|^mqvYxxPdm`V!
z%D==z=cq%I%o02KG06G7XXAi_5)razql0QXOi<BD!~FfK@MxK{s*kX+_mM5R|M*+{
zn_hyv75D2W-7NNfPwyO(?H>;$#jP6isrn=KO#<^$t75?+yB#ru8}Ezi<iL{x+SiIh
zFs?uK{oAnZ-I^T=;Mhd$i+R_`rXgc)9FMVWpC{)w#M~(~>sN}Uj1NzdDq)r^=7QZv
z4krx0tu9w5zWDS9D@u9xTmFl=O>R30kkp70Cp6%$c0yvhbzXM7S@bXBwD>pQ^!2#L
z?#8vO*zf*d(_QZBEQJNJrhPNfz7`tL99<2q@c1{ve&uP+o9wb9UdTVloDUNB()~{@
zCeWo`#^d6{jo&lZF04sdG6~99_M8X9@MN@&np0moH<iCNHY2d+6+B|KHwp%g*Jl1+
z*cj6@0zSzli2)xXa3u&b3^)e}#ZP8o|M~8vNleX^`q75dQF8Qv2@A%3LY@F9*A+VM
zTIi_VT}cJ26*NYa{JT#zDl<Sdd^hC$C^rUlK)kyp5r@)k+GoPLAfR;7C8gp;6IVJE
z<n!=HCZDxD(8OdSfzKs}iEgSOD+VAzZ8twh#_0c6)wtrFKS$cge=+rw80ZHU++`Qp
z(VR&Rjd_$a50cSdVz-UV_X2WnvE8B>f$+81HyeP>iOu>Ey8B%m*Vf?Yo!K0yD>9=s
z&6G_RCJZ>b`X`UvjV%=@r()C#KO6x+5(8nWbh5CKe#LC5*pUZkE`et^$Oscqa3qis
zr?*WWy!ykEHK5Qb@S)<|nf-+~SFP&P7TSZa11ebQ<{ybiZ6|p^yU+EH|1AM4$Ib&b
zz?g?j)9=SC3#T8SI(?Opg4ZddPbBa-q+TTY=!a51`T%b7E$?*r<C8rJlHz9ougg}m
z!aHrG#otcD(kC$PXOniUrjug65ldfSx!vs7k6tQc!sS*`Mu+i{{(M~7i{x|kiM#PF
zbD8;f;EQ(zfJ3qK>7*j{Sk5E!D`3H;0;e2xu0e;nx%10nV8@x8Cn7L%*^8hHN>wi-
z*KW)rb30-dARX6qz1a07GlJF;#r@BxS&$l?_b2pbo*VjIIE?(R25)RP4S8%+w~_0J
z2n9xj`y%p9Tym>5s+H8gL2)@W?ZHqdPxY!*L__T1%5#96)?qh#pAElTbQmNJlk7F$
ze(%J>QoUtu0PT%6OUz#XokN_GIYhIyPpz{%fW{skPjn$(kq?9Sj=tb{5T9(j)3_0n
z4LtCOIaAF0le8RsEV0xFK97n$N!*$fiXbXJfG>wBfbD17m~$Iq^oi?XpDj0GX^p^G
ze?#pxaIQ6PJ$D{RC_Bsjf!yxO%VIYizpM9nZB`|0K$W&c(4K>_<5x2>M6+gt=Uz8U
zzXLx$>nH7^^8Ii^$C)-TJx>J^-h}ajN1L;J*nFnZA%MA_O{eqvJ1Gk&9n7KgRcTzB
zB@K0~_*xlieD}q|a$?~7q8kSj&kMJ8j>z0V_MEEb%EDA?Q=NtUMTuxT&%ebQlOc@q
z>xfQh>*68~zG}~*?fik@xfA(;S)sM?T!5^K?vKjZU7Qqv&!gG@<1C7itrn+}z$IBL
z?^xo@ZTyRXMi0n#l{!iLtnH_H>e3t<zSzMQ`oQ+na<A+h+V%TcvMObw*V`TFNZYAQ
z>sCxDEJczY1bj$cPaaR(WW~wyGR(YdI_re~)Oz7X>{<-OYn>PDOF3jDJN^wPTpU>m
zYwJAe8N9aK0;vLv+}~g?nHd(EN6*Exauv?IEPJzmIh+_RE^(=~u{rj|PXp;;-Sl8b
z<#H|;mjnkOFE}8DzVT%Km^afiP!DI5R)6ot?SEUNa#r~Tpt9rSRIpeGb7UEK^Xnv6
z2-yW{v@pw@sX0Z-<B2N-7d+~2_OY)Yu=)HYp5r?-Ypar<nqCE%lzNBlP`C4I`C)~x
z5YqL#7>(@c%hG*=@W`FAuTAMI|Bt7)4r}uN!@j?Yh>|MOX#h%yG$U0+R0Kq%Moe0m
zv~(#5h?Iy@5+VXBF={lMbdP2*I!AAe!8XR&bN%k;xbOe==XM>}K5@R!^L6@Ewvvq~
zQ1#NrCOS;(Q>@0}guhDQ-M-md*oY<deE)<l4U@gq_@WbdmbZ>X`d$eCe3>92rz5^w
zr4dzI4fr4&BZX&41Z_3z?c*L;8S0s+ZJk~AZWav_Ehlgc2{aNi$X~psV0B69)%;?Z
zYD{(4d0($dV76cxd}bs^>B~x7fYuU^ZE@9~F|t`W@OTwH)U(UL1n83Jw~Wghkl5-+
z>z~sbuC=HK7V}XNi`RHunp9`{-mya?_RDj!LSEi3P6z_&kO0>MG{*cy{>henu!Ju1
zs6eZWk%an_EEeI;Id;WAAfAo=#RzN{HZZN-_y1yQ;hHiyq=l8J8vpC}qc<Kt{u+^@
z5nf9-Lfxe#43K8xjWsvI7HtiDN~>)9XO7_29=?_B+4oP4qpTaS4}5&Fd*Hnf`4WLW
zldL&$VQw+4xRGF)>e<cd)m+a#QzGVPI>FNxL$A&T5*gvp)?ui^JqE3J!%$h(gD630
z`-nlavD%!cu2C16CjNIrAuG8z01l|4&Bm>)qF87hk4|?-vDXpH<hubKVdpphI_rsT
z40jGb$CF+MLnrroH*Ut?+=i3SbWE!puW&WH10j6cOu7A$&|Yo*mxH$A3d*XH(D``>
zMI+$Yl2-kd{LrrLP-w?h(kJGvl_D-0NBDUiu$7N}qFwIVA*o)?=AmHLG!_U!hb+Q*
zvk(^T;I>uGDfKJDRl+p*p8ZPh;*NTc^j|!7@qRGj>Z=LHY<{kgvX+xnYOYH3M$#jg
z`w@G61$<+_IaNLO6l43=<KKPo35U>o4$DcXUH?ho7*bXJyY<EUq8A{&=Nms$Av*>D
z3hy9W*U7*9+4GLb<EC{URqSJ|Em4b=NYV(&ITTLx1C;ti5sZb$1<ij;rJQ*9MgjHb
zHtapijcmCuHzMcjP_@1J&m^|3Zy<Ll8(DvLuIn(}AY)P!s&6tVlK6bo!mjd@4fz{#
zvKbO=`JcKZOi(W+vuD>2hPWiK*q(W2Xs%OI9;j1YNI+Kwc)n`r3?j<cb1uQe81ly&
zQd*j=V#J?M3xkRejlL7N*s%hQhv=UzGtCbmj&0H2%D)8ZK_h5l7Wr*Yvv<YCQ%vOn
z5K$rwJ(~yRU<-kEDzf31u&h=-W<;6?x?}{t`v~2i=llwYG8$)PIcNpn&MDUx11%DH
z&+*UQ%4y0MN(10|M~tZ~)>CZd)?{e9q;_m5#4G6#5D~3%s_%RHrXeRO!YYvO41%<h
za<lI+AqmxDANBtB<-oog3Z|d&VDCG0<JAW&hOeMUbq4co3S<Q<xfwB$QIeJHx13z<
z+y5T$IBleT9=%Ron98_sn0T<{r+hD=m6`O!7L(2Hf=(b<XZ!Yyw9MK)J-U8-s1q@S
z`k{HceD*AYdth#h;FKGdtuXdtiZkbgstK=H)hr@i`--(+SkaVuB}BBMh?9R6jICVs
zbRuUlQ}we($k34pB_qMbFL?!}Yoxv6w9GVIu+a@Fbj0Z8dYJ0*#^2Jzf^Jq6>3$de
zrL$JKE+nWsiiyMFZDfo*%Mw(mTu_@J7uJ(uI<FZjL&6X_bcYRunD<zK=OG;*&A^-E
zGR8!#H#_djEQxEt!MuEqp=?H_Ye)tSz0J8#`oi)787ZMMym|5x+>nrgzl9K?ZPwwD
zFMfqmQj1U~P-EeH>KB{UQ7V`^pPq+%DCS(GiZ#6-e;E&le@=f?Za@9+%-2i?2#bXK
z25u<4AXDh}4r~?L3v!S46fk&oi<dC9H~T~&v(S^q7Enb7I~ZCVb$DzVo8M(TfyW4s
z_1@_VEqZ=e>KNKjnmK*$f9DBv`#si{7lIKVa1oXH|H7Z1F)i4!2(r7f;Q=T1q57>t
zW||NY4@tVGVS05}f|(jk+X%vBC}q%f*|Novhp|b@p^b8TM|3ympDyDQOHqah_c{2i
zZvUGjD>1)oCt%(y(CzJ6D@cC;A;RDe5p$m&C|_OWKdSG;9VSCEWvNySjd|kH*rUVE
z`XHarux8;VkC`5A^@$1>?-Bm3@cV_QWT+IsMajIc3h92U<v3_8M8`45h-#7ABtpE~
z)a7{o;N(NZt>JLL=L-excn=lag2bu&5)4q+Y+ZtKeWiHJfD+vA2Zn>1^VzkwGr@3|
z6lzvu3g~wk+SX?*q9Up(GW0)7n4f1Mj_=v1)y44LWO}|`jN52?&k5K$6xDsR|GIr6
z@L7Xz=i}Q0-GYD%5xege@?Fgsgwt}fb?-=PG1nB;1vgg_Q>oWQ4!mlg(fU+Cs8vc<
z-gL?yv<bf`_U2(q>};l=U@p%*Rd@tCw68ZkEh+_Yyva|8{{uMQJ0LTJUvAQz?Ym0%
z51(nNvV8o_*YoZ<B&Uf~RRtlOwLwU!p3gs+{;_y}?B+p%cbSUC|B2-782}Aj9D_fr
zyz~WC6yt+#q08vQN=n5DyiP8@v~QI9Q&#cr=0k|pZ&-P#@m{iJ4tOrOq|rqvIXRa7
zStx`-{RtlPHC>Bz&F;*kB?|!ebCBuN1qZV8A0DPb`dRrzQpCe{eR5NR*iTo9(YybR
zdA~iwN4PlayTH2=A-qkQO^5C_ayY%e#Up6&Nac8=0~p_#+z4l%4=-jSt$`QeO+!I)
zmPQc^jxq%<K+WaM&-?{MrhCc;v|y?Cd*CG6M+cb$7}4LZF=-W>G+3c>f&8zefH&#C
z{Dk_uidz=}qRENlgrKOW<0bL%9#iZM7xyTg&D9s;#~90zO;%Np0fTHyaP813Vwon_
zR3Ct9(({CWP&$-72yqyi4s@45I=oY2+y9)?6oSD2Z$fx@-j4TtThrb9PqwC}Bji5+
zTQL175^Ev)qTnWch_rDIXP)>(`zl6u#io;kPnO1+JMn#J*~k1!m<&ZouGPHmZA{m|
z-4V1|+xBC^*$z&n`bj>*<;@89KK+D*FHWz__(rXEwS7~nu<&cP-OrJ1dXDO0dbjE_
ztuLz{NRZLlsCiODY%#tMO&*p~rNIB3V9p@%|LROY=TTuhLA#74iRI=Czsuq$iU6~V
z?lSu>^`sT8Hi8yjeC91#SJYD`hcX|6<{1%zUPH7bp{(x@ZUlY4VNpMzX<SNm;bR1Q
zb;I=n$3<^5RK)k7-LAU-TBtBh`S2d-Sb&!q%u*C^OqPjTxT8T*_&hK9C_ueTQI~~u
z>WV+$C%XXy_pR(my3)+T%_Bf3MWh8BeoyXMTFgj40iQ@LI<PBlg@6E~I}^1t+bB4C
z?G^JyS+>2L<8Btu8Bj@_wm2m@Ism9NEKQ(hkRPQ))$s_^?<WPTQMu}v0IJ#cy$feY
zq#Cw90m6+z7NLti^J|#plFEHEUT5*Qw^kOGk|dg(;kiAso7a+QX9`{yS}el%ZEaL2
z@YcD!XM3>942M2Xc46J`=C_f<Lv{g$?Kwz;+~7FU!$o*WcR11h6t3($Fs`!4(M-T|
z-Cov-i71OIw!x3Zq!WO6Mz7G7h{q@HMqWnl3f&*5iyI7&1++{Hme8ZcbIP5qsU+v?
z<|+sdukf#sqL%Jw+UJmyKxT69GdYxR;hs7k?EmmLXu@LS_6O$<Hyy3`mMc<tO!}kN
z>h;A#6=$gp?hN8*4m$hk%!bjb{h`XBz$TbOpwME4-eBk+v)nM8cow!>$znwuS2%%A
z%WBxmz&fvZh|L-Lf5!J)XM!&P@iy#=3~7shv?Y=ZXPR`>rkwDeVCGuYF(<uDo-2@e
z)Jb0EE&i7mXWi<y6HUYsk-;PCa!i3<{*0=ZqC|J}gBMHb^eLH!sXJq{uS7&WuDpC|
zb(QjMs9HxgFEEpPxa%whp0JifcECOEwAYSp{x8oZwjV3eR`3pwDLPrsiSzv_<CPq9
z0>w7No=_*(Jh}c^+;6TOI;px=re=3F-?O7AJf;1?9Pvtqx6X)$a|6lum*<r&?7Kjj
zmb4*1@7zD64|Tlaw%hZ+mG05IlNA#fLZzNH`wKuTlKJAD`mM$(F(b3jZ%J$&mkV`e
z#=bDAT%}gHF{-#_M-$>tz?-nDp|^X&FX$yERR415%gz3^Bkwh|$J@{0#d{8=`{^an
zOp6XEta4|ru><Cm^KbPrpNpG4^>H(IcRf1$jp0X#6zoNi$Ew@4!_QLN9ozf{nyUth
zM=z4c8<TW-7&JtDPuxSfbC*mV3M?ci+Z1N!&Imh%fq<kRuq?#bUOdzbrpLQq!CPYz
z#hTtR=GVApPcfN6oVg1xU+w7I(uXRTJ=g2N!;}V<XaXU`&xc7sUdbWvAfWU>id@-O
z+UYC*O9fJ=^9?J(O#&-AlTgiV|M=8S-PfV+JWS3Tl9QLX!(7>fY*3g-VQmFbj(B*q
zZJt3uhA8)TZkFi-y*hAQM=k|pl=T$k+BLRs%>ZdCjr*>Z$`nsKU4}B1Yt$oFA^Nzd
z2xsWe?GlYrs#o*YD95WA<%1bifFtS>EHk%LyJ*-~4$>cXYYF|eFmI)|pfFY%_jTSG
zHM}<c+UXB=ygU^C0fp&nIqEZ*FIGA=`>UzuHY2XN`qepX;Tq|1gUTP=b1`|pW#nME
zMo--y(rLA{Il5u;oNYSVZw(Y;33U}{)Iv<5i?eTsAXeh575)K?TD!&c*Y7U@Q~xJ3
z!OmrBVzhf#Z?WA<a__9t)<h`5dghZA*bh?8JrXzC+E{*PdAAFApI2-W3@=mN@-$da
zO%Grp%Gm_UsETN511OzY2A8(Cdut?pT;+3L@J-oy&;U1Y@E-ilMPbAW#43a7ZaPXw
zzq1V+3;x~geE707+;#<Rw|a2Cr?aX*oU49t+G0H9_?eN?CBbI@L`GQi+EKVIVkM@#
zFlev?*ob6v;@;RgG?CkP@FF?KT*o4<(12jGtq6la@@2zJ7FcH<Oeo7MUZgW&RtFEw
z$qaHc#HCp|Ad|n9L3Dgw2Q0ZZBa9`kYx3g3&CUqsR%-sG?2ny-@}x`I@~OFzOwI*@
z&9yJgdDtBE*BFsz;c8A&Lq{y(Wu`S~_Q7%S2-4*sh4<*EIxzisew!-qC>lalJzX&7
z|3s}jI;H>)o)ly5gyLWEIlpMp$oIior-INW+C3|Pq9c@07>K`)=NlcWkiWz#Q+g4^
zak<-6hjOZ$#+Xe^>#Kty2Ju2<T`2|o4^>^>HY?WC2s7mcP}}$BWAvB%PKne?^!F#3
z=JPwSn=IZTRmeVw`o`viIrJau(*@{0eBQhTzq9G<COkY*v}nl+&}p*C5w^8NpPXiP
z4JY>Qzpo2^lEGEE%Cbi1J$>@&&lh1bCsnKS;V~deG$}gTXusqbectlp_!)mPxRWG+
zhu6B@ZE1e5=OhI*2q4l}TQ;xEwkmQVuOR%b)G|nR*I6o2pMQirBV&Fy3VIIgjL$NP
z=%xXD!d8pJTa`?wm=7@bjZwpB%rt#ur118EBqZo`iexa%E)mqDLRxt!&xNd_m}0ez
z)?-mN*=Q0ST#)4YZB8a|4mkgk1P}~tPPZJ&f>HN}9&J5C_y!~hXabt5!oNh`3&2Zz
zWoj^n9#Q%N=byb@YhFzI?|Mqqg;ybQaM^m~E5Fws%dbpNFpJ#W24Ct2B>Fybc@i2a
zY`sWs+aSI8Muof!1>D?J49flZN3x;+8n^hc&fXKG<lb!!W?9*F5L>BRmtLN4+QD9H
z*rJezcf?!OK&Js=C?xE=EPaN2J#1c*#?OKz<XAF=q3#_tBxpixj^MA`tIZ!bH@8^K
z-ez?TD6mYfP2iCVPx7PkN$gGMoUDZ93y75pAJ=6mlz45q5lz$cW(+q8AwhrUJvYjq
z4gJvYGx7-4k(+Eb406VnHKSC>jRGZzeYuT@_;2IXj))5)Y0{KpK24KP=30oY2+gbL
z++)ZinGcYDwm=R-Bun_$N~k0m9&PlfeT<i5!r>REJ_!_P^@DS2gC)RW&uRxcBd)Ep
z)uQOh%C6rEa~DusJSacfoF)xRM9>yaMR%XQ0oH?CjW6~({@2g(75h<?sKZkc$*5dO
z_ZEo{ac@I%)AP@2f%jRfG`JUnh*y)OX~D6CaBo<ShK*#sBAyg!-dqXW1=(s2u@@^?
z_D>A!l*`E+Bf5~;%hRt>Fimf`Q^ygrITVZV?`s)46SJ~*uI!8s2Orz8dbvmceGt!~
zu)DTK7xb2UvEe_MlEx6TFDJI*b)}km`#z~*5iL(=-Z|?(<itUde68@fauH2PKyo4i
zyL=%b=17F86mDGh2)?(w1^)ggXz=p9=@Gm`vKORHWS8MqWvo|ft(4ke=Xei+0&4@O
zI<_CFCk9#ct=HxbeD#fwaCeQ58kyYX;@uc;cE4_HSO=9d{k%BfUC^-o^hyK4u#`J3
z)UR139>?`Hv=x>(AS_@#H%YQDoN(w3Yt51R8JdiTCYSSWe!BRQ4%ZHU3|N+9?q9kP
z-pk8)Lhn`^n<`A5V!tW!D&g9CGs9j$>G^J#c)pzhm5YH*><yCuaH+f+mvS(Vbq_K8
z$JS}@4U-wyGx@%!;7sBVdW2K2EDpi}BRZFXuw*bdxx^N4eu3dGhh_8ncy@`wTKZ%}
zMsv|!(81^Z^~_Se=)()XLPYePqY`xz?~Lr0uNqh!Y(hvdBkixw>;+aXRo3W{fi6+5
zw*hxkmnz4v2b%urE?wIhnfYbHacSvuW^D6EzxtCdhXz{~<<^C#ZZq;!Co<nC)k`~V
zNaqgm#)^bZurtmE2H(BXKWu1UiLtlIBmGY61I#&oM#H0?<t*6_E3W0Eka&*$QppgK
z6{WQJ9mhU-1AcbsCNWp|?@F^L)2Wa$O34F)P4|W8`vK&V8qj_79|8LP;}#HLV9VYi
zdVvvFCGqa31#ri8A5~L?j*Yhbix-jXi(0ac4->H!uePxo$2x{G2KKPgjUSa6xsGQ)
zjT{=^gw3hP9r+C&=qfy$XXoG(&z9}LI92kr9JHY0tX@6HoxRR<<Dv{Q&b9a?EOHke
zLN@Ej@1t>5);b@ZJ1{)Yi2}68bF>>CE|W?}VeYF1nJt^+AA1x8^u+>uqWnC@xxZ$(
zWZ>;yW<WxWMQG&#;bY)Mzvt#w4iTpFBe}y>@xhS1`H|C|Vt26D!$8<+?^EM^WE!QX
zJ8mAtAr?_<8Ut*Ghvpev$X(DL6?^deN_bhf=4F~tYv=HX$*kiW5+@jg5_;8>GLE6)
zSI?cMen~!Eh#S^x%^M=-aBD<A7(DstI{E5Tx{HyX*a=2{(3sR?DQ3|M{QY^f7Vi5#
zk+*({hr%@4Q_){X|E8K%XwSQ~Ufwj;0co`Rbw&)#LRxhmLD%y9ZPUXLzjExjqeNMw
zU^kyj0Vn(!4oVwm9aq46jZ%wz*VF}z!{Y=AlMMCtns-Y3W<!;W(A2kCO(G>vT%>-K
zopdc{x9^<T5j89<+qS6lTOZasv_6{RKi`Y+8>8f&nsS6DZ(NHq^&!n`XkJ^fpt_W<
z`7KeO|6v&J)*EU@_h`%L8=V<+S$i<2ew`9e!4!}r!BG6(XeNi9@lZ;)>fwVije*Nk
zBs@Guf{Xv9)|P^9#b{!kl(qQbhRl@^GB~Kpye2Rd&y)DdxO;VGJ{uGo7=5L;WB}cm
zYQ7d#-1OkJ4Rz4wYGPtq+GO-;*dfvZb}Cqt`$h4|qP*s3UuLY}7GkIp!?kU_#87&l
zBdDt{3(9O)c-xjQY(ah%b|LMAwW0mxW+D6=>GcAs1-2u*57)%1wtUh-1p%h`C#-Fv
zSLeR0>dsoA7s4|b3jEJky;m2r@6%z=r^ZvjO)NG-q5(XkFfOs!_h*8WUM4(2PIi}s
z4t4CfK7+2opUU2wZZJ-?x!MbONx0%O-}q}4cZQY$=0h3P>t5=l2=gEfJ-NLcxdgp`
zIClg$DzthI;L(~ggb#)8_6MyUZJpK}(}aBF?s+OW-3Sr+xb`+HQO2oY7dFwow^*d)
zbmJss3i_g<;15I1<6LJA$D@F&0Y_g(enPBfskdHFd`<gz6|%qe?!b$gF2s+g0)T_q
zmDFwaJZtuqYwfbxse+FZ-(UJ|#2V;|pH-Km*!gB&lc_f@)DG;)9lZ1#I}9`R?=aZP
zU}`$G2M5>fSC!(gE-RzxE_stxWJELh;UM_~aF3sy8V3i-EHGFLgSl@X9*FI-dhwpW
ze=At5Q}XbX$12r{!zAncETipb|H(6_A}+?=Uy%zTduT0sj1TlzQtulzgw>{!KM&7A
z^k#j`f!x%PrY~SZZjjJq-+lspg~W!Jy$sIW&~UUo5H{aN`o2{V`E#lN1Zv><krMZH
z{<(}kGEG68(pQx+B$r5kB=l-u{i22*@iXIsNoB5K{&~(I2|Tcgbw7n!8+6NbY{{0s
zv2NdmfRAnTwR=WmTkunka>-9LkDIEfe4=exN$`$u4wlHYS<h~z5(k+EqpA;dolx}*
zkiq)=36$c$Q~gZh5*trtuA&Q}C%2l6=5B5tX->I}2DMnUZ)ThASt$)x4xj1P3mY@S
z+ULlY76H(^|1JVn&`8MH2R}~e4r=f>*)QCGicDP;i@MNlQ(E51V-~GKtHgaX0sEBO
zwK(H4^f;to(g5we%6TC*HNR-r5jWGJ^yrB6ExU>$ydEf3v0Z=*JL_9Z1$U{cQSM%G
zSjtn7o{4OMO?h^ERp7h7?s}SOqYsaguJ>UORp5_GsD{Q!TwiNIbv;ZeZFz;elm#GR
zf+lJ{UC)N8p?m=`qUf;U<me7JDA!=f&lIkN>HMn?(8pce=H@5gu%{8|a;eC{W8LzP
z$rC+<$svl6rr3}MD$G#GQ6^Q#IyP~na(yaH<}_Lj=+hqF2;O>-*ABWTMK-G8wwn&y
z#gvTX-r@;ME`CvA4wR29y}7_4>0~o^7+)uCNnF((lMN<F#0w5J%!_bwOA^tA`Y_aN
zEFe#OUA_Ciq1RGmsuw-}Th92<&hYN1)3tsFjgD(QU%G79-u#@9!s0;vVzGr1#mI}5
zqje232N`1f*X)YAuE1;@K#1%1(!{G8ek`g+ixM&$+zDnqAndt?M?)>|IE310>82qC
z@1OG+T={c!Sm~pITp@mEw59f~lX9m9rH)(pX3GL&`87gyyWP*>*Jk7>RwL#im*;`7
z0dXyKbk)GH^edY3e#W}qMeQ_iM2P{G^A?An%?O45YCc|oFW5LN!#B-Q&k_}k$~&vX
zVAd-_kmP7Bao?Z9f$oPH)oPzuTJF-Iz1vl*FZRkVYeu6Y_!oA2^Ke&=+@b>7rt1py
z*X0x<(ykL9;4vyeiN#PU*c3@gHE>YCI%V8OPHb}7h5UEa23Gsc9MXJQi0$v71z_|%
zw1;_2vV^<G(Ysf=Y&_}RCfLP9i-Fr6G&kD5ONhMxoyQlV?p|tnVRCU8pphkI)d@N6
z*ox|;6t&XA2&^UxdIbwSwlh{vm3|b4XY~OGwqqi|C~^f2tv)2SDBt*i7SDXSy12xp
zQ5!PUdVvThE7q}~`Pp9xqvkm@su}`-`-$TLZ;-D`83o4|UjWrw*<TUs$|MgM;}q;>
z)z!k8Iq$^a6@whD;P#c}6Vljm3=-S+O?kNVP?RI#S$cotctK)#vIxOY)_T1X4F9`;
z3#=fu-8#OfXScDA0&<LzIX6!^uL))3_kL`H4w337l>`DD@9N<AI*~9fxeW8}ujRcP
zARd6pk-aYHeJdwGAWX(ZNg@>D^a9=<Sl0>_IQZ*KNKB}&<U`&FbZ>{g3vuVDcWgQk
zdH|71RHGZcrF?0rH?M<(U9tKCf#vybPfV0cX+S(ZfHy}LwY7ATXA<Zxe&BY#!K$wz
zw~O)s(u4tWG%d6?qopsq%#$6>SuwTZ=bLMmBMv28v5^3@;z6qvpWB=Nfm^`o*WCW5
zy^*~nc6o6qDrgix;S@6^)zCsX4L?1$m0HP-;6P(GN^+vZ#X&%Ug8e6sbzS(EnGLvt
zGya%W=HKX8{S&((0C3o*=k_+#$lT{)DIt-&8SLPEIZgNI5rF)<594x6x|Q$<HKW5q
z$<S~NmP?o?W*5FJ>v-sM7SyD`^FxMe&O&`~0_DgR7@vSvd-x1Pmo$EH%r9A6k%8)O
z&&tWubam;-h~1Fne*aAYPYKU0u6e(ilwcSf{82VGVqwf7JIHZ)KIEFn2-M}M^<PFy
zMsgC40jqbks=U~Svi&Ga7bImv;RIVbbFHrw_rSZt2S4Go7Aln17b5O!!Em6?VR^Mh
zd3r8HW<eV5_{lt143<E5F@5=WxtwGc$W5jCPsWzJsxfm==31;#o;(>*KR4igmic4J
zpg$nO+?cK+5o|T$DL>3ALZv$9ge+O&ub#>upr$hyEiSa*B|c3o28^&rVn2oo>~6Lp
z?=j{(R&ruHuHr$j%xFOo;GP5cdf&(gYNzo)!Y)AV1ckW{3_AJv<i`rCYt@eYyINsB
zI3-n@XVOrD-y7d+sNOKKIK;JhriPtKS-j<l;LbDITv5MatL*Y(IL~A%UvdXdL*IHj
zOZBo*A1T@0DfrK%ClqirhfU(OK5@fPTPo59UJ_lSkA5;enbdJM*XfM-)?xya@c$hH
zn4lbnr=1+NjX5dl_G`qLD^s<~kdQy&LKI2AELz9oS3LliVx*qZ)@4%`hj}`H{=)Ef
z2C;;5>4Gt9GWx2;t9H=quOC<+3XlDp)!ljAsn{TrYNL>w`lxt)cr9F`{}{B#v?$cA
z9%3o+8G%Xsp8ah<noVqvwhomQ`?3=8Ya!sv!q788dqnMB-$CIh+eM1ob=j*2aOn1<
zLzEzIn2-ziNnqMGxaLy&zF<r69W3a3!DmF6-rIs@9ZbXGJ=Vy3#HVC5V0``FrIpoK
zSrPI+j{j_rOH9@+Yx|sf8Ju<NwNcpa_?fe(QgR2c+9d^~aSdAsNt}nk4S_9<WF58-
zIji@1V;*L)1C<VsJnnd?<lu_ro>vbw<nkf7wK0#Y{l0b(yKmpAL~pc<V_}(Ns@YaM
zlpSPow-~tA9v$fRW>7m}kB|R^hX%e6ee`=FWPv3|WIb#weHI<#HyvhIjASIft)R-Y
zHhAvo?_ALJW3{eSE|@7*&$V2s-L@t|aRJt0No-Qm;qWM>E-$;z-H<qJ%TvsWUAD3@
z!Pl&knc9;=bMG&;e~45r$P@3ts0nH`GNqvw`sGDri0WJFJcsW)v(JX!Rm$IeYCv@S
z71}v^97gqBSG1*JuKzVC)A(xa`(ISpVEAq<pmvl2SMrT-Pv2by*xO;i5p2QjONouB
z<khpPNns;8s1H_NRc6Hsq+U&?L2Mg!|L2<9A_NHP?1CYGoANwQZ_waz3r|{$Sv3KZ
zUZ^*+dqK#v@~e2SV!hNg&DF5UavR<do^m;Um+nH_rhUQ0%KcjY^K}XvFfo{Ny|Gj~
zh9cFy!23*OoYjgqpeQ>zAgjjnn|Yb_?^E!^+204Io04kS+7qZOG*XzG@*d>Ly9MXe
zG*&cG_;<D0;?P+Aa%~xo*@Yu#`C7YxBp&JS`O1vRBybXH{_TioM(bZ@g2w$8e-t?{
zeN|$z3m4lwv=mp1`VLcd5PYrhwqEKxM75r0ax9Y?G!$JTut<HT&Z>1UVP!Awc`=@<
za>^`*hwU1KkG?kMnKMtMe-!pfJz`RtOrc0lqDc5rv++eMnnj!MS!uTHCw|6KW=L4v
zd8W`7ksT%A$A2AK-XB)sn^TR|+9t$SRqNaHo&${Wq8CPhd~uHQPSKO%=sFF#*H<H^
zI8x2u`HTJ7{%pH2WVN79M9k42&of(#D_X7Ejk7oaJpw|r*<TjAru)oVfeHn|5`E8F
zx9}yKI_tXWE|;EZa4o)E;0TexxuuDepAT`Xed9d%@`luvZyBi+a1{3uMaf4iQttCp
zYt4Q5VmKwH<M#U1Bk@HjlDvkq`ql_JXzYI53tGJ|6VVIvgF3uxEzoMT@5hJl-bAvw
zzsHSQj6EZ&iEAC(@;kISHo?6g;QBR#u4b?@K(;MsaAX!(@ZR^@H;E!ECEGlEIAa$m
zv+pQo3lM=X%4n;$NBjM*8mb&XAGc+3tHz%{%+O(}U01?sd9AC<<6$5oea>0wOhBaX
z?qZO@KEjbDbe9L2Byi9u<0bK1$Td}3EC|sSp|J*~Wx@O=S4t?~j<eqhi&``Zz?~#_
zCZnnqTJMXV&)@j==CT_uLN4)JcZb{Amj5>I{$e@NjfCizmAiI6**lz>nc&ZT>EKp~
zXhSLo>u_omP1q+ItkBQr-VQ8PmZy&_z&Yk!Ro<5EqHHsUAzWlQdRAmo^8_QDd%u{T
z5+p;OSks2jo4H>l>ntCDt%|J<W<%W~=bzih$l{@yeDf0_p)hJrgo8+?Cu@r$u|S4w
z7WhP*Nd6F17HRTa2W$5-l=VZ<t{8Vl*<$0GeUOOn?!`oD8Qg(wpZTI(1NL9U_{Rx_
z?JT+jm-o*rCt&=D!N|Re(Z&ZHnHEotYJBs0Itet}hJ_OE$s^_>%bS5QVI{D&jFj>?
z7NmdtVW0UQGhG!e!nu%Qe#G^-ko>7+TMXa4IWU#b2xd^1#@G2)3ePkediMbPDG?F(
zFEx!X_kLXNZ!!?1Sg9S}#f3enQY8WBge)MM+O{aQc4p8A@bT*PWB+^?pStsE<m1g>
zQ|ldDPc)zX%>4mr3Y7X`Od4!x<V55s9K*XmfwX0X1!hJX3n%;cj<0F+hlIrGWd1($
z3&y3AgZb6foh>eMIned50e+=_!>(u@P4JIhSwD|%3=x;;p)S4)LC*#S<wy{PQp07c
zPfHIxe;4$=zNj_!RfHglT+A-t`&K`U{;At|=}|occg3*P6D!VeA-&>&DoyY5QJCiR
zBFQuK>!cI`(VG{Sy)g?1Nh2L>E+9Li^V*8gH+P#uvpB<|<3y@t_G6A>tp_`zJzo;n
z@1$Yhtp$ZU*n1YhxXj{7pIx~hGqZ%1RoI47px*f~q0<QK6}EUjF(>Ij<^gDyK9qjT
zZdyRE&UnGR65!eRwhc2*SrAtAXOqd-IM%Ha#q#dS+5sr(L0DmTUkfd<j&^f5!3S7l
zfsTptYj=S~Hs3wyk>m_3b*10U_=(Q)RNK$+WaKUW9qNISI!^y2yD_$E8GUq<BV=Vh
zEyDc}svs#l@G!Ll%yS9{@}Sm5vAQ$_F-&4#!eewtzJ|~KK2O@|r3Htsy-*M?9%1@?
zdt>>XzEzhhgb3}GIQ{oGs00uixJNM>v5c|?2h40T!ak7gSp~=pKCUInlnxI(Xf~F8
zB?n=d45>4(`0a3qO#8y{aqMKZ`lMrP^*=5afz!~O2xE@;W7-RE`@ObN;l%8Vbj%Iu
zP0=6=(15mhmQB1fs~Hn?6<b4q&H0A0?mZob?JDWX{qg)ZV(9hx=P^7Jg!(Gxvh4Ai
zhmi&jOrGHkk15$xype1><5KGW2V1d-eaQyGK2Mko&GI%|gGgygA$A`P&RLl!Sj^6N
zUxD&3^H{((@Lb!i(|n?G7uo;-D%-i+bh?F$T7B^kB_e~$nUU7jDiHLW2q|u&zBZ(6
zt$ypR3t`R|6F0b|p1K7Ow38}*&vTfMlWx_M*_T_o24(lQ9r>RL$N4W0IU`Wr0jyju
zr*g{GaWl@fxA?i<qgn+cwHlIPL>X?Nwft_??;BvP&O;>kL7AeSn~UXJ5C3_i?gDN~
zNa#$aZCw#P|1)>!v%L%^_O+jr9cPeBsd_aT2kisXe>K)I;hCY#<5`NZ(6QO|k7<e7
zWuw2BVBWQ}qxGaPr?}!v5C_Do3M73d<iHgdx7`tw{Q8^mwwE}O_Q}<I?@+7HGg3tK
zNO0-)s{CM4xqa$+w^HD15i$ywOA5I!#m8&u#C~V5?q^r3z&2$|5J1Z?4?;s7BQjg!
zd$35=RNZRWm~P9F&U6s)=osYi`cnaV6ngiUCwNH)$4er^&sp!dxkwX9+NX*q%qCj+
zT=CFd(<8l~Yp}tFa*d$54-=L~fk3uf)np1^DW3B~Bp1sa@0X-@Syh5#9n-rQ`y!}E
zM|*$%dVY(}*p6LF@jH*-y($v!Un|WYlQF1}4(*zzeS6i3y^04~IzjlJybKHjPNxlR
z`)YTdS%f8weMM@6F>j<kh{UT`x=KIfm7*ud9gDxfI9%^R=A}EBhe|fRRwn0vfUzA~
z)5-E9is}mmgwHxu#l}4T=GVTt=-^{v7+Ft(={6I@>JR&as!B{xbWS_|vDhj2ggJy^
zPetLUupQhX`PdXz9;ei$NfR>FGz?jlbP#^J3$^_I53St%-pNr@>=g5KaE4qKcoZKk
zhA<P>Xy*8%ROFkyBIs+gq3{8_U7E>_6=;JrdEZgt!Wr}Td6nz0<kHa?&q~{0InXQZ
zq8C2EzFv?AX2pkk?d2wKn06QumeNmtHy=rlV}H~I{Rwfj&gfZ!Vr^Aelt(3AG!8@b
zC*5PQou`<@a>@P$QVczm2dn4X9k|te2`eh${(FUUy^fO<y+r|EMj>>O6Jj-T?QOXt
zc{pkyX6DiDN>#mcL0ZJ(GM7BN#D5s-!x$x`w$8-CgNWTewVIK=e=ks~Qd@3;JSe0k
zVN3!XSD07Y4K=cu@?7)Vb7N@a{qC51Z57HE#JhK{tm@JN)uzmTGAO;(;?DkV1@D3a
zQbze{DW8S?$}{vRq-n&|k)kQ??EY68o+Bop32AcS^7Br*aBO$pnF`Okv*V{DGYu-y
zvmpzSN_kwck*lKr>+eeGpa8mw%-FJobLQM9;UBq47sYEGH*ppl4w3B%+3tBDqQjE8
z)~0&jG4SeAy@KkNZeK;{#CZC?Msf=lajld7z(H-95oI$C+HU!%zk8sj%O&qBmkZd3
zgftNa0Ri@#xh52?qZxK@g`>0ft}sCnhTWXIQG63|j2@<i+YAu)y}lYkr!B>Q<r*Xy
z;kNUbF;J#*9!V|2{Rflz)585aJNj*wicW~ku#Q=2X2?~&<QmOSVy7)9W&du~f487~
z5%ziKxx(W$@`__+?|Yy-l>EYn&g}ZB+vn8WsWwN+<tDaf*Tz<%%aRc$MDQyxEL9fn
ze4z5z2Qj?Nw-_o5PfV^{#6Cw#sxB<w!LG5){odhvq>J>j4R(~6bX2Y}k&w*2;}yoL
zWpV+=<&rz?pL}$S6hcsYu@G=hfplroaTQSw=?`5_INloTpv!MP>_*mh9EF(QJT3_J
z!(-sfBJOK`DBo~^Ol%!($9rKunse1f0x0CoB|de&tXt7?Z#?Tc+%jaH3Z}J0EJqt5
zRFRO*20fG<NQF=Llzr+~=btd^b;{Yi{B=sw);J5U{j^rivILv(p7(xiby_nAb*FN<
zA(s&F7Aw5;$f?Ck{aXO*4F;CL9^xaXcBh-CTl5bU7`z7>>wJ4<D=X7*7fM^SAJc%e
zEZN8Z#bHjC?Rxi0896MaE5+&<8@>UR4LN{(vy>Vb>=R2Z3*JT4U|wmurhOqzOlNQZ
z<Om9>i&>BT*}Ib21ttW3c`w&~WnfaUa~eWikVVAyP(IZM3^v?3(#(~gkm|Jc-J0mo
zk78=qR1WX<XjbS%K|5zq;(N?P)EkK*H(~DCSn1Q5sQD(Rz_|yf;6R<fG{L_##mUA!
zYSmE8s(t^CVM`BGVn|R!J1$kTY`c#{n^-#cD7M!MP%EZ_cJ<3e#c{tlocZU+L}5Aj
zGaceBXzj~nD9e28tA+H>CHYza4xPaoARGWlXvQmxfH59Xqj{rC5eNC_R`Oqw;SS7#
zd`%WR>@7YSSl$;7fz8z^bji?PJ0zE{9SFDVfLu?I97HhTt>JX5rI5#qk+R<tkvu;`
z4MPIvQyP2%?Qk12qjN$@z}cnZe3sqsy0Nyc*yEpdsZEiwg{Ok5V?V?*#$1;|sX;ws
zoA`;7Yeo_nt2ynGmWsYzc%rRUF@bA5R@$I@(TAXefJNC#Nf#i7p{d~wR+^7TZ)H=T
zL)FdVM^59onza8_#eA8LRjhgUnlg#CT_i<OFhL-ToE^0jgY(!Mq}|P(5jHv%J>Yj9
zY|<mu8C>4r()736eW`?-ZjUf)SR5h37}&HE4^k+Yu{xu*4mAxh1y1(sDKHKTomV#l
z>bWW+HfN9oQzE#&w<=~bB(}14U#Fb-@uMEZz$NQo*LNr`>?ikgdWCTI|6Ne8ioBbr
z+vg}BFJ+wmvwjC&xmD5cA)Th_1CrS^ZvWszD2~{r1_)?6%4EYjIf)wxCKz07XrEFO
zzPKc|agBb!pq|JmJGkEB_UU|6QGrGDaZ2!oIj-pKu^WfV!9DX#J%d9Xem;96I*7#v
z2ocvwDM>kCwB0`VSz<V7DLsQ$y6QCF;YMvdAFtYeJ*oRT(xujNQ!gMm8T7A()7Qo#
zaBp4s=#@kYRk&GMLGMg=8Fzh7rA2uJhxlM<7L>;(<+P&%D%M0-&UJYJF=RNnYrlbg
zXFSyr`}e(e5kDoF%qPBXCyv&W46u`)9PpL&bpIIvV`1l<mYoUv7)!<D41AIQ#qaQh
zJtLZDDhM*u0yM8$nlB(%ygEYmg#^L|z{0kc7jv5)x$)vLN#QlC=^+an4*uO1ah(H3
z90R}grJ5FSUQq~8@dD)dv;Q5{OTa{_`3n3V2GB`3RoD}io*tf+tu4|HWTnnXDnWv~
zTW+LhZW_3+LhJG+Lh!wIlM>|U^Bk5OlkYB`yuOh;CSO@|17Z~w^)g1wiD>?q);*nG
zBu_>904?q^D7{XG+|lb0DK@$}F>9%8F;`XnH^3oQ<VU#giRbpvfObD&;it!gWo{GI
zld-r@R81vXM`?ok*y)R~@t=9uyo+Qqo+>r-#sS0{b79S{eZSJA%i*ZjAAg?;2Q4}j
z)%=!<)jukZ$3fNIj%5_O@D9r+AH&u3!FNW`iO1LWd~)R0Yx;;bI5__Hzb?1CPqG{T
zd(wf-KE`<GiSqoAa><IHf6cXp_XYbW-LAi)a*;hS#(aAfYKq96xnoYH9l0R`2yn){
zZ=D#A#$OY%$MG@UY_Mc)n4U;r&&+B!@pxq?!RIDm3=0<H7X`HIH`=ut1^1hLuxHI&
zzu&r<GzYPZix?`ukefI{{jOk3Q2#?bqnLW<^&4I~%~YE*!sZ#D19hKOe?f)!BGiNT
zc)%KS^`6Bi(Ea(ZB$JPM4zItgW}(eoMQ1SuKbTf>yicMgK3?O1h6kfOn!f&(s|ISJ
z4{<EHKXkMH>;^}5HrK+A5n^iBQv+)d4%sKv%YO?BMcg}{cPunIeh={C*UU($Mu_Zu
zRjM~u$Wf55yAJyaB5!z}60T+k7-`2&mG698AXxa=Tb;t$$_&<fDksF*C+~fKX)SV;
zl6eD|Qb_91HHB>lvc8;th}8|#p29{YPY+*^d}NRdwY7>mDV(~qe9g*Y^kVi#T#{_%
z@I~u@XlCrv{lm&(eJks{-G-x+wO2|$OMk;0eCoc;KUZcb$s0NZR1{pEw1|`f@}C-s
zm1h!27rpDad*N)WtnSU<z{y_Sz24V;^nsSw*zm)L4Pvkf9NIL;qBX@2Ud0jAn;g<^
z{p)%7O%6U`zq^t1+nNUsiveY)7@fnov=jUb<zDhHgWijRswIa9rtS@an?b@E1RL5Z
zi?<9)D!{1gpO6-E_saBwL%7U}skl*Q(Q@>upe4Mjl7vw77O@Z$xmO8E)LgMx5lcvS
zsu36V(T<quzEgO7XANf7(35;5U2JfQQ7Sggo_PAJeC-50@a8J8e`~(KocntTQQL?!
z_iMM|40{DEG#ZZc#$LAT?8pZ@e7gw4YJ(R_z-v^LG5t73|3yh2yl2$_nizucG-J_l
zTu<s&k`L@jO<TxuT)3DTj}fwFm2Wz$dHsBZdo1o(4}##v(Bk+=xC+K80-1@gky5n>
zE|yX$|D6ZYK_W6=ID8&j^9)~RiaMju58!HNzX@JP`cIJ9vYKCLz2E@JWOuFvrnpQ6
z@K0Zv{OwCvi=gX4x(<J*l)ZWni4WWtFzTL|iqLlRaa)KHe6h}R0*yjWn6N*w=nocI
zr`<N21`LS3xszL^A~{QyUpLeLB=&QcUJ5~(UMz9VI=nJzMnCm3B!@mK->{+37(qvP
zSRxcP{QBh4JzL)%m~Nuw2Bbgh&ut4*0vEZb*kU-55GnY;^J*}zRC0egL<WATwYNSf
z`Om9~&KY=WiN37$eLeI)n9O36)%&6AA(Uv9y9E(4&CblIWK`XMJV(3pDgmzM%K{}=
zWQm1rNiMr=Ejg-IheTA^T|Moh5iAplw4sBFH2g7w^nV>U!Qq5W+W~ZqVVO=whh}=>
z;f+J%EF!8?VEA)JE60abg8KU=d1fuX{BRj+?TJXL-$3LMco^2XJ(Q>tke=jG(g9yL
zR2)*l^9)YFgt$D>uMm?0Bz9FGkj8@adHc_%TFEMF8DP_Y_lI$&XE`vQx|N2P<xwBr
z7&A<qp6Z*R+(2$DiToX*cPrhYfsdK9Vq0aadDiE;_XnsyT<QgQLI)g^xKNY749AzN
znj}nr9C$rC=#`ZM0(|;4PcjSN&cs94TGq=jfs=6=-|9Q`9bjv$qV#-V#-6C-yXN)z
z8HROKHsP$<Y1s_L_<I>}s76#sH=>?xe7~ydQIKEk)e!Fkn-FUFFp+DqG2x7oDLo8d
zNY8Cz!pLv7@iR)lEm-AK+;`toQ*b)dFJdvj(yd}vF|5BbcTPm3dcL+|Ifb)}?*L9o
z#LHRDqxY>_*h)_bpCWwy#h+aLKe=xO;NnAjDW>saLHeJKnT`GMm;CP`d!brcT(Ut2
z)b6S%zx>#fN|Ie^LgGeYnT`Mp4Kzg#6V}}R`#ljBa{XiH37D3QHZMv}7ECCJkp+r*
z-AYG$G!2_r(i!w=;VISf28B)sy2UOyr+&*q*Zmu~2m4b!VMco+g#Y3iBR!EjIXZb~
zE8Bi}C<$u5w?BYx&#pIF-EjvgDxcGIydTA^xoW#~gS6HvA1>qhpJGtck)pm2e(Xc=
zZtNcZ<0d=HAyADZww6<KYqBWzM06Hg8B?*CbIB7)(~7NdY<DXZw0G6g<DTVD<N`Y>
z+xraEe|7VdI-H0!v&j#rSFQQhN&F14Smy+N__iq_LbnJ@aUs}og+@+)<PWfh$O$a*
zNt&-_gh&>}vXT_11(&rRY*(Gok^!IW|1ZM#y}JbHLk3x=3Q|Dv?mJzRtY1^A-|H4c
z*uJE&?Ca#tLPwiZe}8JJG|z-cLF8Myolwap>Z`G=vVElbRlySfk1)n~g^@frO{2-f
zB`9?9Ojb5exF$F~%5>hM<)tD=7N4Wt?S=03%U{QnTmyO7$e2cA2|k&U-C-Nv!(!Hu
z5Ju<FujZGQ4n3PW^8Lih;O&g<jyA1DwIZZ+RiH1R%*LmNlyHy;U!SP9^;m+E{BrEQ
zk+n~ti5{=_$tp*Z;XQ4Qdtn70;Xm16uQVOhu+L^;GJ%hNti*TGFv6(D;oCoSa!)wo
zjJCT#>lfyv^ky>g@W8?ktx~L%Yb7pjL*Irb-@%+>%ssR9REXkcc?A^s>xUVhexH<b
z4HO_Rp>binh))cN+T~0&0{3>nLPV<n9T00fKpoIG8a_t{vcO<d=NL6Nb+Z7=#OKfK
z-z=u=ZdrF5$TUqwgQr~c%MaJA)o+-`bM6_*bdbC`{!OXmP!wgxZ%;LpuN+(q2-W$x
z_8BHL;;Cc`kppe3-7NDSSq^oa^m`5NLGxRb<6#d@KRh>|>DBR=g?f8F(0cdFuT(QW
zV#+W4R5$>gqOtmmasFs(OtK_`i=}J2*5>dpmzJEVUm2dtpin&{1n72brY5JP9<=gm
z7Q6iE4G9@HIfy>pr<p2))Qc#4fAAUYtuM9z*#Wkjl)dyy*m9~a1=iww<ZPG2HC6XC
z>8!>o|Lm=jR&jVos2R$2@tO%s^KM&EOcr+#bB4giPTkKme6oKw)O+Y9s9SWd|01=v
z4zA(_CeI7}o@NX;WR!{yGsxz<Sz+DeyT`D#HoS2E^slLIzbAl>`H$(r{|q9M7Ya}5
z4(Zw5J7U(TWhQ0QIOaK&A&SA*K(~4k8)KFs<HtwppSD`7VGi;oL}-@9lQjK6rHglj
zeIg;eM5t+c_gEwUg5t5+-ERrLAfo}^4~K>2%5(`WF5&7nE17xHm;&9nOe4CPyJ7H7
zc)qduS~&azH$qW<DB;-$!eL(OpLju|lMKfjd$u=d;Lv2Y^RH9u77bLICnV!1TZJ2z
zf_hwg)0Kxt1y9XyF{q``d9z^A-}eS8kB3kE4PKAHCMa%L%`>nY=I9+Ozunlz^|!-M
z@yN5n1bXgL#XuG>OWv$qTZ7L>&H?Nzgc;U{c9o;(jcZE4b=z)GxJLH}v*<hqlA*$R
z!uN!f5y}3brHQpE+ySG;YAR@QyYEik#FS;p7P{@KY~Wjm4is1nsq8G$Wix#nZ?3@l
z;rHq{0hgIR{FNEmrI9di;JgiBO<7y6<Xr_&V6|>svXAG~s#zYs=f2xfspmS1{M)%K
z#JT%;yY=#WS#-40RbUa)jhkr0g5!1b^2df$luQB+{%$Ih@JLicT@K}MvqL0{NuY^Q
zXvCe8I~|hA4mD+RlUAi&m^-woPtk^=q?*<Uq(D3=<ZY}FDrzNe@hrq+7_z-F0bGea
z{i)Fgp9n(gClf(MLNO6~fyBm&+CS(=w(%r!K@}NU`sZ|7dis9&5a!Ot8~45FG~`f=
z)7H!=?}*O%1zEMP?|rR*$FoO83}v3zE;bFVyUBWY8!qAhPW%1(tJ$%d=A>A;n8_k;
zsgts7-;Y^}w3$1v;}ScO+ym$IZc;i{LAMvYf2=Vp=hOGMj$Zo7#k3;xG)mHV1~0e_
zU0!FQW776{hw?|JRD$KtpTg(&&t`hw-6cfU2hN;T&PPs;WR!Ua#Hyd@7gKaG(`$e&
z=Pvo_y_sKt)S=8qPMCBhObHlq*Ic8;?e17?9hjVk!_-_gqE36_k2p~p%dvuZoNpmA
zGW6_N4+Lnq#_+2a4;3rG${%T#jUoL%=ILlN=jgUCPWT_f*xsHQx4VMU37FK|gf6Ax
zv}|Yic9~rIdqygs&CikjZJV27mqg}PN;vA@8ldLWgUdATSy5NdY`yX>H+W0d@pBCP
z8Gn#CijIs<pSnfiGz;l=gU@&VwC&IGk258Uo0Y~aYn|qHYf+9Dfeeh>8j8k4gX))X
z;^fx!*LMtlqq*Nou-OECG1n|T6xt4KM{9Cs^K<B*2oh(!ZpjAyRI>o;$6;{?D`^7T
z1yQ=Qd4hFje*!iH#)hr@4q;9^XfuzbuxE0YSN5i=kyw#PQoX_+yKvs+l0WqTI&brL
z_m@LYY(~YE(+}xL;Ie%`sY8_Y9P$IF=n-AJHa$PM&}##KhDHAM-P)!s3;buwQFYwq
zn=RjbJ;z|*jNYW5Hxj)3KeD=2Aw_U&b>LA@$V;UE92{P+RXr&^J=R7R+C;mdX#Be$
zWz&HkBU}ym&06w6>p%mDvv^^9dS_p2_J%L>cx{xX^18VYoA-JbESo=%_re(doWUlv
zSB_!OzK3%hKR>`6PZ1onM5~cfwFcTX#(4iy)hcbRr`UCH={)4^>&Wgr&mPG8W3*Gn
ziz~uD0<Ui`Jz|7o_QsKT7%fj>4yGZ&s_C-~QOCa%el0ItbFi5`5u8I^aHW^$3|*1%
z^2lh0s4hk$YR6bUDl2<tDBACre-n{<_T`Dtj|3GTrF~y~eKTgM(c|c`v<240lQD|p
zIq-WDrbmWOS>nUX>{~N-35rMdgXp=|Mpoek5m%RYg8wU3mSyx6C(}i?pGjDnY}h=c
zo=HqqeN`b%>i|zu?L_3?)+$P$7~**h++$YVr5aDXr4P&)@|uIT{FyD<LuIzlHEuG&
zVfq$MUHpW8Q1KIr=?;%fd}D{{IXb2%ybQjUg!_daj|NrzfIwd_TtOc~HoYmcdj2QB
zVBtBZdozTD$t{t*{p_KiQ6f->TFdq=a^+EBcksjD;*58UA_~61jlX(5SA5m{7+sWm
zE9<byA}D#2B`xHQ-E?fdf8}D~oYKABadGABvJbe|y(T|wqno~j?5b36US^?D3kIzd
z(q;|WScK)bH8FLv4*pW-3=MdXNgnYo&#&R&^~VWouiI>Xt4$6fBXol~{%!N3?hXa~
zG#<ki(*;WYKa$S-pUwVl<9Dm7s%WeBsw&!AwQCn`wN-Q>g2bqq+FK;L>`m=;tEyHI
zN^D7OYR}lQV<%=1;koYb^9T6F>&kU~&hv8|?{~MmQH3i^lTw;0E?s5p*6s^aDmm6D
zVJMOw>}{z8+-kYvM+w%OI8fwy<dykbNkN=9uZwBCi&%_#Y@xbxu0X)Uc1`5>!*2^Y
z%~L)eYT^yz+5IPvC}N|VP>gX*DbSSMb9bX~A+Y58(GsqDdznvSiJmo1!F4G}YnEqF
zvkgvcGGAYEW8tLgjI35ZQO~M)f5zB&^`*g+1wIS5K;1uh9!lznMr%S)%(4F8O5{ko
zzizMcwRgK0d@s*evF-QI!x|*{Q=z#?(Iqq6(x0&H=-U2Uo%XQ3Zoh#boZ8$A<b5~&
zXGLQt2&RRl+V!XJT0?)8Y`X5--0n?{MAJ@RuS?)fa(;H@oP@HTvM~YoAo0rWp`e}i
z+oY7tv1Za8%|#X{6X(mN{jdGC!Fw3nQ{Jwssp4xpjPJ!fFCip(I5LJE3v3K?KJ6HQ
zNU9B7a&tzUq89$aiP_}9cm84l?9E9gC5Xwfs!lM{VH&`jSN+!&h;aFJ>*q$0&E|^*
zA^jcqx^qwRFn<taK2)PpuIne?@4L%>mx&J|f^aoliE!vt-3>R?BWPExwb2<<y^dK5
zp*jNPHlS(KiV5WtI2@VR8P^_Pu#7o(DD3(8ic|<Ajrs@*`yAka=g0m$`jKE5HE%Qj
zxx#-k$2V!}(d-Z6Pi0N5pr$R)#-vO~YzeLDW~@fvUAF2IWu_`?<GZO9>;<N?T_VR|
zz2o4+9R><YoWN9H>E$Wywe-sT@m-Eu4-e(uZSo3rSs4(-K&WnFr!fj8>WglEvG&N^
z>p+@RhoO=Rok<9I`UhEl5=SZv$jal0q-59n0GkMhY3)CP08bmM05Jci#l=#rG3x@c
z=y#=$7u8*WGGnn&i8p`U2p&*MobhW(Z!YEtTj~QlR|U0CWOp+%lg^*e>-9eKxeRS<
zONhxYrlyP#>eY3k()Si^*I>J{L}JAj>&#!*!Cw0Rj#1xCej7;uVRx9~&htkp^AJnz
z(qyE4c9{wS1vKf*v&-yY9ZLpP+)_-_q7`G$8@JZqAFtIo{Jtw_LB$j>+<-hTM$h|G
zK30uVV7xhW4BCm!k4l{abIgNysp)~LD}cQ$D7Ehb_yUYnZSFl}a)Js*ZZ4<uZs0GU
zK)+qf=rAe9y_q9@ljiv?eJB%t?soIJ=P~AOGDp`A%j`k@L+4Q21K{%@je<W067^iq
zqx(EApe7ppw^+nTQXFS749519&7yDXy|J68e<qNvsP3@9vjHJv>x+EZZ>qVA!V$ut
zLwJsRo~}&f5^Z9?z2;q}@VYi`)SJ!(f5$y5YCC)HqmfH*(oB|KvJ?anE256Z;PZYF
z82pO8wQ!0f$9TYE4TR*BUU^DB^ZD*EyA_NOw`%|6Qr+9<iFlw|z8Laf^YYnS%v+%J
zrWSJ;r|xie61+V&e=Ff1O`BXMJ?S?*(doFHUQ-~*#N`&o>0L9D)WuE*)0nW~?W9io
z*iOdn#RU!I+@S>>aIMn>KKInilI~;r(d?8x@Hnb-?3m8@s-U-VxT6sg!wn)A&$8Yf
zeXa+f(sWJMC^}O-9&9}|s_s84IRjrgO?D@uR|BP2^E*Sv)NgM6VuQ`$IeHSCtr(XE
zhDzHv@G<ED{OxR&J&<^XsK9R#z6lKk!3VTAr!!6SQ=TL)Q#R*8ofs#}XRJpxIX-H^
z1Vh!*`G%aa_`x7)uk)Wz7hXGu)oF7fZ&5K>%EA2cTQ==Aj&tH1yQ#w@)qS+osf|0<
zB<MJH!`Wr<dgQ9*>XczXT8n&jfmi`W9H^8on~a}TE1jl#8Z&V0Q->#}t{p__OvR_{
zL)K;50qA2TG+%LX@x?fL`qH^3TJ{xIaSbe9ax}QYvoV_M;>VSw6GlY<jjiakpbIlz
zdk6m*&u(>I?#d}IYAN8>8sE;BkP+V^YV024=()ZM>rd5H=b#TFUmE_4KkyUFql!%}
z1S@<$($)&9FYSkkEAx~za~9l>+-p#SbLcKxR(NJPQZ`!_j>s-%YcRq=;A?0ku5y12
zwbF@`BttokCy4^2ja>!%){W9XrWk8=BHHu&NxoGhfpbe(AbGo)Bz2<N4^vL@&s7ZP
zkA4n$j9x1CLv`=KyKD47z(8B)65F>_2i-Hy@)1PsY&N?lQHU?9V}1<}tYEx1D=J(~
z21x-UwO3Iqm?ZyyLi?2M{O+<BCC|f3VY7=adfS-23Ao035a{j}>F$q^$%pN~PXxHs
z{P#Kv7}c)?IJ45?(?aPqqw21+dG<k#zxf6w<B}n&g}HTdtoOHP8=k7x@c{vki%`aN
zS_K8i<=~`YSi~b$zx}RQ1V-nxQK<r2@m!27JMk;o`s*#elBVeNX&1$VkVkg#%4Lht
z#5f#fSe6&Wjk76C=E`!BuLj=xgWPw`nF$80;?&Hfqlpi?G5zX`8=R-9(cPw7xuz03
zf8|(<NP}}?g@iz>`dBiCuE^K*x1rUDR&k|X@e`S?7=A(WUQ|CaIB>a`_!_y%jta`t
z7~L%wJ>PfiD6v!<&SaUKura%7wdVoEIBkcgJD#gp*LW^1x$o%MoxVEr{<HeXGh0tt
zGYuM<g6zx15Za%+cxF?AEOYffS50(=N5>K3+*ytGDSoBRJxQXy{VRDe-ppVGX`vg>
z1ABq>3CoYtV_o+*&D&c{guO*>GBQp3m=%=HKOrIqf0%)~9x}X<M#O|BdB-Mi(0<uw
z&%JV#24>K3t^a1wTh|$Z8Pps6+r0&tG~8_N=EqMtV<Er0RRz`FiFi&|=UfWP&95Nm
zw-#xF?nYC?r#$!TMt_lwfg_o7Vyvsa-t%s`J%nraD}p4~+i*gqAI>L}1(#_B_cnOC
z2>YDDlK5y<VM)UV(H~F;2_T^0j@#;g6O!?iQoNL}&bL>@4aQ<0JkMpq{u&IdsGd^Y
zhfuSEpbR0c;_&E+MNPC#qBcShTLBRmn+~UmxSh``%N?A{h|B15eB2wSc4cGo6RUD#
zhX$r2>rc)HPZdAYkyW=K%sq9-)Y~$;SyRsphoQF?|89Ga1?LF+8&CggMX)ry*!Q<2
zDr@z8t;TUK<JVfDD@2p-xH0&$+{9PY;m^KY(E$qO2YY~br)ZHJJCjl|dqKswnvsMV
z(5*~(;F${TnqVF2F>%z=6D8!$iIo4nLQNQBTZHB8d<zKt@11%PV8cQ>2TL7*J=3D_
zZu$k2!fpDuvcmU&a`G3e`xQU9weH)U2O{5yz>v_JQcA^yv9s+8zDOMU6-8Omxm+IK
zRg@;%Yt(~Is=UZ2y6w2Nv}hD$-+H#QSWGu{PoUly%cV!4bZ`pOA)Gy=AEEp8c4e7k
z%s$|o`i_v?bLFjP{rAZ+|Df4@=}UmkGeclvoS^K<h>>)_QNX|z^2E9bi*5b(_;X=n
zg4&)`faA{F^r23sX~u>LOIDGFO*@1xU^L4dmCJFRDl}SPW^01kK&g*IHM2mmTery%
zc>N+`TMdUF<Yo9d?nt*}Xo2kH4i3Jd8~k@2Pi<5qlHd@*_Se(R%KG~<q&$#wtVrNf
z^;hD_ejVM`HptK|XiB3y6L})wc#$^vLjA#0h{Tq1;wdNmXD6Ld6xexR6n$U?p%}C6
z5~EIUZ9ad0Gem3b`B4syQ*|{VResUyA!q5G$9Ll<jPZ|rii|fw)m5LQZ7=F()$?FU
zE7GHDo+rza$<d(xbH3zI(`<Xkg-?;CgRT<Z=G>Wr3<%MU&N<)t#93+>bpnn}zbCaJ
zV-^@aBIW*A*qB&D*wepXC#IG2W~x(HO5T-KEPa6P(lO%>Iygk2diV1{(VxpvV)|h3
z{MFK1RHb`w2Paw51w5zmZ4h^ZhnfYS%!IqtSMOHiK}%7vZ{X6@Q`%d<fPmUCJFa<r
zfTH*!%W0g0@g3UmX)4=@XQ)I(<RK=b4Y$n=bef4K7YP>rNG;YhugdOSo9Gwf`Hgt}
z4C!u6S$X=H+O^wo<#{}04UoH*K$ryqIA1&P?annxScD?ZBE3I23VfEiXj$9!{3U<u
z&qom_QXKX2YQH{V^C}7!_9mNPm{4g$_5E+gMTkT3lUmN<{40BnccP9Hf{H5?x8ve`
z;^)F&h6{Lnv*L3jiBiAy%&v&~IoJ6GI(HDV5cE2(b-=ldo{Nhp!cUg1US))c$8K}E
z9sNRs4InEvzu6||g!Fbrv$%KkC<xt2*6yp$MKW2GY8JudUbR}+)g~4H26B881FN}E
zsNLif^uILl!H_6rEg>k>^WYGFuoBdVTv7TVmow%+yk<=@!K7cb7vDx(IOuXb$nknq
z58CWlUyi<$Whb5-D5#SCwp%Q9TY(6lI?VD~W&S8Wb>DH})EcKq{>wvVqTBi_??#y#
zZ2!`QM!d3?v_JK3hM~`tog+w*CZC7!pYYdFm`G{L?%r+VkNA7iZUdqIMnEKL{};3h
zd#|5y$~#b}Zw>oBG|Fcn<F}_4kSNZbO}c~(1I|ct7^$=|<NALVxE3yv$`&t*(_j2l
zoHlPFaY7+8O?Ifh_H27Hd;0n#8))Z^Zi$6ZBswx6Ms6-u#${`gWl<*r0*~DnK{L0i
zh!yiycI%6?mfDtpoD0zhz#&fW8T3!Oeg2x-yVU13Jw%Op=twSpl()UOL%yKsqSq^L
zfgQp)oom5{?5H2{EhSMdLxno2w8OuOw#C9Fr`UQ?nCqsTSosR*$v`WH;Mv3XHaOIL
zl|)XnU;SxTwo&zCsPm1LzAo#ba_KYYVUxsM{6xCDPis@GvPW=BX6v9B|Ko;;=Rw6+
zT(vmreM8rE&Pn46J@bBghk3GZ(_N?^EvzRc_W2eBb?nPCp6FbbE>0+5^!{gj5`AKB
zV!VbG=^U;7X%nL{YB*dac2&w$f&(FTU-&ZQbebmH+p?|3HV)i2+RuOK1hCDRL_ehi
ztiC4<E8{QOFI~8Tp=lu9edv{eJ>G^MeSstOEY>+aB>EqHyQ(Y+E}=)!HbDWF^^=s`
zBWIh~J@lr%poa|Aa^sqJRQMZ+=~d|-W!+x9j|RT$3|Jp+;IsD<rS1wEzPHM<>0OnV
zRPtou@Mf_m%2hcfj-ns`js4_nMo@XKvYzg3wGe->Sr$AppRM5k@5_`I4T<tI^2d0M
zje?}8@TzF1;TL=8#~I%6vs>t7_?O)u^b6VR2^W7p*cIUT;XNR>5V>a4THpTtRQ;f|
zMGv*t2qXG+z;E(P9Mx{CvURYHya);Qrh)KM#$A+W*-0l}FO}r&V9bd2`Z3Z?LW=p=
zCE=}cba2J96bw4vWC^Ngv3^#z_BLqS1-L>K0R9MXVUIPZxbTv$5@9BwHCH%@=oe%9
zpnYOh-i(-P6DUbrE;@9gfp0?oYg+@>XdU!hE@mJN=DgM>$77MQhlak&wbSvj7RS*=
zW7=kbI&1F&qKIW`h<N%dV4>kX6=GvmDQX@`fFBnnJmA{K3Lu+yNOCt?)sHY@_NwNv
zo+{ZRn>Mm7RRk+hLD|9e>9M#E`3L$r89jJa;jz!@0ob#e0E49QluW0r?7sTJ@;Ei7
zq*PKFKP}I;4ietQu%(D<gciN#Ofeo}hjJ|}g+O4odoQusE3qM-=;dl%J+y-D>pA<!
z*;d|%$M2T#3Bs80zJVD|!(v2F$pTAh!F(UMx2B1(AS~NgFmeeR28kq*zo110pZBTr
zG#uQ3YQ4Bb2|ok-H=_iH8Z-XIbL?%3_FY;Ys`YouN4@9|7xN8l&&4Ba9a*PfE>eq{
z@!L8fDH&>?TDnYki?*YwVvZ&rKp?x>XZ1pa$kA9(*^kGMIh6nTMO%72)@!Bvy@OLP
zQe(9vf+7W(m7RQtWyhkLqTEk+ZQJOxw1<HN@F!`BfDGqBUIB=8^6Z@s{Gjlq`a5#t
zo}hINU#v>WV|BZtln*ALy^X)*`v6nw0313~#S}pF1Z^T?s1~JzeEZc0Apr*7o1f7}
zlW|Fp(dV!_j5HIoz^#4K{+gIX`^>A>rX!8OyaUwi@)gtS<P}b5ST=03<MDB!Gi=_h
zdL`weKJ&3G!!f(vyoM7QV-ff2+fV1+69u;Vx<TLu|7}0V4R3y)Kxf~>%-$7(!1X?S
z+?TU2O|1ScXL<AdvZEpIZI>PTeO|9GtQ41BPZp$AN~_Pw5~Z23qYMqtg7zlfHXaF>
zcCj#DFL!h9vTRk>Ez@Kn-+!WS`OTn2`;01HWZL*m(8CgObp})}U*Zf`yQ^9?by53H
zh>PPNH43imiPHmvjEbF;rS*H(To+3bTSuewMz`OLc3)=U3eZNgXG@j~6XjKZU&Qpo
zwlDY)m}^FPv?K!^d0eA5mS%`rPo9(GP*m2m$yEiFLWNViA6VJ-JTOt<%^^t@0a8qB
zEqu4Z**5_Ghua(OWiN|6Ac13veh5p#Ma(@~F_~^7M6^evmVpO#?<CXXkj)_k;j!h=
zSw+|2Gv|peQf3z<M4fUXrlopgL%H24)1pwOl(X%~_cwjFg!_vDc74&lAqy_avg8{c
zvV7r~W!&Fa#6~lXZ7QSm4E*kxa%nU?53j+PLEp5jlu|TZxZkFO#13d4VdXl?E;m$W
z)>9)XCAoECGph0E&Cl6y9V`!O#Oj^n(fL)aadIt1P~mZ6YUs(we9cOiXcJYUGZoRw
z&8;{Z(}v0cM>Y6QQtCCd(YDbpw^Ru=DUqWNejO?jWfz;PnV2<y?YE9|FFn1|1XSTf
z9FzZR6yP=TWUad)f3*3<UtG5lJHn`>l(LXmc3}BS(j%F|l0ga33>^Yf$zRqsWqh>3
zTtfCQNgfMUSReeDrI{$St%KF}<=NHlapFf#FPaS$%mqPpY7{~Y<Vh2U;e*W}<hM?&
z;;G$zUt+ZV?B~U-NZ*jd;VWLo7MT7q`rAhs&g1YuIgS-_MP-Y1v3E063`#rD4IM8f
zdj$4FTIcSOV8o4&`)4UeOyl@o&l>Y(kLlIo=bqif%_T6a2J4e-uXnj`4z=hESlr8+
zrG*7WQ8Op$0RwHBQ&j%#H<ki4*OJi~%A45tR_cO>kI%+>4;3oSH^qPuV9<6yoUf=d
zkP6fj1_`|I;1*U>Q0tb7cT@A<o*IL)pOiz+ixYd-Tn>(;f!^`L%_}Ya;_RZGUx308
ziatB<$IlQP(o~;*s3m5TABFV!E%?*0lt<YtctaseFvSeyAMIT<+Wy+*#+gn5uJXIb
za<qBQAE>IejAu2>*{Tz&+U;=cHAeIbP07Rgz{7JK-1xh-b*e6(VBm67=bL&tXI7CB
zQR^jx-=@4slqRU2Yflqxq>M6bx}Z!dZ?Z{vBiE~KgNuOhy6H@U1&*qOcPE%;S{nU8
zi^MyEY=$8_al5wlI=^N@Gb?sNSQZxF(+5bV)fZ=*hB@ox9l9o*h3B8}d1=Vb9Y991
zJe9IXN+4B=>TJJy-#0g32MC<s&otDB{xcXIKpXxQX3hMx&9bku|B-#)b$!OibF@SK
z-O=}v&XRHm-_ca)aeUWs?1t4{O)*Uze&Fhsjq?ys=O&*@w4}r;MytfoLfNd?_kr({
z5G&}NyfMSN{)9ij%$4T*ULu^YZO>X0Vh<Z>|8|{!U@GeT{N_2UTso|y5b`re!^ALu
zPW<E!I%|6*YnzytGu0e{KZ~<&dLZ14FL?~U%b#<l;&szF`culghCs0=_*QjMPh2fU
za+qyIx!KE5_q)peBa%{$B$ON<c%=s~s`AxMKhdi=IyEd@S?59Nr{u>=>MH6VKL!;q
zhk~EVvG?}(^Rw*5l@I9D6s7Q`XY59~w;c;*D&J=i&%rB18TD>^|4bYGcxH1S8X4P|
z8}kFJ<Z&kzt?xwmYS8md?)R>Ms=~vD0LAC1-dRB)u?c7a2S%io!tzh4mTjK3;nEDS
z8q3Z3NaR1PFoXqO?F&1Rc1$OpLqT#e5$t+9?iw~I-ayU6=Kh9L)lFQiF!n`PdR){k
zfh`=}fBdtHNXHwYO~9?tv*7YJ#m;GlqDxwi^JB<%l`W81Q#4w?G!wdB+W|{&1<wwV
z^~}_9RrXHwpv9yi%|e;8-v(mj<ZH-|i4IuPq-%^J+Yx5bJm)7fR;s-aZXwpB>3vjh
zAJfTFt!{oVmF^Ov_<>k`yFK%E*#!#YNgV6(L~Sqn-rhG;i#<%><V>qWJ=?X>Ry?-W
zbN&2E@sukAmR=i5wX7=N=!^`hW~f{BKo*xdQQ2U$o}NzsCB~c|BS=TuXSvMX>ukpp
z%neOieM;@Nm$9Q*jnC?Qpc6qlO)iT-XYVb_PRY0K=G&kRA?Qq1Axlo>q`kO5WTm(R
zTq#JnSde%a#E2aYcn1edZOrWd;e{Lu#kP#iX)RGAgLHS)3m>bj7D*k*WbA%7S+jPz
zt`6+1d!KwEtz_rZAH^o@{!Js4cj4e6C;25}zzq=qo}p`$7P=S*5T@iXTQXxRjI=+@
z)>jhh%(p<^kQD3rsqI~jVKq2mS>RVAFD!LwQ@LsmMrCJ9s+qMaI(@8X>{=Vs>`7#U
zMpD3Yy`0?uaX1S}ziDz8zQ{cXlT)CS-`j?m#0SMN0D<Pa+swJSMJtuQ!1{vKR5_p<
zb!{_Z0NSN|dwSu1;&iAH3A9$sXpJF&b5@S-V3WD~(@eYC&c3wc`v1PkvEn@;@ymP^
z^!ULl(dc`l`bW<$v(br+etEJ<*-x9-_V?BjmtV+*&a@Qnr4FhsK9*QhKKxNoQ7bi%
z9NG{&MSKSBFn$k-vVW8k8wMjyo(O3E6bH4_8Ow`)*DDVyTR~5cycuozC=)uCYb3vo
z8GK)iZBHg1dbH92gxqrg^A4;hU!1?V6(plMv0>NZ{)cJfr5?t8ZnJ#!lA5o_5&P~y
zk6ez-j%SRsE+D4m`v~nKZNn|>ElXjV!kS|F?8+ZQ$8{y)zhDWd)WMyU+6ZtPpJA!F
ziAD4M$#FJF;!WIvmY&^E0!MY}`juVua!Ru-;P6%zg7<XtYNMY&(K}CJfxL-_i|xVq
zsU4SbpHE*FN}b}M_OFib8%etTsc{W1vdumM-y-TpQK;O<$TMgAijxwN#hdJyIB4YQ
z^>?(@jfO#>kQG0t(4j&!2ocTJnL>-eojt0!NjO<#`e(Wr`{MU$ZQW@7y?cHg&bA6q
z7mngpZIf#tJoZkdiLbhb*<x#4LOl!`pL<&guyu#EnJZzHo^9YGCN1<-?f#&^-3Tr%
zlru%!$s#k$ECG1H9#?(eDV;uRt3`?O{g`-hnJ5jd8ov7ZLnyAI2ovg_<+LBVuL6t~
zR*SHan!5ZU))VQ^p%N`Oq6GBB-+NbnLU2=HR)8;A)%GP`1|zF`0N>d<u*SK1$m^ah
z`#`?*2#)^Xb7L>=;gvk%q#N$Qt5DU?<TDOm++#2H9@0gSR$tGd!OJk;<n@uDnv#*K
zaw8|nf&xe`wjW3bi_ibFHa?W9LZ87d`H`|h=pOESqiG8F>j>$4mnQi4u+X?-me6dG
ziyXm6s$jK?zwIxExe>C!V~_bgoXxE$>Gmkg4-+?&MT4uu8+Crf78D(7uDx7)q-z^9
zhR9=eZ$pHSB)2KZ#-u4~^^!Rgt1O{;1czwnO&GYd{YGl?oGy{pKEY>;znoD$<6t4~
z-;tYyi5S{ddppq7C&ZvQ?K+D3wlqmO{Jt-`c_r>PpnE?QxpKP$cnxBF?O8?4jK`=C
zIU_F1rgh3OH6$NX?Itq*eO1w|mK`O2NV+Mky2i2o_nbWr%wW%-FTSf>=7Qh(v*U>9
zE?um8&4C%!C0LKs>4D$G7?JRYtj1;_`kXl_z-UpJbC?`VdgOoEg!ZLRd6wH4SN_9&
zvsajAP?8?XQ;L+kiv)$A$>*G45F_NJyL#_9l>;PA4WqMp^%cGXC+}GRPQWP9rrMI8
zY%`v<uaxcz$|RBlvm8RANr=d9nsv@XW=5Qx>*CG*N6_c(KrZC|6ZH?B@N{eXhTqo3
z*T&!N=ZE4OkMO?)`WcHm2Vk)`Jzv(W<`xxntHr>3l37i9KdZeC_r26`u(Gmsc;|=O
zz@ua=G{AZ6j$Z7xm2F;owW_ycA~9Wp7PpmcHNxtx<B)ckK7)7#%z#WRUv6G`guabq
z|1akjhZR~YX{8%`m;_cCS}iYrflcpKK*`jc^yiQdyRcN_VO2rMs`rgmAv4k{$m(72
zsrN@S?jY+&tv1HSpm61G^pe_gx5e8NM!f$cR%N3e>+(Pa*j92o2MwbS=9rxf#(vP?
z-x)Br?DbY{Uy<3K*p%Lj6C(^s*B%PW*86Nol$Hy4c8CSSyU+Z-!OmEkVWGkQ4DCf1
z_bp{S-J@|hCI(o`2LNLX^i5_z|F}D+LcNa~o)T8MBZYvbNK&_|o?xFlt2QmbvZ=y;
zo5_FftQ3cL8%DCs*qlQb|IRl}7`9Xc8`|RLY($s-acqT#;A5(M7unVjW6AHAc!T1*
zUg_-~p-z@f^#i*Fhyu<CsrB@I+~|yOK*!<>$v3F{(K#~{+mf)Xc4h&O8_BDkq+ooL
zR)nQ~{7ILs9u1>ZdCxah+R^?Koy;Ze0r6k-&jF6vGnIn@2f4;xdgMys4yOm`gtU<L
zhv5f@x5!pQp57!#5S?8&<$-t&ngp5XB0h_-aU7$UV8fw&-yiJe4(R(0Cmmq`)ffdt
zT?t2I8J3VSjm-{jOYz$z?jkx?h=2cwc5dY|jd`?4d$Gxw<*Pw&U}!uG{|m>JOMm@>
zHkZa$3I`s=kZ&Db=LqNyfyB)Cz-(8Mona%_cnpPN^KBr`?;@n_y4NIGk4%14e_zv%
z4Oe=3Tg~?Om!&*ntyq4xJr`Eju)7rhSvlL_6cJscaCrXu5%eNde1n8)%l!TOi;<vR
zYvO?4BmsV&$s+wE)_c>F9C>howr_ef1UD*KL9e((wad<9&+-VR(;Hx3Dt$l78G_E#
z_><kgV@AeA`&;fYb=B|yEAhO=2raIQkY86N68<aYV}A$eAHIa2V|7ox`X08QMdi@~
zzGizv>EqL*b-HDvK{3YCyZ9=%(>b#{RQ!A}%npAJwN;w{I@mTZTgJ?VKPel<azf-(
zM~^P~@jJDL2r|=EC>xgoEM^tTP?6>FebcS=-09=9S~AcNz9(<HT=MS7TBBg)8G0hF
zmZ*O|rlcS5Vt1b2?1{-AWp>)cJ-p=uL8~9V58?OrFr&6jM#Bt58~R$d{ZPU)qbhsh
zsh|I13uj2{*FCqO43VCK8`682IuL1MXpy@H?;)7JGSoI#6EmysQ(a1qOM@beDuUKh
zpJBc16FO$-q&de=xb0gyvOAT(U=O}XR}DoTd>E3T;s*_3D`dm14&hXbfi>Wn^?$K8
zVA~dS12w%LIAR56;nE6sG1$T<(?Zu8lRHQ0#p0+7%7+vMlFaN(I8st>wz<2}1`t9$
zQNI4a=o@n!a4j~5+#pAV40P0ShJnBS5Q=eL{^w$jG*!)7|G`>tTM;LKv^!+&T#p^M
z@dd0J7_@p_<X=A6LN9t?MJV)?U&m8<2dSdm$oGb#Yp0V1kzzJXX~9)aaHD1~29y~$
z<aB*@Yd`NY0$<n|&~ed8ciYxtbKxob17j))t7utC`>PBmgQr7zYJC}vv!}x`JEy;h
zUC6on4`_GQ7c;WM(}(JO;-XZ9&L-~8Obr@c@o4&MbOLjAd?)wj&Ir6fiTf}7e&C)M
z*v;gAee#<Vu=_Caq`ynKtRzqRgm(FiO+3c8espSazY;02gPi63&_1{fg;}Q6kSCZE
zk!0p6pF7gT8URjgtam0dog{lQ&8EJn727GW!yz6;qqg9T;rw*!D4$4Ot3Bmi^7d4=
z_@DT?kD8(<6WQC36K_XN_kICxO-JHf8lg5aecUujQqY~cPyeA|4@918-vRi}K4Tjt
zR!O_(#I>JZ5Ua$ouYqVW`>Sg~a1UnjC5@<$Gx!zUy%nqT$Kd0}{(>K-s1qyelfEZ`
z6lg;n1IM*-Pq)1ue@5S=UGVa|hj6gE^v2ylIk%}!>H!bO!HsIYi#T24$*acn&1<lv
z(wzoEPJ^3CE?V8q#CedeBB^vEW~qao@=xq9EB~g;?`q$!&ujb;6a2nTuxPwIJVNqL
zDzlqc*=X|qAjWw}{eVqQlM+}wob80)^Dgco@Mmh9CE=(5TOB(ZIU@+^I3J#Pn#$jR
z&ZV@Tez{L%>W2Ax%NXjSx)iA>xy=$UEmpQv{KPjC{@p9NhzDQG`;;|5bNA<G=KPC2
z*w!CfODC`Y0}WH>T7E61h2tmIY~mo_EwujIK~i5|4hGKM?^UnxM*Db-G7NvZ^ZHrl
z7*$mlpo7XdQ(23_ch8S5!ot1t=Du0JGR)Oz5I%sVLHCaJmN^e6#DlQ!W<I0yE4%%V
zm-`B=Fz}+in&ThdGZ$x4PgtLUu>StdRm%%&#WwB&Y<07qr{etR>h|Z^T|L-_b+9mJ
ze`nSmP<br(lvP^5mco5rg$n|0#qaCutdvU2pKy42O|SS`|77R!D&B6pLLYfd$sBLm
zaC_)$`}Q1DfFrqPncqzMm#T+UG*)4$&+nCVv057snU0ryMZ1Ans{9hqC6{esNW=H}
z$5<ba8zfRcRNYkk5)pg|#-$ECCY3Sy2i+t!;!Dc2X8+P#TxmxZ_nkWNpCj-bEPX-d
z3a$_sXphTSo55O5PW`vjsFOe->mNKoan3bKKhM8+%1Iq6)F3KNUYMjWx~>1z$>t$J
zF)Npc1EGd6Me9TU@)(=9FD(jHm3gEI!$@zWf*4`A5*p4OGYSC+V>u6|Qu}s0PJe$=
z<Q&%d5wy7w;B~-BD4Q*2T*Wwq*sQT8X6=SSGWMPfk5{e|8a_R)$JfPSUEVb04)PtL
z^QGD-pu@l0Px;NKU#&l@HJY0dn4k<}+VJv=u-|{HcM1#q=LuV@jzSFw*tL$i@o>}{
zR5gr34({QS4BBkxBlC=cwpgN3s=7O#2bi<GMs>T7IhQ{7<qD2{py(e>Gu1y!^?NbH
zmf-~6l9V_x7Bh6A3=!rEmEJZ-P(W|Ge_0I>oZ#%90U-2RSX`|C`tUVIT+*81*ZGF^
ztVG-le*px>@OejfqGk+;ratr%L6$85S~mJa?pMPCULV=QFEC;W$&z%?uJLQ-pB^I(
z4o)hT;`mJ=@z4JJh4&`EJP_nip+62i?obciP~c5c;Av1`F3JXl&hXH8Ntf<G9yANX
zKzmvJk@7=SH(%U*Jw<hmt_bLFLu&?FeTJaxWK4sa?Fho4@&%__Sqx6G!!oCT*w6p2
zzNv71QetPMK_mH7`@co;aF#P;y(Q)WG4;?L^Ud`mKi#t>GUjl|he%GOJx9dkrb+kc
zEJpR=zbxc{Rt7tw?@1qifi}`_W^qFGG?w4E{@aX)*ixrk{~oFHD0!+#sj8&9(Zl{y
zt|1J19_cCF(5_15RsPtf#*pQ(YQmnC)QtbO@1Ij!ujBCO1|o(Nnvw3WlVTUGk;V0u
z_PbobGKUWhH#D%k<5{x^bMA26D=C>+hOQi@e;U!O{*j9f9w7)>$>1oQj`m;wo1F*5
zg|2=A?!2;IL%1BX9-aZVgh!8mQ%fm$ySk{*69DVw$e&quL5Eafu1p=srf}|qD?DsV
zN}S4aK9kBs5`~YE#cGasYd(yc;efpS6wdLZx7BUkxpc}R%<O!%Kgr9po-C9>aWO*~
zY(^Z)?8f=}7LgbPWW8TKV9o!^UaYb^=yT+884x(O?XSjR+bZPV^3SN|Lo&AWZH08L
zh|TW|1&7|8y5BAT*#HqgJl72ceFK$r4(ZlVP0&os4I%Vrg~kgPMsYw%F>L9MC4t5J
zU7w$OuVJ5p$fnvrEEB2WfH|A$hqMB>HI!8Wy3g0latnk4g<Y8*&)PzIO|g{*3z6pW
z9mjmaRPWNZ^_j-p{v5YTk==@aWhefd$YDs!=`;fDJOj9l=y-vz#HFo4#+zJj2hbuT
z_Fm&>X3giN8MNN{o#EhciF!^5dt2EUMN!aMt|uAA+o8Hj#-#r^`_kp~;Ff*I4ve3}
zS9}-3Wclkzs9dc7wejwv<T(xfH`#r88Dh}pZ#dFaG5Nl6bvH#~5h{^^!}CTLWVLq$
zbbc9OH@se86Kxr9|6pf2Kk-d+$Di=-8u7qQ06oI#Rdg8&XR+{S8@f2ymDRvdx>vVF
z@qXm3ML``3DS0g|YRIQB2~-QO&%*SAneH6QD;;NYaRi{^ZC=j7Q2sR`qXL@mP6nlh
z`6awUiV%6RQU+#hjR}sMk^}@h>Kj3T`?^JMkL&v!5NA^@hq>n&1TQ<f;`u#+&{$+x
zS!Z;K3BaAYndFt|9vhj&ixjEhjoy`)d_H@Waco3fNS6O#Bw*OvyZN6%{gb2>BpxuR
zYg)yICw9kQbh*NDGp-_F>4Jw~Vfjfb&n3T(2=37jyZ=tH3%jb`<BP|jv2V`?KBZKa
z?OELnTbIi`x&^5_wTWyU=ZSEIgSV}s_J+o>UEIPxnnY);6Q3i%%SAyq6O-M4yn<#h
zMuw`TwrqvI+GQ(5I|ooK?9&flIPS%TjY>dtIqb15!IJkG{87_00{q49g2LF$K&Wff
zZXIGjI`loQy}iyDs17>_IMPa~HpSni*tSY{Oq8I#<h&7FWjkDBxgQH=R&;y`g^MVZ
zwXmzmWUWpC9bKbrhwII_YF|G>a1a{HdKmoJ+j2B;Kf~CDIm?N8{##eh)85Tn7nAZ8
zf*i6YE>OUuc_6hEk4KppeS~v?ASyso>9{2T{9~H8M%?gk@11A=i$Pw$A_UL|H%GU~
z69ci1QgP??KHpx&2V)fvq0w)Yb$xwpEP#`#Mdy<qb*rYNfv%zvwEE{X{}W^o?gJLn
zo<y?Rv1>OJdoaXD82S`Cwf!SRno~uU4{M%_HtHRyLWHqe4m-g*(0nC^Pbs{p_K7U}
z*sXUXm4pjxXES`HFLNU=S74uKq_GOh87Hz?>QWFeTh6b!NUu3(Uif#Y*&aJj{bo2I
zjuwINAd9*=Hr&}Gk(*^}9%(Iqm3^`~X%p_lc|Y8G*m?y9viJ^r*9l6;#zos8e9hiv
z68mx4PA|OP&(^!A1XQ-Hjt)6otSh@5n~xvrdl}&S`N(_^W;M#H_FQA<OFYv6{$P<W
z;h-WCZ&i<a<JsXhm3mGypSi+1JV%&t6nOm9v@EsnBiopjde4{{e*Ug}J<qrPS@+Oq
zHj0IdP$s&!z5@oDo3Z}e3dS?0-Zmb-tjl5$=&~5{>3;`7tE&ehJP9`d(*nQZhC{Sy
zhlZuXC3dlk06`gBaU>1R50XTvm3>C6>gR-mc>{`XnP3{b!r)G~%Q%~7p^-s***11q
zrhv_mAfvuZXA|r&0qfP}DD~w(hsnuJ=lisf-rZbpZ8Wj!8+|0>C&)gP8<+*~!9BZP
zKg|bknz8Lt;HKY#yMe86p8W};MMVVt8Q9^*+9xF2-f`3mgD;S-G3o8v72ecvlNF3v
zk@bcJ4pv<I<m}5EV%IPjkVlVNO@~0%=eUQdvJ4j?4vYf&4IB+wPo$^pL?n*=o*4Wb
z#7Ccnx2TGq!05}L>Xemt<<G9$^~1y{ay5KbHEMpnZU;8Wy(_8c$MqUN#X!vP&VHS{
zeoDCo5N$cH6^s%*lpF0XQVO72O#eFvK0;rxjRfZ9gHWYAFI!!t?>9+YZam<1ybDE{
ze>lEly^yXJ{I%MU3>llda9ptnRVATH{nkW+H1Jcb$A9jrzutQde$S7lRxi49&#+at
zR!8a0WC%ze;gf&+yI!>EJ~V4IhJdUk=i8mqROkcfLSGeF3V%0ZIniE*sA=fV{Otgi
zcjJdFk1-R=ImzG|+K@Szc8aZaV~0te3yJIrbk5fRcMspQYY5eMBFCi!{4*oK1lg9>
zb^h8DxcLfI5SM%cGi{eLCWkrNdK4|VN*+@7TpSG_*+@{13fF9+onFN%Bkl$*kMPhi
zEr-<8PoeeM?Qf!D<SwutIU4#^l#muK!?;f!gM(6$vnwhUvqFLu8oobH{@q{R0O-kI
z{-Y;PYBK?oTf(@8q5}6cJ@TG$@t>eTSQ2XV?a#=yx?CgIbsia}cW+SB0bZC>f58lM
z%#S9`b!)=V!V?QE>a{Y%4Pd3WmwDNq(D~jeQf==IOpVO6Kz+(m<ESkjDAovXDFAwn
z5^U1#>!X5pUrS3KoqcK6Y3rk0la8$UnC3T!W<K+=P<y2iU?tKR<K+)D3X6BW<QiPU
z%hC7o&N6kP3PgVRXT$7SbigodwLz8S5G;j+*oZ>b0}1%5JY9`|SebQlT%M1|;Lm$T
zUn>jmXkyx&4f(p5G<<cDhFlvMOXmc(d>`xZ8Fo%w8<x{A@Ugep!7z+})PIAKb<}^E
zC+Q5#+^5j@vit9Ia$4XB%$|L-L8{&*FF86Oy;;ZS!Ph4}rGI$W7@y?9PVfn0O4hMe
zKVqXekm83gv;`h^$~k^wSeQcxS4}rZK7tnOi5?vOWtQSTmA6_h(x}e^K=e!=z?A$5
zedFw%7r<rJX`1{XXPd#~5Eb7j>_{jnYtad@Z>3;mht!z$O`k(E#CcB}CEhE^zkY_R
zj5zmPU8PQqH~QrAG-<UUo{hO@UW0((1wdf0N?xP##Ts@wU2QNhX5}Y;Zd+mdw{?5}
zMV=|*B9ebcC|CxX4B$ET(^F$voMNe7>&`{NbOL@K>t%TOfA}@&7)v;MFDVgQCrT)2
zHp9K3vhP*bhki?EOU1-$85}9bK8C7#351rFFmfJPM&M><OefzrwAU=t{@8E(pWmnt
z4V_xedL-WEUvVICHh~<T3NjSh^%zVtTi3P+O(vj%!Qk=(@l)%Ye9BfbS9ezM*z5u~
zHu#!>7lYfVh=432SoRm)zk;%3@ploMp=s%#1pIk6Vjn?OSL<B&>->Lw36(JXa>se(
zX>b|Tj5b?-=YWAYKxTTnhw)>`+1uKi&S29+E;+>a`(8Of)}2%ZJy7N34F!T}CAZIR
z*q^nQR4c|lc`xt5d2{%7(oaE5+k8oe&+)4G1NG9acuEI0$x~chCenRN9e#ok^SPfh
z^n1DJyn6-}v(TOFXEo8JLh|+2#Xgt5`L)>%XAD}@ahXpQDvBglS16`gxbMUW&ohmq
z`S<dE$vtCL)_ovKn+Rxa2d74_t$hsM&^DY)^~8Qo8=4aCL+LA|ex80)r7nT<>^2-m
zP{S+PVB=_`t(hZZqrM~JNi1k3e>_4ishHr0T!Qj~T3-ZQR&?}DxxKl?_vbmAabk>1
zrx}1#TCVL-{b{I18m%w=+awjpVlMSZ3<B~VRjI0+9k^B}6+~)=oA>DImS&#$)b48c
z6%sT(Ypgf$c0FCRs1dO`4`)s5XJS`z_v*f~suMA-!{}lnCk;4q?NT;&jU0Vee{}t;
zf7}iz>Qn*H>fv+IpR<7JzV|jVBOHPL&S`nV$uUNo1pYbf_@-Z9Dp5f}o<%_Oa3fE_
z=_piQO4te|m3jMQl39H;3hH1Bqo{h3k8+SK%A?6?HfOrcs5Qe$IqHh98D~RcL8Wze
zcxQf)!_BNiM9@1XHR3m&DUP0vVU2Il^(O`aGwo}`Hp}lB`?yibl=A)Sg0c#%h39;?
zyJK69zTqn8f@onvW*=E=`gq7Z$3q?5F~b4wTXPd$)~S~jZxE;kMPaP|apHsyaq|;&
zcl8O~L6{<D4fn*ZVYx<g*>fnu*KbO~1|~sTlX{;4ArDu#gudu8UWsm#=2I_&EW+{}
z&38Hh5-x`tk-zRuxk&HuSIIhjjiAD&{nR-Pt8mpvL6Qw-f;K4i>-I^3&S9)+%9ke%
z7S9*Op^YF~L||Wzl&wtGXfCgF%Xtc~R3bZzCyya?G6HB-!22Ma8OZz4nY=y$o>K6?
z9RvR0ev1zs3(pI=5^!Y)B-O=)j%it+4pO{w2}oqtz<OuEyR;HUN<EH~{nwX?2`7)$
zXZ4uAM-3l{vIqFp_ODg?1}3_^3w-0CD4LTNNn`tRFR83UEN)lft>@13tUH^!J&r5W
z>Jq((#ZZf4rx=;Ug;2HrIVL?-an|*plmR2$UuRcqt7lNv&Af$PTa`Z4H@OycWn2<w
z8<88DM80j6yb#oWUGu9>prpcaki;5IR5GEOkWUE%kVT5CcSd_nl7NcS^O?Nm@VQ~?
zgy3=9gVM@D)xw>>s@(nW%)V@u@q!l3___7+1ra|DAYtRxQrnn~!IrYWngz<c_l_sN
z*0cxu3EgY|)BN0|<Yc%iv@ePH0i8u0Q8k{3_9VCv?%t>{Q}|9-UP^wma>()Tkunqy
z_|f&O|0fZ>bu*UcT0|=)s=S`OpyYN@=OUf|)LD^A*^6D=ry|AH7xu<1Wp87Z1tzm=
zD~wAH3PrO7StC!uWruC|VReM|`{L6io77hS*pNs0E<Y8=XWUD^LE+X4^L$%68p-qU
zWg8AV`9j_4)?2RmLEvYR>$iHjk7ObPUW_!!W;8yDYNaBAy0vk}1dzO$XvaJ)d%|ne
zrXSaVcM?pY=>bL+X=;5wf1oDngdF~};h<A&)HIVa*3}<DT6?_H!j`3><E2)HNF711
ztNau%a<?#%5<L4`P*VyZaVK2u=Sur)JMiBYj<E0F4~N~xwb?4}!GMFb!Y11~ki8N8
z{~zm}Yk&s<PJ4yZU(aAXI3IO2s#fBCFNZ%GJk+Q0ZMRt>J45tN=JFTOpS(0oQ^+SJ
zXcn!5<AEqiXw~)!eo}qGhT!%=qpQvTDOqevba${{-3a$7soYP7)2F9_X?<S3X{m}x
zv3b>CjA5Jic0vWVYh-F<`81orn~a0IaBG*{DoZku=@yJ;*dB^e{R_S-dx0Fz5m+$i
zZ^7w`lJrsxg?r|KS?&oBquIQThf5yqHa|yIRP4OX*0xhXLH@h~c6YrYz3=2NqMb42
z{cFyAMF!)HRQsi1|Bl|Ny~^r{63FznTHdxT>ZDu{6T0?n1MnydF=sxM3rp|qKJ1_g
zFgL|1?%!xj=|CHynPG<yyrpl8l|;olH(PqOt2J9bA5dpFz1L8%X8Jz<C}tfA9f8)l
zCBi<`6zpW5g2#Cxb&kN6n!gpQ<a(MkPf<bNvtIp&`~&W@?xh1wFPek@`t7v4m7JDO
zwXd4`JR>?BVrn(BMJ-@<QvtVvp0RS%R_OTM3Rv%(wV^vGtpi26L6|U{1)DvC-{#QK
z9i;9SB9{)b%9-7Cez{lkcKyLz&>pz*eJkJZ2N%V$4aAfK4X*V0S;sxgwik<hhnP$q
z98voaL;S6qh3%aBO^@@LI|<V*bL=Xi8KrRabq3~A9tF}vCM%@>jOm=rkVmXxt0rcf
z94I@VE;ePH3bJ+j`2;dV<6$p444!8)`3s>x@%S$8B4+B4%AMDn=8(^ouH-CW))!`A
zX$wvCGSF8Ri#KV6saI$Q*fSW==^Bg!=EBEycHgAb3YR<C+@;muxqs()F;V&c8f61{
zJv2Y5%vR6afHo<;h54wd=+R4zTqZOS-utgK?%9gow}qKIA8A3n;qgF6p5@Db9r?Kb
zTmbKN#g}T<qI{+g&U2(2-W-c*Hv=(kx|#b8U`BSi_XV)V6RO*RgDhuuPP9m)z|A&7
z8HxZY?i9D)a3o_EU(Yz5FZPays%9^<1bxS8mR*E=cOTHzgvUp@vSSr5rt>VzIi7y0
zl3FH^4y8WdR|(ww@dWr0{zYf?mgjIrmjtT(RksK!$&+I>H4O@{T7IZmHe|}FLf^{<
z8#H?sIhSd&yB*<e{Lm@aLyf;EoKP5eW7iV7XLqpKyehbj?{$Ep^>#@MMnRex2b=P1
zDLb%jb6tP3EZH0m^3F+gJJ;w-@QW2NKAn^4$8K7Us4qLT*2St2>xqdm8u*^too0J9
zHB+B9-#xq(D%1M{Sn6#}_2pbehRsYjffuvfpdEbEI`vH|d=h~n4hBgSlybonj;(M7
zmq3+0$HQX2AYFTb-v^sb$GIC*E+Ut#xF)U(scD}@Pd5l={%aeYa8W|k+U~_h>X~Cb
zpE2A@1V4f+i{Va|7(J9>U1-=$Yf8sM*u7F0fu0rr%KeC$++LCnXg$8wrVdg*{0HZ=
zj?p=}BBu`f5aj$tE*I|;KWVSv30g6Z_GC~in6)4Lkn$o5E-0G)@EEJx_T+nt-Ddo+
zMRTdRUwe&f-L3?I>7f)3|F&&m8y$4!L*8o=C(3R$2AT!p*oh9x%tpL7gq-kLZPt1{
zt!^IM{->^ohOuv$T`aa+dn~Xsq5M(zq7ho5xwBITlAX~T7)ms4E!`_Ck>H?aZ^UXT
zuDS_A8TY0*HRw-LdlC3iFFVF=&C3DBq>+fW2;JKW<@wqIJF^Bp<CFpg%&-ze!)V#?
zMxn_S*fhqMc1?i)7h*b~7>!ydN&t)8@teS&@#W$3&b~rm+t`y#(ytX6K6k*&`Q)J%
z7qa8E#3C$MMwx(r4H2-E!4hjYj)XQgx%4#A;yv1$^b6__g9&y~ch4pFZLf*{PF)ze
zwEj?&;?Y=m*Vtm-LD2jDa<YxPi`>@IeWf@#CF>%MvpgB4l#}*&Gy-8#%JcEbLecNx
zpfW?xPyq!?&o4*dMZq9@M~5folYQ*|rEN7FWoY%jU3=ySGo?QtftqLXIKK%7q9TvO
zxtO-q?Jg?x$}eZMelSdY&6!*#D7X__OY+Zq4gPtsRl#Lu41~r@(&IU2@G3hxh4r5u
z)4Uls)B~~vCsNeCUROz^QR1wOb<*=Y6vm5m?Mbn50sx03?NkzuvuxA^$9Q+|1nlZ4
ztB<xKr=O|fh5yTmp)bTZCeS$7Sz`=y`?Iw<`?>G;HvisJ6PsWrR6(jo1&phzOF4{9
zvF!@c!MLQIbs6J8YsccOHkBPDiAJL3F7)18(fm;s%d!mP^dHOX`|9vv^eLU*DdzBG
zR>!=x&)rF$Ho*z@rgyPle%p{DAnQK&t4d)t0|e4-U_E@%x3H$Pdztl2=m-xfGw>d1
ze2uF-snd{!PPSZI1y^CD<qsBDgt}t2Rla7G8~Gk6cjHT@IF0x8WmA4tm-s^!Z0?hR
zW(d7t;_1OvyqmGx{B_MxQziMU##@NU+@$L(LMF?9*$ng(V+(TkZ~XGyJkTKx^g|`f
ze$5DyU<3ZV0xx7LG(RCX$LP%b+hlk72Xta0W`rR#`ltMDFP_Xo^-5wIl&5vg+_QF1
z^(VMz?*okjvL5WtZ2-qB>fBZHrjEIS738RWm$?lYJEC*?-0B*ooAq%AygcOqa-?zE
zwg&ZHcJ<HlhwZ_X0<TOQqY?VK8u+9z_%VhPB!EO&0*sQ}`pbe3X`3&YZ=QkoJo&Qh
z9B<y1w=1TnP!1JIjlN;nrqBLlHrR-=%@SWmcjT7La}b$i!L#9Ja`5`aeQ4KAhV<zd
zJy+E#io1%gKetg|yb6Q9UQP?X#5}bFwIT$~%%kLjdRo4$!FSY;MMD%n+j`_K!_cK*
zW|*o~ZU&^yy7y%!Lyzx`oB@ONiP?;|W&Lmd*f6?guTg&@H|Yz;S<`Qa^Sn95&^Gwh
z;H%TgL6XRGyZ09yMI;U>At?ieB<MgqfqJBjtv6$Yb@bgQ-~9UI>TV#Tix%&c&4DU#
z2XH|MF!IPrvID``_d$!nrc-HerQ@!(fG6Y!X7KiKz+83H{xwdqhO&l_DBtJO^EYTv
zW)lfEQj(wz{RS1<e7p8YvY0Od)fV(qd<KsP(I_=*P3<qNU*YhXEM+f|gVQyUQo9&{
zuQ;W^Y3TswSQT2|68M|vFGYl?R@Sf`T@@o5{0+-cc#X5)YB3W&q5hI&8$8FlZ;+`f
z7|;<Nh%q$i8DPgnDQ5x4J}{m00AF_&<FWDKXvMu8*?o3CiPf;Lc#uu=CwNNB<rA1{
z!$0+Jq}~dy?*iI0&GzP7eU0KM4`boCO3KU<evW?TPwu;7h6jNce#Ul$CXt8r=o1{4
zc|;3uudZ$$r#!{^?4<267gKFpGE-?2q8dlcLEo5dX6}_BH&cL$uNGH`)k@N+!gM+n
zdgW0DF<dCViM}Wf*|9cO(_+Mr)uFwpsXpO{-8v!jZtILTIL+lMxsGi#fc0wj(b>AR
ze%u5b=rCVKZgN0^h4Nwh)cbbnO5duVP{_>mA`?}G2?|KtK2sHjs3`}C%i_m_y$^K$
zkEU}EXZrpBcqOTvDk0}|pcs;nb5Th`@-cIqvsjYzaYP|GRdPP%OdE5Wv&}K*Id9H$
zHgi4>Gk)*B*Y*3?AMCRC;lA(J^Z9rH`Km5y*<!ox=c%_(emHq9iHT)#7B&(@C{lCH
ztbgNOqSJ%+Tb?_iIXIQ48=GIdud+CB!-yYzgWMlwc|Jx*ZK96}+^&tugN(_|Z&RD!
zOCFm)k|+~C7`qG|Z{mSvvhe4EEVk10%A<CxHJxIczR9;`cU*~^%F=@{$lE`%F_n6S
z-wrNPoPB5&S80m#&@|U@YL#VDBnlPP3E{pU82P}t%fvVUiu+VQ(5Bns8&U*Ux89X#
z(FgS?9I6!gG#@EJb(gB7bhxML-zJy8cHEwjWgWnYhdsS<zRBQWpgBOB8q*zhv=aD@
zIo#E{VD)9QOcHj}M`!XQwzJBk7s=?);s$&FP`m6Jqt8NQlK8Ihrjn4$*`O1nwuryX
z?(LVymmru@WxT$%AhfIgGJIY#)!DJBx1Wk>TU~$1=&wCN{iZ(Uu!{>&pFMtSxc6Lw
zyrn~ZjC}|)HRPNzMm%ccuDo%0>aJVK<%uROrz>vg`JUSusKO?Q+By2%Qn~X36&se+
zAeE-Fl33p2;uj5{q>RaLoV{kpvW>R3(B64ab`4Qj5zr8n{<$_PvSx=0E+Kp$-XD9D
zWn8Yb3#+fp+mPHwyLfa9D3KG~#a9_$c0c(Zh}kCT_^PxrDILwr;aTD)@iyJGTu9$x
zn2%6n_fUAc-63lntx_DPhOfpqGU=6GlYF=&sJ6r{cYJH*Ibdmdz!Y?5_Z6E83BV!U
zEsVw`(c>BGZa$?yOjt(M&rcS9X!n7bfR1_nVonWhVps0?5tt7l?y)Op8Eb_p3bw0e
zt&2L3w=)y{3Lz>knM-XBNv23#s?6d9`w;|s9QIwQ<Q<PF%$K7EvP<A-6}Dqtxbs8W
z2m{_Nz_b%C*XK==56VLzbxR|s=<boPrJJt#-tAIT%AO+`zHQzp_vYEiXx`xH=c!E*
z&s7#-QhHXPqr&UhzQt}<=8{d<#|FVkp(&O}+?CRqC_S(&0xRSD?*0Dv+x$s~W8s)z
ziJ#kQXfBs_o(*bIp2FRaeOIa%0}$^eU7SbY5~5wJqTPRZsN5q4j3wOrt%t4SbHiXI
z5beG}#IOOlV5|w|=jw6yB|vCh)zr`E17ZrPh8ptxwbKj_f1^2G#z=ruHrU6qyLIb#
zSJi75Zx}T)`16O$2d@3Jk}ld?B%Z~D87=tojspz+d<C!ghoN`vkoSvbl>@yCL(<D{
zkRJ)BYg~h$>4q_*V^I;Bnvnk9K-_1y7Mq%1#m8Kla3cyAs2j#Wk=WhH+o7E*fBI;~
z*mE)Y@hxf4=Jkeg|LEs@AKz8IpEr!W2HxCIc*M=1G}@eXCr3qaNG)xaEHT$qqkbAL
z=P|d#eF>D}IxU@*kx_|~ldu?-E25jxGV#w+v9P0Ef`wJ*KRPg;;m0(yzJEqb@QqF&
zc!UOUE3GDjUA_c}%?0IYy2Jai94Xu-Jla~bMPEVVIv`OC3oI)%yB>K-S#HB~zPLdT
z@*tV+R5X4rwETZv$bTGzoB!-8Qeo>xTE;IWHZQone$ByAI(<86=PPel4#T)1!*1KQ
zEaC$w%~1l;$RnB=;?lxCdirit_UbMnq+d<3B<KL*Y~$YK-FvCO^_8zlGqF<ro!wKE
zKK{O9q$U_FoYEUcHb!mB6{QuX=J1FrMKPWvG+U|B`3^Cj1aKXPocC|vU3o)lH{+nW
zj{WJWUwCJ(<=@Vn*1IJb?rz^#_&d-(2WMAB_Z#bB+q#Bvu(FuC<nZhY!M)6__&oPX
zMf7t~iY^mq*Vs9v#mmW4)<Z#47Ti=PC$Rz{Xo@JMf3CtK*5xwupfilg%=IsSj`#R1
zB=a(ZE<tCvOE*oEcZ@WJQs^xU?5>f~pY^XTP1BH(K0iDzykr6(jmK}VWzU|f;1h)=
z&<;k$0waQ9R#&2SV(yZ9`tA6oMYZaEcVQ(u*C%#jY;~gxNE&Kv?THbeP8|XTw!h@m
z1>F1lM``7oZSaCOuHcg*jIZ<{Vl6F)ihl^=b8lyD_D-fOe}QDNcvH&sljv3GyK4%|
zvhC{OZ6HQhVV(`e<{H_>`M~-&?gx2%4+|Q<K>BhtxMm;rw9=;r!5YGEpqDY2Z}cug
zyD-*(zbcSIyRc%}P`TwRj6hEh&u)=IFYs{{ak&t!AubN3%%U^ABX#JO9FGJ8P+P%}
z1!eKc{HK>o%A;3qAzOkK88FM2S<e@R8K8EB5iB6DHwDsU13Ec2DtfB&=NS1GVlVBE
z>=fkoipE&=0zd|RviYi|?q3X0K+8_|<@Z!GbL)GBm#0j1Ku2h6kyLKsEU-#A?~g}o
zw0zB-RVCV3a<61}r=Dr$m;xsPRQfj4R|gx{{U7!4UWlTo08E+E%<Zn@T3CXDGy<zu
zyJ4Wk*2@i0v4rkz2z3@Xm+bEzPe$RNV=H2uD;(>nWUPtn@l;G`%GfDr9j&l&=HOf=
zXjhJbV&uJK9HF1Sa=C0X^`%bQI-cZ}eiLA+cR3jXQU*%gRxIo!E8N}0usQK!={!m+
zNl+KsGkCvErf0Cka_~5V+&%`{Cj9B8>=5F#Z4Er;A8{U|E!`jOBrVTcbvOlc$Si+g
zM<C1$g=Y|nI)Y&1p}p>Zoaid%FaP{}l3s$q-Y4e*R%7tWXb*i_w|cGlY9ax7Xou-b
zA3=P#E0jX;avsTLlw>IBTFd#g54~A8Lf7iND1OnTIWSl6foM1$__+0aazB<7<8cIA
zfPdJY%oM)OX)wQml29zTB|IiT=x0MZ+aCTGVD#-dHdc{GKNRUnxxR9%=moUlNEn6*
zL&*Q#6Dkr}+3zMF0iQR_7IHukDf(+#{umnRs(oCkV$S9Kd~Nbhn*pDdN?F}9vr6l?
z4cadOgtJae?%SrA&Mnm1OpK(h*Di}Uc>zL5T*y^?@{OJ9zb#`ofA)`+NiULhkx@l$
zDeAqCm5t6FKY^4JBS`W`N>2GTKm=?@3^a3e=j*|NWS6CKAbd*74$pv<^^t=AF9n&E
z<Z{;%AR`q>dX<oFaoQ?^USN6pa?LGJSnXPnBu1fZyYr7~p}8<4MUwu6Z&UK?Zmvwp
z3p0e^319q_!~2gtlE*Ns+P;$~d?C{IYzQac>PL?>T!KQ$R2HfP#}N#s4i$P-drf+G
zs94q_pzwjtU?`}Fl6B!l@9L+iLR(U!C}6?<79d9Ui}kV3J#3N_BBOs+L)keI@129M
zP)r(IGX1s3X1Aks36k17cSkAyPjv#}T740~U`|>|eRYGLdo*7|$6Zv~Zye|or=lYH
z<0ObU)%uENwm?s}T8SdBsIH!%XklF9Tlhf{Fy*$v#ea*|uTW%OA*AFbLiTv$lj&2R
z%p~gjwmYm$aC(JT8`9zyl6(&c{+K!U2vOh|viinTK-*G&clzKRa1asEX{<e@`F@)D
zoXDNz9w|{}TzvF%;$jiBe)sOUL)=N}SE49?4|U`^Li!;2`T~rBW6Rfp={?fLcKEj$
zGdcRbWrqp_O8!xe8MroGLKYxDk?#c^1v)R49q9bZd~A!&D_oUGkAGh9M+(_8a6ouL
zILXAw%$@xv;1YH)H2<E<Ajw55eu^pAxn!euigL5gE3}<Z8YQ=^IAg57hsyCxRn({h
zkzooeePydjdeOofx|p~!4MunTn<PkAwl9;ncZbo2p-tZr1TqifvFjEL0i9B99|zor
z@+@d%p73?F&YFn^K#yIMEFTEr8Ndl?&iO={k|T=0Cwy#oUc+6un4|eH+)vCkKyfX1
z!3pC$yyLe3>H+T--gbU%pOrv8E{lTVa5n)QN=T-`xrlQVY(i=j=E2{_FQx`gKQG^J
zoj-K~OTknf3{BW3ThQG}%Yxy3c6->n2i7)hoW0H|Ssz>VyZwi1qwa-Q$M}LhC!(AA
zU51ALD&_jzCU<8#NL4|oU)Up89>^87=?f#@nXDPQ7QND2&+{C<)MgrbM8GUoJ%^B?
z#@kXwlIonIREz{?xI6S9IzmWe$@3+zk-NeUy4XM6i}UvhSUm0lR!c%f>TRY^dz4ve
zDg~Wm(>&G(2xAhYT5cC*)`Rs`#$s<DC8(-+oA&(h!4{mpF|tl{m#7!jJSWGm0T&q1
zG?C=M^l(ka8mAx2Gkf)(QE#f08`QyctE$iMy}u<G_j>j%zGIZ@?mz#}?kf@1%@a<<
zV5hPAYIhS9J9YlbWeu4v2p0#@U_~L|grVgMLUHNj)_Y`7?>GO5o+8(BD_1CV5%Icc
zZi{zLQFF^^p<DFB@V2>&j6*XgSx}<H^YC>BK>XXkvNcw3?++x-6TJ%UIS=LD6~&JT
zuQf$$C@+SD+;xktfOKM`qxAO{%OE+Z40S(}`kvvRXbqE$;ionE%9?wURKHK()9Zvj
zx6;y#8msO7#aTNk5i;d9&w&gikRt`(wCl1e)Pas^e3#H#dFKbD6g8C)`tI7%l3+4q
z$75}1?`dej&Q?Z_+y3n>Bgm4(?&S$aC60};Y~{CQ$O9+B=8csueg_|fG0Mx1^}bo{
zTZOmvy=^#&S@gRjlpbuhTZ5!sF~_<BI1z;;FMb9_b@Na8frmI%O_{e)Ohcmh^H*zz
z2`%368UYT2ZPSJVRMZ&`A5kyCo#8R<B`ZerVLPNy(K4$=H6~8(Fq^Z~ig_<(0JEDi
zT(x<%|5z4ZRo~Wq+HbX`#NE5RR#eU3d2Du0kpb>#nfpoNuLImUpwMj*Q?RCF<zCNz
z43kgaG+H~0bZPZ*g^soa5tAie^zajm3Nul(FL&X~6Sh#_*)uiXAF@!X^Wjx2$B#KM
z#ko47>reG37$txCp0quaHRvYJk8lN-{FgT8vjn>@zKbr(L3&`D8nc=X-|mCE<tuyz
zsYcGHz6W18h=dC`!98jxl^t<O`f78~(g@3{IR}@mZiL}+i$gDDY=;}Xl*Z(j)Gvb|
zkR#^#CpEU66n;>FaN)lq#kmFv^kse^PyOL7pA6d3oC+u;2S3s0hC;e~1v!V`Yk%ph
zIe@}^-_KtzXoGkq_h?odZUFP6#d^Zw$zD)wubtD9biRKa(lcl@d-2nL$!?l7uCF)q
zWXf-#%;Rxgn~&{i>cz6JuIGDimF4rmwfGId8CbBL$w9M7)d;ZhL3j5JMsoRFa?*0&
ztzkbQd~j7>yveIQ$89Mo5s6`|GbSd4QAo326G<o=)47$8tCGR^yPPcgJA|Lc?!BYH
zD2A5)+|LP=kse(m=sxuI`VoxY0NmT{n~m#ibFgDA0h5s)U56&VtE~L9H-RzNGKw&~
zAF6QGCZ~1HXiaNK5g<ZfRHzR$!T8w9(bm#a^gQ2f+oLxg7r@to9$Z;l5P9?K3{AFz
z`k_OBb0bZIZs$B3v$gHdRJHe}uKuLj^d$R~eqG>vloLb?{Rye*mE6AS1X_1hmCN>D
zyIDE8Ba|FXg8Am0UUYi*+1KE<I{?B$PxCFiCNI^@^)65-^lSJG*S3s<%P9(VP-E%S
zABI2EV|%18te?HGr$lV}iv?5nR?1JmK8F+6Fq9z*TD^ERKx`ml>?3jjMZa>5A}98f
z`Pg-u*>SsF8>5axPci1_)m@nk7zRxjP7I;yNt+vG-j)yrGsW&r)s3n7MEP3~o7SUm
zR9<}JlyALJoo&*AGt#xEE$od~)8n`!@VJ)2RCu}cRgiJ@4Ni<k6rsP5aMItb<HA3d
zE0<=qz>!^YAti~2bFSGx%xWgoWTMiw^!eqKZ_T5(q9N38cQG9bV6oumsbyWwImdNC
z65-B;rvQrS(z$Jbx<<ZN_hxydfqv>)F?*RUMNZb!JM+|L%QT4$PO`6S|E2;d?PyZT
z>t#i^j5tZOyd$aGrJF$#cfLdhL%CrRN&U4D1MkwN1kU2W1Ae09%-%a*=My0$bkHfM
z@-0a>vFXhV&=C*`OuEc|Iy^2tcXaxPBkncz#;}y7qrjFL%NSyf0#6Po!`0aAjybP&
zG&t8pTblD(b7gpLp5*&KkO3zZ{iyEV4}oD{^i-1T$3(iD=g~EtyRX?QyOP$aq@T84
zvFsfF?c&w;0&Uc;rfmuL!qUe}-#LFLY4brsh*y9Y1un~e#Cj$GMU=`2yp(ux__v1L
zt`TuZ;V16bk8wX`ZIHW`_d;dp-lW7Ybj{->;JgdFztG{pm&X^kNbnGwZXT@$^ktuc
zC%=QnKYW!(W?j!nbPMCE`Gs3&<4i|XX6h_zWZKx{fZ3<E<YN^aF1aYrISid9*RqXj
z#@CsyMslzIkzKRomm>E!kFJP!kJ@0d&fJU`cBvY%-6V(pQ^^cpGMVtU4fK)2z~e^c
zvq?gaibJOI$HrwY@vs{~P-+fFK63cPWhk$hL<q8J>3am8ms=c|_*(fc&~?)2mhAoU
zQDGLHktQ~e^p~WU)d%R<DUDTORK-P6=cSj}xWh}gWet;xuQ}-g!#lXN{q*;x>|?WI
zBixEI@Qd!+R!se%TM9LMA`&u9;3(UvHxd{NO{vEI`&(mhg|J|M$9_dNX}~CUgjS2(
z5Xa9@+=oZA=BnSW<cApw<UwIN!v=|BzxgMZoFqyzqn0zm-JWSjt1t8?-T+P^j~-B!
z%Bco^R)qUCEtafalrGNyxy=D3f@o_P^ZW_t%ImjjHEV5u>d(wQXfeOjk}Os)AZE-*
zsSH+FAN9SATN-tkxD5aF1S-C6fZt;^#Hh=@8tJ$m7lvg@O|r&#lzjfE<I_HHi8o4Y
zd8wgZ)Z@da+W3;*2Rx|A;f)O8Yj6wf#|@mteAJiF2{`cyk7zDgRn0&$C-k+Ja$o;2
zCN~LJeVtMm_~22zh7*aY4Z8JXuqE2R#~xQLzuwOm1%DgR&nA{f__4Q6MN6y8W;@F?
zm(YJ`P2R9GM#EcL3b#%uJQB*s*oq^JO2eYITgQjq(UWtiVbk`A#!63%IdqA@rZ9`;
zIg>}J7zwYnu@1GN{xJ=k1;J&(&s??*lpF!Rzsld<*Le)TNc~*+DIWY6Lj<`!YnTjo
z8Zz<DVPpG7U3?!Vdnfe?Vqa|k_<?LC#~$sVGj8`g14PJu*Amm*sg{J|8;I``aMUI0
zSeQTcyRX8%)#|rq2H@52h5|uiU@hnH6}acQ^|yEmo)vb8Bd%Vt3ktAWyx@RQ)i-+t
zG_^w~l8Pe^qucN`U#<Q!4L_Z*W;!^DQ9lX?{0M5H4=vl5^o~Pc2(2s3Q2SPEJoe{T
z`>}ab^Ev+X$59hCi<VF^@>!V@#clNGG2D&<3w68Wb>Bla$Uv{f$#)#)n}PZ{MhxNj
z(Xz+@^?QlF1j;Fy^lgiM%4)rC^#Vev<r+~BN}9byKDg!{Z8lH%i5jkBdwlegq~j$Q
zryzF}Jns8tBOE^Nke*yoGeWaji)7C&0iuis)c<<XpKUH7YmU@*XEr9aOb(3}adXW~
z>afA+ZvJ5?kMnDFsp0li>yvS_Etq4y&T0|jwCUk^6SpWB9SR{e&EBTC7%(PJtM&lj
z7z@r`D4<rjn1qVF(H(qrW~GyWkplu;z?|tTkYwN95}phwc@?afrD_~XuPyVXWkPN#
z%S<!62y$?LsD;0WW|T^UDyV*5>#}Mj&dL7wpZI#}ohhpom14^{PnK}sh21w5-pa2?
z;A-AIg*bFgh&07Fyt-#XNx$SS=rjVRUd2YJYVUU{LM>eq#S<)}Na*^O%1ATB)p+6J
z&8rzYL(6+%)vQ0|D*ItunNznX{5J5j<aEd@n$57^B~5K3y=eYdxG}*npK~hnE4*!Q
zO+0?gRVCi0)^Bg%n0T{L&5C81Y03V3B4x9*O>C;S*^t~s<M`sA5Ab%!yG035&8T2$
zi_oO|y2%$^6~oiWq)qu=ixOh9p?gNJl2`S4to$9nbIdBr>GIpI%f8qB&N1?qHs1d&
z>eV#p@)`(XL`g+=fU-OVdZ8fdRRdO>2z$H=P{BR>kMm83b<+$4I#8?G#y84l|Es13
zUc8qP#wQ%3U<f2?<X&H&5qe=#bub22C~-O)FWS3bwV8r(J4@X7;onZJ*%WlUj;|SF
zO{_gyyxMg{t=lk=oDK8%yi|@uVjnq7gd7;zhTlCPgeyAU;QriC?g$SObVAePs5$=a
z<KEJKU+c2ui6z95Z;=Yl?^`Wk`TS3$c*Kn7+6P0t=v@$TQH6CKhx}t?l{_(@V&OVp
zc}X@u$GgNSKjVa;IW-at7=4o?rJ(}jm5ESa$z*jOYm4Z5dBF5mKkeqlC^3BhaRU3%
zm@0JS8mY5Gpx(X5S7pWQ^rPHk{Ij`4eCpQ#zn8B5fUC}Gr7yKR6;9T!QxY<17<Jv8
z8D(&edO#WGL2wTL<dP1&{dGglZ)`==cv^1yj21fe9Zb=9rQXRrQ&4%$r?dzPpngN2
z-aMaa@TW@P-z;EcohK`-bnhJ7ofbaxGj^DYVo@7GA(2X37s%e1R$1-wyQX6a8y{^a
zn-+_YE@{?Y;au>$585jvTOl92RND^x+{zt(hQ%kMB0E{Wm}2n_uZAS6q2V0+F-Bnl
zjlvHVL*eb_g)?h9pvg*ZAdy0w84`AZY*L?N^27<9zp&GkEuU5DRZ7T4WPP!AVb<{L
z*Ab^mo}1j#3HWNOE3m(S+BM&ia4SlKh7kT>QnOBYsArp6`T4}^vL?-FvSK<ti`RSZ
zMkQouBUZF;<4QEnVzj@A0rGk2#*P{@e5O)3aX43jW^{=7y_bkyL1H~0dmlucOf3^a
zGS(g)@zq>4U@Q3pZ(p6=%7D`J*><+*v33mkF8w*8OPWK8x5TF$X&aSe$IRf5SQ+jy
z?ODX?R2!^zD#cWnrS;~;+H1*Q0XA5Dv<57#BdGR_b5tM<=51+e4088bZqr3lPq~%^
zsPT616TBB82KXiho_v%h)FESwM`Wn!40K#>F!*u9%+&1-XZ2L>k3GlSZxa&vHq|`T
zOj}bU8Vrk~JExWo`4eL0?Lhrq=->7%qwuV0@3Mmz`p4!$6j-339_vSLQRnVB#q^3@
z?>A&~hmyC^1qGUAQLZ>H3GNO8PGz4_cf*>G6$r+!NFCMN4{H9qBNBR-cHb#>T{;j{
zPz>S_L$djT=0%nWEIu)oC;P)u_yuEupIe2j^ao>SE(~7L<lahA^}h>+oppSgEzq6S
zndqMR#`Q54>=F6(lNI_E;8!i}XTt?@&PEs(Kog+j*Vv@b5-mvM;6AGt+vxBLz5Y;n
z_&MLZ_-?8<bm82q1Jb~Vf(SLZZfTNxmQAzBNRVS!?%evb-=-Nw`>pEp|LSN@08@h7
zUF8gW3Uu|#tzLHCnqS5@Mar{*7H;dG-Xmz1_pQw_*Q7a=$wf2RK{083-65vCrcW)d
z*U}2pmpvEPAx9D{6Q_ecq=hfy(Nl}qgr_3FJUD^JA&~GP*6C%*x6wBsuaM&%>2fcQ
z@xHwdMXTzxVI{h;E(m{0I;o32FBGKmjZW%-3*kR=11VvpOO%3%t*hnyecgHv1$;rW
ziwh)b?o|Bd*fdvMlb>KsGj;MudvGAZ!!?s$`L+8(N{iAL{?hewg59}OqrLCK_Bo&E
zApi<z`TPJIy98U*FX6?7q>N}T?>(df>uc_)p~Xb^!+IU%N!sB1o)px#=$bhRAIe}s
zfhQ2DmOp*8yp(MjNbm`z|D>U_^9H#ykq%4nF1<VCcfoST({fuua^IPMw2c|NozO~x
zZ)VeejH(|JW_=w#x^ueV1`TN+Jzi)q0lT64pZCrKP^&#P?{SW?OD5(F^jxn;;OR!U
zi6V&g+LlU}V>IQEgcEn5qZ8i8v>YzOl~;&X7``&+!u{lEznF;TQAiXv&d%>e*;d2>
z3}(-^KUk6-d$QT^*381II<?sh(r07>J%AA@O|DM-9cm%z`_?TfeNVFzO|`Kch4<B@
zb8YCH#5uQxH;d=nj~?#(*6oC@)3pye1@4HPjAcni<4hr`9co4=O5$uhx`so7Vn^tZ
zCE=JK^?zbX&G`&3B6U($zJpO#Ns4Lj!bWclT24Z(!)&&-=BuNSmyXdf-hMA`2yjxa
zi@UhBI=pdI_`Wy43F{39JzEeFcW6`yR7n5Dh^WO27Mit{uP;lqdZLewSGZ<EI8Kc6
zY|*s!Wdi<{P?*c&p(iTlq%XWw>d8N-%XIwLYuA9b3hqC{u@dlhAkTk69egH5ka4&P
z-X#}%ozpdB9?q(~gtT@C9d8sMhMJ_B<iV$G1Q8Cn{cdst9b~6FtO?6eFSAhu+f7DV
zYWXe7H5c;(Flx|lfSi9jTVzw8!cW(9_Vugv75xf|lwI_GY?UfXTBG-3Pnjy7)Z~9o
z#d>98CRnI&_htbHS;VI>dx=?5Pg5oMTHI7y&Ta2%V9J$n(9I)NvUs56)5tKPhC&Bo
zl!SJ`yNW}_e}_ebH%PmdL&dl{*+r(vfVFL@TmhGP8eYo4PRT%D6{U2Q`(h|G6flBY
z$=4r`2J}v72yOsB*I$1~_PV*N78^iCDO05i+Wkj4WvbTdx{TA6Wd2J)(Sl<=LBqvI
zHUd5VmRyXdDGASyW(}wVwXFPukmwMWvj4FEeQ_0|lB{e#AiI^oiwyYia;aL2n_n`_
zHF?d<sX$XL+56?=FhS;sGtP%z6}__<I}}-Qe_4Rf+~znzs~Uenv|qvIJmiR|r*553
zytFmO{}_0;3KO%)mI*Fy8)p#WGA<AI;C+02T=8&=4$2KHU6nR#(fo?i_rVtta-ePb
z`EiyK(p*83Y^w6x7A7muEco4Xkt4@7eX6P6vTm5aIXW9aNFqo9(E^_;Wu(U~7i>(H
zkh8@_YGC(8uTE8Ha`{Hv=!pn<E=)*mFH6?2CyaiYN41t+KKl6y@AmZrD;(w7bfJD-
z1+BM+6P!oX7_+*HV(;oRUMnpvGjrlG+{0Rewl@ldU!`m$I;I3qT{b<l;vT6LC+CU`
z1#L^(c)o^hl>A%t0DYf}&rx60mg`Pi@yOAvg5jqUo9ABX-8wo=vFU<$msEHc<{BPw
z)#Qcyn4BnGIJ&g^-9mo`r}h)DD~c?g@hag%Sz&3<vg4bv9C4Ri=Rqs(!{`rVRcal4
zn>RF<kZvaKGxo@$*lWw!1Oh&Nv8RJhzN@rx9R09T1Zfa~?lBC_f(7mI*L~dbP-@#d
zjkIIm{cajl`P=yWw#Q@uMK#J#Ek~t)WyElyb8PNsGVg6ry768zuXO9cZ_W>2S`U>r
z8kpd6t(^D&I;chU8p_z^5MYc)`Rb7M@d$&0vF0R_0X}=34ixj;#1PEoph|K@R$gC`
zM$#MvRQ{JJzj@`naZ|(AE)jCAH8J*#LMYFTvlU+JqxE(<_9n3@84eb3WZi*qTIs57
zy@z2PENk)Ql&So!#joytP*Jc%C;cxmjvC#qO4MSzzXY=gCtxv#wAD4q8OtKb{yM4p
zH<dH|5vMeJJ6`I_>DLRYu|=7G7pipro25ij;o32%<mlKB5G|#*;$VKmOO7FqabkW$
zJI!)&F#P@);ZQ;R_|OmO(KE(xAYgUb?)}b6yoO>M@7ASlG$WphRjGh5fD~7km%@i~
zDbp7Hp4W0RLjS(_q5SE#a(|!Rv?<S)_VSR_;os+Q7P;dVele)*PK#DjB=SA^@RCiq
z{)<#w*!Bygd?lZ!%Q4KgK`pkd0)cJbDayg_|1Qc3eh8x`&WU~FFa5z8SvM)VG^cJg
z14O5%U;LX2YK}OcJ3h7YeA|&QVB!?R8UgzFm40f^0Gx;EJ&fK}chX%)D(%2V+n&O|
zvyotvdRhMKS#x`L3gJ3X2&V0oqpJU~8pL-OO%ET__FsGV{1Nylhc6}AOUkQ02GNb8
zB{JE*;roO8BMSS5(87GXjDSbMtkZF1QP`FBHk-Q}t_fT%e6KTvIP3D8y-@CTK@z<w
z8%o9&B$x!GZC>quNd=?Udmnn)qYxAGg^ADxpy>(CAwFyO6{U72DaO9q|D*{b^G*pU
zERjP{vzYsGfzcN|`F4w#{@@%$S7=XFY*O7>R@l4WN38DsfYcE@jzdbZ#ktx>Rcz9`
z=mQeV9@$ChwbLsTi~}qrIW4R7Dq7kJ4^^4}sl+<ycY_U5Qu^2Ji!f4Z<Mu$nIjt8*
z$rn!_X~NgAHQj&)+!81=s5Zu0MyRY}A-DDAG6%rl>C;q$3P(1p?kDvb7275}T~Ml-
z+WDR6xv?W@7(G!PE#`dzS6~yEHz=1E>m@%nf6!FXFsP%V7sQnv=_96O+#KTi&<lzX
zE-yMw!M&cEs_MOpvJt{xIWcOKsM#t3r)#QVFDV}{mtE+-R^6#+ZJ81(pOp=K2Jc?E
z!X(PIL+~q=#ngiM4it^55NGwpv&jSo9d|Uo`vOI%;KTW;Mp{~LPXU0P-dQGp%ol;f
zp`SW&{dz*f1;ccl_Ik+(2m8&E%Sy&{teWC~VOUwp4Y#LVuZ#>-7R^rxH>er-S%Kek
z#E@oHQ;W#g+N;?2Kx;c&Ta3DkBUZg6?;O}#_J*B|EfKE<6gqE=vo2k5(9jH8@{xm8
z&r*k9)bA&Io@ga_{qVT^0!RqHzx%o;hQ=wX^>kKsoNf7>ylR9%M9z+ii1T<NF$;Wg
zo|nlO(!7p1yYe*c39;#%&TqAVi{88IvMv}7#SaOvZ|%Z&Y6WOx5sB&kE>rSe3Cj{e
zlhl%f;q(5lkA^en=Mzwc(=IvMe_Mdug~WLQmos)EUWdfm>;S88Dwf=Ew<uM9r6Y6{
zS1-RibnnXH!6Rg>N**`5RmMwlVg&UZ;}c`m97!`85ph=(rm5$wKf%iI%wCzYZ0VN*
z310R{Cx=Q|%MyZpyE8-|y5@Z9Qk}MQ=?YJ?kl*xo*X%8}NX#C+w*Z}2GxJUorvB;l
z&wzHxN{1aiNHDmk8r`(*K<R5(CjZU6pxvB_(Wmi<LQ9S=Z<xn!?9F`;OIktucYj6u
zj(uf@0eSyQ#=O(nTEV-*dH!qPh80I+0J$QtMYEiaH&Kk6I~5pgv3jLw`Ay*6w24JV
zd5;(ps(cIH`To(7#G#-BF1pOWy>XUCGwe7Fw2I}7-dWpHGc&h&8oB|HAIdl!h(!ap
zf_K)uqcsB3x3wg;Paonh?V<<0zn;!b#PCqg90&@`YHvOnS;cOu0Xm^0q<MtqAsS&c
ziICWaEm27on`I9j&SAhw&)3k~3?yKhw5fJNn#a0q&fi^}SYpELt6sdK?5jT7)FdI+
zqEhNqInvZg<&`edLhj$D^ASxxx_B`5=k=FHuEm%d+0ugOgk5wN!#!5~yGdp_*Dolg
zWUqb}iB8^dUFas-{i8W2Sp_m@!lUan_sU<LmC;nrvwcFHV1_1e(+u*~g^6zEzpM$~
zkk2Sb>(-?{8w}62$H%rqK!9a{W=r55=fLMvW0+9>_0j%7enbYi6t7I=uw8k76S$G}
zuAXKEy;Wl%b-WC7o}*CpsQj9CEoQO~&-ymnC+;p6z-K~JbQ~;ZN*e2q#tn3>E;cLt
z8l|pn8+a5?r?b70vJlD&SRZbDXqp6J{z&+ybvsiNlsF&uX#NtBi@p8~Ejd=md08l2
zdD^CFHWkc^+-@Kf1z8#8tq+DfOS=Bh!4$+-2(L;Mw50qRf~CBo4#&P8j=eeLV^jE?
zKPNie*yI}R6n)kQnqh`({TVpinqv``!|IF{i}2_0d-h&vKX<+Ob$ZMyPx}1h^`G5o
zCKpw#y}m)Q2%;33UuP>kSWfML?&A7b%T&j5Sl2dOaTm&Qgm$b!?)}KPI%AeS-Hu2>
zrKXe=9MPOdPmLN)yQ)9w;c@rWOsJrFUyGh>l&qbd`Tw|Fu_Ak*b?nGpG3D33gik=!
zZR8!ja+YWK*gdhc_|V7v-B}Idgay_TZqGC1#J;$WvEUE?Eq$1E;!}2&X&I0OyF`+{
zMmUWh#he!iF{FCfam@@wYZv}FM60a6DkD|81Y|H1A1z1_)Iy}!P$s+`1Z^tJomk8N
zP`c(JJbGS$ZqG$Ez>&)?v{emv|NKu&zEeY6i<BHE*!#P!<Zgo-dkLoQk@|_$Cjo1v
zrt>h1#9&d-Hn@B0`jNme+UC(mmf<!``mww29P%i_%9*)OsdW}xvBmPhWdUy(u$W!>
z73+oFNQthayLXszqs#r-3mP0THSU*<f4okq#cp|PX$?SWIG5T|&=JgH)Pde1MW5gK
z_@{^X|E?(0f=`El=?ek&<_vzRG)Av|_U_qnN@Axdaol$qwj9&!tGKn0D{0l^zP$8|
zJ@l=6+XJ%tB6_W_`I&@wM+$r?)30^l)J(Z&^MFM6I#2sHR%Y6<G8^RNHyG)!4fYq4
ze%(;^t-rGPf<O49b_bEgTMFW<f`X8{)+~QOjoVBVaiz8gt@*HiLe$IC1<z-HSq;ZR
zYhPQf&<5)EZ6nD_KClSb;``T!biX1&6Yap@s!$W`cW1F(yZ17@aNlf7AaBApFQmE$
z<%pfvz!pyn66ZBk`slr2|E<#<u9N)d+_17~Kt!SVSAT8fT~qIwaXfE`a;__7?chAX
z<%&7|qF4(8rlWtfHaL@j-kC28rZ{-D=g#T7B|mGk@s_na<C(BHxo?5)o02;-c^?-6
zMbG+fNCJV396r{aIJbg)4y8I5z+F5%G%f-vRLsvq7@(TW)ms=J!r$NO;gn*g|5;j`
zY|gCgLceiwb<JoRY>rj)37Jh`?hdzA>+M5xE2kjajtJ}am9QKqTw}-n>=(vS{<;dy
zIhRd-pt?!tJ-jt0Rts)ME)<qoJxfEJU;?z1SOwFcVE4ael|0n6|FI#sIY#;5nSO@q
z$l7YvVn(|@eyS4RKgi^iS8(coKZF-W^U`lZuxym5oHHrns;lryZ(1?99iY2%BQQm3
zpt9cV6p=^$V|bH42b%myR^92kba3h=vWM8@MuB59gOtVf45g;LCyrnJh>yar8zWL@
zOTu;jJ8HkWdcLkAh~V&7N|R1_mNJbV_ATTgjvEKriB_nu%OzW0)b1)@WZM;FQ@h=@
zF|Nw`*166@UO=Hfb>L^jJZaWzEoaTqxCCy2!6$Sa$c9|rK^K^&M3ZH?q>JO0sIN|+
z2`wQPhMW8fhXHcyFF;YQ+9=AUivY&yD%=#CSHjO-1Np4`ZUlx#huvDsylQAwtCU56
z_?sQB`<D+*@;yOL?OcOB#%Bazx;#mz{*R7eU42|yD4vaZNxXBjkLkY0msrz!lgv}+
zVR6@!pQhXJi05!zKYtmS8Rj0@eK?aABZU_Ap)l_r-|%Udk@nUhvuM^7ce@F)4(^%V
z00g}10hY<Z{4O~-B@HQ{ZORo$%l8w5tv<&%X(ErCp;j^fvaG%<t~hkTg^qK3^Di(J
zeXN5?j{hDs0qdwm2-Ty9s^mQ{CI9gFF(RN$d~5hW<13Z`{yQq#WYOLtA;+)Ku5j!*
zrsAQiOqO2ONmSC?PkUihS$jJV;Qv9_Z}v9u={5D!$c2w1?o1k2PId@9i9fg!O|$ce
z*)*r-<P)#U;&DunA@-KmfgJ@i^HDkR*jG+I?j=U4Wo+kw>DU6)S<WzFC9byW=XI#|
zM{JwyuP$yz3XHNYo6fC_t~OXI$0Gae4|ca<x}1!zia!w5hmyoW>Z0Mmiv4}&-Eyut
z5BZ1qm1(^Mt5FKtv#d{6q}1SYooGiESLajI+OB$D6lgVc!e`s;D<aL%N%f1oQcr22
zRUvuYGT&9ki~Tm7FCn^4YY5Q?Yn1n4OaXCuF&a(5io`km?9WQuF8Z)@!sdHRTB|-r
zb&P)Paz@uhlf>wNR!1U*ZRt!Ev@7MN=qu+E@|re~CA@j1>CEP<C*DI;=xeJu`}1y$
zCx_C@V0=QwYjtpwJBAB@ihSicNs&(XT}ul^B(2)z+%IyCJ8q|mcj1(J6E=sQt>j5F
zAf{ihr5z@?C!LB!DMu7zJsN8qbo{}|kZJ`dv-JJh0eXZuu0FIiC1_IM7KLjgRg|&|
zGazOSSHM9E6tB<%EAYgmGMIa3Z%esT8^b+y&vlruZ2MM`PkUxm80!mB9M66}XB*AP
zei6$$VP#_*4j)jC8<reZvF6{@;-F~Xs(n@4B|Wax%*`u(W1qmGD1BD_%}uCyoXdJ^
z+K<Ca6P+9PLyS3G+dCCM^^gYW5K(F6_f9tw;|E`)7Q_`+SzFV#A`X2`#z8xR@l#T(
z*x;W6`z(`7D;=ZNBLEQ|h=X0*(L9YTEDw_Py)(dUKi%<Z?o35!!r|D{$2XBX3&me4
zPj$H9*U2&a5Sq-3)ysQ5-ar`J7WeUrHmKZi9=4+cZP@#OA)$u->Z71_P{g5S#5l5{
z$a|4-($KMVyOaA%t1!?EOVL}o(b7~{^^Jd<4mMuof#A9P$Q!1s6<H#YjpfkV`k8Nc
zdEqc+Cu<6&bV#_yD6tP^5fwhhnC$o>Q=aFn5o#MV`Cb1~jSA!nnd=3+#8Y8hw>K`t
zjruy2ex=aET^8=;mx+WncY5;4x*XK3<cF9!Y9A<}o8Jw`=DN0By?{_I-qr*g8_qHR
z!Ya>{9Mwcw?P0tzqK<`GZqNGmvp&=oR19wEZ=<7q#^>)Ta%`ndiOo7_nJUi|w-eHg
z)b|r694P_hXDZqM4^jPsJ_e@X(yyShRgyOK4cSlbcQOq!GM@T+B?wI{T{mnR7?<Zb
zqW_P&A6a<Yznv5kW%`onje=%W9pEIV93sFs9C^FE5O-)Y6nkiMDU}*>AuJ6DCY9G=
z@vH0{8?b=3*!beUrAJfw$pEVgS3W=|cNS{Qwvz9`a$h-566DsNSb1wP@WGooh<sbD
zEKx1oIYSM9+^1fD-tF>bXcs^C@C=d-x~Ke+rIFx4iP%gk`#Nm9fzEn8-TL`L9YdXo
zzT!rr#L*R}*{RCFYFUiO0XCIe_K4o?WKzu;$WVk+s~IV0sBcZS|1+qi4(FcXIN}|&
zydJ1yoZ>r05IMoj!$(tMqUM41s(IwAeO7RytGjjn6${=j+Vue?@ueSX5XZkhl2F?H
zqAU1NU?TuzG%cp%e`~!1>Q*vZ3lZNcat=SS-#Q=IA_Lik<yDm~ecAn<CoSaaG|+oh
zJ(cT@?Ku^*D*+`3*rhf90pk8L?MBrgiEy$X8fJ0Gx1!qKBE3(;e+}ol+D0v4I3Dbt
zHjee^jZY`%1<%UIPb}>WZ$J+H<Z5&WeZQVwa&TeYZ0OEmdt59pzw`0o6xwNe>IJLe
ziM^>&5!tEorAfD7jD(sKk3d}3`yW;BI|wtQeuvv0l$t`SXhX+?Js5MO;h<dOsl&U-
zqc&dHF9uvlo>~40a01F4&nW%5)sF?!6Is0$>MnSKM)uFQE_OS%6;E?%J9|GAC-d4j
zIWO+sA{IVL&HA@9BA+lZVz<?lj^kRmshCXTH#$8!ztka{oijFgJ~OtY&%}S69L9hB
zW_r|}YXQL9PAXDd>#ah9nYnt{iz|L9h6@fT708~?2biiF$}lq7PGtaF;Y`TbMQP#L
z8k=uH5kV}Eor<a@+)AyLi)=Xd5=bJ-=~*Y{Vq=&$c~2(y|I!SKf%ayA4u&JL3`7#-
zET{cZ)3KnEpbGo@FT|zv5D7|KR}PIJhE?%;D|vI4iRo;p{a3kx(`5$9Wnjl>{)b5I
z$CkQ=mK|`Dz5Alqc7D(??nkqXOqB@znVJ*Cf0^d2!2l@Tckky_ne_7I97jt+`_z<&
zR-!9Eywer-Ra@P3C0Am4Qqat6tXeGiP1h>Bv3Lokr{RSX>M1hY=+v86rsSHh$3sX<
z5oU%|N!dqEmp9x@kUvmsUv_vo+iYmC<r((&z)JxB5b2dZw<#QFC|_wHFcYzNYpwg|
z%?nR&`rOU>4NM1mbXGl@?$9SP)~R;iGF~xs*&|f^MPmB`ddnoNMCTF}uhb?J^llu@
z!I|C#w1ZKt)x{)H+NIG&SYmuu#cQo@4aP;-iZ#*7nHKzmODCAWG{a+{|MPz$y=OSg
zXHJaBbT=$T=lRj-GXNxVDC61toc7_r5R%>l(o~`Rwl|NPU*t+P>g@!4pneHLo{PE+
zCkA=uYkV3`#ZGO^eFOz_>^;&r^fxoilXlwgU$<kjrgB`^P5kB4Zq8TN#dF$rgV7xk
z+k4eiPB%j+tm1aVpATkF`zcimuBu3mWP^((^NmHIa981cR!LcFIWU$&(}*nl8@p!{
zp9?_(U{AwENDQ~QT)^-);D!ZaiCj0;0U^ky=B2+E{!IWLwaI&ybM^Z_p*#Pz<o&W8
zvU;PZjFo9^ecT&#j)MYMOJDZjr*gz8MZh>2F>#L>h@p<4gE2z`o)A{eIh?&}be;}o
zf6uJCitRYm%lNrL@z|12{giRA_lj$_IJ206+r3Hx>{z+T6qKbb+!<iSrl4Y#i#;9u
ziK6c+!`}9tyaO^;Tn!VR%{F-UO_+pQEAwdmi)=$Oz_qjvRhkHCw`q_ivwB_xrtR**
za@CKvI}%GIos<?AtueNtrH?w-{a`<(R?pdyb_s9QycNb@fC#KM^?x%9+%hmkwrk*R
zbPGZTeFfglALnsV?gq**?@gMUgULaZdw=BRI=x#Y15%L34}*PpiLkctFX!RAl!Rj|
z&9#?;6jJO#n!KoG?&dDj&&76(%Ggg$*Ih|9ZiAzmjI*zBlYRBIR{xXCU->tSx^`{>
zfUP;s+7k0kt+s$cbWVj^NOfB#if^Gte5HHS3Ni?{3f=iWc8z1lsAuuA5|MXy==_o3
zE}D+N8%rf|Z4OI!MScDyzcB@9lF!xG?xN?zT6lOaMOVE^`yL=x@@EG!eX|vBBhHCw
zb0E0$xy*=wJ^jw~6w1`2?E`nd0wHVtnhfBa#JJ}rQkxRV&QBbhteAn0Cpy`YB@W-N
zpC+h-CYRn&uTj3CZh$d(p}d5AO-L~JZ#ll_u?*UuYAv@>Iku`2V{Vmvz*}jjs*ciQ
zQBS1ucd|(W?Z?n6-Qk`=+Xm`HA0gAwPk;^U?HEhRJ?=CpnWsMRrVDhp+4@d*m`3@|
zaKzF|uta+F>U|G|XI&V9Vbqa60hEKaE7}l&0o=VXi!0|dJ(n*<eCq@tHmu2}!bXhy
z=bUbKSYIEp=?!waUYGAno11<e<-g_twQWUa+CXy~SmlVytX#fB!BRE3z6=yXlawl5
zeaX-8oaCx+RqJXb!o#Ab`j?oh->AYqnkuUlsiCDW>k0{`9>-fc5EEPMI>(lg8tf~!
zD4A%LgTc4_)G{&SIHi<&?f19VtWd6^AGOw{n02%|u)+MImE%6Ry207FIgrg8;r{J(
zj5W~xN-boSg&gtr9y&i~&$L!ad<a=OQ}+t)_<7^<;=-*ZNi9&K;ifRFt_gBmNnJL4
zDP`L;%F$NZr^-Y;P8@R9`NtlW>CFhrwD^})j}XU70<$!wrd<*{^>1APkTsv7<{6#?
zP&6$M_rLGPg7?o!+^fi7w>>EvXe5VuzXx)mVVY&pcNsKi2=kFJJSEW|NxHh6V(@_E
z0iGaKoQWI_a=Jl&kqD`2lV1ObJ>7`6Yj1KOfGFH@P~)kht2<~>gtB$(?P#&@IpW|N
zWws9-r%O+=e$a$k(UcSveYhQ(o{%{0CsuzozRC}V?9)$?j(H8{aCq^R8*-VWT;-h7
zYFT*jiSIk>w#)EbT)oo;FwwACbMvfdiH;zSn@#D1MrJs>CqBHYFO(^jA$ZaJw{lEa
ztSA2F@%BCOI9}v=;v$avhz-H(8$E^lL9Y;glwjYRr67J3JC{lqokNOX+=H{qE}a0`
z>FJw*EoS#sPWqRrQ_GvV%B&#`pBW*`+^=|qD?+7No!2NODUCrWv3Dr@Na4Ak{M(WS
z<Jw(KO+N9Iy-N5Oz|az1)_j{46W^Fezk@C$uqu0%$vbDn#~m0uW1Z>_2m0c}TM2(J
z9<1doa3?FzE@Ib^lEjbl-J<!GgH5ykDkRw-ga}-U8-^2Z@AY=UXpZkuuetkz67}9`
z)OV=2WN|`e5bTdaI+Oi*IcE)l7~k@8(0r^-YjC=S{?uUJ?^8#$9ie%sW@-UD&UbIh
z5JKm8&_#qee}%oGD^EAJ!Yq<$hH5>gyommBE`azcc?BFu7fx=GUS7L{-PD1lP?l4I
zfyQ^gut4MSZ6^#b3x|9lUwVW-!@DHTz2bZ#YBaRuzO<5WzOq*(3LsF0ELNgWK48hn
zB-P)cAZ0C@&>y10gcB1WyxAF8^E-awlno5y013c(tQ*I>ty6(o&F_x%y`ZB&jkAt@
z6}4-Ich@QTgc_Xv54SBANl<MVELMMpBANhi2#85Bm{LC={5=j{nmVOE1P#Hg(!4sy
zUf_Rdr59V9%rSzKaJok+GbMD2qS12lDOUMAx*)*cm{<zU4FrGttrBYal#^qx{H<cZ
zA$OPp+c69^>);^iXX3s)^&eqYa%1%90dn1r#Qij6^ogFSg$1T!a@Y9e&(4${Xu`E+
zYQ4UrUH;+{@B&?a;neO6C*z6%A&;DzyMUq}>)MyL93w6?S#{%M{tO#DlkC&p_q((2
zqR4uIdSQPq?b^_}3C*8Y!=rkvMqg`tHKaU0nW30LgS!#*N<iklylR84b?l@K-K~mY
zm1FS79%_zN-xUQeKQ~Q{<dGf*DiNO=xS0Q@YQ%;vDK}wALgQ|X)C|<POHN2ehZf~(
zR$KcGd?LqbdG2(q5>gEb2EfPEsP$I{Dm4r)E{kZGHz%7MsFl|1i4#f}AhY1!X&pM;
zJmp^4HHqH{(>;~Ta@oGYL8Er)5~Z0p;N5?!Sp7mDp>hP27FR1Z=yoxT6m|ssug}0<
zn7JfsZ*OTS$SH@PI3!L^H8Wa;A9f4pKTr1fPBPp(<2f}=`18UnU!V*!geH0LKZ-5S
z;%V4^YgWR9N~D!LBYkkf)89slzi9u4nT4~aWk~le_;UB{yDp+hVHJ*rtBuxP*UefK
zEPCtNpk$>BUczRZj=3t%(wG$QH9-suF^V@X-PYCd$NFVTz2O;HvRTe7Ylg-9u9se7
z3dcsv9?I7{<HiMS>^`jk6y`qBv-GOKMoEPh%Zb-ct^O4J_Of79Dyzzk3<|D~5TxIh
z!swq#h8+5E;DbG*71f(E{nLe62kq*jv~{#N9oGLI8~HW#@*Ux&M{#C7d%A>QGCubl
zx6!D8cMqULc1qk)`o^5J1SKM_2~XL7cJRVxdzfS|uCPRyhv@_i^_qMrFArXrRnTfM
z+C}d+PK%X&Jm|zmVmzi3jXE}9-AoRhHSHTbo?_f}+)kbrCl#@CUA0+$i3UaHGi(=G
z*&z1)AMS58$zBfV{%RoMEowHCXC6(|tr7?~Es2|o<v5`Lng!83|7fg+rK#<!Rhkix
z(Vm~K>@t?f=kaB#v!Cm&-lrw1=jY?F;PveJ<O`_hX;z&zmc-A&&_XGxcGJfjGcdmN
zMeBF&1<6bq@x-X3D^yR@7t!$AH5C4Kd>2n$elR9(B#*O6!2aJb@1k0xsr=KxPyd>3
z?2og)S9sJkbld?4(T?R-{Dh!dE*Ul<ZAx)R^{XZKxM7k*!<|Dg*UXCF`nES#(gf7R
zwfbPS*ZAIK)(VNG*+rYxmVUsf?~ch(2RYI=m)A3QzTe(U2sBChyUu~l!^SDSZ65b!
zF_iXeR!Z`2UmlflEaLT{phwW~jkd^|@w?)+?MrXy(mHbZ<n5+*>+<#Pttv%wo~oDB
zwe82UD}mNfrjVI5(;Dpl&xNw^D)0_s{;b=F##)ILVNERM&<S5M8k?Y3wi+W-^3X_+
zmi*k*D2p?tdRfB`pA0E25vl!Lk2H+t3LdL1pl4!SLweYX*)esrTJk?ssN<-0a6fDr
zg2hY4aouM9lgh4AHevUA9&Tqsy|p&s0<8b<)#PmH_S2l+D-XHyXmP)n{dnt_^P8D#
z0i*!?3)(KnPB8zq=#&)sV2~*jCnMjF0-LQseZ0FVJ-iy}H{4q4ZYluT3yfXuezDE#
zvK?e=P`ieRO7X)Ga>EU`B!BN^r*yR5TDKD${rw`}AM96L^5?X_HHiw>`m=Hqv)cW)
z?od?nbZdyxqNEfa>Aj#u8((Y}j_?;<PYiN!aI0Li9Q|8^66Gz)S9_6H{bz9|PRHvQ
z-A01}k^53{%$%g=p4>7FiLWXtc79fvo`c!0`b)D%;_FJxHstn<9C?Q>4)=<%BJ~2e
zcG&w$r<wE)qIxotKad3fkEipFX1jmm{#~<`Dy<qdtBST(RZ%0f6fH&7En>!~nWFZN
z(xRwQt-Y#Rqe29+C8$kpiP}4MVkHRj<o-R+dH!>bb8>Q=_~!GuuJ`-(lH;&Fs@SA|
zYXD7{OPYl$?KAG^pDee-n3uXQ1R%C&&cX)D|G8w#9u?X%oRUfn>(BY};l0vS=*<W}
zj*;7Eq1>!+Kw!7yP`|e}|06OF$SknFYcrXTHTj#zxGn=A<jRJ1M%)Epp;lc&VIMzN
zWDz`2uiq94a$>Cmg%@g<P-Ec$rTJGa<KNLQ$>moiNoC#k5i-luqmRoITOkr>lH?q%
zFf6xMC|%W}!1*LVa{LKiuyxY?2w~JG)EZ%Mp^BHc5?L9%MWDn7-XALDJA82gHV&aQ
z>739dh#MP&8{nHtTsx?lsynRYhXb`I%TA{ql{Yry-VW@3y`Cy_c7??0rN$DC;j-NJ
zhO_$4wfs~X;OHMo-1>Yz$yxfV5G`{A1w2x-^+-_K7naOGM$O5_p$4fg!TAQ^8CS#K
z1n6K$EYM;KJE(a+bXWy>S!lZ%5*$Lzs*+Plrgcr7b$M<i?HRsN_dA`GKPmuTDz1yw
zIMBiXBav-aWgi6Xv#S@)+ilH$ww5|d2b?K{npct>mY>sPi#jOQ=o?kDpElc|9^U-U
zcfH$7&Cf1SfMNXH1j@Ujq51kaWBcWKhb|#w>oH<d<E)Z)`LhU|80|Zvg^qZgOxhi}
zQNu@-PzZ6p(d_&k;jpcvX=**fR4Avj6MQ_&X;!C9j#4+)h4iVn)YZlAugc&*ZARf%
z$^7_yj819lDdBkYrUd#2Mc!-XfzQrgoz?U`=ZD0}PZO2z*?i#mcs<ALm`6gDitEQj
zWk{!rvVEUicC+hfcp!>+Rao<o>{%Ai0X}mP$~mNY?WakeQ58x{=dqI~+mSV94ID*t
z2J6rs?wr>hUB{hlN<D}iT*eV`jS3wvH4hzKe|QQg3L18t9&Up&*Snw6`#2cOEamLC
zLa8)Px+JZX6J>oV+J+X;C-Lt`D=Km~J%(s~8WLMi;Mf!B%<=)th=b}E4KE*YYQtHW
zV=_5Us(%4(4^%Wx%m+9mEGr+{<bN@3Q8cpFfk!tnWq!eV4y^m1GdjBCTi^OC9+C55
z+e`@helsRmLO2J__LbSyOGT=vH=I<z#H7NQo!*htT*5RDpx&L_e(}L`1qZ0#{buW<
z8)I^*qvy$C2?3gj82&JOlhc~@v&A?g?)6$$NlB-suokPo?fKOt)6>rETT*ptrW8xc
zR73xx6V&_ES90;pX9b)zD6iqh1NzXiy$wS@ahU*?F@S_BW3vtbu#OWuT{#G|Ea_8{
zN57;6>L~MB(wKzR_V2l077Ca0jFtLC@w39}uN_lXSx>)<x!U>wmqHVVcG3DBuG~&v
zdQe?#H-LMl0#KgG<IvcHFI5t<cC=BO1mnfdSsGt?1pHkz&A8!RB6~~X>%bnBc@<?s
z&82fsVzWnF8B71msz|aRntob^q?UfyiS7)=sA}|f8vev^EK-d{Xnsy7+CAI>LwRWW
z6zPyjiav<9FEPA4cD?u#o@VK=FPpOvWdh~4FSkH5e)DW7_1k_`(===%9SpA!Awzt2
zZqH&?h9G<yID<zo^6GLlUhEv&UD4YK{jnO)mGuu|<_jbMTb$^-tIo17Byffz^HK|!
zUC^CMc|Djp-!DmT!lS3Vo2Skf%^T-B$kpR1nGpqq4?!;BnRK%VVWPL{t~ovSHC)Hg
za^l{W=^~1$`Jvofm9iS~O^vW^CjLVERqciB2T%0o-YefSrI-knm7XnrH$F8floM{^
zK+2#~!K<ArKWNEdAvybZwfn7#m4@ae_H;C})w)2?{Q)`QzjV~xY~$rAK8nhRiRF&T
z44T67zrp#Ht1qeXqCx{-y4an1euOK|(|<@!=`0cS>XhkKzUtc|nhG&vwxxdBDhlcj
z=#`wculUu{%TapXzi6HLS>{Cu$8hjtJ0o!-o213jOblkCmXlgjfYXNjc(sU*@rd6P
zUe&)2!c<<-u>GLCsg_sOwYNS!th>BomoP_uIOt+0x;SnHI`4Naf<;{`m0Ybe_r6Yx
zd#dKf@U#&Bu(k$o&;%c9tDD#7dd!B^^@&AFhe>X4LBt_&J+m<<*Ia0q-t)vdU5IWx
zX9FiyWVS`u!!%yrz0<_}uU$Sa$jmv)MN{s8h{F!SXvti|A)-K-6kMlM#9?d%2VRhS
zVSJfAw?k}MnZMbO({QVDO8`M4(lDoe?MiCT8?W(we8N+6jh`X&jJwg;$Zd>}?RNn{
z7s0+1V3R>pwcDaNn(wHVtZj+~NGef;4Z-WeTon8pN-1BE8F5e(M7lQ+9PsKwsfnv0
zCp_7`b7e<Za;?{>>*-dR;h~JM^*l8A2_f+{8!{b#v>7nIIiZ95e2(HtGdx6qx29kT
z@oEl6a2O9RV>PJR{@m^f1bTeGOZVKUZ7<aN(TdVEN8Av8tOv&%U^FHhJvG3S_LeIG
zA&?SV8Z>Y#AXn)C<#hV8Gf!&WKvR8rH`8oxCuS3@;SJ9u{X3KryrRCmy>m3*Jo7oM
z{sZGI3pFGCi|Oi%S6h@nxz5GouDcOCA9xL&d(C@=C5b3^5ArX8kgPByGbSg1iv@r0
zXfgukVg#p2!`{)3ax`g}tqE;S^+pdQ6z_hi4$$<?r8JV-3Jw-DcFfCk_2&@kJ9(Gr
zhWQX?<m)`mbU4|`t3@<=`2`dm7MzYr^=~v9jj8;4gX91d@<^%78%I|h+%G>@DZk%$
za+j#4R?Ty;<9C1&I)Y{mHGVt>Wq2ecrYOW)bdCze_w6b9LPRDxh2l<u4ch?2jM()H
z{BtH*5DHBXDfsTR`8S)~SGDk}PV*z7Usm>>e}c*eG7V%6!+hf199$IK{!QvQ6J!Gf
z3t2CP?8xlj*s!%cg7&GZxC)cgyMLDao|9dRw(RB>8`!=FY;OR8wy~zN-5P08;-qX7
z5H{;=Z{;xxHwQnSHg%L-$=Iw@i4O%Q1pCP4&?))*+)sY>alBsckRD5OP(F@eXUJbm
zd8N5>&OMcrbAoBJB+_}XKbJ)ZIOS7A`wFAu9@kn49J+09<=InOU*dP{^W7Px!t`D4
zYwMgx29;&|F26t71eEgHaoTfN`@eecw+$ArP|xN441E4c)DZim`-tllu3Vu<T-9bp
zPO3<}G0p22L1EQWCy!hmq|k3MHN;>`N6{*S>kB~8>6G8v^{-@TBuZ>mEL|rWWMqVp
zdM&#8k5v0)9`wNBlM&a6_U>uGUm<&YIQ?9$R;m>t!|<uu%n>x_Cr4PM-6Hgl!mjC8
z`Iunavgxi~!Y-#Hr|F-HGu++oC<;n7&b7wF<5!>b8bNOGeox2ATR$z8|A0hk{Cx9g
z)Wn>af<H>WTeBgq3K81hq(oAGI%d?Xoai-8DE8Rex-%k_PxcVGfV1HKmdn$Pu^B#D
z(Aox_lM=Tpte)X>q{8e*rwZL8bAbFSmYp0a+aBMd+|PP7RYE|VyKl`<Pu@Fi0aeDG
zAA85sx{61_d^-WPbN8aPta(ps7E1n2A}iqg4y|!AT&S;O`^Vy+AqSf7ZmOokKfSky
zUTFhgUn!FYD!4ArNM~ELCbALijgE8%Lpgnynn=<lsQ>jHxev9MgIFSF?eCG&akKWv
z*RV-szn$C3-9rPA6b8^3>R_{YfH&&!r5NcXicx);A9OmWcVL=WRIH+~9D1b>0Tx)u
z^WGlBn|HG0J&v29ACHjn4=KArd1~<Q5rf7kq^$rcOKasgwCoMBOPtYu+6&PsJO6Mf
zx^0=nL$gQ*iQd1xNSin&pc-#fWKIB@jGn^u{07Y)RDMNEIP@SVj}pQv*60(IHTzxS
zMn{9*IehWc0O_hI@yGd5FRgwxBG_0tejG<Uyub4qYGWBGRB4|=`ZQj+&p&&CEO?RZ
zA3X=Zi`P-yn7R=*_dBPs#p--X{eu4FxBcffz}AyVk3u9U+pwC^KA#Z_VGR^NSfY=E
zfn-w?B-e?DJ!;&cPb+eriIo#UzqUVbMoB(T814_7Hp#T$I=h~pf>Jw87=l_Ud{?!1
zxj{+mvy<B?(~#VOvcgbA7p?)#aFQ3SoA~Y8YNKAPsEA&M`d0_ku7Js>{g?X4x4HIH
zO#{zs(#~Mz524M)oM!9KudS0~chMRWI*_t*v;t9mqle~V1MbnX?0x?Os-)0ONYYkM
z1q!+OuS?3#51}6<n9W-H8^<dtlS|X;!n6%RG}SNvd`x!&(_Ps4VjwtuYq+;G_4eN7
z_vYPtngf~-!ZMSr@S~Mz9W)`IxZr_LN-Z}xC)Rjly|&1Hkl>1=Yj>3YejGbL6AbMB
zS%4w>fm<%`m2KWt{3Q_zPuRcIh~QiX{<>M<xx6!Ydzh6r4M>E0Qpaz}(<J5R=a_j!
z4h3)=`7^2-PC%t%pkFE0tOz~RsP?aaIk#e>LS8($%`|6k$Hd-6o|p`@njq9FXl!nX
zWB2YS1PQFh9KN0Lu@`(WyQ>dh`8fEp*1%c`@4R=pN7!$RqhB+s_P9-RtMuyWWGSzN
zBLotEaO2)7%i;2_&ug<Sb1d1;Ddd%GpJ=XIu;V{R&=S#Avw!tziitc|cwoscjk&V?
zpN8r{_xa6p8lTu<xc}yhl0W68MrsO`s(<#YQnjVLWMj?O>}$aI?qZj~VhqE+P~0JI
z4~nV9<)17H9;0gl=j%Q<r~X=5!@Vk{=t;FVKeJ(dSb>vVVw1vvhWM0W3t9HroOw!!
z8(tPIy1P$i{k~gALiD7W@bgObv8ii@M;y$SPT}-0=LIXJYK4Q0Za%L+Tf@6t*>fgG
zn)CSA1Et<DDMu0aQ?|N4Z9virE*GmMrAd`2lBcsTkRf%Y)qH;arvD12CWg@w2=;wm
zc9yAW+!`Xdh5ytqXgUp0dNyAO2w9#E?9qJj@1V8Ep64wgoxA8QN2?RB#O1s1JnW`L
zQ0I8RXh>r%iHCecYLCDjXD;gvLe-Re#>W_kY_HKTSJ!Mdz+6KgHFEK@JmK*ZwNa&E
zh_^&pw&`H8+|Hf19$<&j_6}=^Mfgw0w9ye64a<3GNd}8_)we;Pqx(&EDbaF&*70{J
zvest=jGdbZD2@ogp7WSmwdxLCEji#Bobw{g;=ZS?hG^Y4{_??tGpM_S96BYXw!r0a
z#zl>FAbX<v*F9HUU~TyG+7IItGTx&4H+PTA+Rqdq1J!&@_3IZQ9-!`ZxU%c(D#u^*
ztFG*hfLllAO~US_z|-0uoGzI1RmSV+f``^^+P8j-*D=e`&}hZt8E+bL0z=i8cl<Gj
zc$M{%?M6sueSJdHhZLtX89i>fXJR%_3@@BShO6Z|>UpO0j7A<Z5CmxOHSa%su8;vl
zLvBO_>iJw+wNNY0D;^F=3xQ_#O%wCps!0lL4*pG<xX<2Jk#glLGfgYSS@tF<`{p_w
z$jh|{|46v80y4!{9U)+jr%RaPM3zdQpvOWC)+uNt7*{^oJ67TuKOxFDv+xzW%BQEO
z)_|`l4nw5lyg&))7>4u2Ax(EHtVQ2*$pcwFZ?EOyk1kR#aj7oWaXCUEG96Mit>&t>
zw$^>-3vIL63$?s^S1BkExM){9+bLwMVf2NT+e-Mk>jF&5<JP=Xc3}5aq0jhvF*>h*
z-0CDAR68evgSsAkZXhX3E*8wx$Id+?^_lQf%5@|mvu)z~eOEsxfMrAbc|efG8iU%w
z8>4he^;TKAocl3JRuc#ZR*?We75H!<5hO~L=tz_v(j@6_chlw4*=6c%B{S>yQCBq?
z_swU0gw-1iDc{4%vo+qOg?AfU25nj2*N=;1(a%)4muY9zDC@iFi3{i4P)Gm3Sr_Mf
zV%#tJ+qz^c4^~<4?nAMJ=Bb&<owlHCG7A4*Jas=IG|n_@4Z$k(o_|S;ReNZ->=M<y
zqW9{gmctv{zpPky%QbD3J<{+^z(x*u!6TAwc5Fpv!DY)Trqr5@SmVrB+kLfi%pDh)
zCv?J;3pQX4bmb0wD?6m?nU4|igk-Jx%3*7kmP%~n^~yvBy(z|rNl*bG?WX9x@!e1-
zCXO<h4vB7Mo~Ih|QryGrLr=_o;2~ea+*Z@qglpHyQzM>-KSpTz$EER?F@5IC|MdF5
zp5?Cly|7*xqlMvAsz>?k_KsAX5b6YN;w@O4ho-m&gb$LWyp#eGcLD(bVC0eMJB|rg
z;?u}8=tP824j0<JE#MDjQf9EK(`;%;fJ=4I0A4wyT$Jd0O5>9$&{oLoR+l1T{tL&u
zE-3vfC24R!Qo1^kpza?x;0rUj(6r}FHH_PC`Q;pkH171rL?w*fI=Xa%f^Dx)Kw0MN
zzaTy24rA7E<<2xAmB|`=mYpf}m7?q_fU}W>f=aj&rv!`e&x}ghP!ewwXw;b7*c%==
zFJM+|dMPfmhC9)nMjsWprEex}MaZ~KC7-|aXx%hslq5kHO76amr4ZHcf#uIM_4@mD
zr2eGHols_?tygCY1l?F@D4*Hngn#2_W7vfN6qIJp-Rj5lkh0zz>o`~&3#8b#EW>cj
zd~u5QOgd|iMVtJd+t*JDJG4Rq)LzftSMebKrBp7PD%y2rL!?@xRf!Losm<%Ef0()U
zm58i2C@4VHYu;3G=`)HS%166kP_aWR)aLN3{gva5e-q3m5CV3*mgSukqrJ!jC^IIg
zvy0iu)Qds(;%{>nwVMZX6R?P<sh90X-$nhiD=NvBc)cr`EzfT)nt^a#8}g-oZ@Z!k
z)o9hu1>ez8o~M2IrH%D%i72Uh>49T2WaXx7pW@=2fxVFqg97t(Psi*rJGO#+rBT_X
z0#5=2b>CVkfO*8g{D-eC)6w~xtO#xHR)~We%y5iuM?9%+*p!aNrY}Z$YsKRRWQl8d
z=NX$6iRkgv)6YtfpVnom|6rSu5G842CP*pkbc_goG)Co8NP+OcZbN%ywmiq4=9uQH
z<yF!EKBTP2k)RTsB@&!?ZVnwv;6DrL%y`nwv?xPF8S97d|2QU<Gwxj>qAHZwHZ0QA
zqfFFYS;$8EPr7luP7#azt-sp`cB67B*>UHO8ox_MJz@9z8FOov`kLbWoaD3lox7U@
z%J}?~juUzrYL=Bv)kMQ7`#jC6f4FIVz~aGh=J9uFYQ7;?>1b`-<<V~tDdKl*1@CH{
zd?2+FaSx3C6ep|jR-cy(3!J?xLF9cq#b?^@O%?IK1GXpeu0_JS-}@$1;9J=0!zsYd
z4MYch{z89koE93J=Ie2AXfz<ugPY~2j1Pu0sjmI`W;6b`YE!$p`gbUx^bggq!2k76
zouump2%!J;vFvo#DD52~yK;*ov~uX6|EQcMSdv><4w8-yqFNUCPLtj@TyZ@nSG3@Q
za<vFAT-MOI{;y%kZVQK<J7)NRkR!u8OKqVN2P6E!2Rn5e*Ort(^q^JY4FF<BzpJhJ
zOGt1P=D7+z%|*)|YyBK>i+0%1!ybnftVhw5QNKhP4)-5*PcDbr>h`V5$Hw!18xBqz
zrDM*PMC!fRDjUY1UCV}wt_c{pbbRMDB+uR;D?>xib*uqujP1XAMhVJXoi_qQmdyg6
zXV=ntN{*ij!k%^W=^kCU(uBMBNS<*k(W<N_B(0{%yqnxC9q4OX`aW{v9J}Wb&nYP@
zs;>N#lWY#^2^nzKs?U?~a`4l-rBj6=ji}$Akog-kJ`WTNO{}A~nT_4@^kd5iHdOcM
z^I#JVnaZty-x^$2UD*%wiX6Q60J_XSh$dd|W+o;Vi%&oR>hB`-uw`y8hcclyPFzY$
z5>*g2sQmB7wsLGYd83;nTjm$s8`kyV`hmqIvlBSxjUMy>2O2PElIU0yjr)Wx_8!QJ
z{l7ZP%XGsM9sfKJqPd?&Q=<#EFR$f6RG!AzrCO=+Gdg`&`wgvW7rb^f8Ohw(_WJ{3
zQP;WLp$Oq%t#l5N^1<Ad#93V0Z&C2MUSoDi!e<4BAzEeh-^`X8t`c2?GF#GM9(17P
zG|`IrvZ$GXODD1gb07BCqMb#{=b`$BFqfKAStmNEioH>o335@jC}+_XE*q^S<kf^B
zcK+)8*;VImBTH_jjJytjHJ4Y<cZpl{A78DwPHnSpW1(gTZcNn>t&o>fapX}l$uw^7
z9B(|JFNv&OfWD75dwaw-9-)}}2qJOx5JGbPnjizmaYW2oX>6vN+Y{6)j&!iRsi%p0
zrU7b26$eNBn2X%GA}8h*e$dm`I)c!5@~~yoZCIqbn7o*^p&R}}<`K3H=SuwUd}1-C
zbXRhNvb((X>AyV-?N%lAk>)p<`cpHI?pieu!C3!#_3PqgvQn00#%7rxC5Gh?YGi*O
zD>3#s(d<d66xe=H8f)1IelQ+;M?N)usWA6=glt`YPt`x*^usrqH#jxSC7g0p$dw%^
z-(JSOJz0*>1c57{9PlS@Z8M-ud?+2C*Re&S;h0ZA=QE%tw*3L9?`VTsRXmSYIJDdh
zu2v6Aw1mmANnom8tYa+UI|P8;cZH)%mHcxBw-Q{2pc=DDHwCxtg%e`VntOMGTXzD}
z?hd^hxZ7SCBYO6U-*Fs29hMiw_Q4J*n@fP({l@(M?FzugkXg#?p94Ts7G25W6uM1o
zHucSbNt{jTz5HX1P^s#`)F9>6IvuVxoa0#R<skSIE+3(mUgEG3)`3h5z5GL?2{J`M
zSeQPYQ|;Y!>I)(iXztsX-pk2v{e?h>!znJQz7&zX&%tGhC}0!f4q)HBzgGW|;gS`!
zYqm8|%28PgdI>pVvWa!JEBU<VY{z+G&bJ0F3)JqyTsljF=B<yF3Hg=@gLXFWRr#hs
zt&~j9>^u4Y_C)M39CvrZd_J@H3C@Oojr2{td}(Rx_7B?QUMY7?u66S+I1L$wu)^+r
ze(+P?_gGxwFmNP>y3A`QWyR!^-`R4zeFSP1R<Wn4;QN(v=F*wBpTJtJfD;cbT5~RD
z#I+*~2q7?_{SR#Xkwb&wMah>2rnEHSXXx@f(9OMGL(a3y5;Ik3Y;!c~^24()bGxA<
zVgDbAo6IXhq$c``jsIpU0%oyI7yC+HaIbffGE>b4HIZSMLf`|BfnuEBt&q+S8FZC&
zea4TfrO-1LpTvuOBOf_s<jq$fNMzX>0$`<F_<gG{13|EekK*$Px8j_OV7mx42?J;o
znFf`3j~4E+FlR(V0-MU02E0AQgYJkAG+muzi3)~HMwEOI{Gr=kT3}6Cpy;=5cDg7r
zPm?b?{t9o+{TR?T6qYBeBXF$Yn_DdFq`m_T@t*lfbnKg_eva|JkMYaQ=dC~W`hz&l
zH)*y8Pzwg#YSy<T^5r*B5xI{w4SW#Ml?g%HKSWtTy$><(hm~7~|0I&vPWhK>768OK
zql=i}NKDOlo#g{%ugOu@a3ydOHF*pDLb!VQyqq*{iOjBIFY$E=C@9^?!#nJ5jW-un
z=F>8cpJ<z?|Ni$bwLhfY(!(-q6OhKq);7#nIq4huq7u4osjIU?#!1qhCFf{q+Y}|p
zFGNS(X)eOB(|?bXL#V#RAG6aho|`X=IQuUDlB=4D4!HcQIbpkQs7q39_p>RoU2a)5
zsHtERK=?W>Pr6i^>ER;Ro{odDe`>6F?;wW}A=SBuhi!8tE{;jwj9mFbHs0JDHS$P4
zQqyI-A=CtOh9t~1=C+Q6ZLi5nWLoK?*)Hv9euPli)0#ecdCH%d6ghntYd6$e+4N1^
ztSr3)`C(~!mM?aYKuXE9u@3IoYd-NJjieWG1{!bP*odLr0lu#Gi1)6Kg83NsU#5q-
zefukFNHUg-ZNK7Bw;?!lXQ|ODK@=`qdym!n-R7r6bNwwd#-Q%-+S2mjVcsK7TvoN*
zV-4E+juu1yph2a|I#qAUazVcfO|)jFK9)}7j`McIf3iH}t7X^QHy~a&b#H5&5oos1
zZsx*l_sIF?otg?ro+j-t<H8N~cZ5@YSeDcGf?m!1Qd*=biq?-{PVqryB{HMM;p;Oy
z3DnO)W%<Sxo~FTjXYdA_6d@e#1L2^Gs7$o3^?Df{xHAti+m?e4j=XFDhY;imPaDjS
zzhsG{clNU98;Wr|OM>6-dy{^gm>uUFb~SvYq)H!~rqWi=9oa%BcPdpEG^|y%!^%QJ
zH-_f&uBgL6TBdRSWY6L8hH9+BAA|#XJioa{dr|LjQVXtacIIbg@v);`p=|Z{)9Upo
zp}knGX%(}hcU5d|qx&1esR!g`bd#nL*D=s3U7_jBTz7hR=152VnF_~$_Ttz9h6#R(
z4CwCF!GGQ3o^u~*#BkVBe@Dr0qLcr;>~VBn-TgGZA_lRT$hj4%swT?4^oq*^={Upf
z<%7z9FRKo@2*sYozn$~m)0A8#6J0pnf*x2u{NUg_Cy+XsoA+3usRh@|6J{?Oonj(r
z_c<CqGu|FA)OD|1>@^AHL6D7zymI5pn{SFe(>)d~I>JPho)~{<=B_|msaKrIOm;TG
zb6v|Gyhcb9WMaKGZOI0dp<)!(^LX;GB7<>guCVC)%+KNs#otO#K_mn>iI%`)rGK&)
z%+%^zaIg*AD^3D&m{cl5(B7LH7e$8D7ZFmcLch+@K@NfL$gyqP)@aP~J978*2i4cY
zdM~8JhtOR^^^=Lf8%~X%+D}o_E4lWpMf#?s6u|j5SNBTV0_ldUmTA^dVOXCx?K!8d
z$W9YXTE&b!re!vE3ZnmfE`HF=nEUD@3(w+d<rO?@UZ>imSR!kT{GQ<9{S<ko1E*IZ
z)0bi0TZhb$3B=S^4u_S^UvnzBH@$0Q$fKMk^fK+27fKyZPM*OVHeMi^M!$MAWqUNV
z?jQT<*9XgAbfO`%79ri}aGk=`!exd%LHU3vRKbXowGHQyaMx0bLTBj^TgIjc!M4!5
ztgY8NIOLDA(BkCiif#~AmJDvHT~xHo8!d?uq>~ttozml)o#Wfl>RZ|PEDr)KZnOs6
zh3|Ne*A2R;z(s%+Vu{)@k!11>psqISF4;GIfcGS{H}vq@RKlj^(#iXkJ#>qrtG{5;
zIVu;$$4w#!c<XX)&d6g|I@NyVB+|m5<^RygYz#1$e~0#{iBcI}=?ypD3e`F55toTz
zq~y+mr~<nIsd&&g$6h~3>g0No_eCdj)-@NqpzX&uZyqSciAMVVcW-HH;t0^buH3O$
zq%Aw4kK=4g2xP2aAiH&t7gwfg-!Vs|TdRPds;exs1Jve8?mLOV*|<WvoT*s|Pg`Z3
z%siSVpirvP8HMV|C%lZO5KRbwM=qvz0FjitEpnXM&*{l-;X)6LLkC!2>}kk0`yE^(
zDduwezAy-QbMZ6@viCDeGMQMJM3+1Imhi4C3Y%%p9dJeUV9hJ{%OaZQ$raqL3QPu*
zSJf*A8CY%C9j%_jd)NY-C0-+k(wKHO)hw1heCg%Y7EEe0gKEa`ub8|ZritR8x#$Q=
zw>9-a)RD6^Rq21`TusEkYL^bqxw8r*{(Q^4%pK7C5;WN!GiNrz@$qc<(p<>;s+GiY
zC;_+n(cJB|zU`ynNR!)Ti2!+{zL449Dv?1-8yS`{o4IE3L}wp_0M{v${vZ-BiIv??
zhBOKN-2WaXwKKW9MFt<0cQnTQju!Q-txV=PKrl*B?gG4{LUE7#CJ9!0@mZaF84g2X
zsEfX!V-B2jsWi2VcTpG+IA~RFz=ml0t$|7P{E3E?@A`sTC>!$B&h5Iz?=F6-rb|T0
z>l;exh)6082zM5+|7?=Zd*gagqI{6j>%Z{4N2CW24xm?YNUq;Qh!umnPqWXTjeP;g
zOLS!m?@9c7lzYV-7U?S^Il!bgqnXhG+t#BFugTm)2F)_}A9!Q8a}I^KX#(AgPi`KG
z60V0+!{GV^%NIzg3APu`u`z;MJ5Ja&iaXh);@$vzTFaCGtUG{hW=sGS>}0b1XJ+gX
z0BuARt!hXp5x)iBEjI~xn29UABD0ZX$ZBg{+PzyX_j(qJ7(MtB8Tz7WMy4&r?aAHL
zhK3rmMK7VugbZ8b(MIEWn9O<ZXhkhBl=<S8U-CM1;p_qxftM-x*J|8BB-I7~mE-Tn
z*Rbv*A+lL@_f5+HEOT}EZMDIQDZav-yIf(V5<S<7c2%=nRG}Jt&sL)^vklpgIJ_#9
z-q-BRRk1H`A+d^8;0=N#SHEL9GS@Ewxts5)`Af9_8uFh&^EWm@68c;2BU1J}KzCc&
z>aUdTe0?t-X$;@l^ZBubb=WsQxaVi8{O}b&5hS(-)swk^eP8`wKZmwvv+|2D7;61b
z4U&>rg1X=z&Mn&h3Z|x7b<n#Z-e1LgVD9W~8LC!D`2ht~yqvS|{JXC5h}Of5T?x+0
zFZ!!k=5bq%z+=0B!QzwMssijjuZOs#u7sLofK|shuF~3bb@uyaS+c3?C`NCUU4tYF
zja*|^1vAT1Nwb3;*uoh5X@m&74C~;o-cCS}6!`3+3S5c6sq*&M+gPnlOZ}>&)wAy<
z=ds9*KNQg{I1RLDt#!BKM784AGT1Brj2-c2%V=(MSEldK{J=FD{k&IYt~Youf>6~v
zSuk7T$yEkCb4hI`d+f7&3lr>vw&YtP=6Xr)p2%Ff{faz8$bVG1$Z(zy5vH_&zCSgN
zbMp0NXueo;%lxZ+?K~Qf@<eGL`0yfunt<;5B`uu+9Bxgl;+12W?Ot8~?i;5SI;gfM
z8y8rHO#Ry<rZ=saTQ!E~R?07NLnilK^72&_Uv2Vhl6@W2A9f<v%P02scU^jz+u`Iv
zEbKe}ndO@7u8-M?*J{kr!xoLS&iJYjPm90qVcncIC~+veng<!kbqK7DyDk;wk{N6h
zR$KvTbS~RwN*N~$r`FXC{fxi3B)O5DOFi#gemKt!jMSo+4!3M3h(n(SwDk_C{2cdM
z_J5U*Q)qN}!g}-XBFl2~F%D*Xmwdraa#Z*WgcZX<nhCavuA{x~QN`G*Pq%zUqe*I@
zl=thVP1j1a<-C78Mj?wf3uly?j*lJVScUYJf7~{@NDhV2wBFbLORx_vKln&Hjlz<n
zp7y%Z8aK($?j*Tg*Y5mDSQZNj*5U!p&q=)Tc~8(A6Yl$hXci65E4`W4lLMfgZ{PP+
zbvmYY+||QKh9ySB>qjqb5x;}65UBE15}T~#)Fu;Oe5gJvWz=z-q163NbrnQ?)v}fU
zv#Y#2h~wGXy*(7#u;IIUnb1K)j3g|9kmXHP*p(KqJbF<`rk8Kv2T%-Fsgg~2)m?kz
z5QH7@ReO_8tLie7mG3!&*T{9K4J;v!)A6RrRS|o^N+*|O6I}4atR<faThwFm$_IY0
zFg#qV43pA?>Q9vp>sO(0_yN$hr5A>XIb~lpTvHKjc+^Pu-)V_-4W9IYDl}E?u5gdj
z>*VoMk*`sYYD}bmG9Jk8hJ^^mq21G2$N55@tzUSD!-fm|2!l-2D?a=Xssz}0m&jP_
zwR86we)3R>!|zsyMzc8K$CJ@(RrzmM`0_a>l$J!I3?aJtTv3q0!$1q$Jbqs3$$C&z
zO}M72E)xR9V}V|KW&_uzm9m+cnnVJ{zeV@gHez~3;^n6Hq2Bd*M<`f97c=nniklXY
z277>IQeZ1;r#x&<gI|Z!<ko~$nmYJZ1&S2E&m&(SAXqJSfaD9+)5by^R2_S%Hzm_-
z&ZoaM>8iFzOJ9wnNUu_Jn-&eSXX<+y$*&X-OSNwAtsEdC*#r+)-Yl|l3S*I@{L4)*
z>q@UsC+Va%41f}L8PUlyO;CwbpE^wDCkI?cn+MyXO0c8{?S32`&dv}4x%PCJ_RN0H
z;h*Iyd7xGy%dH9;YUPk;>^hxn3lyLKsej{c8FIzkOZKwA>@CVLU?bgYKE_M!#W$v<
zWnn#)_NNAVHJKVkdCy#>t^{O}z@_d~jh(JmCERC^M3@xn@*%=DdBoMUEOVr-p6k@4
zqhH&!)6|Bo4CbczwnfEzo0+eaxf%p4ipY1e*<B70pjA*}T<)gJ?+<umst-E5{;g23
zH{WZn6@u%@nE&;a%Cm2)Go2oG2w~hSm~1sX(45w(J}T!|V%_BJ@%0>FbIfhk;cL$R
z^Db3rLTfKg(enUGm{ly4R~-DeyW0^c{!+$=m}KbjBgC-|I{+&i(oq?>e~J%y4Df`s
z44dpFEfDBYItUdZ@8fZ9CsRL7+N2n?cu_}v_8ba4Y|(y+Dg=PvwQ+V0s7bGZBbCu3
z$HJNf1EJ6Ev;nyBv_G#QTl4tUQ3Uw-LR^p$E8vj4rUdQg=G|L1SsOI96F}{A#S2Q)
z8t!zVZiy@E>%D*@8a?kqj_qqHc%^kb;!jkgf-uhLFJ5O}NN)*Bz;0%isp%XsWH#>d
zUep7BqFnS~8Y`?iFJ%dy8qtT*h2pCqL$O~wan`z@H2oL%0#==ar+CQQg32l#AF!OO
z%9yX|#T+1;MA4HqUGUV_{`^F#j|I{3P7m<NZb(u0H=W0d8?UKD{KpTGAqns2M9x7O
zx$m!mvbzog6G-z&WCLm4wi$%nOV>mX+Or(DX`mIxWId8ut+_@54bch}gw%M?um<xc
zJGY~K6uJGctmtV&utl(862fgsSEcGieB0Ig4ukDPN_NN_TC;?ZSpD?ldM>wf@9knA
zC?V)Db3y)K^4f1)ks#|Cq~DLT>8vSFuO{6VUC^4>6G?II3fXp#_g>AY)DD^Zjl;Kv
zUI_)Xeeh>KO_~~NalMI{t}vCC+@d@P_&ZKrj-*h&<*9_a2K^!-0~1bD_pf6g5i-8C
zPI?<YgMP3MzB#q1VW@A5iD?4_ZFi<o9gFRA5Q5Z_AYqJO?*p$5kdigA%f}+X0hvic
zy!@~)7$g-u%3AMkJQ#9yAefs%5QR_l^Hg+|6;(_`Z$Xd|YV&wpP-HV)HqKWq&}14v
zU91cWv<sa#;TEXZ4-JvZ7g1S-O5kf3AkJT~KWw%`3QiUemm{KcjS-PLLy6VifBx&~
z5>o;gu(Ur8Wq8%QC|`bE+UDoA>u>FXSD5!>-wMnk&brq)ols7Xj0m_~MAZAiy9amL
z%@}t$mT_DUN<P8NE2U3Rr43Pa`7f=ey@#H$9tc#e4_q(l!!=jSbI%puPF+yX4|yHp
zx{SQqW;f&SpzuHrgWu5b&`KR1nzG_;5}dz2gv0g<Mx<2@zXI>Y+X-@ny?bNT|I@RO
zbA@R~8A>3K`OeI3O$HtslOA6zh1q6QGMgLPqJ-wsJM3n-A4$xH=!e+O(Sf6wosapT
zk`)`8@cN_9BJepzF;7YUJW?FSPkT4|Uf}tR4F?aM3KF6jh_3=x_psd%=y(h1Fpe9s
z3ipZ=g@7H@|JoTmj959F?A;=2u@%7FE|yZWIsVwzhYhseZK7e3Z_`HaAFX@T1E_K1
zF_o{YU4*#<jKx5v;VT<jZChWzW%k^kiV!*V27^DGcdaY9I@u1espd(Xs5r6`;TII)
zGPK$Bn#|!<;r_mAWVL~C=&tU%G>E#}m@TV|_T!)WUQjh4__lI!N3W*%lIN6}3t~z-
zdtv{Z;FBnGXlh7V<*xy*{qc8I%TPH-q{-OBVBEb`+^<?lM}PeF*tl^&>@7<I$Flvf
z_b2z%u{rO~nGN|;AqoTbLz?LEBnqmvWxlT>#;rF;I8?diG~pv7$&^aU>CWJ?3+riX
zR#=$k+P28tFrk&U;7rstIPYltFPrfklRHP?$~nbA4CI48B@<lT^{5<l`am1z7#}89
z4-SQJXi}n#DXG+YC2h2VoRFl(9~bfWOm!<z8W8Woe`PmX2`Px>@V^q0xs$#=?;5k1
ztMe0Z(us&iyVB$WPpQ|OwxPiQuu*zeu3eoMp09SF?UdluOrmDp#63}62%@OA-$Iic
zkS}<Nf`1EUclpTyzQbbyi4zQ-1LO%GmN;ptAxQ8`#I~HZ)x#o_;5S@0tUChBHAQ9C
z!*9~H!rVMY+OElkYRCRWd)d8MT$}A+nbs=7l}kFla}~4vsCAB(qyI`kre@mx31q?l
z&2G>+6PN7RP$_M4`0EHMXa)waGPsImzd@m{Z`M_%`Z}2P586iMVpFCILKP^<`mfDa
z7Md#ICvUCIu+@}TDCrZG7ifhf=5N*#se9-?$y|25Gtkk)1GI^Uf_6ys-&K|DKmh~T
zt<JrfqR&fuCtao1l%=gnFCHe_3EHuoktLsunP`ZgD8Bh;%L4+^F%sStA+TKFm+-D3
z4d@V2%nzUSztGntmAzGCf>^B2sR>j)UXx9#c++cgDkP!5X##Hi4cO_WS+>pNU<(WR
zCR@eI*lI$f!m&zec<?O%cnJUcB=cLTgWJz(@21(oYV&z}x9pW1PRS4gs}u8nfg)Ap
zgxsy`d9V`2|JGsdJwkq9)vQ_PiQ-rbu1&)0EY`XV875;Z%sidsyQ8pzcLvksD+7#9
z1f#ZI4s3-ry4ISQvXoGt?%>mGzOVy8`zgtMnQSan<;Gjw2vHvLyOR0XmiDqg{o~9G
zg9GoghDe=FmEQQJs{o=bAZFTF(5W!A_2#Tkh{n08y`a}Jt8dYu({`L&0L+|-LTL=P
zA5S?QJUzR+R={^O=}oNoN_AB`fu@070Hvxl4(0#)^iL6A=b32%bLG)?tI~CbrWU>z
z#_uI1{9$Zv<s*t+q2miZ&Y-mHlJA{GzpdAbvmPT%#`HfZama`Gp4OJ&zK2DGviN-%
z=+1^v>N-U#wBK9zHNDOAm6jX`<Ht-1g2D*0X<iinhifPqZ+ZdpL%to&LYbT76W0Oa
z?<4Svx&%Kr<@#IDJFcVvKYyf;<5_?5C*+#k^|69r*1`&%_KwQvx+KFN?6k|z(xg*P
zRoDK`RI{q&P;{&^_(3q<qs_Pck1)u*sfZ$ZaChFKFW5Fx&Pvz2qQTnYv)uE~`dl07
z#q`fGa;R^4(>)`R9l6KOmTuPet}OZuSoXeDyve-nrB23XQtvBt;FS$8mkCUNtA;>T
zKEf}(=(iw|O#V+>GynL1lAmY!Ewr0p51pK&kz5^jz+Fz%x(Dwnv@v(2b|Cs}*>5tf
zaKfSQ2K~u&PB7p$$Q)b&4KQ$8p~$&c5t|iH)G(?dd*pKrVYAt43LZ#6icFoT6?mw&
z9$Bv)x=ch{HmmkyuM49+igAUN8x>zi6TaQ4SbSgDCk;3bUdDhW{GG#{&vm(x{3oG?
zN@~LA4>nHwCltM<TSmG1g!W#1mKRu8`p$MkR*X88;;o--<!d_(X>@uMhq0bwJTrff
zzT>JdVn2H(I*ss=g!l1Awr8Fx2@>50)yQA#jV&jT!;a0QSoyIvA1(sW?!_t`Z1@G7
zt`hE7VM`LONWF_ZO_RUqv1O;m4E*{fMQVZzI!iHl^!Ot&zm1m4lvZGGqmA`S9;^49
z$K^a-_x8=M`^qR;tm|ywwF5pUTE@}HZq0seOdEXgZN5#703;1dSF=Df*kS^`E>Ms|
ziKJHASKKEjb&AhmP|(x`g1Zx%bd$Qvo;clZ#NcXR)GWk%8;`N-en-0A${X6>sbV1b
zL<?2HP|;nRES~MyI?9_WEB<Htl9^oj?8_EtO9})!t!07URCfKRw9o_IgSoF)%9B3s
zdt_cvG{pIO6Q-$lG&xE19Gz5YPLMO&kl{K{ACYU#`FGVv)r;^Bp}&lEZtnfpR0KSN
zpJ$dk#Oz(;!UwA!@LQRu_&qvE$o5_qV&zU+$Acf2t`SkRZV=u%&>q#D`#ACM*TJqA
z>Oo3?W&cO}G<C>R4FI3H%+aL2xA^pDz&V<WSo!v7GD@)|=)N}g6JzD4CYSQla|Ey$
z!gVazf&0ERRYfi4_>963f^D}qgw<_AX&IgW_qEENLc@}yM!Vg`R^QVq;uVLZm6Ay&
zgLvehE>3l&-P+%WlfM4dJA|ZxW=$ea5Lf5x>C&R-k`4iY_NQJ{)Ep241qg_X(Dj|R
z<i6LI*G>fO;V7JKooU*GN?L$WG%l2IZ{JH8v_9~1(drRT8g<|~@%dmE<4mmg*yl9+
za*<a>HbYQR%|3>{N2a&iE4|O!)9x7`axgWMesS5qjVI!)J4B-urP`9CPh`sMp$Ak{
z=F9#0vk~(%!)moION40YRR$;FfqP`nl^0gR?Y{&h8gXuqq??ONhD$PeHPv57a((N*
z%Y)CM2^q_<(&e(C{ZOh`Vnj2Ghs{sSlGPXY1X8pAGF5U}cDUB~FI#;tVDtB16pzv6
zh>Db#7GKY}gPVipk*K0II;C};4>o)4x&qj%{>X%d2CSWG^rrdmk#N(H1tq5)&ahH(
z^`_eh$p}jcfLi;#WvIlUzlx|#FfRm5BAKHFQWY!iL8kgoc!H)J{~}C^uC+ZQyI%$P
zN_jEwC#6(;NST$p<?ntnc%@)AchIcl9fEbup7-py7@&d^H4Yc_qN6$=?70st=lVX;
zxm{HbB%vu$2>l$HWUm_I_HdI~*^LtHAimD7I+6TwmYv!)KOx?Yd)0Wci83<7o6?Kh
zF!NHZoq4OgA7mlg`Q+2s1hEV-2RzgtdT%sM-?xv>ro|?{45!f?s(XpjaPN1VS!c8F
zO$N!ICufRn9}sdIDt=w5vndP|D)o`oJ~#p)x0V7+0Gm4hvwcUrJkTw>^`H0lwF}jw
z-ECf)_(~#vf-R(r2IwnW;|@JYk#l0n7O1rjzB*fv&@lZrX!wza3wW3liWMLS!8csJ
zp<go&yC|;i@du_aNh#6b178XEc(YU`>^F#GawJtLJq$C*n@5)A;~0W+Q_>xC()F}c
z`+cWeKUaZz(?a_zUGIzClJu0kk^T4QT~L-8w=KRt0MRVJZm^x^ohg-M_zhEY?@Vhr
zt%sV<^{6%<=XcVsQG2UT1HJ$b`U>P)6;5;qr2YgK*<V6$OP012aQoiJDww6`(NnuZ
zQv(P#?P*BuTIM|jHrsUlx6|j`zf$a_TL`J_zb3E~cFeQ?1{AjJq*vE;zfsj|T+Ftf
zm6%TmRwSq1Vwpg9X8Ib?v&|9JU(fR}1YBso<3qRG^vz*72WB&fF7l8(@SaF?^qBIL
zzBHzkjT>Pmw9zX^nRuN3sKUEi4CEL7Y<%rCkd1>G8eh$KYp@WnXpvBCX9&C==lGNX
za6<kVtT_k_)@cV;pE3CVkfxS|*Ab?2Ba$f<N9@rRr($6a_P16|1>4%1NbLz0a;|f(
zVus+E*`;gbgV|3_I`oA038#DB>P7E1LG<$f(Bd<!^3FzlO`EF81#W$0<$LY<JrWrq
zhOn~p#PQltjve3?-{h+tpPf7uz0(J*gf5Mty{#q2&{Ay~270z`-V(scMDPKEb8D^5
zTOm+qZYkG#HtKju{0q<yIj|tjw3?W?@iQEv=MhJLA~tgt5qxrM`^DQk4B<RMqMvPd
z&$+*xKGtjbc|;>wGjL`Y1P``Ra?L+Ue_@$SDejkjA=s&M&N<;!j7(aJIq&Mv7E0**
zu>TYveHr-AY1CyZh*v`WfbA#ewyv$dQmz%@^cDctt%6PzYR+YeJK-NQxCRyP-@QHy
zVfLO;fO9v+%~u^7w=`EyqUV(Jq)y}_MN?Y`d!;*5(!jR;FQxF8$fBEwibeXqQRe4%
z@}XBko_<pM%2)ONr_!qDHvN7X2$xIS3pO$uCU0mUD)~21V_`;msp$)%s+#5F&_>|Z
z^;YyK{lB)mYSCuNV|V9gZ|j7wh+A#@W50Tsl-SQA+F01&(iSi5v_gb_hnaV@>2gb+
z?5_OuT*w{`Q2}ny#-Ggl<)u>arCbw3`UikB)R>u4W8Gj0{7bb2k~UDam5ZdiM3M0;
z{(j{aE_YqZ=JUIk)|4B1SZ~%ogB>;kn-Tb~&HABE;zV>;!+CJxg?p>|?WprRaQ;OE
z`Mk|K@K<SkU}i~v#fIzB;{f{twdHP$CLV!J3u~xwt!r;~DWm>N+#ZPd=7teD<+{&I
zVYY|fl-)t)U;rm@odMl-d4^Xc=t9KVWW=LMN(frqEuP4I08OM<My^S`@tpO6^S`;i
z{Jl{j^;^ekXlaSRUAs_@C0>Wxxpz$YG-G@uNH|~q_c+F3H#A?&{3T>%*3{zAN15wU
z2Pf54WRZUj$Gf<uy#4#)pw$@iHu0uQpGQEFGS_0ZCCEBY_UdnYMzu(suaZ(ku5FGF
z*w2Tn^c~yZkS-3(lRr+f*SyPv2nf%DCX7!<!%7v+{wn&2R{0?6#r^zwM(vt@qaYWb
z&T>f4p{48jX!S;^CflbImo;y^TB#rs2R;b%tvV_%qQXfXrjca!!I$&(|CUeUWh$lx
zKlj4wU3P9?^R9j*Xp^fmV0(A*1G>33AEH-|eM!%Enjj3XDOTUhlZirY=&7hB&yO%r
zl3Zk5*?jiM`FLJ{lqJb5((B!Zk1BaT=AMCl({<7wR4ngtbE?xvexc*Gx$I>Tkf&4d
zD!?1u5X<o#-Vo3w$#rIJWeF_g5kLY@1%s67o$lNyFhVp>Z7UWJPu&8~6J$$+aWdR{
zCR>`h`)f6La{O63XH$=LnPo8qIyM*8{9=g~A(9-pVaIg|95nW{%#t_og?FPm6Dcb@
z+bV{YX3(*SK`@XYTR*%ero+vD(}6fg9xvX;q5&aN=fXQBJ!3!N8s`_!CRq$7DaMk^
zsO8oB(L#%YTziv`6X;M6H?aQ-3*Cb7jr^ttY>qVBh9j(OBh70of|}UU3m$dRd32a5
z9&N}^Sa*-M;CM+tjk<0kL8VQER@{TtYF^()=<dMPM*?hUh0D8wO?2dOUD6_~|1xA7
zHaFohV@<LNwoj0>eS*kVNqMOllfJGfTJDAR%fHYZLyHdv_22OM2yoJ3n0k-!9V2{`
zUdctI_7E_|;^5sm(tE?F8|%-&F3MeN(`_UcENVhMeDdXLQzN@6fRZ#iy@Vy}OaV9d
zVk6JU(gXN(@)jc|8Y@IjRw8}8BU?1Ke%9gr!|=K&;UCDRto@L3IV{*UmSd6o*nEy~
zh2&dpPNad@p4k1j=t;5shnCoaI^7fE8@*1u1^uh>Lai@)1zfO!N|BxNEfKapxf}4`
z3Xn?aJleS*j|v2vLoA|KDWLe_lvi)!PqR7-*^X%)eI9RO@{Fk!JgQk|mNbHYSVI<o
zhoGRjWqI=De)<~I<==zKCO%!;G#+hWI7R;e3VHtt{)Fsx<d&*8x^CA>U^M?SzW%Jg
zJS(I>YuZ34PEr44TKcb}BgdZ29oDeHEG4(?MjVH*w%ow*@aFm-ji$lwyvLzB9$cnC
zzj&x+&Tw^ctsyo{>f7taIsc~G?JGBhK`<MwZ4ImXjS%(4=4cZk@MduL?-5F9t15QC
z86WS9hExJIyLKhik3%8V|3uG~TI+q6TZCh>e;nM}W=Y~<dNPq_&hV2ap$zh7@_2J)
zn%N6WN)i*+RfX(ywoPB!DI0D@pkHYRN&h9NMX!O6j|M~*nnk7|6eR3tkk~E4;9oVB
zZ@32*(vpO6=e@((fqco-!N{DZSYwY@^k7bWLHWa2c97=kx5IxbzbFORuRpL?sFfZI
zb_~P4aE*%mhKuk{Q*iLlyDPc;@i9dneZNuKJZRdyZArUZvxZO_F<38YDEz@e)v@D^
zTqV;R%pIa&+%CB#0;G0Gz7QsCCivipf3(F*Q1{+I;xRLqSHZzsSbbqKv2S<?8kayR
zi@n17No8pW$GJv`wuXX7oL=WrK`XkpIRrJd3ucvC-6Hou$<Rjh5H`mS@(iB)R{<HY
zVA5~bV+z@RU+w)of}N&Y&S0mbh3EO=@>M<>m@IBtHfyL|eKr;Djss%0Xu)`{?TYoJ
zP<Tz1wD~5Fo<H`1_;<KL7$juWXE)(8vV8z`=D`)(vcPG1Zx(r=1>FW~9%w3n2KU^7
zw;&cDCR0F<#FLTyP7=#dDTDrJa;H6d0OYbFR9i^BbQVmP`1d~Gc=E$Ep=S{o7>it^
zA0XH}!c->7p+Y)P(`v$T*fzbyr1UaWMsiHs5|<S1I}O$is|R^~bikWq`wIu|nU?-u
ze55W7>mI8^Mm1*&j&|4qHP0|sO<nD1Vo0XvEsOH!U+fcOLbf^d(4JF+uPWC{Kb{UL
zRV%e`ux<Y$faA}V(jir8QB2c28J6(sDzOEg@zmSxZD*nH%l#_Ue&iVaU!>EI;)}Gw
z4eU*ZtbEqD;PAA`SDZZa35<>YIs~@%p0wusG=wa==Kasufd50<dw|2Wb^qfMi4ufF
zq6R^bMDNiPf+V5`qj$n6(W4AO^cE4l1&Jub7>qI)y+kL>=pt&g5p8t;Blo^<?!E7Q
z%lG$xJkK}|_Bv<p{aNd?*4}%q8RyHEAoD`qAvWt!Y*K%5hsEUM>E-j0$nu9gnr~p&
zdoO&PZe&~~p3HgA<jlXsFBVrfe6;$B<L$<99BXE9Mqmh6&WX{f)vzcy*-^Nh0p0{-
zc!^UmOwpuFD)B~RnikEC-ii4rEj<j{0?$MUB-->VE`rRzT(~<+>7WRXd>K8%v?;Gz
ztO%`^qP9Bj(U=Rp?pwryHtlzNiB*JFExIm!zUZCBiwkS1U+Xt#X%`3ASqw+Hof^QW
zy@zDn(P-D1>huk!0diXCf+>z%xbIR8Z>ZmJ39M24=mxk}*8s?A0dKnpR=Sf2POI1L
zv)$qvikH}Z-h6a<xAjen;pHu`{&SMHkaCwUAUTEq*Lb2-LSQ?yyp~k1a=zU`JEr4x
z$7NrOY8j+s#w<xU1=w_2M+UacUig&1Xk1DkwzO*iyDyVVwJBDl{KHAEhNo>X29#<!
zkSWJ_UzW1bMcdy9yzj$}d{hYjbW0avmL=hr)?ynjoEI_Jg@s(AyMuPO*GXyhDe8F)
zw&p2AW`>qPjX1X}Ig!FJ7=?AbD*70^w1wD`$kkoP_P}^puo3PXR2yQYUTa~kPZeAs
zK{O<Oj^Y`9B_p_{UYNu_Y)1MM0m$6UZM~JE49QP*ib&tP?TW9Z$+fIK<m*ws^47hm
z3t?!Zos1@_8M_lhYnEI;J<!M+lU$)>yo&59g%}Ss{743SX53N3j~fO~klG?%&E|gq
z9Y^ilT(f&~^TGo@FSd(HH9*D$4o|x;LXGbJqPDpk{x3{Ewh!m;JoL#^rN3XPp#k+r
z6}bDF3Kp&F2Z5&QEBM+yRi64L$xB&S^S7^h-C2~Xfb}ark;HJcyal7j4&Itorw0;z
z`C%&QCrn|kwak1d^Q>)`BjPA+S%jV6XGgT<N<upBaAl=$k~vpO<hZ)h`_-^27j_i%
z@dIeq%fN;TtI}~ry}W$ROPySo%MTH&DqXLbW_jqF)az<u6K;6`X@nImcnC4+Jg>_O
zS>=KYdU**tQMpIAk}h@<mqqmr;H38F=3ZIXvwGSr6?#kMK%$>t5;)H_jvIqRl*coM
z?t#@<Yh)Oycdqr5=m?<}oGw=5D&3qIT)evrJ~8eNV})YUCva(yvbhiVt91&|J5UrX
z&rvtwliKpH6OK>9bb<6lzCzt^N;~9uH|9WXEJg&YB4yZK(I*C6tNIVdV*pGQL|EcS
zOh0E+f?k+3U6Q<Sp7VmdyR|bl*(zR(9qQFlV4m@nHXu5b6IEh-$R_Ec@|2Dfy7pGr
zd;*8^<2(sq+#IfBxN%vxYVo!B51m-lKm}Kiv5m#B&vTurQlXkQaVydB{P{FAY;6<6
zU$_It=6RuYTDOv7v2f$m_p?;{(^nXTX;8-Fy=vh@b+b=RT!+L*VDmng53=vB=#_D~
zxVN^J5*MbgQLhy8Xdmogn7D@c#~D#U?uj+~zEra)Qk2eG0l4NFdJ=a0#$7>-^z}`O
zIwjTjp-5nnM_H3LGFABL;pAKpTWSR#pN}M6mLsdN(xm$Ny30!l5)!0r!UOmm4Rw1d
zPCDj5RLMhoCv}yJWGg8zM8GR%`M^DNI74^KW|nJ}Hl<BGzrLh69WjS8FhI32^Sli@
zL=b0u8_|VM0;HbzIN(^%+6_z1bBbl<T3IBrD#|(@ggToD+g}5k?a9?2*l#+La?tcf
zjZ}@f7zmL_voK6e?im$zVcp+P1sg@AmbsvJCHg*GTXC;<zq(f?^l_Zq02g>=LNF4(
z>EGHG1mWzyd&!pOF(c->i7u0-T65@r>a!h45CxEz_QiCk?Zp(WOx>+7_X^kc2l@FZ
zm!y&?3hRNrRljTNXYmDq#;F-CBB!Ja1dhD2+->{T&G*u0wCC6%a<ZKWgZw;IHDrqT
zvfo5LY9`63^W^f1kAWvV+6>W7q3sz4zY(ouAe~{J#kt6nSWO-N{fp4WlDp#Qh$*uT
z6M-9*c#isQ-fLyqGN>CycP8(Bx_Ym^A9L5*H0#q;l;blXEv(Rij4ehG+U>_pmoTas
zcKC1@j|xdS<(lG2JzDdeC;~;kw83$zHB0rnL_zA)@VHI!qWFCiST-#Eh@)Soz{yn(
z6c|FvyEbtB6x=aaVQ>zLY$!djB`p*?4XZxUsxVt6F^=^8OqGB{v24tvjBPj+wh@k?
zRF@bOdbeQBn_orQ0tO_LouRjsS{2=j#f{bMO;k(`U4fFHC7=SzR}RF#HQ5{m>VJ}X
zhCGqCM>fPgV7}+>W4*-8(L?K8VT){E><_LaOK(sys5V$B9KHe7>ia%7r|AuDyKb)D
z-Xd5N2XpTom!{hB_Nhdn-xxxjJlnK8%c}b2rhaU6a&RBhnSEyzfY7*}2fuB9=~6Pc
z71(|cwIz(9h(N_>4TSD0c6W7<N?jBhA)G4Caq6pk3F7Qa9`$5z%9ogsb%L+E%+tTs
z@o9<c+<;vNUtOqoCxN4VGYPEK%j1QcH?{TmK5O`9{$Ml-mM`mJL@#63bH%@yYoA1}
zyq7k$>7}4@qb$2-X0Jn~cc4u7j3;5T<+`O)F&hWQ=y`!+4QMC$x`FXFxMtoDQ*eNI
z`6w+zeZL?AvFojQOd^$ZGs2hKiNVq5z=M=y1*l>)d7mNx$QYvbY_%SKI5H6_#zSA?
zPn}qG<(d^^LfcEjvN8SIa46%lq9NU}DOaqy2DvT`@6ufnPI%i2(iXb!Egh}GE0PcY
zI{TPOG7aIL#z31;pEllyS<sbeIT1H{2{R;f+{>%v&lK@6bLd?%R${_m9=fKx4Ouds
z&YVu__)NWn&6->rs*|&43-b&0>WG8L)rw|WtFhFdEoFBn?|NjwY{GWx>N7XYEl&%Y
zXPr5YTuHHr0LjISc~e7K<ti31Vbo}pFP^Di@1r?mAK1l0PVfL-#37^0;C4uspQ0>g
z>;|%=|Fx##>D@X*!D=kOaiQOO@CG?st!KA7Cfj2^L%0b!*O3F}T2jd3pvWj|9@T#n
zjtPe+5<_xhfoN|{#cx?dVqUic(R5cr5!-@<7bGBm-#2a1%D|c0*wgiw5(#z~2B>cl
zIBoaaT4kW{z8)Hp21hS9r5r;@I~EIfR@c9W+?c`EbXT+nT|7QsB~i4MleLx0$R~q=
zHkayhqbCTz+X~!zlDjaZqr<P;MThLsLq}EO`*4?A_?Za17)zzkdvr8m%-B02(io3t
z8;GW<*VQaMD7j=~{ZT<vD|x@Ts7g7wF-ft_`xCFYg{Dq&&=his-V%5HTAjhz*CL_&
zetmWs3Q@)4J}U8th=56}O>HTOBc1Dqh&uK9CzIw*!^6eaH|$0})7H#<iCzhB?0$nS
zPd66r*MUBVYlyWV2biblA3K^_1|qs`(?OeRI$uNq;8`a<<iCJF!#T_f?9JQtedcl9
z{Ayi;XjsJ)Xiq9zYE>;)F_vGkEOWcnQGy=i+5BXnT~<obN%5{`VjGG)*z^1%f)*kl
zt-B$2`H3-T@2yk4y;%@{yFyjFk^$F{ONq{Vg3n#ytSfQ`FR`pHbF|Xi#u{W?w7Tgh
zU0q&iTovV^e~@%Wo+78zHt1AfJC$;e857i(kf^1o&3eT6iARFd=<Ff(no1qZWGO)g
zVx@j-W~+73dvJ~Uk*!)08jy{Ja8uDdIZr}&M&O3mX4}Pjp*_XS_IM7e9p_2uo|e0*
zH|n6`Qtj`5a4Al}4B-d3sisSDjQ5?U)Zd90?$;kLt{S|c2nEhNe5}~C!TRw>eeM;C
z(B3%DJM`8t@f>?;72ypdyU>VZF)<*osyhZ$x1-w+x_<bkZz|Ps_=rPE)99lZ6$*^F
znD8iS-XG!F!*vI~z+8M6+&WFNBg^zr&{hI&iz7PK+f_Yc!rX(0J2{<7EsH&=H<sqO
zI_-0p&`(+prmB#mwuJEYd>k$_q9ig95gXQ}cB+?Ul(+HLAgnI^$*JD9nThDpN@P-_
zw?%L0qEv0)_>Rn23I>SmzbPar`dqF9>Idt(SgR1>LM@!nd#!P3^Vi!=VAV_NUlf|>
zu3zygGDi8AuE|2@FD!uTW{>k$J!#mqJG`|l4L;Vk`*7<<l(EQDEvS?eqR~w0X39f@
zR{fRr?K^Wo_uTw>97I1W^U%0Es<R&i4z6n;nS5qxN;9RaT@OQJN8t48At)_oXP{P+
zd1YaC8_v7IIW(R<!M*#DC+{n>`5oG3t{NQMzV~&#On><y4nAZ3tSeWZUvI6exsy;l
z`!*~0KD<+qhxVj~a8~x1k&(WblEH`ncEY5$zoJ@*is=@^?6pF_k^m>&`d#*04_zP<
zyA+&R)M|@W0Z>Wo)N9rERair2TfQX>RqL@py<$(XVgAG3*ZX67Um;-Yp@r%jt)=^8
zVAift^GPR#=^3ps59VErLlSI~izCtH(t_0$F}$NU^t-+FYl3sWhYI^tFQC$`JEDbt
zE7w?3Jl$mGOoKo6q!5P3iydERmCXoTgjZ+E=IIn0W_Z1NfL*CMxtCCkxJZJ2FqX{r
z;O8ReYh@s3b596d4*rzw$9b6EL%W+@$w3EVWB7C@Q(c4iEDpK{y)NyWA3ZdmDlx;t
zKe?jkt!9o;1MF0R49Bq&>)@`2?EXmu)lfMg0m>S;c9;QFyzE1vg@Vpwi9&8<l2~3L
zFR~cteFMkGPKEZK>xox*fR@10FNaRh<rGS{Z!j%)z*=cD)$qCIFzcWXCsQri`?NtD
zOPg>t4hlw-yoi}0tp)3Awy(9Q(O;F*%wwv`aT7YaZ%?hPcaqs&TO01ci^T|4iQ?LY
z;Op`_X{~+>4~LK61jT<@C6Ot44)|Pe;ziB<j5vHh7>-{7@($_Wfs=_G@}iB*U(+AF
zvN*@!w1@Y)-;rxW`zt7x(uS+Zg{X$Jc4FmrSV~$WhEAK_=SoChUDGyw7w%G|cSl1(
zf3HkLnSlYmM~HC!1&@c(M6;kxsbVf|VVUORg%c@G<MFBvPae_hs{_f`<%}beZ<9U$
z&~oH@eyWiavewX>@RdH*6CPBO60ssqC1(6$<;%+-!(>B2*OAU&$Qujay`hA4+4;fW
zOAI8R$Bj)$T_o=2sM3SLQdZ!r?h7dOUQk*1J;{780+Iv02bu2sYvbz&YlEUXi!CKW
zSU4DhzY@6qFcN=U;M8dV({xBIDUb|%)F2Z@?>euQ#;72&_2JT7!6xEM9l$mME<+c;
zId9!y*=A_1%IzN~4`CZgt{hb(RZ>%oX!eR(dGOD*qjWhSFNNJ>%!y<9cj=XjMtN+{
zUy;k`=3&e{CJ{V>ueY*MR1)9vy6n<`qJW)E-|UjPR;1ctNStW5c=OWvE-HJI646e*
zaIGsYNBmvZHNlSErD#a-1o!S*JzCfP2Q2)MziXNLl>fc%gaFqxRn$AOt!o<6{$AYJ
zc4{-%1TBYE+dxJIQ~0SgW0{@l5Bf5$7Vqx->LFH9X2);EHbZRM&&6$k!~TjWiaKe9
zNdwAnb*z5V`x$v7-g*Mi`zI(fE8EuN4rEP#&dLKrF`<l+&kiqDpS!2~8ut^Lr*Dbp
z>0Ucpfnpfxsc}`|qZ=Jvt?a9}f0P+{g9PDk-Ax?@t$!RrjC`B3Rek=sKKqz#@8@=k
zAwzIM(A;@PqDI=Fi*{T~{5cNg9z9oaP)un%-dKE-LD3ylUi-Br+ku>7$?;QgFzt?B
z<3wKEi)Bbz#C7W$#*!C(-}OLJC7P;9vxUK;&hu&aGni{b^2CJUbKhWxT<L3cCpn4n
zqEH&h$z5tc`2|KX@17Rfi9*SW!XD_MJKU(tvE?W%k7v5fNTTEorDeuMOOuphOgnT|
z@#!s}oIc~oL)RaP7+}j#S6AoATDX_qeINmWSaAA->iFax=Gy7(v~#v*!w5qM?LKoe
zrl3&Sh%4cNTC$)rq2aG)J5@5o(<of2m$Y?%@q0i0>gmpsnC$mP<Fa}sz~&PDvtkYM
zl^?EA;OgPKIaA}r>7*9;))yW>%Wz9zPq?WtV9BgHvmGt;ptm^!m36ht5hP+Afp{Ak
zH~r>i#C01(|FJLY$lXkcPe;>{o|I>d_>GE!BgUMDZ%2BH#`0qqY*X90O73CEP>OSA
z4<AMZ?IV`*TihN$iuh==UK_Y0;bC-%tIKUL^mzTTjFlzRals+1{JhPIKrv^8$iS51
z0e{)F2l2G_^~3B*`V+A?{0fS=JXlo6VO8&_x`ip~`WlJgvna@$Cs3EZAA-1Tmpb~s
z)rc+dkA<8_xc9-}T$x7Nc<A>bJFOReS5yz2*NT8QFq{;02s-j^ag7wy52`#ggRG@T
zetbE0^}ywgM7Om6(u$^87SpBzV<xe=39!L;K3JB9Ab@)w3luA=!!L2UDVy5gaGRzi
z5@QsqBMjQqeDs`S?90q_Xz(t5{D~Cfd&{_>%=2(e+V!2f89}Bcgev;FSmwu*I@Fg1
zx};`0%7opbjmQ$v53ge3gk6<&u^{m2+ECG8r-bVYB5^tC<9ht~S}&R@=c7&!AC*w^
z^SxJ`sxPAU+{J%1k?RUK>_XldNl0N>ly)F>nTG|^`(`|L$Bp6@x_v&zE>n?GUPa5#
zJr5DZ2b}cPYQ7zFO~I9<TkI+)Z<#h7BVj<MiSN@ZbP|m8RGjrC1SwgqgK4s675Am2
z7a(Nh{r#t4>ysdVncUX5MujMY608dO{&RxDE{~5sR#Bg;JJ};VpIW`?#YW5gme&`5
z0Lbgx)ZTCsfzW#Ek@qZil4oO1<6&f<HRGbtc;Ng!k^yi`_^u!H2QB9NMd_(GK-mXa
z(V8O~1=abKt2V^DXg0%{7$bWeWW}tF(mh;q<P!B}>D2I5m7*hq+U8c7TRp7V*84(Q
z@MPWlUg<H{ruV`oXYo7D(BZ_Yx3yc1RaL<H*>|<|8YNYiv_gCR@@jz|=iw9Qxu@N7
zZ83Ix`*ydM*$)>?3~_pO`J(WO8)iSIh^0$-Q??`KM+&>;7=0?ohh`OEW=?Z>ONdsK
z57ThXH$Cs&V^<HX%t_3gSoi(BA*{0WCF(-nl^qE%ms9cq|3^zN&=Mlq2=qmtEK3^2
zUYDS|_*j^8r>YwCJx+^rCrv0F$Eb}mm7o1q8?w{;IrA*6`tuOfLtPRe{5)PxpwF5o
zunIF)^_Qi;`Ylr0Q>n?foU_ChQ@BGE-g|eT_%W%1`2)fmIAxwT{w)3X@R!APCsv37
zo=*-X{q^p)i400m^Q)&w5nZu8XAbP0241@-2E~iuIvyO}Ol5t1n|L!#CFbrjICD0L
zj`ILF5kq|7Ob1jH(q1cdid5-H|H?H}JNc3+uKHCTwy;)F>CVy;3TeFOd6z^S2`~bn
z`uet;;P$@FRn8dxAp0mgIaC7IvLdYX0I6926gz~2#0>FVT~;C8*DGBg*}q))-cK>=
z0F}=LU(UO;K0N2aeHB%RzCg87^uFfp_c-(Qi^tDb_Q$?YU`mA)mY7*FbDT3)PL3qt
z_#Fh|R01d^06tSiuVEid)Pc~}$s@xe_RHf&U+ImT-*A!ie|b)IV*bth`8G7M3GTWg
zC<80hfI2UI>?`$RiXA)51+S&3JkGe2Py{7^@Pf&SYWW%kc6dfG4LCOnvNso#JjQ%(
z)jg@@Nw`?2txh<br`#8J^8B2(bP1m-N5|Xvo%fs%LC2HyLYJ^k-!#~Xv>)_^mg79%
zZ;ui9*~@p+j=@qjxFnW3xC$B3t?N$R_Uk{UoR4kVG$>_iiQj(wzQ7n_q@N^ZI|UL&
zb>CECVeGpJ#?f9{W^9cYhm}svGC?sj$|YR-F4LoZqRw&GI+WS{)-n{w^ODKoW7I3k
zK>aT@(t!J}N{GFQ)3)`Hc;;+^TKap*WBF_>eBWiGK7}Ddu><DlPvALlzLhi~4gbEV
za3Ll@hCn+>mtPHK5w#~BX<&70g8N13^S(}&3_f@;Hs36Ian0+aR9BJG{z+l#@~Pr>
z7Ab+Y*j`sxlW*UNZ1j1QD159NiHTR!QL(LacKQxv12}kPTsGD0<*8e4;&dw8GRID}
zOgdYCa&-%g;NgwH-g)0A2W<WEkqa)1en#cJ-37_Xj?lt!c@mhLA!a8$6N``X9BVcw
z<1@(0$^y)oGufwef<7+lv+?7%<08v9S_-W!M?p?j#D*$<mc9A|F~A8fe_&bWYvT56
zDxj*1(%gh_fPsz--<|7Wu4^J5WmmKkltH$rqfRe)n}BJ)({LD5BwOiuH?eI@6YJre
z)~Eek>TS&BS_8i+e<yS|wRRMk{$)6mTbyQ$b!hy$uCsw>iNfAgdT&?*gx<Hq-m4!-
zJm<H$&@#F%=kGO>g&7O*%OO2M#k&Z|a`i&KGSD7MLp}(j8zG0xz~1)TIB#qJ2ECdp
zI#WNUeD&9$Nt9n>(+$<$2|ll`s?8f&7^~fFxsV^_kGb~lsOgv}`%lUHd!D=KRTLNB
zArLl?@tG%8y{iAV9N2a5;=ZBB*rp|+?N3<asDT1j+Kew7p4)-l1g{B|JV1?w{YV_%
zJx(m=d}Ma>f~ntkk^<=M(^HT{(XHt9b7SNd7N$e-w<KGZjF)_JMMg+&`}=vsF|6G6
z<*0v+MKN>LFE$*Sv-p(zcS(j5Q7s}Llo9!LXNhr1l@J_^kGk#5dNa3$F|`Mv(B2%~
z=3a)q^*Xrv%<5y?SlcFQ;LIXJ1huM!q$A4>!$1^zq73YgMtMoE4isG|xm&xP+25-v
z^N@?!gxGa&Z@MiFlp|fVjYswJ(l%S*2|SLRA}QW-LyocE;#utvx85|eBBef>Mx`&N
zcYw#bwx^(#hN!5uS2Sz!#nzVR8%+vFTmfpZ^S8T*F?r{rzJ}DIZI6qzmBcnjmXdAn
zeL3&4SOlD@04l?6+Dnx43`v>YsHN_V*Tayho`V#wR&uD$beoGPOoGim=e)_GZ(8<_
z^c%Xcj_b%l(>pvMTQ$ZC&d86^GCTk<RnA6!-TX9aQqdJ7_Vz{+!IVirUh{c(ZJ#nd
zQu2s>y^;^BrB5>(^!Oy?Z(X#?^q7&9>&BlQml7-%?-iN@U#t^xo8mzG6m=Dw?amhG
z<|;u(#?^uJJpDqMM%OWm+sQBnBeyQ+{g!hK-QL>ud%L#g(biGPzN)89hy37{dI2|^
zgA}$lo*rsQg#pxVb<8?z>JmRvz0$D5d4dBt-4Q+|5Lu`p#{~gae^U<9`nnzCgik^;
z-Hu8LOs%7ir;2Zr>>!AblPO3P7n9@WtEPE(5KHrV+u7PJ@XEx4u@Ik-xcDf;BtvQ_
z^%}4(ZM+&9dq7NGm?9qjnl7P5*KhN*2gkPd<ONMIus}R^;So^CjJ+s5Y_2G98=q?X
z=Idtnu!B08HdzMEW}fal_h&a51W(Nvy8TNcccN4uU`kwTcGRDMLUD`|T(T3LVo>)L
zb52vY%>mgEkgYrMC?fjfH5W6qb>z#KFv){2FtT(|`rd?6N?Gp#g1qE%QvhR<isaWj
z(0)OS8e6?8hjGW6PLRY}jbjcx*GaWSb{p(gpu5)b+1uZ-V*nOpRY7;q!Mbi^coigj
zFfLKm%kBK?T7sF#<ooG!8T;R-RpyKvLn5u21RZj<o9J3TN9-?w3wf}!PMVsx(c;}U
z8An5OVs49#o^fJdq>uF?T*jSX>D2+09v4?Jvb<a0UK;PQE979io^^tFfpqeOW)!a>
zpL@t=&UW;#qv?c|e&Cbgvys~En@a7Uw9!B5-KfSr+mzZvgwEn766>ZY00t}Nyq>WN
z6Y;Jde^66!Rk63I0rF~U7uXB(dglm3<t&hvaz(7>yytm@fuR%Vb<LV(tjmdYw#JG<
zv-qod&6CbCH=b47k}ge<+uYFx{TFv9tX%50I34c$vl(cBu|D}mEKFDNVRNZ^T+1bA
zAspNmw04mbOuc*<y=A^NZfeS*_42kJJ{{EpV*9wFz5`}x!gd_wStPb?BJO9oXXEd=
zc6BBC8d?}lIbK`+p3ylZ$fZxT=V}7?o=^YD((;Xqh02~yKGa>G94BJTYfT?J9ldaO
z5W5BxgPOehoTTbB%G1UFvOh@gq=y)mCl`_hw@qJNIWnggli>7)5sR*9l)?#$O8Va0
z+BP(dtwb{^`CNLdM0Fr#`81DHjj!b8kFd9^FoHdZGS}*2C{SmWPQ0h3^GQuDG<z?H
zki05v=QiUD>l!tfe8LDnCl5Hg_;sM?J4uTYhi`HT6I+xPSf`HKSRA!He#EVuSoEr}
zYP5dOO0p2?_Uu=}5pV3Wpr!)F=Dfz|V)uEr!u8r1`JTEOL#X0+bF1Bw;^9oqd=6;d
zD!!y#9hxu3871=hW&DZi6iP$O(HdWA8L=^SJq;GcLv<vk=RQz>Qeyc7$|Sav_66<e
zU2}k}*U)t-%9@nfgc_aYz5&ko2N(}NBsn@Y?-BYUL2q|y7hmG_y*8o=NNI~_O>x;!
ztJc$Whi8$NDuK4$kh?rX;CA3>OKl%Hju=dZVT%j!TC29@Js24LmeQxO3(;U|x^b~@
zAj{g0nHx@1INcI&`2g5{%Se0D!CpNP;T`iy`}C61B%@R@u`;mPI)4uqBqI0rB9P8e
zk6iq#EiuDJpcY*F(9lmMtYt@f(QXMRpXvRneXlTjJMJQ+TUO@Mgy0Wp<V6&a(<~Tw
zAGQ>eYo!w!bj;}F?{>8LIDF^DPW0Vvs&NgjZhiPEqtvI-s_o7LR-P?sf=($tL9TAV
zDy={dAj%(fxA$l295eUQFZ2RMmeRMI93&T?f>e8pxq-w7!G`&kxBP*)!tuzet?BLc
zi_mLfcN=3Ypcz8QUa5$11<}j1(sE1UFL&jZUAi@miPj&kk#N85opiMBo2m>D76HW}
zv#wIP+N|>Xx7PWyajgTBILvJTsEMlSr>8S+lJ8dMyq+F4JyG+dZ8b<9wVT?*7h5M1
zHP+iC`T7_^rW;Da?Pt#@%ed)WF=%BGBjh-}`!d`uYEFl!HY{9_X-_XhXX5BmlkdR2
z28_rHlWhw=#me9y2nU&g*w(qcmD{F(U%RwNEz7Iu=t9hSsM5PYzOwvyR$<+uyLck2
zWDVj<+~tuL{Z<}g%I$h-TR6Fa)fmLOb~%`7VM{=_J!R?K%gVm)$NDq$GcdM<z^<d1
zorP7>vt2mA0e-f-d#5poFG3z778)Id?vXhcD5Aj$Scy>&6*XEQ_j>X$8C*8OZO)~F
zZ0pPG9lU#mS34S$V!-X$44)5aI>I*VDjIOyNyK+q5ydkgpPUZgoD4S-)YhoG{)p!E
zb5S~?sQqDzu9a7+OQE-LzEtglj}PPZsHeajt9KEO5{H$nB7|NY7V2HXU7Kzl>2>5{
z^kh;Nx>h0rsu{?bC0Lyq_l_}h0?q{#_|9@>f;Dq1%@UPy<Fp(>Alc+B&LUGrCxC-%
zkb7qP(TiDVM&RHm-5nOk02gEHa5e|SKHX5D$hMpy!c^gNyToai__wiOUmE>y%uzTI
zFn7|dSm)%v23d((OxO)$`gvyH@MiydZgAJL12L$#50FCX9!20yilagQ?2}W=#Bw*x
zvp!iYKIJVm9Vl@cD86<a|D#zym`+q@eTMRpA>GmE6*UfzmR4VGFOFHejB93}%|yr%
z>1-{7J#>N9i-%)vQ(=?V@fmcxid2xCuWKRRrtgNaxUrq5qXMoBX-?nG;w4sCZiwTu
znYGW>#C9N#NyBdrDjBRyr<;v?-xD9H<*b-y8P|kzc3*w|@MOxkVC&=wFHQ%GNx3U2
zvZ4Kf?9{$pH`LcY7?yn>Y#4$YXQWydyUw@@J*=Psipw7y4DG(v;-JFhH8V6cH~Dbt
zw_NY0UQW_p@KLw6>_Z4Wmc&-KwT^32E4f2W3~Cp@o`zOFlAWxG2-;%I2t3by`rUoO
zdS2N;a7Ae>{wp78QwcBP-PYMzY%+S`NU>FX?Qo5ftL?hxY?>>tbS4#BZ@RGWF*C_w
zFEH{9by@nWmKaO?xE4cr&x-0E`vKz0>28<=$D26O`C3rD;*`s-|8Y6jhW9oY|Bx@}
zL@b14MaXH*Jj+p@fyq6COs{mhW+elJDIlOs;VjOxnfOpOc)Y5Kug#Khje1u^bh-Ye
zpBA;YZi{fY^dr!4i@ecN&#;xV+t(!2QIijMHFj490OTsG<Kl(mH(AM_+U;nTpI$;+
z3i)q2J}dbqTe#G^d?ZcX`$)d4{#^|pJR`8~-O~4$@J^{>nG*4Ozj_?6%)q+D4bD0W
zHmKDU^Rmm`#m;z-+p0e2E8!)JgnF5dzS-oxy%z~(DG0K4u4-Qb7XOv9yM+==x-J^s
zwUs+a-nX)B9vjM9g-*+2`IWeM_Kx23eA=|-D;6+~@7cPVGmp$arxyoxHO=9gz{cv(
zFH=70+R+awEz8SnroFXYS<O0M-KEvLc&k|>#gIo^04be);B%*?lf4*{uv3Xt@Vi|R
zGojmobNeRRZj>7VY@Vq7oQ;(e5%kYKGL>8m+V}3gGiM$*JXIDR<2_VIf14SN2<7as
zZEu2o*Uoe~`0h%zz+b%;$lx{;39PQjk|%Sm_R1KCWCk5TN`1xSGw8p0wr%wcp2!Vd
zae{}N4#4ho((R<V9LY(UM_NDK_PweY&3LTW`Yprt-7p_EqN*elttPtfa)zXU`=m!#
zsjdK|ZvARjm%o>xG~b;oZ{xWQqgo-;R@^#GA3421tq0nNRSGbkE;)9vA$5jZweB|a
z)>KQWhDsNa_-nyuyH0JEAC0DZznOisF=9Wz1%+aH;8oaB!N{Y<z{$gfn<YsxHv7h{
zwMPq?YM^c<FeIsf;#uCx-9G5pq`Iz2JsR|U%Jmb^24szFrD5TV{3#?=X%y0KBE=AP
zT~V72x|Fhjg!Ik6+qtzy{Q5(8D5Y*YSp))R`RWPR!Qe}5s_x;zu9RN=?jmW?@?A~C
zq~26dm;F-)(u$3y&IPS^AeVIfjmgLD0S#slN5@KJbx&(+I3>xpf~PKUp6!XDuDO?~
zVd3!$cXzQf)gm1iDg$hX01t{Mnbmw9mxes}QiP@@lp)#2z4oCrOLZJ94GcPlT(|K1
zdYWg=032F1u?!n#OX7WgO{;fVma()ndNE?q+fa14FMH94+wI~aaIS5|MW#N)%(EjZ
z*QhHcwnsCErrtJG>nS<xV<qSo*rlX^cGh%Z%LLIwLu(!hKk!y?Phw-=@)V=L>)*Yo
zFuKrWn;FSDbFXiBjh8cd=SP}6(`c-^w(r#S{0n^vOOu||5mAmy&it)Xk1o{h4)$K1
zC>JsWikvh6OU1`}&x7e>isL>Wdan#bp@+FiGOV_x+)72ffRu7sG6%roT%}uUTj(L;
zwTDn&%{%$>zL;jpM+KMwwtI3``#>@$v7ePb2lbwx*=)aw<Thk(D@pC`Tek*1a}q#n
zr!MijQge*yhYi)kNyJoAa$%#_k;pp<%sJ!6Wo<hQK=pVqLBa|<cd2%Fn)8&pzIQh`
zd3?(HxcBf};-J`Zr{i3UZr;_+r`<QTbh&pW8x~V*>7T$4@JZ6IJWi0_rh1mixqzj{
zRv^A@5g&~;mc8(1TI`WtW(T+S5|tR7a5l>_ZKf;P6n?V|-vW<!o!o#g(GHS9J%a;0
z*JLvce#nHU1akDk*8H_xKrKS0A`lu=rcFW|YD3~Oe9$Y3Faa(o+?vve4_+JDY-o8g
z#i}#jCp`cZtO#i4BR${9JA7|s@06*qKt%3V&6RshG~BT+Z{|C8KM@~-P3>`K-@?@6
z4ayCyJQP9O`V6a`EQ^|_?3MR>F*=JGi*?vEGI;c39m`?_GUkTaovq~6(_<P71ihiM
zGp0}#iF(aoxQDRjIncaqM-Wlgc7ydqO+evD&sEAKK9wfUdiYq+^^Wk@1?i`uTBDlU
z8B=oZT%a1{wt`MVYjx#8(lAGYdPtg&%2y1J8=LMnZHBLX&1%jDuHpiyc~QYL=GyVN
z{RhyH`L_sU@sCcpMfiZ5rFjcX3Wv;pgDJo$=zcv-#9;&~-#f3Dah;gIC0{Gs>&=p0
zl!L^b4LyK}It_JO;PA(|vPf^zpis^s21fma^9rqLj2j!3*HPvd2K=z=pK)J&aPl=?
zrQk#@b=dsWhxeyC{Bzm^7pQt&NL@mcWzgnfttVmza-m{SOdDItdnG|tsEWORi*pNc
z_d~vEizrAh?Hbm@?lVtLZ@REgn41mVld$VB_agW~L_HP6QL%J|Ss{W;DP>{Q*g%fC
zgs+lz$G*2}`?K+-LU!~lsdv~suX|DH`}UT)?uP2eCD9W>_e}elCCby2WXd~bYhkP~
z`z1on(U8)r2D-&0veOp-L%Dd5MmDNt#GZ~H+OFhYJ(cyP@<LU*D?yeXXdE#z>v2R@
z$rHVpXvv;^h8z;;6)c12SV)-*{AZ<rC;XYOaK=y#`t?VlOO5AMFH;1<dp^cFnvY)P
zR9;<n?YyPUxSHLkiy#rtAYkaLSTEbUu@=&Bmsd=?g|D{IjS{pf`0z3l+}kYXUCSoN
z3X9#yb=?rsge>V0#Ko&!1XN%W?X^oehU3#T9MH`3)xA&Re&|_RvW4)Ls>loKTd3o*
z;4d>Zk$$&{pyC4)c~I-OAnEPzFPI93zWg}lH@4d!BP!bK(x3Jz?<ghaRP%dehN#tQ
zqJI!C#(*ZPF7ddv8=q6TPnrsK_w&29-GewOH`qhJYUxx(%M+ETSvO8=b`e3>m9K_r
z8MTo(rOdNwGk^}amOzxyz!^zr2(c6QCSu;ZbnlIOuo!9JO`19l!n;69*|qjkRc#Rd
zOMhx}J<f}a*3iT<o;d+UC3uIfPJC-L=F@ENt>hZs1F#hO*;WV(Q0ekHLs{@FeRd7u
zoeo)p@r6^bT(vbmP9}lWMWy*lotwT7QB+v>^p8Fr%}&fu!Yv_}C{IZe#p_wP1P*tS
z#}768u35~~Dxz|hv*xZqHHnG}W#C@X!lX)A9S1D1+iU)a6?-yf$g5+7aW-(PVY2cA
z<NtUgiCLTjO{3xp4MSYOppI^-qJs(AW5l>-*)dA9b=|*A4a(7<iK91ln+=AE6VmSM
z&EwXDd1Z3y6UI`@!Chy8N1eMB_s<G<$t7n~43<(SJ!`p;Oub$B?lRnUpkCPp)-hjo
zy6m&oFJl4f+02mwrNg*sQ&P~vEUMm_OkJCANF<m0he*ZM$*Ei~-BW$GBrY_3pPYo1
zd^Cf9+>>SKd(&Nga;Fvm4>0aqr(U77K1KT>Ds@|=C@O|~VscCnSejp*Yv6TA%!WSg
zr@%7D7d#sXPUu&IbQr^KqDXqZqVrL+D{2>^V+q%h0@ZHhWzJLa?Ttx%nc0eD$*SIb
zJskY>$B0+_q`?EO?ewoI=Uk-73Vpej-V{+jSfT*;YTlL;kt3VCLo~p%$gD)fshpAN
z0tJ7Gzux-Iv8`<^;$f@58}^XN#@h8vQJyX4yeMG+67w62sX1}+7=8^?yIM`Nj`m`>
zDkO3jdXmN~UK|xo)RWS;A1=|tMs<S8NbqozE7ArfxTp5)3|3VckkcM^z-9yd*6tRs
zm!-35D>=F0idknjA%*&i9!T6PAz4m&c~LGE5BZD7H)Ia83C)Y;4b7rjQZ^P-XPz3F
zPP)kq^wARb&dp2~m#E=@d?`ozj~2Q_oMO2qFyfqZ85W<TTaTmr<xms22V+<R#n|}e
zlNjrvXT}MKh4R{}bz?ZF;ba-KdcbK`Xl4it&eEYjD!MJh*9uu9+F~b354p4=Ik^7a
zJHZD96qdajbXLIl*`*X<x4WZ)KHYc0_tY=T-iQS?oy73h9o&|L3N3=4rh_`Dd%>|V
zGQ&=ceV*=TYI@`&bYg^-l_5Q}pq4HHV~c`H^X2<7^fcNgV6`LVlSm>KJ2YGp^@?&9
zL;8(5eZ{}^P+GFBc?L^3EMZ@imbPBnr@i`J%>VInlGaq#mqs%Pq2#O)_pCmTw`+W|
z+v#z<CqaCi*03Ga4gJw<HFoFVLI|j*A8;&~Y^|uJ+;V4LV6D@`cfw=k_?zl0YBty4
zrEvCu>UPhfrMC#W;h=q7o_TTa73MbI81I;A@8}S%>xG<=Wxi*5EMD^gc`PjS$G)A)
zxPLY@Q0pM}F$ri(q8c$w=}&)8IBU_0#q!`dSHu_Z7ZwV9d&{-Q><#@W5Xb`Ewa6#+
z&ZtHrHFY>kgTMcX%IRd0kN}eZimN^ZeX$rROXJt9-nt-TA>7PcR*}E5nD6q%kx=*E
z;<mleGIUDkwcANP=jXScMHYmduy>JEX<tKp+_xe7FG`=VLJR$PPs7B)BS@=wd4-Va
zlEsWKGjW|T1k?a6z+A8GJk<AqP3B?%O53_rM|Ww_#4!}-jDi7y{VlzOnt(&)3!o$n
z&s@p9>YfMMf?Sg3$l~?AyKi^2A}5O8!`R{#)h#`}ZC0vhcbDmbY<mU{H-T~rV;XPg
zDGwa&$T^c^L;LTIH&9+sxv<K_c}!Zg_tojd2goj4CNup3<lAvYV$13pIPr$zc4wyQ
zSL28qSY7_k^xh)Etgooua>|a<g3K(_%lCI5eqC=la->>F+MDi0d8mhf{1`oI%+-}5
zKK9M4DOJ1_I{AFsSsZzF;3c<<myNi>;yLB-AMb3xiE)aB4%-YDJ%CFG?IeAqZEupa
zHtl0L3@W9Wyx!_pBuDsoQ)MxBmOepP;@y+Bc$9;-t1SraFco1bAGVSrtk}#l?Thy8
z?H%3q&H1#!c9u?%z?5e1W9(NoU};5pIprCNT@vK$wfEUJaODz<lgu!yR$r$5rx4E6
zbL%h$ONA0H3$(jof+YMCVFa#)<p?1>8F2x##8WCM`ee;fJ2U1=sIOTNTTDwh66yr~
zAXhOvc&GN@Q1*EUbL^*A@6L^VJ5(=e(CDiJ?@#)xz-<dwB!{mp!paO{bP2>hSs3mn
zpF7YNjVMgj5$@U88e@(av~TVMo1>unCt4(}%a1GTdIsC?ry5nRs|6(-K^@98cvgF;
z?-%DRi&9la>n)m>GaiJoQ7yQrmKC2c&VZ3?Vv)w@#@^!2$&2c?PsEuzcaWpw%2$km
zs9h86Dyrc&;tJF{md`X`_&&Xzs?2039fE1`Sa)yIv%TGPVsXczaBOJU4CQgYsL-yk
zUZ!|KQLg+*au<yAO6HRii@|{-_INAgB@DQa%j@k17}C89xGP36UFQuJdudP8cuR^l
zBNCYC%!ioU#T@F*BpE&kw5gD<^$Q~_2b4dp>Kf1s-eo2<f9E<T;aV9{@Hx+0u~geb
z_{ZatgZ1eFzFt2C?<2~Ti{xfwAB}AZMrpFVK27$>9pyF^q(Eifc)+jub6**`<ln=8
zE@aD9;NA_QFO6aZk&oT;Am2$FTb}YCWhW)w2{r{PJ_no9v|FT_(@;Gm`fftn{KTZ2
zTw`T~;1$h<S0hhm&OO*Q=Gwt9e!X;yWUsxvQQPc_2#ejrk&bT8ChgZnL^Uj{;U%0B
zTq<hH9-BhL*<1k&(b-;0!eY-jhAq}|61hI>y+zyt%cH}g*L8D@nNy&`y5Q2?M>XcG
zc(N4X0o>_?x3{O01S?7|9@*h%5~o7#OBHy7Jysde7He-1>|kZ|*}u@2idfjEXv8~j
zDd{mSTNJLo7k1md3dVM`LBE^Na)2M81E3dml}ZyVxX%Q#{1mw6_P9Eb5-%I@{ke(#
zwGJKa8n2#k-mGktQ;@YWTVqA1fWT%&MKZV0!62Y=V<_TdO-0L?o{dtGy}G^r(0D=#
zl`}rG*bBiQSerq7QTxj_W@KdN;8xMEZawI@`dX+_3S9T;@wL}aA3VA~acfyMh2bh5
z9{vMTN;kGG$JNGL5AW;hz88tk#)Oh681bDCjHQX}FtH$D6{5*+3?<v`mL`_@OvWM_
zI&srEu;ag7yvGtK7BGzC5#jNX)({VDoZ38v-kiZNb#pmI&k?YS(o{EgkSRFuIS0nl
zM^2dh;TA>pgE@j&de;$;<qrqhdKFZ^{ru43_h0<HaCCU#3$znUzg^X+d?tq!pN~|c
zpybujDX49A{@hfp`YCz<^KV1|QW=z-@>|*d=4F=3)>Bame-buFASGJ$VLXehfe#PA
zG5N{Sp`*6myC>D>xG2lw90zy#OXAM`+t&eP{iU<s$I(lkepeT@kNTIMTv{RE{qFws
z0v>4#AE|aXlkTE1Cmyqjp)`6>@^3rqSO3M*|G9_GI_Ix<2Bv|bE2fv!Snnsmqj_aI
zqR!fL8WR<xEd3tZt%1U93;*kI{F2ahp5z(m=HGQ0s3-6*T?V5!&{$8p00{Aa{}HPZ
z>SsQzrgFc+jvQB=3sV;z5f%?dDNLFSk^TCxdK7y{zU`X2D2-bnrL6qz>$F<$bmeKa
z-`U91>b&!mrv<$Wlc&{vmn=`K_by+aR{veKJgvbH>wL65-h}`fqKfiQ-fx!b`Ilaq
zTzXNF{E@%<c20yq&F$t0fx6qX5d!tM@goHqZ?i@UG~bqs6llF|9x2eC*UooelY(Ow
z@4J3dmdi{ktj94`(@l=BS+w5HVYo=EQhQR*t-U}(dlJ5Uk`bI(E>UsrCV~IWk++tC
z{wMU_9vh9<UW{5i>gtnJHcUYZxnYJ3H9eFKlaT^$mdl+(h<vanCfDKVWD>IRTQQqQ
zqOeDzyhoyxY>5t0>N>fj%Cd;z%_&Jchvmz`8OoFVZtX)s`6QauOg1=;^T2FVR~vep
z>1XcNPo;3*!Nt3T|7WZ5XRTK8IxLS3Mdj0Lism{fPo^M+-K>{;hZuUt#*6C^VW8B|
zfBE<-deP_8tJ7;x<+&o|x%T};WQdRiJ09LEQwsL*1B?i<1k0-!UR4K7va*Fp?C3))
z%Kv!LZD(dhDVUlx+S1K#CBk18maP2eTX44zlg#Jv`0$$f)Ugf6^fj*oiD>9a@_N?X
z{!7z8#Z!~mCp`bX{orJ)KeRv6$oIak*Uro@_2q|2{wuHU1A2@X^s4KXpE>rG)x{4=
zm959UJ?sLhOYmRsLgxK$SG+8&8@SzJ$MS~@>F)P>gv0;oW!7=xA12Qc<KY1YNGILT
zy7EQnt2;zF0+rK$>?6}H+MGTRMC32c|5M;!yXRMrd5^TjI<yPnHQXm{F)`d@EzG!2
zjo;y(8jqbQ5KQgx{m<j@hq3zA<iCuIHD!#DMD96YuxS)H=T+^lvD4m1`6Nsf0|Nfk
z9shjZzrXnV;g%M0`Y>8e_KFYhLSw?4{qkecV4H@U%I8wkcv9sZ&L$IQD$R8DALbNi
z>K?rI4?q9wjIf|IXH8AoH{Dkj1E!cq7jIWinw{Cgr+MrO<KSu<kqHgaD;oAi=~Njw
zjV$~5l62&8X2=<Oa(R9OqYZ$-_<T+PfyK&(sYre|^W`=GG2^)osYv_f=zNLX=&6>n
zCFKc8F2}CNli8w9Tcv43++LKTr`hXlJu0?%!TvXioX0pt{LJ9z8^WLA9q7Q4l^m7_
zhd$;jX(r|tKmCbxdjN=t-+*|A^l{Nx8D~vg64G)xAz%MDVHNo~jw}JFu(-<k(yNO7
zqE4HDq>B(rj?<yK599n-@c2pbAE>CW-a85lYU<;~a~q#rI<2*LST+N`mPFxb5x4On
zdrh4`i<HP+PeT6oQfF#lJp~C~hAOv=J^bUxoIZe((K8&9Uf@^9ogkv#U6#LpZLVvL
zy)?DMfu$yF_5XU2G}*GsZY9cJ6E>>c?O^6{Hnna8iZS43-ktugeGe+a$5mJRyRCh9
zL`DCn*|k*m3#aLJW|J=efTx*?2%K>f?&dX_q}-jOY&W?21`m&h$SkQK!_P*JJcQ+a
z`K{?Rqs0F>k^XgR{prpxrPa&MXyg9kJRZ>nKD*mlA&0yR1T0psP7b;pGv-|l|MX9P
z0NsDrl#!z?z~lF@qvcT3n{r5oR6JlPD4^fdR(Fh(1+9G<bMY>ow+!_C_M3<S!J%Ud
zN|!5@!~aqL{`nDhe|0qIP#HSf;w$pwtrejx9^Os7mU3x7_%$Q}U%+wI<U@DLQDqC!
z*#Gwnb5Z`qRM6mRKfx;syZ{rW%=Z<iZTDvwALYJsDRl5%c=qS6axD!z^ceWeZnU7C
z{(l*#E2AxY9qecy9nr^?aV&Udz~1EdJ}nEXT>d2pG85lp&F{uj3B2>=%C)szOr76F
ze{7ad{ANCLd7l2X#(z-&B7k{i(DXRN=$S4+4;AI>YvLfORUbz4ui!CL;58=YK|q_T
zq;p{|3=LK8TZz10l)St@RRhrYPu0Ln-Zk!gredBNCIR-|2G9j(D&{9JQ;{NW_RAH&
zDVTp~o1Yl%17wVUzVhlOg?!^XuC$&bN*9g(%U>sv_cmq}eR-<crX;yI+(IhCdK_Qs
zS9$8HEMK;#O#L*U8-1c|$Cx0RMW(4Z-m+j>{Zs7#>g^}Num+UcnZ$q4fOUR1ri!pc
zA&FaOHl2pO;G`~{F;X7j^;Rkv%m2Zm|9M9J-F%0n-Wyy^BEX}-Gf84^VmzX6K6mb}
z$u#O@&i(%|w!n;ViskL>VHY25sqI+%vsLzjhbecSQTpcl6ytZ$o~HxZBKO5FznJuR
zy&adT{1ZzLJt$LS=F5@Y?AbM8Juu*kaeuhlGhuxB%xEo*{QUOc%$oE+0K!MwlDB*E
z+<fWc%?qQ|lP#mlY5(uw_#InclqCTsj}I{U`;l7FGG)EIZi27uMxlq@XXNL1>-<+H
z^7j@Oc#jqKQU`#tK!0Jp!!8?48RL3p(Fx3MDiml$%aoeEqy;!OdUElM=lsq#{;EOH
z$`+G<BrRvZA7DN1`x^?7ovQ2u3^t%|2?E{}$(*(!Ke3)yYiM8lgX;hPqe}*=!vG&~
z=*-!n`0(t`XT*XkH0uQ&-eGDcBz0Wm$~e2(_(QwYP<u+aJxjUrwj6)}^L<4z02!6@
zXSlaBN?_{x2iZO|!QeA4{2RO#Q7ym>$z2zAOB`=eMKYw}k-k>D2DKRwb~ue{bve(>
zcd>T->-;RI=uZHh{jbL=nxV$6TzM|r-s~sZ$Jp7)ySkh;Dp3_-d$Epys3atxo9S=n
zfB$LPk($bQ%N(E%emBcqLsFGtsX`KW&fg3+z1eX`8a<<Gr_4Nzw}AN=W8^Z9?5p_w
z>CW5)#p#EP2kate`b5KHDRrdwOaq|8dcOQqz3}~1FCYJ`UX1F)GKBy)geLeLjr+S-
zEkM9)y{7}e+-8=y-hC3WQfw&dJ~`rMjwv#%be|mipP2R^kj_xEKH?Um>;sSzvY*Ud
zt!Gbj{Pt6VH?Yj%`iXzTlK(o(wo_m3!zZ+@f9V|c3Z&hyXPFjpdR%5siI;^J?l1AZ
z>!fg$)8{q)O+%#jJfKJZ;!jA7w(PK0uKYW2WXCB_$T-*Z{@o0QDNBABeLxJn2tL1h
z4&j!g9i763ZIA7^`f4rfzq%~NkVz?#%Ku4q{PS5(?7ziYwLiprg-6kB0QmunOqQr1
zTAE;1b@*%Rml@puiF>PG{qo<*!!|rj3CTcl4tNEkIISbj)L`Qa?{BuViT)eUYxTGL
z|3<eQ{;T_A_YH79*zwK-q$EUxum02w9T55g-zRasgY}Go{Gvx^ZXTRB^`7tCr+Mmm
zE6TFzpCk3(U*V@+aTIZib7&XAYr0QyL0{I3{>(?ve|5*CtV;pM_IFfg)bW>>RvHG0
zRZjEKJyBB;aoU6*RY-PzW>-ORR}M!NIoP?G7wT6aEzdq=0HtmVQvh7fYZt)Ic901_
z^DCr8<L4b7CP+ax&(PcSXYy|Ole`1ySDq9Gz~6EPetS<nm1Qb>%D9mE4-Nw&{J>lW
z$am%Z7n?JRkseZ<S#qR0sgwdJFN#35YunE*ai2t8Cr)KJ$2-F}vsurS`I`#@1Oe)c
zS26MV61ywW#{g3=&aXLR>AxB60g>2<im=aL00r|rHOWW+A0h!O|I>+iIw|4?RQ6U(
zVW2xl+Kfkf<H=&nq#t}Rpp@zUYO-|oFOS3gr!(`D{ucw3rt-IdK>LtXZtv8?UG`GZ
z*t)P)WeZ0ZZ_3fsj=$bIu0P`p?B@YPLPO9w6H|2U<SyP+?e~oFUx59ChWIPi|1hin
z#r;e$Of<y(^gIDdLJ&Y>Rj@ccHd2;Fbepqle$;LBe-!Z7N%$8zfFXZWhR=*=a+ApH
znfJ+atvwq&**Bb({}=D(mp9{1S(f@o2WNHb%qw^VIR6*;yS4i2%iz{>SJbo<y8gmj
z{te*%>B;>2egc^KqcU?A;Q511OKzNWJeh%=|JsvUTy6LV1^U0B>@WTDdsyaptcA7b
zGBH32Z-$N{agKH$TyLMxz6sdz|Fi#R_Sen<ygzr!!>Ka?DuB0)7hLp=i0sEn#Et^d
zFy6`jr<#esQOmzz{g2N1<DCxnT{!@9r9S$M^A?nG^$AP>)Y(tHClyoD>CRD{KSvQ6
zHby9N+HyZlYWQ3vSk%}7!1T|s**_frv(VemAlYw@|8Jc9r>h+OJ7^f{!i=`rjf@iF
zkn)b-=556C^?@Hx3fJFSameGn2ErIpv4LNwX&#M?QSsHE^i<Yzi~iIdL4RW4ze0Rx
z5rv9BBQi&HAY!Ve>kQvZ%C%=P2EW3Z52H#z9GUdtgQsf?U74VQ^Cc`~ucSQZx(*kI
z*ioL9)%g)WzreZ0$;blbT51<f9Yolo*%S~92+pU^bx1<mEa&E@?yeMwI62`g>m5d6
zzsDH<==A@L0epB)2?Y3V0}SyMO|H%M5jZuFKlIF<1+3HmGM)bXH+6R3e12#7zk*98
zVSpC=@^c-5HGWpLXb^wN3~#h_-x<mCcVqicyZK)(eg&D10qb;TU;$^K<u)Ytc*B~C
z0B(KZE3!yMbPFM-^{<})fH`2a-f1NQ2L3NE@F(}vPs9l&?cTQVY%)a|I?|$uWVi;H
z*at)|tp^@x&3;wD#x?^s?q9Xt|9Iygp~0V+Tm`tgkOURrmigZdcEhS_zrK8q=>Kc)
z%EM|}zyEHKE~N-{g(BDNRz$ApWS+{DdH7Z`Wr}OMhB{?vaFMPlg^ZDFXh7t08dNT!
z5*j4KjZidcJi~9j@7`yhvEg*~`Q!IIJ^OidI<oEF^A4Z&S)cV;Bi+|36NP8uARdUA
zan|cGS~G1sdgSD87XN(DHR|d3n_AA0A8CdcU&@R7QbX=ti|o7hY6Gc1cLQgRZ&mh#
zUvdt(5GW3hSh<w{;8g6E!Ni-0lfQp*{_U#xr|mvyeQ-@ZyP^1kr{@B!eE(&itcVA|
z=k^+#WzF?nWVFzdcy0G-wCmzl_k53;=fNU9byN?1>3lRQkBq{lVDfQ^n3$r*SCL2W
zCjhpY**_6objHR8J{Xq4H_o1UI<D=yqUEL!@BR1nhTTH8{~_;t<Voy`u|FKm!(i>-
zu(MqY3!FTdr9*$jE}}CX!hv}IA!`iG?}XOa<}Cl>o>uUmmW`42PDk5<r4Lz_9X&^0
z1`aW8nAd&Zc4c-2!}^&#p13H*I=u82W&?+sLyUpa2x7DXd2b=f7iF8%f73<R_uEf@
zD6?A#G~<?_=%jQvHv@BgL;>uvotcW5c29J~K2q$6lKY{cPbdG>MuZO_sL|@p+RchM
zI#Nrms66N?EGQth#&CRD&!kD8`l$qJ9j$^i%N97Hgmde!%P&gCm+QFyMr8hTvLu)a
z_~qTMHLv@i25d5CZ+>|SEP6i7tt54Vu+V>SiO)^lo6?2oqP?DCFqH{ofk+eBbtKbv
z@izM=ciH&Rn-$SNzbo;^{dpA&1r&*}f(BVCv6-NqZ2L19BVR=9_&9wztjAt_CS|Bv
z(MP*M30F6zUfxhX@AZ7?9giAfF>0_5P9#6R`+<!pu+*|K9XxYyQH}XgTgQ3PYWXWt
zeC=`IN8x?EqsjX~;34(yh1IdCY;%d<9N`;OnHvqe;b1lRMNBhhyj|^(&URk^lV>l-
zk$z)?_Y}YEzIaVn(I4sE-*{&|c)zsrmlN<MsmOBJZu_9Q|L9tOJ+LF^{nFd><}6!u
zeACjGN9Mg+wkQaCjqZ2L$#}JY-j*lPtTpd(eh@?h+E2SZp8X%s@Xv#4X|IXgMdLl#
zcS5(@QVSR1@&mVgTS3G>6|H(hSnlq9T?hC6JlE;B&_9>bj6cpCtO&|Ky=F12J(B)M
zXu~c0!Q{Y`25S0%)BpSLdq@6*Hrm#aMEaT@5A9$hAgM-R9#MubH7MgWkd<i3!=835
z@BFU_9>7*0T>BDPi$OSR!P{m47~P5>c0<%ZGa*sn*Cpjr$7yqpu}4Tm`>S5z0KT@V
zHhuG=+IYI*KvBLP**XSg>!uZ-<NB}B-`0*WOZny59qE8vE_;<_cVdNg@u%~G)Qivm
ztqt@=NBY7ie@jhY+tKuv!6RRu^|>>7d;U{PThyEV>}vEOJMJH^-7-<qON0PwA+l=w
z74eyWZ&2~Uwao_-F@*MmG5t=kT_VG-s8<%BeK!;xdNTKx`wNL}Ed|!8XY#s<y^-8~
z+YJ<z8=$CM$GKhU@|T~Jrl>n=4iWrLQ*UzrBRLE3zHfmzuSf5~XCr+9m82kWrG02q
z<(xq+gJ%&fI*fqi2p*GiyX5;qnosios%3FX4O!}o?wxyWSq;hw51V!U+yx0~7yfkq
ztabX_(AYU>FOeTj(6N}D--P_wBXY*{2&xp^&0k_*y?zy@h0*7+thqJB{zUxjQPDde
zf{TWk=`b7js;cGnq?^YKN*#+s{%{=fyD#9+Kor2zJ3^jo|DvdZ=%ugRZu#0}p-36g
ze7>&<@Gxm+Xb{zGSd>@QP63skCj$dIBS@kGij%uxS5U>Dd+O+8lW<>cbSw|D90`nL
zQc1*XoHgjQ#=rnL$F*PXuX+E=lU4@^?U97fk8V3t*v|9go?P(Y<wbEy$fH|G+2Q5h
zNtk~mS8{4l0E#$(^dqAJI=vvwUBDLe-Sz!n%e=LST>yl<C%uEd)GPaZS?h6oL)A08
z9A`4CcpL{DkjoUNGf+MgVjT24Mb;hgV-6tLy7;fP2v{SE`rfgU9!IB5X!h3Hb%@~6
z8pXo$bGZ+!tL<LzIQsmHqzoWqmt99PVW+h-AauLn<+zrKT}@k*d{E@LmB=(oho1#F
z^3=qk?ev_QbNkP<w9zh!RVcE}L@7+^8{@a`zJ|DV^$erkXDt3`SFHZSg*P*Q(ZVrj
z)YvT&_Y8O2_2=5Qt(OHQ4Qtc??r-tOH(jywx%pH0pe`@FKgilWH%Nb#!QwTeL~m}4
zviqmAGv}Xdx3uW3M%xUz!+1#-pLbgwe0%v1`w54h`qh*qus_V3ek3*H@#9V-2Hq7|
zXsm9Pp&m9h=BP(I$38JHJ=XXbPw2b&XzQE%ZZ944tJ&tCQy>4zt@fXf2}o^Xz)u;R
zz}6i{5ZNY0dM(4u;=0C-%J~KU6u)}M^^TiV+7td1UESl*HBQfVw;g>gYQ6cHSwgFo
zFt+-{W%Vx(nSJ~Irp8;OJ@dfWxnt&D`tQ#$AL`m0Hpy$&Zgd^ld|vx+d<AKXF5`Q>
z$7G<(H_X7PN8FU%IeuZ|v#|WkLMPIyvf6rcvmSmP;b#xtdzQAO@19O+7QG54I8Btg
zTHg-5-R91L<W0M;nQiJ6{`KLa@kK-ade!>gf%&7~TzsihX;-<w@=2v`mEf@8uVqP^
z1jO0#7I%!<t7}>~svk5z_Rp&74!^NAdHZj6tL`w5y_@G>KK`}IR<<VJzjFM4Cdb)H
zalg3j&tUy7(B_*}`Q@`B1lj^Ko?j(r)sYkT$2BvZL`>K4>1s1mt@;V!Hxo%`09knb
zJKma~3_YMUO@moWU!`{#Y12(@|Dyhv2F7_z(CFIAXPBwF=LF5JZG3D^M|mFLu`dn$
z-BVku>(4$bOd~wCn|JNx^M`4P=e3hhE)DFu^PzUvZa#-i7w_bseCxjwX+n_bWZ<jB
z;EeOrEj-+LCpaP3{oC%l<e2nmTy+PRSUGCFYfEpuOr0@dvXqJq3BpqPX2CxfD#Lt@
zhouz;XalP747k`_kQFmpbK}>eH4e`~ITtY^MqRD1X8x*|+H<=(9`RVJ{_>}}J#EN)
z?$7Iq#9~s)Hc*$n%<56yK}@knhShO|PHB243&A7()_T0WNy6vaxcbJqm$LVGs2ja`
z(~MQ}6l}v6_=Jl8zne$&+G48-!iJGL_G^uUSe8>Qv}3lsa&iA0cnb^WI@Qd%cvV_r
zh&62m^E<|V(LOw0uA(inZF7-4FMrFf@sAM60rTm@jeV?Jopw1Ayy|%^u6(8*GG%VX
z9w`OfY@>(=2M2mt^dI98nS5}QS6{0o7rIQ=rHB4%yQ}%4UlG)j_<w-SSfkyh56@Q5
z`6;<$$-GAu+WY34k&?T_a+h@Rk)?+x>3?qW|Ke5RLD65NM8}%twOT_!)=2y5%zGp6
z3Ko0j-BC+Uo>KjIpc^Gc+;(-;BnRsMllWZnBmcWP(6!gL$?_DNVM*$b(QLrO%rWkm
z_ALYCg_=7vro1Z;-hXsRXOC|~C%=9*P;5jqtzEO^{xZ(jKe&j7<v*=?=VH1xo82qS
zR&8^O6{}|V4x8zDv&A*zzAjr<U^P}juPrr#$aiU<JuC)z?zkeF9H+zWbymtMEPY;|
zcGl}F8WwR;>8o$<ur%?cUU4@TD&U2q^|{~88uRx5Yo9|bTh^Sv%}z8#+phK-EBa1M
z9Gf3`@c5DBo=fGbHp7x4wvq!@@LkLMhA_0gyp^A>ZfZZ3_=gt~8@x*H(@Se_^E12j
zyeTbL#S1;7rZ4#yuXK+J{|m1#_Wa~grjy~n*!sN4VO4eDtONZv*seXe=fKsC`$C<o
z0}~Eh-Mspav&7Qw@O35H5X62vN&~#D{rZb|GfBzQ0veD6!=v+xyl1O($~0qwtliSf
z<bKNZ+!cFKmnIk%Y|h%E36Z-%u?#`uwJ#1?ZFO38J<Z|wf7S5+fnIy^UX<O5^<UQf
z7sL<5FMPqd(aWgg7#lWk>6Opo`;EL&kR2C!@4zMk9Qg_$0FAWoL|1Pa)I9hXZ5uUK
z;2YCzyYh9<TKhEMh0(p(eBE)b7Tb2E8t;4KSf+K(TJ+W;R~RAZ4lqKHMTiT|G_pOS
zW9l$MZ{R(7^Fw^%i+u|6hK7<6^VY7zGBSeL6*jlbwOre<rAK_>OQy#Ewd46rOEp;3
zyDa9Vb0Q{Yv{u`(W9!Oo^475QDxfv#wad!Ga&-@g^p9Ns{joFuB}(#27d#i=ZtD2;
z>-npc_gavsBM*sl?f4H99WO5-s!FOt8Ja&UHo*J=`V|q#sgH_#%+@rY)gJ^UI~4u^
zY7^dvIaq^E5R&Cckg@28>*^L-&0D89uoe9b=nq5sMOMz+36Z0_;w2pYB{xH79~Wtp
z-UR+n-jO5yujMT&$)9O&4cesF+BQanW5%T2MOy_4aYWnKF2t5^Wz!q+Dev3=_U#kz
zyt{eNOX5qOmpm@XE=ejedDRc=pFllt6msi>-<mX{z|vy}zvN$MEY(DEP0_XTi|n=R
zi|mC%w|-t!D#cRY?8tvr1N!Wlq_r+6YS-)Z1hMNyy6p8NUG_Q|I@Eqk$T!=ZS3BWT
zJ);(5qaPo3eCMyw7od6GFCAiRlUa9!KXN=eP|kHcTIw3I-5}h$wd5cE-|dFs0U<OU
z147&?=Xf<6)vO@<6???dhGviJ$fxA2UOX{!G?2DN+M|wNW8XQRIY-k}?NGLI@<lRn
z0y0RRT}KyTwZ)-$lZCywv(Uk~r5;A2PIg5^nheEh*Zl+mS<%Aup?{PI>+Bh`)FV22
zN9oe4TRZx)lpLYdNR)enLpR1oyL2~u{mqmbZAa(FfeeiMal5jczI4ubYjnl;HCI-n
zoUsWr8LMU1;depT0DLJ@ofym-A$SxP(^@SjI&Z+U5~r#gJLcW**ZARihQvj9)_6Ic
z{gRvgE_Isb;Uh~GQYhB(8J8icJ1Dk6P-Zc`vSN12dw#^ATdNgL)=MTQsa3#6`bv;E
zgIHo(uj=JNC;!-@HX-JHmfZ^LGda6A8z}kW4W99E`*_pjw)~rR@g3lhJuY87Me~pi
ze9;+=3&_k-ylVgBdSRJkU-d_i`fre{%xd60>C|9y_i8-sBtV!|88t|Em1a@#(tjDr
za8*P7#WIMs0sQTrd6K>AWDwVjXlrp>X%#3*bfw;f#dH7;R!5`Vp>dp>E_2PG&StbS
z+YCK<QXh8*Tyq0*{5y>Xy;v$p-Rsc1lyGvwf?T1HPHY$z&dVa1DF#l2qyEPhg0v8)
zP-4V=J~Puj*lwQ{S%GBqUvK_}LI+5@d%RPG9;{2v{v8bs<Sjis^*??o{(hyyw$?F;
zNAdP9E^1SFNbuy{mIZUhTNCDtPW+M=oXAqWaR6qz*RE4kXv&{;H6Y<6VWE9!4}1CZ
zu$hF3L$1QrI`T;Rv#+|3gM$M$0UQ0letdG6SFv#n(PHrHT3Ar}xNPW)R9p`N!ep2+
z%UTK^ku&BLGczU%%@`1q0sdO{H~+{<wgqf5CCuz#$=&B;c{>ndTB8E4CUL@7=8q+e
z7r3KG7ai=4$+h71%3JfEiqN!2ML*?)KecloO|<yqb)#x<WGi=8yhghio{@1I-{odl
zU1=SYbZibY+l(Wck5JF6VWYFqSI-l&!|msHi#CoqdA9~1tWUbH95g-BH_$G9_1R?x
z1A{JQj-lT=yn1oRB?hjYp?~Q`K+_0GFRgOEv&iu7ubUSYL}zRY|GM~9!nK-6UpqW6
z)h%?MKNuv)N+DXOm^(P&M62y0*~@N`%#~v+bD`P`0KkMP5g+#VtzyB_xthN=Pfz%v
zJYuiu{wv@|I5Z#!cqpnPd$He{c7$sdw~I9{#iSv)%rl*=OO8n?G^>A5vO}clu;&F0
z9d7ieM?}OwjBEk07u}-3FQL)J)`0)y#i;LQ9{c+V7`gq~Curw|RqEww8uIxK=XQ9+
z8Ev1P9T`$&LUJY;)wEF{Y-*+991?{6!wlFMCj?<$P5~FI4YzC_)K+cj(ke!V21fp<
zDD2pGC_Z=r6?P0%_~?+#wozGa=tu}dgK?PVnQ5;$*~tZc)DL=mV(L&W6&<SGTL|8)
zJX3)V)%voyb>L~Sze-(=b{Wc+;6>^6HUE7^&^@oQ+q+Dnza|?pdPu}(LwFs}@?<Za
zYdSOLzT3S#*o|rt&qyWBY2YRMA~m=BQLCYsP>HSSk}up<3;L_^ObJLpE22ZLLz3G8
zbbgsom4N{Ej9%=O=PWRT)kooZBL;XxBjkx^r3Q9Vm=#?-eo!b;ZUhy=Z-zZiDsis5
zspRY@HO|0J5?W4|i(J>VKZ*cNu#$JBfNi)haJL!|2!pn3883C4CQs8;^Ebv~Rm^dm
zhN3rZ$AF%WZykPa|7)lRul%d2!%^4AetGlU`>`7x%P%p2Y92@=LY5Vw>p{)jPz`=C
zBSAb=cHJVwcwkU=-#p8{G5+>kqT^bYGBZXDQ7%5884DjMoFG@YPrSmCF8C`Qpi=Se
z1_R7KpvO))%Z?-;+nS-rK8q&{ir>SY=C0P>es~;Hd*gQmtYQ0tM4`c^8G=W@I++4G
zjcDxlB{tMJc!=(SWc)BFS}*1cmiVoMt|=i;83B*c)|NDj*ZZ$`xkhaUqpHpk4D5<{
zpDaW~8$3DC4zr70SGU<b1{Qx`^m*blOsV)Z7s(bO+VJu;dU!#*|E&J(#ZCwF2=2$i
zvI+(56J+;v>YcJr{oohSfKS%c){wvdN!(v8-hSwVYSpA`DQmrj*fA&hGo1!mrWKxO
zVbgQ(nbW`g^{kw0tf7;#&m-IJ*rD9l>6wEp%Y%%vyC>fA4PUc(MbKR1H3&(sg8GOk
zZW#9lH-dXhk|7qd#Uh><#EGLxmA<9^hq8&4_7t^z2x^%y2mEV@>~$?f_F5Yvetr8y
zaleQRzkD;#Z?%vNe~he5<Xr<d$zB6C$zI>>7LxN3^c5i|XtxTl*Vlp;S>Ii|Ij0~x
zb5rEkWg^!Aia%?}X$=)@B*zBuE~MIe%eoP50N(w~)Lg$O7g%p+CJcK<0c&7;LOy?S
zc>VA>uBE~|x?DI2VXH!`3tJ$70}*WM$p-ucDlFK*%+o)oo*w4Q$54Jkr%qr*0mbQz
z+#D7a=1j;e^oO>kpJumULpb)PEC?N@l0myT{nOxL%sDi$20xo0-wO+X5@&FC-zLUA
z^yF^;d(WHkz&#`~f{@Nep-D;Bu-T@+;M|HGk89Yl*N^02$mcogokM3qtSZb#4A{e7
zLuDfxjf*4}a#<7wV;qgVj$dZ4x!BwpRp6au3MEC7{H%wk>F(q2xeNaGa@7nA&r<+c
zi(oV@j}^Vu36(HWOySHIoSV;gg`?t(WJaiKD9*?h(LOWZ<z|tz&o7LCrF>@;kYynW
zvQAL%D8Y&Z^CMe5!Yl*|Lz>#GqB6qqyg`^rd&3^K%k!{t01aTHucM4WEPj!OND_Z_
z_86Y^XfuP#P2ObVH#w1L<fR=aB>oXbS`B-L9QiRQZ4kGxn16ECXmj<9jFM-K`d~%#
zg_=S&nH0ec#MR=H{C|r~4c~rS%Q8{0?zEQQXUL#%GMFSlZ&A5rknZGWMa4g!HtNx(
zKZGG`ATj_30!nQx<_#A-N+d~IrQnkI{=Ep3KM)9O$5_k(Rbh$^0;}$&;XC?0Q+Q%Z
zj!(51tH1gMCxT@4-I+R}@Nyzkwvh=n*0Xi*p_J_arPnH+GOp+VNdeLw^bgaWZ3Ju`
zz5dP9U*tVv0rAQK;uX@)jbB&!H+@ME2^op!d)UroMuOA$8;Z@Ev$-g6f^7!$kK0{N
zcN4H?FLX(6zI#vAM@AsFzg==o#sjPghMY&dMULBZFII%(3eczx5<GI=3bi*TkB{YD
z&kF`!zP+KGYmU9_g}p`+f(D<@4A;f-iZiQo`RCj^nRaSEEon-yBq|r7anUPT)y5MF
zkb`dHcr?cvm4&OrspRE!<=3BRdifV2y-ZdLOaA$HsO%LKDt^@n>)9oVWiBJ1B&?<o
zjDK;khlph|$Gnx9?7N*<j@j;q>o+pT%vky-3+I^0jm0jRGq|rl+F0HoR(Ua0@zqw<
z)WFkXxdG@kNOqufrr>=mKd-K*uk>Y%>Ip+2#ut)qrn|Ssac<AgcS9hC8H{8_ZHs7{
z4_n0BZoC~+;&;%T5kI(U4RY%V&r+YEWCs~`*tX^0qrwh`@|`b4VF&WWqQZ_5O7FTP
zC_d|gFcKMdXtXO$qQZ`i7~e_5LCMg+o>9R+48c3eg;ChI$3=|X8wWDP_FU@RTY=Fd
ziD7KtIV|W`HUeQ7W<W+3N_c`2$I;ZsDdZaes_rloU&vuCM8|1uQAb0@g#H;f><$3J
z4MHalVc))ekvQRh%!KleKtiHi0Sx?^7VMRWv`+h}{rC72V<V679TuJF#7`T@J+nWq
zo5sUq&oCt}zNTabs@_-(f3$5d%Yjnaiv#|yK6Wd}vj>Wq7<+oOBcP{;kze@Efg1VF
z%#8dJH1c3r0`b_LA>5%~`{cJ#TfJIlw~-kcYF5$Hqt+M5I2Px~B(%(*7y%o{kwU=;
z1_n0bBb-eA^4nHvYe(Jvsj&NvpcLg^tXm7fT2>^jK-RPNb%!@{$l8)metr{w$>@x8
zRuK&4uC`%<83x5`WWbeo4w>D`d|;toVG47612-`w6ZIN-Yla}PyHoSdl@^;6Wc4E@
zTz^D0fp3I#p{C>9o)+I7_G$YxyL~tN5L4vCQ<5Bjb@Y2GC&O%EU!s*YGuv-9VwMAt
zAbRI%!?rf22TNUb+NNCb_<BFPN`T$jcrtEab#5+Qg95;e?U>0?y~k6*j`w0-RGwen
zs_iiN9bmS@M)OzEr}911{w3CyZay3o9UyrP0W(c&IRx-PIRx;4O(w2LEYp?P3F!Cy
zUwzrjtf#&;R$F)RDMx6LBLcp%koRv1$SZ`ulq9+WgAGV^KCscT51CqNAkBwk_}v&y
zv_DkUVu_C<aN+?a8$bB1o}q>W;#FKmvZzR*goF<OQ6X-(tF*RmIk~ro-}QrxOva6w
z59s4Ma2r2?I<9vp8B_NcLd0;y5uQvZkm$Gc#=0s}EFR?`C{<eXyUgHT<^!n8hV&R5
z*IO^M*Hbu&8T<>GRE(40yaP67n6BVWn9U^*x0-5Z2$PR1P-xJB(1C%u>(VxZ&sp8V
z_mSGBO?N)}<;9ou4L)lAI0}cSjXI$=u72M`7#jG-aiYl3VCfS^$R2UVWXuarRAeO1
zNHAtSgEezqVQ<%V3MsmNwf!~|fC4{nP|jb9!ol0nhe|QCw!n(VpTp127(XcY*)x@1
zPWb8h!cbT{CTzw(?16pNqlhhAYM6;t!ClrFO-T@m0xxU7hrNpAWkVP_u+Mr^*$Biy
z%;GJeq;1KJ+#JB~eTsq5(d=UT;+@0%fjf}2jfJqOD7#TBHk8Ob$Og0<F=5>Xm0jp;
zm?cQ_+ERgZ?u;e*w~6W8=Tsh}bneVd$!(ZY9)yH4@wcK2IP;1pFYRpFH(7qn(U=i>
zMIEguQQn?^(k^}m6d3Rn0H}4~j}bvew8_<M-q4`}M^x6q%)P<T1&=#f)-lhIz4S%O
zpHS9;6@~J17YYr}a4Hf8i0X6;ycDXMn*sO37=}doF%+tTUM4e+6X7x!fdW@XSnJeP
zq!tI!keSid)`R%FP#norQgxYu8+N}Wm0{6EuB$s71#QLG<IEtMY!cC+VMis0<glAF
z#r&Wmsi(eBdO>(ifArCsz4)g+08u|pSyg`+yu_el+@Ru5&Q)un!G%lJ(yBF8&Q<X5
zDD&q1=tVSgtE0H(<4?=^kwR`6bRo(JH`azw(hU?bfpnuA_jtSb?gYQAs+YA=vJH&c
zN1MS^@o^e>Jf}Q2<3sZ9P-1{38#LUg81Z=Y09qPtZ7+Q-uf?F2_N-0K#po9*3!q9E
zp<i4Cl*i06x`B#-C@^64f^&yT(=tn#fGLTMew@{Me!{GHYarTwS8!vOzZDG#$~cC!
zIH+)p(kySYXb+;6t@TgDdX78l09+#`PUyk?lM*NJnYn!s1qYD9uKhDk6eUh*To5dW
zI?G6s%PxOs1aF*8m1LJsp43I67RK1+rDE)IUJ=bMD*@icIUslBU+z5yP#&RSmls_%
zXVA>SW$JNpkWA&yb?>M2MtPsIHkO3%TbW7gJ)s~l$}`&!2YabgSWon;(oao|5UCc2
zlnPYv9zQ#bf5getOg(zj;|2HoJ}X&MHP;<07#o)Tk!IejqfqrOnGLd^C3xBD>3HU|
zK@@rYsB*M16q6q`55CCAlz$)7{S+#!GlB+hmqOc);`RC3Nqz4Bp!WnDO5~lYR-p>s
zQ+e4Xjm*YJXFh=Lgy5wBsb-`Ji3~fhURhbqObXE#7m%T%K%<YBq2zGc+li>efGHRm
zh+!nj&mdg|$<K^urvD1Xi=#Tyf8#ijb|Zte-+p+^6m5M&h*3eJAD*9E(E8W*gm*Sm
z=O18qtN^x{F#7}WzXgObO|jNh!`ToL_n9!9j4{2^o_A<?T!Q-Bb$6LLo0b{uS1Bh>
zwX?c-=5MyMIhKo)xi@-~mfkoN*lykkndM!-UuB1nzkOPxmHl$%EvMn*$`K32o;z`k
z!Ed+)5>{nzdeYr0C}s7i$e)yXv2#20cOz^}wRfKWW!ctmi5$yyHq+FH{Cx$Cn9IAb
zbUiEjqpbVOk*@C_JHu`~-+dmqL(aY5H}|Lv_l%invLzF0cQA8EcS7I8iTK#;r&WKl
zT?W7P1&a35t#7MyGNU6mE&uxTWrCdR#Y@@i$xG2y=r$s);ItNDs_hwYxf!?5(3Zz$
z5*)8*DI{E%(3R9s+;~G+W<PX@f^mum!0NyjuQ=hs1B$w#vezetlnnZbxGuV3h)yhg
z-6$4;1s1ukC2MmSQV^or94gCcv4?eMqDD#*^4(#UAB5-;BAI{={I}zr{(>a!aty2K
zH6()x#eR8NhDYojvbw$-E;q)C<r99WP3|~GB5N_lvZRGagBx$u`D>IRRVxtUC~)5z
zU0pG#1lm5pq`@0{?L$KeIvTRg48hTuv=c@$GaK(zVcHEo*GttEn>P+dMVQB#xjCc@
zFh@vs+C3a^A}qpeFlSO*?wK0C%{P&(m4tT#W(l&MKE+}m1ti6F?)zsk;RDDNa?Ho$
zIJYQ9pBYK9kQGNPq3sXu0^=Q4xc*f^{3W7VsWB1NC*Y1S-LWx4NDIMBs)khgXakXl
z`M3%|1gxj%B_d!wROz6AWG2rp$MG0aL~Gk8R2`eGn~Nlzjj6JiGeF_H#KL$`ZEPmP
zc*bTu*}f041S13ba3=?O4Fq5vq2LEwi-rlbIB-fC!<6)KT98+sd!_P1e?9&79~~OM
zSxPRlaA)L10=1HantuD1H9ZFG`js%r?Y#A<pHj+Vw24A@N+{j!hNFV+fAdf3e*ZR)
zQO_W;Oi;uhf=8Fn7(y1SN=f8S4Nr!!C`eP?Xl{$jA5*=WZ&myF@!PXw5P|_PI;GU`
z49Bh7NP6~G(RGTRWhSk<F^i&S0gK(7B3S&#!ItZ`L>*&<`h`A`3sIBO)7nT79niyZ
zSGBd5*01W-U(K&qh3%MszptRLpkFR@5NuQ$H2(!Me}IY_l*5|CGbXbUc}jkwH1x0%
z3nLd*T2u0TX7=}JB+n05^MJmvF-N%L_wah`n*Z3?G-p%Qe`nV&D(gN4l^2F_Z*jx9
zH_<pXoD+^u=jA@=j#AAKU3+;>D&d}KHyX@FT}q)xlgJhiy^=M?TPepFZy9tnM@)Bx
z05N!ARS!(h>c1oJ2^KpvpOB=M9{$`~D27Jb4%sTkU*%LWUXxSBh?rB*_k>KYHZ;@d
z8<UeW1yS+Jmv`!+DR_`n;X$pT^*?u)qwEPYQyliK2$cBw35gzdyTozskj_##omVG*
zpv0eb{><3~sanH)vTg}8k2HR)^A>ggHzYTRWLsKJr;5zic6f={j5<0!)_psP%;5?&
zFk)&Ds$z_>aYuFa)HGkew`xP5J)9OE)~?ZL`3p_As3EEoqtokM@&y|Qd|1#X=3vJd
zN7X?r)hTkYW7s?eHR-<eH+zlqGmL!k$jbmhRF|pX3_2T(tB%o<8WqrsyNXIh+-D{*
z_*+ON#akrL<gFSyq~l%?EbnMMgpvGUaRDp<U+A<ruJ^~O!cL0;=){vdI5=``NGyha
z=B%qw)(Q?GvwpZ1{zpc9%nZ#k1MwtKZzz)_D^%T?x&2*H63F%i7%+Q&GDABhKAq{^
zMkbJ_2CX3@1SWrUlKf5_=f=FbNSknv88uD}Dqterf1TU$Q@ZQgm|!tCBTz=T&y#e1
z_@t@<#(O3rIv-0~YJuYt`;MGYL*gx*`W%A_8L^jLj?OTo(`R<tgGB?>rgd*Ac)HAK
zA}TgiF!fo>?%x$rk-#h?u}^z2vvU}E3<YEgVqS^Sklez>wc_*3rc%DwOaVPwD}Me6
zOJ!Q|1?ik{%22y8c@DYDuK?`W;S+^jc;P4WLA!@fGP~<rpm;~ot}_4X>=q<A!Q6(|
zzgaKf$^Xy?=4T!=+srb9oI}VYZx;afzWde2^Ncl`cWj+<-Jw9T3w=X&6#O$0z9XQe
zncibI$e|xYR`6@|=-!~4)6p;`o@;hoz%%}Pcjwjz&Gq;{3-)J6XUMs-qGhklXzA-D
zlH;innqBk<G&{jwZvO61?bDA_`aY54JMAD_t2jqSY=OiVpvlN31zVQTbn)P1{r}D%
zTV2|ty;iP{M`1{|Kw4?tFr9Uz_4@MePv1Pq3>v)Mpn`vjv=0Tx3a?)AAQ&&`HM74*
z{?TmPs*LJz?tFgVs7ASXkSuqqw_RUY{@~1_Zeja;C)-t1V_3T|SJEkSMPolxG0%*r
zh!{8so?f1&i5tJ`S?~F!S<jK43^-6*-t~1`izV(JBjN6+MtN4xNu<)Kf=7`%=JMx_
z=!XoZ*o_NN0S>G}?O(}l_v253_vE(Qj+q1RS5XEi*`D|3(80K}Yab)|W!UN8px8qn
z_!uWst#<6FUIo=emxqsTDqBE<>u)$x%<}I;5WShn)czu5mXWcdsFaam2NgoisQuoG
zXI`Vuwg*!H%v$ebz>DZ4T1}>!us7P+e&J<?gsp-`+Wrj8c4(5BD>m$*)vq>_u8NFp
z>%w7&<^}s^CI`=_Toth~Aw`ra7-@(Dj;CS~+2t>}S*q|9_tXazqhWcuVop%pHE0jq
zodE+o$kp;tAq`c8dHEXu!u}E1NR*3^fRvm}B7|=6XdS=-89)JXQn|l^0IU`iI~<eB
zWF(B*zI=|Ii+EXP^h02Ck9b)PHK0$l7tdz%mpSLF>+jsLj_wK@DNz%)M6uj?Y92aU
zC%|gbu(Soive15nvD7CnAcfmo=)^5~mzzl%zjR?F(UFg3XW+;H#xKTSBLqt*;}<qM
zJ)~xh7(7(K4J{RC$g}}MTIi=e3SO;qx4F;hpeROm_*{7=(Gg5-@WaKlkRp@lH|X|t
zgb@v;I`VNjIhntDK1-1Jlx2kSo=hFAxHbaq@G&+%ec0ia1)WWIPI;qTSt?c4`VXq{
zg#Ih0+KzK4_wDFc<GQcQFSFF1p7`8AkAo!!k!yAvIIuFlXP9J|7fdZMFK{g|DJbT|
z3bX{qT-PGbJo8?grlG<;aEQM70%UF48V{efD9`_%l6!_Tn(fWsDZB(NtA$seYT3)U
zT6AUCoKGLw8u_?e%&_avf2cKz;6DF(d)XGat%LYg#2$&Sv259EG+Xl8j%+<iq9^oC
z3D>vXZeq#vrIz1Pb5o?QB7qmb6|YnEQ2ZZKzeg*clR&#>d<H9y-@4o{40;us6_`+O
zeQ^VCJd*$Fz6}~Jj2#0$VPQ#v6xJv~Pp%%%tjrI+)NaI!YGaqp(_puS4a@$WBh+t<
z(JXuAK;3&qrAhVpe3LWm-Tc;#c(D;gJplxg-30s+t-&2S8t(nou%MWQ9(S9f_fAS-
zdGRgF{LZj-c+UAILn{uUW~PLx&VymYHJ}ZRk9OtN1=ljn%e{wx(-SoMq4BS}VQRFn
zvy)Zc&+KK*oCsdYyoBN9-e@2y8#U7O=TmL`8OJa27W>i;mwXzeua#mRJnOYH8;`W0
z(H|uqokgIdgc`0mXtMIcvgo=_YZU2*>D9#Y9XS~e1t#T+4m<VvPcNMqg<6dfyPeJ+
zee2MnYi|!%2aRvx__K@?C^1WR^HVoN(Xtj2vKw6*X3So!ve7=jhjnWwwA8G+^8QVA
zOSD>w1dW;4^l~V(rl0&`uMX@LDtU4bi{$jqT;tJWniUnUieY9B&hL?fTZ<X_tiSyG
zGn4rvjcjgZUwPZPX0*VlI;lti>#VUm$|ym84!%3Ae6P^?JK0NpE)n<LbZ;l|@hz2H
znuX`HyC4CQhUH{4y^pzb$Bwbdj9j?hkB4_Dej~R*YH{+%3D^AxtI&6PYfN=cJB;`n
zKRK)}F1hpIA!@|voV!a7i=&a3e^wkGbIy+0%sx46hZ}B!Up1r4a|rBLq;AUoSY?%2
zA8oaVAMFhBh6Q86m)Mr6!SQPNfpM?qd^Y8AK52VM(el|$?T6?yJ;(81OKA}Y7yerb
z&#sYw>{)My_O09rQP7~$1AGtyTeTX(KXTPaJKxp)jQsf`et0!(3Z1L)!#>Ago;q%2
zV4TT3Sf$L(m~Z3pT!$HRD1qCD@!f?~1WaFP?ac~r-i65g=kw0(1sJL{bkCJK@adTq
zE+FlnVOSDfvJChSTEr36d69b+ynQW4me`gaI?*1SA{d`B9f(m-KzP(c<F6mC`${d;
z%U|W5&-l=&&G9%p*@<6VVNkP&=gmvxJF-o1W&~UkZJ*!L;P%nbL;Y03S#a{FiUZqV
zo?q@c&S|*L%DK*PB(I$DlPI^VbLn0FErk`T{?=}}<Q?(d5nPr9%44N~G6|b2M!=(L
z+UW1LNlE+O!-MVI<7~5ooBVaYNjxaNZLwf4U;6UmOJ8B^j^%#w{Pnql36UGRLVypj
zbI0c-ST)*^sE>0GbI5Ql&?`5r@gB~{Fiv4$YxNZp31A3;;)bz@9+_m>pmqs~odu)O
zP7{yecw;a)-lz)64t4;Rk6-iPCuoO5ZGSv<>saM(olT!R(*yhSUkjJZS95g8D~sJ=
z52SG6sm)B|LUix|(GNh`{>E|?QK^+ZUf!-E14kwA1WJTG08(7(V`s{KD}IWWXcK|x
zB3=Ny4~^IresL}bf)jG4*o-}tsG6M{dJdek>h($mTNKq(_{7ViB=P7(=CD^dFifS!
zh0u<-)fK$dpRTr}ro%dBu-i*AK!K`&^JiVS{)|r+=#y&$eV^=_cbY4BGzCIgYtA&L
zF%S`FF?m?2t8VLdF;Ummn3?F8PHr696St`O=&}yHb9;AHufFThlQ{?^w1VnAFv%oq
zmxagbsCls{N`V;SodDJneQ=9{clxdRqOW^wa+Sis*e~H<=yF!QvV0&8Q(&XzHj<a1
z!ndpR8lAiJgWnY~tPks5$tb15EQb<{O<!r~&5BeZ0t#%)PZn<JiUF*85D?)M(Ce?N
zEnYq?-e$k@U<O^KPl=|XL})Aa61`DG#MbA{8a>k~GKiW_<$N0L+Z4{lX#e4>XT8h)
z+yGxS6n54!DjWCHSllI-X)I2~of?+<=Voq-F6vQks$-hHX14M>BLwp)EEtw$pEL;%
z8zO$p`e8p@5h-+a0pKCMa^sp^yac|JpFrWQ9IxD~RrK<l(+#}lnB2Ek3?)y0pg-C(
zeCtamfvSZJkcZK@UZ180m5hJ6P9NI%?HgVNiI3v)_z{2;t;<acI2o)ALD+b?`1K4Y
z#UbCk%n*2_J^WE@_%`<rpQe?kOr8Odf})iT%OtNkT!&QYONt^UDPzQNSBwx6;QP|k
z%PS3p1h{#==(?T{SEUq^m&EYocZe`Y%=6s}%E8aaDIo1kS}~q*3kEs+33LU<d~4+>
z<!u1K5rP0H8`ypn=6}FAZ7+qocQtaVQ4@4KStss6=tMr~+y=8^1=({bPI<m^4<5Z0
z8)_K&IGqmhdICk4-hIql4&@?ZcC;WP9wIb4hF2VV@<l;wuPkWD!*p0F#B9IYGJTe@
z>9fpf<v+vNOPYzIc_C7!$3=A9Hxx6U+Y&6=SZ7%A(^Ybo0kwP)i2NlgA!y?vH<exw
zRHhM+2n5x$<);3i_g4Fs3`3urH1wG;Hj8OijE5sa<PLgx{^z)0aY(2@@<cR~Bqvt}
zo8+w^`uSkhj~mK3&KLGu{4+6_S;9?3E}y&6BTs@{ZVceWSulE9g=f<rsg2#EM3YR!
zO}NhvcPP-?{@O%ITKwZF(Gs1bqG2Ji&+Ve+%wr!Ae|lH|_E|Fx@timZ*}NtJ*s^dv
zCCH!}Iw5u~fW4g297i@C%7#T0_fQof-qQ}q(}%+CmQgkcg76cYZQn5*RH1{2RK)vd
z`KxAJz~b@2;7yl)=lTu@p~2>$cH$9!eZguS8@e!#1?F((q4o?@)*D%577_xsU*1$%
zGaay<Y^w&@HvRK$ubv#u_5H15hZt`4#Wv;ndKG@}`O~@Vw)pF7*4~=&YXozT6`HV3
z3Yr5Woybq*$MO^S@tt|i<XpPd#%0zUCWP+licAchPI**C4T8YL;aUdCOe1z$$WXtR
zVt}Q&U-Uh#s3^xM9Ne`nW&s5r1UVV=IR&Y-%z}Ovfe4k)DU-dd%S2byFd(Zj6RBf=
z{|GDG6Ozc&O+Iw48Cvi?jN`<P=X>#VYmCdS3tTJlH+4(}>Aynibkb$GuVowV0!YL#
z3TRPcUDGij#Qz{p3qp63#bmUX`koXVG(1x$@#Lvb;JLv@%m$`(!mD>UEm-u?F5?4<
zmfztoIQ*16zp1zCTT6v*qRjdVrZel&CL&__)P7b3r3paUZ{=yF97x&;bwHacH*D8e
zKlmi*S4FemlBc@}G}e44`F6C!9xYB%)!AUPG_7)gDq<823wtjrgF4~eYD?}uY0+pN
zl7>Eba0)2R0VLNw=bwkq6qe`?-j&6i43qNPEG3!3C&TIal6GLihiA-kh2*gY_0vAn
zFJErSUa1#HMC2@MJSRpcE-*Rvok|I6SlFh|j^XqlGscGF9t+v9f_Q|0*m%K8tnB)h
zCiTOSWZXvB7=^5?JjUpua|0;r5JXuUdG$_944%tq-W$R2!^q`YKhnzR1ly%uYc*bu
zdE1JY4od2;P{b?L8$g0%*!pCS)tH$??tLu`B4F4WukFJ37RjVSd!?x`?X%g6dt6tP
zYeRW>0m$xX)sx~cqUa3d8OT7=n3EB@T8Mri#J}K{s={F@x8nNC85Vk{u7x<RW3)C_
z&^gE%L2Vfx7om^=P+_0`f=7(z+Op^XC7^sD*SD@w5ve%p7zoL~g4u$r0gZg-b@=%Y
zK_X<V9-Yc#Uf*$XQA-tw4X0_E>OZhaY16WKQl+(4=lL<*lCLe`45~lb{?X*Cg`g6o
znh*GK?oMoHfg>lJ9iGI~{pPxky{pFfb?z0v!$U5qp<;5c&si(EXJFv}Ti%QmE@Oa8
z%9Tg5V+AzK<+YP@>GDKZq1%ivr?s&$bZB?r$TYeT{LlM_V|lWOV}@6iVu)N?HzLh8
z-$Oc7HINnSoSW&o6#^be^n8vms>pYhzAAxUCs}C;J+!0(T3i(U11m>BvfRbi;9m8s
z@~&OM>z_Kt+BQ<!K}|p&SU;j%si#p$DCA0?c86T)S99v#R!XwV!y$&i9ZZwk<f!pa
zc7c2UXi4dDhbww-DSGTAVk01s($`vi>XaI$Ik+$T%_%UfiSJzDt>n3Lhu*!X2bSz(
zMKTJPd186BNmUyly}^t?55vQ2&;<p&Qk)1c-!Dd3BcA`tJj0vk$OimlUaq%Y(P5`}
z|4X90*YwFn=8Wd+g?TSvm1jb560Wk*PKz^HKp`tv$YCkK&DN6r5EHgPZ@Zs$LlsXB
zaC6y8J^p?bC;>3{GwaSLy{lr`S2*1(K@zR_*-js6W#33<79iowez5?+8HR+&Yskwp
z;DUeiQr9b8yPhtXcTLe?lYUmo7b3oGePDW#w`!z7Af}tJ<{cVyT58=GHeBwLg8==`
zd{hL%pqyp}#3p2T?-e?ki*!cBlG2ctIE;mWOCVqF(qLKO8xikuVYt0&VsLcSpD16V
zN{v+WPJ&0X8>EpEQ5*F{7^yXM;>T>D9n;)066^rC3^V56#rz|T?=B=!*7Igid~n7t
zeUH^|He!jC0(-91flmuxB=TW}&@);^Db9WA=X<F@f;m!`=mI6DlVdt{`<iR?hml&%
zSJxQ@>q%--LEMteDz^~)!F%BDBybWqbHZ82K<0tiPoof*Y&HH7PjBt~W7jiG;N%w*
zPnhRF<0pM5RmU>23<ufjy>Dh0gwn1r2mh-AmQ1ZEWPs!yF>FR~SsEsz@1>zK`kpKv
zG}Rtuy5e(%K@2C{AXWWg^aQO6i3dfuy<RCtVl7#Th`!5UwW>*S65RgIKA-s;Ds==&
z`28{@4S*Kt)=n&_wzMv9Uh^l9(iqorq$A#;mcI)8fi)y(GYL355$7{a9Y%nJ1g+y#
z#Q)Z_pzGk7Qp?F^t<dSrc8-l;@$R`EckfavrPQ~|-MWxYl=igynZ1@;F86*IqC=h`
zQ8CCBrw(Nr7t*9yVy~<L45yHUWC7Aij03t|Lsakx8#I=2D)DK4qv?XvXD2c(PoZ{h
zAbzI@9$uw_Es7EZOj%XwEFPW69QHKt+RzvI)VM%RWr!Dh6{9KSuOenC)k+1-(rHb?
z)W<U*WLK*z?4>;*lntUJ#WKS}pH#K(B+{FV5CZ{ob-5}^t24AV+jU;8G@}6&O1+y-
zvD$BGh4AnQGGC01<@Wg-@`K;0nk}Y)C*ty*E~j^7uMp$%g)}P77mAoM`mOrHj512#
ziuCjTRSc8vAkC%x?2f21C$^{~Ke@9QXjY&EMKa|>k6IFcs3=+JGDAh68LiR@A9EQk
zt(=ZDuDG;v-;9exxc<Y%N-JT%RS^G(=@T(p%n%`FjhoIGF`GKD{?1^PJNebbD_OHW
zkRI|2ZY@<Ktb=aN`)0fV30a0%Re=JKSr)hmhb8bN)X1x==@=vwr*kYJB^I?d)*V2R
zk_BQnKGLE7LjPpAF_WP_6h7lF&~X+En7;L9<kJ9p=*31CUb_YDW<?y`Mf~x6S;4=#
z|0`$lM`RcRCk;vtcV~7OM@pR`uF{YOyYoyyx(u@$>bIW%b(nPn?2ZH*6J^yP?F4nJ
zFN8V_WY3X%Z|bB@>Bz4_$86xu;rs_sw^b6kb2#n&fjmI4`v)JZqLDHhUoyNi@X)l0
z$TwuLp+%q(2-$dPBdPv5`UHsIc!3vaqOmTZu_f_uSor2xg|SCQg`p&xeIrtjgnMfW
z5+Th~Q{Il^HQOuq;A>IOF9OoA`XQk^N?lh2(e6i*;UI^W5O~x9<!kw?7c>eVJl2@K
zQdL2#{Q*^!f>}a9r4KIf`;UD>0hMWx^&(uVL6L=xIM`|WO2`%hE!NX+Z(=ZVW?-)7
zTO>jKaAO$LKwLx@It6y%XUHk2l&b`y2q4+bTJoJ}QiF>5-&oZp)+ZP<e3nsKBYc+i
zSyXAiU0>^9;h;W>QnVtlBYDb;>w!Y{ux_e?bI1MzsVah1Kpz|~KaW$HN)`9gVFnhM
zZQf49lS>mbE6q^V45|eClg9w`c}?$KJqsVHW>~OH>T)YX1eKMONzq|D2G95`LTN(B
zfJ?f2!J5U#!=1O22i`!46>}0$#!n3n)#y-n8H<!iLA6%9((lYN?o=TdB*bP9QXTJc
zVd8dCSs(KWu>-wSz_$x)6^8a#&A1r(cp6=7HR}LacsLQ6Ya_9R2Y_g0%i~4HCSEJk
z;uscqiHuDm9}LBah`Azj5Wei{O*ol)?L7K$M$cl`E5KL_21Whj=*M3t==segK`?$j
z{>nRdo1G4Yr<q{S0ctx=xC7J@av;E9$??qq%emasoRRDS-iL?u1Pk1eMjw9)V6QR&
zWm?`|C86zFz{_pbh!|5H`++f>2wxu${_hE$Y4<tW6+~!thZH3Bd3Zb)`C#NNs6r))
z`G!9%zlC$+`K?G5bVe>Eixz++n)GX+H=;UUq$8CCD6Q2klG~WYat4l>8FSw)f%3sf
zP|gP<2-E<O<FO&UTsr*p6VCFK7xtkP82yw}j^rSPIAxNwqthwS6hlSno874B5dcmn
z@{8mdC60#b9220^-_R0_^?O5#y_uE$*3ebcgY)35WLEZzs=>gG#T1VD`QEIk=Az<3
zz;_L;$(Dnt@mmsBKtHort0;`nnc026YGf~3i%rLcrj3<!V1v_FVZpK}jY^*LqBQa)
zRN<#G{NrP#8utNo@?5waU35`}<zUdTRa6d!YQB~61`?HnUG`$TFv{hN%E2ymU88~o
z2RNHxKfPVC(A^M9aB_L0)-wx$02LY}aVIlsGPaW568!_as!k`B=rTS&7*$gWqi`z7
zuaByyBYN2v;EO8syS&_s=_p(*9hPON%3+xrkBdyDhDEef%l_W=y|aaOT{XKok!gVk
z#ZDkeP}fpsB|*qxCxk3laB%>EhwNk#jS3ydH+cS_*+Of)JS$YE@yfbc#C)x3^Ra~b
zNFB|7;p<}dvz_0bX_joxx#sBCfJ&<+{BXTeKaL4@g*F5~4!v^oa^vl<bKml{Dy(mF
zVtG%hp?a_b#ufqBt|nqXHuu@!*CCV>(*=H98s?@*8*iZRCCoS8^tjM!FRnfDU-?(@
z_(5QH7yJ}hZwa$$WI9b5PRm+N_Yt$2CQYZoa5|GB4JZ9L`e`aA4S)S}y`PMWotMB`
z(iNJtiPo#d89I(X{X4G1141&+Diyk~nRivs$k<7lZ78Y2$c2tS;7bn4%)l1SOTPmF
ze44`--djn(yKH!DsLO`zK;P6(Zy~ML^|S-Wky4K+d~b0q4dnD4s7(Tq9t3J1KmUx2
zo?={ceot@@XMwaxN&DtN(e8br*E7}7KS)$_IOH%Z3Kg1yTd~rWi5MOhY$N@+5&3h#
zQ%L@}fejEUhhN-y@+XkoxWP));HIV^jnPt*TQu2b1HlRNcAS)N%Hi()xZy%C2}Vo7
zfXN?hms&ZR*|17vyBJdbHrI%8zh7jzZ?n(-$aa1TI0Ojm5z#rOWGUG95kjKS_C*_p
zeP;m@(uG4?EmT-IG*MTsM2glY)ROe7Bg)Sam6)ct$79aCr7h@b{%*!_B^YvDB*XiF
z=m*b`*{aPT*JueNaXG99O&izqLg*xp#9dhf_NXQX$3DVSnKtR9%1kva^`CECmr{Iv
zH5iq%OIzX|0<ar1=8Op0^%>8Zt{oKCRKkqu`%zVH;`?UY{S9T>MQ-A-J{l@{kv#B4
zJ_EchwD4`p^HVASw8*Og)hyTrGR<4Vj5(Q3=tIlvbLkr{yqkLEaV+uiSa7>WtD!r5
zG-0!VcqUaX-~EMv%WBO~z(hs*YP^zm$p24Lk&!8=Bq`?x0b958=|W)J>91kXDWePV
zMxMr_8Mtl8syyb1d29$(9)N#INUJ$gTeBa}UA@wJbJzLAJi~wAN<Jv6aBL?K>N`YV
zWtAR!ND4i;z@&l)oe6uW6JBaYUjH6*$Hg0ely;}wN|dXHM@5O0Lx@!<S(*8GIps??
zq>*K2R2nV|bQs;BHbKqk=;s#s4*T?5uG?Zw-MWKvw~iL^gco{!cqXjEiQ;2Trot?w
z<he(c_Cd=2qf2v!9n3`Lt%JvISA|6YDTVxyKH-CeQy1(zs11aqHbGjzTIZ>jMW6IK
zGp!g`r?}JG-=ssotCIfFWv`Ya5@!Gbp>`)l%vvC$nk|x`8P_{dl?Q!_=a1_JASZ0V
zL0<<Jl=!REyL50B`CtIUp4lj!i2{768rEuFdL5Mya%%P{A8z7(fLi{L;_wQcv4ML=
zj-!@T)<RO+A~6h-I}7?NVLcc`odd>xWVj=d$a#L&AcocR7+XQPy$|?RY+heEK!pZD
zArs%J#H$9C$sO-{oMG2HByc5#b(2nhDH>lcCaeSISYZo85hla|$amWFNhkfl9_;yq
z{DA}+473Y-MSC(GF7KxrnTG{f&rh0l5ezHDN(z)KSfYl-W%CqpCD636ZJT5dYKhir
zInm9)y$!r4P}`73Hw;S^kwP2B_GegzL6JgG2C?x8$FgV|gKY$wTLDR?jl|HV7dVjy
z-mHjymVJp$**|SBe)V&;Nt9lBg1Zy=a)hyAeAo)8p$D>>)X)H%n$*y8>LQ!e(DDnn
zn$*y>1R70hXynN*b;ReJG^wGfP*jq0ZBj$anAediDO8!$q=u$-8Ddr7O=@Vd@RJ&s
zCN;E_8-${2=!Lh~T(>Y2=<#hxsyS-(woCO!Atf8u`K~Fs$z6~TgK*UM+N%CBHw)1!
zcNY5z+kNA&xGSJQlBgE7`4+vRo#nC*%>YFTVF6xDx<%KqpkZOSl7f*E(01s8f({D8
zs%GPY#Okqb`?e!zXfa=Cq=<eeKqk=&G#}g~*6m~hCdI;B9m2`R-z&&I+6r-xVn3Y!
zk+knXU0TM;bZPlhxh^f%wEJItTL*7kB!^r_kh%i|P~PMhxhFW<m+O;8-Ke1bBu+r9
zH{>L&ROyfeU7IgrP^WBFCHM34-LpcmY^egG-`ZHS0uF7EzkYrqZSKZQdp%L<pvIAj
zA5=mskrv1sQ%jM)y)i{{^g%|e>`0ZksKt!dN`LrFQO)p=$i2M9;C`%ZUob0?hwG%F
zphH!OJ0g~eU;dRFD$b$80oBlKso1)wa!NRV3S9{@E!BWPjj@=%Kn;`uP;gS+tR~hS
z8e=Hc7wm~Usc=OO9`6{YW<@T@m!VjbdAqA=pc{*~NltTI$G<QOEX=k*o5uxgj0P0u
zAgRHohM!tOFy5sPEE$$bi5z*)hfMeY0z(zp>46GkeO7AGaydqTvh;j|-^rny%XqDP
zq>AbjXhnvLOvkEnSe_SwQdBF&Ja`s1`-WpovM;(AnxuEBI$sD|rDA`?8BC9hNIrJ$
zA@d?Es!NMg)~li(b&d)h!Yedex<QGYlj$;-C2x7gVBgbo`_Vp)?jj)ZxujCV0@LNh
z=6))uw3yi1!$x0o<mBXtj(OmAH$m;kSBG)V4OBz7!fI&4@*dE&v1N^MP4gN<2{kmo
zNe$hkhQ@rMq&TWc4J{o|G^wHG9X(>ZUy~Y|K9EvLDL|7NT5=JIQH2+q)X*#n;Ww$F
zB_kf1S!q&3O8`yD-Gwp$Y*IsuCp#HeLxVSTWsNT{j&!kOgA%yO8@kCGT4GtIHhDwK
zBudY)@lg*=CbT>Qdc5I8y&SC>7QXH`3qKx?-iri)rs;iN;TM%^TWQ7ewAAy(<AM66
zSrqti8qaW|Bl(=j+N7u5qk*b1Ng|MG_CRiUU0tvw!IM1nO&<x=3t?|CuoAbAM?N?V
zHj>*!`wxUdZ%yW#q638rEwF5#k8J*u6M<Zeo<M&+Z~+pQ4@%PWI2vonkl>#Y)ek1O
zd4}7i78S0F8BS)^lq~H<^@Ecj<7niwwL`~bPQ+d?OZsNWY~wMML=Ktsq}W^B*aQXy
zb(xW46Cir4z7Y}%TtPqI_Bg{1BqBHQ*{U=M%1U_mtUz@+vB2&ssvtzBlzW#zORux)
zmE{9*@uLFiJn5BBeb6_d@R@2GvgtB-Z8WZJ2o0&Q^|5G*i8Z92HncsKxZ{+VGXw2X
z7tv|R=~+=l4DaY1Y*vMOHT9fz@>j_|-AbJobVlqq$cX7fMy%sho-z0XZT#9E<O;i>
zowZU0Vyo!7=j3+(a^c3!nA^9qNb7b;EJY?TeCw6CgPND8sn_&JIT!6J%~t)U?P0wp
z@f5dkso=x+U2fqf&`1PXb3ii@Nvk^K#7w&}lb+1<pFuzTkq{#W7036RST))hny5@&
zF2@?LSdJN;Y_}7#gJ4b#bpF=G*1R+9vp-B-4Sl>=eWWDX$fR1KcH(caYn%s+fYT)J
zNlBy`dFH<1d~2?2Wo{8}N+6qGZP+{cJTuyoZoam(C7rHvmUM+;R(jh(Jp!hj%&JEq
zQEH^+6!^$mkO++uD=V=x2%P4UZg&z0yOzC9;%BDQ1#<iBZxml-77&u#2ddy5oEM;q
zQZTaVWqkS{TVYd$rk7iv<4(>@LLcx`PdmSY8_KNi#g)e4QyvdsxaLWWEer{L=eI^I
zJ53c-N*zy<`qg?C)48vt9td@4Xs<e#vAs7`6P@6*>}DF6H;b99!nw_;IpX|EdzBcF
zK&te7dlji(kngn1)JNFYNoX?$;7DN=h6wfGX(eh#?HPDjg`MKBsi;*d76W}*hoG{N
z&8_S!%HvHkABN5%s#$8*X}Vde9(ZQQ@)w&lzFF#ua?-*Fs<jqc3ZAOS9msL1>f{~M
z18?*YmGv?14pbN*GM;8ytY>!9Of}<z#Cq$$Ov|e@5O=hvc5^!FQ2fO<0bNXa2|Ss6
znLXqvaVL-}lm972h$trNx*DP;fS^&b_ZxBnyrd2dn0v19?b}aZka)?vb&>0a$1ThA
z^(y?{^QUv!ZSmLFti3hk*9bC>6`EYsgTP`x;-m$Rg2e(SNp&-L%;8Imr&}FVH8FHo
zR{&hQolbdFMGXR*PKRsCLfdk{%dJ7V9A`00gWD$vI$@d5DM-bQ#F2#_-9j9^JA_w#
z9v)H12buE0xPOEdjttDEn|$b8GZg8eo!DZE=t}&J1oW#L9_EO8omjTP)K5Y79Lfh{
zzLGu|TSYxu{AGHyyjQN{;1lf72giK8MZ&9hRba5JR`k&hcNLdzq=I*1NqVgAG08V6
z6j^v&1U7F4qaMgq_X+|ar#&>Ij$pLCM2;VJ>4R?e<3cx8Zct$%{L$hhRfQ2YOVd>2
z0f<{b^j=hk_3caUK55ZtjT^19BhUF9+Bny9{&^MRp92$ADHFfklD(4oQg~Y^h1amK
zO`nZTBW*bD;N9;~5U(8d6A5mVU_SyZVaUo#hMV@$&L&>H(^O%DbC>{<MnBTZ=mguP
z9WePhz~nOufB+Q^Tc51DhCaR0RA(A_VzU+ZxSX_4eN?^tVrTrXM8V0K!2S$J;X+q8
z$X8u(OI6{plv{EA<qQjbt~EXzhTQIgn0C7pvJ+6P(5FAc{)i%7en9y^u5VqV((qId
zJ%3=f(1w>k|Di&|%SB*3!YHt)HvYVMnx-kF2~*m%Op2|v*6KVzhFkKrMfvRpw0Zq#
zQiIeSvHS=8ICm#D^!i4A97#OgZ?5auyK0PI=U(wUJmiuZ0ocOpbJj}Ik8OFg?ILew
z)aL|Uu>u<A^4iI{ba|qy&~3(-(_q~L3n;Yv&+H`{T?qc?eZ#9!c_D83E&LO;{zjK{
zM?`t;zwgnta_45cZiN&zkcOWlj4Gf%q108$CV6hs5}Iya7{=bsGb=E05@<`CME^jh
zbkOToql>M<z3Nxx(7<nhKa4xiu-hs}F7x(V4ebe@=a9?{U1uS93IuTVSF$<a8Mc*@
zU>p(Ga1h5p511S^NUOoUf3&3fv<z4D-crosNz|wT0x1a8PMuQ29U!<b`^_mZtcmYj
z;jN_H;0_I~rU#a&i2lK>*rcir;=QO9=%FhcZ((?N4d;0XC&J73ixEx!c=H_DfPc&z
zPySr0B57raxTjBMx+A)%G1yE9PQn=tPAK;>Jlbh-bTK8feKAmH)VBLsH&pTDxKpAY
ze?Oy1Y0`EPG1h};-T9;kevzixYi5f#zf}Ber_qwo?FAs=%zm+){)}o~plp!tqR_ll
zbzKw!(~G?8ta*}Mfc3m1Q3>`AjrnPZ5q~S%K$0G1$roa6G3FOB+ZF@4E`kX^I)Xzd
zbFta#lG2ctIE)1%ULeoFMS(`U!Y=U$%?`I$O$?5X`V-|#MBFbUOkqBx+Mwr-4OqI_
zHE-TY@Mt!anOZ}csWb3Qup3KO4oXJv7(>@LVMKku%?8>r-AILMFas8V|1QQo)R>dJ
zpxuR%yxa_eMk<Yyyht7RbSg1}Jzm)1{)1KFPbvVkB=NZ~{d_N`d22LdTF00Y8Y3s$
zoH<$Qx^LTDwTj2CJ)nLaOD+W_^~?!L7V$WHM?Ck#_a5afp^9)n<ah3oh2X&R*=4ta
zePGxa=y#NWXpiv}PA1WEIm?~osIl_~U-C~csct5lq5rqAyS;a}XTe|&?_qsX>W)GT
zULW=rqHqv-pjIj)_0>mC<^&V`{U?3e+q@jx|F-0VqT41&IfEdd5RoT{@Krp2eFm#l
zO_H0y?8#GKs4N9NXUPQ<kVS%(^*=vBH9Xk;DQAUvg|zWNYL~Wly>aV+s*<0nCf%(B
z3T%3^`r2DPp0t9j9W*su8m(S!X!bz;b&f7|Yc1t&y_V#yFa&y3xj~pezRGFLl#`yH
zqJw8^mZ!?(ic?Zg757jT^*eZAS|uo#H1dx<>n(n&)lvf^``O99vzcyzrP0ogX=$z)
znV)ukp=#2CAfEMFKR@0iyRIf!k`RPuGwOIjwFX08zXKT-{m!RjHh*ZX$-G*z`7Z=9
zQs;qHr;U!hK0{G^J?^OWD9u~D=(oWbS`0DwEly@wB@T%BG>`{go&gtQW4V2x(mwyY
z`x!=YCrTnaT~6=FULi*1*CCZ^FoRgeCwrPgC}Hbg#W3eisx4tRcRr%Zl-Qz<sQWiT
zV`c?{d^wmAzr`O)EB`OL%uo?#1{qew$K0R)xI~O-b3iNEnQYptAVQHkE|QurX>x~_
za$iHI2MQ&?e5}bGT3l!%a)(}R$*}Qs7MP}~gZYS$)8XGM))?>~&S<6n)-EW#2YWg6
zO{sBofL<ct%Tc3;P_=Bk65O&x4$1r^8Y?jXA6iVAJcFO2HHzRq|5?@>Zw^<seW672
z!W8PeGtjQEVgwjYqds01`_j|PD^Z*7htFD+3pr~16?aXkl;Ww+aAYqb^L)1g+r~M<
z2n3{^Nh|Jw%2*Z*a`qGG3XDM#t*1<D4AA~WqJC`1ldiptC*3ZvjZ+*s(4b;F3BsY{
zVB~|&ZLmz9S@{TbXz>~u5K{7l6YlFnjJWUUNBZ1J*xfbwXs3VEnKUH)&~}XqMZdqP
z0{l?nyv4x(;g;wgtKV#lMYUR>M5wI;Rzp8zVPgz9htFB{>cC#fcz%is=br<U&#dr8
z#4UTdtgLjF6GBKyRwb<xWy1!Eck;K<=4+wNRA(~=t*HG~A<n~R+0~8jrWQ6%-YQ2z
zMe1I}+z|uY^V6ZNA@eQvP-bwfYGf}cvYMWCs6>KYhQ*?A%1X)|sE{_(Jl%ci2R~Fa
z<G}hm!@Qh<#uyvuz3beKKB^fO(lm0&Lexk_Inzjb$Hh^`c61i0LlVWq>Fl7MKy;Ex
z$X#F>8OF)*=EZkzB)JmEqcdW2k~sqyO>&?XDx?+dT$T1p1@=@}HGJ=fAp_!B3dbT7
z-6=yuR8upEihd>(K2(kF1*!E;44L^G|3T;7YP4F9N^>Yd2tm6Hx>x)}rbQS+LI_HR
z+k9uda4@IUWn#CdQH%LqC!cx134iaT$<2OUvU7NKJn!6Xc3Xi-0{)6M(b=qRnf&4k
zP}^~!VIeDn15FEAa>@Zy98z*mb4IcUcpo0p6KnuS8h!jJfV~RUnCI=4EI-7q(0ox_
zK=evVP=UXvbrfr-PU_TFjfgSTu^$-2iSUKu@86*}qEKx?w-7H9W5mbSQ=a&klq@4)
zpSPe2LGXOTAC}+3!5O+0SV3DCxFTO@EQ=PPZ?F)(VF)N)th~=G7I8l@_uUf6UFlo`
z8FV)ijGqg_HIIl?cIohwbXj6Q<&+~iNFk0bZ*=T;bi%NZaDB5Ibu5Q-TC#Rf4v$gK
z;H18x>Adwo=Xo>B{fg`)217Gy5ORySUj^71`M*Lc4+<a1R=S7hd$XdNcOf$W`Mh&`
z0S>7cEe89Uy;?<JS!ZT<6%~Wws;9KE&rIew4i?f0Fe!W}mPWobHmlMMMai$8^@ge^
zC%>9_f#UHR4I`jM-D|pedCx*0D}J&nFefsUxNteT=%Tox1U!VoWpeZ>g@ccBKG`qU
zf`}iprWw{rm3=h?dLv;(fnK>`jW=4b^q?y6!U_qnAjk)r@Uj=fiJxp5%U*);gyGsD
zGHXxhXjo3(6<c*|Hlp%*qt-L42!f;7AW3yKtbyQAt}2~WqRaUB;7r-Pj}l90<8~4H
z>Gi>nSyyXH$biEtLsbsTRB-Q*9hOGOeQ7R>N{0dUVRmyO(*h4sX7*0kQf4JVs75XX
zRHIHtUM>zG@ThB48l3B)H(WGZXpNU=h3Yh3SvOVCSiHwrLVcvZW<Se<-w(5$H9O3(
z;Z+|?ZIHmjpMB+nDXE8c2eASNK(w?Tx}Zr9U0~9rhlUiAlsxMHw;mcK{vIPuKYlLy
zzNU1V+OP?g106xdjc`fht-$aARceh7>|{U?afFV+3rnPoY@Kr5AxsZy4jehk^hKRs
zO2ePCN8hTfH^!x5s_2bDG2&_G_pokJn&mguEm4%&(D<YlFd!_!0sizNaQVy@v7%ZN
z^yGl8(mOLubCBv0TnvBtcgf%cV6>9vi1}2hCTJ}~=kH`M^|?gcchhA^fdO1$7gYQW
zaMn!kWA5CsV{9@b7h+|KQqcnrBShVTK3Ijm)2q|)r5<+|@ysrn=Qwwlj`97o;&4Ey
zj6Db)_lQ3^D2+DUeCzOY*WMnk4jPRvy_E>{v6VQ*d>pI9b>I&_+8Nd(`)zP&b+3kI
ze<y7ZDO%1f^&w`QRQNB`)Cct4fIjpdz@Y}VYBhv^<SJ;5Tq&&)69z#QP-#x$&T%UP
znKs+_M#_p|#vDpuxR(mrT|koR37Maj*50ge6>>sZ2C8#M4V`GO0@i(32VxYVwezTl
z#$P{N_mx_xm%qwA-ypm!u`2QUI?hgZ0{+<m8lQV(r#};637YNmTi}hMq1QUa+yTpg
zQ)wa?$mn36U+%dEm-^+5pVW!;2RoPE<=;|Rp&%ZS=X!@I=K82*p$lFGF7mU{-))nU
z_PvJ(+quWtW(PO<>wJ@VQ2fxv0!hI(`c7K3?ZppccP#e<Rdg<7z%~FO2^p|}9iNj-
zuzcG!4hrIdoL7zl`YNKu#~vaLp6>5Rq`2#N<+$s@iIJn#v4-UMH4lD*b~v$R3ze)p
z7pvT@v*~kZIuvKW7P5I?&5;9goRVCjs3p^>%}nD$vWEqB@wl;E1-uxQbeyu^3bae2
zygDH1cmePn3ZL-wnSU;aW>9U$9%9<BkJ`CO1<5NFY*C2kL?uKoi;`4R6NdDyx`LOC
zdTOC27UXlEhwhpTYdpkDpE}JIJety=(kF#65HffgR_dzDw80Z9d3G}W=mI6rk9vb5
z;I2bYhOi;I{81V?p!dKeldN499;>6~)hCvs6J+&`kkIcJ*@-XVUr<3&C`zx-1px{3
zB&`qu8G5rKRfvEB+o~o(Lx8VDufM9cc=@z=oBhf|!GvBd0dqQt(1lPUv=w`ap2%tx
z{)OUJW^|RDF!{4K$qM=;>%`j>&c$dSC&m2Sly8{2aX*d4U2>Vm;#AzJVX1#^=BDT(
ztWFgcC@U4!3WsIcCr!e`26AHShy4KmxYj9G7XTj8gO+?sHB7xKDwChnjbUTD6;zo#
z&>!s?zV)S(&_%`3NZZ3`T(3`4gG$D~T&GXCX6+kZ^)*6JTpo{7h1TUJ1ssrc2*SpL
ze}(LIhLhruZ(e2yJklQiC^meXdxzg7hXzFX|5^@x5Ri|L)9DZ|kV6N1_c3odluMR3
zXT(FvDy>1JkzRve@DB+0kHlVCs&lnH@w+Y4XBkSYk!P9H%72F80#l*FLx_~=aS^ff
z4F%8VL|v}Oxy-Oqoxt^C9$4Qrb0T;p^AecpyCEcK<1KWar`H3OX~ZMaama@A67Qt`
zpaqxqEg6PBs7V8PPEJ7L5#|L!9S8&o56}M`7c3450q!+4!6BMSl9NlK9KN6G3JYfZ
znFy8NMo>>an{jga+>IW2667*07KIDV=tMKl$cJasAE}MqqePs!zwbUf+@U~k`)iZN
zi)t{r{E_Z;J<es0iiU;6KDUdOt56R#O<WIzTmtkM(F0uzU@vDh$05=Kg+-{Y4!oxw
zkf#q-!UiGoV6&}?6ds^_@z3&C&A4ETpiP&4mu%1in>R8ysV`WS*uEuySQy8Gpmye=
z_6$?jLW4vI*nW9aWzBTJcCxJ+WZU%5x4n9DG}rgHjvZpS)fd~;Vh=qR?4j8vptsut
zd~_l|mY=|nmtRn*TWwrsy#bnkcWttVhO^j|i0|8E4^1zjCVOc40I23W?K6L($sSrH
zMl5KuhnC4#U~=p`l@e^Sho&M@s;6_4Jv6=7q8F)D9uFh8CVOa98z?<2P4>`qO0>xy
zT7L6j347?~NebITf0eL@7C3?+y2&28$sSrxJ){&m{QoV7rZjFYP4>`$;e>fFV3nKf
zp+)|nl=(=LJ+!!;*10BoXi1)p!n9(wU`_VWBHmIQ<Tu$vi^c`!P?J40WbS2iwxSfL
zs_db4i7v<<I;K;%uenBl7^&5Kb)8YLp6pzwphr+LtK35H2k(KqlfX#;%~e>(K;}UZ
znvO;xF4=1QBc9&c`Nytjm_TC)2{*ZC{G{)s>NvFlK6T&BE(pc#Uk?6PH2}563mG7J
zN8D8fbyI0bCl%ycw>=mhRozs3l<A7k6$UY!aD!C!htU(XDkL5h-S&E=9Er88JOz70
zI|*)oXP?jftu-j3Vk~U$mmz6@W=xQ^6Dz|U`kzDZb0rLceqc*IBoqxeI}ztIO&vyn
zqaKc%-znF7u>5>x7ic}E9TR3d$40Pt_gs&=cb%wPzg6zmg><5{r`^x&wUi=&SwA3<
zD^4BCblVWR2pI$<0~k&ri5IesgF-e9kxl{x3)u6HI$G&s?uNfe{YFc3PoJI0v^+(u
z9zO8!Dix~4SJh*ACvX3h-BHEf$*0BzH30WwuVOTX{FN@MnvrTH%JM4a%2JDn6HOMd
zST^<X3<%lP>I!>l50DfGQIcZHI|>UAC6ybJ1#5MTmeAV-@|l;bqO>~q_VC+vUad5v
z0UfsLos`9Dzcu+oi=ryAMSY{mA6l+Ys}MA!RXPC-qM0nMoQ^cExU_QLjEh6K{=>D^
z=+a8~XcWXhV){f(4`qlNs%YGF#%c`gk;p1%z$0iNZE<qJt)*&&bvh4h_RV+!60!`j
zssh034V93|YBPny5_l47<ki)53=)ddIhJF_*hH;`ei<xf3&d`GB(VjQw=DEeh8xc$
za_?*5LfOWAnqo(VHt!r|k_gaZ0n@kM3|*w5U`~6n(S_G;LAzNIM|Tl_JYQDuZ|?uf
zS^N<hhF~86N)C5t<RMAc4U&xlMSsczy7Qos$~2hWs9o4!hgml~^$EeoL|HXRJArI_
zZtF7HYfC<u-rWPcyL9LcXsKg1@aAy-1E||7i3E4PmSUH}9(v#0a35_n0wEhOZ6wt{
zN1tSTV8;u*z#>|yRwv+vSP-Cv;*fxlJu*$Yl|-{|M9sy+y*06Icujdbs*y^2<sN+P
zDI7m}IO&Ik?kII#4Sg8>$X<!k{lDdsFm;~AFK84#c&xGNOpxslsG<}M8u?i0$6MI$
zKlTX)RHi}Ji^O}$iBt)+Mza<qMSB3zFNCczpoFET-QL7tWE-an3F?O%!<Yu*6zK-?
zJg2}8{0un-m6CW+5+cfO){^f;lNwaa|Hi7W@A3p=hR-s}tQ4PReHK;PH`4Bxo=H-Z
zOI!~WvWIn36)hQ2C#99CDr&m{v*mF4dEDu??D6t;6^(6GCs_%$S>(WWX(Cu&s>~ko
zk!pqotLHDbGDNLZM83RARcqr41bh~uF0zgRmvr}nHH(jjJ8vfsynzra<|GJ9YGkST
zG8S!C)2{Tp4wD6}VhOR?gH*?RT$s3BRMy9=J0b!=2YRWXCYdT=pE0z*YQ_bbbY5&V
z>i}4II1!m^BeAV3fM{jQ<3+|MUMth$g6A@N$cc<iA|DK8ypc-OuHJ-`sn^b<4`=i&
zcD(|OwO~-xKaPI<b%LJXOcDg+*W<6qBRaj@&#lQGy2&28$sQW2!Qhy0vWFHCZ<L&&
z$sSrdbfhv7|Nrcv$DVO-@!VujsYyuNr|f_kw*~Qs<Er%RTYO^K_BtW3xUh~d=Z%ai
zJ!9VM^!NMz2(#VsyZe+WD}SH3%)RrNtZ}SgSk{&Ut{XkrbLqwh^`AbTU#fnD&?1VS
Mo&5Ri^LfPo0VWXwrT_o{

literal 0
HcmV?d00001

diff --git a/demo/documented/bcs/common.txt b/demo/documented/bcs/common.txt
new file mode 100644
index 0000000..7e91683
--- /dev/null
+++ b/demo/documented/bcs/common.txt
@@ -0,0 +1,55 @@
+This demo illustrates how to:
+
+* Use meshes with boundary indicators
+* Solve the Poisson equation with Dirichlet boundary values
+
+
+The solution for :math:`u` in this demo will look as follows:
+
+.. image:: ../demo_bcs.png
+    :scale: 75 %
+
+Equation and the problem definition
+-----------------------------------
+We will use the Poisson equation as a model problem when we demonstrate
+how to set boundary conditions for an imported mesh that includes boundary indicators.
+The Poisson equation is the canonical elliptic partial differential equation.
+For a domain :math:`\Omega \subset \mathbb{R}^3` with boundary :math:`\partial \Omega = \cup_{i = 0}^3 \Gamma_{D, i}`,
+the Poisson equation with particular boundary conditions reads:
+
+.. math::
+	- \nabla^{2} u &= f \quad {\rm in} \ \Omega, \\
+             u &= u_0 \quad {\rm on} \ \Gamma_{D, 0}, \\
+             u &= u_1 \quad {\rm on} \ \Gamma_{D, 1}, \\
+             u &= u_2 \quad {\rm on} \ \Gamma_{D, 2}, \\
+             u &= u_3 \quad {\rm on} \ \Gamma_{D, 3}. \\
+
+Here, :math:`f` is some given input data and :math:`u_0`, :math:`u_1`, :math:`u_2` and :math:`u_3`
+are the prescribed values of :math:`u` at the boundaries.
+The variational form of the Poisson equation reads: find :math:`u \in V` such that
+
+.. math::
+	a(u, v) = L(v) \quad \forall \ v \in V,
+
+where :math:`V` is a suitable function space and
+
+.. math::
+	a(u, v) &= \int_{\Omega} \nabla u \cdot \nabla v \, {\rm d} x, \\
+	L(v)    &= \int_{\Omega} f v \, {\rm d} x.
+
+The expression :math:`a(u, v)` is the bilinear form and :math:`L(v)` is the linear form.
+It is assumed that all functions in :math:`V` satisfy the Dirichlet boundary conditions.
+
+In this demo we shall consider the domain :math:`\Omega` to be a model
+of blood vessels with an aneurysm.  It has one inlet vessel and two
+outlet vessels.  We define noslip boundary conditions on the walls of
+the vessels and aneurysm, that is :math:`u = u_0 = 0.0`.  We let
+:math:`u = u_1 = 1.0` be the Dirichlet condition on the inlet, the
+outlets will have the prescribed values :math:`u = u_2 = 2.0` and
+:math:`u = u_3 = 3.0`.  In summary, we have:
+
+* :math:`u = u_0 = 0.0 \text{ on } \Gamma_{D, 0}`  (noslip boundary)
+* :math:`u = u_1 = 1.0 \text{ on } \Gamma_{D, 1}`  (inlet)
+* :math:`u = u_2 = 2.0 \text{ on } \Gamma_{D, 2}`  (outlet 1)
+* :math:`u = u_3 = 3.0 \text{ on } \Gamma_{D, 3}`  (outlet 2)
+* :math:`f = 0.0`  (source term)
diff --git a/demo/documented/bcs/cpp/CMakeLists.txt b/demo/documented/bcs/cpp/CMakeLists.txt
new file mode 100644
index 0000000..20559f2
--- /dev/null
+++ b/demo/documented/bcs/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_bcs)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/bcs/cpp/Poisson.h b/demo/documented/bcs/cpp/Poisson.h
new file mode 100644
index 0000000..a608275
--- /dev/null
+++ b/demo/documented/bcs/cpp/Poisson.h
@@ -0,0 +1,2584 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 28
+    // Total number of operations (multiply-add pairs):                  58
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1 + 0.166666666666667*G0_0_2 + 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1 + 0.166666666666667*G0_1_2 + 0.166666666666667*G0_2_0 + 0.166666666666667*G0_2_1 + 0.166666666666667*G0_2_2;
+    A[1] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_1_0 - 0.166666666666667*G0_2_0;
+    A[2] = -0.166666666666667*G0_0_1 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_2_1;
+    A[3] = -0.166666666666667*G0_0_2 - 0.166666666666667*G0_1_2 - 0.166666666666667*G0_2_2;
+    A[4] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_0_1 - 0.166666666666667*G0_0_2;
+    A[5] = 0.166666666666667*G0_0_0;
+    A[6] = 0.166666666666667*G0_0_1;
+    A[7] = 0.166666666666667*G0_0_2;
+    A[8] = -0.166666666666667*G0_1_0 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_1_2;
+    A[9] = 0.166666666666667*G0_1_0;
+    A[10] = 0.166666666666667*G0_1_1;
+    A[11] = 0.166666666666667*G0_1_2;
+    A[12] = -0.166666666666667*G0_2_0 - 0.166666666666667*G0_2_1 - 0.166666666666667*G0_2_2;
+    A[13] = 0.166666666666667*G0_2_0;
+    A[14] = 0.166666666666667*G0_2_1;
+    A[15] = 0.166666666666667*G0_2_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    4
+    // Number of operations (multiply-add pairs) for tensor contraction: 14
+    // Total number of operations (multiply-add pairs):                  21
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0 + 0.0083333333333333*G0_1 + 0.0083333333333333*G0_2 + 0.0083333333333333*G0_3;
+    A[1] = 0.0083333333333333*G0_0 + 0.0166666666666667*G0_1 + 0.00833333333333337*G0_2 + 0.00833333333333337*G0_3;
+    A[2] = 0.0083333333333333*G0_0 + 0.00833333333333337*G0_1 + 0.0166666666666667*G0_2 + 0.00833333333333337*G0_3;
+    A[3] = 0.0083333333333333*G0_0 + 0.00833333333333337*G0_1 + 0.00833333333333337*G0_2 + 0.0166666666666667*G0_3;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "485ee4abc20119b82968409dcd30845bbd75cf8eb2d37865cd36ae609240e0096d0047eeab6075652c6e4268052caed39792496313b48a8a3cb2824bcd9e32aa";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "c082c1c25a4ba7a938c9ca1a7b631eccd027000fb5b9464fb5a3a47fc51677a6004507ea7b064954f22fae9f9055a367b38e0d5532a53056ac02b6014df53e23";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/bcs/cpp/Poisson.ufl b/demo/documented/bcs/cpp/Poisson.ufl
new file mode 100644
index 0000000..187f7f0
--- /dev/null
+++ b/demo/documented/bcs/cpp/Poisson.ufl
@@ -0,0 +1,33 @@
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-05-23
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation.
+#
+# Compile these forms with FFC: ffc -l dolfin Poisson.ufl
+
+element = FiniteElement("Lagrange", tetrahedron, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+f = Coefficient(element)
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx
diff --git a/demo/documented/bcs/cpp/compile.log b/demo/documented/bcs/cpp/compile.log
new file mode 100644
index 0000000..ed20cea
--- /dev/null
+++ b/demo/documented/bcs/cpp/compile.log
@@ -0,0 +1,202 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0250609 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.000928 seconds
+  Shape of reference tensor: (4, 4, 3, 3)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  16 entries computed in 0.00085 seconds
+  Shape of reference tensor: (4, 4)
+  Primary multi index:   rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Secondary multi index: rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.01057 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000328064 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.116695 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000918865 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.00102401 seconds.
+
+FFC finished in 0.155079 seconds.
diff --git a/demo/documented/bcs/cpp/documentation.rst b/demo/documented/bcs/cpp/documentation.rst
new file mode 100644
index 0000000..0a1f40e
--- /dev/null
+++ b/demo/documented/bcs/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the bcs demo from DOLFIN.
+
+.. _demo_pde_bcs_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/bcs/cpp/main.cpp b/demo/documented/bcs/cpp/main.cpp
new file mode 100644
index 0000000..4cbcbb0
--- /dev/null
+++ b/demo/documented/bcs/cpp/main.cpp
@@ -0,0 +1,75 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-05-23
+// Last changed: 2012-07-05
+//
+// This demo illustrates how to set boundary conditions for meshes
+// that include boundary indicators. The mesh used in this demo was
+// generated with VMTK (http://www.vmtk.org/).
+
+#include <dolfin.h>
+#include "Poisson.h"
+#include <boost/assign/list_of.hpp>
+
+using namespace dolfin;
+
+int main()
+{
+  // Create mesh and finite element
+  Mesh mesh("../aneurysm.xml.gz");
+
+  // Define variational problem
+  Constant f(0.0);
+  Poisson::FunctionSpace V(mesh);
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  L.f = f;
+
+  // Define boundary condition values
+  Constant u0(0.0);
+  Constant u1(1.0);
+  Constant u2(2.0);
+  Constant u3(3.0);
+
+  // Define boundary conditions
+  DirichletBC bc0(V, u0, 0);
+  DirichletBC bc1(V, u1, 1);
+  DirichletBC bc2(V, u2, 2);
+  DirichletBC bc3(V, u3, 3);
+  std::vector<const DirichletBC*> bcs = boost::assign::list_of(&bc0)(&bc1)(&bc2)(&bc3);
+
+  // Set PETSc MUMPS paramter (this is required to prevent a memory
+  // error in some cases when using MUMPS LU solver).
+  #ifdef HAS_PETSC
+  PETScOptions::set("mat_mumps_icntl_14", 40.0);
+  #endif
+
+  // Compute solution
+  Function u(V);
+  solve(a == L, u, bcs);
+
+  // Write solution to file
+  File file("u.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/bcs/demo_bcs.png b/demo/documented/bcs/demo_bcs.png
new file mode 100644
index 0000000000000000000000000000000000000000..a38b45f81b84e893b9ab18b5a84a86cada9596c1
GIT binary patch
literal 62820
zcmeFZ_dlEe8$TLiZ(5sLZPiwr+PhS#y+`e>8Wbh5wQ99BYwu0fs2QV0?OChVTM=7{
z6(r}5&-tG7ADo{~@<TlG$bG+F_cfo_^SWN%={?sVCt)H1fk5O>HC6RNAbj9YFcA?h
z@WFt;at;EqgPy7?8NSKdTMGQlViF>Geb`|%vo!V1wZXLhL2Wl|-Zwlxg5Fgf<~bnk
z&>KVe#$!2#<;|}ix~x@vi>U~HMnX*(RZh~6ci-l;G}(z0Z0wme<hU4Fx)>}zI@-6h
zoBgga3odD^+*v+Ptk|gm-ezKxkg>N4&Iy)QMpjmyBNM~TP<U|dxOqhE?aSrsC(;nG
z>i=G)V6ZUt?Mr}|tm}W@HQW~l-MRg4;$s)++5f)O#{K_)`2VeV!du2A6@ewiymJ<s
z?Pt-fpyfAbD9P+^q50l1v9Xz?w+a!Uu|c;9T`%5g_OJftb{1@xo}3;V8~HmZ|1b<t
zH^L!gySDSVR`;#{<z@Wn<%-FlV|eZN4agFpU~yIgTTV_+x4=Vm*J+zgsLOus2S|0b
z0Oq$n*+WkAdIs3L*x0hD5R8V(m&1$x(la^VgJO-eY{{t=w|0M*K3mR$;%NKZ9~tex
z-J1xwUg$a|eVCTZ*E;q~%U-$V<wM;+jVrl)ag6D)E>G7)G=ayN{wM)OADo6j=bP$9
zm$o6*;#vA6J?S&F2Z4~?+MB2Sa*1AYY5~AcN1_GBu@?jpG+nD4ob4MM3t9xPelTG>
zlo@&+kl-xSPhKh9%jrW-f!!_19Ig)VYXPTqqvnl(PO`4SyWjXCpZPs0ekE$<JH*3f
zgg4Dnvpo}*5%w;YPO?c6F!2{d1C;v<Z$`4MQTY1C787-?*}j83rCIt5Jf)wrQ~Oxj
z7J*&yE$08fSGeC^aZ1nrB%d3Hfye$5zqNXC6q4ZF+Sg8pcs6U=8Zzv+iQXMy9<zpS
zU9qLZ+a7WjJnSLCx>+MEY~<Xl9YvZX2P00#Pudx7_18lSlrHHnoJwRtDnbr~8r(4n
zHdmh#O3(Jwn=QCG3rf0gU2w$9_N1d_v03R1@5!^+Zz*l&^QrX$8%zr+Ov)-md0Xwz
zwld}o`=6eEUqX%@zI-A^J@H@f(>lNe%E~?4cT%s%1!Hq|1lQljZYb|Xj4Qiwh(*$k
zD<k%JNeAYBmN$7d%f67wnB8bFRaK3nyfrQH^6T-Mc#|buP(i;C=KVc}EtNCHc*U-`
z&XoAQ_n&8e8}oi2OfHw0>3E*lX(^w<Y)b&>!Qp>;7;ypitArXcoT@$D%%ffqx+Y+*
ztB;;<YPWQ$ee1f^;*st5vAMe(E808%Gea40Gn6~vN&*u$d+m`$xjQl=ipSn?<OT<}
z*|bqP6m_Pb-(lz?M8BZ@X@5i6xbXG-Jon<E|5%}g_n)(xPwhm2NrV4)FG1|Rnm3-H
z!4u#Kg7voy^pRuK=`=^E+(xQa&z}`qNCEnVp-=O^92RFHbq5|cu33Kt_7~t0SWBf|
zWw`YVPUhNHarj9RMiJTdy^9TL(OV00=dksIwD`veN=-tF)-<Q0BpQsZUoqfr`!99+
zR{1>39*zfYv!0{T>?<ow{X*Lw^pF!!ViMc+TG#$cd5KMtttFLfFvXpPp=RS?dR2|`
zRjsMVyf_Te{+_j}d*rmwn|IGr*10pnq`B#+UsV3@`lvME`abtg(1g{JV+Z3V^QTez
zaVlYb*Lb7iaQpNcu^W;)yH?nA4Xc=Duf=_yC7jr=JrkeI*)D*MbpG2r^_FqI`DGay
z8%y_o990xbMg>@7c2U?^h(NR7xGtQN^eatY6cu9^&VAM4XQR>AW)|nBSBzVlQ^`sw
zakBnJ(0gO2`%BiE0eAKH@2ruRO38;_I6yBiudnW5weF@?g-sa~%Ewc+vUfl~v|{-|
z47+&=I3#-G6zuLF>!{4roj;T8Pk#6e?NE2&07T7c%4T|TGpRMN>1Uc<snJK-#{GKi
zT(<R8XG_*c-}?)&)$rt@4La04z=mDkF<tzb^|gTFtv4p|akSpV^35vy;|S_eJfDW)
zvVdUW!VZJerj@J)E$B3VoehNsOAX~V>n{y3I#AxyM<36r#%hR(OxvHZ`s|PCi=J$Z
zi-a&WAbzFx(zyU3(3}CBdv)@Mo(%D8z`BL5PX;vp0I~jW?CwyWXwqPvp$`6>Fso~;
za%vUwpVs2H6jsS$9#JcasRxxK2d3gF+bm;{_>{i>KI@DtA!Uz9Kp@f{VSqDCTF-wX
zJi36Bfuz23+ss2ZcdvR%vuT6g{KM=hum-5dE%gPw6~jaT55*O%mX;gJ{7aD^T#}b!
z5pAKhsL#wp`wVAab1G$W+KXBlY~EI5b=OJ8vqame;_qh`*9M+`!-R|jkteesKCorl
zKM`XFyvdvbaNY@h<Y3O*5CnPUyv@ncup}~vR%bv}G>vVc@!vk1+D^9cXq2F80;78=
zw9^s{;>4H32lYfnTZCI^shB!xJ)NSBF8{;RWt8AfAC<uyxM3q|RbQ&5>}1uC>=eoV
zeS8w5+isfK%RJu*?KimcuOoV<I<1UN7pd=ERSwDI&?79J@8VXz*z=@s+F}FOSjdPj
zT>P(jY|V~JvU*5xy=m%OPkN^3PxC(0scS8+5BiTZY;RbL8i`DWl0{F~*z@)qHWjmo
zPPx_u?VGxKc<iN^!LzNd7=bm+iTeR#6Y#Y@koz_MCGv5)lOuMCk$`R~He)I#ziu|L
zB_oQtq#)UlKMv1UZUXTW`6$x9cqnDTn<`=`!*KwT5Znu!%3jZ?d3<QsA}kxKIkLmr
z0k}y(XRZ~Ha|9x20ozd9{j6>?w!SjlQO}Jz81q!{6H<!n>#OwoMY;dJXr<0I2K~Fp
z1|$rNTx-KsqzjrBG(R(3c;?*mc+M}+qjD0zn#Ewg#Dv5;w0qzk{pKVEke>v?aIgVJ
zhJ2#=KV&;eV*?Ok!$ua5RoZN`2v0tyi#kk>uNc<R=szsEY!M;*?hijN-3ZVl-S|vi
zI>#|AQCaO!qU~?Sn{rm@ofH~puNk1M$m2ZSsBOIX!B}$vP{*_9TtL3TCXI$NS+o$i
zcJEj2rXFfAM|SH+!Trm8D<G)hgFei5zqJ}>{5mq$xK)+0y{qP1i9gp(Ygw(A<HD!w
zr2oJm#j`Y>H@^JWv|&XD|Hv;x<KhKX-Y*~3jrpeP_8@5j<c>~%pV?#rK;$0Q;5h#Q
zRxXPk`J=po|Kdm2X7KA~Z}7({AtnihI5CKH;D3CD2iKV~W{3&IJ^c9NxfcODb)wQ4
zgLKtZYoA99n^?769yHJm{*F!&;a}vLk9M?}ug`c@-SmTD_+1{Lb0X{_FYD^I&sPtW
zjA7+DxuI&@e=~$vh@>8K|7slf7jGdURxNZI9$%^ZYu9zunx~>>n<%K<<2QSkJGwE|
zTw4Lfo8Ra&L;|w|?#^7|X_{bAU+l=7n!VkmZO;Vzoi0_C_c+wlCiJP$lo0g`Qad1W
zy9JV3UoD;X%5H_1)L~V%2v1=PB0lB^39o?clxFd5zv9*twwf*#^0^x07T6(ABXNE9
z@~rHXVsPsOanVDrO9ok*u71ODo#V>x91WhPC3ctjvvJ+#Dda=<=1pYVgZ15^k&hcL
z))S#;qHLHw2p0M1L;_Y))+q1>g?|)rbBy8NW7QM=MJWgWw<Dxf#4!o7wIpicbZX*F
zj<U>n%ZLvuU_~*2x`;xegkIu_T0OApC-Hoef@F3PqK*9B-#}-sJ^QL?uk5e2tMs^m
z*Zc%YG>7)OkLM6+m&x@GidiA>B*nX<z8gabfI($!86Z%_IC;2AdfZRwFSsYCXTbR9
zpQr)~H;K=-lSy&7mgS{dUCMahUK+IHo|7cx`2&K|>v)1Y5;1Lgevc0#Jpz4ck*}(Y
z4YI`eT}_*)@b{nNs`WyO?4BAt(@99{%kv}Y(t*BNAIU{Oi@*S-$aDiXc9<K97Oj*f
zu6CI&ybv`Pj!q2^6QJB^k~IwRuw;PdnBpXp-y28=@z+zO!e59c8;O&p;ea10OM}?;
zsmj044k{-q)2|b9fT=t;e$g%nJng;v((rw_n3XHj<iMk;<Pt8{*T)w`5G^p}+pEQ0
zA-L=%6a*j!aV%oUEbP!Y`r8dLEAG=i8(&Qz@5myF)%y~<@jm_2kN27<--J1PA#24e
zXRBdR1Q6<lXhG0Xa6V4#-J}YyxVwhbkJJg7)4~OyrE+F?56KNQMY&i_G84pDdmk5X
zf8Vfc&N7Gobd-dm&ND)R2W0|``9)>xVSe{Fx`UZq>F`pD;z6&9y^_zyqyb#hssugT
z%?sC-rTz%-8#nd+iGDv(>EH%(DXNDJjO7PAB6<`}IG`OLE5?>h{lYGWB;V}MyK~Xf
z4_FN{6GT`zSe)x2yCYD@;z+Is1Ru~TzU5+eY?%>Hhi!a+p_;7U0B>7)y;j<v&z14r
zN)%x0onw_TNw-isB@UAxGm*WF-$OUI+`d6#(?W0VOg`o|9OG9srCK5%V<eTUvn(AF
z^q>3r!C>%nU&8XS27Cyqt=b?}hYO^DicsWD_O3Ow)n+;=Ntq?LVQ`SQB^3Y7;Ju0X
z5{`lgc0T<lGlZfZp$XC)7V(2de!)H4^szj+CS&|S<xEBQL#u2e{iUzRD^t@!p7KfU
zMK<(qXJ@DSIZ%XF-^OI)MsH+8Xsjzy`lJuUzvo~%<UZJ;9cf|AQ@n9@U08bJR5q`=
z*-2w1EO<2g_`UF*DR0Nl%7x9X_dW#1kIf{%5?RK|eq3sNWuB-$1c&7S?<>m{+TUj}
zn5^xzSeM6k_<-jbW%Rtch6O4mPTiShlSwRsQI%9rI&vHNPB}^%LEe)vnrI7w-32ON
zQ%rm`)PWy+FgSys`)ToNV!#0tw0N_THVQOT-Vi|-R>^x(O+;0skDUj-5Kj@mR<qb|
zc8EcGgdOpn<h6_F0r>r8N}w)y2-skO@q<Y5?bVG}7Wv=*yX#<UfD2OwOrk@pmOj8n
zYVEnS=L7Ej9^ST>^?SSmrHqkJ;}#U}-{cqsSmKZr+~H)_DOwid=tis%Y}1#edN#6}
zSe(@)MN{ZT8I=iOjK_v?VL6fas(*Fl{HbQ!JH)I<pQ`|l{tg>y9_-Kk>#f(yP8Sj2
zYJ^UwKhn)^^H?r<c}9Se;oXl~{>c2R3%^ZlL+SyymH(7uwWpD>OB}zjiuSLreN5^i
ziXrK9D7fI8*H;^EWGTKJt)XM}xbP~XDd(Bx5dEpzY9!Jk&`%C`%M8&gPM8jO0NrEk
z1E&@>`uO=bxC9if@%GO2y(zyy&G;{jYxQP0(j922fLUE3ML+UiNn1bHk=Y)kTG1r%
zHxSB}GV~Qy<2LY}N)Q<w<)g|lI1wzLC->;&Yu?}(_-5CcKOr`R9v&mGo&ITi7<o4@
z997Ng>U(BUF3@$R;7l#@isq9RwN%rkSz@=`sy9ea14l6n2lPl~alE%>QGOU}&9RRG
zfYDf#pU;+NxK$))R98$76D<jZ=vNQ(s<f7@F-;l`QkRYNu2t>2ak(?rNPJG!Vy;PT
zN)<|U*DzyB9=9+?_fGHx47&2QY=8VD*qZV2i$79ib)e@aHxK{YKUTJ(Ls^n_a^V%d
z06oKxe5zXz)?@2<6ZIUUN}{_s^yA$;DfvJ1W%p>qPRnf2r{P{wNaN}I4py+M|IRSz
zfaif~stw<7H~BD`S0>}@$8W=<Z*Zg>i~bf7K>GBfeaN?&dQK&t^)?n=Y4a6T7EexU
zw>L>x3dCqfS5`bpd{*|A#=}v1P+wC+r0xrEIdbCHM8T9XWa@#W6+}d>kx5_qF-S<7
zdF9{N>+w699nCKmMca{!j6vz)Iq!4ql<-8$h`B^!B@0Xg!jB2Tv!hK$;aB{~H=h4h
zzsSHNg<Ww@4=pw;{J;tmal6m^Ce1q1p3y!UaZVZwK8+K}kJX3#&7|ebwzrnqLCifm
zjBbaIzg8?Ec{{puLl68?Z1C>!NEbSKwv`m}YnauHem1-h&P`{@_7$<-Z~mKu(?Yh>
z5{1rHD*cihIx<xH6b?88?hH?D1$X2Yr7kaSnhLjAUS5JCTf|<tM81Ju|9`qwpP{G1
z(?cO0-t*`cA+dH5YH9(R+jPfk01+wiA$hK)={eB!^<!O;+{WjWBv)`W<bx)NKr5)|
zQE>gX+X1<_0-xh|^G-2YFTNp+uYiSF&GR&)5*nCBoYya`uIuFqMaV%YJZL6A>t#1L
zfy7D*+X7I6x~mlOl<Vb&%B|UT8Si(ebNVn6)dqhSes8L)%odY_Joz@D?7(57q^nHt
z_NguhSs(<Fo`q^dG0sdKq(FJ1dcj8u6q7qkJ}<mZ>Up*ko~J}1l5k0)9p_RThH4g5
zzV--=r$UOUlwCdx+kNpYe<pq&t<}x->E}efk7Z?MSc+p?YN4p3q=9ky*I&JW`#?k}
zeygeb`H~kEb0}Q==&O_`pP-lrpG-!x4*89Y&D^92y6~B!Pp9vOxlh)nB^Ba)X9}_R
zE)*oL<nqZqtr%QvURjw9R{PI_9YD%4*eK#iY(Kc&^nrNDOY#FnsfWd6lSAO(S5MF4
zXAC{!9Uu=73`T&|BsSwq`C6Y$=i>QDAdya;bfZb{au!JdUaWE4ZL0smGk53H^F$iw
znWguPQwv&g+M!49;!ReF=E0!N;yS@7f0%yHHfR2I+;|WCbbEG@ZFI(ek8vilDnW@Y
z_h7k$+mWN*CzR|w5ERm3f;`7O2C&?OelGxrrza<)eCO*^^RpU@_Kjc$lY%W3a@mg~
z-HG}?*KicW2-qVDg!QKx`96s(atVwtNXeM_hL3Lf&_j-9j31@?>7b0b!v$Vtu1IG;
z2iOI^fGasFR<ynSzL+kR6^xZ^p4QJkAU?V<kWX#Z_xhC(2RB{loy}zb9N38gLIn1w
zM8RoMlzL+F2X-$DmNV9MiylkaBG)8!fD-M~jQT_(IV=r$Ig02*_#T^nhDgj1C)YG6
z(rc}+7a!;$#XHD_Xwr<@CSj(=SH}yaT~59alISA-{O;ZXpXd)X!kRbr{>&GU)-wlH
zdDYdN^Sp~3P)yrRh|VO6#E~--!0cqo)PcoGLd4dbb`O5Vb%G#_byzf#Dsmf(r<>O}
zq1polt#zgn{L(wLVFrNyS`eJ}j^t~Z`pOqKW1Nq0NfB$DBE~UvjJ5bd4Z?1fHJQiW
zW{rFh6;mqMLUWRLI^Aej>Y>^_i?rx_>5V70@5CG=Vc+K~+Ff>V>GF17dS3hxL8`vQ
zX8_&(L4tT{%X`V9$QpivH_dVQ!sf8pBN(We|GUM4+4z1$eU%<dPERPZe6<qHqqBYY
z3KqSz47AoXY!K|kSBue}nd*s^@%14uD=Y;tsZ0J*g0a)Xs7xIqw3t}~LDO5I=F{Mr
zpTQ&A%sCXX2ew?<!jDttkIFQZit?#*!}z!&)#wJ)?R^|QeD0%g5xXHnXBud~%r5}v
z_A>!qPet8W(Me9f5p$+&I(}#T4iziaL)%opCQHHRT9O;j&DEQ!)I*T8<I5^MtQ;l_
z3B2>Id;Z_aeQOuknqQ}H2fP~c^wdLFTQq7yqDt@*Z~BtDLq!9X3iF<r7v(Q~f9>Wr
zy2elyf!H1SFhgO7Gq7|<c=JX6Bl6z6SeNZpZvg=D2;z6~;hLQP`aq!N75ua|!sTS>
zWh(;<MTJ8sO|-tJ;+17V)jfNV^$)i%x%Pwb{I!+k@s(IqEHldMDL-zEd0|wVhYI~u
z^EXc&@=1I`@fs;Lm5^`Ru7XznKo>PoK|%>oIv@l-zOIgnE&EB#cbSeaN5(j8`9S2<
z*+nr}R9bTMt5*+bb?2KDDe~pIq(Y1t`Bkp_ly}Gv@xo6EUld#YQDRoJCzip<t)Qxe
zo+Z){GSGA^CYcJ9S9?CP2tQAYKgfuUO-(0=qoSgIVK77~Pmz4e_Qq;lyxq@urrTAp
zNEhT^CNHZ(6BOPOKpj`I^6O#(o}#O$I!h*KcFv*QXu||k(0;x2?Zfza;G>(0LOl&T
z%I^8K(iOzH&p}h7@C^<13vy#@^^lq{3bmNRkIxgSiqq>&lKV$rF8Fs>nclwg2Pm(<
zAn}1JNh^xSO<sY>T=ivU?ug{WEO%uGKyJ(VZuF4JT9!4=IxVSwqM&?QDuK(s$#nn?
z^eDkqRSgqwG13Mh8zE@IddbKJr{*40m{%NSGfEYq<V*0oFrRR;R$$i-1dBBbOfffm
zcJeKU44t~}hW@ub`((-8R^kqHgUZ!~&}ZG4fMNv}F4z?+_W0bbzZO&pUSw-2t*sUM
zr?0Bo5cw59Gq%icMm)|~v~JCLdMAG^owV$ZUz;W3r6<L^BAah#gCJY+_bb!-$4{(@
zifu>>NMGU)Yv<86g!>oTkoX4rXg+}6ojd{uz^P>}LVq`5iq#`(?Z*oNfmE`OMVT@N
z&=M-HM3Z72zYOPAZj-C4y6h%O5cTLo<F>qA`4x{pM67GdZ2%icBxph0MXZf}KWert
zFJ2oauyS&>rS=8RF?&Bppq|QeT#53vIOhGTuJ=-5W}@K^Z%2^Gg+wJAm<)hb`H2Lz
z>G;OjoK}Hv=QphlpXyWsa@pXme}5*hB*JOH=|(Ed;D_zTHN1)+Z|%gjls5d}V9WmS
z28I8Z3`s<<V$MR)M6nrguQGe0;sxm7Xta#Evob;f-}d<wdmeWfXC70NB3pIvwjPZ?
zy43q7b02e)tzN6Fs`>-q^$O@72IYBzs63P8@*Tdk3+sQUmMOusZ2rxoH{aK-y5R(<
zVcJ<69f3yy{ZoxA3h|TP!T;s&NW+BhaGRXy;QEOw$CS4sE%G(&4u_XeIs1#vx=>L-
zPk*tHMu5(m>^E2Z%XhOx``)_ru#OWy>Bl!acCk&XIMBR?_OK`Sa@8K#G!SmA5X8M8
zh0~im(0m!?b-#W;?yJ$b^#k8lj%17HGu!aeStlBe&RCWJe9?2yl#A2NtezXeL@v%7
zM;3`cu}>e<L7lQdF(NF6yJW1xO0AUfyr^<92#=FAa!c|!)5;Hm@V1;1Z%hE_T<L&*
zUE6BHXWq&@HgEBzjCA0N4My^+ktHAKG9uLx<IM%au)7dx-}cVyN{ux%ZqVHwTd%1@
z5x|WmhHsxr1|_8`@n|sc8>10L;M4DTa>Ns?TJ67BD|UQ5Igck3WQdBcg{w3+&soQ}
z0alvL)EivzRJ<G`T{4sx%HRX(zHg^I`<9DiGlHR(S|%&3cVk5hiJwQ|1$AKNehc(M
z%x;O5r<bfk7ZwZAL?*B&dEEI4N__&fT>M?(g6b#}X1y4YVuMm*zfHBsjdui2)-;kp
z{(R&5TmX7hD_r>#J?Bj`aZhx}{Nf7^NVVvCH<?v0e@qMMP;_k(;`Rt^G6-Koke1j0
zWjz<gJW&7Y%;3i>zuq$5@kPDq<xYd)>Uq7P$fHnVBWRyvx#=?0Rb<5_!)(Ro?Co~E
zrIXavd3fGZ+hxwSV22As#FBQEGloF)b3<=#*0%c2)`ClmZ`8pd(`>uDvPMtgAszIh
zSn>VAmcR{~<u^&r{d=|iOjR))#*(e!X`yoBYO90(o=b`5V}0&T>Qmn1_*Tpi@jQ+X
zwyz4A)XPX^IBqzniC7g#<W!wjWhu|4;p80Sv%&w)4sTAy#vX8TYGK>3(<ol6@wFcX
z-1*$=B{Sq3Msj2m1_8LB=^_fE$^|-RX*b2hub37;@;~VP>oY>TEav&$pN3FS9Yv>X
z`D%We?|QwL{^hJfX4pN7L3nqaUA2lztT^cV)v7#rf?_=_e90h$*&2Sc_Qd($8Nj(0
z-1_M!QyfF%6(hwz?W)Tjrpa<Y5sVw(m2(3&*IKQ*$<%jjA#gBEV7%I8^~`&#>G}z5
zfkYUzUbO>R`3E_2cC6;AWo75ML7kY-k8jupRy!QXmxYLnI-OR-VL-hd`<w<#g}6_u
zv4f?QG=0`b%Y|@foB8NrhWniA;u|))#iXr4(~$#)r5{UDKe8?CmfD=?OmN`}!^qfo
z9{Q^fBTZ()>(<6XjL4h)#n08}{0!n^eiYlxDf~fq*bJ|FV%wZOSm}K{R!LOqBoV%0
z&lh*_;E*)Ls{zX5Q65!&9mj)8rXHY3I3uKda?QpW#Q%!X)a@m6?fj1SJFi0prP$MZ
zj_e}iKhw!rbXC&Ao|g4MxKqOhEvNh#=XBvP3X1YOKG4paWN7BRC(u~=-+Gz6e2ut3
zmoG|osCImV0EPTNvjFN&l_c-GS{Y2xr}rh5XOCv-Mpb{4|L!GrHaKDWezS;9MMS^K
zv1up2<Jt9rTY5?YdDm9OR8i*g$;h4Qm|fAjZ<Vd%$^AFde{#JshnU*h+M1_8x5VY_
zR$s<CZZm4J&p}k#;}7y!uFWKAq}0cWvJKJrpgRTRL7X2$m*_!?rX3+H;6EZ2D$wNc
zSJuNq;2HQ!FemF^m*34;3c@19i%B?7o7nSmA|KupX&joIajPpiEKvOYiEY8EO}jxQ
z(fD<oCfHSha`zSDm#rZ;EINKX6h$5?^Ttup6s_XN&hW-ELSS5gOB2o$OA&i_I4)n^
z?GyKc@?t)jr6>rfd~~DknYax+j3l<othq~u$!sOtdWuLM2n{9*lA48z0?3_ugzFZZ
z7E>y<lfZ0NXC5G47Rl~XXTzdR@4Y69#bb~om@tcPJDtXfh4}eAq#_YGea-b^3Sj6*
zJX_dawy-(Ilj0}}M({qMpe6)?>o^^)JyjBQPF`}7$G4KPRD&w*z6&X{)n>adEK|s3
z?!p`4m_AqQC_tVPxAGjb4Z)wgBZzDA?ypJ;lMqPp=4B=_&NgaJi+YX?ly$J%;Xoky
zoYZ4AflW~`QJTG#3&-?#HHDQKQETUxG(>+X!G(b0T;Xb>*$dPngBw6OtyzQljYcbY
zA)NpxbGpSAv}T|@?rXcQ6k6E&7T@v9r^G>G>4%aDG7=;1K{yO$bYT%lX140`Ut}I3
z{0c~Ahcpu$^*5ti4n26o+obTuvEyhwUEHG~_|pk`m<;X{%H&_CD?LE*ty+p5+jzlO
z591dm&hrniTo6R)y?CDZFxtqEtkn)wQ)CnQzRQgPq*_vY{-4>hf&lCfYa;%gA{+o*
z=oS<4?+n7nVWcjxj%eR;(F~^6!AL~74Bi!Y{3e-+hV3EDWy}-Bg^jc_YJZhi06KLf
z=U&7Bt{FnbFUHMDl!iQU)Km)8%eNai2|`KKVOjvDCd4CCRP|wvk|LO5^}-&a#>7e9
zGMQ^reMUkIH$?E1f%P;v#$cv6UpY5f{P4~SsWLj3hp>PJF@4L<Ilkj(ue=${889^U
zvlp>v&UZFKpV}-$O5|JHoxH9bSo+7H$M~5vuLk#ntpq>ja2g-7|Hp7fv@LJSuXwff
zP*M&*q$k%!XA#71f(tUnRhsRPr|@GLwWlfv7HY<v!^hUJ;}IiNSlR9VqP!Vcp|OJD
zIXJi$?7THO#gVF^ZheK);gmu)JE{)BUGwgK3Y9Bh=1dXpHyX)sjTM__K)xA%;fIS-
zg_tbum{~LUTSuR8vEx6wmDJ3wVdW}3Nv0Rh%6mi)WQaA!d}on!BTxLfaF>`MoFo|T
z_|W67kr5$GkScE=UM&m}T}R{8s@1>u$x4wPxIG>KQJ-tGMqKg#S%TsH*-yM){E(xj
zstTdGy?KTuf!qOQ#oc9v?S~CutM^sjhJ4dRa&gDC_!IZ64rh;Wg~h+MPQYDl+iP%H
z-db|%Q)MeMp%DDmD*j3-`DfhfHdZG3{<&dS{L@4bYM<9%<R@kWHu$ZR0mpcLyF}7G
z!uvl&K#Gj5WYmMjJ&`%#mc-vdc~&6UF&oN+AqtVxc}=Rw`Yx^$cEulwjE?oCUUj15
z!30%oOXlk+7KIr#GMX0sr~CT>;st{9hcA0Rm&_l`9&PC9V+1FX2;e_3F*i4oI#=p|
zn>@$%n6Roih`uaQcaHrGR}}`?O|$yvTa|H*N2PZfQ==yG5`GH22Y(*}fj(%_i;0(}
z|H{2#Z2u(lcPf8sN5qF*0Ts<up+>Jt578&1Ac3Q&Zfy#J?XbHk_27b9hM}h0;b+Al
zMIiks&y2!^^VHe(<3p*+><~}8Vm~MB9u#@^GCKudK^6eD)AZop|1it_{57rX15K5x
z2pN(e@r=fW#41rLj~R|W)iqT{*<iN0^m;=&(jH?0!uD<D|Go;Ld@v!17>pLY-&{=x
zVm8;<>1f;{126YTe`<{3Rg+}^E*L#n-i8nl!fBGIqA_w@#$eyfG4Y<i73^TbpKAmY
zlFuMU%}a;9A#}nwHnPY^)7^mOHhIIn=?;O>AVkqE<(7WEsvDL^#KM*JW@tto!4z8J
zryNJ1QNCt7R7S4d$Q83|QB}_K_uzs<RR(4DH0qpGQ4HK4TABATY&|Haw3vJC8gIu(
z*nxGt(8mUEd<DABUjtCaVr;ki|0FwQGd^RGO)6u49Pb(VJ8C?FhKe3`>f_f|Ld23I
zW$wUH|N47~%nZT71&^x5Fp=lPJ&&J`tM>~?gE&#yqTta_J~<!ooa9KH>0y?b_^dOa
zQhcs}4fk~SWmXSjE(zGdR(M)U^bn7)k_$xDq>Tb2tyCmxpdJ7gH1t&_5H=@Ax#Uh5
zPC^zo4&I1_zONsUd`FCMEqOfk0P!ksPnV!(h<H85?{BgU-qzEy-U$QV?EnKPhHVs?
z4W#K2w%fHtrI1qt_Q}LAeI}K~C#ZW)!9i=F=cnA^ObMT%Av}33mTL@DMK*3);D9$P
z_W^3`rQcEuo$VE)DMUTNu+aO0goizaB?1SuL0C93i^IDunKI<Lvw|cP4dDjnkxqF1
zEwPwDa>DEhY4U)gzY>3hDV=CZ^JGirbPtoOezh(<rSWw*ep1i230tCcE}fy*>T?hp
zX);yG{IgnHuRkwwwq%7QIoySChoGQR<q=xNbB$gQ`6$bo!x&rsPV~IQ_ADH?U&J1a
z_wo#osahP>5djVTN6Pg1+#qTIXW*%=0xgg_z!s`+&d$zqhQH(mO8WHcCI>km4Sa~4
zyC~?u<A*w~&Q*AS^bt2@jXs%bMUZxdwNVB!_&VAgT3|VQ7rX!4s>a7|1OgO>*+Fp<
zu@Z=Ns@-t83{4(W`uw4!?hD=8yDWl4yEL}_Y0w+elKdebo3a`OGH-R4SNexBn-*TH
zqk5nOW7wz7z%#d>J1H&gIhsn@uqzhTCm%@jxH&cU*_7znWdM$%{wBF?%Qpm=p1H)*
zcMY)!9z?ktwNy{Iri%Yh*5e!t7*n(<okEjA8jj)(0Bl~s@6!m>g=wNr@eJ&Kl7Y@#
zy72Xrwv-YT6NmphMdD4{A>O%pN?SVkpD88=-JDbb!h0cVi*<i-U+E)R*nse=+t%wc
zB9?p*z9+XJdzE(A=ap%5-3FC3*j@I5lbibMMF;&^kgj?_#xH>pYb5ziR8a4LGegAE
zmddI1RPJ6y&pbFFF|DIn!8ZU9o6`jaHh5vj><Z{UvAty}=sz?%i^hr3?)<7|yKkKM
zkYLqL@%P5!-~<hl8bsDL;$gcw`X}x8^nPk6wP`e8mmlEjcz)<2hAQq=`4xn5JF=1$
z)S?3)!zOo~@NbGhpCSuam85_WG|d2O{mz`7YSxw?Wu0y7RQ1TOXNAh|4ldW{&>N|{
zsQLVP+@)vwv-equpv%<}(qlA}wf(s--kR-)3ZX^;@*L#*B{X+r3~0y7{?EhH!cJX=
zV{K}QvQ%}IG&C+N?&P=BI(WWlHowA0x*!@>Tc*W)17tINRF$i8T#@8=hS<j{`)vIl
zEu67%e+*R^yxn9JmOYs<OckNw>59!guF%H=9E(q*@ZWc*%`G2lsjN`<Kn0~a+$Da3
zCV7I`??Rwut<m^GZ=Qd#rUYLJg4+E*dw1xe_7{(wu<6rHf&~n~`N6*;dE}f1R>!jj
zti+aSp*UUTqtUbmJ>>Gt)lcD%dzGfRU+s#G`8H!jhb3`O?c4EHDSv1U7>yU^i=aPj
zQ$t0ZlcOz(<*;v~wyK7-P&EQg6$g}rrP$Uvz#l-~V~1cHKVFZ20_Bl*zZCTx2Y^T(
z#h=X>3#sw`Fwr|ge@CKeT|+5E^SIsJ;S~?1%*G!mB2Q08Z*InA8Rt+8A5Lf}hwedD
z@JKbrgb8*zkuIkZv=~ma*edvbbwqJO?-KY__OBcC)b(5uiXj*6#M=5)BzEYr`dLk+
zpmNN~JK_m~31SB(iK?J)c1Af2o|&{xzFXh=!%YeN5DtgAn@_R9V!3LlvHfzAmvyvY
z5tEsEFHD~0=3zOPiE<4d3*wg#YGerocRDA)nj+~f<&%^{#@n^r`$FN3D#N({A2dvc
zLh2RkH<%0wqIJHGS76-O&$wvLtZ*C2#PIzNPc4Nvc;fL|L8&=<=0R+p`_fR?Q`U*E
zQ7iXH?|s)bNn`qLug8x8oaxhTBuXKpkO!g<2xhu=SS^4XOr|*V{DP%~^qt1d&-j8n
z4=<ncd=5Qb%UG7o);BID?Wn=Ed<y@nD*0DBzY{^DXLI2>Fxnd;Q{OL_w20hhlmp5{
zM1wsx#uZ2M)ug;i2SFa2?^S0xfklvYzM(j<+$6OIqN;@GvAEx1)dM|sJHpOkUIZ;q
z?vcvXR~m)9_!O%B?<CczqWh6@{ID3RqR{7D6>b4K2O*_~0Df<}!4wCG0RqtqDzt96
zM=ndQDJriVtrb9E9~!6kH8~_Mh~x$2E^)xiDP@K^l<9St&&f9pZXpQX;o?&zhJRN7
z#HU}(UAm!W96>&mieIm>t{IP=ATs8vAOAFi-g@sw{k>$_!eq0$#O5&Hik0cT7UuQH
z&r-LkS{X87kWjnJrDXaF^OU&4?6^VKU0Y>`Yq)_GOc1=Ls~fpOdq|0@E~HRuxV`hp
z2dqD({5?s;wf^c=e`e~(TZMX8UJySnjw6+o<St`wcQJ1Y0TnhDhN}ewL1^n(!X-zH
z7t^O%2D;j&Pqqd~Or0L0kg*@7EA?ri0JM`Ryn0yh(+e1~I%qrW#GtQoLs8pY8VL{x
zBr9M!@Gxk$Ep#g&bSs=xP>Qzp&3`}MT^+(PomU4}^JAg@i1GY8+|RRK^)c@Lt`0t}
zw7FS6?>yhBtbJarPwFS`#;fcucVh;KnMI;={mx}JA*d_piRzOE^6xW$I89U<`tfZ+
zlZpMUdh{?H5GT3j_uz<rAhgPJ``sf1RaY?11=8$Xc6K&<Lmd|1wu@$xPF!wvuf*1%
zX9jGv_%ZK|lHC+~0G^d2aKXn4cB7z2Xiw3i+Z)(gdp-%^;&uLmoLIW@;DeSegIv_~
zSNq2|s^x||eazm&8@~FZi<-ml-n|pBXnMP?ZBxJhBakgk$fnbEsw5G5y*|}>aBUr*
zNrf4WjWtg~9BWvSkaB{P@%g*n+f4SA=I#GLk}56&9b_;k=>$F?R`^cJs-L67Z@x1H
zp|Y^Wj>LOp0Cj^220i?HoMEk;s5U7y?xOhpigQ)DrtC&PX7!p(5mS;lwjDw>QQ*6k
z9bg@><o9)(Ua`e;xjpd2Z`MlEM(ukkppSw$LDcn@!U}sWuGFjlew50emN$3odkVp?
zk6qiC#JRC4#`q%}>M<x*u<J~;PQ#RnE-BjOocpvo)G?x#UBCpM8r9hfE7v@z9>0@M
zU*WL&Zea=`_GxQYq8LoYheKMx%6UgLJLO)S*Q~&oyV{98^W<`LCms0-T}xo879D`?
z>VOzG>#D|$MNrDWnbMIAT$GcOvuO5WWnyBwcW=2Z;7|d*uF$zDUi**2bFpcE$Oe7<
z3;t)hBUsYwkLlBV_uo}5YthWdm)F`t9b)3*r^iD=hjU-o0aeIe?S1RGLqJGa+p?LN
zoSZ!6BkpF7ouG7k!09LbHzR46eHO>qv$S$R8L3$F>`fC`F6CmPRE8o%_MzVPtM3Yx
zi{*M~I@MsWDef!D5Vy0#h|Ms>H3>}f5iK83<<U8q_?2Rm-kFSOs?^|mAj%_=d>jSf
zMF2&~b%XnJ!`cgwIsm>X@XwKZ*Q~4>7q;6<Zv~lnJtjxETJ>#oq2=|~<yJ16yq&M_
zaW5PCsL68?1o88``HvoM+EnHBDvXgYMGJmC1i#+<hE|Z5{NvM`Dqu0Wo&IyVq@+Z`
zd-*M(T;5_3kRRl(k9td7b6P83h~5S@{9k^c0#PLH(ZhaTwTicP3;2+?iIu>k;Zi-`
zMeY1cKjC|gKZQ%I1Eoa`bDn*pOb*vnY5>#e0nhR8?}9gSk?UjV?%ZMr#`l1a6W3=Y
z<UDYjz6)61ZBhv4A#r5_JvDL8_M?M+{rVM-xq>TXq+RvUck2DBJYNnzq=#SpoNFh^
ztFHD0{5N1Fr1@MpcMQ7DydqU>Qs~r&<<3NoBT~>?ibbR{rgWx>+*KDl`yYn7P^ufe
zjWIjiax|>4Y~dNY?1wF5Gk%oDCVg5At(!k>t?;U%p&{MPF>UY{D8I8eucNoTu7ov!
zL;=H~YB9$Wg5OuecWc@N&$1E{62?N$zAc~iQYy%9&DMKf0b!(~`6grR?dHuP6w{#F
zf=2Cnw`|aPx543X!wPg>)=K4zPq(!j$3wk4uuo166<<Q`)4cO5@+eEt&?R?V9YmUR
z-u>YlOHtNqsp*YFPIk>$H59HvQYNNA2$@6*FzHd1=S6!zh_(w*m`1mDq?mP|1GWwd
zdJnK&vQGjIkP?Dzd-VhY-D#G-@0$Nj8|aQ)Hr{)C)Lp2N$eErL7(Lc{x%tJU#*%pT
z;@>)@{KYCyE0ef1))iA9OCeRQjEQxkjLJd5hB^c_u7TtgZ$nRBn_5xNtt{cR$jT^w
zR$GlqZd-@C1w5d*rZ|y5^{ISveSq*`AZYlM6e_1Ke$zAX3Qvj}2h{NU>ii1h)xKj?
z>*llRZgXYs-8+=^T2x93;n}_=cj)S!yPbrU;tHyI<+zFM&1#qdMBL5y`Z@=gBP@!*
z>B6ysY0i|`bg_}`rNw1y?)~FY{9SC5c+~rG1(Owyh*h<5rU!NH?RUHt^bUWn+yK<>
zF`2o1d#yZqy;EOW9<y0rK;b-Ph2!>$8&3u)ZiveYeR9KGz#yw<qrX%e8XgsQ9@Ba|
z$y>hqNlQLj_1Ai+;!AmGU(Va(r{4BAsMBvj|1B<`HNnxlaDt;@(Xp(8N`X3srx$mF
zC$5H{mHIn@uqjx=7Pn#|sG2s2MN_3He|Jg<gd>MDL9jm^&qND5yUJA~RMj|k=bvF~
zAO%hez&TEqSCc__AN<Cj7Y)>ABUYXvXK_7M?i(KZ;p{wGt*$WAV2xOyFS23Yae-o<
z1>?VSc_m7=j&<N?qg4?3TI-IWQ6ZBI&)uxoqZu=I_-3}Za-rzER`HoESi(U&dF#Sn
z3dcq0Xl{Jt2ZgB|MKVPR9G5-9mg{DVbC>&pr-^-?KTHI|_%d+6Knj#KSSBzrdzA_R
z4lz<N7)r3dXWMz8*GKzMj7FZZ9HaLqUI-WL1ErQN4wY%J_vy4@rK=%r(UBb9kfWNQ
zDQT=3&VBpuC;ix^%=$W-1b-+^C>PjO<%MyL@S#cJ!~Xx<85QtBayVaEK#}L(--(lP
zsv<M%z;Xm@)f;+}hbj&<u9XX7d?2E-H0I?5#O}?EStnS=?6SMx)-!gfq5C|-hNR{*
z(s_Y~pzF(w^xF7isg+v!Y5cC}oU02tPV-D4ww+}kzU^N`$FE$(OWTyvNSRcXv4JNw
zC3X`J)3d5-+~ncd-C&QGn7@BTp_lMv71!xHO;9P#>5{S&mZK?KmH-0XAA*<8cXj1%
z5JL4AJ1nR21luW9pSiTXKvm~HG-uTz>pJ)rikc||@HGIk=P=JyMJ46s(c8LE6l%Bj
z{9fmQUv1mjg8SCnM&EhNi@B*O(MoP7k&H~f;j5XlUth5kha$%+3Q>L!KnUL=Q8Pg>
zOP8i*3sWmm7h5ai3k=xenL?Eb>*n}M6o<ZMHQ{~RA0uvbat1XxgX6_|;J2m?q%se0
z2&~2rzWL;m?>BWIzqIWKY@yX-U0g4|z%Re_vq9TU`45)b0?rSXqQc=28{QODpJeAN
zkx#Zp4UIDx7x$unaifPbWzx5`F$LqZ(HGm{1njB!G1`hZx(9g#WpU#a4$i&wM8zvb
zBy}=-OC+%6Wo>8w6){Qz0yKZ~rMK-3FNg?i{(%0?16xH(l^j~KqkB>JD&_cOX^kTm
zyzk%8@oDRx*Q0e+rvmrB_8+wF)?{WY$9jkCT9{Y|ZiN4#p|;2a`rj|~D~&v=YkR_&
zC`v}(Q-GpDe?RQB<{t}L<mvL&ZrYgPRerPr23v52*Hfi-qGg#2_)O`B?o21yPuAky
zpO!C+pt4e2SgF><J4yNiP*7RZiyQ^TTJ9a5ixL!>#Zf)L5vCWw@h9|Mb(g?sE&2va
zIvMR50g#2s{poeZhYJ*}vu9PG9yWYljwyWxFE#TzkpKzvRw~X)D#r~Z`qduFJ%e09
zQ7VD`Ao?9uD%b;dj-Gg=XQ=I2=acDIP$L2MfJID3X|tMY+&ry`B>-~Xt@kIgDTKaV
z=?qC}DLLpk2cX2c{81N}`x_0-&&l!!GU~3I-e0gt`}b$5rzt=iuDg{;j`nl1v+>1g
zE}|=NVbK93pAC#*F@G~*$cH~+Jjrj$c@NJ*oVoY3{?(-sTwtH1GX6^s7UI5IR72Qz
z`{(BZ@Y-org$*^{48Pg$?(PP(&nElkh|lIy%W)}>JLk=R5p36a`l6;&IZkSVGqv+T
z%Lpj%g}<LDTDtGne}ByvKTiG-M^L3LK9ppd&_fQtvDTmDrA&5Jt6ym(&II+!nXG^u
zj%MtJqQqLH?OdH;bldKgM7!7TS~XQ|>)_xkZux)jfK_e$=N*@GV(tYYfMmGSvrH?X
zbUUo3OwaKw7DDAWIHA-ozC#EOCa(cFXH_~*uoQaObPC=87N@X^WFi)fLhC?<(*l%U
ze{2h}=%EG|$bF5rS;4o;kLH^)Q*wYk`>(7_3w1g=8zuidR9*G;%*@Q`(qZWNNA2sU
zcugMjFBknP>#4J~u&Y*cG+%moUuL+G{k}7S(`C18YfDYi!5B+sYp5L+ihh;1+gj2K
zhMnF;O09xmLDXg2?ZpOyoft-d)c`ncOMGgJpYiTtza7hZ8&AsKk*N|U5od44-=UZZ
z?I;0Rtva)*LPT0yThadsp?enP{rBcnDCHXJ&Q-L@v5`2AYJ&DdBykH(fdFcT8a1fg
zFcZD}h5{n3Pf~+a*e!RXeL-oGuq6@Vac`M=<XPjjdx!X(iR9vI53-tC(C)jV75jb3
z=mACk6Z<-*I32h&KqbhyrdbDVi_coFdqPjXtjK0)yJpMIIiGEf{XY&3oYxBg!(@zu
z731+Qo8&j%Uu<W~J>H+1NI+;UzCLYK4<{AUu92ORjpM^G!DumeEE~8#hvTR&<}e>U
zDd1WU&F9V|6%CT1o*=UXko|HW04M`QW-~kq{qn~VD_<`={ttB5GeDmPIN=1hKKuAN
z>{B1*6CkDSxAYuBM-|VIUT=Dl=g&@tY(TE9mo;u$-OH-utz_a^*J;*c(M;tx50vP;
zzOJZ>=~|y;&c0zLq+m(!omyPD{&`(eLQ~SF>+|0aV(-Gj!q!+6ww_^`#n!txm)#hg
z)kK_{Bjp4^P%8YPkLrfa8zInGosPCLgO5$s(*Ehld$PY7AQYV#Xp0bP*{lmf>~>rr
zSBA@t_o1oIV5ed3S+~3DR!Y_lDh(?1d2z5OZG+V^_f#FZOx;YoLvTP>x$nxBDMODU
zfC}r)A|QfUvb3`hph(>JWRZcmPzWt7FCRqB0Lb*<;2=Zcu|z!(P3ahRzf9du3E%)z
z0#_D6lVcq()lTaKf8ehQ*HW-#Zfng#0)H)t+q%EG8M8)p_>K%8UOW7a$zhy3X1mOH
zzUf~pZvhP$C2fJq_;vQSEudZxh|g;jN{bEtb#1m)P!7-Hcq$(M7(G>eg1nC$o(&XK
zNt~s9Pp<g&G9&h*CJ#{FhI(IRIOk*lJ+cou`+FbUUuBMFin}MUJ|S5BNpDkCB_MmJ
zw-+r-#Aj>>{eazcs@L^y*MH(Czoc&uDTN`9oH_LSZL<sl=As1^8)D9W`2W&UBrIO_
z^>fxi`q{(=Rs>CG!@K>S=U<PDf-TT;3P>`TCTa65p`c06cOqXSpH`SGct`VeTR{;`
zICeoPk0Cp<T}hD(F*!r7pgIkL7E7a7QV7>&ff1MS^j8G_`JP=cpe5_#t>}G&GPRDU
zA74-YncHEOhtpN__D2`mnX@7QsDq80a)EMqd3iZQwsP|FZ6Bla@S2)X`%w=Nbii{!
z9T!c`?1cUy7ku`Hxi)0qU3UVTZq=WwPLrr|Q{Ct_`**G=_d14E>Vj2$oa&S(8x%;9
z!hbWU&`i?62!TRxTTTk_NX)e@Dh)RZz(=9P&0tCrpIx;Es@cvn7C1EJD?Ti#{18o&
zvLc;zbxq27MaW#+>9=|Ym8X@2zW+-IMR*6|Fu;H*bK}pdivY29xkg81+`EH2`8YRm
zx@d)$Ifx~QY<v&;u)ws^q}I#(Tp{e{U*c{|*$-wWrelfF4U<qu3L*2r-yS9}D(+Sa
zwIT{`5%FyV?Wu$sN8`-uo>ginGk#Z!NCai6PneKv=#D8m@NLtBknha?oI%?E?1tdC
zNV1!Bn^U^WRgq8pVdj=6h*6gxYP{6Q{*!v8wkc`xfcOe$P8%+hp6QrLwx>)V<`WkT
z5fM#}cA@+z3{qtE{v3*fcw7f?Ld20&v(~}Y%@P)!wEt%o;6@jN)aByhiXS`w1B8a<
zJ|hz=@fi9J)J|nbJP?W7Vkp^i*1nNM^_=Z5?%D)|)~f3yVEG@l*v|?FCc5ebpcoxd
zJp)1;YoP`$DZaZfHOaqj>{k0K{!ocUW?f)n;@iJWA<y<r?aO@nV-+C~4?Ea_-MF{?
z?xv%#P>iLx&OtSYNsNfkQoBt7X`fn>`-w{1>t@V1O-x_crf1`pSiaU}Gbaz&gcL5y
zJ_*AQA=7KjO-D?)q5RIlz|f@op9itApj9rm%h=`@kM4F}{1kc~j0PBj3q)Zeu8X%f
z^t^2)8<NRbrhrUsZr|u36~YsimcGO?N73h(rBGC9u|9Fvds;q0fXeuPR8*}}#4h8u
z6`pWptXARbGn1bW?{-C_TZ``A1M#=soQBTGD-tl8o}G=pd}~;By}AyZYI9wm3D}GY
zB^cOALquObG=-D3kkyy^yZ*;`tkvBYNX7ckrqA8BgS^ij^w$fs6>l<v49K4HSbYtp
z047FsLkMaFu8q%T6R%Fsbd}g5HC5879;y;>g41Edeg!fc>G!bzD?uD`xse7xtwzIX
z0P3UTu=9#3>w1u{_ANq%?YIegcph5YjeOyihfex@T=K>1xaknUYgi|mTK+ql{e+N!
zpnV@pEv;F~-C}4gqQ^!3#(ac7kjc+ZM{kh;ykC^E_uh_13NTBg=H(Vk_Sa3}#+X}$
z29)=_2@`00qTtakleY2?S5>(8Q(CYA^EG0(@;Wk8hm6h>OO$lK6&=>LYnS;qv=BSJ
z$SwnD^h@jAth+F32U|Is2D!1Squqa#-oxTLM52=$HT|G(&?yb)SFbqDUq(^^lt67W
zEa^9D!M*kdH4C@S*pl{`t+B#F&F%<7oUD+udC8TxCs{T~EJpH1Z+ZtU=3e~Z_WHgS
z{p;5SWo+Yb=w%x8G9jS7cW4sed@lcTD+FrQs*gPT5$X<*#0K+kMrKc*<WSy|u48I4
zf9I&gBcwFUZoNkM{OXlrl>VbtG_IS?kz)Qe%-FzBH<!Bhh!mLq9#E_adnE`P7`prr
z`L0SQHuE&TV?-jBc19JzGx^L3>aTO7fNnL=c|Z7le!6mo&ge*)vRhxQ9aGrpso-Cq
zCTNk^lm*6dguH^bj-;)UW5l;jG%(89&a3jIbFk<(wjDjMseYjI;bM-t%*9+T!fzI}
zF4_95e1AP)yFqBwwjU3^9+h@>b8`c#0W5W56|l6i(PzkeI>41^8Mu)`F8C-CbNE)@
zmXVRM<>J3Mn>XEuR_1N~`-JjGVK$gk8->I66XR-gaaq}RC<gsj9uojP4+uU#I34}v
z^i4%Yh2DncoAUCtwP$`A+`It)`6Xr)X<&QXJz`&w*B=q)1n(Y4n#Hx>NmVk1B`1aL
zFW~#Bj75Iq7FnSMZ2{deQ&!l?R15xU{NaUz-YG4Wm9S8>N8OpdKIrVtW7GSa%XO}z
zbvKWYuRwbCpe6-~!Ai8Gm<$F&z3HA5B>7=*$KVx?sVNm}(iV<&<!fa!y7?VRm5_Z&
zSr1dzh?}xze5pDpXd<<3zYqwdVs|dzqC*aYR~k+<{UDI*e&}`o;tKk#uT+N_hQlJ|
zvkKI4wa?UNOm%g~fU2?vAor$TH{!2d_tKDeZ4x>&!O{>Ic7QE$#36v-6xg?lTICr&
z0ShOMYx9GMt#HW@2p2wu8!hN)(fkPs{4zU+y`JjfhZ9>Xf)-rO2ZT!ijkmzDz+s|T
z6Y<Y{z;6o3EcJv1ojoist=4pTAGWc#Npzm<f-RWht)IvpM=0Ro<-NFRtlfM~xIMOR
zmCYa<m{RzDZq%6?<^F%sbd>>7cTbm2X#q(w0Hte5>5}e}mXf8rWNDCAkZw>|x?56#
zN9kBPRbXiZ7Ic?|_Xqr6zN~(cyZ7EXbLPysqfbG#g=MnrCrqHHI(ZKP=yZR+Q9b<I
zi_gXRXM5o0Yu#Le>C!d2n-c|es>^@lArM%FqrLju@u1byvuQ1nvC7jR5Lol(Ej*|b
z=)MEL{94W%lSY9EV?;#88(Z@&Q=9MN?>EnlwG>M}VkB6-J)(d<S!KnLc>wg-^Rc+3
zpDal4n}z_xF384yZpEAfvmzSF>15=*<!Ykf;qYT4p9)X;kZ9fdH-HrxbJ8N?AGZva
zW(i$2r@aL}Ug63zx6#?!d7tCjO1WU&znbOVjQ4@G0E1gkll@&8{!0l;&G>#Bd0kS$
z_(nvZTvPrN)eu_lAC=v|(ebnuR1s+dkf*%dfB*LZxcfaTfanP*wP#amye8?*t}7jg
zy}6#F;3Lx>Nbu(-iDc&`$Z;P&aILQq+tSznIBUOn9<TScw6uVLs5fmr1T=*0W+3GO
zjDu$erpay?S|)w^aTOn!Jn*Ft=uGQRA6<{H<|wP^t^n_@89t~P_!t?u3B|vOw0*=U
zXFQ)GLu?+4pNMd_9&Q*?Zb^2Qv^I(7{yx;8EEs)QfmapamM?kob;xauq4rH*OS+%)
zaEq{zJ_w7BaN!+AAuhR7<Jl^#`8VZ7xAf1|cMPWXH1W{Q3$cLg|K2f(xY~M(qZroK
zQgr2A4rz&9Vp%*rDQdOr*n>~syz{Z!$Bf26mWThK@7-S(;Xz#p;-q5q5l<1UenAdA
zUnPG$BMSba{)gs>(_Pw@zG-^g4##xzY`PaQ7eFtX{qGpE9sujr=&i8qeUK8uTY)6U
zH1qiAKRuv$!Pg;&P8qX@xsib4DyBP6>8dQrBS}Vq)R5ZoL;Ark0-3XVRw~l9qfzND
zY;Eue%a|O;I`O?x55GLvs&KDr-NJHbk1D5fECGgZ)Ua%fK4hKGrtjfTYiM!xp>2LN
z!>f5V_><fHb(_(n2$DXUCQsagz}1592utM)!|gD^Q`B{+m~htxIwJi~E??($$fh41
zwk(@jzyp1%>`cWG>o>M}z6GJHlI3T(k4^un?_0_O3y`dr<@S^%j|6?&U+&q06-pg;
zm6H@v+x$#Y20_y*EgRP@vAq}FzJKpG+?(2%y-XbDxz->cu#oxtHH+h007_)GiwcLT
zyhD)qYdKQj5pCJnmZgkL9TO;w-iPhf@Pb}B@hd^I(I+zcne;5Oqk_E7;7nBTY}QJM
zQ8ztZ7-yk*?^&?0^%nn-Hi<qJD4O1@RoZoJN=7<d>is{WvnRbH%sM^cECl@>ayWIs
z2iU>)x<|H=%UQH<uJ<!((TVpFUzSmaK&9`yXKyMY26@PVfBge=)fRpoej|dyD`eB!
z^u`Y6%fDUzFq;>YSrxkzpf;d7;d<p=^qbzLi=GP%HOM}v^#!!wre8TZb)hgBy6&s>
zmdm7@9ylSUr8HaWJ$DqseZdOYEm`B!cNjFl2Lh_{E>X`xGn*<(_On!-=Tz%qcw}Xx
ztqP-+7Mjh|5B_(1q20~Q_g|2X&u%TdC<BPJWPJ{t<a2bMux8xM9PB-T`^4=D#aBhl
zee`O%E(zoGlVwGJ;SDkqI>!9qh0UHn*t5M}UVfM@?G!|t1C_NevDtTNb4e_eye+%k
zn;=iGYQISn1N*Xf?>pwrieMvSXwHOr3xz(?v#{NI4=H!EzanEN!Sq^U#H+RRPXhS@
z1VJF!_2n>6h)9KsJKM%TnOCyeI@*!Ek(z6So=%5_1qv?JFT;{z8?(I@Edo+_bB?Qa
z`F2yng3SWz+-bWy30tg{_|;}CJQjLTn>js~v9mJ+!A4ikB}%!-(Sx;nBqJZZwWbKa
zvzI^)YEqQ3CxcxpCLqycS9uf&PJ-~d*@<8XH?9mLu#=GnW6M_|!@t7^nVdKYwNodK
z!BS+2ChjWzxM#9u(66&I$>&)%YoKdvFph&5VvmYay_ij>toK1eTCOE^zDrVil)TeY
z&k&cjcog}XZAGE&E0Ezk>Z4M;hU_|?dV1FR=tb27YScNpVACmxG_(DX3ZufX7;-?w
z0CmZd%(^_#MVQjyGOZ|k7vu=0qH~V&SqZ{fstCgqk*~h9KfU?$>z{wO&s?ZLt|S}x
zNtleINt<GZPq@1b&DhHi#s5T;7t*e@WG|dLq1l0d-mScgi#sokvbbOWtU?2-0p-S}
zGwbqf3^j3&6QSvHQD5?rjvH{NogPro+$o3j#DRrSQl=E*%W1CoOHlOues$MEyD4YJ
z#r|}teGi!eh(J@V<Y%xdjMpF0%NUEqWx#bgSaY`@zn1FScHuN@WVu<QuL1^e2dcpK
z7i+`|cr7iq{F)bowYgrVI{Ou0D0MYyaiQ5kFn;#b^3sd$#&O*X^Pndi@%uT)&POke
zH*9Bha&jN#a!L3R*M}!Mfw+sb&N(OSJYKh53tAgo2)Vbqdxx*99|b47&n+*L74sf;
zJ4ut0=r`7V;$|(0a52PY*O^G$ZIw|%4@Sa=w0%DM-$p7@;WkotmC|qpD@QXG%YsnQ
zzA!@ofYqE$FF*d8J@i7VHyvf~IY_-t4YsKi8JG_A_+mi)srnxCpT}8ptsnGG%ts!V
z78;%6K<&Hh^uGI~%D^qYPr7GtX28C36|>pbbXiaM6p-i(RzmQDV-2x+d&zf20<eDK
zOPglH*?(TI+1EgF=I?Ohf2$eH<(e;}zc=&atL3RaLXtz_E6pT6-|+X&D=g9J!~Yh0
zhzy3)EqO*!1Fsgqkya95Z-SN80q;uAS997Lek-zi<&%^skw?pRFgJDg!EUE3+lj?|
zv4J1+@^7q~14NJJLS-NRnQ^0PrfN>LVn<G<)fxhTK|V|QI22cw+)%`RRlIoXL1xw3
z(gRIwz4v_)pLh$Ck-N0$`Li=`*nIGunY7md$!w-Z&c!{wcWOb8mN7%=NAIJ5yl)I&
z!sQfo7aNf;QR-sWiOR_KHfa9U_e&as%Ktn)rV4M&HgLOJ>erRSyJfW!EYof^jY1_s
z-rYl7HaY3nK5ljKR%M9XAU}3ma+J{xh}GVK7%}u!ORbjNlcm?K(vK>H^&KsP@25KU
zO6XNX!m^y)WD<k^%v;A28Ay1}LI1Nza^iJks=@J~ZFH`-VgPD;^Sxhr9MDco11%i=
z(kNZNu*J&=zOZ4N0c^M|?~_11{wh8f{gtjkfm*Bnt`-}bB72`&EpM&MwX8}-G|>%o
z(NOdPA5J(q$*-P9jz*lAV^_vQO?>nz9rm6<Eiv>KLj2d7MQnc+gg_etv{Y*qkXvI!
zgO%0mBaY{XhK8t)zbu8xocSj6WRIzgK}43?OyYK3g>Q>bY_}MZ^(o`3Hz_XCCyY=S
z?&SYzqy$JGyKE%^FR13Z?DfFPc}3YzWTNcsns&AQ9)06^Z=6UW319?jP<q@f2pim(
zW3BA7w>S^mH;8ZQkM&5im!^~uu>dWb<WpoD`H5|tZHAy`-gQQLV0+?dN8~$^ehKhB
z9Gjit<S<02XLW4`VSrPOkex|j3^+T1rLJ#^X`@LML>o)y3@WmUGX8c&4V(ond~n(&
zs?C}l|Ar25Pguf?e|}tl$}Q|oSdTWvWQ}(3T1G`>?H($lUQ5ih*bx!3RVo$J*L}f4
zIE@21m)#sLKl2PM2yWWv`h|<Pz0DyA3CkTf1LNYKzXFH<t|`E_-*#;^EhpTc;l1Y>
z`iuVnqKvR{9Y)cn+yzLq>}|MK*!v#xjHs0H(cOnHh2m8tforPLDl6p4nyAykGv9ac
zwqm8W1J2#x%`omUX)HvywQ_JsGVrUb3JyW-3a@`Xx8B^UC1GMSuL%44yQ2|xl)Z92
zx>5Ry&dcjMrCTRQV0VtE8XD#$0;_rZgM2gYMJH7?nxXii<@eV>fZ$jk+%Y1bR0Z0g
zPGmli5+ta#xCLKn&<0~Q{$7m{?hu9SJTdq)j;cX>VPqF-TU%6ore%_K!7d~%;T-8E
zEF{&K@sHYEDljID(b`kMm@#y7c-cmLpJU$dV8~E(!yS6C>broAn-|2abFOHV)mx6<
z%UkMP%GxcdUXd2QRJ~mW_v2e)=2JqS`A?3ZDg5)vpY*~GY<HT*$gJA)dk-1GQ68h)
zl-10|N<=>!)$z8|+NZm0<=YH0pAYYIH@)_V{bNc^tKm~#9mfJjFkX3&nVp7oj*^3-
z!Nr4uqczd7;XKvRX{{lc6Iw+NTeN6K-d6hTOq(>_B0AF@q6exwv@xzThNbqwY!lYx
zO6#TGndB~@ats{C$I!&!#>8gkLP-2$LG}pw)-8dRy^^2IYS>IGZNnd=NBnCasr-1|
zUPcHOSj_~EU||6*KQ4IR5zD;_LZ#m*hiw$nZqMJt?so0V&ptKutTaL_Hp_A+`}W(r
z+#Lc;ub4ZA{aLFzu=$@X=NN;@gUNdtYv=_eE=Xo*F7#63LuwpyVX7I;q$SWleH|h(
zCu%a=$p-g3<Ni!XP{j><>9!jys=L%P1am+nxwp2iqO44n&}^9F-PF0s;WfQnpO)xQ
zt?^=EVjD0uY-IWvC4iNYh;V{ia-ii7{&z*~E&iX9!cyHfcqH7Q2RSh_qrdZhp<N<3
z1&3Z3b3Qw@eM%#E@t?5vl8yuU{s~bqNup{>Q0imj=7!fsp9}PL@bq3&RK_-ZbHsfi
z;@I2l>{q#Lmjm_Kn<c$McFDYPx=vTM<U9RCE7FW=-#xg=`2>|XJJ?(RRS5+6DQ&1&
z7}zRK5<)ELYNI~KwrNj*k<gdRRq%s7@IMWoHW)aKG%E+CL@$u{p);y~pu$9078{gL
zM>pOw^=#P~JLlPfev`oK96v9%`^)T^3i!}Z4gyfZ5yFW^uW?U;vk}moUJ!}U6lCl(
zT~9@<*iPDT+!yJ_OyLUq1ItF^6p<ROzei7RVWE0@?{vfj<J&FM!-lGiyxn{<ya6_s
zjWmfCex~2}h0k-pZ*Y|tLy#I#z%=Hk5#9v*P0rC2wy0Ux^$FaR&EntpquMG$cVdho
zN1mb(45bI3hVp297sTa6QG-uR)UosPI#+mPT<C>_dz*ALF6iYGiw1RmLF=1Bs2?e0
z3L|AlHhxq%j$OILq5&?);{3nGtUSwjQvrU!(desIZKW2uBVNCIwb*JN?o`MxPGYaA
z8-mX-;m435GXx^iB`;=U=~o~x{qR*~%6SsejNOnOfNSVpQ*1!nLCy)w#kaT&{phzM
zKBJw(KU`<#QQfQh!&?r)Rf;)&&@&{JW=Jw0Ck7_VOkH?-+?(}}*iKh$BqS60oWR+*
zc_;nF6L+1x>T)AV;?_sEN6FxElXz#bJfIa72vkt#H~b{N;mnqd$EHtPWcHwJ_RPWG
zE<To(T3Glj?q9hTXY=sQM?Eal<xcM-gw^nV44C|C+}D0@)wXl5OEtEWCPNGce(Hvc
zN~<>*jeU!{65GRDh8_d&cS11Gzt;oKbVgM4nVJckW37n$o<q53g-S`|$K-3Yj{a>r
z{2>LdH;%Q>|FDHhqIat;$drR6weP#(!yQu!l#S-=beGge)Z2e5W)F!~hsMT&NzCkP
zv(-a11X4i0`3%re*i;7O(KNVN4m+niMT(84H{OIU_vM<D&MyzqCd>W~RqV=z_S%s#
zh~0#0^y{sQ>*uEyE-mz;8rY-)J&X2_^tRjIN$ooSHXF7pi!pcy5xBZ^sG+%G<}A(x
zcd%ps<A*Y0y0>0npTskm82)4+P_0_c(hT(0^^n1r4(!Fj7BNkXEgvq3$J%_3X4R#F
zGOccFzv^h0uD_RrR9SmHT31Y+%Y5?IA5rBi_aj)l9<OChP5VR^!5^lFP<uqbOc8MK
z@eG^uRrxL2>D>KV+yu*Nk!J*g*m$Y7r)+jL(OK;gQYq<7nissyrI1g%pBCDe4t!v5
zd|sUp^tG9;sv1;EYo%J@gD>gSDX}tLg*k#)0ET3)`%|qlc<xGC%Snaq-2CGE2{u?z
zNG9#t!bq%_4w3Ua$RU<ltFfvCzqIV4%BmfR_wYJ<3e1~;kK>Pb49b5>l-<T+$hffQ
zUHfOidOYcQM&By)bf5q39HTFTTIOddbL(mHH=sDjrLJ!5DkbfbtGrN)tmk?18pWE5
z8gf24%an3PWMXXn-W;~>Q5qH5k)1>mzXXOcfNU7hQd~GJfl<j;QA{CZ$L6kyPN$Si
zg1iV2d9r)M%I5iAQojK(5T;chUN8Gx-S5~--5`R#)M$!*HkZpy&?)^j%zP7L9Jm;d
z^{JXiJGFJMDx&E%%!d-7@pkSl9(s=a6(>QCuOI6(4HoW!=~2(S2XjnhjsN^pc%V()
z0=92yQ#&>c&x4nJkuQOIpuWgx6h`mL!(xEaSKbl(69y=}f+{yg3df4nZY~oPHVkt!
zTylW%BH=Ti9i&EmZmP}71n3|2kd#@;|B>1)mffhr33dYZ2J7DXB5?(-WZnn^l4%~Y
zpcW%DtXCP`b>N2f_F6mK031nLYBMkE@wAIyw%~^SB3wRDErpJx#xf}0gmoDhS>PmW
z8w6r46)!*2(0&5_UPZX}P3Y&i`x<DjwfnN8=%^TnGc+Dbfq^F2c-lvb;af=dSwNI0
zikfp9vg$TEh@1H@0U0$rGi+L2?$F?W6Kx2qr@emUCxnDRiR3y`yd+Ah(??{XVpdNQ
zmn0a6Dz_|5ewLkw>L78`4A1@b3@)@Y*Ym~^x9TaUzdwRu-0&5(^F2`PBBqUY1ahLs
zb>JQRseb2sXGZlcH4Bqb%YwWhC7p?K<S1>Qr^p_$8_T?`KQkB~jNkSQj`?By&|3B=
zs2#gnjTm$F_NGDZZrZL2==klzMiHoPr-+tM5?aEx;zR|e5-N(_34A^@R8g7*Ah8lX
z%A|Wktx=^X!sxU~H{2<Bi7l~6*vS6WkkVS5Twir9QUQC&W2M4TFbwveU~G8)>A{);
z_V!7u7ySbQUt`vhXUKBQfF2KpKv^`Uq&UcDVft0`ZOp0M#hk?}JzC7n2=bxju`=p1
z0l0cx?N0hV{^3kqqxyyMkaAfPP`H@-(OOEEUMHuTOhnkEGuE-OFzwu$Wt1FDJCXXD
zGA+9|%W)4{PyNGc6K(PWzM?pW@4H!eVeW-i<q>fgi`unAe%S5HVR<S#+C3vYvvn3#
zIY%v-Wa3G;2wcD!(Mdnk>N)8gPTHH?4@<nu{TfcYFyCP%-i++t(C5#+?2@@kl8v4@
zB*Q~n(daArM&TWT89p^QRhq+ZLLDA$lYk}p$vGU&2Znek>h}Jk{;~)atg<iz!E<Ma
z?L)dRpNQ;hP))758k}#eaVH||-c7k#f&{Qc=auS6<R)+c?Mf44ZZdgPJp}H^YkFI;
zJ-)l#VvkDmlw_xOD#L>49KnH`Q%2N*OTImtM|+2G(LVo57)RIO{<6`5A-O~^q_f0A
z7MqqT)aF+!%kfNagTdAM6<eKj11W-tu8M<eO_r0Ng6-vJPiL&k4?v+GW1cp&e--p)
z;29t{IxQ$BXDG=2k|gJ+Rso(k2D9`C2EIRZ(bF4;`exi7n%Lc;fnRm<j_kpH$iOoR
zn$#}Lq0H&5Iz4@KGh>PuZci)o;7redqiI0ya$LcUG?gde^+ttZF@j+SO+M@qU1|D?
z5~lrcGa{c7Eh=QPW;ip-F@fmG@^eswb!sP>OCfIOKOBnKbg1O>as%$`Zd_we`T-<c
zO`724<&E4>H~C)p<qZa8mzNW_lfrE~FmwKO^St>u+rYt&$_Sa$>)D`_ak@}L=GPFk
zWR$OEG9wAVFI@C+vZCeDY^0CAogod1<C>lLvd%bp7`Y`xW_wE|y*IgWeNaM=`aVMH
z9#zCn0!W#~><WIkjWIO0jAymjB9$eU^e3O~+vxkL0j~ChLt8C;z#h)>2V(F9ZB>jP
zmeqA+{x1;7^pOS{P5p;N4CJ>}Wo0&yM={}6fzZ-Dt)*(xNW41mG*Q0p_ig&GY<=U+
zUa2XX!I?Q-Br+~c+NTR6Uq$;KK+~c`s9Jv~5)B(_$_?q!<qW^#iBO~YI5w?izWuHi
zT2u&uiEce@^IWJ9lkh`LOqY%zN!=L@@?Wg{_uWbwXOXMV)4Cz4+Apn;%r>H6Z-O<D
zuO$TklJ{0ml5P60Q}!hR!1MdTWz8tL2Ojo?;TUr2LdLyNclX%x)j6GCGnQEuYw(Q<
z94ogi=LA>BMoU4m$wDk6YORWDdqc<iHxgRb6~=fMLHSM%aeh{pULH|CZ+_dgEbe#J
zfA4MdvUFhG?>rQARr&MzM}nX9WAWME&0P`ZbvvwWSS>31HG+6r7gOyf+xXvU0Gv&y
z<vrLbVUlqIqGOzgkQHD+2V5Dc`V9k+V&#-7*h(YH--G3A+I6LavJDd#e-6GkH_$|~
zrJoRi>cn>FaZ$rw<HQvVY-FFFUeOh%UcZ7p?c<rjL4JVjib#nR8UH0>xV$%FhHfdV
zzf(~6{->Zmr5wJ$tCscEj=pWt5D`3c2t?t4N>95-1dR~U8LStx!m;*s`s7f4%{_})
zU4s&wrQCbM5kGT@1#_kz>q?IBGjP^m>2ssVtsA>|8FE%QvkG}x|BR#4U&JnAec+Ta
zM-Vg1YNF}+GMRDUN1bG49pJkX%knOke5VY1y9skYW^&B+!sgrHIwSQ0h+&M;@-LX1
z^z%kNHTQhl?=d&%4jsEzhv9+sq^M_^M^t{w?k;jIaan%hnBXXT(Ip|UQZz^Cc-i<h
zIi!Zj)yQW8Dh|d0h11LLHwSb6zZW2}D7yxx$AqPhkA8sUSC8DW?#Rrq=A;q(x{#Z@
z>a`hXctgSn_OS16E^}k9VJ=5@Z<RhaCsdZHnU2buh_#_uxwO>xBG2mn0g=Eat8KMq
z0J!n;Ue)^519hNl`lph9lfKP%aVje)Gd1nQU@SFb?xE{8-Bl)@#if^exuj_fxp-8P
zGLPX4nnC3A;ut>3i2w$(hd6xf4mDS44lQ?wQ~5t-=u=1idqQV?MrI*JGs#L)khURl
zSZY%Kz1d_$9{Yc@A?F}l?j<CFF;~@eYdA`xw*p!H-5E6{!n7*m!YqeJYg1(N%TN17
zV{>@$hc5yy(q1dq8QsqZrMG)FdrvP>Qu`ChhDxD1@)-8k;N3LNR~5G?$MC<CDJ``~
zq>rIMb<g17ofX9qz8-E(r^qeGXi0rV$0&KP>6IRA`1vzV1_E>ap5QHGrH2t|3a;|9
zltwStM(Db!&0v_KlfA)-YbmE#ZYr33BHq;S;JIK*>OwgQ`T8p_9wPD61tnZ6QL&Sk
zo{%e>*hAb2WmCOcXN@lKe?B+LRKK`9z2XgRz&-mlV?kQdLQv;e(n5phGZ91J>mPJK
zQvMqmd#3Dpt<!ZX)kZ~q|Ee4YTrr%&5BdI^(ImFF8^nb~eQ1DsdrWn;WjbLkMTJNs
zdGv)nGZwAmm!Cw&u3Lrsl_NUiotve3rL61<$%PLQ_ye@=%0~mak(y4e&|BR~t+oB6
z;1@}>=&eeI={5C35EQrg%DlfdLh5%meAc<?^cczw9gWbWd%jN>MgDl?_%R>9xx_@D
zw*ZOrG{0g3_rAX4_IdkjF1?a{wTMA3xgi51W~@qx%}--^8sU1@p429{3s&=YgL>7M
z*^gkuRS4))a&bVums=@{$V|<|B`CY-c2HCUgessokNn?4K;e+wW5x@qu`TZT6n=XO
zB~`}$kxaQSO^e}Ra>;pcGcs31;sVwmYeOECqLJWnB4MKPL1BTdxE?#!+GH0mr)o3D
z`QDSG64~(f?I_6@!;uR*x5X%qQLti98L9?lyA|wCQ@ZW?;+w)c^~aifTt}fsZd@dg
zv7$%4jQw0CgZAfNy#C%D6jJ`Sod8R6iTFr3;nJ(C#P%<fhs)rdmNFZDn=6dB@F5rB
z1>!qxz!=GF%aJDHA1o%$wN8cM-$$sWo-SOJ-Asdax<#TAt6GgnFNU=z+40d~L!b@k
zPT0r#kO=e83oaG~P}L*nt;T%!KgDA>WBAhB6K98ViL%dDl5e(!B<Ys7G|Mlhw_sYO
z|A;A{Pc-XiWM+xL+{H0Hh@6br`JMLcsMTiXGz<OCjF(Z|T*hR)h_ZaSezGTEB`06c
z-}J*h=XA~j3fsZ6<&(GlC-2}>sy2q`3V@j3YcnfHt1WC7(&I=Fw3GlPx%T4x_hyA3
z<!f!y?trpOyU`Ah__NK|xXpx}!F~%P41{4f9U&^5!bY758QMlsmYFP8buw_4bvfFU
z{g{Jq2Opot7GS=3;N|SptK8DmwD%u~W0FjCG)S@QT}&xR%^QYnaeYnVoa^^eOqlgg
z#TY1Dwm2JVT{O0+=Q0}3c{iVb15-{vna3&|?6PY$pYUgx9^@(-oQk0sxPBODX|hmp
zTkoPDliu{~=nI=sj|sj!gDcP(;>(rYe_U*XStV>Y<ECCm-N^SXE*$g2l-1Xwoil?T
z#f=Qnj+HojX@h}+#MJVYUCs7<JRY4MgS~qPF$G%a#GM>IGZxb;@RX_6c}ZPN2WubD
zsCU`0ib?!H>PxX-H|Un+S_O&7l016<*WspRM}Ax1;bpF#8gi~WbH5n}e3=dOZ5&PP
z3>4MEMZ%jgXWfJbX_YK3A*s`+I-PdedbpXtGM}VPF8)*T{4=8Hvetw65Z&UHtfqqF
z?uLtoU;<s8XGZ@iIYcAu)_g+pN)dRS0Haj)gkI-vJv%!fU_GzB!88B6WPkJRu}uG&
zNNfIWxU_E6H|G=`qQo1i_q-OKCmI<WJI`Su^)bxpmBEqaApRvcLCAp-<yi7_kEidA
z<yu?jD1$6JfOMbFnx?~4Osf9l9toPMlnbiU8eU6jCle2N*yfa0?me9c?rOPK7o58S
z^%>q{U0mf_Vji~5+nC4UK|>H9Y%8Dk=6t)ty=?$kKbc@UDZplUa3{Y<07S|DB80e6
z-|*89H9SK*x&J8VYIlpl`K){T#Sk34zlmPu*e{~9ltHo%!>`-L3{pPqNqkkL%N6Z4
zXs+tup%9@<mp3vk?4~>yh~$LT{usAe%%nP}nbP8V396$<+&it<8c7EV^QcZuCM?sd
z3R~*b0Ec<5!j|7LJ5Mr8z7s4R{#S-d`}Y5hLViBVbqRuhk-*{2;!Ovw63LJR^G##S
zPO;M&i;>W!<Ng7%x*cb5j4DPF)4IY!$8Xb4Ws@V3E;%0Yz~@x=UDPBmVqMOUhVPSZ
zawul(hWzqw@GQF*=4eBj9^*@;|27ky*?!Ke^Tahgqfn_KxoD+A^=EM>>zY~x#D<8e
zC}rIN#NV}j@c((q=q@jT&iH2tz?9i^tY#?=l`mFIt7p||y_PGlt13zgsr`MTH4L$H
zlJt7SR6(|nBWUsM&XvZ@Kv8*UEv`bXLRvoY)V7@U+U49{MlQP4zCtSM#R0CCQV#h-
zJrpg0g~H#*7zSPfZFp9Jz;mVcZ~H=j#TrFcn)=3lX3n!JL+Y<xZlb$?@J_B@1a4J0
zaB}-Oa0(32>$JK>91XrqMX1<{DZ}h%p`nB5MRA2SE7b}I%m?@Fc3a^XD6T@XBC-;)
z5-lql{`kz-JHKjZx2r0N6^v{G;Q`wXgQb3v&)Z7*kt|yZ=Vw2^MiDd;grQiOjN=)4
z2O;<i{`Lm)u)^qy3(oko%-*c^?U8r-*caVcB~U^u<nA@!%;Ig#W3$}q=cDh5tk5qj
zUSWcv6f<o4*ak86)C$|XzZNclk*UwdG4sdwMI_Z}^*)vwV2Qf2e8hR`$FG*jIzl)S
zTlLi98<(6u&FKrA(wHn>w|3hmz5YK*Ek-9l9vb`eystoFV5tKZ{+vN+d|nQ>mMSpx
zAku*{H#}QL!<Hj%!0BB9@yE)w2PDylM%q+==7hWu<3?lvBm!U^a|_m>uQM~aJ2~?>
zV>W!m7NKV>Bd-TL?pY?7gj%_})*y3hwlUZrYcCv1m11`QRkemyYPFd`+Q*!iKSeE&
zEcOBK?yWl0*O^qn*K*90WBIyvKdmhvE57^U7-7w1Ro6HEKICN)0M^c|2Ug)$;p-n0
znDIvB9{p`k4+iZ7N5EG<ElkZE%8k0;;M08Xo$k{N$nav0Xn8LzuNMsbPQ9lbFoFab
zvgzS?aZpm0UrU9wY-9y>e{v&~JChU#D(V7q4gTnD4wu9J`E;qU_-XTZe7+pk8ULR6
zMbl|$i{9wy7ui>kRZ6zGBM~S;!Qtz4RU+Apk%bmP_*3=8`!y-nTZ;@B4_N(mHVdsJ
z0Ige`wb7E*Pdv;-NqUl3J$wG4uOEfv#9}a{rw_Py;dOm?NNWE^!+a{c!}grBMpW;N
zpjm+XW0L~byHhpgTsfyQo7V`ZgVz~4_j>pDm(RQh9*1*7$)~?6kQXnmf5yp4+9q>K
zkc}#QVO}QKoE_bNUpQ2_)W!UegSATSYrb0SlS-RS%ZjknY}i4AuQHy#(=O<<-cjed
z&Fn|g7XNcMnr6v7={Zd?uRLGHEGOloJvjC`ad_6w^}HL9Xu|6b-yyG53GPU&P3F*a
zPlq5|UD?8jwHAg%Ra;_Oom^tc;B?K4PzWXZxBITXSlR<?&El4T7|+A{zB3m0$!>$)
zR{XBGf=^cv=jEc-!blCWMxk6}q8fP9&|m}GsNB-&Q^vOWxEV?ZLoQr!IHRz|6g4+y
z#20p;n%w#ANN#v7a&<23?9Cba#QK&=vJx517Q10T7Q1C}u|UWQERNV?IlvY}RmX@x
zJE$%i^lw#~pV!^z0$5Y`S&Ij`thP|)dnp3L_x0aA^jM7+-ohy*S&2(AQWR>Mb`-2%
zTNu=_|Gqc)aX+^;zA2vfpU4o<n0IaMKP4QOhp9mVeoam6G##9DEI2MS#<hGmL@(}9
zNb+&t<l=A^+dCO5Ju^FyWUDPz2G8ru7dH2HyhCf6LUW)Uq|*at*IvQ*Ul>r^ma7U3
zhB@w2U+^7>3i*kucCE?cHD@V5jB4>pBmTsBM5=SdG1;Uupq$O)8Hj9+k8!9$DTuQr
z$r(Mu*%|RTsJyIVKM6V+=pZhTKiZ?itWuhMeSJf)<(Ths4`3l-Rk*ObI!|Ku2ps>)
zI9A}eSd&UFW8wYzyjJNs0SCx^@vE?dzc@*5Q>6x5LeQykk5GevXl<ldVDsaXg){12
zd%BJqS`QqZX39gueXe3YHR|;Jw+%oWwlZ!g4_!$(UbaPDqWh@A-mdQ9W$sumC~SJ&
zp<rLR=;7&Bfr2!DqtUGqO7_1ecZRIV#o#0_3QS$=o#FMj0o%Ss<V_iN*<=vImVPh7
zd^mUcvDsNzGrOIHg}3)dj*S$8-%<fR1~HFEJQV}B6$pn4wDeED6s9oSV|o#Ym#6TW
zjJ$T*O&dtP*&2xOLu$(0q(%ML|D}S$)Mj|IWZ-S*)P-z>V{y3d2o0d*003U`wjWDx
z6L{oSM3&)b#iB~0RT*YJ@AWVat1V6)o7q6P0pCR(UtN|bozl8PlkkG0(X^{MeP1vS
zjL0d8H~H4YuhVVf!G<Y1+cm^boJn=~-a~{sOzELYMn$r^#=)3*`P7w$c8(5c#(u^=
zT<=s>lt1jWZ(Qnd8XnA)4b3|zp3*8Ldx>>>Vea2um_Z=!<<87|eIH;I4|V<ekk+^L
z{q1~X@}g}?q1Ud+JRwnkdwY9Bd@Fudujs=zb#$p**ULzt!DpgFGR$5Xrcp-TVFtsJ
zvk^b^CZV53d~~1VS>>{#;pp;irPZ8I?&rd)p8ecTF?%&S;LIMjR(}}P6y~l&nB%K>
z>~&rm=vU-RnVW40n${ZGN9T1r-0l_L-Cix0G^0NIRtgxl$4HUJL-A$`4GrJ^y+4N}
z0OVEeCE1}4SKssWlUNP>+~YBc-g?=^uZ)#-AL4O~yKqbR*#SB63H(Xs=PFLqrwuAS
ztoL1K&&)7<HJRB}{lCBJh7@`lNFL0~8*+@1=Rg10qZ%(QAB)a`uIW;;I=j_nb<Y@Y
zfRZ4hmJ^+R>=im<JvU+IZ1sukhWjqw9OLNKw}%Tzm5S)Bp^=io1M6SQM#1loosI5u
z$V!+B$UKzQkXgy|Pg&P@;x)2P0{m3{>hx1I*!igzeeE<FdEvr><Y_=Wo?9)mKHH(T
zeXOr-e|c`=rKkw^?tOee*P+pvC)7m_K^dxBXC}Z_bpCbWLh`{d)DjhtPFZ;WEUlrd
z^U;58Kf5G~_`5EG(YMXk+2;q*XPC^PcST*QeksQhuUBe?WgKpn4VFHMfjo#{46q-C
zN_Wfo(ODkhYJ17fb%&e#e$_ACBpY}J|L^nFAUq}1rSZ4(23002yha=C8?D_F&l)yu
zQ2ps=B)D>%b~2{4toB5Czw>;s>C(Vomd#}GjG%?2b>BF350Y09=ts4JZ7XGsR+#*7
zlb&%NDcxTE#S)N@iqme&Sr^fy)@yITUi8svy-mQdhG<6RdS!pvd2>@^?6is`j$JpO
z;H;#uM8IcGdEuPzQ~`eie`3h2!S#84HX;?mS+^^~_TOPGy;e4~ifrtx97Nr{+}KI|
zEIcoYo!Ab~bMV6<l}P?NP8|d**!JC@+cYP8ciq{tR!=$MpB8Fm3%+rEB+v=2a|iQQ
zCs21!EcIZJ=kBf=rltJw-Hi20fU&(XObScDYiVyA$XCHuF|09{+*Ul3J(J~(PR+HZ
zt};X0Ul`#@4>72bw{COqu;(uJG-qr}4_Yz8{&QNt#Ex=(#N4TlU3OlZM-SWum0Puy
zMgOi>I7%5jH~3;`u+{`n-Jj6W<+iE-ax|^8tV`GzG=rWl{xGQ~jw!a8ek1*N@cPt<
zF)rp7j(6n}Q<|b|MCBVMH`=eCXaTxs1CM~)z<<GQVD_F?THnhp(|*g*!rUa+)Wo_O
zS6*K>b~PVwx)zj${d#fm1#b*u2*I~fTa$U?=35+Oe}1(^{^Zsl5OKFEjn^fGiAHv+
z()J>r0swdflVp_%rMGpkx>bd_ysbTD_o5eda~?eF1<h4+otVuRxY;eQ&6)S+hTbqd
z>ycPW<<=jl&m4cn${=K&*8h^<Y;`ak7>*LIKP3_um1HWTw=m%i*(ydRe$Va=K+&ql
ztcq}s-N+C)eRnIU765#3nNJod_441U+Pd#!Y~LG+JdOeksiM^P0lDXLZh5|ZWqYZA
zY|DS}tB@VN=tJD<K3Iu>B)o%ftC;c};bPL^2}w{^vH2ug>`&-5Ph{jp;B`N6m6Poo
zmkrG{x-`+zhK4V`#inkDf~l@=+up+-DSwrAZoW6;2ENv1QfC$?+0Vb9Ine!lg8F+e
zV51;pDn`lt@A%H{X!@(qAOwB!QPCHH;Ypi+vi0|7wTgFJ`kW7`^J5`ck_FxRW~IjC
zW5CZ!cHUUCgh0GwFW<uA7#OFS@IR&V^WO3Q5U2KPY3?|&cINaH=F4<;pFJHP5+sU+
zixIlef|z<VtuzbCN($7OY#QMSYc*brHa#LW5zQEhJ6#Wt9eC?QxF5;*D_KiwVw-N5
zzZv*w`t}l&?cD8ga2Q-l=4ZjpsTN63-P#ODrWb=(_p1Sot4(M<V1#f+!T$Y@H7V8p
zO9ot&x2x)=lRJH)NW&RL<=G6pJNUX8A$=_s6z<Vn^>gg&XYt19>~CCF={iqLb{MEk
ztJ>EJc|v#Om~h#+TC2Dh2xA-*Y!?r!8fsp8G=6TtUKp0zWJIivoZ+LN<fDURAxUle
z#$u1af(qD3LQ`?Ra4`ZMNb_W{U{Hw7t6NwYEHzD)>czgJq0w2ZsIZ0MHTgPhYGV>c
zNu^P$-clz6OYhLdc2+%a*9L}WBkiE5C5CW3kc6M<f?Xb-Qm1eallqX;KkU#&{VWIK
zOuLz_I2-e`w=LO5j$cxIH>*@(Zg4{Lyzh<NCh89nIZm8D<bWGuba?`dqV4Tm_yjcM
zE}-Nf6VV~6-9eX&!^eT5M{&v*n8lErZRE!6j(D&266idVOlNnrHKSgj*pi}>G}bc}
z(BTJ#IVEOjEE2wnC<<w!j%JkIAG7!O<2k&UHTjs-i{Hne{m3(ZJW`xmrLykvyW?R1
z;yuukO!;K_(B;%0^<Jk3((NjX-Yvs`4xobj+K)Q4mj3kBG&n`#I9Lg>H5hcd4B7h;
z8t|e%f_Kys=Z%gSSot?@cdukk@`iGSW8BeV6b}4}uO2S6*B%SCE28x9zo&b?uEk!d
zBtc_POEOTm+uF5(Z?FGKn%P;iAM0F1Ys}8#p|WC_5f_z9N4{|)kt%OlOa}i@(e{A|
z9SrQisbq=LBRv3?#)ohHbhTi(B@eK}cIgoZN{CV$)V|ey|1pC3<wa6T9_1y_X=fpj
zzav^Mf<P)#xCoNC&n2fgRqlqxzAGZiEv*i74y^%?jICHai&B&w-Vw5#I|KOl8rw<3
zvk0$OO*t2yD6v)wdy47jdOdhTTeeXRi0y~3&{$i~z>FYzHFSBo5xX+b{onC6_BT}I
zEFs^uLj~ipx*}9@-1iVm3b)q7{`YsAvD8$`<9Yyb1Y==8D0ZXTXA#8)CDCh{(y)e2
z<mEuS!Uq}D?C*`M6u-rMv){R;H8s5O4F0;uEYYOjn<#9w%Q>SY_g)gdGWCZMMJmy5
z?<L}19;S)rm4p#pyVea|MCDI%crMbQ=BE)iMJqRZ=!N;Iw0#Y_jp;!y?r$eQ+_FXG
zdlfpXlq!jKH3o`N=%CXKH|Pt+8`&z7>$VL!`(iq1P5Dgnf=6>gGF%MH7}I&+*mp)0
zNe=i|paT11N+3Q-pouuW&rN3T`>&JeiMsugLgqiu)W&aiJ_7Sik2r|+HOII!drR|n
z-kDaojq)F97~&1VK5=weh6H$AxiB?;bV|$pCJi_XY_>YI%J@e%Owxv1sA#1MQvPlW
zkSuqV%v`0-+`JZ$HKzFAqN>Z|O*_XGAO3hZrEVsKQQ<h?evyMyR!FQ75u6|k($ScJ
z{#ig@R3JGU6pMZdts5hiYQ&BK^~94pMJ?Xk8n@0-UK<_s5ftXNODnSta?j4qHJ5)J
zfgl`7>3o9$(#M9m`;^IFl&LaEEo5m~ZOO7f8p_(n>NDB#rNpfkc6c%pLl{}AfW0S&
zDF}OtJU=tAWA45oUIf%H8J^zA)xBq{7o%6Gt~$vTyCm`z<-fqhH#p|m#X*ad758h<
zh7X}8g#I3w(>m|i4oHtNJe`+a)w9V#Csp=p{AIM}3W-HZe729nG+Mu1CJcLL34^IH
z!ZP0O(e;<QL`13q>Lo1}gSj&eQT+npBb*6YTs~dTFUG?6CSox3scd*98@Ia}Q9bzk
zOMWEHr`Gqqu&C1Td6!I2FNF9ke*3arwTB-v0VNR|0b5vBCFJ$-jUT07shIt0i{(yl
z!hfZg(PR;V+;?G`+0tj-MG>|Xwb(_o?TQSJ*lcZJ$hhOJqlKL1q!kaait(X6q`|q!
zs7A}YNadAwioRL(QFgC+4sj6H6F@7A7}YhzK()9mlRfW-3YzQj?}MdsETWK!wM&Xo
zJP46TIA(r7Csy|5+LxR=#>z<rx=I8#W={(pAlC)|qz_q<Qq37f;uB$nBYi?ZpU))-
zmzFpIv%>Wu;~AiT=}JqJLJT!#Y!^e?f+V)Wcc*Xqv57D5lU9_qZG2G10lwN^<WAR-
zY{)~Hx|)R!L1Yp$^o8_1?jyt;RX(<d(ME?xslgKrgj#Rgu@%M${|pYe*i#b}zKGMT
z{+w%?f#;2hm}P6U)MV=duci*K{5yKZ#A4wk61g&n1W#IP1+NDU>J3Xk5S9>9rJuGa
zd&VMq$2g#B5Zco(HbUqUuE%NEnIZ!}WP-BwX@=*OBXK)g)wPc3UQ^y&YjWK?YaKfP
z2aa7=BMYVvAHRJh<kIVIM#3o^hF;%}w4z1K&65=RiRAUjy9{#4;tONqEa}+HSjI!J
zSUN<g{xK4-&*KZn3loWdj;^pyuO>93x4#GMe4`pEx7<fOF(Ydl9cyVVkU^ttw{MeW
zqbkg~$*Z){1KW%79%8PDte6cGFw;`*;_$M}M??N2nSDSa8J<@-TmTvhn;7`JJyH_J
z916*_a)20LoCAu7aX=ZctKlsAcX}I|uj@jx(e1BGI5&@BOROW+ik1t*)|(1QggK4_
z<zYkd96ORGbTL6Z*3l-3!b0K9r5Hu1`T6Qq=&I39F#h8aouKsEFg2YgW1p&_=jxqY
zydn*D#U8R_2H)(f%4vGDtnAYW`3_T&3}l9nko<h`vNzok$GE`LDfqIjNWWlX5ilW@
z<t;xvyq?kDhJJxZ!|rqc*;k&(rIH|tu3C*F^wNpMErBbdzpefEVu0GedWCj$^#r4t
z_<#rYE%#{$8OVBcwHS_Y44HC`beQZ+UKe`z=ITXP5PVgsF5aE?n{fGe_@DwdyJPQj
zk5P6KjhW0!HiMV&(VSi#LxbHD)mQJMA5&S2v&K!1Y$G3hW^>O*?lB3RPAI~vEMPIt
zIh%p;$jTMZq;S2S`(Tr(ZSwB>y^Q0UHPa+E|A{d26h4e~W1(tUK`oA~lHC*4xdmc@
zI}@fkAPK9EcofG>nFDT3g}S^g-g~+|WBOHSf@U@CxOE{3(}TC!(ppC$lm8kx*YC5>
zGHYlhpN4r=r13nZabj?nj1iW9l3Js_G+nG?!oTe*<xOXa9`sJ}99_*!{U_<zT>U$)
zW<A|ep20vX<T1j!bMh}?@zMMXu-AQ%HO!47?c*=kbTYm{?h<-*T}U|E?ZTH&PmlIO
z;%=Elcc{VnN>6%mG58U3<IBZ7$|!K{fxD;k^(-WEG5Oo}JR14Pl!Q~1`f*wDaQ210
zP#tgZw2yy8Fe~HmP7AuRB2A||(6FpZ$eVph+`pR-qZ87&zr2(0B+9r+V$DFjV)uI`
z;Y;3!R{6QZDzv-3?Q5)<ZE{ge=OE&XqF30aD3LCz(8HdQ{eTcax(nXEf5X^|81D`|
zaYxeVwKyG>XnF=3<nDZ3x=X8FlaR_5$hRt6CwXvDBF8|uUn2Y!tBEttyjjh+BD#7>
zU3+C;WbmlqzCn_@`uf}BM$duI*y_dOU81%U?WtAB_l+SE3Ee}7i~$mfB8#sUK7Z>Q
z-vM!|ua8s^+3v6TyTp56Z3Abiu62E0NO;52WS=Q}-Wo$00JG@me!J(^qBMIPr(Dpu
zc+hnmBzG`JRnsX%pak-@5p!2B6Zh<bAD?iLaLg-08dGNd--t>dJINC$A%j}(&=Jy9
zLH0M21M%h6wB-2A!J>qK8ms^?<%W}cO?_9p9`{fA44_wB#@24?|9b(>PhQhsGJXkN
z?a@W)sM9vCfApHF61BfaGaTtblAV>@e_t=eK<eRqYsjy(OxD1)-2AJd-OihS9^i-0
z8xKD83c0=r2^nJYdx3<PoSvR8wYo{8&!&N9#LZ}(1-p#ri2aL-U<;lOB9j`IcS~>C
zp6Q(k-Y~DK03gLNHG28!gs_60RIrN%a|krG)>^L9;S%{5#K44$gzjV{1B)xma?wAU
z(8E0MD@-qP84b#OQ{ev#bikNU8x}1C%(<$D&fF%2CI{K)d=zo&4@((2{<tNl|Gu~6
z#4TG@u<|3ZtbX*x**j*B5A#gf(rR__$mFtvcO|I2R_FZ!dkU`<BrCPi+2bkBkbo5k
zx{kUx_6)c9Xw(eBRv&^ZYdreEMhZEZY~celNR~V|hGiP{AYmbYV?zD{kJceR7H4A;
zM_=H@@zFiVn>VNkm=T%uRr^*cRTN$jL&PvUM@kvdUFQvH8#o?RD1X*<a^9X7G7>58
zw|%lp3+*C8KSip99uG|Pa*+oY9CL-MVAxCy{ZOM@(%v@S+nRB%{j{l70r_tD^+zos
zERuk_ID3;<j)0%I&WtBi4-t=u3`Q`NkclCj2rTgmTMVmIKeIN6yHF3a!7kDH5}iZm
zNQ#lilTQ?q*_3X3`G#Wg@$olfoq)H-trrx<y>s2?&E@6gd$m1RCVw{a5%CaUOwHS^
zN=ie)JA%c2dpQHhkSs`o4K>0s1s7!(Es0IG=Y0n~pZ`#$Q7QT@BpwgIZE(s;*mRb3
zA31E{>k9%YSV0NsucwSa*Zj3iD(dXSEDU|rHrg2UmOmP2?08B0zOpW+L{yS39NVKm
z9u$~$PE<0P%OvUsiETtJ6uv1~BzIKCW9i^!4-T8%^LvM+#<2!XANYn`ZHHW?7BqF8
z0nb=@(Nny^SEmIb>tXom>FK15qQ_CZZ#RJXLVk@4I8C!RPphx~CSUtgTb$K&9_~uZ
z81LO3NZ?k(@ETwUXKz+JDQdT$+^t+pp8BWX?W(7KL^@+1iew<rR0NFYg-O{gf$ul3
zlT4yN(Yk8>1rhlEW<P5ThkaTy(e6o~l7ZW4UEpcY(ma?*wqKjm-N<eYkq3G>i=g4N
z!}`tUGd(DMA6>$g@8T=5?&<tS0-$fl36#{h*_lJb8Ij@4i^<t+mE$W)D8cvF#;#YF
zOP@~wi(6$DFc{@#n$Mr}fbF~svg>2A?OZ)wuH%iEhY;ZKkg!?^H53MJUG^Mi&Cs_^
zdZ9(zb$J4ehTP=EmOd4f76g9WNy_qk7ahy;&d+AA%~&2yVBZN!`B`}=q+Lc2m0Y&8
zvi59~Fp_8TV&9ib^%uQ<-_ueDs^ADc$4m9atr(pS)XrNPrNWqOcapHTBxY=(HqIq0
z8rqeHJ%0iR8)|ku`w%2*&ajy)M0wcBj9aEs^bk}2>ofilk0z@6$rUJJxZuKD$-eR{
z5PT(eQLYYVdO$NnGcu{}_L~v;Qu-G?d_~^7_Cl&3enUKwyPU{8;PvD27td?-MFB7t
zw#$M{^!oDDt@EJe`}gk^eFwg%n*jj8--XwKC*yfJIYEJ&<@xdP^fsE3h?xj{GOUne
z{E*{5U>uMm*Zx06oMV}%IIn<0SaLc$5H^zUhutKtcdUr1iy#JC>%ZX2+BQO~FVW4y
z?jki`?-Rdh#)Un7ODI!EcRW*i0x_&GrCWFhms)jeV3sEDfI^-VM)DZ-w6Sd4K|j01
zJo<$m+!YB%-S69p+@83!>-QpP`OFKF^><Z5V<pJsa=g&>kf=XDL>+xeK;rgiRjxe+
z4A#JlQ)Q`>5617Jt^L1}h@4Rr%QP-r-i(6#@PT4I-PE-mF>7ixu2|szGu9Z5MQh=2
zz4O4j`mR>Z18UV3pyVl3$5vh&O(q?;+xL5bV(RzODJgfX8sv+IidT?gZY;D^r2cTU
znzBs)@xlUIk`GD_bWELXEW+hdTp~>{%$ACDznqy**J$^E2#ScCFUc%Z5_6%JzrqV_
zE;|3vWV=0Yrv+Ke|MGToSBk|GR*S%OKgu654Q@j$zCl)q7$yNmSz}xP9#6Bzzbyf1
zKLCs_`w>>Qzu3G73@S-zl?KN4*5t<{340%h&T-y}I%uy`jSyepMX?kRcPmSd;u@7?
z4*P3^)IuTRA*J++E<=oXd_$Au>aRu@F2%&J6Ds-$kT@HWey_AADhD?^kpUuq+_WP(
zD)pF>h3FRx)x<YDmR>RtJIuI^)=2;RJdK~y$uY7K)Z;ROwZ+nxg;TaTru7dzC8>`s
z+^PBUH+Ah|wie!)H#ZMN>W|_Jln9b^(y#2|ZLw`8Q15_$0%0{vrS*cst!I<ljqaqX
z0KHIvPL=*gwZ4_(W+6$dp(=B<+<pp-=;UT<{P6)0fbQbyQ6}J=+h49Nd02*~%a+DB
zHetwDJ0<G(QX3=GjBulLmhb#R@5Lzi8rSw<$oT46AL-0X#iyr_g;*-cYxwI~O#=fj
zsa*NgprzZ(NDlGUcPzcRk-{@(S$q3rxmn}+`NpHeaCR3^Ee@IhOa)G;ulzz6*z&c`
zqtf74W)jJ{p%~^1BGYNx^#r8GArGql@44F<Q}NN*elS3Ne)h)#<h=40^S_@vSqM6}
zcN6opv8=+^y5ab5C%<7@be`8jUJ=3=h;H3F^W;G3k-y-@+Qg5)vm$$DPB8Um`wDt6
z)(^`h6<QAaHn?xSRrISXFq722z80BCSZIO{x{vDZmNT^Y&)aO6qmEYBROgqx2;-F1
z1U^5LTR#T+85k#9=o)*2EXd)h&V<FHJ3qO&<nI)q|Fu1`@r8nEsRzlovh*4uaWgaE
zP>vjD<KOnTSRthSP*U7U3@$Jxj?(R^SZn1*aV+*1U)(yrJ7+CJ6i~>y9du(%7y04$
zY3|Z~g|APCu6x5jOVd>llAK}Et9X>M=t*&WcG3gm>s=7(iK&k}I_JT9rRb+42$1PB
zs!Z$Nv`F%A!3oR5BTK~-eI_#&Zc9=N_G%QR8J5xDc`o==zmbQ4dn~e<y^LP8B?Ms|
z*lL{=cax4tC=@4wkx8v?Yu#SkV^?X=x1<lH7~Pz2MhTiVt+<Aume!J56)|dU?jQ&o
zXnCL;uMab<iSx$wP!xaTB(*~%Wsc?g8&9?Y`<!?vIB>E@<4k9U07>4bi7~D8kp0;e
z=cjl;x`aJr{IQ`Mu6KEm4+_!~VxzTW3Tlkn>J30R{RnmpCP!n0E@njw4P9t5O%F8b
zMBxv4uy_kdeJ2uTx5l(-&~!WO;8>vxj)6<*11*jE8(ZHjIWT7<XbrV`QFB%$aoF}`
zb-vkYj-wq8%s^zwNW<d+hIIi0y5H{GJVc#j^juB=!}9*FNBl7X5NU(=vY+?MpG3C=
zVpU=%id$CA@D6x|FBr5Y?KO&c!#AWY{2;;g|7g1Icq-rbe^kh9N|KbBU6hlZ$~aba
zvbRFnvNsWutYc+YR`%YTj6(?7$BGlj%sMz6=XXCozwhVsdi9s*JkNdK*LYvo^}eqw
z|9zRq=iA`U993)lm*w$g)u4a%<q?Hq@0euo_Y`8<BZr$aZz-lyh&CL_4!NM4<#0(?
z%cQg}<=qUJCx6|yh4kH()x+zo{j5B4{(&ueA+Uzl)p$I!!SG{C=uP+fZ=;}Zdjb=_
zA!6Z{<ynT#z`p2ILOmp$+o9&wZu6A53VhRdqf-Q^9qVgglw2f+PR&9c$Pd@+pa#JN
z(0I8PwEYDwqI?NB=Q~$Yjs82VSI}XB)kKKN?>s}#&0h9@VJ&KHAEcb4`l(l(_x+9A
zt*np2&aZbXsuI<m_tI~*eYLXaDv`@9dT@4pha&UJp77i+&5GqC9mHDR6JlcY@4RI-
zkn8lcx31TsQ!?{qFudlt$Q4I2`YCw^%G!?I^a5S18a6wa=hrgs4{ZAkaFAWy-^rFq
zdC?>dI>G!)nmPLG+OT5q{IW*a1x<kybS8Qo<m6<^_TV8m6niIUFE7^(#mBbXy?^!H
zwJaL}{j#&h^cRz5i)prFdSc1HD^i5xUS0``Y$5yf5ap}4ZTR-woc_75gTB5y##FVR
z-L<xI{i|^ojQ>&zJ+vtm2zONe7?7rXv{tzGF+=ln$Cau6E#K_J_OTDpU9DD%ucIpl
zpd*p4)huY*UcG=))<nyBQ$F|$95ZpOQ`%*tVNZ~sU-Ec=zO1Yak~C4faAlc)P&=-s
z{m`bX{XF@%{@ZMJ;fB2`zl52l5Q5IV>1SeU_Y2bVDla7e$uMVhY+ZXw@#8{ktvJ(z
zTlB#<Vx%&!U8Qy|_;mQfv)?}Nc=N);r6)cmdmGPTWqvMdZpG0PAQ!;%geJiq_1j3J
z?YD5?7b5w*2jGQo%hej4L4ghg`419Q0Ve1*`E>A<gp={c@)?oEAOW!OJv#k??Z)44
z9am?_rW?Hv>EM`uFJyLKpi@Ejz#%mW8%xV&s3le1^ll*}GN*u)J#7FTlL=EZ#HmHX
zm7r|y=i>qY6$WJAUfWL_h(LOhSA-J6=#6Gix!(7?#{HmIsq-JFntu?WqsTB_z4NQZ
zFL!s%C*v928)I=bibZi4_q8!szj-O=I+O643Z9Mc!T9;+&Q)I#F8fF!ugpY49|!m(
zL(cbiG+!qMh)zw4PE8Wi<hG4CAwV7OjsTIawyW1ZkoY#4qc*og&`H!dZy5A`_1;2r
zM^7ut>^zpaCn4eaH{o?$AKss_es<${eWMU`o{I3<NpIdDPHzx@KPCPKy~s(){NC7|
zQx}>~pM7m^p1N@#%4+tXE67of5d+PuC7f_mRA16=f-;#2+nY=E&2mrp@|OGy&gh-3
z{F25&kj@HlQ2nI-0bJd#U}BIl5A!@&E<Y>`Gc6q7#8#)-OFWF{*qo@kaQn@}HaR73
z8B)(L!B1MSzgG#;uC`&ba=#7#7}Tq+F`UVci}j|z^L!$WXHh2ad}3s|^wyQ@Q%@J|
za6T6te@mEv4%x^0zX8>e`JD_QU54;0So*S^k<)-2)HKYpVi6O@y!8#Vz=PVYN3knh
zxpKv}@!)S+zjR%Hvh4Yzg{Q|0P+NIv(2YrV1vG?(0D!yT71F(G34&1n-o;c_!z;&&
zw-k6^5k@au0GWglvBScH^n`OHns@Q7iC0^*=;$7ic&cSV#BfXSH^ywUX<+IpaX2vK
zw7<xqMjrB&;Q5@twRC1r`_H@Q3a6YJdTaK*`<Gc@<Db~Qb#Mh){_T9&!QEb?Z!U)I
zxSqlhEx8Dzp%Urhw_6Xw-23de<ByXdlP!A67ysH9-{;yWGVQY&YUH(2P?ZWGe%`-t
zYc6%;*K-T!)~aT1EMBCP{WlBx<2CrG^^2#isz}Z#yZP(~c7)tgP`bbmB}Dsnre_il
z8mz@4r&IVzoDII|dv<4{KfC{wB)r|3U*i67<8gm_#LK_n`s;_>udI805npI*-e{?R
z?;dF5&r}WCeo{=^li=_R&rox7q4eHt#t$tY5(3mykp%XuEAF1<VbV|Bq+3M6Z?%Ej
z>vM(Lc3J|TRaEoK#~8lf{e5-$vOnX+`e*gfqRzsn-R6NQF6x|w0+#s3olI6gg0}}F
z3lhLzBd^Whzb}8OIL0hW@0E}89QmD~uA3msSY>|fSjds}ZBO-^-O$17ZyOi9`>AF-
zzXto9oxf2bTKF)mE=y^gw-?+{O>tndc8~}aeh}5jz$=b>^(6brX~vc3N%RE7&r^gi
zu2I1tYdussIC?#ZJ`7&{U^$%OXU^4Bh4yzN?P~4HxX`or<@fl?Wx{Y5>LdSo`Ik}k
zaXrYq?;NFb>;^6x^=yEvEG8`A6yc3)Hg=(HYTVr1O&}Pp2fYdnSsA@SP<`DF8vo!i
z!p)e<o^dt~s)OADmE$v$fR7_FxpMnf?YWzhoei!L9j}aj(-&Sy4HWx0kt{Zv{IDI}
zR^s2Ad5G_xSj69vI{VDh&oeo9##Gb}D|R^Qbcg2IQuAf0C-&5YXMdj&9bo?V7RLum
zG>gSTq~lbv0_m>sfxY@5WL!et^gZughSN~_TAR`9Xr7fcY(yNc*8271#}BASKaEhm
z{gl2FXg#;t0Z_o9{!bxE#t+av^qbmQMFcbm(k?n)jNY|QKm4Vz>XKFI$Se{uVd9E!
zRCc;4VK#~F9_**?J8u$qhdZCy`kViA+DM~Yeu4v4n~L6-9q&2bbMZ?Lem4KRuQzX|
zTu5E+ouK!15u-s}bT;_JsrIQ8Kls3FC!LiTYjhB+{UJOe!gr3w$Za<-l$?F!pIo%k
zz*7+CIXY3z=_o*a`!l!92+Q!(B26UMzI|)$h$>f!icqRbGfBOncK+5|{*E8kZ(#y`
zP-k03>hFe7UB4uI=GJ?1a%M9#8w~cg{{wB^@!(3{oonpaUlwn1501x^0mmZjQ!wk7
z1IGlZxzI9$sGb{_k}7FP^gYa{=5ve~Jfxzl4`^6piUFrv^eh;A;JXXj5VF%hf`(~8
zJ<6(0e|yv}Eo9hu_^xWp4O5xyo^&#h?TWNCwwG<X^?t`Td$Z|lqS~Iv#e0&`(@o81
zEH8S)yg|9RuvEQn;hM!0r*oESd*-{vA*BKzKCyh6ygiQ@eHntgVXV5EdmcM>JWToB
z0A@_v?OwABzbv13q)|@#EOQ$zCAjUQS7#*dJ<RYQqBv?dI%+Q>P8792avI7~O*_Oa
z8XiuJ7WRb-3J4gu%>{1iupV?N6jp=27vc&L6Re3~riN4jr_3Qg<;6J(*nuCgb?+sI
zw3^)i=E6NC*p7Yi>r!2%rHy-}MV-Tms)Y5L%055F-w&S4pBEBqRk1t&?&!|#f!0CZ
zfy*JYCC}IyLf{n1r#AOR)NebUzyCKo`OWY-RnBWK&r7b}P>Gqn`^J>w{22-g^Ut`I
z9q$dI<YGj{$h6g(vTMJ})1t<Dqv8Ac4I^bEhIIuFyRUuILd_RCGzc|HO_9twLd_m}
zSesbp*!-Wm2woZ875X(@vss>+9Q!x6uVfZG?5(g$NVy8~qic(Sq7E-g`+M&`9F^u9
z%KW|2?qc4jmHYN%jGNFKJ$Ol+*35;8#`8~`<Og@t+$AcEV0oSJ#?3Ik!s^zDn6<Sv
z(v}d(p-*g)e;jUOWd){iJe35l0{pX`MmqXD?L;~z9(VlhO^VnJin@I24(v;aL7Mk#
zlk6ty!l*%{yi(5%bu65hLBmHeHv8ozRkP!VC`^WmCYKNbUvu+xT}S3YK1Kyhj^8vz
znt0i~(ZqH;WZFLstq3$gxID3aVryO5uj#IikNg?5Y=NBmHS=BZM+JMYwDJPN(&$;v
z)uzmW6&X*e03Wja8%E%KbCowLD=I)AWP{;^Z*i+hn%Q0ABk1JN_HRvZ3Ak+5p%BIM
zWLIIoFy5{t>~7k@D;}26EZL1eCga)aK8l$yBi|F*iaFpsnf{BR-fEdf-?vP)&)^+5
zV)UJdzafj)qc#&c=8Oq>#s8Qu^*0YM<sr*HT{F{gN9Jgu^;jpTB#8t`9`T(jwS}NO
z+-O+tmi63f<>B$}t2$}N&HTO7FuqPGlM0&o4bIqFSsj9m-r}RL#XB=QpmXaE9GZU7
zdBf8>^|jby<6gtY!K9t%B>%Y!`~qi;VGot-q&?BQX&w!$WaFnR8f@>3d{2DeATU^d
zk4F`qVYVggo{*2ZpmBpnsZmvPCFN7YC(gOrR=b`2J1~XxjqCaPh)g4NzTMz~yQq9F
zGeNI2I%Ck=A)R;Q1&%CskHKYU+O<EP+WU2{vlguQ(NXWrQE#x!k%_NFT0d!)Qsx0@
zuNl{#)Oa|xp_b`SCImVer!MNWzuau0WQ~dGHHVr2zw&;;(f(lc8#@yW_SLb!>Dw5I
z#$9j0CW^xhE607Lh+fEu;eFaA{d|(CAUsPgdi-{@tuX1E4tunPTmMIW#Fpt1UJ$vn
zTV+ku*Kd5IdCnEB!I8IRsDVdMe*4XXtVY@6&&673-(vsVlIQV`(UkI<VBUn{{9sew
z*5vZ~ip<{Yy28U}(Ri=`2;0_xR=>nGeZf5d1tF~dpv5X{sAc<`zO6L&_*5ef>IDzd
zPI9Qbe^Wiz-9dg)-1BgAbF-{Zd}Tm^HFoFgIqxO>q@7ITo`L<0pewgG4Z2!VY9^$b
zsu||zUNg5{Wzck(hXO0aq4r)T^y%&t@Dd+jgy&$o?1-!vIYS%>8<hXsR@pYu1pHW1
z4N_n{(K`BA$rfo_iZ(We3%GJ@iGONr#BKEG2?<>%uIzTNXy8dy8<pgqPuA^2bLu$|
znQ3UcE*&%jp>JZhMkf6qjj_hT3K;bPHM%`^5ltdOaRqtKheZ32$64>pOlF+Gtf~7&
z?qM=H!-U-x&~5t|7`F;bNfD84NU9EJNR1hwktB$!;6lFc^VdJ3Z^HUR%pzg1?b4On
zbIP?odvMcph=9@nB~ohri<QaDnJ-&H90<XS&%!XDF`rek@9`W+rA_)@UG0wA*U8z~
zUhQtt{ZS#6Sv>F5c1^BABmU2T7Si2LfS9P}-XNT!)Zh>vVH43sr<kfz=uUwjD&m+o
zAl1lBf%T-!`@@P$y})7RP&`L~=AX-JYu-y=ga7&liu65T--NHNuGX(rP6{^ezeJoq
zefo8pH=e~6GuM<~2D-cgL-hyrirqDu_E;%U<|e+B{ti103-6_?BQ>qK`YNMT>X1TF
zxVXzlD||9n@pPgln<I)`U`U>2G@7#EOM2kUXQ#0Xx+qhHfL$M}*4GJAY^pu6E8M-j
z8?oN{Iq{?4iZXul&68E@T&Ui9v!I%_qQD-Ei(jHK9_GDFO(YVz9RfAoP2;HlAv}hF
zBw;V5?LXPYLJ<U%iCr!0Ute2eVPWxJh*DUu-|n*mMTSe4F8Kri6R=e|X`45_i2N6(
z^mMQ)@{^2eZ|#xE83tombIJH_&AD!thU0CcsJ)jOsr0onb#uBG)l#nToYF(noU$x9
zdmZa)o{Fl~m5J>}G4^#xjz{`1n2(lX+{!ouGq;3drLwPhdppMariC;i3gh0b`E|?i
zt$Gm)`_}|_8hpZ6V6eCV8Pc|lQIii5>WeKV#)AVpS)l2`Y~Z<8VYJ`M7^hB%HH{x5
z^2`1_MF)FeURPK*5zE?e?8q9K6e)Fm)w!)@OL5CIH<VUG;*kWp`^HD39DX<#od2+%
zx4#R-tG6YtJ~4y8uv+RyIxiI!v1u%1VYwE#7Q%D4>M@`7tILsVsy;b8R<R!K`Z%~D
zU9rLf*K*Q+wDb78R=uo^x<%h<*9{UFp4hD902)JsR6v`SfwP8Syw&huPzTrrNX>J*
z7cNw>6MFE4<{oTzf6Bg1b#&u6Zg3K7L%Ww?e7xA5E{nPE&ckWOiOv9OS|w|ni?}uF
zga{jwRqpOK%|s=)p0azKFiPJO_QN&P49P3QugXUxj6M8A=<BbLI9uexadmw1i@n-L
zVG~Avo!l>WZMG$#YR1R2L>mKa;ICiLUcX)(DbSnw7X*i<1wmFsH|48G&OxF9+%-LR
z>GAX|CXC|(n7_vTeT-zcnCe@B6p9{Y7WBSc`ZTzvoIlfa<jmm<p=jKj(%PcI3emgR
zJ9ie%CK6{9u(%)tP2Rk%>cOH=eHj6s<bxU>cKC&rBkQymSh4X%YHz#g-Emh2!Ze1U
z4}+nez*2`U5|>ZGiuErO`WiQ;i&73pdKMbgr{l&5&E{p2Xe>5sfnq^Ez{|?$*>btP
zb#W-iTq(xX`-k(ZDBaDN<U~_ry{i3pK&Uj_jl9BUN|R%3Yf1x2KD;us+=htbrocw{
zM(w)qc`$xJdmU1?D-TOZjEjxC!U+{ym0des<>YsV1Er$ZiZOne_dh8TlIwf7L=^;$
ztw@>@kLq|Va>wi1SDH)u`b~CX)u*$6=WKZdu-nSps!WULG#ot9L18}dk{CY0HRWV?
z8WNXiVA@x{1M`F^hQVmQ{MrjzDLSM9vKGgT@>au(jmsw3@(3XetB~1f&l1dqn&;z>
z9bQGz>_<yxb3U~d|9m~qoe+CZBZ<04H4s<DuZj?<@NlpU{V85^cU*Qnz#(8u6zzo0
zNGx(Q-OJlDLYWQ<;~vc=ANp)HtskOEY+!O{@ylQ2*I>nWTnzS15J0+eF&}>F)>v5R
z#$HHJ<Kgpsf?6;YHw#`s;3JXF%4}j{e5%UwSq8{o2jdzvmBSO(V~i8hMtlbyh4<Jq
z7g{$0RFi%Zbf?BLT7`>d+@82Jv1ZVC+hKNVNQO(E^QVsFVK8ldY}U*_Hh&l`O#4m+
z?P~wQ^-q+72p)H#I4L$)_3rLT4p((-14?6=!9lcC7sb)E?I_R1BAKnSYr&us)5@ZO
z^}DRYi=bw_E*Pjx3G84}eZi)As*1S2uEmpB65Ae_&Fv@5C(;`Ty+YB1;<%P$+>)YD
zF}0p<FsS%4KZ2Je@1i(8(#5NE3(hk%d?bZ=k9jyoQ)|LS17~1*zKYI|u4-%y<8Vjj
z7QbpM?AMoFCx;ow8eimxHMdIa9i3y`kl}#y!}*8U?NSzoi#Dwyx}@1XpG}7@>~@ta
zvy^aH*RoX@$?U0#^7k{Z9qC6U#a(u>!$;dIp;ot1)ZP-D4Ac^bF7>T5+TZ(WV9iMT
zyvfKN0gn0fzg_=RsK+IwuZ}`T-|86=NGuP+fqhF9p5QfbBZ@gvLN~P0Je|XxIkUW8
zFsE=qk9$?ZCL+j+T-o(?q`?2U0KgG<r9IC3<%%yf@O{1{;rUMH77V6*j?7KX=^X`(
zzy8q-Q=p?qsEoJabZCr+Me(R=k5jkwt(?m9QKMWou@k07k!Z9uADkC~r%DJbbx&~O
zCnSaw;Eo~=3Rv@un}jQbKGYMiH8AJ105e3t99@)t<~5n7OugKUQc=r^=iNnWq((Bw
zFn_#PwIzx`S{7iwV?JQsT#X%~%e#^p;H#>em43zBd55r4xW3{kQo{&?-IIe+z>+Tq
zHi}S7^xs~0SNv#d3=S#lx5c1^LqO?clWu`wb2m{dU|1&ckt%BV4=Sz?ZdA{qv8l01
zG2ITajg5}Lc8KSs(ZFE*MgUzlqf1vDS#LM4-5L)NHV{tP4ek}s9N}@+)jpqkmaAKM
z+_;uMny$NbS~)R)hmSmuNdu2SCD{r$Uj;kq4=E>i6q@)I6T^{d$TKu<jW7gQFL`01
zBjBE1r)uZvV(w`AKepJa+#^li9<c;bEn63H7%Z=i^eZdF?iN$pZ<=ju1o>5%{Y3_s
zRKugHyW?%(Pjj@o%iHObl7H$l0RdOz%H9zjZ!1+u<eq!8vwMIW&5u&zUj$1qSFpPa
zYeuM#ZFU=nr0<B<+!}8~rFo8aO>)@1`0T@wZ_Gg+=IERMlRmSOTtXGZAJI0cK4reQ
z6aEk>8CPDB!TiiZfFe8yArShI*n`=?s^?q+LxOhE^%YS|lm1oDaih0MhM84p&*#z4
zf5dt#H7JeC=<gp=z+ikAKtusPn_wv9s=ofFnw`^A(YzogPxbKn_a8<c!eR;aAmque
zH_TLfL2%v@?V039#Ln>U9xA2rAY2}zkb0q>H>7IPD8Wg*J~;`Er9-<4wqm5i>C)2x
z)O$U?i1(BY9?$~vJzvt}-mv8n>mEAzn%CRI)VB?z3xmPl{`cJNqj&dMF25t%_G8nA
z={r&ON?8p61=!{ve>6|8kMDLu92iGP{UKHP_Oo;2Ucg{}41Un6YX~lln$tmF;vF<_
zuT>Lk2NYl9mirXR$DD5OUUN@UcSoXB8Y`1!E%P$|5FxdI36#)Ygv~DSu6h+@5O|7?
z!hcN@x(a!C^7j%8i*>Y*@3ROqn~5(M*@|O377BEh>L_5w2MKTUDw-|+PTE%-`@>+N
zx4W84g{`cJaeNWOx=#+p>h6v&1|W-#j_C-J3WG(=g*Hj`D(C&c?g(7*t^LOeJ{Q~E
zo!^&sK>B#1O17h~XV?!cMxv{9%nN`;eg`7ToC&sO4O^A<?+cLE%L+;#fYr-qEiOz+
z0;75tdaOMvmgDdfM}lpFt-DZ^6o==-j%bT`i+CNOGQ(+}x&A8&>s(W*M6zaSyL6;b
z?4Ym}@vRhm^?0)V0Q`pW_$}b`)M|@q%4K?o->muJ;s&FB)X7c<-Jz}O2~)~6wzhvU
zE$`0EuC)^B(0-gYNOSG~^_4&9(G0V{K-1alis-QKM=O69&xkzIvv|ZijGxTTa3d7p
zKZv@!3+a6KgrtfVNLBGw7w^9j0a3LBY{dv=6!UW|j&SK);7bH=yRf~%8oXQ2w{6i*
z$4>%!fF63_Hb$0*uS}=AJ4_LUtVnn9tuC8rG?6uyIjxndzRW2wRD|xC)W!^b%b<n9
zG~pv;z{G*i8ZWIvuf*b_SWvD?&yEXtNxBIvEiT>%qw(=L&F+pYzi=Rj^_cG}g<~Y+
zuNz@B2V`J7x4PG_UOA)t{4cQv3WwT}?)rvB90_VQcipEPqDv^SMtlthxqPI*X0@E?
z1x~aY!rel?baxbfu>2PQ^f<`#*mUpwOQ8Xu9(e|S%Px<j22n$W7&N_eb!?k)x3|Yh
zL8O3V{GB}?Uu?i|z*=zzA&$#+Yn=t?$_uZ@;2Sss8_TdA9OPD~4tov~Mcr4h1@ToH
zIa*4ZTR;E|?Yy%J;tRdQR$P6;ft|E&*#Kh1?+U348?TJ|WT7OFg!)YL!h*bR_?C0P
z=IAi3{^(a8?vNZ{(H^pZjE3<A_XeaA7jykiXmc3GKAKh^Zv5aEmzmkb%flrS*u_Lh
zAg)9)hhnwi*M$H)AEqBRn>GG!|K1|LN|THIKnBHO7fqTu_Tg;?wlWA>wW(P`-$b7F
zg|YT)BWAO2NUwpZ2~hFOaF(|`_sZT7`L^FzU`*gN(9d^Zybvrj<JVs8A7VsLSl0@w
z)-<9!j9kvRC>vcWk38?E>eQ0)Nu^FDYlKVlai1cjp7}_Z;lk6Bb|=f+vTAbCHgpxB
z&`OONePMK5uq9HQcQ2%IfTE&m352Z@-5lC5zu~Nfr8x;oA6b~6+>4aMW!!{xkuq<O
zs^Y;|gpS@}RCHGBTw|GVif{^2K1*5U3>^&i2ht|F!O^{1V}PCM-3*X&(|^YzaD~L%
zoJ=*y=ur7X8A{wJqp2~_TwZ7^2TaXID3e4d?8La?x!sL5YC`b-W{rWG3J#tjUy?|t
zM<`G*a&~Ax5hjZkfhm*zwAa_j*ZOs^@@8o^4v9%o%rr*#OlOy2#$|=aPojmc_<FRu
zf^X5JhkpNULcU5iMp64r_|Gxxb6sJg$#+<M$Mfl}#m!1L4J;ClLT31Z%pgw8K-r22
zqaq5I>#S9%SK4*syG*twko=y&oH6?L;Nu__UF2rtM%pYLIEC2v;LsHPaVVBgvA*8U
zEMKPvt}N=+SfG`#<~X>K0O>@@)l2BXH*8*ZNxkB(5v9Wy9i0@HWmyL@N>v(`y2rZ*
zXfeK_0aLQMH;b>^qUmA9x<9q4lO1RKPr;i1l%C!iQAXh+rSf;I%s3FXN{Q61#ZouR
z<Xgy$)KDs#-NPQLld=hY1l|(nSe;AZoPY09!nEbAR|i74_IqHk;_uXpPK+c2lz&b!
z1W(aIlYiUpNP=(-YbL5lH~&5l^F>7~+IG-93{!qjAX-d}^%T$q<(Muq7~&2~i+tud
zvLQ<kr6SKYDomVcDSoSE-INyGdyS;wOX`2Rqe%v9R+0s%gI^GSGe^`hmif7vZ<&ke
z_j6VCYGp8e13C19=|~rS^3v2PAhytkX*=2S;s-^qyt5fAm7^$(^YtF4T{UNu80}dR
zJ5D<DKa=$x01*^(tVP6H7{fao0a#Ce^Ja6t;=$-5rLixjh$GW<Yw*3w>k`ttz*<MJ
zPz)4Fh4#^Ps{%_F+ET)1-&QKW9yr!hyJdHiPnB|DbRjcl^;tBhKlo(c4*p+2NQX!F
zxTf}tawP>fRE1fDSsdmaE&+Ut8&#@Az~W5Lp(n3f*O`-ztvo*%AEO4ijGGA<Q;!%O
zN;g4BiN1-Xl$_TKZDFq%|GJ_|NyF9N-NeJA&w*x%9c70bN-PC25*k53G{_qclcWTq
zc=J|lXRL?ZS|%<s3AHE8BmHMoHJJGYYC%3DUqxK8>3P<RLXN;~;~Eo0`(c_mRTVvm
z$2lPxehz}U%hto>#)z$jAS;6uZ?4j{@a~1Ar^a)mo~jCWE;v;jtqAb|!_y4u?V0_Q
zI1PA;h9PS8R!vD9cWrtvCDrI3ThXN_Ho+VSoGuwi#pQeaw+MIlB#xXdH`CX8#m^56
zwrN+xgY;qvwAT%|(N0P_H6}a)nOLrm#3t=x2}&5OhY9j1OT32xw5t?tZ1!GwbI<Q+
zoeEgKHigTJ-L@drV9eDvum9P}ftm|E`KJ{^n=2^hb0sg#IF^5nqJw|K!8wPxRD1HN
zo=SSPRspQ0dA5;-62{SDG}N__$y4*(U5bvb<CPUjwC=rn6w;v$7+by^(fj39&ttQn
zc7&aV6`Sh3{%c!advfkVdEGvlPvbeF<3Fjyb6ALfZX17n4(-(C)Xid}Nfs9q2P7%a
z=ptI0)%MvjIV_(oQ>pFRyASCgJ78P_w)XmtKfRkn`d00N&9mk9t&tula)v1aRf#YV
ziz(qL5DczF>9Cu<)Y=;=!bMu_x$f-AxFKc0@n{R4M7t?yrSW3M9bH5zWz59I8@&ML
z3L+ea94-OdIAy}U_yB&{CxMxs3dlRBg}&18XfO~%OE~~-i^r%XjM#_1b{~&TZ#8nM
zs;YG;&I^~x6xYv&Tv2VBmannk;nYyukAqb0A*5=RjVVR3XbJ{{A(mBV1+2VY>U?;&
z>c~d<<0wWGinypx3y9&87I3z(o6zQjyu}ivunOi<Cb<ZTa0L1WNWtqW1=5gfef&fQ
zAOh;d?rDu3=pux55>$6Pmq9?j-{VH%GE7};v{lf@B~X*_<=@I}5>R0n<dgjXqC#XE
zYOatM)QCS)uAtRdZuLo96z4<;uUz?K4nCB+1yZp0pKSr;zU3~3j987t6m!I~KL4v)
zmMX@n6~|Zgq4A>t*H0KwqudtpW=A$)-Y-5IJ4pOP>{mi!UAOvBmqS|^d^I>m?G1HN
zDuzfe?^*H8E>TGObhSrUJx#zoQ(&d+!NpOe)Agc^H?%kCD0k$+7_XB1SfkrsOwwEF
zSR=a>Yp)VcU?4u8>_yk8Xn^6b3x*Mx_aHb-+)M99_z((&NLLO?^G|Fq1EsjC;!h5&
zI&%?&9bc2x2%CUblyIlRKurB^i_@>;h^iXw0~7Fbgp-%wSwqTC%kx}P31pDDKK@Vl
zr_+4~8Fp5eXiWiFk_*Dg6<Aa06UFzL8(oPL-ej|PzPItvw4YxC6Qg2i`FU@!Jdhdp
zk|gwW-v#VjsRB4)jtp^P>?ljZpx8wxD?VbbGtYw|VWQ^gJHTObcm$HcP$mvYQvzR+
zo~`&`u-F3Eyx52kxkL?uhcnvZqW5VF#FnA{B!JeLdFr?A``$HC!C)a>-KMW3FatMf
zJE@yg-I2OnlNqehEHOu0cGmd(V=0o(k|&XBN(cnGhV7LE!>eSCAmHWrVz(%oP}ucr
zCK>ZQhYi3H?}BALW{TBqiASD;pB6ay#<{eLK;CJ;5`>?MK;$02R8iwqMj>S*mb%~l
zdnQRiSpy%wLpydqq{SIG>RH0U)dIEzI&9Q}Gn#(5W4=1wLBUEvwN9lDW7-oN**au-
zxBBfmUw0D_-zU&+d?|L+E5^zPY!wyho}mvHuc4~hBy3MPwQ;5_v<oua1i$s4Sl+g4
zP|?aii|Go3o6gq4l2K@Q!V__I%yt^LOFRr_%nAMJ#h1Yu$(RrKZrQ08tT<GhUDYpm
z3(y;b4)s{rZ&sBCOENoP8u_i9XitNKC^Wa4$SB8{K06bhWt7J1r>c-a+Fn&AQ_j-E
zlksrJh7y}hIXPg>-R4vLFU%jF2=RP}e^|GOQc)~NbQJnMQ+3%mkI#i_N!OiNnP5%l
z`?F4Eb1gv5ZexX4VEykP2%)5w_1Lz)ai-KFngwb3IJArxHR@Guw<Dfqkj3tz3Z!ir
z5?-pekAaU8K_YCQnA^BDD+2deRdW!6H!kKXMtAH5lT{0Xv=mJ7CCIfrY^}e+lin>d
zXLZR-%<9~IJ65OULPgG+1TMP7ETf^u^Ly05wZKnAbNFs^N&PjZdUf}gg~~At9rJe|
z4Dk~O!5G>9j&w@}1m|IjxG$u#{;<(U4mPjbQZ0GL0P3{e<sy3CFpNwBd5j)L$TXaf
zj`o(utViNPGL4K36qdMfqgp7wo_q_3AJR`ruVG+nA#?}}LaL@2F{_bCp?F*fi|f1q
z<!P-1!34T3QN<U%;U}*?^BH8<BCj9T*YB3RZ8D7b%`U+Kzg#KCF?4H)XIR6}QP?1V
z9i##60|Ek|8K>ub_uD{~Y!#$o!GB4jHWRhZD|v>yxjkT@JSg&XnS&;roK%??4{Yg=
z{9!Qk+e;NYD->pw*n()byV@vblvIZLYYt+c48hz~oU`tqD?RLuNm~#ds4l3U6I;A;
zv<9XEe--JMbUa>j-IykVX^NG@1Aqs`Y*)Y8V|470qyBMS#(uW>-D%1jU>H205WbqK
z1w}{KsbMXnHFxDgi2_IE^|-ie5S-4~r#Ud!W!;DxWglWU1L1H-hW@X~n!Ci>fuL;>
zVJi+H?R&t|fwZkwlkRurH83W0veE`j0dzDV6o47@`<tN914;*;`0>|_%LOHG_5)yG
z`+Xa}y`d<SoX$vK4VWsgXS^TL*jpj@_lGb_3$wixG7X>v?qIjbx8dgKI3Q})ET-!9
zmNzssjOsh8mS}q|=VWtnbAwvS_#r3|fpLUV*q9eb6riF3ksSa1`{!RTafQy{3lPS;
zRsmFnDw=&tu~*iTP0f%|sXu!g8^SdFCKG=ittReuo`&(~16E-XGK6SExa<5}T638C
zpTzWLIJjHk(}xEy4U@>u&W47afgf-2b??1DigB9{tI=QM8wI0lt;b8TU_|^lAYp=O
z;DC)Gq-zD37@oMy_-Qb=6L&Aia(vd87xwUx3V=B#?#yOe4lf)6=)$bM&e%ECX>eyL
z5-KR$QY1HE#!<;W1Y9WIu&>6F+^sX5<#qDgj!lC_Wh261dISYaVB>bmMm;Ek*$kH!
z6s&<6k`rKb9yZ=cFh`qz+UIZ$Vg-b6c$e%ifs%(}c-p&wwNFrD)CI|z>ee$CWOKGd
zqt~(t^+}8W_%LKz0A?H_=Js!Pt}U3j1{krdGjd9qg9TO7%XYq7(P_z?M9l^gaf1Zd
zjB9oq6BSk-9)$hrYoQU4H3-*Xc8@}#gXLyFsz;fp@&8uB>e9L>=w%sYx=)ief4s~B
z^TLqr1JWk`MY&AFwq!ryceZqeNgD-J2y>nB-rH=re}&bc70CEqPylhd$qB!av(p!B
zM2*j={1SxGEg{W-%(7Uc1UZafc9^UgQWikg*fhv!YMPmG8?Boj9vHaWUnVXg0i8~f
zFL4D0sBo;%RL0J|b(%bVwce>W&L^6T4ev1WM2hCa`lF*HE#!sgdcK#_o|AxSC*(5B
z&I^)wQQurw$KI-Nr@BtN`@noa#Vh=9icvH3C%fH=9)@hyz7k4lN_|fvuMFGucfkhT
zw)$grRQu0p=zIWiHx2{@O84th6=BC~cD^fi$sWr&olbxF3^%EL=R>$tAFR7}vb|Ed
z47>T<w!V_yzBoJaoruXr+itsGJF<WM|5=|?5OI{*HYRJP7M7AS5NH6uB<*o;DYV>n
zs`iz5NiCQCF10oR0&%E6qjq8Sw&Nx_zw=d<lmex`@olC!I?UDmluoz;GuD}?vNNi=
zuEJd6eTWA$%7K2*bITl{hn~t10S6u-4pgPmZpH^(^a8XxxdX4pVdvaUXCh&@)9Liu
zTFcK+P~z)+OHw=o8Oj*_NQ<?|`cz$t$~L9;LpcD>4bm2M)E^hkj4AQrN!FuOGXR{1
zd{86v9#Vx9{{_qB>xC~t_g(hqf}23OJr(Rk6)13W#_PXSX@fCYn45RZEa7lsS<K&q
zmX{fdcLpE}8d-}-YFPgwRL*QMBF<^1x946sq`kFkDtf(B>J%(49|X+^i1ci(^T`$P
zHo*Kq325r3l369wmC1>Ta2$njf|w?2^TiWqoL)RXENd}JM_#9r*Uo)}DB$gVU6sq2
z0$)*dduNNje8~FX-60SwfdT4bJD_N;n75sPH`>wJndW<Z@Up}WTnck_aUm!)9q$%3
z0gbB|5!I*4I}4c<^j)SJrPa*ZHbk+%f$G!f-!Dz=%2K$5iWC@n?G}LLVzTd(<7-|S
zEh3FnH9Bv$GivRXS5@ud@%Y_cs5%MFO9j@J69?|0dCfD=>@)gqGE!kSzZJXm6@_R?
zK;BN4hlf+*GSdRHx$%&cR!P-e3V4Q*r#9-cn%7H^m?QD;q`3RTfs$jsJ`Sd5#gm>I
z0ur7ssOr@^TMfklvvdI6xPdCnU_NDK##3Ly5X8ybARTWAO*aUBa|kgUcZAB0H=k$C
zJ+~1SUK7Zzz;<kNvcuP(Iu5TArnYjU6Boh{Maf{w-C*kT@f_>%oDHCK0KyE!!`8%&
z#;avF;VX(#-gYpdy0KfTpxK~yRS0J=WFF*A7Wp_3JT(J^S0IP);xiSKuTHI{=%D(s
z+0a_4|5&O?vJm)VegT{l0b(9Qege$NOart?$I5=J0~l+sMO=gC9QR9Z|3oy(@;`@g
z+u*g(=9c4f6`zr-`cd6<U*Vrx@Wm=#Vw}-@c+w)(6fclPH1_Xg-D0nukE4-M8i&;y
z#E*@3f1zCqMG&StYi?%M331F3ERG6RlUxQp&4m->;=21b-DsyD-Ay@+Jy5+&v%(b^
z+v5(YJxug!%1s{V-K8L6Nie=Jn_Ek(&qsbZP*w6zkDDDnTy1Or_8cgDYd5&8V{mq>
zlT}5V-yO?jbkxeF;!Z)Q$wVZQxHA2@qgV?2n+IU4A{IGpv58NN;1?hh+GA=Z6ma!=
zj4zIy4wk3sT$m3W&DYI0IqKqBd0`O|{ZnU^p@eE=j7o;xwtY4C&t_Zx>9KBA(ADLG
zU7paCi12~Ah+_7FO=PKRAHZzatVRoW;X%PxR((|!6$i}G(b1hw6)i2YzUgIUj<?q7
zL*F?ApoU)JOD;&-BbOc3Af4aLs~9TDD!gn2LkE%)$8=kq2jC+i9u2$^-3tr9n-=5w
z$!TFdqYDcQ;O+!*y%V~^#!4Ju?ImHpe!b-jL5SfLz!mV>0sj<mEgWe3lT{<xW_sTl
zod@D<!6T%KKrz#E+o&Pd=E}7-!JFns<!gm%Zc-%0{C>7yP*`YMYdK_;p#Qf2Rh?QN
z2t4`y0nY=OvjfCJnE*{xRUvcxA7v{~!qd|;;<^|c4$Yk=2~65w-wMlQLqG>O>KD&R
z&J5nTzE4gDyEyFdHN75Fjd7ABif(0m($B<R>UBapwY%PTi3Bk!H@F6}2M>1^UVK@y
zWCwZQ;gljTvtnM^p@b6i&3|p@4w*rzJ}(0IgyRDw)`@84V@d7jsUVvip%Q<Y3f(ty
z?KYnor_lFX3Y`>(*cmPyoVA_>WZG;0wbBs7C|SM!m2}=nTGZ*Qf$nV_<0q%_mCMH>
z{j?qJNBf;J(pi($D}{AOVSwer^8XC4$m;T#aN5&x3!v!Vf$hjFS4mQdSBZ!@=V&MW
zsWGheDh99$V4D7}z`o|F|4Mlc@W!@eo;JTUxaff@9bc7WG*F-NZ6RmeXNGP|cr5+;
z>TYP`<#hz~cDpM5?KS1=Cn(tSOC?KQw}-HaklCT>>g6G>=vdy86x;7}gBCnPl0@V&
zxt|#ui=||_`}SW*i;nR#B;pJSOl?lsww#}z2e&f-asX73fPuTscEFYq4Sxaek#_L&
z^<Q^Sh-7(RN=m>2_!c|&9=*TrS1v+<BR{!?SQE1&2a#ayl+%G)=s!DUnbYB<z2Dnq
zdhLcI7}TpR%KJ4-0gy8L(}4FtB|C1o_j{VNHc9{z(7SV9vk<%K_sEFLTE(b*gh%Qg
zm?<3(zU_Ez#s^Sw61Jy(2t#Sp_HA^>cz|iA?q$BRIEm#ziBtkVv4E9d1|*)nM-SMY
z)N3l$k&(%qShHIHf!6g890}@ch(*IMM>H@#c|eV@shaw0caD}8nr%INp~e}%G2;s?
zx-aQ)X77ZyBjkI~vodjnPCG(N%p9os9s&~V(*03=k-K*Xb}aj9An935^KDG~2?SOK
zUlNhB-`Vo*?lCo}eDO;Uz4cyo{>z`BhBn%-x@^O}VP<krrKW}l>N0d?(!iYqKd7NT
z!47B3Dc;`OINWrm*#@<XZDW;U^TWGx5eLc6Jpxr;e=encZ<GWVE@k#x&ZUAc1)w!O
zJv~Blt1HEI`T$tMvP5&pTTa^66?kC3&&|z295En1DI|xUI05LAhhWVD3Zig>@weBn
zUGo693_iC10hc3YH1c`@mC_TxDz=he_LuZkty1K8%>Xg;Nce{M;UTDdLcwoGxzQ!&
zoFr*bJW5!8-#?GM8q^S<gWprituz@dJ-y44xEl54)O8Jyhj@1oBN`8+)Wi63(B$O*
z*gIm2<V6km32+IRMs=uY1H>j9V2kr!==Bz6XD`;x5N(~MmpNY^ruLv315J-S7D+Pw
zaZs^<Bdd5`j_$C#BG6YgSS7gL7F5hF5?sLlh4$$NT-<P;nwk-6(H0~^g_;h=*9XAz
zG0<uwa5ub0zfdCyA~Zttx_jX>lFEeGa<iT|PcW1i+#H;)emlQvM<{e{u-cezP!{-q
zcGgA5^+1x{<}q2qzo&6K30oc<=zD^1V*vd{_`|5?Xx^QQ7pp!s%VPphQM^yPr8yCW
z`eSdYA@AT$e?!vkaIK0lw7tP|kDiXs*~JBbyIndvw>B^&I<=~Cx1jUhQ;i(;S`d!_
zzG7b|tM3sAeLRm376HWZ@bs**o$?rvV{8Dh$_K4%=rFLw55(vu4Dm!(eM`D4<jW~Z
z?!SB>BhbxKKyD1CV>_57Sm!4olo@K?CU_OllqZE4DwfJ(=mv|Tt~KJ|7VaxowvK^=
ze{5&BQD^}8YZK0Y;=4_S?Vw9=$M~wW{mkOukUxyfXR5&krDzsjpLxM@RgwYSAhIc{
zR%$}neTf^T3)UNdxk*YMgUSuqkC2^IG3neupd=<%jm1#!RtS8tpcbNcgNGB!hdV`Q
z>z(&26P7AHe7XY?&&^v;7~jAi{xM(3vSRsa)s5nIkFrS1JEBdd8>I`sSNs^Mo2xj-
z!8p8Cgu4JzneC7t=WJ#HX@&9Qpq6Hbxrl4@2z;PDALqES%Nq#}xgk4qSz9KUUuK7n
z$9~^Q@*-T~x^3@0+NE8c8YcI(5)8ALjPx&8eZ2j`cSe0#9|GM_skbfJ`gQP7ws2c~
zz2hwNDcD1QwoCWntW^AHr8U%Oq>n}uw<yQhA|iElPL}|Z33*o`Gy3II4AraRFd-{-
zZUHQ_xS*V6D?ZTeKnrCm4otVJb+-5MlMPTu<$ro2v7M%-6Il7yQ4xn;dHjevtKKlx
zw>HCHEz1gx`6{pNStM>o$4S;WfYt}=Ccv2^A?Wc<MP86S)-*y<JdTz>=eoMz8jT5Q
zQE?}1)3nq9tLOmoqj^vXHS+UIQUFrW@XUy$aPgmhAwCJVAs(}&UK*m4&144q&=YV#
z8o_tL{w?fZ5>8TS8+;;C7EW2Hq|8*q<1QsY-Q<icW%oJ&gq2)~rNK{@)nGEZ$~2~!
z8bkfp-L~`*iX-PD4~dt#J`|lY+Y3^yW*_ZZK%7lY)6}9kD=vamQj)`e{x`F<)iiYM
z+e%f!7HnB6yIw)*h9`q*@{W+DUh)OilQ@bYLC+`CL1SugCc&4cy1|pUB`T9wq+xq|
ztmVf_$^{$4>LidGq<R~7qtS7e@eEA++RMC4H4_m@F?`B~p*xdZ2vNmWTmCqo0Qj>0
zcRjEJJtvh|Xa`D0vkKbZOeYklIR<DRVolTXo;KnARJg$o`Duhg^7%~HmTgOT*dr*H
zsV2Sm&$@b9hfczcgmprcbnIzi7Su;i{EbE6Wc{$8PIl|F%7b1FPE0HcT~WBw*QH_J
zi`Gd9H<sc!ELYK0L)N%pRt&!AQG$<vkl;fHl_ZRxir&9LIs^(y*K<liBXRG8C=1|E
ztmGKcjb*UU;Nw<6=?s=fbs|Cat6ws7DewtD^O>}xZVaepDNO$*L^TXB_~kK;-O!E%
zTLJ62{9p88)s}0mqy&<ZS^2_DVu;KuuRT!Q>E?NqaPRbTUP`E}t37TlcHcF9I1E~9
zIJze&bE1~5IG3rqJNn4Mw)_x@KqZ^j@4xSV%GZI;k3!Dz4{hr|rvj_}5r=mDFD%e;
zAAe^&<V2A<HQU)`y5gHCQ=<eb1tv8QCP+1LZp2Gr3%iUPV(ur@4;`qStr!DR0?*@;
zzO(jPO>mB~?P>lIQU;9pfA&)^Tcd`iGJe+1HyVL7q1SUVV7a>&upOK-OG@}>W%6pd
ziY_<e^SW5*1h2YB?Ds%5WR}hpX#c~ZHR#KAQ?R>Dea2`Xy>ZrI=hJwZX~0+ns{>M-
zbI}y{aO_}wC5j_fn-;9$zXMh=SrkPGTVV@|)(RvqSebs?maMu>4j$ON@<P5d%_)2b
z$oMiO;~d>iie@<%nF&_sg7j3i#7dE3pIR7daz^qv@Au&)c|rt#0X0-R$+ySg&cemb
z!~+C>;h+5*{8{?5D7M=H8+1^ZJ9>`}JA*(Vm253dY;OQ7@<RudN1;?M>Xmo~86sCQ
z9h6;US;qRCbNa4i%UvwWk?zV*j<tTqB+Al@1Q!l=d``jg)m^wG{&#RHZ~Nzk=^~cj
z@QgVr(BD({cqN%&Sz4fISQZ=EZ9+&9dshdE1;dO#^pZ6CTE4mqHBn<A?+6!+j?&*3
zc`Bfrm|U+q7m6$)#dkWk!C=N>P&Nb=8|NTE&s38$enW$6xVWcMTkyf)e2z~nsKpfP
zLKOq_Z9FL(6UmWKAESv)*xy_})5pWZ?%tc_6z+g3i1p2Lv_c>~M$qLjP#%H`s~o&t
z%`C`@WGhRZ(HqpRS*-_oiPANHaPX|VL}3`Db|-E@{_Dn1#iiJL0v3hBcD%^*g_gr>
zIw(fvrk1O-sElJNsM2FR3~>^`uBp4TVfuQ2wR}m3(GC^KyX!V`P;$*vn)0+?S%HWM
z@B}5=6jUJj3g@zmHZ?`IxRz!apfINSVHUMFi=zikRL26}i6#c?2^=KFqOTmXjsae>
zz!)VNFe~3xDiXCWk^xeK-;c|LX*T$+Xqr?70PV93rU|+{)uOc3xh2b1tsKd5!bsh2
zQ67><QpTn+)&yQroCYjEzc*x-9RQvD={8TIs;9T>8;fb0Q`z(Bq3Q8-g*vOg#?!8#
zprLuT_90lzCECs1jB@ot8Ow=Gl?(}|p`|1g?|`GZ-W{}RC2a>d7=|yWAh-E-qlsLP
zi{0HJeOEw5-Y_1sb5ywK`rbCtCoCo|S*7aoj&IgkTCnMlp-u11z!uO{Iik4X7sXav
zIm2@wd%bqIcHdlHcQcjXG&2q6;Mpw=taSy)x(Xd@2+tLg>#DQO9sBzPafHL;<GJFp
zaz=L__qnEm)HgYRITT<!>=X>nz!^G&i!mRIc2>};im|#oHhrNSCPTHt)-TIUYRC}6
zQnEsC?kBl}l4$;$6V=eHr(NMPn*evoR7~wcIYaezwtSD?Hu=zsnmh`BqA&5xx3KBz
zMUW=@AP~Lrw^`^cEb=>->^;tC)C>O8b?E(EMTQ!r>G5mERa(Q|uJJKW0}fcWVOIAg
zZjVW@-%_A9%?Rz~MJ#WLsb0#No(0p|40C5)I6Iu7V=9O;At?$Z#4SCSyPM1d>Qzsk
zGG;m{b;MiVaKb*NTVvhwl+{|u%0L>VPh_R}VEeN*)=o)Xut<)T^kw1zn>2AE`*%|u
z9+w6PkLyx|7ra*&AP0}I1<sh~;@}TT9-~$tK3H_r%u?p!R^@S?X!W57&+(r;7viEG
zZa#aJTPsRL*akI|Wqa@~<~Ja=3!KU}oiKBl+m&A^h{oxB>4yRTM+fBvEQWb<R1B(j
z)9vIOOgjJOt7vAaW{J?Y`LxyUBvJd+-yh6S@ie`gF&BLVpg=R2UuFWy>)w%k7GGsg
zIXVm&Z!2x;G1bxB>RdI}l-TaU^4}xRnBtNFn;{JDZs#EjD$pl2K=fM?VT+otgp|G{
zn|!;UpG-49nXW`sqq!J!=<nc1(CLgIjVE{FZT~Y`6J~=BD3+M2LeaD`8L!dUKbNHY
z6{Dz&t%+Y|Zo@BS7}=HaHqp2OnoRZ~X-|g1#p~rQX<(0({ZlMTa!)<_&m-{lWN;S6
z`AiKMvwv>q)$i?6RZ!#W<o4>j%`46^<|L2TT8vjy#u27RfevJz7^mm_$M?3n(f4;u
z;!K63(8)xV6-J+)O_wOpWFaeHJ@OlNrW{zM%}dpgT=SoloHj?4s2Opw3zlVu8llb7
z(NPxh!X|T7I_mheH(@v}RF&8kn;y&Y3(U5!+Uz<6IU)VwC+j%ZMkgXO`hba)FwBMZ
z=e2F<&QJGO$go~((Q^ORUJ9Aa_LD-DFyYWw0KwZMM-Y+Ve)Weg<ub)9ID2$d{hdyN
zL3)9D6uJl0buV_lD96Pxhh-W`+zvEI2QSK%1;z77a7kvZBBaPNIhn5Rp+pXw2HU&J
z-@gn|+?fl!COQvT)KWBv2=w?Edp{k@2T(BrA&8r?pJ_1ki(woce(%YQPE00}_~h4p
zh8o!feJ?6bsPLFC4*^Pk^1`pzlH+*kwha#WPQU)+nb;SiA+>B8p@c%C5s7geo{_+X
zYP+whOXKvkm!TB$MRh88V$fJjj0N#~DIE@eNk;tA<;b;n#%V^Bm9nJ8Ki(v_Q=qT}
zi(@@WMhcc*2r0F_H^_A(zyOp6bu61=CmywwC?7DnNl)d1Rf5)Wz#OF)JJxZayY(2Y
ze_m0|yIXykmSAIg^j0cU(L@LQs%}z+u;6tv(~s>^og@&(HaoOk1xB>=+t(_#O#hZ<
zTXl2Q$FJDo?CD*M)dNE|cb4F}BP21QGEJ_cL6d}XkPf-B49vct*$JYLvvC_|i?4O~
zRWh#HRUYig{^IrcEp&8<lWp#k!J;Z1)GE!~-KW!`YD*p93mqOqF-EC=n=&6lRN7^<
z_es#M+P#`jEO-*TR*sD62n7%msq5?d++_zr%(jx#laOyccY>)W?#y1*n*pyGu6nz9
zx7kJ8w%S9bkbg0I=`@7s3VmM<aoIIwm^b8u7k!lbFPLc+GBvpB&F8>AIHFs%C~o`6
z+@@NJ0nwzP>7tku|9hiQk{>axi2!U4!^WF{*XNhn91E})1a$#AMPbU-<Ir+=2_^)%
zbkH8cSp&#TsMVGUTN0ajn2MSxx94q9cBfzF2F_*Gi(fAh0jB0>Ix{P_NplLu@x8Wo
z<NME!E+2M4i3terF1(!Yxxhwq^FYqncc}=C5KGYKmz!h<SbaDvNKl5qOt6{@xKnRP
z>P+2H;G#>`tIc7j9y&DEY{FC+DNmj4RfwH?p77~shuf|;(zKKh(XAN!<??maCR?YG
zScoN})CMtneq45Gti)^NhpHVWpL3<ZFV+kEw^=EwpopM3&b~S7!&CiL;vRUH>dCt_
zJY}Eus8UX5UGvK}O)@h^*y;lZ9{spvt4K&-NMJ}KbmSryKt@ewNDkjdMKw!b(y9J#
zabZk@yEC_|_vc%8u=Qc!M%REit9KDd++TME<f1rs=+EzZduJ=7luDwSOV|oH(9(>a
zxU39Z*Gd9`R)2+*9EU?$L~}@7TorK#q}dGs#x=#EvOfT(9DMVL)MRi+wW_8uED4oF
z>tO9o*zJ9v?!`__Q`NIq+TL5El_yuo>jk_1x(_*<d>Rsz{FscJGuNKxb~!1HPt^BH
zAJ&7y@o#>j5(=ZDjgw-_Y^zC6r(=t@P5@Kng)MldW=Lg#p-*%04uIzmd}h&&fte?8
zH&Q0pQO@?Exm9r|OYG<+ix*LR$|!Hytn}SXUWaIhR{}Im6=WT2vdeK9czYX&HnIho
zLG;^s*@P<bgfcW*wd+Py)h+87)aG_>6q=IeRA)?Eo<;^rrK}?S+E5Woq`DC&5OBV0
z-ajB%u#<8t({v*9&grBI)IxZd>hCJiRE#1~4WXoLfmSpFyw*~EIl&tNM5f}G6-Edq
zo)@d6s=xz4^)N=C)Yr_;DO>Px!_QA{g#VZfWQk2OH-=x*xr#u==Iis^2q-JrSqXpN
zZYutm?EevF$QEA%7x!zkkstU;MGDbjN=?8EF1qugDVqzV^vM(SiLy;w;3zf!bCkCF
zTceM=JK`1#oZpA{zW_e9E@uQ(AVBtf<&)Ib>V*&p&*z??qMTxp+A~qn=pHBKgPT-!
z?5L0!-#j{njE@*~>zoXEF1{jz^<s{M7?oQ5EKN^S`yVNqO)+4OgqxeWL4{$}BvU-2
z9;04;v)G8TPua{ucbT5sKl}q7p&(Z?;DvBaP}wIHCAD4}KwRW^bm5hO@H#b+x940e
z^rvm3LHS>1wf~<!6+Bml&i#Q)Z+<;qm#|x>JsR%PwE|KvNs+i589)Nge+FSl6yR0y
zWMVtor2Ah~+<(WJK#y>U-pykZoBZR!lYl226k@ciV<BM;<!6y(I%5Y;n;OC!h~<^T
z(+TCP4+TDSd~8mzfBl%Ea1p)mGH_=0ha~~9j}aE*CJ5n_VJ=WFdT@LWLLKKIy?736
zaiMOJIh+$zm!iYUlVkGeH=U!D-2mHPe>*slIrOp*QK}8Ku&adPvSeZgU+M&X=^*C)
z0)mr=;fHb4+0{MY@QUknBE_tJufrOp%eZbI5stQsTB(cqdQ5Hik7oFPaRU>td=1iz
zj7Kx9XY_2JaS24np%r<?zy7Vzf%C#eikA4$y+5qlQQsUDJcUy+KdHRIM;3cQtE1vu
z#Rv}FNI3kz^1eJC%C>L+atjsG+;yi28A>WtNLlM{&?FQ}q9_VkMwXDZ)fO5=ceY~e
zYxXcGB}?{w##Xk*VC?(wey_Tp&*%AlKEL;Qp7;It^_StA>pHJ<J<jiOe2=p>6tA%Z
zO6I<nbT;v<eTdwm$k+N!Y1qpOD%5XX-|;tsjqM~CREjEu0B#?_r?Uc#?s)>S`Pk6z
z^q2ghmV|rf@mj|-d>B_+vvz8CDto;g$Zzlb{GIvqW6)r!2Xgw;z`y|Tar3Cz5X9;g
zfDwnEM9s(o+uoH_eezfiXfq%I7Xs@&`UYoq&GLS)9V$6Bh0e6~1~qs!+lzNJhAQ&L
zIcHADMwy7>VX_Xh{QYq}0LFMt$k93JTeg1AbTtZs0w=Z4B3HMYnwp~K8Q{(|tRueQ
z^^pTC5J8c_%A;rpzMScXg_Fg=2|)U<5(Bpym)J@>pJ4Aks->khGP_*G<WZVy`pZ1#
z)CPULkGz^2%d}354_M<Q4joc#9yyJ!J|7_w8U%D}t}&H58J!a1)fKtoHJW&$iZ_h?
zHSE+Sh>tEDWeUC!&D9Fw@{&X<{3wtO2x0=%V5K-)-`vh_3T!5pP!~f;1C^wZ>-*72
z_S53F+NG!IifDKExbny~J6-hs8T|2P!f?{C8dgfPk}bU_&j^1=wIxgCts{zN0nZk+
z=uF(QIm56*Dz<d}t>y@{gBbOHsOGSvYaAHt1Sa;8k@@GfKd%T5Mn#tV0XaLGXzt#P
zYz;_M1`#C{n+yED&)3&>)tQ#z5BDdC9uD-O-m|@6dtu?6O~a`D$?2C$2UmMM7T07=
zy;%m9E@*3)Pda6}%{8ktBcLqxfpUGX>W29Yp`s_DW&@1Z;_|QPyuDZiG1wN`;P|sy
zFw+vyT}{g@9(%|k_`(r%D9X!2p_(OoQQ8<tc5PAepa7!?oT)}j?+||e^fr(@g+t^w
z<~Y81Oy-<e2-Fzq4$(43Bbb3c{5$MJA?ZtI_e;^-6EU7l7V=hoo|us1XZF8epF4&>
ze%+q+9W$}lYv;nE^p;)7-Xtjxnnru}Vl?pIWQGSJE!@V&My}Vf6`D@6e9ayY8SRkq
zy-}^MZ12u+tJ-7!wS3wXTu_BJriIoQz9=ueOQdz4($7E`UGD~8Wde;NwQ2Uu-+hMQ
zJEQ}1IODhLO2-e$@!hw!ji7Din7h)-2pf`3;aLTQR8wP?U<WDBH+zd}3TF`S<%2KJ
z1G}GA&aBb)v=7hLpI=`r-)N0p&nqVb3rVBVLS4MxLT>SA#tNmq-Rbim`Z6{SQv)9=
zeRx)>sP$}_+%?Ja7r%lwH-vYyAE~Jc)Yy|k?$$nVBGAEMT0OFV`Te1*1X^+!ciNW_
zgIqfyHsneKc!5!Q0@tmpW)<nWu`6xBP>XVNaY5_$icPPJ;?;xpE(85OOxOT7z;4j4
zM4kxPhA2-WrAIu4(|(GBW!Cz^7NaV2tc-Vwz;GB*s_NR2eOZBhtLQTs#Z5h=QtQo9
zXR`N=Jo@wO`8Mil!&49U$?mk@f%$F!T~={TwkI0CA?#_`z+`0FPNyo2^doUGb*}aV
z;mH=0+3Y}=NE)MZ8A7XHUB+F5zeGJ=9E~UDk3{7+^jU2<tVQ?tSzVUHaY<@4%Y8iG
zAWJ54ueQ2mtVQxq2!C6v4?p)>gr1Sm@7_$)L)c%%y*#Wx5}2S7ao^GLf}I}lQcrnr
zyebrO9U_wL@0<nkf&i$l0(@mOBP0w@Tr2#r{|%4gRK+QWXG+hdkIj?!8OTbEG=7pI
zntQV(mlK$chl?B6`x^Sw__5If7)<5DQlRgTz;u<6@aFQ*EtINrB`>|KycRU?cX-Ys
zQF-^Bv(`EaGpUdFAUoSkEP!sU$spN*B?X9hdNI>5L1=AQayL_{tEl6t>uOwpq&zT@
z>hx1rSz_#$<;FbD<n$3^gl}zz*eIV`fnmGzb9uY{IWgD7T_R=(k|`b^+FJ;GL^YXq
z&s2hHi!3RN!<!{>5?->JpL5rdS8WxQ+Z2uvO6OWMTHUouR!~iwCv&CL17sS(%??LP
zCh>^v8mEpOEN}CLF3r<KvJjEmu+p`VtJLs}OCj}bsIW>xb-@G|xmj<uHZ3#27b=*x
zcXt~fhUjT_O>EP}oggIh?0W_Ntt9qswhtASwz!=QzYSg6st@&-Qeo1xgFA8y3!Ss)
zip5xpK1gkbXK~-0jvExg=B#xL2cGTQ6TdA=)jIfxkZ;j&w2Fb#n<<4_x$DP8LK@EH
z5c}CoZn3vs)7S6pQgUwX>x+?l@Zdq>a?~@I@poUYWL$e$h)O8}n;q(3%Yu&0bu~FY
zh?0G?5~biI4048k#0STmav1sgm-NN}&pPU&>H+S#AmmZ58kJdM`ygF`$UJjT>c{w3
z9NX?4iQSWq1n)7*6~HK9YcUCw%8JJ`TkRxi{w_9)+mH)YK>`XhRp|z~2V}GJ^PLK{
zyZFIef%4l9pS||gY`jKC)f(SwobGp@t>*zw*_MjQxR!snJ@s;3gp_f%$p>(&Dl@AI
z5#4jM{xf^|KG;$=?as+y4Lq+W$K~dhy)BAcqr8ND<l0K0@6E==$q-KkkqQ5U>Up@Z
z;#i}6vC(a(4GpQJ6*<|!qOac^QL@o<xz2cG0w&f}Jw8)Tax@R3{;APxefHRiL6nw)
zBH6*zp?AoXxh0=PYBNNqn)dCITB&?^=fwHT1yWc6%Yb-cR~L(wz%Hg*(g!5UQSG=$
zj^^3oeC=Tpi-pN!?Tv=0Q?sa&t}EK-inl{jlzlBKijlSIum%zi_`mVV$r}aM2Il5A
zTl`R`K`@DN&zE1z+|TzK;W}+v-AA1_v?P(;b0;vCILod(<*w|R<F7p(SXBq2X@!SF
z_FypW577s=^pIz0N~b&!zFN>+zH?umDP<0WS4GwHJ*JKgIo1|zMQLgDw?2Xoz}XFT
zn>u1tluagkO!mAF*d<ZST%e-L#@Pl1DaL&;)aB{BRqyi@My|!~?p2~A4yV`ecTOZV
zUWFd1K5Shr(EO5;SXP3+cK5KVey6I8I&`>^n;!B$!K?#kCs4i5>dFc>PVW$^RUB^s
zS&|o!kh2T$d`fSxlGpkg#;qYzjsXkW61b*@#;y&CVeWxa6{urZbwSsmyqMLtZVneC
zh?UAbQ4Lr>itSyFfZ&*5%C=J7;}^FFRX<SQ&^fH?bbaD&e{(B?yMKK>Ok2?VSq_k?
z3XD=|0_cuDKUUxh91#J5q7*owq3Tp<4p^7EENF82k`W+^6%us#dJNOt-|q#c2-=;N
zvn&7uA&)o$E6!Nym03|%Q`nEe;B`eciFvpd9V_*eh0r|Jf`t3j*^Aw7M8}Tb?21h&
zcUVr7d)*l1$P?``4tv}d<Bi@Mm4OlinAB-~V~=@s0Wb8@(5N%1xKZZ5Y?VbW5Hqji
z022Gn8Ln~ru<->Kt>aTo1e~?dLWl4E?=sjx(q8<jkdbqX0cPcx2e%`!_jf%}V&%#v
zB<mgO-|(DBjL`*etEIu<*rhHovz}H^#eG6uEL8(`sp9glq23t>+(O!bbvk|aYUz)z
z>KXS)HPR&y^Ug)*5&`)=3v}P}L>X@PZf=b_{OD$99P5<uB0#}X@P&4D!w&b0^Y>hJ
z`RxCP8{^;wDVE*dYC65UF~l$tH|H)lycs!O-^0h5korex?xOSZ3wIaKjoF3>!#^>*
zO?b?@E$Vh@X>a)P_b`8CS8iJ!H&-c%2>Kn96!YM2-__hZ^;6FLqmPb;LD}M=Y~|cN
z8&O%$US>@h2`trkP4M527<ij<GLUrpE2C)S+#S_0v4!WykiohLqnM%$K&gSPF0cxC
zflJ!Zud#b*A~1f4y|WhlObVZsQ}^*c>0RpJcth0df9~rmnp2OdIY`}ind8=!FC+YJ
z<L`{|vfG{8G>M=`o^`m!NyR%{-OOh)L!nS+stRmGCRF8$x%p2F1vWI$dID_iO#2LS
z?_Bp>9&TN#sjQDWB~9RxEczqR`Ak=!2lSPl0lWgOOoG(7drx7pcncH8h+|{j$7N&t
zS+K7phE=UnZFNbj>M($)!^37(o9l3_M`MD5f)r^s-~x7ZyVj?^YBy9Tf%ef-kKvd4
zu--mbFoU&KUBF4tb9EZzAoqcd*Iu&&oy1rET=Paj_jhHyqG{uw{TIuC2zf&^W5P6W
znxFL#%7<G7Mm9@(w34&2@`G0-r4Zt}bXcBRfl^!#bI3tg!OHvNYX#>?7$Q3`=u?ZR
z6We5836>NWC(_NzKzOU4*6w>Sq7Kx7UdM>Sfb={(JhIAG?&1`|uRnBa1pusiepnOs
zxW8-QJ#^mx5`ygPM701UY=2;-L=z(8ubL#tk2loo4<adH<7Qea6inNkS|48b63OYS
zUJ;@9lQqgVckBiwfPlr}-&ij+fN(QLPR(fZU9Pk%8MXYJypmDj(%m41K!tFHs3NB^
zQjYM5HCTQux%61~=ctmBlG!R$U;2R;?MhhapwEbT+uA%e&N}~q=|AoA@cY8s)spJ2
zenr1uO4<MI?V?t2xMzH+G*b<STMXSGXq&TK6h)1r`drqgzlh1AX6X(5>U-~f%8RN&
z<?<h#NSS3TV}3k}tK+$|Rj4)r6g8fY;&YCyf-Eei5LF0%=={gy)!r?&iR_Y+Kae9q
zwDBYD&&jyddvu7IcV%nlOZPA9ThnkIyavV+TX?j~yGMMxB$%lP>xB*j^XQjyf*y0t
z^Yl(_yEd>yL5;jim1LB(x?!=jEoUy2dVniCcVd%Y5gZ=C&Kpn$rmtcrQ%g!#;VfYr
zoQ#}YtV6@8$60dKY&T_4bda#OS;vr5-qO$aVYJ(9tW2C#4yN!7-z7f0m8cD?;lYVR
zmc7I8Zqj&7X0%Rzd$N|;9}^RU%FZ9f+mh!y`uh5Oe~gXE1N=}Q*A+ZU<XJ<_l3?d3
zLhzcfGL9Uu90EWv`!dUYKVbvL_A1!Q$WFe1k+}|_*PyQqrVt-x*3w1E&8>ez-+XvP
z`Sux6iF{eU(1q&0z_F6b2lJ{OJGyOG4^I|cbvzXkbWR>i#bC}B>=Zor@vIP&%_Ox&
z26Q=AvkTDvv#2F$k1*=w2L`Jz3V&kFPZ?ah7g=+Upi>OGV+6g5!dqP-RCT)Wh>de5
zxELH}t32JEL1p{XskO(UQ56TvKf0lN%a|l{e#}EBdQpS*rH-KLg0}FFl>Mwcy#s}W
ztLzQjxPGFud^M}x@6E<kYjOSS5&GWxnQK`}F|4QGp}vg8urHrk&@Y>LX_fgtF)7LX
zQ;b1)FKk;uI<F>ZHQEr3R*F-j_JHxmym74S$X`D}V-k%dtpzX|gulc>6vc*W$y-kO
z_4KA+FIfQP%};N$wN5IboVf_cWjNDy7db!f4smZhj96^yJ-jiPmuu@!5(#0(uT4i2
zNV6iA!503G<u@O{##;KP%f*%EK2S_v(K0J(e_@EV^jqK9yOjU?rNDLBOU&!IBg*rk
z+UZ5NuZ?cXW>E7iTLHc=&eTbbmZR%1AiL{1W;NhT=3c?VVck<S4Tn_FCnw85ro<7D
z23jm_*mJ^H<S6C`@Dq(;gY4muXRt_A7xeSZ%*=#5go46CZJS*%RZ*L$NsT85pVvv1
zuaQEv(AfsmyZ^|WP*+)LHhE3{?td60;z1u~_ueHKz3{VOj&F2_eiOPu6?*-{X$LgT
zzMn5FofR-wagOKt3<i^d@yO4ylUHfUyk_8%v{o)4f$6TMD>8of*2sSnW#d;HP~w<Y
zy7#5I2sV{*$3t729))cEHs5JnKAuy@u5Zsr1>_knWvpDZHsgC>x3_-Q4W^&AJC@)D
zYUo!>hpvdMpu0(!e{Esv?TInoSn2$!WBfE18M(lD93wHhb51$2Pd)gxiFV;>)~3@i
z+?8)xNz`7s5llk6G0$_7$SpS<SNgNdK?l`k)MZp<ROi&^)C-hyCMuQfr&Nw5Tw(-h
zT@&e*YUw8CeSYB~!1AgHRE`-}-+c!!|5F3rtW}fm9ceA?Y5EM;t~#ho8`t=h6k6lP
zTI1qWYZ>HuWM0c31J`_OOUpeOjUS(Kf)dcU&%RE=l+>Tx&vw%q1x(>2+N*<Jso@Xn
z)N#j$Vn)sGkT}LyMC~%=&4{DnzQU{gmt)e%ueg@8E;wD+>*RL7V<nn#$@Sfp9hs%f
zPlKJ3H%eV7BdiyX!qkt#CFWxP#`gdzbm}3LE#HB0)brk9v@zBTYz~b;&d(v>c#+(A
z&z;_pQ34^P;*t`mT=KoaDmWl=d3F?qK@mpwHRf;v06s%^{>+W-e+=B)f)=#3VM(aB
zyjv<xJWdK5N7H3x$f(LoW3d#U-U%atg1Y9@T$!aOTONO4WpS~S_))eYU{E$XRq$EN
z*7du7u-4#nWZ<zd5?qHaJFiI6sRW#S?m`h^*qJqpXP2iN`>p^%nYG~eWDJu?miu$1
z*Y(Xe1z{&qiDA<1C3!=nq70Ho-%Oh^R2OcDP7w3d=jW?WsDH|=GoHs4SY|I~KGwh_
zJhU_POK$sUH^;NQCQ*{qZ+#XgDp8Nu?XNZ7pqN%5+1kHDe?8K_G7_tX)4LJqdyXRV
z*PiymXA<jsF&;#+K(pL-Z=az)l5AX_)#zJ%k-W}?9M)3%wX>+E2k{EPI%JiES0r;I
zLf)T~+_C2cF4Y87NLx88>&vOqL`3Eq?&APnw`6~cET<}rC&+{Z`QF9l<T@JlZf_>$
zg@+{C;NKIPr(<Kvx)FpMNU=BHq89#os;yXdC^a%p2C9>muGAE{-gmAyw>lMLAX-`8
zcAv9Cfau7js1n6hUx9aUXepJj>?4M)?22}$IBKyY$_KlHE;$phqq{5+zJ|i}vF{{_
zz_CbHsXTNm@O+Fv{&}*R9+oaN-0N%MZ?-|9G<Sy!XNh6(I)}t0EGeZTaJzYek>iY?
zn=%{nh9w0yPcAKYDLG_H=j+=HRe7n95enT^RPg<_y_lEPhcF4(#7`Q_AAXIc`C16N
z;yR-8@<r?EE%vgO{v=m*y%pYQmzg{$nZ-`Di$|%(D&Luodx|$SHe=w9n?@|&&tes;
zRMW@O1(MmFamTIN=J*9H&2=ry7h5~#Ee*Bh<I82FnH_SOe<k9fn$+0<Gqgc5Cp6>b
z(rg=2%X!;nZaGY3yrWkbh=&{rk-_>|cj+`@Foq)7kb=D2ko(q}3I$a`g`pibmed0J
zh9hm>c<tkjS6oQbc0K3;xc;@VVavJ&$MPdK%&a^I-D2a{d0wL8js9k8IQpd1K>ALi
z8YL`D18*oh@k85ujufqAxjI5xW}Yix%(&PU$ci@}tWOVHpc+vK4wM2(8#<oqRyIA{
zh%ZO73A!xoZ!pmhKHj4}uTC}0vG*!qrdVuT(5p4@5~oY4Cn(YTrKr=MX4H5Y5pnZN
zsiFzzNo0J=@up1NJd^U`yf^{p<<McQ`I^$YN6GR_N1mw$<-Kgq{H4j|s@NNjy}XiX
zizF6rvIg{@GZ{<MHvR8clMZh%->3IPTwYhADIQ1*i!TqGkH|fLYNgJgl>eQQ<=y%n
z1fA4viTxzKniaR4^WrH(f4vX83`HU(EQXF~TGAItHijv=ViR2<mkW%XYjkM5i2uHt
zob<j?1c@&O`@C|8FEiF|R#%i|Y?KbBwcFPj<jaO6Qk2Uq-CBB#I4dkOHb>3Rn=uoT
z!*b7yuhbFq#Om9R^l3)+)y6JqQVXK($JMix7<0No^2H6Io4jdFc|Sfsi2c)JE<@4!
zkrErketOH9qZ`bIjTKt0mzQMpbj`sDA!b6l4#3l#<c!~<_g}iJ@!D{PLI^vAFBYM`
zi@$O#GY^*%RiGD=SXO;PjW&^ILrwYOIY;4aR9ZGwZ*#Rpj(UJkV?tljMIn!k`_-G=
zwpJkSCwm+j!En68OiQ{*yrOj42{B7uGotEo8Fn!V0lcmbX9bxFjg?bC+7CBg6QfQq
z7)xAtoFV$ex)=T6tSD1M1S1fx3ZI(##a^$v$K`%`vh4AU1}_n;pS=c!5_X$vs=h0s
zgOm^=Gav2#X)RRcep8K)fPIVb4zlW2MA>oEz&(RaoZdX4bV(+I=9xhxVUF#7;KhVE
z{eH}))p*+!ar{Dn&Vvb8bDWM6?L{TssQ@{B7FEU}UA)Oi@ZsLHQD9IIZa{7b@@Bgt
zOinPtB_Ehqeyk>jup-F#j+MwU5B9(Ym~sL6qjqb^X<^`1|MdshDj^6kY#!cU;z4ut
zpM2%lox3=|F3TjgNeVU>Y(STGiJ9Tajc=OYgFYDX{u5<wkb`K}*njhZx(_ZG-(me&
zMi9No#Q4SK^YhA2)zFCzLAIhYGI&p*7XIaj56TsA!RiywW!t@n&|m-a7mtIh7uXC`
zA3E#>c#c#k3v2wWKjY2tkAGG2U+<L74e}-UQrhAc8O5J(5PQ+dhjG$qAAJ3PT73WC
zM*nwTysN{Iws8Er{6C8V2nazgqVY%sd5Vg6{{J6L_(9@i0)Bqk-_Z2DsSg||Y2ifg
zuz|loz#&S-YaJyB09`D>@fvq+ZEdF>cii6ET6yB!AU@}-Dm3{*TeyUwZ80qo&1C^d
z5<icgcqLc9To19H1ln9rfIOKaqi$#7C3_R-8d^Dp2PnE|yDqeiwWl>Iua5UKC!KfD
zN-dh>(A@w$)AOuAo}})p8^28zp-pcR4A}6_^!LvM@?{NSIG}|I2Lr^<HmYoZGk%P;
zc>@}n1JtEB*K~HV*SQ}eIN^(@W~xOX`_mY8i{-X&D!y=&vZZ1WumIwnLZ6sWf`jg2
zLDs+437dowNSnP2kgd-FO;iRJ4$Y#uo6m;{;FY@Z?w0C%#h17J5*Ob%{q?bL9}=AQ
z%@&pQD&y8i2<vx_%J)I$s@H0vm%=T_=f04i6bUfwi^}@Fbt`A*MKp(cGy49?oDk_o
zO#D|?Rse7>0wtsV$#{L(7}DALqpOqAW7{CbAPB|loyJ}sd3nnp_ChUmY3O->*^joM
zF1#L3G_()q7^GeRrbi?HW@zniJ2mtIB6DI`xZV2gnvnfYiWb)svm-WF4BA6FA97Un
zuzu!OevJspXcH(R;6AX2KT1%6Dw<b<D^HVUY6mIMk$oB<3>PY=b!s>a&y7YDpkgO|
zT_91L?uJ&O)L$;bdD*a>BHrQ;zCGogse=970of@CB-Qal!mW-6&$S5gi&AL6JF5Cm
z;d3+xw|8R4m=oOP;R95d;4RMg)${uG>!EyIe@DK@&__Ic@NVnR65~UL0%7Y5)#=AG
zPN!Sh+BQ%_14UbZUG(=IE(GiP{-G<V@Uw#@^Ztju{-4G}cG7_o%w(Q*)UR7Cc?0f6
zDq_ay^hmu8*fgJ@oS`3QQ#SeaLJ)3oHH9t`%2x#G^`*_--3I;Wa6lt@2y)?)y1IH_
z7o;PT*eCH1qWb>nU(Eo?XRE*?_jt;~pJ5_+^S`Seot!In3P5hGt0@Hf;ocBcFMVhC
z?c<6dwEvqMKZk&S5Fq{1X^1Im-yNvrQHhcZI{DrA|G5IvchXCzffUFD3*1NXC{qp2
z=0g+Eq`753dm!p_fV_&^p><NY{Am$n(X7z3Vh5593FQ33LOE=4aj_P-p<`CVIL0R)
zPm;x(ynj9W-)#7AeG2rg^(K2Xk>%L<E{5DTAUDFSzLZ^?GwuLJ^*~{7$KXSZfSG}@
zW$Na(>Z`;6G8-cMhq9s@q7|Iswb7(~U!h3Rnt^2WMlx)Cs6q`HCu&BXKvQvHw`#vm
zhq{%7wC?>H;d{YZoMW$DMO7fbG33uqPEJCE*V!&%7*cA*V%=w8_sTyZ{bgH4t7jAW
z*gx);0waqF)IGlu?_Fz%bzXybZ?}1@l3MIN)~P%pM@rIZ))_A7yxB=GMhkC!_D3y{
zy;-;IE*Wh}(13lDl0@^p2WTgsVgbm9Ac>mB#{IyiqEY$srSAb?s89vtzq_O3g!5z%
zY_HJx4|-V184iKA0kjpCO#WVu4d48m#qrk?^KaMC|C^UR+29G*?DW1DzY2mY1i`Cn
K;WGa;dGud31pizB

literal 0
HcmV?d00001

diff --git a/demo/documented/bcs/python/demo_bcs.py b/demo/documented/bcs/python/demo_bcs.py
new file mode 100644
index 0000000..c506034
--- /dev/null
+++ b/demo/documented/bcs/python/demo_bcs.py
@@ -0,0 +1,66 @@
+"""This demo illustrates how to set boundary conditions for meshes
+that include boundary indicators. The mesh used in this demo was
+generated with VMTK (http://www.vmtk.org/)."""
+
+# Copyright (C) 2008-2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Martin Alnaes 2012
+#
+# First added:  2008-05-23
+# Last changed: 2012-10-16
+# Begin demo
+
+from dolfin import *
+
+# Create mesh and define function space
+mesh = Mesh("../aneurysm.xml.gz")
+V = FunctionSpace(mesh, "CG", 1)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(0.0)
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx
+
+# Define boundary condition values
+u0 = Constant(0.0)
+u1 = Constant(1.0)
+u2 = Constant(2.0)
+u3 = Constant(3.0)
+
+# Define boundary conditions
+bc0 = DirichletBC(V, u0, 0)
+bc1 = DirichletBC(V, u1, 1)
+bc2 = DirichletBC(V, u2, 2)
+bc3 = DirichletBC(V, u3, 3)
+
+# Set PETSc MUMPS paramter (this is required to prevent a memory error
+# in some cases when using MUMPS LU solver).
+if has_petsc():
+    PETScOptions.set("mat_mumps_icntl_14", 40.0)
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, [bc0, bc1, bc2, bc3])
+
+# Write solution to file
+File("u.pvd") << u
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/documented/bcs/python/documentation.rst b/demo/documented/bcs/python/documentation.rst
new file mode 100644
index 0000000..ba0f612
--- /dev/null
+++ b/demo/documented/bcs/python/documentation.rst
@@ -0,0 +1,103 @@
+.. Documentation for the bcs demo from DOLFIN.
+
+.. _demo_pde_bcs_documentation:
+
+
+Set boundary conditions for meshes that include boundary indicators
+===================================================================
+
+This demo is implemented in a single python file, :download:`demo_bcs.py`,
+which contains both the variational form and the solver.
+
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation (in
+:download:`demo_bcs.py`) of a solver for the above described Poisson
+equation and how to set boundary conditions for a mesh that includes
+boundary indicators.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+	from dolfin import *
+
+Then, we import the mesh and create a finite element function space
+:math:`V` relative to this mesh. In this case we create a
+:py:class:`FunctionSpace<dolfin.functions.functionspace.FunctionSpace>`
+``V`` consisting of continuous piecewise linear polynomials.
+
+.. code-block:: python
+
+	# Create mesh and define function space
+	mesh = Mesh("../aneurysm.xml.gz")
+	V = FunctionSpace(mesh, "CG", 1)
+
+Now, we define the trial function u and the test function v, both living in the function space ``V``. We also define our variational problem, a and L. u and v are defined using the classes
+:py:class:`TrialFunction <dolfin.functions.function.TrialFunction>` and
+:py:class:`TestFunction<dolfin.functions.function.TrialFunction>`,
+respetively, on the :py:class:`FunctionSpace<dolfin.functions.functionspace.FunctionSpace>` ``V``.
+The source :math:`f` may be defined as a :py:class:`Constant <dolfin.functions.constant.Constant>`.
+The bilinear and linear forms, ``a`` and ``L`` respectively, are defined using UFL operators.
+Thus, the definition of the variational problem reads:
+
+.. code-block:: python
+
+	# Define variational problem
+	u = TrialFunction(V)
+	v = TestFunction(V)
+	f = Constant(0.0)
+	a = dot(grad(u), grad(v))*dx
+	L = f*v*dx
+
+Before we can solve the problem we must specify the boundary conditions.
+We begin with specifying the values of the boundary conditions as :py:class:`Constant <dolfin.functions.constant.Constant>`s.
+Then we use the class :py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>` to define the Dirichlet boundary conditions:
+
+.. code-block:: python
+
+	# Define boundary condition values
+	u0 = Constant(0.0)
+	u1 = Constant(1.0)
+	u2 = Constant(2.0)
+	u3 = Constant(3.0)
+
+	# Define boundary conditions
+	bc0 = DirichletBC(V, u0, 0)
+	bc1 = DirichletBC(V, u1, 1)
+	bc2 = DirichletBC(V, u2, 2)
+	bc3 = DirichletBC(V, u3, 3)
+
+:py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>` takes three arguments, the first one is our function space ``V``,
+the next is the boundary condition value and the third is the subdomain indicator which is information stored in the mesh.
+
+At this point we are ready to create a :py:class:`Function <dolfin.cpp.function.Function>` ``u`` to store the solution and call the solve function with the arguments
+``a == L``, ``u``, ``[bc0, bc1, bc2, bc3]``, as follows:
+
+.. code-block:: python
+
+	# Compute solution
+	u = Function(V)
+	solve(a == L, u, [bc0, bc1, bc2, bc3])
+
+When we have solved the problem, we save the solution to file and plot it.
+
+.. code-block:: python
+
+	# Write solution to file
+	File("u.pvd") << u
+
+	# Plot solution
+	plot(u, interactive=True)
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_bcs.py
+   :start-after: # Begin demo
+
diff --git a/demo/documented/biharmonic/biharmonic_u.png b/demo/documented/biharmonic/biharmonic_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..f2e7fdc45a3856d7c2de380ef0f6624601c6bebb
GIT binary patch
literal 35721
zcmXt92RzjO|Nq={&f)CM8QD8Z=2<xzotah6OehpGlCyUxQWQtXNXQ7;I~2(#dt_6g
zvi_&<@Bg^F$35<IkH_cze!tf9`5K=XyrB*?k{t;E0JSbo%NPK_AOHZ#A;9D-ij()N
z$X}p)#yT3n+s~Y<<R5T*JsmCJ^z21yc>RQYh0+sec@F@n7|uQ*ApHd^`67k4u7Nhi
z1PaEepisCOMg9*1=xV8(`b}&!SXShAC7<&(Y(EHk?!R3^ZHCP*Lkl26p_E%2w{u6@
zaQPG;9S3cPUS&GUe$=Nue?iLOLVicS{Dpb_Qu~V;_V33&RdKYN`?T$$GXmSwv@gWu
zAw6}h=8Nn74>BIM_Is%r(uG8Iy%s;&8TPE5tK_4c4qyrXWAb48^~Ydw?yOdl1F`Eh
z@56)hb9dW1B75&TU>@V>1ws(U4aYkyzgzluyVUODc05r#JAQu`4pcdAG{p5*<({;K
zwt>N+nFnI@-LJwAxaS&levd2t{-QRo<1zOkc!4lG$2vQ=>+O7ck!QAYzGk*;hy0mE
z(;-Hz0UUq}J>Z#ZaH~JS$)f7-C-5{yGzC(f{<z8oSLTE$D`)0xoYwCA`A`!S(o5Zy
z_u`nAE(#`-Qhzn{yI&G?lycj4p+ScYg`}_li4HzxJ~@#%ic|9v_-~i*7L-cE)9x&M
zhTXB9?aa<RX5r+kj+PGvVz9)e^l(6A&I(Cy%G!LGxOlANw@o)4KpT9jcXVw1n<aPy
z_usy?I)nc#d9LID%_aPaRMiiT5*5V9ay}lGFuJrh`xLQ+>Wp&1r~RYvbI+%3&j~fP
zCkDryF3l*R{1o7Re#&;cGY=ZT%`xu{$C%x}Oxa^GU^<Nw2qK5`)S8PVCCl<_OOw3y
zZRM2rGhO}DoryE8Jje2lrwlq^+Ae@LQ3%uc!`|;$b?f@vXUdC)^;4cU2K%=BPsb{n
z8k=pPxyDEvA?3Qx!%=F;4*5>Ust->tJp7^e=j7^6Q*ggs^Fm=_M=+H8s?USXrJYWQ
zaxm3Jni_?jyKT45Yd5o(Uv7VTp!p@_rwWwLNp;pL$+*eyS@VDgFJ}2LnzdH)x72j}
z>5mViCt^E0ip^~c3o#xKFVsKeIq;Y#n@9)?h0U7=gvI*pm^WR)A}rz(*+7pN7V~|$
zxy?=aieJjkcXnC^?i&l=qWlhcr-Mu-&o;MDe(N3epQg1Dqa27)T{_$|{_^B|-Y@m^
z`3?-k66NiwE%?(cK5t7LUPN^VAF)G-8Why5J1(Ii2i)^4+p{-47FIkKf{)b5Hj+8w
zDcQYH7(Wvv(RiY~Wi$UHJT8HS;>Cp*=A5Gsk8Jrr(BuDP`9d%*3PfKXC<<tS3Sxj!
z(ozJDSOXHk5>NN<&z~+z|EKIP?K}@;8vlylxjx%TnHEI@y#53<KTahQKA)(IfWX*i
zZXw1f#A6KNDPRMk!~use2pXf+V*=aTw+$9Mi8{S@vbJq=ZvV_jeoHS*W+j%YMrEYk
z^=awlM*-p%d{2q2Z1-RUOH#o^$lcD;u3!xe8*=S-VWBM}9M{U*q~ZW1yWae=E;SIW
z#Qg}w&CPSC-dGfvR$u}Y-j11zQ{A2RIN$>Itu%yKfpA?rB3cHZG<F4pct_EMVp3Ap
zBr-DiWcYXKiHA_cKL=8M@q7EB)O2lY0@YMaa|c}%lUt(%48jhy6Ir{4W(tnt!7uDE
zATXUY?;_hgAmWXVz@=!3H(SY&(!f~o$xiRC?Ws-_=$|#xDxMV2#2nn2?S$QV;i>p^
zqsa-dFxyWQPrx$37uTO2Q`0ZPc{QNwczppVT8r-*pi2pe9s1-)_Ux$~ov<vN?!Tsi
z{C6;$qm`Lx+O65;vs)<>ddGu1>g+Ac#A9JaPi%rX#aWxan^T~qlb{+<k*-s71}GR5
zgVyNQ5|IW3=F@TF!&v9|8v!&kCmKiZgSY;tK=t<EAF00wRi^6Ohbg0|C(T7jNI)hI
z1mb-MA?6W7-%-hrH-W)0Ug7knVJPS^Iz|gh0Kxdgzp2+L)buRCn)UkU-AX%yPgVYR
z<Qd7vp8<ZmmeY-`9dwiC9%7?R>wI~L?l_Qrtw$qG34>f4Hk10Z|4a%v93hPOE}jGp
zw?PV^G3a}5h3re<%rIcIxoUPkS|?P8Qc88bN%5Z~XC$YOZ2VR&RRgJBLujnUz%?Ta
zr;j^`c<)&hgblEo?w2LD5MLbMV$Ggny}}o51pDEy))e@r?<&AAK&R&%k~>8cYSQ{D
ze3J6?$a>fII5`dcPp(b3lmjyk?#%fKj|W?iYt1?(JE_~~Dd7vW@aADrL;d2ELn&%E
zNI%p7SkhZ0PL!vJSG^kt2*~2??=U<zrckEmgeB5*3r^L>1n&?3_NccWYLg+m{>5mu
z->wf<x!+1M0`A(#8&)uM3*vG(w)5_hPGh<L{smSdJun12cR%t<qbQ4dCm&`JiD?7s
z7&)PI7SK2XlMU6Q!ZGS^4KW_UA}5n-UabFO^zYa07jMu?sdaIrDKIieTbqSt&~Wm#
zhN7Dh)rXzn!j1kqxlTOxn^MX*WgHVUCG#%_3Kt1-lonp5qq7(R1GN|h0UH73y4LfF
zM`^47pyq1)O6FWiaUa-7w<Y@0;i&be6UTg_hS!6zMxHzJhxg@KYpGK@wB%TzX56d<
zQWa}Q5fm!jhE3_AqNL?Zq&K8||8^&8CiZk9;y<&uJ%3W+(RFy=Q*qvpa4xj0L}f1u
z#w)8uNr&1PS1YPlvt1O$UW06`HZns8$qEy4MQibc(5@8&Rnh>}qLtru9544{azqrU
z`H5&c9R3|#^FMnPTlgdu-rv+6$3R2DO#=g-Rwb#)j2zlPwJtCtMy4$*uzv(Mk7fYu
zCav&e?2RHL9cZkFi{9}^tOgLuC{P0rm3|w|1|ho5wF&67B#6}?AP%-Wd5+udn*V97
zeD}vs<(HnyI|Ts2l8%w89TtzE`uS8R4?6G;Yy1|(Tlh|`2MK}!F7hBy@(_V2fcv72
zl@zj&!SuF{3eS5!g_^hU?ixLIX#FJi;Lp#K4|{&|e7_T$7h+;he@*Usw|69WK^{@O
z5u3LX3Q?jmz2p8K?*=|c!}9II<LC7r#~PNMT#^$X+VzF$k_Q8b?-ubM(T+iBv6mYZ
zV=OBz=vdyEeQH#g>!dzvd7pC{t5Q$1von@>@kU%$FxzXgP&jG)5r98}ly~wOEa9T)
zxw0JQ<f=$D1Ow3Er0;H~+Sk8xRGLbg0tt?f(Rv?^aJ=dc;csE<krL!h7gN=rqDvb&
zn+_m1!~aFYe80I%FANp9{FUt|kuXL*y5=&R&00%v;keobHqx(K)f-n6py{U{Wq~*`
zE#3zcK9*urd%&$$A}e#jEo9$PIIBQ6fUgV*-%FpYvbiyPUh2>Gcv~%oHc{kc)_V5`
z{cDG0ko*2k3p8`}hDS816Fh7!M)jkrl0I8j?YMDq+mL$c=9LXjBY%wzWn-bxwV-HJ
zazZY$JZLwXYJ_P$(q~~ex|iYM>EvgG{~3WO@Y}q%yM|<8QRXgp2D*)RTE{wDL^nTo
zh=QKKOH}!iv91d#Sk26N*91i{(L)cv<j1{LtbCdq3cYDZur9w-U(>t<YuqU!gY7+a
zZf^O^V4AcvWv+DrPb2VHK1dc7A9Y;x>w+%ETJhd96!8miH>`kB6&K)!H$!NZJQ>Qx
z`=3u3pUPD&tK^S?sx!8SKPwXur?hTub0Z(WcID{))|?M9iUOFOv`tJ)tEtBWWp^#d
z`@fh$Twc)faerOASN-R;f-=_r(%#Bvp2Ee%#!oj-I}y4Cwwl5&DO90^I}u!>Gp(`b
zq*N#U6v*&h+OV2Oj2b0lU-J@^q?Eq`;d;5d%edOuE#d?)Ve;o$zFvl5A^fg7##K}y
z5wRFbsyrTo1Z|@p-))l?G5-*@*mwU+F=+KY1{L~D0Qt0i$!a9LP5!FTRHKAcBWv()
z&273LWPtw7*tPvYNi{Hyg~g&84AgNI5U_YgJQo-ruXZk4Un>cUn`Ff&liovC*<^yg
z$PlG3&@-Winuc`Nc!af}A{UVw8WzuVvz-<mJ2rIAh4)51*s1@`^H0uM(|!wjyKAv5
zX%<veLm*N@nEFh*2;Rv47BVy$Hjmw2yiAe=Z(r|AT(Ge=(t55Mw^kerFOPln^4j&~
zyo(WZt#jcV7k^K<k*&awYj*cmLdJVf|Cm-V8E)(3(LPjo{!m7i_RKdic;BO^3u<ob
zLY;qzImeH@@hss#$8EJnp#ZP0O4A6`nN2-Ekx!T)?t_(t)nIVuksSQtUp1#btOUc(
z@FJ_{ch9x?pZ!1mS_7Kjd6j6|t-MovC40AkPa+^uZ4&>?RMG`^T%zP690uc}{cK0H
zn7GXNP*}3yhyEaesGf`0q_k^!91$WgDNmzgb7S{YY3FubUICfeb-k9j^KEYFTs36W
zV8k5sM&j@Z6>A6g=@-<4&d97aN?sqF1y~1F(6wimTE+x%Y@)&IsvX2XvT0mYNy!C_
zgh^!^7trAXwTuYL-q@w|-YQN*1=aQvrC)0B#6&S0+MVBi^PfsPdiC6+l<7KO9A_|T
zS+Ev?r>v!i)uI~vKQFvz?yup8=U(C5qqr0Ydh?#E5GYcq3}&mlT$qZiFhs`{8d*GB
zc~PNU_9j{^4K_*lnxS#-#$E0k6n+ni=J&a{6D??MXm1N*R&)$i(X~7&3Nt5J>qK)X
z@rcQu=<J!|g&!9%e{^c9mBjd?%N(%0CM@}N@Cry8T&<f@E{A}r;~sa+`F+~NL`Bv3
zXOuqVeYoBK@_)wHeyxd(M|swFw$AKk^o!%Pw@^|E)TQgxm3rvf`vC<NQ?6%I3=pkN
zny`ovWlcPDuQgxytoom;4c8cAJCZb9a07VtW*Bb>Wjrdbece5#XA?7dSaWZbjhD<X
z60aK2l`SDjRuCq@Vq@G^teF~hW$<;%rbG~P{N8UVACEp8C~#BKDyHl;{PhFd7v~&>
z5$U-$?}AOUEH`e8^hh(b@p*OJO>k=SZSG)d{N;S~WII6Qj3n>IJSq*kS$nEn4UvUE
zLt-9DH$OZoy+C`O#WeA>)exCY*@`v%=3`o;>P{fJr%I`i-i>mlV0bSE8-s|rLnus5
z%L79YALoIfw8A5H72B|O;cxGd@4agj<<`p0bF2RMm3n`w5=1mdYpVq{Z@P$_I3OoK
zCRz!jf1K)1C!9P?gX^uo%xMS`k%kExM{6NO{$xFQCLYM(i1*cW&42Tj+vNSN8O!T2
z71AEvmKW|&ypY`O9KFuDPflSLo^bR}ugtX%(p2)A1JaGyScE<6w-9$e$(zAGSHC!C
z;;#@lDTYTsDOM_~;q_XU;3m{0%GU2oL{}E4dz@=|STO&yZejf@OwICL39pWT+5JYF
zZ#%}#ZR=#AyVM{3@$+Yha&QW{%Rf+5aax1CoWjvQRyzJVbW$av1jJa)h(FB@Dr*d6
z=Prb4Avx8Co;S!n@e<jaV7n~6D6in?$PqzBwGdllr}V=!=3?Wj(0STYh_Y&o*LLj<
zXnWNroMaA0KVNAjL4o0+{`v|dAt!VU3KWA_%JMxZo#4AA3i4TI-Y>K@VyQw9=;_pr
zhq2rI#y(h+)M5cF0{t_p-~zqK`&e0VdiqxRr*55QPpP9IrFUwQU!29<ta`rLD!=+Z
zZ6Gbxt0a)G*RrNGT0Pfpxa!b)^LV>YHR^e(;+%H6M#~LG72*av*1zirlr1%pA9BKJ
zCPU~CG>ijT3J@^G3%B?`^h}p4%U4U^v7lA3+3B6xZF~N2i8nPFaYX*KK5z-bZIyyL
zZVOr^21+>}{_9&4lKu@VL6qo@(UO6wE1kNXBlS}(hREE?zZ*J1GxRr<o(@APGL(q%
z=Tyg32IcU9q1X++c{1I`TunGfIf@vyFz+;|=9hfyxBmQhTvkBVzd$6!cjJM4<B_Yv
zi!yFepg<)#0)ceZEnWJ0uk+^E+`*Ua@zEM=Z>#&Ltan7w2Ca&S`2_CgSQ)E`g6+^D
zBkAcU&)Enh9b+y5%f;qE7qu?&n5wm^-A$ZhH0o|mvtDVf!p50n=*9%n`qebgbw3LV
z84-nDJ4f*FQM%2Kzs~63^X=&|LklSmfQCVR0^_a3@{_T0^axX~W*a0{OAc79&k|)^
z8sc%aBpvC{AwuK?#zbIu!_ckr?-U*=%zA$eq@7PZ9nm|ZqlvGTGlS1PT;B665XWaC
zB{{%PCnOjmhY0~XV^B!!JK7KfB=;IIR~Tas2;V#og~E_Oew7wM*yT-m)iE(hAlEtA
zcki0$u}Ly%N<#+>zhy?l|GZhCfZt)xs#Siz^EaM`rRFrY*XIl$t_CX~($fmLcg>^N
znVlsI3?L|_R?{cvD3HRmkbZlt;Q=q6>&WT;70mgQaM?t$(IFpfW0E~R6oif!NMZ<5
z4;7?=7|?g;X?6l%aOhMYEil9L+j$JF@@-Y^OkN8CDGTSgANc;6YzkNm*7&!g7pIh;
zg3O(0u?$uMKo|-+Pappk2-AG=kTZd1Fw|259D1E+WS{clZPLZCM?Sy@igpamHD(-}
zCN@{~v0fDRi+Iv-R0YI1B*aamt&JLP&TaUkkLoSb??KI6M}AinhwY!6>vQdU#2O|b
znyR(v4Q67;bo$fe_9uUyoB0jKtI%&5N3LzQdrx`vU4_NJTnH=DE#J@I5H*sH`C4PS
zE%vFAu16(j&g7+cMr8K{)@GHHnvPdCZ0T<E99XJxnL_@|WizMwX6Yv>^<cy)`l6$I
zuIo3a=pfGLFfeEvY_quKm7p?Z>ti?IgO<B-WSkN7FT2cVSI<J=mzp(<R3Zr0ibh0x
z5<}vlqa7xSHvGz>dd@UDwLvrgGlBEdzmNAm2feix3{BDT#)MrtehPC1nvKws-gu=B
zihYU41EU4$W%HrASDKNO0nbW+KrOV~%GbdlV_4M06<b8!!1XXBRSH}e8<6D^79wn?
zZozgfhT@Kn|L)#WRPb`qS#hSz<QjCU*|*sq1SC(eRZ7LmFaawnkAg10i3ME;5ZVBO
zGp!qfQ(T=K!4&WTzO~8&BeAKPK^2b;m3**F#d#NKmV{W|;k3lsWI2$jRUh^J{VX*4
ze#E#7O+OepO*y0Fnbm&B_eVd_)^M^G>3CaITu;9nUQIRcLq}L{9m?$P>@Kbd&Z5yP
zVl%y`9*}5}LG7%vx_$fcIDe=qS5l}3_&T#APd2vT+b<^zeN6Vlv1FQ_$(4vvpO-(X
z!t)Ghes)Mns2wp#!Tzn4sqn4&aU79a20|<Z#$JamWU8yBs^f?6h7I~q@2MqeJf(7N
zYc*C1fuF+)_8fE4nM%6a;?rA5W{|vus%x~5ds2YMjBKQ7bjTEjF+|%h0nNr7ZZ_Y!
zDSWNJM)V&({%T)oYM2g;>FunMxq}eX*o}C*K=`TktlD1C`ktZ7mV3_u^?o&klGPk%
zJY+BPe3OrWZ{a+ptgunt#DPW1q@J>foCo>S$pi)#Y_gSDC+m1Ui*JR^vGbN@su7fS
zTh@DL>i%2Gw7tVXlH;Bd-lnCVm%zJ$e^%>a(z3A*a#shgqfG&fFK>2X%h2N0N%{&1
z0H<{E)z!EiC0_qonlH&)NkltIp4bVaEcU_+h8nwZY|4k+W=fS+uJ3uQ7xH2H<K|gV
zlWV`(R6ZT}JOP2!lLWi$Lnzn-71$+VP8AE!4y@^tYQCb<=P)D|(4SjlCSZ18qi*l&
zQ6fqU@0!<)p~P`%;c<8+EfKJ8&z`W8^{P3g?zlX&S=RT~nk!R&HA#o15^8^`{->QC
zzFFop2f<MEMNeLqyCQBOg|sJL-qZbZiuo16#i%QK-yanJQMq+F+F6!l3H^A3ju4G8
z3gnC14&S7Xz+tawy5T?m78%MX#X_CBFHLF-7=+$Z6lQQ5w8I?4NZQc6<DMmF7G$%2
z!Yvi-({RAXEaC@Yi7XJIfdH{n7fosg*qgnx-#y?Bbwop4lox&kCR}N@Oiuj<3Lu0-
zMXHQRzhm-qBNOrr#Z6KaUL<4Jd@k~oY-Vd{Q}F&WaP8~a;q!7*p7j*DZ)^GRN6`OH
zHB?i7J&stl86&`N_ky>%JBT8B4R-y}(I=jiWBY5!>CvcRzK;*H0qp(&)|KN{F<g;9
zHwL35^|S@c&dLZRO$##OM~ou*C<~~a>??Oug74&EgyTACEE4Pgy!fx^bJbPZ&mm|(
zwT$yF7nV7&riJ%WbmSsA4!Q)^kjuOSl%n4R3?pS^cr&;$zQ*p4{N4R(q&`541Ya2I
zL^S3ZM+zFnM&DwU*TynO<<Z1Z@;ytb{l!-gzxE?JJarcn#c^_Nc~?C$OGH_<yCxuV
zow66?<zPYbndO5oI(A*)>z%LdY~+4dIpW#%w`8>~M*L!BB7S3XBH*o-Yg-M}r{R7t
zPxjcQw8W`|#q^dJUg^cQk>MxT1!x+5I2*ZKzEYiM{I)k&=Uc=6Q36HvG+{lY^uf)a
zO>+O@Xid$}!5^(@3wLMVr6$jorL@de8#b^BcvE3+Q@n)D1yE1Yg_nz&-i{tJP&eo8
zcBH-eA)1for;R#35>lx!6@xLFFS{-|LKI4bM%6u$ElW}}6D`=xo{(#0gg%$=$+ff)
z(26vh2SstHN-dw6{9?y>si?j7r6dY)citsUJX@O)b!g$M^1<+xq0*aRW2T2yG*iz`
z+UvD4-*Bn30gji!pAaI6B(FH)CWC}-R>wuYa`uSjzB?=7CSRjIB;vi8*Ya7|lzY<q
z_)yaCz*rL)D>Efk8uhx-jgyi6Ftvc0)5U+`iDV&F!&$~@anLb}Bz%18Ike6@slggX
zk-efb)EE7dkEpxatZ9ND0SdecBlD!^msx@Dqj{i85LODDTcewnJ7W@DMa!-jTB$q$
zhgtQztpRv}kar-1i6PdBA&WZ<$SN~$r>WT@ViyI|TXL2oz1wrYntaseve4Tm7CzBm
zfq^kkC6)^%p>}qYlMQvkH$5BJ^0%Wt4ypD0<Y<!me(=}JXVM5kf9T)z!1tGwV6vsN
zi>-0m#f`LF?$`Pz1F4Ln?36f~M|W#$eR=ukd-mE{npVkJLZ+5i^*Qf&s@%QgxHpJa
zuN=4S%^rvY4IwN_;rV=+!p5rwCTg1tb&P0vQGF$z=5cWsVK8*uzEv(PosTGg7-!+{
z|AGm(sgzSNjnD0bF)8BWOXOH#+MG`}xaqEOzO`XGYf&tGjHd9ovmVn+XXlg_%92t}
ztk*4<G#_$f86I!C<H-5>P)VDp8aBDlOM2P!WD`NpY->2V|5Yja@k!ZQ$=`eDe(_<w
zOX)Urc{F{Di=&9O<AsJ=6{jg0BXUH*_!F%TDL!82j?L8vJ3eIhCKs#x!1MDoY5cv|
zW<^Nz08OrM`&UWC*RE5dR%A8;v4DSe2gwIAV@4@@s{V~*XE+}QHr2*9Y};dlbeveS
zong@eMJ5G&;aG94)Hz^i9>`Y^-pua)Y5#`hwmC-FOQ9H?b_3~mRs-<rYLI%ft}O{h
z(K#ZvK$I4im<h#Z?zO1rz^Bfk^AA<*4=Nt0WNO}mnDOHNx+FfV8{Iahpt?McofvER
zE$_{S>4jXOB%v;j&10@srGg8}9ep5%7>&#Vj7GK9nrxs=`Hh|Ni}j5E<mix49B9`-
zm|``51zqg)H5|8%%Si=!P?J!5Ls=Gv!j#7vf!dI2mCAJxWBMaZ^~)dk9KKHp3|;6o
z(FON#=14I<dFL*>dV>_|$alp!bH=rP$JjO%0=DE3{z;Rwu^7(#Ro#*aJLXxx^j}Qw
zVqbT<L&10L0$)KQXeF%V2KC78PzCWAxdUN0;9bA-B(=!*Nj}RDmn@$Io=4=oqbkut
z?|HLs!1j``E1`emEpAZ9d{H46<1fQ>9o|MszkfpW@)caDNZiJBUU5@!sjdYpZjcj=
zGOCfjGbZV`a&Nu=<VW@?R{*)n_5igz_@4HnEy_;YB9)OdTH!+2vPc;XT=9C*&xap8
zbk*+nU&N6vhdw<nl#FG?s?d#~?f0pN?+gywEWMFV8h=0y>{;m_+%%%OER7$=PR5CB
zPRwWFtRHjA8di3ShGa5X2)spbNNrtuwSE?1WIBAqdXuv!+nhu!;y~A_xvy)Oy$*gB
zOMLN*1NF<t&RxUf({K5_3@XC|CZ_#Irz%?hG5a<i<}o6!-H#$uhirR8{XNyYkBv#e
z+i&>q4%(#Vrhv7Q-c+8y5;<98ch6~T;XOi4-S235_vqUDy~lPE?@<71Wr(nuI|3b)
zT&uQb@vv5M{=mfaUbI};YRlVBur>Ejmrszz-s4B_w-iUyb$ljWE`&T&#r<Ja3h-IK
z2}@;vlREc>x9T%mc*?}3r!F>%s;#FiVx`IFSJUOQIIX&-Fomo=SIMB>!7lujrIRy9
zB1)a3q=<#&%~g}N@;rr=FhuBuee^V%L820}+v~5<E2$0+P8Te9h{NPcnE15><ZGYB
z(ha`U7^6e&6EG~Gq-EY@I}CVK+8~E&KIDIHU_^F<+w14ro(>aWK%futI_g#|5xV|r
zz&$Jbv0yqx>*YuGM@LomtjOqxSzJ@Ux<W*#ei>9AR{ot`W+=2$4?Z`Dd}JQCVG5~c
z1YXNi=H0A}S@CI=^sw!IKPAvp#>f48YV?0jz%L0l<b7*KS&%WWBVSW>sR$m7(k7aR
zt=k1%L$QhiD3*<3z<28-S60nE-p<S3DWU6CL*HZ#R#O{Y1y`N3U%C<pSGs?EKvX*2
zIQ^_$SL?mWkf3D(qZyl0Y$ey{7hc70#@d<qVBheT#@7D-EWnBh1YrD%Fui+@i6uNg
z)Lh<TO^_((jvP}5`|?HeOLu$r2c5j8LC~rn&#D40lDHoucKctd>s3)3G|a3*vx;=#
z8o#@1xwAFUU*r(l?-UTc-2Mj%ZC6iztDN@!IxBq+ESy|Syl5M5N$JvneY5aJ+SxNm
z!Q4yz(&$QCV{>)*@~M@cOYeG4GL{KSuKl6mz-L&C=h5i595`Gn4Z_z%Ltok8&~Y*6
zGiv3@i6jbhDy(Ql@<kSMXDjkxZwm<#3gI<~3Q^DA!s}-#Yhom#uEp=WL^dK<0-XE0
zB;7INhvn#z^M_1l<j}p{KJca)P_i2=b-4Yl*ZZjS6=mcRn=r2#!v+TQ!N$EP<O-Cj
z>lT3rj?@qiVukXm7nLOaWm}eT*yOtgQD^Oj*>&7q{M65NGAGr*c-B@T_g=TI(Y(KL
zqcvn4Q}B0es55nhMoZ&<y~R0F?#Ws&U<Sqi(ZnttL_+`46*hYQ@Z-Z-YKHk*xC;hD
z1JAY8E;M1o)S0tjt<!=j6I;68>ek+|QimeNPr_e{MT$}dB;wh);p8@z4f4g-|LS7A
zUAyMdU47tW7=&a=S`K+($$lG7;Vmgl7t%gPk9=;WF=_YkDTo-vMi2!DG&FPV2OIuf
zGYkkBtZ4f6WnRS&aAF5==nkrJXCY1I@>K9AJWd2^pNt=iCEB3H5pEWe?Wd|L<djKu
zQ7t`gV0d=y0=!s}B)Dw{HovES>7o!$CPMO$#H89)arFJypc*xvoo9Ri1K_E+IeM{s
zK`-Rt&Zu7!N66Z4li)%47Qw1d0M6ms0h6x+ZXY{Jfkjyv<5p!a^$GKm>l@5lK?}bY
zf)5^@rv8hN!d|EM4bu+NJP9twp5aDe<FUZjCfIEg>vLWjd6;-fo|Xxq-n_T3@po|c
z!O?5)0hdftVkvleh}Mk0TT;qYm{hM)!+BZ^$C%TTF0^cQ(hKu>O2U58;z7i8rtU!J
zP-(OgE8WGnX@(SMjgJQ|<u@X8;KhZrpTSih1<fHh3&PZt95R(=%dbJvffw_DSFXUy
z(CpmrnSgK<;9Zc^)!iboPCLJYg8xlUNxe}?2U>fbcj@q8tMG@Dd@?W;mll`InVu&c
z7YOCAA=23`ocG9l`1ksMEM4_`&EfFZ;W)i9R_0{`!B^}yz7X_Rjc1RssX@VfZP@Pb
zVW%`K?X`4><IuwZBGzKd;9);c*9QIMDz$7Lb`&wu(!{yL3*mM=d5we=q=Hgcz1M}c
zuO38D_3ZVTA{|2u5~)mO087^B+0dGZy&kiFr5sw`>NjwY>(p;$0XHF+YhXfy7r`v#
zMW)Fp4K7}nN6FPwCgLHAANm#LTA~rPk1t2a<sCkUwOW7{_fN{%3lg&RuQNv`O*k8V
z)1!b4OT?Oocmv%Jl7D3xIfW<bbTWIYkNK_Zy|z7y`7cx8v6(t)-CavP=e}r_p`L+x
zV?i3BpSX51=&9~>k$7Wy@TYghAE~H=^R7E`0!M!G7H{;zQ|>dL=M!H^!n*Er>47fw
z!gSYRq4aRyA;Je!l7_YpxS`3N&;?Exf06c?CCE>Gs&)B4NT;xYPEq#CIPwV(eXH(Z
zl8kFsX987&lLCf3w6QtftONc{4pD+G!kTYa8d1PTLCY(8U=Q&bh2BQA<|CS49Bccs
za#I7s3=k_?JS>Erc^$wvfvO(LW{3|PW33X={5^|1J)Vfyhm%TYB>K)j=Xe&)!prHZ
z=E56Fba`~j4<EWTX;1yliWps;`d%PNgz~m(r(Sl9%kWeXou6@-WdLqisp2hyyCgJU
z)rieC+?+Xjje;rT;8Qi5?jQ(jaw@y}kx4W_gm^(5{^dcsF(Q`Gj2DEXTh5g}UtIk&
zeCqPwsx^muad8xSW8LTU$*EkutpI3Z&mtnwBV!(h&VBqcCZ<5fCduW*dHz9NU^p&A
zsKPz*1gcFjGM-g8D{UJiJc=(T4@Na&R-dY;Z+UFdIlt+9#QFZBdWra!ZBpnk97v_p
zFp9jFF|hp8{;W*KGt1Ls79E8i!CPy@MAHBu6eGI{=Ft`GdPJqr7929j#x2S;I;hII
z1|+{YE)Gi~Sa6j-X&eTMaCnm@&zr7T)5dLS%#-^`-<4@dTg=l7q3xAPPvxKJ(wdIC
zk{$@0Lk%gC6sT@VBA~BGzuZEsYmQTUvreOI|Js(GCD9&C@0+~q{BGSo53-~r2x#mh
z<*&cUi6yQ<(>}6V<v4X$rKm{aNbAJTrDv}l-{B$`f+b|F>^&0S50Xj|&yHSE|8Wov
zqe1b>Zm=<XKhlfUAk<=3RT(0=27l4@)Bx!*Nlb9Z9hyN=FW~2Gb(`AX_0RsT%d`H8
zH8JEHM)&}nob9PTaiZ_h9&sh^nKV{(*ktUL5nQ<S^%~RKW_H2#A7Ep5Co*w!qr>-t
zucHb5!Wv><Vt;*knH^jF{BmdR%6)Ii?n=s!-25rA9RsQcatKHRV?h{L!}r=3D<r{g
zto75V)ahJ5nGc+yiUeP##u)3F#I2R^Ai$7IJr(Dn^E1<48$?XKf6FMF`xIvWRr{^D
zEQh@*NXA3^XU11u+c5)8gEgMdN3RkJzUzWSR=EQ&<nUFqy8xJ_60qQS8>EP0Jrwl4
z{GI6iUl)x|yX&NhfFz0|t@wLz^O>fb{FQ(16)%LH69Wk=@dv_4H|uhL|Gik3KSe9~
z$(Y#k+3jNi^-W#hw-8JP`-@$YIZ&0+xD+G-seCQs1<DsL+aa)P-X8Rz2*&9x$seYL
zl1w4D*xB*K?2&<kr@SR7y}Za=b-h#zap%ZZ8m9GVgd{KL;(W)~Nwr`8GH38TvvGA%
zw!H+`l8u7jD}aP25iW!D=?F|jQz1WVzO*ZM#2z*IYv4ygihFSzpWyG2Sk2H>kh_68
z>W}RxWHUe#9B*awz0j+W_+12)o4isUfOR`J|NF(={Za;qGldF9;xNp~{h4c3GjsKa
zX@Rvfj?B?fa#8ZC)EgVN5n_bJ-F;eP<=)GD1rk2D4ie;O*N7e?A%)bo=~SZmmr_x;
zing)G{fP%iU_qE@AO81A_Jf>*qa3H38m#Bo;#jjSvW_RyLDAknbWH15GCLrf0<P4>
zO2(<GIe))hyqbsKs*vrA*!{k~eCEp!E1D9ESs(Gf0VUgXV<QLlJFX#x58Ks0)+JOt
zp9t}Oe^qJh70=O4S6sM~ZZPf`ns+l$8@Xz^IG8(RkXv31{@&Gr8!w{jo)2NCUVrB)
z#vvTI5v&LS0vgH+;l3yVsI%`ItjpykBxI5KPNUZX&&h9|WAYdQnGj|%?=q6>kD+`<
z0Eq@3wM>;ud(upzSag(l<?&OR(w&Px;Ni*;ZLF8Ee(Z?Y8l{;WxA7%{)>?~jsJ$4V
z=eXw`ygdCVCcy#fYfiXIFMOQuD`S}#Rwq4hs5Lx#=>z4G`4`q2z8f{N|5_GT<CSci
zylR@>J=c^2x-<7eG@O_1&>?nK8g>Eh`P7m=VB!Knnxg(Y6)@!KRc%_}NY4>8J>xdU
z*$HP~tM7j)b@w%RKpPPBs*$HE%myv9h3=0Gt&*ns<<4uMP2~Er-W%hugoU&KBZ>fB
zJc^^V(Q~0h?SR}bBOi8D3M^?q_QTzi^fXk{H<&-;QuvR%_=Mkq64`r<lZC-@zR@e|
z#HSw%C$M?98C_CLCK>bd2-N~o3*i$a>H`W#k2J?(=Ve9UItTizRPG(wc!oqUu)jn4
zsw$l>J@n9_?RmLaTRcGo=2-jde@i~fu&wiYP$rw9DXxWZH)%1WMTfd0-+pczpcoVU
z;0u&7SbzKe`X~E6F1+d$hIrlBEe57G#?ACrJ9{GZo;pDu^$GS80ze>g@SHl;XGs_X
zhK|jwLqF2*lFR75&M9*w>2utY(-XS*kc=0q_x3*9HZ28D{&V9_+fFkSMF}+J5vgvV
zehBpa`pco!8yT95ICj8U#E%n|UmZPQ?{S`nUZya(NzD7=-YI)xzXRxA;CD9Gq(LE9
z!{dn0rCjPb`@nEgUA&ec+xURG?1L}qwdn#NW;3EqTfkS_?SD(%2sfE!*RTuG01+o>
zQpAWCC<wm;zB0<y{aAlQ5`?Y)A*!<WHFD5v9=u+T_J)x@XzVdccb#PI7N=(jIf>Kl
zD`^R-00Tkl^4oEjLj#Vaq?`9cbk+wVDIi?Acu;_2pJax6Ne-%+z6RrdhiCE3VcptG
zO1~*8UyC8JqPx*!RvMb+OKFBGtot*JAS>s*xzM}vn6?K%igMXC5SBVR`$~(l38>Fz
zfJP~IHZ+jN>sdk=_bZC-?o$GZxY)Pny?F7$y#Sm=@TH-W_o*hYZYbF#Eb`Sx6iZD9
ztX~bD3!XbWX=0ooT^sw4I#zN=SHQ>CVwyvLzd>e#Kfr}T7LZN>U#ArAQ#IhiOORe8
z2?{5pe}KdA^Dp|JGqpZ@cl_ec=H7zSoShA6nBqE<a6Nudwyn0&_)8$nbsPP6R@2gV
zyfgB42L3sF+#-GJ7uz5IR!rb1ol#aEtAR^`WOz<BtD}?Z6}Ugu`YA-e8oclqUj$%N
z!Ap*M+U*06<*O{aOaXfXek~>3H8q9f<c(`1<#x`63K}i-+BfpoDNzFb_Y<f(A{!j`
zD6cR{dldcb;H)oPuM0PiWi^$b(VMw6Wg60qxN~=Rt>k^v%73(~mT&g5d02&>i!jhk
zKDDC}xSMPFW-COv^gSIwc<%S*Qo7QOY--wg8gW<dXLsL<6nJTYU4w}G3;j#Y1h&d;
zj%<DY{4h1a388H~hv9M3`9PTCGrmk`#<3WTikdrTxP2xQ!9uhC*R_T-!2N@W>X!E`
z(Z;&R+5cU$ty;CYX!g_;s`AH)2@<mD_NCA-fYaP;x)`_;B^-H4c9U_)m4QYRwXiaF
z5L4mca9GsrKp+jOmN5<#pbHX}4Os4{DH?sgY$-ahSppwX_y%T$gnClG?w@+FQhM5Q
zI&>C;J8S+dZ*Gn!=zR$>&_QR=OM62@7~ln8RaP8hEoCyfrHnyFo5FpUecnCMrM_<Q
zp4p_6nUw7@{7&^{9sNchsJB#;;$>KfoogQ>w8W_ZfH;>}uz<`j6fAWhNE&9s-(kN#
zDcV2rTQ$r%Q|brp=38@5V@UXYcohE6>A=wC$<*_UK?d7pSzUoo(|<O~S=KDBJ6=G&
zs3rO2ggu2y|HK)aBjO6AY=R}8$R{~lYq5o=hZ0!ea2{U&7owz945OM6+uzW>AAkuO
za3zez(+q8q>L;H38D;&*TJxu`>`bzZX|^>!ekW)o09``sT!-R>hCb<IyMPL&4#6Vc
z-Rj*Df0Em~zojp=I!_GNioR822sc#;6FP~F4#wxrzv^Ru#*5)F=eZp3sbo+mMTDqw
zU2qI0IEMFSqzm9ninLKmW-VB)O{~jP`W}<QRB#BL&EkC3&FPc4tiLn$<Q+u)b*r&z
zV@{q7A;Wn);Hv_daJcB^y`d_9cYBhi;YOB7n6<T#Gtt(6Kdr9$ZYjQu)>z35#k+50
z&Go%PElQ>BCe4Wwj%3{QoSg%a^R2FB>&-=_1eseM&d#hVhkEB3_5_X27{sL!rLJD7
z>BTFOMu{*}`VeFDCJsKFkoSo8`<HoYH!Ci!f=0IQy^y(ZqH%@y`?`>}N;D;Xc)%|4
z^AAQVT&t?mQ2)tLPDz0=0Sw8E3h`a<zhsR>=^L#S7Kw|Whm4Aq*Cp#DQlD>Y-mU1b
zKfHDWc{V%;0FR_>!ZjD^#pqJvh$N-Zf%^}hSEzB^&Kb=r&Mh?!@v7bN-p^k>$2Bx-
zg?u(oaM_g`8bFB3zLlB2bhPek41wn?g=8l7D<R5%gH{(#rz<_3!d)r8w6oY*ND~60
zat-O@7aSbqNvkBY`G}^YGt+eqUoc*7y~2<0J;`PQjSCc1E~UH!wE36~Kwch`%+7q5
z<F$o8Exd@qT=)HDh?}!GhfO|lw98Q_$9@%jo(!AdVnO#d;rOGSS#eJi@k%F}zQ1|O
zKdH&8x6W$aZt=E~9(Yl)j`p?OdXA1}t!ZEAy+3{2(tngVLx$9^+$>p54d2vKTV^fZ
z!%}XC|COUrVK+Zdc$jiIl}m>3`CY<fTFW`c!BOKJkF3giv~Y*`Yxg`JcGJo9k|0Jp
z>nEsgIgW1$dBjz!&?_T{d05df>jp*_CTt<CsHpz=wtWrwgDOo3oHF2ct{XU%*OdPf
zrH}``4|(7nm>*`Q;bl<o=2B+{!lC27s%x9e{%NU#p~9a&B-p>cUD)u+H>%Z@;<dp{
zgno{T3W;ZD_|V*p^oRvz$h15)^W59Dr^_(W=zc_c;8)t724B)D_hrhl=X@gzupVp1
zB5m)tkai254eiNM6INb6_~p4ZgB-H=X8j%8y759a_=%q5I)aZalw6>5o_#7Mw!-%k
zF+m4WxH`G@c(;f337J<Izk4>YTx+MP!Zhf)Q#kUW-Nmp=^Oo#`hV<6-cWOiK*RG$q
z`DMQpH0l7WT$YSvhJ5}LFWSdS*ZN4Qnf+sOh<-fCO`-Ac)Q6cvrC_GBIz@m(&{k+v
zv_&+D5B{AGa{wv#K!#a4Tj*yxd5Dw76{wa!bKE|<)sP4Zf%g8mnvfmvwf=iTv+HSY
zr8cxgF5BQ|n3lv!u>O-kmsbJY*U-5q-9rbKqVY%+xtC(?;^>hc?{Eol;<wX}usCPG
zK5dEw7do`ba6WE=l8sGunC=l(nnetW4}$nu1gAZ0#XnK?;lj#Gi?1Y}Dp?0i&ZRH!
zWTp$X%P~gYVJ=!hAa#ZWmLhrBB_fA{@09dGfgBeW2&Kd-2kZA*|G}sPQE5bLXvO(X
ztCX$AyMeu1D|T^xLTr}{Hp0=8yE{D<+d-$>#}Tt+z`qs$btQ9rD+@_C<UNaysx8w8
zn?20xc&v`lgO(4n^l%&AZi=`NRVJ^##)qBcl)mb==Nv3rUSo8Mm((oDPojhG#}Qv@
zJG=^y_gCy|ZT9bqJ~jsSiB0Dv@oq4Efx+>UFSa30FKOrn$<HdZwWQjS1Ibml_TmI<
zIA8!Z`V^6@((!bwS6ObdFUvr!058<D>nIx3S(DQ)Fpxgno;oz})z09=OrK7WjXd5{
z;)0gxUHB3oiE@xNctWju-<SfD@{u;B)6FI49*stWNOuopAa~#m?c`g$Oz*lpy}loI
z;inb`N}tE*w>urEc2wTPc_#Af<tl+beoKP(j`8tY(N$cyIMBe!lVR^{SK!lxK^pjw
zRr<LGRpeKHTiG{;$3fQ<0(6Rh(a2)6C`YcoC3e`g5ecU|;)yrI35BO`qq_^BxwVXA
z{oBtT{TZ7Jm96w{qm)3rl20`EelpHpTIoiq`529k&|AFqGcAma8LziTPy3w4%q8i@
zIYUF@%}{09Sb6SVrO$3$B=7EOgkO4r><9bL-$Afz-a1WYVSx@eXS81lLi(Jqhyevm
z=auwCWG3`bFm(yVjnT>e!^lMuxVMiV%SS&7UXh}k?*+?xr2F;^MM#pd1H7I3_Tp3l
zF#K8_AQ*{JuW8@g+Kf{BQ`;nbCJ1f1M|66VY-~()jNxyhHU<oC=8CpCNa0_iFZWlt
z!<EK<MrNS2ZvM<V&zvnM_L1~h^>y4n=bFB)Zz6S$W`<YBLqoZ5IBFJApRb%8?s_ga
zqXPD?mIPPMfqax!-7#M%d7M;ZZ<RjNpC08?!WP?9CL_WDuzHR7TxUcR-@hGr9Zfat
zjZ<}YqW}n%X|?vd`;6u?*u;}HV^Tt7q1lav<fenLwNK6IUyPo9R`J*6LcZb+B?v(x
z%R`Y6tx2VkgQUVK!+UF47pdd)J3{2<wLhri?Z^*w2+~JxWW_<gJov1@GBQ)72a+#v
zkBsfG7=6BX%N0+2)g`uGDh$1xjImMSI12+svBbE9_0T-d({oT?0I?vdkq57ki@cCF
zfTTR+R^Oa>w>=?XxVK}fLNE=>z5;!=@}6y0m4c+CUf2PY>*9S6m|1^1J*OEg(oGTl
zQ`AUuoYcI%-@k*2!9jjHOkAb_`3Kiy*Dg4fR}VUP+{vIXfUy^gVnGbg?(289^-9$r
zgf;D^MUo9fNR38HwL<lNY8=oWjc$oXhpWqjBlxKFyqvq;de<#8^Fa|W0#`m+J>jH8
z2w+4w`sF3k7Q8Zx5}mk_CXX~;p@?1>Vi=8hs@kY=h{|e4i>Ojs{@0RCD%Tk6bisNd
zl-!S-`6mVj1DV7-!lt4`ugjplkH`W?_BQj;<D0$cZ~{6enViL+g$NO_B<&Qlc!&Wd
zUMmUneTjds;8PBKv=8@m=(5bly*Yn+fwH`ZkNtmLqer(pS`^ubDpHDN@Tf56cih;j
z3}NR(m?>jl(w(0m2CM_nuerlh%R|q3<g4OxeF&2mtP)QLB(kdoUD$ZODuUKUT{-ku
zY)W$%%&DXA+`E0diWh?j!$nV0(N3RcH0`lOpGimA&!Sdq8A*a*-6*NcHn9fOpTA|H
zwV@yV(*~gM;TO+|Nj$G5!N?NF$9}gdKUur!XPnkEzq3WS1se?mv3>&wG%k__4Q87X
zZ8XVwG+**9aW7khjD=UtjjjxiJ~p%eIJ$6!?VGA8Ci_B=)n8oc`we+5mgh{tc|PEM
zz7Qw_r5zBVhw2JzQarQZIj^IQ<E1U9Y+^b)CtL<onJ4r8XLIWHYh3C~@E$>sW2TVl
zOf)p<(q2W=N9W1xs-|VDTTbft6j*;}sjy*(p7w$%UoK=n&ZSl#`qDCi>t-{>7f0&6
zLLlxslXFG+!-MI8H%LdItjL2mc_X&G&<%G9=EO?4ZWeaWdq4r+;=If#pa(Yclt6d|
z?aa>2kh>XV#Zi(wUmT;|`p^zIgb{9BjwN^Yz}Sy<OmNW(d}OQZz7YGIrWrK%FR!&c
z=2InhDc}}gi!^&ayY{6UsA@D9ynFhIA`OM7I70D<1*1Z#J5?W+NC%O<EclHhJtM+`
zr?T&AF(rM8GjZ-x*}2vNU150PSM~fqsSR&esWm|Av1wEEZEJbNGmTxWX4#VHpVo>;
z#BrfM1L%}b510X0b8`-dzi6VVDGuxMQcmmYaUP;z2%m~{i318GUq0M<&F;e9&9}N;
z%orMbX-K>&$+VqvDEj%_@uVTg#9SnoK!F;PKyYy9!qQ=4<k6pMAC|>^mk&u-Iv?2n
zcYLO9Xvs(M_DoQASo(H>IyjG$c$^^|lmk*1K#bH()gFAmd57yP>(!0-^g&Lxp5tqO
z3ttI@eq|DM-~uXdC%bCve>~ZEnS9%b(%XP=E~IW-+qeHW7qhf3tOIQI3fFt$OavPE
zapEkwS^28g5_FD<VA&*04{ccN3pxRPA7B`2xpE-JLhfxm{mbKwxciXjFk1Rk8mJjy
zeWs*khZ5+y6CEy2i5C!`n;*0lIio>%K9}og$b2hlKY~f=4`yj<dZg?91+JVAT14Yp
z%wNu%;Hed!|Gma_kz54i!>)MKXag39Mk^bol8%l^q#sJ1k1#4vE<}S^mj=(rZD*ew
z`Ma8u<?<eN#kI>(GeRJrz5Am|OfFZJ(F?Cs)^EDjbHl2F(6$pcRBw{JsJXNb8X1Z~
zydqeqS>NY5o)<a^@FLetwL0c1q{Q#PWn~GE&WC<)Bt5p&tb(j9(q?aJh`~%(94ImB
z8Y@-<uA%sQ9zm^!bl3(N;|lD%YtWP>X$Z^E#VHqRf^5vXME2NH=x2BOfn!pUG1>?j
zG6pKoU52v{J5aP=#z_aMr!GF{3@22D`={s!-L`)z@EOaKhxdVoVlLmf@n^k*OpY0@
zK{;v2&tT%1gAsP!hg!{;!F*7U3+th~r&pYt^OrZ~m&lTlB#rzUk0svSp+z#mWk{AV
zFVDxSPre6sre!0fMQ%`2AW}vv-(GT->`u4YU;=&Pv6j0%WGQ<KVt<)~JXd7El;rrX
zwys|j9=X|~pzf@Y#djaK)c-3zP@BSxhi~s?#lsX70A-~MFII|CBqPT=`@p$}^?^@h
zWQ$vPaWcq+Du&895E6)G@9XqQ(Yd>S^U~q{!P<N3h>eU7#+J0>f)68BVu`xcclxeM
zfrq}j(@C>w46!@oj>Wqczr2jrHc_#K{!+xYv)i*Qzh<X6_l-YgMv-gfiCNea3|o}Z
zh5=(*DL$UvMhu?p-%I^Bf>rFc88?vU_zI)dS*d#3({{Rjc+z^NyIe*Pi_lxD`A{_4
zVHN5mph(reMQ>$&4+&H%k`^1c)Sqw|R*qSBg*|t@F2e{C^!h5j_g&X_M!(e@qJ1ez
z@=sB%v>P>a`2567`_?V>ps|%c*z+LScOPutJOy8&zEkaWu0rS)kdaPuh*ZuO^Pa|=
zXHtf-!Qs+dKj~!Nl?{DM`EzhpBPR`fX5P6oze*<8srqFlwNb*?vyH?+4d*I+pt@~g
zh7`kd!0<jpGYaw?)>BOUfDx~{k1L^hHO+*t0*yem9z8IU0z1y!&`>083`1Wy+6@gt
zdWut&E0VuFgWrO~N7`zueX4Jjw(bb9whG1c$*ZgNw)Ftg4sB&`lAC|UFgF$^QfG8H
z$eO9}as7xk{@`?3ShDx{8uxLx9*E3JU#rc(w4O3|1cVFKWGk?);>7B6mFextSD<eR
zfE>kDwxy1TYqav^MSRV^5AOE$l1DM(kFG97<nn9^ZQfrFc4;Sm8}3N#0*b!Mi5tDI
z<@^6x0C)-)MHNc{xp8`LDt9S89awN|Zd7=)2CxcIvbo3Q^4h#lDR}j1!XL8MWx9*$
zkLx%mP99?;2d0mh&}t^Hxp$awbLddZEFp!c%7DhF0yw59H@$+*zd{<@0~F)byh!?u
z=j~O71IsI~B$R~YpSe4QkBtmYRC^oJ6OZF_o+3=V^@=}7g`O`U;Fy%sCR2!pCvvXQ
zWdX$7v=XKdgPx$`2WBt0j#zA=D9S7?^i>BN7|UL2Oz4V`#^A{Lx~apyS3IXxO`&A8
z%bXv(;U_X(8&X63#9zP+@)5^e{pAXLPr#auZQP(6yn67)rm5`b+I4Q>(+xqd%ZI~U
z>eXVE&JR`<?5aR8N{RboIXppS+4Z{jA6dP`ItBZ5zW+0Gho0LFT-9x~+I*Q+IELHa
zJ#?s>^{yp8UB~)9p1yp3XX|)KZ314M&`Hd`%~+JaYG(5%@3B#ir_vv>ZgN-<kpdf1
zh>JN)iGW$5Awk08LzHs^!-QwqWm_~u`_Xm^+6TzlH<~uV!NVIfC@z=JzxhSv*tL@m
z#q8hkLT}0tj*5KLlJsZ3u(7&O?7W434<3Q@vMb``Be%Ft#RT-fc1TZa<(n}+HE^Z5
zx7X{;!Be63=KpBA>bR!9_kWj+Q5!js7#$+rIZ`APkOpZGQE3H{7~P13fFO*Jk_Hiw
z1`#kwDUk+|5NVM5&CmDsd+q+W?cQ^r^M2wy=lwiKV5_b*Pbvnk5>3A0btL{QXz@R1
zH_Eu-O|>Zgj*)>IUeAFoYpNE6ha-Whu*_@Q-RmGll~}3ca^_Ys<TWi3;lO&Oi=wNv
zniN8B!cUhZKB&ufOvir-D$o70nrt78jNW`m^PPfGKi_vAHGQLA3ih^8xvOIm6MKU(
zXOr8AAOFKnRQFB%mE!Oln{N2L)eq`=18J=ko(t=5B3b@T7RP+(#tTbT#uxFRUXJ`L
z&<FuUlz+*ltH-^G@*-ThvxmlJ1^>H#!0{EbQZnS;QTctqQ7m@NRisF^wv!KB)*hT3
zAwOC-VdVOE(MiDGS#?d2d>`g&Oq!t`67Jv3_KV=gp04TCH~|%F?>B*Hit7VI0!1dw
z`-Zq}2G$BrJU(elks}oA_DMW9aDTLY*EEF~58RFheUGii3OO;yKaUT^8AFYbd`5un
zK}3;t_V;~Y|CLDDJEb}~6|{JT<eC*)WUc;hhI=f&4dPXw_4{O&`Q$Y8>3Qd)V05oj
z*9;?awMqI@53H24#g%j`r8|I`yk44{pK|2Js@t%lYqaJmog}qYmil`Uf+>aRUW+v{
zgEepUH<zuWRxOc)P1G|9Y8Bxiq1k40mPH@5zBcHWp-0kUFXKRibpc%bJIH`=w@f?5
z#quDcO{$i6FtB*-@y%`53eP}-F2t!mO+{yk6WwE{ZTpT^gs+2rVLKHNQ=FC$9n;0t
ztqxz7Z{f5?gb16eBph1PVt>J;r_&vRw9-)qubDGQ!z!VD`sd_&`FR4}uWzJ!#`!Aw
zo)ftw6RAWgjT%Fl*R3X#MRA#G(1&PtYB3;nSwl*cAk2b3R0N$=+*>Oz{j8g;#7h2c
zru1W&Z)C$*MTKC)+2EwfnDWD1y(I4`n{;rPfWi^t3$6aGGYI+qp3+#*lhK(b6389q
zn?<5VH+uA`roZ*bpZu6nk3k;1q2}Z%z}%GBh@O@0`Fq7pi<w^NzdW469gU9j!JhBF
zWwb4L15D<XkO3<*+y0BZ8{m8?xU^(r?q6?}p&z&}Q&yy1pXqSl)u;Ga-ePA5y7p|V
z7lUJc<Uf)A4K}Jjl;tR?;A~j_xQz0lgv(G-8ii_%O|>H-9iK0aZp$+2F0Q*}vN-us
z(LMH8`+2g^=IG4(>w8G8Tk!MX-+2|0C`5PY3Tivx;_uzdXYIBB3{o=3yoYKjz@Z9#
zfbKx_H(z7Vb7_1+Uw$p7+|{F!#5JF5p9$~(fDLLF?nV{mx<5XZ6O&$b(z>0%Uxdaa
zsOB*iw(&Z11pC+|!NMxp2VtF6ks;>Nm^8ds`EOf~B1yh`7*w4zLAA@8rCOX*iWY=a
z*6>ZWXQdUf8k$c<Gri%N()#*8AF^utbo+zfsSuIpo)5*_)1}w7V^JrYHfi`~CF?hx
zE-d+xgWH#a_aB*S_PTEC8_>&9mrTvu73fHH*`?8^=7v8eH`YXtv}hkCa3J4{r-C6`
zIM3@t-+vA!tGK3kJk1`czfOxG)a|{#;RE2a*CfgNGS-YetA!~C;bR%Rq&{`}jHs(q
z?P^`+NG+R+UIcQ9-o5?t`Cj{<iF6{QXl$U&RgDj#$r?*u49$?yUPTwi;$xvBKl0u%
zSsi}(dG{Vy$>RY*epXj3L5%moRIb|nqAz{r+)=yPCDyoZo`pOFikr+EqbR>b2g+Di
zDOQ^I)CjQ<s}tuNitHk+VZTfkx^8Di4&bOFwjM>lxEQuz+jM~(WMcM#Z?@Cp+#3Tp
z2I(J8CF$UUbZ!LNZeg+RUtn<SV*B9h-om(dG?9{sk_U{u5n9CA(>c$Z>R#!7Y8v*5
z2aseO3J7s2Cn{t!R^`r5L(1bomKLS2@1!(-Fmb*0S@Z77ht9Qdv%Vaup-t+{kiwML
z+{d6@-h5=Wfy~dCWcr_d+{CbBqECC8opj~M#{}|B;P&Q(ADuPBN+qw4Ls-@ey6&i%
z&~z09jRaMXXbL0AML67c#y2L~kHv%2WZ`}aof;j#oL`Yy8tJ&u!a2Y-`nV@d_zM2M
zSkRiQ#}A&!-VL0n>YY_5VX%J;zIoMDK1};<Bu<(};}waJWTy;mZ_eVCz|qbQL)_#m
zQvK?&r?LCs(~svyu&2hVD>{c`wreSkXowtn##@jH-DLkon9PGASpM3DHu8W`^r6H<
z|M19{ge%(VY!<IhG(X>kS28U8(e>XhzEJfh|Kn#LTtm_Wvx6{rfb3U;5l(c)ma2Qz
z8DnGeC7n&(yb>7OIo8qpV2#&YY2(Fh*bjsH>0s{Dbg9&wwo;v_7o8+hchkYiHE0Ax
zAtMxDgqUx%`23lI${rZo3Ere&DGzeA{gWV&R4)J=G-_`wA$Epl9S%vi-zL=lX2`h{
zCh<T5Pd8l2gc8#>d(yluEJh5fcn{M5p50&Am0Eg9Ix|iEvWb9jl=Kq-dtFEApb5@l
z8~n;?K7$=W>ul@zA*!Q;g3LC80ZQ|`S@xA@a<=;|V*)_U52ZV0d{h*)C{YQpUg~qj
z)7#q-%N<D1beQYJNLh|KMGjX;sh-v|<bC6gHBg{%O(lf<exdTK_@$mNw#_0JuNXp0
zT9fPYB-YF9fOss5dQmi+wb1us+{W!6@>tRJ*%*c%3ae&JQk`-ZE%Qqi{TwnH_Lms!
zhbUg*I5s})4GHhJhDTraL+}C4ydTOs--lN7g%FEmhxR~Y#vjZ`Y%k+)?Wt_mGQIk3
ztYWL#)7bqtJ0fH}P`Rx0i<nmLOIs9#wHWE6$)`N28J#8iR&M$#4Vk!b5gexLiL?A(
zvVKDz@mBi9_W`WT%)!J<qMoK4U1>d<@_0n$sb<!}O%=hfV)h71=N&ynwf;@8+40bT
zbd3RT;(3a0z1nST#+q<J5?e$S_qIwk)+s6aAkpnpRmoq&sV4!C=I+K6SL(~N^w!yT
zRJl-XP1zW&I5@*Zyj8+@9#|?5mVjefTq%9_8Ugr7>DBHqFFUztm&YV)Q#FYs*Hlke
zQaJ2X6nfuGRL<=x8T^~jGQ?yh%Jc;X_D!cb72-8h(l}Y+gZzk<$($<jJsLrn`go0S
zLr(6?qsi}TYJ=@u@0oPJ9pB?;YS0ig9JAGbNdM*=P`cZu)O<^7xK^4%#O+F?0E4Dz
z$IZ|kQNf`h-sx|)H6Me&rEoSgi9G5kM2@}gdC8Le>P7IUQ{NNN3~z);BIRU-Onz^q
zY-#UjR%&t*^U5>2pF}SX)o3~QYB^y}uQ&p;gY{?<E5I51c-3DLhDDUV{78i3`t43_
z`i8B%Qr<7xzu&F&BqaT+>s(p>Jb<9McJ}a{9z*OSijH1``fp8Ar_#$ATp^0xd53TZ
zE?&PD3;?rRa<ij=WE9SO`{;uus8d50*gsGOQG?~N4Rc)6f~v;3E(b~Yzp@RrgtW&u
zNFivD7U=@YJz(cA+vS*z|39dyhmT(CQ8NJ(8zjX;iAiS^o)Cv0K^u{TRV2Cc5tOuz
z-}}^mDc+6Jr*ykRQKVR1H#u3IP8ODAX{jOG-y#te_}#_Pw3kW}bdYD$yfB=IsrGIq
zfsFVG)tn_6x|~MZjdGQ(5dw_?O{fX7b4;Xc6^JzKpa<bM>qDmPq^GzeYNK3CDWF!w
zLV_<I0qm`((iiJQ({bDwhtCoY&!T!sJ>;%$k5A?3@Podk|C%hH@vc91-$yvl`Q|tD
zn5kgHd2%W1;MIbTdo+di>v5@AXC)kq;(eVppBKEVEOtMm2`U2kd+-(6^l+OPkbc1P
zKjbW9yKS%Wf0fyak*O_Jk_+S5)CUeFwdwj!A4`yH#`dpZhV~s2Bp-hZ8!)+lKeEyR
zxmj(Wycr}$^*8vyzddAYX+hmz`vA>vXj*l#_qXh9rQ?Ji;r2)#T2nbWDbRTfJ-Ul~
zxWa#d8o4!He=W}<Pm&1o8^e}?{yHvK1PQ<SzC{*{60RP}MTkg-As;y54JaBE^Xoh%
zeAlq#ztQ>iA#$o#$?qSd%5qdIPCoiXB#yhUca}0?HWx%*fb+>hD^VpDpxgXdV!<f8
z6AH;?-TO({`f`Mkov07bY7mV(*qH#3otjlA?DJ6^wssKOqYZW1_&H67d<~aoH_a4@
z{!wFijcxLK*e*z!zqx3#gYg-5^of={3tUk`p8{DjB7Mz4&B<6hlMMXavneCHCiW9s
zNp4!&s}k+NzmSA96*fxXK^Ur7uH&Na)tWr{rYR5$6T1<defg4Wjl~!1U1bcigvPuS
z)f7*l`+z_;B4BnJEelmD{{|@T7Xbf6>IvcO0@qu<jsI%s!4n#8yLN#p*T%Vl2BzJQ
zBJb<v7Md?vGXR(X7m|lJPp!+t+9z)g<vCnW(b^<6$^7uG!T38%eXwu=X6TqL@$O}w
ziq^KoBxeL%4)NFpS8YjB60DsDvfaU!-oqnV1Alrv70L5`_0p9{85pMlV=8@(Ky{D(
zFkEi8sAA<TaagUEzr6>RmtSpSh-$$`125-|OlU<!KX4TxCxenkT-xFG5QZ!&E*st2
zH}7Ws8F9Oiu(T=MRo!gJPY|SDy3D3&ak&AMy{hNte)%J%T<`UHhs7I;#m}>tDGhKp
z@oPwV=KgFo&QhSLl|#Z|tgbA6v6}mQqcr#YI9FBqSMf#t$jz6o0=Mke&txayWep@7
z4sC`o&B?X7QkBrZCzG^(dHAb~PBN`Iv!24T|HOFl&TsouOQYpXNSDPo+a+oXGlC%n
zEx>o%%$!Qg$lr|-&LhcSB<Au{AvM#Rfz&n<qO0S=5I!Z7pU2WC2zJQ5MYAID@l}LK
zdo3cvFhK21s}NQ;_skgWIGI<9SaYxslbMlMx_)BXiDyM<g?U>&y;+-O_kh1zTnPAZ
zx~*6oyuH~=?X2H%lk#0!DhRdUCC_Z5w;eQSll)JH57E_DF5LJbCC?AnDib4NwOx4Y
z%gF$`LLw`S20I<^P9ADuSy-FEnd;<o<WHmao9dIJ^Bimax%jk-%No-7Q*G)eR4|OX
zq~O{ce)wwPt^3T<Vk)VDbJ0zR4s-gF!efCyhje?TtAUd0FVtgNWlu>ykb#nQ!UMCg
znTEc?q>(H3%{GWHp+@EH%*Oq1@c=_Onb6?z#xPNj3(o13_Ta)fD`rq#Z##2(=c`~<
zd0R5$N)7QS;(nR7=9*?+gYWJ2kURdBxoJSwxrWP+k~&MY_HC5B6u$#u#DvSaw2&Vm
z!+I(DWJxWJ<vitzLQ)_wpZ%B35^Ch=q9u~M|GFE1CU^Dhz5|7xX_fc`>w-0v@S<<Y
z`OgjypL^GV!?10)k<bH&m`6+BMYCshw*w|@GX9CqxZD(RrOU#NPYhq}3+2a@2%^;3
zk6+(-gY%BZ{d$wfL~25s^qMV4qD5a;zK$1_vxTgfYIkQG<=q+J%)Db8*r*$ut8qC$
z=@~!C0M~u@OmXwgTj<?rf^~eKH4Hz?IVRn|=Grj^;-ns1%{}zf-V-!SBiYRY8#;$a
zZYt}7El2fBYJu**)y~QjL{mq;kz@5u$LM9F2~=d3{G)KO?`1)|1aUR56v{DwRpE!4
zStrG3U}!odwAom$WCFy@5J+c|>vWfkf}wC_YT&H?<A=`?c35QOrf>r1;?Q2f_(;|{
zXvhr}n0H1%W^gQ-GJs}eH%IA76)ZtSGN>3PI#HwJGon8pszFtv-d^}(@$M~z*5Cz-
zbWasiQ#1sLQoaeM%8Ig6<kJ1%ctn9qaeqsTAnCQVdn(&{2?>t)mjdlW3!|iZAzc;{
zc7g*O^)Vm=uB1&pm4j%ZA6XTnDi8+fDA@4|4_RKp%tXD8_<i{17iH$dPu?y!KI#ii
zYB=11yEJIZ4X4Od!Jm;wy~TcW4Y}w0fsbd*<m8?{j;9@~L2=`R>fRXS?^L_!MJAax
zJy)~BP~m(z$)-TJ$uSGHB2OrS^Fj1#BJFMUx~F3FSJ}ts%rEYfcC7@N+2~RQuT}kv
zU#PayeShj%LVGl!#@yIZmDa2Ezn|o-w+d&?UF{!*ch<}D9mqCrbZan+kUiD-RHq*o
z@L`i`jY7FWcyvGVcc{u}{uDo_lmFnyH=Q%))Hquri#4_j3k*?`ZFtw3^O-yh(-axX
z@od1ZQG1@=)%$(pw1-X<_X`9{7Pt=OraXG}{Bay!_9E^DiN(h^4OgZ`Q^$|;Cc%ff
zCok-PPv_N2T2z69@x%}?$_!c_&+DOKCd&l9W=tCWh*d@!miA&u=_U6o+T@P5&#hTl
zOr6UQwBwB0Yu?+8k#Bfx`$p}wktPl%7Tl|wM?*)*&8O;bgo{)yH|{Mk_AwsV<T)w$
zfSGfrcX~FHKwEBhb)0QB#b}`L5XLX0#fUt(t&GGJI{w0La7#0vd=Z?y=wj5J^Vnu!
zDvr(z>RfZ+q)j4E^<(K`e|>cJ;os(92m{FG!;VmwLA98?T1n@88A*>EW(E!`i35H;
z{+#yv#zV^cGewix9%GmcxjeFIDcemDzW;PUH($7nZG<xFVTWMYo5JUymnHAzg@*QH
zGJmo4qBV1|d^??BJUG7fpzAi;R!HKsDv6++!NlMg1x$;p(S=J=7q+%x70>UF!#7#}
z97In!N=pQF|K&|)%uA&SKHoxdg`#|&PPGvqQ)dq*%8Ak>)-i}MqY|4Ce6Awt+MsJ1
zAWcDW(1$Z|Oza&qhM;?LF3Z|H1yDr}tpA($pGP5LZr-#Rk2(u5gzMCi^|SR*3De<2
zlXY%;eVf!wl#~WgOrLvRgq?!n`_<}~LWICYaWR*}Z@`91r=}5v`H(VJ?AGxdliCL7
zLBSNco8s$FR2GL8VVcIkdY<{sOhqmueylk=0*i6~v~Zt2+tB}`&D(#*XsBxIaKfYU
zJBXkQo8Z9Tw$VR`qbJpnO_O6OYF3Rpdv}{6T8b=rcGkfN6xh6dDE|U6!b9MEMJVN>
zJoA>6+7jy?l5#yl_El03-Rj7G8SK)QahP};X8QrqsXc0AGB{nyV?O&itFLN!5QHj}
z1HTZoNoCRtZ>g^6Qe%?-?BhJQDcu0>a9bJ*Sl_;tL`ru*{O=WQV<QW8Tq6#N^*DB(
zY|EJSb^lM9v`M2shJu>7$G*bjpw;{!6`X)j$+FVDs~lOM>SUvHHNayFfVVDJ6kVHr
z^3%c7=8Zzthy_cRgS%@aZ$2^?HHq(kup4M=rlT2odU?R(pUFq~g`R=|pAs_c1Qt%n
z7*BGQP$(l+wkB+52HTBD%CbJs1{N(*Rk2%1{j$cm_oQ3iDw|X7XWE9>V2CGBR>piT
z>?~DO)xz-6=z;JV-6j#Emdlsl=jIoLt^!8<esqFk#0vTFENZ+8xy#+)GC}1RU@3-)
z!fBvG>ayObi4#unz3Jt_lo3N1K2M0foj>a<|C^!Ck8tZvAkbLkRa4lmc(HN4Ok>!n
zb~6rC?QM6MFC3_DgLLk+1>--%7!?qsQ#S8nbM#hTpr^g5S%OxaO<(@i?{#n&d5(#N
z;L+g7tmIiuKl)GX<-$vU-3^-$Cu)fRb*GN!g%V5J1|z;1gN)SdD)<qasLH$6D|E5v
zhPK+2%m~iWE7SMbY8;x+cu^`444$5D|N3g>!x=u>PsF|h(-AlC21vr+ZxdSDt<4^R
zR%&91QJP~VoR&XzJ*KVbsU#oJf3AE_5OJ8zPAqr-gh)_MXIU<}sbBla_sfF}A=s|4
z49HRlhNVJRCe5l@bwIkps)Ja6@g~_6?GM?E5z*QH811o<rJxY!u@2zr%*fy+9N2E$
z6vK-T_;Kp8^tzIZ0TBF;9~bJI`4rW!0X=gWL3=J=Nr;A2fBoHF+s|ec`#Je})tERS
zWhyK3!IdC?;Z27>_iO_N??TlwsgiO17cUX{Y0<YCfc;0gBs}F<D<oK#23{0ACIz$e
zq9$&N^*xY8Dw<1~#g2ysU-q2rz;prrXI$!irwFp;JAd#VWV<)blpt1+XV{5fe?ML@
z`I7&Up#nZKJUJ2QdcL49YHLjCNsQ6yK-x&5EnEe+#Hj|Px8Ke-WGru-GPILtIs~>T
z+iQhZS>k6E;gLw8Y)Sv?RJ9OA+*pX*S-QC6l`K^;ie7C6|4i>Ew&F1AE;m~5FS@Ap
z?}&%ZlVg0O5#PvYBh}p#I97Yv;~4{{<wR&fV#0b?g6mQ&Q*NA}K)A3t>ZA^!2@d&#
zFzdLU#JS9*g56eO1(Sc@e%n5>e?jDcv=C{X3EhD`Iv>E_uIxYX;0N<vJH48&PXXcP
zAJLWFdUgK6Hf&!{=rOh5bt=?GqkiHc*YyvW$(^$WC3N9ge&=v^5%3~|16TDn#9Amg
z63oQtu94&6Ti3GkMdOgT;K_#>e0O+YTEckD)PpZST3^6d7h^WU8r_)v1@$D5J1@kN
z?=0S*3s5sw?LWgYVpZYKttzb5SVI`*)%w)_)CR2|kpV5I?SDW0AT}1I2Ne(QEPBtQ
zUn69UkR`Ji_8Q)Ee}k8y^-Sc~VB7WKyECihQ<^?v2<k`C5`gM&`S-8bLwolcD_K7`
zh;1Uq*5xx|ftSCkpOBl$#tg`c$dEw5;*z{Z>H#K*URRuNgoVQ}2q5-cjudYbK!`Lz
z`hzZSrSLtzRutv_MZ4#{msW1b<VwW8Jc(FL;eeer<f>L*_qtjT2-~`+e7r#%qeJW#
zYgZ{fD5_c9Ys+%!IybiZ8)zKsq6uF6${1qKEOi?T8QsN%Va-O?KIeb@h*o*sh>5{6
z+Cok%<Qot!GY29p&gY@~w_HqMU(qUxKelK=VDCRwSIwux@=PHxa#zVA5TOIVgAjwM
zSjs7I&jz+*V-Zo0M7_~?#RrqHuBoh2aaE?5yIh@;jR3d_j;MU=W9xs~el*ccRDUC=
zRnYT~rYJ9Tb;y+=`A{zRgb5AYHp!N2^$y8fJ(crg;mA?9kIte?@9h=RjSW|4sAF#|
zu>jph*p~?VIqJRp)G9Phg?GX6=RZ2YbTMX!O<4Img3m@Fv~r{rn0g^>$$5wVO^?#t
z9Z5io1b>snE{9&z;qb`v;xtn0^^vy2;bZNP5H!<S?bb)O`;~c?^?Bt$Ore&bp1Kto
zIp(^+KML>;!y|?TfVFe$(tUd)Oz=&tg81MY(<&wFKwo3EQN2+;;d<%>iso`Oiz^g_
zhJ%=TcAH$Fb|r)m(fY)J^+Y*=u6=<pPCog#g1BAL^>`f_!kgO34w3v3z0;6*GERy^
za;XHI!4U4-)285=r@y}_@D8@V!*#KKj*p$Fa{qDkXua+1)tS?(uqYK6ZpLGaCq&F^
zWB8sET;PXV_)ZZ`1TWuu)(<eLmd~Yj2*LL0SERd^@bN--2&rt4hob8V`8^K4*~k~~
zkNId&TQ>a+4D7~{;E+a?N(Krc2EyBEpu#}lWu;dwR_dhiKzl)b&*DLU@LxliRzC&w
z6{zR%RPf|ek92g;TQrQmRuDPb<X|17-RAiU^}J;J79*d~tBX<7Y2P0r9fC-3b5@>r
z(je3aAR(PbJj6fP&OLzEBkoW_I_f(6BIWWkX!`xboSJSeFZGOD|4}eXq)U-hm{Fup
zl-GdPEZMmcX0jZvp_i`{`d<Z)LFds3QK574oc68{2IP=hS)c{*HK66<1YTV6IKlNb
z?u+ZfvC-8yo~TY~3YXEa(M@GEd+aVdG5<hFRFy-R?{|m7g(MBiWMuJ5Xn$fAq+8lW
z*WIm8ZWvqommAFS-PbuNL#}`}@f-R|!tvbU;#_>Y9V&JuVjS?dH5++@&)!EYIRdw4
z#cG^?NjPvI>NAbRsN&_&w2G)>hm|WoXW23o^fQH=f700L86?p*QrhA796l&9no~A}
zgJ9ILzeTo`_Acgwukb|0aTrOpkaN6@?z+}u8$0qO(O!v3LrsEzhF)tnSIxP`2Qoaz
zdP<f)l}?nTZrp1U)37Tr>1+_rnv82hh3vHp2g%8rElD)g-Vt+jO#37_51pC;gw<pv
zaYs0P1yTd>wV#BtLezwEBsdUnwe^RU$pMvL0(-Z^SKPac2Q<lSIjFK1LuDX0cc$se
z<@PSR4jf*5NTWLskTatM1h48tq2)p)9_M1*9ah20x@3^7haGc;9dLH)o77VINqnw3
z2%WEH0x*^=X^QiRTi>Ps4bve+Q(EN|>tT)(K}>=kK<ZoN^bIf;dv`gG|DOx+0&>#Y
zJ_s)ugumG{QJuanjJ%f8K>M1UBLrK~8EdGHilfq}g+(k=!!2-jjL8h5-wwB}&WepF
zkhuavYKvTq8X;(c&&66)Rg`Q(EjvyVvZ61NfUrNY>%H6$!{cK#X*VhSULwL%QCG;Z
z@(_fR8Mdh*e-z_-wLt&<1Fm?78cGH5r1P9lH&91QBSGngxWnLqvf>>fVF8$JXWL<^
z6g%Fv?AWaJ9#__rKyJpQK9cacfaL;i12jS)&*_OeYG=U)6BpwuM$K20Y_Ob;fLKR=
zQTRhCVD1phvCFrB;xz3WcnB4Ub-^;k!8M^E9mxJvVA7RfoH_3R?`Ihk%)rJIzF2bX
zh?7%s1iNY~P@=CZkg}k%#O}4=9z4UH)cu*LJyhVth(qQ^p?Q>TF*z992bCFTO!{HZ
zN`Vqc=+uVdo4eDqEQUe>Q4X2c1=!Vdq<f;kMDErwX}TKJV6tl920Lo%!LpJfeNNo+
zg5P?E9}YL|1@%PL9CMdbXlxVNhn2P=XMypCor%LLXF&$E;Z7(Z33CM-Y4yTQX%of6
z5&wE|x$&e-AK#@H?(heH9-*_DMO2j{81U8Z=wQBiP1BoR3krgmX+qk#>QPaAMZFH@
zltwO6b**M#I3H~!Y95=?+6B`jHHK2CYEi~JX5u}BYBZtz0q9>8_Dq=66fqqkviwyD
z;w5?Evx4yUg0)v^0KU*ug%PcueHPN@!btO(>hG*jQUaLoIaZr2j2uP?MIf;X87uVK
zu_i;2f`VQPCvDbE?SJ@Bi>|;kenoPA47n0zGEoeIr(p@7;de#w8on5`y&T<V*CT_k
zZn|mVVsi|e2Vuj{YC}s10|yDpE*iNfmSfS_XdfQ+`!zF}@YVsR(vopHL8eihj)1yD
z6sgwKp<zsRTc&C?jvTJO@+^nC?}FgOhqL3;cZ@$*Cn(Hz6sAh3hq>*(3)j}hIZ|f$
zxKvBfhJ+vAR_`ew8dbcx9!jK^@jFS_hJ7cv6Tn^Z7>WWjqL%^3+h(%TGHmF03+fDl
z9HV~!h#^aaju(V-r`Luu?pZXJk8ER)v!n-QMt%JWIs26>U=bj5^_oA+VuE~+!|&1n
z85q)kM<^peSd{bG@nQR)3zX5(`*3|eu{4BZnzBk{hXarf0Y7xn&8UpV<cKs0Um3za
zH%N-ZdiPOsv0?xWJmWRU)`R<TBA7X1+{K(M^&{xDD)Y$;TP`*vttU>F8y;hL5ARWF
z^2iMQ$W1wbo`0sOM!Ni_gm(=H-J|W3y3+*=JBrG(3JQ>4GX$5kaVKnZNUbLu3Gpp=
zVL!lPy7Y$yd9uRUqanx&{TFlqBNP`<<ndSC@NdOT9m8INxY=%N5W75=U9Jp=;iQ(}
z@a@)hVy73#XMu`9v#(&4kHw)RplKj18RoSqb(O5&8Bx#&cNo8)#s^Qc49;huLC)`n
zM!MK?9Z8vaT;AhAsKN5qyY$I(3yq{z@ASz55J?IG!*%Tm;WH&a*Ipg<K80%Dh(ax9
zb#qYgr?Q)98O}l~G=z1i+Tgj7OUUxcvDnvWpF#(U1brVNq%d#*qH~S}IoqK`T1da&
z?@RzFIVr)EE3yDHt=O=J0ERilG@4T|3|Q7s$yCx25n;*N+%MgE_k!uwIAFT_5^K{P
z1|{W)9`I*hrV+f4RCBs^8wFj{^XNQe?9tVOQD}|BVBdqO_>Fi%BwM5WPKDJ#0?!CT
zwuD+`yw<0E_}?O{`DXoy5y^Zq0n+6e3G$LEKFOXieB9Q3qBg#;4;i=pnKrM9y^rXy
z!>d$L%VF0;#V)RYCi@f>kv3&(blTO(*0YSOT(y)+P5D@G-4?cz?=9BytHWL3!vi}6
zZMXu4AP819&!dg8{aBTC%PQ5dK$VvyWm3z+UG>+I&NythE6DcR9R<oYaqdO{*wx4P
zyvThG>boEIk;XPwhTt>DXUviRtCNc)9~3RZL5upCo6Q{(!|PCeImY|HK?3*?(ai^N
zX`~FX0}S(5BUO-CL}Lq=#4Q--QfNsD$)neRu$?StxzEvLN4tXnlS}>UD&__=D#68t
z5{Zb2dyeJ`Oznlm{=1A_x;*mXAiVy2vx+l=GbQe?i1W5V8?`4~bH{t29T*E22#BS|
z3SJ50zOK$4OGu4~hAXA+rQ8_M(KowP!y+4ES&@11cWyqX33%>D4FQO5!1ewmiHja6
z(ODfeuVq56J*oK>Os8kJ{3*oG#;mh7e~#LVcrE}{Y(}fwn`a@kB_>Zsv+1b2$of0e
z`uXzytS;|$^YJ48P$(dzxh$WjcvH%Ft>p@7!${nvjf}odyaX%s{dm1M+VeM=QdQ$B
zEe4=PJTLvTF$`SY7mQOsSsui0WC`&hN4xSWSwo~8k~9Ca7)~gWdLrHcae6)y0IYnK
z#|?p6vPWjRB#8~9;-g9HI%irx7JS?AJ-c_NFS!J6h|0CR$(RR?g^qG)oGWsyr$A(S
zVKm+<`-<Tp)tL*XQYU?FWi==wnR4+2$R#CElgqI5umm=g-r|Bsa|iiVVz_`*Yq>Z2
zV8Kx8Br$Jd3@JeZ&8^Q)h7Ws1kN!_3L4-Oqi3ubTp9L_(nc<tLp0_wi(5X#0_<<I#
z>F92S9f&NvrbT6mgTg<COwMbtTVVIZXwET#Uxza6%x4!-WKX8)XS=r1O$zD(#S6%Y
z+Z1VIxy01{fq__T^c9#4K-&}&`jfwzWY^m(98Y)z6biZ+k#W^_#xE~4qj7y%+3exr
zNkW`P9$o+3Bn1%Vuz~fs<B`G&M2b5N3DU)b0pugX3pUE77_14ofEhtX;aL(+Z)Ln2
zXRV`sBb<;So+qGA8aappOLed$U!&B%rr)&lG5m2Uf->|O+cGa9@)z=n_syK@et`$|
zReL4+y`TpZZ1IT;r-2;L>4ij!)@XP<#cV{aDSPfl?f4H-XBN=^;dq6strKFEpqdO`
zr#Y0ACKu6RYG(8poi75ed(-nl0E8I<$5yWe*jm%An`3!sC>|^dsg`xIT!nhP+&r(z
zv!t>knAfX>`o(e~M<8Fr4fP+25xSagXJ5VfC`v;Mr8~$k4-bXcFp~$Eq5LihhjXC)
z2<p4~SXy;Rgl@Z>5XP}p|4FuEs41(UvX6+n*cyX4AVMzkh7uf^_+eaSzNkfJt-1>O
z1t7fs71of!Q^F91?-fj9Zo|}JX41JiPsSqK8aM?X*V8(YjP2^-#wTCD*a<7)jMbct
zYN2$ef#^}*(q-YJB&;7A+`394P-=cvyg&X88@0aMU|mn!e5juU_B*)bZ1k!HI)ckc
zv;&wldvZxh_Zs_z43(!UTAMI3+VdZZTmf5}29vNXury^-4X%w-@EK4WOL#m<mtA*h
z&4gGtBTSbKIr0thK~S_A3^~SB(uSi5)j)RbRtm#xiQ*;*Q&gOqemSiXy_EfrVjf5G
z+X6^F`Q#W8SLUUco`FRxs3Db^intlTpk;^m1<ecMcreVOfjFUudV~ltZR)wcglzNy
zs>i_cf<fXx8A0)1H6O6R-I8axb|rA*)bU}~n9414tP&US>4u#-5B{EdT*xnwX`3!X
z`)3Icg!q_3wN|aBnTlx5lq55ZxNFyPOKpnF>R50Qr1E)<aOOk^qlJ>4P`Fy5$S4D#
zI5bO-R<QMP)qIF5%}SaUpL|!q6Y8BZuA+UtPK;ye#<h`Y!e^Su_0Fz;zD5)vFYoT;
z>`MsCQfCHZz|6bXI$3PU#^9fuL!UtPWdbuv`DnWA*l@HcEzOeNwA-9%L+cU%%;H?v
zl>80bH$G*R{v%;-ov?5>b&$r}oRUY9rnInM+M|YibOTMIP8O5>eOMBp|D@*^$gvYd
zDgr#d9u5{fx|$!3lL#d?68*-GILKGIg8PT&rT?KBz&*W2?#7i3NU!h{(0KOkb9oI)
zAnzIn;IcxiQbaWX0^)4hRwCcKEj_bvIudKbev!QWx1KhAaP1`n>oX%_EpWZZ$!CKp
zd5H~<o6SK<v$?M_<>xrSSf%54eCLHFQbv0hH^*V<_fCoOaqRfG0a$ley&IkYi+7Ax
zo1V-34?0Ys4mperwFmQz%sgTdVLNdPv8H9$D8(6UQO-ghDA5s(W&g4k1;rMNh~z|l
zGa{{wAxq3;)*e3gmrTt5j&Y>a|C;_R2byIEgmYfg31z#2(=i7a#Z~yz4B}U*kISnq
zFv!H(b0s4PV3>@~-;HK#;YsdLq9rT}kY=@?T_V&TBT!*Xw?iHx060LLt9t-O0SuSI
zUm;;8+2lwBKL&}>_ff@m5-?-^_WJQ_SiU_Ftuy|{qX_@UQszUWspF=^pjcjd<i#Hg
zIC6Vdg7S}G@Rwpv(K@l2j}BTlNLl2J7!aA)bv;yog_dh@IJA7*6b2|WF@>@%oR^X#
zW8yA>Q+IZZsbjOoZg{Bn5J06B8kk8U^$*E9;Et<#Z|Ob2GZOQB_7m5EuqP<&-w=|d
zXEDO&SkqZ{6zKvUhGc%b_zo@5Ge2hdm0F?trbr^SpuTquyRf}r!><g-Oh**XE(09_
zw)%}Rmp7-iPBOt*WPa}@HkuXz*rn!&-ywfaneH05+krby&K}B2$aKJY=(#o`!UK}F
zw*<UejQT_(3Tz#vFfcF8+p84+f;sBhU|YIIx_J}OO||<>wop%6s|jA<tgt$t5%WE0
zX<PN4i+%pk8NCcpXxRDfG!UQ46x4OkRG{sby<Cj?)w{3u=W5f{MCCBXMz^*2$Q5O(
zewk{Ucc<M`(qb>XZg0rv)wo<Tgp9C_6xkpfrS1yF3b<w<@3c~1bF3)FL?wM9>A&%1
zcve}VFMYDN>tECh5CZuc!#cmH-iI}k;_ZAGVPhZ+^ubdumtO+}Rhra?Ck_~tr1H)x
z%SLw4o(;?gDd|_;5Nv7-q|Jw?o=dwb-Z7Fbjis%TD`$2fESO7DC;fe1ut459sbSxI
zrpwt(2;+Oe7&b72(_H$)3@lynRbGM~;S}g;C<jD=078JwO~U0^?)QHyd_g$AyR!l!
zO<7^yVSu-L0d@PSf-6OucHlolIBOqxa8PPdAmaG3<#TThv`CC|D_mV8<^6R#0pecm
zjY}Q=yK!<r$za?7S+Bzy`jG;jN7T>=L0b>Qb-crp%4ul=8WDVB4=xLYKsQl4w4zV9
zxju#Lh6=_QA{lyY!vgjHi-Y=3-xb-}a@LPS5>@WQJ-A2!X^Z9yFC2yp+yRmiw8Lsa
zdirrUK(HXa3SYst*&004x6L0{RSIHFk~3%byERsUjmK*NUYXN~1dF83752~t`;ug%
zN4f?Yzvc38gD0rCS)f>fP(E^mh&F(0d{3p|_ax~$92?FdBdcj~Err~T&!6<ap&$Uc
zOZ0SAX!+(xJs{C`mPF*``ygWmCQCaeAbbB<j7s-`BL;4{>(BCK<j5dZT>t$m+L9zL
zQbRCZsQsP@W#{oio_w#*;Y)%3H)dIg0-+l9r{WsBbkjznnHIb-a<dA>*SnzC3}4UX
zBS0!pfP<vNCx1}}|0LM3fRW0eM_HE-V_JPZpP#rbLQHJ<Uv}!@Y4D@?f~1`bnRpSf
z49EWbu6%`;QuQ-nIRKLh@Rb2^{zKCiSgkb|0V~+m6eBWjhZ2209@?y*uCodwekI9y
zm7)(&iBM0?<8|~QVRj!d?%sIB`{sA~Qr;FfU<;7)1Nw~w!#HrEK3{SPCDQs1wGy<p
zg?LIMrRh-cy2D`_F{oJjet8LX<DSPfisC74doP}8%dU|F)4;Vk<j??&JphVV0P{sb
z3BJ}|bG&Ao(LYSg2^mKOk45eBU}g|t@&YY-kz0c^Ca0zoUtm1ofJYf5GicZIJ9r^g
zHHJ_(^zbj<n^-?n9ir%Fs!+x&TRm9d^im#69+mrmY_BSWYMGFPjQrNoa!N=gHl^^}
z`{%7H_uw85Ll)ak!PEF|L;;@jM1)w%stzW6u*HAF!_l}Q5@<46s2{^Kg3gpf@-pe}
z+nl??#e&3dzR4_TsW*`eR!d>$e<w5fRF$3v{+goR8Y;BI^qND<19D@Y-9EL{t`_a`
zy`I!jq+!^2em98C4BDXzLi*(m9O*u<;spgkZB_m)vOz$1vC4-2t=)PMT$Bwlvm-}<
zgkGvp0r^OTIb}y$|132Xu1uwGiiLeE#lt!r*$;`uTi^z@D)h>|y0lH2Le-P0$Y@$<
zpKFwjcGXL(mGoiwHd`(3OhZYTP-dyKc(u%y*CPiXeTa>-ux0pxo#6+uju>PiQtjle
zimXL+r=7|(3}AOz`fQqEPNai;=1(v&4R+IMpK>)(X%zJEbn6nI9_E(*{Zf#qQZJ6L
zsezPLMc0XqZ}L#Gy?#lgJZ1!!`1r;1Dd(Z5kiva>E0#{JLgl7KA<@oBL<qsl@V(G-
zk`}2xUDa)3wWlA);e6vviv~5EZ}2y=oeHH(O7AY5!3n39jSgMM=G_tKZpO)2ybd%A
zw*&r&iRXcw4nr#>51+RzF~Ai7^6Do*&ZWv%@XnU<Y8oMcN%u*VEPpWc<c0aSN2sHk
zkzb<932%#I-b<QKzT7!TbBJGRnA3vuvxgY$++4P>{cI0QxmO+eysO?ZsN7gjkXOfg
zN!c{vtJ`T)kkw;l<w?l;iF{!Grm14z_Wp@GXg6iACiTOp^U<dXd)IH9=hdhX2I?og
zc7QF$cAS=)r+sq?-{5mj4&bT6Qg5?^9F>Ur7#}FwtHi%>QZvB6B<A<L=O&YA&C~J7
zN<lV->X5sYmvrk_o~Rp|mR{`9@Dz%2=^3v@(7%2;!@w}B+<|93+D(1>Wc57GGLl}s
zb>s(4RLUZE<J?bQyq$3ji6dZZl{8gbe$>;%&8izLKXK7Re-)xJcv`0*;(JaD1BJp=
z73V%BCYdNc<6w_Rsz7U1CG`Ik)(=w1>l!RO#w1(IR&-RM)%m{`i_(SpgP+LyQ9IEi
zPzBGE7xjL=<CwaWEYj!IC3wY(^2B~GL~Tk&YCb}lY7hi1*m96etVZ$8hoT-7yLjTK
zwy&vYoa9YjFr<VyaFpyHD9{cuyC}SursH$TvamAY!#*CK1~kV4*^6c$((qcbF{fU>
zZl1VNNo7(M{nxF8L&RQ}?m1uG&nq5j2zzEqG8o_YUsnb78Ih<zeI4SecG>7~Fjfup
zgbb%n4<&lPR;XXKeR>oq;jo`2fq1%LI{NZmS8F7<=z{m2U)}<0v5<r}EwhVDM@=&K
z^=`XSXNqw}Jk-dFUV=L`v6eOVB+$V3#=UJDTi_E^%Q|{krB#6f7YO8v^xbj}Qa;)}
z=evp%yQ*JUs)KxUG<JRSyDP@_kb0?eQ@Hy=ICW}1^=X+>sGh>Sms*GsCF8f=?@VmX
zR_SqaD8s)2R`hTQB)IH3K0h(Su)>BlJ`~uodA`X_2Ozg^DF!Fr;>A&^J7<)sg22zI
z`P4wfCQ0NXr(w9Ra}L@LCjZwX_w8DFjjyuYZzN3P@ntPfogU*za$>iXN%ArZRZot`
z1lWz*!{C!RZSo#>ez&>Ux=t8*-vbY`%WiYR=FJxp&LSO*dC4cg>d=Sh>kmA(OO@+{
zmp*+L<PE@EY!6eAQ?aJ<k80&;K19B8+4x{2Uo-RLc7Aia?w;${q<YgBmivnoh|<y2
z#Czp_R4T<j<@BcP!V@#Yw+rTh567a1I72z%XtI3=*+Xl_2|7n2af}+(7ggxPGO*-j
zW--P{JTL@f`xrmpX-7`=`07*VN3I#;C$DiZJXnNZ^4IZ7vatH_cdhjB@dcI1ZJp%D
z1|CAM>3;^^QFz!`l+q+6wm8C4*a?pazLHEm$xaSsqV~#<D?%0@2WrpkQk6GEW-`Jv
zSW5h=O$;@uc;A&7@H-lxbMLm=xz4d9$&ywLYjK2@wFdub<`*GYOyu%Zl&mX2TUSey
z5r#vF;8zKKC-iJ0B`7Bj{Gt?wsw0Q}@KlAIoj$Ql6$)TC6%XuAoBuuFIH@{vq0`-U
z5wE??=A&hIp2Br}ZV?kL@bLWrCl@EG%zHRiUrK=7AX$s-`Ykb!4gu=&07avQ%Lnyb
z-6G>`9ly!}xSy`R$Z^kN5g?$o6dXOWsox1^{FkykKkW|t#?AV9Yxu;yY~Lz=?dX+S
z?U)iJ16DCl@GUwRG^^YXv!l4hZEeK)Sj2Ip#LG%g$ixVggtVc(?*Z{V=d5IA=m6TU
zk+Ln{1LiZGiS^ERf@8t|LFuXNeCMnh)Jfu9)JciDw$!9EN&WkM-;%*%D4$U*-BH3L
z^o`}RF;SU*T8(d93u|Z7Ou_L0mZ@GhL95vI^j02+cx*xd4*J0s<pU$Rhp(*_9}66R
zcQzdOUu=^u%T>R6A-NEJlJk-_@19D0Qh2z_O>+%~hcAz+Rzh88pFHfmcXs0nIa#7j
zgeq6(07);ZIAITFomt=n#(n=KZuhRXDP3gt$D8b1VoKuT<RVW`7CQwPInJ^?&XaOv
zQw}G35FF5Jbj&a6M~HQ=B1i@S=PxCpgBgA|)4o)ZQ=VDgXcL5GFjBbCf4{Wn=U;gH
z1V_Mz)NV`!2BtoDK6-j9u&)hEbnL+ok~}=XR03w{sU*+p*YWqxNpfn-@+HurW6Sv)
zGMUrV{KHZPvdXf5auFG`dY`tG)ky)w$JU7nUooW{Sdd0MD%e6B+5O*?WnP0&(Nf)v
zaf9U89|$!(E}qLK1HYxe{Uf7*^`*W~yA)<<R!y}(b^n+1f|bqK<KLz0SRVPjkI+II
z6%_ZLEb#f#^!)_|<nw1A1pq%j!#V7B$GhmpWM6g$p+WTI!So;hMQD8Q(p75D5?yhj
zMgi3i6Aty=rb7|?%%oKXBMbyE+&);(SQPYR&EPpuua8gm)O5e#ct8K|o@ML{1SqRZ
zKDx9^KhTOBNn$<6jVH*t8m2%zcleNHBm!`*!m$I98GRDTx;}vz>P>?TdP;Fns$)p#
zshuwF7Xonf#@(biSXFjOe`kl!oQms&SU;sf|J7C&dc6a@h#+zOQGmV3TC*IZ01xGm
zl)V=2LWJ0-XU9Uc_!$?cY^i|E%69e8)VW(&PzW95pOT)>{=t!<jii|-@FQM}kg5dD
z8|;RXw?JjJsBt5|@ew)FaJ>32?$^OFK^^WMaufTe{mgj>RT@CyB~lO}@(&rLYT<Kb
zx-oESv$vyEOOSGgj_8)FJRh`c?(q$c9ZWEBC*gkd-EMp(oCR<N^nySxQ?^pV<<gg+
z_x4|it2S#n1vAD4(0bBP_Q}2FbJ4L=_W1YDZmSmFxNbwktiN)@^=V}!w9svKs)gYe
z*wdPC@$q6pa0c(%m-aa!194(<RT&_%d53lg%>&UCSw?p3`W=ZavT08sdU2{d3!gIW
zaw~7YR-FtHNW#9{`4p!TQh#FO<;3^vD2@{j{0lBgtfP}$bts=fFBF-SH7PJxOkAsq
z3Efc|+Ui<qohl+KZQ0||J4$!rGpKBV{F7~UqQxt~tDsY8fIr2LVK4ugqCUTlcb8_j
z7*$pz@LYk*5vnSgq1hh$uI6`J4aPbnW)2wYxK_-rFFLF}DrVD#P+IFzMuy{T#y%4h
zjGMUP_(P(l{N#I%BInhi&7$|ciabjRo#fi#bfx?Hx`~un7v+8vXRzgb4S?eE;XEha
z7ARZ#E$;_KEmQ3zdwvA5y`I%8CASkrz2@lbz1fMUul~B-Pf}XP95Hu&4T1t?@lZVw
z3Q#g>BdJfNN;Gxf+k5II66mRr%Q=@7Ty;n5pBRKW74Yjj&yAKgY6cEWSxaDm@mt=5
z+kOE8cY>dYc<<|^0YeUW74Ga*oNDVy#p9KXfB311KqRyV*LAV={M`zcXuKK=@O9z2
z$Q`Yf9-r%of%^#gjcOca*!3?qE)y}CMASwggvFSmKeqAla`ntoE3;p!<=vg&CvZQp
z=!C_zwv*tMYsk6<onFvLJvBFX-?q|=9>UGlYo3B4{@xO)jZ5yjbcLc=mSL)Sap~_A
z?EALyo9uk5AaU_H$Y(+IlA`$P&{-7|F749M5%G?aM9O61LAD5lH=u)t_4Mbq)!_cU
zt24zP0+O2g(Tjm90rkIO*MfaS94|-v@hHHb38r3-DscyFP3{Yw{`@Mxt+3NW^Zv*0
z<KyFd#jg(gIG^<t7k$0AYgWheX8(=N`TA$^!R(xz-;dwl&Gzgqc&5aZ{pVybcvkjk
z_GpzZ=;`6+lTVhjVv352Qc{l(r|w?<_HD1zaP#9oJp3B?+hL9nNOIn9DYSL|m=Zxa
za+kPtoA!k&Hs`DkhFxs8r1Mxbrm`v~AF_}P&OP6|)|HUbZoJ*cwwCS*?D*#d^@CU1
z7e7w1M3Ck4f!A6K0sZ%1iI4Pr9(Z{=SJjvyo|T(B*Yc#!`*+~>(_GmEo(b;((!xad
zna1ar20<5lxe#>V(fhfF@4iR-t>r~MmSa)>_r5nQ*0Xt@N#3v3R=(JI_L0cd@!Xnz
zJ0;7T8z82<P?Y87`qm=a?~CLFYIwHw=|tt7xacTmufCxn6i3_17x#vL?`I<Dd^kD5
z?7JJw8MLv=>iOdthkfy=MvvtE@mGIxkD8i-50syt4Z6?F5U=iwpX}1_zE=bc{kzWI
zTAm2Itw7vX&fR`rHZ|E0fBe{+_!pbzCY#2l+@`5JZjXzzek?c#FPfb7RUGG8dKO!H
zMrBR?cD^8|$#@C?$f+CZDn?aVCplRciCJy^dUI<<m$Q0-KlFag7gat=vGGi~{G=Du
zuNO3|clI``aX>F%HX-<HLhyKk&F@~J)9%W>!>#XBdkxNCnAFvKuCqSjdV7(ncr@ev
zku6w(BgbdtMyvH;w&s>xaW-!Kc<bF<V)X6Xx2JNQyCW&$;^Kxj4k(q+Jk-zrPPE@t
zm-qdxuKttx@=D=Xb1SRzz;g2xI-Y#JEGhOyhW29(j=#gtg2JOA5Xc8v;uCJY`~Ia(
zNBMMWFnaB5Z}56goKSOg^yAG*bhdk(l_$THjjr@5qJdJS=jrx2j6*Jp>g?~6)xXBu
zmq}UQw^mtwyxSjpUoNh)dUzkbZvuedkLr|t>sSGknJtqu84`S^{Ev7N{4a9gqVu0v
z#DK<Gy`XP;)=RCI-^hVVkEP(1-pi4Mz}|$wzc{m>pM~1bywn3WEaxn0F4V`ij|Sy7
z1l0ppuG*X|r`&ou>Qei)bVKUV*^Kv~M$eu1k9T-O-fy>EK|hoK-MD#qdbEALr=~_U
z$ngImbu<@zxxBo*VSUuR+5SxVLPq)SV2&b@<1}0A^r@qxV`yk-aghW4<@0CkVq4&8
z^jghFR<)kz&(W64(>k8!aZQbl8BJxDZcQ-sGsVM<p!T_!-<O<^8mH!tbEAH2cDo(2
zU)Fv90te<>FE^FnPuVn2*)&e&z9+U2pL#kI3kH6BiC-=|Ux@xEgSM?AV(R6`TG7Q<
zy}&PecedYM1{XZJ9P|f{w@JF>?jHW>rt*FNqrbnO1ED{W8{OdcBQ{!GT%1bb4_-DQ
zawEIh?c37c-d;gLK}t#r5gcc$U$T^sJE?xpwdY39+zQ&I0sOY^+ho;f9L+uz2ABi)
zhqJx3UyUx;IP01GBHlgtZ0Do<`>lq}_S}=tcY%35cYhi{;e3CTsBK>FzPIj==sazm
zEz-*p(;7syk+21z0Hu@uTi}it*DN1Ae<S>1MX1Qz&Cd@5+>}{>0*%YbI%v;d@80-7
zHLXb%UUO3R7sEe4H8Q&JU=2pQplyjC7g85eTT<Kpxoyz37+TLD)hd}2Zeys$Z_^9K
z?I(kyx0KIIZw0!p45XDFkl?RYHZJad5+=dl&3Up)G=K`L84k5~8#bEkU)`Q~xPD9_
zJ@bcX1r>;Jct`9yTY2Yw!^7_lk2XvI4<eeW{;#-me{14O<2cA7%d&{b1|AnMR4Q~$
zxpaBl5xK+`C{K%oDiuVz2q@VK3^#$?NKmT;vcbA4_XJv&vMv%t5eSzAgb;%UYPknO
zxF(vAL?}rhVaN{dAF=bCXXd9l?{nVI`F`Is=Z7;UJ@WG{!%V=ShBLEGYxrQEtE^v-
zmB(hU^Bj<*_x-c&=?V=2%gCK%1`t8cwp84mZ`KEMw=!vtQdA_D3U=F`J$p8zlfAI=
zY71dqSXuRy+C})cUVT*t8FUd5uw>Frw&c;=;itnzn_89@o!V0`JH|W<*=Q;hckj7q
zw|G!Ip1TQ;53>6B0^w2UEe}N!XMM;qqX+)&X^-@TjFBJD(;GJ%(ZatD1O)}b@p|Jk
zU~f~Cb=|`6zHP~ocZECGR#g!O9OpAN6VYCuewsGhZf(NqR-H08%TtQZ(@c53;YU&@
zNe{JZ31!4rM%o%c25!7`-NSpnDJosur761vZclb_o`d2phF|`^)7mNX!lo9E9?^me
zX__Fcwen3CHemqo{&hd?9?BlirfuJ_AuYf`2r@qjJ6}Doob52{(@Z5u)C!O2-cTE5
zKv%o&ZDMcel%@YmO36>7@wkuq`_=0oeYx+5U8b75qQ*}A6xO><J5WQzCnhf5wDLSX
z=tWwz8ex}cj9Yv(r>*U}v=Xa=lde;VB|B2UbfE~n^P?|al#B5-)$A3%JVkQ{N12}C
zc=#}Ws(bz+MAt)s|De-9TH4tmed(P(^VHl{%`t!@r~b$HPSfTuK{n3BwN@%_=rHz*
zyCieKnmVn_1Hie?tmUCKd{j$(!B{wexZAZ<f;yN5=`|7l>)(51^Nw;0c{MdP!Gi%r
z?ZG!MUc9h+mCHuxx)9t<6j_==mZzw)eEjBKi$N(LlzIYC1gJ-fH`76V6aW<f8p_<b
z5R_j6<<+3v5!}cSujGOoC~)Z&xI_b&jsxU|mYwY|K>HogE~LlFhXPl-YOjm$BENC)
zv5mtm-lpRE%^k*Blrkh4rt#DVo}ixx$98~>xKZo4)M3l_%Tw`0rMW|Fra{?(<qjX>
zg*xZ{$+rLfd+($3S$yZ<O@^Ap_w9gZgo~l(RHGnSSoQc<xSGhM()|_|XdQbLVIkSo
zcGRbYT%_<zof(+Mv3G0JtpoOK!o7sPq!f7HB`)9Dwg9$`pus&chHxT)-|PU$6(}gL
z=8T0)R6kP|e$L2>l;lQA@*-pOI<<IZO1xqXZd?Si=+#?}z&d(v>mj(44UjAIq4LgF
znt0khRyP`_t7jRoEW@IiENSFi6|AnhTL+H!oVy0)tLA*Yy$h*(-bH;|?9M#7`XKV)
z`V!3xR(f%2xbKYxTv;|+**2z!c3~=(?lpzf=y?1w+x|z5%o3_Hj|el2v3w&0BxizU
zOroj;f#T?T)wXBlHRD-6;Byp7QlPtfyU*3tHRQYoerdS&iiA@@#Z4y`Aws1x8IU#&
zcNv%a&?Ec)D;%4KpU2CtlCKG?PB1Xow6ryjL1hTwV1eAG>LqxWTIpsS2`3A~<JE4Q
zB{$BB+pdV7@NNjL7z(5(Q*I=eFHG}JYAx5uf9yu~t0)7iq9;V#Qu0FKMOi~bLo`=E
zLB%PbPyHw2&|~8aww8eiWF>GppL|c*-Igf{tX^g$#wC!GBO7@waDq*0Mk;*}i4mMO
zhf(HF#$f4my0wiBcURK_4}z$za4kK#&lc7v0}_tsoZ|~`qBsQju-jEHzM($9XW4n@
zD^=(6fnd_IqvV2<?{BYtY}adYMp_Zz)0bYCKdUX!&gi&Cs41%X&rVKra48J?I=f4d
z0k=*8H`gu!ZrOImF*;?QZbXz8?C0<9>vl*6G9l#P8{P6-L*{kGjrNh4puTlJvX=1A
z%aDV;{RrB)Q(0MwY0TMt6Pl1WbCt4U^2-k4gQ#Ilr17(%&u5j^j(>|Kyldbct&abp
za>f+fT#TaHo0hqB3vVx8Nb;>kJ{hOzk6-e9=8(L%cD86^tBU?`x0Xmjqw9>XPqYVq
zSW;8Y{NPQ(>^FlT$&(3h!@%X!3Kxy&45PXC8tSvDq`Jm{pa_aWE>Q9Y1z{q=sKPy!
zpXHskv5;eJ;})UvZ=%c=X;JPr$1s!3!3NA^X$KkU-o&@K!z8Y|cleD0{xJb|CL&S7
zllwS!e?RYzg=t-VT->eVu-372m?K}uuIL3AH2(JlQU9)b@k%o)>EGoi*^QkK78?cy
zv|#}wMEsXWd_Op@O<<!F@(lAaz8<T&KPwV64+@&G)km%uV+*m4$ln#Bl^(?CMDM?+
vq@-y1jxnM`6>tvWj~)2_e}43?XpN?CGd-~tyt-)<`1&dY6U_SJ^3DGO-HPj?

literal 0
HcmV?d00001

diff --git a/demo/documented/biharmonic/common.txt b/demo/documented/biharmonic/common.txt
new file mode 100644
index 0000000..898b24c
--- /dev/null
+++ b/demo/documented/biharmonic/common.txt
@@ -0,0 +1,83 @@
+
+This demo illustrates how to:
+
+* Solve a linear partial differential equation
+* Use a discontinuous Galerkin method
+* Solve a fourth-order differential equation
+
+The solution for :math:`u` in this demo will look as follows:
+
+.. image:: ../biharmonic_u.png
+    :scale: 75 %
+
+Equation and problem definition
+-------------------------------
+
+The biharmonic equation is a fourth-order elliptic equation. On the domain
+:math:`\Omega \subset \mathbb{R}^{d}`, :math:`1 \le d \le 3`, it reads
+
+.. math::
+   \nabla^{4} u = f \quad {\rm in} \ \Omega,
+
+where :math:`\nabla^{4} \equiv \nabla^{2} \nabla^{2}` is the biharmonic
+operator and :math:`f` is a prescribed source term. To formulate a complete
+boundary value problem, the biharmonic equation must be complemented by
+suitable boundary conditions.
+
+Multiplying the biharmonic equation by a test function and integrating
+by parts twice leads to a problem second-order derivatives, which
+would requires :math:`H^{2}` conforming (roughly :math:`C^{0}`
+continuous) basis functions.  To solve the biharmonic equation using
+Lagrange finite element basis functions, the biharmonic equation can
+be split into two second-order equations (see the Mixed Poisson demo
+for a mixed method for the Poisson equation), or a variational
+formulation can be constructed that imposes weak continuity of normal
+derivatives between finite element cells.  The demo uses a
+discontinuous Galerkin approach to impose continuity of the normal
+derivative weakly.
+
+Consider a triangulation :math:`\mathcal{T}` of the domain :math:`\Omega`,
+where the union of interior facets is denoted by :math:`\Gamma`.
+Functions evaluated on opposite sides of a facet are indicated by the
+subscripts ':math:`+`' and ':math:`-`'.
+Using the standard continuous Lagrange finite element space
+
+.. math::
+    V_ = \left\{v \in H^{1}_{0}(\Omega): \ v \in P_{k}(K) \ \forall \ K \in \mathcal{T} \right\}
+
+and considering the boundary conditions
+
+.. math::
+   u            &= 0 \quad {\rm on} \ \partial\Omega \\
+   \nabla^{2} u &= 0 \quad {\rm on} \ \partial\Omega
+
+a weak formulation of the biharmonic reads: find :math:`u \in V` such that
+
+.. math::
+   \sum_{K \in \mathcal{T}} \int_{K} \nabla^{2} u \nabla^{2} v \, dx \
+  - \int_{\Gamma} \left<\nabla^{2} u \right>  [\!\![ \nabla v ]\!\!] \, ds
+  - \int_{\Gamma}[\!\![  \nabla u ]\!\!]  \left<\nabla^{2} v \right>  \, ds
+  + \int_{\Gamma} \frac{\alpha}{h}[\!\![ \nabla u ]\!\!]  [\!\![ \nabla v ]\!\!]  \, ds
+  = \int_{\Omega} vf \, dx \quad \forall \ v \in V
+
+where :math:`\left< u \right> = (1/2) (u_{+} + u_{-})`, :math:`[\!\![  w
+]\!\!]  = w_{+} \cdot n_{+} + w_{-} \cdot n_{-}`, :math:`\alpha \ge 0`
+is a penalty term and :math:`h` is a measure of the cell size.  For the
+implementation, it is useful to identify the bilinear form
+
+.. math::
+   a(u, v) = \sum_{K \in \mathcal{T}} \int_{K} \nabla^{2} u \nabla^{2} v \, dx \
+  - \int_{\Gamma} \left<\nabla^{2} u \right>[\!\![ \nabla v ]\!\!]  \, ds
+  - \int_{\Gamma} [\!\![ \nabla u ]\!\!]  \left<\nabla^{2} v \right>  \, ds
+  + \int_{\Gamma} \frac{\alpha}{h} [\!\![ \nabla u ]\!\!] [\!\![ \nabla v ]\!\!] \, ds
+
+and the linear form
+
+.. math::
+  L(v) = \int_{\Omega} vf \, dx
+
+The input parameters for this demos are defined as follows:
+
+* :math:`\Omega = [0,1] \times [0,1]` (a unit square)
+* :math:`\alpha = 8.0` (penalty parameter)
+* :math:`f = 4.0 \pi^4\sin(\pi x)\sin(\pi y)` (source term)
diff --git a/demo/documented/biharmonic/cpp/Biharmonic.h b/demo/documented/biharmonic/cpp/Biharmonic.h
new file mode 100644
index 0000000..afd6200
--- /dev/null
+++ b/demo/documented/biharmonic/cpp/Biharmonic.h
@@ -0,0 +1,6644 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __BIHARMONIC_H
+#define __BIHARMONIC_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class biharmonic_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  biharmonic_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new biharmonic_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class biharmonic_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  biharmonic_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new biharmonic_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class biharmonic_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  biharmonic_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new biharmonic_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class biharmonic_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  biharmonic_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new biharmonic_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class biharmonic_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  biharmonic_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.5;
+    // Quadrature points on the UFC reference element: (0.333333333333333, 0.333333333333333)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_D02[1][3] = \
+    {{4, 4, -8}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[3] = {0, 2, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[3] = {0, 1, 5};
+    
+    static const double FE0_D11[1][4] = \
+    {{4.0, 4, -4, -4.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[4] = {0, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 81.
+    double G[6];
+    G[0] = W1*det*(K[2]*K[2]*K[2]*K[2] + K[3]*K[3]*(2.0*K[2]*K[2] + K[3]*K[3]));
+    G[1] = W1*det*(K[2]*K[2]*(K[0]*K[0] + K[1]*K[1]) + K[3]*K[3]*(K[0]*K[0] + K[1]*K[1]));
+    G[2] = W1*det*(K[0]*K[0]*K[0]*K[0] + K[1]*K[1]*(2.0*K[0]*K[0] + K[1]*K[1]));
+    G[3] = 2.0*W1*det*(K[0]*K[2]*K[2]*K[2] + K[3]*(K[1]*K[2]*K[2] + K[3]*(K[0]*K[2] + K[1]*K[3])));
+    G[4] = 2.0*W1*det*(K[0]*K[0]*K[0]*K[2] + K[1]*(K[0]*K[1]*K[2] + K[3]*(K[0]*K[0] + K[1]*K[1])));
+    G[5] = W1*det*(4.0*K[0]*K[0]*K[2]*K[2] + K[1]*K[3]*(4.0*K[1]*K[3] + 8.0*K[0]*K[2]));
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 300
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Number of operations for primary indices: 108
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        for (unsigned int k = 0; k < 3; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc1[k]] += FE0_D02[0][j]*FE0_D02[0][k]*G[0];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc4[k]] += FE0_D02[0][j]*FE0_D02[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc1[k]] += FE0_D02[0][j]*FE0_D02[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc4[k]] += FE0_D02[0][j]*FE0_D02[0][k]*G[2];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 72
+      for (unsigned int j = 0; j < 4; j++)
+      {
+        for (unsigned int k = 0; k < 3; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*6 + nzc1[k]] += FE0_D02[0][k]*FE0_D11[0][j]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*6 + nzc4[k]] += FE0_D02[0][k]*FE0_D11[0][j]*G[4];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 48
+      for (unsigned int j = 0; j < 4; j++)
+      {
+        for (unsigned int k = 0; k < 4; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*6 + nzc3[k]] += FE0_D11[0][j]*FE0_D11[0][k]*G[5];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 72
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        for (unsigned int k = 0; k < 4; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc3[k]] += FE0_D02[0][j]*FE0_D11[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc3[k]] += FE0_D02[0][j]*FE0_D11[0][k]*G[4];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// interior facet tensor corresponding to the local contribution to
+/// a form from the integral over an interior facet.
+
+class biharmonic_interior_facet_integral_0_otherwise: public ufc::interior_facet_integral
+{
+public:
+
+  /// Constructor
+  biharmonic_interior_facet_integral_0_otherwise() : ufc::interior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_interior_facet_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local interior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates_0,
+                               const double*  vertex_coordinates_1,
+                               std::size_t facet_0,
+                               std::size_t facet_1,
+                               int cell_orientation_0,
+                               int cell_orientation_1) const
+  {
+    // Compute Jacobian
+    double J_0[4];
+    compute_jacobian_triangle_2d(J_0, vertex_coordinates_0);
+    
+    // Compute Jacobian inverse and determinant
+    double K_0[4];
+    double detJ_0;
+    compute_jacobian_inverse_triangle_2d(K_0, detJ_0, J_0);
+    
+    // Compute Jacobian
+    double J_1[4];
+    compute_jacobian_triangle_2d(J_1, vertex_coordinates_1);
+    
+    // Compute Jacobian inverse and determinant
+    double K_1[4];
+    double detJ_1;
+    compute_jacobian_inverse_triangle_2d(K_1, detJ_1, J_1);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet_0][0];
+    const unsigned int v1 = edge_vertices[facet_0][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates_0[2*v1 + 0] - vertex_coordinates_0[2*v0 + 0];
+    const double dx1 = vertex_coordinates_0[2*v1 + 1] - vertex_coordinates_0[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates_0[2*facet_0] - vertex_coordinates_0[2*v0]) - dx0*(vertex_coordinates_0[2*facet_0 + 1] - vertex_coordinates_0[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n_00 = direction ? dx1 / det : -dx1 / det;
+    const double n_01 = direction ? -dx0 / det : dx0 / det;// Compute facet normals from the facet scale factor constants
+    const double n_10 = !direction ? dx1 / det : -dx1 / det;
+    const double n_11 = !direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    const double volume_0 = std::abs(detJ_0)/2.0;
+    // Compute cell volume
+    const double volume_1 = std::abs(detJ_1)/2.0;
+    
+    
+    // Compute circumradius of triangle in 2D
+    const double v1v2_0  = std::sqrt((vertex_coordinates_0[4] - vertex_coordinates_0[2])*(vertex_coordinates_0[4] - vertex_coordinates_0[2]) + (vertex_coordinates_0[5] - vertex_coordinates_0[3])*(vertex_coordinates_0[5] - vertex_coordinates_0[3]) );
+    const double v0v2_0  = std::sqrt(J_0[3]*J_0[3] + J_0[1]*J_0[1]);
+    const double v0v1_0  = std::sqrt(J_0[0]*J_0[0] + J_0[2]*J_0[2]);
+    const double circumradius_0 = 0.25*(v1v2_0*v0v2_0*v0v1_0)/(volume_0);
+    // Compute circumradius of triangle in 2D
+    const double v1v2_1  = std::sqrt((vertex_coordinates_1[4] - vertex_coordinates_1[2])*(vertex_coordinates_1[4] - vertex_coordinates_1[2]) + (vertex_coordinates_1[5] - vertex_coordinates_1[3])*(vertex_coordinates_1[5] - vertex_coordinates_1[3]) );
+    const double v0v2_1  = std::sqrt(J_1[3]*J_1[3] + J_1[1]*J_1[1]);
+    const double v0v1_1  = std::sqrt(J_1[0]*J_1[0] + J_1[2]*J_1[2]);
+    const double circumradius_1 = 0.25*(v1v2_1*v0v2_1*v0v1_1)/(volume_1);
+    
+    
+    // Array of quadrature weights.
+    static const double W2[2] = {0.5, 0.5};
+    // Quadrature points on the UFC reference element: (0.211324865405187), (0.788675134594813)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0_D01[2][5] = \
+    {{1.0, -0.154700538379251, 3.15470053837925, -0.845299461620749, -3.15470053837925},
+    {1.0, 2.15470053837925, 0.845299461620748, -3.15470053837925, -0.845299461620748}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE0_f0_D02[2][3] = \
+    {{4, 3.99999999999999, -7.99999999999999},
+    {4, 4, -7.99999999999999}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[3] = {0, 2, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[3] = {0, 1, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[3] = {0, 1, 5};
+    
+    static const double FE0_f0_D10[2][5] = \
+    {{1.0, 2.15470053837925, 0.845299461620748, -0.845299461620748, -3.15470053837925},
+    {1.0, -0.154700538379252, 3.15470053837925, -3.15470053837925, -0.84529946162075}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[5] = {0, 1, 3, 4, 5};
+    
+    static const double FE0_f0_D11[2][4] = \
+    {{4, 4, -4, -4},
+    {4.0, 3.99999999999999, -3.99999999999999, -4.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[4] = {0, 3, 4, 5};
+    
+    static const double FE0_f1_D01[2][3] = \
+    {{-2.15470053837925, -0.154700538379252, 2.3094010767585},
+    {0.154700538379252, 2.15470053837925, -2.3094010767585}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[3] = {0, 1, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[3] = {0, 2, 4};
+    
+    static const double FE0_f1_D10[2][5] = \
+    {{-2.15470053837925, -1.0, 0.845299461620748, -0.845299461620748, 3.15470053837925},
+    {0.154700538379252, -1.0, 3.15470053837925, -3.15470053837925, 0.845299461620748}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[5] = {0, 1, 3, 4, 5};
+    
+    static const double FE0_f2_D01[2][5] = \
+    {{-2.15470053837925, -1.0, 0.845299461620748, 3.15470053837925, -0.845299461620749},
+    {0.154700538379252, -1.0, 3.15470053837925, 0.845299461620749, -3.15470053837925}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE0_f2_D11[2][4] = \
+    {{4, 4.00000000000001, -4.00000000000001, -3.99999999999999},
+    {4, 4, -4, -3.99999999999999}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[4] = {0, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 144; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 460.
+    double G[34];
+    G[0] = -0.5*det*(K_1[2]*K_1[2]*K_1[2]*n_10 + K_1[3]*(K_1[2]*K_1[3]*n_10 + n_11*(K_1[2]*K_1[2] + K_1[3]*K_1[3])));
+    G[1] = -0.5*det*(K_1[2]*K_1[2]*(K_1[0]*n_10 + K_1[1]*n_11) + K_1[3]*K_1[3]*(K_1[0]*n_10 + K_1[1]*n_11));
+    G[2] = -0.5*det*(K_1[2]*K_1[2]*(K_0[2]*n_00 + K_0[3]*n_01) + K_1[3]*K_1[3]*(K_0[2]*n_00 + K_0[3]*n_01));
+    G[3] = -0.5*det*(K_1[2]*K_1[2]*(K_0[0]*n_00 + K_0[1]*n_01) + K_1[3]*K_1[3]*(K_0[0]*n_00 + K_0[1]*n_01));
+    G[4] = -0.5*det*(K_1[2]*n_10*(K_1[0]*K_1[0] + K_1[1]*K_1[1]) + K_1[3]*n_11*(K_1[0]*K_1[0] + K_1[1]*K_1[1]));
+    G[5] = -0.5*det*(K_1[0]*K_1[0]*K_1[0]*n_10 + K_1[1]*(K_1[0]*K_1[1]*n_10 + n_11*(K_1[0]*K_1[0] + K_1[1]*K_1[1])));
+    G[6] = -0.5*det*(K_1[0]*K_1[0]*(K_0[2]*n_00 + K_0[3]*n_01) + K_1[1]*K_1[1]*(K_0[2]*n_00 + K_0[3]*n_01));
+    G[7] = -0.5*det*(K_1[0]*K_1[0]*(K_0[0]*n_00 + K_0[1]*n_01) + K_1[1]*K_1[1]*(K_0[0]*n_00 + K_0[1]*n_01));
+    G[8] = -0.5*det*(K_1[2]*n_10*(K_0[2]*K_0[2] + K_0[3]*K_0[3]) + K_1[3]*n_11*(K_0[2]*K_0[2] + K_0[3]*K_0[3]));
+    G[9] = -0.5*det*(K_1[0]*n_10*(K_0[2]*K_0[2] + K_0[3]*K_0[3]) + K_1[1]*n_11*(K_0[2]*K_0[2] + K_0[3]*K_0[3]));
+    G[10] = -0.5*det*(K_0[2]*K_0[2]*K_0[2]*n_00 + K_0[3]*(K_0[2]*K_0[3]*n_00 + n_01*(K_0[2]*K_0[2] + K_0[3]*K_0[3])));
+    G[11] = -0.5*det*(K_0[2]*K_0[2]*(K_0[0]*n_00 + K_0[1]*n_01) + K_0[3]*K_0[3]*(K_0[0]*n_00 + K_0[1]*n_01));
+    G[12] = -0.5*det*(K_1[2]*n_10*(K_0[0]*K_0[0] + K_0[1]*K_0[1]) + K_1[3]*n_11*(K_0[0]*K_0[0] + K_0[1]*K_0[1]));
+    G[13] = -0.5*det*(K_1[0]*n_10*(K_0[0]*K_0[0] + K_0[1]*K_0[1]) + K_1[1]*n_11*(K_0[0]*K_0[0] + K_0[1]*K_0[1]));
+    G[14] = -0.5*det*(K_0[2]*n_00*(K_0[0]*K_0[0] + K_0[1]*K_0[1]) + K_0[3]*n_01*(K_0[0]*K_0[0] + K_0[1]*K_0[1]));
+    G[15] = -0.5*det*(K_0[0]*K_0[0]*K_0[0]*n_00 + K_0[1]*(K_0[0]*K_0[1]*n_00 + n_01*(K_0[0]*K_0[0] + K_0[1]*K_0[1])));
+    G[16] =  - det*(K_1[0]*K_1[2]*K_1[2]*n_10 + K_1[3]*(K_1[1]*K_1[2]*n_10 + n_11*(K_1[0]*K_1[2] + K_1[1]*K_1[3])));
+    G[17] =  - det*(K_1[0]*K_1[0]*K_1[2]*n_10 + K_1[1]*(K_1[0]*K_1[3]*n_10 + n_11*(K_1[0]*K_1[2] + K_1[1]*K_1[3])));
+    G[18] =  - det*(K_1[0]*K_1[2]*(K_0[2]*n_00 + K_0[3]*n_01) + K_1[1]*K_1[3]*(K_0[2]*n_00 + K_0[3]*n_01));
+    G[19] =  - det*(K_1[0]*K_1[2]*(K_0[0]*n_00 + K_0[1]*n_01) + K_1[1]*K_1[3]*(K_0[0]*n_00 + K_0[1]*n_01));
+    G[20] =  - det*(K_1[2]*n_10*(K_0[0]*K_0[2] + K_0[1]*K_0[3]) + K_1[3]*n_11*(K_0[0]*K_0[2] + K_0[1]*K_0[3]));
+    G[21] =  - det*(K_1[0]*n_10*(K_0[0]*K_0[2] + K_0[1]*K_0[3]) + K_1[1]*n_11*(K_0[0]*K_0[2] + K_0[1]*K_0[3]));
+    G[22] =  - det*(K_0[0]*K_0[2]*K_0[2]*n_00 + K_0[3]*(K_0[1]*K_0[2]*n_00 + n_01*(K_0[0]*K_0[2] + K_0[1]*K_0[3])));
+    G[23] =  - det*(K_0[0]*K_0[0]*K_0[2]*n_00 + K_0[1]*(K_0[0]*K_0[3]*n_00 + n_01*(K_0[0]*K_0[2] + K_0[1]*K_0[3])));
+    G[24] = det*w[0][0]*(K_1[2]*K_1[2]*n_10*n_10 + K_1[3]*n_11*(2.0*K_1[2]*n_10 + K_1[3]*n_11))/(circumradius_0 + circumradius_1);
+    G[25] = det*w[0][0]*(K_1[0]*K_1[2]*n_10*n_10 + n_11*(K_1[1]*K_1[3]*n_11 + n_10*(K_1[0]*K_1[3] + K_1[1]*K_1[2])))/(circumradius_0 + circumradius_1);
+    G[26] = det*w[0][0]*(K_1[2]*n_10*(K_0[2]*n_00 + K_0[3]*n_01) + K_1[3]*n_11*(K_0[2]*n_00 + K_0[3]*n_01))/(circumradius_0 + circumradius_1);
+    G[27] = det*w[0][0]*(K_1[2]*n_10*(K_0[0]*n_00 + K_0[1]*n_01) + K_1[3]*n_11*(K_0[0]*n_00 + K_0[1]*n_01))/(circumradius_0 + circumradius_1);
+    G[28] = det*w[0][0]*(K_1[0]*K_1[0]*n_10*n_10 + K_1[1]*n_11*(2.0*K_1[0]*n_10 + K_1[1]*n_11))/(circumradius_0 + circumradius_1);
+    G[29] = det*w[0][0]*(K_1[0]*n_10*(K_0[2]*n_00 + K_0[3]*n_01) + K_1[1]*n_11*(K_0[2]*n_00 + K_0[3]*n_01))/(circumradius_0 + circumradius_1);
+    G[30] = det*w[0][0]*(K_1[0]*n_10*(K_0[0]*n_00 + K_0[1]*n_01) + K_1[1]*n_11*(K_0[0]*n_00 + K_0[1]*n_01))/(circumradius_0 + circumradius_1);
+    G[31] = det*w[0][0]*(K_0[2]*K_0[2]*n_00*n_00 + K_0[3]*n_01*(2.0*K_0[2]*n_00 + K_0[3]*n_01))/(circumradius_0 + circumradius_1);
+    G[32] = det*w[0][0]*(K_0[0]*K_0[2]*n_00*n_00 + n_01*(K_0[1]*K_0[3]*n_01 + n_00*(K_0[0]*K_0[3] + K_0[1]*K_0[2])))/(circumradius_0 + circumradius_1);
+    G[33] = det*w[0][0]*(K_0[0]*K_0[0]*n_00*n_00 + K_0[1]*n_01*(2.0*K_0[0]*n_00 + K_0[1]*n_01))/(circumradius_0 + circumradius_1);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet_0)
+    {
+    case 0:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 7268
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 7268
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[31]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[33]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 480
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc4[k]] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc4[k]] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[21];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc4[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc4[k]] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc4[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc4[k]] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[23];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 720
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc2[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc5[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc2[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc5[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc2[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc5[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[14];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[15];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 480
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[21];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[23];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 1200
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D01[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D10[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][j]*FE0_f0_D01[ip][k]*I[26];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc3[k]] += FE0_f0_D01[ip][j]*FE0_f0_D10[ip][k]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D10[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D10[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D10[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc3[k]] += FE0_f0_D10[ip][j]*FE0_f0_D10[ip][k]*I[30];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D01[ip][k]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc3[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D10[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc1[k]] += FE0_f0_D01[ip][j]*FE0_f0_D01[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc3[k]] += FE0_f0_D01[ip][j]*FE0_f0_D10[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D10[ip][j]*I[27];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D10[ip][k]*I[30];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D10[ip][j]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc3[k]] += FE0_f0_D10[ip][j]*FE0_f0_D10[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 720
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[14];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[15];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 6332
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 6332
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[31]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[33]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 243
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[4];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 360
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc8[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[27];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f1_D01[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f1_D01[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[14];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[15];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[21];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 360
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc4[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[23];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc4[k]] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc4[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc4[k]] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[27];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 72
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[6];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc2[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc7[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f1_D01[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc9[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[14];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc2[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc5[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc7[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f1_D01[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[15];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[21];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f1_D10[ip][j]*FE0_f1_D10[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f1_D10[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f1_D10[ip][j]*I[30];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc8[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f1_D10[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc1[k]] += FE0_f0_D01[ip][j]*FE0_f0_D01[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc3[k]] += FE0_f0_D01[ip][j]*FE0_f0_D10[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc8[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f1_D10[ip][k]*I[30];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D10[ip][j]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc3[k]] += FE0_f0_D10[ip][j]*FE0_f0_D10[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 72
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc7[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[6];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 6332
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 6332
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[31]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[33]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 243
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[4];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 360
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f2_D01[ip][k]*FE0_f2_D11[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f2_D11[ip][j]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f2_D11[ip][j]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc11[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f2_D01[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[27];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f1_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f1_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[14];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[15];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc3[k]] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[21];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 360
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc13[k] + 6)] += FE0_f2_D01[ip][j]*FE0_f2_D11[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f2_D01[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc13[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f2_D11[ip][k]*I[23];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc4[k]] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc13[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f2_D11[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc4[k]] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[27];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 72
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc13[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[6];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc12[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f1_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc2[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc5[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[14];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc2[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc5[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc12[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f1_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[15];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[21];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f2_D01[ip][j]*FE0_f2_D01[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f2_D01[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc3[k]] += FE0_f0_D10[ip][k]*FE0_f2_D01[ip][j]*I[30];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + (nzc11[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f2_D01[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc1[k]] += FE0_f0_D01[ip][j]*FE0_f0_D01[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*12 + nzc3[k]] += FE0_f0_D01[ip][j]*FE0_f0_D10[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + (nzc11[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f2_D01[ip][k]*I[30];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc1[k]] += FE0_f0_D01[ip][k]*FE0_f0_D10[ip][j]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*12 + nzc3[k]] += FE0_f0_D10[ip][j]*FE0_f0_D10[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 72
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc12[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[6];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 6332
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 6332
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[31]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[33]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 243
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc7[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[4];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 360
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc8[k]] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc8[k]] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[27];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[14];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[15];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f1_D01[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f1_D01[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc8[k]] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[21];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 360
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc4[k]] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc4[k]] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[27];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 72
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[6];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc2[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc7[k]] += FE0_f0_D01[ip][j]*FE0_f1_D01[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc9[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[14];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc7[k]] += FE0_f0_D10[ip][j]*FE0_f1_D01[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[15];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc7[k]] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[21];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D01[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D10[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc8[k]] += FE0_f0_D01[ip][j]*FE0_f1_D10[ip][k]*I[30];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D10[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D10[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc8[k]] += FE0_f0_D10[ip][j]*FE0_f1_D10[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f1_D10[ip][j]*I[30];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f1_D10[ip][j]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc8[k]] += FE0_f1_D10[ip][j]*FE0_f1_D10[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 72
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc7[k]] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc7[k]] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[6];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 5444
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 5444
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[31]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[33]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc7[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc7[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc8[k]] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc8[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc8[k]] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[30];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[15];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc8[k]] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[21];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc8[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[23];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc8[k]] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[26];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[28];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[30];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 144
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[14];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[15];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[21];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc7[k]] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc7[k]] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[26];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 300
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f1_D10[ip][j]*FE0_f1_D10[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc8[k]] += FE0_f1_D10[ip][j]*FE0_f1_D10[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc8[k] + 6)] += FE0_f1_D10[ip][j]*FE0_f1_D10[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc8[k]] += FE0_f1_D10[ip][j]*FE0_f1_D10[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 144
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc7[k]] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc7[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc7[k]] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[14];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 5444
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 5444
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[31]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[33]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc7[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc7[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + nzc7[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f2_D01[ip][k]*FE0_f2_D11[ip][j]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + nzc8[k]] += FE0_f1_D10[ip][k]*FE0_f2_D11[ip][j]*I[28];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc11[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f2_D01[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc8[k]] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[30];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[15];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc8[k]] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[21];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc11[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[23];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc8[k]] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc9[j]*12 + nzc8[k]] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[26];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc13[k] + 6)] += FE0_f2_D01[ip][j]*FE0_f2_D11[ip][k]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f2_D01[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc13[k] + 6)] += FE0_f1_D10[ip][j]*FE0_f2_D11[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[30];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 144
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc13[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + (nzc13[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc7[j]*12 + nzc4[k]] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[14];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[15];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[21];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc7[k]] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc7[k]] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc9[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[26];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 300
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f2_D01[ip][j]*FE0_f2_D01[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc8[k]] += FE0_f1_D10[ip][k]*FE0_f2_D01[ip][j]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + (nzc11[k] + 6)] += FE0_f1_D10[ip][j]*FE0_f2_D01[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc8[j]*12 + nzc8[k]] += FE0_f1_D10[ip][j]*FE0_f1_D10[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 144
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + nzc7[k]] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + (nzc12[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*12 + nzc7[k]] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[14];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 6332
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 6332
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[33]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[31]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 243
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc12[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[4];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 360
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D11[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f0_D11[ip][j]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc11[k]] += FE0_f0_D11[ip][j]*FE0_f2_D01[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f2_D11[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f2_D11[ip][j]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + nzc11[k]] += FE0_f2_D01[ip][k]*FE0_f2_D11[ip][j]*I[27];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f1_D01[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f1_D01[ip][j]*I[14];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc11[k]] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[15];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D02[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc3[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f0_D10[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[21];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 360
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D11[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc13[k]] += FE0_f0_D01[ip][j]*FE0_f2_D11[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D11[ip][k]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc13[k]] += FE0_f0_D10[ip][j]*FE0_f2_D11[ip][k]*I[26];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f2_D01[ip][j]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc13[k]] += FE0_f2_D01[ip][j]*FE0_f2_D11[ip][k]*I[27];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 72
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc13[k]] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[6];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc12[k]] += FE0_f0_D01[ip][j]*FE0_f1_D01[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc2[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc5[k]] += FE0_f0_D01[ip][j]*FE0_f0_D02[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc12[k]] += FE0_f0_D10[ip][j]*FE0_f1_D01[ip][k]*I[14];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f0_D10[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[15];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[21];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 675
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D01[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D01[ip][j]*FE0_f0_D10[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 6)*12 + nzc11[k]] += FE0_f0_D01[ip][j]*FE0_f2_D01[ip][k]*I[30];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f0_D10[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][j]*FE0_f0_D10[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 6)*12 + nzc11[k]] += FE0_f0_D10[ip][j]*FE0_f2_D01[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc1[k] + 6)] += FE0_f0_D01[ip][k]*FE0_f2_D01[ip][j]*I[30];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc3[k] + 6)] += FE0_f0_D10[ip][k]*FE0_f2_D01[ip][j]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc11[k]] += FE0_f2_D01[ip][j]*FE0_f2_D01[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 72
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc12[k]] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[6];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 5444
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 5444
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[33]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[31]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc12[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc12[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc7[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D10[ip][j]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc13[k]] += FE0_f1_D10[ip][j]*FE0_f2_D11[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f2_D01[ip][j]*I[28];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc13[k]] += FE0_f2_D01[ip][j]*FE0_f2_D11[ip][k]*I[30];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D10[ip][k]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc11[k]] += FE0_f0_D11[ip][j]*FE0_f2_D01[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + (nzc8[k] + 6)] += FE0_f1_D10[ip][k]*FE0_f2_D11[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + nzc11[k]] += FE0_f2_D01[ip][k]*FE0_f2_D11[ip][j]*I[30];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[15];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc11[k]] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc9[j] + 6)*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc8[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D10[ip][k]*I[21];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc11[k]] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[23];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc8[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D10[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[26];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 144
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 6)*12 + nzc12[k]] += FE0_f0_D11[ip][j]*FE0_f1_D01[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[14];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[15];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f1_D10[ip][j]*I[21];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D10[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc7[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc9[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[26];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 300
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + (nzc8[k] + 6)] += FE0_f1_D10[ip][j]*FE0_f1_D10[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[(nzc8[j] + 6)*12 + nzc11[k]] += FE0_f1_D10[ip][j]*FE0_f2_D01[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc8[k] + 6)] += FE0_f1_D10[ip][k]*FE0_f2_D01[ip][j]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc11[k]] += FE0_f2_D01[ip][j]*FE0_f2_D01[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 144
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc7[j] + 6)*12 + nzc13[k]] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc4[k] + 6)] += FE0_f0_D11[ip][k]*FE0_f1_D01[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc13[k]] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[14];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 5444
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 5444
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 34
+          double I[34];
+          // Number of operations: 1
+          I[0] = G[28]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[30]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[13]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[33]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[11]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[15]*W2[ip];
+          
+          // Number of operations: 1
+          I[11] = G[17]*W2[ip];
+          
+          // Number of operations: 1
+          I[12] = G[21]*W2[ip];
+          
+          // Number of operations: 1
+          I[13] = G[19]*W2[ip];
+          
+          // Number of operations: 1
+          I[14] = G[23]*W2[ip];
+          
+          // Number of operations: 1
+          I[15] = G[25]*W2[ip];
+          
+          // Number of operations: 1
+          I[16] = G[29]*W2[ip];
+          
+          // Number of operations: 1
+          I[17] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[18] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[19] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[20] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[21] = G[27]*W2[ip];
+          
+          // Number of operations: 1
+          I[22] = G[32]*W2[ip];
+          
+          // Number of operations: 1
+          I[23] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[24] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[25] = G[12]*W2[ip];
+          
+          // Number of operations: 1
+          I[26] = G[14]*W2[ip];
+          
+          // Number of operations: 1
+          I[27] = G[16]*W2[ip];
+          
+          // Number of operations: 1
+          I[28] = G[18]*W2[ip];
+          
+          // Number of operations: 1
+          I[29] = G[20]*W2[ip];
+          
+          // Number of operations: 1
+          I[30] = G[22]*W2[ip];
+          
+          // Number of operations: 1
+          I[31] = G[24]*W2[ip];
+          
+          // Number of operations: 1
+          I[32] = G[26]*W2[ip];
+          
+          // Number of operations: 1
+          I[33] = G[31]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc12[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc12[k]] += FE0_f1_D01[ip][j]*FE0_f1_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f1_D01[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc12[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc12[k]] += FE0_f0_D02[ip][j]*FE0_f1_D01[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f2_D01[ip][k]*FE0_f2_D11[ip][j]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + nzc11[k]] += FE0_f2_D01[ip][k]*FE0_f2_D11[ip][j]*I[28];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + (nzc11[k] + 6)] += FE0_f2_D01[ip][k]*FE0_f2_D11[ip][j]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + nzc11[k]] += FE0_f2_D01[ip][k]*FE0_f2_D11[ip][j]*I[30];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[15];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc11[k]] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[16];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 6)*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[18];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc5[j] + 6)*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc11[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[21];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc11[k]] += FE0_f1_D01[ip][j]*FE0_f2_D01[ip][k]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[23];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + (nzc11[k] + 6)] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc5[j]*12 + nzc11[k]] += FE0_f0_D02[ip][j]*FE0_f2_D01[ip][k]*I[26];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc13[k] + 6)] += FE0_f2_D01[ip][j]*FE0_f2_D11[ip][k]*I[27];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc13[k]] += FE0_f2_D01[ip][j]*FE0_f2_D11[ip][k]*I[29];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc13[k] + 6)] += FE0_f2_D01[ip][j]*FE0_f2_D11[ip][k]*I[28];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc13[k]] += FE0_f2_D01[ip][j]*FE0_f2_D11[ip][k]*I[30];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 144
+          for (unsigned int j = 0; j < 3; j++)
+          {
+            for (unsigned int k = 0; k < 4; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + (nzc13[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc12[j] + 6)*12 + nzc13[k]] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + (nzc13[k] + 6)] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc12[j]*12 + nzc13[k]] += FE0_f1_D01[ip][j]*FE0_f2_D11[ip][k]*I[14];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 540
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[15];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[17];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[19];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[21];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[23];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[25];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[16];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc2[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[18];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc5[k] + 6)] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[20];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f2_D01[ip][j]*I[22];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc2[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[24];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc5[k]] += FE0_f0_D02[ip][k]*FE0_f2_D01[ip][j]*I[26];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 300
+          for (unsigned int j = 0; j < 5; j++)
+          {
+            for (unsigned int k = 0; k < 5; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + (nzc11[k] + 6)] += FE0_f2_D01[ip][j]*FE0_f2_D01[ip][k]*I[31];
+              // Number of operations to compute entry: 3
+              A[(nzc11[j] + 6)*12 + nzc11[k]] += FE0_f2_D01[ip][j]*FE0_f2_D01[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + (nzc11[k] + 6)] += FE0_f2_D01[ip][j]*FE0_f2_D01[ip][k]*I[32];
+              // Number of operations to compute entry: 3
+              A[nzc11[j]*12 + nzc11[k]] += FE0_f2_D01[ip][j]*FE0_f2_D01[ip][k]*I[33];
+            } // end loop over 'k'
+          } // end loop over 'j'
+          
+          // Number of operations for primary indices: 144
+          for (unsigned int j = 0; j < 4; j++)
+          {
+            for (unsigned int k = 0; k < 3; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[11];
+              // Number of operations to compute entry: 3
+              A[(nzc13[j] + 6)*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[13];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + (nzc12[k] + 6)] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[12];
+              // Number of operations to compute entry: 3
+              A[nzc13[j]*12 + nzc12[k]] += FE0_f1_D01[ip][k]*FE0_f2_D11[ip][j]*I[14];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class biharmonic_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  biharmonic_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    6
+    // Number of operations (multiply-add pairs) for tensor contraction: 21
+    // Total number of operations (multiply-add pairs):                  30
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0 - 0.00277777777777778*G0_1 - 0.00277777777777778*G0_2 - 0.0111111111111111*G0_3;
+    A[1] = -0.00277777777777778*G0_0 + 0.0166666666666667*G0_1 - 0.00277777777777781*G0_2 - 0.0111111111111111*G0_4;
+    A[2] = -0.00277777777777778*G0_0 - 0.0027777777777778*G0_1 + 0.0166666666666667*G0_2 - 0.0111111111111111*G0_5;
+    A[3] = -0.0111111111111111*G0_0 + 0.0888888888888888*G0_3 + 0.0444444444444443*G0_4 + 0.0444444444444443*G0_5;
+    A[4] = -0.0111111111111111*G0_1 + 0.0444444444444443*G0_3 + 0.0888888888888887*G0_4 + 0.0444444444444443*G0_5;
+    A[5] = -0.0111111111111111*G0_2 + 0.0444444444444443*G0_3 + 0.0444444444444443*G0_4 + 0.0888888888888887*G0_5;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class biharmonic_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  biharmonic_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "bd8ad34e16f34b87c83da3c3cfa16afe27e38ee4b99e9479a6600907f4c60c54fd55269fa45142164ce9e66e4afe72796590fd88525f0610851900c13e4692df";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new biharmonic_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new biharmonic_finite_element_1();
+        break;
+      }
+    case 2:
+      {
+        return new biharmonic_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new biharmonic_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new biharmonic_dofmap_1();
+        break;
+      }
+    case 2:
+      {
+        return new biharmonic_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new biharmonic_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return new biharmonic_interior_facet_integral_0_otherwise();
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class biharmonic_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  biharmonic_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~biharmonic_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "9a0e5d6d194de632408849439b4e348035f5f938271c8f88b18541fec23a6ad6203835eeaaecea00101dc60215cfed9f0ad01e069f415d8073294be2ed9eabe9";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new biharmonic_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new biharmonic_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new biharmonic_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new biharmonic_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new biharmonic_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Biharmonic
+{
+
+class CoefficientSpace_alpha: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_alpha(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_alpha(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_alpha(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_alpha(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_alpha(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_alpha(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_alpha()
+  {
+  }
+
+};
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_alpha Form_a_FunctionSpace_2;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), alpha(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& alpha):
+    dolfin::Form(2, 1), alpha(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->alpha = alpha;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> alpha):
+    dolfin::Form(2, 1), alpha(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->alpha = *alpha;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), alpha(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& alpha):
+    dolfin::Form(2, 1), alpha(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->alpha = alpha;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> alpha):
+    dolfin::Form(2, 1), alpha(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->alpha = *alpha;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "alpha")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "alpha";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_alpha;
+
+  // Coefficients
+  dolfin::CoefficientAssigner alpha;
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new biharmonic_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new biharmonic_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new biharmonic_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/biharmonic/cpp/Biharmonic.ufl b/demo/documented/biharmonic/cpp/Biharmonic.ufl
new file mode 100644
index 0000000..60b8634
--- /dev/null
+++ b/demo/documented/biharmonic/cpp/Biharmonic.ufl
@@ -0,0 +1,50 @@
+# Copyright (C) 2009 Kristian B. Oelgaard, Garth N. Wells and Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-06-26
+# Last changed: 2011-05-11
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Biharmonic equation in a discontinuous Galerkin (DG)
+# formulation.
+#
+# Compile this form with FFC: ffc -l dolfin Biharmonic.ufl
+
+# Elements
+element = FiniteElement("Lagrange", triangle, 2)
+
+# Trial and test functions
+u = TrialFunction(element)
+v = TestFunction(element)
+f = Coefficient(element)
+
+# Normal component, mesh size and right-hand side
+n  = FacetNormal(triangle)
+h = 2.0*Circumradius(triangle)
+h_avg = (h('+') + h('-'))/2
+
+# Parameters
+alpha = Constant(triangle)
+
+# Bilinear form
+a = inner(div(grad(u)), div(grad(v)))*dx \
+  - inner(avg(div(grad(u))), jump(grad(v), n))*dS \
+  - inner(jump(grad(u), n), avg(div(grad(v))))*dS \
+  + alpha('+')/h_avg*inner(jump(grad(u), n), jump(grad(v),n))*dS
+
+# Linear form
+L = f*v*dx
diff --git a/demo/documented/biharmonic/cpp/CMakeLists.txt b/demo/documented/biharmonic/cpp/CMakeLists.txt
new file mode 100644
index 0000000..8a494dd
--- /dev/null
+++ b/demo/documented/biharmonic/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_biharmonic)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/biharmonic/cpp/compile.log b/demo/documented/biharmonic/cpp/compile.log
new file mode 100644
index 0000000..ba94b9a
--- /dev/null
+++ b/demo/documented/biharmonic/cpp/compile.log
@@ -0,0 +1,1262 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Biharmonic
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 1
+  Coefficients:           '[c_1]'
+  Coefficient names:      '[alpha]'
+  Unique elements:        'CG2(?), R0(?)'
+  Unique sub elements:    'CG2(?), R0(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.045367 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 2 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 2 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]]])}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {None: {(0, 1): array([[-0.33333333333333304],
+         [8.3266726846886741e-17],
+         [0.33333333333333348],
+         [1.3333333333333326],
+         [-1.6653345369377348e-16],
+         [-1.3333333333333328]], dtype=object), (0, 0): array([[-0.11111111111111108],
+         [-0.11111111111111115],
+         [-0.11111111111111106],
+         [0.44444444444444436],
+         [0.44444444444444436],
+         [0.44444444444444448]], dtype=object), (0, 2): array([[3.9999999999999982],
+         [2.2204460492503131e-16],
+         [3.9999999999999969],
+         [-4.4408920985006262e-16],
+         [-7.9999999999999964],
+         [8.8817841970012523e-16]], dtype=object), (2, 0): array([[3.9999999999999991],
+         [3.9999999999999991],
+         [0.0],
+         [-9.0719159405384027e-32],
+         [9.0719159405384027e-32],
+         [-7.9999999999999982]], dtype=object), (1, 0): array([[-0.33333333333333309],
+         [0.33333333333333315],
+         [0.0],
+         [1.3333333333333328],
+         [-1.3333333333333328],
+         [-2.1533148803874999e-16]], dtype=object), (1, 1): array([[3.9999999999999991],
+         [-4.4408920985006262e-16],
+         [0.0],
+         [3.9999999999999982],
+         [-3.9999999999999982],
+         [-3.9999999999999991]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[-0.33333333333333309, 0.33333333333333315, 0.0, 1.3333333333333328,
+          -1.3333333333333328, -2.1533148803874999e-16]], dtype=object), 'FE0_D02': array([[3.9999999999999982, 2.2204460492503131e-16, 3.9999999999999969,
+          -4.4408920985006262e-16, -7.9999999999999964,
+          8.8817841970012523e-16]], dtype=object), 'FE0_D01': array([[-0.33333333333333304, 8.3266726846886741e-17, 0.33333333333333348,
+          1.3333333333333326, -1.6653345369377348e-16, -1.3333333333333328]], dtype=object), 'FE0_D11': array([[3.9999999999999991, -4.4408920985006262e-16, 0.0,
+          3.9999999999999982, -3.9999999999999982, -3.9999999999999991]], dtype=object), 'FE1_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_D20': array([[3.9999999999999991, 3.9999999999999991, 0.0,
+          -9.0719159405384027e-32, 9.0719159405384027e-32,
+          -7.9999999999999982]], dtype=object), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[-0.11111111111111108, -0.11111111111111115, -0.11111111111111106,
+          0.44444444444444436, 0.44444444444444436, 0.44444444444444448]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE0_D10': array([[-0.33333333333333309, 0.33333333333333315, 0.0, 1.3333333333333328,
+          -1.3333333333333328, -2.1533148803874999e-16]], dtype=object), 'FE0_D02': array([[3.9999999999999982, 2.2204460492503131e-16, 3.9999999999999969,
+          -4.4408920985006262e-16, -7.9999999999999964,
+          8.8817841970012523e-16]], dtype=object), 'FE0_D01': array([[-0.33333333333333304, 8.3266726846886741e-17, 0.33333333333333348,
+          1.3333333333333326, -1.6653345369377348e-16, -1.3333333333333328]], dtype=object), 'FE0_D11': array([[3.9999999999999991, -4.4408920985006262e-16, 0.0,
+          3.9999999999999982, -3.9999999999999982, -3.9999999999999991]], dtype=object), 'FE1_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_D20': array([[3.9999999999999991, 3.9999999999999991, 0.0,
+          -9.0719159405384027e-32, 9.0719159405384027e-32,
+          -7.9999999999999982]], dtype=object), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[-0.11111111111111108, -0.11111111111111115, -0.11111111111111106,
+          0.44444444444444436, 0.44444444444444436, 0.44444444444444448]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE0_D02': 'FE0_D02', 'FE0_D01': 'FE0_D01', 'FE0_D11': 'FE0_D11', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE0_D20': 'FE0_D20', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D02': array([[3.9999999999999982, 3.9999999999999969, -7.9999999999999964]], dtype=object), 'FE0_D01': array([[-0.33333333333333304, 0.33333333333333348, 1.3333333333333326,
+          -1.3333333333333328]], dtype=object), 'FE0_D11': array([[3.9999999999999991, 3.9999999999999982, -3.9999999999999982,
+          -3.9999999999999991]], dtype=object), 'FE1_C0': array([[ 0.33333333,  0.33333333,  0.33333333]]), 'FE0': array([[-0.11111111111111108, -0.11111111111111115, -0.11111111111111106,
+          0.44444444444444436, 0.44444444444444436, 0.44444444444444448]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D01', (2, [0, 1, 3, 4]), False, False), 'FE0_D02': ('FE0_D02', (1, [0, 2, 4]), False, False), 'FE0_D01': ('FE0_D01', (0, [0, 2, 3, 5]), False, False), 'FE0_D11': ('FE0_D11', (3, [0, 3, 4, 5]), False, False), 'FE1_C0': ('FE1_C0', (5, [0, 1, 2]), False, False), 'FE1_C1': ('FE1_C0', (8, [3, 4, 5]), False, False), 'FE0_D20': ('FE0_D02', (4, [0, 1, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (10, [3, 4]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (9, [3, 5]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (6, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (7, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {2: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {0: {(0, 0): array([[1.0, 1.0]], dtype=object)}, 1: {(0, 0): array([[1.0, 1.0]], dtype=object)}, 2: {(0, 0): array([[1.0, 1.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 1: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 2: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ 0.78867513,  0.21132487],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.21132487,  0.78867513],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.78867513,  0.21132487]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.21132487,  0.78867513]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]]])}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {0: {(0, 1): array([[1.0000000000000009, 1.0000000000000007],
+         [-5.5511151231257827e-17, -3.3306690738754696e-16],
+         [-0.15470053837925146, 2.1547005383792515],
+         [3.1547005383792501, 0.84529946162074787],
+         [-0.84529946162074876, -3.1547005383792515],
+         [-3.154700538379251, -0.84529946162074832]], dtype=object), (0, 0): array([[2.7755575615628914e-17, 4.163336342344337e-17],
+         [0.4553418012614795, -0.12200846792814624],
+         [-0.12200846792814618, 0.45534180126147961],
+         [0.66666666666666674, 0.66666666666666652],
+         [-1.3877787807814457e-17, -5.5511151231257827e-17],
+         [-1.7347234759768071e-17, -4.163336342344337e-17]], dtype=object), (0, 2): array([[3.9999999999999978, 3.9999999999999982],
+         [1.1102230246251565e-15, -1.3322676295501878e-15],
+         [3.9999999999999933, 3.9999999999999969],
+         [-8.8817841970012523e-16, -1.7763568394002505e-15],
+         [-7.9999999999999938, -7.9999999999999911],
+         [2.2204460492503131e-15, -4.4408920985006262e-16]], dtype=object), (2, 0): array([[3.9999999999999964, 3.9999999999999969],
+         [3.9999999999999947, 3.999999999999996],
+         [0.0, 0.0],
+         [-1.3290753880174574e-15, -3.5612467689935939e-16],
+         [1.3290753880174574e-15, 3.5612467689935939e-16],
+         [-7.9999999999999911, -7.9999999999999929]], dtype=object), (1, 0): array([[1.0000000000000002, 1.0000000000000009],
+         [2.1547005383792506, -0.15470053837925168],
+         [0.0, 0.0],
+         [0.84529946162074754, 3.1547005383792492],
+         [-0.84529946162074754, -3.1547005383792492],
+         [-3.1547005383792515, -0.84529946162074987]], dtype=object), (1, 1): array([[3.9999999999999973, 4.0],
+         [-6.6613381477509392e-16, 2.2204460492503131e-16],
+         [0.0, 0.0],
+         [3.9999999999999978, 3.9999999999999898],
+         [-3.9999999999999978, -3.9999999999999898],
+         [-3.9999999999999973, -4.0000000000000009]], dtype=object)}, 1: {(0, 1): array([[-2.154700538379251, 0.15470053837925168],
+         [0.0, -3.3306690738754696e-16],
+         [-0.15470053837925157, 2.1547005383792515],
+         [-7.7715611723760958e-16, -6.6613381477509392e-16],
+         [2.3094010767585025, -2.3094010767585025],
+         [1.2212453270876722e-15, 8.8817841970012523e-16]], dtype=object), (0, 0): array([[0.45534180126147966, -0.12200846792814617],
+         [2.0816681711721685e-17, 9.0205620750793969e-17],
+         [-0.12200846792814618, 0.45534180126147961],
+         [-1.3877787807814457e-17, -2.7755575615628914e-17],
+         [0.66666666666666674, 0.66666666666666652],
+         [-1.7347234759768071e-17, -4.163336342344337e-17]], dtype=object), (0, 2): array([[3.9999999999999951, 3.9999999999999973],
+         [8.8817841970012523e-16, -1.7763568394002505e-15],
+         [3.9999999999999973, 3.9999999999999973],
+         [-1.3322676295501878e-15, -1.3322676295501878e-15],
+         [-7.9999999999999929, -7.9999999999999911],
+         [1.1102230246251565e-15, -8.8817841970012523e-16]], dtype=object), (2, 0): array([[4.0, 3.9999999999999978],
+         [4.0000000000000018, 3.9999999999999987],
+         [0.0, 0.0],
+         [1.3290753880174578e-15, 3.5612467689935875e-16],
+         [-1.3290753880174578e-15, -3.5612467689935875e-16],
+         [-8.0000000000000018, -7.9999999999999964]], dtype=object), (1, 0): array([[-2.1547005383792515, 0.15470053837925191],
+         [-1.0000000000000009, -1.0000000000000009],
+         [0.0, 0.0],
+         [0.84529946162074754, 3.1547005383792492],
+         [-0.84529946162074754, -3.1547005383792492],
+         [3.1547005383792524, 0.84529946162074832]], dtype=object), (1, 1): array([[3.9999999999999964, 4.0],
+         [2.2204460492503131e-16, 4.4408920985006262e-16],
+         [0.0, 0.0],
+         [3.9999999999999991, 3.9999999999999902],
+         [-3.9999999999999991, -3.9999999999999902],
+         [-3.9999999999999973, -4.0000000000000009]], dtype=object)}, 2: {(0, 1): array([[-2.1547005383792506, 0.15470053837925235],
+         [-3.3306690738754696e-16, 0.0],
+         [-0.99999999999999956, -0.99999999999999933],
+         [0.84529946162074832, 3.1547005383792497],
+         [3.1547005383792506, 0.84529946162074876],
+         [-0.84529946162074854, -3.1547005383792515]], dtype=object), (0, 0): array([[0.45534180126147955, -0.12200846792814618],
+         [-0.12200846792814621, 0.4553418012614795],
+         [0.0, 0.0],
+         [0.0, 2.7755575615628914e-17],
+         [0.0, -5.5511151231257827e-17],
+         [0.66666666666666663, 0.66666666666666663]], dtype=object), (0, 2): array([[3.9999999999999951, 3.9999999999999973],
+         [1.5543122344752192e-15, 1.5543122344752192e-15],
+         [3.9999999999999991, 3.9999999999999964],
+         [-3.1086244689504383e-15, -2.2204460492503131e-15],
+         [-7.9999999999999982, -7.9999999999999982],
+         [4.8849813083506888e-15, 5.3290705182007514e-15]], dtype=object), (2, 0): array([[3.9999999999999964, 3.9999999999999947],
+         [3.9999999999999982, 3.9999999999999929],
+         [0.0, 0.0],
+         [9.7295071111809815e-16, -9.7295071111809894e-16],
+         [-9.7295071111809815e-16, 9.7295071111809894e-16],
+         [-7.9999999999999947, -7.9999999999999876]], dtype=object), (1, 0): array([[-2.1547005383792506, 0.15470053837925191],
+         [-0.15470053837925096, 2.1547005383792515],
+         [0.0, 0.0],
+         [-1.5543122344752192e-15, -1.5543122344752192e-15],
+         [1.5543122344752192e-15, 1.5543122344752192e-15],
+         [2.3094010767585016, -2.3094010767585034]], dtype=object), (1, 1): array([[3.9999999999999964, 3.9999999999999973],
+         [-3.1086244689504383e-15, -3.7747582837255322e-15],
+         [0.0, 0.0],
+         [4.0000000000000053, 4.0000000000000044],
+         [-4.0000000000000053, -4.0000000000000044],
+         [-3.9999999999999938, -3.9999999999999938]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_f0': array([[2.7755575615628914e-17, 0.4553418012614795, -0.12200846792814618,
+          0.66666666666666674, -1.3877787807814457e-17,
+          -1.7347234759768071e-17],
+         [4.163336342344337e-17, -0.12200846792814624, 0.45534180126147961,
+          0.66666666666666652, -5.5511151231257827e-17,
+          -4.163336342344337e-17]], dtype=object), 'FE0_f1': array([[0.45534180126147966, 2.0816681711721685e-17, -0.12200846792814618,
+          -1.3877787807814457e-17, 0.66666666666666674,
+          -1.7347234759768071e-17],
+         [-0.12200846792814617, 9.0205620750793969e-17, 0.45534180126147961,
+          -2.7755575615628914e-17, 0.66666666666666652,
+          -4.163336342344337e-17]], dtype=object), 'FE0_f2': array([[0.45534180126147955, -0.12200846792814621, 0.0, 0.0, 0.0,
+          0.66666666666666663],
+         [-0.12200846792814618, 0.4553418012614795, 0.0,
+          2.7755575615628914e-17, -5.5511151231257827e-17,
+          0.66666666666666663]], dtype=object), 'FE2_f2': array([[1.0],
+         [1.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f1_D11': array([[3.9999999999999964, 2.2204460492503131e-16, 0.0,
+          3.9999999999999991, -3.9999999999999991, -3.9999999999999973],
+         [4.0, 4.4408920985006262e-16, 0.0, 3.9999999999999902,
+          -3.9999999999999902, -4.0000000000000009]], dtype=object), 'FE0_f1_D10': array([[-2.1547005383792515, -1.0000000000000009, 0.0, 0.84529946162074754,
+          -0.84529946162074754, 3.1547005383792524],
+         [0.15470053837925191, -1.0000000000000009, 0.0, 3.1547005383792492,
+          -3.1547005383792492, 0.84529946162074832]], dtype=object), 'FE0_f2_D10': array([[-2.1547005383792506, -0.15470053837925096, 0.0,
+          -1.5543122344752192e-15, 1.5543122344752192e-15, 2.3094010767585016],
+         [0.15470053837925191, 2.1547005383792515, 0.0,
+          -1.5543122344752192e-15, 1.5543122344752192e-15,
+          -2.3094010767585034]], dtype=object), 'FE0_f2_D11': array([[3.9999999999999964, -3.1086244689504383e-15, 0.0,
+          4.0000000000000053, -4.0000000000000053, -3.9999999999999938],
+         [3.9999999999999973, -3.7747582837255322e-15, 0.0,
+          4.0000000000000044, -4.0000000000000044, -3.9999999999999938]], dtype=object), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE2_f1': array([[1.0],
+         [1.0]], dtype=object), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f0_D10': array([[1.0000000000000002, 2.1547005383792506, 0.0, 0.84529946162074754,
+          -0.84529946162074754, -3.1547005383792515],
+         [1.0000000000000009, -0.15470053837925168, 0.0, 3.1547005383792492,
+          -3.1547005383792492, -0.84529946162074987]], dtype=object), 'FE0_f0_D11': array([[3.9999999999999973, -6.6613381477509392e-16, 0.0,
+          3.9999999999999978, -3.9999999999999978, -3.9999999999999973],
+         [4.0, 2.2204460492503131e-16, 0.0, 3.9999999999999898,
+          -3.9999999999999898, -4.0000000000000009]], dtype=object), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_f2_D02': array([[3.9999999999999951, 1.5543122344752192e-15, 3.9999999999999991,
+          -3.1086244689504383e-15, -7.9999999999999982,
+          4.8849813083506888e-15],
+         [3.9999999999999973, 1.5543122344752192e-15, 3.9999999999999964,
+          -2.2204460492503131e-15, -7.9999999999999982,
+          5.3290705182007514e-15]], dtype=object), 'FE0_f2_D01': array([[-2.1547005383792506, -3.3306690738754696e-16, -0.99999999999999956,
+          0.84529946162074832, 3.1547005383792506, -0.84529946162074854],
+         [0.15470053837925235, 0.0, -0.99999999999999933, 3.1547005383792497,
+          0.84529946162074876, -3.1547005383792515]], dtype=object), 'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f2_D20': array([[3.9999999999999964, 3.9999999999999982, 0.0,
+          9.7295071111809815e-16, -9.7295071111809815e-16,
+          -7.9999999999999947],
+         [3.9999999999999947, 3.9999999999999929, 0.0,
+          -9.7295071111809894e-16, 9.7295071111809894e-16,
+          -7.9999999999999876]], dtype=object), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f1_D20': array([[4.0, 4.0000000000000018, 0.0, 1.3290753880174578e-15,
+          -1.3290753880174578e-15, -8.0000000000000018],
+         [3.9999999999999978, 3.9999999999999987, 0.0,
+          3.5612467689935875e-16, -3.5612467689935875e-16,
+          -7.9999999999999964]], dtype=object), 'FE0_f1_D01': array([[-2.154700538379251, 0.0, -0.15470053837925157,
+          -7.7715611723760958e-16, 2.3094010767585025, 1.2212453270876722e-15],
+         [0.15470053837925168, -3.3306690738754696e-16, 2.1547005383792515,
+          -6.6613381477509392e-16, -2.3094010767585025,
+          8.8817841970012523e-16]], dtype=object), 'FE0_f1_D02': array([[3.9999999999999951, 8.8817841970012523e-16, 3.9999999999999973,
+          -1.3322676295501878e-15, -7.9999999999999929,
+          1.1102230246251565e-15],
+         [3.9999999999999973, -1.7763568394002505e-15, 3.9999999999999973,
+          -1.3322676295501878e-15, -7.9999999999999911,
+          -8.8817841970012523e-16]], dtype=object), 'FE0_f0_D20': array([[3.9999999999999964, 3.9999999999999947, 0.0,
+          -1.3290753880174574e-15, 1.3290753880174574e-15,
+          -7.9999999999999911],
+         [3.9999999999999969, 3.999999999999996, 0.0,
+          -3.5612467689935939e-16, 3.5612467689935939e-16,
+          -7.9999999999999929]], dtype=object), 'FE0_f0_D01': array([[1.0000000000000009, -5.5511151231257827e-17, -0.15470053837925146,
+          3.1547005383792501, -0.84529946162074876, -3.154700538379251],
+         [1.0000000000000007, -3.3306690738754696e-16, 2.1547005383792515,
+          0.84529946162074787, -3.1547005383792515, -0.84529946162074832]], dtype=object), 'FE2_f0': array([[1.0],
+         [1.0]], dtype=object), 'FE0_f0_D02': array([[3.9999999999999978, 1.1102230246251565e-15, 3.9999999999999933,
+          -8.8817841970012523e-16, -7.9999999999999938,
+          2.2204460492503131e-15],
+         [3.9999999999999982, -1.3322676295501878e-15, 3.9999999999999969,
+          -1.7763568394002505e-15, -7.9999999999999911,
+          -4.4408920985006262e-16]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[2.7755575615628914e-17, 0.4553418012614795, -0.12200846792814618,
+          0.66666666666666674, -1.3877787807814457e-17,
+          -1.7347234759768071e-17],
+         [4.163336342344337e-17, -0.12200846792814624, 0.45534180126147961,
+          0.66666666666666652, -5.5511151231257827e-17,
+          -4.163336342344337e-17]], dtype=object), 'FE0_f1': array([[0.45534180126147966, 2.0816681711721685e-17, -0.12200846792814618,
+          -1.3877787807814457e-17, 0.66666666666666674,
+          -1.7347234759768071e-17],
+         [-0.12200846792814617, 9.0205620750793969e-17, 0.45534180126147961,
+          -2.7755575615628914e-17, 0.66666666666666652,
+          -4.163336342344337e-17]], dtype=object), 'FE0_f2': array([[0.45534180126147955, -0.12200846792814621, 0.0, 0.0, 0.0,
+          0.66666666666666663],
+         [-0.12200846792814618, 0.4553418012614795, 0.0,
+          2.7755575615628914e-17, -5.5511151231257827e-17,
+          0.66666666666666663]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_f1_D10': array([[-2.1547005383792515, -1.0000000000000009, 0.0, 0.84529946162074754,
+          -0.84529946162074754, 3.1547005383792524],
+         [0.15470053837925191, -1.0000000000000009, 0.0, 3.1547005383792492,
+          -3.1547005383792492, 0.84529946162074832]], dtype=object), 'FE0_f2_D10': array([[-2.1547005383792506, -0.15470053837925096, 0.0,
+          -1.5543122344752192e-15, 1.5543122344752192e-15, 2.3094010767585016],
+         [0.15470053837925191, 2.1547005383792515, 0.0,
+          -1.5543122344752192e-15, 1.5543122344752192e-15,
+          -2.3094010767585034]], dtype=object), 'FE0_f2_D11': array([[3.9999999999999964, -3.1086244689504383e-15, 0.0,
+          4.0000000000000053, -4.0000000000000053, -3.9999999999999938],
+         [3.9999999999999973, -3.7747582837255322e-15, 0.0,
+          4.0000000000000044, -4.0000000000000044, -3.9999999999999938]], dtype=object), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE0_f0_D10': array([[1.0000000000000002, 2.1547005383792506, 0.0, 0.84529946162074754,
+          -0.84529946162074754, -3.1547005383792515],
+         [1.0000000000000009, -0.15470053837925168, 0.0, 3.1547005383792492,
+          -3.1547005383792492, -0.84529946162074987]], dtype=object), 'FE0_f0_D11': array([[3.9999999999999973, -6.6613381477509392e-16, 0.0,
+          3.9999999999999978, -3.9999999999999978, -3.9999999999999973],
+         [4.0, 2.2204460492503131e-16, 0.0, 3.9999999999999898,
+          -3.9999999999999898, -4.0000000000000009]], dtype=object), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_f2_D01': array([[-2.1547005383792506, -3.3306690738754696e-16, -0.99999999999999956,
+          0.84529946162074832, 3.1547005383792506, -0.84529946162074854],
+         [0.15470053837925235, 0.0, -0.99999999999999933, 3.1547005383792497,
+          0.84529946162074876, -3.1547005383792515]], dtype=object), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f1_D20': array([[4.0, 4.0000000000000018, 0.0, 1.3290753880174578e-15,
+          -1.3290753880174578e-15, -8.0000000000000018],
+         [3.9999999999999978, 3.9999999999999987, 0.0,
+          3.5612467689935875e-16, -3.5612467689935875e-16,
+          -7.9999999999999964]], dtype=object), 'FE0_f1_D01': array([[-2.154700538379251, 0.0, -0.15470053837925157,
+          -7.7715611723760958e-16, 2.3094010767585025, 1.2212453270876722e-15],
+         [0.15470053837925168, -3.3306690738754696e-16, 2.1547005383792515,
+          -6.6613381477509392e-16, -2.3094010767585025,
+          8.8817841970012523e-16]], dtype=object), 'FE0_f0_D20': array([[3.9999999999999964, 3.9999999999999947, 0.0,
+          -1.3290753880174574e-15, 1.3290753880174574e-15,
+          -7.9999999999999911],
+         [3.9999999999999969, 3.999999999999996, 0.0,
+          -3.5612467689935939e-16, 3.5612467689935939e-16,
+          -7.9999999999999929]], dtype=object), 'FE0_f0_D01': array([[1.0000000000000009, -5.5511151231257827e-17, -0.15470053837925146,
+          3.1547005383792501, -0.84529946162074876, -3.154700538379251],
+         [1.0000000000000007, -3.3306690738754696e-16, 2.1547005383792515,
+          0.84529946162074787, -3.1547005383792515, -0.84529946162074832]], dtype=object), 'FE2_f0': array([[1.0],
+         [1.0]], dtype=object), 'FE0_f0_D02': array([[3.9999999999999978, 1.1102230246251565e-15, 3.9999999999999933,
+          -8.8817841970012523e-16, -7.9999999999999938,
+          2.2204460492503131e-15],
+         [3.9999999999999982, -1.3322676295501878e-15, 3.9999999999999969,
+          -1.7763568394002505e-15, -7.9999999999999911,
+          -4.4408920985006262e-16]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE0_f0_D20': ['FE0_f2_D20'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE2_f0': ['FE2_f1', 'FE2_f2'], 'FE0_f0_D11': ['FE0_f1_D11'], 'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE0_f0_D02': ['FE0_f1_D02', 'FE0_f2_D02'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE0_f0_D01': 'FE0_f0_D01', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE0_f1_D11': 'FE0_f0_D11', 'FE0_f1_D10': 'FE0_f1_D10', 'FE0_f2_D10': 'FE0_f2_D10', 'FE0_f2_D11': 'FE0_f2_D11', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f2_C1': 'FE1_f2_C1', 'FE0_f0_D02': 'FE0_f0_D02', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1', 'FE0_f0_D10': 'FE0_f0_D10', 'FE0_f0_D11': 'FE0_f0_D11', 'FE1_f0_C1': 'FE1_f0_C1', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE0_f2_D02': 'FE0_f0_D02', 'FE0_f2_D01': 'FE0_f2_D01', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE0_f2_D20': 'FE0_f0_D20', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE0_f1_D20': 'FE0_f1_D20', 'FE0_f1_D01': 'FE0_f1_D01', 'FE0_f1_D02': 'FE0_f0_D02', 'FE0_f0_D20': 'FE0_f0_D20', 'FE2_f2': 'FE2_f0', 'FE2_f0': 'FE2_f0', 'FE2_f1': 'FE2_f0', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C0': 'FE1_f1_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.4553418012614795, -0.12200846792814618, 0.66666666666666674],
+         [-0.12200846792814624, 0.45534180126147961, 0.66666666666666652]], dtype=object), 'FE0_f1_D10': array([[-2.1547005383792515, -1.0000000000000009, 0.84529946162074754,
+          -0.84529946162074754, 3.1547005383792524],
+         [0.15470053837925191, -1.0000000000000009, 3.1547005383792492,
+          -3.1547005383792492, 0.84529946162074832]], dtype=object), 'FE0_f2_D11': array([[3.9999999999999964, 4.0000000000000053, -4.0000000000000053,
+          -3.9999999999999938],
+         [3.9999999999999973, 4.0000000000000044, -4.0000000000000044,
+          -3.9999999999999938]], dtype=object), 'FE0_f0_D10': array([[1.0000000000000002, 2.1547005383792506, 0.84529946162074754,
+          -0.84529946162074754, -3.1547005383792515],
+         [1.0000000000000009, -0.15470053837925168, 3.1547005383792492,
+          -3.1547005383792492, -0.84529946162074987]], dtype=object), 'FE0_f0_D11': array([[3.9999999999999973, 3.9999999999999978, -3.9999999999999978,
+          -3.9999999999999973],
+         [4.0, 3.9999999999999898, -3.9999999999999898, -4.0000000000000009]], dtype=object), 'FE1_f0_C0': array([[ 0.78867513,  0.21132487],
+         [ 0.21132487,  0.78867513]]), 'FE0_f2_D01': array([[-2.1547005383792506, -0.99999999999999956, 0.84529946162074832,
+          3.1547005383792506, -0.84529946162074854],
+         [0.15470053837925235, -0.99999999999999933, 3.1547005383792497,
+          0.84529946162074876, -3.1547005383792515]], dtype=object), 'FE0_f1_D01': array([[-2.154700538379251, -0.15470053837925157, 2.3094010767585025],
+         [0.15470053837925168, 2.1547005383792515, -2.3094010767585025]], dtype=object), 'FE0_f0_D01': array([[1.0000000000000009, -0.15470053837925146, 3.1547005383792501,
+          -0.84529946162074876, -3.154700538379251],
+         [1.0000000000000007, 2.1547005383792515, 0.84529946162074787,
+          -3.1547005383792515, -0.84529946162074832]], dtype=object), 'FE2_f0': array([[1.0],
+         [1.0]], dtype=object), 'FE0_f0_D02': array([[3.9999999999999978, 3.9999999999999933, -7.9999999999999938],
+         [3.9999999999999982, 3.9999999999999969, -7.9999999999999911]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2, 3]), False, False), 'FE1_f1_C0_D10': ('FE1_f0_C0_D01', (16, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (10, [0, 1, 5]), False, False), 'FE0_f0_D01': ('FE0_f0_D01', (1, [0, 2, 3, 4, 5]), False, False), 'FE1_f0_C1_D01': ('FE1_f0_C0_D01', (18, [3, 5]), False, False), 'FE1_f2_C1_D01': ('FE1_f0_C0_D01', (18, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE1_f0_C0_D01', (19, [3, 4]), False, False), 'FE0_f1_D11': ('FE0_f0_D11', (4, [0, 3, 4, 5]), False, False), 'FE0_f1_D10': ('FE0_f1_D10', (8, [0, 1, 3, 4, 5]), False, False), 'FE0_f2_D10': ('FE0_f1_D01', (12, [0, 1, 5]), False, False), 'FE0_f2_D11': ('FE0_f2_D11', (13, [0, 3, 4, 5]), False, False), 'FE1_f2_C0': ('FE1_f0_C0', (22, [0, 1]), False, False), 'FE1_f2_C1': ('FE1_f0_C0', (23, [3, 4]), False, False), 'FE0_f0_D02': ('FE0_f0_D02', (2, [0, 2, 4]), False, False), 'FE1_f2_C0_D01': ('FE1_f0_C0_D01', (15, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (6, [0, 2, 4]), False, False), 'FE0_f0_D10': ('FE0_f0_D10', (3, [0, 1, 3, 4, 5]), False, False), 'FE0_f0_D11': ('FE0_f0_D11', (4, [0, 3, 4, 5]), False, False), 'FE1_f0_C1': ('FE1_f0_C0', (17, [4, 5]), False, False), 'FE1_f0_C0_D10': ('FE1_f0_C0_D01', (16, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE1_f0_C0_D01', (15, [0, 2]), False, False), 'FE1_f0_C0': ('FE1_f0_C0', (14, [1, 2]), False, False), 'FE0_f2_D02': ('FE0_f0_D02', (2, [0, 2, 4]), False, False), 'FE0_f2_D01': ('FE0_f2_D01', (11, [0, 2, 3, 4, 5]), False, False), 'FE1_f2_C1_D10': ('FE1_f0_C0_D01', (19, [3, 4]), False, False), 'FE0_f2_D20': ('FE0_f0_D02', (5, [0, 1, 5]), False, False), 'FE1_f0_C1_D10': ('FE1_f0_C0_D01', (19, [3, 4]), False, False), 'FE1_f1_C1_D01': ('FE1_f0_C0_D01', (18, [3, 5]), False, False), 'FE1_f2_C0_D10': ('FE1_f0_C0_D01', (16, [0, 1]), False, False), 'FE0_f1_D20': ('FE0_f0_D02', (9, [0, 1, 5]), False, False), 'FE0_f1_D01': ('FE0_f1_D01', (7, [0, 2, 4]), False, False), 'FE0_f1_D02': ('FE0_f0_D02', (2, [0, 2, 4]), False, False), 'FE0_f0_D20': ('FE0_f0_D02', (5, [0, 1, 5]), False, False), 'FE2_f2': ('FE2_f0', (), False, True), 'FE2_f0': ('FE2_f0', (), False, True), 'FE2_f1': ('FE2_f0', (), False, True), 'FE1_f0_C0_D01': ('FE1_f0_C0_D01', (15, [0, 2]), False, False), 'FE1_f1_C1': ('FE1_f0_C0', (21, [3, 5]), False, False), 'FE1_f1_C0': ('FE1_f0_C0', (20, [0, 2]), False, False)}
+  Transforming interior facet integral (0, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (0, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (0, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.00129 seconds
+  Shape of reference tensor: (6, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.586824 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  Optimising expressions for facet integral (0, 0)
+  Optimising expressions for facet integral (0, 1)
+  Optimising expressions for facet integral (0, 2)
+  Optimising expressions for facet integral (1, 0)
+  Optimising expressions for facet integral (1, 1)
+  Optimising expressions for facet integral (1, 2)
+  Optimising expressions for facet integral (2, 0)
+  Optimising expressions for facet integral (2, 1)
+  Optimising expressions for facet integral (2, 2)
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.279453 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 2 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 2 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.164129 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00078392 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Biharmonic.h.
+  
+Compiler stage 5 finished in 0.00114989 seconds.
+
+FFC finished in 1.07811 seconds.
diff --git a/demo/documented/biharmonic/cpp/documentation.rst b/demo/documented/biharmonic/cpp/documentation.rst
new file mode 100644
index 0000000..9ff2386
--- /dev/null
+++ b/demo/documented/biharmonic/cpp/documentation.rst
@@ -0,0 +1,211 @@
+.. Documentation for the biharmonic demo from DOLFIN.
+
+.. _demo_pde_biharmonic_cpp_documentation:
+
+
+Biharmonic equation
+===================
+
+.. include:: ../common.txt
+
+
+Implementation
+--------------
+
+The implementation is split in two files, a form file containing the definition
+of the variational forms expressed in UFL and the solver which is implemented
+in a C++ file.
+
+Running this demo requires the files: :download:`main.cpp`,
+:download:`Biharmonic.ufl` and :download:`CMakeLists.txt`.
+
+UFL form file
+^^^^^^^^^^^^^
+
+First we define the variational problem in UFL in the file called
+:download:`Biharmonic.ufl`.
+
+In the UFL file, the finite element space is defined:
+
+.. code-block:: python
+
+    # Elements
+    element = FiniteElement("Lagrange", triangle, 2)
+
+On the space ``element``, trial and test functions, and the source term
+are defined:
+
+.. code-block:: python
+
+    # Trial and test functions
+    u = TrialFunction(element)
+    v = TestFunction(element)
+    f = Coefficient(element)
+
+Next, the outward unit normal to cell boundaries and a measure of the
+cell size are defined. The average size of cells sharing a facet will
+be used (``h_avg``).  The UFL syntax ``('+')`` and ``('-')`` restricts
+a function to the ``('+')`` and ``('-')`` sides of a facet,
+respectively.  The penalty parameter ``alpha`` is made a
+:cpp:class:`Constant` so that it can be changed in the program without
+regenerating the code.
+
+.. code-block:: python
+
+    # Normal component, mesh size and right-hand side
+    n  = FacetNormal(triangle)
+    h = 2.0*Circumradius(triangle)
+    h_avg = (h('+') + h('-'))/2
+
+    # Parameters
+    alpha = Constant(triangle)
+
+Finally the bilinear and linear forms are defined. Integrals over
+internal facets are indicated by ``*dS``.
+
+.. code-block:: python
+
+    # Bilinear form
+    a = inner(div(grad(u)), div(grad(v)))*dx \
+      - inner(avg(div(grad(u))), jump(grad(v), n))*dS \
+      - inner(jump(grad(u), n), avg(div(grad(v))))*dS \
+      + alpha('+')/h_avg*inner(jump(grad(u), n), jump(grad(v),n))*dS
+
+    # Linear form
+    L = f*v*dx
+
+
+C++ program
+^^^^^^^^^^^
+
+The DOLFIN interface and the code generated from the UFL input is included,
+and the DOLFIN namespace is used:
+
+.. code-block:: c++
+
+  #include <dolfin.h>
+  #include "Biharmonic.h"
+
+  using namespace dolfin;
+
+A class ``Source`` is defined for the function :math:`f`, with the
+function ``Expression::eval`` overloaded:
+
+.. code-block:: c++
+
+  // Source term
+  class Source : public Expression
+  {
+  public:
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+    values[0] = 4.0*std::pow(DOLFIN_PI, 4)*
+      std::sin(DOLFIN_PI*x[0])*std::sin(DOLFIN_PI*x[1]);
+    }
+
+  };
+
+A boundary subdomain is defined, which in this case is the entire boundary:
+
+.. code-block:: c++
+
+  // Sub domain for Dirichlet boundary condition
+  class DirichletBoundary : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return on_boundary;
+    }
+  };
+
+The main part of the program is begun, and a mesh is created with 32 vertices
+in each direction:
+
+.. code-block:: c++
+
+  int main()
+  {
+    // Create mesh
+    UnitSquareMesh mesh(32, 32);
+
+
+The source function, a function for the cell size and the penalty term
+are declared:
+
+.. code-block:: c++
+
+    // Create functions
+    Source f;
+    Constant alpha(8.0);
+
+A function space object, which is defined in the generated code, is created:
+
+.. code-block:: c++
+
+    // Create function space
+    Biharmonic::FunctionSpace V(mesh);
+
+The Dirichlet boundary condition on :math:`u` is constructed by
+defining a :cpp:class:`Constant` which is equal to zero, defining the boundary
+(``DirichletBoundary``), and using these, together with ``V``, to create
+``bc``:
+
+.. code-block:: c++
+
+    // Define boundary condition
+    Constant u0(0.0);
+    DirichletBoundary boundary;
+    DirichletBC bc(V, u0, boundary);
+
+Using the function space ``V``, the bilinear and linear forms
+are created, and function are attached:
+
+.. code-block:: c++
+
+    // Define variational problem
+    Biharmonic::BilinearForm a(V, V);
+    Biharmonic::LinearForm L(V);
+    a.alpha = alpha; L.f = f;
+
+A :cpp:class:`Function` is created to hold the solution and the
+problem is solved:
+
+.. code-block:: c++
+
+    // Compute solution
+    Function u(V);
+    solve(a == L, u, bc);
+
+The solution is then written to a file in VTK format and plotted to
+the screen:
+
+.. code-block:: c++
+
+    // Save solution in VTK format
+    File file("biharmonic.pvd");
+    file << u;
+
+    // Plot solution
+    plot(u);
+    interactive();
+
+    return 0;
+  }
+
+Complete code
+-------------
+
+Complete UFL file
+^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: Biharmonic.ufl
+   :start-after: # Compile
+   :language: python
+
+Complete main file
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: main.cpp
+   :start-after: // using
+   :language: c++
diff --git a/demo/documented/biharmonic/cpp/main.cpp b/demo/documented/biharmonic/cpp/main.cpp
new file mode 100644
index 0000000..a4aa7f1
--- /dev/null
+++ b/demo/documented/biharmonic/cpp/main.cpp
@@ -0,0 +1,100 @@
+// Copyright (C) 2009 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011
+//
+// First added:  2009-06-26
+// Last changed: 2012-11-12
+//
+// This demo program solves the Biharmonic equation,
+//
+//     - nabla^4 u(x, y) = f(x, y)
+//
+// on the unit square with source f given by
+//
+//     f(x, y) = 4 pi^4 sin(pi*x)*sin(pi*y)
+//
+// and boundary conditions given by
+//
+//     u(x, y)         = 0
+//     nabla^2 u(x, y) = 0
+//
+// using a discontinuous Galerkin formulation (interior penalty method).
+
+#include <dolfin.h>
+#include "Biharmonic.h"
+
+using namespace dolfin;
+
+// Source term
+class Source : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = 4.0*std::pow(DOLFIN_PI, 4)*
+      std::sin(DOLFIN_PI*x[0])*std::sin(DOLFIN_PI*x[1]);
+  }
+
+};
+
+// Sub domain for Dirichlet boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return on_boundary;
+  }
+};
+
+int main()
+{
+  // Create mesh
+  UnitSquareMesh mesh(32, 32);
+
+  // Create functions
+  Source f;
+  Constant alpha(8.0);
+
+  // Create function space
+  Biharmonic::FunctionSpace V(mesh);
+
+  // Define boundary condition
+  Constant u0(0.0);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, u0, boundary);
+
+  // Define variational problem
+  Biharmonic::BilinearForm a(V, V);
+  Biharmonic::LinearForm L(V);
+  a.alpha = alpha; L.f = f;
+
+  // Compute solution
+  Function u(V);
+  solve(a == L, u, bc);
+
+  // Save solution in VTK format
+  File file("biharmonic.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/biharmonic/python/demo_biharmonic.py b/demo/documented/biharmonic/python/demo_biharmonic.py
new file mode 100644
index 0000000..4011833
--- /dev/null
+++ b/demo/documented/biharmonic/python/demo_biharmonic.py
@@ -0,0 +1,95 @@
+"""This demo program solves the Biharmonic equation,
+
+    nabla^4 u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+    f(x, y) = 4 pi^4 sin(pi*x)*sin(pi*y)
+
+and boundary conditions given by
+
+    u(x, y)         = 0
+    nabla^2 u(x, y) = 0
+
+using a discontinuous Galerkin formulation (interior penalty method).
+"""
+
+# Copyright (C) 2009 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2011
+#
+# First added:  2009-06-26
+# Last changed: 2012-11-12
+
+# Begin demo
+
+from dolfin import *
+
+# Optimization options for the form compiler
+parameters["form_compiler"]["cpp_optimize"] = True
+parameters["form_compiler"]["optimize"] = True
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(32, 32)
+V = FunctionSpace(mesh, "CG", 2)
+
+# Define Dirichlet boundary
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary
+
+class Source(Expression):
+    def eval(self, values, x):
+        values[0] = 4.0*pi**4*sin(pi*x[0])*sin(pi*x[1])
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, DirichletBoundary())
+
+# Define trial and test functions
+u = TrialFunction(V)
+v = TestFunction(V)
+
+# Define normal component, mesh size and right-hand side
+h = CellSize(mesh)
+h_avg = (h('+') + h('-'))/2.0
+n = FacetNormal(mesh)
+f = Source()
+
+# Penalty parameter
+alpha = Constant(8.0)
+
+# Define bilinear form
+a = inner(div(grad(u)), div(grad(v)))*dx \
+  - inner(avg(div(grad(u))), jump(grad(v), n))*dS \
+  - inner(jump(grad(u), n), avg(div(grad(v))))*dS \
+  + alpha('+')/h_avg*inner(jump(grad(u),n), jump(grad(v),n))*dS
+
+# Define linear form
+L = f*v*dx
+
+# Solve variational problem
+u = Function(V)
+solve(a == L, u, bc)
+
+# Save solution to file
+file = File("biharmonic.pvd")
+file << u
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/documented/biharmonic/python/documentation.rst b/demo/documented/biharmonic/python/documentation.rst
new file mode 100644
index 0000000..20621eb
--- /dev/null
+++ b/demo/documented/biharmonic/python/documentation.rst
@@ -0,0 +1,138 @@
+.. Documentation for the biharmonic demo from DOLFIN.
+
+.. _demo_pde_biharmonic_python_documentation:
+
+Biharmonic equation
+===================
+
+This demo is implemented in a single Python file,
+:download:`demo_biharmonic.py`, which contains both the variational
+forms and the solver.
+
+.. include:: ../common.txt
+
+
+Implementation
+--------------
+
+This demo is implemented in the :download:`demo_biharmonic.py` file.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+Next, some parameters for the form compiler are set:
+
+.. code-block:: python
+
+    # Optimization options for the form compiler
+    parameters["form_compiler"]["cpp_optimize"] = True
+    parameters["form_compiler"]["optimize"] = True
+
+A mesh is created, and a quadratic finite element function space:
+
+.. code-block:: python
+
+    # Create mesh and define function space
+    mesh = UnitSquareMesh(32, 32)
+    V = FunctionSpace(mesh, "CG", 2)
+
+A subclass of :py:class:`SubDomain <dolfin.cpp.SubDomain>`,
+``DirichletBoundary`` is created for later defining the boundary of
+the domian:
+
+.. code-block:: python
+
+    # Define Dirichlet boundary
+    class DirichletBoundary(SubDomain):
+        def inside(self, x, on_boundary):
+            return on_boundary
+
+A subclass of :py:class:`Expression
+<dolfin.functions.expression.Expression>`, ``Source`` is created for
+the source term :math:`f`:
+
+.. code-block:: python
+
+    class Source(Expression):
+        def eval(self, values, x):
+            values[0] = 4.0*pi**4*sin(pi*x[0])*sin(pi*x[1])
+
+The Dirichlet boundary condition is created:
+
+.. code-block:: python
+
+    # Define boundary condition
+    u0 = Constant(0.0)
+    bc = DirichletBC(V, u0, DirichletBoundary())
+
+On the finite element space ``V``, trial and test functions are created:
+
+.. code-block:: python
+
+    # Define trial and test functions
+    u = TrialFunction(V)
+    v = TestFunction(V)
+
+A function for the cell size :math:`h` is created, as is a function
+for the average size of cells that share a facet (``h_avg``).  The UFL
+syntax ``('+')`` and ``('-')`` restricts a function to the ``('+')``
+and ``('-')`` sides of a facet, respectively. The unit outward normal
+to cell boundaries (``n``) is created, as is the source term ``f`` and
+the penalty parameter ``alpha``. The penalty parameters is made a
+:py:class:`Constant <dolfin.functions.constant.Constant>` so that it
+can be changed without needing to regenerate code.
+
+.. code-block:: python
+
+    # Define normal component, mesh size and right-hand side
+    h = CellSize(mesh)
+    h_avg = (h('+') + h('-'))/2.0
+    n = FacetNormal(mesh)
+    f = Source()
+
+    # Penalty parameter
+    alpha = Constant(8.0)
+
+The bilinear and linear forms are defined:
+
+.. code-block:: python
+
+    # Define bilinear form
+    a = inner(div(grad(u)), div(grad(v)))*dx \
+      - inner(avg(div(grad(u))), jump(grad(v), n))*dS \
+      - inner(jump(grad(u), n), avg(div(grad(v))))*dS \
+      + alpha('+')/h_avg*inner(jump(grad(u),n), jump(grad(v),n))*dS
+
+    # Define linear form
+    L = f*v*dx
+
+A :py:class:`Function <dolfin.functions.function.Function>` is created
+to store the solution and the variational problem is solved:
+
+.. code-block:: python
+
+    # Solve variational problem
+    u = Function(V)
+    solve(a == L, u, bc)
+
+The computed solution is written to a file in VTK format and plotted to
+the screen.
+
+.. code-block:: python
+
+    # Save solution to file
+    file = File("biharmonic.pvd")
+    file << u
+
+    # Plot solution
+    plot(u, interactive=True)
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_biharmonic.py
+   :start-after: # Begin demo
diff --git a/demo/documented/built-in_meshes/common.txt b/demo/documented/built-in_meshes/common.txt
new file mode 100644
index 0000000..3acc9a6
--- /dev/null
+++ b/demo/documented/built-in_meshes/common.txt
@@ -0,0 +1,16 @@
+This demo illustrates:
+
+* How to define some of the different built-in meshes in DOLFIN
+
+Problem definition
+------------------
+
+The demo focuses on the built-in meshes. We will look at the following
+meshes:
+
+* :py:class:`UnitIntervalMesh <dolfin.cpp.mesh.UnitIntervalMesh>`
+* :py:class:`UnitSquareMesh <dolfin.cpp.mesh.UnitSquareMesh>`
+* :py:class:`RectangleMesh <dolfin.cpp.mesh.RectangleMesh>`
+* :py:class:`UnitCircleMesh <dolfin.cpp.mesh.UnitCircleMesh>`
+* :py:class:`UnitCubeMesh <dolfin.cpp.mesh.UnitCubeMesh>`
+* :py:class:`BoxMesh <dolfin.cpp.mesh.BoxMesh>`
diff --git a/demo/documented/built-in_meshes/cpp/CMakeLists.txt b/demo/documented/built-in_meshes/cpp/CMakeLists.txt
new file mode 100644
index 0000000..eefd75d
--- /dev/null
+++ b/demo/documented/built-in_meshes/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_built-in_meshes)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/built-in_meshes/cpp/documentation.rst b/demo/documented/built-in_meshes/cpp/documentation.rst
new file mode 100644
index 0000000..baea088
--- /dev/null
+++ b/demo/documented/built-in_meshes/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the built-in_meshes demo from DOLFIN.
+
+.. _demo_pde_built-in_meshes_python_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/built-in_meshes/cpp/main.cpp b/demo/documented/built-in_meshes/cpp/main.cpp
new file mode 100644
index 0000000..295fc82
--- /dev/null
+++ b/demo/documented/built-in_meshes/cpp/main.cpp
@@ -0,0 +1,94 @@
+// Copyright (C) 2009 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-29
+// Last changed: 2012-12-12
+//
+// This demo illustrates the built-in mesh types.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  if (dolfin::MPI::size(MPI_COMM_WORLD) == 1)
+  {
+    UnitIntervalMesh interval(10);
+    info("Plotting a UnitIntervalMesh");
+    plot(interval, "Unit interval");
+  }
+
+  UnitSquareMesh square_default(10, 10);
+  info("Plotting a UnitSquareMesh");
+  plot(square_default, "Unit square");
+
+  UnitSquareMesh square_left(10, 10, "left");
+  info("Plotting a UnitSquareMesh");
+  plot(square_left, "Unit square (left)");
+
+  UnitSquareMesh square_crossed(10, 10, "crossed");
+  info("Plotting a UnitSquareMesh");
+  plot(square_crossed, "Unit square (crossed)");
+
+  UnitSquareMesh square_right_left(10, 10, "right/left");
+  info("Plotting a UnitSquareMesh");
+  plot(square_right_left, "Unit square (right/left)");
+
+  RectangleMesh rectangle_default(0.0, 0.0, 10.0, 4.0, 10, 10);
+  info("Plotting a RectangleMesh");
+  plot(rectangle_default, "Rectangle");
+
+  RectangleMesh rectangle_right_left(-3.0, 2.0, 7.0, 6.0, 10, 10, "right/left");
+  info("Plotting a RectangleMesh");
+  plot(rectangle_right_left, "Rectangle (right/left)");
+
+  #ifdef HAS_CGAL
+  CircleMesh circle_mesh(Point(0.0, 0.0), 1.0, 0.2);
+  info("Plotting a CircleMesh");
+  plot(circle_mesh, "Circle (unstructured)");
+
+  std::vector<double> ellipse_dims(2);
+  ellipse_dims[0] = 3.0; ellipse_dims[1] = 1.0;
+  EllipseMesh ellipse_mesh(Point(0.0, 0.0), ellipse_dims, 0.2);
+  info("Plotting an EllipseMesh");
+  plot(ellipse_mesh, "Ellipse mesh (unstructured)");
+
+  SphereMesh sphere_mesh(Point(0.0, 0.0, 0.0), 1.0, 0.2);
+  info("Plotting a SphereMesh");
+  plot(sphere_mesh, "Sphere mesh (unstructured)");
+
+  std::vector<double> ellipsoid_dims(3);
+  ellipsoid_dims[0] = 3.0; ellipsoid_dims[1] = 1.0; ellipsoid_dims[2] = 2.0;
+  EllipsoidMesh ellipsoid_mesh(Point(0.0, 0.0, 0.0), ellipsoid_dims, 0.2);
+  info("Plotting an EllipsoidMesh");
+  plot(ellipsoid_mesh, "Ellipsoid mesh (unstructured)");
+  #endif
+
+
+  UnitCubeMesh cube(10, 10, 10);
+  info("Plotting a UnitCubeMesh");
+  plot(cube, "Unit cube");
+
+  BoxMesh box(0.0, 0.0, 0.0, 10.0, 4.0, 2.0, 10, 10, 10);
+  info("Plotting a BoxMesh");
+  plot(box, "Box");
+
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/built-in_meshes/python/boxmesh.png b/demo/documented/built-in_meshes/python/boxmesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..335a51a1218057200241a4873c21465b5c849b55
GIT binary patch
literal 7418
zcmeI1`#;nF|Nm`S(Q<yZ6r$u+F(KuANTgDsnDa3?<TNJd({e1w4o*cxA;g4P!x+WN
zFmf!$(59NhnA03TPrX0i?;r8~zJJ?gm*;bPJ|B<U{dT+F?~li(##i|c9y`dz#l?61
zn!z0|F0d6B7w8EO82Dz}@-c;rOT6{Efu4Ct-W+u_s6s;+Vj5w%yQ|PB`7A`lH!IFa
za5ztZ>VEp+c@?+Y!Yb)AY<18ji(UI|E-so;j39b|`vg}R?`5t#B5_=A|K$N)yCn#I
z@=}Uh>Y^UcCC~p}@c-&MY)%Xc&|I{Sr&maVS-0~kGlK$?%DioY`^;D?9inEp@d9U5
zONvn2ayrMKpGlG8anUZIRGV&v>1(;|N*LiOXH;Jop{V3r`_{5jxF>n+rxmXc7v-T|
zkRvT4bV^CnixE2Ab#cOR9~$aolg;`(I?tAlA?PKc&|fjJ9x*I%Cf}5M0Y|np549^B
zg+;%SUAiUc@Z0{Rn;IKotWGbnzEX=mA{Zw<TTC6MSo*JjcW>VNiIyai{OftYlth6N
zgLgk7-SyVDJKia*xs_oCbqiW{mR3GF&>h4gS)<SC42sv}zp5GGl`UJID+wr)iDfn_
z*TnLZ%sPp#vR1`GHfCs6eJi%(j0ZN4F&(iYGW;V#58{S5J)xx~`|h^BENy>D5s$u6
z4j&&NbjtImg(s%5f8W8*a;}v3tdq%yb?n_cuPj{CL#PaIh0Nw7uVf@wTo%(4EuJ+%
zDye*%BSb|QOV|`6@tDkvyx@Yfs*d$6*1#AzKROP%`yOxPj91dUvnI>Dn7v>>L%vmt
zYfn5g#nX0U>t*V%j{z;(rSk|cEAFgA@sS)kd8bSUtoqgunBwKhgd9lIK0P(70myx6
zTOuJaNIfo9eL4O2OdT3QuS45i5$xDFDiyi2Rm<k3@wtO?aY$mJBh(6E3>~qXf7|}q
z=%?z%^S5FYe^BBTF|X9_!B{KDIgPbw8Rq?*ucLOW7RdwWDj@G=OCfLL(oN!Wf**1b
z)SRyN3K_mgk7+hkY2I;Jq<lYlb#uK{ePv_jfLy3*V02ymGgQ1xn&r}}f{E`nXZ$1C
z1N5FP>(I*X)IWn`3OZt}+2y`Lf-GCoxE98`m$?+VezUN<mGVkIZaG<o=S|nzwDR<(
zOuy_*sX#d+X+H&Qk*TR$Y<Z_@8cx$wuLa(%*$pIJ?ww`3b*g5HeU!y3#{iUvVK;Ji
zn=iWA(Ccf_K8P-`Z<g(Xe}M*6G~?zcH&8UcQ2#Phzhg-uODYBXA~e~~PJU^lR#jJP
zjhJSk#z;yzNAJO*^^z~ZHQz&KLl(ajoz`4;CZQbDcNa^~aYtHu_-j)!(GB-5yp(DZ
zl6TTSEbruu@4ntRPwxQkE4pfJ*(|3`P56DV>KLDYliWh|wJ%<vGA)=qZPd0_eQ((u
zoRC)wOi%+s@}zA49?Phmf1;2wW_q9eOU4!x9>6Vai|g$;{edN8;|UimBSyi#Rh$U?
z3jGR6bA(eV=Xjlcd};kiL<>L9kJcMJZJQyh5~-XVYvPiuduMmLE>>VEp%y(;A&yb>
zUGnzNVjZnT=ZdWazC!!I))WNvjKBPTRB<J-8*CvT6$PvQld_dxizehiX02Si4EqcP
z4bQHJ5r@T!C{ABUb!cW`^^YsZ%FX-0K^dixF%J0~u4PoQT_`Tw%I*ZUbyCykrRQb3
zlZ@GS$YP{>;e7SAxf&Z{ISP>C{cGHwpk0`rC^OhmbP#N8yD(Q_Lrh5W5eOuHcK-DD
zGG1Gv@Vt&vj+FRxBV-n<FKOasuL%`ZA`Pt)d(6x1E&l5COC?X6DP=fbakQnXtKH-k
z#M|nW$5gemwY(ETU7i*pf!Y1WwkIF>qrV<@Nh)Sv5VwSLUMjos$Ef0Am4o5Y)%Y*t
z-ghz9#8_b&#6j{(Im&LntAEhccYE{^jJ3E4J-A_EjZwd=790Q%-XH`<-gsY;r(lT^
zD;ZvB$?^-6Fc9ppnH{1B7rc8Z=P71}=fIs1__SJdI6cNNUz!m-ENAyV;3wS4v@jIk
zE8IV1c*VDGOK{Pi@f&(Ambc9c8(g3W6(wBzR3oVfRZA~UL#UAD|Lr=-Pm6YkRW}Vy
zmkw<iH>DSdy)+!8C#$y!CTru??|NV$KR@X3z;&Im$E5>_X|JW5#=XOwI2CQm6S$f3
zc(Y^fo!DDeLs?$$zM0OixX-wu(>h;$f3k$4ixjwbN-Wq5(LGDwc~vxJq`>Ot5-Bsw
zAzG!;l4XCkc;(7@+Js=?s~q*VsfLMNA&m`HHzOobi=Ojz<{Y~bNe;x+IIz*YwPh2@
zcka+Rhv2wc2L1H=V`+!;PV+3Z!)c6@K37NU*=U9|1zU^WvpsQbXO-0MmiyS-k^M8Y
zn^&MAA~CEmjNIoQNxKAlt~;BilsdG#VS&-k`_+eoS<G)^E%wfPju-6*75#7<NimNy
zy3xwyZ6j~z9@kYCaEKE3*16l!4bHcF>--%gO|c;|P%h=4eFkXChkHcgZYLo>J@^w*
zz1r)zlpRjy&xgD(g3MlnhLn8%C#Ymf<)%OPq-jeqonL4@$jD_;$NOW)z4A~2RdLt<
zSYtP0#}w)@<)^48>g6w1LUK7a22N11%1zFY^xEHL<_W6kyblsHf)9y*2t+BploF>6
z!)XgI>XWv^iN7Xt&Jxb0v*xA<cc-1S_nxefAtXu#>sUylD$lMVk+8sF;kd$PTcR@V
zds8%2wBgHmO*qAI0_KMVE>A%9zq{Q#th+k~r`2hw@qAH=Xt&|PIfGCBwbqW%n+wLj
zRFIzrdchXA$laKik8>bes#fMU^B*>50{|(vPa~rmesr!>)>zNqFwI;^{zg!?Z8<|F
z1KUpMJRBUg%dp6EI3NUMCSUOTX5-&X9C9dV$;u+Uj^GJn@gIp<1<Jse2&XX%gud2Q
ztzWN2Bcn&k#@23NKQ_%Xv-e+nbMzSB?ZCCi-*pMFC!~(oeN!S9K(QvIu?*94pH1tY
zv8(^Nj4vE}(OR^GVzU<+I<J4q=CBcI<n~nYb3<A_KG#S|GA5Q2Gb|sIAQZ{U``Q|+
zr9!Keo>-<4(U!D7#xIV6%rFT&;bEHDmU-dkN0p3#6CV1R?S?B7(qp4fK>Ab4Y~WR6
zF8g!qg<N%EjO<tVR_&er#s>in8AsHj3q{;==^f_ydoaIkb~D1Q4vmxI!Kmu~?gtxJ
z#NKAB`#VENl3~@BnZ2p9>SpQ_35WBe9uso~<5U;7TOTv_S9pGZF7GtwTvQJ^L=ZFw
z64Cc&<_#O-FLq(~#Icno0U*EElV%p=-j;4a+kTW_du}cadwPL#?}Hk%b5V7G?l-am
z)*h?H_`Rz%F*0BH;l6=iDmLr^dxD^3Kt1JSr4aZ`Z0w#3*lI4fz^aEhX9>?#vtiZc
zd9dojBp8c{Iq3DZ-6O^?XTh3Swj(!VV*I;Zz6L+LxIfSvw3b%*AK6FTfqonx#iFC1
z{zr(@w?Fh3AVIOPGW+^)=*Q4gsUAH;@pWjv_yjB(v)k+nUC%dYijzuN3c1;j8C4uS
zr+F*-Ed<UX>uNyN9A^M?H@lamVAQqCISMQR(&SmP%X(FxpzkMc1HV19Nnsy@%C{(C
zBE^?R)Ocp253Egj280R64TsNdASAu5>^}N8%`Ohu037w{F<%<_uk$!+SXgH>R~}?$
z=jtZ*i6O87S=l*J$Qx@Yl7bNiRa?qbm!RJLJwXrD(G$HT*zrfLdDqenG+Mu2ZcQXB
zaHpyf?EyU)wBK+84U6Q>kO!O2kjc!OB8DPyN8V8@pWE?-F<SHB!4Y~9*(hlRZi%4E
z?z?X^bOK#^%scX;4!4{UE2zGENKftZC@<B=mRLpt5w=7J=&Y~;m|`13o+fi7CTL8O
z|9JHB@tx5Ym>*WSP%TEPX*|raB^22IcW=kmVbvIOd8akuexOjFANF$i2j|=X(F>8r
z`GA1f%<KoNnBxcCLDH+N?v{TZs-ECMPN~200C`Q|zPf`pzk&15DpB7+#Fe2R&$th;
zb-0}~YA|sjguvr1yLe^<)Cy%P=Jx{Fef(ICY?%#FStfx{81d+2nv}R_pjb)Lb^{qs
zTg?4W_Kld{P0}?}59w%Fn4B3mZA3;-yjRHq;ANyxGX4I_i9*%JO&I`n04V~Mz)1n@
z<<-7bmNGp}0P@$g7~wG1jM(tFLT@p!`Lzt$T>4OM3B+6O$R8IQ;`C#jmpe%8OA~++
zR>?5GF1XXznrH$fVmtT&bbTEk-+LO1?i0g?-dzrM2i+JFd9ZQv2+42lvEaN8=zn!`
zUJODdY<`}?@tu~zy1$o+{@(OVAQy6|yrxPG1<>S#KO!x9gkUs*av3*ellKoDc)0SR
zZKbFWSeR#^ROQ&?q<&Pgt{jJ~Og|{u^%X^}c)u5qF=;xvlmD2@Ja_{Dx<libe`edn
zkOgm~z6886_{{o263Iojz_#$ARLWpvgf0b6+n8}V$IbT&Dn0?;?=vu-uq?l<RExev
z-f3*ADn50QdlJ$UabOJ)fQoL;b9zzY(tbxCjnrcvsiW_vPxO}c?{AK5&@iOsoakM0
zm0Zal_Rp6RpH$<FZ?A6ZF4du_q#=OqAGHWRIH=|_BBumF4z#}LWF`^}_0ri3G=a_=
z8Sn4igsO#aQrO6CTQG0iX1RuocJ#U&64Xcm!*mkP0YJ_tQ=(}P>34;(<_fUdFK$t~
zm?o~{uH2Jz7xF&jtAod@|7KW?(ejH<ZD4EizYQgBWJCu`@gPsl!CwQuVN}0I%)eC4
z=XACj-(<!Bp0_~T)XoTkRZGj$zRIfG5_@IC>0P_jM5&Y-4)t1v<hc?OZsN`!m;uov
z{2W$Y^4aVAGq~JY+}bO#ik7mFcNrpaAA*`?SwLri`szUv`5B0Pv~Od>*$YU(o05HC
z<3x_OlfVL^%K5v4NeNOs^<SREFs+jNVLeL=`vBOJ17pz$M3Jf|@kQs>M}ou5gb(0N
zp-)4z1>;=cHbm+g=|C5_IgJ)s;hhCkkfrsOqOX>dzxi%JEjqgnt$^}B6kNcgv<aim
zTo40OxA^Ce?(vVm;0W-MV~Nysx+)lVVl0985e+TT+Ut?w-s+PB+ntRPE9owKt&Dv8
z>;pFKbS1N1y{NNc3@ythYjk*jvCB>(nG7$AJNsnfHd!xFe3)>3{Hr6yESl8zUEa1c
zh0>d(VZZ1RxRb$S0;=C)BM5W805WS^_49Hs`*6j%Hcz=>EdWC2x8P3K@%`+K1qICX
zDF7Ih`NOFR)vGuO@)gH!wHCMY^C?q+`m}!y%oIzP!=u8Zm^zHhz4cc=@-$(19^h|Y
z&<i2d*se$Il5%*obgF~kb>~!RmwTUbR3ksTgP<lYJ>D*Z$=~cey5e6WlHZT-I3{aH
z?LM~xLh=`kMH6VqVCvM@I|SI_fE#5zK-1+96f8#pD{2aWu1{mTFu~bweuwlz%n+p4
z4z)UFtcQUC-N0_ks@?}tvd>umrL^QOxXq<=fRtwVYtjDM?>s=1jGR05=xN{yYFE3+
z+h$W|!3&oJ$4P7&mlESiDa5;~2m*)SuE~E+_jG)uEbsIwS;y9bdpurB{0~e2@~ETl
zYl!z5;6F^ve>?czgIYDO)2xZpt~cg&^u&Smbh6y>1mQ@Ab?9!upZdVCEZ|XqeNcWB
z>kbMh1o?jY=c-_bMiXEEYIa(}@g;}BDI4PNQvGjWm5iK(I&^rtZV^OFEyz&~DvJB^
z)s;N&V&vZJb>VYQc15J_AZ22rRok}53l!>|5`R46>>CAY+8b$cmp*XR0y(+1$-(k~
zcuM7~vZZ=E(|~&Gs_@J!_!Z7tfiGxAE>E{0(w5l0vMg(<1`VmPn>*=4kJ?$9sQcpZ
zsq~1rzF>k)4>)SBzhaA7i^&$Z(rhkW1zc&o-e0Vy>O7_Gmo@QY>!0bxuaB&WxHqq(
zU18Nh3!aU~ez})9B6r(QTt1lQ>~SGZA?3jTfjZ@>mL2!G>t7j8eT(Z|FVqv-`q~`&
zMM?V3)CzC@xz$QxRjWu-SNjUG4r{fzKp;mo`kU_pE_YMk2R~iP43UYakL%bo<rrzY
z&h%xCM^a5h&SYA5YY|94w2vLYMqy+N-@Il*^<oXv*P=q2?OOYS)^J#a=hfX~M&|OG
zZch_jb0<=gD`p(rzjR#F2cX0?IO`0xU4Z{RAuOAK0(1~N>tk+^*$q?lfU(wb-3s5)
z`q85`E_;}9Hb>Pl*D-sTw-un3xOsWnR3bH<5l+4H<f)Ko!)+OPC)3P%`Z4}(pW&Pg
zb8GmWl^@h5$krUTDcLnaI1Z=6AU5C`AARrF0>KvwWUGwPPyhlt0xaBgjlHz#ti8VA
z_(0A+X4sx^h0TUw)s+T=HL3*=?}{ZGQUm0ta16_#4jozH0fGW%dm8Zk){uJ`uUE}g
zF;Am`AWqb1G7p>Hd=A(w0)TwP{yKD@S(ppsY-2%CM#S4BB_ML9>^T!7Uzh=Lg&&km
zl1(~Wu0u!4jIvQKCCmFSl*O88@_*bk5Z4QNIGlJ7h*%{RVJf(1m!l-~4l;YE_y(Sm
z3lUdY+G4whwL;gEu!5Sw1y*_emB>#&v1l!oj?2`@DPawuxss=ODL9U$l!YFdhzN%_
z6c0xSAGI2lTaz8=YZ_x1u3$M2+Og<d=B$o5E`(q8K*(q(f!f%RAvcjo$?y{Esgzv{
z*U#^7N$)}iKRotXiF=Z3bnP|IdABz2+OetAdWdEf&x2{ic7bUCmGp;Z$f-xS#gvQJ
zfXHhXU`(7n{|V@t#cI)JBi7?UBNvGOU1Uv6qfFe@cZg@`&N>wT0hF=dj>iV;&9Eju
z4~PRCIN<*}tlm{o_uxO_CZj$%<^Oi|)IE-`MW5E}TQT&>V%D6<JrdIsJx=KK$1`LR
z06iLBoVDkp_so7mC_nO%=_Dgo-yr#+$z<l=7UaWJ!lhCgZ*4a!xqusCebXmM5<=BN
z1;Q;aS`JuL1ubKKDy(H)gj!jhqrLj5jk_Ei!%{e^=v;qJl>?_emZg%h5*rn(f_qaR
z@c6%&!`cy#q5#Be``XNUZJVTcez$~{DtjLkTfQu>%IJ-*DUciM#-cZyhp<gn3BY`D
zX#ay7Ow@B2%K*@)9gjw(aqjreA}4#Db{`X_NV*cWGmYQi1<FAaXaS8+%+!y{{44Kt
z>+!P{yAg1Q{GG;GttUN>5p}p{AbBYu(DVu0X`%A87k`r!Q0QLiliRN*XU5H4qgZk`
zY<|XaPu|ihEr{y{47v|&fjIgdJan9*3$WOlvh<(%HegmU8yV!c_@V8)jI-nJ%${^?
zh_NQeH^0rPX|!2w>Wfdv(-u_qT{55Hu97BS5m3xzo`$CTN9g>9dYV~cik25@AbAQq
zLCE{QAl2+Yh$=sT3h+O0*KP4Dy}y*Ci~G1IL&ySO6Xxlp=aP{XDS42H!!LJ%UWn9l
z;DU6*G{3{sv;c1z%qGX0SWaO609<<_KRP$#rp>PRa3A%wsJ>tt>loPHz$x#kW$Vor
zz#8sU7Y@FYSGv`hzDvQP3m%;KH31A`-qoyU`4DKLF@9*dJ@f#u@_wn<uZx0VP4#I)
zzb^N-xgN+1;!c%;Ta1{xvgbt%fZn~?t-0l-A93xJ{RntJ!aB||d+|f8Y;KG8dhC+0
zj2r+Q+pCi;gW%)Jei{iChWa1*L<CzwnlWjLJ-Nw+!{x?Cux@Ki@>p6$MuwM%NIIn~
z{FWe0<skcFL1@E4$(w6@p^ev^+v{ap6!wLhRaHXlFszSbFZjN1&NbLElb0CPG!Y9I
z0DAjy&PmDurv9um(g)Pxs{=&Xz}M4n|AelifqtyN-aFLT)%j~E;CSc!*IR4R2li?Q
ziElX%wW`^-H@!Ww+hk1)h+lQcoS8)aHWAzb*$~-?hU~^rXvo+2*9ZJJmE@f`{|<*|
z3O#(o+a@PLk?;gHn*X+)#{kq0Ojk#lZ#|XdEmuYvNpBJ^otCH3fx$(*WjBz{mcJe5
zf%W|TSt+t>@KQW|D(EdoLwX`**M``B`h7%Nlp@fV*bvVFZRlnbkUwSRr~)PEy2iy>
zTi4sh&=5(TtD<)oynUJTBI$#NzwzZ~lJoOYP3IS~Dk|UEdE>WT+8CY^)%w49-eer|
zjhN%OV4fV;5-ZF@bxLH)NrEL<5X5~TCP+BvV>>$H7Pr;u85L)O#S=>o0k0zDu=xRI
z3Vfwm&7&oxmLMf=2z>|KdRQnb7P!gg5<SDL>V<*$C&Zf*Zovhj5yv%vQ-o;T*z(of
zQ}pIeU>+(McRQ~W6sc|pj4HU^t^(%}TwGPB{(JKD|LX}Hc6XnKBFLeb>QMxoX>wh^
MVr)=#*(v6K0L*;69RL6T

literal 0
HcmV?d00001

diff --git a/demo/documented/built-in_meshes/python/demo_built-in.py b/demo/documented/built-in_meshes/python/demo_built-in.py
new file mode 100644
index 0000000..fc6dca7
--- /dev/null
+++ b/demo/documented/built-in_meshes/python/demo_built-in.py
@@ -0,0 +1,82 @@
+"""This demo illustrates the built-in mesh types."""
+
+# Copyright (C) 2008 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+# Modified by Benjamin Kehlet 2012
+#
+# First added:  2008-07-11
+# Last changed: 2012-11-12
+# Begin demo
+
+from dolfin import *
+
+mesh = UnitIntervalMesh(10)
+print "Plotting a UnitIntervalMesh"
+plot(mesh, title="Unit interval")
+
+mesh = UnitSquareMesh(10, 10)
+print "Plotting a UnitSquareMesh"
+plot(mesh, title="Unit square")
+
+mesh = UnitSquareMesh(10, 10, "left")
+print "Plotting a UnitSquareMesh"
+plot(mesh, title="Unit square (left)")
+
+mesh = UnitSquareMesh(10, 10, "crossed")
+print "Plotting a UnitSquareMesh"
+plot(mesh, title="Unit square (crossed)")
+
+mesh = UnitSquareMesh(10, 10, "right/left")
+print "Plotting a UnitSquareMesh"
+plot(mesh, title="Unit square (right/left)")
+
+mesh = RectangleMesh(0.0, 0.0, 10.0, 4.0, 10, 10)
+print "Plotting a RectangleMesh"
+plot(mesh, title="Rectangle")
+
+mesh = RectangleMesh(-3.0, 2.0, 7.0, 6.0, 10, 10, "right/left")
+print "Plotting a RectangleMesh"
+plot(mesh, title="Rectangle (right/left)")
+
+if has_cgal():
+    mesh = CircleMesh(Point(0.0, 0.0), 1.0, 0.2)
+    print "Plotting a CircleMesh"
+    plot(mesh, title="Circle (unstructured)")
+
+    mesh = EllipseMesh(Point(0.0, 0.0), [3.0, 1.0], 0.2)
+    print "Plotting an EllipseMesh"
+    plot(mesh, title="Ellipse mesh (unstructured)")
+
+    mesh = SphereMesh(Point(0.0, 0.0, 0.0), 1.0, 0.2)
+    print "Plotting a SphereMesh"
+    plot(mesh, title="Sphere mesh (unstructured)")
+
+    mesh = EllipsoidMesh(Point(0.0, 0.0, 0.0), [3.0, 1.0, 2.0], 0.2)
+    print "Plotting an EllipsoidMesh"
+    plot(mesh, title="Ellipsoid mesh (unstructured)")
+
+mesh = UnitCubeMesh(10, 10, 10)
+print "Plotting a UnitCubeMesh"
+plot(mesh, title="Unit cube")
+
+mesh = BoxMesh(0.0, 0.0, 0.0, 10.0, 4.0, 2.0, 10, 10, 10)
+print "Plotting a BoxMesh"
+plot(mesh, title="Box")
+
+interactive()
diff --git a/demo/documented/built-in_meshes/python/documentation.rst b/demo/documented/built-in_meshes/python/documentation.rst
new file mode 100644
index 0000000..64194de
--- /dev/null
+++ b/demo/documented/built-in_meshes/python/documentation.rst
@@ -0,0 +1,201 @@
+.. Documentation for the built-in_meshes demo from DOLFIN.
+
+.. _demo_pde_built-in_meshes_python_documentation:
+
+Built-in meshes
+====================
+
+This demo is implemented in a single Python file,
+:download:`demo_built-in.py`, and demonstrates use of the built-in
+meshes in DOLFIN.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+   from dolfin import *
+
+The first mesh we make is a mesh over the unit interval
+:math:`(0,1)`. :py:class:`UnitIntervalMesh
+<dolfin.cpp.mesh.UnitIntervalMesh>` takes the number of intervals
+:math:`(n_x)` as input argument, and the total number of vertices is
+therefore :math:`(n_x+1)`.
+
+.. code-block:: python
+
+   mesh = UnitIntervalMesh(10)
+   print "Plotting a UnitIntervalMesh"
+   plot(mesh, title="Unit interval")
+
+This produces a mesh looking as follows:
+
+.. image:: unitintervalmesh.png
+   :scale: 75 %
+
+We then make our first version of a mesh on the unit square
+:math:`[0,1] \times [0,1]`. We must give the number of cells in the
+horizontal and vertical directions as the first two arguments to
+:py:class:`UnitSquareMesh
+<dolfin.cpp.generation.UnitSquareMesh>`. There is a third optional
+argument that indicates the direction of the diagonals. This can be
+set to "left", "right", "right/left", "left/right", or "crossed". We
+can also omit this argument and thereby use the default direction
+"right".
+
+.. code-block:: python
+
+   mesh = UnitSquareMesh(10, 10)
+   print "Plotting a UnitSquareMesh"
+   plot(mesh, title="Unit square")
+
+.. image:: unitsquaremesh.png
+	:scale: 75 %
+
+Our second version of a mesh on the unit square has diagonals to the
+left, the third version has crossed diagonals and our final version
+has diagonals to both left and right:
+
+.. code-block:: python
+
+   mesh = UnitSquareMesh(10, 10, "left")
+   print "Plotting a UnitSquareMesh"
+   plot(mesh, title="Unit square (left)")
+
+   mesh = UnitSquareMesh(10, 10, "crossed")
+   print "Plotting a UnitSquareMesh"
+   plot(mesh, title="Unit square (crossed)")
+
+   mesh = UnitSquareMesh(10, 10, "right/left")
+   print "Plotting a UnitSquareMesh"
+   plot(mesh, title="Unit square (right/left)")
+
+.. image:: unitsquaremesh_left.png
+   :scale: 65 %
+
+.. image:: unitsquaremesh_crossed.png
+   :scale: 65 %
+
+.. image:: unitsquaremesh_left_right.png
+   :scale: 65 %
+
+The class :py:class:`RectangleMesh
+<dolfin.cpp.generation.RectangleMesh>`
+(:math:`x_0,y_0,x_1,y_1,n_x,n_y`, direction) creates a mesh on a
+rectangle with one corner in :math:`(x_0,y_0)` and the opposite corner
+in :math:`(x_1,y_1)`. :math:`n_x` and :math:`n_y` specify the number
+of cells in the :math:`x`- and :math:`y`-directions, and as above the
+direction of the diagonals is given as a final optional argument
+("left", "right", "left/right", or "crossed"). In the first mesh we
+use the default direction ("right") of the diagonal, and in the second
+mesh we use diagonals to both left and right.
+
+.. code-block:: python
+
+   mesh = RectangleMesh(0.0, 0.0, 10.0, 4.0, 10, 10)
+   print "Plotting a RectangleMesh"
+   plot(mesh, title="Rectangle")
+
+   mesh = RectangleMesh(-3.0, 2.0, 7.0, 6.0, 10, 10, "right/left")
+   print "Plotting a RectangleMesh"
+   plot(mesh, title="Rectangle (right/left)")
+
+.. image:: rectanglemesh.png
+	:scale: 75 %
+
+.. image:: rectanglemesh_left_right.png
+	:scale: 75 %
+
+Unstructured ellipsoid and ellipse meshes can be created if DOLFIN is
+configured with CGAL.  Using :py:class:`CircleMesh
+<dolfin.cpp.generation.CircleMesh>` For a circle centered at (0, 0)
+with radius 1 and cell size 0.2:
+
+.. code-block:: python
+
+    mesh = CircleMesh(Point(0.0, 0.0), 1.0, 0.2)
+    print "Plotting a CircleMesh"
+    plot(mesh, title="Circle (unstructured)")
+
+Using :py:class:`EllipseMesh <dolfin.cpp.generation.EllipseMesh>` for
+an ellipse centered at (0, 0) with 'radii' of 3 and 1 in the
+:math:`x`- and :math:`y` directions, respectively, and cell size 0.2:
+
+.. code-block:: python
+
+   mesh = EllipseMesh(Point(0.0, 0.0), [3.0, 1.0], 0.2)
+   print "Plotting an EllipseMesh"
+   plot(mesh, title="Ellipse mesh (unstructured)")
+
+Using :py:class:`SphereMesh <dolfin.cpp.generation.SphereMesh>` for a
+sphere centered at (0, 0, 0) with radius 1 and cell size 0.2:
+
+.. code-block:: python
+
+   mesh = SphereMesh(Point(0.0, 0.0, 0.0), 1.0, 0.2)
+   print "Plotting a SphereMesh"
+   plot(mesh, title="Sphere mesh (unstructured)")
+
+Using :py:class:`EllipsoidMesh <dolfin.cpp.generation.EllipsoidMesh>`
+For an ellipsoid centered at (0, 0, 0.0), with 'radii' of 3, 1 and 2
+in the :math:`x`-, :math:`y` and :math`z`-directions, respectively,
+and cell size 0.2:
+
+.. code-block:: python
+
+   mesh = EllipsoidMesh(Point(0.0, 0.0, 0.0), [3.0, 1.0, 2.0], 0.2)
+   print "Plotting an EllipsoidMesh"
+   plot(mesh, title="Ellipsoid mesh (unstructured)")
+
+To make a mesh of the 3D unit cube :math:`[0,1] \times [0,1] \times
+[0,1]`, we use :py:class:`UnitCubeMesh
+<dolfin.cpp.generation.UnitCubeMesh>`. :py:class:`UnitCubeMesh
+<dolfin.cpp.generation.UnitCubeMesh>` takes the number of cells in the
+:math:`x`-, :math:`y`- and :math:`z`-direction as the only three
+arguments.
+
+.. code-block:: python
+
+   mesh = UnitCubeMesh(10, 10, 10)
+   print "Plotting a UnitCubeMesh"
+   plot(mesh, title="Unit cube")
+
+.. image:: unitcubemesh.png
+   :scale: 75 %
+
+Finally we will demonstrate a mesh on a rectangular prism in
+3D. :py:class:`BoxMesh <dolfin.cpp.generation.BoxMesh>`
+(:math:`x_0,y_0,z_0,x_1,y_1,z_1,x_n,y_n,z_n`) takes the coordinates of
+the first corner(:math:`x_0,y_0,z_0`) as the three first arguments,
+the coordinates of the opposite corner (:math:`x_1,y_1,z_1`) as the
+next three arguments, while the last three arguments specify the
+number of points in the :math:`x`-, :math:`y`- and
+:math:`z`-direction.
+
+.. code-block:: python
+
+   mesh = BoxMesh(0.0, 0.0, 0.0, 10.0, 4.0, 2.0, 10, 10, 10)
+   print "Plotting a BoxMesh"
+   plot(mesh, title="Box")
+
+.. image:: boxmesh.png
+   :scale: 75 %
+
+By calling :py:meth:`interactive
+<dolfin.cpp.io.VTKPlotter.interactive>` we are allowed to resize, move
+and rotate the plots.
+
+.. code-block:: python
+
+   interactive()
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_built-in.py
+   :start-after: # Begin demo
diff --git a/demo/documented/built-in_meshes/python/rectanglemesh.png b/demo/documented/built-in_meshes/python/rectanglemesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..79a439facb10c5572f98634759903bec768a0ec8
GIT binary patch
literal 3535
zcmeH~{Z|v|6~_Z^b%LUU9Fb)$I00c#X#h(pSP^x6iC_h#9&|g}hzDWiC1If~;U&S!
zfFiAtvakvm^c0qjZoq{l!|Sq+QX;a%qY;coU}%sdLEaPvl0cu4a0q)&|ABUYyqS5P
z=id8#Klhu-IT*~bwsNpyFc{W>`*w#i7?wvF42w&UCHTd7Bu5E;FAUth^RS@g)$<tM
z@wRpNp@#}XMTY^3g{%KU>irrUZ*~>!U<SuzG#%a{5($Mu#*UjUVRIIY6Pu6^t`)(S
z2M<6NU%TRr!?q~n1`}aC#^E#3D73@p=g0peZJDi^S@WR(b>d_x!|%uL?xF2FS0E*c
zy5d>4@3>s2($dq|T=98LL)xba?s^*!^~r45aa2EjQ9UDC9ecHU-CHP=n971B?SZwm
z>EMkQapP{Nz|rk-mn#-7_7ddApn_E(nve~1E)%V5n3P4yVXQbdYa7|ec4XoDgwQy4
zZ@UOj!TdQ;vbOB$(+Kxro8|m*D@1cXKRRYQ?5%Uhvwk)nzcToS?0}qf3?H-OyWs9y
zr1C=ksqJJFdt@UX<0qB>PHmNj-^Mf?h_m=?dAewtn}C;=uJmtDkx;f&Nn`JucU_&a
z)&{THDVg~0xp3X2%(F#!@)GPiHP9IS&S(rYjyxh|nE3gVJGUk)udgY!JOY!M(?@n-
z>vzdJpFV8K!pHW3WO8M<Dl2%?P~95DKPNw0cT&;y2{uE3D3gxdztKst088F}h<H)<
zw86eQsjF}{Za?HZ0HP;Wy40aU@tF#kYzDb|WXE2uEzbbaaXONd4U&cd=f3NB{ASR+
z)=RP)`J2&$Xx-n;HjaeJ({vUH78UoByBw5o-mFYT)%mzr+aq)ub|e&jmOFc4wZTh-
zRq?G?sZ+ZT_Sp3@DK%@Z_SZ@7v;W?&4SV9OB|uf`3b!Qp(Xzd~@&MEWqQY4rAwyw9
zfj{<u)*5hFg6Q9r@dmD{6fzY@p=44c<}di~gnSExsiDL~aI`jT$XR<Dt-Gptl;2R0
z8d^h;j!2a)c|4+2qLMY`55=6%lnd4)$2=!G%6a9I!`xjZwXJDP>Nn~r4?2YzhyH79
z9t&T&TT-u*spthY^11@J^Ikxr6iab?+zqdY+kB@g+@XJP&{CWriJIE&H`wKCG~QGx
zLog*@Xf$TdMaf4Ti!|*b`~C9E2;P=!sC)`COMaaGk=ky%3trJ4AkD{8qC9AEcgE7v
zl_<P@>kCp}RD*=6F}rSj%w8SEOK>0U*uw*AyTTUjgVw+)FI<UG<*~P*ZyS305wxyq
zm|m9rf<;t2Q5|+l8}gTXB=z@XD(^3w0VL-LK^Dw&(RUmG-K$ps82oBlF^IBbDK#LW
zEBEOJ-@%&l;L0zAVDE{}V_G2m5_SJ-v~I8VO0gzrTcR2e6)(uuL)6zxPg`bqn}di%
z9%CO5reufUi6f#%y;w2fGnP5`Wvnnlc=nzM&&RkT{oReoAI9z{H}H&lZ}~cPP6prF
zAoi&T3Az#KjY$aNfAsTTk+ZZa^ftk~m%S(|a51qQpKzb^gAk$u0l)X@Dz$~PuXaJo
zJ`=LRGzn}(Q)Gg+MDwsEj!AvBfcrhRlSK%Er+sDuJ|CM&28?Hc*Yjn!IDYkudZ&kl
zUwwJTxwYge^X1+U^;^>{p&x(vld@SYEP3tRC0QZ??i%?%<DZdz=f<C<3S&+vx*D@5
z<Ws?rvT#Ps%EQK;xGY+bEt~L)gzv@A+P6ycFsb;`N>pG!sJ{l}Rz%<0G!ya9el665
z^#uN16C}h9CGbe+bik+XlVy?otZk@dBbZ-i%PW}F=Ov?=^3afIS{d3Tw9aNwUkBvw
zP+u?ur2x4r&6f8BLr2V)7eka~=ewPl)XgUi%)kU+WWzwZ6H$;H>P&<>A>Iauugq_m
zCw$b~5@a-dH)-hV?%h6>5vd!wt^%!_QrdarV}iWimqnT&W96SrDqW8XZY<SJ1`8j|
z@lVXhq){I9iL3da9e~7nO9gliA7kXv1Wb0E0!5S5`?1{~0G2I+vjNc@TB_0`5Vg0O
z7I)8;TmT^MjWq!RkO@FQxukxWzVW8kkC;@@Qo86_zCgUL01z*RFM_iciT{CLYHv>b
zh_A7^R{m%8jDum1wbLi1C#s$PWdQYi-S+H#*)ZuDs_i0Otqm(mG*)T$x3P3Ld_}Hd
z-?zYIxPY^2r@cLPKn0u&{$LPDqdL1`x!^1;anY9r15&qecRlGpjS7~V7yy1&YD>x%
z?FA^H7&utmyb%hD;E~ovBmDiMy6u}<8zJf>7}o=sTI|KoC2SX^-AB*4M<%Sod+d^J
z$t`){#Kvq_f}CBpod4g(+}4b&2cAyc*yg$<-GjEi_ii<cb--lJbY;=JF-#kX3-8@I
z>DzT(lPdO{xcC5=>)<exmw{+A9bw_eL!M9A#D}1DTfy1$mcs{;Cmn?y?fxT?{(=8l
znAa9qo3uGX_YK>)6-0MIG`};T+XdHw)|kA^Z7o?~wz1b4*aM6TlMVg?CJ&i8=;gMh
zw;I*ALYuK_7G1VrSP%XIY>XObwdlWSC@{*NtAKtKElf&UO&in#o;k3@Z2}lnxkN<^
zOfk0!Z&L(pqs8L`^lLM*3l*F(Hze^|Qg~|Kkmd=!2#<VhzC$h^?`-agJt#!LDZt_u
z5O2og%ZF);GeMdRlRoC2s0o5N<|lmEM}({zf1UVO&K9M2I%`A!&Sk?ds~%@C7)Jwt
i{;U0e@rhA8XX(#dH^UEzdj>w#7=e3&cUPh(&i)5$&ng}O

literal 0
HcmV?d00001

diff --git a/demo/documented/built-in_meshes/python/rectanglemesh_left_right.png b/demo/documented/built-in_meshes/python/rectanglemesh_left_right.png
new file mode 100644
index 0000000000000000000000000000000000000000..2d439c755f8ca53d689624ecd74d5fca4926e70d
GIT binary patch
literal 4891
zcmeI0`CF3N-^Xbi(WFc(Q!67=n=BU$wcMK2HnYq!(s02{O)VG39kqpFqD4(33PnfK
zTtmt%NyXGLcg@0Z8F!M#4b*TKzUOAH=enNf`!786D>vsppY6Qf@B5G)&m2c6s4Ku=
zFvQ6dwoWkE>Ps-#swDVo@XHE@+y;Xw51q9A<w9iIL~n2CUuLwmj*(vdQc8(xpR?cI
zywh9d2bK;Aysj|bUAB#OeC9m*YFRKmd<Av{BkhWX!8#k1R)3-)*ZzUFfgcGVDc$_4
zh=jdVI|_3(Cc@tMz*qUT{QHOh4|Q0|=#~3E)Rxh!3wymV-x+&*r{dt@^THp3PjQ3?
z*6|Xdlo>U78yl~A4#gAP;poukKGjl#H@B3GE59ZoPYd5M7MAta)4qoo+<OtuL?f0;
zRi$o^n<<OR({yC>D503|&zNa(LSdMsifH-c?N}FmWTg>tp&X-KmHK^RUmjgAu!gfz
z;D*A8?CY)7st=}*Cipr0xDfHUdCN;&Mg{S?AJdGQl%j}RZQSS;qvEjdemC31WIW5G
zEt&n+<0unF40(C&cd^5p7duXkxc0O33<meon&keRSH#(l^`Fr9V;l%`H0N=T2Q3^t
zkD_k8JEc~AWOq3}t=)E$yHp$B;@4>gWwd2*&-QKAN^dcvRay?4Me97wc`bMB%E12m
zno4U>MDulp+&go$y%N20Z|0o3Nt5<=JAAFRuN)~jaexvX{F?l^A}c_!D0qc;t3G!S
zY_w@xb@pfH(W)Sa$17+oiWl^=KNdW}%x*rpvLG6(AZBE&$7ZMVMC4$4VxnD!p^wy1
zGWD%xo_C8nR-wz37h@{y=P?!7-|g!!kb?8Z`&Z_t`0F^2E}8QZf0=fN-qn|)>IpZk
z?_~KV&|Z;GjU2{v%b{#2L%Ggs)$}3LaSdPlcH0uX+u_U0_Gb4+?h)SJP#lai(wLRt
zyiCqDVCOcfEGQ>1*tfTnaBv&)Csv}h<q4IJR`I|WEht>xtcP>l6?jco2dh}~T>;pG
zwo+O_4enDZ;FOj&D19t>fm1b|f31^G4{*uWPhCi66V^6YD;+Z}!p(8)={#F){KQLc
z7gf|%6y@Hbs)~V{?BD4qbkYoDbhCF8)e~C@4cJV5q(H6Od-7ml?&zV?FJP4&le<I}
zjaru+1FNLo@Z!V$tVacc0VfdM7He*)*^D+``#rJT6ONDRWs&m*17RwZX39IKHf*&p
z-jb7VpwF4fIlF&IAXtsb6QBvZvA$JwtL6!sZlicsYr|HH_IQ_w^y!X8T~s2na6r_X
z)8<~k<d#?IE;yy`zdW~4`6RLdTVgPHBK3ZeBJM^}fpJhxdIN<?mP8FCv;94)<0aR#
zJmKfxcT-%{XFtoUpxd)mzP37#D<@d6Bde5j@HyMHOvhKSt5Uy@JUTU!A1faew<+9+
zc*vrM6rw&`WlZ#E$hA3|V_w;t?fy1oVY98be6gp8RgAxWjghzUz_Wr`?X*SsPH*@f
z*RBXXjc^xct;3r_p}$~Xxcu)M@1ERN9UNZqTUswG2Jhg{c(@LO!c5qgPQl83;Lq>Q
zq)&B`5XoaxItritO7L6Ch&6J5=7R430%{dkbF5VyuJYSUmMoJ^;z)#A^>wd{Z4np^
z6Fa6UZLghg2b9VNO{E$`qDEG3`W<6LswwZj&M8+XZF~oZs3jN-FeHw77p4n0Ak0tk
z7hjPT-h4*#cv9>xD5JQ>T6M{`7k1bi1N+3~q_e~^0-<o}x>Hk}#@Bvd=SJ}YbJ-X(
z>NsrAv|cZr-#`^j6iInJ+h!j)wNYZQCeA#36l<VxP%M3t8P4>g24`7@BfxRPI{Ye0
zQ^V60!z99frZ=;j8cekIy-o_wnRocnS9MzuT^4=YG;ji2t3L=Qut<tHcsuQTUdo@%
z;uE<!oNg^yCyw7t5j80Nq?}3iv51agp6n>Dzy&~cowK6xAb6zuwG@Ycb5-(hDYl|C
zJ1;3SqqYi-Alxv-LMK&zx0B_1^|!LXW>p2hkPL6BIcy$u8!gB7*jUCT%gUO=QD46e
zns>$oC0cZXd9!2YM9tUMEeE)J=Z1#%*gS2EaoEgq+BnHq*y)e8_LYs>LS=@ZBJQFf
zb#G+$&a`F<Gy04P$cBCNVW@#VIE!DFUXmfOjA8R^9%eW_hGI*2!!{HB*RaphB_RQ-
z7QZ?$6QvT|^3~9X2JQQPQxC((c27I{7!tP-q;VH+1?`c{_vS>iIX|6TLA=wf{Mi+S
zxn*B}3we6{bftG7!*~VY`y<IR9>O<UA8Cyu{_J+(@n(k~$1=ICTgq|$^Js%-dbQeo
zw9V6om7mC6wsRU;-pr?nB`(BBz|b@t93S}>b^BoZFy)*%Z<Z9hj4APE?xH5yE8_f$
z&Al)xEt7YX+2QDM8U(3ss~NE5j;o786U{H=XKriBK<0gFo;M)zc|+o>@mQ%@5qb9Q
zkp}FHx=A&($->QTDaZ%ATQxq)rS9c6al)C$6E+JVt`UwrXi&PbH6PUY;5j}ossS6J
zZX%HdW`)xu1*ftAyz|J)6|4Zk;i!TA5Iw)G@lqlMm)L@qy(dp|lI=&Lds$tOu;>XF
zivNo#*Q;9GMK$wv@2*kDCh9uYqxtVwHeW;$$GG#8b%V<p6-hrX-_7tBEE;i>^qvZ-
zNod7E|0t<=er%24IwP6wu4%Reg`<5q*a(EP9})96kxa`CXQt>jhe9=<I@?J^{<S}}
zrtgpwUuWO5vDQaJ9uWL<wZfod{)M$M9eDvlcD>q=Oks$|B0BQH)u5WznD2dHML?eo
zV7Xe`!=xrjt&AnCrf5P4SW@zblWH5Fuhr@oo^YGgURGIOcIyogRk-sgXvMHz<wbFA
zt%f3QLz_upQbb;&>A4APkDhqy8EAREHeVTPISJupDL0pz3wlmj<Z2Uy8T6dd`}d6%
zai;)Fe8k(!AqBGAfbOFKb#THSbvGuG>DM|pci@9x06}TIlqWD443hRg&F7TPKLRNJ
z#M1H=Z(r`T6^F*Iv_*j_*9XNf_@K@Ipjq?g?*9_btCenl3pWmX%=Tox<-3Yvy0`Kd
z712)!k+dEDgeK@<I2-u;7!&_qx%fv+e8R`rBE0s>EcgBuDs*Z%^BVQFN<Lv6BRqP%
z0skU^ks>Ih7j$ZG?+TsLfKKNYwMv|juh3%~q*(}&Ml=zhHlc`9KO5%th7`-+1IYd;
zg)2jTB-^Y(NyqT{TCIcQ<yehWzt7L@A>`}EhJeEcuu&mKlnuCCrukJB%K(1-<~xHl
zZ@8AL^jN4v&156Gg#4C^l_B8CaeOjTaZj~*of@Ldl9#2^-52mb1pfed)&q1fkM!`_
zn2*Z3{jdKaxX_ahB%k5j79m6jim*YZ=R_m<vSh4w9rJ?E!QCz81R5q+nDHj(-skUw
zv}Jo&g4+Wmb{|Gen7dr_qE*ZwJ4KwAfm5_9L@$2v&)sox`oWZF_Zr=5gpbE$m-U1A
z<=10ZLt_gUhu3{fb{wv>_AOj6`>xy<wf4SRb(sHh)6JT}%GslRSnF2zTS3k{Hb}*l
zf2?NTbE}>@um2S&3B;6~mejF~%+_Uk=0Eh>lXC!^(v)m6bEg3ipL|_AKuJhPMRj8}
zN|UO^<jD-(P-bf8WIVl22IB-nL6y?6O*!Or%OgqHM9kSF(n~1W2f?s7Z^*9L7H5>2
z^0<!08Pm^Y1)`h<<GPL8sN?Dq-V}O(nSK><8B*TTkxhU3!k?$|Y-9SfTU$$vxLL-s
zsH~RI&+3#$M1d-`QPf3Grenv9Cj@U@8N4lQo;K5U6rA(q=J3BE(0!ITS?4<9@9lyH
zKXq?l_D*agB{y0h4dCq}gSWdOkzH|v0l*ThgZb<@JU1g7!#L@fw>MnR>|pze%XxAo
z_#H<dGT8n^^>3k56l>D8P1e?`rKc>522}<RH^r5G7Jzx5>B)MslFm+MZ^-<}?=N^a
z2C;6d1$7<dQ!e}P+S*HnVNH*lOQs{DtjC%mz+5dS5`2M+^3WsGzB|3-wo({4gOx^V
zGv&MT^ljwnku!<5HyGxY0QY=Sg$(yb21sDMzC`Am9Ywd_sXb?oNg~CHcyGO#j?|<X
zMcl75G_N3)mVkT7>{*lXafsatsF`Je;s6Kq{u_*|9l(0Ot~=0^16<(|;0j5_V{ZI$
zo$iixz<J;31U^zm+e;+FBzTa9W)NeSfux(g)8aG{de`(Sqy09e9!aMxOZ#n&JSMd9
zy+NJzGPgbxXbFaW^~KRD4Tr}=-`vc3+0Q>#{^Qn%Wp;&o$JpWVlo%NAXQY-G2&8If
z-AQ2B-LiKAvaECe016%FeRcMqokFz!@3e<mS#6E2zcd5LF4bLZE*Y4M>u5robLXe!
zhXZnvyt0jMQSvS|O8S(QGR?{z=1X(R_9KfEooI+udcCiJGm7E+ccutV^8ox-X42TQ
z2Tg|pjEUy8L7j6OwpIf6MGHM$WDf?a)KNsFZ9wPoGs-Nozu<jTvY#wd!5#vNc+1wW
zQ!O#!6R^cCk-w(d&yRl@=D&_#rB;3StLgY{Utkxz*)OaDnwqK2-?TglBt!5qRwi*9
zr9t?Q&1RMpXE>4wXAf+79mFWyyGnaH7X)^_kbBbD1I3%QuXiRHKFm=Mj}dRT=z#2Z
z0oT`HkX|Gz1V;J{3VgHiSna?#P5`H`=aU<9WyF3&Ax?fl*XC)*0to@Z1(E<PC0eY^
zk;Dw;E)ETuk_;>Q)lD!!0{lRLD3ZE?FUOn7r6viN|5mv_zrg<BJQ{__fUAaNuJT%J
rn_L6?aOU6Zh<~qT!0l7FboI`&b*{-pE%M;f3wF}(j4ku1=k5Ohgnj=B

literal 0
HcmV?d00001

diff --git a/demo/documented/built-in_meshes/python/unitcubemesh.png b/demo/documented/built-in_meshes/python/unitcubemesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..0ea9f99a46ea4763f918afd7fed019e416eef708
GIT binary patch
literal 12548
zcmeHu=T{SJ)GsQ5NDU&QNaxT(RcTVhgaFc8LJ88PiGWJ)8bXz#Ql$3|p$MT94j`Z)
z9YXKD7wJXsc;0pYgS+mh_fyuInM|J9^X&aAdnZg=Q<<8AiGqZLgj(epLYIW(x*-Y4
zwU6NIz>zD1us#wJb`li?4C$G&ox1sTv!GN-Wz_qRf%~7=aM5S%*hh<oR>OsUUu~Y6
zhpbczSF=r4bCZy~E4Vz_z6spHmmUitA%O=%u9G~qgTP5hz|?Rs2}vdle2s)%49r17
zf+gc1C3)A+jwK<1F#Yev|1YBP+t26vo;YiCXH7oIYmREii{smKGVEB`IO_Fs^JR9F
z6Mt@;<B~^7Zaej_A>v?bi~krJ{di2i{Mb_vM}KMpY3-L~rM)oK-Das<B>2g)(i0~f
z*LX{|$%cM<RT@@Wl^>6dbX#m>69<2``2R>cGN1Qn$7YUK<0|tVx;$R}B82W3Rwfjc
zxSfXMk>863hTTdu5~Zin8_>wUBq_NME8{pAGo*DbcEkD$HdWvLE8a*ChmQ*jbMd+I
z^PU``s@L$Fm<TT%!sULUaGI=cSlJ|2JJu{3*<^`>dl4_Fb`Wt~t_;1e_~i}*W`3Zp
z=evkR>JDi)uRoJ<aoeIip4dH`E|C36hOWM?$;ZKo9qAWluLp;-C)g^*zZB+2PR}{0
z@@qIHYV7xBOBo2{9Uy2J#da>O?YEc5?_W7T=1I(sIvc*%O7+t7kxzVCd>e_gh_0$B
z<RO?t_MWODH&yCF&^^7vi7rMP@p6ech(_U5gG1mGy(BzM+eQL3xXvNE4QcIokaBX+
zsmH7OD2|EY`2*BXjSE)G_mGa<>7L@|(3^J`^_?EXCE<L($BL>aGR0p%%M-Ki(P423
zFC>VY>1(NASigE#(uML^Tvk_qCe_Gx0N2VbfdfCQp(nsEB+bTtbV=QkFsLT3yIDIt
z39QgG**v}TX3ooJ?_!RwHHIkjim8B*v9sr9X@tQ$X;-k7$QZgz+EZ7DtbCVp*DWe#
zwn!!IF{}IP?d&j!`ou+Bv#iIfXtv5(ii#hwbWE`RsiN)31EI!3NGBo*X1ZnD%}M4j
z9Hu|6r~E{!bmhGt7@l$MX7l5S(RBNXNzKO>3TE5bLi^>a^u$CTqdH<|){T@7Fzgrz
z=I4XgN$09o)r(*5{m|?p_Lj#qr)px-bXlx?NmO}bMsGSzKFZjRw(i>qTb3A!wk~tP
zA+_sx5^B+$TQ`}2XC7Pu>(Skl@t3f%bn5>(cF;v6i~t`F#4a$lw)Y2}5?M6l-0({1
z!NNbeWrO{48^bOV>jEPa1%xX4ayc=F$fa_eoa5uS_agIa0t}`m{Ul!;c^h@C@Cka=
zwn-24s$1g%PBIg$Z{yxHvkPJ%!FgtfpB#usez<xT?P&+;FOz;113XiGMtSJt4$Gn7
z00AzgiM`#V)L5L*eJ^9<pOifFhXiUU<2~Y2heUZNWS#!3MaIZy#*`u-j4==a^}4`U
zJ(UU`MbrJ}j#*Wi&OND>f)Tz5`>iPF&S&VZhsQgm_m%#jD=Jn&Zd}A$<3-^`0cH8q
zOi$UckThnwX73O>ymm<-#Id+HYzKdc8;>w7X`)WrT=yX&`o21ARB(C5SB75uY2?tR
zXZwK98(T>fi`K3r>a?VAjW#H-L*RDfT`8&zQX9lP2aoAo=)Q!{qwzPlt(ersbv3gW
zosFiLmU&_{D*JnLTm;dES~7Qf%nJ*ZxV8@?B;Qh1dJDB1X#_WB2%2mgX-tWLZ6I)|
z3<m2h<XJ0`t19-wBl6JFZX7)e|6HT^hAHIf^V#nokKQ@n$BD-ex^5?A;jhxgf1Kl(
z);)h6H)aS)7NQk?|4Rc0a~mJmR8ju&f2uOoMJ+VhT$4Ra{5b@{QRj`~1Il^Mjoa>_
zS0t=*UhzDCYWVZe_-?@Xyl5Mn<x8gebm$2;GX*D*ll<8#cg{Ho7KYAWAO04iQlbpv
z$EUTgIlIaBTKJBb!(6J*K{2gjh(PP_19q8->dRR_IP|;wGPNuo8Q;BqM+0Z^js+_!
zUFNXl2u=E@K0-PF1%!AX{hjWyh7Fo>Lb%Yb4I8xhkMZIHN5LIwyBTA7M~O?0JV85C
zgVmbyl#Vad^C9KNYgi>eI-SMk+f(<k5M30D)wZ5;V)a6xc!{l@sGaqFOL}~Z%#Squ
znF^7(B2@K8tz{wtgwrU?6u`=yD2O@I<kLL9Aqlo{H66%_RXS_VdH&?fvJgvjCO$qe
z9bI8*ukk@xQ)vlXo+k4Rorg4;rk!~yPng*M$YiD}M8vx~clc>(-CoZGSzqsCYn^OL
zdRkPv#N2(CGY}HoaZ6*+GNEs(cYk~eO_x`ExNojfDN0eXqECNPM@z5ch!~zRS$_+@
z)$8tz!`s-jR^mqS_W8Z94`%7t%!H^LB!y_#O)Eq|56!P}M5x&cq(As9$)puo@Y|8)
zpXU)<xR9f$v+g#w6)SIUym%*-qHVX6h1eh1sRs`ql&$21)P@1EYJL+=3iDE7Bx$se
ziMYvX@nS|L3Hi^@i9T!J!Yl3JiHPhMZ4>RBgW_}?%qUF)Epf0Zd0<Ljra^MCix@Fo
zocRHncvKZ_^IO)fdVrjxXTzMuI;%5NFD<$H;bd;|Fhkm{6BAN04k``2o~PrIoYO1Y
z+Y8+qE4QAV8-!rSg7(ahGuc$?dHdYvitvT&EF#KN)5bITPG^nW`{s-^zB^9oG^ltw
zOAJKGRtMC+xu#<gik44IjSkTbe+;$ylzwRx`^5cu6D;Yet8R}Uh@oUfVyK4o{0(23
zqx1XSBNW-TePHgeo|-Ybcg${L9kII|tN!>>8rY#Hct7W_o0h!Z<IxHBu+}f4>L=Uk
zyVmBH3-wlJsG85hgWhKI@xBA^%1o>H@2)omt5ozWA=silH1f>y_4d2-3}k=p3qMMu
z49WWhzt69fuXJ4(4(70``{{guX|uVG{<vp|<u^{C`qtyNOMdf%NWMZg&S$vBrlwK1
zq*%-|y}p<BftcxU$aYJ8Kxps5Pnf@2RWp^VM-mJIfqP~<vh~dR+)L8caGcku=<1+n
z@)Iv`_V#%!xky;(d6~3Cd!b5SO6$JyEEyJb|3LcUk1}m_cA@fae?a+h>`U9ULc@QS
zKo;a25g*pBGqvV~Y_9d@*8D~_NIE(yxXiwkp_j|?&0owYD==QbCKHZtj*>gb587xO
zO;P(P*8KD=Pg3KhL8tSbw7jgh-v2XLp<dMl?=I92y$J_vLA9KSR{eKZe5%Tr&yo$U
z7f!FJR~Nw)1Jsg__cBeqP5Wc=H~zUMG{V-!ui6$U{#&?<U)M%<LC{b7&Yj4`4oJu!
zg50%QzCqM+VjPHz!IjC?*=ak<S$=FjgN4C$PxrQ#*&FS}mQpd9O^-Kvr@m`!!|d1$
zUB#GSneXZcdHI;ANRi?U=b`7w7LZxLY<rdgS`XIFn6hK%>`vT$d-;-6FCqK_bPWxG
zL!^e!yvnkVUMe6V3@OzsA70$4d5M%vBx!_!EuP}pgo2etN-_3IHrg!~m0G75g)Z*%
z^Pg9k{u><FCw(kA)6aZSv<CVu{LUPq6innz7>bu_v5o9hFtEa-`d@M=nNaSpIpd84
zijI9yBr(E(ET9n6X8UBx=GgwOV{0S~Jg>rSZW&j{_qIcZ-YFYnpTo&$(8A#LNa8}x
zOuG>ukidwz%pm0;rE~kTCeN+AqzRRh-PtUj6Z(Y_p<MQh;$ty{fitb|6Gt`Vk}ou&
zr<;ViCRDj^ym2z)H%d}~4bY4UP`+Azw9y+#K@*}@kfCXNhI4=-fCsqMsn^4L^+kfO
zX(tb(LMMdW%Yn(1X_n}-o3g0~LX>#P9}5x8bs|pu$8x{!e>(vAvB(hh-G4<FnL7j&
z?HaLs`0>gS;d({Q0HMG_+*2Cf|9<$M@(jc8rw<ZYraaHHa9-K*vFz-KI#Q*1O3Hyn
z5+pSnWm=yz{+fy|U7@UB-E)C@HiX(~%wHy^fy<ht=|mu^0MShGWNC7o9Pxz}SuwM0
z_Yf8+S$98;=@_uQ17StQQm?-6fa8hBS;5s@P$_2NOiUgD|H!uSa~ma=25j+Mv+Q9X
zaRS#R34z*eu_8b*5E8}dInr8Himt_dJ2Pb(2y=B?!W^B_O2wbq>fEb<6WZ<7jeu_2
zvV!5XYPx#g#oD=Gq`=<MYMU;z@Wio8g{o2Un=?Qm{VQqD#w?xA#5~OZ)6{acF(cdg
zWov|<QOA5nlKAYaU-qVj!H#Xs9Sy7@f#JkE0gTGCZ{=>kI*ax>aDF)uZvjvnPU>s#
z|K%cu(M*y}Twzv&KgXIlmo^;t6%vlgmOy<>!&3ujt_hKkUPAU?72YX>MH&fnud^$3
z>)C095FnPn(J006&WNWw|0~sGO67lB7VfDhCxY`4Po223(?5d-4u>)|kRw|dcex)o
zj1>hn6|;N6#$aGr#s%N@VO{8&Q8EuyY70mO7KZ1;xVNZ9O88Cq-7hO~hasO6HBI-X
zHrIyyU>;^ZfgcJo1}3r$O%*^x^%N`bIvsw<6*(JhwP^)HFsjA~t1upoWu|}!oJqZW
zwr;MBYN)@<>n%c~w+uDgG7WpU#y`py0KfdSF4J<d`b79EA@wqg;=Jm8XhB2vbW-g@
zf%$(#zyKkL_@Om)$3!lj^LGJ-={H6M=+VMKw<$Xmd<O!*8*{?d8B;4mrUO&+K)#+y
zI^EzdvU&>Qz+M}ndDwU{W4D(CO}IS(2ZDE)J@j#=KlY%~ibM<oU*j4LeOb1*ed)5=
z1uY1>a4yVv({HBNGVvqXYkKF0TkmUmKsv>G6JHw3=P$gb1`_>b4-|PBOF^>@jxw+2
zDV^69uk*MLfq#6kqkLR4&xjI@6kC^ouHETQ*N16ze5b_FVIc^zft-b#EFl7$wzj#*
zd1Jy{?3-D>k=H;~NIwR(x9gWG6*^W&uaX05q^e+2arSJ}EP<X5@2U)nJmki)jgS}2
zZPUM=!v~&<q)Z~XfK3}k!Bii;OwE8b+5=}IYJ1%qkE#l?$1w$SG*GE;a@6~*US8O?
zBo1Z@t37abjN8s~ed^xVno(lq_8-+pBN37K8TpH*t`2lisC7TRjJr49FQ3MJOh+~*
zo+D3ldbNas5`SWPTTM3bvrfTNu*K@(wD}05deBMv8YPpQn$@dHe6>rwhdAo;v1@s}
z!l%}j`o#{^Y$6v+4HqYc6F3rn%K>4KmRDWNjVE+RIw1Up3?o9%PgPC(W!L6ZY5HiT
z*|7urVfqF<UnEl4x+ry77I!@BDe?}VZv0CPzsscD<DDDOV>Z*9+m`u1yV@TO!Y}`m
zs&bod<tcdatL{bqz2_03`oCbH5MWaQXLHH=JYIZe#JbhGQgrz{x7FBQdo46ZV+9|v
zd$Ga3`m3z$yY89b;-%49c^p}>tylDFg?5O2AsvIp*<~ERL)7?$%uC|Lda7~4%k@eA
zL8CPvL(k>ULtm_$yoVmVo<JON@L`n{Dx02_#+pj#z1(<Jx8Ao5nzpN7UITI^HFS+X
zknmy)8@jen;|DJR9Fh4S!sfZb_fqTVe_=)qU<a7=<c^5+jY1b;LD?vO4!VIg2vd;c
zxcFA%9BzC5I7S<$tn5>1Tr}79nZE6)fc+m?IAnZL(GpuZhNw=-d_(n~LRxwvc^U;W
zHWL+TK5lyx8giJT8xG>&#zLf#G?ro3s~cMn*ibDwp?9F3#EezVHsaR2+M-+Q{SP{R
zwe&#ggQja;2r>+RXR>Xq|6L`rwmDYeZp5J8HRY6#DKvSWeL_c|v?$s#XRSfPc3Nlw
zK2QH@^4OC=^6#I!gU!*Qc|ofPGks9I*<6Y5wq>U?s&i>nkIHQF!v+jMcKRijZzs=o
zoR>i?&&@zq2n6p+{E_oUP!P#Y4lGB|9E<x$O){NA{S0ZF`s^kn2t%x{Um&OLwoxs~
zJuF1sZocp#`OrR{&VPYmhk9Nf`-x!X9!FAOz;LitPLGLaJ9dTZ_eYAIjK9IOd^GTf
z-XPog`G2h9uxj?XW-j!>6$isNMzOCCBZIhv(nBTGro$fU@Xh~tm^t2FHcc1ay!$xL
zV{eGy_re;t<W}TuJ!a@I$2vSXC{^G$6=xG5zoyz!)G&_pi;rdW6}Df`GekT92w%bJ
zTj)sjXZhZ9OyQ>7p##EJu5zmTp~}FoVlupp*Y+zRF8A{ZS|Z%u@z0jae&zYk`qMI4
z(9;6Y0ml4&KcC$z0S{HA6tdqU5~#3&X)@FvmF?eVN->^3q5yiocPY#ML5T)lZze`U
z`)N4_0`Gn-6KW{<Xahq*lN5w%`BDB&32}Ri9lOUP59=WweCl{VbW=kS6w>2gtaRw?
z+maF^{3Pc$Q=T*#^sg18s=vb?HEcfQzfg2Jit4x9u0d*FT$N>D&KF|EHR<IMbhqH(
zd);JW*-<s9mg=&r_;<6qFdXuz1SXGU39N1r1aoYq)VZmTOkBoORI9%34qa0`z{Icz
z%mF|xb~wY+mQ!;C3S0t}m0;>?cuS<8D~JL_dv!{NyCAB<wMtR}B$Uz=%)tz{u$!Q^
z+om{IHxuR03Zh68U#lBB%?#yp;zUBE!2ss^WB5q6%2_(FwvipylN(Hj8~!B+E@wOU
zmwRzl4S^#<!Gp=jPPzfvw!$dON`ABcg|fTTdGdRpc38~jd~Pa}&g@M(a$L!{U(12l
zxMGKQ_m_jgq}%$hCNoH=BPcTmYPV$I{$)Lc=0;X>u0{{jnwYPoXr@1Yru~t5Vo_1(
zM;^0U9<p+r8=D1>rt8o%UgM0;M(;C#VCUU#U*J}i(@B}=Er_}&(NIj`FCbzVZia8{
zOQyP%#VWya!yV(p6K3`KcG$a&XSG{kkC3mQ?caXdf*>|dN&PX=(?mjmQ0v9s`?8q!
zh=hSz0tn33bT`VtBxRldDc#@vg=c@{myDX{`CL=^uq!7>_m3gSL%XF<!zy?Dt?AxC
zz2D<G`vl#(@ALptw{S&#&>u14z<d44ysWNg?JKkB`ZLL5y|b%O6s70>t&8S^ctgO{
z?_VWcZdz7dNj{<YHeay^VOPa14Lo8F*2#nHf4SY`gXL3gm|4A4dEObue#Ynf{c+{Z
z3&k%LEXb;WQV~9ym;23=QA+t!emN6bR`dH%6^ZAXi8&>aW$@SF$X3#L6Q2#jhbW5P
zgKRGtTQdWl$;~%vPnNSVpBS-#@4J<98B9@R#km9;MeQM{C%#j{DdAwAw=6%6h}tmZ
zYdayY0DU!62zwx;HRfQYc|+-G*^?j1G|*5AbV;tXSwoJ6HBLkNj@LE7iL7X{6V*lx
z+X+Qc@a*2KLnErJsC7uOkn^n(ZynAoC4Uo8%o)U2;kh!%%-M*8lR^#x*Ir*j<``U~
zIy^Xsp6WQ3(^^zjKa8X&zlx`j(7G66mPwJj3(yp$j8HzWmdYfPPDbB*-x#qEz#L#Z
zfRyKtRl`6!un+hb^{Cn3g8%r!%3EWs=X%uI()yfaxy3^%vM_fX*0~6C`j<hUb+m!E
zqPh5Qs<9EfvsA&HQD8W!K?}bbL<ft7z<;PBkZ|I#agjOtV|pBHGRnzehwF--p{jet
zXN2ReIgn4h0+Wf~f_z)5ch^}zH|*xi_@6%m7_u(QjVBQJSR%nyc$P4nP#Z6@mfYd2
zh{#?BwWC5V$bpm3R#!my;sawPgbs{twukaM5<u2M*Y1P(miZIM`^dc#SYK*KUtvb=
zWv^))ga+Wp7w&o6l$96lb%Z$wn%=0t%QaO7i3i?suoZe+%Z)^VmXD~ENIcuz@6tOJ
zM5~?6Ho7-doEn|)i5dDW7n}7h3)wza(c}Kq7C*WVia}CO{vMFCb8u`=cR3j`FzEVn
zklJqld+RY@Ejd<c@$G^PcW){Fab?56+(PQDC;HN*2!x+Pi88{E1%L5c6MG?y0XD&{
z)fvBMZV?TON53$HsQBTTa~YqoP%?53(rdqZIj214XX3PB9-W)T86uoT7nmJ!qObw-
zuhh-FnQ(g2xwsz|$_G8Ivqxyd9B~_w{CBXi5cuB18Q4}S2Xt-clw8@Hj^Xm1)6IP<
z050w_c4k+ZZTC&VG!0<c`1=Ls=X;+@b7nM8K>7O9uPqGHxT9BT0QhrxE)P@%sgW%T
z=;=CF6B6P2XYg@yoen#|O4Z-2xc!P&Lik<kBMx<;o;#_xmOz;xV8z@oq2Kbl;`QDW
z0W|(_ipfN3pIscPk(+7haf*P&0smk?H~3<<IMj}}*-k|+3$qi|f-2|oSup67C&+)k
zjlG412tw!-L7l|G^i#}}-X6!co~K|1tK%72nb6-IDVs&+pI45Jp$Uz-Iivb5isYrE
z_jiG4thtPFGJ8Ca^;H8!28JsGSJ?e|<F5*`?P0}In?ZsB8T|H2hFfzuSes7AtTPI~
zSzvynmo)+);fp`d>pv(X6bk1e{aT1<)3$H&nK$5I=eJ8PFXg)~KA85_1Z<`-{3RA1
zx-IiXo4$d3a1b0UbR^7?M<!#e5|ar7$xB6QL!~M=Si!7!Vc_hc(5Xbaf!Jy+h5uWo
z=3ETAOk@Q_r}m8h>f)Gm4sKXvwH1^t;xGwMEqp#czgBQG2vxMTwce7l?)S)XcW}DU
zo9_E+6QImfPgV&O;}^|PGkTn|x3l4-Q_uE4x!EV8s9TQ@{l$P@h5*d~y3+Nw2A;(r
zs%o1cHAzfra+a~1^zbY%v#t}#@7(wDckA=r7MGI`rOwnDqbtq6_(C)~KA5ShnXPtw
zK-ehV<>i!qRn1Cw<aVftm?WF5X6Sz9{Hq-4InN6x2OPjcV}<?h^DigaMctN!kjB4h
z^N)yU7DafY{@jqYdgq5nxb87w#C47cO<obcbKj98&$c3wP>QsNYmumOhPuY!$q$tW
zgN{xckehF@nO=^P#(1MGw&VJQw_2YBW2tqe2}hISi8E#q0Hf6gYLDwRhT(X<Rn^kx
z_1hP%N?%+dV63R{NYLAOF%Q_8DlW42Bojk`X(3?)89`dg2(wqmC<CG0jRji82&$8Q
zQbob~8(^AA3-vuP*RKLg<&Hk<IkDWsE=oc%Lzn3Ao~l~$u2#0mk2M$d=`8bogKuG8
zZGK<Hv-gjm)hr4L?6j$$m(97a2a`|sQ0Aq81ocfOMqlGMCjJe!P}x2H)RLhsc;mYD
z6Pwr#<8c0ujIs{>o2!5az_60W!sUNVLoNBYvc*rt=TVDirKff{BKM{m=U$JDGd_ZX
zZ*q`IUPy4>SsbtCK<=f$6bj9qo|o1KWsr*B`Uv2qX=tdwJCi`qP7#L9lT%ib5v~fh
zc(E1T7hfNht(7`T?~eq<6en2wX{&Y0*Xp(Q;8A-IhH?C(q6V{4=dD*y0YRJn2~dFD
zY^NB`6TOz>XU@!Ya@@g2#Lz5nZ49LKT{hqE7l`4`c9ba6wBK)=yUzR6UmGYz^a?q{
zx9LXMMS!h7fPC%llqzLQL|SG7U&4fKDg%X<9Jrsb9ou(yta)Zl;L`2{t<2vl`n#S&
zlRE$QH<~-folN3c87*8yxL%VPd<h>YRWs>V!yq8DHEo-W57Y#?hD74Y7G@)fQ@r0i
zoLuhDwrHllFC^RPF!AnN;Zdgmb9`^q4c?%6_>-ToQ&#p{O6S(&SN5*0Pvi>5_Gx`v
z+_ke|4I+j{F0@Go;U4|_xF=VQbBi$Z+ekosg{-C;>v=G*7-Uvo^v1FqB~5224NHCl
zfWzPbbC!OlGoh#Usgd3ADR{nT-^<=!BLDM|)|Ah8%CwPJCcq19F2E!<*1vkoSIl0a
z4d_2uMx~c{km#<!VebltB5g!4LxfM4pjvpVebnIo$O8btBBE{|i<t;J{5JC`i~_Ep
zVo>k7PVa~Ck-f3|m;F!&Zmx}XJ9JET4m&vgwaUs0GKibIsD53+w&b{f$$>gkv}sp3
zv0NBnZC>Osxc2<_X9^z0`#brV3FnLU&;rX$s^0EC`PS_~8lZZPOS0=+3K~7VsrPvW
z;I+fSaSsjDD%BJbA;jN?AOVMU)avE=2W{){|0<MB>x#C`wbhd-pCa>*K*<GUkDYyE
zDaJBvT|JJU6mSZL!-@VZ)41!~t90~GPu0re!Z~ZdmU;U56DrQPU`|;h9_b6RL(eD6
z-Hg|9YjV9sOruhAW@aaV#JT|xI#Yv|7oHU6ZfgE<+ri)G=z{a6-nlcrwl?Eq{UPxY
zU^`<}49N2*McVlfF15dwxil&OJLip8eA1>C!biMvmoWt5usR;y5lPG7>LSB1eEn!q
zK+^Hr7aGp2yUb2J)LlDGem-|dzF@9I`IdlG{@q6qjO1rQ?7N(CH0N0ELM1$-ZI3^?
z`(CReu0FG&UB4?3?*|)5>Km}f33(gHkn#QyEAT9D(;L25Rkact%4%TV)IlWO23qvZ
ze`f)flE|9GpC<|Bg;0<M_4COlhSRX<3AzmwTBbM7WsEod!t4-kwSG?aGfdk3^y;-5
z1a8<`8<+w3)F=8a^bQCuM%+<^;9p<7<aHZwK_&*UHimXR01t)(D~b>iD{Is9`f#ue
z0@R0nCKBLIn$)9c833ZZrNY1HGT-3W5u{J7POv^joxS^0f@w4U8u3H9BC(;QNkjEa
zTGPmdZQb&SuxlQvTp?wALd!8ur<#gaZc{6};q$C+8+Y3ESn|{j0)K7p>;BU;Q}UIB
zPRipKhHGQ#!Q4^2^{(;b^?<bhMu`76ugS`oYs1BNn*o=V+S!KuC~h6UarZl*!+BS1
z9jU5w=2^}=JBlczL*p3_-7Yg5&Esc=W!W8rOh94ba54_;&7#nPv5wy<)gP8X0Z5Ru
z84H(mM(T+59f{kJmk@aQqcK>X@Cd-fKB4x;{#|6eMF#>Lpch@w){CQ_&cK*=OP+!N
zx)8axiWFr@r^%iyO#6Zr0Y3yZQiNBFCZbA6Sjdzz<L0UxN_71AiXAFt%yO>7Fib=>
z1lzLp$z42Ss$~OnH0p%+;vI+4bdRds=@_bZFJQ>MB!c;ed6vTv3Xxb^=wEYd_bvgq
zv;eh>m7Ilq(QV1Zv+1@(+?in)0V@Ef*{Apio;1(eZL&f=Y0dga2L?|CpoZ3k#rgJ&
z7cCHA(cd=hJk)P89KsO8uz99i*Fb=Q;41CaLflpW*#bIMNoKVkXy$M4N6Zg$oBb{5
zVcWGWauW>+VWH?GKSdDUlnz;5AgIAFH@bZuV>frqj@91prR*gJsqT_9djDyn$m?s?
z%VJqDCS)9+uo<){_x_=FKnMgn`aFLMl%08v8Q3wewD1n2YWzMWA!9PBA@;BX;1j=1
zLHQrQZ2S8Kd;E0=W%+CVx%dT_aTaLAh}`AnJh%0NdCXQX@<TlvE$KH>9v!2o2Y}nL
zw8`#%HX4im4_X}=8o!G0DY3`KFLE-00Up!Gf)ET>>0IjC`Zd-ipM_Cy0G?gXz%wk}
zMK9bg1E_JDMBH1hdpmT9zf?Q@7f8rxyZQy$W9+y48-X#!KeZx5S%qs({_IKw=yw*{
zQzhFIeJgvK?lc$#JYWqPAb37u5iBKF**GpB%x3Hs*1hJfO%&t1Ft#ViQND9%0m!y&
z>v!fEqQ0DR9u+ex{iLI_OxIhfiRQ$oF1@Ge(Io1p{Jrd`jwzIbBlkM~E*(Q#rC*?4
zC9b3{TFhgs4>xOoHsQ|=v3S#!uGh4+%0uRXVFs9HR(9LJ_Qougx9lSS@2)Py5D1;k
z%<vsD%8gvZqgPH=?fg>!=j5?d)R`)p+CR2~dR}ZKD0<XwAEDnjaZ5B@m)CBkkSBwK
zug4!G9^ZWVL6N*5!-}cn$CLud?3GWX-IamDj{;W@2owzF@U+iX5ePE)p9@L~%nyjs
zzRy6v40uszI)Y$+4(unRI)|(Vlw1+50MVC4z6hgqktA+*;(UgA@+1@UnA3YEHNY5}
zCKCOR5|DJfkLpin#E9u#?)4&`3mIsmyyzj+YrAcKI-SA~wxC;dLBP^Gn8gpu*@T{a
zPY5lrV#)<9B(=rOLi52Q=}88@85SLCL?mA<JC=RO%jIhG*M>fZLORbP<!36ge{1=~
z`QS&^Gsx|~8SD}oD*U8~j=@#EO)4?DaIW9{NNMf&(^E`8fc~Fs5r?tlkFqdP_G7&C
zsvxy<M%yJ2>;}-Gbfd$W=&f$9>4k5WmS75XKF#X3@c+5AfhOq0S3vq8e{Np;+cBzR
zGdlk8d-1Y43-iNQA!w3d6B%0IM>AbUqjir3?KJV7A)iDB%yIashNb-tv#lM_+Bgrc
zt)SppubZbKq%l@qJ;=oLlXGBcb{prKxUw>l<+nbVAz@q>_o40%r2kR&hhF3`P<}0e
z;&;7>lni7yBZLFU+zIbQ*D2UJ)UL!x8DyJpkwOJ6Fe`A(6&Vvg(D4A10!+S-S32!0
ztYocgwm3to;1j!tYR-~DOODp5tC^^{7PeEIlzK*+mYlWB2V{UOA9IyZppJZ{upwo!
zJ*Hlo&xpIX<zQU2YmPVNaj;ZgY?;V|J~99Pr&2ggy8G)-8iz?nAyS|k&Ma-(3AxA0
zfACQ~>KqmKZ*uw3;ExiV<*TS}aI-Nsl8I_KiguNn&nx?7-tG{knVG$8KB>vey7ffT
z{yEC3iy%O5>^HJ@&SlWaJZj;WFF5~~qs*(!%xTuYOmksM%ELI>6N^L;0nd;yW3#vo
z*wRd(qt<EOO$8Z+_OlpV>YMUi_`(^%e&3w>Ms6(Y_VTlK!uJ6<0LmXlO0_1LR8Q=V
zH5S_4uJj!V9fUKN$&7-0M&=}o+0h!jnn9ZMhh`sUNtO#@tGVn8p(Q@n5}flBljZmM
zmz6XZs$8syXTLxV`Nfs0l0r7@5^~EH?_bjbokWa@-e|Wf;_%AxQA+&@YO%WB`pdls
zm!}_7600xxY&<>rQTVfo#YkN>SWSfL&_<PK`4wTXD#+FO=>EE2(5E4vmIBV{$4e5H
z`$_-W?1OH`0JiAeRLz~9pvnl&lOK~#?$J~ruD9@ll(@B5{0fs^T77SRc5-P{=4+<A
z@0u(7iPI2SSt3~~bQN>m)?VBTf$#)jA!Mr$j4EgP*sFCq3v1UNNF{#5H7*8-wTr`r
zyT+z(F)=J+<9B-cG5Extg?{2`k@bq-D2|Q3G+3CnI!sgxYiPDz^QEUPZc3ouDNd;h
za(Wi{`Gk(-JK*P$MvDq}P8QDw-56Q*ZF+8MXTaaYY%k;RlCe7eT&I)LP%Tr_r1Ez9
zW~E8JirFeZcjb+nfM$qL<7F0O5PZpHvJ-0enbV~5P87W-QQNa&l-{mbF|S@yfzqsJ
zG?gHtEWJK+R&bDc`GSM*Dh*@Tc_)owM?hnU5=EWJwA=8m0bu#JEaTr4=^`s7rcB%6
zLyHD|-zFCy<O_Q*uj<`Dk2_gu)v24BHT6JC?4;C3fpBxxvTkjY|4g9G><^J?^_o`3
z_cks<5>&~d@qIYPz*)dKW9XV_UcV~9-A?@~0ritLbTNWZ3A>Kw)l@|{Q%J?^hG=id
z^ZJ90L4{0oZVVX|+$Byno9%P)>{!vf#<kvbwj&n*x1CYrMe42+oM@wGaD<qaXW^@_
zg&SKzN<vWvok;^28=>{O(nRm+y6e4SQa8z`(ZyyxWZv?Kds%FX8vl74t>2L_A!XBY
z@i8&Im>?VlYcq=LZK`8wc<3D$h^hEUML+A-8_p)uOb$V>?@f4hkc1f{Bz`WZs7z5u
z#pi~)$k8OafTusa>NxP_ov0A)o&`vDTKK2<_dAE0Y)n3F(*W(yYrwtAf*Vz5evQ0M
z$6_2KNVO_q4HK=kftBk^m+j1%@>4wt?7X28m5%p;PRv?n^iNli?T<X^;r@`45tINt
zaOZ=P{CWp2u8koc%CcToeH>SoE}!lUMkbCuD+Fnzm-j|0-m3Gx_#38eHoad8%vQ-f
zlq?R%_RNv7t9nGC(Y~Z_X6~nz8`(JoJsJSREih2di5=Cpq<>wJFqOM$PL_#r!+><I
zH$F3Or~)mJC7<#=ymXD0R*K;0foE#C2e<0C8z@#(6j;&COih?cxG7{uf*uplsk(1I
zMOfyXVgSL1N%bGr@eOp~jTeuyaF4i~^_qqY56ksC`uL_h?Yx@U>nkA!?GUw9$d0=|
z{mnpQNUyi(Sc558DYrR+7`D&6K>0TjnJP?`9409OxiwLP9in=RC@Nf7GJY+<wdCmP
z{s77mcTXWy!GSX#Xb|nDd9En%2_{MC-rGVTggz`u#k3VYQfj=<WqpxvFj06B^bUw!
zNA+10O1o@BR&*-vTlq}*r$zM{;qRDF9x<7eZ=DdsX|A_%cuOmT&JwXy7azX!Ev2wY
zRQ}_kq|`+>R!edy(6o5f$5>sM?9Ba)Mf@dFTjKM5hxPOo^ly8|g!IbiM>Wa2{G38c
zj3&1Pe%eVmCaxUK6b#kP^Gt_ud1G0^aD(v+>Vl<b0^i?Lz-cY7!}uvLyHbnmzY#f2
zZo#*PM^=o9I|Dz*9!?b&H@>jmKVf#Nec*}Bc(~kuSm{0a%gMUfDko^PYU9$Pu5nGj
zTJheB4E4;UomGCyKnnhNQq#-PD&Lzv)I9&L4ql=$7x5T7k<k`q*W;M~Rf!WKT`q+g
zoGC{IJ-9IF+;+T$z95KiyML&@dehokla*TCRLikKX7ghgW%yH#aH^3OjXIFYuNTr|
znxM-c4GTTqMiRwPLp)_S%h%}KdCY<wCr`=$vqE6zwOr2>6X5#J1%=)Z^3miL0{eCX
z`bgElwuLX_(&~Py9aX4pqw}q*wA{Xymq8j;OW)sx6T4*7$J!G}r;VK+^_d51&(V?P
z2AI6kWRJ7EdEZBRV;6TuWjc<|XUyL@VqxWAZsEe-V9B?D(w=M(!i<!X%|>j(KFclf
zp&gd~G?`44f!U%1qaQN3ZT%D);q^^!(iFPfB_36*2&(C+^hu!y<0A_-b@q|BT<5xJ
zaGyl5zyQSz(%{>b=i)O)TJcSRyeJoAY7+@ZMY<$W>o94}L?{lI+(p!U5Jw&U;AbYw
z@^P4SaG^)Q7G19_^*YmnqodtRDO>RMVh+9@YOkRaH2;&3PIUfZhi=_a>c}Lzd8)$>
z+VtY-TUee(m|uQZtS-*$C~?>De$uVJ%YwVg<-|I93&WF~#IL|1)j@_Eq@)~Fs$AF~
zaZjQAl@AH7!?T9QlAhKMVS19b*EvXmmd4@J6p_)Rx6L%Oy{66#VWr!*9qJ4O&YT=7
zYaYEMh7XU{iyPhb9c|Fv-*&wvmOQZ`IV+7@ZeX9NtK*fJq;w(!(5<)U24!NSo_bTZ
z?<O&7NTw5Q{C=UgE!6=hWMh;##;?-9@YQAn-MfbxHMLY7al*+5)B+=ScIOotMrZ4W
zo5{CuZtkLA#NE7k(J{S0xJ!)G?TP3>vl{){#U_C|eg`{?7XV@{6hwUzluazMy@&Qm
zlpR8={$9WOh;L_u`@U8`(A*sbW~));&6I#|oc8q^8L`{ZpG=~y{J$ahq`$*Rz=*sv
j=6{Fc|9?;Y_xyQ5Sugi^m8u5#Zvu&mq9&pgZjSjsCI2gv

literal 0
HcmV?d00001

diff --git a/demo/documented/built-in_meshes/python/unitintervalmesh.png b/demo/documented/built-in_meshes/python/unitintervalmesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..447ebac1b6e668a032c1a8da160c9a34ee5b80b3
GIT binary patch
literal 1606
zcmeAS@N?(olHy`uVBq!ia0y~yV2WU1V4T3g1Qhuj-g%yZfsNPG#WAE}&f6OYIgdE-
zupGR7_~&vR_J{2eyR@1rIiyO`p0P88{(sBJu)&jq(L>mY;Zlo0gNY)Gg6}AIG&F`;
zVyNE69`k<ATULkLXTCL^=6o3LC-5LEZZX3WPDO@HCk}^M0!$OsT1L5}p)o8I!!7P9
Xwp{Y7ADe^$>jwr;S3j3^P6<r_Ye<AR

literal 0
HcmV?d00001

diff --git a/demo/documented/built-in_meshes/python/unitsquaremesh.png b/demo/documented/built-in_meshes/python/unitsquaremesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..f8ae93b74bd042018148da7fcd09314f7a0d7e2a
GIT binary patch
literal 4982
zcmds*|6fe`9>=FhM~$3ai<t~{Hnd1ovJ+OfIg##t$l6Pp#Gp|^+Z2}W)ns+{Bqifp
zRAW(Hb`=pK*PSs@%@k2>z7*THA+h-~v`lK|ex^8|^LgBT+&^G{JagXX^L~9k@AH1X
zUuROj4hk4z=V-^_aE1iV^Z$m!v0lRASSc`T@Jnw<$}J9O*jIu6ev7s!JMU}0(J%Sb
ze_>Rb+5AXpv!w2J;Bjigyxk+)-6G;UqY5S}bKW*~7F%6iWd3K@08aA(F2Tv=i#T(=
zC{9`gX2rXSTTjg*2CkS!VprGD__mrqZ$Lw1zSC8w`)@<koXaH-m-kwmC_<nwRoA~b
z_mAk8-@Sj=WS_mXCqy!;V9jIONm+84psaANPiI5PNi2BU>!jf~dsfUj*Scq{7p1Ig
zeWLfR4XK!Zs`)RpVpyo)a8E$@(|gB<D|L9>qSV}d=6RCQjpw(A^F<C(u^SCe9r@we
z!7@)$yJ2#AkjW)s)A~9)he#|wr>sVom{*t{9qPv=cApo{Fz$X+e|G*PZ3Gs76yE!l
zFM7U?Sx1q`6FpzUy7Z#9-enXyH}OO&)?KqFwRJ5F{x_F!f_n9?v?6+4+((59TQ2bx
zBhYY&P@aY&e)ObrFF=K#(6ZAb0$j~|R5OaBY<#r1Lp{_`!7oi=W%-O02EkKNuErwa
zsVF2<sU+6UU;OrEqAcQGUzuV@CvO4o?Yo&HO{e5X>Z=l!>f%hN2Ww4>&l{hnZs)dy
z<SM7Xz9^j|Nr=B4VmoMXB<53LS3bS3TFyo;;d&|Utfg*VzVqy9MQ&L6y$Jc4oJ^-Y
zds0idhp+eYT~c#nXzdO{?{m-tENv-$M;UIQs(6hzhFZ#gJ{*g`zB(=1@=6%}W_VIP
zTIMRtlX}qZ`7vDrD3XjHo^90ZjF2ntaEYc8Ci!MsF@;GkwW1XZnB+x+NUbfCTuc+v
z#<23{ewos7G=9+IV!tkN8lkLaa^DHZ0yZ$&#_>x_;QEVc*%xp{P(>*DP6SpF%RKgo
zUn+)=S(CyY%)YrRF<YHFZK=lPwfb_Id6$<ui}*d;cc#~G@AD;`hnLdHEC1=X>N#w0
z4p!fKdO_3JS(!L4Y|MkTs&2#4Le)u~K<-@`WmJ!QEzzz5XOc5s$0geJPDLXQdh{Lo
z2yaWZ2(#kCrL?{yJM&ZEY*M?>m|Re{y8rCw%nzMP3HByxL&M7Zin!z#OW`&kA&wr@
ztUXA`NK)&9gfw_iJzpS+0%*m1!%%T*)uFzUr)EuCjg`0{Are~g0tq=Eff+wXLO@j)
zAc;n-z>EsE7U>YsU(aN$4M_R4Vi0?a!K<(nRld^6?%{oJrrX*g9w`hp5$j_4{m@ys
zuZve&f=F@G;SL9oJfP$`J>;EM&%XB*oVL9e)rOq5IGa$8W6ReWxGm0;9mFQ)w8!6z
zF*V;f^P*60wXto6!>iw)+P>WE-m|oKcK+Q#F&9%4a|*Xew^;h8U`@9s_A|BPqw|^S
zaaDbdGJL*z)!}kHj@9S`_@W?4BH4IQU5LN*)tFBnLl+HrJ8nU`2$h6B1=0nSxE8`C
zo6vs`@5M)AC56m7ex{XJNiOU1CT>^;(X%xiGqRX#s=^IF!{Fxtl~AwZ2v1aeO2+_t
z%v9<P#9ufqyUY?%iKpLz3IjmFSom`$g{+|<h{Rl3K>j<oMF>wNE`w113o4Rpa0k}T
z)#sXeG?^=#B)!&8$~OsGJL`uwzX*GGu{$AniaFNQ5FwZ48$)Uy=TEWoq$IoI8g4Z0
z9iGtj$WJnwHx?YJVA4md>A@6hX3#a6CrXcFsNl{ek|8%;Xhl22h&<3+!x(hcrW5*4
z7|?WRaf1tU6;+AH9bstl2DH~ThFzgxU_ov^<cn00n>IYrY=)a!M=-6J<d)Wn-oQ`#
zK-dF3QCRtd51{m*Wiy!E;@yPcCX+2ginYVdE#{XVgDbA2WuL>xvI#*2d@K@+grpn{
zdWG4y=XLpO+ekVgvCIDGsJpQ{E{6DSQx7xMy?wt(a_`ElOPk&Wq!p@)bprtcW5VPv
zh6SC$uj>!mCUh;H|9C2;%<v60*^4d1=a;dWgkFg>ZVQ-NNaN}NCMU8RHxP_665+wd
zl~}wx5(28`iiEsbg~g9WLT1tmr$=lag964$5bzx55}Oe%9iU;BAt7MSNzjmL+%SQi
zNM{X-h-fL$;6>4+9a#8vyN1^`vnGM=uiTc6C|be1Loqpq6ow#Dzz{r!=BdPk_9K`C
z^+r#7ofmZukuUy{5ag8+RqBsJNjLEQO(!M)_ul#`+rAB}Abwrm%Q02|keJ^T+11e8
z`Q57pZ-(#Yen6nFFunDIC+VMQIUOMdbv#iu^gA+VQaczne6<wwImtA<<}BzvXoiH~
z?I?kiN%o><)j-P7iU0^1DY$nV-h06%-a?#eeL*4NvRXB0IhLP{0X1aZP2`Javz}c>
zD~3Y7hGC?(*xQFOssm`n7{&$0-@t=dPILjkv<52FW1wIV#R4go%)($Bx5Xc3iQ7pC
zPB5q9SM5oiV+owXEA?ZoyBYWr;UD{wN50h(VC25_HcxEW+BL_Iewn{8DBHNSD5p?0
z>q-8ABnoga+~%Wc+X~D)1BW~tFt3=Nul<40126W$BSu}v4N6Ei&|9SpIDp%j)yklC
zG+!jwGgtG0M})3T1*!r;yABu*n0zLw9mymw;*eTbCb>9?&?hm;LF*JnyNApAt!&Y!
z<c_LCAH1tuIUWQ#`^<yNg=F2!Z3%<xPb7u=;fkP&P%`L{Hb$ftcm_A-G0*P_0rbZ7
zAGwFp#BTYKr}o(gZ7({Qcf6{<J3aGi;auacsu+LM&kvzlq!o3BfT~0y6&UT*EXz06
zK6c|;h8Klk5}5k{gkDh^JZ>Js12D&Kp&_7Z{z%Aj@YRL1e^do-$VC!?0zOB;Q@fwg
zrz0W2`K!>7EJB}(gn%J88_^=(M(9aIi?_vYTx0vb)jW}-fMuA)DTETiylxe@WetK!
z@LAAaiMYwJz<eNizywS|FzI#!Pe)E$8coYG5cySJmTxqvk@4=CE7Zm$uWKrGx6SQc
z&xF@4-_}hfFJrpi7c3uj<)OPNMb)~e#quR|Ca1%;VqwqP{dEzh47Wb(A3Uvh=O#x|
z>jN9!0buYL)9{*1P+f>1VFsaBKn%J9)IrKL%fP6EGyo-@2O+bbR@lOO`on}?1=leq
zgF><{za+Jrp(4XBP(#+;DWvuUyet8O5bE`lufpyZkB1z*ir2P%{ENVOH@~!lC1L`w
z_fVl=CDzWuU=p|GYp5YkNhp6}PQ@?CgKA@8Pz<UB6&Y<vA#3M7)&J{Jd|L~rU0o*k
lw)?aH)$@P<(dsm7_Fwqhk(bgf;QusE;G7`;)1npI{|gQ=NXP&H

literal 0
HcmV?d00001

diff --git a/demo/documented/built-in_meshes/python/unitsquaremesh_crossed.png b/demo/documented/built-in_meshes/python/unitsquaremesh_crossed.png
new file mode 100644
index 0000000000000000000000000000000000000000..2579e77c3886d2f447bab760731164c3fb3103c1
GIT binary patch
literal 7111
zcmeHMdpy)>+aDd!QQ~n5^D;Gd_7Q2EJ~=&FMzh<HLuDf|w#Z?ywMe3E$SG8`$vA!R
zC`#Biho!@4CMAbdm<^HhAwnm$;=S&fVVYmhAMgAB^UwTo|8CdszOUc)JzST#UA8uB
zR;sMT;c#oHJFFaVxFyawoWxn_C9v{&Z(K7Dw;_pYW$6@}G2Ug*=&S$T%6{}^Lu7pz
zUf+8^D>t4i9kS&}iG-h%#Kg|O=szS6y{W?C9=Fba9$SjTP3o3OOW=zC`}2R#!RHSp
zGAAvjLube2a3OEP=f>oE>`JAN+kd|IqOEAlOnAh>6qym}>xwcK`KF;4UGkRB=|6u^
zepu)E;6>A6??EZG#@U>_5#x>9+-2YYe8OQiO?Emb?-Kr~{u^deLEqVLlC6177pP?>
zgnmmKvIYMyXmuL)8xl(Ms;EI*Fw05_rG+<Adi&0t6$D0s)MBi5YuDbsuf^@bEK{{>
z+bBeCp|Xa|w)BsJ_}kXTg*iucsoBNHVV3F6QK2TJ0<S2sbARh0OaJjbk;}#G-s&7R
zGrf(pk-S}<f0siMk6Vtat~Z$cF>j`vwz3s-6p2}iG|oHGIyPXeJK_HPht_Vf3rJ{h
z4?lLI-D)dIJPk_|);*%n?86;<+|nSp!_%N0sccP7ht_a`Ry6jc!6CD%A36Er$<aeu
zm@{fEq<)o#6NwG6tv#6ikhOyQUYyZB%sM1Fsi`Tpm5o{V(5?+0JjC${ad^N?LTNxJ
zP5Lg^P{BiY?;*};9cKTr<RNahN+;*LPe0!4$X_Q}A(0xs!zS=n=#0hy+odyogtsiA
zbd_8G5-&Y9R*!F5SlkJT+e&WCp?St1fxd@#@%p1Z|5;<hiyduD9@pJh8{$}AV5$`1
zd+e;sDyH`-Yu=-G)G1HO4ob7Hqk5`-)y<8Sos(_DCl?A$Cn>9&c5ITK;_}0(>PDAN
zm4Py8lXRB66qz3Ow#K)f`IN@kyh2?+AjtRGeNDg7SNSu>1R|w5$WcAR`)6P3q~{xj
z3JTm>P;$lwVU+ago<d^9Z_A`u6_o}>blGyltt8vVSau8fMXHn(t8?Fa)7BbpvHkjl
z(&|2{o*uzGDeDHD!4sW94xQm$sq|E^!_MYdW(&DJRZ1ou{w9O*qPOjv)7G&E^}<!A
zCx)w@q)LULU^P4xY(>Jl18!Q;KT&3t%-UJgJ+;ME26r_%SATJk_Tm_ZInj;<zHIAM
z884H5`7Sl0BZ)A4x0uYltD~TCyZAe=Nz!}A#@U|DYabSGvh<f*4(}g$_wNcH2R{T@
z0YGbsKJHNctFuqfRtq6}C}P(WD`oBNH77O<*5~v5g#f>Vui;s3(ypCI!c)>9m7*9=
zY4Z0p{rvmS)c|fig$RciTgkzd|5l0Iaw6PewIPs!pmMT&ayKe?IQEh029QF7#r3s@
z_WuA%xIw1>VoD+|fO$~L!q6T#A+t)kEX;^hz!HLd5E6JL5h~$=a@i*{l8z|;grU89
zLg~3NGW{KZS9Hu()uq{Wj?+wLXp!=iimSpw(MjnuT1;o{TAk47RT<o)e!X`hPvB-r
ztroAwmsgJNe$zK_TyiTjVW@5Te=2_KSt!lS<o1u74licMbtcc-Lc7-Ox?OxXxtA^q
z&X9xZ>!{jFdeIm=vH+fsY$nmiQ#M%Nh?L~Tu@ddBBd+w6HT)&m;Y>p;e7%M5#H2ZK
zHDCFLJDh2bWs8D1(o#8)`kx#!GG+0i)M%w&iLvH&P35PtWU(KL(?Jb7NO>j7mz!Vi
zdIgQ&2JFna76NvL*XG9w+0Thg_g%cByrKQlY=ig!z;sjW<q5*3Vs^AkLi$Ixb(pXG
z-GHdcFw?oA3!(0he|7Pa{B=Jtp36{D;9Ec4q1~cVg(3{tb)Guam%Q(bnjZaNqNk|E
zop3SP3s7Sq)F>jT0Xg@Mzma~L(%T~uQ&nIZ`nbRCe9uvYPhh=?r0jZDnmiu=#-t+^
zDg~IpxCJ3cCZY7^Ij^U7w0L$*R~<md9YwsH4iUen%f2@-4pF$*zGSuG0NW8!!CFJ0
z0?4r6=(ElrS07k4Sw@nvMZ7Xob}YdqZ;OJ5jocA0z3|O<ErB8!h$3>(10X<?r-BCz
zNA(&WIvWF>?HE*oPE#g#@+QtAeL5!}Ajlp#T|tpb9(tE;)yWnz<J^q5U8NELboa#1
zz6G9gs0PpRYw%Qw$LOZ_6;XAMKCIq|e<B<H{T;tp7hmS^$q&*S>~DQ6Yt$7}jH7oo
zUk!Z9pV7m}DL^6fpDFYZ%2&*7b0nqL9kUD<b@bBW)?t*e$T{jnqFp>2vwYq;syK0H
zydy>+0rk};S@Lq2Wv-C_q{YtdRIADPefDAd5?B1Tk1>!xzLltVm+gHtmVdTEeDkxr
zUWvUOh9oCU=;f0eG;lcvi1s3NRpz_*Mhe^q0tzU$fcf^zJ;cb=8tv`c2`_ym#06P0
zVO>CW4l7Gu%*9-ZLV!BbFP9?j2H;jM8$NbBT_%c4^{59_*;c|HCT9PpGHI4dw(Qkp
z%=&InsBI>MJyMwUXyA@ZEZM7F7-@g*9Cgd}lI&GHX8(X$mSUt&pq$Kz*P4Ko?Mj`J
zyQVeN*zbB@#-vI?k^hGxTRuY%U6VCm-BMfpZ%dC9#iZg%bq_+3kwy6(?-kv&ztX4O
zXNm_b8Jkz<t^mPr*WxBCYbcwQ(2nhTf(riUd*BHH2z!a#i8GbPVG%|H>;#0W352TD
zI?Y$!3<uSQ*pZeu*8x^W0ISf)2&CWu1y(Oj$*c|tA{U_~8EGZl`frtNc_z8{*|75A
zdgf&$ma2XrmRI7fdCwo@8ygTLZJI+J)m8lv7@ZL2z|~A7X>mDcW{ks{0NKgt47Plc
zzXx`Ts%J)6OKEm>R5wK$ANVH%uo5sIck=Lq>b#-v9o0MiQ7}3Rwh7s_O!@Q5Q=V^K
z1L~QpDhAtd3F}JQs2Ulv9mDnp13-O8eE+D^jB0oM<ZqIcv$UdV^^$7vjOA-H*_U~C
zpllV!8^JQ%q{)M5Uu?hlqKH~1(z}(cE58bb|MeoHTT<l?0#4rhrvYdy78QAtE_VT;
zDniKvQi+VU;4f^A>{lbEvzczPjZYTIg&ghKJ&=o8_S-3{9#7~i$rhnSae!G`VsmUO
zq_A~y-I#~`HQ)MyW-M6xOZZuymC*W)cIBrr7InbXd(rxR$gdQ|uk5e_;-g%L_yAtf
zF?C+mMyT68lv&$5C9}aeVT8wtod1NIF?k-@I(FzEA}P|T34Rr2k!Ywn8*{5sZTFGC
z^Y-`!PIc~6?{6z2esY&J%vCWfdCl1&G6#|REfNW(7spb1Kb-mMAi>vn#)pvUe~QwW
z69>3aYox{ZDeEoRZL-BoSzIloB{Nf=K<;%CX|cN;pc2&~c$HF75GOeRvCD=_@?Kt?
zy2UTYjw1r*gF{S7;FK*zL5|7^h!4P8E&4!;EFhHFgCA4urkWQzmv0W|t_BLLv4z%x
zC%R%Z?b+QJMjy~#6qycgOp&qK2YyG2?QwTxYkk#zV%n9>r+iU<O=>TP|8i@(3Ob4m
z<8x2MrQJCjQ+n(0H?IRYQQ@Anj%|G%Lf5g4@2UvCu0O!;Lhe?VuY*9z9YeAOT3q(h
zwMW3i<{(^-3~pv5LIc&MW^uttk7RB>7*bA>i9qlR%tcUASMcy9G#6y2%QI!Fli@XN
z6w%HAaR3L3F>pfrbjflhKP;M`6;|C)x~<UTi8bFz#K9)$j7~BOOpUt`(O4p2`a>^L
zFvNe*1$LkeovjO<Z5lCRh6y6{2>k&|DiZuhYXTD2syB~W#8on5-rhJ}LDiU@YRL-J
zQ$6o;wR50tXC2WwYX79BA}Y#d2kt%l;Z?wj<cqJBcbMlBW>O>mT368~*&^{8DlhDf
zC+mQiB%ppn(1?g@tLXw4iZ^L+@T5T^myKx~0bm6Pykv1*5mp`(vn;H<%ZJ2USYhQ6
zG0XADJmsfli8tiJ$}3r3X?}EC2J&ZVBWyV@wo^4OVK)ETtirAEcesKHy|Tw>JMLe;
z$l}er>CfFMnKS=#7O;{p;MK(Q7}-*Bj&erMOFUyx_AksWjm$8u@e0&S4L#7pNGsf`
z+;I9%p)GBtn3dpD-cOWkl9;X;44<KaIbjbTvkqNc@X=t(wY8Y|V8F}CMua`p7-_v(
zCVjjLB;5kDzy7$X?%cB;qWY6&l^4Y5EtP9>`oG(DYK(hNh9m=$^&g6C)g*UP#dJO-
zFWTh?W-U=y)#asGEyXDy!Y{IA{cYCope~axkC>hNl&ruLqMiaz-o7==jrFCK1Rwyx
zbtwl0y`5#$GZj(a*y)cNN|?B`bmkkU$v({++K)A?0)wZg7nTIJ*b1QpkBm0l`n`cU
zNz#i`*g}Rj)Xo5zX?`0DZQ0Fp)F2<q>ZGhG03+Y#79z}nnh54BQ$cSt{Og%`bcPIX
zq|-6hu@x!wFpBD#EUaxuuIuU95S!);1*Vl92-#c|?E8gzOK;t96?D~#jK*RK1r4|2
zl<mfZ@|HXwfeL#kTT7Q*e%leOYAMCYR9+TbCOze^whdS?8+b7wXa}gi59=EsINcK6
zTf0**{R@BGqTk;w;^Ol}WH-k<wt#_Qh=`j@{1)-~?3P+crAQMq7`aM_>5}_FFTU!z
z+Gm&}eJNk51>f>P3X2w1B(O9NT(w$ertDQ17htt$yrD6+wVJBewJ6b{kF9_}+^)kk
z=QTB`OcbXg4u~(&6)Yuy_ltIv7ya2Z>pWhS(}y<<RCrnzH$V4IVlw29`J(p5Z~Ydf
z+%<HZw<1!--)ctYILoAH@V!kjucx=_rs;#?-L$uCO+PDxFt_fwb0RUH^Uejghiu?$
z<*yDh?s`f7^&!qtQ5r4f05@p(Qb(reE*^W*Qw}^HYnus)a)?tX5>Yl0P>Jdg##8R1
zAcaH#F&eqRbm}XcGZE?l>0*k4j1UFHSGkoCENY5%4beR1(X>`}Z}viaAeeL@qgSMi
zv1T$|_ks3c&horLMyGS%Gx&Ytl81{RM73{wAel{{*ZQLTGEHh*ZrsY)D{_V4_wHCy
ziQHrhpZy~Hc(waA$2CK~I$+!tTx~TnsBU~$3ud6AnXuC?o++g|2*PcNaQPHjVQ>%N
z`@RjJJA{Wfy!LZcpXI~P3TdGkn)_wZEDT7J_+UJ|hKV9(`5+F6v*xw;@SE8!JS>_E
z9R)pW9e}w7;ja$i4?K_>t%2XON`V{y6DcbbJpj)%zO$MCpc*??J6<JdrDwhCndgz<
zU)=CQMa?v;J#u}Jl&}ez>B}>FNe3^yr|MDhr6d~MsK;6d73GTCrwcFgy4S1gc9YM-
zh;Wkh`F9OQ@tWMFF9?2C?*{7(?}#;L3udnlBck9s1zadT{}h@%CZ=x{nms&b4lJxZ
zNzAga@@yM1y(k!LsJxw+78OQef>uN9+``H`uqyDxa6kS$d|UoxoQXIpW&2i4&n}#?
z?83YeO;~Uz+fauwcguS=^1$a4U(SpLO-2Z9BSy9iN~Oz?^AdL>`~lx7Mi^$IyI#Q~
zq^|j#-A-|76%6<y9W&E0T``QA+8>;8USli1A5Eov!YS9xG3#iEHT>#~vl=!&Okuqk
zlxx8liG~r``=1X|u0>$>r+x@^n=NG1O!Ko1YG^Ax0yq5YVa(BG?Flh>2X$yIzbdj-
ubJV4GbzTsb;r_U<`QM-aR}S9KvqGM%c(>`ze)tC+j%sadb$z@0ss9BsVJY(f

literal 0
HcmV?d00001

diff --git a/demo/documented/built-in_meshes/python/unitsquaremesh_left.png b/demo/documented/built-in_meshes/python/unitsquaremesh_left.png
new file mode 100644
index 0000000000000000000000000000000000000000..fc19db15a24be22fed9d5686dc467974a62602d3
GIT binary patch
literal 4985
zcmeHL`Bzg%6b>lIsKKO*m{=sfLyy=~LRl;Z7mx%B91DoHMG%n6CNxwQ6-#9iLKLwi
z3Kj*58<JYkU_=xP0fIt62!)7H#Uo1)5k-v@jESTZY~OqHFSPmbzI$ixcjvqJn>jCg
zlaGh#f~5-x1cIrTr`u)%!FVfyU?d<KgD-FWvpWfd4>owYxqh{;_}QP03B!Gt-TnSJ
zqtitsZ*ad*TIPA$*sG+r=I(%LQqbfTRn^$-zmgviLVwfMX^aRje0Y@fE)qgGM`IDb
zaNrV-L=ugt9Ta2RLS$~}DmJlU=YKcg+3*AMfV)jWQa#~DO~}Ky#vxLQJYk4F6&ui5
z_n~n0wz;C-PTh|?5?}RLnVf9!J(t<<<C{=<_9VSx=c9R_7B1$88?%`ka};?x&+W_Z
zS7mAEu$exXX&yneiiuBF(Z|ZeimC-{(%>eBkME3S${vowOneF{F26O_npP^xjlIX(
zYtKD*mAPKcpX|Bpy-jApi@RYaw9*}wtf`J(_(L0|dw5dm((T{k7>n>}tm=!c=t>J)
z?tWaBhg6oN3fm}{C)gEOT%z@O^Q5ngp{yq%F1R#go?tD`yNf5#;7l@GCc>G`6qP4d
z9ET?mV$PcsRS@QDqOtZyqlL%Wvt=Pz;kgk+r_*TR(vu{l1;fh}Aj(RtaA8f5s5hzp
zfd7kwrXDr9?ESSGquM*!X?@os)=zH^vKgIs?WxG-P0POT9bC3{O+L>}d>y@8U{=4}
zRQrJQNR-8p6e6TSYxQWwt(121H>+M{x_kc|MQmwxiDFEIrRu4)juAVunSL`)-^J5k
zWiIZ}hWh1Y(WGZoodG$T6SGX`6jroR<j2$Gf&DGoP<N2(PPi8@u1cGDcgR`a2<pbO
zE5_}(ijh-S%%<%Cl6JD$=K)8M(nkEQ$Ekp~Cj6HOD$5yOlZhxdLQqTqoe<jYUl64b
z%6yT=nvmfO>MlT(5-7x*#!7|oms+xAme8@>v*WHiiZ8Kr30sy3g)Ft>K0OA7ECkF#
zA%V7Ba{)f&<5P(81cYUfgdBv5_KGB`m-LRS8}(=RxV$sQzGdWzZqVWN>L6y@9`hmn
zl%Ds|Hc5h<b>7<kM|-C%eaR)7p5Pffxi*IPLh*PxW2QI%9W&tQ?YT(tt&}6Nv&^`z
zu;mV4=U)cA0^(#U(xBT!7)ReN?PNXi`5Nl|cb#F~PLYo|H#^QY!SZr2k2UDBW2C{|
z*fI<DA<c<@S2a__u@hl&|LpiaTV^$FSN%>Q0(gir2i?D-k)rwuwX7Q`syx)%9Yw5Z
zLLmn_aQjD5Bq@M93>RS1BAy;rq;5PMnJUO7A--sFo@;r6(f*dc$l1Qu(`SQX?mmQs
ze})1ZlTs4W(d1R3M5ksnxr)YGlt}mGlvqsm9B`EeUlQts$2?~$2UqsSAL1vuq!+At
zN!C<XjD{Rm6frWc>1N)Wkts5RC57{~tJZktY!|%KyVP#wL#i|YlL#f9DvigPE5X!Z
zl3~7sco3&zZ%Knem}H3a5c7+uWU!`exeA<!ZQ%(lFsW<@e0ZZOt4c?dTd*uzpke2+
zjVA25`xQf|u<9a+>I;}R)t1}eg?ZBeE4?_A%1Z6Q%+)-B2Uc9T19u(H33$PL=5mS{
zcW30$SW{Txan@{^5mvZ7oaj`BB9a~eqk|RB>=;R|lW0t9Gh8_EpfJX33WgG#T&_o?
z?dfu9PSkfxSz1zY6S%^vUYkS@JdbopV{l&fkiI2GLFyu22W~J(fUeS{*^m~3Iavg0
zN%+^ixJ%H8Zv?{wjd%bbDYnrSU%k$s?c2&<TX&EUQ#oE?Zvx(y;lEfnQB<EmYnGCb
z?JyKDMBWhE32?tbnWH->2_8_0goI4PA#D^@IfQ>17&7Qsx^od_HWX4vWtH59L>Ek0
z0TdEUWlgm~AsL7=9STu{%TI~FH0DPUoviUidx^nwEoJ(neI{vrarxuSn=QZ78^((@
z{wdq;Dgdv~?uaH-{P?0bJzow8yIcdc8ToY1%i$6c4~&pO7xkiV&_(?d(x8h?5`!+H
zuTz6A8s3YB_o6`;-L+nG`bUI*|GS?*&_6ESJQK%OCvj+20QjXw@N)NYyTl63_#5X}
BwCVr=

literal 0
HcmV?d00001

diff --git a/demo/documented/built-in_meshes/python/unitsquaremesh_left_right.png b/demo/documented/built-in_meshes/python/unitsquaremesh_left_right.png
new file mode 100644
index 0000000000000000000000000000000000000000..30f21543a79176d326f11eadb7a63e699cbf685e
GIT binary patch
literal 5900
zcmd^D`CF6Mwx;@2X@N+wm4Z=D1o82diiI+ha7z&Is8DNFC?X;Vr9r4ff=r167_njk
z6cmKy_Syp?QzU9m3K)z7L537l0g*`w1WEu+m;w>*+8;x`!+&so{MNJA+H0?G?RUNJ
zPW#%&%iu%P4|Q~O40d{Ze50eY!cRx%J+|%&u)IB(Ce_hdC)?@q)wieeN4kQ)Szm9I
z+9FS#5*_Pa<FtLH_sLz)x&(ih`k(Gwe?=G((pX(15*h29oDh|))am^Pj-XTKl%jKc
zz;MOyd1T%Hp#1w8-U^*hXI0k(2I}zR8KU1#?{iE^*Vo>db1VtD@@nLBqUwTpYU+(!
zWC{1NvsI>L(hom(kq#*D_U5Y0-OSEuCGFxoi_B0QVKzxqlQb|c_oC06@1=(x3EpG0
z(~-&EK-XS6&;jP|*@s8yq2D4iiODY8sIBp71~X}H_?A|}MnSeZrbMcS4?0-v_NB{n
ztc~hf)zv)9w9s`pg6PGx9lgy5?332njjZw3(uV}Oan-%2Z*LCOvpQ$jtWufR*fsp9
z8!t~|jK$8Oz*EuzWTgD4D;yqTOkla)Q?csQVAT6jSM&U*p4q;9a8G(0a6|5uKnYVA
zs?HI5-WwhSBYq<NA#&eG)z$paJ9Wl2DnVslM|Ww`N}8jalz8{Kkm)!w=_pv4#;y7p
z#GbtO9aFT_he>V7-Sq}9?1FN#we&tgUePyD^>`2D{!6MIIg~31Gr<w|*Gc2juX41K
zwI5Q>OK{Om|G>NZ<c%d9hj_l9m6~j7qf^%P8PehglG^yPEVKBS;3h-ip8@=hOx_)}
zqH59?;%$a_@`UK7OuYDBdEQuuEm4zUybhB2tj4Y+M)%rpw0o2nP>REc{cJtT-?Uma
z5|o3g7Gb<AEF>UjWpq;qUQBcMR19>(LeEdYS$)s0fvTIBW?FD<40bm01Lx-H)|0)4
z_C}7*4&0(GZZ>z}bos+&5wAvw>VuoEYiiHel!mNjl;e88UFpVS&eP^-H<|NSL*}!h
zRSZ)&;nwavT+$D>GvvP0Nu_@Dmmj;Ozs&d~Xi$2#%rT`Vv|Os_s<*bvu)aE4HdIT9
z+;Tkm-k1+PI4$YPuhC5^y!diVtD<{UZk!`2D5O(b2Mq1Ac_dcc77@=Q>TYcSe>;;`
zL1_zbz?K-~#8VFR8{VZon~Cfx(29*TzaPb_G};`*t*Oci^4m1#rz-PjktM~$>Q2lj
zdL35qZ(>_#sw-VIshd?<{XKcv@JnOIXR7ZZOXbauYSd#I#lI#@?qC*K0Dl#eJ@0rl
z`SB=97jGeA+c~Br+0l|Ox1*h%yy*ngZ1-<WI7P*&^mfVrrb%sVCdk7pDx@t~Dy!?Q
zLw~>#;%X{M3guFec&8LsRp(5;5N#8~*1B8v8>)V)8K%x**?y(c%grE5#_m=~_b&%=
z#u2VX`g18*RdAU>l0$g+y9w2#50+PK!Vz3L1GxEEt<TAgZS<Jz<a-sq9m_$_k|j~x
zwk_19ROM9N_{YbiGUF5>W+8f%^W4XIgqVv0%jYkuf?SCD^V{ZluEXsQxg{$drM0X-
zSv{v&Z_kNq%|<542J`2{ujjj;%te%jY+_B15nq)>h>JX*kEk!!%yqF@Z1@dub_*_9
zLh4~ybMKNCk6PGkSoxqv`h9<??_x>)0U0Ky$6}3I(GN#Q^T4~?KUY07Xe(b@BZOZS
zHQP2FcxO3IA1YbU5Pfb2HO^wq%%yJ=D{R}A0{x12A5G{FB69glZUazhew%2ju4Nc?
z%Hr>F`*dOh?{WZl@t^V$EGPjMjwUbuRI6Ho-0ksbb5r{S>SU;HCA0<u+Thw=ERYL^
zMVjG%bqV8>kyq&cJMom9mxj=D^9*e^=Ek*}$FS{JSQLeYcF+^q{d7XN%7q#iHHn?J
zI;36@M#KeE6l2XzlbG9@&nH{0>Iur>n_a@^mDown9qZ29@07A9u*$`Og&lY4qFhhu
z5()*_qN3uSygN=QBXVVP(-aoTH+Q_upF?in)iK(cbQm31b9M+WFJA0v6Q>vmft-q_
zBlKCN)9wOZwqU9~=#qZ_%Jq|#m-lF4lI%0k)^412nR&so*RDx@U><!GnnuDpNP2bU
z_gb@b62gFXzyJ;pn;e9gazWt-Ox~5+Aq~k{lW_)t(xvD<t8u|Ddu7z<lPdG;2q5Eo
z^7@@pHl*&B_O;Zr^tS>)hBGi2h}DconiOay4QL;`?z~i|l;l81;tQ`WZmN#=rL03k
zW&YXZ_KwXmejG%r`0lk<GSQv4*(s%~z?CRX_o2%*dK|L_Xl1Jl71^+XEA_tGd;x*K
ziG4C&jZ#xsouY>_1!0?U1jYtu;&o5hU=TJ?s#~od5air*h2hFUxz|QPuO_3bI}cDm
zTlad%=_qW<@`Ft|(M>Dx?)OX`iFIhxcI2vUMNqJsT&Ng?UGaCowL7oaDMhP%G~^Tx
zo<Tvcwcgmc8BIt?XvV`q53X}{dm6ykVY0nAS2=2QP9emCkqD#4xT;Wb6GC-XVWEzp
zJJC0O$OZC$VT}11G1+_Q1)LPLs1g=kF>bZUXcQAdOIFLWY+)S>*4g}u=I)1p7FtJQ
z#B~@y(NGZh6PeyBrxd07Sb`1OclNBpYt=gNPoe5Q9|=jwL`F3jA0wkhV&aru5%Xow
zO4FS14cDfru{sKq>Ai1H9H`s&sJ*Af>?0?w6ff|0ORtze?ck+l@?E*6#{{fT)=!Jx
z|1>H`a?v{fRnZr2?~se##<_4K{jZQEI5)cIXU7vP(;MNgSv^7NGb*xdiTk_;jB~sX
z$PFv&D}uV%+lhJ}$dCh2P?a9k7dJ9)wHAx<6Io(SOaABVei`2{6ksNlfFrP6-;C8X
zb2*#M)q1-uO8z1aR(Q+@z)^Zw+ij-UEmdUzSY>M9R~?bW)jB66<YD_*0)=>1JGL^u
zbNu$jM(fhajNMHD3+EXQa`VEXVA#m+awrW)nAbNexOPh>v$qlPzVobvpDDt@yxl94
zxq>Bc2ZD~9`{vrZD|}g!ykB@79+mn`wk?e5?4ge|1QE~Fqtb}UtCE352$mi6;LkVI
zAH|DXeKr<ctC5+jyfmqIzPA`Yp*#Cq=*g(N5N5SXk0SKWksI2_z8vg~%-xtFdSYFg
zx(Qv6mj3Hh^{E7psGo!Uc6n67G%aAa2!#&BO>y<srS<0i*8maz80<{qZp`qNSeHha
zBaHCw1q%l(4c4U}m=E>-A2Q$?;s!JTk%6im1I7o&yq#Ycw|Hi{@!SqrxmH%XMGq96
z_*rg$o~pY(t$-sHT`|_&){67CX9C<DUQwi&9lVg_P7mI*z8)w5?Y{~Y-Gdi8H;Z_d
ztkC1QU@wA9ed^>pITtq+g*Oad(C&w7d|ZDMSkbn8&d7Ch)fuh$yKR|p=gR_Zh>2ca
zau(F0#k&;|EY-NHgYza49O|Fu{+Gy-c$xYM#DM8!u*pA-?EP%3Og%Grq15EVl06n^
z`Vap;WMb#s1U*vXZ$UwH;6H~<T%3<1!!Zjq>{%~m)Q5v#UV;XAoPln5$r%~7bMT#x
zSh(^LMyRcF^HE#nbEux-8VTTSy%vom?6#+3jkpV=wL?yflQ|I5Dx*}qbkY5-pj$jD
z4Vmno<M|wlS9mTK;5!(On%D#*&+s$YcMReI+lfxsZDX-k-?4PDZ6mPny@<W%avEE5
zw_)+NG1*<D!Y%P9!_rEp#arp7YV)0wlcUByYeGcSFHRo$e=l>q$IFp5UjnJq%KVr+
zo~HPwSH7sbXrS#`p?}3pqxn?6hzbA|iiWX%+ad%YW@#$(m3jaxVt|#`ec`vC7J|8Z
z%c{T7CUT;8EH(z2-vqJxz0Q9O(6akJAv7yU^cx`<=&~Rw!<#PePqo`=!H42^J+63D
zMMHK*aVY&)46sG*6WOB&5e4sNY-gLnNH|ZHnEPrIE7T|rA;bO(GM*z#0)6L86j*NA
z3|9^^o?gE6;6B{rz8TQh)`iJ7)7Rkqybuk)5p9tJD|7S6l7lNnYvd<@H9Jkdh#2sq
z(J@hB_CT~=^%1gGBUPYjMO=YvK2YU}+`mGqKp+S+K!e4h#|{aNHJ`(To5k2>v2#CT
z<n0WwbI#Ym#A&A}2VNP*JWXn&K*0F#kSv%C;C~8WV5_L&6o912LZfhhPu_%MN?Czh
z&m9H?v_>PdEs+A(e=_!2QX2;}N;MC%S)7l5+))R<Kt)!Gf#9VJ!h+#`U12ph^})h-
z=I!0JHqH)Hu+Zivk^oZ+TmeG{*tr%tKNb|OWb!g<TZ9^<Gj5@gekgj++UT)dk&#K$
zYJ26eg$61zojya<3e<vqL~R{@mYb9{FM|{MyaBDT?|QlgL#zmS^cUS=tc!d^P;RCs
zlNOZ0{gVqkA!1majM3G7mdTVHg(2-{K52@E_}%E269IgCCa*YUBEA|U(){-q8A25)
z09z8pYYgE39W+%*Yxpe2f|={ED$(NRW|Uos!pGNTMmHsZJPYJ1FdsVqH7Yp!CcjmY
zjZx_()>d)7O)-I4_CFiIn#`@POnL*e6fAOrkA`glbQXjF8rdbchN%yi_&4gdHJ)YC
z6U&qxhJ{;Va`NTwB{czpR5+YH;S|0Uq_Ke@&rq}~8nJB<tKZ6G2Pp%&>SZBt3GYr9
zBqx`5ECrFB(0v}-FmtGCNnQ-RGOT>oH?ebBw5){{FS}>t%ZdazxKf>*{1htzqTnCn
z-D$Jcq}-)cEqXu`ID#e^c=VShXlMQT;@F0{5S;csfJX|zjix4K3(4+@Es3^;W<@Hr
z2Prun0nJ%-ijoN+FsTu!b7!x<s}0<Wv;UVi5Ovi1FEjBUb)WzF#@NwfSuLc2TBz)A
z(3S@-t)ZR(T$r?`iGEmO>$~d!Llfug+ce80-xCplsWn{bp(VGh7*y)$`4i2{0s^Rq
z^zgi;pI60_?m%?y$RC2Ut_yU1QQno@>M_(@SXKfs;O9RDA|A4=J51pP!RcsRlxG<V
zq+FnH6@4_tzy#*C*g)RT-c(W5Pq6)ca~KPEf3(vTqwlI~sXcj*9D&IST^tgz(A~G>
zi*E#Rim+MCZLy)@+K+aEJcN!G-nWTvg7H{b-c@j|4l95|KyR7<RdV}Y@n|O~M6^iu
z$HL=44CJ&Bsc831tCbY);PJR95>|ku#Y<?O3t8R*NwH7+<$13INxuZNKY5X;wDvr&
zI%AONUuQXYXhUuBD*6%D+YN6=yw=Y##V<1)Fleaz%<Rps?|WIEW+b}~Z{?OGlCK{<
zG!k&lsVzX30=%PlJjo1*?>pd9aAQd509<u1!j|fV2Lks(#T($?Fdy_Y_#!(B72ZFR
z67F6Ct_`z+EH{mA5-%|V0L~GhspU}hCxpn6%%SIqAs_tw6n*hIWz>hmQFsCzYJplG
zn!uh4Fk%2GECkj}!8BR1^Ra}(C^af@^2!GRd?42%Tmfe<V$9>P!6c^dRMM|xwlt&z
z0zd~uMK_^;A2L0T{{lAkLb5_C2zw7l2r|g$^ueYvN^o5q9p?x#>Np(hGUyf%0)N0o
zo_sZ)kBEAO^(i#o03hOsL}K`5IOu1fWEMu2x$kbN2GY=ULaYQzYcELQKpFKJgc=RR
zLfIfpIFV4k0rDSN@Jl00EJZ%PVptUA52=Et%JdF<3CM76s2+)|I#_4&jbE0B&HLzO
zFQ0Q8WJEPmJn$!WT4?a@lNuXhF4{L41jF)VpZtPYkBsqPgja-2@64K-*;Lts*JJM)
vH1HRcW7af#)pUk$`oHZ%?EiR&o?rcSjELNRi4g{`+&VjV_;{4NA36Kq6vox5

literal 0
HcmV?d00001

diff --git a/demo/documented/cahn-hilliard/cahn-hilliard_c.png b/demo/documented/cahn-hilliard/cahn-hilliard_c.png
new file mode 100644
index 0000000000000000000000000000000000000000..d81f3ee0b5b29ac9394a4c8869b59371d830e01b
GIT binary patch
literal 93097
zcmd42V|OG>)Gj=eiETR*+jcs(ZQI67(y?t%Y&)6Qw(U%8zI{K>d(Lk-yTA16wYpZ-
zR_%T5tHKrKB@ke7VZVL*h9D&=ru^+2nC7={-{YXcK)-xwgin9_M*K}mOjy-3>mu7D
z%S<i#qvvhoO(giTT7KsDMuL@d5^*n(ie@O+X~KzV>SSUX_}vA}Vu)!3n;A+>3>;z<
zEWyQ|1%aUAEZApywMTG@`)SiUD>tHXZb2*eiMqU_;%w8yz-d{}r>3j9lm_O1WFF&)
z$nV?#e*cpENh&J|lC&jBv9vglFjd8eF_D18NSh4BNCYH(jpC$z!2iT5S`7HVOW=k>
zqoIPNm>m^`;wMOCZT??cNS4v}@nu!;6&bWeLLJb_n4+%-vCQSaW})Ka;;ykpK?gbw
zO#Nr_t-|+!TM8X?1o*fxCL`^gN)OXFJ8D?@y0NzySzVAukmJ4zk%&o*KK6zkMxqS!
z9GrIYYF7g8mB@eo<Z}o8Y4;{7Qy}SIH;mViRB9e-*vxOa?Elmi2GUimLg%hf!yT#D
z?V~0jDTjQV3cciiG*?WFV$`>fK*U9=!xCF^MXZn(s|GI5MZ}zxr%3UiMbcoE<Whk^
z1enxr!S#Kz^T+3{PgB+ga-As?@yJ;UQG^g3(-1z&>F1;146}kj=ptnrzettO{l*2_
z|LiH2Rx7;w9x&|<u_?gGFI1DaNsJYeF=5HPW?U+4KLTz-MUYN1{=5XpIL0P3cFYS@
z@y0xVzO7m2MbUq)NmmQWytuCuYlne}Rr)h$*%ty-PjnB`5~WKE{!Vrv($ULbVP(d~
z3XZ<y`d7yUs4UEk_=Cps{n?{5Cg*F4j?*-x`*7~boaW-?Ml2Mx2=^cEKG0bZ>GC_R
zAfT}A{lYd3;bCDD`Lja2dcOoTWF$`aTBuTXQmK~(Q68l$_mbw6xn9YSJ9#G=DSq-D
z{bw7|z+e&TUKm8DKDlwN#qU&fI+JGO+-xqm+^`0`5;CD~NenY3YUp&oS(a)2@0KQ(
zt@y9Xm3d&tPaPCMhP+-80T~?u2J>cZDx7O~j#qQ@FsVWnftL=<XqDzR%RQ(jyF}ea
zM6oV{EDRth*ZO&V-eMXZwV{$j{OLuo<n$O_Mw|P8mnl-Fl6UM&_9#Qc@7y&M7JA+)
zqPnL~gpj8$z^BVjVo;^#hwuhG7l<xLa;=+_%}-e!9zdeN=am**zhyQ#yrh<td|iQ@
zQ&iGC9ki=p<75o9${cvQ(m>po*VW6_j*&j*<_x6kD?ydN)I|mIijJkiLg+G*=~@c@
z=_avB_M?u86W>bb=+jRcd;{HsZorOByZD?y(Ml%L&MLPOXV?p??#L1*E4pGLqts8b
zUKnCvFr3(&%vb1o4@=W9!Q<@c*9h~p*7ttRzB<9t5NdVI29FQ~olY{1ZO>vM7J};v
zyXC5R28s<n_5am><Ut84>>v5oJ%+)Zib4zh=?0HOJggHJk5o;pK^^l>vxRaC#T&sh
zr2!Xrjw?Pf%n8F!XqOO6PD{=}my*@I&AjCKF&w;v{9^YAiH9~&0{MglWsU##%91A(
z>|!rAh$YE==e_XjI+1gno71`_&R)1?p)bU=$#AFgv`+#qHz3FBPPl$w1ar!Gi;9e1
zd_Afe$DVb~*gP{Hvmr#2D^Vxq9D-A&Qlmy5qzZ!|Pz>Us`sytV<$F>R8!Gk>%d4~V
zxmax7k#*hW6C?9NYzDTg3^nA<U;k6!y;h=9y6jxRZxu_KFxi4`2uWifu*}@W6s0$B
zOy{1MAUTSucZ^yk!|yIUz}fr*%7BEd|3w-}FY2vv-;Wgg7?3Bb<hI0?UWcx8St|&0
zy)vzOp*5w<DYw5a096Oo{MbUM+;vU6KVY@k5~C$>@Qho-nbY7+Mp!ctLJE2C?dn$X
z{av~)8^fcXJWqwo<UoF#CgdDVVJqo~DqToZ8iw`&Pzsw<eEx9L4af!alR33K$rGlE
zK&HS!pY3VmdQC5^XXG<z-r_>GgDEG*Mh-%i&TBI&l_DFa9_EwTde_T78LdoeP60Wx
z(Er9mWf<T?=mVprVZXTay7!BWb0Zv=>Gntz;~=9$$a9-o_MUwKfC0d#LM=llJSFZ=
zZ03NX+uhEg@GlIGP7Fj;Tqqz8q#@-R$#dm8;T8Dg^O_1c?W|)Hi~n!$H2>|rRJt(7
z*?k3!vLFQSQW!ylVgKS>4KURaex>_|<~H6UJThh0+PBZjE^rSeepWv-)1gOt%PFl?
zkt&hgPhxqFI-M?!E}iZ)$yM5$<1^8$-qbBNr^w<ZS0mm3#WI&5?OA(^pM<eH$KDYQ
z^%M5bmk}z*&u17Byig+F3M65Kv%pT?EAve|6?bjArPB|alY7hN#WL`qD3Jpt48q?(
z-~aK}e|d+?-ZO_R@_&oJX64@`-L;6YH2-S^FFyFDp>~St3hOtVA6rkl;TL&PVDg9V
z6ut6w+V?Ya`NupcKnUZ}jru~shw~&(_B8V|W>{2>jsdS-k&PO2jOiyq*TGm)O2&F&
z31#MIe$n?e%0NMH6Za$DdOgfLV00R{?DAYg6c*_7lul(@A2+JpNp+$98q+<e!lO<h
z!=o-ug~2>$FInQr2K9P8&4%Tt`Rbl0;qdC)J}D>p9QnV|87;yzffB(b9PK$C1#5bn
zPgdlL9V8j{>U-R~hhDMg%H*97M2YMHA0{-D=jB;<X3&`|T!lWItS&k}(H?rkz+%yY
zr()v6=N~qeD$}M3-VXYHXEDOLeOrnn;lMjpYM88+=xRrNN-L1v%0#j|P4*Fx0CIgq
zDyA@z?c=vCt=EDea*3X6+U{FeD~@j&W6<#I>4GvbnngWrXeCB24%oSIJtG|6dxB;P
z-hs9(nei0Se6^cmxj99y_w>OCSu}?5L)(TtEF>=Zgm~jc`D&-JCKX<>@@}q!%XjMH
zWgG9`{!u`}%4`cH?8YU=PPyyDD`I+*|C1Bq4fvU^i$>TY8S&pWp^#E`T+x;XaoF5}
zvHP5g8@w?ykv?m_MRjMvWC6tbM=nZG)qLAdqki-?E@t5G^*CPGpvP&}0Wm?CzxZ>!
z)dRuCyYiG-3EXN0DKemm7`j`TI$sfF4!BUgp(e%dg7g0GQ@lqGT{s`RybU&2dwV)<
zC+glYIfXiN4fpuL`|q(|7=m91Efxj>Iw;(yNUpHboFm(9w;!t*SJMmu0U3U>p7^BH
z|J_Cm&5%tg9seky34D)RIz6eYqWDC?$%yyRf5^YgjSu$f$XDrz17?5ZE^r-RxCQBV
z->lhQLU-7XZJ?MVu`a+TTrMxqO;~YI5zt_Z8r4bLgPA;k;VP;*VF!s^YM_D{xhkRD
zBx0y@eHFf-Z9h>)(U)}5uDhFnce`~r<IXX9S&H0cDde90N~S!>8N`~3?^AxBl?>HP
zstq`+aRwuJ8neA?`=#rYdRZIx!uoP{<+XbmBp0!T;5yr5_U6l1)(;%U0F{8YlC?k*
zZ_0ulu`W_E$Fb=cj>#x-1`0B?D4Ye6J57m?SC{Xfrw7s~V?2wq23@o^hjgo9vzQIq
z@a$Hcqb^zf)|TI;zl)^ATO|1hD)zG07erWk8arW=<%mH=OAWf@{~{9Q`&!}Sy!hA>
z3Z?8O(P2t_`cw>foObSwwq>E%OvuNvWfO%R?%}7+6pVC_#3CZ5G$@~hyfc^HRh5OF
za-vy!!Gh{@5X>QZbqE*|el1HiD>0C7=siagPWEd_s>!MXi-teG?$prC>Zc~+ne#n4
zKu^iIeir_pEXg4r6%tD-|2#CEWxnA|Th(vLF~Sn{9VTM(E(<yx{s_PO3#>lM!jF;#
z?fqz*<=E1UB_QP>@b_%7d5C$8+dcg+6$-cvZYpCTW(HTNMX&GW=>?w>G&I;FKcO4G
z!%63fkcAmyB-vap3{oBxWVx3yVE-^19=si1=k}%iWuO=B)*1z8KcC)T-~I!KGP~v<
z1tx4s5ov@==^)R;#T!<}Z-Lu{%H*4+{x%nGY}J>sE4Qb~6*uN3CGAQDcw#Pxaj`&{
zSjInu|D`EGf&3;I*x)V?46SiaeM<l1_)#!8bpxTMwwX9HHoOCFW3IzP@3o5idyVsQ
zv|DwC1_{%B=AjTAE9N;^;2O0sRg&_{TAM7UtFOU~F}v&jYfRtZCGl=#q_u|l`+)iz
zy3Nq?jKDqPwBwrD8Ex0qN4J0jBU9(wu=f@{pPd9@){Kk8oW4}aOt?UzUprt$wX+y2
zSM@YSb3op2&LH46pzHACS<ozpsmIyeam)X?q<#IU)R4vBjXk)qF)5|bn4qWQci%1J
zwB%$Ta2N^XfA1!a_q|6ucAsYkf^hN!;lN&)UYH(%`HwvUmW_hV0n;D5%AWqpu+bZ$
zVWJf$C64!WT?ti~OaW1JC91C}IYo}Y8wbv1$oyosS+sxw4=Tu?cPFVZx|-?6?+Uf?
z*Jm6!Uu~4NnODpGPbs<jrPg40UAM$a`N=m~n`S-az9(22WE~C^iTpzyu5c9IuF|ic
zlDeMU4}*gk<F6K9+dBx2J>6OT9!MTYjB6Um3|)E-K4A^^bNb-{=qY`3V@f~&smOZr
z39Ax4uy4Y^1VB=Dv79Hl!ts!&((V6|`Bc6eq>QyI9mKqUQ^rL1<F_5LXWpK`BWJ}9
zazSTUx?uzNe~l<b8Mum^2Kl8S#yOSDD}<Sp(J5AGkwF}uxDNJrv(G4@g5m7yNk|H~
z`uauaO#crgTQ;VU2}70vLwKztnfe5?QqocdqN>+KaYw|R?$E~hL1<AqMa-$aS2J6I
z)aGCHo{(HTexTiFZf}mPz?&no+9ctS!6VJu&)El4vg4$O5f%RIc4vm>yE9n+hwgud
zpw$8wV?Lx9^u?tXnz`XkwC$ZZK>$V`T98L48g%#B#K+b<hWJ!H2xGua)@F`Mhy+UE
zyI0Y<T@-j$ECE13!-_A*^ji3|0He=rPQYwUfx@IasXpB0Z=XF5^I7aF$jL0eA3-9g
zC&~A8n=A*u>a0hLg?O}C$$#$9ehUzz2cbz1_thCjygXB{xzxepHWg!~>ic*_YYJ)6
zN8B<@{l-Vn#kd>@AY3@>qNUb-#)LQE)vM{roX#n@dT%awoUJM!`C-#)L$0wsx;XCo
z0IdEuLr?AI$ft(TtemB$*I2*y>1+M_K2pNsQzz^@|6jPLREI7#kbP0OKjHP*dovKx
zAhJ<QqMEVsjKw2uu4WggWj!~D)6GyntGQm9(sS)fhn}O13UT;MD81$rCjzoREEuYD
zL{uF|>;W$q{6Pfs(DI`3Gc9B9h!hfvzexqI(M(4E{(9a}qT)~0d?o)#DEMPg+g>4a
z6e-9@WTDNqKpGNaptBpOGW4=8brlv)D*FxPtMfDYwY+e^RmCCYMx<e}n3E9do!s{Z
z%Yc4)3#QM-gVjR6upxu5Rvd0zSmq#)^15mqn*e72ot`pyUYWe`XsnDNs%%cdW-6WW
z%f|l3ir0Het#p>`iG?VDoO1(*r_$gv+ozYXzBp2dwj?_q2BAL+v!_%1&8&XnC!ha+
zUGi0^K{vxVxSG0~D0s$QM+9)L?l|T4LBoPFr{Z|yxkulaprACU%eHM_-FaC$E3p2>
zSJerT5<R9H0e0Hzr$~?z%iusLv^+CvIMYx*Mojf0oP+WBOO{tt_a}0j2SzTxny6tE
zL=Z0gJ%JVl;v_iqdx_JQAd~TC(`irMBd2_Yd=8gVF5%~d-=8ydeOKBB+%@Essu_Co
zNViH{sNOrpT}ztagt8<je=<z~z?j&JE-sKp@L5bB{XQ}yS)AKb1BU=rt-1#aC}Y2W
z8G2BS(e9kE!L&h)mcd=l<|3xqu9;G`K>A-_4^hUJaqZEU?l7j!J(=}3oPNQ&Wnw3|
zu;D9H<C+u`z$4jxGxW6>e}b|5+c>vYNV*6qSoyCV66oNs3=4dI;A>*J_EIf>Om5WV
zh~7>k3$j_%#k%r~3q)n6109DJy>E*uPnp*GXaJ2x_w+@3d5+4~r2*=AK_&z&NkVr2
zO#T^^yw8f$UZ{;L#wRkWV^nwXDz0J4FL!914HeE&r>z>#(qT>?5WLM^mR*HB+Bt4i
z?xQ!I^YPAhs;J4SmA6x|j4(*F+63#nU_DifCvVJ*2#I>kQ?J_%WFkT@WX4@{2`K|%
z0+4jCn{7*ft5kOh)`qDtVFzK?TRtRtHhm1~)QeBabhlPx?R$|muS=-HI(RJ9zAWi*
zFFn@9<WTl>V<Ive!(%&>PY0Ev3A2e!hbi)8A-2}4%r$+(n?B-|h@{DV4c3-`>4q<t
zF4hE~D?#VT3Olk~AHhe_2-qAMvHJN7)}qm!2?3&%fLQoH%L6U7Sk`8+F63DgcPZ|~
zHJO6k<!PZj*M*gN<lALnB}A#&7ks*K7o;&m`jK<3RBozU(s;<n2RWg8-c_C=O2$e8
zPGSU<?RBPl*NuRn{}yJG#ij2Ef`#BFjZ!6Ed;V7mJj7IdlH=L$Bt>4q$0W>MMYfo7
z7o>5S<j71IIAI@BUX7Z=kE;l1e%{=*d6;<HSZ*hvq{4Z>g69GAIVyPWv)$?aBAIC*
znGYoU;{e_x@CDdEV&?LBMj-wrd4K3#bdr~s?zS3~GaCsA%Pa&$?zuEC8p%>!_kBqN
z<MYle0Bn!YT}fh0IF#?oxlcb;MSHIAdiJc=M+w*KN3k;}jKyi+-|dB`3&^L}Bo*|?
zKa<Q2_x=E5Q&|^{2C`L@7_HT?Fo>Wj@#}I+C2JOHa*9DFEjFnim0iP;3y6=K340KH
zuTJjt%I%r1Q4s0#mH;(yl^*bi@a)+3z;6>fvUNrwHKoB~Z!!(h_7nP2yZ0LkM;|9=
zjWg7uzueeG^ic^BDc<tsG%e#oK4%-&XiwXON$QLRzPwQIfY}MbF2c`OtXxl!n|?47
zm(<2odM6Xfh!w)i-r_Y#BMN?DkrjoNOoJ>uW_bedv)G86WOVBHL{BS8K`rKQ(W}l3
zF5;G)*w%9+mIoy7DmYou+DfVy3;T5{f;hE#;bm2`X!n;`&|?glwWfruYw#_Whd&;&
za6nNQC1)}J?`|k)9^&Wj&98f(tXhAkC#ZV$Aorl{P1NJb>{rr1M0z#Ybx~x$a?C3W
zSg>tRc*R4s*l~u3$X=4;7b}hH9ffPu`Jatm{IgO|cwxcDQ*iw~nVT5a8Z;4JifC;4
zKt+RNgZv{E{)aQHjz+RLr<;;-6&4q<;5ifxWB_YkQ3Ujd@!-Dyi7M9}soz+0{WvM8
zsIr?IYYWISqt$ATfTB3@#tfxIEGs-iiKtrf$d>=Ja9)7wfgTwI=b()77mcZACA28g
z^ai_ME(3?6K2M0^AS5I|nK|k1qUiRHvm^|JB@u#>Pp$v#i0FtG&WYT|5NT-XkNlq}
z39=*TqNOowX^8VJ*75k4ItWf2e?8uGbsyq-Bc#k@0?Eg%*tHgWMS8^GwJKX9z9gTy
zaqsH0@fHC5qNVXc?#e)NxNjl28?H4BT0gBVJ?T&4B)^mN*liN#i;b5`s$nHx_X>7Y
zkWYoxyW+Lk;n48CeN*a(b2m9971xPs)?7c%NBk%a@`D#Q>TeB;@Fcyj5~i&q*TOq4
zJusmfD%VuIa++lAel>CH3k(r(;7spOJc?r4_&IHvcKz>xIcfvgeh>XE*W3TGM)1{#
z6MncSgLcC6BNqluLGoE94%C2q4@AV8gYc{8Sqy<8fJ|tWX)azX^9M_zG|F0r{khhw
zy5H$^h0q&Q=%3V()Xid#8sjP1qlu)O9F43wTJnK>wHFI`(;~A7(#9~sUug34|2X$)
zOKuut+qU)dGp7>ebL~+Ow*cHHccaBrA_a2^p`-O~aLFtuD1m6zJ$n6Y`C~Jp_QS#T
z(?=78Fm5IWZU1bLX9TGJ61^<>9h;6tMx00594(fe7Gs7%#aZCjx6ox*)vQRkYfYrw
zr3sEjafl)~i>mYc{*ssP=#`Ar5}m*`whbfm*jq#T)N|VvUN;kfabMJ!uk!6H{B>`W
zR7+^|9-SgaSfH+?>PB;>C@jO2mbM6^gd(maiP=nUh0c$AX!roFEY<4AZJ}T7VliuP
zl;2pIJc0Ga=B=)Z{(wk;XK^;JU3T|Z4}5l=aHiyvIO(Db$H#%8r;WOvn6!M$d!O^$
z5_-O*Ui1svHRU8rw|;~-hqoaHf<pkiu3yvJyPyop52yB&9Jr>9J_PCE?poXZ`n@?M
z2}ISh+!L&T%T7oHZmy>G>aYWxnsxP6@oul~%jPmR7GQ0f06uNL+=+t?3kfS*z3^zG
zMcZdurAqz!tAT0HKE<lmm&UuDuvOc+;H}(Nf~!&AHV_2oox|A(<h;;JQht)O%dlxa
z`cXCiI0g$SCDVXM$E{v(E?$?d)B|Qq8^w{#<dei%=93st@~A6>*mV_&I^(M8srCkx
zV+)&&b!KB!I-ddfygUT%$oyvY>$g!cCl3BrS#f$UqIo?afkk2uFs`x3!=dQPCYD($
zfWvfg5+LWpE*j<@D{T|Ime!Umwsfg^yXU>PD<KZuIwvj6k{&2n6>&w67#3_3la`hb
zunKBMk|1I*A@N|mEJ3`U{rHLId-7WlFtCdBWogRBl7TasWsa%-z*7{@I%iz4Q*KgU
zM5G(5+iKX{c7|3=b^5e_QRdu_b!WHzsNuMa^`*eE2K_Nb@+IZ_8!y^8xl15hT(lTV
z*^14mi$p(iybLqVad)ZLK;3(my6CP?sWZQDF8D`ml>E*3!gywjz%N{X_wI}=c7h=v
zSGZ_uR%N@;ux+YdJ*g_s6HZbX8a_K8uUkaAbVj)0KdaC@=Rho((inAJLRqT4I3B!3
zqO&3kdb0(@Zsrqi6GzexoPX$*XZ6KcbC5hvkJ~yv<*$xvQB~FrV}|Vk1SL_i+)boL
zqAHc=?JHyhBi%ZqiizfAkT=ljUsOiL-J6D`y^4wIL40sGo?CqxW~DO|R_v`8qUUw8
z-iMUYur@wXPbW!1S->7-%1#R2#}}NL2ChSxyP&6G$t>nz+13MtgddjPB%pfByZ21N
zeCzMa;T;q@SFM&fDU6>m)))5IBAi5I(k}D!o8Svo@*D|s`h=;gcV*5Wl^J>yswhN4
zb*M&FBKm7D+P5oGB!>BZchg<l_^4#POP&6D4Bci~#vak9bRttlt@TS)rM#g-#X2}m
zg;h*i70vSQ%vz7aw;g4EPaF3wV3Xg{qt-ec-3oP(T(Px#2yalSnOa)QMwN-C8tX_>
zIx0huW^^M0r>^al-eC08Ii<V`yYKCC1iY;n>484P5u5XE)&wwLq33ee!=i&@;xBd(
zv#!sDH%Y=(7ysKocJHSMq2K;!e~5my?ZE{Uw?4F`ni+VTxzB%myOUV;V|CXYxUsP5
z_#KaoRr`X!Cbx#r9iSyWnXWHcGz)wP#CDOw;Ux8naS{NKr!3G|B?y<X?TrbQx$2aP
zB1#wHeiTrk^DZunz#Wc7-p5q9n!|NuXay2jh@_vKKO|nbgpHa6%^>Y$GMVdVo{9Q>
zT@;_+i%Lk@Q{j^a(RYxE8q@pO7N_c?rQtyq)OxGZ^Av2?dn=9)RtJp7x7okKpJLq8
zZzjm&p!JhqjFoaKeoTt7$6nE#RmC$DbPI=-J`d!qJsVaQM?{$8IB>}-`d^#hm8m@V
zO(XBHmYfR`;p>apkFeg-VOzu*x+-IBsiRjYYgU%$%1yAgJ-B$~)U6t*)V+Td-u?4!
z@B(wC9~wTfoCpnqXZRB7K41U3pC@=KpRkIn&72m+0PY8r)U4=8k4L~@#>T@$^O=s2
z<7U}|VEpS7lR?Uca#8i6isVIV3~sE$>_{gweJ<|;7L|wGh3CRExK{<f8o#Fw`x1zY
zwla9mptfxbowow5X%_#kj-H*1OwY}8*^O_)W+`Q3nV9@nd>@yBGA)LOp3o+=)|D5u
zaW$(-(bxZY#R@D+s_(>%p_KNpgNX}%L;FR=M4&ZybiwbR*<I@3O{8~~f_<QP&)P!c
zE(jJb&gi%`IX$<_p{ty$TZd`7s5*$XlC?d8o!jbq8F|h%?@n}oD1Oh1gv3G1>7t|7
zwI!0q7QL?$V?6g$apxjq4Rf4My#+XY-06Cb53_tNeZG$o3%#Y>2qZ$76uvHz!S_8e
z%uI47SjY9}8NX*Er^EDMr}~m?-x=vX=hjTahQ>N<2G}SHc-LQcxAD0_rBi7#Pr2i%
zXh$T-D(+@tQTOQ}O?Ka}FHmPO{Es600R=C6SBl>WWNW>GhJL}Z+ZvWu&uVSX<R<}j
z*?#D+da74q-}r3T`q<MbY>I2+RN;qvrD3*{Bb@N!B7~@!(@blYCu*FxOnFH3(33S^
zp1B~_Y{o1*Fv{bw&=EaNWn>5zv6R6=Gp?hO`F?%AKJzh{mk;`~hdVRbnmSvoN1HSG
zq}7qEv0~dZ7fw!&i+bzYI|8Lma3m;Xu$Ig`Nf*)zkD&SGF{;k$hR}>$$DXIr0Y5`3
zUaY*G;w<XF9u1!trXTb|eZ1o%9TxR43wdhefIPL4a=OPBqJaGbYQ`E`(oTyeduD@y
zot>Po2{o;ECX?futz@mx-yud7ZKc<VGTg7o{_YSiAzJGeYN;}*@tlX_B{m&^ic$Uw
zw@WID=6gQ8w>)i9B7^IfN%6t8|HB3F?ePE}zh3s3?kAGaY(neU<5PX{OF)l71r%TT
zM@--p*P@fJI~?%K{>aZ|^82r~o|OOqi>zxc#m5UQ%KnDc@tnC-$W?_~7B_!8FH$1w
zb++1RH&`ukpasq1yvIYp!`s@=HTvhNq4pTjjwa)(4-rD8_RTrxj_kG<ka`4N`oaxb
zw*4bb@BSPkJH~Wq0I%j8CA9++<6tk#HU;%Ng><+@5xSe!xE4rA`D$#G*0{%)Z~t;-
z2l|Jr97WA+C4mqhP!ARj-;?cR7fT1%4>L4Fd#deQojKk7n2GME?B!NhJ)!_uumlX{
zc<b50B!w6*c&_dL3wsdIf%(isdY2S@0gHJF_CH>9-nMqv{PpzV9?6w0f~`$VafRJ;
z!rXnuaMZO~uiKKw2wnZRchX>j^3C=2{`DS~KEkmu5iWJ3H|6eSlpNm=Td)HkSckGE
zC$6n)=+;U5k3%_uQ%NMb_0@0W?plWgw@ilXPQ|N-DB+jLb=;t~xVGW*io!ie;f@zd
zfzEy0ub2I%1z7gFdjy#)1HgHhf{e3Wm{^L-53!>f>fE=g5NY*$Hfu{ct6i#W)n#gC
zQ|{<uHrzF9shs%{t47Nvt0qg%5j-~BgSO|boMrVPLk4$N9g>gwc!VKVd(D_M&&4I7
zKZsEzpz7O_4V%EYb<i<$mxGMniv5~(?QevWH^eXKa?MaTYx=W-$N?K-3_&H%HPccl
z-XDi!>lkM1(Oi$Iug#)n^+d{JKg(%}mQNAVyKUSqCl9=8)1U3Lax+F648d-(ESYx%
zrHiEfED&wd=``!8#&r(bOu4m0Kg^MoP>6P`k|50TyQEHKl^-9naxoRQMME-enGG&I
zg*b5vA*kRaT0Pi(91!!acRXFYQ2G8AkvRZQMHo%xJOdV~g9oX-hW5BgMQWgZ`BqCb
zW*8f{OByw0tgN7yx1v!nCyf)CfBi`Pbt{PFxFi>0^a!8Mnix-F9y4P<YaiU^pBQg}
zDv+ue{s6T>d-CK~KfWeK!Ry*ysXgu(Nt9J`<<-35Bp5l&bu{dKp>$gXcP|GuW*W;*
zkkkF+@AA}gccFz@!H$hZ(cFovFbI~2Wzp?ysJB-nam6iHRw*yUCG;PdqQ!8Cu8Skt
z@>L3%v&7KE40C*D;WSChhpfs{ClnpuN$7x_UHNPlz$Qjm%4d*_(3eU{)cR7i_!$cC
z?PNt?*P}k9UHv2#vP`*WVAW5IGn`%AVK2^VG6ikGqZb=c*7?DtWY#(wrCvLsn&?Gg
zp7XtkMQH}?My3qE%>eE&&US|MLH4Le&U)Q18@R^Oce3g3T+w;CgfdGrFW0}CQZCMK
zBF6N70_GO;rg27TKmkkiS?0f!?z|p!QK#kUq3-bmr5va?hNw-^N!w=F2Q+o0Z=+JX
zG8k9<!E6e7ezLYxUl!FN-}WdVJJhFTv@8)OL%c!zj6s?msLp#CT^@|O(rb+H#X;6P
zQdktL*n%!EU6Nn~f8|xZ;V+oWqZR8@w9yc8WzgrDx=5hz!R1^+^|6_ko(;+|LzJk5
zavM&zM~p7HpV2A1<t1i6`LF=HJUOEg{niaz$v#Eiz~A2uKJYr`CaqZu2PG46=tJ<}
z4;%4xoi#B2@oVxMAnal^`KE{jk<3G-xyd|~ZJ5a#>rnRDF`XgD$W@gC<c2h+X8vIn
z_A%CoAq@9y=z2!xs#=)yY8saR?wt4*q??xe9zPlwP8vm&H0GIGjgT1M%dC1Oj2I&=
zUHoiz_Lz?RkDvsvis;~)3=J2O(tUlXA*S<M=;eU+Flbu?UO{in4#{aSdyW3&zU^^~
zsgZN5P@}$iy4Ao#x2T&s*m}2-i1YVKxi;;+F`cfdF#TQ|Jw7L+#g;7QggC->n<9$9
z1Fhfo^h2YK=V~{8bC>MBsJXWvq-!=c3f8d&T@nlQ#5wPDVB>n2urcwQQ%!=+)e@Qk
z?Y^GhBHCdu3}HrI<MVZoGBx|a1-UE{i1*;hrc~wh6rHZzKUiA-OZ+G?G`?WrA1gaU
z77OoHG=1(T5F#UF7L!$H!ghAT%JhKZI+s!;SNtfpq;_}3Hkzyg0zC(=Up}f#>d*PL
zfg1)Q$ucR0$?#+!eE&Ei_->#MMi6ccH=uzgRCe!g2;_M9ai4ve{=MsXuYBn!i=x{@
z`3FYN61whkeo$Fwp$gPliTq_ptH)mG*QUhZ5#C&^W`V9}A?~ALo&Z&bR>1ZH`pv;I
zHTD$<%bZIz7&R3hp1Y~wQ++EB4gp^fDM4-sXb|DD_O&WP+zN~yb_BZb`{a;YdyX5`
ze=Y4@k?40bGOnn!LlnV1ffp@pr^d-BeyAs*&fQ8UcPI8q?~XWM>O?bVxi)Wo3bpbo
z?XF`vURi@iMWGa~4}V?}C@FRG)C;NJhd*PJuAcxPEKUMp*_Y`&`CdBaEBkdZC`dvT
z=!S7(TvW#ruWo`-Z9FNAEX(f0;IL`1#(gJ_ZO5`EVpKn!L8!5zGw5Y=I$qv%?$Cqj
zs1n|{CK~aaY$g}6ii@%Mb<*?KRM$CE-R0i;dG53q5ExIEA`QY~gQ)Hom9R{}U&*&W
zf*$v%yeVl!@T7`dSGXQ8m-2<;-9nx|$hV}znA~>YozCZl2($-DVeiZ#AYUh9Rrl@R
zN-jx{w=17&%nOD+V>1a2>!(dse<uQvXN-bPW!+#XYma)=$mAU<Iz77LV#^n4h6{?@
z*kb~GUz2Jnp2PGMcPDIGuPOea&jtmp^p3-%A2mM~KOfUrUpcTdQ)_vu2;8A{9Wiv@
z;-%EgzG=9u2W>P3YW$=8NYLjl-B{BO7Bu1^et<?JB+z}m!pQ@bd`c+Z<j`k7$G;E6
zFQ$BNE6eq?IQ<1j#9?#N5#oRTn!$R}e5c74iDMVyoPkr}!*!Ab&yHhVUtaNmf$8sQ
zK&E!^D|f=>AV$}U3${iILwCZ{q_%4$Lddj3n?xg-mvAlutn2BvwkUu3VK?`jG6pPd
zQH(t*7mC}m|KoS;guBSRLbxUimN`aLh<@>%30WOL0z;kn27D;BSSe15U4>}=hmdix
zo?|p&bMDjG^}FZ*_3~!bCPUcP4RNktx9h8>gi$&jm`1!3`g1t6=!#x4+?nDJ_zRl+
zaGUGIq;6qeXo+mxRPUGUixvdR55nL59%un)Q=N#0C4h@oO?^LQ)yA9De320+z##lq
zD$CYAI!C8L0!au6O;&TYCfnay<a2`Ys4*PnTXG!*&R0LUfz>(XP#V1wgJ$;<P!+s%
zM8}`(6ZohBC^v7h-iLo%P}hLT$dw2r3tBVs7{O|C(<E4a!}c6Q1zHnCX04!-AbS6p
z0IpBbg_s${_F35T9bNcRDN=_cXheNu9;(dJ#?s@&ot&m#`>kH_*y(e4Gn)8tt*1mb
z{He^J4@p@5v;Oc;WRnhXv9}8w4C~csC(T(YhG;PO;~{`_7J;=19~W%vXN*+@oa@Q?
zT%h9^M0sDp=fq2{%h=!n<T;Z_&7VynqfUwKknorsf=+5RYnw7I(SPq@8EfIU7&47p
zzExBC;l}sZn_#^?=N$qZA)uQ;;dUzsN(INw?ULR8z0lK2Q&r6g&pq6;;yQNv=85+9
zwI2}7&8o=_8g<DW)orKLTPN7>I;0JJ8H0Z*^)>#7noE4|@wI7g9yZNgB;d&Dtu(Sa
zn4>*Oy_b1)H%uv81~e7dK^iC)_Mco~gPRC=;c?_nQkXP4M+yJ5rOu%Hk*!&@80PYd
zD}E?V5a*=!h_5QPna7~*WE2fn0yL|c_ixx$19y%9DCs-@BF6WLAgu2q&T<m19eNHa
zQt|g7n}jSX)RAm~-@j8oT@?n(RjE-U)kKEi<DiwzdcMZ@I*E5Xb(dlXB&o^sR3FFA
z<0<;te-knCx|%Q2VX^_y6#h||^jD_+F;Ek;qc>7p@>_{3!HsF?Ug}R=>eue6e`+p`
zXHP5-nf_8{?gUMRcQ^1bb_oPkcZ${vNC%T3jXsXYcfz6FloZ<KHM=pHod?hW0D&jb
zl0MF<g=93_1{7Wf(>I7Y`<aPR7O_C+>Kt;AkAZ-V?TFk?f%E$x$6m49l4xX6@O8~H
zH3RL!{SJm`RRSnDCw*nQtua&=?@RW~p}`GltbK}T%(5xHt+RE)HQ>c%w0#-V#>AZL
z*jR89r)^AJG9V&_k7f`POPnl*4vD%>a6|RcUgnREX(CaC(2Efi8SW?Z$E_@Xsa*vn
z;S$4RIc$6B4r(+dhh#*V>v2`a9&EbSxN=4=!(Pqg2VG72HN8-{LM`zE74f5~+gT<)
zGXtl-aU?8^ZvXbr?S3=$O!B)l-o6c`Blx?18Mgw7-Dx|!kNm1E-kY4_vvsv%Lf*lB
zZJVRfzc7{J@;o{Qu5qP~?=}ZxysJJi4qQqGoh@E(NUataI+GT6+#62Wc#Y8&sjR^l
zHl%9Qg{(`d;@J^Hi)mAJ)>;3sYE5(KG5{UI{f_5B6NJ4qew<t{F!N9#w(Tdy`}0Hk
zRZ4P7H-cYb=H)VoBPjP|)q@{(zY1cVUHz$A1eD0CSVmV{$NI?ABdtVC9@QFB$b(2{
zC#<tbZnO5`LDdHCH3f^w?afzZubr2})NTah@O~P1gOX~#6*ZYiB%6x>!4Y9dj&$s+
zNw1dcJKBX~OOMXO`adeQ#(`bUJ4bJ$tV10?CV3=HA3BvQpsb_atl=0$q|_lS&H@+_
zZ&c7Qv!t`u(4iD~2U=Iu?*;$al$^cA#%=z`OQOq}yfDIyt@DI0iF$gEdNKSQSmL%C
zYaB{)!6?d9eVtY@bc=PK|3QpjYofSFvOjcv`-AI4o8OnZ$1}1t0Z+gAYA0*`?BEw`
zGXG+aa-DR(@~d-Tp5qwz>)oANu*D@A4SLEl;ot8vnk<6Q+xZl%q1bkHhq{$;a)-HD
z*=)OPA}r%S-{n?(T!!8%FKf&D%jKDH7}6QTw(69<ArNG$HA9tDnSUb=4x4xnLpd$!
z(=h+ZPfGnAjM2l8TNh-@ojQw|4&%BveASs>XVK5;Zl?-tO8&joAbr1?1Z!k#04s6H
z)JsP;Wuz80JyPx5wZFUgL9Jr`wwDuH&Ql(ed1*R4$mX*3{uAdaA9v`?&-K_baxrlN
zXI93+A``%Zj+Z_(<B>+^8EI^2mABYCw#`K&NDK(#G2hav+$^VVBL7QDlCu~nYG<a1
ziagaBWkDDQ>)=T`y_F2Auhyd2s6lKHRtIqGtNE5v00PBbpc?w5b(66mk#WU4crUDY
zA1S5Id~o%n1X(%7&+9VBLl#x8;}FLK(CnIVO)lzsm{)Oyf7u2FPJCbq)4P?%hXcK<
zs66r&J-9?bNjy~X@F22rb7z&eVb~l*R&og)ZHU_v@PYn)rC)hx4kv{uFZdIXc0J;B
zMOoh$Z!uxnFiVvgQ+ESz-sqUpMpnP73tQnYzdCJhm8?Ura<H?bq+?{jPsms3d*)uh
zImG7dj5c)Tog!6JCrts{<IOpe)VGT@i`43PhSd1b)UJe{vUs#k<<yBEMd*iPNnm|e
z>rLO6vtHO2J3X)PHR8q7c|!4V)!-(V8cvwV-wpu?cRL7)hpeDj4G70Bz>NABFK@(?
zV?e5z5&vxonR~8UR7w*>;$5cS0krZK4rXOsupp$f_WWq>ypdvYNvkswU-yqi^$JnL
z#YyCUb%Jdus4FMto5^!>bev(yQbx?S{x!Fg^s;rO3RoC%5_F@%e-i~fe?s5~gvdWy
zvRkpA4i*Fs4fd&Q1-e<+HhoOfQi=#wz#6>A_-w}4--)pFCwQ?0Bx#98vEkUyO@Mew
zK0x|o1bNTC#{Wp(5;1Q}EDL`&^EM4z2RD@5wFmesTsup|y&T!e`u7SypfGx9ymcTE
zM4ql8jVgOKUBq81vrX@~;W^Ve14pqL)2Py^PFKo86tHM>)iSNEo!I#RE8V=rnaWVC
z!DdyT>S~YW-Fey4fQRuqX{wjN&TC|)cmht7L0qrVt$Oo>QNrNpbv)^aguZ%5Ov;=R
zUI+0OA`>}XId1-qxIXkLA1(-MzhZrx2OR`6(Exw>k7+4@Dwn5$(k=kcDu;E!^buN1
zK-0~JMS9rf3AyB68dhRkoc+Bd%xg0dO@8?=8S7vGIA)4Hy^q5%jz&4G#6LzF{H7YJ
z&KGK9pv*SoKZ<`8ADYRVo<$WooJoO`I}-~-tberA)P@Y2DX+*&KJ+b+T*jS`qJWNf
zeErm-++=dq9Uj-biN<Edcpx$rpEK9)7KoZ7Rbtu-sQ3;2Wx?pRD&TzQtj8yF<*oRk
z=AX@xUsMpyWsMmo-Kb1YGd@LS&|YH8lbMal%rUV>T4|pfHQ7u$HC~}`7a`bVKZN6W
zt-5TyX|Y?7?Yw!;+Z3xtX=|8b6!ANlYYPi5jdKG8jNQXl!WGRHz-L*|Pu=eEn>`JZ
z@D-`TCR=OORSBN<Yf>f%r|Ec5Ow=O5(}|HOEP6dCRgc6=n0`XXrj;n*x#>(<e9DGs
z`?Kl8f*Oiy6Bci+A1G@x{BDwE=UFLk4sgb?Od&n81U^s4FF9(vy8NK=<nG&XX@qT4
zSWQlTE;nG=eS|gYx?e`*ULoH#LYttqc$R-ZB}|Q4t&<eK=UdD?quN!}rYoYv1<i1e
z*n;D`mNmRh`vfj59`e(6L>EV5c?9VBOq@3efxz!h-b)2>*5hHs(@s=0x7<t7V=`0E
zg9zw9_&{XGm5P$4h=L(Ldw}shhy3c^)a@YDcnlo2-EN)<sOHNKl<yV8Poc7ondy!s
zO#d4gM9kUKCgnTy#ABW%$)R=}{t8A0^RHQRD!HAc2-PB>Q`=)*UG)HA+HBRYbhqH#
zYZ7fx`zM?rjqPLj3yZuKTV&r&R#BFR$6-?0Bl+Ml#BpK+1X`-Rs+~wxv#ytyog?Ya
z70Wx#&P+&?6EE;DXOGR*dy?uM<!2}m@+ViQ3N@XA)>uvT+$dqTKs08wCzAkn*Ir-k
zGgB7l4Q<#5o)KgVK~BPAK!@6ZV?T>sSn00Jwub}PT&ZaAE@YPgr!SqO^735RZ})5#
z@IPf?tjJd)LgD1Va^Y5Y)W6h|S^M3)%?2ZQNH;$oZ;Q6uIR&KDWdk9V(zt(tz}JxZ
zE6^arD)hexHTdd6K_sMfl!3D(xHzfwg|3~>26bZ^j0KGc0__lGw`QthHd{(%FJ|sK
zHb^VN9O;0Z-@w^0dz`mGh(y51Ou0CjYTu5qsaDyW(tct@bVil^5c2>+qq5#ind)y!
z02UU3>g6OAEnrs9Bd+#rGp{e&;}pK6f+B4-Aq4z5av4V;agcgxmi9E2E!YpsagnRd
z_yY&o$tWDCTB*zITEx|)eX=XHmWN0g_IfDe|09@le8=#V91U;M@Y6TOKR4>h>PQ(S
zZ73CoLz3zv!G5$`XFPqGd8@>36lTMLq{2!#T!LLw7@wOR@^lcaEG$@gF_8Hzy~g>&
z_qO9wZ#pq~AG-2#)>@LaM5i1)6mc^!Wv6f8r?I2J)X*D{odLNT7XFv>K(F(mZOqzt
zx2$KMO>>jSZJv!y-viZ;+|=<ykGg)5sC=VVleX8D-$1M2|I~_n+%1SDrp5|GA^U*m
zg`Tv@S&}|K_B^M>=M|pQBzr6VtP%c^DUGtnxD*leZ)ru3GnvwsG&731AsQuDcG46j
z!fmnDwTy(Qex?^&XctW3c}h`@8X<z|wxEnnx@$lpPQ`QB1Q4uNs|5fCl$#t^)s7P?
zVrY4_*mt17nU7f}ZWw|eLvA21i3l^GD<;W4x|$42V^pL`=ZN33hM`4^Q9XcN?6AEy
zHe9m+RDIni%!Z=^E?*MxoP#z=ef^BmFI1?sI2L1ZyHe$YzM8=?c=Z0Ivix*I=wd+e
z{;VLxov50n=2_%z_YI^wv%<)!%T?Mv^%>*zFO*N8J<5m4Xyd?}Yr@9TH<_Me6OPwV
zIM^n3`vK5oht3X+fMwN{Wahs-JgQ&E03Z;31p8k#-FBSs<1k_O@A8f;rv3zQ{rjJ|
zM`n<3OI9Q$S1x}Bby{n(z1NSFF8BE?6t92zz4sA#YKM?*0+hP!G*+;t-4wR;Qy7d#
zeTPC$b(Zcm=Rp)PY*XL*aL(rE3P(n52B@Z`4BEv(t5BvMZ0Q;!4l;lJOwm{kuMT^%
zT1?uz5+3(O&0w@wkM>QD<Utb_4t)0+4IfHhkJ`q3n=~A89lEqZ^9Hj}i25&CJ@>AP
zsp-EDD*S*dDJ>%MO43P@ndUJff%YSeW!cWdqwp`UwkS5_B3F{N4iy%{jw+JuYUuC$
z{1qe_#JAGB-@M6-mf#EAhQ}7}3Y)lWHCV^NkChq=u+f&(^gZ`?1ooFxD|!IWHL2rW
z6>S~}CHiIRq7^Lozc|5h(oxSsax>zXq=~fq&a&P=X}X^44fj4?wO)sLRf83>%fmq2
z$F>I&j@)5R2Gx>0Q<0pTB|VWz!T-O}hTe8jCMQD&1U)(zKo-IuOBSQ~h2Z)gH#u*1
z(HV??*xZM_rJdZ(w8}rOS`$J?nvbq9xrCY(;(*u_tuQmxX;dfZvuu{>bW|AOe#B?y
zDeX+!5|o2KSnI^KUnJfkcq;VjD}=ksC9rXw>voGR8?8z!_=80Wwa3r!Hn%dzvjB6}
zOdHS@P)3Sy4^_Ry?BrnpW_V5!;|)9{WHE&+aA^+xT^R8{3Bn76!ujorxSJ35Ivd<x
z3-;HDHvy}R|2-Zd#3s5|L}`yHwl3S77l<zZ8sK?=SfmN7F6J%rH#P}!j6nY54%S6g
z>0w7ZXbum7ZF%rYL@7LU3-yrAn8f&@`LvRioESzj-V4-rqQZkt%{71GVtJZA-xD{y
zslds19+Q1^R9Ce+oKW+|1X^5Bd`^93I<Td_s%iB}$j>U^lNTY>Fmpz+t@{036feR0
z@0J&7&8u5*i7IRNi%?m^(V8lciQ-tq{%no1?_Fb<0@eRfaX6#kC~MsRAX&91ELj`m
zSShC!1C`UML^c|73GSP*7-55@DG@LWLqj!?W_eBkC6OAZ($q^tDSvr_&OJ9E1Xo^m
z5V-avph*c}<+1h6IjxyJB+_|B`eXZj{FMclvGZcAp+qQ5L&U{tOVSf@l9<GvFN(_@
zwYQ&d3s9;Mw-&T&i^VWjA1>=1`8-;LL_XQPqZeBaaA<jw4C`xumDQk^Pi~-*Xkj8v
z)F6t>P-S)A6TfVfN%Jk9V_TYynIMD4$dt5$N5d~46CElKK<^WQdQXl_`U9kZ1E7j)
z?4;+AverC_1F>1_GEDGT`4T}1#ojt~@>^LYccKiGG^+*%MZ5RjmFG}(L0^f&Qi~u0
zJQPDbQf{Tfrf^7RUS-ArbXzZOPIpioQ}%zOI26(&IjGdZJlwK-*h{Ud3JMX4+Vt58
zEw03L`sNI%u|p3da5l+;4WJMjqgVu3$vs^nM4}%)$>r*CsT6($aSFo6u=TPsUpY1V
zoNy=-on)55eGV3y)(ir}UQQRdQrY14!l>c=x-D->a-s#i9rYySq%Cp{CWSbDThR!W
z^sDDGwftzXIH6`w{Jix{6!YFt98P@{r}^bVMXQgJI*vtDY33fTT7V=YiVn|Mv{TIa
zB^+Q`j}rz$6Ut@@2)1wfdo*Zt-r>q7h}q~|CB+DSKtBIr{n!op6P33xsL$36hn<w-
zJz7&qv^5=C6kV-BF`cgVtT6Z;I=Y;xTO?L@tQk+H<WEf_zE=?4FpDRz$kVb<hV0~i
zq48`lRTubRY`qoQe}qkst!X5Ng%&<NpklY;E;a9MZ|-S>drD32^qt4UlLZ^7#k$j5
zReQRAOjPc0)cy|-AsbMMr4D%by)j6ely44Mc4iKq`w`r7>f)YwW$@?AzctH|5Xvq(
zJYgij_Ry5#!ViIjah8m1QT;oD$17=4UAv}K0ks%cGFXMNX;DRI7J;lHd=x7xgj}*R
zW;5$V&&uoX2EM}d*)glh{PfV!ueS*Uquw?q#*?6ON*^`^dOTJ0MSONtb)h7EHmjXK
z6S?@HeUCa+H~r<$#QBSWIu9mz@n%RZ&CP4eRgPZ!7vl*?q^zy(p*3$(uTUbUtEtMH
zP#A%Ez}*J4`JIb2%cZ~9FoIGxQllS;C?<*FhG|Yo9F;A$Y?+pKoubrp+}i_W3>YV9
zZ{c&z?)GF%=kKe>xR<WICm_R_Tv351R~O_p8h{Bi9{AF@=_qPctt;O|wHYka_x`bt
zFx!&l86x0i;WfSs*6A6bw3|kBDv^uSS40$7lRIvo`As;<hmw`MgW=QXJs{~?^S{@C
z5{P)o>WkveJ0(Z93$)GUM>yy&S9hLkG4T-l{p(UZPT$+7rygyRc_6%E!Yhu%92K>*
za(Uo`rK|qrs4JH-AgIwWz{{AK=*(K%p?<5oIh^3$M&!h{nj0H+xsCGG&$CkidWo}^
zEas`5L!g===SiPx&gY*1jmy4PCPrkD^*yS^@rUA2`gEg)GJo8}m+)EnaG!ho?bh-v
z(sS%JJmG!O5v?smIIoG?@?oN?+4{o$amR*UrxV+K*J*Vjw|2xF9c9t(uGS+{CwKMz
z&=nNfRvzf9mamFg+Q?MS>_JBXh$J_j?X<5^b*W{+_Nk4#_VAlo$+WEG)RBZ_ZrmVm
zg29Vh@eB+$R~r@*X%=!*CDj0opXxZI9R|5K%}2_ZW)J@skwUWjK2mz$qZEwEAR=Q3
z+^cMwrd+gB>rCale%b~j^y{zYeq7qx#aa;Ny6*1dgFq-kZe4nG@jVGf4;sLUAe2&k
zw8g3Voz+3!fe6FB%o;uNr51ti8^26h-3rD}{r|%SkkFiKIEb_8B~DCtglUdn4GczA
zb+vX=r3qZnTwib#+vUOe6Zp6DZXCdhlOxxG(oE>Rb$gSU4i0lNx~>7?BH9nsl*uip
zF(gO_Ju#Rd>OF>mu1w2I4i(u}dzx$5-OJ&=h2LkwiO!N8A!oxKto?E)c@Rgq(%t!$
zPXF-Z;m+Kc|MXMvaf@%NzMSXlv)XT}OKnk)A8c}AazhpjVTCk^n3#)%1~F{blI@et
zI^=2b=MV`EZlcD1Txs~wz;`Hg08>~2%UIsT$WKz%$(b3p89hC<r!AL9{VO7$e|}ST
zY+eQ*g9j3uA8onC?WNT`Pa8UKtJB)kcXSy!mbbsY$>|IC9DO3#w#5kxftlz*=EVFM
zY~n-uLk5uiDmQ3h6JBj&1fO-yEvzmfKeqCsYz(Kg6Zug<9<Wca`-jZ5rYc=91kK(*
zZt%{la`^t&4Kq#byegbrClT|NVdq_7SjIRLLiaLqDStWYTgSW~Mm#Iyatr>kz7w$P
z-Nz1T4DJzX_YUiPbU2e|OkX|!DjpZ5oxP-|&2!a4T=UsfpNts4YTMUK81P38Dlz{H
zBHkYcx<s!!^aA$(1NT4(zku+ObM(D0kViMM<5CoSU_;Lg@^vtMN}SRcof2gZzRJ;A
zg3lo}ZGmWmf~_{8HhNLfreNEyi+YhgZmhOmAd}lL-l1C<)hk@?fms93IjjA~kDZt-
zB}7Cia49$&F<cA*A1H*y^YPwFaAPG?g9OrnGEg{NK!pOlPzug9A|J1+PEc-MLu0IW
zxTJv1z6+OBvVaC~a`!q#c;Im@OQFC8q-2o9PG$C)U@w_Z@VRt}tiRv7rKv8O{ePPa
zS)D{HzrD&XdmB=9v{p-C52(8*yx|DhWh*Aej2}O9cRun%-DR2Fyp~!S1Y9uYmpQ0f
zxSBeVkUG?xWo>&ebubs`pyuGGq!XDlZS4oYt{-@XoP4_e+w0{km$Gh(foH5_qC?>*
z9ff0_;sdh-x&;#*zWRs7qqF*_r;dyjPtG;+5subxz8XheyZn`o|83jZ3lEYNTc%WK
zCr9ony^4Q0U&R4je_u0SFs8;#51M{qt<2W;L9IijxuL&0u^v(eMQ4(VxU}_1*PQ0I
z3)g+E+H-4Jv6yWavc-HBPB0#8o?<%Ky7g!%4tVTR`<{MizCeXKScdf=Wugu|J<p@F
zJTzs@GABys#DHkyv(KApQY%#t2sho=Jmu_CuXEKgM_Q*r7Ef6rcdaMpv%TbL^6-?o
zDdG^?T3bH9=*ElRE#e&FrNs#UBNJiEXPNw$tu&dG0B&?pW^N68Z_kP?m>5Hx^lBcT
z2KbBT${i2uBUAW1Xg;L`#Dhgu({d2TpJHQvYn7l{hu9!w(;AO3-8U(eh}`#x1`$L~
zIzkX$a3H7tlm{NykG@>SO6GN$*JW~yh2!?;q6xNH#P&<rX)B(!7cYORtocash9in!
z^V=|5{|B!TBOI;YeEGJ=Ao2-q{#PuG2Ds$`?tWM&$54kTSKg@y?To@FULjuTS2j>E
zZv7&-f`JF<dvG|1S89(3QkyUq=t9nvNkvi8pCL61o6;zd3bqoYp@YJ$->yIXQYppy
zL$=bB%C-;%35KoK)pN!aiQ{<V<tg#P;y{TI%;y(1w0)muWq@<$uZTaWQVK;2#srTB
zM>%ZHyWu`XMAIk88roKYSJMmO;NcD2{fKr;F1&@e9xZo2rgyK?70AK`co=x;D1y{z
zj&f_{Hc5NguetLs-DVpZrh`@vZT&Urj8u$ws|=lxk`nd4E9+<N&Gt)~=(2tj%a_nC
zdFqb#=9%d?;dyZ?h)Zok6$Vu!8I9^3ZH-*^N(d6Xgg{Y>2KHNNboP&4B=<e6|8`DL
zWvb7T3D!?>=t_NH1LGYgx-6d0SV70NUO{le#2CPaS$Y*-dDruJ?yBMk*N-ZtPpUOy
zgroJFui<EqX3jv}Fv2MCYr1rwIL9I||L%J_Tk+^7ZdpqmEK0jq*|_;CFkKmD#7^EI
z#foNyr<$LS)?cNKg-w~X@eWF8^FjzPbwT}4FO~6<u@0TmYN09y%ze+SXQsACoPao6
zF;g?^nXP3e^)hE$k4z9F<_*+%VLuqp8)#;G_P_E-sa|bgHt@}Ss7jk>+EDPs3&Rkr
zv-`iHZ)q$lyyX~C$Bs*7<18C`Y4D-u!A~~luOalU*qXg}lee7c@|_H(+Z1isVQcV3
zL$$>ZOGaxY1bOHRf8^e5yM%$~(HYLW1$F$}B?eb#{fy`DE0s?(mBP@s#W5J9_mw8n
zsVz<%@LnP#3`*rSAc%bL@(}6ZyI<{2I!fksIPPgO(c%8b=nYsf&eBO1PtYlexkxG$
zj<P_-Qr#!V*>ZuMY(^;f<Xa;~I9k8?ip4sb@ey{Y*EGow2*UPTvF@?BfpWsrBvves
z-dh%obIMQj@RiaJ=zy7u04PoYb5L}|dSH2kA;f(UWQYT`W&N5ulnfgRf$Xf0pt!?r
z^;SDc6tHAI6g166%DLVckW1<m7K(FHI0Px27A~q(qAgD2aCWotDIwU;&L!4}j?wer
z74^-bRFqy#7YosLiEh%m$vK8w(hK2}&rcgi0kz^%YYq6@GtIgXTbMC8#-(^2pYA}`
z&cyZ}$(j;|?{JV5ubr%o@dLpap=Pu;rHquns9$jiwKunWfY%;jN2HJZfM@K+3s-U0
zjYJ@fDYB9}vhhT9(Cfy6)ATdqdqBKut$0<hu|XJS)`Zfr+fL$Z#1YlSL1QGkyyP%6
z=+=wbIK%mGm$5FB<MeDKqzDv2BRdXA%9K}CmQ1FXa<raYYXpR&^_#D#o)Aci!@LP6
zjh`mE=2ETFsS20hsV5vDpFTevx1aPqiwcT@TOVTaB*gQ0VGcG4xBz1DBAWCvSp}M*
zYjc^5B<pu$C5$N52xkslS1;Q_p0P7tDPuu371?5`HeN&KTgf4Sa}<H1peQIEg;Hqp
z_-A{*;scVzoN;L~L=LP)XCM)^`-n}$h?lE@5a<XlM`L4QV}^qgzcj^oCJ}G+6~tC$
z1d^zqdDgxl^4;qVkIVQc)XDVHPMC|~22nfel{|kc4?b+yNJ%C_Qni+JG|A1>V?*8B
zlR;%P&Iy<Nl3ljp^XKbHPY2~MPSeZ&N?y1hzj%OKH{lftbUG3eta>ONA*PTcii(**
z#emRD1j6n(p|TtzyKf?2I6Itlbezk<H-5~#F*LB(b_{%MLQCY7IUXmPKp^G;i7Gzm
zTffDbfA(MdYc*QG`!y<!j@EC!e43MxilXAh1Q$c|$}^M5o3ilf^Yy7a$sXHs+e6&5
zo`1W9M`!5Q47^$C2Wi}3greMP+DtF=>mE&kl%_V@VvrJqm0Qa0TT#X2HX8FojC0H5
zf2S*^QzJ7z8W~G0d#V*Pqt3-1t$gq_IXwoHCq@_;XoIp<N)K;0{6hOq#wqiy8{0|-
zANqU{`&seMUvvxV_|TcU`!=XBsGHeUxo_7<oE)2dD|JnY)k>q%3?&XCDzd{Z)$?bn
z7ghDksC`R56Tjz*JL_ZXx)B+PIb;w%f1y5g7yIUyzEl3-i+c4vym<eH5jM5fb_P1)
zvsflSkwEYgYKcU=^49G9(dFU!&rBU_;p^uI6*>j|inks^KhUeC=Or3gdoh>X%dD4K
zZ?9vla`!y5wa7>-^JH8jMmSo(`HK6joy-&O$puDjXc>zZ$e^z{)QO7XSiK8JtVCgY
zz*#@ji7t;$%c6OVje*$EA{AVWk|`twc8aRSXVap30S#)k#9x7hny6FDO8BNRztwye
zjHN^vM+ipFqJ=Snai03*3d+(rQ^%#Tf`SiP3ZnSPID;`lpQ@VCGZ&X?V}3Vlc>=sz
zaagK&Od;??BN9bZAvCXC&h<$;6bYQ90&KMU#ryE=Rj6b4tvTr+E?d(|BTM0D04^3h
z%>ogu{)ty@D$GOP330-TUk=1kDR|WJl45W=9Z`t|)#bNUWN9m8biCpY1P<KA!fOBW
zRQ-qFlea!g7Ip!`M%}8*!=>b(WzE85A2j-%d^KJ*c!`W~c8wqFu<Op$m6Xm@N&!wh
zR)R_)`nB^^m3JP`Umx#gD>n8mtEdh}-(#)UIZ7<7HAV&19ybEQC*vA1!qNK8*X!R?
zHDV2EJu;7p8+1<RGF~WgYkqVSk8R@T_v_?%G(I<^Fea15%ApN)LVT*uWfewyU$!0J
z*?vt^Bb9`g38CTIbLzztjCTwLog*Z`i=4o`97!EB6B%JWR5GnpbCI*JHrv5NKhR5*
zanNFc-bPjp@h!W1x;Z%;qSVq#gOexx^Wl3Ezot&qIbzz?cc__3ob~+bU}Bc`E!EAL
zrHMj)Xro{*jfx68+%<3oJ8dIXRt9-qq}7YGdI|MQr3Q9ep4{$<)5k-}zB{9iPkdih
zIO$M9c;hL$smG>Sj#??p7s*z=gnzV}lt?f=s(8c>6N;~0bP#sOO<-k(+99(C#~&tz
z@K-MskXzQW=CLGks*Mr$qTDG^g{A-yN&g2g;Pi_|N|`6&8Uf*G{Z^|Tsoba*^Ul?-
zunBjsLxnrn>NfLr-);HkRh)V`2kjyY#+j`U(MPA59awdAkQ5UEsY43}5|PsOX5G?}
zW{H2Ui?;PL5eq;4a_QIR6wJIW1j`kR9IH`>R=Hx<_yUvQv%$iw*sK|<oi;_$A$)3z
zjm@Aw^YBS5ga#4cGT~*^Y}cGaW7iw{yte^<a`|n#dUsU#><?9iSN?-8U&`<8&xw0B
zx3t~-OEu3{xz%yd>KrsGD(zQRoI{*cSpk$zFm_f5s7P)0#8}!DuUvmOE0^0#^G|;$
z*WJT=zNK&cqTc!-e|wJp>^^2IHuYK1Vd;9!@1H;_1=EyXeQXfcE=or05M0U5I}y~}
z{k!ihLHP2SK}AmcQBYy5!)p$c7d=(t@Wo!uOij=0tk+%|$Cy>V{a`QXAdKkXlXi_t
zqoeg(tsoF>@kz=dLw<(lEN{p8<az)0)zqFtcjfKh)IT{^&c1=^fll|?)MrAXx(`aq
zq#%uXo?>h-2}aTo2^EXf!g9Y15$&(TR>Bv%P&yV*ST0)OT3KsKP&y?)yF-^Q5OLJO
zw2K`_sPS=(Q7{RpQ(V9cA{0q(;~`B%k71ZN1jUI)sG|*pE%QSmDH{bTTJ%m5mS>r0
zE|N;y-X5#INhuSu(9}WTBd-@#zWk@6%4A0fdi-_*T+)|3OsYLoDc>|F1V_G&CP5Mn
z!nLRL_c~TYs5FJ`#rc%6aH-sI2fMAHs`1IWACCpQ?|_f-a&YZEAe{S7cj+&5aR-2!
zuA?aFd#akTd&0&ZWBV2X4b3}1L4vCB=~_b2;AQ%rYW{>No<z9ta@}=B6EoB)IPF~h
z`G?)c9y1jRm7{Q~>GYsVQP_l#po-#<5K`3b2ne5~Ys3gg>$h5&sSL%Mv<Qkee>TZ4
zKfj9&vpi)x)=%@7&y^e3=p$2#NF9t6Rz4-JsbrjJn<YXE0NV0J6`KIm!ond&c-SE9
zw3HQ#*<wCrNl_rKWw%f6?DaD|vWb~g9nHip+u>WWFJ|)F%!gNDG8vz%qm7J6e5;2V
zTF-9i`~2$qr{s}FZC==XkbYuRzC2}TD@Ut{I<d0|8r!-jpAinI!>L~lRuoN2nJk%6
z;amUaFFDQcKJ9mT(C>Cnee5H3!a{k~u_6v!qP#6ZP-Mfq@7T(|v9_qD&Zwy4AHQn{
zmrHK7cIIa<(vG9+m?&8^#&!$YafxiZQ2fn466M(Nvs54zpNgX1i}!TL;#oujHimb%
z-3XZPu&OxaO)^t4U1>jPKWNWue2IIWzPA^mhAOB<0%3Zn*e4#XC*>M3!qNJzmTxII
zOp%hJmb0)hvWGTe-MOB_c4qw)z!viXp1LDHxJkPmT*17GQYbriuD8vnWuA*<&@}p1
z7ZpV<U^>-B8{%c&30?WPf5!f@WSoWLjCIT~7gJzNY7YwEx=y|F$h3M9dpc=iUz*V#
z^*K19X#W-^xH4*(=%A!n)LJD(S4k>7s%V?cMIXAfklxIiNx^~Gb4ezOSg~xFcb-}m
z;D$T&DLbSVspGm|>Z%>N^d_FWA7@|5E1%BZ+p}So*BwUx20vBPs~C8EpkFaLM#srm
z$&tHD=@=`RDCsx~c=mmR|L0uw6YO__L)dR6_dL{CNHqoPM2^_VWLo+l4?nzCUvelf
zdb%LI_f&oFOXbp=^{#ci?MOixc$UtyL&<oD$u8S1l!qVFhfke(Xo{t8T8JpYg`hs*
zYYDaU-g{4HT(;Ya;8ECqz3#EQ1mWy|_gDS31ODo1?)+Qy`Zc<25&blkKE}3+vqZf}
zse|GIMfx}zA4iPv$+|{BI9k8eiVAg0{Yrmk<wY+2MW)glNVluk-Jr+pDTA8vF5Qxi
zeV($dRDo+2>g^9PF|JcRnShDHn2pWJOHo^{)%la$`IAHzhY^>I9Kx!eKW1N9zJ$f&
zjFl8=kY43YB1moDVNjz&@T{L^VhmT{JT4H`p)QdIpu{4fHPs<QQeZ|56KzKII;fN7
za&s;VA==}_Ja%3v5;_Xm+ZQL<V$w<SPt@EfZAnJiduIurkV3fCNV%T)2|ee}-8X(3
zj$b7quy9<W-=JUN166I3*Epjp;(gcAaW+W#rUzNE1#5buj#ayJ>%Ej6I|fB)af$}J
zwz|!6P4uKOR8B?2sS3Y;lpy?KEv49Kzz_XU-*AY;knWJ2E%U}$zC@<_JpSFO$7Xb@
zhYwtR5Bt7#a>I9~D$j}~Y&priiiP8{aGd@mFP^9Kh3%dx-?~Cyeu!wItsDC|XW!X5
zTwwz>qkPnqq7Y4ou|@s08~N&)_3!EzYqWl+YXpR&^;<3f1QbksX>+Aa5Cnd5NjP*D
z*<wEPx=eHlae{#3x_fos?YL_l(|tN!iVhvcD^AT<5I6m%Ll)Uvs|^`Rnzp)GjdlhO
z_VwzOvhVgxbQmiwQc_b-C@2FDf;c|)V>K^-A%1{|iE#?03g8e;2nsF{;?S}+cp`Db
zOT+>jo#>L!!6h-yW+-Sd7QY4xtSCyhtJ4fQ%1cr}wu;71r-*p8Zda0pFMKz=;+Zif
zjpy!9J&=F7AZ(hYTOb8O;&9{mK<!O8<h?lu3ZZnAf)h&Nh+V<S6_;p4)><t_6*C(c
zJuh5K1UuxN5DzatLOywVSigZkf4S_m72mr;3t_jdK={xP^^Xsi0G*@=H5I5*2j+KK
zHXpANlwQq&JJ7j#TKAJem>g$bmrh}Ty>=75nnxeCe}39ewJ4bwPkxw`b<iA};_Ct-
zmW~s<jnFu%i$00h2ngr;y8C^_?|nr}$HljY-{7AIL_`}DOn;^=Uaa&dqN4Zy+#k7z
zY`=(!E@P!_`alTmze4&o-*?)t@ImV!LGda%v84e*D-ouZVNcr-*v#fdSY6lqY%fQy
z1Q;vnmVj;X)*V#l6^wVd=r*3ek9_l5t%4A64t11)j@r;7QA))n$A~1jN(EaBplPbL
zF{7)6ZLw+^|5d(Jm87rPOc$D>rJG#uRKLx)AfcVrT4|?}CLjb+$49>&-gKPQebzjr
z(|z83oH)Tj>5O+q6pV(s+T%T5(Lm|wL@abTsFXu@Vd0(}u$KvQB;7_A&qY=!phkxn
zVJeWu|NorTvfY-v|4aJUuaM}xJoz~J&=2&a1Lg2t0e*6q0ih;4L^nQVHPh$9^saEw
zDd?7T3c3Z(asB;6w#8VcCWov-p>`RqhvZ22NQe~(W?CHq;gficfN)N)2R=|Z;cLGy
zwdd#WD*oV9t(9x<`Tv24Ax;}et4Tg<X=IEP-V+YrO_ojCfxUF7q6KwG6K>(pj+Rec
zsC6_i2kKxkU<qZco0ChUi5Dhm45F&(uTeF_>c0Q$<0WpLQF=P?HiFz0R&$HbpmZF&
z7au;C6IaU@exkKXr$f;(*$#n1qj4UGI3bD{gJcj)H$-d-qtPVSj4zJBoQ)8T4<VLD
z#kSzAnsJhIzS1aKk)+CO^$1g&FbEn__zncP<_?ZnWi{k4zsp^Eg97(I#{4l#$5?5D
zf+G;t9v`S{Do<783+jL<9ib39j!uCOM5*qnr?Yw=5MzXKxd<L=b39@p)Z4f#%~*KB
zwR*zg605bZI)+m((oH><FXGPioU~d_*azVJTiJR6l{Z4>Gl8@BnZ4iQO>kl;SfoM9
z{n`q%HkcyK2B}+K##k54aw_WwTeH&y$*2YUNij^uN9#$nMnE{HSEr;5c%>4Gz*k-^
zwdeYG6z@D+gYtu)|L2GpB1LJFLfZSX1knes46Ao!$qur`d?q@Ef|lwT7}RtN#y#^o
zEa-Cb^W+m3=)`y$X^ZJ)T7H2{2qQRZ({j_?21AAN=k?cLZ(kZitK*11gI){{Guez_
z{Ep}F;U59a447Zo*H;0QL7;SamBI>`W@XFvhLGVpRXejDmDKQ~Wd|JUXsUr|iw=q@
zWyIQ75fx1=6IbHj*+L$oBnOSv*O)b0s|JxvZ#HG-pl0iZESNBUY)mv5Bdi=nMIqFl
z!cz!^P>S^kRp<md@c`i<mKl?bC_6^t4T-kMgntsyh)KZpx9R+@MJq&2%6JDA-gB1j
zznz&~7Ed$@20o{`Y6}ZfqcjeS=%i7};^_OtK80Gry0A^WT)bCh>yVXSCg)<uGiBQ<
z=iM`6giq!*0>Zhw9{)&D7O2AooKPyIr*aHx-g%6ypXQWT7gK#U_I0Yq-~H%UgW|j1
z(f`ng$Iu3+G;KQ9ey=)g7nU!PXC2JKak^1+=qSXt7*z|AsXWsIru+B+${P=p=>Zo!
zY<pjnQ0CLP<N|5>M5`BQ(+4j(v;O4=#XZf`mg}bImXw8&gOHF!uzj;%v2=b@bzHTa
zpWV-()-f+t0z#)z@=pzADvi1{r6F$U@xt8ZKq!eS8$wv!G68lhAjczxl}6LV;0)MN
zDMNDj(Za%zSY|}llrm}qr<_w2Iq}&pmX5!DkxF2PrF`@iZoHF*52GOvJU%cGh(%*H
zfl?v3NCzF`9UBw){<9R}>YEtUbh;)TQYd2E)!B7gSyDEyj*1|Tul^{!_y{@gYF#?c
z!f_UigYf!84BQS_P8}!;I?0<~r>i2PR9Z11s1Te(gtKmJe!3I}doGEpVvjJEM&n6H
z1t*euA?clvIj9u!xzAO<>95*o{ZC&bAe_6aC<z`7;OvMUcL9M#;}niX6LF%t^eR62
z^5Wqso$532+_IL7e%aunjg=M7{#@mR_q{-72FwoF^B_5FR|YkOW1_=&2f&AfLuygi
zs%+{33@W+>b!o@&Beq~eFWhrKZYNh~6Gaw|CdnvmQU%{XrM~ff(s{2$HG~uHeS}Vd
zhaxnZ3!)uEa6t>lY|Xld>DL^v!n8lHIaE&hsm@eX-hi-3jK`-&pi6tYPjJOBJ508X
zc-7hfp`;P;u{(Ho*l`idCMg2bo0uN(!15;QOj=mj0HJNzn%o?=?~_LKWu?r)`^%S3
z4=+2$rf|IYFuCw5{ioNuu@3Xbm_KIn79Xe`)D#L{vys0jDB^IwWVDaDtWjq>J3tC*
zj1I=jD8z6s2CM223Q9mPx|)OcmG$dEqCuVqH?U#}Cp}%>eTF_V#Y+#6zd1)g{vyeT
zAaO{b3`52YO>iiY5vIrmph}KF6&vgvZ&-Gu)R>moi$)a8MOT+*^IC;}q?DNhYXpRI
zcRjcfrz~4wdyNL15(MX%9B1Ab1J7(SmMxpaZ!P_r=>doC%-3F5#C{vXt|?OFFOHRk
z;{<rl-niI}s~Hr`>qctQv<9ObBlE&}UA9|{Dwo_ogeVgoSu(-&CSALchc@ckjZ}ey
zUr^)&JMf(^)LSp)Q?FoROvXFB>#w8=xPtrFr{bAVduqfvf~vEstSC645Ghn+%C^E)
z_n@JvM$YspI#wO^Dx&Jl17L`lNB8AxmZU!nF6N-*B4#XYDk3&J(4ivV{&)ZOBW2kn
zTTL>r%ls~1x=P1>=@r6(g}3i183+><HcqP~Ct_rT$-5HkkZ~&)Y2wJgb)la678hCU
zc-O2N&Y@651g&k>L@Y2yHBEe)@pU9YUE!D=FgAf;wMVe)^vR&<L2cx(ro;e&ux2gu
z$K-9VcDLP&6YZ8<b2sXE{WIjH`|~&7*P~WS;nKZ}2a4$TPr29)BF1*FSX7=0-@cA2
zMVq=*22h%^bFI`WsyIi;b#}3PB@QnQ(3%8k6g~2!ULzo!yDQd<)=p76x`jyxW3L6M
zy?q?>r78~zx5U}hn@&l$q*F4#Yf=T9<Y47HDo<HZ*=SP)LSRrcGhmBJLLh|Hpi&eL
z-PMHqA#myKw!8Hzrnh3YlGszM*M)A06FLQx<Gkc`vUpyiUBYa|rh!F<#uX97$E=Y=
z<9xt}B&<-G_39<@3}NX4zWfumm@oG~rV~M`KqrV-P@5O%^U%RuwjIhRGlHZoz{a?&
zWNC~FU;Kvu;PYgwNw%6~@dQzg@y0`>4*0;wf9yrr=9sd<+PK-Hq+!UAyc3wfGS4_P
z$*AMVr;Cbw^2`49FO^TdRz%owOEgZph;ZfOY<H@fey#E7<8xww0|<elurA&E&(?^M
zGkrP}Y?c6!uuyyy6QzsEHh*i!3b)^<Dl#)*(KyHM!=39;;X~)>k-N)__XXwDD|yw^
zkmzlXL$buMP_k5*777B`Q03SNES<?{X`&UHu3_YeBnY(ER1lGDeF^AK*E%->!YB0_
z0pZ+TQHK({P;o9nA(W}&mN$1VI7hcgD!bH%$&dI~5*dmo^tBr)<Iq~nco)SND7}iA
ziVf?jYWCc^2_nhDdav|rg-{KT001BWNkl<Z_Sl-~J_Apk`iQYg*(vE3ltq%um#LyF
z^lDU67cfyv!Q_IHDr}04Q>Z+J0`z=SW{m4Khsg)d(tFl1Io})wRREQcrr#Aw+Zmfo
z?M|MgqG$~HYy%-l4x^4w|BHX;F|zF<mQAv7oCI-A5A2VhA(iLjXV>xn?R8?Op@WtZ
zpt&HKCRAvWrI;8b8||O_3|U!n^xhJp6+}!1k}ZQi(65=P$v_x^U*gwzio)y%kzF~*
zz#9sBaF*FE`HkVpx!6stjEB{$+}a0K96>n$ry+R8yPSIyN9@Jle_ua-k`PegD^~(^
zN?bsMI!?d{He{GoAhkQ2Z(kgJ?5!#rKN&078LHKZPyf)Rw{HF|h@h%jg(RZFXFomo
z-~IbHTK|LA2ngrs`q}$SQ3<LAbPEf)j$SKCCau_dfnl|Js}e|RBb5&4xcBi?Pjfhz
zf~4c4pkD*1%51Hb;scd(-F^62c=Q~w!c?7A&CGyWn|&(Ih?wX$Qcvd)hoo>2AMAQG
z@sFmdmLw;tMhYV%EF1wUZ{<W%DJ<7TKln0v&lxsRVJzuoT246eqAq#fO~{gNj<&vA
zI#g%|>{#M^(_ymv)>aXX{jGS^Xzn!tuRBN{nc>kH*8jM^V?B32s#ASl_|~q9(sW5B
z$s;A%&n2M0xSxZU+Md4W0!}<w`oVxU0-?>^2*wCw#9EbJkwyvxyDdY(DSv&Y8h>)J
z<|$58TDh+wy*;9WrrjO%%4JvU>U~5U-}+&A!O^a+RbXD1eO92tYmWfo<nQWKPk=u<
zJiW5<mZ<4eGZ2P!b4j3h`gL|{sTC>h%W9=eiYlBjLdm!&CYwsHVnV^(YR!t$(Rz}u
z5fIMN6+l(J8lprLboM{Y+hFXZRd>pU?slKX*HnRlM?q31rwbM?6G66+D3g((416@p
zYn(rxGe@qv*D9r`C75&z#!L3xnp+>DESk%xlea7uSM6$(N+mbOA_cTyw&V#Dmqa?L
zmZ(OnvH%634vabe=4JAxFNN;7)WLivA#ql-Po&al!w8*y4{L8Z3z#t}q-fMGK7O@-
z=5Dg}0_Js@NK7v>p4i3A8ku=rmcm4bE$6etVh-6^yt3i4Dvn2pgB#awWbG8s+Edo<
zQG|3=0dY>h`pxjn)$ULC)_PCrd)wUekMkh`p~nY$afni&_T2X<or3dk);Aw13PoW;
zn2>H%r<0EbB3NufXxZ{2#>5(Fj#vYH5JaE#3{e==bR3<M6ITn$ek&y6^e$T^*n_L@
z=71IUZF8U0MLR?UbyAW8M)c#%kP>?{*YVsFlW*OyeG@~$G-|kM5Yj@*(Ry;P5fIMN
zRVTE2bc&4+69P`@6pWXw+zMdDV%Ba*8j!3@OegVp;?BIM4(3v~P8JlYj~E%DX-tAm
zx(Q0HQmbl9QXjWY5=sfi`4INlhI4La|K&#PW|V$Sze3aY8ZkI-)=?-ZsVJIuW<x#+
z1f_5dcWenVAPGCGV7u_6Q!HL+dYM8K7AEnbOAd;mNAulGt4X7A5zyJ|!qI!mviU3=
zr(0NSFhX&|ch$mZx+RMo^SjiZer^5QE$79r6t4_Cdu+|xjnsi<xB9ZgIS$@KYQ=Aj
zKTx(=tTR=LR%z|&8ohv;0%be{uY<s*K2tMRQ;q$zFJGpA_YwitPurP8oRp>Ae`khK
zX<$S0y-lbrc$I)Y^#ECOZ<yER2S3&qJzGLx(IPqp2p|1-{n)Dn_|&UKl@EMZpS_n{
zeiu*O!QO1~-o_$D$oiFZGDG?CZB{QGcr=McgGTU^=$%k!kC5cM&gu*}N66WGBB})R
z@&}8Nlm1D+MnE`6m(S5td0Ilkq`X&dyO6b0t$&lKQk7y~s$ndQa)V62ayYdCVK71v
zw9#~Eo<NjDk3fI|Iu0Dy+{?~ea?VX0v=hMWz|uep;h`z!kC`SSC}l}E(ZLd9W-;^H
zrN(FUPQ=n>k${loYs{+-)YfL?RnL%%Z>I{BfikC;AzmA?3^@Wu5K$2{SVgoAgs~RK
z_2Fqdvc-Is%r|F37JzE&=0}xE#^!8Y@GaX(Jeovf-<rqMo%eJcm*1{M!M;04Q0`f;
zOC}|x#vbXXWYvjJ>XIsrPZ|WHO@H((cgiJtzzSJE4RG>VnokdsW@TiJN$L@5gC)Zb
zLN9o=^t%^5*IjUN2!XK<7v0QJtN8sRQO5^Q*H67#6u$I2xqThW7PgwK$vz(gvSYa-
zot?lj-oZI*C&$B(MjL)&f!bz-&c;qPXC*r*SXNSQ5RMq(lYWh~P;+$E#Q3WOLUv~7
zCwD52Z(j?-1-BW8P^bd^II+EAdcdXuQv+rydNs2(vlZ3we7-ocyi)q!#(ejKfmWRd
z^|c4@Wj%#h;ZdC2^Z*Fw+)SrnV~@vYnCdYzpkL!0>o#e;hIl<Q6*Cq6U_Y@=*N{K3
zT|UJ?*Oq${xt%muB2>z<C87>jph6v}yg4A75x%Vp4*%IB)#7AuP5smzS+<ZZCat5E
zg&wgfMOy%ps&*Eek|ja~V+9i(dyIFu_C8~ZF`yvNh`(Wt-utLd4`f4+zGn~&<ocez
z*M89aGPUp3AceGDcnd1*zXMO(m5qHi_N*+Ni_f8Th>0SUkV5sm{0gPal~-v9h~w;Y
zg9;ibpi}ac9V2QA!YdC$9UnZ)qGG>tg=Xug6N|ZtuE9=WaebYFv68V4Wx@7K80*+^
zA-<97&~lo({6T9vV@e|mj^L7mGZ!jEzW9&5|E}ND(fZx25hI+V>+tv27reI&X&*-*
zn9}m}>o{~5uDF{|UZiKfQ6AigkDF|5c~|{lk_yDCkwKA|>!B(^q8%a*aE~p$B4&9w
zQyAueD~%V>s1l5~6|vbCGfg_FRavm#wp@EJB7FBo?UV#z{<!UQHPk{UerJbfMi{H3
z={p-8OtPA|H2FPZODWbxi^Ncm+LO!I=vWZnFv1o9ST!{%WsvCGi+WKd<&~h1UR=HQ
z5D9_B6D<QkqST=Uw7S`=B~~>pBD>8Q*{Sv$Ukj_sI<xG>f?hrc5GdlP3N<NfNRu?$
z2b74EQRM_&f3HP`tMazf*me<K5tUpujRAO8c+5g7kw{oGoJ0gY;Hj>j5fPqwxKrp2
zaE?yFOpkRN^h@XK(n;2B;NU;u1qYzQH?HIz&k@aDk>qyQ;d>KTZ1;+A#htq2)<(xs
z>f~CH1be|*CPPGSdw--)=6A)YK{$8Th!M`+6)91KpIjGx-7{p{#ik=a^N$4KqF+Ls
zJW%k!2Brs0516jlG+?G?rn1rAgXA%IBFPveI#}y)m8`W(=B`_!gWPbxR?1KAQWZ|W
zMsfVhC5q#~oj71en-RZ$TBrKV)<$AxD|&UJJ}UVF>VyYTmE$FkjNhEk`4l^H+giQh
zUcKfn-Fa*F*p@*}Z4E-P{Ih5euz^zzjTq*F_WAoRtnWRq{=bfuMe|rZ-|n{c(pm|q
zb(>PRy09ckNUUwfXoAQT3&&YEQF#j?iyze5<a5SXWDuHfJ5VEq_UfcNlV7a(4=?*A
zt9Htc0^arwUA4jvJy|dF)AM}RIwc}Fd_PlGoKFhX5Wq>OQDHD((Ly?<ob)UggipLd
zUU|46Tz3zjxqxq9!{m63GC-kljc>JE((Tag*k9wrIgZ?eBX*_o&C$y0qPaBcQnFq8
zWM+i<9oW1T;fnjqkz{l(tPvxeyDRqyLpliG`XF8vF`Wp)*RSFkyV>;iPRZIS=8sbr
z20Sj{3d`^;F#okv4MB`@<*hte$IIm@JaNZK+7oT%AggfyhEzEO9PfC(Q~214+;AT#
zr(CW@VQTotW*8r%6Q|@TzNRR^qmHsjj4(~pO?i@L84NT^)VMb5S%%d8I{C%&kqZdg
zkizn|5S~(G=NyfFLXEOG8&3Q1MfIOQ2PZNJO@^l`kIk}amde}chHgQ(Wbp((5VD^m
z^#W~)l?Nl|hFH1P7<p|iz?6TDQp75BU=ScAVM{V;#2%-0(GmdXx+uc;uH$6~^Qj-`
zSKs1ZdJs?BS^n`ygn%S0j1z0y@Nbe)yQ{f6DqhtqKFHejI#zJuPnp+MRk|G>o3Vi*
zA3RM@I$ZW%4x;D&rThNR^z<wB)lZi=7C26jFO!Egzh0W|(sZBcKA*cpotV2(lf)*M
zM#+Op5(?%Xp~UDoQ%XzIQ~clmn>Skj<JJfW=kCgEOw*>1aK<&9@KkVo_<Q>HV`Rk^
z?6!=bKZwG2Z$uoMD&~*dM&A*%rXTZ1KqFI8T#}?_(^uA~D2>y(QL(ogZ$4`J)6Vtm
zRW`}!a~FnJ9%Kd0DkS-z2ZvUuqewFlf<iz88t3T7&tn4AXzbH0V~JN1_r3_(PiXH&
z_VAa_;?q}f$h@%Ma{2I?;qA|pr|;w|&s)BN!lph?e^r?b^=8#O$$3@6(NZa*YE$%*
z@gw#!HEr1rssV*#vdbVe^2i*mN%BOxYygK-uT~#TZ^4K=0ZCX}DjtdO7K^148mWs@
zajnBj3?8cjHL9@hP8__u!N6s=*(j`-+Ziu9K+vYmtjU28wI;FQ*RG2iBSg<VFBF0X
zbwa1a2U+*HDxCC8QRTSRqN+c*Q9C84y;%a3f;h^8ZeelWV1Gs+)PO2mEnw?~25COd
z3MM9in_g6g@K1sxIK_zw!HJ8(r}l=(??5^A6Vtz=U&zt=?^`1voV&}8>Jm`{58H3S
zc1utJC(qj#bsV!2VDD`?`FrM@bIM?rPDz|xkra}2;s+sV2wOlH)ufh&mCR(ABu_W1
zOy-lgF%0__?7x#~`R-az<p~hHsF-QL@Dzbk5T%II<^m*0c4{mtTik$<1c$j-7dOFl
zG3mlwHm&pQ?LzEVz5O_6{V3rdUuCX_I{3P3LUtx6KzVFBO^`r*AgIP&yY}?z9MOq_
zQ^rc1WBoMUf>LlUjSfy7vZxa&oN;u^d`VztQ*l9pwMg3qPlAmc3TRPSxLOXk3$4Ow
zEY(K95arF!5mnyxbv^Ih^2g7W_kUZ95-E%kdI(O`nSDZlI5JUSv$*X*2%>P<Gu`}o
zdf^Y%31uOb*C6thAL^TrmrtLie|~~|^&<Y{*?jq8J#HTns9?c3WkENFy(KCiUr*QS
z>M6Y9AW^4xPnkh5_L~zUlx&=EE`7#OkRak({Ld=Dqq6ASSfd`{++B5+Yev;WqG++F
zV$C7po7eEoYY5P<>3e!Ly_(tB8myacR!m?SSdUPxN0=tkg;rbciJiG8s4E*rsE%)4
z!IgJwb4iXP_mnD7)kz^48(`jgQF$zFm2|2@Ex=YUFt-e!*eQ(0xF}^j|9aGM?QN>U
zzB|aJx2Ov5_=bjLpzM2MY<Fr;vUmYS!MaUUsR`GQa?K!pm42Y-=>@xnSdHve6a^1%
zV7!w~5;XPUI1VW$?0_NqDOYOjT>4~3iT2P+n<wtEg6AN02jf%oNS$D^-J7&lXsQr=
z`g=CQ@Vxgpb=>)&YMyEfwby_Q-?uiomm!uP%*z-m6zTUVOZqicjS740fC|q&P!J|M
zeD*x8J#~<N&9a4zcWs17uB-dh>5S5z*&20RcRvUx9prpU!Xpv-F!X`xMTcafu6Y~8
zx5QOzI->^R99bhEoV&{>Ow!HJ$Z^9O+x~8Sh*it^<--J}@+L*;*Cwgx`y}xQwhQ-t
zg2rStObsLnB6XS-{zO$pTVRqqI!(_hsovjxhKU$A^(@XNszO3)Zf)ku$Xm0QAw&#M
z`0Hj!`NZnzX_pun$3K7kZda!{c>_<cts4s5_Zas*KIBQr9+LP4J>RH!27!$|$`1EE
z&Zf%1{xg?qNS47&eWKSs3ne22`XFgOM)OF~+Y&MmM)?dw&om!a>^ehwfntR<2EPgF
zxZ`2H^CA7g^{jbBbLvp-pQsOt=0XV~Suz?g(gz7aaD<wR&I>a=7EYpY?7^aN)PbVH
zQ+5I2&CeAPKL2{xuNim?`yRBUSP=qyUIszpDP*SR!Hq0i$mMr(`JEb4bgep}?VWJZ
zIMLYZGa}{&LA>(7$U!)V)(8ma?rKDvEjp+z?78l4)N$$Ulm)#CReA$@1A4Xj>atk0
zEeB18LakdK!OTwTmO>{JuXHeP(n%~0OHjuFyTocOIC<%6*=L0yyzr?q-Pb7QtW!15
zC}7lfCbBz(ZT#o3w>bo+yYaf`iVBz9qAFZ<yVhw_?kCagY;Bx)@T)A9bs~jn6L08X
z{Q7$zYku5kF4i|6A$ih}l~x^Xe)8ojG-ec}r`$+?eLDdsvE<FUc#1oyTgC|!)*=Bp
z_c~RP;|~^fy!$Jv&g#QiXA}u>kk}fG>XODsXfL`(r3}GKP}V)BBK+hUG*Ad*6QXQ>
ztG{uPe)QjUb`W);+9~OK83Y*wsnlR^HlkqU;$Eg}rjv5``2FQY2be1~7$c03X0w`F
zCPGPcP+Dif#sq2B#?hJsYXpRIchzD*rL6*K5V0e3)Q*b0d^JUZIHm^FfnG(OwtKIM
z*$iW0+)&!J#|C&>^;knhM+^U2DCi9TLW>bbLblIxIrC~Z_UPA^*&TQAfj9R>yFeGn
z5G%hz;*YdRQfT8u`WWHzn~hB1IAo=$Gs;yIO!evcR2R*}#k>$&tJcHjgh9|uUTbaY
zw^8W-uNP}1G4Y$g5DHqHck1c|#jDZ5=pPRW0&8tfIh)m-ed`e<9V5~sYD$fZr`!Je
zV+7%noB7D^$xHTcypKn}wA9u+C*DtcwCyp84hFPeQ;4b(l`??Bsb{MSpE*NSK=FYM
zGjuz2O4)j`^gQt~TQgfrde95ZdS*Q{wG4vPO04&;ol1_(=AE-S3yihUY$Xg%()*-&
z+o<sEzn}UKe}_ivNwP*jICod(XQ_RXvLYQS?6sX9ze>;jxgxyj2<~04kIyhYNS3uU
z6e;tt+B|kc9_n0y%!zLGuW8E#Lqr21ZSxF_ll|--E7;;#vt9>vLjmj1?B+g2iu`I|
z%ln;3o13=#TNz3t47}#J%nwlEsyobKQj`=W>!+Em>D5i`E_UOppfS$Iyz1$>*H~Mt
zsoyGIIscaU?BwcuboI`n!bi@v+&67$Y9br^=CuZRm2dGsZRs;*h!#Jgdf9rJB$Y<n
zo=yP%`8#^*1xkX__r6S2*lSyP-D;k>P4jYZeu&AWKi5UQcvT+=Xs9Vf>srgwB70QW
zeJ4@j$W`*CALzy&n|l2C-3}1PY;BoAGZiy6Gm#F~cIN2Ca=pC+rB-HZRCxdMC9s)U
zLWUqP_6waIxf&wd>LQQm;M`dwAe_4^Z^WAFkP&#|E`R;Ka^BD7HBZ-*{#8%<oZk5e
z4{g*s4VRB1k%&NpL<)T?w#}d=V_^#p8_M|qp)7gxn%24A@r*r19q;+3LJWzv5kggp
zWvO*DQYgRTo2SpGEw3&25I<C*MTLv6AGTl%*WGCu-)CH<kIv|9t+QVH?Yd}4M)lz)
zoarZpHere%yzF36$IA}_#|OV_NvGLZ8MUJ!2}FwmklIVgjk@&R>NGNN2nF5doH#yB
zpa04*I>L*OlIJ|#N{dh5(>j-*J|`?+%$vTbz;Qcht{)EF*z{=Xv_X85jD|`8Uo(Fm
zfDgoYYZWfMNlV9|qE|7f*<t~mlIfW0*FwSBdPsjXNO1&Sql`=ArFv3bw24)V5NP3Q
z!zeg(2=K@?_jE=L!nw0XKsa}o&qb|72P6Gb$CoeC2ObCEferGpm&?A(=@v}&Orm0A
zax)gTG#WnkglK3%)J;4gaOBr8l@|O2;ih{v#A2Z1Uw^2nQ^-k&lKF(y^fJeadYM+w
ztc?dxV504oq&%TQiwZxzsbPnA+^2C%{p|mW<II`r^XLqZ&RDw5AT$!qDm0xrQ}GOI
zRx=jX$y@pP3k+*df2;fZABOk6K)M~ie1%5Kgr)$ti*IMV!+1AQVG<oo)X;0|Cd03&
zJP#FwB_LkJW4IV^SM-_u-zT~Eem<zkB{%V@bM)9fK;-A|lUF^B2OiU7H~A!MO3gMJ
zjZ9Dpi1!k_vrHKw)M#L4ma-!X&JjSB&wf+icA^0NiftFOep;t`Z0s>JV7f&Ld)|b&
z)@^Mi2lYI&wa(U7(S7xPtz=Pwp>WZba5Q!b)#aNrY7oxBHS!V8-Sx(k>wkW4nYowk
z3jrL@U+p$-jQR+fnpTBw$yA@Io{o(PHLk=3oF^tU;;5BEE#A|U2NEUYx6N%g5v0r8
z6Qm|n+(|X-MO**ZvMnPgyX<CNGM`St%z(;k?Zq@BL1OpJsg1mdnPh>cyXKOEK3)bf
zJi2vH+M)>+f+(U&+CXjUp~)$MSc~&B%pb=&RVTq&bY)CJacRs&osv{H7q6yZIdvSp
zpIz0}_vq1k3&Q6w(>EL@U}J`2gK%<;TA5U4YBp^o*rfVq$ObXhB{vA0HeR|F$uOsz
zm9mYn>c!XU-aFF~QQ<Yub6Lqk;l6Wqs4I?IDXX@Zd)BjZW2NxWv136*kYN5sXfoBr
zdkI0-ZzKdljVgsOF%N|!50h`45#Dg3TRfjHeNQ*du=OJT`LzPv_OLFRXLGC~AugN^
zAan|<K_xl`<DId5xSGdibh^(OSE5@EW1-=nL~1Clh*8vPAy{aRsPNqnZ}_kHy&J9n
zfosGF=kzkST<#7EDt!L?8Y^ta?5a~!3cTz9S-rD#N~U`B21(+P(k$Cji>%hm6~8dV
z$s{EH@oR|S&{#W7J*Uk@@WLC8mC7@yj1>B|V1!nWF!8WoWtP~yh4#eGWzLcgmdGmF
za(AdCMQE_W7nuuIElO(BHnjN>J~OabLR2pKMbczOdxj8EaP^K7=Q!H%VP(3{l6fo|
zXMUGUeyKy#Foqdn^ZC>mYd_P5noCP=n*Ir?9~rOe(wp>`Yf$0euhnl{!Qs2f+9~$m
zp65S>WA~7wSIVYS`$5PR(I}7!0k4LFKA>o*x#1V8fught$qIOWe12H9SYPurKKcrI
z*9+vb+X>*D^pi{`c2(;%KO_o{DsA|*PdB+r73nuWJDx`p{~HPyjfIdDF^U9jHwcXp
z{&)Unj@IvXjeu}YuT&kfog(g)hwf(_<*i?1&13xHLEisez3DzZYHykDGu6{Nn%P4t
zPR0@ENZr<e3`;TF;}1g{pN5gIU6WK{$L$S=5RN@i)X8PP(8c45aN5P{gxZ^t!&`E+
zIl$WOw_j6(Z4C@!2m&|5!rgXunGpu%+FSHzcWB&IKlE*_vVkG(#c_j9MYf>~0Y8jP
zjmHjvyVe;5e(2kZaN`<Xy_0<QVy#1yB320F9TrWnXoAmQs))gVGao9?@o3nswC`=Z
zcWci2{Fz*0MREks`#u-qA>fd`xZr21@UfT60~@&gVa<W12(LX@UT|ao;*)2Z2BC^q
z34!3n2MsE1rOcjNam+UQdn<MSp8m@#<c){Q!ZCUSZhKH~dx*lZX~3pIGdC)imusk0
zV|CQGqI23PXnEyBGEr&X;ZY-#P*8=8g8B4t?cLo`gK$o*QE7BeFGHPXY^em%EcW|@
zgJj(lrQ;?0%Nf_}4{p%dDV&@SH7+um!ni{es>JH3PvP3lW|E4NRx6F6Yw6G(Vzo-!
zD5cHG9n_Hx&Px``v3tn3E~PBAL1ImVe-#fd{)tGe2O`aI_Vxys>!LZt`3Yd0F+;@$
z<9+fC>Jbq;3dAQ{Yct-}LZ1b4sA)=n4k<=19}D7ONMcPGQO7F}M;(W*6jeU{a*0;L
zZb?~C2(?l=7K}08AwaLDBZ!MfT2V9(Y-(=Z@Hv2#SS?MSoFs*<X6n4hZm5?tE)2i_
z0{6{x!wH9r3QymSuU@KK9V>UO)3+WjK3HKqPQ%#L=k3SH#`8DzD%MSL`Ca_-VJ63z
z9Amu0c8l0&3EhHc?#EvoBj31Mm(G*L6E;)uwsmYdDPw)T`5~4qW}ahuKv8Jf6^RvT
zXDM`~gmjl2jTV?k66h+mvi&j?{_Mc;>0cDuqS~gENf9&RBnYDE?U99Jj2PkES|cEw
z)2rF;TO+)K5R^l<WK*C0ms>K{&G++^<*a#}4KqwmuwXug$K|0!idV}Kjd<V{5%Fn%
zA?;j{hW)nonc&bsaD>o+P`Wk=XokaF;Ckr+Ao7U|G!|)nD$=5oT?8?XGWQ5+T}-?X
zL@jVM1EJ|2H48>kQ51DC%bFlgq2DtaTIcB&iBI@6v^J8ekZO#wStT|zLS@yi)(LC6
zal)4_(GMOk1uU9R=_rJtOpehhIqOOt?=V}_uPDl9+=QegnpVTF&4A-&C~@m&hzlk@
zt(RS+d+a1dN@0D;5fb2xOZEAyqz-!h8r4AQC>=^lLxlxnY`cg}eW^S%6;IoVUPZ6s
zMXPvlBM)w1s>kvB5(2g7g#Bf_v={E@YndE3k9<(=)mjBvw~57*jMWrn19*-UFQAt5
zo@WsHNW>E<)D%&Riz%#v%g%ax!y5|5c_GeZx~V}ZBStu<)(8ma^in55BMNHH*T9MQ
zl#VSHG1a46(kb}B@$#>iDWHL=S)G`WK~2#yQYaA!BPt-GDrwk*tyF5WNanU8PY59^
z54BCm;s>Jq<Yu;BV7Q3r85irO8J5oD9Y@P2e~J&(DrKM!Ce<lu{*(-a7yu7Jq5VgR
zysasjstR5kB)<7pEfrO2rPt@Zr|6=EW_ynVH@uBuGEnqckYZ08X@O<NLa$tLtM0cG
z;^Yh84^_oGPLLb#*83lk^_%d4n7v8*Rsx%501jKp`M;o7Gp0?4BR;j<$lR<f><tJ_
z!<5P5P}vs1^0@Ok;KpB22w%KN580K+XZZUQM4=E$N72Exe*D65yfUbnt=MOK6b3b0
zEnv@WQC9S<001BWNkl<ZQr^1IDNyKnyr&K<U&4ky;~iYz1}H{z>TFHd+W@8v@b+^A
zRmm@<ken*%Xrh7$pZOlTOS&6YAXQV!h=e$ODZcN;-nIGGo%^?s{WiZ@qxFB*8ubY0
z^m^NS2BD=U2x&aqPL-C9rSq&EH8}?Gzn&qB#sD_XGSj!r>vqaz)@%6eAsZ4P3?-;N
zLA{a!KGOEx-j&2PjPQbMxc5=+U9VrbOo2Z=q-hhHgD?w5+U9`-PObJ>>wh)rGn<Ey
zMI`vaS$@I#F!6Y}>t20y6R-MksFRDoN}bV$TD9l94&jjGeq?T=)&N%c6?o-Qu|Fpp
zXY^wyN&x5B&_{)du5n!8g#G1&RkEo^uhzypkv`D$#FNrzxJ{VvK-=ojYN-;7z;N8r
zrWbWW;ShLyn#v<WSu`_p$2-g)v$x8^305p&mu0M4L0M21h%nKyRJl06Feb9*$4t!@
zlaxh@3(%(KY%v8x)0MTY?x{76S=J^fu2#YE+3$1sz8pE<KYy~e9-*L4j$b!;&YFRh
zKujjn4wT_%cXmg0(YdxpjBu{6+?-Q~22|)i5EgAKyKKoshi*Z)K;hsWQTXZ=%%9+~
zO-#*bw<|@BD-lnb^@`Z=zuY6tJ4zlWl*w6a7UtP+i3mnECYr1istE|=m-Y4GKF?e!
zhwQ>wfx?zSr=p1>P*_}<*af6bGfziK4a3$osHkXa5jDW9q5<(Y*V`=M&yJE9@O{)C
zy!d@#yDiO0nVV8Y>-jp1bV<1|=?BRW>T5PW?z>WaZ57cVoP3(D-jT;=ELpA7q1!<m
zwK8vvPQkK;eEfWXv69}voE2cSiF}M`X>+pXDBp+32z`<Z1@NgLyyu>7FdI!H_CnnK
zus*sGfq`eD00}|%zJmybSlhBw*u32QO80~HgF6NHKW=bXWVWhQp4wY1gZJi?@00`(
zheu*WLx8@g2!_G&IXahKJ*CKREu|uMsijtS+CCP$b#ffw17Fkc{B;G~|Ddt~?<s}j
zZtpK!K(Au9;_Tfft%q#~uaSdr&aDw6oa-w&D6A?tbz?YSh3vHrTTZfM9*ZZK9Am*a
zizXQF@Q*K(Q(h?o8)xa)4C<C@)Uqz6F)*~nFGIaC$)d{tFkB{j$Rv`~$OtdGICPvG
zxP#PzPAoPCPCP(fv#TDrl_o}*?EKnrwU#z=v$okVUu->gxHGJL&>y>}9I~_QvmM<6
zfu$3=bRrKRObl3uo^PUkPe>9liYz`g<Z@p26}O^}L5&J8IaH#N9HCRv?SM1`C7eSY
zZ#$L~SF`&zNj2JHbq0aMV$ml&yTpAHQf7mHh-okI{fk0?GtUbuQV5-b<x9}O$6qEL
z$5@AMNw=gZKrBf-jv9_q&-F9h`*<3=;ic!Ll^5F3!CsIEgz>Vwr36ib?}Z=?w3PtY
z5_WlMhK=Mnp~xL^{L9&T_$vG2GvDXban6+*3#4TM!iT@d^gwzQXQ#k~pe{B_b+~~&
zT61BI7~x!B4G(jA?f3m394b35VTYx33L9qY(x$L*oR6JPt@?)t^Tn%~n$e;orAGpt
zAcay|xD~!d3XP~VqD>+82_<%Nl+@GOOeT}JLd6&%!t%weT*kZ(6CLJtr~~nPhd{@1
z?4-^NnAs5S9xp<R4~3>jDCv**SL3KEkO=5WGrnKbui5VquD_4c(J7eMWyMkyd=Nyx
zb8}0rs?<seb+WX(T-^oD{L_>>l7T0tjK+k|I4AZM$4CgGqK{AWPp^@(q*FF1SO~7L
zpHbH!eBg!htWRj=>6A$+qavs#`-Dm=kUF~w)*wtWqA-;7CPDS8t99irE*kt)WV}>O
zb<q%*-=$L+NhRh0q(qyPHejERwg(WW_+azm0UxM5PGT8T`Zcq)#AxyW-HwfE%(Y6N
z$56HyEvft)pG~bA&po+8c=#$VyNP2DOuboQ-<?3Y@CKf>Hy`?re)#2XP;2GwjD?73
zRwm1j|7QJv)$iN?%ifzu+jdpe-oG)|+Iyes*17lQrmjf{2_dAe5r_r^0zp9{pn^)J
zf<6=kA1Fj5@cDeA2m%@fLah`*kh(}gLTX8UlaK^ReRHc*?7i2V<NYzloNJw6YhP>M
zr|o&oo}P9+oFsRzwe~)<&)!ELeN5JW$u(hwkM-ppa)FP3p!wzFWzW?dwu!kZW(WS~
zphvG_P&26c!=K}So+SvsdK~jhj2lKxrh_R@Kj;*k9@Ve??@gIlRyfS~*JfO0{|*Um
zyd)jEyKG#++<+AW`Zd!%=K4(cnCY`}inY^hT*0Ol^5h-qu=~@#cco4lOv;?OWpprK
z?FDaZeti^wbr|cKy5f+Hj3S5b&Vd`)dyV@Nt!?pzPnKSMbbT~F>c-2Qjc&#9QU9}3
zpOfVQC<`Mb5GqpUJxdMuY^AD6Flrb@_xgYB_rj<tHCj!6s%VQ|+P?a-47pYmmEspA
z!Qn@V<$q#kUFGU)wF(RyX8Ziri=<ckA<6X5CJ&Zc%oCdz8kU?IN*P4eogmTVELNkB
zc0CQo2uqo{Js6d4hmr}<t+SS5VHtOI<6R`=X~&2LdHaWx2L9!8RpFce#wRb+w|-hh
zWi-~|n1!K@H)%`7*KZ!Q9^%P*%&Z9`e5^0qS=Qb#e(TT63yyI-GbzmYR?l2^K<?T4
zqq8I?K7EzWFH!aA4QLX*Tq+AnbO*WywIKjT6xwD!v5J|uQ)Dm(O>P|3>{m2Lg9MHD
zq$Br~ebzA7XR4-O=Oi;>#v(?uWkxKED=>;Yt%^0&iSs_IcRa)$5Axtn-t-rJ;DpU%
zGqQgC3Vqi(^6EE=z@TPv#B85&%DzfPm6<-OY+3Ni*89(usJ!Dc#z}g(Bx@sWMWir7
zYd?^VPt|TMZ{kj6lE|?~s%l#njc%i*F^Z`^{qeh-A=B=D%|+Lxd$-H5p_g)pL8eNX
z5tacF)+&Hd`sTcm{Lu%OBr%Dg2OJO*oO!xjdzIe%2pd<h$7-(`_d|{oO8L*^{LEe#
zNQm`TT5m~{^0g(;O*NQ|5K%+2l>fAIPecL^e%-bQue=r$a_7IbFQ<&TgW^k9P)g2g
zXGw|sck28|mPTCi6Nb-Rg(Oi)ZX2HHqL0Nj0m8@nN+P3+$FF&|Wr0!$DkUjPk(j7#
z*G?>sSv}+Zg2s)$`#)ryc+SUs{)2rLEz1H*qHjvRq(#Jxfq?bSr+-Hs&Eg*GA5I7E
zEt^&`H(*dRsHg%qY1O32zEDq52UH26HRhOEA9(XKWM)7J)D?9a_bTegQCHmc5P$q^
z86{UWmqr93DJcP{$z@5+_p)LdQL4aOFH&Idnun4km8jZAi)C+)w9XXAeC_hHqDE%k
z_TkUQ=RPIecBfu*v+lLdD^-RiV;Cofsr2c4X6fGR<PFc@DeqxgTc=FtRV15_T79@E
z)3E$X3Q0{QG(c?p8h-S!)^NaX9Jro30Bj%nzuW?$wo$H*h2lS{K-3G#NgV}E#_U!u
z%TPu;IdvFq>t{9>OV=A@X#?h)9p^HtKL-KfGj9)HzKpkjB)#&P^1*-Aeb%u!;=Jd}
zBMUT*PrF2r7_?GFE#&V%<u`4z{tK@O5I&~YG5d$hUQc+oM=}EQL#hflEF>=wHj%}K
zN49u3^j@nOMQj}4$Id~O*L>I5m{@mt)ZCY)CFfcc38KzPtaUGMI9<&19zO49(C>V{
zIp;~TaigrAW%UfbK(C?>Uc5A0zx`PU>IxgwAbBIUSs5aPz%WvEd?gR;U=*$FM--`)
zaa6nI8sA$L8xwCg;3cr6y!F}Auc?GLe?HC6gqQ``=&sQ$c!I%TscY$S?X=@?5$iHE
z#GRWa1+NP>iY6BuQ_j~GeAbc%`NnH`&fjUs{76gWiY$xUPPxRE|6j)@<Hbu&N=#zP
z=y<GO{HmUHhM*j^H&5P|bB~i@1F&@|_aI_ToHWUE#&dp<go+Rd>Zv-7YRtJXE~r`~
ze76xI-;^;zKNYpnpopC*)K59ieYI_vF~1VZHJds8Nxbtz>E+J~D!lSpg0k0IVq)t&
zTNfFRJzqW*n(Q^gQcs?&$IzMp;bV6_^uMZa{;pWiWhLCT#oNL{&aN!>|8Zoo@q>I+
z?$`o~DxbVk>q@G?34OgrL$XSt^$)1IH*NdtAYLeq6Oy|MFs$+YI_DrO==II7og|x9
zv2u#39=+fJD?ywN8va$4Cv_PRQnuRYvl5+_2{me4|ISg4ATfn7p`b=tAgR;h?nAIE
z4xngdc>(aUljVp#^;H+QKGh&ZAqc71Qabx;rf3?=RAk%`d&coWg-yG2%`MDLqgFOk
z$Gl+<@(zL~D!B1J&OJ#G-tb9%=}~;-CR0tN)CF5!=z%yQLJ&#b9bj>K62-+yS9cQ$
z{mwVjnLiuudr&XCR8QQ8C+*FX_LjvlBJ?VD4zn^Datplrn<9Y_2$erZixWy6uBJ*7
zr-O8wDVt0&kz5g^^N|S4ftK8LQy8s}0}~6nIqk`L3P(q+T^KPOv15^~^91-283;9q
ziel<CSN!n<{~5n-ll5PDO@Qz*x4!p>)!Y<w17>=@L*4P9vxG*7hy+&x?W_%Ac8sJN
zGd7qi_55R`5-MR(@sYodRmIUiR~1E6z-xp##7tXtw3SKe7PNwDA|ciH$9t}neGZh_
zfrFeC1*@!u8p$){GmcmVk}_^G>q<0<Vf6i1JmE|tT0vBI`HQrn)ta@ty3F>=0x4~e
zAc9!Wz?~225qkl=_f)-fGoKrYm9+wG%8axoRiW*#$SH0ajZ`!%in3;oxoKi9S&<N7
zm^%sp3;9&gz#BiIFF#FybAx{L*4&ehbbIPG7YIWhlO&SE<T~o8)4?PvJno2KPMH%o
z>67+muQjr6mR=wTH{M4G?(PW{Dl`d&U|6N(^jUvgs?HikJVHp6u?3>$rigZQiP|G}
zoxD2?*{i3tbkIJB=7jP-3VY6iHHN<6Oi|$-7o=A_M?U)<T^g}{k>5U39^S#+0HzF0
zMUq)=<;L6l(knv#WIcw~1PC7!>#fhO4&KOg4?$N>i($!*C6f9EZ>6=SkqF|4WTSwR
za&<?&M^N$NnV<TTBEmIqw*5Xmu$}YnuZ$5!RN9Tj2Eb{qQ)#Ims`}WuJ+5r#`pov3
zK1gQz%=8)ba-2%WX4Fxw2%(q`sd+w>!C02;AiL~^C{+2fZGu67N?jne(qIiqs8V}t
znwgoX6VR&ShY!2W=Wo9a$`O08<C<g$z42$NP|W?_zi-_L&WCcxLUys{e`I_8+zih>
z*{g#HNeSwRZf29H{ODm2zWi@`+F@uwln;DeFMX4MKI^lcK~Y`rrNN<ySK9KZrhFx8
zr-x{Aal<$NIsVcy?7fCfD`n#xz5J->N1mQ1!KW!T$tj?}w{01ZppJ8nUXq!&ND#Ld
zl~4kEEQX)%AI|BZrNC)dZbfGGQna?Zr~>@pPCex)dDr{nubmx|^6ZnvIzV<Vaoqm$
z&<-}NU~Y<s16xjCE0RJJG-z_G(tq~v;$;0-ToWMNRoCCYtQwB7j<?~MM;7?;BRW3>
z7>+q~cltHGz-}vK(<)9onCZS{Vu>-QQSyVlVT{KPLlfKbTY(4F4s9y_#B2hrh1(xu
zzxDjnRUEf3OARldiCY)A?_s@f8~=1Ir@yLSF57(?k{Oc%oOb)D4)g+3`+A!5pvR!{
zea)6Jw&ITfLM{i|<~U5A{5ei-?J9ba(!i4n>fGrVEhaSh?L@GFM@gv@G5D)XM;#TI
zA9D8=-L~L6{jK-0X%+jg19;`>a`1XkUU6Xzfy2(JB}=kaBUB`by1Ao8K{aXAl3YId
zrF7imL~*gv0T}m{;9EZ{W*Fx%8Y4iLz9}Fa^VW3oL2}P@m1}H1GCrfS<Uci2#*SrF
ziAiD-MGjhQ&OB8P*o{?FZcwuK>asfs6`=y5SEEW*W8nsB_9Xx(g~os-5tR@Ge0+!I
z`4}<NxHgdh56Gs>NGeX5;BvHBw_mOi8oiE6gX^NkR?m65gXl$<X}_jvIO!mc*h|;U
zuxeU1SBPDn3K~>X0=41Gll9nJ6Cm6r*Z1F29kC~0xzRVu`6Z@m4%=N;Pcz%sxq+-0
zcr>L2LW($BA~Dun?MrU%H;NV#ViUl184yZGIx9G2ySXS$<ldbieCBEdwk@$VW`2pK
zhPi<pu%6dH9c~)~^CNaFv3*G`*XngolZ6rXH9g1LSz=<k$8?W6bb7RvVdE)cegP><
ztf1<K7hn__MjwhBLMeAq<?%?8d;3CW57zHNj?y+NX}V}oQj!odYt4Yv<jSIob5nyc
z;DU?wPtO+MkDehh@s^J@A#l{Wy&MT9DkROllAW)cf5MYjkrWlyu4HbSC`guPL-vRo
zibVAs&hOpMQyvdM;I}T&w?7w@Z~hNETg1!n<R8XWw^-PTS2IRfdMAAFR!SiyJ!xq)
zH(>9h#X3g^HFZUkAM#=Y5i`P=EyX?w7I!8k_Do!CXx+h*?VTM<t;K|<{EgjXD9$Nz
zQnrvncCo0#p)P-h4N@GZ!8BDB4RZe9#@~2e_{c@+MaQ%MZmgS?*#Z5E+ZF`TB!m=v
z1Y<&xYyRXX|H;3*ll5P5O@MHhT=on9)WZ;{1N}h1A|+Pz`N=k^im5VWJX0#AQAR~!
zQ*XIL#CDb-gfhpc*c>uvDjRW22bGi<M}WnKRWqPW^_l8%+<pL;-Ok39-d15P`Mrt|
z#KI@-hlgz<i1XSiV550N=m)C6sA1Gln};wtIn$~=wVP{y6d5Omkx|3Y`3IOH2bI?&
z)hve<NN|CXT>n#AzlLF<kqeXiI-7YrYo1&NOS$TK-t**x-$CHy18EYkK11H~O?~&9
z$G`WEz8zS!_*U94NoWv0{)u$Tlf(7bGdC@B)8w8%?^n^B<C^j}(RfebLtoQ({*wIi
z$x<q3=Y3I8PCG<iQpcGP!<f+U@##T{l?j4$g5?tO_itJH)Ne`<1_S#0F{qjDG1YS#
zYfpF-`N~aB+9Xj`P!V#$vQi%?QutKYd70ZPoc@-4n+7e>Zsp<Id*>~KZJ97fE8uXL
z49hJdRi!1AaNN=I?!Qh`)4cE*@;}ZLcBb>rmVMSzS8lNS%tQ8>mn0B_9rbR#b&5%W
z@UglkK)6e;l>Zc{1p@OU<_27RJ4ftEuc8;6^eEiBovLzM9qt)%IFx{ZWG*P3*{30c
zL?}LW+n$P2np}QN!WBQ%ryeSwxI*7}mi+B^^xe;w%WmiKn{pg8p1_i{ZE}c-nE|6n
z73kIUdZgqPzDiJK)X+r62^E5N+MKmWs@bNfY+E3y$5%!rR7h}AQbVYWNvK%AV16>8
zbZ3`d>>L|rJh>~18Z3=-103q)=6iSOK^wyb-%U?DOb*z<sRue5yz48ho0BK(si`nR
zbFVCq1~o`K?zr%st99SC%*{~Mxg@6LjvpOT6XEnH_~l)3yQgTr_QU%A7t7g4$)Ot=
z$95=3QeM3<1YYwoogeZKza}c&x6L)~*#R&9Jppe`=~YbkyxY$r3u2<Ks3RgQj!=Qf
zU_gk}c?7Y|qRO&&mfXo+Apyyvf`AXFEGX#Xpc^G3by(IivAhG)QMBmud)?aD(>~)6
zA8N7GuydX#ypY8)v;8!CB-4EvWJhsQ=7;FRer*YnC`nLNRgnn}K33NR2zSX9C0iT?
zg50-VH_UPMT|8+YR9P6Yb{0`$;>x?JD(Z?*IaR7_Cl&@01h;_%by8?5mZ@GLP?7Pk
zU}1^r%Dvcba6nY#-M_$Pw}Y~F#&_YAwMyGnhmq6}0+mo9m9aE&hl`Ov!`g9lQB)J6
zm_xP6&Q-H)guvySnVn*Kz%VjwsA|&K>t`X**jXWO%8qau1&iovh%Uwc0~Kw~sy!k)
z>CZs4K1-3mzgQ37E01y&5dQ36^z0|eTQAc6*UN?P7`@<)eE<<_&0o$4-KJYts4_Rr
z(@v0#zy3#Qsw>#(daUwiFAi7Ss_*!m{=+Ne{Vx@icYaAP_!X%u`aNQD?mIU{75Ln1
zq^|hkL;klPy&rYR2b#z@f>Kxh)`OFN5qHueZp0-JdJr9`YGJGd^$`<YAPiZMEk+^t
z4|go1DNEK?+(ilzloGLRC!XRrHcjG#=Z~*>qnI9$l<7cK`3LEVd!x!?!{V4KFx~U6
zn+JDL1vH4D_nxquL^Op|sj3CwOpx#~x+XxlOD?m?CEGoPL65t)Fgrz60c@J}Vp5gd
z<5#}wiaI%4GHp$g+v+RHhx%Nc6UnZJoR(s2rj19*6AY~P>y6Kn4}3Gd=r|eF9KRpn
z1AE0f6QZ{?j1#H^kt$gvn@Cd0Tr+=(ZQ=<n4FSnS;2IIe))%3mJhI4q!(2lMj1qnE
z8kJQsYiNWJ409X^%>YSemcg9&C5qZMMYDbsItVCZi1ti`1lQezz~OtNntKd`yz`6c
z?4tyD%d_N<zo19%V?JEZ#O^RcAA2MLg{nf8x<?A#umM3x$<RW5Y6Kb)75%%f=<|*T
z;euDmmA7-sfxPQq^uk}4DtH!XQWnRIA|rd$h>GsFo`)A$GiPI@Bt~LV1HvW}hr~!s
zpzOZV^@CC5x*xG&j;P%I2zAZa+E5b7nkJE^xQe`DxGW}HvJC5YB|iKs1!5$LB-C=+
z4E*p`dTE_9{x*2;$6x*N`0!00v2EH0&=&?h*3L1E^lDblFx7aCGbSXkX$`-1MUdbn
z(hx&LRF#Qk^s&7rK)6dTGui<Jx%O_Yg|)L;(1d>NjOydx&k!gOsB1=vDpFNhZ?r>n
zhDMvTPOc1v_OEmqP&-HaGT126+83X+pQz+6H$c3+G>VMPm#<<?(;;QUz3pwHWgFEb
zDHU&y8yw9cVTQn%==Yo!y#KpeRT5#CnCklm8Y%~y%4E;zmBJ9b8IjykU=K4WjUqt=
zpGj+fdR$AsPR+5FNkmnxI=Ih<ym1SE_IbVJ5RThVj@=*NwV%*_#mzs_>)$at=MM(C
zMkpBtTR&$?QdNplRh<H1UYUaDwteJ=pK#(KVm?QElT;wcsgI-A^Hzsp<1>$JI%803
z*g2MzykKb}XG}Cnnxx~1rdCZA<;UAvY`f+jML1}KTy_V0tYeh?bfVDDy?}HWVaOke
zt~A<K5JeiaJx)OsF(4%Cq8ST2N~x6=;az_?K4b$IzD!0b52#9B!!}l0A)1s#RhyC_
z<rhKo87P6opel-NzG+%|{NVh}|KY!?leJ5%$@Ga`a+!B=`;go2SKB3BoDA|8U)6q(
ztMBGxSFqHuF!ry-F-r~O#8PB_%&_rk0A)Ua)#n;*)xRh-B~dzufW+>My<EFOL<8Ud
zp=yA@d%od&+}P;aSmwtv-^hF;i;<<oD1Qwji}uyXVv~QEd@lJY54ZE|l7I^1#NyaP
zaO%p<qUMy@IrQ(F90^^7#6~;UOp7ZqtDSjxy$|XuKQ9j?Pe{-I4kXxj0~g<l1}^xP
zYT)(<IQ9U3|1%zpy>70UQ^+F@#Myjj;Da&3)6S6jMYS_Zkpxp%CWj{R$qXSt;3-FW
zzx<VVfbhM|`i~cDuNH*GhJ`VUjVwkfPkVk`Mh41A872P=3?oZX#_Gc&tnH+so#!x4
zyzv?G#<S#;SL(t@oBWQL_p0^XbcQ-5K|^QWMOWaJtR)nIT}T!y6WUL*OQWGo3y~5>
zuweyjX8igW4DW6HMUtf`!ziP~Fv*h7#1JdQl5+sufRjQ>AwlvE3i*Hk#ha}Erfb3o
zcgf}87kp@gWpG^ZZT48DzxQ;xe;Wtv#=rg8W5(<(Y%_g|5J#d?-w})yR=IZ@012Wd
z3~FbJLM{_Z(lQE1tqJ-Qm-4hHcuOKSUQW5=LFa`=<Lo~doSE4vOtUT10-7;{D6K2U
z*wc<hwk^1cbl<hCTR{_f*T1R?0j*T5r<)3mP?;R-uVMs6$b`kebK{0u{V&s(<X$8x
z+j4QrD4ug>+xKnvvF~pD%#nVNfA%^3>t7L7Zh1%e?T;!+*RPbL_mz9MDZ+*4Exq6k
z(;lOm8DT^d5`u|yRP{1OnBR)!_~HH<_jahr`JYIyd8WMM)A~Qpk?Y<Tn#8z~VZ)Mr
z#oU;e?J7~FDnTuYCecJvLX(Z2AZ06U%BGZ~_5%3Q4|w|H<x^MdI5JLDi5MBwxg!En
zuxvTwUecOeLh&27V3R~rAVv?p^Y$Jo>^29jwe64I3i;P>9v!e7E2mj#uq#Q3x0(bh
zrGiGNqeZ`p2$is7iR}x#=f@#8BWj94l6c@d6BK+*uL%(Dk}GELE2)eG&i^I3<Yu*;
zk+0prQj?GKV<fnKm4vDWvOPVbfnIRn3CU$cYpXDvNF4_txpSjyzE7wMPddOOP6)jJ
zrHm4)Y+cNK(BckN#~UwMLD!s8dH;qbUu!nUYStvj+P0T%eh_d^si-HL)Iz1Cghr|$
zDnu*ZS@lOcBZAFJ)6GE1KQy2sH<`3RNb9Mw%h-1#DSD0S56+QW?{U=q)-C$nqj};U
zg7DYhX7@GR`4F`oL^Ow=b-xk<S6rflinE?B<wZ5yPJY@cBZ0sFlAdvd6rt~renCF;
zHT~_Mkx}FAC`%2)#$)6h2y<^@UHSJuK`Hx>qN1uPTcwIqNrQa(dbN+uxbY}+D>nBe
zBX{<BhFsgD1nY?UBhB!x`K?SM(E?yC;la3|w0~L+QaiA^ZjKdGyye+4Kc-1y78|>T
zs-h?KlyO6?H0me_%#WFGa^o!Aebo9e3Q2=%LPa&mq?P_Lye87<F1b=kVwCp#OKwvQ
zAiVmcYB69thb)XddS=)#iY(<rbd!rK!<<ZQV%J!U1iFlZ#8MRO{G;SQ7qUF7!ZDO*
zk^lf807*naRCV|0NM)E@g&QV@QBC0-X%2sJ*;7YF1<gX}P#M$FB#Sy%TFo+D_{xo(
zeyB7i^hNI`94DeOY+6~b$e541o%ZMDA3f^sx}#q^ig7Cd<|l8&(>T@}KHh?-3a@$!
zNAD|5qzdG0Pw9M-tR||WULce_Sy#$c#m+ZH8a?p{f5qpYB34lw^i1Srv2nq3SXAiP
zz8ysjFOq3decPv9J`ag;;?q~^Fmk{~5Ps=I88z(yrd9|QzxY-T4drtp36hDNj~cOC
z`Uq1ijcR}(8pN~Kmd|sZ8!+fG-!MPUx@f~<WR#`sQ62@nnD5&D<wo1LDW#w>Bqbu6
zL{)D3%bWji|5{Jh|Ftz?guCRjZ80C2eUj~iJK1doh<xrf0KfTRRb;A<2z3n+shq)B
zA<Enf0^>vy@7}AjPzlb19@P_;q`iPL#EwkVOiCR_NvbI^Y`mopEsgB}l2ihf^A9l(
zXLLu5k1;BeX<>xsT(#T~l*jLd!u*h4-~WCpD!VB&ng)VO{?}XAMv=h^BQ!P>vNY;)
zZssn<DPvAlr*vZN;bH@jZuv2G3OV-_QQ_M+=|SrRc=PA97)GLBT9HOG2Iolfs`BtK
z@f&yjHq${@Q)4bGe(7p`;ZtPeZm7!p{w2-ySxP=BJ|>2VrRdF+K~#jO;_0aY&2-RS
z$-4D5n`X`0Ivg>-#QY+4c5<F^sGxlP79B)-iMsY`t8}m}2!#$7UEO?1<)fvLf`yJ|
zEKH0OR1SWc&lWy3!-nSuKK-`Q`Z;C?GC%g)DRFDX(_}Y-5}*#$!s3|4NU~|Y2&l%O
zDVX2t_8VtqvJpPE*Mt%7lIuDDGbWKJZKD-|22}XQ%|6oTeJ_#Q?$?KQIw2?tWM-Ke
z`&b`oy)ZvbKBU8({O8Ng=EYZH*Kont)wtR)F^sYlWvMt>k`AMelyTB=Qo8`7Bjwe{
zFv`dI)~G^uZRBgX<pB`+>J45`diF80bBS^E(XYk`Bl(+rcU`~9zf1nwpD*)txG$z*
z86)ieJ1YF+SGD*XPdQj$_fdWMX@YR)1H9}c`L&Z|+dMdSwu-1tF??uyM*VCVEu2Xo
zbz#}vbMH0-Lh04cZ@ztv2H|UO3avLPyI@91jd|Puw5QQ}k+hTc*=4{GabB2;TR5P?
zYcEU-BWHv~uyrSGXrn<jJetYn=edkBnqM?_X45+a`ty7gKbBs_bf1|)zO{~(Dbjvg
zmQ!9`7;9Ah$8D93`PCril!=I@pc*DM!pHcU9E5h&m5Le}Bq^8Qs&iAt-61EwJ*}H#
z6xq6<Q+-jfE&&Jx(CB@2Ri|@%8ChD+obt~^a{GiXw+L=nOG+jN3ZlbEOk8uPRuuuy
z^Q`QMAM#(E{F^E_N+%>G^{7d5;&v`pjdPNVOJ^PVapw}_#M}&x`b}A_QT>jkm~;xq
zwThs3P`ekyCC!u{fxo_ridw*FDlLFs!juFW1nlr3Ke$IvJxHGOWPRVaSz6L_kC#9B
zq5`KK%ykcN(Yxl)`n}oA2y^d5_JwMvccROjI*hOrt`<q~+%x0{H|qg=2&yTub&;qn
zjdj?#33HeSVp$Jp$j`0hxRMFCF+;zSY^y1CSq*&aW_|qL0p-Ml<)5$8wQFP?>E(b0
z$=`(hKa=-twvW9$QgVSXmI)Xt(K<$58WlQ+Jp15<Am_hoc+|d359B$=GE&c}v1oFC
zPtE_7#QHLml2k_xqul>mKGG=#Ns=lgnPqfRAbd=(2@vk8tM$uByG5FP=Bqd8FP|X4
z_enkRAhs?tJz#Z(0u@ARNRfbJhVKmB4sHx!@{iPPCMsFxBEMoGD;h*q75VW)x_%`i
zB_&45O`Aap84*pID$!`6ND_rxXbTM8n>99O_Rg>VKv&H$HN~|*1mT3oarx#vCp|Gv
z)S(T6vHm&Ah#zV5VoDZ_bacE_Jf->HvAGZ_`$dzu9G$XFi4I}<)=daJv|V3%f^1*n
z)n|wmXt`dmx{r2JAlOjcoFpL4qCWd2F4mP*&K%v^WC%3n6#?M~ckA2~TNf1=Cq|7w
z$zf{y*(JCWiu`y}qO#9VC(<S5*aVxnJ68X>nWujDAJd5k%h|`u&0DCGdsqx@3xyRy
zLPkNiDLv|u3c*qW)WiVy>>xpM!PSglK}4izt^4lA^niZNQf#9hO8lP5p(GRy!DHB(
zJVeZ-dvnU%ao`@+&|2vUNmS+bzrFVV%P-+%{dZXtAly|~acXEllS@NJ$ewx#x8BRU
zUm#z&Ru@KWUC=>arUp(5HBVUzN|j2#1Z6Ukw5+gA^(2p}aE4TR>fx3j>BiNPM9w;a
z@lZ7zI-1l5d52^|rdJ9jwBuXLi^W`S49owKk6h?5!a>jVx+m_BC~y4?>sB(3)JjmA
z<YAPO=le)5yh)}hDyV1>u>zspTM%_1%v1?-3Cg88&EJ^q#jCStJV`Xj|Ndn9jk5&d
z_Ir6`Cp(9}znhKoX@|(Q4|-X)?Y%R4r`&Xx&ef<$w?yl&o<~oZQzrKvI?V;S=;D-=
zHM4A8^#3HLmeSeXh03#L90=9Zul@1jHPMnJkV?}eh;Zp``l_D`ulxJ-f)nMS4G2^>
za$BBLUnF9iGH6a_A7ShRBg%2huMpEkQ(=VOU6WBza?rL1v|9CV(5F|?>oJV<aypV_
zCP=Ons`|UE1@H6G%2EIUji!hSi634+E4@jD=&`;gpMYI;Wh#aSuD?^)ukq>LyU!}Z
zD^KTJH|n#FmR`lSMYb>MC^Bl?TG`~Nvu1fAZQ0kqS3ir7s;g1t+15H})k-VXSnVg4
ztvpxzI_>$TAF=Io_qJ}9l?jaz{%8w>L9SW_5I%bq!$vJ*+HR+m2@N)yybs3Z_R%B~
zdDK0Mm*PVElb<Sab!vo#g(E6F_hfH4x%*+ZEi!CSr5Bj4SutSq1A6u$y7J5Og$`!o
zD+#KKs%Nh&Dw5h(bT6uv5TA&|+>__6go?l$&XI*Ni;X*GN7*1++SN-Ef|m(%b<hih
z?OQKVB<6P^YrmqxFP<bH_@<YEJLie4rb=5N%(%Gxq1jC#%N}@PggO6KrL~OOy<3g&
z&wq2+tLfKr%3+=ZFzVz#G+?tV8vHW4AFT#HHs8wyLNo<UA%Ui#T1{H%Cu_n8chwd1
zc9V?^65)sUvwjmF{5Bir2!Ze1q>E#cvTcDuAFmWv)Ity{^{ixYJ7X!ml?t5v^cEo~
zf~Yl4M0DRhWpUAWTRX@%aOo{t2T0z&RuY+WS<e1uX_ZkaCRV3G`PJI)y#%XPusC#E
zX=&3Qjv0;_M;fJ0KB`_k-NnJU%3bQ7xZSA~8XXi-6*?myj2=2m(+-DAd0IjeHb20z
zs~rh6bDiyr{ONO~S5b#nhJDH*Vuz34J%7h(uU(n3P&A<`Ri#y)?$oIfN((2s&0yz<
zgjh7@_pj5L0Lts1CktaAJc$r0-~HQKZ>Q*+iYDB#!iuzXP_r&-;~?zs{N8P<fj>J}
z6h!^R(_UNfY4TYb&EI74nc^DNpHkQHSzWGPhSoS*xOfnDUrn!~-(!?W(Hj<%crCdY
zfa@Z37mIIJu(L>urjTOLDuonOLwVej^_X1~Aly|~3p~Ls9uca*UH8hyIS^iStXz1d
z0>g&1!1O??o){1k2;w7Ni#jT~fJdjzyaR+%sxWAg3S9*2GC~bB5GuwI4Q^f0(j;!0
znUqRoexa<3l0n5SJRRF->QE48p8~=uhs*Up^vr1U%Zw9Mpi+{ESigbQ2+1|VQWPx1
z@x<d%^25kY6ka2=kZ4`T5kUeMUZkf!Q8cjITCV&7x80*_XXsVT_L=JEGOIF*G>N5#
z^PeX>Zrky-{bwCk&Djz3g})L~?$c;x;T8ogn@uICb>)BWR^4NkuV1G-9)Xit9DCMv
z@LI5Uo8&u{0)AEnEIC1?U85LtOp6{Xjf%omx9j8g&2LHo<*Lmbe*nkB{g3FiA}Rm<
zU9*gxExLy)e`nPa5K5A`L}-#m4;r;(HN!$l?qd=}`+fR7e(4PEeFPM>0w<~}<zCFB
zBl&g`U=8~nr_AO(_71}UXtuXboHCO&0m5B%z3ffR-~35!Wx_-DmpJxH&-%VDjAUs{
z6PaJ)fDLlTgSvCb)<t@KW&|oHg-w!>r?gu+t!0F^T3<;y*lR9Lb$S3?2h##h4TQk3
z@y#{S4(Jik7HfRSgB6pKH=AX4l>xzLu4eeL`L9NT|L7mmv4;raaRDaz1}_#7^Xo=`
zH7^m;=^B*0Z;HsH=FxS4un2tx1>G+b0>>UH<pgl_L3-=myzBWgH(+i+T~P~FU>rT<
zWv%f2AM(f|hhH<_ByA#>?KYDXjgmkt-K0Z^HH*^450zA+ibAheg%tyR-MKQqNZqII
zgP8wFB19K8t^Db4po%2*)<%n{)_mM4Q<syN<S420UV9W-0M*0xMwN5^TtD~QvIn|m
z3ebzBvi1oHk}?2$NOmUvmT-+A;>l_Wn*$|HQa=e93I<6*L<k~Dc<(C~58jie5yTHP
zc4u~x!HA%}da<yoKgondn=}mwDF#U)si53_?Odqk?hk+O|K~5`WbNu}0))HpDm$|A
zLaSFjv>;1kfF^O;L44<SJz#@ee~)gPXR5EgekO$#O`^`E&>FdywNqu_%7g(-x>PTz
zlzO45Wa<Kx-1Z|)L;1|b`g6yMCMSi4YLx?_bQH4=#%3kW>^}t#n@;)A#W!^(`oc5h
z$bI>z%NaI08p}9Rt5k~Q+Gom)$ke}>$*7wdJMvw}CFB>RW|tN10AZ(X4t$hgM-+YU
z7dT>1Hmzd1&s2@6qgC)}e^KcLo^_-T;`rZRr%4=k_d-&dDXzSLC;w`%rQHC0>MxqP
z0eh@w-7HBNH4GzL=1IyyYvmm;7MmyeS6|e{5&eNwm9?bXLzD85$!8S9Irp$EyIq@%
zk)1L*Rh7V@`^pu!=&6Ux-+eW`<0avm%^bETqI~YPg7S?U^o7R=%Bfr9aLl#))fO&l
zhno`O>Lgo>FrJgukf=0CWA4*vQ`W>uA);&N7>#-DFLTXi)~?Ejn|x}scK*;!H?`Zu
zhdq5}p&xRWjwaC<6zn%gb>fqltO*eA%F8?y>a`h-uyH{b8#c~)lJYpo`WaPGl%`?Z
zBE3Fy0V+bzttFx~ok*8}6#P?ADTD!>Bz0<LdAHJFnxVSh7&!e%iT>|778bw@rIR6p
zUx7w%6ST@)K$CV`_d2i0zh1@T_h~IN^NXyUVI1j2YPVFn9Z{SVO8&;^pmUYHZ;FU^
z?Xno^OQ{hSo2c7I?S6xI0g47yk^R=`g}*M-J*H~<H3BgKO!t`$G?Aq-<Hn!uYn~!8
z5hG3FBbV!jIfh?us=(5iVWWeZLCx7uw5jnTp2n${|B$2*WMRacKdf(isQ^(KMi$2m
z1P%U#OS=e}pIOJGmcsyA%4U+ABh7T$WSeeGsBp>=mVoNjJMz1L@WSH+<+nbjuRK+v
zvhR(}{D`e5)=63x-f19|EC9GJYW<Fl5>t*yFN{#UcS41!0q4CeplZGtdxt`4RSa#M
z4FR!c9zpU@ky1ebcgm<}NMSN`VzO*afN&RHvD-l*a^Nrx8xGyzj?i&r6glHy`PODV
zVL!R#P92Wev8cU)P*F#3yfbyw<V2g&O@RX2E`6i4vYFyeMQugGlHX`skf4EaA}F=e
zkbAey)X-%jd8bszBq^o4PSb*R@vqo1fE(^IgN8o$L{#LeTirO?BnQH%xoI6K0;zPE
zZc#_^e<WR-PT_f~UL(}y1;PYUVZHY6{fN$rUi907(5sjkfT3WH_8vuVnV%N6FOigj
zf(s+gc%1B9qKUbYK*grU*THGAWm3l^(>+~k09_o()D&;|h`#kDCWNv$Ce)}B^64RW
zhGe!awCy55cAVOqo3c%*prF^G@kln{>djb!%oR83$p`U`ALt989De)4^q0RV+ZNfn
zz&MhWbV;*gs9Tp<`OJYxr+p&Br(_h2NKESaYC%LqtG0dO>u=ln_&vC9I}$kaXh6Pq
ztGb4tKMbY@m%$f!l%0RN+}Ir2F@zdT7qt$GYT}fcEG9s>ORp9o0xRx`LzNV%#Jw;E
zTqvg>DDz_wx$G`o9I|tfP&;5W)>E(2<UYSrCM$}ccY@gujU;7A=z3N)kW^h33p7fV
zkgA2ilGy3g(CJuaETyWn3<%wYQEHIoMG@bf%LX@W7&S~q$92ga6x~ruvBPdVrNQz|
zdv*TsL=Y_itQ}TrJ8TG~B$wQzpL{tpeNk95i@;LM&r`gCB&npN*49?nK4GH@%r7vC
z)PboUv0~g11(d4S&Wji)nn;s)XeZM>78|w?=?M!%q~dKC>dcHI-zb3v#tNB}wGXxk
ziIU$5?c8m#j9S)q+t89f3~ztATzw1w>z~pGe<!GL_Wz@G#ctDj?>4qBFpA9f8AtjR
zs|Jjs%#Yai?a|JWE{>TyyYB_U0HPwfz)bs5w8n|A{q6AReR#s2tQhd(<7pC)+sNHp
zKzP+(>W1BDRBXC(*P$A`JlWCnJH}BBe%`ue_5c~1y9|=3hM#=uTmM<VpOdxgtO*eA
z!Yj3mP-2plIBs9x(Z-RKh(cvbSLEPzy2naBe+%P=CelP#z^n;9=JE8ozSAyO4uRG`
zB8s-HV;L<HK0B8{lL*QEqIABh47aiD((>ppuN5UX&?lQeZq-oV-$l)v0~)yRey+Ps
z7nWEtmL^hJ)e}<3FXL>}tQMI9wg}O}gLHH}LtN`skR;|+%pOiLFQNc%Jw>B(&<0{+
zDf(-L+@z3HqR%-JRbtXqCLbkc`pooAG;}~3NABBBzj97LZhWBNbdSIJuKvQ4<vrih
z12zy7qlSKDkUJ)0?iC5Tj4<T~o2h-N#UiM;GpJtz$-42hG&{QG@*lpa&p%Bx@PXHb
z@7<`U9K!G{Sw98vfnOGZshXJ{mY<$-yzMxWki{{JmyhkS-f_&psCRBHl@Gpqbm~ED
zoMrtSd(@oyET(!gXO9JvveYo$*JECpj(xnS&?t5O@Y{WbkUtpqe$le~Xpc3BdrFgp
z7@`tV`0>?qp`H{7CkrM(xJ$1Lgfh6XQRJlk{pYIGfqu;(GCy)+)Fc@;Jau2a<bK8t
z<0#REL<t=%wD!9e34gkkP<%pyLBg5iCJL|rydLwjwMOS~@BeiAnPVj+szlWhLklTv
z3sa>~*FnT=mRSzB7U*RIX+@!sQ3(9*=_1P4Z_>?;)Y0#y6c;;{G78>>PE}I8MwkUt
zg-$`M^af-etSM&>sB-&Nar9I<=|CAqO-c?nq4Z+dFa*<wQzEHY2Bs!bHmDRj-b98C
z(|yK`555TE>}S;Qic@5%VfPi>@c?`6rd2IXNiEMh@VFy!$Cd?pv90S5QYVF_CW_{P
zQ?YINmw&rkPdE&UNDxrr8#mb7DIffnKH(QcU~$Y|o2UYnJ6GKwWQ^7xbxa&`*Ko%Y
zJBB1>P%~_J>TgOA#z}+7R83uxk}C)H+{TGDGlJ;mMYNN~kQ@d5gF&Yg#$GN73HjXC
zse0DWUCE{VNh|$iEn5>H+=bWgzhV5R=k@#7HWK9I{o0?K92B6g7}QMlnC>yC=~p_a
zI92q)dA206A>&OarP|#FMF@3V=%Avp2s>+E(FA43{zT<X&yp9tuX)L@RErCuqDLOg
zI6B4j|1t-j<()Zyle_n<Jmf$~Rzy1;<xT-@;%jngG%4S|ksGd8RbFzuJo5=6=tVd1
zz(5SzqmrB*wJ0d1?rHo%mjBS<x>F;}X3I_!g;T>ju85!gtuRhD*3t7VJ7_QFlXRIb
z<-{*VRct7{DuUV!tZ3;!P0QMwh9;vzO2o*;oAsa#EH=y!>G#`NyQyQ4X;dm)fh?Ny
zPj!rVHPl?HS%~fw2=kXAjo_sJ@;u(;Lto<!KhHR_bI8(&GY_Q-4%;F4aUzHhKj~HU
z0t!`N=a8KvdI56=Re@eb5Q)i~LG7kS(dTFyf*!F+^ggypo{bzZdyTdQLQf^ld_Rl2
zmaHa<*w6_P6*Z^KBwA~-fC&)p>MIHTN>F+g<U@VcNm&fSiok52xdAJtWYv&$bL=(Z
z$6M1qKOr6vVn-K^Dj5!oLMW;>P%z_{pvW(#X2%nm>w|LXW-hs1UwDFi<@51po?hMb
zgS38)j3QN5M_u<**W*fWU#DbcnB-WfW&cX8L8j{(ML6zA8_=UFvUNdEJ4m+dWV+8x
zpPxIFQPNL69Fj^zWA2(0Y0G3~9=$jmmKveoCEXgK*>*HbqxnkSdAKed92OcM|1?fn
zI#yzytzoRI3O?j7lS0=;Qv#(ne`93aaOZ>cYxZC34{gs?09V|_DAEgP%}M*qrFZG-
zSsqy|t(@(j<_t0wQp9=_TiQ)VLCMuY&DU6(2pbn#-GHMY0S!FucuB&0K9PRynFg?0
z3-A4^zT<3}A0f(gpE_V#W6CN(T`?U9(&qW~DmG5BM_|;jIA$g~K$fA5s#sv&uwhuU
zG-j!Be5Fy9(D^(FAxF#v5jQ;-)?a+HqV}N)s!d2pNFjOG(S#9B7EFL}S6{2HjVhdS
zK>HKTbkI)v-hQC;YF11$Y?vQ0KVrj5Idl_S7W9z^(j$9Sp^!p#gNgZOR571H`vM{_
z3FCQXP}3+V#~#Ru2g|$u6%yb0T3j*fw5AscNka1NsTJVL-_$AHsd(Z{3xu>NsHI~v
z*S&xgc;AKT$c>z|zwEQdQLqZW<NxBiv^ZvQfhz}99uu4Kp!2NSX&4z0{mPcr2+L)7
z@5KIhH!nU}caFlskZ~d=*8r{Bra0PJowBN^4gV5kxYGQS9gFN(WO3veV5ng4-v=(%
zx1QyfRR^SIrpLR#p}&5zTyi%LEodq>9CEg*u_7T_o60gS=(3?r!pa6FP%*LB&?u_p
zC?D@EJo@qS;eSp~Ken7?xcN>!a1ZK=r7??RYN1y#)$6ti0zT|wY{wu0p$=3PjWQfN
z@m({MA041XdrE;SP*wD6dKJCKx#o%c%cXbeXr|3Qr(-1UgxX{ZZWk;hl>j#n4@;N>
zSRS}?E>zWnU-<HW#Bbqb?ec2^guC`q<@5ux{ZHG<3R$DGjowOnz;ut*Gc1i=u-ZGa
zeMuhNnI3$AEe8ZigiH$aa;}!Y*I!|rgvAk6po@>cf0huq=xVKM7Dx0O2AL5G$WMt-
zP71O4<L!R!AY?fv8Tm>z)Uc4Oo$j}SLpR8Q>#-!4nZBo1DhwOyKre9Oj<_)5roF3{
z1mch=g1UYvdGLb)q9S$ySsKlFywBzl$|0M${0>2M(`t{vP8kF2Ad>7dln|W%rTp&L
zxkR)4=-JkGQwbHmajWjXUOse*zU7(nzVCwa<h@xMvvWu<@VYZ3Chpy$WyFLt!j7IP
z(B#z378?LVK`9!yA2?9A0>xGl%`=3>S<|<!<r$~&>{CTWzJ6`G^hN^gSfXFk51f4@
z+BxLdM2m4Qj)p9jCTJoGO=Q%N5<lKflh}VZf8!j(Vy<oqAy5YfwJX5K@5B5^Zz$0U
zp$#2v4>W@0W7Fq<w4$Dkil}PJpC?TLt+L^GvL<T+guC*psxUL4R}q!(yxP0*-29NW
zuVN8t<u9dI=lwFUree(s9v3k2@5|bgHe$v|q3Md8`QUi3b*K;{(SB~IE2f`u?g=3B
z&6{;`$V_C^Q1!f3Q9AWPmZM;6SHWS4%*Hf`YEeYBP{S-&a`ZkNwmYk5m>aNSko93D
zDx=1`4u%bj4Qn2bOAW(@&4=~Kw^k+v6-HP9gUm_|2v50Z)UQ;7r1cIz{T}^V78*pd
z9fqF*La3~UmsFE;yHvuU&6!dFqkTm?5$I)ia^#+z{}p}lv4S!`WMRbDZqbN5^$_{c
z6<X+i>Wug(eU{M_S3h2ebfLoE25&s~0ZbxUV%37Fx82Jzt2q5QS-nz{>e{tv;@5v(
zKKx}}ihS@T(hIrS5rz@7gBmK6ov1;mRD*XVio&=dCAFv2ByPIj`EgPXUf+IV+X|=x
zKFT8{4&I@6&DgZwJd)FN(avqA>~%7EKPf4h2wSGoPk?Z;d`*CG7hZLsS7D6mr1z-8
zWxpk56Zh>d;|hg^XqNKuJjRrbixT9_aia}sCuclC-npgrnv2TQ9~|368&&Sx?h_5O
z<KI<B6<%~ApZ*@RvpP4D{uI4Lunza-O^VoNrLN$qNcM3!E*cv%kD{eBKPp*9;eo5;
z<2K5kt6Mr~mc=U2cBjR*32)f2)Ufw`W83!^M!f2yx?{-e|7sw@7tb3FYBsK9w$I_4
z*szjyb22+{7PVtYua>%Y0Fz|n9kh?sRr@53{3azONt8xF4UklWh;-WZ3LT6^3dX77
z2fwRF?d{&vkN&Elyy+tS^%G_1kUdt3DXuR&UcPX<>!K~PiuYQiA{COURgV5CK&VcB
z%k^k<Ej=S*?o4p65K@{rt!uMiQwirB#hnjR1viV92Ep=9TL8L93)^asNHun_+<t!Z
z{h34xmC*M=^8i7pD`p1tYCih;c<MQopN+CvrhI;AJ+6`nrZ-!@Xh=bmOe~|5)m;-H
z+=W-aX94_(5R{~x@RvFq((m!T*R{1Sgp`X|F%P-5T&qGHQx-5yIy0{H`|FxFe_Ros
zf4tEPX_TLA$;Qr7_5*=&<JroqW>{EaX~dvm5DC!*(r%EcASF84gjcT-=6dAvp89T$
zP?B)Pm(%G7ari#6=W13>G2LgTN3Zr^&#ELZ<F<>E*wQ4D&0>sfUEqDcEQ=%hSB`oW
zho32fnkJ#Da|4;1Vo>`9B)D%oRitjHYi~jrLtlu{lTsUVQ#X-HjQ{{307*naRBTdG
z@*(NA%i9US2uP+%K3>XnQKMxDm*2q?_jPE}-~*4|`~`jE(*<R>8J@U1pS*^#v9?7`
zE2Xfv^5w8+HBT$hwN9B#<gEuqT2$7Ie-VwjgD?ax{7gFSn4rSnd^o=J>~Q^!dd;n>
z%7<PmG4YGXaMOMMA+#fiio`6FhJZk&YIWLFm|}7)jH<;+Tb@iw1FtJ2uwt6sSNK1>
z@@{{0uR2|J{y6O%vi*snV+ay4S-aG0Ma-jg%ls2k6|MjD{wr35Ds1`c7yhGvBPVND
zT@xVOg;&4Ix?<kzY^B6ee-?qO{-9DJrFLkojb4g5Mk`c+tAFHHddUup%Wu=?9OtDS
zggw_W*4BUFrcwZ6B<9|Tzk9X3>~C2ZGCg86MMy0WhL)e^hKekm`TrGZbeU_kI~`tc
z|5|hQ6WO?e-B+<;j;S6N%UM_MuqfK5;7!?u8phnf5EH9sSQvp4gmKJPjts?yZ6-Ee
zeg{=em8h*Vvi4_gm|>$f>=8)@LeGuMT@!{(Ro>;vh&5IkZH+3S^Im-PGX32%<@|rq
z{nqlchxxnvJD<@DUL?PGG~eA!qimb!=hy1@$BwvJ8qHcj#)kZ+c6%r6g+#HAdiTZT
z8et2rA#mcc!QO~7PY$LuBxM|V@d?<wIgFVoi=P`5LLda!!$WdlODfJ96-~tAq*XT%
zc^V%m^iAyyTy_V~JqqCS*R%H;qDAB8d6U%@X~$4kJhhe%BP>ca;sBpCsH!F~U35|)
zoUG280O78>2EDLyCRcqx0+L+yN?C#Yi#0POdBv7_(+Rf^3As_sK(SJ)>>;=0Vz1`~
zF1|&BPe%2ZXw;%QTm^MuNdcOMCVGhu;X|+BHUG$H%&4K4Y|MqkZkbTq6l@1AaSx~W
zxOIfMVpO^AGvmYe<oQR-rd7-inC&yuXS&C9k6z`3ON6Q_BX@jz?bSYiv2?1bGN-Jb
zMl}y_lI+*WtI6znaZII-g0<2Q80WA6=swgns#c@&ccgXwh$Eb46m-i>wv&w2t635K
zw|h8b4<9&eH*n6;vToM*^xyfkUU06w?_x#SW2HppH%^o$vF+A0{e<9s9hni9%g9w#
zqf1#DZRwzQI@+-NtcYqtqTN%j{}l)3WjAZ3RKk^a`GbmC@1@hQX-6L)JR($i{BPY=
zM>Urxi`z(DsILVHBEpqFRN(X10UQATKmfnIfnkH<@<tH1M>SEld?jvM)cw!t*=^dR
z{^D(G>e*zG1)3z8g~oxf`Vaa=oUH#2YXXG3>Z+=if|xX_x%{JfH@Bnn->jbd&8<5F
zJhYS9sg@2RR8ZHxWe2E(>v%TYwN#I6b8F!Kt!mV*l|}{3@sXGxG92--i$R!QU}?x;
ztb-&!T_%*`m$Bo&NH&g&bw78T2sLoS$47^6k{28!E2fwmFx_($+-;7+Z)}x9V+fwi
zQedf4>WY5tfY(Ita5sQVoesa8d`*HcT&EHws3*7eK|Cgov0<Um$E7(k3>#y1AB}kH
zcbl=33uBEH<it_okUet`2E6VpIsc3L$WGpHmb~o?`q@{=3yzitcXG}XWy6f$?1wIA
z7&&GyMqARBJ%W$O@CPEnQ+2eI2}|z;Uf3<|gQ93Lpjs1Qf*);RI-qdH%{=uKzV>~6
z(X*r<m|x_M^JK@6og?PQt+-lM4toSg!I)6gYJLcHKByIYQSs1f2O0(X0SR39BURXt
zb<y4C{2PItOZ;RTOJi!G4ovr0H6>fV*sOk5?VR2zuc0Ezn&^FO=EO2OS<BW02zS+0
zMy<AtP}|y=t&hH8+l&5mwZeOMn?>cwAMRX?40;ZPRYg#0oD>GJu0cZPlq$=B&}<z=
zI4vesmN&dV?*!_Kb1TmKSEfb`A|X+?>S(+2=G<D|ExtqqMLznr(LQTAe3Klsp0kgX
ze#Ojyl~YXj*nc;#CpF0t$lUpE$4DpyZS5N|Z?7IanM;XQFEnzRk`KxdlhWL?!>~aD
z5~!3)Ndbvev>T~LB94Dno@{kF^O%?xswKM(iZt4xak13u3@`)FJ4V*eqRMAqC6{jY
zFu7NMQa|+)dC$d)vU*yg>L@ZAqqnB?#42K$GHv68g{vi3o+VGJm+X|$95L!x*zL`?
z3ZEva>-2#ObY_+-uhN|hy!NU5+fP`(lKBzC*vg@G=D}tXPF}5ZbgV0X4k^>bqKK9h
zIy;UGYBoQ}aI6M$_NYJbE&cOf5R`X*MPG5M>{wz@BTxmVdn`39HLRLqs~fjafgq|O
zp#e!LDCUSYMmTZGOjf%lK)B1U7Df=<B4~w~m<S=HlyGZ?kb(x?Ib^Y6W{N5hVPF$n
z8|n%Il|XV*Xd0$%sRan{+p6u$br~TfA$CS4B_RrbbFRGpvpO14_h}NpvL@aA5G-)s
zMf!}F)dDe301TNFzV{8I<M(633fXrJuRK-O%&>NbwX;n1SigdP&pFn}+SNPt(V(4?
zgMuQJx`Jobv5vLJeJ#O=i*etWp-Y`3T3PW^SL!ICNkfp3s1+)tp&!tMgyp%c`P(ul
z52IYcNlD1MC>?1ux_p|OLx8}A-`3dh++%DaJeS^q3V-rN{rqprOOBDBZ0DRK<bbuH
z{KJ(ps7Q(7Shrjr?_c1Ub81Sh*AE%XdMCu|lpap4xpCf!pp@PT2|;bh)M=;4?rYd<
zFQ)F+lQ(ko-U2+Z6E(qH{9NMmA5iIJxEtnWt=d&h*YG=j*HS5r%C;ShGqe2WE&77v
z#4lLn{C`a^KSh?tRN|G$o+3SZHPeX?UC9Zj`8(mHPz9A+wjG(OND7+Ra@h*0s~s1A
z>Ob<Aak6&tH37n1b?sb8>(>Ot^3RMBil7FBWqH(BLMy%X<Q4m0ykopbzelK`q2Gh#
zBkPlx5-OJES;$KO6VgiE%NSv6&uLrzmc^lI;QZ%_C`&sO)w}O!{S1SOKm1v__lCGI
zVt&M8!`y%dt%Oz6^2g7V>7EZ{SUJV&X?iuiiYmCBH5T2HtOMI+q?T5K384~_R>3Jz
zXyGak@j-3dEy*US1A$Ery=)?*BvnOKk%X!=2M8fhysxcsKPS=H^V5!Zqx)1-j<+t2
z3JF!=>bp4YaRARfUJOFs{#kwfS%UKUSIQN4@b<6hKfkQN3J)*n#yJ_(tecUYBMxYE
z>9U4XYbpFM+hlT$&^@}eDQhGz5VjB)vt?AHlmg+YXn%itmE6CB@jP`+UHOC%=kdwT
zG+u0O3xu6=vK=){xK6n-qs?(uubVb`fQCK84}6P1f1#ZJB|YgtvDnf-_$PhyS<)Ah
zP%BNO5<+cWAyxR7Yc|xg(OxsDkb*gb@|51mnyhwBfN)n{o&M-h%3}ebm*3cw0)j+q
zot8UJTd~i#{||d_9xmHeRf~_Yc2%9`_UZeOgoHqPAV3;OLkNU`2pW(FiUw>D)Q4b;
zKHpD8!RJFj<pabgVgMnKL>h(AH%aK*BoNZ~3Awqs?K#!#HOKp7&b9Zhdv6dse(zpt
zef6DG&OJ@lt~zV3G3FR!ZmETSA535soNCVKF?PYKi2X_f4`r}<r~DL{2!w~)rU_D~
z_$YkqCOvd-47Xvgl~|~7`v#b>|C;#r64T5op;w__g(GmTLQ3dY==VYk>Q(2iP3ZT~
z?-grUxeh3f_y+n^LL#de!qal6snvEe1hfV>v^9hAyb6BuI?N9^k?I<wjH<$7g}$H+
z)<_j9p>h=2T!^k?y&;y%9hLs5x(p;+cGR4vP6X80C|~gSXv%)!R)Dzl=LzAzU#c^Y
z0Dy<?$x#geR$)aSy@Wx9dp};^y%`UG-oQ;12oqrk5wbLTjS7M^>U(=57)lxb)nC-V
zaV~CI&lU67Hp0Rj<`a6rfYChmM{YT~fT>WUaDKI+ixF_p?IJB4?4ZMm1yFXz{(@5i
z&42a=o$^rp(Fb(#FA~5XoKI7GNfYtbZ=$M#1eU)jq=`wA(TQycniay?+F{KK;V!(K
z%?o@Md?r&8fVz&adGGJt|EyQ-Nl=zh$&AAqeSkfTGUz*3lXq;8&@Th)o8RJaqV1|o
zBSNZ>qKTgAZ@{Oo#$o5+>Ki1s6Atg+hBXT@G?*yUgAqfc`aUb8cp(xo&KT7g=Lm$$
zLa&M$3oP?^%f|-yL~)%MQbJ|nZ)=<(qcOG)u`~pMBlm5qU~UZfITE5Dc_?1{Q9be@
ztc3@bAYx*eWGF!yeY*BFXun3J0|qKmfhKJsM48Tr5(LAx>iEo{R7u2HC(uLY;M$Ia
zKe|+}d}>HvUUrFIb$<NNlMjp+>E;J;#VrsxthJ(#y;k7v%f@$X!tERJlfOS#Ds+=1
z=dWAyz^249ZX#U21%u4@Tr~OJ^Y{nn^Y{bNtI+S^b2kAKSi%5Mg^KZ9vUg`Klro_j
zt(p^)`$G#HEM-sKDoAFiC}~j<pZl(!{W!k$V|e`0fnqOyaf0yM@3YtbL_GTS+ag6F
z^&smc+LWwq^W&gjcnLGf=xpt<W`%H9UY#?(gCVy-_&+tv9MM@)FAKcu+|>tsY;(#$
z0y9v7R=fu;KWT;t3h-eOY=5lEM|v|%0%2tCGzi1XmC6u#Ld3eh)(!aQm+Pfx(x(nZ
zdPs_h91m`u@5St%QI5jnRd8%j8I_k2UWG=J;=64ks;Zr1z>;!VA!gMQ7-kG>)IuVz
zyEi<DYvzL&o#c>mY#jl_%g*I%FUP%`wbyFyvkv`?ai~h-;`9m{%$-ZFa=F@*N>gvB
z#-SLYDlLYl<EnrBl+HR1BL42<R%iV5<0<08Cm@a#3C}w@Uh+Trm@a(*-*gq8d?YrF
zaL8JWYD|o4=CFB$Jr?wkJ+NhjoBq$}-mSQI3!e4Ib7b?rX&#dI2wB3_+*Yr>zBAcp
zCI08rI9K7Yy&@yjfN>30Pz@tkp`W4<_IyB+p>kf7t)B#LXz0K}B6v~7jAgpdB!flL
z>{X0PIQa;?;|l%iQ{rv+Tkq8~Pm06T?_8?iK9>NpA@y+71p_kzh*VJ|KhjBw1_4{H
zoI{m{U%KeO<_~hVcGWd2guD1E>J=cYgeifEYP^JiygTA^XBd-CQ`zvCQB_ek+UnV%
zMjhgyG?q~AGd6m<La)P%($C^etL!T`;+Xxw#6SOtUVe^GX^&HUFQMPVpu(UEB`1hU
zGvC~%ZjPvOjauDJwmirb(~hhIaGfKq6aq*B%Qc2MI)d&#{N#7=%#*-`2R4I6G25?j
z(dPwXalk|@jWx+J!O_PzDkGIvmcI_UBS=xv+_v*Hq614YuvbBZWxAoeEMlCNC&%h%
z&ZLP*5C!5-KB(V)N&(cwr9aCzT?q(V$Eb5$PXVjuu-Hd7Zku4+1P83ra*YR;aqr)b
zwvDkg#wTyUOWv>m1wb`MaliJR!^J-KTg?O3VC~-YNtO$J^iz0UF26=|10*9dSfMho
zSaGa8DnF2^{S2G)iqJM|owHR*bW=$fa5#v>&tESBU-&K-2l$nzQo^5Hs+T_n&wM0a
z`96L2H~Bl4=#}R&8%7hn<vKqD`74iqxoZFZqPZpGhWj6hgrHGpyy$H0Y|RScuDsfg
z6oVZt!cprAM=jVoxgJ!!=e*SiT)sK=;Mio~){8PSkiqzccb-A?bxh)gX7m&*6uDzZ
zFGE0|`xe%&2qF7dZ^jdk;%P^OV=n>yDw={#6=Z2jO@!K_95z+3wkR!=jLJtOmWF6@
z>q3#{TM;YzrdS&)6ypTta8P0*`b9Is#P8gpg`Qv3uvI+cM1J>PTyc|9;?h{78ht~R
z(Gx34LM8NsND-K#Mx#|3)9Tq_0tt{Afu6HF|IkkQJ?SX!xl*6IPUoIPuP%T0G5hUj
zrN8?Oe&^}9@U$>jDB({(tY12XhwTLj3j-_+@U6S>v`65Jx5q`!h81%#VVvpi0>7l&
z#yI&9)R!!e4auh^8|HdkIfsWlf`QBXSm<NE7nRlLZRK)=N;Q;F38Rc8W{I6~xZO*E
z?)bx|J4nLKu4=DL_(@8G(BEwPtO@UmAHsh6^Z>G-`R(*O@6(SR&x6*&-;wD?%4BLs
zN;)-akXcG#IQ3_RaJF`~W`%GUUj-2ot$Z{RzsmZ+AKZKXAMFbeIjNUnq&P983|ENK
z!s_mgv{ngO7(d^Y)a+>G3)K9lWPzH`0YE^6i$1RBokQPzK7XT5I0&N}EMtV5Dmd2*
zW3^AX9n~0RjOvh9jyrJB5ln4G9E5QAHIK?et_eEz>IjdWuODV)LC_$P30Hhqd#u2B
z?$)4>L-z!P+t#BtjB8x~J%Bjv2!8HneCKW~k1;<V723;y&yH}DN!hzOb)ia0X!~L1
zpwPAkgB^`p=*7OOAmXRaq{p+}xgkvP@BAWOb}nB3F+F4tJpFh--{Ae%=w(kJfb)+5
zfX5vYan)bCqxI+cZ*OpRZI~DvpF0p^<*S6b9{N=%T>R(w*PC$JH`MPV8JI!C0FY1_
z4D7kMhC+%&m<F%2JJYLt($v058ag2(9IjU0a<1ok_m%q9^ZBP2>(`%30l)Wdz2*Wu
z{RI5(B|7gIUiNiBNEMW5N}?f<H%nf)$0cEg2xsfT)~pcj!fX9{JLtf~Vw6jSxm#d|
zzjU(%2$oc=^5&=eq8F@++@>Rl3E1ajzEvbIT_bYrW(0uj+gU31YQli0otjj}gM%2?
zfG}5uE~cO0Lwvlt)PgBWpnvpl3|_Qbh8cNXsTAU>c`%X{eQWq26;V5`CG_AluPa};
zK??)yw+A4+`U85)3;32#>%3zKpw2jIUyN#uYJB2q9kdsg##m|SWlS<yIi{hv#}F5a
zDAqlq=!pn;N)8~k6BctL7G+C~-m)Hht%b<59tm><ocP-p@Q(ZRThHX5T%zB3S|FaM
zpAd{Rh?kv70N=V3hpdf9;>y^^9SRBG{$44`p;-wv(8OBbNJwhSwe9||d;2OO6WRO6
z#$-qtwa^2`8A#2f3!=$&^VcR7nX$kWK;7Gc{>pWQqq*>+BEE8?j(rF=Y${`f6Q6fR
zLBr+U`L*BUWnTw?FB_{K%wo2eUj@ZXFG>{*0=9j=a#ilX^Y3l8cHcF7Pwd*O9Xrl&
z+NBbw(p_dWP)1oY!jSGhZ(Zz$)~1ivZOE2)51Bz@`ABBM;NE#!DSo-Bf}PtT2eNS!
zid>`)S%YmO+_h0|kmwaZ0~ymWMm4rgux(s!lj!G-EkL37)oQdd#TwIhN_t#;G2>q|
zQ46DtVUB?hTSmBjLwML7!@c?E(wjex(~e-BF`7WYaEzRB?Ol55*;pE3d5m%0)@(N$
z_;o9n3%0XM(X>w6kBAHC|EmHGtAy)sEA7?PnK?y({JArM1QEY-4wZ26SA~T4Uo9nk
z^X?)SN^ujgTw`Q7VlN!IH`Xp-%>q_0V9f&dS%rhv;^4J7cr6ZGgZ)-xuNBy15$hJQ
zZUxpYV)Z;02O%S>O7HePU(uvwmp89P2F89hN_AH`4|Sh=$6dqj|F-WRphlU+0f;!}
zFdE1NCcg9;=}+HdUjKgo-P*VWCA{)|x^X>@I}qQxOH~i4hpHFtMiWIy$;2D)JsDOh
zCuJWfl}1;;?T7wnI$Qs*uUR47#aH2=nA&pK@LkQ4B_mBVqp=LJ^8{+2M`1CQB6J+Z
z=+@rajVwxFCZpJttu2?i;SC}*ZwMub*fz$k8+5`!>{mgzI#$>^!qOO9$Jjc?(gedA
z%XPUk!SW<jqm9qH?$p2bruLH)O@BeBROjN}^E**v5?=EGTz#ibI}&q!Y#HNwThLGF
zSLh|2cn|?R_c7eMtkJ|R7K%|GMASmxe>?krZfag)T(s6N$QBDu6Qrpsv33a;{j(|2
zh&wm<2JUoUl<mNGsnw?d!HRpX`f|p|Z-!CEs(GxK!>W0#UckzEEY4x=BKBU1y;otM
zmDqPx)W0?JSUr!`^H?<(nXYrakn)DT#ORYu6d5txi3y~XaKDpV?l+3x)ET9mt6E-^
z_~uPA;NDF@#Y?X=5zjj-{q?^{i2~mIB7(T!WPo_@*90K-kSeS?Ytb+7hp*UAiSm3K
zt6-HZ$(=njI5=B7TeG*tF1|WSMV9y#Cg<+jb@?CN;k8gX$&!f%TCtGl4kB#)3EkbQ
zV8jlm*WJ{n-SkTM`gKr>l6lkZ67j~5;+{=9^)NOA2i(B^y)D?VjEzHV@j^JpFk_f8
z%9sda!%`i{CL}W*IN02}xUdE$O?f6VQMdSGs&Z$<aB~q)dsJM>tz+EzfDT^Qjy9|k
z9(6GHUx}YMiKB50wDLZdm4KMcsd8&g7tk?ui;&p8P}}7Xgqywu)1YlAhWye9B)s9n
zA^7;!bHdsAt-G;YW4XpZU5)o&i;rB7uib@Vjgdta99mq`r5b~N+~)e2A7F6+pS(EN
z!@>ZI1FRTe<sb^7|L;N{mwr<os9hJ~k`?>lR0-Sx3pQ82`}xfFG|-$&n$e5~Jp6Dv
zcgh5kul`5(L;%DK&Z3BK+^T0kI)!5Q@RTZ~9?U`t4OAc^P}C}wTLA6Znynqy>}|1Y
zFZXM=aIh(dX-cGk!j76H3wD%upR>1j3LOz<F&CoG8c^7r-@BcyW+USiB5d~hhaDLk
zw~+=a;TO-q#^sW>j2JbL4V#A8G{mN5Y#w51jBOJvjboI2@NdGXVMpC(2G(My96E*D
zv2}C%O4%*gT`VHvk}u#j{}dRj4=oOG+1CI7L`BT^uyTMq9{_;;S7K=#m&+&p#xVB=
z*fqbJ1t3mU1vVFCJ8HCqd?Hl}GXrt<$w|aN{EK-xeD%eChtE2>1%)5@CJxyX!|Z;8
zNaaoySYhM16haGJI2I;`yEfyFO_=K=RROXy(C>v()N5qFhq*o$2Us<a)$>@ph?5Rt
zFJW9`G{Gcy4o3by;S{cIc-^)NZby@LsL^=sfGkd$<Au*`s^UHT+;ftM|M~oM!`*uQ
z2le~^7?Usm>Fc(68A?o*^P<5~OG%))6|um<ZC}VUrOa$S*qVuDcJWmZp^9+S%b^QL
z8wUkkFOv-Bc_oxUFblHCk#T!m-5C&3X6FXa+W5pfzgvx9rcr!2*{IZFCK1>4tNH!(
zj*Wy+RruL;X2k6epebM`q!jHv14bF12-<#uK^E935ye1(qPjp6HIqW14*&u|F{axG
zQ1hL4<1!LO;QW(g<P$5x@LNx&fL_r|_A8uxXjt^#`2~%}><v&wlZ+LRy915U2Hc=b
zOLx^MIt{<J)!L;-0U%n29^h$gzw2k7M9WYrRS^D!)lkqZOlflrnv@iq&Z`ym`^Nim
zz?w3YqX|F|7J5ZxT4F-`eO&%^AmQwzdGXgYHl!R6xc0Dxa=fTo`(PV%*V4A^Dvsl|
z@j;9ZE^D9$4a&t+5r;WWT?zm{c`E<*6RM;KwqolLdlQ!YtwI2Bk&zOV1cg$@uc@W+
zP5<XV{3kbCyWyIhk9PUhRmy;1BGXQUqo4ZYTZ?2SS*EEp3kxW0*-@Knq;1z)o2K|e
zK~p+CQxcB`0sP_LSZ&Nk_w<W++s5?w8`CIbsi<R?CRnbc9k?{cur4Z$4*ym_;m&%5
z?V~LXC!+SpMowYD4muQh)`<{t#6I}uZ4mIkKP&)==vP?mW7Qm1&0)nH7Wx=ec*C>#
z2d5W4xkDP4V#dPz!3qsqVD$E+X!)}CcK=cgBW!{QRMe;Myj&tK{;WWVRKokdC?p)T
z7g!D)XjGaNSQXLG^ljXTMTzxGEz};DhT_H{HVx6MB2BGVAtn6yNqG8k_|$iG!J{~u
z$V#Eg5y=2`D|*9%c0QIjL+2tCc~Q%6$Bah*QM`XEnDD_X^t97y#9Q8PH{2}|FMbLE
z%=dBM7H!yubthF0l+_TeN+3;1;w^Wa?n)VdU(QA^&DMjhSs~oD*B!U!woO=S;ZB94
zaLEj4IhAe-?|#C57QASDv|vZssf8i;Xtwpd{l3OdZ_IaU1|nqm95R(7F$BgKjC$2V
z8dRt%09dZEJc%eZmt{^2W9wEp7&++_>>ZnhZH?KE9o??AS!!4~JxZtWOE=@!pTsQm
z66T#AoWtTA=6e|QV8Zek4=mvs2jD4t$j=aMAuLs)Rl%?jr>(-aNJhcV{n8+;V4%Qn
z-Hr%0NI3S$WF!kDy5Y{^MFGBc8$=$kt_<TXK%5m)6}{4lH%+|?3gaR*@`o2yu+XP|
z&X^eP-Gc9JEs+HU*!|hF_|7kc>%Z~8d!Mzu8R%6|ol9LP;`XiLZ>>E2GBx(WT&|>w
z^};$G)4#mTCAE6eF<8F^n}@|ONQ{qPok0UXdgZ=Kkq-f@U=@l|X2y%o)`P9tJ7bq$
zM7vuxJ6EFHwx*W3v)EEpMDI?isAftntc!4T`!dsP>)no5vzt$Ce^g=v6g*F)Hk#;F
z2W4OS!pbzLaNWHc)uH(C`sanPX%jY`OJl1Vt*6C@b+f%<y5N<Ew4GQ{#7Dmp4vKHy
z3QfYFHs8a1AB%HXvw*dWSTTncb67ct{nz58L-3SG;58o+fHUT-0}4y2D{a5rRf=|w
z3%NNo0EW&10!S%z|5b&5yi8qOc*2ovioxe^Y6(&`oN8)s&QDIzN}s$IHVC`vWqNgt
z4x+`^jJ=yE+_f3s+lmcKxb|**_j~xWkHnZ=wY5JE6H}FM>PWN$5KQffq&=e)m9Hrf
zVMcJgXFoQ$)90OAGT(`Jeg^k#!R8URjlxeN(v%!fN=Z{nnIuanN||b(Z~ZX;HfL*B
zS+hd8>o0as?krs*Vuyr%v*MsInx%kxYKQz~A&Vx~Wkjm$<EP7E2X$>%5j!8%+2Xwr
zW}}mGYVx=VC46~J+C0SOAto8ilcEk)aG|wLNizw-<fs4uAOJ~3K~$zRDbtv5NA7XE
zTLVy<C-V3cDMW2%#lQQEKxAR>mDqCy)~$#txMCiw7O;8&gC3aho&S#)o`M%X7B^m*
zn<`lDG}egiZabV6+Q-vu{SmoYB|Y|${L=L@G9t?Xk-zd23B+Ikk*6LVu*rW8JB85U
zV6A|I+tJ8%f$2e<TK6L-#)%^Kx-Nc|1J>f;wE%G3fhDS@)ZkpCJzZ>Vsl$tQ<wB{w
zGA+{%*5$0zcrm>}c=?qwgOP8&B!oiA-!sDIA%<f-{G5K!5Ag$IREOl@YJ{Q?E`4cR
zyyrOhq5pl()-JGSg>aW&O?(L&beNnVC8sgrRj<C$+(cnXIViikPdV6GzM!X?y4b0F
z&Gt0iBW%2J(box$Xz62#H1O^3GY}iMFblP4Dwenu(Q8T=POy0xvnIS2=2D5rHYEow
zSZWGV>=cezX$`jZucLA8{!=5ueC=~M$ygp^ua#Iek3kQ;DhSf~!IW>$1S3BF-}%N9
zEC}R|cC_4Q+c4{vL$8-znG8cJ={2UR+LSdfb;le<BmVj_6Y<oO*>Jfk&&A&aV%s2W
z6rs5(hirM#y1>E4ojDP^_iJ#1wiX)kigO8IH0fYLL{rlq3>3CkfX<FOdzss2YS;(;
z^CtKlr;Xc!=l{&t+r$GAKYu>o@d+Ka4~AoG9d`Pusa#btR9{L`k~at~L6p(zR|2y_
zI9oeevqHG*uf{$f;hP}o-fASI>26_k2Q8T;skE;g`8CbLVym}qEu8XBpxMYexX>{Q
zTSS;(O?J#E)lfEO(Ys2h(A2_x&!{#JwQbx6Z8s!dH|(aX$jIF)((Jix5^!kUve!P^
z(xWO{`Nf|yxBS29qmp2TCme}h730_YJ&+}80I?%C7smywfBEqI7f0kNwMa`E?|5$L
zUa=0nSuUo?s)E3(hj(9Q=+wL?oJg;fmwirXa2Thk(Nsm9s|)z6r_V8ds_@JK2ZGHP
zPp0Z3YB@S&2KqfH;T7jHm)O#H>ATcupg@-QK&LMl7`-6oa81w?e<G>Q*$5zuPM$yE
zF?`bLG~&sRqmggC*jzodG{Vw2c+rAK<6!ZzEBBGxC&W8%KHIy4vI@~7?B{zA`~TrD
zbhiGVU$a8E%dhQVU(w6#L^ujS&W>iUg<ej0_ahJU!0S53wYQ+q8q_tVok6psS!Z|a
zIO?cG6ke3X(sDMhC{|Eo>F#(ftgV1T!#KC<2}2X;RZ2@MNa@6tHEpMzaF21Ps~TOd
zqXL0GJ(zELJ_i;0Rjb;E4}@~GWSA&MB-SNuoJGg+?l0j9>+25GYszr<;_OJ7vVpeN
zpewY95WvG9)<UiZ{gka9@O1UWZiBF?YCG+ox`?JLD9u0(HbDw?rxr%wS&CQlvp3-6
zgQt3gQ!F>V1WrG}ZjEfuPu;gu)W0Sj&428tu96Fz1$^X-5OLOt@kSqxF&yLc3kD^8
zfXhd(G0=>NL1Q$eVx>>*L*&dYHd{Mivv<ZWzi#+;e&{h(0|%SIH{4kvw49KDB$<3X
zp_fh**tQAXjqH<bfW}AIc=d{G!Iub#WwKrD*GN#J%77k=EE1ZOMN+BR)?H#MY#U>K
z4!-wM$i;Q00(!f$pb!V49nObx2xvQ|<<SytIca%OQ1oAgH@w&0`3tOwQx3<{1Xc2}
zj$k{rfCed?+?dqZGQ^f;Ofs&&Cw|fC_e?;1{)m1mSJmequ;}}v+ZXj)rJT!4g3k;R
zkt%?A?8#iY01@x~fIa8@blJ!3tVjA2!-)?~A^@cXBU49w#0qt}WL5DF3P_|B!x(DC
zW%cQRJ|L;{dIE^)5R)4H1%UYM4UJ(m>R%MIA{kW~%k0VTiLgk)W&2wAgZ9x7jp!yA
z2wLGGHZLPlr$3H1hKRSlCqL)>B;kr{_2uv4z&&u^CJZO-d(0>kK_5Mzl!`~kDu2jJ
zpSzeVpGc1zn625`*_ypGc8k>-q`V+R;^=lkYXH9b=ili>%n-SXle=$2##$aRL*JWR
z%a=n8$%fIIhGIMNU@dXy#p#~KeYb6;|9rEM0=kL9Z~LFqGlgWPF-WxduYlAYIMSUW
zt%5v?r?3+j9^kT6BLFbr?Joj=(~rdZB@8o`GlrSNn#*+<?1mY`%u%M_U#hWGV=QFh
z(7kc+p4e{{4qS!PAA(op$@Bwjq@f+caJvT_NGR|Ph>-AzMjU%|Dw0u_qeHp2X^Iy`
zDprKnG{US7VkV4JLYUm)QRBw=n1Qk3ru+4!TP2{^!xh)ZT#u$lsP=^}F|*SceJWcH
zZCtyFCCP|Z?lhhjCYt#9Yhc7#k4qxn{4RUJ`831b8!?(-IDw}jh){~Yql`k5yi-Ui
zDJQ7n;+arV^(XnBy?-cwjkC4utyv-59afvz(LkaEB<|>-fVT<ddYL5Gj`~L2X%n`E
zr&9|X25*Y)Yj<`Qy0Y1!T59yZPu(>crJBlObP5?*P+@mwRx}9P?qE04v#TzdZV+x~
z6WpGcYj@#J*RyQs4so9Fuyoo{%;0j(<vL2B&%TJb&i2Mp4yQ+(^etrI+IyoK^*=m%
z>C&h}eopx;n`1;bs#^*HjzdP3!GsQ;tavBBbtf+SRB=|2tU_Q30!d2Shmtp)!ot(W
zubXr{g|)cTfP%WXDVodm%jfVn&SMK|%fsl@!orSvw>V9EY#41tD>ctbR9>N!<@NQ7
zt4xMoC3$!eaq97W_ea!Am`pILao&Y<K{+&nRRuLFB_Z8={gXQm!ZNUGwr1-=)~pcj
z4lC$8vSA40R&C!wgxl&pT*fP+Xyl#89chA<Hep)@jag;O2I9WBUEyhTk}82%Mi<4<
z<$nS;Z>}>fd&G=Iw2eA>H2a?2&%&rK9m*~!EFOcMV5!1$<|(BNyZ@R?;^kC~IBDch
zKZ~zBUtWE`eRs^eSk9#cTB&~)pYd9_RI{}+mWtw=?dw0T7oR~8zp{1I#f2?e>H;Pr
zgg*#Gc>DcoDoycDP~>AzOd<w-9DNv3iV(Y|OgC$?+aP2U2yUJ9A7l6{rZlB($8P&V
z=vDdC-xU&&_&3ikuQFOmlx;5@ZHjKIn{5k!(T?U4{@y`^1ogO6k{M4wHNE|v_NlMQ
z`D+vQScOrINp5tc;ik`^89#N!K2qiFQ}+%^Zr~7n!0~L&)`P5Bk8n3xZG2Rt9ZgCJ
zd1tc;VH6Wg22v>liO2#4%Ta`qcj-i$vVnjU2vgCB1me^5GAtIb7|lXi#FG+`8OJsI
z2|Y3Ua91cLh|B;TOsK7bgny(8^V`5(0A&WQP?9ZCzQ%V+mPQ@uJ-%oPI%n8)xkQX}
zT1Xhx7#j%mfC{K8B*m<#$bcry;BBsvO%)6Px80BPPvGl68sPj<f2<P^1~@$aW%CGW
zCDGA&c0Z~R(E_W=3t=cBMKy>Jz}x_lvPJ<|oFmXQ2pJ}FdX!J|N=00!S1*E~nwj+~
zeN{Dm;PMWtOC+0$y~Gn-U;6ht?hxF9g8LivPo$DHT6)#d31)eJs=OX;Hcgy$;vltk
zh(uTh1S3v+48MA{{^lZETm%fa+zSEcUN}&S*<MQ6cK9BGDEMG$6O$6G@|f4**FS^a
zfke*ttox7umCe@fx@L%QcUU)FTgSaJr`L4~DS_DDL2=DrT-}-|lw_43(u1AzHePAr
zSkuL^*s2^6TG3|~kkQOiD7~%-mnpgx;hx)7j~riG08J~TnMxC@XjWZSUw8F{T}OXM
zJDRt{h&yx&n>1AG%sOZa_Gi8*?@ewVAp^rYCKe6rc7V~ac>HT&n6X^9D9}H7=SF~d
z!^d>^-Z*-H-gG}M{zZP^m-&Gg^Hs~E$j@xYbabe~!VoriI#uw4#dofe1WS$x<Kv*;
z`s$F7i?y+!u_*y<^RfBWQ$ry-6zKQoMWYacNO<Yr>$rmp8_AXiH@2<`wY+qvh1~dC
z)V_<n8y(0MGWf{`GJf?sxB}+<C-Kq8Fad);0IZ%5{<%Sf(OGnLD5Fj2R(b?43jf)&
zHCqq1W`%G!St^J6)>7ybdUvWFwIri|lqHwU+;;TQCgvOjX_yP!kDcHTM=(2T<vWyP
zvmrJE1k#ZQgqyHY2^zz~5f(b^{lvL$d(tp1nb|2dx})}lQ#GJrCX06>EDcUS{_k_?
zL!dSfqW}+U4Qn-H5r@Sx(fSIe3q~!7s0|110TCB}MIzqti4d5+;u4*I&2Xxd+9|{F
z2wmSHHm(W5b(Jig!l-tGJ{kw1HwZgky5?5=lwJ2{=Mu%)C9%eXbO%c$+t}RI$1mK7
z7eARV`8z%56#UfV_}s_vcTem@%uIirs)EgI-cB4{vDJ6=qTZ;62s4;a^>oqOGZe{c
zW>_)6{%i24L!<toiSzaxd83b{mn&sTgV2VbfP}?Y{gD0+XKUA7Gir1<St^`iP*_yx
zWh!E#?Y}rvDS>7QFajw<Ny*vKoRNh}L6!zV8b5;)6~g#30m-KgwcDba9-*AK6aZwi
zdc;i2O4*n!B@c*90FdC>C~P&N0D!EBbJ?!j8H8&mWEG?e7nj;^@JHxnZ#pxY5U^>f
zqsI|4RA<yck}5G(NC{Q(=`}ujPibjJ8Tb1b)lmjs{*?H&uXvvT{P+n3@MBjGL0oe5
zLQ^?frH`9CArp{LRZ!-Q_h{`32zdX+_OPR>4}HiUb7BG+`jHe3LSq95>6e{T7X+!}
zEh+Dhj#r`(p`ja!D@#J2>Ek{^=fgjDoqp=H7!d{FCtqi;dp<8&s+to|B8?&mB9Yc)
z{vj%PXkW$XFE+B|QWS%&6=CdEddy>Z)i<^Oo%-%ANWvZqc*Op==ePla7xg!c450YM
zPwcC?<e4(}fBSs062&9{w(TGOy?<4+^`o+8h;VmV-Zd(FKcjO-rn3Ka)^}h34d+G8
z57D_&WEO|8pwY`@A=^~zE&z?1t$a$FAJnMtdeN&ZNpIWIJ@-xOy4dQ)tdy0Sa4aji
zEgl8lq^xa^2)hJnqljtD_2>+|Z3x>&qfwYTuei@xqpf53ZB%1Y!pD8Q`?zZ`==cq~
zX*JyxZ?CLM{L7E&g{SenV|m`OJoW$_yFb2s6OP|^O8C>FRl!O&rZI3~svuEGM;()p
z1jd9yM?xxvu!VyOJDAzGr-<YJbogg$wAc>j8palv`s=soi2Xy{`}z;X!Q^$%Cx~aR
z%!&vz$7h|eh16kUOCCbNaYuxW2rJOPmL?Da5kC49LLBr(V6LY#9*VOb#xss0t5#<0
zAKgkH0|?a)<Bh1(*_y2%V9nkryUA)mpSsTa1XkN8j>eZo^mgd$5E-N}A!k}H?K*^Z
zH0aPmY87_0%Zsv;vIY;Av5ucw%NTA(Jz_RyAeRSFJd1_U>*k&AtO`z5k!~?=**`Wq
z$xcOVDrNhPTSnSCj@wf0xi)knw9!wtGaUR*lV8)R%Kr5NKKKoRIP>8V2m0EN3B=p3
z!iA>-#2;>4e#}+Nxp~Z9J5@Ba4pof;s$PWGNI=5z$91N5Fh*IiDsZqQT&u&8cF!m~
zkk~uv6c$pHxf$DJ$byK69>81%CBF5SlM;UNFKoZH+;25s`7Zsh!*l5oc3+E~7$-`0
zOv`)6StlrW3Q$fmUVS5sfbireCjvkF82s3YJo9M0eKN1)qgBFlx%uEdO^t&vNy(IA
z`jV>QSAX+|_4hYhyY`w<qr1tv_1f{F$IP|=-vq3ro$JQU5)7hOvm_uh-*UvU54r6c
zTEwj-kwOM2W^-Yl=gR~u$`E9R9uiIJV`oQZiYh&+$LXL$>(O2HN@OToN>VaXp{8-6
z#GdCYJn-oug}Na{HFaKVC8A#J(TM4T2@LB<VNd-lRh()CIq4mLJ9*p-!m($-JTUN)
zK-PXcfU3};0IUcsyNIwZ8@m6(tM4cy1BrLMkZ-#J0RHOJ0s!IAJ$dREmp=RGMS}_g
zPF6ByTqh!+s$`;EFq`Dg!aFx%-_-!AB#=xh);$CeN(~c$;Jg`KMkhSk9GKdB#e37a
zyba}>0V`9Ql>k8r&;DQbYfp{K^V#1^0>1Lj$%%(BJ$Wt_p4O>zI8*A}wCDJkPYNt3
z&{MX{aYuy7AXYtH_YDn%`@U??I~EV$pKBMeW&zj$w2=Zaj2Gti!Ah!}f{-f4yLGl^
z>jzphM7aB`Mpe-WW_(mVxxH`{K;&*)ax~_LXeq_^l&1r@-R4z*OVK!NXNjX1wL+1_
z?VRWLJ?w3apUrC8ger_HEhw@AF+mel;NUbU?1Xtb8rvQkZkG(+B}ltMO&Yjz5!*)C
zHp14C+Xv+iiV%o)gF2hZu?^AJ;a!6lRXGr(@H70y<@(y~IN@MC<rqBU1fG8^&pU?4
z?2lvi!%cs=?Upw!g@wZ?wajo7!kz>mLBf%b2+zo%-|9tU?qG?vvu=d<judF~0(A%E
zrs8nlffx0Wkk(Gh#b>?^5pQ_EknpSL^KnN}2|xE1yYW8U^gSJS5MFvVetLPd^+Tg+
zy{L~~YOX&T2Vv>RHd)&t>vWQ!R{_ESV>|T-Jmzp5uoefd!@jE{Qw?1<7?e_^jQTJ_
zbsU7VHCsQ}njym7ak*5a%&cd{k}uh=+y3gy2mRWk5@<@Xi2_CocGQqEr`&`>mLzu*
zGU87f3mQv@(pfSTy$t1Z#sR>nu{Mk*i+lI$9(u+s(pVL}4CQ8k*d?2|QBFNC_osFA
zGp%GMz#$458v>pJUo)k$DT}Boyy}DcwR0(8FbCDJgsMVq>=iKTz{wPX5yzTpLTXAC
zboV-e(~fREk7qxeBL4A<`lZuZ8*)Z@u=pS6aadz?{qWrnnGb3d5U_a}1EVUW#4I2Q
zNJjY)XRhDY+Ek48evz9JIHi<<t5?Fw7n!TmSJa=P`Nel~QsJFwrJllhkA>%~e)ih9
zG#9?n)^7oTw|q)3K9gI9s55@*Q5fGm9A|v`5eqDMJ>Z~UzG<b5L0%>^Fsi{inG8bJ
z)2jRJ_nymfjcnLs5xu1IE?+sfXWa>u2}DTaH~!@S%_T>~Td)0bum_bl=xoi_53pv3
zrrl?iJuU!5TOM{6v<8ou$;m{sgj~txGoEmkcbLl5DBa7xpRs+LFj8F*&@cis6QdZL
zxHT<r#-z3ga`PUcMe9*kewxrWlNtcJU7N7^)#!r1(hi(@U=6Y<RS>-Ntz*ALfBGS9
z8)KX?wlWrYhaAqlUG~Zj{yZP@_sOf}6yj??sBheczxud9WW&-JOCv0gF`8gpV>pTX
zqY2LX*6`8SZYvL1RpmqKDWidC(!mgu>x($n;b8Ib#W>tH_N*(1*%>a};WM3Q8Y3x6
z_s%a}u@VLj1M!?w`JvxPZ~LqWER8X#QP-H%kf9>ZxMum(uMQt|)v&QlOgRWqQbtkO
zQ3!<9lo8iY_TOX|{UX<`z`B*#Z*81TP=SsJo6%IsiH!h)0SDEC5-g3s{gNNv-`;HP
z;%kNocb|3pHKT)%oo`EFtCx9@HepVQK%%Lr5{a7*Iq~p&zR|FwRbW9-%<=>e#?T5y
zd#~g~w{|ykuR>8YM61$NPipS<(0X)hUg2#*(wGd8{5wShi?zQ5+yGOD`#>5Ev}rnp
zh-d9i61Gs#ks%Fg%#PjG={TcT0~HKV9i6mFfj<QqkW}C`p~8`NxKkSNxQFvypRyO8
z%b!1o5Z?MiUi<|;<rv=f00s$*10-NjK|-C8Gv+H?y+P}@V&z?%1>AT1LQ2t(lu?MR
zHJ1bXlWIG!6$<922a2TzBqgNM_#{2Cr%B&?uoYNPC1B6k;$5%qe|<4FFGIwizRP~~
ze2RF-6<Qi;+YsX#W~hi>LH{OL583eeFAT>S;~HOn><XX^oe(6tyeNwqGEvfVSC8Iv
z72fayrWDa`DPdwTLk`-YLcCjP<i>sXWM*o}VkH=*9+kR&klC88e|60Y;cm62$e^Yo
zKA3PcCnZockw&Q!VazgQAz8$&p-gCs%IC5VF}dX%p^@<d<{W8(8uBSQBvOJ&d9;+Y
zSdUmk8Ollt$YL_&Dr%{S)#t9*^2u!`W~nMqr93D4mS|wac6GvZP-HSx@Tbi;Dtrqv
z@}k!+FD^8lRD9!<HIMqrrpkHX8mU5zIR^-sn5b5R6F(%nk}a|cO-hM+0WSFxzPA~-
z-mk?z_gaZjjfFly)P^ddU!hmw>?0|lHoW{&@s8zwh1Dnb;x%z^xN!4zT0n}CP9;<&
z^g$)O&1+$6B19nt*r|ovy*JeU2S7U)sTlhT7RQ%w!Z|0Aw3qxiC7ypWM7;SUdi=w%
zWf?C$o7qs&ThZtzR0%5YMR#IM3{SdxTQ+>@7JThCU4IYGdiiP-1iXB4`TivtVLh1e
zXV2wCNFH!1m{-9JGoXT)lng0qyMakG^I`NUjw<R+zh!1?w*K`sD}=k@3L85@TiEDj
z%%+aX_q_S4{eI!Jvb#Iu1`uX|kTa4oTgOvx1)+%Eql)HFBN+u6;ixFV8(M@HLSv0z
z=-2P9N7R_PuWYO&Gg^UPG^!Fx_U2TZP#qO$+jJ`bTOL4aYGSkrTS2OKq=XjRIp7m9
z&gl7WF3^z73n2ldQZkw-b7yYVm6-^>tzUSa2M&n9y_>ae5!*&sF@S`S{R4AV-0_V*
z3)%4Mr?WOpGA4QXh40cy=MF-lT8M7ZPYH5!p1?8-KA>S@1dSH86oW=>WwgzTyCsA{
zCEYu8K;0a>45S1lJn7_6sT{sPAUyIg-2DKuVbc<-gjI7`Ifp?HgQ{qN0e{{7ia9Pk
z`{8)fv0RwrLf+aN1bm<C!-Tz7vRB0r=EO3N!;lS@alz%Q=GR&9{3X}aL|D4^pANtv
zK^4TMZ~p|?6YO6Bz_T@5(`(iv+^v>Gb*lrxM1G$(VXkBeIYLK~6LNLqK9BbNGe3zp
z8+~pi?}!HBRMuK+C2UjHQYbj+a(<J>w&A{!#;J~cHO4%O61C-0z{Y9bGzisL_?xy<
z8C}#W64^{SXKrUjF*gqhG$&FUYLqZ=Vi?!qrY{*|?a=n-=|og%BTwzdpL%~T;dPf9
zh__s>jZ0WLhkg%pJrGd{)hLWqj0<Y(5`l_%%X9dm)sq*k8!MDPFk<5}<R_Itob9Zu
zu2?iY=54$gr~eln;pmj}vbi|j66np~l<>y)2%r*PbCHR7(?9FZ4cNGZrykGSAHXDI
zt`9Ph?x4c_0E+`G4lvilpoc*Zi*s0<<H~t14A?NtB2tAaam5@xvS1=iEararB*;<5
z$hqvW(z7*<Si|a9iit}-|KG`tFZeJ1Q=6^bYRwSgZne~$_Pd?Jgq;Sh!P!ygGo2kp
z<#kj>XGe1ejYQKXL=prhI4c(;Zsl3YQCe7pj?uw_7h?BFZ{x7WIA?+xs*E`?DY}F-
z0$Gf*M<I&|kyX?D1~`<9hoQI=4Z={%#y@x3gr##Ch|uv33I{mOU=K7@DJnrNP|^2l
zVgXRn+BB_{iQXRhjMD(}fOT5CfI$!QJzh29Lc;ocaN*&KGl}9ssgS8ak<OO833$<(
zdg68t%l}+eszWmBT&)^8jO!&+6qqpcp#_2@QhBmduYLi|DrG6MSW8G=mJFy8&UjQ9
zF3&o_sRnFX!f^+2X^aEcV&xoq34;oQ3cZ9xq|mh%m@XKY`Yq6$80w6Age>%Wg@rbx
zgjB+1yisii38?&{bd)lrDJ3IRNzEjx-t2HcTmOzVD}=k%y6c+d1CCulBPC(%xU6>m
z^?s)IU6RFjr73n4mfeyNmIjomODfei8Lhw+|8-WFRNqg14u*a2)!gg1C!;Oc@8R|E
zrd~#_lr2#-Bc+hWD8Y@=Av_J)1BE17JTHV6#tBj{@kOWK6qw?!@QcAlte+ZhL_At%
zVU$so4yYr)3W5C4se(@QInkP@5n(w0NF|JGtaw;;PsaKL8a{EQ9d|U}aR>Vei}Tv>
z027d;7aipX3uHqgs)RZtF@z_B9%_%fGhARf_p>b_Z^btcs$^)SG@5o$6f%`1jFSXH
zbcA>oe%<6n&6~ciQGyB_jEK8y@5C98#I@hS`#-N2KAkeW@dJ`@z*-)@H}+nIeO6=t
zHJI;5A@rYJC4WI6U}6|&WT`ghGJH5yFrYRV;o%ANrmRpgp0ZP;GD!Y!sT{4S#PxgZ
z&51XnD<Q!Wy+Ifu4zo2||AsXyguCC0b3P(l<@*J#-S_rS?*068lnB5?T8iU#*@kjv
zGC^$IgmO?=a%U*Ol2y5Q`B~b8ML3#-W@|FkqZjq-f2v2+IMoAH#w27bx!qn;Dy=wo
z)wWM;u~LBjUogFycT$|``+17#guYqALvNa<SrN;C2@$~>h>+iY!X8Io@xVBvA|Uh&
z?O7Epm^(TYg-d}MDpfF|VZ77!H~(x0tw9YW!lgZrK8d4IbQWFYD8aysZk8*4a@Gru
zEZR$JdxvcTOUy}z36Ec&rR-hFm%L9ed*#52BBlYDtx^VU74KX;g;oZHHwe8RgGO}?
z@7^E;FzDgW-exa-CO`R2?70Gm?ukS9#DQyZz#6Pu5mm5XJpK|!4(5Q`Fv=KbWK%Os
zq}K-%YqbXw&kst1sZ579Z=>o(pIEtKB>*20S*T!3$!HNgnn0hv<Qv*-Tbr$a+nT*&
zcDFSx91T!NAE2<)ueYQKrb1=TDdMJ8ryV}JG8>XB*E88`RWlMjWi1uuqAZzfPuO&@
znkjlAmH_}WU}AONvN12N>*tk|EGEfK6aiZmLWgj&3nsW&w8M-RkQRur82p<;Sfnr=
zqPVqBbgN)NpLBM#pTL6iDk3)oW2X>Wsf8^ZENXr4iB4+lcj7?IN}kFV!2+IcbNLlI
z`8Y^`VJTy-LP~)6wi}S73h3nJ`VjyCAOJ~3K~z^*zZJjmh^Z2&^0Aq(=fCkE{u_1k
z#GlBoU#4wiY#rkdUp*koT->50id*5YrS=M_M2QyfpbT(cG*Mr>26M#op3cu+iNC&7
zlZ;c2;2B5bVf%5v)oQTdAO#k8OMa>`uCa9-GMQl=LYP_r(F1yY)k0OpaY{l(R0#h@
z-4uQU>5h;}DJvCFXf&l8-*X@bNvddRc++#i3QYB_&-nNL^~~0f=$aM6-EGB5zo;l(
zIO^bFN8u;{<>WJT1eke85fHoVXsVe9@a9--TiwJ_FNDb)3nFwJfe2f%41l~DBt{yJ
z>Rby#7Ak~QKWexoFuUs1!bZ^4;I<1og$U6m-5_uw!qQO?p;t-I8uiDc4kCml^OR99
zy@)zj0l8CJ!_ued2u>A30>CYILBzcqgSRxwd!rJOWTJpm9?g2<=0qfa5~+w&y~rgj
z&f~4$0fa<J`1wb$TL@9;Vw7v<8l1m;CLdVF#%108q4Cx+wv4c4gj0WRt`x$ygNy*n
zYVHdyFX|@3+6!Sb+LnZrGcI^E&paBZAIbSX=6js$V^9H7Hjt=@l(00038NaL36{oK
zo?uvqPrn9ILIv~!zp6RYsGNRkYhQvakO>vQ1b;hJZqN5vxkytJlhgwe(f?2SOPZ}8
zp*1UnyWJ{gKD6#PhGuaZF8aFv-5=ibg7cL;3OPAZ2C-#FO)1B8C9g&)#w<k-4<a+I
zQpiuDDk<_}*nwY@o5Wro*>I2J$N9RsNy>AUl>!ke+M2Kg%A66E8|X^qQwa0J576mZ
zhFd$jgry)y0YlX5PLD7g7Y4ILq%3#>TUErOl?SJFdC~CZ!{sDl1`oAr$b~-mX?w==
z`Zjb!qfDfO&IGg2^()2ma0N=Z0~NFSL@mw(L^k-||MnY-zX7=LVNsb->R<cH3#;eR
zuefHxofufIvGmdL(pXCq9P;cQ(DqD=8^y;-234Ec#-15?%YB+lK!$+JKV!oUdeSjG
z=@2~mI3{9YfQ3H#3E5C*`XFdOb*);!>IGbLM_UU=x#aZ-gSimGRK0f4qchtok>6wq
zBPD=@6eOsWTz=)$s8mr&O0)#@s0y<}I9vbrH7kU>+q&nPrTvaw0iZyqVnwTV)+7Yb
zvZF9DDFG17ifYu|gsCR_O`Fhlo=lAaKuKm+8dGR9FloebKeqPE7jI&ZdFjKcx2G))
zdTUnKBM!z@o|73ZAsZ`$(HoFN3UFX5Mt(2})+IZmx{9FpETb+)o6yUk2gMMCms*$N
zv++JkvSi?QPu}myuihg=1=K>Xu%q@MJ;LInC=;N-4}ZqaJeiX^^fFd@gd`*~DO)IQ
zk)*;0s%h*wA{3NRRhS3HH7X)o(S8U3F1jf|;e`)tlrHgc(8F4wcFRGHQ61vUN#=%S
z+<i&DZ>!cX;m(bC?r#lLE?&pS(J@Yx24Sw5pwE0u`$&7Q;zhqi@7@h6EDW%1RE(af
zh&q!K&!TY5!I1Fj>(R@2U^&J*mX{c&xUc}}Ko-AFRC_a31r8R1S}(bL#o|Ij3MZzJ
zByAWRB+Dj3l~BPdg_XWHD}=N4?^v@!xErn}d89Of$ixQ=T0>z+-FqO{%Ye70Cmw2_
z2zImrYnq8A_RMvB;i(6c(Q>lN8dlcYNa)aPutxw^-w$Bn=tob6Nuw&Snz&LXq&IMe
zj_7Idl(plJZL*>rZGLr8#0DZ%_$x|Zv9N%_mj=uP;14OpGEK*{AVNyaW$J~Ofr{Ko
zk5KNNU`r&H2vZP7)OFGKgGMIDf9C%iB1yz&9E7Q2U_`HQ9>+63hg1PV)jZ|$?EGP0
zbTcH#aN$wSQ-_3p!a~2uHEWDB#u@7tap)e{IOLWgmL}T#f$_F6?%IS~H{iPO;T3;0
zC&C)-PZ|1=60+%<FWWrufmfzpLe)c`$c8&NV6Kn3J}Lu%1T0UmZHUA730}G>uBRV`
z*L+B;RzO4zR6W#1a#aBd%!ubz#W0Gv)Q-zhB~*Zi{W<IxWHgeNfFw(#rwk0hs=o8g
z|D3;~+4@mhvqHEVuELlF@#SRUg9%3gz$hjUB@2f#Afx*zJl(?+wGl?{k}ng&QNof;
z)@xZwYfXl+uXQIuX_A-M*Q?gfWyqa^*>x<C*8~;f)5<Knh8?vccyyZ51*45{l&x?S
zA-pN4fe2)25Fv_A#ArwW+Cqr1;a8<+*62+bhJ8&>1EwK<-<Dy?gATuk`yZXSRUkry
z=K)?0*%^E2Bxs@~&Cem{Xblz~IIMvxdP@oKyw$HMe&+BNAPVSJnD4{FiHM0|)jTAO
zYHk@}VmR&qm~i(N+<eLC)(yCO6P6~}GJ**|_sjji|C{>r|04~0=$(<O3gZj|l+my7
z?YlA8FW|8l{FWxzR^v;zK*D1WZy~0DO+(Z~zmE*eCG-tFp%Qu}XP~@UA%nsX8n1##
zSIQIuISG;_LAPCWa2ixllBMw-F9heia;n*ytsi{N3gK?KylduK5s^d^Q{#r)em(I1
z%ho>aCw-o(MMWWG&SF`HnJhEaFezJ*q5)8fz1b`&m-x}`5MgAzb$;bYOQXpo=iaEw
z^Qy#bOrB<)Kua<q$%1zc0gIQn==?RN0I@3^_3D@+V~&9n$?}tA9g;JUqWOG3Im_o3
zy3!-`&LHD=JI*W<8%okmK*Q4>O9AKpOur;|Q-YET>xmW-lF=q)kj>717DO0B9+Whw
zd`w5DAzGTFEKy`Wk^#bd?~2lR!NDy+tSa;>0GJq>L67SeQ7gdW9xHLo0i5e&&__z>
z_0a3F*USIyH`AyNmwnH%8gbVqj5CZFWhfzg6-<DzZGxpqJku*~fP_;X3IVVCumEga
z!ooa6qyZ)tPR|_E8-ojt{DWfF^r;u2ltHB=c@JAKO9lz9l&Qc3tOWWGN_x!JY<=G~
zD}=k@3d9uJ5f(f}Jcw`<fHG0$43>EZytRJHp@R>@kPK#J{$7tLK0*c3iPUE^sj|`|
zjDisZ38!7o_0s*^=j3s|x*GTLys{Dzu{9PF&m>v2^n|F007d_YNQY4a?V`{zG^9nP
z<GH9sQd5LAt!4zIQ=>?1Y>Q2}S{0KtislGFM7osR?G80+VoF|UsRS7TF~Jn9X@q2!
z8Z1JJ7?;YUaU3=lYrJ3AUgco3AVQby2#p8C@vS<V(s$nh3C}$wek1@9b16D=9+fvB
z<^fNxi5gk*bRfxSIiRhl=k$QhOCfmiD>urK3t9<v)>0h<B~;#lSKbH$DIp~+FJl5M
z%p(J1iz7=W6Wh^`exdxp=5<$Sy%UHGc1cq9prMi}V+mLV5g7mH|2fUpkHDHmFzklw
zzN@#!y$1I<EPHUh3@k-jW8A4=9^vRC17QZ$R9(V670DxQ;;7HN_tfTyvJ9@(MKr0C
zcUo__U3IQU)TqiZ^UM)T=AolTvzTC4OcWl169J?#un^6IiG0!WPi+6mz2Qv)s%MRM
zlVt!|GE2(o=Hm_v-#W@DBD5p#%adw?I-6kC@_9q}+k8f#*WHrB8a{f)!;TD^aPO6|
z5{cy&mPC&RWreDTUZ1@_dVTbI=nv5Aqv|2`P(nB(iZeh~;=AtPJ8t7ex3UQtPpKVz
zQNVIkH3ODwY#!piEl#D%jqt-7!;EomWuKEG=FGq_W0Wz>TAE;Nov5Amlz_93CsWL2
z^b0$&_NZZH6k@G5#MMt+2K@SaSAvOEJTITfvB3_rNES^%f>lrg7JyXWbNqkBAJlB^
z_G?xMch9A^tp)^>$nR4KH+|&Y%1OCWPG*!<vPzb$q<dtOWyY;DFVJgG7L_TZS!xoT
zgBk_hx|gQkYpU~TlQgbWr|dt(s~~7fCQ7WHxR;gmZ6D*_W^=bH$5QQ@lH7a?*wn%<
znc1y^0L<uz08{dBY4kFUin7!~kKRTkdY2y?Ul|cCZF#e)Tx=hk5WuvXndxDyYBu)3
zf^5FgL&cQ93alb{v;D~l)~TSVsLJoe?H#xCA8u`$jA2yI-Z=D9S7Ve>m!ZUWZ^HU*
z*fNTF#S_C=7+X}qTBYC-wJ^*YWi00qd3LW@CdLLNJo{8m43mty40fKBLfB03XrsUh
zkL=0*mSut}kVs_!uO(T!<822)l`MROz)I*rf&^!4w*Iv>qeger#gJVTYLrM~!2vs6
z&W<+a!4t!LR8X*^nXJiL7$~*jG0k>PGs$En;I#PfliatLrba=j&ZCWE+h+wQ%snMA
zN0mS_z`|;$BDF7VLcrNkBdZXIBHD)prt)RnYah1uh8-<ksD>VuB}4KnlS_4vfqXux
zqOnhuuAWiTt~<GF{yi7hr~Oo)NlMYUG(<<!Ai5ri1eAPepZSjp;?y~3puj=WQkz0n
zdTCAxm#9?&QY-vv)G{p@;6()ga65Ym&)#3n6p>Mlv0;)i%Hed(z{HR$)QVf^cMLTk
zVIt)q-OIs3MMo3ASwYAH5cXWtFxRadH?^ZJih~e9id<BZl1g@~w?wN5lmQ`^arr5r
z@>9TM!>hnKq(lCre>Jo9qq=5@aQ9rT)w<ab6TgpM258w)St{e1s@os<aT#P0cBM>Z
znlZ<Kq!xz-sPd0xB$Gll)6u6izisRKVS3!yYE67bx%>A$IxDzV17rG9nNHWRqaNz!
z2_x+nI4>&Z1`Ec|X{JQQj*pJb-wHJvKME0dY1<*fcCOR3Sf-%?4NJokz@5UA?jHF7
zd2;1y)3AgUqlFM7)`RD4p=5jBumTg!DOSG|aInZu%Bc20geedtdq_R7hfCM<vim}-
z`M?skjj=Sw(gb7cc;0=Wt~6G_!HF==7?}#C$y^FsEz|`QH`p#i292}gArS}f9aq)S
zzxynk@3N-wlg>z6<i-#cg$fBm@{XXtUQi`RgjNA_P==QN3;vR3>qlbE5aI5*?!S7=
z9>=aO8j?n2nSKzxOrR{$#q1Wg17#EH#2T!TDk9Nx^3fF$y`81X{RkQD7Ee(RJ!ijb
zKX^~~*VP+uo_oj>C%NvA=FBX6plC<=>3CKph}p#CR%>@qOt}f^xVMy)paBCo7_DOI
zgfTj%3@91aNl=j-P+W9E_GY3(v4D_-!i?C~Ldby6eOgP)#UVkp&s~m4=`t9(!qZhR
zF)|{4j%zOiCMJLQ3L@9lJVjl}4&)PC5sk_;D>Pt{@%sB`QUVit;)ge5kB#c}(CbC@
z>M_P-dG?L7pp}JHu?)KiJxeE@4u(eM(>hW>n4z`^?Dok}jZfd@pkDlHph_T1BNOhj
zr-0vl>-=EPk}^udlEm;%Fh(7h*60=><$DhL&-@dbtskW|D}=lGY9l2X$sfo&se%Bu
ze)jKIoc2Pbs6>z?LMFkC&W@(i((w|QNF?UMj=FFZQN>jHlz>tffwhmV&ZD6g#udi2
z9<x9z#tb8ji3z9fZ(qCz|ChaY54J47%EP{I{m$*~>CqsNgd`(`g^UP6F*1q-1|b0k
zD_|4^MU{zNfijQSU?r8L@~BFYO2w3^O5wzIL~I@@BijP=4A=&zRA3ww^L_~o7E&Yx
zdJP)QjHch+_niG(U;bEY{q{aR{kSuIyFJx+FLhnrxqZ(*uia<u^{wv_W~6ECUGjN1
zwzQ53UMI?Wdxk$n$iiY2rS==5z-(>dCjb*wLualDTaGLoS~nmzlq&5+EGad*lUL$J
zLBK}35f0M91WN^xEi>gQI%y__p(l`zck#o5pFMqGLmin^($FO;V<e*q6@zrqGsCnc
zT+kZPg^zv$A9_sO!5XY37%PG;?F*t8$^m7LL_DJ~@*Wf$6$qbdkm8hvcoA0Cew@2t
z2i)p<V%Y`jMUKPLOyR?g28**1PfRa$cF=~)C}Gff0KnP^*Ls?@LZkO>Y5q2$Ng8ez
zOqk_VZ|J6OL6(8H%!KRg4)65Id@@gr)V$kF*K|`ajI_{5!Qf2<jJDb9gg#CB7<6db
zS}m?Jwm$eW?s0^Sg;Mcl(t)}UBs0;`L`20srp!P`>md!oey+6=)TMX(!<W2#o(Ppx
zjse!qsrTTFwGs}z>NS=wtqXS^B{W)yC?ctG7J3X18X?)9vPJZ~#Xd3tLsiiHjHwn)
zbpKCT%eL_c40N=Co7}9)aN+s9vcu(V#w3O4ejuEauyyT(tz+vrjK5{!qRb_tlY=Kb
zNVc(h+&X9w@PGZXMC_)S@he6ztj8ZLq{TrxNH$pPPMZvoI~Z@)AOGMdAryq(`h~v=
zZJ}$&|4(SG6I1I%c>h*GSUDL4525k8v20oD^Od<Es6qbW5C11GddZJ4EoRiZ#cpQ|
zg{pW4gk4#x+abBqjLqUPaK91i$|D!ge9p6`cWydjozx44g;SpSbm2Z4-ls~}GKR04
zik6XvGMcBA+>HjarEFyeS!VX1i$=(VVWn#7N}I8W?X^L#DIKB4;xMK|2ZY!B#b>*^
zIkm|(7@e}j24ipyED=r%Ug!)kvPN;_&j}A`&=B1;u3N{m#z2S*=atGdN9nQ>uS`hq
zX-h>S09@JX)G0>Fup#^mKvrH-;G)9h0MS}rQ>B4il93QYsK$dwE)FN**Z)A<E&jt#
z$8WqB*S0wnE|#DS$GahD89=W9T9X;j;+%|$(8ci7i;0kFSK$58S3muKDQlhhS{vbg
zTbetb^0U%Vo+~%0@>(m_sU*TZ((e@Vf{C2KfJx2V$e!pZMY)OzqF65ha2U+_q(;~;
zyyw&>|Annj)*H9h6O<bPb>Z9HGNDP4ydwvYIfVxIkeB6y&Jiy~_GMCPa`>iamn<S>
zwM(g+42)2X@Y@u-6jUG!@KXhkDy0!h+GNp3g{v3jpox-+kyK0%K5aS`R1c0#Xow|p
z6-pP_f+;(4=Mjk+<JTS0?U`+k^*l7*F^q;Z-o`;XHKu7mZeXE<m)Z7xZcdL-;)Y%r
z_O7}hJTY~SRt*SqSYvo9)X${_1RA+ZGQ8^3;SKLU7mbiU3ndXQ=_(_nIF17qC*71@
z+XhLpT#M4+rf8G8#W}s!TDPwi8oh7p-0z+r`?C0&L43UFn||dtz89V9rf$JXR4;T?
z3v{&8JKP6ATEx+A?&eAvqPt0LIF8~;QbGWl`pzdE8g?xSgq{ZsRieD9u+X5D4mDwj
z{gW~}w1Zko=?7A3^G}ALzLXa}_^#a~7BrfN3R-NBZpVEQ{rH1=VD){HK>`{rWnp}u
zFlix#(VlZCoH?H{cfwOmSi=1JnyNt#$|$cB<D=w;Lrut*fT|B#sZlly1a~<Ev(HbB
zvy;HAc28W?u?L6NuW=gSYW2eCd9VJoQm2%4j$24X(l;P(9;UY6_P5WV#s05>VKGV-
zIawmq3gl&f^i_B3U(s48qt=P=zOESnWa+g8+RccgKp2A=NG1A3xxy`_b-2SjY%)x8
z(r9iBN3mhO9Yd2SArM0#+@}MfyYBAVv-$<;Ow*Q<s3498j%jc+ar*2}+5Gm0%;5%e
z_BoCZa7&)!_0VX7n7LkyZkOm9fK2|&$IwlYR$+8z`1=qPI@kdd^Cd~&IK<CqXf*VW
z90?bY0X^~*NfUZbe)+$cca88GF$Gy6oYf!$UkzkC)@5V6SzMo_sMtIah7u2Anvss1
z1f!Rx;k!mMEY^(Z9S1F5%~VE~sv(EV!DmUZf#m>>V#?&C$iD1_!ImZ7{Nwt>Po`t6
zHdPD4#a(0wFxYC%855x>*@fMoa`s1m;>ExfsiZJBzpz_tts~ZY4&BeCv3Nmg28P@J
z&8nN6V<Lo`ygmE}UoWSe-Q_hD%Hba0n2RYW?3QDkH@QjXvKWJ&Y%T*p=ik}SxwcI^
z)6N{|p0+ZfDGWuUVn7Trb^L8iR56mO?AGQH5Q~X0ymBmml89;bOG162fb>!mrUy#-
zw<!rSdq!(B0VjBs6p^#6s++4!*W#}<nsxfFIq4SAXd0Bu#?Y1=87(A(Ui8j=TN(J6
zky`O(Y7h)5p^Q0x#gti;nc;ah6;mcXbml2-oC|wG_%SaIADMVfmbhpaUi#u>#Ju4(
zvHTqj)jGa0?=kFb$?%ksg^Ox~F@b?F|6ABNp#Nv<huB(oUh6q@pI3Yw7Zu@p^Xn(q
zwcmX+dV!+7$ot;Be7E~B9W4+wzA0Hf)3L0lXQ{k-WY68`uKT6mzk2Pp+dg^M%pDEP
z(^EPv4{>7jm@*y3+$`sw6uxK)W=3v9KAs|uCJhzE$N(_6!03p@U+v`{=O~5#;ER@H
zz~Zj!Qy%36b{#ZY-|scWqK(YzdrSAV0fA=g$|#SN*bh&&fpaeZAcgr<a!1F}va6{T
zh}zJVl+kIJtS-F*_F&I}UM{{Ljk9cKm*e1+^B=zJ#}v*r!%VLF>y2y*09ebVC7KAx
zBy%_PbaAacr}dA%{P_RbtaZX_ZG`uG6=xI(arkYBqd<r#3@M)|8}1O3B|1v)%x`?G
z29ZJq4TqX0nY;;vw-<ljOG3_n{R5o(&L?+i+th7zvRnZ=)!RIlIn~j}jx9Rnycb+}
za4&32-AzuHdCB_*lSs&RUY0s0Pp0U?s%AD_n>!zdh_H5+)e&QQ&gCDogQk_tXo_H{
z`?U~MgtTK%6fs1E%e`8`i8(Khm0=1ea@rf)K@XdooCRmO1sY{|&MVu_u}hP2Ue^V4
z3?0K?h$V)#y5&}{dSNLmN;~h$SvG*`&wrW5%2Sr@`LiFMUh%={`@Vfwsh14xgp5$G
zI&(+ZDPOv*a{UBb>sV?%jqc~V@O$SL|3v__u#dUb`>sGoJ$(K11Ne{M^>uP+Vt09m
zCaNQ6!Ne!oQ&V3gm+YV>nADs%X~2A7ns$C@*cm3viBPO@Fx&7RUuF?Wp(5AJ(C8jb
zCZN%5&p8o_7{Q6ygGS}{p69%3bio`7#{o<3)`z?ga7O3L9pP*^XK61djb&wN3JH%r
zWlnqZL_0Vvd+eCx#mp+h>jpvR@;{04S4+>fF~ydX*<yC2lU<m+u*M?4EPItN+Tju`
zy^bj}J7|wUi4sf1()6KI{Ohktm+aS}fBv=Ua~_!hyy+k6Prh)zy!adcQ=^55FcyS1
z?6&Ki9F1_TwT_|IMtHxMW+7n_>g|S;*<4O^3;HN}<=wb>$RUzDY9X}uK3JEfsrT%o
z3f5>^hBn#t&N6v#m;SBJLEENn^G;38Rk*9uo$=Wh!o9iq&EBM?-=87M#g5PmKAn9~
zQI=#_LZiyejaX`;4`{UVC>C_eO0*bS`@vQvVmy_{<}ZIDx19V`+rbhwsty=tqyjZQ
z>c?o9^7Cb1jK($?q&EOaqYIY9>OKwCa+?^fv1^Y7dIMVQK4o-t#2a-%P7AV37exHM
zAJ*5tp3gdy&+F@7?tk}hP9T2rmjK{RZ_%qim2I<F5FTu3O#zJ(Qj>V$+GohyV?X$#
zy71jngHuBP=*#ZLKbo~pTCI)nzAx_gA4?I%&1?JK?<_?^aTA;hHJ%C`oj7pOV5}&G
z69bBD#d8TmkmduJ-7mlLyO$q-o$uh2urp1S1J!Fs*xTV}e7etT!ZPL#fOJSWuna65
zQ)4VIvsGv2Vrl2EC(Cs6Tz1yRalw@7s+HK1BZF#tjtHhtiJ^1;UKU8H7nLT(@+uFS
z)Tie}TmCYmb<MbFO=&d|))MhX<}!O-&_^q^y&Ylh`GP4kX48H7#QX>KLtDf&-h?R=
z=;+H{ns%c;##Z8|eqR6LZ`x1%BHr?IdfV^dl`rA;G}>mK2x%?zd{q-6GAz^Gapn!_
z;Mcz4*#EVxbuw#hg!g%sNZ|TS;caf_fJ=@b&cvs05LGbIUB#D)eWA@>YqONFaM7}~
z4i}Q^H1&0NZQFBAh{<wk*K_}uX&6Nu^}&}B9Wy;=!4#eOGTEDFQfQ0eZ0{wi9pRw)
zc+zBY@3_dafbWB%ULdCn-Zf8zve{fs$yqHap?S#)gDIL#E{LOpK{M!`gDGP%0*)|>
z;+JMSyiP}0j2_JD!~Er1(V^wv_7ZH=5_A@x>`_Lm?ac!sYO~12b};RD*g+Y-`v>*s
zUt{qg|NFn=(S74&{FX1}2Oq~{7u7cS+`n=<#z7ZhA);?U8!?0##tZnBe_o^X#XJ4y
zvDR7u)<$^$*MLS-EpWT2`Y7+!3xg~}$R2s;UtT0JVJIkSB4i(^U<Nt0;>%cR>Upz9
z*r#m}N7b9A<~=x^i%p>xj-&BSEY%iZY{?$xAg5F^ByyX*5K0~4Qc%BK6NZ#95z$3Y
zE#fGAq~3?QOx{cF2$6o$qv6R*;eeP33$FBPdofwY3y2x&^fAK?)kNwIsL>S1Ah@?F
z#9kLHvP=pv3~GDK&tUq*6x;Xv-#$P(G$aEZU5M`YL+4$P@z1@+gmf1Dx&PCC>gV;H
zKcJuZMTz*p<M`tzbm1!6!4SYKT}B(wgw#$T7KCxWT>Ku0{qZk2)_*E%o!nX*;eB40
z-u0M97X(w)KBUn%soe+uma40$m$WT9L>X{vGVf3gg*n5CUR;}MEiKVe7<l6z+@JWz
z+D^VBc1;sC&FYJ4PEA@!^v0SH6=CQl;lOMzlcDpPTU{Qul$A-A@da_Tw}pbD_%g){
z?K9Fi6aDjbasbup%E&uAnMPCO9vqrxY=eoK559)NW$f`DYjgmlT8ImC$g{{8siO@D
zH$@kFtH&`ZcFm0~=R#ZD<2(Y^bwF(^`<NQ{b@aov{CnQ&0^a^xnX~azZ<kjN$y<L`
zAAC%guHnzT(v}Ot@BFW?(VChGEkXy8OqurhkAMF-XZ+%K9pgWfwN7}gjqn82=z{V8
z@kx1GKaL(lq0b+RV%mpJC87vTeTGhOF@6mZVSa=KU*^dH6!T*|2OTzTsm_6pqWCfi
zjV^}5N}@=kwL(w<IchZk03ZNKL_t(-@MY#qiJ_es?J%aULP!&X9S=K<*5+|=DJ2}e
za3Ls+lnmizZ+IcP&7+=MPH72&4&qF8(=icRl4a6KK#QQgl-1AZsK~u8WhE|LQeZ|G
z#OQ)`lOlp9b{fMR=63624SD?(xPVx%<H!_DIy}{;Qq#Zg^UQ&-_)?1aw!f8uUElZ>
z6!6K<#g#+sI@%^C!n~xw!DdW^LY_hwuf80<epsz_w`x7NPC{{i21>`#TM<VA_+cpZ
z0^usmP=$`dCniZGh@;)qt*4Zbd%e(`U{JdSP3O}4KQwjkE_G;Xiq&KBW#D%8CI7)7
zj{1T)8uOeNJiA9;Et!8x8%MU(h^7dqv6u*JN9c=*un+sqT1m!AY@UtAg3ycR8XxGf
z-K-7bP)*Esqro5@Hl#B&nzH)b{4Ip=qd%$kg_>m*vy^bZ3of<)9CP6U@LVh%v2c4?
zcES1gOD|aMb3vocW#L{_eP}(?eGh--Yv%j<!Jm<Y!yR0(4caEhK?k{MNf}j(=nd8B
zcbxww)>>;(>$!CTYN?<o`NS<lC;(vk$eYop=!F9vee~aatrRPuSQDbuge*Ilv5=#B
z_-<R!-{qU<zTz`(amG#4&U?!0mm>F>L>d`{O4&v(+Xhlv$Y=f}`l4(+uqDb`UZWJ}
zuBkMaY47IiR3gHefQndxE+)e4d7~xUaGx1_L2-D9FRX2{@z8@w#B3PD6Hc1Z&d^uP
zNaoxQXLPhM(mL$IVSElvthHZFnHYZ+>r$`L(1+M@ad$<NnZ<~`VA7?bOls;icR?>H
z;XnO3iTK@j3Zy#@Cv@Rp1KXPj4Mtje0hEYvZ$Y@$TE||i>Gu6!m*4xy*_XaRV%j-J
z8c-vq+ugEnftHpjIk_Z}1U)o`0AYl8W2GKBj7S4bF+}Dr7zDA0gz?6f--lc8XKiaZ
zFisMhGBC;HCPp_+Tr@mOJi57;HMLV6nc!!p_*9iq<{pVsjC)?D7R%{9bJRhoL)G58
z7`sgiXKR4TvKes@;q>P2wHJ(0&yzK(u;B*fhVT`Sc*XcR0jJ96I)2jyh_tvvkTf82
z7{h%#yy4s;){w?{67fdFz!>Z(&Tls=d5VI?5$0aF+(#Bnnk-Y!j@y;O6nRP1h`quH
zX5u^x_E3oczy5FaWnYB9@g4m?{|1xruYOY-(~F*qE7x%50etc6E#B!)28oHJ%!m!p
z5DHY7yzRYdYpr#xwN8X5qr!uu=0X}r7SSzgdhE^Wu@7|k1n=;kV!lrG*scxh?VQ8X
zEIau!3zs!D@mBZgyY3y@Hg#%hBMoY{s!6^~LZd3RUnwY9gqMYJXyUZX&83x^zD!4#
z7Hc!6ip3xHQr3G3&##*Z-~X`k>5m=Z;Kj)DK}OdMDoxF8;X4y?7PEpP+HJL{9QBrX
zW(W<9MPs6@z}uy_&H}g0@sR^`t*LI_4s!ARlh=enC|%&9HAIGvzB6srdT1v+7_ew2
zk$>rHl0*A-Z!kGNb_tsePHpnYXTIP82fFybzv(>e42-}gm@;D`JpZ;gAKO2Nwbt6N
zwGp0>;=Cyw{xY}T5k~cGb%Pyz3*W+%FN29bQJo$gvCqh4F;iMLm}32TLb5k*hF9MG
zejS=R)S=0gWYjjGOLzte-C#{P_rj&+_prR#-&uy5zS5dfda=M`QB8M93Fii*O0gJN
zqUg>m4{xKx<qwCwKu};nxQXzb4w?MYYL;OIUaAi!q&%b!!$fB2CAjQukVU&)@Mg7G
z77p#>5Je0r$bd%4#6?H<U3S5lDLOaB+?dX4!V;F0FHbzLKljBZgB&8>@eYY_VbgGG
zgD?CGEy=XyV-5gzRxL$@u^qg8`4#HxC)HYavDVY;<P;ZQ4Ha*9o9c(~9n|4F`A)ul
z>>aP2`7)uVC{4u}4d<=ck}spCh`+eGigD^Y@8M<IP!nDZg{XwyS`*U4`(})EL&ZM~
z-cr#~Mx)gWQ4?X@=`2GG!A5HNIeKAVhV;giSsv4==&#u^^^VAJiD-Vc$P9P4F$JQ`
zafU!XTc%V~tj#E8ely}4_FP8iQF4DlSS@f?!52wY*D+{@+1udD%$96Ry~J26b`9c8
z5Qz5EmpuF!vTc9+w@+{T*OC#!5B;=1|JgXb!59C>o6&I#P-SbDwlb-mNS8jX3&OST
zX046zM3lw~XrD538{#O?FMJ=iAHwt~w1sx?U9d^rfr;n=mj-2K__M^H#4|IeKBDT?
zz#F)%&2??-UD(a$GPA{uw@WX0mB+raY;MBryQU~E2ruJSMV6V{Wb~?q*J#Eo?rG{n
z8aP9vDDI3?ITY697u4C<ll3x@0m50$hqzF~S!Ogvgc+OHUQad5rNq#SKDrS36<#_B
zr9<Yp?=!xn^Nf+Jv=d?bGEanqdV_tWbns4xUSg(?GNLLLxl61r$nGi9|DE^9iLd!;
zJ9Pjje);z#;p!G&{KieGAvrDrT*RiqnrJ`+!{N`++p3*d>#o*HmN^l1^^YEY;8R|N
z%rK{dIBHbC{cZc@AGI@I0#3jg_<2A4mFK<Y(?p<C6S0AZWsH-ad>Jt<Op@N<k~hJ#
z5#B^f2*7t!@3L(}BPODmU<x$VS$vsX6H;hyZiDhj(bN+sq=n&T(pBID<ZddmOfXTv
zps^U-q_{F{kW{ALU2KBKWQSltYId^rObJ$p1I-ORveV-pO`F6#%~LxMz>4qcg2_-M
zQYsVe%e2(U6rdXj!U0mWvdJTz%3$Br5-NUW4+$qh#qY!9ATkX~*-bG*qfo(z8VxxA
z7lfP4kuT0I5b5-q&BwD5hT^m}g_-zQy^+81OEO_{eDPOr#yAU(Wi27XNH$<2gybf*
z6PJJCJD%Q|zt&nuskITFl$u$i04W%CTTOkHU;DYeLpfxy4u!uY>4bFy^8*=X$(KO`
z2zj#pypiC|PdeZBFj~WDU}~T_j7A5{n<xlrd77OsmGulCI1b_{GlfWW1KmgnPPd4X
zuLYq1<PE#YqB{zbizawa(@~42B5*cH^GZyF3qHvO>qZZcHqc3!hnWu|r>V63Zq80n
zP}tXjaL^JO%|98-WCGyP4hL(L2%0F|>gvWAZ|>Zsm@L!0PytM|<cUh!3&kBd7z3xJ
zmd$TI7@6Fw02(}ISp~_qJ9@k<0KsPXy?6M5(+Nl}Jm*=nU5=vT0wg7V|C>JcmjCWF
ztsy9*nZCqz99-*e*LsGXsA67svt;#8s~-R5_adOtiHen8Vx*Nsk(;@JMz+w@7c_d)
z`#t=?`+Sn8tUitw=x8hdvk^d1yGaknnUe1HBCIa?GDVijon<-8+<-M&-@otCuk=C8
zN!Cp8VhU~@CZ)2FRQhmML+T}lpkjEUIxCx=3;BGm5{FBwrTkHKN7si@&?DNgo?3-$
zJV`+~L!+}8fBv<UPYj0Yf`e1g==f%jaij8@StNc$|LdMFS11Vo>=&BEpZ_%}1R{>Z
zDK1fnTy|2gIvb=UAY6|Oh_l6{cJ<;b*9GBPce~b!@WfPI#m_s!JGl&Uc%Y*_KhZ2D
zaTIAV52m9`f(6tFN}IF){wps0+B<G>U|zlE2M@9nX6#fNXvPO+1rv5i%#p{<4eW-7
z5Z$RGF;9@PL?%VS=q6Xa6p7G!kXgGyF`EIBD0g@_`aBVuhiAERwu`vn=*^RY$ir^F
zaR*GZ^|obSj7OzV89Hc!JJ}6{lN4Pv>`#O)nAc<(LO?)t)c{`B0AnIVz0+7=nq#no
zB8X~qwS`UtgTomQHhmW~kAsn1RWG5l$U%!7V@HPwy!Qio!Al_F)B%3w?fU)q$Q`fw
znvIMx(Xt4uau!xW8AC)E+6j1D=oQym>#o$=2v1H?wHZ@xosQr*dXth%giSy;LLzzz
zkk|4sIxTW@;BZI{E)_}V#+rJ-cN4p8B4}uc*`cCz6}>01JkL*lH->5<o|g=uiN=uC
z145*vD_r8V6cGZEfEOS0iXWL6;&(?muGMEY2o0tT+@+BWmEA5?hH#RQ8%V{Ym5G38
zPV`Vsq|J<)O!=sMxg&I^fo^8XJt=A)jEj!g??JgEr02SCSj-~Ypu*qIYxGkI4SP|k
z7V-&{v~gY#vUK$He4#>7?{Puk=#H2OyVD^fTElPus-F^19f$%ZJoG@)Q)kB<#L~9l
zRy&;{!qQI2?RI+Cwbr`RTA|UCQrAB8f!TU{prf|AEphaQ^~A5f3n8M2UYKe^$}7}<
zFV(1(0e5KXZ}q|EyQ%V+Fj$~S+_GJK=(Q^1XlVI^$XL$ToZ-zUL8Eh`6R>C%Od4uD
z?D@7W`ky+7d}83Mvp6KEp@Limji#GgjDuwko)ckkZgL`Ir7~5Dua{$-d$C3b`kG#G
z#mKGwS^Rt!5iVtp<LeOrEpX93+}C0;Sv$go-6-c<Eo6l~Z=2tH8kDC^c`#)ha<H}B
z>3+#q7=&rUb}E1HjFAfcB3=A}zy25i*jbEm&`mP9UHgr1dm5+cT5BD>)`{>WRq$m}
zIbft6oiB5PgSpV5Fchf`7JEejv4njHcQwdc%!Pr~-R!X2554=$%U`Q0;tUK3E=dh=
zQY88)MnFpuMWBW0(&E7=G31^JYLKkr6%oMTNS{DgaV(9d0_-$AYv}CAM&V&iKuJNC
z@eosf{Ga|*N$MpZ3`UFr-9*pfMkacuA$sDy7TidNFeKK5W|GH57;=3N)~Lpn41!;Z
zR9z?@lM{s_&c8|`-k+EYOGV@2p1<f)L=n&^Y93r5tIW}@@Yi&VgU3V&b!XU=|Ix#G
zutA-_@;iFodvqFd;q%^bAOaNvWyCxIN7;ix87&9Zwk`<Qx(Bs3!V^_2!Xy|t-<_aN
z4ktK4o0tyF;}bLJnij-)Le1fHN)3X1bK5jT9B%tYt&>v&8J3|yIc4X16491O!s&)2
z<I@W2G!!)I07R1RhK`vglj#%lDlOej1BG?Ez;52*F+93OOY-QiPI(C}1f{Id<E1dq
zU_v)h#pM}OpeW`ZQPG)#4;pg1v9fcA8C(w07`lgC_Nm-m2Q&(XI3|rovx}u&DNWJF
zI7Yw_0xndhzSj$x?`PgDg%csY08$|70u)S9bXTvJq8a3XaOwaM-u(eQa4Hlf<!fqm
zV0y(_^=yP@)}H(FK^cW?ck$J$!{}P~pw>osl1lSXSRZV6!j};&Cc>dFW8_psFAQ4a
zJj!_k5X8}2H$rW<en!?IGc-cs5}mw^B9g>X5F$#iz>utkq9X)%wO@qGNO0J5FPvrI
zs!w`j4zLDODDkaRjxI9#E)0T0NMfgZLZcB8MU%w>RWeC(ll8O}b@Pn_GfW!jYaovy
zkVsyS=#`no5Ft7NEnc^59*S;eDW8x$o?A_X!o1{5dT2-%%Iq|tQDlcMqnTpLFt09h
zL0DHCbvotBc45KOogEIKHE0J3r#67l59K~v#O2Z!$Wgn7*U(M`tqC-EgVs*C)?Kf)
z5uTt*MR=^p0-}OF?T?xBzx8_$z3P>mpswT;_7K0D!pJn4jWm^%P!2T^x6srB@Ljjw
z<)u?JL-n&<5E_aslajjNIMxtj>LlYaSbkW?B<DuYZi>OH?BlbYN}6O6T@xBjKRIIr
zYlN84l{-8|%M?AwM0C@}(@@kys-H3ml-R>%idk_uYFiq9dd_WDgd8L@Ho?#`2lDKS
z<ye!W-eMxexaMGh$3wf9;~>4mJ-gsy5ttm7I7GfGb)=*nAsVWLV9KPFekcg7xweqg
z;1CYC`1~(B?a|ANGD^(k9RN)2L^5R}S!(;v|MKacp=+&m)LO|hC#bd``NO>WRw*d%
zWFiEz8KlJ)6*gQ8>+0ESG`J5ic_V4Jya4N0FJRhf+q?s*O-#NFyj^Txg4t+0ZB8*v
zw?{zk2%{K$nPS1zj9M~-=(vN4+Vh4Vc<0x-B4LArsG`d6UHF>PV>arMERim2k<E+x
zHAmcqg`23n5+_P+=_8vrrG(t)_$0+<Siubs)w;=(ytXx)gNqm}oA`w!%eZ+@<;B2R
z7fhLvHnk+$Ann<Frpb8u&vj>)9)29?g!tR<k{s{*ur{sMkaK_{$1#8MTR#HCK;DE6
zl+dWOen72tFKV3#Pg)JWOwvQ{=wP+36G0<-XxzrEX;2UvW5Q}sml}Xu2VeNPKRWf&
z*Ljz9YBIDG9taFAhCp-<IFtxyHM#)8azHdNKS=`-w3^A1EE6L#GgVP36flHXPsZ$O
z5jd3!KM(za#Ii6=S5imo^acy6i99^JBksYAAQKa01uexAkqSF)^w6g#G%A``YJ=RJ
zb@wIdbE-x|#dHkjUY0&Xqq#*5*+Xd;pfu@@Osg_PT{geOM&mZ|UD?0M6gNmQWk~6R
zDFZptntV%2r#C>y%s>kG+EkRC9DnQFoP`r~!qza}weC@^jqqeu@G^v0%ospeyM?On
zHb--S!bF+Stz_(VEzfL(5FL&%P}Zh>+UHKc^9#2=G7k^^z}cbbXBn3<WPdTng`Pe^
zy>M2OsFV^GQ4*Bk4RE8Il?EIr5k>T$cv)zP2g1aRT8yL#cXJqF6dekQKpLM0lGx1+
z?rc5zr4-QxGeM4QijtSmBDzsZ>Qs@t0~&QX-AK{REOwds=#*Y|DdvML90oLuMper_
zgou!qx{+Ztn&FWVS)4k_5>dq25Kt(|T%pd#OzDYgO_);p1yiPXv|!3im=1ODP!qv)
z3t;RZ0rjyU1Zby$4X}yx$1i=s3R$gnZ)$CXC#~W$Z}`jLPKcwI{>?ice8uM^G#a1e
zITU8DduZJ(?#_V_6sq0!1I~Ay(=}}#P}ob0pru0GGlUkNnt`+?2^Y|KUOgv5nAPwH
zWf)U{!x%r$Y+2++O)0W$q~@^04lA+@0nrc^qi!yD!6kL#Af<#z2UHqN!I>?P(P!hB
zuu03DKxd!HG9JD&hT^1pjAbU)7SKGIPgGnNglSDm{xv#QP(K5erAkddIIi%L;H&Ir
z;*qipzw?S>oII#@tCZ5mK~hAR)FZjPiJC-VyT!rB2k*v|8c4`+_0u21wA4<Vjr668
zm}=lU5w3MFYHfrktQHsGcch&d$4g2}&K}Bf!6YNYahooMln~JcwIS`+V`#tp@aF6%
zs53xUDPn}fR@(uh6oiUdF=Hhx39)X;6OpMt_gyg&mQRi9Md*vh!9g&o1YLnWhNs|i
zM7K~#?J`rzsqW~OF@#|(fI*NknL9F0P?7&ook@XJ#<n$gW`K;M$2KozAG5VtJjM#d
zNLX}mLHD93a-fq1Dr>=%ir*!i-qk&|G|>eum@LU<sRJwoh%rUeIa5Y`FMa9!MQnB^
zxg66@k3Fhpuu~KOGg(c%++)fBsiqfNP)4OTz4sgM{1jblt=ra$Je;iBJ^r3~KXV+7
z5H2_(RvvEXfl@9!tbGwx?{U4qNmTY0N4@;8diRcGrgS1mH@yM{6-G8?x82LeMT0f7
z$QSH}u<ahsGE0}Ww5A>h9K@WW$wW?XPdjXBX_}J(6mX#v3p<z$-7RaFngR#?)rvU7
zy_-~WZ=j}0tI=#{Q#RlEli5%vSTNW5ZjUJ4J}ha<Sw_VGDzZ$*C;~S$m+4^S&d;ow
z;>h%1(4;}RT9fZ6@ee;F@6v=9fAeS9LC%_WJy7f$@MpgD!}+eaPXsoA<;8*4%k;JG
zQLU%i2`mCJh~OA{VQlPr?B<XIS!nVs64p&n#q5RGS}VTCEo(Pnb4_+eG&FOV>PD9j
zzv2OVTXaE^as*!{O+teNlu8G~;KhWl(G5jZ$@#{yR8WNS9Ae;~gD>Mw4%s_0k2iws
zue|HB4$ek1c2XFj6Cnz;KuXQSL58Uv>~zajqB$bAB5vXWWgd+J45E&CqP7&kpbt?w
z-=*(rLZc&tDV|bfLq-~~lutj{tuA*mVP=LWkH=y$&`}f^i*fO!V0<bSCgzT=V9I!h
zAo`9F4jQ&XKU8;cGenHzE8J~QFE1e|qi(Xb5w3ObYMlsAUd`y}F-VoK{Qj>;5?x@V
zs-X~L7Ie#DP9|^C2HF$~dCP~noiH5+V^e+Pqgzo<fbao}ZdAseSjrnlz<po%ow^--
z=9j0Zi~v!=bga2>4r1@=Bbxd3-G-RK$K;pa0Fy90QOljBCPLN^>laWD7-bO<1L&N@
zR1@J+q>=K8(Zd!Kq3??>$`(A@o5sWTh0&;+JA1rbwIE!KhC_OhYRGzE=-@ccY%~f5
zKq^o>_8`q}5eveP{P4TjO1YEHGHG+#HJ=6ofK7~pe&zKmWpu53R%;_XfyEpL)3f7_
z&jAmhvh?p63TPqzgWDJc3naX~xeNfm@*Z?YpQ;z8BR0~Dd5|_Kp}Js+?LvJx1DF<F
zYG?sb1X=)?uE3$L%!tUZGxDjx4-*BY&;7~D=^NO&D^TKrj+O~{Ho4e1CXXhWJD7hb
z^D7kM!a`+-tT6O~3k6|@EMBKO9H6Kc(5UZ2sVIeFvPPF=nb}->w%Z2Xt?w%o11TLb
zgawf5>K4A^6h^FDJaIuU`sP2~uaO&qEd!X035~k>q7g!ZHYGFMOz;2NJ3TYkTI*=F
zHo_BE)46w-nlRA8+pOzuUlLsE3ja@a%QfMwXK&Du)wj&4Z?|iN*B({xaF6X{beFNc
zODSI5V{Yjzty@a}zR=fac*VRpM2Rs1u<Z$uDwl;8ec<8W_{La3s?&RAKIGPLG$%;V
z&Z9A-CbsIPoFDMKq%4|iMbhUlBV&6P3&Lg7T`mYK!lGu->Tnias=6S&?;WB37Gpu^
zeOA+ZxvcF)PgIxfaoha`p^F{ETulUgXA=JSQSB!0hj52AKL7coS<+-ck(ZzUylBkv
zc3W!+jmG=9;-YKa!&)2RiLCI&8ZM4^*as7ab9IfO5I&I17JqU(s0MB9lfUq`jSv93
zV>(3Ng`;V7i<s>o)B-QZxX7l*+;!&0gWk{^=62FByha7!Oa{#Rc<}Mag$S4E^y2C4
z`Ml&r2syS-JmL;H^20sd)G}5{IT03kyEg^Gmn@hCStcjKdG5?HaY3K4{kAlQLJVM2
zd*k5Tz1*#PejSc$8Y5u2&-8(d&aqATtm`;wuGS$Jd`I6=LKFI==}_*pP0(a4Gnf>V
zQFG@ne(U@5y|z=3M(#u!FRZoJJ*l-3p2*7Hr3_-Yvt8lgdwy9CxQaWPBb0g$VTj%n
zUC<+W{Pt2p0DkG+n6~m=a8u!^E@)TJzp>VY19HqEY>baSK-wBi=kJSJA^<o89jGtp
zqdD6-yw_N{fJT?mhS}AC;jw~DHw+JM6<H?JDh659%YALp6xD6CK#d*Y!d7kWe{%%m
zk~>-*v?jvEv*z45!~U&Ti|w@_ELKsiIFZ}Iz(r#y%mrcnq|yg7g9-AT^+@E{62fyo
z$-L7Jg1pmYkSyK3eI5q^@az{s4h#pjbs}8r-qqR&PiCbS`WV_^lq+&+W1oi^V62?p
zXo0?wHt+^*j$(7_*FLC7y6ZcHY`>t<YI{(4eR%~F`d(l0(oVn|+|b*|=1s3rp`ZVU
znjS;nRtrquQMuq=wx#q^6Ar|3hDM_i_8oj|E31c%HQ~@g%sav~pvk3Xnz3aIocmmM
zz5+sHxj28ljw3U3SaJsKi;2+LwcHxg-Fh!j6cx-n>n=)|A)E7fXKv1Z9&cF9?buy#
zYKtpZ)W7J@sGA+o37SQymgYU>bqhjI4b1kd)<(G2y{z?YJCPM1I#8jbciao36U4H~
zN<k4x6e1A;OmV+W+AyVrN2uP>q`o80D94qMH^h1miV&!fz*ibn2q%O&j485$AxO+e
zizR{fj70XU!0CvWh-W2vBAnsP=0?luGe|lGjWQmpI<PT`>>)Y`r9@;Pduit_+|y*p
zmh3}%FExdrf^H(irv(le+&TN+czWw(H<wXi`<Bixxd!e=wICC*sGjkD$?2W$@~{N}
zog^}O5hIH?S}#@N_oSAFlwOV=vw9Fmccz_nO&2a`xAW-`noN^;YN4HoxicW&>(Fue
zFy!tZ`H$}Klw51Aqt`kSp3L$w#2w4ww(om8a(=2cVTmYGJCU2h7zdk<HW30)cl0g#
zR^HL$6TB1@d&JQ_P;`HAw6UQqoUjSyX(9mdOFsskf&;rp;D_j!(JzK|n0f|Wcpq@0
zEzr?<A`Ew!g?=OGFg7-qftoIfGpN<w&`9h>Nen!51Yc-yUY7LHg;HK)L72GcAj{-U
zus;#Tqzfyu402*y;G*-bg!#Te_hgE8p$i@Ii9s2~gx#cmD0RbRb`YLCkTIaq%MZRN
zp7r9LmQ>dYSQmtA-P2kd;fbtt$11)Ij{_J8ca<c0Mi=Cw8`X|*K%+-H_xky_p-*tZ
zClo`YHid+^;A&zf%PbX#iH_F8=*{!Cdzr6(@q6Vizk=O|&@ZcBLcbinZ3H|O8Fj(K
zl%?Y~a#402c)OR`lmSczvBVY3A1Zl3!-=$rqw~#E$RR6D;ViM(YoA4IS+ZpJY-Ms5
zq&s^@_n75N>aKuiZS+gkj<DBauLIptSZfeR<xbzxCqnQor^%o5qNd5z%}x=t&`tzP
zHeSi!{IA}<e@=SoZ4Qp%gj{Q_Bi9Ozp2X@`-fw4KQ0OSUZ}0q=k{DqWUFnofLIxVu
zV63sJK^yu8x3e3akKCQ+=sVcym=(gqrtsM4L&MRA3|y4Vz(txELx!b0=*U^X-bn11
zzTY1FOX?59uEHJ?w&Vi|jdrt6baRXJpt<$BL(x%P@(3A{dis3>l!rkn!(JzpbP9@%
zn>SjKLW2|JAZ3KPXA%+(bebt((|}A}j9d#!Vkje{ognfZ!do>6DYX{05Ie%j9?m%D
zGx`hw03ZNKL_t*Yo+=Ix%r)I`;?XX`4pC;Zp4Si*qV)$;20QZ|LP4lQO^4dO_VctA
zCg%akrqWJ0at^-keTF>Wmt(myTWhT&*LuR8)QSsm9S<}L0CG8kT@gV8wX18nrOU=M
zCc>kB-U$!FMeKkMZ7MXvwjce<gBQFFfFdQqGJ;lSWv-Tu5JAd^MT*`HyI_=G{viN%
z>Xm5E0nf@GQE4;Wje)zuSS>KdtauqUB#&?)W&6&E3H0h!2AAY=6D7Bl6S&EZv6PIA
zhDeo{Ai}lS5i&!f>JmVp>Kh>An#>zS#aAE<zTN4T`NMR&BPPNk%g`fiP;|lasaaWp
zv*HA6n3k4I86;DtU%9Gjhkgi6hRL6J+pj(6v(8|_l#%?&3&MWsXWO&C33B0U`$u1U
z2PfiMYdz&!8{vtqYzWZdu^evqfq!}M;;$5ye2XA;7(pXVXw`ch+DMyXxZJ+{{13Ee
z|7Ahs1fDL{V?-1Y7JQiqs*RXCijhe%#=-d06l9rXW-dD7b@#aat>u4y;#YjOJFQcl
zY;>3vzcdHCxSr@jH#xxC3kG#a5!)1<4`l5!ne^0Til$COu$&#8!|_v$utkduCRLJD
z%$gc%kn%C3Iw5m6iUR27l*?R>PFA*5z@(W{IYXncpmfS8lPwxy956=D&<+AU_&$?-
zXI-u>r>Rf5AVh1l16HV1EhEJzJE%n>2C(9yYu)Qw8{tW;_6ctt6XDZ~<h^l4cwT7T
z0gwpzj%_g!dTt7z_vQHDj~w;D-be?!Y${KhNuh!dI-&<<)QUJ-{VylNghr8+QO=~(
zBi(y?wxLtqjPz_^lG|v6at~=E!b;mMEXjrF9fl;1O3qBR?FNG|c7cG)joAaoL`VdG
zGhkC75{z;XL=2h;l#~G3n-~k!a2SWX$=u81Ej(ko%fr4d9Le{fQJ@qWkt5%c>Gff^
z4KWObVri?L`A*t#lKU3Bolje6BD&dz?G$M(DWig_LqGZak;L}$Bc2s&t#w?rl4VX@
zwdeduT*L$J{nBwBS`J4=wI-QmW~_wcs5bHq(t7)-r=MSZE4t)6c#ltC`3^qSgoj$%
zaTu*({%UYrSiVIjVs*izbi!iFq%wWqYZN^jVZZo6^=&wh54%wmBNRS#gryf8G}m%U
zE2r`j+YRx)W+v*Oj}~`^*Rw`5xGMg%p%+YAP59%4xUjQ3eV6iyN`NZEHm}U7(hDvX
zg!w%}-YHGyJL_GNe9M05&wk^VVlqv}g9=GzPK1{pc#(_0`#=8Xlg=MN-XHn+r*h7%
zwbn7z+6YfxrF5{!j>lKK5C4l0p(k$W!=Yrs8ucQM`jMrC0Dyk+AHjt_g{lF42cNbd
z{_KSkWc0#C@7c4JY3MDZ&qpNe5gK7KV!91Y{p@8LV!p9z?b~GzMzLpYs4097pa@uX
zND^mHxCr>2?MAh<7#;M{qIZ@CfAB@+O}(i%UpncO)<V6NKTgp{w+Q(}=q0qDx#(`!
z`HNOljO+-whgi@;II%mVwg_BQ-F#wDMj8HUrT5T{k|q4o_aFN?xz<`osTCSMS=FBV
zQxQi9xc95ae+Mew2An~DbOIr1FDPu0Q~%VCJzZck2;c!UNjvy1CFIVTII8e>PC-59
z9iffHiCZiPZ*afWUxO?|TJl9Dcay_=eSC+!TqY<}5`*93fzv8SSf@w{bPFt09twJ(
zTkHdqV#->3f=0n8#DXxQ2n}#JBE&GSIgsScghmO6;O6G;1k7C_Zt2}M@wxUmbl^$4
zv4ln)fVm7ZtzA`En@zCB3GVJvthl=d3KT0)+$mn%io1IY#idZ7I23m;THM{8kV0_D
z3IFq)yK{Mxi{#>ync3Odnb~({(<5hi>@*Mv$EiI&5bT3ex*7(Z4xcqn20mr2VJq^H
z%{oy;pYN)goR)ehz}(M&uLER&T&DpJ)WznCvYGJllEMG!dv+pC@A83a-Kb===7|MP
z?D1m{@e&;5E%XdBCYj!w4$n)b*UD5$We!9c%5q^`Al}_&>2wj)5bz2;IEI|#*ZI?}
z_y0&>B~c0@>)lddLq>3Ng#t=!Q8Y+10!!8KGX*2S>F{fS$&C!#%J%V{6FC{FYn6S^
zU~ccY5%*#6_9Y1MOujiJ4jp1P1n4E%r(ai+(D9Fi>2@mhZ)5j-|HZbk<|S20$B>b^
z;u!HX{UJUpZ6O2P1H-2<_2X1Mhbqfg$GX6N@=;ghd!0}B7a@?v!?5~ile_$bEL`j{
zZk>W&OhBU^>uJ8uS%m3*sUMUImy3YBYS@(1GyDn|J>waEuwAAap7{@0T0Glq^)z_*
zms6NE41*gfh=@>$d|d7tb+W@}W*_(XH=scM!oKeco!(i+)a$-h1|S*NuSq%5NAYoz
zhgnwCUPkXm2;NRps~QDflqWpQ1OMQ6LFG-Y%hl9p7Ht-hXAnNgb&N5{@S!Pa4FkuY
zSM@S646)C^7*~VahZf19>RRQMnP2FS9MYwro!kKp+i8rbW7{8I!!fvlDu*V%mh{m@
z{0K}o2ke~WKju#U#T!z^2#O-GER8t*7OY$kl@x^@+~7Hxz)OWIfr72XzJ-*N4n9?o
zVjV00oDF*+KPa>dbevu>=5E7KkOlOH(+ZE<Q+hyJM#%!cy2XtlBE_KK*`A#YlH}so
zsd!b4Tb1+*3y}M2d}bM>pT62*s0`;8I3M?3Snq6a%BU7Kc}7vGE^{c%r9X^GMwnY|
z@4h-8x&qZSF1Wtxo5uA}7sO=kFW8w6heJmAi%bIidrpCCZ=<Lna7C%<LmTec56RiE
zTzK+SKK%@*w}uSXAMZY}^|O2p8<i~hpxlI-aPt<7%Y`oc5cUmW#B3%KO!w)6TLaW8
z9{2MONs*Orbj^B<k^w%NjE$Y`!E`I(3=3)Y@=X^Xn~{Y^3kw6sm@%k&#DCS(cN!43
z!nVhzeSn#b<lc6`?Wc6K%~j9md6#HxY^Wjz^Ef<ak@AhcwbX%izm1!xs|VoM2(6kp
zR0Rz+A`m)Id5>5grI2`Q?<<w)K&BHKL=q(dW-Kh|R2&aSQ?R}yiWF-F--SdBxWsSY
zcNb15-cq6D_20OoB|LZ#wSlM|+RCBvihc5I-x4(Z5|*}|tQ6YRA5|zo+rFd4EC}m!
zh9mL@*4)=3X(Sk`5lmX87pY>h)`7E{Vmy7=^Vtt~lPbmDgr?e;xvFkbdkt4z5p8z7
zs!N@Z=M7kuKbZQmKPbR51Dobm1ltBfMzcjyGkLdI!CUy^!-*pwl^ET$#QH4R;1#hD
zGx?4%V-u;ipYqK)34|n1vbcw2gdimuiEdUc&<ZC6Qbwu^%oX$^3?|I1$X~(IP0_}`
zLlr_2Qw~kC`<C#~8QGsaEI9elT<YSjcF3?~ll@|L<*$j!Qa6mLvcgCF-%8k~3^|mM
z^S>96VD)`JJN>1NodJPlZDgdD?>6^hX*~dA^Ik6B!~P_5%a)=~uq-zkbv=9G^rA7(
z9G2H;1j$AuPKirB%$^skH64Z02Qxf4ZGu3WT5zS9BRO*|n^p{;xp&WmeYLx~a*lvM
z^)gu3>MY0COE*tOp+kK6_@C6+vgqju;w6R)6_QHKf<uo9oOt0A6xIsN?5!Dirne^C
z@UbZM3i~;z7QT};hw%`WqYd!#bE}uhQ5|WfI}6k+e4EeA)cF)2tm%yX-mvXUnH&RO
zrq|A=jZQHU8N(Zgb*U?^a&J}HTXeJ7{sRMThtU~>$yx*0;cjghL=Js>%VGoefv6*?
z(<pA@kP^$b_6SawUw313*2i1~Q@^Zbo>MORYz*P{HEcBpI6+kMlJ^m&iePu!69E?k
zSx4JF0pbKi@>~X@n6C79dWxSjC&qj1C>BKioqfM^MEHs3EU500S{yo5nG5KB>5)e*
zIQiQjUy`1>!H`>LZV$_YRklCQ!5ona>Xu*X(TXN|VU5#P+viDLr%=hf+W=UBL)mML
z`%f3TB&8;6eIpwt*n_epjoL%Dh52)L)O0;?3#v-4=%P1Mw=bG5px|CEKo?v(h4GDv
z{BMcSN4A<ge!Pcb(?hwMAw49{ai>doTd&~v_hw(puVd9JRe$hS*^w#P78xhx4C+0~
zLtNRfA_uc@gc`T&XS03f!Z9xj)^FNkTtF?nsD2!P(+x6=KH*TWgEz&uO0#<b*_ytP
z9Dr57(O=G7-;p+2qf;`yxBP7j>t#99U#If@WPqqE(qf83J`Z+JQpbqc#b#tZ11S9E
zF@N|?e9+0Xf8<J6yzGS{uH%+po{qAHJE|@DM-hGb7Kc0jGY>6-J5Eksp#u@ygSg2K
z7x8VCxO5*v`X?a$8#*D%i4X|7w8ECP9)V^T;6p3zPo}G?hu!pR=9(yl?UI6Z1NuyK
z2CB#hdMt%$u@XJptacb!@Y<&H2-1|@HW#4;pAbvLyQXX8QDtLM1*;@!*RlY#yMtq0
zajVo?<%WBAA64S3iLvO!*JtF04xB#~$}rVW(<J^XQzw~qI#P%WEEqosaASyfO_puz
zPtD+Mp#0HN`U%O1T9BJ;eryI00T)vNfDYd#*PCj7SAo3Dhfu@#n-ldw;i%9MooaWK
zkvRM$l5^Ak_Abg4Qp}aeEo*3yot3Fl7Vx=H42A^hi^&Kcslym$sSRs_^h*YeE;^iK
zF?r~cs5$Zmvx+^Brs|(&>NzkNomOj0-L9V#yhH_f_A&k8h3g?w98#gID(Ip_ugj>g
z;H=E?)&BD^?HxXiyo??){zSL&iJpIn^$z<pm~}9fyX;#iR;ScV@LbB*p{ZXsTTb{U
zzr%=|nR4vQ@2wUQYwyVCCIFqWgqD$)&it}-z~~MGI-qwE7I=Y@iJ%?rFP#-bD&?6b
zYRR9nR=;%qRvL@8le0+B(F~(Xu8rXDNc2WMifx0*aagQi;9WJN=i^^M;UU^uB&xXC
zxZ75tq49HQTs(y1Y2H8{zhtTlx1WIudLs6+k680!?`bKNK?fes=I;vxJ)X_Q{i|I3
zhLRx)=)>GFA4yk=#bOYoE)bEn0TLH7xERO&zNCXAyWtGEL*U~#0C-Sp1Gv<`pE?{p
z_ID@5!fh*Mc`44zYkbMTq_vSQ`r2G@GbN6_ogB=m22hCiR(12tXHs2!C_&7PHEC)8
z(-e}qL(6@A1D1N2w)7c-8EjIAPEo^Cr;k#%RB<{sQ)NF#wlG~>IyC!^8Kl}ZfG&*F
zazt@@Vc3Kz;qwxCqZ%z+RpESa^UnB`ke>AS6lKL1wz&HL%-n3WdsVVB3r9$(_%k0+
z;+(C`U+#V|-xqf+AI3c>np2`hlsIMmLd$6Cf#bj+$^G_~ce-rgQIHXul_iE-(M!cM
z;&<y91RlicA>$`gy}as1h*J=Drb#-+GIglht$fY%RqLpj*#x7)zOy~>Qz3{2Kc4-D
zXz3}_@ZFQ$PvoVGejJsOFKMplll#lA7EwzL^LCDq8_AM8s~v7Y_cpJuHf<(fh%?Zz
z&P8TgF}dBskb_tI!&32#265NrklG?Wh1r=U(RnrEU3G~;@Wr%71x4jC+y)&Kth)B^
z_hkMY9~eTItIhHNa>}MLy$x!XHZF!aBChYiGqA#+`w4C(L)%rH{Abl8i9a%sx8h4v
zf^6plM34N2uc|WqpQ_Y75I|KQ!-L=`wHd_If>y5PgQAD_>re`gcwI&m=Kw9k4D4YP
zh=RxoJ4deCWo6EP%o0LRQu~`1o%|7n?&KTzc+wI-Qp?mvV0qv9%!KGo(5X7lNQz}h
zE>DLb1juXP31?uhV#ow=0vuF-fyMte+5*)fXatWsv#q!Ds*28d3d3M!0YtlvpCu}_
zTqP<bVtWG<ZGIPh*j-lL3)7jJ&q^!CunB4>yHj`?>QZH6U3Iu`;NAQ{u!$tX2;MEH
z$_p8ubrwG$TyTSihBjyZoa$375{R5VE^{L*zI_WT(u-Y7pZc|ZfLLYv^w{UF)z{*O
zl%gOe@m;Jh5F0Iu+G49XV8T!N-qKX@?2%ejG!C$v0>OVQEsz{c1Z-PwG?`ocI_5dQ
z^eH=QBA~(&o068f%8*Q+*PvJ9KqkH9yafeRtbgR{Cm(7!RewS-{3hU%{9%<1rXQL5
z|5*;$szUK2PO*A0BmdV`(7Eu1^%+27OL7c(JGpKs5f`;brtwedOe_p+up-w)v++en
z*va+Z#Vv+&Nc2tSa?EO}d<WjyxBBhvU28cq3A^G$ZRWM9sJB8z74mUkoAKw;e|K>?
zn@HX2bdSvSsYhM^hQXZW>L=TjuAUPZO1{o`w_*@<cyC_Ub4eoNFeMh5A|$J1y1FzE
z1wuH~q0g}W%XZk#kkP4$HgqXJUo3568$47XxB0y7x-qybg*EOE>w6p0H|N3M*We?j
zXf}<L-$(Upm^G~UH;uxVSyV63g|hZLLF=3meQtuUpSf){12&`R*2GD^8?IgxY@f;S
zF<WYLL3jYzh~#6KeKEbMGAiL4dmR05#P4}6ks$kj`%Q*IM%LDu&6)F!Rs)B-%duN5
zzk2Dyo$**nU%w(X$qZiUqy7jz%0HrcCV&e;@x!~z+3il+3!ugOfE#;%0Vj%_lb4=~
zzS_XRXBB*Y0mbbosoN+(VNPr^hg=1rs;Lr;>hSj()?_yNn%uPR8wm>+2Sm#8ti~GD
zDHK^X<v{y%_%+s!QaUl0L<8aix7mUZpO@2>Qw`$BU>g9EC;O_R<E!+8WpeEYAW1v|
ze>bVK6BT6h?lrC#e7L5BmY?y}u=UNxw(3)6BghU`IExDh?rV30%*{rygocJt*dpd3
zM18h|0Xo&5ceKR(4Kf4)mw#4eipDPAL*arYz`k4J6aK`s5au3|9v06Bc-vu0G-8oI
zniRIFiinCI7~e(<9~UzOvtn9lFt{?lple!Vi20rYnxFgHgB#$i8YBdgyc8L-3026h
zT$o&>>7;?G;g_6hAVU@1TpX)H<dU&_TlyFc)mn#_%%-dgSX@>0YQtX2UIuWuEZ)d6
z)xl#27l;4D^ng>HLZV9J%_{EILyJ0PcqOqyYF9TXjR&tuUEN+qDxWVuQr#Pd_@ml*
zn^$<)0mF4gh}LrGhEZGY>`aoPPCLT3w5>!Dcyc5gVm9c#Efh%|9zJjDtgQ3&wm(ix
zcHHqBoycz5KmHIFUX`ge|2VO(em-d6Q04dW6xgy5praC&3BI!~C@KvmMHlLU7tBZB
zl$q6H7=yFRKmQI_qxIsEQS<zC+l0Cqti=USo$S@19zipTSzg)uh5nd4>k_S`W@Q7Y
zr?aL^Cyy0T|42?1Dl0inm3uVjCPTUs(<gtd`WYr3vitWUwC{vG7lEzql;8YMmeiu2
zRbT4>O5y^~Z?Ak-6a;Y>y|x`UulY?XV4zCWMw6l{&-^ra_=KjJi+2p-SmJOw$P==`
zO_v;bC(`K@T|aWaj1p}B3cN2RsTP`x2%>sG=V0#3LVn*Q!*Rz89&8}#$k>Y(q!C)n
zrlKhM84pqq*G7A<xxLk>0U-u1N4!ZG`BCPX-d-E#z1UQN7!Y;LTXJ<TNcq_o%l`VO
z&Z{5g^y)`Fmc#5H>iobTz8-zB%og32KJ1tM3-MQf49EQ6HL4owQRKbOJ2hSdQNEzR
zN(7$$^(Nf_4N8}z@pLjrXF3{6980i1iuB6&uS3ZG%AOW0_xl+4;q<~?Onu7KPLC@w
zuAfjiV{=>EnFfI^?I%ZukoQOF4{1>5d}`MEX+Rw;F)0z|5TUTx24$lxqnPSJ?Wu>6
zpbrDp6K&ByB^4aAeo&~Fm5~|KXa0H*DtNfRXiRz}o}o=QR3MdAh7dI<=hxCs<Az%c
z{*6y8#AikdE#Kq;;{V{|P#0@hy?GyFf*ww8{|?|R&5)hUm=544q$T+@3`TeNR=EVN
zw0ardywBpiFAkE-BUj28ObNKvcff?LYI_D;vkPs|QDr7qxI7eUICVtSDfuIO5BLWb
zexIPx1ee<`XcaH$9qDYYq)s<jVkMB&sqL;l%agE&8hzA98nO>;$+(Y9EwmmbGyPkm
znQnwgf*eeU$K>Fl68>*KASvuy>kamWqLIhRlBXnOagOW0m}b+@;+&m5QC~s)HC<8l
ziXrHR`7hm}Ho>!RDC4EK<c`oGNDru<|FXB+OMM^)1fvw9(X-w!!OxdcVH4o9bgUf~
zLVMJTc{ATpcH@QQj;V;Wc%g{Gq9ju%KGQjP9EPc71!+7gagXrDbAU~wMVOXWoUoj?
z?gxd&To?(1L2l3WEB-n5^gw6b&6n=AdyK{f1MmNWnrFQ>6kK6MM|{@nq+TfLb3gdq
zmROK-9<SfKra_J9-B|6j!xzDvjJymH;Y0|nYSa4$IqdYt6};~~QliC(RPq&ckxF(2
zE!ZlC987&vt?wPp3q&iG$BZ0PHutbS6&Uu^B(DSiKF=8DKgBNznvp-)V!_HUGL28s
z+7<%zp4Xt5K?weWW>ZMU!TC{~h$KH8z!mDysd^HXZ<f9g=A?6;e5l`!yM`otd6fwO
z{q~OcaV_(6vat&dl}8AyF&^+{__$W;AI7d4vNg$^3B~~T=hG@|c~6WI74IM3o@LI@
z;6Lev4Omm7ayEnVi@pkr%HQ=*Un&DZ-HwycD$JItH(Tf~0FCtS+2^v^PYUuRpT^aP
zAbJ%~Pf+-RfTtjMazKkTDw-gWP=c(BkGzD}gEo+P=48w;>Wu>9_P#twFEI>mPXXsV
ze1u}Ur(lG?98FExjMs_@MN0vcv!yjO_iQbq<H+EQncMXmM)I{S#K5L#)5AN{WtxCD
zE?8|Sjz7?BB_+I=hg4Qo@a(gwC99*_U<9^X5a{o&LpL`%hZH~V`@lh80!yjaRXu05
zy-C)G<w9@^;gM-l&QpNaisPKqwI6y8v*MSW=p(OtPpnl135>yw{SV~tJo?*gDLt%#
z#5)hl8VV%H;llX*pXqC<^rb^0K_%@cIh!x8<*_A?8zpVWAp2jN%ug~@6P?YVB(3WT
zzY8B>VN~Yj^o7_)7qTV(&#0eKICtA?dPM7nu}^ASN8WQh;=4*Sh0PMsg}dv9W0D+;
zy2!dYaObuidEla+)`-pSyu*#mMRpyKqHQ>SE7tThYlfs;7E-7iej;vz^E@aGIuA<E
ztmBd<9YDMe=H6m?moLC@5$2Iebuh<`hH6KI@BwpA`a@616aD}K@9>0dKe(T{$A!~R
zKI6Dy=;gG5;ogbYVt_1}4k)c)28>61M02E7dqSsPh`Hd(I%oZsGNE!LvZpXB#|1l$
zr!+>ROwui<lS3rKa`&vx20o+wO&}=Uh?6mROD!0#8t(E|jf`+)9x1sZ=E;q+t5hZF
z(1&x8Yfily1u-_7w5Nti9jNvsJG2n}R~Xebu~Hu8t6d}2wos;s_t3|8xaH>R1V1zb
z_6`pra?_}pjy~AS9>cWheqKkkRei*S@cJ5r17=Ks76<xI!SLC}$TR4lZ%t%N6LN#;
zNJHS`qv4|!!vV0q19{|%kz2sZwD<^5P6A2v2z^MbMlJ(C9^3r8uiZ=Jg|O4<uqF5|
zFSZod(C{&;hmG;@!y`ytfb7Gjc-Ft&<1oy`&i;9~Ux*5k1C0i3WDw#m*b(vFg7=ud
zyHC)!Z$&mv7}Rxo665ovs@7!z=3QO|(^ZF>rSja}zUwd&&(b%Y^ehVX=G&?1v7!ww
zqD73A&bd2`2<|3BzXOuGhydU$fGS>p9QTNG!B-XcsNpWlnZ5PvE|elsm;-r0E*wC}
z)3{@9P@oI#q-mK<!Rzx0P~s(;N?I=Znw*BA>)Oxw<E=K~xzb|4D#wV-OP8AR{Em3x
zv+00HD4&3s!#!vzfMg0noI3EWJS*0c&MKa-X)0FsL%vLWy%a_Gm5zO|9ldt><Qa5*
zA_mHS(=MFg=tBgj`}C$Iw1sjQkQP!Nj5$zvXjEY0r645fDG!j+Zw-k~4!fHNEvr{6
z1U@PJiSaBECx38?{=Jx`)@?o~BAs2P`Mj<6RK4U(7woVK2;S8Vdn@hg!pyRr2o>}|
z9GPH6Jeko#iHw#XVCElDlRIh8i`9F(p!~<mATbIg$g4S!e3Sa&5TF{aoa<~f6hxxO
zm%Zm^$^678n~Y}>9X1&%yF>e3kuoQ&(L%lFrU{NnUV*Op*PwJxvS!$OnC`q8C#&t|
zA|J7qA+7yK^@(v+D{_#&oi_4<-CkX>Z848GWjat>;UEY^R?hdK912s3kA1(jD)+0A
zmxD1y5T&0A;?A-(km!U%8WrU#cl9b^T|cAop8TUHWXtM{V55M~ggF#wAV81EvlU$%
z0=GjuT$7|o--;S;r<W}m_;YdHnxu=Sd{*P6(iSFNkC+Sg-61?pq%$s5EFdl8Fozg&
zXnigHLT?j9GL;%GIXBw_pe9pR|EfUv2f|{kzi0%u<7?@LmLCi6?X1EFM1?UN2C1XY
zui@#E+Y9Cf9p_qQUinnP3?C%h;cQJNrH7+Ms0%hdlN577SkP>EQfYq^T`%?I2AGhB
zJy&WumCcx*ed1HPxf|x8^EckhitC3w-U(~J(Ivq;PWK&+i}prl$&lH{!jqgIy5Y)c
z+(XL|h$*=ish4~)hkm1XL|D1ejkO#$U0f&4#H!)2t6pjS9)NTtHoQm7K-j}&$%1(o
zLV&%{mly1aN74n+Bq1~vZn-cj3wf2;%$vYWMqV?-J-)(Vy)9a@AQ6^{K7BBtF42+!
zW4T@eA{6#~kVeju1xRBvFC{(@phevKjzc*5@>bEv%UVE#tn#l1B|FGa$G+!PVZ(C+
z9kk7)RlskbmA#(Lp~2klxS7@|p`bW6PbV_sP6esQv-(!|Lni!~^73*D=Z=3pAr`sQ
z$#8J!XG%aBZN!Mhdr<oYF{e?63KK!hKqxW>HkIgnzT--R-T3%;lEjT(mj;kJ05biF
zSHy1SXOh&*ms)klI~K-a^WG=OtU3h+#n|X*iCXT%2y_14X;fNzrEF-<?M@sQ@743|
z=7niw<9M%QT_8*67-!+BsWo%NztexBJ^Fg6)bOhaiy}SF1*Q|EhX)7NpzVGfsWXF8
z!>2}`TWv)@Cnu+_^QP6WBcH6S_WufPKFz92UDtFB|6JM#f<D{wD+70jl9GmYf&AW}
zHH1_D`~CEfA3p;5&HIo{C7n0KyOl(9^Td7Je0)UkIv+vp_r?;>kXfL%zP=KWfLV?5
z_bhw0Y$zr1IEP`=fCZ1GikuuGp0UTYJggUi&j=giun&dcXYN0^(+)MA2k-j~4hov|
zwA|Cn9{s9=zEYTMMe6#DlT%+YnS#aKdkv_sXspNCX2D!JzTxkT21l}4zF&^<5$V#o
zZZz1<Mu_bGNnoI-7j@Z^?vic3bFc)JB@5Gte{tyxM+18FB9o-1rQuCu39U^fT^7D|
zqi<MH%i@oT-tax;z`H-GsELlwtZIyy%M^4Z$LoAJsi40cBr(PPz=(g`b`Ck7jj_Gh
z=)C{>Z+D1by4tw?NiD}+&bvuoQ!!bdkv-$BZgq~3^M=?($L!3^jAwuC<&3sjawnCT
z7b89z^!(|1(e$ye_PfY0j_=>R-Or`KM>Z`lZ>mlIVmY+Jdav9`2z9{zwrmqoKl3kg
z?w04fUkb+R;B5VPELC^C(Wy340yb|3`gQ%ZfeoFvmRZh4>mfD0@7;Ek{HMp8^Lws@
zuJ0tfgz8#*z!t|<LHf3n@`|Uin;S3aZgaAz-_2QBb#>Q4mV^I&3d6fL$JOa+yaa`c
z3iSZr+2aQ1XPN*A9^T&^5qB4L=PxkDv%x$N+Vrpgyv$3VB>?NJkJUf=UX@PfCM!F8
zD3NM)X^AujI668ybKDT#Jl^Y6m-A#;{rpa?YHzy6<(a|=ss@_8Xnpalh6+{tg=(pT
zhbdYPIC&XRZjPQczT|X1Ki)Fq$DEv;JnfsAJxMr@`yl^mEh&kN#-@>Er<Z!UW5D~U
ztqm#aIEr1<w?18{f~)R&u!p)WRvW{WsOOs~<|=(-q7relM}M-(^Fir>NjINsxzRxv
zR_oLzWX;LN<?QSX9pnmxH@m;w4|CJ$SD}-UwB$Y<&vXZG_3E)V+0U0(Q$(hvXUT?Q
z7Bn_`Zglv>04)Y%iRx`8^LQ*381ZGkj8Q^}vo8c<NpTV7e{03d!bJ+Ve4A-X*&*1w
zQ)o$qm-O8vB0cPQ^Zt87Q&ShX52NT^lERn&*ohceHaN`(2SA^11q1}T-YQsHTAGeU
zU3T;lw$_g)Qi;JC`5qS=o0@nnTLo0r``=#<(FAq;_^}O};o~HrwN?V-m#ai-iIt_L
zrHzd|6{ezTmS6#g1<X->EWQY&+KRm1&khdlm!oe9Vt_U_hYU&LUu(#8OhVDoem8ne
z7s~(r`<Ft<X|3IxD>#$ShQ7lJTR!gZ4f)?UvN6*1$-)CYc%rw#qrGX;WItz#1XBYw
zuFH6844a+S+dOrRT;;X22>Ny}>?}d$$-)$t*5euQ1$A|G)zwb>qiJy8IgM8qFMo*F
zXvq28+f`lTD0b2W-kC2{>H`}*PjyVUyB<Ldg&!+)JlD%_MI9X-o7dbh@Kkd}Jty-d
zjD?KaJnR;;;z+od3QJ0u9L^8(gCzZ()Nz_*L(i`9RYul1j_-45D?5G?;_ty^o0^{P
zy!=}pNd09Co*pK&bVe96GI9GS#o{MC)%RG7or7h!!q;@Ak~?#yIllR)FFi$pg96<L
zqxVJuLYd|8;!fQ}8yQJ7Qj%V0de#%V*l|I+D;b>#yBz_KH*s8DEro@BLB(8pwFN=@
z@<KmjT%a${TJBHlHk%~X#l?fVwx2&U7CNpr!MI5mh0V2W5%&@t+b-FS#zm9&z^?T;
zMNdxwJOLr0xZxNAX5XL&7fDveVSK{zzu7`HdUY1FC8}Mr?(Tee^Yil&X*ly}Snq5w
zFSDJylz=h7zUCm)ptGeqm>mQ-WXerh`0OEypX7_&^De%GXwkT@GpRXl&!y+A3^WGq
z?P(cZiGSqWN%1BaM7f!I)-tpFzIL(YchR}njTr~kQkN)BXf5sAWv8E%f{Np*<_P~g
znl7@@G6Bki*mt9ZK5umB12_CGB&_qe&1IW6EzCUy9amD7i!JJw+$SYSTCP6vj*M4T
zRlO9`P=NnXI7bh!G&;l_m1H}Sugy|WqocW*ap!;8L8H%-@bePQRV$tKUUQ9tTBE(C
zIU%4>n;_k52erk8o~^a=RsJ_fDPt|Z$jqkOS)N9>%xaGNbNM3I0*j6ZDcw6C-olv7
zG@$mm?V)boM7JBK{|z%-mMQ@O0WTGT>@Sk0_LiWM9^ts*oAcG(e_zC@H@gBJms3e}
zQwX-7?yq84$P?6Zgr_&}ms?zmqSt&5a~m5QY5c)5db#WE-j6(-L_|dQ@N!p&lam)d
zuzP|0R->u@N?KaqoF8CIMcmMCT3TAW_XYKX7PYSprkfsj_w$XRX`XVizjw`h&epx*
z6bAGCLCI+gwx4efsU-a~qB%RjvQS<aYpO8)D;2&MUF?|jTorE2eit-Zwhm*lIxy>9
zr!-N}-;b)Fz9I&$y|6M)WU3roj&U&;E}8~OxG)><)+C5%gq*h)7h7HKjm+&bxtor~
zRS(C2!Q1_D#2n?7mF!$x`7rsupbVz6YOx5taMezn%vbomv>0}LaSfb2U97pd!Fbpk
z`Gz9_nabd?w5ZdAnU^K2m;1wb8PJ;y*ai8L0lxg?R4@w=h9mjqY>B7a@pZw4@!`19
zkr`dx4if!eK2j##E|ZKN$rc0p%PxE%bk&dF9i(<spri9#-^%t!Vdw}aC?UR$l#9zm
zj)=L~F>#RNxCGHs9to$BBCvVG*P;3Eqk)MBV<4-2v9=QLe0KyHDm6wqQUY8W;)mqk
zk@+ohr66hC)l1E~%@WNpTfK3C@>DirzXmjrum*f8;=VK`x2-8wIs6;i<fi7hXX-R^
zqgT(&2gIyF#)1vpTA_to490i6q{>-4;*E-Xen}-aI^3)Jphcri{(V+env9IZNW>!S
z23H%PVYY7zF0hRK6v~D=xvws>Pl!=QiIH)^P|Mxm_Vmfjiqiq-ml3h1h%Gavj>xYy
zOyGXcrJ}wI|AV#&IZkwt*?vzJT%im!>|b*Kpanb@Yb~y{_%F{v*({4SByCQ<1!RAM
zmX;B2PpEC0E10<u6Mo+c@KSkQ^&5kQtDY{+u_rUtMwYD<k!>gpy?=B!w>Qm_3Vy$C
zY7{;q<y&uBkxZJZq7?x|2913$S%MZ^MErD*NR8=4(Vt_2$5sp%TxLUdJszr@8{}bb
zQmn0$WJH=wktPZ~nv^I`)qJB0^TU<PzLvyju);(=3;dO;S^g8|qAIg~oPh-v#i?v|
zFv)2ur}4wW8P;OuEGF6ix7!%-Sa19^U{8%zsQEwMaSnxt<kM|b{0@kNgMF0b)qvHq
HW}*KBadAc=

literal 0
HcmV?d00001

diff --git a/demo/documented/cahn-hilliard/common.txt b/demo/documented/cahn-hilliard/common.txt
new file mode 100644
index 0000000..43426df
--- /dev/null
+++ b/demo/documented/cahn-hilliard/common.txt
@@ -0,0 +1,94 @@
+This example demonstrates the solution of a particular nonlinear
+time-dependent fourth-order equation, known as the Cahn-Hilliard
+equation. In particular it demonstrates the use of
+
+* The built-in Newton solver
+* Advanced use of the base class ``NonlinearProblem``
+* Automatic linearisation
+* A mixed finite element method
+* The :math:`\theta`-method for time-dependent equations
+* User-defined Expressions as Python classes
+* Form compiler options
+* Interpolation of functions
+
+
+Equation and problem definition
+-------------------------------
+
+The Cahn-Hilliard equation is a parabolic equation and is typically used
+to model phase separation in binary mixtures.  It involves first-order
+time derivatives, and second- and fourth-order spatial derivatives.
+The equation reads:
+
+.. math::
+   \frac{\partial c}{\partial t} - \nabla \cdot M \left(\nabla\left(\frac{d f}{d c}
+             - \lambda \nabla^{2}c\right)\right) &= 0 \quad {\rm in} \ \Omega, \\
+   M\left(\nabla\left(\frac{d f}{d c} - \lambda \nabla^{2}c\right)\right) &= 0 \quad {\rm on} \ \partial\Omega, \\
+   M \lambda \nabla c \cdot n &= 0 \quad {\rm on} \ \partial\Omega.
+
+where :math:`c` is the unknown field, the function :math:`f` is usually
+non-convex in :math:`c` (a fourth-order polynomial is commonly used),
+:math:`n` is the outward directed boundary normal, and :math:`M` is a
+scalar parameter.
+
+Mixed form
+^^^^^^^^^^
+
+The Cahn-Hilliard equation is a fourth-order equation, so casting it
+in a weak form would result in the presence of second-order spatial
+derivatives, and the problem could not be solved using a standard
+Lagrange finite element basis.  A solution is to rephrase the problem
+as two coupled second-order equations:
+
+.. math::
+   \frac{\partial c}{\partial t} - \nabla \cdot M \nabla\mu  &= 0 \quad {\rm in} \ \Omega, \\
+   \mu -  \frac{d f}{d c} + \lambda \nabla^{2}c &= 0 \quad {\rm in} \ \Omega.
+
+The unknown fields are now :math:`c` and :math:`\mu`. The weak
+(variational) form of the problem reads: find :math:`(c, \mu) \in V
+\times V` such that
+
+.. math::
+   \int_{\Omega} \frac{\partial c}{\partial t} q \, {\rm d} x + \int_{\Omega} M \nabla\mu \cdot \nabla q \, {\rm d} x
+          &= 0 \quad \forall \ q \in V,  \\
+   \int_{\Omega} \mu v \, {\rm d} x - \int_{\Omega} \frac{d f}{d c} v \, {\rm d} x - \int_{\Omega} \lambda \nabla c \cdot \nabla v \, {\rm d} x
+          &= 0 \quad \forall \ v \in V.
+
+Time discretisation
+^^^^^^^^^^^^^^^^^^^
+
+Before being able to solve this problem, the time derivative must be
+dealt with. Apply the :math:`\theta`-method to the mixed weak form of
+the equation:
+
+.. math::
+
+   \int_{\Omega} \frac{c_{n+1} - c_{n}}{dt} q \, {\rm d} x + \int_{\Omega} M \nabla \mu_{n+\theta} \cdot \nabla q \, {\rm d} x
+          &= 0 \quad \forall \ q \in V  \\
+   \int_{\Omega} \mu_{n+1} v  \, {\rm d} x - \int_{\Omega} \frac{d f_{n+1}}{d c} v  \, {\rm d} x - \int_{\Omega} \lambda \nabla c_{n+1} \cdot \nabla v \, {\rm d} x
+          &= 0 \quad \forall \ v \in V
+
+where :math:`dt = t_{n+1} - t_{n}`
+and :math:`\mu_{n+\theta} = (1-\theta) \mu_{n} + \theta \mu_{n+1}`.
+The task is: given :math:`c_{n}` and :math:`\mu_{n}`, solve the above
+equation to find :math:`c_{n+1}` and :math:`\mu_{n+1}`.
+
+
+Demo parameters
+^^^^^^^^^^^^^^^
+
+The following domains, functions and time stepping parameters are used
+in this demo:
+
+* :math:`\Omega = (0, 1) \times (0, 1)` (unit square)
+* :math:`f = 100 c^{2} (1-c)^{2}`
+* :math:`\lambda = 1 \times 10^{-2}`
+* :math:`M = 1`
+* :math:`dt = 5 \times 10^{-6}`
+* :math:`\theta = 0.5`
+
+With the above input the solution for :math:`c` will look as follows:
+
+.. image:: ../cahn-hilliard_c.png
+    :scale: 75
+    :align: center
diff --git a/demo/documented/cahn-hilliard/cpp/CMakeLists.txt b/demo/documented/cahn-hilliard/cpp/CMakeLists.txt
new file mode 100644
index 0000000..bd22bcd
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_cahn-hilliard)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} CahnHilliard3D.cpp CahnHilliard2D.cpp main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.cpp b/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.cpp
new file mode 100644
index 0000000..a666b2e
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.cpp
@@ -0,0 +1,4035 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "CahnHilliard2D.h"
+
+/// Constructor
+cahnhilliard2d_finite_element_0::cahnhilliard2d_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_finite_element_0::~cahnhilliard2d_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* cahnhilliard2d_finite_element_0::signature() const
+{
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+}
+
+/// Return the cell shape
+ufc::shape cahnhilliard2d_finite_element_0::cell_shape() const
+{
+    return ufc::triangle;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t cahnhilliard2d_finite_element_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t cahnhilliard2d_finite_element_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t cahnhilliard2d_finite_element_0::space_dimension() const
+{
+    return 1;
+}
+
+/// Return the rank of the value space
+std::size_t cahnhilliard2d_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t cahnhilliard2d_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void cahnhilliard2d_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+}
+
+/// Evaluate all basis functions at given point x in cell
+void cahnhilliard2d_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void cahnhilliard2d_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void cahnhilliard2d_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+}
+
+/// Evaluate linear functional for dof i on the function f
+double cahnhilliard2d_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void cahnhilliard2d_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void cahnhilliard2d_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void cahnhilliard2d_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void cahnhilliard2d_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t cahnhilliard2d_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* cahnhilliard2d_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* cahnhilliard2d_finite_element_0::create() const
+{
+    return new cahnhilliard2d_finite_element_0();
+}
+
+
+/// Constructor
+cahnhilliard2d_finite_element_1::cahnhilliard2d_finite_element_1() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_finite_element_1::~cahnhilliard2d_finite_element_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* cahnhilliard2d_finite_element_1::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+}
+
+/// Return the cell shape
+ufc::shape cahnhilliard2d_finite_element_1::cell_shape() const
+{
+    return ufc::triangle;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t cahnhilliard2d_finite_element_1::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t cahnhilliard2d_finite_element_1::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t cahnhilliard2d_finite_element_1::space_dimension() const
+{
+    return 3;
+}
+
+/// Return the rank of the value space
+std::size_t cahnhilliard2d_finite_element_1::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t cahnhilliard2d_finite_element_1::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void cahnhilliard2d_finite_element_1::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void cahnhilliard2d_finite_element_1::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void cahnhilliard2d_finite_element_1::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void cahnhilliard2d_finite_element_1::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double cahnhilliard2d_finite_element_1::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void cahnhilliard2d_finite_element_1::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void cahnhilliard2d_finite_element_1::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void cahnhilliard2d_finite_element_1::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void cahnhilliard2d_finite_element_1::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t cahnhilliard2d_finite_element_1::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* cahnhilliard2d_finite_element_1::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* cahnhilliard2d_finite_element_1::create() const
+{
+    return new cahnhilliard2d_finite_element_1();
+}
+
+
+/// Constructor
+cahnhilliard2d_finite_element_2::cahnhilliard2d_finite_element_2() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_finite_element_2::~cahnhilliard2d_finite_element_2()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* cahnhilliard2d_finite_element_2::signature() const
+{
+    return "MixedElement(FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (2,) })";
+}
+
+/// Return the cell shape
+ufc::shape cahnhilliard2d_finite_element_2::cell_shape() const
+{
+    return ufc::triangle;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t cahnhilliard2d_finite_element_2::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t cahnhilliard2d_finite_element_2::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t cahnhilliard2d_finite_element_2::space_dimension() const
+{
+    return 6;
+}
+
+/// Return the rank of the value space
+std::size_t cahnhilliard2d_finite_element_2::value_rank() const
+{
+    return 1;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t cahnhilliard2d_finite_element_2::value_dimension(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Evaluate basis function i at given point x in cell
+void cahnhilliard2d_finite_element_2::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void cahnhilliard2d_finite_element_2::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void cahnhilliard2d_finite_element_2::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void cahnhilliard2d_finite_element_2::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double cahnhilliard2d_finite_element_2::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void cahnhilliard2d_finite_element_2::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+}
+
+/// Interpolate vertex values from dof values
+void cahnhilliard2d_finite_element_2::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[3] = dof_values[4];
+    vertex_values[5] = dof_values[5];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void cahnhilliard2d_finite_element_2::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void cahnhilliard2d_finite_element_2::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t cahnhilliard2d_finite_element_2::num_sub_elements() const
+{
+    return 2;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* cahnhilliard2d_finite_element_2::create_sub_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard2d_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard2d_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* cahnhilliard2d_finite_element_2::create() const
+{
+    return new cahnhilliard2d_finite_element_2();
+}
+
+/// Constructor
+cahnhilliard2d_dofmap_0::cahnhilliard2d_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_dofmap_0::~cahnhilliard2d_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* cahnhilliard2d_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool cahnhilliard2d_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t cahnhilliard2d_dofmap_0::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t cahnhilliard2d_dofmap_0::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t cahnhilliard2d_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return 1;
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t cahnhilliard2d_dofmap_0::local_dimension() const
+{
+    return 1;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t cahnhilliard2d_dofmap_0::num_facet_dofs() const
+{
+    return 0;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t cahnhilliard2d_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void cahnhilliard2d_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    dofs[0] = 0;
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void cahnhilliard2d_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void cahnhilliard2d_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void cahnhilliard2d_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t cahnhilliard2d_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* cahnhilliard2d_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* cahnhilliard2d_dofmap_0::create() const
+{
+    return new cahnhilliard2d_dofmap_0();
+}
+
+/// Constructor
+cahnhilliard2d_dofmap_1::cahnhilliard2d_dofmap_1() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_dofmap_1::~cahnhilliard2d_dofmap_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* cahnhilliard2d_dofmap_1::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool cahnhilliard2d_dofmap_1::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t cahnhilliard2d_dofmap_1::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t cahnhilliard2d_dofmap_1::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t cahnhilliard2d_dofmap_1::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t cahnhilliard2d_dofmap_1::local_dimension() const
+{
+    return 3;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t cahnhilliard2d_dofmap_1::num_facet_dofs() const
+{
+    return 2;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t cahnhilliard2d_dofmap_1::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void cahnhilliard2d_dofmap_1::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void cahnhilliard2d_dofmap_1::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void cahnhilliard2d_dofmap_1::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void cahnhilliard2d_dofmap_1::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t cahnhilliard2d_dofmap_1::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* cahnhilliard2d_dofmap_1::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* cahnhilliard2d_dofmap_1::create() const
+{
+    return new cahnhilliard2d_dofmap_1();
+}
+
+/// Constructor
+cahnhilliard2d_dofmap_2::cahnhilliard2d_dofmap_2() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_dofmap_2::~cahnhilliard2d_dofmap_2()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* cahnhilliard2d_dofmap_2::signature() const
+{
+    return "FFC dofmap for MixedElement(FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (2,) })";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool cahnhilliard2d_dofmap_2::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t cahnhilliard2d_dofmap_2::topological_dimension() const
+{
+    return 2;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t cahnhilliard2d_dofmap_2::geometric_dimension() const
+{
+    return 2;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t cahnhilliard2d_dofmap_2::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return 2*num_global_entities[0];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t cahnhilliard2d_dofmap_2::local_dimension() const
+{
+    return 6;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t cahnhilliard2d_dofmap_2::num_facet_dofs() const
+{
+    return 4;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t cahnhilliard2d_dofmap_2::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void cahnhilliard2d_dofmap_2::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void cahnhilliard2d_dofmap_2::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void cahnhilliard2d_dofmap_2::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void cahnhilliard2d_dofmap_2::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t cahnhilliard2d_dofmap_2::num_sub_dofmaps() const
+{
+    return 2;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* cahnhilliard2d_dofmap_2::create_sub_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard2d_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard2d_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* cahnhilliard2d_dofmap_2::create() const
+{
+    return new cahnhilliard2d_dofmap_2();
+}
+
+/// Constructor
+cahnhilliard2d_cell_integral_0_otherwise::cahnhilliard2d_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_cell_integral_0_otherwise::~cahnhilliard2d_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & cahnhilliard2d_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true, true, true, true, true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void cahnhilliard2d_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W6[6] = {0.054975871827661, 0.054975871827661, 0.054975871827661, 0.111690794839005, 0.111690794839005, 0.111690794839005};
+    // Quadrature points on the UFC reference element: (0.816847572980459, 0.091576213509771), (0.091576213509771, 0.816847572980459), (0.091576213509771, 0.091576213509771), (0.10810301816807, 0.445948490915965), (0.445948490915965, 0.10810301816807), (0.445948490915965, 0.445948490915965)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[6][3] = \
+    {{0.09157621350977, 0.816847572980459, 0.091576213509771},
+    {0.0915762135097701, 0.0915762135097711, 0.816847572980459},
+    {0.816847572980458, 0.091576213509771, 0.091576213509771},
+    {0.445948490915965, 0.10810301816807, 0.445948490915965},
+    {0.445948490915965, 0.445948490915965, 0.10810301816807},
+    {0.10810301816807, 0.445948490915965, 0.445948490915965}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[3] = {0, 1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[3] = {3, 4, 5};
+    
+    static const double FE0_C0_D01[6][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {3, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 63.
+    double G[12];
+    G[0] = det*w[3][0]*w[4][0]*(K[0]*K[2] + K[1]*K[3]);
+    G[1] = det*w[3][0]*w[4][0]*(K[2]*K[2] + K[3]*K[3]);
+    G[2] = det*w[3][0]*(K[0]*K[2]*(1.0 - w[4][0]) + K[1]*K[3]*(1.0 - w[4][0]));
+    G[3] = det*w[3][0]*(K[2]*K[2]*(1.0 - w[4][0]) + K[3]*K[3]*(1.0 - w[4][0]));
+    G[4] = det*w[3][0]*w[4][0]*(K[0]*K[0] + K[1]*K[1]);
+    G[5] = det*w[3][0]*(K[0]*K[0]*(1.0 - w[4][0]) + K[1]*K[1]*(1.0 - w[4][0]));
+    G[6] =  - det*w[2][0]*(K[0]*K[2] + K[1]*K[3]);
+    G[7] =  - det*w[2][0]*(K[2]*K[2] + K[3]*K[3]);
+    G[8] =  - det*w[2][0]*(K[0]*K[0] + K[1]*K[1]);
+    G[9] = -400.0*det;
+    G[10] = 600.0*det;
+    G[11] = -200.0*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 630
+    for (unsigned int ip = 0; ip < 6; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      
+      // Total number of operations to compute function values = 24
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F2 += FE0_C0_D01[ip][r]*w[0][nzc2[r]];
+        F3 += FE0_C0_D01[ip][r]*w[0][nzc1[r]];
+        F5 += FE0_C0_D01[ip][r]*w[0][nzc5[r]];
+        F6 += FE0_C0_D01[ip][r]*w[0][nzc4[r]];
+        F7 += FE0_C0_D01[ip][r]*w[1][nzc5[r]];
+        F8 += FE0_C0_D01[ip][r]*w[1][nzc4[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 18
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F0 += FE0_C0[ip][r]*w[0][nzc0[r]];
+        F1 += FE0_C0[ip][r]*w[1][nzc0[r]];
+        F4 += FE0_C0[ip][r]*w[0][nzc3[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 35
+      double I[6];
+      // Number of operations: 8
+      I[0] = W6[ip]*(F5*G[0] + F6*G[1] + F7*G[2] + F8*G[3]);
+      
+      // Number of operations: 8
+      I[1] = W6[ip]*(F5*G[4] + F6*G[0] + F7*G[5] + F8*G[2]);
+      
+      // Number of operations: 4
+      I[2] = W6[ip]*(F2*G[6] + F3*G[7]);
+      
+      // Number of operations: 4
+      I[3] = W6[ip]*(F2*G[8] + F3*G[6]);
+      
+      // Number of operations: 3
+      I[4] = W6[ip]*det*(F0 - F1);
+      
+      // Number of operations: 8
+      I[5] = W6[ip]*(F0*(G[11] + F0*(G[10] + F0*G[9])) + F4*det);
+      
+      
+      // Number of operations for primary indices: 12
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc0[j]] += FE0_C0[ip][j]*I[4];
+        // Number of operations to compute entry: 2
+        A[nzc3[j]] += FE0_C0[ip][j]*I[5];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 16
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc1[j]] += FE0_C0_D01[ip][j]*I[0];
+        // Number of operations to compute entry: 2
+        A[nzc2[j]] += FE0_C0_D01[ip][j]*I[1];
+        // Number of operations to compute entry: 2
+        A[nzc4[j]] += FE0_C0_D01[ip][j]*I[2];
+        // Number of operations to compute entry: 2
+        A[nzc5[j]] += FE0_C0_D01[ip][j]*I[3];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+}
+
+/// Constructor
+cahnhilliard2d_cell_integral_1_otherwise::cahnhilliard2d_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_cell_integral_1_otherwise::~cahnhilliard2d_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & cahnhilliard2d_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true, true, true, true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void cahnhilliard2d_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W6[6] = {0.054975871827661, 0.054975871827661, 0.054975871827661, 0.111690794839005, 0.111690794839005, 0.111690794839005};
+    // Quadrature points on the UFC reference element: (0.816847572980459, 0.091576213509771), (0.091576213509771, 0.816847572980459), (0.091576213509771, 0.091576213509771), (0.10810301816807, 0.445948490915965), (0.445948490915965, 0.10810301816807), (0.445948490915965, 0.445948490915965)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[6][3] = \
+    {{0.09157621350977, 0.816847572980459, 0.091576213509771},
+    {0.0915762135097701, 0.0915762135097711, 0.816847572980459},
+    {0.816847572980458, 0.091576213509771, 0.091576213509771},
+    {0.445948490915965, 0.10810301816807, 0.445948490915965},
+    {0.445948490915965, 0.445948490915965, 0.10810301816807},
+    {0.10810301816807, 0.445948490915965, 0.445948490915965}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[3] = {0, 1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[3] = {3, 4, 5};
+    
+    static const double FE0_C0_D01[6][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {3, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 36.
+    double G[9];
+    G[0] = det*w[2][0]*w[3][0]*(K[2]*K[2] + K[3]*K[3]);
+    G[1] = det*w[2][0]*w[3][0]*(K[0]*K[2] + K[1]*K[3]);
+    G[2] = det*w[2][0]*w[3][0]*(K[0]*K[0] + K[1]*K[1]);
+    G[3] =  - det*w[1][0]*(K[2]*K[2] + K[3]*K[3]);
+    G[4] =  - det*w[1][0]*(K[0]*K[2] + K[1]*K[3]);
+    G[5] =  - det*w[1][0]*(K[0]*K[0] + K[1]*K[1]);
+    G[6] = -200.0*det;
+    G[7] = -1200.0*det;
+    G[8] = 1200.0*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 1170
+    for (unsigned int ip = 0; ip < 6; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F0 += FE0_C0[ip][r]*w[0][nzc0[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 12
+      double I[8];
+      // Number of operations: 1
+      I[0] = G[0]*W6[ip];
+      
+      // Number of operations: 1
+      I[1] = G[1]*W6[ip];
+      
+      // Number of operations: 1
+      I[2] = G[2]*W6[ip];
+      
+      // Number of operations: 1
+      I[3] = G[3]*W6[ip];
+      
+      // Number of operations: 1
+      I[4] = G[4]*W6[ip];
+      
+      // Number of operations: 1
+      I[5] = G[5]*W6[ip];
+      
+      // Number of operations: 1
+      I[6] = W6[ip]*det;
+      
+      // Number of operations: 5
+      I[7] = W6[ip]*(G[6] + F0*(G[8] + F0*G[7]));
+      
+      
+      // Number of operations for primary indices: 81
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        for (unsigned int k = 0; k < 3; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*6 + nzc0[k]] += FE0_C0[ip][j]*FE0_C0[ip][k]*I[6];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*6 + nzc0[k]] += FE0_C0[ip][j]*FE0_C0[ip][k]*I[7];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*6 + nzc3[k]] += FE0_C0[ip][j]*FE0_C0[ip][k]*I[6];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 96
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc4[k]] += FE0_C0_D01[ip][j]*FE0_C0_D01[ip][k]*I[0];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc5[k]] += FE0_C0_D01[ip][j]*FE0_C0_D01[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc4[k]] += FE0_C0_D01[ip][j]*FE0_C0_D01[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc5[k]] += FE0_C0_D01[ip][j]*FE0_C0_D01[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc1[k]] += FE0_C0_D01[ip][j]*FE0_C0_D01[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc2[k]] += FE0_C0_D01[ip][j]*FE0_C0_D01[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc1[k]] += FE0_C0_D01[ip][j]*FE0_C0_D01[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc2[k]] += FE0_C0_D01[ip][j]*FE0_C0_D01[ip][k]*I[5];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+}
+
+/// Constructor
+cahnhilliard2d_form_0::cahnhilliard2d_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_form_0::~cahnhilliard2d_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* cahnhilliard2d_form_0::signature() const
+{
+    return "c74b554236827dccfd2825aa887e17b01515e34428bdff3307381fce835c17d14cf4f8ee3b4150a5a38c0ab55204ed828532d603e46019fbe24a6ef0f51b9924";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t cahnhilliard2d_form_0::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t cahnhilliard2d_form_0::num_coefficients() const
+{
+    return 5;
+}
+
+/// Return the number of cell domains
+std::size_t cahnhilliard2d_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t cahnhilliard2d_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t cahnhilliard2d_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t cahnhilliard2d_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t cahnhilliard2d_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool cahnhilliard2d_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool cahnhilliard2d_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool cahnhilliard2d_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool cahnhilliard2d_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool cahnhilliard2d_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* cahnhilliard2d_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard2d_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard2d_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new cahnhilliard2d_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new cahnhilliard2d_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new cahnhilliard2d_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new cahnhilliard2d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* cahnhilliard2d_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard2d_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard2d_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new cahnhilliard2d_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new cahnhilliard2d_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new cahnhilliard2d_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new cahnhilliard2d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* cahnhilliard2d_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* cahnhilliard2d_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* cahnhilliard2d_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* cahnhilliard2d_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* cahnhilliard2d_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* cahnhilliard2d_form_0::create_default_cell_integral() const
+{
+    return new cahnhilliard2d_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* cahnhilliard2d_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* cahnhilliard2d_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* cahnhilliard2d_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* cahnhilliard2d_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+cahnhilliard2d_form_1::cahnhilliard2d_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard2d_form_1::~cahnhilliard2d_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* cahnhilliard2d_form_1::signature() const
+{
+    return "4c74bcfa5e3b9a51f25018de399e3a7993f07f9007028d72eb8d754dfad68a3aee31c76c343017ba49b2bd9aef525ccab3f3c0eb05bfd0c870a1f2344e00028d";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t cahnhilliard2d_form_1::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t cahnhilliard2d_form_1::num_coefficients() const
+{
+    return 4;
+}
+
+/// Return the number of cell domains
+std::size_t cahnhilliard2d_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t cahnhilliard2d_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t cahnhilliard2d_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t cahnhilliard2d_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t cahnhilliard2d_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool cahnhilliard2d_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool cahnhilliard2d_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool cahnhilliard2d_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool cahnhilliard2d_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool cahnhilliard2d_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* cahnhilliard2d_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard2d_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard2d_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new cahnhilliard2d_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new cahnhilliard2d_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new cahnhilliard2d_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new cahnhilliard2d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* cahnhilliard2d_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard2d_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard2d_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new cahnhilliard2d_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new cahnhilliard2d_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new cahnhilliard2d_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new cahnhilliard2d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* cahnhilliard2d_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* cahnhilliard2d_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* cahnhilliard2d_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* cahnhilliard2d_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* cahnhilliard2d_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* cahnhilliard2d_form_1::create_default_cell_integral() const
+{
+    return new cahnhilliard2d_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* cahnhilliard2d_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* cahnhilliard2d_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* cahnhilliard2d_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* cahnhilliard2d_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.h b/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.h
new file mode 100644
index 0000000..5e60721
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.h
@@ -0,0 +1,1842 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __CAHNHILLIARD2D_H
+#define __CAHNHILLIARD2D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class cahnhilliard2d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_finite_element_0();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a finite element.
+
+class cahnhilliard2d_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_finite_element_1();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_finite_element_1();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a finite element.
+
+class cahnhilliard2d_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_finite_element_2();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_finite_element_2();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class cahnhilliard2d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_dofmap_0();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class cahnhilliard2d_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_dofmap_1();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_dofmap_1();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class cahnhilliard2d_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_dofmap_2();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_dofmap_2();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class cahnhilliard2d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class cahnhilliard2d_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class cahnhilliard2d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_form_0();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class cahnhilliard2d_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  cahnhilliard2d_form_1();
+
+  /// Destructor
+  virtual ~cahnhilliard2d_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace CahnHilliard2D
+{
+
+class CoefficientSpace_dt: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_dt(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_dt(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_dt(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_dt()
+  {
+  }
+
+};
+
+class CoefficientSpace_lmbda: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_lmbda()
+  {
+  }
+
+};
+
+class CoefficientSpace_theta: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_theta(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_theta(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_theta(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_theta(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_theta(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_theta(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_theta()
+  {
+  }
+
+};
+
+class CoefficientSpace_u: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u()
+  {
+  }
+
+};
+
+class CoefficientSpace_u0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u0()
+  {
+  }
+
+};
+
+class Form_F_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_F_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_F_FunctionSpace_1;
+
+typedef CoefficientSpace_u0 Form_F_FunctionSpace_2;
+
+typedef CoefficientSpace_lmbda Form_F_FunctionSpace_3;
+
+typedef CoefficientSpace_dt Form_F_FunctionSpace_4;
+
+typedef CoefficientSpace_theta Form_F_FunctionSpace_5;
+
+class Form_F: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& dt, const dolfin::GenericFunction& theta):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = u;
+    this->u0 = u0;
+    this->lmbda = lmbda;
+    this->dt = dt;
+    this->theta = theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> dt, std::shared_ptr<const dolfin::GenericFunction> theta):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = *u;
+    this->u0 = *u0;
+    this->lmbda = *lmbda;
+    this->dt = *dt;
+    this->theta = *theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& dt, const dolfin::GenericFunction& theta):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = u;
+    this->u0 = u0;
+    this->lmbda = lmbda;
+    this->dt = dt;
+    this->theta = theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> dt, std::shared_ptr<const dolfin::GenericFunction> theta):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = *u;
+    this->u0 = *u0;
+    this->lmbda = *lmbda;
+    this->dt = *dt;
+    this->theta = *theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_0());
+  }
+
+  // Destructor
+  ~Form_F()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "u0")
+      return 1;
+    else if (name == "lmbda")
+      return 2;
+    else if (name == "dt")
+      return 3;
+    else if (name == "theta")
+      return 4;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "u0";
+    case 2:
+      return "lmbda";
+    case 3:
+      return "dt";
+    case 4:
+      return "theta";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_F_FunctionSpace_0 TestSpace;
+  typedef Form_F_FunctionSpace_1 CoefficientSpace_u;
+  typedef Form_F_FunctionSpace_2 CoefficientSpace_u0;
+  typedef Form_F_FunctionSpace_3 CoefficientSpace_lmbda;
+  typedef Form_F_FunctionSpace_4 CoefficientSpace_dt;
+  typedef Form_F_FunctionSpace_5 CoefficientSpace_theta;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner u0;
+  dolfin::CoefficientAssigner lmbda;
+  dolfin::CoefficientAssigner dt;
+  dolfin::CoefficientAssigner theta;
+};
+
+class Form_J_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_J_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard2d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard2d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_J_FunctionSpace_2;
+
+typedef CoefficientSpace_lmbda Form_J_FunctionSpace_3;
+
+typedef CoefficientSpace_dt Form_J_FunctionSpace_4;
+
+typedef CoefficientSpace_theta Form_J_FunctionSpace_5;
+
+class Form_J: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& dt, const dolfin::GenericFunction& theta):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = u;
+    this->lmbda = lmbda;
+    this->dt = dt;
+    this->theta = theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> dt, std::shared_ptr<const dolfin::GenericFunction> theta):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = *u;
+    this->lmbda = *lmbda;
+    this->dt = *dt;
+    this->theta = *theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& dt, const dolfin::GenericFunction& theta):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = u;
+    this->lmbda = lmbda;
+    this->dt = dt;
+    this->theta = theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> dt, std::shared_ptr<const dolfin::GenericFunction> theta):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = *u;
+    this->lmbda = *lmbda;
+    this->dt = *dt;
+    this->theta = *theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard2d_form_1());
+  }
+
+  // Destructor
+  ~Form_J()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "lmbda")
+      return 1;
+    else if (name == "dt")
+      return 2;
+    else if (name == "theta")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "lmbda";
+    case 2:
+      return "dt";
+    case 3:
+      return "theta";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_J_FunctionSpace_0 TestSpace;
+  typedef Form_J_FunctionSpace_1 TrialSpace;
+  typedef Form_J_FunctionSpace_2 CoefficientSpace_u;
+  typedef Form_J_FunctionSpace_3 CoefficientSpace_lmbda;
+  typedef Form_J_FunctionSpace_4 CoefficientSpace_dt;
+  typedef Form_J_FunctionSpace_5 CoefficientSpace_theta;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner lmbda;
+  dolfin::CoefficientAssigner dt;
+  dolfin::CoefficientAssigner theta;
+};
+
+// Class typedefs
+typedef Form_J BilinearForm;
+typedef Form_J JacobianForm;
+typedef Form_F LinearForm;
+typedef Form_F ResidualForm;
+typedef Form_F::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.ufl b/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.ufl
new file mode 100644
index 0000000..939a7af
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/CahnHilliard2D.ufl
@@ -0,0 +1,58 @@
+# Copyright (C) 2006-2010 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2006
+# Last changed: 2010-09-01
+#
+# The linearised bilinear form a(du, v) and linear form L(v) for
+# the Cahn-Hilliard equation.
+#
+# Compile this form with FFC: ffc -l dolfin -O -f split CahnHilliard2D.ufl
+
+P1 = FiniteElement("Lagrange", triangle, 1)
+ME = P1*P1
+
+du   = TrialFunction(ME)
+q, v = TestFunctions(ME)
+
+u   = Coefficient(ME)  # current solution
+u0  = Coefficient(ME)  # solution from previous converged step
+
+# Split mixed functions
+dc, dmu = split(du)
+c,  mu  = split(u)
+c0, mu0 = split(u0)
+
+lmbda = Constant(triangle) # surface energy parameter
+dt    = Constant(triangle) # time step
+theta = Constant(triangle) # time stepping parameter
+
+# mu_(n+theta)
+mu_mid = (1-theta)*mu0 + theta*mu
+
+# Compute the chemical potential df/dc
+c    = variable(c)
+f    = 100*c**2*(1-c)**2
+dfdc = diff(f, c)
+
+F0 = c*q*dx  - c0*q*dx   + dt*dot(grad(mu_mid), grad(q))*dx
+F1 = mu*v*dx - dfdc*v*dx - lmbda*dot(grad(c), grad(v))*dx
+F  = F0 + F1
+
+J = derivative(F, u, du)
diff --git a/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.cpp b/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.cpp
new file mode 100644
index 0000000..3cf5634
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.cpp
@@ -0,0 +1,5195 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#include "CahnHilliard3D.h"
+
+/// Constructor
+cahnhilliard3d_finite_element_0::cahnhilliard3d_finite_element_0() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_finite_element_0::~cahnhilliard3d_finite_element_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* cahnhilliard3d_finite_element_0::signature() const
+{
+    return "FiniteElement('Real', Domain(Cell('tetrahedron', 3)), 0, None)";
+}
+
+/// Return the cell shape
+ufc::shape cahnhilliard3d_finite_element_0::cell_shape() const
+{
+    return ufc::tetrahedron;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t cahnhilliard3d_finite_element_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t cahnhilliard3d_finite_element_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t cahnhilliard3d_finite_element_0::space_dimension() const
+{
+    return 1;
+}
+
+/// Return the rank of the value space
+std::size_t cahnhilliard3d_finite_element_0::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t cahnhilliard3d_finite_element_0::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void cahnhilliard3d_finite_element_0::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Compute subdeterminants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+}
+
+/// Evaluate all basis functions at given point x in cell
+void cahnhilliard3d_finite_element_0::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void cahnhilliard3d_finite_element_0::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void cahnhilliard3d_finite_element_0::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+}
+
+/// Evaluate linear functional for dof i on the function f
+double cahnhilliard3d_finite_element_0::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void cahnhilliard3d_finite_element_0::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void cahnhilliard3d_finite_element_0::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+    vertex_values[3] = dof_values[0];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void cahnhilliard3d_finite_element_0::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void cahnhilliard3d_finite_element_0::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t cahnhilliard3d_finite_element_0::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* cahnhilliard3d_finite_element_0::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* cahnhilliard3d_finite_element_0::create() const
+{
+    return new cahnhilliard3d_finite_element_0();
+}
+
+
+/// Constructor
+cahnhilliard3d_finite_element_1::cahnhilliard3d_finite_element_1() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_finite_element_1::~cahnhilliard3d_finite_element_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* cahnhilliard3d_finite_element_1::signature() const
+{
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+}
+
+/// Return the cell shape
+ufc::shape cahnhilliard3d_finite_element_1::cell_shape() const
+{
+    return ufc::tetrahedron;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t cahnhilliard3d_finite_element_1::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t cahnhilliard3d_finite_element_1::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t cahnhilliard3d_finite_element_1::space_dimension() const
+{
+    return 4;
+}
+
+/// Return the rank of the value space
+std::size_t cahnhilliard3d_finite_element_1::value_rank() const
+{
+    return 0;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t cahnhilliard3d_finite_element_1::value_dimension(std::size_t i) const
+{
+    return 1;
+}
+
+/// Evaluate basis function i at given point x in cell
+void cahnhilliard3d_finite_element_1::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void cahnhilliard3d_finite_element_1::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void cahnhilliard3d_finite_element_1::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void cahnhilliard3d_finite_element_1::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double cahnhilliard3d_finite_element_1::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void cahnhilliard3d_finite_element_1::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+}
+
+/// Interpolate vertex values from dof values
+void cahnhilliard3d_finite_element_1::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void cahnhilliard3d_finite_element_1::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void cahnhilliard3d_finite_element_1::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t cahnhilliard3d_finite_element_1::num_sub_elements() const
+{
+    return 0;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* cahnhilliard3d_finite_element_1::create_sub_element(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* cahnhilliard3d_finite_element_1::create() const
+{
+    return new cahnhilliard3d_finite_element_1();
+}
+
+
+/// Constructor
+cahnhilliard3d_finite_element_2::cahnhilliard3d_finite_element_2() : ufc::finite_element()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_finite_element_2::~cahnhilliard3d_finite_element_2()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the finite element
+const char* cahnhilliard3d_finite_element_2::signature() const
+{
+    return "MixedElement(FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None), FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None), **{'value_shape': (2,) })";
+}
+
+/// Return the cell shape
+ufc::shape cahnhilliard3d_finite_element_2::cell_shape() const
+{
+    return ufc::tetrahedron;
+}
+
+/// Return the topological dimension of the cell shape
+std::size_t cahnhilliard3d_finite_element_2::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the cell shape
+std::size_t cahnhilliard3d_finite_element_2::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the finite element function space
+std::size_t cahnhilliard3d_finite_element_2::space_dimension() const
+{
+    return 8;
+}
+
+/// Return the rank of the value space
+std::size_t cahnhilliard3d_finite_element_2::value_rank() const
+{
+    return 1;
+}
+
+/// Return the dimension of the value space for axis i
+std::size_t cahnhilliard3d_finite_element_2::value_dimension(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Evaluate basis function i at given point x in cell
+void cahnhilliard3d_finite_element_2::_evaluate_basis(std::size_t i,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation)
+{
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate all basis functions at given point x in cell
+void cahnhilliard3d_finite_element_2::_evaluate_basis_all(double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation)
+{
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate order n derivatives of basis function i at given point x in cell
+void cahnhilliard3d_finite_element_2::_evaluate_basis_derivatives(std::size_t i,
+                                                std::size_t n,
+                                                double* values,
+                                                const double* x,
+                                                const double* vertex_coordinates,
+                                                int cell_orientation)
+{
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+}
+
+/// Evaluate order n derivatives of all basis functions at given point x in cell
+void cahnhilliard3d_finite_element_2::_evaluate_basis_derivatives_all(std::size_t n,
+                                                    double* values,
+                                                    const double* x,
+                                                    const double* vertex_coordinates,
+                                                    int cell_orientation)
+{
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[6];
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+}
+
+/// Evaluate linear functional for dof i on the function f
+double cahnhilliard3d_finite_element_2::evaluate_dof(std::size_t i,
+                                   const ufc::function& f,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+}
+
+/// Evaluate linear functionals for all dofs on the function f
+void cahnhilliard3d_finite_element_2::evaluate_dofs(double* values,
+                                  const ufc::function& f,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation,
+                                  const ufc::cell& c) const
+{
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+}
+
+/// Interpolate vertex values from dof values
+void cahnhilliard3d_finite_element_2::interpolate_vertex_values(double* vertex_values,
+                                              const double* dof_values,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation,
+                                              const ufc::cell& c) const
+{
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    vertex_values[6] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[4];
+    vertex_values[3] = dof_values[5];
+    vertex_values[5] = dof_values[6];
+    vertex_values[7] = dof_values[7];
+}
+
+/// Map coordinate xhat from reference cell to coordinate x in cell
+void cahnhilliard3d_finite_element_2::map_from_reference_cell(double* x,
+                                            const double* xhat,
+                                            const ufc::cell& c) const
+{
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+}
+
+/// Map from coordinate x in cell to coordinate xhat in reference cell
+void cahnhilliard3d_finite_element_2::map_to_reference_cell(double* xhat,
+                                          const double* x,
+                                          const ufc::cell& c) const
+{
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+}
+
+/// Return the number of sub elements (for a mixed element)
+std::size_t cahnhilliard3d_finite_element_2::num_sub_elements() const
+{
+    return 2;
+}
+
+/// Create a new finite element for sub element i (for a mixed element)
+ufc::finite_element* cahnhilliard3d_finite_element_2::create_sub_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard3d_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard3d_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new class instance
+ufc::finite_element* cahnhilliard3d_finite_element_2::create() const
+{
+    return new cahnhilliard3d_finite_element_2();
+}
+
+/// Constructor
+cahnhilliard3d_dofmap_0::cahnhilliard3d_dofmap_0() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_dofmap_0::~cahnhilliard3d_dofmap_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* cahnhilliard3d_dofmap_0::signature() const
+{
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('tetrahedron', 3)), 0, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool cahnhilliard3d_dofmap_0::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t cahnhilliard3d_dofmap_0::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t cahnhilliard3d_dofmap_0::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t cahnhilliard3d_dofmap_0::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return 1;
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t cahnhilliard3d_dofmap_0::local_dimension() const
+{
+    return 1;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t cahnhilliard3d_dofmap_0::num_facet_dofs() const
+{
+    return 0;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t cahnhilliard3d_dofmap_0::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void cahnhilliard3d_dofmap_0::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    dofs[0] = 0;
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void cahnhilliard3d_dofmap_0::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void cahnhilliard3d_dofmap_0::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void cahnhilliard3d_dofmap_0::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t cahnhilliard3d_dofmap_0::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* cahnhilliard3d_dofmap_0::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* cahnhilliard3d_dofmap_0::create() const
+{
+    return new cahnhilliard3d_dofmap_0();
+}
+
+/// Constructor
+cahnhilliard3d_dofmap_1::cahnhilliard3d_dofmap_1() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_dofmap_1::~cahnhilliard3d_dofmap_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* cahnhilliard3d_dofmap_1::signature() const
+{
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool cahnhilliard3d_dofmap_1::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t cahnhilliard3d_dofmap_1::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t cahnhilliard3d_dofmap_1::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t cahnhilliard3d_dofmap_1::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return num_global_entities[0];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t cahnhilliard3d_dofmap_1::local_dimension() const
+{
+    return 4;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t cahnhilliard3d_dofmap_1::num_facet_dofs() const
+{
+    return 3;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t cahnhilliard3d_dofmap_1::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void cahnhilliard3d_dofmap_1::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void cahnhilliard3d_dofmap_1::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void cahnhilliard3d_dofmap_1::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void cahnhilliard3d_dofmap_1::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t cahnhilliard3d_dofmap_1::num_sub_dofmaps() const
+{
+    return 0;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* cahnhilliard3d_dofmap_1::create_sub_dofmap(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* cahnhilliard3d_dofmap_1::create() const
+{
+    return new cahnhilliard3d_dofmap_1();
+}
+
+/// Constructor
+cahnhilliard3d_dofmap_2::cahnhilliard3d_dofmap_2() : ufc::dofmap()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_dofmap_2::~cahnhilliard3d_dofmap_2()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the dofmap
+const char* cahnhilliard3d_dofmap_2::signature() const
+{
+    return "FFC dofmap for MixedElement(FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None), FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None), **{'value_shape': (2,) })";
+}
+
+/// Return true iff mesh entities of topological dimension d are needed
+bool cahnhilliard3d_dofmap_2::needs_mesh_entities(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+}
+
+/// Return the topological dimension of the associated cell shape
+std::size_t cahnhilliard3d_dofmap_2::topological_dimension() const
+{
+    return 3;
+}
+
+/// Return the geometric dimension of the associated cell shape
+std::size_t cahnhilliard3d_dofmap_2::geometric_dimension() const
+{
+    return 3;
+}
+
+/// Return the dimension of the global finite element function space
+std::size_t cahnhilliard3d_dofmap_2::global_dimension(const std::vector<std::size_t>&
+                                            num_global_entities) const
+{
+    return 2*num_global_entities[0];
+}
+
+/// Return the dimension of the local finite element function space for a cell
+std::size_t cahnhilliard3d_dofmap_2::local_dimension() const
+{
+    return 8;
+}
+
+/// Return the number of dofs on each cell facet
+std::size_t cahnhilliard3d_dofmap_2::num_facet_dofs() const
+{
+    return 6;
+}
+
+/// Return the number of dofs associated with each cell entity of dimension d
+std::size_t cahnhilliard3d_dofmap_2::num_entity_dofs(std::size_t d) const
+{
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Tabulate the local-to-global mapping of dofs on a cell
+void cahnhilliard3d_dofmap_2::tabulate_dofs(std::size_t* dofs,
+                                  const std::vector<std::size_t>& num_global_entities,
+                                  const ufc::cell& c) const
+{
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[0][0];
+    dofs[5] = offset + c.entity_indices[0][1];
+    dofs[6] = offset + c.entity_indices[0][2];
+    dofs[7] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+}
+
+/// Tabulate the local-to-local mapping from facet dofs to cell dofs
+void cahnhilliard3d_dofmap_2::tabulate_facet_dofs(std::size_t* dofs,
+                                        std::size_t facet) const
+{
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 7;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 7;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the local-to-local mapping of dofs on entity (d, i)
+void cahnhilliard3d_dofmap_2::tabulate_entity_dofs(std::size_t* dofs,
+                                  std::size_t d, std::size_t i) const
+{
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 5;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 6;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 7;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+}
+
+/// Tabulate the coordinates of all dofs on a cell
+void cahnhilliard3d_dofmap_2::tabulate_coordinates(double** dof_coordinates,
+                                         const double* vertex_coordinates) const
+{
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = vertex_coordinates[0];
+    dof_coordinates[4][1] = vertex_coordinates[1];
+    dof_coordinates[4][2] = vertex_coordinates[2];
+    dof_coordinates[5][0] = vertex_coordinates[3];
+    dof_coordinates[5][1] = vertex_coordinates[4];
+    dof_coordinates[5][2] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[6];
+    dof_coordinates[6][1] = vertex_coordinates[7];
+    dof_coordinates[6][2] = vertex_coordinates[8];
+    dof_coordinates[7][0] = vertex_coordinates[9];
+    dof_coordinates[7][1] = vertex_coordinates[10];
+    dof_coordinates[7][2] = vertex_coordinates[11];
+}
+
+/// Return the number of sub dofmaps (for a mixed element)
+std::size_t cahnhilliard3d_dofmap_2::num_sub_dofmaps() const
+{
+    return 2;
+}
+
+/// Create a new dofmap for sub dofmap i (for a mixed element)
+ufc::dofmap* cahnhilliard3d_dofmap_2::create_sub_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard3d_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard3d_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new class instance
+ufc::dofmap* cahnhilliard3d_dofmap_2::create() const
+{
+    return new cahnhilliard3d_dofmap_2();
+}
+
+/// Constructor
+cahnhilliard3d_cell_integral_0_otherwise::cahnhilliard3d_cell_integral_0_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_cell_integral_0_otherwise::~cahnhilliard3d_cell_integral_0_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & cahnhilliard3d_cell_integral_0_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true, true, true, true, true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void cahnhilliard3d_cell_integral_0_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W14[14] = {0.00317460317460317, 0.00317460317460317, 0.00317460317460317, 0.00317460317460317, 0.00317460317460317, 0.00317460317460317, 0.0147649707904968, 0.0147649707904968, 0.0147649707904968, 0.0147649707904968, 0.0221397911142651, 0.0221397911142651, 0.0221397911142651, 0.0221397911142651};
+    // Quadrature points on the UFC reference element: (0.0, 0.5, 0.5), (0.5, 0.0, 0.5), (0.5, 0.5, 0.0), (0.5, 0.0, 0.0), (0.0, 0.5, 0.0), (0.0, 0.0, 0.5), (0.698419704324387, 0.100526765225204, 0.100526765225204), (0.100526765225204, 0.100526765225204, 0.100526765225204), (0.100526765225204, 0.100526765225204, 0.698419704324387), (0.100526765225204, 0.698419704324387, 0.100526765225204), (0.0568813795204234, 0.314372873493192, 0.314372873493192), (0.314372873493192, 0.314372873493192, 0.314372873493192), (0.314372873493192, 0.314372873493192, 0.0568813795204234), (0.314372873493192, 0.0568813795204234, 0.314372873493192)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[14][4] = \
+    {{0.0, 0.0, 0.5, 0.5},
+    {0.0, 0.5, 0.0, 0.5},
+    {0.0, 0.5, 0.5, 0.0},
+    {0.5, 0.5, 0.0, 0.0},
+    {0.5, 0.0, 0.5, 0.0},
+    {0.5, 0.0, 0.0, 0.5},
+    {0.100526765225205, 0.698419704324386, 0.100526765225205, 0.100526765225205},
+    {0.698419704324387, 0.100526765225204, 0.100526765225205, 0.100526765225205},
+    {0.100526765225205, 0.100526765225204, 0.100526765225205, 0.698419704324386},
+    {0.100526765225205, 0.100526765225204, 0.698419704324386, 0.100526765225205},
+    {0.314372873493192, 0.0568813795204234, 0.314372873493192, 0.314372873493192},
+    {0.0568813795204235, 0.314372873493192, 0.314372873493192, 0.314372873493192},
+    {0.314372873493192, 0.314372873493192, 0.314372873493192, 0.0568813795204234},
+    {0.314372873493192, 0.314372873493192, 0.0568813795204235, 0.314372873493192}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[4] = {0, 1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[4] = {4, 5, 6, 7};
+    
+    static const double FE0_C0_D001[14][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc15[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[2] = {0, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[2] = {4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc18[2] = {4, 6};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[2] = {4, 7};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 177.
+    double G[21];
+    G[0] = det*w[3][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8] - w[4][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[1] = det*w[3][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8] - w[4][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[2] = det*w[3][0]*w[4][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    G[3] = det*w[3][0]*w[4][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    G[4] = det*w[3][0]*w[4][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    G[5] = det*w[3][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8] - w[4][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[6] = det*w[3][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5] - w[4][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[7] = det*w[3][0]*w[4][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    G[8] = det*w[3][0]*w[4][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    G[9] = det*w[3][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5] - w[4][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[10] = det*w[3][0]*w[4][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    G[11] = det*w[3][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2] - w[4][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[12] =  - det*w[2][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    G[13] =  - det*w[2][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    G[14] =  - det*w[2][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    G[15] =  - det*w[2][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    G[16] =  - det*w[2][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    G[17] =  - det*w[2][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    G[18] = -400.0*det;
+    G[19] = 600.0*det;
+    G[20] = -200.0*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 2310
+    for (unsigned int ip = 0; ip < 14; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      double F9 = 0.0;
+      double F10 = 0.0;
+      double F11 = 0.0;
+      
+      // Total number of operations to compute function values = 36
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F2 += FE0_C0_D001[ip][r]*w[0][nzc15[r]];
+        F3 += FE0_C0_D001[ip][r]*w[0][nzc14[r]];
+        F4 += FE0_C0_D001[ip][r]*w[0][nzc13[r]];
+        F6 += FE0_C0_D001[ip][r]*w[0][nzc19[r]];
+        F7 += FE0_C0_D001[ip][r]*w[0][nzc18[r]];
+        F8 += FE0_C0_D001[ip][r]*w[0][nzc17[r]];
+        F9 += FE0_C0_D001[ip][r]*w[1][nzc19[r]];
+        F10 += FE0_C0_D001[ip][r]*w[1][nzc18[r]];
+        F11 += FE0_C0_D001[ip][r]*w[1][nzc17[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 24
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        F0 += FE0_C0[ip][r]*w[0][nzc12[r]];
+        F1 += FE0_C0[ip][r]*w[1][nzc12[r]];
+        F5 += FE0_C0[ip][r]*w[0][nzc16[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 65
+      double I[8];
+      // Number of operations: 12
+      I[0] = W14[ip]*(F10*G[0] + F11*G[1] + F6*G[2] + F7*G[3] + F8*G[4] + F9*G[5]);
+      
+      // Number of operations: 12
+      I[1] = W14[ip]*(F10*G[6] + F11*G[0] + F6*G[7] + F7*G[8] + F8*G[3] + F9*G[9]);
+      
+      // Number of operations: 12
+      I[2] = W14[ip]*(F10*G[9] + F11*G[5] + F6*G[10] + F7*G[7] + F8*G[2] + F9*G[11]);
+      
+      // Number of operations: 6
+      I[3] = W14[ip]*(F2*G[12] + F3*G[13] + F4*G[14]);
+      
+      // Number of operations: 6
+      I[4] = W14[ip]*(F2*G[15] + F3*G[16] + F4*G[13]);
+      
+      // Number of operations: 6
+      I[5] = W14[ip]*(F2*G[17] + F3*G[15] + F4*G[12]);
+      
+      // Number of operations: 3
+      I[6] = W14[ip]*det*(F0 - F1);
+      
+      // Number of operations: 8
+      I[7] = W14[ip]*(F0*(G[20] + F0*(G[19] + F0*G[18])) + F5*det);
+      
+      
+      // Number of operations for primary indices: 24
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc13[j]] += FE0_C0_D001[ip][j]*I[0];
+        // Number of operations to compute entry: 2
+        A[nzc14[j]] += FE0_C0_D001[ip][j]*I[1];
+        // Number of operations to compute entry: 2
+        A[nzc15[j]] += FE0_C0_D001[ip][j]*I[2];
+        // Number of operations to compute entry: 2
+        A[nzc17[j]] += FE0_C0_D001[ip][j]*I[3];
+        // Number of operations to compute entry: 2
+        A[nzc18[j]] += FE0_C0_D001[ip][j]*I[4];
+        // Number of operations to compute entry: 2
+        A[nzc19[j]] += FE0_C0_D001[ip][j]*I[5];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 16
+      for (unsigned int j = 0; j < 4; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc12[j]] += FE0_C0[ip][j]*I[6];
+        // Number of operations to compute entry: 2
+        A[nzc16[j]] += FE0_C0[ip][j]*I[7];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+}
+
+/// Constructor
+cahnhilliard3d_cell_integral_1_otherwise::cahnhilliard3d_cell_integral_1_otherwise() : ufc::cell_integral()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_cell_integral_1_otherwise::~cahnhilliard3d_cell_integral_1_otherwise()
+{
+    // Do nothing
+}
+
+/// Tabulate which form coefficients are used by this integral
+const std::vector<bool> & cahnhilliard3d_cell_integral_1_otherwise::enabled_coefficients() const
+{
+    static const std::vector<bool> enabled({true, true, true, true});
+    return enabled;
+}
+
+/// Tabulate the tensor for the contribution from a local cell
+void cahnhilliard3d_cell_integral_1_otherwise::tabulate_tensor(double*  A,
+                                    const double * const *  w,
+                                    const double*  vertex_coordinates,
+                                    int cell_orientation) const
+{
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W14[14] = {0.00317460317460317, 0.00317460317460317, 0.00317460317460317, 0.00317460317460317, 0.00317460317460317, 0.00317460317460317, 0.0147649707904968, 0.0147649707904968, 0.0147649707904968, 0.0147649707904968, 0.0221397911142651, 0.0221397911142651, 0.0221397911142651, 0.0221397911142651};
+    // Quadrature points on the UFC reference element: (0.0, 0.5, 0.5), (0.5, 0.0, 0.5), (0.5, 0.5, 0.0), (0.5, 0.0, 0.0), (0.0, 0.5, 0.0), (0.0, 0.0, 0.5), (0.698419704324387, 0.100526765225204, 0.100526765225204), (0.100526765225204, 0.100526765225204, 0.100526765225204), (0.100526765225204, 0.100526765225204, 0.698419704324387), (0.100526765225204, 0.698419704324387, 0.100526765225204), (0.0568813795204234, 0.314372873493192, 0.314372873493192), (0.314372873493192, 0.314372873493192, 0.314372873493192), (0.314372873493192, 0.314372873493192, 0.0568813795204234), (0.314372873493192, 0.0568813795204234, 0.314372873493192)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[14][4] = \
+    {{0.0, 0.0, 0.5, 0.5},
+    {0.0, 0.5, 0.0, 0.5},
+    {0.0, 0.5, 0.5, 0.0},
+    {0.5, 0.5, 0.0, 0.0},
+    {0.5, 0.0, 0.5, 0.0},
+    {0.5, 0.0, 0.0, 0.5},
+    {0.100526765225205, 0.698419704324386, 0.100526765225205, 0.100526765225205},
+    {0.698419704324387, 0.100526765225204, 0.100526765225205, 0.100526765225205},
+    {0.100526765225205, 0.100526765225204, 0.100526765225205, 0.698419704324386},
+    {0.100526765225205, 0.100526765225204, 0.698419704324386, 0.100526765225205},
+    {0.314372873493192, 0.0568813795204234, 0.314372873493192, 0.314372873493192},
+    {0.0568813795204235, 0.314372873493192, 0.314372873493192, 0.314372873493192},
+    {0.314372873493192, 0.314372873493192, 0.314372873493192, 0.0568813795204234},
+    {0.314372873493192, 0.314372873493192, 0.0568813795204235, 0.314372873493192}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[4] = {0, 1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[4] = {4, 5, 6, 7};
+    
+    static const double FE0_C0_D001[14][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc15[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[2] = {0, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[2] = {4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc18[2] = {4, 6};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[2] = {4, 7};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 64; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 93.
+    double G[15];
+    G[0] = det*w[2][0]*w[3][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    G[1] = det*w[2][0]*w[3][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    G[2] = det*w[2][0]*w[3][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    G[3] = det*w[2][0]*w[3][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    G[4] = det*w[2][0]*w[3][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    G[5] = det*w[2][0]*w[3][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    G[6] =  - det*w[1][0]*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    G[7] =  - det*w[1][0]*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    G[8] =  - det*w[1][0]*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    G[9] =  - det*w[1][0]*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    G[10] =  - det*w[1][0]*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    G[11] =  - det*w[1][0]*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    G[12] = -200.0*det;
+    G[13] = -1200.0*det;
+    G[14] = 1200.0*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 5404
+    for (unsigned int ip = 0; ip < 14; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      
+      // Total number of operations to compute function values = 8
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        F0 += FE0_C0[ip][r]*w[0][nzc12[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 18
+      double I[14];
+      // Number of operations: 1
+      I[0] = G[0]*W14[ip];
+      
+      // Number of operations: 1
+      I[1] = G[1]*W14[ip];
+      
+      // Number of operations: 1
+      I[2] = G[2]*W14[ip];
+      
+      // Number of operations: 1
+      I[3] = G[3]*W14[ip];
+      
+      // Number of operations: 1
+      I[4] = G[4]*W14[ip];
+      
+      // Number of operations: 1
+      I[5] = G[5]*W14[ip];
+      
+      // Number of operations: 1
+      I[6] = G[6]*W14[ip];
+      
+      // Number of operations: 1
+      I[7] = G[7]*W14[ip];
+      
+      // Number of operations: 1
+      I[8] = G[8]*W14[ip];
+      
+      // Number of operations: 1
+      I[9] = G[9]*W14[ip];
+      
+      // Number of operations: 1
+      I[10] = G[10]*W14[ip];
+      
+      // Number of operations: 1
+      I[11] = G[11]*W14[ip];
+      
+      // Number of operations: 1
+      I[12] = W14[ip]*det;
+      
+      // Number of operations: 5
+      I[13] = W14[ip]*(G[12] + F0*(G[14] + F0*G[13]));
+      
+      
+      // Number of operations for primary indices: 216
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*8 + nzc17[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[0];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*8 + nzc18[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*8 + nzc19[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*8 + nzc17[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*8 + nzc18[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*8 + nzc19[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc15[j]*8 + nzc17[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc15[j]*8 + nzc18[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc15[j]*8 + nzc19[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[5];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*8 + nzc13[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[6];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*8 + nzc14[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[7];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*8 + nzc15[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[8];
+          // Number of operations to compute entry: 3
+          A[nzc18[j]*8 + nzc13[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[7];
+          // Number of operations to compute entry: 3
+          A[nzc18[j]*8 + nzc14[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[9];
+          // Number of operations to compute entry: 3
+          A[nzc18[j]*8 + nzc15[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[10];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*8 + nzc13[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[8];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*8 + nzc14[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[10];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*8 + nzc15[k]] += FE0_C0_D001[ip][j]*FE0_C0_D001[ip][k]*I[11];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 144
+      for (unsigned int j = 0; j < 4; j++)
+      {
+        for (unsigned int k = 0; k < 4; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*8 + nzc12[k]] += FE0_C0[ip][j]*FE0_C0[ip][k]*I[12];
+          // Number of operations to compute entry: 3
+          A[nzc16[j]*8 + nzc12[k]] += FE0_C0[ip][j]*FE0_C0[ip][k]*I[13];
+          // Number of operations to compute entry: 3
+          A[nzc16[j]*8 + nzc16[k]] += FE0_C0[ip][j]*FE0_C0[ip][k]*I[12];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+}
+
+/// Constructor
+cahnhilliard3d_form_0::cahnhilliard3d_form_0() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_form_0::~cahnhilliard3d_form_0()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* cahnhilliard3d_form_0::signature() const
+{
+    return "09969a10e5ab5023704c6055d6b9141e2a66b6f7f04617d36bc21430c948b1cbf6992735ebcb0b30ffadbf6261038f4557fc13bb134287250d079f5b023c8c37";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t cahnhilliard3d_form_0::rank() const
+{
+    return 1;
+}
+
+/// Return the number of coefficients (n)
+std::size_t cahnhilliard3d_form_0::num_coefficients() const
+{
+    return 5;
+}
+
+/// Return the number of cell domains
+std::size_t cahnhilliard3d_form_0::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t cahnhilliard3d_form_0::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t cahnhilliard3d_form_0::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t cahnhilliard3d_form_0::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t cahnhilliard3d_form_0::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool cahnhilliard3d_form_0::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool cahnhilliard3d_form_0::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool cahnhilliard3d_form_0::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool cahnhilliard3d_form_0::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool cahnhilliard3d_form_0::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* cahnhilliard3d_form_0::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard3d_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard3d_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new cahnhilliard3d_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new cahnhilliard3d_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new cahnhilliard3d_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new cahnhilliard3d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* cahnhilliard3d_form_0::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard3d_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard3d_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new cahnhilliard3d_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new cahnhilliard3d_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new cahnhilliard3d_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new cahnhilliard3d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* cahnhilliard3d_form_0::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* cahnhilliard3d_form_0::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* cahnhilliard3d_form_0::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* cahnhilliard3d_form_0::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* cahnhilliard3d_form_0::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* cahnhilliard3d_form_0::create_default_cell_integral() const
+{
+    return new cahnhilliard3d_cell_integral_0_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* cahnhilliard3d_form_0::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* cahnhilliard3d_form_0::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* cahnhilliard3d_form_0::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* cahnhilliard3d_form_0::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
+/// Constructor
+cahnhilliard3d_form_1::cahnhilliard3d_form_1() : ufc::form()
+{
+    // Do nothing
+}
+
+/// Destructor
+cahnhilliard3d_form_1::~cahnhilliard3d_form_1()
+{
+    // Do nothing
+}
+
+/// Return a string identifying the form
+const char* cahnhilliard3d_form_1::signature() const
+{
+    return "1b2fe8ef4c61f84a0ae5a77ea338525685d1328160e6e8784da97b9140359cd51150a65a836aed00e0d95a9b135e7f28c5a5102ddddd319cb451985ba5594205";
+}
+
+/// Return the rank of the global tensor (r)
+std::size_t cahnhilliard3d_form_1::rank() const
+{
+    return 2;
+}
+
+/// Return the number of coefficients (n)
+std::size_t cahnhilliard3d_form_1::num_coefficients() const
+{
+    return 4;
+}
+
+/// Return the number of cell domains
+std::size_t cahnhilliard3d_form_1::num_cell_domains() const
+{
+    return 0;
+}
+
+/// Return the number of exterior facet domains
+std::size_t cahnhilliard3d_form_1::num_exterior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of interior facet domains
+std::size_t cahnhilliard3d_form_1::num_interior_facet_domains() const
+{
+    return 0;
+}
+
+/// Return the number of point domains
+std::size_t cahnhilliard3d_form_1::num_point_domains() const
+{
+    return 0;
+}
+
+/// Return the number of custom domains
+std::size_t cahnhilliard3d_form_1::num_custom_domains() const
+{
+    return 0;
+}
+
+/// Return whether the form has any cell integrals
+bool cahnhilliard3d_form_1::has_cell_integrals() const
+{
+    return true;
+}
+
+/// Return whether the form has any exterior facet integrals
+bool cahnhilliard3d_form_1::has_exterior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any interior facet integrals
+bool cahnhilliard3d_form_1::has_interior_facet_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any point integrals
+bool cahnhilliard3d_form_1::has_point_integrals() const
+{
+    return false;
+}
+
+/// Return whether the form has any custom integrals
+bool cahnhilliard3d_form_1::has_custom_integrals() const
+{
+    return false;
+}
+
+/// Create a new finite element for argument function i
+ufc::finite_element* cahnhilliard3d_form_1::create_finite_element(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard3d_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard3d_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new cahnhilliard3d_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new cahnhilliard3d_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new cahnhilliard3d_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new cahnhilliard3d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new dofmap for argument function i
+ufc::dofmap* cahnhilliard3d_form_1::create_dofmap(std::size_t i) const
+{
+    switch (i)
+    {
+    case 0:
+      {
+        return new cahnhilliard3d_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new cahnhilliard3d_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new cahnhilliard3d_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new cahnhilliard3d_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new cahnhilliard3d_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new cahnhilliard3d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+}
+
+/// Create a new cell integral on sub domain i
+ufc::cell_integral* cahnhilliard3d_form_1::create_cell_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new exterior facet integral on sub domain i
+ufc::exterior_facet_integral* cahnhilliard3d_form_1::create_exterior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on sub domain i
+ufc::interior_facet_integral* cahnhilliard3d_form_1::create_interior_facet_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new point integral on sub domain i
+ufc::point_integral* cahnhilliard3d_form_1::create_point_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new custom integral on sub domain i
+ufc::custom_integral* cahnhilliard3d_form_1::create_custom_integral(std::size_t i) const
+{
+    return 0;
+}
+
+/// Create a new cell integral on everywhere else
+ufc::cell_integral* cahnhilliard3d_form_1::create_default_cell_integral() const
+{
+    return new cahnhilliard3d_cell_integral_1_otherwise();
+}
+
+/// Create a new exterior facet integral on everywhere else
+ufc::exterior_facet_integral* cahnhilliard3d_form_1::create_default_exterior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new interior facet integral on everywhere else
+ufc::interior_facet_integral* cahnhilliard3d_form_1::create_default_interior_facet_integral() const
+{
+    return 0;
+}
+
+/// Create a new point integral on everywhere else
+ufc::point_integral* cahnhilliard3d_form_1::create_default_point_integral() const
+{
+    return 0;
+}
+
+/// Create a new custom integral on everywhere else
+ufc::custom_integral* cahnhilliard3d_form_1::create_default_custom_integral() const
+{
+    return 0;
+}
+
+
diff --git a/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.h b/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.h
new file mode 100644
index 0000000..32e4145
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.h
@@ -0,0 +1,1842 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          True
+
+#ifndef __CAHNHILLIARD3D_H
+#define __CAHNHILLIARD3D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class cahnhilliard3d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_finite_element_0();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_finite_element_0();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a finite element.
+
+class cahnhilliard3d_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_finite_element_1();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_finite_element_1();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a finite element.
+
+class cahnhilliard3d_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_finite_element_2();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_finite_element_2();
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const;
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const;
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const;
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const;
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const;
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation);
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation);
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation);
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation);
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const;
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const;
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const;
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const;
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const;
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const;
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class cahnhilliard3d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_dofmap_0();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_dofmap_0();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class cahnhilliard3d_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_dofmap_1();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_dofmap_1();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class cahnhilliard3d_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_dofmap_2();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_dofmap_2();
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const;
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const;
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const;
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const;
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const;
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const;
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const;
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const;
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const;
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const;
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const;
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** coordinates,
+                                    const double* vertex_coordinates) const;
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const;
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const;
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class cahnhilliard3d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_cell_integral_0_otherwise();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_cell_integral_0_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class cahnhilliard3d_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_cell_integral_1_otherwise();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_cell_integral_1_otherwise();
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const;
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const;
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class cahnhilliard3d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_form_0();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_form_0();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class cahnhilliard3d_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  cahnhilliard3d_form_1();
+
+  /// Destructor
+  virtual ~cahnhilliard3d_form_1();
+
+  /// Return a string identifying the form
+  virtual const char* signature() const;
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const;
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const;
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const;
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const;
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const;
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const;
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const;
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const;
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const;
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const;
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const;
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const;
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const;
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const;
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const;
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const;
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const;
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const;
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const;
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const;
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const;
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const;
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const;
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const;
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace CahnHilliard3D
+{
+
+class CoefficientSpace_dt: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_dt(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_dt(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_dt(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_dt()
+  {
+  }
+
+};
+
+class CoefficientSpace_lmbda: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_lmbda()
+  {
+  }
+
+};
+
+class CoefficientSpace_theta: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_theta(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_theta(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_theta(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_theta(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_theta(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_theta(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_theta()
+  {
+  }
+
+};
+
+class CoefficientSpace_u: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u()
+  {
+  }
+
+};
+
+class CoefficientSpace_u0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u0()
+  {
+  }
+
+};
+
+class Form_F_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_F_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_F_FunctionSpace_1;
+
+typedef CoefficientSpace_u0 Form_F_FunctionSpace_2;
+
+typedef CoefficientSpace_lmbda Form_F_FunctionSpace_3;
+
+typedef CoefficientSpace_dt Form_F_FunctionSpace_4;
+
+typedef CoefficientSpace_theta Form_F_FunctionSpace_5;
+
+class Form_F: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& dt, const dolfin::GenericFunction& theta):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = u;
+    this->u0 = u0;
+    this->lmbda = lmbda;
+    this->dt = dt;
+    this->theta = theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> dt, std::shared_ptr<const dolfin::GenericFunction> theta):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = *u;
+    this->u0 = *u0;
+    this->lmbda = *lmbda;
+    this->dt = *dt;
+    this->theta = *theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& dt, const dolfin::GenericFunction& theta):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = u;
+    this->u0 = u0;
+    this->lmbda = lmbda;
+    this->dt = dt;
+    this->theta = theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> dt, std::shared_ptr<const dolfin::GenericFunction> theta):
+    dolfin::Form(1, 5), u(*this, 0), u0(*this, 1), lmbda(*this, 2), dt(*this, 3), theta(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = *u;
+    this->u0 = *u0;
+    this->lmbda = *lmbda;
+    this->dt = *dt;
+    this->theta = *theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_0());
+  }
+
+  // Destructor
+  ~Form_F()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "u0")
+      return 1;
+    else if (name == "lmbda")
+      return 2;
+    else if (name == "dt")
+      return 3;
+    else if (name == "theta")
+      return 4;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "u0";
+    case 2:
+      return "lmbda";
+    case 3:
+      return "dt";
+    case 4:
+      return "theta";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_F_FunctionSpace_0 TestSpace;
+  typedef Form_F_FunctionSpace_1 CoefficientSpace_u;
+  typedef Form_F_FunctionSpace_2 CoefficientSpace_u0;
+  typedef Form_F_FunctionSpace_3 CoefficientSpace_lmbda;
+  typedef Form_F_FunctionSpace_4 CoefficientSpace_dt;
+  typedef Form_F_FunctionSpace_5 CoefficientSpace_theta;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner u0;
+  dolfin::CoefficientAssigner lmbda;
+  dolfin::CoefficientAssigner dt;
+  dolfin::CoefficientAssigner theta;
+};
+
+class Form_J_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_J_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new cahnhilliard3d_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new cahnhilliard3d_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_J_FunctionSpace_2;
+
+typedef CoefficientSpace_lmbda Form_J_FunctionSpace_3;
+
+typedef CoefficientSpace_dt Form_J_FunctionSpace_4;
+
+typedef CoefficientSpace_theta Form_J_FunctionSpace_5;
+
+class Form_J: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& dt, const dolfin::GenericFunction& theta):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = u;
+    this->lmbda = lmbda;
+    this->dt = dt;
+    this->theta = theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> dt, std::shared_ptr<const dolfin::GenericFunction> theta):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = *u;
+    this->lmbda = *lmbda;
+    this->dt = *dt;
+    this->theta = *theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& dt, const dolfin::GenericFunction& theta):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = u;
+    this->lmbda = lmbda;
+    this->dt = dt;
+    this->theta = theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> dt, std::shared_ptr<const dolfin::GenericFunction> theta):
+    dolfin::Form(2, 4), u(*this, 0), lmbda(*this, 1), dt(*this, 2), theta(*this, 3)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = *u;
+    this->lmbda = *lmbda;
+    this->dt = *dt;
+    this->theta = *theta;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new cahnhilliard3d_form_1());
+  }
+
+  // Destructor
+  ~Form_J()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "lmbda")
+      return 1;
+    else if (name == "dt")
+      return 2;
+    else if (name == "theta")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "lmbda";
+    case 2:
+      return "dt";
+    case 3:
+      return "theta";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_J_FunctionSpace_0 TestSpace;
+  typedef Form_J_FunctionSpace_1 TrialSpace;
+  typedef Form_J_FunctionSpace_2 CoefficientSpace_u;
+  typedef Form_J_FunctionSpace_3 CoefficientSpace_lmbda;
+  typedef Form_J_FunctionSpace_4 CoefficientSpace_dt;
+  typedef Form_J_FunctionSpace_5 CoefficientSpace_theta;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner lmbda;
+  dolfin::CoefficientAssigner dt;
+  dolfin::CoefficientAssigner theta;
+};
+
+// Class typedefs
+typedef Form_J BilinearForm;
+typedef Form_J JacobianForm;
+typedef Form_F LinearForm;
+typedef Form_F ResidualForm;
+typedef Form_F::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.ufl b/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.ufl
new file mode 100644
index 0000000..89e20ca
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/CahnHilliard3D.ufl
@@ -0,0 +1,56 @@
+# Copyright (C) 2006-2010 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2006
+# Last changed: 2011-06-30
+#
+# The linearised bilinear form a(du, v) and linear form L(v) for
+# the Cahn-Hilliard equation.
+#
+# Compile this form with FFC: ffc -l dolfin -O -f split CahnHilliard3D.ufl
+
+P1 = FiniteElement("Lagrange", tetrahedron, 1)
+ME = P1*P1
+
+du   = TrialFunction(ME)
+q, v = TestFunctions(ME)
+
+u   = Coefficient(ME)  # current solution
+u0  = Coefficient(ME)  # solution from previous converged step
+
+# Split mixed functions
+dc, dmu = split(du)
+c,  mu  = split(u)
+c0, mu0 = split(u0)
+
+lmbda    = Constant(tetrahedron) # surface energy parameter
+dt       = Constant(tetrahedron) # time step
+theta    = Constant(tetrahedron) # time stepping parameter
+
+# mu_(n+theta)
+mu_mid = (1-theta)*mu0 + theta*mu
+
+# Compute the chemical potential df/dc
+c = variable(c)
+f    = 100*c**2*(1-c)**2
+dfdc = diff(f, c)
+
+F0 = c*q*dx  - c0*q*dx   + dt*dot(grad(mu_mid), grad(q))*dx
+F1 = mu*v*dx - dfdc*v*dx - lmbda*dot(grad(c), grad(v))*dx
+F  = F0 + F1
+
+J = derivative(F, u, du)
diff --git a/demo/documented/cahn-hilliard/cpp/compile.log b/demo/documented/cahn-hilliard/cpp/compile.log
new file mode 100644
index 0000000..35cb8f8
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/compile.log
@@ -0,0 +1,7060 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form CahnHilliard3D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'F'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 5
+  Coefficients:           '[w_0, w_1, c_2, c_3, c_4]'
+  Coefficient names:      '[u, u0, lmbda, dt, theta]'
+  Unique elements:        'Mixed<CG1(?), CG1(?)>, R0(?)'
+  Unique sub elements:    'Mixed<CG1(?), CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 5
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'J'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, du]'
+  Number of coefficients: 4
+  Coefficients:           '[w_0, c_2, c_3, c_4]'
+  Coefficient names:      '[u, lmbda, dt, theta]'
+  Unique elements:        'Mixed<CG1(?), CG1(?)>, R0(?)'
+  Unique sub elements:    'Mixed<CG1(?), CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0881329 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {14: {FiniteElement('Real', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0, 0): array([[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+           1.]])}}}, VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]]]), (0, 1, 0): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]]]), (0, 0, 0): array([[[  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01]]]), (0, 0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00]]])}}}, MixedElement(*[FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (2,) }): {None: {None: {(1, 0, 0): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]]]), (0, 1, 0): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]]]), (0, 0, 0): array([[[  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01]]]), (0, 0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.44089210e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.44089210e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[  4.16333634e-17,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  9.71445147e-17,   5.00000000e-01,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.93889390e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   5.00000000e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,  -1.38777878e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   1.38777878e-17,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.68813795e-02,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D010': array([[ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D010': array([[ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.44089210e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D001': array([[ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.44089210e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.16333634e-17,   0.00000000e+00,
+            5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.71445147e-17,   5.00000000e-01,
+           -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.93889390e-17,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+           -2.77555756e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,  -1.38777878e-17,
+            5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   1.38777878e-17,
+           -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE2': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE1_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.44089210e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00]]), 'FE0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   9.71445147e-17,
+            5.00000000e-01,  -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.93889390e-17,
+            5.00000000e-01,   5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,  -2.77555756e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+           -1.38777878e-17,   5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+            1.38777878e-17,  -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01,   6.98419704e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01,   5.68813795e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02,   3.14372873e-01]]), 'FE0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.16333634e-17,   0.00000000e+00,
+            5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.71445147e-17,   5.00000000e-01,
+           -2.77555756e-17,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.93889390e-17,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+           -2.77555756e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,  -1.38777878e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   1.38777878e-17,
+           -2.77555756e-17,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0': array([[  4.16333634e-17,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.71445147e-17,   5.00000000e-01,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.93889390e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   5.00000000e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,  -1.38777878e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   1.38777878e-17,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.68813795e-02,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.44089210e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.44089210e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[  4.16333634e-17,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  9.71445147e-17,   5.00000000e-01,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.93889390e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   5.00000000e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,  -1.38777878e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   1.38777878e-17,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.68813795e-02,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D010': array([[ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D010': array([[ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.44089210e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D001': array([[ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.44089210e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.16333634e-17,   0.00000000e+00,
+            5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.71445147e-17,   5.00000000e-01,
+           -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.93889390e-17,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+           -2.77555756e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,  -1.38777878e-17,
+            5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   1.38777878e-17,
+           -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE2': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE1_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.44089210e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00]]), 'FE0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   9.71445147e-17,
+            5.00000000e-01,  -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.93889390e-17,
+            5.00000000e-01,   5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,  -2.77555756e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+           -1.38777878e-17,   5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+            1.38777878e-17,  -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01,   6.98419704e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01,   5.68813795e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02,   3.14372873e-01]]), 'FE0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.16333634e-17,   0.00000000e+00,
+            5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.71445147e-17,   5.00000000e-01,
+           -2.77555756e-17,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.93889390e-17,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+           -2.77555756e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,  -1.38777878e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   1.38777878e-17,
+           -2.77555756e-17,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0': array([[  4.16333634e-17,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.71445147e-17,   5.00000000e-01,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.93889390e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   5.00000000e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,  -1.38777878e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   1.38777878e-17,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.68813795e-02,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C2_D001': 'FE0_C2_D001', 'FE0_C1_D001': 'FE0_C1_D001', 'FE0_C1_D010': 'FE0_C1_D010', 'FE0_C2_D010': 'FE0_C2_D010', 'FE1_C0': 'FE1_C0', 'FE0_C1_D100': 'FE0_C1_D100', 'FE0_C0_D100': 'FE0_C0_D100', 'FE1_C0_D100': 'FE1_C0_D100', 'FE1_C0_D010': 'FE1_C0_D010', 'FE0_C0_D010': 'FE0_C0_D010', 'FE0_C0_D001': 'FE0_C0_D001', 'FE1_C0_D001': 'FE1_C0_D001', 'FE1_C1_D100': 'FE1_C1_D100', 'FE1_C1': 'FE1_C1', 'FE0_C2_D100': 'FE0_C2_D100', 'FE2': 'FE2', 'FE1_C1_D010': 'FE1_C1_D010', 'FE1_C1_D001': 'FE1_C1_D001', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D001': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE2': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE0_C0': array([[ 0.        ,  0.        ,  0.5       ,  0.5       ],
+         [ 0.        ,  0.5       ,  0.        ,  0.5       ],
+         [ 0.        ,  0.5       ,  0.5       ,  0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ],
+         [ 0.5       ,  0.        ,  0.5       ,  0.        ],
+         [ 0.5       ,  0.        ,  0.        ,  0.5       ],
+         [ 0.10052677,  0.6984197 ,  0.10052677,  0.10052677],
+         [ 0.6984197 ,  0.10052677,  0.10052677,  0.10052677],
+         [ 0.10052677,  0.10052677,  0.10052677,  0.6984197 ],
+         [ 0.10052677,  0.10052677,  0.6984197 ,  0.10052677],
+         [ 0.31437287,  0.05688138,  0.31437287,  0.31437287],
+         [ 0.05688138,  0.31437287,  0.31437287,  0.31437287],
+         [ 0.31437287,  0.31437287,  0.31437287,  0.05688138],
+         [ 0.31437287,  0.31437287,  0.05688138,  0.31437287]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C2_D001': ('FE0_C0_D001', (9, [8, 11]), False, False), 'FE0_C1_D001': ('FE0_C0_D001', (5, [4, 7]), False, False), 'FE0_C1_D010': ('FE0_C0_D001', (6, [4, 6]), False, False), 'FE0_C2_D010': ('FE0_C0_D001', (10, [8, 10]), False, False), 'FE1_C0': ('FE0_C0', (12, [0, 1, 2, 3]), False, False), 'FE0_C1_D100': ('FE0_C0_D001', (7, [4, 5]), False, False), 'FE0_C0_D100': ('FE0_C0_D001', (3, [0, 1]), False, False), 'FE1_C0_D100': ('FE0_C0_D001', (15, [0, 1]), False, False), 'FE1_C0_D010': ('FE0_C0_D001', (14, [0, 2]), False, False), 'FE0_C0_D010': ('FE0_C0_D001', (2, [0, 2]), False, False), 'FE0_C0_D001': ('FE0_C0_D001', (1, [0, 3]), False, False), 'FE1_C0_D001': ('FE0_C0_D001', (13, [0, 3]), False, False), 'FE1_C1_D100': ('FE0_C0_D001', (19, [4, 5]), False, False), 'FE1_C1': ('FE0_C0', (16, [4, 5, 6, 7]), False, False), 'FE0_C2_D100': ('FE0_C0_D001', (11, [8, 9]), False, False), 'FE2': ('FE2', (), False, True), 'FE1_C1_D010': ('FE0_C0_D001', (18, [4, 6]), False, False), 'FE1_C1_D001': ('FE0_C0_D001', (17, [4, 7]), False, False), 'FE0_C2': ('FE0_C0', (8, [8, 9, 10, 11]), False, False), 'FE0_C1': ('FE0_C0', (4, [4, 5, 6, 7]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2, 3]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {14: {FiniteElement('Real', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0, 0): array([[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+           1.]])}}}, VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]]]), (0, 1, 0): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]]]), (0, 0, 0): array([[[  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01]]]), (0, 0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00]]])}}}, MixedElement(*[FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (2,) }): {None: {None: {(1, 0, 0): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.]]]), (0, 1, 0): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.66533454e-16,   1.66533454e-16,  -1.66533454e-16,
+            -1.66533454e-16,  -1.66533454e-16,   1.66533454e-16,
+            -1.11022302e-16,  -1.11022302e-16,   3.88578059e-16,
+            -1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            -1.11022302e-16,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]]]), (0, 0, 0): array([[[  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  4.16333634e-17,   9.71445147e-17,   6.93889390e-17,
+             5.00000000e-01,   5.00000000e-01,   5.00000000e-01,
+             1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+             1.00526765e-01,   3.14372873e-01,   5.68813795e-02,
+             3.14372873e-01,   3.14372873e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+             5.00000000e-01,  -1.38777878e-17,   1.38777878e-17,
+             6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+             1.00526765e-01,   5.68813795e-02,   3.14372873e-01,
+             3.14372873e-01,   3.14372873e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,  -2.77555756e-17,   5.00000000e-01,
+            -2.77555756e-17,   5.00000000e-01,  -2.77555756e-17,
+             1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+             6.98419704e-01,   3.14372873e-01,   3.14372873e-01,
+             3.14372873e-01,   5.68813795e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+             1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+             1.00526765e-01,   3.14372873e-01,   3.14372873e-01,
+             5.68813795e-02,   3.14372873e-01]]]), (0, 0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  3.33066907e-16,   3.33066907e-16,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   3.33066907e-16,
+            -5.55111512e-17,  -5.55111512e-17,   4.44089210e-16,
+            -5.55111512e-17,   5.55111512e-17,   5.55111512e-17,
+            -5.55111512e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,   0.00000000e+00,
+            -5.55111512e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -5.55111512e-17,  -5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.44089210e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.44089210e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[  4.16333634e-17,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  9.71445147e-17,   5.00000000e-01,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.93889390e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   5.00000000e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,  -1.38777878e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   1.38777878e-17,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.68813795e-02,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D010': array([[ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D010': array([[ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.44089210e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D001': array([[ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.44089210e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.16333634e-17,   0.00000000e+00,
+            5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.71445147e-17,   5.00000000e-01,
+           -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.93889390e-17,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+           -2.77555756e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,  -1.38777878e-17,
+            5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   1.38777878e-17,
+           -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE2': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE1_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.44089210e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00]]), 'FE0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   9.71445147e-17,
+            5.00000000e-01,  -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.93889390e-17,
+            5.00000000e-01,   5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,  -2.77555756e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+           -1.38777878e-17,   5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+            1.38777878e-17,  -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01,   6.98419704e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01,   5.68813795e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02,   3.14372873e-01]]), 'FE0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.16333634e-17,   0.00000000e+00,
+            5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.71445147e-17,   5.00000000e-01,
+           -2.77555756e-17,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.93889390e-17,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+           -2.77555756e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,  -1.38777878e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   1.38777878e-17,
+           -2.77555756e-17,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0': array([[  4.16333634e-17,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.71445147e-17,   5.00000000e-01,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.93889390e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   5.00000000e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,  -1.38777878e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   1.38777878e-17,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.68813795e-02,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.33066907e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.44089210e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -5.55111512e-17,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            5.55111512e-17,  -5.55111512e-17,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.44089210e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.66533454e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+           -1.11022302e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[  4.16333634e-17,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  9.71445147e-17,   5.00000000e-01,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.93889390e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   5.00000000e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,  -1.38777878e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   1.38777878e-17,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  5.68813795e-02,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D010': array([[ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D010': array([[ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.66533454e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.44089210e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D001': array([[ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.33066907e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.44089210e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,  -5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   5.55111512e-17,  -5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.16333634e-17,   0.00000000e+00,
+            5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.71445147e-17,   5.00000000e-01,
+           -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.93889390e-17,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+           -2.77555756e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,  -1.38777878e-17,
+            5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   1.38777878e-17,
+           -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE2': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE1_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.66533454e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -1.11022302e-16,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.33066907e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.44089210e-16,
+            0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,  -5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   5.55111512e-17,
+           -5.55111512e-17,   1.00000000e+00]]), 'FE0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   9.71445147e-17,
+            5.00000000e-01,  -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.93889390e-17,
+            5.00000000e-01,   5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,  -2.77555756e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+           -1.38777878e-17,   5.00000000e-01,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.00000000e-01,
+            1.38777878e-17,  -2.77555756e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01,   6.98419704e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01,   1.00526765e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01,   3.14372873e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01,   5.68813795e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02,   3.14372873e-01]]), 'FE0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.16333634e-17,   0.00000000e+00,
+            5.00000000e-01,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.71445147e-17,   5.00000000e-01,
+           -2.77555756e-17,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.93889390e-17,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   5.00000000e-01,
+           -2.77555756e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,  -1.38777878e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.00000000e-01,   1.38777878e-17,
+           -2.77555756e-17,   5.00000000e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   6.98419704e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   1.00526765e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   5.68813795e-02,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   3.14372873e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0': array([[  4.16333634e-17,   0.00000000e+00,   5.00000000e-01,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.71445147e-17,   5.00000000e-01,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.93889390e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   5.00000000e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,  -1.38777878e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   1.38777878e-17,  -2.77555756e-17,
+            5.00000000e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   6.98419704e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.98419704e-01,   1.00526765e-01,   1.00526765e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   1.00526765e-01,
+            6.98419704e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.00526765e-01,   1.00526765e-01,   6.98419704e-01,
+            1.00526765e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   5.68813795e-02,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.68813795e-02,   3.14372873e-01,   3.14372873e-01,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   3.14372873e-01,
+            5.68813795e-02,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.14372873e-01,   3.14372873e-01,   5.68813795e-02,
+            3.14372873e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C2_D001': 'FE0_C2_D001', 'FE0_C1_D001': 'FE0_C1_D001', 'FE0_C1_D010': 'FE0_C1_D010', 'FE0_C2_D010': 'FE0_C2_D010', 'FE1_C0': 'FE1_C0', 'FE0_C1_D100': 'FE0_C1_D100', 'FE0_C0_D100': 'FE0_C0_D100', 'FE1_C0_D100': 'FE1_C0_D100', 'FE1_C0_D010': 'FE1_C0_D010', 'FE0_C0_D010': 'FE0_C0_D010', 'FE0_C0_D001': 'FE0_C0_D001', 'FE1_C0_D001': 'FE1_C0_D001', 'FE1_C1_D100': 'FE1_C1_D100', 'FE1_C1': 'FE1_C1', 'FE0_C2_D100': 'FE0_C2_D100', 'FE2': 'FE2', 'FE1_C1_D010': 'FE1_C1_D010', 'FE1_C1_D001': 'FE1_C1_D001', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D001': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE2': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE0_C0': array([[ 0.        ,  0.        ,  0.5       ,  0.5       ],
+         [ 0.        ,  0.5       ,  0.        ,  0.5       ],
+         [ 0.        ,  0.5       ,  0.5       ,  0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ],
+         [ 0.5       ,  0.        ,  0.5       ,  0.        ],
+         [ 0.5       ,  0.        ,  0.        ,  0.5       ],
+         [ 0.10052677,  0.6984197 ,  0.10052677,  0.10052677],
+         [ 0.6984197 ,  0.10052677,  0.10052677,  0.10052677],
+         [ 0.10052677,  0.10052677,  0.10052677,  0.6984197 ],
+         [ 0.10052677,  0.10052677,  0.6984197 ,  0.10052677],
+         [ 0.31437287,  0.05688138,  0.31437287,  0.31437287],
+         [ 0.05688138,  0.31437287,  0.31437287,  0.31437287],
+         [ 0.31437287,  0.31437287,  0.31437287,  0.05688138],
+         [ 0.31437287,  0.31437287,  0.05688138,  0.31437287]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C2_D001': ('FE0_C0_D001', (9, [8, 11]), False, False), 'FE0_C1_D001': ('FE0_C0_D001', (5, [4, 7]), False, False), 'FE0_C1_D010': ('FE0_C0_D001', (6, [4, 6]), False, False), 'FE0_C2_D010': ('FE0_C0_D001', (10, [8, 10]), False, False), 'FE1_C0': ('FE0_C0', (12, [0, 1, 2, 3]), False, False), 'FE0_C1_D100': ('FE0_C0_D001', (7, [4, 5]), False, False), 'FE0_C0_D100': ('FE0_C0_D001', (3, [0, 1]), False, False), 'FE1_C0_D100': ('FE0_C0_D001', (15, [0, 1]), False, False), 'FE1_C0_D010': ('FE0_C0_D001', (14, [0, 2]), False, False), 'FE0_C0_D010': ('FE0_C0_D001', (2, [0, 2]), False, False), 'FE0_C0_D001': ('FE0_C0_D001', (1, [0, 3]), False, False), 'FE1_C0_D001': ('FE0_C0_D001', (13, [0, 3]), False, False), 'FE1_C1_D100': ('FE0_C0_D001', (19, [4, 5]), False, False), 'FE1_C1': ('FE0_C0', (16, [4, 5, 6, 7]), False, False), 'FE0_C2_D100': ('FE0_C0_D001', (11, [8, 9]), False, False), 'FE2': ('FE2', (), False, True), 'FE1_C1_D010': ('FE0_C0_D001', (18, [4, 6]), False, False), 'FE1_C1_D001': ('FE0_C0_D001', (17, [4, 7]), False, False), 'FE0_C2': ('FE0_C0', (8, [8, 9, 10, 11]), False, False), 'FE0_C1': ('FE0_C0', (4, [4, 5, 6, 7]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2, 3]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 2.66944 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.029104 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Z
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: d_22
+  Removing unused variable: d_21
+  Removing unused variable: d_20
+  Removing unused variable: d_12
+  Removing unused variable: d_11
+  Removing unused variable: d_10
+  Removing unused variable: d_02
+  Removing unused variable: d_01
+  Removing unused variable: d_00
+  Removing unused variable: C2
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.241875 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00130987 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./CahnHilliard3D.h.
+  Output written to ./CahnHilliard3D.cpp.
+  
+Compiler stage 5 finished in 0.00139999 seconds.
+
+FFC finished in 3.0317 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form CahnHilliard2D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'F'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 5
+  Coefficients:           '[w_0, w_1, c_2, c_3, c_4]'
+  Coefficient names:      '[u, u0, lmbda, dt, theta]'
+  Unique elements:        'Mixed<CG1(?), CG1(?)>, R0(?)'
+  Unique sub elements:    'Mixed<CG1(?), CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 5
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'J'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, du]'
+  Number of coefficients: 4
+  Coefficients:           '[w_0, c_2, c_3, c_4]'
+  Coefficient names:      '[u, lmbda, dt, theta]'
+  Unique elements:        'Mixed<CG1(?), CG1(?)>, R0(?)'
+  Unique sub elements:    'Mixed<CG1(?), CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.072963 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {6: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object)}}}, MixedElement(*[FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (2,) }): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {'FE0_C1_D01': ['FE1_C1_D01'], 'FE0_C1_D10': ['FE1_C1_D10'], 'FE0_C0_D10': ['FE1_C0_D10'], 'FE0_C0_D01': ['FE1_C0_D01'], 'FE0_C1': ['FE1_C1'], 'FE0_C0': ['FE1_C0']}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE1_C0': 'FE0_C0', 'FE1_C1_D01': 'FE0_C1_D01', 'FE0_C1_D10': 'FE0_C1_D10', 'FE1_C1_D10': 'FE0_C1_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE2': 'FE2', 'FE1_C1': 'FE0_C1', 'FE1_C0_D01': 'FE0_C0_D01', 'FE1_C0_D10': 'FE0_C0_D10', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621],
+         [ 0.09157621,  0.09157621,  0.81684757],
+         [ 0.81684757,  0.09157621,  0.09157621],
+         [ 0.44594849,  0.10810302,  0.44594849],
+         [ 0.44594849,  0.44594849,  0.10810302],
+         [ 0.10810302,  0.44594849,  0.44594849]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE1_C0': ('FE0_C0', (0, [0, 1, 2]), False, False), 'FE1_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE1_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE2': ('FE2', (), False, True), 'FE1_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE1_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {6: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object)}}}, MixedElement(*[FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (2,) }): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {'FE0_C1_D01': ['FE1_C1_D01'], 'FE0_C1_D10': ['FE1_C1_D10'], 'FE0_C0_D10': ['FE1_C0_D10'], 'FE0_C0_D01': ['FE1_C0_D01'], 'FE0_C1': ['FE1_C1'], 'FE0_C0': ['FE1_C0']}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE1_C0': 'FE0_C0', 'FE1_C1_D01': 'FE0_C1_D01', 'FE0_C1_D10': 'FE0_C1_D10', 'FE1_C1_D10': 'FE0_C1_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE2': 'FE2', 'FE1_C1': 'FE0_C1', 'FE1_C0_D01': 'FE0_C0_D01', 'FE1_C0_D10': 'FE0_C0_D10', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621],
+         [ 0.09157621,  0.09157621,  0.81684757],
+         [ 0.81684757,  0.09157621,  0.09157621],
+         [ 0.44594849,  0.10810302,  0.44594849],
+         [ 0.44594849,  0.44594849,  0.10810302],
+         [ 0.10810302,  0.44594849,  0.44594849]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE1_C0': ('FE0_C0', (0, [0, 1, 2]), False, False), 'FE1_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE1_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE2': ('FE2', (), False, True), 'FE1_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE1_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.413997 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.0159562 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.123621 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00110006 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./CahnHilliard2D.h.
+  Output written to ./CahnHilliard2D.cpp.
+  
+Compiler stage 5 finished in 0.0012939 seconds.
+
+FFC finished in 0.629438 seconds.
diff --git a/demo/documented/cahn-hilliard/cpp/documentation.rst b/demo/documented/cahn-hilliard/cpp/documentation.rst
new file mode 100644
index 0000000..ed3f1ec
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/documentation.rst
@@ -0,0 +1,411 @@
+.. Documentation for the Cahn-Hilliard demo from DOLFIN.
+
+.. _demo_pde_cahn_hilliard_cpp_documentation:
+
+Cahn-Hilliard equation
+======================
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+The implementation is split in three files: two form files containing the
+definition of the variational forms expressed in UFL and a C++ file
+containing the actual solver.
+
+Running this demo requires the files: :download:`main.cpp`,
+:download:`CahnHilliard2D.ufl`, :download:`CahnHilliard3D.ufl` and
+:download:`CMakeLists.txt`.
+
+UFL form files
+^^^^^^^^^^^^^^
+
+The UFL code for this problem in two and three dimensions are in
+:download:`CahnHilliard2D.ufl` and :download:`CahnHilliard3D.ufl` respectively.
+However, only the two dimensional case is explained in detail in the following.
+
+First, a mixed function spaces of linear Lagrange functions on triangles
+is created:
+
+.. code-block:: python
+
+    P1 = FiniteElement("Lagrange", triangle, 1)
+    ME = P1*P1
+
+On the mixed space, trial and test functions are defined:
+
+.. code-block:: python
+
+    du   = TrialFunction(ME)
+    q, v = TestFunctions(ME)
+
+The test functions have been split into components.
+
+Coefficient functions are now defined for the current solution (the
+most recent guess) and the solution from the beginning of the time
+step. Further, these functions (and the trial function) are split into
+their components:
+
+.. code-block:: python
+
+    u   = Coefficient(ME)  # current solution
+    u0  = Coefficient(ME)  # solution from previous converged step
+
+    # Split mixed functions
+    dc, dmu = split(du)
+    c,  mu  = split(u)
+    c0, mu0 = split(u0)
+
+Various model parameters can be specified using the class
+:py:class:`Constant`. This means that their value can be changed
+without recompiling the UFL file.  Lastly, the value of
+:math:`\mu_{n+\theta}` is computed.
+
+.. code-block:: python
+
+    lmbda    = Constant(triangle) # surface energy parameter
+    dt       = Constant(triangle) # time step
+    theta    = Constant(triangle) # time stepping parameter
+
+    # mu_(n+theta)
+    mu_mid = (1-theta)*mu0 + theta*mu
+
+.. index:: automatic differentiation
+
+The chemical potential :math:`df/dc` will be computed using automated
+differentiation:
+
+.. code-block:: python
+
+    # Compute the chemical potential df/dc
+    c    = variable(c)
+    f    = 100*c**2*(1-c)**2
+    dfdc = diff(f, c)
+
+Here, the first line declares that ``c`` is a variable that some
+function can be differentiated with respect to. The next line is the
+function :math:`f` defined in the problem statement, and the third
+line performs the differentiation of ``f`` with respect to the
+variable ``c``.
+
+The linear forms for the two equations can be summed into one form
+``L``. We wish to drive the residual of this form to zero during the
+solution process. The directional derivative of ``L`` can be computed
+automatically, by calling ``derivative``, to form the bilinear form
+``a`` representing the Jacobian matrix:
+
+.. code-block:: python
+
+    F0 = c*q*dx  - c0*q*dx   + dt*dot(grad(mu_mid), grad(q))*dx
+    F1 = mu*v*dx - dfdc*v*dx - lmbda*dot(grad(c), grad(v))*dx
+    F = F0 + F1
+
+    J = derivative(F, u, du)
+
+C++ program
+^^^^^^^^^^^
+
+The first lines of this solver include the ``DOLFIN`` header files
+and the two files generated by the form compiler, and the ``DOLFIN``
+namespace is used:
+
+.. code-block:: c++
+
+  #include <dolfin.h>
+  #include "CahnHilliard2D.h"
+  #include "CahnHilliard3D.h"
+
+  using namespace dolfin;
+
+
+The class ``InitialConditions`` defines the initial conditions for the
+solver.  In the constructor, the random number generator is seeded
+using the rank (process number) so that different processes will
+generate different sequences when running in parallel. The ``eval``
+function evaluates the initial condition. The first value (``[0]``)
+corresponds to :math:`c` and the second value (``[1]``) corresponds to
+:math:`\mu`:
+
+.. code-block:: c++
+
+   // Initial conditions
+   class InitialConditions : public Expression
+   {
+   public:
+
+     InitialConditions() : Expression(2)
+     {
+        dolfin::seed(2 + dolfin::MPI::rank(MPI_COMM_WORLD));
+     }
+
+     void eval(Array<double>& values, const Array<double>& x) const
+     {
+       values[0]= 0.63 + 0.02*(0.5 - dolfin::rand());
+       values[1]= 0.0;
+     }
+   };
+
+
+The next class is a subclass of :cpp:class:`NonlinearProblem`. A
+:cpp:class:`NonlinearProblem` object can be passed to a
+:cpp:class:`NewtonSolver` to be solved. The requirements of a
+:cpp:class:`NonlinearProblem` subclass are that it provides the
+function ``void F(GenericVector& b, const GenericVector& x)`` for
+computing the residual vector and the function ``void J(GenericMatrix&
+A, const GenericVector& x)`` for computing the Jacobian matrix.  The
+below class is designed to work for two different generated forms (2D
+and 3D), with the appropriate form chosen based on the geometric
+dimension of the mesh. The makes the class more complicated than would
+be the case if it supported a single form type.  The class is first
+declared as a subclass of cpp:class:`NonlinearProblem`:
+
+.. code-block:: c++
+
+  // User defined nonlinear problem
+  class CahnHilliardEquation : public NonlinearProblem
+  {
+    public:
+
+Its constructor takes the various arguments which are required
+to create the forms, and it calls a the templated private member
+function ``init``:
+
+.. code-block:: c++
+
+    // Constructor
+    CahnHilliardEquation(const Mesh& mesh, const Constant& dt,
+                         const Constant& theta, const Constant& lambda)
+    {
+      // Initialize class (depending on geometric dimension of the mesh).
+      // Unfortunately C++ does not allow namespaces as template arguments
+      if (mesh.geometry().dim() == 2)
+      {
+        init<CahnHilliard2D::FunctionSpace, CahnHilliard2D::JacobianForm,
+             CahnHilliard2D::ResidualForm>(mesh, dt, theta, lambda);
+      }
+      else if (mesh.geometry().dim() == 3)
+      {
+        init<CahnHilliard3D::FunctionSpace, CahnHilliard3D::JacobianForm,
+             CahnHilliard3D::ResidualForm>(mesh, dt, theta, lambda);
+      }
+      else
+        error("Cahn-Hilliard model is programmed for 2D and 3D only.");
+    }
+
+The function ``F`` computes the residual vector, which corresponds to
+assembly of the form ``L``:
+
+.. code-block:: c++
+
+      // User defined residual vector
+      void F(GenericVector& b, const GenericVector& x)
+      {
+        // Assemble RHS (Neumann boundary conditions)
+        Assembler assembler;
+        assembler.assemble(b, *L);
+      }
+
+The function ``J`` computes the Jacobian matrix, which corresponds to
+the assembly of the form ``a``.
+
+.. code-block:: c++
+
+      // User defined assemble of Jacobian
+      void J(GenericMatrix& A, const GenericVector& x)
+      {
+        // Assemble system
+        Assembler assembler;
+        assembler.assemble(A, *a);
+      }
+
+The following two functions are helper functions which allow access to
+the solution vectors:
+
+.. code-block:: c++
+
+      // Return solution function
+      Function& u()
+      { return *_u; }
+
+      // Return solution function
+      Function& u0()
+      { return *_u0; }
+
+The private ``init`` function is responsible for creating the forms
+and functions associated with the problem. It is a templated function
+so that the 2D and 3D cases can be handled with the same code.
+Firstly, a shared pointer to a :cpp:class:`FunctionSpace` (``X``) is
+created. Then two shared pointers ``_u`` and ``_u0`` are set to point
+to :cpp:class:`Function` s from the space ``V``.  A shared pointer is
+used so that the function space is not destroyed when the constructor
+exits. (The function space will not be destroyed until there are no
+more Functions or Forms that point to it.)  Using the function space
+``V``, bilinear and linear forms are created using ``new``, and the
+coefficient functions are attached. These forms are then wrapped in a
+shared pointer (using the ``reset`` function) which will take care of
+eventually destroying the forms. Finally, ``_u`` is set equal to the
+initial condition (by interpolation).
+
+.. code-block:: c++
+
+  private:
+
+    template<class X, class Y, class Z>
+    void init(const Mesh& mesh, const Constant& dt, const Constant& theta,
+              const Constant& lambda)
+    {
+      // Create function space and functions
+      std::shared_ptr<X> V(new X(mesh));
+      _u.reset(new Function(V));
+      _u0.reset(new Function(V));
+
+      // Create forms and attach functions
+      Y* _a = new Y(V, V);
+      Z* _L = new Z(V);
+      _a->u = *_u; _a->lmbda = lambda; _a->dt = dt; _a->theta = theta;
+      _L->u = *_u; _L->u0 = *_u0;
+      _L->lmbda = lambda; _L->dt = dt; _L->theta = theta;
+
+      // Wrap pointers in a smart pointer
+      a.reset(_a);
+      L.reset(_L);
+
+      // Set solution to intitial condition
+      InitialConditions u_initial;
+      *_u = u_initial;
+    }
+
+The ``CahnHilliardEquation`` class stores the data required for
+computing the residual vector and the Jacobian matrix as private data:
+
+.. code-block:: c++
+
+      // Function space, forms and functions
+      boost::scoped_ptr<Form> a;
+      boost::scoped_ptr<Form> L;
+      boost::scoped_ptr<Function> _u;
+      boost::scoped_ptr<Function> _u0;
+  };
+
+The main program is started, and declared such that it can accept
+command line arguments. Such are parsed to ``init``:
+
+.. code-block:: c++
+
+  int main(int argc, char* argv[])
+  {
+    init(argc, argv);
+
+
+A mesh is then created with 97 (96 + 1) vertices in each direction:
+
+.. code-block:: c++
+
+    // Mesh
+    UnitSquareMesh mesh(96, 96);
+
+A set of constants (required for the assembling of the forms) and two
+scalars (to be used in the time stepping) are then declared:
+
+.. code-block:: c++
+
+    // Time stepping and model parameters
+    Constant dt(5.0e-6);
+    Constant theta(0.5);
+    Constant lambda(1.0e-2);
+
+    double t = 0.0;
+    double T = 50*dt;
+
+A ``CahnHilliardEquation`` object is created, which will be used in conjunction
+with a Newton solver, and references to solution functions are
+declared:
+
+.. code-block:: c++
+
+    // Create user-defined nonlinear problem
+    CahnHilliardEquation cahn_hilliard(mesh, dt, theta, lambda);
+
+    // Solution functions
+    Function& u = cahn_hilliard.u();
+    Function& u0 = cahn_hilliard.u0();
+
+
+A Newton solver is created which will use a LU linear solver, and various
+solver parameters are set:
+
+.. code-block:: c++
+
+    // Create nonlinear solver and set parameters
+    NewtonSolver newton_solver;
+    newton_solver.parameters["linear_solver"] = "lu";
+    newton_solver.parameters["convergence_criterion"] = "incremental";
+    newton_solver.parameters["maximum_iterations"] = 10;
+    newton_solver.parameters["relative_tolerance"] = 1e-6;
+    newton_solver.parameters["absolute_tolerance"] = 1e-15;
+
+A file is created for saving the solution at each time step in VTK
+format. The data will be compressed to reduce the file size.
+
+.. code-block:: c++
+
+    // Save initial condition to file
+    File file("cahn_hilliard.pvd", "compressed");
+    file << u[0];
+
+The solution process is based on stepping forward in time. At the
+beginning of each time step, time is incremented and :math:`u_{n}
+\leftarrow u_{n+1}`. The Newton solver is then used to solve the
+nonlinear equation and the first component of the solution (``u[0]``)
+is saved to a file, along with the time ``t``.
+
+.. code-block:: c++
+
+    // Solve
+    while (t < T)
+    {
+      // Update for next time step
+      t += dt;
+      *u0.vector() = *u.vector();
+
+      // Solve
+      newton_solver.solve(cahn_hilliard, *u.vector());
+
+      // Save function to file
+      file << std::pair<const Function*, double>(&(u[0]), t);
+    }
+
+The final result is plotted to the screen and the program is finished.
+
+.. code-block:: c++
+
+    // Plot solution
+    plot(u[0]);
+    interactive();
+
+    return 0;
+  }
+
+
+Complete code
+-------------
+
+Complete UFL files
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: CahnHilliard2D.ufl
+   :start-after: # Compile
+   :language: python
+
+.. literalinclude:: CahnHilliard3D.ufl
+   :start-after: # Compile
+   :language: python
+
+
+Complete main file
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: main.cpp
+   :start-after: // Begin demo
+   :language: c++
diff --git a/demo/documented/cahn-hilliard/cpp/main.cpp b/demo/documented/cahn-hilliard/cpp/main.cpp
new file mode 100644
index 0000000..96c96c0
--- /dev/null
+++ b/demo/documented/cahn-hilliard/cpp/main.cpp
@@ -0,0 +1,193 @@
+// Copyright (C) 2005-2007 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2006-03-02
+// Last changed: 2013-11-20
+//
+// This program illustrates the use of the DOLFIN nonlinear solver for solving
+// the Cahn-Hilliard equation.
+//
+// The Cahn-Hilliard equation is very sensitive to the chosen parameters and
+// time step. It also requires fines meshes, and is often not well-suited to
+// iterative linear solvers.
+
+// Begin demo
+
+#include <dolfin.h>
+#include "CahnHilliard2D.h"
+#include "CahnHilliard3D.h"
+
+using namespace dolfin;
+
+// Initial conditions
+class InitialConditions : public Expression
+{
+public:
+
+  InitialConditions() : Expression(2)
+  {
+    dolfin::seed(2 + dolfin::MPI::rank(MPI_COMM_WORLD));
+  }
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0]= 0.63 + 0.02*(0.5 - dolfin::rand());
+    values[1]= 0.0;
+  }
+
+};
+
+// User defined nonlinear problem
+class CahnHilliardEquation : public NonlinearProblem
+{
+  public:
+
+    // Constructor
+  CahnHilliardEquation(const Mesh& mesh, const Constant& dt,
+                         const Constant& theta, const Constant& lambda)
+    {
+      // Initialize class (depending on geometric dimension of the mesh).
+      // Unfortunately C++ does not allow namespaces as template arguments
+      if (mesh.geometry().dim() == 2)
+      {
+        init<CahnHilliard2D::FunctionSpace, CahnHilliard2D::JacobianForm,
+             CahnHilliard2D::ResidualForm>(mesh, dt, theta, lambda);
+      }
+      else if (mesh.geometry().dim() == 3)
+      {
+        init<CahnHilliard3D::FunctionSpace, CahnHilliard3D::JacobianForm,
+             CahnHilliard3D::ResidualForm>(mesh, dt, theta, lambda);
+      }
+      else
+        error("Cahn-Hilliard model is programmed for 2D and 3D only.");
+    }
+
+    // User defined residual vector
+    void F(GenericVector& b, const GenericVector& x)
+    {
+      // Assemble RHS (Neumann boundary conditions)
+      Assembler assembler;
+      assembler.assemble(b, *L);
+    }
+
+    // User defined assemble of Jacobian
+    void J(GenericMatrix& A, const GenericVector& x)
+    {
+      // Assemble system
+      Assembler assembler;
+      assembler.assemble(A, *a);
+    }
+
+    // Return solution function
+    Function& u()
+    { return *_u; }
+
+    // Return solution function
+    Function& u0()
+    { return *_u0; }
+
+  private:
+
+    template<class X, class Y, class Z>
+    void init(const Mesh& mesh, const Constant& dt, const Constant& theta,
+              const Constant& lambda)
+    {
+      // Create function space and functions
+      std::shared_ptr<X> V(new X(mesh));
+      _u.reset(new Function(V));
+      _u0.reset(new Function(V));
+
+      // Create forms and attach functions
+      Y* _a = new Y(V, V);
+      Z* _L = new Z(V);
+      _a->u = *_u; _a->lmbda = lambda; _a->dt = dt; _a->theta = theta;
+      _L->u = *_u; _L->u0 = *_u0;
+      _L->lmbda = lambda; _L->dt = dt; _L->theta = theta;
+
+      // Wrap pointers in a smart pointer
+      a.reset(_a);
+      L.reset(_L);
+
+      // Set solution to intitial condition
+      InitialConditions u_initial;
+      *_u = u_initial;
+    }
+
+    // Function space, forms and functions
+    boost::scoped_ptr<Form> a;
+    boost::scoped_ptr<Form> L;
+    boost::scoped_ptr<Function> _u;
+    boost::scoped_ptr<Function> _u0;
+};
+
+
+int main(int argc, char* argv[])
+{
+  init(argc, argv);
+
+  // Mesh
+  UnitSquareMesh mesh(96, 96);
+
+  // Time stepping and model parameters
+  Constant dt(5.0e-6);
+  Constant theta(0.5);
+  Constant lambda(1.0e-2);
+
+  double t = 0.0;
+  double T = 50*dt;
+
+  // Create user-defined nonlinear problem
+  CahnHilliardEquation cahn_hilliard(mesh, dt, theta, lambda);
+
+  // Solution functions
+  Function& u = cahn_hilliard.u();
+  Function& u0 = cahn_hilliard.u0();
+
+  // Create nonlinear solver and set parameters
+  NewtonSolver newton_solver;
+  newton_solver.parameters["linear_solver"] = "lu";
+  newton_solver.parameters["convergence_criterion"] = "incremental";
+  newton_solver.parameters["maximum_iterations"] = 10;
+  newton_solver.parameters["relative_tolerance"] = 1e-6;
+  newton_solver.parameters["absolute_tolerance"] = 1e-15;
+
+  // Save initial condition to file
+  File file("cahn_hilliard.pvd", "compressed");
+  file << u[0];
+
+  // Solve
+  while (t < T)
+  {
+    // Update for next time step
+    t += dt;
+    *u0.vector() = *u.vector();
+
+    // Solve
+    newton_solver.solve(cahn_hilliard, *u.vector());
+
+    // Save function to file
+    file << std::pair<const Function*, double>(&(u[0]), t);
+  }
+
+  // Plot solution
+  plot(u[0]);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/cahn-hilliard/python/demo_cahn-hilliard.py b/demo/documented/cahn-hilliard/python/demo_cahn-hilliard.py
new file mode 100644
index 0000000..afa3b1b
--- /dev/null
+++ b/demo/documented/cahn-hilliard/python/demo_cahn-hilliard.py
@@ -0,0 +1,119 @@
+"""This demo illustrates how to use of DOLFIN for solving the Cahn-Hilliard
+equation, which is a time-dependent nonlinear PDE """
+
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-06-20
+# Last changed: 2013-11-20
+
+# Begin demo
+
+import random
+from dolfin import *
+
+# Class representing the intial conditions
+class InitialConditions(Expression):
+    def __init__(self):
+        random.seed(2 + MPI.rank(mpi_comm_world()))
+    def eval(self, values, x):
+        values[0] = 0.63 + 0.02*(0.5 - random.random())
+        values[1] = 0.0
+    def value_shape(self):
+        return (2,)
+
+# Class for interfacing with the Newton solver
+class CahnHilliardEquation(NonlinearProblem):
+    def __init__(self, a, L):
+        NonlinearProblem.__init__(self)
+        self.L = L
+        self.a = a
+    def F(self, b, x):
+        assemble(self.L, tensor=b)
+    def J(self, A, x):
+        assemble(self.a, tensor=A)
+
+# Model parameters
+lmbda  = 1.0e-02  # surface parameter
+dt     = 5.0e-06  # time step
+theta  = 0.5      # time stepping family, e.g. theta=1 -> backward Euler, theta=0.5 -> Crank-Nicolson
+
+# Form compiler options
+parameters["form_compiler"]["optimize"]     = True
+parameters["form_compiler"]["cpp_optimize"] = True
+parameters["form_compiler"]["representation"] = "quadrature"
+
+# Create mesh and define function spaces
+mesh = UnitSquareMesh(96, 96)
+V = FunctionSpace(mesh, "Lagrange", 1)
+ME = V*V
+
+# Define trial and test functions
+du    = TrialFunction(ME)
+q, v  = TestFunctions(ME)
+
+# Define functions
+u   = Function(ME)  # current solution
+u0  = Function(ME)  # solution from previous converged step
+
+# Split mixed functions
+dc, dmu = split(du)
+c,  mu  = split(u)
+c0, mu0 = split(u0)
+
+# Create intial conditions and interpolate
+u_init = InitialConditions()
+u.interpolate(u_init)
+u0.interpolate(u_init)
+
+# Compute the chemical potential df/dc
+c = variable(c)
+f    = 100*c**2*(1-c)**2
+dfdc = diff(f, c)
+
+# mu_(n+theta)
+mu_mid = (1.0-theta)*mu0 + theta*mu
+
+# Weak statement of the equations
+L0 = c*q*dx - c0*q*dx + dt*dot(grad(mu_mid), grad(q))*dx
+L1 = mu*v*dx - dfdc*v*dx - lmbda*dot(grad(c), grad(v))*dx
+L = L0 + L1
+
+# Compute directional derivative about u in the direction of du (Jacobian)
+a = derivative(L, u, du)
+
+# Create nonlinear problem and Newton solver
+problem = CahnHilliardEquation(a, L)
+solver = NewtonSolver()
+solver.parameters["linear_solver"] = "lu"
+solver.parameters["convergence_criterion"] = "incremental"
+solver.parameters["relative_tolerance"] = 1e-6
+
+# Output file
+file = File("output.pvd", "compressed")
+
+# Step in time
+t = 0.0
+T = 50*dt
+while (t < T):
+    t += dt
+    u0.vector()[:] = u.vector()
+    solver.solve(problem, u.vector())
+    file << (u.split()[0], t)
+
+plot(u.split()[0])
+interactive()
diff --git a/demo/documented/cahn-hilliard/python/documentation.rst b/demo/documented/cahn-hilliard/python/documentation.rst
new file mode 100644
index 0000000..d5f6538
--- /dev/null
+++ b/demo/documented/cahn-hilliard/python/documentation.rst
@@ -0,0 +1,301 @@
+.. Documentation for the Cahn-Hilliard demo from DOLFIN.
+
+.. _demo_pde_cahn_hilliard_python_documentation:
+
+Cahn-Hilliard equation
+======================
+
+This demo is implemented in a single Python file,
+:download:`demo_cahn-hilliard.py`, which contains both the variational
+forms and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This demo is implemented in the :download:`demo_cahn-hilliard.py` file.
+
+First, the Python module :py:mod:`random` and the :py:mod:`dolfin`
+module are imported:
+
+.. code-block:: python
+
+    import random
+    from dolfin import *
+
+.. index:: Expression
+
+A class which will be used to represent the initial conditions is then
+created:
+
+.. code-block:: python
+
+    # Class representing the intial conditions
+    class InitialConditions(Expression):
+        def __init__(self):
+            random.seed(2 + MPI.rank(mpi_comm_world()))
+        def eval(self, values, x):
+            values[0] = 0.63 + 0.02*(0.5 - random.random())
+            values[1] = 0.0
+        def value_shape(self):
+            return (2,)
+
+It is a subclass of :py:class:`Expression
+<dolfin.functions.expression.Expression>`. In the constructor
+(``__init__``), the random number generator is seeded. If the program
+is run in parallel, the random number generator is seeded using the
+rank (process number) to ensure a different sequence of numbers on
+each process.  The function ``eval`` returns values for a function of
+dimension two.  For the first component of the function, a randomized
+value is returned.  The method ``value_shape`` declares that the
+:py:class:`Expression <dolfin.functions.expression.Expression>` is
+vector valued with dimension two.
+
+.. index::
+   single: NonlinearProblem; (in Cahn-Hilliard demo)
+
+A class which will represent the Cahn-Hilliard in an abstract from for
+use in the Newton solver is now defined. It is a subclass of
+:py:class:`NonlinearProblem <dolfin.cpp.NonlinearProblem>`.
+
+.. code-block:: python
+
+    # Class for interfacing with the Newton solver
+    class CahnHilliardEquation(NonlinearProblem):
+        def __init__(self, a, L):
+            NonlinearProblem.__init__(self)
+            self.L = L
+            self.a = a
+        def F(self, b, x):
+            assemble(self.L, tensor=b)
+        def J(self, A, x):
+            assemble(self.a, tensor=A)
+
+The constructor (``__init__``) stores references to the bilinear
+(``a``) and linear (``L``) forms. These will used to compute the
+Jacobian matrix and the residual vector, respectively, for use in a
+Newton solver.  The function ``F`` and ``J`` are virtual member
+functions of :py:class:`NonlinearProblem
+<dolfin.cpp.NonlinearProblem>`. The function ``F`` computes the
+residual vector ``b``, and the function ``J`` computes the Jacobian
+matrix ``A``.
+
+Next, various model parameters are defined:
+
+.. code-block:: python
+
+    # Model parameters
+    lmbda  = 1.0e-02  # surface parameter
+    dt     = 5.0e-06  # time step
+    theta  = 0.5      # time stepping family, e.g. theta=1 -> backward Euler, theta=0.5 -> Crank-Nicolson
+
+
+.. index::
+   singe: form compiler options; (in Cahn-Hilliard demo)
+
+It is possible to pass arguments that control aspects of the generated
+code to the form compiler. The lines
+
+.. code-block:: python
+
+    # Form compiler options
+    parameters["form_compiler"]["optimize"]     = True
+    parameters["form_compiler"]["cpp_optimize"] = True
+
+tell the form to apply optimization strategies in the code generation phase
+and the use compiler optimization flags when compiling the generated C++
+code. Using the option ``["optimize"] = True`` will generally result in
+faster code (sometimes orders of magnitude faster for certain operations,
+depending on the equation), but it may take considerably longer to generate
+the code and the generation phase may use considerably more memory).
+
+A unit square mesh with 97 (= 96 + 1) vertices in each direction is
+created, and on this mesh a :py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` :math:`V` and a
+:py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` space :math:`ME =
+V \times V` are defined:
+
+.. code-block:: python
+
+    # Create mesh and define function spaces
+    mesh = UnitSquareMesh(96, 96)
+    V = FunctionSpace(mesh, "Lagrange", 1)
+    ME = V*V
+
+The space ``V`` involves first-order continuous Lagrange basis functions.
+The mixed space is created using the ``*`` operator.
+
+Trial and test functions of the space ``ME`` are now defined:
+
+.. code-block:: python
+
+    # Define trial and test functions
+    du    = TrialFunction(ME)
+    q, v  = TestFunctions(ME)
+
+.. index:: split functions
+
+For the test functions, :py:func:`TestFunctions
+<dolfin.functions.function.TestFunctions>` (note the 's' at the end)
+is used to define the scalar test functions ``q`` and ``v``. The
+:py:class:`TrialFunction <dolfin.functions.function.TrialFunction>`
+``du`` has dimension two. Some mixed objects of the
+:py:class:`Function <dolfin.functions.function.Function>` class on
+``ME`` are defined to represent :math:`u = (c_{n+1}, \mu_{n+1})` and
+:math:`u0 = (c_{n}, \mu_{n})`, and these are then split into
+sub-functions:
+
+.. code-block:: python
+
+    # Define functions
+    u   = Function(ME)  # current solution
+    u0  = Function(ME)  # solution from previous converged step
+
+    # Split mixed functions
+    dc, dmu = split(du)
+    c,  mu  = split(u)
+    c0, mu0 = split(u0)
+
+The line ``c, mu = split(u)`` permits direct access to the components
+of a mixed function. Note that ``c`` and ``mu`` are references for
+components of ``u``, and not copies.
+
+.. index::
+   single: interpolating functions; (in Cahn-Hilliard demo)
+
+Initial conditions are created by using the class defined at the
+beginning of the demo and then interpolating the initial conditions
+into a finite element space:
+
+.. code-block:: python
+
+    # Create intial conditions and interpolate
+    u_init = InitialConditions()
+    u.interpolate(u_init)
+    u0.interpolate(u_init)
+
+The first line creates an object of type ``InitialConditions``.
+The following two lines make ``u`` and ``u0`` interpolants of ``u_init``
+(since ``u`` and ``u0`` are finite element functions, they may not be able
+to represent a given function exactly, but the function can be approximated
+by interpolating it in a finite element space).
+
+.. index:: automatic differentiation
+
+The chemical potential :math:`df/dc` is computed using automated
+differentiation:
+
+.. code-block:: python
+
+    # Compute the chemical potential df/dc
+    c = variable(c)
+    f    = 100*c**2*(1-c)**2
+    dfdc = diff(f, c)
+
+The first line declares that ``c`` is a variable that some function
+can be differentiated with respect to. The next line is the function
+:math:`f` defined in the problem statement, and the third line
+performs the differentiation of ``f`` with respect to the variable
+``c``.
+
+It is convenient to introduce an expression for :math:`\mu_{n+\theta}`
+
+.. code-block:: python
+
+    # mu_(n+theta)
+    mu_mid = (1.0-theta)*mu0 + theta*mu
+
+which is then used in the definition of the variational forms:
+
+.. code-block:: python
+
+    # Weak statement of the equations
+    L0 = c*q*dx - c0*q*dx + dt*dot(grad(mu_mid), grad(q))*dx
+    L1 = mu*v*dx - dfdc*v*dx - lmbda*dot(grad(c), grad(v))*dx
+    L = L0 + L1
+
+This is a statement of the time-discrete equations presented as part
+of the problem statement, using UFL syntax. The linear forms for the
+two equations can be summed into one form ``L``, and then the
+directional derivative of ``L`` can be computed to form the bilinear
+form which represents the Jacobian matrix:
+
+.. code-block:: python
+
+    # Compute directional derivative about u in the direction of du (Jacobian)
+    a = derivative(L, u, du)
+
+.. index::
+   single: Newton solver; (in Cahn-Hilliard demo)
+
+The DOLFIN Newton solver requires a :py:class:`NonlinearProblem
+<dolfin.cpp.NonlinearProblem>` object to solve a system of nonlinear
+equations. Here, we are using the class ``CahnHilliardEquation``,
+which was declared at the beginning of the file, and which is a
+sub-class of :py:class:`NonlinearProblem
+<dolfin.cpp.NonlinearProblem>`. We need to instantiate objects of both
+``CahnHilliardEquation`` and :py:class:`NewtonSolver
+<dolfin.cpp.NewtonSolver>`:
+
+.. code-block:: python
+
+    # Create nonlinear problem and Newton solver
+    problem = CahnHilliardEquation(a, L)
+    solver = NewtonSolver()
+    solver.parameters["linear_solver"] = "lu"
+    solver.parameters["convergence_criterion"] = "incremental"
+    solver.parameters["relative_tolerance"] = 1e-6
+
+The string ``"lu"`` passed to the Newton solver indicated that an LU
+solver should be used.  The setting of
+``parameters["convergence_criterion"] = "incremental"`` specifies that
+the Newton solver should compute a norm of the solution increment to
+check for convergence (the other possibility is to use ``"residual"``,
+or to provide a user-defined check). The tolerance for convergence is
+specified by ``parameters["relative_tolerance"] = 1e-6``.
+
+To run the solver and save the output to a VTK file for later visualization,
+the solver is advanced in time from :math:`t_{n}` to :math:`t_{n+1}` until
+a terminal time :math:`T` is reached:
+
+.. code-block:: python
+
+    # Output file
+    file = File("output.pvd", "compressed")
+
+    # Step in time
+    t = 0.0
+    T = 50*dt
+    while (t < T):
+        t += dt
+        u0.vector()[:] = u.vector()
+        solver.solve(problem, u.vector())
+        file << (u.split()[0], t)
+
+The string ``"compressed"`` indicates that the output data should be
+compressed to reduce the file size. Within the time stepping loop, the
+solution vector associated with ``u`` is copied to ``u0`` at the
+beginning of each time step, and the nonlinear problem is solved by
+calling :py:func:`solver.solve(problem, u.vector())
+<dolfin.cpp.NewtonSolver.solve>`, with the new solution vector
+returned in :py:func:`u.vector() <dolfin.cpp.Function.vector>`. The
+``c`` component of the solution (the first component of ``u``) is then
+written to file at every time step.
+
+Finally, the last computed solution for :math:`c` is plotted to the screen:
+
+.. code-block:: python
+
+    plot(u.split()[0])
+    interactive()
+
+The line ``interactive()`` holds the plot (waiting for a keyboard action).
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_cahn-hilliard.py
+   :start-after: # Begin demo
diff --git a/demo/documented/csg-2D/common.txt b/demo/documented/csg-2D/common.txt
new file mode 100644
index 0000000..81d818c
--- /dev/null
+++ b/demo/documented/csg-2D/common.txt
@@ -0,0 +1,21 @@
+
+This demo illustrates how to:
+
+* Define CSG geometries
+* Generate meshes from geometries
+
+The domain looks as follows:
+
+.. image:: ../csg_boundary.png
+	:scale: 75 %
+
+and the mesh:
+
+.. image:: ../csg_mesh.png
+	:scale: 75 %
+
+Problem definition
+------------------------
+
+We do not have any equation in this demo. The demo focuses purely on the geometry and how to generate a mesh from it.
+
diff --git a/demo/documented/csg-2D/cpp/CMakeLists.txt b/demo/documented/csg-2D/cpp/CMakeLists.txt
new file mode 100644
index 0000000..374f8ee
--- /dev/null
+++ b/demo/documented/csg-2D/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_csg-2D)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/csg-2D/cpp/documentation.rst b/demo/documented/csg-2D/cpp/documentation.rst
new file mode 100644
index 0000000..d5fa92e
--- /dev/null
+++ b/demo/documented/csg-2D/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the csg 2D demo from DOLFIN.
+
+.. _demo_pde_csg-2D_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/csg-2D/cpp/main.cpp b/demo/documented/csg-2D/cpp/main.cpp
new file mode 100644
index 0000000..6788752
--- /dev/null
+++ b/demo/documented/csg-2D/cpp/main.cpp
@@ -0,0 +1,76 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012
+// Modified by Johannes Ring, 2012
+// Modified by Joachim B Haga, 2012
+//
+// First added:  2012-04-13
+// Last changed: 2013-09-12
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+#ifndef HAS_CGAL
+  info("DOLFIN must be compiled with CGAL to run this demo.");
+  return 0;
+#endif
+
+  // Define 2D geometry
+  // Rectangle r(0.5, 0.5, 1.5, 1.5);
+  // Circle c(1, 1, 1);
+  // std::shared_ptr<CSGGeometry> g2d = c - r;
+
+  // Define 2D geometry
+  Rectangle r1(0., 0., 5., 5.);
+  Rectangle r2 (2., 1.25, 3., 1.75);
+  Circle c1(1, 4, .25);
+  Circle c2(4, 4, .25);
+  std::shared_ptr<CSGGeometry> domain =  r1 - r2 - c1 - c2;
+
+  Rectangle s1(1., 1., 4., 3.);
+  domain->set_subdomain(1, s1);
+
+  Rectangle s2(2., 2., 3., 4.);
+  domain->set_subdomain(2, s2);
+
+
+  // Test printing
+  info("\nCompact output of 2D geometry:");
+  info(*domain);
+  info("");
+  info("\nVerbose output of 2D geometry:");
+  info(*domain, true);
+
+  // Plot geometry
+  plot(domain, "2D Geometry (boundary)");
+
+  // Generate and plot mesh
+  std::shared_ptr<Mesh>  mesh2d(new Mesh(domain, 45));
+  plot(mesh2d, "2D mesh");
+
+  // Convert mesh domains to mesh function for plotting
+  MeshFunction<std::size_t> mf(mesh2d, 2, mesh2d->domains());
+  plot(mf, "Subdomains");
+
+
+  interactive();
+  return 0;
+}
diff --git a/demo/documented/csg-2D/csg_boundary.png b/demo/documented/csg-2D/csg_boundary.png
new file mode 100644
index 0000000000000000000000000000000000000000..ee7cefba72f4d606177cc1e5bf7f5b1910e83fc7
GIT binary patch
literal 3944
zcmd^C`#)4$A0DLkFfn7Q2~%up4skTD4N0|)>ls2)ii*aiTtZFpR#I)o<TAT*8%-os
zQ*(51<a#8bNs~Du6e;&|2_q-P@b2n;e|Z0f_lNcQtnXTDf7i42=ULD5T^u)8hm}ei
zN*D}grIRDw1A~#@hr!4pfIK=P+slz)FshrK=sP{5`4ey5qx!|G<63_keMj;SxR?%l
z*{{#OB6q|v8QxztVqHKHY_Rpe%<UcxKi)EO0<*(w>H54Prj8He<J$k<+9G=Nx^Jwv
zL#lV$UTmLO!V_F(X1R^0&MZB^?C#=AMk)^}81~Mz&l($?*Nac;7NwsL`pP}DWFR~L
z%2z)?tw{%-x>%Id_A&6PW=_?YrO}E_L)RGL<?`6gcxcYIv#}5FOL8H)%)F|+8%U{c
zVRqVeHpXfZS|85*McD^{@Kfjg-xkZletn_&AtEucYjQOq7K9@P!lzF}%I1qU`)_YC
zlAR|c{|12l@A`v^JNAE0DUVR<gpu|lt;O_B!UyM7y=n0|_^T~1wH8yx!uvc4PL9B{
z{(nuIdQDFq_X+6x6PGwIvm&wkK#(arRh^uaJE=Di6_XZh&z$WsZ_Zw)Qv90U-Sn0G
zbRb}sd#Ego%yqBbaNJ_cH8UX>U*fv)0wK~S>D{~ZNj%6FX5&jNd`Z>5^oFmY-p9#N
zqADyn=B^e^qjx*MpBqHVO1u-yKb(f&D1TEw2b}9WtOz3k*Xk;R!TWurnG#Pm+Jl#m
zO7x%UE3bKB3a$AVQDLoY$kxe9TEP~^;Y+BpN&qWllS_gjk-v}D%0KaYK}%*Hj3`E!
zMeH0z8VS(7;o$esGf=sIZrSXnz1zE2Rh^U#AG~{wgE*&`xo!3Ly16}Aj->|O+nr(i
zdwh}8SNCv>%y*Y@dy37ReVdJAp67*>b)S>@JKlxy9#^DpQ_=i+7Ih;RCrBxDKjv<u
zwI^cM+N8h&a$Mcqv3574HnhSw_5*e6Z~0<jXiD)`GjRLAHuaV7qTZ3Z{he9N&!)7D
zbWQZ1ELmH}H%u|nR8{1hKaSzzcvtWys;Y_~U)wyXfstJ&4(3dLn=p0lnTfG@KIPu>
ze1;x#h88JdW5L{k8f)9{U2lyc+t3t0Z7%LB6&xgnru1z@*E?m{^D=DP7I<4!bNzIf
zkT2=ZZob4uG?x_Bzj(4FJ?$tD;Qbvq(6QG3eM&<C17;K&9(z2W>L5|(Asoc1OHNWz
zlb@B!L8iZo{ZF=dQrCe@<|YySjYU;UlX}xgC)N12)N-g*oA^;{%^S8jkpU+QdUTcA
zjvi1hNEXvY!Og5^wf9T~(&eSU@CZCWo$YYxEaPi!fDzLW5&@owYAGj;fCVQvX)=EX
z#WXibwa@v+<QiFYE(a;^Dy^&Osco8Pzza7VF16RqBU^aDSKVA2&-y0y-VN|VypqRi
z&7f$u!fcIr+c8hkM92a!2(A&^Y#VK7MbhRjH$7*-HNz2!ve-`~Ic~+dlt<Ia2r1gk
zaR|+;1%S2!?WDs4xChc?B+pudsc&sKxRC-apAJS8^;MNu#^abeO#FcMbALT14IDh3
zqf$ceEytldx6njT%$Ny`mnt8+?`<@BFaZz6y7!$Pee&2Q(b?RE^-3_ck`V?YL8A-M
zU)^?X4X3t#8GGOH(Q{zqpR8K8;IctSbl{^0pSwSw8VeuN*h3SPhmD`=rCJY=!R=9}
z5LWPk%%bUJyfk0ddr>Xq{n>32EXY+~;Z3v!cLAVk*P*)RwMsD%aA6fLet`~D29cTR
zXs=-!`)SV^rhKnw0yLsmaYSb@VVj9CD-U5a;2x?<Nq7QOYf6wd(nO=?E@mmdrajc}
zk>m0(&Fd)>htC=lqWs7kxUyb15s3(rns!R5tD;`e9pOmiZ0ggliQ!m6`{SQswmncu
zC8+rZZLw50Pce<B10W&N3Ja=No=dBLsn=n5p`8Km@Cf(G$JdXKlN7HK>&L5%9(GqA
zS|)Bd0zp7=K$<v|yb-2aj@`N$4}eJaD|d3P<BP}Gh(;WxzDAe?`LWC_!DS_-R@wZ*
zR&+of=1_mVL%BI}nKuYi^+{n*%5HPoj(#FNW_%Bu>&hlN=vkR~O2E-oMc(UPFaXo2
z2>F}8z!-vx`-b5;y1j~P-RYt%r|0ynRF?Z3#~?6D4T@8~pKs}{;qtUfZ=qo{*p*W6
z!_STz5vEc$z?Btl%X3aNGElrzjjK(uSU;n1FNF$S7*jxjE4vI8A{+p@+Ai~K1TT+d
z<0<~Ws}iWI0)NhPXfCQ#H}LX35tR%J2-tB9%1R6gI1H2v1OB_fM(*c=RH`PpOxqk3
z*H`J`g7g@6fSjWXP#W<&uFe($A|yj50szDauwdP`%;yC<uy@6wmG8m-d}0Z$ZLzHP
z{2wExDod;n(<JS?2@uAE2*sWGH0)xBCOob4J>hpK@zq4R_2}t;&ivdi6`yb-mAd*z
zUPgl(@B`c*M%gJpPuCx%zP4U=?DY>QemX{(a&xYLTzG{S<tKVZ0}7>nniKj13YBCF
z)~y4V&H4M9{e-$~u75udhN+}-p<EB4-p9vCL1O8Wi{OX-JN2xCO3~k(mAa;WmkPUU
zawL{;mXE*P_Artrmg!*bO~32e9JebZ`v(c#3S~AesL?Ld3epjaM)l4H`I`L-e(&v&
zywuwPvsxP%uzLF2J}-y7k#>3@l$B->_&)pkD-&XUfse65r;pw>9!e7yN)ru~CKtxZ
zd`DMcCMr>0o17~WuQqj~(XQ}0RP(*!IF>t1HNT&a$*|vDYNga+XG{nTVx@`s+1fDv
zem-*;Qb+lY@L2Bk^hATexIq~2*!&o)1fndz8r5nMkM|$Yb9!y!48rta@asNOVNj<Y
zf$;Q5sKrCcl|<RC&kWdS{7cTNtMQRY2n8~FV_|VU7`-Pe7!sPuoCqGm#WN3+2T?KJ
z9Hv?A8(RMGWpQBB&QDoDWgi0^3nUM21qTx}JNK2#dM`zM!h&CL@xt^-gbgES5+E<Z
z*}qIxq&M)=xIDbb7Ko{H6E&}05mP^nU2kBUcVd<Bk}lEOPiN5B7QFAr#Ys?+y^@Ep
zs47xEsz2!c(pO<?<O=z&CmzYy3TD{;<iWkyOOHES@9BFGWJMOf_PTfU-uxTSKFzE*
z0Ql&Sx2Z$YPXPcbn6<l0-FmBVAS#%h$1+6o85dw==c(%816v)v)dsW`EFDDJM!rY9
zL)Qe*h@h>yk~gZhPf)LDb`yD^5IJ}g&o+8nFj!XVkgyjEZVvALV8wnd$W)T9$RS8g
zRFwr84wn`#aFEQHeU3LyRnyj^tT9A>E06K!DW3b_mM*>SVdy!vf&wj~o^h|gReKT-
zE#5u*As8&(z4N<=+;Axn7u6{2K~8s>H&>6h9kK6?t&z}0)&Ehu0_M{-`BZ|5yz0?8
z>q)C7e;wvBi<T+BO`=2?iR_|1d3slSAnImL>t|Kvb;km&hUQU3$s)Qa3$>Vbl@+Dh
zx~2pZO8En0{V#Wo6^WqkiFpko>M$Gt96%kgRiNEQfGB=MecdRo#x*n(wsP^Zd$g{x
zJ`p5Zt^XB~7Cm{~YjArb%(#2hzdGeblZO8JR#x%rhEpNe_1dD&UOZ~<!j}|xH+~#c
zSKUk_-x?DpO0g8kCeJX;n-XwS>Q$`M90Y(`{R~Bg^rUY>ttn$jG?K=B__jsYcKujY
z*Tk)`JqQ=gv}>&Dxt+Joc!gK*+OUuiTrLF`Kd}RS3=SNzUd3F4))Z`qgwJTTaS#%P
zesf4*28Q5DOU;_a&5MZxt=IBSE_@Kc3bSG{XP(c`yt6*TUT~54MG&p$xCch|ciCKn
z*%#aG0YTz~>DX|MHCk|udf05-qM6_KhPHWE*|<ibhilIR&WyBOOm{4_Ht}JXkTo7Q
zxfz262MgmfoJjXJ{9(w>9vATN9%T>zBAZ`(5@1O-!k#>s^9>6sYqOQ3Xbpixf||%5
z0Fyv=`WP|V=74g56O6=Pd7?DC)qexBQ4Lz-q+;ObfHQbc29rA3f3KMSC0#*EXc3i0
zLn4jfzF(ZQ4F)=?#mi+M=U-6%Ib+GcysX4IhfuP9J=wLnbw`IY;H_y%zL9@Hcpa^E
zqiC0lPM9IHM5trjiXD)-{n2RE^SngqI!NAoTebbOTVwqvFUxFn{2y^AIySvaiPdHJ
zZN<d^pnCctZYL|#C@?45d8x`Mdsw=3Y4J)5{_1|-g@5LK?8d7SD?aAVUE$%OhCPJq
zl<dG8%69@HD?F)&vGv;_V9U4t!oa@I-}>I|*HlG$J=c1R<hpI)(gheFd%8SAgU}sD
zH$VDu?^fN~CU4cH!`dKBN{ers>&&U$QMlzC%U;4<BKa;&$h3-<bdqwXHi0l9O*`GW
z@i;Hpp^%(aH5OxbPu<C{6~<FeXFi+rYDTQGxZjPS+Wxy+{QtFyrDt=K%^9~BHlr_S
NjFX)!y$Cvd@!#Vm;Q0Um

literal 0
HcmV?d00001

diff --git a/demo/documented/csg-2D/csg_mesh.png b/demo/documented/csg-2D/csg_mesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..d521012f89908a54c9c3c357d0d1d5a17164ecc9
GIT binary patch
literal 16162
zcmeHu<73><7jBZq>c+-y>@;fBrm^jfZL<v<+qP{sc4OOaZ2Ru__cz@8?!Nu(%<RmZ
zGc(V5&T~Q)<iydC36Y_opwJ{GM3kVQU^JkhpkokWAYb0pLnoo2$e|=f1XbKK&N5FN
zL2c+_<E3x9ziCi@vJJ)GJpuD*JBRAhWuU56mD^0?I`LOl^`sZ}YizV2185|Eyxl>@
zfqKUb06;+{!2@BTd<z8;p`r9G078)83IG4+|0{d)ud9m`s{6#LW8?k$>1j9nIXPkG
z>hVo)`;6%W3F;Ld5!g*~StvIk^M3uFmF?d0%B}PGC_z^^do<Yci_RExOP9FG=H=uI
z6hGRc)${AC!LVwfoC<wo;PEe6GP0w$Z<%ryt25g%tsfL4kt%fi*}Rwx@pg8Il-*E>
zz#nAOOsbhTEi5kU<sDs{DrawR_gIZ62VyBRHZg-nt-7;Mo^9Mvj{wF`3J1Sr7p-_R
zXSVHUD{Z6?Ze&fP23NBczkjz)Gn-754rOtU+Wq3?U9@{uRP^l4;J@i);+u>R4%kAl
z1S4Hs2w+Qlrd+Qg88Pr(IX^qRoo3IfPgGHKVIm2TI%L4?kq1E0d9^SkmXY%qVr@H1
z4eow^8f$_tCMihmY^us9%HWoRW<&%sM%uoYitwzMx>!jxI4e)-wp*&nEv3yXw@!bx
zq|OV0I>qR9RQdX0JUgM-6CIsyig=~dQHI<U(@j8>csz?Kw>)%fM@gp5O+0hduLfd7
z{uxk%TzKOopHQT|?R;$A6568KF?|Pa?qg0?;1YElAAESYy~0S`xTWgO&OWl2IAUN-
zsua<H)y}_s&X7|)C>EB^AfCQ{%a{no=(1W2ZDqd|YsS1v>mBvC!q!cNOd*t_N=TA5
zr7h|%9L$`2vBR=VSIVR^0jJ!3LAWf1oo|oskWrK{aghFrU@K4%ahp>SX{~8BjrrfA
zwr-{oerTO3ks~P5!<x>lo)uqVcAeT85U;|{tR#fKod{_@AM+!{m{NfXi1Hb!>a_DN
zNvT!4^JHRZeLl|-zO>N-tRmZ*TQkGM)DWdvxooOO0i}x?0MJFi03uC~74%B^p`|1w
zdaXDri8Sm$=hc}VDf3E*$1_m3=Yt=M+9mD_q1#bmN4ptvFmjnN9DC(CqFFgPiirB?
z+M*3P&m-;`r&E$!9Jz#n?3KM=_eHJuNqo&9X3rwBf-{BV_g~@<n^`D*7UjfJjK>JP
zd3rC3gWZ+Ea|tI3TsMw5rMYMHJuv;`F2|gF=Dw!1qO>w`@P0M8>)LYrnJ?Q8FTrZ$
z1C%^^=ISW^6#l9(8Mk}Kf-d~AdNjzNExeoErsJ}7-@njYtcTZq<0pzJA8Ku~Y(M3Z
zO0D@rmhE>@YYXJWl!zGF&{c}Gl5x7?AO(`V6|BdkN<>(V)*0^tbboiL8Tx*yKmsi&
zJ>AgXZ*4{PU!N$w+wH9}7_yb!(TSxj<t#iWWW%1Ze)#hRIo`LlQgbc<`ROzQE;$lP
ze{%`y%El+@U`|p^!A1;aX}e%4mMsyZ8(o!X!l``W9X%PPNvsvM3{Ybyi66c-55zMO
zxUl_dNYYz>y(on`C2pNIGgq=g8>NG}OpPt9fPO+4yZ&j!K>Z_oRHpmd{Xi^Py0e;q
zp!l`_iL1;F^}OCzBluE<Jm7MQ8@aZ{fLvAe(&falv||0e&9Hwml_Xwg>cjVb?Odyz
zcuh&fBRnM8eFvpNm-4(9?vcShvUm6T%Hd{R^#=6n$8yYr`h3{mQ^G7h;7|guOt=Td
zvlR7{<H{(nK8}gnjlXDeauxsI%12RC@;up$opB=68b$zsG-0+>d8tCW#Y#hGuzJy%
zd(7D+%+0h0tg()`<`aJES_qOl&yO&W|0vD1<a88|wQm5B;zIhNqwU1xO;*BjC{?lF
z$p~}8YFQQpsfaa0S@579StfL1w?bT|Ii)1o6i0DRf|*t<cN6;0-QC|vAtvtRG36z_
zarCWo1w%Aa6s;;{*%C`*qZ*G&kh+IQ8xOpwErn$Q^2dRBCSGH35btXunf)!rDzv#}
zevyD>;^pbV(TP@CiF)x;RKM#|@vNJXgf9YgIDiy!y|eDbt{kbaWLHIb-Nk9*3v6O@
za~K8|cKr-Wn$jS;GFX!!A2;!>=BWI!dv(=@KUsREX_f3HROIh>ffFwCMOtU#nrq>;
zf=dO6QD_s&iy=1q!~r%|Pd}MTHzc(FWH5(9|8;$q#SNP&MEQ(57HAYNaQ|4QzWjup
z+M+!!E@KYl$Mzv<LawoC^lUpb>-XVOr5SNKCX;1Fq;6gIaKU12z_&<6&pnV^q=+<Q
zNk~n;UmJ2cg(}-ry<<<BtaV`-u7Glf1qeMFQF>ITi6+nEIMrQ&)hCQ4>xXs&m+L$l
zG2dUEyRRwwqZuz|3VGvB*CgnCPm!11R6Fz=JAcRj+x&G4^#OV5-!V5Chj7(!C^z#Q
z$JlHLV%O)Y$MP0SNpq+qDLAdb^l{rmp3THE(%_Mv7d@kbb&;naj263}6l~|)b_UUa
z_Xt}#t)>pj%%=>08)K=|Y;q)<YnoMu22D3Eq;GwHhYrtX)W!R9We4kC+DQ&XVD=SY
zV_2Kj%}~OMs%z5N`svWO*)Jbn8!`LxL{5Dje}ye8+OCLN*M$T-y=az<y^AoVhu}3x
zjS5ww=ZMZHG~6lfx;@z8H8>QK?e%;4_dz`(K+I5ml;ojSb{08zU~y+R#MBa5aXo{s
zo_^H?V*qk~ID^$wFXMB{2MQ3ZuM|v3h#+QC1Rp!g`!qv&{6O5!##HaAtaa7m46Cl`
zQTTh@QnzrSmtRgsL!{NuIunaZP?YbQ?qkx?ShBU|Z6>L`2z`zyg!mDa8}hVpef&UF
z#x}>@EYfIy0J9zkOCw$2(vC{UJQh2dPM3{EW@X3p$u(=J{~pCw>2VP9u6~5P?PtxZ
zlMgGHg=SKL_izVy-5P7!f?doVTd}Aqpy`TdE7>NV_yO2hdyXxloei|R4jgHc^rdPZ
zA9AR15gw0&kOi}ZeD!pzp^|QWI~-MJ^8?eiGJp%eo^b`TI8X{owTARcW?G$L1Amv6
zb+W}J%<QvK4`*is1+PyA5=1ReP1<;Q0~Y!|{crEu%;WPj>1kJDbPB8pCmO#f&56{P
zm1gfpQHK+1kdX;IBZl2d(T5~-zrVI~?uWD^$e;>SF6Y6uwIN{^M#01VacO*TBUJ0|
zf&vEUiKyM*v}_Cy(P#-b=E?^d5k4dRtbCWczcsFqEDu}}*w)Qba_P2&FQC^8O1%F=
zilC)dD1<T(sPKMT_6Uk6=J|ck)}Eh>qyYEdU<=Bc19d@1!sg7L;YvxZnQ>({RE*2?
zdTD%IjqNWj#H$i#mCS_=A7a@8l{`7Ctq$c?jhgr(74lm6g0_*-*xon+0B@9|`(#42
z*<IN5k7cy>+$NvObokLW)L{d$e_!v3lp8t`2z)={Fg}AZ=<2+;rma@Sdqb$eVR~x#
z5}?E>p~r8KbA~e)R3F}^+TRBxbi}lKFCJ}n_PKNLGbxMPb@NY)>8k^+WCba|pd>CY
zDAKKOe9GwI=CW;`Phj!BuUp|iiIP+IMdh9Adm9cYm{->UcV$gBb2hKQ>6RepR!nDS
ze??L`5o|3#35^0}$=!X*fOg}nKN)I#F!;&RB6qjIRL^3L8%~#`vrN|Xs^&p868emh
zf%OI)wxb&F+n_DH@F<+~(W{*VJyJoT-YkYjTv{e9Ppu!*G_@C#(ltugMg0P6%35VD
zD`TfFuCq~L+4%3=nb&Ep;^I!=?Id6zDtTLWl`6Zi#)^@}9v5B9(1bxZp39+eJ)!}G
z{?Js$P4x%?Tg{L4r1npki<a>-9J%JbW!AF<uL75FFBT>-t8;M4RPPovr|kzWNVQ2f
zc`M4t`K0TUD6R%Sv7!kfJ`}V{pv|*m)gfo|jU$#Kt1*}6cUU%;s=7CTEqEe$1|vJ6
zjdeZ+uQ;m=&OYb9ReEk@x-?vHW<q&FCP3uI$X$xNEfP4nz*;8o`QB71NX@`%;yAmE
z<!fJ*vHZ3y2IX`?4rX)O=fU*n5%H!$87l*;m7G9(y%55{mn{Ugek+gTLP}rzyk0W~
z<4yVB7e(~QvE6cLp>ysMrEo^0J&&4+T*r>IpZga~;{`^Z_&52!rjXEPOOMtZ4N>J9
za{QYe)(3`QpQ9+|+at7Yd-k}Go+|Bc)+>zBSEfuJGf}1}d*d@AZiI1;_p-zzg(d(^
zKF$7-(p;#Irbc+ttB6dOrTd(j*hP%KDS+*%>C*Y_rTkQSik|g;XMU0h@9z8xHnw;D
z(JCH0D=Q?M{&19@#MU(^DK|wG6c6sx*qe;GnDE9$Gmh-f;*N~8PKf!o<c-^sOsx5L
zoVU3Nx}3{<kihc6KY5Z0bBlfNADU|c$R7UQAJD7oXQ#a0S7xZGV^ExYeXXCEZB6-3
zMl?Yf{VlW|twil;!chCZEO|w&v+tZe&gvM!VMjmM)lzz=&9{B5&l`dtn8Dt?p%mqE
zElKjKTrneW^*L=ao}rbN6YJ6Oh1q<@y9Cdz1qvCwJi+EaQ|gUQ-SA(JjW-n^q_oHe
zp9*4$2G+A2s`-AP_?hTu>HCImC9lu)77$c!VXr#(>MqdPTJXJED8se9?>nBj7JQ4&
z5EwM#%|6hYfEVU(xORCZQY&LBFY`xA3XDgwgd<Zt+*{an?aY4Rs{P*zMG@m8g6O&J
z&evmNY;#$@ePd@R3`?)t(v%6?XeQD#3Js_=MtBjRn+_jjl8|;)n}WH~Qq$ZUb&jYB
zN&FXWc^K+k4L`MA?Nxu7Fh<oJnZ%(C@=&ikQpL@8xV{Gk_Ge7PyUnqIu1GYIUjg&K
zU}A-!d%EK#+!ZfhZmqf^g|<*-AluA3do(sX(C25hrXV}25Bwsn**;F@sY=(jsq4Bt
zeVJ_wow=YXJl*x)<HUlCRcw|M$ci9@*eCOXAr@HRlE+^2$Vm~{&-Qv6b>0)!rJKBn
z>b>m*pY)AENnGo*JvwO`aKEPbE+UNmzivjSrH_qh|1dRntZtowwMcH+H*^^+mbVo{
zZs$JPOeP~${FVoe%zTQ9le#}AqtL*JSmXh$-R9>%L$kiOE}>OU=erbAG@GNjSFzrj
zO9unBnB14An}1(}+?=hmx}*Xwe$LK3!+UJZ>kGcWoamFd6H?YF2+iAIj8^!mOTEoC
ztJMYguQd}U=!v09B?(zURU%4$;8y009Cu`#pZ%)7PML07!V<4%q>O9wM6M)K9i(=s
zjBRz(+1Q+2)#A;h$0!>)FxwBlzeuyr_d0_H#e9cWG>)ZLm#=hBeG^fq)rsD79u`Uu
zf!JoBkKn<gect25(woC4bq^5wPBva)UZ^C(h7csC@jlWb`V=`{=y_OJm!arE^42Dc
z!=y(&qYkHDcM2TQOE0)2F6py0{4B;0pV`HGV<DWUh^NM5K%%aDr>;Y0#8Y<8ec<O?
z7aOr*GTHIUlKWcOC3m{KJsQ?{oXunX$beA*KmY~+G-LNezu_}Ym!h;T%twUpl(<Kb
zvdDO9c;x3`Y8a%yJYFTo<-!MJwSG@{)CkkNpC7gpH<1}6n1qK00E7<f1-f;FfnYq;
zFi211@@)}Pq04yFV^Yc!6pXIXsU>P#j&C*R^-lDOt4`vLQ(5VBpdWbmh`I7E0(82t
z<*j{lOe2iB1lM{V=jI549WM$v%q`*8p6?rUD}U{7nZY{j?nz7oJSxM#Zt2XLhosg_
zYzRkZcjNnc7PC0PWoWqj)rt6|nJpYP9%HvhTH{I?OVBgn{fe9G)me2m&Cy)Hk`=WM
zPVcMA@^rFyhRlZfvkzQD+fLUOSX+NmM76=>13>y1LI?+$D_^B3VWxiOXIp7j3BKkp
z!!TsWt+@ia97YtjN(8Wo+iIT6t^XQg3*iL-_*=n^G)0>{9bu0rutyZop9c;OnuR@X
z-%L5)^6&aoXvre!awh+?(Ub_a1ZN@eFgh&wemRdz<gWlVmofEuXr#JIH1_AR30i8@
z$Eg&&w8wA938VXMQ)72&=)t$|q+Za`&Z=*Z62X0EVspqpk$0GUb~zm=S*2dj*apkY
zRIQ%-Ux0mSkPsp*WAe!JT~|;_y#QDJ<+Yu}wFCWPP(n|;*mC%4h;&jJbRm3AI_sE}
zHJKY+zHhoWZteV?d*B8NQwWi1<m=%zP18<^{&<`1fTF0iR60uT>Tjok)-4D7y_$W;
zsXQ-mxx8LWgOr|?nuMpC3%*>fng($IfPU#wMn}!l?qECS<<A}nl+?uPMi+A*NP^@k
zDaF(9g%RX_tTMF>>YD#bsaThLDh8JiAO;ATV_q<kSKr&&3B;{c+OPDkss83C?c)1P
z{<}IXu@6EQxqB?vQNe*kF{SYQlx#|K-3Dm`=n;W?OX_!9E4h5%>NGW0q830E$OXJT
z1$I#Ftk;%Q3qET#^|MONg~4$kR^(hb#rznfua16-nXR+=1CxFlc4htlP&3ix2L}ho
zZS+wFWEC<kbYdwyvCANE)1S?I`|S-kYYG(Zdq}Fc@uhGr_ZKgkHguNX$=$!t+3pMT
z1&@wJqR+tM{y9Hl2v_27$=$X~UJ3thVVc`TZ{aG^(mm|Ddq4vxs2iZx(Xmx;YoZBj
z26h#9MFxHf2XtBl){7Gt5a^I4{22n5KCI{xi!an0q4ku#I%hZPE%i(^oHXjW+ZnR;
zjY96*uX3S7NqzM$VO?t_d<|{+@i6m}TLxEpZj2M>b$Tt%=S)mWY)A{xzyP9kKg+_{
zMK4wPGmh7sN#$^t+(7wYJH#ZFW>gB7cjux33L%?eN~kc~zQ`f%p)kDYEXS6$=XupD
zt-)p9i8%#tnTD;#j~oiT=~RGrUc;w6XW=;kbVl!-sURdJHoIBx=XNe;d5U$L2A8(@
zQ{r|A6apT-Lr)*ld<cruzO0w0(wY$5W;gK}Szt85h}_j=?glJEpmM@Y<;>vItIm+(
zXs!uE_=sxrSfXrFvdmM+kV~Sfr-^f(`wtH0f6UQhILuZe)+l$&*{jVB%-8?EDpHW@
zV$RTP6?xXd(Vh(5J?o&$(q|tXQ@AXOEZsWy;D$&Fln)m;m-jR|g%Xb_1PJ7g1uqY;
zH%ght7U(LN!$W-fhyiUmsZwcQxmu+tye`4m3u=UZ_^4dL@j0w<Ii9ej#r(47P-NvJ
z#dxHngOhJMxtV!2H$kH>Hbdyo)na<W<-?NZmUsmsA@X!&&{X;I#(w1qU)Kl>En?D7
z8IU|rl$>;n^<JpkVts{=S7YWkM#LkmOMi*q9II@-f>p|Dk&=yKLFiZ79PR+>EXSbn
zw3rBwRCo{CuNb9&;9-RR@S0>LB~`8nHyxS}2|phXV9CUjjf?st2xeX1iqH#}yQ&cq
zA{YLi|ADAp3{JG{!c98cslX+Te&cvL;Uq!F_mht}C6JdXP{VvPx5FAx6ns|vA%vJq
z$k|*^YSd^^)~}$E;UfF0zZwL5TnoV^MR#)&kTcJ<Ls@xX*T4<1x5#)_oweJ<3{pp4
zTGcWcn6}L065zF3_#_{x@qu|o)GyCNvf>-zE;21dZs}~%I_*_y-m%bs#d0XqynCev
zV!$Mmm^(DuK`?;N2D9!o5K5)JQQ~7uozljL|KX_QvKvw8YPPk&|9MxXD`iVrM0q}y
zEJAwK@k?feGL}v~llAH_MIQ##&iY4ekxFS%ATS?kr%+t0L=3b2vP=Xd&{p_}O;c&e
zA%=Z%xI-Q=1;l*8QxOzb7ER<7OCSxX4(oa#_T;Hg*x`+(6FmK|$qC!-@fmEa8rH!B
zs+b1=6wEU0{CQ&tu26<NR*e-_=nrjvV~|$(;?%0!D70$hr<gvxBHm2uF+mSOCU3r6
zzl0P`;sATaf~kAJ{IQkNE2CU#V5b%ikEd$UjT3BYm=fH(bL$<3w4R-*3=TdFP&>g=
zFqL^(O{#{;w@{}1^9CM|=QlPc>nG9qIpy(qi=1i&wr_PYyNW!<>Gme(V{NqSO|49O
zky<YpQRj!oRdb;l%11!)yJ-XwzB#SBhsx_xlkr0vfrH!GV3wPLyEPN3lhIV|dr#6O
zw+#1M|3zQ^UYzB6f_&+*ThlS^i6ms!(4gpu6kAtU6H~SO+p~XbS1A(*7aP<jcG3u$
zGb@G)a>+iV=<x>JHHe77fS5vhh6ESxHDimCyY`}aw{bxaWz7|1P0F_?gJCdlaaIdU
zw8o9ozjka_P@)}phfkHqIY=aX!=#6^739!WvScvw^5V8>e`POq^UFq+3}ayIr)rf{
zna{7;Q@=koq*!+z(ZAa3dAOvwvNMmSJEm`wp!qp90!F9r!pj~@Ns`9?jvXa5orw!m
zeG?N=gn8P-RaH!Qu*Fbm!%xf$pZi949U@K<Ho#1L&0MhJ>59rnl%;%^%&Q8u9SF3<
zR(f7piH+g6LFlq+PQfns+sUZ-r&Ic%v{^bpMrCElAX(miu`k3pHp`wslKW-MP!@gv
zMs<L(Me;XqhcZU6%;{m?tINFI<KiKEm$t3T!(H?yF}W2Apn92wM#>54sm(bxq&a;k
z=cV6BNiK9NzV2j7fh9z(JZw7raBOXjl<u-@i%<u};bqAjMu1XhSy@?Y_aW{JhB4*o
zU^`drIaMly(!1{2S;qF*aPF3IWRawvgND1f`lrQ1u=%efmGepdY^E}X32jyS@-|Es
zf12aQqhEZZAaQRStpOI~FDnW=Z*OgGw<6;R?v{XF(H7l&Rd7by3KkK4St+4m{NHfj
zZl^D`H|muKX0i782PDkjd0hOpg><QK36o$Te<Fd~F5+EOt&c0vBK4V>U_7dsGj?C(
zgk^nm8p2i%imx1_pS7vBeJdO&y3NesQqas#Q0#&00cm6C7;?BWdj(D=;?%xrhXWB3
zB8!`8EQxvpTpn9h&V=+zz-sFgSu>hBY>FekfU3Zvj@57YM6y*#pXp5V21pcAS<3k_
zcszefG2OQ1sH6)GenVK+N^|+Wa!L-Rogc0wtE)zb$&=tqn4ROs(doX;=w-v4Tzkwk
zQ)SHYbu(*&Nkt_~2(4?r8>EdlnBw8n)sh8*=G3_`=Un@{8QsI{X)wp0ZOC*Kyb;-8
z7O%oBb+piqgh$J*kHIXGTC?9}6)w6|nK;j+%KyfjUFn+=R4vG_te}Vx1YzeG5^R<d
zWQ-&Ks8V4FMYOx`vLaVj!VCT3h&_&47vu7F&%*jg%6M<r(a16T)73f=?9e5C4F^|y
zSwP@L?Or-vBY975Gs0hwC<W*ZEP<yMnUh$IRjeO#GagU;h;fMtJT(~3ve1m-da=2b
zm55)XY1Lmjfz@K`Q6dj0$NDU0FVk0+wo)N@aQ>L18+skuOzj(~8=6z?AZ%we4+iLb
zQhYDg2UmUSVVkPnF^HaHMDg(CyryEV!kEKd<5DXb6peSfmB;ycm=_xxT3i*FTZB8@
z$URDm-EYi<BJ>9!XY)7L(4rN8S$U5Ne5BSLM$w{2S7_50dxtDzJfM-!^uB@X%#~n5
z)o@752qT0@$H|sVLW%#a(3y8V3AN2trkLMs>DG+$l5^;v*dAI%1%(k7D{;_T`oa&&
zXnRh`qA&GgXpos!$O*r#)6J~6+Wk~!_`T=dfx5qTNS)iHTjmGm4vUC+Y9fT>RKCWZ
zI}m^?$Afx5Yuah%L@o%Pt3mxf5X!P9;M+xzX$-TvsNhx>b?r3S84luLguw;A>gUxf
zv1KXQ98g<@y@&eZJgzjb9cI!U;4PlRPduWb)Kl!^#6Y%9BcL4M{CF7dy61OPUKOmp
z_Wt!vJC}_mX*@{Il%N;cQ#I&#h<069+FLZl_Fm4?gIwZN6FC6j$YEKe4Og{DHj><#
zXKmcVLu@;ts+scY7vl$?rdxgFX}bPX_7$+BW|F60U8sh05fY)PM_YkfHLZ#tnKSzw
zX;@|P(R7Pr%S;vFf-!Bvu%kUs$&QB5c%*$PHP#3q;4LTQ-j#Rv%+>D!1yEb&@iY>j
z^?*$C6;ag$MMdO`qXdyAg%l=7MnrUqOH9m1;PPu}nd`A3*_Oz&H75F!OsiKM;Emyc
za+Wg2G^^q_Skm|-=b0SkIi-nI%Yul7(E$J~3dC@45lh(3#TAUg`_+tB9Mz62;^Tt+
zg_ENt;wp{y9G_K(b-U_*avq};{u%qv_Y}MYo2a*LtsKisWkpaj-99SNDfuz542!fz
zJ&5CGzO!So9%BjO1=x#n!2V71twfjo9u;R%^+p=gXJ*W-2^tq$&@i4^Atv?Ao!YM%
zXfD`JjRiPGVoTH(bXe*?PeB*QyXBuB;SxMSatIbiIvyOZYH)F_jW2kVR@mpEt%PYA
zmvfML<al)i<I?H<1zlWJ_JZH5!R9@Lx|d`C2X=GwL_N8;&Dl)WWoY5p^2@oH@3px3
zm9ZJ`cY-WQSS#OKi8xeh(B6@~iYC@*H@%Jdo|vn-Eip{p+S_Xbp`b|D|I-2-O%Sh&
zM_4rB5>@=>Kfd`XZNZnFZ>Gb%dUdG7I&}3%hdGyww{L29m!`L?Kb7fSlg{hIZ3lTD
z-&Oa(v-2$*Cj3Xu7`=r1v-zpy=pbj>k!oby5pGYbv;qS^+YafX5-L_lHyfo~@#^}p
zU~^uo^$Fw(9Eu?}tvm=+8wqfVW%Qd%o{@mG=EIz!LzlUWpS%;mux>ccz&-!06=((v
z)K1PJPD&lX3KUSPSVN`W;vGsTZ=%T<ZM~BA7!0PQm+)#VguuL9%cVkJV$+SXZ`EU5
z1K;cEzCb4nwb{}&ZS^UHe$UNF%1@$d+8QAbh?xngcb=n51A<GqsHnI6B;@3{!t2m>
zfds471|?e%C{zw8&0LBT)=B)Ak%#M`3n#tW9q!Ok)CWu$CX7zANOTInz{vCaK?>Y6
z=PT&jHvJ%p{;Id25azJpwOA!}{gC;WiXV^bN5iXXd9PkUi>(!|XzN(Bihb4PSAIG~
z;N0+@LW9D1k7fANDN8HVa#7Hc)sbRb%z{4yx#W2zz0mwnf<$spCN$fUANhYSptcU6
z4_*O@H?U&07^}tG4s(P$B>#Z`Subzz^sLLc1{jgH_O9aD($ty7#4lYfRX(j0tCzq2
zBXx8}^h&)T33JrSqf~ccAEtumk`Eb@WRFon!Y}_CzIz}wk!v6(X@-2G`<tixLIf<`
zPev2lb;cw~)`bfVURj2#A>_n5bz4fiEFm{057^3m(yco`of9H*21iCGi_VHw<%P(H
z1^g9(OyP>rB>3RSJD6^bEfD`7#3s3N_q^4LOdihyOOZb|`3HV@S~j?XMdU!7+7O_{
z!&>0C%+ZGniA=YJ8p1{sxT|kw3&}@``>V=vKV1=|qDMMReXW6<X}*Kq|EvrF^T1-y
z%;v1TBc&J<ZF6m9_D`|84xhvM(}3}#xav+Zh%;L~VGFU{xUdKT_CU~pNm=#HGRn0!
z-B2CnxcTM83*WdymVfR;!B9}flHaeZzU})1=hk_eIDtxwP-MT)kQhXkaz^Km_RKb*
zl8s_id0rj2^eq?9fXBo0R`EIXQmTNa@Vi^8gzG}+smX+VWW{vI>~tPlLZT*G06^(@
z;8ArEE_6TK8jgpLIhGCVN|!*fOy_BAT(*Sig+8%1l-0(Kv$1hq<Ud?ur#ZxzN)OnF
zhJvY@4m588wZ)##FW&2G?q!;0{Ao9rxpGG3^kKI6_K=Hvk4a}#f9HRtRv=#id3<?=
zW6udp{1#~^TB)f;Tg7>Z9vNC4HQ>9PvtJa}>e33hs`Z+1ps@q&naV6wJ3VH7`0g87
z4bhV%N#c4_lvcPrHLHCof?ZvoCUvOTNt?ChbYg{DxSvXMAYp)#D^m5&fyz_4Qb9sf
zq)DSJgbBwJ-mkfp7t3l>ZPZ_Lv^thLl@UodzyS2(v`Aw}6gJYswLMzChBF5~3hCjm
zMoRA#fF?UES6$9p&OMeUB4ykOLI`!DCMPd?b06{uUkQ$O${oDo^nSlr`i8_C4;C+x
z+FPuKlJ(YZ_+1#3ns=mP-q`a1dK<Y(yIv%WtGg>do+c08{gmz%?vjD&WR=ZHf4kg8
z)PJP27n9tL1;uH$g%F4FBj8}`!b8?vz$UF~oxxU6$6+2hczmS!dA^K?_Sp<8V_#oq
z!f)8@vVDkX=E)PK{+Ew@cJ^DqoLW#@{1~BwgmJUNPtvj-`08%>@GrMxlLrt5Le!wm
zYSX9*Uv~3<ccb*t{ln<~%hu?=Yr(6O4=tXg1s|yoadq>Q{~e9v8}9r`cXmEj_fw@;
z#WOKWG85HBDsMa&cj>F*^6+rpA9C1H#zFJI$qKo|e!L}A6S}8INb=ob8JRq-hRO`i
z4Lb8u$XyI9nA_S1Nw(Xhd#=rwq)OP>^3i8zTxE*7)4hX3xAk_rn#_h^kFw$j!k@iK
zYF9IOXcxy$C(yz#73mH_UkmQqN5u6S_gZIJ_!taR{=Q+=z#wji!EXAT<^g<6l&UQP
zLg>TI8jqFygL}Wr>cKSM=U2Cmw9O80l(=}hNf3EYtNs_W2ws%jvB1e=OvWYYoMVRK
zC!p4g)GglB6bn^Qt4CxNI#HlBVd9m@korhGiZ1@gAin$NxXn#Og(`zsuJf@JI;u4S
zK8N(TKmL{r6ZmHRC^H339&GX(tb@h+ozmSvBHNdDdDY>oPYb`O?u>tB8Ysf`Q;@(m
zvshxlWQJVx^XFJPN{hgQ8@I%ugulq*5vJPRqmai#LS%kqtkU+P+mR$T>pEC?oebwz
zM5nrWp4F>G(ygi8ce9V{pKRO9$5DNhfP<vFtUqQ7?Uz<A#O=JtGU_sRmASG)%lrAx
z)AVD;1UC3_hfX_L?#FMZ=(QBV>&4l!O(8{=+XYC_S<LpISfGRualqk11-YJyqx*cm
zLKZFU*3ewH7m`RL2B9`GEVE(^wQ!9J=iFt1oveLU!gGgtkC~lXq7&fS{MbZh6e=dB
zA-2|NwzbKq@tlV?lBe3to=#~jgyz4Wq<;g1qPjp4xJ9)pv-EX1th&DNS#ZU8RZBi5
zfytP)=>AT2hg%{${nwDdDLE;7c9Svn{ExAGGT}#AX&N0Oi_G$wgpmFYQ8yvqEbo%s
z`gso&vd|yq8LY;B^+q;h(?c8H8_im{KZKxQ2mzYCj+bM7Vr!nv>&+U974C24Y#}9J
zCNf{gHn?6T3G!a}C^c8L)qqV!TA8=HJqmxqA1gv6jnKme^cI$?onIJ!vdIt?N#c)f
zbwrSuh+DL`EN1eXfTdecZY---I@kCJ!tFhNb+I6NG^(QmWMF_DD*3;cpI<bP3?Wk?
zNIThJuY0Rx@Oo;p_tx>dolG}V8#fYz%f-_4_##ySHHhkizr=UHgLtH)7ni!&9%t!j
zjm{L$1ZmZ~e|S>O0j&4;hUB)VgzZGh)mH($s$0Wpz5!O)|Jw79%EJclp3jzuWxZ*g
z2vpIrbbji=IY_&ji8dYuR4ZLk(@gYWC;S$fqtyV_I<<0^z;F@Tnq4SGo}@EN!F&$1
z#vIg(XkfGX`Z|)Oq{c|do8qo0p%IW{ntFl9M4@-<EU*O3x3-KWgtM*7qtpnV4CJq~
zA*ydKV6%Dt1&!QPE<@o8{3eqF3k;w(S@Bo<4xx`lySqBPy38lHUrZ~BF}0tuhcYC8
z6Zhcecl-?A8^_HAI>0~#WA^cRCwKR3wpO~u;AK1)b<22UNyKpOMk#rf0-6ME<&!wd
zjKb&<5xj2t9cmn=iit=@TCwAyem=b8#8inGC0=XpAz)$O_NsKLjy2e7dHb@@$0Qlk
zM_Qh;NxKXzPz|!XnxpXg!J*k%&Kyfqg}eRY@%&n$-SbqONyLPacvAl^*b9Oc^hkA`
zANmy!d6=d?Y01=SqiJb<$H-T>$XY>0^NHe5o3%(*q-CR12ei;1C_Q1l1R1;3Vk^41
zZ{Y<J`D6|uMhh7;8;1_d!MJb+F1G|a(Rui4#|JzQijd`HQ*^;8UEDpn(gcy;*q9sE
zJpLA{L0#j{e#xax%{*u@wrpIt*nSXK!TL>-S^UFkPuwb9axU@C;{{7N)J*#@k`+M^
zqG|j4;$db{Qbp2<yHeSIJ~N9<#)K#Cj@&RUa%ob6W3^KGl%ss&UcoI?9)V2L&V>l{
z+{F)^4L!3Ybk*w~b^Cbx{dn1I{PQ={o**CRQpR^2SJTdpz&Kh~1mMAcxjl^rS4}WG
zRb8ObsQsvqiFk3lqGostFaA9u8J5rF60T~qIQ+vsn0@M<|4;5v9RdL){O~U$vV2AZ
zZ`^X$-8xFH-skI%ZC~n`XyuEUhy&aX8DgJ?ah}Zf1l8AZOmg$8L_>HGsrE30<Zxd$
zT*55D20`ZOx@9gY8@;#)SIzdWVh4RJ7{ln;Bz3i{4n7`Sfo1Hosir-j^aX1Wfo2WR
zUQdL!5BDI)!hzMMvnDAiJrwtEa~yLAL_Sks46%|4nN8Y$;{UPyutZbpwVhL;Lxe5~
zHbj9<dRVEzCdI;ELyZL<(!=*-V<I$I=E5cfCFEkcB6)6j=#iR>fu<7{sg=q~#5_v|
z2&80{1`O;XYzz=};(<qpw>%|7lAYZqyQR4)3@k*{b1Z?hJ0#tFdNw@sPa>!5>+Fi|
z2p6G?^(n@8a&M+(m3B%OhS{*Kqkpv$`D2n0J_77J-h#)7jtiWd{)c(B`#?K;q@uS{
zfbtt3y25ZW1Q&&=c<{x8H`5#66SomjI(|CU!sJcsH+=h+FF=SyGYA}>0J1w-b=A7~
z*P!s6@<P!g`|K?891v2@{@tcwI!?f>i~`zRum+XmD5**6NGk(`&|IZ2Oq0=5z!J>F
z&%Jn3X=B_h>{XLs{=6I~^m;ijR5V|rh+Ovjvq!+z_C<wp*WK(;nMXiA-&aSJ<@Paf
zeQ);7(-V`Bu<BK7i`RVVe41UXvoI7SkR$<z&rPkUygdaV7gb-TDw0)*X}#XlVSVyg
znq+g6dOp6v^Ql{Zs8l<7I&L2^EFH=TW<G`F#^`KR(fZ1Z*o&9mBdwXmPT}VT1oPd4
znnFbEf{s%TH6OrJ(j1cdhqya$L}79>c?ZHK+SGEflOQ0|_2iITJr-wvX`yQCP2{>@
zh_5K3*NEFOFxjH4qeXmUmh<#`YK?Fk7J+8I&FQ<s`|@GrObFmOYH=#&)+z#<ok1K&
zo-g$~m9ly0O+qp$MnMwo`4xfj!O9mSbRk$jlN@=q3ylR%v!8K#Jhkla9<A79v4(3(
zzbYg6vD;WNjjx`bC`eYxQbd0}o5#onoNzWcS?qofQkbP7HHwodkzmak9+BsVmpYFl
zVS&#}K%NP=N_CNb3gx)SlU^tuR&(!$B)fc8USP7|S7~XM;3R)BA!)9XytNFtS~*r#
zcSYW=O?xa`HNh*8$UnIS4}Fc-p?BZE-s!=r|4j6Bx?IM3`|We2l!xQd!Hkx?^9uc7
z_cgp=3LQWQFF7X+aeqZ6i*!z4pvrb#8H{qmLZ|jnH{&tc67FR9)aaHidI#kbgH>$p
z|9JqCy6MESQKy69S+rAn(YBnF_C<sp{edWJ@mcH-;tuW0;~yT>%1K!);G738Fub;1
zn|D2Pj-C3P?VI`wet%|s>jB3))pYdBVU`9jQla*NxuI`--$rZfhs)X3j};BzRrpBZ
z9G(pkm*yOtjZamggm_=6z5_rg1eA;A%KrB}xUoU7k=097NkZv0=ABM$43?&ZvxQGa
zhl!u`rm|<(p)+X0nJb-4clG&kf@B{_ZI&y8*Eq`4)GQLB@Ci;1Tt%!qD?X%bm>ja@
zPzu9^M5_SNW0KXXGOmr>In)<7BG@mvKIoN0FA_GxNNx7#72kN)E9ooz;@!7AKdDNu
zd_C<iU>1GQg{IT|VQqn!G_5ore%NC?)d%HsmL5n$@#m9si|0qIEctTNvZPCI(yI0T
zdrZC2o+s$wBl>u-RCnZK>z&lVIKTW?;Cbk>W)Df@>8GX%LNu3Q_<A!<Ln{C^xfjge
z7_Q&z-CoNt(<J1T)bzPG4^-jpWSm_Y@+wT)rDlacsDt(z#x-erJ}b!<9;z*lO(3i7
zW>nFhD3}6x^*r!K!g^s5fvD^qgq>ZRYYwyfEn2$VF6u?4g{&p#1m0?S#=;xrvJP&P
zuK0p(h29np4@KikPGb1kK;cB_R@BA<C<TBJ{@>EK&0f>A(V3ravkFOfM@;2BE_N2%
z&Lizv=gEviDeM<}L+%@`IfbZx^Ph;p^xO}Oel{{tQna=3@u;bcZWiCBIcq3OTxbJk
zl&VI1Fihcw_h=ku3tk<mk^PUhGQX@M$~<|DA~JUwzhE(?{_|vC58f}{iSYi^kmCCd
zz=<4huG@cmOrajLGtu*$5!G5^=k$yJDr}p8OVpTGQz4bzlB!Hu4{oo##w*skGoX|C
z&{lg{l(Ns1Wk@rhs)cFYPSO^G<3d4j2?-Z?3aUd}SVu@>U#!zRO4H>;79TZO)kxVw
zE`N&6r#G+6ZsF81nZyOee5hef)@x02jw|F^YGzj+G~PJKlOavPgacf+7hN$%7#|}-
zES6eB@clr4<9HTF%25o@dYhZ0hOOEdmWGz}UvjVO3u5K4?-yJzud1*u=LfntejZGP
z?Fn;vJ;R-hPu9bR{HQ@a9T2mYW5-aSH%MiJvdTFnizY*(qz<_soazaG9olp$u353j
zb<q^~A%@PKdEA`D0zB#4GMcw)_!79XS&5)7dmK`(&+6~Ts`v**BcLW(Z9Eo<7=@xd
z-VjYNmyxQ~EOhQORYFp>9@${hR6@A(c>hdYElDW5fbreJGmhxJZGGm@kg#)Dhp0@S
zqE=0ttV9a!T4dM6VKAOSm9zA#C9f(=vg|MH$717;2sgeu34wq*tr(|vr--u#{ovw{
z1R;K<Kyh1oJYt()s_*p$&t2X%&`D00<`+!CZ=7yWe&hl6U%{h?YbQw!yRickO*qy}
zQTyv>@<9Ppu0fbUROFx9*NwpJH}(Qgg8k%E)W3E}1pI|AUS9T2m2LmvKh+=v0L~>{
z9M<%BmC)$Kfg^1)&I_vkj3;kIj0wEzM#?JolOx~3H?u!MSAT<b!e#ZSiv++fuTFoz
z`9cV7d-;)+aCa^Zi2PV<G(2IZDN=`?lm{e8i}@Rr?&C<Y?uM#{8%g0d2RY%Z>E*S{
zE2-s4Q8zc(jrI{F#|o)L9deE7Gv4QQL}>aD2$hv^m9)MViisADZ4zdj+`QMMy)cTU
z8bkRyV^NXP83*T<*TZ=4N~p<B->hRm)S>Sx#c*0ev}7^+6bxgoMIi}0)P3O#=*=Vu
z+frw{svjxfRLHR6b!1ReTv%u{fl11*+vgY<Nu4S??WCK(D2Xi*4%B!f?mV5R#B5Df
zUC1h5x3n4@I+#gW>I2e;r7kE5!h0h@b|`u?NzkEx@;IQWK3cn;lT>s3E(!ySbsklg
ziI_e2_LrUy9hp>V1mb*ud8o$B`mZ&n{F*|I>*eONVA_$z8N#d$7@UAje}0Gxvq3|$
zsiPn~O*R6B`juy1_Dz;i5k{x3I9<q?BD9!3Ni(`f%Q?J>+vaezytKwbl8b5;TZOul
zmS&xmC=OjrOi8v;<-&X~4J!WCr2)O2EzLt83sX#(p+06{x?3eZ^(%JgQluOsJK<>U
zuqd_CGj_U|(mVZi=*XJLQ$9vZT5m}z(XTM4hst{#69IzAOGag;yKJZ~gc}rZ3>|qI
z$Kym>`1EZ1qST-HeTd9EuI?ryKlh?yRXfXmP7JVL&DxP)U)}kibnjW6nkuMt)moq_
z<E*j&gaSb%7HuKR4Q4<FPI4`KElt~ngj%{MVV(<N@s+NA0T%^&w%v-mM&liIlHzD@
zQCEG#@+TahvI{hih?ci_1acS;$N<FA%~62t?D$yp{rBumZiO(z;_AJ2RHk9CL4fD_
z<gC=}b?HTTq~^Sa+FK1*f%&9v+F7|txtD2fL1~Cqi^s2Q>xvmon0IKA$lk84bEG3z
zodrq+qST`hLDoj*(ag(OeTngJA01m_ky(knp9q7>FlsztJJSoz1kyZ%K}m92Bl={a
zj+7SJd7t_r9!d5k^J9y0ltwvnKq`j?-aEOFr)u#cXOPkCN_~1k8iO*VS(INuaR1W&
zPin!-CkLkW1~lInKR|ESZq$J0tzTL+M(hu&yuh9vd&{6OEO~)l76U$*l_Kef)`|f<
z7c19IX}I}6B5>P!kUjz?4cyY|k#m%UI^hTOTgFR<7Q@zakQ%3o!WX49snmSOs1|LP
zTDZd7Xo^<{tf#LL5NLo1e6=bHuTL;<sheZxC@1ocYHnia_O9jlvUqM-esqQ&+*)c(
zlIWCmpvD6;m`G11>qhm^mUadQ{r&~g7p;d$xHzQbE>~6^+6Jw!8i$lI$(5xed2;{j
z=2WjWTNAy>S{T?Re^*j~LX-GrWi!QE2e9?uY_n_4_$pDAGq^Z{^W5jy7;KWuFj|U5
z%2+8e%f@^7qW<x7!$}ki(B*!)Jb?H{@|aCAPtUWHT<-%It8*;T(%&#>&CNq7fLcVT
z9;r>w?}qcZu<oM2*&m`FyLy0mmHw|b;PtFQCgwGP)1bt|U+K)C+*t67DzV*hz=3PA
z#9?yGaIVciR%`?8wZ3pGgZ@pFOFM`b9vI@z8JvgAUQQc_V$i4%{orr7gZk6<f(o<J
z&Cflh1o5E6V_~B<O<}T#oF5wz$d9aQ)Qdc0uCg6q@u<sT77aVlABr#Ih8KF8NnYZ2
z%#bBfbtyod?ssWU%w_r1LjmMU9qHb-XVBroUMqRKpKHe&VQ#~{>hbpWZf+%+S+AN@
zEA<xZ2(i89858w5{%%6>PdV>`>^}QiZ<S?A5J#npfDLZ@OYR{TKkmiF(b?HTj2f=C
z+4Ll=yiZ<v6SaDV+*iRy<Is&%IH&J!akNF#ljec<>Y_sH=|>FnJ?HJbewLh!US38k
zyNl|B)>_y&0l{#Px)AIy>DJ0{;+M{vc1(2($HyCsx_Xvc;?_BjOxU#_d$__(r~bIP
z#6_FALn)loAPVQGhU1c|IT@0H-XxzoI>czm3(ijq^5!b<c}5LRn$w@3QgNrYX($fR
z+;B6KZl<g(b{1GXd64#xbXG-q)a@v#_;>U*emSZv${M-158@NMdEiI8Bt@&Y_6{$a
z^l;*^){sfA@xQ;8F0mLUA);7fC8_3cgs<CWi;L$HsZ_}W?XO~bVuJJ2gtvc$w__n1
z08&Cu^MA+|@N~0S^$M}KR7}UO30E5GHZGNTCXhnDBWFIU6LQ*Yx%X1MkN-q-Os1R=
zQN^pH*VA9n%5JgTdB3S{p5Nu+tK6=K?~BuSJ35<#o6FGTQCEIfZ;zIUOsZWTQaj<9
zaBb#I0eJ{BYS+b7UET1`k{~@?oYXc{c$%`$GJl0|v6IbLD<mU8?b`(d44^SG%)~(|
z-6_`*(RY>rd6aoN_!&}U3sI_l5Rv8HMDpMfU<y$Jvas{SwjqS+A2=<s`(rTOw&r&|
zNq!x>$&GE1Kc&{Re<zPO@^DB9iPJq5Mf$trdr5)(RF&W~2N0Zg*?v!1vXbO`N2JWY
zvsAJ)Z#Dv0#yr#)clIR^9G<bVeAx~;Mg2=4OJQUVur>SlERK@Et2uN*+2%SUvGAOA
z{<1(dn9z{l#qhv@VsZ7SKY<Co-^VJR%^xhgEb&ay$Ih3O#)wt?z#*``;lBaB3_0E{
z5?Gxab@A%|6h+|Uy#-OqJ3?l+mRcYGYa$IX=gHIx_gqm>9#y`UX4E#-#4ulzmEE)@
z*&$INRwRXz7K$WVfI6hgK|P-;_zEVSV1g@mGve#IBnrv57qom<FN@p~yJx9O`L=X6
z7=G#k`ECXyx1oE+o!MnLo%D+I+}Z<VtWW}62MWFFX?r4H8i*6?64auLqKH#S*PkRD
zi0vr2t^{IinvT*EBgfZ<bg8G~*%HwsvOvQ03O|)`TpL7JwYmhcZF8&QvJCEfZO`E9
zU$Kf#Q}>JsFFSC7qTQeX)v2=Ov|lBvH5A5T+c6!S26*TLEeT=<p6;4GwxNLrEPx~k
z>P!;56)S5j%(~PdvNC+BEVEHHvIVWMw?zr?pTUc!Q~CyoB8KOa#KPKmt3>wAT~4>0
zHRtGXC*SBt_AXrZKhB=Ztso=g1Pt_mU>|=sxh0zq-_}30YUp_6ePPeM`QYJoB+zxm
zXnUd&5P5=v)P(+spK&PDS$}|40_R%3c}2}0nKtP%e|=LvFcbQKBHSW`Ggso3n@xWC
zqH)>kvaIqb;kM#;ec&#0;MA(y<*zsQ6p9Sf&<%pc|3O?lJd{h$mTyRbv+j9D_Z8)>
z;%Co>&PN;$ImtLG^nW7GE%XrbP^rQ!nIe|LhV<C$__=uAr*P7UE$CAOAnc<HTdGW;
v5_JLk*2RziRZAl#LI3~C>HpVd<L?kXnL|JA?PJP+HS3b1aw1hi`hNch_726G

literal 0
HcmV?d00001

diff --git a/demo/documented/csg-2D/python/demo_csg_2D.py b/demo/documented/csg-2D/python/demo_csg_2D.py
new file mode 100644
index 0000000..de650c9
--- /dev/null
+++ b/demo/documented/csg-2D/python/demo_csg_2D.py
@@ -0,0 +1,54 @@
+# Copyright (C) 2012-2013 Benjamin Kehlet
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-11-12
+# Last changed: 2013-03-15
+# Begin demo
+
+from dolfin import *
+
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+
+# Define 2D geometry
+domain = Rectangle(0., 0., 5., 5.) - Rectangle(2., 1.25, 3., 1.75) - Circle(1, 4, .25) - Circle(4, 4, .25)
+domain.set_subdomain(1, Rectangle(1., 1., 4., 3.))
+domain.set_subdomain(2, Rectangle(2., 2., 3., 4.))
+
+
+# Test printing
+info("\nCompact output of 2D geometry:")
+info(domain)
+info("")
+info("\nVerbose output of 2D geometry:")
+info(domain, True)
+
+# Plot geometry
+plot(domain, "2D Geometry (boundary)")
+
+# Generate and plot mesh
+mesh2d = Mesh(domain, 45)
+plot(mesh2d, "2D mesh")
+
+# Convert subdomains to mesh function for plotting
+mf = MeshFunction("size_t", mesh2d, 2, mesh2d.domains())
+plot(mf, "Subdomains")
+
+
+interactive()
diff --git a/demo/documented/csg-2D/python/documentation.rst b/demo/documented/csg-2D/python/documentation.rst
new file mode 100644
index 0000000..4fe5626
--- /dev/null
+++ b/demo/documented/csg-2D/python/documentation.rst
@@ -0,0 +1,104 @@
+.. Documentation for the csg 2D demo from DOLFIN.
+
+.. _demo_pde_csg-2D_python_documentation:
+
+
+Create CSG 2D-geometry
+======================
+
+This demo is implemented in a single Python file,
+:download:`demo_csg_2D.py`, and demonstrates use of 2D geometries in
+DOLFIN.
+
+.. include:: ../common.txt
+
+
+Implementation
+--------------
+
+This description goes through the implementation in
+:download:`demo_csg_2D.py` that shows how to make geometries and
+meshes in DOLFIN.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+	from dolfin import *
+
+Then we check if CGAL is installed, as it is needed to run this demo:
+
+.. code-block:: python
+
+	if not has_cgal():
+    		print "DOLFIN must be compiled with CGAL to run this demo."
+    		exit(0)
+
+Now, we define 2D geometries.  We create a :py:class:`Rectangle
+<dolfin.cpp.mesh.Rectangle>` defined by two opposite corners:
+
+.. code-block:: python
+
+	r = Rectangle(0.5, 0.5, 1.5, 1.5)
+
+where the first two arguments represent the first corner, and the last
+two arguments represent the opposite corner.
+
+A :py:class:`Circle <dolfin.cpp.mesh.Circle>`  may be defined by:
+
+.. code-block:: python
+
+	c = Circle (1, 1, 1)
+
+where the center of the circle is given by the first two arguments,
+and the third argument gives the radius.  We may use these geometries
+to define a new geometry by subtracting one from the other:
+
+.. code-block:: python
+
+	g2d = c - r
+
+To get information about our new geometry we use the function
+:py:func:`info <dolfin.cpp.common.info>`.  This function takes a
+string or a DOLFIN object as argument, and optionally we can give a
+second argument to indicate whether verbose object data should be
+printed.  If the second argument is False (which is default), a
+one-line summary is printed.  If True, verbose and sometimes very
+exhaustive object data are printed.
+
+.. code-block:: python
+
+	# Test printing
+	info("\nCompact output of 2D geometry:")
+	info(g2d)
+	info("")
+	info("\nVerbose output of 2D geometry:")
+	info(g2d, True)
+
+To visualize our geometry we :py:func:`plot <dolfin.common.plotting.plot>` it:
+
+.. code-block:: python
+
+	# Plot geometry
+	plot(g2d, "2D Geometry (boundary)")
+
+The second argument is optional, it specifies the title of the plot.
+
+Finally, we generate a mesh using :py:class:`Mesh <dolfin.cpp.mesh.Mesh>` and plot it.
+
+.. code-block:: python
+
+	# Generate and plot mesh
+	mesh2d = Mesh(g2d, 10)
+	plot(mesh2d, title="2D mesh")
+
+Note that when we create a mesh from a CSG geometry, the resolution must be specified.
+It is given by an integer as a second argument in Mesh.
+
+Complete code
+-------------
+
+.. literalinclude:: demo_csg_2D.py
+   :start-after: # Begin demo
+
+
diff --git a/demo/documented/csg-3D/common.txt b/demo/documented/csg-3D/common.txt
new file mode 100644
index 0000000..845ef6b
--- /dev/null
+++ b/demo/documented/csg-3D/common.txt
@@ -0,0 +1,21 @@
+This demo illustrates how to:
+
+* Define Constructive Solid Geometry (CSG)
+* Generate meshes from geometries
+
+The domain looks as follows:
+
+.. image:: ../csg3D_boundary.png
+	:scale: 75 %
+
+and the mesh:
+
+.. image:: ../csg3D_mesh.png
+	:scale: 75 %
+
+
+Problem definition
+------------------
+
+We do not have any equation in this demo. The demo focuses purely on
+the geometry and how to generate a mesh from it.
diff --git a/demo/documented/csg-3D/cpp/CMakeLists.txt b/demo/documented/csg-3D/cpp/CMakeLists.txt
new file mode 100644
index 0000000..30efefd
--- /dev/null
+++ b/demo/documented/csg-3D/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_csg-3D)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/csg-3D/cpp/documentation.rst b/demo/documented/csg-3D/cpp/documentation.rst
new file mode 100644
index 0000000..11a6f7f
--- /dev/null
+++ b/demo/documented/csg-3D/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the csg 3D demo from DOLFIN.
+
+.. _demo_pde_csg_3D_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/csg-3D/cpp/main.cpp b/demo/documented/csg-3D/cpp/main.cpp
new file mode 100644
index 0000000..83b604b
--- /dev/null
+++ b/demo/documented/csg-3D/cpp/main.cpp
@@ -0,0 +1,61 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012
+// Modified by Johannes Ring, 2012
+// Modified by Joachim B Haga, 2012
+//
+// First added:  2012-04-13
+// Last changed: 2013-09-12
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main(int argc, char** argv)
+{
+#ifndef HAS_CGAL
+  info("DOLFIN must be compiled with CGAL to run this demo.");
+  return 0;
+#endif
+
+  // Define 3D geometry
+  Box box(0, 0, 0, 1, 1, 1);
+  Sphere sphere(Point(0, 0, 0), 0.3);
+  Cone cone(Point(0, 0, -1), Point(0, 0, 1), .5, .5);
+
+  const std::shared_ptr<CSGGeometry> g3d = box + cone - sphere;
+
+  // Test printing
+  info("\nCompact output of 3D geometry:");
+  info(*g3d);
+  info("\nVerbose output of 3D geometry:");
+  info(*g3d, true);
+
+  // Plot geometry
+  plot(g3d, "3D geometry (surface)");
+
+  // Generate and plot mesh
+  Mesh mesh3d(g3d, 24);
+  cout << "Done generating mesh" << endl;
+  info(mesh3d);
+  plot(mesh3d, "3D mesh");
+
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/csg-3D/csg3D_boundary.png b/demo/documented/csg-3D/csg3D_boundary.png
new file mode 100644
index 0000000000000000000000000000000000000000..440138cd8db510e16855f3daa8a6756b7813495c
GIT binary patch
literal 20438
zcmd>m<y(~97cSk+(B0jsfV_irm!zaJv<#9;#{dEX0@B@GLnAeWBB6B43}7HIjG%xF
zaUOr?I)BCaz?Zq6huM3@z1O<ez2}vwu?{5}D;W+B4yB&1ra2A{o(&ETZUzY+@X3w!
zt4}yM+&FrgV9U^=<H4vUH*4GPe_#C65q)bZfJ^tEIYAZ;T_%~KB}ut&7qP#_Zf}tl
zPpa>pm)>}HE@{P+#xg}$74c5W<8&=Lmcn3maN!&D8{Xv3WPQ4kw0KK8UD5a|JUvlv
z%SV|FOX=>nYbOs*hQ6<Ef8Pq&;kpP{KWy3k5^%o$eJl6R(2nZPjp`@G5FHYpcxEv+
zD=cn2jYiV4riO4ljq8#w35-S~m6fy{_{@xt2c$tF<HaAZLBgZ`I^L9oXT0tW4H@vB
z0-Xj=JWZwc|6eaDHlO2@@O+D1Pn6T%wpZJa+(uIKjoVFbMRb*dN#?oWDp@8@;$Qll
z@>AE}u<x)@M=En<Q4Br!+qrpD6H{WDq>#+3!Lvf2)xp%O>QT5}EZ`#cyOm~mCEt7E
z^d-D;4=hq)V+feL$-&F5HI(VA*UA3n&*+@L-s7#B<xyZ-fkf9|88l?=3DTRy>5N?4
zA(MN)?G6?0N<Aq~4dGDyEz`p^MGP%}qAM-nr}mF|$6{XwN?j7LEWa!(ZxxjDzmhyR
z|NHT*Q)nsgIJ&gq!9$lEvUX;`={AJszv2u;uPj@m?ioXF+s?_yx*)4c<7K)1J2~ob
z8gCXLB*ZlJuJa!68)*Ir?j2+WEi`%6D|mJDSzONqk5JxNF5W15mfJ7`>z~Qhyptro
z+Z*cPjil#&+U@6saEB|r3^>cO#2=y#A!C8r=mL*Xm?&I6(P*i;U)s|nMP}9dnmB}U
zI==dsQLf>{(N)FxgSo#27;SL54aL8Q<JM7^!NXXVpnHM}SF1E@$KLlguW?*3vnZo(
z@P?(8(^h|x)RSO^cat}QaD#wnJmai78p7j-{8u3@SV#C6^p$Nni;5lS&14xS7#^|A
zU+}Tn+f@^;GN2u~yyk!EIsI1_t(5QJ3&ETkE77_7^74Qxs2Og^tx!}KgOD)fmbr~p
zW70(ZZUif+o1(E;=%l@|AS5n_bm9YG?fDq18~c~kVRi^GD{o(am>Xr|0LJ*D_}Jf3
zR=HNGhbAR8-Zbf8|A!M#<ixPWDxQ#^*+O$cc>cHd2CaklA~<=*EjzLCG_RL_av8vg
ztFPbuw(R}671+>XTgKy5Qzz)t-+<asN%`VqK}zdlP}$YS0>cJn^+ZyJBO-d}bSCi1
zl1!6i>u&{!L#j@M20wdw&6I$xE)zs!K9pOz;$Dh~^3<#^LsyGRG?N&B%pIrey2{NY
zimhif|D`cY6=H|-rYWaFd$=K<o31qlC`r%iO9-SDI1sePE1ica@~p7ZX~+c6q`mJc
zL^Z9var-6Kj3?*{CqD1>t1qs4+2*ngb^7Bx4HqbV*7Bw9p1}7p3HL%022imit?Mjc
z%RK>oXP(F~uf*kKr=KZ|W10EXi&|#|rBEl|#rbp3hXMIBY<*7aBK}K9ycgSl_h2?y
zU6P3(x*8+q*CCRsHk4$W4xe|Owdy`j$1j#NGz9e2zF*Z~tg|!~=Lc5CE6U@13scGb
zGyGg!H^Tgf3w#WwvcdUDVWzG1{L*qEtukL;!Onn4JcQkds-Z8{hJZib^_M3VZX-MC
zorP#JH=k^ycKki-E@Y&3tsCOwS)g!5-n+JjbsqoD2ke%FFq;!#IlPN%1dpHV*o*EK
zx(+1UzU+P3MtmUaG8Vn@y?!d!^Ba+!f=V_WS$iGuEZ%|uflq1ecdL_VY)%ztB?O@=
zm_y3;%(Bpb1MsNRt}u?@5+}$NH-jb_R&gQf+(8ift}eW;OM9U0{Snme?OKFWQpt3D
zv4;t}Lf9adtH6O;%B&;xU+%cl=BW`F2BJrI_fpB^2UJ*dNNf8mgP73r190!wF0Ua&
z)6oR`x@=Q%lK(+`-m8ov(h*xZ*77%S=QEl!Q+w0lw7R-7antrZVP4ST+o>-r)WQA1
zc4KgXkj`8VyNaW<Z|ajj7wE{1sVsoaUjQ4rs`Ly?M0^q-)O$b9!pb1YP|NfD!RFSy
zYI$*q)Z)nOwv;We1!2~&hBBH%X3}ySrB20(2h&GjR?9Z4yP8*vaf25VvqFCO$q{Jx
zyzMVR`O^GpRFA+s<9NVHa~Qor(^keG=_wH&1Rr@i_tGpimt87oc8-EqthPJbZYIzz
zr{m>CF+}P6{xpaI1UZQ|eo^ihuX3eULgP)~J0rFte@w@mq|r;PIN&GT^{_G7X^yiG
z@*bsI^RmnPX`l{PXinaDq0rx@PH;w_T_X4grJYTe_H0YyCNixemiOuF1al4BO4pl;
zB-19d8hvL^($5hF!WFuE2zi^Td;j^YX<m$;J6tUYdEPRr=nt;cIChBU4dP4M9@o;i
z1_4e~(5WHFQG_L}qM<wX3mSqC#}+bO9%Y$_1m=8`{bfcy;3rc!<v~g0nO-JM3=ioY
z?y9Q~iE3OwWSev>U@aFF0Hwsln>O*BzW&@mfCsIrtJLkv(D$%me`=SYyV&8nc-hb5
z^|INBoY!FMSvOx*I+d~M=sLs{aL*3lo}Y^aRCaSP5z98o%uUzecl#+hc%wgIMz|GN
zBKWLli9uYPU4R!O>&wJ$2D47c;gQczsVC=D&e{xykVV;Yn^xd|c+s8lY+BXovy@lg
zmNHN(XELr@3&0iS#f@bo{%cAz;p#YFiVkem@evnjq9k|-B<^ccn2jnBkjv7WOahqm
zOhzj)-iEuCIoqn4>>97<nuYt)R3Ch8<P>Zuhz`X2DkY}lo3*`t6;Oo*meP^^b$vBM
z8!zn{K&}x$5HyY~{nw^N=>6WLM9sB(J>ucm`q#Ln_u19Bg%8s^jlqrzHu9TUQGb#A
zKW}ky(8mf>K^u8M{(JRHSY@~6;ysqFkIjuY%#i;ir*n7esoP@f7&6nR>i+b&%QHKF
zsNYcbiETs@xjORp{>AE_LLu|Tm-dZut`3!e%W1mIoGXH{8+*f@ZiWMrIp&ati-y!s
zMZx;>6P6n(!rvThnJu9$Jv6Sx0Gb8V^2gLKX>CehhlM>NwEtcIs6XxZT6)EcWvGEd
zNMJ^Hk<o$T>@(j|FAX^Lh*p64sHuJ(8CiSF8=B;M=DKBAM>+jnYf{_`g?i^mW#tza
zTV-v^_JbcI9*STEIShlNZS0L~RCux~^5kC7`)gq;t_?Oq8cTy!9+@Tuy;>oecr3hv
z_wX_^nJX(Zi{z6)`SWnbU*x@ho@8W&jN}IRr%V`C#f~X^?;_sBgQAH>(0%uXe%??=
zVP2nz1a%*@6yLZ;d6FrGN%qJf<m-o4#cu}BH7~l7oT#;Y>_9%H4R%g4U6<t`ZrMV&
z4b{Jzwh?g8Yh3QPBRL&cQ)~___I|@%S|Zyajj<ZybO8MFPdp&4Cs6d{$ttki)M^U(
z=#e`3)0!+G(@dzkf0DzuFPY`JSIzA3J0+Lqxchfid7GA+Jd6~i<;)41cp+8OF%mJ(
zV};conN|!lOdo3A<il9Z;9N&`v`(}2B9OfHj-kL5JU9pDFyImREnPB9(>vbPY6hKJ
zpPHK;-%L|zEF#^tE3d2I@~Zw2c5wE)j+@{1_|Q5o@71~lq$lv|Z)aZV&8b_qAm54<
zuv~iouLqfJ@2t&-yfoKZVj(KYAAhaCZ5416WXY<Bu_06kCuW}5-n2bu7Qo0}Oc(eK
zTAG%!zi==V_T^J?`bIB)48T^u=1ScUy>{%2<z>U%_XUKlznr%RpR3Jq&Ofcu(QisB
zH7nn~DBwW%#M&&;PDc58&JTa=vi&QokxHW#UqSuL<mcDwh0Bekj5JZ^yU)~5;u%LD
zALcdnN^@+jibyb$T<kMBEG?A9x_^y-38$yiNx7J^SeAFDcYO`SYam~NPi|r=vmi_&
zFtObB?*|W0D}AnF0lbvH%EEx>nze*!({KMQw=Q1%x&k@mZR1JJq!X$<Fh7ZX353v}
z<apD-kt5^YqWc0#<*4yf$E?%0{Iw1L9S@Fwd!zjDnbE}ax$l-*CxM5U8m-5(&v0W2
z&Yz8_y;$ry-!5?k(zP4_Jn`iJ+N@AEx0?}qVWuDC8H!ATe-Ocm-5-1S496dRZW~Oh
zunVO9Ql;(DZ<u$JVL%?AKOK*@R{T0t2ZRl$9Uo|sG^PwYXYQ$a92VO7gOye4q%s!e
zcf;LRdCy@MGBEMQxG^=Keo|}P{xr*VONuQx-}Lp$I5Y6wiZf^m8O;u|-pZQ@66Ke5
z$j782a`}(qjK&bME?FH^j^ZA{>fuEKFYKAZpLcQnm-IlFL`&@z0h<3!e?7Q-J&gvm
zVD|GTk(0S^|4Lj7*yRM%V&SoNY6-b0+&+m+!`_?Cz1V3`$~vFi^4#?h76AP(?-f9f
z!a;O4Y$Tb&uKq5!cFsdj&(rwM;xuYJT?RUgDJfO-kpZp+Gnl3G+<Z47K}#^t3J;xz
z*`yCsmdG1{^~RD4*BC^lgaFMwSH|z9VOxuu&5Vk^CN_iJjTQy;gp*UX*M@ei?=1&r
z<V~KtwdX$HUf;;hSNb+1K5q9=LpVof)2(~@CK>a+Lvh1Eo$=&Q8|@>j+bF8M<mz&G
z>R6hc&tl<RbH5r@zaao^kc6nu#1lY*ZM`*E<XztYb`z)|aHQSKBSt}f21;6Rd#C^Y
z{0=t`VT|^8SLHZ$`nF3zUVeb<LlWNM_WWDY+{Rax=+)8cES+G!@qVqKc)SWSbE-dR
zpWOEIbQyyD1wO$$q?ehfWNKd}$1Pt+%kNtkxZL)q{1DGX8duR|l8H<*tA}d6ssu1g
zJn(bMPa<8L`LRkLazO0~g8`-=W;i|X>$$|wDQ}u~`e{r3^K2Ri+yQFTJa#a|#3{au
z5Ddu{N%Qz_o~*z?#c0{pw%A{}z6VJkQ<v^LS`GR2T;SAAmXoi!j07lln$-E@_XMgY
zM--ZQLnyOm$Mh>cfEcPi6y(p}u|HMw$tlZt^~}q*uQG-^23?zIy;?YF@08PLxF+AR
zcdS7;aV!x8dOJREs(-2d&u?sWh&OZsnB)cmD_JK_alE9W_)mr}yji;y$3|m~IXy*V
zrYOFTv*-6+M2gL;Fj`hBw66)<LQ+97&d;mNK5ey<poQOlZVRk(<Akfse(<AnNWro|
z@Z}3$!GqAP4oZ3vCqD4^F*BE~o^(9pAIp-Uf#b5Tx(SDqH6Bwb^{`dVL@_|m0~zQ-
z<aaikW@td2kOUe$tI81;k=PGYad8s#ieIOHZ<OmL{Yi|6KF%8qJAHB!>*Ub32FWm1
zTQhf356aAb<RdTlmwB4VQ#|>kjmAdIhec`DLGUqcr$D(4JAXVM;%FPa+VAAjEha@%
zB&}<p<CWOO^_WkV@kg;Ny_A&3PXVS*9TFRH`j+dLE{eW?W%*xKHq<j6GLfQeNJMSI
zXGjUe^v}!Ii{<K&nH;Ms?5Ss+^`6GE)7%YD&V#r$W8{pxGOKDl!g9OLS2od6x=-Gl
z@vN}WA<RtcoU?nxG~ACvyC2XreOOSa2X6%WE{=W>I8+ms$M&zUZkq({;Czw~dzaWj
z1$4IQrS;`M_AT$dsw|J)6#yWlNsK=}#l&>fJV-MOtl!wpK;$|7!79god1<cn-gJXa
z6Zo!zpydAL_25$A!S~O5#F_cPxd+6Uq%w?bMJx0I@%r9$d=_zTETRP#{fi|B4!Ixs
zhUbvnVmbe3P0f|HSd2?P^jwG~8SM2F#!O9z(3(8j#<W0u2f72>>Umu|-kviUrNAgU
z=Xx?bm(2F#qenTa-BnlLb1-O7q{TyBNJZCLd?#E{-1h%HUD2|{7XD5;hvY8gltH~n
zY}|6nq!X*SX7#1$72Rk5K_Uqqg7BNeqTw8HC=Z-IlHT8V3YqOJvWo+w-dW?yl~fHI
z72KT}E`)?2v@G7c8`}5|N{qkM(CE#}bHG<udr|e}Z+ytI!vnXQ)+(68!+v?;qrpq1
z?CeQr$s_W4TRid*5Y_Jh9c%47*&5OB)4filx%^z-bUHv0&WJ;bLhMHR&g;}D&<6UE
zkQuyhq(4WetOP!~<@)s^a91%*Ro7aW;IYovXm3>}pvev;4L1i4f<bPc$N$Z=_z%CS
zgITQJZM8~tN;?szl(m)WPn2OY1Ie-ItiZHHug#bmw8u#z?n?rgz_%>T`-`$Jk+v}G
zv&;DPWt?~KE;wK|E`U2z*QwSVPIc?8yS%;Am0p{8h*K5?qu$j?Bnlrm`ChMvIY>`&
z9M8M?wr$NvDte}AcZcNDx(@R3JeJo`&ddI^qx_;<(MeGE+aQ#W!EWNHV8cLGGQRrh
z>q7U(UkhHo7`PSKet<pEdGn=l2iDkSsBAD~_@hH`9Pi&Y^k2wKxVk*FjqtzTSa9WO
zcFp-+AmX0!P2D}cu|wzt&X<X;m+P;DhZP#hRkiOexgpMRjZ}UcA4^$G<=QrsneNuv
ztm=|5k-@#oY8df?3kSm*j&1E-cP{i~#STLXw%0iq_fKY@21kXCsy{_1jsFLBL8YCO
zkgYy<ixBbebV&so`73RWUgs@b>ujq0<7kJj%EFIiY{tt@Km#0L*(MKRjFPHLTE9Vm
zk7t5E>itwCyJ$j1tefR|B}26qVV^YdP@~thcZVz_&%uIS<mhu}0k7JleAGq_9oCa+
zWx$u^)7Ezc?`6tW2$7G;w<9NVnJ|$-Y|d|&tJ$`dZlR-WsY;+s9RhMhmSJLJ+tHS}
zUZmZxgg(>CcM;N3%Kx7GHB-%Q5Br@0#T?~y1KMM_OqvARdvaaaBGHOBmjmq_*ohh?
zX_p4fKy$%1+fv{7rdP(pMO&rw`O3`x`bJ^5!d}UnhTCPek$C2&a8u<?x;=d+v)^;M
zQ+a;{f!gj5EFOycDkb*oga)@bqp>g9hC-Y?>eQBE;dgrPx&(@ltCaOxVcxs>S#%i<
z)yR2ENNFSA{UuqKMXEu4c7}h*wCm5NdNkD2Y4f2Y^H@@X(YT}-*4=?9V$0vgyU0J5
z8<@E1z<eCO5eK{I#S?k<A4gt279(FZZtddrw|p+V!Utsf*fz>sE?`(etwb|S$*QZZ
ze0659*y?r{#*yii-1g~+@uIj*P1va+N^T=Tj0MEV)L;6gYuj#awaB7e3w!5w>?zw&
zOhX<GY{q|B!3*`8N4SZ<HhXh+Dfw|Z?C)PG9`Bm3)Q#&@mwTGml8xGt@GgB8ap5B)
zR+2e7Q1H8hQ>K&O_%l6*%N|DJqI8Ifs?P}LjFlX{s$)pa?1}_=;OP=}k?Gp5`Er6y
z!429JXsR2i<K8NA6uKBVfXt8Y^D2UPIYtf{F23ZMW&mk4;r}BrlkV-JAw*I#12oWK
z@6+%n1NreGqb7yN&s&WKMV_2Tj`%PgDdD37hZ|(S<<yHs@znUMKRHEU15VxaSI<+X
zUe-p}pzDAm*ud}f<rcx9I(+(Aa{BKJ#m8)P*}><%iiIWx4nHF|RsDFzn}8T#ys)2j
zr0v3ZU9iQmPr^e+TZ$5<{iSM2CFHSRpMIdkc!TlC*Hef*kK=u#22zIS7}N?CglGJE
zz6}XPs&=ixhZc{mW@sH4G`QCm0#)kEXk0mfRDEhLAzzq8GAkKxfn<~`6FI~9p>$>=
zS&U<bmGEyL%w2asZ8+2Ahqg4Olu75Ke%sWRvVp81c{JZ7nS$-zIr#548L&JODYqfk
zCDBR7IzX8Ehj)%xdz+S?sW_ic!;mn-3Cp|8`W7-2a(^^KAwcW6bhV2ew4(N@zBm?9
zRtCE&Kn)34kdKAPtH?QBCv!oXOCPgb--lE84oe1{e*9`(5V3aivEM?Ui{X$#U|L*R
z%alav?MJdo#uZD8aa=z!@y{D{*r!ilGa6SrQ9iC=JU8YlHnd*H*>s=E&95Gv6*ZsA
z?Q;MSHs%eD<O2yil01h;4K*IcKa&L|d|0=NNH%hI%pO0Qhqu8sKlMTrPS0&GM5=}#
z+Bf{>>d0;jY5cu%?~#Snzq9rYv~XQ4+I)cJVgO0SEhpT>LI0_nxk|zfR;-jhTib8E
zVx4@y5m}|O(bqAwhp#vrK=clpQU6oWPrOKX^502I%^zPmvb{I_RrB1KNTeC;VjU+h
zcMw%q24KAb+Cx0?2MY+m_j5VbEi;u|eWHNpPYW7IzteKyp?f^#1luRy(4@h@6bm#U
zDvyjzCeS%r0iFy-@o&c>a1XXq<sAeAqrA@_xj8L)d3(g$7yw?;tbmDmWlUNq*f9g=
zb5zr+nW>Et<LrxsOqKg55ieDI4d)j;BxVcD059t3lDwZ{r!;qs%AXm9Kb`&k#I0f5
zUFsqGE(_6P!6p;-SzB?C>uWw9cBU6Zo`Z~ZY#%$>s=D6(fdf|9Cx9*APyW)Z^H9NM
z=Pg2heC9<0z`Jd8`TV`h{wq%3P~+GX1nj?Zn_I!#hbGHvv9$_(Kixc8HL7EhgX5>8
z1y|Vwhi_|Ho`6#gy{CAcxyHXfKP`XLt4mr)ICYO$PFL<AR{?GZM%h7i+<BtdlE1P1
zt1xlt5HgtrFojLLPUb2e;UiyQyEk!&kH7vB!Ls(;DapjDf8k3#QtYj~`156}{jc`6
zqToL&at|<%{-P@?nn+|8j1u=Y0|3ZsQNjJO$dRU&^7lfO`y@cszC7}{a60ceZ)e{%
z9<Yz0{XqUYCE$T?Y*pmI^HO>zy~zU#%};G_qO0Q}#IsZggP9g#$A?Ce+9~nScb%Pu
zF1~D4L2jpuDo`p0(0L_P#|3)?HyT(yRhsqO*&CAcbN|?q_9LS@-V9F)y7P@Q9Oi%$
zFayc)@~|tUxMa*NB=+kVDh{X=aDjq@bcme<eLm&d#_%G_qJT!MIV{zIPD_TI4$)5E
zN#o(61drk*@;p5IEu)+7ZmN85tO@<&BLPgz#G6p7)EuF4hiK%F0iXTkd{`lTA0Ug`
zd@{b6HFuP5b2krcXO~IWs)kR*BFfDn1<#fY(uvnn>pKl?-uXeBg*3*(3p;fPC#nc`
zhk6ugW_tf*@*+4gAI`_do61{RR1tYL-`NhhL~LId!y#9`pO#dFkNCCXEQxcTDLJng
zZnX`$7oIwXh_h9p2gIJ#SesT!{z#=`7TTh9gi>FdoxB)F0PB%1hy5Y)R4^C+@Ts6)
zL3dTdbgeKF>>>oPLA=TJ{dxIPSs|@+4v^T}K0h&jnmo}MBeX|Fl!5urq2^w*T4H)W
zu!b<1hQdUFwC-6P!fU4s=t@=BL_FQ_0ke&4a6gX(quLD7?=6Eh<<8s+M1{>s#T)Rk
zgt7IvqiP5IC`R-Evdf{C;mLnMpXkw0^Fdy>R&b7@P+<`|bq{h8LP_avS@u?>rIbES
zp2HV$R8d2gj36vF!+WAV({Zasx}`Y6L{kYYA}4=>`!!#!{2s)dJj{KzlK^(_HwoFH
z-~nGu{XbvUEPQEAs#r7;sqLutwsk4{Je*08iGmr=!7BlxSHEn_%uGu|Sih5{%4it`
zWY`q{HpN1M-Zuu2)%HB%c*bm8FXZ<Nh!766+GrurTUl-|EW5?7FFZf={rU1}Is;vv
zhfS}v5>3&PI+C-@;m&nSM3WC-ZAPoW{Y|hb$#Z<RDhq)CnOF@tIbs;XG;$B4_G@N3
zYc&LMI6G7x`c+-;@ZtGZ1GKvkZTw}2fEf7*Mo`m{%NG-L#Z)okYa}8^Y0^dR*jQ$o
z4Yb6v$G|Gts{ZpFL)6>K70c?bTAF&CtHQtMM?|T%$qjXnv7z>$F5!a}vXI*K##u+-
z;0FvLpgDGa14UcGt?kFT3%=?#37;`24ZOwdxttgJSKo(}=7$d?g~^DuIDzi}p~XP{
z2ScDc=^or~Hg=;bX@JEMz>Ek;Q!|N<;#Uz|qlE3jt`_WJAY)uQGm2IVBuJStad7fz
zd}iR&kYQdrmJ5>lGN4T+fWNIF3XGREF|mLjNJ55t;Y&uQ1#mg?3uD}bTRVzP;0;dD
z3TxGk7a3O1nU<W<Z$?rM+oFk=LiFSluCq!J$Z2&fEYpT&jn!!rC5-bax)?J&#(}|u
zpPhYe+hcmMz5l-EclCpNvN(@va)196Xw$kY;5SVI17>>poMNGYu|{-lncFChIzxe8
zid|XQ$6p6mdGV;D%H{z<aPJ*cFHQ+<>y@uE`CKe9?qvaXV2r$k`cwMo?gYkF*P1K@
zA%^6I`^`<2u_zKWu~y|*<aum%m%*yxU43%(w|}xm?3_BiFNG(gfj!ACb2mGP&wMKI
z^z2{h)LUewBJ0WbjY~oC_I|$kgwjx^?Z$=py+&;hAZus89Nfxb_`rfFdH4>M)CE_f
zFB<kGoYFXsX)FbIjfgSQcXsH-hDEbSnqh$LjSf-)!&d!Yo8Fy1UEYh3zDid{{`iXG
zP2|ECB2WMB>OULYL<jpHo()1Ek3~|!s0paQ|L3Fo%CuCY<a_N#7!741s!*Y8fg;Lb
za=-Z1zB^^r>7xi}&w3cjN14qSANf@I-eY1aChf(pvyvW4r{I^i5v$?(|5eQ3Lw5h4
z79hYc%}-KVWvwFWVPBbk7VTevp<-KX5P`_*#*qOa-TcXx4Lm0x46x=9*ljUB6O4u?
z`XPpQ<c0&P_>RUn_%25IlwFy{k;)wxg9~?{sfm#BNp3wuR{JCFaFj-*@X#kIc9%vL
z562`8`P0tVq-Cd=ZWMa&>m~n9T3?p&{vBIEXlKY<yiBMCF3-ayEzi?%%~+AuiR+XN
zb*u&r#v$rrS4Vb6t#BL(?&fY@hSG*JNQX)JP)wCVPGHoCi_u)1-ieziLZpu}Y4`Z6
zbcET3(uf}BD-Biuoj49xH2F;A@=XMkBOK3I7F%09w1Lb9Xv}CS-$(~`QVHkeOFzz6
z(#NQ>98xV((((^3T9ga>p@~D@ayjOPRF0V=-#7?*@;DU9haae9$$iJi6hemaonU3e
zY^XeJIu4Xfl|K3mAp&<m+an)glCY232)joFl~<3_T>y%o9@??qis$SM&0J5fPJbF~
zw;dpPQ}(UL(dJ{Wo|=i^pY$p(-gsBJgy<k@J{Wxj5aI_jt{FL<ZO=|Sz#EwgS$D*P
z-YbT!9}X&PSh;?m)Q4W@W8%y(cx<!JUY`sXZ2cw+?OVTNdQfn~pvqK2E|v7_s|bb?
z5=F5?lgrkFu)6R@5&9QoSiSUbX0$pOG|Z!DF<~rj3U|6s_obE%%>R1DYCZok`6uob
zJUWdxTINP()4wMWq5O@+p6YR(6$Qm19{NN*gfPf=ymmt%Y*xok9-`>(a8>CYafA@B
z%sNX*KgEB?Zxe`oZ!-C!guHOiTZ}!GJo%GhGPydLAKuKD<6A$}I+Wu&GF3mItBnio
z=X>9+8~;|2^wR4$b!6p!?3`XAz=`(*6OF#{350fB=U;>f(LuDW93{2%e#szY6Xkm8
za%sTLs2G1MrG!|Al9Z6v;-Rfa0}#8V*hb{j3+oYgRB3($#aw&<3e-y|nG&+LA1UH|
zE_1;p%&U8GlJL-f#sYGZ;6CZ=Gfa1Q;l7Oc7-eYq7gcKzz03fnV*-77hj*3Tci`+&
zAu0?4azMw6k(^J=H-m~3q}W&KY3k9<QBqt)rpL>Mdl?i;u1Y9H)f|xN(n>J%EGP=L
z?!NVq_s0QLgZ;U_Y6q$G0A=^6B7766#ginDwIES*n~QJ8Ji73%G%R6x_^BClYDvB=
z6^H%yMk>n+cM_CmzSpT#;BYe3>}jp>t?Z$>!aP1{`H%mOU0vuvR6ZFHRg>FHR3^bU
zokYrf*-r^6sCF8Xf<cb%QLysrO)YLHgY!9UD62HqV2zH6B)u>KPZ~>syft4#Mn;O$
zhvN*%tZZ|^;?TK>R~Thgf)O!S%~0MVaw)km>TvvP&g;@>tlxNI(L!9aXFkmbTal(`
zyf(|j4eIOsiE-XQF{5b>025o+GAKY+7wb0LNeo-$?2r&nHHaI5qiEjIM-ov@f=rPQ
z{YOtcm3eB~+0z`fmH2NK9x%Ox=SR%lgopB)wYrZAD$gIuwcUF#5;E2tjb#iCGL$6j
z9?czNhAX{~ladL0_RSitAEfk`H$-qfu*6vM$Iq**=Q^->)8A$D+(E<s4d4w~KOu=!
z;sDA8o>;`02A27PTHr|}&pR1x@zZ@$nyMd#TX!rt?@`J{!0s<{6GCaB>N`izLanad
zwr~N-fK6T$fpOyZ!U&=gYT#rAMeCr<aHzEXDJ8w<KM3A1=02i6AMqi6CuCRlb$q_-
zGt+=YK`Ne(88;88*i%M#wxz%;!&pLWCNi}TG^L=Ep_Q1+ly_5v9ZrNJ?_N7VjMF|6
zt5TPw4L`mpgeflC$GPTj`<+XxQb+GWO5?H+VW9*i<U%9#{v7^rtO2SQ_=|sPL>uY`
znx;oyAddl*Wx~ZLf}w^*lOK)zwlt$Pc}8-{W+aqAIlbhj9jKupeAT8+v9Q8M$pR{1
zAeH@|@IVTpu5=I6hzY-lqT+(3ke4prWGW-&FW|UqyPUzVLviLz_Rsb&v6lozkYFyK
z1U{T1k6@)E>OX&QREf{|ss9S%%qfvesND(S4BeYYV3DwcD9KK7`Wp5A4NcQ4>+#{f
zuUn~JRSl%`Y(P-XN&_R*V~CZs@K(|J5|PF#^Tq0W14n9;!U)loc`1>Mb+z)(Uv7Nh
ziMSVXv*&%Kv{v-nCa+0LO~$u#jT88wva0xV6!{8TsCaB6Y7gVv#!!O)9dR~$D}`em
zol+V8EMd4bm3x4ezfFX!C~KdBIsYpG?0}gN_5=`&yrgTMH*lBNJ%pgQqB~Jb&S2Dj
z%owJkOa?&Z9)!9Q7XEZ(8!8k2<T{kq`5cDf`B1(-^fd8`J02yOJ}QTLWomoEsV`17
z`pSRoYPWt!L1cuQ{guiN5%FnZ)+k2~X(Oep?&Hr1YP*MFvmmuzdr@H`Fsdw%5ZJoO
zhKHbLj3vc_-DqJV`2G=<(Sa^}@rkm{^^huu+Yx_n59%59h}@P`(v225rON0H#TpqK
zGTK(RVtt>pX<qu+^VdrHh#XRLjkC!NJ`gt!V79Vyd@F_+GX|A(K9ABgVSvLoq67)&
z2_p=yNvn)phG;oIgn+Zug!SLoPM7n_wVwh5a>L#o)>uTpz!+PhVvUVVTwvL8z9SwR
zvLY|B0~dOS3RU!xVFvBus8X6BaxKJ`Z!7^c6!eM9nmLCV%cE=Ypm?gj=fXaPN2aVT
zl#++@YvsQ5s;nyWHimlDrVnsRlBeVAi^H5mYCCDLo$?R<Xncn&Xg(P-Jar!P_y-4q
zKpm{|n#gm})n(+yw=Ie$PQEk}%)=hb2W5vwS*u>k$6x2#qwI0k@Km;(7!P-4!hBA5
zj4%W~)UzHlB}o>=IGfJ&?9uq`%(QDy&y`h`er_dPs<6?8438bPBL8BpJu;pp)H;i)
z5;Bcu!59Gqend*)D*Xtr@aQx6N0lD@vO=_i1~A1D(6d6UC-&&=Yz6{OHYmtu7YGr2
z(4qC$(d#F8Q2BFf{1Qs{-r<p>lwTj_%WV7&>w>8Z$)AxwqDQkid#@#|MvxcfiR(Q}
zZ56_~ICGWRg`*5djw)rO1nZDtC}LFR{%P*$q+N*oYrI$59&~u<c;e@g54JrG*g4n<
zVZ6k^@HqM&OBIYj(65FVX2C?RLI{Ii?6+6?n_+sxE*;<RBF{3fnUK?ZT>1Ygv$>A)
zK`B&8$z)V03TLUth}NjyBcZ0?HJ@N9ADnc1Iy(7JH!9Bf@1%9bed1G`3$d*THB87W
z%ftao0Zhp~-wYM<{DLZZ78w=51)xTNiz9*sWo5@9Ob1PWI88F1->D5nNE97MQWkli
z%Y>4!r;Wxz5>a{UH!yiY5MH0mZP<+3?+;WAi2${AzmyFLW$zXU=B12(J8|ZWe*`;j
zn>gCTfWmnm{AAMrD7JKbjLE`xVMSe6J-nWR<7pA%BD>Lh3jUqMapUf?>JyfL>VmnZ
ztB~{wD^NBeKeAN42v-juITG4^??gNk`Tph+RQ#Fb5A^qTelr*uCroOL#sB@^iVrS&
z<g;l4ERv950`@e);6uSR=IUQ8m?LC%!Lh&k>YzvX6{v_wjA@5UW&6m)Tf)^0$pQ^q
zLWF?~2=(<vLIMFYVZs?;A@$QdI)ZH~Vbx_&APV<90rS5{GC!tyOAWu<zjc7l04u0j
zS8G#B%D~=(Qgpw!T!^KdD#S#}`QW5{ba!c|Q5+>w=8=?1AQtW~;glJeK9c0FnWWK4
zaESe6_=qMt<BpDfKFn%@kg|&&trV1*A8ebMlk%?@ap`OBw6T%ZEtK?D(%sB=0{S%y
zoFT4A(&#<(9jkFH6XI;<mR%Yf5K57jh?%=lg@>U!r{4CpHMpaNa`r!OZ#7@$y-S;P
zc|Ydmx^}=sm55xpL14O&dcs?CQTXFki#P3G_FPGv__H@nbe+!<*cPK6OT4OtD_6X&
zhfvOE%kpgiN)Dd<m1jio#+S@h7IBD3f%9!^vb)#oez=$y$|XKUf&Exmc`xFqq|Tlv
zNtHRwYs~yUg`Q>-3*^8kR^cUo%^0&!^lLp2682aLKwqdx5)^NeFpzh{SVV4(iyl_{
ziwSe5D1o%)8Uz}%H$M`D#kmRtK6mzN6iH4W?O+?{_Kl35vz23UI@Cet&O|bDCd9Q-
za>fXuG?l41Uw>4CDi+axGrsK-j?AfwV4N!DCsvvu)FO{%3Tm%=Ln5N+0&Tl*l57{I
z=#%J#i^PMM8lX?pS$6!bzS-F-^Bsd-{xroR%y@V}V;0Rdc>wI{nlgJ(kx3CH7W;c*
zW=uzjKfRt3F`2Y*a;ZnLWcg{3j^}8erQyFiV_9Q<&*Y>31@ubMC9`%{>?j56iy=^@
zrPJBo!5R6!b*C225v@|8u;CFu_ZIB4kSQy|4#NMZt8rDJT(G>;w_9t^uJ9=6XNn|s
zBz8)^{~g+a{fgl>^?jW~v1xN};^~CTD`b6*{tN!0=!bfmB+lpl7po(Flj*|@JK2iK
zUQZt_wG$^Vj28jH($|(lxquE=EXasweE~f61p4`i4<}rK<(>P2_co1!j|Ck@t@y+K
zDPP=Z`<hV=^9$EN{gk{@(+<_Y*3kO(_b5B=PWONvyy3i=>&zjiaLGU;_TqQl!;GSC
z+VX&T&Uh7cpBUW$yp4NZ>)q>&MAvg#;qIRixT=jE-<U{JV&7-&BDf=`E0{k@(VJ~$
zr1Ch1s<v>@ojh0eD97H(zR-z_gPh<a|1*?7*4w7`steE0&r6hQ=*P+cyi!1QdqJ#K
z+|rHj)aWy?OB&cN<dMb7%tLW^XGV!dvh__OYJ|05dSc6Z_2WFu3C|jPE-A;Bc+vfw
zYuSYH`PxeM2ZTaeL8>K3;86D9yol^-H-xECZ&Bm!ZK2Ul;D3Cb7KB<Ilooesm2lm%
zSPiq3c+;6TRRtA=U@`#Wr;u&FF5j=NYChD^fga$OP%{<Ygo3)MM;<}BRLRmOwaaQv
zK01D$kiQ=oN@g4_VMaJMOk9EBNExvAN&2<xqRew3yQc@fkx~A3s}U-_Kc9E=C{<;c
zs~aJ68B+e$p8f8Rr+S9Vl0PAx&O>G42)ch^a3&zh*bUG}g%^sS?ztt_fMYc-0+3JI
zaD(GUnNTHFfj5*G_K}<Cp(LF63wYp5yKs7Wsj7bVlve0FP#j}_*FCB=W@<(_Dsl+>
z7gCx+{D3NV;%{lf9iGWVWAK<v@0gmy#AAXgnCpK)MiJ%#ZJ)Lf(Lop7eO6vZLAYo?
z1rvLDYk~@bL~%Zq`kfo|T@X9%7fp;Zln$k%8e44R>3&FlPzJ6`o6M1C+wK|voBsX{
z3Q>z}#HivZB0M1%0@T5(A}v5!b@J*}lXp_G(fx?9FMVoyl`3{&`pGIpz}KSri4JZn
z3V2KUX^rb883ljK>$;0n>pm#KFU3Xv=fmF5w^1IpH7xc_hU6$nUHxUDrh0%n&FXcU
zF<Rfn-vM)gkqvvkU_==eo<2qj)p&mW-x4BGD2jr5bTLaOlI%fmApABz$6L%v&?xJT
z=Bs~-owwYqRU!0D<Q8$A{Wdm*3S(7_5KB{lajhpM8>7-8&MJORuF)R8=8AE=q%##^
zH#7i(%Sss}=agndrNTNerFwkZ<k88QP6kYp$6P|$(-5}k9n`J*K$On4m*4X{YcmDv
z+U9Lh_51>c(YH;4?D}I@vz6H_W<dFDm6YQ})<L=OZHjohpq>DBM}kFFqlXFYQJfcC
zaq6%WB`mW~d?olN!q~7)27QeYRuvMt<g0%}Z7a=&1Y(ku;kVZ0EbYf|+&Lm=@^H%Y
zQ8V~3iPR<AB^Z7om|lF9Ay(j!SuC}9&);(U>Hl*7ZPhy)lHOr;pOV!vZlgE^K<~WO
z_xWuEtzGZJfSk|$c=#K(PHshexzZ2@v$w3#I$I{`Zq&WjDswa(OZe#8$(_+Q^B-C-
zYuEXp%xRX9dR#$Kgg$AWD)z_}j22E>!8Xm$i`huJ=#v=gITZ^?kbNo@8>pcGS_GVu
zAI+L;pu^Kg8mtW>2@1MG)HVIeLGxnrb_4Ves7J_=gczPnM|dHUeGPOb=O0zQeuK%w
z{>8lQ-PS}3BZqLi6JXl#PTmS+yG?Tx5LdLyJXE1{#&QD;RQ*xz>`@v;e|22w!>Q0Q
zdl+iHlwO`GfMS;rIMOyy?#27nvNb;e)a_Q;Ez2N$)~e!ymTGW0c1TZaUB2(Ahcs<e
zt8M;fbM^sl`baR`L<n~7a+WBBYJ|9O{5r_<un_(#bCIP_Dus3*!3||j8~u*BjYYTO
z%seC9x~s=h!$u(|L3gw`j-Z?;LbV0Awc#z(@c~BcZ%tp>{)@EQFWkO%;)Wj-bPaMT
zX+d}wBPq^s?D8mUkUIX*>dhvKrx#xlXqTyQU1~!wQgB0;Zo=1?;MOGxI><hMrN5t3
z1NnU9!=$N5?w%<PFqM$4E1}EXek?*R#?us?6tU!RHYES02}WurQWpJ89Tq-o&*!^L
zRNJT`+U(#Aq*rymS4Ivac>u-2M~RQM2&c0zV4flz6JqbBqgtHHqIIJw%xma}o3~Kc
zrUH_=@83~c?U#d=Uue*$Gnd|%e?GG=-H5NTZHB88+HXs_uIs3gg(1bDr~5ff)n3UX
z{udH3wSmaH?C(`mO*?)<RvduhnXrLKL`Jx%+s4K(!+5qpPkRNxlW{fTSjK)PS-8r*
zFuWt#&F{BFp*Wl=c0v8v9vsY9W)L3n6I@rMfxpf}q*xnJiU2KyWEF1_H3E%Ho1`Qu
zO(JBt`*9nLqd4l|f6alJT`nCV%gB1LH`Ki2it4<l;!*xnSQFs<tx`4@yvQ!C;N;e;
z+|9d@##bUkBAu8sjOPfzP0|?04M)>w)|4&1@~-P5!QIK7MZXSW8vi;HtAmmbpFOf@
zqg5Qu#Z@K}8W?7bRs-0IXXjj~S<Ez)5hrnLc#Dr%c2QR1M*4e!@<zRvhMmAmpfzuN
z2#o0X8htX1$;r49KOx-rkWK-249bMJBrVbIqpL{yUTUiR2$Jp*PGt(}5hc7f!XZ4T
z_}V8QXY~AyWH5nE;4R`PuD!n2zF~@z)F-zT$<4W(xLZ5u+u&Xy&MitV@e+EE=Q^v?
zk?+LPlZ7V}0EINGm~+NAHSI!h0TB#c9(W?{BZGYbFC}(8>}u_GV(5|v&7Z{3yEp|Z
zQzKAordXLZHt+pUvSQ<Zc-N>Cf!2R|chtHtV(G>W%1qT4WugphbUO+lZk9iW+(+In
zV`{^f?`mqNDo_#TV42*s%Hmj!zDhj6!4CSzkbdT>@$G^Q3iGv6dXTX}#k~wo<3!{c
zMja`+MvX<CLGj-yQmx?wCR3sk><2hy+ECF0)-w{Eux+U{6-ykGkzAArJY6XL!V6A~
zh(qtVpO5Yf0W1PRk<WQ+OfNpsF~e`Q+w4}?U60{svYBG@05@tAlyl{u=#}gf_j}_9
zZ^9l2#X>O9h%RvpOooT;W$56-LvWyi;f?Ew2<eMy+)I+9z`OIOD|~G%!DA`2!HGMX
z@brNwwjzq&D7I@~sLt#I=Aowbs5rln9lRY<lTo6JQo;%Xblgd-dTV&417_GL=e*~R
zfT+#Tx@X%^2m~Sn*5J15>LRV-O|ifzapazHPDZvkeSs*Z8GkP21N%NgiK)a$AH`gZ
z_6S<DlOa6ML$c1^sSZVuaK@@(s@8XiBNVWkb!nxs7F$k~BR80+!a;iI9SdN5<6bpI
zorvepZ~qolJdA&3vGICt;c=jLpIwlFZ4+?0qx~uy&@>ZyvRg=nbpgEmejkzN!O{Mk
z0CS)!a^&_xZ9|n*aYiiAez=JjqpvX0>wxi@x)H=E`>kOP#WC88DA)7R&*>mVgq#1j
z3M6W`_i#dOUUTB6zjucaaz}?w2tzV&;g!ak4BQ3%Icx)gYPfPWU4zctUiR2empGLd
zegMv|6%s&3R}SMR^1L4i@L_&EU(&vwUrhFd{cD!h$<@8i51r9|G26ho<$BI}>FPo3
zbzU0Rrqy%Cb4efisOaoDyb#5L-XXe^_-!0;$D{o892>o^^5jYPA*$x-aP2YX;BtrF
zC=jX>)}}c4*-#=|<^FR3$c!>rtENV^<K$Vg+%ke^3-Vb(9aXRpM4wC>`KHl3LaKrr
zR^)Ap|527!nE6E%sY!2?(^>!@6+q2Dhu@JUqV(W9iLW7d)YmcV{uhlX8dXx0@iI)x
zFT@k5QaEd}hk`_o%`Nr|2()7U8kG1kcj`pB!6<h;87OVNVa7zBv>+mgjP8J{i!C|o
z6Ee$x3M%&4y_=ddt<c~dF=tSe1^YEPbbCLWdL#}bgmHk}F$@tn#Y&AIAEfwQkYi}J
z$kPjN@KkB5b9-0)!^D-PHlm`nQf;>5Tm=p|K;4P2$jF%f#kj>1Fmj$F@{BaK2|2!p
zasRbgn<-cRbob093Vfk7dix{o%eXo359{sLgi5G7j#KPIp0<EHnah{$N-iFy-)@61
zc3v4|UW^S#UyOh+OmNY)LWTDgI<)Ej%UmA43eR^L1Ha1g0B(h?&@2bb%>XLNv?)q5
zdq(oZSdA@p{E!h249>OcH5q&Kr@lL4<>e!xJ;lBYT#RY>nF2hd?@k`)B!LSSMd+@X
z6~GnFi4NLv4hEV`TsRlb)*Uk^dHsF#*W(;f>Z1Nid!$LG#pVnZpwJYz*~x$BP}ga$
zYz{cnm$oYd&_S4+{&2J?KN+I$4)N@_Vhu<G6kTXE<`o804(?u8kZIT?DGiBIdB>ok
zUSN;H@sSO)?ifJ5#<{LsFWh5HNSsN|69JKb@jQ23!;i|6BnDIj)q96j%~Z+%?sl!P
zccs7#S*spN%qZ$kgI&htfMH=A<D^g&&JdFZ_~uzJIXZU0<w+`eOzqYV;dlh)j_Udc
zEDMGL2c4oVjL};o8^K-MbA(q~2%ZJ#gz=~K?{vC?AGPM(ZxCcB1Ts?5R#7*OF^6KI
zW_kgqUC|#>SJt*}cHJK)Ttv+xPYf_juN~TY5Y(e8GmhjJBYl{Aa3zFbFVPpg^wBs>
zI#h}M)y>*mtOHc&I^<#yOen`hI0e-S5cIq<YijiktBrK(tK0)FrLOSSgIUvn2|Z}y
zs!Vzrp=>|J-OTWzgRwi;Jf5cQAPLI?Eyb>)jFrg-T!3JHaB!<L6%^*I9?qIJsrgxI
zoaA{_64R6Q2k5ZvVe=P9FGD(u^<VD4%OUlCGJej#@B&+rDfw?&y&^0@<moY{4F})v
zDsT;s%T_Ih-t}W=e=RaO_pG1A2)~ZPA3)h7B`@*9#jYj78E>f`kn3#u1@Ewh4F34<
zRu;udlOO_2bO5%L@87~@zXr?Y6M5=?MvTHC&tnmqf_@=Ub)ln5BX>AR&R*h3>SqRu
zDqDw<BR3;ew;UvWm02N8ukKi>a<=Cg9Irl#3p~!3&+kJo@&j@-jrQRB?m}CZxWLm7
zO<*1df3i*fzLNx<?eqz2nqkVe?W4oDEXKYi;co*pu@dxi1M@#R2gFk8r-35000N|x
zn!s0byEOpU?ABO8E$sKiU|BM*PiVS%om?b0&*oyc=G*^ed+A@6DqBFa(2(P)>PSWg
z4BzHHT@xgKyvp$uGI@LIA-FZKPt&I$)mcn;{RsY~X2lXD+JX2Q_xGnjNFWMeM7oTp
zxGCF_k15R|BxLTjQyjj7Rp}}PETFl#<>Lnhs@j!|qQdM9z=o*mnrocRLB#U9_8pK@
zNhc~Yq1TIBTRDtBbEt{)g1cUvc?D&?i6#YdX3*3@T%2Ozr>n~u{|)8BXdEI(`k67<
zWtEa~H?K(a%^yoEDb0TXqGQ-uSkGED(OVCc`5O_UUX%+pECn49A_}s&|GuSCEFxkc
z&CRrPeUsY9!9PS5nSk-R!N5JpHB(&d^uIe1O>9>zRc|l;fL%OIoC^TId65-TSxt7r
z{L!@l-ItH{5S%Cty^zcFrLv!-X1o?)05ujVi&C=P19nvM!zIJ&W&r?9t+T6a20+&7
z9iX{c|FHpk@K(lxxA4Uea5`j5%%mCM4Iuo0XZoL1Q!db<b4O#!0fp0Vn+HB6UV6&4
zw|ys_cm*P1Fbmd&r&V0841isOw5PZwI%&?WDHo>5!&s{*2TTID-&Q;jHe9L`6rNdq
z2MOu)&xhJTx(%&|_dLQ(^H@0amsbBp&TX9}<K*7g352|`q58sOBQr`eIm(5n)`&?*
zxrg(e;dy&$#)U7c@6uZ9)j|cH{4eVi42~h@ah;la<YMmLu?Y6KY_!a0%QzW1VIR8(
zGlu!~zB2SwEmkJV&dX<R<9YuUs0U~q802)_DagFH=Z)nFVL^NYvpYzdnw>g0IV&U8
zs_w)5;07lr5jpa7z|huKYuwES8TC^Io}o*uF+R-qymj)v6q?O^F$-|{_%lG1e1aE<
z$iqAvqj^ZiikFL9$pKM4*6l_5lFpg=pN7uw&jNKC!7eFj#&hdmqQk6C4+X43<Z2l8
z?dr;)?ZAru827uNcC08DHoSrKyWbIu2#yORTtPud$xxIKtQGR4cYSn8Bxt8wk-;n#
zn10*rQ~}@M046_pmXV_|a$P1ZXYLbvd4(ehh`4GytjM-|W;%K-i=HxAcv|6V1?>S+
znH4n#iKh)<J0-mu#udppN<iP{W_AwM5t7<r*y)@aNu7?N3^Qu#8=wE3NJH-(pk{vX
z<33PJFs2_6wat2a;owli{{1e%fu(~_^$PcFMFDt2MOZvp*bBIm(QzLs>yq+cONzGl
zqbm1*vL42mM@qVKaftmR(Y4gSBK03%H))B;r2vsDPI3&$m>5@#GHp$FnzJhgo7z6t
znm=7}3#+jZiksLN`m$UjXN3O2f_d;$>?dUTB!e4X(?4ZcU0RZ#zs_)YSeV8Ln7~qy
zVqw?A?!lWU8H&KDk#gbu*2_Vw8j!a!J3R?iRB8V@Dz^&y*8L?RWw&<OPiaFlsJ+dz
zY8@;mCl_kejuc%{20~7GpSj9^zlq2b-}}Ds(J1np<FQXU)OB_RM1)AM&?2n7^$iKB
zM_&CiL~;WoLgXHi=OgmkZ4V;?nB2mt`{0B!<)^J6C#sPf{ma7@A-jNAl@@v$|7~q=
zKYV`RrJnl((1(b#dJg1=KJ5qF6$?pu*EGN+WHSJTQHxi~v3W>m%e<k;(3Wek@(u@s
zKyq0I>CL7wZ;biqpCsT-ejvPw<aJ}rg}M#RXB)j-6oh@4ssLr&cF(X1Yl*1U9Obt(
z$^Xaz>079;>Mm+{FqS}{@PFA9z0X$lmYfZUDq|mqIK+@st+*#()}^wx`{k^9?wNLF
z7+N|~{s!bvwc@;gm}J-x_D^9}4uk3&$UPI?G+iQsS-h2!6Fy=Z>-wG+T+}c$Ua=7K
z(o6kUF(f1h&__Izt)9(W3Eiz*ALWkG;zkcqQW>VbA#3pipzs#}Z&~gEa0u(URMU1I
zw5F^rxbiQ5g114wUL2yoI5MR;G*M5Cqd*~BJPWvM9%I1cZ2G&6SD4{34)D6mfma6O
ziT!zv$3{bi)nD_NA~oS72?q<fv)A@~QR+(gpb291>Iz{4Zog`_Y2e|`lJrpR5W5!p
zzpuX$VW~nZAw=TX0JWlceJpk^rzxl2e$52yNDp=az@D0HKsNN_OhGj(p1DwrnFzH$
z9upBTry)m&<U26$?ASEa2zN?z9zZe_=Ru(E2j34M=^;PK7t?2qeJEEY=W+}sc$}LF
z`u)gT8KTT(q<|%lPRZyBy*E+PJwz`sgRHD+_SRnkx^D_$iMQHv)2A!k?Y@1LYO#pl
zI`eG@3!-xMQTaUor=2VDheG?}Xh?=a_T|~ajD4FB#Y`g;GZ{vjMx~J$GEs!*Q8LCu
zB^5%J$@Vfv_EJQ~@{r1&T~eVe<x#!-c)#QQ8Nbi(AGr6NbI(2J-gCa^%UKOFg$U5*
zhhkY|RvZM}x!Oo`EdM`7=6_McvvosUR3x|_eRg`%)IPhzZ@0#e3phP|8morOzVJMi
zm&wKM!<_TI_yt;=wn-=*wepe~nr9=Ca07ifVLdJQRETg}gS6v4oW0T>@=wcOK*|#X
z@Y)iwB;2{F8q5Di`TLTLh4H3#HL0AJHy%fiHrOq9^<+<z(~2KW#uyn|2*IB^$4uF~
z*gs$c8{K}y34XAdm$tFAPOLZE&xl`~OQ&+iW|}`N4Oe2a40<X-M6LWDoK@QbpTnj=
z5>O0KE;BqwKQcr_qj(JZg$7SD^^zlmhNpikJAOnSee+Q0;9~Ot29df6UZ{YExrRY?
z2^t|DJL;YOs^^4n$7-+2(}l>oFy%YxtK})rhgDOHC4(_)G@itkK5&ESKBd^FO@-`1
zPQ}HkT<9?}yvFW*i*~v3^<8Lq4L4*Fd3DjxFW9PHJ6VqFG3Ql==n|48fogLKeD$)<
zDyYAhmE0;jZVo013kOV*Qx~zl<K&mo&R@oJ&P=6P?fbPb<Q)Tzu&BoU6QE80shb6b
zqh2#tQZFFCMA)_82@c-0qGqS<Z2g$^BN13;Nbm6ualz>r1M)3a9QpdKJts9^sFREg
zzO6jd8{|iXC1Gj%CIeE!P)9n99|q;@asN6i;|d)*J?jadJ~zHfz(M<PV|I-8#vMdb
z2?$C6oaVVwG$EGXsrb-o(pZ?isQv9iL1W~Ng*8KNy6+8}eIxPp5ALdQ%I0jjJDd|s
z=0{Iq5IiT&s!J$58V|jy!Yb7UC-xm6?HBLEeW8i>WpgUpRL@%99_y(Zaq#~#K)(>|
zEY)Td!R%)r#K;@Yd!Z4;PntUmrLESZ+lE2kuWn`pt#xOc?`ACQXw+wL)6UtzP)BDB
zTjI>ciQb6%&9vpgC`E5HJ>yZza~uHH7-1#^4$j_m3lbUNYe~@c(^oEJiLed7!<AU=
zR$ascLB#?_YUS)oag^4H)Dx$63L@n#2q3gLAUdw+xY;cg2PEmRYWAYCv#&%B5kI&u
z@;wV|l*+Sio9&L}yJJd|hHDk?jWlP&giC90tC04b+KaSZCCEs13Bj>t6#f7Zz@!r(
z2nHm%Sy4;b8&$qEfE)_5DgMXm0H58oIXbU*ntP=cpD`eOR220w4#+PI;0N2lOQ_wb
zgZGF3O^f^ct(84`^ie$J{`)gD^jRHql8y&fpy?is^ED7~uV~>z8k`JE*y^+!GBIt-
z?ccAUMf@jJZ4hh?tx%f6-N@XQAeZ6Rfz(Xz%nCPAsaHo*TjY^fV{rDBW<YB~*uf+i
zBgACIQ)^7DPxardr;vvm5{B(ifvRMStP$_9x}r21j6RBrO}vho&6qf@PxF_X^U<7h
zd&ekJ(R@&_>cW%!SJh3)JhugJFHaIS2gpV+y;aoV+yh;$LiEQRlWMp8sS!OAmX1Ld
zzmFC2ze$b=ndeFBLyk%~yHBz3(%m;cFZcL)_Tj6$#NdWn`4!k?Q7Bf{myy|hsm7Fg
zw~W2krDMp)?mJCy>1efz!DY{PO2>|-V){GP7nNk<s~4M9qA=BKjC0Ew{nK{gBhkV7
zwtiKeYu`G%U+<#K#9p?%ZC^PG8fU1FsZV&7vcVmHm_B}UeLX$<d_cdBwd~$MnM>Or
zl;7+(V#oN~D0nv#(FnXWYDfgs>w2$P7<8_&0SapP-|6x&-N;uAaU9c^-{yNP<K%Rs
zz5&AHn4q%}!|cf(GEWxRSO&<9=>-x0i$~875hwl%)%V|}G_;f)&k3frWC4LhSf+{7
z+lTm12Rv^-zdc$+&j*GEAdoQ}_fUZRA;eZ`*IS<#@#iK?|9GDshY|5VM4E1?h-Qb6
zkak>EkMijg-oGuk<^2*N5&4wzQ+EhJ4;r5i%Omfwih3$~)r*Ya0Bz|hLlSdfoLK%g
z!+($Pv4F&2+}ZG&6#E|pW`wT1JI@A0wJ^JeRbn;icZXdP6Psyn=a^(mV5il+LTEnL
z)5*os8QmPVePuFGxR|D8iuXksc8iP6G|ifjTFk;fGj)wDY0O$LhktTUUcZG%S_8y*
z!rn+29oVR|nS82)TBwz3bq}|||AxWmc<vOuR<DncK|*XwKtpp!pJ76PC#tPYFj-;y
z@0{Ql;HM3o;E=%XM-4=(vQYcD>tPNRdb&6tvr1}5Ay%xOC08sTT2_pjzN~1wk4zpu
z#4CvD9BlMALUjnsB7q(vVZPOFb$vH0)Gkr3$|ohBwVZ1k5yV70*g|$}XRRGKPgGe_
z%TInMnw>$+)xT;!bu3{JN*;K*rJdo`fhp-uGj}bQ7XeF^-2JH@=G#Vu{6qxLUtW>0
zhlxCyC+11zBa<@i(bx8n4HUra7fU=SCUICXufTw(hf1+s_)kucITd;rP31qDhzYiJ
z03T6r+E^AuKV;^J`pYX>M%d{$nKDm?rRo_sRP{bPYj8XS+hVs|dRrosdIt98O+7NH
z-i|f_i~QF6AM^Gr9%eY**}I#GTUf7r<!2IonyAnwA;O1XE;j3{`z-t=T&MTSsU=F!
zEy><o#j|6)1Hskj{`>;pYs|S~ZB*RG1!j;n%0L!JJXLFOb#R8#^h6Q~rQ(EF1B!)f
zy;NOR4OF+33NKM)cjV3D*9@1hq>4^fauIq68LchrsOgE!uPb(_Gn;~(b<YdDBJF?e
zJ~qC;4!|$jn@l#90f*Gh2Uutg6^@iv<VY5M4P-f;e-Wcy*)h1SE^xlCLw)Ayl=$y=
zwoUG;pD1VM(j&<VH70*sxq451iXC!#D>9!asSOLQ{_$vnI2tY?I=Bi^1F)epZEimq
zw?yyMaqg$`om!G+-9=IO-C%v+e5%29H5(XG>4%R@#Q58^k_usK3v&P>r{$7<>b3$1
z1SgL3W7RO8rDtN!g!y#}Yoo<@M5B$}n(}bvs@?ojmhzxRKl1_#r`b?M?T&hq@!@Fa
zyHW0DiPj^@oGr%}kY&{rXK5nXPy;Dy++1tZ<JAA5{f*0(-|COz#N*e?3`I&tjzT>H
zEv2(4Md`}w)#FH3!>M{Jc(-?LLN4jykDf9YIB~d7xaR!xwzg-5S8!X|CZQQ6hn)E{
zD<H|fQ=P<nr9a(LgfhvQivDBOC4s)Rxz*zj%7rD!QL}<~b{ZcYt(84RO|@V|EuJzS
zB;5TlmV%3>s|2U5ufLp>cvI_A<mIB_A>aT~5p%FKZt)NM+LikjES$ZD2hd4Kw(RDj
zrCFhgooAaqzx~;Fw9ih%<Co(FxNbI$C3BveJh04>EQJnt!mo7SV06mRsQlb9mjn#I
zc<{1-hFm)Jc!YnXk8GZ!sOvQ#>)IkY>oog6|JnaI5!}mvc2&(>4pg*VQUbm{fx`|*
K@DFjPWB&_nDbS?=

literal 0
HcmV?d00001

diff --git a/demo/documented/csg-3D/csg3D_mesh.png b/demo/documented/csg-3D/csg3D_mesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..bbd3648992cc8ddf46ae4137103eaf24352ee459
GIT binary patch
literal 45855
zcmeEtWm^<b*EQXOw4_LPcPZT<-3<dscXtU$2~tBygS108gNO)23<wN8qQJmVf^<CN
zeLv4Xct5`910T3%<~r9tYwx|zTKlBD)>V5#KudszhW125UD*H)4Z{o#4Lu7F1NEPK
z)07!BG$u3+Wd);<V&p*hf{k<N?&CH4t5@%RG$p?gqGNo2fyHc`AdFpG>ELQA)8tq8
z!?+}FUJUdF^G!#cmdaOd?ts9>yWxz(&++u_3^In$x{f%NSOOeH$q%foa24Vg^cWQJ
z8qJ%}m;BdfI!I>dS_7wmmk-S@WA|&f8<&HZU;jpI9tY+Y>i=g684Dd!55%VaXW6oH
zlbRTzmbRM_b7LK96+r8h&HjB*s9HazwF0#qG%LyMRZwdzSCtL?pRaMHYbH?sTZXhB
z@OZdUt48$y|Iq)N7&+G3p5ve*8pWUWRoXHCua4}{_1}BI@qLd+U4=uq%D*F+NS6m=
zHVe`nPr-g5-|etHzjPDwLuZN<YC5~_*HsxKPWg8}Irz}jMfK<K$S0*98Fu3Q*7@f1
z9#%K+&)Ke&{U>I|M~=bAJCqNerR5b4GD?3@K=2sKGSTFzru^;LiKcs*35yf;pQ34)
z{g8QO3Od~aP2RiHmcRRD8SHwj^P7s2Qs&veL-(-7`(w$~lrX>5F6l2_e6(g__T3}4
zotfN5TYjdgQrFrULm_p51<eYBI>7Do9Z$*qS@=b2sx98XFW<$zXv$yIB9XZ+WH@>*
z$>+O)Xl;++6J0cjZOZm5X7AVPZI=3jkI>?~&oB5ZGA7MkvKqi?VuWP+2h&r+S6Q23
zZgRYFDz8p9XFnA_Ddm5_%j5P><z&^*72T<5ZOnu5WVUznS(?yHgx0EaJjmK;sf-C=
z{e$hpbA^@H-)20TqwVy6mL|J>8pu1~@Ah%KG%6C=kp5;1`3jllELD`I;7socY!8O8
z15NlFmla;4(&FbXp<8^ko%_!rRY9$-ABBW{vK;9uRa4N4eFq;m9xPQ_5ldt#7|HAL
zNp+lKYr832>^^QFwvyzYXH#2cEGX{Z`8-~5{^IZyT*b{0S;fs-98XALwO-m?N?Dd=
z$m`tMl_HlpOXaMpy!i8`ZDwZp7z1GYep+Xe{_3Z#y2{wayCOAI0KDVvN@UP#2ZZIh
zDXKH;Z20b<+E@<))AQFxh!yz%5~Z5eMhtLm8d+fM2AalX0-vNnJgj;}n}X0~$!wz~
zh&L7@o)*Hsv{Y9(+^QM>+Z4B`lD^5vH2LQ(X6i(~#C-aY(Rh5YnT5TuxiVnVMWRRW
zaGxk7)MDQXq1E1V9W8|&<ikQwFzjw~m-eY{+3R1``01ihUN~igM$hNT>wiO(>2F_1
za$%tcA<km-;wwD{J}CzfrlwQq&aAYtJwMZZ&vUvhY95+9B7PDqcreyqmYS-O@P@Xj
zE(Cw?2_1s=rQ2CL9plnC!DOd-b0ggu>|LB2n-s6-bbr0bVd~CZ+X?C5T2E^=Uc9^S
zfvXm6QTkH*O)3Mv@jrCZLD?UNKc$G}z(Pn9RiGW*{RI#{eUTEno@trkQMI#>V2g_0
zc^04cY<J19#7W5X3C0>=mx?N3{p<#jLhrr5jyf=>|HOvnh36kk5KZ}sxCU?vP$lKK
zm|>5ek<<s@`$97*>po~IACynPe_mIZv^9AK)JP^&P5yyq8iU(uMST4J?$>V>jHEXn
zPERqQYFmeBcP0MzsDS@BhuX8R1ypZf4djnKsj5bk>plV5@eJWRF|>}qlH11?NzMjT
zf9ShE0UH#ES+rYw1>tCCF@$IckJ_N!j(=0z(gAqM%aP}S9YQ|hWSAh){^f>HOgm-g
z@FMTkUh78~5p`k@p7|`i#t$DYSf-u=7tUFbu0;~;$8GcErKrp+3;RgpR^a6uc<P3l
zsAcgbGEj|1lJq71bNA8#(e<B)2pf)31i37#wER*;6(EAzS6g-=AAd_e|Lu`ua=oN)
zFYMbdB<W!;;sYR}8W9HdL{{4nfaKTYeq8s8mI+%jtrOf9-5a>Sga$$bPnrigZp=0;
zk*%KWf%=>!_+6u?B_LG2B12_m4S(FDAdqV4;icHB`3)Dn1!pYIDbc$!Xbq{xX@gx9
zW3Cl-vp1U{8uW&hC;A!C&HQ!pcH4xi_r`m}=k6N>L-?C}YwlBr70}<%K!D4aoBYx7
ztsD(nT?%5B^pOcP*`Y&ID}5oF*OjU~HS|?Y4?@75GSc~^4oFdrK1UUe7oHBBZ$Kk<
zyQ%t5TN+rn=}Z0v8!3Of-zv`(RqjQ9W!PEK{rdp-Gn?tSrO^Jm0PFhCi@mZw=vL5B
zp6DfRenbC#o**<M6*Hm4Ewa|hi1jJikYNuOvgD5bm;}(%9qJ1V*&$|I2XV_@x}-)}
z08f}7eDvf^<}Z(<UnWndV#nd<N59*DtV(Q2urQy~t&j8CSD<?<`Iau(X>E)oWt-gK
zMPP4W-Hx5`z~z_S&nKJf3Pe!{-nLy?@Ct5cwv?JTB_we2s+g8mU9C|{G*3J<fSd({
z$Pc|7Ax`Fthm>69Tf$91_vi>x5O%4Ut%+ACeVVoC`lSS%Zo)8x0qr<-Sbu1;Z_5F}
zbCNx%hRM%$&Rc@k68C(h;j?u+3SinnD6+7eJ@-E5#fQafb&2R#H*WNjo3gWAfXv6n
zu{2f{JoOojY~Hp;<t%n~{&LZ-uR}w*;#Tj9wJdpdTaFlVKTDi0ws$FzfbG8cUAE*_
z8;ILq7h#5`(qjc33?`t`KNVFVWtjXZw9mB5hnsu^5nb};${?%oj{;ORz~Qb>PKKi6
zk-uyt$xfcl377hD_n+@I#b~`6HoSNJ<29FfZB)_V?bP5QYf974k0apS9MJ|_W!qxm
zia5vUR_<k8U!g4D#`XCOd%3jHPbq_gYDLJ`SzifO|CVa{-x!`sC(Ywd1?lF3>SxTP
zhnx&&t27YilAkGAR$NxC^y0BsdqKa0b4|J@TN8e$clA=XZ!h$BD1ZNA;F8OlDwsMr
z;8P9@B|8yt^UlwRSjX&tV@b}<-RZtiH<!wQ4h1|8TL_9-uyg>zM0Z5p8g6>|&HAvR
z<xstF7R4XDS1_IFoKi8M`C!n+>+f035<vIPp>uT!r*^tl0_B_=%Ft7j7<Xc3Po2s5
z6rD|C>Mon20Nu@7c^by|Q4FO>8B2YkiPx0&W51HxX#`if2EBxU{7quO>CXF5PZxW4
z-3x{!eybnSKvDCC#;E~oD&(Y-ElwJkTAd(^#$34xwfF9J3f)V)IpHCii)$cM!eYiu
zxm?87u-t~|B|@thjrgrPjqR^T%^~8<zmUed0&Nujgv{qEUf~S=bw>vwrr$PcqZNsN
zrO?sz&n^uU3RRR4V~n}xT7N(Van`b8N+EJ?dHFNFGOfEj#?XRR?0PMl9oOBL95z|$
znk)w%!it`i-#%@)Y3%V$xYNj@H{aJVx?W`pybi<ehmxobG@uX?i$X{ai8TRoRMw4e
z%3a8IM@k~ANXOmpE2fWYnQ8>nEuPxR?+7zWs<|Z7Ow|CQN^_s5GAnDtO>T)vp@zM<
zK08|E1YCJW;CRhe&i)2eUlG8mYAFa+n9~}V4WiGC8yRR-^F?tDZG#1@kEt5*t#Z1_
zN*1+bQca1WZeRGS*-}4~s*yW^rdiZ!o{s9tePFcM`QnSHZKd3qU$h)mr$LLN#Z?Pp
zbwfzby=6M&Ri9T~Y0bwOd@_8nef775+N2dr(6Zo+6N4_MSQ&2^8*qHef+)_4-}VuZ
zrLUQLJ}e7jgSLQ2V_@r*60h~!tSh;}sTwhy0CAT70Cx+&)};v-@gs4lZ273CW2y6|
zT2{K%-vr~fYH;*feDDCzm>!GmPaA}JH}wfAsOSBX5pZ=)Df3GJo!f?i@WcjYiv%6X
zdMJr!xLav|vFeSoenS4JE?@}L`}pg(0_zWIQ~cTdg143ktCbLQ%0$YXe_X%Qoq}L0
z9w4Iugaqy13|H}$^zwCU2h6+j)P1fVt!jI(SqE6PL|gm?VfA~{vw2iKqQnNw`qp@S
zdHq`~Eq$R<V;-}Y@BA+$J+ja0{dl#I8Ah5tK8oeZZtC|E%X6YX_n^&s)bb-Jb-gGR
z%-Z0wMhhRFZ(B80)RQ#$-|llrF+fq^^R~U_gLQthr$#RVy0Qq{VZ+rr*xG81CiaJl
zV1r-y&Jq`<1e%0aX}3Jrr;We0qxDE<z4^>G!&1E3b;W}C;|*l^a4kdleM2;*0Mt(}
zGS%2EJ9x1_$4lVt%P-oeERAlXhGNnQD44A>fT<;)zqWnlK=uX*&tgY!JQM+3SZU>O
zqq$i#k_^(|?5JZ3?MobXU*i0A)?9GS(TrU2e}zz9UP)?ieCqV(*R7UMLpW9mHZcD@
z7el?vlCgP&?bTaFiF6y{W6hRJ5MXFN)HEN=7Xvfqdb1OFlB3_!RpB69!M<SXq4t_%
zRIauw=g+U7sY-U~?AjhAQ~oaYJz8_G3Y&`-y1zbY9f^A)^T}X3d@^puxnA<Nc$dz}
ze36K!gfQ)H^V}R~-aa23*JPSqwnQ6xv(8Zwj(_I@@-^d&3<N()(nyRP^q>7q8>~W6
zKot}tS;a1T;3JWO{R*0sZ?MjjPyV%B_+FvF<?CH&>vTh7b#-TrU}3yHgNHA{`SJp<
zhRm16Wq<p`*9lF9mnw_a<}S0PgKYM<N1uswKX`r2+!=LRd0qA@1Q!=7NE2>NVMF{#
zBiJXn(~>t>6aY`*$K~M;3PJUgE9}Y{N8I>lb2?m1ppu4J)=UUjt%GM-whv*p<lf+`
zBvBY({Ns<HrvQ(@+K9daLEf*{6^{L%wK;SHl?)OlRmmfk7Nl%@%MWO=w*Er9EYErQ
z^jNfRsQR<mr=n_2sa46wOx%R%p9}}X|F+V`)Y@kr8KX!CHVV~I_RmyeMcrEHh+rB$
z{(ctZ;!}KX5mqbj#eUXVx|_MH9#IE;nxvu72yB|jP(7$`S(F}}@whZmN-=A4qJpj)
zxZD|aqw5~7KFUF;JLsugq<}UneHH@<M{puk1wgGi?1)Nk#Y#po@)2RJD#G3+4CtKL
zhgOI8|4#T0gGr8fJX3z?6KfNBo&jyHNOVG?&lCFh{`-X3>;?#gj=tHfhlN47`{&@+
zP(ketPRsr9EM|f-o*?~h%#5>2rrOx__UcITK(TLRUV^}~%TcB#=G_GnWJPFIj$w2Q
z?6$h)@{s;nvhhjxct#Q@y+og~1(7>Eu$5MPM7l-5Fy-G)P{rl3_N|@z$f3_2o;(Y=
z-lXb^%uDOfNvv4*HvCsy>7g~sJdyJ4TO)HnI$v+?1lY5vk9$+lxf<nhF+=4Nb*QE+
zA)%=U;Udg2A15NNBiuf~?rMY|f|$pCCt{!3<w)ia%OVZ{-Z)l-H|X><KLa1I;DUf?
z?t9ad{;w9UO%7xzp<(Qi<(H8Z!WSe3JzST}_5gT1%u3Kc1jfIhNmcC1*im#(kAWKa
zidyfz5V5Y1OF-{wj#av`%Je*_UKz+r;@u-wl$<ti`Y;BkblJP(%CgalGG&zU=a&1T
z!KyV&>+yMOXxIXD8O$j4ax1*bAIur{<85!H$kx`4mVr>c{^PObslOVJW&g*qM6Q?i
z#%1B}<X^6R65g}5Ck&~cg~oRsCW!)f5N8k_z<bMid~LSh3o@4;{Pw~Ck&m^lgpGfC
zE8R{qHe|jgl&80oJIq6}pU2bfjgWy7onN9w40^9v6mUcijwJ%9d)wM6awh`t)YIUC
zlG-;dz7xS!5*O<z!Nu<*Dh@NG0~F7O5M9Z@lZ!t&CF;J$lT<6YNo+m=ss~2P`oZEr
z_H=9pFVDHs;JTUS5tDbE3~8>~HaS&rT2M)GilHCaYy}?Co%v;)%_&#@x7r?fr~WUW
zv?)l^s>+z2?TMy$?W#3qLCJ4i-)l0^nEt1x+cM<AN#-lExLv_tV`ankfM^2s@nOJ~
zGvdR#@E$5v@cyL=|18t3C+X}bV)CKm%yGTzQ=dLq@gjjWSe<>|t3&Uxw>|_JXF>4z
z0SmvSva^GRX+B-gEwRGsLuZnDh0kvFOFOPnhOrTbmUmfm<;+Mj%dq_(whYm0Ji5Mp
z4}{T4d#ZQ%JMDhB`_%NC2eoTL(5Cy~ughSS7j{8~0bH`PLdm-EAB>EUW+={a>YaI&
zZc|2>l3w)n)lZ_HR%Zsjw#uFfC1RfR2ERQ(v=TnZ*UkET+d3c9$$^f|(C3-(%8F;i
zI(_meBZcpqZciL9@E=`q(GHg1G(an$XVrn5aDaQ)t19DuyG}uZ<fy^1xVAzz09(cm
zq$x{3vn2aLh~3I0z<y=_y=1pm7)QkOC>qB7jfM(`&;Jf>h|O=U^6_nOQ|0MdWcUsx
zNUEtgm1?38f(IAd>1YBrh<%Twge>(93`@5jg|x_ZYFVQ-CYIRw?=C7um%_SXM~Q@K
z%*Zrlh_`oSXzcXcbx+YJow{Ewt0+&XUy0JLiCa-*$lo#|3}#C3T;P3he$cTfM{~kx
zby0?~5Ett1{c{s%z@Cd}R5|(O-k9i$`S#U&!)ztHIP7t<A+I-nqpx^Bkp}Glg%W#t
za%HDqBCRc@FL&^pLJD=!CM}r0_dt9Yxp7wIxd#NiddtV^BVUMM>hJCRzUxvc?v0J5
zqwF3r<f@{KfyD_b9}6@ITFyp{-hv%VmTWqu)vH~JOG%PD6;&aFEce`7<vl3OFrYB=
z(19wiP54cI4g>yiglAVZKmB+fdvX4ps&~!sO1^}mcV(=&fc)?Cyo|-ABl3uPEc^TH
z-C@cbXMG3imp#nL8y5dJ$_{HP^~Up0pr0sM!rr(?B985&LD;%c&`sbyE~02-g8|~c
zx;VE(Co^QGhMrlJLO6t}ek|Ij7v@6ryd(YA*vKRQA7onM+A*4w=ZoT1?D)RlEs375
zZ%`^F3_S&?EKlB<l(a5dTPOfwZ)hu8%RY(pVDSGj&?pijc?!8q|LJ-5KEQI-AY|;d
zxsk_Z^#?6g?|LV5S?sP6{HDpXX%v}RA&ri=)4!ys3GVimaKedU83^=w{<T_boqu1U
z3fc#GU_FXTg{4Df8i1`1e=7c^`CF$nOZ=r^B`N4sM1P|@t*11hmgGC&gQ~OUQ;h^R
zSCI9Yh+1+`Gs6YKvy{P1voBoh$I2grv#O5uFG+v!bmIDFWUl{uX{=;j9d~y-i4<>H
zE&rAOD$*R|vZwSD+_&{?*rTmo*#cV3i9?e>U9GuBGF<K!Ugp8aUxLxHH{kuhtf~x~
z?=c4khyHCQlo`o7km+@aG@AA>HFuXLcJ3tcOme3Xai@8q)$Nu8SnQy%Z}SY2jh1Xf
zRiF%z`}Ts5jeiHeFf$H*BD5f!K!*J2E%qf>E%d<~vzV}2Eu4m0P)4J70?FEy0gZQ@
zq6*oy2aQ2(hxK)nVbc3nc>X}uxi)oXS?-$ql=Gv(K9nG>iQ)tyZk&o)Nr6XUl1<C%
zz|;FlX?Nb#^O*5@fj+~nQ=+}I(`N!NF9+@mOgeb8#te!&+d4+|-22{rkPVuz7INdm
zeDCi11v!&8xs>s=L_S(|IfS8a<>Rcyh;M*XfO|<mpW3>1kt&W~tB<`4ri%v87QZV@
z_t^faa4(jP33sCE*jy<UIpBGYycC#p@9zd9QpQ-nZQx&*(u!%v(5>Y#_F~hqUY6|}
zTy;~oAkie7t+t=&D8tNsHfhE&Z<#`|zED*iWIOz}NUGpVkhPK*hm|uSUM{z<M3GS7
zhIX`pT@H)sh+dTr;I_&IF~ddQ5#stKpGbh8g)i2{PGb0M4??B2BvuJHLJ`tlw69>9
z5cI30m+U3v0H|p}q`5TPy3^uJXBSFM<z2aV<>n51k?srx!a^iG$ndPq_}z9l*p%uF
zw@-cgVa25A)#H?>zk)r4=+VyPfE8n&zu#wc`FW-UO;~*Z+b^m@yt)#aJ>3TVF0ZsR
zJyLOW01p|Qr8I)%RGNCPj*3>Jeq1Y9WMVehcbwOqyN<s)tnficmYL8^3CT=ix-ie#
z2*IU6B2@=l3LpvK08K^-Q|<ziyBl|BSR2je#Q?c(V&9e<;+sA-N|o#Sr&xGm8DDuH
zLBY@8?2L|`x<S8B@w2X|v$hds1dqDeG--c}n0-RUH;y(nqbPXHq3&*Rq)^sH+P7k`
zB7V)mCpJ^ByYgPe{-D0kz2>ru8*Dpp0r4~23s}B=H!!pMjzgNuV)S_R51ur2jeB2x
zf&fl%(EyFj!N$n5{%UitLrX!muv%C?ybO-BEFz=8!_7|m$*tXix!vIvnxwVGzM76=
z?*{Uus<^q9^ioK>_*oO_{lejx;j?(Ut?tIMqKUYsQpyHlk?MxU#1WD4{zg6;(k8xY
z+NuMnw0kw5xib|5Y_0^mLAC4L5^oY6G!X9SDQi}99hFLbB53yH3{F$<fuYOoj~FA@
zN<{k@lnex_5<r8Z3Py2u^G!F5;~CbR6`M77CRhnle1i*ra)P1#{L~dyQ}IzX^+xDt
zex%!%gW!7~9w1>cyLFkQqq)e2(*SJk1h3h<)Ao1<a$NM(?I{kQ_414LcsT$WXAgO$
z2-{c9MmPVLXE9_ZMeHpQk!>(ErUH9+C~;!3cTG)t=Bg_)^N!Q5v#ed(tCvZ)N4gk0
zQ$3{0b@z{ZDu=+k3Y)(>@8)2a+dd9fKc)V9$9RJeq(wHf&J4J@*$GiH%K67k%!sw<
zH+sp{kq&LXo@s<RVg5Ul*fsvS-?z_aHyBhXFc_KUwbGThTsh_{?4Ds4O?n1XYj?Q^
z`f>+IP7P*WM2)^(G<aHD&D7WS()aQ=8n2UjU4snp<&?*e**>eAnE;=q@~B$3l-#6w
z6MzD6oYR~$Xm>H#{*8M6)EKa<ZaQ)_!5_x#k>FhvY5V62>MsLCX%tQ<#LXqOV>M$<
z=^hgP_UYS0v{LAL6O13+e?%zy^IMfghPNxdT2k9CABSH#oH>0Xzf}+Zk_hzcDWp)=
zd<*t+Onsly?SEa=m5n=^A<ZYZ(tG4T($9-E`bATd-b2<6q^YY!fkTDi#p^kEvI@y?
z`G{>g8dZWXA>>1!*AhHB2N>7t8YhlSG;jsro0VxDb9JR@K2K)3w*~2`?{<S;_b#0A
z3r~6Fsuo70(1?zTCJ`ykV%oqG4~qdd*>m2%9;t(dg}Ww24E#?%sRJPp10wZ`))M(;
zHH(I#hatsSmM+qHP4=I?dEX9je1gOr#wlc}5&^Un%O0wde;9%~yLu<q^r|LHW{AJ-
z%m$2K18!>wy@h2oim-#VfF+M;h@cR*6q7!mgSvCyVI(=!_@N~rs(n{Z2oPo4JBwsS
zSb+qL_05D}D5BvIvsO>ML13yWF>Ki<oPp!Qd&s)fwJi^h?^er8Dskf{@IE$h>s?|1
z+=hHs=9G=wNK)y#ee1$R4%}9PEzt&Nc=(<4vUhZ$To|%0*ZDX8U0;;s?8W(;(5HyA
z7u6de#A*29S`GGkSM}$0AiLe6eE$u{CfS?1zR2KGkDv%Q0|9gafocVi6on0G>It`q
zw|4ZjI8QLg8ljq|T2VT;rG<W*9ID4+6SZ%J!ZtY9?Sei9I2UaXA#1g?fXHs<G57Q3
zmuc>Tg|GS&dU=1UgqyKuNGRigKe<XPoQee*+sS@wl~bXm7Xh++^0limuLFvb9T{}=
zmm?B7TCq(=?X5HITJ0Kyr&aMmN@#96^h7;b=nV4k=E1!82Yk#d>sX+$Gqx)C6e2}i
z&9HA`73Rb=1G+cwV9$e0Pofft8Y`WX`EievqRYsQQ0YVc@4(GkrG#-zzY08jI9Z%#
zQ##W4%cnQ_qf6$@I|dd>xrC-U*75D*5R3KdzEIz%fQQP%)yf|r2^k8*+#R!=vped$
zt&Al1-|CI-`n*bgd$MMpooVg8bkr>AJwHTs*Y~FK56cF!N@MuEu5&rdg<fJ37M0L^
za276?Ck#QlzFWf|*DOPLitep*^lk$-TNdY1HBer!A;W29w94nS8@&t55w4RapK4e=
z0-4%u2=T09OR1<Qj65;w9`SIk@DN@UF32;)kvTA|GH#gBcj?f93wz*B2Yhf{j3_5f
z4w_?UX|BAtstyT`%0a1wU$w{h!$j<M=r%0Fz#hlvG0AND-L<d{=#AtDL@Ps~Fgjt)
z*v$K8U&;ctibf)zTG(^Vr4iY#w3@#H=@;ipdiMUONUlb=zmz#dAMk4VrSF6m5=Z>m
zoOX=5ayy%KM8=utqLxI>)P*=!TH*|wV50&)#cGfM6=SR0Dwxg2`+RhG)Az`HhZ5rw
z!f@p`OB2-T5x9e+9vFNTg6r;{zw`sxw)O#%GiG!3&~8}4<Ld46F=XrORK1Zbmg;C6
zJEaH)SuV6Qc$+@&o}b|0z-I}AuaxD=g3Jt<ZmUZ8>O(}sb8bi*$xpyBTPVlhXa6?~
zpx;(fNd~7-nUg-1iAse1tRQrp&EZ^o2>moZ{RKm-@+K(gQ>gCP-)fxT1DlvGb8nc4
zXO@+^*RKYnw%)$$o#9tZUtu~Ua))Ts-T4x_D?hJEde*&iOU;*fC&U|-pHXyoJ|lsA
zt)|{;C1b}_7pRI9_vjhMvf85+QcIS`E*fCYkf_p5`MecpLY4?Cgm#c6Vpp%i<y%&^
zLn#t3FjPpVlR}}!Z3|LRV`w$0%nBxAZ6VA-_qaGU^^mG#anDHEw(eIbsQ^g1zS~(M
zNkk+^jOQ&zwods}9At8L^hsiT{2A?-^8%Os%7V+8VVBM3FcF9b<;9_8w|B9ryI*l(
zt3YaiIs)Sf_2i4-5ua9==%c#jJ*KiwVQ6SqQ_1+Z!$p2+>5s$bfyYQL-aG@)sGWcL
zFgPwMi+__Ei>@l%PESB|zicP^B&box0^UfbQ`9<#q&IU9%2@S_b=3%o;aCD%Q*4iM
zhUp<@tMbX*EKr6q%E&V$hW<X$UtUG>xwYOEmEoES=K7jr4|dQ=&SzU`Dfql8Fiu`v
zU`6-d>)k7Q*GEM4x5iVD2+I>slPPq1@#|2}AFZCw?1BO=DQBz;*`g;aQh^flj`3ov
zDn-^e8i8|^iHX=s#79m+W~ZbViWVf9qlWxgCB*2U%A)EnOVZkOG7$*&z}|{+3<}L<
z=v56{0L0vu;$?Z5-`FL`vJJ{^R6y;L5c(T%j4`#r9NENKQ1LkRRf(Z9`V<{x2-gIi
zS~>Gg^ZyN@S&Hy^L%)`#Q}XIvK4E?#gpYjcD`Y2crOGWl7~IyDPSboR&2#%8fvM6?
z8N2GR_&F-|k={b4&w-yY$fn`5t4(VtT(zJCD!YQmzeWe3POHP6ysC9(3Y0Rt(NZ2*
z^dOe|{&M8)Lkzjg?4=}j<!6i1P;>g`GgbmngI(IW1){^*<k%YJZA2TXNG5LaKEsNE
z^|5XZ5Ird{RqlUx06yE(dXe8ON_V+D_slkXe&1S?9Tu$gdiym+&9*ZOhGky$kFQ(P
zHBW+!^J~S_jeOj?JI4|ca-vl>94pQ?^(-s&$AdE$IM8~i<yB&_Cdu%c=+E&!AjFl8
z6hm;bzWI3ZAY6}9ulyWynJ{Lzx&=5O#qOa*d{Md&yt5bR^}N^wi{AVR82mbEq|I)`
zT+E%tpRA`*rpfXk^PsW|j&qXgX9g<yC!__iAxC3a`*SDE{D0HEhxtUADf<V%HTL;r
zsQ|ovk!QV0>z%ZGo=*wMWa<c0ZlAtjzw21ikRJ-1+llIJU(7i{yK=kqBtI1f^r;IJ
z9KQd$YA+0BN2CxF?%*pOe{5$YPW~Wh+B@M{?)&M3Z8wiB5$>=(G*gw2(F^Qo$;%mu
zQ!0?22j(wo!(q&lC-UDq)ju#b@_4LMmSkf}A5jB-+WR9J;k^USxao<LC#=Guxr_%;
zNI4Fy>GzgvNY%0v&{qI|<!9iEx{344!F<1Y?!WzJTpdG*`Sr~+*)v1Y;|}o(RXXJI
zU9T8%DUKZ=VL7DlU7n0jP|lsIH0qLOClI2^yi1W$&@VsrjR&}$o;61`WrMA5o6N#)
zQ-=PCem3>+8pTVgEdbD+?-E)qI`;)fNtKmnJ}P5X3T$A8=k^2ryx&^hf-{q<+kN1n
zP)dl|dlaulsG>DzoYGCUC8q>E$pmcchD4t4beFf+&h&Yzj!b>X8(~IhNOl&M&2n1j
z4F(<mP`^6xanY^gjQ3)I9M6&;9=|UYUyYB|n}ZiijKiiAnLK#Su^1(lo>!?&UF3`R
z(C3!M)P5G7x`28RKhcAio)~q_zB|X197evDGzw$l5A~<W=ORDOWKAvfsSV(GEt^>Q
zSan$#S>AIg=A(YBWNf4@ZN$7bQm#t8iM!>0G6zmX)DD#s=7>Q-NV&;Y<0<5u5RAM|
zevPV-H%AWHwUk8(DoqvckXN&%<8F*C+%wC4akqCxa(KxV;uC`%0Si8ApEj^13Ca9G
z1vcmf){P&V&SRTnbHBu$R0Tg3UA1H$`!>altf(xGV=?*&`nYYM@<&VtkL~kByQRYd
zp-*j#(m@@}7@AD;7EFTa!+ZBkFkDeuM|uGnJ2-$6GJ@;$D`kXxn*~6=R}>KxC-D?}
zdsYQ0zX(8Mg?D})tY|}+dcz24>eO4lGsh)%8r(EyLx*OVl^F%gWWQqYFKYhEOj^iS
zE#2~pM%So|bEY$^;SVJen^P--emhv-5l||zoEyjmULU8k?%EMH$a*S>tEB4Y!T-EW
zc-1zHHRCc#PVSAUbvL89`sGgMI9UC0p=S~^1^eu3$<jO?&>|de9B^8~9@%;PsbOkb
z=r-<raFGl2$R25SBN#y)BLh#52?%p3MD-F{W74DL5IUrHkbL~}`<ZHXg>HTi3-%I1
z>&G4{UgmoJckP&uhdgrOpyJ;0ObV^?j=v>xyx#|3xtTYfIZb0AdvBmWVcF(XWw`EY
z=4vuTaz6B5r<wrsV3J<7whZAd#m_4uz<I3@Hjv<A^cRoExnmJW0Z`9uUOaRl2IgKB
zEgY^xB#%ZinuQ0^<zJkeCg?&xc^k}(RW(x-`7}%Z2!b~+J)MYqI|NbdgJG(%^gJk_
z$QtD*<~92lk;}-T5dh+IV_=*jPOsnuLw=ICy(=liLx@wFyo?Tx^s}euear0*v)S+H
zOcrxxwpo}V)~O85ctW@sqFq1I2F>xQJ+C@<>OH<QngH=ggK~?h#eRIXaM}L7h8;XY
zU?%ikT+7Fv8#N1{D#{-6QyEAM35tbzq+tVp0|14P!}IMxDp61+9)IqGTP{^Xa-S9F
zIv^+xhJVr+z_8{LghM}H-?zB38eYWP{ahA1BySh%-~D^0PPyAr@ka2@`ED(mSpMnI
zLs>kD;1wd8n#sD9bN>Lk<e1K*{!5fw1wBgb#%5Y9KswhXz&f~8IeQX<Rw}>g@Hykj
zqHiP21`s~dHvP8L3Xh`Cb;EPRxN%lJIa9FErMlL7w`W0Q)i8|PQhwf0@*47I-yKa>
zAq2hh%U(`tAd}q2&9LfnzUK>HxX5ZTQNaMt4mb>f3*g8sINLd==qfBhYljj*rr+}3
zE~!6Hn|PiEdV*OWz_o^<9=&Bw|Gt)l5o>0sV7#$zS@*S0r3|;Ypc6*iqx>$sQnYGA
zE&h%_@$$>aq^#;!t*I)n#8T&IvEq`(#!Yve(%jSPY+L;bfEQ;I2ejQ@H<FMm#i1Pc
zcdgs_*J2s;5c7IZIq<Ypj0<|+GL4xfvRG)u+(!?=Rq#7V|6{1Oc-Gg%K6O3K;iJ<I
z4tK?{a!Ks)!18w5i$v=!j%Fs{VPV*og&=b3rR&lDue`wad~C=DN94#<==5VlXkT?Y
zpp4fFPsA}>!I6C!8Lb|T2826x6We&0ME!R(OoplIY^pgc)$?p1krW88JW{_6JF&H|
zY1#cQ9Mdqm*58%$_2dU{e^Fy+yOjYMxAcvl{&b_as&^QA=cxl966<5w)HfVSerA2k
z(A3e+M8J0TMHlrNak$v1yqit8OO<g*&!LO(nab7_uOcznzm3M5`Y*<L9$lp3$|{%O
zdpulJ7rT`qEP}jqdiMhkq@PHHVz$~?cwZDXGZWd!GU3S5JSOPtl`zg$!~LOU9mR1c
zjnoz_W`e%<C^b<@Ed8he53|y6iMo1*y3aL;K-2N$sg<+>76IDs2Zyy&@6mUKY8K@}
z0KzG%;WM^Z?3)cVIZ_)gQyyc{#A?txC^$-f>JmWl5PMzkS^g+P2q@Iatkc>Z<GaQL
z{X}bZ!uI@l;&8=#`KB~_x+HGQsfd4#ZGW0*Zx-9Zeq`sD6l2VMqr9}wQ)$AYftoLq
z0pf`MZmY15t_sqsbJNDp|D?JDhDZwT2czvuV8_(f%U=K$YjrTbN|WZgWnz6wcm@ta
z)+c<2%#0{)+nqEbe{8Ca`AJTR2pwO`Ui&^nJdfQ0-XML&hn!u<xlbqUvV6qUp+^xS
zRiL>fu!?=z$QiLD@sZ#v#{lljaFNF3rA|@Ts*Pi;@IWZK?>y&L?PryCDF`KeI@{qf
z&QeW;CC?RQY4IT|dW7yDpp~sMQwif?ZtQXTa*I0~X8yx*CFvcCj>IvTYxy+fE6pP*
zj!r*6Wfn#XXAC{Xt=(lZPHL-MFaoDe#C^gGmX*a$^Djt&b#qMChS115CDjlg=;*rs
z-atQ*Ir#x#owQ?}308N65=gFJ&meue8JnM1E2yPYBpqQLuc40z<}knk-BO>zHr66_
z03voG-#l)xCZc1ySg~YlY9j2YWHBw(tUB^}#;$q^J$Uz9-zqYho!CwRdXfIWmk6l%
zptJ6a%J2595V3z^QA*IulU7)H>za}!L^sPTepJolDiTUv^^)K3^^M~&^0NBnfo{@s
zaD&XGc9x?d>Q+=i1}9Fbtvag`T8e{)me8l1p<lhy6pA3RA_%FC``A9_qmq{FP-4p^
zB)rc1xA{lA)UK$cjs^bGJkzxOQG|qUhx2Psn9-zY?JJNks1151&^7vZXJGCdqR_1T
z<+T7xb^C2!{hNGA9M2o001}(tN_vrT1*M(>3?H2o!v>*_uQ-5Ffe*u~X8ApW(Q()8
z%cJ-wob-$u337X$O4+~dz+GEU;Out>Q@oy>Z?;^=e!W8BJ?jd+m?(|K380ZML*!CW
za(tcW_6w42T;iE&YSu>!qjZ}#1@0d<0EP^vaRQq-jeF3$H-JmyiI|RV+S3dic^xZ@
zqkop)z!zkuE+)jG9t;pX{^Her;=MOB9u`;dFipqsn7Z?J(FSK0&!ib7^c4H(M_X<l
z#V8-(RzpC22J8>GO<xXTk!BbDIbwHGWjfE8NFnK8413}8HUMa<5U+-klDkH}XVm&A
z*eifYdR`$Z69uUm<GsZmqyM@<kM&wnQ#FTAQSCSeFHv-B=*wG76iRkc(Z4x&Sgu;~
zSX0u-v2r(4cKj_)2qg{G;9_L_YA{~0VU*hK^MZFKl-AjCpfIBcp4~nna%l7A)}8N9
z04wzo`iwFb7sSF{Nq-r?5Wz3$qyVzE+tnB8LkUWP1yAVECDm{A8;0J)CK%aQsO4{>
z9j9ByNAUTd7_N7isvdn2XBt>V>Y;(EPxy}A_09k5R5Osg%$g?B-^&F_x^90c)gi53
z*dUponkEscv5m4ju3$KG%z)q75JmkcGM=?_8y^aZ-0At^vNUcc^C6Bxja%+T`baP&
zBTKyC5R*k~_{;Z=$&JJ<vn~cZQ;Iwz#iAksy^G?T>GjeaSIQ+Xudg}Gj5@}!((iKE
zxBTWhSrzRo+s<gHnVQF27N&+#8!FM;zs*vjWCW4ZDEW4aTaZ0M{l+n58kqwvOXRe5
zz2JcMITlL9RLw(VjlWj5Q&C~t{#OCWNEQm2GH)$VWeHli)ry$&px+QkAGy_f>L&OT
zcg-B{Si>k-MR1Yww>ZnYicPK43N4^2YB&#N(*Tl#oi^QGy-%9FOCBU=*-t%*auY+2
zxJtr%WLkS-%hQdx<-v@YZW2YJdZk;7kO`#&SK)ypY(2$Q`h71&P$VHd&=1!I2+0-~
zZ}}4xZ!O)AAA`9yU4fzI0Y#jMUr`Su`54)API9$gA!a@oE+Az}lLR73iQnrcdnS;h
zt|rNKHFFFk+b859L|M}TQ~{V=Pow|rew;m9=eID*hXLh+RBytjcr_9ZKh8d*`7$l&
z)L0E5{GK4(Gc^%E(H%xxjH4%V#qem+;~1fN*d`ZYK|WJk4DPX}dbg@`?kK0Qr5!?0
zcJyXMF~nNWUN!{2L~WouRtdOO`K4Rf)4MlR6By8{NFxfg?Ekc(sdz(*_e+OBMyDu>
zNC3B@E^K4NlhK@@p{ixX-lqVTJSC3>w0|j)5X87oC^*%Jr}7q77OGn=s{ac$)f)7#
za*CoxVp|f+&;U!))Bs%j30_gU{K043PjPtv#@c<pEJ#-~&ymRAgg8)pGN7IOkcH}8
zX#t=Imhmy|1pQ>Ij;(6S*Al&y;$;DG4m|f1%f%wZeKkL<c0V}vK|~p1A?{td(Qw$a
z4T@6mx}|T`0Iwu`!(<dmMYsbPVrl*k!Pdj55(6YFQ}*KX_d}3a2sMCr_TWz95<0>i
ztsmn-Dv#lt0%G0gE$mhk!$IS@cC-zN2sICPrwi)x@&X=xg))X{SlD_t+MeZMQ4VY(
z@9NZ6UO5OqZYo4YvJVkYMC#p?(y3UAskmkBegCYxpwc(u5!GYuTJizFK{<!1?7uP~
zC*AI2k2kXZOcHy^dtP-{99na=+NYd;6EdmrE$fcc#Bkzlb7>b`K4!=%_Y*F-KK+*;
zcRRI~ZK-=Ei5@B5vR57vt$)NN8g7g**<9)z+|+r-8<LLOj|O$=*YIv<z838VYqa@P
zf$V}`wt=4&6Z5G3=0y=wQxqY^1bdVOwEDk55^?~o5A;P|y-)%16hRL$Cv>iQ09k1b
zqioqSZLBhc3=<1GL~ZQ>2kFpN(V>kkve|3BUX8HEzpI`>?;k&EU19>%)DJ4#l!RiB
zNcBbd{{V(>@R1clp3S1feX+lDQ(WctUhu6ilH0iMAgu1#if*P48(we!R+1P-K8+hY
zl4j@(`^jY2DZq3HCkE>-eo^)l>^?DujO17mU)X?WrF(6;da1U(@n7t9J+#A~f51ez
zx8lAVEh3!^+p1ete`JuAeS=9!xk|!KdQ>22NsR*?x7*xEb<JkD8hdtSh3|o&P`~Xy
zuf{tcYMm;t$8#L<1}g!)r(ED?ZXE+t8%#}{x?jxTRm~YGhH7Zg`;kNy+B_GxEVcIX
zWuw8ogfOPh_~TVin$Ab`V+H57qNFkP;CVYRwTd^ch2o8kPe6VgsjSi<X63MjQMJmN
zJ>;`!dhv`ma-=)6@v6mq7^jaHW0T0GH%jo&(Dek3yC<Zyr|#>9P~g-9zw~*=lI*_;
ze9Z(IL7Z$-pYX1e54gEuTbxQJba^kH@ZU+Il?l@2KVa}Dq)kO-M$J5jO28)qd{SVr
zCQGf&_k-91&qop)tXOu`vn0b40$w8V^?I&FOZ@&6U;_<!wKZnSfQE<?rnHPT_A0)U
ztGeRL9pc*YyPmD6FR_L`aS8VU*YBve*R|<x^-1Hrm~?6vmC5dPAeO~XJ7-t7=H_I4
zt*>VIae)%|w6abYHi$I9vDj_KdBcf2AUc1i+pYcI2#sp`QLCUO?#raI;YoN@_j51a
zdJ48CFmj+&lhj#VYilZhYx@Kr<gXTbE6b*T(|;ZsB4CA4P~sWX38SkV82u617cO<T
z?4j_vh<NVi&`W-Sv{H|ODnIjfJguQHJ(Pn$pm{Oao<)1XgBEFxERLGZ^|CaGA?jK0
zzswc{dWkdCXbHry*-HyEc2pD3gU-JxkiaK+CDEsJ<D>-Tl2dfolE6rk>KX0s{Wl1M
zT}8BB_{&;gAkUnUkw<M^s*jrLGj)-*EpdvsDimNYv^6Y_k?~6KH*c-oQQPVXMwv5y
zQ07ix^~|V^7ioImkp4{#jIO%jUt4_w?PBlD4&%0eUYdv?gWw$5U|0(FneID>*SF&X
z*lmh`<T~hum=YMg*7mQLvq%qB6J1%KAm_7?z}Tt>M-*a%IEhSue=RUkG?N(SmE>#~
zZjSMC5CG-G5!%9yk9svIATAz~gph~2E7Tw5UJ7+9vzkz3UHXOws+1<9N~ur5I<lVP
z<n_ds_}T0HV%v~Z*bji|Xi6)kNrAPA{K;w$C;@gnqM%>ZgpP<7$1TkrbPEbvOaypy
z;zGMrJ#MRPtT{uCk5o?DVO9md**;l|j1AqY(;0}S+g=q%SA-%#J)ZV?@8&>0BC_%d
zs~ct)*-*nS8nIq%EWNy5@p_e?A}I1Y6VN9IGSYENq^thXswdjFj7B$g@pinJP*3Z?
zkQ;8537xVRhO-y*G$oi0^Psgr*ipW_Y9L##{Q6HtoS?aAZQD)H3!4y3rh$6zLd-YZ
z_G1^BC_4oGWzueC&`Ok#qb`qVAI4EEc{RxK*8qxXMcF9c7`f|%E+u+=&>IDB^$H0g
z(?`F-qA2@z+kuIXSTU*Bhbf@S87lnDJ#iv{O4cZB*rV*@DEedJp;xDjU8jt!OvSFP
zJ=ddjwxOW(f`oSEDaGi?oXKZdB}{}NK;&+d>PhYO?XY~|BQwas*}}7VsKQ2yvx$hn
z>e$&@iE!{c(s&D9eknII+ViLrlIV6CtXAF;jj=@uy@m<_Y~y%;HNff}!qxsMc7TH|
zs&2+oTr28cP7n5#Z8!<q8b-2cz7!s#w(axW2Zt|*4~AOQN$CO1{0ZjP_+|m+?Nc7v
zu!?{;+3mb@PCQ0m#x|P)eWQAc<lb~+>G}ALt!})Qi<|gCC0W>)_E^-=Q`9S%nsj}`
zaE=h#Qm;VgR7zRrpC{kG6$5RtJ@Qb`%|x!pE=+1#4&Zo_U}WP}KS4$oYNQVxF%PYs
z*Lmcm3hjc0f28Q{NmUpco!okPRrY!y_B*P!a&VLC;up{q;|(jxGczz)g{Yco>Lpk@
zJpAy{@_j6@#wmzw-%|u-g5z5=(-beUYgRphgdqI|<P!j)9aVe+7+yPtud*E3-cui%
zb2dMCV)i~pDbTgE4>v97Q<0pFycabjVOMJ`uCGW(;3ss_UrTRH`u?|uB_8Nd)YR|6
zS6Bq~drBXslVH$Z{5)=}Z^NR!WSs>JM`VIJ?!cn$m#}-Af+q71JB^Z8ETETu`kaxy
z%PQfMP1uYHL%1K84F2m+!i{1JgWWdi7~^o^xmoeJn!AMq)TPOZW3TpIY1BoiF#toR
z-B~ql0Tk32>wC}01i})h{@9<~%9~Kw+bdHiR;Pyp8VAQO-`(O4$DJhI?LsyoJIY_u
zZG|y|_N|+G{*(g3H7(igMp`4hPBLNgt#ox+wk-ooru_Jcl@dN7!g-8uI)~anOE7>w
zo+WG58}7UG`Br)R?pFApeYvf#D+oYI(A8UU-ri=|Bt_Qf62jlOWHAMA@pyCj*_G{=
z%$I*E4iChy1Er_|lxBY11XYv|vH3DGnhh0uv;)_Fr{8KYO=E01pSZr+_JU$UX8dj5
z(&J6DoZ8w%XMpO{z&4VInik#I8CJLM7bSncmAKdgzRjn<`&Oeq(m)p}MqT0t{(f@S
zF{(WJF2XQ}*3Ej=VdQ)(k<bNY1)f3!e`5-yxlwCSYf=jbklPS+6<9Cc4SnAn;X#+Q
z`(lYwhiqQoFB{?k*zt7}lI;i2*+G5PXa5A2oaron@msttEA=nqsG`b@xXVj7y3xGj
z>lprFBkl7}V>4l(C|>fcNA#RERq`yNd~|1ex0B#|0UrTv2o9j|kpFOrwe|-W-Aw4@
zwyWm+NYF)ZJAP>_880Z@djpO~_2rgYT*Dpnh3X{VT?PPDo!-QIJ9j9YbWa*SCz@4i
zr208f)N5`gE+zn1JK4pK1Z1fBS-JRL>#EHk2vdm(u=gduuwP~WiMp3z8I$Vr70|3<
zjH9)hgyp0u?t(=RSz6bAl;dXS8A45~T83o{aNQvr#4{uQ0Ph6KRxmQXiR7KckhIBg
zCXjdUAevAR_<Rg*(xFcJmTAHl)Kkwfcf?juO%25aB!Bkg%Cj|{{IJ}_zVa+v9NbPO
zg1Bk%uS^Fh9sGO?X%vy^?#W3K`Ai5Jg}+8U{Ib*`FJ{_YrkB;~Rqa*k9YsoZ2QS>j
zz>>G*5dzx>Du@MRs1yVtlE&FcLqWMJ^@+K-s2f{1lXEr{ZH>DGw@Y(6uE6^6K@s7w
z{G?_CA8K0kBabbTAS1S~DmL@=O+V~*{@o*fRmj}E9eX1|{QkyB1fR6WGnIHk7Z>Y-
z$>iP#|MEqBkD0*x2$fW+$FZS%w%I=fkZrz=_wsxP>jAew2_d`1qmTaZ#uQY$K197w
zm4YF;vTuZ^6Hs&Hf}%MF`%~z%z)-&`m@g3-2eGIOc9z!^%{j!gU*|>()TKcUrbiUN
z9sL7}=3|)eQR#~aMfJ8sRPiUaXDY#|9ZpwBc$pG(q3!~tY$=_GD~6DH0iN=_OjuQ4
zH(R+$2__J|)r&cI1_fh4gK2(I-^`q6mSC`$?fmwYZRpv(h7R~5dAl16b>JPUzS6m+
z?twhKekavK%`{{$M1#dv<unJ7#52yG)DmGU9+@W6(b9c$9zkU{#m0@FRfwt5TnXqu
zz)H!+wD&bAl%*Yeyst$Rnc0cx6B77ykI=SkB&RW*s_3@=7=9OGy7ygZ`U~>r=@rDK
z8;yrv1A<i?!4jb?dnjPhqil2LI6`VQbFrzTyo@BnEpPae6(N=Wvk<;Ds{#T3ySnow
zXXP9BZmk>P0z*6P@Y-`{$pvH}lmxw{FYm@$lA)RNH^6FM`79wEl9789ADta@Iu+Lj
zZfyw14@}8TVWbiTvdGQ2&RF^XIf8DtqUJ3um2b_T#tdv}><R3zLwMia%Q7BN>;SDp
z^uuO72AAkvdx)z0?rZ?#>cKsn^u7l#u#=t^f1{TUD*-3c-5@LY7D5V9*1-=o$q#Ml
zH6tXcRH!bDlk$Xt>KvK21YR$HT<HLyfi~kDw_fZ~;me`68v|=7A&m7}KRlt8-$sx_
z2cQEdPN(6a;$wAcnoytMWs(|=nb8O6*?K0-Yb(N>yP-p$jL%LWKSn^<yw$tDJb2ba
zHRZbosc1Fb!pOtv_TV^uHxbJ_*RuCZ$5sUZ#tqSGs^Bdawz&Fl3SDVm6KjX-W6s9`
z&-Y~~QM4w$L+BdysGFS+l?fG`6|*GmbQS+M3osR4Sw>lysH;Vo7Hib|EDvbSXT39k
zte#YSl%i&2iR4bFAAODSlS*GrC`<g*aVar!BJr|_p>S{mD?EHr*$R4aUPOsrJ#Q}&
z;)GG@>PJp&mE>FFL_V$21$>Kb>D+D0`k66Z?w854G3lF+=9LIL3H3mVIKnbQf^&uZ
zBrmQ*0SN+$cbs81K9Y?&^6nQSW}U41#YCIJmOS_0#e=U5UdXvG8nU*a-t{W6f$IrH
za%^}?>@V5_aOm+Qz+Be+SXCf6D}w%UbyGvAP$^Qkd^F+?g?!CTvG9`fSDWHVo}30G
zWAT=}cm*Y_>$oCQ88}tWUhIi&-?+|g^pBLSo`i!(1?KooSIo~pDILEa^38Ski3_}K
zUSXYc7|H)^Jg(%!<Z*gI9UEC>8(a9%U|j6zilkKpd1Nnql0{8>=rn)%O~LHx*F%(N
z^ZJIDH_jRA{egc3;LeuGAJxV{)rCJnXIE1AEG!g3Y@&Y(Do4#;jPv<a1SIW}s$OaP
z(&woc`b8L=;%F3<Y*Hr1z`WUZH-}}+GWse6JIYV&3emAU-}6|J7BTRxdj<ti6rJW^
z66EGpyF%scsh62T5&QZDJn5s&14au-LilwYD7>fj?Deho?5*j_e&SHLA*D=CvR`XA
z{`Rj}p~2|gPvxN3VXU^C_n3AU$JIk(w_*ryjk~4BzWc}&4`FOOh1!-yVNgRH#mw$*
z%*WwBU31`oPwkWqRc5E4k7V%Nq%_4>MT9Noq+%e|-e*)rk*s6WRwn%l(AAvu^A-)#
zDx&U_7DyD~+h>Kb)kZhM^uTBhmL3Q1V4BVZyQv;7iWiB5G+CRY0NgL+e5u#L=m1C5
zc#GHj@%PBZu0J*StXlgHoNn&N#nb}0lLUbIs&qk6J0tR3c`978PR4A18jaz8*YpX7
zi)J*@uA-Uy|Il=u(QN;3JN6bc)ZTkjd)J<&erikXsMS(bY+}#a6fHruRBG2w)T&j{
z5u0jh+9+C$&6EDmd0ymQa?bZYpM36d-Pd(}3H##M;3DSF>Ku*d-TjszEfSd`T{<Az
z!0vwMjK%^U<e`~-ZN`R8R{rw9iJGn++jIR_wSC3Q*w}=jwBm<C{|!}jI`mDu#G`Th
zo3jiE6nxjRtl?$owCAkuvdl>2-Pe_*e)}?cqfV!R*U@)i(L$sagWtI{l2v}AJaKO2
zphs9d0Jo*`;I7&OOpsc~nzmKvqtj@s^6jfPjxqfc3+1zkwUyR?fHTG2<GW+MlvIBf
zY2z26m{0aNu{v}Ao4#L^c}+KUF?SAb)A0PQ$za{rKcm9&&+M3@>E)<Mu&gGhTpv|(
z3B`-kg-U+>sgCmBYnd?}n2s=?SQn@Di#{YwMz$1W>D|R{GWPa)783m$;d3WdBK93#
z7}Er<j!>fa=4j}EaCEdW^&xxV8BYw=$Lsx8waVuhdy#Fym$9~;$9?x$)1kc*se^8G
zVsf!{x02*&*CP8|$+OQ=a;kF8tLk1ZtWxJ5+E|UMbCnlbwi|CevTZ2;rrGx1b)39u
z^)0P(hfX*3+vtml8Ac0HE6cwNkzLgo{$7pfoFnR0*)?|u@I>!&KDFqjOiHIA$1mv_
zxyN!AtWmiBGySLX9aqMJ&H8oNSqTlSG34#H`vXj+{imIQZ?imzRO}JFAFc}pzt$2G
z*)N?-(W$GQ`&($eRk19On4T}Y;>t5W+vk*EzDW0#D;^>rA!>*+W_uqVF(}qL#*YPP
zlZ>p#-6MoSZs4l)#95?j3TqUrSTlbpYvu0OQo1pB(>Gy0O^U6)>G4kKR2&|k<MT5E
zqK95Fb_lW^FlK95lP1RX2_LX^GN2*Cv%<rr<X%f#$6I9$`{!x^KXZ->cTU!U@8311
zz#d-yHmc{3BQlnbJ$yC;YT1w0)rWe*1FOC-WU#Xj5=o#Wx8&Xi4MuoCU8z5#Zur#}
zC2GwK%?ap!Q^oBiF5O+#4E#h}cp|Ic$Kptai9)$f)>yuO)=ydgZU#8(!O&LvO72Zg
z;xRtBdv8rkrol#;Dpd<fo<{GUh9l{BQ^&YD7T11elvR|+H2P5lw>1x%HZ?BKJk9k7
z?>aRxbSz1l7p@m9VAB#{9x?A&`60H^jX$kQxa^cM!hWV{u!l}h0g13p34tac<*vr~
zOnil4PaMA=Y9KFfg7pV0$Cc_6>SMEA^e>Fy(v$buHUd^06<pJkzsuf*-Q2IM;~-Ll
zl}gQqNsmXI`INjPdyYr|M70A#O^bsR!Zk=ABFrLn;qZX9Gz;5SG^uKz#uj~ZMh*7&
zxz1SriHy+a+kLh%*q1dH$Ndj&`t)}A6%{$ghv)ONs%g%g`71aZLY(^{@DA{_sYEb|
za+Ta^P0v<l=#sa0A=NBn;CM@no7HIySZx&XCO54?CGcpq*o3$iKM9qO#u!6-L?Lbu
zB0Z5a#&&Lg%+W6=ffiT$Zw~g#yC+-LTpqcyMf<S8Rs1!DYff2k2UgFC<U`d!q}3R}
zPi-{wfRu;gT1(U}cJ9r4e0|uHBgqp}bricGDkHJ1>QI~Zx_GR?wrX&WE;sU*>-Vse
zF6CX3=<(LZF?+5r<EPshzYBk*`>***tkvor3`7i1cZJ}sva)ZqZ%X7?<Q}-)>L8LH
zqQ%gV?z}8@>v?R}r~CEax3@}o9DJ2mSZlJy;O9MG0xUkvJV!(Q#8D(+0GWbMBN64n
zgz3W@2>S@WALp+aNt}LOzi!WEqXxyI@NHjSIAV-F4wf?Dg4kaTjxm3zEAPEr>iFWB
z|AJaNO@h*1t&#+@0C++IWNl_PJ}_>r=;3%+&Vay__=V;^$uf{8JLagYc74&}TOR;H
zy~2mNbGGm3>c{jRrN6VQuc`HqOgu_mVs7;>{-vgMJ0>IPd5rEA&y(s0E8H^W%A_d;
zHL^10#*ml4a)6cA**_G7$^0>*4SloQepKkB>c&i91+Up}4nH}S73JQr`NrG`>%OVc
z*|IloE{s1DGrxiRvejJqRJCNrd=YADyH@~@TFcO5^N~{FgE1J%C0dZVQr27pe);d1
z<cQ4Gh(l65%dpaXWve$+=Yz&t)qcl5dYdp?h+S&p5o3p5sH{K15%&(nF@C`hst>^V
z)@I*V`>Y}Pbu%KGwnl1aNWGUo>^Gh9iI0DU2Bv5|RA+9;YMGq-+1k~ys9?v_qs~9~
z@v-x42O7-0F{yb=PliIQbsGA-XYG?m%<tblF&7#pn_)EXnQRuDo&_m|$;shMQWO_;
z;GZkvCST@TaKQ66#_%ciKSHYF%r!YmNA*lJ-%1d7#zB4-(cfK6p>}>-!^|?#vQIS5
z8rj)Ds<<qqR&abK1dPMB9HuPw5*T+X-0wxUM)(~mX%nAk=`?KMh!MvtN2Qg0ZP#7s
z2g;%G=g=&EHCN(`mN>I27Kx)>=3Oa*vUQMM>}z)nzN6xs_w+vS1RVS_3x_$sH-=m-
zYp-OK-B05Dw2(Zwsb?{P5^`c2$9U#$ZwuM{)kFV8c=yA~0mQT*d&JzK15plA)I!8&
z-Ba-OsrhikAy-^F3c`~1TYN4)Q)<WyNLw+Uol8sEq5zgE_R~hr)xF2RGOIh8%ZM0}
z%PX#_es3QWD)Wu<<2}>n5wp^O*P9iyM>$#loECV=IlKruPs0T1jh-!a0ko+%%H)dV
z=zhbfz=U0QyK)eJn4mVDna)R($96}Vz5BEs6n=CMj_Q}}FgiyUjr@XZ!`9-SR6vx8
ze?85+8gp(FiH?f;?E981Py7h(9a@_L>eTV<@$99KB4{q|<OJm)W)>T~8>|m3p|2;N
z4f8cG6=G<yPkx;jxF#-|)vw*BB5IWUhDpk+*=K*Y-MHy`CXH*`e1vW2IZs{6wN~58
zjw0t<is0d^kQ?Ao;FcGL><*}kxp8mbQih7hA!*-cQ4*ybbyUA(a*o;_q2S6}^f)VZ
zES?2NN@<?DpR&EC^&LSylJNaz5sMpj_U5CGF>5)Q|K7M0_ISGAn^u<GAv`%zTf<XB
z2Q7&b!oip(^OwR759D$B(PD3Cs(+}CC$mz`MJxVl(lS60weVY=<)tZp{v(-4&Q-2c
zex1+n6NYAg729Nf`U4Y5>Wz3ydGT#v2Csm-A1zXI&)`tf=3*Q%e4n;Bjoo$ij)Xgz
zHyGLnquM9g)Gz0LbnL8kRh#$lxIvTD^+u{q($Xe=%%wKCk8(aooa^1&S3bp{&tK27
z{&@(oj#R_TFB^_j`IY)rB@T%3;jB9DH5``&8RC@6y@?lYzaff9GaRFTK>K<8UAA`9
z5P3Fcn=3+YU>@I7RRK3UW@DFF^Nw`Ly8?6WeVGEfs|hw#4<7m8y!H*MYDSn|*LO@O
z(<||a1PAzi+OKd=@q+~%aAu<t5<G$BaUwfU7)L%H7@xRCOJ78t=n;(pn#{5xuaBC-
zxGqSTBGiXvL}l-#%}0lxeZ*PEJf^wwPbKHUM_}LnTFARUl1v|jXoY%*mGx74ca<F6
z0p2LN2(30)2p+-zoGrL9-x4Z19kmv(qre?nq1gXS&QIC2LetX<Z)N;XwQVA3T=1%7
z-H%X)L500&vRA)unDQ)G_b0%Kd|ExK*e3=|I8y*LbIA)A=|q`518TCgIU*yn5&3SO
z2jkji;`>9>Q_ODcq8EVeWk)_!?GkJ!Upx$%Gvq$|u{Fx@79(U0vXVCn{HU(kF926%
z*Eazh*{F&GyOZ#f{R7WU3!E(~7=3pF#dE@@ZhUF&rrtufX{gZkRj1{netl<jameF?
z_wQ5JpzYvIlKkqaTNrlSd|~bQW^L8rtv>4Y%@9LehfVtIz5Jw7hKtDsOjv+!u%cUG
z;%Up0RY%3(!ha<c(jNaD+H#D-w&o5WRuflaJA%r_yqHb&Jj)x_c#FQ?@6Y5AZ2-T}
z{nbmhrcn>M83X=AExLxPiwR!FNikh@>YDUwBD++_xuvmCMz3ilN3w9E(J?<GgKf<;
zMu>BoA<eYHeRrNQfozz0U8_emf$3`4=_>Ffig=XQOF`lSN{p6$h%&`#Ef<l~4W_6G
zRYzO>JxsOWQ|><GKplvq@-pp6joCED`u2X3pFdH*l(<CHyf@G|7#5~oPi&A~2p9#^
zE&YBJ>c7gH6fB2;FwYJUldQAIX7+UbzvA&v=Mu!KMk+@;T@c}sn$P&sUxO~D*}Ma2
zahEhKdC9dQdk|+ZiOMe0jMWmx9oWeORFmX#Tw$9tcl_u&+*N`(!!9G7+Jy+`j8z<r
zk6!=B-2c^51a!1nJd>PP1UU|?4@ukCHxF~88kTH5o;6GGB81><XNLrXli4vuAvTJ?
zoLAyfOeVnhk(g#Ik7{W^rCC`l8jszfwpPXs`H7n+kg4Fpo^`I`WpL+n$ryIO-HPgk
zvgN}(?e8VNq=Pcw1IFf5BotadF(p^K0_Q=$tI8=}PIcD7xo)~BGS7sh-5nKk5+0ll
zr`7SfrI~+SJE)xB|MJEB<*_+6%?)ZF6%ukK0SkS7nOkpYli8W+ez23YuD_soDa-7_
z_WHIod(hzBRLeJ{r69YsXm&fXHUY5kQz23aHSyQ=sWW7PG*jW%C)HgWUFqR0E>tXp
zKTEYe=PiST<$L_okA7d6Sm-%rUfWn7$1}yVo2P2fmDV2I!<md+AuqR{j{c^!=tJ)M
zm6<SE&ws99`Z84mSXo)I4Bvh#L%Ya*v-3xnDSIxy;V&kJld)%X?;s{x=i+sQO=HS6
zjc(Nr6`cv;OluQBM2qN-(JVMob&o!UZx84@hk*%_m%OpGX6^;!BQyv1unX}{F`hlG
zq!e_G`C4odW|+mqxCoZy&kd~}MGvGV1Lt=vFWr3+Pb^MSB3O)9qU0CXXJ)LOR9q^d
zdL<p;H3O#&N^{<jzJV2^p`gPb29~L^s-))}U4<vSz@~+2%!b7TdzUd<*s10krQL)~
zZ&2w)8m8yEIhj{bTQ*<Dl(T&tyeAzBTzC>`sPW3jkcWb|ahR^(jt(&T_+bQ4{p~Mc
z(U#W<$pt{SDvzh%QXVB0EhLrS#4tcsgWMoFMz<n$1_YzXNe{{tj5Wp9ekXvff^MC$
zDtU)qMPhP(tGz$YWp|U%0o<zV%{c<#Y5N<CK8u5bo^!5qWAYA~aEsOlb4KaP%Cz{G
zTrP-PJ`X>?xUaYtu{HgIt*FTN9!Id<Q&BXCJN+`-kgf4`RRb$42kAL_5OcrzKUTP$
z75{KZ0#gn3Wm)URDe()1z|qw2&V>vF47|A?Z3Pu;k>;8&-PL~F>i7li^}YrSOyvbX
z3K)7i`o+wW-I}(3<%1?}7zG3Ls^_(=2B0$1NfcUVlB=y^air(GOOa?D0xM4ZKth`~
zG^MB>&~iirXhfGN(3_~8-t@=9cD}SR6FdkWNGTi4#OZ;V=0v<WUS!RuR>GZhq^*G)
zkuY6Sce#5Ye!!2(3sZ6fh=2xYLP#GRa+s#}A=v9w*WW)KHHmroHe+WIQR1u$v3h0i
zPE?bC+FUwy(V(h4v(|pCAjHD-`jF9?YcFa@Sj>C^HN>n{WHJ<zAS8?FVuj@ORjBm7
z*X3LX0R7|JE0A%H-uN4^fg^fwzI+=p4#dkU`=sxTde6OKV$b~#s@Sd9(1nCbT<t61
zM7TU4LCM-x#=SVCGGO?Y3oto-bH0J7%ay5~NgV_?AJuOf;$)HQeAJ=!MQ@n5lz}L(
z6Y|)ND?N-SDIux|dK72e^)pvUl;hX!VkgUOJ#u_hlf&8P6_~jis)&$@v3^A5cV_74
zA?Fua6s0l$H;h&+fAd|ei%ZdXW#HOHa`2=Tor_S=>r7;V;3cy*EfoOc1B+yVPeb@|
zi-gaB^FUl}kqVD|9B<8IbZw__OS-2e+nnL~ANC5ftZEX3bXHw80fxXSDB;jLhzg|0
zJSz~?Ink7wB*p8eEUrT7x=hyaJkb3MTE<Dm&@T)8q#jJd1dSy4?=fTU6R2?>`YyoZ
zQSL3#X!VZ-8KQ&ZlIt*AQhnkPE0z^$YB`T;J>WVg$C0X=oRLd>?0v&2)X+8xXRi++
z1Xg41qU-n$Bro5`N2wC;Kf(=jR-G8ZIxrRQpPJtYyXH!~w-pqvJB890q-{o+e7Nap
z6F=zflSPxeEm_(8F+o<9MwYo7>mVXGz>?SHZ&|c;8`l+Pbo=QMbmYnfq<;1=T8afg
z3fC+Su^RlT>v`Mz%P@`c$@2*KWlco9EI_!SVoGMo>H&g3?tJ8SIyCJ3!8;=|4vTQQ
z#}d8BPo!UlNsx?J;uo!Jo_*B1v_=Mj`hC=;X#Xuin5TY>@G3u^y1s#*IJ9Y(imggh
z9MUK1+046;t)R{^r{(~jN?lMJ!5tTeIp36K7AX22W>ju2?P;Uw&Ym~IMMoGZLJBC(
z`r;CjPx^tqGsz=X>Z11Bw`Lw%CbcbTOwHdJ0=FqW>ylCyRq?QBh;^|$d13NXIOtFb
zd`-GeUz*qBKN=iHu3b5U@J#Wf;(e?>e>EXOWxl;ojx)oGm$<F~%r@w$APWkEX|EMP
zpGGYYSdOxDGIEWx@_Hsl50aUGx?%qiH0g#`u7FPd8@w(Gvpm81HtbHX(i+0p3Rd{`
z;`ZVe_4JPutLumVi+uR<qz%JIt(UUDOa_s>nBfZmre;H$b(lg@PF_%WKGrR?s&8ue
zNT64Pgh6-&sT%sfeD{dh`%Cb!3+W`lpOo8Bp`E+P)Nk0>grn&=86>_CD3yM;GSbnu
z<VUz73b9#iqp>zG*<9bVK(epd;z4fI=cwR=zKhDso47@!?CLs<{oD*^a{dPjPC44|
z(nt_<7hIEEgYx_ElN*tQlm`t{#j}2q&-*?2$OqT{Rm;sCW>iA=r+rycW#{ndK92w|
zK+mfC{g50h<`2eLLFU_CJjt=;^q0w+1A8-lSX49#Ws?~{f&ocg@Tzm8RLFgzv`5V`
zhLMoeCMu^*H6$XNY{~WCg95Ls*|!GiP3hQuMk>MT+ZfXy*(zJv)+rn#6gN0PK;Gra
z;3^i5A{G%M!EsAq26oX{1odUTm&xXO`MEByl-hMb8yhvsr~nM|{O`!5fU%4b=r0HW
za*Q?ptW$86?LDwMH{<la&VNUavnhAFEl_aw!IN7Yiu^NOLt6lPL`t=D6Z?2LtgBN*
z4}5;1t<%>AiNl(8#9hAUW1z!dmjwTPbi&wTCUfE(P2HV5f!`v8IZ3vb{eov=$Ow7%
zUuSYVqI#mrR7Y9_46({VRTz4lcyq`P3c^&x^ZQ!8vMi^2*A%rqrpv-xbdM&UclH#d
z2ybRu?9kliG)uBLv1+*0)>+>vJV0Z(RsG)%+U6ehd9y>}Iobz{XN9vLnZ-|LPqGDZ
z<T$04JI?*2E4{hV>4o?!&@J)rV9RprY>Pf@3`t%7vNgx80~>#XftH@OJrTX{uZ$XY
z=q@b!6!XgpuiVd$-6$;X7KaM*q!Sf0`wHX0&WX`E-`rl6)(fjJ$e{Ey-unnk`(O-5
zpzZ3-uV9xSwV0_tfEH>{r(V@imXJnLaf4cI-etHt{s~7?Q4KL(WrYvxynZM?g^_sf
zw`bmn8_24Nj);y<%6M=7!ee)f6Vd^97d9$DHiSGU;6;D+Ft}DC$SANB2K7SG`hAj+
zO?J0sn11Afu<Z+0xo!gw^-U}A&ri2L%zp~STVv}eI#EipSK(&9W*hQ<(`k_WR`P*y
zB=*#0w&Wb3IkbbupP=)Z3-W@H9C8}Tt2kA<#1yIg(pR%Tis1T2ecc(&=G(^NS?@DC
zz!EJvtWd`?HSSWb-cW`SFQ}1=!fNXIl3sC5Iz?Da-6(`vsi-xayhXx=N?db*qt0&c
zmLjo5@CH-l^qjLlI(o)<r+=-SKgrnC=xcT-<tyo#e9XoN4<Gq+C^U^cC!K?shsF%b
zRXdbt=7o*vd}Oz!sqLbJqA2^w3v9?yl3{!m0n%vy${MUV`5&4$9R+eS0l*Rqb2j$b
zyTB(<>&7;}P9yA>;p9gL@h9wn&|=1((5Y8)MK*c%MJ&#nR=eUi{S7qzFt}%=Nl*20
z8{sf0lLv&^T8)xJ*Ga{7a%ZFD#RI*fT{{QeMwD}+j*W{?e(@*l7IQ49z+^;QUz65@
z%6qe&O&~^e>bb-kz;tBR7~3=$YLwOZ{yj0JVA`#i^U~QRTbW=!%k$yLK^;d@5Sz`A
z4^qdu5AZ{<4SQ^HZlQ&>Z8|hY8dg$mBOd8T+CK?(EzX+;4N!K^;%h}UoQiK1$ra_v
zE`BWAYTHDs9Q+3hkYngDe&N<@_u7d@Zm%>3E1awn(AJgFP5m!iy-X%J;Ulr^{f9YJ
z(Codf$+KS2=+0=yUzpgBpQeLB86{nw08^N6aClwkXFSbJMQ7osRh5nV9EC!)jWBSG
zvcj<GD++<x_Ne+>um$*iu++(o2zADF@?`2cH|simPRrWoS;c><H))y!U@DClE#gUE
zb9jLBh#qVq<26Y=q<XOah({)I3=>Xp!ZP?Zu#FZqeE-?6JY(w)m?&8xp`?37fp>rB
z&YhhgYE(0&4YSQuC}@mc7*4WWw1|@l&=dW3{T<3k)n!{Y6jbZs*7`Q#(|&7|^AC5g
z&hk&{&ko0be}p>AZ<N`!wvLsieljHnonPnwj7@fWA1G&aSKhXc>HNVtYZ%xIb(5Im
zUw%R6_tg9R@j8DR#$*v?QI?{QBoT@8Jkw=Ln67#RoGIli{*`=+41YyYC1lhG`S~=L
z2cw$E+Y+9p!_=J=EHnsQC-1TRxn+(W{ROl|-z&-w)22^`VD1oCCNep;@?E!n?5WXH
zn$1(JEP3z6E9gFnCDagHA%3!j+cD=70)L0FT;r%r!nHN)*^^{~Tm^YfVcP!Nb=F9d
z&CsVI_Z#dvw6>gZ?N-m@mUIVIcO6awU3>!KRocOPVlERV&S9)!L4=;Mmt3tvL5H3b
z0~x$s{H1w7;{Z>A>L5=(BTlpCBhPeRNN>b{b^=<D=^(XcuhN_LiV_`o#byv?EBr~w
zWWGDQhD<Wag@ocst{Lm64=0>9g5w@2<kZbKx>Ab$T4Efxm`8^kh~X@vm-G0>Q1HU@
zX!4dxZWeR8?9^PQ*oc;Tt;X-1VD$k&3VutUR#Y@|Oi^;@8=%*9nWA8)sbOdI_6hJj
zfjBSTgK$d@eS{!|5`<x8<CNV?A#_BW-ew`IB+I=h3uQH_sy>nF+VUrGY3^N>9SV%m
zgGY|>`KuRvS_o9&^6iq=v6ocsm+9-bvS+y;gQbahgC&-0o%)!JDdL2gGsLrC_S)=s
z9YfmTn<}OPVxW-pWI7U@4ZzRe$mt;!rZ5u{%0nakeY#9S>}wi|(G(<OCS<4|qv~u_
zkDQKF05y&j5@?{m@8TB`(tE53?#(bPt?HrP^LTLoa3`8itTj&z_~_l!PLdiRQM)Rp
zalqHUQEBM+swe*)fybzKa>%}tYyzEsuPvM-rz2`=m^E4tu*h1?K`l4HX7=~v1IoTJ
zU2Rzw;W84Wz*jJ6{P#C6ksY<h`MXZRtd=bwGv8zisAYb|bG!ch{*tv7+BufM-o0fF
zj#h55et44v5tW*cOgv)7a>tVu+Qm0UL_SU#OBNsV#ChSo1imrbFv6gZP*mAuVkol=
zaM75x>z=QGEGOJ%(#r0Sua<g?S(d~G27>y&&S)odWO^VR4Jt)T!K7i*PF&&yM}aT|
zJ9=|+qGtmA6q#4bujJuE)=@{9d+CVF3nJTi=l6?s-5UBzhbEpL_U+TcQDB^^J#^x2
z^23?V<J2nf1Q-<r_v7_TP?6=nD_=Y$6L+ID)MCgegmHG;n7f0_J6@-C=<#h570~9d
z_9WHFo&U0k&BTS{L3l6a8R|+>ZW}UkRmj%RaBC_~Bzi%&t86mh|G5AZsw2NJp3DA}
zyrmqmE`95|lHV25@G0Q#I3^j{$@v=6@VZYqIusz$*XjxuQ(wDGem>_k{>h3@QkcJT
zw8)#0uP$xvpll?=Fd+5tR4XHaP9Co$Q#y&}x#z|`V$n3+rJqJ`bF#y|5xe+!1+KJZ
zvOOILk9O7XFC3<QgO|^O_VzY!W2vreT*yPyA^PpbJ6apYm7isW>kddQr1x|TFs=7T
z<{MnALi+3~#jGvaG4eUj?am`kqyaX~2rC~?v&@6`V28EzTviEj@2~L_D$hPtHLIz*
z%yo`|GXJHi9>B_DFbGe1PR49Ri`64V6w!fZ!sPMNmkpN*N^+~|x*E}gaSkXr!JJ@<
zn1<Bph>G&YZ|I77s$lIZt(9_j+$&<DY46Fi*C8uY%XGe5L~GtK4t>2L+M0A(KM}Ve
za687{C1hVjHg#|72CS)0$`$Pb<Azq~xVZr9zu#^IKuL}|OdAfr=k%(tm>V6+!2S0Y
z5yoN8B6cIR(bB7T-b20&<E+~*98S02PddB?S{|o;Jp42#&dw9=qvT+dVnAq`;<OQx
zn#Pvx{0vo*>wM7VrM_2ay5SlZDLq&%H%R{_=(X?D|59b+wU7+Q07B2!?%}lyhPz!-
zP-(8icIsCpS058K)Xa0!YAD*As}c46(@JY*tZsO$eR|Z_6pV82gWHwtriFLK_ZTLY
znno8fCI1*+2weIKSrN1tY~WO@6Ce%~$4%u>lo@9(EbFFQPUEi*gj(QTTlYIBMkt{M
zJV=sp6Vvgh`sdHtbX^9f+Zx(N4vnRr@fHpmJJ+Tt%RO0Qqjov*ifR@Op_J#!>&)-U
zw=SK5MtVw--pHk(+xhPk?bxT3PASTd15aIgo>s{{f8g4lXJZL`*ZexS^3lg<M66=i
zede)lz<g5esF1q)x7&K;u+$_Ka4idOObXo}QA6Hkad?snH&71$T^V;yKpFozOD)X3
zuM)ww<%7H7B)#^Zq}-hXPfp8hvc!DUJWgU7NJ@Yby?c~aB`>vQm32aM9mb=bNb4JX
z-_JAF`?77vD{7g#FkIq;!9Txu2(~6|5z4<L{>{ACv-i9Gu8ATSbi*vXcxOb=n8Zn-
z7l};%^r@U<!)M>+se7{OaH+e_gl;<HA9vcOAX?Zr0wzWUI+rn)^4ps=tB2yx%?In9
zpPWwuZxKD%4qb046|lHT#4#n}Fqwo_%+vuJe$7W%lpe8U@81|=EpGn#7PFrHQR`ku
zhM!xn`wOSF;B<&&uI)<z6lB!;gOUo;v(n%X78w8vJ@EH(qT3rq+!UlOBIy_*AVH33
zeNG|SlxKzVBxWz~{CXRR1p^B|tz6cx=IGpZDOWP5G@*We6eQw61WuC1O_ibN`3Gwb
z(s@c0kJ;fBRQ330r)dpTcT^#YkJab~ZW=v{uv7_rwY7ba`{71?v{&1>`Iwoa20zZ-
zqH~}pt^4n{;7$r(7l#F6U%w$1WEq+!ExNgj)Z?K)7IBYuz#7xZ<*>qDM8sFq;mXY?
zMzJ$TYP@`1dXCe=JiOmlX&t^;c9Z}g|FY6M66W^ysl1J;K5#!Lr@;b_M?H`>XBv1}
z9kR=8BWj!mCxs>W9%ljCyc^E&IJf~?7=ncu5Kj<%gWh(9&rDoO{9UbFdT>fQq86QZ
zVACse#%vM3)gN|$Ho{FlSBDlf{_3%%{F9d1F;801%*5WaFmDLQ!yn9^28td`uEL?;
zQZ(W|)d&61fUlKzO|q>9EG&4rxW*iPO!=g;{G}%kW*;AC<ZqRJxyg6V5^bbOg_JMT
zwRbX|dIBfd!8JPVb2<|*6>*+>-dSWOO>zwPve~lD`kwPc3lA5(h$7Hu+;f&C9}|y7
zK?CfnBgG#qq6P-_0JfmQ+DwYOXaFZ*Wx1VVdhZGae+*%wPh~i;4?umrm$Of_@?R&4
z@CJ%^t~H-hPbF=Iu?ozV?4XSSsR37tfMI%2kcHpAhy$Ap_Jm!f`Q>PXE7!I&-Zni+
z#gtio(aASg>1N1>6sJ{ev68{I8E>m*&_94P{->EJ*DI^W1)DcYP*1?lH#euD*FR*e
zw)v-*UX$YdG4pu6?))Tih(Zf(hrgOx6q*yt$XSXNhA7I&alWRKx45^d9c|dhezuej
z|J`BQ6mNw+PyhU$k6VV*ZywELk(Hgf7y(ED2P}*U3BQRx>Og8AZj4xQJ=S#KA>Rh8
z<fIL!+m39E=5OsK>M%N*&5v(<$w+)^_B!-Kvi=W}H!SfX{Ep_!WSb`H?S|TfrY&yV
z0Gs5U!vl6_rqjKL?TDt)_TGlax69q-;WG{{A3yVbaJlVi9FU0|3*{%sL-aC|Km6RY
z1nZrzQ%l2L>Eu$+5r5jbn=E!G9<{0&lW~aAUU=*GE$cEOH$sMa3*y~2s#K`Pu|;@u
zf)7$<q9(|eQ8S0oO_(%Fr`x)aQ00{gsAYsTaXm{?Gwb=t$DYX~eMcrhVS{T5mz&IM
zdCjnM`Ab=5-eOe7igA)1>EuFo3vv%jWiq;O@bCl>yT(U(%_LK<FvI7cFKzQhTk#86
z(+yj&Yr1527r2RMz|jlX)&|T}Klge6`Ln#$(??QqI@{~k3^4O290@7AQmLOSZ+TY#
z3vZwC91vD;M0w7FGdlMGh%Nh@?V9b5aOrEBYfARtZ#~k%)(_PkwcYnhka1GT<&Zg<
zz|3Qw^jPZ6;ci!w(b)?b%uKm*+jNUtcHCj~>IIsj(l@7>^d_3j?rq*a&%nk$f*p&t
zQqm_rq@asD&ufo>jb>w{qU~Hf8%Ifytw+x<HDM0--{0q<Jws7#GM-QY7~w03Vfer;
zp9Xi&nj$qu+8dh2F-$wCf!j$p1WN`|pjTUAYCO)`4TLOjgtGnSch86wEALMK5P>~|
z9`;%<Z-&Yv+K)b{WX3=Fr{>vr$(F$tpkY?*a4`Wcy~P<_eU#Rc_f5wx*;!LAW@MRz
z%$!b_UJI2Ei51;M$A@O1jUFo3?|Pz=tyd%vTdx2z60xbLGEf^-o<VLVo%kp-!5RZa
zk^})s5mgPhw%%(yqxocYs&)7LkJGOx=={XzLU8h9ZQTY3_8`+f3$71;wDO?$Ak{iX
zXL&kCq<oUL&e-xmXB#t5aDE{OVfp4^gvXn-6WJs9TBPgVHs&+hwEU`O@eg~SN%YRo
zJ7NRxF5EmL|FHFaXjQwiN%2-&?nX}RxCY$_U?(O@c03GH`+c0TEn7QFB`@MhTvr@r
zOX*zETu;;ToxSWW^Jp!4_~{sA`0g2B3mh{aR!tFZXJ$(AE6_H1Li)Jzw1}H(Z|d<T
zDURuc{-Q(2EJo3qlR63=+^jZcfZ>Xcv&o$ja*?!J^ye*6jR5@=SulODg>LaTj`-=$
zp;$MS<_t#gju|He0t+2c&j72Xm$Cb$s;jwv9?0y-%zid0g|&7%yq9g#U*w!F4<iyN
zpU2j%Df^<uPOSB)(jTE?6ju=lT<1GYb|<WIzFEAB=yZCf+hG;Na3A6B*NuJrzj7dm
zhY8DV45{`ixW8$dB=4C|WG8%BUb9>MS*(uu!y@@A-E%}99EI~o-g!Iy^(#lgPU?pa
zadSPJ9|y0jL##NH^u$M_Hb<A*J*f~Y_*;9zh$;y5%b4lrkV>!)eaWZM#4p;q=(Gqv
zxc8amG#ba*wWKt?8|_3cyb1q`feDViX@MIzYyEP;fqLnFCEKF;Fwmzae;yDbZ#7UT
zs2`Iq-vN8*Hd)EW%|=gOz45MpXZ1pzHkM4+<J{B7m-*%*C-vgWRmC|eH*fl>rn{3u
z!rM-K=r${zR$#U)4-s`farfq(DO)e<EkHX<{MC4Zkl#7R?!%)*ud)jnh0%u5MRBwj
zL<x`hHnm{6VjV3l@itoIe1hG^7X2t`W*w?HQ@&`8;9_!TSH`p6bYod3!l@6D5`lp$
zmk`kw%iW)KtEv*DMhy=Y)C;}ro<+nl>$<G}FoN;qq{0uR%Yh<96e1ch1n^8uA0gZY
z1F>SBg4r+Km`Idz<GX&}%6_@PdRY3v!BRYvG=oU(z+6R)Yx*O=73JZQPcVB159NX)
z_z9Dh&-dOOed@{#Hs}KV3yOENhFKgFLg)&E_5J3wDrPJi3aI@U-FEbP6Rq9e*?o2Y
zzS&)l9O|EtTQ4~J!ja(9S7bji3Kz+1Cick}?LI#SZuMFBG4Q1&VP==yrxRCyQl>ip
z7b7^kr0=B#1GJ<FB6Vq7OSm0_?yh`X4)CDH@(YhK`8Ey=r|*x9VhSbgd-7>mk{-&`
zJ^W>UsPrG!bR<Gupe^7|dW5m##xA#AVwFsa(AAE?GY#Yaf~vj+R9nQDe10{cVZD=G
zymW}w&QNK6<ozv_m_&$MkwdNYIQg0RnFw1;arE0w^t-P@u_{J_=5&-C78^tZ=wait
z<~WO*kV3^Twp%xPIWl6NIWzCY-lf{XysvTiqdS+jx0z^V$B=YQGqQ%{ka-P+tBvqU
zW<*3eky&nO;EbJQXUld*?Qs;?f~)NC-3ngglVlzBg)J~A{Vj-ZYr>+Trp$@Yi)YHZ
z4aGdNm-m?M=|tr4bUl*d+C~vpe8%m~gXt_~JOx$e_rlNGanf~2!w26uf|!E2XEXL4
zLmGQsw)9{UR@2H754QceoGbEsJ}t=d{X3}3r``hA{I%Wkl1{fZ>G@tcnJzZukC}&v
z?UCS`2(DQNH*kKqox0>m2hi*dqRYf|U6>ZE^U`TguxAuUfRW%}xN(Xw>K2mGFiu8!
zG&Vw4`(aTuvq$PTX0gg-U)mNpQwBE}spA$SC@K?j%gX>J6ja2{JjUmnAoI~1CZTv%
zi((HOjB^#C1G&yRE41EzFz}x?95-GvCC(MjINy7a$aXshe(8Veev>!S!iROoJies<
z_xt7J+WjV@uMfSUqGLl*TqbGWt{NvV4FB~c{78QU{}JP&(E~wkN^Flwk_rxC)?gO(
z&<JwI`OsqiXK9M3fTgsyP<;RPuGY<Br((LdR$RKC8HTt=FqNBFPjl8}0jklqt#ziS
z2g>EpP!1}9yf1$l{IO*jXz3EcpdjII1Rc~F;S*@>plV9Z`q*qTe^8Lt)u*g@q8QB&
z2;VYRr_Fop=)1_}gyh`csuO1QHzv2Ppp!m{_VAkJqxEOAekuj`lggjof7d}Tz4%}{
zFs{(TFb?jkR>@Jg%hCOxUw8CBpzxR+MmdxDqm00Sy!XTLr1;4A+_9G|^7)2S20FC_
zDb`ZoRiW3l@mNPu1f0p(P_;(}u^aQ@BAT{$goBFtQk)YbBvu74ZvuLVdjhO3sn{r8
zScVR@NAehE4YQW0BT<4isSMqxAKlx_(&vO$tjRM%Z?!gIG@;d<b9~fVXbGo~{N%0$
zDq+|myqObMwyCE7sQI{v>q501e45Zmbjx<gn!u|?R`9z;t5xve4>K%6*MGZyMZJup
z?F#y^S3hXsT=CAl$Mn5;g4$eg@aFfI<p2J5I^MdsL$KL#ju4JqQUu2Iiv)2<hzy)z
zbC;Z(56RzQ=LO+QJ^3Tbb70emey|<S4Po6{_3hW{c;tpnvZMk9A(6Xoperu*NCzgw
zL!)M)hrDJ(0+GOiUp5|tr>JBM28?3+p~3YD^i0tp9Z9`o@~|q5CryQXvkcjdS(B`M
zfUQTgp##tV-2U+0+5L(%IfetN_|?rxtpJTO_uyD07Oebxxy&_*5poxyoQ}=vmDbNc
z!J#wRZO<_llyQRm(!wRC1r%r%lL;bR-=_M%<4X4taA)|rc^}K3b#$P$*=l@}6ZeQG
zlS9w-sErE02zltt_G@u687?6cx=jrzh0}HdXO<80tb+5qDUvDnCIsSdT&uY)e)~qS
z5r>&6o&w6rj#1cTitHr}9kW3oFkdOiIbeoSfkw>OJF7S@0eHa-$S1|jBVc=R4e|@j
z$=KQ^KP8GyEdo=44khI%UGrib9^udvUNji+aDZ6TTzVb*4Euz>7&nABgzwES)z)X*
zbt>-44?7ry$nTXpdwMoOcXHqCyfm69hJ#mHqbyDSU8y#t|41;h=rU{%<NQ~^{`|oS
zA6`DL`@RA0;&%E&TZo#Onz&p}eut8=gr<wE)EjMnQ(4!|zXwZ`^#vX|efJ`gU7~Du
z|3IGb!tZLzl;_lqZmA(zp2Ro?(XCjd*&!KPY$lYVr}zMN7ryLxTGuAcZBL7@$EWy*
zM6UM52l)2cWXjB$w-NZqrct`QLoBp-HEFh)4HqbBL4mw(QAbFFeGHP8+{<>1O{MMI
z+T(o@b%X$~cQLC_wL8H=o2tHFKK|R7T?|3EYs%I^HHP|{GkJ{r{=T!{rK2wI2y-mo
z$u1_C)Cbf{6#Jo41%?e7m-`Eu({wZyzdSf$Rkw`cBkmU@1t`>&UT>x-h<;3>1MxgI
zJJjVA(GhP=Z@>t_MDUeoqPbawfo9t+^dxg9)#$QOtzL)ts5X`&o+8RzFSV)OURuCC
zw6-#^BbaO(tal>13X*YpUh&}TWVyN_FX);}qP(6@t7trb@{brvdCm2Tkj~Hfr?n9w
zz7&ADX~z|_WTTLk77;c_)ul11m9YNKcFc<?@8o@_O0%A^(xiU@8XO1+49dpE8fuak
z==xsMRm@2X#DNIuwYw=(nt@nuLfU-{?;2ml)DTT3VTbaxfu;ijae3tR7QW27mwAw|
zWxJUjCKJnS10T*Nn%8qdiS&|4B9*v*Qz4px-m;94RG~m@*r_=MZ}81e$$wkW1G<jh
zQP9$0`wZtP_8X;kVl*A0R%arove2`tx|WJ%9irh+6W{7UV)z~pt`$C7eEa*eI_0OL
zy1)kK1FN%FHA$`6>ug<ZDjATzIHR>8skoIZfq`x`d~B`cbnPnrrS|K&$hp85g*XSL
zSF=5z%bN=0EL$aF{|E3S08%B$g`SSqFu>SkI3+=n<U6tFt^^n)LCHO!R?c10ohBP%
zF4b|WqAk5<ry<1C2p&ql`0-BcBlsmtn$E)9&*$vadK>yD%&P!3EZJUC*gehDn=PrI
zZ|Rj6<xwaY#YmjU*ZJ93zP%$k0UqpR+%fNfkmQ&JKMP6IvnVk$MUeqkp|ydvv@f?T
z50tTD?3?jRJGwA6PEXJ~SIc9|WB>5Hf{<4e-3~15EP|I^5g}XD#g6D^f@sNU?oxag
z`9#{zAUo}hhP+<$#yY3);<n{ID|zT^il@P&AHD#|U}>G=IcXZ0rcE)}tB8y^n5zGa
zqh}%vQ5K`2#dY8ISqV7IF+>a>!Y}Mz(SY%+25H#z(f#^w5O#Y5c*bnbxU)wi?q^q@
zgln$&aCgh$gfs}qc379FqDC70IBk?qvh}s7b$f{%L%JQ)$7QKC+MXm7vQ-Bl#u3cX
zp_@(Q%>fF|oQ!*h<xz$wrU1sS1m?5G6S@&1^7)6&94gv^oIv#+&BINsI@2wVEx*2U
z!|k-7Kugh+28hl4xeW_?|Fzn?>rQb?9@?FDrGb?Svi&hWqOoFoFJ^^T(F;;&P=dY@
z+j!AIxz626@P-_(mnU^c$1?QJUh{#7fIGAnTnl)ksj;SOayAra_{HqqO*1kE_O%D8
zJTm!KR+)be6^*u>n?LLl4uD~D1Hw{I%&%z|Uc@JqGju?Fy4Nosr%>!E5}cd@@=Iz`
z7|c^b7>3PtnD@&Z-&Px>8w-1#Fw>XC2Mlu;3>9Oft`_)6(;F2&2Rir|e}7IKRF`T4
z_e<Ztf9t@#uNVk1)j9lJk#s~{{djkuH#%8J_c(aP{*VOyEpqWP`FpQfVyyeqGAQ4X
zSl?1m-6HC2pDaufsFj9WVA@qzThNT|Rnd_%ZW;;W(l9xTU%ZoN$^HRE#&RfJbF1$S
zx)8!Ui}^vk3;rmMEh?r3on6a2Tc!tsFaZG_#?K@QjEQ><O9w6^>#lvk_3|0?>)*7T
zLBOJ#ly69;#?*VaiCYmkX!Rw*Pwf^z%~CzWcI6gA&w`)B(Oy!?V_=nUO}Ml@YFuYP
zF|KGnvg%Xk<}M<fu0Eh=Amied7s5+&t#jh<yLS@Y8ZVofbw>U3N*aUTsk#K2{2Mm)
zM1sU={!-(`tO4&nErdQCKCW$-qf&f8PcLT#(eInqWm3h8j|jn(tYjYl+)m6qh+yND
z&Fkd=nH?_`)%iTv;R2x*4~9vgQaqHds8$RY&Lo<ATogq9Dy5dRP#B0!Uck^oDF#3_
zL_E_P$+Ux|LJRbo_R)Dzhd;lZARr?wcip!}WIo3ycD~~iqS(F?I=9jM(ugc<Y-<2#
z`|sUfx>(z+$WofVH-tE((pT{4>$=jj#v1?WZ_n;;r26~f`Y~0ps*=}bX$)!nH_2QB
z6)3t>Wr%s!e*+sCvi$oWr9e-Cg=0vUXmqhNDt~V&X`W4ZftM*GOBvebT{q!T=1)}a
zb?dxYzdxl*{>ev@K($;Cv47D|&^B_QBm9R1yaIp~-6-y2P0??{h|FU=32fxn0sn#6
z36nOdGMI9v<X1|G!UsOe#VwlX*2}pgIc70UJ>JWwo<ciXn~eHrt^m2BD~;gmI|r(`
zE(N8J5u&ouK4W9P8`S(sA9I_JFczG^`4854IKndp4l(_Um*0>=#h>HLB5u9*yW``R
z@Lj&TJh<&{#ryHY+&&tZ2;)w8yF9|-UZWa9c;)MvERfiDMZ>{R6ddZ~`_{*TUrKE0
zx;XsVCHu(@yz>@1D_2E38y8qYM>NmgSrWwTS;JOPeAR0EU2VxxfM*2!OT_k`JiyLc
zR*8CVadRSZFv=^B2I>6(xmMi1Q^=QmBTRjjWvSr)$VGBFL?kEG?!Zx<+{Sz_xSnCm
zc9XfBQO|}3ZbsLy-q*PBRpX`4V%hMhp@A-V|G)RoIx)I35s<p)Kk-1q<Zg$&WG}J~
z!v%NW_sKl_sy&V5UQk_k<+rkJiDq)`|6ZE*uheZpOxa&=8X|-@L)1sE_*O|mOLZL@
zN1HLH#=_Jix*ZZGv?FvV_>|o8$$MQn84KU#^i+lpq>sh?=pv42)Nk|tSsZ(TJ<YX9
zYmD4LV|1zte_DfW)Cz0`HhM=t`UHQBwm4zGkXmuN^~^!@we~qGK8&0`*_Qyo((00>
zY=Suhfl0x?g)JNQe~$PA;lV`I_Xb?WXtuyfVZ~l>flwB*_a*oI>CxWurYI&e7Z;a%
z-n_OB7Mm>z82x;ANNxCKx^!V<!Ga@W$fJLdoHS|V2L;zaQ?HHZc#K1I$7L(BxX}UK
zWXJ)E;2bl%1Np_OB!@3bnHpCYtd_}H?R|2ApE^*{4z^7zxt+ORTWmRspyQu4+IoYj
zjQA^d5)ONMR1%cS3rV}Q>2+?ugq)8827p7Z=U(d^MA}p$#~#UnhWa9(=nWhA3Q4d0
zl@0`$^pQ}Yp0scFGHbZxV>lHgpV}TOI@5|2_{KK4X(-Sx76^2q;aIAj`ZO%kQyAjl
z_up4{6ubnL>tgih^i31;74@G4&9A~s++A41f0ybmTf7`EAfK&vZ{K|1dUvDFTQY9>
z%EDV5olFOzuHH%R2OY}4p<~(+drcg9->3u53(!`9`!3Ue>Sy4oa`bYkS}AmUi+Eea
zY10@FAcWL%qjLjl*&e~l6ADD;r;JX|9J{Nt&gH1GMLv_)6Ru_?YWw)(UQ}v3ec+>b
zxphe>I6BtKWTQyQ?mhfPIa<er@*r-Hq+SHM>CihK%_Si9ir%PJxAgyKG2QdQm4iUw
z+NtZP$=py@?-q<geoS_i`Ue15B*m%WNw9ymn4Lu8q}(ejPbr2eUJBVaa>|qX1F)8T
zjC_g298l`>wM_4o!jewyXR9e>_z5GV;wU<}rwDLze!yWNj483)vgy@#5su?67^<-u
zl8j@WbPzzQwhPeCQuScTHv13Udx0M9!*1~>jtBE$a<RIv!3j_uU(if<jCZN2I{A97
z*@A*ojAIPQ@vV7$s{7p-f!L(61?%VrYRpe*^Q0rT*f+2T^^a1!dTSmly>x4xnbP~@
ziQ=PO^sqSzaP{?@HmD*lIoZk24WL;O0CTW;?K^vB0OA<?*+N|W_ljb!XBkL?E3uxa
z1(kOaTBEjXZ({52mpl;2>DrK3^W4{|ir9)Iyuxe~KQs6<POL>`QFlzNQo+@*4;@4Q
zcdfl@WtimY8y$r{CxB$pSHDcKI-uL)OWVkU6Ar9m7b03$c4Z_PC;4&24mTMvFCzQ0
z>vT3@gZEpgYG7Y+NEa~MtX9Gc%wI-@zAf51{JhiW-L{+5A8yH}$8HO<DRt8!-159t
z=!}pS)0Iz->Pl@Ei(Vc7h7^w^r;5T2uk#lLX;YHXvS1?d;z|1^1=Z-0c5EZ{6La`b
zNM|;3N+{BsmOdE;p(yz^f65YRV}P(sxkgMtp7Qc4gI0tQV-T^fw#O!B6J(e}r2GKD
z?$h2)43|1zBH7l>M*%rUz7o-|ZpTL<X3ILC9+?BKL@k)vzS%awk#WLws(zpRWqKDh
z{ih+MMr*aN77(c9CE5vd>1;m%mN4d6B|8rGXQjJ-D&w({mIZA{u(yZNnuJSiOJP9f
zb>C~SNkQ;~OHeW~xec^4)iD)_jmA$Mc8_1x97$qj|IpcVHj!fB&Z71J9R9=Pl_rrG
z{q?u7Zh7Mx5KCnqwM;c;_8t8`A)?P{jRxD_)c?hP2pqQMCAqthkMc!w>C$2sYH*!G
zl<bKluK`aeMx<bf2nn9bCNhf&<0bnO_EiQg3nJ6$Wi|vLQ`jxf`sfNC5x=o0e-dTy
zo#nm9-QX|vm6Ge||G5CfHxT^I(eZGB?u+UOkg)z1$x>;3n|#Baw@htZ>O^ccmC&I7
z!eE)_+B|or?;CaGHhP)+rn2w1eyO(A|2P^ggL|@O|6x$kV?>KxvtDr(&`iNP9W(o>
z{FoKa=bUsz*TqnC_R0d44DBjvpp(c(FSBa7Vb@Ih`c;&B6=o2R$a6c%O)M<&d&2p*
zxvJI%sSDO=FTr}zLejgDs!te`<w*_F2?DsHga6JX!cyZ3I};Ed<P;X!i|Zz4(|9|~
znTcKby8;lkEcUMNIG^V(y3%Tuu7Gb+ijO>=PsYhE6sJ9dFy?5=mMWPa)#O4rJ&HJv
zO=H>pHow<M2Sa*~aniBH(QXe|PR^*Pcjs0wc|8@vwipwW9zs%qEz-K~fUlg?`_9^&
z@?^&CzV}xzGYY4iZ}-W)p)Zt6G}qv;I3DFWkHc+O6ATPe;dtq{Lbt;NdHH@^JYQL9
zLTM-nwBs5Y4m1IL40h$T=wPbL`fGkS*0{I^+opygF>ClkB&P{E?{W$Yo$h}Dy8YDi
z1}-4?Cy2k1*Fmv@zCWLLO1b=PG^X_iXHv7)M^H}hyrnV}ScaMRn80L|)?f6PmcB}B
z1&1JPjie}MZ0e9kskx~ZxxD?j;qk)|lIMT(^?$SRxn9M`-1k^PhlQJR-(3DulJiCF
zPznpoxcW=Dfzdd6L`%2oB5%X{fC*`vreSXfZFq5ENVHX=5Ymy;Vch;A!jrmmDg}c%
zIUogyB-b*;seNkI6=^(4Tgo)pu{iB@Tgu<}8$*l*c|>=QiR}X2>XV1$ZtT964IEq7
zs5?j=^2=}#IerV%zML)JY0A!Jr>W$G#JC8yDtN@CvAI-qfGJSP`l#f=j^lQ2y&@a*
zq;ppB6#tse>(Dzj_7<47mfAl7b9p5}S)HS~>U6F_ivO#%Y>_I^7;R@$^WdtQf;nQp
z5&3z+_#|NQBMZllS+0Njh}6jX$949a+@g!bo48W(d)Y>w*?*hgF3%C>2;sPgekd8-
zAVjLzBlZ5l;_v$!PeMI?JjwrHNQhfkCcXEg_4T3op>2}MM_O+{GtzU22g(qEHR_k<
z;a~-N8^$@xcarn+hJIIXw1<>-(R~`7rtyX$Y{6fr*Co>^)*PR!tzEUBw)wuB<!#L;
zb_N{In=^+~`pZ))1?yyHyCQbIuEghkW8B%jGlikR<RZxcMfQ_c=DeSTy_D!vZ<bs~
zCX?1@w;h$MsKJRZuIVW%Mcd*Pp;x3M9*=e9+D%CfLNmWoHm*>abB{zOKwY76N~v;|
zaeLWR#)eyux#&X3UQQn>9j;!)*1HGSr;XghKf~}~Iex+8xNq5DWdBo!c7J?E!4Vlw
z>zMQ8@1LwHWUusa4@;Fx{@c_4Ywx@N*?zzG%_`|j&Dd)17_})y%~&P&3~IzytEj4x
z3X0mBs-Sl4Jz~^s5w-UyP0gZq`K0gv;`?}f^J^Y?=6>Geoa<cYI`<hb+@ERZF2o5;
zY}P5P2;EY0yeU{n)^qmV)-%xX7q==>T68J}iAV8&e$pGFTs)3^LS|_s>mlC85_KZy
zb&u@4c)#x7+AJ<aB8f2sFiLk?j&W9U!c7#(fI*i}5XySOu1KPiTe}i0_6gSo_Qq=i
zm&*T%K7D{A@{xDy*@QK<ylHBSmTNZr0*R(48*c4aI%+gL>5QnD`BSVvV}rvRBSS3H
z6o?V-b%>Z+*m9L$1?GrYsNo#rfBzzGymO>`tUfaL%9o?`xg1GT)vBOw<9N-B=TX+*
z6%Dh=d*&o=BafFudR6H2vagcMVR!0R|KZ7l1JMcS2y3aQ%Gquj?Vl*%X`~KFVwADr
zD-p2BOy)ya<nlwrv6zx-zviyp=jHCTUQIrs)y2UGBW|d$OM>px-DiE~nJ;Wt+ohAE
z{sLjer;uyVJd|Q_+S_RU92i4gFbw<|HGVn-uW<%SZL^r<+t`*fjT`3^tD<zIzs^=&
zS&YWv-s2x$(b(witaFd8{Xy!iN!RO%ehm|)5-90iv`2pI*_*k4g$G;=%dTPg{rD{0
zpirVdRh<u;a;ArYprrhje>Ghy3P&|!3`5$X?JrnZsBcKV^M6Rl@-qv~eazDPE0rgS
zmj<^%il<>^@E@!+%kM+_pl}J^ks-<KM`d-BU9`eu@t<g&ZO(p+Q!v&F00s47R_q}&
zCFyc*x#rTHU_m!y2e1$F^y<vQ{msAAxE*1R6IAWh@jW4Yt682SWNp?ZXy$F0q{?TV
zD!lI)X4u9@MT^9qq2nJOtcx`8g7r)285oQ0vH)?CbWyRoNV7j@#jsJFm3Y@+6joLp
z8o7fLg_5~8XmEpMxIo6kJgOG>v;C{5wLK{CM!&l6^nP<xe5&DFo#l|(^(P@N`MRr|
z<26`wChUySF#5Cc2Q2($wHkc?3PWaT(8B#sOq7HFm=N~-+Y~DDl=YQw(1!jeTtoM4
zvL2!fN}UH}4NtSG_4MQJ%1#Nd_1nGI-PWYpiQ4x(N+}ShYVk8WI-0k=g=KX=n_6!H
zUbb)m0QjKYg>&RLC!m<4$R|{e|ECA^>^CD@u=&>2mo5VfyN4+z$fmfIY*sm5uXfEx
zgB`>l-jI!d$K3u(5-Dg90l%!TSgtd8f427Rs#s+*KwF`5$)>9rQMFG4t?;OshFcQ+
z%YNsO>@kP}R*LjIl1uH}^HuE%h(qWUa`3KS|0L123wt$li%XZk4fT!(JWMa4i#&yY
zVa^O93-Nla;-ubd5A%G3<frs$^Y@Ar(4{OS9fcIdyi->RxRY5Uo@1+eD~bBT3M8ov
ze>m5-MyQ+Zq&9=aN~U>2(jE)zhS=~g6Gj%wGIB3pGxT(Q{_X04?$V<iSOt6QZf<%0
zOiG*F@8sL<e)+**G{TbLU+vL6n~&Y|Wrw4N)0l<a!yi`nk<}d`PU@3i2IQ?W?;peF
z>QRWZ?OqD_TfYK7TgKcEkN9)mv?wr}^jN{3*`093^vaA23`mTkSGq4SZT-$}$GKOh
zA3gKVs>2^n7{r4sA=nPHW%aChr{04jCK=VXE^M5DrpsGDL+<EKs)l5@_TW0zJQ}Q?
zLz>3v^DIf7QJ&QIpW<m+uqz|L8a^DuZ(kqvR}}9l+!kybWlMNwj-hKGdy3z*NFz*?
z9RB@B1=A!P6MD9Cwvy^z=mTRA8llZs7(Q@52gs#vYx>6eAzqg>h{~t;ht(^@hwScY
z`rATYaLlYU@YO(C8gaxp&(<($sFhjSV)766v8b%GH?4l7vY6XL%$=@auCvC|mF^_H
z^8IdotY=%3Z-%`D?c~xBJbpoL@!9U#;_<(P`Bzdc8jj&xcAY2<JN&(ruUK4G>r)-b
z57PQPn>^0$&3w7}MlXU#cjp|<L2qv38X?iF=ibPBR)38q%4GW*zGG*Neyyb0rZea9
zHVt!CGV-`Dl6cc5#OT%aNFq~O`u^OxA!>{SGpLw9nz<*5$z3AP+BLwkhCH3?y!lwP
zcJ`z;@!ecj+<u&|u+UKBp6=eS>531wx0MIBuVMg9js6ODMbeM!o;1<Ib2$GkdKNk#
z|77j+sTgwo{X_&i+3r1zL{LhLsC>cm$pC-rOn@>Q6&Ge80o1@MnawjEL%7|$^zj*e
zl8cwBCtdsjP-()IJIBU?WHf@<*ViQvFm;1EghP%9=hHN)=q==V&|Y<mk#h%HIAN16
zEA2hQS=aou`CWUn0ti$ZxI|;|QnpmFxpLb#xN>SMXc@uht^m)G|KGqiNU_Uj4~qi{
zkDhxMe&;VWk4gj=)a!q!*4gCk3Bca0m2fOi&rRamH)fsVibj9u9serg->$c?;u(8C
z43sN-eHsaecQ(A9O@8TrcxzzJGif)-yfBCC`Ub}dE5xEbCGd_ViRl)eMG~~vLbC&m
z4uo*jaPfqxtpsVyf8O8$krwP{YRiGZIRxu%FKe81x{!$N0vF}{1}$7F^wYq0bgJ%e
zReN+n&*EBZuLfTzr8*jPG+eUyZ-~kg+?rE%=@Ni|#)oO1Bf<lBp)@5uk)p!!s~MmP
zQxO{0L`&o~)MeW#PRKuaQM*_YWt>EuWWCU(5-U2#`dnCe3NOY;_@<8w#Fuoww~vNv
z@#=zA-z0XfmLPxN>X@R)wLS<H&}s9|(@mW(pD76Ht_)o<>H6-m&_PT;$MaZS-KL3x
z5>tn}t6!EKfFHk!GnM-{t>&NBR9<=f^1c3W`sP~R4?*!$r1KHu<8{VXQL~9#KDK2Z
zYv9fg+23I#Ju27UA7>&}{3<g-2r&=vnm{8SUNjiS9#%66y43WZCR#(CKaJAJiOfF}
zHJJP|*oj+;?Ga(liiJYGm?Ci`6t?hew(H10h9?O=yd{3e(YOQ35@Yf=UJkHmHL5K$
zp|8HR`J=|T!__O_^t$Xqqp#tyB<mv1+jmT4t6RDs;IedHk+m3GtuSH$l!e(njAUE0
zAd&&6cHKFa2RIk{nd5peZPz~)ur>)<0^oI!+wdwdl${RX_Z;_z@Pf2Gq6Sq%_gB0)
z{s}>qLZDJD{VQFX6b;uT{5&?Pr^%;Oxb)YTpk~6R@G5EmuqMcXyENahTq!B~HuW^M
zv#663ddR!{406G3KBg^Keh;%!nYCYKdZe8qUV}XPRgE4=dbnNlTpPen9W)ht2nso_
z#hx`?EjY#CB1rdYT+Z&^9H2UycOS6Mdz2em7|K3Ij67L~zFJbGLye~?(vgha$Gru^
z-b_`Og;KC6c?dZ5cSB%=2KD8S_E;71B$10K1!fyTP-J*nf57II8&dL2$t)c--R;R3
z?_;(i`^V(W1ocEuU}t`<&adu2yxAT}rv1)*#0wbiRtPCMD>EG){&Jqy0GbEoFOVO$
zpb8Q^%|RwVQO>_K)9zxeJ?!7=<ngpC)b5<m)U7$a!$~CV#nnv`nXoQBw|aJLjX0Uz
zBBU7FKdB_j!4}H&K)=TmRXs^T7RIG;e-47NemEC0ZF!s?NNXUjz0U_YSIs420gpoC
z71VKYQ1M$Uf*F&=F4(KZ7m}gFD??!elY7sD`4t`0rsd%3`*vxHa6i5mWep9zVUBzG
zEuvS3#yNMz#nt+UFUwDjuY|^GA~kZPmX@A#>@27QT=VV(sHIqRXJ$XQFE<LRdBB@a
ze>xG)PlpvXy3{f#FHm2h2`OL?>-VE00mWsa=zLsv@_AG3RbkJDr<&2^oCrVfpml?f
zYu&k=k@v&Dzuibbq5*R1?ub)y0z=5>r9UU#A&J+YKbVD5*aY<ko3Rq{cM^>XRx87N
z#0*hTbjEtHkfm~s*6J|oR4kx{<!dHM`*V(by}buZo{!WX{aw=2Aiu}*ErMFyCxG;c
zy=^w|5+IY9pPk59>wogg7_%Rz9d9z<=3M)&3^Nj&=w0Lz<L#?lf!ir7Lu!Sgd43HI
zbRELh1;TdvjWy{Bk%W<SgqV4XuLP^y%h2w)gkqXk9VU}ZSm4~NF>O&>9A3+(6>f;u
zj<YkS1kLMGmPo`X3hPLi=**R`B=)jWTA4Yc7fiHg46uwX_iWx$V{heI^+m)-4q^at
zNsHK`9@kkUa(ZLa7LS;vOUTcmaYXCz=alFC>35g9f%I6M7T>;J<0bGLV3)6hDA9=&
z4k<ptzjkdA{5IMgX!g7fAN7=xB#$k7wC;137&{5}gqT%$S%n9G_o^lV${#{h8R3W$
zdL8vcR{NLwWCRUo3`hE}TU=5b%WY;cUiNwJoN9;vlg;{S8v|Z@@hW%5x*Kx0cz3@j
zf_S*@iqX!N(V%Ex>%hw>mhLO{&M=3c>u$#J>50dzhJb<iB|@Qr->}5AM0Hna$?6}^
z3Br#7;6mBqGs4!BvN5<U4^C;WyX$Rt)xz5$Tf6oym<Yxlng19tQxh<MNgwh+sGfue
zSN4@d>?Y`*b`z!<xB0dTDnIvaMS$$<mg6E4j^SweRCy_<D2jJ$6<mE=8Lw6G7b<xD
zd5F=yH^y7bVF~P|_PG*h0SAN-^?r8_(54>qDwHpEnj(7_67&TFtkL<0SG0SdV1J5!
zSa{guA*v`$V|8D1aQZN{OL?O=m%P}k=ic=u1)9H^M#JLrXiH?N1&G}10Wk6KcXRxt
zNJp==sqb|f9ogR34Iz5)j_zfgODnW&Z|JW`?_X0O%iPpW?U9!(%S=6`tJL`QUT5)j
zwy?GB{eHhg(>^@Qkg_z|yxI8l<A!*!H%!{q&%~$1o?t(z)ZojgcDk3^x>NYSB?c(J
z1S$%5;^P`bl>i%@ZLNut2r$h6*-SU(Yio=&uJXtHdeczmQaCyks!YlFY|zn6rj5}|
z^l(1M(|jrO#KuJft3{t(M;kY=Idu#s243kDEpCs#gP;^;7w3j91g(<<3b(Sn@6@*y
zQ*XbrTAG+bI8wM~or4->sc8S4RnI>wK8cMAmZ@QOYpYZ7|3jNynejEEW)OM+5z22A
z+ix$+ity+dbNZKEcb7#uYsMZ;PQX!sCojg?NYSdGL3F!dv$nIwy2SOSQZ-=eDtgE6
z(~ptIyM~lm0?3vtt_R`9nDVPAp?*I_KEXwn$Ryo4IvR)bjP#Opoyk@dHRY6ip^Al3
z9Pz#b`b)OmnHg3##C<a&Ms53rr0KaHe27WA^ShT9qNGrpP3LdNB){1hHa*mAyvAkh
zYmMqxqpqxj7Sa{1(TJRf|NN_(eE?bRC25E5!c@M2%zbet?EF0FngBJSsG#VqEFlgp
z;Ly2;<G4Jn@Tl2q5S?yav{<c>)wR)J0!8zlIEmF2h9OHc)lZ?|W)V;GhkbP?X`)g2
zLVTc4MFb~Yf5Xq7yWBeJ$9i)=NXn1XcmV(|iI&zTu;{jl8j|iqMyd5<`eRrPvT0jq
zE?TZuf=S|Lh8x8q8j`nH2Yy<-js^id{}=HAi5InKzP%exVwsEz>;s9S73=AfBW}7L
z5V7#2VBMyoNT51N;QLWZsjSU`X$Otx#K^(=zk6ik+C3jU;Yul`-fAc|s281;*?RW_
z!M*)DbzHF7$;wCI{8E)wEeMGs!;u^_#(J6R^=)p?`fTYjqOQ(_m{4?tV{oRC8JH=H
zvjvsIRP)<XfHf%vqR`|Eq2gtn#db}{(*aAz>E>__>3?n%Hq<)t#w?p`P}4cx8AP-v
zUR*zFHFs$?QTVson?maMDyVgIVnw<|)HDjSsU=jtAyVlPvNNJ74HRmA@;)Ta-n}BW
z1c+ICPZOQt`>VZmsaGVEWN3>Ys2m>ZgcB)&%QF1R&>&NN>yP7v7THsrx?MLL&jbak
zqT%8NkOxv^T_di#_f}xKzdxZPq#KRFQt}N3MW7}nr0pjSyiAfg=f3m(`b|8j7Y>p3
z`pvc{hfDAso#G%e@vdFx>Fx$4El?+LUvSxy)skw;j`l(PRyP^)5=V748Nq+uQ>TD^
zi!fMb8af7?cy@}YCfghMNTjU<sP?3vKNo1u17ur#S)YTB<Pw(+^M`n4Zk8O+;51t}
z^1k9Icm!XBR;qloOO7!w=<-YK5QbG*`Vy43hIx$Zr1-4P%iY}DR~1LiH|fmHq6@&3
z=-(ZFPGo{0Z(9NNV5fQWOp%vue&iqOs2-)g0sY10h*hw>82#Wq_AMwo#s0osaRXO^
zg!3C~0A`2Ls%=vGs~PHh72QlRY23zJ$BBnmXaL3)<}X8DtmX(=Dc~*NrKF;w4cK<~
z3;Dibf=ACdGpQOI>XAv1CUl`bYb{pa>+4Uo{Mn<vT1apaj|+|JkLYs^qN$=-djI=w
zQT{wrVN`BBtgGrdd8ju3KwrZT3AJ4rdwKA8idvPW7JBAPl$oCsl=lIOy?>KO{e^?!
zmkSb~K~xF@bDib$L01}@!QOY1`2SH7fW!SgisSC9g|o^u48eYS-L>TJ2G?94Jqe8)
z2wz#%&+iCYxo$n&?JBsp;?>o?8;GLF4$a(UgN;>b0Y*tEE7;?yvvDq9XAOknw5O%0
z6|h(9kCk{w${H`Db%lRZw+G;X@D+0=8Vj_TEil&-1*kJ;Tl8rr8ec~M$}6)Bo=bQD
zx2X+BbOd*NJ-yNt@aj3q1w~|N$m2C*N}|=6>3!IkiAW6ogMa>Ye|Gxm$@h5;u#1F!
z5SRi~6w_Yv+@hu&A9fqCN|a1wqUYAu`XKG?bni@+$ev`Jwer5=;+WPI2?RwLAn`Oe
zf6<-xwVDIF#I+FC3(_B$%&cDdZYsM(G|$9sT^}+Xbt;SXr7XC|VWQ>6X<}438E;M=
zBg4PJ#m1nDCGqBaaxd}6Qr1_8dooYVw@}hA7C!Bg`*!_osd)<egsDcDYY|tBHupj(
zNqW(n>Qp8rM`4bnPg;rt)W}1$vGOzfIh43do#^C9i|_6~V%i}ni>UZ>?YY19V9L^h
z_k4z2s_3J&>`fw`)#3L{Q#qhYy+}$0Y0L!)He%V;?n+V%+Fz>8dw_)JRhVpP!mj>s
z$uK6ov+dpdcnrHT*C{-O#vphCGee@m3o9c@TEXc}_eS;Dja3^iHS3G%z)~<pUsG)Y
ze3%<dg4&1ewRUh@>-V<T+ngBAqXKR7&;nJENbLQb@`kY=10vwnD5kYgOa_M`<PfP;
zG_Ql#LB`0rw=1uQ@*9u|co`7T^o^leB{Ty0n<-q4JlyLQ#Cx^JyvV75H;qa-(M-e|
zulbBSDLDl7SK!C!Ru#J0h_^C%2CQ27xq6Yl7TiX?UCKd*myrGjFVV5Ir8OXh3PlS9
zcmE1m2vRC-T?h}N5(!FD56}UHV4-is!y?F}5*27`p9eE`rHwN*X7c}`s;cS|`;<&Z
zChf>#p06*gj<WK%u~oJU-ovuAo8<bw?%F-5SLdx!>bu+LbIf+g>|LJ-y$>jyAB>q}
z&m+@DLhKCsgJH5Ac%^B+NZ)XTV6jNA`YY{fwhrw!!I~57C;0RRziW2G(L~3>LoiCB
zGaPoADz(G892_&4ELkb<sr|6eJ<~Kq`HPGSmXz-@r3`Rc+4V9moh*Hm1YD}Q8WHqC
zt|E_PQix9{?k=DscTecgpLufOcg4n4HvB3-t=GE6S2}fNYz`EuL3>Y*Ud+2Kk6ty`
z*x|OPBIRnD9y|wH?5EuH&aym7$4k$bY<FczX@OJcMWUwUo@ib@xJ?|J>lfB<&>oTt
z@_v<9@E9Mvj+g~of>B1nz*HTZYL;9}>9}D@_%B9f_3H=)|G%&&YW*rLPFGe63$3rE
zA+wf}L8vGG>)3Q@KZsWG9l_m<b+lr^tVPwW%R7tAn*Fq%GCdoewh5{hFMD>0$dAQv
zZ$Uhbw0EvwW#Ks^2hhge(vvLPx941(LoRn-oRxSS3CRaFR%=>SI$2y<12i)<oMt+9
zhUl)t$AY}w$Z-1N?lEdL8aLX?tMBgdW|_J6A{g-_XFMyy=pHPJXJgu5;A@K;wyaDf
z{^y${9$xA00jrBwo?_xsi^YL~C|a5Qk{uo3kkfrX<|zW$-^CrDy7vs^fqf%SWJ5#y
zgO%hg<(Lo`nnCC(rR>4)StF-#tE=>0WT1MbO9^I)cX>7B+Mbyc7|EkAxMz$mue48Z
z&|WYMJyq>zr>y66ibPtg9T^_DWT|GpX;S|K9`CWbs7LsF>!v?jW5yboiLV=AQ+Krj
z`$8!Pi*24zIwO-~VlH#<BsUHRt86oxGvvP^ySj!`8+=t{UppsJia%NHcv;IS@r-@L
z6jKHpecr~l@dyg4jJ+_L>8-%So=_Gf3&Uv#XiO|JH$L47;Cms=44hL;+9RjLFu|qX
z%zwH*o{Hk_Z@VrhxKT#)f^-Bj<G8oe#u#C&oEjHIMHkK^dFGnHfsRrccJ`C$w+-){
zLe>62L8M$8Ei1RKq1cis{-RFML^kjE^1keHj#Oj;L|ikfmYA6ts3Okx@-5AUtJpov
zyg9-6JLz;Nzq^h{OE}`3PJ}O1WOUsf>v_S6ck4x({+NYRp?s-r4*j}!gNn_g4Ei{t
zy-H{dAA^LCXS}C}nL5Wp!h|I33r}_W@!uP{7N#bv)eQ3@vDBqo{xe3iC0e~CVji>V
zR5IH^t0dAr4420~@<ChC*s5P{&BH5sK)t!UT?5tKRcI|mcHwWpD}_p(H25&hcH)ZJ
z5<9b{Erj=q7na&ZqFpYvgxy*GT5+I%7pK*%*3tQgxwR6tqMS<}-GtE?lwMn*@@Z+1
zEY3OwYNvKz_?Nsteel5;RbA4;L#(+=mC)ADIzt0#u_V>W8{yqTfaTYpTo_6V%N0s>
zxA~8oUG5R^9^UDOx&9T$O^^_W6xi$StTu#F9tm&>Mvt(t=IF4yGeZsntR#~+@(~Yb
zA&2-_Rx`Ys((>%j!nQh&B!k6Y{P-;+DWkQcbrod`vg&l`CQ_9a1Tyu6|C_Gf$K45U
zkwOLL)r8JA6zBCC>1KN65gm^NZ+riRnV0`@t6<SNxnTgRv`|dwY`$O+m*J4=6<O0S
zeyShhpmmeIgX9cEe=+G)%}BqM3}PgDnrOycOV0|fF>x^puB?b?#a{$wX6$`z;5P3$
zwU<+B6P<o~s$e<Hznqq#0L>*!5R7-xD=;J3=}{I1oJBiWcs!L~{baYC{R^kHe!O9&
zbme}M5YMyFsc&5Mv{6Igrx5*AuZqjPQNp7<L`~0Kl5ly%CrQ|Aj5;>Nm<a`|<G=B~
z{nLjr)iC{)kB}y$j9W`YM!!WgmuC1eJt4yHhCA<;6m?c<xREm7#RGfJzM;!fl`Vqf
zc{DT&=!AYy`|s{k(Rrln<2qq-rlYq{%b8v{&$rhMy)bDMU%RKScK|k{_3^Bxxp6Os
zKPnn02#Dh=w{h9Lve$R`E57ON^8G;)Gn+NLF8Wb#J2LJ{&yo;{rs3`u+t|dMLpeL1
z2BCwU4l@@)r16Pncz9IhTB^!M$)2gnd?lP-xFRd4*o{eBjlWi7k<`Qd+|OZ)#l(5<
z76$IVy0R|iV^pu(DjV}#J9W*<)~3Cc6uX2(x(b<L{ug_d3W5yiwppEl!OyQ>1h1Ax
zbQ)6(Q#LhDY&i2cXt>-1t1^nU5Zv1K|G*pD6^E-@C6^c?FN2KR?)W&eU)w2O;-)Nx
zCDrr2nSjU0BM`U?)q25^N$sPv<L}a6NO5HJt7ay2dUs1Ai&*z=)+;gCSk&=@2~$)R
zmKqD2{jqV?ifTbTqNo+>ME*C=L(r_XT4P&AX-yU_b=W1oQIFzlG#hnm+6L(9x<@a6
z0Zxoj016o%C*q+vz8=Q6bhs4y>Fs`B3Qf(GIiVR#?n<{=E-q%`T(PviwZVR|0E9ra
z+Es<#mad@@vQ?((ePt4n&6w_eqxQ(lfOaU!9*Ml2XL(tTtr7g}YtyIFEnY2wSCTi5
zheg|bKkMA7cT{tkeI9oxbjHZEDz+{@m)}82I8hU@R7eZ+`;qJ+ey9A5#}25tywiRR
zr+hjl{%GaiQ#}j%TAmGYO!4KIHgZ}GaDuMKj3esToH5Jhl!=k;@_~Y;e=d4GU1&Zu
zX$TFO>dKG0mdR53)^R;qU9_V4kUvEHCt8)6;2NL5yW~w;<WX9kqLt;Wo{o#eLT*L_
zJIs#uX32d2GEdNYzWEC+s*trWl?ly7o10x3rbaNRP$;&E1GdW4zn@`M@oq^v#5WT5
z0OJ|oyz*tU?N>dXjcAf5MoK$^a*g+(rhUmkpnT@1A`mFG=~<R;x6;B&1$;Vts)&pe
z$n!&+ir(kGPJGJn>vlu)g74>o4thBWWjJXJEvb;eeWiJsrO;dF#_Z#9PoPU4WqluT
zVvklR>I)JN+g{Gu+;@w5`h3)`pWFK>TUBH;cz2DW%rW^^hC2={4VIpHg#77p>)|^}
zr_Ky%5G{lDi&c@Z6u}`?79lV}qK*$BXbyr9eBg4@3wyZ0pY>5OU;f)`tA*zk(3m(d
z6X${>uY)?N&HU2i4ypxtMAf0CN&RhBXGFdF*NK=pzP!xJLO+B4AC%4D!y!meV#;l`
zTxiH`_x7agr_d_6FS4fiGyjLQ!=G0Pj)BjEKW`-^H;Q6ywTbKbtv)n}+QU}qv`V}+
z`c<&MUk+ymh<muwz6jPhTKE<9f@Jm&d65evy7w_Q0nse!)gZ2+G5%G9C<DzK$Qv$y
zTyK6ew$h(4ktwG{#%4`4*mpZDq;5s;!@l%iAl+}bW7U3sEOAdoMcQhPJrWd{`P4df
z7qH8fjs5sDvo!Av9-7y(OK?eS*jy(X>ZfG<99JjWR2DHsr$^su#8{=p1pVDIC1;ve
zBED&;)Gm)856{lP9SX6SM`)oI-Yk_Cg^gn?6MPCEwSHW4uOrCEvH)jEYK=!}UA7`D
zwKNHO7MWoy={Ef8*+$RX{@d;gnB(@yZsBY(T1dUIl}n~l+|BEK?KDom(nTCn`lmW_
zYJDMDXd&Zqy{LvN6NA_^hgZtM&q@X2u>bDnWNil3#{GfsFaNGhd=|r_WUqSPQU)>a
zR=#RS08U`0co^EF&wgtCmzNjj+#K0&z^fwD1Q_WxeYQVw^WDM~e3}o@wcH{+kCwha
ziFRVe)?Z%C{kou`(><#;-AC@j5dE29=|(1D{@J<)o+PF_37%!qR&uQhJk4orkoV9X
zMSfumUq?*0&qJp%n|>9SF$5w9nda@g`_R81-Uu`q9M_M{eAsZd-=wt~?V;44g(*RZ
z7kg>s@>G#<q)U&7F_OEhJ+=%9$DDx~GkPN5f3L;4UtM-{f)n9Q_Mlj=*aTK1i^L{j
z*gj+L^oz-=CelYyYW}V|>3tTI8CroozwvIg8=*D)I&m#zD>t_&3Py;pcn8zLa9ATC
zkPejkE&A#3G)+ylp_2*kkCZNa)m*J9I$$ypc=sen_dT=Ch(}?1-?tg-t4sHOW>OhG
z<Ee8DI0Xh<d?9kb2MwCaItNV6K*8y)_DhIjL~Gh*d+0_yRR%s~0exx0mk!lei4&PH
z4g$}67$<fLpH@GESOfv)@`u7yiD;*O>?^PSEG^=2L<+>Mw#&8m2aFT9v0uKCRpY*F
zn$%vfvHA03^Q8s@ZSNzQ?IHu94umq~s`&@e_tY5iQoj@!cbpSYi>bm{5dIdvIp|`C
zW%D)f=jBkGyq^2gfi$}x5Bm`LQko7lHYg(GPos7BvOOya2o57uwaQ&FqRY?SLMfVY
zQ3RA|VlQ@J2#ycd3shKh8KDh-j8_|7Kn0H>lVRpVh^XxX@pa#x=SkCdR0-q$sq#gz
z!ds5cvU(?u6*iBhBAbs{-AzQ<VYWES;-`ggxORq%(dChWJsImV*cu+&rD+v5VogrH
z-Iksol%sJ#bs@fITW-h3+z=kvbW;as%g5$Nfreej5rgZ$5#~o+Pe`}WI{OL(-}-9Y
z{w|2YA<0m4826M$BEKKR{p4kjii=K;fKsqh^+y@SjTwaHdI7GY4B!T#_wi{|c?LLH
zgKLZgKz9;G2QPaqWPF>nIax}My%$e%N>4QEUostVg#*f227|=Q>c+>t!D8^xf`c+*
zopC2p2@yKnE1W)WcrK^7@lwX@iiW}mK=J!2KDI_6u%*!*=(J+s^w2nxj&+#(?K1ho
z=)c=_=klL@{O@pXczsXNHztXdUX1s@8vUF&T~e;Hk4C{+P1L&D3hLsI{K>lVS4;Jl
ztVx&R`QOXTQ@Pl94&A9SPQ@Xa*+K;})R{?p64#y`l^dyMHXc3X6t0#gNIBLDgXDhl
z)9xq5@*3B<>~!I}?ai%J<$WHgT!ipEy8Dl7wuNOo(8IPfkWYb}L}PE(0wt_7#!&9)
z=1uaNqI!H+0Z+p(p95xBw3&VPJu?F&Tp(IffEcoP<*j%eq;y5|#H{fl%YR8j2}l1?
z3Rb8I>sj!HGBHB7>&LZcj%KHM>+P7Bd6ogH%%czXpaTSR!e56QBirSk{VIsM3|$S>
zo9W0uzHzlZiah!w(c=2fjNt1iGtSgGlr?-n)Mz=Yy#{TZ7}oijijJ@;kRZ%Btto2_
z+ekf!1+A9MPl&L<SA{_r4>Qxhy!1%!30W7N<M9y0wQb>H0g9DoJ<je}tH4a48D66=
zF(=bC3Ii8L_iCvD`;C#Q$Ew;NgVg@nw030+{OF$DSRet0^e97%m~#dXBYX6XS)`Ny
zvRA;-$&vd_J;blUw`lT<T|WjHwtOZ$%tIh5oz;z){gJ3%s|(ZaU&kaM_yr)Di&YA&
zV%-);L9fc0vFcX78dLA`;JkJ=1r&;SszMCsiLkLz3f@urdS}gI?3jo=>0{1hkyOvv
z7MTruP0aBwf|^rrtOOM@jY-x`VSE+9`6-R_wQ+y0q1&YNJ9}_;{*Gdwoeru<3f`J<
zbo32&Vu-IkKzO9oPgU_TXuwXxW$Yly1o=Jj1sS_}bISVq20?h+e}RfGsh22!59jjN
z0}*Cw-|}GjOEMfD0&=GQ;jPVNS>K|A=80#@ge^J9#}8A=_f2_+8kp_+-(aD%1ff7M
zA;!7<9F#9aT~ryiofgMZDAvxqp*M#ovNiD&gIGM#*hxHr<1OJA)iz)j5XO`h$;^7{
z3q%GBRmRpc<bqxt<k7qk;?RYa(dpBZk!ytP5pxIIe)a|NPN^#ytb$7hFIas}T8sNq
zdyn9&Aj`km(Wp#|6?sDS2FD6bIk(nz(f5yXC=L(N={eWXfGR=IlfNZSdi<y=ve**e
zgS5Bvm$Pp)hWOO4UJD53(z7V|Io%QHr#m_abcu-s;tnLvXUG@R9u*`5O_usxfQEv6
z7Dh(}9Ex1a542+!(tf(^3g>O~YR;gFBXsj4S}Cvf-`u9kPwfH*8{Wx&q^8jYPFy*k
zNp|3-7gw76)?qz^vRS(Tf9(oUAX;8>A=W|thPhU~O^8nI_5BZ?39p(Pfa(VQRwiM9
zC-=2E^fc8`MF}<7yvGK|F2_eDJFXyiPin;i?QIQ<%*7Edzy-4o#ia9E>rGF(QvE;j
z!fE`&x2QwaCxUtSTU^=NS=D8CVmD$p%E>*ydUMvLhXI(+bUIoRUXdC@1m@QM+S-7V
zCnX+L7S}j54F6ytnDuNOP6f&1iyFuOVc~FQ%*-h1q~A(+Yb2)_Xm!1csvr{<4!^_e
zsnPap$k@1FoRdO!2BhODe=*4svM2{QSUrY+rEM}Xrl`-cnEPa=r2UbB=o{`C<A@gO
z12AZYql;8S{f4MIu|;CT@D)XV;sr%z;sw$#%g@~3gVWK-0&sVaU*IJByJP#C9~J2l
z;Oo8DM|0&ZU6tM4r&i}#-2Sfk&Vg-<c(|U0l-I?x`M0C=Cu9RSJf*;6U*yMAG*5%e
z{HWfj2D>c?MTHbstaU1V%V2=n<)v{{!DrPvatti68x6{H{M@f~zkM`kTV9l}LS4FZ
zf+~fei4p|n09zEX1mPeKEyQgKzw$jKq09gm#IzW-2|QvT)-2Ak^Ob^g(vB^$8zh!~
zoD4nX!xnB3>~di|nWQoa$F~EdQiAYz3mBe|$1|STBj)a(_fTSfA63|s<?Q7CC#{|f
zvNl$w%zqamFOd1oR=|UC^{q$JDFyR)CK_GMkwywFz~FBy7UH~hQz<7~T<kCw$7RoX
z^C00ZXDo30;o<lIEq1Ivg}L{yH%IRMZkTW*mCfjb2GL<VQ-C0;(5Y)-Abvay$NX*&
zP}kzWxp%jer=CiPv`xBY{$Ro@8+E-N-5Edgk{6?8q1p6KHm0E>Oi~TtfgjHh2cO7X
zO?q3jUcheXXve~qc1ytZSFN90R;dkdg}W+$!q2bS;(lCl^xB{HkS3NR<|xodF=}t+
zPO)x5%wxQgwfnC)@y<(S!QL;1vtwlB3+}8lM+gD4+W~IU=sx4tza_zXUj3w)XOwZ-
zw_f5x_i$n7_OpFFj_rf}L)S4y1kN~g3sN%SwE*5~a0<hV)`pCHM68MLsC=3l+S-0<
zV05=eRA3(SJY#OcUyZ5#CDjDU+UTYFwto#JoW^Fl(MmYIo1<i`ryD9c(xqHY{x%x9
z;Dv`2A;97EjN)m^49(Se8Doq84#8a?Chx7gxj}|LC!mbLG<UO(maZvIzs0xJptxgd
z!<N(Apxna!<D2H;Zf-zKgWQG@wtY+a?6SzXDuo+eJ7LQ|xg~0;<X|HKRB<>Xr(}ZC
zxrdV^1J#$<Iz=`(l^Diz8c=QJGrej2atmX`c}RHD{I2a_<~kI2K1Gf_G!s4`M6`Ce
zK|~yi$qq<WE0tn|8X)E3PujDFMx438fmP7V`*}CjC@vY$h6UE|Rhvs8(Gq*87(+i5
z%hwK#tJxU0M>#WLqy;OPh4#2HuW)g!?O?E5FS3q#Hb%7oyC)TVKSQ9Ez=b=86AX@N
zb*ibSd_%5T+DC{9!n#PSligJXt%tm|AZH<v+&+K%tmw<0BL{~m<ii=D_=Ka23xAgI
z$bj^M&x+*HXW>rrfF6>{*I#ZFeQ=8;LW-$da@-C_6lm_CbJmKc`NIH%JtS*wry>1i
z-FG_@UvStjs7%v>9(Q4p$p!z72jo8Wtohyh%kzKxSsUK);2`q6uerV8Donw_hUXth
z&4@+(H|=C6XOCM1$7tN2e92VaJSKH`FBbVl#pS)2(**9BVqYFG;@ms#E8PD6LND%u
zGtcx6_u}Cb^bTVmYbh8V-ZT7Lk^ldr|7Rv*`;HK=)YL`6`38oE`)H}@saC5%BmNI=
C9d?QU

literal 0
HcmV?d00001

diff --git a/demo/documented/csg-3D/python/demo_csg-3D.py b/demo/documented/csg-3D/python/demo_csg-3D.py
new file mode 100644
index 0000000..83f9387
--- /dev/null
+++ b/demo/documented/csg-3D/python/demo_csg-3D.py
@@ -0,0 +1,50 @@
+# Copyright (C) 2012 Benjamin Kehlet
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-11-12
+# Last changed: 2012-11-13
+# Begin demo
+
+from dolfin import *
+
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+
+# Define 3D geometry
+box = Box(0, 0, 0, 1, 1, 1)
+sphere = Sphere(Point(0, 0, 0), 0.3)
+cone = Cone(Point(0, 0, -1), Point(0, 0, 1), 1., .5)
+
+g3d = box + cone - sphere
+
+# Test printing
+info("\nCompact output of 3D geometry:")
+info(g3d)
+info("\nVerbose output of 3D geometry:")
+info(g3d, True)
+
+# Plot geometry
+plot(g3d, "3D geometry (surface)")
+
+# Generate and plot mesh
+mesh3d = Mesh(g3d, 32)
+info(mesh3d)
+plot(mesh3d, "3D mesh")
+
+interactive()
diff --git a/demo/documented/csg-3D/python/documentation.rst b/demo/documented/csg-3D/python/documentation.rst
new file mode 100644
index 0000000..f4cc429
--- /dev/null
+++ b/demo/documented/csg-3D/python/documentation.rst
@@ -0,0 +1,112 @@
+.. Documentation for the csg 3D demo from DOLFIN.
+
+.. _demo_pde_csg_3D_python_documentation:
+
+Create CSG 3D-geometry
+======================
+
+This demo is implemented in a single Python file,
+:download:`demo_csg-3D.py`, and demonstrates usage of 3D geometries in
+DOLFIN.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through how to make 3-dimensional geometries and
+meshes in DOLFIN, as implemented in :download:`demo_csg-3D.py`.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+	from dolfin import *
+
+Then we check if CGAL is installed, as it is needed to run this demo:
+
+.. code-block:: python
+
+	if not has_cgal():
+		print "DOLFIN must be compiled with CGAL to run this demo."
+		exit(0)
+
+Now we define 3D geometries. We start with defining a box by sending
+the coordinates of two opposite corners as arguments to the class
+:py:class:`Box <dolfin.cpp.mesh.Box>`.
+
+.. code-block:: python
+
+	box = Box(0, 0, 0, 1, 1, 1)
+
+We create a sphere by sending the center and radius to
+:py:class:`Sphere <dolfin.cpp.mesh.Sphere>`. The center :math:`(x_0,
+y_0, z_0)` is represented by an instance of :py:class:`Point
+<dolfin.cpp.mesh.Point>`.
+
+.. code-block:: python
+
+	sphere = Sphere(Point(0, 0, 0), 0.3)
+
+We define a :py:class:`Cone <dolfin.cpp.mesh.Cone>` by four arguments,
+the center at one end :py:class:`Point <dolfin.cpp.mesh.Point>`
+(:math:`x_1,y_1,z_1`), the center at the other end :py:class:`Point
+<dolfin.cpp.mesh.Point>` (:math:`x_2,y_2,z_2`), and the radii at these
+points.
+
+.. code-block:: python
+
+	cone = Cone(Point(0, 0, -1), Point(0, 0, 1), 1., .5)
+
+Now we have some geometries that we can play with:
+
+.. code-block:: python
+
+	g3d = box + cone - sphere
+
+This simple line makes a geometry of the union of the box and the
+cone, from which the sphere is subtracted.
+
+To get information about our new geometry we use the function
+:py:func:`info <dolfin.cpp.common.info>`. This function takes a string
+or a DOLFIN object as argument, and optionally we can give a second
+argument to indicate whether verbose object data should be printed. If
+the second argument is False (which is default), a one-line summary is
+printed. If True, verbose and sometimes very exhaustive object data
+are printed.
+
+.. code-block:: python
+
+	# Test printing
+	info("\nCompact output of 3D geometry:")
+	info(g3d)
+	info("\nVerbose output of 3D geometry:")
+	info(g3d, True)
+
+To visualize our geometry we :py:meth:`plot
+<dolfin.cpp.io.VTKPlotter.plot>` it:
+
+.. code-block:: python
+
+	plot(g3d, "3D geometry (surface)")
+
+The second argument is optional and it specifies title of the plot.
+
+Finally, we generate a mesh using :py:class:`Mesh <dolfin.cpp.mesh.Mesh>` and plot it.
+
+.. code-block:: python
+
+	mesh3d = Mesh(g3d, 32)
+	info(mesh3d)
+	plot(mesh3d, "3D mesh")
+
+Note that when we create a mesh from a CSG geometry, the resolution
+must be specified as a second argument to the :py:class:`Mesh
+<dolfin.cpp.mesh.Mesh>` constructor.
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_csg-3D.py
+   :start-after: # Begin demo
diff --git a/demo/documented/eigenvalue/box_with_dent.xml.gz b/demo/documented/eigenvalue/box_with_dent.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..3b2011d4d7168050558f5bec0055641e94f529fb
GIT binary patch
literal 8836
zcmZXZbyOQ$w8oJDL5c(@TATvKNpXsMDOM<2Bv7Piao6CG;_gta6nA%binq8HC=y&>
zxc9#I&s#HVC6oO2x4*s5%sDd&bp#OU#hIcS5^ChkaCjgWk>6UY3PDvl`9`fpa~e~!
zyPw1~Uv_0tWSxpwYy*(eBQ}cp8rV+BdG1W%amrMn11rg4i)0}vc_Cc<_u2jRgHXbm
z2WCJM#ci5~>D*`0w1{BQ#4UGNuJgz4G}Wq%?k`PpX1uvce$gKI@W7hfqold_ubl{n
z&u;O5zka1CB=|bss($zlB<4r*Alpi_(&?GD;B1d<{-2)NiPkS-Jc<T4cR$AS@RBVl
ztwvtM#5Mp2kw&(M2R$qu@{Z`K1nGLCV-##ivMwCF%6F-(ela-D^%luSNhjtzM)4bW
zHah+L6xH80H-ob)LEwR()y+uctSsz@f6M%26+z(Pk#b>Uag!qxh~?$dFajN6a~%JR
zV^PXbU(@`Aa#yp7G_z(`s_0r<n)92B(=+}WsXE)=rbHmMHO<1PPe`dqGj?`m?9|lX
zzgQOe3~zkmcExtGCOqo>NznsH7h~HJfBKpv>2o0=+dgpFuM-ElI(UxDo}Nz6G1Pw@
z+;NECpjfPfcb3-U)!6LB>DY-`L<Br9S7>Y%uCe*raCLqGtve*vYFu8PsLODzTNeHI
z#b;vHnw>+n@!r{DiRugEpF>QWC05@J53jhTn~*!IT)f!DGnw~kKD(xqg*o2us?DBu
z6{5nupy1c7YC#2JPMLdw4q)#|NCEX9#WR~-#%VU1r=2hX;*le)bkzR94PoNPK~W<D
zyhkzXjPr%yW^X1QF~Z7I9#`t?+tGUs^$hQ%THjK8P~PYh)zyr$*?`~THGS|<FPVzC
zh+qDhfA*GI(U<aWJ*1P``E`T#-DajwteCaWY3D9eR;kZv?*Y@wfseyijKNka1~Dby
zlUvAb+)AYHX~?;XX!7G`+`UR0Q2g{Aa_sGy(%&WUH8;vu)-YCn`=Iz~2rdIPl;%1g
zFi658-)1S{ki|aeU4OT2*mp3G4nZ{Dh_h^!B{YBD*W{>UfgF1$j?>;1E`b{<hCS)E
z)k#ydgVG-57^u~z2G|OtW9B51aL)q{;e}^=sRB0A=*v#U#p5{v(t@t~Ta*q7OySur
zs(`I1I%YBEfKv&A$Q?WxRVu{WUb-UR1*92AfJP?bNRl9)KRo*`8#sg^!}TyCcb<TO
z5X=D%HPW#7rbPc_3Xkr?mQh_spn-JEJ1n1DuESs95lLK25}e+^E&FAWpfp6%dLW6O
z2a0AC7h5=gu<bEH=GFT7c^66fT{iy^g^a2X!tqmdzL{4;G0Ri5EJ6H#218_2SJ(n>
zBIuZ@i6jJfNH@NEMxKfj#M>dt%LNW0a{K&SMmvI%AXvPTB3LXVdmf%Gg7_Gr{a+Dq
zQ5iuzjd(+ZHlh~la3hibk2I}i`9>~QKI`VfL7PmljsXqcle`Uo-AR^ohW8mS`ytJ7
z`JbMR(iKrZ@4Rb5BtZ1$sTrvM<Z*b2WZju-_^)SAUH?)E{9{Ly6Zte2h_r+<s!xN1
zA){)5=og|!yl|sCN7ErOLltGT1V`4QC(nqXTlu$}Pf>^wd}_S2>COF(&wNU;FKKEq
zqCrok|2HoGbzg$uPj5rxmJm*txRXNf%a;5y*8TSSiwSf|>$VaNN)c}G5MEtbMeq_y
z=c4x)g+YCv_HU*fUoSbk?Cx)8LNJc+$OLu+0lWt2m>h77B+CHsE?yXcaw3-b9p$fK
zNy{Kv89a(DVh`q2>(}G~)lpQeuUU1iU;mh>2{Mz>nJl%?tXZ%iD><cUShRSds==;j
z@g4yX+k`*pO<YK8cb?kCtD&bA_;W~=>ys9I7Rd8kJVtl74X!L%w^1L%^~O1?7qD4B
zCUFj2E5-am$D|TZ?PeODuBw*emYTYAQjxaH`18|lcvbsow<9!uKve5qxk^yUt2~R(
zom532z*g2Uw<T*7j=Ivi56IZ)DJ=G-!n+MKko@@X7p{-A?i#Z92R)hap3BwxcWt+L
z*T$P6G1M-n-RJ%xzV0s`#QH{Q<cw+10}LU*TqH$%AHT{Mwa`6Z7(-Pw5!6%?*gU__
z7~pS*Rf=_EKZ?RR#-3$Hh~D03^|$Y4-SBSn-?O5x?Cih%>MJ4kv>D&18600x6!^}p
z@?Pv*wV7gPKIGo>-UA;49&-Ec3Vh#Stn3`|yWe5og#AtOF})e=w==k6o%Sv3JleU}
zX}jMzCB83SVR$FD@Zj9upS*IG<-YwmW{8L&ybtw}7UQ|!bm`nES9)y3^NG3_q<ZYR
zXT2eO7&?o)V!DY#WO($zX&Wz36L|<j(7DtpKCd{gF6Pb*$-Vv$e|z_CTBX+atngmM
zH}%1a!t2ua*XEMgjl$D5t@4J`4FUMRFgNI*&swYZdAvP$W#ZiMes3$wkJC+q|FIa>
z*>}r1`<2Qzsse_4oG&FLZ;<ch%XQ;_E=D>!Eu{nSq&Kyb8;6=tn_8jkhD>25Dy!-m
zLrMh8WV|RB@=hm?!4$1ZOEJH_zlq!od7HyGmz9nvgy=2OuiAJj?MQr{Uo&muwMoG*
zBaSrP1>w!*@jG+BT+_82$_sAMXO-=bh%O}uTQk5rpNQSDuLF-J?)KL`WtI)heJ&IJ
z+|4?yEQmB-Zr^v`W<susFAWA;>wMPqVv<%pJ6$b&TCWTesGrEwJMd-3Xj~zz(QegS
zg}eQRU*q&wrSqC+lwo<a*cI+@`(p29$(`f2t6}k2yXd{=dox*n{6H?8k9$}Ox)+8A
zKGylF(bLEfV~t+#t6pJ8gPw63I~rfg+qoEOj#Kk1<K+l=%y|1LOysfk(lFEa^m>r>
z)1%3_u;YW;_y_>^p=J%$34K5nWlmzX46CNMD?nsXQjE(`r=to@^6fpYm&zL=;Pt%9
zfjEvJgbSZOC-cDf(x5|5b5)0pZ8eWQ67^aWZQgAHW%8RB2HTqt7bz$u!bT^P1hW30
z@U43_;GKUq80|IDtUJYe!p=+3#EuPhXsXcm4Udovb87?rJ{xKKlhUzh&(W$&YBC>)
z8=$l@PdFr573W8)PG8}$tJxdThP<-Z-CpewdR98EI$XMCz%SJx+H%P3MfFeve2h<v
z!0h3|k<x1NN;qhr?<7d8=3*ujFCh#c`M&!|9l3D4|3R$#xUwFq7#*%;({1H0ZA|U6
z^2c?e9JsD-JA)A;pzI;ho25z3_uw-#H{YV}h?zk7<C}+X+fPEQ4Jgylk4~DzvY6i5
z&Jklu7qqHt^cOiT<ZLB|#cfcm@j6G;EO9a?6iE78>1JML>7QUwBVUnV?8c^;hL;}3
zx|~HhdWNF*EAAZiny<e)n4;04y#m6(jaj6gnXG}WMWZbvTu;Ios_K_LU%9BBm13Q|
zN-R+-dMBW0yGkgJ8elTNWB-f%b?!dZo<7AH<+w4c8oS26)E#gfJq}Cf)$2LCAKomy
zc@&`%q`_rQH4_cDoGzFCF%`Lvq<)0}&9GnnV&a>A%%}`>{raURACQl5wUz6Mk>lye
zr?_{Je|`Q&s>9w===Zj!)Z$&k%*8K3BTXaZ*cfgMEL~zQ22(>%#Y;aXmA%y$4O@z8
zRk{|1NTKP(jhMF$2cyW}Q80jm1IbCD%~%$os;oEPJUbE!okogrZpHs5KL7h(oJ58-
zoY1zmcL0H6M@L2q&T^OdMMvK+yl=vwL5L>pCbG5;em15=VOEx&gFz<p_;dKkLnLCB
z^TC!7JS+ROgms1sl-+0E$ljdUAw)*VQbMa*p|4g4M{S7UR5J>j&#vHiDsbVePro8<
zY0!;Ho2Cd-^A>z7Z#(5rFc+}3UC8}Q<@DAlZT;w6nuUbpagkJ3S7|Z6akxwn0<+6o
zx3GH9RuXltI#kARm;;`7P(9Zi+mn^2YnZ{zbvZu7jeRjN-oV@?I`U@&tA!*~c%%y>
z90eJc4L~7c#Lyf&qXRGxWz!ZM(liB{V*FX-WF88u&}s~3J=RzKdxmA`mzz$e3Sh6`
z=VsCz+mh9mb~G;xTkKqV!62+UUMQg!d!rk~f)sv=;WW+ag&Yn_0_q~AC2I%{M{$Mi
znK6Ygc1}N`Vw(QB>A+j@;yo-cPHk8BAWm_$fBn96*rK$B(v>v}safOtM5g&a>*B&k
z)yh@4UAr{I$yt}P(>*|AYc3%l=}meIlXJDNKs{GLmG?)w(fwQ2(XiIEN8E;-s6OsT
zXMx-jrjX#+M1Z^Av=El-g8y5h0+n|cS)&*zkb$SQ>fY_lUw-_|o)~BkU_q(^QD`dj
zqf89thmh6<PQCyLt72fUD#~>1QI>W1bUPPnU7_zPzCjJoMzbGvR^QUMh05rY5Ljc3
z|D~DtCol9b(*UH8l_BjadOdiA&Uo4lxswNHe7{^S)hQ+qMJ@+ir0`DkNWyd44v^Rq
z0*309D_!x5U@Js_lE{I>cHyImKt+j;Gw*VF=2EL5JDg%aejdTT3dX9pTzoTFNbC~C
zr!CsN<Jjttj0W-P*jQ+^K$&_|<!SRr3QwFCE5@$cXOu+wMR}67uhYn8J^R|ZntM*q
z_N(ZiOfRh^Q~@uMkF!Z|CKTU+m*dumKL<=ub_R5imQ}D~FMeWFKO(aTozTwr`DhO1
zGU<8_kP>fmQj*3_Z>V{lmyT2Zo)F*+z(xri?Hco8PEL?-HqREZV$*Er5Rr6y!ez3B
zPJYuR3&zBloyD!qd=B7xQs2|tEj>RAi?l+IRI;lyVz*ujkQ{XT4<})3kelrS4!J1@
z&y`|IKFMnlEG=iNf)fYGgNMMXne>T2g4iomcga-d1G0e{OdQfyg;nqH)45fGwaU_w
z6sCW}tLKGq>hPp!KYySj=kke9*TX_goT%kL8@@XK^{u?$6Nu7_cJ!CPMW-iXAiZN-
zY73kz(B+P-c}Yk`#}EJ^z=dd-Nb?7qrGx4F%h9?LfV2Vc87TM$Z2D;Wg*FUS>W}d2
ziZco5TLz&az#y8oFSw99mxwytQ427=TqRlnqh#nR(cl<JGM#&%cFgF_*CX+|!EI1L
zx{_OHG_Wo%ko25!vOSlqJ!Ngqx(XYh0>$rSiDhR72$|p;emXD}TF7rAd9kfrgxcvn
zlmE9zh{{`@U07OEp*rrsXe@fIwRAmM^J=&tRXW`r|8Hn5&&Ca3i3$G9m}Cc`%E`qN
zsMDqG$6qz7{PArZGVkvtG}{s~D+Y8L)3_4jq)=hV2eV)M*XEo5JCpDNES?tFu`o#i
zL2T{u_yD$g!NAX?#&BEJ3-KKCHBkF+%Pf$y*3!Vp8V>124a<juibC;;kR}!S2D#$}
zTd9p!j2W)3m%G_lC*PQ5ivT6mo{B%cn`I{+Xws3p^WV{?bmfazSgJGobpc`alXbz%
zfh82iWRBT@Qv}}ta4Afeg>X^xRyhiw21oJrrm<KP0WVT>a2)8lGwoe??^M#f%Uvz|
zC?Cp4AIza|ja*?M=WjNqoA&59(|kc@Skow-FN1SPvFLrO%j^1@5N;%Q$_`Cf!U;J1
ze-|_U`Meamg<#V@VrfWcSLo2pcZS3=M_!G#Es;CmmAH&18!C=*g-DV@JGD~R?SDN&
zj<je|Yg@2idzlW-YTOplSQ4W_->y21L7Z!!@whsgu?X5I<=he#d;-pfhvYMh-<cWO
zM4ek}phC;Kre0wI6U0B5>XzD40E{OUZ)=+0^fsy(_ZC!Tib;GRqVcKL)7$XiE5Vg~
z^D>vtPzHGoB#_~XOlE`ccHv3gee=H58|%9iS6X=KfW-0mBCX9csLXbznd$H-IZm(M
zNZ&xFUJFXfHRibiOABRhTIk7;(Z|q$9%hU1>z&tHR6X~fCn}P%##~dsv*)H1nD&(Z
zR>h~#jPlDNztVL}M>DIFVT<^gogD6VtrNQH)6FS^!J1BFCyt$d-5yG<<sKE$UPABt
zbkzX3fq-(NIn(OK$KDH*-RJA_OeD-iJ?^h(QBOdi1bN^NF(;>h8jk=Q9*s%J=7hFX
z8)lc{RdS5buaw1<OMK-6wm?P30;kj|9zfFjf`e4$kGkD<BIz7tI7tOWNy_Hrw1Q>v
zhpOqa!1k=%7q#CkRXi<s9C6lq%6MutPTv;Fu}kH?z|3jS{^oK=%Ht{z<KW#)q9NKd
zdGqR9VZS&2(uvhTuF=#G(tAN3Zyn4qMFwcSq|?61n|15INbAB3{mJB0gwO<|H?K|#
z;kL|+WC%~CNycVLLq|H2xggB79*CM0<L8DVVZYKBvGniI_I@w|Sv%>aEG2}G!g4d*
z@z#1^Jo8?FG~Xe_2?D`KoFJec!6V<w%ZMg%uU>2~OEAwA{u*^YHLYqFZISj@tKjY0
zp=bhH_m)9gm4F7&$~B9%Wl?R)L8&M3l?zo!y7hfQtuxe`5r?iw+b*vySmO@U0GW<p
zef-KLcoRPgA3ETV&1N0cc4jK~mv-k@kU!H$Sxy$$;$Pbw-3k;kZq>=I^Qo#!t~Re<
zsj;)V=Yif0TB!~wy4+C<mtsvio-Vq~m-xOLWL;XrFV`MDu}M5UOXkT2#7UL)<br%V
zuhqJ61J@o#>oy+exrd^kcy0Jpd`r~}T#4QbqLmK|xUqAD2}a@a31`m}iWnIW2yf^A
zm|%GCut>dLv^@G+<@m;!CfN8`@rTJy<s;;tn2asp7g`TfTyrLuX32{LWN(~Q%!Nrh
zfl7lznl?*eH872Qh1ySs>R4_3u$yBkPfBUZXD;8_tFjse4hP<v;*K&rjP}A_HhLzh
zE=rImxJ<lEBB_%3&G8xZoq;b*`i-AO!du}>7TE9SC*~Z=!hdYOx-_Q$n<1{tx#qAm
z6<H$SUEa%ugq{zKYFnMKy2hHo@_=dLuyHU+;fr(8FwRlvfdxVOyv&+M?P25-{v+?@
zi6SITUPB{{MmT9R5zH^W4JOeOp6bg@iGINzK-kQppH-Lf9-KXit{%JEL=`<x3p(Ej
z3es9^q`MSbRNRzXAlu@?3FJCcVvT%x**<?^0+yh!#uiz_sy!(cG#qd~>y4*px6$@|
z`3@FrZ{iA`a}+!>V{m;(f6k!BRJk3YnN`>Sk=7}%=qHu<>?BDcCFTP0)RsID%vp2(
zm~53cWV{{pc|5&mJ5Jvjv>(T8I5NVzwF)M81oF*Vq?Rt;MU$);n~au>;`zuXXc}*S
zYVl2Y)+3Nrgzjj*o#3#DhpRhQ5;uVmcJ?scKBw8qluUMCK-~2@e;FJ3E~O5G+MBGr
z8zYx0mGtN+p<SlA%ifUrfi<3yqBW%RDAiE;1xH&mCLIj_6P+$C*-$C4xk^pX`2ovf
zpbTHXC#FpsA;$=fTRkrtn#f2Yp|yDK=I13Kj7k`6ObRU1;8#!o+pe9HO?btf<>W7g
zLa-*1UWfnkB9=r5|1#$#Tz#Mg&lqAA1;G&KTBU82gp?jZ@C4D+?Zk1Am1C()4StVN
z<HO2ZFAf{<cvG|@y@mJ6GG}{cXQKUCkQV$xa4h9~1l$HZe?VQi>-;RgHc(9|i-bUH
z=uheirx;U`B%46k#bNC5u?})Sw+^XotjVh-DGq;C1$Is*O%<MU+Z`_)T6p+;--@zE
zlBogKo+2AG><4eS1QMoy2qmlZh8-T}zqH;zv<I#+WZdTN5a6P){VlqzM>1J^)`FcA
z3ZOdGp(Xd#1Ey$673I$s#Z@q+kVG4jAQlwnAP9b_zm`XB-{P&|fwv%bv-}^lVCj55
zfCF%?Z_MWYF!)e<N0T<E2hrYrvQIjGUr_MWf`8sDNy++Wo4zryP5<a*U|g6Xr9FLb
zvv0@m#w1jZg~^C3xl_w$$@u}D^wn`RtJF`2k;~{0G|W0*lPGLRGPLIRcB0!xdw;HQ
zOofkOhu&CnJkLl1&Z#Kp*~Y3k8JLR4%V#Bwlu9#_s9?KCWSmERYU+^OZTZa62aBl5
zg@=P#TtuK0dR@GhKbIOE(WNoHE48MoK~cFq_qr4A$h1*a{j0PlX%XEp&z9Ymb*1nZ
zcx!zyP}!2Xu-%v+a}H;n;%<v-E)(k)iqomAN^p}uDb#pZ5kpIT9`U%czD0zcg2pBm
zkCMo^2ncaB{}^#*!l6v*>Ne@Vl?sHB7()y(=f-)*ipcPp&U%*>G?+}n30+U};EL(3
z{in)-Bq{y+=>mU`bKyh01eC0jJG=$Z{f6EgI34Obv~6B^Z)Q+?y~o?n$snwo8opRN
z;5gD7w&CI_RIX3hc|xaj5NrRY{L6AG@)t?NgN%_s45I5jABXo^K<49^NBr6ZLY$+$
ztMl@2cY;FK-D2KUo)in@t9^z4_}9+h`wVG9CR@*ZxFq!TkRGl91FTV?jGjG1t1N8w
z37=%pzqCr%1RKd4T4zkSuQ4<UTw}iz8$z57#-zbH<|X`T+Ycm5;|xg_63b{*AGltZ
z6x~obgi(sm@2}E+IqPNb&%gwiixS3c(EggocYKo+*Nm~r!0WO*(juS`#_5uAF*x#l
z>-a;o$$<A0Et!}ew&;a{m@RBCLK@48Da{P7?iE$k;R=wfd?(OOM2dSY<ucYbzAYOy
zS?!XSmQL14%Y?%+U)DKN+3}kc_ni6%hy>EmR5$M&6SzE)o|CdA-7^c?M(WT-yvhXT
zj3Km`tdE9lYxZ9W>w^us;p+0kmH4&?><(qzo3&C54^-mI!hkjbRd@Wd@wQ}lWYF%r
zD~ztFkA(>SErJIPn1HZ5`*LSRj~Ugn1&on&D4s4a<L#N~BL-^4F&Z=oX|TVYuJb<M
z<Kui41`A{Ez;%aFpe3FZdL$K1?cv)ot1`y}DYwd@rL+gxR~HHCNfK0X(m>9{FwbK~
z0&Qgr@iDaZn`UH|K#N$qO~vTpS;0%%rumI`zVtJ<ietkxUll;oV-bx{^nA0OxF~kd
zxhpD4pasagNG^b~Zmbq>vNzN2hN5^=%fSFWCC)UIqpkt=Ae{HC@p<U}5&9+{kjXd}
zrP$Zd!N4)2@>vXA9cAT=Uwx*0vjyignL*O2@-FHWAzo`C4*SQ-by>7t-0@C=?iJ$>
z@7(o)lvCxC9pZ<7?a)C<h8aY!Vu1&`uW3yD8y?1@+u=8AF2RCCfiyU6QyuS49!Naf
zi_kM!3|8NAzbv)<fC^Cba<4SFgN;~4P5-6!F?pwaQeRcq4jW;W;A13O=bzm_nR#ST
zKdNOGZ$lb9aYddY{3itVPYC?Cl)cFk%fpA+ySW&5#(@H;M6|oRX4_4c^s79a7$gFs
zzj`0TUIOEd+$)2ga)AHR9!-)g73u1l8u-mOT=WjKv_z?9F*T{p%FV~Pcgn95BUe{}
zuoZh^5z9h~CFP3nvQ;PTKuav=a-Z=qcFLSkoHd*Uz|WVq|ADGdhCZy2z&bIZMIy{C
z>Y)JYtxE&f-MCs-W0ATUB(dA5*a{l4%1|H=LD)3snKN`xCyQdpR7f88WfbchI}i59
z5AI}5=y+3wxaSB8gk&I|_I(kP$T#eWY<QQO|6L5>Ibk0BRl4`l!MGDC-AO_O9;LH;
z4m<$3VL_lI|ESjBW1apTLm^UWz*x93EiNW7y(olQsJv^T&|67w^M0ro1J=|s;Xad!
z4<nM;sTI5Mh3-3jnQ*6-hj>W_A2OuI#Yiasq{h$CT04N7`WAHK>lijR*qi3d>}Xm^
z3g`la`Iz<bD0cQFKzT$Ci^|K}rke~*e{^7D*aGr-UmEFlTbN0x1^$Rg{4ejK-jK;R
zc3??lLhP`h{K1jOA%@UdBp3dQvIWalZ?nMu1vJlvO{iR#uxpZTzA~cg{L_XhUaXGy
zNmdnD$e%RWcvtDmw9qnQS{2AAx()Ec7Ab{TXsCS?3<Ja0X8>Q46cPg>=|T!o?4%Ah
zBMcq%CCW~f!YQAv^)2`6UvB+ckUwn-a$AfOv5Y0?CHd~+Yrb8(b*xdb80~!8%P9x~
zZKY_WmD7y0*sFC6>&t23g3HhI6=cttDqjzV@`Qc9aWym0!&O1^2J$DCM-K2AYMu*&
z%R{Z<lWRsLzn5d&$(nASy}%8YbbJ5ter$ww_9QScvHFzZtXFSLBU)g%u?gSI;0vr>
zQ!@_?FNtQClf-e5jR7wqR<+M}KWMAPkI|(WgNmDc<hIXa!H*&KCWoZH-%Df>hp1Id
zF^DM*SMVxsV8UwB&x`*;YJu#xDzKZ&{+paG5b+D?Z4(i%v@MB1W9$rFsQ{-utep`$
zvX6$zsQ<O3Y-O;;puh2gc5U9EZ>6MUQje8ZDhvuWahFYD;PGI8PP2nEcv2s%j|ozA
z<I(uo&acwnc!{9DN4C#kq1vfnk|`49hnQR!4>QE5&9x&5nj!Rgdq52F_G;g66pw6z
zD+G)%K(N-~D?LqK53#ocs&uq#+M?{cwOmi~qEZfs3S9%BAS%vUrOw+pn8^}852vut
zr@J2|<QXITs66rVK-j000B!}-GhH_E#ee*q0WcXw3_hm>#JRV^rY~s)E-H8)K4?ZM
zZ=WNRDKY^1tCTvEp9&DAK|Hb01VKmvxmur<a`)~zFRmlFWnvU&gZfGHT}VIEZAL{?
z`o0ep#avh9YMK9pRluH*cZq*AuhzF>t(j-ZNvnq$<kk;~TvwqZ+b89rXXsy{%>6$&
zaYzRNYqM|I)s;-1u_NHXWY^NKYB-z+wE})MKugv|FWeZw7e-Qp10J+$D%yFgFQ{bS
zI4`c!bam4R=*DX~Ww#mEx0~enhZ1E|b<X_Cq+vFqJmo*6V>vU4P7554VZ8>}xH>9(
z5w3#PZa)&o7?!-SB>ENk<~;P3zfw&kxEYKjL>2*(SiIsZRIp7AvJfE|8>G44IG497
z)@s=@6kdf$wU{ub>_6sFo9wtC{&no`NPt{39=2<@E0NIQd`4bZc79KYGL@>li3<cB
zL@*96xPJugOXrHNSHo|n1;^*%sW8dVH=f*1rr)BJ!L%=41Q0G&<1QA>rZl1k0B#}g
zs(8Yl(W#NNSHqiVE%F=_r0y0X%3(Jr;n^wCFsu_iCKuJlx?GqqyQ_G#kzuI<TiiSY
zNQ*YZX{`RLr63QVC$shH4-PSp<;(m$DSHT0!oJ$<!hhQ9DLv0)pjenwoj*Fh(;j+W
ztbec8kk3O1<93F9)F{)^Dct$TH}Bv8LmfEmMh@LB&dHuN)M3Em0`mQXu3eg$q>vDR
z>7sw0EFV$5_;KdAK%&B{z(Mm==<{C}(T`Gl5{i?c{5;O?GVWvvqZRQoLH$Bq42EQq
zW(A8Hg-}|B3mURNK<Ugqp!n`oL@lharW9Q6sFDrCn<N~r8zU+Q>tOt3(CAh$OM`Yq
zv{I94n;T%MQ6!iPq2RZjtyjaaiz}FluBoKW4NiY_XX(GMfsM5|)G8>7U@kDA#S!7D
qXT$XKz>>O6cCFOyGH=Td-Pokw?iU`7U-EciAa&~yWh&tyBmEDo5!Jc?

literal 0
HcmV?d00001

diff --git a/demo/documented/eigenvalue/common.txt b/demo/documented/eigenvalue/common.txt
new file mode 100644
index 0000000..ef46c57
--- /dev/null
+++ b/demo/documented/eigenvalue/common.txt
@@ -0,0 +1,40 @@
+
+This demo illustrates how to:
+
+* Load a mesh from a file
+* Solve an eigenvalue problem
+* Use a specific linear algebra backend (PETSc)
+* Initialize a finite element function with a coefficient vector
+
+Problem definition
+------------------
+
+Sometimes one wants to solve an eigenvalue problem such as this one:
+find the eigenvalues :math:`\lambda \in \mathbb{R}` and the
+corresponding eigenvectors :math:`x \in \mathbb{R}^n` such that
+
+.. math::
+
+   A x = \lambda x.
+
+In the finite element world, the matrix :math:`A` often originates
+from some partial differential operator. For instance, :math:`A` can
+be the stiffness matrix corresponding to this bilinear form:
+
+.. math::
+
+   a(u, v) = \int_{\Omega} \nabla u \cdot \nabla v \ {\rm d} x.
+
+Here, we will let the space :math:`V` (of dimension :math:`n`) consist
+of continuous piecewise linear polynomials defined relative to some
+mesh (Lagrange finite elements). For this example, we will consider a
+3-D mesh of tetrahedra generated elsewhere.
+
+With the above input the first eigenfunction will look as follows:
+
+.. image:: ../eigenvalue_x.png
+    :scale: 75
+    :align: center
+
+In the following, we show how this eigenvalue problem can be solved.
+
diff --git a/demo/documented/eigenvalue/cpp/CMakeLists.txt b/demo/documented/eigenvalue/cpp/CMakeLists.txt
new file mode 100644
index 0000000..91ec045
--- /dev/null
+++ b/demo/documented/eigenvalue/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_eigenvalue)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/eigenvalue/cpp/StiffnessMatrix.h b/demo/documented/eigenvalue/cpp/StiffnessMatrix.h
new file mode 100644
index 0000000..2ba6154
--- /dev/null
+++ b/demo/documented/eigenvalue/cpp/StiffnessMatrix.h
@@ -0,0 +1,2051 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __STIFFNESSMATRIX_H
+#define __STIFFNESSMATRIX_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class stiffnessmatrix_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stiffnessmatrix_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stiffnessmatrix_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stiffnessmatrix_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stiffnessmatrix_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 28
+    // Total number of operations (multiply-add pairs):                  58
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1 + 0.166666666666667*G0_0_2 + 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1 + 0.166666666666667*G0_1_2 + 0.166666666666667*G0_2_0 + 0.166666666666667*G0_2_1 + 0.166666666666667*G0_2_2;
+    A[1] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_1_0 - 0.166666666666667*G0_2_0;
+    A[2] = -0.166666666666667*G0_0_1 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_2_1;
+    A[3] = -0.166666666666667*G0_0_2 - 0.166666666666667*G0_1_2 - 0.166666666666667*G0_2_2;
+    A[4] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_0_1 - 0.166666666666667*G0_0_2;
+    A[5] = 0.166666666666667*G0_0_0;
+    A[6] = 0.166666666666667*G0_0_1;
+    A[7] = 0.166666666666667*G0_0_2;
+    A[8] = -0.166666666666667*G0_1_0 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_1_2;
+    A[9] = 0.166666666666667*G0_1_0;
+    A[10] = 0.166666666666667*G0_1_1;
+    A[11] = 0.166666666666667*G0_1_2;
+    A[12] = -0.166666666666667*G0_2_0 - 0.166666666666667*G0_2_1 - 0.166666666666667*G0_2_2;
+    A[13] = 0.166666666666667*G0_2_0;
+    A[14] = 0.166666666666667*G0_2_1;
+    A[15] = 0.166666666666667*G0_2_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stiffnessmatrix_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "485ee4abc20119b82968409dcd30845bbd75cf8eb2d37865cd36ae609240e0096d0047eeab6075652c6e4268052caed39792496313b48a8a3cb2824bcd9e32aa";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stiffnessmatrix_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new stiffnessmatrix_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stiffnessmatrix_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new stiffnessmatrix_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stiffnessmatrix_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace StiffnessMatrix
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stiffnessmatrix_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stiffnessmatrix_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/eigenvalue/cpp/StiffnessMatrix.ufl b/demo/documented/eigenvalue/cpp/StiffnessMatrix.ufl
new file mode 100644
index 0000000..952dd70
--- /dev/null
+++ b/demo/documented/eigenvalue/cpp/StiffnessMatrix.ufl
@@ -0,0 +1,28 @@
+# Copyright (c) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005-06-05
+# Last changed: 2010-09-05
+#
+# The bilinear form for a stiffness matrix (Poisson).
+
+element = FiniteElement("Lagrange", tetrahedron, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+a = dot(grad(v), grad(u))*dx
diff --git a/demo/documented/eigenvalue/cpp/compile.log b/demo/documented/eigenvalue/cpp/compile.log
new file mode 100644
index 0000000..9170118
--- /dev/null
+++ b/demo/documented/eigenvalue/cpp/compile.log
@@ -0,0 +1,165 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form StiffnessMatrix
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.021688 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.000882 seconds
+  Shape of reference tensor: (4, 4, 3, 3)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00749898 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000226021 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.090632 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000468969 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./StiffnessMatrix.h.
+  
+Compiler stage 5 finished in 0.000762939 seconds.
+
+FFC finished in 0.121654 seconds.
diff --git a/demo/documented/eigenvalue/cpp/documentation.rst b/demo/documented/eigenvalue/cpp/documentation.rst
new file mode 100644
index 0000000..43c521c
--- /dev/null
+++ b/demo/documented/eigenvalue/cpp/documentation.rst
@@ -0,0 +1,3 @@
+.. Documentation for the basic eigenvalue demo in DOLFIN
+
+.. _demos_la_eigenvalue_python_documentation:
diff --git a/demo/documented/eigenvalue/cpp/main.cpp b/demo/documented/eigenvalue/cpp/main.cpp
new file mode 100644
index 0000000..b709c16
--- /dev/null
+++ b/demo/documented/eigenvalue/cpp/main.cpp
@@ -0,0 +1,72 @@
+// Copyright (C) 2007-2010 Kristian B. Oelgaard and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008.
+// Modified by Marie E. Rognes, 2010.
+//
+// First added:  2007-03-08
+// Last changed: 2012-07-05
+//
+// This simple program illustrates the use of the SLEPc eigenvalue solver.
+
+#include <dolfin.h>
+#include "StiffnessMatrix.h"
+
+using namespace dolfin;
+
+int main()
+{
+  #ifdef HAS_SLEPC
+
+  // Create mesh
+  Mesh mesh("../box_with_dent.xml.gz");
+
+  // Build stiffness matrix
+  PETScMatrix A;
+  StiffnessMatrix::FunctionSpace V(mesh);
+  StiffnessMatrix::BilinearForm a(V, V);
+  assemble(A, a);
+
+  // Create eigensolver
+  SLEPcEigenSolver esolver(A);
+
+  // Compute all eigenvalues of A x = \lambda x
+  esolver.solve();
+
+  // Extract largest (first, n =0) eigenpair
+  double r, c;
+  PETScVector rx, cx;
+  esolver.get_eigenpair(r, c, rx, cx, 0);
+
+  cout << "Largest eigenvalue: " << r << endl;
+
+  // Initialize function with eigenvector
+  Function u(V);
+  *u.vector() = rx;
+
+  // Plot eigenfunction
+  plot(u);
+  interactive();
+
+  #else
+
+  dolfin::cout << "SLEPc must be installed to run this demo." << dolfin::endl;
+
+  #endif
+
+  return 0;
+}
diff --git a/demo/documented/eigenvalue/eigenvalue_x.png b/demo/documented/eigenvalue/eigenvalue_x.png
new file mode 100644
index 0000000000000000000000000000000000000000..0bb428930ab2b8c02bf54e820c1676ee2939d22e
GIT binary patch
literal 41085
zcmeEtWm6nXur&b|mPHpfxVyVA4#Axe+}+*X-2y>_YXsNeF2N<ZySwYlbF1!8c)#6m
zTU%3Gvpr|J`<&AgrK~803c?4$z`&r&NK2@~z`$z4z<fvq!oGj=q7gL?149ZUBO&_P
z^ZRj|QYF{$*VP+|Q<G)GDn^N4rRIT4{qs#NRMdBu7U817EZu}i_-rr>()SGKbhz`K
zgMLr?NMwJKI^ot*4WmzT*b1NY@KD$(*vZ*zW*49Q#`$criN;s%1aAV=%hlC8yvfOH
zBQsR!zsVL)S*Sl%d*pro?=y)Spj-9FXL>*Dk3hL%)gRYC)JYltTT}WasOrBJx!V7?
z;Q!+A{}&H8D+z6I#SSHF&r2N(i_jd~*M+q=i?y|}ly@NhicEhPSdEyPJLGx0b%+o0
z2x6Vo_>TN`Oal2LS3D*6Q{;Y86&}rx3FzUMTpJ=(ql!2Cj^my(k^7&Iqi^RtL4)Zw
z7?^D9^Zn@T)=(*8J+_s&>OZz{ra}iqBp35^x;gcq>5J(x+H<I3)x&XUFqk`w9ETKx
zLd8i)_lqr;<i`flv-3xc82BIKN5MpCZ>0fmxdEn)?|ZxYA#yMKSpK%(2y?x<h4N?U
zjI`)Q$REdOnuj>m<i(*u<i5@)_l6c(soCZ7t8mM~rfKPYltxxVU{UqJUSDMgZT8dn
zTbFR#eee60U*3O>9Usy<)n>SL^Hnsf5LA1Xc**GzZn4r%sA+l2Asjtj@kg-3aHBoq
zuBmy}(3V#~5YY645Jy_rnFyBT)>X0H`|l4*n;+MCpiq{)Cm_nByF_c}1{a-@3rSs|
zhbAwzetOki6>A$TcSuu%-7Y_&J(iiNRL9D!*WO)_owx?6fS};<IQfuJ=vqjSY)z_v
zGd+e-{c2oi-awS6CN2qJ^=3J+N2)4q^}45*;|=!wxU3stpi+bzT^xFZR=W`?`J`p^
zb436fdLRIk8u@z~4iXxy+|l-8^W1!WenXd^tFFl;m;ee@`nmR)APC!Wso{+SuB~rJ
zh_KRj;t3|{+Gw;O<L2a#K-?=k-8!#=$y<v?WQAMzSf3zz@i{gm%-hDffc`W|$VS2!
z*h5`96C_Yl5|dPK`TU6g5tyq84ia6119yBoU1w#s3ttQAdD6F7N*>rx*AZ{2K&3C~
z@xTFE$_s23thYFoMLtFnp}-;DE?0+8yZDkD*T~(8K@MOO;5{pEuUG$Qhu^5ZABn`{
z-RoU|2g>u~-P`@^l)+nzAG)$H2{L-K&C_}Q)B4=HqhcL{ZA*1{lyE~Q9rWIwFlX>G
zkf?Qcv(WvVf7)sy{iK+vb<3tY8_DFFVY~;u!e9RfC@n`9&`mQn{<d!sw>rr+LXmbv
z^7dM}R*kp@id)U|l}}iA9P=W9ydP{#_U4#|_$;@1VoOUWB%}l<R6KGe*RPX!P^hZm
z${y;O)6P(AXpATb@PI-+Za%DaB<RCj*8TFhaVp7~J8F9ydb_3}S++g!QFd#7`RRTB
z_{<Qn*C^cZ@*;GZsFcl+5Mb<l@T>Q#|9kJzn87D^9>T7nE+o{?V>Dt=WSDYZ>Xx@A
zFl_Q7$5*2%B8n0p<iT)XT+hs`YJy`#(%RiI5`<2924exb{;RC*o=(<)%(=qnMwbS5
zNv|7%ztP@`E~xk{nQNhj^?lD)_jP*@`VZ4|jL&Gyi#P4#DG~=q>hb4M*H^-ic!5&#
z8$3}Wr;mSIhg+_X*50-%CAKt9?Xbn=wDGKu*?!we-9ALmnR;fW+p?{lw=fx=PIXJJ
zIbdA{35q^NA}@FUc~~By5ZVN=9B+j@{$#HX;ZLLRWqyZ-G<xtkf$Dh#<=W5J`x04`
z4g(Ke9HI$AG_szIW;&C5XOO*cDZ=N*xI@gd{Ph*A{-oXPc{${;?%A|9AC02xuSX=L
zYazdU(|r>R(hFV6gdcKa!o~|=H(U;wkvqNy3&THLH{AI74}N0F^Up~3G&s(E#<4n{
z`%+6Nd^lFYdcvz)=zg>$GyqV9p2Of@>B$Lih(bLRg1wOYDoYGswGznAjlXz9)>@U2
zAi!LuZxp^%f>6MN&%iN7gyZ@ev1W|i^S`&#%KaL2cZ_BSpNXx6_e9jx2P@Czx1*pq
z4>@RWLV5~VpcJZf4qckWrD#I=Z9q!d%v>8T`s;7XW^59|3<aSjl{wVVLx}K`H(6{H
znV8M{)v_qI>f>WzSaWKrV{-I}kQ*;_4jnJv048O0Ta>QfdDQDb-GriJ1GJpaR)zWt
zJz@OqPj55QPVg?XIm@;T66RS>uFl@_H0*a<dz^xrY|t0FTCz(AH0%Y}0W9r9Hh!H%
zB|ZY~n?)@xIN1AbX>`7r?|%+ekPIOHvdWWZ_?Yf+TKs@|r??>7toeFzy8HV>|J81#
zmUAl;yU0Sda(v_3YfA^y)ypzvq_;VGh-k+vOF(%`Tdd*Nf{_?C#)6rX;yC1b)*BJ8
z3r&A|NdX>DQ5~(!lk%mm9+~?O9_e;FhlM99y8TrotDg@LKL?%5{QL9keHS2oyS+9a
z&t{_?l9BmBn*=Iy5*aLOpp&G;T~k>j#&>y67bPD`Clhkwwe1TG-R&#scCI_$*o~2g
zla8k)ZXSH$d%^U#n}D06`t+p%@S~viY^!>^=<a-X!Fsr4V{)1T5i_J9&nj@{WYry_
zp(8wTip#+KGXHa8-$h2eFmZoBLAq-oONYqglAiOf-LJ_Ydw;h1EyF!yAqbfO^k_C0
zI+BvJ5z$G2Uw#l4c8leFJRy|cqjY-Izh8C6PrAU<7z7Oz9)l&0xyUhpS)6$h!hC%0
z{CH6zmUXAc?s2zs?U_%-@h^T8>2v(K*S|kltL^5<BzfzFzviLCR`blSt1r0F+LM1b
zr-GNxE7?gQ*t6in8l3amPmD_zCI2EWClmO@p0XDYme#A`NZOs<JgN{Mv@cIG;fg3`
z61GDSR}EfT0;qJ({RbpAPPAbpk2Q8HZr0q$et)DpwQjiHX(%(!ugr(txQfoeebLLV
z&=T~#2pD0naI-Dm=W*cO2q_rA_cKvQ(BWTEAE2os5NyijAU5S0uZR&5z>sdAG98oG
z@JaWrd+izFeC_ns^&mV+_kTWBL>0lK^vQvCtHt6R<P-I@_K1&%G^h0YlK^%9mJ(yX
zY^}Z3+a8|hC)`hYPWU!<%uXc~fZ~MGI5~gLJr9U@j`R8bOYq-Uzl0Dy<@KMSTR`un
zGtcw!RkHB61!LWfUQfG}`orxCoPY=sPyAXSI<inUDA~0ntQg_o1;*`pr_*T2W&HWQ
zve-rk((y{@OVjdD>dBmX4d+U!Lt%@?^ryAZk3@d|;aqazDXl!yOW9)Yy8H~zw>dk&
zm%>ZKbd6dH*pa{yma1~DxQ!*Hc&{a}Oq@&%W;;ph@rh?06BJ20Su0w9EJIGsMYpia
zd0`}{mM<`v?>d5EfyF_0pCFmkVk7X#zejGG?iTj<Yx93P>z#KvSolop%kQW3k8SO+
z+uhv}Rj}&DgJ@2WaF>B9H!%#>3cm{vqBl9|6d->jd)kRkK<`SNMCxePffmnN9nwUa
z`(lcPrhaL!E^y$mmvFJEnX04n9O8Hw>r%Th*f)%Orpp}aRlD}~7h*pw?2PxEr-z=J
zBLe8&Q<d!+P}sOT1(1}*czLLS;z-Di9r^~CNv778QXC!V$Zpu1axX{7bC<+8=SYCd
zMEQDLm*U)MOI@LZoC%Rt!39@m(n4=sm4EPVcL`Svj0Z`|SsgHeZD{BEOUrJ$HS9_@
z*%k~+{7a8^IDti(cLWD**^S@)4L<?{_#Z!z7yJQ?tY1t>vJ0NV3eTn}cjp5)lxMS!
zKfXQxz8_*wn``HjY6>oB&6w+p+9s%zX*z-P+8#H5#$auqIJUU;LN^>|A+1(!>iF=(
z273P?Yd8}JBIT(!jv;(G8Rkax5Z5tIU#r(~pDp}My+r312MVpsZz(yC$Xh3)jdt}k
zxK#Zs%t1G>L9t>tY`iqaYTlV>RgFP_yi(yHm3?8-A{BEr99(dO;S6nRj~+pL^dn>w
z#{!!%GV@D$_Uor&xG@?T9&;zTgo5q^^KB9cgoWbxeO@n~iz^ByXoyhSR+2VW)<(Oh
zlq3P&xxvS7OMkF3714S25xw!DuGqc^#92`!EdjhZ>7S&|ntST+0WpXPu0Fr-yrI_E
zRSYDwU%gZCm^ejM3c^JA`ML{<bV*2dWq*0$fa`U)T?KD?mo_vn|G;7P(COen%PeD^
zgC=Yej<8AP6WVPnd=~|!nuK^=I!nWlb_vGxpL8El-uvZP#S&!)@$8n|<Pxg*GTu7Q
zvzlJ=0+QFnFIi?J*DbvpVZ_o{_{g|%d71@Yy!aGuzbec3jC!1Ob}%3x-ze`c!Jkr;
zc!km?HuUW?ipwI;bu4EB*SKysVK-o`PHVZswzKyZJEe~EUVI%a$|-ac46c^^=l-OL
zr?8Iqy}0$RiQ)Kls|TO|c!xam%i*2>Lv6tI)j*oC+IhvP-if<^t7VIPoq0@hOL?P<
z&0^DD86rR6)7e57;&dnnVY4P}gGrcpaa-tFs;%8RyXPRgkU}vk+0Sg1??v(FLJzYJ
zq=^`xo1}}Yt8SA3r*h5RIeH?QBbBUF*M+`Su4|n`>zn&dTJAb0zt0`~>+d$4L|<&J
z>O+FUX#9E*nu<$RgU-J}<Tsia(SZVb)eqObXchV5dh+;?6`jJT4@Y(U92cfkadua@
zxGhD6DDFo3+C>6{#e4-;>F^@<G~&FR%il=`zyHBwc>O`*wE-OWP~W0UJ_vE_dRVC1
zN#_;fI{mp6@Qbrxe>w;w5z4t}jyi|HW4{ttyWmovaaCAAv0b$*Xr=@++w?S1M(BCK
z@gH09#sQGneol+7^%;0+!1AE8<QZnq@Eti~r<J`;l_i@Rp0_tr#py9l=>Juip3%7_
zSan6*acF6bdjjlm8?2_io&u{L0?}vX#Rsv}haa@=FFwSTYKRuk*VZoFyI~eo`kSKQ
zCv~VEF0M;5d$SM_=4X68t613<B3nUz!h(lt0-t05!wxJ!saly_sLtrV^CK~jTTP%w
z<2eOj0q{v_sGE%{_HX2-#A#nM_;y1XDZ1ZrKYgq<b?!yCkNQ_%7~gh%Bc(xCmN-!`
z#dp0CTIw@jyCg%?A)a{JdoDiv5Xq~s+%^uH527)G$!NMy#*@4qDTPE5iYtZ-eo*O`
z*Y%q4g-09<cYYH;onx`1wLvud1mllrejh#p4aCp#44MD52s^6po}J2s6xegM9P~B%
zg?$p$>!txDA2?OJF`6^Ub+r}4+c8lwQVg*>Q?J4Trj?7a6KHKey78mLj;T=EmF)aH
zcIYyB%X$lRlkd8<8ne$7#sdFKMHtfaBv!QE-!X~83Fji0B_NuUsb_=wVRLM2>rY&c
z`%+Rkh5GYs*_U4KZ8)C{qfLqB2{O&;2cQ#I@88?L2QH8ifY+!7e$WF66%l$w<n7ml
zyiW4}t|vEY=NrI_F!J675JBJowW*j3WnHWMocaq~2O-q{RK29+OZ9)3l{7wEg|mrA
zQU+<leHBSUyK_^MFf<?<xZlOXgcNsuI+0XtUm$(5G!~y^AR5FvCnIViFX)1pW8Rid
zhb?;-t%4VEtu}$9;kRdOTuYe1b4J3eZ9;;*e>}l!g(a=mCci}Pk82>u%Sx%IHnjWt
zDmLLGM1KXf#*O4eV@AT-SV{HO?D?NentF2DduHRr9E_wuve|<m{|boVzHVHrldg+d
zLC`n0f0V4XX35*i7K^yCdHc~x^Z-4HF%qEFR@;P)w(Y18c|^Z}6OZmPk3dK61K?1D
zUNUu{0+S7##5&%|QsC4$ROgrTP(46ei*Js=*r#>O`|PnT9K8~78hOJecQ?8ydXIJd
zR2^7MqY-reqZmS1Ju%Rd;MJrTH2sAF>(q+ab4fxiGf8z~R7c24@n2@xuSsN(tkw^B
zzHh<uORgEeI(w3WN2;WZXmK-<D(ErQ=qOfQ6b(ctnST6f&#Y!UUDuky3Ml}`X;U0N
z7<HUw6FQRy&M?Uc!!%1r0CG;WW<u_3p6hpXIT6h?43VNGr9A&-u2y>*j8LX?K=-vg
zA7gEH{FDXq4h>FZ-qV{tD#)7u{3W|=rS0cGT-%tZmX3Nq|9R#sT!7vFP`$BGEdMbT
z<a%%p{ySde^eF9!r6*SMu=WsG(Zn^1pG`BkU(_j%;S`D6GtLj!ti1cXv{0{yLRGjp
zDpzu1(Zg>41s*be1orFt0npa6E{kWLzyJk(q&YdJFEfHjU#hw$e8h4%qhbvf{rj5v
z03q@yj{|Ylu7pQHs!-HBnJ;&c>-w$ggv|5doUFdQsvGVMC@d%1*hq=OK0htxCM<jD
zRrKUg0#$R<!l^AW(dq#RPb0-RD$orY$0?{{ART@QiYl*z&*-yc>W?y`*<lk&Ucf}t
z1FL+(=4L*%)Qv~?hFF6E%6|pCd^JbF7-yDs&#Q`J3ow;>d0utcOU>g9oGthfhJIc=
zGBM;YxPk>AGc=*p?v4$$;Kd=;oUn+V2ZW!d8_DnJY<*+}kd&DC_Ks2WcUb1pa(%VG
zm+0yfHmJg&ZMv7L`4`y6wL&1erfQ7W^6PLyP~<Pi8p4U6<XN5ZaeqYrb8en2gEWnb
z!Y?T1RQIiF8)m49lIFf##>v$=vMywoZ+PF|HZyk^<iUj4$F4`cjyF;Eg?++F@e3_m
zEmQPV+j;o7BZGuQk}0ajpXuk{7gkqfWYD#cMhaIQJ^9UDBZN!OdT1;Zg<-v|3=}$E
zk)X`l0y{o@l-(=PH@r{yWhB(7Hg%N(lDgeWnu;o0-6(l;YbuprSi`l_BHk6FI>Fy3
z-8KKWTVr|zT^+fsLh&@G=GWIZj<S|3b}<q#5ed!O_ksb7!8-Yw*S<d=;;t?LcK(rd
z&3G1(Lo^kE7GhGX`}-GAr3h{^x%K%i+FDm#!|~*OAk*7+mKO13j%Kuo54q-cW&{nN
zYCz2aUz810`k?BVjG}v-xQ^^6N@K(-gZ5*-I;pRuRU8Vq6g}VMaW(T?aE4Q(veD0l
z*#cQAVc%H3iU*+0gS-U**e2?z@>^Gx-qD$$p0rzkMc<w6V9Y4ZJI+@^+=ZAvFv3>)
z;$m~ayVYT-+$L7Z%7wx(8Vtg8blSe)Qd5-Oa|QSm$L<wmL1#pgy;|)be9F`Y(<Yq^
z`d>dt#69s-%>FT(%%S9skeVqw(`Ir_;&2yL<audd{!vApVekFboV$Ss&c!-IeRj$O
zm0SD)kQ#;FQ%v(t62s~{V#Q*V8xEYJmB|nsJq6i@%Z*V@lEzgNhsqf!wuHsHs@eK-
zR{a`OJRCp}*OR=;pCTHG)2hlgqI$=lJE9G-(u%PN;H4yRXSyI^hsHL0=<ySw;xdV(
z<)rbRSslTm6avr3%_4A3TAs1uwH5Zwn#h;ZLLrj%-R8{sEt!TsvQ#6fSf-ymzC{we
zVN>kTtc<Zyi1T7ee~T!5kGlEV3E$b++mzC~hHo*mGI#D@4DmM&`Cf5`iyE3)l_b9F
zJHvxz)uH1FI-Td3Zp5Et#ZP~9Oyp2@L|B+1GOx8<Vbl7ngMH}fk7J5awkFoQeW^rI
zZbonRh4*v2EI`ec!l+G4h{sXIBnrMny@p&k`p(5>ZG?Eaw6NP+b9bA}(!a;1N33xl
zXfn%6*mwWc{NdnR!xepfNOMFB5oKcc?b5|~s0{y=4tv}GREFuan3&5T-vdX<u2I;(
zRW+SBbRsYN*nn@<MUtGchmxVemr>}5d}<y|Dv9ZK`~T|V5to*JIr(hTvr9=+)5>lJ
zM2bjoB=QOm@?dZZXJ7bAah}E@@3mtE8FMNvu)fJ7vgO1N9^jtK1iL&9AA0rvy}{`F
z_*(9r>%~tMpSZ)ioC-GmX%s?qP4f*;6J670T;`XrB9L-Z?b8UwH}<tV4*LU>pSjxy
z*T2@DsLW~DANuZJjVI||`yre?8W6&}5)8<<rRw=4Bou8bjzpD}$UpVJL*xCMwL4J~
z$B1MZC#%(HdE>noF&JTR;l~^(`MbR!)UQ7VEGN2QoaU&!$QIV)cv{Qh8XFRl-IxT@
z<0c7FMe06Aq&yEA1owx=p9c`xazr|#i7q!J%pOLRTfAq|ddF}|rzS-NJ;onM{GQNx
zM7r^AH|@%4UB$0v!O6lY{?YVO_jHh4rH-87g`P8_`-9F8(N3KXqstfys*WdL=OqzP
zp}n}eCdBP#snej?S#3T0f#l%d9;#cw>AbR`)CJtFZ4e&(p<XUE=;bWA(*aCh>j%ri
z%Pfmu-u1vaYZ3qP96m)q$alUWXBuqiYTzk$<s127sZW?{b4>U?y9bvn5&Lyt<0xK^
z;)DSC1_S#cmFSwW2#iZR=J(}Ydec~=kG@pP%R60^?E1K>E2?+~xT}A@<S>zH#%9ux
z($)~`KLJy}NtaEmjOu{P`Yrgo@uUegowq~Y;&gehGh>|W39!HI+zOwb9cG9Ay*(3=
zYA>L`B2oBS#TT_{?U(9n^tXe_hIhO%1K-t-{`z>hEqk#`@Y!C2OwY{kVdp`p6cm~(
z|Ea4;r2jXSq$7frjCfuJAWZH9CRQe+(q9D3ys?8V?zIW&D|rbRxJIGVSAx~l*uCNP
zQX4QjsAiE77)vydf}h}ua$o04=<k^Cg#UZA7F0V|unE3$hcq;q^ZKN3-Hd~z9B2&E
zg*nFE6V0i{?m|Rd;_|K{MXn{|GG5O;0xtY~jSt}dQ`Fndtg~OjUa?9@i3>@I-y`!!
z)v;i5%E`N3laykREbjMTZl?28s+$1#b8axH^#`&U2UTajR@B;p$x^s9cTQ?o0X(TF
zvCPZK2e^gEGIP?sKih<4v(&Ybv>c)P{fJprmYXNrpZ`sdWJ|xN$9(Hma0QNmJ}gd8
zahmeG{#C4DVz@CtZ$=y)FN6y4plweGu9n<oL!^^-Npx{P&r+>|VmogFNwO8wN#v6y
zN0l*{`w1?CaSgcPcnA-0W4EO1`T64|j-TBcBg=kesz}j3*Czf8!5kl&1reZ_uPUPT
z=lJ{}Lb<1;&RH0&`l}jrLQ@I5p`_QUx4<GJ>gLcqj;@T6P@^W_^ARBRa|H1d8GsA6
z6)1++sY^<F&U}j^y*e=1S-WGY!=H_T`v=(kZ-&#JVLL{&Yc-CczC}<8Z^OVfR7ld=
z*{uiL*v=)pL&`zwRKC_?*X!dZv*oi;ZODhBZ0H7)LEW{<yA=fc=oskA6I|7pGFNOk
zaz#Wtn4qG3f=`STojJ2!6QTi`IUxWwaIE%2_dBAKX86I4{pK1(Xz0@{<~!4(>#Lrm
zlDa=)cH#}x4^;yvD?+|FVSw4#rcbz|Xx%5gdM`|@V&{CIBfaIqFR6{t3bFLCUJdv2
zr834Hm-n7y`ZMMT-wv>Y1hhNd!3UtSbdLyT9exvm#EPoq8xp)CA?tZ!IG`&!!~|!L
zoSIQ`_$;AKk4wOJw%wroOON9kEfdu5?IAHJ|IV|3u!n;z|D=fdjc9~&Vzg!==liKI
zmNf`(VJ5yA>nST#{6*4I&%$ItPN@)f!)BkT<eVQHzr>dWBA_E~TK7Z`x-@|Z@JdUu
zC--v{=X0wb(%l;tK}e0cf>%N%&#KScrn}_hH0kEGNf)9b6OyKs5GSB^5iVUF4=wv-
z={;n#xg&%`rr3sej)DP}onDwuRVlrxm<TLxhLo~w{r$-bSp*-t+W8KPuAQ53b1Zma
zuD;YyVZFO_vHW3{r-}i+!0zNTJUU!@-ED)2wgY+?BEQgJ&(PpmH0zfb#MKtMeT*jc
zzY?u{(%aKK*syWw+76s_`zGl~x5SyNn5xFq00NKA)glpUH)kUa)He}u1i$qxxhQm|
z#>8(!vm=ZTZYOIlh(l;jyS!R>Jb&-w51$$2U?Z0Lu8CLTsgF3hvViV1mAzN@_)>WI
z__|Sh_={i&r>7ik6A#F@S2Vn=1UYn52tcBQYJJXHypC9v#*8A@r8UwmA-EowDs}yS
zE-2LLky^C#(73`FC&i*C6f#}cXzS@YY}3?*I5csg5RsR-R41NJ6Wdl@8zzj3^BaD+
zX@+6pFX39lQGb7XwT%s=xS6TzUcYN~&vdlPRnz$EcK<sI;6ZIIU=e3^1xgE;-Tzw#
z{N_38Oz;*C5tzCVdOKBiEZ>=HD_S22E)XKZRgLX6yj~@Lrc}U{G4Gl<Gh$JOw^X?2
zQ4PVwM@8eJ&}Ba|esm4m1VE>0Q;{e+pnMOFd+bINO_Sh}qLPLKtp0H3qeB63b;$Xm
zC_WCfGRzIE`KmWo1K;)?071@`0d#9jt;ieg2{8+sT-+kZpQ1oP6&Ft9RK~<NKB`WL
z2*>-&@Ab%&d_f!%`(etoymx$KNo_(o?%8ok-YB|};ue<T1GXXWYyIyGctr_Y^rRY(
zO~q^ikIdLJw8Jrc`;TnH_`%C%d?LU^^I|1}w@d@dt6&7rM+&j>XYHdvrSP{eqxH#G
zXM(k=oL{wyuK$yr(wQ~qp)S3vexOWbTurno^kiI_i(vMJSZ&bQ2Oev@sJP%59Ru;M
zBDxnJT3&~24?5bO_+VyFPtM>7$xt%Ndr}H3PtmCvQe=R|Mj4XlqHwFrW8_7JI4<P4
zt*<A_O4vmiIN&)#5pO^_--QK)1DE5VNC>PaOEK!b75(dIV{WIzms9!yyD_}~NLS<G
zUi+Rs6p`kv2^Hz2;ms$S`9=my#hl`0N8AMcj$AXEu#^3?An>q5%-uOSkfPnj2HLVa
zg`+*v?b;p$f7VVpjkUo{l?i}!y)|{;688n~3NEz*syq3^98c~b&?D16a-Q0%0IZAn
z&)dMj-x!tRZKP}?cM1#xVENUh|GN|`&Z0!0)l&$$TSVfGN<8*ApXg3^kQ|->|FEzb
z=59R<%)iO~|BTGo$DOm+!@Yp(+UaFWP=<Xz>}Ve?>fRI`AApOc><t9igD8pGfZU9r
zKOvmIpdfE4-o_ji3?x84{0Wbq|1mEccAN2Mjz!T&7{DAW)k>)rDD!8=t^RQstQ<Kt
zdof!`u#G02WtGQ5yHFNa04Wnjy=0Y=O_Mv_=icp)`DtDfu$HR6k`h@fxs25~BIy9(
zo3v<~3to=hwW<itm_h7j?m<7-S<9k)ELo-E_vCfNtzS}_X%6Js)hc$+%M17-=q=h9
zudH0Ltqy^kpV)6YU<5G_OWRO{_%L7}X2Dfp(Dt6=ZS7ll$!EG*jaY2?V?TTcq~uu!
z7+5F5<SAiwb#?)3KJ<TKOlGYlDY02{Nd`b(=>UjC8sqE)8^=737W}M-e&#{@0<`0O
zDvU0&PhE|St%DS>@=SF{IH^4LTIW|keW_)z_%Uh{B6ssukQ?qU9G1ko&i=gf9YF<X
zI-aOUy&i!mls=8wF)wfYO<@rT@w1#!R>oP)qs^@~`(Sd;k@1aJ%)r2emN&OIEZ9o<
z^N>Y&+K@D9vjBP7)n#yDswq6m#|S=HKWkK!0w}if8|9nDt6qDR+{XS7P3kV<dS8AH
zc>iA_Gu+>CA)KQ$m(l4D6pLG*7%`}@hV2miuQX#r8d+N`DU50Z!MUf?wUv4mFfM%a
z8!=iN<Wq8km0I3H?@E_^Nbtxu{&qCjRjp=!AAj3%vU%fE*ASn$=+<HC(p8eGCvEq8
z`)KtAxv=6?UK9<od}t#r9NRV=ly4Ym?H?J;s6Sm>9;Tb;5>ZOr*!cR%Ya*j_B(uxf
zl>=h>1KbB9tB7i_$k2p%JG|d6?RzGcc?z75{yvLmnqZTIbSeOr!M!1wysShYjWbB>
zZM*Kf#T#!L9~#Amfsou+<X3V=LZPg8mA&XfXnagCRGb2KAYd-#f&^|jg1jKcon1T+
z7aItf(Mj;7KCs6FWo9WJ0>g5(?p-UBCIPVosIO=Ajiq<8=-rfAKygtC5I(%V+W9?f
zv|ASOB<Cs2`21FM06)mxIjnF6JKnpS%8nAoPjEW3Dc<ZBVZyd2Y6nm+x?%E>Eh&D>
zMn7V!CM(*VWL-~q6s^0CbH+<_0r4T^Ib)(smk#II2NLIByuCIx{oZKclN*bRs)&$&
z=eka1CC4}`$U|}yvxgDl%v4b>O)kw_wMT=%OI-q(cOkCOpZmcyxsQBOq849Il`(kL
zSji`PrB6imuu;@R`pPb<t9#P{y3bo}N*N+uhPAUn9BfSZv1jFLx<O?r{XpawiPP<n
zW{j&nr!quj4tmSALvPzg7;{<U8%3+`2}xM^RA<}}VY<ZXfDg_`uvI<h&%@>!^tHw7
z$nPHS`~8YM?~i2wQBSJ883cULpNY);5XGSlqRv;jh_uEtlAN>02bC~}E=I-%PlD|s
zrsASL0j{qO=%LzBPjxNO<^or$>O`yB52^JBZg&Q=CVDe5YXut2$UpBzBHrW+oQn?r
z7P6GxRg@Y55_w6x0!c9&-TC**xN<tfbt&!^8G*L+z+5WWsM+098P%$YB2pQ(M48?Z
zWc`_>Lzt3*PmkMR<07HFO|m`aGSgJA^g0{@AN)+al$>`91V_2>wh26=a`$Y-EQwY~
z1H#wfc~ht5pQD|&5}j-kaZ0RHVTBj|Cx2Ya&79MgM;*N#-lS|%5CE)&1uUG4JNyt>
zdlpX(CJv$laKPKM<Y{_wVYr!B!6I;gWE-&SDx<C)ucAIl;M>=N)pWi|zzS=SW;Tm=
z<ue5+&>KfaA>Hop!aN9mfBpB`k}17dIAH-9spH(S5)+q*tX8y<@C%&D&Tw8`+cO{>
zMV6TB1;q&EzpFXSQe7=TiKf`Ct9=v5=iMQ50f>U7>m*x#9`kn<#}DH#F@+SmPLr|0
zn7`RK6o_ssfY{L(mwd_9Vv)nLm{-mJatvrUS`xI>IR=a~%yM9IirJjE5O_!^IU(2C
zgXx_=E-8+*5PEyp&vU#Du_Nv6;Pq5los)`BLW$#_IeU90h+3lqDYbZsZljOf*#fFp
z|2=jyA@g$2AW;kt3Fy)UW$e{1rn|BRNJtA7eBU8<KILQ2?IYN*%+5+Y>XxSyO#V;p
zYk{<ikdo<k5<qYOd+PF-Rl4(6s5Gv4n6LN=O?@hWXzSxsmBiWKj86OJdaBCgx!!l5
zHQ=R$IDFBfjj7>wBz^t!B~T)6L!ir<N)xRaOU8IoF|F7o54XV$4~Dn+)EFTzOWyB9
z2X=Bo(vbl}Pgi#^rFEAdo0_;w&o*hwjr5hJ9AamWJ#rNnm?%mAEv+`U<3M0#z7$5m
z&2lYAnh|(+)Hha;I_f+LZUY6=lRp;y$GWHi9b>@V*$EYl&2tn$+%FDfONGF${MG!b
zIC_8-zD&YSuULj#0jZCOvCzXf+|Y5}m-hL=QV!n%Zp<E|z>)zx+yjE4TYri7N?n>K
z39;bB4IPVhgQjZBF4hK4lX<Q8%^22xq^%XVgXO3*YZd~rHrs)d>ar6?5#iX0#_;54
zqTq-kI@Ype(u?x$yImg2Q2mWHb<E@4ib^=m{e~_PyZ^1VYI9yYuq1n#CF-l(3bxz6
zq82s_WxSoU`0t^scvHXg>CcN%i{(DR)lYdD!85>2Ix$gC5P}0vzBCkIq`~>?saaY2
z7t)6uQ(b{`-o^G$qNWfCPnC-D$S*dp7Ov2Y9n}z0V@7xHOE37$C_j$~EARnI1e)Ad
zjU@t-6^*r@ld+0pSI=!bQ<4&_oa^LsHMje9TfeQ{-cWtXeAd75wJ=*rM<Q^iybj01
zD2{$wLU*tuyhxf8x&q3A*{iOkV{ITpGB@WTGoH4J0(z&DYf+SA%a~Q&X2E|=Q?e`+
zva-rW<}^a4Kd4<j!DrSi(^BKp9S8X=fDd{M$7)VRiu)fNxquY07o$KOg3R>QTq9xi
z66)G)q1HHZT_52%3+W!}+WVCg=MFU>pW%s@H_YLG+=0>b@I>3dE!yd=SX@{D)F8FB
zr`zYA-^;pEd$ha+eHMU%Sy)xeFO|CAV?VGx9?CCsl6=>9beI$+Yz}UrC2<3qK1~z?
zzjrjfu#X2sz~`g3u}*p~;~OE4qVC?XUez^5iTtVIcd^l6QD%5)dWTfyX}jNfj`k*i
zO9JaESnM-bKtwoJ4J!B1Ph{6)*N^$gKHM0GL}ZjX@0pUf``{xHU<Fm>*P$ONr)Ccv
zpfs%ceeg#t3Jzdmz=4Stc1L@z)p>CSn?n{66&&9AgVco)hI;jaBTEMUCl#Q;nRkpR
z{0@wXh1EH-oD$%z3uCJ~aheshcBsY~vV)s<kUf`Rwz)cCx<_#y!##QbY4B5$mPo|V
zpFn+B=iMwhrbXcZuGF0Ou0A(-H7l4$f5M>J803;rMn)PXbwEq{qd6mg65})@7^~@P
z!Dp$mU!lA|7o{?D&7TcOb1RE-moF-S;lb^3y{sWX$VlwUtyq+xhqRBl5BX+07d^}^
z_Jv(NKFXQK<xZi_dP<}Y0ngC~vZtm_9|F<*Oh>=mzSJ1x)R`!P275DVw5auh>=>6N
ziK_x6ynTdJ&Z!`7WJ?U*fYXQ2>e83(-y|1Hj3WGObi~S)bozfzxYWhjZFz`<=wjRN
zKuj;4^o_4Y|FyFqk+ZdHknxoJz`Rpa6^<0v@q-F^34(Ru0Z(Kkz6ht>6Y2Oo#X^lL
zGyeH!eQl{oL1yoQyk>r+LWL?(2meE4qFZhdnwm>maQ0)jj$G`zt9JPwgitw25|}3*
zbKe@2=O9sy`$N~t&R6PEC}LLU$V7(AODCudHICR~;SQ`yL+v<#lI*TPi|LXj9APyB
zR>4`VNl}l+yirj?4jDJ+A>X^ANK!I4koalU>jakWHG$V;Q)+cWi1tX6e)YFn$!H=k
zmQP{Qc~p6yf-C)T-Aq}du`8&yFJ)An7I#=uaH2CgiMxGG*8>oU;~!<Dw4!&lcbVtL
zr;4uLb<q+}*WAAj<G`@aldkm(yYIvTkof2Ku1>U%`_Q7=-s^CDxw8^N#=W<w4HR<3
zU)-)oFgIW{u_W72*en;BiI6k_D6DVN#vL%w?Smwoi1udS>LgHh3SF>+GVpE4Q0nYr
zpH+Rfuh>PJQ|m-0FHq`&^B5KssQILK7uhXdqhp%k^TXAbZ`8eI-}90lv)cVh4GJdg
zOKQnPnl}OnANv$i7bVhJUZ1S)M|@#971q@x110X64j!W|Lm5}m&hLI8Q>CK+BTlmC
zdmn~b8h&fpD^mfkEv**EW<4J_|6n#$p81)sY-8YI%bp3~reQ)Lx?%i<l%H-Mx0;SP
zRD^BJD$8p^h=GZO=uM2EqR5WYd_;wCX~&?Z==2ZgX6%Rw^tZUq^!-s2ZQvM;pWok(
zYr%IdV&+ju6?qsZhi;#Fx0WuH$SnC}n6ByFgpOyenov{r%UKTTr9}xpAkNI&zYNws
z5SPzHb5=mfhkWM{Dcp@LmVzWY$z_4%2^K@}Z?<=CFhCWIhPL2b*MbtFQB%QR;GX)H
zT>V6)&oQHjJk0O1oDO1LRKDkLCyDK=fC1Ub>wj|8bn{Zfn4B-p7;U5@A$@{Z9@Vi2
ze?=6xzlVJ%J++sBWRfx(+|T@H`5xC6wG6IWVdz=9@`POpPXhGQ#lEVfX1fqG=jSQC
z5)tKBu@>fegu-rEJyA;XV`q5{g^6e@&*7`cXRRNeZH>+>0?D}mAi1yo=J2UeE}f|v
zRV5!yq&a*#rdFf0fzjMG{VKHkE)K&T=AT`<lobC+{}qrEU4gA4B&$E&`pyA=m^Ji-
zQ5Gtb&0<T6&?01sA;McQx{zBRumHPjK~$n<S0F&khg|_X$+yW&GT1wcbE!SpdlM5n
z{+{q{_J3{Cr@%~$^~L*lLO_7H<QB)!-#nQ%pebtu+*U)!P*o#*!VN|`dBS{nl)ZKx
zLNWWJT8gh;)4iGG9wV-JGK?8?SKQE2&LQdiI5dMr+T?u6y#DeykNN~ae}}w;b@^@1
zzg}KU69B=@S{sP7Rl%_sMIk0qt=4<9zaLp~i?-v(kgSk4U2}%m25ktc)W7QlNtQ=H
zeJP;?Hq|!RU9X<M(s7!GIYa!$%mBe11=ktT_?myR<K^!Z-$ri{dM1YJBG1vDIAZMX
z>Jel#qaam8`Yy$okg;QnX#wTBR=`udm+QcdVIxvr%7;a6Da)?dkD5#3cHBcLlB@51
zSj<6rhYZKnN!*oAL;<QqVR_ptvM6<<<jlRoeQBU+3Co-vJOxf==D!4zKIW1iYLpor
zH;TRGN*UWsa${()$3_d%OVU*W&+{bv7rR#t1r`WhE0qnJWg6n)JT9N~Xn;(fZl@&A
z<?n9s!Mj_G=XQ$faHdTaJo(hR4(p<3S=E>&*4aI--ZZEX*nRyyOiD_+^LM*T3r=?q
zr4Wl-=y|+j@yC2%FDKrF#gkVh#J^*WNOo+frRRn?>bzj3v-{;^NCS~r%uzU{v5kNY
zbP@&@KZy4wE%MJKe%>Sjeh--ovAI;B+1&Dv0J;90x0rTTCK4)p`PRmI%PY2hiF$NO
zphnOLieKeGC7{x+zSm+TAylSA6bG;POzyoL<$1P1?)J+byP+klhAf^EsbojMzWyH@
zIuhHlVQG*$sEO8ocaG*cHhed~ScJG!D12Xj-6_wcw$C&niCfe7DFPL9A@V(EI!#7O
z>@Lfq-53`FXS2FC&F1RT>it;|9dif}JKou3`&Z-@f!*E@nPIFs;M8OHuS*qs(uP6K
zs!#+Wo}!g<w3RnWyK+5Sd+T=?ght}bR@iR-<%Xr0QNEbk`x0~>RUgI=_3&Pg`f9o{
z`*lwZBiXg6s-=_Fn?20r&X@NyU6WWQHq({kNXJ*Hk*xxAhg!X<l8aSvydZMC@)G{o
zi+j8y%PJnWa#^@rTB~EkA*s^oM2hmJJuhdVoq?yyL?yBaZ8{|Q)+3M2YpZur+JSMU
z0D(r9QjY;cUIM3XDwlzVo=ra!e9X;XgtSvA&`LT}_#`~g-s;=`Z*pWUt?_5sGP1o!
zswjSj(Y*P`1#a3s%LBUq1_+AhMnfjQ#S_qe${R^2NpyR#1R)Z@G8O`si8fv&)}QNQ
z!>$U^4CCV`nAd9p$G~HxIZmNhA|q%7a+#$tl`HwHl`9Yp>6%w(Y<t}(#%t_}3S>i4
zyCg;*0|{9!l5-TxW$x}7>LT$D`>9Sgc;}UhW=qHRW|=%pwmWK?61r&s9&N@cGBZ{v
z16LE9^Y;ii^I%TJz`HTlgOctIj`y6*zi4Bm3idcX1I8`xY3;XtV$slli^smoA#A@<
zhy6DBdtDJYBW_7temqo9kz$$Z61w@oOk^~#1Lc4D<sG(6)GZI*lj<UZeHHXIByVL{
zN;3x$A?rBw!cdP;HxmOktp0Yfa3g3>OO(JF%~M@&EU%mq^EQ9UMf|p9=ReM|xAzD4
zje0?vy=631)#3`t-1){p&VVCHx>UO)HAntGEwrg1zQl1E6%KGyjNz`Gx9%J?Cj&+c
zA5ZBK$<9qJLiy>oT39mqEK^&KM*SN$br;#x)QaF%H^;#rZuN>P-f<b1=Bgk-k4@j|
zqhXA2G9+(ReA)~+arich_6XcF<K-;P3qt%Nk@7{?Ri!*i4W<8drRp=NVHOqmZxw)%
zqte*tdH2t&z_0!IpoZT(E9^*p)AbK+T{%72oTF#q29|AfSbXg4B9p^sLsv>+fNspZ
z{C`A=8tp%R9HXj<+xYrwgnQTkDuza9+oLtEzx__5=;^g_Tml1pW?meVn^KKR><RWZ
zoK=qG%D*Te93~F+G4;LRDb5Bdcv#j(xv0|Ym5s=sULL&dsHu%T1h3_s8`-u7-QD8a
zNq8d+Ea^cLs-q9BPe9ITBU)P0*o*OyJs*qoI=3a82d<H2o`B8GE~y&au8X7eE7W&F
zurxi-KYGniPPW6l1~km4!^a<0A(Xc`kb1vtRP{W?q<-@#H@WQ2pds7p%)u`YXWqSB
zuMUmj?dmn=+VF|ZbmFApUwgvEx$OR|gv7^VI7?ArKk*hA$P2XO91yx2+IzSA8ZORC
zbGb!SwDm3!ono`f%aDKf`6s{V*xguT=oD0O%s~mnT3n&aSeWF^cZ1I_yji$9`NkD>
zp>AGDq<MX*M3#2m<2Cyo&FYm+iC{#{JlmEAqoQ^)x0rEmCeyw_%UktbO;g7wB?8Vw
zQgFlf(;dljLsD#X(k=>J$fAt?29BO|=^uH8c+>iSp$k^U2nr^XqD4+`NkH|<B*62X
z2L4%Mlh(H`HD8RqJ#}xXb<OWCOkk_ZoytfTCE)6EJP+XtHuuhi2=I_BCkKZFlM&LJ
zu_Nt`u_<*phD(09Dp<!0%><+5oI$ALyd)Y}Q&&uMGXw}r&Mu~^K+k8JqPSpOm<$|^
z2({0p2{F4}oB;=j?^91+H}4+z&iL!(cx76KB&$>&yv1?dwd{zzQ9AWpm5U0)3|>J@
zQUJcJ9)b#oTX^v6#^V&&81Tt2!R9MKH$qIHu?k=-ZZfdrYQf7H6?_Oew@g{dh>}_}
zDa?>C)wc%`sAQhltnzV*;~e22vfj476W)kL>1EXK@nJZ(uz<og0>+MzW=aa$Um=D^
zu3v_fFvopq9~xm77cMsdM3{0N1dz64@6C0voKnSm7h%Jh+!^1QZ4ZS#YZ6HXhyA!p
zXpo;t^ZUv5`Sn4|<$dU-7nc0b@b7)v48}ZiM@d#1izrEXtORn5sc*5%zE0NE!uYaJ
z{g}{aZA^-9S{i;oM<*Z3dMI#s?U%FrV_+0Gkmej6t50eGFMRyXUo4`xTVV6Kzk613
z_Ls+Note0cKMA!B2)EMc|5e4udh817o#&cj?u2@F0lVFt`B|h}b1IH^)c+&s2I}Q1
zdrP?bu}k3lL_p{+j9G>9L`rj~cUPUYtL?j_qw`NbFYg-GMZS^r&m=AE!7)%Pn`}X2
zG-=BNm&?Z{#HxAE1_U%bLhCAOv!O;3YdVloWkrsFrL44I-%##9X-H4o1~f`u@LnUk
zSVZTq%WIw%Hf;3zjeFRN0`p0IKz~K_x1EVt1Rtb3c`U8Kp^0KgsG$Sh8HRX;IHoU%
zZ|4p#>@B2n!Zq*j#3-I<7s}$MaQ&#W-|876b)vJ#gby3qp0kVd5*)45Kdbpwxm(*B
zZjqGlgaxDdKTOyC{sR>wBqT$XEUz@<4et{$m8gRXI8?TPQ}ESmxSblrv+mS>Lv5j=
zP77VXg#IA_;PlqBWIT5tqW%sJyI+fJjb(QcwT0ldg+O8KPiFB$eYNSfq$q$S_KXhk
zDSlpKw&jCInp2c(x6=X;7NVQxAr|tLjQC%cNe(%Q9>K*zmK`F4T2>whNbjmU7_Wz$
z78fJZ#sGLcN5MzYh@BVM%*YJVqOJ~44akI~C@28g1rs5hGHFcA)<pS~Bo@l9GwT!d
zJqv|3tUkof-(@BKM0k7f5~MveT*)wv&=EG96FuU5a}N@-Ui`sUl+jDZQs&Njjg#D%
zB;v63<TT8BvufGOHg7nd!0cg(wD(KopbI;6#r4E)Sb_$vFN;`V1MWE_RDOfW@IGU9
zs3Axh$%97okYsCHRtr7&mY!Mg+k4ncB<;Ad1t>6*g3ZbMqMT*~`}slIwBZd{4gcVu
zc3wKFASm(5XDmMep?{PB@Kdcu7p*GQO+A!sR_;)$0_KrLtwrYu3JhrTk5E%T%a};w
zKb9|>vyx&~A3Du2q>h|RBCdjQ+Io)9K1cgIeKPiVYmC$G-pN7l-G^&3E`#>N+_B6K
z#(NkvEoyju+B7-uF>B?-?<${$!pO*Pt^=+P%tc_)nVGd`&#m60Oa<;Nk%XXAoC}!s
ziS0@HPQ!|3`lah_^j3eE#_rbci47K@O<#7sMYL|z3@mU9#R^))a1<&+|3Wp&eY~%K
zz%Lnx6RH_~Vdl8E1L(4|VQ1-Vv6OX)%R`R%c>>g{thQ4$EMHB<5%6HHl_yK*Ph@7D
z@UcQ%DKpdm3WgVH%a%3K6v(YhYRcGD-*ZKMbC;4n>4uD{yC2)}&P=oLA<cE}0`3fd
z=;MR^!@6kR%ZFJ?OD9y>R0L`Q6`O352tiy)jH|8Dz2mM=)fQiJ7o!CpL*$7&O>|v9
zvizR(TGNVmY|RvRl8*5bn(Tpt3)(b#%f8aoud3vk2N%WVx%p?|2uR8%&ltkFsB&$|
zijWK=>jx%I@VhKpch81V+wCP!!idE*I~`J?iuEJq<qF+u#diaw-S#N<d<%h(VglNm
zBP7TpjBuSb$A>^Sk)OVM`cwxZSA_2G4>C&UJeiZ_`ael9Fh91wQ@%)Fo1(jL$ve3T
zc)=HrBQ_}R1`dH-FE6Dnr}LM{-OpFptg(;hKioolTw)27NvKhNmo<F0M>sG1C}3pH
z&=o7GYRd1P*}SUChQL2b;PJ)762o)S@f?E=Fi80?6w7e+31_Fs$}knj)g>cU3#Ael
z{w5KUA~rfOh$AKLz>eicYUthT$UF0Bnl217Al(XSlL5|PcTC*-O?e&+J>!wP|DLei
z1)S6_66SGg@{fJT0K4IAxTB`#NWE+G(@z-Es;s9ChF^HH*hjZbf?|zyw6$T|0Jhaq
zhF_w{wL4uX={-XI%grL)_&qs4p7*CLM#pFm4>OkYP)34UD(=FrG)GR{j#%vW3a(;w
zie^GFB2@GswryaOc7wa`uqfs0C(FMT1S6XYrC4ZDg{RDe@A7cHldXE;S#Ox+>D&5Q
zwH6neaqUF+6VlST6!!g-E^6;i1E{y~!7tvOM$bzk`(tfh&J&*I!Gh%jUMzbZPibDR
z9NtAH2QvQ=C;+^1OuQugX*I61@-<}UcleLUj4R42lNd3#&TgfV96B+r#+Vr1y-%!%
znu9c_AQ7q33(c|W1q7=y>mV)pLwe@~sYdc&E;mSnty{R?<u}xeT>Fql%fiJ)Ta|It
z0{sh4C`K!cGZ6}S0)0x`s!4I@Agw)vW_Hk{XyKLrodw{+fXnCMRU;ferTsGOCnvfT
zuP@y}1@KxQ?9k%rmD?*N@y~2il^hG>09sv_jiNkFG;9L#d8;i*-A06h-l6oa9thQ6
zyUD>aRa=(6){}%AD~hg(Ow^ZnC{UOdHjrWwM<)fBicG89b$_By8u15ro#hCBCkhg%
z^@qa#W6zAn?aD{4Utz%Tqf}jlK~VXf8Px8-uLzn56X&Vr4dSuyulQ^3B~jNniGBV{
zl=r9j9qW$+(a*!8;%{67?$_)qQqV3K4^}bJ18W1LL(jWY6Ie8`NSQ@8-`(y(kqVp#
zyLfJ0?A20TMf{Z7f3ggJn|IadfJ0x`{rLCIiU#TinY9peKcg~iEue0eR`tJh$TH(P
z6+mhAwCgf-1Z>=D<%^BgoK5NHc*pGco1E7J4fDupwV@=<91qba?R@-`>@*C~2c~dw
ztLq>AuHSH6pXZS!3PUKB&!i0+p+aK~!A;Xq^4$Cxh^#l*9Km{IGt-h_p=Jg*Hnity
zcJ}a(i1{44K-U<<T&DGJ(2-VBI@q1iSc?+B%Ox%r?4ObQ$nTclF@JmbUAA=%D*N~C
zjgs`<&){m^>qUQ<S(84I{aGQSSA$3QNs;|sph5;MHejJLO#D8j*f^gcmqv>mIH;iu
zshQ_BPUvK%e|5N}T#U+C#FmfAj$CEPWg8Ab>K%$nt&85K@DhE0m(?=|6=QUrjpuKO
zliq##67saqTEF~tPFcR9rF|N*#~{+|J-f<Cadl{!;;0TuPU#oG2D>S$jLQ^cFy5(5
zU@YC;GRMSZ9&D`{Jdd#uH-C{6Zu;+~c*201uOi#vOf9YruaI&<*yDr8X2BR(5rpuQ
zYL(d}U+1`K7PliTGh5}B-My0PWFOD2i>1N_N58xl>5_ZVCZf@+i!hoLzx?9v^;5PC
zKR2rURj~Ofia&SY6VsW(OwULia?#yF*KB81W!R=NK3s8Lel|ymGpQEzk&iXTnEM`}
z7Wq$P8c~3xCqGcRkW^L27ii9yyoYRBGd#km?EOAPXdsg9!y$C~>k?%e=Kz4du`F9;
z#V)b@_5bnom2pvhQP+r!4C&AfLl4~{Juq}ghcrm1lt?plN_Tg6OLsR&hti=)D9t<n
z=lwm;m;3qLbNAV2?Y-ApH$PA1?JAUr$bqwM{(~@*Yk(Y4T9oNc8FwtFGJQ?+fqwXy
zDQ1-I9&JHmF|1Kbgao<1^Cz%}rZTqu7mU|Q;j1Z%e59!TRiDaWi;YQH$QNUyI=tDq
z=J+F9hgvKu!|5A*B_8;RBhO4JfE)X8nY*FXgf$WkI+ymX%jx;RX^#+u!tLo18o;V6
zq=KLMLChcuT|C3VY0Eo3#m~eyC{6$PVWHN~>93afwpi}5ufd*{b%9+alfl7z9x8jg
zpCII~y7j6=V6BSm&g>z|x$w!BKOAK^a?kX_%u&1kPw$`KPCo2ZTo@1p*~=7T5Hsk%
zf91`XtP9!sRfja&Nrg+SME3FJ!_Vb59D$SPuQm+C(7FkI^p-9Co_FXqJ(<JejFcVv
zeot8FvCc=`lX)hBDIc%TU20T8D?RDWn1?yF#pg%nvW487xLLo5+ua%N$n>qLqC!3(
zU}5($*p*8Ds>txWLL18YLh{$}ek0Z5Qq6b$I<pqRR|DMnbN|x%2LUy+M_T1kBq8}b
z8Qs;*gc!RTJN^&vU+Pa$!_azvKfZl|dY@Krc6)#G{paCr_w=pxnPYP9+5hR-sS0?p
z)t>R{4zqbx1(x~M=LfaMN_ZF%!*yNfaso`}@Cu$!$S{R*(!sm7^kr{y82;wuEniA0
z=XVq}w15sNtYF*gw68HVj}P=U`XI>(A4`1RF^v9{;U>IZ=Lo5H$0P4)Qzbt@Gj4m5
zwRO#jFp_e#5%jP4%8Yk~e`=sj`D%s(>5>Z_<iIiiyE7B?Ks}S7i6Rr+LlO0hLCMCS
zA_XxfW@emN=q;`K-rt&+x3_L%?$_6y-?jGqC3@cez2&&wy#Cn<@kZ<GNFV=uJ-fkH
zj_n%`r~jVo>o1otkNf=X0GU#a#5?c!`8i2*<v_h|u0Yx)>@R&Qyqpsl$fJE@${Xts
zUNP}W`MHV#r(cs==hIvX%HHD{HGzZKJVXbj(S&!|(^Dri<`ivPaHu^%a2bg7%pC!d
z`*-SZ{_ba$E+oZNu>TqqT7ctMF@I?`Ku5~E`9`5nCyW~56n=sYAS(CZju{ssvd`Sq
zyX)uGn_FA=`lshHWSeh@wznLes(WJcw)LHyT9+N2xG8#beeYZo;l^8zt-py|SN$?>
zV}=#a>N-lY3az=p_=~$@%X%bzF@>`N7{8_{3rr&&&LoYTw>pD@@SSo0jCjS^R4aBn
z$M&nv1~@NAA-DNus$1imst5f#LNd$WNox~G>3vMtrowUWvNunc^8_hi`<7tulgee~
zB67u`ni4GOnv_Yj96eavkc9UaFc|GEf~0AQemE#xqN;%AwnOdonL=!HAm1+c&?rD@
zHUb#x`Y3}J$#Z<;VTYI4+S;z`RLyf?p?dK*yJ1!x>oS$3`%X4C9Bk{gu6!!@%Gn7M
znRIrzdm9;;SQ1#%ln??JS(h6m*Qer85Yf2ESBr>81{xF{D44g%;80&4lS*H^2h<d*
ziIO)*%fBrsq`S#~G=9eCHX6XtN5YKi1xQ+t_Zq%C*v^W*<e(sgh^GGs@28*6MW@i6
zo}wl4nnn3;9W?|~lsPSBa9B-FfE@j$eyxW!)|=&|{Wh1g)_;C0Pa5k#l0|K%9Y^iv
zHgM8YEgSbz?&KW>IYkw!qK8JRLO;-g3UNq-B(OReu#J#o+UhYm(1m2CW2g}PwcM!1
zz$V6)o0PJtt7;jXudQH%B`)lg!aRAJg0C6kS%h(Zj2)SP-vIfwzRYL9_nxTO=U|x1
z$aGge0a~t}7T>*w_Ms!wXxwPRkw@XyoD*$VFj--v$43#PvWgq-VSHx5h)9Srr>l-d
z!58(o@PEw*hqVk;*S{aX`rD}_>n;Kvnp?L>NtLIYTi59jfmDsbaCkj^KGXf!&f)(T
z;Z<?xYTWHpI^h3zUl^HZdzdJ6i2KProzK>JpF>D)@PVVAtyEKd5v$89l$VMdi}H`~
z)6aJo%MYKccQ5`)?3R&PU{+>NE+MPoA-jJ&CqDtOvH^lD45pZG7e79CkXw#WzvD<l
z2>Keg%dcFIdl9Ny%0&?|#rKs6Cj)kjp#0gYi=r)^oM&d<6S(+p0am`+Dt_+~?d8w@
z{PN<&5ZqhQ6#U@TFCI)J(WrNKq-ewIWC9z57=K$^#m;u*&`D|j`q>Hm1~?gS-KYL`
zL_E)hoo;VUZu!r?uzTskWdz+qZY33F_Qp~|*0x}ytAq7LgKEXr*7*K18ge;NZ=<<6
zFGC_4&q8&nNAGF~gG1pH!fR&fTBKLqE@@9+(`5e%Q2ISzoBL1EUtBd(8s=SB{l|2C
z^Xk{%Zzbp0OEatOXZAlrMJbX|ji^YorxqA@Fk5jU^K^kxu3PWX??uP%;imaJKHrge
z!b$Jf^#xj-LZxJjC)Wpe&po^|SH5+vnyH1*bT5F80Cy^Z8e7Pvz4n@Q5YHtJrL?lW
zHczguIy|}U@;wrdUwYSn94!LoT>F)r8?ZrvWPy%Pei;2wXf)}ZMk$Zd0nQ%rg~%?*
zk<D4Xd+>_YoiTgmoAvQ>&wN-=*W{#yi~PuZBZ6%RcWG~j1;IPn`qxQG0QA!Xe)p3^
zwxMt31EW6$-+HP$?=h@iI6YRDaQcv?oj><ZrS-IqiDz?@YF?W@OR94cPWb#QO%f&A
z3;mtNy$HUzg!lI&rkmD+@h#1>!|(-QH<{BlHoN3PR_5+P8@q(blm$O$UlISvVEi+$
z{>~=182Lq~qJl{g@dEp@%y;o#>&7x2#W+#wU3L%=MRGV~z1{!T+ds~}{+b-I*A*&=
z!@7nV)9Hb1EsVcQY4g5B^{&+s!{rkOAc%JIMDjHT9!8t?Hq((=zNy<8*M$F8us?>M
zlYnIE=lJdC9&y9TpMD>ykKRY5&8^#Vf2v7(SB!Z>rvGRsL_Y5)i|%ryu+F%J35YN;
zE^{+|*xE&AO2=@xtp~gtc%VO134KFQbC)L&-ZJ!L-SZx{2yT~H&j7%lxIPPVBo=;h
zOI2!98vbf6^MgKtO@h6B^e`u1VI~iG7sIX=oQ<Pq4Cc}M`4R6c1GG$Iufl^!%ua$k
zBp1^_x3{urhtvHXU_tGj2p*~LLTHe0OMF}?9!!*%Fl*om5gez+Yv&XCFZ06}geL|h
z4CAF%Oj2whcc|L@_cMzj4oXkGs|br8a)6#OiBpDv=h~c<LFaH$`4Lxhw%A!aQTVUl
zsTXxhExjUUomIc>@V#zA>LcV;$)@N5aagd846y4*ln@_s7K=0)*`vQoRvQsf9Y!(E
z^8m!@L~uOc%X-H^kS?0o6!lxV?Ida*<MvF5HF3AYw!;$OSA6oBcdj-nicoJkm<c}?
zN;AdN`FS<opInC+fK%&lFaK}8HXiq^DS9vr3l76g%DJ<iB+DWvwors|!5h;K342z}
z1=rTwp-Dr#bYiCToQBnwM{g0DdoWS!iMIIz>s+gd@paUgou_Ym%%CSgbIpV+z&Uo!
z<B2d4X35qZP+53kbG@IGcvL<pe@HTd<owMh+)w<;o*#<vtJ$7UM3gLR^GM~(;iRoi
z#@_wJ;<gZLgB^Im1}@<vl007b49>wh#=gd+*l+x6`{hiG*C=M;w3@dz=a612juqCI
zCTC4is)4_GmRM9@=~T68h5X)R5ag67xz*2h6OENV0c&n8DoJBD8(5#wke4324nq|F
zxPN=70`$!84V0o45}kbt3nJQRmC&u`!(3<W>Uc$+DYjK$tjXRIK6X<8`E`{#{Kxo<
zsTFLE!UwmR>>m$e*NYHS%}Uo?(40Iq?@2>I1%llNxI|A^sTf;+4FL50RzlBkF1vGE
zs4=IU4q-~NX6v<fs;3ZbdT5%&*m9iz_+#R;P&7y7T`+yFA`=eR6g$U11(NT03Yd|<
zv<k631@JERR)Zj}RK89HpMUxC7Fcn9c$oj-gmR87%#`>J2HVyGpKQ7HrG(sNx_6xm
z7ol~1B6qdwT{s(1sqM2#J>)5zGM!%?Ip8|>izfh%K|OE(O<x8J$o=|uJ;@Au#&?t4
zN$dZ^%v<;jUFs~-v6?RFqx1_%%6w1@`5~MLzgke<+W&}tHG34?zS5^hJD$hkeHzZO
zy{VfB-_|2+zzjoHGrzSYv`x8w&<@RTSW9men&j0g{654X2{kQp`W!y11Yb!S+q01r
zQ1ImB11`LceTs7YUC(P8+S?3p1)HJj8~Y|X)znyklQvARqo`vms`Z2fs#4=_7bc%7
zCsZ3ADad~mq(08`{8t?QAL*L!S1m*wH%4<~dDm=mOV*mOWaqI3-=qkP8kEKe(8E03
zKy?XoM&NVx(xva#{&v~v-JZ`eyZTh}eMf**OpL7q^MGRm{f1(4xp!3T9X1Ss)+qW&
zyV8FYbAM~%_Ux}y(AY5a#rj{zT@~K(cZ<FBN>KR+W7qjofCF(smP`5nT*BltoRfyb
z3;8?{>2;7budiqd*{EtMV)p5)%iy{%Xv>&V6W`}Q9lZR=Ejm?Wkp98!B=O4)RLu!p
zzML=`OatJ%rNyU9l>CHGZfL+p8;<2ogg>dgD<Y@FaqDr~wVGq*h~B@IFpR6eb3K!Z
zJ>R)YW*mXJl9cb(-p=Dh=BUnr7iH{LP?&cu+?XLxyv{gDrWqH(K;uPlMP~r!Y3tS6
zCDF6y@t?*({yzN45mZ8}p>yNfsw=}{hJD~<Y?ozt`st%cg9!e`wb*YlpcUztZx;$P
zWyrfxQ38{O_mZ)Sm9HC5CtuJz%vN}aVXTLY`+M_M{m}>V(2pw^54BN7!7?La(H_^n
zZsd5R)7wS7!<=8=c2zyy>HRgs+`bhLlnpbXwg5u5%y`gvY(;;d$8_M%mf#y;p(%lq
zo6-lhNzD~yW)Li&E2T`d7O6mM?u<3DT!y6Xg;^4jH<k^qo$a8;mllHW?p*6>fW^o(
z5n*DpqNu3C!O&0PA7nvdNiW}8A1ApcewyI?L6|N2==riCzuGlc!aA`KY574;Es4)N
z0YJWZrN!BF#$LP=+7%{Q_|q`>z!`A>qmbv8^0qk4F=VBRF@x4OSaiV5#%LWDIi}Pe
zwAPvLFJz#E=q{es>X}n?gMV#ol!X2`Qe$dcSmMfx#{X93?y%2g^V?NH+9Z}AD`Qov
zEFSR#Z*t9eLyckPLYs~yy2Gw>i>JdhTc1%xYMskmN8D)`zffNgAX;Kj`uaW=h!=`&
zfLiL}%l!R&O6=rU$9ilqC_$tGbhY1Lh5=y8<hl9r!qHkY_9xY|l|OQ^%J)pepDO-8
zd!A1-ScBQJ#?WP3N!2K`oPc}<lLHtv`V~$L@u+e-U+391!rz3tYub0}c=LqNE&naH
z>1QG2CPN=Kv4Md2nkHsFui=weJKX}|yf%`Fz_aCpj*7Vv1&OKj>F8fn+Cphg!?j-t
z^FqUak3WjWaq#NB7JXOg-~6Ave`s*)(6@^Nvm6Qz$yLUReYu5{MfsE3l`+hdLA}AB
zE2IR_f1&bS*FH^c6X(&Jb#6*vW#4SST=hJS;C3YuJw*!_<_bPPRr|jfF9%Wh|5WzO
z|CX+W;WY^qg7nvMs>aRD_HBOd<W{$~Z<CHVU*OH3pg0gM=IV8#VgYT+F4WAG@Pu-5
z-wvq}!lp*V0b%+}M_On{NaAVrrY?NNs4F-2R({u7+<4PM{%^Q7?CM$4@qpBPYelIN
z&DoxS|4yUuMGXjuiYe3o7LRmkf{5&~04G|<Qwb~9V(Lhy@7q#75x&y-PS3r7f1%>r
zA0jjvgP!JY0YKj~(L#Zz)|+84gLA2h1Y@*+U!}TC^bjz9jdU(5a@IoZ??=<+V}6MZ
zy$%AbDZ1G$mvyUg*c9wfly~4!ULK!5wXRpLkGGqfA|7%~dRL~K-=}-ES2>MA-b-cW
zz+_}KD-;qDY&N!(SKvQ~#DyMszX|-ex{24uB4*+`tiF>BMu$)8bU7~9U1uRMR$e!0
z;Cd1txh)jn!g5BEf%Z$Zrd^E{T?GU1uj<@Gcu=I3JN;VMgnx*WmHc5=h|8UHSyfda
zP=I(WZ&`?k@7D&GP!*zP2W7OB5GSXUjxq|GZt++B&Y=Jl6xMeROcsGn3H&=wW{&`k
z8>UFqNpN8XS0c~o@cTD643}vAp850TRwN0ZA8{=_oE7nYu>t8n35woJ*JJYh7zlf!
zHYgQm7%OGmqQuCynncMnv@`%Zm%8@-PDaE(7lN~Ct0R}!CPVwk54krm!37`~tF&#9
zwjq0QGj!3v&-2^2srIy>%hx{_%5UakJM2c?K1emx)Z?^ioN2tNQCe(~95CFuJ2qM9
zS!0bEV}jfy<_qzjE3-{dWQ0S2!L=+P(FB(-P~>~I-x`_4yu;dkbRN!>wNdvB4zHjR
zPRoxWCD%U%#;=+)KO2L21u<WyU932HUYmZ=p!o1<PDd;70>EqBIyku7VP^K>_s)~5
zHLv=`JPu6|l{O28;Z~Rw1%S$tn^@*G;Ls}IdA{d{gIoAak5IC7rh&+oLTQj9=<N~1
zN9JfZ-*L{>{vO#3d3#E(cG}OpX4f}jUf+-ZhNIjEP?If&M2sZN>4H0&Ief_d?v4c6
zqvzAcdYWAMUUwD=ENbzc6qI<^PlmINR*@&3e9x>7ug7=8`-B?&Q!))YTdjM&_agL9
zfC)#c^GxA=DFVVm{HeNT`zKw*<kty3Q5l?S1XLFhHYD#%tZ{JE15O?#84Ju$->O~Y
zpUh^#|4z(3DECVWi@1h4bQT7Y@#WyCjp0aE?OwwRk9TYhaxEVood?Fi8QxqHi>3+?
zLje{tTzf{_d;vZ_e|aLiK=@mNa0Sh)z>0K|i$TwdBes8V-<07t8JwxE8=6~5?y{C4
zZd$H&AHq6%dFZZz=jABl+Vhg+AI5Y}$dE-e5ie107rNS`H#Op1N@aTwtS{l}9k6Ny
z^(aL!FdZN%`;A+_C7hK~(+FxPSK|lELswuss1;Hp<iZH6tXKWUkEi~ot59mkerdCY
zIZd+$cV1XEPazlAzh#F?v`HW8qJsGVw%@QtOvbHGTMWW0OB2>%1^t*dw7J@0mR;qm
z%hz2vg@MlY2462+Hs7Z8ud0KdLaPD?mAK%$?^;{$SLTCD{E_sDq)cqL9*?~l!^_i)
z@&=2&Z{IaJFN!6df!)%31AFO=<qq})KFxhWpSF_2N>9qs{~uMP$~O)XCPn&R9ftr^
z{IO;X6n=Elvpy$I)!7w|X&Icl)cJVX_r<qSF9$sZSa=+)J7Q{|z2|ELsyLZGFyfKY
z!`r($tPktc2UGB~7+e+)qD`fsHVnHPnbp`>#W{DdOoopID?=G1Lj!;U9Smn$w6I^*
zXd?;Wh0htyL5CG{)`V6o?tJNjU3T(4cR3bT-pg%`GgPD386}MJ-xE_>Xh=l^-S*(F
zA-&%bGG>d9PN&9QYy}}X80cnLN0<8PWi^t$;2VU9N|BFJjbZFlLz_wo*)~rI34nUt
zpOf6H9x1%sosBA4D1+-;48v6k%|QpATE;%l!}X_)>{O0V#as%|!?3CWVdV|iFeLkh
za1(Tn2H&rlk}|J<@~;CNjhsyqB(s(u`ok(@WV0h{!{eXl?SuMro@ho$=PoqRUw|gP
zsX;=GK(?&(bKBTYbJHxd>aXVi(_AOxCxlS>ttmmQdqFare17s!E39IzWH;SJoe^Fd
z!htc|R11?~?xDx2WA)PM=$?!3&p$lP>wG0zJ<St^l?X2e^5=FjyY)CcI}*7m65tbX
z5ROo-pVH(vBFn>qd9Cq-i}{Eey{>G*jGFe1-3JWVZ+4^r;r?|usTpqSEVA<*DXqfE
zd9n)aV0K!_ZxiHQ-L@u38>ZPdM38Dp=26n-kS#9&bP*Fy852c_k!yq)<Y^cQ(yq;U
zVojh*7V5qx!#B<Sj0jTwm4^D+;55lWrs~*qeT%^TquZ<PTc_uY)%O~Wg(eJdE)d3@
z=1-JzVg_GnhZSWD2ijR;0<VWV5Fa)*x+Z!@n@@;j;fP`>AA{}z2EtML<s236$4P{s
zJbUNL8+X}7`a;M@g)3x8W+l@WzNHAo;rE>3pRLyNY#o<j`s~Hv{rxjn_M<=?pmy|J
zf1P!INA(mfl@570b>UzndC3mpf6h-bV2LIV)3d(rW?F2LSLk!NM)qSQ>@S>FySU)r
zS?Dp<c)1mS=@~(Nym@)%Sl4HyG|9OkS>c9%(>q>MGIK9AOY}b;?EL6PTqxsLzya!#
zyAd6iq%_PAT^iGj<UhFm6)r<|sBL~HVk_jAZCN2>!&fXI56#c34nNKh90XtY7jd2b
zj7bwEgqMH^n?AFe-n|2-Tc$Bpo*|g=b|}w7zn_td54GR*e_v>3+92}yNf$7W#;5@l
zUNd15BnmH4#mwE(b|FOHa{~wcfK#zUJW)M~8u`(2|7_oSzjQ>L+E!z7kq+a}Q!WD+
z?;WIti7sx(f!I}lXO;R1;2FH8mwtUKnWQq3R~tj5-Q5yy9wFl-f~iEoCGQ;MQn-aZ
zRq!Hfv9t>RcHt>4wi+#v1Kt&aWzjFQtQ!Ij><wPVzf60@Qhk_eR59&QI=({yRryUP
z<@yOud*yEk43eZTka}$|OueZT7(t|)UZ!`OE*WHx*koZ0YEOhXkU{E75X1Bee#)Uj
zelD<9B}7pou@WIFRB9CGZf3Go54v{wVU2ODzwm96W*SiNwJ{F5apRycO`Fjw`)O~(
zmLXm%#?nR-gfmnzx3bA!-+ZuZcr`)m$mKv!!wR4U(qfOyu;@(qsny^8`=eJ}su6f0
z-6Rm^xg)P}ZldJm3E8Sl)qC4=n*MnxT1n93;_RSb+3MDGwuVojg9NJd7<0tbHG*T*
z0J1`#F2QpaolM)M1^-qiuRfk5Z4F(Pz={dwgV|XJFUxegVLBc2E>uwlhyF5}*;}XB
zf>Ma1Nb;L%eG4e(E7m=;_09R}|EAIU91Kj%==XL|a7uvBKf7S4Zdc-D$Dhmf9q%Lx
zV606H>PvW(c16XFvi@yUc#m*Hu(S5BbDKhMw1h{&Jx&fVW=foE$j$TrO5=J7&juGy
z0kC_@@G%Ro%8on|9Y}6%4r7suklZ@)&63$fU{KsRv0lmIod>kmv!R=W*L#h`^8y4b
zfu(LmGRjACSPs$mI_eV47NLzkgIAk+NHJ-}?AJ+xh&n|C_**B2v~lHwRWC1wno!3-
zm5bXzpS~yzPoYb`p5B5y{ixT-H^$r2wORY8g952C;ZY~eKYR7O91%C37Ul($-e{8Q
zg=oGS3c76=cgCB+|IAz%ScBdDgg~+u;*4%n!uiBIpN0B8%&581NkNn*p{TFYA8{5p
zihP5Ow8MrK(u+n&vZuRVVG%zi@I9IHjwT6%VNxU2J%*aA0jA|CNdpF&G3Xc8s+`&}
ze^pt{!Jn6eB$>_3TxYsvVSvOH+mAjYHn_WPGeHN;ZFod%I=7^V#(-OqP7zBS^$20M
zCkd$*_PvtnV-{BmVW-FrkmAuzLM#$&NZF_!Ck7%a&SZUOyC2p^F3@?$oU0}@TG*HS
zdc83C+fV$%VMah^6KRoX>mid|w=-{L)hENM7{~I5>OWpVxb*E^tDqkVNfENa#+(1L
z5gCB8j5OPj2t_HQ=|}<nGXK_sh5QDVHIT;-v1U-<QGMJ0r90h@jwQx4yP&kPYa?!&
zS+pJ@YOU^qH@SYt97(%$wsvFp1;$K=85nWR3-8Xxgq#lH;Q6tNY5q%E(!>q<UoL>D
z&_ik}RvGOE<TmH%Xys-fdxZ6%z0!p-hN5EVl@VJT*(K%=v3i>VyB3r>hb=?uGJw8f
zr3{w4q?GsMJh4!abMp^zHc)Rmd%&E%Kg?0Kq%qJsdYb%j`Zhqm$`aQGXNvX9e%wpr
z#RQ943un1%oB;YsEr(uL6sP5{m*G{?-m!T@tgCa1O_~%x5kw>ywZPrH`bI$Ea?qcn
zqmLMqVU~sxOl_<tnBF-%M0yBkt#A3S)bvRU6@8-NgQlDHK|jSHCCcYJ<uVLPoqz1(
zMf(>MTpRp-zw`~qj5eq)nCMTS64^Jo({rs@GYOjezA_B-@#AHG1Tn=FPNAD>ht8O|
zl<+GvsY<N?2Pkh@zudg1cBl+r-QsidUe3Yas4%aJ&;+d&?a+Rj^G#{5kiqoNRrC7r
zpFd~=4#L<KMe?;*;uV=W>DLYPk9p}r+1(IN?6B!Kmw^aAykG)TlOtu5C;wb?24~MU
zPVCnxJGM&)d?k1m7auSOA7(KBOzqj1+0EA15`Hl!tq8T3=H<#0DrvmFx)TG5wFJB>
zWtne}4QEJ;?iw?2`1p<=q&5KLFmE~Q+@x7?L46Oytd5meE)v~U#=p*QEAzHZI?Z#f
zZ9AGk^vX460mwM)!_})p2=SF!M>Ci2mT&=JgWNPAcTnv!;dJJD6=<`}!zK7FUpiw(
z`|y8m8U1nguT5pz=Fn`nOEU||j{mwAzwy;EEfKm-V=5ZP<V>3lWPgq6HtZ>-{c>s1
zd18vXdoo&msBsCH-(PL^?fk`Yj+>}=rxYIEU_)!lBJTcU^1#d_q1OS+u7fD}j{_%H
zBTxM1bFA&=<<8-z9*YpOr7EXQ&i|K1yqEnA%R_$S(K~HO)UB?%>`h1BLDC15cCSdV
zOL~E!TgGy(bO(ogK>bvZ7dO-NWfam@4}#JCTOLS2Dq0(|LiJrLb9kxyJ~Zo-3^O8H
zIEW%@qL(uNf&tsvP!a2YkVDJs8VkE8ovY$KkZa>h<p+&({dLr9ZiPF$=Zj`j{*j+_
zdbpPFo2z{|+cd1r&NN`NF}OBc_Pk`i?Mg$8-^w3_cxG~NBB}XL^4lzAA9)%IO|~F@
zGk0iLdyY8d)QP`>3c)eAI^j|M9_PSQpdpPaV?sp3R(>8}H;8Q?O%lrLvnH-6Hm|}h
z-+{i6dg9<)5kf=Cz{|wA8fDFymjAnf6O5k#09hI!D8rwfWq)r7-|z{&$Z%CGA8$}^
zlru@+Z_&H(hWtGe{W^MC>oDo<=@qJlwCMR&bkY&N2dAcq*2#_T|B00a!*mnn*=&|Y
zx_J9?Zd`DE{a>Y=U}QNBL;?O-{OFO>u4+f`H_M>Njp50N*k&jqi|VHA70_AIwWbM5
zu97JBMTba2yB%4r!>v6_T(7v(1NU(9d7F7sQl0k{KUsg17hWE^I1)UVMK}zTydhhV
z8|z60XK5e_Vx+~n{Av$L*>sf^oDd(+TqzZ;nPZOO@^JRge|&9p5r3=zJ*Hhh%#>nW
zJ3wQ7yEbF}?6c3X>j1MR5>w<r%pXqe-Ud@j7Or-DBH&Z!KjeBq4l&PXJ*O~r^P9t|
zcv+m$$0wg)!Z1{e{v6B%u=%xw8TJM}qvfK8-Lf#RKGZIm1Si{QwrL03a*iH(pP*rE
zu=6Qsc_PpBH%yahlvvb%9?@k1O;3ye{!9}j-G?XWi&|PakV?nvb)=DG-AP|>Uc_G>
zWEqQ>aAxns!qkRs^{3W>^^y5&nfTzXE92O!z{5kHp5+!t(+e#`6_53QHn9sE5si%;
zA36J4tk5mC>y0D?+8}8mQs3Pa`xe$2m0%u1EjUh+oj+BhqZ+!}$;tCY;o<Tr%y-22
z1RzWNXs&qz9Oc)gy-muL-ulH#xrO=<s7zVu_#%9Wv4p-rF;`YoHh3X}6V9p1`HDJ`
zFK_vAD5B*oga-I!Pw=gbGp5g-+0OUon8E3uV;m^eb$B6^(IAa95b?Ky!znXe7GX9%
z8g(x}M4r|EjMHWq^@lq7tSbFI?|PQKqHdYSa@lIK1T;+Ig7waPu=IB#?cg76dSRt`
z;Pytl3%VCZI5GYvwSZZB6$eqYG80g##QR94UWQkDyh=U3x`&vTw{0-fur16IH__)!
zpuI#|3!FHHBGFHlNRaD6#kE$1_ngK+YB<UgH?Dg@CGEPHOMUmtP`~|s_|s?0k{UKa
zVIdx#G^;TdUUCJB`%{BKajF*I<9B*qZ2v)o&p1aVNZ5f*%Dd9B?EpM%K<8DWX0APb
zedtf)oQWwJ_%e_I-)9!5V}2H=tGIpB`RYSll!x=Gn86BkKJ0!9&|!%?f#JB?*Fq2*
zTa{Uzwb+jr-EG^V!|}yZ?sAeaN(?BOzXM=`p6+*q8odeheh7<kPP?i3%vp|v?J?V}
zH|y0mNDB{df4?)d4~Y4xR=l2z#3S1_BEB9g(YGF?rqQLOz=1G8P>dWkwEcP~$=%qW
z?3IU*y$rv^5X^TFbA@Lp)0yzbqMp7KIfs4xMh2kr2zLG1nH;({Pi(+Ph!WkUPry5S
zlD7I8v#t1PBKp^R2O7@mq&XdkQqPfb2Ma!(<TJA5O6qCDu%vl$^efY4=NvMgyh6Q!
zyY|W)kL3hXV^0QypKn?qoBDXeZg~uUSuq@>ZYMD=y)t2EL5oe<vX=q#E24(&c)wd{
zo#C_8&RQcY3tH@nx*XbGE{IK56~5@E;T=Eu?M8b*irp?DNbdDgx~%%QpBS1FcT@mA
zpZU&k-6Wd)JJz|1>+`M>l$y!|T?o{lE)o&W&XE?X^m?xaw&QU{@U!j2tf(LuC~p|8
z9;ZV+sQ_XC<9{Y51I7m3oCD0aZC)Y#gV-8>d$0@yzxkUM?ZCE@IvgBs-MYp8<rRl}
z4uRki(5d+CEsA;TPa*oLyRo~JkLXy)eOHT#f`h@^f&@S5b^a%gwWxqGzf>2Qmdz}8
zXODpAy`A!Hd62Ws{>AT;T8*;yFD8`c8htpiAzATVd3kl`aJZ#>3eDo|N6Od`*-;09
zjS|04%BIEH<nazVtr_b<^#XWqVBTtmSg>a69<&UDbHTIEDN^E6SSCL`@0|9V{J==q
z+JqI3TFkx7b9$_dEU}5lDc(0SEe_zGjI*@t7&YhA-_^u%FbF4W7#TOcGVhuOk$H0t
z2*^rqBO*B5$VEc!G5=yddfs(5tM&A*R1`1?zyrGGvLM71)b{uje0UolR1H*}F(NOS
zy#ovLJg26RYb<dIZD@DWzlVqV<X_h^DF1mgf0#)xVqZ38)Th!n1C-3=;Ee&0eH8%R
zy@3mjV^RU8aMC8%GUTn(X9~~v-{PpPGadZ`*enmV8Oa0@6?x+q4Syat;z#MHoiz@1
zu~8k7i&F?Fy2eE;HG23oW$&^PP26q6tzI}^O#x&*PbQDgOAOWFC{$d_gG^K~=)rO5
zy5u^FaF`E)LqP7cl8uDnCPM+j#lc-le2TdZbHOAo3M1_HWZ(wF8l9O_Ond&HKYaL~
zgK}j-e^=X;epd&T4TMTa@t`4x5-E{RFm^lhIW(Q`m%9g$c75x5453i!%oEAW@-kl7
z)lk1kqaDNvESymP2+XppUsijq6vtWq(E2}DTJ&F?w-s(3rFk>jybO7nI)C3l91(po
z9QFis38z<%^4gf}w1U5sktAo2kASoQhd>Czl}}_U(nxGg7c?ix3~-R1ybto~^9$X`
zNjmXfOd3<0?Y54vd|U7to_m6wXtXTk&TE-44Cf_PK>^vu@#FV<uC*^;N5wV}Hme{t
zuWQ-$E27wD%z~YR$Z^uyrx$YCMmQe801Du~9{cc$ji@I*aPa<X=~hR@^UmjI&Mp(h
znG)n(mU37BhmL<f{EaR9d!r6=p|67sTCvFh6fDP=0jjE^KllJr$ZwbcI28Hn&VJ+?
zGJQ5@TkE<YyEIF6P)YY<h}7;jL;hziee4e9Xn}41z;7MzqkOfbjJf<7Z_@+n6!Bbm
zf9+`D;H^z-9H!9BrbLH68q17}<<!)yPZ;yZ39j@xf>F(8F~f|!pe8IaUqobyB?Pz4
z0*i|5YKpO9O~%3iLy=M43ICCfV)cWp@@I(rB!)3a!%&+_R-qbD+Sd#aSX2N5IkWP?
z=L&~dXS<5CRe9GQR>0JoRDe%jeO~E~fgOK>^G$I_&BjN18ZRwuTZ5g*SX=c-nTu#L
zdUr0iZnLdCb__o+P^8`<B{tSMp!hrSw#rYrZ@wuhjr^e7e&D=?_m@nj>xne>Wjc@Q
zrTlIdhpU1+)C9OG@7Li>ld^+~!p})4uWIeg4e@bX%i4}u{=>bCvBUO}jb8jH9ZRD}
z<B5<uqV{PAVZexj%Quoi66*3s+Tbo08zX1Yp2~c>>Sc}X&<*SlVW@aO3;EY$Fdb;2
z|2GVSxw&%&@3N$0;@Z-%yv6TB(YL$4GpUQQ8D+<U1+gm@(IkN9m%laa9~%m-b#Bg_
zR)Rr%KJnJk@esKJJ#p#Hk5K9zX%I5$Yq)3rXQQ%k@D}qMX%LDN3{;EaG)ND{@1v^(
zDJ#K=H9O_$K)iLt;dcpBZoWjDONL8^z6X;JzkWSTD~WcVO<!NXbDd6iy?-~Oq2=qj
zOsv<Re~2TkJQMm669@GAtk9@?$-i1zfot$u&H}m5|Gpgm(W{$+dAr4igPSru&Lba}
zI=7$;WWS+SKx|@akQ^(8$=E+N0IPF0!^z8=B0WE>gD5d`3Y0kd46J(=k%N;8R0So;
zO#@T*z%xs^>VBNtlHV`)9zR8Xa=DXMS+^s|A99ExM=8I^=p>dvDo7DF9ffNg=N%NH
zx~jiHGFz_T)00U)nws_T?Nsdvxjr*`*RF&x*v(tYECyHv2JdGu2qzgX_%2Q8yTqNV
z!lHR|6q>C2_~7s<eH%~hZyFjV&v%1|`~B7-CbnboAtzOW{KzW7WD%myyC{SEF<dIC
zZx!tD(Uq5ZUzJEzHAkC4#-!dG8Tx<2GSE;H+b4Y;guztWy4MU_z$bvM)SGzd+s)XH
zB=_cLfSVZKCEg{V!02Fd<@w6|{u*H*9cwZ9U@cZ{X#n-y7lDb4ifk)mohhP)dP5Cx
zK7?~MKQP1Vu0PvudE)E6oUofZM*n!;4jmIA`eb*vbm0Ek)FJo9s?B=t3cnyfib`;1
z<edRAQ|vEg3pSW}<N@}h%`rpm^&p+*!bjEX*V*eN=woBiuT@q^T=S=EchUOr*8dP9
zNv6|sYnZpRH{jy=q#LJ(=k>wA{Ijr)9`czBCo;pLIVd8=Z4Pn~JkXrC7S*n!mgH+}
zq3h?h`;Y<CZ!7oh%2Q)?I+bjM=SYSp1%n6cz*@)D!QdJV4l2dsyrdvd9FT@sBifcN
zy!R@kh6!cDIKP*i78ZoegQGs<1bKGYn6vd4<Od*Dk797>AX&5`Kq%hWqWR2H6u!Ax
z<4J8f%g(HNbFg#~(0~GUaezmM-~EwN9?JgAv!E4=Avw<Yu^csGQt*Y|36N-z&cx<V
z0u3;NMlxf-(DSop-MA^5JQPo5#x)%OzWy{W5LlvAFoC1xXi6nGh>ydIVCGN{fi%B-
z!}T$voQt@G{$MiSYj~(i{k;b+=B0|ndePH}DEW!zZP_Ogv3(-C8jh@Ct0a~>-cur6
zvF1*``DtYr*2Z<a`7pg*P9-nMhOX9V;_ko;fOCq=_efjjd&z$;l%TIf{C!Y1Y5m|%
z`udAIj!Qi^GDwZ^6a8}<Z3c1OUb{&R?If8-zn|7gvPHQ%xHLkNxqdW%);7D?ngN-{
zBp}WRY;qvyh*qvYm;?$AHksn1)y2zO<|lS6^;x%?rF&`!RvYro7RCazrgV|4PZBLG
z1DVmI!6k3`N|IOgyL?iK68+jCxUzgimTZU_FYvU{MB!wdzJOUzCcA8ii?0?jveP1+
ztJia;*?_o><>D>j#}F=-vp3*O>Y98=^@1ipe0cszj2>y4pONlvo7Nf9Pf=`3hn6d!
z@;0)F%<%X7x@aYrkR?*|k7~rKDnhT@jS$tgY9dm5jg)JCT2#?9^gBF!HmxkXlvD~#
z<MVX$Tn|5=T*Ja~QC9-fgu|UWA|GJEs(7%mvhd$g`@$u`NNH99r}EbcixXkQ@gQn~
z3B@sM8|YCGTyPsam6-W@KiA32GTo)&SRQ4+hgq4ykl>y2n<3wPbG#i`TXr};ODT1-
zTDOF*KqSCjmDAl}3;mw8#9A?Mqp)6z=Wa=iMm>Do<U}gy9G`!cbSiW4NW>&NRhnkF
ziB4_KU!wPY*34qssSxMrM#^}IIvmJuKe9j8N_-ifOSJ<_D@X$ds@r0LO(Z1YNC8NJ
z&9o(@kHw^Yh_8@t&08+9IMa5t;&`i8;Wg<Rma#Cdv^bG?X`?d=m5^(GiLt9_0^^ob
z6;rosb;ME080*E=S&4nJk~v^2B!rV5i^MW-?3_5eBHrVVZZ@BkPqI33dtr0CTHp^J
z<S{tB0i7NleNoeDCI7?4Qd)s_@Ruwa(Rk&URUkS_yx?nfd|ccE{cH7490YXh4TE=O
z6Pky!PtsBAb;TW_wC<27vr7}bLlO<UW%a<(6fiRGn`oeRyYF{omV>DDDjZC?BnS$F
zyxYsorH#u8Bx-*tdOZQdia6(~l)Ei+n)T0d0CN6Her0f8C;6pxpCsonF{g;vz3GFO
z8@ZSuj^k@m_A|VXi=tI*Sg7S(^LJ{B7RuTX&>OcEnAr#RDpp8~CaS%HEv6Hit7&z}
zC_Y4*I;lWn`Rh2*K20P(seRR2C=gXsXO)WvWjQARKSGj3n929Gsp{88>og9lsKxn9
z*lYTDm~EkCTr=6HHw+*%FeY&vrwK4PjgohiYZ@uP+d91gUv5vv(0UsM@K1vyS5eGu
zPELHnnmIym3|{?db24}Y+NUimsTllWW^Cb8@Gtcr`ckPunE=LqHfVaNW&^lfXT|t1
zIv-v0<@>|7<d;QN@QVh3YULM%;F5&^-vVzCp8P2agzvOkkx-zzJVfNrub)>1zEdrl
zwzk(*^u$A;r!xY&&jH*A?8a}K%jU)ry-3_fy$V1<EYbMtP(hv+7h@Zt&v_^32Kz0y
zgaq(ak`R6Z&Jpg?ga$aC!d4b9U7-&hT}3y~#K*SLgudShV~spC0l#_z)nQ?=9u09!
znMV`)(1<h*YA*{@u;rf_rGm^N`n8e%o@N0ON6^cGu9V7u^pYvYr!<YVse#g?{C6Bm
zE`#}lu+M`@X#<gb#`t?_W$L<&nD6t&A!D*>sxe3b^^OQa`F(D}-4AuooQNUXA@Vtt
z$a3Tah$J1&2fB<`0dZ+a6OXwSGTn71zN~eB+P)~~Zo2V&VHQMhm*5HE!HGxSHac2N
z8|Gshx|Ez)v*mumKBem~A~e+C`Uus$xkQ?T|1b`|uRV@sHf}Pa_$g8FbGARi*?U%~
zAfu_ww2qoLUOgfW=&|SCY*Z#6mhqS|o42Am6=KFo>O!pnt{j-GEQZjqX-qD!rDJKa
zy}Bwnpyux4%MwtfwYgEt-|e4FN=FWi5|Yp@lwVr?(=R6%j-L*dMtk*H5u?P|daO_+
z@5j4$zL>m#n{W!glVOi}K5TTA5dgKt6Bzl5-V7`$5lozy9Bsmosxoi%h3w(I^p9wh
zJ|k^(n!QEh2fz5LuQ3003U_n2M#SkXmm@FSN+F!5(=eiUx6~K((NcWUk<JgF*>{hY
z49fEAuVrH&v<*wpMFC)ZFoH;=&j~jwp6E45u>cBI?n(Lf&?7qu*Z>Mw9`N<?(j@e=
zqT7Whrtg*}6Csf*N`b_lrE8w1wX_dT9IwRnE=*Kd65(*B$}}*pG>j%3gNcSKG|nuy
zU8p#lR8z&jqrs;jU846S-CF4hFx&JU_UdK^|MJeP5nPHK*d%q@(*l|-HSpbJ19S|f
zI~O9BZ<yE5iAeC@bl#lg{P1^(<VP!b{EF+3L_vY>5vT%We!xe%3U+veo`zUbk76{g
zLPY0XFpSI9q_M7ak~{mDXm~APrW6u%>9M(;ZR7BvMlC&&vTC(y0UH3#cLM8-qOuMy
zD`NjZsw<X5|6{vXSA|J+mVI<3tkH5H9EePw&<vjfb$Ffa8wVVif!?RLNYsNeQA8yp
zs%1C;=-(u?_({I9R(0UtzlRm4Lv|;v=qkbbA=<}iW;9=htax=;|Jh4ZM^b9+O4J>x
zLi(4Iak=^4U~=%*wrL7gzLWeyrf3jXt_H(;$FAG0Rx(!z4Xz$#sUZbZyF;03?4$83
zQ1#)d(g~41paN}dnN__xBUKj=K1NBG+>nRizHtn29L)kEA@M`cJd_U?#l6uEoJhaZ
zP|Q0Oa>o!52@r}mMkjALhkvPL#CG@)%c@-!2oVqRlE2}#r-(nP{70nd4WO1_J#6Z>
zB@d%QEFG?bEUD<j02r6?bzM&@Kyn|B;i6EW)+IETZON$B)XpY>R2T7xSGTIRt4_wI
z$a3LJ#ubLz{veijC&WS4FOeEZEHnhR*rJqK;3B<duX0oW8KMO?3y@nJ#IUd$ZyeUF
zY?0UB|ClZmlmQ8rivdB30PY@Txbcv`A&I`rbyBZrsd0fZa_?$LxNudyX4RD%kEDGu
z%tFv~rfGSk(~B{iROV2RyP3l9xTZt`gM$MC1{r}`<Gh<{-AE{S!`733P6e9~nTOpP
z4R~HzQtFvnd!`;2_ppf39sD|7DkL|3E3+G-dDZBL$vVaS1fjN$H|9W1hM=&vUL_TO
z)KKo@DS-a5!3!yCEeIl)*McjpMedbr_r)85RN0wWTO6hqn9hj5p`?$;s^We8$Ogs#
zYqKe0%@6KLW-8QvXA&$yj5IchZSfr+iyE>qN5EjE0Fs8k`}$FR9t%p>53|2h>e{FH
z&HCdNblf<9Y`8+L_kb<Y*sD_>VUv_2%O)y9{3?9@>iy-@mJ6q1`A=s==FwO6EO1Z)
zQE?rToQ~cxhA6Pi5o{qt11GIi$?8sLhn1OSQyj0lX8$^<#Fz?eGI8bzGBkoYuWZnC
z`-3xpSOa*0phoT!7Qj2c(CW1u3_HaMc6uXS&BBVL+H6|WUGc7v3>^1yYpED4j0~ni
zq}h1m)#r#2Ebf6nD6f5IWMpxXLItx19dmXj9;NM3kQil?TO}m$X+wF342yde{A6e~
zOvG*~$tT5_zkdLax~74U;D<4e_*p;!LVAeIC04kMby@u>9g4A9;Ls&bdFeO?-%*`f
zWP|Hn*!btXIw>4$ERLiwN-h<xuc_&82Mv3Y!Q%?p9VVuQKyP+f(Q@!dT;>jqj&P(5
z$pGV~8(h}>fYMyTNya^}hw;>Ul|Tto7D$AM3nWLl7oKMcjke!K=5q^A7=A+^5Qs#r
zu9%ozijLG*p?FMNtMQJbM0ry=A!j;fzhNVzm-jBDj{j~<akySj!Ue5It?lZ))jS65
z$EjY>mx|QTefH+r=o1=to49uc`~%6u<1Ndl?0hn7`2%g>>-(=#Q5hJkI1YGLE0KF_
zT)b4L%)+{9qQfE(DNBXXeYa+*ypM_UZ&TXqoW_KgX7Dp^UjwZ<Bg(GdvLKAfO=L6|
z^5gx&MbzZzsp==9#;%$8wZ@<hiLq9M4tmZjjnv{n*jN~gkVsUd#=JTgW=#UQtPwlG
zg3FD{m>W&jeIaJ{H0}3MUdPl(y>~B9Y=Zo#H9!G^;d3hvtR=GN(T*!MR-govzeIgD
zJ&JIUW{>uEs0Cg~N;VD=D+dZu%DD+q(mzrCsARy%ffe;A8qHpC=A-fxCzgZ=Nt%h6
zq1bk#xjx6MG#VFQxKg@}Qt_}H!_kl`&FiN&s3jB~Nx3k~D^viJl*Ybn4iW<)B?8g%
zvaYP<2bX}z>$Cg(sh^TmCv@H<)bI8%qy97Xv(y*QwL}S!h&Rcfb{LWAi*RP){EA#!
zJ+~$o9{HC6qT1yMsZ*sz`pTj!%!{~+=#4639bI*dx`Qq3_<3DGD%w*z$M3ks^C8j;
zh)(@Y2%u3Yi4KMj%MP8!$u^Nq2S&=_aA^_AdF*+iA?@6M!U3M?>N%#Rb1S@4Ui8D|
zpcxW0>t-*r;U;g~$%_?3#dy^_`^9i=j+ge}8y+|7EMlfM3f)&rO>~ZZW^p=|H)KN(
z7WvbqUzmx`*sm<puKi60Np+A>Df2$Qq*qcd8F22Lr~5wLOhzv+5;?!Y#9~klTxZWS
z_S-}~iOq(1Tq+F`CpSReC{5kJgj<Ib8;%kl9HFT%j2(~E;KFRr_%Uo8hhTA@V9`8p
zbkAW)5kFznTr{o86gCR?y!I(}4mb3GP|HY!<AXiek0kI(d4?c_<YJ)(_pMWYd~Au4
zb+*?gZV;BU^VxXvv(@QK<~>7$PpW%1@<*_?dPEZBOd4Usq0Y-OZW4-3;bRhS(9H8;
zp`g@we07bv)ODbx*nND75lygvTTEU$AEqfFhS&b?laj1^HcHjJGb{O*rgIB)^$Cwj
z|7M)%_fQw5bkr)G@E>T(?s=$Fcv95K$N7XRi(xFLc`FuSxS?sU6Z!ATD@N|Wi;JO2
zDoivnYEBewO^9g#(Wf?*Adx7q@`2Z{ERcC+jW~_x_Bo|q2xQ%0f#**a?YtY{O-=+Z
zC(e+4`}gaf)-SBRO1Ck0cqJ1kn1~s+MMn{NbMkvfg0|7*XNbCNAU#O8mDx#}vfS3j
zoIuwmYQginY6kX0Ag{Qr9?$;7>m{az`^N#C^)c?()|2XU;w9giva~fdzciR+@P&qX
zTk{!@gsZk{h+22ofno7{8kKMOX2yyruio}nfrF9SWw!iqeeVsmG5Xj@b(j8^3$PRm
zQ8(+W|5$aHX4aR2t#j1lk{X%}AVa6yj}^Rf;76ppw-Fdz^3`8PeO4=_HsNwMUeThe
zCZzO5_|^3TgX~kF*Eb%*wXr7!#a18qBK)IjGex+W3+e<5t|s48u<qg1&hnR;k~Z!r
zeNCfE&rLtqg!<}3`^5CUz{dZGOXPr>RAsz4K-S0a@e0Z$Ark2T48D~1WzLjZ%0)TM
zFKWd>wuEQxAf#_{Mm?*KQA+O$fHogAzu3(yXDwe)y+G8l`Nuduyo@32A4>DY0*e_k
zkoi*++ju)8&8`qotIL{W>Dg7f*oU4mV(i~HHd+St^1pNgB@!TZmgD|tBjECT7Fz9)
z@_~02u!*2%8$WIIrm6SwJ0A?#nWO$;8>z$uQm><3;SH7!wG3^PHj@uM+9DMqyFvqJ
zxeD@9)CJ|z8qM#|RAK5%_d>japb(eLcTBv;kAJQ_Unw{Q^{t9t?LTo_Y7b<9Z9RI+
z^T3~eIkKSA-zD=T)}{SPN6|;OpWZ(3z$GU`W$cfE6%pt0N&mx=LMF`HVKw<t#$cZg
zQ$~X#2N3IX;44wfg>Y8#t)W8+M$6?PAr=f%Ge*eEb1G+QrV3iiSOHv;jK76i@Xkix
z708(h#D~ij>7AgEL~(vhIKhkwkE=Yuk<<=j7UnJTx??}n8Jkf^uODZer?cnG`NTV!
z=*vK%(689)rr}!c{-)Utis~}!c3hr?8=j0j(OwFNJHVhqw6V%Tc)KMu>M(<<R;5}T
z3>%v-sbu>5GT>T&ribyUSeR5<AHkrHYs}^?%^M1AfcB-GI$1?|@-i3gONi`x6DTFS
zh}`oeMLm@4LT*hPmUdv}8*j}lFL69~lMIJFRdLb(Yc?M=qFvSx%nH${I8bW@L!V@z
zPBJBBG(9B^AW4)Qlo4Dwtc{3z1+DwheD0)_DPmi4J1MQlP-ud+Hs>6>U>>pu)(4&s
zsdKOf|3Y`RM?yp~vGR{e%Goz)!u#L5d5P85D%~A)Db$)dm;C0jlTS~%?<Fz{<nRMW
zYDw-m!0-@TB3!cA2FpFcZw(UN79&jslm3hUQUN#eq-$?APwd|Z;YdSG3$Ugs9CDcg
z<>HYstvPgleHCN-_T~$}Lm~jL@AdV2dHb<iyaw`(CEq-j!~iWQR9M!H6;&Ud4p};I
zsnVK6#eivUe<ySx!nv{DpItK!2a2SM+57=}eAvwCpfwqZY^};?4ff##w?CN%Dc0;j
zRoSbGT&G*=%PZpe2-P!8u(H(@2%V-XRNpHfIAbPD{VLufvM;;92>GOn3+qLhA&U7~
zku1R@33O(qkj970nb-AbgWn0{Q-p|ft$1CdNT8$Fv`DZW{7jKJhFs2t^DwHI8yfkO
zmLuQEE~<0nI_fG#kYaz7tlkGL$>|V<bXp?q%>5I^jE#Zg?IKKe@E4i_{<tKQYZ}j%
zOrymj@DICm1={-mEAOj<;#%6Zfe;uV41)yMAwfcdZDe2q1lQme+}$;}dvFZ_1`X~3
zf`{O)!QCN)!yp0XO!im*xjOY<pQ>}Ws;gJ`^J+h<->zQ5y_A&=_v)s6n@ltePSQKR
z2w|H-BHjuibcVhk-M`i2teBcjf-tTYYYz-Fo^Vcwm!w!7h;rrE$ksFK9iu_IipMyH
zlngP}Weg1Ix%_)VImM>mqkmm4Jm$Jg#j_mfcrKPOSCg+`Vxjs;IVc+V{ApV23$U!e
zZxvz#)61mHm7nMh`-Xn$7A}fsZaEK1<Yh2np&=NtsUlNxJyW(VOR&F~M3jXMuWK|W
zU+BBE7(VxS$-~0;X+`H31)5l(j<bqPY;=OzVpQ-{4@(wnMs7NzDim>!S55(~5z>7u
zmrylx$X^>GM&pL^ghD>hXcNaN6!WkxrF@mUVrcI(%>Zx&fkqrvjuO{9Z6Xk&T@?4s
z=aQ-NtIG5|{^2d7HaqJ&P3dvsc+5ZTe^BaK88poxxV)cBk>KQSR(aQXl-;Qu$!XYy
zP3&X56tuG2dk55H$7H}BHc;@~tyP5^gE1u}G-_1N#n4}MqoXHMSJ<<|ak`Bp=qCqU
zG?jBVJ5_}la1Y-v%D=T#DVUF`z_{qRP^DhC%aJBv%lU+kbwN=9^S~Kg?{qN}e6GE-
z?xtMB4mc!XqAx|Z<gViiuv9<oI6Ifw*hR4!`I_qB=(0Ds=POn8IHsinp53D*^yS}&
zq7^*9-D+}oRx4nKr~+s0ZEXZzA6dDLEy*f}D>_K5#O2dS`UIv?st_>{TsDTv-IY&9
z!u{)7hvaHaY1m8p=dqs}zw<dPpvJ=_Az>l2%jv<B5w$;6SeRQz-(Jcb37#e{{zYd(
zi^PGZ^vK#L(7}A#vlGU<b{mGf?1P9m!Z+>@)>5U3_%de0{DQ55@~M3Q`xGj7*|A{@
zRWxwpkb?;i=?m$0n#KHu^};ur!=gjkzx`FD$J<PMy=<36zll$?d*lzvp~>0>9f&@v
zB;^SF#>R06D|jP_DHW2}zA{r6nawo511p}JjI{)19hBLr4raRZO={FR7J)DoUL_pO
zB{D9aFO=mP6?IS1fh0r|PFIHyhMCPgljQNbHaoi9H|D8P>p#`(SWF_d+Wq)lmHvl<
ze4S6PRYfDDAT|D$t*mvWYYyt=g^h=XH!%9`+(rLy5fCQH+6GDBm@V_9BF(6!W_dsx
z&VV`_k6KNG`Y?|~sLTYRfwaH=SF56THBi82g{UYO)gf)D(Jmq%qex(RPKM>V_I%Y&
zr>L^B1g3Q`h8n+DMDZA4vgCniVUBmx0u>XcL0IB?(L-XlFgxlsgkm3d-ZLr`U%4dr
z`>3HVNJ_}RtaoH%ArN_w|H0!_4n*RoNYSaRH=zhTE^W6XVo}i^<oJ*sMpk>wKPb`w
zx>lkK`yu_}&>-LEPBVuoWko+5k1;e?HY=z^#oZRrl?lhq4asdc7<mo(%=k)SQj>QG
zt}I+_gGE}+2XmaS&1ArqW;Pb^%f{g+Q4C$e;@$e>r4jcu?f#<<@EE-knpv3C0n>DG
znnHardC+6;=t#0~`7wF+3~iQ{vp;)ZXtt?ybVOL*XxWV}uENr;rW|0cq45|EF}&^{
zrYHC_pP<L~65j(eR0<Dh2AfQR%l^#AXaLQ`vCII9Hanf;tjHurTBB~Ym?-i|^Q;C9
zpA;|#L{1pckB%SCE1>L0cr(T$ROrNlkDYE?82OgFaD$;T&s?JLOi*>MqZCM4c*m)h
zxX(1pNjR4RRo$ky5*Q%KfTC_Z5P%FG_UwQ@_-^NDAfl+}G>&4;W<|MKaiR7-&x!}D
zV_1pMQcGS)W0ptHB&mMdX8fwYspQTQ)V@pLB#?-wcFn`4!yC`$T4*0(Lu$A0^oo^f
zO*5fJ+_v^DuF8C7)~22uOouto`m;ioQd~Da^H2OfH;9uGUug@fcD{M=6fl3S>)C$$
zTu#+)C%0-X6U#=R<c;zN<&44jbc_t5;H%%inT|AoCaq+Lx~(#Kg$mXYjd51ewrveA
zIFGsvpd|!D2tu|@G8K#^yGr_@?m>_=*nFq_wt7CVk~*|PaGFEx#SK9!wOzo2jrM?H
zMRSPtpeo`WTA<9N?IAxQYUd>qTo{?gAQWYk9X6eBqD*hpPX1G{Jb1(=5sZ$h{msQG
z7`W$nq6};#WdUsJwQuyKWs;wkDP&C>H1^N$hRdh0!yi=TN$OG;V-J$QVfX0jB72hX
zqh>YER3w>BE`?N6^BcV0n*tgill5e7vnZZEWlOG<i)M%s7Im9e_zKK>%W_{HrR9<*
za~1srR17oyyS2ZQQHqBHGX9aV$+uvzlx0Q{obi>3X+&})5X2BF`L$cjz&4&SxW3;-
zxhhT5-f6*Z(~N{Dd4T7Le$n<knnHZY2at4shx1FK5X95q*7Y-gsb`VOP~9bGDlO^s
zD<=5Rxl`sx8j10bWlhk`dS?ayZGy>X@ia7nZ!x_W+rq;yr;QhflI%3j#r|YXUA||b
z7)uLT@zDkH;hrZ#X&c6v`t!nxH$3v_Hmo%UI61W3C5<IaS(rab_{b^r3Yw{{Oqefg
zWwL>xm9_(2Udrghf^CSSaB4Fh>N9(B2^zyj3)Wc;oZ#R4S?6!U8r*bwSyFVOSaqK1
zcox$3X<~ro_8KE4Ly+DaDJNJm@Zh4S_8cT1TVR(B(@d{41R(B=>W<h&W45ZbQZW@L
zRuJIREI<>DZ<G|d8n86yVRMujzrM=#0MC|tS1S=5&P!J@@TJQ;2o%T}9}uJL0>03y
ztmbZjhXhgcEcWgTa4p(MyXmU{?tF&iel41hIMRc9rC&etgqZMmTsst72bF!agpueZ
z>&t&tT6wgVR<Frb1ii<08wkD?rl%>+WY#g56Vj)YR;NbaCn+S|-lAJ^jzm@d#K{*6
z4-QAQnw))Xrv_a7xq&zWEMIQFn0!J5{nWG0kjj5*Vs_5z0&+#id7bphm_2kMu4Gm0
zYnB2PWQDz7^w03r{z9Umc<h#p@tt?69CVWXv!gb2ZEru<L>Ub#^pSwHWTrz5gB!1m
zgQCvp?ihzO<u>0!44-~F=Z1l#sA%r?g+yVU@l}K1Y3*&%A0OiWuRo%knmGHJ-X}QB
z_bkqG^AXb|eP^tO<GphhfZ_FO9=_k%H^RhC#hdHnCMtZ@@^*meC&tG@#V;#8>XwI!
zd|AVW4tDpdLS?gK`Yi?IUlu4U&&LeTAkN{gmQv_j9a+voc<K(ALo21Tj;4-{xJvc(
zW~4KChde4?ajB*jocY`Tc!?K`cr>fa2whlXed|{nbq1gue&NR;ZZx43=GX8*ukMzv
z3P1SJxq(`pLTjUtOn3fm%}3`QHZWz>`K-+|kVexRA-QzbsR|p8aNYX8K^ApGfK}Ab
zS&q>@BmGe;LmRLX)va2rNAM@Xq^o&AM;*(=c4r@kJ(2m+R^K(L;DF_}FR9>6g*7Hg
z*Zq~Pz<X=*np}&HW_i>hW>lg1nf1XB^_r?q1$%ZL>W)cD4YGei!Y`@ffYDFicQ8hh
z?71-Pw4M>g$$6JU@)H5Otm_`VVhHn?1f%8`VBGH|NA+R!ryf$#QAr@HL?VWNbjiDZ
zmhJ1bq~<ub?r_8TRUq@lTb~e;Sa|LvlRPf?c<S7KTK%jZl^^S#kcOU{^aQIrkYVDz
z8g6M4A9jegClYgdRE@(ABi<l2RxlhQd(|c@KL}cc%Dv#!GYvSX#-*rZ1i<6s8i`}=
zsT}&Wfx+Z9a{$X|`;84=f`%eL3Ra`B;hG2WTAW?YC&>gVn7PWdo%AEB1{&uCT9v9V
zb`V~9jNJ`flGE230`^Dbby=fCHMN4$I*saj+jMg?!EKDcR(Z5*!g1b^ZogpSQ~wp4
zT_<H6?@@x+bredxaV)CWLI_XTpgor};zld&OA2?JGyD>q0g)Q+(ySlT(OuabdFCa~
zxMvPRlLkf9xjUUEAnm7KGfH6U7;z?9y~AIZi~0m)Xb4y&<HZE?)b(*<^$<Yn-Yq0Q
zZ)0IiIMh<EKN55FKztny2CL0fqzC5QFY3EOXH-xj<^>73^PHxUB6v-0j2y4fu5BDq
z=APj3u_xA`>%Bje!;)U(3Q#KjUf`v-%TYlxsGfbG{0ii%+uPE*EH6Q?jRCT#PnmfK
zU2ki<*qoN(A~wK`4kY&unx7jEk)>K0D@5DS!y_4rkcyS4H@u2zRhVQYt=I{XgDRdx
zF6G71{#`&)6+YA7a&t*gE?g7z@>{>62)qI)SL1)nU^5kIxQJw8bhfb{ZuY8&KcGAD
z3MzU3G)&<Svv}ExJE(#byv35>%6)w|VdC9ptAG`Z0GYlB{qYjH==HwNmW0HP_iZQD
zg`sIsnN;nAcx>NcQysnRdHsi)@^sF|<`s@<40otoQxK1k9mIpy_3Gu|B$V;&{qCF}
z%<6M{VS_wjA{$_iI_GP%6NTyE9KG1UIP)t*NBBto#Kv~ow!NkXcK9ec=cOSybvk;K
z=}O^cs3Z)kHdnVf@ynEo0XzjZ>JE5_BRMM3`qff-#2&{jDcO!GOZqx#Wn|?DxU|zK
z?&sftAI2uuk2^A%Zkh9a+D>cAY3+Kl{r#(*^%hUJ^1{4?kVIGh?Z^ekRr-YnhA(E%
z5l_8(RTQ9LB47B)iz`E#nNi<K842}lRn8HiGT;SZfHxHs7GpaXv|WcQDmAP4joZ_s
zU1B(RC2c91uc?{laKZ`friXEV?6<e)Ms>F1`;G75anK#as}S;fn}q?e_8x61T|z!X
z7hBe^CV{oxj*9Tz4=G8CKYD3I8}B~TCnHThMdJAkWq1^0`F&L7L6al!1XKX?ihdX$
zbrMo4{Gnpq8L!gdV7M&XtlW4+O}M`<vH#sAV=$d<R6AHtPxS5GiDh}3hZw7~8wibF
zi4NRo6iJ_2UTa<fh@x9hFi#Yv!pyzU591y3Ta0B=Oe1_6?4tPDjky-!@}@7kqP@4G
zCk68p3E6=tq27mii=#}^l6lcHUI{LtdMD%Uf%(_kKfBo`23qB<A_N=J6hq_0BLpnq
zEuU-ICS|)R&w1X~@)6cbriG`ujQTSKJ4uMv1#?vqziws48`!VRs2(N@Q?-|M#z_Sp
zJ^u_1H`2~6eaA=-tQQ|{VY;rh5{*s-JPCh(MYMZ8(5Uh%q3XFabY??he_jU8@Q=sK
z!V{fvqY|XmGiteq)eO?W%)vo#Je2{N+rcC-Xy%9UMehgdCE_yllH2}^$G#nK=r5?r
z+xQw*WXZ1t^qyV(2BY6?s*mYqgt*^7)sCE$9llhjEyEhRYLK}WWD5>v$MhsZNo3!r
z(2>$5KWpIER}dsCP52|T?%jLESK;nYNOjE^n;w`f0u=#ir{?KOVrU?19L%5tC(d)r
zGSF?+ZUJ*3V8Qa3&rt_&SJ>RbUg4Ns^o88`e&y%<=sdVjI69}SEr5I(=q>{x6r`>X
zPWOD2wYaP3PAn-jZe-EWQP^p#^;fmk$AA_|nGrG!;r!xxYH}fhhNdz?yrZDgK^&ih
zR%FYinij71ZSE**Ah9%#1yq<aN6%Dq5FdkMcLH%i0-PB%cRWhEqb4>o!Y+y}&F_}4
z3hnzy*La@`1Brck_O2|-4H#x$WZK2L9QamV*Q7NC2dL*47EENa49^`qOxfTLgTunA
zXigLrBhXt7f{UoPu>;AMEZ`~GxygL|MCfAc(yYJ6v!DLe7O=mlr@(WB+jLy`$~aKg
z_FJ;I{t(MMDD1m;W|F|y-&TfythcG@M%i9+NS_+k>iyv$RAc+5Seh1Mqk@reMWkX8
zJ!@t9DYWRFxl~5u!iCg5;Ts%=D6J-OPl~^zqpv4kKl&>+L6L67yp5)LOcOhF)<o2S
z`A-M^XP<M#Dbt3(^zx8RI1tTDJSt#LP<X>K2TR)u9+>b`zh-gtElq!y8(EZDPw4A?
z9Ncy7$#=p6O)-U~+qLNT_jMI(yF&P===|^DhY98zy<Nq3$mL2_WI}TH!tW0+ot|KI
zpYQN<k%@xQ>erPE&Pa8p7Z)6yxRYDq$`eywu=?>oB(_wz%wiFy%uc&!tvtGJWF5~T
zm?c*+*7+*8JVg{84s$`?b%TB;pORnCle(wSuBZzms){&|vfvZ#lX>;)yFXEOaxz=K
zD*lHNpOh2yIzqk<Pf(Hg&4AzChu(B9bC?O!>*muTFJ(~?+Nr~A3xNz6O$$4XAfW?$
z7JvrW?+y7g6X7Zgi%O*aCY2c&lXOnWO2kko9TW>0&@0$qem`vBBUPeA@dZXB2m@vV
z_{mUeMg2u_eas=w{X(TX%sL6I_cRs3%CIz*0vN?^=M|)L-JghZaz(|R69o9|<+SB_
z^TZqX*r<vrGbMf21<PvPmQ1|=9;s$)WXls@<jXeSpn)3K*g{6GIO?cm7;#?r#yr*l
zj%n|`NArNoYyNAD<o}-DG{OmoZvEFp9`VNRPs=oC2sJcR{^pzf?J|46)L+kaf{@I5
zFBVO2kp8GtiRj*Ng7e(7_o14pq4+3u|J(3a{D|(_X;jLEPy_oF|MTAey$(Pc!pFz!
z&dxu_txDN~?xVbOzMI6bj~iiRcftY4KWidarAqpqEAGXL*)1m>e;yxB0{ChCPebTJ
zK^^xy9K}uX!gu?h|FKlef}B-(w*O9)rfr7*slmx`%|c&qTynr;Ky^Hebxi4t+Hyp!
z$&CmE76|`t3_*e@{SgKfdU2B<&5<GKG)(u0TAhO4mn`6pt4c>9|9c2{)$e-cJxt{B
zEPhVU6(79nHvPVIT<Ch45&HIKJtU?VgD~Jc8Fc}cX}pjJe7?5V#JL-vpMG<cf6aFX
zu~%a<=FF5IL&njuMRNl2I)4Fv+$8Iii6!n|gLkH8xS~n>&Dt{~8F=pD?cCp~3(kff
zvBShALWg(G({vp~dteW6ONq<vWF@c(z_?j&$f0S)g9`k(FD(Mj7rEaci2S%ckT|th
zTAU;3en<iaZ^DrGmf*Y9>kdy8$ou;}k${7u^pWSsloqsm!Ap*vG=wle#KNV=-Ocqw
z6M-vmy=1&MhHTCT2B~Si6~9^VF?aebwUyeB%yo*4JdI+`dDlbWyZ+?hh^@LUI8w{d
zuK|7$A8^05Xj|R>yQ+0+36G3@KzLjPc^}Ka`f+#UGoy4|7Q}gTvp2@Ps}p4#!-qpH
z!ZUHYyNTxuU%F!i`kU8(X&DN6U+y=|8GKn)q(gQfHBH9QsjogXwO338L}H5gR6k?y
zw`x1Tp`(wZ{>H0&cC!`#<OjCMP1hyjvt<r?AW9B>MDtFXF1y}$<yHUd*0raBe?g(0
zo)2@ZxsD5={KR`b2zx9?$fuvilUhLa`nZ7ZVZZb7s@k+a?%^~-r0u@drG#q_LiYAz
z<e%!!NAFv=&6_U|O+^2yq~*vw>{0y1zv>Y9R~=~1kxAw`-iNGcAIE)G8P__l+fQh&
zkh4u4SEG*p7vWS6H;AUrc0Kl!PUPbrEZ{LOg4P?cV2Qqdc`#kH_t%N9JCP56fgLr>
zbs!q5^;cIQm)gG}A`h3-oa9#9XRzr2Th2YSxVwra1I>LAiC|c}7FN0=&+#9_DnD&(
zY^hMLzGP-4tUf%Bwh8JxH`UCD$5btY+sk5+hpXy<hwKyIJ;wOA=ezu!xAKN}Qz%$p
zT=&LSd@n|ogl}J<Ej#zq6d^UV^xcn_o7Wx@O=zd<Aq0Ko9LPr+QurQ3+*9bqWq&{m
zQp(g3+iAvf1u=<B>~R<&b6S5rw0<7jN8FF3cUI1Uiy&{uJ-L#I{jPp#F>cCpw5JGW
z3Akbr!ai<BS#<5?_#C5Tj{LahcU?3l@^GL;cs5h2W^HdRgz}Ir&yI_1Y}$|O8>o{x
zc*4m0i^!X={Ot$0$2(o7<NX2~jC8jEurOlYw5Ukrar%Lu#s~UutfoJ|BS>7gJW1_(
zNf%4!dn#IwWawg$OOuTn-W!K8=Nmqrr!$0pacDsm#=LJfB2YHHL)qF7rFf25*q`OS
ziJxShH<A)>eGqVz$8#98-FzPR#UkuH4dc)|pn;m9as^&h>v0R{=P*ZS)@o*dK>q*a
zn73B<m(xnsZy&KEQE_^`>cau1MS1g)V}Orbx!-<XMC5)wDr%|LZu$(7cXI&`zYW#&
zhf!L;;_GX_US-od-;Ch^Z!WDO_`r8dYmaGnh5-*(jvu?JKxZo_{?}o6WI&5+AigH;
z-qc0&UXFN=u46lIyS~@`m&c`Of&Ul=6Ul)4Z^qazILrDE5{{0W&4=r?0F+H&Z@tdp
z3-!HIZCA6pgl7wuu!pnwfaNtS-^UABI-5Yi<6E#l+>}n<aXcI9`RAyK4kf@FN3UV6
zj`LI`DrabUR|Dz(1+d)g8hJCQ<j?*82LO1H9|BYpq(&`f&PEW49b(kOhLfJxUy2Bf
zFfDeDv`G6L-;30)WK=XHxBpI_LPYyP$F_zNeFE-#xtV+MTXSy?KBft!rE(KS9FFuE
z?`<J1J%G#xT!Juiw?<7Osq9KbZ_&P8Bb|UTU2KCOosa`{Kz;oJF<P8X=lWUK91YYW
zOU8l`jk;;9$}~jn?B?gbuZdIAQg+D7EhhO9^N)_%+23}*9&@yTf*i3<<AZb9*&LMF
z@w%}Eh^^{{?D%$@Z*){1e3bF`u$9}AUtV1MZ8hv9^<2+p(RPb03<J;%YsX{7fm$f)
zfuaT0|4+1kDF$_1cKBbm-~{oY{L4-Lw{)N<q`BlnF^j)uags!Fq5lEs>{2rt8X7=W
fLR5X;`d*~stzu7GAfXhh4NX>3QKCxBDEPksEJ-ZM

literal 0
HcmV?d00001

diff --git a/demo/documented/eigenvalue/python/demo_eigenvalue.py b/demo/documented/eigenvalue/python/demo_eigenvalue.py
new file mode 100644
index 0000000..fe18a91
--- /dev/null
+++ b/demo/documented/eigenvalue/python/demo_eigenvalue.py
@@ -0,0 +1,73 @@
+"""
+This program illustrates basic use of the SLEPc eigenvalue solver for
+a standard eigenvalue problem.
+"""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+# Modified by Marie Rognes, 2009.
+#
+# First added:  2007-11-28
+# Last changed: 2009-10-09
+
+# Begin demo
+
+from dolfin import *
+
+# Test for PETSc and SLEPc
+if not has_linear_algebra_backend("PETSc"):
+    print "DOLFIN has not been configured with PETSc. Exiting."
+    exit()
+
+if not has_slepc():
+    print "DOLFIN has not been configured with SLEPc. Exiting."
+    exit()
+
+# Define mesh, function space
+mesh = Mesh("../box_with_dent.xml.gz")
+V = FunctionSpace(mesh, "Lagrange", 1)
+
+# Define basis and bilinear form
+u = TrialFunction(V)
+v = TestFunction(V)
+a = dot(grad(u), grad(v))*dx
+
+# Assemble stiffness form
+A = PETScMatrix()
+assemble(a, tensor=A)
+
+# Create eigensolver
+eigensolver = SLEPcEigenSolver(A)
+
+# Compute all eigenvalues of A x = \lambda x
+print "Computing eigenvalues. This can take a minute."
+eigensolver.solve()
+
+# Extract largest (first) eigenpair
+r, c, rx, cx = eigensolver.get_eigenpair(0)
+
+print "Largest eigenvalue: ", r
+
+# Initialize function and assign eigenvector
+u = Function(V)
+u.vector()[:] = rx
+
+# Plot eigenfunction
+plot(u)
+interactive()
diff --git a/demo/documented/eigenvalue/python/documentation.rst b/demo/documented/eigenvalue/python/documentation.rst
new file mode 100644
index 0000000..dc531d6
--- /dev/null
+++ b/demo/documented/eigenvalue/python/documentation.rst
@@ -0,0 +1,125 @@
+.. Documentation for the basic eigenvalue demo in DOLFIN
+
+.. _demos_la_eigenvalue_python_documentation:
+
+A simple eigenvalue solver
+==========================
+
+We recommend that you are familiar with the demo for the Poisson equation
+before looking at this demo.
+
+.. include:: ../common.txt
+
+If you want a more complex problem, we suggest that you look at the
+other eigenvalue demo.
+
+
+Implementation
+--------------
+
+This demo is implemented in a single Python file,
+:download:`demo_eigenvalue.py`, which contains both the variational
+forms and the solver.
+
+The eigensolver functionality in DOLFIN relies on the library SLEPc
+which in turn relies on the linear algebra library PETSc. Therefore,
+both PETSc and SLEPc are required for this demo. We can test whether
+PETSc and SLEPc are available, and exit if not, as follows:
+
+.. code-block:: python
+
+  from dolfin import *
+
+  # Test for PETSc and SLEPc
+  if not has_linear_algebra_backend("PETSc"):
+      print "DOLFIN has not been configured with PETSc. Exiting."
+      exit()
+
+  if not has_slepc():
+      print "DOLFIN has not been configured with SLEPc. Exiting."
+      exit()
+
+First, we need to construct the matrix :math:`A`. This will be done in
+three steps: defining the mesh and the function space associated with
+it; constructing the variational form defining the matrix; and then
+assembling this form. The code is shown below:
+
+.. code-block:: python
+
+  # Define mesh, function space
+  mesh = Mesh("../box_with_dent.xml.gz")
+  V = FunctionSpace(mesh, "Lagrange", 1)
+
+  # Define basis and bilinear form
+  u = TrialFunction(V)
+  v = TestFunction(V)
+  a = dot(grad(u), grad(v))*dx
+
+  # Assemble stiffness form
+  A = PETScMatrix()
+  assemble(a, tensor=A)
+
+Note that we (in this example) first define the matrix ``A`` as a
+:py:class:`PETScMatrix <dolfin.cpp.PETScMatrix>` and then assemble the
+form into it. This is an easy way to ensure that the matrix has the
+right type.
+
+In order to solve the eigenproblem, we need to define an
+eigensolver. To solve a standard eigenvalue problem, the eigensolver
+is initialized with a single argument, namely the matrix ``A``.
+
+.. code-block:: python
+
+  # Create eigensolver
+  eigensolver = SLEPcEigenSolver(A)
+
+Now, we ready solve the eigenproblem by calling the :py:func:`solve
+<dolfin.cpp.SLEPcEigenSolver.solve>` method of the eigensolver. Note
+that eigenvalue problems tend to be computationally intensive and may
+hence take a while.
+
+.. code-block:: python
+
+  # Compute all eigenvalues of A x = \lambda x
+  print "Computing eigenvalues. This can take a minute."
+  eigensolver.solve()
+
+The result is kept by the eigensolver, but can fortunately be
+extracted. Here, we have computed all eigenvalues, and they will be
+sorted by largest magnitude. We can extract the real and complex part
+(``r`` and ``c``) of the largest eigenvalue and the real and complex
+part of the corresponding eigenvector (``ru`` and ``cu``) by asking
+for the first eigenpair as follows:
+
+.. code-block:: python
+
+  # Extract largest (first) eigenpair
+  r, c, rx, cx = eigensolver.get_eigenpair(0)
+
+Finally, we want to examine the results. The eigenvalue can easily be
+printed. But, the real part of eigenvector is probably most easily
+visualized by constructing the corresponding eigenfunction. This can
+be done by creating a :py:class:`Function
+<dolfin.functions.function.Function>` in the function space ``V``
+and the associating eigenvector ``rx`` with the Function. Then the
+eigenfunction can be manipulated as any other :py:class:`Function
+<dolfin.functions.function.Function>`, and in particular plotted:
+
+.. code-block:: python
+
+  print "Largest eigenvalue: ", r
+
+  # Initialize function and assign eigenvector
+  u = Function(V)
+  u.vector()[:] = rx
+
+  # Plot eigenfunction
+  plot(u)
+  interactive()
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_eigenvalue.py
+   :start-after: # Begin demo
diff --git a/demo/documented/hyperelasticity/common.txt b/demo/documented/hyperelasticity/common.txt
new file mode 100644
index 0000000..e399e53
--- /dev/null
+++ b/demo/documented/hyperelasticity/common.txt
@@ -0,0 +1,140 @@
+This example demonstrates the solution of a three-dimensional
+elasticity problem. In addition to illustrating how to use
+FunctionSpaces, Expressions and how to apply Dirichlet boundary
+conditions, it focuses on how to:
+
+* Minimise a non-quadratic functional
+* Use automatic computation of the directional derivative
+* Solve a nonlinear variational problem
+* Define compiled sub-domains
+* Use specific form compiler optimization options
+
+Equation and problem definition
+-------------------------------
+
+By definition, boundary value problems for hyperelastic media can be
+expressed as minimisation problems, and the minimization approach is
+adopted in this example. For a domain :math:`\Omega \subset
+\mathbb{R}^{d}`, where :math:`d` denotes the spatial dimension, the
+task is to find the displacement field :math:`u: \Omega \rightarrow
+\mathbb{R}^{d}` that minimises the total potential energy :math:`\Pi`:
+
+.. math::
+   \min_{u \in V} \Pi
+
+where :math:`V` is a suitable function space that satisfies boundary
+conditions on :math:`u`.  The total potential energy is given by
+
+.. math::
+   \Pi = \int_{\Omega} \psi(u) \, {\rm d} x
+   - \int_{\Omega} B \cdot u \, {\rm d} x
+   - \int_{\partial\Omega} T \cdot u \, {\rm d} s
+
+where :math:`\psi` is the elastic stored energy density, :math:`B` is a
+body force (per unit reference volume) and :math:`T` is a traction force
+(per unit reference area).
+
+At minimum points of :math:`\Pi`, the directional derivative of :math:`\Pi`
+with respect to change in :math:`u`
+
+.. math::
+   :label: first_variation
+
+   L(u; v) = D_{v} \Pi = \left. \frac{d \Pi(u + \epsilon v)}{d\epsilon} \right|_{\epsilon = 0}
+
+is equal to zero for all :math:`v \in V`:
+
+.. math::
+   L(u; v) = 0 \quad \forall \ v \in V.
+
+To minimise the potential energy, a solution to the variational
+equation above is sought. Depending on the potential energy
+:math:`\psi`, :math:`L(u; v)` can be nonlinear in :math:`u`. In such a
+case, the Jacobian of :math:`L` is required in order to solve this
+problem using Newton's method. The Jacobian of :math:`L` is defined as
+
+.. math::
+   :label: second_variation
+
+   a(u; du, v) = D_{du} L = \left. \frac{d L(u + \epsilon du; v)}{d\epsilon} \right|_{\epsilon = 0} .
+
+
+
+Elastic stored energy density
+^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+
+To define the elastic stored energy density, consider the deformation
+gradient :math:`F`
+
+.. math::
+
+   F = I + \nabla u,
+
+the right Cauchy-Green tensor :math:`C`
+
+.. math::
+
+   C = F^{T} F,
+
+and the scalars  :math:`J` and :math:`I_{c}`
+
+.. math::
+   J     &= \det(F), \\
+   I_{c} &= {\rm trace}(C).
+
+This demo considers a common neo-Hookean stored energy model of the form
+
+.. math::
+   \psi =  \frac{\mu}{2} (I_{c} - 3) - \mu \ln(J) + \frac{\lambda}{2}\ln(J)^{2}
+
+where :math:`\mu` and :math:`\lambda` are the Lame parameters. These
+can be expressed in terms of the more common Young's modulus :math:`E`
+and Poisson ratio :math:`\nu` by:
+
+.. math::
+    \lambda = \frac{E \nu}{(1 + \nu)(1 - 2\nu)}, \quad  \quad
+    \mu     =  \frac{E}{2(1 + \nu)} .
+
+
+Demo parameters
+^^^^^^^^^^^^^^^
+
+We consider a unit cube domain:
+
+* :math:`\Omega = (0, 1) \times (0, 1) \times (0, 1)` (unit cube)
+
+We use the following definitions of the boundary and boundary conditions:
+
+* :math:`\Gamma_{D_{0}} = 0 \times (0, 1) \times (0, 1)` (Dirichlet boundary)
+
+* :math:`\Gamma_{D_{1}} = 1 \times (0, 1) \times (0, 1)` (Dirichlet boundary)
+
+* :math:`\Gamma_{N} = \partial \Omega \backslash \Gamma_{D}` (Neumann boundary)
+
+* On  :math:`\Gamma_{D_{0}}`
+    .. math::
+        u = (&0, \\
+             &(0.5 + (y - 0.5)\cos(\pi/3) - (z - 0.5)\sin(\pi/3) - y)/2, \\
+             &(0.5 + (y - 0.5)\sin(\pi/3) + (z - 0.5)\cos(\pi/3) - x))/2)
+* On :math:`\Gamma_{D_{1}}`:  :math:`u = (0, 0, 0)`
+
+* On :math:`\Gamma_{N}`: :math:`T = (0.1, 0, 0)`
+
+These are the body forces and material parameters used:
+
+* :math:`B = (0, -0.5, 0)`
+
+* :math:`E    = 10.0`
+
+* :math:`\nu  = 0.3`
+
+With the above input the solution for :math:`u` will look as follows:
+
+.. image:: ../hyperelasticity_u0.png
+    :scale: 75
+    :align: center
+
+.. image:: ../hyperelasticity_u1.png
+    :scale: 75
+    :align: center
+
diff --git a/demo/documented/hyperelasticity/cpp/CMakeLists.txt b/demo/documented/hyperelasticity/cpp/CMakeLists.txt
new file mode 100644
index 0000000..54d4afe
--- /dev/null
+++ b/demo/documented/hyperelasticity/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_hyperelasticity)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/hyperelasticity/cpp/HyperElasticity.h b/demo/documented/hyperelasticity/cpp/HyperElasticity.h
new file mode 100644
index 0000000..f54696f
--- /dev/null
+++ b/demo/documented/hyperelasticity/cpp/HyperElasticity.h
@@ -0,0 +1,7158 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       False
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __HYPERELASTICITY_H
+#define __HYPERELASTICITY_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class hyperelasticity_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  hyperelasticity_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Compute subdeterminants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+    vertex_values[3] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new hyperelasticity_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class hyperelasticity_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  hyperelasticity_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new hyperelasticity_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class hyperelasticity_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  hyperelasticity_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 9:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[10] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[11] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[4];
+    vertex_values[4] = dof_values[5];
+    vertex_values[7] = dof_values[6];
+    vertex_values[10] = dof_values[7];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[8];
+    vertex_values[5] = dof_values[9];
+    vertex_values[8] = dof_values[10];
+    vertex_values[11] = dof_values[11];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_finite_element_1();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new hyperelasticity_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class hyperelasticity_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  hyperelasticity_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new hyperelasticity_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class hyperelasticity_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  hyperelasticity_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new hyperelasticity_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class hyperelasticity_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  hyperelasticity_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[0][0];
+    dofs[5] = offset + c.entity_indices[0][1];
+    dofs[6] = offset + c.entity_indices[0][2];
+    dofs[7] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[8] = offset + c.entity_indices[0][0];
+    dofs[9] = offset + c.entity_indices[0][1];
+    dofs[10] = offset + c.entity_indices[0][2];
+    dofs[11] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 9;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 11;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 10;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 4;
+        dofs[2] = 8;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 5;
+        dofs[2] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 6;
+        dofs[2] = 10;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 7;
+        dofs[2] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = vertex_coordinates[0];
+    dof_coordinates[4][1] = vertex_coordinates[1];
+    dof_coordinates[4][2] = vertex_coordinates[2];
+    dof_coordinates[5][0] = vertex_coordinates[3];
+    dof_coordinates[5][1] = vertex_coordinates[4];
+    dof_coordinates[5][2] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[6];
+    dof_coordinates[6][1] = vertex_coordinates[7];
+    dof_coordinates[6][2] = vertex_coordinates[8];
+    dof_coordinates[7][0] = vertex_coordinates[9];
+    dof_coordinates[7][1] = vertex_coordinates[10];
+    dof_coordinates[7][2] = vertex_coordinates[11];
+    dof_coordinates[8][0] = vertex_coordinates[0];
+    dof_coordinates[8][1] = vertex_coordinates[1];
+    dof_coordinates[8][2] = vertex_coordinates[2];
+    dof_coordinates[9][0] = vertex_coordinates[3];
+    dof_coordinates[9][1] = vertex_coordinates[4];
+    dof_coordinates[9][2] = vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[6];
+    dof_coordinates[10][1] = vertex_coordinates[7];
+    dof_coordinates[10][2] = vertex_coordinates[8];
+    dof_coordinates[11][0] = vertex_coordinates[9];
+    dof_coordinates[11][1] = vertex_coordinates[10];
+    dof_coordinates[11][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_dofmap_1();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new hyperelasticity_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class hyperelasticity_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  hyperelasticity_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W4[4] = {0.0416666666666667, 0.0416666666666667, 0.0416666666666667, 0.0416666666666667};
+    // Quadrature points on the UFC reference element: (0.585410196624969, 0.138196601125011, 0.138196601125011), (0.138196601125011, 0.585410196624969, 0.138196601125011), (0.138196601125011, 0.138196601125011, 0.585410196624969), (0.138196601125011, 0.138196601125011, 0.138196601125011)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[4][12] = \
+    {{0.138196601125009, 0.585410196624969, 0.138196601125011, 0.138196601125011, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.138196601125009, 0.138196601125011, 0.585410196624969, 0.138196601125011, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.138196601125009, 0.138196601125011, 0.138196601125011, 0.585410196624969, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.585410196624967, 0.138196601125011, 0.138196601125011, 0.138196601125011, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C0_D001[4][12] = \
+    {{-1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C0_D010[4][12] = \
+    {{-1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C0_D100[4][12] = \
+    {{-1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1[4][12] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.138196601125009, 0.585410196624969, 0.138196601125011, 0.138196601125011, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.138196601125009, 0.138196601125011, 0.585410196624969, 0.138196601125011, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.138196601125009, 0.138196601125011, 0.138196601125011, 0.585410196624969, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.585410196624967, 0.138196601125011, 0.138196601125011, 0.138196601125011, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1_D001[4][12] = \
+    {{0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1_D010[4][12] = \
+    {{0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1_D100[4][12] = \
+    {{0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C2[4][12] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.138196601125009, 0.585410196624969, 0.138196601125011, 0.138196601125011},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.138196601125009, 0.138196601125011, 0.585410196624969, 0.138196601125011},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.138196601125009, 0.138196601125011, 0.138196601125011, 0.585410196624969},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.585410196624967, 0.138196601125011, 0.138196601125011, 0.138196601125011}};
+    
+    static const double FE0_C2_D001[4][12] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0}};
+    
+    static const double FE0_C2_D010[4][12] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0}};
+    
+    static const double FE0_C2_D100[4][12] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', False), ('ignore ones', False), ('ignore zero tables', False), ('optimisation', False), ('remove zero terms', False)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 47232
+    for (unsigned int ip = 0; ip < 4; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      double F9 = 0.0;
+      double F10 = 0.0;
+      double F11 = 0.0;
+      
+      // Total number of operations to compute function values = 288
+      for (unsigned int r = 0; r < 12; r++)
+      {
+        F0 += FE0_C0[ip][r]*w[1][r];
+        F1 += FE0_C1[ip][r]*w[1][r];
+        F2 += FE0_C2[ip][r]*w[1][r];
+        F3 += FE0_C0_D100[ip][r]*w[0][r];
+        F4 += FE0_C0_D010[ip][r]*w[0][r];
+        F5 += FE0_C0_D001[ip][r]*w[0][r];
+        F6 += FE0_C1_D100[ip][r]*w[0][r];
+        F7 += FE0_C1_D010[ip][r]*w[0][r];
+        F8 += FE0_C1_D001[ip][r]*w[0][r];
+        F9 += FE0_C2_D100[ip][r]*w[0][r];
+        F10 += FE0_C2_D010[ip][r]*w[0][r];
+        F11 += FE0_C2_D001[ip][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Number of operations for primary indices: 11520
+      for (unsigned int j = 0; j < 12; j++)
+      {
+        // Number of operations to compute entry: 960
+        A[j] += (((((((((K[2]*FE0_C0_D100[ip][j] + K[5]*FE0_C0_D010[ip][j] + K[8]*FE0_C0_D001[ip][j]))*((((K[0]*F6 + K[3]*F7 + K[6]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + (-1.0)*(((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((K[0]*F9 + K[3]*F10 + K[6]*F11))))) + ((((((K[0]*FE0_C2_D100[ip][j] + K[3]*FE0_C2_D010[ip][j] + K[6]*FE0_C2_D001[ip][j]))*((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8))) + ((K[1]*FE0_C1_D100[ip][j] + K[4]*FE0_C1_D010[ip][j] + K[7]*FE0_C1_D001[ip][j]))*((K[0]*F9 + K[3]*F10 + K[6]*F11))))*(-1.0) + (((K[0]*FE0_C1_D100[ip][j] + K[3]*FE0_C1_D010[ip][j] + K[6]*FE0_C1_D001[ip][j]))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + ((K[1]*FE0_C2_D100[ip][j] + K[4]*FE0_C2_D010[ip][j] + K[7]*FE0_C2_D001[ip][j]))*((K[0]*F6 + K[3]*F7 + K[6]*F8)))))*((K[2]*F3 + K[5]*F4 + K[8]*F5))) + (((((((K[1]*FE0_C1_D100[ip][j] + K[4]*FE0_C1_D010[ip][j] + K[7]*FE0_C1_D001[ip][j]))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))) + ((K[2]*FE0_C2_D100[ip][j] + K[5]*FE0_C2_D010[ip][j] + K[8]*FE0_C2_D001[ip][j]))*((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))) + ((((K[2]*FE0_C1_D100[ip][j] + K[5]*FE0_C1_D010[ip][j] + K[8]*FE0_C1_D001[ip][j]))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + ((K[1]*FE0_C2_D100[ip][j] + K[4]*FE0_C2_D010[ip][j] + K[7]*FE0_C2_D001[ip][j]))*((K[2]*F6 + K[5]*F7 + K[8]*F8))))*(-1.0)))*((1.0 + (K[0]*F3 + K[3]*F4 + K[6]*F5))) + ((K[0]*FE0_C0_D100[ip][j] + K[3]*FE0_C0_D010[ip][j] + K[6]*FE0_C0_D001[ip][j]))*((((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))) + (-1.0)*(((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11)))))) + ((((((K[0]*FE0_C2_D100[ip][j] + K[3]*FE0_C2_D010[ip][j] + K[6]*FE0_C2_D001[ip][j]))*((K[2]*F6 + K[5]*F7 + K[8]*F8)) + ((K[2]*FE0_C1_D100[ip][j] + K[5]*FE0_C1_D010[ip][j] + K[8]*FE0_C1_D001[ip][j]))*((K[0]*F9 + K[3]*F10 + K[6]*F11))) + ((((K[2]*FE0_C2_D100[ip][j] + K[5]*FE0_C2_D010[ip][j] + K[8]*FE0_C2_D001[ip][j]))*((K[0]*F6 + K[3]*F7 + K[6]*F8)) + ((K[0]*FE0_C1_D100[ip][j] + K[3]*FE0_C1_D010[ip][j] + K[6]*FE0_C1_D001[ip][j]))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11)))))*(-1.0)))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + ((K[1]*FE0_C0_D100[ip][j] + K[4]*FE0_C0_D010[ip][j] + K[7]*FE0_C0_D001[ip][j]))*((((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[0]*F9 + K[3]*F10 + K[6]*F11)) + (-1.0)*(((K[0]*F6 + K[3]*F7 + K[6]*F8))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11)))))))))/((((K[2]*F3 + K[5]*F4 + K[8]*F5))*((((K[0]*F6 + K[3]*F7 + K[6]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + (-1.0)*(((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((K[0]*F9 + K[3]*F10 + K[6]*F11))))) + (((1.0 + (K[0]*F3 + K[3]*F4 + K[6]*F5)))*((((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))) + (-1.0)*(((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11))))) + ((K[1]*F3 + K[4]*F4 + K[7]*F5))*((((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[0]*F9 + K[3]*F10 + K[6]*F11)) + (-1.0)*(((K[0]*F6 + K[3]*F7 + K[6]*F8))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))))))))))*2.0)*(std::log((((K[2]*F3 + K[5]*F4 + K[8]*F5))*((((K[0]*F6 + K[3]*F7 + K[6]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + (-1.0)*(((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((K[0]*F9 + K[3]*F10 + K[6]*F11))))) + (((1.0 + (K[0]*F3 + K[3]*F4 + K[6]*F5)))*((((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))) + (-1.0)*(((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11))))) + ((K[1]*F3 + K[4]*F4 + K[7]*F5))*((((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[0]*F9 + K[3]*F10 + K[6]*F11)) + (-1.0)*(((K[0]*F6 + K[3]*F7 + K[6]*F8))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11)))))))))))*w[4][0]/(2.0) + ((((2.0*(((K[0]*FE0_C1_D100[ip][j] + K[3]*FE0_C1_D010[ip][j] + K[6]*FE0_C1_D001[ip][j]))*((K[0]*F6 + K[3]*F7 + K[6]*F8))) + 2.0*(((K[0]*FE0_C0_D100[ip][j] + K[3]*FE0_C0_D010[ip][j] + K[6]*FE0_C0_D001[ip][j]))*((1.0 + (K[0]*F3 + K[3]*F4 + K[6]*F5)))) + 2.0*(((K[0]*FE0_C2_D100[ip][j] + K[3]*FE0_C2_D010[ip][j] + K[6]*FE0_C2_D001[ip][j]))*((K[0]*F9 + K[3]*F10 + K[6]*F11)))) + (2.0*(((K[2]*FE0_C1_D100[ip][j] + K[5]*FE0_C1_D010[ip][j] + K[8]*FE0_C1_D001[ip][j]))*((K[2]*F6 + K[5]*F7 + K[8]*F8))) + 2.0*(((K[2]*FE0_C0_D100[ip][j] + K[5]*FE0_C0_D010[ip][j] + K[8]*FE0_C0_D001[ip][j]))*((K[2]*F3 + K[5]*F4 + K[8]*F5))) + 2.0*(((K[2]*FE0_C2_D100[ip][j] + K[5]*FE0_C2_D010[ip][j] + K[8]*FE0_C2_D001[ip][j]))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))))) + (2.0*(((K[1]*FE0_C1_D100[ip][j] + K[4]*FE0_C1_D010[ip][j] + K[7]*FE0_C1_D001[ip][j]))*((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))) + 2.0*(((K[1]*FE0_C2_D100[ip][j] + K[4]*FE0_C2_D010[ip][j] + K[7]*FE0_C2_D001[ip][j]))*((K[1]*F9 + K[4]*F10 + K[7]*F11))) + 2.0*(((K[1]*FE0_C0_D100[ip][j] + K[4]*FE0_C0_D010[ip][j] + K[7]*FE0_C0_D001[ip][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))))*w[3][0]/(2.0) + ((((((K[2]*FE0_C0_D100[ip][j] + K[5]*FE0_C0_D010[ip][j] + K[8]*FE0_C0_D001[ip][j]))*((((K[0]*F6 + K[3]*F7 + K[6]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + (-1.0)*(((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((K[0]*F9 + K[3]*F10 + K[6]*F11))))) + ((((((K[0]*FE0_C2_D100[ip][j] + K[3]*FE0_C2_D010[ip][j] + K[6]*FE0_C2_D001[ip][j]))*((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8))) + ((K[1]*FE0_C1_D100[ip][j] + K[4]*FE0_C1_D010[ip][j] + K[7]*FE0_C1_D001[ip][j]))*((K[0]*F9 + K[3]*F10 + K[6]*F11))))*(-1.0) + (((K[0]*FE0_C1_D100[ip][j] + K[3]*FE0_C1_D010[ip][j] + K[6]*FE0_C1_D001[ip][j]))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + ((K[1]*FE0_C2_D100[ip][j] + K[4]*FE0_C2_D010[ip][j] + K[7]*FE0_C2_D001[ip][j]))*((K[0]*F6 + K[3]*F7 + K[6]*F8)))))*((K[2]*F3 + K[5]*F4 + K[8]*F5))) + (((((((K[1]*FE0_C1_D100[ip][j] + K[4]*FE0_C1_D010[ip][j] + K[7]*FE0_C1_D001[ip][j]))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))) + ((K[2]*FE0_C2_D100[ip][j] + K[5]*FE0_C2_D010[ip][j] + K[8]*FE0_C2_D001[ip][j]))*((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))) + ((((K[2]*FE0_C1_D100[ip][j] + K[5]*FE0_C1_D010[ip][j] + K[8]*FE0_C1_D001[ip][j]))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + ((K[1]*FE0_C2_D100[ip][j] + K[4]*FE0_C2_D010[ip][j] + K[7]*FE0_C2_D001[ip][j]))*((K[2]*F6 + K[5]*F7 + K[8]*F8))))*(-1.0)))*((1.0 + (K[0]*F3 + K[3]*F4 + K[6]*F5))) + ((K[0]*FE0_C0_D100[ip][j] + K[3]*FE0_C0_D010[ip][j] + K[6]*FE0_C0_D001[ip][j]))*((((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))) + (-1.0)*(((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11)))))) + ((((((K[0]*FE0_C2_D100[ip][j] + K[3]*FE0_C2_D010[ip][j] + K[6]*FE0_C2_D001[ip][j]))*((K[2]*F6 + K[5]*F7 + K[8]*F8)) + ((K[2]*FE0_C1_D100[ip][j] + K[5]*FE0_C1_D010[ip][j] + K[8]*FE0_C1_D001[ip][j]))*((K[0]*F9 + K[3]*F10 + K[6]*F11))) + ((((K[2]*FE0_C2_D100[ip][j] + K[5]*FE0_C2_D010[ip][j] + K[8]*FE0_C2_D001[ip][j]))*((K[0]*F6 + K[3]*F7 + K[6]*F8)) + ((K[0]*FE0_C1_D100[ip][j] + K[3]*FE0_C1_D010[ip][j] + K[6]*FE0_C1_D001[ip][j]))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11)))))*(-1.0)))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + ((K[1]*FE0_C0_D100[ip][j] + K[4]*FE0_C0_D010[ip][j] + K[7]*FE0_C0_D001[ip][j]))*((((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[0]*F9 + K[3]*F10 + K[6]*F11)) + (-1.0)*(((K[0]*F6 + K[3]*F7 + K[6]*F8))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11)))))))))/((((K[2]*F3 + K[5]*F4 + K[8]*F5))*((((K[0]*F6 + K[3]*F7 + K[6]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11)) + (-1.0)*(((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((K[0]*F9 + K[3]*F10 + K[6]*F11))))) + (((1.0 + (K[0]*F3 + K[3]*F4 + K[6]*F5)))*((((1.0 + (K[1]*F6 + K[4]*F7 + K[7]*F8)))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))) + (-1.0)*(((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[1]*F9 + K[4]*F10 + K[7]*F11))))) + ((K[1]*F3 + K[4]*F4 + K[7]*F5))*((((K[2]*F6 + K[5]*F7 + K[8]*F8))*((K[0]*F9 + K[3]*F10 + K[6]*F11)) + (-1.0)*(((K[0]*F6 + K[3]*F7 + K[6]*F8))*((1.0 + (K[2]*F9 + K[5]*F10 + K[8]*F11))))))))))*w[3][0])*(-1.0))) + ((FE0_C0[ip][j]*F0 + FE0_C1[ip][j]*F1 + FE0_C2[ip][j]*F2))*(-1.0))*W4[ip]*det;
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class hyperelasticity_exterior_facet_integral_0_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  hyperelasticity_exterior_facet_integral_0_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_exterior_facet_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, false, true, false, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      59
+    // Number of operations (multiply-add pairs) for geometry tensor:    12
+    // Number of operations (multiply-add pairs) for tensor contraction: 90
+    // Total number of operations (multiply-add pairs):                  161
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Get vertices on face
+    static unsigned int face_vertices[4][3] = {{1, 2, 3}, {0, 2, 3}, {0, 1, 3}, {0, 1, 2}};
+    const unsigned int v0 = face_vertices[facet][0];
+    const unsigned int v1 = face_vertices[facet][1];
+    const unsigned int v2 = face_vertices[facet][2];
+    
+    // Compute scale factor (area of face scaled by area of reference triangle)
+    const double a0 = (vertex_coordinates[3*v0 + 1]*vertex_coordinates[3*v1 + 2]  + vertex_coordinates[3*v0 + 2]*vertex_coordinates[3*v2 + 1]  + vertex_coordinates[3*v1 + 1]*vertex_coordinates[3*v2 + 2]) - (vertex_coordinates[3*v2 + 1]*vertex_coordinates[3*v1 + 2] + vertex_coordinates[3*v2 + 2]*vertex_coordinates[3*v0 + 1] + vertex_coordinates[3*v1 + 1]*vertex_coordinates[3*v0 + 2]);
+    
+    const double a1 = (vertex_coordinates[3*v0 + 2]*vertex_coordinates[3*v1 + 0]  + vertex_coordinates[3*v0 + 0]*vertex_coordinates[3*v2 + 2] + vertex_coordinates[3*v1 + 2]*vertex_coordinates[3*v2 + 0]) - (vertex_coordinates[3*v2 + 2]*vertex_coordinates[3*v1 + 0]  + vertex_coordinates[3*v2 + 0]*vertex_coordinates[3*v0 + 2] + vertex_coordinates[3*v1 + 2]*vertex_coordinates[3*v0 + 0]);
+    
+    const double a2 = (vertex_coordinates[3*v0 + 0]*vertex_coordinates[3*v1 + 1]  + vertex_coordinates[3*v0 + 1]*vertex_coordinates[3*v2 + 0]  + vertex_coordinates[3*v1 + 0]*vertex_coordinates[3*v2 + 1]) - (vertex_coordinates[3*v2 + 0]*vertex_coordinates[3*v1 + 1]  + vertex_coordinates[3*v2 + 1]*vertex_coordinates[3*v0 + 0]  + vertex_coordinates[3*v1 + 0]*vertex_coordinates[3*v0 + 1]);
+    
+    const double det = std::sqrt(a0*a0 + a1*a1 + a2*a2);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[2][0]*(1.0);
+    const double G0_1 = det*w[2][1]*(1.0);
+    const double G0_2 = det*w[2][2]*(1.0);
+    const double G0_3 = det*w[2][3]*(1.0);
+    const double G0_4 = det*w[2][4]*(1.0);
+    const double G0_5 = det*w[2][5]*(1.0);
+    const double G0_6 = det*w[2][6]*(1.0);
+    const double G0_7 = det*w[2][7]*(1.0);
+    const double G0_8 = det*w[2][8]*(1.0);
+    const double G0_9 = det*w[2][9]*(1.0);
+    const double G0_10 = det*w[2][10]*(1.0);
+    const double G0_11 = det*w[2][11]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = -0.0833333333333333*G0_1 - 0.0416666666666667*G0_2 - 0.0416666666666667*G0_3;
+      A[2] = -0.0416666666666667*G0_1 - 0.0833333333333333*G0_2 - 0.0416666666666667*G0_3;
+      A[3] = -0.0416666666666667*G0_1 - 0.0416666666666667*G0_2 - 0.0833333333333333*G0_3;
+      A[4] = 0.0;
+      A[5] = -0.0833333333333333*G0_5 - 0.0416666666666667*G0_6 - 0.0416666666666667*G0_7;
+      A[6] = -0.0416666666666667*G0_5 - 0.0833333333333333*G0_6 - 0.0416666666666667*G0_7;
+      A[7] = -0.0416666666666667*G0_5 - 0.0416666666666667*G0_6 - 0.0833333333333333*G0_7;
+      A[8] = 0.0;
+      A[9] = -0.0833333333333333*G0_9 - 0.0416666666666667*G0_10 - 0.0416666666666667*G0_11;
+      A[10] = -0.0416666666666667*G0_9 - 0.0833333333333333*G0_10 - 0.0416666666666667*G0_11;
+      A[11] = -0.0416666666666667*G0_9 - 0.0416666666666667*G0_10 - 0.0833333333333333*G0_11;
+        break;
+      }
+    case 1:
+      {
+        A[0] = -0.0833333333333334*G0_0 - 0.0416666666666667*G0_2 - 0.0416666666666667*G0_3;
+      A[1] = 0.0;
+      A[2] = -0.0416666666666667*G0_0 - 0.0833333333333333*G0_2 - 0.0416666666666667*G0_3;
+      A[3] = -0.0416666666666667*G0_0 - 0.0416666666666667*G0_2 - 0.0833333333333333*G0_3;
+      A[4] = -0.0833333333333334*G0_4 - 0.0416666666666667*G0_6 - 0.0416666666666667*G0_7;
+      A[5] = 0.0;
+      A[6] = -0.0416666666666667*G0_4 - 0.0833333333333333*G0_6 - 0.0416666666666667*G0_7;
+      A[7] = -0.0416666666666667*G0_4 - 0.0416666666666667*G0_6 - 0.0833333333333333*G0_7;
+      A[8] = -0.0833333333333334*G0_8 - 0.0416666666666667*G0_10 - 0.0416666666666667*G0_11;
+      A[9] = 0.0;
+      A[10] = -0.0416666666666667*G0_8 - 0.0833333333333333*G0_10 - 0.0416666666666667*G0_11;
+      A[11] = -0.0416666666666667*G0_8 - 0.0416666666666667*G0_10 - 0.0833333333333333*G0_11;
+        break;
+      }
+    case 2:
+      {
+        A[0] = -0.0833333333333333*G0_0 - 0.0416666666666667*G0_1 - 0.0416666666666667*G0_3;
+      A[1] = -0.0416666666666667*G0_0 - 0.0833333333333333*G0_1 - 0.0416666666666667*G0_3;
+      A[2] = 0.0;
+      A[3] = -0.0416666666666667*G0_0 - 0.0416666666666666*G0_1 - 0.0833333333333333*G0_3;
+      A[4] = -0.0833333333333333*G0_4 - 0.0416666666666667*G0_5 - 0.0416666666666667*G0_7;
+      A[5] = -0.0416666666666667*G0_4 - 0.0833333333333333*G0_5 - 0.0416666666666667*G0_7;
+      A[6] = 0.0;
+      A[7] = -0.0416666666666667*G0_4 - 0.0416666666666666*G0_5 - 0.0833333333333333*G0_7;
+      A[8] = -0.0833333333333333*G0_8 - 0.0416666666666667*G0_9 - 0.0416666666666667*G0_11;
+      A[9] = -0.0416666666666667*G0_8 - 0.0833333333333333*G0_9 - 0.0416666666666667*G0_11;
+      A[10] = 0.0;
+      A[11] = -0.0416666666666667*G0_8 - 0.0416666666666666*G0_9 - 0.0833333333333333*G0_11;
+        break;
+      }
+    case 3:
+      {
+        A[0] = -0.0833333333333334*G0_0 - 0.0416666666666667*G0_1 - 0.0416666666666667*G0_2;
+      A[1] = -0.0416666666666667*G0_0 - 0.0833333333333333*G0_1 - 0.0416666666666666*G0_2;
+      A[2] = -0.0416666666666667*G0_0 - 0.0416666666666666*G0_1 - 0.0833333333333333*G0_2;
+      A[3] = 0.0;
+      A[4] = -0.0833333333333334*G0_4 - 0.0416666666666667*G0_5 - 0.0416666666666667*G0_6;
+      A[5] = -0.0416666666666667*G0_4 - 0.0833333333333333*G0_5 - 0.0416666666666666*G0_6;
+      A[6] = -0.0416666666666667*G0_4 - 0.0416666666666666*G0_5 - 0.0833333333333333*G0_6;
+      A[7] = 0.0;
+      A[8] = -0.0833333333333334*G0_8 - 0.0416666666666667*G0_9 - 0.0416666666666667*G0_10;
+      A[9] = -0.0416666666666667*G0_8 - 0.0833333333333333*G0_9 - 0.0416666666666666*G0_10;
+      A[10] = -0.0416666666666667*G0_8 - 0.0416666666666666*G0_9 - 0.0833333333333333*G0_10;
+      A[11] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class hyperelasticity_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  hyperelasticity_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.166666666666667;
+    // Quadrature points on the UFC reference element: (0.25, 0.25, 0.25)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0_D001[1][12] = \
+    {{-1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C0_D010[1][12] = \
+    {{-1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C0_D100[1][12] = \
+    {{-1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1_D001[1][12] = \
+    {{0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1_D010[1][12] = \
+    {{0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1_D100[1][12] = \
+    {{0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C2_D001[1][12] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 0.0, 1.0}};
+    
+    static const double FE0_C2_D010[1][12] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 0.0, 1.0, 0.0}};
+    
+    static const double FE0_C2_D100[1][12] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, 1.0, 0.0, 0.0}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 144; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', False), ('ignore ones', False), ('ignore zero tables', False), ('optimisation', False), ('remove zero terms', False)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 506520
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      
+      // Total number of operations to compute function values = 216
+      for (unsigned int r = 0; r < 12; r++)
+      {
+        F0 += FE0_C1_D100[0][r]*w[0][r];
+        F1 += FE0_C1_D010[0][r]*w[0][r];
+        F2 += FE0_C1_D001[0][r]*w[0][r];
+        F3 += FE0_C2_D100[0][r]*w[0][r];
+        F4 += FE0_C2_D010[0][r]*w[0][r];
+        F5 += FE0_C2_D001[0][r]*w[0][r];
+        F6 += FE0_C0_D100[0][r]*w[0][r];
+        F7 += FE0_C0_D010[0][r]*w[0][r];
+        F8 += FE0_C0_D001[0][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Number of operations for primary indices: 506304
+      for (unsigned int j = 0; j < 12; j++)
+      {
+        for (unsigned int k = 0; k < 12; k++)
+        {
+          // Number of operations to compute entry: 3516
+          A[j*12 + k] += ((((((((((((K[0]*FE0_C0_D100[0][j] + K[3]*FE0_C0_D010[0][j] + K[6]*FE0_C0_D001[0][j]))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((((((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0)))))*(((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))) + (((K[1]*FE0_C0_D100[0][j] + K[4]*FE0_C0_D010[0][j] + K[7]*FE0_C0_D001[0][j]))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5)))) + (((((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2))) + ((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0)))*((K[1]*F6 + K[4]*F7 + K[7]*F8)))) + ((((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + ((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))) + ((((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0)))*((K[2]*F6 + K[5]*F7 + K[8]*F8)) + ((K[2]*FE0_C0_D100[0][j] + K[5]*FE0_C0_D010[0][j] + K[8]*FE0_C0_D001[0][j]))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5)))))))/((((((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((K[1]*F6 + K[4]*F7 + K[7]*F8))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((K[2]*F6 + K[5]*F7 + K[8]*F8))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))))))*((((((((((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0) + (((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)))))*((K[1]*F6 + K[4]*F7 + K[7]*F8)) + ((K[1]*FE0_C0_D100[0][k] + K[4]*FE0_C0_D010[0][k] + K[7]*FE0_C0_D001[0][k]))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + (((K[0]*FE0_C0_D100[0][k] + K[3]*FE0_C0_D010[0][k] + K[6]*FE0_C0_D001[0][k]))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((((((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0)) + ((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))))*(((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0)))) + (((K[2]*FE0_C0_D100[0][k] + K[5]*FE0_C0_D010[0][k] + K[8]*FE0_C0_D001[0][k]))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((((((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0) + (((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2)) + ((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5)))))*((K[2]*F6 + K[5]*F7 + K[8]*F8))))))*(-1.0) + (((((K[0]*FE0_C0_D100[0][j] + K[3]*FE0_C0_D010[0][j] + K[6]*FE0_C0_D001[0][j]))*((((((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0)) + ((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))))) + (((K[0]*FE0_C0_D100[0][k] + K[3]*FE0_C0_D010[0][k] + K[6]*FE0_C0_D001[0][k]))*((((((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))) + ((((((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k])) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))))*(-1.0) + (((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k])) + ((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k])))))*(((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0)))) + ((((K[1]*FE0_C0_D100[0][k] + K[4]*FE0_C0_D010[0][k] + K[7]*FE0_C0_D001[0][k]))*(((((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2))) + ((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0))) + (((((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k])) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))) + ((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k])) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))))*(-1.0)))*((K[1]*F6 + K[4]*F7 + K[7]*F8))) + ((K[1]*FE0_C0_D100[0][j] + K[4]*FE0_C0_D010[0][j] + K[7]*FE0_C0_D001[0][j]))*((((((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0) + (((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2))))))) + (((K[2]*FE0_C0_D100[0][j] + K[5]*FE0_C0_D010[0][j] + K[8]*FE0_C0_D001[0][j]))*((((((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0) + (((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2)) + ((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))) + (((K[2]*FE0_C0_D100[0][k] + K[5]*FE0_C0_D010[0][k] + K[8]*FE0_C0_D001[0][k]))*(((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + ((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))) + ((((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0))) + ((((((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k])) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))))*(-1.0) + (((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k])) + ((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k])))))*((K[2]*F6 + K[5]*F7 + K[8]*F8))))))/((((((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((K[1]*F6 + K[4]*F7 + K[7]*F8))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((K[2]*F6 + K[5]*F7 + K[8]*F8))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))))))*w[1][0])*(-1.0) + ((((((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k])) + ((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))) + (((K[1]*FE0_C0_D100[0][k] + K[4]*FE0_C0_D010[0][k] + K[7]*FE0_C0_D001[0][k]))*((K[1]*FE0_C0_D100[0][j] + K[4]*FE0_C0_D010[0][j] + K[7]*FE0_C0_D001[0][j])) + ((K[1]*FE0_C0_D100[0][j] + K[4]*FE0_C0_D010[0][j] + K[7]*FE0_C0_D001[0][j]))*((K[1]*FE0_C0_D100[0][k] + K[4]*FE0_C0_D010[0][k] + K[7]*FE0_C0_D001[0][k]))) + (((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k])) + ((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j])))) + ((((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k])) + ((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))) + (((K[2]*FE0_C0_D100[0][j] + K[5]*FE0_C0_D010[0][j] + K[8]*FE0_C0_D001[0][j]))*((K[2]*FE0_C0_D100[0][k] + K[5]*FE0_C0_D010[0][k] + K[8]*FE0_C0_D001[0][k])) + ((K[2]*FE0_C0_D100[0][k] + K[5]*FE0_C0_D010[0][k] + K[8]*FE0_C0_D001[0][k]))*((K[2]*FE0_C0_D100[0][j] + K[5]*FE0_C0_D010[0][j] + K[8]*FE0_C0_D001[0][j]))) + (((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j])) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k])))) + ((((K[0]*FE0_C0_D100[0][j] + K[3]*FE0_C0_D010[0][j] + K[6]*FE0_C0_D001[0][j]))*((K[0]*FE0_C0_D100[0][k] + K[3]*FE0_C0_D010[0][k] + K[6]*FE0_C0_D001[0][k])) + ((K[0]*FE0_C0_D100[0][k] + K[3]*FE0_C0_D010[0][k] + K[6]*FE0_C0_D001[0][k]))*((K[0]*FE0_C0_D100[0][j] + K[3]*FE0_C0_D010[0][j] + K[6]*FE0_C0_D001[0][j]))) + (((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k])) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))) + (((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j])) + ((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))))))*w[1][0]/(2.0)) + ((((((((((((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0) + (((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)))))*((K[1]*F6 + K[4]*F7 + K[7]*F8)) + ((K[1]*FE0_C0_D100[0][k] + K[4]*FE0_C0_D010[0][k] + K[7]*FE0_C0_D001[0][k]))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + (((K[0]*FE0_C0_D100[0][k] + K[3]*FE0_C0_D010[0][k] + K[6]*FE0_C0_D001[0][k]))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((((((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0)) + ((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))))*(((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0)))) + (((K[2]*FE0_C0_D100[0][k] + K[5]*FE0_C0_D010[0][k] + K[8]*FE0_C0_D001[0][k]))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((((((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0) + (((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2)) + ((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5)))))*((K[2]*F6 + K[5]*F7 + K[8]*F8))))/((((((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((K[1]*F6 + K[4]*F7 + K[7]*F8))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((K[2]*F6 + K[5]*F7 + K[8]*F8))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))))))*(((((((K[0]*FE0_C0_D100[0][j] + K[3]*FE0_C0_D010[0][j] + K[6]*FE0_C0_D001[0][j]))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((((((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0)))))*(((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))) + (((K[1]*FE0_C0_D100[0][j] + K[4]*FE0_C0_D010[0][j] + K[7]*FE0_C0_D001[0][j]))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5)))) + (((((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2))) + ((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0)))*((K[1]*F6 + K[4]*F7 + K[7]*F8)))) + ((((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + ((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))) + ((((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0)))*((K[2]*F6 + K[5]*F7 + K[8]*F8)) + ((K[2]*FE0_C0_D100[0][j] + K[5]*FE0_C0_D010[0][j] + K[8]*FE0_C0_D001[0][j]))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5)))))))/((((((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((K[1]*F6 + K[4]*F7 + K[7]*F8))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((K[2]*F6 + K[5]*F7 + K[8]*F8))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))))))*2.0) + ((((((((((K[0]*FE0_C0_D100[0][j] + K[3]*FE0_C0_D010[0][j] + K[6]*FE0_C0_D001[0][j]))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((((((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0)))))*(((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))) + (((K[1]*FE0_C0_D100[0][j] + K[4]*FE0_C0_D010[0][j] + K[7]*FE0_C0_D001[0][j]))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5)))) + (((((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2))) + ((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0)))*((K[1]*F6 + K[4]*F7 + K[7]*F8)))) + ((((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + ((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))) + ((((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0)))*((K[2]*F6 + K[5]*F7 + K[8]*F8)) + ((K[2]*FE0_C0_D100[0][j] + K[5]*FE0_C0_D010[0][j] + K[8]*FE0_C0_D001[0][j]))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5)))))))/((((((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((K[1]*F6 + K[4]*F7 + K[7]*F8))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((K[2]*F6 + K[5]*F7 + K[8]*F8))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))))))*((((((((((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0) + (((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)))))*((K[1]*F6 + K[4]*F7 + K[7]*F8)) + ((K[1]*FE0_C0_D100[0][k] + K[4]*FE0_C0_D010[0][k] + K[7]*FE0_C0_D001[0][k]))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + (((K[0]*FE0_C0_D100[0][k] + K[3]*FE0_C0_D010[0][k] + K[6]*FE0_C0_D001[0][k]))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((((((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0)) + ((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))))*(((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0)))) + (((K[2]*FE0_C0_D100[0][k] + K[5]*FE0_C0_D010[0][k] + K[8]*FE0_C0_D001[0][k]))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((((((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0) + (((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2)) + ((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5)))))*((K[2]*F6 + K[5]*F7 + K[8]*F8))))))*(-1.0) + (((((K[0]*FE0_C0_D100[0][j] + K[3]*FE0_C0_D010[0][j] + K[6]*FE0_C0_D001[0][j]))*((((((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0)) + ((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))))) + (((K[0]*FE0_C0_D100[0][k] + K[3]*FE0_C0_D010[0][k] + K[6]*FE0_C0_D001[0][k]))*((((((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2)) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))*(-1.0) + (((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))) + ((((((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k])) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))))*(-1.0) + (((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k])) + ((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k])))))*(((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0)))) + ((((K[1]*FE0_C0_D100[0][k] + K[4]*FE0_C0_D010[0][k] + K[7]*FE0_C0_D001[0][k]))*(((((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[2]*F0 + K[5]*F1 + K[8]*F2))) + ((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0))) + (((((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k])) + ((K[2]*FE0_C1_D100[0][j] + K[5]*FE0_C1_D010[0][j] + K[8]*FE0_C1_D001[0][j]))*((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))) + ((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k])) + ((K[2]*FE0_C2_D100[0][j] + K[5]*FE0_C2_D010[0][j] + K[8]*FE0_C2_D001[0][j]))*((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))))*(-1.0)))*((K[1]*F6 + K[4]*F7 + K[7]*F8))) + ((K[1]*FE0_C0_D100[0][j] + K[4]*FE0_C0_D010[0][j] + K[7]*FE0_C0_D001[0][j]))*((((((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))) + ((K[2]*FE0_C2_D100[0][k] + K[5]*FE0_C2_D010[0][k] + K[8]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))))*(-1.0) + (((K[2]*FE0_C1_D100[0][k] + K[5]*FE0_C1_D010[0][k] + K[8]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*((K[2]*F0 + K[5]*F1 + K[8]*F2))))))) + (((K[2]*FE0_C0_D100[0][j] + K[5]*FE0_C0_D010[0][j] + K[8]*FE0_C0_D001[0][j]))*((((((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0) + (((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k]))*((K[0]*F0 + K[3]*F1 + K[6]*F2)) + ((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k]))*((K[1]*F3 + K[4]*F4 + K[7]*F5))))) + (((K[2]*FE0_C0_D100[0][k] + K[5]*FE0_C0_D010[0][k] + K[8]*FE0_C0_D001[0][k]))*(((((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + ((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[0]*F0 + K[3]*F1 + K[6]*F2))) + ((((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[0]*F3 + K[3]*F4 + K[6]*F5)) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*(((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))))*(-1.0))) + ((((((K[1]*FE0_C1_D100[0][j] + K[4]*FE0_C1_D010[0][j] + K[7]*FE0_C1_D001[0][j]))*((K[0]*FE0_C2_D100[0][k] + K[3]*FE0_C2_D010[0][k] + K[6]*FE0_C2_D001[0][k])) + ((K[0]*FE0_C2_D100[0][j] + K[3]*FE0_C2_D010[0][j] + K[6]*FE0_C2_D001[0][j]))*((K[1]*FE0_C1_D100[0][k] + K[4]*FE0_C1_D010[0][k] + K[7]*FE0_C1_D001[0][k]))))*(-1.0) + (((K[1]*FE0_C2_D100[0][j] + K[4]*FE0_C2_D010[0][j] + K[7]*FE0_C2_D001[0][j]))*((K[0]*FE0_C1_D100[0][k] + K[3]*FE0_C1_D010[0][k] + K[6]*FE0_C1_D001[0][k])) + ((K[0]*FE0_C1_D100[0][j] + K[3]*FE0_C1_D010[0][j] + K[6]*FE0_C1_D001[0][j]))*((K[1]*FE0_C2_D100[0][k] + K[4]*FE0_C2_D010[0][k] + K[7]*FE0_C2_D001[0][k])))))*((K[2]*F6 + K[5]*F7 + K[8]*F8))))))/((((((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((K[1]*F6 + K[4]*F7 + K[7]*F8))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((K[2]*F6 + K[5]*F7 + K[8]*F8))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))))))*2.0)*(std::log((((((K[0]*F6 + K[3]*F7 + K[6]*F8) + 1.0))*(((-1.0)*(((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5))) + (((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5))))) + ((K[1]*F6 + K[4]*F7 + K[7]*F8))*(((-1.0)*(((K[0]*F0 + K[3]*F1 + K[6]*F2))*((1.0 + (K[2]*F3 + K[5]*F4 + K[8]*F5)))) + ((K[2]*F0 + K[5]*F1 + K[8]*F2))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))) + ((K[2]*F6 + K[5]*F7 + K[8]*F8))*((((K[0]*F0 + K[3]*F1 + K[6]*F2))*((K[1]*F3 + K[4]*F4 + K[7]*F5)) + (-1.0)*((((K[1]*F0 + K[4]*F1 + K[7]*F2) + 1.0))*((K[0]*F3 + K[3]*F4 + K[6]*F5))))))))))*w[2][0]/(2.0))*W1*det;
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class hyperelasticity_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  hyperelasticity_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "763ccfdc293244408c67e52bb1cc41bf2c984be579263bf1830f951bf476ae418a682cec8e3c06792303ae6dc42992f9303df7846ba72ba1d5313f16948051ac";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 5;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 4:
+      {
+        return new hyperelasticity_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new hyperelasticity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 4:
+      {
+        return new hyperelasticity_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new hyperelasticity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new hyperelasticity_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new hyperelasticity_exterior_facet_integral_0_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class hyperelasticity_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  hyperelasticity_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "da897a9a027ac237332789519da16011c78455a5d4fa7320f630fc067d1a28ddb24638b2b221b2b2a099f72aba3c06aadec6fdece80677e3ad3202ce4b9f5a5f";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new hyperelasticity_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new hyperelasticity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new hyperelasticity_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new hyperelasticity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new hyperelasticity_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace HyperElasticity
+{
+
+class CoefficientSpace_B: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_B(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_B(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_B(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_B(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_B(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_B(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_B()
+  {
+  }
+
+};
+
+class CoefficientSpace_T: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_T(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_T(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_T(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_T(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_T(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_T(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_T()
+  {
+  }
+
+};
+
+class CoefficientSpace_lmbda: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_lmbda()
+  {
+  }
+
+};
+
+class CoefficientSpace_mu: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_mu(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_mu()
+  {
+  }
+
+};
+
+class CoefficientSpace_u: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u()
+  {
+  }
+
+};
+
+class Form_F_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_F_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_F_FunctionSpace_1;
+
+typedef CoefficientSpace_B Form_F_FunctionSpace_2;
+
+typedef CoefficientSpace_T Form_F_FunctionSpace_3;
+
+typedef CoefficientSpace_mu Form_F_FunctionSpace_4;
+
+typedef CoefficientSpace_lmbda Form_F_FunctionSpace_5;
+
+class Form_F: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 5), u(*this, 0), B(*this, 1), T(*this, 2), mu(*this, 3), lmbda(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& B, const dolfin::GenericFunction& T, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(1, 5), u(*this, 0), B(*this, 1), T(*this, 2), mu(*this, 3), lmbda(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = u;
+    this->B = B;
+    this->T = T;
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> B, std::shared_ptr<const dolfin::GenericFunction> T, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(1, 5), u(*this, 0), B(*this, 1), T(*this, 2), mu(*this, 3), lmbda(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = *u;
+    this->B = *B;
+    this->T = *T;
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 5), u(*this, 0), B(*this, 1), T(*this, 2), mu(*this, 3), lmbda(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& B, const dolfin::GenericFunction& T, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(1, 5), u(*this, 0), B(*this, 1), T(*this, 2), mu(*this, 3), lmbda(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = u;
+    this->B = B;
+    this->T = T;
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> B, std::shared_ptr<const dolfin::GenericFunction> T, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(1, 5), u(*this, 0), B(*this, 1), T(*this, 2), mu(*this, 3), lmbda(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = *u;
+    this->B = *B;
+    this->T = *T;
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Destructor
+  ~Form_F()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "B")
+      return 1;
+    else if (name == "T")
+      return 2;
+    else if (name == "mu")
+      return 3;
+    else if (name == "lmbda")
+      return 4;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "B";
+    case 2:
+      return "T";
+    case 3:
+      return "mu";
+    case 4:
+      return "lmbda";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_F_FunctionSpace_0 TestSpace;
+  typedef Form_F_FunctionSpace_1 CoefficientSpace_u;
+  typedef Form_F_FunctionSpace_2 CoefficientSpace_B;
+  typedef Form_F_FunctionSpace_3 CoefficientSpace_T;
+  typedef Form_F_FunctionSpace_4 CoefficientSpace_mu;
+  typedef Form_F_FunctionSpace_5 CoefficientSpace_lmbda;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner B;
+  dolfin::CoefficientAssigner T;
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner lmbda;
+};
+
+class Form_J_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_J_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_J_FunctionSpace_2;
+
+typedef CoefficientSpace_mu Form_J_FunctionSpace_3;
+
+typedef CoefficientSpace_lmbda Form_J_FunctionSpace_4;
+
+class Form_J: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = u;
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = *u;
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = u;
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = *u;
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Destructor
+  ~Form_J()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "mu")
+      return 1;
+    else if (name == "lmbda")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "mu";
+    case 2:
+      return "lmbda";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_J_FunctionSpace_0 TestSpace;
+  typedef Form_J_FunctionSpace_1 TrialSpace;
+  typedef Form_J_FunctionSpace_2 CoefficientSpace_u;
+  typedef Form_J_FunctionSpace_3 CoefficientSpace_mu;
+  typedef Form_J_FunctionSpace_4 CoefficientSpace_lmbda;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner lmbda;
+};
+
+// Class typedefs
+typedef Form_J BilinearForm;
+typedef Form_J JacobianForm;
+typedef Form_F LinearForm;
+typedef Form_F ResidualForm;
+typedef Form_F::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/hyperelasticity/cpp/HyperElasticity.ufl b/demo/documented/hyperelasticity/cpp/HyperElasticity.ufl
new file mode 100644
index 0000000..e2aa5b3
--- /dev/null
+++ b/demo/documented/hyperelasticity/cpp/HyperElasticity.ufl
@@ -0,0 +1,64 @@
+# Copyright (C) 2009-2010 Harish Narayanan and Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2009-09-29
+# Last changed: 2011-06-28
+#
+# The bilinear form a(du, v) and linear form L(v) for
+# a hyperelastic model.
+#
+# Compile this form with FFC: ffc -l dolfin -feliminate_zeros -fprecompute_basis_const -fprecompute_ip_const HyperElasticity.ufl
+
+# Function spaces
+element = VectorElement("Lagrange", tetrahedron, 1)
+
+# Trial and test functions
+du = TrialFunction(element)     # Incremental displacement
+v  = TestFunction(element)      # Test function
+
+# Functions
+u = Coefficient(element)        # Displacement from previous iteration
+B = Coefficient(element)        # Body force per unit volume
+T = Coefficient(element)        # Traction force on the boundary
+
+# Kinematics
+d = u.geometric_dimension()
+I = Identity(d)                 # Identity tensor
+F = I + grad(u)                 # Deformation gradient
+C = F.T*F                       # Right Cauchy-Green tensor
+
+# Invariants of deformation tensors
+Ic = tr(C)
+J  = det(F)
+
+# Elasticity parameters
+mu    = Constant(tetrahedron)
+lmbda = Constant(tetrahedron)
+
+# Stored strain energy density (compressible neo-Hookean model)
+psi = (mu/2)*(Ic - 3) - mu*ln(J) + (lmbda/2)*(ln(J))**2
+
+# Total potential energy
+Pi = psi*dx - inner(B, u)*dx - inner(T, u)*ds
+
+# First variation of Pi (directional derivative about u in the direction of v)
+F = derivative(Pi, u, v)
+
+# Compute Jacobian of F
+J = derivative(F, u, du)
diff --git a/demo/documented/hyperelasticity/cpp/compile.log b/demo/documented/hyperelasticity/cpp/compile.log
new file mode 100644
index 0000000..40b9623
--- /dev/null
+++ b/demo/documented/hyperelasticity/cpp/compile.log
@@ -0,0 +1,1487 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form HyperElasticity
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'F'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 5
+  Coefficients:           '[w_0, w_1, w_2, c_3, c_4]'
+  Coefficient names:      '[u, B, T, mu, lmbda]'
+  Unique elements:        'Vector<3 x CG1(?)>, R0(?)'
+  Unique sub elements:    'Vector<3 x CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Identity.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'J'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, du]'
+  Number of coefficients: 3
+  Coefficients:           '[w_0, c_3, c_4]'
+  Coefficient names:      '[u, mu, lmbda]'
+  Unique elements:        'Vector<3 x CG1(?)>, R0(?)'
+  Unique sub elements:    'Vector<3 x CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for expression Division.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.200657 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {4: {FiniteElement('Real', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0, 0): array([[ 1.,  1.,  1.,  1.]])}}}, VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]]]), (0, 1, 0): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   3.88578059e-16,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]]]), (0, 0, 0): array([[[ 0.1381966,  0.1381966,  0.1381966,  0.5854102],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.5854102,  0.1381966,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.1381966,  0.5854102,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.1381966,  0.1381966,  0.5854102,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.1381966,  0.5854102],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.5854102,  0.1381966,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.5854102,  0.1381966,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.5854102,  0.1381966],
+          [ 0.       ,  0.       ,  0.       ,  0.       ]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.1381966,  0.5854102]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.5854102,  0.1381966,  0.1381966,  0.1381966]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.5854102,  0.1381966,  0.1381966]],
+  
+         [[ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.       ,  0.       ,  0.       ,  0.       ],
+          [ 0.1381966,  0.1381966,  0.5854102,  0.1381966]]]), (0, 0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.11022302e-16,   1.11022302e-16,   4.99600361e-16,
+             1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   5.55111512e-17,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.99600361e-16,   5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.99600361e-16,
+            5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.99600361e-16,   5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.5854102,
+           0.1381966,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.5854102,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.1381966,  0.5854102],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.5854102,  0.1381966,
+           0.1381966,  0.1381966]]), 'FE0_C1': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.5854102,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.5854102,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.1381966,  0.5854102,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.5854102,
+           0.1381966,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE0_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ]])}
+  
+  tables: {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            4.99600361e-16,   5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   4.99600361e-16,
+            5.55111512e-17,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   3.88578059e-16,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C2_D010': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            3.88578059e-16,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   3.88578059e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   4.99600361e-16,   5.55111512e-17,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.5854102,
+           0.1381966,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.5854102,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.1381966,  0.5854102],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.5854102,  0.1381966,
+           0.1381966,  0.1381966]]), 'FE0_C1': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.5854102,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.5854102,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.1381966,  0.5854102,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.5854102,
+           0.1381966,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE0_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C2_D001': 'FE0_C2_D001', 'FE0_C1_D001': 'FE0_C1_D001', 'FE0_C1_D010': 'FE0_C1_D010', 'FE0_C2_D010': 'FE0_C2_D010', 'FE0_C1_D100': 'FE0_C1_D100', 'FE0_C0_D100': 'FE0_C0_D100', 'FE0_C0_D010': 'FE0_C0_D010', 'FE0_C0_D001': 'FE0_C0_D001', 'FE1': 'FE1', 'FE0_C2_D100': 'FE0_C2_D100', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C2_D001': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  0.,  1.]]), 'FE0_C1_D001': array([[ 0.,  0.,  0.,  0., -1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[-1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1': array([[ 1.],
+         [ 1.],
+         [ 1.],
+         [ 1.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.5854102,
+           0.1381966,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.5854102,  0.1381966],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.1381966,  0.1381966,
+           0.1381966,  0.5854102],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.5854102,  0.1381966,
+           0.1381966,  0.1381966]]), 'FE0_C1': array([[ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.5854102,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.5854102,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.1381966,
+           0.1381966,  0.1381966,  0.5854102,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.       ,  0.       ,  0.       ,  0.       ,  0.5854102,
+           0.1381966,  0.1381966,  0.1381966,  0.       ,  0.       ,
+           0.       ,  0.       ]]), 'FE0_C0': array([[ 0.1381966,  0.5854102,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.5854102,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.1381966,  0.1381966,  0.1381966,  0.5854102,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ],
+         [ 0.5854102,  0.1381966,  0.1381966,  0.1381966,  0.       ,
+           0.       ,  0.       ,  0.       ,  0.       ,  0.       ,
+           0.       ,  0.       ]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C2_D001': ('FE0_C2_D001', (), False, False), 'FE0_C1_D001': ('FE0_C1_D001', (), False, False), 'FE0_C1_D010': ('FE0_C1_D010', (), False, False), 'FE0_C2_D010': ('FE0_C2_D010', (), False, False), 'FE0_C1_D100': ('FE0_C1_D100', (), False, False), 'FE0_C0_D100': ('FE0_C0_D100', (), False, False), 'FE0_C0_D010': ('FE0_C0_D010', (), False, False), 'FE0_C0_D001': ('FE0_C0_D001', (), False, False), 'FE1': ('FE1', (), False, True), 'FE0_C2_D100': ('FE0_C2_D100', (), False, False), 'FE0_C2': ('FE0_C2', (), False, False), 'FE0_C1': ('FE0_C1', (), False, False), 'FE0_C0': ('FE0_C0', (), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00199 seconds
+  Shape of reference tensor: (12, 12)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00245 seconds
+  Shape of reference tensor: (12, 12)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00235 seconds
+  Shape of reference tensor: (12, 12)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00186 seconds
+  Shape of reference tensor: (12, 12)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {FiniteElement('Real', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0, 0): array([[ 1.]])}}}, VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 1, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 0, 0): array([[[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]]]), (0, 0, 1): array([[[ -1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.11022302e-16],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [ -1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.11022302e-16],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [ -1.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.11022302e-16]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.00000000e+00]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1': array([[ 1.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]])}
+  
+  tables: {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1': array([[ 1.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C2_D001': 'FE0_C2_D001', 'FE0_C1_D001': 'FE0_C1_D001', 'FE0_C1_D010': 'FE0_C1_D010', 'FE0_C2_D010': 'FE0_C2_D010', 'FE0_C1_D100': 'FE0_C1_D100', 'FE0_C0_D100': 'FE0_C0_D100', 'FE0_C0_D010': 'FE0_C0_D010', 'FE0_C0_D001': 'FE0_C0_D001', 'FE1': 'FE1', 'FE0_C2_D100': 'FE0_C2_D100', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C2_D001': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  0.,  1.]]), 'FE0_C1_D001': array([[ 0.,  0.,  0.,  0., -1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[-1.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1': array([[ 1.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C2_D001': ('FE0_C2_D001', (), False, False), 'FE0_C1_D001': ('FE0_C1_D001', (), False, False), 'FE0_C1_D010': ('FE0_C1_D010', (), False, False), 'FE0_C2_D010': ('FE0_C2_D010', (), False, False), 'FE0_C1_D100': ('FE0_C1_D100', (), False, False), 'FE0_C0_D100': ('FE0_C0_D100', (), False, False), 'FE0_C0_D010': ('FE0_C0_D010', (), False, False), 'FE0_C0_D001': ('FE0_C0_D001', (), False, False), 'FE1': ('FE1', (), False, True), 'FE0_C2_D100': ('FE0_C2_D100', (), False, False), 'FE0_C2': ('FE0_C2', (), False, False), 'FE0_C1': ('FE0_C1', (), False, False), 'FE0_C0': ('FE0_C0', (), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.562147 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Skipping optimizations, add -O to optimize
+  
+Compiler stage 3 finished in 0.000302076 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Z
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: d_22
+  Removing unused variable: d_21
+  Removing unused variable: d_20
+  Removing unused variable: d_12
+  Removing unused variable: d_11
+  Removing unused variable: d_10
+  Removing unused variable: d_02
+  Removing unused variable: d_01
+  Removing unused variable: d_00
+  Removing unused variable: C2
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.320696 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00127697 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./HyperElasticity.h.
+  
+Compiler stage 5 finished in 0.00178385 seconds.
+
+FFC finished in 1.08725 seconds.
diff --git a/demo/documented/hyperelasticity/cpp/documentation.rst b/demo/documented/hyperelasticity/cpp/documentation.rst
new file mode 100644
index 0000000..cde5c3f
--- /dev/null
+++ b/demo/documented/hyperelasticity/cpp/documentation.rst
@@ -0,0 +1,329 @@
+.. Documentation for the hyperelasticity demo from DOLFIN.
+
+.. _demo_pde_hyperelasticity_cpp_documentation:
+
+Hyperelasticity
+===============
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+The implementation is split in two files: a form file containing the
+definition of the variational forms expressed in UFL and the solver which is
+implemented in a C++ file.
+
+Running this demo requires the files: :download:`main.cpp`,
+:download:`HyperElasticity.ufl` and :download:`CMakeLists.txt`.
+
+UFL form file
+^^^^^^^^^^^^^
+
+The first step is to define the variational problem at hand. We define
+the variational problem in UFL terms in a separate form file
+:download:`HyperElasticity.ufl`.
+
+We are interested in solving for a discrete vector field in three
+dimensions, so first we need the appropriate finite element space and
+trial and test functions on this space
+
+.. code-block:: python
+
+    # Function spaces
+    element = VectorElement("Lagrange", tetrahedron, 1)
+
+    # Trial and test functions
+    du = TrialFunction(element)     # Incremental displacement
+    v  = TestFunction(element)      # Test function
+
+Note that ``VectorElement`` creates a finite element space of vector
+fields. The dimension of the vector field (the number of components)
+is assumed to be the same as the spatial dimension (in this case 3),
+unless otherwise specified.
+
+Next, we will be needing functions for the boundary source ``B``, the
+traction ``T`` and the displacement solution itself ``u``.
+
+.. code-block:: python
+
+    # Functions
+    u = Coefficient(element)        # Displacement from previous iteration
+    B = Coefficient(element)        # Body force per unit volume
+    T = Coefficient(element)        # Traction force on the boundary
+
+Now, we can define the kinematic quantities involved in the model
+
+.. code-block:: python
+
+    # Kinematics
+    d = u.geometric_dimension()
+    I = Identity(d)                 # Identity tensor
+    F = I + grad(u)                 # Deformation gradient
+    C = F.T*F                       # Right Cauchy-Green tensor
+
+    # Invariants of deformation tensors
+    Ic = tr(C)
+    J  = det(F)
+
+Before defining the energy density and thus the total potential
+energy, it only remains to specify constants for the elasticity
+parameters
+
+.. code-block:: python
+
+    # Elasticity parameters
+    mu    = Constant(tetrahedron)
+    lmbda = Constant(tetrahedron)
+
+Both the first variation of the potential energy, and the Jacobian of
+the variation, can be automatically computed by a call to
+``derivative``:
+
+.. code-block:: python
+
+    # Stored strain energy density (compressible neo-Hookean model)
+    psi = (mu/2)*(Ic - 3) - mu*ln(J) + (lmbda/2)*(ln(J))**2
+
+    # Total potential energy
+    Pi = psi*dx - inner(B, u)*dx - inner(T, u)*ds
+
+    # First variation of Pi (directional derivative about u in the direction of v)
+    F = derivative(Pi, u, v)
+
+    # Compute Jacobian of F
+    J = derivative(F, u, du)
+
+Note that ``derivative`` is here used with three arguments: the form
+to be differentiated, the variable (function) we are supposed to
+differentiate with respect too, and the direction the derivative is
+taken in.
+
+Before the form file can be used in the C++ program, it must be
+compiled using FFC by running (on the command-line):
+
+.. code-block:: sh
+
+    ffc -l dolfin HyperElasticity.ufl
+
+Note the flag ``-l dolfin`` which tells FFC to generate
+DOLFIN-specific wrappers that make it easy to access the generated
+code from within DOLFIN.
+
+C++ program
+^^^^^^^^^^^
+
+The main solver is implemented in the :download:`main.cpp` file.
+
+At the top, we include the DOLFIN header file and the generated header
+file "HyperElasticity.h" containing the variational forms and function
+spaces.  For convenience we also include the DOLFIN namespace.
+
+.. code-block:: c++
+
+  #include <dolfin.h>
+  #include "HyperElasticity.h"
+
+  using namespace dolfin;
+
+We begin by defining two classes, deriving from :cpp:class:`SubDomain`
+for later use when specifying domains for the boundary conditions.
+
+.. code-block:: c++
+
+  // Sub domain for clamp at left end
+  class Left : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return (std::abs(x[0]) < DOLFIN_EPS) && on_boundary;
+    }
+  };
+
+  // Sub domain for rotation at right end
+  class Right : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return (std::abs(x[0] - 1.0) < DOLFIN_EPS) && on_boundary;
+    }
+  };
+
+We also define two classes, deriving from :cpp:class:`Expression`, for
+later use when specifying values for the boundary conditions.
+
+.. code-block:: c++
+
+  // Dirichlet boundary condition for clamp at left end
+  class Clamp : public Expression
+  {
+  public:
+
+    Clamp() : Expression(3) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = 0.0;
+      values[1] = 0.0;
+      values[2] = 0.0;
+    }
+
+  };
+
+  // Dirichlet boundary condition for rotation at right end
+  class Rotation : public Expression
+  {
+  public:
+
+    Rotation() : Expression(3) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      const double scale = 0.5;
+
+      // Center of rotation
+      const double y0 = 0.5;
+      const double z0 = 0.5;
+
+      // Large angle of rotation (60 degrees)
+      double theta = 1.04719755;
+
+      // New coordinates
+      double y = y0 + (x[1] - y0)*cos(theta) - (x[2] - z0)*sin(theta);
+      double z = z0 + (x[1] - y0)*sin(theta) + (x[2] - z0)*cos(theta);
+
+      // Rotate at right end
+      values[0] = 0.0;
+      values[1] = scale*(y - x[1]);
+      values[2] = scale*(z - x[2]);
+    }
+  };
+
+Next:
+
+.. code-block:: c++
+
+  int main()
+  {
+
+Inside the ``main`` function, we begin by defining a tetrahedral mesh
+of the domain and the function space on this mesh. Here, we choose to
+create a unit cube mesh with 25 ( = 24 + 1) verices in one direction
+and 17 ( = 16 + 1) vertices in the other two directions. With this
+mesh, we initialize the (finite element) function space defined by the
+generated code.
+
+.. code-block:: c++
+
+  // Create mesh and define function space
+  UnitCubeMesh mesh (24, 16, 16);
+  HyperElasticity::FunctionSpace V(mesh);
+
+Now, the Dirichlet boundary conditions can be created using the class
+:cpp:class:`DirichletBC`, the previously initialized
+:cpp:class:`FunctionSpace` ``V`` and instances of the previously
+listed classes ``Left`` (for the left boundary) and ``Right`` (for the
+right boundary), and ``Clamp`` (for the value on the left boundary)
+and ``Rotation`` (for the value on the right boundary).
+
+.. code-block:: c++
+
+  // Define Dirichlet boundaries
+  Left left;
+  Right right;
+
+  // Define Dirichlet boundary functions
+  Clamp c;
+  Rotation r;
+
+  // Create Dirichlet boundary conditions
+  DirichletBC bcl(V, c, left);
+  DirichletBC bcr(V, r, right);
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bcl); bcs.push_back(&bcr);
+
+The two boundary conditions are collected in the container ``bcs``.
+
+We use two instances of the class :cpp:class:`Constant` to define the
+source ``B`` and the traction ``T``.
+
+.. code-block:: c++
+
+  // Define source and boundary traction functions
+  Constant B(0.0, -0.5, 0.0);
+  Constant T(0.1,  0.0, 0.0);
+
+The solution for the displacement will be an instance of the class
+:cpp:class:`Function`, living in the function space ``V``; we define
+it here:
+
+.. code-block:: c++
+
+  // Define solution function
+  Function u(V);
+
+Next, we set the material parameters
+
+.. code-block:: c++
+
+  // Set material parameters
+  const double E  = 10.0;
+  const double nu = 0.3;
+  Constant mu(E/(2*(1 + nu)));
+  Constant lambda(E*nu/((1 + nu)*(1 - 2*nu)));
+
+Now, we can initialize the bilinear and linear forms (``a``, ``L``)
+using the previously defined :cpp:class:`FunctionSpace` ``V``. We
+attach the material parameters and previously initialized functions to
+the forms.
+
+.. code-block:: c++
+
+  // Create (linear) form defining (nonlinear) variational problem
+  HyperElasticity::ResidualForm F(V);
+  F.mu = mu; F.lmbda = lambda; F.B = B; F.T = T; F.u = u;
+
+  // Create jacobian dF = F' (for use in nonlinear solver).
+  HyperElasticity::JacobianForm J(V, V);
+  J.mu = mu; J.lmbda = lambda; J.u = u;
+
+Now, we have specified the variational forms and can consider the
+solution of the variational problem.
+
+.. code-block:: c++
+
+  // Solve nonlinear variational problem F(u; v) = 0
+  solve(F == 0, u, bcs, J);
+
+Finally, the solution ``u`` is saved to a file named
+``displacement.pvd`` in VTK format, and the displacement solution is
+plotted.
+
+.. code-block:: c++
+
+  // Save solution in VTK format
+  File file("displacement.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+
+Complete code
+-------------
+
+Complete UFL file
+^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: HyperElasticity.ufl
+   :start-after: # Compile this form with
+   :language: python
+
+Complete main file
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: main.cpp
+   :start-after: // Begin demo
+   :language: c++
diff --git a/demo/documented/hyperelasticity/cpp/main.cpp b/demo/documented/hyperelasticity/cpp/main.cpp
new file mode 100644
index 0000000..41f8a97
--- /dev/null
+++ b/demo/documented/hyperelasticity/cpp/main.cpp
@@ -0,0 +1,149 @@
+// Copyright (C) 2009 Harish Narayanyan
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011
+//
+// First added:  2009-09-29
+// Last changed: 2012-11-12
+//
+// This demo program solves a hyperelastic problem
+
+// Begin demo
+
+#include <dolfin.h>
+#include "HyperElasticity.h"
+
+using namespace dolfin;
+
+// Sub domain for clamp at left end
+class Left : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return (std::abs(x[0]) < DOLFIN_EPS) && on_boundary;
+  }
+};
+
+// Sub domain for rotation at right end
+class Right : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return (std::abs(x[0] - 1.0) < DOLFIN_EPS) && on_boundary;
+  }
+};
+
+// Dirichlet boundary condition for clamp at left end
+class Clamp : public Expression
+{
+public:
+
+  Clamp() : Expression(3) {}
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+  }
+
+};
+
+// Dirichlet boundary condition for rotation at right end
+class Rotation : public Expression
+{
+public:
+
+  Rotation() : Expression(3) {}
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    const double scale = 0.5;
+
+    // Center of rotation
+    const double y0 = 0.5;
+    const double z0 = 0.5;
+
+    // Large angle of rotation (60 degrees)
+    double theta = 1.04719755;
+
+    // New coordinates
+    double y = y0 + (x[1] - y0)*cos(theta) - (x[2] - z0)*sin(theta);
+    double z = z0 + (x[1] - y0)*sin(theta) + (x[2] - z0)*cos(theta);
+
+    // Rotate at right end
+    values[0] = 0.0;
+    values[1] = scale*(y - x[1]);
+    values[2] = scale*(z - x[2]);
+  }
+
+};
+
+int main()
+{
+  // Create mesh and define function space
+  UnitCubeMesh mesh (24, 16, 16);
+  HyperElasticity::FunctionSpace V(mesh);
+
+  // Define Dirichlet boundaries
+  Left left;
+  Right right;
+
+  // Define Dirichlet boundary functions
+  Clamp c;
+  Rotation r;
+
+  // Create Dirichlet boundary conditions
+  DirichletBC bcl(V, c, left);
+  DirichletBC bcr(V, r, right);
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bcl); bcs.push_back(&bcr);
+
+  // Define source and boundary traction functions
+  Constant B(0.0, -0.5, 0.0);
+  Constant T(0.1,  0.0, 0.0);
+
+  // Define solution function
+  Function u(V);
+
+  // Set material parameters
+  const double E  = 10.0;
+  const double nu = 0.3;
+  Constant mu(E/(2*(1 + nu)));
+  Constant lambda(E*nu/((1 + nu)*(1 - 2*nu)));
+
+  // Create (linear) form defining (nonlinear) variational problem
+  HyperElasticity::ResidualForm F(V);
+  F.mu = mu; F.lmbda = lambda; F.B = B; F.T = T; F.u = u;
+
+  // Create jacobian dF = F' (for use in nonlinear solver).
+  HyperElasticity::JacobianForm J(V, V);
+  J.mu = mu; J.lmbda = lambda; J.u = u;
+
+  // Solve nonlinear variational problem F(u; v) = 0
+  solve(F == 0, u, bcs, J);
+
+  // Save solution in VTK format
+  File file("displacement.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/hyperelasticity/hyperelasticity_u0.png b/demo/documented/hyperelasticity/hyperelasticity_u0.png
new file mode 100644
index 0000000000000000000000000000000000000000..4d3ce4d768640a9002159176c5587c95f1cb6450
GIT binary patch
literal 40841
zcmeEt^LL!z7jCSHCk-Y}8r!zbrm>TTjcpr^Z8o-T+fC9~jqN+1?^^fw`v=_LX3d=Q
zuKn)wY&`os6QQgqg@Ob^f`EWPk&zZxg@Az4gn)pIM}Pu<^Zq?z1_FWvLPlIf-977H
zm(HZihSv6@-|$Ow3y|3r(heE-pMn^ajHL)EQc<v2v}I9=DkuS6TAkyR6vJw1YoAgz
zIaBwp<oBXJd-;5nelR+-qQ5W_$B~nNo+QmT^+*&LX3nIb4Y(`ck%g!u{$b6_$L{Tq
z=z#mTp5pr$p2IY!Dz~Zf=giL^{3i0o=8f7_8Wk=TAmR(AS*s@Ps^u^>lzxqhC9BOw
zP%!wXrFKgW1fBoZELfp8gBPEbERop!w@{%%Wc9xtnHoX0OW+S&Rd7b&eN8{L|NjI2
zzYqRjaB#mr@D2+`(k0RRbI(l%fEfYj3W6~hz>JHt8l{B<-3p<E`?>V_G#>V<)ACbq
zaFY1q5)4w`AIE@?!WC3QbhrS7pw-&%f4Q(+{vF5}??Aln0zK-m84YRP4tiW3cRqA<
zxQhNmrS^Tg-w8RK5i<5V;&W(fObAZDe|4A56@Z-=3ObD5HQs-vQd}K-o=}MNrJmCG
zOsodH%VptZQRvZ=j0pN`JU$d>$*)njkPsY(GA4FDi#{b*c5RY7%!~M32x#2iM7~aD
z<ltW56>vC>A6F^-7}f8?jtiheto>i`;LlUNdwqgX_WnT7T)_nEGe3R7)*y(ybt0oQ
z;GVoX7=jW#qhI{l9|5=mAz>rI!rvP5L(UO?=r+{e=c|LG>qW03&g*q#9s-3D3MGIT
z_yy+oZ3FeO6--SXdTSa7JDDR{?)so6R;Kiv7PY^3e=7pQ6jm%B5vKS7bBJ@8LzvL5
z8z`&_Edm_UU~l`}9rZ+nhj_4a56q0yL0Q)JltP>kVR2BCdFO-r2K$}FlZ>xrPU*eL
zwAiAlD(SJ9+>Khv)z!FJE`;5l9y3F#&;tJVBz2#~AAV$k9-2=_lJ??wVj3O@>|2{y
zl3Y97jIum02u{lCY-WQ@lwg0U{uL$BAP|Jik?(#Y1CS^C;l#yaMvxaFwh!d~#BR=M
z@gy*+xaX53zQ)Vd9d(0*n=_nuJC1UsFcPLNOLq2#$0&D8N?inoBMgd*!_@qOGBooq
zLZ<XbfPr|(!Co`JCV}|p@-S=&higa!WTU)25Jg63rurNb;{Ujao8De0?!NEP1t+Gn
zmKyz6_$^w9Aj5x%;RtYTvLXdW5oy8x1;e5!k?DRx#T27j2nT-<{)&*52}>H%`U}Hg
zuk*knBF4{hii(hy&7#5xFH^&&N2GheQKTaV^W1MZDupe1ZvB@Ydt&Z(Cq8+zya$~T
z7e!P`Ckv7IMMy%Posdq~NsNv1(>q1Pv%;lG;6(lu)yrAY0*t!R4d>^rkdnP;zcH60
zJi5q3+&W_iBF0Pj2aM&3K=kZMAue|DR2@}<0eNq<Y%O^5NHdJkTI5~=J-J*0Ixw!P
z#FCd(j?UH;I4)=vgViz0;ee}q=HsjxnKOqhT5ZuLVJJgDOawa5RYBJIM4yPL*heO@
zZge|;RxRKD4_sBt0K1oW%wF|%z0f{+(L9*5nSs9`z_)d?Fe+Oz$={98{OG^aS?5%%
zOgRGA^_eMbQ3Ga!g-;I1n}Q;#o2-j_*P#(g$r;$y)-e*FM2!z+^7b+Mp4y3_;L2X%
zb!K$_bGukI74a>+jXo<nq*AChV^A)PsM-~q#nH7Ax~$N);a5pG07bK9a&yZcDGS1w
z2gQAVT`kSYZB_p^84C(%5@XGnFIc896G5cR6(g`D({_@|i&_?DCZv$Zg8j?4-@!rR
z`O)6Fv+#8w`0LDm2o-a40NEnq<#S;kmIe}~T3RQ`^jn2iVf(;nENP$}bz7eFfqG9`
zPZxv)WmeRdnKb4JOn6_SeS~3oWV)*F@vu-)W%^`)b5Ipp%zsdKnmusIJybG<!05Uf
z93N*p3)mCRGgjScfp82V?(29Qbv+YTf20f{&Guej!Vw63h}d}xt()B_Wfckup&_G9
zXVtg@vG{#eWEqmi`-|vWN{z*iUEqujhqL|cLt=&9Eco?5{LB<gNO|+x1S+EMfHO^>
zcsXS{sS1&(NRxtTp5yeFxHQ@!tiVx$0u$9?vb5)l0T`)qSOqNSbqNnm;(Q6I!WCwp
z&*Tuy(?-^C?jh-bzgZ*FYeB_VM50jKWCb>e1#?;m=JV5{_19R0AX@>u`$^WS<sj$h
za3NDX%8z;@hkpKZZ6M4czdTo<{#Ynieg>|1Gj4fj!;nOA3<^b~L?++x*@O)%Cz2?g
zlzt<k*{FHqm{RVnn;+azlT6DV9+obVm=Wv^6$a*6=f+DJB@s1SEUJ07n!-<Lb9r{!
zgTAMdOC!u69uZ`D@B7EQH`c175?8Q$e_yW)A%NJEEXO;kn6$SwkqNn`pQD;6S(!Ic
zbC577i)-URTe@$#F-dt>e#?{OWj1hg?T9olu$yu1IJ(9~W$z(nYeile^401Mlqbx=
zGVHw>goVq>4e}gnp^ld%3i!;_c*XoI>D0Ucml-Q~sxk$mv$o$NtL;27I3Fa2dn>~d
zdiZ#2;m2c_G?N38f-rB$hOl4u&DcU3hvYakWz`Ex`kP0y^DzMw^}ZrX0d+b2#FV%O
z1DeUy#}%$fo>Q_TofV5xX}<7hpXA2IuBz4ai^tRrD1>)wrr~Mnc)<0s(daR8A`*(R
z7DR0DL93wjFJCIgti0hvBpLZmQ9}7sF{MbHtSw;04f5|_)U~6D?m!;ABq_4~p**Z^
z#bRyBzd#5*$@-DgSYM~y9B7A-i)ve#r!AIElk`10+rauF`o{voev%c|DiFsaHlFf&
z=;_G(myu52je(&|ep_7pkn$;lsL_tl3u+1E<`7KZVX0+PP9hlG+iRejXL&lz-52S+
z74D;XZ99{^iR5t+TEpIC$515IKr?P3;sSk?wZHp2j{aC-Mak@+0B_yS1~y)hKtco-
z1_kuP+|ttHHM+c~g)>+9;2<!AZGuy?U#koOi*cGcJR)RpPzw8ZKvJ%sKOg)0|5Bwd
zyhZ0>LsOCpmEB%QS^ghmoup4JJy_rMEQ@j(Gr`3UjNn^1iq$kN+<fVc*_SO<(k!zi
z0ggrgBl2AzAr_zG@ixs#r${iEvyP?dgX#9DO{4$LOHscE4)b#ZT=dx|Sicx>SN1;E
zqt8nVlr<=6u38C5fva&(47>hY79E`;6>afnnYx)FcB!->dd%XW!rt(Z*MymF+eLq2
z9#11Ttz4+>E*|xlunB}mewqw7BuckdBRj8pOq95&oKC}ww#m!h{4OOtF$#8C1mwdt
z=Yp)=0&TQH!b-qZuc)*isR1)p_kmtCB=Z#i&jPW+s-xd<MrSSBdqXo(*QNy!O9#3=
zj6_Vq&eZKR@~Z>k8G*vwSFWE@D(RC3X>u*mue}{*b*ZtMr4$Aw%C(wfSf0hB+$g23
z-o{!*HzA3)3)ORUlJ+Qx#x4QO*s=i#5DkJ}GBTDADtiSa__8yT&M_gs_y$t{5K1Sy
z%R~GZ??1q=PmCFZ(*x1V>90NhYGy<H1I1>DuAu$aB)|SD<8z>&)8HGwLCCldf_!4b
zzGACx;e(=%C;s-g=!~mCR(hWTcty7lLK(>urr)8Lv>0&+Sbs4P%s-Gwtj$p%jG^M@
z`C9AI1t*YMZd-imQujvL;TOc6YVW<ll%b0@X5}MdX$#U*238|h#nwsJfn@tWTbDtt
zTz5+<iAO&FF@T4EbzHSPdjDQU{P~NXTiA;KT%G1XW4;>m(08fLs((d-tjZ2)&z}Cq
zaQbA<yTn0bP;IIYC_}d_*Iz-0&-AANmW(X^0x9KRnxi&RkG0I^=`xnANkoPs`~ghw
zZj1(x3<4$H_uh*nHUfHkO?G^X?PIg^7&fIIQLY=0=nTU@*ZS5F4lg}C-Gt!Tyrof@
zyp2vV2Agaq|3Tpd9l!0d@6K*HHOO|n4+Vv%E&Q`){oVI072=mX`xq?4h3zQ-{IxEa
z6Kv#8F3SbOnbDtr;c6fAYkh(0!i<zmUKTH)L?kUsw4`de;#*Md7f{Xnu2_{$K}Eg&
zu7^pMgZs}m?3Ikyog*_|4$bX0PT7wd2v&@tHl~X41?wtkrX4Djf+MwJdPjDI4>Qxq
z&%{S4#Vx^KY94XF66}nj@eAT=>t}H#c~Ov81&Hy6O}YBne(QyfD2jXaGoH%58yn|O
zH@#PXQVdC~+y=Pc{fP%BU$~vA6Wa5)_i}v(>YLh!$G`T^gYcyBfV3Ix_z8nX;2es<
z{*b#tA+%!`Iu)u%B+|+d6ps=9`F+Mt|8RdjEv}`-Vw;RwSMhwFFQct61Jh-LI#Ogs
z(2_cKWL-nFGTHnQq$eD`8VR!-nK@sYwXh+v$Z-jCG8HW#f;8ZG!P1E^p=!BsiKLTf
z?(73KTx7E6;d{>V9o~wbWyemumF3#O`ytci0^e-`<9Tgo$N4}z>5?deT4;rtFNs#W
z>|hr`!zA}kV2C9e{+oOLi2$qte|M#byP9hp!d_XOa#!Av#DZ5|QlOLJZUTv#nmPJk
zes_^`)Jp%i2fG}S)kI&?;UpUv*twuU<f>(8upJ^=%YA2`&ANY{zki-~ofG?=>HXQT
z-0Yqpf0#Cll<f*vgW<fTghyY0U6P#+L9i^T1IBU{L`uG+o`?X08-bStQMQRV(N)g6
zol2@85%motP{QS_Oc|f~^&cgv*DvR#;jE)aPj`8BD#{qr*ZGewz;$mMcqZJjg7Q6O
zzgb6|;zC5P_POQTZ$Vd~#dVC)TyJPjTLJzC?=!@0QL=fu=fxEjiX1EB9xRy+?o`^e
z6YEoNeVrJzP*s9nf@_>QUHzk*urF1iEqKyTl{rkt`KPGljIs~Mn*@Xkaf8BE>42Lx
zDFS`3<R^xdrgCBxKPI^FFP~$R<xJ{9t;od?(!OK;Lih$u0>4m4wa~Doxc_)kKLX2_
zJT<`igJ$$D^b-{#{CeVZsGQ<i=Qp2TJkfZwN!lGGcjaZA6v=7)Ghsm87YwOPFB;7(
zgV@57xWeFG8_0%FIcIrg0!X1q5MxD3DFvp@@OhVSRWz{^Q;j%%)PcwYv!?b_W3VKO
zmn+CNf{iojitlqS+Y#&KPedgRJ{N+{j1stJ(nK8;e(Io`$iM9x=zRYoyQ$PSMbDUr
zRG+cb8acqfE7)J<yld>qm6rUHh|wq-prO~4r}$t%%`F>4R$HL*h&OY{fUftPT1uq%
z_b8neANINz=Rvka9dG2c)+1PW2DZWH;nv{}L2@N8(|zd2Dfid=@DoZ&`TRSKPy?H$
zoUj+fd#=(6{OxQ4w21?|n{2)714m8~U{KT5M-S14fyq*LtNOfJoBNE^m1-G6C2+wM
zfx$K<W3qvcqd9jM0mv4KleB7XrHqjAmTP2JG=$*G7=!b4KDtjJLg97X*&S!Hh9qb5
z3N^5913Nl!alUh3cY5{qq8<;w5O=3o7p^(<)NR*lQiMe$bm$1^laKD>r(^_fKi$`4
zO}A;BIao=#Pk5dR#B;cx*cr>C?{)bVs?stjZ(c#LX}><Cpj_@5R2Hi?IAc4qw~qHj
z)~N-gh`L11sf8N@XISPzvM%eE26?4Hm4v~v9aTM7#~5<2nCIT70Qg*~Rh{L$GGc{y
z#EWbzDNm%K(>na_Vm}rhi5YqY`1Mz6hKS);LY=CkJUF9?Asr(+zqjq)w5R8u@-KV?
zu7{gyeqX|9iXx`2mN;K7Z1`eGii*2kk=B1?L*<W_4Pc%-e^)3U#;4c)v+cv4|5?0G
z%tgyrLDNWeUG1<K;#XST2c)cXr5F|ndzZ4z4G#cn?1eSKNhe!*jEbAaSj8gaDKof9
z68G-kmh;%AvmgL*xAN0o({!r7=Y#8RnHLjF?$wG2Q0UX(Y!@#KAK>)9R27IscW$2?
zZUkAVcI7{S-1e$qREgx(I4C`}ijnEoN#%2RLLcpR9bQS?rFvx~Q-r<KIfJ9kR`4{i
z0;jDRtIxh_Q{cVlQz@YNNpHVPc2E~2x_|i|`h6eXOqM>Fw;z!x$4u7uFW80(xE<Tb
zOTEt0Ix1m*!Rs0$`H!_v$ras!rGStP<7q3IsO$WY*k#H+6yK%ldyNva#7Uu7Q~-#k
zNl9AF%!rowv?fIIvFt=r{H%0Q%K!;hfLhxNNeRI_lJE~R-0t~vNJP|gZ4w-u`u=7@
zHZs<aAtRQfSU6aYoAfZ7@VI@8Z7TsBaQtem1QmQ2xBFnSl#k}|d+C8^Ewk6;PwGmf
z$HpmHUoUR4gWakJYHKfx!a$%I%_s1QwXvrCI8SXYTZ|LF5kQzk*3rVhOo>Knh-frl
zC^9^0A1Idei)X`;3G2a`NyTYl6z0olWJkC1U|R-;F9b9biHt9#_<jntnizs$otzt0
zllKu^iH*)Y%0=AwJX>-2Cu$^8TYM=jw%!-FX`33mO5c>$>CVWiGS#VY8g=lr@{T)r
zB}A(Hi{qGidWt8Te2g^hG2%EwbaIV%w2}^HXva9{V82ffJ@xx|&Led?8`4~tK43tZ
z<B@Y}J(lb!&sZ7R$&?N3bT!0_Z1GtPP|Z)f{HS%tw-2hle_JH!l(;tS*qw-u)fM}O
z7QtiN_YDpqHT4q+x=nWbRO%hu53##tUY|dAyK=o!kllAuNQrpIiLG|ESBjkL%I+^s
za=nOUHX3tNeK$s_-iqp7-N6V}=lc2z+@JZnJj1KPJnUE*!Q5mnM*a++Ouh%Gu>Q)O
zqoQjP9kR0h>#VyoAW)H-Tf}Q$P0-Z8^deMq98AlVgRZb8g8Z$?rE8pt9oxx<Q9iVk
z1P_?@93RI&?}ciF`@gvze;3~$E(?!*tQVubkI>OHYR37kh8#*^Z_djoli&RrD8{>E
zU&V8OWh6zSs&Goq{<rR(CL-{ct`kDQ&-V}t>5f5BTOsv=L0{9q3=0!0V^~`+@C~`*
zYp9+kaK3-DYnYj7s4av%{~#-rK$;g=I{9B7=~vt%TcK}NTcBG&7<NO`o)Tq*+gq8x
zdhDouVh(T830;2^KHMfnl69HW(FnZB|7g^4i%~zpby%$TIALmZ{MSkOjc8=9FjNLu
z?2U#PufONskwIgE>)Ksnf7}PP{+$k`tiNM9Yp!)eT&L*H?BCfzkn-8LBC4U?&y==>
z5*2$<;sMjr)KD#WT$l*6RTHlhxsQK<?Uz_IB1Q0!fd$N=-J@ATLe4-*)=TwI%w1Qn
zpHPf$#BVqTYBd>c_-Gs$<}6l#&xe;z#D`Yu{6&0>!tXV{x_^IHH+2=KNEx{Mug!rD
zQ#ASByep#H8}l2t_X<K;AOuH_B3w0`BnuZj0cF@dt%uW3ZNKo+>0kpUXv96WWt@FI
z;Ys`6bJ){JpwJ2sDNAJdTRRYSW~5O1Q_gk*O4K^lUAkGju1*YOO^pBeT#fYjI=M%&
z$ze0EbqG+mhq9=YCH6+36u=WCESVTt#m1(v)>P28r%0E7GQ9qFq9S93YCxMPJedhW
zi4@@wZzw!pP#`dbd2+h+Nnd_U;!E@)TEj1%A{UnRC42w7(#0y$C(5UO|7PrehtUla
zSX(Qz>WK<=&czb6LjFn(ibc8m4%-J-Ovm=y(RSxeIr`55ee^n4x}UuOZpgZp$!YmD
z5T$|#`w-4y6{^GHKbj`;b0mcCsuzomZuHhF(rQ5k(gQ?g^=uF{+ttcff8waI{@ltn
zvC^_*0<`sE5`Ij;zum##-ja|iFH0yddcv<wQ{G0A%t9z_u8u6`P7iCG{Q{dqRJO^a
z?-cL6Eenyi@|NkB!06WVJkw1PV5(#;^1J6Jyug+Fu|cP*exEt9h-)3Hl7`SIbk+BN
zh7{Op<<}{zRXfWZttL$8czGD$VO!FQjj}wl$vXxD9Ul<(_Dpy%a0W(1Nc`k#jg(5K
zqiw+N#)WvlHfXRn8da3!XSF*mfVB1iHKzGL7R*)J@z~?-aYB{r<8|mrF`zA&CRuH!
z<9*H6gPRI=({{IQgAX4@%PJ-7fc-zzA~hZf@l?|kan@d)pUq4yllQPORKLG8d+bet
z4>{xCUbAaNNZ?AwKZIYLBHrwf2`-k*QG!EsHT=6|pA7d-Y#3d&DzgwWvm(K15rMw3
z`@#bdqzYr40V3~LS<AO7L02hFy5jUOUoN@7%r83^+oM;(j_myKA=SI^-5cqyaQ;h*
zo;Dj!K%$Vv7jIWuD8Z4sIJ*c;f6UrT9Lt4mkZUuX=UjZ}Lv`Z5yQ0z2b-oV4r}^Ic
za#XFsv;;J!3auu%;@9l;Mp(#ieYo+rtq*!ID9LmBB_ilL8-@v$LBBUv4CHT2Pwyv^
zUG-G_@2u!}Q+Vzn3AG)o^S|`<M&-VHu!C*M^))zss}QtN(p$6Hy^oMw(eJg@^cl-W
zgrWc(ELLvsL=p}X&HQ<VotQ>rP^oq6A*4rush5*eS(uzK6H-<?eij>LkP9;=L9ve=
z$5Z}OI>(rc1c3EBCM0G@DmkWpML`Yk^UPa97#H;JzqpsTY9a#9=Fe0LUVXOjt9IM=
zG=Mld!e<6=<hf#d7hJykVW<vsKtPlKE4BMwU<HkHj%`S^*n6I8N<V9?@uodn$YZEL
zKz|Rp2;He_w>)a_a=6(!U=Z^ZS+(Hn5Hmm1@TD<Ab7C2C|8u^C6*d<zB9QtG$XAB7
z$QCk$fyoAU4HHTc%gP)f878SSBL?nB3%~um=3%s~prU7Fww=;}p2kt?e2DYqjCnp2
zdLuttoK+)moFRl|rT<0J?u^n;mJ3@(hZ>-p?w+-S6a9xx0;eMNIW<coVgytLsHiSr
zOpvaaku$UI)D}QXSB>b<aP>6hK=1C6)n)(bO3U#c{j}reJxf*)Di$kU{s?3h9!zAR
zrXCfaoD61q1JpcE*L+OvMXXy1D5LaaA7&+MI2Q-a;&iR4Qu7(L)t+?;R58r7+?eVP
zUOs2d6gWKA_#Tf$ercc_$w!4%5338xgC+;GFVg0>wo{xRL<?6qMDrX4^72HtQN*Ue
zed)!E$!uFR4+&|5l%2vTNLuC<q&qM0Q$ZSt1K)wvI|*?|1gg(K3vd(!#i!%42M~ak
zLZQUW@kB<~&B9}2n{%Q-!7bD|u8^cBPHjC+dM)ucyM?NaSSbP*O3UT1Ga;H^{e3Tw
zK6ISh3MV!{UwuBk%;kqyV~c^XXo%cHy%e$7Vy@w?C2`!#Hib-NNLKVbE@X_;Gi6y5
z_D^3-;EDN^B8*x=Bq+LIb6YL6#aRQzafc|4TQ})txOj+{Mo&i@6Ah6bki)k4sJZ1^
zWMQDvsEn8uHkKNZRU5Ty6jAzhuu$5l18<uSPhmq&ImWhVXa5;n^zyX}_Y!9r;>gS1
z)94Kx(k}=w`|J~cI)mOmy|?4GgL<uol>L7&>~)wEN0`Dt4vA0gV(f_pIZbmC^rm#{
zthRpf1%S>B-2NJPD>nsEh<hN#uZKp2TRKF9R1cs)Vj5W77yjj3e{w4+`$6`WSTi*M
zKZIcw?d*8%Q8}|F%%7t#|J8C_zT%!1%u!{ux&bllC!EUZQW&Uah*B8IO>#zb*1dE!
zteV&->~onMjlRwHk$3GgpX?wv;-?%x2L{Kq{CjmI&`gw1rI(@!DeVkqsG8RXK|13r
z(R@qsT}VxS9RwO|47?RKC>y#6bqE@RjYBQ1QJGmsjLLX+uGCbHy2&8tA7#*<1ad+v
zbwlZ7d^X@=qaLL|D!L^1b#2i~Kp%{_VO+JF`O7a1pGQzfKL8{s#j|HdWX70wmwBcr
zU0V&7&Tn^T-G9|a5<AemSCr_xZSz-lK>^Hul6`8X_ns-`dQ%M?$e*dSa(S4^Tn{Hv
z5>8xg1uQ{q_VtyUY-X5JP70{;a0(cc0GLB2%bEbBp<USYGW0o`aO$(85BvI{PGOY@
z>ag*j#%aR*cqC+3rU^_={8idjBj8~#Z=|Yg^j1t1O(iyy*foqaM05HTE4;*-i8(e#
zu^N|=OXRisdfZEaQa+2&m7Y+<W`)^bied5ErR&f}Qq|1*d@<)oE9uaBVLFm?eFmQx
zac=P-<VD#(ffTRPurqR3PC>=nEb5Z$ELTb_FvFqE(rqH{ea9ezu}=)meB2<Gf{tId
zoxv_B^Np#4(&^>s8Ic;T|5pnTo0bmOC%Mp(Y=hpM69leDbmJ@WEW=r)R4iHxPOuwa
z)Kk)^vCA8EvC;IInRp3tN=K(fIR`sGqPApHpRKpAiGGBtLBc`X*o(H`;TUL!;WAoh
zQ&`>-1PL^?5$RUV$`W_gq9CSsw=|A5A)IO((4G~sStj}n`cyL1EP+6<>9R%aIl35p
zq>8uJ0IUI!B4w@V)Zp`Biy`vzEOmG~Y#DfLr5<$E-1OY3fQ1&lFsz-sVN>ai06P|+
zLLbJs%t^f&teq1qGCjoAd7fxFY49GK%M-`i$t%bde(VjUJgJ44n=;gE3V}-zs&$o8
zZ&JS`CtV%eygC>(#NN0Fi96gT@42pBLTJ7Si^Z^rXdtdmq~D$UmLNvw!C1a`71n(i
z6#YxIun2qBpq`^)GvPQ?K7;ai^<3zeX6+hPaHnP6x5L2;!pruv{B`b_&1f`1wp!hu
z?<CG1#D*_kN@*CuIVmo0=f06S(pot2cHs7|OEx~2yE7|dVY~mz>w=z{`xq*ohg8&`
z!#{4{5Hz0frnTl=ZMe~2G;xGIzD(5jWCGlW3SfpYr(SMMebHvvlfG}OgpG_pyhB`y
z_G2@fvOp%urZooMo1GMrylohK>^{DCZF6T=fNxpAGe?Gmv*}pj@sq-EIjjS@<m7V3
zi&rJ29Ey)Na{0-`Z!e=Tp)M?*4ZZs#-eZ{-lb^48J^om7l`2yVLs${99(9;ycl73u
z5w*@MdC3WGzfA@pEiIj@gfzvrA3(ZtQ#YlsUEZJRsfvRzqsX1&3wOLOc-4w?G{<$y
zgi>kYqc(9o*C>)u`2r37*ewl}OP<l-;eTo5wC>&5((+Jt;P=+!&4A((ZDH|o<N<o&
zsf;;+qDc@-IPvX6>Tp`mUG<~cO}1FJrwY@%-<N{sF}Qw<+9sxyYVWZ7%%ovOzMeVi
zJKoqSVH?<iEhN$XntVU;mvGTO3VjfFrP^fDu>~G|tA~i$KAQIwJWovFck<B`5+J>4
z3R~p);22ht<9`KJ2Bm)kOCpPPML<<2o~^7oI!~HKRnG@GzJy=3e6ACh!<@ok8063H
zL$)EFo)`sL!qxpA!+yxrb@m=xEsv$Xow8g_5<ExYz|J9^S^1M5O=*(&SDD84_fFW!
zWkPMQZKKVlK8%uY;e;>EE~0Y~`{pP+H6|;DhX$7BdO=v+jccZ=T%@=etiaN^SD_La
zb_jD$Y{8E|woM6OXGIRYYVZgqt}>2wQ`h~r4q08g-m{^yhhelx`eul(uq(nl6#l(l
z;Act*E`6H!-iDBC^z(<^>(K6Sk|AAgz0+@JcJ!A}YW(WkVusvglhV<_^`Mjya|&~v
z$>I&u@om5BaF_3AIRiOVJ(@p)wJP%qTOiQ5^Hg|Vf($ax4F@IUN|5DvEs)&s0eER&
zf3jq2ttf44oCSb6Su+BEy5%s%)b~HB+zrju$w^k64r|NRj=qR`<r>Z7b+dnHs7q$~
zgGB>4gptVnDGndzar`E6ouZ!spJz;$lC{b)|1#$!y9t9~3*^iXiI^0svFJ#E1G10%
zH=C6QZ3;uTyxraZjI<_~?E~<TtSe}ewr2Jz*YJzpnc0A9-2F+Ekz-33!%7u|!RvgJ
zFR$aPh%@8@S(aevgDaNG^&-K&wt`Ye*E9;|d_Q%`&TZWxFNh6l0aebFgC#C~U;B82
z^(;I>b@qusCpQ7v-c%E3F|&Ig#bnaJeWk|mR+5@t7q0C)`k@Mv*+9lXo6AZc!IzZr
ziYqyLhVwe-Cq1K`9VHzQH%B?|x^2d6C(>MI>kZSPRD8;SV)j*_@F|Hd4Ye4>ZfbU~
z^7qjl1Q|Q`<%Zu&o>|~rOACUjr<o{tn5`|M%X+wL92e~aX*1Nye_f#KOh+Gm66LU4
z|NQZNy^F+ac9y!18?|i|)ABR_@6~w?@!+M;N(~$$wxfF)+vD&TtL2}fxck)Zcs^kW
zD`vS(@??><p@8Byz<xG;{xr!SqfW!;1pE&<rai^JJIA-niX^{}QXZW2h^sDx*GRN1
z!@@jQbRywnDu0T&aW=KDiwv2Xj}DI*&HBav6$PlYVTiP2?v>*&H@02D2V~_@+{tH@
zJpa-~qdhk(21px&5CnUoSre$%7PJrAt7Nb*@afq>+`*DZX?NO_#Gemwp#K?ci&c5G
za5;(}+-d`RRwoC;kR48!^_v5kBpKoN`SJz<|1Q!{Q;rev)5dS_1?Nk%Eyr{Gii9;b
z0&)gf@fbD6)Z3a3>tJG9pIS%QdFFW4jNzm|g;oKI9*>Gn6+BoO1|@6~J+@M!c?&?n
zgRA))LvCSlUPwTyrYMHd6%*DkoE&)iiH!21H^?%o__p)K9EE`*S%x4uL^5JZxpr7?
zO&-zj4X5WPde7sA(BH+m$Cqe8lX%^-p`}jo6rjQi-4XvmSqk#y((!4qoy)p`V#QF$
z+5E`%{Yu%R)V*g*%VIK0;U)?o(sN{OAW|O$!nuELBImVoP#G0xHKjsvhaztZ*uoe?
z{apRt`S99vx-w@a0H%R0<$DTuP@UFOo!9TLrE~`th0sK4)RHHu4j2?>lz;MnL~8R!
z<Jj0`(2HS{o1GJWomf;(80V+D848E=?%xnh2#24_eQo}<`(Z?;9Ic6fUCmLvHr@{_
zr{AF2o}HKU=!algaMM~;^y22^htI+14}{{P9wt5*x$zg{;mpg}8A}eVqkb+>o3-E>
zc*fFAkmK;~&1PEgOa{kz{l&;m-8_;F&SgK3os9zRb3xjBF1wiv4k8SVS&4n!e#UPD
z`33up%1KirjTXY6@J#`fDUlVXte#MLTz=P=gzSC~8=uLds3)1Q0Z;yQ(FDIgEFZ0?
znqkRj=m&S`0?4|(4UJx8weifoeNs7X+L%#?rf%0%=DKy-vS|jGRsGeUQ`IC%MdlJ{
z_8?XJ%Cf^@%#j6LYcW_|nZc8xrW`GB`cApAxqRFheZ(Tncc&e>LX-^xu%YfC76f;4
z>Y1BSH(iNJ0<EA);8r%iefvie@b880ySeH_TCO|MFV%AI+YNobaIl$vdL9}IxQ_bB
ziiUEOhycLEzmhtq&tj`9HWbP{6c@Q5<llcBC;A|takd39m^&HXLo#Vh$%&6H)ij^7
zFWraGk7H+#<R*Anu~83<yh0>vWo}IG(#A)$Uo8HBnzU#ByZJhmZq;pL=Wgn`d}&Zo
z<}S7L2LYO5i(sVPTr?y(yf3_0_rm8CaML-Uw47*U#T$Y=A@9@WzA{>!)vXS4eMW$}
zuFxxCkA8ws)QI+Ofe~a~ZEXr#cGStE_VGarn%pY~Z{#i6IF2IAmS->R{w}#O=c*}+
zfPqu7A(51Y$^<5k-Y~{8swlKRPaO5qE0N*Mp{>-aCkObb3of=kmnY;dA!~QfkvZ+e
zXtaiFf?u(dP6_N>PdJ<@tjkE16>ea>o%s!Y0_M~#F8i5dvlKd%t(7pVT$SJ9p<)C@
zQYj7MM~v4TMst#`51Bk2{Fw%YZnJv=hRhip<|tq?hVh@)MN6<02Y-b(>-^i-A^5S$
z=}Rd7hvyRMxkgz`r$=bS?P@3q0mR){txBIAWe(4Va4W|uv0#mwv(;5rS(tA=XS~kI
zQl29Orok1eLA4=Y!swnaw&UrwlIDw7SNa>&<6qyhVh<uSXb@WH*5guf%!paykVE1c
z2{ZN@FN8UOEFw6<%a#ZaKQ{58ipAzx<$Zw63sinPQ8-shevfvhwXid+#m%CM=mLgJ
zOxkW`!PT3+Uv4(f0B6+@ZtmR!U)qcJYQ1f_yw_2@VB0k={VE?($6KV8w8*r?i3EiZ
z7oZ?^Uh%}!fFy_sk_9wbA=&f`p5Ok9r6i}rQ%TQ1k8Fi3w*6}e#vQ}jF>WX?+Mzvc
z@K82$m`3(iB(=3sG%R(~OH~GX1X1S!jr|>Pww|iQ*3{lhJ5jUJ#K5ha=Ni1fxz9P<
z;+&eWq~*8tDzt3!_MNSbu*}bP&>?kvFa3dCY=D?$0{rE;!nY8kZ3Cd|`$U5eoebl6
zzREJ3bdSd=i9CHHeiDNF;UL~KOdCyIA)Fm?srdMBus#Fa4=r;XGDNk-8=2pb(C7@R
zGB(yBTDeYk(^AN-C;#N|#zV3pa*$n?`bRqdg&{3vYpwpdYGhVWhA_VYoj0gON{XYh
zbbtk-U+3cq5M&S8bL1ry4$L~eOlDP3)joV+JD6Ib$2BD(jn*sYxtJYG^(I9<-@}Q1
z;pgqgD5_{}E^=lHvhzA3j5~&1CZ65;wZpaJpmG>sX>XElk<=S(Su!hSpqWT%bhcC`
z;y#dY)^%enwXus+NXen8zq(9zYHQ!9PsLL;-o~as^IUHODZv$G6U$(1QMa6EY$(pj
z^(`Ftml8F}&b4Y}w^*~HOjPVL6dO?gqmwG=I_L89Z-DR^RsNgiKYtpAv(S^SEs>|(
zuTkYKc5C0((Cl29A?vSRM@6H~0&9GBaQVs}C5qjccMH5qkUJY@Ul7ck<PFi?EpU5x
z_XEE92h6-j;`sfoc;UIP`T-uXnM?2=!SxUj#-v2}0RWFFu)a3WIFlHn<Q<CjXfENl
zUwoVM>zG;1RB1!^7sxA(?%9y|O_|a#e~e0+T5ETIG3|<3Y5u6fBxHbdIBlVV>v<c=
zK^|6m@1+}cW&TLOTGhp+F&obeJ{Y&BeVvRVil3zC_vr2yU99&L6D6pUHMq%sBAtUU
zf3ct&M3dI==MlxH$8c4~;O-6P+2zMqYp!`N_9XB7S9<Nq*`kdGCSR@+LBfNA6Be36
zrJMS_E`Vb`(v3tG`Wp!cYVk$-Fi9U<XB9~4{RRQ|qIf6jF9{|XmT!)~T5xGrJ<;5-
z`xDJZy<pUwlgN0jrc(mSy}!cs+&kqWUm12Dh3SjD6wlWj(om`6uf`*Gi!v!O{@!${
z1JXW%TsC~{ID9C5#yVxN`hy%BSK{{kS;iQjb+%bNzM{qb+o`9yGrEBx;*U7$C9q$d
zh?!2h5S2@r;||Cc`LA|;0moZACMwSQ=74CC`ATb9I%+w^o2p-dSe^6Ov(cuwRGJKH
zmxK_Nj1ndvDnlvd6eYQB;VZKzG7Y+Bg4rsSh11heZxhxv5F7KES%MPmXsKM?wC(qS
z8hSqlvJO^OGo%^TfM`FSEzS5842vEd44YMnaluVa@s~gD2GNGHEKA=SE=FuDxJB_G
zmEd~BEZG0$rT6dbQIlCGAr3-GAZI&l==u^VAgp4sRV}lDkvxIa93$c+>k${bHPc^w
z;F<pb)$wi8x4N^#PAnQ>lB70WBAetCu^ED<bcFf&>L-4<xzkwuJ=>VB%?%Ha7Nyw;
z#1Pc<6VFXZ4iy!4V44S1?u}Fq^5Ns#XttjnJb~G25^><fWkQ!;w^`o8VPA7Skef;6
zp}Aq!A^e|$(`@psqH2A#AR7*e_Zi=%yK-%O_z#K#(K^hz^SqMKz;G?GLd)j7Co;^M
zpGeL6$zXC~?LKi20K{Q4+l429$S-Za8|&SDM~bm}#RTd3<U=d*XYkOqh=CO8qRH?l
z(txr&VZu$&zYzLFwY^}_xJ^G*g8kG~lmwMFV1UO5Gu_C;5IwKCTL(S0H<$L-{>b@e
zv`s_eIW}fC7u_g`VH-rwzs`=#sflPNQbw(9JEhQxl;Ax2&?5glUJ;}X@*A^<v<mZV
z6w!}Rn}6pDe1Qko+~06JRgvev%XxRNh_F2mZf>%@py{zDeKd#aARmMS3^Uh66rRM#
z3hQPfe^NKlJ>(%q;nX|Oydc=lb~<CNcT$T=JzUm5_1s$1Qj#%dbRgTR*heWnS56rE
z&crD^{=jp`2W;*`F^8(LxY9JZZfB)*k&69V7Wh%|o#eaES4`H1{K>)lOoFGW;Nf_m
z(YyiqJZ^W)L&Jt3S3Z#oggR7qm=S|ndK-ZbaI4K&2r@y=09hp+A7gkab*-D0x(@;L
zeOgw`;n%2A1I*Eeo3Js38h(m)Kpb`A8WV0wVvF6DDh0zP(a6&huBob_ggK*xvFYZq
zwm9R_(xb%Wr3yLeQf}SOT-+F-4ymOL-E)nX=ez8x8R+b$q!+4h8*!0`SE2eQ0m<K=
zylRZRb;ox}Uk?4apN-upb7=NVROXdmq_MNH-kb==#geMxYG;>Tf)0L4gfW5jgkYIF
zK&c_f(Z@sBB5C2pQAHtYd7%MLLawNaw+A8eCAa`DWtS5<CLol((3MciNQN1^d;*)<
zQDzBr%AXFxI50cSzAG5}SJ{LrTHtcioW(iD<Tq@_j5gfy`P^8eKQcicFom2&)uZfa
z9wGVtC$Fjndk_N(-5v8CoP<~j5#W=uQs<=L?G8LqymGIXirYKZ89yeVF)+tcJ3cz-
z!+3Fsb9%h(ejB=c_Yz2|y|(~gMl;G%PjJY2l(R!g+`!*-9OY}WEk@a{7opb$^D<xz
zSJzNrpZ;nsLna@E$&`g7qPaH;sr{>i6psYJ$PRx%l-4Tb^=8Hw=kQB(DK!fPF$39?
zhff=%-jama87D74uG!hqsXeHrS>)MVEBF?vDQZSY;H887{+ShRgb~2%A<{xZzh}zG
zd<(k@x>nfceipTfQ%WKKJIJbLp%$$e6;)3$ihy$j@il5pKO)aFX-_Z!;vzVGnXLkx
zAJ)f?K)rfaK~<ekJ!UNr(+(IV$$`&46b1M>HrNc-?3q0oW&`D0x5j}{g3`)f1P!ov
z5H$O34^c5}M3t5W*BwRr(y^r2YBt5}Bz;9GCcue$kLLvkqt2txwCe@jH^-P=s`~Ha
z&<XJiI&bisdU;DvIcx}V!BK@HS8SxcGA|-I@<pW(XB`w1n%x#Lzl<^I4HgOWUuUEX
zj0AxDbect+NdHS^t5AQp%>71O4AM@TE*LLc+(kMHORYubqPeIF#5r8PA0`>=Gyoji
z4*z~(3!qm}cQYdgMD#=b9+25lrs>};zzfqvDR6-Y%@11gqOz&&c(5Ddk>`}rSQ~sa
zvZRd+c6`pj)ZSQ=`QrS(n3a*-f_r{MLGt{&ini3vGaqba3cpRB6aH|O0`pXNFVW$}
z-1F0Qmfyq!GcmTrEoz3JlEnx$I^vI5md$UCt7{vu#HIk;n*V0Dn=W?=<7_iD@2i>8
zZt8>}*)2{F46Zs@*BX7k=>Q3~0%Vh2RdO@V14miSG<Tz45LxNI`Hw_mqLO9sAxG^+
zu-QC}dg5v2U^WhlQV>gt<(0cJn=O-|EJ@4!hC$c=PzM1opCg#R50R8a>nJ-$CjWqu
z8K^obBw+Y;x)54<U@AQ2>R|Kh))Nt;dxx0K;Ej=DTSi&CC?tH+9DWl(d(NIIL!G8-
zv(Gr<x@6VG%Yk6`9aK8O^C}Ews^8eJX4mSY)@*GTK-}!cTSF@{JqiMolwVSN*(&L=
zIW)4K*Bba%IBJmJA(XsJfODJq=|UkIc(T$~NK<~=7V7Zo7GcI_M23XHUlLs)LOm7w
zb^M59#=t#MZleJe3sXCyT3q%=JrNDZrF%&pn#<fK%o0{4YXOsze5P0-wr;WW&m>bk
zCG3!VKnkUa38Vl3PCjkkpv)`z8pye(bU|`=Ss?VWpg5&*_8Uxl=|JRDmCZfG9f*%Z
zfeIDtaJ3QVPV5;o73p|6S(@3q?G^{o@-nZ^yrA27Rtbza++h8v1J=xNX%X?Z&Yxqf
zANRHocuCcQX>t*oWiBX`(}?tAQ1!8sHw9z-gHo6Zhb`UmCcC9uYP-eaDG!1BfT<Qf
zRG;Jgu!tQY=jNAbVl6)8##30p`Az7D0|sx?W*w~7!dKSOlR``!ShOo<H))6Pkwx;f
zDdRtgeL|D-?%GvS;3!-u$nP>=Sx%(`WHYkE$E6{|ZE$d_&ECp6aT%SmAdP-=!*$?3
z7XYKP2rnWGbo$j0$4`muUcvNFccvg!L5EnRrEHg5ya=NDKQ+IJ%a$GVpEvv;>6}z@
z6iZA!nU2wm!xMHMbTJXRA2hFDZn_5M$y<NSno?_c<&r~ODR84@jZ#4+5^pyy2|Z~X
zQh5%(&Frpf$HLlNiGe`Gg^2Kn2#b(kb-#{dHP!(QUs1D!z+=}UaCNC*_G5>`*syrn
zvvoOFrX`(vA6kOKMw-9CnjkaQVe`X&2Dstku|TRr6SFGI9LcC{o70DnnFWSO4uY7P
zq)SF5c1Q(p?YR@|Ds+G3j@^a*nEGlxYS?cIbscX=ztDK2vn6U0h%5BYCK!H$EXsfm
zNAg}eP??EsN)*^gItlCPXVk4G8=H9FE$(|~JQEl)+JgG;f>{&6E#Lydj5@?-LYyQA
zI)OFuBJyS$I;?7W4=mv=pYPm|=Kd<qC|lhlg=Z%#(q&wYr3<o4Uio8m0tnW_b9#;O
zFdxzEiE9Ny{_PiyOJ!vmV||(FxSPb#XA5kaCvLy+iRVu%<;;1|(J@WE_h{6BGs2~z
zf))>YX0W5ocuM_DNM~;S2tUMXz#u@3uXp`ALEUql=6Z%nBSXpP1!t(%v73Eq%wKoW
zYag6Z7fe9jL{9MrxbYAvNic$f1mA?lc7#E`2^K7QF8%K>jW5in(s>7)Q9SXkGpH3z
zwJ~a<iq3mW_Q#Gcw*)!s9LF831nbA_JrJedNT|8vP4FtL9A8!8<A2!qGJf#F{gLWS
zFRjyC!nIs<f7UEFj7J=ztjuF-Czp@76b0Or?y~|Fe)r(*ByP#uJ-dT|>@5338fo#K
z8Mtn^z&%vwQU*)bO%??rwXh~3Bce&1!-;(tA-8toaj({a)&cv)gCKJuSpLwlpD19-
zXaMlVP#;fx=Yn~7y)>SNOku=A8sbXA;2{G(tE@^xg|A;{NvySm0S8Cg)j`KKRbl_|
zVU;k<<XcVLnqJWZo^KRRw5MFKh<Cd)2TGIwvd9nf{&uP<dJQ&r$FO}IXFwPk<8?;i
zEwfbFmSUpxZ5d)*pH-T=NwPe9-z<%~j3hM_XCZB`*sc8_pYJZ!Y??e!=yl5!{v6k8
zWJ|C<UYPuz!#v1higFULyfC7ZKuEl=17l5()u@xw+NQNz@Q_fS1vgoEh<FBXgVi`=
z8Mo>Q2TqC_j#IO4*s2&So=OB$nfnrcbrK7#s7A@*8RV2R)^cTR@h9q0QMIr9D3H9j
zH>(lBO!&&wV#Ku#%m;I$_uL_3J2rAX>ptnMl1-zjb%F|Ahckb)5YA;y<@;w(?0O~n
zTDsTu9fK0^;C6u9!7SHKJ@G#&usfeOM<7`2Q~OJGOr-x(8^!zrK|^d^XGdpHnvjdU
zn{BUJ+0y5Qis8hi6;wded&qMB&_@dLIx;)_S#hrk?oC$IrQ7s=#46uSBuuW=vnai6
z6;TEjtZvbP)Sea{aG{X^G(232guxlVt)5wz4RG)HI>e5LG!*I#+$nIa*^PH2g;DI*
zYkti$TC#-XkPMj3bDUu~ABFL-7%m1oGlD?y%*o-2%%OsSJ)nL8%k}LgfLzlP{s7O<
zEhIKcL7!wQ_V*i#j#81f4;79Fx4M({f!i4LX^1JOJ#!q%*Q;5OiRF{8K*?iH^VGn9
z;n}IO*>wqIB7SVZKdm-G`;Kp);XLSWVrw%1LcOOpi`+UVM<^_<g;;vi-NGJ6|J0Su
z&0%bH@x?RT**ZntQ7WE&Kea$|q*C)Pi38~x=bJga)KEbq)V;65K;Ymj*Z2hIa3l(@
z<nmHjPobXXi5~5a^oX;2$ag-b{*%HZiG;kl?nY_3T5_OIWV++Le7az_BIA3us2CZ|
z(sl4f?P-*)mrRGu@H|WS88nGnf;QVw2&Sc!U{^nmG9`=v<Xr=nFkTLr=f$}QQu>o6
zruUutVHLh>wp-3tP(_^F+Es>9x`3-up80INKu`p-;|0Jc$-{_9d1Ppzof=n15@@bw
z5kzMW$`W)c{TnHH#z7AAhJ>>err4h;2x7km^gziroKy)k7A5aD-5YKw<%jX&O9{|Z
zgj$7#SG5HT?@d%~b)jQ8+TYtBy3=$pnXzTNy6aT^0ITtao1Xc{ePgRKuZUKphhf(O
zPl=$yVk`D3s_7Zu{UillLn*B4g)T=72{st#R6KsgHMLx77#G>h$j%Ee<*TqBmNPYC
zJT6pEZjq=kKlf8mN6Lz1uShCO!QczRH|HH=QxXP`aYp$E%iRA8O^^Co;m_3t$$s5!
zFju3!Wo^-zcIsJeD$ZMrm$V|0N~<$s#VuNSTcOZVmA->@8|HplQ@nA!Vs+Q_pS*%0
z-Fa~s#4mvl8wHqj4tAN~A(>>=JT))K)*)i$F7~H-Jro%)o|rw)yK5fuHLi#hi-l1c
zg-*Aj?m8M1Kfa3=-e<=%;0wSK4sIl)GFC><<dfg}l^(!1OEF@I!{i<w75a$}1B#z5
zK-N@m#1wWvxzCH}bKkBxnSmEVrh`4d)`I9I-`pGBoZ9{jXpMZ@R{a@#hvs&Mgio&p
zRWyW!jV`%&mAU2)zO~gBh`n+h0@B}#L3aquLY*gX31&EKeO>FIwy&0-ycPXt>hXB(
zH^;hMB3D#QSaNIu@l~*&ah#|`ZKD5y@q?W8V`4gjfp}Pm@nK9jFkl(Ki_*eMBn;7t
z!U#2^5tX1a2zJUXW&9@NgfN1#Gj)MGBvn5y&WrFkb|h&om{(X?3TbOiSWIW1Z<g@y
z<-&*Q&B%sYo)tyv=d_3X4}Kr}*F?!azKwu}g`hqDx)})Qr$mF7ezECKjfo|&<;B35
z=~ug|_x1*OiC-GUj*igSk?LxrDWqyyf7;W4rbwveo+F*#HV4l$1{dnj>(NVb)y78Q
zQ&uf*!b`VA>N>U@sCU%7m_xqy^{tZ^{9i2qt^g2%Ki?TKvRx#hbc-!u(Y>yX8_ovC
z2r+RS_(C~{UXSe4pExL&?r(}@$vi+=%d*1IvyHzkY_f~vClR;D`&S|scOQTy^~52B
zz`qt$w!bGo*}CytTtcvK=10u0r_w9}UGtWPJg0ZxQNiXZ<Nw5XTdm=6!p@$^u!_A6
zZs*(+Ec3;>a}rC#UkbGt^0W{iqz?}<T#kNzkbRm(#U2u<JeIs9{4EU?Pq$TMDbA}$
z4-f{#tOs2fxhL{+3B&lG8-)Wf7RWE}hb*6h<3LHnreZWO0nZrS%L^wTad~?fEY8LY
ze~o`5D=CI@;Qzd?tD(wxDmG{e>JEY6&c@rfwXn@QLQ(P7Db3@toFMPIuwR?$#lq2x
zKa1^I@^k^)+x({zg{)t9VP>p4>9zJ{3V~=`U+h6k?k~Fw5Y$NR@~@BndkIJ@kA5k*
zLu>M&&o=3Y!JxYcWUi;UNZ~zRKL)jWBGWL*Ev@eqs#ob>=a$qPGjGLoc|lRn$6rr_
zlfYeI*VYJV9^D?TmSVJ4CB`Pp_jjXiu@SuGI>yZ_$^a>)?=>_5Re0U-rL*d$E8AWV
zTq*RFqw~C#38|QTHN5n>{gK@v%RJiy_2;&sjerJNqCmY<HCYapJdp2Kr-_!l8=vg!
zU|8&x*1Ys|mXR(~Xi<u&Ag{yd{YD&TQss(}#%|&<(^RH{Miij`5vM~|>7Wv0(Y_SL
zOruKA86wGb;~;~V{B<5zqh@(p4_#qG=a;~7oItM{P}~DEe3Qm=nOc}#&Mni}Ra5J*
znbi9qxDoICgf9PVA$qELR<R$HAooS=VF++7&#=_!$&tTy%rth2TxX=;^}e(`+YMaT
zINSMeR9^j;L07mth)O%cojtH|iD`!oU-vjwbbN}l$Ve+{Tzcb2wx9Tsq@2U>Qz0$D
zEEM-X+e{I!8L`W-p>Q=#6fS6z5Q?RQSsQl-%ix3t``_0fRh&uII8CJ7mn)HLziX*@
zm)zp3@{cUuqz@vs<40&BD#{If4|a}Rs9t=7Qtl*>5TaoTV=UX<{{ihl62GYWNfZdP
zy8s)6XkM`1npg(Sk~Qi!(e}<%K63rP)q1o#YqYhf!e;51SsTDEt|*lrXoFr0Q@-EQ
zpeBpjV0NitxM}dqX!Z~hL(BPuX@|QPwC|ZNzLqHp%L}z0EE}@MPDJ}4g`65IV_t4x
zxsmqLwUg!f4e&}$9F=%v&JImmF(Ey4f~H`P%wpPKGxP9}VXH>T8V%MAz_K!7i%89o
z+Q0F2c<Cb|n-q8WnjiL2g89Ib9q@8$*v}Hjl>NXhHa#CKq`Re^w5yVHZCluSq}mbQ
zu>9Wsnl%jNVf9(pOyS}PQ5P2<QNxv3UlBwti?Q>Zl@sIZ#ez+F?81UW%k&YjXr`!+
zBUF#5VNngkO0OQ7v9YfK)~VQXcVKpGu&}BQF&y6c=Y#RR+m9k~bZCA}=@j$;DPRFr
z$)+J~kL(NCu!87llaYm}{*O01h<YH&f~zlmBrx&555(P3_`eJ+{f+Z;LF{IQje-@q
zoK6F0WFg|=T*9`(M!mFJk5q&3#<j6+r=w<vWLPfXq!R@z|2!fZpX;lTrk+7uV%hh+
z@o$@m*`llgNFBx@sLPaf78)Y7$1!J$aw^1#3TUL0wYhvHhC(uXIIJM#RJr1f7dld2
zi`oWvz{TUGjy-s{CKzO+A0eHXOhD=^)G-x+46z^>0;m2+OMrAa(l5Qvh7XpzkvM4<
zd2SK%L@-W7JAwymnD!n&sFtmgmQQR7ww^^D8f}Hfkn>@=njIHuTYIv4%Uyhlqe+x(
zYi!rSI*wl7Ij)jqJIU}v+KFEkqem(tmQxmCdHfa^g^j6C1^Y4{3yt_*fJ#A>!le1#
z+88V?xEhP89+?PK0YTRbOT08S@J=@gfs*<^r0A%uEe*DJEIR?R|FYkk)DGIB{4DT$
z0{xvM?i~oUgJr>7`z_)dTvv_~5dZ0aw{P)Vk5GfKB|2VZ(#`nZrcy1np|nY@l<j=O
za^vs&L}DAP^Dn=0hf~DRau1?kg2BYouE?w5@WzH-yBseCpFswe2I(K2FYC2aP+t>d
z2+a0wgC8RXLsF^_)aj$``S67LjfMUiVDCHh>8w+CV1}YDj?{yw@2rfx02h5<PK0tl
zQ}1=k&*f)R-5`#|dQ#O>j+X!ZV>s`zZDH%NY7pMC5^pBY$@7lus?>4?TQ2)GZgGcc
ze&p0r#pQBYQEH7X?3rR{s1R6a8g>nC_;gqHv8e8lwQI?**OnI(1%2n*hO>7panb9q
z&H0@QF&~?cN#7thuX@3F#=G;62|TRv@Xdiii$P?^VfKQ9l!ErIAk2@h@S}P>N!X&p
zmOBgo<tx(b@%3{9K8Pjl+p}Xhe@d(M4C(;FO^c_6`t(LV_Xml5amkk<KxZ7Y#k#8O
z;TjIBq1>P76McSwjvA!22w!A-POr`~L+MlGs!Hno$h$lzf$U)vOgf*M7RbliQ>4Q%
zfovSTcYQHZvJA+wRMKUcqn!Ez*$Rk)jGeauf;O6-d|DfuVy$in3x`6V)=NW>Ed%Yh
z25jV$hgI=lLX5b8eP{9`ATzZ2(UzHYC=N5*0R)x5SO03utwla|C8Aox332ZDPM7;I
zI0eZpXgPJ7h^<Ge9pO!ja;M<cYljo1F7AaTuH_d#y;2@=m>T5z&F7VCX!Q`O<1pHD
zy26@=OJ*kq?WHKFvJJ5Z_i!8+baRJh94%gI)-V-#rNSvLDhZ_$M70{S#^f>5tD`BB
zM?Cny=`PR)RCtZGCy$pV7ib|+i-ocn!2!MyF7%(hZTQji1Gt0{VijAjp%mE8mVDHF
zVuBP2$a_ETJo&=qG;I>L9-#)|t&0ZH*aD&Yel0+Hj&N>!@N#y3d$VHlY@Z(dGA?qy
zbVe^=>O_n|X#q2-oaxgoUj|m6QeEnpLN7#eN6M+O_U7$UCJrAK=aMNyfu%`X=8Ly+
zcZiLMgh{xg4Qb@qOZ&`=V{2pJ)PBKB1VUr+0$!l#{;%K+<(uczC*SU{1tQo_p#(q9
zjqj1|-ppy7PtC#BW7MJ1TUNwEX$+0?oo}W0uqU1C*&ob{dLbi@n|g^=dfCETv8rAf
zInO?W^*#AQiYFkdX(J2gfl0=JXb=^7(ov4tw*`ta)tc<kA4;J^6d<8g=mnfT&?jG$
zErclFoopU8pQp4;F5?fB*aD>X*a?~A#@717D~KbG>JxCw%xXg(t)-(3OMsO8$-R&#
z6sl_k#vley#(<4*BpYAII)E`2$%cc}gIrFXL%rY4s7-`<?lm0hKjpfQQe%%!G*b_?
z?d=9zk5xOuR%oo&5KoJLqME!K7xfOFvbSTKbypl^H-88IMLg4Do@u%ncaw1cVZ-b6
z<J<ynSLEao)BY_48u8M|mpMj6_Yo9;1wu=W1xPWA?bFbxJ;Kl)WEc-GBnIvXcMl1W
z*23x(2j-yiw8H$d9GQ|bW6n<xf&JJa`*Ey3!Lx>`mvE@1=Ejy``-!P`0mtEds)1~^
zuBaX1jmu1-PPW3O2JY45Y9td@+EDap47*C5T%$HV;ZSl@ye2!p;sUeJGtOm?=mEjB
zNlY;##%L1771YyV0EwMiHVhNd(Id*AEd&1<x?kO#4aQ)SKgv4B%+#q%ahq7Cl{vaY
z`$O5XW9am#3ZGU+cEUUqoKnyS7BV17G5&Zao|r=)?KFYm2|kQTL1_@!x-LO_@L?X?
z6{g)6)186e$^`g1+OcnwPZ*e+t`=}BM1`J4toJN!3R{m-JHpmI%AJDV?UJrmr)K4%
zmTg(GgPX~_wg>lr9#W%pVI>QOC0`g$5hoXj<Rb|nec~;A6LW#=oBO4eQU_tqk)bel
z_aw^{Uzm*`*;oi4FSzyvO1(}=n%@zt?x1~*b!3J02oBq`C(aCUf!YyhHN_Op>I;{}
zC0IZn?98WzAM1=qq@xzr(9yU%yLhsNW;lD4nml5?d>+2+3omH39;OE2EsGxfj#|!9
zuq$!VV~q#FmR0M3zkG45HG#$y&xD3CBLxF6+gCPWPFWO6wfNA8$9l%U22LZ0%CH=n
zz@g=rF3B=iUmFhR79b@XO-TM89j2L%>@#$0?hLt8)F>z@;-VJkOgy7ZxT!UV80iYd
z3%>GC5&Zig09H-j@vO6x!K|SNAL^-9ZoN{C{!}rT#z-7DO6>?+k5Pw4TSrk`OEl~y
zi~f+_Jv4eO)Et@O6#RKih}h|&oHsNN!F76WMyg3R%0JnrgNY{~N(zd6%SpIMXcSDA
zUz4711dHJMs6jxd)+Xrx9s;EZjfNMkg9`=5T*@3z?uF;YL~_mgJ|W>%z#h-5&*=pw
z6BA!7SPC0`IDs+1Op{qMVl*hqq+e$E4<)|YGi420Zu-Q!&E<ZEGYi!OTSAfd|HT2y
zI&q5^W2r}&<5ov+0Ll%N9q(pg>k(=Y-ncT)(mVT|wp^%Db3v`3J&U@DKBoc8hNuXn
zvRD9iET<anVGAy5M<5Aqg(RLkD!_^?Q2jnkslD)$byt=nYFUdujGQ!|R%Yk6@#G|z
zXW6kpBXzcsKU0=biRiSe<YSKjS~nqSr(HTY`kN1SQerZo&+qjzO)vwOLCicEU>eMG
z0@4#XcrpfoCp=SBI~463Sl1w7%3=_4a=F1-W0{l>wEhBqyaHI+tf%n~e(Ko%oqU;}
zT>G6FHnjtp!ECi2t`3dfuI}FVl9tvB2W{^tH{4GNhi<`4&TY~rIY!F)x*7Fsc(ZFI
zMGfaqTs~AUo1E9q6gFf36k^zb!Zh!w21{c^pnhRa`}C|)-S!w7&9jVZ$Kf$RN*)(Y
zW%97+Hv6{yO^8(!kvl5=g`QBVH5TObk&E6nxc3_7l+pZ}sqCi!rQ>jt-CgO=h<uC=
z+)B4P$z=NB$^lZ4IekAJ{kXPT4^%tCRydBCgI#L_FCQzf1xUStWMzu`%CSx8<&&<I
zs|7sPutqKqzA(p8)wD*9**tyvpt?Xd7bqV@I&RJasoDbemt=#;LOWQu8T6N>yvP<|
zwX)#f!<%4mJe4p9MM*-PZp0ZL4g~=zWmMdut-S-uq%ji&c_!k(WWv<vBhG=r#NatF
z#PHd71&2H21nmfx*3)7;PgHd{gl9QjQC=for64d4zTwnQveXmXYCTx(2wULE@&Zt9
z*cZd67nhMLb7xO>erc=2V!ldJ-9wZ;^D}wAx`!nf#xR*2TNF}Ij@0Vq&28RoO%3&L
zQs;<qm&x|&)gVUp&ArypKdUfhEtA!dxkD@46x-?)<H_}w?P3K?vwCyT-4I`hJId)Z
z<nzmvafHeL`HQ#LU;Q)Luf<uAUw%xZ&3b~7#z7scHc~z)hy>wq$mZXP1Ac|Lt=5Co
zj_{_%Q=LufhFVmepCxEqw}7@QrgU4r04$k87AI!cv>alKGN2uhqy|f#&Yo(rFH}U4
zO~XwoM`mglAjPyY_Ejh0qArll1&T)$&j=fM=zefFh~Wa&emV?fXG^~zG>1iUKGn(5
zBrINVN~fUK7-J}U1Y<vIA$vrcgTWY#DRa$u1F6?f=V6~QOKvMcXSJ!IGkOKx{Fq}o
zp(s^c!xWWPaeH8=Ln_2UD0f5YJGWX7Q-koPC9{m$knrO>Ru(?A5(#OP_Uad_99Odj
zOIaMAlMLnpy=Byxfy+TrNs8e>qhJm0CA2cLFyf-*K}g{sNX!Y_cbBLs>jz70l*y=p
zlyn(Hbf08dqu9_0z5KJHPH;um#pq9^01qh>0FsAEoC=ydg9Jzn45m31s{=&fI{;)c
zQpyPQ7%ACoauGGv1DO7^BUl}vmNF{ynZl*a<_hijtbM8K3-v6>EQ}wz)q1cxG}<DW
zcU!04K3_zZ2<NiuSlFA<x*rd9s-@C$1RH%rCc{e(gnEs|Dt$xN_$N35m62iMS5{9u
z@h>yIY*{Vov4zSi%hS=d_T@SK6`a3@14RemTZW5I;X?lC37I=hvu0)vklK5CP9brW
zbN-7b#ZVdoNGVOm(r0YQ;2gLcB)KzpT8=R3w3m)Mq`X@@(#K;iVt;#p;+UuV1igKd
z$<<i%ebpVhUrc8M^ymJIf4Hx2tp}-3lvZdAs+Tl6T-)N3wg<v+x+2=$z8j*9K(ATK
zY<n~67-N(}i8=^MrCz#Vq<b2vpQs&#sj;+~=^I*4p@VZ7R<B<y<1oI4{Xv%F8jSQl
zLbiEi!t5;N(phLZrP?((qip?%Q2<j6tB+?~I1U4H0nRdNo@lK}NvFQmdQ#W|n_uVs
z6uNp!CE_C)!D3E*-*PVjvPtwP?WvPxT8~nPMq9ud3(b|s!c&LU?|WWexj_nYk^#vg
zmTbfIVxrMyl)Wc~)=W|BBaB^17neuUN_>xOKN`nO$(i0$2-wu4Kpj>O8H8`PRBb2f
zQz`T_rSlMWt=8d#vT9Q5)uS}gC{ipGJedF<uxC)PJW_%NnAr<7fkC|FkwVInHL9P2
z$pB+8q>nHMAT6rPu&?5r(m|X7ANxi9HYNb~02aCzWMi7&1Gqa(k<#o4%N>pHiSc)T
zbUy8KTP>g+;mzxKh1x5f9kjJc?hS6d?%BC-l`Iz`@EBoI^IL{7EBog88W{dB*T5s9
z9HH0Pu!Ky3^j_no?l)qRHu8akuqdcqephd*7jlJeGB^`RWGUW<f&<gTp86OHOBO|T
zgt~`Puua4=>hpM0PALzWvor@z*Xc$*h?;Xs=Ot!b`;Wik>NO<c@WJ8H{9_m$^~XrR
zjh+M)w>A1Gsykp}+VAp!&ug`Sc7&~}YnJZ*LX;WX<T6!!z@wYF#S|h!qf&MYSZXMC
zYVOn=os15&2NOnG4GaI$n8M`z2q|l(j49O5(A*i;F^iEqBe|vKD#8AvFbMf~VNai7
z0Bn1L&Ou`a5d>n*UXe0trp)RNF_<P8lnU`w3V7}e6PpXPsb@fg*e0@}v0Fd_blx?+
z#bD!n+ydpZ=1}(gm2@`1ZXN)8*dkfwc6*RBWqc5YI#<xNQ-qJFUaNIg4Z@b_%&jYJ
zsMZ|On74Y^y?G6dYQm>tP8M~fe5$Fz&oTk&7BV&KCeg!)zB&$bM064^NGw#Y8L(O6
zp~6MMAd7XePDu}q`mKRs&t0_7Q0f!Z869=6%ohLj;S(PD6gm!KW{GE#JaboJNhk$r
ztfTJ%FOvmD8IuX*!BW!vAH%gXNDf5C;d(}-BVW&k;|XTJjWf?uXfyUQ|MXoxOQwJr
zYS`UL&WXSO19uNP>sqY_;jK$4!m+5zgxm1O04?2wsLhV{@u@FB-BPk>ZVDZEFjJ_Q
zv{^$l4wpp-UW_TkR<rdHPR1oWMK*MqJ+v;z==ZY`6?%2IM*2gTkpy%EC!3EXXNuZQ
z8CIA8CP_SObBYomQ)UBG#yprKjB$rH6So<`)JIs#ZX%&fCD>5HD;AJ-Or^py&Wp|M
ztqT@E*3%?@Ckvi>rs#y`!ldNcM8U{hvM1D2?5`bR>v3ujwp?-nzvk-h3wT~>{1mYV
zvdA}FqMc4MAOUQjbd4$PYKfEr(EzYi8X)G~wi|*y7OE^vSu@5w&N#HFX+oV}++*k+
z40z_T^obLY%RgsuMs!pL*H0TwIGN#<#DFo6%VQ{<b7>C=dugma^7ukPBd+r6SSOw0
zQ2r3>ZZ$M+H&RdW|MlGPXr_1LaxhQo-36LQgg+WX5omWA<hySWwjQGfVGDt-2O;c%
z7Vv?)D|T?H55g=_(CiDzb`n#Du3j)Dj#8L9@A}f*mPEUqh$(6+pPg|Ci;BvZ4cEiE
zGxvoWE7iWhj6iRW2@J&6Y&R%o$rM0g8HvC=2nl}6oH97hI|IPimS8Dp*iDgAiR@2Z
za2VuUhT7{79Csv1y5u;`XF&;pPFtLTMoOb5Xmf-BfD7T$S%9s_sLz)hm)WE;-RONS
zPnGwq(lVF&H5`h#p|87QYp=mM=NVGkg{OUz=Yo31W;EmU(VVWkJ|!tEJ2adI(tFff
zS5#Uhmwta91zRLGqIAR{p7wGFR3{*vsVw6kgeW%L-fOm1{<Qjd-aVEPgwtx6(&+n`
zs#Hb?f+<D{>V`5&sZL31^=YjAfAAmX%gFL;ZwIrS5s8JFq4An^F(z9D<uf3iPYeRS
z`n$V>u=NPFBfNF-<g+D<AmcreQY(j7yXFi1N@elatJ;X@VN#19ZZob?YIcf<Y8yrl
zWJY~5j>Z2i8Kk7fOrfY#k808<Y?c1y5*pPUQ1y4jarw6=`&teAU+1gf(Z}n)5bh2w
zq&f7dgc>0A1eq-^dZ?Vx$7n#h49U=A-<KkJh)91brfWy@dX%z&GK^r{RA>lv6a-p~
zG#!58v^6_STdhZ_L3r!Zta)3y4nNd-x_8xm(b2@g%^ezL=;~T`a<F-~WvBN=M18i>
zltDVdWQi#r=_G^ao<W*NQ`mQOzNKB*Mc$%@37P^hO0$o89Cb3rmFVb}H6xFhC$=0>
zZNQpDI++GB1N!LQvWFZOO?fm#lL68|Z(d}BpFG=GuxDtD`lrL^&_?3XZkQpoV@O&m
z#12N9Xf3!Sl-#7n8n#-GQiHIiV+okAO~Y{wY(t+TTN^kKP83|&c5UrRIY%al2y7E=
zTLIS6_ux)Z^JOeq#<yZKj@hj&ivU}WNXDVfHIq!C>`~wry=l>9$fPX_0(JgQX}?l%
zHGie2aKI@jV+V<$Poh81$4xXCGL_7bbQ^+ZkP@bPK23>LHrewT$y{qV?0npgH&j#$
zaUv)M<?kl9z8QXFV$5s}$-|`id}4s{weRY<XzOw6KEm5pifYNc+hZI#L|4kFm$xhB
zWB(sCAb3#f@JsJ?Z7Dljbhq2*F1?0p%b0q!bQAhcpdEXhF5zr}S*wu_LhbfrV1lh*
zE=B#q0d0L^rJNsCzrWAADyHF93kZLTA;*-YHY<(IHEKP7((Pw6%aBetGp*$uHcz)s
zJtO^yx|J;Mr^R}LP_9USecamQzCeID;-Z5y0>chU$_(sw#($1h>yc_l*h0C1C-TWR
zuX{nVjw+njYS<5DkRqx-TixMPV_Mbft?k2HkiBOLF7Z+gXzGZ2>*bPR>}8@+?JOkH
zhcp=r-3O(JsMVy2XHtKmUGw7?(NL?#9~Wx~bDn#2G<yDWN1%mFr%y&hG&l{qhh>)9
za}|dS#?VkF4Sk}MMmq=bOuvD37P2iu_q6m8@^Tox%g(w)jhY%k&QC8!_`-_7Ni{ke
zcCe<5UItx8ld$z@wIggjToLr!{9meM9O_F1>&!fk-CldukLJ{VwS&oSZmUvvRhgSK
zdYZ2ILLJBMe^Gn^tBL7D)ub|O@HU)|xgq4V5cfo8D1FtEAR2RxQdGJNoTR>R)@Rwf
z)nlY2Qs2ZU6!pbO9L+P1ij_?EQ70^=FaJ-sD~U}*9w$OMfXTaA3XBIoA+b=J+D$k#
zG)g1&5n{R7(du{p<Bp5A9<6qSt!(~wBZ#`Vtn&F~p#4bEj3V)*gd?T#!5Y%>TTp83
z38HHmWpcG@0rf%l_1P3Q6ux*to1x~)HxQ>c2?Sic6A<c{F7{VV$Yovn5jP*LMe%`>
zIYVj(Av4H1ukFqNF|(R9N~7apBkLt!29S9~H;*Wru#_=jy@P;smJZK2g-*@}O&qn!
z?%0l}Cde?m_2&Hu^X?7fFOM^+#6s;3fwY<T4yOJ>b%cPKLc0%Q4_voek5)Uv8yB4}
zR<>$=_j)&EhX!en)wfx1-x{<myP|xfe`qPqaygsDYf-V)CK?W{z=||!L;i05OkG!W
zX-OYi{_7@mm>z)T>dxuW6E?MJC4kyNElU<;JWwcl2WPyynKKt?J%v6a+01Q_eW5f4
z+w^5R*3h3~XdCJfLv@EXlyKNXeN#u{TrMQrX+`NjvV%bO7i*7eggvLnMfH1)6cP0q
zxBVzu>QZ+Qww_Jx2wPaK&uWRh4X$<>!W>dHf?LZZUN4tt2a!J8@BYOz1ZZvXYS*AG
zn(b4lN#B?l9_ueGvusl;d$(Bh4o>|8`~eiH%P{#rqV30uC@t&oMCq%956>`QE0KwH
zaD&axrU|8M_n|+GFpaE`4AN=6mf9m|8LAUBpq+&S`V>P?N%f!A@@(0TvHYf|!4vC=
zqet2fo@}P`dCN!%gZ|Vl37|<iG@3@%lME#!JAZ6MN4g<uwH~JiVe1O0&JC`W^P*kq
zeTe-Aq&1ScymTbr_Kq9{1>gZv$`CC>=FfjlPL_!Q{xRP-D*x<V;+T5ncN_|ruvU7`
zOZu5g)(oHn(ghQ>jZXxi=<vaZp3W3d^sy86kcvspJOcEw7K9jIp~D9~Qpy-a6R^3o
z$;_{2<@mAD+@W+^<T2>;Z!N<#Jo2=_N{udqn8sxHmG1lo)6mg`Y6=Hy2;0+S$O5s9
zum8qZ?m6(S)-`o#wB?Qp0L|%4+26f2rSgadoIPF?V&m;<8EzuIU&S)lj~1^~7k#Zq
zCf7WjviC@q@kyK0r>Nhs92QESV#zZ5SMp$~eH_~>XU$lGj4g^kG6TlJKVQu6NSoJp
z4Qbk_iI`t4qNY=Wk85-^HMVG~HMa06JWr=i*oK)$-N;FxAE-a`de{i%DNA5WieU_&
zXjEThBkN0aG(y`L00EbKZ+}{?d(<GjaiuH%)8`spaJcWJCQ@cdtTamR*I&HWpng#P
zth|_OteD0uIvu&R2+jrkIQ>!X<P5;UFdsfBl{)FD_4cJdCsH1@rF^#xgpG~>R^a)3
zr^_nXY^8|YQKulK8Wf&QDZ|T4q0Cl#4TpdBE1%fUvYlJH%yx+Eexb}AI&GN5#F$Y3
zH)S-Tjwu|5ljAEW001BWNkl<ZKw=ONGIz)r=3-l|XHbK%<p{iH1h4atGl5P8^@!`m
z@R8pye|qfSV~+`_o1HuYxa^r?SK>!gvP`C6#*YoauiuLE{ulnG@8#CeTxK$P!9Qdo
zCJTsw<-sQU`&<?a1t~^N6g%ke*$!qFo^U9GE;zn+`eBpgJjlO9>hr^xW)PDL^g)C}
zNbS9YRsaY*%+7z)KkT?@>lxJ`ylLJ2!W*7OK5RAD%$YSS7r`YYcJGU?yszKq1fjCH
zo5&EaEemLki28004;)0y8+zU%^4_xTvrnZAKTcoFO&(&(=!#FvB*~@|_fjxbZbS_7
zRSSs40v0cL6^9IFOx9KTCoVsIK)iZm6rZdt92z4fL7?T1dg3SuL_GYy!|x_qt!Gsy
z%d|j4;(^PxgftmKK_Qnhu4_dDd{@#$b>11$h~zTAOctllx%WF>VIFM%RQ9y&@Q|&;
z9Dh<8K^Xb2k{+Y|UHU0rjgl9mEYz<69Z2pEn}GVEY6}A!G9E4^*ThVu_6tJ3oL%sB
zKq0geR-kQ_)Bu)2>J26^$O<+vQK#*eX}E*%<g}MP(zM^m@<_1+!u_viP(2jdk6P!H
zAqy>&-Ui6<iK&i|l#8XO5Na{kJBwE9@oGodQqdSRh(=0&dAc=Bx+g~JJ#cD$7Pm)b
z?KM9a`@e2ax$K9-FyuY>4wp~Kms4W@&Z%qAZJA%s%N`bYSdw>=^YgV9Ce&_4YghXb
zWARE{6ijK6o*p>WnMes~&KjgCW~lTFB2^au=b19}|F`$`!Io9koons)UVlL2G@wKr
zPz1(wq99_zXnG_g!HO|pVuA!SrJ<(cU>TtjHA$sXshXOJBViJUsRUz<rpn0#BylnW
zIxv>;3qc)FRHC6sMyC|hH6$U!SJO@Rd-tsQWAF8~_dfUD*G<3o%w4~Fb^Dxs_St8j
zeQ%%N`K^z=*>DNtD1ApB02e8fBx`U0&XnM&(IN^peNb7D#4ZX1AN$kQDVGlfrXv(#
z0KB~G9tEofd+SRy^3jUI^+NUB2q{jZ!&VMvI&*W7s-UBsEFg+2ryCM4wM2X`$cr0F
zP9ZQ&vZl)yBUzZD3?15@XmX)BQm<@SQvC>6+7%`#>J2z+5K0yxvETy$WJ<-dY=me;
zwPCY5%;Jx{YDC_kJOK@r<UZoHtN<X-I4a{_zHR-^@|bG~ad8mJC^#WlK8tgfcrMrh
zb;XInnnsPYu=C3Z1dafq2m@nORf)neEm$eP?kQbm$?9#kQ_!DcU6NLY^y6Zh2B~Qf
zK*cD}>LMx-ST<R8NaD9+J?8`~Ik{;fNMTI!dbgrD1@$(2j==uzpt~iWh2t#kA)UgM
zLqLnTEODnp34ATlq@p#;B&9mV3(r{!gz!_pu%hn(W{7#*?EpBxAWt7NaPItovglGS
zOg>mfzF;E6w3OmG7C0)z4=8{mpWT}4;l*}i8qamFHH8sJcE|LmAu6UiD8y#BWdwxt
z3?nL20vNV4cURM4L(i6_H19$?z_B@{9UJx{{VBbk6)YpPH}ndPrIe3m6YGF9fU9Y8
z_n0q%c$zuoF*_%D`<p-jV4tE%fpFGQG<MNq6g6%_4ICv-A1s5LYWH>^us(!oG%yd)
znntbNkGJ#e+p?q)W@p#ziPqdD8cIX(EK=1s=!C=gjZ$vIDzbqz+ba>xqDvBaLpkE5
zOhA)EY)nb%WacMhEJf|Txf!`CmmBrujiLact1>~J8HNWGin)^)Ptv)$yJ0e=pJGAH
zx8Mu22xhx0X1gn711u7hI(a1~`EHTqF3ZA9pnZ|?Dg&Q&puRJRx3p-!GTC@BL_=AI
zH_s{K14nZw@=DSOkO&gM$Ny_M2m?ojP=tXlrpv^+C7_Wq{*?BwJ=*P6ucoN3ifYMj
zU|nD3pxmHDtRR3{hSyj`r9|Zn$*gIpm!qbuoNJ+q5KJR{qO@u6*Vtge$V53*EVsU8
zWB=r+mK>BR!7^ev9S|sS)C`Bu=yJYlIL)btECc~1<B&C?Xur~Z{Z_ELW02q%F_0ET
zm{(j<QOJ1|P7YEsUuW;95(umVL4*OQ39o&ysK-g{bVtUEjpm!ttA-IR<#cGz^P=0W
z>a#(z&|A%m;}%gqYBZi1G)ITL+=Ms?<+Z>(!?|?KO~@38Twa+;g&nm8-7srY2$RWT
z6czKC1i>=(%OERVFy}SSLh(Kpt0~Gb=->z!@|yC+&sU715+EuD(mKVy3X=hDLCwm6
zz)>Mgqk-wD&53Ffl<i!Owq(jiZ8TJj9_R_jG2^Fett&mz+=XThg4lKQA{E9W%0Zl^
zgcl8zuu>T)p-bd0O8;%Y%oHqUdQ9XvTk_2chl@#5B3$_rx(m9?V~%=MY@xQ0<!p`)
z)nHV_5{7ElpeTLGM&d$o1lg<%CYZQbVGZw_^a^3>l0;DgM+;{X0H867nqbi)A`>SO
zW>NU5KR(?3(F6kXBNXAn!{{U$pqXn8=Gu0T`YEDNcE|s!fSOu0R`r{^Ab*tF3btC?
zPt*-oS{+?z)MOpc;zDK`P}4&$H+s%Am3PhBgev}2M?xzEZLnxvht*y&pYlXAyb`^O
zEOo)9knNwqmoNg6%P+lp#SJJDD%%$ip9Fte{b!wm`dJbuO!`C~IEj}@y+IBH)`?Jr
z0fZbWff8&nT5amKS*_lc+YR*RmeTQ#;k4rbRu1y)Fg=;rDYso}7En}iMp#A4<N?y4
zAes0D+?YrUV9GmVi>6${PY|Fi&s2#^5((xsVo`oZh}j#ldJ&6o%U3X`4**CUBZG(l
ziMy2-GEC(>vSL`rrYL5;#rE9?WXY_2pX?f>YzQ4n8l;pvMaa64*8?U5z+@-y2?UND
zL4*OIq4l)zBhp4lj&WhT?raBR<?}!YY=jmof|1=(QU|R;;BT<HS;HTh1vPdQB)GI(
z3xr^x3|%2L)F!zq*iECDs?tJgXb+i4QR#phc*!np$d&adnJ<D3mpWdiL}N+|Q_2d7
zC>)(%2>2ZU%hJN&M_t9W$YFFWSY{4LLy1fUu)(6$^7Nv0lW92+I7$Q&1^`paPdD@E
zAFVr87j{)(+gj_`GpbIWZygT9W~V3ns=rnaDp{cEIT~KfoWV3^7!lM*D5PU#9|7ok
zKw0fkzvBSCd$hzTnvV}ro)wn8bGBFfzQXQ9{Zh!+<XKXM-QAZ}l^E9K4TN(0WdL-Z
zR931as@C5hsUj?6%-+E?WJ@cnY(sc{ezlY-uuNe}2>6+s!$BB$8W2PnD8R%sLpyU*
z#c)t>qpb{3<Vk*Lc6qV4Zd~7Hh<1)H{V-NGP8`rWQ`-bjkigbXESAXfoVGzOV?$Ax
zGAH$!tbx{2$~CLLwH?l_iD^?N^_G_eZoTC{qXq44tCnpPVWkeS+=(x-0<q{n5W)qL
ztVcr1gHYZB%;*<)Ac|8^)=?t!sV7J(g_&j4ItUX&k%I)O`RxS)M}`QN30NQiBscH2
zJ0#n^C(u}Zjq*6sE=}pltP?fGklUfEPWLLZTXAfcc&k(j0N`0;0LV~T=?2+LRDS?q
zLtV=0IW$IE(`6COCzv1_ca-Xy-Pjour{jZVIM<LsCWA2@ll;Qs+yesm@oTna*0v*#
zI#Q*x!iz3t!sZKVu#7W`va|3Ae@}rxi%^6CBXlYiRg0=d7h+Y|-^EV39_D{*KBz0M
z<FSX<l-Fxtu0n;JY!*aw3p(9)eVeu9l}jR<4%ND;D$wrx-Z?2*)pR<q{iONIdy25!
ze#a0B2%J_?Xq>;#l2nofEU_Fkqa?ae=nzZFgj0lo1Ed55l(|$?W1e5sdk2%vBLuqh
zLtz&UJUs{^3`{}wxCg%tO`!yi_Gym~wSUyB)1K%zJD)8D`pyWoTWg}b=*X^8e$!jD
zN85{<08hR$K#@U^AL<GbPb~$K?Z4@kyu_H;8OwI)O32i){=(W2>V}Cg$dNZ?tqJxN
z7TYp1@l_!+%zu!hN=?>8$xjqpbY@tq1sge-kWz`132Rp1X+scUK+x)m>D9*wvM((7
zoY7_*>chGen<`qfOMy_|NMWoJ`ER;6MuBcL3N2uNps2n(VHcr2jh5`(1h>wNCwF3%
zdMQzbTC4U>tG+*dbqIvMIdl7#=Fv<eP<oM@(R&vQ0CFV+0!TUZRZOj{2qBM>&OQTq
zZNer})Xppem|&Q8+kwD(5JVV&iY;am;8gyb#)7lk?pzC}mUIPWudCRU^lm}Oi~z91
z^gTJ)Z4KRW3L||3B{LA)uZfhY=kx(Tk`0-Sd|JD%?MlUwYyu_Z*|+`p@Y_Jiagc$P
z1dXB*Q7>&SphnTs7y=LyB*1~nTLgazh;~kyAsa;#aJ&o<0)Fm8hkBzL2pkE52m>wF
z#aON6st->&(`;g0pxbS^j~bocF>FetNjBKkH)2ez1e`448u6bvv6>HXXzI5&Mj(RG
zGcI#rQ=cWH)reEopk#M&SCJ<KsLiByxN1^FpHRsE+Dr`|M&&}#Y!xiI5!_=kKEk{(
z@L*Usr_vYqVHG=*uq?fl*75rc1ZE@b?12oFPa0-EWyT)AINwJ52mWZmG=gm}tDoKM
zd#wJgo3N*kHw~E8p8xB})~fOLPO}c|3<W9MAlH*-tNGhHpIKfJ^tnQUMcs+Q$0HG>
z17co-f@i|!NKqFxs;B(eHQVJD^)fuywob0bv&KN8vihJ-C1WTs4T+NonPLNhrxQVh
z0Yf|k85W%XX=7@V+W6WQ=5DcDah|hlvT^6m)g8}*HRq9`J(*{`+nV8B>>byN?Ey=8
zT;kSmnwAma-f23tS3vGhlPH@0H}Sf?yEcrdX_b2G*)Ce<Cn#65bB)%2Wuj3ImI0lf
zlp|$A5eA-4glRMYkX2x7W~>#}Tu+}~^hRTU>t4w7sUryF!n#+s##j%#7F2oA8;0YR
z&<*E-4~>})Q>Q$<{Uf`&!CpDIsbSc`SG<T)bzL-o)|IHHQ9B1||BD`V6S|7pfF5mL
zrZ_7yXVw>D%T{HX!Ie*usbre;L0OXi^EZWqFz|FD6k%YxEp$}KG`qPZH5En$V%?3p
zR#)C(y;+=vW8EB=eJK+jOgnw_;;l`R%j;fa-Dk<HtE*Pwq}6>@GBM9TGb>rX>AcmH
zT-3P>AueCvHq|EJi%}QMO=h8}!^|1+U?gBOgA7tioHdvuWtasMq_hrOMIbO2f(QeE
zDPcmKy`s(h6{eHlx*lXKh+N4?`!zj{T;0ej&so?O)km$((}1*JWBjegLaM7F)S|V0
z&+wK^r#+{AR<!4*h5-VgRMDq&ukJ}jd-cd5*nZj@mUk7IXe}F1g%JS>vZt_2G2@fy
zLF}Rs4#L2(KoH@gWAZn<WINO09E=D692?ky*u#2-#fs*LVHU=&GUeQnqobLKO+CkY
zT|b%GY8`1ayQdeZnBJYpai}7f&Cz-9rPS`k$N&)9$=l3qYMnpSI#sZYrN-vXgjJ`p
zjslxT+mw09qpv1c14;ndLHLE6o?6e12LiJZL>LfE=asQK>pH6|;E;)-Y0C1=ypR1c
z3aqc*D$VXWb03|Tty`ZVHI;>F*54mPa#rVA#?ozn3fgwM8&kR<TCiO1)z@sdRL|sR
zHh7{@A12c*KnPTYj7}YdK;TFa!7>2`30q8m)^G)lim|6)U2S%QwrwFr-znGflqWNG
zh-M0XBmgKOAwG6x%ub0M=F$y;LGE&es$5PW&>KYA1tle#+Jc1eppcpb)%5NNJ25h@
z$*EsiTLHl)4*IIbR9wmk3E9XAh&-E2GQ)tyC~LigCSDX$ytxOC4T1;*T})@M_NaMM
z6Z95fn%QQ1iEiN-t>r^@)=IO{DxW@uS2MZTTj1S}NUQD(&7-}pY6|u7?{`NV?C<)p
zRGTl~;Yb|-SD`oEwyD|PV^yn6G^(Yw7A)gLkQE?uM6DIWpsypCBW2Pc!J@njZ`efx
z#{@xyfg?kg)pFtZ)Z0_US^pAabm%wj1ToAc-BatbhO8Po^v7!!9Fb7P0!TF#pvbgL
zdv?ClniS3Tgn%<$R4*2m{5lY-!Ai@bnZ0I&&aJ-m7uAh=eE3}`UtGRI1kgM}LiR<<
zjoY4p3l?=g!a(4dAbwhbj2>^e!1|V!x<oZavDGKGPwpPIPM3zgKJ?@uVqMbtteQZ7
zeFS%c+pV-u)sME@_3<|Hs7XtxCW{#vXXzCuKeRD5Cbq>6%~)q=yu5VYbkOebcAjpV
zUj}qnji2Dnq3lNlNF`o$ebGUI!2Adz3;;l7)0zTbp(h!tn)X@TJT%8NU)9V!<mwA5
zBAb&1-DBLhTXmz;t1-g1+oKn#NRhfH+TGG~%gTB))P2c76F53;6_ByJ!LhyCMd;~T
z|CIcM4tvWDmie_y<)q6^P&};y#|ZJ$3bg2}By-d~1zSFw%Bo|T2K+3aA<;(qRO_}m
zI6e1N?SoW4GnGs`y`eztmfJ$FfTwp7{SJ;EYhfs`Tvya&w-R;!reshwz2}?jvg)g^
z-VP>lg6UB60-f@6f8dko%f{!!K^QnT2qFwP=yaoX+(U&aC9Q(#ZFiK}bb&ZxS8N{3
z^`Tjxnx`<vrg~W%*`0^kMsBS+)%S;bRiPbZ0&q(lW$Nnni&B4L(sE*TcOFw@q)T+C
zPFdkU{+{jJX%+vmE(ANRTC6w`ICh9&nE(JF0MRg>B0qi>fQ@#@|BQq<&f9X+2`7rC
zwlYP;`cE{U^Ri%>14WJzH&K}aQNv{1fjQ!alnZA$HO)DBN!^x)Ok)JH7!y(5ui0>&
z?*tg}f%XvkuM>fiEN~B*zWqd_$c{rO>n=&+L}U;Kjvays19`4d2`QZNS*n{;nfbcm
zmsHJm-H^dFj7Q0|2WsA&rqF7^Q$BOY*e(jdIc=F^)Kbd-_NY#8R%o)Jf^Ju^S6H2g
z(!J>l6G>O%MGjBZ2G;YU)9tZoaQgRY-hZUO<t4$*MedpqB1}1(P!lKU3o+4l;FuwZ
zFaW$F0FXG$+9#$yP21;Rw!|5~8YRGquYf%UZCkNhQ=Zx5(p4C%5q2FDX!jKR<OVqx
zl>E3tDeQH}uc*Maan$vQ)oj}?sIxn}rt*v*t$HOTlKUdZj=i>Q52nRI<qFjP9EhqP
z4%!R~VL@F+q`tCPL^)m*F!JaF#~$$m3n+N5(fq5J^7uvbwAQn`>lj!O<x8+*@@!?L
z;hg5+I2~54YU4fESgA_-$<h#QO%;VoeyAPv%BH*77T9{tQWLhH2qT7ELzz;u6YN8J
zQ(9)@NTDOadrNcG6{d@Ptp3;wnKT>}#7&rl1%Ws~ChVetjX)4#AY;tjHdYROSyqQf
z<idXa@(Ayxhhgs@=<PKR+bK2WZrt;~{;bucuC^x^>EwghRp`swvu!`HE@-y>>~eMA
z5bJl3nZQ~ynrqqFJ7-Yd7#c}u+b8(3U)XLr-OwQk9VP@}yTXD@{G2`*cG1AGMVLkd
z^COFmv2|R1Ayq!JZZ+@~W?g!&<DL{74l)>Vxp@hwoTtH<?oxT?Xj5Q}mJ&Eq3OsSv
zVMN?Wr_Vm~qDN`Ho8?QBO0lNpa>ec!F!Ng}l^Wlu>9WW^;ax}o16rdkh$S{hmL^t&
zvf@M_a7+=uu|R{Cuqv}(?X>a_%+AqiZTH*hJeB8qEO#!|?T&H}0XeoaoM*_?Rw(?}
zkW<lueyya^1nD7jnpX5T*E%@ujr0|sxn)1%R+Z~?EfN#tu3Ntb%s}-<#Je0}<laim
zv@)Qfp|ZqaHiRNC2`t=<L`NuA1A(~_iZCz}*a@<zBSL|nid94mYE(sCdF)9${UKa2
z#z>WJNh5>!(+8d~=UFxqs&mhJOMbq2ON~{u3tBp?&b8!fJ2vI+gdIJ17RvF76gB7h
z+Znq;7by2Q-bWtDJXUD95EIb=$ZJr5aA&5>ltm#zq9O|C=useW<OoF=sDJ=4EnY@I
z*sCDVz_Fhe`UmqAI-JslS&C)kVCh`TC8QnqTCkIAuf9OmJ$#7ldc$Zh<Ie&|ha?n>
z;3OJ0GrMVfBXkHtpE+;P%vDyuxR?PRAIc5`_3JltvRY+{{DYA2<ZS<}kLC?D+W-mR
zt`CKSFmP-UiZB3u&DXC6UKh$Exy~0HSAkWY0E|D1n{w7V{S#Ymum^jhus*w0PUWmB
zo6sn{mf>vkHESBBXe-z-)Ve3+O2+%|_C{11>RnJ(4?A1U>C-2kbKv%=@Yzs)E7=N)
zL$OEe(oG@<5hRH|R^kn85JC|KIw-TO0q}#!J>GrQUZI00iW${fHX6ySZ%>4p3b1>2
ztMI@rjR%z|#9sMWjEo*?IyHk1tw&R5rZ$%*E+N-WeJ_%+ULSIGdfx{^BQ#ydEoyOT
zn&*+{+>0N7>xytNmaGXjfog(;a~75oiVVWQ1|bw-z=0;R_yLX!M6Uuhvl=`x;?zdE
zZO$hRp?btut~Fn~RA}T(cRK4@3)Z`Jj0~t&vN;unTA2Z`u3SPw8agy}xRuI4YDkWF
z*H}JD1z(w^#Y#YL9qqm%RIfa<B_L`%4obh&qAbooy@||rgSK6T)tEn`JHsv-IQEG5
ztw4cJx7{*Erx0d6C#OF`?YZcm!DvO8*<ea(Tdz9O?I}Q^L-5+p)bB*c*mAqujRFOm
zO4ugIlU<G05hN;|W2M-NwlX#OLUy-QAPu&x4_OBF7E#jyDeSv{$DqUGrYm3<An9i!
zwSS5nL`fn9Kr06+9#4S{Lj2MK001=Pe;W#%E$8NBO<Te8oBRSRFXJ4i8~y-GV_s=h
z{c;q@Tk7bf<_^#{Zf2a}YoT3<zRDfpH5Oc8sv}4xIp-|ouA;p!nTkdAq8L#*PKP^b
zQWUh?GG>lw%?vLv9gUzw?QH(E!Jk6nfCLGM8PWIx3-jp=G6|$UAW#bbU|>TKrqKWZ
z049#-Q&HGUlP{=TM0MpZ2Q|$i?=}&KrOjH|jJ9qM)suE=Z)*y44Ci-|KaALMyW%61
znqqxL_W2q9!%91rI((uqyOV=%rtiw_=agTGb5iDW^y!;LO$%{Bn|3U<X1&3rOLEI{
zR^6KJQeBb&2JV1Z;iW&tM@W=rPT&>@JWU893>Xk#O8L>n6L9N;*3`>Sw(exmQ(&HZ
zHFwS(rQwhCCuebw_IeU(+2D_+LKQWG)owj?N`Bb4>HaAEXL+ulQ{VKVvS*?pRB+nS
znnPWBB6FUbM@?^AjGsbgJ=&W>hvdpl$5j*pyPFXR2oZ_zo)W(%pkq@oR#Qj-pSk%k
z1Omq%VHyn_9a^etNiDNMc?5U4O(%D0j-%TY4$xgW>ce47O=Y7@T3~j$vXCPR^_Oze
z)-<!;&LCqR<%JQgv6Lyw-iOPn*E-1T<@)d3e&p)gC5;dOtSF@FdyqM0+<Ss2GxHWu
z*-^)7lK8sSA>tB(ORwU<QPPmn9^-P>M0OBT$ict{A&4*llfO9*02&IKzT4^_zokS{
zJ$0wFg3xKGVODL%>c5s99UHkr*l?TauwKyUFn>oj*u<{Qq`{LVD70uI0-iq%)MQGs
z*pOyon3n;eMk(SFwoH<>sj{=M=2s;}GZI2_)DDj?@5nXgGhsV3u2Pv}R3%czrbC!X
zN6Aks3dUKuUVB3zaO4QnXkZ+@toV%bm~Cc(Y}6ofE7&?68x;c6u4l>5l^8bC`qq0V
z&ukZp!k^T6kVC~N)S*TR9A%QwUh$uE>>+^Fc1j@Jh>)4@lJXz&0B{dYu#Aq6F^8JV
z@z7OlSMILjIlF5dbxk!Df=(2YoM;A^Kun_vfPktsp4cb~NRWt-;8TAbcG18FA&4;0
z0vmFokwepw04Da7b-m+PPw-NtO*HO6-SzcN3AS2L^-E?T)-st%ld(E_YBU$sR0>Cm
zTp1fibkQp==9BpwW#Vbe-z2usDw_~IDe4=B<GG6e+z5>tKe47m{+FyAG^6OrFE=PP
ziHyq442rUyD<{fa2!X(cA&4+=G;kb=SktGUvSnH;^X>J>ua<)vx>;8!8q0BERcNe~
z!j!5b(bu$-%W!Xn6pQ6k455Hx3-xAFzMRIkD5XedAyZ&O<jPgjH&K2*Skw;b`a)y!
zC8#dfZ^XuhsyVbUXtIR}SS-2{E=BSsmlzp>MD@4^0>>0VgaHPbr&EF7E#dC-aNF!U
z?n&A^rgm9uYc&2pFsejLG;Gl|rL$veG>UMN=Rz8#MgR~Iruh=}O(B>pdo5BbRVH)&
zA$zDWpBz&Ar%;f0`?bNMo-$|9URz#kJJMJfyIW~QK9r2HG!@?|$uEg-noXksNbrdd
zhg~$Vafo1<KnG^7(V4)J?P>L9*TLpM|9l%MT6yUzQq(7|%0YmV?Jf#32e#PC(B(oU
z2f4J0CquyHD$Iyz`On^(xEqBOa}RS&CdoR2-iT@`GjCwcg4`v`f^|y!ymUCvE@f56
z&O#oEpZu50$S)iGSE55v=NBzT(O7pWu)zpL7|7s<?!Y#zDbi4OJJB>aTQ3&MX~+#-
zVwvR_E$PysrzMoLGF1q302GA>6&DKsHROkW7lg4YEm*U!p(3gt|6mGj;HW1#CKAhw
zrf<r8)rP%vr_k)8$#9rPdn1G=#!@p2Oy^t@IwT~KgXIr+l@k6=DD0wvO+gT0pnxgx
z2u@`ZE!lwMT!`|o)N#x9)mL}B)URU>m5XC_Bjin~hW|9Zfk{*(Or|9&kNHABh6|Zo
zD=k=&KrI0ceHvZZdJ2hK18|-~-q5!M-cY*Y1do~p5o%JbHKO03rUlD?TrB}poeYeV
zgYMIRw<zyXatRTIfxt#0Orrq+@ary>BEMVJA1n86vO0XT&gbr-BEK%}8K!B-9*pu~
z0018#Nkl<Z(s;#u9n|)%J22Pu-o%OvO*9C*?iwMeS}?N_X&pZXuFq)OWbr2ng4lQp
ztrO8_N{E5CW<g|=>1@lV-<Wku;s{TFlyd}m*6gyuZxl6&O4cC1lO%$V{psqoUq~SE
zbR!gD0000Ja|O!eYU^u2!|Ds0@KcektZGIjFhTTGVst>xZisR!Z>oo{<-FFcYWXi4
zC&BZdrd1Sm<8&Ke&P8TAAt-_}*AXf*e;hSx|9IdiM<dx_8ScM}k*RH=ysP($Udgql
z(K+c*+V_N)?5>l8`LmIOIcf%g00#ZJl(=F&aR|F;U=t8T7ytn0?aLEz(*QlcAesqH
z5P*De=ZNF5<4SC=>W{R$bqkeZtvJsT5(_4F6M~DktoTm|vSvOcz{ClBXin4)ns61B
zm`#AIl|@p9PJ|V%EwoKtqbPO>&+RspHiI1vt4;MCCaJ07+_c;=idxNFeUto3k)vk9
zK^WK!glRNzgi!6~LiByX9GMo1n*5qmJ+D+M(6mumN41(s(aWS__^+h;>4i{E=Tk)V
ziVx3<OVbVZ>RAa09q*v-k_`$qny+sZg~HR$_1FuULG9-pxf3(vWq2uhrNELMQH-2I
z{Srq*Z227EvNt9%e#)oaKq4f%{lAA@G_cVKMHrY5t@2YVXd@iE63|&h=YyvfQ(SSR
zSVzGV64-ba<|h{&BO#hhsOBhw#K<6s!;h&~^$lTCA&8EfZE%f=8YK-MMIeq2%`_~L
zqQvU3b_d!Z7x24ng^`W<SkULu>zab1{5T6<0#NhvN#zq*6b>NX#OkX<8AGoc1A&c1
z5Mf~bAoNcxYcB<52~tH?isg8<G53YLyQsU$PNEli!<#6xfz<43LZRv~&wQfcG6UIW
z$@C`~Em&=kSAqOmpxfw~Eb}5*uOTUu8NXnU0>?=Xn+jyl>YVQ4T*T)GWl~TSE_8=9
zSVriuOe@3RoBbgK5e7C9L4<)G`p+YygQ%HM&2wRi`B;x-v|OPr88e5XKkC}B;iFWQ
zd;4eQyi&Vf;T0b{!#7t^8mXm}z}<D`fm~>w_cmlkx}idlIS&d2dTVDDpQ%S12ce7n
zoGA*KUxm!7Y6MuUpe*&k$i6~*MG-n`BoI+(z9+JwQMuaxxOHuPKbSz^=|B)+U?wV(
z%SF9v>!rPshCC`hbGvA(Ro2ldq7YdBfqM)Kw<&4aLu@83XQA&HU)uQOtO_)`FkiDy
zC9E?Av1rgLYu-n40;N9ft<N-C6J8?<laGZ-W*gNyT5dLRUcBU2q=7OQ+E)&FH;~~B
zIT+Y11Q7=2fg`y>Ked6hSK?Zj`%;;!>ZZHZUH4y8O_vW%DN;fe1c4x32-1`y%}^vD
zRg6j%5TqE2fOH7OAVs8vBIN<3NtY%a1A_F9^eP<*MM@x$y*&Hw{tdhLmz#X<BzMj^
z-&1Dh%$bIgicuf(Er(o1cO70S6Ssfpt)mC3syfLF!?oeQHBv0N>;~a@$*k;hMpXY(
z`#Swwd@2<P&!6<6({JxR_n_3$vD7~!O`L`i#!U2wN4ok1Ql;xMx{x5?Y^?yU?#RdG
z20Y~z=z<{??qq!`b!t(y9P6X)xcut2iPB7PpR>EY5VCUN;Kk?M2et|i-tU-llP;sA
zM6Gi;)Kr(XA_F|YpTpQl%2`kW&4U#i55Nq<uI2V>T3W(Ldr}1`xy3})wm^$eDZ0gm
z*=oqUK1T6|nmQ>5&N54d>9+fit@vvQj_n1Ouh+<BDS#9TQjGuYZ9^;oy@U^sM*NI!
z0Mnrr@~J~3-ai*px#A9<l^7$jFkfd(58f{#oKDq#KuaaJXo`B%_#egD74c-FlGNJ`
zFNX~Vos{iavJ5;PQe@wtR}StecqN?`{c#Ut=!-Vu8+6I)<EZMQ=j70)Tw=b(+t^N8
zfe9dJxb`?N@?3MG1LjahVhuU$Etl+XT1kv?e#zHeeiW+x>XAFOLy;eIZj~VUSvG@C
zqkSeFO{YZkW5(F&-dTxXlJP%`U8UV-<1DOT=H5M)CI^2p%TGk71$=(}1C%E<d&z5~
zVCQz|YxA(zrS*#58in*hWL#DU)-%EQ4-4z<FRtr)oFVN!JXc9Sh4NrQpw{0=Ptw-m
z!mG)D^oL1|)F4Zy=)?C|5hBt-7c8kh;W53pEoA(w5LmSGd+StmTk~mVovbrsmOCxV
zm4UP}b+?EEF2;wFMeA>=8HA3n{X%Gx+?d0<vi|*R!lk=oPsOS$#%A~+6N3AxpR>I`
z%eH!OJ2|>Q_Ncr05jp9nFdl5si~Yb4JvZRQlOSOYoq#YkHI;6u3SKPQ&MusxSM2Vc
zdzkl<W|LDpLeDNL)k>h$-`}gf>Kw}2+l`Pn&MtYwE40YI^M+3C!Mkxy%D$SxTVsD^
zIiO@?7E-w$PyRe@W|sf!VN8rTVY-m|E9`nlhK<!gi1}x54&%KCr@6ra!Nfn-@lRVY
zDhmi+lr1Tj&JovL{MPcXi_?>8949?UMN#xF2xO_&@TphUx~c4VS@lkMN3yvO!4CGB
zK?I5Tl@nn^uK8{}Q*d=8gIb!upVa|n+c-cUI(!Q;>J*aokm+@faFmZhk-oxyf12%*
z?Qc_VJ~H73s-jr-Y(@&cNcisuoRlFj&++TZA9VWsVkoFwcsLg<Oy8RuVg9ICGF{G3
zkU7%d%)E;kn7|ckePpC_FMS%^7ycrF?(uDt7<u7L5%L=bKchM1Zzq+%v5(t2%hazf
z>;L&4yfVx`gl+FfOi8IlAiL*e;_F?qhTN^M4A(#VB6=KV$tzO+NY#}*PAVn!Rkfpg
z!3Zjp4Eg+nrR^9Uxh#<P5$s)YRATnEiJ*70Fvi3by_1=G6a{lsZGPPrn2XxaOj*ub
z13SU2Ds;4;Opw3Npz}Q~&Zo=5ggAlIZ$jIqSB8sK%}k?cnfPJ372{kJqU;}|oExKF
zl2GF-s*Tc69h%8bpQ9SduIXgnCb6x<V^QR?=2!aI4j1)80r!*wjNLe?#xIT|ysd2q
z+6;km*r+TF2$J_Y{CbL=6|O*?pL<Nl0WPmLm~VdameZ9Lg_dXwgkWJlNB*I$GdkT?
zl;L!=d}<qp5fow=J*)5C3iiSh2l~3m_0=Z_RhnF$obe&uVIT}4frcc32!qBg{#1Lb
zZ)0&Mg;mU+E0jM(t+{p(6)YCSgKagiIt;d3jZS2{Pp-k1m-eI255t&h|4Af>DdCxe
z{$U{@0bZOa$$dDd>Z>kFO~Xdo!(Kl7PrWU9GK<2q&3~+5Bh4R@NCXrev?_+fWP<tK
zt7L+w)C8}}KnF9mcp?}a2*BnTS%`7hK#A~xtllBs;OlU#9j0qq-&Vhu$%uuL(;Bee
z88?dq&L_V%xm|?lPH}$@9aTIkpDJ8>QQtk_lw;cs-m`;c)o<zKDS`^LE8|LEG?$A1
zZB}V|!315l|Bz!Ta#49FJEOKdyDfv<^tfhGO#+<dyae0gx}}-j!B(K8_8f~bM3GoZ
z(CH5%p$ro+*r@%&M(1Wyrtis|6kXt+j*&)C0%KnLZ@!hNggB^lv&!*yaYhcvlIklT
zwXVYB^QB&ErO_a^CfESv%SO<q?sj;`y_f_ceOgY6&DiWoEz>^Vt34YL#O~6P4m$M=
zC0#w}3diO{TU#^p7r!VXIl}BV9fRySw1WyvdaCX+(5<%XWRop`koA-<mW%gWxdR0_
zLxXiSgs`o5+7}xJFn|8A1&AR(hdwse)ut3C(J|C+LzqL3B7;YI4{CsVt@jpXS;Afr
zY&<CQV(h=}6;thMHhj<Kib;4`BD5U~VecoKy-thS&|_VuIj@mH#+*^cr$ECy2h?M~
zAZ(cI-QG0@OZTWca?y%ipWpxh>BK<if0Wi(v8=h1Sk959Qix%6=%^++;BoxgSfV2^
zOxtc$aM&bdb7sdfN6JX*(3@W^ZVWGk`5uL+>%J+V!rT#Nx(_epP#42LuF<_K9A$k^
z`q~rlt!`3qiDUU1U-7l91$Men!cXt3K$e#7Xw;^9(8HJCU+}0Op92On0zjh1a-m+c
zam@$cKC=#=r+^comN9wy2J|d3g$l7rl5Esn!&;wgn5hsfUN>hC)2|^LLt%)U-}J3b
zJ)$T>C$CK}Doc)1-rql<!-^m})Zcl^&eVA>ZD$h;rpna@<>_XBPkk*8P0^mFR$UXe
z=~_p`woK6bivvTLK20EGk#b!)3dG!vA$IA3f+R94KXSzBz^NGTxck^;-3f-6^a}PF
zC&J-#L9gVlmB&O@5Cos@E*%wh(H9-15EX@4sdY5KQ!`Yx&(+^$yIAFdNen3UlA>Y{
zN&7TP@Ww}DVXNyrBkv@I={#@BlwcYSs@AcTth7%20QzglGa6T3OwJvKe*k@rW=`a=
zipV#4s)kY%1ob{n#3$622uX)t#j=X4T;bF_T6%G7F<52h9VHemh7WF9LK`rPQJ9Pm
zX|q9Gs`6!gO~wrZ-%G4i(N^Y_K8!CLvx*3-h(Z`{q|0+o=%nWB9k|8%iCFQJZ(NF9
zZksshc+f$me7r~^02fw;sK{a<AQf#id=lkAn=c|g_?b+8BM<X<Ag~!m`H%|QK%W&C
zE-qa~&FvB2qa*bm)ve?t(8Icx>!2h6zhefGF)h#-QnOsp8=`g8KV*I6%Dsw_qfsmD
zC-0d^Q2m|eBlG@|F*6<0+ct{btcC~7S8Aw%nBh5_9%1cQ&yliE&(){+3JV5%;an0y
zS%d~eeZ&yb_ms)`Dj!L<&NEX;{ouPG&)LwyoCmT2)bCRMQfUVFqQ4xK-vB?8jdQWG
zWmD&4l9LvA`e$OEq3xA5q004hdzGEr+L($%#9(ik8N2!`V2SN@y<n)7C7cH>u{#^w
zIp>w@l==7QMkv8ho1BSRk5^wCEyr$6b%!4nv8m4AD5Aow!$@IdDVs*xJ9G1pu7;!H
zeI$wY7s^7HPhj_KN?>#8xAJjRS7^sA+UPs`F$e4M$HYng)pU<H`Z)y?%3}^9npdrb
zxrz-&yHry_x@vS+Y8U{j=lxFtad?W!fYmaKB#h)Vi?8rfki)_4;XzE)E%2%0)pCuY
zm(wEZvTcwvK26%s{3~FF$Mr02dEZ$4-{{;oO3k|KK`!fQ(2ss{W~XeP5GBMsB7`s~
zxRc!_qKxEuELEr@-o`)5z)P#b6clkqj)L?P-DkNc161TSiW%pnfwZqsuUe%ShRH`j
z!2P>4LvczR$w<(>&(gQWtmRU#0COEzbRKAvL993!UUk$w!b#q0ph<91QO3hxju`i5
zK~7TL)_z+%+j(`3sXpanK-5<B8I9AysNN6RsFqQ5r9Pb0EKpoq`KNrLy|`MM<oTm_
zBqk&#!6qbhOr_tacoDwTbljntCn~odk^c(=qNVH9A+G8TV&e5H)IH1WTw9d~@A3AM
zuzTqgOi4VlPIlJ~x|!%WY1*QGR=tzt;$TGOKKS^?CMvtWSzM3S+CgN1-9h^E`h8Tl
zpOS?VT&3E@fl{aeWW;|}P=n?XsFKgc5WxU+fQpW+1PgRPfxN7a7a>s|28@>xlxcgJ
zbJW<dSNg0ler1%5j!kaX*YwGoPeNtzyoRXnE?I9$9yW%UaC9qXcd;vnt;w7I9Pf`g
zu@)bdv#l42O&O5N-pzzHC!5`g|8nsuSrJR6*<MUiYzw*djKZ|7I^X^e17SVz8tXMD
zvCt0^<qRj|Ek0#VndcUzu<N&&)d|3YYJ0GBj4_#J5{3cHz|_hSM3d4bpdSyUONMj&
zd@rX}4Qo2BQUeLyZ108wo?I5Fc!Tz^Ur+WLOhb5+(?*yC=Y$M}&6=I9Nl`{}_Nq3J
zePpKdlx<S6EaCwYMTYkL1AV;r=Ttq}0f#coXtG3a>HJ6?7}RyRY`$bTWF2bn$2MyY
zQmaZfyfjQU!2NSwD}DRM{2v91bVmtV6L8$)cjX<hdnC#Fo(y?1y&6N2#I~uIfq*@V
z=E178F8&}MFt(Fe(xy;2<_Iz7k=QR$tNzJ^!-KR`;={p?kp;`jZIO>JLV#ib5bfTC
z7`(&XER*$On#Jq~V+i@Td-)Ack{<4z%sKV~SpFcZvC0LGR*pfDR*us96lH|t@2KDs
zH1Hxz4)K$}AKqYXM8to`4z2K4g=$JaG=XYI6}%j*B!^jwX;En&a(7Dx59+5=#kyw4
zI>-U%2C=5EB{BYfLkVRNh4flw*V#lc2qXx{Zp2!WR$)SHcUg$y02I`LOb^OpdbW!)
zZpIWX=`QlRgh7Ev=-dSRY&Qlo{oZ}Xm*1~SgQu8cwy*Rc9CUuyj7d{tHWg{qifGL8
zELmul^WyG&%uc;+bvqj#nnJM89v`wwv?To&uKX8?q5w=C5P`N1EotI>BixxtAAd%C
z&JuVuxNrF4T$2hE9^v%slpYj}xsxc5q3~{c+m-O-f-Ij@^Np32>J|}xU+f!s5ZU0f
zA7R>|h2=bGp@f#Cb02+6%OXCs1j9XnlftXb0|KKoY~uO1SPdMxbSb5E4B^34>YMzK
z>sR>5`$ipm1AEX~p!lp#)N5aM@YSHM*r$WZDvxQzvp#7`)2cX53fpTLAY4iq7M1;d
zV=WdMs4hF)u^2t?*L>y21c-eu&+0{pEyhSvq}({XOFshJ8wO7nVbO}`t^1aYMZuG!
zEMg_OrV2;hKKDxU$gU1H@^0!Qc2Tv(uaDNRkZS%bLHI%{^1k2=_26*ws<gpV(h{NG
z2I-WEzY+W}D^>VAi4<dvp<a~QTUjCIaV<(Ws`6n}{dFjt`L4TaKyV->;Je716?T!t
zfi4KOlmgb~=T6%=MFGD`M36xI3%W2H0!mg#g94&!Po+PxlSyn}>}x($S(tzTT%sf=
zrHQVZ<O1%&Dwa~0@&-PIX#nfdz%y13fLs+GpgJ4inJ*h;{a<R(VZw_Y2)sBb^BF7h
z{4;eJWv96OwMX0+C<MP+CN)qO8I{BS9C8{xe-a)4NPeTZvj226Uy1*)vzr3vkMlLs
zMh2cue;Cqr*6qa`DXyit8)^&Z&J+6Pd->0f{=jLK_9FD65|In{oz;7#`U4N21RhE$
zA4mzNzZotyYY=ZC?6;gXv{Y(x2NL!U`W2wLe`CBF`I5FLD?91-f3;j3Mt_ShiT3Wm
z_bcFL8oY2ZTnb0qlLwOn0VdscF>B*KutC<=PUVZe#6%XD-;R4`ga4T)%x|p7T*fZl
zyWh-)vu}cN2uVCb@-0ybrUjwxGQ9KBBuz40r=4rX#Kd@)xGxsDZ;muf8zvv*f2*(e
z0rtn>X6l&0%KINb{KhKmd|STOv5}t{gGQeWKA?|IL~f@$ivhG)5SG|7_oD20mJTwG
z8%@{Z;Nl;1-qCT@uV+Ux?8%gQ_t{ADW-H(tnZSCAd+my&z_y#C&CSj5xv}v!#bv+a
zSuf;tjq|Hl8>2>g>g{XFM0}m!>f6`Vn(eDhi#C#STg8<Odu`ko5@7!oQ47`f1jCEq
zM`e}u_3{TZ>K#K-&ZP%4Yf5ZjTnq8S^xm}xN{+>8=;qV0vYn}FQRS~KN7ZG{>$J$5
ztLzSu?gRJPz%A#0khSkhTP}QHe#<xJ@7dwitomJ*0HHDL(O)dkqt`QhcU0R~R#r^y
zu7``3ej^395YJkO6`epPPFdr=HmniXd?rf>uMt}1T-z#Zxd3RcTfscP8Axz_Zgu+h
z_4j}K-gG<{iDol(QJuU0cGnWaaWI;)_HU2Hz$K-ntK3_H%J_#cMIzzAJ-xyWGF6M5
zf0dtJ<As|8Ud^T8dAr~7us+~Dz{_V(pH4RUdiky^%;Wn3ym;c~%(|K@_SFFf5~7iQ
z*2g=uWp96o?(gt@P<*jP7>1rRLNfgJyXFb2cip>|KPU$f_BwHMO=sDW;_|r0gMdo_
zE_@HU;ql-(^VaEo;tvbLk1|4c8P8IW#f4j{OvdvAa7E)}-qVxeq-Jsu)OWIHf9L#o
zo*uLYFh|j2RnF_9tF$!@NH{lL!Rw~t+ufx|=#?O^mb2Nqegr;VPszKBKWTfadTYwD
ztZ5fZW3eBXbQ_Aipm(w^FU?#6{;H*>X8gX-;n)*p{O|a?GcIk%egnt7M$Pugc4-6h
zTg93;y<wh#YhD3YLFQ*uzerng=W{r-!1F_p%R+1L<rn{<Nb@(#(RTv?yeqgYfIxny
zBbir%&UPAbfUM5W=ZWXhbvY#w9_JZQ0FEu^(=D?#&eLb}!~oDY{OYI94)-1<h^#VV
zwaDUJ1k`x)16tFtmhLt8zx180=X}_iZ8!#4b*ZY|-P9n$5cfG46qTqa5D!4(#eB1W
z?R>ylZOgec=pG=-yX#7|pz%YaONjh)jHo*te~xTA9Opg>=Ki+%rD#>yLZ$e)h0rj6
zzT?%jWtN}ev+426?07BkVogrkx-*7rz-PQtAim50c=mX_w)wD~Nsq7y=qA120@>Ly
zu4Siw3$&2;>Gc%)(<C-IFpZw`-foEUNl1g|A9=r%-LmtkGLqJbx34!e+h4*BeegXN
zF=&g^;iUZ?nO~+MXj~xiY_0G=25tIo3%(EicI@#JU4eM0-y+SDExTyT>1L7F&Wtyp
zmrO$nb9;0!zxlJd+V95=5r|)Udu)MwY|}ZHnhanSV;HBAmjo49<z6GZN=MipxVR13
znXFv9F@JIeeEwIDC=D@p{lNmXCI`>D^@yRr0anR({NntKuRmxU?<*jiTeJMK(_K^<
zBAZF+{(BKXYK9j8=1BDMoG<Qw#n9k;{2De>i{#!blk=slU%5N)Cj|l2+i@V{zVFd?
zmve^a)T`QA&*|{F-Bl|y<sVO)_Y={{nUtvB7^Ls?^p|eymB<LWPW<<)+?V<W-rMhi
zCUwiHEaQk5xPu*l&tfpel?0=?qng@T@3r*0T|f;aA<esC(3#kV$@*luey>@NU)8_N
zeLK0le$V=!9q}$zW*ipZKsHt=WIQK;EAX)7<)66vEpf={M5hwQ&}Z%-<4KcA)YyNN
z-Z@68Wh3tsdR_10w;sdZVOijPutyId_Q0FIh%|{tk8@@{`HjyB!+`Dx^IwubJUm>P
zdA_a5?LRusDQbZLjIGy<Yo~C2+E?f4n)&nD`9y4&&DX}pD0C*i*ABftq{-d%cNh-7
zqr3!d*#2sD{Rjt~-1~!#Z;AHqO!@cY>M;rTw7{*}02(l~aTh!G?{&9nLl^HM)(NRz
zuKU3a{-hUL<~zH^;A(5T(knI4>sd36Y)MC#Htu)ZDIKH)9@z!T=Jq4Jd6w-vj=mI?
zcDIa<=qUsI_#>F+f+eF@l*l#R-EE`iTVl6Mt6=wPe3fihAa&DkR~6>>oyMGp-_g+#
z>c0U8?{(ZjRyoHcLV+Za1K@YDmGdzQJNF)b_nX}^*MuS8w%z!evIBG>q5YfhPMzQ{
z<-<{<1NdBSk~s%-M5+@HCGJBHzNNc$3kzoYxncZ2DDMBflzYl@9mT(N&?^&mS)Q1>
zVyOhTXX*~HG*IS}a}--6NN&iX_<u+!%+EMovA9@SQ(Th++|YD`R~bURqniQ{Hyh;A
zi_8@?%rIWkpmaL);eBKOPbw6f*&BngRRkVly?QTjH-y{Cw)4|G;U#3MC6M@hZXa`L
z{Q!nsT1sC41#R!>nTGz<&R<~Jnq2_4ZdVR8A5A&BFQTk7<_|QLPlo`v<OMwVJE9l3
zrZ6x3Fh#1<okj@~i<VU|7rczCf_2+g^Yt#{DxUI)%NUI`xK+&>ZgW`11|Qf-jB!0R
z%)gct9<Z|Vuq@1+7vw2gRvcq&zV%pXrff#E)0r=^mMgW=rE32uzdms!CM3OEK?68H
z@1b>~?+RQ`bLBODKjy-|xM;uosQ<)E)XR~yRU3C>M#-(td0Jli^J`v^6YjjeCYr!p
z3-u7eUB`bs7R?V>;Tja4CpjlNZWSrM>Gsmm5Ydz0$w+tPOMIe`SbI#}*<H)M^JLDm
zz^K`|$}QgoUl_2GXugvBu^Zk*6q?0K50kzj79A3aB#o8C>4_y^eewTK#CU~q=;bl*
ue+%b<5Eh7RDQ`;ylMk078vGv-EfdN5)`^9MBOhBq!1Yl55v)|r67^qiTg<}%

literal 0
HcmV?d00001

diff --git a/demo/documented/hyperelasticity/hyperelasticity_u1.png b/demo/documented/hyperelasticity/hyperelasticity_u1.png
new file mode 100644
index 0000000000000000000000000000000000000000..568e87b14bb0442fd27d5a6661dff596e2796cbd
GIT binary patch
literal 42794
zcmeFYWmB7N7dDC$0!4$~xVu}SSa5fDin~(^#e+j>aVNODLvbi>#VJ~>xV!B1+57zk
z`|CUTkWA*9bJn$d9qTxw)Kp~O0ZD*xaB%PB<)k#=;1KlS;NTMg2(W)%bfc!=;3(nb
zr6jaIWgY+UYqVO{UcZ}YyM2GBqpeuQP?ZvfO?iP$B>zG7ycR`6aSsOpA=Z}%iE4ln
zU}iop2?&Nmr=3O=4uuc3gp0TM89VTC^8+OosVlYc5D_3RD3WSuST3J#ZtZTN%5N%%
zC$N%lF~i~HOL;|kMSHo|{-RBmfnV-V5u4m!Pd;4_dNEq~P&GynFkAQHBmn+@Ki5={
z0g|v^p4Ir27!WXYx=kmD69j~S_YL6t{`aiI|9#;9>f!&FKP-55n2Ixk+6!*-_b;z<
z<Ngrqf*7J%qBS>DUwzuvYFI$+cGTKG)@rCgz_qBy>-|gfK86p7!hL1x=RjAW5RM4)
ztNteEwFDH-oDoEFQ#Q4Qj)#et6UgD+6YnY`I8uz=O1(^|aU0ov<8XBn@B=zcqw&v+
z`M%7`UT%fK9wsKl72PgdQa9hi=h7_oq;5sXVpc)28R)*MuxWXMM1TdV|DBBxv>zBo
z#kmFUqx$n+bts+$FcmcB;TFs=2(r$U)3xrrI_X$_!30D9)6$9y2UGbU%9eC+OyjXn
zuSI<7qattV-FS1y-c`imDMq5F?He$|4o-^<W}0abV`Dx8f7OQ2U_d6DOwLKWT8m&(
zF&N2x9=>0$p=Hcd>vagUvje)lXF!Lj3@AZ2M`KxpAAgyCC9*rHE4jxZ1ZHcBycK*J
zYkdk)Pq?@;l~gOG4ox5$rwl4J;xR{{H)D_sD>OsKON)dnUVTY{iKrpir*`oBFET|x
z-WKInkei)i1m61X%^)&ZyquE&e6jL|QxcsX&Bt2o8i7}oNStbu#cZ78X2o87zSiyb
zxnskW(en#XmI#<l^W)q%3qVLuN=r&>^m|s!-^wGn5Kc0g8CgC#D2dWQBYY6VJR6&o
z0AiIxvbKQ76ZwmWxpBA3(DDS+(jwF~43<}>8N|fs`j8xnP|*x$1FxN=D7BE<$7&zG
zbeHmMfd&b4;8T5CKm6JyX5e9;@}w4Ao*BW^_4eG2J;lNfC)fNZ$d`npMAJ0-zO68+
zC2mZ-*Gw0NpgD6@LnDxJ2B#^al$@476<%=|nouxq0tn4a!`cFcN95I)kmCNwpVgNx
zNvMPNKb?f?<lckVvH7Fu!OFnbXCF^?SKqaCFqh{2S1;Kmu1Sz^-?%l<r!77yUe&F>
zAdx5Q_<ocraMK4d4Ei&+4<{T<;rRLT*ZuO8I5nw?pj;B*zajWP`(2sxRON%WP+y7B
zE;SOI7^a;`5N-mIf*RO@R(kt8O%{D^5V4X%PtpFm*Y#wC^W8T9q*{IpmVU9wMgH_Z
ztd}I^+`TiGT%up$3^?UeT0ew>`iv$>Ms4v-uh28lWj%_|wcLDVfAX-Ox%$e&)O2=m
z4`Q(KbRR8Y_zM*Sz|{2L|J1~J&_*F3a&hr#;m3F(p1Gvifkb}pOTgrNF}{x_6IVD?
zHb{JiJ@!Ct2}eH=tu-)sg=IK)KrUq9y(|Ew7->CNKFaO>xI^{z9<k*jEeyO^`p<$N
z4JoetyPnu5**S6O*(sknOn-_;`C7+%jfe$3dQvi(ssD0kE0BF&56qj#vDW<LFVj|a
ze#r!LsfSn<Z%=<P1H<2I+U(~G#Fo2F*rECVJ5)pUg)`t#)AcX5YI`Q$Dkv}P-Ih&&
zpafR|lGw-}HRwTo&@xR14XsC*0&sVRhP!u)ygxQ6n#oe;`-ibu6}+@$i{kX@k5d2i
z_%ki%mNeip(e<KMuSa=X%B(N^T(f3B1wqOqz_RM1iQRgT#{Q?GN0`AC#CQMh^~=On
z{3$><Uvu!nP9Bducl$D)J$Gv-HeU69=aYxGuaMv3lk)}?`2U&dXKc<x-E$$sMTAHU
zUa%HMm|R%yvpNc874{HHvpi*J*7xOsBH8ODO%yaM4geGXOgb1LVI1TRv;TtDLV=nE
zRrJO(^k>jN5BduKWdObSr$`RFqvA1_tVAM2a^o_5&QKg#hV(Oyp2#-0t3fGKHV3Ij
z_{LL1J>sM|ohGB8X#WMV@%q*!K56dEu4cPGB%Y&$Mb@ybb9wD8XVqs142{tJ=i!s{
zA{2v!95abI0~GF9TnUnS$$?Sl#T1Hgdou{QwY-o)zyda-{=9A52t+1X!lF&`5(TGx
zb5^qyX_V(1eJ^cBm_{Ej%{TfX-oH%y1aWEy@jCy`Rhj!SrAWxWji%a@R4YGT3Yf#_
z6L|gffN%Ic@ZeW~YZ0_`W=4lZh)BZ6O)cpM%7tH`jCUB%G^XHH@j2+H?!i5f-4r^e
zdw<Y7v3%hjaF)9fPD2DVZuqAXpOl=3XU_{<u@}j24ibuN7(IIkfji20LB!!gYE-7Z
zIo=>o!AcoyqPoT9fzOG)67DEC7|Gw6Xi1c)G{6c%bP8xvLQbBt>cS-LzwqNZLG3ix
zh5Lmaxx=W0=l4JNrOeQR_hfE9yb8PIz<JgUDRe0a3mmxF>R>4n+CKChg9c9s_i@$&
z047(OFoj2Y_Yk{U4P6kE<!;}DQfsDX(8zM9cmH@k_dv;=_EFzn3VawPp+{Q(6vKbC
zt|~{!aq(knThT|o3Q~4HCiUFgq6D{x6Re+2LrcknH3aU6GO~-EB?8ekgiivPBgGYr
zh7RutHT6v3HNY8sTt#66Y2WEl7^raLR%WKNtNw+@$qb&Td;9e#QllP7Osl14zpKgA
z@Ua<n=WW%0dFEehw*gl{GMC9uc#X;9W?ylx36J?g_!mCBcD)%*ira|uLl`=~(|-_x
zsod2QEGz5(ym@;aEcwvWK~dCC0yOT1>788rqIay<(eNaeJ@u_)_42cGjOfmvX2R1x
z&759B4s$=s#4!YJuOjHiRm#LMMcG=9z2#_ke8>dOcZ9s0kVDsl*gPAm(1Gue$~ed%
zD=vEExbR9J=$F*5SR;-M?<68S4VBpfVNm-YP(0^#X*5S?R@z#s^ZjGh(CcIHX<Ozh
z2g6(c#HTs|ebv{c&=V?54l|F^2twB_u>MIi_4FbnVBfIW^{fFut8%$F1ygDt;FL!O
zcxtl_ABtLV?zTrlKEAEpZgNT1^a!)bOXMLn?Y$t5=lFGjMlMtwL7o+V*3B4rv2N(+
zDhZX%gK1S(^=~yteiED)By28s#ZIcg;34n_efP$iC9fK?>HYY{!u-*0V$Des%iFQg
z`VN>dx9!KL7L(SPvjFC1R6)UkEo2J>2|O=$POPp!6NW+FFaPDW&rjW^Bj#Go)v3+Y
z$~t4{@_if;EB&~Yfn%8vlpL8??zo_aFE#q`@J*R&7V}puFBP2<+ArFqBmvdb1|N~{
z{Y1buAy|7LqOjf3MTr&Z+l|vHRAldQ>%OlYjA~qzjVb(-;rAVa&Rq@X&FR-qKdoa<
zkk`mJ&#7&I?hQdgl;_$m>(#pbf-|G7H<beW5eveR(e0ldCXjDMAP>%t*^$;yBsgvP
z>PZuX0dJW*7=oHYW9fZ7q`8~-vGMV)p0N?}4~S<X33sMR4UDAk)}XLT@|kzQCy+{G
z?Y!mq#(c4d{CH6NE=<z0sR@LAE7pJS$`<(TQN(F_=&Rozg%i73!{BX#fT1JD<|bSw
zB4=Z`I4aG(lZ%j=nQQPE7bzeU59vYY$K-7jCiqZ7FEoFS0W%7u(JQ~%=|~lP^%)e_
zCq}K!nY=7Z{6M9pv=zpC#5>bi<e8skEy3uy&rE85kP?%756O|yindxX+H7xfPt)&n
zf#|*F=wUld<@x29cLJr63uEQs+V1Ck$czf@V*bKqvK6yoV%CWac%!=$)T(2ThP@q6
zpgz^wycd=I&?3DyDa5~z8cTrvGM+!YEPC>8J56x>`HwZK;t$&iP<@D0;AWgVN)~fA
z(<FeQ#M3|I56h<mfUN8_;aSPp+2?#CG+Cl{Nm#P+bQo0ieUB@2?AE<(d}h8X_tRUz
z;8?3gUgU@8r<HKtmiMAMCw1xm2mlFjgmKFE{@YJ25g(j9S1ubT0CN-YFd3JF${K$+
z#VDuTjtY=@wuz(i8e?3h1^G7t5)49-N^5o;&k;-SBAE?R3eU|oZpqc5l=WT=jkloh
z_Qf>2yyhytA>XQ?Fq<mj6~AjnZSA~6#|5qhz?^CgT;wM@wUk&S_1ndQ)Blj)ZUUiP
zGBw6YhnIhajXL*KXFey7{L?lz<8B7?oAqGwM6a_@f?bSVg&mmrSrTQdnX>j?%>LOy
zzPIMB4pEqW!Rgc@`!(U+$Br5@@ow3%JcAygaGn^Hz8hYuf};YnF_Q1sr?tgsY?}9>
zV%)h*+06BPAKnknpv80iIiUJ{K-GD7m&>U8ddzH^3`?H>Y^%d0^2ft>EJ$GlTU#pG
zVY@dSe!9KTq)l74u*{ZEaP4({y~+&}Nt<yofgV&IzW$uh8J2T_1*Xj-rd1No*=w9{
zoJrzzN-9AR;|W<JH(T-C`$_<l*Y8g-f=8-jrOFgn%`=dwpx`y$^1L!Gtm;ecV;{E;
z_;u>SC7phpK<%fpx>X3E4h*Wyh|2@YC8KFAFlnLex@EYJFc!zD;LYrP^G^mt4J%+7
z#4!K5atdWyR`iNe7`)qyPJ%8CQrmmg*@t}tt&M#@wOzTtX|p3R@?GM;$!ammv5xm8
z7RD8$*&(QA;1;vZqWntXPr>=^m}DTE#~zw*`V@}nSrhwAU;7>L+Nd(qc+t!wDU@k$
zsFTV^kEwMJL0C3&8({)auHP^Eh0#n~=Xn}yq9l)pZKQ9EK~Si7hATe);7edN*6Y^a
zo4~JNsH`NcA8L`YV+_^`BoT-;$H_;E;yz=ER)=G%qEcIH)$fmxp!7P|EMH_D=qnr_
z{m*KlQ6i%UEz5IdwozgQ7Rr0D7%mKB2MQrcqt)Ec93%Yq+)3z3-X?5$)Wp@i+>TO~
zG1}RkCM`*M*ca@DC#98wf6cBYPu0|>mJG+{1Yrj1%w`dS=-33xm~pg5m9s9;tfqO*
z6_y-1m0MliJ|RM<$qHer%&htQp2OVw+XrF2DIRPe9Q8)dy@Q<~jmLZ<$?OBcmcq>d
zYK@qfy>Zi=7z4ELXg#z8qZm0!iPo>lNAHT+ir>LL<iScpI|x^Mx^Kh5`Gc<TdJ}uY
zU@Y+QpL~HpNtVGrnreD<LThz&9PQ=P@kty4!q!U4CQ>Th21c_%thb(1rA(#|U9kmt
zq#|Lc6oo!7L&--k)DZC3cm$Yyl@mWZ0X?{O4;hLAKRUd410DP>^S;k6@zW#d8s{ze
z5$vN*MD-{!(ltA1SWGm3#naGG*+gTaaScskY8|wW;Z5Ep6aos#-Y3_HRj%Q$Usavg
zbW0|m@~9sk${K&0z@{M!$sYof!HwX5s-3po&{zM->Xi7D$7r}A!eVmwa+OX=IBB%J
zbwKnp^<p#h`t9Wk&invVJ4{AWKy&r$n`cJtj%inN`ejIc#h%M?#`IRP^M`BcN-FFi
zy@UB4`8BVOTHMe!O3nsOE1=3CvNh1TIjJ}Wz4G~r^7)cNRLjg}mvhDEtRS{y(qD`B
z_M9cN|EspF#Ljo(C03gs`ksT_V?<@#k#Hj)snt2l7<ZTG)sK>fk@>)*AtW@~+UyeQ
z+7M<gcnfp$Aaw<6Sl{?J!vDF~FMvUhs2%TLYW(GS9-@l8DTowUZc{vSSe1YkXL&Pe
zOmz@6)GHxWa$x-Nr&xkIHqs<u99B{VJH(YU9g*x-sGVRbF%jJlL5UJ2vF2N^=^IpX
zUxW-Wc2u356DmRKLRQq@E$OMXYCUMq7bq%j|Gv{2uVJ;q+m%lvqrw_ar`Ai^l5n`%
zI~?El3e~hhI1!iZhr0}xNLT^hhkN+vzcr`;NuPXJ3*;Qn9&pI;ixyLh5iw6jD)me7
zp}>Eu)A%#7L8P&i;gfgP#B2hxO>2Fhkt36cr8Wzbwo-dyw-E%==$VOo*=7l%8cu%o
zb?+e<3Z2K8`Y<ZeM6SfmU~EM8I6Ln0IIz1ez0Uw2-X`MAn7a3OuzE*dMPkrluad(P
zF-v6`3Z~BqF>1-9F^>W*Gv&%HP-P{SLC&1n=Fy4D2P&|Mby|5EqU!g`O<*wjkU^85
zW8y7fd}@Rwjk@A{wLf&*QusTu5fiZBHmpEwjUVg?P%5IPR~|;rFOqOYRGEKkawjS`
zqQ%~d3D{I4d{rd{9OaQ`B)duHrB*vFPeRZuBYqs$__bDitJ^U(73}9@()$8!2>o6C
z)S1Vhxl{?=j4=Hnj4y<j1+31Rk;K|QAUgB=y8ae#n-5rXi>9!H%9bkzKKyCjL9U}D
zO<*9LZ!$DI$BU`85evGCxn*=ACQ~Lcaz9VZ8)%MpjJLE#AI=*WLs3oRm+4h5i)8Ao
ze03Q|XU6F|f5JlMy_<9y>29Z32j$bDo16c^348JgvtoEpx?l;_7YX7%%s_5DCc}|>
zN-{q!qr|79kK`9FZ5sd#ERbxW0_UZetswM_Wy`xCo>m%rtz-UzB2sVX-@?Exny`HM
zRm<ncLBW>>DZUWjhNP%wv)p#gS6g^Hh`$4(9&PobiiXC|r0)PE^<v7%WHjR7b$||`
zo`fJZ_D$BQM5*cd7s3HY(?1k^uMgj60^nlb;h(H5q@W)Em^Uo1x)n(5Xd-{-p6R7}
z71)&7hjOeSUqRMbXyz8YOy=Hps<hSBixs%Ptj`7UbdQc8AAl+HRqPk)>jozTDy;ZV
zI=QcbBOaeL7+WVRt0*&-<I<hnphIGde64$!gu){clEFrZ+kMgDk^*N25|sEz)|dFN
zY}jf1N&IQ_g(2d*ml!O*67>GB4hHI_o{JSrhHlYa)I;m`PRO3!#L+;kvi<zfwP<wD
z%)H-7E}{MtPIzEG(<P;xpmB6?9>ys81+#>frmt{$1tK$F(M_wBX6y3yxyJJ)=9(L<
z6>N7~d#T4NIc;2fPkM_pvmL5~7luxHoAT{9*-&kM!Ddgl4$fhmS-pGOEQuT+fkKua
z3Ms;ja-vMwRNxIXBA0hxx4Np<YXURH&e4Fn)~G`9-3kdV%bTjkhMq)#pjk~@PjeZ{
z{S0OXQ{#jIx54v9t$r1>C1^~fT)wxw<}H3LebaL&eR`Kg@G~}+KV0A?N4__&rwtRV
zbwIfpnEFg`mC*vPmO;1I*YE*Cn6<ntE9#!PE~>Mst+`~+N%ofD6tD9p%SSjoiLA1R
zARw2y_iRtuI0#lW0_EO`L}ch18}z7tHf?oAwd*Y7#(J?927hFnW9w49fy+QH#3$|3
z#HN(yf@p2+D?v|if~q*>CH9aBGYjq4!paMn8dK$p;F86|CYo7CuJ5rnM9*b$$lk3<
z0I|cJ)y5kX-w9Ed`%0v?Tru3|_{U`T)K2HoO^~>u#rZA+`h0uiLz*}^O>t+njLcSo
zh>@@bu5_`N?&SO@eN58WI@^HV{OW%dSQ{x0ditJ++B?h96G@(i*UC=Zk@L%?q}arw
zXVuK7G$e}`$N&iPvI7Vv%pCaO<&*j9aU;P$#8JHAG9LRts$c3i+AhCehbtxzbBD+9
zOg@8?#=}loVfem4e#xusox6sa3e%ZuTqw|5mLvDxe&^^x_gQk8*6-X*VC00AYy7vT
zntQO$js<|$nIM6oFv{Lo31Xy3mwyyFY?YsT)q*uft>hq6izH{)X}4(#Z`rJD;A)F%
zL8o+xskE0`Lakk}#0ZeCPMDa_un)FKWktdWNTDg5Rmqnsyj`UZ1X(B^ul&cv@1`$W
zPFYNfS){d@DrQuk>!8?#>jWDLLneA@9u6U30n=|Z7{)C*x0il!p68NHZUb|-UPCtL
z{;!z3TXBd#p4{BJNpbk@!tMVoeSXq=uP$K*UhxDdWrABto{u@I*!MhM7ocfZiQ4E(
zDeTuw{XYbGv73(`Wn`%zOUt~QrzzqBRAnrquv*&ndt{Z>8-h~EEHmvRUdT(mWc5N^
zH^>!%#oWVXz4hJ4NbBcSCGV9#F$;?JNn&k&Is10^<InNuE>Gw*8w?qkzWMvt^j^!5
z6&v4O>)EI%k3VqcqK2-e6Wuc#YghjVa^=1!QNIu{g|T#Dp(hE5+~z5Tt(sPx%$%m9
zquE~`HWi?qPB|2+rd#pRa}cvSY2+a1$ou&gd#10DXlwDOw7M7q^ULLqKU7+|LOE%u
z&tj&*!?T!kwTsU*jVIDxc$F8ms2HSGAI|t|+%jgvnqrN7){}VkU(%6>hlyvmQX1LF
ztE=;#hvn;gF;r>c0?nAL<?N^La`m!J21Gr@@*afjgr+zK*tU2B=i#$E!rK!(^ER$l
z+_^6TSoV}!pRucj`zlQQ_MrP4eT0uk_|&JNx$mM08JZ~Gy;m|IC|V2=ni(j4!9BKs
zjs?RNnTF)G15$90-|cy;fU8Y4_=Jz90sgC*EiU&dzqrpZj`o7se<zb~-NEpiC|LMZ
zOH$k}=E{kONa_|5Y@V2H=*-|6*Iv<TH`v;|&TQ|@={iLa9eCj*?G<jK*imm_>M5G}
zv+`nz9vSi=EI#a`pud%<8MsAP)J?|+9<Bg&JI#ax4&&ut+@|}6ohh_U^<pVeOiRD7
zLEW9-6<R#WEzYDta|-g>JJqU^m?(sGFf4L%lk77Rf=;N4X+G@wW{SQ2h>Q<E1xUkM
zo2tiijxPvh!U8QgyLNN-Xi7ga-%5lE9`)Q+`6d&#M^b-KYC2qgRI7%#Rb3!Q{5J}!
zT#~Gc`73S<cqaJT)B9ExbZ*WKQOMw6WBeR9Ged{tv>ohU`e;gCv7iQuI{NTuP$t!r
zGH#K8dLiJ$9=f8Cn#A-RH{?Z}uNOD$9EOK*D@6+g{7P;}SFy<gl8HoO{pJXK43x%`
zK8RO?`Ck+Bx1?{{Uinfi@N%hSl|Dy-Rye<_R#K)b-WH@N{YCZ-1bK@H5O%c`KSp{`
zf?`nH+owZ%T-GNE0NE5n0B>Ww0P^${CM^v*t|<n{rE&LwiI3p<RDe1!!Jee_A?AYX
zH7JNttFlB*!m_LOc5=V@GxE3SJw8D46PMMocQLk7#&}x`5;P_Wtk}tGm-)BngGE&K
z<1$)v#FAsp)e|9bjT<(h8YhZAj#2znqMnt$;BEj}E&JNM9<R`NxQ4NHC;yak=9H2^
zlaj))R*qWIto1|<VJL6w*^c-G2dx*m8Z+@#yO&)A_VqHw*QpiZGEGPwbBFL<wVdLZ
zOWEOAIH6*ofQ{lH3P|d3as;R*d?EAn?46q?Ux#%sLii8Z%v|2h&}TecxOBP;{aTLw
zl^##t^Rz*8_BsKJlGPg6j1sYU)wQibE$-o6JMUsyq$36FSzB2g78J03=k8ro&0c&L
z$VtHM;2lgy+76$3Dt>MW;e^A1;S(s}DnFB3feakbbR}(A#o{mq<uQvzJvyy+OpFle
z0&8B}QQlIQf`SdwqWBW^Pu-7D1f?`+p`{3<Eo9DkwF;IPD}Cuc8^@=+f3eG6X|h5}
zCDeO}EkeuYo6A5cZujTH<3|<j9QeB9Knz@C{f8fQzRv2JI2N)v7JMF6S;u7WR`$lb
z=|GFtSlsvtX6a9}m&W)HK@)-D5>yyH<!q+SKMCqO7F%0zPfN!LYsJBawLBl8dkArn
z{N#V~*FhQcM^6WLA!?w(nPwt;LZ@m)wO#vki`Uy$Nq(PUuZH+B@v9(3KdW1apAwXM
zhFf^aJpwHQRqRzj#l864u^4sZ>)lKG`kNoujqL$H3#?k3Uq9Eh_qgtx_NYt)De3wx
zf<LmIA4s!duK+2ld|cUZ<jgobnA0GH$K<vj$1uyWs=KbmmM!P_u$v|NS1|zJf~0DI
zedFEpdbZ2@L!#o*_P{4mpe-`hL;qe$dIe=Ao*jq2o`a=YNUlME;oNR%V@C=p0&F6+
zs*19JUzN>>5z}^JK#UqL*6`?#zdSmw5A90V8tVw!OOEq^9PVKgk_$YG10l|#u<0*C
zJ;a?F$892@?Fq_D8+(XYLiTL*p3y9-XJrenrwL`jBoZ^sYUF;8tf2~a(COuD&Fc8_
zx%yABR6--@$J<C2sX1@Et?Bu|<Qy1D;Q!?Uv@$ZYE^g<0<@5P{G6frA){%8?gQU3@
z5l{8>_OmL!%>u==fS*It5KHL94;8I1Jy#3M!Re9Z3$nSSAWb?UEjE_2JS6S>xi0vO
zBV+U#dHBb@+z<Z07ER6J6P>Xbg^nbBLSVvI{MGDwq=d&-HolS+?XW|O_U?W{1(IBC
zs{BrJpj>1Dqa!31N1<R}&e1)`78oelJ?{H2FRBm+r2Dcl2@(uf2D?(`e=o^vhBpxO
zBuxOVJiwJ5)#!%kXf92NX3S?EjvMqC5ei+-YYPfdTOSh>#zm6H#Y5T-8#1~LxHJ4N
zlC`w)j#Vh>mF>IKqO|amhaR74<oUXj`ub8BPkA7#=&k#ZRiC#b#&op*@ep)1-CaGr
zh=bTZudBOmVXm^KP6BZ4Mz$WxRp?dZ0!Dhuw8Hj|?CCl@%_908-`&)7S@38=4KO1J
zgj<J^y*+;~%0gKHmBnhY9`kSdEKr*KG2|4Yvj5VA3$3WVHZ4%LDhG_d+M|M{Tg2`_
zxJ;$RD2uLg1`Jwb=ZW>SF6(C<f0=X>+U1ybl`jLkYO((a^b<WOi+P==)O7SAggbMn
zjrWqZpTMfp?IB0t4S#ZCT}EAj&Wyx?{i`k4brG~^6cGs<5!THSgd2zY--HYzV*-#i
zf#zl&KZ9I1bX`8ITiZLkGzReo)zWMe0Zx>m`xf3_{dwLCi}fUeSE&q0^WVuFxn`}~
zf{P?Tt2$MCH8i=Uy8!i)Gp16>X6yLKC^CTja%Y8p|Mx>0_w+t)FUGWlq{AG`+6tt(
zQ{{vet;SNESs|8$%}r|ZyW@$_K+=ZsFy~B|H~df#H*uSm7Qm-#M4Ke?lu0<WHl5b{
zlOn!IvV`5bhy1>3u1{~4Wf9`7KlIdP|0gs{(x{PWKtw_v+T}lF?&2DZ&dV;u*q%hC
zC0|sCrTF{{XlWnYxUCjuPfHw=WL|YfkjabR#7N)Jq&!_Nm0$skdBBTFrPmR+k*G$e
z%fu-8k5^dlc|(PZ>w86>Jl{)2o<C}ziV<lKWELHs&FX$MSJeM#F=yxCpjZ0$P165y
zilg>3d{i`G`k3y(WM8_>1m+%(%Y;##?@y8uPh@Tygc9=LGKgf=HrMLUN!XTj?ze?%
z*i)Cqp#@aZXs-Ut$6{<w&7~Rjq&<;3wcb$`Q|=Wkj9>+3WG~&QZ+nf@P%87%ANUmS
zn=)2OZ;_JZkU7tsUmz<MP#`CZg!Eje*(Ba=aqYXXN+wP`k^jK-$^^)KCHh3D6A&IR
zYf@dEL!*zk?Y>Re)>eI6MgKj<hl2(FHCFAmDPeWu;fH5|l=HmU_VuF>N#9`c`eJbk
zgem|pM<o0wzOOJ0yjuCS$TS6KsgxgYsFe|)w0U`MD6iC^T3~ZRp}dm>oorg~(Bg3@
z${Xi0lZ{3XT<jWDs4v$<usxgLh0h`=;Q};|3x#mKi^I0HZxfHSr8DhvwQDuvfgs)1
zkd=pw7|{DS_@5*)nxfX7p%5%!pR8WTiFw>F=w|J>Z-gq|ClESr;QjNEM3{%bc0BpH
z?TPMo6ufi0!aa#!*_do0*@MX3xS>zc(-?!_AC4SN-4agAM)$_LEHfr{CXk>;Tl(9%
zJZh^u`|M0h5T!8{NFJw)Nq#k=N!K|-9I}f>eUQl8K!4#L!qY8U0<$%githl^X$&X7
zLQF%?t~8B|HGu0)$Xr!)n>@?_Jyl1Eib;N*r~fny#JrA9AghNPT<-Krd=&_nvVcw3
zFc!vC$H*>vD$`X2omR#f9Os4>iSAd>y92IuiM^Oqn{_@YR?Q647U+y11icGz#OK2M
zl<x@tGg^&8nGHbe$2>9hT+gAxlZb7dpKi+@TF)eY8_6cK!Y@KUfzJN0Uj^lI`HMWi
zW~!6cBI?YBrz52aE@+#U8QrTFPW+6$Ct?I1C~}oC!{@aIrnB*mYJ4$21B{VtD_1H#
zP|^7e(;DT7ZO|$S)p6TVvw2J;&})>^Yshru$l>u$@ntlQD<o>+C5(#WU00cUJvc`E
zBFoO%dKDY=3w+wy3rK|V6VzcXTQt44HG!Lc$@;llS8(uTb}T=;_PrO#(J4fcP>*qG
zJKx|}Sl~^J21-tHPfume`@UnGv1_|Ykhk>=xHviRU4${K=ej93kCgJ=`PYb-2DK>G
zmKF7T>I{82H8f!Y0{+Lc>Ma~(zYq<<L>AjL^mPSRt;lk|onD+2Qi@8`1i9n}CMoX-
zD{pOcEA`%?Wb}^3MGOnShcCs6r2~*L)GE2y^q#OJ*H0JWU6nAZ4U90>n2#h*%Rz1O
z#gr*zL<B1*rn%edtn*EA64SucES>V5jB+gCIB1lzPqEAFQ0E=%ISqQkBf+O}<F48a
zaN~IykN-O6<d?4lo#8)LBp4N#S!cOiMh11zdGLab)EX<ukP|2X38k6!KdI-8>oDNN
z-HTJ~M{F@ASn@2axJzGEF@m?>Svb)ZIsz4qw6yiphziZrA>1rskY1tGcGAVQuebJ!
zb91*T_|R$Ue9`sScVd293|*Jp4d17?jK5y{{Rdo2g9QLS-G6#(;RRY<h+YEF8bH+z
zM>biO0z0ReQzquzf4w?1l6*6tHpUuo!tTWnIFW7J%I*ibOb^ze3$tqELAw3WP|e?X
zAS-;0tyoEXLQ3Pi$PehdHwYb{)f*>2*PWM<`RS4)${oeKmjA#b)-L?sVvh>_X|D48
zjrE<yDYql*&heWT6*GoLWDqenV6tbko!uN&`s{7;Sb6DEl`d2N#B6=Uaiov!)VG(P
zz#1s>2&+UgUq*CkuR`Mdb&@uekI~MySaI|g6w5UWl20S+E!piaN^0nfobiw>==u~z
zIiiZL-FJSWyqDF>W7LYWecwm-<}Wji<7{&2k{zFfZm&SEsvoAMmn>CJHooBcLyy-b
zMOe-R56!kAHpQ$=FBLfnNsIoJt5xnn%^qe$hB5xlsPg&YrP$T*o_Z#*<2)B^B&5TI
z;2Qp5l!7EfkdXs`oRU)M_@mT3%uwP|%?Ux?y+xzIU8393#~wBzg^l|w!i~q>pGu=r
z5$fD{?PUL6sfgqv|1p>3(i4daPxAzA3?FJ$^m~EuTggbXLFOLih+AXLx3)7eC7yx`
zfbmDD+oVQlmw#ipq*F%PkQhi<um*q32ssYf?~9b@?}k*!FeQji#v_2A6Z<iH{pH)^
zZB%vh94lEn`;!I<VuWPova=ik&`r7^t4w7iCpQL1D-!6wPJ|KUL%rFzqi+bH>ZVki
z^xk%~g|9nHj)`Y(OwybPJ3;>N;G6jr$YGt1CQ|-SYGt4bEA<d7+(#}&c9N5Oo2Z^0
zdH`G1#h?+hcC$CgF>x^He0FLtUHEl^{nd_jAX27BdzuIojEf+>YkKAVUdEnkLAt&c
zD{BF}6g`Yxvf!gvEGksa8IP5B0$!uF%^HrGvN4-YQ%<~$<V0tCLf~)Z_<MYY0jCtF
z8<X0F!A~5vC|nZA;PL^=QaCf@yz<fM4-bs2Ld@l~qe_Fwqf6%iy{!MlP0rA6?N*Cg
zqBhP=jh~}9L{O~h+t2Um-b=!ETX5#KS_pDsEC@}z02cI;;J|>B9%KXu<+wpzKN{QA
zC(%TAQ>hNUPruy5901p>*SiJn1n9_YcP+7ItH-NANXPv?H?_UrUOE~Lz~NNQ8oWH^
zIGA61IpeM=3f7VOSoc?h6;U{RH)u~tSpxvumEq=+U7KLXloO8tkjli9A}I@{n1zdw
z)F-?I-cz#=ADu)qhW27FQ>k{C=yI~MV~79fY-4faSP8Ce93nzrmEsYM{GL8t0Augj
z&LJg%#cl?e(ZKYyL)PWbn%0M%X7w9SIU!$6T=O;+O^0|s(jQ@xvY8o61z;hd5(vHN
z#*+D$AbmBuZYl_9p9$%4yaAq9lat_^Yy1?m0e<UcDjdaL*@a_L`v}b+q)FMvWlQu~
zyj0g^)nssEGw%7W&agcu<uTm2PhC!^6xGArfNi)KO8r&w9ZRAWsy14AIdD>#$xsrf
zeo>=uUAj6+p=!)}da3LAolD2HPxp>(4jtFplYD02TMe}k$>(bjB}SZrDCuEnK9UR*
zd^SMS;3A~a|5yzZHf(lY)3Ks?=u-m}s*oBlr|uNT!_sB1_OBrGOHC{3lW$dSZc5no
z1!jM8TNw{>h?vHdm}A#LuxXAIDy=5GT9QBjV)Lu4EM!!*adJXa@Ol(pMRKE|U@5#*
z{XmGvl4j{#r>4P}EJeo>rX4KrWIto{tnnM#=WT88^4;?5p;6v$C_0W6YSa7Kr<i6g
z$#gDdR)y3Y&x-CpP_>eOZu6>w@%#}%KlC{%;X4mR9v#5}yQv$F(om;Y^L#K@f(=Ol
zI~+R+icw`&FhdCB^vGeY;z*wnf@T;unx^U6>D(iv-(0Fw%~+gCwHo{Y4vMlHFsAv8
zDwP}khpOGGfeqWq+dy5pAbjHGF=kAFXk&gzVR_Li!aTY`TB8n>;IeLkh)FK0)%}|s
zFO${)cA8tM7AX~Qh)a?f;!inR@qtOPIZ`bMzP!xx4593aL5#?O(vuLr>!Q2s8qd@}
zX-xLax3{+=@M^T`tv&)Q4y$T&g_~043brg!cnNZv`QTp5cvpJ~t$H4hig4T1YKL<=
zj_vn+v36uyNPCu4SPy+UF}0Y$Zf}ji^dls$>d^etGVf{U%W)5r>EBz<^s@wH#woE2
z5!it33Dd5tNSTpt3WcKB39>(ZiB5gGqvi@b83oOe9Lqb|UJ$U3y-BUsG>E+(_gi_f
zB{Hv(MrekEER`BH0Ycem5`c9OZ7<1u5~a9P9FI~E5f^ROk}53dIWxlko<OQc->E|2
zp$1iQkQ)XhTvs#r_+Ubu%U~5w{XhEB`l}E}r^`fRjlO}+IdiOs>qQ1YhZ)lrT_6Oa
z$lBP0^%CR}+bFJ{&im0N$l_fX`$NkT4~u==fg{h@_#r_a3`dK}D?Le%nl>_vNn(yU
z|IpD>Mhni?87h~z(Q(1%)163a{*3b{_YN{F0x=Va%2?9?N>wdON97e-Dk|y4Cdq5N
zduq`o*6skMqoUFxuL4HgW-x3l#tX|gjaU)I`8ebN5>az|s>#IEW@-WHeP&$o^O3Cz
zZ>w@fbxJoeHO~>L>z9l1m%68DQ)|zI!ZeyNs>;9M$$&9Z(-|8$J9<b6tq@q20(KYu
zr|fNcY0kS;OWwC#lYiz|LYW7UJaglqlf=b5F)l^O7_$5rLyz}UVD-#1<MQuU!J$6M
zFQ|$y4ocAePBP^&$J^2KoY2mrJ01B=c~q*v*a)OUT9B05FRi~yHAVPQvjLxa@6Xwx
zv?gw8d2~=@auPSD4VB6OtGA`RyjoVF8b1U$Ap&Wtg}`{Xx=&!=dSYu_D5)fz9MR4+
zAjr0aO>-EtFo3nE<+ZPf!tX)d;&b1xeo#0$9SoN*XeL14ZB~nK>(QE)gJY5FDZ4h|
zuz;SpZ<KsfLU|toO1puo|CFYi#SFmq?w#dEY<vKd;e{!N9_UhJB}+LhOjDL9Zq`jU
zFBf5uJ=@RQ!c$dnVuUq?fEH|BPVn&K1}XPObXWlJaO;E!lyy-;BjRbo2RsNz18Z=w
zA*nE={=OPK_FSOlDmT2uasnA-N&)^F2UA<N%A0GcUxnm7t7~_o0`T@bxTDb1fp{@Q
zfb8sXk3KJ{$|?|ax_~CyDh;go<Fz8qKq`s;D8>whhb!5xNs&qUkOkakym41Xi<Uu&
zM{91KvDQR8jv?>c@ZT|@tt!CU9x>lITO!VOQMfyM7Q=)oy)3PfKT03{*}8xA7&rK%
zk*6~#YkyW5-ieP}$cAvZ;hmPodir8;siw=61(T%YN6ZA=CGEHcJqGhA8E)BONFV`C
z)3tdzj!a~d;N6&_{`YDAD8+3~I;zPh>9X|<j#1X6uunPk@Ms=gw#0??3~n7v-;#FI
z^)&R$<#DH?Xm<_u`K8c=psfA8ZFK2}lSnUhQ({8zXRv<PoIO;*0Ac4g*d|%0kxMv@
zNE0&*p^%PrRBPygP-Jl$#w0@Ec#%rs4HsfNL7hOxMQR$)T`}Su1hpeU7u3qF&(gl+
zJSa{qzTcn!ux*Ps0pQ<!=PR+hHqN*=l^n|s$JB@H66bG322}_-aVf6FpKGMf$Pf*~
zR`(9``s*W{Ak%9=Yw%FQ^4xHo$ElZB_@1N;h|6fF0xZYH(em*<bfUM;$315MrXgO~
z-nc9)iEOz*F12Y5qLRw;N#In^iJhRwEdP~_t4@J_a*}6otey6E7Vlq0`WIAHwwZ<~
zc(|c?7~4i{ShdXiZD1`PGCT6j1F=7NZS>Eq!^^Na1gB0r8k4C%gK7MRSm8Zi>G1j3
zM_g+4(Pz#24m)e+O8sd*9FqLeB)j=%eNPaZsjVHDt!1*hBq27ilr>9#AD6I-aJ1^$
z$vWK{+v7y(p-8+CpQ+0pgb0$)#-T+tcMcscf+{FfGH3lDOVb{>PyMS`{4y!nIG2YW
zm*3R04<t80|1bGCZ%_{E>jW&;VEUNcha6S}wqa0E^03aaAdk}Hd=PlMC=&2L#o-aT
zDBwSP3x(mk|7&@qH=aE%f0_0p2N-Pr1kM`KYYP2XE`QY%M?>noN7jln8_XO-j(`4D
zC(|gxnY(vXj|(((7RVIS`l?52PM<IIm9cih`9VAtbI#o8cTTq|3+X)fpi;a)SV*|k
z!y}A5;X8vdUcIe-rWJ|~N20pc4>Qzk?a+e<8~NU3boB3xG1^{xXkbWKkG)`$(3L?o
z$;9{HQU^ort-Ks^I<liuaA-K8m%Q8W!uZDwt#g_cW@393q!eW}oQqnYa{j%<zxKyC
z5i1OVI64^u3G|YGKNus{r8OYO^y%;6hyT{oIO|>Q@K%Ai_QBJ$rsh|JwuU}Y3LB6?
z>3Lr%x5Q4*BRM^MCAN3kgb0vXg@=Q2A%<)ZGUdzS>1Bz1fQ=3CiXtN}#2U$AZVuu5
z3-@&sS6>`-PFiYpXXTGLU226T=}MZuJ}KtN2ijf(5+ZS@<Aw{qXu&J|8-r0nS)53K
zFb=hWlx)+g<nu}QeJjic-vDbj&|i{)^?m~z2Wqx8|KNw01CBrQxx1UG%I2wLtf7Q~
zq;@9lBM|W_vM%NPwdW0L_VQzm@F2YhStdH^qg1sMVL;hB1p!SF0Sz)f1B25xub1HQ
zsMK1Py{M3V70!rb?z=EAl|n^XJ*Kp28=#lX4iAl>I}YY2*u=&jJ0nVSKnCU1Yux1I
zU}PM?Ah4psvDmZIf#g+}TmCUZQm}gKuTM~`PgsAp61H8y=99?~Yo%gbssFxfke;BI
z`*<v<3~{d7{*S<5QFxt>!=E7VZmd#+ehNiDV3APsetZ9$N)vw7Q94m)-ol8*Zw&6Z
zkSbwpHY9@%R^YzO*U|uYb-jpuWbo=ER!TlgGRHg!Gc<s|X|&Jccuxntd<dLPoIwy@
z+YtH?j1-d8CZkIV-Ooo{7xj^21pVGe9uwDVyJjQ8baF&A%kde;^NXp7(hrwW#Bo4b
zzXUVG3XP^ZeJ09p-BCG3VvAJ7hA(PbSsb7siJHejMX|^CvNN(c?enm~<@QkP;!k(T
znZG<AWb?NhO6Pq6wCqpTf(0hGJHgkbeS{Hvn{b76k`qTNwZ>YTYX9K<d}Qf)+=Rod
z{9JCWRWkw2$*PfcMW(pmf=yB3G(&nhbQ)s{=uaD86#7|XwBTwKxmCCxY|NWK3x>A2
z3h!|pQjJ72qK18$=+tpD21Gf<<(pvir1Drp+r~IAyLXCkNli*-{gi(bLnhGordZBW
z3CK=1ZM<vY1i5gJ8eT(By1zXAt-Ajn0fyaqsLtPb!Fwpg+820Z?)t-H@HAlK4|1o}
z8bhct{)TSvRd!ZtCOaTaAzc@=!xOk{bMO81K{^dKHP&Heu^Z)S+by(BfS#1iJt8c3
zIpr$}w8k-4g6MQ74h%*PCKr?Fv-M#hLcljFK0#L;FXmJ$LEeg_Ny|C3%Mcasvf^6D
zy)N-OS4KR#zIaD<UyaP2*b|OuHojnMJi?h7jb;Vr%0e)bdH#p5@0b#=AW9iC!~8W&
zQg$VMQjI8LtF-W4FS$maUu?*^SYX`3Vi>c_UPv<wxc=yHe@hq);P`wh^k(1*G7g$^
zn^6Xj-eM3SH^t_8$*QfIqOh~C6hqzQrRMjL|3esrs-u(Gm=6LGtfVL<jb383N3Xdw
zDl%q7d4&w`8$ZZvY`u43M})?FCl*`tPUMO9N@VPI@j9&~9)M-xqA!kZk8>&h<yDyR
zfwXN_6#T!+egI?Q?d@i!k~v42*@U9&`MJj5;;O=Y^QuZ*!*ZSMU$1|Kc}8QsG*09`
z#~c&@)^K4Ri|#L%w>tk(*~_wRhF8_+K9<@|Qy*_>kqI5(ED7P&4kKNL0<wF68H3bC
zS8Wj*o3{c1$%K3__r5|ANjo<&Ayam8Eg(82-NMLB(>i>o+E?IfM!FamsRDa?*&w$^
zsA*H^g2T6Rvap*uT_kU#uwd7NO%JqzdU=ayO}Wzw%aiG}iA~2`%`d!v*;jjpq=O+c
z^L<cYUQ)YjT`=>28XXm#PH^LaZTe5;(l&9(@Fx0LkTpKL{02^dBfWM|_sxdsGc;9n
z;EL^~IAXF1mX;!B(zmtTiodYM`ULY`rlVU<$C{zaHEUK&=G`S7vC@8|LLq2Bjr?s2
zzY>)^+fy#H^})iJqszOMP;==5E2b{i<LC9?{&Z>F2iJo>%mp+#2UM!YDhV$4I*xSx
zyAWSOrbsGL4#r6mW~rVJF_bs&h$z_-=#GQtUSsupwofzpq(o;OBY0G)Gz$u_HFiD|
zvsD;>B1|ihqNJW=;m~;h+BT9)c#g-|md#{m@p-Sr@pY{mLzAfeA^LOWbpL_CTbw1q
zYg4Y%h*-;Lx&4%MMFw$Po-{WbvaOFMwF{jgIZl;*@i?WX9}j`LvVgP5eSV>rPKJSO
zVukhPIQL3g%jfj{L9*NA@W~POUn`$x-~VO*%l?&NO_}9Sw(;KQ5iEHj)!|fQ@RxuN
zv2fJA>|JN0Q~er`jD`-rWDUwy8a7Z?p)mcVK#RB1)h`7v_M9%a#G@%3CPnPjF_j_|
zk0Z}RgQLRH68gZW!1koY4`>i)$iHg|CMD6DgEALZZ^*DqYj6Zys;UysGMqjJmW5@~
zn@N?_;YP8IkBUAg_U5e0rA3Uz5Xq;D$;&`=BnyTEk!|2ZZLV*J4ua4<ID)`jZy5Cb
zFmaBHHd)_#bd{#5PoE647n`Igz}w#i?~AvZpbs{#UCvx=QWBpZx88IzfoAJp%p}IC
zhwp58woDXsWdzkm4i^wUf>H4Dh1ZNaBP$TtEX$m{U*Q*4>lp@vZtxOt5jAIx^KJZR
z_f+4s(_o}M7%qB!{ut*oS`x^b3#3oIEg*T2$`Ky8!lDy5P=^tGB<hgfM>I!&QIm4R
z6+xhC9|z4IAP9feo9w<)qHRt(4S3xpwlrX!JK^BV7v2Y;V#k9j;Whr`rYtW$=9O}Y
z)EjMb28|J>9Gf*yl=~)2j5<v0?>DB`|LP2gV|O*E_&7RK&!qIyRF`ns_k&K4xh<e%
zZc^}5`Ji-%NIIke$Ws@u%~ND334y13tu_t#jkV^}xGMc%d$7kMPSj3s1#||P-v0Wu
zDxh~qBy_)PbsFSPue*<+7<WJdYKSswq<zeOAWkB|G@ntI%xk}>B+#7a7qP1-OmYv7
zSxg=<k9%U%iyRCXk4<NDPA3Iq^Et9lzcVPFo*%wG_c>L|e7M>%#B_%M_xb$g)8%R=
zK;<6`C)3O#5^E5^=4>yxh0Ip*{L=cyT&m|OtIWsxyl;_AtYLMvAMA4a!a-^ixvk8c
z6|U)jbnr89n==7l!=1aRVN5mpm&dbIrLD4*BGd|w##2C2VpH}A@^(YG2<RvW{L?C<
zcFmqa_FH?26}B-4l0h-HAGR$f>qnQID!rkQB6fR)>P@T4Z|d?7A?{o5T-5o+8#){v
zWyM(Lgn_7yV<;V2WWUV>k}m{@F`9oWd?EMFj8QVr<@5CYX?f=Ca@c4x+PUK->Xs_&
zC@=9;WbqDvQa8me$XeY2T9+XBEl9jf*`(mwxZ9J7E9Zs@wdL*&GL4!GbNFg);;_VR
z#Xww_r{ZLyviUY!JHL`T_BjbRIyb$7g59z?Jv|Ri_Tm-zS=NtZAOmbK*I<LGl_EQ;
z7MXitjLa&BK6{xDQ<Yz81t3Bt3mh|S8n*GSD%MYr1w2c={`!yIlk|J&a?<j0gKa&%
zpiwhmgag=acF|Z8|J&hjI>6XXrGX<wSdu}|T>5b*x*7y~cNdzJuulVHN?+3cU7-U|
z8Kia&Pvt$}siJ8{AJ`ty|6Au9+#H=HWD}5Tcm>lb+cLP87LXxneAvc~Km;9m^56%g
z#A+l!#)LHWgfHIpa4Hd8&3GvTQoSKMcXG_UiuAT(cya&98B5f*@eYkI&3EQ?ANvH)
z=UXXFqFv4TO8h-Gv!U>*B50h4Ozz2Ey%_T`g?BTastVEo8bUt~sww+d?<v0wRyGI+
zt<?bWwe52AmL*CT+Do1t!oBlP7~*yM_RT&azE-^L$3$Jk5)N_PPfuw1=fW<f@(dOV
zYWk0C^o!juSTkVQt>A|U<t{!l>bNbr2YZt{#&cq2NaCEFIqLUQ*$XY&SzV488y~AE
zCKqSlMR>HNgHLjLje%OE5kx=ujNHP8h#JHDW-#MTYH4xU2#n+Ml*!c`LL=d7%f%s5
zNyzEoP+2W1_hM`(wtjz=LHGZ|1<<k9;>Z{3nA`jvV4UPI5<gjPeH^k5vMw=s&Sg_o
zA1^m}3(N`URkbOnldx^us<&&I<+Y2ZIEQAI--995lHIQz^>|rm-d5FYCqXUz*s&#d
z$xLmTe8&~sG7fqyOe9wWc;5`twD22}*8P9-gv3f2@j+%em#cLZ?U>)9O_MC{J9#8;
zLOf>M3USqy%z1okt$P=w1R2KX0nYx37B?Zo!bLBGU&wLRL63UQ6K;<_?Z;4~E}t=E
zi|b!>=Z1kwt;<+4!g_a8)J+{jYNleR)-0wkV}!->xv$UnI27%6uokmg)#a^QG3Z)x
zV_U8{6_T#UZ7~&6)HbtDLQas(cUV0EzuT^6=iR`%RXCSWQRT2&uEc^<MPN;te|wc=
zA<^q5|M&&IpWQ0$hgtJi$50K;Xi<X0erSw{W`#YDPa^MYZ-V~&6%^s_bb_8$^udY-
zY`)b)OtPVA+iI2i*|e0OY`^-;-)ilhlIFFSJAslxpv*APFV_g?99V%rT1ZbB)9o&^
z0?r@4RB9AgmhI^58awnXel8wkP#C*?C+@T`-Ky8Y0VmDg;?k?sPc@<OupeoAQ<NNe
zWi%%B*M8?pYe|ek*`@E+SE764zNNyCWIXHY=zh^Vn!y&edsIv-aCskrf*?Bk;%2@O
z5)uc2M852O;u1a(9c`viXefWv%O+#ZY={mqdFnP<QEI*8C|Z5#1|Nh<;g|r7Th?C<
zFY{G*j?v-ozZ2Ux@nlPYA~g<2X${R9a`xJn7Z1hl-Ry3V6g&n?9y)>Dhn$Bw%{>qU
zGUW-e`7(P;KC-3EJ_i^TSrNt%25~H%`EYn~eRCMuXNok6t=&d!J~bU9Vg9!BeP(+q
zQhx2aP)jrHCb)l8*_X5A@~4AD1srUFK+UX$GG1;WCXp9|WFDo6m)tkgl__e2>T#>9
ztz9P>aAM#6>DZ%0N4UJlx=-Jg(=!ov-OrPzy!aen48_c9h_61I54LDE^vP=oRU}C9
zLM=lqXOk%{@+|DD3E!JO>#fYDnX?cf!^!+wnOx*2S<otkOeZl0gfI?rPoSF&(p1Yz
zd6=uPwd;Emk0QCDb!&9~L4bCY$ym&%ck_#h>)s0qN$(@KO@j0I*;I)27B@{e4(=9#
zxe&7BQ=S3olZbD5jsJz*dv&`n_J-%)y21BPEB|B2#T}fy8JPS(G<^j_lwB7s&CuQ5
zjMUJjFf_uT!+?}@cZbpg3@JS{(%miH9TL)rgp{O$fb`}4?!EtDpXcmn=UVIh9ka&u
z6F49+|J8~O)yQYd{R^#9$G2DM5G&&v^nY4;lV{6ico8y}8_8q7^gL3xh~V(I8|$e=
zKvXJq87$rZt!PQF>agxuFU}hkE_@`U$Z2NzmL*wW9to5y*6W2uICSw}sVm7<c*vBM
zPZ2x3t!b0e4r{m|Lu-t-HU9oub>%$7>vZO2b1cl5qT*D5Nvp+oig0m=yD4lu#X1SY
zp<?V^AqEKxGYR@G{9D)wXW)2*bI7&>dAr=_*MbO>i^4+^y{^36;1Z6DvP4HS>?z!N
zES$#BW|bKfold0;nc>-4eT9msfi|HAnV`!^h0?Iq!{9*8yROIS_hqy0ZL~Bk#&}{L
zskof~ZSu`ah1bGFfp7IJmW;Y*rh(tivTtQ|J4D;5?Bc#@#0e9L%^GN|dSaZYC>u*@
zPRy4txuYJl1y=^r9-Bs4`^bi>$}w}=@AJI7-+c0RQ)}I~_-~|H{vX!@>heTz!;`xW
zG0So$0E^#w<Jhcxtfrj!z#VNx!1u>W{}uME)U53*I6w0tU!ef2lcdNOd?@fXxPj-_
z3fW3l%oz=23+==4sLhwJ>p207#I9}9xeW9#S%;B7mbKEC3aL141EFFD>L#`ifE)N&
zKxA7yv=_t73hthxsr|f@411@Tp{l2^?a@&8vG0nla8fzCCR6+jCI2s;w>Rkhu)e6K
za}8L02=ba@Uw~YUtYp*lfaJeaH{ASf8?Wc;?4R-3Hf9!{;tvseLN0Hnd)^PBWm#?=
zb4@v~-?P>UFt2#P6IA{3IOt;iSFYaeFJY^CrNpVB|Mtb;oSs;?idxk%%h&WiAzr9l
z*gt!<4b_o)n^5j~ee~i}gsS6v9_mYhuQCjyml5)>3{#b>M~dcS%&YxHYN2`-Re`2F
zwoOd0s3n&I8f-V1mQ*d^n@dmQi08gB@qZ>>?h|d=y&Zg$4Gc?p)#B$>qH)MjMkhg~
zeJVTf0_#o+&vqZrMq2Xg32$3n_zyLECOn4if|H`N{@_OGSsQ;!`KIyAuZLD?`f4t7
z-RHA9sjy#&q3JLdl>;G!5rPXxuorEs6KPUT!WRL05)m{3?99`VIL<Ln5H`@r?Y`t5
zo#s!tPz$Z%Ev6P_BL3Q3UhPjl)bM4MLw9h8H!mha+$Xa0oOLQw7_n%WxB-0<0I$W$
zJXn0|_#wD)?Ba7k{~w@#`0}f40s{zLdMM~Vbd}B3WF|=nPmtMF(w3%gl~52o3k$v@
z2JB!SUA*dO!QjK7-7aWt$K#!1S^y=!R~s8G?Hv38<&2j6*s&O?=K=RPL)*9K=Br%7
zRq;bE_U9_a+D=FicGtDwx0s-R_my>EiPye1BziMOm}+T8Q<X4Hq!vtmbFqHM0Sq7w
zu<c9ic^LorQ?^S&qy6>)A5o+EjPGHa^V^93Y_4-mzVTa1Db|zVGpX2U!(yxb2Y*%w
zDs$RW8cVP}!5z@z{%@L2)GGgww&du|@cmV`4F9-O4Gq<w&;jsP?j<R;!Flla9Fe>-
zB@MiQm0<$w!0vRh7@zJM&#G6K?N~imt62Y1qTY_E+6lL62hnKHr7;n=1&@~Xgqf$I
z8M5V0_v~#*^Lrfk7vWAfNiKCR4tlf&-OVVygNO2+J{(A-Ae;^VoZ!4-eb{0eeWNMh
z?S8@gH$z_ctZoFerOn<QJgK{=9R#X_P82!7*uu+7_qN)x)L(bFe-`x7`&pc!XHV@a
zjOKX?BHF}eAb$^sux+Ty+5hUbCa8vK-v<-4f3G@`!t02OOZjeQ^*;7iY{U>NRcMlB
z+c9&65P0{|9~xS)D-AXZnxJNO>Pgs4LR|V;$i{tNDi3&_jr{TVt$;J@7@04|bCJMU
z{^OzB8rS6Jp_{#c&|WU=^W7rJ0k4J31-xh)x15grP=~eMHA7Y)%gmk2VP4CL56nR{
znh#Q>qrPvZ0oq`!<2$_~XZU>uooO5|Ir$2oX;0WXex8sdPBR9IIQstc3bKl%@cE2%
zREam5X=VAg*4MY6uUKa$D{at&QT2TcTUA=1j1Q-RlESH^Zu~K>Y<}bY+B4YVP4<+$
zc-g<hFvjx7sWYMy*E~}?{1xe@3uECVnP*<d+j<(tY)T!k-`{*W7xoUr9oBjxg4UB^
zp>Vf;y1q;<y4XCpR)-436SDl*@GH!PL#2QT)5}N%_;~pxI{<Ghe8p_|#p0H3|EfTE
zzGxlXqh*2Sh@|%)JAbSVW`U?BZoIPm6lVJd7!+ARBJy-x-vgELEZ^W^eeCG*wd?4*
z**KYz)C>lBk|Bi=H|JBe6sCE3Ew3(119Cj8b5M`;o3WG{?G$o>yzzW?B|o$l$ttC1
z)qO&|OX_3_X%vxKt~Sn=n~L?p6_zWaFCNhM00HArFSAbG<<|I+De_yjjOKmK>-|*c
zS|tsqxGY)#1EDH*owBbB_L05XG2z#S$FiU1u?Es6wzi&}GC|o_Zr4#eYA>5<{v3bv
z*<i(T>;8#Q=-y}h8AjPoGIY)9N%l9QhpSOZrPdnv?la$U`M|GuUM;<s<~A62687G)
zGDPL4A8GF`U;gxot20MoP+14A*>GU{EKBykd+EtdQK`eX<6!E*?qC%9{gpTMU%_`N
zZjE?jr*80=khB`O`|c7LyVLxz<8Cct{zg7+hR-A<(chAZBZa8Tnjq$khe8ZDg;c<+
zRA6Z1E(H%8+f5#CJ#yQRtX<OgDU?G?f~R{|bb-7bX;#b(jX_^H;oa}sBhh3qQLxT6
zZ1NM2IEelEE^2vc6h&RWNw(y)=xjux8@jxZb&O8*1*P0U6RM(Oa@fYa(VtI<DG`v~
zw5)R+k68SozwwKj!AbqhJJ;voo)&HGPkGM^{J=V?@=P|xlccI#<pA@Tu$HQP`PC6j
z7HhO?fp8Rh=Rfl{Ba(cc>(K%l2YUw$JwWLpLd=Lt%IA5uCSOQTdHXAyv-1^KXCiTP
zF(T~iP6u8^f}oZa-l_e3tG3ioZv&G*h=G?Gr;iSalWHTBE<0bDy{&k~dJgR!y{UQS
z3k^v0ei*4#eQn=WI5Ym3Mq|_%N?>tP=s5lDrHNI({=h9bO^7!)ditq(n!!mS#b25D
zVX5%3;%3Z5@)P8ldiA^@S{Gqput+6k2w14xw<^Xr%qd-Mrl7nkE*ia<6}i}RTa}i)
zBV)kqU^nghafU|cwb<6$z4ACWVEppp*7$=<9I|TZcSQ+w%&*THd!gro<)xEOz%<$7
zf$cSoNJ^E<HP4`dFgDTpKV2ftU6ZjpO)6@iT+4@qlS)>rQrMbHP?!JT7cPExeOfsb
zrOh*!z;40(tdfn#v<8oi{<Cr3<5%w`Wp9bOZ*5DZy?lbhUMa=cP&zh|6`U{?=1|u<
zgjD1pb&r`Vf($T}A_TE;b!6u+rr#CtbKN<Im&G9#`TaD^+M1Tm^je!j9kPB3*KQm>
z7|5lzOjpqx<Au=*UDwrR{u7ikkU<Tp=HCw5Zo0eNi1&|}+S}@>%umpL{w;+sXGpB&
z__9%XYcS_=kSExI-uPn4mM%uhl&Sk}U;4kMF$AtMl>v?ol|K5LxM+1D@RA8X)><*o
z^Ug}S93xKIG)}(PrWBw4Ju~qXMNGup`saL9`)5z?QZIdXWc+TR5if&Z$$@JA?F`e~
z=4q+7olZ>pRH8-=#1C8xE~~mqeAmZ2g@rd`PqVVJAI^n;PExiL4lQwb3VS`>(P7#Q
zUHiWkM6{82D^F+3iKs_B@P@5_9|x=lN@Gf4FRsfybakc(o=M2i%_J6He>@5X5;>BL
z_Nmy%7p(ez5XB%IJ&s%^^8LHYB+pmx#lS{ngDrg{ZF)J!Aadc&jR_lQToL^J2R71w
z3-pmN^!@mhRS__MlTqxfQUdZcdJg=~B|k3TeB1;y&Q%T3qM?Wgyi+A~j00md>qI}3
zKy&6kf25Ldn6@fi(kX|BgVO>%x&FWr-ET%dmm4YJcW!(?YKI=lZHh^^*09b90(+7w
z)B7QP?zX;^iweI^fOU?)ZL8t@#9bv_B{O%D4b6m_8yx|oCw8AgtBpB>^w48E6pU(`
zYpP~V{2I%8gYK@F%?_mg^J~k8Arngs*jMtvGoQ0E*)Q$Y-TfYYJy<O*5mK$K(*3XA
ziPv!5p4RMKOMk=p#Cz;wgfL-ZcC!7GHDH(1WD&)+U1yUEtOC$){N9H0(@6ep=G`py
zF8;}fH=P-w_SHnZG&QaCc%xZ*XXgia1bj&NaQ@!>UD<<2>e@3Z;w)AsdPbC|o9CH=
z9(4UQica(lM6z-Kq%(Lb7sU8x9$K<p?ksoaahWSD;4Vo?{JXo1tJ~=LU5<yA&=X2J
zP8)RjHV$=8@b~hu=A8p!J>wN#R;x$|I@$zV0C*)4)w*w{r$~l!HPm)@<xWmGkn+aM
z1yzwb?WN;i+A0<(SBt}s&ZF+7L#88fxz#%!m9AwuOhB7CWzWAWg=h7q|5g=yM{sPf
zmc3j3U(Flqlp4jiZwXTQE!=kf_st#on$q8<@1z!=xGSy7#;X_y?49FcmA3kaW0pi{
zIQ{N?9y7g?Nbb#7Ogq~cQsN;Gka9gqX*DdhVe#b_3oYXb`r?Q4n0smAkTvf__F|zU
zZMKUa93j_jFR-fF#Fviw1;Eifl1jlf1-RAy_t$3R@G{@wS@g~G;?gBZg>kY3I__nI
zZKs)HR(k!2f2<1iNq^@aUgo78KY5`%WMVM|<WEAJ?DAppunc^Kzl&Erd@91jiG%X`
zQ9=I(`O{P!@9i1dUw+myy6p1Pic|6$=`Lj?u}vP{>9q{XJ}!-WAU;UdrIlrR!Q4y~
zZ!lhums$~d9ij-?yp=9DejKYE+J^jJgVg`dC{*XWmi~jEt$NK?*<&}-hHy8+0rS0j
z`zDO9=ehT?bN`fDSGP9@+oxA2f3}R!x<51}V$9q<nu0QURGWd_rLlG2U*k`|eb|du
zc%NPyzJDv$)P>ulI9K*3KBdpzvoX%r-)!DEetp%j;C*qqF*<*MUD;Qx`n#5${iH**
zG$yql7cA3}T80N(6dOr1e6vgsd;b3TRLn#1{?|1b@<BqPuqNA#x13hkzglOkcfF<Q
zZt55(c#L=KAMIFHg^i<f_@^>un~5}scQ1eI`iazsU>^V8EQg*DHILL{sN(F3qqM2-
z)=O{hj^nSo@>Vu-4ZM>+NU;`km9+xYoiksvrp2Yq=Pc`9NQCMU#a9p;KDPGEzj~T@
zA}M(ulK&S2QrZv7QgxzVDG$6^nPQ`ufKfU$Xdu6pUJ?1cHAD|QUG(<z8L#nMwQKEe
zs?6%I98bnt&--p*ynCRAjR8~6>wv28y40=aGH%A>i~98x5sIQ?E_79#e(an&jt^Z^
z_~~>)ah1n#+Tm>^<6e<Cr>sb2u50=-cpa|>>OcN%o0rO$dPtYuv+{4Z?8xqfvRq%)
zhXJ3@%~`_p$H=3_5{G^D^Zi?MR;;r*huDyXkGyZ%?Hi5S_g$zRrrYCs_YUa&Xzh-r
zHtZ0H-%xrI)s&z)f|uB38-vT`GqktgkIJbIiFZ}ozPCL|c!na_{$^P+(X>s+O&0P8
zrb6{=k|I&CNEUY3M0<F)bDe&Ncsb9R5In=0B%XI_U)0W?e%}1E9U}K7?j^eCj75bt
zBm)g!DN8=VZ1y%oBl$@5(Vt5=GqEO{qqAdkH$O`XDZDw)Zen{EmDtllImG~yP!hw;
zepGnC+dS#a+ovzrr+*rZ-hDoEnS9rLEwjbWK#DU+gsQ>17ozw{o{SaMyZ{ZySOh$S
z$8d(3-?fS7uWpj7p&FArs$d)X#i=G=^UfPRF_K$Z^#cZgm=TqNf|OAH!%m;1&6!d2
z9{qK^<Z!k{jlo@Za+YOoz?;~OQkcHO;%al{VohWBC0)FvXoX>rT90pfvb9A~iYlUN
zH$b$uG5g&_Kkbnt0jsD=%hosf22`-%2d$gtG*@ucL#hp^%IPV5Qeq1=FyDhg_3_4a
zJ)-^MYd-M4%OoeUONMgUO_YM$kmol@MPM==ZTwe1y^7QA5<bSoJ3*?53YGGmMx5#r
zy@Bten=7iCtJJla+~y>K+9Q`~{06-WB8c7l1V+i<L5Np+A3k1wUtJp8)8&0hBzpSI
z|E+CcOsu|m<m6z1cayKQXlO8BI;`8_7v#}CvGqRqW$Ar=a)AC>Q0=v5D<L~}{*lal
zn(Su{mLbLBYU0cGCFP3>wkiuT71cfa+72rR!9knW7uX9=L?Ja4O_p;h=sU}k`h7(l
z7~$d#s@wuykB8^)Nx5;l<l!rQ{$?NF?o!~Qk#TEUnZ2mpu*8m`6ON$;=3Me%uDuUv
zF&)Sm_W5G^ekb>1XKY?7)JZgD@8jfk*xvl%evv=c3p~lb4})Mh@#7RuV6}%6@X59H
z^!>?3gcp#h7|AVElK|Q3efK+3OQe-nc^$vP;7+JPoui=w{Enbh*Dhyj7>a#0YS>3b
z@J&_BnI!P$MC<CKFIi4Ttfm%Vf>Mc@gEWtSSaZbrR?VKcp}U+!K%%ab?JeRqVkIQ#
zvRlrYC4I{`C+p3Vnp2*^Q^gI@sFgR$ug15xPFN^tV~WB|T|cO7+?{~WpR9X<$~pS(
zx-nc?YyR@6yx7!X*+AL7>z{?I8Q;=x`=scsF|0!NF_aAIY6FpmX|&|+aW>SGX2#ol
z2n&fI1F@J$k*Zu=YGhbgg6fPFWNX`LmXp7sLPk3>y@Ej`)j8YJi;BbF-dXR1bPN=7
z{;DwBK2P2)*rjQI5jx|~BqY=5PYdzXe`?XrQX2Q+BxSShnWXpWG&wc=dHy#1NM>nR
zs`|`D2vK{Rq8}K!dZeo$*Ck&dqUqXZ(86npQ$dmfv4|NymY6l1DrZEg7~%!H6)f(4
z+7Qwno|${3gi(%v3s)Ql%)vGC*UK{Gt;|4RzWd}-1Aj9%!$Gv)wyLe@*{FAKG+#K3
z;-~hcX&hCsgl9Y7?K{GGroUyXBYWZvRA}~9F$#zcF!p}RK05b&ZyVmt#a{}jxqMjG
zbD2;fGro2Zj!hCJGa;qGUg#w%;U$hi6<4mu5v|jo(Np7P$6A|*(XuYq<s2U>Sbj3S
zw3%0ACJG+#g_PApSrvF=20~@tqJL$13RnETjlk)jI7+-05=k6@nCX2e<){Ym>7cPu
zQ$FjTp~A=z$~RZv@@n9@A77ss)=1{{nu5OdVpasu%g^rG?=pL?@86D>-d%b*w(J&a
zmJ}PR&hn)SE^<?=jd3d{zh$pcS13f7f!s8Cf9JIwP|;}*_&5QO+)nzc?#%SK+1%P{
zv%R!)`RV=su8Mar!y`%AUPUtCN3q9^Pfe%xx_tB9SZzuTxfLx4e4@@?vmSUO;+(Y?
zgGnzTPo^p^tLIY&IaG5Rf~5j=(SG7FUFFCxMbd}WoXiXdo)kiHhr?ufOJ-nGgCunH
z^6rjPJFFD3x9p<yBOH1L+XbRvF2WMyl`-Q%jmY@Os8!#u_Bk!yfuSeF<yz=e=~cP!
z0m*ZzC7}Em0ErPYwoY}?Kw>rgy;Hi#FX^P8z#eu#JuT1Gu(wBPSg+RF`@9SP#Ia!|
zF61qBGG>zJe+tL^r_Y_*Dn;E~OlDQ|LxMvbQB%Fc?CBKIeLogx!H`9#3W)-86wR5q
z)EE|}HP{p4?%02*7DPl3&pAvPFdHPnLR-1(HrK+tLGO!UWv?M-wirBwU-&a-H%nP`
z%vcDzOgnfImk%*JBKcVk0#pxJ`Tk9?7{)B{fGd7C?vTAyr>Hb<@EzP*Q(OnHQ@gqm
zt1vhRhdg)-d4}x@gH4H7^lU#8pd9neEe<HX9plbT3wj97l3#)n$}fr8S;&el0h=@W
z#XB7r4b{~nA?V4~Y}!<+hBw$qTe^Jw21emeG0&{6dYhW#d3-Vc3XTnCDJgDsn*P@;
zRD5_WW$LR8vrvr(t%8KI7;;twH{EB)yqJM#y47c;0wHu+x7<U(Wj=hP_#Tnh3qvct
zI^ij{Z>e>k{jeR5kmJ_V@Q<=y6WIbeEKBr<e|A^LOw<U_$Z@V_Ja%t(CvI<fokh2-
zH!_Sx%En>&JPJ;!Y({8&ww_{ylLV`&^5qe$*m_fZP@v==Rwc5;7(z?Eo8wJ<!Cu8c
z&rX8<`{>*mkxF2o^RL{(p&(PPFwcne80Wr1v?$!$f*iTQ=oQxZ3%Tf*q^A8b@`We?
zT5@*8UQ_yAiScmyd0nr3ly@rNI*+lGqu?^qyIdi(X^$>4wq9TpR4XI@sn&3xY^s%3
z5@57eBrOxPH!LN#l*|mR-g<gym?Ay5?>8|&L2)3l2Yf1TTh3T-_c!wTK>e5}l}<Wf
zSm)C}RHH06Q7E!G2%@zA^Na%_V75adXbYO|@e<n=St>*!^S@MW0ug+#M9C+0+)<-B
z^Y!w%S)eao4~Brv5C7ipgyjZI?N)+;#P8@=U2wEL0@?4;Bd%)2Fzg?&v_vDp7F&yu
z9_--4`_H?6qy&@=K5Z`zPglie9m%qemY2clsuG~$_Lo{fe{NNU@|;a``nJD)m3Sfx
z!nd{rE}2Dna8?J6a@xK@a?(;TTv8CB2m}d|2y+zlBEhIEESMkHS(vTdF^a+xdIurw
zQ!eJt9>Rcn4WE#733m1e)^T`(#F-Et=Z>%Ot<*fz>laPS`}czjhre3-Yw1AC@`A7c
zReBbR8f?Ch1sK(fttmJgefvISr0hOfoUAv$-5Y~1Y^-AeU@yx`f=$i8C-53igM_p0
z)o+B*?5BI0K6bJx5Vc8<w{L&)qycx$ZfcOQyHnP|(Ube|9+sH6yCITP%Tf&zbk8If
zJAiI~1+Z;YY{4DYCbDPw)P+`&ON|V+k4}t|Kr)+wiVOj<1@8d~sfMQ3Z`0Uabj!(N
z(1j&C^>9Q$@8IR?$O*X)Mx*$IGbcsu&;su|hajr*ta%%@*ce!3p59BIj9hzEeG<Ka
zoMIjBGCsl~0kz`z9|C#xZh_}h!^e9n1enz%?A6_7I$y@}S3BxO^2_VZt*i6u$)=Ez
zp%WbcdAXKIu9?Sks30dZPeQRXZ$DhJG59S>%DGUPk5jmkXUkGxRfJ%&$7bRCfs2>*
z*k+m2w+LCCDZ^l-Dv3%YDWDA0IGx#Jpa?X2Ya{^X`+_D*NBb^mcQu1F_}#x0*JoDr
z#fQ?`=mJi_g*R_w!>?~8q>m|gSkYq2QZfVJ-CVCNMMe5i??E2&h#)Gn{LgP{1~uQu
z(X#1juqf=)bFj+m84f+h^_)ZU)pznWms+AwGM!9YqNWI{7}?12eK+2W6tCF>B4<#e
zNFqsvNyw7FJ3yPNlbG>j`A)ywTbL6L3O0gB<nt0FND$yCNo-YgEkZbKlT*Z?Ok-2;
zZb8D2gf+o2G?F7TL!m_bg;_=v_lWiagXV)wu#`_UPK3Q@Q`<BoI=0JUsz5_8Q~7b2
ziWWCDv55k0D%>mVHB{GB8G*1a=Y8P8zSC_{uKVYw%-tkBFM<aHQtAJkZSyAwgn^yJ
zx9alychSC+w72Mb?o;)6$qYE6XVEQ^uyWjg*;v*Vu-z`$_0<)Jm?^c{rqaW3V$IWO
zo4yc-vlUx5Ig41=vk$|ZOh*&P_#>1rts6WS(Zn{(Q6X)bHo02pMUqkmAq6G=B`P~S
z9seH-;7v9jGp3@muVOS$mFG5_AJFtpc#L{#j}u&d=0MGsV(Efl#l=);KF;nk^*Ri_
zAkx65Wh?uU6!qmC@zRpzUE?w{v4(a1=I@%yb@Fx;pRgJy?P0A0o0n^Yj>$Ul<r?II
zHYMkBoF;k=YE#wAa-{nzrmPi2<-o8l!>gc|SVN;xu)JQ?DEal7ej0gzA`ZN@y>}Qd
z)q%(BCfdoLrARN_@|=tn6afYXqpwkeswNzr%=uzT98_CeI$OB)I{6kSL{fz6Ch4Gc
z>gdr~a=-oxGz*Km8kq2haNdU~Dt@c8FQ4B;Cf;k^#&VJGQ3#CkT?La+?%Alel_tbK
z6&i9TPqUT|I^!C>_|JH<l!F6*PQkg+XE3$(R_^1Tb@69oY+)XG4)jQ;*GlD$bynBj
zg^Gun!9V&<%QI&u0<<0yZOw1VGDo+1<(rdp-<fc?Nget^)T}g)FsYmhN*?B?flcj^
zuLq0VlFgYeZDQnj$K>BjXl<y9zmaoVR@FA{oYGo-FK83eb-RS)wCH{CHH&eu1WS#N
znW)p$bTNsBu_2*Vq!DQkJK~Ly)5Ho6cp9jM^Z#cp1*+NE5@VBZ&zdz|x|69@ENuI`
zPP)r^Y>sC@B#cvmInUxv7z(?ckX}<LMA7^)Jv|+rtWi(W0EEEHkbidYQw{)<nnm;V
zszzo8Xr+_qrbjTQ&Af0AfQb$V5@VO3;F6=2GUtEa#*`c8tWek^1&Tes?R+aeSAs68
zFX0(oHW?GU-$<T~uh5~<*;GX2Rp|c(uu!mT3JhQ7QN-unaX`!A4N}wNE?5x-APHi6
zvpIRmrd-LKl`5c?;)wqpLc2QQU_X5t^q<Fg?fQ<F{GJYS5GFRr!FLa%MXmIn(Hnp>
zU}QQt+wzZ~YnA<x@(8FkEyFA*j1oz%5!TA1_?>>wL_sGmXjQO?m%8%Izo%avyl3m8
z%v8=48B>}vq}8H6jHNWT48WU`u6CiH>d>)=;TAtrqluRC2z`^vX}iVfD|7^W<d9f6
z^9`_dz{$SZsJv4FF(v1Ke1LUhc%g_9QhxJN_HtsgVS*vwL7F42_C`6g7D3Nov{Ia0
z^ULzPZ>$0unp;I5jFwuFjC_ish(0nsBPs*<1x7~JTr%U^Hw+99%LIy)odjoJTNJ!$
z@Np`cvAoP|nD$?Pw_i%9h)RAQgDL1?KcT4p<ntAMJiIe9pKZQ`FiXg>u%Ruh?uu~r
zmmQXsOlk-shV4dv%OsEd_@?N*OgSYA@OnA*DXb4#XCResL<pw7&!>S;rscO(7qBK^
z12AA@h8)&K^yYk9*I?{_z3r(AkMBmConBC7J3syS`IG*FW-lw<sXtuVqCe>AL<50y
zj1Zzjd?o)zHBHsqw<@O^%ugJ#cw^Q_CAQ1RM$*5GPisxjuCK>yT8+m?SvNB1j8x1k
z!da-fT#<k+eJkR6HHVDSc`K<()9<TTO~vp--j8m+kJbk;l&`av`TC0jE<CixVfHV>
z;`_M-yBl<1!vdigKY@aZL<1@z)`JCrex4NGTf&A!8^4!dz9;*Fq0aYo(b1wFM$53v
ze>Fe-u?7B%Q^$M3xqq_%OSk_;fr)<Qlw}^8k{|)nhPzP29y@B#(u!<s_{j}VNthaq
z>y0+P3AVh(`odkD<MAS`+}tn$F`M@#?IgY$1g<CVg*<PTeccUO_yE$yOZSNIy`3kY
z`;C@MVBP@9qpg1DQ}!)czLXC!=ZlP?{q&CY#XV)6O)K>$wjxDTHb%|Eobx5xpT9pb
zAQR0|Ussv&(Wi)4;Jgck(UBll2qrnLB7@C>9?FUEpYC^?)}Ocyr4^nF+m<oIzcW)}
zAfo~QxEm~Mx`TF7X1;gAv<#RqkJ%>Z4%l?hveH^;!Mzw?Ff<vTv-&3&t`w#fK{BT~
zGy#KBLRh^XJ4S&R-Gafk3ivwT^!WT4ktmGGnyTNE1Tl;Lo}XCzZLCOU;u{5>5f+@}
zAAx)cXm%DoBq8&-@CWCtrLtD2xYrz90{PlIM2<OS4_7{NH7Fz6VS4x#n7~}?qCnA7
za$W9;)IfTG@<X$KiHNSPMmg4}{ENUPCESaujY%OV;E`GGWBm0==|*$%a|h;>rFw=#
zZ+%qhaJ}})BWL<U%WIwvZr4-J9Y@>^@0DRhPm^*2?i{X?tL~R#JrR&F%bMJfadYVE
zqj*!WVicMvK#|iNi}YAYLL5Ljf_PIiDXN2Qfx)7Kh!(KKB5Ayp{Hpu2Gb<fk6Vy~_
zk0EG|tFozE^B^@BTnCY|r);3c@Z#W>8rw2~n^UtCjFDiGu}zsW{_9CVE1v8@+4=Yd
zUGy3e*$hEekRWXj3$Rmn1>J+2rX*Ta3ZC0OG5tjggU*08^a0s+prP7-RWnfQs5d#V
zo5nA5x;59VCCWL;4;Q#xj5~$-byaScRXCw2|5<lV*w}sS(-y0y#{waJIvn{qmlYaW
z7AD+97NS7L`>fbO`d9REdRYz}H9Dz?)bqhXeijfW5oBXG{u>ettXdQ44~rfUl6)b0
zzlIhjCh}sa#woxtt)<s2$u~nz8R`+n@;f1@$N_rrsnDy=RkKHj+y{b#T<&+7B~K-{
z`23YKXzPVXUjHQg%g}IXV8GoYN2@pTx%G5P{>;jWVkBGIy>AzPga7d9C%;nO)so3W
z^i=8NoPm&RaxZ*{5Q~|jk-KI}5tN|@$8tCYEpT&_BpJR!hm$4LM#(FZVLFk8;h%bn
zTL8~NthimEks5bF9E%}L&LpcG%l29A+9xH)H|vxou6ojHRtrT%>U5c{Wq(zdS2eX%
z*qo?=p2Z@Z&m5f&d<_jdfPstwT2cEc44!++s!H-JArj-XOs*vV9@UxDB&9{E1<FfF
zOkb%LwmP^-LYmIx4f_|d_MM#n^M8#rRPU885AtGH1|*;D<@RGF=T;+Ux-2(8OT?~!
z)K??{1uX>ySXm39g-pEeGB}clK`S~W^GCm1Vnn5<L@L73xj+eNwDj04BwU^t%*07o
z;`4aFLl~+QCmjf)@sRyAb(0%LE;<87+Ay*FS)qOX^%>F?du)x6x)s|jz^+)Y88xxn
zEW_TPOt~t)V0g5s;;!LDrzu&4S|7AR!9nxW7-j`iO+9o<$eLScbwMASRzaUToizdj
zBy(AL{ig?GDGnJr)BLL7iZVC>mS(<jo&I;;#aw2<a|$`h4*Ds;zu`YFPzAh~c*k9U
zPRgwyC@8|88MWL(8gfBDlbwZ0GfFmH21G(w$ayk>JAx|de0G6vQ72c5lqk<p-;)ad
zY7&Pn(h|eAm~@$%UC);vO(6M~Aw@iZepYCnt<k2cp|$~AQ#A<Rjr#rhP_--IHFmUg
zRV)wsBTcC)-@Q~{e!67av@FlnoA;ba1UOU}dth6mB51S~GGu`~6O&`tbc+Livqgk2
z?pNYE_TTuRH1iz1_d0vpd|J?4MxkfyLSsCmzrX+GuhlZPNy&cg!V--V=+6Q~jHzpm
za4b4mX+kcC?q^!9W#UAf?A8$I4`t_z+MNlH@=KJ2S0&v>Sj@?lQ9$-1w2yUSxtRHx
zJ<&?a4n%TAcz9W{_(O+y=mPD%Qh&;a#V$+}kXvYkUxY$9jWe^3Fat9XaP)<cOffBP
z)VU-oq#q?-Yp_BM9gMAl=Wm4^Zvd6Xj<9G)44?=@F)MhG%h=b%|J+F0;J+xWnh7w2
zn2i7g!{<kq*{+_;kk2eNES>~-8;`kSx#t%SF>xSn+7)m8I?5s2awQP+&LN(D79JTU
z1}6p<*P?kwl3JBVhvn%W9v=&v4lKqOwPcX~f=(xw)mB?;)Y2&Lvo!vgcXTD~zYJWM
zc^Ob-ho`&FdGw(G4?l`?_=nvwvYp&gK}~r;&drvX`!}0ifdDUlk;mr&h-aQ;Kg#K{
zuN=CPq{fUBUl%Ic1XekT<Bf{fo7tDteVX{@G&_-|*}Jty=%9ZLTNG#RTCIxz^=c|%
z-@!AP{p1SKK;^H@lf1{A$n=#a3Q8?%up_<Ml2rfj)9zQ_;3#xbEn9z<UyVD|b_u?-
zz3jbKu6dC51c3@uOLWQJ{8Q4V`wbXz)kU!o%yx<iuCQy8w@AKfKHJx(J*|Ieh1LCh
zyP{wzS2%^;R8s*dGXWw*e(+C!1}d70a|wY-d{Iet0{R~ial0+Her%pI@^m0Cm!RGg
zooe}+S&x<}rlD#YxUztcg`FGjNAte~qC6M&iT_IQlAdjw{^8TUaAp;&XVGrq<R=H?
zwws+ae2x5Ih}KI{sc}dcak^I0SGhk3iU<}^B^y4Crw}a07L7D`8_%6u?0r2}M6<mz
zP{K?x7#FkA2rrwINWT>d)cRR`GWN59oy9(~CD?VAiV(f1TudE5_Oo5?8LUn?F_r$A
zw!zGZ0Uu`2kxpOZJO5CSS53b8hOJ<{MUdW_ZFHFA5b#T$3@(XW%@`DwqsD}*f<?;v
z7zh9LJaVD8CE<dxSbF|q_n$qcWc6DmKL7DX4YQgj=V%c~?n|VImc-}$+&`9T_SjZG
zYipJ}H*Iv(y(W9fSLFmlKF-mAk~g6b1)HES^SiJh7UFb|PxD{<9rRQobrKL*Yf>(~
zK@lo(nN8|krXtW47oZ4Swu6liM`|ce^ef>W<`KZ1&4|4;Zfd;3yx7Fn<|L>?DQ7W$
zk|=N`$E<=6nE6+~4)XEx-Y2_qdoUyD%hxPYgG*!M+@s>;D_^hmXK0JN|1=#oi~2~|
z5S~d(j=R|8Xxy3>VIps+()C{qo@JJ!9*>nA90ju41vgpaYP>g7GsmlX!b9PqjbOG6
z$57=V48>9xCIq^U@{*~fbK`3`P>M_NuJOL)2ZF1Qke#M#n_xj#HC4Et80DzSPqBK*
zAX>g=@48Q)sQbiB(g{`uwFCJ>pemGxc?1a+W63}IN|Z~O>wrvrjTuxhYm2n4v=}Aq
z*l_H~xYYg(OW-I)L>1dj77CjpBRG+bdwc0gx^Y+@5rmQIr^d))#Q9$q=Nik*pkpf{
zheZQfuT)9gzFtUbSbx{x7L<5L-+gf{KK=Bo8U8dOTw{fiLVzQvrZ~S{_pkq$mo)2n
zBs`Gz-uFf`h#|vClQ~8Ksy_=PDeZj*#41_fY7q+nc-setIbWDN!0I~Nhfsc{lPKD`
z*9wOy8|moYVN#(L%`f22eHza5s334@;}_u~v5Ooo@z*9Udxe-({BFfcIjRYSZ_%Rd
z(lSu=i;~lCgFsYT66xWb?1Y~-J_vK!Y8PzfHf>vWe8|10b3IZ0?>L;hOuInqPe2Hg
zwN$l!KQK;0K~}+V;au|s2(ia&9U~C~i11osLHY6^{OIWNSRqXmj622gD}7k8R%r^`
z<O!;a%#&`j#N@FNmbe~&2-HQ|mZ$j8i@e;M<vg3d;Y_OqHwh>AhqYkLD{6$+hvrZ4
zywU!r**IlRaKyZ{Z1*RmPI<-?sx4yQ>1j*QJjCjT;|DV+V#X=~r6coyT)1>cX<0KW
zJD0<VgZ`%dVGP<dQu*|s_mE`7%Kc4DS5V8=PiMXM7?j+mPqw3Du<E>6$lC8|&6HQ~
zo<#u`admq`gXxI(Oc<3-?4;)`aaCqU^RnlV!+~!;C4~9&0w#xqRv6+w$nB)1tg&0_
zPCyfX*36UE<0OdD^tC6JGA`Uq4-?yF;W^ltkyp%y;8jUD4itqZc0S`<imW??PiLUS
zsLb-;WLUH?(}(-`xT%w>)5@=VE{ECk(SBvs-cJO5F9SgK;*ShS|NGu-taZzMhy!ln
zVnyBz`Dl;R{rPFZs3hPHr`EG*Whx>T$j+CN)}}1z$YH7KVxnp&eFxjUpe7s<MzsBT
zt~M5N-g+E$^0tK$a~IPyr$EezwN%TkScINbSGm}O@fvt}HLfgM0R#!&YI33>me21*
z$*t1%A%GT0v!C@d!&k9kuTPw@PcwN<hm6HtBMjT^u@<4k)M}H-3$zXVuj(TeVng=U
zT)GA8A8!u1B6@lGL4<k-H+>w*&%uX})~+n=m}s~53?~Yx6h|TmlU0%3mna=0uL3~u
zt?w@##HNF0?U$nwmig&hLKrN)^u55>1|a;9&-g`QBuAO6u4NEHEnTm<*v?kd(NoZ9
z=c*wiOr!)FV=nZ>?omt-mFgKDGT#7o&uUil0LvILch9&DQnl;~r`U8-<1wh1O6moe
zVGs0t7pm=GXqMAl1X_>x87AnHq#p&!m*Y|3X0BWE*s`bmd;i3-dvD?eFPSzT9f^Fc
z6BhRg`CE2l%WZZy>G>p|4FC!D1K{mm!IDV-7~w&hTS?9?OI%5+uOQN&t4mHYTN||m
zq%RpnQRiwfWZO_#0HZ6zD6aCjC=&P~W})`f;L^r&qWFvW1zOxEj0hH2bBuzQCUjh!
z8Ma9BFwnhl=v;vuYB9UlCSkLy$XgK)6t?vDv`LB@*xw@d7^4h-kfvjOpo>ND!$3vg
zu^Q&Y6I0#P6ezv7sz#UXvr@#vWoIPV+yZy@w4tW2$V;%t!%9u9+Yn7le0Wp$^r;`%
z>i@sgj4o}P$sI|JQ8G9fg&9WjVCcNw#0uhA`5Hj3QH;(;>^R@_?R+*5Q3#eFtt93w
zPr!L?updeZas3FFqmN)=O$)>UDzFDwHB^OFaq-M*+8;BMk*RN$@p5Eu8M^AkGOK$c
zdzqnlJrH$m$|PqI^6yd*T6|2a5-9Mw#n$3Zn7Ayq(C?Kpx6^fb_B0w??^rorSuYSq
z<|vo`V>xh=sO#RVURf>*=71rLX0eSVCez0i%J%{A7ys8(%*%(&45~(v36gQekr*k;
zs${zv=94G3f7hAj(Eo69B%b@P{~ezEWym}MmPfIzYC=gL1_lO*tBC#`1OT^U*#t2&
zp*Rp<;1~7X_EcB1lnYo|6Km#dA%S0>c`^cOT`>}iv?P3E^4l!;LSh<qO-?mTe?s^e
z95QT=(7ePGqhk2k@u<9k6ct{>fIW7Tb<P|;jFz=kwIE`Q@IgMzqxjBk(Zmc=%{Pw=
zaR6<MlCb9#Jw%>**K>Ci==TWxf4vb|Un`#$uL9CR1&-uaiWE4e(@Lk#KJRqMW-AUA
zF$14s{gexy*M@Tvve=+JOQ027=pBEujZ{@sRE<igd`~*wxo(lKNh24dfD2<7X!8+7
z($ee*gK(8z<L%8Voy$pcds^rLGk@tV#x1Rb$J)W72s9;DIyTXrqs;Z1Ffe8ybT1z#
zcCjLZ+%~fJ>xYiGHVaRVJxQ=>e=jDMXrw@phT6><D$!y#7_H!U?T-c$UOM1b*O@ym
zfBFAnY4bHDT+TZ~qTX|ct4Lc;;@7O#v)eLxoG>}d{Nd7>xcutw2GudpPaa6%d^QHs
zE(jsO+JV8gk(P{fYN~A<Y`YoiUL1JFb>WV#)R7c9L%OL(D26;>4r7DWgUev4Mo26|
z=W%zRdg?ztC!dRK0SkU8CuWM+J)e<jY3zj+8<=y6ksvme+tw|D4^0x}lX>{9TyghD
zQWC5jkkU61C`-7QVG4z@zPQoT({oJ^EwIOy^{m!%{rJC1kCGvu6>3d5#$dh~N&Y-a
z+?Ob9?YDdJ&2|4*Z4v}9&dIOl2r)A=)5J2PNlXCFuoI#?G9yt~)iBu6;E~+BuGR^n
znS->X`-IUAEm{dx`BeiB>0Bh576ipxvbn5%Ug$$oFu2WVnv;1Ha`B_gnlH_+NzRSI
z8txDkE;*4Ut_DA-DCsKsFx~ty(y9Iv0sKv*w3-udQ+s>dY_naD^DM)2r5o1UdY@AN
zuLs#fWeXKi;7_h)Vg|8ri~}&t82{AwWNj?v1}?ox{jafWFed&fvC})5Ex~bMC>%LN
zuIy>_*^Q42ueQtmYH+{y1wj1<@~isixvZ!zn!H#%ny4E$4+KohNG1qFNuLLV1S6SP
z-)zD~A%kF6+*@Ka!P4-Lv?NY)whk&6wTU0>9)p~y*qvyq8fz(t?QgiLMTs*fTWICT
z<eIx(C&|Td`rquUH*$dTmu0lU-pF<(Df!!j$_uT{mF!%&$v{v4P~4x6wCi)hQIj0K
zELQ5MSrrZwMaTi0&G}gMB=Z2cpDQ~=T>v}ZVNF|&i4QMyJ)t})LrY!_NxCoUccCb3
z_ktobo126G;gW+t`usbJJG~Za29x~~MIE%N0{}#Aa5raVCDv5S5QLLz8CSB}DSGzN
z?qP;lZ96f7i0D1XCs6@I_4ZOTkoGBWH0SzYK0K!)ZShq#8vTntQq8I@ctAc&u|$u&
zbcHu4xWiDOkcWg;%Qh;#UF^$}XiDz)TltzrC@dbZxzWLEZwmef#|jIGr=|#dmTr=y
zq!n$?A^C9OM-S)kl{;AFPh@rNbQLjKO%$+?8l+O*9?S@N$mV+G_4%vNfcs6y6+t7H
zj7#x7Z5C}+j{#$nSxv``kvTaVR#=!Kxeyu+fH{G-k6z??eA5QbB@+(OQyAZxp})t6
z;Z7v9DYRMRMu-W%#V)Of-i^NxPM+j7sN*WBV+W{{)@xwvP}$0*6An=soZBfj;Y8!&
zDO?6|NH0^cx*KVLLZ=2_eq<4;7(woGQtRG(=YsB04gf==6!4F1Hkm&`41kjK-z(Q&
zPn+L<IRd0TdzRB`g}n&WEo{`(^ecrR2~hJ`@`}C0wb&4~92swXJ<@pAC89fpzx1_y
zOdf|hlRh6_Q1z=)Ac~lq*-f4`46MqoE+PnHHZMpZ4aL2O#DUmAc15}^%^5xa`tvm=
z$?O+hZ7&!_zy@!vthVHfkT1wpj7%ApDE-C&aX0df-LO?5R)a$;XgtyyCn>cru8pjP
zW)p{yidbSB?<S>Zfoe?`oSsfi<40dj#Ve;N$81F$LXz>g8<2H<WwYjGIq`fQZ}>O?
z>M}KE`N}GZtP+~CBbIUWoG0=cWaBA<1r{CJ=xe)}SUo`^Dv{ZK76DPn1OR{>4CHWX
z&m#r^ccbc}K-|fidx8_%LhVKbxv_{AF_O{p!P&I;CXL;_v<!&FuOg?QX}$JQ+5B~s
z=v8wj#~WL@%r>tWMMo7WGTwzfc_3nZC>KrX2%z4vRVH9*_=hgQxIn)%FH?R`t-HIF
zT5?2bci3``T~ANdPo~LDz(2uACGCHqww!Gc0BFt%5shDJf+@0VknKV8AzxCt-JD}a
zyj-#a&OCI-4cAufp`p1kN=2D<NGg%<qW}z+u<tKbS&EQplLSaoOjhRIv1WBC5OHaO
zoO5U1d}L<%kI9<mD1?7eZAXC7<-<H=YldM@gri);u#DX3Q{v(MYH_tIJjmPf04)Mq
zMNvey^Oq6t39ItB;c7MQkeZvkm^IwwlF3)S8^)eOEy#LxkmU!%u(z{)hJzY1XCA0C
zxnZ;q{}*dZdEIszG*S>ZtQi>WhgU*)7V&{!lO>B8$G*zYTI!rah3wk4lNyD`?=6%H
z-Sm;?mN{*L@+DnZa10IrDo&Up%hL4DSc9A@kQfG5McRau5r;_b)W{uSj;LD~!L<GJ
z#XN|q72Ypbv<}Nj5s%BxozDttrN2On5S*hWVc5-OIL3Mw@(OLSf|f*;Z_TI;N|g!6
z=%|d|jOsqEzHI)@;|)^&`^vo5OOS(gl?RQ3U+vrpIHxPq9e5TPXQYzx-!;tJ+KQyF
zYIa$%v-8KyQ>iRpr&p2NFw1GbX?=Xk2s-o7p*G!H6=1PN3S~2Y#<HMvwPe%G8$<=}
z;>h!$q2j)t%5&#`Iz)Xkpj;i6<9E?2rLNW*!#}hzNWm_X=>O#ARLnfLOYoc+BBBP+
z2V7Xd_G-#h?h(nK+UfT(sGfAqi>!Y2Et0sS7~k<UHf=tgD?<+a#sSBENIlz)eMX!?
z)onDkAyvUShTI=P@v==dg(lDQrK?Ctr^^AJdI@ySFd-a70H>wAqTeU?3#(!59U^zn
zsmR>9Mq08g(IQ_uLB0Z#Nb9?qvw-9rxQf7{PJ1(4bPQZTV&zTBM<hXkm6@%4VOfm)
zij2H-j1?9^V#z0wv*(utY;iM!t4Ehw-qB+OhW0sw2VZL87k+J>Iym;GV@rtx@bmDG
znbqDFf1JWBF`%_DGBq*Je|70`O198x`W6U__T1l)elqm=Zz&<>@KRdU`n|gKhu;2W
zg$nEQ?Mo+HB+ZhMsNa2jHJIxA*u^~3*mI&25d4?K+#GGCVwRSzn4HvIL5Vq7z5;;3
z!5I}d&a6whYSci4S`04PPKb^*;?6+LG@p};eXC4c<OB7HAf++_A!zY5tU%mqBXwUm
z$g^l^K692N)QYJt&!uN_PO^NH61N-qa49eu^HfPrPGw7+&ZRd>ha(8vV7o&4MhE;G
zwz*zkW71uMjXp;gvDvzSkl`<FiYjChZUg<2=eL(aceeSa3Fww{%_TcwliG_PtsP#o
z!SX-TDz5zz_@4L<eZnB5zq82IuAp#kY4-S#7qtP;(Fw!LVi~ibHk|58HO5M{uyB#8
zAj!Qb9z;yW!i_ls*@8#fauH6gpOSH82SW=#i%A)nl^+p4_NhDYdPeq2-WqRjU9{!r
zedl%#UycaKUGu9Agc_-HJ?B(E?R!1BspZ(P$VpDA%%8b!Ax$dBiN0~KiYXN2j9RYS
z#iy8_j#DzNgjIzB+9tODbn(q&GY|i)e6@=h1fZ4o6U7*6<ED0+wvEgH774Vu@Rre*
z&bKdG4Zs{GT0)r``JTVhXlc}CSTU%%&DHT*KU4xNb8J5}g6kc9iXHm@&hE!9^;imX
zh&&@xcpdA+Rb)r}Iq$QkkN*}W{C_NfZ41fm!?!7c^^Z*cP@@U%|7ronY(1z=rN{_t
zF)0J4uvStMO{z}aoXRYlmnrl`<0m1v?dykM$8OUG`c;uMJp#Qy5k_c&DlZ_41)Z!e
z%j2{SugP#}`#|Kp`Lo}pr|nNXbr>37xMVQAGvOEYyS!Y=D|;huam)RJt&#-8-WbYf
z!OXcy{IkGIDYAVW1DBkRSj=rUQ{sLgcb#|7rA{*=?dI9^0e`X!Mw2I`cz?$!+5ejK
zpMWoFWQ2u<!DHklMZA-Z@mKVInUKEnlS0#K!i7j~$}VR0R|EjE#dDefuR}oFzi$}q
zpxqzx3H&bv%?ZfJJV;F<$CdI1RW;vZafGdb>p2N$ugDjlmdMTZi=i1KPDLW~&i!be
znCHJ**zt%+sSv+{rZEfn$Oq8KvH9!JpZeZX;U;;7J$yohn4^C4Cu`L3Khct5D?92=
zdCuVsYDX?-r#_l?p4g@{=`J6=dLhrOhjvw;t{MJD5J$8}k>qyvPo(8*++^OJu<NIl
zd$;Lyw4#YF@gAa+n9&^`GnhGN0fySA^w4N#v|TShoGOVT6g82iaMB4(Ix6m8U@-~g
zuv}wb`#~N9OE0IyR8-{|9`)i7*p|v6Sle_Z;Vo&{pjqoHN<cB^))FcM-#=M5xEMsO
z#GkzOsXUhSUK_V$@W3X0x-HjCX2f61`R=TsEBE3T*l3OA*$t$di`g9K!b-fAqxvO}
zGxVwb26NmS5_DA|`EA8vgc*G7N`fmkyEK(}x~mvw%%|$9q#?bKLB;G0-TopBx6ei1
z&m!wZ{}7U*_0WMK1I~(z&3S*bMzc4D@9#3d9DYaPuAhk>FjS+(1vF=J+WwnQs;$nH
zBO^?)e{1CPV^E$-I3$*BJ}?U9aazDYk(p}|eDDeH$(rup>Xb98(b|h=6SK&#jn)}_
zNcwvLaVjcn5-dc_BP8ayeuI)eE#BINg=Y^JH<DCu5nfeRph;W{w~$OKOI947VZ$oi
zX!$`}HV*yzoTwNE#h>I+@--DCPiZ2Qt2+QEvV0{|oQTENGBvQ?rj1bEr4e#29j0jC
zX-WfRf!a@4X2M{4xMIn<8lG0`XhSot1C(LCDY9)c_+ihA!2aPk_!k;~g>#%tyWwjx
zr}rKVjQ{y-`8HtU6y91EM+~0A+&i3UU{}fv(e2e-J(PsMZjlD14+7LOa8MzNt9@XD
zHz6pBKhfAiBgwc0IpopI$;h1siWK2Ml6|Fg(h1lv$jzm?OHXWEfuhEHt@P_gM};kF
zz(+kri#0CXs}}&T!gesCpqRNri&v*M*mX|+PjB3B0s+JL?4=YD3c=U^xR}3hUP`--
z$V#CZMQHt(w17V@TTcI#qAp8`;6}x$xkJno+U^^I6RfT@zoO1bs8C@fc(-R<KlWUB
z1b%qoHZ8TA*{er9%FJwkB_u46HasY%tOj{~XxK*H)3B__ZwwN|{Pl&|I<=o7>g)wT
zvoXBcyGg=S<eSq`JMH_>x@WsF=2+1xfmQW0iMVrW9R{?8<U2#Y87z1>3>Qa1=C4`+
zpKu=V8#VGb9ho+~lP{*5+5X!=^<c%-S^uBnzB8(+=-HPlRUi;)(nFQrlwN~TK&lD~
z7zB|H(mMzQiF5^}_o^aQKx(A-COv@kCf(3N3Gd{8*L~}Ld278-@9~9X<(z$HX3zX)
z_RQXM$UF*TbY(O@POijoH12)8J5?;-E#E2RtJNJ2PAfuyOZo@Y--j7xIlV)^?_{S3
z`gRWL5R!3)LJWz3+UI)t0WC|wgPs=&M3T~l?;<RnwFd5jqT1Wq{Pm(>h}M^>3^_N9
zBe{~qL9&8(rm3t)M@LOdOf_@n(g9Zm{&6goZ{K!(*>s#D==K7`9iFi6F>uef_Wg{)
z>wuZ+w`J^nc=WfiO&rbbqKcb_zHlnD{mdt1HT<R6iqeDB{#p9+dEEf&G$iwN?cXC&
zqE4sHJeP652}Wd!Pzv%R5S3UJ6--k(<p}Q4neXKqB*hf3gLJk8scCfVJb8_g^rTuh
zW2=lRWW!|MsVR#jjo1k>*iaO*(#0LPO1^lmb{082o6V&3@d*LLL-_$<pFvY4Q(e&b
zH#G}ILwx<~&L7<5UPm;6!7~ag88z*Oo&<OGZP9wkh@icEHOUCSJlS3*DY+$L*L2kr
z`!Ra(6WrQoT!siZ+?4n|6;wCJ)KUD~uA_1IfPo;rqzPKIiq48*`}Sk<yOVUzq+fv4
zB<ComP()<F@fkDY`{@pi+h-qmv3Hp2c&rGQK3xYys}&^?=WZ(jZPV@@Oz6uISty#|
zH85I`naT90bs%^2)|YL=q)oxT@%$O^ec1@*1_>jnM0$lni&vSy`2*D7l7BFyUS|IM
zh53sh$dLE#mx3F)>W10_guIFKj~Um$rdrVz8X9=#8khF=N~%;0f~^P<C%hV!u|}*8
zM7gPf#Ocg8Dh*^K=1o04D-3m)KB=}0^GLW3*rx1m%-opVU!GOnH8hyg!>`2Vqu>Fv
zs|Cf>;wydZVq5CD)=wC?YKja5(q39LWqEy0WrGA=Ph72tr7`b-K7f;G2<7S7Ma!wx
z`(U3UfVQzW#vvM+d9Q#n87qyJkl-L=a-mh^Y@HA*^gda2<n{_B>P94F)KEHz`pc{t
zGNSLwDrOuC6$Zmk=dS8`iYh9yUs`hxPaYQ1Hj;X>O9J^sn(*`4veb-A;_-?%(aiQ)
zY<x_Q`@o`u{@^dLm<I|Brv+m$;=dYtF=CRR{`hPk41n|LA@e*6Uqu<JK$w0>gYju$
zqMuN0S++Y*qy<L})n0RJZDkU?b>q<xHkZCcGnh16HgkeIMLZc<dp@bzsYsQl$=&aM
zy>dJ}!^F@DmE@V~Jo0ebSsM(>BKKtX!;_TU<3x=_qT60*7LC~dBy=gw9a4!J_egW7
zjCsV!-?YDbm{IKgwn6Qk_d)gJ4w>B1*G30ivQiV^k4x~XR--b50hsne(|vV}`8_X9
z<=lsiXo)Y95jK;lfv5;sk;LBEZmrH;3Yu!nn3~{*)(1OB<COTo`RiKob&V8c)9C5+
zT(=KSc;Q%|gVc-t1D>Mz^N^tK)%4*yCQOk#gOvFlo7HP<2rKIZX@LAmfv`;I?(#7o
zJY}TNN&I0kr?H@RoL;V}ZmyMhjU1a3$&!?oM7X;?>9)5RR>*?B9))rt2eUk0Sb17h
z(X&o8inwp4kcJclx#P-z{sJw!9fw56-#FL~(WPT%u!8D>14<V<15_3nNB*-ERtTib
zQ3F3%iHd$EZ~uH)9R_T2<A0W7Wy7tX{?+h{{>!Fo@s%0<J#cW(-B_fTy}yf9u1ris
z-(xA=_bFiCsAhEhF!gPbK`8Wl(BN2S0;_sw!GL&+mR-^<pSQU9$V&!syC^$tb8sv>
zb+jCteMS#N>a2m2z2O&@`eJ`ke0~#{r<-`Gq@Rml4j$#|vkg+EDOt31-Frmhr|{W<
zGSzCBPmMJ|S3&gi=&@i59fJ;5P$$#weRLi|lcioUPclr(ghlkm1Lrtk^GhlKiZP`k
zU^eYnj8!tEwqb{D=Ck8_lWj%`%Of2cUJ}L?ukJa@$uQ$SS*0pj`~}YLa9sYi{R)cl
zoA5<n$hPeA!*aGafkLU5Z%vAjh<uxZU^F#1MpN68lBzIJ#yzGd2y7n)9?*E#32uR?
z?2$Ee{si3MGV}qIA|ol9dswcW9Qx2f|6QxmQ=Tfs!$Ok#FSv}WL`qx#>|ARTQhR2x
zIAmH@hEoaXf$ZGKk3-fGldJG{)fJjYm(}Wv-?Hk(?{@&vM@#pg@&gl<EkHWXc<B_c
zXQRB=#=FzMq4a+6&#oIR<>ewWJ!2g?waOrwy68<o`yzv4abdSnbg;`$W+^85?gutR
zcV`m(UR4>(T$;TJrRMF+jCgy)(6GG#`zS#jGW+@bslr!tky=-`MzP(Wo7c~AHi|!|
zwGY4A?nHx{jVksJW5qF3O^^|<q(1dcg`K?4og4$9g+#s5hrgkQ&kx)^l<Dh~BOWOK
zF1Vqk<MHxU(|+cm8xzTGrdxMSjUP;c8LwgQ3;*(hWF83yA)?90{Zkd_b3ni;E_&RD
zy9N*5{7}!`i5VXphvvu|v=uxjr20<dd}e!ttiIjE!W=XW>)@!{Us7yl8~1t)ByAK1
z(ylN8Pf@#0BnEe-jQWiPk_idM^H^rxyZ?UWg#$HABNgBXeO^9*nq=4f$|sizY7`mF
zq`{Nm*E@U~eR4ofd>bgH`~ZjKIf-agKEL1Jmg5?+`|ddKxcMvR-CNR+ChWW#-XZ;m
z&}HvI>CC@S*N}?~B=aaN3WSk&ssEFoQ&yM&XvSF$Hhv$jyfO+YqT@3re=ss4^21Cp
z#i1CQYZ>!ETZR7(@E&NFGo6Iv^<D+l2>7~HFmmRI<_@V%l%a&-$3UBa{8n;l!QMv8
zAn}{yhIe57#OE#cPISkLL^(ogjwHgM84=A&t&}6xs{{jy`)R{&{Q>NuWqkO$lV*XK
z!O7oaHiS18MV%F~eh##|$lw8b<pHY$q1QatAK$b${<h8r3$6;Rt0g@cwR`lECK$~u
z1fg3)IswP2=uCL%rKb{v-YZf+GEbV38pN6Kt_p7%E0*|>hE7~RftZf=Ot&%pTT}h<
z=Tz{;2x#-U1`r`CYNTgl7tua}$qyOtT>khW1)rU{LBS0siGr-o!GS|z9UX<mFZKv;
z`1sMt@KDlS7e`39rfC>aR{eOwj1vMmItD&u`Ao@5)$?4IvgVzjjwDO=H%!Y!zIMj=
zvVpw7-UzcgyQCc$ms%TTqBO`uSJyPm0I-Z-taudI<lWt|y%5x{(0_7AHzoAdYx8J#
z&VV6d5s})ZkVV(A8GTCVZ^aZ1iqGqJSow)aDL=vn#yZCJ{2tz<#D0ZQ6Fa7)E0=KR
z1syuvtf79uVWk<spf$KacO($Kq$xdLA{myj5)I;ACuq8~zqrUcN4CIXey$P6sZAN-
zvxP$FvsIXP&_*gjM1plrVNjcHPF~T-(>^=$k2?A<y%3p6@kQh7RD?8}^u@nbS|6y_
z8oNb`P|1;gOs!&gHR+TIyBW<<nY+m4)ARB0o19F28^2ah=aKrb#&Ksm$XL#}jx6St
zAkio+?Q|33(%cH#bYGM5Om^(v47OFyXvh+J_mH!JS%Wu<yC85|kaRgtj${wnNMoVK
z^mAKc%U7!NRhWI`7Wi9ZMeVzqC#BzCdXbLN2osLcjQtWO6ecuo)BZK1p9Adx%1f<K
zp%iClwSh+Z>j6kkR9DjnXSitMjDuM*jM!k_ReIMO6K`bU{&Ja-3%WuzQ#;Xr;;Q5q
z#4&oh8PIU78K;)4vl=&2Q(a)}YElk;T>7#r^u>yy2SPAd`2BSv%M?FS*~sKI=fqbQ
zi<G?R90O6yJgI(Gqn=)kH$x2TTO&zG!VJP^4O?T3p$6Ned@_9sQzcDDuSNOG_%toY
zoZKwwtXip_$DdURl%Fb}b6}9-fj?19*Du7T47q>}=Iq7u@hZgQ##6>j)k4(V?-GbA
zWh2<RNowONwk1+66<Q10J^LITXTU~xBZS%YiHiuA$%&tmkNt|j_>({`azA1G`U#UM
z$1Q7tmV|NEJM1qx9KKmQG!M6l5mbgZXhb}av=4x-ejpB|vwKc~oyuyG+?U)RJw0oK
z0eSrYoS@4rvE~d=5Hw28&wr@KY?Lz&>JL(b-9lJ&C(<Oo?IlU1&=)X$)`|WKg-t!J
zRL~-P85g}Sv6Xb-I{bm)3xR%k9xE&R-e&@PZmX|`#!|l=f09#6Qpi`Osa%v-R+OJ<
z&hm#!(zTIjg&g;8S94(G&jAt0{MinHByX2|h`ev1XbdHME)qpA7EvbU>ZqH;C*59?
z`oomp^^GlBAdGS9!36cc)w}_E(whh{9Z6`08I=vwz)espMQ)mw*ca%l9m!;()R!?}
z%W7Q)rn_l%HjyPWYlP&v>Z5S~fBxQ~)$%8EtK^>bG(32De_a`pm-UqNR4#EtI8b_c
zCN&xm6{L91MVO1XCsOdUKP4-AW5v#$yeqU+X&Vh$?bJ?H>!JzErA<xBeIH$0WbmO7
z;z0IgT1_;8MUld3Fnh*y`jb&QJg~1TFm8senj=7E5C5=-djQ4&uO>guj#oX+eMC%{
zvuDt_TB2)m6C9bMZ67nxl9{L1KA#$v=ETDwN1(>k$~zzG=RKMu)IJC0ZX~1@%>yy@
zP+c1Lr@)`IcbW@JZ{|xReygcs6N!-U>T#kwSf)aR1>pT@{oXqufty*12DzX~e#!ui
z{ee6U1^EMtO4tsa&Rg*A`Ef%~JK1k*PR$Mn9FQO*p`<^d?s#A0@Z)_Leck2lNH{w;
z`%Ax&8b7PElU+y`&7{$7tIKRACzm0~Y)n@ASo0;*oBGdcz`9{*f_)!5N1?Bv)kraL
z=|Bv(YuKrlBIPq??gXtrjY7i=1yc}47SP``{%)~|Wpa;-q%dC6o7bg6&=&$Nk`aH|
z4Iz0V;DXO@YvtZaBCb-XE>9OwmGbTDZ1Bq;kdd|XYoTFKgLi}8S&J)w-_7GnDsu;z
zqIM`(5EzJ7Ea@dEK0-3QQ#?)0M%T{)Xt1nlf6RdRC=S&7joW4xtbd0(kQf{Eq^eKe
zJ#JH-bwOED9`{HQjluM(_Ge<Kc~GRG;%A|QgDiJnpDiya5?Pc5@B(^~SyqnPj;1}s
zC2C5rv?^VsrnR+w{7XKHP_|y3HugqH{>U|q7Q2s3gYddV>O!5=Qau0tw!*DWrf3X}
z`N!Rda?=t{f{Ek^K)p0d*JStZ*-lS)WQDvTX)r$x17-&Tg{n_hI{!vU<ya+(AoOme
z@ff|@DncSb3{nLorYVuPT~@16(K0-D5IWQel3~5S^j}MSi#-`}yR9h7ZD7V_U0b7B
z(Ui^&a#XyE4_a`tW(dHI0=PQw_-~|SyJv(r`|=kZJ(qNxw^Tp14}zfV>KO4*jmeij
z;bOa(ou9p27mua4cAmGQDJP%)i082+HRYZp5Gv}3_XDpzgry7G%{%Ak*L>&MkL%Rq
zzFo3v9b@<gsa74(i^Uv23Ovll14gq5AS;L_9M><NeK}5+WWl)b*xjj%E2^JZ;B5!1
zHknp3(@WTnWTu1Lmq}zTp%K4JYI3|tr_?(nA1K8+PaV>_NcTu2slSoAm7A4B1w*!e
zaqplr#2YWC_rR&FINr?5aR$xBxQ}Rcnovc%W?+Nf0q^P5hFPTj;={;K_ABI5Pis99
z!ia7qBamH;C7-z?BTFm@YE9=@shddwt_ja#suiUZ57tKcu){BzU^)F>oPF%M+Yf%D
zTCN<6FGnb3G6Ji2tA!mf5%uvrv#sC+BHynRsK4YkSn?<%sqn`=-M8Go=xOHvvJSuR
z%phY^`1bqu(n)7BPue*;WHm2%U!i3YZ*>7c7y&EL$ay`X;vmR#nXjvE;s0Kk$m8t~
zvEc&In>H8i*^4mM3_&~4moBXdaMjbn7*=($*+HP=CSAo?{zMm2DY%vNaB^54&_ZV*
z7V<)DP1Xfp<?5qUf9bYkZ5RXoRkc?a8PJu~4SWaCD)(X6NVsN}%cD7NzP07I$O0QF
zXSv7h+)R$-B1RRd66+6DnO&~}8;(6rmnb~z&58ZuM!cYZ$2oELdOGudo5#n=(eeA;
zo+H&2TyQL^Xh#5Ts^r@MrAV{nI{=&VJ)+Yv+X>yrdfz$Db9Wtpe}UB8lJstu(-7;H
zIgs{LI{mUWX*NgNU>>Ospc||JhYgwY`%BA7Mvz07^Nl67+)Ij!5NJBIIGxs3vNxEf
zA*9G>Fbw|no)vDlTnN3%9@=2$5!uBbhi(;6Qoicn`2D@k2_pnhiic*1DQ!SkCA%9F
zbLssA-;a*4PH-MXw?s}Oi^Q6;cv`j-O(JZhc!w|F7zr`w&hSd>rMdAnPU6QN9Wk3!
zsq8@YmtLtTe~E(*+rp3|cjn~nH~1L4>KLWu=mWb+-pIx!%QaweG8QL*u>Zwt=}g*K
zWNOxmCISBKCWWy?u5qLgE%-fWpqgM7l6^7q`CaXv0sjZdo42sJWSP6seD&sv8XT-%
z>@(*_*?U19e5bc{dwb7O=%=m!K9!5S;3T$!@^m!yby#6b^eBx5xE{$WP>wwcZ3;}>
zTgL_SZ^iVeQfao1g&_BT&d28T*BAqFhnLLefGwwHDacR*ru5;a=W})GEs4R&1PKcC
zGu75Iipe6=ZC)|pP~i+{9i1x8iB>>$j+9ist1-5slO@$drJ(T6#yh2LDVPwj&Ybw`
zx+`iLLIugX)S`wGi>7<`<32b>2mL-4>^pM$B4(rx;^u+Q<RC|;)IF^Kruq+c8^n)5
zpa$`-jVbzPEt_CqupGP@as-{m@AlnKNKt$RN5*k|2b1)I=!<}jKCfXVbvxwFWLg}l
z5*&WoE7-JB?g@T>FN9w>i|^TWsQBFarANJY*?$I^_nkPmEa0c&J5Ij$Q%`2h+xU&f
zau@5Q*<C+>P1?WJ8`gj2Uty*otF1k`wtwB`w0ea$-FM&M?dp@uPX}uWD+mYuNk<P<
z8mm$cw*#3L**0RIa&!9U49mTWa@u0%5p>^_Kl-^qTRgAt17Ha3Er7N8kM=JTW9bqo
z?5f^1pbgW7bl-(ZJ}esHsc;eCVubgASxBSY`zbVb{GXzab@2ev(c=N!W~?7L^wpD*
zr~_!-mgN@fSe4+gWT(f-G4}G4gSUh&r9e!a<jdf*a5T}V!M_OVw!ei#s>$0uz&1cH
zneB`0#@~b;Mnckr3YPS8J_fqv#+F`2I<LJSy%`{JRHsWx7cBaPcxIY%uq!~T{hAq(
z7);}{<3$P3T%aWLS0U|q=-yDml#|8~jrPZpE+ywU30D!s{lcF&C@crT_qn8aj63@D
zd5ZyRSMhMRITdm35@GawtAv=JL_1?8Zw8`A@hwwVp}{fCy1|LkrlIDRC6TTXO>E!p
zEQjFLzr<{BT)jE0DKJWQYP1}6RxVATdb$7f9}`NfhuYy8up5zC9`sMNt3g-H+Ca8F
zLrvNH`p%@So_g}OU4o*<l>639vYx==FLSmfL<OrI-vOGW+b-=OnEk2dZjpGWR3f4n
z$L-SG4)`Q?Wnh8-*)aKqLa&JVO<p;Y{WL3+NNXu_f$51gEr0tw@*U=dpnAaDE1-ca
zvuOE?vlRyW5&{KAn6GYkBmZ=>Mz?N7Ta$*Y`k8BHnAp@PzEU=GEFIM@^t+70yBuMy
zz$U$9&2I`BdW6vTjlhqDZ&6VXMV+i9vN0*Y4zpn2h`qJG?|~O^4I4r%xqt1sgP&$|
z|C)RKXW(E0@ZDYXfByhz9B@U=I6$|#ShC|6{8;8<|5+@#*PE9W0vnKk`^<Gj$#VZ6
z58zn*_8@3KV1bm$ydvOqZzWD~Z#h~V_dB`8bF-VRZ&<8)ueaW2J-K<uMj+!&n|*QS
zNnOZA-P+mru4vpMEshIu;GufzaXOlgPF3iLUxsjEd+0RCm+%*1da{%Q+QM+_uDI9V
z4xIz_6%8ZZv#ysoaZAsJ{U<2|GVqVIRl%gfv3({x`9AYrQ~4anC3I~%FaCX0a_?fX
zold;$)em-8{L?!$nVYe(UDmjl;W6~g%uI15M*0sX>on;wJZm`9>-{2oj!z3Fb8IUK
z$?-2Cvb3y>eiY#84f205v2ZoNz?WwoulyOQr+hsA4`LQ;+kCa_y5A6o{BzcI?@#f*
z3v7!{H41~hJQ~wqsBvThHSapR_J{8WpEjbjy!wQS=|G^MEgd-8AuwQJX6QFS6K&9@
zW;eSJ8%X&mmv*q*+;=HrZFF#O5HqA0kIed)RNTRwifz~~gXCQ-T;s5hvxCpKFxWt|
zg^8gt;P%@tKVRC|6mB;p>Z_z8TaL|8vhkcpfqOr6I+n;@#vJ|_0}d~!USm{k*W-ha
z@}Xdj9?lVBPU-An+VkrE(g1fCj3ljJk0x?+J>7LET&VEU*eq5W)2(t+Ip65Bp>raj
za`@gks6A3Y(*5iAAtj71&-vwsD(Y<HmWjDKbl7jmgT^iJizjje`yoD%7jy;m`2tCY
z9E5Z7=Jme%82?bn!o8OddUOz}dO4)HKhO>L-ztQ9jy<~Pd~q9{tI&Z7>;y&vxOVmH
zH`{C277O?lI=n&C1Z4}R`{TP33q4BdR^s0;D=)YG<|g<*rUM(8rCPf0Kh=obEUg~u
z>vobI8VESq@dF+mI3&NJ%b!?NQ?rJB9#p3im7bnHwsmy25)TjDoHTQtZw@#;?B-Oh
z2r`QmPp4T^3OT9HR>qyJa9*EvZ_LlSqUJd;)v6cOP|xM}0=O~ND`Sp&yz=;<F4#jZ
z4>vM>{@^tYe%T2(hr<`j?)}j8s#6)xJ|8a*USbLkMGmQ4IH^oy=TeiAy-PHM%k7*v
ziMM#6`kexDzVT)~)s~}AGV<SlO#vZ-&U+VK)6x=*!)_4!V*BA)@iPvA3oSuRFMOBw
z<{QNucd9&wl}{U6wj22q+ph^{Ip)8|1FvIUm^;1N%oh(nj6U6+Jw;EooP^Q_F6PGk
zhpTLFw0+$|aKKE^nlPLKXwe+N`gW>mUDm|hjr8r+#VKH8As0S@-9F}C6HoSo_FWFG
zpA!(=sCfuge;jbSzd*Z)b}T1-1I*RD-$rJ6!2EXY2K%n={P$rD@ZD$Dx$b*uskz_U
zCxSnh>-Su}RD5>$mJgWv19z-Bi4QUtu$kVchVlO6xojSSs*M8;0vjg)KFDokcuY=B
z>B}u4wmc~p^>M5E1WvLX)=jG)bxw9>JO*W_0&$pZvNw~@Y@Nq0<_H_iI6Ko_8Yrxj
zKh?Dye|HVqHbZR$v}}-y`?dm{=I-sOVv|vqYbcB&%Hv<J06ZAGhM!0e`z|yZP0Vrd
zmU#tW;V4lRn|O-4zREs82sAC-be(SW*<VYB(=0x6^&j(YN@XwAR2{xJ-48j+=L8gF
zZ^r4QA9dMJP^*xwcuw#3Q&cEB=wt?Zv_u;sw~rgwzXF3S0Oljz2XZfWq_(p%W;ax?
zvCyM1rY5egGu$Z(_3BwIYsg_VyvcE@3^3HtRQSJ-$#kRJ@auEuU{s``&vyQqv?@kA
zIzD*i_JS{<xojGO`tFN|YvZ}u8^8=*Z^q*UL78q{EZJ8(wy9WH@G1<s`B6s<+jXy{
zbpUTNNINgD3EcRf=78p*xBKfGsj^88zJGSGbG^yPcG@;`Ki??}pS5|9A^Aw8OVeSO
zru@1=uy?AL{?IO90{T$EWL{p$Y*4puo~18bzUDy#th3l=0FSg?-3SCox;&{v1(_`z
zERD^d3#x2A)aS_y)DrCT3>=MqAtUGe4Iq{~Ys1W?ehn}~o;*AruPvJA9M+TviS7sQ
zd1OQK67>|ew8Z^Ky{0UZ$yEP+h^HHca2z6?{q8B6kSPyO!9%WWk}XaE^HSX3o2iaO
z0&_-&SIYbik4QKVjVieZJN9@AK0L7R+pVZUj>k+gxNxn)f3xCTrV=ui{-<Lg<is}Q
zK6Kc(OFG5R^U`lPfFsu4ukT=Q5_X7S&?D#GnXN02nFC<OVoG^aowfmRSUVp85cm#&
z0P13XUuCNx@#)j2FRuQYB)2lJyprP1LtQkYtk)Iyey-$2ivhg9N1ZK48*2j!qI`Xc
zdA|wpxqBB?o>>&0wPDh<d<*KiSHCf|0bn$4ZbRi>h(&+RgXsU}BO7;A%rNSy0Qe7M
zkBr?k$Fi5}I^xYo=`CC7xbyPsa{>Uz_WJOq0;sn-t{}_3Pw3mXZ`~XLJ9x<w$1nvQ
ze}nVoxne)N%CqgCRcsmPc}<Ge&1pbs1E$;i9xR;V{nR6<iG|mvprP+w$<F`@XJZF!
z-A`vFyV;DNOW<jc##93u#a5&U(4k{JN2Yq#8hF_&kez{AweTF(!r7eXY+(1Var+oQ
zML;BaN{1az7cQu)6TA~4Q_faApm#e{Kbt5IJ_fW={$$$PXBX`SFwR(hRS~Hi^J5f9
z^wqNZ*vuz-G*(s~VgMJka5=cpR8{2;fOAqw&(jqxVBVEMS3nf7=-mvoRnU~5cxD0*
z@~WJAR<C~0gc-W6wDEMMzZ8(GDsDyf#Six35F94eZ~srTc;FJ1K0wpN#Dw&)66Q2`
z|MYb=i!>Ynk9gk>NYU8VR&jRlj7{=dE8kRZU{-m{`Cs5d4~0y;JjDSQtYf^c{vS6(
zC(XI%&yJ6`>S@wxLM{;aPv((8as0nxFmI^I_5735oXXMfDSu*P43oQPvpOnmnQxQW
z9W8DJMu%TihTE=?#mA2IF_M)#aV#%>CM$P|;b5Dbgwed1U0$pdpfF=sy8CDTHd%a}
z{$$s1*SvyngMvE_M$4g0|I2en{AWXFx!E%oELSWIktzFy=Xa+=L-XDH_`5Y#g5NN!
z`rd@BI5J<?d7skg0iWEW!&e?O*qWd^TQMKPO}cN?vBEQBIh(5FrCO@iS|Q<yv4`Qs
z)?_|rY;&<!nk?+pW=h2Ofo(q57sM|Va5K|O?y$}O&w(Sb`2D}500hj>)FN=L*wo8J
f#s5QKe11*f0WBp&>faG20RA3o=|RghEW`d6*$I~N

literal 0
HcmV?d00001

diff --git a/demo/documented/hyperelasticity/python/demo_hyperelasticity.py b/demo/documented/hyperelasticity/python/demo_hyperelasticity.py
new file mode 100644
index 0000000..351b7a9
--- /dev/null
+++ b/demo/documented/hyperelasticity/python/demo_hyperelasticity.py
@@ -0,0 +1,99 @@
+""" This demo program solves a hyperelastic problem. It is implemented
+in Python by Johan Hake following the C++ demo by Harish Narayanan"""
+
+# Copyright (C) 2008-2010 Johan Hake and Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Harish Narayanan 2009
+# Modified by Anders Logg 2011
+#
+# First added:  2009-10-11
+# Last changed: 2012-11-12
+
+# Begin demo
+
+from dolfin import *
+
+# Optimization options for the form compiler
+parameters["form_compiler"]["cpp_optimize"] = True
+ffc_options = {"optimize": True, \
+               "eliminate_zeros": True, \
+               "precompute_basis_const": True, \
+               "precompute_ip_const": True}
+
+# Create mesh and define function space
+mesh = UnitCubeMesh(24, 16, 16)
+V = VectorFunctionSpace(mesh, "Lagrange", 1)
+
+# Mark boundary subdomians
+left =  CompiledSubDomain("near(x[0], side) && on_boundary", side = 0.0)
+right = CompiledSubDomain("near(x[0], side) && on_boundary", side = 1.0)
+
+# Define Dirichlet boundary (x = 0 or x = 1)
+c = Expression(("0.0", "0.0", "0.0"))
+r = Expression(("scale*0.0",
+                "scale*(y0 + (x[1] - y0)*cos(theta) - (x[2] - z0)*sin(theta) - x[1])",
+                "scale*(z0 + (x[1] - y0)*sin(theta) + (x[2] - z0)*cos(theta) - x[2])"),
+                scale = 0.5, y0 = 0.5, z0 = 0.5, theta = pi/3)
+
+bcl = DirichletBC(V, c, left)
+bcr = DirichletBC(V, r, right)
+bcs = [bcl, bcr]
+
+# Define functions
+du = TrialFunction(V)            # Incremental displacement
+v  = TestFunction(V)             # Test function
+u  = Function(V)                 # Displacement from previous iteration
+B  = Constant((0.0, -0.5, 0.0))  # Body force per unit volume
+T  = Constant((0.1,  0.0, 0.0))  # Traction force on the boundary
+
+# Kinematics
+d = u.geometric_dimension()
+I = Identity(d)             # Identity tensor
+F = I + grad(u)             # Deformation gradient
+C = F.T*F                   # Right Cauchy-Green tensor
+
+# Invariants of deformation tensors
+Ic = tr(C)
+J  = det(F)
+
+# Elasticity parameters
+E, nu = 10.0, 0.3
+mu, lmbda = Constant(E/(2*(1 + nu))), Constant(E*nu/((1 + nu)*(1 - 2*nu)))
+
+# Stored strain energy density (compressible neo-Hookean model)
+psi = (mu/2)*(Ic - 3) - mu*ln(J) + (lmbda/2)*(ln(J))**2
+
+# Total potential energy
+Pi = psi*dx - dot(B, u)*dx - dot(T, u)*ds
+
+# Compute first variation of Pi (directional derivative about u in the direction of v)
+F = derivative(Pi, u, v)
+
+# Compute Jacobian of F
+J = derivative(F, u, du)
+
+# Solve variational problem
+solve(F == 0, u, bcs, J=J,
+      form_compiler_parameters=ffc_options)
+
+# Save solution in VTK format
+file = File("displacement.pvd");
+file << u;
+
+# Plot and hold solution
+plot(u, mode = "displacement", interactive = True)
diff --git a/demo/documented/hyperelasticity/python/documentation.rst b/demo/documented/hyperelasticity/python/documentation.rst
new file mode 100644
index 0000000..0028e9b
--- /dev/null
+++ b/demo/documented/hyperelasticity/python/documentation.rst
@@ -0,0 +1,218 @@
+.. Documentation for the hyperelasticity demo from DOLFIN.
+
+.. _demo_pde_hyperelasticity_python_documentation:
+
+Hyperelasticity
+===============
+
+This demo is implemented in a single Python file,
+:download:`demo_hyperelasticity.py`, which contains both the
+variational forms and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This demo is implemented in the :download:`demo_hyperelasticity.py`
+file.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+The behavior of the form compiler FFC can be adjusted by prescribing
+various parameters. Here, we want to use some of the optimization
+features.
+
+.. code-block:: python
+
+    # Optimization options for the form compiler
+    parameters["form_compiler"]["cpp_optimize"] = True
+    ffc_options = {"optimize": True, \
+                   "eliminate_zeros": True, \
+                   "precompute_basis_const": True, \
+                   "precompute_ip_const": True}
+
+The first line tells the form compiler to use C++ compiler optimizations when
+compiling the generated code. The remainder is a dictionary of options which
+will be passed to the form compiler. It lists the optimizations strategies
+that we wish the form compiler to use when generating code.
+
+.. index:: VectorFunctionSpace
+
+First, we need a tetrahedral mesh of the domain and a function space
+on this mesh. Here, we choose to create a unit cube mesh with 25 ( =
+24 + 1) vertices in one direction and 17 ( = 16 + 1) vertices in the
+other two direction. On this mesh, we define a function space of
+continuous piecewise linear vector polynomials (a Lagrange vector
+element space):
+
+.. code-block:: python
+
+    # Create mesh and define function space
+    mesh = UnitCubeMesh(24, 16, 16)
+    V = VectorFunctionSpace(mesh, "Lagrange", 1)
+
+Note that :py:class:`VectorFunctionSpace
+<dolfin.functions.functionspace.VectorFunctionSpace>` creates a
+function space of vector fields. The dimension of the vector field
+(the number of components) is assumed to be the same as the spatial
+dimension, unless otherwise specified.
+
+.. index:: compiled subdomain
+
+The portions of the boundary on which Dirichlet boundary conditions
+will be applied are now defined:
+
+.. code-block:: python
+
+    # Mark boundary subdomians
+    left =  CompiledSubDomain("near(x[0], side) && on_boundary", side = 0.0)
+    right = CompiledSubDomain("near(x[0], side) && on_boundary", side = 1.0)
+
+The boundary subdomain ``left`` corresponds to the part of the
+boundary on which :math:`x=0` and the boundary subdomain ``right``
+corresponds to the part of the boundary on which :math:`x=1`. Note
+that C++ syntax is used in the :py:func:`CompiledSubDomain`
+<dolfin.compilemodules.subdomains.CompiledSubDomain>` function since
+the function will be automatically compiled into C++ code for
+efficiency. The (built-in) variable ``on_boundary`` is true for points
+on the boundary of a domain, and false otherwise.
+
+.. index:: compiled expression
+
+The Dirichlet boundary values are defined using compiled expressions:
+
+.. code-block:: python
+
+    # Define Dirichlet boundary (x = 0 or x = 1)
+    c = Expression(("0.0", "0.0", "0.0"))
+    r = Expression(("scale*0.0",
+                    "scale*(y0 + (x[1] - y0)*cos(theta) - (x[2] - z0)*sin(theta) - x[1])",
+                    "scale*(z0 + (x[1] - y0)*sin(theta) + (x[2] - z0)*cos(theta) - x[2])"),
+                    scale = 0.5, y0 = 0.5, z0 = 0.5, theta = pi/3)
+
+Note the use of setting named parameters in the :py:class:`Expression
+<dolfin.functions.expression.Expression>` for ``r``.
+
+The boundary subdomains and the boundary condition expressions are
+collected together in two :py:class:`DirichletBC
+<dolfin.fem.bcs.DirichletBC>` objects, one for each part of the
+Dirichlet boundary:
+
+.. code-block:: python
+
+    bcl = DirichletBC(V, c, left)
+    bcr = DirichletBC(V, r, right)
+    bcs = [bcl, bcr]
+
+The Dirichlet (essential) boundary conditions are constraints on the
+function space :math:`V`. The function space is therefore required as
+an argument to :py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>`.
+
+.. index:: TestFunction, TrialFunction, Constant
+
+Trial and test functions, and the most recent approximate displacement
+``u`` are defined on the finite element space ``V``, and two objects
+of type :py:class:`Constant <dolfin.functions.constant.Constant>` are
+declared for the body force (``B``) and traction (``T``) terms:
+
+.. code-block:: python
+
+    # Define functions
+    du = TrialFunction(V)            # Incremental displacement
+    v  = TestFunction(V)             # Test function
+    u  = Function(V)                 # Displacement from previous iteration
+    B  = Constant((0.0, -0.5, 0.0))  # Body force per unit volume
+    T  = Constant((0.1,  0.0, 0.0))  # Traction force on the boundary
+
+In place of :py:class:`Constant <dolfin.functions.constant.Constant>`,
+it is also possible to use ``as_vector``, e.g.  ``B = as_vector( [0.0,
+-0.5, 0.0] )``. The advantage of Constant is that its values can be
+changed without requiring re-generation and re-compilation of C++
+code. On the other hand, using ``as_vector`` can eliminate some
+function calls during assembly.
+
+With the functions defined, the kinematic quantities involved in the model
+are defined using UFL syntax:
+
+.. code-block:: python
+
+    # Kinematics
+    d = u.geometric_dimension()
+    I = Identity(d)             # Identity tensor
+    F = I + grad(u)             # Deformation gradient
+    C = F.T*F                   # Right Cauchy-Green tensor
+
+    # Invariants of deformation tensors
+    Ic = tr(C)
+    J  = det(F)
+
+Next, the material parameters are set and the strain energy density
+and the total potential energy are defined, again using UFL syntax:
+
+.. code-block:: python
+
+    # Elasticity parameters
+    E, nu = 10.0, 0.3
+    mu, lmbda = Constant(E/(2*(1 + nu))), Constant(E*nu/((1 + nu)*(1 - 2*nu)))
+
+    # Stored strain energy density (compressible neo-Hookean model)
+    psi = (mu/2)*(Ic - 3) - mu*ln(J) + (lmbda/2)*(ln(J))**2
+
+    # Total potential energy
+    Pi = psi*dx - dot(B, u)*dx - dot(T, u)*ds
+
+Just as for the body force and traction vectors, :py:class:`Constant
+<dolfin.functions.constant.Constant>` has been used for the model
+parameters ``mu`` and ``lmbda`` to avoid re-generation of C++ code
+when changing model parameters. Note that ``lambda`` is a reserved
+keyword in Python, hence the misspelling ``lmbda``.
+
+.. index:: directional derivative; derivative, taking variations; derivative, automatic differentiation; derivative
+
+Directional derivatives are now computed of :math:`\Pi` and :math:`L`
+(see :eq:`first_variation` and :eq:`second_variation`):
+
+.. code-block:: python
+
+    # Compute first variation of Pi (directional derivative about u in the direction of v)
+    F = derivative(Pi, u, v)
+
+    # Compute Jacobian of F
+    J = derivative(F, u, du)
+
+The complete variational problem can now be solved by a single call to
+:py:func:`solve <dolfin.fem.solving.solve>`:
+
+.. code-block:: python
+
+    # Solve variational problem
+    solve(F == 0, u, bcs, J=J,
+          form_compiler_parameters=ffc_options)
+
+The dictionary of form compiler options, which were defined initially,
+is supplied using ``form_compiler_parameters = ffc_options``.
+
+Finally, the solution ``u`` is saved to a file named
+``displacement.pvd`` in VTK format, and the deformed mesh is plotted
+to the screen:
+
+.. code-block:: python
+
+    # Save solution in VTK format
+    file = File("displacement.pvd");
+    file << u;
+
+    # Plot and hold solution
+    plot(u, mode = "displacement", interactive = True)
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_hyperelasticity.py
+   :start-after: # Begin demo
diff --git a/demo/documented/mesh-generation/common.txt b/demo/documented/mesh-generation/common.txt
new file mode 100644
index 0000000..f0b0fdd
--- /dev/null
+++ b/demo/documented/mesh-generation/common.txt
@@ -0,0 +1,14 @@
+This demo illustrates how to:
+
+* Generate a 2D mesh of a polygon
+* Generate a 3D mesh of a polyhedral using .off files
+
+
+Problem definition
+------------------
+
+This demo focuses purely on generating meshes. In this demo we will
+use the following classes in DOLFIN:
+
+* :py:class:`PolygonalMeshGenerator <dolfin.cpp.mesh.PolygonalMeshGenerator>`
+* :py:class:`PolyhedralMeshGenerator <dolfin.cpp.mesh.PolyhedralMeshGenerator>`
diff --git a/demo/documented/mesh-generation/cpp/README b/demo/documented/mesh-generation/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/documented/mesh-generation/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/documented/mesh-generation/cpp/documentation.rst b/demo/documented/mesh-generation/cpp/documentation.rst
new file mode 100644
index 0000000..62bdec9
--- /dev/null
+++ b/demo/documented/mesh-generation/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the mesh generation demo from DOLFIN.
+
+.. _demo_pde_mesh-generation_python_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/mesh-generation/cube.off b/demo/documented/mesh-generation/cube.off
new file mode 100644
index 0000000..7a4cb16
--- /dev/null
+++ b/demo/documented/mesh-generation/cube.off
@@ -0,0 +1,16 @@
+OFF
+8 6 0
+-0.500000 -0.500000 0.500000
+0.500000 -0.500000 0.500000
+-0.500000 0.500000 0.500000
+0.500000 0.500000 0.500000
+-0.500000 0.500000 -0.500000
+0.500000 0.500000 -0.500000
+-0.500000 -0.500000 -0.500000
+0.500000 -0.500000 -0.500000
+4 0 1 3 2
+4 2 3 5 4
+4 4 5 7 6
+4 6 7 1 0
+4 1 7 5 3
+4 6 0 2 4
diff --git a/demo/documented/mesh-generation/python/demo_mesh_generation.py b/demo/documented/mesh-generation/python/demo_mesh_generation.py
new file mode 100644
index 0000000..cceef11
--- /dev/null
+++ b/demo/documented/mesh-generation/python/demo_mesh_generation.py
@@ -0,0 +1,57 @@
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-02-02
+# Last changed:
+#
+# This program generates a mesh for a polygonal domain that is
+# represented by a list of its vertices.
+# Modified 02-08-2013 Solveig Masvie
+# Begin demo
+
+
+from dolfin import *
+
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+# Create empty Mesh
+mesh = Mesh()
+
+# Create list of polygonal domain vertices
+domain_vertices = [Point(0.0, 0.0),
+                   Point(10.0, 0.0),
+                   Point(10.0, 2.0),
+                   Point(8.0, 2.0),
+                   Point(7.5, 1.0),
+                   Point(2.5, 1.0),
+                   Point(2.0, 4.0),
+                   Point(0.0, 4.0),
+                   Point(0.0, 0.0)]
+
+# Generate mesh and plot
+PolygonalMeshGenerator.generate(mesh, domain_vertices, 0.25);
+plot(mesh, interactive=True)
+
+# Generate 3D mesh from OFF file input (tetrahedron)
+PolyhedralMeshGenerator.generate(mesh, "../tetrahedron.off", 0.05)
+plot(mesh, interactive=True)
+
+# Generate 3D mesh from OFF file input (cube)
+PolyhedralMeshGenerator.generate(mesh, "../cube.off", 0.05)
+plot(mesh, interactive=True)
diff --git a/demo/documented/mesh-generation/python/documentation.rst b/demo/documented/mesh-generation/python/documentation.rst
new file mode 100644
index 0000000..94c0db2
--- /dev/null
+++ b/demo/documented/mesh-generation/python/documentation.rst
@@ -0,0 +1,141 @@
+.. Documentation for the mesh generation demo from DOLFIN.
+
+.. _demo_pde_mesh-generation_python_documentation:
+
+Generate mesh
+=============
+
+This demo is implemented in a single Python file,
+:download:`demo_mesh_generaton.py`, and the 3D geometries are
+described in two ``.off`` file (Object File Format), ``tetrahedron.off`` and
+``cube.off``.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+:py:class:`PolygonalMeshGenerator <dolfin.cpp.mesh.PolygonalMeshGenerator>` and
+:py:class:`PolyhedralMeshGenerator <dolfin.cpp.mesh.PolyhedralMeshGenerator>` need CGAL to generate
+    the meshes, so we check that DOLFIN is compiled with CGAL.
+
+.. code-block:: python
+
+	if not has_cgal():
+	    print "DOLFIN must be compiled with CGAL to run this demo."
+	    exit(0)
+
+We create an empty mesh using :py:class:`Mesh
+<dolfin.cpp.mesh.Mesh>`. We need this mesh as an argument to
+:py:class:`PolygonalMeshGenerator
+<dolfin.cpp.mesh.PolygonalMeshGenerator>` and
+:py:class:`PolyhedralMeshGenerator
+<dolfin.cpp.mesh.PolyhedralMeshGenerator>`.
+
+.. code-block:: python
+
+	# Create empty Mesh
+	mesh = Mesh()
+
+We are now ready to make the geometries. We start with a polygon and
+define it by making a list of its vertices. We need a closed contour,
+so the first and the last element in the list is the same point. We
+represent the points with instances of :py:class:`Point
+<dolfin.cpp.mesh.Point>`. :py:class:`Point <dolfin.cpp.mesh.Point>`
+takes :math:`(x,y,z)` as arguments, but since they all have default
+value 0, and we have a 2D-geometry, we can omit :math:`z`.
+
+.. code-block:: python
+
+	# Create list of polygonal domain vertices
+	domain_vertices = [Point(0.0, 0.0),
+		           Point(10.0, 0.0),
+		           Point(10.0, 2.0),
+		           Point(8.0, 2.0),
+		           Point(7.5, 1.0),
+		           Point(2.5, 1.0),
+		           Point(2.0, 4.0),
+		           Point(0.0, 4.0),
+		           Point(0.0, 0.0)]
+
+We send our list of points to :py:class:`PolygonalMeshGenerator
+<dolfin.cpp.mesh.PolygonalMeshGenerator>` along with the empty mesh
+and the cell size. The cell size decides the resolution of the
+mesh. We set interactive to True so that we are able to rotate, resize
+and translate the mesh.
+
+.. code-block:: python
+
+	# Generate mesh and plot
+	PolygonalMeshGenerator.generate(mesh, domain_vertices, 0.25);
+	plot(mesh, interactive=True)
+
+.. image:: plot_polygonmesh.png
+	:scale: 75 %
+
+
+The geometry for the next two meshes are described by .off-files. It
+is easy to make off-files, so we will go through the four parts of the
+files:
+
+* The first line is just OFF
+* The second line consist of three numbers: the first one is the
+  number of vertices, the second is the number of faces and the third
+  is the number of edges. The number of edges will not be used so we
+  set it to 0.
+* On line three we start listing the vertices, one vertex is described
+  by its coordinates (three numbers) on each line.
+* The last part of the file describes the faces (facets, sides) of the
+  geometry. One face is described on one line where the first number
+  says how many vertices we need to represent the face (in a cube we
+  need four, but in a tetrahedron we need three). We then list the
+  vertices describing the face. We use the vertices defined above and
+  start our "indexing" at 0.
+
+::
+
+	OFF
+	Number_of_vertices(n) Number_of_faces(q) Number_of_edges
+	x1 y1 z1
+	x2 y2 z2
+	...
+	...
+	xn yn zn
+	number_of_vertices_on_face_1(m) vertex_1 vertex_2 vertex_3 ... vertex_m
+	number_of_vertices_on_face_2(k) vertex_1 vertex_2 vertex_3 ... vertex_k
+	number_of_vertices_on_face_3(l) vertex_1 vertex_2 vertex_3 ... vertex_l
+	...
+	...
+	number_of_vertices_on_face_q(i) vertex_1 vertex_2 vertex_3 ... vertex_i
+
+We send the empty mesh, the off-file and the resolution (cell size) to
+:py:class:`PolyhedralMeshGenerator
+<dolfin.cpp.mesh.PolyhedralMeshGenerator>`
+
+.. code-block:: python
+
+	# Generate 3D mesh from OFF file input (tetrahedron)
+	PolyhedralMeshGenerator.generate(mesh, "../tetrahedron.off", 0.05)
+	plot(mesh, interactive=True)
+
+	# Generate 3D mesh from OFF file input (cube)
+	PolyhedralMeshGenerator.generate(mesh, "../cube.off", 0.05)
+	plot(mesh, interactive=True)
+
+.. image:: plot_tetrahedronmesh.png
+	:scale: 75 %
+
+.. image:: plot_cubemesh.png
+	:scale: 75 %
+
+Complete code
+-------------
+
+.. literalinclude:: demo_mesh_generation.py
+   :start-after: # Begin demo
diff --git a/demo/documented/mesh-generation/python/plot_cubemesh.png b/demo/documented/mesh-generation/python/plot_cubemesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..6d20103bce4248814e1e2acbe30ec32d9af135e1
GIT binary patch
literal 39015
zcmeFYV|S*{6D^!f?1^pLwv&l%+qNdQZO+8D?K`$}Pi$LHe*b5kuW(+ScNco~>aMQZ
zwR=~0q@uhe0xS+J2nYy*w3L`K2*?jj5D?G==pWx-J~Sd{KtPB<q{W0)J#)_W_?`Fp
zW<s`Kr%U=yMtY)E^7~FU4<d7UX8+tn-~`1&3ORLs>L7Krw2a_Hk&q)~TY~I2Ty>(s
zhKdwA);{lea26<1eZO6aAsZEbKV9O8hkXB1Y_mZ_#`taotWgrv{I5Z$#Q$sXf87pW
zPg@97X#VtR2U7%|{eq7ly|uQog^FW!=Wm}|c2sDec65__qw1P?T2#K|QP6Oq)O3@@
zV~xD;C}{kHJzr1ym+y^N3RgV!ic}?3By?yzSsCT`VSp!s={J@XWG$*L+yhd&O;SAI
zc)!=%r=zdi^#qi4UVssVe4*MWR9rWK<U|A=+6Yy2-L(y~C?BD`=haBhS1Vn5aFakg
ze=c1#DI5ef3ElfyU1Fv|mA=5$o9G?>w)ctP+voinxbF0rh!NzsKLvmpm^I<2{Dptg
z6UutOBR41EETFD*RV+Cl8>kgUHUdHcMMqu(*I^9&c$Yp9-wS)cJN_d1o{#}Tx;euR
zK|(ok`s6LeZNt?UKA}K`bHzpR4~r_D8|UO@SeKw+K-b48CQf>0yKdn%>$kr?)A<qs
zKXMY%6b39@f0keJ4ylPzHR&tiX+67tyY(lm0bff6J-dUdoVL&CjbA{*cDYALpD)Pl
zd(g;eZs>pkvfrIj1{?GDC=7y01_roEHsn7?x}rzU0!FM>%2bPZuXFIeFz3J|nQbkO
zeY@oZ9{5`6;yoR&1<)ih1b%)`IWB)h)Xp>4d8P2c0)baWO(ye8wZ>ZjXLkLLYYO$W
z2Cf0~w)9R??D4~j0s&bL(EIcrTex2J$}*#0CrDBoa3w?^N4FV8GSE4=GFqX@e!KS|
zQT?UoeX=(iHuBE0-|D*m_?B=+Kxkij+GHf25DG6I(u-<fyut4?c*aWebv`_P2wHR;
zIAeGp9f2oN*k%hJK<ICXHP`g<G&}~)(l!(7BZ>^{jnx5kUiRRG8!EbvTX}VfNyRcC
z9+*R_K`M{W<xMJ=5Pa$LG8$8}o+HLo_nNkuJYHkEFO`ZEYwoFw+lv&V2N>Q;qna>Y
z$HJ)4Y=T8We}TT&Wj;WWkTTsZNxBhkg{ayM@!&lM5inMjvfo}b2K&)fM&kEdNHH9u
zTpJJs2o$Q^Ir7JyOkjc)UqfYuQCc?ER0D?Igpq*?{ar3HA4b8bP=y}T>Qa)|`Nh&4
z&l$2?6p@JjQN$6gm-j7%8Et{ve6PWYj4r9~mYUjr2KpwgNe+DVt;9TM@ngSoR{W9E
zNe2GwPJ=YQ3yEcWJwI9SjSH-wCfP|f0-=J>ZSv3hU(W2295Ku&7S!!Q>tle6ghj=U
zad1Gv)s%^0viR)5tp3GO71<kg!2VW24C0?vCSZ7Mmsxv6m6(rsh(`p;fCA_{q5(>!
zxGNYRH?HxgImtU~AI}l5tz5~Sx|%}5=-zEV=PCBl&)~FVZqE){i1B!?0$$XL{M*>8
z-{?xzJ738h3AgPr{=F4P$3qD6T@h8YaK526VpJdYy}*3J_4I)mab)1mKhc4oIUi1q
z*lc5<*Yz~O4w}($Um_C$%Y#@@4>*fA^Ly;UPPP%Jk8Ryg3+3ltEDNL?MpQ~JT0!Xs
zK0Q#ioiv1|1GSn?+69!VEWr-yJLzvsFO0Z$nDf_zhQ~I{bW(O1G&Z1H_~2V9C`xA5
znjc^F+wdI-pOi=yj2AzQ?<0)W^vW;2#w7>$Iq59{c#edHP>x_B#GxV+;7L1E@gOFU
zMnhjg{fAr62tvr_JNaqi_X<wIbNj0y!;sEJ@m}LmQ}L0lF?oeFZo8@|F~P1>IM9t0
zX$Q!c7qZy~R7`4k9<Oibg->5?v6Ie=+^2@hOC<=e9dxzcTYId1RivoPk6!N{uOw>@
zM_Np2oO-%9<TU05A?bdhgg*~(x-8I;{jqF8UfJJqM$URu6%@j|_OusBNflZxx(wX$
zys){rpqfvdNLZifJuWO;2=}_Q;ShXaYDt6~{;ev#)?v+?YL_~+L*za~9q@uaWh1<j
zKW+3Uetf|P4?Pm+EBywDf9a-;z7Vat+b1Xn67X80OldG&hytt~|EY}Vm$=U#q#bnK
z4&)Y;%=JR>pqJDesu=Q6x6G`Z8zN_Fd4H)xxEUJ0+~&tyXs@z%d6P+n**^7f>=+{F
z<@MY@tj6I;+=0~JmOm^y-{#xNc0fig5F{MU=YZqt1vO33X7x-0`L`cPm>xE-hPh4)
zc5&M8OJK4cT=|lOLL+`o3H*_^P1U?)+=TfKMT~vD(lvhMLbiP4w-3S$Ja2pG%V)=d
zyUJ*-%7cZ4@o)qm3o>gX$kt8Gzx+|6$jIqU9tRxnu}yoG5^b8%+!P{)D$X0V?i>pN
zzf)|K5C=NNrHcu{vh+wEKa8|mj@v$4;;Xh7#-dThr&}l+JEkR@m_V9y%S_+Tee<7J
zSh?t&`X<B{pAO`*23V=7fWI7!?2tW4{tY;p9abU*wSEQ3f?2{(&*(qw0?6pBzw%|b
z$&$}J@9fwpa&OsM`m(~tw}tmbs==eGXJa@6U=-Yzov`j}uA`MOfKVWZ8GJs?%$w<B
zLM7wp=Siymd7ldVzk87cf+)yV=)%e1sgsWN$*qWk|Lkt>kd`?%g{@f#Dgv|?C)dPA
zY`w#gtGmgl^Q%E71}a;-2guKgT*Rj&pB)Xia=~$^D}yS>E#-&%BIw?|Q^cQ*EPJ~@
zU2g4t4gRM3YQ_v@Ri|!tOZxk|N}6*-USMpOkIK|KTX(Ge8QZ4N8q$zi3sJP=jB^rk
z#K|L_BFUtNVQOj9_L1rNJxv`xHJeRqVk^*F1;~j{SeOT1;@2*_oFzt7UEa9i+DP!h
zM<e{;r3BryN`kPMPFn87Xeo|~m_L?Q3pEHM89?ekeE<3WwvvxAG#v}#57(r`p@}Cm
z?OIKTI-O!A`Yz?s%??&F{1IOys!)rf=TX6IABx%7g_r2PoUu^0!YzW&cx0Yt={5Sg
zIAjz%&h>XBJzT$Py1w-yQm{6+j6xM;Oh@o@znw^$)TDi09}^-qL(JlMjh;=Vr%wbK
z2qmoL7`DIJj@Jii@&wsyhbl)@-+2Hj3Pq2Ljrj4IBHUccE>y{ey{9B$OMmP-v@i&r
zdpx$gq4|i1+c~&gMC_ld|NLjHB%A$tH!qA6h<-<Yo2@Xce*(tAt}T8*Jn5J~@QzM!
zWzkQ|FO|7UN37=;*bc#MT=l4}53w;aTICpIR%JJ9aJjQy9vXlt9zqEAr4sM2YQv>s
zFCs^1VD2A_CQLc4vmBLM=8{n4pJyjg8lo|d&>)H3u$Z83fZ~#HvN;H~w|ZIfw@yLU
zwlt<S0=CK0CW@IDRKv(lSUYHH<gC(9Vht^d)aX9GwL9(LLNxqSZOi#Z!<^!%9ZIuN
zC8ZUZa8dT5rCs>2R>|1NatufEJq~c~`V*$D8W&{;qN0P9U-mznS~}M5(GzDw?zEzC
z`NUKw;(LsY>ZD=r?+qDZor{2h*+F6v*-#hlOa2de!(o_$=s#Igy|9xHbfFALC-``x
zA$M>w1U^0Bh~AG3M9PTGg9gQLe{ah&zk64sP6@{#2LGURUoHQd!Mx@u`;4R&X_`^E
zi=}>7{|^CK(qKhR;`Y3D0f$p!5N$}@c1i(9hCKKC|DcWR|9K4<H@usBMtxzlZb3(Q
zQ5Z@h$xpPCpx}g74=lV0ciB?A!zMvdVdT%`{@w36E+b<U?X)cIFjD_bplYE*75JAq
znI3ULGW~wfM6n{6^Smm)Pcfxwg@W~MQ%yZr_m!X@w@n@8Beyu>niM(9>7ueS@L2u$
zFDfThuP{n#=FBfZt$C!;ms+FlO}3rZ`}4GQVY<+T;w8V)p7^x>&`ISl@wJJS<mIC_
zfLNBH?a$v<sdg_V|Loig2R&Asov1KETEBU&p6mTu1EPeyzMkck@{2J8U}@OxXXSi{
zyYa6U;|u}U&DPklhpUWo#y&YN3eeGJwoc?b#IJuvp#do0>jiHt{8apJKPnP771;!i
zh5G=9$ll8d)yuKnz|$HpjE8A1;m(=fDZ~iPQb=CFR6>m6VLQew9w%WOQf|r|2E`NA
z2XsZQYf0EM8pn%`4a`M1cWCOqFvhvxVSz!;L<q$s2u~#%>2si90Tgp!GY&&(;nV)q
zjO!xT%~X}+W9vKZg8kG+p;Dutgn(?GOgd(oZVWOgSLS)xpqRjucOEn&i2o%qV3LLp
zR6ZLSuo4u{KCK>a@1_V^Zz2z8_K41&<$VeIqk`Fr*xZZzcwYw^;QK1KuPq_^^KLeO
zkp#`NmMLNWrDBDn*}E6CBohT$tvG-|$`krRV^%Q#_u=T&#yW0M_rjAFW^?A$L8^HM
z2Ie+y6to}~)=`mU$k8x=#AOu+D}$#JTeRGYx#^yivs)DXVgxRMzJoOSjED@IMX;!T
z__Ar2*Ois>=tU-hKB2lrcHv_cHj3tWy#FW+=oiE5_;njYNzfW12P&x}I7$ROljZO>
z|9&I_`{05#RC=5x<H5k8*iRqUIU9m!2=GhduCF6R@s;11L7@hrBm?o_@U&P_f7J`j
zwfJ|@^k2IKuIVT+qa?eZc%m9$tz_`6d_Z2#MmBz}3QhcuRkd|B&lw;6{Y=zNO!?yL
z-mE}zwLpbiwXBn@Wc-iyMW7x*z<UA5k(Nd49_PLwAY_I=L08^2QMZ^(@XdMqT>_!I
z+RARW-wp}hK-cd?J4QZUcaJR<&rNJ<w(%3)|9{3=yXyTw+ba|nyRO`fSx^g`$qoIP
z-Pm$l83qtamJsy8YGIqD&?NNThMt6Wm>;^w<7@nk7IfMc3US-|oXnFEjSsWa5GIX}
z<zRYS9HeYpo#1jeQC<RPfQdUJSJb}8#94%gfyv(I<K%#4t^_toR+GWi?NQ;fVEY+p
z`>;)PBvD;Lf4eW_euj!rL>6{rj?MLt((C)j=Q(pk@kJ#gwsV+h!ys^dRM>!F;R(Cy
zqo*aAM&uEv?2F*FL8SQEP}}sWB<CIkX+@i#aHrjolA9E&e-fWo1f8f#HNQY-g=`UI
zV!7|f#Z#@Y_7|Sj?&Eb-1hjWd<_Hu3ns%Ez&}Rc-KD{t|Jw*72t?Ob%%9F)!2Jas6
zR3z_I*UrUrXrAKkO2#(BLBqE<m}dx*C<W(jvV%Fq+=RiuO0XX5Qg?2TvD|2B*qv7`
zNb>bD$%<*W|3&hBJ<4vx3@e}K9`&jR*PBp`sw{pq4P0-|<|uEN>9_K^En4};x+WQt
zz?^wO8J;q6^!~tbWnq*T>-r&k^$2#8zj~z8Ci)G1L>v*YkroAPHjk>N#eHw>JnYk9
zAh2m*;4&LTRplPBjC~X@AmBT~Sk-Z2pO=O<!hSb3XB?&!y5xMTON=+yR`AhBTX)q^
z=?8W{A6X!=gOVJxA&pm`XGlxwTkdvs(UHv8MP2CZ#!bW9Xd-}oPfej0m~Xdl8*o{s
zcrU5%Yaf^MTcE9l@crNEGQ2<A8^!AlGVLE=B3$gx^$Sj+fO^^W>CeJO5^~zY)BDV_
zxhL9Ith|k53iq9uV)F9fYd!z|bO32a&TW?t+zbb!Y^3zUg<eJ&GsX={CKN5+<;~D+
zsf-cPKFwrSR;W!!rNR1{kv`U$;wIC0|E+z(=W(k$&T~a~l+PpBNjsinWM5gR`qFan
zcQ_%1!fp5{T5KyBS`}U|2!mQh1oq8vv0+fsJV_{HqzBpzz<}=#O&(j?*>@Ei@k~!y
z=4*+$J*bSlN|VW~8o-)k$3$);V=YVE#1{JUdn%VsDFTfYDO_I<KccujeWUI>p9&n@
zOvJh`>+w*g5aXYAs_I;R(j2gR+i;!y&9{NP%T`?NJ419(2Bv?f29w{tYG0k9`De@i
zAvi?S`aDL+EK?DVK-NZGF6lwA5U|;Otvvkd*iHm7Rj5tzNAJkv&6HiJ?g(vO?O=Mk
zlZkBZknT<C(@CNP*iSaNDXD@u{l<ISQH_H9)lmt2=_;NHkHz#mgcJqhd4BnEZ#n2A
zS?Ni)+qn(++$GwP_+m$mZ>L2IVTLy93U)o3>QBV=IxmWJOs_U4d3x^$=&rua|E(v4
zmW!=R0!S?Ogy;q_3r{1MOQ`J_0=dP0*_s>@K$ooD04Q{7=DJMM5X7uHsBoB3_(th!
zV9z*3{6yQfE+O3H6;6ACU3om2896Yh*@mwLG7MEUk8DYm?)|X+Ehje2cPrhR&7u*n
zP{l*?A>OhD{pY(%wVwwCAVc{kev3L-_SD|e<;?GG^)qI$Z^Tbpo;RreLFZv5!EYIX
z2fgsM#7FLKqJM#8jbuA@uw|T&%)Gi&6-Hp>?+?w<vUG!}Ev{LG<jP%>iOoCq<XQoi
zCF^=4csLuz7q9y8&dL<|IO_(rtA9Pw&cARdrZ<yq=`$+?Y~Bpi4uAD@g7#ueNRu>N
zDfrBQoka}&`9z2K6#)%hL0XM868g}_wy4mPxi^@?YUMcWk;AT6J&wXV<`9T)W`UEC
z3f{qPTK+X_aFDN8hW+~5h^m9_K&&U`N?0QR1QERpl0#n;<4E8~vc0bEC03xJp<8i#
z=Fl~1WS@s}?8)t+-^)y^Wy-m3H(oy|HK)@zule!dz<MRUd^2z*p%p@i<OU@#K^uXO
zH}@VTJJ`o*ax{<~=VX5pTUpPw2InBXAG^axC<~|x9{!XT`%{T@3U9~Gce5og*Uivk
zLASbI>Yiti&yVH^Hu~b;mx5_?P=Z3Z31rx!?1mPXC%p~-+uMAiGM=ca(sjS9Zg_Ql
z%Ie><@Z-u;8nzeYKmL%*vgg2lk4W)}a;3+LS5AU8vX$t_<5+6-5;-O$m=*t+z+;xR
zV3@EBG0mA^YO3mE(<i;w-UH9`I14iDpJ?Q*P2b#)9aMRQUSGnce!3aCzRqSuRAGu{
zY^^h$Ed{^L`Qh&I5<SRSc-1LgYG`Ap=Ahm8;VU(~<p_#@8h3|-aS2Tx>rcjpw>YiI
z+ZT&zFPo2e@Hk57W7$RNkW<0TfslUST#3$prF%ol#q%DQR+&ewgc$*mTnTRbOMR<)
zfMO|)n9pg4Fbg@y{(ix=-4pBxepiE+Ve!H$i}D5ars_t`@^SAa`xy4GZvPgMOTxbW
zyGL1;Nu~A{=qnQ1A}V)lYI(@O+qX0U_3zr8zmQO-sNK58;E$jNEogW7+CJmHylgRG
z#+RFxtCEdMuq9-6!WKgPl%)k5r=^IKHolOkcbyJy8p#ewK2TetU`Zf<He-+Z0W;$?
zXq|ghn{U6D`omy1VL1K>oi=%#8i~pTki&x1k(p=z)RXG#D~K;`kf~|#@Ho|9?q^;Q
zW>~+=UtBU5AF|?0gio^djspgYQm+aoL16g2QHA7iC*RLOy)1Y``)=SN=&6Faw>|L4
z#0DmhG*4J={yr;Fk06-fl;);u!*$T2;x49-oqX)6iI<&Pv%=<H`}z6YrF@V0D<F$f
zZpuC@XFNkwlx%ND2xV<^l7O=uu5~e>=JgO^b|=oCRlly&k&!C;dQeEkoKOCXurE`f
zqFjCQSNJ)g@c5{Oij)07J>C^rS*%NLIb`z;h1d=<_LfnHY1OdduFM83nRW<Kpeuq`
z62KFzLNGjW<NS)fsK;pVBpHlPDKoYe;5Q_|;98MAb^ge-@g7IpZ_k5E8@fQivGE+O
z-Ph9(hR*4uGY0rmTLf9t89P9~N&n622-^4CIAqSK!bo?s@rN8#YPu$4aadJ_71R&@
z)(~4npPlo8723c$z;OU3{Y)prl<h`R^29|#y=2FO5zRI3yCT%rceM#lnNX4SP{dJT
zZl6q5ehmH%(-8D2;IG{qNh7SCf>Z!*{=Da(ZzcDVeV<-^QGci9x<f|u7yO0ufyNcP
zNLMKby7LPx53cyaN`6_%#w3T~lZCYk%Eka@rhmas!wIimVtZ=vpk#wFndBtG<2?4P
zA2Oi}n_~v9dJP@MaHXh{vAY$^=Z}9s>2czKS{5zm&sDd?)jH|by7LWeCpSJH(NgnU
z?`)1Y>+<r?lbi#(at6D!BLc_<41d9IBfuF(-CQkvL}t1aqlL0!#epLx&l-E?`yUtD
z=VdO(@roB`d&7!q4>T5#`_8s5+r$Kqm^z>BYKt<!pn#1$O^ud@Jm?7G`HX3MG$Ca3
z{0=|It@`J_*od@p1n40-qH^Lx%TcBlVcvZG(Y>-+b!Jz}$jPW<@XY?5XXs3=mkf9B
z1WFx?a0qg;5#P**9uwYd)sx`YRNrVtq2~KKS#2*;o)F<IG-hP`&PBM?5i4@7GMpWk
zRY}0Klly7rb8<K#<t80n)-&e<l88q->N7CkEWg4Mja#~eHkZfW2=&v?SNf5_w_S3{
z7bjSrLT{1%VYOvj<Yo3)f(co}Oy~xeO4get3X`(d1JiLIiKa}zz#z!`2`~yFit4Rs
z+Dw?KF%+hT+0h4Cw))SSZ^xq9?#)|`7`GwXM5_cpUGRLZDm(*tjzb>^w01I%1$2)U
z41)V6XG2u(;tH{G>USYe{boUQ{M97O(dFagYJ1{WA&IVj3g5Hz6ut5kc2mW9Y(yfx
za>06pHhjC}knDC^ltjW3;|4K_oimO?>~O;z2pcA%#ptOtj?al}#EkW-o-$^xPZYq1
z(jutzLN8&3*nQ|8O7wQ55@{8gv6}6Kb`E`2fj{Vz_Dz4wklcjzeX9PoWFqOz%DlAY
zluE&y+I!E}Bd%7=)Eqen5FY!2)S^NQD4Tvt`Mu(1hftXl#rvPCvB#D}#zT%_*SAzJ
zOkSB0X?LuCZ$lnm3|qQhyn|wgG)U5+UxD9Gfe)3)>t}TK0P_qWgh`ckV3a7tIEfr1
z0rts(SCL1Sd_<PH<T(LjGHr596_+ZC3|x*Iwsruu-%yE^!D{CzwxbY(h6`|>J%icO
zD(ARJamVAJKjEn>R(9EJZFi*n_7hL|O~dCw9YeL~NS<2lGvMl5wy-r*++Lh3isB^f
zWiq;_%~D{@$c^llh_THew!2FT-Erq`=7<kZIb)*Q5ayKq;wl;`eH@M>fN3NpZN_|i
zY(J<LAj}9tf$=Wda+83g96XMS6{;}^*O}I3;<S0<KLy6kj8K1T*1mgC*6X-=-1jKQ
z`b25t0whordrqAF3Gy5`cgQH_v(?lfp<i&+v}c1WH}4A>luO~Ujq+G^-|mQ8%U!3a
z5i+O5e$UIJbz73C&VM+Y+PEDnHdo&a%<7*w`h5*)3SXoP*t|gNqHmlu)p71Ha=N&l
zpAh=dN>u{nzHW(d945+9%gL$Pf+6gdhlrRPwMEd-2s*E|S27f)(L7`o5;?a2M_mIm
zY%0>u!v{wq9rLd%{um`7=h!IR%&cn(eLf!bqYH0>n9M|acIC<(>|gegJj{UZpniC1
zh#uD4Hb!d$piQNxMO~C8BYfI$rzDem))+&_h*Q5Zykn5yvdW+5Y;{pl)FCbJMDSp8
zb3+?gBkzLi(OLFE5ZX$$p~Ra@hDzt5_`iJytYS9F3T7s<GsiNK;bRtswwDe3(TNY-
zKncsSG)W`f2~j-VHM)l+V-_>iuOTlw<6l;JwiuXY<sxfVD^2^<GyQT{5LJjZ5xEZl
zo&xD-npFpk!3I~<FsEE2uxsaNtpJPRm(4kNJ<s@0vvgdxLH7!%+%UU4sATEj%x-$Q
z)BN`nbbrqOPz{Dq_o%MqOYyfTg>2z72lnGUtiqHRrNt#ewgi6+uA|UYoM}_;AAM_@
zb&KUij+U+RTuFp!dmObO-QzYOWcl5BB~t}?HcV#QRJYwg0z{0aA;*sfy&bZBBAR*b
zFoyv<onOrur_^0o)Q?Ws<{0fN_vqScXqow882-%P13+HJ(`EfZ)X9{;{}<4qyTW*=
zay$0W7ZZ_%{}YK_A7x@D&NC=7rNh$}*3aPw29Wx|rwDdwuAka9=P%AG<iD{lY0Jt?
zxgf~apq?OVv>w6AgL4MT*EaeSiKOk2Y4<g~sqK1Um1YDqr9bFD9`t>Tc0{LbhI%H~
zOcBw4WZd&jp;`kqih|4pFmXUvAuowg6k^ezg&V{pT8OYj{dR4T!B-NdTeJel@k`X_
z=E<g)z2^J)c%;DclU!YWbHWmfwpulJ=NA;L81IS9O%8sa-xPh$yOy}+I5U{6p}Gc9
z24+jY_y*gz<hHboLz`lXw2N?v%&PL!-ph*4#(F}T-Yw;}SWjJ6=%Lvqtc-c3L3ed)
zA~_Rd&~D;Rki6@bVY4wT+v2;v-(xeN;c99t$SJ}W@eeK>sm=D&>0C^f*`WoyR6@En
z?C$fyDFYp=2)WX(T^)#Xm04t6YmjN@^U@Du;L!Y&K4pDCUyl$-H)s&6UFCG1?-%|5
z&shNWfrI<c2%n(KxY)F8nE2q2QDGhTf6i9)L%%KbI|5}zaTSy2EYfF%5f~P(FTVp@
ztFQ1>l^YGYa{ySe42*SsVCyz?n$aBVS+b_I_Hhh0+=Qp3j9Ye#A!~LK%zvT?Giz$e
zL>zdQ3DfKPA+IS)n^TjMpu0ks@%sxBRK?^2d)PG4F(cAv!)>v@3lx{|R{_?KVr?nc
zcBszJ&9SL-Q}jzNS8he!_2TkSi7Vu9>dGfo-&M~Sm(-}k6M>&m<<OwP?)AEP&`|YK
zqX<kQsUZt**|E;cYgoyV!V33OPVQQi)+oHiX4j5BB2&Wu%yB}sr*X~S0&p!M?T`BJ
zpBMFi*K!BC|NOLeZoWOzVg}<3WPqq^jq&&Wde~GcU+^-O^!5j~7DZeK&-shf#(vsc
z&VrX~_Jsh9T{=AS%%*XH&(NQCK7S_t9duQ;M{bh}n&AkOSS)Sy4To!Ou`x}u!+Ml|
zu)6`WIOpoJ&{!o(Rxf?B3Rf|{@I-6rBmZ#0-INNkcAz5e5T5agTIlCg)Y=c<;Dbp3
zy@Y&@k7Phs{UP82d~P4@`r3)k59bb|`Vkm6k^ZAc1(eh(OG76dQcMI|o4L3~Q&G_u
zjs|->P-BIcO)domf1ljYE9n77t~49|axeKi7&K;>5hPw2d<T7iHi=lmCb@hHYwt|u
z(+dKsO;(EVq=IE^C{08K<~4sGg2%`y0$wL04tEmOg4_!fdNQ5K4Y|pG;(PDS=KH$$
z?f<4q3=Habw~FWn6u^Hf8?*wDa!12Ce(M+WyRi}XyU3qvT_7tE`)jVDa37QH*Dk&9
z)?|0k%#Dy|&L#45Sl#hnd-=%A^<m#JFY=YQl=S`u9ViayEvjYh!o6PWC8$J4XU_fI
zbDE1%hZ#R?MY<lh6d|=_I>^iznT{nF42d-CjX^lV%h*EO5LrH7X8q7pdLgQ`+x;yP
zM1u(O>BA@gs_2NQLDa)f%n7*Q#H$^yDi&HS>VXsHQjWlu4!xyH62RfHV*a3RGT+!G
znh|!$tu!(fHOZ{PS`zAt;GaNPUIoA32~#B_NgKZxX3a00rLQ`1OVomQKp1cYbQ~G=
z;#_3fm}y@MkLyFZ-w`K!6T+5cPG5D3HpZ4P)+g{@`U7jeV`f-0P_KrTuU*RvE2g#C
zz-NW;!(laBt7pJ!vf<7N*WUAeDd~~UG%?tcJB3gi1ujn?7f&j}RmoU@W-r<cb=Jk=
z_-JyS)sj+A%A*&IXHB)dMdISQyt+kl1k`Im(}7Z_@{f)@>`;1jH?d_XTzSF8G_LdT
zipi#`Ligt<nL5Q*2f|}_6lG#)r^w4U@(WxO1HKCZk^{f06y#fx5De*&(x^z=uZA*L
zAP*>UjQ(_{j}ZK=elb~obO=#7GSJ+XN!$($8D?RHo>|W=<_z&bFuxeOo%Z_M{O7Xu
zdVY;hv?i{bv$yCkClqF<th;C7xw$otF>3b?PA8u!Y&&`g;cPfQu`V=q<K4a4F}^F~
z(USLw`CGP18{v1EOk5GOfXp2i12xeXT(~@8Q^x9?N?)mTAH#-Y1<{6-p24=1$LBnO
z@<O1h-8Pz`)hSNTR}6voN&vnVWm&W-D-n<7>^C%&K|h%BhR3_C({NFj`Ja%%=`;4|
zh#qr!%O$8-g{dJ6IqghV*pO6C$xtOZ;;Ux;GMLW~+9T;dZI_D&T5YJ`A|R~gnBq^`
z=jx*)no%GDCmzx-9{xH5X1ElrNfpOJlWTlvtzuug4|hxPOi&x5m)F8IR+WA4nDUfO
z`Pp5=Y`AyUCiYR?v)(L%6fhRcRD)Tr1?zg|>w;0`{cM(+Ly?@Qi&skOrAPhYt$Rcz
zPMaL<VcbLIkqw$@=5m$?xfV|#XJN_Q%s`T4O}OAEAo{Q}6t=Y+>Lwct{E1f(oA<rU
zDQZjnONCK>O>gpw!3E5;a+h^`2_mf`Qq^GE1lv_HU*pjA9zJ~dT|+A8xtHUd0-|ln
zS3t|kQz1c0On$WT;SkegkY{P=-ux-U1Y=B3i|8hpCeur>y13t>F2<QD&V5?yDRd|N
zTSSNQez=D|(YwwhMajNyQ<C=Sc&QE>DhMz)J*Oq)g+tmi4EGh24kNH#omV*zhHbPN
zR}}h-lb{y{YYIpyC9P7%(RbZ7a}66)omwX3lRr^$_KV6Jpi*Y5T*&Wqv^QHp5pnp}
zHnm7b*0sfL=9X4qcAaLdAX-WhHPVCq6Lwz-Zeo-A8{_DnjasM5>tzi>#KW-?>fVb|
zPF@upjRAyvPOzr|4R&0Gv^p-OM~Zlp)BJj-WH!|~+|>N&<mR)HfuS7aC;9qx4+vPg
zMX~4g<Co9D;m?XvXuB~XXslYz7PRx#yt?)>cU&SqvNmol`>zpK^VU}xX`Jo9C%hi*
z;8{d58iQiW1<@*D94~qN_27EZ{}bDe*!%qwWpg4t_Q}vkyl#?>pfwfV+FI7?v1^;X
zd}J;hMmcrMQEKhEJ!y^&`S^^O<Tagb6A)G}9aiUX90f4{g(0q6*UJBk<Vq}%uY;3p
zKU#x_iSM&<6wVTR<z^_n0?`{di!xRJw~sU#!pau`KzUFJ6H>mHDYyD%vv9Wq{*1IY
z_HP}o7yo-Sp+;DxTD%e{ZweW<_HgqHGJTOaiwqYX+3TjpBmGktJ}xC#BBS`)gp)B&
zrpqCudu_ej(Ak6oBBB?Iu6GQy(p2D+NU%-D6vwUDrrC@{B<{_C*#KXqfbCU90qf#9
zL0?!SgjIH*LUgi^p3&Ov{SuL1626UcEN0sL8D7!{8hj8@Zm6gpO$oR=`2)3L$UsVx
z$bimIw8R>4E-PF4xvp)!f4WPV^{Y+V1!_3!|M)NOJVTOe%my<v>fgi=hi~&TyJ($6
z*!F+|_bg!+i4P~|w+yeKaUKQ92o*tg47VZdA$IavL%f0^SrxT3kr(%zrh`(b-dPv)
zuvv0>f*pe6XPEBqMR1wsoTVS`vKT7$hK2u;I-o-X1hnICQA?rKdPDG7-o62*V}omF
zG*jlEn`GGJPeyFJZO!_7xsfUvE47FG{8Vo9NBmKWTf}jsP4WDD5^5)~V3e^2+OT4l
zWWe4!o2E;SdQ6EpK-n5f_srX;Ve8GtI`Z(Zt9_73=Q#v_yJV{8;o3Fa3HZOcTz-6~
zfRv1Z?!xcX7;c6(WeSbQL`7T#KwpwJ-m_YTuF<7=Uc-Q6=?>HD%nDm;7f^Rp#MOkv
zlSNi{o``Tizx(A-P#Y)CXDg)XInuRS3*+VVPmgt|^S4*U0!NjqP=2R%-r^`yeTYae
zQ49FEbXF(go=Vqt_OovH_I4@Uc*D9A;)v6hdQX}r?KiN&j9m}p`&lynvoIb##>Bm}
z3Es})nifIQHgRf9)s>0slu$;O2<W3~&$IuEO{>2{(qly|yp9MI!FYemfOde+OZug`
z`?rkbIeLY{&I~Xi?5#NOA+heAO^M7?8sy$K``G63T<x}}M=@h9dEY_#Mk+D2ZK$=V
zt$w(zB=&sLrsgl)uxZz!soCC$$oR~i#I|Q<HZ(V`iSvhpkzv7phtRS^&SyD%+2So=
zfudOe_F@P;uE_~n!FRY0F8BxWN*vsAA}D55u7#p1bndD>#nuuW0DZRAo1K|h#B^c!
zf+@;$cE?xHqOp&_n;D8zOzfIiLJzn7^1V{#(UMH01cvPSSIA6}qu_tieV^eR=6e23
zVh&`lsrk=!g=(w=I!G@xf2@Wb<sSDIhGSGjeGVnEJv|3iw`%xad`G04%Qhjlint7<
z-YF_~fD3CM=HOPW5Z}yfjlZ5rG65}LZXYyiB3(Rdbb-@)GedFk0TixJEJ>=lK8NKy
z)u_bznZ@Lr_)oV%ptjcGe=NG3YiIBZ<b#e>ZstmNuxDh!hFVaZ1~pO3wkM<$Mce)|
zGxUBfo-x*(Av}|WL~<44z!|=C&@{7CRe=>d$WgIMFeeE9d4^jK%G9gFw_WgAj0`gm
zE|fb2ia(;dl(N>Qb7CB)QPDp^z}5LOB+$SA{Yhn}CL-kJ_VR!lqf1hC@%RXcb6WJ(
zH6X1Th!M7$UzQpyJHJt`6N<>dkRm7ww|PuWsDvp$KaabZXr-##J+y6tvtlbe`4fBm
zLO7vBtCQA5pw0mvF0bNmsRujTMD|4weVrjzhxj1s#}br=)v)}(JYRUGZZ|tS9a4u7
z4+?H6##2M#$3R9Qvu#hMg{l^nWIrtibYbt-Z_N`G`7~#o$n9VMkFT{;iEcTqM+&6y
zY@DZ@%R)xET(5Iu82s4JA(#MwH262Wf7=JQC&gZt3fCs`!PBI;d(V~jy%B!H!AlOV
zG_&On8@Z>CmMVft=Il}8BA+ShYuu3IvRT31t;rLESok2;nwLooUg@b%Z&Km-$-3=a
z=_+HoT^Z2i*7&7QMPW1DK=;n^9W)G8BA)m$C2!Y`bW($DK+KKsQi(vW9?NxSB$sPa
zQUq|4A8R-KbuI(5d|P4TW7YGLt*#)U7<pVHknbt2;d=2zC|Sr%Y;{sN!?2iRjCi<l
zHT=v_QWjcxf8Sh&p3|{Yol!2PZPI{T^hYhWu8T}J`X>hiuMdstMOQ7Af_YJaHgz_*
zJdKMg_NOwy^zX|50yANPxkb6(*a9k)@7hQT0;Hn8v{+UxbB8OVBM<cmP`VQ`e}+`j
z`D%{+#10V3N+$&``FgQ>h$^WKjC`h4!&(O8d>pft=9UQeiL$nG2mTFH!iYxWh{0<G
z{)yZgWC1fZe<d0;>ZQ2OfP|-cQa4vEbT`n8#A-2rM-vbHPZ@-GG(78Bt(6!i5gt!*
zBHcyhNpo+V1z<4=>4t01K=FJkuMEgo(n)x3>hU<fgb2vbbL=oj6=Eu$70R5uv!`Xk
zMh2D<{3Gk-`_;*#6{!8`O`KG_RT&x(W_3u(2-ZP4I_$2G6I(33w1+FtdyH8h4Att_
z*&o9+IShYj=jbTT{$u^`=aun)byCb9a{O5U39zC>{vF<&sixBO72;y_-6<2OPr-9}
zD$2Opyc8n_c&m|oF4m5@_E!r_t*~Nxy-@FNUW<}|h|-ZKkXZ8?HMto#fh34Q8Ag7d
z^T3v+oB)Pu4{EqPcE$|<7X~q1{Wi%IwpVeGUKvYn{@F1R`NS@5gKP>$#H31zQ}T8N
z)p#{nhawxic^1OPV1evF`!EfM^fvlCKSh+9pkN>00P`A|AqjhqtA9l{<r?fA1F-B}
ziA52=xb|VdqhHF=Q=tbsQu@t^w)3_^_Rvo!?22~GQ^7L>jHDy3|A~XoZLVyHv_jKn
z`dY#DqL?B3V>rr!SN`+8gaIu|W<4(LuI;jY^jPA^(S|=(={FQHTD!*aC_SA1@j_f3
zvvxSkV^V`0seTjvRPsl_I`cX&My?W&$IHJ$lTfaKVjJBT%w+;rjwNNRmz=wUBYvY3
zGJj?ii2qf|1RZ;$@F=2Ds5<aI{j8{V@Fu4wsgo)VUGFhJ)S&#1xecsiR@a)ttlD`w
z{=Db8K@{Vs--P%Ub}%R1uFmZObGU(hGKmB%LZFudEc(4XQ4sA0OvSwg3&W%?(j0iG
z7f?8xb_iTUe9fc^a;Vw!A7j<2NYY2+)5(WK*w+3-Gq$`2@fN%dj24a&eMSd%Phrv;
zf0*qfj0XoyesG~XC_M~wZekW|De)4#U8FoWW2>_u=**WQv$onmrSGHsdBM1Z`j!i5
z0M1MykHJ^tvL%snG#mv2iIWpz%b_~`!bXS^cFn+>i>6RV(}x3o5{=}eV1Jhsle&Z8
z*FoCp{Npa~9D86X^eV^BlT<8QKScpwae;R?Sas4}XN3`k$!#61X-5OR)kB7H8JcHP
zz$}er*9oHj58gQ3?7oxWp9|<4X`l{q8QJgV%?ktg{|jJ(W-DDs!8gOjw()!;Ee=&8
z4Ol?o-;RQz%yVebA^~I(JzioL69sadCs8-J8lUyL)vn2=sk%c@+Hf{29hrZQS9Emj
zl)xbO(z?s~&)c8v+Te6$E?NA)%<5y@)=*un`NSKo5>I|1ewu4P7BM&y*|@vlaTxUc
zPbAiT9>e_Dm6Y~5T`voQ=SAzu(-s>Xb0-Ue!B1nu_E?JwJad{ZQnqn(zoA(?a|NF<
zA@>x*gMR{3AA}u0oIF)hkA^f;St=;iER|@(8#1A<23ganhEyjViSehK7AjrsA#$sp
zwNW>2#16g^a0Zr`U74%4!3VLlw%0GCTfe7#QqKBgrYbrae5YYoBAN2T;OT4$R=+)B
zuGUh~Ty7@$G;%PWML)&2U+=*#PKHbMNnu?P>}v)0=~(f8#BkgDKV0=ZC$0N}-EG;C
z6<DXP)e3>os;$TfyU&%wjwpK)c7Y%ywYB>3Z$5Fq$`L=9%py-59fb2%7qf>Vp>H0e
zUN24>!+hF8Sw%Q2rJig%#!Gdc&B_cjYlYBA9j6+2q=xZFU3~PrBJg09xn}b@1}B{S
zsNi)n4F5n!XQFls`>v1GtpldPBu(N`hJIK!O(D6v=KD3PdJ>(9yPsx}XSee1?s<57
zGAZX~36GkDYM43V`cR=hk1UTQzQ*YZ?p9-Y;uV{RXEQrN9|Jm%CaLOATm)@!ZF*Nr
zjQf2gzA+6HzF4#KuBL4Wb`i_lJs$tS2)c8Z%3P1dN*x50KCF8<==8|a_Lmz|pptVY
z^t?^u+ufnuDncW!Jv3i|@RU!yA^iGYt<3GoybG}er*OWrX+HnUOd_3EVPy1R%f@2R
z76q;tZy=tJnd{&C)PYL-#}hjXqh=i`y;8uwA0SB(vx3zX1HMM>`Qdw&cxK1sMdWBv
z#lVHU;Qe6`Mk(1?&as}ri~At+20Z>MU)XQ8!Snpw5X$fbX&!tn`*eK&aT}o#g}oBo
z8fq)|j#`_#RIZjtBl8aH2cOzkJzi31$4M@On71g4&}VUcyjAC68Fj&dKD0ev-5s@M
zZdW-IZy}C!Im)8n#kQd_)VUfB0r$Plfx+=}<O=rWQ>EDZ!(J|uySFD4K$`!si^;}c
z44EH;jCCKuYQK1CSY1`giI$C!rIU4bSexDcDiVw<?PQ4Woww0HF8QQ2c}!LN<-@Tw
z0Cda6>eF8W-7A{^?NW6vk0{02zQkXE_Enngn1J`#%I*o#!<I;A%DC=9A>XZ$)04SQ
zAWgx1L1RN@i*|`19%2A$qXYj>E2thO-CRO%PNw|jdAf18-_5RVh=Q*ou5pVqB_KVG
z+=_mYQWN}Anx4R!uJGji#H&CkPF%(TN(Hoj^BnG(MJhoR20I`#w#dUXu-nUT77D_<
zPa`Mau$P5A(ag`wI^*`BWNrU^OU|IMQL3h#U4v3*`;@I0|3rkj-QOZKc7RbrJl3Db
z)tfh2Bmq|lb4xA^>xU?0m7f<sbI!oqMGjvl-~rKP%$0c_tVw?b^*-oW3k<W-_8vXe
zRF$Q9uQ2dfPIO;{4Hb9^k!GMNZRz*A5wSwjDc8|^ir}EZ!r*|@deYlT{`<~Xj@MM!
zm*GAxR3jwYL|L_5Hm#ki&PI9pQ<}N)L+CZ~Q@HHFdlKRQCr_ZSIE14+{u5UZ3O=TM
z4A7=xc+C%GuP-|s31SM@x9so|eapfKYJ>(1hBi&#wW}wPY94f4DD8h>^QBxhu*m*r
zVkar_gJHP>IHtdt2e{0PyX3lv|B^n3k<lA9w4caXuG$mRyM-d6Y%f5xQQ{=$mi11!
zNVi<;eD62Vv9Pe&Ob0C<fDgx54=f#oU4$+F@?DReN=Dew?adkUWU|c&W6ADlEv=~r
zjqk!}u&Ys=MM=Q9zlOG>q)!;Du+PXC?$M(0!NpU?VI1`C+k*98X9M^S!Px#ipcspZ
zY^z_Z7uh|D#p)HpLQS@>@dnq1AHr=n?ZzR?4A`{a4u^VtODGEAadJ#J_9fOWdl?cE
zG+Ng_Ee&LPY*_8@5ou0^VsxqZagu-qmGcvYAt<AIOCi4Y&D9Gw>i0NCw5+6QMb=Nf
zU70xxe*I<IY=vhAGDO3k!OvlkWi3`*1}jL$9JJg{gsu$Z03sq)eL+*XT%d>_xLhzY
zQM;Sd^0l0U__vr8WY+T|b3q<V`It4AmV{$08G$#TD6Z~K2}CA=)2}*;MhQa@KUa^6
zC|xzxvz@_96tW01zN#~_9Vtj1@`I!$j%uj&oy^z7unPs#+GrA75^@qXlc)gYNe9ZB
z+q}o1HuMM)=lsmWfB>xxh>G-4HKuS(OmRa9m+%wef;sc8`jh^bH5xQHg0Y#N!UL$?
zbM%H06xJ1KKt7Y=^UC*1i9=hQ*->p;O3A_Qc{AXhCh0bnN`!zZ;s!IU!?SA{K5OcD
ze}+nodwA&jEM^qMD~_t&>)=$Ed2rD~bHjM~)%X9=94~;3955n#f>vf`gqL{uHl-BO
zsD&xC+&M2G7h*X*F$CEnr$B5F2u^i%9%-?@ePpw;-nhDJHPX*cC6LcSfu<4m!^#YG
zoBdmD(k*ZoJ4Ak7TBdN$dZ5%9?=xY`L)4+1t*`oneT+|?bs(sH91AlyG&Ll=aQA_5
z3|i~}qQ~rFO&_W_{i`6@NIuLq<nh2$2)vmdAkzsd2LB3rQIVj;X8N}q1utBj6Yuhl
zY8n;Cd~uPl0CF;)GI-!7F&Qa<&Sc8B_fQ19e`eCz3K2S=a?siJTgIRpU=)8Ie4Jk}
zlp1CVzd6TxVCzgu>m|wSVdssBQEenUEHHv`^%<zdh^jv)mTzWU0ZE#Brq%Hhiq*IO
zlV?s-$!<TiW091L&+*16aTp7C5E5v0T*0q|xuhI!F*;n7q5`Jut)Ro+CnO-;LpfSP
z)6`Zx30N$3MEVc=e=qN2HZo1~T|tZOVjXFza6^v1E{vtWV1Z9YXyr^-x6Bbu?3pG^
zOhF8yCd-kuqt^!INQT~2#e}H^4_CM%@ww`H$tCeMB#x(g(Ympu9NvXOmIaWIsZ<g~
z7ae0SLUE(_mB$MDLG}HJ>pWpt6fOP+du6d_Ga<}4EQbI-x$UhEETddwbdLMLxmmtL
zky^}1H|EzKyaQH-rUPbvCDmrQa0ff4vQbW=oV{XFMdwSrCIh;Bvsgh0SyIOn77nLt
z{kiPo3y-EmXQS05^=Ch?Go8jtb#`o>W}KZ6Q>&`+_vIH_bK)w26X<l>4gx$t!gX%f
z13vA$!1oRif@KtD)%_+Y+%R|79_92?3us}>!4A+tkw~$;^ELe7Hp)5i*X#+WKMt4B
zvofr1PR+Lz1xq57hWIlB#;~aGNrP~p9vQZW{l=b?<!LX3i!4uwYlnp6C1y=r0j*B2
z={M!c9bhWL%4C#zF@s)g^-jhZ?~CnK{AcG;pW6wyE8iTB)$eATd57kmMYRrq+5dU|
z;Vs`$wg+K?N;OiF%3UOjq;@2H+b@y<lb7Xa?JKpW$P0Fs`0GRS0?~FAexrO5_eg{u
zGS-OTHYM%lON92Ppaog0heGwqc>(i<I-eoi=%sp|jW9E19H)jr*S%Xyh&NpxyFmc2
z{a?6MRRbg17opnG4F4=3Z)4q{PD^_7wabY$c-kEAUHa$bfM8SubT4#gwAzh&$|r@A
zGhhli2H#IvrEh7(LMfwj<VvwwY4BCcNT$F*Hk@sO4Vb=J^mheFUZ!TKDDUM>*Za!G
zZnEVK$*)qe;835K$Q;!z0Hl<>2-L&E?rB4EOeeW-p<GOTG@Ct;2D5Q+qTRDMk0+q~
zc>(iyE_xz}H?RGV9$p9N=`%b~EBSp_j|iThNRt2k)=AKtUNGt`SkMAJPlfk))+tnk
zZI>t<(&v-Q#gd*S-QZtcth@|_gEcA1i3$s0H#UmmfVy%BYY$>Li9DK~rK_KpbcH?5
zZ&$^hY&I@UmAu~WCm3@G*nGuRx%TU>*id63Kic}LYKE`wAI~nxYrDEhD$0vP{b75*
z?+6%xGiARU*0&tH5P*`uZjlt5rY(ddqU|do;BpUWy{I}l&%xeQUu(c@1tRMpVQ`-z
zOMr<Cdq>Py#nae>WoC1e^97cbMNfMIu1HsF1%6sBadrtAf6f=l2J&rd>%z};WKl~P
zskfG&J+JjX3OStR$x?&d(BJw`K>SF2BzRU4E_wRza^dK2J*gm3onL){P>2MmKMZMe
zCWN3kXQXF~IaeU%Q!pYO1Ih8;8Z=97tWKpQV_538?eXi5)sw3+vJPu<M-JiaB<s<9
zRN#iA0H(_^N90_fIF`dE6D4$UBY2e~Mpi}!0nc3{ExBxVE&Molk3rayaA!jZ1=hvE
z{FYL@TzARTn_%AuFk}M3Fs2nYZnzloi)0QNkSl`l=5}+9SnC)D^@AmDgw_!J5_tN=
z3Cc}&2g%KuYQTLw<XQCto6vD2y2{_Shjf#~B~k662RVJ;;?qOG9OHgwmt9w6vmPU8
zh(EC{j`bov#%022*>4htjx%GkX=cZ|G>lDmK1$JrBKgBr_ue?){qWGK{p`sX`k#p6
z0|G$)IoNZy?bC(55Lk~&PMqz^)<nu{A6S|HCfvn#iGs(DV)D_*g`E7rm<u*0ZI$70
zE>tA{VviUbnR#z#-j?8TqpcKpM*n~W5qY%AWOQ{_!Y7PP9^Bl`gd*^YO@z5F=}Qc|
zC=<TeW{}RgXYEI*ursm@Nl|AMRIJY?huY93(5Yt(^!Tn*$^<qXO~c6M<n*+fiHrwY
zkc+(=mAdHUT*(M|uGkbBt;qXX9@%%yoUX2f)}vqQB)_qn=Q8PzbsqSBd<GZ<3zAz6
zdbW4=rC|HkNofqI_E-_#oBzY9D{q`Vg~DY(*_arr9DmN<vsso==t$Ve{=4+}kt(92
zm4wN4pFY?w;BW-JZ~uSJ0+_1!@Nh=2V7s*c5B^Dx9aiJikBD+%A%|@2#<j}&?c3@o
zk@f$czf=sdOldXlX|>a65c40C>49ONw`Mq}<3tc+BCg90k9?5aB+!iGpyv8FXarZk
zJZD_aT+(Q{fo&{Mid*DPyJ=TK0-9bs1Fr%!jchFF{wQ-Ty>E9R!(}1%Y=kkqQ+#7D
zw(k!Wrj&%ukX~hWxO246e*y`?WC#wz3&i(T&+7fiZqRxSkNZaKpkp=YoFavR<Y`DO
z=qVC+0Ev`{RY-b5?RrvJnBECU<J%44k76ZUG(q3aRW^mqCL|K1w3E{3k%pA^89M@w
z&@Fmuq3R`xSB5r=Ep~nH=%H?=(#x6u;YoU+I86wme*5#_4K>24BpY0_P_vU=q|qGM
zBMJ_0mF&H)vcB(;EspLORzrueFE?2*^M@g3nWWK+qfiN{;gqX=#yyd@5*to=Y$JUK
zSf$ye=;fZ0k5H@$5cv0Zd7w%xO<?Jcoa_lBQZM}vPAGuE!kDm+nCb4RO)N2epq-ho
z!=#O8_;)HM(cG{vo+}lX0H3qJ2w1A(V$Jd#Mq0j`P~cduOtYap9EowUu<K<1RRnr(
z#GM`K)9E<-39!`B{V6w+3%topoa3?oNSdWgZTpS(XL}NO))2N{JzXsqY!5jV790+i
z%}q_$(q@Ygdp7q~UaBejX1R<EZy|M|u{+fxaMr*D96SF1X!-{3%(^DZj&0kvZQC|F
zwr$(CZFOwhw$-tdp6C5$<{#X(&OLQ@)kbM)P=DtFL=fHq&gPJa8hDniFH7Lbw;7l<
z<5=~BrRGRLTLULya%cso%Oc?XeX-d4nW>0wTq37E&2aJ}HWkPgCDb<UmU-m{8^+XB
zpIFE|Bsz_TmaIq<N$53FuZ#_Tl)%>Wek=I*P7VnMl3poqPjtzRIgBCq80%ZE9>p_t
zs7egL{Pf#sQILJWn1mt%<2|8aZ6GP#xG>hpp?d4wnJ{4E4>hf$YQ+T1!pa~)o0hSp
zM~KhExJevw87B0wE0SMUf@Zw|CdFHt3A~9!$wEd>ar$F+O*t>$Pz2If*DGt;J85ns
z<z`w{P-H{~URRSZJ^4i{xS1Z@AcPXiEaS#72Ch}o)1pQqaine0PhSDcFz!LbgA8EI
zMZ?Xin<}v)lADgjctW`~vl~KIvBVg_L&6ZbOzy@8gI9|gK_bd7Vj@K@bgULW6OAiu
z3MR(~L(EHUx%d2D-!n3yhAu_i0D7GZ2zM@mfz^zB8NW!gmc#a!Macjh0@n~s2C)5z
z<yOHFhPDDBEfiG!vhYdYF58x0)Yu<ez0g4h5xT~g6~dj13@vk>-$NN5LmhjDtL)7r
zBfk+v0?Q?N2X_%oF5=va=VJ%Sr{?p!{wlQ0uO07r<d<B~5LuN>Vra&&E*ak3_X-B0
zRD+pg@}K@@x**fhp>;_CDW3B5KJsqAij``A(E3;f<BFX2f%z7NIQ$b7vwr6m3a4-A
zKcLR?&qvbcE|sAn#tML5Bkr~k;j+wxn3?ojU~-&v;ES5lTY!w)|9lyR#=6dOlnpEi
zT`-HQd8lW<5&ZM0O*`&R9i3Ovakx{XOqLduN39-ARe&$kyvFPuJJFLqDQm*NS5GeE
zS&`ZcaTD82i1Y*z&PUpgdfNH)7I*yG{G<3;G>xG@)lQT%aP8Zer)|*%pju7>98DA2
z&-i3%Hbd*aRM2@aW+Q56kXS)Rdt<FI=NZqvJGqJ)RTVA36x0k>wWJOi35#H2)BNDK
zSSSldgnycQ{C)u~QRaA|S32|1F2;@;FaN4nz(z>RwerCG+^@1DYK5^K$I49f<*wXJ
zrUUV1+T+#nd<_jZ;(XC<&gOmjT~M<-JWMHpaf^FG^2IHRPv{)dG-*Lt2G>i5jZz#v
zN`zCZ9g}xHgw76ya}-NjF;+v1of($WE!HaqSKJd8b&V(v3X-PPI=n-?bU%<0VS4)Q
ze?Zn98%+_Xrmp<5nSc407l9q?BNfc)dAF&`CZ633VN63~mQ&YGYI=DqB$lURc!car
zufX8L4%C`9XOQm@ZFlZf;sezW4se%XtDQHoHdurkW^lOduiItQtOoY$zcuR@AJohF
zIGSvZm#3d9ns0H?r{R#2eRk{yTW9jpA`BbWw0J7Q95e3}_;S}#r_3iE$hSRd<`>Md
zg^OrQJKJBGFSF+_3wvY612{>b{vc!Vsb5}$v}v)$GgarR`;A8Hm^l7}jDq<KV6hFN
z6f0om1a)jmjqDyIs%?ZYTt`=-I5e*g-~exr$}4G;<M!r2d*m#-sGhPp%QG@JKTQR_
z6k}XF`N#s%4;FjJh5~Mc=^0bbz+qe;l0RjwH0!{ocifkFh}V>N>u;#*U5m$+O`f(Q
z&r6yo=#WwomRj6$@Pofo0;`^V-T)O~#NE~YG&44R{GO440*ngSpe-dh<~$wl#gI$a
z@HBT?(93YlFevOtf$y9)TAp?GeS;`c(s4eF{b1!u6fZU7&j;{1+tahTTeE=tte(B=
zZ+W40Fyh{Scirn9uwCMhI9q#!by263l#<g9RV?2Uf+FZ(2p#j|1+u0_URc!GKYmIB
z%m$$K0eFq1oGX0M5r5*kxla_L_~57ujr*}SLb4XC^R=7v9k3>9TIW@Qp{QEBREHLH
zK?I-njEkJsGq#LG-mfnuo!S{UELG`L$Xl9mK1x)>+X!0(Rw(e|Zm{bX{-~z<_qJK@
z3^vpGWH9yt-<I?iJA1_;wdZtu6I?ib2xg=07MpJc@9rBM-~-I^uS3wOoI!W}HxkP6
zSaAa~DlDh7&<|w8aGu5ziw(%n?q<Lja_HdlUp<DHX(45KrZe702y!Adp5g(v)MWJn
z_<9`k;VWNFuHfXkoJ(@J2k$g(|LU(A$!^XBi729qmhFY>YQ&=Tt-iNQO>}I%>U}uG
zKsB_Sk)}>X6^*I04{sIG4>X1p5~!rbO7jM^76z5pHeYxb=8-fLKznpS?qeH+%(aqT
z9+O@6BpqoFGpGy|y>C;nWsjN|6`F-EHtv^`;F09DnAi3_E(vpu-+zjUJg8wI8MR!X
za%_IL=^5VYsN?f~=<m*DGDEqCFDqZzo0y@zx*1DiWCe`b1I=h1Tk`TJ071V75D(h_
z66davbMOHJ84D{`V?Wfq%)%QRBO97pcw5|byY_Ck#3}d!W38ZI;GSVcyJ=&>xWt3B
zChv;%;&y)RZiqaVaEW%69-N;KOMr<4)4;6MPz@$qK(lmX>##VdoxTmGY0K@Ap{{89
zKFbADyovhjuWI|32Y0k<_?I~a#AmlRu<HLD0pOG?8&7vrOpUFF%8ck8TutO=IW^5I
z(8Xu8?9i_J=$NmGwJTbb`<%;Rt-!cFSkEJ*svb9qo2O7{JAo!+`bFhnFUIP@0yLj0
zI4l#PZc3P&GKKY4;BuWUTPw~A7e6N7KVnS~9Ah+%RFSVGGsmW1s}~`2&MX$o1KyJC
zy1>n==N&WJEc%U_4TONJ3yW8KF0m_K*WZ;qg0v3_lk*gyVi|$A{xrms#n&*JFrj#q
zRS5*uzlx>9vKv77*HV~;WQ@8K&AItAgoGtK$%C(2^cqiPpg=8Ri_ks4dQ&YH+yW@;
z@t&_4CflE0al~~1gVdW*!BePLeFe@Qua(#P{u<USSYRnXrusn2Tf4&<02j&NyJld~
z$0Im#laEB7aZx9SVO!16q$||d7<C3noS2n8o)LPvr5Y1_?xf`xKA58S!4Ftzax4pt
z0(V05!r129kKDrObU(5dicyCA$lUXc<449)W;<fPf#HXJ{94)Pad?O};O#!=+enJt
z926SVqGJ)up4VSYN1!}hISL*p326bJ!N$(xdz(mQWcfBzUmy}D;@|LjUYHk3o`|+&
zp?n>#L=rXov;;3pA>W$-!(!@IVlP-0nsh9)w|Noqp2iz`j4_S<OB7kvBK%oRcdD6*
z?;1mDruP%S#H@Yj+@444AUQ;<$+)pO@_i-0tY^p!iHwZ5MYME|1r{RNLlEJX7P;2J
z9RL@V19D#lNlYxF&p~x5X3f)d_wR<3GK@957c=6Y9WDHJmmn^&7ZH$o!8dcTgD_=7
zN<yE{){sA_yS6puQn_>xYgkzv8^u@52pTD`On2;4K_k7!1%bbg6(Z+js}yZ;UDC8U
zBbKl<(2(gK4BB+CmJJ`Im3#}mK+E8VvqE`9PmuiZw0Xyu4vCKv&Hju1h$HaH4{Hx}
zO}0R_J2RsZY+5*4t@KoxBW9DO{d3DcR)EHWkEbZ{-77#@d_kqR5o{Fg8|zSPQHv5+
zFQhW<Z(Wc4h_zV4Vf#&28oZf4uRILCKNTQOgx{|D%qBT`PV)qQ0&x|gZ}=L2b@Oa1
zk83Xh83XmU2!YzhYZKh@3VjTudv^fjC&YrUSQX0>ca5ruZN2)z{9mVR{|nB@O?*#8
zn9)Tsyczu+c}d5`m{GUQQEpSLtHuhV>!zZ4#Vr#zj5aX`f~0@E>%g$QkqFr2DTa#N
zyaY1|ebw-{seBHBZkFV7d)k}knc&U#)esqlqc?pRd5;i6>~QGtM^fIZFtX-}Pct3T
zC$VeuqJEq?^+YZcx2WVaCzkR<_VNLR5k+nw5Vv1%s6kAUcpn63%feq4Dl>TPc4<ca
zn9@G=IS|-wv-OpX=men&yb}i7dLI4ZDbbUT)918(NPfoV7F(^o3thz6y|2jOvU1nF
z-Ir<YrX(|e%JL+=E-{U&p`}*#)YXMW=+`#6;R!>_(3%)_lWnuAG5#f&XE!=tf=eg`
z)1BfHaavES-{^ic0Bis!O?}&;;9%w|L!!%!7A*_SR?CZ!sBOWt$(^xj$tQcA2iqvP
zp2xNp!x(+QdoHij&m(DdmeFW7y>Wlxa<K%IVh8WLVi)uWhcrKq#{Q={@!QmXs=~n=
zmk*w+kJ4xaBR<YNwp@>#mD_86P)cS&*{n_eqJSsV8xXzpY8a{e#Nm0pr5Ql<m;7!R
z4gT<As~fZ3l}{<$CL=5|DhEqCCFz^g5HaRxi-DavXu3m(jowxOnfK2}gmojFpf;~S
z0ucufNXky5R<Mzi$sjF6A=90mLzbw%XWKp4v+x=c8&!NT{kmrof|7o7&gT2ds2Uu8
zN@ivq+AWY+$lfnptT6#qvZ;gXjKkA%<zitKWRrO@(}d|?ZknA&3FZux4dhk!*m}rL
zg%C+tTrb_%T#U;Joh`7?C3%ktc+JsyY<b2haW3uG7ulLgfnHcxnrH76SO(<jkZC~J
zUT_yP_xRh^d+EKDA?Hm+=5*#fIyoXhjD7JE2WtRhLNB&$UF?yW!cdT6VzL^pZD@0$
z9e2TX!y0Jkz%baKgdZy3-hZGH^1xEMaC-c3(Qw8-qtbZqkMnKC0*Pl|wJ(<~!$aR9
zZV=~1KP(w}qdK&1(n4JmCf$q1B5nutjyZ|!_=86D{Ku2(%o#GZ9c&@g&`$xZy-@8g
z{n_=|!Xak&y#j_X&wL0Z?)%}+Sd@*B9u8t5uW^7oBWTiVxFL&F2!zC6b7yPL4^73(
za_WM3jHuFBEQQkbf!j^ynvvviJCxCF1X-rr&Y@e*%I!!k$p(6nrlt0g%D~HqCsm1x
zwYK0KKV_?4KOY>duE!xZ>5XK58Zv{khv*9jZo0uZ!HuDPhK_B?p0$?!i=j}w>uEVr
z{ftTJyb{Sv8gjV@g2DM<S8?%NL&V?pt={*~M#_QQ5xZKus2;qPo*EZvz81=_8OD}u
zFdnm>B<G$ZI;Zi!sW~fStx|g#LDO9W7Y7CLUuU_V!*NErMr-qoaC%`sDL`3Uvde{`
z97N2yOCvRfviqY;lLJ-Wgr4ZCV@rmVJx`l&i}pyeNX>rQ=pA~k0T>|=au2sRch!S<
z03a!o_`O?`g-R)auP)8!w-V@ZOqtA(#RjEG#7=)xdhgM(tC_$-#rW`%79b~*u4yjL
zXQQAhwZ8PUz3uENZx$;fdk&XLa+^XS;kqUvOI*T2FhpVk^AOf*N++I8rln#(gq6|T
zPU$gyHy^Mw@cQ*DPi*hLcfa5GC^j1AFBU-Z0Md;LBAv1@R-=gl$>|s1mZhm7Hv)!r
z=;3AIlIJI%OBpFUS$KK&Isz+B5|qg#A-sOu%p?Kd2WV6q182%<c_8z#9MJTT82Gpx
zmQ+b-ojs0<jy}9XZVvFMTNsF)F5AHs&dd~!!S}5|{DNVAF%%c~Dp&YFLer^gP61TA
z0P_ld2y#9^6BdEINO^%jAG~HekvjU}FpM=EVfG?{zDML%fHm|<1+k-B*O-FMF%TUQ
zRcw^Rhmrkt###A!ch2ec)>73tQ32O)Pw^L)PlywP#M``>TZk9(FkV!YgnG^elFaWY
zjb}HXQO%!_I>P${NxgHWR+u0Q6~)=ReUDJ`xhcbA`DV4J2)YjzAezAm&})M9dnR|n
zjmkTpZbcg+)0V=kVZtPG>x7M9Z}bjAE7F<ZXAC{kTlQN*x}j}T?57SgbAb8QoB8q#
z<_`mtm*X&2u{ld%SPED_rSo%eeSs2Mr}qEi1cMVj7M7i`z)&_|-f^I7UaZwm>xKC1
z;b%BA5Pjy#Xl~gDiSjJXfUMkWn~fg#_pxIDP~eFN|At~Ejaob!<7IdSEqiF^`dF*y
z4U<=<k4Vtxup?8=YZp1{@+`Jln;SrF8c?b-M7~()iu69U1X@w}jmzVz3iHyP8p)0L
z3?{Z;OATn+3zIqSik!5{(`08)$t49|=F7(pAA2nmy}58NygKrpS)kC`AY?_#&b666
z7UQJQ{+IRD2XVLMO&C2kmfD}63nL=#C^9jk5k$zckY753`2_Z7qi%1;P8j!(aEOQl
z={cCtozxa^`(DP)o$g-M09vjQDk%dwSy!r=iRrG{6Sws*Jwp;OXDGtH-XAvBeJ`$Q
zaf`hyGZ|5nTYj74w<neW7Nrz3B@#P$oaAm9+RMCN;ZScuqyvs$qJ186=+<KiRBf#@
z8S=6dQi&3-8j)d8Rt=cs>p4}CI%*-2)>Yv4Rd2t=vu{NMz5eoc{|^2tw`1qX$Ham-
zHkt|F+)b|;EcNDa<-B$8T2O1ai|R#~m>xa9(LNa7(FyE1ywf8v6UK<W1;_8Rs|l>v
z(&TS!>mh73o7$^jc5Jf{Y%~-qiMY!a6xg9@<jRkQ#6kaP-lNnCD$qxXapuC5EJ{SO
z3?}~>EE^Ix@|%ffA-jWK;?08WNSh%i7cSw6BA1{iC9VH6vs@6`GaLm05yD|KHvF@o
zp2`jE_~4S0y=$dNz6Nw6NW#z`<dv*N#QFSgd35g?Ysq67pQr{gvKhKaUJ1#hI!Ke+
ztEg1G7r?feuIn;k^V~~ICsOdOI1{lt%Ql6Q|DoDszt!Mms`%9MO}2huwDQ)UyEMnp
z#_oI(x<)Q{_K*oPLl>Im8DOlUfa6nD78XnN^SG0L9ii#;{Frwn)S;f)ib4E}zw^~9
zCJg@oR~9q!jg91$CyZkCr)y>+aE(V7=lfXrm{4I76J(QtDQeDc@m=q22LLOrU`^Y5
z$`vefB-^1#KfeFEA!XKR(p<C6^<J`$oK{jGkDCOeXVDx|xhQpue!4S1oZ`>ylGgAV
zTe~fIE(*&4XzTZum}-WjDIqwQhK1DgBX#0NcjnVDhqt)8j!^VkQSRf+!ikO7$NoE9
zpUSUbl1Pt0-OtfV*>)3h6?#>8H+x~ngC2lc-yVpkM=<qJNg-5@O9L!kGTikXdw@w}
z3X}?wsJkli2*awu1#0<MVN&lRxer^?!;^R-b7i^rC3LA0vnL-_SQO<-r37=^W6lAz
zJ!Vu=WT}V7t2HP&16sCcH(|;J_l9u0^=a%Q!ij42Q*^1=V+joqg4MiX{=7AO6s0_B
z!@bFw3vV`72N%qLtswzuDH+gQ0^UUmi0p1p{$f?AM4t~|sV`=%?h7i}uRiabb%$)V
zEv(hzR9uY~en2o`G*J_$aIK&2tmJ)4RK)ZhD(wZ<J!&CucK%duln4FWk~~ikHf6yw
z{P$TT?ycv@(}mV{I|S{Y{T&N7$Ph@p*ol<OI;#+{B6%<dC{!%V@zA|kKuH0LwO)u&
z(5WA>c79VKPCo#N3zLxINU$t1o|ojA9x3$Vgl9LN<ux50wM`5;Bd1DY((+C|P6_1o
zFP~XAT4`~ReH|NP<Dr45#?~^~c%r1G;(Z#U!?L)>R1A*Y)>)oNqRlf@FgL|$N^VZJ
zrC(lLd3e#L;XO%|;x_t3_rsZ#c$*m?b7c9WKK5g2yuleED4O*PEsQ#(w?ff+@PJv@
zg4OW0@S(E0Fz(Rsg5PxLqkCzVtHMmr7oW668P0>Q<D3n=qX!&ya?1Zy3vS@jctQ)I
z6LV%?54&R~=`Pt&$rbuwB2B`9om;CX5QEn$30E~-NvvyUA50DX-`^Aqm_AGZY>Q;?
zC=Z@RrlsT4-gVx+i7$jUIvJGj&AdLsKXQicP~t6N?-xY|9;)=D-uQ!`{DGOKMHt6g
zL%|CJ@w)}a*MxT@iFE5{yJD^P6FxWm4s8&_#K+5eXz5N{MW;PH8Rx^96KK%*0{7g4
zy{B>Jqg%ckyc5{6>gOga=L*%21|TEAuRzD{49)szd1uzLWzl$wcBPsSQx{W!l#xwV
zBoHYlVbBq=Vr<*~*??ekLRE?YU0l47>z6SV2XAr$SMd8;%+no%r%sAs8CZflG<!#r
zl4Moh={kU?Bdz6M(Iz?!Tg79uP+&9^dJwuqdgWA2;~?khr5MWlNNYX<sB!>(`Chnn
zN5Sh@zd{OF1qeOlV2oB~{%E?RS6Ni-qzH${A7M%ie7#YRkngO&^(Hyk;y7^&otpt|
zx;RJlPhtN|n#m4{F52UQWybi(9>i~P8*=+vUMeD8QA;*SBEkLGUU7S@XE^fOi5D$n
zyX-%@eF!Js55dbnLj2E~`44MgimShFp8vk=i>Kmha{};LyODilupAmIh@(l6EpL|W
zWB^N2CA+xVq*N+ec4E%TTEvF8y79K(GptZ`9l_{kR;p(3u;(F#u@E&nbe<{0V2^Pk
zmg~Yb(8*Xn@BLr$LjE20cssxII+=!zn`CxAVS<MB5F-4m>Q!Hlr1p7TfFvSpD@nWu
zUT0;C{a+Hse~#lmpk06Pv7v`7=rR=3L>$coDKZ+Wv|lx<GB$+=)EAVexej$xl^Bz*
zw#Rm;n2BT5WO@7@t|s)jIl|8*zr9G%W=D8%Z3=A^u4NwQQO{IwWiDZ_%S~Ka4Y)w_
zD90c=!DN|ZAeO1y%cIBds;>;#TShKcTInJcw!^ax{;wDnhq&B#Z;)K2-LOH%zlYw%
znEDu~b&|5l&@dFVg*5PClxzRj1JQd)r(rtm-mm)TkEAvu3iNCZp)t0r$mIqh9C9G$
z8Yc9@(C*NPE)Aof-w72_VDn|eqXA65-8N-M_%2>57Up@D6tfA_v^$GY(A#)bxSt-_
zQz~yGfC4W6*1$(b`Y}IBLL9?+HUVS3Say6FO>CZo#y(V-pb<EMLORaNOiu$ndQU1x
zuV4Z0Y(#1Eag?0bckXl@R^lam^{9#j*B8|IrinIwJQo?EXZ7pvnMG7VL6`IwkfzeL
zn$F~B$q+tQ^{cl3oBjZ?1o@Xlxm?yrJ=%u@eh*QbfmgVOuf1g%GWH2TBNd$_?hhT2
zKsd?=H{XYr2<MeVLdjT5zDd4=5Hi31ZDJd3^F5td?`Y$$Otx#!;rszC<!7?GyyTva
zK{TO~d_F)oWuk2JxXJ8yB_G)n>~uSTMr&67d*JAi&=P|R*Qb<bxBApk_c{MLz|Om6
zobw$rY1B}DN*rdmI`vO*S7&N{>hD_&06Jtb^uZ$2F06+)mDSHXt&qU*pP1?Db+qP0
zas$2qk)JbPSM|VrX3ESWbX-UnQHh4z%9lf8p2I~$DNl?#5;GWD<V`ezOOtOeX3@Lt
z8x5V4iBC<Xb>kQ$w=4Gu^iFjaFUMjS`MU--2V27y<2~;l?WXV`_e|}fGe6IJRi<w-
z+N6;Nhr!g>HkQ|P*bcC10#K2Nn)It22ENiV^v;jAY?cILl*0n!Q!8BVg)pfb`K^YE
zH}E1Fl-oHU#?|n=Rl$AR={pgF{t=z>ZzTcPw0OsMJ5$KP^&JxxSIs#OCKM%GkUTNb
zV=+K>v_LJLa$fT?B%11w1L;fn`<S%)k>WHj!UZ%8q=HJPl^5m9;=Aj!0*W<em_^~;
zZchfQ0jx-f9r7GZ9~7XpfTMMQlZKDoYrv7G!0Tj#f|Tx^9%9;syzuqgKeKG0WTum4
zEyN=?7V}eIDS!=x-MB~5Qy6>i?Os%zrLJ%_t5qWXo}<~i`Sf21#Xp%0N-w1PtFT<!
z-gTw132WBZnW;cQHn7<|++i_B6CSD-x|FgSnz&JJ@3H<Xay@IaM#FL^Qs=N<=ga*J
z@Ke*D1Fv!q>RU93<l|Oa$zjJrFie?i`85{cAk(DFFJ_qbm>t%>no!YrH;ZI2Kig%H
zH7)BMlSDQcG;~PKliuL{aILDQ^D@zQE2^iC!(2ugp7GI~wGN&t=+2whSb0I@!8C3-
z#G$RSfNyuM?0IgTMC-eRm;QP}y<kA27;nc8Ix7-@%kPU<(%APt9Yf_OJly=BJ;6N)
z7B!YC0i9$Gx~{9WpVz<&uDtk{51DCat22Skw=_{^E{3&qBuw(M3?54TAwF*Wf*JVz
zPk&}f+8R1$VjdeHp=A92T#pA6zT*B*s((wl!A?k;&<vsgNYB$iS*_D-jRW0Y#T~CB
zGE^%`b(e8Gk}Fe=Wlhs7aELBvuYfnUCeB<D^nXdye*?9>_whDz95Bq9aKNUC*$EwF
zCyFqWnn$5L$;C~kL;EQ$a}*Xm)BnE~pc9Tx2uC>JLXK7(-RhtcX#&<9f7lba`?fZD
z_zk78Iq<h<3-}%&re`URx7aF5`l6{DaGVw-AAD6d*&?0|TlX$?);<p0V)K&z(8Gc)
zi6y%SHh7sFtwX|pi>2?itV8XcC{f2aAj-*AoklbD{wFq;C!|@Q69NYDvM{{#RpyGL
zMfD3BN+Upg?1(|>|K+6@ZOXgq5fno@zfiO1{cuOq(7?5M(&BzFOzecqPd&%Q8{IwM
z9!FKbd0_;PuM1gNV!`u+#i2O@a&Cy72!n!}yagCGF^JPftZe>(U!Q=+3vHu|_ud7u
z{ZLD(%-9xU)O6g<DtU(N!8Y9tQr*B?hThctu<Uwws&QidWjzWjzyF*6c+!J)S*%1}
zZ3P!GHzJ^BKBc+mO?g4nGav9}M*5rcf%u^*8*P~tEJ*U!0tb0(A;!EzeNDbG?B%a^
z$9JT-+C0qqu3l@%6?37?Ts$ex?P3w@TItx#<zbNoS)s%odq+p@QO^yGA3X28_K=fa
z_>09QnB92FI2QkRcF8`#VW}0ehrqhCKei3B+g%hPFH~d2Sim{DvROxx$X8t-;a1`N
zLLEF}&@|i&ac;s3F=u0Zr2?yRFAI{inx)nTaWYh0aP29XYf%9>u-%7dv#|lUcnGSh
z@3l$(V0#2>51YNDKkv}L^>u6qu)#<XCR15J4d`UsP{g~bv)3rVnUAQ%5>2i44q8Xn
zx+Ar8B!ctnZ(I=cHt-l&5kZ0^cLu);BJRQo^#U@UWZiRshlhr(@NaWJN%g>3ySy-)
zDq4k@7@U-GCq3{~xBpa@2lYF+HN{YS{xsnv^^?9_EVywqtvY`aMpjX^^|N5d8BZt&
zu!-rXonUD-vw<l1Z@m87#`a($ruk#<B+Pd1_^h7vkhwDfBoWl6aHjvR_MvK@D&Ny<
zoh=UTX*`u@Z})`;v&#U$WPYqbwV%AK5u;fQ<YG34$apyi!60LH>=pUp6tz{3`qF@*
zgsGcE^)gBux~7fs=WhBS^L=C8ci5dn!K(v5h1T_<Rd`8d7R6{AAVwC=euA|dJ3>47
zr&-QJE3N&vr%l~}M5@Ala9%{Jp{<n`@<r0GeKZeLC0FWVCf%1br#DzbD~wM>bNZfg
zpv?Cw7iY?O*UD)y1CtL8T8}e;362K|ewB559myZ89ZvqZ=eU9!6W;&c>tE)E1lTDE
zH2GI3Nj(v$dPwwUj>NqO8Y_d8I1U-(Fd0JfY?yoR%_`gZoSf+#gy!$qser3{M(9e<
zxfyic%fFSbL-g@Bj#&u<94ZqRn*QXO@Ody;-|T+jGMg>L`aFYasw}LC0!}?Gfc!Dy
zFa3<v->6z8;_QAWV{-cy;@f1PxM%E!9W$gDfaoA=PcXF)4^!F^$x&Sh-3T}R^DmLt
z-6mcgya&$EBZ1UoT5D<m?zW!efvN0Y7&m{bG50ivpU(*@BCUF+u?^v-=y(+uoSMMj
zm^Z@ZX9(zgjhI&VKv?S7o-ZNcV7CG%K1>E<N#~L)C%>5msM`S#AqjRB=&OeH2zZ|w
zgI?CXj24h=pkbd#irUx#d#0S_*@GDeag(*w!L$br275kZR>~mZ&I#=HAU$6LN-!6M
z`9_B#T#lz5TeqNSOqsaiN%&Abj_1vs(q8(B7B>ujd4m(oc^e5Y?NAW+NTe6;-3fpm
zv6mJzz+iu33Z$4$oKv?Lf|_TG0KZWDGp|wr(_YE;8ydh`?}Z7?v;QP5XfG0QdAT$x
zPP2bxB!*fA40g|X7z4-o2v?{l;$dYW5eKn1wjymLxU!$9zyy#6CuJQ^=x0hz;eMDJ
zPPE4J+o90-SRb3#a7Pq)S|e8!RadI3u+<j92*v9+blYc>c(2HK_Ca<`{Cq<Nm*X2o
zt`UN%<7`-18m8ML3+U?UTA~JL$&fI+g>SK|f*bue#n^H*)1#V;UER6Mu^P*&hCu|A
z!tU-Lom?&E7PPcdU`?2jZDdjoj*-N?WoW4k#e2iASi9|nAi^`Cx+*v^dcbW;K%qpb
zizxGdk(9^TE5X7L-axvE`e!u8B8@T?y&IoVa%KVtA@z?7@8f`tGdAd;7UCWf&<ASu
zW#<;{&AvsRs9Uf+6Z@hq@WR=S{ckKfHV{`*BVLr74u_uns4D<%u}?<FLA|<T?D-+c
zc>d;qhKDPX%7!|5r`y2x-S4h@UYaY31sT*xmoPzbQ)9jjBZaFHCZ3(vQY`S70ST~-
zqD&_w5}ivQo61TU>{)fz*wYT@<GV%ndU}WtekQ{AZga?omU21%u>=BVe8`^10{?n;
z_ze%NXEF2>;8I5bo>p_5mDytE^}tf;RK)}ZRj!CuqxB4UL^~A6GM3<jo(ZrAnOae<
z{NPu~pZ`T4A%gP52@JOQP{(~tq)KeUW~pkZH$SVnD;-@UwO}SGng*YN;gR#kTLAIo
zTjY&gkMqvY)_=C4z!1PT;em~)W`Kkrzp1q#jZ*N3k!Dksrj6l#WHfz4!`wV}^E7#f
zmpby$4j_r2=|>EZjhBw07?Rp|^6sD-TxuK0Zxs{&#V{l^deWquGgSY{Q`{VM9y$F;
z>Wlb~<e_THo*WBujxz&4kghY2jfo(tqQ%M$`JGB?9fo5l50mpH?Szhp{&W^6O^rC6
ze>=M%uh<roGJ5{UE4{hn7bOzb^(0OwQL(Z8MDNR2oEFVvr#o-RR!o`hyinPV5USdL
z0f`ZJ68m^SHse{QhOs96A|pxNF{{@sRF__sIK2xB+qTrKVps2@;g{;Bh5Up%Eh=$8
zS*XAO*9UYW*vNc8N$z>8#OF;a@awlgVxCLjX_jcr3OxAeUa!D>9V#*K0>^iR$>i)_
zZ9fQTCI6N1?t#|LB_B}YW>}c&DO-u4T+X`D_r|pB9%4pQgU2s$$9ffF<LI}~{_&H{
z74`pxcd*0-j?NVyymsFtj(}6Vgc3VSVh<r`V#{sv_q8U>=H=v_*CBZ9xF>#CB(hV!
z%nynZi2Zob)S|J}kPwIeLH~{Y1eZjd{dXf1HH?r5{-i%Tk9Y>lQf89SXwM6J3|=PJ
zl(1f)1)iS-#ux;^KUxo*t?Y)cl;Sex7ly?Lfy(`Mnh6GRW^Bj|S$)~4A;DC-hOV!M
zGECd%l3um?Uk;3lAT+*jX)sJ89Cj!xP<vE$p}0LN@JAhAgVW6Qc|z)%5Z!f?Xs}H&
zlZjkgq3+B84GA>MHjvW@*t{db($8i(!+v<zWc+YCb^E4@Ffa=eH&N)-1Jez_$vtU1
z;9)Id^P)uS?6Y}gyn1w@T-Wk(75vN>J~gnP|K+slPUv#s2u&-0(Gb&PkwvCVDT#F8
zF2dnCujk2OSa};I5-dA0DluTuW3hXoJ$-InLfFZUr{5DpwMsdi;Oi}3F^Ua-mS2ba
zGRCw`khu2SGZmEGK)ALCf_1GyFbz8}=_n@FdJ3XMOb*$)C~_RB8yl*8^sGGpk#~^e
zNsFEPukLNiu{qgA>2JQl<_M+<%6?}|dol0Yb5$x94!Ep%T^t+aui7a>a`{M;q`g0O
zRtE+ENw>SOiM~Zqln@Z%-;Cj4kl9Rg;Nb~15D0Gzk>raM+NH){&y=l-LKq_{%-TC)
zcz&Y0`|m7x%N6KZ`zqqyk4V^;QLJ;xC14Q@cnAA95B+#C(KgV3;C#f&L-niSJT<)e
zWUW+D6w{54RzO&14B)m`H|%DsJhCaHaQIUiD<a5Eyt~x<Itrpoxo3WFN63k+;sWCF
zEHyg-M9(MF%O%-uS~MBUkV40cgs8CnO#%H4leV&{J|37`j7DiAXl3yufd+_kb`MVd
z7`czb@Kf9a!7!77MNTACzL3Z}nXZ={T;)9<(B<WiWR<8W;|FS%#LZfoH`>}$ZdUp<
zNL@(;{`|a2lv9uk0shEgSPWX-($1^)B6MX4GtD0yDb7^NY0hq(!aStWXVhCj6tDo;
z8w<FUM6e<!6)^c`x2g7H*Lin#I+nFYVjI^RT;P#i%qU@cAa@nkjK;u>cb{am3cZc{
zzS{BJ0k(_W;P?b5Di{U}NfW6G@&k-FXNA2vOUYpiC>+qpB#D&<5o$7?_p}VT-(eJx
zwgA=ufR&@r;~kVM_>zI<B>pON57VDw1lK&$W!^&S`BhF`3bTKy>!FI~lx+{tdL95~
z{qch1L0Sjo6yR>zd``ofc7`FgtT6Cv-Z9sIHdd?#Uo`zbL=MlIc=5Tj!3WR(*-rB%
zfw8RZ6I>L(!^G{=X97K5%~a8Nje)8P3GP_{Q^TSs2Hpy2;y?V1<Bt;O+AH$huoIJo
z^mpum=nz}|RX&?{VvBsQ<>Qm4%x3*HG%``2c#u(A?PZw~-_?&xi&7)b^KUe+Sn7Xs
z+<ag~uwX>z&+1*q-tD#h95-U~BVo>z7L*xSJZUFWx#;K%Dv13$6^#ur5yPV4t|4Nd
zRQ~yDH!ENc!KSOY#_nKD*di$~Gb8qd6oQ*uxRxM`^0{f^5`;F>HQ@oYGYnzxX^%K$
zI&DK3bL#@693a_hjF`m23StZP!-Nw9a3D5Yc67?S;1|&`2Gs!E<N|J8LU6e=9m~m(
z%NCGV(StQW87?P8<w6s5+Ni<8fMD8G@)O&fGFIhxGBvwcxkP|L2itk2=t6fR=wf0M
zHeo7QCm>LUq|?Gs51=A^tkR5%h`XSc0d@vG$UTOi#`XKCbsaR)20jhTM)&$e+wq=y
zsPJZlx+?|mR#a%r)kn4U0GH{Jh!uyzVOWOkk5ZcPQY7IjWbz2XM;{SG_&VuEt$l>-
zW@`;jvSUcP1=IWbFB==k!dYjbW4^m)1I!Y0w5Tf&oaKHR4#ctC@++>))FNlrsD}-A
zR0u=3IZxB^fw<po6?)lApUOw|7_DOoVjOc8g(A@SowPcBL=cg5&qt~z>Y5AMR1C2%
zj7a#LGi0={a3-srt64hO)tM0rc}n86>%P1#SR;0!{3$^U5^OqZ7jYsKwYBY^!m0<z
z%wBiT4f5jdx^*iifEFM69~RkKNN?fy>;E%GY&x*+?T&q!3C5|oO_jDbxCl1dyGb#M
zzPP_0aif4r5Ybp%?+{`+w;8<?z%v_5D*X~0IKy<>M@SU}ZAjLOPuP6x2Ls0s8qppY
zD#5OGT1e^*Z>rD<-3lQ${qOEa@s19hjEhDqx~J`5z79wmW6;E4$y^sEy*kg31)gHx
z8XuAgQQJlhlBQ?KD}WTVAG?PcEA56awIEH1L-2}gp{J)O5KA)vvDF4@4$6vHZ(NbR
zVR{rY(T9I&;_s8sSA3|r^P*oQ)uh<8QB{FpVuqmX%IQU;M)$2|K6(t0PCuDBB|ZPc
zr^*&T;q!7(&_+s~Jolp&QqDQ+EvVh(b<`-G^QR@A%Sr<_$gv1gAFar@!~U9WI0L)f
z;|k_64Bzp5Qzu(7%>6_gO6<Nw4CXZu@Ri~!B=!2-YRp43WZ;{Ym@(l{n4Cdx(n$p>
zD~YPjo7w@>18xeo2;s$Me4hwarpCGY77uM7^^S$!I-Iq?<p`(B(xA6X9iA8PbC@Ft
zgysx16`IpxxK2>eiWpHEQF2oxSO{)}>S{6OEY1RtmOz&kH^HCylF_}fc;Wq)JitJz
zSF`YVSt&|3J{mcB1y3(m2{9s=P62W(pJ+?iYASSEz~dGl`ZFs<1y^iIsn7aJ{YSBl
z`<w*S!3x&A0FR64>Cl89ufF2J^9?X4WGx`JmejMMohG1$@_!cPiw%zvzVRed{EN0!
zDv@Ziy&4veEmZtbXq`k^EvCWbP{*lXyWFY0XOljX#=D8408F^37E9enEL4wckJQwp
z59vN_L9lE;(*#PcA=srJ1vYae-}Q+Y+3aW}{*NMC9PJhYP^p2;Trt5qMb5`;Ohkhd
zN8sT`sTO_M{i^%&+UqLe$J#MFvA}90L~}rk&#syvhnMf*gCy2rDvRgCH01j2_pDNA
zqbt<2SjZ(u>u+eHBulp6XHyIdN*u{LMU1-6Oxg7iIzIz0t;+=&yVxp^xQM6+vf{A~
zhX!p#VDtDA{IVHyRv&Ey#^5EtA8F;((H5lAw3`bUFZ|p$ULj6KR;!+B0Qp6LPJWO|
zwGhv_3Db<G%o15!Ed$6G)b=Nwo?|QQUzVt6U;unF5@h$YX{xNtQRVDA1nrJQM49JE
z@LeW$4cWf}Hwa>LSXQr^6bW|`fxb}qKf_p59m?9P;7kM6ow)4M1wCd2V9*4xYM<5T
zyHO(fnQMVO?VhbmuJ0qreXmrDCwb==UDd@8k#%+kX%s%0=6G{>$A<s!t)oBRW@rq{
ziq{HO3P7dsUord#b^8*4^AlQ(py^j1cfg%$Oe$j{hw2eKLbc-_Azi5@N{)3BOBEyX
z!pW*iI{?Xo<vI0HWE~70$%vjkS}txRs?8TA5xQLw>UTeF=S}u<i*t7clNvIfo~#p+
z{=(rFIK#)hSNr`~FuL|)l~@e_57v!F)Hb+=`(Kx0L3Y}5(BU9pb{qd|)Ds%hmek|6
zp)|2{VkNif@(-(c09HASpBwSQ7sNac6IWqAa-$^gn1uLp0+x4CWw&ps`)JCvuwF`M
ziv2nAt>hY!?H7!+c@LRGv^Y^QV|P}6&IrA%bRz|D$!}}OAvZt@kO98t-3Z1gx|aso
zY-dv>m@I1ELD_o)cAPwMvfhyZ8;l~dVYhWzu9axTNn75af)+}z-~l|K#~=~Rl;yYD
zFT=843Ua`&HQR<kE6xdbqwmBqSom2A#=ZfLF44WF>Q$>L(`H$q2;^NPHa(;iotqq0
z#LK$(572rMtFa@WrG2C$IxMVCrlAkfHp{RHh}FO_L&Z*Bu~d(p$O`9sP%T#{$qGA&
zRql+vwwcw46g|>_<8i`q0Tt4}v5Q&!ndfd%>e3ESSJ$!E_U*mP2B`H#0CByLci!SK
zizOeGIHR`OC12rNyUHQaW^b-hix0qqWg481?9~$y%g^WUNr+-S#@5e<2K^(z#aJ7;
z;1d^z8n|c$ple9}#~bel-9y({s_G2h#*^I!FJNlw^5!j}as`!eg}7Tfn*sD^?AS26
zCG7N1rM@^V&?)P?etQ1!>0DxuF4Jz&dd+k+^FhDcPUX7EFNEv47TO&CGvXj+90*Xx
z6c0&X3A5=zj>tlbvr)lO^0qbW?`YHcZ&SL(XldGZL>t8mtr#0ajs5|Lz#C)KfR|6q
zXivC&YL@blXwTt$Wnw0_%=X4@T`Cb|Fw^E|cdB3wFKQ(>Xb|L~nKvWqW89Zn_u?>9
z$zTncIt=M-am+Q2s9DEY+#%KjuV*+3hI43caT#F8kZ2yHV^hTlHSZ(Sp+LU{1I#24
z9>!V_T8zGf`HX{rml18c*D(&3|AkLl#Xo{Z-^7#Qn_06`D%}m+Q)Pkowc=CF264i-
zE!F2labfD`!_JT-p=?o6i$WBl9E#gIb-y#C221mynK8hB!_~6-D=`>$mSFd7IdtGK
z+Wy07x?mYzg;&2_?S(-taNTkEa|b8}J2fev2HEh5btLv6GxUD8<gD~8=+o2;|E+oS
zhu(DP6Pu#eKOk=oZ!&EY(N2pEBJbY-1j19Gv0f*5_)y|G0GP;c(Y1074h4Zm-&}8~
zSHiDg>lq8Ih(s=_A$ti24gKwd3K@SR-Z<O!NNdI}ZdZ1f!q)l^vp?gkZs3M#sPPYk
z-&wTrw)If*Hj+91V|eVI2@cAJ1WOvLZ!f2S)oY&Q#ayzP@eab4XoT8#fKwH+*j{Q6
zK)f?=VMPB3C1^fPtf*kmoUszPd<ulBzr+R=_Yr-~E6+I+{rhc2UMWRcf_?3h7bKbQ
zGQtK)%X(!8<I#6LpNSnbk4Zv8@;$Ey{HoUALV<3*SMtfKg$cE+J#j|ggC1E`8E(l-
z=WBP6D;`c*j1Gl~BeEkg!<+5ApIE%+wsk;Q^jxtaJ;qmi2N@N|jdLvD5_j&moKvm}
zQwwlC`6J?<-8%x+A|%71Yp%mG&olXyb-^0-LE?7&Ygq_%6M_yFZZ*P=nJf%TJN^Ml
zd}$?{P5yhA=*6n*L)zLh-hF4+MmZe3ZFboO%})K`Y8H7}sJcb{x5-Go28}&?0fBUQ
zx^6J7pGEq&Q4k<2qWM)~F|?oATfA-sILi*{51Iij488}NR{XzYj$?3X9j`V!s-pkI
zfCLb4q3+fSwL`(esy8jn<ldW<^x*Nh4M}BD3EIk=oMih|_dW&NWsLqsa1iB?zbVDt
z1#v7pxU_Xy;Xe>rR=vGX1Sk<9HrK%{))^paq7O9yU~0{F^aSMg)s(6&eJwaLoEB2V
z^(^ayj)Xt#{ZmuG(TGJP)_x9WF91LBiUFvMPNCeQ3W)hFxK0|uvWdKTzHI$NvTio$
zH$3`(zn!kCq*eHDJNDN0VP@RPNKJ}35{SMahmXxKXD{e1_xL*jeKJ-%uTiiT6$K_f
zWt64nELUfzeb_PrO?K#2?WOt(KkVXoBmkCHlsidPk3bH%@i<>A)%UR=(~a0kbK$tw
z0urukO7|8r%XK!#C(FNq<6t*f_S<6|X+HVE@MYyzYIvt;$%wnh6ZNvRA!MJ7DP8^_
z6b&~VszCh57L@>ux)`x^m!GRn0Defov)D5z-a(EEMr=Xv<}e0FA9qw$rZ1<4`*AQN
zrnAKzL^IwkoEhz>E^y)~ZDI1>kEKKSlC$v^T|66}&^~TN?(6fn5x@LP2u=iE96EBH
z8#2iy^?cJte6#eY)1+eNWm=%9qVN)DylU1q=Ei@w76f@RV;%4cuYe!BQLuUNtm-+{
zo;;rr9i3Y-;O8IhqTd3xmk0o3B3R;C4gjKnDXJ2~!Ao)AWvvXGk12(MSiW#o@m4xg
zC8jjPf^}5n+IrDUnBc{<(u&O*VByP9*RqBi6l1Pv?JYfN1wHMJunc}h@#(Onyk3wc
zC|MH_{FZir=f}2flh=brvu4y`k1D0y@@us)(NU>iEHZQm+~%y&=(D951?1(@M11u>
zspcQ1uCR)OXO(bBuqCy>m}g}xbwHpZ{h$`?OW6Q<`t<~eR#oP~q!nq-ENRd$!m)|a
z<q1=gC5Ex*I|8kF!F`J$I~E@M$hzT_+`O8CG%gTOUP*CR@#|zkE$w)H+YzzmV`EmN
zBc8hyO)9rUi27W3BvKjhgvLsJ83EGNoYx0e!_Kbj%wpZyUxSxmgFKXaloI)F++C2X
zAePRE%I7^m?+bInVE!j07JwvVdFfD;(B@Y?4gxnwaVSeFZd?oy<2LbRMllp3H6cg>
zf$JxQ(@!1k`lZ7#E!R&^a+An_h*Bpu92yoyTHJ=CmOmjXQ^MO8o<)$@Su8>)kz&ye
z6)HXWotQv$-9GABc3IbzkggnTwRNKw`6id{)wqy%eEo!;-N<>f8hH;Mbt`vnRCnMq
zJhc|t{@f33MsF7I6bm($O@e+43OHJL>STIf?~mI{9F^jKX%_Z-`P!Kp5n#S*0>(Tr
z3IhBt=A^&jl$*i2-8sL<{ItL?L2EkcwM(&sv(~e?={P4sDbzXHfX7*<r>U5AQ{r`G
zz{_rQ1|dpnn(#T-Ii(JeaUGp0YscEFyq`-p+?;$18u_F#Leq|n_cVagaHA4KUx9%i
zV6+}PCFMx|rdz~r^jg4YrnXIWW=&h1+yWM(M%+;l>rTU7Bp91x=f5AtH2m_w;%ZQV
zvHk@E-q$bae19v*6h>YuXwgWh0_?ert-s9P!m|d{uJ!%G&22uZ?_$1w4JkuERm?1r
zM>tL@5gn1_UDLW}qkVi{h#|v_dNiJ1s5M$xHOqB&q6l=!JQe;?h3x%`#i<ilx|35E
z%@y4dTwGM2oFMQdK%E(eED6vZ1MrFwh&iY;HREr^8qmwiaX<Co2Uh~C!q~`qoa0$o
z^Ryv-HsmqwqIgc+a1g}1o{La6w|H_R;c+%@6Wn1Tj6s<SQq0`hq0UwlV1r!JuS;7(
zn^DUtp=}sbDI1(Jj$@dprf_6u^pUVf(h=EeR@RBCCJp}L6dy^cZv8|`Tl=Y;MO&bM
zheN<H^KZ_+B(5}u=X#DtLO=g)0FOZo6J=j{QsOqD(jO9A2CM<^xnYZFJ!u;$Uer`3
zhcsVtE)KIa(bs8&VN<I!+aoa(x$Ik#ArQG?x~5NXbd37$>~t^RP0%~%KUZrBO#_rW
zNaEiF^lPy@Ocf8dhEa*^(HgHi2nqvc(Z!eOb574iNHZ;-)5X@{^^Ve2w0YG#3;%RJ
zO@ej2MQ?^hqwgX=DN56aLPPG5juS;g_u`u%{kaXzYOTvdr7NXM5s{$LOQo;LI6=i{
z7+6m?3(VBzmaMX=0)#6naFWVy3{wv=F|HN=;vfjyF@|cW^lRe;en?2n&jRw=Oe5W(
znr<=>d>&hpByp}6_xf3JX*wldal(5FiDZr?wBVr7dJMBjF!wf-oHb}#)7*4;SCm%h
zRox5vikjo|?-f`R7wD&V!b7|MTW<~Y+&ExrkPbdF!rKMo5RP|H3ZpADDn?Tyb&oOb
z5dT^rm?zSTjvl?xD7B@~NH+~(qzo|&qDnvez_BT$hcvn^sKX+a5?^&un0bP-srXLX
z<RX+x-iw+lXubD{owrV9k*ZB+xlZvSFKTGita8L@;eVWeWq@aXa`mfZ0$&LcPNH4h
zIb}9TGgZ32j-lxD`{PCBWb>gx@PErS=KA3Wj4Ub?I9QeFT+}P{xi^Q{4Db(h<LW1}
zYY*zJ@?O+z#)(Dqei0*d<}k9d&1Jg-SuCsLKNJf<`gRBvAdFwz-qobF6xOd06E_%d
zuw>Y6bp9T|F3IbAZq6%h4Sb}%7r*2F^$P>A14~G?ivmHgZlDUd5C?$)TYJt_1)0Ih
znh9fsex^zs|A%$=4ytGXWAR{pkbWB~&3CV_3odl4pk{T|?LBxEhc>@#krF)pGC#+9
zZ+x`mR~Q*!{vc9MN~AHV9>ZbM<U3J^Z|%Z)>h)>1Pu)C<i?L)6Q3eh>z+i-H_Nk79
z-ftWXOe{$136yXDdUz4#ld0*SMsN{hvh-##0A#AZ$nL0-VBO4=n}{uC6GdLBFG*10
z(ga)cIQU;Iy+49HxvyF?0!L`M3*@vv;tM%6UO0*Gqt~&R)2UW<<Kt>2CQdDEq)^5V
zZj0|iJ)`G>XclWQ?Ru3W18c+F{J4yd1_?TDkcO7EhNx!(+>#<H8u^=qcH0(OL8=Uh
zNZRnIR9?e_{k)|6F&9<AX<5i?8m&#^Q_QVwHx8v^b(I0CrXt``O11!9+A%ZM8UtU;
z_{}ReY_^nrhr-ATCgL=HmLB5GE37u!o^C3AcS0O)(76crQaaKR#y+V=f>)hVXoh)e
z9o<UZ6g`M{72M^3ijXh!g0)UB#2S7TT6cqGp44Aj86U{O^u!YsIAR@26D+P5k<4+|
z#;RLu?hnnaLN_tOVcr*3mBov=S1&9CSn#a(Hjac;=py1RP9e~O9sgI+LX6*f?eG{*
zM!O!B5G2&w!nzC5U%V6}{SF;TPo=C?lw%TdJjo3Ka?CN%aVe9k+s8uqC096((@!S(
zfInyr+IPzbG7?`RT4hHsSSTk6T^q)`4p?7X3yud2y9wONxI7}qfo&muHI&eZ$%c9d
z#pC2-lc|ltx0QVhjMdG6RBNn&vVjr6_4dI*dO)?Uh&9)v_4>)sdgSbeVGei&ltQ*(
zF<==5b%%027(<jf)DuX)tkp#J3U9sT!HSsVN%6;mpC~;Miq;q^8p|r}s)*5%a-q&e
z(SPUn*tg^_r&2$GL{#T+2EIq@8<u1TPdtqAiTds6NS;wWxpaFi%Qe%WWBIHKNjkk6
z{u?an9|Y{m{Krcv$L|6}4b~>$s(2NhLY@loK{47_5GwH_W(%S_b;gEIFr9B#Km1dx
z^II+<{$F2@vxJ?lRFQ=f`bwDY=4P~Rtzg~DVw<k5j7dPM>!S+c=c6{Vqr9xFq#+Px
zgTX%azstGnJhA`N+*Q9d;eG!BqA0C&hk!^a-6<$ABt|oawAAQkbf+L8LqK91qXkBX
zA|WwqgfJ<2BPEgpM8NN!&tLKV`QCf(>pagn_c`~u_jO*d^yY$}OO$QL#n!bXAyp2J
z8D`AKGC%gEN9UYsE5%06WkLG?)xI%xGluSI{mJItoiwS=w(fbTWq>sxV0tfLjsw1|
ze?(UOq4hs4*qxJC>VBdi;DxMk-WVUw_(Luh@&vC2G=qFg83*qO4*PkIAW(KHs-0xW
zMj0UW^5sWKlIo1|1QwK9=IVs_BDG;tFXU{PTI<+PJjErg@~d4D%&}PWU9v%j#?aoX
zX-sc5zUKG$xvpNFiRxbQo46gUj0{J`gq2A<FG3+$n&x)snK}|0@-6gW6F)y&W+X{3
zHv$y6;H2ySYv0ZG^VvghMX4O~Szv^I{`<b27Amc}7ANO?n@Kl981Zg3WC{;`9{6cq
z9-*A;#W^$<op$Kgea*<tsDB;V0Rsj@4?{cUOoG^Bqc9P@s<tiVKWX%1iZf~7KZZJ_
z2enb0ExtSi8hj(L{qrxQ;V@@~zR&*=Rty)i)AUkdyRU&uNxb>Y9Zk2wXr>GfsU!fW
zP;aTiC5@;2_S=ryuAEukI<0!X-_Y+^wcn+5EN&9i*9LwuqHg;7j5^4&dty8s*k)r_
zY0z7>Ea8D~92*_{mW2HFGHT^~r`QPyHS-PqufVUuKq=1N^$&YUrj<~*VC_2(g@Wgt
z)0j*nvcesB{iXYz8tTWe`+gD3Yv<||2X8EGQTF|BgxPef=kfl6yK@lt?&`Cpjy%dl
zSpKu&qSJ<)aY-rA7X)Eysm1j8R%!c(Ox>{4$|$TM8Z{=2D*@qOc=X_L&KlgWPbC_w
zY}o^V?$)+&T?7A}PI3j{AEhye&xHC&oyEPbvsa}3tK_`hhI$p4HDSyv7dNphg?evs
zj}x;lPUAd1G%G#>viW@{Yyb3@SGLAd*TI?8i?>!k)oQ8e-xf6WWqKbuEk!sd6|_?~
zBOf%o_aL5o{75r*;<tSw>`VQ?nwc3aM1rm|<OklghGa*tUU7N8i!0yb6?UVK8@KBf
zPm7xWuINU&rbE}?H7Hhhfu!sZ`j}}1vY6o4xq#=7cwU-DmnL0Te-<h*NPN|J<$f~5
zU?lnnAt=6R2Hr1o88_c@>hx}++{kCMuTMdaz|k%ab&9Va$n5i}b%dsB7XpJDXoh~2
zdge%3V8NbjX^Kj6gJ&+>@_$^zxD+obXY%@EEU+HYYPWd1{Z&;<D%Bf5mMT(rJ=(Nf
z<A3W%E8C|T7~cs@4Z3`vio)&qiex13+MEZeeAvG3!mThNM>b8;c9Yqz^mi)$PIndL
z{wTAk@jh{Y%Bm>95GkP3fUp(0N1J2QXdpZt^d;V6X%LqF$2={sH#E?(RmH>ayQv7@
zF3dX=_&)?u159^ggW1rP6(3ecE59#-1GW+3{vc7H^Rd5~gTQfcy-VpK()qq`jlX`~
zmeKW_a#r4Azu^gez5+k_uHu&0&kXqO_pg!~+m76boZ6GD9M^NR$cU@c*gnpGb>QaW
z^S>Ti7s``Wm$G;+mz?3hd?olxp|5{`jG>sgZs;l2d8gWmqI}nL0?j%%Lk%t(Rycx(
zhi7r(x)TOJ619_~=4y?l_-boi>!$7@5HhlFevsGuG}y7#?2I5P9MB~R@P4mU)Kd4D
z`5L!<)%`jv2qx7$L-0}!46UL&tjT#WIg?yW(*|dZ5%G>8H;#ai!|MKS-M+ZP6Mu(q
z2mBtVvPE-wS#Q%u&3aOuJ`9!qkePf>)r|Qo!&dW7QUq{+@s!?SZ`!K=-_g;-?CJs*
zz45mv%Jdc32UZb*8FPrwYI7`eRFkEiQqQ{0KaVdVr7W`X1cjQp#JA)MGJ;T1<ydpk
z7MG)mQqCXLB~11K`Ft^lg*@@Ye2cgAsF`S1awN@)Y9T0Uj#1f?mmfjt7cUD2#*5{m
zg7rVSEeVV;rQn;{96iP+=f)Q5d_lE^6*ZTpzk6YK@xB&KMW<_UL{Z!R{rVHW*{?O)
z3{1y%E&SunTVod)4uL<@Jdu;6b3e&8LVaWUh2rSAvX5qffegf+?DB+2t^%j&P=lkc
z5*$ZLi;2X2f(&i=Oh2s@&iW?E1;id@?W8$DLix7@_(0)lvwIr`f0+Lr1rmv*UU{Rv
zM`@9^*E7rXt2I~Uy~BD>uFf1g*Id^xaC(OkO_{y^5qzSdt+PV+R)Pe%W{6R$h^V}B
zo7P7yEa+4YNmrqp>x*hNMA0rq;$;_6a^B(k+=FR$lQ%E!@#>5mKdX!HLQtvK2on2^
zE%Z~0jk^2qb55ISECtx!?7JM5mTw+zSo+|r)idclPs9*HdM0f?F}>fQ(R6Fg>J(Y}
zzP$7GC7<cxLsJdILObeJ%@L=T*mhH%>|?u`cr=T1MEb-W@>W;=_qyWLj^kyC?YjPf
z>9Db@_&gTNWu49@B`Lh6wPKTbuD;Xh#tajW2rM;hXw4VOUA>y~yHYeHx3+wj6mvcA
z3n(Qz7oey31z0HTC{hcoe|@Zg%XX5qj@X+2{p4r?%*hh0T3lmW<)?UU?ki(g_;?lT
z`At^>68%wLj@|z0qY$*{uXGF7Aj0g1t=h~EDaKZJKK7h*r|Cm4mf0*Pr8{dWE_riP
zL~^=6j2x(bG0GGFL@N<Wu}f={`$8$!eOv<ZP4sebe4y|Vdx4BB;ecZ!cFV&{do^gj
z{qOluo6jl9nZkReoeIo%NJeFl<I^tGZF!mhkis8C+O{&kx2C+9Omoh7ZV{UXsc4c8
z4V>IW0_<qw>Bf<_$9W01GJ~_q(}T^jwm2@&jTd|S(mlBo%;_<o6pl4%!mfMgyS=y5
z%L=OIsnbdXG2ElotfS5bqguLPe@$_;t>W;}4gy@*4@Dq`3*uHJyITK6(&M2ry7HEh
zN02_y9n!-TqC2`!lR=!u0&J<4rgl3Lrsql>W2~_Z8CBHcpS4cT`%|S;hLqWDuH^`T
zT!{~t%%R&`=XQBe!ufj=Pa>+t7hg_-3(duJn}u8Jz=P}NcjYfDdrdSeae6C9Pc}#s
zys0%QNY0lK9Mf4=<lIOCvRU+J-y=yn-<7c}iQD9NYJ6p2jSnZrg-<%i6<O)Xwvi*M
z)rRP7H?K*is2<58$i16>K@WWsu@K8pLBek~5U^iX)?DS2+C~Kyu)a&V7%CktL8D2*
zI*n2&dD2>@%d2IWd-%{0m(8$|)E4+{vW5|Kf2XF;b(v+k9xV0_H!>axhPB|FRi_iT
z>}6AgMpRdPwZ(OG+MS?nlyOAikQ#Qfw~@iHH?5#08NUXf)v_T<Tq{0^1hC2wPZy@l
zFGxMHY-IOZVcL1b0;2Z|Z-0t@Q31imR(To^ErJc8omTHZbJQ}WBcG?HO8fseOzgVr
z1r{>w%vwzsKy#Ju1`yZ=!TDMPc<gB3MdLwRz%hp$9I|MJoBknpCNW^(YD)K;B%Ut6
z{Z{^`l1Z9?jBe@Vk2>M4g^b>C$&C?&E@?xjI&OPSTg-7gbROoetKXS&LTK`ed*>=P
z(}+P^7)KrN&esKQi#T%3+7!#wEh$g>UoBNe!w1Ya@=G>^#}ksmH%^a^juykC8!}(#
z(F)EM-ruT9-g0`TXE3-3w`U-%S><AE-D;jxD!mMzkt<hduM4%TG(StY=b&a=Ht~7N
zTt-;f!og2TuJb=9CNz#l9@)`Aq}Ln*r_cGS4(iCxh5$mJ+HR-O)mJdmZ1i++(gvP0
z@g?Y=)Vtf?Q`wz#(<>kIQEHuPbF~`pZzzw2kREyP&pJZ}I5@JoT)|dYTxcV_tmYlq
zq(N+|U7XXn*$@}%f{nDHoGzSr7~5~GPO&bi^X5R$S6ihDYp2{H7${vw|2%tTF{|Ze
zjh%w=9)0$gtybUdewMJCWI~h+6YAsS&C=08BMBp8>7OT=$^&^;k^;FbmEywRlmB3!
z>TbBBS+SE0C08u|XlYl>wIIoF#(28OnA{g`Pd$c+1q)LtxD4skQ%kL#TkscHp7J>4
zskE&q@j))t%8K9Tv;R9;{=ks1Cm!GUo=XQWoZ=kOtB#U<&kH}`bC(``nuS%HWsMvX
zAZWL+#)9z$W&CCI-@I5rFqI}n-w<83po9)&5mf*1LzT#$=xP{N4(+Tw9G+l3v@N9E
z;0d=svfNJ)MA^6>3+pv6K)bxS`B6y@y{$#?LNo{RMie1%{?g<%-VVPdJqKJ+xQG=s
zk{6`ly^`G7gd*Dej~H-4R!uxAK`i@u3yNz-iLb`R#F`Y_2y%>LS!vy0AN48_ZkRxB
zs}1e-<Uj)_&ETSs)w<);@H+&+f|`-jje}Yk*V<Q}_`{;v0c`{mMNlRvi(EETPAn|j
z1hgLW#T4*Hk}J4LUF&lxv-K?UvB2HtMB2Rxi@Sy4)AAS!eMmZ#f2*%WZss;=;w@4t
zI?W51i4Rn%>V8$Pp4HnVhWalS4Q@}$s*B&}aMoE{qr}uLHqVL~Y$Y`<vel$KY8IGX
z?DRTErsdJ3V8$KPy;O*=T4yLTk=1%b!a%eJQg*j&(o|l@mFuY#>jY1ksWG#grJ!)4
z9LmK&oKwq!HFH3K#y#zrU1e~ggH016MKZ9XqO;fh1L|SHn+&upm=R@3^Um<dsPs~M
z>=z0i=1#;ZN{ljzC$&AzOr+u=Cqd4|{HI<FG!yNwgvV(!+?;3)9rAh?DyK{xp*_!~
zZCqyPv3hqS-ucouT!B>z{cu~494`Ym{nXRUkp<U-smZPEfXh2R4+8RI`gDJFxo{)y
z*hnt7xMDBXIifJydxe~l0mh$LC-(wGoQjjFnVaPF@dei&i8PW=+p4l3N!a`{d6h4d
zS(8O|P1epTs(DdVyUW*N(#ZZ_?yks6PJN|9R0+=p;<D*D@Ht>U(C;?|_0#U$r1BDz
z41C?b=Dr8~@7O~|(*oqGbzHUu&fGDG7V!NZ6YmwwY2brD)Kv_@dp`_XB=Z2D55H3M
zHpOErIan1+#_&BysUbYUiQEFiZm(qQRINM({`te-Av&z94I<jwNlt0k&Oh<R_f1Zr
z<UX!LR6I;Uw&pJ<ikGPNd8GVYW1aFZ`_ZxJTFoLv1`ZVv`ciK>&L-Y0rX?uy`t^Zo
zNh9V2oQTutOHd=dPjR?)b<iva2-d$}vMV_kKY4bVb34bPbqgvqPkMqw++94IJ{cbV
zB6ex~pFjR8-1F;9!>UVH@K*2FhAhW$-X)9h(SY#q_9J1yt2^;@H(EMYHeU<BOW3lE
zDTAc<jD)$O*sfpL8gsS%>sVV15K{dut?!{yNDv;{k=P`)@6j%;I~YZps(Fr-cB-oW
z(ie^oN%x}xM3I0i4p+;s?FPKw*|;6p@fuWZk1}bwva-Vq!bUCA$9HJFBkvjhih#`Z
zWrc^@?DJfuMH9s!fTb%lakl}H>_jN!kk^lb=Fa}1m$x}aM6{U&x!qXH1D#n4#)5R;
zWo#IqtqH)!N|pm%w8bL1+n=8bq&h6=fc_bs6GQw8MNGY{LyfMFQ;jsWma?2)UjieK
zz6A(Yg5g%~eJ0{~^S?5A2dPoBn+etQXr+UsrGk6fK=tUTJDL>#atYrqDWPmomAURL
z>mBTJR?t$W{?jg@=2JwZEN4lH@Z}@5zBH}CdzD2+wrb72+x;Njw-&O0ES{2(+^7&w
z5f2B67Avb#y#v_i&QBi#lP(*=H^?@Y{nK`xdN6bJoqisEVneIpo$#Q~kPzo=^=Lyf
z-grax&P3US#Eq}xnMB4lvWf$^SeaoUxTpwf(MxLzMmP2S7%^2k$e)mKwxAj$zlb2F
zvGlBg^<z?3b~s)<Nc?trm?*|>dxC1v^!@L_3j@PxlUD9d&*9;2mV~Zz(rCjtCXd6B
z*Ik82Uw&~)F@a5VRkB*zb+nj^W`ny@f2=9MVHnP(F4})-J#KysK65l!hv(7?$+t)&
z7>Qfm-)2cIlXES$vj6z|35Fdrh4<X+mA!t0E_Lk;EUI^Nc?t^frb=MsP3Oj{^IYCJ
zBrj{Ginz<Pya2xuuDDJ$+}jVI@)S4l8vHSg5wogWuYuW^gz4M#f8-MX_uIh0SR=aO
zE)#Er*o@~r47nUP8ktv*RQ(fzEQY!-P|54xOj^EU85;ge`oLM>9>t+8kJas7rW#Ex
zvHBMx`m}5+gRQ)@n_sMi`*xi>p{4Wr>K85de)f|^NHtQdi}2A*3e{D-SvL@d>C}B%
zkep~N74`0bRb>>_k3NQ&n+p>0!anoGHzbEYtLO-FlddlQ)`D)sXLCt#d?bF(rmSO?
z#&lRqt8<&&9k3*7!>)zL(e*D3cGY_Ixwm-;?Jm~16S<{DN#>-(Ka%R`jEZX9&N43b
zai(Dp>DId9JQ#Wv(Nj~JBhNAgFC7$e1dUHS5nm|IrCy&kkO5YS1#It~9A+u9B<tV?
z5o}~G<$sZGY4WQt8Q!GO0nYDgQmiJ{Z?Cj0kFSZEF)5OdC?!K%R4`hGGFtxtGyvl8
z-MZW=Uk%E{jiSMC5X{+bZpthOJEay)7ERZG&M(^sVOkptGkEKkNPhWzqixZE8t|K|
zNoW0Ub~V3jqF6h}%Bjf0Gg1<oTSQy;#kgD6B~^+w$y%ui3G+`obQtK?4v7hs!P@VF
z&PxZKs9|zrAMpTKo@%y}C0?UCDoXU0WZ8P6Z;?jx#{0<4))vk<Ffcy?NUyOaDA~)j
z_WQ(;eiFBg_px{ZAEymY<%<C{l4()|zbGEK1!yGYy#<KYI_aBS0RRA>Tx01-0iVh=
zC`bTnQ#|nifX{0>O#nb%nt~Sq;9!fV0|01<B{Bezbo+nn;{N|l|D(okoKUXDb~;FO
P2%xL|@>#v+tJwbon5f)6

literal 0
HcmV?d00001

diff --git a/demo/documented/mesh-generation/python/plot_polygonmesh.png b/demo/documented/mesh-generation/python/plot_polygonmesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..3773c68b5eed313767f8367b390932db77e7866e
GIT binary patch
literal 15635
zcmeHu_dnZT*nZk-tJNAs?W!tj?-8?Aql%#R2t`pvjF`3BqO>S#@1jPFAhD7dMa@L4
zqDJf_W~jYA`8>aW|AO!H>-%-y=XJ(?U)ObC=bTT5Ann^X*>3^>fZICHG+qDzmn{H*
zONrE%DPPXaKMeo?_W?Q@PfP-HHgY$<tP8<CEVU2L?2zPy7uF^rdi=PG2WXX#_4RLn
zJk(S4(!UgTX2-|JDL)4aT?9;C0s!76-;V?UwqDb#Q@+Vi^8f(K?2+^Uz`fh*)Br%j
zH6AL!JM9Si%Ya`+PpB^e=7#>S`Ts{N(|>WYxPN|jvUu$x;P6;+;}YQ4#e;CsNZzZv
zp03#Ixs7&XDlbHo*7MCR<+&xRZU6x8-hr+r)Ez$Lz|m2@)>zTowx~TZH)0S_AeQPf
z;PjqAlwo&(C><26E$dgqF*buq(z*nA$;qUy9gJGEeA55bsU~<#&$560&5YCS8Y;ly
zZ5(w$;!SOoGwkvKF)CL8&t4+NdrK^z7Gik?@GijnF}2+-a^Z19nvD;f2^hXg^qlej
zoGJa%gdQ+Qr%>(Yo9-FZxZjzQEnTH!Z|*LZBb;`Xs4r>t7Ohof;Q5SQh#IgZpA!_i
zFr3{a(P&e4Ynb`_a^WB3L?A@$wL!gE7V2Ob0u<D^dI@m;QChlPxX(qiY1y}3X6@1E
zyz>4Xq<c4uno0ws62#d60GLZxXp+fdu1V?AP0X2ifxOabIVG~;yLptFtXpYYQX7D2
z#g|g@?ItOo;o3hhfACEYjF3WA)@Q%*3YDOppJN!KA4Oh`!66xRL|;mJ&U8xhV5M7w
zY)wJe#ea9PN$zkoa}r$=!I`j5P&1Zb33irA22oNs_lkOB@okJtAY!8UEkQ-L;QNlc
zX5bw`dXDE2mf(*BL%_S)#Vuzx@Jm5}c}?)ncX-<0R%vnz!+gqS-?t9{Kx<#kxIkJP
z{!ca`E$!6x2ONncN5$KW1I1nBEEV6~q->s0w{s*W{U*xA6Po$YSm3u-KS#gc+Z9$3
zn!_D+`|toM3QlD?+Mz`ELlxL}Hr3RkYu%kDreThVS0BG(%xeF=ObnF-0K$Lujtig~
zX!|~;Ji1RkW%}Fg7V0hOZ(@~J3KrVpzVTBvEKkAsG2oru0<UeE9T}EWYA0_ZAurF)
zmX|%UJw5T~JjG85LAavJ!~mFU&IvCF>#4fa&leTNF<j@{Yci|6*);tqcUDR@-M*QL
z(jp|1UXeqiA*I7k)h}=L=#}PX{SlV5W}wFvO^LnO9rfj=LR+D3i54f1iL$WAudQfI
zBR!?Z*^Xk%J9OCrfM2A)upv+N$KxZpM?Yr9!)@tr5gJSe1&!-pqzwc=Z+JAYoElHT
z&pEF{v{r!p&q#v~s-f`w&>-cM70$a*;}M@cA}+1JG!Fpq%9d6yb37K-4aZ#7BB>mJ
zq`D1;L^<xj@oaP@+s;Gy4LGGAC{efJjO2oYBq=+t*_!+XEA-RGq>Jr-^7ZH^r;cj-
zDN;g6>`Om&?jj+UG^-GsSxk7*6-jpH9Zzmzsq=yu#THjB007mP>!B<AKK)**VVm#s
z!#E7qEpy9f4NC~CZor{i+U>SHzLXUd%{d+3m{-A~n|n1)R!ZWm5d)&!?JcZlw_dD2
zT+N{nK=A3w@sw*+9;@FAqZYTn&F>!Vm-<Q%c`63U#Ru#|t>2!+RY9>7daxy(2E;3F
z-iQH9i+_F+7(CxK(nwhMce_kd{yAMofrk$}vm%bFfjds(DSr&kHLQ<}=cf(@K|8aS
zi@E0FR0sx2C@1ZxANF%jU>bPUGmm0+zDZhp?dP7K45W7+8q1Ifp9$MlkQinoz&rVE
zLG?$wf(D^!4!m+D{`$*53ig9clH2*z?Q-Mm+&QlT0%^E;B9G%y)je!^tMRsBD8Ao#
z?RSf6;_h)_{n8nJ#HdA5f{G{&Z!jeR+U$9-ALjKw!oDIHNTa{XfyQNU{R^j0_B{m|
zPqGXYDeR{Sx>>+It*KKp$@Ya5FLdnj*+^eY|7vb|zzO67$6Ie!W(s2Qfx<ei8cbgW
zOu1y3r*`Y|5@>S?$;jdGC&)x=#UdI?KzVM>9u!Ya#vm)$+1az(8EZWbZmUBLRvt55
z0)*w$9S?6n0$!)pfc^gDi8OrlHy)LU=2&6si<;m-tLPt4BIH_k9)nn&sIn$alO|VH
zf^7)1J+Kmc8)%?HI;(N;W(5Fj=do1=aib>uuOA;Zc_BBPCZ2EgF_?oZrdW9I84z8a
z%o}B5?_LHp_4KmM$F7bx>jwr4tTxNv-8ExB3)~iJa*u5g1OUQ5C07|JBug}_|7~8a
z{?2&ECEgeLdP0;0;qhgs%r=lWe|wE_HpcWf`G$in&#e)-vhg2v2Qu%5T#rbvA}S<7
z;^Z0tu(@z*UIG3(C$35Bc_u9`aE%xA6vMBvSCt#El^$$}w$h`gM9+K^JuZf2a~B~4
z)qw^ot~T9YHo&3$_mC--o1cXN01=>gBw}^FMWA{bGO{6Q*<#F-*9DZWUVq&1Qg~I7
z!(&h#@Q&rE711Bvz^fQVeHA5jzJq{!+2)PPp$+QZ5pK-73#>mGr85kAMS*=q3K_M&
z98YbkUD}taaewp-E>_Y!diV4*RI=s^1<R_uw5a#SSS7_p8s6asu!_Ayg>GbCycHAp
zD`9$8M#=mV;GOy5t~lN{?La<?jJuCe(>3?o3sKyO=s><(`5yEM0C?;bhS1X%l$f78
zHK-9Z*{s3tbP{gqdDb#4UAAmhB2}pcI$Z|L#phh?-Eh%|*KXbA%W!fQ48wodZ`w-4
zETM|V$CXKrcPYcQ#ZlX5ghi=IAwX1qBIaEE=KQdLhg#y!cqn>3Pc;heaQNCS>F$4<
zLgNw^S{MxCFVW~o%!GZ~o@**m^klpJv%XyZZO7`E3}~Hc6dnH`vSDFE!JbSZZl+_J
zJhu*J{2PVRURcQ);mi<ps9&c)Y=52|!*N#ufV7Y?=S;}3e-evkouK!05Q934Fb&no
z0ntO38S5eWgbL8ut$ljWzJbA)zg*W=7XQ|*ke4-|l#8_ZWV=3ESUlQnv&nTrqKHZs
z?t|dSqd-HZe@pKCu}%sQNPMqwjr9O+y1?ID&}%-LhYQyMTX$96Tz4J9CLSB)?Gl;r
z8jpUsdGt3svyq7@PL+o6kZ&24Jf8u8hNBd2;)eRsrpikU?UIKq=Bi$EWH57{8vCg3
zKl}NHa$ys0(f<Z#&ts$d-WoUj`@tJXdB~j=tf~u5@$1YPT$pY6;fB9(^MBy%*sAIs
z<;T_CVdDZUmKF$cdP>wvt)4tGJ%hhk33=^yUi#YiXuort7XYB=q;D^#N-Iy%g&4#s
z7H3|JDJrr+ZE^`7Ge~1a{@<x9_W{4wa*mucLo}+Q{7=+6)kyUr*^V#RT^RdKhiwXO
zV}7RJC7O{{3MdE*#+}|8k+=3%_ALJwrJXJ~#U2m8hAD1?9}izr85Q<RV&nO*w;YDF
zuk|6qF9WRgGa&xlSF`6myOXy^!uM%nRS#zRDRTa6hxngx=~(@v?O!(7(rL@&+s+6K
zk|?5CxOZwGin2tcBYx$WQg;3>$*ybwQ46!kJM#0?i0c<LZ>X>$kK8!1fj=M~2tP*-
z#}<SA&gK$3Ur>hkrCC)n48q;-$=}4_F=nKcT+LIT^A*?EY$JY_HPdeadYnWdY!1#~
zO4voHV_ulw4_PWxub<d3Wtg%c-bG8_fr;_SrSz_q6`TJ@aOW(m7=wUR_n;7@*Ux<H
z4Q>dU#X0`yYMhbi=PZur6rH(rN|}f;uJ-q3M|lIG%8jpnuaE9mPp4+B`IGMaq#;#7
z$Ag{zYxg(K3wR)e5ovI+)s75RF&B1m-cdsk%EvZTa*p4mC}{==Q~>~nKHJej-8l3X
zv=Zi!7ues~msw`}QB*c?P4H#)Ae%@)zGCE>*8nx(S2FNITCXT5-=HVL!j)<NDgJSo
z;DhkDXW<WlBI9c4cr}D)E<>C0n$vrVwxAG#y;;lF%EsJ1Ccd8ev9M$a$Q49i)lT#u
zBNW#By;<u^K|iVdZE(?%t4+i7c<95KAZl%5LamQNc}aSIg_hNd()KEB$Ix(njH372
z1X@&UWLehtp~R1UQT^LGOUtGL^5(FXv`SC?$;i_yfL|O(DdPfIA<XUk#j$ZuV(Kus
zp5MdTYS}zf{4xNLk#qD}mZ2&@R!aHETGc8$d(0#BjD)d6@r}I<x9wnhv*b3K_I-tm
zq96vnxA#6(>I?7emMQ1CL>}1c(kJUeuV8$Lr1h8^{<}~0?}9D?AkagXjCQvhz${X)
zKHI;YFdV^TKyYM3DK~UX44m(O4P!d7J@Lx&U4J0}AntRn(taeFk*IQU$%4KTBHSPU
z!!(hb1didUd!yTm&@WX60AAxR?#+*-CHf@1E|n~LYkDDC#YUZ<>rp(Pj}esv3u90e
z<+9X7PYgKelR~pkG;8p<J72Pfyzn!#eA>A_d|QVmwzr3p4<58M_Jd!^lJ=zr3pIrq
zN2#M{XZ-fzC257H7B#i?e69qlAy*3BN=3IicpzboP98Fo`&y=6W)9lYJB(v6M!UX(
znK*W<>wtHBE|G)NYEn&AV>X~mN@)oKTrQE`{V#_5JXEne6d8`m+++ts>Sg%4XI+03
zll`9-9E)UP<ge;CoNYsO_@e*-ewP-9e!=8)HvPr<AK5zNpI3B#Bo&2!o^V}_WmLU)
z`!ZnNXM0@W<3GN92QArQpRz#!wCXeDS;!kP7_CA1Hk)W^Mu`&uK+T!Q@UhqI?k$y~
zEcuLAZhZ3lF6SpM$a#_cv`zP=aIu5MlqoZGa~-AhSJ)|@VljWroqF@jDqG%+<BQdW
zJy-gN7ou0Y<E!%3bXfUY>>&YXEFrd#qfBcC90ebGkL=3Aoyud4{~ZTI4!Y7nl4q;z
z&3XhWC#ZdM0CIQ=Ng+Pf?npzmG-1u<V<pak*!ZA=7s?sa+a5=*kAOnAaV?*&j>?ns
zt^(d+Yx<?Cn#{k&i*r{y>Em-Z2s*ZRt#(}P%=xEoY-(b)w?7CKQUhN4oTIf`8BQG3
z-&g*4HEt%S%D$52;ZM8lA$9)X=hpt6m(8~9HkT>8(Cr_;S{mR`&op-HOd!TyOZKfM
z)2I?ERc}5|`g(uR<MCbCElLW=3xpS(b6lLgHyjTdmdln6Af!|(jTpKl>$+Cwu&24C
zmzEY2wwVBcZ%bQij71lqyQK@KgP`@Qe|C|L?&l}w=HjBh8;S&yfA_9W=lJTz7x*VU
zg-pE8T{5)lgqN~?MrB^Ax-!x(@r^<1g?_rFrzHcM2l$jGR17pPUjq08kB)y^s2DMp
zhd9iZ{N4CkE;9Zy7c7)3aAfIh>3(Ws);vD8XHZK|sV)+NLmv!aKfr7{VG-)8b|Hy!
z9CqZv6}kG9<A!N{)U?~A$^%WBOR7|Ip0mV+h`*($$C0#WsK@5#@O3ngO`no)yPV0!
z#X5G3nYufd*tcg3IMhYi1R-CIGGne|wCr3L;^Sw;<UkMUughVuCx*{aXCefj*9}{&
z`>oguu%G^iNrHz0?mQ)YL_T1)@p9V-gnhI-(;TH(&W*nK>hn(g;Au?d6=#`7eA#9;
z;@`q1@O~uDG&q+)C0wp)*7&6oIM!NA^9OmkE%Rl;uA0e3MC>hq?)KJZJI+Eg&q?^a
z%?S;f^mx0r8KzM8!Ec=+WI#Lm0cyYbtY_NSV9TF~+f2`8Z_-htj|!zd(RUdYY4A6s
zc&QXLElzqP%x_JB#LqtSIa^g+Awr6rYQ~-R<P|9ETdY-BHQgxo<uUPN7fxAxcic!c
zTuH9O>WMA>j1-EPG!?PH$z7WB^!iv?WLxl^oAnG>Xe?ig7O5VcHtU_8+X{|Em(Qpx
zDXB;+O(&iJ)3xB=kK|2-z3C@U*LhN?-bE<%uF31V1{D{^Bu?Ob_=Wmt6a_E}{&FF?
z7sDHboAY}^@%I?lm)tu=R>I$Ql-pM*Q~hY^>GoW@1lZDoJZ!_?2dhqdQ+ZBXvE7-k
zaoi`hI*A?j2k~GPSyV;Mk2vR>-2G#toy>gBTA@1m>UZUgjT@MB2e=Xrgx<M4cri?S
zhOIb7yMxU0BO<)2tb?*>QjF8_%tQEIf+zG`c<eW`;J9X0Yt)aUIjmWUT$qpz`Ejmv
z(7b~fLXVKfB@-@lusyJ14H$T+jFaen8thtnS|%JG6}9b(fi*bzRVKSMFZ-n>t6Qwv
z1b~SrO9nfbiSLVXWi3pL!_O#0tloa}DXdtD-imtbU@677;^P|&z18RBFRx2O0)H+%
zBp_0V%b}@kw(fu2+QYFFdqA;&*$mKf%;K$udJ6Wd`8emBwYFI`%CU>AEFbeboo(g5
zAfPUe^9wRC)KB)LuTk8a-_O>y0>q?`|57}Sdd}?=r=xL}U_>3=CleRvNDz6^;IHR&
zLFGyc^5a}1169>YnQ)@O;0OGKG+^5KULMcKr6h~4M5%3sBvFz3sgOwK66D?~r;8q4
z1S)8QoKhnq7Ys+so!H_+R_cMdQpK9H1?0kjs~`Ru?TwRp=etG+D@rETr(sXiy0+hh
z^c-LL<%nGPh@?U>PbkjcxYqsL75*SCFC`@trDm^?-Iz}y&wR*O1?efyUB|7`BCSaT
zoBS4U?z3qJ8~J$I(wIar1}OB%vgSHuO(ltj%V>X+G?5Xm6iw}=Lm+f@`BcBc!x!Sb
z@_=A%=bYYY_^*m6T5!AUPkV_fx;U+qz11h?FXbM6?KWhsp*l2ee<s44AuX7L5f=z5
zgm|rV!3`Tej7DWSrR=z*g%4!r+xw&?kQ|CxBU>>}k?u{qr8`f0GFt0{9FJ;u1r!iA
ztoA^rIl3NR@9(eg-vxGFN#QvtyUyJuRJ+>LR4X@rJO7KTX$2xERc4Ay%@J?s<BY(P
zx4q55Saz3eXs1`mgkRV50E`lgkEC%T>XLC-3ivjou?hX$W^cI$@x!3a;c;!8C-m14
zdvboyQUpe*IBAHgE7K7EXPmynK(o?ulVMd5XVdiu1J5{o_S#foLF9D|GB>#-Ga1DA
zkbcf{`JSzf2uozwb1Xd9@@l9KW+N@{WXN&M5qf!~4nDOz1w372d<y&6+8z?E*U8nN
zOK&hq7DZntj_sV**_4Www(n>Fb1-ASnE>^V(sOfq_#Y&&BJ8!6<95Z6;ZAaL0}rr#
z<yBRhGD@9Co9y^p3DNxccp~k}QZbqj1U)iF1lZ~?)kj7bn8^drBgt2{)Z!8qjUW14
zYvM#4Wr8fn+0J)TeB}$c{eOzy-TGocC61%94}{Au`FTVBO2u#cnOBXGXAUI_Zs7wO
zw2zxl8IRe1T?pmg#9iIx&1?F#W2$1x0PRLTc9pou&0PVxurXsCvgStrvF<&wL#c2#
z9cH!6&E?&sSRh44F~zouf_clPm|cDGVcT<(0|6P!c<J2~Hi2jR-#gohn|#{E7Q|bg
zyF6vq<eNzvSe>*_bqMFXHfM?d+g+&9=R#gx^vDlow*Gso3F?<bSD_;%p2doa6PEio
z0W)9JZck=O^k12_8^1wQiRv>uWF|oUYD~t0>ioRJA{^BN7i;&nf3(h7-tD=)!aRwK
z$8D#E9G$u9`Jk2Sr0`eX&Awc#>CtSMT#B>vK<cIJwWk_4=J1ON3JB;{;oi(^Q?hLN
zI{rBkp6<Sv9S1c(RXQk_54;DS5A>Qlq$JnHJ&cRIQ{)PK1M*KIT*iFj>s{zSxs=(g
z>}#STZlc_dXMEhp%x*<ilX=3cgl;`U8lH|X!8;2P(xFWa_h&?-Z$e)E090$Tv{f1S
z&A*t^5@&@97mUS6`=f{MYvU_rhu8DW&_~bD`6yOo(ZEMCUI0Ok{c8B-{ZS)tIcPx|
zQ&}dpR#VhRDel45I7d6R+YGTUiay<Qm@jo}*K5-swPDBpc)Y(qa*vR6L^1X1@3wWX
zs%FZUGzk+Hy5K;tMSjwly0&Tr(a()R@A{>gXAL(e3EwdGtQws*QX9$)1w}H#e{b6r
zM;8o<F~vHBcN}@9v2EAx!B5hxmcn?`7Co!czfqhZhpWz+6Y=MFF8%Vn54Wx<9I2E5
zUnMRg3z1E)UVv_B=*-(ou=Xumg%2DZP<L0BZ|a?Jx*;JDT)K{Nnc|F6u(cS5Qlvc)
zw}V|<Vb1+E#tABOfAn(l&qxC9dVV5#)9m6ls6|yWi&W-VJDJQ_jD$(R7|Y6$PUi$;
z|E!ncs&=KHkn$wxddYWl9RxFA(D$hhourzP7&lbp47qB19a{5pnyz|cPB|FK;L}PM
z7Q-3#dyP?=z;*LSe`2~jFnVq5A?9ua{m$f^f3@dvaw*Osj5Ccl@$oxz32j5*4jOL=
z#O4a{>e7*j>Uc3upm*@f<MhWFqv4+nLP8zBUtRV|bA%a9J3@w5`WEiu*wZ%X9Lv`C
z)so6D|FRxzzdx4NHPEKume+%i&iNIu>U@)=n@vE*m<0O=(`qAu0_*9c7w>lLP?Zzl
zw_@oxbN7xRwDRejHp7cg3~VFLAb+Xc+Afe+RyuD38sE2m2bx(sqB;u*efqW+SluLC
z)*D;fn|u*m+CO#GI^V98dK33<K!c1cxQW*A;7^_Uxp>TrEOTZ~W~SJDBy!3{W+_IK
z{gN%uZ!v-VmO;z)zk2p{7Gbh#CoHS}9~yL7bR+19!;?vM<&;AJ4oo)2GzOw$?>0YV
zW12ye-jeyeii;cx6`K%EU3O;zgutzqZGzn2yfQD}d6=+3$Xb<X&ys$RmW*Es2@I9m
z(V}hDE)#Di-+c>|q#pxDL>2E-8>rWtPWI*<VrW!%-mSmQKsH_ie2`eR<2L>h#bV81
zxgFA^B*^u}XQ`KQHhg>P`9N23#{hN5o0-2zE&Ox!pq*W=&`|yRdW;SHXs7pZ7BPX4
z2}wZU)!f(w>v>%)3pz=-FQ!IKTsLja7H{J(2FzcVa4`Cm$IVS=79F0jl`4eMdD{>-
zSK;A|!kO=XH}Ye$yNX@}Ux*2>8eDpr4yok3g+*=!b{`Km^Gv&zT8Q`SwiNe^lv{^=
ztUkSQX%$N`0;!@N`3YCprh%*79{3K5U0?aL&^cx7&(vlH<zZ%KTZ?zU0%#fPD9u?V
zpzvQ)11Aef1|83!>Hi)YxI|p!uBQ8IF@K3nHeYLdZ~UJx?b)~T=hRiTZ0M{+c=5X@
zK6Df>DKE**pen9rwK|<cAJ>ne20SHe4z6VuI-H{`f*pYZ9CkQu&-<LxMf%9)W0Ye9
z@B&<flJ@IHr|Oi>##q0$dbGBxLz@0=bN`eJrUiSjz9zVN_^y^_t~CZC>g}c?O^5Qq
z`U_is$$4dTLpZ0P$yh<#d;=Q-Z!>9t*o-N5&bvfnrfhzK%>#Ei45RT8ev;4{N$bJ2
zD@Chy6W5c3<3<;kk$+>$TL5$#F3Hx2hKeM7#cMW?U7w-x^qZd+OP_}p>xXyHWGha_
z3EfNMqq|m|Oo?-WaEBwKX%ODw@F{j+TTRLB=o_LsPfawqa`~}?;I-T<fk{$5%a;kI
zRU)3ND70ItHI2F@1Nxo27(@E=)*PWzwr)902J}hypJDe5pVR||KeCm6=NWEI7+bMv
z^tdC6zz%rS8w5Rg)_#ld_D=#syjynRV_=X4jKeA1*=<LSi>3gEU=PrsF`$^12T8Ue
zhgxn^Ih8TQzVH0uioB5zGps(x=hGA3OLF`hh{=5LE&}mQe)v~T`6jK*P#U#{r^fdc
z!kw&Sz3ASB*SiYne+Qf=Y$fJ>8Q_uLfO;t==w+6iQ+bu-U_O^yxo}QkLBZTLA?oU=
zWc|;|vc_T$$=4oS7)!EA2$X;sF})u%z}U(V>h2cbsn+W|+IDtozM2-);cEmMo<MQj
zSjW~N{NZF@uJg(;<@nAd|H|R3`nz=EsEPTldwanBO;>wMDW!?frI_7kf`_qB);AYN
zYl?@=A#W_+Gp!XK714w{Nu|q2NxSF~P5kzcq_PK$@{OtyesF-qdbBl<*QS|wUjjdz
zV4!QzN9Z38k`_t-2Ym?6*-(12&O|9x{TuqR*=dR_eOSdmvfqO(y2s#MgpYE6GyAv2
z?|c|MChY>>B{(6sgP1W+AELxeM?d`QVz8n;ZIWVBZpwW?V$I%2w+&T)t$4A<h!ct&
zE3G8N5<>g*NvMX<d&X)K=5#XWY=rmM0oEc{Ko*?rI;^|T{~oek>U-@qk?95wk2bA=
zGm9!?P~i7ISCwhM8Ug^Exc}|~2&W739w~@MlfpwCfIw-MAL75&31wn$^VH)14D?m}
zWE542z<zNWK%0OL){Xp%AXl#dF7udS6?C8T6)eEh?%|3)X(Hni3wcIC;aOLn0aY54
zyaLS6Jr$0Mr{-fa)cpKg;+mx=!xSL<<39KJv8#HkaNe<3k-83M%{e+(e#J?P4+-Z_
zOjhR`Ql(nquy8?@vIx2dHW{!qT3^Nt$mcsCkD$A)ZAaqxd!tltnfeOjwbEszET=x>
znITw_f{JQmbKOg+SMowrqUAIs>B5kpQ>|2d$g_cn@RP=6zfGULhU~!-fAHj+V{qtW
z?$)8&`*CKHJ{X<h3hQ(_Md}PIR-9YV19Nb0mfc7kc|`OSxR6A3wl%!`T5DV+9z>L#
zJ*OvhI^AyG`uX5k8&ra-5NZ&c9s_GUTJyR0!!5HJ8U$A~_i7}44T9z(dP*QN1>g;v
z<5B+l^;?Tt>vI3n7V$qm8H?!yT?AA&vRKu+@o<>*Gqmv|wVO`A>!daYLgA;rL7z^=
zSlIEOIW`wA&QWcj!dLWnV%N4qOGV8gg~58baae+eEfiT(@ikTydD<!xc>!CTC?8Jg
z8FD@;Nb~ZXAQ5MprnI3)K;~wAq-EH6itFzKv+h{f&aB%)*C*<9pCExUKmGN4;ko#7
z29(pi*X=LMEc&{JGlL_1Y3&L`FD5@f5n5N+uaXLrYG4M>_DJ&lDb4L5R6N4pw%|7d
zryA+>toJT&65N5iJtBeQme|tdr~==Y^<I8egNcsydiRua6!PNTulCynju(#;CS0Ay
zC#O3a+LKk=IQMo({|=jwY~7SRhuS&tKZ?-4piZ$(rcbdr<Er+H^G>oi-9?;FZ=%>h
z+e2U0iy3^2an<xfgV(z7*tV;ZW#ywFd^JZdFI74+buA_n-ao2)KwNZ6T)m0CPAZYb
znQrvOOfAXe#&7=A4GPdue4uE`(zlZ_9+m|*x1gLsHe~-r8KR$VcWI*!Ub_Onvw#Iw
z#2QD)FvEVrQ#&Evr-y%93qUMcycViSVpk=(wpO<B$X}MsoTU_#X++HU>$~M+aWg??
zqx^Qbu|Ka|u!1#>j<+Rt-d2G8)Awkv`5Q8oW({HSW@e*lDq+akekii&TZirOR5RD5
zQ2Y!m>L4d1>cuTZ4Q|{WCHExZa$lHOY-$~x&Iz}n^o{N#|8q9-v_dE41hyWUfDufY
zRr6s+Y^~d?(%_HD{{~(AS_%y;cgLsNYLqQEvK`;lOHavzt!91?Z`(A-QCEG3;havh
z#-<?}?;C_QGXKV}+75JY9u@6;b$=6ZNX^-gX@=ZW7#E#-ZsRZhWhA`MiZF`qqizQ(
z{>XUUth6@VU|`tx&q%Ff_xh(&e;r}ttu23vRrWij`MSq%7$&*k*&lC2$As>*-FN4D
za8<C#Yvn6{%0L>rB-c!_j=GYxHSQz|)X$^w?R7|>TjQ8SD#~s8ZFx*+z=rFjN~zlq
zA#Y`}H?HMY|M1Mr-;E>wbk-<LRFkqEXA#XW8f)JaLeMGJi&&2fY|DoXRvC!!`aKTl
z7E@a-G=+U#H2-4b9P8Bk^7-$mhTX3@#I>(sXrO<r<a&(d*6)BWaq-L3+kLOpBKlv<
z_X+WWRk#*wSp)LK6J~qZ5m8^nczffCml_E#1m1(+drf0=wA4QMyfr#6@YWEsD+KY9
zR40lrJ8!K|TbCH}70@*a_u+{VVWAJ~vLq+b89SER3YtEpXx)IDjvCp;DL7TC>yhQf
zcf~riT|M+jCtwSK*YecNXzB%lcc2t;4q3)r9B$(>A#|utk%9vT9zieUy>Os141CtV
zEwm?@`MoI}A3jL2e!KH!y)jv=#P7#ZnV1pjUD2-7{M;{_ZAAy$2977|4M!Dr`P5gn
zpiTjG&rNQq^m4jBv4TfWsFxK+_>AlRw)Ewhv&|PqQ0@HDk|iRNC)V9Pz6bMsbW+XG
zuIMTI7+|*z^j}iO>zHBJlCvAngTzyO3p~nKV6S?v`Hal}#?Yj8oDDZ~)CBswy4w3&
z$Arq+hOMqaw1aXriLb7`_sV*J|2IM{5Ob#T-;ph7ythatF8@o;v0sGft8ZUOJU&+!
zK_&b)w?!d5D93S9`^KXyi3)X6x?YgA5dYjs;NmOckH<r$O(Mk~h+61DM0w+}(Cwf$
zP3v)OAdtG!_c}W7hf>B<IWpZaiyx$ioV3`xo**az76wNjC?yclFw5pR)FlR8zw7jh
zXB1^H?4gE=&u4k|`%CzW#~5CiL(9r*IL>CGJuYS)SKK2IcqZAsR>Qt(?I?I%BUI4m
zLt)YISoQApS3x%~vNp0nfWB*ITLPz>Sz(Th*14iCbQrhbB7p(FsJiXAz6c(TX__DQ
z-)Rc^1Qz61scLJapFM@~pH8oWc2;~@l$WRoe_2#6o+|7YPaWS$uS)~YxvP!KY7>?3
z_&h%^Om0|7QIK(QM$cw2w3aW&Ee%n{BoYHy^tFG{SCjdAs=UA+;robD=FNW``o27S
zor^rwG4*L(B-F()r@Zx`RWMiP?bXIAx|`hX7W4!=`<5n9m-4}e<mYW?<(%vm_{_S_
z%Br2uHru>Be%GxF=@0F;y7sMddb&x{$pSk8A*He!Ei6RZ$e!8@HLz86RQHm~crj(p
zj)cIey&$))xrf4FJE;z{l^3M!N14GXL8<kZcekzluGX7W3ukUbzpD;bJT5YH{)<o{
z^{w3>tNR*Voy@;Fm{jGm?D>SKE&C8^ZTUBcEJHy*&!wd~PX&q-qkD;CvHR?vY3Vu~
z`3o*D9^GbxzhzL6?xKWp-C6&gdIRT+_XW0VOUuC)EteGOFdPSOzl|@I+5a3`zgT~_
z)t%4|+E1SHgMGbAryUwqC(68zBE*w-7bMv9)7O?>1wBC1E}6WTCLljA+IqqN<T;i4
zSY=jqNQvL#t2@I#In(-bqu|~xXbndIgiU*wT2OGb^VW3wS<a96e?^Pr{VM_`k?r$L
zC|=NDPB}?JULb%N)Gz<6!Hu?Z$j$<<k$Hw~>8Fh*`ZFumqGcSek&WV$=$nWUxT`^u
zpI4abWm21E!BS|l8B22#46MK<JIhs|SWGH(5$mlSNP6{S7bx-NjmCiLfEMk~xx+Gw
zJW<>H4R2Tp=Kc8O-u}TK-}BPPR15B<ocrnxX)Csn+TBvl$XqqVkEt6(sh_K3x&lxa
z))R&Tlaj}@BVRyNH2C<&bLv&*=gu_Fw?t_YR==by>eiNtHzrTSkbQX#uSILl;c&5s
z^h<_0dk3Xx<Tq-Y;+-e=(KZ|4=OdjK(h_OCzbTBxeONqYK0f3Kk7FtRLC`*UaVXVx
zV=T>^M=5ilrUE9K?&!*90bO%2^h@gog$NqFsraDl0+a`5F()-QrDDj64Z|x3QUbyW
z3TG~mKkkKV92a2_6!{M%u25|WQWZ)&ija0nohHM}src4Fh8nL#b?3#_7nTgZum+Ih
zR|`LxrJYk>>=@qcLIk7MDCUcQe2e-rCuVIq0sD?o1I4P?ls7KB`v4R8(^^Cu|IGX0
z5+l+}p55=IkFp5HS6%hw{_kO?JNl)P$WEu_p#nLY`ibB0P9#v9HL~f`Nw(jCR=}O*
z$che~_778v_RZ<~$FHvUO^IenI3_L29o<ZcLf39GDp0N$9IfQ!q&>yOWk4@R4h#f-
z>MD(UOScJ14|3LF^r}yK)(LGc-uON#a2%9L_>a{`y7_sy-jS=hRQ_Zl%M*p<h|O&c
ztN|i=^NqTN*TNro(dWxm0i}|+QBG|0uV4xZPF&m{b8D}<)I-cv6=oZ^HHZ#C@mpG`
z&smjd{;bB_>rJuAn+#%4x2nZ`&5|U;GVTa&Np*;3kJV`$1}=&oT&eYJ3-F|+Kfv|;
zs8f2oQ>uG=*&#B5*J$Fl0M_XQv*uNF0}-7;DpQl%YjM-9ElmD{ys?3Jz0g(qfM|2o
zw^!60Q=_ak^)#*Ixw<pG*h)x9kX^k`|12@0#jUo9-jWu*J?^);9up#zjp}=SKy*Nq
zgB!*an%fLUTAHr!A?~E`X~wmHCO&B(%onWijhC$edP;An6^)!f6;U~8EV&P~T9!n?
zQGy*f?XVY8A5lylWRT<U7Rjjr2Ia<8UYJL~7<8mX^-~!6RwN;idt}t>vZsWY5beYz
ziUCORSewmTIGG9B1;_Cc=0qjr-)B$70+)T;PFEnWY0}cSZRCD3RQf(KyM7rDQ)@yS
zTfB)|9GE`KdBm&XU=r#IS@_sD^IH9{ye!<!iV6DSW+<;lSDG8}=8{4M2Fuq#wxXq3
zB>Aphvvx75e}JkHoU*Te6%P6C-P$+LvRZWyi4{XE#l0!JZVU#Ab_D@Ns%)fc$;-)i
zOGDt7hl112Q?9B*=kqP&JgHa7)iS9SP_%9;CmRhPI=JT6H=t~97y2@?!0CDmUL)w{
z11fR!lk^L}={1luwOr9pZvPy_j;XYH07?U9F%zoh<}K!|sts;vI=4?0^E~E;x+C<0
zn&O%sNPTfmbO*oQp-t7w`IxpKqf|YbAfB%&oI8b}bNmxeq;dMlEIod=?m6nRQ~SKH
zba(mibz?_(60pg?QY3pBQaJIOEa=<qd0oU#)OHiZ1*%|GD?&;Op<k7oL^-{BG@w3v
z2J3v;HlB^cLB=?6XEBpEzMM&HVy6X3my2bHLU{c<??oD9OU`RjbwoLa{k3L2eSQg<
zu401kDjc`*!s87CfTvvpjI+Z&V9oq*;u5^MRkL;5+J(&0O*5)V9LSKP71$Zs7<#y@
z(LM0CpZ~Opq-j80oabMiH}gjzHHQXoYZz|W+_6#!)4E1#O3Ph}(aM{UMa4Ba%Qd+3
zSzFWoq*zSpuSiuRf8O)5-opESe=-^mb9$SNh}R2p>mys2Fyu}-1g6YCrLv6Yl{i+%
z$7VbE6%=7sF^p{bk9V^z?hf+2(2aU_JN*DvA)ECcxeh8q{j|DOYd&!pqMV+C5s}3<
zX@CwM#S*NDV6V^3fB$t2818g)W;0|lbR&=PF`}Zryh!8w(TQxpJ9SP?O6jmIsZK_2
zr#9hkQ`RL#gyqi?=$nZKGLsbkkX!2KO<rdk`uCo$1-j3D#GA(>9cMR-k%eBvLnns9
z7b@%Ihp64L%#X`WCUq0%HqDrq&)vY{lXoOqPlx}UUTg<;H5rPd4jypt9{-j<st0TP
z=Ck%wGrb{cKk!EMFY)<)dl3xb7`PoT^dXYi1zHZUV!A38p^G?DbO&Y@&Ah&5-*_3F
z-u@3-AM&)4E3EDY507r@nON(s5At8LE6Fkq3yGU6uiqxk9+yD|*Ap`TH5Epo1(P0G
zDoSVlf{OtCUwocjq);@T(5QO*$mH=ssUdt#2iz$lgyeR)NFURJ!jIy7GN6k30`K_?
zQ^lmRj1*46T7QS)%7!oXL;7sOc8?F&3%AUK<jf|k-5uC;{IHYFO!!~E)2uU8g|&8a
zMq^;2!6M19PeIVc{G~aL6v)~ICh2%h{b`3;e9@h7ua<5)2{gOh3cNUuoTcj;pz=^v
zJ;uEaeY@!sos_ueS+C}1e<(905;}vT1^0>oo#v(J`Y)I&5AT@LN_%7UdRc0weki5S
zq70#$45}!ISJjQsyBK~Mw9eAHHCwontKh%IU+V@gttM5|!hJ*INB1F-6FZo%)@+X_
z5?RfFM-p{j{#EWhy}eiyBBO~HCrf(`@{Q#9s@{>gf12sY^^wC-*X_SFH^5#czHnUu
z^!v(@j==(51Q5Z|g-lN}dQ}1TajgG3bfm5D7ta*Rrt6~R$AaaDJj6X<5K)SF{UAh$
z{9)wwOjwmTLbtAGA7kQoUPN<j{i5cy$0dlS%eNJ^2nqnd`Mcr!2DUa$pfhUwcSBu)
zl;9|PVNoJi%*Au#TvUG3EgdczKOiLa^Yz#G=(Z}3J|1|*gHt-Nja@icgjEDj9lqqC
z{u6CHa{h{UBD%Pv%4QfI$C#&)B7Y^hQ9->k!jss1H%O0qH|X!@LkX=4GUK&54^gb@
zX4i2DS}A(d$hJ_5$CiENxIlUkTejzt!_@xbvY%W)K``aYRYcy+W$VJLffEAiHG?^c
z4YSVWyw|$Zu8ig@#w7IJa@M=z%DU)p(!hI&TsNBNb&}*R{S>^P%LK)QrCER*IPq5Q
zaL>XJRrGWab|}<T-ne-fx`AMOQ;(DX<Kwd+RyR3XN)Of?6Km=(-8tZ7Y%h)jcYa(?
zQVg(Wm#o~lYn^5{nW?mfhR@M|{2-@LTEh5Y(2zO>)M{s&Jke6kE0WP*pq<89aRxAX
z{$WHTV1<a9FiF3ZQkuD;^r`)C>$r7CrJKWd+GO$0y?}9Fd1Z8h`WhE*A~h&a8UQ6P
z(;$~&y0RN$o<S;S);R|An?T-3P>)1xYD0goDP|DSbXJ%lH)A?vBw`ayuhY;poY`HL
zrmcQ)uiS`zJ*A)tEn>aD=e6<E##WSY+Qr4K4-hg4`Yz3^A1U3O{v`I7e7YbPPRp4a
z#ps)5ee;Dt89FmD`ROZ-m)^r4DwPPnKs(Vs7@UwWLTbe*a5<M?l*xYU0p3KkR_>$0
z+og}6>A@ljf!!6(g3ofJasSrs$$W*<sRHPVY%oebOfmJQq%Z41nan*Q#l`M{z&?K8
z)WO@4W}?Z`TyJ3pPZ<y3+-)H`Q2wQ<b+Vt>;&cq2Y%-SR`F^6jiXXduH0+n_-*B<X
z4>d0W-v{$Q0By2&$*%Mq)cP)ZD(rVOWmQ&OJlA`^XpP5-SD3n-a{A#JxQ9y7fcdy&
z8xf7$7rSRYQt9LOaK3^FRsD^N!ysedHw(U<<x9_0?DwG!#-iDc_P^=A6?Tfv4j|37
zS1M@-i#B1%Q+G9{Fv+=93nPB9w&;)oMJ!n~(vEdSS$x2|e*M|_3kYUAe4xfIfAG^s
z&^LHp(zTyZjBfo0qqJto%XBe9+hF|dR%j%BxM%Gq5$9wlzZZBq2_DIO4uPy}kjrrT
z)SjO5LtvF~&Xt4@Z7|`_VZ+5-^CQC^-Myk>YPpYPUdWSwitN3tUoo+~%h*lQLdZbC
z9c#Nv1Y6pj0DPkz;cuLw+f$fNvAI*mBSzR-Oe15lb7b)B=&&lu0DW46z7Kqpfs!&`
z$yuTGN9GL*sWc3_K55}^3lCpj9W>L5=2%3Oo8G$^<=+-OeB!^7I;gBh>dE(?3G3C&
zbsFhtsRU+iUMqxu4o`pD^p?+>tEl-2Xw7a#R~UNCaUNtnfU3##Oas-2B_z+vD!x$L
zdiqn^nfR5!-R2&!slRBcebs4j{Z<<7vhvUkVaL^P>ZJC65GLSZfX8=x*EjQrL5sUV
z9zU!OYY}Xmv|Q_*ph5$l>7o!aQPkR5xA<W|3H(ai)UatZ*`{xVDXK#-qq!DafZ)h=
z4*<3~d8o#MSo?fmO?W6yFv`nZA3*+UjuhXy%X^@3!R*GX33CEWqHGH|GK~UR7kNxX
zFef!toVRj+3{S5A+FMDBRERWsrM0@=`it%^GEHm*nJ#VuVhBkK=yO$XSkrrp(k-1>
ztpQys?JO4+h*81|_DrF%{vy#&AJL0}OBKh}l-h(Pp%sS3ZZMj>`M|AG&bW)=gv99W
z(*MP1&)<#B3?F?ohg@@33$fFcm_P8QIzsO?*?zn?n~tUxyE_pvwHosvory0L6IM;X
z`26AHTw<zfK!8Mps@<FZ;B4vuIo;qd3dB@~Zm5m5nP9W%fYa&vm9`-6oiDHEkw33<
zZ~M{g+i_Y>_`sBA$HXRmS8~}re5@y|0_;#b%tsT=ON;+K0!i~OX!^F3n@!_l>}28V
zQ_Mk#*m+QQYuNM{s3dXBvqUv=R0NWGI?XVKGJ2K898g(1_suhr`qEM0%2T!=zZizP
znVH`kIVc%7{_qKqxe;dRbrbV8Vk#Hru<!*til%{eM?D*d_rn}4-Pk^8WF8$amsz}h
zFq||TUo&x~`w@Bb365qyMC~-f$x1TrOJljmLG2bA>>a@sfv?_F-Se=eTG@cTfmxf0
z7%PX4Ye5%tMkbz{sgF3(V<CsjzcsaoZ7is!hitki?%#6S(`>TyB8eH(;768&26>l&
z=GN}?;mLoBnZojeiXD9`H@g@mu^5HS(7>8hK4(1n&GhSk&8M@yUD?@7Hho9=<J@72
z70^*9a}L22-`vfq^0n5Xgh!!c=D#!b!PhZOZNOnkJ1kOj<4sIu;mS*>`BltP7tgdT
zNo%bny}Nq==QR~}G&KFg)}Y+Q9wXnwZ8yp7E!$_MD9}Sr4V$?~^FXc9zW+OV$lRI!
z9Q_7-S^S#$YlnSh0iE|`89xc%xTb^4GjreR#TM})e)WI6Cw`;*(x)+{Y3UA@ou5?O
z&)2xT5AGd}v^Z53Uzo>bAg-4JyY20oTg(#1X8!Ja2wYJdm_n7J+2S4z%5K<MmkvZ~
z7^lplo`Xb(5|b-p!dgbt{Sm|eF8%bUTz)u&WqSt)Zl<+*2Ru!!%xtsi6mONa=?9hp
z4KWBbkDqmt$=}{O>^v&_;V0k5k#+N|!EXIx$%M^)3l(X4wm9lB=K!m;+1!|vf8g0!
z(KaZ1KWP{|icj1Y!)8W63vhiTHl7g4=4P=8$St9GcUe5M7+A_W+&r@R`3wgPM1}PB
zN9$AjZ?3@20>&Xd7qAA3g}ve0a5lY1s=tD{H}$U&8*u%C&F*0+2ZLh$8^YoyyUp9C
zlcBk;Ag({{SJV&RPEL7S$J=rSR>}O^r&ek}uWhB~ojBH&7akQO?zw)O8NvPAxqQB=
zGE6vIJTRH}Q~IKdHecK;X|U>*U$D(*+fMP!?}YICE^1BFf44)Gmey{)qlakfwXL-W
zbz~AM`>*Z&!<U2_k3X5^iw7n5^FwaE1ADgWrZH4Pb!y9LQrtV8z~|uZ0OU||159h&
zaZ@%IDc|@p^paiD2CR=fH|cRKx)|Wv7qHTBvUT^O<-C5vSlSK%IP{!PAZ%65@+ueZ
yQ(m8PMbGk50RRd#|M$rB|K8L7zuwcHhUd0N1=@evjiW>iKt~g#0aJhZ;eP;qQ%8va

literal 0
HcmV?d00001

diff --git a/demo/documented/mesh-generation/python/plot_tetrahedronmesh.png b/demo/documented/mesh-generation/python/plot_tetrahedronmesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..de9a1d7458c5106cbd0d80423efd024da5712db3
GIT binary patch
literal 21616
zcmXtgbzD{5^R*(~odSY%2+|?&aOt>ocXy|>zy+ndySr1mrMtVkyZIfy@8|sw;og1r
zo;|Z>&6+s|$;pVJAQB>e`0xQmLR?tk!v`p}4<9~8!b1VSc~K1-`|#n*2MJ+8rJt!M
zX}k_w;!|~4KAu|*QyiS+d)j_hJQ`gLc?tjhcCiH!Wv$3O8Lo2%$8p6a6hr0Otc+q|
zAtFK}!rVefT(*@S(LvBb{i-`}tv9gnWRS=P2uK{BY+Fi*i~@pwnU{r*34(u^l!G6@
z9&*r*Khiw&LkH=QB9bk1R(tv!F#_MEzw)td{dlRbHg{Fsazh1txh_jY+@-SIlt&za
zECU(%EDCWhBytQ|JI9FBDH0RJPf!a#fMJFW{DcDhWD_jk$gnndGpBhL04$Ek2y#d@
zcJuz<;!;`Y(JTLL?r&+H`U8La1T6NiT5IlxfxMS#P>+mkI|tY(uN;mQ+N7W){6h!B
z=V2)mn$z)Yzaa-4?x1C1nO@$(QUXx_zW|VUe&MES;{a9g*fa>#|2wc;o@LBhn{@Vu
z%rl}B_zhfuGsFmY&CE$XeeOnZTUB0A1sB*NIX0-;zc`@4*^4H-k)fes6`Ksw0uO9N
z5S-+u7H^6|P<|wI!vDw=_P(nBcMwa+?vP$9BsuWN9ru9@`F#ySY!J&(Q@V)Fk^8p?
z7E1g45h_YZWCUD5<Z=FPznRyIwf5MIx@1ly`ekP(dbEGyH`cmpKMisC2R*>_3?dJ~
z+=X=eJLsbY@2h<Pc9c@NRhX^LN-prW7!R17nIYo~uUh;bCPryHNAP}=t-v=V%?b?A
zD)0O5oxRR+u8V!v@fhO*-Vm2Y&_Szwz>dZcK>n^5Q^=ElNJWqk$hP?aTV4Ss6M_1!
z+qb0=JxN0WY0;&D7^N%PJX`PAb~*D+0akW<W44Tyo~(@+7#36#yu&S_g(o}1KqMnj
zg!0XstCvFQohs!4(ZT>`Qrst`<Q*TiXlpmqwDIwm8XZ#b_Ac;`MZZJ^d?Z}2RHzn4
zsG{gm<lqY>q=nNABigHQRQbq`zUppQ?_-S#aI#jxkjR$EvU~$f!T?C5E6lrh%zk~e
z^4@(mss!xi4cLnqQuQBAl@BTswXl)8&Cz4YqF)4ynS>BLnGYHw88=k%y4;v_PSRiw
z{QDg(b>ovI^$vewP|sndE9A(w|IMN%4)2BrSen05XS^^Iuh&inYjC5Sfe7$@tasm6
zek-RGV`GB`XL+f~sgVa{21NK+{DYvg05>?S;516)w=h6eCc1-FZ8F%*hKN9Bix6Yn
zkIea(6P0*;jM#c?Ia)knhnf`#2wUI;EK<?W2MA)aY^zF!*eVYckVwv7fP1RVIVQ<v
z43NQM6wEy<`vpjo0!AVGpX=}=@5s3%x(X=0&E6#Re|<kjN(Vj=3{CuhVkfZX+;at7
zHxI>@5-i#MvHb$-XCu);uWZ;L2k5wN;P!*(;Zh5CR3Am&ccz`Q%{7C>1CN-^z5nR+
zhOKEJt4#rURtBt(XHbA9iPK+7o;|Hv*zTmB>l|54%1O3e0SbxyT#)GMEOX|jUQV^q
z`_j~lq<om&BTqF7JctB{VnI&}=^4;<z^bGyffw;N<3U6bNDbf_J}4THZFqe@Gr=M1
z>%Aua;p=3KC`^{phD>?Dy@>$p+BDJq<e&`fj>5jFHF(oUvw6o2pHEGq1N<yF!V|^n
z%wsQ7p9O@4x7QMEqtQXT04Atg;QYW9u==%gCr4Bk_hBOz(M0ihAtD9+vLFj^PWhW-
zCD^GWy;VE9sit%(^#D}8WKAt$nVD}4N0m2(WZMx!A(7J2qg%w2wDd~!tg+Ig=H!rP
z7{CM)eq9gWs6PtO<wh_1wzk233hP3ITfhRnVgnZ;a^Z4%p|Gl*v#|6stymFY)hY`A
zAoL!h#R06}1?u3PO|ZgElSjX@4=Df<Re=Tsc&6FLaF5`ArpxSRmxhYIGP9Ke7B_Ih
z?Hk}6Uei7CzlYh7e^2L_a|v|m2v^R9jss!${1FH{&f)+aRI#XbgD?58lx@mkU1A%l
zRG|J00HSrEXE8>FU&DKm!tUkYp9CKe`ML8Bdqt65R|OxMke8qUfbU>nXM##dC0#4j
z-va8cJf?)n&e%x$gx_&S1NfVLD6U@vD`VAviY%;%^6FQbPZ)s^bO&feGB=FHuhaN`
zJiiRo)0=nKM<}B<8P=*}*%3<+U$H^(Zr_jDB~d5)&QA~XtVNboEbijj^xNf*g$d(z
z#FhE$pt9i14|xHIlK_rEx<3D7C?19|R5KX6YTm7Y!oF|O?{sz+uNdlK^B+0HQycgY
zVvY|+QVRk}QOQGnUP^?L2!=OKR7Ts43p+Ymc<&boI$$h`=%VYnMV5T=3I8kWd<3Rm
zHHJ<RzL79}i_gWq7=%0hKZ4(F_Zc$4vi-&EP2W_WwUXA!xqd~gp$W+`E9r4*0DI?L
z2h^`m1KAc4Ms(^*4))$?DW*kj{+AJ6ipBYU&#0g|8g4&a)bgY5>iMMB{Ik&Au6yU`
z=j74^SJHRS6axU~<3AI)!@9@C2ptD%%h8Z9hC`D09YT|lMjUuDBi#3lm+YT51+rw)
z8f*_~&qlmGq8BCs0H7`sy&9<xz!?)Ixf+QJJudrfFb_DvPge>Sd<d0BKqw7Q2HfQF
zZY3Oxd{In4qteK!Q@8GJft7h))mAJz2n3i4F7MJd*RRd1P#ZdAXYNK{d#v2&Zblff
zTeE?9PMGL_5o<((NS0(Q0|S>hw8YZssOdU^24|uzN_u4Tj<nK(WE2$x%)LrNq3T(!
z6xvo4<qXHjnVA4Ev%myIO51mQzJ6ets174H*?TI&UVvV|{rrA(Lp6Ru6N2LP7VbiI
zR-St1=A2?;CB?)b83Ezfk+c3m0F^#yK#Yc^EDl!`Qdso=O-wo|Z7cEAQjQp>gFj6s
zxv;*c!^d%Q3ZeWT*{r)?zTw0xD1Evx2}T`?L`-0DFLOknGFb+I74Y%EWl7G71fqa$
z!sm0N6Jx|K^E)hytazO26=bs9PXL(+oqceQRtF`q;b5GusHJu>5aG+pA0o--ZML<+
zYZuXly^{?EAg0wbPj2{+>}Wv54aEa^y;Wd^w89&(Ew+J&&1n7?NDmMS{2=bn2L?O^
zI#foOEK(jv9S_BSz_c6Ho@Z>dln_sKAd!i6<eM>3MK+jSIB{TU-AFa<_zxG6L4E=c
z*wTX^Z!yllxutaE8p>X^)WZIw&Z-ZKLJx!{ERcav`<EmZlU>UK&i-K^A#!5Nm<_b@
zk|2Z_vE#fOgb-LAPH@a<V6W#Gtlasxa8-R<X}Rnh-wkvD3>Hexi~(E`EPN7>dj)}q
zeRUcn(?Y6U$rSmim)6qvsf1QdT^#-|ki4JHPX`HUYr$32F+YyT(e$rJX>44QmsTt1
zklz^?uTxkw@qTW{?fMFI&$mnqVwdMguYW~&a~lC=4IH!F?^g`$HmO%SUN!3KmH;(j
ze=GsMf-s$9SqH8@g$#oK9;lxSk-mPh;gM|6y){)ZkM!o-G^#Vm_Did31)$?MK!2!G
z-k6&t#Sqe!3tjRioeX`)<jU-=uPjI1yQ*_9x*S?kncw69J_rXSLYTfc9^?`#&#VA9
zS6jo$HnG~mv?v}$-A)%)h^Ia9xc&n*&bsj8BF(xCu%c}EZ~52*EQwj<@HgvPW^+y<
zMvCnt5E+HyG|!z<?ITvgWr-C>7@bx;3u0(<gnOYI1pO0`p{vVHqn0xIYp3HJktT~v
zsm|_Wycn=bJ2HM&wgy8<^y38#uo%J3d}|3xjdp+dqVA+>ft(z;kklM1vu-Mp5tYly
zxyOca$qsOqTY02ITd3?A0-XxglQ5QD$GsGig5A#*%`+2^Iib|oY2rmb|J(UCymGLO
z2$WYd0T-)yl6_Lfm_nRvP9RmgQeG`<e^+}z+A5FNT%w?4zbe2)9iXQvaG1@dV8!UI
z4jaqSh8&Q*vPN|mHUBbxV@SA%B%i&=<g%e7JXip}YGaW-xH6+&cc|mU<Zx)VVFW*(
z8+xcE<b{-yOz2uDnQ5iq#V)EZhSWVN1nQ>_1c~2nh>Th;RjYkh+%r`kG4XDdPKkEc
zn9qVO_~^RicIOnnDi3NS48@2hzMm%%y$L1X{DJuV(DkHZcpZo#Yz4)6%>Fe9cN1ff
zj7%2}@DP}#pSXBt@?V37g)^w!OE>v7Tap7^ZWWCxABPMX**3+1dkOh(jwXrRN!%Tc
zI{TAH&WF{uCzsjZ)sIWn$AmCHKCeo_KVSktU^sr!IMiB%^V`m7?m5`^q|ioTVYr7j
z3&mqZss5{yB&ZDvNW9xBrA?o(>=Sml8S>7MsZw22XW@;xAC&Ntl27S1h0iBiujXNq
zxLXn;Wl@0(KObZiMGMt*I3v7rs^JA=j`ZgvPl{;@Mfx8jJZu9dOkBin=JW!kwj|L#
zxywmCK5EQ|+!`yo*;5OZF?!9#@9=!@U)2l)ycF;s=`2Q3Fw%HZ(67lfT72!Ll+M_~
zby_U}UFhbzFz0YlGO`T(|J4KD2Vv5OI!9=*8eHZ`s0d>0NzB^->-Uys5QU>9%fOA7
zjr6MB`f$cd^V|W)wm6J95v4;Q>fu`2Gk-`3)EpGw^8S%n1--aqK9F77I`PJ<p<g}#
ziH{^{ug2MVRc@e|XZ2cI3ykS6o6@z-%WV^>-0T>_E8`0L4|OGC2$Oma9mEf?zDx3F
zHcAOU#~j}Pw3Eg>Dp56K%pDH4R~{58+g@<;a3dE}2t+i?_J8pc(}_>U-BnrN`BE^D
zeE`w1Rtq-1=h`xdUF%2j_v==gBzGvAUPx7dMM8Km0xqn109Ni-bW&uNj2Y%LZPbZc
z-Qo69jWY*x`%EsWIqkEU?*3RZm{4gs1W3l)SN{R9WTu=;t@`@R;)Q2=F4}#Rp^PMA
zL*5LhGVFARS_ZI2xz6LP{V$aN`!H{ZF!(?wo^$Uj{=iW6e@9jSneB~qo-*gd)f(7`
zP8;R#fBVh&|7sOQvo2FE49;ewxkgI!Yvr@cN`^V(Bn_;bh`)^UX3R|%M<=jfkLiId
za47*K?eEEb+_tbMq&$g-^r4zf66@fVV)n%-X>*TchNZk%wduJO#B7>POQ6p1L<OLy
zgBj7R-=yb>_G)!VW6YDojg#<pN?1<q9=c(kYC55+bz+MRLsHR($(QjS%g6bp(Ffps
z5BqZP5*aZBG+eoBw6%PWvqN;uxe{6z<iQJew(8tIjBM8$_w%n7mu7{)V}1gU`A<1h
zGpa%LVe$@>Yl;|r*}v9;yGddftjKviujacM8x7Q^@0ZE~OB_vUn<tRlpy+T)oF(){
z)-<0JEIVmOBnq?A7|Qicjmfl`0K|`W%phbkAtBA<)rID=AA&A3H3AtSaN&%aGUC?L
zgwdaK1vj0+%|xZB<<-n!cRK>b8y4WbzX!7<7wvFcBzJWh4qvCIj+)Y+yr!$O+T^`n
znC$y>QGefIUdjW`_|@z%7`0-K$^zaAG3`>Ver}WlKCIr9Nj}5cr?ypdFTp3xO^~}X
zC=w0P5VHNHJX-MR;S}dL3(Lo>|0*YPy>*aNXNSUR_4`#G-0Ak?FykNV7}l~pD_h_f
zE32v_BO~6ateEonkeU}Ce(E-E>WB*h=hmYoUQOLW4#!_CHHr|7z&1G*MfA&yOv~8M
zJ<=+Z*GbNNA*qsqA#J!(lU%hK4@pIOW#RY~;epd`?X98sjyd~WF(8D8+IRo`UOqIA
zR2<+nZ<Zgcv%XVkeHC}VnHu?`l$JEr^sE+dN$oWqivtwD+lBy7dOBw%-wlB(`C$cf
z*=W@swX_;b(B4|E#&M9tpRC5}@7>t}YFWNM$j8OJi~_t&z3U_P_z6$pWQ>+~N9M9V
zya^F2c+SovF`}mZ30cR3kq2)vK!$k1CNL819b4@6KJ<p7sGf9r*d~l_yAvd(Z`6%v
zT~mxM9-S_ml*d=KlD~=W!RaUh33xjPh^9})Dk!jW_jG@fj3-tx@myntF<KMDBxy&>
z3Y;<nSU+(tx=Gs~M{0=o{|1W6$7PohJwztX-^2e=UTZ!M+~{B|Z71mb6-f#FO36X%
zi@T~ZX0f&9Je8A+A3(_P*_qPVn2hX<7?JG25%VwOkdpOUs64)MwQbj~D*TP?7xYAK
zDZw$0xHv{l_DZDR0nc?1p-|k}viLa{87%(*NQ)!j(jS~6tMc`AZ(GbMqlWRn4^3k`
zI<C)Iwdv*f-FyR|GYz9U6G<7S)~z5X7u?0lHxK|J*J25L5iwQr=engASIz2L$(721
z<svCe+zB*qcc;YyWeRPnD}(69I4xpjvR|Yt3hz*)y3?sJC*HNvKU^I_hc0n_rmR}l
z+@f^!6w4R{-W_!|(>fZ<YQ1p@Pwg>s0XDq8lFXr~4J$;@DiffJpb>LM(Fm{ehFNu1
zHr)6};JMs6bUVo<238%ZpEi_(?fkeys@+^O?DvT2<)n^psNsMcwgIZkW7yUZok^vR
zY8OU+q8i7qKgx7|T8=GzPh6EdLi!FOFe;h#4KabQjQ8w0G07by1N4^5Q6O;e94y78
z%~*z_5HLw9ky7T3N^%+uwG9W8^;e4|omD0p8B|Az%LM#8rQ<GVx2h|BILXdXfhrio
z?pm1F7zz%|Hu~S0Myjx3OitPlBYXbk{~En_{n=f}n)Ia-EBRV0`~+&k0Lcdzpx~V9
zwzAIJU9$8)^cT7-KggRh`|hq}e=|!ta=wRuxt^=nFLLwpA4#3~nk<Y$x<UQE$J2Ku
z<>$#k!@SL!d%D$4lJA7rKx+lusX=mJh&a9zoAtkqOWic@WfBX(LlEDIBAQ-wE?%M2
z(dON*OMOtXW`CulL_01&E8L3`iep@aWUw`jVK<~WDlL@|&|Th%n%*vat_oq@e(j6r
z?d-;~7n(+-7hecrecGe7)RhURanV1Uqlt_@qg;9M{wH66mLYRECM8gw8$Du%cqzI#
z6GhIjkiZ~oi<TX`DUW_`$s_x(L3u<-0&=k`uiVKT5tt9`4Jcp_92Lbj?VO?-YOAM=
zTr{#yU=aPB2;-L4CM4Z3zVq2=`L=*b%f@V)AWK?gGhIFX9@AU9(C-KP2q;;X(ch&j
zrW|;zviT|kHl0){D^s|5!i_<nCO4_9Kc_#sbNvNM=s<u-L^fs-MqBn3ZFPUnt6e4<
zcY-$0Mj@(p<6=cXUfQf}u1>RAU!0U2X%_X6BSdifUv%6qdh2%&Kgf&C2bS5!gDtWG
zxv3j?Y>`CgPKW%m057Y57uY`LN0UfUKg?_iT8^9TEO2AO^>G9pp~m2><Rp`*bn@hm
z%Vc*T2EPtMBHPgbDjkv>X#E(({f{K0YF@g-HnEW4l#ytuwj9ly-6|=6bq?VrrRW!%
z*PQe(W}8}3Uy5xMz$d*rrUN``YAfschz4SrnimrI<sIkxa(BDL8@$`$a}zqU9PUh^
zx_Oq6sn)+craH)A0Rk3KdU4X=%v-{m;s;=bP&FD$6vw=nJ+A0G(bhaXw9K|4&Qib7
zUYg}ANZ*Ta7X(E%_=3b09uJZY=$GYxZoZo8T^sp!W2Mik!b~Z$9itjX{}>uC90&6p
zzs#OZmC>mQ5O~(ecNU%vyX3>aduGFX+QH933|~8%#j-5rEJL5IowD!N9qDveE;VKK
zYU=LQoT@MIJMreJLAWXI_|G%0S_;(v4L}r5wbj#tIou(J;eph1YmPMC>Yi!izs{wi
zTR|hDqW7Av`A;r23O88u&rL&@p&E?^D;z+n^lY8TAmoA`-(VSnyRU4r*f>1<@L(y#
z=BE6GsV~jWNB%XXw$_DRP&?lAxQlMZ_m2*Y*Q_)j3o|7k#UQ;4d@O-QiMp!{mQc2=
z8i_c>qq!-`<+)h0Q){C8Cu|kAEY<c;Dw#eZfI{Ym1#B}k{KMxk{lhy=iJ{fbF*g<2
zt)AG2y?)r%q9vDSy(I;g^h*BZ#~(|c)3x&ggmwBmcKJQ&0L1J1gT!GorzSs>E(kT7
zp0|aPYvUUnJEsyvkC3Ko)hzb7{Ky*ka$-S-W%@s{O(G(R=|%r{&BSwlCf1UXgujhK
zhtz?;=L;X?+nNg+r;o#)`mkUe50l4>t~yw-e+{@f*z2RcM?6B`i)aFFOxHwveHM%M
z<hIsl0^M4ZwGsM@Vew#OE1^ShcT;!-;d|PQ07_B5OzG@r9-=pozlu)ezN{x=h?FSQ
zR#1D^{21!-OQG|~8HEB7P;p~p)noeXFl0WTfvEH6W?-?n$JB0f!&|zg7jmSI<mvYd
zdYW7J$^)vg(I+fMNuuOvrYXFYSDE-7y2~vy9{TsoQdbiLw0%l+&eSEnUu0tXws=ca
zR3!<VCp8<GtW*Y*4{pVIsJz$BD<{@8O%hJ$S+j(rY*>lQ$Yk4bfM=;&7(Xgo?tumM
zCsIahe|PKdi$XbrdWRF?8J#1d&GJM4COrI{i2ZR8nV*)25dkz0UOxl*Bf{lc*n${U
zHIW930TEkTGC7NVLS`o%Zaa6mL4dDuDiMr?zEu2AS3fC}B*-WlxU396khn{ZhFWT#
zNC_Kj-WrUF0@uu?=A7d{Mj!*GvCT;^mWo^}z77Z7=4zr%0+i;t!-!zKB_oH<qh9Ch
zb_DP*htDxo8oEF87I<o;{p{IUZOm;9?Ws?l`JPDF7RtbeGuli0vXvU~ms3h|R>Vy?
zC8slZR-8ipCGYaUe`%48yveo#F8(cv4zK2F>GMo9(42-bfjn36X&@n1Y2fV1$*>XY
zc!E;3t9;+8#(tTwl`>HL&rHO~LmOfV0*1};-s>n4nNa%LdR}*-$!w~UwuT;DWe1d!
zhU9*2g4$rC7qZI=t|wcQNIsx7;P$TW#TP0{Px;n(Z~cqcQqlWT7Z%b|%6A~w`rKEH
z3AgcI>fe1P+9$SMy<K~D7a)DQcvn<m2x;f~$41V*m*&zz@o`+FvlPebWHxzJ%I1T~
zeT!EF#Sfc`G3n%zVe6UFl@Z<yX-ytN1IY*5?bt;_Y!L*xkQQ=4m;Pn-2;qjyF~~Y$
zcl=t*RWPOCM04t<))c;Xud)(zz)UxA4@y0uIT1^Erv1_@xTrJ3rZ>bQzTh4fIS1UA
z`{&a}6#CCJE8P|^Wfa{+0nNLkcVe`ZICu4$<~xD@2i-6i>P;RY{(eG0iML$`<j@36
ziw{(lMqlF>RV;j2W*Th1a5prW=&@Uj2vv^}r5~(%-7-~|FB=zSA&#!Q63OKKsXez>
zzjY}jgFpktLj)b;<I$<h5^F)&;CTw4xB)zf?RzO|51Y(WJhb;{r#Rwp^1u;>?5k(H
zK9?yyu2%e6qGb0*E999Q04>;9epB|O-rIlyV?8mbp-^sP7N;(g<!+H$%@kb0<mHTU
zK?@Qi6VQeo(fS#m<tK#%!mB^+RDGoHIQy=ZeW$83!oN-Vt{7UoAI4+Z<<0g-ttG7>
zNjoV|r#qfdHt)Y$jT{QxEL@9OX=+6(PQ-VZ2my{wTUm%2{N{-pbnwmEnzlXj*Q*Hi
zvZ9I7Ra37IXUr0&n_Pp#tJM-QFB<uu)}mmy-^nSn$EE>qgs5z&lUC(k^>CnmiuZ0+
z3)PE^E2@xUNn}|CH9o8Sm0~p^f*jS_L>V`kXXI^Asj&H}ta5eI16WX4Zf3$Ow2$VQ
z_EHVzOy2PK=5beXNNN6;ZLaqSl?l^BX@LopiI>@w7Cly<VhBm-Pwzsgxf~jB9~sv5
z({u=`aMh>R_=CAWiZNG{f~o)t2N-tqcVo1Z3)2K!mi=dhK9y8sME=QzHpak1Nfe&g
z)94v1ju_j%u=orvMSQQCbM-VQP|P1}S2KJ(CAgxCSfCNv{~ZvRDSHlgC^iV|sc|f!
zZV4JDy+z37xlfcgE5*3;2mW}S!yU6vp&)WBu)Wu(n1Hf+o8=|e8^?CfdU3Rht!MW4
zMeDB4Ks>KZ%<H+L^|qcP2A=YVW36ure;d<M#Njs^9T?M7%F7y^OJdUn)1s^mIY8|B
z0eC#aO^I%bDarSVangGks|0P5UX`WLKk3(*0|nN$QOR*__n25lE!y~^=<ipj1Kc_7
zA?K4xcff8ep=b^wB*k_zZS7HHLJ<4!I1QVODkFw@N;wP>P2Iy|Mn4L<AN4sJDg4R{
zq&c^EwuoWbjThARUY`Evm31|h@JKgryEVzJi+N_&&^)5ov7yCr5Q}`L**v4`KPcsB
zV!d-!LV~81Ba{;1m<*rv8;CF^gdgoaVL^-|sHIoY@v{>qw<3tTvvR!YBA>(m+L;Th
z&IoJ~o*<Y0TEl0ccvsgC9Q9zQGA|M(vJd9JF%`ijeusNHZe1Q$OkMMw4JEok6De0&
zmU3!QcX8MQv^XFtcv6LJ@@$iOj4|sQ`E42F5rr7LQY_{$wU-E>*pFQok#E=~(sxDf
zOLWoic30C5#2jZv{-f<38_2h$@{gUth71F4!B^S4pPt-qSM)Qq*{L;PBDJf^=+^Le
znhvws@PVSxq7+XG0#VDxD{snm0VUBbqX`F2tnX0li3vP`&>RhcB1)+Vz9NP81<k|V
zS&rr*#iPX+ey3`U?4cC8zQtepNg8p^>Q{8|#>vK@sn*_5iO2(`1vE5F5IVrL4ay9k
zgEb1t2O$l1s)}+g7G0M}KdM+cmyT8c|15xO&qzuX1giIyCD=ezbFuHad;tC5v0%2V
z47orsboLH4*y-HViR_yUBSkJ8K;hu_X>s<G2so~;uLG?4rMZ5vS_L5X2qk~<auN%c
z<1OG!tjN91lL~gbJ>3*u1j|mGc{C4HqR^5Nztbu@e0ph*e-Md}LKbItXTBxOyKqzC
z$F)>)cqm(7_J2u9Oy6t%ux;WMW@Zf*>#?3zrbyql@r?QbVuk?_9PsEPEdNgCzg`(k
zj&MzZ^W!2lmFuv!|7zvU?7BOA6)^!XeC=NSJlz0#up*l6@yA)Z8A3!efwVRvD?~&|
z1KE%QU_Rk7BZhw5mvnTB>~1_>4K26DNfHUGRmz)FtDp{z@0*Is{)7?Xh{?t;&!8KM
zhOwXiD&?Ps8Y}#uq7lRZ!HEJWkWmd%Bh@T{+N+S9Yci#Iik*=cg<&)W_95H_7R?~i
zqsFAEr|%oI)=j@Q>QXhRTSYgDJ*{Y5P*VIuKxEG~`19YAUdQd9*s9*HvL6FDvZ~@Z
z<l%j~S-o_EcF#gHn12?=<TpX&MIB$qKO<x5?jf<ZWGuu^syd!e%wg|FNC3S!B%tH-
zAxuF0u8})K|HswGwBVaEZSSFV&k??fDGh<`s6h5c&N=ka<izG&7$nwb%||%s*Vx%s
zt=jQ>kvnYhN}wSEghf)<lfcc-c5~-WadBM?@aNHtahu`YA`)iz#jZ|AdT-xYnc$KG
z@YI1o!Pw-Q+mpP2$@i`-e<$_6D|+|`9-x@{H89C@t-Q;xoFQTkGxp4rpj71Wvzsow
zG{UU<?fM{mr@yi6bk$$#P2z2ld5{x>fdXO$WUN7HZvlmqIJOV7wEe8XTy9g+5a}|V
zjHJvJDXmhLEWar}r_+(fxf?A*$RRCCL)su2zzgK(4Z@6;hc0y*6wL(g9HucuWu<u2
zk{{4mPezQ&?a-%8O*|{t*+@q7BwY(7L`OM8tc|@Tr|cOMC8L%TsJ@Z`a~YGSZJH)K
zxj|`Z>@nP64i-Eek~&y0Oi{Yqpz4vd{bh+ck*}t5BZ;y7)C$#c@uGSbvZ%|_{l@4s
zNgEXe8K~t$zb7TdbauV^b^BdVNKq1HOrIG%$_-xWMl&L8dinXM=(yvM!g3w0c6DNd
zw|E?r9U}veWC;S^J4<8~wBLNHX)QyNTaM+Dlj2hveFsQ#)$tu#BSx9gCeM~n=&@5q
zrj1kL&42zIEq|mH>ArQik;eX;p(a;IEr*0a04&k`@zeKk?~#Idv-T?Qi?x#eK&~6-
zqb~(5Z$qr^u7WBzu_;b9-X_U7iPmDH+cEuU$Lv@ZtDz~e8scq0j+@N+YQESl((FDe
zTW!5CJ<W94<urnRe7kUQ7kIKD*BzQxkZ;X*XXMRpeCgcTiJUK4I{3vKkc!c$KG*M&
z$gojtJ9ZlpTq=bAt1y|(eV`QwQ%fjH)Xm&j9#56m%p!Dq@HG(>TL7ahv}vm{H|?6%
zd&K{^sOe}tksPjsBl;>WsUH_z>06<Y0ihm9J|VwCBdqO&y@oV?5*zkgZaB%eu*dPt
z1n(B7txP2A%r8D$VeeXfE;#ZMw{;^{+CS@M+j7a+xErm&IhpF?$lVSBjPi*E<8pz1
zRr$|L#fn+L2rELipY^=o#RY%Rbw`c#T}!&P1S?hngbq6`^!t(>PK;9*Gc}Jm7GB}O
zEOFNYHn7GV%>wuVBum)C7O1@&#!#JQBVkv#I)}EBHPN}imULe1?JU3&-L%eFqlsT=
zq#4;BNjG1tum8oan2(b<ciR%!gyA)>Hf5#e8|QeJ-E>B=As_WD_547k9dr4@*tY}b
zIYE=(*1>#;Ejpt<^`|SkkF0yt>Bnv>q9BMTJb;k6Uww&b52@NirS7i3ZIBlRWW_lC
zMdNRY!@JKoyWnF(G*x2uz<c}kpC)>Syn&SKEv|Qf#f&+5;Q%~wa^OL~2Z)~@Xvlml
z+nAKd=X%)2lXi|eb>)FY>Q=&rZo9K>>+gh2o#W!iryQMXSMyCJx1YPY`jVcd4-T0S
z-N0C+M8LZYQV++gsff4XVuPYt7KV+}0W6dz_-MUvWw=k=Yr_?}7>r^W3_9~3eoz|A
zYETU4p~yn``H*R4&!_e~f+h^>!~|$iwV?xjLu6imSEiUEn(nh@XV<N>dt7zA28FA=
zw3wB!fQ9eIF(cZ8o883aE2HZZ0~&rocTNA`v;1^wZ#29Lm0&dKBjW<Lk$_1ar$+Oo
zN@p*w@og9>q-c9kEBTL_*k8FLp?^CxrJ=9Vy)rD-dV27-ppb3nMnmp^>6Ra6Leqnc
z$q*dre!o=BxQ<Qu6~f4Rlk9*&u{H+aTz<Z_cobMR#M7a%B<JnEh~Zln#4&6wxM_Ll
z&#dZca1O$zZ@*}i1Fdh5NA|1!bnG3x1=1wXIj!9?QR!DkdScK(a(`P0c~w=QNV1e~
zG&Ph+Ro~YPCu#9MWv17@h1BSp-Y_tDWKftBSH6g3Z;VmI6q??i1OV~(-k1_?PoCqM
zx8-tPDXV-yzB3Yk{Ej_Gr!<!D7*=4hJ@UuiD=Po5q$TlTnXV4hn#4DDAx5Jbe#PI`
zYdc2<zN{n0@DIVv>VeX}B%o63eS9Nzv0A*_2^)HP*dzRfamy+tjHkuKf1OsbZaCAj
zCe;dZe!)@s>$yHhg#-<^i?2oPqlJ2A&+_a81;25DzFbRk7<m`ocT_{fnjhyx?M3>D
z`wf2$PcyAxXFF&YMb~S6@0VOvgGx8F9V2`W&fQ0_(+DP0h=GwTParKD!Fdgddc{e^
zoN9XMZv}KeQ3V8c=QG!<I^T2slu@fuJ3XQ{cXC;3SG{-gzGB_GCY4*sDnlGqnQges
z#*LOm0%!$kpXf!I*i+dY^pBXK<@qk}7ooxtj~XSDQQZa%|DCzt=K|(w4gYLf=WvnF
z>dM=r2_RP4qT+xQe*B5hUE6uS^!9eRV$t2I$vfpv;xs7z25}ONlRW?@IBOO;ZEW^C
zHJa@rTFx%-^ag(3J&RO1!fBkfG-1r?`VV(lqybZ4&d)_|#s7|l|5<i>`Ybb^>8GuS
zN~sXvB!~Eta*cjYPzB*_%E?=H18hVIY0pJ++Hm&2=b&%kM0GAL$&-Fj_M(7o#V%k(
z3?%i}(ob41FKIU6Mo$)IiSYLK<f=wWi(apYsV$twY6nSvcBnhct<OSClOJQh$H`wW
zmocO`2NrOjwUBH+X`H7wz^y;dNb<(<bUpX5ST+nWfa%(-Wk+d7RgZ@h|JetZblPlf
zPma@+ejMFBO?ucbMlK+1Niu$EUDPzI+N~U=kjZpTX`k`=bGAUy)k@3EhB&YX@E(PH
zN@fOQ-jWzr13CDQCR42y`8+aW=>w~SOjhT!r*^Ki6vaxpga1M(yP7-v=G~RPxMKU9
zR4n}2@t|QM+r|MzkI<!1=)-|F7abH~M~n9QF{EGlmc?Oa*!E>PM7!;o+9B~jGpNS*
z<Ab&Wh*6eyz-d2NHv>so@T<AHUNO*I9u9ggqcp_%u>godZAcPN#HgpEQ_nfkKS(LZ
ziieJs;>amzbFA1rOZ0EUw7;A^%ntog4oBr+m4UY0drQh}jVPV*_Xkta!M}V{i%$xq
zEIpmr1M%I=8#(Yphy&E`dZERmw;P`_E&Lqp?d)r8ywZFq`DyU{h#T=gZ7b&E2G$~H
zO~Gg#rxQ5ul#;b}Zm-^z*URL&!%bP%dV}jP3{}(_?=tYm0j7(@pPmgQ5>LgoVpcJh
z)`ctO0vw-3a*Z7PDysL~!Lva(R@Jj4;40L4dM%>a;Tc|=IEp@((zNa4l`0Q9t<}Og
zeH>)fuiO6bnMs<I#gm@Zn1`g_ZL0`p-FGIhs8}t6%$FlJS>(tGOgC$If>tzJ6YTX?
z9Ah#w%7iLWKeC2S{4#s+`9_@(&fKGS_ig(p;^hobF@Jv)DHVadK>3H;+=LaB&Kktl
z99o{)C41U2*}4Y9v!S#TuyS@U)j>H&nn+FfAE%fYpCYxwLxs9X(*L&8z~WlgbQRBu
z^n?N;H@KhX@6-OZl*_zFDR^f;Y;PsQH+we<3>QaLVDj@}#r!WPJtoO{ZraCTgiS&W
zBR8R>=LS+K!rtNIOJ}dbug5T&wh3PgeG2`8XgCrSkp_MPV*@4^E+mTt9;(a(dE}c@
zUvIvprN(-H4_w8QX$!D0aw+tlP(AQdNy$Gvf*T<zhJ)jCV(v#I_6$Epp=SH*1xt_{
zWIiv=nTs2Zh603l$DU8%O08>IJp<>9%$Q$@TLWH7@l;g#Fqlvoo#SiL<5-=`zaA;0
z^ST61Q8Jr+QMQyZw@H=Lc(vHPW9Izv&uq4T^YA4pG602s0j^#ai^#L9;^{(exoNS6
z+tHTYPlE3xS<-jn0MkNJDAlC4b-I6F2dQ*x<JxP*V(Qm!*DYJk)qgj<J_;QIijlO7
zNh)02(+Q$v51ExU$O|7SMAL`u+Hx%nQYIUg;V=VM)MQ?0WujGWhR-}lBPGMyC)cSg
z!#J#D5v{8DV!NMNm#I9Ctq%ivi$F&Lea*bJub#+zY$NzSZ0G}U0RR|hmyOY5;wMxD
z%+-g<+eEQmy^5?UmyV<#X?p)N@Q`y@-%1!6WRX{iTJYoV#M#U*3fPnFdr8zHn^It3
zE*n6-d0>Hf5(5zOVQs2}?V%KRHU913a4%m?Keu_-i-;S!V$nH7+n)U^nI*q&_Da2L
zZMdTubpvsEOdS<`22BkVy+8*EJ1f#jA>!FBGI18R{3Ql3!QwtV@3~%w)K;CtFka(I
zU0>CwBj4f_V6Em(njX2YlG<BLBzk2-rAlL!w$<SD<)pCO7TkR*bA8%QfnF(A)|Nn_
zPBrxdfZE>x5*bjfqz`(gR5f`k{!;T1X~;$W$f3A$SARm{gyJRP3%QC-XQ?}aU{X$W
zEng7visykhM{cboNtz9O#)^_?=-C=Faib%k10o@*P9$9<QC#K$pW{#KbY?F&>uO=i
z4+meZq6ClP^{s{SvGC{p%WP8asENv0Dga`LB_oC1dyJ&1^B*Pzc1ZA8n2vlxoC?JM
z0~>_7MVuHD{AYmSXG>iw3D3eecT1=14b3S=KDgoj=kYlW*(2nYmDk*kZ1{%VPlU})
z49B;#rySzJ0}P|*6<E%~Oj5^t5dVnN-VcNU+n<0gFs<k(7g~cQ1mjc_?#l@Rksk+?
z(Y%JN)O0+sztJXj)yYrn%`+ObIlCNQ`8P=E6Jt|C%5@8#Yg<KQ;Ikn+fv19n0o#Th
zrSg-X7@0Hn4rIK|_#m1+N0r-LHf2!OpN>Y-d5Na{)0XbDVSJ$SjqCG?cm!Orc~$g@
zluRF`)}Naxwcql}S*=kH1<W%2%AgIr^jXUcE<Yl;WdJ?xPc0=ixJ!IaR>J$g2@+s$
zYdEQ+1tvxsS1=T<MEUxjF9ccWMtP4#aY;S-*4SE=W{#tov6Gdt9t*9@5Lb#3jx_Td
znK?f4$_oMK6#}#l#m3scc}qHLF2o(V4pC18dGi&%Q<^)%9-`A?x+9bR@|B>V4Puep
zLzLBtQwuYsTlyEYW5$It;<0U3_w#VO#R_J@X|2SuMzlL%M(e$uoRpVis<ww-tQ{|y
zBODi?PGGRbeSNcwNg%XQgFHkxOk9QJ0^4(PdyrHWNWF*c$5-I<F?WaDBG*MA###o8
zYAAEsxsTwMG%WHC0RWRP)2yYQcQdv$+%n#!M0RG(BUTRPdxnYo+MKP9axlI}-R9=@
zy)7RaSwn6f#^3(akfHNs#fgUs%9miPwTBQ!T{X=!mi)xdk{AD9H<;+93Hg)B3p@c8
z&#A+wz&($&aSMCftG`;3DZ@cxJU7Ra!K4)bR&(nJsf~{-JEwKHUMa2$^<!pJ7F?);
zOjK1Bc*F-h0@Z=p>Ld3)3jwZGDc5U>#H0jFY*$ITR4)P}kI~Go$X@;tsv#$MFS0wi
zof#&~)siWG6Zh^gdgn7RJHgKd*e`dFe_W(H!WW5;h{XDJ0e#{&%Gfv9x%x)i(G<Lo
zAI}q-+%6qtgAZQLW22HUY)`^jjB<71Qk}@Sot}jXN@B>>x8x}dqaCPn!Ji71Fm<qA
z<TMSrKzJAe>U-=Rq=xt+YZS@w^4nwg9-~x~RBsl2mD2^yn20S^juR*zl4*Anu6{fG
z0ixsOXUEz(lH+A-3vzv#EWM!CKiiTIH8!^OvYceLfMkLE--{5!=RB=jcWJyp-OU)1
ziJ;(CMfU%A`_${ZGBpo+ZU+rfsnAU40#zC1SueuvP)9odnEY%_nW9+u^3=8i%!r)<
z(w4*pRi?gK^|V#g*QzEy+Jr3w{{cQo5hs&6`k3lbB}o!EGU(caS>bDo#W%-2#6FwI
zjY-!?he*DMKY;WgtqZkx;6v=67u_WB6rBU^4YY5hA>r2H_Jo|Po6sPzTaTXTf#YPK
zGhJSqhvyuo<A!u`1YlUSl(4H}y}i*OEvA6-s<4}EEQ?}_@0Vsa-9luecUD$Xcum;c
zGHWrF;GuBjvamq!$*%y<_bdHKso#{<UqW|lc=gt$eoNY$S4A<>6~M0^z0M5j`wI|n
z#W$QeBvE5)y5H2TMZ4b#N0yXB(WE)9S{{0JD;J5?C|c2*dy=-gD=qihSbbzEdeb6A
zXR2*j7LK;_r$LuG058C<z2$kSqn;@LHXd=3`-nG7%`g<-^JgmHcGc<92>Y_1p+=om
zOw+$OhP9cQ#E$97de)(N_>a~SHvkvVY_Gs-^Km1lgU7|q)Z1Xa(8y~!u!cTtjAiGK
zIF89%j^^h3StrocfT>2YFMd2*e=RjS=MUW#ff@~$-16t;;sf(t$4@5o5?z{NH$<xY
zAI6zxd-m65ON-2$Z88uQz6|ibcLftGZk)ZwqmDe{7uv3=y~-x@<1;B_ZN5A^pkb+h
zH!aBVOBx@2rd>xO*|p}Kk0WlIZ~wacbT7&s<8DjtBXTm%zF5TY`B4C%+kC*NAi)-^
zL8Vxpm870m`cM8)W@Lr8n%op;M#oF22@B3j!$fPBf2|X3e3J1z@&(QR%$v`rhE;gW
z)L$a0u2rey(%Q%IEVj$G@Mc_rj&qCYJ0+4UtQ4seuEx$H2=XXFtsm~Q`gAk5p!u1`
zZdk$L`f7kTJCCtniiWK@X8^k_cxI|gX3Fu!Zg^l}WoacDe?xYd)|i;@p>dpD(geZy
zlfSH6#~4#x&PRNXb3lFB>v8};JB)4Cv^s=ax7p;YzO9PNf<=5-ze4RWKkpT~e}1Od
z`$+Ds(yW9IZgAhosoHyN50s-CSOVUqIR4P?x#D^~T)4zYG?k*#jT0*J2Z5<6f7)s|
zY17_kn-V5!<CR*8nYf#GSaQZPtUzPA1~S|7l+!7y)BRegCb{n@*^1<(unmZqw(kSu
zAC&Bfy5=6b(kwf6rC^?O|8&4#1<#WRr`;yc4OjLW5%`3!k=W24Le;QCCze*6lZwo>
z2H~Y!u52K@q5g9AJCMKE_w)Em@Q<dG6iY*Q4H{_zycoqdD<A0!gt~MVpYC&mBcpwD
zooVoVXsE+;V3}He$$B0x33PV!vWSza4y?w&0@Y$pxJ8n-$L@gmx>1=s+*Gq(!aoJ!
z;?vdm-qq>p^^`BCS&Pq@7}qbx_1PXVau$+kyugg0EiiJ9{2v0cY{zhHP<?!T4x)wr
zKUuDZnX+$Cl#EMg8dee<=!9u^0#L&g?l~djD0=JIBmIQekf($Z4!#-T#FUQqWbUao
z%gO7|)7KSV@euh$^NsD~=6b>YA)wTW&4LcxL#tzE=u4EkJpM~igVQA)^TMbR{QXgH
za4d|z?xi$eX*_oT5_h&hIqJL2hS(9~%E$0S`=0g%{jYwISBXo+Pc5G=D!8Vfg&wG6
zOh8)@WTOsY$T`gL#(*=(*$MQhv#Yj}xh%{@JIJDhus`W@F;3~ZveYAhrCxK;wX4`0
zzV?-vbHw~u?|kTv+0`p~T&t=HC6LaLSV?uhrvc?eJ}c8eD7G?vCY7d7>X3dPJ+bFB
zLo=3{g50}3!p6}~0yl;$-T8Vv&G@~j7IXW|WOWwrtoVDy{*;(-ZqXhN9DE2qKvn><
zcLh+T5OA`|1yWNJOQ4!%B|->&5L7ZfhD@lGl`Gf<EX5jPjuWKqC5qMa#0n^Mo3D%z
zO71If?Bw`AN>mn1w1W(f1CxZCtQ%3^rstK$P5*tC#P!mO&j7$_4ge?on8C&)%_2>V
z`FV?lq!U-0!`zj;Y7=8d4mHcC2KT{F7G&wECm&_ud%23Q;e$o1HQ~7&lxwB2nKzVL
zmN%A>=M~g?=Y{`trzVGU{}BUq+d~6_+Zn*IJ_VBWdZ+I(vr-OYTZcvKeVEd5yN&w<
zh&cJ>qe@_5P2&8PbPLhYIzmd>WcJaqQJWfzq3q0<^vPvJwmZxy()>n#_47ZtEdH_2
z?0_|4!sza!QRw!&&(`)AKS;mK>9!7GkIwC`gb_L~2iXLe)=--Arw?BX))KO!jPeIZ
z_KWu1Zz8N&ASwAZJtZv_J&xX;CT$gDfXyrrH@4kEDvy6_h`+)Ds%!UtlG2lv?K9PI
zlNHWR7S3qd4}m8g4)-r*515FDCFqClN^Ayas5{Z%gWU2Dr1CL!9t>_2!;5iX-4wlT
z=^|-0Q}w#3@B*4X(mo_K;BBA>qRImf0(6m<(;XYHqzgQi9eM<&G0UY~kHkH{Bd(a!
zZ_J6d+?Wx9NaI$B<?YS3bv5l=F9c7E{WdjLcm<ELb`?*h-0bE}iVa^o)wki2ZEgaJ
zSH|2g?{4q0j|W9x0j&yn7c431&{mOR73ItvtIlg`sphfWPJrq%A&r@K*r#j%_($7-
zyEDg{6*R_GT=+?Q>)aTJdhMSzTMP`hQYLt}g7?8`Im}8mx%%rE@WYq;yG+~^r}okf
z9nJxElYMIFX1lwdPX4}D?ix79tTv)YRby6B*~Q`$<>%~IoiaryyMbygk@WZ-Qb3yV
z8M=(<kLfQ{ZZ^2}qKBKi5m;alfj~*D!T^#2tu)WTX5Y9WJILeU)3vo*`9{@h59JjM
z-}czNQGj4<)r)lg;bV?S^{!p<=2P$^??8z@4&)az(~!VGb;9lQo8E}eb$_)d-h(#f
zdCH$Z&)?v_Qtve!{3hQ<1K@W!du`}&DfLhHNykBFW*vBqYRYwj2C_V4-}?wH=5ApM
z(bSl$agDj%a&eb=`*L3*OKGGz(mb$|txZENJLFJS(LR&WE_m2RT>pkoMd3pT&|4U#
ze~2C8G2ulbktHlx(W&j7sUBC@JZP>sQWRxIlg)T%g~i0X^~k=&uUl_e54!da!S7Ze
zC%<gpT+*6*8y}@_pY>00=4%l9Axoa1a?<AOOk?py@|cQpdjyEPkA&wQSr>c3aPAYl
z`zI{-w{J1t6TI?|mXRq~k}Gx>!>R{&k-`=kFFunucA#WwgcTfpp_ua0<#|t0IeF|b
z9t+k}qfcuPQ4%*(W>Ikly`x0+J<jv+#e?Rw;|R$`LAHes4yf@4-2*O;EQEzm8cO)<
zKeq8&WepZ-TU-BVn+nVu=g&}MxcSYIB@k9EeFOGv(G{Ze8quG3hN?aH)`i6b(hRub
zZ4_;PXk-1XCcBD;4cg>J;SJRb{Bsbt$zDxzY#i>C?Mi1DC3o^?()l?C%e-(&_e1{9
z$nuV2ewG^<Ir$r_MT1QYsifpYd?A#ScB`CngxPQEC@CkI@8k_jGilGNs(_ImuXHgw
zwGtDgk7kDU#;A?(03G-{Z{UCv(omc^D^1P*;)KHW0EyvT+Cjn&h!xNL2X+^&G3!#N
zwwDk+cpFM;W%|oi@l<l)+w@Yv1n-4`3b@bG@`?|K(aIK2Gfd{~+QHo4@8@g74`2d?
z6DV_a!WfQKwLLk_CBMqVkVu)oKnR$=-(PQ^ZeE4ihFWQXgo@Lb3)7IMtu1+&b`+J<
zs9ldj7XB-#8%Z+Wxn-R2H<pUJC}^AQ<CqDX@u&N#rr24GaM`9;jf^l}+IzgBb)J98
z0sd4&NdP_3M=blz<Zrhp^uMjnZNdbmnjQW4u1_QM_UaUS+0r|697o$adF7UyJ2szY
z8A`zV-x6=LD~{9?3^pEma3gtQ)SCie!NjdpQNdb=)DO@i*m%qe?F~d6GuX{iw7XKg
z@C!gj&qXdlimo3OTo5v{(sx_7#N9SFdR%dnj%?C=2xh`fkxeO;dZEsYvd&ApN8;s7
zdswX~;F}Q;Os0^<kT<@h&CH5YUBGp6ZJAZuQjF@@woe!Kj{Qu4A-GT?hKe6h`*q-b
z*vX)Ht$I$I$8eO!^VfE=;1A3gff1R&nH^RK9bL7L-E=&z%62AZ7`u2nV0#k8Vioqx
z3|4xLLeagvy4%xUAMa1qL1vZtf0XX1lH(FAv|wQZELQ4W&LiC2<a=y$_P_9!N4<|0
z!XgK3vp0fOLrBkvgUyrfbx$I$wn3Kq(c3YHD6e~r?QQyd)?%(XCv|_N8mn;$-4je`
zGLl5#_m0H0q3fPa@AO<YrN<P6vpTzMSGHvrJ-4mjS-ALRt;T%CcUx+T!h?7Ve9xdI
ztS(JcBGEbBr!XzglwQ*(3WpLe<yW|a%vr*cMMvvyz3jR@;waYoOwr5XYR42=+dZZM
z7BiP()hXVQ>%~6P;a9S2e>zl!W2&oYPx;;CXaS&dkiMWk29fF>_v^d)p4Ic1J{i^L
z%U)RXOU(7L3>7z5T)}7A<I<tL9^0^UeT(|UdYMD+yRc|K|0r%6#-u|vioNEKvigX!
zf{r(;{ow;P>HGf+U<BHu=F8p=(|>?Y>Xl9M=?!11+*J>`7QDJ{lO=}=Sc*o#F$(!(
zUVuqxbV4Fod*+AZtWa`#cvNPkXN^PzQY-=s{KXF$X%@QKHmX}MJG5z?6~mqOZuD@h
zZg+OORd6+vVGg;Dn41}FKUiVcSbIh}G1<qUv_)nFO@4LoMLh-$S0AK?-p*D(Z~3{n
z+FF#M|LkHzX^oP={C*n)+wfdAGkbwI+iPv!xnI=4>jDKy3cz!xx?u!wO}h$}j3!my
znWlO|uV;%8zxw<N2NRqWEVTU5EA!eu{H*r-Iy_q7<9oxvGnXqqOQ4qNH9p~~VK1g%
z#NS0DhFT9JTch!X4OO{ODw2^r3@S~E`|kotqNM4MH7<^3vN5@h^uv>KOzB3jK*RYQ
z#co4h(CnVqr4LOa+EiK1PW7y;?9vdsDbJXrfVK)wdDR=6>n@Bj4x|Me7*bqcvT903
zeDcyjv)OU2OqQhxGSq8o4B60UC5%lnaMKd*c_QgPdtp$l%~1vjm@}p4_PHCYVU^DP
z^epSoZ;8{Ncs;wEQV5R5z1B5<vGOuvnCu`>vAx*feK*e&!k43Xe`#1+{`b><X2ug6
zZw~q>w|Rs|D{{N(Z>s!uVPUyvDq~o$+=cp=*Bcizx($AZ?tOz`^rj3qLyx4mZsV7v
z^8u~r+hrA|4bpFFY?BLi`KNX{x?EXzkvQTpQ7!y{JO;cc<I<Mqg2+he`gY})piXp8
zuYz%Zw%nf|I+7zi8ChTl<=;N1;gx%TOt{BN-R<9#5;bdt%t&FV``G(+&G45zQ@fBO
zA%~$<=-(3CzQB@zH}b;H4aJg+)_IKEM6sssQNzT@79MPnLD65jyz^6)-m_6C+Hk_u
zE1*A0_FYBKtTXY<s{;M!k;~F<$WzgE_weazc~Sk!4BH#>%(RuEv(OXyOPkXy!daZT
z#M9agukTCUiJ{JUPC4nKNQ|D)%WPz^58@jG30s>;PXMy(f*arys(@r|z-BlVdn)m{
zp+>jyF>ViqFvkTT8dU=w{brZygPQ!9xTghL<>q-CB;-^77YPye?&q8dvoS-x@tP~p
z73Av4=eYWhrQ?CjtT8;nZytDZX`GT}yZ9${4;W-5h5yxmyMIM~YwbkcaDSq`hu%^0
z%1{W&fVPG~4~~tw@at8au_#VL%xmL&jCR-vgIJg2lONHb`lSEqd?>Y<%=($lXQGVe
z9OzG`cR!<H7b;?=E3Hx3Wc29e{sWBI9F-jlvb6{|A9DC_k*{!tKLvj1A0_JH<b*=<
z=CGii%wo*A`tl;VTP!+$sXw30ggm`PTep4<&%x7hGxclT$`a<jmNQEr5N`TU{gyxL
zY3+#JZCD`QcdZlqs+wv>>$Pgtlet7U5PoO^S{NO-A4s;s@SHmA@KS5%t<v{b)(3|L
z%|G`=;4`e1^;amRFYD;*-|e)f-<k0jemI02hC)b=0BRI}dsZPy1Agu;jI>>h-eel=
zg?5F4zi8tZ7?`Io{(-leHFYj-+tJ3x_Vi3xN_;9%>!E$Z5%ai1V=hOJAinEOd#`Kw
z$%y+Wz&{Q;|5yUrjMlT!a{W7|{(6@9-|Mn0-&OzM^(K(0lo9lflGlVnNM3}IC=@U~
zh$pM@<leosf~4<W;IxY|xloUFS#PPpX0B+8fk~GtbUhOvAspuSR2-@x51S02rQ5%k
zF>}337C(pF^LdFL!JZ7p<&!k3AJF<y#sAR&H+`y?JSB_iwRii^xJmH{A%6i1A$c{t
zJeaRSZ#=b<DZYp;JYL^DYZ6MUK-v0NY?6ZSqCzJ=N%X8<Kte9<1D5@45|soF?>j7y
z7MfzXH@E%;AKZU3;okwyu)cPpn-b{a6YRYCYsOo^iNK%R{~y%;``tQAjkOm$Na-CV
zuLy;Zygs4hwEY@I!w$n{u`#C>m5=K6Ls{Y1W&b-=jj-^Xq;u(g|K+E5oazbAEPKL(
zno#5K3o*-c6&2AiCvHA`D6fL;QdgBR5a4sWLgVw)P%E5i{|ad_&t4w9ctQVLmhb2+
zZN)E(7t%XQUJVK%`Gd^I_Ubv;D2WEWre-OxL*>3_t!{Ll%s@MhHEF_WRT?i6eZ{-5
z=otr7v<qeqThZp@(T7u>tDNwJABcBmf-Np;!zC)1Jw^Dpi?=3a=mKp&nWyNWdO?jl
z)QcQtkNiPcK0*Ext1T(JgcWsB&4AQPp8Q)Y6i%3=|MrD`7e9rKH|vY-UEO&eiW9vM
z)dl(tG^KdiwWfht`^a1MMfBA6<4V>Sc-X5cy2zdyuWDB)=RAcy+p^7=k7B9CqwKX!
z-UGA<$={}p<XxkKK3_3@t4&0V<;q)Q-ZIO&!w96|R6pb;OxLV#TjLj%D0kG}0`{O%
zy4?}0FZ?>@7A}mZ!!&|yBlod*cWC2?_A$cHj*JNYb(~R~7E5FlZ|bf~2nnG@NZu0c
zUn3&e-b_IUV{Q@Rn(149WwdyP7wWstJZj#B?LCDFoO)Wj&XeZjm`-ov3^KUO*|bc<
zOVG|XMsw$5(c2kI-P^wAaT0Uz;&Ywam1z``H-<t;-UZlx1rBC?!mKBAbn+D@0B?>y
zbgO1}$rRDMJ-rK2h064`Ss@>%YykVf8DFTsqqGv9O-2mO&34-+GP<?A2|r1^yND#c
zPlJv*9ht1rTr-uBkiQCDqvU<jetly?X}@gFr`Vv|@FJ1>&bU=G^RZ3gv0grKW7-YW
z6V7!J0mZs_w{UyTldd1FX?>C=J0`P4&9>3n#;f`tb@v2mSGa`#H0HErk%{ubz;~Mc
zr9#LqD1_wwf?xN`BBo_med{WbTC`vBJ}B78&)Vj*VBl?O6HR?nG1ZSMLb$SxX!;;r
z^gaF*p6qGYf66O2E{Pgl+{sU&CsXpoSNyEP&}s6QO;e^)wcoT@GthTR{uFeLk`F-f
zG2%3g&>3i4bFzKOJ}s@|4o{Xykc<-#WOegHW-dg(h<9n~CcSB;!N2;XK^JV}e#Cg8
zw9!hOP~mqQdMv#sQ(dXyCmDYJ**}VRnJ!xfY1zQHb{<84=n~bDyaE(L^1;aFL-{Xd
z{TarnAU^jbplVLoE;v&j*9RkMV7kc`r@VxlRGEQa|Ism0?anu03qPE;TdDR1jiYz&
z^8cbCP0i<!sjqupELp*Wv98yjzv0*K2U1B1IRJ%_d{kgQlw^g8;nzLNk94za%q7z5
zt2ZwFuXsGm9BFU;q_$DL@Ci-BY<;v@YfN-A;4+Ia`czXb?A$l}JHveb;e*5ZW!vAt
zK`KQB`vVKvm6W_3#t6xWCo4?U{xagCQv$&)@0@IdZ9xrOvW+;3W;PbRrKO7Z75r|c
zMjty-x5ehjJcXwLy+>=`y7Y%#B#(1$_a8hIp096}Nfh<hZAgW`^=L>1AyZHY$*00(
zU?$n5n$Tzq%;6l#x=6cPbvqVOuLTX5a-Sx*L#Z?S7vq*}AHTd6KZQ8WZiOoDWt!}^
z`GX_V%j8}c=plZAx9nhwkm^1q<V8>j$>+q+LK3HE{wn-}2D7HoFg44TdqU~iEbgTd
zD>On;^aqUs!Gf1Cd)BO`Clu|>%wkDC96Sv=bjKzg?z!W7b((q+5tpH=eo-@$Lhsug
zp+!hu1;z-;=ci45?BzOQ)T$rw!>D2SZfHw|F-5bEw3$05pR>N0?Ge)^7G3<)g`We&
zCgYqV7b9$ZwqbrL=KIt?AfA%o<+r*?BXYmZk?J*_@?8^>K_Mhx2>c!wdGa0IW^!9_
zHEC@lOclZJecvet@94JqR4m9a7bbj`=p2*q@>HMqs@=fD&ATUUl4d)9N%&9C{HJv<
zkm6)n*Z)dVOycv*GDw+ON?rtAqvR_R#;c6u)VM40G!tEOZpMqbol86kHsHgM(IS^<
zG<<kY`e<U^!k6fvKlu`d4BKbFXi5IEJgtp^*z@H|>l`i)&zdz;=+{v&Oh{e?g^+x8
zvb4t9@GR4kfAWqkPi?Nv#a(OHnMtK-GfRW8Ux(<li)_`685a=&S=A${s<oTcEY=|7
zv>#9uk#<xss$ejrceolM9Vmo^+;LXg1&yRI*Q4X=)SOZymIuDCebP<V9~BQqIXe<r
zX|be***fs<wS6~8{{ev?C)yZ_1fmvJGcnALVck7>5fnl~0zfeIh{@`-#dCNez8jj7
zkvr4`-o*6q#1z)3=jWD{svE8WxvXv>Wof1`+B%B$-cSb5zk-PwB*BJzFdk#~r^YwP
zjwvr}vJ9Ttc^pFePzVX>;R+MCgD4N3kltwaLU4``Lv~l#HZUw$bcvmzF&DTQGtI6^
zH|GWF;yYuO+dahHRx7`?vkW>&6Qht8Avq4SMhTfhJGyD#?QZQsKk4)dD;c5$OJBKh
z#T-|i9hfDf_CZV07k&&^Gh2mg%iju5*ekrBc02m4O6$?PQCNOvg@Y`jAcvt460)2A
z7~$eM^uALRhSB=Aw!yDse)TmBk(v%F9otJ(dK+QO>L}XXKH+G?{#6~Luzn8r5%%l)
ztLp`&QAiF#AtdBDnQc_xy(e~trrV5Gg;rE%N`@1cyqOicJ@Mqp=MC3{QBY^o13mn#
z>cd`q0e*e!x7HLI2kD`IF+u_;goL~f=38Fw#fYit7D^Y|lu%ZG4M#5xoq_5>4ezdZ
zk=7&H3R|O*ee(`K3NR&u^2AV#WuU~rrRrbUdaeIa5YmCkGK9P`t=Xps!vcc<kd{jg
z<AqvsUX~!F=ak7;G0t`X2dCvlkK`M^)U2P2p1HJ>C~$l2r*zfZg<7bE6EKOQDVfmY
zR77$B3LznX5TA4!iclDAn^8(}I^<<<xXDg}3?$U_is+>&TfE}qRO47oHAuEpxS6Pk
zkP$)hYS1-G$lm}nPQhXL<h_e7rR8ekXJOP(8qpf(#k70#7Fc67;>t5m>V`x8r|C1H
ze>HmQENHq7>80^UUJD8#A%7Jt!+?Wv`bn7ZqH-us!?Hy{eyptGl!?*Kn+PakmNh%6
zzn-y^K)A{9EfEp9i2Ts;gkg&r=+;fhJ}88QycuB@CA{0zV0eqr7imaf5vDq4v^F!*
zLd!DGzUk$iYAR{FY=5Zl#q?sWg6GAU0YY*R3LznHPgq(|-#Q!pi}YzT$U2s#xtBEQ
zFrf`+vsgQi(AQBT%vxE2%Ic$=wI{fC68Ir^3H%)v6mnoaIR=H0koN^DB6gDrbxxf7
z)T{>4wb)iG0lZF5O=k9)JC1a;(NwMLFq<r*t`g|yIF_3F`s+8EfaF!65EAlE8G0H!
zpdVF6ok-Qt)N93gV!PY8sM%T<41Bg`W7=m<wgBO!7FM3I7lE3*u($7FM6k%@OuUm2
zgyj>2ymwH9(32@ua{5(zo=7S#aQuQp3USR&4I-+kb8=>#*hHsQh=>_m*go~O-n|&g
zMeRxj#a2+5&uJp02Q5NEJ`!Ol(I?tu`7)V*Rb1|j|1S&v`3+>d%H&ylw}!@Cod)$!
z>%!F-;kWi=h6%}TD1?N3NL(7rrPJF}M6jJ(S)p})rp`>fqd1N9%XYRJim0@bnF(zh
zeZ05f&TdDeknDo4Q9?dEll^Oy(1CfF&>xHQ6f>i+ntIKdnOjxewpA3HUNim$A@k58
zB;@np``3iipbqEYpyB9KNwYJJf7QE8b-`#?7n3`>Hf_zn*K0QwWGX4y3oSxIJ|XRl
z_)WUH4$RWUd)$&64a%8brtMv@lWJ+weeXot*&C?l1z!J-0)%WXLv}+UB;=C=j?-D+
zsRyM9#cY0^)&#s@Vrq24b|&gK`cdnVz$3b@zxt|A2tpww<f{;xi8IkeiDG-<X)Tv-
zbTAmh<kq}k`Jm(_98Lvk6p|e<Mo7q4B$<YB$JFEF5zOt>7g?&RFVc`{J2FgCb(y7C
z9}&bs_JqtpAtdBWgNj&=m`>mA$=KIzP&kqF1P@ej*vJ$&AZ>b1yTjl0H0H~Y9ndvO
z2obT4)8L@AH4Mh{nQ#f6t1~1nP`vM@1{yVM=H6?jl+`nXluSY)B!pOeVWQk^NA;AJ
zBLi)7)r1$#6m@u64TM%3tw|7QG+8rrjgna?goKckz4<jWVkS)yMJRQ#p*a(1WV=yv
z0LBOjAyY)rMB5InlP_apispPhQ{A3eM~}t$;(D3ZWS<{pU}4=Y2iB8WmUUg<dJlw<
z4~cP{X6J+>GQ3;0J?Gjfv3EH*Pa;y&ZJugB?r&@~LnfhXln`=|V~*3g$l_V#92Ujb
zqC>pPxgLKKxrqE*0))#ps)>*u6hcDCE0E>a)FV&J(rcoYtodKo&dmoS)q-3W5&2g{
zsDfk?3LzonH3`kc`fI=3VylZVXX@nM@~%V!ese!6y`y9Rg^&>Pr@%I+=7<Nz(4UL9
zQ>-IY?MvIa6qhaC!>dt9$QTMCA>@zKah&3>t@HD41$tAjNFA;jc}mNfETtf0m^DfW
zc^iCwP3uYxBv3O;;l)4UEQ^{oBbq__s(UA&3JM`1<c&$nAwn(?DZIZ(D(n9NEoApm
z(t`!{gpfBzOZBUyUBVvRSa**v5I;AAkRgl_5<=b)o%|XcYF|%y(#gFp(G(kVvyOuF
zpb!#5-Xlri&~P!6d)pQMTb64ru4fSiNnwnT5b|L#qv}N@$*F0ID~eG_AtV{J2nit{
z1~=46vT05DYjvU$5<?**gnT^OkxY6pt=4ClkaVDHlo0Ys=rsQBkFy|O99o2gkWa#>
ze+`X75<`oS5b~Ls8JbAGIJ5`}A)lGKG7R#ip+!gtA>>QL7HfnMLcTN<LP7{3Um6M_
lA%u`G4TX>pLdciq{{yoq!4iHt0&@TW002ovPDHLkV1mzA;FSOX

literal 0
HcmV?d00001

diff --git a/demo/documented/mesh-generation/tetrahedron.off b/demo/documented/mesh-generation/tetrahedron.off
new file mode 100644
index 0000000..3eb39db
--- /dev/null
+++ b/demo/documented/mesh-generation/tetrahedron.off
@@ -0,0 +1,12 @@
+OFF
+4 4 0
+0.0 0.0 0.0
+0.0 0.0 1.0
+0.0 1.0 0.0
+1.0 0.0 0.0
+3 3 2 1
+3 0 3 1
+3 0 2 3
+3 0 1 2
+
+
diff --git a/demo/documented/mixed-poisson-dual/common.txt b/demo/documented/mixed-poisson-dual/common.txt
new file mode 100644
index 0000000..39b844b
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/common.txt
@@ -0,0 +1,75 @@
+
+This demo illustrates how to solve Poisson equation using an
+alternative mixed formulation. In particular, it illustrates how to
+
+* Use mixed and non-continuous finite element spaces
+* Set essential boundary conditions for subspaces
+
+Equation and problem definition
+-------------------------------
+
+A formulation of Poisson equation involves introducing an additional
+(vector) variable, namely the (negative) flux: :math:`\sigma = -
+\nabla u`. The partial differential equations then read
+
+.. math::
+   \sigma + \nabla u &= 0 \quad {\rm in} \ \Omega, \\
+   \nabla \cdot \sigma &= f \quad {\rm in} \ \Omega,
+
+with boundary conditions
+
+.. math::
+   u = u_0 \quad {\rm on} \ \Gamma_{D},  \\
+   - \sigma \cdot n = g \quad {\rm on} \ \Gamma_{N}.
+
+The same equations arise in connection with flow in porous media,
+where thery are referred to as Darcy flow.
+
+After multiplying by test functions :math:`\tau` and :math:`v`,
+integrating over the domain, and integrating term :math:`\nabla \cdot
+\sigma \ v` by parts, one obtains the following variational
+formulation: find :math:`\sigma \in \Sigma` and :math:`v \in V`
+satisfying
+
+.. math::
+   \int_{\Omega} (\sigma \cdot \tau + \nabla u \cdot \ \tau) \ {\rm d} x
+   &= 0
+   \quad \forall \ \tau \in \Sigma, \\
+
+   \int_{\Omega} \sigma \cdot \nabla v \ {\rm d} x
+   &= - \int_{\Omega}     f \ v \ {\rm d} x
+      - \int_{\Gamma_{N}} g \ v \ {\rm d} x
+   \quad \forall \ v \in V.
+
+Compared to classical mixed formulation used in demo `Mixed
+formulation for Poisson equation`, the Dirichlet condition is here
+essential one and Neumann condition is natural.
+
+To discretize the above formulation, two discrete function spaces
+:math:`\Sigma_h \subset \Sigma` and :math:`V_h \subset V` are needed
+to form a mixed function space :math:`\Sigma_h \times V_h`. A stable
+choice of finite element spaces is to let :math:`\Sigma_h` be the
+discontinuous Raviart-Thomas elements of polynomial order :math:`k`
+and let :math:`V_h` be Lagrange elements of polynomial order
+:math:`k+1`.
+
+We will use the same definitions of functions and boundaries as in the
+demo for Poisson's equation. These are:
+
+* :math:`\Omega = [0,1] \times [0,1]` (a unit square)
+* :math:`\Gamma_{D} = \{(0, y) \cup (1, y) \in \partial \Omega\}`
+* :math:`\Gamma_{N} = \{(x, 0) \cup (x, 1) \in \partial \Omega\}`
+* :math:`u_0 = 0`
+* :math:`g = \sin(5x)`   (flux)
+* :math:`f = 10\exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)`   (source term)
+
+With the above input the solution for :math:`u` and :math:`\sigma`
+will look as follows:
+
+.. image:: ../mixed-poisson-dual_u.png
+    :scale: 75
+    :align: center
+
+.. image:: ../mixed-poisson-dual_sigma.png
+    :scale: 75
+    :align: center
diff --git a/demo/documented/mixed-poisson-dual/cpp/CMakeLists.txt b/demo/documented/mixed-poisson-dual/cpp/CMakeLists.txt
new file mode 100644
index 0000000..a62d7b9
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_mixed-poisson-dual)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/mixed-poisson-dual/cpp/MixedPoissonDual.h b/demo/documented/mixed-poisson-dual/cpp/MixedPoissonDual.h
new file mode 100644
index 0000000..922f7c4
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/cpp/MixedPoissonDual.h
@@ -0,0 +1,13248 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __MIXEDPOISSONDUAL_H
+#define __MIXEDPOISSONDUAL_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class mixedpoissondual_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new mixedpoissondual_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class mixedpoissondual_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Raviart-Thomas', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 8;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.235702260395516, 0.404145188432738, -0.233333333333333, 0.182574185835055, -0.14142135623731, 0.0816496580927727};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, 0.173205080756888, -0.233333333333333, 0.0, 0.14142135623731, -0.122474487139159};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {-0.117851130197758, -0.115470053837925, 0.266666666666667, 0.0, 0.141421356237309, -0.122474487139159};
+      
+      static const double coefficients1[6] = \
+      {0.235702260395516, 0.0, 0.466666666666667, 0.0, 0.0, 0.244948974278318};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.117851130197758, -0.577350269189626, -0.466666666666667, 0.182574185835055, 0.0, -0.0408248290463862};
+      
+      static const double coefficients1[6] = \
+      {0.117851130197758, 0.173205080756888, 0.233333333333334, 0.0, 0.14142135623731, 0.122474487139159};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.117851130197758, 0.115470053837925, 0.733333333333333, 0.0, -0.14142135623731, 0.122474487139159};
+      
+      static const double coefficients1[6] = \
+      {-0.235702260395516, 0.0, -0.466666666666667, 0.0, 0.0, -0.244948974278318};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {-0.117851130197758, -0.288675134594813, -0.033333333333333, -0.182574185835055, 0.0, 0.0408248290463862};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, 0.692820323027551, 0.266666666666666, 0.0, -0.141421356237309, -0.122474487139159};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.235702260395516, 0.404145188432738, -0.233333333333333, 0.182574185835055, -0.14142135623731, 0.0816496580927725};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, -0.692820323027551, 0.266666666666667, 0.0, 0.14142135623731, -0.122474487139159};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {1.06066017177982, 0.173205080756888, -0.3, -0.365148371670111, 0.14142135623731, -0.0408248290463865};
+      
+      static const double coefficients1[6] = \
+      {0.0, -0.346410161513775, 0.0, 0.0, -0.282842712474619, 0.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.3, -0.182574185835055, -0.141421356237309, 0.163299316185545};
+      
+      static const double coefficients1[6] = \
+      {1.06066017177982, -0.173205080756887, 0.3, 0.0, -0.141421356237309, -0.367423461417477};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.235702260395516, 0.404145188432738, -0.233333333333333, 0.182574185835055, -0.14142135623731, 0.0816496580927727};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, 0.173205080756888, -0.233333333333333, 0.0, 0.14142135623731, -0.122474487139159};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {-0.117851130197758, -0.115470053837925, 0.266666666666667, 0.0, 0.141421356237309, -0.122474487139159};
+      
+      static const double coefficients1[6] = \
+      {0.235702260395516, 0.0, 0.466666666666667, 0.0, 0.0, 0.244948974278318};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.117851130197758, -0.577350269189626, -0.466666666666667, 0.182574185835055, 0.0, -0.0408248290463862};
+      
+      static const double coefficients1[6] = \
+      {0.117851130197758, 0.173205080756888, 0.233333333333334, 0.0, 0.14142135623731, 0.122474487139159};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.117851130197758, 0.115470053837925, 0.733333333333333, 0.0, -0.14142135623731, 0.122474487139159};
+      
+      static const double coefficients1[6] = \
+      {-0.235702260395516, 0.0, -0.466666666666667, 0.0, 0.0, -0.244948974278318};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {-0.117851130197758, -0.288675134594813, -0.033333333333333, -0.182574185835055, 0.0, 0.0408248290463862};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, 0.692820323027551, 0.266666666666666, 0.0, -0.141421356237309, -0.122474487139159};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.235702260395516, 0.404145188432738, -0.233333333333333, 0.182574185835055, -0.14142135623731, 0.0816496580927725};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, -0.692820323027551, 0.266666666666667, 0.0, 0.14142135623731, -0.122474487139159};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {1.06066017177982, 0.173205080756888, -0.3, -0.365148371670111, 0.14142135623731, -0.0408248290463865};
+      
+      static const double coefficients1[6] = \
+      {0.0, -0.346410161513775, 0.0, 0.0, -0.282842712474619, 0.0};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.3, -0.182574185835055, -0.141421356237309, 0.163299316185545};
+      
+      static const double coefficients1[6] = \
+      {1.06066017177982, -0.173205080756887, 0.3, 0.0, -0.141421356237309, -0.367423461417477};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[0] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[1] = result;
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[2] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[3] = result;
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[4] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[5] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[6] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[7] = result;
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[2]*(1.0/detJ)*J[0]*2.0 + dof_values[3]*((1.0/detJ)*(J[0]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[1]*(-2.0))) + dof_values[5]*(1.0/detJ)*J[1];
+    vertex_values[2] = dof_values[0]*(1.0/detJ)*J[0]*2.0 + dof_values[1]*((1.0/detJ)*(J[0]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[0]*(-1.0) + J[1])) + dof_values[5]*((1.0/detJ)*(J[0]*2.0 + J[1]*(-2.0)));
+    vertex_values[4] = dof_values[0]*((1.0/detJ)*(J[1]*(-1.0))) + dof_values[1]*(1.0/detJ)*J[1]*2.0 + dof_values[2]*((1.0/detJ)*(J[0]*(-1.0) + J[1])) + dof_values[3]*((1.0/detJ)*(J[0]*2.0 + J[1]*(-2.0)));
+    vertex_values[1] = dof_values[2]*(1.0/detJ)*J[2]*2.0 + dof_values[3]*((1.0/detJ)*(J[2]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[3]*(-2.0))) + dof_values[5]*(1.0/detJ)*J[3];
+    vertex_values[3] = dof_values[0]*(1.0/detJ)*J[2]*2.0 + dof_values[1]*((1.0/detJ)*(J[2]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[2]*(-1.0) + J[3])) + dof_values[5]*((1.0/detJ)*(J[2]*2.0 + J[3]*(-2.0)));
+    vertex_values[5] = dof_values[0]*((1.0/detJ)*(J[3]*(-1.0))) + dof_values[1]*(1.0/detJ)*J[3]*2.0 + dof_values[2]*((1.0/detJ)*(J[2]*(-1.0) + J[3])) + dof_values[3]*((1.0/detJ)*(J[2]*2.0 + J[3]*(-2.0)));
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new mixedpoissondual_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class mixedpoissondual_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new mixedpoissondual_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class mixedpoissondual_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(FiniteElement('Discontinuous Raviart-Thomas', Domain(Cell('triangle', 2)), 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 18;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.235702260395516, 0.404145188432738, -0.233333333333333, 0.182574185835055, -0.14142135623731, 0.0816496580927727};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, 0.173205080756888, -0.233333333333333, 0.0, 0.14142135623731, -0.122474487139159};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {-0.117851130197758, -0.115470053837925, 0.266666666666667, 0.0, 0.141421356237309, -0.122474487139159};
+      
+      static const double coefficients1[6] = \
+      {0.235702260395516, 0.0, 0.466666666666667, 0.0, 0.0, 0.244948974278318};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.117851130197758, -0.577350269189626, -0.466666666666667, 0.182574185835055, 0.0, -0.0408248290463862};
+      
+      static const double coefficients1[6] = \
+      {0.117851130197758, 0.173205080756888, 0.233333333333334, 0.0, 0.14142135623731, 0.122474487139159};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.117851130197758, 0.115470053837925, 0.733333333333333, 0.0, -0.14142135623731, 0.122474487139159};
+      
+      static const double coefficients1[6] = \
+      {-0.235702260395516, 0.0, -0.466666666666667, 0.0, 0.0, -0.244948974278318};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {-0.117851130197758, -0.288675134594813, -0.033333333333333, -0.182574185835055, 0.0, 0.0408248290463862};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, 0.692820323027551, 0.266666666666666, 0.0, -0.141421356237309, -0.122474487139159};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.235702260395516, 0.404145188432738, -0.233333333333333, 0.182574185835055, -0.14142135623731, 0.0816496580927725};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, -0.692820323027551, 0.266666666666667, 0.0, 0.14142135623731, -0.122474487139159};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {1.06066017177982, 0.173205080756888, -0.3, -0.365148371670111, 0.14142135623731, -0.0408248290463865};
+      
+      static const double coefficients1[6] = \
+      {0.0, -0.346410161513775, 0.0, 0.0, -0.282842712474619, 0.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.3, -0.182574185835055, -0.141421356237309, 0.163299316185545};
+      
+      static const double coefficients1[6] = \
+      {1.06066017177982, -0.173205080756887, 0.3, 0.0, -0.141421356237309, -0.367423461417477};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 18; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.235702260395516, 0.404145188432738, -0.233333333333333, 0.182574185835055, -0.14142135623731, 0.0816496580927727};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, 0.173205080756888, -0.233333333333333, 0.0, 0.14142135623731, -0.122474487139159};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {-0.117851130197758, -0.115470053837925, 0.266666666666667, 0.0, 0.141421356237309, -0.122474487139159};
+      
+      static const double coefficients1[6] = \
+      {0.235702260395516, 0.0, 0.466666666666667, 0.0, 0.0, 0.244948974278318};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.117851130197758, -0.577350269189626, -0.466666666666667, 0.182574185835055, 0.0, -0.0408248290463862};
+      
+      static const double coefficients1[6] = \
+      {0.117851130197758, 0.173205080756888, 0.233333333333334, 0.0, 0.14142135623731, 0.122474487139159};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.117851130197758, 0.115470053837925, 0.733333333333333, 0.0, -0.14142135623731, 0.122474487139159};
+      
+      static const double coefficients1[6] = \
+      {-0.235702260395516, 0.0, -0.466666666666667, 0.0, 0.0, -0.244948974278318};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {-0.117851130197758, -0.288675134594813, -0.033333333333333, -0.182574185835055, 0.0, 0.0408248290463862};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, 0.692820323027551, 0.266666666666666, 0.0, -0.141421356237309, -0.122474487139159};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.235702260395516, 0.404145188432738, -0.233333333333333, 0.182574185835055, -0.14142135623731, 0.0816496580927725};
+      
+      static const double coefficients1[6] = \
+      {-0.117851130197758, -0.692820323027551, 0.266666666666667, 0.0, 0.14142135623731, -0.122474487139159};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {1.06066017177982, 0.173205080756888, -0.3, -0.365148371670111, 0.14142135623731, -0.0408248290463865};
+      
+      static const double coefficients1[6] = \
+      {0.0, -0.346410161513775, 0.0, 0.0, -0.282842712474619, 0.0};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.3, -0.182574185835055, -0.141421356237309, 0.163299316185545};
+      
+      static const double coefficients1[6] = \
+      {1.06066017177982, -0.173205080756887, 0.3, 0.0, -0.141421356237309, -0.367423461417477};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 18; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[24];
+    for (unsigned int r = 0; r < 24; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 18; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 9:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 12:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 13:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[0] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[1] = result;
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[2] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[3] = result;
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[4] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[5] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[6] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[7] = result;
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[9] = vals[2];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[2];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[11] = vals[2];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[12] = vals[2];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[13] = vals[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[2];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[15] = vals[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[16] = vals[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[17] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[2]*(1.0/detJ)*J[0]*2.0 + dof_values[3]*((1.0/detJ)*(J[0]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[1]*(-2.0))) + dof_values[5]*(1.0/detJ)*J[1];
+    vertex_values[3] = dof_values[0]*(1.0/detJ)*J[0]*2.0 + dof_values[1]*((1.0/detJ)*(J[0]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[0]*(-1.0) + J[1])) + dof_values[5]*((1.0/detJ)*(J[0]*2.0 + J[1]*(-2.0)));
+    vertex_values[6] = dof_values[0]*((1.0/detJ)*(J[1]*(-1.0))) + dof_values[1]*(1.0/detJ)*J[1]*2.0 + dof_values[2]*((1.0/detJ)*(J[0]*(-1.0) + J[1])) + dof_values[3]*((1.0/detJ)*(J[0]*2.0 + J[1]*(-2.0)));
+    vertex_values[1] = dof_values[2]*(1.0/detJ)*J[2]*2.0 + dof_values[3]*((1.0/detJ)*(J[2]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[3]*(-2.0))) + dof_values[5]*(1.0/detJ)*J[3];
+    vertex_values[4] = dof_values[0]*(1.0/detJ)*J[2]*2.0 + dof_values[1]*((1.0/detJ)*(J[2]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[2]*(-1.0) + J[3])) + dof_values[5]*((1.0/detJ)*(J[2]*2.0 + J[3]*(-2.0)));
+    vertex_values[7] = dof_values[0]*((1.0/detJ)*(J[3]*(-1.0))) + dof_values[1]*(1.0/detJ)*J[3]*2.0 + dof_values[2]*((1.0/detJ)*(J[2]*(-1.0) + J[3])) + dof_values[3]*((1.0/detJ)*(J[2]*2.0 + J[3]*(-2.0)));
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[8];
+    vertex_values[5] = dof_values[9];
+    vertex_values[8] = dof_values[10];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoissondual_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoissondual_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new mixedpoissondual_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class mixedpoissondual_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new mixedpoissondual_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class mixedpoissondual_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Raviart-Thomas', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 8*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 8;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 8;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 8*c.entity_indices[2][0];
+    dofs[1] = 8*c.entity_indices[2][0] + 1;
+    dofs[2] = 8*c.entity_indices[2][0] + 2;
+    dofs[3] = 8*c.entity_indices[2][0] + 3;
+    dofs[4] = 8*c.entity_indices[2][0] + 4;
+    dofs[5] = 8*c.entity_indices[2][0] + 5;
+    dofs[6] = 8*c.entity_indices[2][0] + 6;
+    dofs[7] = 8*c.entity_indices[2][0] + 7;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 3;
+      dofs[4] = 4;
+      dofs[5] = 5;
+      dofs[6] = 6;
+      dofs[7] = 7;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[1][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[1][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[2][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[2][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[4][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[5][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[7][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new mixedpoissondual_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class mixedpoissondual_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + 2*num_global_entities[1] + num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new mixedpoissondual_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class mixedpoissondual_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(FiniteElement('Discontinuous Raviart-Thomas', Domain(Cell('triangle', 2)), 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + 2*num_global_entities[1] + 9*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 18;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 9;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + 8*c.entity_indices[2][0];
+    dofs[1] = offset + 8*c.entity_indices[2][0] + 1;
+    dofs[2] = offset + 8*c.entity_indices[2][0] + 2;
+    dofs[3] = offset + 8*c.entity_indices[2][0] + 3;
+    dofs[4] = offset + 8*c.entity_indices[2][0] + 4;
+    dofs[5] = offset + 8*c.entity_indices[2][0] + 5;
+    dofs[6] = offset + 8*c.entity_indices[2][0] + 6;
+    dofs[7] = offset + 8*c.entity_indices[2][0] + 7;
+    offset += 8*num_global_entities[2];
+    dofs[8] = offset + c.entity_indices[0][0];
+    dofs[9] = offset + c.entity_indices[0][1];
+    dofs[10] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[11] = offset + 2*c.entity_indices[1][0];
+    dofs[12] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[13] = offset + 2*c.entity_indices[1][1];
+    dofs[14] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[15] = offset + 2*c.entity_indices[1][2];
+    dofs[16] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[17] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 9;
+      dofs[1] = 10;
+      dofs[2] = 11;
+      dofs[3] = 12;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 8;
+      dofs[1] = 10;
+      dofs[2] = 13;
+      dofs[3] = 14;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 8;
+      dofs[1] = 9;
+      dofs[2] = 15;
+      dofs[3] = 16;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 8;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 10;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 11;
+        dofs[1] = 12;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 13;
+        dofs[1] = 14;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 15;
+        dofs[1] = 16;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 3;
+      dofs[4] = 4;
+      dofs[5] = 5;
+      dofs[6] = 6;
+      dofs[7] = 7;
+      dofs[8] = 17;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[1][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[1][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[2][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[2][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[4][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[5][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[7][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[8][0] = vertex_coordinates[0];
+    dof_coordinates[8][1] = vertex_coordinates[1];
+    dof_coordinates[9][0] = vertex_coordinates[2];
+    dof_coordinates[9][1] = vertex_coordinates[3];
+    dof_coordinates[10][0] = vertex_coordinates[4];
+    dof_coordinates[10][1] = vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[11][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[12][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[12][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[13][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[13][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[14][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[14][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[15][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[15][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[16][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[16][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[17][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[17][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoissondual_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoissondual_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new mixedpoissondual_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class mixedpoissondual_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    64
+    // Number of operations (multiply-add pairs) for tensor contraction: 1328
+    // Total number of operations (multiply-add pairs):                  1395
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = 1.0 / (detJ)*det*J[0]*K[0]*(1.0);
+    const double G0_0_1 = 1.0 / (detJ)*det*J[0]*K[2]*(1.0);
+    const double G0_1_0 = 1.0 / (detJ)*det*J[1]*K[0]*(1.0);
+    const double G0_1_1 = 1.0 / (detJ)*det*J[1]*K[2]*(1.0);
+    const double G1_0_0 = 1.0 / (detJ)*det*J[2]*K[1]*(1.0);
+    const double G1_0_1 = 1.0 / (detJ)*det*J[2]*K[3]*(1.0);
+    const double G1_1_0 = 1.0 / (detJ)*det*J[3]*K[1]*(1.0);
+    const double G1_1_1 = 1.0 / (detJ)*det*J[3]*K[3]*(1.0);
+    const double G2_0_0 = 1.0 / (detJ*detJ)*det*J[0]*J[0]*(1.0);
+    const double G2_0_1 = 1.0 / (detJ*detJ)*det*J[0]*J[1]*(1.0);
+    const double G2_1_0 = 1.0 / (detJ*detJ)*det*J[1]*J[0]*(1.0);
+    const double G2_1_1 = 1.0 / (detJ*detJ)*det*J[1]*J[1]*(1.0);
+    const double G3_0_0 = 1.0 / (detJ*detJ)*det*J[2]*J[2]*(1.0);
+    const double G3_0_1 = 1.0 / (detJ*detJ)*det*J[2]*J[3]*(1.0);
+    const double G3_1_0 = 1.0 / (detJ*detJ)*det*J[3]*J[2]*(1.0);
+    const double G3_1_1 = 1.0 / (detJ*detJ)*det*J[3]*J[3]*(1.0);
+    const double G4_0_0 = 1.0 / (detJ)*det*J[0]*K[0]*(1.0);
+    const double G4_0_1 = 1.0 / (detJ)*det*J[0]*K[2]*(1.0);
+    const double G4_1_0 = 1.0 / (detJ)*det*J[1]*K[0]*(1.0);
+    const double G4_1_1 = 1.0 / (detJ)*det*J[1]*K[2]*(1.0);
+    const double G5_0_0 = 1.0 / (detJ)*det*J[2]*K[1]*(1.0);
+    const double G5_0_1 = 1.0 / (detJ)*det*J[2]*K[3]*(1.0);
+    const double G5_1_0 = 1.0 / (detJ)*det*J[3]*K[1]*(1.0);
+    const double G5_1_1 = 1.0 / (detJ)*det*J[3]*K[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333339*G2_0_0 + 0.0166666666666667*G2_0_1 + 0.0166666666666667*G2_1_0 + 0.0333333333333337*G2_1_1 + 0.0833333333333339*G3_0_0 + 0.0166666666666667*G3_0_1 + 0.0166666666666667*G3_1_0 + 0.0333333333333337*G3_1_1;
+    A[1] = -0.0416666666666669*G2_0_0 - 0.00833333333333332*G2_0_1 - 0.00833333333333331*G2_1_0 - 0.041666666666667*G2_1_1 - 0.0416666666666669*G3_0_0 - 0.00833333333333332*G3_0_1 - 0.00833333333333331*G3_1_0 - 0.041666666666667*G3_1_1;
+    A[2] = -0.0166666666666667*G2_0_0 + 0.00833333333333339*G2_0_1 - 0.00833333333333333*G2_1_1 - 0.0166666666666667*G3_0_0 + 0.00833333333333339*G3_0_1 - 0.00833333333333333*G3_1_1;
+    A[3] = -0.0166666666666667*G2_0_0 + 0.00833333333333333*G2_0_1 - 0.0500000000000004*G2_1_0 + 0.041666666666667*G2_1_1 - 0.0166666666666667*G3_0_0 + 0.00833333333333333*G3_0_1 - 0.0500000000000004*G3_1_0 + 0.041666666666667*G3_1_1;
+    A[4] = -0.041666666666667*G2_0_0 + 0.0500000000000002*G2_0_1 - 0.00833333333333342*G2_1_0 + 0.0166666666666668*G2_1_1 - 0.041666666666667*G3_0_0 + 0.0500000000000002*G3_0_1 - 0.00833333333333342*G3_1_0 + 0.0166666666666668*G3_1_1;
+    A[5] = 0.0833333333333339*G2_0_0 - 0.1*G2_0_1 + 0.0166666666666667*G2_1_0 - 0.0333333333333336*G2_1_1 + 0.0833333333333339*G3_0_0 - 0.1*G3_0_1 + 0.0166666666666667*G3_1_0 - 0.0333333333333336*G3_1_1;
+    A[6] = 0.0750000000000003*G2_0_0 - 0.0250000000000001*G2_0_1 - 0.0250000000000003*G2_1_1 + 0.0750000000000003*G3_0_0 - 0.0250000000000001*G3_0_1 - 0.0250000000000003*G3_1_1;
+    A[7] = 0.0250000000000001*G2_0_1 - 0.0500000000000004*G2_1_1 + 0.0250000000000001*G3_0_1 - 0.0500000000000004*G3_1_1;
+    A[8] = -0.00833333333333366*G4_0_0 - 0.00833333333333363*G4_0_1 + 0.00416666666666659*G4_1_0 + 0.0041666666666666*G4_1_1 - 0.00833333333333366*G5_0_0 - 0.00833333333333363*G5_0_1 + 0.00416666666666659*G5_1_0 + 0.0041666666666666*G5_1_1;
+    A[9] = 0.158333333333334*G4_0_0 - 0.00416666666666708*G4_1_0 + 0.158333333333334*G5_0_0 - 0.00416666666666708*G5_1_0;
+    A[10] = 0.00833333333333368*G4_0_1 - 0.0791666666666673*G4_1_1 + 0.00833333333333368*G5_0_1 - 0.0791666666666673*G5_1_1;
+    A[11] = 0.187500000000001*G4_0_0 + 0.375000000000002*G4_0_1 + 0.150000000000002*G4_1_0 + 0.0750000000000001*G4_1_1 + 0.187500000000001*G5_0_0 + 0.375000000000002*G5_0_1 + 0.150000000000002*G5_1_0 + 0.0750000000000001*G5_1_1;
+    A[12] = -0.0375*G4_0_0 - 0.0750000000000008*G4_0_1 - 0.187500000000001*G4_1_0 - 0.0374999999999995*G4_1_1 - 0.0375*G5_0_0 - 0.0750000000000008*G5_0_1 - 0.187500000000001*G5_1_0 - 0.0374999999999995*G5_1_1;
+    A[13] = 0.0375000000000004*G4_0_0 + 0.0750000000000013*G4_1_0 + 0.0375000000000009*G4_1_1 + 0.0375000000000004*G5_0_0 + 0.0750000000000013*G5_1_0 + 0.0375000000000009*G5_1_1;
+    A[14] = 0.0374999999999999*G4_0_0 + 0.187500000000001*G4_1_0 + 0.0374999999999998*G4_1_1 + 0.0374999999999999*G5_0_0 + 0.187500000000001*G5_1_0 + 0.0374999999999998*G5_1_1;
+    A[15] = 0.0375000000000006*G4_0_0 + 0.0750000000000005*G4_0_1 + 0.0375000000000003*G4_1_1 + 0.0375000000000006*G5_0_0 + 0.0750000000000005*G5_0_1 + 0.0375000000000003*G5_1_1;
+    A[16] = -0.187500000000001*G4_0_0 - 0.375000000000002*G4_0_1 - 0.0750000000000002*G4_1_1 - 0.187500000000001*G5_0_0 - 0.375000000000002*G5_0_1 - 0.0750000000000002*G5_1_1;
+    A[17] = -0.225000000000001*G4_0_0 - 0.225000000000003*G4_1_0 - 0.225000000000001*G5_0_0 - 0.225000000000003*G5_1_0;
+    A[18] = -0.0416666666666669*G2_0_0 - 0.00833333333333331*G2_0_1 - 0.00833333333333332*G2_1_0 - 0.041666666666667*G2_1_1 - 0.0416666666666669*G3_0_0 - 0.00833333333333331*G3_0_1 - 0.00833333333333332*G3_1_0 - 0.041666666666667*G3_1_1;
+    A[19] = 0.0333333333333336*G2_0_0 + 0.0166666666666667*G2_0_1 + 0.0166666666666667*G2_1_0 + 0.083333333333334*G2_1_1 + 0.0333333333333336*G3_0_0 + 0.0166666666666667*G3_0_1 + 0.0166666666666667*G3_1_0 + 0.083333333333334*G3_1_1;
+    A[20] = -0.0166666666666669*G2_0_0 + 0.00833333333333343*G2_0_1 - 0.0500000000000003*G2_1_0 + 0.041666666666667*G2_1_1 - 0.0166666666666669*G3_0_0 + 0.00833333333333343*G3_0_1 - 0.0500000000000003*G3_1_0 + 0.041666666666667*G3_1_1;
+    A[21] = 0.0333333333333336*G2_0_0 - 0.0166666666666667*G2_0_1 + 0.1*G2_1_0 - 0.083333333333334*G2_1_1 + 0.0333333333333336*G3_0_0 - 0.0166666666666667*G3_0_1 + 0.1*G3_1_0 - 0.083333333333334*G3_1_1;
+    A[22] = 0.00833333333333331*G2_0_0 - 0.00833333333333337*G2_1_0 + 0.0166666666666666*G2_1_1 + 0.00833333333333331*G3_0_0 - 0.00833333333333337*G3_1_0 + 0.0166666666666666*G3_1_1;
+    A[23] = -0.0416666666666669*G2_0_0 + 0.0500000000000003*G2_0_1 - 0.00833333333333335*G2_1_0 + 0.0166666666666668*G2_1_1 - 0.0416666666666669*G3_0_0 + 0.0500000000000003*G3_0_1 - 0.00833333333333335*G3_1_0 + 0.0166666666666668*G3_1_1;
+    A[24] = -0.0500000000000004*G2_0_0 + 0.0250000000000002*G2_1_0 - 0.0500000000000004*G3_0_0 + 0.0250000000000002*G3_1_0;
+    A[25] = -0.0250000000000003*G2_0_0 - 0.0250000000000001*G2_1_0 + 0.0750000000000003*G2_1_1 - 0.0250000000000003*G3_0_0 - 0.0250000000000001*G3_1_0 + 0.0750000000000003*G3_1_1;
+    A[26] = 0.00416666666666659*G4_0_0 + 0.00416666666666657*G4_0_1 - 0.00833333333333367*G4_1_0 - 0.00833333333333369*G4_1_1 + 0.00416666666666659*G5_0_0 + 0.00416666666666657*G5_0_1 - 0.00833333333333367*G5_1_0 - 0.00833333333333369*G5_1_1;
+    A[27] = -0.0791666666666671*G4_0_0 + 0.00833333333333371*G4_1_0 - 0.0791666666666671*G5_0_0 + 0.00833333333333371*G5_1_0;
+    A[28] = -0.00416666666666703*G4_0_1 + 0.158333333333335*G4_1_1 - 0.00416666666666703*G5_0_1 + 0.158333333333335*G5_1_1;
+    A[29] = -0.0374999999999994*G4_0_0 - 0.187500000000001*G4_0_1 - 0.0750000000000009*G4_1_0 - 0.0374999999999999*G4_1_1 - 0.0374999999999994*G5_0_0 - 0.187500000000001*G5_0_1 - 0.0750000000000009*G5_1_0 - 0.0374999999999999*G5_1_1;
+    A[30] = 0.0750000000000003*G4_0_0 + 0.150000000000002*G4_0_1 + 0.375000000000003*G4_1_0 + 0.187500000000001*G4_1_1 + 0.0750000000000003*G5_0_0 + 0.150000000000002*G5_0_1 + 0.375000000000003*G5_1_0 + 0.187500000000001*G5_1_1;
+    A[31] = 0.0375000000000004*G4_0_0 + 0.0750000000000005*G4_1_0 + 0.0375000000000007*G4_1_1 + 0.0375000000000004*G5_0_0 + 0.0750000000000005*G5_1_0 + 0.0375000000000007*G5_1_1;
+    A[32] = -0.0750000000000003*G4_0_0 - 0.375000000000003*G4_1_0 - 0.187500000000002*G4_1_1 - 0.0750000000000003*G5_0_0 - 0.375000000000003*G5_1_0 - 0.187500000000002*G5_1_1;
+    A[33] = 0.037500000000001*G4_0_0 + 0.0750000000000015*G4_0_1 + 0.0375000000000004*G4_1_1 + 0.037500000000001*G5_0_0 + 0.0750000000000015*G5_0_1 + 0.0375000000000004*G5_1_1;
+    A[34] = 0.0374999999999994*G4_0_0 + 0.187500000000001*G4_0_1 + 0.0375*G4_1_1 + 0.0374999999999994*G5_0_0 + 0.187500000000001*G5_0_1 + 0.0375*G5_1_1;
+    A[35] = -0.225000000000003*G4_0_1 - 0.225000000000001*G4_1_1 - 0.225000000000003*G5_0_1 - 0.225000000000001*G5_1_1;
+    A[36] = -0.0166666666666667*G2_0_0 + 0.00833333333333339*G2_1_0 - 0.00833333333333333*G2_1_1 - 0.0166666666666667*G3_0_0 + 0.00833333333333339*G3_1_0 - 0.00833333333333333*G3_1_1;
+    A[37] = -0.0166666666666669*G2_0_0 - 0.0500000000000003*G2_0_1 + 0.00833333333333343*G2_1_0 + 0.041666666666667*G2_1_1 - 0.0166666666666669*G3_0_0 - 0.0500000000000003*G3_0_1 + 0.00833333333333343*G3_1_0 + 0.041666666666667*G3_1_1;
+    A[38] = 0.150000000000001*G2_0_0 - 0.0500000000000004*G2_0_1 - 0.0500000000000004*G2_1_0 + 0.0333333333333337*G2_1_1 + 0.150000000000001*G3_0_0 - 0.0500000000000004*G3_0_1 - 0.0500000000000004*G3_1_0 + 0.0333333333333337*G3_1_1;
+    A[39] = -0.1*G2_0_0 + 0.0500000000000003*G2_0_1 + 0.0500000000000003*G2_1_0 - 0.041666666666667*G2_1_1 - 0.1*G3_0_0 + 0.0500000000000003*G3_0_1 + 0.0500000000000003*G3_1_0 - 0.041666666666667*G3_1_1;
+    A[40] = 0.0333333333333335*G2_0_0 - 0.133333333333334*G2_0_1 - 0.0166666666666668*G2_1_0 + 0.0333333333333335*G2_1_1 + 0.0333333333333335*G3_0_0 - 0.133333333333334*G3_0_1 - 0.0166666666666668*G3_1_0 + 0.0333333333333335*G3_1_1;
+    A[41] = -0.0166666666666667*G2_0_0 + 0.066666666666667*G2_0_1 + 0.00833333333333338*G2_1_0 - 0.0166666666666668*G2_1_1 - 0.0166666666666667*G3_0_0 + 0.066666666666667*G3_0_1 + 0.00833333333333338*G3_1_0 - 0.0166666666666668*G3_1_1;
+    A[42] = 0.0250000000000002*G2_0_0 + 0.0500000000000005*G2_0_1 + 0.0250000000000002*G2_1_0 - 0.0250000000000003*G2_1_1 + 0.0250000000000002*G3_0_0 + 0.0500000000000005*G3_0_1 + 0.0250000000000002*G3_1_0 - 0.0250000000000003*G3_1_1;
+    A[43] = 0.0500000000000004*G2_0_0 + 0.0250000000000004*G2_0_1 - 0.0250000000000002*G2_1_0 + 0.0249999999999999*G2_1_1 + 0.0500000000000004*G3_0_0 + 0.0250000000000004*G3_0_1 - 0.0250000000000002*G3_1_0 + 0.0249999999999999*G3_1_1;
+    A[44] = -0.154166666666667*G4_0_0 - 0.154166666666667*G4_0_1 - 0.00416666666666707*G4_1_0 - 0.00416666666666708*G4_1_1 - 0.154166666666667*G5_0_0 - 0.154166666666667*G5_0_1 - 0.00416666666666707*G5_1_0 - 0.00416666666666708*G5_1_1;
+    A[45] = 0.00416666666666703*G4_0_0 + 0.00416666666666662*G4_1_0 + 0.00416666666666703*G5_0_0 + 0.00416666666666662*G5_1_0;
+    A[46] = -0.0708333333333337*G4_0_1 + 0.0791666666666674*G4_1_1 - 0.0708333333333337*G5_0_1 + 0.0791666666666674*G5_1_1;
+    A[47] = -0.112500000000001*G4_0_0 - 0.0749999999999999*G4_0_1 + 0.0750000000000008*G4_1_0 + 0.0375000000000002*G4_1_1 - 0.112500000000001*G5_0_0 - 0.0749999999999999*G5_0_1 + 0.0750000000000008*G5_1_0 + 0.0375000000000002*G5_1_1;
+    A[48] = -0.225000000000001*G4_0_0 - 0.187500000000002*G4_0_1 + 0.187500000000001*G4_1_0 + 0.150000000000001*G4_1_1 - 0.225000000000001*G5_0_0 - 0.187500000000002*G5_0_1 + 0.187500000000001*G5_1_0 + 0.150000000000001*G5_1_1;
+    A[49] = -0.337500000000003*G4_0_0 + 0.1125*G4_0_1 + 0.150000000000002*G4_1_0 + 0.0750000000000017*G4_1_1 - 0.337500000000003*G5_0_0 + 0.1125*G5_0_1 + 0.150000000000002*G5_1_0 + 0.0750000000000017*G5_1_1;
+    A[50] = 0.225000000000001*G4_0_0 + 0.112500000000001*G4_0_1 - 0.187500000000002*G4_1_0 - 0.150000000000002*G4_1_1 + 0.225000000000001*G5_0_0 + 0.112500000000001*G5_0_1 - 0.187500000000002*G5_1_0 - 0.150000000000002*G5_1_1;
+    A[51] = 0.187500000000001*G4_0_0 - 0.262500000000002*G4_0_1 + 0.0750000000000008*G4_1_1 + 0.187500000000001*G5_0_0 - 0.262500000000002*G5_0_1 + 0.0750000000000008*G5_1_1;
+    A[52] = -0.0375000000000004*G4_0_0 + 0.0749999999999998*G4_0_1 - 0.0375000000000002*G4_1_1 - 0.0375000000000004*G5_0_0 + 0.0749999999999998*G5_0_1 - 0.0375000000000002*G5_1_1;
+    A[53] = 0.450000000000004*G4_0_0 + 0.450000000000004*G4_0_1 - 0.225000000000003*G4_1_0 - 0.225000000000002*G4_1_1 + 0.450000000000004*G5_0_0 + 0.450000000000004*G5_0_1 - 0.225000000000003*G5_1_0 - 0.225000000000002*G5_1_1;
+    A[54] = -0.0166666666666667*G2_0_0 - 0.0500000000000004*G2_0_1 + 0.00833333333333333*G2_1_0 + 0.041666666666667*G2_1_1 - 0.0166666666666667*G3_0_0 - 0.0500000000000004*G3_0_1 + 0.00833333333333333*G3_1_0 + 0.041666666666667*G3_1_1;
+    A[55] = 0.0333333333333336*G2_0_0 + 0.1*G2_0_1 - 0.0166666666666667*G2_1_0 - 0.083333333333334*G2_1_1 + 0.0333333333333336*G3_0_0 + 0.1*G3_0_1 - 0.0166666666666667*G3_1_0 - 0.083333333333334*G3_1_1;
+    A[56] = -0.1*G2_0_0 + 0.0500000000000003*G2_0_1 + 0.0500000000000003*G2_1_0 - 0.041666666666667*G2_1_1 - 0.1*G3_0_0 + 0.0500000000000003*G3_0_1 + 0.0500000000000003*G3_1_0 - 0.041666666666667*G3_1_1;
+    A[57] = 0.150000000000001*G2_0_0 - 0.1*G2_0_1 - 0.1*G2_1_0 + 0.083333333333334*G2_1_1 + 0.150000000000001*G3_0_0 - 0.1*G3_0_1 - 0.1*G3_1_0 + 0.083333333333334*G3_1_1;
+    A[58] = -0.0166666666666668*G2_0_0 + 0.066666666666667*G2_0_1 + 0.00833333333333337*G2_1_0 - 0.0166666666666667*G2_1_1 - 0.0166666666666668*G3_0_0 + 0.066666666666667*G3_0_1 + 0.00833333333333337*G3_1_0 - 0.0166666666666667*G3_1_1;
+    A[59] = -0.0166666666666668*G2_0_0 + 0.0166666666666669*G2_0_1 + 0.00833333333333335*G2_1_0 - 0.0166666666666668*G2_1_1 - 0.0166666666666668*G3_0_0 + 0.0166666666666669*G3_0_1 + 0.00833333333333335*G3_1_0 - 0.0166666666666668*G3_1_1;
+    A[60] = -0.0250000000000004*G2_0_0 - 0.0250000000000001*G2_1_0 - 0.0250000000000004*G3_0_0 - 0.0250000000000001*G3_1_0;
+    A[61] = -0.0500000000000004*G2_0_0 + 0.0750000000000004*G2_0_1 + 0.0250000000000001*G2_1_0 - 0.0750000000000003*G2_1_1 - 0.0500000000000004*G3_0_0 + 0.0750000000000004*G3_0_1 + 0.0250000000000001*G3_1_0 - 0.0750000000000003*G3_1_1;
+    A[62] = 0.0708333333333336*G4_0_0 + 0.0708333333333336*G4_0_1 + 0.00833333333333367*G4_1_0 + 0.00833333333333369*G4_1_1 + 0.0708333333333336*G5_0_0 + 0.0708333333333336*G5_0_1 + 0.00833333333333367*G5_1_0 + 0.00833333333333369*G5_1_1;
+    A[63] = 0.00416666666666713*G4_0_0 - 0.00833333333333371*G4_1_0 + 0.00416666666666713*G5_0_0 - 0.00833333333333371*G5_1_0;
+    A[64] = 0.154166666666668*G4_0_1 - 0.158333333333335*G4_1_1 + 0.154166666666668*G5_0_1 - 0.158333333333335*G5_1_1;
+    A[65] = -0.112500000000001*G4_0_0 - 0.0750000000000003*G4_0_1 + 0.075000000000001*G4_1_0 + 0.0374999999999999*G4_1_1 - 0.112500000000001*G5_0_0 - 0.0750000000000003*G5_0_1 + 0.075000000000001*G5_1_0 + 0.0374999999999999*G5_1_1;
+    A[66] = 0.450000000000003*G4_0_0 + 0.262500000000001*G4_0_1 - 0.375000000000003*G4_1_0 - 0.187500000000001*G4_1_1 + 0.450000000000003*G5_0_0 + 0.262500000000001*G5_0_1 - 0.375000000000003*G5_1_0 - 0.187500000000001*G5_1_1;
+    A[67] = 0.1125*G4_0_0 - 0.112500000000001*G4_0_1 - 0.0750000000000006*G4_1_0 - 0.0375000000000008*G4_1_1 + 0.1125*G5_0_0 - 0.112500000000001*G5_0_1 - 0.0750000000000006*G5_1_0 - 0.0375000000000008*G5_1_1;
+    A[68] = -0.450000000000003*G4_0_0 - 0.1125*G4_0_1 + 0.375000000000003*G4_1_0 + 0.187500000000002*G4_1_1 - 0.450000000000003*G5_0_0 - 0.1125*G5_0_1 + 0.375000000000003*G5_1_0 + 0.187500000000002*G5_1_1;
+    A[69] = -0.0374999999999991*G4_0_0 + 0.187500000000002*G4_0_1 - 0.0375000000000004*G4_1_1 - 0.0374999999999991*G5_0_0 + 0.187500000000002*G5_0_1 - 0.0375000000000004*G5_1_1;
+    A[70] = -0.0375000000000017*G4_0_0 + 0.0750000000000004*G4_0_1 - 0.0375*G4_1_1 - 0.0375000000000017*G5_0_0 + 0.0750000000000004*G5_0_1 - 0.0375*G5_1_1;
+    A[71] = -0.450000000000004*G4_0_1 + 0.225000000000001*G4_1_1 - 0.450000000000004*G5_0_1 + 0.225000000000001*G5_1_1;
+    A[72] = -0.041666666666667*G2_0_0 - 0.00833333333333342*G2_0_1 + 0.0500000000000002*G2_1_0 + 0.0166666666666668*G2_1_1 - 0.041666666666667*G3_0_0 - 0.00833333333333342*G3_0_1 + 0.0500000000000002*G3_1_0 + 0.0166666666666668*G3_1_1;
+    A[73] = 0.00833333333333331*G2_0_0 - 0.00833333333333337*G2_0_1 + 0.0166666666666666*G2_1_1 + 0.00833333333333331*G3_0_0 - 0.00833333333333337*G3_0_1 + 0.0166666666666666*G3_1_1;
+    A[74] = 0.0333333333333335*G2_0_0 - 0.0166666666666668*G2_0_1 - 0.133333333333334*G2_1_0 + 0.0333333333333335*G2_1_1 + 0.0333333333333335*G3_0_0 - 0.0166666666666668*G3_0_1 - 0.133333333333334*G3_1_0 + 0.0333333333333335*G3_1_1;
+    A[75] = -0.0166666666666668*G2_0_0 + 0.00833333333333337*G2_0_1 + 0.066666666666667*G2_1_0 - 0.0166666666666667*G2_1_1 - 0.0166666666666668*G3_0_0 + 0.00833333333333337*G3_0_1 + 0.066666666666667*G3_1_0 - 0.0166666666666667*G3_1_1;
+    A[76] = 0.0333333333333336*G2_0_0 - 0.0500000000000003*G2_0_1 - 0.0500000000000003*G2_1_0 + 0.150000000000001*G2_1_1 + 0.0333333333333336*G3_0_0 - 0.0500000000000003*G3_0_1 - 0.0500000000000003*G3_1_0 + 0.150000000000001*G3_1_1;
+    A[77] = -0.041666666666667*G2_0_0 + 0.0500000000000003*G2_0_1 + 0.0500000000000002*G2_1_0 - 0.1*G2_1_1 - 0.041666666666667*G3_0_0 + 0.0500000000000003*G3_0_1 + 0.0500000000000002*G3_1_0 - 0.1*G3_1_1;
+    A[78] = -0.0249999999999999*G2_0_0 + 0.0250000000000002*G2_0_1 - 0.0250000000000005*G2_1_0 - 0.0500000000000004*G2_1_1 - 0.0249999999999999*G3_0_0 + 0.0250000000000002*G3_0_1 - 0.0250000000000005*G3_1_0 - 0.0500000000000004*G3_1_1;
+    A[79] = 0.0250000000000004*G2_0_0 - 0.0250000000000001*G2_0_1 - 0.0500000000000005*G2_1_0 - 0.0250000000000003*G2_1_1 + 0.0250000000000004*G3_0_0 - 0.0250000000000001*G3_0_1 - 0.0500000000000005*G3_1_0 - 0.0250000000000003*G3_1_1;
+    A[80] = 0.00416666666666706*G4_0_0 + 0.00416666666666704*G4_0_1 + 0.154166666666667*G4_1_0 + 0.154166666666667*G4_1_1 + 0.00416666666666706*G5_0_0 + 0.00416666666666704*G5_0_1 + 0.154166666666667*G5_1_0 + 0.154166666666667*G5_1_1;
+    A[81] = -0.0791666666666673*G4_0_0 + 0.0708333333333336*G4_1_0 - 0.0791666666666673*G5_0_0 + 0.0708333333333336*G5_1_0;
+    A[82] = -0.00416666666666659*G4_0_1 - 0.00416666666666709*G4_1_1 - 0.00416666666666659*G5_0_1 - 0.00416666666666709*G5_1_1;
+    A[83] = -0.150000000000001*G4_0_0 - 0.187500000000001*G4_0_1 + 0.187500000000001*G4_1_0 + 0.225000000000001*G4_1_1 - 0.150000000000001*G5_0_0 - 0.187500000000001*G5_0_1 + 0.187500000000001*G5_1_0 + 0.225000000000001*G5_1_1;
+    A[84] = -0.0375000000000002*G4_0_0 - 0.0750000000000009*G4_0_1 + 0.0750000000000001*G4_1_0 + 0.112500000000001*G4_1_1 - 0.0375000000000002*G5_0_0 - 0.0750000000000009*G5_0_1 + 0.0750000000000001*G5_1_0 + 0.112500000000001*G5_1_1;
+    A[85] = -0.0750000000000008*G4_0_0 + 0.262500000000002*G4_1_0 - 0.187500000000001*G4_1_1 - 0.0750000000000008*G5_0_0 + 0.262500000000002*G5_1_0 - 0.187500000000001*G5_1_1;
+    A[86] = 0.0375000000000002*G4_0_0 - 0.0750000000000001*G4_1_0 + 0.0375000000000007*G4_1_1 + 0.0375000000000002*G5_0_0 - 0.0750000000000001*G5_1_0 + 0.0375000000000007*G5_1_1;
+    A[87] = -0.0750000000000016*G4_0_0 - 0.150000000000002*G4_0_1 - 0.1125*G4_1_0 + 0.337500000000003*G4_1_1 - 0.0750000000000016*G5_0_0 - 0.150000000000002*G5_0_1 - 0.1125*G5_1_0 + 0.337500000000003*G5_1_1;
+    A[88] = 0.150000000000002*G4_0_0 + 0.187500000000001*G4_0_1 - 0.112500000000001*G4_1_0 - 0.225000000000001*G4_1_1 + 0.150000000000002*G5_0_0 + 0.187500000000001*G5_0_1 - 0.112500000000001*G5_1_0 - 0.225000000000001*G5_1_1;
+    A[89] = 0.225000000000002*G4_0_0 + 0.225000000000003*G4_0_1 - 0.450000000000003*G4_1_0 - 0.450000000000004*G4_1_1 + 0.225000000000002*G5_0_0 + 0.225000000000003*G5_0_1 - 0.450000000000003*G5_1_0 - 0.450000000000004*G5_1_1;
+    A[90] = 0.0833333333333339*G2_0_0 + 0.0166666666666667*G2_0_1 - 0.1*G2_1_0 - 0.0333333333333336*G2_1_1 + 0.0833333333333339*G3_0_0 + 0.0166666666666667*G3_0_1 - 0.1*G3_1_0 - 0.0333333333333336*G3_1_1;
+    A[91] = -0.0416666666666669*G2_0_0 - 0.00833333333333335*G2_0_1 + 0.0500000000000003*G2_1_0 + 0.0166666666666668*G2_1_1 - 0.0416666666666669*G3_0_0 - 0.00833333333333335*G3_0_1 + 0.0500000000000003*G3_1_0 + 0.0166666666666668*G3_1_1;
+    A[92] = -0.0166666666666667*G2_0_0 + 0.00833333333333338*G2_0_1 + 0.066666666666667*G2_1_0 - 0.0166666666666668*G2_1_1 - 0.0166666666666667*G3_0_0 + 0.00833333333333338*G3_0_1 + 0.066666666666667*G3_1_0 - 0.0166666666666668*G3_1_1;
+    A[93] = -0.0166666666666668*G2_0_0 + 0.00833333333333335*G2_0_1 + 0.0166666666666669*G2_1_0 - 0.0166666666666668*G2_1_1 - 0.0166666666666668*G3_0_0 + 0.00833333333333335*G3_0_1 + 0.0166666666666669*G3_1_0 - 0.0166666666666668*G3_1_1;
+    A[94] = -0.041666666666667*G2_0_0 + 0.0500000000000002*G2_0_1 + 0.0500000000000003*G2_1_0 - 0.1*G2_1_1 - 0.041666666666667*G3_0_0 + 0.0500000000000002*G3_0_1 + 0.0500000000000003*G3_1_0 - 0.1*G3_1_1;
+    A[95] = 0.0833333333333339*G2_0_0 - 0.1*G2_0_1 - 0.1*G2_1_0 + 0.150000000000001*G2_1_1 + 0.0833333333333339*G3_0_0 - 0.1*G3_0_1 - 0.1*G3_1_0 + 0.150000000000001*G3_1_1;
+    A[96] = 0.0750000000000003*G2_0_0 - 0.0250000000000001*G2_0_1 - 0.0750000000000005*G2_1_0 + 0.0500000000000003*G2_1_1 + 0.0750000000000003*G3_0_0 - 0.0250000000000001*G3_0_1 - 0.0750000000000005*G3_1_0 + 0.0500000000000003*G3_1_1;
+    A[97] = 0.0250000000000001*G2_0_1 + 0.0250000000000004*G2_1_1 + 0.0250000000000001*G3_0_1 + 0.0250000000000004*G3_1_1;
+    A[98] = -0.00833333333333363*G4_0_0 - 0.00833333333333358*G4_0_1 - 0.0708333333333336*G4_1_0 - 0.0708333333333336*G4_1_1 - 0.00833333333333363*G5_0_0 - 0.00833333333333358*G5_0_1 - 0.0708333333333336*G5_1_0 - 0.0708333333333336*G5_1_1;
+    A[99] = 0.158333333333334*G4_0_0 - 0.154166666666667*G4_1_0 + 0.158333333333334*G5_0_0 - 0.154166666666667*G5_1_0;
+    A[100] = 0.0083333333333336*G4_0_1 - 0.00416666666666702*G4_1_1 + 0.0083333333333336*G5_0_1 - 0.00416666666666702*G5_1_1;
+    A[101] = 0.187500000000001*G4_0_0 + 0.375000000000002*G4_0_1 - 0.262500000000001*G4_1_0 - 0.450000000000002*G4_1_1 + 0.187500000000001*G5_0_0 + 0.375000000000002*G5_0_1 - 0.262500000000001*G5_1_0 - 0.450000000000002*G5_1_1;
+    A[102] = -0.0375000000000001*G4_0_0 - 0.0750000000000008*G4_0_1 + 0.0750000000000005*G4_1_0 + 0.112500000000001*G4_1_1 - 0.0375000000000001*G5_0_0 - 0.0750000000000008*G5_0_1 + 0.0750000000000005*G5_1_0 + 0.112500000000001*G5_1_1;
+    A[103] = 0.0375000000000004*G4_0_0 - 0.187500000000002*G4_1_0 + 0.0374999999999992*G4_1_1 + 0.0375000000000004*G5_0_0 - 0.187500000000002*G5_1_0 + 0.0374999999999992*G5_1_1;
+    A[104] = 0.0375*G4_0_0 - 0.0750000000000005*G4_1_0 + 0.0375000000000015*G4_1_1 + 0.0375*G5_0_0 - 0.0750000000000005*G5_1_0 + 0.0375000000000015*G5_1_1;
+    A[105] = 0.0375000000000007*G4_0_0 + 0.0750000000000005*G4_0_1 + 0.112500000000001*G4_1_0 - 0.1125*G4_1_1 + 0.0375000000000007*G5_0_0 + 0.0750000000000005*G5_0_1 + 0.112500000000001*G5_1_0 - 0.1125*G5_1_1;
+    A[106] = -0.187500000000001*G4_0_0 - 0.375000000000002*G4_0_1 + 0.1125*G4_1_0 + 0.450000000000003*G4_1_1 - 0.187500000000001*G5_0_0 - 0.375000000000002*G5_0_1 + 0.1125*G5_1_0 + 0.450000000000003*G5_1_1;
+    A[107] = -0.225000000000001*G4_0_0 + 0.450000000000003*G4_1_0 - 0.225000000000001*G5_0_0 + 0.450000000000003*G5_1_0;
+    A[108] = 0.0750000000000003*G2_0_0 - 0.0250000000000001*G2_1_0 - 0.0250000000000003*G2_1_1 + 0.0750000000000003*G3_0_0 - 0.0250000000000001*G3_1_0 - 0.0250000000000003*G3_1_1;
+    A[109] = -0.0500000000000004*G2_0_0 + 0.0250000000000002*G2_0_1 - 0.0500000000000004*G3_0_0 + 0.0250000000000002*G3_0_1;
+    A[110] = 0.0250000000000002*G2_0_0 + 0.0250000000000002*G2_0_1 + 0.0500000000000005*G2_1_0 - 0.0250000000000003*G2_1_1 + 0.0250000000000002*G3_0_0 + 0.0250000000000002*G3_0_1 + 0.0500000000000005*G3_1_0 - 0.0250000000000003*G3_1_1;
+    A[111] = -0.0250000000000004*G2_0_0 - 0.0250000000000001*G2_0_1 - 0.0250000000000004*G3_0_0 - 0.0250000000000001*G3_0_1;
+    A[112] = -0.0249999999999999*G2_0_0 - 0.0250000000000005*G2_0_1 + 0.0250000000000002*G2_1_0 - 0.0500000000000004*G2_1_1 - 0.0249999999999999*G3_0_0 - 0.0250000000000005*G3_0_1 + 0.0250000000000002*G3_1_0 - 0.0500000000000004*G3_1_1;
+    A[113] = 0.0750000000000003*G2_0_0 - 0.0750000000000005*G2_0_1 - 0.0250000000000001*G2_1_0 + 0.0500000000000003*G2_1_1 + 0.0750000000000003*G3_0_0 - 0.0750000000000005*G3_0_1 - 0.0250000000000001*G3_1_0 + 0.0500000000000003*G3_1_1;
+    A[114] = 0.350000000000001*G2_0_0 - 0.0250000000000002*G2_0_1 - 0.0250000000000002*G2_1_0 + 0.0500000000000007*G2_1_1 + 0.350000000000001*G3_0_0 - 0.0250000000000002*G3_0_1 - 0.0250000000000002*G3_1_0 + 0.0500000000000007*G3_1_1;
+    A[115] = 0.0250000000000004*G2_0_0 + 0.249999999999999*G2_0_1 + 0.0250000000000004*G2_1_0 + 0.0250000000000004*G2_1_1 + 0.0250000000000004*G3_0_0 + 0.249999999999999*G3_0_1 + 0.0250000000000004*G3_1_0 + 0.0250000000000004*G3_1_1;
+    A[116] = -0.037500000000001*G4_0_0 - 0.037500000000001*G4_0_1 - 0.037500000000001*G5_0_0 - 0.037500000000001*G5_0_1;
+    A[117] = 0.0375000000000004*G4_0_0 + 0.0375000000000004*G5_0_0;
+    A[118] = 0.0375000000000015*G4_0_1 + 0.0375000000000015*G5_0_1;
+    A[119] = 0.449999999999999*G4_0_0 + 0.337500000000001*G4_0_1 - 0.225000000000003*G4_1_0 - 0.1125*G4_1_1 + 0.449999999999999*G5_0_0 + 0.337500000000001*G5_0_1 - 0.225000000000003*G5_1_0 - 0.1125*G5_1_1;
+    A[120] = 0.1125*G4_0_0 + 0.224999999999997*G4_0_1 - 0.112500000000002*G4_1_1 + 0.1125*G5_0_0 + 0.224999999999997*G5_0_1 - 0.112500000000002*G5_1_1;
+    A[121] = -0.224999999999998*G4_0_0 - 0.225000000000003*G4_1_0 - 0.112500000000003*G4_1_1 - 0.224999999999998*G5_0_0 - 0.225000000000003*G5_1_0 - 0.112500000000003*G5_1_1;
+    A[122] = -0.112500000000001*G4_0_0 + 0.112500000000002*G4_1_1 - 0.112500000000001*G5_0_0 + 0.112500000000002*G5_1_1;
+    A[123] = -0.225*G4_0_0 - 0.450000000000002*G4_0_1 - 0.112500000000001*G4_1_1 - 0.225*G5_0_0 - 0.450000000000002*G5_0_1 - 0.112500000000001*G5_1_1;
+    A[124] = 0.225000000000001*G4_0_0 - 0.337500000000001*G4_0_1 + 0.1125*G4_1_1 + 0.225000000000001*G5_0_0 - 0.337500000000001*G5_0_1 + 0.1125*G5_1_1;
+    A[125] = -0.225000000000001*G4_0_0 + 0.225000000000005*G4_0_1 + 0.450000000000006*G4_1_0 + 0.225000000000003*G4_1_1 - 0.225000000000001*G5_0_0 + 0.225000000000005*G5_0_1 + 0.450000000000006*G5_1_0 + 0.225000000000003*G5_1_1;
+    A[126] = 0.0250000000000001*G2_1_0 - 0.0500000000000004*G2_1_1 + 0.0250000000000001*G3_1_0 - 0.0500000000000004*G3_1_1;
+    A[127] = -0.0250000000000003*G2_0_0 - 0.0250000000000001*G2_0_1 + 0.0750000000000003*G2_1_1 - 0.0250000000000003*G3_0_0 - 0.0250000000000001*G3_0_1 + 0.0750000000000003*G3_1_1;
+    A[128] = 0.0500000000000004*G2_0_0 - 0.0250000000000002*G2_0_1 + 0.0250000000000004*G2_1_0 + 0.0249999999999999*G2_1_1 + 0.0500000000000004*G3_0_0 - 0.0250000000000002*G3_0_1 + 0.0250000000000004*G3_1_0 + 0.0249999999999999*G3_1_1;
+    A[129] = -0.0500000000000004*G2_0_0 + 0.0250000000000001*G2_0_1 + 0.0750000000000004*G2_1_0 - 0.0750000000000003*G2_1_1 - 0.0500000000000004*G3_0_0 + 0.0250000000000001*G3_0_1 + 0.0750000000000004*G3_1_0 - 0.0750000000000003*G3_1_1;
+    A[130] = 0.0250000000000004*G2_0_0 - 0.0500000000000005*G2_0_1 - 0.0250000000000001*G2_1_0 - 0.0250000000000003*G2_1_1 + 0.0250000000000004*G3_0_0 - 0.0500000000000005*G3_0_1 - 0.0250000000000001*G3_1_0 - 0.0250000000000003*G3_1_1;
+    A[131] = 0.0250000000000001*G2_1_0 + 0.0250000000000004*G2_1_1 + 0.0250000000000001*G3_1_0 + 0.0250000000000004*G3_1_1;
+    A[132] = 0.0250000000000004*G2_0_0 + 0.0250000000000003*G2_0_1 + 0.249999999999999*G2_1_0 + 0.0250000000000004*G2_1_1 + 0.0250000000000004*G3_0_0 + 0.0250000000000003*G3_0_1 + 0.249999999999999*G3_1_0 + 0.0250000000000004*G3_1_1;
+    A[133] = 0.0500000000000007*G2_0_0 - 0.0250000000000002*G2_0_1 - 0.0250000000000002*G2_1_0 + 0.35*G2_1_1 + 0.0500000000000007*G3_0_0 - 0.0250000000000002*G3_0_1 - 0.0250000000000002*G3_1_0 + 0.35*G3_1_1;
+    A[134] = -0.037500000000001*G4_1_0 - 0.037500000000001*G4_1_1 - 0.037500000000001*G5_1_0 - 0.037500000000001*G5_1_1;
+    A[135] = 0.0375000000000015*G4_1_0 + 0.0375000000000015*G5_1_0;
+    A[136] = 0.0375000000000004*G4_1_1 + 0.0375000000000004*G5_1_1;
+    A[137] = -0.112500000000002*G4_0_0 + 0.224999999999997*G4_1_0 + 0.1125*G4_1_1 - 0.112500000000002*G5_0_0 + 0.224999999999997*G5_1_0 + 0.1125*G5_1_1;
+    A[138] = -0.112500000000001*G4_0_0 - 0.225000000000003*G4_0_1 + 0.337500000000001*G4_1_0 + 0.449999999999999*G4_1_1 - 0.112500000000001*G5_0_0 - 0.225000000000003*G5_0_1 + 0.337500000000001*G5_1_0 + 0.449999999999999*G5_1_1;
+    A[139] = -0.112500000000001*G4_0_0 - 0.450000000000002*G4_1_0 - 0.225*G4_1_1 - 0.112500000000001*G5_0_0 - 0.450000000000002*G5_1_0 - 0.225*G5_1_1;
+    A[140] = 0.112500000000001*G4_0_0 - 0.337500000000001*G4_1_0 + 0.225000000000001*G4_1_1 + 0.112500000000001*G5_0_0 - 0.337500000000001*G5_1_0 + 0.225000000000001*G5_1_1;
+    A[141] = -0.112500000000003*G4_0_0 - 0.225000000000003*G4_0_1 - 0.224999999999997*G4_1_1 - 0.112500000000003*G5_0_0 - 0.225000000000003*G5_0_1 - 0.224999999999997*G5_1_1;
+    A[142] = 0.112500000000002*G4_0_0 - 0.1125*G4_1_1 + 0.112500000000002*G5_0_0 - 0.1125*G5_1_1;
+    A[143] = 0.225000000000003*G4_0_0 + 0.450000000000006*G4_0_1 + 0.225000000000004*G4_1_0 - 0.225000000000002*G4_1_1 + 0.225000000000003*G5_0_0 + 0.450000000000006*G5_0_1 + 0.225000000000004*G5_1_0 - 0.225000000000002*G5_1_1;
+    A[144] = -0.00833333333333366*G0_0_0 - 0.00833333333333363*G0_0_1 + 0.00416666666666659*G0_1_0 + 0.0041666666666666*G0_1_1 - 0.00833333333333366*G1_0_0 - 0.00833333333333363*G1_0_1 + 0.00416666666666659*G1_1_0 + 0.0041666666666666*G1_1_1;
+    A[145] = 0.00416666666666659*G0_0_0 + 0.00416666666666657*G0_0_1 - 0.00833333333333367*G0_1_0 - 0.00833333333333369*G0_1_1 + 0.00416666666666659*G1_0_0 + 0.00416666666666657*G1_0_1 - 0.00833333333333367*G1_1_0 - 0.00833333333333369*G1_1_1;
+    A[146] = -0.154166666666667*G0_0_0 - 0.154166666666667*G0_0_1 - 0.00416666666666707*G0_1_0 - 0.00416666666666708*G0_1_1 - 0.154166666666667*G1_0_0 - 0.154166666666667*G1_0_1 - 0.00416666666666707*G1_1_0 - 0.00416666666666708*G1_1_1;
+    A[147] = 0.0708333333333336*G0_0_0 + 0.0708333333333336*G0_0_1 + 0.00833333333333367*G0_1_0 + 0.00833333333333369*G0_1_1 + 0.0708333333333336*G1_0_0 + 0.0708333333333336*G1_0_1 + 0.00833333333333367*G1_1_0 + 0.00833333333333369*G1_1_1;
+    A[148] = 0.00416666666666706*G0_0_0 + 0.00416666666666704*G0_0_1 + 0.154166666666667*G0_1_0 + 0.154166666666667*G0_1_1 + 0.00416666666666706*G1_0_0 + 0.00416666666666704*G1_0_1 + 0.154166666666667*G1_1_0 + 0.154166666666667*G1_1_1;
+    A[149] = -0.00833333333333363*G0_0_0 - 0.00833333333333358*G0_0_1 - 0.0708333333333336*G0_1_0 - 0.0708333333333336*G0_1_1 - 0.00833333333333363*G1_0_0 - 0.00833333333333358*G1_0_1 - 0.0708333333333336*G1_1_0 - 0.0708333333333336*G1_1_1;
+    A[150] = -0.037500000000001*G0_0_0 - 0.037500000000001*G0_0_1 - 0.037500000000001*G1_0_0 - 0.037500000000001*G1_0_1;
+    A[151] = -0.037500000000001*G0_1_0 - 0.037500000000001*G0_1_1 - 0.037500000000001*G1_1_0 - 0.037500000000001*G1_1_1;
+    A[152] = 0.0;
+    A[153] = 0.0;
+    A[154] = 0.0;
+    A[155] = 0.0;
+    A[156] = 0.0;
+    A[157] = 0.0;
+    A[158] = 0.0;
+    A[159] = 0.0;
+    A[160] = 0.0;
+    A[161] = 0.0;
+    A[162] = 0.158333333333334*G0_0_0 - 0.00416666666666708*G0_1_0 + 0.158333333333334*G1_0_0 - 0.00416666666666708*G1_1_0;
+    A[163] = -0.0791666666666671*G0_0_0 + 0.00833333333333371*G0_1_0 - 0.0791666666666671*G1_0_0 + 0.00833333333333371*G1_1_0;
+    A[164] = 0.00416666666666703*G0_0_0 + 0.00416666666666662*G0_1_0 + 0.00416666666666703*G1_0_0 + 0.00416666666666662*G1_1_0;
+    A[165] = 0.00416666666666713*G0_0_0 - 0.00833333333333371*G0_1_0 + 0.00416666666666713*G1_0_0 - 0.00833333333333371*G1_1_0;
+    A[166] = -0.0791666666666673*G0_0_0 + 0.0708333333333336*G0_1_0 - 0.0791666666666673*G1_0_0 + 0.0708333333333336*G1_1_0;
+    A[167] = 0.158333333333334*G0_0_0 - 0.154166666666667*G0_1_0 + 0.158333333333334*G1_0_0 - 0.154166666666667*G1_1_0;
+    A[168] = 0.0375000000000004*G0_0_0 + 0.0375000000000004*G1_0_0;
+    A[169] = 0.0375000000000015*G0_1_0 + 0.0375000000000015*G1_1_0;
+    A[170] = 0.0;
+    A[171] = 0.0;
+    A[172] = 0.0;
+    A[173] = 0.0;
+    A[174] = 0.0;
+    A[175] = 0.0;
+    A[176] = 0.0;
+    A[177] = 0.0;
+    A[178] = 0.0;
+    A[179] = 0.0;
+    A[180] = 0.00833333333333368*G0_0_1 - 0.0791666666666673*G0_1_1 + 0.00833333333333368*G1_0_1 - 0.0791666666666673*G1_1_1;
+    A[181] = -0.00416666666666703*G0_0_1 + 0.158333333333335*G0_1_1 - 0.00416666666666703*G1_0_1 + 0.158333333333335*G1_1_1;
+    A[182] = -0.0708333333333337*G0_0_1 + 0.0791666666666674*G0_1_1 - 0.0708333333333337*G1_0_1 + 0.0791666666666674*G1_1_1;
+    A[183] = 0.154166666666668*G0_0_1 - 0.158333333333335*G0_1_1 + 0.154166666666668*G1_0_1 - 0.158333333333335*G1_1_1;
+    A[184] = -0.00416666666666659*G0_0_1 - 0.00416666666666709*G0_1_1 - 0.00416666666666659*G1_0_1 - 0.00416666666666709*G1_1_1;
+    A[185] = 0.0083333333333336*G0_0_1 - 0.00416666666666702*G0_1_1 + 0.0083333333333336*G1_0_1 - 0.00416666666666702*G1_1_1;
+    A[186] = 0.0375000000000015*G0_0_1 + 0.0375000000000015*G1_0_1;
+    A[187] = 0.0375000000000004*G0_1_1 + 0.0375000000000004*G1_1_1;
+    A[188] = 0.0;
+    A[189] = 0.0;
+    A[190] = 0.0;
+    A[191] = 0.0;
+    A[192] = 0.0;
+    A[193] = 0.0;
+    A[194] = 0.0;
+    A[195] = 0.0;
+    A[196] = 0.0;
+    A[197] = 0.0;
+    A[198] = 0.187500000000001*G0_0_0 + 0.375000000000002*G0_0_1 + 0.150000000000002*G0_1_0 + 0.0750000000000001*G0_1_1 + 0.187500000000001*G1_0_0 + 0.375000000000002*G1_0_1 + 0.150000000000002*G1_1_0 + 0.0750000000000001*G1_1_1;
+    A[199] = -0.0374999999999994*G0_0_0 - 0.187500000000001*G0_0_1 - 0.0750000000000009*G0_1_0 - 0.0374999999999999*G0_1_1 - 0.0374999999999994*G1_0_0 - 0.187500000000001*G1_0_1 - 0.0750000000000009*G1_1_0 - 0.0374999999999999*G1_1_1;
+    A[200] = -0.112500000000001*G0_0_0 - 0.0749999999999999*G0_0_1 + 0.0750000000000008*G0_1_0 + 0.0375000000000002*G0_1_1 - 0.112500000000001*G1_0_0 - 0.0749999999999999*G1_0_1 + 0.0750000000000008*G1_1_0 + 0.0375000000000002*G1_1_1;
+    A[201] = -0.112500000000001*G0_0_0 - 0.0750000000000003*G0_0_1 + 0.075000000000001*G0_1_0 + 0.0374999999999999*G0_1_1 - 0.112500000000001*G1_0_0 - 0.0750000000000003*G1_0_1 + 0.075000000000001*G1_1_0 + 0.0374999999999999*G1_1_1;
+    A[202] = -0.150000000000001*G0_0_0 - 0.187500000000001*G0_0_1 + 0.187500000000001*G0_1_0 + 0.225000000000001*G0_1_1 - 0.150000000000001*G1_0_0 - 0.187500000000001*G1_0_1 + 0.187500000000001*G1_1_0 + 0.225000000000001*G1_1_1;
+    A[203] = 0.187500000000001*G0_0_0 + 0.375000000000002*G0_0_1 - 0.262500000000001*G0_1_0 - 0.450000000000002*G0_1_1 + 0.187500000000001*G1_0_0 + 0.375000000000002*G1_0_1 - 0.262500000000001*G1_1_0 - 0.450000000000002*G1_1_1;
+    A[204] = 0.449999999999999*G0_0_0 + 0.337500000000001*G0_0_1 - 0.225000000000003*G0_1_0 - 0.1125*G0_1_1 + 0.449999999999999*G1_0_0 + 0.337500000000001*G1_0_1 - 0.225000000000003*G1_1_0 - 0.1125*G1_1_1;
+    A[205] = -0.112500000000002*G0_0_0 + 0.224999999999997*G0_1_0 + 0.1125*G0_1_1 - 0.112500000000002*G1_0_0 + 0.224999999999997*G1_1_0 + 0.1125*G1_1_1;
+    A[206] = 0.0;
+    A[207] = 0.0;
+    A[208] = 0.0;
+    A[209] = 0.0;
+    A[210] = 0.0;
+    A[211] = 0.0;
+    A[212] = 0.0;
+    A[213] = 0.0;
+    A[214] = 0.0;
+    A[215] = 0.0;
+    A[216] = -0.0375*G0_0_0 - 0.0750000000000008*G0_0_1 - 0.187500000000001*G0_1_0 - 0.0374999999999995*G0_1_1 - 0.0375*G1_0_0 - 0.0750000000000008*G1_0_1 - 0.187500000000001*G1_1_0 - 0.0374999999999995*G1_1_1;
+    A[217] = 0.0750000000000003*G0_0_0 + 0.150000000000002*G0_0_1 + 0.375000000000003*G0_1_0 + 0.187500000000001*G0_1_1 + 0.0750000000000003*G1_0_0 + 0.150000000000002*G1_0_1 + 0.375000000000003*G1_1_0 + 0.187500000000001*G1_1_1;
+    A[218] = -0.225000000000001*G0_0_0 - 0.187500000000002*G0_0_1 + 0.187500000000001*G0_1_0 + 0.150000000000001*G0_1_1 - 0.225000000000001*G1_0_0 - 0.187500000000002*G1_0_1 + 0.187500000000001*G1_1_0 + 0.150000000000001*G1_1_1;
+    A[219] = 0.450000000000003*G0_0_0 + 0.262500000000001*G0_0_1 - 0.375000000000003*G0_1_0 - 0.187500000000001*G0_1_1 + 0.450000000000003*G1_0_0 + 0.262500000000001*G1_0_1 - 0.375000000000003*G1_1_0 - 0.187500000000001*G1_1_1;
+    A[220] = -0.0375000000000002*G0_0_0 - 0.0750000000000009*G0_0_1 + 0.0750000000000001*G0_1_0 + 0.112500000000001*G0_1_1 - 0.0375000000000002*G1_0_0 - 0.0750000000000009*G1_0_1 + 0.0750000000000001*G1_1_0 + 0.112500000000001*G1_1_1;
+    A[221] = -0.0375000000000001*G0_0_0 - 0.0750000000000008*G0_0_1 + 0.0750000000000005*G0_1_0 + 0.112500000000001*G0_1_1 - 0.0375000000000001*G1_0_0 - 0.0750000000000008*G1_0_1 + 0.0750000000000005*G1_1_0 + 0.112500000000001*G1_1_1;
+    A[222] = 0.1125*G0_0_0 + 0.224999999999997*G0_0_1 - 0.112500000000002*G0_1_1 + 0.1125*G1_0_0 + 0.224999999999997*G1_0_1 - 0.112500000000002*G1_1_1;
+    A[223] = -0.112500000000001*G0_0_0 - 0.225000000000003*G0_0_1 + 0.337500000000001*G0_1_0 + 0.449999999999999*G0_1_1 - 0.112500000000001*G1_0_0 - 0.225000000000003*G1_0_1 + 0.337500000000001*G1_1_0 + 0.449999999999999*G1_1_1;
+    A[224] = 0.0;
+    A[225] = 0.0;
+    A[226] = 0.0;
+    A[227] = 0.0;
+    A[228] = 0.0;
+    A[229] = 0.0;
+    A[230] = 0.0;
+    A[231] = 0.0;
+    A[232] = 0.0;
+    A[233] = 0.0;
+    A[234] = 0.0375000000000004*G0_0_0 + 0.0750000000000013*G0_1_0 + 0.0375000000000009*G0_1_1 + 0.0375000000000004*G1_0_0 + 0.0750000000000013*G1_1_0 + 0.0375000000000009*G1_1_1;
+    A[235] = 0.0375000000000004*G0_0_0 + 0.0750000000000005*G0_1_0 + 0.0375000000000007*G0_1_1 + 0.0375000000000004*G1_0_0 + 0.0750000000000005*G1_1_0 + 0.0375000000000007*G1_1_1;
+    A[236] = -0.337500000000003*G0_0_0 + 0.1125*G0_0_1 + 0.150000000000002*G0_1_0 + 0.0750000000000017*G0_1_1 - 0.337500000000003*G1_0_0 + 0.1125*G1_0_1 + 0.150000000000002*G1_1_0 + 0.0750000000000017*G1_1_1;
+    A[237] = 0.1125*G0_0_0 - 0.112500000000001*G0_0_1 - 0.0750000000000006*G0_1_0 - 0.0375000000000008*G0_1_1 + 0.1125*G1_0_0 - 0.112500000000001*G1_0_1 - 0.0750000000000006*G1_1_0 - 0.0375000000000008*G1_1_1;
+    A[238] = -0.0750000000000008*G0_0_0 + 0.262500000000002*G0_1_0 - 0.187500000000001*G0_1_1 - 0.0750000000000008*G1_0_0 + 0.262500000000002*G1_1_0 - 0.187500000000001*G1_1_1;
+    A[239] = 0.0375000000000004*G0_0_0 - 0.187500000000002*G0_1_0 + 0.0374999999999992*G0_1_1 + 0.0375000000000004*G1_0_0 - 0.187500000000002*G1_1_0 + 0.0374999999999992*G1_1_1;
+    A[240] = -0.224999999999998*G0_0_0 - 0.225000000000003*G0_1_0 - 0.112500000000003*G0_1_1 - 0.224999999999998*G1_0_0 - 0.225000000000003*G1_1_0 - 0.112500000000003*G1_1_1;
+    A[241] = -0.112500000000001*G0_0_0 - 0.450000000000002*G0_1_0 - 0.225*G0_1_1 - 0.112500000000001*G1_0_0 - 0.450000000000002*G1_1_0 - 0.225*G1_1_1;
+    A[242] = 0.0;
+    A[243] = 0.0;
+    A[244] = 0.0;
+    A[245] = 0.0;
+    A[246] = 0.0;
+    A[247] = 0.0;
+    A[248] = 0.0;
+    A[249] = 0.0;
+    A[250] = 0.0;
+    A[251] = 0.0;
+    A[252] = 0.0374999999999999*G0_0_0 + 0.187500000000001*G0_1_0 + 0.0374999999999998*G0_1_1 + 0.0374999999999999*G1_0_0 + 0.187500000000001*G1_1_0 + 0.0374999999999998*G1_1_1;
+    A[253] = -0.0750000000000003*G0_0_0 - 0.375000000000003*G0_1_0 - 0.187500000000002*G0_1_1 - 0.0750000000000003*G1_0_0 - 0.375000000000003*G1_1_0 - 0.187500000000002*G1_1_1;
+    A[254] = 0.225000000000001*G0_0_0 + 0.112500000000001*G0_0_1 - 0.187500000000002*G0_1_0 - 0.150000000000002*G0_1_1 + 0.225000000000001*G1_0_0 + 0.112500000000001*G1_0_1 - 0.187500000000002*G1_1_0 - 0.150000000000002*G1_1_1;
+    A[255] = -0.450000000000003*G0_0_0 - 0.1125*G0_0_1 + 0.375000000000003*G0_1_0 + 0.187500000000002*G0_1_1 - 0.450000000000003*G1_0_0 - 0.1125*G1_0_1 + 0.375000000000003*G1_1_0 + 0.187500000000002*G1_1_1;
+    A[256] = 0.0375000000000002*G0_0_0 - 0.0750000000000001*G0_1_0 + 0.0375000000000007*G0_1_1 + 0.0375000000000002*G1_0_0 - 0.0750000000000001*G1_1_0 + 0.0375000000000007*G1_1_1;
+    A[257] = 0.0375*G0_0_0 - 0.0750000000000005*G0_1_0 + 0.0375000000000015*G0_1_1 + 0.0375*G1_0_0 - 0.0750000000000005*G1_1_0 + 0.0375000000000015*G1_1_1;
+    A[258] = -0.112500000000001*G0_0_0 + 0.112500000000002*G0_1_1 - 0.112500000000001*G1_0_0 + 0.112500000000002*G1_1_1;
+    A[259] = 0.112500000000001*G0_0_0 - 0.337500000000001*G0_1_0 + 0.225000000000001*G0_1_1 + 0.112500000000001*G1_0_0 - 0.337500000000001*G1_1_0 + 0.225000000000001*G1_1_1;
+    A[260] = 0.0;
+    A[261] = 0.0;
+    A[262] = 0.0;
+    A[263] = 0.0;
+    A[264] = 0.0;
+    A[265] = 0.0;
+    A[266] = 0.0;
+    A[267] = 0.0;
+    A[268] = 0.0;
+    A[269] = 0.0;
+    A[270] = 0.0375000000000006*G0_0_0 + 0.0750000000000005*G0_0_1 + 0.0375000000000003*G0_1_1 + 0.0375000000000006*G1_0_0 + 0.0750000000000005*G1_0_1 + 0.0375000000000003*G1_1_1;
+    A[271] = 0.037500000000001*G0_0_0 + 0.0750000000000015*G0_0_1 + 0.0375000000000004*G0_1_1 + 0.037500000000001*G1_0_0 + 0.0750000000000015*G1_0_1 + 0.0375000000000004*G1_1_1;
+    A[272] = 0.187500000000001*G0_0_0 - 0.262500000000002*G0_0_1 + 0.0750000000000008*G0_1_1 + 0.187500000000001*G1_0_0 - 0.262500000000002*G1_0_1 + 0.0750000000000008*G1_1_1;
+    A[273] = -0.0374999999999991*G0_0_0 + 0.187500000000002*G0_0_1 - 0.0375000000000004*G0_1_1 - 0.0374999999999991*G1_0_0 + 0.187500000000002*G1_0_1 - 0.0375000000000004*G1_1_1;
+    A[274] = -0.0750000000000016*G0_0_0 - 0.150000000000002*G0_0_1 - 0.1125*G0_1_0 + 0.337500000000003*G0_1_1 - 0.0750000000000016*G1_0_0 - 0.150000000000002*G1_0_1 - 0.1125*G1_1_0 + 0.337500000000003*G1_1_1;
+    A[275] = 0.0375000000000007*G0_0_0 + 0.0750000000000005*G0_0_1 + 0.112500000000001*G0_1_0 - 0.1125*G0_1_1 + 0.0375000000000007*G1_0_0 + 0.0750000000000005*G1_0_1 + 0.112500000000001*G1_1_0 - 0.1125*G1_1_1;
+    A[276] = -0.225*G0_0_0 - 0.450000000000002*G0_0_1 - 0.112500000000001*G0_1_1 - 0.225*G1_0_0 - 0.450000000000002*G1_0_1 - 0.112500000000001*G1_1_1;
+    A[277] = -0.112500000000003*G0_0_0 - 0.225000000000003*G0_0_1 - 0.224999999999997*G0_1_1 - 0.112500000000003*G1_0_0 - 0.225000000000003*G1_0_1 - 0.224999999999997*G1_1_1;
+    A[278] = 0.0;
+    A[279] = 0.0;
+    A[280] = 0.0;
+    A[281] = 0.0;
+    A[282] = 0.0;
+    A[283] = 0.0;
+    A[284] = 0.0;
+    A[285] = 0.0;
+    A[286] = 0.0;
+    A[287] = 0.0;
+    A[288] = -0.187500000000001*G0_0_0 - 0.375000000000002*G0_0_1 - 0.0750000000000002*G0_1_1 - 0.187500000000001*G1_0_0 - 0.375000000000002*G1_0_1 - 0.0750000000000002*G1_1_1;
+    A[289] = 0.0374999999999994*G0_0_0 + 0.187500000000001*G0_0_1 + 0.0375*G0_1_1 + 0.0374999999999994*G1_0_0 + 0.187500000000001*G1_0_1 + 0.0375*G1_1_1;
+    A[290] = -0.0375000000000004*G0_0_0 + 0.0749999999999998*G0_0_1 - 0.0375000000000002*G0_1_1 - 0.0375000000000004*G1_0_0 + 0.0749999999999998*G1_0_1 - 0.0375000000000002*G1_1_1;
+    A[291] = -0.0375000000000017*G0_0_0 + 0.0750000000000004*G0_0_1 - 0.0375*G0_1_1 - 0.0375000000000017*G1_0_0 + 0.0750000000000004*G1_0_1 - 0.0375*G1_1_1;
+    A[292] = 0.150000000000002*G0_0_0 + 0.187500000000001*G0_0_1 - 0.112500000000001*G0_1_0 - 0.225000000000001*G0_1_1 + 0.150000000000002*G1_0_0 + 0.187500000000001*G1_0_1 - 0.112500000000001*G1_1_0 - 0.225000000000001*G1_1_1;
+    A[293] = -0.187500000000001*G0_0_0 - 0.375000000000002*G0_0_1 + 0.1125*G0_1_0 + 0.450000000000003*G0_1_1 - 0.187500000000001*G1_0_0 - 0.375000000000002*G1_0_1 + 0.1125*G1_1_0 + 0.450000000000003*G1_1_1;
+    A[294] = 0.225000000000001*G0_0_0 - 0.337500000000001*G0_0_1 + 0.1125*G0_1_1 + 0.225000000000001*G1_0_0 - 0.337500000000001*G1_0_1 + 0.1125*G1_1_1;
+    A[295] = 0.112500000000002*G0_0_0 - 0.1125*G0_1_1 + 0.112500000000002*G1_0_0 - 0.1125*G1_1_1;
+    A[296] = 0.0;
+    A[297] = 0.0;
+    A[298] = 0.0;
+    A[299] = 0.0;
+    A[300] = 0.0;
+    A[301] = 0.0;
+    A[302] = 0.0;
+    A[303] = 0.0;
+    A[304] = 0.0;
+    A[305] = 0.0;
+    A[306] = -0.225000000000001*G0_0_0 - 0.225000000000003*G0_1_0 - 0.225000000000001*G1_0_0 - 0.225000000000003*G1_1_0;
+    A[307] = -0.225000000000003*G0_0_1 - 0.225000000000001*G0_1_1 - 0.225000000000003*G1_0_1 - 0.225000000000001*G1_1_1;
+    A[308] = 0.450000000000004*G0_0_0 + 0.450000000000004*G0_0_1 - 0.225000000000003*G0_1_0 - 0.225000000000002*G0_1_1 + 0.450000000000004*G1_0_0 + 0.450000000000004*G1_0_1 - 0.225000000000003*G1_1_0 - 0.225000000000002*G1_1_1;
+    A[309] = -0.450000000000004*G0_0_1 + 0.225000000000001*G0_1_1 - 0.450000000000004*G1_0_1 + 0.225000000000001*G1_1_1;
+    A[310] = 0.225000000000002*G0_0_0 + 0.225000000000003*G0_0_1 - 0.450000000000003*G0_1_0 - 0.450000000000004*G0_1_1 + 0.225000000000002*G1_0_0 + 0.225000000000003*G1_0_1 - 0.450000000000003*G1_1_0 - 0.450000000000004*G1_1_1;
+    A[311] = -0.225000000000001*G0_0_0 + 0.450000000000003*G0_1_0 - 0.225000000000001*G1_0_0 + 0.450000000000003*G1_1_0;
+    A[312] = -0.225000000000001*G0_0_0 + 0.225000000000005*G0_0_1 + 0.450000000000006*G0_1_0 + 0.225000000000003*G0_1_1 - 0.225000000000001*G1_0_0 + 0.225000000000005*G1_0_1 + 0.450000000000006*G1_1_0 + 0.225000000000003*G1_1_1;
+    A[313] = 0.225000000000003*G0_0_0 + 0.450000000000006*G0_0_1 + 0.225000000000004*G0_1_0 - 0.225000000000002*G0_1_1 + 0.225000000000003*G1_0_0 + 0.450000000000006*G1_0_1 + 0.225000000000004*G1_1_0 - 0.225000000000002*G1_1_1;
+    A[314] = 0.0;
+    A[315] = 0.0;
+    A[316] = 0.0;
+    A[317] = 0.0;
+    A[318] = 0.0;
+    A[319] = 0.0;
+    A[320] = 0.0;
+    A[321] = 0.0;
+    A[322] = 0.0;
+    A[323] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class mixedpoissondual_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 13
+    // Total number of operations (multiply-add pairs):                  19
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0;
+    A[1] = 0.0;
+    A[2] = 0.0;
+    A[3] = 0.0;
+    A[4] = 0.0;
+    A[5] = 0.0;
+    A[6] = 0.0;
+    A[7] = 0.0;
+    A[8] = -0.00833333333333326*G0_0 - 0.00416666666666664*G0_1 - 0.00416666666666665*G0_2;
+    A[9] = -0.00416666666666666*G0_0 - 0.00833333333333342*G0_1 - 0.00416666666666669*G0_2;
+    A[10] = -0.00416666666666666*G0_0 - 0.00416666666666668*G0_1 - 0.00833333333333341*G0_2;
+    A[11] = -0.0375000000000002*G0_1;
+    A[12] = -0.0375000000000001*G0_2;
+    A[13] = -0.0375000000000001*G0_0;
+    A[14] = -0.0374999999999999*G0_2;
+    A[15] = -0.0375*G0_0;
+    A[16] = -0.0374999999999999*G0_1;
+    A[17] = -0.0749999999999998*G0_0 - 0.0749999999999998*G0_1 - 0.0749999999999997*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class mixedpoissondual_exterior_facet_integral_1_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_exterior_facet_integral_1_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_exterior_facet_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 18
+    // Total number of operations (multiply-add pairs):                  31
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    const double G0_2 = det*w[1][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.0;
+      A[2] = 0.0;
+      A[3] = 0.0;
+      A[4] = 0.0;
+      A[5] = 0.0;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = 0.0;
+      A[9] = -0.108333333333333*G0_1 - 0.0166666666666667*G0_2;
+      A[10] = -0.0166666666666666*G0_1 - 0.108333333333333*G0_2;
+      A[11] = -0.3*G0_1 - 0.0750000000000001*G0_2;
+      A[12] = -0.075*G0_1 - 0.3*G0_2;
+      A[13] = 0.0;
+      A[14] = 0.0;
+      A[15] = 0.0;
+      A[16] = 0.0;
+      A[17] = 0.0;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.0;
+      A[1] = 0.0;
+      A[2] = 0.0;
+      A[3] = 0.0;
+      A[4] = 0.0;
+      A[5] = 0.0;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = -0.108333333333333*G0_0 - 0.0166666666666666*G0_2;
+      A[9] = 0.0;
+      A[10] = -0.0166666666666666*G0_0 - 0.108333333333333*G0_2;
+      A[11] = 0.0;
+      A[12] = 0.0;
+      A[13] = -0.3*G0_0 - 0.075*G0_2;
+      A[14] = -0.0750000000000001*G0_0 - 0.3*G0_2;
+      A[15] = 0.0;
+      A[16] = 0.0;
+      A[17] = 0.0;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.0;
+      A[1] = 0.0;
+      A[2] = 0.0;
+      A[3] = 0.0;
+      A[4] = 0.0;
+      A[5] = 0.0;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = -0.108333333333333*G0_0 - 0.0166666666666666*G0_1;
+      A[9] = -0.0166666666666666*G0_0 - 0.108333333333333*G0_1;
+      A[10] = 0.0;
+      A[11] = 0.0;
+      A[12] = 0.0;
+      A[13] = 0.0;
+      A[14] = 0.0;
+      A[15] = -0.3*G0_0 - 0.0749999999999999*G0_1;
+      A[16] = -0.0750000000000001*G0_0 - 0.3*G0_1;
+      A[17] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class mixedpoissondual_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "fa24a02d3bb9a3995267883bac1f60e561ee1372b4e29fc1080f3512ce5d69de8640ef5b1efe53cdfc1b7e811fd9695a8a69fc4c282d9c9c7b4a226a2f1667cd";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoissondual_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoissondual_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoissondual_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoissondual_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new mixedpoissondual_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class mixedpoissondual_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  mixedpoissondual_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoissondual_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "7d83f092173b0fae11175969b48eff93192a79a93defd6ac3d2496e383844e563ad6baa9a92e9f2a980cc6cf0c0d4170d5140188d135fc76d0609338ed64af3a";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoissondual_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoissondual_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new mixedpoissondual_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoissondual_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoissondual_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new mixedpoissondual_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new mixedpoissondual_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new mixedpoissondual_exterior_facet_integral_1_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace MixedPoissonDual
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoissondual_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoissondual_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoissondual_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoissondual_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_L_FunctionSpace_2;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoissondual_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoissondual_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoissondual_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoissondual_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoissondual_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoissondual_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/mixed-poisson-dual/cpp/MixedPoissonDual.ufl b/demo/documented/mixed-poisson-dual/cpp/MixedPoissonDual.ufl
new file mode 100644
index 0000000..74c9f98
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/cpp/MixedPoissonDual.ufl
@@ -0,0 +1,38 @@
+# Copyright (C) 2014 Jan Blechta
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2014-01-29
+# Last changed: 2014-01-29
+#
+# The bilinear form a(u, v) and linear form L(v) for a two-field
+# (mixed) formulation of Poisson's equation
+#
+# Compile this form with FFC: ffc -l dolfin MixedPoissonDual.ufl.
+
+DRT = FiniteElement("DRT", triangle, 2)
+CG  = FiniteElement("CG", triangle, 3)
+W = DRT * CG
+
+(sigma, u) = TrialFunctions(W)
+(tau, v)   = TestFunctions(W)
+
+CG1 = FiniteElement("CG", triangle, 1)
+f = Coefficient(CG1)
+g = Coefficient(CG1)
+
+a = (dot(sigma, tau) + dot(grad(u), tau) + dot(sigma, grad(v)))*dx
+L = - f*v*dx - g*v*ds
diff --git a/demo/documented/mixed-poisson-dual/cpp/compile.log b/demo/documented/mixed-poisson-dual/cpp/compile.log
new file mode 100644
index 0000000..2fdc657
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/cpp/compile.log
@@ -0,0 +1,750 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form MixedPoissonDual
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Mixed<DRT2(?), CG3(?)>'
+  Unique sub elements:    'Mixed<DRT2(?), CG3(?)>, DRT2(?), CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, g]'
+  Unique elements:        'Mixed<DRT2(?), CG3(?)>, CG1(?)'
+  Unique sub elements:    'Mixed<DRT2(?), CG3(?)>, CG1(?), DRT2(?), CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0518291 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1296 entries computed in 0.00817 seconds
+  Shape of reference tensor: (18, 18, 2, 2)
+  Primary multi index:   rank = 2 dims = [18, 18] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1296 entries computed in 0.00783 seconds
+  Shape of reference tensor: (18, 18, 2, 2)
+  Primary multi index:   rank = 2 dims = [18, 18] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1296 entries computed in 0.00407 seconds
+  Shape of reference tensor: (18, 18, 2, 2)
+  Primary multi index:   rank = 2 dims = [18, 18] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1296 entries computed in 0.00433 seconds
+  Shape of reference tensor: (18, 18, 2, 2)
+  Primary multi index:   rank = 2 dims = [18, 18] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1296 entries computed in 0.00923 seconds
+  Shape of reference tensor: (18, 18, 2, 2)
+  Primary multi index:   rank = 2 dims = [18, 18] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1296 entries computed in 0.00928 seconds
+  Shape of reference tensor: (18, 18, 2, 2)
+  Primary multi index:   rank = 2 dims = [18, 18] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00306 seconds
+  Shape of reference tensor: (18, 3)
+  Primary multi index:   rank = 1 dims = [18] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00304 seconds
+  Shape of reference tensor: (18, 3)
+  Primary multi index:   rank = 1 dims = [18] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00295 seconds
+  Shape of reference tensor: (18, 3)
+  Primary multi index:   rank = 1 dims = [18] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  54 entries computed in 0.00291 seconds
+  Shape of reference tensor: (18, 3)
+  Primary multi index:   rank = 1 dims = [18] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0805202 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.00041604 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.764373 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000682116 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./MixedPoissonDual.h.
+  
+Compiler stage 5 finished in 0.00156808 seconds.
+
+FFC finished in 0.899812 seconds.
diff --git a/demo/documented/mixed-poisson-dual/cpp/documentation.rst b/demo/documented/mixed-poisson-dual/cpp/documentation.rst
new file mode 100644
index 0000000..fa1cb94
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/cpp/documentation.rst
@@ -0,0 +1,213 @@
+.. Documentation for the mixed Poisson demo from DOLFIN.
+
+.. _demo_pde_mixed-poisson-dual_cpp_documentation:
+
+Dual-mixed formulation for Poisson equation
+======================================
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+The implementation is split in two files, a form file containing the
+definition of the variational forms expressed in UFL and the solver
+which is implemented in a C++ file.
+
+Running this demo requires the files: :download:`main.cpp`,
+:download:`MixedPoissonDual.ufl` and :download:`CMakeLists.txt`.
+
+UFL form file
+^^^^^^^^^^^^^
+
+First we define the variational problem in UFL which we save in the
+file called :download:`MixedPoissonDual.ufl`.
+
+We begin by defining the finite element spaces. We define two finite
+element spaces :math:`\Sigma_h = DRT` and :math:`V_h = CG` separately,
+before combining these into a mixed finite element space:
+
+.. code-block:: python
+
+    DRT = FiniteElement("DRT", triangle, 2)
+    CG  = FiniteElement("CG", triangle, 3)
+    W = DRT * CG
+
+The first argument to :py:class:`FiniteElement` specifies the type of
+finite element family, while the third argument specifies the
+polynomial degree. The UFL user manual contains a list of all
+available finite element families and more details.  The * operator
+creates a mixed (product) space ``W`` from the two separate spaces
+``DRT`` and ``CG``. Hence,
+
+.. math::
+
+    W = \{ (\tau, v) \ \text{such that} \ \tau \in DRT, v \in CG \}.
+
+Next, we need to specify the trial functions (the unknowns) and the
+test functions on this space. This can be done as follows
+
+.. code-block:: python
+
+    (sigma, u) = TrialFunctions(W)
+    (tau, v) = TestFunctions(W)
+
+Further, we need to specify the sources :math:`f` and :math:`g`
+(coefficients) that will be used in the linear form of the variational
+problem. This coefficient needs be defined on a finite element space,
+but ``CG`` of polynmial degree 3 is not necessary. We therefore define
+a separate finite element space for these coefficients.
+
+.. code-block:: python
+
+    CG1 = FiniteElement("CG", triangle, 1)
+    f = Coefficient(CG1)
+    g = Coefficient(CG1)
+
+Finally, we define the bilinear and linear forms according to the
+equations:
+
+.. code-block:: python
+
+    a = (dot(sigma, tau) + dot(grad(u), tau) + dot(sigma, grad(v)))*dx
+    L = - f*v*dx - g*v*ds
+
+
+C++ program
+^^^^^^^^^^^
+
+The solver is implemented in the :download:`main.cpp` file.
+
+At the top we include the DOLFIN header file and the generated header
+file containing the variational forms.  For convenience we also
+include the DOLFIN namespace.
+
+.. code-block:: c++
+
+   #include <dolfin.h>
+   #include "MixedPoissonDual.h"
+
+   using namespace dolfin;
+
+Then follows the definition of the coefficient functions (for
+:math:`f` and :math:`g`), which are derived from the DOLFIN
+:cpp:class:`Expression` class.
+
+.. code-block:: c++
+
+   // Source term (right-hand side)
+   class Source : public Expression
+   {
+     void eval(Array<double>& values, const Array<double>& x) const
+     {
+       double dx = x[0] - 0.5;
+       double dy = x[1] - 0.5;
+       values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+     }
+   };
+
+   // Boundary source for Neumann boundary condition
+   class BoundarySource : public Expression
+   {
+     void eval(Array<double>& values, const Array<double>& x) const
+     { values[0] = sin(5.0*x[0]); }
+   };
+
+Then follows the definition of the essential boundary part of the
+boundary of the domain, which is derived from the
+:cpp:class:`SubDomain` class.
+
+.. code-block:: c++
+
+    // Sub domain for Dirichlet boundary condition
+    class DirichletBoundary : public SubDomain
+    {
+      bool inside(const Array<double>& x, bool on_boundary) const
+      { return x[0] < DOLFIN_EPS || x[0] > 1.0 - DOLFIN_EPS; }
+    };
+
+Inside the ``main()`` function we first create the ``mesh`` and then
+we define the (mixed) function space for the variational
+formulation. We also define the bilinear form ``a`` and linear form
+``L`` relative to this function space.
+
+.. code-block:: c++
+
+    // Construct function space
+    MixedPoissonDual::FunctionSpace W(mesh);
+    MixedPoissonDual::BilinearForm a(W, W);
+    MixedPoissonDual::LinearForm L(W);
+
+Then we create the sources (:math:`f`, :math:`g`) and assign it to the
+linear form.
+
+.. code-block:: c++
+
+    // Create sources and assign to L
+    Source f;
+    BoundarySource g;
+    L.f = f;
+    L.g = g;
+
+It only remains to prescribe the boundary condition for :math:``u``.
+Essential boundary conditions are specified through the class
+:cpp:class:`DirichletBC` which takes three arguments: the function
+space the boundary condition is supposed to be applied to, the data
+for the boundary condition, and the relevant part of the boundary.
+
+We want to apply the boundary condition to the second subspace of the
+mixed space. This space can be accessed by the :cpp:class:`Subspace`
+class.
+
+.. code-block:: c++
+
+    // Define boundary condition
+    Constant zero(0.0);
+    SubSpace W1(W, 1);
+    DirichletBoundary boundary;
+    DirichletBC bc(W1, zero, boundary);
+
+To compute the solution we use the bilinear and linear forms, and the
+boundary condition, but we also need to create a :cpp:class:`Function`
+to store the solution(s). The (full) solution will be stored in the
+:cpp:class:`Function` ``w``, which we initialise using the
+:cpp:class:`FunctionSpace` ``W``. The actual computation is performed
+by calling ``solve``.
+
+.. code-block:: c++
+
+    // Compute solution
+    Function w(W);
+    solve(a == L, w, bc);
+
+Now, the separate components ``sigma`` and ``u`` of the solution can
+be extracted by taking components. These can easily be visualized by
+calling ``plot``.
+
+.. code-block:: c++
+
+    // Extract sub functions (function views)
+    Function& sigma = w[0];
+    Function& u = w[1];
+
+    // Plot solutions
+    plot(u);
+    plot(sigma);
+
+
+Complete code
+-------------
+
+Complete UFL file
+^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: MixedPoissonDual.ufl
+   :start-after: # Compile
+   :language: python
+
+Complete main file
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: main.cpp
+   :start-after: // Last changed
+   :language: c++
diff --git a/demo/documented/mixed-poisson-dual/cpp/main.cpp b/demo/documented/mixed-poisson-dual/cpp/main.cpp
new file mode 100644
index 0000000..3dc9c7e
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/cpp/main.cpp
@@ -0,0 +1,87 @@
+// Copyright (C) 2014 Jan Blechta
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2014-01-29
+// Last changed: 2014-01-29
+
+#include <dolfin.h>
+#include "MixedPoissonDual.h"
+
+using namespace dolfin;
+
+// Source term (right-hand side)
+class Source : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    double dx = x[0] - 0.5;
+    double dy = x[1] - 0.5;
+    values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+  }
+};
+
+// Boundary source for Neumann boundary condition
+class BoundarySource : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  { values[0] = sin(5.0*x[0]); }
+};
+
+// Sub domain for Dirichlet boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  { return x[0] < DOLFIN_EPS || x[0] > 1.0 - DOLFIN_EPS; }
+};
+
+int main()
+{
+  // Create mesh
+  UnitSquareMesh mesh(32, 32);
+
+  // Construct function space
+  MixedPoissonDual::FunctionSpace W(mesh);
+  MixedPoissonDual::BilinearForm a(W, W);
+  MixedPoissonDual::LinearForm L(W);
+
+  // Create sources and assign to L
+  Source f;
+  BoundarySource g;
+  L.f = f;
+  L.g = g;
+
+  // Define boundary condition
+  Constant zero(0.0);
+  SubSpace W1(W, 1);
+  DirichletBoundary boundary;
+  DirichletBC bc(W1, zero, boundary);
+
+  // Compute solution
+  Function w(W);
+  solve(a == L, w, bc);
+
+  // Extract sub functions (function views)
+  Function& sigma = w[0];
+  Function& u = w[1];
+
+  // Plot solutions
+  plot(u);
+  plot(sigma);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/mixed-poisson-dual/mixed-poisson-dual_sigma.png b/demo/documented/mixed-poisson-dual/mixed-poisson-dual_sigma.png
new file mode 100644
index 0000000000000000000000000000000000000000..8b1e33348373c5511b83c1fd78c5d9c76ca48dd7
GIT binary patch
literal 31670
zcmdSBWm_Cww=G;G!685h?g2uAhTtwig1fsrgy2qsI|O%k5AFmH?oQ*@xI3KUzMpf>
zzRuq74|w?k-CWhRYOQHw%rQGiR$3Gl2_Fdn093KBLh=CcLKOgDA`xDI?>wjkjQ{{C
zASNWB=$x{@WTL4kx&Xg&XStk<gYi~2@_kkTLcuID2CQ39*H6mJvdY}VOQA4I#yC^j
z*)<D>S;2kE;9xBuR9LyUxt*7%o~lB#sT?2PSsm?NxvLI)ZKaT%eq(Af+4{tp`Wjsj
zflQ&ha0iCe7hMnw5t$5p9qsRjPUaga)+rc>F4&i&M<#?oW;kAf{>~TuvzaOah9E*B
zGp#QInXe>1wjg-fd({8mTvmza(jX#?2IHX_DxF`v!$|5Yo6E{HVVgM=5=;zxtNKj@
zeB@Ww6Wqu;Cft*QgZ75Fc`tf>c!{5%S7DpEG3rF17p4YThmW_c&m)h>4tbfpH0^n7
zit=yaZ*fV^=VnH(GhDoVwv(jc;2YjpukNi^*%5bB?>9ReaS1Al>4LkdWYr4qMnF<h
z2aO&~5bf#Zcqhnc;M)wJ9gaun-g;riFB#IoV32R5qn`E@`+GV76<bN<dEb@1CldTU
zMO|@8OmN??1DPv9P_?$}v&Iu!Bk{u~&BJ}0#VRS1pgr;7#~z+Lf~z~dl%oJ!{d}YR
zWfcRu63^##Qpfv?HW3g;IWNp!d}|}BU0$hIu}|3cr)QX6{KS6P&}y;f>lHe(&(69s
z_Y?W(v;TB7OU<1H(7uGYn5rv;JHZmD_9?i^#uOXyrLT1DJ%Uw2d|q2DZ09F!3$8`z
z_l%uC^Oz4j%5`jIKi@ED0QDpeUDw<%OpxauP}bLLd72H;#+N;~e^ZTDaLjipewBnp
zGr=YLbI&F-VYf8!6m$l8peQ(fHa=<<lul;ud95`wt#jQ2vB$@Jx1g4iqX=%f{c9nw
zCf*C{+64o5;;Y!yK&41lB3i$@sw36Iy;0-f%MAyuyTbV?#>Rk;E2}8P!;x5>L&2-s
zYTa}<v<2gx$r<Q^Mk5wh@BlhzGEOSw#&Va|p0S*za;%gde&x?X4|prJR~(C`O*n^G
zTtQb`vS%4dUDP{HB~J&^T!Ha<Qt+#(e5AB7ZdCbGrQx?)qOC4=6+!T4X7G6in0XcN
zUbJ_<HDy&k)20%Qg$KPvR&88`D?BjSj<@EUYd&9s+ebRRQNGbjtM&Ql`-8iBK3oTJ
zSB8ldZb<SMm=(y1>biupaKNUvCyf6d5dd({I7uaXVH{$<i>O&0!PfMSI=VXOOZ%Fs
zS4loY3<XH-gOo<8jIlAb?JYY1UEz}X=d*@HfD6wI;Q&mH@PT@wS{<Dcfd7P<;U<6v
zR>=w-XnFO*;~heY(x{m`W(a@pB-TuzfkEPHq!c>H-b=xj!LwbM(RaKZ$JoiUW^<Vm
zB|qc1STVU7Qpg2Qf}QV^tf%o0?zAyt`DlG(RYvT};x1kR?MyT-2Kg6pXei;Y7`_!O
z{Y3#TUva;8L{yiZFsZ(HZ;`Dd2mqt|CcQLv1<5r2TIZbODd#F|x4M^|>aCDtn~$80
zrO+GaeO`4aXoB5E&gxJsA`$LK-C4PEsniQ2G~lhw*(rUC?>ox=Cwqpci56f*WT6Gt
z15QBi6#(l{>5Mp;-xWk!p)3GY>}`s<Da06Ys+tF#9o02XMd5Z!4-mU8=+Uz8YzNA2
zXej^>qCxeP8dKiM)+**d_$CXMwC~q+I2e^^?77JlinH+mRoCMX5e_t^Tbz;b&E6q#
z8g9s0aB^<IiWI@-+4{Idl{S6~>zX`|1e(C`7bED2`?@-=<Jdq}8tGNkFI5DB$CZ8F
zao(q>HPzy$K!d|1LTBE4>&qec^}anCr})g8aJMva$4Le&*2hlGay8BC*cG2H1OPu3
zDs`VCHez6P-5Isf`kLHlV!B6;>yY@SVnkgX+UjAy<~`Nb$4f1=e{^pTb<~I6E&#yS
zG)d__`lFYC%=>-T@Gj!Z@CgmX6uQ`t96eZa`(`R`%E$mZy9VI>nUalxx2A#_deqMR
z-Yrt?>`bI*4-=isUvJB67&M`kg&d_9!w57r13GOlK=W~SA3ghd;GJ7&{t)u?*!RL)
z^eO)AHi-}*U6Gpb*6&6G-YA<;KI#nbS$sBy8{I$PxVS(A<Ri9wU-A4T_0G`8nTqEJ
z*rz!d*Bd9Dt5b)koJh>l>n|@#%N0TumR-sm0%mfQ1OVN_p8#nY4adweJDpL!bH8Ji
zo3=akz_!RcG`E}1nXV6aqeP_pt4jPA+#%R4;k-w`?Y%t|`}TIuddyBY4nP~4Uf_Vr
zwXyW<Mk6)}6JMs)1Qe$k5yX6%OSYXR#M-DW%5R_hO!IzqGf4uraIEQP_z4WLMJJ56
z34>z_VGR4@hl^x^BSb1(rO?+(MzvwSUF%Y9#f+c24Zh{gtVos<$M3-nJ5^ZFzN<xv
zu#1qq3X;4+jIgV_psF*wk2YwlhSQ>Vp1%$;Bj0^oY+F|&QJ>%P)lrpainGb-d_WI@
z+p1>XFow6&K~|sF71aoez@odDpKO@+6{)V?O2}jBWj4Z74Z{$iE!_LvN?W+_6s9kh
z8h>sg=685`$i-_yFng>U!P9Auf@W;Ce(aJl^W%>;Jlss6{vB~KWx$h%7`OG+RKzCt
z8^xPd&W<9w2e?(OiQ_5<Fs3x_a}9iEQ(In`*+0ouW6;rw#<H5YsJ=77yWkrrKm)Fn
zO{{Ak7~b#5-8v-xDNMQ_DSV>g>wS&g%SlCS=9$ilu^%<hZhK%czmRDq!}`j*vn<|h
zS-2OzG|k#Q%`Vy9qUp|(VGh&mFqKf<DXQ4z(Q9%yezg03?#S|J--yJm<5v<(>CmrJ
zi^_vfzw9<@Jroh>JUAVi?k>lw6(4t|vOO)J2ZX{Fk+p|wKH7UQ?RH1sX1aNTthCD-
z>>2bG#$&z!D-Gnoj0$4Y&-%rB;PL!z6SzWWwXvOIoi#l#ew_#mWa@bI&C15AjK$(A
zc|ZQu*2`b)kZ!1~-gVDP^TeLLrV@=a-p3S3m7W2QB^lF`7L{`m?d1NK6$Kd^S49r0
zW3@vfbYMJV^{+OqSqooNWe#WRu-&q3T#ScE0gajbH9hL0le;y})X$c%fh=PB5Z8*j
z!Z(`A5tPLF4|zp3-?2}ehlI}pdxshwy~<C%-ag%GAIM?(rDG&z9nfF3`;`hDQRvt?
z{qf<OC?AsY+uC3Soq?^GD#znp!3+xrIv`!wCTubKjuik7pAx=Wj6#)rw>8o`+@Z3<
zWm|Q3saZXg9{kroe!V{|Idf~v3F0zC{T{wp%P06qE6ZTpZXUN_4y=G4Kp$~ePrH9+
z|9%w?uVrI*GFh00AX(;1mnS`Nd|&)T<Jx@rlZ;z5c|(o{bpg$i;k3Az++#!8ZED}d
z0Fe(bj;CpBpG&g2vA$t!`v74T+oDf(M=T<GHR5Wr!OhB=x>V}AQ^Y*cv2DUZ9qT-C
zZ=8kW`0s5zrSc!-%t^Of82(G4B=+<JM`xGM8mVUx!lJgNbP+G)%>Z35r*nsMmw``w
zmrNhhbGR6G2F6!*2bXA-Dv%1RT(WWsHE!qE;gl+dd;b2`5EJ|2#bkPPKJh6^XK9jw
z4L3bl85V|roHKzHkh(3t!vFSo`8O+WqfT4S;U|-z;fLCXFB#YjfcJ4g7_p7J$9BLr
zt(7J`*T!NLBsE^r0=>E|$gdo4z$yy>w^nrC6|u$Gc6EP30L+tC9O`OvJR`<7kwkW#
zH)6{%YE7o7^2P_h34{`zR9I?oUaxV?QJ|^O7Z{W~%gZ`g!q-(IT&Uz5^CmaI0=mXg
zm&pD=dzD(UZoz7y=CoA&vgfacgPap3^I?LE@5HNd>Oe(0&+f&&QCDBHMnv-$e=eu^
zz`gNnkERT2cw{}S6{Z=MRj<il`N!9;i@qeY_`Z)g=rastcdRanzG*pSA6yQYRQat&
z-<73u&wX<$&T?m~+X}4bf7m0TNSh}1a?~Z*;Trur#gdiO65J|i5$VM-=O9<Uf#+t1
zI$oz~zrddIK)tI$ALkjk`Sl4d@3Dq@SLwFVAUKEFBlV^C;w%APG6+3T9$PXVIs~|>
z2!OAyb~y!{1XO&<H9^i~@eUK|;i@R)2y#O%*>9Z+k8-O%EZt?@EKuP*j9a$L+$^-w
zcDu+L`6EMVYKEPVv2RZX#ho$lzNSh5D_rH_9vU>jCp#QGAvnQs7FIi)m;5DMdi}XN
z3!WW&+$X)+5W*34pOg_+()+^KfJ57{EureR{zO}lnU59G5ehftP$Wd*(RUAfNvuIw
zvkCc6esCUy@ynrb^FzySQ-i}{?u?Ar6B@AZUn{<B%H9y;tUi;5b*#H_@^iU}g7@y$
zsB0nrp&~dz{d~uGAv~G+0$_BwzS*wkumikR5r#UOwuva53~_6pmZvn2CkE6eb!upt
z($w3$a-}8mJs4_KMqU9I1EKND=&Uf`mOf2gXGmwh0KyZBJ)=H0#m0E?3Y^Rydu+`k
z!?$Q-6+5RGFSZPC1u?YFNrwU%pu1I5t9E#i+}cOBkV~ishi6THaV`sEpO)sJ;U&NP
zjn5Kcp}}PEs5);ZxB0`b0tuO8pQ@1NC!5h{KDpOGxs1un_Nt{_j=Hmu$8~IFUZ77V
zCO7@B^wJ&mopL4G>^Ycnb0UnK@|M`NM=}_GfEBhI(-V1_iK*uWri=XJh4uy;cXHZM
z+1KGVrpRV`$dT&Pc?+7U+gE%=0l?I?Xkf|_)}no>Hq3)NQWF5$ck}hSMiPN`6P>n6
zy1BWgKAUuK=i-{4&=0C>C-O~b-_NK31t$|fRdj}_wfeP@iEzB~J!7S50+c<z49&w;
zDhde@iHe=Ub--CSC)INL$*0C8UapJG*NiqrS0ABjrWL5UN%aiuvz$@8vhVQdl9imQ
zLf8+SxdLfcU$mU=#;QI68FQJswpu~^LFeLZr*Q^hSG8}Z7@K%@^dVZOCdN`DPF^)<
zClfk<N%)}YRQ$z1t&3g7%Xt_UDZ0IvMwJ0wZgN_RlDz_F!6i1O6=;rR9t8WGO!d9r
zv0e>2K#1c-#X}(4#PbHCC{!wVqu<lvMEHrCWkAnvO6E-tRUy|+rg*8ovQ<XJh+SOq
zqgOTDk30OA`~i1lLr>QIzl$Z>|70lFEx-~QF6dIS^G<rnAV~PU-+o5{nH<vLX0x{?
zoJq)S0<$!&*-~3iMb5BAeq~Oa2WJ(SSHib7Lnvz!dmO*tk!)9`FB<ow#7#Q(yj{Rk
znC(@z8{=Lmv|Q$0ZpeG|+9wz2i&-7|JT?7rBSvf1L_i0$8yGLGr){@muCQiG4GdV-
zzp>tG2&GwC%YeDz26yR&_g>4efWr5e@gGqw&h47;zXNajP|rtrGKOG(oadR!-R_d2
z<ZM!+PnY*X_$Oly@&wXacqDG218TJjZGEb@$fZ9{|M0}A8Qd~R+zi)%X@4TmzbJnM
zXn*&vdTT_dCFP9#=8a6D!YcH~_D+`P$>eqYW<3iB4dUHt0_uEPn^Ai&2~Lqbb>o|C
z@uKeBX@~rVD(2(6VwZ33rm1)kS}XS_=*k_=LhGkAf<|ZSosRL0!+zo{S4T@!)qEc?
z@7_*0(iTp9J`IoYvusNk{FM|CP~~Kjezr@H;IP|2?yWLV*mJd9k)AVOkuExm(PKWS
zSj?ypbYRx@XAoXtd##%OXDxv^F-cM0Hvyh^cWlRl>)jEiW}Q}az>4yQA61*|dsiSV
z!eJmtB6|t{rOnpQtL*TK2q6)d>zBYRs#UCAjMY%~giL23@>svPwPfhQ`7SN$=eS4x
zC%Ogo=+NA@z@M|&7)5D3GIzI4^5Nz3->-Kq)_p+VSddOShc4KlhA&7al}d{bs@M3A
z8XY1LZDPaEEqkFyNVt~gIE>}#m=G`*O&^!aDdN|`X#=`$Uw)rdT9;q(imBNKOt;&{
zw7KvP1!T`DH@O`K8oG?r0;-N?ec!7-0LO%XBj((kG>hNVrmd>0|7IJ_Q9y2h>>VNa
zWkP==9A$Y$xmC>CrS2O`uTE7ATsy=<)hbJIY2UrO*4FO2vpHzfNNEUd_6R*##KL<b
zkO?h$Z=={o!55n32c0hOTK~z4*w4fZ2hV|hQPZ$Nw<Q;=IHn+Pm<4^1>(HWh@H}{L
zUuR@vfH{}aA~0kFSIJh9&hfKFAdI9<-$oZ3y9bh?{yUKwvVt(u5ZBppWYv~nd9NYt
zmExR+|8z%k@W$~BTdthfgo94sMd2+Oz9z36%e58i-<G()<D_O|OY$kx4(dJ|l#^l_
zlqyc0eN>$VXn_ngwF<o^v|1;X<?@Jgq3KBt`h|}*OE?P1Hpsuy+DO}6rD9J@NRv4H
zR63;}sChid^hA`-;z@G0>EF!g&r7G5HG1)}z4v#&5UY}4#CZj1OR>${k8+!PY1^Zz
z_l{#!w`FsSHAJB(5vd{+12cbl;{+UO{YH5^)DrX1rx=;o>1F!iy)_=Bad>v>s#5!=
z2qBg#R?R9V4{e-?T7w`mwOiNDyBE2BRkj+`8l3NP74VD1RQu`Jq~C-if|u&)=h-aJ
zXQM688}d^~uLG+zE5t=jW(7*|`f>nrgT`2Mr*95=TMz~?>v5)WdlhX~nA4d*j`<`S
z>ipUo$_!1m#LlkUF3W>>nX<01`7AXc*;>?FXv?u7GCf(!L8kGlCtacbCAk|`8I-BF
zAxSmxz?$`YW3Aicy&C|S8HNFvcg;9ssohW=g2>vGt)|XQfOe-cE!E4>rWN@6e1%ro
zWpkaemjXvf$a=9ex)L;i^XWwC{SyMsoYwp4I&+08)6Ic~<6w4V+RDeNq|w>3I(P}h
zk}H!}z^J%x*eYE~Ba8EF0B3*!h~#9?7RDIbvU!UGThNmncB8$jnPqHr8GN%MKiu4y
zn$LevxYs##WTm{^<fsqfj4)sb2)20YlYS7k$XH&M$X7I^PZVqkj;`X2y+xq&m4wIc
zfDSs@Sv-U^`HZ|Fn8crH*UNwhKBR3?d5|zjk;-tkusUKiCgdNvT)T7J3^%%Zi6EG3
z@Fuz|UXrHHwi{f1ojS9O+rF&a=SBo-R0cg*!GIp)ff*++1J6e|kb@2k!qE;bOV6%W
zMQ&b~R(sH1l;m5F=1^{1voue<Av^b^z9bh{{DJ?tG-RQrkzZ*U;dI3_Il**`Ss9Ni
zL6H6>ibWK@g1Mm1!gq8jEmxrQ#*(0SQk^$|a%$Ip3&T<-u@0Xtp0Xyb)&F5*pW-3D
zBBujeZhvV=^nt|fWmTUJ#7z<*^U9Y=P-qL}8eP1<XuGRJp~=;(5I4AjiQMWdL70r5
zW9(n=hiNed{PoO-NCrRSl-wNb45GrTUcR8Sm63L2WqKUcJa;K<s`8RVpp-&_X?MTw
zX}%B{S^I(zORgy!(I>C6?EVRgD}iON1G&&XIshwg$n=NGa&if*k_!(CH>^qU^c;00
zjmm#IF3a-SPfi$C@U*oG&7V{4qfUxV!s9{pu<p^fI$1Fzkds1l958C%I|<~WAd^w&
zb|Fq~6Yucc(k5-%*0}D2+|pl^I0C~JBJ8SSotSS;+0Zfg1FBzbA-C5EJl(?gH5#Ft
z6%AeM)6sF55gI6Jy2Lj;9QZX%Hl4cqU4>FhC8D-*i+<az(bKR>Zr9TvigHro2EV4(
z7G#P3fS`4LnpTL%UoI-rnJ0_5>%A5bet!C;)9Bl7%=IcYDM-QtflH4iqq)gpl4sY~
z&&LJ!8aVnCND<K_DDOpnPG7~Cv;<+yY&X9r^To}C!hl5fj+PjwJGJG!T)yH5>y%%q
zkc-Ru)?qD<k36-V86i^zE&#u~Z0Y7P2@I*pgG!f$8j4zEQxNwmy%rWNOWG6i1*)ii
z*TwMoVio<uK;~%xSjQD`{0@?;hX=k1O}6MAInF7cOY|}h4ZcVL_+=MP+sZV8v=)^w
z-m+_qr+rg&a!Jn#ax>*4rk8-{PHjwO#hpP_hz^ibxu~p2=J2Z*Ky=0V#XFGOL^UdZ
z_Co^Te>nHQPgy<N!Sk<7`rUdgA+?1p`_bsBL?xdR#(OA~4~9Sb<d<rtrAhg_X}(JY
zRT~BUM1&U>SYVy2V@f;m9O2NF(7=GleZ=z;Sn*6JI<)Ax5ItR2fFZrRUe7ANH4jJn
z#au}Ft@agQBp!Y~f0lw7)Pv@DyvRieD31Krxp!5!j+qzrQ}w?oOfzY@eemUus^ALU
z^Dl(rB#vwgVFsv!kpSSon~gByq6aZh-T4JKw1{hOckefLL`E)U*=+XeysO3M!!dce
z{I-qWcZFtMur89w>ePp}%C&7QEC+6awZ$)4!mbsP@yqK4J=<T*K)%d6BJ~#4vXaX+
zM%)^r$c2n-;PiQskr|p-pex&@alM1#Po<C5c6<CjM5&+LIB<7tp;4G-BvH;Iq2UxY
z+heo~c+%~qkk{#mrc<#NT-dz@Ll|jH{fEbR5^YZb4}_O)Sk<_f3Wspemh62cSzLB?
z+eBBs*KTC@{QC|u%g#TcoHvgcJbG1(i>{gD2Q7RZqv)UMu5t6s4+XrS^qRm*rB&dm
zOZfg)l?o<3Cc!MKxi!{mxoeuzvB(Frzl%*V{0{1z0}tt-ml$^}4sK2&ApuaTIyHGm
z?sSB>nDzOFNfZBH@BK~<qVD~pmFoJCxzCkkC-*AcZB+DM&WECtowtG=i-HuKbB~MO
zkKG2)^>fSHI@Y6=Cwml!wY5(sua+C$4+x=)-)cVJp_wOHX(W9dzoPA9e`_vP3^O^c
zt$L6AUvxnw*kJ?=rT!AF_C`s1J9ro5iLBXT(z`F=C88sJ5p%=xu%+)y2enzlH}5q~
zye?NOLBOyw%cg%cTsjff0<-M&6H2e~Q5ZpqJq07HKjdhmq@$NSLms0xL^&n6Xh$xi
z2*xQ+AQngYkGaU?&-+iPa$jTAmSMZTj=NDFSpNF4(fb3&yWq}69qX+<1-HIr#LNl;
zUD3wxsw%Jh6Hz`sJ|-q6C#Nf79@i8OySy%K&Q$B|;nY8W{$OKcTU%R4MMa^J@G@It
zVq#8|YSiJgm?OM;frAsD`6U3-EVkrQSyYtJ(uyHC6+V|AG9+3;C4z16xHkQbT!dEU
z82w6JAdHtsFvJ&Q+Z1EQ4x3INKFdFMPxZCDg2Kc7Jv*VakWiP3jt7hT^)dL-K>PXb
z#2i<dYUK;y#mkr5gNc|}Sl!!a-TEg>O->=TiJy&-097?Lha-r`<^J4KqXQ<ApC-N2
zdQTY1nH#kY=xJ|~f6!68A{5+WUOj4kzGm?8`SmC<DEg3|^YmuDEp3Qb%aXCD!b8vS
za#w%ePc==@h}E8C0O3Zecl2Exbzk_NQ<gmu&0_nHmpAT@C+oe)5r&3_)n*fLfa4KF
zYA;vz!{E@+moHyf@WURzT3XTqzJ7jKwHzL|%mB05I0YSD>9MY+W{Qu`%ZOeHNy&SJ
zWvTA=5rpDUbv{%82#<94idN2?7Uj;@C*UnqsFF8+tHEZ)RZv>5N0gS03KZxV;@h}c
zF;%p<<mUkyo>5V^l&g4qENw(Xb`{x6um*f?Z-C~sw$Oy>>(zJ_9WQ}UpxyDZDD=j_
ztgt)7uR)`aiyYZUlzMG?obz|N3<Ha2F?^9-TJBC?<?+Ope7rjXCq$mu=BtFT7Q<gO
z_^94>zMwtyu7swY)3p94Ji|z&<gkyoxzfe*+FB~tlwd44n?JUy{7DmMzfI>*Q0k9=
zr0>%|JrK`8L_|a-nQ(k})P}?JxHCqMh88iL%C$F;TzP$cZ9J4@HD7IZyi(T`$;HV@
z9oruoit-S@y1E+hnuybGOLA|zo7GFTQoq|55i?IR@wdI18EYi9G1*zBiL(w9A|)EK
z9t&BC#+StNr0a4sri@tOUXjqq^8d;P%zf!-41cZT1qVQJ@bJ8d<+xq++=)FN2DltJ
z+_w3;7}@C`!CEy{`Gr;f;4AM?9h^4`V)>8mPC9GhF|KQ@K1L?}k7BP0i*M)mpG-fF
z*oEKz8JT1zRVE@4mrCv`Dwk8ZR7aqU{i0hM*k^x#Ho}*gnc3uc0G-H>5HOUTLNTpT
zFI65`{l=d1lS|m}b7D<RO={}W+4jhVC^rvJI*(gie7wr62m>QyrFM%ec(K>h!&QLi
z%h+u6wbLMT!4uz#)kN*BOFLSkR26CYHgJ*o<k&cb)U9G6o^&e<SSRa<RJNM;sppoO
z!@N+RMDzP&<kD9!ybt!3`nhbYr9O6B!4<z5E}S5qXsnWfpPPAsBsiN#OK8&Rq9jMF
zgbt_{kpiZ6HdQl%m(&P=Dl7)z?B-@OTahV@-04B^7D-q{#6K(ywbWqj4FbTy!2vpw
z0(I<qPm5N>`T4E_JUqM)c-`#?se(cw8dB-^3iPDL7~25=Xw7E*dgnsK^0MIOOyzfd
zF~{BOmqscB_<Z-jE_y#tF`cUOi`_x8R)+D;dS7f3$%P0Y&lP9nT#3g~e}Mju@({ik
zrK4JGtYVhwWBc*~xC=$kbXtW%@v*Rs+}%OHrjDhir7h`VBIL9;?T`5=CMHH5Yks=%
z*KWJjLpMh-6FsE6M+@{s82&=VIM2mclvb8t>R&k?HtX<{Sf8KHMK2~6PS2i1Ep%B;
z-5#;WYi(@4S#sATqL~&}OksC()N+u>a(pZP-&z1crLn1Em4#|Ea&&|;?H2VqYpu&3
zHtR*zDq|^m`SG!AQ7bE}nNkfL47rLU(#}s12m}!kv8P2f>nck_86t6=Ag10S@Z8B(
zw9;&HEH&s2|D3o#n)!u@v$>Z?|LSP@XgpU!T)h8pG}RYD!S)y=GWr5hgiQ0b{#cq+
zP6v7F*dq;CnD&7Ii-+3_>R2e~RSeu;Q$8xS?P5OnI9(#`^C9L8c=aLpsHDpeXuz6w
zz8S`dQ%@6G$%nFm#a{$U$|l1pyQ7&eJ3moLr|6ddR8v!%Dc2bp7+_+D)LLoK&=l9#
zvp>Y^SF*FQ&D1xwW+x`9;h{FKJ&O=pXlx^<s<Vt(DMWCYgK-l@54PvszM`S0A(^pW
zlLBAsE?B~av}WwAT5=ZtvMmR5+C&{#Nrd|9sZ2WIV30dD`%|&V%v}bS4~7$Roc^Us
zpPije;c}w?P~fZ44sPgtj#%`U00gu@#<(J03@89QCughcg?RQDZnewJDJ8(p#TDP(
zP6OL)QBD2ac)&Og8XIu22t`xB*rPplFmXZ8P+A_{*P3jrml)zMae`n#={^-?1#&*X
z0-=c^(&W)3w92~AE2K@SY4}(aa>jyp6(Z8nJ_e?H2f@&_Q}emUF}Q7Jf;ZXHfpVJa
z(QO}JWXyIF`TZeps7V&T3LOYJgc<FuSYPqEN$xyj3m}M47_}z^K9rZe!nIBbc1w*r
zu(D`2@FpH{f-6NjeHl?euW*#L(KtLoF_N82%g%yrt`l|T@_`Ku5W%6L=clKfuID>V
zlT=`arH{Y6TJ}Q2mEG5_0%K!INlC30@?(eTbjjR$Z-jw?0qP+ykIN|qaD990dEMub
zg~r!=M^>iMm26amm`}+B@F%At1E)<vw?4n?7y37T*6^|zhZ(+dPxB!H3MR&}o_Ky~
zH7X@Q)h_p`&4^F{sLJk~hEs7GFH?Q6u#j)Pk;KK`Ov6H5u{;8o{=$exk;_ByC81Vw
zVlmbURZedmrozC9MlM&Iaz5o7g(@<}o8$ttF)TmpxZc-!xw$<K57N>1bab06u7#~?
z(Q)4?!fM9%CYjuxiW_Erc`m*2{CEcS_-nhL&Al9xi~1R3Y;25NB-9kr>>?={T3Sk1
zss`rJ@83@w>|l$715ogO8x6!^(I|%!X;ggQ?GC}w)6-+KfpFVxg+3Z5g0ACmxYz&&
zOwkD9i{s-_HqdX(!H@uYPqt{p;^HFjx8r%1&4)4yleZ8S^A1`!$H6(L6x^x%8yet)
z>g%uiTppYw5bcLshn}_WE;v@qt?vgGhUIF4ZjPjGh;M6%JM64t>SAvj!t1xG=Xjyh
z7W+z(+h=~9t2pNBM-ms=>82lNj;gm<Zywk_6r#rk?zw25Wf&ATk-q}&E)VvmisMyj
z(-;l>h2Ak*e{#FDd_X24Nq4(C#Cq%)86G~Itu%0VcR$-2(x@?yjf$%DdU_lj9K1Q(
z_B!cakV0>}*-9qyy#CYQUj#m@wzl^3vwPgydwM?pghe(UruA|8ge|BDdu%Z?-6qS!
zltKiZ8`8=U^NOuWx{V6Gh%xHd*fyg?2WWe3hSUT+IniPiU%+@D@yR)?JE>FOZxpQ^
zMX*?Pi2GA7W(kJ`PtzIrwXLEekpUmx27^0qHTQdSwKL%L>(^4rtf@S1j=H)TfAGSI
zxN6;RPD5}Q^78XFG&I0Pxr2e1h%0VLh8K)L;-o=~WDmuB5-&YF8H+T$Viuf1orgqA
zVKXwB4Z=TSrC1TlkG}QpFa95aQ!J`nJl4<m<UvuSx+MhzNcvqh7jLdO__^}yuRcOI
z-_ei0OG8_DApaRzO#6{qMqSS3DFT6yT&S=5*dyQ0G8vtui45B8$LJ)NLRdKT+1)VU
z18tJQD(%wP-}-n`UD}c201$buZBo39pw_1{8$Tit%_`f2;rC3aFee7OT4erSR+Ec#
zTrOZy70M7{RL>W4&xGJsmdCBaQx?)sW#($8pC$RCs|SmVHe@$b8T@>7u9C#sKJKgo
z+7Vv$j18#isM{lBUf%-12n0g<+0>HD!&R>e>}-UN7&Do%&XkGVHsf`XpjC~wW@Xgw
z@<~&?9{+wFp}CNh7{W`Hx0Oz(uf|}?>uv*aJuUwP=qAWN)+5bRd>FZo$ujU;xoH`H
z@0dr|v(3U;=#|+z2O(X9CmJ_OQ{f{$GA6ZbQm}0#Impr^u#wv00r7Q697#}?WA)i&
zPBe)<C6W#e-`6zK7r@N)fG%>f;QrI7ds|`A!ladiT7`-LcJAY!mw@#H3NU&vs<mys
zR)L=NTlCJ$GVG}JB_Jgo4t;!BOu$`-bJTelJcb2GBe;^CoYQSzdYnw;<Zm7=6o^Z)
zT4$7d1sC_`QuRfkRTH);xt!VD%t>{{w7e3(B_SUcJ{MZGJ@xrhU7ZtFGkY0+gC1H@
zDE-6c4_Ox+GFcIRiO8@#Uu(QqiY(DZ2^F0RgjclK3p;yy_moM32l=g^aPit>?`MaV
z8)>B_HNm|{GJ;-GUtZQZ7;6q4xy7Y#XtwRoYPo_e#b1JfPGSFpRE{?Rhs;;DTQ>gA
z$0g`lXXYBBhpU$yR;@U>j=+Kxg6&rZG7|6CDIX%nID_xfR@gqfAA9`a;Idi0lgZL%
z<POJ16udlX&Xb>*Rx!l@j(u!?=M<=SG>Kpo>DQwU|5VPqVVGoJo4Wg@U=es)!d996
z>Adk>EhC3{TPmYdY;QGb-Wnu-GQtrv{qBS5=d^X)uNt-tyIzvEmV~w!$ZaRD$_z5@
zcVthop7Tg<nWdf@2Q|W6KKF9;wA|=n*=Y;|-DaalsmuLK#<c_%{r%etT8>Q?X(b(}
ztlYr&Y_-it_%#UKo0wBcON+2T#?W6lU@H67!=Gkyw{wO;&WlK5KHa;Eav(!YW}@yd
zUt`k_UWtg;K#kofn=B<H_OWVW<;|_qSyE^`2!g|KUI#CrU|$EAGbz~BMUrS)F`DPI
z-noF?-mc00s?O8wXtRZwihJXYo55FrLx<q^c?xBZFj*!f`6nDGL3s6BvU54GYKTP`
z854e3`$%V`^Vx=DOU9p}fB7+t^Ptj}+LBjww4e!ksdv*x5V+Kh;q}6s*1wrDx!??2
zYMyc`%&03y54Y?Jr}|A_DVM~VAq=A+f)ZS!N&g)$Rx+#ky3apaNTpD5d4v;Vy#FeM
z+<O*DDxt(yWQhU*JGl_3p9GB>6lA>|NOGNTboS`_^-i%8d`GeLIGM;u%rA2Tet9qG
z9ldP!=up<^5J0*t<J@0ae}o9gE>Y~$cG_?YEMECSx6Jjak(LIp(!Vwp)c2~XQ&`qT
zFYDs7JZw;pxFOMD**6P^0Q{q;_!7ZIlpv+vJu7(^i-8VN9!cQC1}F~PUdF=%?pHq#
znCfd;E}~$>dSSTh;GSauGNM<0$O78N)Wtx^WAOF*pW@y3kA{+md1_r4-!1ATT%S^!
zTmeQbxCq6rQc5oy0E}Ln0Ra=^@&<E^Id9e)b*3rc;<Cuw=H#Yg>8oRm2C)3~oKf=%
ztQjbu&CbwmeoUGMEUFv1B$qM!F%7`dr;q3h+kgRlG}k42vGihY;{`zjxrYWGuyW&`
zDShpSi})`H-1}ha5m8HyR(`?=$m$#kN!|#E0T~_*0@2JP?3<0)gp(AQ@-f&dkgG!W
zSL>XD6UH3pG`q{mQw+aC$&1BkVEB`h3q8MUIDStSFbCPiIuRm3R{KfR(KW=@sR~Ad
zW4fkVZRD&DlhrxqT>EcjN$HTw`z5Afb}VM1-n0Ee&k7kA2TI%7ti$b1c)`G^j7?8K
z_Hn@{;nc^bXbm5O+*j7<c%QQ^rChbCvj3X&pEQG&{p+pZJ;>1fUmfl0PuFLS?Ux{A
zC}<s-NCE#xWh<N8S(<)NwgmQC3Zs-f{PhZEYECd5ZbRZu31rYOI3*>7^~SPfJAS$F
zh&>s+c#@lJJ)c10D#3Edx5j9{O63nhcXa}DT4s?iNkU2EzPJSJ!6CKGjr;^_Q>@8t
zq|Cy%&%o$(MHNF>{5jwIB>`<qdN2TN&xOPVH(I^|psx4Y`9^LFzeM-gV)v$Xh$nu!
zkFhqvcweR>aV?E<KS+2)+;<s!9+QpsE5_gbnlKi{6Oh_$lM4Ju?dKNpYSUf#$W{E=
zABu@X{w%*3InJkY>Wse?K0(nz0Fpv+gvlR}ixItc6o64fZ05eOv}`ZE$K41Nnf6NC
zaj(K5$)N?#;^ST)Fd+7!r-ktK&LaZVYK1NfC~Wng_pZ2li{e=C8s2Xv-FLY9C@$Jz
z^^U70N55MTo!u3Ai#=5NZF(!OFG2`U=-ywU-ul7*=5O%&%P=nJ70Lv~lhJ*OtH7Qc
zXfmy04?9%r;s5Tv5($bA-&c@rR~ADe^Ari}2b2YTWvBf9<GX&|u6xQZ9eDq<Ai7|D
zb^7-9OC$2nx~iP43QSA02y#mk>-&bCXr)|2Y{6J8$VK?5+dBL3L~BCtbjFtZ!NA-m
zONvu><>e}8z*w5l$W?k@DV~s<d2_}td$<A9&FX5G;-mu)5c3%|1TIXFm@6qE*ezY2
z@0xF_l&{aDi71-nUHLRlEd&J!uG+AHS9%k#6Wo6j{DWn)2fh+rnP)3%*&=O;ja~J6
z<+_8?qdCdiJv}ljiqSUt&u^w=vyTH%evoy$cV{joe<n<B$>``v?%TB*OPm2&zU#zU
z@0n{{az_=dZ~3V|45kr)>Kit`afHH|*lUYiHt{jJ(eG`i%f!`+Z*70nVj%;8f@~Aw
z83lW;2O%{5#WX>MhWsV=ZXZg?D`xnB^#@GA+hU#0v`yXRd-eP1iukaKb=ICiB~Mac
z_xWRXE$!cHihS#V2Acymt-|r?IovY??3*qlYmGwC9GSo;)SEv6xMEs>Y?>wi&K^g6
zC88dMbw(8R2rKz(6bvw|lfaH-hI7&tz9kxhyU%g)l<_!9;iMZQ{Y=t|0Zd*=7agXL
zHGh^I^0%DW%zx><c3$3dA@liLymV5Tho_QlVg*KS{Rqs^dUmzWZ-h+fe-!M`rtl1T
z$rKsix`Uk(P#v%I-=*%GVH$hMXuHF9$$ugIvp1HAsGKDakuao+${XByDNmw=a9{}N
zCr~h046s+>V|9OJE7ws$6YQlvAuqR02V}4_{+iDyUd4<J`FywkNrD>0%amA7TEoAx
z&?a*waJEpvLjBExsIV~OTZKHykCu58yN-v8c!Y$OdU~r{TiAGbH^+Lg3>c5N$7OPc
z!LO|7i_1mL><&lqkCQ+`C~78X&sM8#g2GGU;P6S%qqEZ9V4X!mPRBMc_ur0(S>dPs
z;57sXfx7w`vl~7i(?akVpAGQhsKeO68M1U%=Qy-H9~%i5zBOr1y}+m5Sjw=P^-qG_
zvYT5)><W3|G1da6CoPD=%~)o&jc9(<Uo?9%FD?um`?)JDlRgjO%>2zts~|Zn7R%WR
z$Afv8c96M+<a)GuK7{TWfiNi;i>9Qs6gi?qy~h0h`sBxtADC3ql2TG2h}vuQxLaFa
z-vgNeM^I^1A6^lRQ4_jx=U{m4A7b-e*&Pl5OEVa6fuabY9h4nu-ZgfG1G>{rFyCMa
z_tgF5AW1UFUfhGXw6D@44K7%Rw9XvQUW=t~0_~MW54A_Pb;(YFZe^fy$LJ5k)x8vk
zO<O8G4Lj>aaJXn=>B?17!HgcDTW`~bGgtOnSOaN6*kYpmCD2QT3%u=xe}M?1>)uws
zQ%Mqi_0(f`lY%39>a&Sp^2eBNckL}ASgGDIR(ajIaRlJ{F<Ox=ZcIMBCW4jb2QK2m
zp<>GWefI3$vm3$GV`P^Cvb*Ztry|TgOk070hxv0a7=8~MnANOQh~=A{C~9eWr^}CD
zP&z?6jEW-iiM%42(V(Zi?J+4KVFwCD0>pF2hlk5Rv?Ll%2oik2@d)3OufM;)pC1wL
z;3cHJi7Sr$WAs^blXRT?ztu{??FR?4!M}fPZEbhwYxZib7S2V%ola)4s5P6&`{T20
z-L}26Q=mxA^!anYVRdW{`kF>IIO(B#Fkb^QZxi`44BX>6Vwkbwx#`HzzlOgD2PL_<
zntnGH#OQoHR49Dw!w)*o4@K%JaGCRYQpv_c5YL{$)o;$++Ir77z5yA^Sn<tzTN3*^
z6-uzt3C@%_fNX^8?fLHM<_4D=8WAV6QGZNM4n?dui_7UogWY!A*)cC`3dTDyl}_y1
zgW&J-{2T=hjf(Y~qvLDT=bz2*4PFlyGa%jH@8U~B0QNG#xs_C24^CcQ&&~c=VZPV2
z{maW<-N9JEx2MMkdaXu~!r$Kb8%;*GAu8C4!%-(M*+bn;ie4mL-zv%ny#e#*Z?+Y-
zgq}Fow00XIPr_#6yGCcl2U_js+2LVput-iC$ZBqGo-WrZmoIF6dc6CNtJ?5KFffwL
z|KsY|r~5d|WDC>7U-8a3Ypl8pFT!SaDBPSjKkCHA7-;D@m>|+&UGZc#wrV;=A4eJj
zp9tL1fxx{rP}k^|o5Oa2(f<oVGn9QfA+I<3L2TnSG{bf|F*rIh^4syspGt#Xaf)u`
z&xS@uT5X;@3=AU~9t*Wrr6nb6Yis?sp(I2gFn2-3SBN)2<|@_0^<Pe?Pzy>cn9x}x
zHW5yJ%wk!&lg4pq5ehvIvAChrH}z0@a{ac{nwJZ-UvLfm`rP44TS%W=Y7<ng_Jk1;
z0#*pwQiw>q61tDZ9il>-ZfG8U(T8|cO9swOx_S@bpYb?LoupV-njkX=2fU4+{`v&9
zaUL6ay?2!g1NeBDyprk_gX<c<bi?$s#=hdEL|T%RUcR5OD`^Q;(7QXx3Pc7|XjkiP
zI+EOni*$bU-?7+AauRX07znRG>WPir^8z~cUMdNl@3kRr&*EaUrihC4Hvta^a`ThK
z`xh5a#UQ(akc=kJcZ&lsm%j;9sL~E$W;iS&PMdCaHJoMq_TifgkWpVhT%S#<oABAQ
zvnhgv?3@f@A>g5|o>W|HVQ9E<d*Sb8my?@2RitFm7fA*;7E7Z7c6Z#)cPed`ThT}k
z-q$$%4eOso*N!_8XjaQ>)GPdXY+Uvwr@r1V*WeL?HyIw!_S?RTI#AXK9S<)tCB+>i
zh_c{S$}|gQKjcY~yBF-QtbqT)16vZfxa^Mmst<o~7_{9VZ?*|vZ-+3neuxl=$9Xn$
z*$aVWjN9w$#U`in9R~MA$t{p`Mo0g4{^91bY=3_rWI=j*dqM7_S*chV{J^`bqmjYE
z6h1FcHLMQt&*WVr&-VWoY;Ej<jGFM3B9pF>k;CKtjUO@&7&5>IOJldqvRbGGZ(m|O
zA<+I@<YWf_7O~J6Rw3*rv&0F1_RD|gx~3v4SX|6t1p9Eoqy|ANC%%B2KP3Yz@)nr3
zKg`{8e?a`|&;ph{v`a&9R-jIO2tFCDlRBgb3#@(<3FWS`N!{q4OwdbzR2)bj6o(Ww
zg_xnf0^Q5z=#<PEW@PfD#_Z!WYQTaHvvfFeVdWQ~>ESRF!2{LX9bk{>bWaqQA$SI}
zhOp;quc*;O^^rl3CzN-}m~Uj6H*r>L+=RoxIKIt{lo2$*?yviyDvLNN%>zh4BngY=
zNm$Vj@l!l9?2e*d_iGV<hR^H?AdCS(V_Ca%Wc_-90VG^#wO1BP>>~ii9@sBr3cQ9Y
zi(mm4uS<selTUj!U(=!FK%drv=#wBWd(0mGb)LZ=o8#t-mU9M*rTFibOCj2o$10`l
z_iR1mL90O_c{j=LAUOl<tlgaW`)=<La0hI`A-`}xCXk-S==aI^>zro707M?{7^b}N
z2D9%Rq!yg^5c;RhH8w84KFybZQ?8VluKbpmiVs&(s;MlVgjhNh*B|3mm@J6A^02cV
z#jl20Azw2;4QYL$Z`ta+GOtP(bBcC)Vgz~PA+e|f0tv#1>j`q`-CgX7Z(?!I6Qh-N
z@MX8rW(`(PA$U(PY5$9F;iABnD=@lARlL@=K7Clws8G`Mf%`RJ@A7wE1qbD_fTr<f
z6g{69$nDU<)<_a-?DvX|8au68Sk2=(blCJ5uo?~6Uv9d0iw%ORxBr5M|F8KxPZPR5
z(;-E;-}C+xWS@=g=l=me{~0md;X#=1u4G$jbib+WZATN=w;@Go>iG5Ds-?^0b%lcs
zZ--?ct1D-q#ZeD0;0uY;?4{d&!U*`WhaeZ*b-LpA*P92(h|U|(=cQsrzvAsX7Mfpt
zdlU6RAEW|5YSww4z9g$IKGWzbpciVs%2-C7VUj-cZlq5miOFeH42VPOEc+17oSpj%
zrV<K&XUa8DQR0Q;Cv@`A0q{HA1%g#G-IOtp3RO1&_iCa>c3MFv#RD(OI1dv`ISG!$
z0gta$o-M7#-sI^$-OEr0y724hs96|qdpDbPMUbJ-7x{9t?5lJGknYzj+qzRQ3dVL_
zapr$-U1O6hIsscUO20l(^sjtfEvKq#MP@F1!XO9GYY2^JPlm$PK)b}ZSJVuoZ>$R4
z>R!?(VkntuTbXY<<5|E<yOg3vAw*i#XQQH_FQaj%v&7Ezl;4k<OPWE0Av45(CLO?`
z&F4IB0``5tiOv6%x28_z?m{T5xX-Ebzm0Q(yyib8@cj3u&`9RHPB1=f1{++h2c-MX
ze2QxMLF&w<0p$y}Sif2A<S%e-ckoq;sJJ2Zw_uO;>V>^P=|s>F!jf2~Ex=(V8T=Mp
z?(S6wdjXJ|GcJDPwvoRK|CJVkI^MB)3I6^;LyM1P?V7a=gsujGErf?bQmlZd9#u|8
z?#f3AD`_O4@3LjdUFdCVoWZJQBnb1+@U3~@{X@0F01j)`AWfs|yZp{SYEp^V#*}dP
zB#Bo=r&L&i@71%a=STA<YVUYFNwt*iV0uDuM-~V6FcjV`c19Uj2&FS2Vip#d-``G(
zu@HXx0kpfXya}(t1Wc>sL1Nauf%Cu$kM+qiig$`_v=HlN0hu+CiJ;;wIL1^1$r%yI
z9$aRTc*@Ng`3|h8PEC6iDh!;lq0$mY6x@-3g=PsVFiwY&W!?7owe)!Y&%AZ^@FAop
zSO@b4OQ)-jlVbvz6;8MpfWcwbL>~-)Yn_F_1|K3&|5^Z+h~;~CP~Fox2xbBAb#xRU
zL+*pLa7);I9`*xTR%1)`PW(OG1d<L&JAW8{4R=1AS6sM2;Xx7N;!A{7`F!F<xc}$G
zsr{Sp`N%2$Jm-Y}&x1}9m-G2&^!5Lp_KjV8P&?Niyro~6onm>8o!*arHx)xDI*PRF
z6Xh8O>3-upRfBxX0+L}|TMu(OZOcDDIU}?^Qr)I%LL4<0@>i-`ux<AjQF_nbvqa4I
zk4II0cfFdx7SZH#lB-Kc;oK@c%Jm}KZH+P5v;LIUyhD78vsO01!P-53U#f+ybN0}4
z%FRcY)PGq^cT34<O7#u7thf;!Mx-9{1c;&lNl)r{`6S_c=X}6u&M-^(HJv`hGc&4~
z{(>e6<b7#wb6NMIxE<|R<FUz|a3m&3wvSRXy{tGqi~so9Q@b1{VRR|x|FWpk*<p*X
z#I>p)N@jf!TOIxkMpf*+g17-Rk3un-SAf4Bg^zx)!=NPXqMFF(W7CtJsQaDk4u)<I
znP#4R5$*a?6d;h(=A&cx8rJ{<m$h3m*0P$&Z0j{!Rus)J3T1vb=+CtaYP8)RCe)OR
zYH-g?FmB2om~R&?ZD+1Y!N%}^AGLO_LU|6AnX)Ru`2SSO|L>%A@!O-3tnZzlay2=q
zQHZkw7ZkVFSLYk{W@O2IB_rj#%Xi2CT{32tTnOK)f#M%DG8Dq1`sOHH#25aysrVKX
zhXt52rrLbWU%MYJ8M&ia*@QuLRj7{9qSoRbGf;r(RBTO4o~G0G1KCysk4JlA8(Lfg
zIU!)|u^pJ<WzEie<5hYNcQFpBs;7?%HhAn({4ZP##yEE84QeBdH%Q#vZ^#er>3d}a
zs-vwou&$|c!FX?7U_L+?d(6gCjUahsa-gUv+<`7tJgu&Ewuc5FwdDP&(S&IFHpzr7
z>`BV+M|P~rbjAJRcPnn@ME|FLS3&|AtF4#nqP|GrVS#atT4bc!8w{ts0nY0_*Z(1H
zZ2rwV;!3#%0{@b*|Kkw5dhT_`8<3|%l&6Np;&}yt(KzbnI1EL{@Y^S+3&7(Q09VNS
z0yxu4MkJa!&&~yFgBb=U(3+6|l=5q{nahtmxHVIx)JaLGbH<VX8nh*L_ZcFSWVRa^
zx6ZZIu9FPFQ6j}}{uy#9>QaEW!EQ=hP(_E<tR+hCM{ff)E-wp}^|yeK-dNYvChQWI
zwE`i@R|y&dy;-d8DC2)Bto!3{9vMz*|62=SKCfR7l41IWyx)RucTsORPA_4%UdC@&
zC5wd8iX2S-TOK8dyOvLKHx&hHSP(LzkR$12ONFUu-uR5#@|S?8eYX~T3Kd^heA|cz
zFf%X|THjlv2f3w8ZSuhaLj&wnrOPN>j(p_<GH`&EI-#jj5f=?aWYzW-r?J@(kWGQA
zl&mMe1^DTrNvu?84_pgX@fW6@2aU2M;^{#VN!?>jU7eGlpkU(pufK+%Pzyh-XT@1k
zQqtM^Ismod%^%o{0{l13M48Qv;e<C4YtwsWF784uR<M;nDzumlc0cl=cYOEs48e^{
zHL5Q=WBz*vF=_5@VskESFwlV>axddSn?g+gLp#yc;5KL^KX7|(3+bElenae?7jxPB
zQ27C>02)=3V}dQUIY;Q;ctX_dmKClfvFcUs_)CQ#jDfcI)YTq$m%R}rFaIGZTF~QW
z_dpc{C@uRE@cQE9<fCgdSpO3f6O-`nOGjvUU5h~m80)H@DYtiuan~?Ug=>2%`?#|f
zWI!OV8s(E4Egcpd+K>LaLSk1@l+I>1GTO?SBo+&i2;$Vp$d!WwEk^_QVvrnmw|JZR
zTX7ZCzko_Rph8ig{Y_wSz2iZWDlL8VUy>+6`undYo(#@2AHc6<_ziL)Z03`J1Dnd{
z{Jix4eER|dGyc#}G8-0>aGmuMAt50xEv<U3C5O`?*nM6MCRWG$=ldH1SN{0G%NL&C
zUhF9=D}#zCzV91fBZzsFOH{`)1bk>z$`sFc`rm*AD7s)Ef2lHf7t`zG)o3c5k{@Ou
z7y{w)%NH+rAI>MhB_t;&d#zB$1dCUOqyJM+Al%>ITQAnjslr}>H{BXazS<ef=6fV9
zIW5ToWjNUWdZ5e=A+zWpT80<K8-(uQ^7}y<j5=kIU=~Vv--zg*&NFh;T$FF^{KzBF
z{>kVbPMlfO!NCX2qVwA-F#NVI4r7XwMzFnk#Gpz@p}O#-|60j^DLHi8<#L=Y<A8|#
z&_O-5Uc<ovj}fbOsnEkg&cTV1anog3iSL@^;BIX?F<&f6RKg`pVQMC|z~f(LOhWCL
zKvDs0<w?xNk0+xoYt*ktz*NDs*_N1N9rB+aegrAf#RnW9lIU9S>^4(?`miC`V7FvQ
zOfF5sG9|cU<~wal&{Msp27~9Z=5u*pK(fy=i~GZ3eaPmL#o+J-SXaOYW0HsDfmxjW
z^`Fp08UXhwvAwcv#O9vI;LyBT00nq%9h)=50|x_DMXydrP<s0{l071Dl{i392mhK7
z0TJ=!{G2&3B_#zQ<=|*|*K;Aa^3&DuyD!l+{=FwNDb!WWlRYpOhHoblDqr`TSOunR
z*=*=w+@|Y-Y*Q9QM!;7m8PdGlr2J+Vep}nBf1KcGMk)D`-Rny7`xV&&K<b6*GQb(f
z7c}bju^9G3zHoAW-gPj6aUc#)+2g^HsWSjgr|$5J(>-FVH017hJ;=g+_Ma9<5w7P7
z#?<DgIJm51_M1Ptad2zA@P<uI6Y^ps-2mwlTgxQ55LN-o|0?dQqpFJ9J`YMa5=xge
zh@^CvAl+TkB_JS;bax2S-F@lq?vM`Y?v6S5ely?9toeV|k|pcHg?-p(Kk<v_IK`VS
z)EqX0!h_{z3kwU)i<>|Uau7BlCM4wjzB7hKU?re6ipJA<AB?ta;)V{Ep83J@+Ngi)
zJ=-U|nh{?CQrOVIZp*G3Oi@~2U!O{eMzd-Hs7zSf98B<mMHv_vm>?eC{a&P6rqk--
z4(b`;Q1C7={MDIGz$T=S$YGrkjOj|<TFow(%gxvK50#*vfKH|O7uW%pmDzwN2LvHU
zQ@EW@*G2jHTfy_Bns;dYuNDflT&%Nw`$5ZeJhK~=BFq-6gSsn^htpp0%(yiziPJ&<
zJ2d$QtXz{I`SYV{81=8u|Cwh%j(*y3=Ga8KaIJa#F2FxT!>z|=>~lhzI_tm!yYzF1
z!3L~9<14^QrBD#0BLj~YZl&+Eh(9}hnQXPUCW2rC?@~b^eh$WL&3@<w%N7S|RS%W1
z>tPL65Ek;M0t2&5@Kd1W%0j?eP~!(U>k7E&egi&6HwM#(ddgc?;M>0AD`0avuKJns
zp$AiGHbHUnMM><Dl@mxfyWIJs{k{<$HcUZFLlG<;?q!vhZkn+OIcNChi?216<i^Ge
zTiEaUUG|EGTLz=|ba(8YI!7~T8Nk+FS@}OX_(e<)b8DgeaGmt!jFGS9_`CHI6n)Va
zXFN(B%2v?_5fGKu<WqW-YS#7oFLKKHU)NvY?h~z)us5by19|w@_xEYG0bZbLqNYFm
zqbXLNN=&9_7FKu5SSl~r*~4@{-_Z<!yzhLni75D~;}%o}kls?O==>=AlE4y~oT3iR
zObBeP+-{&&y!v!JBAZ;js1KllzKHK6x%rDXJ*XeH>6TF_Ea85Fy{9nGsM#Le)UY}&
z=hgH@^iyv(H`lnrl^r|)mVSlShl*Ou5`4~So9XgnGbF*Co`&=(*`9IN!x;I@|0a{5
zTv^FL2~2Iqo~k5v<N21x_lD=@)GgrBe)`u2CszM2QW#s9;cfil&fm^W%>U=eoMudY
z`<l^eTz{I{C~zFjTnDJ9BC3Mow>{j)BN$RYRo5Rl33h)<u5}Pwvq<&f22PqZp@30H
zlwcthV$ds~w8|5#fdIK1IXmkx7q?M%t%RNzL#`u@We?<f)wz0e##%^AXSni<H2Oyz
zfI|if<So+(M{QW~INX4j9>nWmXCcokxPcH<{|7?}B&2~1)8B3)_mT5NWCFh0kvt%M
zP*x#z*U(Kq+~~DV8|r31Y>#|9pr$&UfcMWkkv$|!x91XM6avWa7;|o-^2*<6O#8tk
zeLp*bHugc=vO&#DiKk%DuXt$73jPz+6~c^6zGtsh6VfyfmYUTcjtd@$&pJ;;mPYr_
zVo*HZUHDo#F&jIu%GMMeeW1)v(}Dq{C)gdl*T_quN$=lPHGnJf%yf6qaQ8H;sNVDt
zQ>a}<3RAMJ^b@?JjHdewi{5KFK-)je{37&ur4yre$#$0e{@9!RbXL+vPWB%w5|zZx
zQ_wP<8ehqus`JM&Z=KcM1lNTD8t8A!ny}I~Etp&N+4FtZy*XX2^!xlvO<EIsMOSeC
zur$pboSgi63sto`8g{Q3h9U@Y4X|KB)HmLIuzXv>fh`&;N3qso=*FqbRPl`X4;P`e
zIq)kN`H!WpI`)`5h2t;H1sI|i4Iz{iGPtd&$^MLn^yZ&yFOBNCghXG&j_z1)X`c&y
zjp$K)31?};V@&km<MLi^s+X{a{~w{OJVi!S2$*1j{}c(B|IH}BG!tw8GBmA!u3a&C
zmyp`!3Bg|eWOQIu{xr~iOPI-?2IWP&*7THqw`mBJ6P!~4J7>&DsFW+O0Obx&hj~K~
zf%p&SLI#W(=M=`+fH%rPZU+mPEpI5@OF!3>@)K)cG=S%2PuH|6%`8=0QA<nprMWnF
zcYT}9IU2i-gRL#haQ79vx8Xmzo3Rv>D$-va`t~wwReX3Z*fL7qo3Vjiq5n_jdu+uP
zf{%kwkR?&<LTe}i&1kxLd_{x+sBSSos?N<#wM~MXf@}AL*ZHe-=|HvTu+%cc^Yk;`
zj@})@=@f*~x`s7fqH9J7wq;|Ec2GdSm)fr5+0`p=uL{_EC~Q!NgalM8O+5d)YuDLi
z>o`1cdk$)HaR;>tQL+oWj6Fl5HE9oJ<d(IV09IZfJ`#Lq>6jy)_osy}>hN1k#nf$r
za7CNVL;-_f$#&=AMY|S*0qPFn60j1ySgyO2F(;D$<XNER9e*G9e3hQ_PcM+)*cjJ9
z@XG7!s=PzThfN5iTIuu}TDnL0%)ym7_K@^=vIlayReP)4lGc=n+S<+m3O>|7f05sO
z*-McgiwimTstea-#0A}te@-ja1{zM^wT_#H3j<bCEC4#|la}-2s6qrv23T$VLwaNe
zTNt<La%Jv%Zb&|)fn?18J-ACt{6(f@u$sG&Z-)WN<l|c?UKurh^vKQGlGhx*dmJf|
zkN71?_QH>4USePKQ6q-r=5#ntfw5}<ahXk{TTNO60YF~)rkhy|cC~E=C$(B|ss`D;
zMd}H<trTU}!llyfKKfPhs4S+8*4%-rd8EBPOeX5Frx5}9({lgFeHxQ#fxm0E7E>`7
zYVbh41p-pMpJ3JxJ`4~%4O~h3FXfz|&c=s>I%(VFZ=#?iWN4#7jMe}jQ_-U;EA)@F
z^UOlIYRr8b(`&%N&B{O=SiQ@&IGP6`RKs5pXV2X2&$Ujew(`W9#QcL-IZjxD0!eC7
z24&O{WL-($4k@$(<qZXc#?{E=4L{SjFKdQYbO%xdS0tp1VIfIlp~o%jCoK7Gce_L#
zj35UF$DTi)7_e*)J(&0%*yJVKyYSLB?+8_y@7B@}x@!68i#|F@jfQ5a*NcS@9B^cQ
zK2wK2tVIAGt`s-q^+ho6R{~BGfT4yip=0WKVg%5-+ali;(|U;D(iNL?q|Bo(<Y7>I
za~7RvWXm#$NQ7Qerb`pD`KizLE)2H{o6h_;XqS{UDU8||e&X9I=a6z2W=FPCpc`3E
z9*>#IX*ylC7DHPo<ZYeIOyx;rDv@lpBwq+M-4B^6X8%n*E(8}V8qS#*Q*0M-j#Ls^
zup3$2DC*1?3>aQ({i9zRul>*k(V4YEL<dwu%okIRJw!ZyCkr71BFhQcCjEP_0J4>;
ziErk2@5Un)Ck**m>Bt2``&?PXd!vo9ua-LC*TnHYQic>!lRYl?Yn{XylOvLPlfa+Z
z=93ErCK#bZ3r328s!s5wiTrjBA!tGLjlXjKw!ZK$-!v{rD#AxEbbX3kwDX)_aRsCs
zt=^=X_>jP7LRp8+@V{H@alzc8Rd^#w{DcAoCwz{RhMk;+5>VIw0J=W;=-q!Pp6=<Q
z5}=BEZm|P$#;poGu5xy30!Br3+opo|piC$JTrvtv+s-U)J`3`wYJtnjFzBA)<{|51
zr7GHZaP<LLP5Kk!?nyr=%fNSMw5c<}PgS5J@h}>X&6ALtq&BA!j}HfEz>atmEtqY7
zh0zXw4OC#2#LLiGFZ?~*-{|mI%tacok4V5?A=kiwHsjH|5qb3KTnlXGQ?{TFzd6kM
z0$X78!@3|;iNo!h<!s?Gh*GfDFh@0DjEk9e_IyElGs#tQG@Mj}B2AQfJtA&dyUc7I
zj}!6UI-Mc`<8r0M%^@USON?jZ4MS||ii>}|8Pyz&otVIy*Fxpwkq9OL-;^meT1%Sr
zgJH`SxpDI8vaSY+<Bk_g{z8N^^|PGH`&Q}U10Qszq{f{1v|r7!=oP_2fg~s>E&Io3
zjXpt?sppn}TvzdX4be0$y5<LGb!+5tS|S&DjOQXAmzdnot6YiOAANJ3kt?8$?QrE=
z-3KltZh7tU6Z?++FGNf-5dh!E(!P->%*_*mZR&N8bO#Z0OrKR=$V1m6aj!XhCOR3o
z)x-f@WWGPtVFl5l&8E`-y%dJm#1>2f@9jqLF`Wo}U67BD+PAM)<UqKEw@m1d$?y1|
z!X?tMf{{H4i2CG0jf|vwT7GNAX%{{?l6M6GRE1;sjcwm%RGNcU&gm@!Q5&*UcVw67
zjs#KJUIR;Q!kHg1Sr?>aq@jRA`8?kvT~iGsPng)vo{#{oOcW#lJc|BtD-=KVH@S2T
z)xfQL4{jZACy6Oe0OOeDD1v6;(lKU~xN7*Su8NVdn9QI3=uHCDfY~ld*S>e96>}CA
zDlSKN6z0Oaa12VE8}z?3Z?{Qz&x!Tn7=b?ZOWk$k%e*6oL1*>y2sv0h;QMPdY)jI?
zlCejm)JZDQ`+f&q(Z{QPvYxRgtvR+{=TZ}Fr-E){+;4<uai=b9J2&!UU=5;jvf7L`
z$o5@ft7|4bE4?!z=h^bd@p%E0hD*u78L`KKI?1yT)oO%>hrwEnEGxb|JVy3YyM37A
zA_bL!k%<Jx(+YnjKR3E`rfexq8d0=(8L39MFk?Kyp(ty`-%W}qlMuA%RzC^8kVsLt
zf}wEo(YzJD-THBnnDT2u4P#ur7IB7V6+j?H`06dC^}f`mEL8$_^K%*Av5d2`GYI2=
z1V0%$`T5xyXmYu~*u^9uSOiTRVr9|MZ?v_wa})|@Jl4Aqbai!scl;g?M@x-C?s?L`
zYe3(Xd3YxPMxID6xYp^f42o!T-KQc&rekKir%=@`>ltel;{C*K$edVUP-C{D<HZ*t
zib=I7LFBw>pyZbQjJIv8=3&86V(9+0CluFWrg(gI_IR!;FC;|j`}gl6BECWypuWBL
zPlfM|EjDNlB;<A^_+*`2Rb{_<1-5bv3k$E?K$A;WR@Sr&uji8+XlFqJJH2XCdA44C
zFYtiCdpFS~FzOzGKeMQ4Kh5*W%-p=tJQTD{oSzSljD&}TR6!sVj*FE>QgU)~pn)JJ
zM)8vP6SxvKi<$S7lp30vt%Dr2dx7ZdMz~-MbQuEWF2IY50vog{rKYAL;n2%bW9`pG
zu|Qt6fwsYJ1KYTent_e&ZJVWr%Sl=O61n!IFvZz6FPE3Mf3dVIR--?fS9T}<(dGpO
zoPbs~jo$qHd{Dt*SHHN&ZviR*Zf|cv*y@-=2F8dY8t=m8cr_S|?b$>z(a{D52AMfI
zPx_@ABrR^Y(SM{0l$KjPbtz*|2sp+-4Tq{~EeP7#Z;vogQ>XJvd`Ku$ugV3j4M#^u
z$ILQ>(0=H*UOVm;afc+h59FP+XUjuuUty-sHD!#{xd{yU2?g;0=EN`bI2JYgJ3D}Y
znHf!mDrheNWhP2Wu`MkgYHELWC-cD8yxQaO4(#EVTHJsC**sb6q@kfPA8f}9RfKCF
zWQITa&5BuV%fRL8y`_g$DT(7ywR51KIlWr+F<gN9e%tL-xAhI-pD4c$nKXL_?U0Bs
z8NAwHvMm`S1OnZj<Ncko)nRxIBpJCUix+1SV$u3Oy}`(CX<PdSLMR3X@XGITbK%g4
zLO~PfdRNe7u5^*9+ucP0h-yVe$%6}(6sMzRWV}8(=^Gu52ns4_x^r8wor(+%&VS-|
zXT&<Da{HBz&Q9<h4i)&IdN-;KMDoijS0#B|r_j#mL?zNhgv2a2(|JBMRr-XF>dE&W
z0qH{nkyKq+sdw5|&{oH5WTUAA#oupZdPU@?e&6uU_9f>At`iwTA2ywP<Qk_%AtM>~
zWwbdkGbn_unCCvM$ySHEMNFP)PT@cETyF<244bMjgcuo>wPdKzna*J)@D^ci6H9dF
z8VgAng1Ra2iZtu(HjCA(Xlr$wepEOeFXOXY{sJwZjiFioKW?V?Mh~0i?CO4lSz6z{
z!*m`iHK;=4=pDA1?x>>0_+yvq>IML))2U*LPhOt?<>oSemRL@nI>jw6@WVEBMayGA
zhZ3+^zrN*e$x)AT^0jD&2V(m}rskbd?IHBypv-P0&j@CZ>2F7B0LT0=Sf8-LZG7X%
zY=0}o2>XVm4-7P5UGjmKH<bgoKaiyxuCM)mK1+ti;5l-MQmNX+3F}|RlOhrw5vC*h
zp0mMGf58KsXc^NGm5?PtHxtF_e9v&$n5S3byAL-uYJ)s$CJHRY<il_fglA<LS{C0O
zmo_zNNlEQn`F&((pP8F;{!^|WfcCua`3(ej@IP6<r=pU2KYiySjxUaa1y&<_1eqT9
z191v-x==}!{$O!b3+2U{JSMgC<fnpJ8;!Z)>t@LrEB-;*IHn48Ha(Grz5C3H0Jj*Q
z;z*SQcpW<{5OGGDPE437s^k;#>s&`kyoZH_Wz=bsvtXpA9-ExpAIs<j(WR*`b8~Yq
zR_57KZ9;;n(be<w^UKRiULGDWe$wF?8W@1k?d@Uh3aH*{8RSTs!XWJe&x3c9po=xD
zJPcI&O>IlHLk264S3Wo(v9bAcj`y4AEMF$H3pn63&$k(FH_>+BK<)ITwNEzmUB3-W
zn5jZRdiuUcrZTv|V-H``!U!<%fFL{wEhgcPOiWAw>FO*UBdrqe5s{G}Znx9eqzg9<
zf3sWBetNo?lzsJ64>U4@u_OiNB}~t!->k|d6>N;@74Ci`PWnvL9DiCjVUd+jXoF_>
zz1XR)v5^idxXNU-5TaZ64GPfGf^Tep6O;``l-9>9O-IL?Br_131I9peRB-&o#RaeH
z6?hB>Iy%<1dq@>@Xp1+A*IDJ@F~BWh0;Pb!M~A&BU*Aunz0uLpLc+qF1mOdS0J(Vh
z!OY=ssh+8+sfNZp2sPW=+bc6{Zf^bt)i4!?;(0PDVi6uOM{b?|D9nkLTSJLmd8(et
z4alh&U>P!HgF~-|j)zxRR(1@&XJ_XJ2yTO64;vesLAQnH{f5JzXfQ=sT3T+RJ)q#T
ze@Wq*UR-orZTkuCDTpsNJD(fx&y++Ea;ro!mSksl&Ckyd4<8OCvQ+1(nh@Y+%33#{
zH+phsd;TzGUk?UD=DRPty)3oH96PYqCJ`jxiAT$WVN*)mi)mNqqJ{A>vOOw(oUVg^
zBT(P8KM%1eQYislc?V!R5D^jaLws|4HppnRST_!8;1u&@KueS;3A!8T&aJgsDJ|A<
zy*lV08d5^aENka*Ake}fQ`Wm%avCTuwshIk`CC6Ycy>-Z@LZVj=}5D*UU>x3E{YHs
z!-Ysjx#_wXp$!W%e-}O-XEak0OW^^~FE|ujZiNZqZ3&+gdK6{L(V+|8=s({>9z^DF
zg~G(JI{eWBI+=7iH4~$>@7{ABm)`~5;ioBwVBxAe-$(Q*PWhZdwNZ2YGBL>P8_Mn`
z#FI%JWMdlEV)bE1>5Lpk=A8Q7#P7*_>F6_Z^VhEtcD&e<;j3=$+wTz!%|a!Fo%T}7
zixt@#3)ys;!=^K|Yh1~yJ+9Mr+}^B!9DG!*n5U@?YDDsSvz89!?y{iN4J8<GQ(=G!
z@gU~_aH>r}Ck-RxEb$S8<(#*PvDR87QG>h{bquHO>6b8UT=g6#gxl6Mg{r-~+n~np
z`qY{InbQ-kWmu_{i*W&k8*(O7g&mI@JXjs!P{CAh;}Q`>_QloTwq&6*i?^f)9!Xc7
zEscKbsxca^rAsZnL6;Se{MR={M);J^qRw>(nTL6!>Yfq6CSdb0y4q&3?&;1=bo;Pd
z?5fim$n;rT%@9bNJe)?K=&d_prJVL|M#%O(E$5o8C;dTcfJu0e8JX>duimcxtr71Q
z{|g$faDaEv>p1a!gr$y8cwgg7K_c-e%)I{X^ygaAA-Kqgc#keZ%l<JGK!9fl8*LdL
zVCBTRwa)6^Ww`=;n^F5ecu1!5Vor6;!@Zo|9>1#{AJO{<wuSB%3#pENGlO>;eKwzz
zJt86}vn78p7}KOio=1^ELetTljh@%2A49%Ty;NuD(6<~fk?3FFmM!li6zC@KWs7nA
zmS5N3XN}&RP!PKzOZ_c5M4b4m({^nh4hJ-#U+aEw)Pz&aVE`?N2MhMBA-NXDNy8~^
z-#(^t_OFYZW7iIiIk)}Alg`Vn?Neu)G(B?B!8E^0^mZpjW}u(nE@OG(Fm$o}s#+xB
zn{QO&0XZvKbt*m#0pJx{sS}XQZv!|`c*rfW;D7(_kDf4_F~)CMhrjj1c-|nW6Zrm7
z7psru6K%sc?(16kOrK>v;?LLN>J~NVFZU<wcccE{B0sABOp4uWnw1d>8y00b2k|oM
zKjO-hv<joh&mr>d0vnj0i<OIn#_siZ{Zv@@xjT+=7+VW<x({_xi2^oj;jdXRvfJB^
zpQ_{2s9Oz+<^qNOpqn;y5d+n}P0{!LKqO>4xS?}Bihwl2L?0dqR^_A^|2%j9!7P08
zYd>_VU(~vC%|$y)CUqrtl#P)Y4{!O+z)F(-4eb|U)h%lcDp_e#jj*lKQJq4alj2v8
z1+M2FM8Z{-kn)~?zyV{H`kZ9XaWqM*%rK<yXb_y|3GYhu3Yg1Df<_>bSc39HcScIG
z@zj>`BVWfPObyd0bJ6Fi;RXU1G|rRW<tNe_vNq&dw_X8}tl?TyCH>I|Wi3mh_vht{
z98?YyXw`EX4>wCitA4C>uOHL>LLKzO^cfK?LTS}UU5RTDFC7r#`N_5~Fwp9ibbgWX
ziZ36>h2E%MdfE9^XCjgWbdINftEOjEb~Fn!)@rgI6TJ1AoUmvN>|_R|Rg+t0_hlcr
zBxL$}p8~M&t#YOtO~`ldTzA>b*Mwo4W^jYya@lqQl@MMK0|%_qiWFu#`4agBPe{Dr
zWCz3Z_`}%P@1|DzYYKUcOUh%$=4UFVf(Glc_Vuh4YL+QtXdrV06H36v5YE;GEG)1O
zuSt_c9<Rn*5X;w`WMWs!iv)YoF5L5@+KwgozTAH6d#3z~)}sslvSXB`wnG?AzFEsz
zTnHi%C|Q92y<Crlbbtu#-NLaf$*F=K(KY(KwxhFu_<lB7<_GU=ZxW#F+Sm#E=v|)K
z8;4Xio!rPrX*D_KD+yeUK6_O8F1^aL1|dQWA>=dxK0Gm&d{slGcca=Pj$?$1-Jjpj
z`hFvlbFW5LujPum7Ik*!1oQmM(!u|{Y!#?^KP9asCAVTJqmP5-cLAsW)6ySQ>Di&L
zYE`ObpZWuic>n-k{pA?}n#^fyk&p|EP8xe$)ZlH~0|W_wd7BF*xRwRW8Xr><&Q$2z
zoj&6H*|);zc;LE`7M3u>#GNwL?NN0g%V#;8XBDggZznw~7dd)Yt6EqCE}S#A=!9`G
z`w%n-#yX;r;E=s*SsEr$(`eDr$fmFhy*e=~8>M6wRx}(|YYPpeLrGA6+rhNPdj?Jl
zkXj!6A%16p$^PZ5jZifoVXaT+-+4mhN)2h1*o`)n0^MV?7FRrJR7I-C$a_uS%^uEb
zgzVu|n-=C+8&L-6(V31#V*c5ba$jQ@V2MNpkDY;c&mKzPb`PghgMzFT-xBUtSm>)1
z%!8xityRm91OyUz1;UfcFR$Al&QZ-4o=KAk&?3g(oJuO5L#=KW7Ezq4C-E7lIZa$U
zKzTKti0>}gyy>mreg_ROws6u)50P-OuJD$uYGE-c5d-v}M)WswnNSmT@bGoNJ-i<u
zura5w+!icyd0tzsO(Tmy%u<ISClA^g@{MKTUS26lh$YhuI+O7VYb(AHCPB}ZX}8ZZ
zZn_hoKKf+_Vjna3L$9^Y87VNOrE?wJxGt;D`=hWKXy@n}&ffq!Rt=BFktArs{M(3W
znVve?Rw}v|e|%B?YVHjxp6is<znAV)s!9qyF8q`Zc@VW8Kt7W!lH~j<vW_3{WmKcW
z-;_C-x%Om7=N8FM1<z;ou%7>o^<j}-mvz+|9w$vzfsuhonpVuycpQk-@liJlEdAQ7
zP5cl+*{WEY5fcyjR5Fp;X7y&&7QMuUd$vpGp<fbgXb=;Y-rL}v4;}mnU#gc*jvFPG
zusO&ZMi(@P!V=mzEZ1DomFmk<$9&Zhbcmx{r-~!QHsr&@>W6OT8|WIgF;@)*lxDyH
zv4ciNoMtfhZ(n(J4eIX9zyYyyX5DKG*k#eQPE%-FU2M#wD~~?wM$z-XqFd5}7F|uA
z1zMWT-c{D?jVeIKX=QWuW<Pa>yTqVw*btn~9HR^HY$)_sq_XYwz0?Z&RvF}M{<G|P
z@oD*WHu+!>4kYQ*Bso2MTfK`2Ldq?Liz9L(S)BMmhk)L@N=_3|^ix4t7RRkpN>x66
z(~L0|Ih^{O0jCUv)^mhg6#h&Ezmv|NLV>L2#kC$$4=d8dt~h<JViT^^0G2LE@)q9k
zT)u=<|4O}5i8iAi6R=^UnLd|etdY-qB{EJ_na%X-P#&Hi(Ln_MbcXsY<0I}ul)m)S
zG39=VF1(dmedwHiAkc;?>}&43u^&d^_C&^(d($DGiTFz33N3~e6oH)8GW4y~wCUY(
zNh==hA*}0=JBVYPm2cY+WPI8MP6b6>AF6v(Ns_X+#q3d10x6R~YCINOURuHj%+v*>
zGUAVi9d2C=q3`$@t|Cm-kVeEceV+o>(h-Hfa%7JpO%t+4uC-xA?tg3fsT%hh)9QIz
znFG0#hjLoTDhuKr9ny+*per#cwB(i2rBjVf3Ye<5I1s++*6yu6^j3<ogDLyZ=@!Ya
z=3?v8M`F|CaohnX?B6<jb-z6l2^iw_<i~{!K1q1(c8!PxB<q$@gx%KPE*FGyX3N~Q
zyUCMu3QmOK9ist>A;u@aHJAwM#I}$v;!JT_OFFU&Bi&LET<1_TN2Vmj!r-PMghKc1
zXFW8phd6vpy@medo4L-+nu#+8vFJ|{07Q2Luf5nkQJfZ+(mK~nx!%igUj8v@t<j9Z
z(Jaty!}Pa`sbjZzVuAQt#%aI<p^L0$Romd1F}avVD>m@F)Q;rm7%n%zFJs{12wO|X
z|B?TV3Nrr@*pcRH3;(v7$TpkiEnWhDCbMdk=pQ<`d_+cP1yB!1@@b<hUvMPs%$y~(
z2+>)oOUk#en2pYgVY<&hun_>2;gn7AA!KNF=1OMfPchHYqsBnnlY~G=xfQF$d9z|n
zPbB&FDq$uXRNJ?K#pI72<FSaJ)1I-OFX@Kw!UG$=MCwo-FF|=(uV#2NOdZ4Vuy9As
z#&*0`!ro3?*a_95Zgg+h7_j+HYyrq+M|H|#Y-Dvh(ByAY(Gu^z0If4NiyxeebYgP{
z0nn2V3w%wHWN=AVUF%%?R%~3i<G_xsz7Ke@)_;5!6PwvplGZL(z#w$Geyg!tzWH%G
zLQP{M^D)Y+DF%(jF%mPPIRq!E3|acObTdcij1Vjji>4?S#G9R4CauKYvS=hQ?cE#d
zBQ}Md`3T39H&1VG^M+(zJDWWn9h+ItyTf6N66C34WaF%I#ZR4K#@QMSgDpgZ%>JXc
z=**j&v?+}K`q<RU53oS7kM;$3VsMg$YR&Q)PtKMNZ&h64^ZuPkE%zI;Q{~_vWxd2*
z{Ah6mV%MBslD~wMc)XHo?&aG+Y2M=ZOk%x6KMX5}jJe6{&6C*${yIwkS$$y%=vA6J
zY>^cjFyZ)Fl73Z+HR@buHi8SSB13$IV;?qDpzj>BZ5uWW2qea#0`>a|N;pDUyQGD0
zb55TJv$K?NQW4;QzjG{-hJTTsNK7pC9tNva_a2Pn&$c%-z8@qV&o6g|j6^?Q?O|zf
zS#k7q#(oaryAs)B1#@dhhjGbqmDvWGE_VDNpY)@DVZpSBo{@agS@4=(%~y{*9u@ac
z|6mzU-8gg=Jswxs(Jp8JD={%A!T?dGg^!pGHF1Q6?L&);q9TSe<+?%2%Fu-AUIGZv
zkn=5p^=prt9SXhA=X3i{3ZCQ*nDJN#?<4wk{8&~Sp$CZ{)qKJw;y`>oEJ-EL|GiA3
z+8bGvJhtDflx8a%gpe_VwO^_$6{SWR#fZ*qA=qnjIp|=Y7LQpIzc%(`jF44sqD0Z9
z?-fKATiNxhLHZ2qk|G@(eA7K^jh^tEZBoeg7=z+%->IJjVRkq?=`x<Exp#OK(L%=N
z5fOvabtK2`BmsCft27rvn1t>|xP`b?BFO-F%f9I>+Eq==HwP+WQfi_E8O&wDoo=PJ
z*!CY2M+@IfM^bZmFk4-@4Ij@GIyy@h-VVrVuXyGl$=<u@v=gsw4I(^?;GUb{OQVhB
za!5?ZHZo1!XrAG4HHzd|uWH(mo@jfo)F3Gw3xKTopJDTMN9xf2>!zdWD^)u$5`c%u
zN&Rb%Rb$<2!^i->UZn(iv#z^CTQ0$pJ0w6>+|u$2lkT~4U75Y}PA77?fXt$vS+m(Y
z0543OX3}_+5uRVz^w}l#^Z-|EGB+P$Ql?HCa+kOMP|2*mBAa7InkAC+@bk{u8HOy4
zu*<PjS~~n^l(|Cb>dYCM?MtoovrAdFVfkqJ((xL{p3sypN_)hDd%xy6MI&IxI&Bi|
zk+E*+WYUp6{Z{0fa|kScFqvxb;aCW6r1O1Vw+%XT|E71||Fyqo$ZF`Qe?yE6H#ru^
zxvxHF0yYcA{?Vh=N;@|<@7zU48YUw9H0rrr88R-ic-V4Sw=hl{g=Vf5!-Q0trxmkj
zoq`)8pNTjO&IWW`2F^=}eol$Y!Q(SFA30p{92L$cp)0=zW*5t1-^Zzi*BqSYzm-O{
zspiLLyV2ODwpl<onO8je&bQW7)i@nG!wOe}lWP@(#X5<(pjb;>q=j`xuXbM){9Pz<
zeIT}{hox8xbEbuQWrEfTlhn@`Mr=~pv{$c;(Ax)wLDRU*5XFEeMr%92UG4{E@|8BJ
zYd8I)R~g#^lH<tav-#@^q|x0H#bQzvq9*!Dy;GM}^#>(HfU_3S04K%}AZUeD;mu+J
z!D;b4$+!v6UT#D)f8`kgiKT?QuQck|^Uur5mRW?nXU84l&LVKN_#P7*9RW{oO{*Lh
zm-wv-^e4agO$Jp|c(|IXEWD0M4Nu=1Hn05JG3Y#%@A$a3>>MyUQ4F-zR!%jo%l{k?
zotrCCohT07Cj!!0zR9h9R(Y2;S824n5@~T(@G<cmdvxkX`6K7!FU00{9U-cP(9J0&
zSokxH@k+XqO{#c`H>EJ?=re}N+Zy;zldrwtbomE8<+5*!z9&yER+nYeEbVJ5hz3!p
zC!7ansu7A_aO~35#C_Z-w~uw|ugc7CpADQ*fpZ0?pdkI0F)RD4-##X^5ayF6bC+Ul
zbu}5d%~Ie5gCc%0!YMGV_tPO}Vk1EWQxnF)jbHyDq|zbW#*D&p<>y+PiePg)U-S_n
z?i=cIYXjzcd$7{;?3NS!32`>F!y67JA;v4&3I=&3^*5x)?2vU%1*dPR7KBx?krZ^s
zW_GiRC1q%Cf1VTJ0AvXl_h0g{)XL4PL96YdzD+wFvxEmA34JYdfDC|_0@xJWu22<f
z5jZV46Ig6xuShFm*r0?$0}-XEyhN8|18ZSdCRU!dN0xsd_YyYp=nSTc!DFB{Y<g&X
z=#<Aoin0(=PTjloIJYl!E-+fn5QY6bw`TC{>C)_&n}Q`tfE@hS-r-K+_<)1(@~vx4
zhPo)>{Nxva<md}8F$`dvXN_Fc{#JJ!C#1o{!%e*RfVlss1ueqRbBf!puxDMZqpU1A
zfu!+gYeIP(!|21MV?}>)Qml)3BrI$x{66c5eMyPfZzw>vF?e!ua+sX%Id3p?i<0*e
zN?<`I+qf{@Ld4aI`&6CVu7jo5=8$$u9y1~)l~()x1n0oLnCpy3*0$|z@_zm4;Ph;6
zoL~9huw^u=MViq5Je2jyT5f;`&))BpB*04N6lxn66)fA7jaW@tbss-ZAkR3w1Ijg+
z=qWbf7xM0Q?ryP@({nA2^w>QWT&NvF{<zr+%)i>37&GT4l}Oj3gab;i_TBdX7rvl;
zRWZk}e#-pGu#;2Wph3eaZugd6GMv-}CnI;TM=C4L=-DpH6tYMVjVFTo$eQwr)3Dzq
z6X92grH7)$Et0vI3JBDNy77Vu5%5~uz$M@#2I_ijBrR#Hm@8-X2tVLBd=&-j>?Y49
z;zo*N=?L|tj+0%7GW$KoGFC{rw<8?4c~G4boOT|knzWS}Ujq!2s1}SBBWm+Xh!&NK
z=%8Yj>D;Ok2LVBfD;K5VTTWM6K&|8*EMQ4my~KOE%W-!2;1U2fqdZ8$0Chq?(#Xmv
z=MQWksRXav!azVt#GinDg&VSZ(0tIGz$Pu75C-S<cIAL<<R|H#^vs7JoK{TZU$F?j
zXqr^{Mf#t5L)1gmr$r-aL6N~8T?>L0QrbYKaqfoL+etU@0{V60boQi6ji7+kUTp{M
zY8#Y#@y3kTfcDX4Ge24735J9GpF255F=dn=#6mki+}sw^wUGmG0$!!LNsf3GX3m|h
zfzMF^S>Pe#!GJ2lJ)|DP#{DPV1-pW#)d!yg-DS5Rd790^+kmOB6Q*C#w2vLTax%vI
zbTZl5MHpC5u3vdA`uIXxmdl?eG_R#%bepEDafR~VmUDP6ypr~8_R>>ocM>mBS7+d_
zIN;QGLg}PJckrjI|Djv{$&#FMh6LK{+x<OPO^0>w!GbS)7D{x}CqlqQC!MHO6t%&1
zd9ARw!Z9>a%jWI)6+jof-=6o@>TOl{X=ON1Me=})2m?tulW|D$^j@KGjdV}>9@;En
z<&~B*ySe+swk9noNasm|JkRA{=IUNm&GFBfeoY9z0{`sFFf<IRp(^;a_X!~rJ0^uW
z8F=+@qez-_Z>S<YH$rW{0ah-?gYg&(xPyYj6T|b50cL2pKD2)#L0sVb_nXq-qyzEa
z{I9&0*J>VZ<g#`<503*DR%($x?z%!K#z~FMg3USm#)JTgxyQ_N^-uo7{Z$6Df3@GC
z7S1cMDtNZ!{q1*Y%_*4LG<HCTd>rP!^jgznZrKm9QIk@LIn~Z6yv$r$M*D@C&Mx0i
z3b3vasnzqE4UHC%-X|TW&{i{*ET%pVc7u0K<?`ozg6JB(-<!rlJ-7gP^HhLaAu_qp
zQDs`{$dyn0PT~7j;GPz`*+-D_<9bs6wPoKw!r$G$9i4K|jFdS#w~Ro``9Pm_>GeCj
zIwSm3&?_%N#s&PE7<57<jh&c-j1`sNJLwG(onsx1KBXa6@3}rqP37*wrPc6Fg@D*b
z2DTIpl)!=BQ29Wjq}i2n+EB`r;ul~He@r9kmta-!!I$pCq?{qWr5Q6@>W{WVBSX!f
z3Vi<jegRjwMtqngQpoNT_CKd#vd6^qJXjK}=FFw?=tHI{FApq$NW5zAT)%nVK70g<
zS@l+W>F>QG$`<_#-U+&RB-Fkrkx>Px<cfrDWq-!5*kv!j@R(u`V%sNsBa0i=UW8cc
zFQ!IDJ$}!tTlqo^D58=#@X9R4&;1Q0w=(-t;B-+%Xr|q%ZL0C3^B(mhB(hmB>0wg%
zDl<}gJSE{yXG6MXugyksm=+aKDSE_w{KP_#^Z|cBPA~>RyO77L8Uf#!so7*Xu@|?o
zfJSzhvTm;U5~998_%1K}WL?uvzb}@tBT$1{_OnHUb%XK!pjk+e=K~Ct%sZG?(Km-@
z3g#Gc8;|K5Q&(sRP4tQpr|@je%_K2b_!rFvhErnsE-7hpck6Dp>t(lzP6(p14`iA<
zb4UP*qy5OFkF&ZwbQ;trLI+Lw^;+Yl6e(0W{EJHWam=}t{?DA(eV<I-qIpvfC0wfm
z-QNAhUSTl0M$%~W-#`6OKU<ahA%a4q!~}e>#zq>^o03A7j;XX`j1mJlLwCjn)!+FE
zLc_1Pa&7K^8$)#V(|E!PzdFMCyc6oH(I~rw1A123^*e9k?@opD6Xd(EC~?}CpocFc
z)3#acFai(5B;WA;Fh85`egFQWJ<J-n@2=B|5&hTAbwP8?5=sbzfDt2tMxc<IF7EvV
z5%6Q40O*s7EW%SH4~8OH6Y$v5HZw9A-P{@xEE68V&CFNmdhne{*bcGw6sA@kjPGR6
z7(RIQ<xQ=T*r=yW@_D1FeuAreS#1bO643T&qbo+>H>q>{hiR&=2S@WU^&x?v)&ysa
z>3JQ~>{Y!Rv?ff6$~}vUt7Xxp#`AhU)_iW!+;+-^ySC{YHNr<s?sxmwka1fJGSgfn
zz(_%KXw`|qHk5?z1()z{S1nOytcxymDhJofa4!i6tfcDJ^D+v0WOr5#Fr*F+|91JT
zB-IA4cV%gs{B|)xodX89u$YP`&6H1yBA`%PQCdl=GtfFBXoePY($uL8N{+N5oHD?9
z#(YzB&tkAv@_ne8dhi*C{u#2Z*-l@NG?}wU%psor&D)8Mef2wkI=Kjb|9bmG?asZ{
zH|F?P&;M!8=3Kd-2#Dollz{(n-u$z3jpHDD`2$T1jTBM#c>GknE<{ROoZXhAIO1(k
zjJ_>B_!OYmSLKk<t*?v499dl7fVKq$ApJ6U9u+NL7wor`S#An1PmgGXk6Ftm6r~So
zcd9!Mj00T;A`p2Jev5mA6;NW(8o+f%-w@<AFUK7d^eZ4Dkxv5YUvzR;hJ}m<c%t)j
z1BY`VOt{umQZz0+(dDr=PG*7hIUkKLIHhAY!N<aMYK*lsR)^ml2(GLIQigoC=CYQi
zwQw^^?(FTlIihfS=t!yHUEV5N8+Y%Uby>2$S=x0Il71kd({{%m5+nTzf?FgKygg=R
zpH?<535(!fhiiIFk9_?_2=pl+#t7S}7GJ#|@ekK@Mc<U0rr<lt+?tSE|7zM=?}So4
zwmB3i{@A}ed&rI^iA-j~X#!8mK-eVtpfmvYjMG|&3}_*#poObj@mC~Qe*haX^bOv>
zO=W3gl6mj>7(c9*1@~O3!uBf!N8_x}gx@9{Fva^<^Bz*hXgl!IulJ<Qu!61nmLL%j
zS(Es!IiA!P`_=|`kPiqP^s1`(cz)B1(Ry}vc5-q8nm52{z+0P}iNAke?@m&2aMXcw
z437U48I!9LzYzL(gokCwue>f^BQUZzagKrVX)}$TItzjJ5>>|8mFbt?Q@tdgg#NTz
z1OvRX*2Zcb0NpNz!%1v+cXuEu{oU3!C_FqoFc4Jda62Bn13wxs3g`N!|3jn&PKN7%
z?!;XCm3!TN_W6nO!|n_O!MChzl@47dLAqjCy#>7<A94JUNuj+4G;Vy#;uBs2Ud;%m
z&t=g?=A-A9^ap7yk!sQhS>JBYHdA?B8yXtG0T5}qxn&S8X6A{}QATcV?hhYEX5!Il
zG*fig@NY{%B_;eONH#dU4k&5XOuL%2w6WI@{4*|4)jVA<8}zrD=aJZ;@i135@Ni4e
z8vIu{I|yr6*{b?na1zV0>r@AFL~kKO;IMG0)w9h(^FwfwDe%$#?gH-`ys%4*e>w=L
z5*c>`jH#qCnF*n&X8Dkk*Fk^LA?20mD!G@p`XF0A2-||u(U9v6etLCvWl*73pi~Iq
zcRqs#nwpy}7Qqde75~_c=S_0y1>Rcwb(mM<*|K(rpInRB;=4=`l6I5e>dfzu=nI@J
z%!Uv=-4S>0X1&(ynraW9GQh#fOiWCmcK7+Cs+Dnz+h-XV<(F%(=kxwYeUk8b$$5Pw
z4NPXC-v1U_Lzi(Pkyzajr$<<GG0c@DcbW#G4|NOM7k_PinLCKzCVrvB!L)<<FC~&$
znCrCV#vS|%rF4m(2{x|eTGTLJi;A{MVVh^npDjA<&PCOfy7#%Le`2GvgihKWwJMh-
zg=rm=V3ml2f<@rHj7o$zoYw`R6D$5?&2!eAT2vG&I5qr5UFF**oMuSuia4E<j0GcZ
z>9+8)?B$oU2Coo-5z-9<1Cw;<=jR8cmq?es*7)zM0>4~QUJg2%<iMHHhh}DGz!<38
z`QNrA(j~O9u~8_4!&T+6XAB(O0km~@=kzq2v)eUq7{W5W=qitUKxqJwE*gS!dU}c-
zHk!&?Rav?IjUy;1s4yObT<rVd{AG!Yvi$}u@N)SQkH+8>5Fov*j32aKaoTTzbAIzt
zPvRMMb=LlFY-HD*708tB-LL{5ciF-3Zl)q5BcrE30BwEXm}XD|0nUI<;&X2R=Y{+E
z{1ZwP&%=4dH5cwGu7E{0sNuw8`@cn=FE<zZKk69N)UlfXQ+WKhBKUv4>mQjWkp=sY
kbN+9I=>NAjCq2W><Fjl1<sirbpT`Y+7L^ex71HzmAC*d1b^rhX

literal 0
HcmV?d00001

diff --git a/demo/documented/mixed-poisson-dual/mixed-poisson-dual_u.png b/demo/documented/mixed-poisson-dual/mixed-poisson-dual_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..307341e068182f114af4ff72f3dfc779fb319eb8
GIT binary patch
literal 39242
zcmeFZRa9I-w=UYaL*wr5Zo!(y-QC^Yg1ZEQySuwvaCaw2fDoKONYLQ7^Y63AxMPod
z&(nE458b_bty;CJX4U-WoZqZkpH!7)(2$9c0RRA+oUEie006BE06--nLPO5H>U>%N
z04M-*lH!^l^Dg@Q>sW1kj~|6iwCdaMcTdbG`1mG5B=P`sI^Q@c=@dD}C&Ro$<lrkr
z)Ol=SStF|s2$#)DCb`eiV{vG>#$!Ex@>o*fFM8%wiHnbvmm9`N{TKzhb0~V)4N^9*
z5EOdcTh(i6?QsWx*?Z8c4@|f^nf43*uw_%P->$t@v(;PRw|f=1mzeThAmKpZr@X*d
zq5mA6VBv!&+(>Nd-6%atCfwGE{_o%aD~<o-lcBpw(C_xt!T2VJS|))+G~jP~W57}0
z!|pQ!v)JG7;f?+~KiRquQ%;0W1P9)J4zSt1oKJ|}b6Sf&bT5dcqZxs^fFBYL3<m?Q
zQwsx@;*4RxlU{wCaCyIXS+H*X**Nf4;QveTXqt0er|(?L<az6B(1}mbNyoOc|4)Ox
zr~ZdNmoLL!UyXboc6{~%A9hsSB=GUR`TR!%3_)Lh;5K$$w9M>2?><BU0kVE0#Jj)m
z8iQY{$sZ@Dn1f#q$Oj&ea|f=|8%YG+VFyWlzWsR~cz+Il%nbIu&Y`*Lz3M*^x$;$U
zhSYl3y$c1=rxUqlubm08w?F>Bx+g}F08`t}y_az8ABW7Fvy>~J*WXtwMep+W9`h^0
z0LCvr@b`kAFKx^vR6;s$rUoA5etT5@4k9D+BAMt`_5B`-VE$RhB=GLzzLt&=-1i{_
za$(=se-&~UJ}UY?jj;#)xt?Jc!zS)&a+Nt1Nbo3j{{eX>0tOigyKul?j*$HP{M4_F
zHOQdtj)z_UtG(Bqz1Nq8_m_p2*@e7MXhypKCEkrB=A|*Lz5tp8a<R7`_yb)(d(J$c
zmNWZrXPr*LLy?OR&FJeoOi{>~IfB6uc0I}W*>xR3BY)nQFuqR7%&W~`x~NOQEO57A
zi-3R(J|E|JvtS&j=&^yUvD+B#z^%eSTVLNR%D``w;HS!9zbHOW@!zcGj-(LWNs@?0
zhZ69<*!Z~r=U@WL&~r)ZS^MoebKqqn_+{c5umA0?@%<-ca;)?gqoDr-sXUZ)1@^wS
zhM(*K`zQyICXj}L5i^bb&id1@AXCf0x!cOe$LGuMzkd#N4Bf`gb{65HQHl=)<|C&q
zxw_9Pa({IlBw&@Nc|zvJ&c}mzFC&<Z-QBmvXi-b{zT0y4d__8+Z*DTa{-6KM3ta_l
z&KTdX@_UMV3<X05IM3_Y$;E&B?yJc_Uti$Q`pzhz=<iUBFYm8c>^sK42HxKw&ma2`
z6S&<OxGl8%CxL(9an1zNAD8Z<jK03Uy}$8$e_u|--U}YSoK(A<%9U<vyoAt?Gp1U7
z!~D-wH}t=3FZ?@7zts`AlDm6*45<Lp6Y{s;(Jo*9jB7N!Xo%fukiUFK5QFH*j^EFE
zu?G*ahYK6A=as^@TdPbX?=5~$v;974h;;Kjq+jY=&nJd+m6OlT6CmR_q300r`QNXg
z&1kET^hf!dlmB(v5b@s)?c@JO`~Ouc?}&3)<H!HL%&m=&`R@N;q5rNo)e2%}APqW!
zyMxS;1P|x`VR-&<{<B9Xc}u?HeUR%1c?SP|=l^I?+logY!mt0dmUrTRUHczJh4se&
z(?v*86V)s5sleadLJUCBi(#cMJu+6(yLF?#zc8`?vA}$G^m6svDd~wprpjC4P+0<K
z?DdI$|B!e!%S7Kd{*>wo5lCTtt-uzaa1-(Ptio&K;i2;e^1lY-gKb#<-k6|j!7<Df
zD1MO+Ka_%lYhc<h3X=|Mj{_i3D$XDQdlkOD@O_n<@O6YV@C5a`aL+jVT1%4@9*Kns
zv3R<M4yvRccs*>ZKmG-Jd4=uRMhY>RrYRn<=nbHRhHC8D!Ci7AOJ?8m(T@DR`4yt9
z4udj#*|+Sq6b!3Fj-;khDrEo~N=<DUg9#Ed!?nh1pXIT1z}X~b&1Gs9I(Tw_D6wx1
zQpf!PL<W_qVqZ#g)~h}>1J_|ge<02wW)$MKuC?l1(m&Kv0FZW0U8M9-ln}RDM4?PK
zp)`|0m@{Nlc%-1W!-WT%A3ufWBV!<Xln1~2{u38gTG3uz??w?Wyox45od~lGo)y*X
zBPw9{SHSzpHgh0)>O9?9D5s0saM>irmNQK#X&SB@ryt9YVBa|AlGb04zRYX<cz6qp
zM?}N{ayoI~4Ksycg_<VnTz>z>79va{&=UTEQ4b#Uxilp<`MX!2v_(W7kDc$f`4W9Q
z_H}qNLo5r*`_aJp{Nxe@5keP&-Q4;3AHLOQ(zAO~da}v>dWyH^6DJL+stcn5RU@0K
z4+(?md2qeGQ&z=8WGPeuGvM-#>Tz(^=c0P<dx(~grJ9^CN+DLA3xi_HeB+!K2c&Y1
z_1j_&-`_kcyVSh$TzvlxBGOIp>oXFyH8yM&I){uvJ*xp66e5&YlE{u|vamU>bjOvZ
zR79*DC5ON;fllnt^slE+T)SN<dO2Yw8LHvQH!$ZP;xX}Fu?4k9vn~(b{|xj{eQ=0?
z$W<6B=ut#NI-=?f77DTHv#JtN29P22hzdcW9E-8u>7#2JseJ=yI>vZ&sRDSTv8HJ0
zj`{AMi;@Q5y^|!qGL~M%5K@k0iII%xTLzRvwCMPh3?%&2`FhLvW(b+z7!c_6HGJ9L
z%ZI0u<OsuT%|<F_GG9&uGIS)`sZ;8zYKFgI)<91fb9_~ve1jDr5FTuiez0nul!lGA
ziDdBHF~z&2Wo~X-9`&|_+7@MP3q}QY+gf3DWl`rS&Hh>L-R%*0m059{r+>S5u<^3q
zz4AY1e5)`-%)iNbzucP(Yif@KafA&!#sadb^OVGGp9vT^N~*=nmWEQekjo+uK0K{z
zS42oh_K9p>Q|ejYW+s2zmy_c$ibhnV8&p*l#|&i0oGG6&i%r;?G*=ft>^fC<imnoe
zW-aQ`WeTH98n|mTLeF>6`!`6Kk7qtk@SiYq4G=XcBt|`RXgEOI7!DTF$Y~5bysY1B
zac?u|kjt(=)yT_n;z{o8D1!xLx4Uv&y;RH_10BkfhtVg|WFNFtXEXU2CUHpT#I}PL
z2h7Z(WoP~pqR>#em*K>WUVS+#8%Ce#{tW@LJdGRnU>jyh)va%m6wtUKXFO<Vzl2G`
zIr3XdW?y)D!E9!YlT2yNg1{}o&<e6?ggM`2ZJ}gCYWdzvx5tR_^t%xg`LAgDf?tf~
z&lI|)ygveJ;Q`*>yd8lD8`bVlim+5&hD=l_W$~n8{{DY42AX{QFxvkMBW=XqZ{7nr
zK;j(ivJ60|949J3F9xG5PKCz0cm~c&nHd-^L>5XNT8KVHQCrX<tyGcF{FE^VTfVjN
zKo<JOKwYn|d(f?4k*!cSp$6(%S6cyUp+hT^xT*OEhk8t!ZB3nTTx7k=jGiV37N#x!
z-|qunte*W|u8>~i2EELO=SCA!AQR^z>cQ0_?-YcA7!gw$Vd{)kX{qdK!*|G3Ka{7p
z_}S7#NE(YBN|zp35)uns_<x?JHC1_fjl62>I&C4v+jtMeNTSN9Px4yV_ewk{ry|(!
z&S7^iap;J0ipwf!xm-R#WXqi5dK-ARK2gkro)DaQS%Yb9?e6}`CN>5PM=AC&{=IM|
zOcF6Sg8Eq-vAH=CgqbCVV}k&MMHbIdmSY0oYVlJ5Lv}1mRCTIq0-3USTxj(w1cps7
zI~0Jpz~f%u!ex^v+u@Awf5#e>qMEa_zADUEBwF#y7EKxKS;WNYt9n9V8fDUOSZ6E3
zL_fyg7dhchd50qA;7NZMd(XY(_LL?$x%dtNT7c_~5Ig#CRJCb2u(=ry>n7TqR<RQ&
z45_$6;}}>~!F@rhkj;g2p2rpY&7^{XycnpyCb=}+=aep(6-%uNJ8{_!g+twy1GdQK
zA{b>8YgM&Tyj1=v=WHl(ADHvgu6t4|swk_5UGv&%oDImRXWh(9%>GTJplpfDK@n5z
zF#)^sIZt3-Z#Z&M&&T=W39WcdNW4VoXUZ7yRwXvFa~NQRojjowkWM2DpN8kXqJp^E
zI0<A_evze$mVVvc?!^@x=Tv6ayLSD_9KmV}EA~uduh5Va3I}&oUMX@@fEwK*g4P5+
zP7u^IU0p2u({rb3RB_*(&0vF8{D>lnm8$EThMG9kWs2I%Y9pCYpUs5ZJoHI8aNWiO
zgT!Vw_+fsgPTSOv;Wnmi<`w*EC=R9C8Yzk*$18y`M;=8x!^3^A=%=l7N?G9xucmbh
ztA68zn+*%v0+=z{OkP2)R^ku-srzD>KUe_p%Z+9HjF+3$ekSh69?fC5jh;i_lqJQ?
zY3WpcJMz1j;_y~Y8?f;(893IuloyG3>wlmv__v?m<hIjCBw$M=^&n3TZ;tVbZ-I#|
zVqWn3);4>g(JT<!0(Q}0Xi&n<4;U&3I#<#c<I)()kEVuWPIj?ArJVUymn#m3)O>vZ
zhie6MZud?O;1MWdr&qyPV7I@>5-IOwrMWsU{jMIuQ}?!n>?BmDS;9;gF>^Gn;Kl<&
z^axU@lDg2i6o%L|P6R2qruj!+Qff^m^jb7n&M+t9OQXG44SbnD{U*Vuo&~HEkJ=D7
zM{qmfon1K4Ta6Ugq7k`RaF$Fzh*}vV3Nc%rC-*`_zG6$H4F#@zsMk7nmnW(2XIa<{
zc8RJM>d=;9Dwqg=wp9*CNY*2|1gs_w(EWv2p5rQc0h?#;T+uJFYl4bY3i?WgOmS{4
zD@+;zw9O3vPKl3_)0wLN$;>!=MnsCCTdwMgq9~ua!c#}eBOB~bCCw45^R9v)4YL;f
zIQQ;Nw2*TUfC6zd@<bYZe{#d%68Le#iD5+dx!i{4kRf8G09tkxuR9)G^JaB%WWn6L
z{`4uu<M(cQ>kLDx)L;q?b;XdBV@%3+74BD<rVTvDdnAC~D2soa<NRBq5mS>%c5d|y
z)wno6+^rzUo;_oFc-3cn9P#H8z^o;N2m`hQMS)Z4L*}|Bp0XN<m)6Vyy;qAI5$m$n
zi~dLJTeL#|(|f={bpiK;9t^}JwT^nc-D$1=?GZJUl0rHiej!Gth!9;MU2=4P$PEmU
zRkR+e@a7P=tvF>2i#xC<YJ;*f1XeLgGGvQ?nnFp@4rxwZ!?g3GOA0;pz!b@*Oa3nV
z+dQ+h9B_S|3|leQonZbBKEmIo<zOn*DJY|gmRn;@A~iEc=&l3uk;zp!^NtBYgLum$
zyoZWcVQf3VIGNkfx3h&^JkoEk!7r8EZeY@rHjc)HR|2z-7g{7Ij2?Fe{nXM-Egy6r
z%r#F9B-N6!Mnail`??-nzr9wJ5a15;NH!thY=q}U6?_wk+OaSvH8;h$UytcESGl#s
zxCN1Kr1lDJ?JWJ`^Y&rs#Y&EWTvb$>sf*U5?=YvK-sBcJr7{PpY-l7qO>`(YiA}W9
zwUcfweYq(ex3kaGWxF|)=ktJ%zF0iMx`e)j=A@DykEs$r40(;+U|nKeYPa`U`eol8
z=dE+uVBSbj9OG?pnXpCbC4@-=?w2w4f5dI<|3Q-Pd*bMNd%E=X%P}v64iF6Z`<vP1
zaoQgewy9~q#SQ$8%XR60{1L}4>V7!+)8zdLLKZL|=!o4nCvx6&F9bU8`41cj^@rC6
zoNE+*c-=dxJ4jd*Y$bV|s-?$A&_+evSB+7BSaf$6NJ7<wJ%`asi&zx-ri`x1x9=}v
zk!I;*4;IrA!Y`&+$IhsB{dCLhsNArvHR*N97)XbPioVGSn+1;sM>YQ1yeJxmH%=1&
zJXV}A{D$vN;fV`%Dxbrks-k|od<Yz)$Y`G_!@g&SHtkKT1Bhksn*p#Wh(V}!5{whl
zpuQ=Fj$VR#6!^A@9s=LTL{i`HVu7znd4ea<`>BO5hcl3PkQfroL8uHFqp!ig5rSP`
z@4mio7QSv`ynV+g_;M{H_O$em(cs?;xM_UdYE+_2g@lVDd+)D%@7W6h$B<7&z3YzG
z*BuC{0SNjV9sF_6-^bg#|K*7Neck1C{UPY;AtQ3{&S=kTynl0Z<R@Z2_attosExbZ
zSPlKbq3am%*<uE`N@9+P{CO@ER3o$tU$kkCNX3)Al&4j+br9IfiL>-IUP=g;3AUC9
zHe-8ftErrBOZQWpey95JIA?jwVw-I@|1FvpJ348n-Z<g}l)C>$`*VxrO6r$y6=mOx
zyg{95Jeoo=RXJ^8UZ>9Z>Qkicm=guhip7H))M4s16gUKt&gh>olL(}sF4@eZ3Bo0%
zq$7`-jX6ijFy1#|DsM=HPI7c0Bn>2_-Sppk-UUJf<Xk?E5dWhDf)A<51$~eH(Jx;O
zJ?6;Y_Q^BSO&)r_Dpjuhqd9gu>8754^<Mcd_#5lFFNi!C`s{dN2>%{jDY$Q2>3Sy@
z>h~oQyX5qJEZ#}Q@1gdb$5HWr<t;9e90i#FnPXF>Y}%?RBPh48H5UE`AA@QZm%+6)
zy8*M)Yzx+10M8;(YK>&gku%S$+*Y%ZX-1NP8mcL>m5RrwN@jM_gkr0bsG_S4B}7<K
z(*%VouV!P^N`J)sfUXCQkoizMWVLY)6dTmAtcuz>F0s-MDmH<%&({7#C+74t8!$-U
zV(Mv7g2Mb{Pw`UJD@kKe%T}Ex2nhKkJem@aFGnu-@lA?#Ne7;<3WvMB=J9(Pp8rmW
z1wlF)v5%kAx#PW!V*ER7%$zg7;kGsCv^ZMy{c+)ay76WD;}L)VpLmym17h-pjs!9h
zzrVltXV`i#Zi6Ckpzy&bpIy&X0#p#|&=pIlq@*K2fHm#Zj5gh%Rt(f+dp<&1<h9Q?
z7Jcn0)pVhnX&_ZZY-xE_f3Q|OQ2jSIpav(k0Bv7YW60abHDYo}Q_tBBoxi3sU6&zJ
zSwkMhy`vJz?(0^nIuPn&A(`+LFZ>N^%9shM;Eenx?4=lVaT9?{AWY@1Y}c?_)Gn)4
za8RPEWS7unLLsEGjsX7b*eOJuU^Vjb3tH~}B8JGpU;3+Hclxh_!5{xWcrq3!m4l6D
zi^ib4T9e;l_@D8e9UWg*#6%iAYf5Dj|FMhdw;1ogF{05)Ke&D$)YuIKY&gva*2F>_
z$(-)LykD^bs|e5)OU(m5s*yK<6k@AO&EH-3NGK!_H6wE3f%UFt#a(Gi><e}=v?Cf-
zMDr@TB}g?NM$=5>pl6w~WMGyqGs2!UF)&+Ux1t1e*~$yJiWE_xZf!j<=w=u%dta??
zo4mKJ^4zTiRcR7vVNn1(VCWho1y3ACT?dRs)<{F8(3g1}r8%hW7c<yFRnf5XDEwg@
zoKk|DVLxVB$4=_d;}U7L%X{;m{%j|X9f1q-4G|t@ZvT`1d%Z~&e%@SoD;0Yx4MY+9
zJA`2jp_dYE3}h0?UjGqnwGBPzZ_ig4lwW>FvcJsjz06%b_h0#6`v>nrT-iKj^!{7_
z+7av&GY6)zw~ZE2;n0%7rp>mA3{?9Ldq!{!xK&H4I=HKze`?V5i4RGtx#v<>Wphr7
z3$d;~BA;_k2m`y@S%#9LEMeO!gu_63CEiw<0}WYUU%r!JN2a<VZI}Kjh~S#pvtAxg
zS)0>yW({U2`Hgj=XS_jE<4}d$AKyNq_F4vy<1&=dim4<?x>yZ478C1Pn^CvM(-L;n
zS8=mD6w93U)7`!_XB)->e}iw&6UY0zu(}@<H_kRRK>qNCv-=+se7Tv&2>KnKXmbRa
z0c1kn7x`BKCvy;lz1V0rd0jJkEhc{|hOo9Ly#vp^g}=!PZ6F*)WjqY~W9a!J-4h#0
zffv2EM9f_=5{`wWN7GpXD}n9;6H0tkjD4*>nFEZLi*|~-$SVyRvNydsFI+BAp|$k`
zE}1Gat{jWEy2b*Kpgd0^d!$h6X1R#4r;kgTfK_wm0>gq|nD2=VK{MN3w*|%U&i9$d
zRaZ2nS#7B=FhSW~bEVQQHwEv$9++~T8T-6{qnt1f4FD^pN)vx?yE~5uN`2aKR@SJG
zjCuRZr5Hx_gKNIPqx{MK&sbx@(~Q7gY{1h>VbBr8%Ko#i{5zg22YT;2S3wWB5NdRe
z_bZ_5<$C6yXgZu+dM`T?gKkT0KB_DTK%C(-v!BuLdR`x~Pe<14#F}S9ngo+e=32j!
z{v-hNqEv(dpOrtXr<O%ZR|DL!GU)wgQ0gnhTZ)CGnrf7w#VObvH&o<$pbzZTKhw@2
zwuK>UOyEd=J~(9n=)NTB-6qu>^BUXqi;xj1CO#ikOC#ubsg=Gz)52<|$_PgV#$AXa
zf%<&=%fjkduxd+gD`J}Cp`YgsOJ^yzRAStU)8v_s2`dQvq)J3}6^ey+Bazlh{XhEn
z-L)E`uuGbMw!kN_2uMqhhYa<u=ZaG2H}{!^w~GbQ`TB1V;`%w`<yPhWw*9MduOS<K
zs?1w^5X*6TBIXBtQR4TDXuZ4r#f()4e<)8%3di{}(E{7r@N`@(%@uu4=nJ1G`_y%-
zikwKCL+t0sA5{9w*1TqE&;*e+bXADA+sT?$wr>l|W?)|1WWAyz=U;Tl8=vti5}<)`
zm!&BvB-8X;k*hFzJF_`b9-)FLJhW+S(QC+wmS_*@#5p86MS3*Yg78Fi77I3ITk-w4
zTY1#TN8^sO67h(|U+k4eRw^UpY9uc3r>&^LfT^ypa;Rvyo0qKTaTT#ShQ8TPH4vo^
z_}uy{kDTO#C*okU#ROab-ybdixNrbl&uNK_-`Ay58JDj8C<wV<e&zSI_oKS&kF=Mm
z!WX0v^4BGDQucuL)`E6JHu8YqLpH((geuPO3)m2sxpMRZAt(a3s~zrkYZC>*T6H2m
z8|UD@<%59QXPRz38M$pzi8?-qF@};YR6fylrwKpl<Iib}W!Ku`b>QBW$^ur3T1y{5
z5%lt4;gb<8Q(WPiL|IdnoZPJRqUm>Y8`|x$b2vfd#CxZlWhy(&Mb>DROe%3a=p7$c
z!ni$Ax1ZZ)SJ!OELto05Z@*B_p`hI$m&VxEj4T!{O9<;qV8usu>Wc9p<rrWk)YNNQ
zZCs9?tA-;=joIPm=-u4Ttm*888;1n<dz_VLu6w;kLUIQ^KO2})1|WogB#^D|c3GqU
zsI~C*0>bvUkUu7qKlbfC_w@vQ!TNm?{C08`c;){u-P7#)cDeU<ITVhNNFsQx*+2X^
z*!@s8A31aT>;f2^gW1|#nJ44tqj0mp^TBiT$K<PMN_#yk+xzu&sZCWGUx&Zh7Hi(S
z(@Fods40KB4t>s3wDzmYplT;UEv5tv8Z)FvfRne?$mOKaIXjXMPoD^k7<5i>4s{Ma
zV#62e&gQM+K@gcC?!^lf%3(*c&7At}#oD7CSlh5>E)z$3$7&uY`flLp&|K==eeKd;
z|JZ>ir2nhRq{N`aq{sw7o8KP(VHCYNU4Q12(ln{T805|kI)5UeG3Dm;57iQmxS7l9
z_Luala`*NaQjAP&7KYO8YEGy_#~%{(@AdEPpBE{3Vw~cNo>Z|bIA;m?HiQqd*UEJY
z!cACC+_<w9oqNtIgno6EMo7>?oKqwI-H)Z8zTMy7M~mJTx4c186r04(UHkup4@tT8
zSJ;ugM;ZT1+U=v5e0=ELGs^HZ@_D}O9Jp_941DPpJYoHXm`^`-=x>ZZ?)p3AKA{zw
zpD%=g@)rx(bR(+*YFPPIc?J|~rZ0|Zeo=loNs*F%6r+!48}3}$*}<ii`udqRPM?To
z?P|QnI$H_JS75QHJ4Cg^U`H5S>dmc~zdUXcF@<Ptu-*yC8ZHL5qF7d&B&Dz$=I1OT
zBP53>+L_%)jy<MVW)P(w3#=A(m6I!FQQR}1aoaUDEi9?2f~zhK6nt+vNO_UX5o419
z;QVU^%E{vuiW<Vpw^9>CsJn3Vr=I^_3!qIar{-39#KXbG*4w1UD^q}ba!P*PJaUuP
z*>~ym)g<^8BB}b$T_W(`K?Kp?Zw~_lZRy?bZ_kj_5ndc=z@Ipif5|BC-`|HizZ|g!
z-|z=>za`=Kok}J4r$aJIj{`3=125wc5AR<h2x8e@{&{*0y}x=Ob?iO#KZuOI78W9W
zI0v5!o1NDhV|DOh4#tOX35_G?Wg|1q?KN?xn}2hzoeMGTX8%!_Y(B7}LyOF$sl-Nw
zV@|xLUx1=pi5yDNjGWTbSD=ZDxYb1EF_TH@1gqMq11<`iWI+irFT8~c8Dt5)*c$SW
zpP^5I%@8Jv3p@Tc*EU~LWk4o+p?xhiajW1Uf~-q-Zg1PBQtzhTpx7x>PS2=EXR{eo
z`Y?vR?g_$zrabx)OCq8CD352rn#v6=>6l(~0mJy|)Q1|Uww~yCzO!6bvL>Hj<^4Vg
z<In#46HTyP9``r|(4Rl41pK()b_s^$&Uo^bP5ut!2mKu(@BcGStYUoA_;%h%_Rn90
zd>yuBPOLcGu)6rpcoaT=>l}E!{D+7Cpx|F{CPDtRNSkTs?$<vqIOZS!LFMyPw%Bw%
zYgB=jq^;hanMci$@`gPDm4uEHujS{sKKoK|3~FGz8mH_H90UjvV<}T=Drj&|NUJ&8
z#YMHymT}POe4SA3)Da>8Wn^U?=(2D{CZlb@kn-X~t~*sa-<B3A;^?2#!b);n7I8!7
z&~Bf&#%)o0%UMFQE1Z}PBB>qo18?cA7Sjeg`^oWeWo$oK<zxyw7-su1D(#{~eA1Gq
zpnYQ?mhlI=qY7r|OUTD?MrTIeQgE?da#AqCe|j};Yw9pR^~tEKh^2JCs&3@D`td7V
z<<w`~jV$uPGcjw`gYNIt)Bb;=p#s2NI=|};a4{2+rZP9jC3-HqeHL{^Z=iLi$lij=
zp`0)KwihLe09vrR9I>W`8P-e4sA!l+7rCqsRaubY!<B@EAfse~Eq-;43gFrIoEICB
zh7br~++<xD-k@evI+O(M#D?5m%JyY>Dg;gis|^rv*=nmxx2~{MaFi_ol#ydAoV*Au
ze$ofqmxggleS8*)IaAHrSX)VIU*s~aKB}r9Glh9>VVt3Z)|O1}m+#0CL_#X*xxfsc
z3m)o<NdoFQX~sruT#eb+h6bAIFv2U@taXyQ33~RYLx^iK_O%t4!(+<!39!}94{8wW
z{qS+rq6Vn3tJ9RCvK`1+qw~$F-VBv^2D4n>JAdwvjH0_DSR1t=sF5Dio+E;!K~)Zq
zc5#jxDYqM+ilu6TB~*@u<rjaB50y%rfqwt(CLFYCqq817wAOF|^;g>?1d1ri-qmz?
zL0(*2e0qGm5(kxi9H?7TZAm5@Kj<pDA{>ude2^IX#Bc?xChtCjG%~BkjdNMcQ-H3!
zxY;LMYVrovO5x>=avw<e{mE@fJPn#yT{Yr9BQGVn>YSjYqV?(8<?ENL#K6nuAh&t6
zHSXY&_pM-oum1bOe4^5)hO(}H1eYUuq`+t4G(5qbB)?hwjVh&Vfou@xFE2A`__FWj
z8giV!I?VL(!my98-KygQZJ<<IroEt`nZr)+&0{0sBSQkrRPg;gY+{#}nHVHNOHaz>
zl-(P4X?O9?=&0Cy#U}9{_X-Lua*f_Ml#0k^f>@J*PZOFOoNR?nNM#{`2}!=YhLm(F
znL&uBC-;{Vlp1TPmM7qvb`Y5;>>x*T1SPb5po|k+6-O1tc(VHTc`S9r79w0sogC&6
zbR{NeqYhY2@MD)tapm)LOkm(+=R|&f*K1b~Um<S|vq|)yNAEnDvB*VVLrs-nL1tHP
z;KkA}bG{k3B~on>{t6IAQmXV#HyE`Q8B1~<SK{I!1C>+Jfuh3J6q{zucY=ZsQLjx`
zts6>jAk8W^g<*Zl{wNmt-l=SmW0uQSn#lx?uvZoo$Q95$$0}!*tDD>wB#2H~VsyC3
z3@XaELDD3mgEd`4l*5!M<QtXMc$$e__kMkAesm;W8HbIWrs1%fzvnB}==Vj$F59gR
zDcWeUOl@ga!b*A~Sx+Yb45z6<5#`xWr)WvYP0>LZK}qelm$I%HO&;7b;EBRKQ}WuO
zs@GY1jCe2oj~5&m4jXLk-2H2V3x*y>PcnLlzkU!7mCD*|(>ZcRw`$f?e1sm(kzKJW
zDIP})4c3sr#L1<b$45+tay(D_j#yOv;|uMW9K%^WD&C2vp|m=x9g=0{vtc0x;%6sC
z!X$k)g0YL2n4kvT6!WTnBehbh(Dkhf19M@6mHsYUe*6$7ntG?qqLw!#qXtA&tPl<&
zYE<wJpw<Hq+7{drvJMB4*Qjv*QTOn1K1VgS+L38RNLSNsrX@)&Bb6z2sl5ihb7&sJ
zC;B<Kisw(sCRp&|aOOl_sA$PJobr~aX7ZnK4h(_A()n2S$1@zYI53ra+D4vm0&1v#
zHi83d2HaIhv~vTt63cb}e0m=q`I`3{=*lJu@lq$?=%W|OEBzGtojie;WZ?qYP<?m`
z%FGJyrWPHE=a?s~im~TJ-h{tsn8p!P(By5DYT++3IaTq{=hD%6d?|sMjJY^`jj%CQ
zIPW-CkCgd>V#NqD5*UF(vZi?5!n$3CNM7E)EQ=o~ygee4$gpisihy;au22A_aJl?l
zb7-WJsbJk#F50i3qs7h1=BQQUxxlGd6}AmXxtk|E-c`a`HWAi5rGdGr(nE`?v$!}$
zMB!<JIUx+w@Y){V1dfKopklS`uj`Gg@5H4L5yL{P(kA65MbmUW^WbA+p-Kc=$D7wy
z`mt|B7;T$tkN68FueMS{&EhiqAr3vfP$Bl1#Mj@8H_->@0*SGiDgud0UPsJ?eu_4z
z;DNa_oMMYp!Th2<7-}2dO>RkL=BO%XOuA4?E=lD{il{0pVmebGfn1~<V=Ax&4Jwv0
z3ZRZiWtF%#uC9t17K_>TB#G5D&#9U*m_}_+ROg+Qn*?&Sm@jHx{>u|J!NM&#S`&m$
zvDxokP}ZFt1MZ#tqy9;dDwZUL_eRE)PXPnqS-V*y&0-O9FV;MpFUyG~%ZWmngl29Z
zP%5m^q=*j{ifM)Hf6NrOq%y-)Bje;Z4f71{?t-4~<`$W@m|{XvqSHv_V;HqUSOFXK
z>y}j_#)!v}7A0)klra^qK{*RIw!!}xI@#`SE_~H_|E}n`DroerTB9>eNaBV0t@A&I
zjSK_a3Mc6$l;;RYo<n_Y*pkXp22w4y+N~}$J7QAN`?54O0PL2AONwN%=UXYux-P^c
z{hFLJwxB}57c}-fpcou-TGqGf^<{~=qQ&**n#V6I3a&i2>zzcM8y(<55Y~An^JBS$
zR#1aoA&*>ck1v*5YlSrwKVOPs2P^cV=AeMMGzGBb+t^Y*{ml}qVlD~U9GIc#XYyyN
z)J}!h!;2VLCK<i-z5HW~u+>V}f7uZ#86|4zDXtM;Y2@^V3!N$kl<a%o!B$H1^}`N)
z^DJP?{z#Ekw4D>zlx!O-zcsK{p&z9rL#Sh?>-msdS&vjQFl&Vx&~+Ce<U$vk6TI_u
z<9c%@Fm@SzZ~;jy`8o=0f;;0EJ$fJwtI6jMnUnMuOj~7>3j-U$RL7#l#Q^0>C~;N{
z5uEVxsm8V{iei9{A<9_#pUhQzK4k800@SH5H04#G)u@pa;nnceKaX(eI@a6pw=lvc
zr!|@|Rp;Qs&5Kt%-(z4Wa9Qzen|6XIC|9|0kt~%<pcWsdl1PM;$Zr3v8ojZ`w>Gt+
z9LD)%>wQgITV;cdIsM>}Y3*)X{u>pqO^Htpx+ehuHX1Gy3}2OOPRqAcYqKcWnyvdq
z2Thrx**2=JHz!KHNkdN9n>DRhK{qd+Y%dhCl}Ck35ypLUvNpB=RdwVnx^yNjwbML=
zzr9`y^L!s|@D)Uw6m3kO30VB`^NhriWU5ms@x|d%fDl56a#l6GoFH;4n40i>nuCq8
z&CH6h6wHaGgjSnLNWEyPL8hFpAv7n)7tAjI!I7vc#p<t$Y))|GcF62?!2=6M`^k}q
z@btrdGI=V{GWG%u|8C<LQxZ^)|5=r{nut>FdlD&A$_}^{O*^+}k+l`1ui8cmive!K
zoaXvbxhfhZPsbHlpQ>awpSrn4k})2DdhgvTGkf5tC7VK7a#bIl56e(74qb;>)ZjGy
zbj!CsOSvK(84XgnlA6Ys5@j7J$Y!e$7f+KzTTwL+@mq4XK2KAE;q1T!N(`3C_iJcw
zD;(A})1H}Zko13+>Z&vVk%hOr7`vcFvs9i^#mv!K7_i2)Qa_J2_Mfl+VjjSl@U{F0
zvSH@jFeOidwd2k$n~JOR9ypp6VIa+IF3DOVnomq1wHY$XmgZX(g~m38R&!#BNX<V@
z?$64I%~x^};=1lJJmWM;eephMEtQ(=3^YiPY`O$CF9WgoDsK!ArsQNsbJcgx*q|xU
zDlsF|HminY+OQ`)bgSGJdoE`G7v!QuNc!cM&B%kmBgHmGd{~NAdwe_zPP-J;O`ovz
z<RRvz8@bgE3appW(`Qx2t%*c;CtX?xTPM$?R;#E!&hl@ajg(T>;*hW;oT$a(Qr%m{
zHf&Q;vL<ewFeX*?RwZA`omm^(s$6kz(V4uaJ{gn{#94zTR7DXXC0b)17(=lY%|QZo
zb?3~x$rbD?+7%qAPWU!F1^;Bk(2~7Tg^lQi0^i)Q!jTctp%qhHjahPsETL6xG>lAH
z!?Pm{GgQ?f0}LZjceW)Etlo&tV6o^fJ1~5=4L6V@ke5xJ;;l$a**MvPZ`GE-&c3~8
zk~2jLs$f|>!&xCjx<jdLlx5bPdReDS=JARN8+Tq5L+1SPyLbo(T9z=c@^f5+bxl0`
zUn(3obAMVZI#&FOR!TSPX4$Q@7emH~s+CRkb6&Pc)oX{@olqvUU*>Z8rIV&!M4;p}
zEO#YNJz7dBMZ0RX<huG^C>-(HpBSdt5f|@0SvfKMxE#x_n1O`}{NdAr=-3$tDGSAy
zG$0;?2Lv^zzOrDu?p*N65@aC^SvqJ;5Jpu+<5M>6u@+jGx@{X$wQGsIAlJG7DrlP%
zfQzXJ7ir9?KjBp7enn%A6QRubL7t<}ky8MmTFB;bW=AsYbADm(f^W?oDJa9^Lx`qD
zM#?grT}zkq$vh6EXv6rIF!lrTTtr$95zdpaO)8S>1t4TNG~7-#K|ebeNtPdJFqS7H
z`rCtMI9|>&iLd}7SqwJ)a&Ig++k@4fYmd0YTni(45__%Qx;hHzm}wCkjn(vwRj!{_
z_Cca!*;WUNBFmjivs;^*;@)n7Fa#cpfHJfXRC8OW#s>aGP$slG{XnKkq^TU<ci<o4
zmxF=KS|akHMY0bGv~zz75Sq7u5a+^7I6oN)mM+awD*x0Gfll$VG--LqHC2tGbLzl7
z?<%j0Aq_IDkpWgrOo%jImQxAMxEIJQcio_nqn3&^L<{`OAOZnRu?UQ3ZLRd%M8h){
zdnB$oSj`-bOu^b=X|zgWIo|L&FWde~Vs94<?zN}V2+VdWuMvE?J?p)&zzKrM=f09i
zz4Pe>nCRskPUz8lWpo~E-pvig#LSsPIO?+4YI)-$WB6vxOYXR?9Unvr$F~}u{M2~3
zt?L)v>UgCf4@DuunwRbjRSnBLyT7WTc14@cK&G2a#+|6<NivPEp6i<#+m|5KDXMAc
zDZf^dp>Mjp`7rAU+N`AqdC(B(#H?-z;LTxt5+pFI=EVAm^wf>B$-~&At#e-5gHG8p
zKP^K6+fEv;%8Y>wJ!{<<hdTX<a5D&JuBliQk909<FYA0D{Wxaw0Hr+F7E!gaW_rc|
z7vEO9v0zYLQ)5yS5lRaU`Hqfp(^En6$?hN+p(7-Zl54%K88!m}0i!_}Ezy&ftyr{S
z(y}`x_-5n$Tw=lzu<?OI_WS&NtTi9DwG?a-pbW%7z=$|Bs(?D3Y79G*DyKJizhqbN
zz3$LkgQJFLiWpUpL_Y(X@myZ5dd%p9Hp|)@h@7ydSX{X(ims8WGy*Zcyt&eGKACZu
zKinK8q*z?;rn>WfM|E|fr~SD`MrJ|gxQ5KXd}Xrw4aW#EUna`bFa#_DMg4^51u~?_
zdT*`GU%hK;u4JlI)J%WEt57ssJG|{Pk7!R6ccakLr;^0I$&6Z8XW;f7y=@T91ykH3
zLs5oAd>Bja(4V%oS`lmqIZu&pr`<0r7Net%2o%OYLWOYbkf@tFYR+XuU&K4k!5{#v
ziqUFeB97wnJRMbDKfa_11boCHf=eXTSsvC3mNWlJ0V`?dvVf`^8>eh@jIz|;r2o9y
zDkLJyn+^TUHzuobJd?zk8h4Y5QaRo`wNyVSyWfH|_s(F6P@{|dY$wMvB8IZdgaM_`
z?+RUa&90V?6{|k4Jgdj8YS@wk6=Lf&6D?_UDfW`U4Ov|5ixXiV2E@ci#jT-Br;8wp
zIW^FHtRZ)#dtz|N-@Ie=YOONDS2I{fynYFycH79LN$x<a#cAVU1ovcBBe*}oB1z^3
z;seb2+dh4&uYuQ+aHqAx0S&BLW*oB4&CyWQ9y?M$=ND_jawaGOo4R>Nr7mkDk|xHl
zKhVB%U)~>d<D7JE9Q+VY7u#RlKfE!IfPllbS5RBIUP8jJ%LH0nuhh{6qP+;5CFvri
z;NqHM#~#_Tk~m>w0a&h^&;5eBIVuUS7BN6v7$_}YPt_Lpk+O8kFiA^4Mr4UDK-Ean
zr<@yw)Qt?GqJ7b5pqfjThRV8%poP5R06nEm_J?`ue`&Rx^J$&ZYznrJn3`rqLT$7*
z&;{fWni>!h(jQ49t;??v5{e32*56qPnAL9jRv|-d#gyUNl|^~{%V9RKO-eOZ(A9b~
zR*+aDAMP3uk`Bbo@$}-wZ9~hk%yDWW<DtuI9&v<myiOQRE<5^tIc}XI^2{{FwTaj2
zz(j{+fdp$C8I=g@_A(laNkV4HZ-m3S2Mrhul~~t^qE9%v5_ONQh)LGJSYAy4%4$eL
z*=kgq1I+!z2p=xHrlTtiQunn6S*Ue(LvS41KUS+tD>AToal`-z4OO8)Dee@S-6_-#
zuIN)+fx1K*5iKj^$gIm}W*(+T8)|p0Z&D|h>v<ac5R8Nl{j2~>$rJwii4~dv8d_n<
zr$Ye>YMn7B^xU6;ssd;m>y^#pJ>8CNWkGE>>m&uGyJf44t@Vo$#+8Qzu1cfox~(TL
zAqRZ?TXqd?4I?2$_GT5^*4lKG!_ACjoswgl;2v(dzlmNoC1}~7&$`ON`~?pnUmirS
zVR$f<2A8^*sq-rmn?CB;J`qP%<fDL(9!y7~LfepmP<)mXC6=1*{K^MDbOLp(_@@NL
zGg0$&7E_jEjBrLx^i=fff=%obVIsXJ+m4KCPnt)uv`NSNDN3gFBW`jGAzVzv$HDk-
z#Yf3o51q#-)5s)58N8vZ7bIj9USz}&a7+d=r4CMZNy>|2)&WF2DB}^SjLzmr_2Ep&
zFNaCN_wrD7bh_i|yPN<DY(eHcf)2L$V-upvsEW2v*Us8U<tetIAlH;{))zOCc&dpE
zJlya<xkc3b%`51*d#5Y#<w5-Q^f6QWWgT14ky}K?RwowW_AFBpwfOsgR{j8fsB&d?
zdVL4ZxIg>8NOssxr<Cop<{}V6CHHPiWSgr6YQ$TyNp#jneh92@pj|O70)H@=p3dF|
zKs~!4q<Q+?<`7Wm#VU8t5%zb1Em7Bf_^g7M>J!!Lv#3h=jK<$`9H7<Pj-B*agqr3X
z-K^+GR<(YA8B4XwyGc9GZWOl#W+Gx1LwndORsl1S&12*AZ(FFS%w2p@%Pfo4S_zk;
z9wI_K=h(%+WYuEbq>TRMs#R-2uB&1RmL)5L4l%Y41*gZppgMr`*-DD(9B9d#TX1XD
z$wmG1#st&gk>_B&(o?Kbu;mMdW#g(%wV*Qgrp3iM+(VfSOqRyhhK99hNCaX;D>`+p
zD4T*on1ka`(%?~N<I2DFB{6Z2)7Lf18O@#DTrA=%JyS_B;j>37ED}E9-#KZp$Cp{O
zx>+O-Dobpee~G6{h}N#x^UW~hLRD19vKAPDODB<?It8sB1e&MfZg!DP@9Kj0Q`H3M
z|E-I|QfCbVw!j`U=p)BhMB?HUD`RPl!=&P#`$yV(P?oFAYE%C-G3=gUccv0TA;xC8
z&O)Y78Jj_l<spY=PLi`n;UpflSI2>@vcy@}5|Q&|voeX|unXE!RE&{B)gttMrBhua
ziCVlq>aU4fFkSD^kfqShsM{D?!nz4y>a*Y=DXEu`Al<+JQ-%_rfIJyXQ2vO%V&FmC
zGZm#JQe>nXC|sA#K;L%C@Kl_`p)D9i=n;Y=A+Iup!)l~>W0?HNtX4ZfrOKDE`nw(}
zMBG}b{sR?)l+)HIS3=e=X_l)r=v<a0--#bw+e-Eq)ucAKkPQ-IYus=Cus>7OVM;#S
zNR|PiSv537U{|EdzN+^?x1jJG$z>W>5Hco}7*6}*Kjt)g_F2hlJMgS(pEF37$q}|R
z!`6Puu<BAZ<qA`h(2p9kO`F5Itwn+!Tz%oW9AS8atTfh>w^6J&OF6cqSw~blLrK!)
z(9Aj>hdCnFT&p&yD;`zT!EAQW;2MSO>JZv0$LR1iz#2Rjk2$6G?uhOq>L=sak&kj|
zHh^UeY`3=O<|#Hx(~)J;Oe08^)>_d))^jPjzr2_C#94CYP%q=P4z%vyo_tSpqEfdC
z<aBE;10AJmI#LWW@mDwJ<~bthCH|7<O2<7e^;>`62)+xf6eXPR`2iVwSh)3~B0j6=
zlIZk&3H1pE&F=Znj6yteruJCX`^aLl)Gb`7KM;DOPu`+R<Rm@lg5@JVb%;lreddUU
z;SFGcso@9;L?qN!LK;m#IIcU$P4Z7#K2Bi@lhM>l7(2F9`>6+0Y`;9AVoz}rR>le(
zjuj%|b{_X`QQO>rjS)?tP3jfe3_prg8{wRLWd0_QM0Vxan6(|iBET5i#Z4l)9qDJ^
zk$0&+OC5$I!TL#!j=%d-{~R6#%FSfoG$+@!t&BvKvRpi!x{ix}5;(!qYx%&AiVHht
zIzVX69=&#9Oc`jKIX93$KOX=6ah9rJ2eM_T{jWErr*c%p9DQ!9ghswmB1M#`ku)3!
zuvvv!^RYpseC6ahp!QusN9a(1NL}BI4M<#Bg44@ips{G~ZArGr?83+xp>@qvT3=RV
zpq0$CKV>fHt`OR^nVHhG)~(1XNEhkH5eWbfT7LMeH52KWgPUljQj;RuYOg$O|Cz^b
zR2P56xI$C@NXG_YB_~h@Q)rvX!^!qGRF9?Gjf3&Wulv*XC3w1A@9VB_3PgHsl?CeN
z1CkL+nX?S=DAC((cSh$e)-H&&@olqsL;G2-w>;zpnn6^>-;lERq|SsaOh$wY^TUDB
zKaj_SwR7Ebvpj6vNh9IXwsB<I{Sk0RehDB!G$8VvP^`enXwt08^K}x%V+}TfK;z!B
z!J8h+%0ac^LMl`pT9kmNhk~ekTQ->=y%CC!d`y=ywTR0Hdu;j~pt;s9?Un|bB<Y6%
zGOc>`+izQS%<rv(L+&UV?g>+)1f8?KS?AYa2pZcyc68I~&FhNDLCYABi4aIbMSuEq
zVRP1NPH%lck-oDzpD_I-rwq_N6A{<}lhc~^b8ksLkpVSbR6)I!e-0I(!@Mlvo~>eo
zPx!Yal_d+ds<T>wb#P?zRH#sPS(&<)Imr^;l?J|bo)*pTzYnbxqp9A5(v-{2ibiik
zeAy1lx<evN*Hy_#z3w5ly$&3T3x@4EoXn~RBbsV{u9L5GrV-`y@RfIwyDHhaW!{Qp
z;@vqGy-A%ztygy?NMpXvXt!5AS{3C%CD+haj_>dY@V?s?2Wyq*z19#t^GAFTg916o
z<uDC6#aA$5<Cd@Gz)w~eAJwm?1_bl4J)j5?##@A)K}9<Vc@Sq(uF(t8;%ttLhu+?f
zjy$pwNVXB|PlbA>a_te`mkZbM*I6dbh#2%qhHEKhF`;a~IMqAoD}92tm{kk0yu*|)
zz0ArT))P~osv%B`V|Ldd6S9&R)BridXI^nhj+#T=FrA@DQe+-isZ7ixGpVBSGj8~p
zll)tyjZ_jI0m^`Ohp!5UJ<?pb7-n#g<g0N(7|O#p%PdGa1(fxA&cqSssnZ=Bvy&KI
zDy(9Cui{h!hchIMqlaqY*5w?cXXoz;jJ4IYURzQd@P`WntLPbF^$u$a>TJs{<#?xr
zv`9WvRA5eMV1eZa8J&j5`<rqTxvZ`!frCt5dJ4;`WGE{zs`uCaLZvQh&9f6UrY-3`
z%d?#_6Wn{LtF4|}TfV!_-WF!VnxUK4M=+*#BbzIgL8n%Q8qrst>a#s~F!@SkA(K2Z
zR@tA!x}#cgzNB&P(u9s^FSE-vnWUyU*fZC_$j9IY?Fcny75>{ExIX}#2PMQIE7mjI
zDESxOF(RN@J>0CDvl@NAUQiP{ZzjS7D>f$h#b)ql$ee{`WOB`k7goRzZ#W>8S1O{1
zANy=p>Z-KYbg>Rr^btD^p^`uhx`!q={ohjOSUI`OJ?oUMvosXWNb9i4wS4><I)}e<
z5lQ#5Qjwe=MTMO2+DJZRr7O4pj>xJIWRlNDqlyD5w<>*`!G75~W+7bjGvUvjf@AYW
z2sW&$Y~vjEPF7a(<;}v!v8WYa`3#|8!bQoE63AfXO=ssETL?8VJ&t<f+&28Ies-q~
z>n}(WLmx8CPOp{4h_kW2TrR2Ed`2nerpk^$j+r`4Hl4Lb4v7Q}CH?#sy~q&dR<QP6
zL%VTRn>kuqM(0?|gn=@GM}ktvn3!#WcL(yqfd6_gz!EAAj(qVJ!^xuNN*z_PYJB5v
z)%pGitftcL7f?}$WbBt<3u@gOEP6C`vH5^A7ow7~!GznQYC+qXQ{pHPs)$n(wwMmO
zBxZ-Dd8_(*tDy~>=3szmY-U1OIdiP7J%Xm%O}?3aOgeVqx*1MJuRylnG=pax&bRsS
zNWd7~+M`~_aZ@YhUO~+1$_8h4i=8Hkr5MSKBTz@_+?73D-+ksO(n8?b_b4kT6ME3r
zex!y>9z(@f=SLksTZD3n-*_Um*7O62Evkc$wZb(6U4@Q1>#30OE{G)(`*Bz7E}!R>
zIkO|>u!SmP-Gt8MMS@R~h_C?%pC&sz#zH1z%Ih^m>nh$Dy}hLrM%|IS-jIjg<U1V2
z>S_Ii57EP6nK<Sb_t1viHQjpFI)&em<#BSB_yo;i<4e0GF$82dlqB#dp$sv3j%hVW
zEXPvNlue0JN(#6VjCtS9eKtnVyTx0l5ZijK5Maw*GN*r(NDk<}B6~*=Z^^plj0*Hs
zcp6{)y?<mmbbnUYD0DRMXVvpvE7_756%-m@gBPFVr|IZB#2hl4<UniFehzZV`?t@O
z(4za+%(f7I@tj0pou;hAU=nVHQQDr8HLmUGj5>reYbv18WfS8_yI)c~J1Tr!#46?Z
zu>Ix(%zXw>pkWqe?Uaf!{f%AP=raXkadz3|DBBUWGF>Tv9;%$yP6hU`ByL}0#g#%3
zStp^ipYr0y%<j=%>&c!}>Md_oFKPt&ImHT=kNA`t$Q$z`78#ug38L01`gLiG2`yCW
zkHV^R3?b&7ohnYS9Pv0z?H%*U6Q1FzB^Ald#C68{tb<%uK-ydt4hq_2^h7}hb0$3&
z|D^fNnm0}@y~D#J5*N}v`OlVEBC1*oeu3|64}}5Xyw=$gu?H^CUk`(VCQYF=JRbyd
z9E6PwTEr#ML*cEgrtx!WLc?{oU0g1<GA@m_PNyD@&#35XTbh=JaPmc}fmD}9-~W1m
ze*w`MR!QcvEK_f}exd+YHSRA>@#r+R|9*d=OT9H?!nY(AV1fGv9oiwqExt`#nKD2Q
zSVc?D8M=Hgp`0N`%)hl~(a)mgNMFGCqXO~VX2^1`d5NdISns80JPb%uM>cGRuwn0e
zEry5_tlKeZV4L$#xCOSB7FC;KCDO4Aj4@18TSC_2MK{qqeA_{zbq+^5=zNbzaLZfm
zwHI2|{G-1qH%BpK=FJx#JK>vHR@}(u`a1<2;!%oW0BhVq&_ir^J3xF=O(3X^F=H8V
zPrgcn`72JZD*d)*&9Za_M|~wFZ`&80$6?&@%pWh!76$_T)``Q##Z0}_z+&rNT3I^T
zDV)*yoER?NEchgu?~cTBBNh7H*2h}g-aujST*Mj<c%FH#wp<<gBDgo{7@Lf|_f@U`
zMNWQ~j<$OvM>_@U;QQkR1M>q^`;nKnB-9P*?d$&oIYGw0$ROquY>(@WWZ{=NYi8IO
z2%w$?Yh=^y6`xgBP-s%3rrP`sa<c>gta5z4Q%d|*w$_vaQ(CG0&WI~_6CssMq|-cf
zAu9JO`$$Ke98GXxhBwJ@s>g6s=ol`94glofXHJko9vwu?VN#4n2kio+^ioD+iBcIg
z#K`~UJNbP^ka?IaU@Ulf$I8d=caV8Tr&N-`3Q}r10_M8FqDd3>-7x0YOh$pTR5h5d
zv;dHLZ3}D{C~7^Kj`t-=R6QvJiyVJS3BYRKcdAw{-{S&_@eUWyH{3pq%HarfeNwp5
znu7!uIqduNI8100Ygw5fiVWLmZx+#dGYF8d+#N}#l1G*lrm2FWpW|d$Cl?soQ@vWH
z_-q>ROPja0uS^CxP1<F<NWw;L$A?g>|EJIdN53w^%PU9LmSjcTU+n3uDK3N#fE*V^
z>7f#n>&TV|DE6l`j!74obcq^rLDR~sUQmM<EXHo%(@|fPQ}5$g1<Qnic0J8qt?l*D
z<YKdIPYJ{>iBvU78dmhDo)!TlsBVtQ6wBo}D$HhTpEx=orlv|UxZw(%t0v+}7g{rd
zqbu_e>J>_lvEewDE<QymEn(G422ANwf+)~+0+>n+fxgE$adh0atlmg(87pGBXNkQ8
zN~or3ytCWOJ=Isf4F7-j-Zj>;tGpH*-&||&eNNd`<+7{%D8DWc5*tvE9oaYzt=Oh*
zxlJ6nf#!8v9g&VBwUmxfLrdL1=pPMIi%6gZ0xcn$hz2?)eSM*?;U?nIO4I>|j)9n@
z%p(S3Y;2dycGao#*pIc=9Q|W{-<)&pbE;e}SNYUAXAT|hT6^ueo_p6EYkW^P(sFCv
zG-n&Ds!&@rX_G#Sl0202hDa!0s-K$^Swx?_m`E`<kcQ|}HL)h8XkUUQ8`4fjfJ)OU
z#Hn=@eOGhA4n`ru0#sMNHH!}Qg1kVs)rirSsWAnjzl-QQ%-;e=s7cjjX1o((9UU^C
z?hw-|EMP)vN%p(Ys2qd@=2LSh?5K4Tf_kv9rkO-<5(Xo%KWez3d~eNyAz(ESJ8BYf
zRX>7;+1(O1_fhslV04AV2}zA%o)OKSX%rZiW#9lUY}Pip2~;**@IbW)Lb?uqjb>A|
zvq6%%)dC3d6hH1OGb4I8v_8jECDHu*lS=da*!CVH!j}nW1!&k0f{71KB5EseCQiM8
zF_$ngTHH9>k%T77=@$SGRPmcB*3nJJwB39f+Wa#p*nCJ51JF4qvS3y?rXK;q*eNMv
zL6e3|tQnuY&1z+WCq$N>;A8|@fQ+O7RBF%nxTBl}-9XsVx4L0H$l@x3C>X|Rlg)&K
zkpO6>$sAjcjQJ5d;$b+-qzIHF>S4?&(K|<Aw#LB_ZI|C9gmbQXb)M(1*;(dWm6fxJ
zDlkTh#4s8Cs``O5-XjV=FA}blK+|Ky^k?=`{j^$eA!MeRL`IC?6JpSCwdhD`$C>~_
zZ?s2}AVmfOFOK48`Ay3nS-b-UZG4K+?~XwZYJ(>c4?3pQ(-cl4h!HgTSJJz|;ns+0
z!Tjd}keW>aOQk5-@hC)C0Gmr=g1pXw$u63+V4QEY7Par&Ma^rN+f>19b6XuXBC<Ma
z>xHIf_t{|W=Ri@N5%vIfzyQ8w^w3p<a6KBkQVn&!Y$r6?*Y`UK>S3BP!@NHT@h_R&
zn5|;4fOf2g!l(oXLsUc4FiP1FoUF18EV|X(Q5y@bjB%viI9aR=4dVS35a_(#9-2Ln
zi19MQa34%Kb`$yz>|3|v_oU;M5z$OyjR5^_*=f~uHwaEd@m(fh!?{HnH_()Z5KWqH
zY+$}x&AaTfvUM3LYAI2dwLHvkE?|{}HZpEnFmL?&6CK8<HG7CV@t0GugHVWYr=w>V
zjZfDpYY>Pbpy-Lhq|zkTRAZb`C2l)6Q%1oDAh3l#sh`L@s5_TfPC1-xEdbetP|B=c
z3;>85<ON<pqMfEt`g)`)&Kb!LbWO_H9xOnB=?d%wDZpTaYNQMo&OD4B4Es@zcHk=J
z+ONAZSEbec*vxDpC8lUw1^Y6h1nl!)Psa7UgCSEws?gL=1ZZcGGV^aPZBi}3w?d#D
z=j7V^b0bT=h*2}~?CqT!IEGp<&AROYan7PT=SVSrm%>nG+X3FVO_gE@l1iIow3h#C
zq^P1Wiz5|)DAv(}LWDaWF*-Df!hAxfQjz&tdIC|ipnFYsleLpMo5Dgv343Ipj~z8S
zq}MJwX?>m`Q42e=Rl0Sx#ZgjVfiM8N83e3`nJNGPRGAPAljOjJ;A~YN1?rLbRkIC4
zOM-<BVby5DYp4a9%zQ@h)`lrvSo|laK-g)dw-!pX!E2xJJb)}ZG<_r{7Bk~#wxMp~
zhWf3y)1EZ+-8|<xOEmP8?5y*fN@GMyH&ND%+fxHXMQUfUGszQ}--k$w?5IyD`hh(l
z#DZ-yuOrjf*~5mCF}u8t^kl(HjN&6K*kn{!z7+z|f-;$1RI)iXn@o(iqIJ{;gUAyn
zBnp-IseJ@xMCmnS0ur6TRjKG$6oS5k2wX+Bi9TJe^JAD7tATXWU~7edZqPeIHH;Ig
z{=*gmOxtMw!(f#0xUt<}A-l4`c0@H~+E;d*XbbJ<6Nc;R9ll2fc9Z8A;sk<EwRXNf
zw~GcpWfmG^J9I*yZ4%CEB)$cSZVF47NAFZ@S8n7?|MmDw8*o9$WDzBWvwT?EWzLB6
zhYG*A)Ph;q+8xs89sO0A_xEH`#)x7tKYo176C>=xhdUmH2zNZP%&TM<&8FPmyvSTU
zgz2d_(}wkC7fqigA5pFmgZ|4Vrbv7CR@iBrj&&JSxH_i1vzswQqjWQ!^fY}U@;Xor
zb<<|7S6UA>2r--~$z&k4*J{+Wg68XqUUic3G62*=%%;7GIUKdNV3`dk?a_I?BnsHX
z-&b;B*)GX){(vlNFwXNXyTv~4q!&lpb-7&>K!~pq0;IGv#^pJ(B7lK;_-5<c=w@SO
z-~vUnp&Fst8zhy0PCbP=B{92Gm53Ko5TcMIGjfKjkG9kB#3j8mMYi9}aBAYxwyLgt
zd-qtej_zC(BHY=?>%1V@MODK|_EA`f^YDrCCFWveGJ&D4!DtTEUg(f05VN*98W-Q0
z2Qlxc1FaY1XI_<G-J9avQ1ZdmP}(t@agu$OJCA5zt44Y!()kLik=PY*d|dZG90G!w
zm7I<jT3Z=5WLFGmyyzUy&0WZB!c0&j-a*C$$2kfNYm6zq=ep;SObez0tU^ysE<}$7
zW5PrHb3+MC-%fR(Ui&UfCd-uS1id`MJ_Jz$deKnNoae&!RVcJ3p!hC6WAufZ1(d?u
zRj#*=y53F9(4)@i-A%unq6v343K8yH1iL6A=Oz8Lo&u3<ZxY$AM}C4HtwzI@8t}w4
z2}unT&1NCBglX_g%#K&FR>hMEFZ7K)%-2!*DV(JVHWLa^572bIO#j$B*ABpH)VnR?
zWd;LjJB^bhAs7rLYk!cWOQgV_uL?lFyYJjbRh>~+vN&hA)d4^=i_FL9?F;IbfdY-j
zkTMbHGYF9-S4e2hNDZH%U0;%nOt;>5BDJ=pMBC?z#8SZ`8oE6o6deV$>C)U^GK!kj
zv`0nZY@Chh;t}-jh&_dc)Cem>nx7c6P4qXSTcvL<YvGYLks=B=3$teM{DaOi3K8yL
zNG|&_yJ$8or#U84W;R{-$ZrF6X!}u@mX_*H{=e|*z>Y~TW*u_GX&!xObSHJsvgQVo
zO>b}m=_ce@eT4NOQk9}gN>NwVBLFg4_KD)b5L1dw9a8JDDPwIwfniNHA=iB&m`>UP
zT(eG0O0VggsM6q^8e>>(+Yl+gP^3yKC|@ANdm@*8*@9FEB+<3XF5#b$UlFaWsuV+l
zARv^`ZUTui^_H*;ZMP^@D3d0fWuKydW_>rI*`G-u6_<&L_TC~q;~mX&?Og~W%^M9S
zvqL-qB}K;PsaWJjdfBE0I}(KmcQmr8yKfiGCkA2Ol?l-<icA`23-MXpauc(>h#rq<
zBSUtkHDjUe5Dr=i+RQ;1y_FIoMRjiMrWB#8g`JO=6Ef5D>8%=Su;_Fp*w;`Gdo6@u
zX%)z(Pa<?^lHN)IOzq8+?TIN6!LONdRoZQswaxq+x8*tti~}N}00`R7){CoySj-h+
zbRtSjx{o4VD)S>!0x7EZk(O4GPDlt1hXEin_!ipHg6R<Hjt;bHo-yM5ogo=|+3R1M
zJ!4sQQHI;&1U^`6vuA_31Vrb;7;`+&nLG8dA#7klz2P}4ej5cl6om+PD9kPzbs^`c
zXvrw><m5Lm4UuNrTpfzpv}hULp?plRf4c0k+yg>tQwU0xRHm3;t(!7A2(u}y8qB9;
zR707qFvQWQ=IdEUfk1&d^^0y8#9Cx8$%NqAu^!opt&i0^d*?9Ej!K{lyM;iWERXaB
z#4-m7ea$ERw+OeXZIk~G042&hVgJ>4Ko<T)ggkcu66$5=^rp)cb|6TKR3UaVnmX+<
zLcd{wR!tKbK$oW}Xf^mndpEIi>M86vPjz<pwV{O8>7E<IXc1K(aQ5r#I~+N`X8<K+
zW(T7X;Z8-5|1$HYBqqz0+&UIKnO!vKh3uJJv|%qiA@ePkL_1E99YvBZ)GUZ9**}AU
zG&shT#OtInfmF$CwidD}Ab@XF0t!%NEhZxBxe_x#HI%g_&c=2iGXf6!RF|Y=7AZ4_
z^%R&73x|kiQoXq*6o==flj;$k#AuheJ`XYN`3M8$1je8^g6bXYu_OA=EO2!Sit)2R
znb{GU-xUBMYDNS|hSPZF!HpNTten;qZL+hE8^pKfCd|sp%-vsodIAJa#FObUtY;!k
zOF1d__B7XaxZtJ6tl4}T+Wa#p*enFSrAwyXB%fX5M@YmuFAZ&^%n@o@APA+vl%ALz
zh#DXxbQUrbWTI3OmIITyDoH&-2$M<YSr5>xv1!y16j?A`$b6U#V7Acll8;U#fb~#j
zlldISId@>(Z#0~)N58)4{A8<*Bhsfmt1JOmp_#-e%c!z3Sk&cIhPx*XH;9x8%boyx
zHp5&UhVR5Yf~o?2AeahHgoJPPOE!(DN-<p{MQSb2&RNXT>#>+F)W(PuX|fokWV$7o
zawkNb7VPfrCjKCtHTdm)7a8aE$0yZ|ylzslj_z0#BHW3vvTAd|qU#ofTGewdOf)Q;
zQ7wh;M_X&yR0w8HnS7S<M3wCUbo~SgdU|ih&nlO3lqz*S?8d=Ch$hC7Y7$|b*(jPy
zuM99<rhwHz1n4F`p;2wbYV}a3{^$;rxc*dCV0K+VRrhtCL~&-fHtSZH-}msUdem7n
zqhb6s4f7dsDr2o@%6`wMNQzM}rY6JYER;~5jpCc$#f1uLdFgFZqz0n+%dVw&?E%h(
z9DLvE2{9jJ@1=?|QS%OaG@F<%{t$ZhPtmK)&LO{uVjbPtC`7m;(F+aj+eOWyrXhUM
zg4z>#UPzdL>+jkt1*TnPj7vM5b_fTwJsbj|vh(74rx%N>nJpAB{u52B?;YL^(nJWb
z8p>>$-PFTYRs+njooGPmJaesgB?hclmg%E)ao};M^ZbYT3E5@ApU7x~b8C9lw?#{a
z0^#OXL$i0so=S-Y`|Er1F~~cMyUF=4f3>|ytzr%yYyt%$*P75n2%zFma|9a`pILH6
zyt+Vj8Y$ZP{#Qb?Qin)S7aW1KGJbsnXBh147bdB$xn5rOtBnsh^WRv(4niTq9S19`
z#xz-psW(Iy9k~$&hSuZ3HPi1bn8Ipu$ziih=v`}TGV7glA$`z?==Z1#1$3?#1rwSp
zsb~nIvyOu!!vR3E5@?TAEq=<#qXM{fL^W4;EubDkfVHFZvt@_~ovx-ear}BD3d|BY
zHl)Dw_N6-#?<V?E2M*GghPf5g21_#oG;Li7ShEh>Va|e~eV~UCq=2Etl?1UkmtwDe
zK`llqYA&Fl(#IG!DhD&uE0V#%6NFe&d@3b#f}4h_3O^#YgxX6}bZ7Vx0EixDI7ta5
zO5(Omd*;$(WQUb>md4}7Jh~H6h;T<DGm54%nl6)x(hqo1rX-;CwPXD+f+Ai=Mn|Ir
ziyuV?1QP8#`JABhWav^Jn-1!^i4zF@%m>4)CKuXKTyP)Sq~!)^SG=Dh5WHxvp1FVk
zC>!-WNTEFU_?XEb07iAqYIdu#_4%5B6RAd|gP!=)TIc=oa%6?*rzL>VZXsY2&={rv
zxPiE4E-Rk^;M-hpAwJZ2AA9FYuf$Av{0R?5;f9HNBfVEEYo^TXh-wSXB1MBg&!=3C
zIVWf?6WKSk0wKOeZ-h8Uv24OFXD#S*gosw3iJSM4F{u4<{l~>R`ch*yJL&(Tmjv$l
zhZJlx^n+aTm7&LgD!)8N1^{VxCX16m$`O<}$A(GLEM<V!R8!RzrdjVnZ$(65#nl+t
zNSv_se&+qm1CUA^yDRh6RvQIq*L*wne#&;mB5}Z~);N?n&s777gfv<5lO^A-v03Bf
z7{|vLV|=PXkL_#^sI&E%tUx_HvF&sa{!Yk(;UwqeUHoFgtE*);#%zq)DyFNLt#Z1`
z*{WGG<Axesn~a>9K{az9622AR!FTA|NPZa$Mhk$M1^^*xMY;t}LJoc|`|@C!wCo8H
z5hs=O2`RsSNo-2xq;ldMJoGQS5Bc{Y&cQi2Csn1U*l3nz{*d5ev7&S*a@$5a5B=R_
zG~FAvRdDFgp*O$z%?A%2+`D)0U3cB}z3+YRB!j>H^{<QJhd=z`+^66A*0=7w^Ui(y
z_8mNU@a=DZ`=gIOdfErtLMTMIvrt|6Rv@#B0?E22J_W^usX$CDT75MUD`}->(q#Iw
zC;xn|F+vTb<jIccEOF4D&XpzwY{|}Zmh$4&QW__%O8nS&W8aOtZtPv9{T!g`km0RO
zYi!1B*Em`7(<L8XtAT`yGo}IwpdREQrco@Q>QmjRQ{V}2z7k}n<dnnGO>{L}Et<Vx
zw>5vAtzx#yW`cHtW-@0)&66eic@fr|DXjN|_n?Q5!Jmk#Sm^0JLdd9EO~cU{=uo7R
zc}3WTos!n7Hylf9K_yZdDbntG_LE7!n%YV2P&=urzI`=E*qjJK##xY6Zf{O}D-O=7
z1(n$$bAk*51@V!sy7KKO{1(qWeEZwqzUii$0DSnvAO6&*KDDs0aP!SKKltE-CmMgl
z4L3aSzyl9F@WA?yzV@}R-Ezw<!{P7~pZLVbKK8N6Wb)eAzV@-l9y`4QZ6V~<6AQLK
zs;k~&DG*fV6GA+kEjtfToQDvO0uM(KkFZ9lBSCSt2j>M=J57@x!uoI^Z!6=pPjM8X
zb71R5;)W*sv<<IDjru92qC+ISz<=S>K(}xe1e~qpfu=ee#@EW?XjI*zC-vgObY;D6
z=ndWw8&P8-vwEof6x@LT^5zms8Zn_l5-;`xJ^>5ej2~r$2LRPV7A#}FvP704FOX?{
zO1%$7XM75cnGcq++`-<m2fb)<wNOM4wxGj|GJ{!_LLa<|Vk@&(-&>>m>4?zRmjdtR
zQuXr%P}unpgKX=u!I<zP^60JCXNWXx3t30+xZ{ok2M&Dpv!8X&0U-JAcfb3IC!YA~
zSHF7l4MpS!Kls5l*IX0VTyxDe*Is+=efQlLclEZny=^oaeeQFgdoc$(IsWsX{bw&`
z^B0P*zwG~Azq0rUcN{V+CCn$6&!{O7RQnX_gqgf_AmGwtwJ?NogiS)w1qg~Koj1A)
zPu%K#3~hD2B*|zpQCZN>g3XTtNEI}w?WZsM+KEkLDlX|Ni3w$rQ6PZm<C?BefLXdB
zIxN1;aS{qVxsNcm{Eb*W8uhg@VB|;ui+kr~P+X8Irn?zUCZ3CfrI|on%)}Enj69c_
z{Q4{iP+2h7g?$#(?V|BBH%0<*PSj2*2(c|u&zS^dA|6evPu|3w$@8lYWG)WSx}!$#
zCx)xC@&xRCndz}aK=eI@Y5+;e_$NKcIfb@uzwwQ4Jow;)&cv~Zyyrddx$e5_rqk(Y
zG&=d_Ii7p&xgY)LM<4mfNAg|WbI(2Z+;h*FJ<uGclhfb!Ora3r4uYl+BBMa`E2xDz
zR$pyKiPem4wu1|7H#a9yf_G3T^pW!<4<GH+6_o^HW}DaCc@u)#o=_7RAyB_hyJitI
zE>f)WLS==dBe&H9jF(Km1T|?ML}b%lol~Gqm~vvC+jzY_B<QCnolG}OLtI<ZZy`#+
zs>X14C`{MWe=wV85{phvzR^YspqoJx0wFR)(s}Vq%@kq0h{&U`^$c<iIRz$xs3((1
z4xsoJv|yQ}2<^ugnG)8OKE&4$AT3PPO!%tUAaJ3_g@6_~6D~QAaJ64{Ms-AXf!RH?
z0Wt41EC{f55(*C=KJ2}J#VcNsue|!|s{uUy^wU>fdF83^YH4ZdO>cVBb=O^&uUuSQ
zJaXj7nLW@sh(d%r2`N|<7B6q>^8qRZdty<&PbugirNcw0aemS08u>{G2YMeuY%)hx
zZ@yxq#kH;UsF_CfwAf9U6P{FY4%3yD^{fzJw(JvYsz?Q_?Zbu?81F$?e-fQ{atT<k
zlYkp;esWcVJSCr)E`!N{3IfC3$+e}eCwep{`9h>R&PWO!Nw~^rOgD@6&x``+6rto%
zqw_vOdk7FvLsH=cBC(*FF?{4UvqM4+m9)$X5n*f9!B2u*(q;FjKPLQRDHeLJ$iC|S
z;9M!5{OIQlmY0_S?B2aQU%7YhUI44Bs~c}~0=(>HFZ<G$zBIS;{`>F0{`%|B?19cf
z6e8SNNKf?=AI)>lV+z{K!!?)<5P-R+B&j~X7(pr;9jbYUVVF)uf-o3u3|&l>)xsR^
zoX$ht#G62zW5GCs(p55B_FYDJ!EzJF0H`X-*+(*C>FRT)Zo<fV10g3HWy(iHYRqTO
ze5X+(o_FE%5MW65H|t|~%{S4nWV%c@2#f_l>Ro;21I*?Ldrk=xd#ViEwIl>2AyOqp
z7-=t-+g64%Js0XM*z-$I5qb|K_KFTUL|Z5|DKL8GKu;^fmYj2-z=f<yAw}AZ5dEC;
zvl|s^(?Hn8roDC(dqEJA@(u&B$8RmtqfiU2yXX0`&M8R0u7q=ECJOR_2Ojw7M?ZT1
z{r8{k18q7A5$+TuyC_ts#W^;M+sLG$!q_o-@<Qom)rf#npbl2+sHcbz!;I&QO1)<n
z#a|xzA0{9AsU~>~Y(qQ4$Z+jy%o>O@sM$_!3UmTj>HpgCF|8~Egs>XB$|wP|{|9+r
zyE<=n-&ZL0P;#n^`;W_W1W6-ZWRq`LsD@a)K<T9Son>#sM^2Su@9SySXavUUye!oZ
z$m;H7>M$EXfUQ=;BSjPNnN(&nqFSngZX0tA1-{FFJ26;Bt(rYsXysy*3LB;X7OaQS
zm2QIAIVlI{-h_@A;RlJ&eBA&5AOJ~3K~xkvQJus>t%V@~3cSzsrEXGP_4e-PTfjPc
zmhjL+58ZXwT_5<s2X4Rp_Op7R*>v;s2n!MJ7)0Bj0HK?>`D+LQ+Wa(S5T<8u>laAE
za_2*6g`~Xu%sOgm33fCBWamXd_(*<v{<jD?>mcy9!x#|?zzM}kyV`lEv(QC#2nyg_
z5_|$ok9%>c5?Q!nm)TAurCIadw9-tY{n<04z`?LLYp<ukVc$ARn1q(z_-d5i5*Qy-
z51PqyEbeo0532vNZ{<V_%_^l1tOh`;QTpzqOw>&h9V!`!fSsvBf(}ux%~PORI5m~t
z#dynDJ5AEVls-x^Mw4nlRpqprnug5ev7PA$W#Kl$pcI)Lit|VzwgNz06(p%}J~rOu
zpU>?G2#;(*C7#&YdTzpdpNli^{YeI&3Jx7Qbo=eM-+lMp?|a|-&gy~A5fmca5zw+~
zy-17P9149jmM#vEBm|=<wB3;!CMqPocv7Nu)WT#OCFIU0+VdIz0U(=v|0!T6s=81V
zn*xE42GZ=IozBVZxJM=m;i7QV*O*+GQ(ZNXm1l{JvjJ3fJUh-!f{`-E>s?pUiw>Ot
z1orG#$(7%;!6@C__$dJi(UJKYV7AKqJP3^T_JrWvf)$+0MI@Su?w&w33L)=NP-eAb
zqFoe0u7MDCP~V~0{qr$`W<HfZ@**5kbf^z$4;y;>a`_b!69p7D9+7BILPTb36%Q@I
zJr^UIwiW;qE7+!+D)v#fX}Er|6pOh!w&x`F?AZfgX=!QSzI}1!@#Dt<TyVh!r?<~T
zhYsC(>#euka?7Vb{pn~6JsSr)cTk9M$G|*r*`LkS`d>cx4w_!H=Xs=QCdfVy5MJ${
z<{(U}Av9OgHW49qJ}QK^Gm~lB$~l#We&XXu3mH{2DU9u!Rd17Mj{+sT&=?vMG8UBo
zvS-=2SXJ@5=g2R66F;)M&}+c7Zo*zZqRMJ80xT+jvJ3#{@0U5wQ?jzQQ0eRGW3m)Q
z3JDqR6(Cfo$rX4+rnmt>+9^rx?<lpSq+l66qM0<KUeuLQ1?rvHpqdQh&nqWI5mfe+
z(%QmCkwP>nDdDjtkYdYqS78g8_|sC|VXF<5BC@bj5vw9%#kkqqu^rI|b$ISuNB8gF
zU)S{`k34e24L8J<KmF-Xopby5?>~(lKK$^*x7~Kz>tFx+&wu{&b>=fT;|DsYuuWW@
z1<wPsXPVtAsDv1wqJ^#0F3OnRmuaRjd(#IB)OjTg$YMtU&rp?8ESnx)OOJMB<JorV
z+e={*5Mei=pZdsx0yxmY(&`26if>ohuCg^23}!M1tsLTr$r7haoGx>^%<)l<k8<rO
z9Z(A^VI`KQO%5v5_7}8qaA*z&>940*00D+W3<vrb?@;=)Npv{Ea3q5T3`f!U2-r?m
zp5e+7t{maYGhBU!lNC-^SdWwiPX*Obs-d)Fv=hu$I9u+`{;KNiiw|q0f^#WYv}@SS
z=o|W3uY3%1@`GAUPfmfDBfl&h)byprzc`CPF;gc!=woG3WP1}3a88_)s*?Dq(yOMn
z?&l4y))vaJLHRHIo|75D_%m$a^v_jDKk3}ucS2Emj$k+(-hTV-fAS}P60MXZKmPHL
zzu^sU2sE~`vhw9GfB6*m_VB|G-+Jq<H{N*Tz4zWb81y2<p7%go8e9GX3Z55g7o~^x
zt^uXXQn@lAn7n{tVvBhc0DY=NV{RN}JMV2<z^hTzIMQ+ljT+TKNR44+qs_&|nS6{=
zPtc9MgvJ#X7lSmRQ5>dANeYP|R3VKsbZ#SEIm);OY32lic09p!HyCDf=X%&)qRkV)
z-iwWU2*k8Bs`4f<SV%jJudC16a{)lXt_x%Oyq%<4UpI^^!E7anMG_dCmz;~%+Ayyv
znw>pCh@UaoxCxPZ1M<U3DKHK|WWi{J%zS=YRt6y;DjYxSj?{aQKwKFvgPyS&J%A|t
z@>|rqUEw)RoTcH1SeSHIdiRcAa}y=Tk6D8!5V8eC;RiqX!JBWsd1YngUGI9AbMA{@
z{NfkB@P%0I<?+WKzx(dHPo;v`Pk!=~+itsU_wL>AeeZj}``z#6ABD<lCqK|>qb<QQ
z1uqHozqA=Snc3t#Vn`<m7bjbrmQ^oi3NMcu^{S+_JrlAJnAXE`2NMfA2)v)Be8KRv
zt|6c_@`Kt6qg@ncCY`Nlv})8?&{T3Y%#AZ@jHrwwBbiiL3#Z%=Ihf0H?^hZLZ-!O}
zBcG4$1xrse+fpDHEP%kC0}?ms*+rR_<40@HkwCqm;}<S)r!GvondQn;s>Q^DcE+mt
z^z_0S0+oQVzb>Telbr3aPmsN3)mc4t7)`IDM+vzJCK&@!Ni>9JMb1dTGqd{I>E|Ic
z6m&_Q7~LYBSlm*o;9{mgdC~jatey=Q`&MJ@%&98%&BFE9U;oW-e)IkBfBzr+!5@r9
zqZ@C$@vr{suio&6H@wjO{KG%|!{Nh+4<9~!>#euWeH3`~OdaSPM5#5p{ZU=@7L#b5
z3O*rHdV`-UC@SdGP^in%5$HqHK@kF7swV0v)Z(Imm*_YIEI@`LMCWxT3oPhU5g9-6
zN$^RWWz{v<toX=<Hm4?eFg_M$)-WK^cP{>xf*h2&DG#-o+&07@Z{ZsZ!*g0faM8ut
zTVS}5xi@u8#($BF01EaTaD81U%6#TH&7VqOL`&tx%)J*%siksj_8=3*96+F2u&tsk
zv@%8vhDzjbp^}jr$&&3&i7HYZqp33&g_Q8rq_3&IjJ-nQ_nZq#dSUAm9mY?S?u=xq
zB}2ofzVq{+&W~R=07|84Fd~-=!&gppKmW^<{ZI;C9DeQFZ+<Bc_np_x7Y#sBgxem$
zF3J$D;s_BDP+|xu1(};mO{3uxA8TQU=$K%`gd^0-sty&2p$=WNog%UzLepKNJ&R$4
z2-y%qb}<bD;`Ir<9eZ|g)?W~2I1^&JLVB}~_6=&Q$KrJpG}9<i0Y{Ie8ma;HM*i`2
zksP|o#RmXlv@Ulr95IsLis{h{FHw~mo;0;|SFqSYC>V_}J??XwJnw++B^M?ZPZ~B<
z3+v>VC!`t)f#Dw4H+b5~Fzq>@9S21w7{Co(x>{q(xS_JC=}6xqSQMhHjJ5)mXffSB
zt`DLR0uhEd(iYMFnbUuiar89i3z5DO9+}ui&6ly72lYIXDix`NkkeB#u?YHjQS)~R
znvAdFuZvxv@>Gf~U>z-ZktjsC-65I%69RM=nGo|9G?A=VSq+f|Np|AFApY2?doP52
zc0N?!76<r@IN?KE2?*gWtTYf0$%cA#uZ$=H@u7$)MZgYX!7^d)pDlX;)Iw|wds<zJ
z9y0<MwixQf4gk+A<t*?b?w<&NrK5JBo~;fLTzqlz=SB18+EOkGL15p-^J_AFC<IoI
zq*OwRoOeLxxG*qZ-*S!Vac{9L9PDwChjLaUAhjANL)lV44R%TpkfF>mVx&3|p{Q*;
zWU*w@4aitc<y}nsv*!~#VL@fpN?|e%YK)D0V<M_(Uj<xcRTIFbL!{VwZD)uk*%%??
zTp~sLg67`_vDhoy7Ji5_Kf2&dqbWYZf|meU$Xtqx5d>iuCZ8@&St7RH5kf}she$*K
z2;W7f41Mho)n1qSE}8w4BJ>koZ~{%P07Te@BHDrWJfPvAm@X#+X-Hz69A_911jw+{
zN%gri#CaQHz3-rMf$DMLUH~|LEO1A-u>f%KrRzNoa_n$4jS|2Gm*#V~@=jbaTtu^y
z*lzJ6WJ1a~)D}cktIv*mn*DgNM`WN%I;KfLO{PdEOz~4oE}$tz=Oly_CsSuQ&9HN`
zPb(q!3Ctp8a$le_KcJsFGqkpdKTR_S8!P9YIn#^c>abx?DcXgY`P64SvC|64^(Ge4
z6N{0#!w*=cd@u^@>CM{-3bq>x5pHK#S+xLf(^QCyiT}YnorlE2L_-^T??rqHpJ8XM
zm%J#0TF9u=ZP{gQ2u%pG^J@GI8U3CBoY2p_Zz-X0j8S0dEWs86IsrV!%M?vS#GoVP
z?9$$;p!2;G2)sz(@=J6UU0z~%))=n=f&-VTlmfB1OQUJ0$BpL%1om7aMlg{zXmc~x
zo(()D1Qst!v$7dn!|_FeY9t8hrsNDH>RtL3MniyNoki5uU}v#Al}p+S<{CtlVipBz
z^>U)=I_EQU1Oj~rVY>2IXq#YX=LH~c;$cq?^O_H?)@=hrH|++}un&m?;<KSRbe*+d
zvL_4)4+~o3fb0ONu6jrJ^LtPACsMH0P>66_L!Zu5M1cnF1$$=Fg68ehxsGJaub_lR
z=3x_dU=o5fcMU*vUYzAlc(SvooWO!E2s`?j7l562!T2el$861>;adP~*XUcNg?dH+
z&mBK^?Nd1~?%5>}tc(Hhvdge*5dc<}pmGG*wF`h5d;=&D96y}wqI)h)`47l^gkgF7
zEG<<93l~W}5;Jn9u$nZd1MRA(W=Ejf6{3R@1-jaNfsD){B+zOO9%y9<Y*=P>RJ!W1
zW9r_ZMq2w7rVyYkG9_ChVu6}K5PbTWAieSHplOIzodjjq!9-neWDtu$MtFd$K=qu1
zLUwACjVxZQqdNeF2)8Xlm<;HxNRkj;a_^y2{pSSC=rBB-hZs&ZN?K7ECYxvItfXVQ
zF0F4m!dgjmjO+b4jE6H86tJ;|@@N5Iw&s1K%7SAaU)_4s&+#=q=RN1ia)_f50NArf
z*B^O8#Ug<H2hGCCo?Z0#Q$9YY?7k#e>twJiu~+<S$85%3NRSv^ut5lHum#3>yj}GK
z+|X5vj@EQ3oB}MMG+0|RUIbfpL&~5>X^dVy)udvcLS+sKl8a&~^SK8OdUvAvG^~hZ
z=4wgxV&>yzNXtRYZN8Qv1Xr6qR?v1DEJHJLGTxf}Hii9n`aU%A3QbLP%+~ugZWXkp
zF>k?H1VfCBSdM%L7z>7oOeYYCZxIDzV8k%LsSrf)6bihmJ&;`|u|s{=h5SOcYDbNc
zq9Q=&ed{%e9$@Q5z$v>%jiPMPtWm(O0mh`m@#XC><K!&9=R8?nQd+t6phSvUTe5^d
z!G)K?D)giU2xcp)wFbL3&_i)b2QWS6!?Vor0=HhlRHKv~L82XN)*S)25bKkhSyEX|
z&8NZmON#GI<OQQ>6m!TZO*zu(PBgXM#d0&&N+~8qh}lAu@=K?mTS3EHi<gP#EWMDa
z%;N}v9?pRk%q7jP!yEz&`fgoDKOmJV#qg$BN4GBu5pG}T^RZH3@cdckgJ=W#U;;&8
zyUv=mNnl4!H1zWnXzM#O+G*m13dhceS~I?(6S^>GwrUh@0|kQ9Wrm;_Hs~f?UfB-(
zw;>`a9=upqj&WrT04TWRphU%X^eMAM3ie%Q!Jj%%0IVGGHvh}613F)uqU>RM%#)}V
z-C&Ov;f&dVh_7*bq8o=08@f>iV=q8c?1R6I(Qm1O%;=Cn3?<clTd+(DoXK(r32S~N
z@rRi?6zy^{hhma^UX8iwLfUTr;+6kMvu$RV3IHM8#yqjYc4pdlW4mjzHM2Y6n1Zd3
zLWJ8B)fI15^CrS0FhvCLaK?^4WzDCGpwNK4%p4k`Lp_A>Z7_$j^AgIffoMIPPqt8F
zL^go}*{ylaC2I)4PklFokkjKFI&5S9TaPES=nO8qL;$QV0RRQ(@3Hw-0OHt_N;DT7
z3|fuJrv(sPJEDOzyAC)2gT<_Z8luY(&9b*_dKsKQpEbFjLAr^Tp|e_RIrEtzG#Mka
zco}MH&N|Lp{~GJj!~&$5DYfIqqA-?1TE~>A>dd$bHce(|&2%B+&5iri22A4mdswd*
z+1ZnUKv+cKc10n=ZHmBf(pd*T2R6{YeN-VBa{HKvhPI(<nh5DTaZs`hUciu0VTltE
zqK!h(v+)9mkgX3fGTqDz;2eF!W=a9N83P4Q*LD#9t;dsxjS(*u5Ua=47JA_F)Q^KA
z)8k4UdoGDQmswCD?HVa)#(rU6<T-9ATxQFfSy7*#T#4Z%+|VhHCea4p1X>E+4aK5q
z%-Ts1BF=@tDXTjZIS)pY@il40KHEiWs+Rhc(6zF&Fs!H-^^E&bGw~ya<cgsMsfs|@
zw&^0{C2IrTOzLHyipfoC0k#$rl2b~&%vnV75f+?1bQT~^uoLes`aL8<08T6}##qgF
zaFh_u*>zGubz#?vr4=H02SrPX1}Vvz4{@Pr!Wa+0&%6_|WxGZJ{EXd%?U>U^nNbp+
ze2M^m`IlTUpFZ;o<%Rv1$M_9E<oIEY6y1Hv#@4y<bLt>mxbS)U$uuk8jf6n8%bCd(
zh=dePqn70E8!h9BT60d}oFu}_s-t0kWmZiMF$KPtlAoDd)n6EBEV!nfmZ4?aMGBmA
zNva7nO1fz0B*YDjn*s0HwJE^^Hn{)LKz7k12$&f*lmZgauhWYK+XaOPw;`%4-V&;U
zKmfKH{1Rx-G6=!e`tAb06X)R|0(Px16deV8o099>7O|~Fr_GqqYP_g(^ph@lh&b~A
z#QSzkC-5`+30ID8lTOxW13!L5Z_Y3MatK?(v%esLi>?ThJ}st{%ZF88?Y?AV!kYv}
zBt{qNf9-lff>kqn6#(s;4}qiAVrAL?MuC<ck)_O=AQhpv0Fz|!R9B`M79_q}Hbr>s
z(mFC5*hrJMn<KnXTqZ=2#wbwDFU)fG!|kzUqeD{Q1GkA(gA}ksVb}I<96PMz#W{%7
zL|d$*+Y*Hcw<9d9J*1`s!8F<hs!Qw`kYZ#=--@$*3Ex4eo3v^UWowF17*>kVPrAU7
zp{)cub`vjPyFwuf1)e${`LPG^ieGl;?*;{vWu4M5JP4mzL<ux&950i=`Ioxkc`1)j
zduUO*siz2uYQfBUCz$BFu`;4tsFNQuD6?9qg<xaRZNTaq1p8>Dy<W;ZVzD<#oJ82u
znTC%hCYxiyaAxa_sH8w@h``yNn+~>NPb_+$e0y2&j@<{q4Z<)@7qQmUj01A8)zd53
zrYJ<XJt4G=bmv3}KZ}k)`X&Uzh!fL`K^Hb+jziL%e^Cfl<g9ZQAw<)`QQ!selg>Gc
zup4^^b`$S_X4yMnwNT(`;U_=#0ABtp&ZcB}?g<jycezz-g#cLC4MLhV&ephVzY4@S
zRmaJEx};fvgFRLHAbApFy=>{mUGVnRd+UtSVtPZ6eUex;RSKm(VTmd~J4)my$rPmN
zNH`G(aU|GrJtJl(U@Z)DMh`a6x=vd)opM`x671W1^$rE5G~Yo$H9&TrfS_%FU^vO|
zYr*zJA;Rs3>Wa4jEvgD3+LMhHR|DA6du`3e)~cfcT?-f16TTxuff$4wL2>l6RyryR
zww;I<&`&!xijI9KB?_=z_G~d;E)@7;@zWpaJ^VM<1d@}Zzt9Yd3oef>WVJTt+7S&j
zT|A(M@45Pz1ZGRYYAS=h)!fYPhR%XzKuR|Wa*r~olBkMmDOoQ~J609FNVI&K5KQ6^
z=$lN#Q&<##k`fKs4<Ch9G&QqrMwW<lsNCslKplGmurUtH4ZlDyO+MY8{u<w?Iob^X
zfFi!3gxUrrcJvIR1j`hh1qdOPMxC=!i<*GGag}ItVMwAE!clw!tu0J+twx7-Ey!Rd
z^|MwS#d$WGH6cRII_K!uI#zJPcEyWudYqF&foB^3`a=)k)i+gycmaW>UwA_HT;ZUz
zyTqw{e1rrS_V@EH`tS`sQJ-H$d!zXR5yuB=@lygMMFy2JP}Vm}s*JsIwHEirL}QWI
zOfn|1$R4v=RTlzqp)p}}Rc3q~)f)(PSOdvTND8W9Tq6KGkFE(Pe!_cA!k@rd=mxPT
zSh10AKNKR|R;aFc3u1LNHX7mJDqtqgsWfB*%>wkGhZBfL*TxEJ@NLYRXVZ$KR7BH>
z&<XvlgHS*}?wn({;ziIb`$B<d6^H)5190t4H3aAF6$+XaWsvhP)s}<|eUl;GM77!I
zqP(Dt#L6-PbZcq|b-QZL7iY0W({_I5!-5PQDyJzEz845;CeVKRyfK`52XnVy475SE
z5NR^J26-2_t@U7XI)c_rg*_HbzQ(x5TP$cbOi`oZHP}A`e1nj8vGF$`Am|(2ZNc_J
zA;N72jiu0D1+D^S7BWNnRzmI2%AuQ~icz2{9Hj=E)>RatZ(0%WDstAMrK`N3c@K(^
z;|{`ZwWBK(_>$rWf8PSQ=GSY`3I_>Rp6UoW?^37FKY%_AQKm<`Kz_r08&o0<=vE^m
zR*_Ki0R-Hj(qusodXSVVNy8)o`yn%=We0|^D`YZGUj>X0ZYg{;i?2zvr$u3m;n=i&
z!)azCjVu@nqUSO$XF&qh5ES?p6jT)`=w=(=CLbwN09IGMv-|m9oW?g;aBiXy;r2oh
ze6E7?5E0HG1Vo*M;!!yW&`ncWnXZ9QD)_cVqmDoy=+Kd~R)nth!6O)0Pz2p-*RJ?!
zp}@_+4<Bd&{PNAgeWfoePkI99U0O-xr_4_{d(IOWTyV1g?-?W3gaq<~rp))d7(zmO
z5E9~&jLTv>BklFYBG7AoYuSg=Pd&^x$vlP83@cE}r&s|3VcTTmVI2pPhcbKBlVETb
zvj1r{>JewxqMMoow9V5kE;s||CJUQ=3WW%_5vnWR0`cN1tt0B26rkW6shn0q?q-@A
zXcP!1zMY9s#0Ls=6=5vMS?fEBkdqF=Zmn~|l_yJb@h0QP-)aE7@;3&^CivB-Jb_)8
zhN__f$x}Ex+6BQk*tafTW>E{oFf@yhXdz57FEIorCoSIsp~+L|%jg^^@N*_m6>>S%
zsmstgz>$L1qrV9<az!$<f*C<3YOF@;3k=P{VC*#~0oA73ZM;5u6)3?{3iPN^pajWo
zT14S?LLtI!1hMilfaXgG$WDSSR6M#S)CCRI)U5wD+04XwI1k^c5S%vR=qmV0E0waK
z6BZ$OuHj$4*#LOW8%H4~$^#_2F$s*9{I1KC@P@m^n~%^_d_xH8-D>dkS<Pz&;V02A
zSf`4k#;PGG#u^q@5`|!JJ@@2YbOdJXm`O%v?m+!(v&Kmw76ul2lUq<B`ATYICIJN1
z0uV1sK%kuhF~1%gDMfqjnk?3IV~=2ITEERuh;W;M@J*--Bd(&KO6+9N&EPzQs2#c)
zoKhg17w4rG&N``mV8PJP%}*L}<fMc1eyw8>g6As!`72WZuX^Li%7KBz!d}-+NMd1s
zWlt^{j|rON9VylMb(Wc6-abhiaN5xeDKe~k60NT0Oq$6+iddBf`A47t6(NX$HbBpU
z8mQORAs++IF|?k~#owG05lH<GEx0t5Pm7T?GK2t<LP-Ijoy;3TpV#K;r{R=K$jo*^
zA;N8f>WbfiP(q}rt0A6#s$M`4eikTD9MMitK|ls`Xf2#|@ZQzrtU(2-l>*&>e%yvM
ziPb0D=Rb*pO~u1snF6@xjSB=tEb9#%Khu&j+TZ)nPOCoME~{&>I=_wtnA3q}+`~^h
zQmXSbXoV@}#WqQvymb+z5TNRXz~p6U^0xIlJ|s~{h-cBjQ3~3&=RwR>U}C{MIwqvp
zqqhbEKq#yh69odO1_01bHn_PIrNB%J)>pl=E!NQ&jjrSo7Mw9?ftU*701rQfCVfHt
z47Gy;+KGxnA=tWFAjE7Y&WrPGTd5$9R3X@U@tk-sTzR6f;FiG;zcK;v$~P_w5V#Nk
zz{xW$DZ`8GzdSK#-V2OaS$m3@5$HyhGM^XH`IZ(Y<Iq=xF^rQj!;b=2fg-^X7$Qjf
z`VXOzZwz~h6xg?gYW$}gMxGNm`dMCR+lbb-0*nPWatDSTMqi*QJl2cZ004q+3bAYr
z(IN(Ep<wHy5aG4~)zL46pTdQ3hfpsxI0#K3hGrCj5u2GfF9UGeO7IR&8aJR{Z9*OG
zA_TW6{^cuU0KfEGiwKmYg;F?sw)Ht3u0try4xw8}$`7ebc1o6Dt4>6^SdtCNbm=Nk
zAewII35gmJqQyvw{+eDMMZUvGet8}tA*dEKfF(%AW|mkjZzZu&P>j~y&Rm8}gP~U%
zvneR37PIk~UoP0nC`7m&P+jqFH8iH1ig-ARtKrA7d`w_LsVlTIsi58GXHyx9IN@|E
z6*+CBMqoid?xf;s5rSJBk9>Iy;F@>t4lyz@ScWr_s4uKjq-g&SA{=+5$f%CCM0NYc
zLfet9GDZ{#UDX$SQPTApE+|L{Tm?9E?CC!fi#=ap&+cl2fg~BLg;4Av&?+cw#sKEi
zB-XJYdlC@9i4zJV+6f@_Rqtwl{(qjKud86wP>66_AlQw%i8!Jfi1X;ihz$kXiPROG
zpfPHkO)(T12&dB!EQ6+VHT+sr4d}<+_;B;Q$1K<?_~BnH1Nh~4?3oJ$X^yp|)O!cv
zZSeU;k6`%Mk3C5@s+E%<=x8O-kcOt>*G?Nb<Uus+yoS0E0+$0vYGpMc1lkw3*OCIg
z<?OXL%p2hu=heH`*+N^+*7Vb$LFZVooApW2K8@(c8aH}^B6bB^4uuG}JgO`HEd=lr
zsRmkTyPH@a-6^C(T|+#Zi8x9HG*cOf2sxXI&<%x?PMr5^Z8c!G(iRrnmiY0#$A9VV
zdl3R2!zuxc4oRu@46@-_)Ctf{I(Q+yj0Ry_RfmE9yb+rhC9@PnlMz@RDdQ^fj&sBo
zRio7Ua0h{B_EB$Fl8MFns2Pd=#q2dykb%hHeB<?S7(2;s#&%_cdlwn8o0L@gGmer_
zUvNf1z>6C|h;9rLj&J}vsp?RunITNZdH7Ch2l1Rv#gT18P@Lzi^^<n((dRP<6>McZ
z@`WV;FMrzwfU*FPh_PL2BOS8SZooS2TR%TP>0~en_R@Z>QFY)6HcBG&y1BS&F45ln
ze-?t^e?kBN7~x4oK~y-JOG$B{lgepxL<-wB+EhUy)&7alr#{nmnSW8&ptHV9Mu9z<
z2%wvRBGvBREsGH}?HB;+^Fbhzr2s^+j&1`KBHRX`1{ri?jgbivF`))XGY%B!h83Fz
z&cnQeoHXJ*XC1`*m3DHtu;7lsPyg~5fUEz@eQA{jmI6kHZud|`0CA(5l%U>>`QT?>
ziLiE=7Z6d>C6Y6-D6WE3Ic4_f5Phd$=!fDnjTi>FVJ;uhHlZ}?JOv_>oB&{F&3h3?
zqR){{=0QX@*xt3{UJy;aJ39o>Z6qQKwiF5xZf#VTzZu#)(ENY(0Nttv<+WpRlwrl$
zj8iX_c?XBW@kE?Q+lp}YCu^I19R)8n9{s<L0(klFUF-wN*`N19I(8%|3j<>#oA)h%
zGpIMtJV~hrY8TC8TPXA*mGbDiV3}U-U{*&hG=}bJO*MgHo;%?dw3bZ_B5lTr;VAU$
zDKMu=^tw;zPU0H?pym`xe|1c&PztQCepmZw5rtbAg$TDef+r=gU_FF*w5zBD@NCC2
zti%atYvR0A1REKO2sxfs3(l|3T*Z~bf;$*L{q)lSuKwN2!dvFTi12GIy|{%TlqM}c
zQzW-!vgt^tv<E>b4MPzLjzdc~jP}e(e$iG*0uB;FpIwjeLI4iU^%w_WE`1PypxTv(
zl8OVHm5nKoF)mcst4k8<Yh*X>-6{4d5Jd={F%%zR!5M(~G3p_lN4pwwCm;~C7*r6?
z*;riaG6*3j6Sp9Kb+Y!atDAl91?L1F{mheB{nrO$yr@Bqf!$h5iW?1+G&HT2xdSy9
zUL=}8`z%O-C#9MvISO12?{upeFPbc_mSv%D%`b>}(9F-Lfivm+rQTx>&TI@@AX-EL
z*Z=@@0FhX*A3n-Lf!h;>2)8h*OYg*B02hSdTI#IC&e9~t;wYmkl-2g*Nwpv{60S_v
z9xW_bknr>W;|Tzl|GO)~TkG?OC=k1G3yO?}G-ak-2*_YSFG5EzzV#wb)te+rQ&N;Z
z3rY>Ro-a^pgh#oY5rZO(TnNiSWTq*RQDCx#T4n{Z^`ZL`fWZYo%%ZoTm~H|9ZqaT`
zUkHwWexe&#tfN~Rg$TDY>LK7E3@j*Mc+}N+nPyE!l{n#KRcdfNsTRbqPA88Y-|X`)
zI7jh|&p!^}(sx`P-kNLB?1co!4ZV|HBMj;gK_fn+x_;yfz1lpJG>l{>bu@UIy|ix;
z)eH&&1imK$lSgol2#K`N3!E`t^ldgC^CYJ%DCwiQVeK*oS%lFXnxil7-WO~p3K4E;
zPz0(4>mk~e@GuSM*{r!yE#f&@lggv(+{pRWNnyc)=fzX^J__KHcfJA?w^#-LAH55;
zM&X4m;l0$Uf()~mmyqz6ttY*x7Z9fTB5THMLUHI@L`eZ^FjQ*;Xi19Q42<L_5Xo(!
zi6%2=Aponmwh_YtpwLe?{xs!FoFI3;Ihxy63tlMvIp8C7n|%TWr-|zF--ZC~D(VsH
z5t>yvq5|4guyw<llQmA)#Cfn2=ebr`u;2yY@L&Ao=`Z|Cro+&WIuSqXIPEy|Jr%hA
zHAIuTA*6;3$%<a!1>PkV4E$;<;T>5k3u-*71D%zBTY$4anqG|i$>MQrO{a#|=vJKj
zYo`pE@-ZGYUNr?9rr1YhLa@I2U1#z8C^(xaig3$90CcEF5RY~x1j2x=3<eM%C{PwE
zPA0DA_(xA~_URUENj&wLhcEfBUIQQ#VL_Z_R?1mNFQ_dLM(v+UBvK7i>b<HoXAz`O
zi>U8sO+*SbPoy9v6ecYQhiVZF?J}ah6zIlj47(%^^RU?DR-6-p=(U}BJk;IW$Hy*X
zZ$eboN)aj94OvpMQ}%{iiWW=ubr?(TkR<EamlQ(C&R7y<-*;opUfG5*%>2%{pS$1l
zdVb4)&-rU!^F8Zzu5-TI_4&RpVBGO)9-*aK0Yg`GXWr77ll@sJuN_OhOdZ@Knn}%b
zY~4LKf3{Y1;8c-jWD|-;oc6iWZa0LvcJ5P^+?wt2(2+z_D8ov|Ytw6tnlGn<lRREc
zu-SER)<&c%=REcC8R}Jz6qEOs%xQwJXheSVx}n!No1=4Gs@2B}wz>~Jr;sN5<{b4c
zd6=$bxfL{>b%sOzc?6AZWx#`DvC0a$`3}x}g>#;FXp;~2emzKg)ac$2?ZZpy)N77>
zn)35QZl4M*jb+ZqbXn-Rkj0Ma#6$^O$jRbWQSD+*zvGXJ&oTttjh45CFS%IDoV}GH
z5u9Gl7ahC%?z@=8+((CqDznFIo%)a~)uLY#zi7)6)!hc=tJAOq0f#M}&sEccqH2}4
z{5M5q%=@IYO7B!$4scB_&_UwnAEf=!=-ymPBFaN>b$B<k!6ej-a{EKN-FwAIcSvbL
zqe*Pd)~o9r7aqa5UJHMwxML;m{-7^g{j(5*q(ojv{Dme36fDkGB2AN}XLrFI@h#*#
zJ5Q!;9`BzgGT7Q%(-erAKOGw1f{555RkvRbGMY6Jy(pRP(bqCfe>#OmmrSoApiqwF
zOQ#O|Dkv;|m5)<?HTAm&ec~LAqi0aOWD3_*Gz8xg?lI{++nvd1HTdwRxGO82W8BC+
zsStEgmNwr>QOitaJ};&dtMos;O!dmPBOJ6Tr{_7#qhb1$CxHF}sv_KHT}kiR6=##c
zcuHO2e154$+Q^!r=m=2;7f)gdsKdCl`X<=T&0K^|!xmIn!m5w8FhMe0-Xjf-p1UwN
zDcd_xa8X;fImj)F3I(}1!=2%eB@+@=V?>I&-5K?-t`2EPYPcbzDXn+vb1}tCrV1hE
zKq^<kmkq_8mTaA=jo=s&4S&@iJ34p1z*k?-Nve38x4wE&o76%JS2BFTzr*Uf9h~37
zR2d!h3f2oF6!01rXL$$OT|L*9X{Jdb*wUe$aK3$2<;h@KG;3Mo_IVDJ9*35i$c;cs
ztux{s6-?kFF+4+V??!Aur?bpAyXgM2M)R&Ycy+KBX*X<;2t|-&<nUx-prjDJS(4Q?
z>dv4gn<O>O{NdO>af!SsHIb*>Edoy>*C^GKspwdX&DTq<vcDwLEM8!3*ebRnSjY$j
zq*}VhC8M4ZKk<8NLy!k);I_L@(I1;w`AMGA-wb8Ta8DS8&6X9*Qm<r=Ict>KKZyHN
zLz>XR;4XQW*nbG=s+sd(x39_wd#fuv=tVbN#22$LaQ@oz%1xhgX_osUopKiqXj=LC
zUQM#z-^k>L{xRB-!K23~Wz{Gucv+9n8zvksPS=2=Uoocnemn4LfD%zxozFoXTo*lJ
z%`|PYW1E##6pM8{qgXb&Xrz~Ja=3zoI8CKs&>|QMO3k5I0T0&K0`zRzhjFzZo5Cx-
z7|JNd^3E*TU#E0>Cr*7O|AF%6IfIGn&5XdU1M0z$<);T>RxWBMrN;&NB1GF%Ld_X-
zK9Aj1al>1pIGQb4pH&NWNh^^SJK^t9D6azI&cmVl{Y8EHq*Idi@9GjQ3O;Fzqu5LW
zgN!sgb7vo!1$DX$yzA^q@;RFl$<lmLZ#q!z>xEV-nCIIae45A7gEkNJ>hS1Q{Iq|G
zU}i;0_3R}y;RLLf52jw3)4-t;kRX<^*=a*68$EBN=cH2LcW4OVKyG2K9e-Ck&v5lQ
z?bPdxFnf)JK*<EvtSCK~6?GK{fz1T&Cos`DF05v%og+PXlc(6o$r@hRa%r|0XWyBg
zzI}qf@_<#X!Njj7tjSRQ);n=eig#i)$C+9Ga4+y%@j?5^(a_`uZ(xaz5Dx!2jNw?R
z47VPi>Q%?QTBvLo&iMUp1<9AJYy%h2_3>)an(y^3uyT)1?y|uey06-0H@Bf06ttx@
z{;=0qOl~YvppI5+;+&+lc3WPbG(^Z#c@$5tfm_9)Ks`$68RCxzX`0s?q0RGXUaHI9
zlgRGE5T27Xg}2Xc>oX^P&w@}zQ{1O!kV)Z0QO^W&Q-5yEYDLvuPE-zD%Wtk#7(dpm
zF?uSR3C_+1rF`S(NT2fY*5<GH7w0C(IvO`tlV8g}pWwV;u;g=Zu|)cS8Ew*St+J&G
zElpW=ulissNZ4SQY1tciV44bHKsC$WTQtFzsc)rYNk@wEJkMvXR}%MJn=QNwiCJqk
zmgd$m0dx(y7!$25b0}Enw0Z46)O-pQH(Ahr0yH$@9HkgiT65F%FmV_k@CL@62WvCA
zYh=J~ZNkUV&%O5<71m-a>JIA>Vz6oSN}Bzg*HS=5GdY95#DSoJtY0nJWqx&1Lk{l8
ztM)XnMb7)84Cf~O?SZ8s<=uINhXxVT2@gl1uKxL5o@BT+Nn)#m5m*i9rcYlkRtw+D
zy)Hd)bD(&Jl?zhCU&FshRnv?p{}52jHIOaSkC2XR=b?_4(ol}>eSCjrkgJXsTJ&XU
zFg;y%3d*~~@xA(_jO$Vl8hh|Ph>qpQWX&$1jO|bD>Tsw!Z8rW}trCv?4WJ&!-{vLl
zMUgzcbDecESgo&LZ+wvHwS=^*C&5FzLhhxY8u)rmOt9B(#F)OME}%6p6!p`KsoBxR
z{b?cmLnRujF2-IZeEVy$*0Ca_fhGUo!oD#=Y_R2ucVxspo8^ce8yb%7QAB#*!-8~1
znm6$`nEn5YDkxWC?=gZfcBx|G$|+{04FC>Xv*AT+oh$NNf6VK%_VL&9%F0T&KdzJ<
zj>mG}6Hqk0xO1Hg`QH>=5*7v@cNr)mVzU+uWACQk6^FjZP}3OXMqg<|sk=y9dk$fH
z=-%WiI|<TR(YdY&b|7kOlqbrLQCwl&tir&|LyP4%hsF2(li7d#XW`Ah3LWBqscn?}
z#>c0mxFgB*S_;o!jdWy;BM5jy_-?d_Z%RH(CJ{&*EmJ5?RIKhHZa=m~!$eQdsW4q}
z8yg(5Vhj&TrreqxV=TBsmz$m~8WutF77aTdT)1tcF^b4txK-NpgdHKRlNq*@iqGft
zp2>~;r?@519}?E)GqshvT3F*Cm-6yPmLYF#b@hH05Vr{O;%^d{kAy7%KwJTcx?@1b
z7Dz>RZ{9vR2z(I+bfPPR(EBqqWF;P6<oYg>vG+JC$uLaWtV9Aj3k&N>r!6VCxoc5o
z=M(X9qfVLS;&dNplN@OcDK{AoKYa@BJK{rnVO%SK@Y)$Prt;ih&Mm6l{AS2IQNE6z
z+I|cABt~*|cHU@<7PQ9qWT;{`MKCIxU(csals@dnFQy^Ab0z4Mrrf^8`;_bX2Gh{c
zEQ(cY5G{9OJS5`QzbMzaZWU$FqDzb8SArYGITCCfT6TExPpX)0xV}|=YPB(~>=0S@
zT!TUmdc_Hg^_%S2w1ov*2pDCTF>rp)2H+=9?t_x}y0zPg{XW}x%Qz%izyOGTJ4YST
zRoodEG)DO07vg_{#WIXM9LA6if2MsQ8|X!Gdiu1*bJD1M6N(^>__~mOQYWkG%0SjF
z@J0#GJzD)C`+8zsj9(5{{#Vyl1H<ryc>0+>gz{(cy6l&QvNwz7nKJ!0)tUVP)(*bk
z8#RR_9nP$0s6LO2izAXTr(N<tEzHdJOO*(v!*xI0Sm1lp`G~`newj!Y@L(Luz);S3
zfT@=ds}Ui}iAeOTgt~~*cSu_@jJG_w?r^yTEuGl+BK%oOA`J3b9J%aTIG^0A%A)8x
zZ0X@QO~qSzh#PNCQX*|BVYd5j7uDg+Ab^_pl}s>yYY#kT*LVG~Io!D9Xtl=$BM-WY
zr^N`|kYXkDj!9v>9ae+g!z{@45JIUiL<pk{L_Q1JYt|0jg~ubN2%NHeU_L9b{)9;n
z>|y<Gop@pG&XD<H=-~_?euJP;C3L6GoTPv!v(NzGuz^K6_Dgpv72_7~?^3U##qds+
zZJt_`UU@o-Ld<uG1$&s;wWDRzovH`{#=))Mjyw^?3+@9^P%)XhM&P;CpmIQ4jMGK#
z_xFzBE0BZ=h(DRLh@H7(Y<Ugcnd-m4%<0O#$j89O0fRje*~|48M6NRXLa$)2-HP7Z
zR1>A&J4;%t$~+jdArTMVER{Cf1f?gOR4woT$~Yiffg}<8xj^_i3)X%7X%X^p6>uB7
zhus9i0CX5bSObX6Al?H$4{CoB0gJ8k*#)H0@p8qTei=G__7yN!4CR-Bz^oAHKo=6%
zFeCzoG-4AKqJ@i%jm6;682kt9{s+U8M-BW>@HNm!NS|Wf%2EJ-V)pYf`(MF+M&`pe
zC6zxV%l<^bYPy<+@7Vf*7c%i(#ioq%JbM;FI$Rwt5+yrlx)pQ|bZQz9C2K)=ccDjJ
zyX<a@xc>$ev8R%q*2;@K0C?q>s70Y5<Yr9T1Q-}t8vbNa#^g_&cO8HZYZrMB<^u*O
z3t0lkqPX3Y;xUC^EA93_m;<FZT7QBFaYNb2n1Iqw-3sx)8htz`kHvQpup}ag`$cE<
zE`8x~JRozd0bo?ncN>U2e~mpZ>RiMhXR6<w@&S2094bkb_;}30f)a5~i3kXzWOGZ`
z&M*O%<8w0pmfVKbOa-Fvty~Prvw1)E$p0A_q?i^d*&GssTTw@;G!T3o2yF4fBa+Eb
zcvB{MkuZP@)T2p<!Pe|xWM2b^dylp^J-y;AeQ;$<PEt%~P2K{V0jtI6hmoz9Zl#e$
zc7AZOdwBzdb-+M+!ac&6hU_uDp-<k8XlUfYql<rOgZHmO->vT+?O7lj`i07W&i}?L
z@u>6KRO5{g(p3JgndiUMoI#HF{HqX%s5$y^I`VfDN9PYPHhZfYyrdEA?;-qaMzmux
z`GhDuQYHL%eVzZNzTX{@!rnI31F6`iv3zXJ@Ms4FW_tKfGyQJk?|D#gMHjV7kr<C`
z%pk?~yRLsu$=~M6*!#<r3`COq53X!y>4>>KbeRdK`SYR1>-uzujt@jEb3!hnN`pok
zZ-o^8C`9S0>E+6Cak{apJ)B{sbl2x}ekHKP_wEwM#%rD*y30E+rSzk=_kERYHWeJt
z$ZfZxgZIMus3BoDSScZDb0_&B4NBN+nDbT|^pIDPzYhq~Q$R8|fc&LFnpwOZ0;!*9
zX=xc4FmiNs6k<Qg%L|?flT0?++QM+?-d_E9&P~bCD0&r$oyfz74>vq5E_^B}Df#qi
zaC9{BrjTg+zVb)=B&`35s8%{!+KFv%?q)>NoQ!`r1hRMKz0pOE@TZQBtJQ^Xo}D@$
z^L1i!G9@|Lw`328b9Zw3wX`Ihs3o=TR#h^zwS!Tn>T2d?W)Ft+z^AZS)r?oRrlHnG
zEF26p&6h96Y6`>lojw|nRhiS%)0>+H{bgV30+k#3zY%ALgdt^71cJ|a`SZ}wM=ZGA
zU6GtKXI4B^Q(qtu2x)0)P7V%9?Z;!Q_O{rKqs;N~oH<6u#>VT7H-$3aT#Ro|yD&96
z>gD5uPE2&hu0FHHeiWn*aNlz2zq_+_Ve;XN)2&|@o|TrCx{VH14)=4x{{S|%o88_n
z(-Tg3yS&SXq`6KHA?3BUwvK5yC@PXLDEo2ubzFP-I&FC6g|3BX?~NXLdX5+t<x2Pt
zWb)jBC>!E^i5PCYFZ>j<NKR^M>ZA75w6s`*$;nB#b+Pd9mf5MPsoB{~!aZG^y_bB{
z0mwU2XtziAOGoV_xfyATii#e$J2*JFT1MT-A{Q7Q9wzMX_br$GE`aOp?Tywt2S%B{
z%YVAn)ZCnhhX+a<r1{?9y{o6^Qi;ihJMWF8q@=ztE>Z;s5TI42Rc>Vy%8-C=lY94c
zgxGTo?7h9shIbAR4?(Y1b}e4C%+Al>-!Z%x86Io!);_L%LF?Syj*7Oi13xn)z0M>q
zRwuW4#z~X|osb{{hZm++S6Al|79I7TjF($;xwyFSR_gVaehAVnp!mx_l_gQE5I$~T
tI@bT=pKQSpNH6fZ06S`a$p3FP9MyaQ-H(*>aXt``ZmH|26{=XF{sA`Yz`Ote

literal 0
HcmV?d00001

diff --git a/demo/documented/mixed-poisson-dual/python/demo_mixed-poisson-dual.py b/demo/documented/mixed-poisson-dual/python/demo_mixed-poisson-dual.py
new file mode 100644
index 0000000..bb8f2e6
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/python/demo_mixed-poisson-dual.py
@@ -0,0 +1,78 @@
+"""This demo program solves the mixed formulation of Poisson's
+equation:
+
+    sigma + grad(u) = 0    in Omega
+         div(sigma) = f    in Omega
+              du/dn = g    on Gamma_N
+                  u = u_D  on Gamma_D
+
+The corresponding weak (variational problem)
+
+    <sigma, tau> + <grad(u), tau>   = 0
+                                              for all tau
+                 - <sigma, grad(v)> = <f, v> + <g, v>
+                                              for all v
+
+is solved using DRT (Discontinuous Raviart-Thomas) elements
+of degree k for (sigma, tau) and CG (Lagrange) elements
+of degree k + 1 for (u, v) for k >= 1.
+"""
+
+# Copyright (C) 2014 Jan Blechta
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2014-01-27
+# Last changed: 2014-01-29
+
+# Begin demo
+
+from dolfin import *
+
+# Create mesh
+mesh = UnitSquareMesh(32, 32)
+
+# Define function spaces and mixed (product) space
+DRT = FunctionSpace(mesh, "DRT", 2)
+CG  = FunctionSpace(mesh, "CG", 3)
+W = DRT * CG
+
+# Define trial and test functions
+(sigma, u) = TrialFunctions(W)
+(tau, v) = TestFunctions(W)
+
+# Define source functions
+f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+g = Expression("sin(5.0*x[0])")
+
+# Define variational form
+a = (dot(sigma, tau) + dot(grad(u), tau) + dot(sigma, grad(v)))*dx
+L = - f*v*dx - g*v*ds
+
+# Define Dirichlet BC
+def boundary(x):
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+bc = DirichletBC(W.sub(1), 0.0, boundary)
+
+# Compute solution
+w = Function(W)
+solve(a == L, w, bc)
+(sigma, u) = w.split()
+
+# Plot sigma and u
+plot(sigma)
+plot(u)
+interactive()
diff --git a/demo/documented/mixed-poisson-dual/python/documentation.rst b/demo/documented/mixed-poisson-dual/python/documentation.rst
new file mode 100644
index 0000000..b17fba9
--- /dev/null
+++ b/demo/documented/mixed-poisson-dual/python/documentation.rst
@@ -0,0 +1,150 @@
+.. Documentation for the dual mixed Poisson demo from DOLFIN.
+
+.. _demo_pde_mixed-poisson-dual_python_documentation:
+
+Dual-mixed formulation for Poisson equation
+======================================
+
+This demo is implemented in a single Python file,
+:download:`demo_mixed-poisson-dual.py`, which contains both the
+variational forms and the solver.
+
+.. include:: ../common.txt
+
+
+Implementation
+--------------
+
+This demo is implemented in the :download:`demo_mixed-poisson-dual.py`
+file.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+Then, we need to create a :py:class:`Mesh <dolfin.cpp.Mesh>` covering
+the unit square. In this example, we will let the mesh consist of 32 x
+32 squares with each square divided into two triangles:
+
+.. code-block:: python
+
+    # Create mesh
+    mesh = UnitSquareMesh(32, 32)
+
+.. index::
+   pair: FunctionSpace; Discontinuous Raviart-Thomas
+   pair: FunctionSpace; Lagrange
+
+Next, we need to define the function spaces. We define the two
+function spaces :math:`\Sigma_h = DRT` and :math:`V_h = CG`
+separately, before combining these into a mixed function space:
+
+.. code-block:: python
+
+    # Define function spaces and mixed (product) space
+    DRT = FunctionSpace(mesh, "DRT", 2)
+    CG = FunctionSpace(mesh, "CG", 3)
+    W = DRT * CG
+
+The second argument to :py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` specifies the type of
+finite element family, while the third argument specifies the
+polynomial degree. The UFL user manual contains a list of all
+available finite element families and more details.  The * operator
+creates a mixed (product) space ``W`` from the two separate spaces
+``DRT`` and ``CG``. Hence,
+
+.. math::
+
+    W = \{ (\tau, v) \ \text{such that} \ \tau \in DRT, v \in CG \}.
+
+Next, we need to specify the trial functions (the unknowns) and the
+test functions on this space. This can be done as follows
+
+.. code-block:: python
+
+    # Define trial and test functions
+    (sigma, u) = TrialFunctions(W)
+    (tau, v) = TestFunctions(W)
+
+In order to define the variational form, it only remains to define the
+source functions :math:`f` and :math:`g`. This is done just as for the
+:ref:`mixed Poisson demo
+<demo_pde_mixed-poisson_python_documentation>`:
+
+.. code-block:: python
+
+    # Define source functions
+    f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+    g = Expression("sin(5.0*x[0])")
+
+We are now ready to define the variational forms a and L.
+
+.. code-block:: python
+
+    # Define variational form
+    a = (dot(sigma, tau) + dot(grad(u), tau) + dot(sigma, grad(v)))*dx
+    L = - f*v*dx - g*v*ds
+
+It only remains to prescribe the Dirichlet boundary condition for
+:math:`u`. Essential boundary conditions are specified through the
+class :py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>` which takes
+three arguments: the function space the boundary condition is supposed
+to be applied to, the data for the boundary condition, and the
+relevant part of the boundary.
+
+We want to apply the boundary condition to the second subspace of the
+mixed space. Subspaces of a :py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` can be accessed
+by the method :py:func:`sub
+<dolfin.functions.functionspace.FunctionSpaceBase.sub>`. In our case,
+this reads ``W.sub(1)``. (Do *not* use the separate space ``CG`` as
+this would mess up the numbering.)
+
+Specifying the relevant part of the boundary can be done as for the
+Poisson demo:
+
+.. code-block:: python
+
+    # Define Dirichlet BC
+    def boundary(x):
+        return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+
+Now, all the pieces are in place for the construction of the essential
+boundary condition:
+
+.. code-block:: python
+
+    bc = DirichletBC(W.sub(1), 0.0, boundary)
+
+To compute the solution we use the bilinear and linear forms, and the
+boundary condition, but we also need to create a :py:class:`Function
+<dolfin.functions.function.Function>` to store the solution(s). The
+(full) solution will be stored in the ``w``, which we initialise using
+the :py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` ``W``. The actual
+computation is performed by calling :py:func:`solve
+<dolfin.fem.solving.solve>`. The separate components ``sigma`` and
+``u`` of the solution can be extracted by calling the :py:func:`split
+<dolfin.functions.function.Function.split>` function. Finally, we plot
+the solutions to examine the result.
+
+.. code-block:: python
+
+    # Compute solution
+    w = Function(W)
+    solve(a == L, w, bc)
+    (sigma, u) = w.split()
+
+    # Plot sigma and u
+    plot(sigma)
+    plot(u)
+    interactive()
+
+
+Complete code
+-------------
+.. literalinclude:: demo_mixed-poisson-dual.py
+   :start-after: # Begin demo
diff --git a/demo/documented/mixed-poisson/common.txt b/demo/documented/mixed-poisson/common.txt
new file mode 100644
index 0000000..f9c2c95
--- /dev/null
+++ b/demo/documented/mixed-poisson/common.txt
@@ -0,0 +1,99 @@
+
+This demo illustrates how to solve Poisson equation using a mixed
+(two-field) formulation. In particular, it illustrates how to
+
+* Use mixed and non-continuous finite element spaces
+* Set essential boundary conditions for subspaces and H(div) spaces
+* Define a (vector-valued) expression using additional geometry information
+
+Equation and problem definition
+-------------------------------
+
+An alternative formulation of Poisson equation can be formulated by
+introducing an additional (vector) variable, namely the (negative)
+flux: :math:`\sigma = \nabla u`. The partial differential equations
+then read
+
+.. math::
+   \sigma - \nabla u &= 0 \quad {\rm in} \ \Omega, \\
+   \nabla \cdot \sigma &= - f \quad {\rm in} \ \Omega,
+
+with boundary conditions
+
+.. math::
+   u = u_0 \quad {\rm on} \ \Gamma_{D},  \\
+   \sigma \cdot n = g \quad {\rm on} \ \Gamma_{N}.
+
+The same equations arise in connection with flow in porous media, and
+are also referred to as Darcy flow.
+
+After multiplying by test functions :math:`\tau` and :math:`v`,
+integrating over the domain, and integrating the gradient term by
+parts, one obtains the following variational formulation: find
+:math:`\sigma \in \Sigma` and :math:`v \in V` satisfying
+
+.. math::
+   \int_{\Omega} (\sigma \cdot \tau + \nabla \cdot \tau \ u) \ {\rm d} x
+   &= \int_{\Gamma} \tau \cdot n \ u \ {\rm d} s
+   \quad \forall \ \tau \in \Sigma, \\
+
+   \int_{\Omega} \nabla \cdot \sigma v \ {\rm d} x
+   &= - \int_{\Omega} f \ v \ {\rm d} x
+   \quad \forall \ v \in V.
+
+Here :math:`n` denotes the outward pointing normal vector on the
+boundary. Looking at the variational form, we see that the boundary
+condition for the flux (:math:`\sigma \cdot n = g`) is now an
+essential boundary condition (which should be enforced in the function
+space), while the other boundary condition (:math:`u = u_0`) is a
+natural boundary condition (which should be applied to the variational
+form). Inserting the boundary conditions, this variational problem can
+be phrased in the general form: find :math:`(\sigma, u) \in \Sigma_g
+\times V` such that
+
+.. math::
+
+   a((\sigma, u), (\tau, v)) = L((\tau, v))
+   \quad \forall \ (\tau, v) \in \Sigma_0 \times V
+
+where the variational forms :math:`a` and :math:`L` are defined as
+
+.. math::
+
+   a((\sigma, u), (\tau, v)) &=
+     \int_{\Omega} \sigma \cdot \tau + \nabla \cdot \tau \ u
+   + \nabla \cdot \sigma \ v \ {\rm d} x \\
+   L((\tau, v)) &= - \int_{\Omega} f v \ {\rm d} x
+   + \int_{\Gamma_D} u_0 \tau \cdot n  \ {\rm d} s
+
+and :math:`\Sigma_g = \{ \tau \in H({\rm div}) \text{ such that } \tau \cdot n|_{\Gamma_N} = g \}`
+and :math:`V = L^2(\Omega)`.
+
+To discretize the above formulation, two discrete function spaces
+:math:`\Sigma_h \subset \Sigma` and :math:`V_h \subset V` are needed
+to form a mixed function space :math:`\Sigma_h \times V_h`. A stable
+choice of finite element spaces is to let :math:`\Sigma_h` be the
+Brezzi-Douglas-Marini elements of polynomial order :math:`k` and let
+:math:`V_h` be discontinuous elements of polynomial order :math:`k-1`.
+
+We will use the same definitions of functions and boundaries as in the
+demo for Poisson's equation. These are:
+
+* :math:`\Omega = [0,1] \times [0,1]` (a unit square)
+* :math:`\Gamma_{D} = \{(0, y) \cup (1, y) \in \partial \Omega\}`
+* :math:`\Gamma_{N} = \{(x, 0) \cup (x, 1) \in \partial \Omega\}`
+* :math:`u_0 = 0`
+* :math:`g = \sin(5x)`   (flux)
+* :math:`f = 10\exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)`   (source term)
+
+With the above input the solution for :math:`u` and :math:`\sigma` will look as
+follows:
+
+.. image:: ../mixed-poisson_u.png
+    :scale: 75
+    :align: center
+
+.. image:: ../mixed-poisson_sigma.png
+    :scale: 75
+    :align: center
+
diff --git a/demo/documented/mixed-poisson/cpp/CMakeLists.txt b/demo/documented/mixed-poisson/cpp/CMakeLists.txt
new file mode 100644
index 0000000..9e637a2
--- /dev/null
+++ b/demo/documented/mixed-poisson/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_mixed-poisson)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/mixed-poisson/cpp/MixedPoisson.h b/demo/documented/mixed-poisson/cpp/MixedPoisson.h
new file mode 100644
index 0000000..a6dce9a
--- /dev/null
+++ b/demo/documented/mixed-poisson/cpp/MixedPoisson.h
@@ -0,0 +1,6759 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __MIXEDPOISSON_H
+#define __MIXEDPOISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class mixedpoisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  mixedpoisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new mixedpoisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class mixedpoisson_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  mixedpoisson_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Brezzi-Douglas-Marini', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.942809041582063, 0.577350269189626, -0.333333333333333};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, 0.0, -0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {-0.471404520791032, -0.288675134594813, 0.166666666666667};
+      
+      static const double coefficients1[3] = \
+      {0.942809041582063, 0.0, 0.666666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.577350269189626, -0.666666666666667};
+      
+      static const double coefficients1[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, 0.833333333333333};
+      
+      static const double coefficients1[3] = \
+      {-0.942809041582063, 0.0, -0.666666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {-0.471404520791032, -0.288675134594813, 0.166666666666667};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, 0.866025403784438, 0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.942809041582063, 0.577350269189626, -0.333333333333334};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, -0.866025403784439, 0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.942809041582063, 0.577350269189626, -0.333333333333333};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, 0.0, -0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {-0.471404520791032, -0.288675134594813, 0.166666666666667};
+      
+      static const double coefficients1[3] = \
+      {0.942809041582063, 0.0, 0.666666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.577350269189626, -0.666666666666667};
+      
+      static const double coefficients1[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, 0.833333333333333};
+      
+      static const double coefficients1[3] = \
+      {-0.942809041582063, 0.0, -0.666666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {-0.471404520791032, -0.288675134594813, 0.166666666666667};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, 0.866025403784438, 0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.942809041582063, 0.577350269189626, -0.333333333333334};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, -0.866025403784439, 0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[0] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[1] = result;
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[2] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[3] = result;
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[4] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[5] = result;
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[2]*(1.0/detJ)*J[0]*2.0 + dof_values[3]*((1.0/detJ)*(J[0]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[1]*(-2.0))) + dof_values[5]*(1.0/detJ)*J[1];
+    vertex_values[2] = dof_values[0]*(1.0/detJ)*J[0]*2.0 + dof_values[1]*((1.0/detJ)*(J[0]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[0]*(-1.0) + J[1])) + dof_values[5]*((1.0/detJ)*(J[0]*2.0 + J[1]*(-2.0)));
+    vertex_values[4] = dof_values[0]*((1.0/detJ)*(J[1]*(-1.0))) + dof_values[1]*(1.0/detJ)*J[1]*2.0 + dof_values[2]*((1.0/detJ)*(J[0]*(-1.0) + J[1])) + dof_values[3]*((1.0/detJ)*(J[0]*2.0 + J[1]*(-2.0)));
+    vertex_values[1] = dof_values[2]*(1.0/detJ)*J[2]*2.0 + dof_values[3]*((1.0/detJ)*(J[2]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[3]*(-2.0))) + dof_values[5]*(1.0/detJ)*J[3];
+    vertex_values[3] = dof_values[0]*(1.0/detJ)*J[2]*2.0 + dof_values[1]*((1.0/detJ)*(J[2]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[2]*(-1.0) + J[3])) + dof_values[5]*((1.0/detJ)*(J[2]*2.0 + J[3]*(-2.0)));
+    vertex_values[5] = dof_values[0]*((1.0/detJ)*(J[3]*(-1.0))) + dof_values[1]*(1.0/detJ)*J[3]*2.0 + dof_values[2]*((1.0/detJ)*(J[2]*(-1.0) + J[3])) + dof_values[3]*((1.0/detJ)*(J[2]*2.0 + J[3]*(-2.0)));
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new mixedpoisson_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class mixedpoisson_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  mixedpoisson_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new mixedpoisson_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class mixedpoisson_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  mixedpoisson_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(FiniteElement('Brezzi-Douglas-Marini', Domain(Cell('triangle', 2)), 1, None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 7;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.942809041582063, 0.577350269189626, -0.333333333333333};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, 0.0, -0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {-0.471404520791032, -0.288675134594813, 0.166666666666667};
+      
+      static const double coefficients1[3] = \
+      {0.942809041582063, 0.0, 0.666666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.577350269189626, -0.666666666666667};
+      
+      static const double coefficients1[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, 0.833333333333333};
+      
+      static const double coefficients1[3] = \
+      {-0.942809041582063, 0.0, -0.666666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {-0.471404520791032, -0.288675134594813, 0.166666666666667};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, 0.866025403784438, 0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.942809041582063, 0.577350269189626, -0.333333333333334};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, -0.866025403784439, 0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using contravariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+      values[1] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 7; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.942809041582063, 0.577350269189626, -0.333333333333333};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, 0.0, -0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {-0.471404520791032, -0.288675134594813, 0.166666666666667};
+      
+      static const double coefficients1[3] = \
+      {0.942809041582063, 0.0, 0.666666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.577350269189626, -0.666666666666667};
+      
+      static const double coefficients1[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, 0.833333333333333};
+      
+      static const double coefficients1[3] = \
+      {-0.942809041582063, 0.0, -0.666666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {-0.471404520791032, -0.288675134594813, 0.166666666666667};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, 0.866025403784438, 0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.942809041582063, 0.577350269189626, -0.333333333333334};
+      
+      static const double coefficients1[3] = \
+      {-0.471404520791032, -0.866025403784439, 0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using contravariant Piola transform to map values back to the physical element.
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (1.0/detJ)*(J[0]*tmp_ref0 + J[1]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (1.0/detJ)*(J[2]*tmp_ref0 + J[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[1][1] = \
+      {{0.0}};
+      
+      static const double dmats1[1][1] = \
+      {{0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[1][1] = \
+      {{1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[1][1] = \
+      {{1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 1; t++)
+        {
+          for (unsigned int u = 0; u < 1; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              for (unsigned int tu = 0; tu < 1; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              for (unsigned int tu = 0; tu < 1; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 7; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[6];
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 7; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+      return result;
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+      return result;
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[0] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1])) + (detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[1] = result;
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[2] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (detJ*(K[0]*vals[0] + K[1]*vals[1]));
+    values[3] = result;
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[4] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(detJ*(K[2]*vals[0] + K[3]*vals[1]));
+    values[5] = result;
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[2]*(1.0/detJ)*J[0]*2.0 + dof_values[3]*((1.0/detJ)*(J[0]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[1]*(-2.0))) + dof_values[5]*(1.0/detJ)*J[1];
+    vertex_values[3] = dof_values[0]*(1.0/detJ)*J[0]*2.0 + dof_values[1]*((1.0/detJ)*(J[0]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[0]*(-1.0) + J[1])) + dof_values[5]*((1.0/detJ)*(J[0]*2.0 + J[1]*(-2.0)));
+    vertex_values[6] = dof_values[0]*((1.0/detJ)*(J[1]*(-1.0))) + dof_values[1]*(1.0/detJ)*J[1]*2.0 + dof_values[2]*((1.0/detJ)*(J[0]*(-1.0) + J[1])) + dof_values[3]*((1.0/detJ)*(J[0]*2.0 + J[1]*(-2.0)));
+    vertex_values[1] = dof_values[2]*(1.0/detJ)*J[2]*2.0 + dof_values[3]*((1.0/detJ)*(J[2]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[3]*(-2.0))) + dof_values[5]*(1.0/detJ)*J[3];
+    vertex_values[4] = dof_values[0]*(1.0/detJ)*J[2]*2.0 + dof_values[1]*((1.0/detJ)*(J[2]*(-1.0))) + dof_values[4]*((1.0/detJ)*(J[2]*(-1.0) + J[3])) + dof_values[5]*((1.0/detJ)*(J[2]*2.0 + J[3]*(-2.0)));
+    vertex_values[7] = dof_values[0]*((1.0/detJ)*(J[3]*(-1.0))) + dof_values[1]*(1.0/detJ)*J[3]*2.0 + dof_values[2]*((1.0/detJ)*(J[2]*(-1.0) + J[3])) + dof_values[3]*((1.0/detJ)*(J[2]*2.0 + J[3]*(-2.0)));
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[6];
+    vertex_values[5] = dof_values[6];
+    vertex_values[8] = dof_values[6];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoisson_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoisson_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new mixedpoisson_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class mixedpoisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  mixedpoisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new mixedpoisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class mixedpoisson_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  mixedpoisson_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Brezzi-Douglas-Marini', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 2*c.entity_indices[1][0];
+    dofs[1] = 2*c.entity_indices[1][0] + 1;
+    dofs[2] = 2*c.entity_indices[1][1];
+    dofs[3] = 2*c.entity_indices[1][1] + 1;
+    dofs[4] = 2*c.entity_indices[1][2];
+    dofs[5] = 2*c.entity_indices[1][2] + 1;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 2;
+      dofs[1] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 4;
+      dofs[1] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 1;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 2;
+        dofs[1] = 3;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 4;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[1][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[1][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[2][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[2][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[4][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[5][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new mixedpoisson_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class mixedpoisson_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  mixedpoisson_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[2][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new mixedpoisson_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class mixedpoisson_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  mixedpoisson_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(FiniteElement('Brezzi-Douglas-Marini', Domain(Cell('triangle', 2)), 1, None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[1] + num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 7;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + 2*c.entity_indices[1][0];
+    dofs[1] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[2] = offset + 2*c.entity_indices[1][1];
+    dofs[3] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[4] = offset + 2*c.entity_indices[1][2];
+    dofs[5] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 2;
+      dofs[1] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 4;
+      dofs[1] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 1;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 2;
+        dofs[1] = 3;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 4;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 6;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[1][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[1][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[2][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[2][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[4][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[5][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoisson_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoisson_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new mixedpoisson_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class mixedpoisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  mixedpoisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    64
+    // Number of operations (multiply-add pairs) for tensor contraction: 284
+    // Total number of operations (multiply-add pairs):                  351
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = 1.0 / (detJ)*det*J[0]*K[0]*(1.0);
+    const double G0_0_1 = 1.0 / (detJ)*det*J[0]*K[2]*(1.0);
+    const double G0_1_0 = 1.0 / (detJ)*det*J[1]*K[0]*(1.0);
+    const double G0_1_1 = 1.0 / (detJ)*det*J[1]*K[2]*(1.0);
+    const double G1_0_0 = 1.0 / (detJ)*det*J[2]*K[1]*(1.0);
+    const double G1_0_1 = 1.0 / (detJ)*det*J[2]*K[3]*(1.0);
+    const double G1_1_0 = 1.0 / (detJ)*det*J[3]*K[1]*(1.0);
+    const double G1_1_1 = 1.0 / (detJ)*det*J[3]*K[3]*(1.0);
+    const double G2_0_0 = 1.0 / (detJ)*det*J[0]*K[0]*(1.0);
+    const double G2_0_1 = 1.0 / (detJ)*det*J[0]*K[2]*(1.0);
+    const double G2_1_0 = 1.0 / (detJ)*det*J[1]*K[0]*(1.0);
+    const double G2_1_1 = 1.0 / (detJ)*det*J[1]*K[2]*(1.0);
+    const double G3_0_0 = 1.0 / (detJ)*det*J[2]*K[1]*(1.0);
+    const double G3_0_1 = 1.0 / (detJ)*det*J[2]*K[3]*(1.0);
+    const double G3_1_0 = 1.0 / (detJ)*det*J[3]*K[1]*(1.0);
+    const double G3_1_1 = 1.0 / (detJ)*det*J[3]*K[3]*(1.0);
+    const double G4_0_0 = 1.0 / (detJ*detJ)*det*J[0]*J[0]*(1.0);
+    const double G4_0_1 = 1.0 / (detJ*detJ)*det*J[0]*J[1]*(1.0);
+    const double G4_1_0 = 1.0 / (detJ*detJ)*det*J[1]*J[0]*(1.0);
+    const double G4_1_1 = 1.0 / (detJ*detJ)*det*J[1]*J[1]*(1.0);
+    const double G5_0_0 = 1.0 / (detJ*detJ)*det*J[2]*J[2]*(1.0);
+    const double G5_0_1 = 1.0 / (detJ*detJ)*det*J[2]*J[3]*(1.0);
+    const double G5_1_0 = 1.0 / (detJ*detJ)*det*J[3]*J[2]*(1.0);
+    const double G5_1_1 = 1.0 / (detJ*detJ)*det*J[3]*J[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.333333333333333*G4_0_0 - 0.0833333333333333*G4_0_1 - 0.0833333333333333*G4_1_0 + 0.0833333333333333*G4_1_1 + 0.333333333333333*G5_0_0 - 0.0833333333333333*G5_0_1 - 0.0833333333333333*G5_1_0 + 0.0833333333333333*G5_1_1;
+    A[1] = -0.166666666666667*G4_0_0 + 0.166666666666667*G4_0_1 + 0.0416666666666666*G4_1_0 - 0.166666666666667*G4_1_1 - 0.166666666666667*G5_0_0 + 0.166666666666667*G5_0_1 + 0.0416666666666666*G5_1_0 - 0.166666666666667*G5_1_1;
+    A[2] = 0.0833333333333333*G4_0_0 + 0.0833333333333333*G4_0_1 - 0.0833333333333333*G4_1_1 + 0.0833333333333333*G5_0_0 + 0.0833333333333333*G5_0_1 - 0.0833333333333333*G5_1_1;
+    A[3] = 0.0833333333333332*G4_0_0 - 0.166666666666667*G4_0_1 - 0.125*G4_1_0 + 0.166666666666667*G4_1_1 + 0.0833333333333332*G5_0_0 - 0.166666666666667*G5_0_1 - 0.125*G5_1_0 + 0.166666666666667*G5_1_1;
+    A[4] = -0.166666666666667*G4_0_0 + 0.0416666666666666*G4_1_0 + 0.0416666666666667*G4_1_1 - 0.166666666666667*G5_0_0 + 0.0416666666666666*G5_1_0 + 0.0416666666666667*G5_1_1;
+    A[5] = 0.333333333333333*G4_0_0 - 0.25*G4_0_1 - 0.0833333333333333*G4_1_0 + 0.0416666666666666*G4_1_1 + 0.333333333333333*G5_0_0 - 0.25*G5_0_1 - 0.0833333333333333*G5_1_0 + 0.0416666666666666*G5_1_1;
+    A[6] = G2_0_0 - 0.5*G2_1_1 + G3_0_0 - 0.5*G3_1_1;
+    A[7] = -0.166666666666667*G4_0_0 + 0.0416666666666666*G4_0_1 + 0.166666666666667*G4_1_0 - 0.166666666666667*G4_1_1 - 0.166666666666667*G5_0_0 + 0.0416666666666666*G5_0_1 + 0.166666666666667*G5_1_0 - 0.166666666666667*G5_1_1;
+    A[8] = 0.0833333333333333*G4_0_0 - 0.0833333333333333*G4_0_1 - 0.0833333333333333*G4_1_0 + 0.333333333333333*G4_1_1 + 0.0833333333333333*G5_0_0 - 0.0833333333333333*G5_0_1 - 0.0833333333333333*G5_1_0 + 0.333333333333333*G5_1_1;
+    A[9] = -0.0416666666666667*G4_0_0 - 0.0416666666666666*G4_0_1 + 0.166666666666667*G4_1_1 - 0.0416666666666667*G5_0_0 - 0.0416666666666666*G5_0_1 + 0.166666666666667*G5_1_1;
+    A[10] = -0.0416666666666666*G4_0_0 + 0.0833333333333333*G4_0_1 + 0.25*G4_1_0 - 0.333333333333333*G4_1_1 - 0.0416666666666666*G5_0_0 + 0.0833333333333333*G5_0_1 + 0.25*G5_1_0 - 0.333333333333333*G5_1_1;
+    A[11] = 0.0833333333333333*G4_0_0 - 0.0833333333333333*G4_1_0 - 0.0833333333333334*G4_1_1 + 0.0833333333333333*G5_0_0 - 0.0833333333333333*G5_1_0 - 0.0833333333333334*G5_1_1;
+    A[12] = -0.166666666666667*G4_0_0 + 0.125*G4_0_1 + 0.166666666666667*G4_1_0 - 0.0833333333333332*G4_1_1 - 0.166666666666667*G5_0_0 + 0.125*G5_0_1 + 0.166666666666667*G5_1_0 - 0.0833333333333332*G5_1_1;
+    A[13] = -0.5*G2_0_0 + G2_1_1 - 0.5*G3_0_0 + G3_1_1;
+    A[14] = 0.0833333333333333*G4_0_0 + 0.0833333333333333*G4_1_0 - 0.0833333333333333*G4_1_1 + 0.0833333333333333*G5_0_0 + 0.0833333333333333*G5_1_0 - 0.0833333333333333*G5_1_1;
+    A[15] = -0.0416666666666667*G4_0_0 - 0.0416666666666666*G4_1_0 + 0.166666666666667*G4_1_1 - 0.0416666666666667*G5_0_0 - 0.0416666666666666*G5_1_0 + 0.166666666666667*G5_1_1;
+    A[16] = 0.25*G4_0_0 + 0.0833333333333333*G4_1_1 + 0.25*G5_0_0 + 0.0833333333333333*G5_1_1;
+    A[17] = -0.125*G4_0_0 + 0.125*G4_1_0 - 0.166666666666667*G4_1_1 - 0.125*G5_0_0 + 0.125*G5_1_0 - 0.166666666666667*G5_1_1;
+    A[18] = -0.0416666666666667*G4_0_0 - 0.208333333333333*G4_0_1 - 0.0416666666666666*G4_1_0 - 0.0416666666666667*G4_1_1 - 0.0416666666666667*G5_0_0 - 0.208333333333333*G5_0_1 - 0.0416666666666666*G5_1_0 - 0.0416666666666667*G5_1_1;
+    A[19] = 0.0833333333333334*G4_0_0 + 0.0416666666666667*G4_0_1 + 0.0833333333333333*G4_1_0 - 0.0416666666666666*G4_1_1 + 0.0833333333333334*G5_0_0 + 0.0416666666666667*G5_0_1 + 0.0833333333333333*G5_1_0 - 0.0416666666666666*G5_1_1;
+    A[20] = -G2_0_0 - 1.5*G2_0_1 + 0.5*G2_1_1 - G3_0_0 - 1.5*G3_0_1 + 0.5*G3_1_1;
+    A[21] = 0.0833333333333332*G4_0_0 - 0.125*G4_0_1 - 0.166666666666667*G4_1_0 + 0.166666666666667*G4_1_1 + 0.0833333333333332*G5_0_0 - 0.125*G5_0_1 - 0.166666666666667*G5_1_0 + 0.166666666666667*G5_1_1;
+    A[22] = -0.0416666666666666*G4_0_0 + 0.25*G4_0_1 + 0.0833333333333333*G4_1_0 - 0.333333333333333*G4_1_1 - 0.0416666666666666*G5_0_0 + 0.25*G5_0_1 + 0.0833333333333333*G5_1_0 - 0.333333333333333*G5_1_1;
+    A[23] = -0.125*G4_0_0 + 0.125*G4_0_1 - 0.166666666666667*G4_1_1 - 0.125*G5_0_0 + 0.125*G5_0_1 - 0.166666666666667*G5_1_1;
+    A[24] = 0.25*G4_0_0 - 0.25*G4_0_1 - 0.25*G4_1_0 + 0.333333333333333*G4_1_1 + 0.25*G5_0_0 - 0.25*G5_0_1 - 0.25*G5_1_0 + 0.333333333333333*G5_1_1;
+    A[25] = -0.0416666666666666*G4_0_0 + 0.0416666666666666*G4_0_1 + 0.0833333333333333*G4_1_0 + 0.0833333333333334*G4_1_1 - 0.0416666666666666*G5_0_0 + 0.0416666666666666*G5_0_1 + 0.0833333333333333*G5_1_0 + 0.0833333333333334*G5_1_1;
+    A[26] = 0.0833333333333333*G4_0_0 - 0.0833333333333332*G4_0_1 - 0.166666666666667*G4_1_0 + 0.0833333333333332*G4_1_1 + 0.0833333333333333*G5_0_0 - 0.0833333333333332*G5_0_1 - 0.166666666666667*G5_1_0 + 0.0833333333333332*G5_1_1;
+    A[27] = 0.5*G2_0_0 + 1.5*G2_0_1 - G2_1_1 + 0.5*G3_0_0 + 1.5*G3_0_1 - G3_1_1;
+    A[28] = -0.166666666666667*G4_0_0 + 0.0416666666666666*G4_0_1 + 0.0416666666666667*G4_1_1 - 0.166666666666667*G5_0_0 + 0.0416666666666666*G5_0_1 + 0.0416666666666667*G5_1_1;
+    A[29] = 0.0833333333333333*G4_0_0 - 0.0833333333333333*G4_0_1 - 0.0833333333333334*G4_1_1 + 0.0833333333333333*G5_0_0 - 0.0833333333333333*G5_0_1 - 0.0833333333333334*G5_1_1;
+    A[30] = -0.0416666666666667*G4_0_0 - 0.0416666666666666*G4_0_1 - 0.208333333333333*G4_1_0 - 0.0416666666666667*G4_1_1 - 0.0416666666666667*G5_0_0 - 0.0416666666666666*G5_0_1 - 0.208333333333333*G5_1_0 - 0.0416666666666667*G5_1_1;
+    A[31] = -0.0416666666666666*G4_0_0 + 0.0833333333333333*G4_0_1 + 0.0416666666666666*G4_1_0 + 0.0833333333333334*G4_1_1 - 0.0416666666666666*G5_0_0 + 0.0833333333333333*G5_0_1 + 0.0416666666666666*G5_1_0 + 0.0833333333333334*G5_1_1;
+    A[32] = 0.0833333333333333*G4_0_0 + 0.25*G4_1_1 + 0.0833333333333333*G5_0_0 + 0.25*G5_1_1;
+    A[33] = -0.166666666666667*G4_0_0 + 0.125*G4_0_1 - 0.125*G4_1_1 - 0.166666666666667*G5_0_0 + 0.125*G5_0_1 - 0.125*G5_1_1;
+    A[34] = -0.5*G2_0_0 + 1.5*G2_1_0 + G2_1_1 - 0.5*G3_0_0 + 1.5*G3_1_0 + G3_1_1;
+    A[35] = 0.333333333333333*G4_0_0 - 0.0833333333333333*G4_0_1 - 0.25*G4_1_0 + 0.0416666666666666*G4_1_1 + 0.333333333333333*G5_0_0 - 0.0833333333333333*G5_0_1 - 0.25*G5_1_0 + 0.0416666666666666*G5_1_1;
+    A[36] = -0.166666666666667*G4_0_0 + 0.166666666666667*G4_0_1 + 0.125*G4_1_0 - 0.0833333333333332*G4_1_1 - 0.166666666666667*G5_0_0 + 0.166666666666667*G5_0_1 + 0.125*G5_1_0 - 0.0833333333333332*G5_1_1;
+    A[37] = 0.0833333333333334*G4_0_0 + 0.0833333333333333*G4_0_1 + 0.0416666666666667*G4_1_0 - 0.0416666666666666*G4_1_1 + 0.0833333333333334*G5_0_0 + 0.0833333333333333*G5_0_1 + 0.0416666666666667*G5_1_0 - 0.0416666666666666*G5_1_1;
+    A[38] = 0.0833333333333332*G4_0_0 - 0.166666666666667*G4_0_1 - 0.0833333333333332*G4_1_0 + 0.0833333333333332*G4_1_1 + 0.0833333333333332*G5_0_0 - 0.166666666666667*G5_0_1 - 0.0833333333333332*G5_1_0 + 0.0833333333333332*G5_1_1;
+    A[39] = -0.166666666666667*G4_0_0 + 0.125*G4_1_0 - 0.125*G4_1_1 - 0.166666666666667*G5_0_0 + 0.125*G5_1_0 - 0.125*G5_1_1;
+    A[40] = 0.333333333333333*G4_0_0 - 0.25*G4_0_1 - 0.25*G4_1_0 + 0.25*G4_1_1 + 0.333333333333333*G5_0_0 - 0.25*G5_0_1 - 0.25*G5_1_0 + 0.25*G5_1_1;
+    A[41] = G2_0_0 - 1.5*G2_1_0 - 0.5*G2_1_1 + G3_0_0 - 1.5*G3_1_0 - 0.5*G3_1_1;
+    A[42] = G0_0_0 - 0.5*G0_1_1 + G1_0_0 - 0.5*G1_1_1;
+    A[43] = -0.5*G0_0_0 + G0_1_1 - 0.5*G1_0_0 + G1_1_1;
+    A[44] = -G0_0_0 - 1.5*G0_0_1 + 0.5*G0_1_1 - G1_0_0 - 1.5*G1_0_1 + 0.5*G1_1_1;
+    A[45] = 0.5*G0_0_0 + 1.5*G0_0_1 - G0_1_1 + 0.5*G1_0_0 + 1.5*G1_0_1 - G1_1_1;
+    A[46] = -0.5*G0_0_0 + 1.5*G0_1_0 + G0_1_1 - 0.5*G1_0_0 + 1.5*G1_1_0 + G1_1_1;
+    A[47] = G0_0_0 - 1.5*G0_1_0 - 0.5*G0_1_1 + G1_0_0 - 1.5*G1_1_0 - 0.5*G1_1_1;
+    A[48] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class mixedpoisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  mixedpoisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 2
+    // Total number of operations (multiply-add pairs):                  8
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0;
+    A[1] = 0.0;
+    A[2] = 0.0;
+    A[3] = 0.0;
+    A[4] = 0.0;
+    A[5] = 0.0;
+    A[6] = -0.166666666666667*G0_0 - 0.166666666666667*G0_1 - 0.166666666666667*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class mixedpoisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  mixedpoisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "a7eb3b51b5049e5083369f2a1ad483cb1fa1835de3c13b88dea95a6d60ead2b00fd9bf48d950cefffd9af2af4a8bfc15b41193e14dba6c3fa45bd7ad4862ff3c";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoisson_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoisson_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoisson_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoisson_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new mixedpoisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class mixedpoisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  mixedpoisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~mixedpoisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "56784ea4415b93e8bcccb97fb98cf136b9b503dcb660b9d1a64c8e3d9d51cbb9180336262a68cbc2daa2f478317491cc7f718ac2421d4ddaaf7cd6c913a4a88d";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoisson_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new mixedpoisson_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new mixedpoisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new mixedpoisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace MixedPoisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new mixedpoisson_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new mixedpoisson_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new mixedpoisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/mixed-poisson/cpp/MixedPoisson.ufl b/demo/documented/mixed-poisson/cpp/MixedPoisson.ufl
new file mode 100644
index 0000000..6889d60
--- /dev/null
+++ b/demo/documented/mixed-poisson/cpp/MixedPoisson.ufl
@@ -0,0 +1,37 @@
+# Copyright (C) 2006-2010 Anders Logg and Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2006
+# Last changed: 2011-07-18
+#
+# The bilinear form a(u, v) and linear form L(v) for a two-field
+# (mixed) formulation of Poisson's equation
+#
+# Compile this form with FFC: ffc -l dolfin MixedPoisson.ufl.
+
+BDM = FiniteElement("BDM", triangle, 1)
+DG  = FiniteElement("DG", triangle, 0)
+W = BDM * DG
+
+(sigma, u) = TrialFunctions(W)
+(tau, v)   = TestFunctions(W)
+
+CG = FiniteElement("CG", triangle, 1)
+f = Coefficient(CG)
+
+a = (dot(sigma, tau) + div(tau)*u + div(sigma)*v)*dx
+L = - f*v*dx
diff --git a/demo/documented/mixed-poisson/cpp/compile.log b/demo/documented/mixed-poisson/cpp/compile.log
new file mode 100644
index 0000000..000598c
--- /dev/null
+++ b/demo/documented/mixed-poisson/cpp/compile.log
@@ -0,0 +1,493 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form MixedPoisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Mixed<BDM1(?), DG0(?)>'
+  Unique sub elements:    'Mixed<BDM1(?), DG0(?)>, BDM1(?), DG0(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'Mixed<BDM1(?), DG0(?)>, CG1(?)'
+  Unique sub elements:    'Mixed<BDM1(?), DG0(?)>, CG1(?), BDM1(?), DG0(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.030057 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  196 entries computed in 0.00111 seconds
+  Shape of reference tensor: (7, 7, 2, 2)
+  Primary multi index:   rank = 2 dims = [7, 7] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  196 entries computed in 0.000984 seconds
+  Shape of reference tensor: (7, 7, 2, 2)
+  Primary multi index:   rank = 2 dims = [7, 7] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  196 entries computed in 0.000949 seconds
+  Shape of reference tensor: (7, 7, 2, 2)
+  Primary multi index:   rank = 2 dims = [7, 7] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  196 entries computed in 0.00095 seconds
+  Shape of reference tensor: (7, 7, 2, 2)
+  Primary multi index:   rank = 2 dims = [7, 7] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  196 entries computed in 0.00071 seconds
+  Shape of reference tensor: (7, 7, 2, 2)
+  Primary multi index:   rank = 2 dims = [7, 7] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  196 entries computed in 0.000737 seconds
+  Shape of reference tensor: (7, 7, 2, 2)
+  Primary multi index:   rank = 2 dims = [7, 7] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  21 entries computed in 0.00117 seconds
+  Shape of reference tensor: (7, 3)
+  Primary multi index:   rank = 1 dims = [7] indices = [[0], [1], [2], [3], [4], [5], [6]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.022532 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000296831 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.275354 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00105381 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./MixedPoisson.h.
+  
+Compiler stage 5 finished in 0.0018909 seconds.
+
+FFC finished in 0.331642 seconds.
diff --git a/demo/documented/mixed-poisson/cpp/documentation.rst b/demo/documented/mixed-poisson/cpp/documentation.rst
new file mode 100644
index 0000000..3247c44
--- /dev/null
+++ b/demo/documented/mixed-poisson/cpp/documentation.rst
@@ -0,0 +1,240 @@
+.. Documentation for the mixed Poisson demo from DOLFIN.
+
+.. _demo_pde_mixed-poisson_cpp_documentation:
+
+Mixed formulation for Poisson equation
+======================================
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+The implementation is split in two files, a form file containing the definition
+of the variational forms expressed in UFL and the solver which is implemented
+in a C++ file.
+
+Running this demo requires the files: :download:`main.cpp`,
+:download:`MixedPoisson.ufl` and :download:`CMakeLists.txt`.
+
+UFL form file
+^^^^^^^^^^^^^
+
+First we define the variational problem in UFL which we save in the
+file called :download:`MixedPoisson.ufl`.
+
+We begin by defining the finite element spaces. We define two finite
+element spaces :math:`\Sigma_h = BDM` and :math:`V_h = DG` separately,
+before combining these into a mixed finite element space:
+
+.. code-block:: python
+
+    BDM = FiniteElement("BDM", triangle, 1)
+    DG  = FiniteElement("DG", triangle, 0)
+    W = BDM * DG
+
+The first argument to :py:class:`FiniteElement` specifies the type of
+finite element family, while the third argument specifies the
+polynomial degree. The UFL user manual contains a list of all
+available finite element families and more details.  The * operator
+creates a mixed (product) space ``W`` from the two separate spaces
+``BDM`` and ``DG``. Hence,
+
+.. math::
+
+    W = \{ (\tau, v) \ \text{such that} \ \tau \in BDM, v \in DG \}.
+
+Next, we need to specify the trial functions (the unknowns) and the
+test functions on this space. This can be done as follows
+
+.. code-block:: python
+
+    (sigma, u) = TrialFunctions(W)
+    (tau, v) = TestFunctions(W)
+
+Further, we need to specify the source :math:`f` (a coefficient) that
+will be used in the linear form of the variational problem. This
+coefficient needs be defined on a finite element space, but none of
+the above defined elements are quite appropriate. We therefore define
+a separate finite element space for this coefficient.
+
+.. code-block:: python
+
+    CG = FiniteElement("CG", triangle, 1)
+    f = Coefficient(CG)
+
+Finally, we define the bilinear and linear forms according to the equations:
+
+.. code-block:: python
+
+    a = (dot(sigma, tau) + div(tau)*u + div(sigma)*v)*dx
+    L = - f*v*dx
+
+
+C++ program
+^^^^^^^^^^^
+
+The solver is implemented in the :download:`main.cpp` file.
+
+At the top we include the DOLFIN header file and the generated header
+file containing the variational forms.  For convenience we also
+include the DOLFIN namespace.
+
+.. code-block:: c++
+
+   #include <dolfin.h>
+   #include "MixedPoisson.h"
+
+   using namespace dolfin;
+
+Then follows the definition of the coefficient functions (for
+:math:`f` and :math:`G`), which are derived from the DOLFIN
+:cpp:class:`Expression` class.
+
+.. code-block:: c++
+
+   // Source term (right-hand side)
+   class Source : public Expression
+   {
+     void eval(Array<double>& values, const Array<double>& x) const
+     {
+       double dx = x[0] - 0.5;
+       double dy = x[1] - 0.5;
+       values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+     }
+   };
+
+   // Boundary source for flux boundary condition
+   class BoundarySource : public Expression
+   {
+   public:
+
+     BoundarySource(const Mesh& mesh) : Expression(2), mesh(mesh) {}
+
+     void eval(Array<double>& values, const Array<double>& x,
+               const ufc::cell& ufc_cell) const
+     {
+       dolfin_assert(ufc_cell.local_facet >= 0);
+
+       Cell cell(mesh, ufc_cell.index);
+       Point n = cell.normal(ufc_cell.local_facet);
+
+       const double g = sin(5*x[0]);
+       values[0] = g*n[0];
+       values[1] = g*n[1];
+     }
+
+    private:
+
+      const Mesh& mesh;
+
+    };
+
+
+Then follows the definition of the essential boundary part of the
+boundary of the domain, which is derived from the
+:cpp:class:`SubDomain` class.
+
+.. code-block:: c++
+
+    // Sub domain for essential boundary condition
+    class EssentialBoundary : public SubDomain
+    {
+      bool inside(const Array<double>& x, bool on_boundary) const
+      {
+        return x[1] < DOLFIN_EPS or x[1] > 1.0 - DOLFIN_EPS;
+      }
+    };
+
+Inside the ``main()`` function we first create the ``mesh`` and then
+we define the (mixed) function space for the variational
+formulation. We also define the bilinear form ``a`` and linear form
+``L`` relative to this function space.
+
+.. code-block:: c++
+
+    // Construct function space
+    MixedPoisson::FunctionSpace W(mesh);
+    MixedPoisson::BilinearForm a(W, W);
+    MixedPoisson::LinearForm L(W);
+
+Then we create the source (:math:`f`) and assign it to the linear form.
+
+.. code-block:: c++
+
+    // Create source and assign to L
+    Source f;
+    L.f = f;
+
+It only remains to prescribe the boundary condition for the
+flux. Essential boundary conditions are specified through the class
+:cpp:class:`DirichletBC` which takes three arguments: the function
+space the boundary condition is supposed to be applied to, the data
+for the boundary condition, and the relevant part of the boundary.
+
+We want to apply the boundary condition to the first subspace of the
+mixed space. This space can be accessed by the :cpp:class:`Subspace`
+class.
+
+Next, we need to construct the data for the boundary condition. An
+essential boundary condition is handled by replacing degrees of
+freedom by the degrees of freedom evaluated at the given data. The
+:math:`BDM` finite element spaces are vector-valued spaces and hence
+the degrees of freedom act on vector-valued objects. The effect is
+that the user is required to construct a :math:`G` such that :math:`G
+\cdot n = g`.  Such a :math:`G` can be constructed by letting :math:`G
+= g n`. This is what the derived expression class ``BoundarySource``
+defined above does.
+
+.. code-block:: c++
+
+    // Define boundary condition
+    SubSpace W0(W, 0);
+    BoundarySource G(mesh);
+    EssentialBoundary boundary;
+    DirichletBC bc(W0, G, boundary);
+
+To compute the solution we use the bilinear and linear forms, and the
+boundary condition, but we also need to create a :cpp:class:`Function`
+to store the solution(s). The (full) solution will be stored in the
+:cpp:class:`Function` ``w``, which we initialise using the
+:cpp:class:`FunctionSpace` ``W``. The actual computation is performed
+by calling ``solve``.
+
+.. code-block:: c++
+
+    // Compute solution
+    Function w(W);
+    solve(a == L, w, bc);
+
+Now, the separate components ``sigma`` and ``u`` of the solution can
+be extracted by taking components. These can easily be visualized by
+calling ``plot``.
+
+.. code-block:: c++
+
+    // Extract sub functions (function views)
+    Function& sigma = w[0];
+    Function& u = w[1];
+
+    // Plot solutions
+    plot(u);
+    plot(sigma);
+
+
+Complete code
+-------------
+
+Complete UFL file
+^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: MixedPoisson.ufl
+   :start-after: # Compile
+   :language: python
+
+Complete main file
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: main.cpp
+   :start-after: // Last changed
+   :language: c++
diff --git a/demo/documented/mixed-poisson/cpp/main.cpp b/demo/documented/mixed-poisson/cpp/main.cpp
new file mode 100644
index 0000000..e1e8c62
--- /dev/null
+++ b/demo/documented/mixed-poisson/cpp/main.cpp
@@ -0,0 +1,108 @@
+// Copyright (C) 2007-2011 Anders Logg and Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2008.
+//
+// First added:  2007-04-20
+// Last changed: 2012-11-12
+
+#include <dolfin.h>
+#include "MixedPoisson.h"
+
+using namespace dolfin;
+
+// Source term (right-hand side)
+class Source : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    double dx = x[0] - 0.5;
+    double dy = x[1] - 0.5;
+    values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+  }
+};
+
+// Boundary source for flux boundary condition
+class BoundarySource : public Expression
+{
+public:
+
+  BoundarySource(const Mesh& mesh) : Expression(2), mesh(mesh) {}
+
+  void eval(Array<double>& values, const Array<double>& x,
+            const ufc::cell& ufc_cell) const
+  {
+    dolfin_assert(ufc_cell.local_facet >= 0);
+
+    Cell cell(mesh, ufc_cell.index);
+    Point n = cell.normal(ufc_cell.local_facet);
+
+    const double g = sin(5*x[0]);
+    values[0] = g*n[0];
+    values[1] = g*n[1];
+  }
+
+private:
+
+  const Mesh& mesh;
+
+};
+
+// Sub domain for essential boundary condition
+class EssentialBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return x[1] < DOLFIN_EPS or x[1] > 1.0 - DOLFIN_EPS;
+  }
+};
+
+int main()
+{
+  // Create mesh
+  UnitSquareMesh mesh(32, 32);
+
+  // Construct function space
+  MixedPoisson::FunctionSpace W(mesh);
+  MixedPoisson::BilinearForm a(W, W);
+  MixedPoisson::LinearForm L(W);
+
+  // Create source and assign to L
+  Source f;
+  L.f = f;
+
+  // Define boundary condition
+  SubSpace W0(W, 0);
+  BoundarySource G(mesh);
+  EssentialBoundary boundary;
+  DirichletBC bc(W0, G, boundary);
+
+  // Compute solution
+  Function w(W);
+  solve(a == L, w, bc);
+
+  // Extract sub functions (function views)
+  Function& sigma = w[0];
+  Function& u = w[1];
+
+  // Plot solutions
+  plot(u);
+  plot(sigma);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/mixed-poisson/mixed-poisson_sigma.png b/demo/documented/mixed-poisson/mixed-poisson_sigma.png
new file mode 100644
index 0000000000000000000000000000000000000000..87ec57231b3d217d1f7a5d01040d85180880d107
GIT binary patch
literal 78506
zcmeEt^-~^Au=V0ja1xy0PH=ya;O-V2g1fsUKyY_=3&Gvp-Q8Ut+~wo_s_tKL@7DaV
zJ5@8aH9d2>`^@PO1vzmPL_9<Q08k_)zAFI$qy_*$M8iXV^t`HvOaK50Ao*QL#V!4G
z&GiSC=^Na|#HbZ`q<cCH1|1p+5pmJ7@;>&EqVWEQhhYe1;evEa*b!x+8M&Cz<f138
zs6zg|ZvFjQ$_8-_Bwic2t8Q!-9~jrSvgeeghW>d8JQK9dg$gZ%20f)Z<$DK#_VL=A
z6#`BAUr#{{2|0WKNi!S9?~m^9Nn!!fB=7-;(-LSHAKyB72*Lp*@VU}tLJ}XtoXpAL
z5duj5Fh=~};Qwt4_Kz-wsSF5rSGzSOh8IG6w^bk*cwHJ0M0;-{<qWG^OG!jD%cBwN
z2JBh{zfrGkMG`Trw{+i_5|ap_`8t!shrF8_!iE4h8RL^|46({o^Gy&pX*2>YOJ^Iu
zasX&5#NQBDvNIG*<EcjfKwvk7fQPb=P51JSwxkZPf8hlIq!v<0oxYF8HB0O=JBXa)
z`ttSR@hWjyHJ#QV`~;4<`Zc<rz><nvB7yrBcc-TFAn?V<Bqv`#CMgK)L)d1aetV9M
z1DKB)(ShI;{I}xW2q(*FECUgLCZEzq?ZU$_Ny?Z|qIM-lH6_rRZAOh`i%oTmA)|X|
zD1RjAi2y#}!IJEk$)AqeW?|bcQpT^kpV65{TlJFNJM10^yZOu30D4)gQRc1a=RN?n
z^#EYDjHtFtW91V1uFOU~tkHc%!*wvwiOy7N)Gz&2Tq-w6^05MRTl+CD66wcJVjtzf
z?AYK&wdf3Ptlm~>m%;)?Fo`(l{)C}<8*cTCj+8POf3Q_njSWWaVkD&0i7x6v!jCp^
zevfHTKr(Hs|7Ae6mFb?`L8a<3Xv^!rY5!Y5QBjIXMTCHr_4uFb6khD=^?N7{GXYOu
z>tB%R=9KP@M<BjaB9)_Pv`kKW#(wTxx>f&-rCc?j*tBrF7Ow`RWWhq;V)x4>eYBuY
zF&BEi7w+i2&fz<a<7?IeSxg|%yE@omX{@!i)wgCMlizdIhVvf{#_wJ|Q9*dtBSv3@
zMU^84p7R7t>ZTw===iZt{wnqMYY|SrVyu|*FPc%yaX6uUh^42|xPlU~ohm&zHjc1;
z2uz-fmB#j6JOi!e{&~8p3j}ru`SCNIx)0+5&jTbtop^@tsU}9RbJz}7XfB8CdaKjX
zbR3mDr2glAW0tdxj`xiX3OYK=qv-<iC?Xg^#rTPX=cA%59<Z{S+TFS*_>%Ma=BVal
zkfrDD$KLD+t%ucf3fMev=ymO&@bPMMx;&Y-&2r`~2Q~p&|IFLahgIDQ6_EtO%S^3<
zNEw{elchQ&hP+IrT9CvBenB{}=eY_DyEX$ink3~so15C=zRh)gN;_qXM>0MNj7o|<
znaWWflDx+h))Kz<626yNPV3P2{F`KF3F^8j-;DYnuMh6Q8(@bf02z<%(4whtV=oX_
zH<{H`PEm2H>la*x9F?Dd_Y=Kdd+W787%r2~^I3x|B_>d(^}3g&r@Qit>ciH7UeB@G
z|8f!_kO|_0_t)v;UoV1M+JCDa7FX}+%E^E-imKVFifUHx!P8fJBqP;rR3R`J@!)sY
za*6~`9U!P;_S9>#Qa?%;o09%%9i3a4UP%Gw<TQsS7j%q;u-$CJk)~d*b-NoUZ?oEX
z86!@Fju;3Kpu*`9>c&hQc;3#bCo$?gt+{US-z^$_je+-DvjMrD6Ldg{Dgttue2+_}
zStWB8KtVx)*H>MU0Ly1P=*t$F7I|p>nP(e7x;>%ITgAmCYr^CJ7<7(b>tx`j+_=r9
zvn^wyTH!x)4=hg^@fh{l#y9QIHV$sTa?_;E(_lzseFnKu=O*Vc9TWWAUuh{%CE9Mk
zH&2V=f?eGsCe*4NpSs6!Z$OBBrHhCYKnd3);ce{3%48gW?d9;4_WP=#(Y}U2@`!3O
z=Y#8)*loFr@PTfa6|5cY6Yt$d?IRqm_v@Z%9M%}{&}V%FvNJ#=AunZuu6s0xsN%tR
zM$O8ZJm2N_gO+rVuP$Yr^E&It!_HpUMp*Z;^%m}|K0K*!p)9zC*iHSavjxKs-!*Mg
zbSsWZ2TA?Uu~cIX$g@W&kd_dWHC3}=7CUp;>pGth$X79|ZhU880pu{XYx`hGJpSf8
zO!URDAe)vOLli$ry0mT8Ehqy{JqcbX)P7ku)=gzxUW3Y|zR)U0%D>tE)N^<=M<mI-
zQIpWC4#ItS`VMI;t5ZVP)hgqm*gNDM$CD2$5%RfR%$+ABB`p-m6Bj5gJu;e(r%Osm
z9JXq!so{Wh3$wE~%Ny1`HvQrLopr^LkiRLk!F|J(bMZ?2aaAr;zH>05Jm7mF8j01a
zO!{t6f-mS+dU3M%4?im|bNw*wxtYy{E$+2m{%<}o>J{N*n_hm8jNq37f<3}M|0I@T
zoTJiDCnWrffn0KOQ}L&KSwo_GQ5%CLotQ)rpK<(6FK49+uK<YFg2CbA{P!_MuhnuI
zFKnQ&a>5{(1muo!Bn9%eExXJJ=)7J=ntx8E&Z!!{9uSa(zI>lR;ar`3q$D=a^1jn_
zak)!m(DrEpb%^Nd>MAKsn}CML#y&v8_h8MgDuRug+H5$U<`d}UqK@BfT3q5KhjL?l
z)JFkce`sNvX#_jumpQ=5`@`k;C)|%++4KGEZJ71OzDj9e)K{(bSv%`rM{%`Z4O=yo
zO(LY7CRbH@N(aSex0vY(Ohv;aYG^{qH;20R^K4ANoR@70%TP%1UwJeTb8ekqICKTh
zyxniQ{oY0bm`<;}St_}UD=N3bE${PSqcXw>7>zXV`uT;FGAhLj54ZX+;yn{MTV*K;
zF?zxMMGFghzTOKut_-@ZZri;f>MPfwLT>w`DMG(sFQax`T8KRkb3WeN-rt@9NGPa}
zgXwX1x@76u`2lwzEg8P+#SU^&@izaic&^{a?5Pk6>cg~9G{G?*EPaX0I<*D`Bh%d`
z{AWBb^1&*yl5?{m5r65U)kK+r(Fm(E#ZP_)wiY+u(1}{b&r*F3g<K;z=_HW)B{#F@
zHFM{6^$AawEr;e(&gqLPTjkG7%asE^%Px@Jztcu5ah{<xRd)588k~zq^2?{5jtQX3
z?74^=r(PW5-(7;u-&%`8Nqi!9<)4~)+EE;rs!hUh7*cs%&yVNI-p9rtA0IP*MdwmS
z?p$484@BS(6dkqQuRmW75N~*0kC~gBbEKgN%E*lJ->*7aXSRh&%uru~YBv?PIBnek
z`e&`w=zidHokDWl7~~<RihhAUtHVKLwQ~VI&=RBFFzS2_DyZ87>?~Ru4m74}CweRT
zzXS`ASTkN>o3vmV)`LZI)t^&R5m&FVx-i(uHdg^d7L$1`TlaeF6mBfG$r3UUiJC&k
z1fsryG<eKa%Vv0<ttvG!F7h}dF|mOkTQiYlFin23&>OS%!RpV-Xd9slzo$|3$}tmN
zo>E{G+wVC7r+-;%u!2O?m33|(fqH@+fhqH69D0pP$AfXzGBy6!n;EaTeWuG5OG`^k
zOiW(eiHQkUE`pq#oR_iNlZB2CwEFN5{e6GROG{}P7~1NCWod=CeT%hO+BOvpHk^c(
zRZ<POgZ6r}0j@K<W&58QoM2{N{n$TY`p2WQ%_isVGoq51zlR*Zv!Lu%^_c9D6P?#X
zE&l@Z0K3)>zdz}Z-dfq&dUSe+{@F4-`Gzk$wfDT%Opd<6h}emqf64`U7rP_r&Yg^-
zkN}=HfBplZVw{3|HW%ToimE>ou%8Piv>d1%-5_c;5OdV7!tG?B`c)?H{sqF&bg&05
zw8*<S<%*OB4PkqjE0Wje#qIs=)zQJB-g>3}1G&ly^jmD!ngfG_UDvD4X9|0JzXusS
zJl`G9S)Q*pWw;Iw4~K?^HrI>G1w=RA1&v|RYty|pt7LwYMO#bDY)sZ{>1Id}q7_L%
zcfm)>{udtcneH=}s4=S@x*|N73|<z8L){)_EL}<7R@VZKS--Gzx|{YU0Kt})7S*%A
zwHTeQxEkubHDWx6uC^YQBcI8-)S$^MP(cjabZPlhw#_?5QZl?W4pgO@+pN7|YObeD
zbmOvDgeM_D&)%L*ei_{$9NdcSaY14E6jwcnzWuoJ>r;ohIn7O_?!Of`$+>T~Z&Zmw
zu95{>JT9efO-!d%L6wgiaBn#iG(s<dmvyO2R_kq^_pB3q%34}HA3k`)Vc_)CDsO7>
zjbv<W%(mn8uGV~J*>&;b%=8(WcWA1s-!EHMjHR-lq!I}r2yf$Q-W4>y+x^rj@%m_e
zxUn%aU%Z*;<{?!9v((UYS>p9=XLGYu2)~`8COpi7c~%Z6b&qaSXVxn~ibxQl7wu1R
zA>~~TfwOXze5t{rf}~>o$%%Pk(+Xs5_{xuoeG_+BfozPD;^rR4)Le+e*zaB~hsma@
z;XrNWj)+;9IAZn$B#mFttILlcel17Q-Y@lL0B>eB53<#Wr0Jz;zdc9{`)v0i<nFow
zPVZspT28}y2uHl(62t!wMj3>lgrhJb*5aX47b1t@1Lp9@(%iL4z72r3pf7Q!1S*xw
z)j%JoqhZ6RMX6*Lm(ctD^&SZc$^IJ+=y5l0t;O~F-hqn%Ff=lPf`oj?!b1)kildrg
zdz}>d1i_p(1_+CYhzJWmw6L+U$)s~BevRRKd)QgH!}{>x?@gxjQdydGI_k9Vh2MF+
z@Zyr?-XCJpwkPL1FZB%kv4EyjB@6R{#QHBy)ibMII#$0^k>vI3efKrrbLq^o?K))?
zvlJndBA^6em?25myry|yDN+<ksE1w3Gc1zd<Kzml|CkhWZI7)T%IN*8XRpjbUuOb4
zo<9T_Y1W@-*Q`XO;zWg;XaWhrZEfeM?Wbl@0!s2o3hgVRNYsT>KPzs@K@}B?W~EC9
zK=g~S-HhV%X2UOQ!y|v+Mp`+e7f)IM|0i3LmHqFiq(_3;sQcs*7v2$<7H?!Sc#L!R
z;e2^Cav9vQH>Fns{5v<1!JXSD7)=PIYRISYB%L>7bil8)0!CF2saowta;CEa<lEN8
z0#JwMQV$<F3EWJIymXL*9}lu@nZS7X_?*_uv&+lJw;pAsrR%=$ulf1;)6>%o+VzJ{
zJOD?U^;)xYL_~ycMZ@2}r*#Xu(o#|uHa6qq<EZfPjr9{>o0yp{dFh{pM{y0jr_BH@
z{%~0!8z~1k9l8RFX?w?{f4hXeJ3AXDB^4g-a9jO`#a6ZI2-(j3^`$A2x4y4K#4Sir
ztZU#a=gN#qcOgIJMtd)xNkaF@7Grv0d-5vJCThxxG*t3!xZMs}WRTKLdJ!7U(fX?w
zddUrMj}`jPUR}$pb&imE_5O|=@T55Wa$uQfgBUL^@fEV1mxvQG*{3>qpq~=?hGWm&
zrMxoYfs*AuaQ}rf4NQ%g0E>u-`c0sPiCR=E!G!i<vhgtcZScA<4x9=>&Y-k-(&|`$
zG}6GkAZvkV7pzngC?G_Fk_`nX?ZU4=_#y};n44oQ`&a6dUxE4Z^rkOTG0!fnoy}ST
z?t?(f`ugL~ji&06dO)LA=y}gd<bdJzKzhQ<^HDU&cD-1KwZ~7-(XrlUtapBdLtqZ$
z$wA-yfI%cn#e}cGO;mfqeMe{DR>&KAVuWewA(ub-)-a{C>bf7yK-&`d{4?RY$k$n>
zx7HdRFk|2OP70?#Uz5b7Ap9ag{4PmMV*`HZDc7tCA|AbxRw|h_teRwNbJ!a`$n-=N
zba!`ma$<X*xjvYv(5Ny5ueVXg(eUwkUF{A@C(@e}Q$l5zmRj_MVz1O&TUuL3godWF
zTh7PH3%HLdqkY69dUzZWU%p9q!s!|=Q&_`#ZC>J~<)A<!jhp+!GdC;v&RcQ-1f`*q
zzMspFdx~#W)?r;mxEt-7?+CQLl69)Ym#4)ng%6eS`CpVQ5OxC7lUP}h83b?b!Kq&o
zaZBrz7;cB!82$LKW6rAfnWI)*-^6kJR=O$QWVbIukOaO(b!1hu_v9<SFjpylVL0_E
z`=^~vksp;^`F&FfZuUk0@47x9x)#gu?3GI>C>RuK^zA~iDYq{_Tz`FXc9aXB4pqNB
zqLKM%rnAv~nzEt#GP~^sUwINxJk^0<`6Wu7w@eV5t}5FMEqRU~)Hm?USZMTsCc;Q<
z*evy@CJq}RNE6wwu*-p->(r;8<B8j+78S_}k48|rQ3`3a2_-T)=dDjJft1a!Na2(I
z6fA>Za*nXi4yM`Wy=Htt#1I;-uvt-vcFvut{FU%hJ|`9;|10_2<l7*WZH!5KX*|rd
z^kL+0={9A7a~O(~9%)iSPgHk7?k$vpI)87nQlp*i*QW~=gY|_-*@pT$+g3v~0UrSc
z!md`<;_{NgEcY+0q7Cg|=YtenkQ$gr^`NbO3?YZ+0npU`VfKxeBn>VL1;0}NY@9Qp
z{a%1z@y-p?(sP)zDTiB+HoJWTucZ3PCFof~!3h#UYC}Q$?QMG&LTy&8Wlsm}92!0I
zDYhLRPKA#RUMiDOPi`T|xIxx{>A>0Ay(qFjD$H|RZGXs8SRMZuC&xfqUR-$o!r<Iq
zgm?3vzUXowCc4MCkPU|w2bzJ%W_Qw}Y_a7>7A1;Nvat=!nXEY%LUsqKz?ycn7&n!j
z`TsImd7J0Ckc{~*GV}F#wkN^u^RG;#zpk`<U-RZDEcngN+vqXEJ)fb(E<3ZG6P{AR
zsWuj}5?<ug?_-I@2Ghwa=<KSRan>{slhhFyqQ<l*F3TEm>})zNhVGWj`2OJEbK~ou
zXYKl7^jEKGb>tyB6V99iAm5uH1nr20mUIvLL@^;Apsse|#`BvD0mY*?UmlZU-zZ&7
z9!4+4`h_zygQQP$P!g#Ou$yd-1)ggF^E9!4NKLOCrh4;=_Z!?os4K9!AF=GNS4tpO
z?^eX?o%eD9vObIt=v(=5$d;2L-*ud4BLiOKatQ2R?tFXs^B94W)Ir2kv^f`leu=C#
zI{K_M*S<G-e?HJ2-}lL&mUMQRhaxL5E%JlpxUer)CZ&j!3dyThV<txp0ih#wGnP79
zyRvhzQYAq6%^*q^2{2_n#-^R6qXOA9y(lK*IF<Y>UIX`zz;x2^Sp+rjR+i7gGQ0`%
z8H?hF(K<W}C}TR;`+qW3rC9LAZOo+WfMp)ijCaEReX}ig<+qUX)_@?{q7-#ZV|tJ4
zzc4T~D%%{KDaV~p-B-V@&8(z`4U^{NdE&?4F1}YWO|!8)Hz+$vJ{TBKe6$f)2*UHr
zEt=Ims(kvM_>1yPFwo|Y$3yT_uecLXipm8b>tQb4ACUkp2dYuJxL@MG7JN2ei|RKQ
z&+F6LchUaKrpfN3qtWA|ec5mq9&C&iVSA9a;=9&bF$>7~Y;LheRb0oD3IlCoVGxb<
zgec6|&o6y5kFt!?85Ljx$x#J^i5Ou(jukH3sp9$N(|KGLFM-%bF8$dRtoH#t-$Nuy
zp8d6$wMsLyLGz-4v89{`h-e|m9<aOK_ZwADz>3(m{x?DCLcTP;k7f>dZ;2l)9}(i)
zuA_fu6;`RAN$A*$rPTC}?fh{ja$3=*;KzEB&M$`WYlq1l<nA5wT224*VoL0%P04)r
zVK<1wKO)mgPo7n=dhg<IdX3{^NzsK<jK>kDbQN&#8<m<G!0jFuw%jif9SF{67~hKK
zp3yy<TSzl{6Xo-m+1<*Ybe4QO*1H=KYh2aK?fEp{G5l&anjwBiV$ccyj!)vh&1owi
z<TWeV@A;FOq8;!xC=98=qsDZOVii03DOLB-&MkcPz+Tmn7SqDFo}j(vseYfxgbF4X
z=$iO70RewXH@5oav7r4AC_KcZB)48olB?#qfBy}9znW?H)k!J)gGuRV!uBH_fYhH4
z)P?-g#&`_*!S^1--?U!HNl)4Z`fWkNN%d+KzJzg9C5EIII<Y-Qu4${^#C7D^tgBm?
z11Q<9h0sYq*Sk0w*2E-$^o?Cey9)-o4(};g>rn+##`-@zV?V4T;W{6QSK;0aU?zRr
zorXd2z(dgFvNDk`G$dfNUThuJ$yAuK>f#%^+R9C0Q@uFVKTmM)B-fQz<6MQ=TmQ4(
zF^}4>NK2UC<@`W=^dk)gleAV&xoe6Jaz^-ktFJpAq$rEKF3*EouYPaso_6>2#Mvjl
z;Afrk-9;LhgoI#cKuM~LhvZTmbdKy1kcZClyp8=Qp3CZTmZdy8iBwT$Lh)a$S^j0D
zH^w`#jRo4>@{~>1l#g_5%;i@e0c9oqie+{2Q>{EMQ}NP?1*3>vD2Z)N!+@J&R*9h}
z{<D;A&*H%@;4y(V0{JB}N8Z~EZqm9i-e9Sk?1xj~ZcBK7bKLk)T2Ef^BvBc-=iC{v
z`Fp<S=pdBSp6fh+%=)7PyK4h>AF8ouv1S*3hUhnd!+yJ*s5#>`jH<u8?t`Me5=)%u
zOXy&*n*;Gr%(agy;u~gQjPmSB9wTtr#s(?)A{-*YxLJeNdFUL2o)X%eQJ=wD*6)ph
zEJ#w+BA*2HH!lTh)8Ht;b>)TzBV!Oou(V*3=Gr47DSw?tmv_Y%rq1U&-|KRL$Om8?
z0XZGRLwAaA;?Bs*UH28Q6h}zm(%#he4BF^f?5qgCf|`>9Kp<=WH^rhebxEOi0{Vyb
zCZ9J7f7d=#;UE0)rtK9(wHiuU2i~q1dp&mlk^_OyLAq>ri1v%_1hUITiu*{6v4QF$
z0T-!_<A^`DqoP@)A2vPuc-c!`OI5)tWq?Z7?IZy}&JaII0Bam7Xs^V+tM&Avt2YWC
zBhk&4SWO|`*0j?47v2l;U&p|eLZ)0{o(WI0Q`(AwkTfB_Z(3{l;)vbf332B%>ayi?
zhuW$*&fpOW-Ke<+usx<90!ZvJJ-uieF`H{7@j)XxZyk!nBn8#4v>|`5vTnzY+bL^D
z&$93~o7*fu6-U3*;dMQHW_X>&wC$vuN=-e@c6DM6_!HlKh<}T}Bi-uaqN{5Aru%_-
z3s!Z<PtyD9{b!BkQ!2;y+O35+!$+7+To7bii0jr!5@@0_s$Vr%w6@E+w=VA#Zav5)
z*uQhz>zFwOp=IM(Pcqt0GTBaU)XHVBY179mdL3*;np#a1<EckkY4cY{$ameTDfq{4
z;|r@7<AVs+<}(9E@NW@j`oiJ+c-QFaWIHHel)>@h`S8|brxWr&l>R}$6Oz<&R3?4o
z?;F!XgS<84=EWB}^E^BkaqEDto-q^GF)N$h+Vc!u&E9py>th9Xxp&4%?EEYLksGON
zYqVuu_FMpfO_{IoYr7b%#*8%ZO}IpmQ;=~U-gn0Ut=HG@1|8#F?pVfPneSa8vJv^c
z%;a*#LDo!s;`?`ESOORCL#YmN%2{QGpK_>;gaopR8y)9fr_swMxutUM4Xvk=>7>Z#
zJ$`wSUZ;OD$lLAP=1sQwTu=oqtC)IG{gX>pk6=j@kqF`|w@nB7X;6{_JPG(I(pzre
z#0?Tr1P|dg=YCqAx*>p~e0-!0$NB39?}(#(^G6eQ8R#bH<*L+b10xck?C@LLl0*qp
z+!=TDwiIjTcCM6ZJIoL>@-vjuJX{jK?X3B=PlzY@E?dz!o@T0#amKxk5meyib2*7;
z>_qObH(0>&;|>m!=X_xV)+vk7;8Te0UUK>?9|`;_oxTB5U`Qa+gj^*;R7>v+luUNd
zUf4!Va8C`$=;9&^(%Fd@AYlIdvz8bc*;&Hy<Y_^+M>={UBkD<NW@(g`VK{au-E5J>
z20b9x$_G>AMZ9bsYqg3b)o#grfQ0X-ebVeG;Dw_(zs~!In!fbt$k9RX{-$Dk&=qYw
z=}y2+TW4&7@HLx$pqd`zKySMCA911FD<8x^3oSo{3EIc`sY6lHE>37;wW1bn{uahN
zTo<tPj{YSl=yAY8)yoK|M89dpN;KpKXfCn*1hFX#6@Km5oeJ+2{#x}R`y%dW(yo^_
zeGhWTNKnW(uMP7s%h(QGG2$IdGLz>u!er~xhe%4PS%eV86h8R*xFVL1he}{#3DtSm
zD5T;(?CMg(NgbX?)BH{tTh7F*!CMFR=Ji|f5=#78di)2@Z)Lo1JgHerQxm9j4P@BU
ztXui>6nE||EfW?6{RP>n2jTw1=8X^k819<x`7EeMt1lyRPYlEI_TeVk$`2WjIK-cf
zI<_yk{X=b7PO9c-D~vdUvW_0@WQMe{0m>xGtoHI^mx>OtbdAL2I}ztSN~8`9*Plz9
z<!ez8@IwmZFJzH1)4X`X=BNLo1;CKc{}+NpRQ6A6M&Zu>x{{%7y!>zZkB#mP9UR)~
zg_Z&y|GYWhC(QO)sBCi{%9$*b7v`x|&atgL6NvbpotyWtl;13=L1lADBy6%84dVo#
z<;|(g%u;RMx;`h6svMdZg_Mn5vehAWv-SeJq~RmokX%l_NFd(s`Tk{g7Jw0RC3!~|
zR1YEe5;6S6cG%e8>C#30JgS}b{fe_^T@jxQ#dudNjjz(kZ**67D`ux4Vd?Hv)7cBW
ziLZ!)+3-CmGTJBi#<lQ@@b^JYdg&KZy`yngpTJdndS+@Nr+sD5JCXkJl>s72mGr-I
zZD)w(c_n%j#m_VvObbl+tCJ~^ErE2rJuWt6)~+MaKeh0HkEG)vaT*7c`uHkRBsasf
z=fh{ho9d~{=8?m<6j!t@Tiz;|x;Aw=WBp;;(1&4ur;yaIrnar&qz{CcG-}nrq`Uy=
zM>3xKVMtusXRZ6s_Yz5^=Rj+-JckIXQ=cN!Khe7`h?Wztpk-1HJ@+DS&NrWH_E>tZ
z73P|26&vPn-3%3J8G(^6v=-C%ZkK(o4j-HAl{qY%e4z_9n4IdKfI~6!Fg+SLG!{A)
z67*TGJ*M6Vn{K3vAFb|Yeq~eM#)Tas_BSE^^-2R(j|UJkgVL}l((S6eg8lAI+ngt=
z_S*rR_-D80BbolBbWmogJTEc>ExyOf7COWROO&Rk1nzD@jRGU^*$1yYZ$&n&NS!W=
zqmbxOze5!OyVS;+m68kOD!$(ko7I)FMXP`m2QP;BbXySuA?zYMi@>`S2e-reZPD5+
zN>@k^DN=S=L(9Aq9-gDPHF964{WM0>(iHn5Hw^DRDr4!9X2U|eWsa{4$%c@dVTA+^
z<6^SP>Z7qZsEFXI@+wJ)YcnGG;%M1Ty^bfK$?7LRlZT>21yx?G+(D5%HkY;fnDCGA
z9z8;F5kKfHcHw}^Fs*v&#}nRH4wss!EYSsxVUAkEfiM>UX`#$02+<s`j%pQ4910$v
zl6HLuiTLZFj&*@K54nz2jZ&3zfgF^!@AT^#iY!7H7N!7#L;WKvBfAC0D}%tA>2M?i
z`z*0DC4Z?U{~5tc^ZK;#S>}%%d~$}zTx&6->S%}a&+6ubbrHNt)72CCp<CoUirNL8
zx?6uYCI_dSmY0jkkjjA1k@bCipHE6%?^;#8Nmx5xA6CMIbr0xwrF%a3BeB7zlMKi&
zgx{3UY%c4F8i=2?zW`NYhb$g|Q&utc$Q^D*iF`><kQCrF5r3HimrXN(l6@XMGc}y?
z-pzAGBl+P~0cwSBh)%R`cN=r`@aP#HE6^nFIrP`;fx_|)!VZ1#$g-FxzZnsWd6&Kk
zvKhqC?(6}f{yX_JjLIH;SiOB+xnA7GM+_FWSTL1t9lBqnI3?NVK$@s)sw<BZ-gP9<
z%ym2|Z#itY97F93jKsXlj7EiriAgV*XA5n+Z%5wh-KELbBXo=_XBInVg4-8L<nR>;
z)8dPw{Gk0|u=2Zqnr_l07Gl%`#=f+$@DjoZmic`M>=-tbU1j{h_!Jgg=XtirL^M}~
z)uO^t73beJuu9<3mm>eQhSB(Ie^GQ=8J*IlTLroUv308bQE)dO&b*NkeiScUYqtE)
z;%eK`*F+c%EowVp(qsBtQ*oBYVad`K2;D!O+uL@k_R5DH^f@7~M}BN#2bVitV-;lg
zL*cSi_)MR0q<W1Q%y6;=i*{{Ca9|)SuAOI#{MlDz`0h96%g(7BH#;5_oNt<))!X9^
zC$88SQm7sd0v`8!af5236B&Cq5aNNx+F&i%r_KPdv>*B$+M1lvz;`Mf#+kLHW(Igi
zeFoA!R^S06G*-Dpr{L4gRh-s{mQTlCsPCo<A?X%8dp0ebG)t#kxAo>yslr);5E}6X
z88u>i%r(xGibj!+uZytZF#R8qZ^ZCcg}J9poFs}%sNsp+!?Lp7@O_RE2-N}4i+d!M
zsx^NXZm{(R=4rL`%bQPjP2iq#Wt(f|MA$Ov2eWEboohO<p^`;j$?pDz##<Bd&2#Q#
zrMt)#?$~3Eq<L8&xZU+SY}_oM#9cm&a*aw&{`7Wa%}W3$X`BmsQs5|BuQa}w^sQB(
z`^4&E+IfCY^2MH#k1PzI%;z6zbm1Wpr_{c0kxV*8qIpTOQ=wPIM8A?XESC&{-#&)k
zja7<*RMMH#nXXNhW(h*p(fGUm`y)800n*Yzpi<_Y^r1eKxhe>CB02~ehw0xrk-!g+
zmn9D65GtqKM8o3SHR%XZxtLIh;J-vLLD!K2bYxtgs8pusK*^5|m82~wxZ=ai7|k<E
z9dEczTN-6YzlD}%`{6&U{vCD8=DsPU-WjT26_=t$7ykLZ`01&Fy^(iMMKHB=r91~H
zoo9bfk2m5n$FC+8Fst1!(lvD;u3*{cUey)LHz-UR5S3AsVUkK-;m|)0{2k7e8|;IA
zR`~ll%Zfq6GA{Vr8x}M`zD62ncJvYN5MTGfWA4RbiAq;hluX{w$c~-#v;D=N=~VXz
z%tG72jlPkacLnvXP^Ay;g6khZ$@v$-DYN>Rno4A+8tarpa-Z!%0J$XjB321cP@UNM
z8p;?JM7(Kb01Bhuxwj&wPi>VsFuSSa42Assl#eKA-?XZ`@BtLI_D@rYTHjwCPR&e9
zw_@BGx`;vNENpfT6zpL0n2CPT3Id!ezMUjq-?tjueyNQ@GA_-*4Eo(=db1kAqHYwL
zH-rbIfoNCeZ9Ece(#y1)GzKCrJxCJTjIAU~1W9AF)VE{G5$~4Svz8{pY#J#Np(UI9
zz_HA5ieVy0)f`ycKE{c0llf(%@nDP|6OVp#eQn3KW}jU9_i4#rM>d!y`pHmH4F&vV
zN0*!l3(#Ui1?@zu4wG6fJ@wuma|<@36{o5-ef6FODDPnbV$`w&E6{%%c~-v9+zjTu
z%5R(yA5NWR7FW7={b?CanT&56o&#r`!?9e$nS45E&~clIZlrZG-43~Hb097|zxQxz
z&=wg1mBUTy;>mF({b(-?*`T5UedpKcac`<uwkcVLn2evn<=~|zQRSY9PJS^*mYqS8
z@g|IT6C)2%+pKbo;67K2>(HN;hlfD3xw|ix)g=C$NQrVp7HdXb1Y`1?VM(dE>auZI
z@%83t+O`E-{#^odHthJD>`e6>7N_DVb2Tpy3R+tp2PKcPT2oKExr6rsw()-at(w&8
z3$vonged5Fq$|XfOhjDb{;drHKf0<tiB`9norcpT_B(Y!ZOHa<7X41~EMdri?+6|F
zp8kGFj`kV*`8I+4vEjbIQL`&t10`{4Ok7pfwaxzP+q$L?S_x&cr=8hechjS~heU_o
zKXJ_LR%3S#B|MCGiYxcf!%5rvhj|o>x0A=9&btcN><;T+&0s5ojU{2(&kV8lx`IT4
zCz!>guAx32{aShhni|91N`RJ>7XyVrOA66@eJXmMRgvXA%Sfs{!z(yi?n#3VA$Qo7
zYvjIhI<d@zM~gZqmuh5<qtq<VXuitMD5SxrLAf}0bSzvz7LQA*-P;4(Pt)X5fO8=;
zATI2Q-HP>S25U_G6zJbYVN0)t{9MOAuDcV`&fD#_>Q(3Hq{gfDDV2#&4`p+=_f;e^
z973OKahu&eIP+FditT*K&G8@i{Ts$kN+hg&JKL$(&~qZ@T}H`4xI5~aeqUzEo}Jro
z3$3p%W!>Jw{_@l}-@=0p_(B!r=<h@J1bBoj8L#oATMdk`UevGAd1dW|LbhSxgu$f|
z;Tbt-5;QSE4qD#8iqhy9-@>b!r`MuJQ^};ax-}NcB-R<fX=EC;OKlZ575N#Bo3?X2
zm!G*MCf4g=JGb^gk$$;y(_}g|ZWA|gB;#e&-cgkTF3+SM>hV(;VMO~h%KmxSt$$Cv
zcANvmVH|Wn?I*GVx{e0stC5YbJUEJNSbYkBOW|IPvL~<^)}0<6F%<mshrO?lLrzsp
zEKNzBbH}>TS`&{I6Urmk3+IBf$2-Ioj`#}?i$)=xNBh=QSy`E|&;4^>V8+W07XVK{
zUTEHY7hklMA6Iyol~qHv!BEb<iz16d;5m^+QPciub71zne4@wS$`w)sLpgp+WTLNX
zw{gS20&U2it>0-a+f0Q_==&77=~9`z3<2gcdLn|mi83nzb2#RvV&a1>pJT^F-$k2-
zVCNQAV^<5gXa5Kqf@ZpN{pT@%d?jf;dXD`ECb`+2Be$#`^~+Dbk6hHAZaeqvbHqsy
zlcqr~dPKf#-VM1))gKpFSa#IbAiqXa!!l4=ow}ZndH%?auUN%7jg7#%y?Oq0UB9kt
zDf{I%RM<%`p3t&qPS=qVFpcIb9X>ER@3oE<O9_jXJjj-HSI>rcbEKqM2?#zOQ_9*F
z9#ZK=#RL$|7^D7bFps0)Q-$v|x$|LJ-o35_JVs~2y>uMU3lcB7Wah^T@34&{&#{B$
zRqD@JzHgAMd73(QB~b$WILFhrg@!>Ph`x4O*jINnm~n{D4FvT>+COqpao015jV%pP
z{2?e>s5SGA<(Eswi@5LHosUJX^iUIz?u?Zl>D+;SBFWPtt4T3u`i8ra=E}7>oQy|K
zpJ%SrjEc!Xb}l8qI^K#E^FQMZzH()m#w=gxMP5Kuv3l(a6*CTx2RX;e9aqAxE8GCv
zVWN`WdDNW<SmPU>B=}FL>ti|&v7dRCr54g+$3ifK!f$5MUnb7a1OPHhbRaV%j`N57
zPI#bfRjmGJlJ|A*a;WQ9+?DM|IiZS`;4qrxxjcXhLjUkd!<pFJ6A|+8(a!B{$K<T$
z2!iWGCu2plVC}!CCi|u!0ODk3*)}u15yWrI_wGG2@8SLPFnTYqToeb8B)%ce`J()E
z6<EI(B&7NJTrM}-Mn~+&qi8<d(XEijI>9a~r!ohwcGr2k-zHCC<kErN#PRG7Xx1fS
zMasSnzn;u+K3?B;1lI`%X?ox4rhUpzlXFYxsr%~FHvf88$}rz)L*I$)t;L9tFGGZY
zHQBe+Rn16;q`wTp2KE!~hhKgiu(?UQG<L&{ob!|_iz<Fls=faZr1F+s>clokDn{!Y
ziZ-(w$b`LR?<f<qSQM*<LIdB#ri{X*|0CfL3sk~>?37*?W7Mi!;qLvL#n60{BHG~b
zxC^mZTHp_Yw^#`ty>Q;buBr4kIPWzWbzHjIhz)$<!VAj5jS%%D(Df!jNx<>t_np6g
zl?=1dGnEjPcnL1-pn+3xjvvzmf3E)yvDq1>23*$UBV3z&6A^W$;se;AzF(pBoBYI=
zZ{laL>a{9Z2q;wk$54}M!$-`3ntSZR+c0i(vFL5o5f+|ayvYmmsQ0amKGS4rRkhs2
z^5uF-mEUA43=&3a|AuU@)J^p8hD2;UT~7^?WFNd1=#W#G)vLS3cmLg>m%obrofejv
z&2+bGw=E-z@3l9%ho)uO_D(B-JR~-wZ3*-%w~g@z>}AXaLxAtx2tF2A&RGs}W*4r@
zK02sx9+N$b$|lTaOK<0LQyr~^GZ+pd9VQY6BH&IB)=!d6l3VE|GD!Z8Ru{DYgCjx0
zX=FG(5<kgCcV4#^tJlrNZY&otk1f2dbzE3o*7i}V$EpU98FSQ*RmYK(Ss07DuI)7v
z{sr6ZvQ}66d$kSX_53<B9X*Sqm?nx5N5+BaWx4z5L`*^Zux_q8_(+4fhI<mH8@`Hl
z%=G;5<u?Vx@Gvn$>>FuP!Y@D!R7CWW&F4CXT_~SVl;Xz6fS(cCJ&uX!TgQksGUe{D
zg{dd0+jcaZ#A37H4k^H>Q_l7^nstQ+5M^KW2J1Fp=U5+PvHB<r+})$(KZTK@9QK0e
zt>fS0eEJM*$2|sC!A?&Cklq3My)1K5-$zHLDaK-WG?&jV+%wVz#jG`rYgdjYr-l>1
z%8wBZ6n&d>!F1M^b`|?h_~d!AA5uruVk>0wS3q{SXmgXZ2e#u2M;<vU0mmJ^)v~3m
zH;CtPZg5ESbvp@G-Dhe0BlS;4`iss9d$j>|!RCp_$tmF}Il-@3jEAN#u#Ct2HThlf
zA>%SB9q=9sKFr;756zFf6p+<EksVkLA|M*u;7hOXIK7<?pCRLuvrvy}yR!(M*b4Kd
zGjP&9Mo|?J&yYH^cTKKq%;T=*hk;1fn6C8Htt*(F;a-QOM?#iL`cpeP$kYSPvaE6_
zaQA&?d9&Nmk^!Ub{k`g$;5Oh&!~f6aGMC-Wa&&ijN`g(;ea}`97|i?yn^vb)V^;m2
zF~MBRDRHnWgc-vv^c{v@o(_&*9zXBN*8%AjD(QHz!>_`wsblKWx>-jXCR`rjWw%)f
zlDCq|AnU@ro*62H@B|_;DY~FQe7To)ZjOIiz9;r42A2Q$-CQ#n-;OHpvaXyBMoZ)M
z)?>g-PD_(*pw}PuFJpPtoKd<*!g?Kcbp{1A_E<o{`?umiqal34OK@~(^uwAMUtTfy
zZpKp}o*zrRJ)6U=>5sFp5$d?!D}{a&!wGNw9Gd2pF$+!R9gZq5Y_6-g>`JyTWVxww
z+??_^6N)2lywH9*o$hZ?WPUMv;*SJ>7siR)vu!L4V!0F)o+PCQ*-#Glzx&6o4wO;D
z?pdaaWe{~YrE`Z#kHV+{WaAM_3#JRjNJpL?#IVt=&MHH(Kdz7JbGXT@#YB&G21big
zA%3rAn(?oVrk>4jN4h?agbD+fwzuk^P|YfkAjrKZ_2%TAsjWN66;7?}DJqVNPRlm=
z($B1FI7DImU>W6>^vzRkc+Y)bo`_d~S(`iDI-{DekG80*T3{CETF@siMu|9*?Nt@K
zR24jWyR@a5i8=)iP9V{Q-RLIRmInMyp7qeAja)*X+YrNiv#L@vkC%}jRP?u@zN(;B
zF#CAO%rkT)I0W@E*Hj|)yIY|^HXKE~5-Jo@Cr<HWy}J3c#8mQDZ0&$astqI%4qwMu
zCz7)=e`Yp4@axJ3wDeJ&@Z^5G`COrZe)nQ#F+`Y#xqv#N=cd1y$W^7=>Cq?<AQpnx
zPpdaZ1D-D`SCo$3lZ1dla(TNFP57o9&mn>a`fbnS#mEb=#aDM|p}Wkx^QSiBB>sAb
zF|X2_5G5`7pdda91+d9SW68(vnZgLzYmFS(d=+n7on7qU2`SZrm~H5&a)E5);9rG@
zo#+^;g&z>?C{QbQWAwy_zR8|<6i;XA#qZZQw^rcMZ*3e_LmvdWu;eQ1<yc&{G-KDf
zRac|HJT)_WN2#|a|I;yqcPm9AYAEU5tIa1sDubi|y8D`GR_(7fB=hkNn${-oyRoLX
z3!PuM5t&pbUA$;W_dX0Up8MCm&Iin%`s)EcHq-pI!r?FVO*`~Y7M_eJ-X7;Mn~!a0
zFxH8yl)w@9&L=8c@C*413zB&%k%QUcR_*JVHZ+D%6r3>G`MKho11XRwI*6iWTcgY>
zY}=uKm-2#3i}-o9s=AC^1Ag<Azt8&}`=ssxNOx~!F-#T9x%$Hv-W;{K9~<AQ<anM{
z4ori<Y7Hgj2Mn|(zU4=iqz<9eMpuMh+1z^&G$@}#`RPZ_+go5d)2r7}lcI5E=G!8K
zUIT%73U#PtxArW-!#w}}xr7kT(6B3*(#)?<0R_j|E1g5UoS~6FN+PouOuqkZ!`7dQ
z2d_IM*&i<1!#$sGx_-V7rDfC1jx+=m*yx?DjQ&wQ3%vt60`SUFGJL$wrkl)tv*KKD
zcuMKG{j?kH3umG$OnRy3EFZ!VWnx1tEkwVOprGmv+~18{kw3T0Pyx7OL(xCVqK)9S
z6UWfN%g!v!->C)*s%WuYEILy=w>j$1F?^o^%C-Z&5EVQbZaiKATFqlkU>ZOq2tQbL
zCw4y*J3qyHhGIasroc(f4ZGKpYd7lG;A5+9S?QfWvp0#TAXdia+BCR5YLE&4vklj0
zeB5m;0+Vvm4XI3yJcf{8yD*+A&EH0>#Ccj(f{`z@<7|L**x#1;S|fEq!!mJOWOjUz
zUn5ZQsk3w9xi}W9$d<;6*8~>LN7;B*=UW8GS%&*wllM*f6D3&o2dMs<JLuJW@~DXy
zSVUU>nklu%NhG&Uba@XEWUX3{^!9T!Ab8@(-L6w=KKQ`d0|Fi!GHOn51?91{NMc07
zgweeEGa3|gW}UWldL~W-vw}*;9CWARL3nD;HCq$;hYDfHRvfbO0B=>z_SzmCSrT|u
zvR0@o5q}uil^4HG2?r#M(-AV#jXS`iCZc$;=CUu?yBRcnmxlUW5Q5q!G*n`;@16L{
z8fK~z{Oi|BcjOPk{1kKseLl8BV#Di8o^uc}v>=IT^j{ul%f0;WH<T3_4P<~!u0ZwN
zrEWQJszx<D{)2Ok<XcJXMZQXHJ3Ij`g|^xF!J0XfL!m}AWrn`m@VO0PZd+B~Yh|qG
zy<w45a#VWZ%%@+ySs+3tKcPW&T5MvazS{xtpva#GbZmO4S4h2dCWqLUS^Pv(s?j8;
zp+4LewHX7$;LVPs8eId^sEi#dVF{I+%mlF)s9!`Xnq_?0E&MO+*TOTsx8gr0A$B12
z7tR=V1g4@MsiR|9w?y{tn~cc%B}RN}MaNX#%ZpbmlLjR7Y!QoBOoonCx2xQXa44sQ
zY41atW98Ezd=Y;RWCh_ie%#~167}>M5b!76EH4xpT}Wp|1+)Dv7u;8s*CRN}s_S0}
zr~*gOwEN-$J@uuFb9oQMee|+6FQvVT_H&Pak_5~N8PdgVX+Jb<E~mC80uy~0`S?np
zP#kmUV-3ZNN@jp4?33TO1;ra1<*5!lbO1Q=Y=%Kql)UNwlHmPIoCc*Sa;)td-LI<c
zt0--=PnK$2ArjFR>n_io9Gw_)zLLRlhcG|o@Ad53`fu8C;~rMJfWG|;gZ4|Tgls@G
z`=WX38|geq=e6zk{x@y|{Vk5F9<^ZF>Dw2HDTpkJQVeYD=L{qt<jN0?PpF(5k3@8-
zH4_{JmaTKYY-|uE5}<Ls6#6=Tjn7!IC?l?wKXq08Y6IlFLT>_*jB7jnGaXk1>+ejL
zeYPcoZq&6Z68G=<M&PVZ(}DwZ92~2}!C+A5j|x%J%MCK2MeMfh(&yWZe>TD)p@ogd
zdFL;;Z(ZnA8{fjPYCjb2$xrJgGTus<@$?9?NkDWkGX}#>ow9+ENkYr2;*7B_u@UVp
zfp=}m1ZG#WfmGCx>-JO-QkgcZnrqe!PiHcC6G;e|Ifnb<cqVRhBmaCN(G|uL8Np1%
znk_%DMe}5-Z3|j{^efXH>syUXn=Ke(oP1=;>RkwUy&n@`H5A!tpa^|y_8%zB8hV&I
zxb5RhnY?gss+scN$leTWu1t>%^USX}BaKGXz@?}7H$If~AY}GovKbH<hwJ+|u5Zwf
zfk0n2Z0|{EU<yEEXU%>OGhpCd22`y6F=(y*{`}q(6sb0eRsP2?5~QSeWlqO9&b!D}
zT0dawKTcaFL4B4Upm=@by>aT|kWh8d<8ks)A)xNDyQ=3;?~8aY&5gL3Mq?cp<?M>r
z)X(Q{tl)KkwHspEhvP<($x3t|6rfi~;y0Xh4Y5fCe6AEsb*bpx+4Pa-*04+7duPTK
zXR*ILdOw3t+6m;+g$J_UPx0^d1aRzi{wo5c`XHmXwK8%#U3X#fR)(+ClTaqmq#=_h
zohXlCOX|=u_^sJ1b$Ko6Z-eOi4Dtd|p3__Q=V3mfM=gGyA@bLVC<&AlItrbMTDS<*
z-zCtw;$2I<OI}fC_Oh|7pfchqBH5t!IPZ!y4>a&SVFZ_VXGe;lwD7NcRX1ICwOIVk
zu*IQYjE(1KwcWmd8Dk~mAb(@-Q#`JKG18MKcC+Fk`x#puRIn#^Rog5VxsH&1FuYDd
z$Moauv1DcWo8#rh2h;VcCc4X5(KQ?C?IdDM#&O?B{+^5e^pE!S#3tC5US4m8-!Rl;
zGY$R2N?UNpz+lgJ4HQ7J#@SmvkfQzbUZehp3ZnUqFr!hV{qT#!FW){D@x14QoVTJ#
z`L2C_O645yO}KAcu7MxCm#S$U<Rr?>`Ki0#hAgijwxjKzuX2<jSJnUMX5|yT!pM~@
zTJ-7Kl@N9JZ#X-S9HDF%k`}Tjj%;_#QVW4ofiYF~s{6P5sE4Ejifi}^n2#U_%xv8B
zbV#dwi+=xzGQOBn-RLd_G(&IoGC8-|s@x{i7-_m${~hR>#<J!VBFSrDviS0%rJ!BK
zdq<?Rrt9hQb525JcJ+xXYG|Qypx#IdMvctK`o2=e`9Roi5Vy(;asJh+H{xw${UBlS
zT3YHWn$oo_6yWX}$fLQ|SU}Xn8_E0<nR(V@?AFD3_b_+Oa#qpT8=3Yv<16!GAoX@b
z41x9j%IvpDcJx=lC4b`+fFVFITEA4fPK(cD8s0Dl)tPQoz2Bhbt#WPaBYJ)%?Sscp
zM?xY>8HQsME)Zr`3uoM*?erDpzpIuDc+nXMx(!4`5_8qY@^KV>2O*{7<HN%L?}MfY
zL*c&x?Rhrak3P+8eM?lO)R9nO^#q<$a=jsNmP!k~x860{>zLRHdhC!2PH_Ml3@gx|
zh-@h@1O(0OLlECy)w-WijMqe+J@0A$@euut%8pY(-)z<Lb_X#WUaaSy_{gu$XsPx1
zV!Lz=s^r8~mCb*RdsrJRR@_$a9gppsxc=l}tXW^)nba(^XJH62DDnj`(LTeXP76dO
z`kENXqKh={J1M1HTbV{qu0#2eC68H+*DyT3Tj4)Ct4yNNkQHh<rt=o6TtqFM*ywa)
zZaq#cTnFl3ohSk~Da%MqbLxMsV*@2Um?AEgyt`_8Cir!8v(Pr#pGy~J@h4JQBO^Aw
ze#}InP%vRbNIbBuDOydTei|KGg(5i}Cm-*b_jR%9Jm2govG^Y?z)+F6ZPRJKF@N11
z#)sxR<Kt@56UT)Q`&}Zb&(eX)7z(XKw0X4h&$A~&ys&)Ph|Y5H=?U0lSNrC8e*QN@
zt5<Zte^)RB@&k!(-1dg%UtH_38zy+piykg#@`IY1+m$iVvRBNzo+8*gP3$vjmT$DQ
zcG0m>ofk*`-kA|NCxHoB3z^={sZ7vioZ7-HP<%hZcMp+sJ#gMQMZ{&?_wgVYh;V`A
zNsr7aWF>zi*`iU?^BcW*uCqya=}gVR#nyPKWf32*SplGgs*phb$PFX*lkCXQVtlQo
z?s~FwQij%z_6{BKI_h@RoWpjhdh1gbqRiv%{`tGO1e%Me^1?|)BR^ZY5j6*~17L*`
z9jrhfTpfWL13Rt;ST&?bH3Y&;I`p4?^N=yIn&`7g%}tYUsUNrbeAD>#Z3?X+#d^qI
z?bU4T-4q{iZ#4U9VAVskl46?npeh0}YEGzdS@2Hy-n(H5A;TzPAz*yFv=sMAt<Y<p
zj!jwn(Il>Xv;ePI^^<}E<kMn2YdtNTA3ART=evf4_8(SsHISdZEF8Mdg83P2#OtsH
z-@R+3&zFq&H%jq7_cogY^L)M-e>`EErL_K?DW~4ZWp(c*{TSl6QLPmu--MF?d*7k`
zm;^ak18KItzF+M6TOMh;kh-r+*oQWdW<u@WI)hQP|8N(AMyg8pu<l95)cR}Fz=?ho
z!{5_;m-|Uc2%@kFr+F9SyT^7WQ46@CId2mI@Ozc(y1#6~8ZoFT#k$7zqaG|N5rt*s
zhKlyjcCUYEBf0`K6@I9nU+CAT<}cN{VkWhJr>EP}&J%u85jIKs_^wK;(bd4WuTJPS
z6;1p<nyxY`j%ZCb1cC;4cbDMq5Zr>hOK=G8A-GF$cXxMpclY2j5Zrg(zTF?3Va{RB
zbYJfMq^iDZLOAyAteXrGE~}Zc>GabsJ7_?|&GQ@^0@0u;0v5?LyV>vS^y>F(ZWg|^
z%5Hc%r#9^_+nOXf3Ibw3j|tSXuwUgWxLtAxQ7XKXyUd>f*o`;wNt5=BNI||W8+Y?X
zTi+U}<zSRPkzXi%FL7LQz6w}!i&e5du3V6?z=*=_q5Z&FX^79z!C*U)M@fGdzxNzz
z_I|y#XQSn<sQ#?y#shphGtKr=V(nnRO;gFZr^}?}+))-2n#?9LovnN}D8V>5WzA8>
z+VZ@<MOlCvA=2tr^A$56BI=D*j#Z(6yRw5FTk#D?S+K}TOJZEny@Ta?;PJKgqcMpK
zsuExMZ4HPMK)mkw6K!w9$j*~5wn$B9_xEC(``RG*6Obqi;Xjoh-bOeHpfppK>;#<-
zFpIGqd;(Oh%hp!|=q4N2uWt(r2ubgslWz=Z&0};ff}(tKUcRm)(_6dkxZHy0Pg2_%
z%_CaPs*w_eBLgpXnaH4w;uT_CQXJTe%*790)Z$agxa_eRL_SxQ8D8H!0Vpp&%L=Ez
zb03Kw53wUyRq6hnvHrv4n#d$oV&M9jz{mp1a%zbecat^m)}orjAZ+KJG|)kbB=E|Y
z;zTVvq0oI9n2h#Po$_feej}Y*NYR<TOZu=G=YmVS{Qd@$g@yX^88l`U61!hx`yEh9
zyt6u;ZQ!^BFKE9nqgBln+lHl`DKMfn(}$1?(|y1sR4K&OT%{Ni%`78qS@2IW{jAIG
zlfSY@DFwU}-9bR3*J|iL7Qdj?Q%W?&NPAt4wc74ktFUK*diP*P0=)Yd@&h(sf~$Oo
zsM{-D!P3(YSHqA!Y8BqDuH0*{WeHx971xzRx8RP;Nol8j>KX`Py@KvnXS3`zSRjlq
z;3liIZn-;rI^C*yo#M+2>Rx~$Q_dUX5EccgbNs7A@v04zduOi|v4IfAVotDCV^>k}
zRTS?8&Wl-t1ELV$Yvk>RxPFY6C47S!NcC4fJfv{n`)yJ+9)s|;H|g!a7V@1De-Y(s
zWVZAq9++&ncU*0FP&A6?0E(!TLpQ52NA+9BY*|27zh1f`4<a?*Qz8^Y?3?pTia=I8
zDHAXgXCW*V>P#?S00YdFGyY@K_93K`GD!j{4fyQIo0A-6mDmXt!uVfHz&WEf-u$6*
zQ^$4fb*wYGk2btr;&vrCvPqj<M_B)3#iB)rwYEV2JpDr=;bBck?Wzh_O%ZY9auqHa
z$ej)@#Z>9)LlV%Jv0L@NUMt?<MkRiP5I%unEvIyp{F*3xI9Rt3^xV`hQ~pkQ0pEHn
ze$YZ6=FGBK!lCB7rP`jKcq+q!cO@kM6;2iVbXw?~Br2b&m`wHiU0Lw6Jt3WGuz?(P
zoU|WhhKnZ!HD*J+gR{3ECZZ-s-TmbGJ81l@zEs{GbY@Te2t)F}TP=2nD(B}&r<IQS
zR*F640bc_<1llbMK2UHH8699(ablVMi-BlQ6r1#0W$USI;&MJems^^$$#;xf_P5gA
zg0B)k7+60kW8o-FmOuhFd^7rxERr>zYCipTuY8@|@G|DlP9d`AYAC>~24bmBnwJWQ
z{xR92LV*-;XY|SWG3W>3&t%rxoiql!lO%MD06cbOYJQ~Num`V`S``WbDU*kDW_Ri)
zE5`QvtO@9&&Q1{hNzY%!bX#T_+Cu4s@|$D~S6<!^#?SaILi3kGXr@Y-rW~WcA$6xz
zG0q-L(>vE8^YDo_RTbS~ADL<tgC&9>N--3?RzIabJC~xcyE($Jq`hC_Zi%V|nyaq^
zeJAW_0jYUhAcx_CgHD8fA&OK402WhqqEArJ$R<tGZ)Xy>^UuD9&8IrE7|&_L3!Tzz
zlM&a^_pl{cFQinU9doFpTuJ1(@S(I576nin+j=Htv1J6t{$~l$Vxq?J&tgkM6Z_Y7
zs!*{TL#PbzU3eC-KYv_lF6OsahV1%Hlw~!?a80GNZS-^ek#)^4`_Qq?ZL_SiWs!cG
zJ+$5+^Y+nQ6%A>!jh9B76|X%N*O>=3$qcVBlO5}#$L{pyH)W2;C4YA*q@znVzHBl?
z!)fLSNFNwe;LUE~3+T)J`leg1!SUF=CyzZF{h0OHe+Kz?nZ{BS1HRQcYnIGtZMXe|
zTbLb$95p85daR|Yj&7gkV7(2o(|Me9u#?(iIZyAl+@FtPU5^qZATMT`39o+mWYeQd
zsMO<0#47@HkA0T?wueUy+j}AQ-_`vU<&SG8Qopid{ossUzPXsGdlM0CD)Q&RCrtJU
zm<fpoa<2V9lag)<P+X&6W77^6d;&_gW(%!3LYOexrD#$R+^t;2vOixi{{nUz2#-G^
z1JmhH1W0Ov#X7TNIWMhbr*W(3m#_qrK`iU}X2_Q$R7Ch1yh6q8Lw3zhIRvSpzkkY5
z`}l1>T;iP=(X{&Z6S8Jnoes)&{}z&8z$~3GXXERaOkN)dcO{)g0Su`fApA)kA%OYC
zOY64pj6e#<W`;PDyc{@Fgq+Ga|1<eFRE=-k9lAqNdt!`N#_=P<CG+FLN@!+vewOdw
zcRD?BF&8TNxT<z_7y#>Q#E|qc8D5!0`7-;0-)2S|^N{IRmftDPsPc~LE{?9KuEUR;
zEbK^=gXzlk>PwH6@>g>|gCAURqSm_lS~)?SJYJDqy6c-u!&j~saVKZ$x)9*XKS8@W
z$>mkw;sfqhLnKg?GaqTuD}K4CshT{X@B^yO>G=+O6XLbc6Ex-nLJ36Kis@Lu_O35x
zCs_Us4frSQz*8t;-Et7jw0i)eqOV7AZU4ORkS%37-5`L;sEuN-C;^n2+u|bc2(d)b
ztNOjN3&Q)PK$oqw@T}8HPCuH%pF#kQw`?%skS)?D|A6ExA|~8cv4i0QOxY_jY(=gI
z>Q`%_q2Ir{A`<>~FC5b+0zHJpp(LSuv0~Ewgo7V<DES@8K$`0=GI1AEfE=mGSjedo
zP(w!y++ue>S39(V6GcSK4ypVD?cU78+bE*AN<sHy3FA~4Ba=sc*$K7I`t?esa-L&f
zQuf+}`Ohcgj(0uYMS=4hDYNLjeM1;PbF-IJgKDXg!S-bpD+}6x;AZ~j`-g*P%x?FG
z!73t5$okLGz{A84`!^Nx76DjN0t{Hv4&qebiPjmNCVT%1Wv>m%xyD8+fcqv`zTvgF
zb@8HeDQu6uIr=9O!uLA<#e+^vtrlUVCo149HseLy_TLoB!)V7)_Fo|OLuRt11EVc;
z$wj@AJHKpoBPEUxBbU_W>=fnmTur|I*IDwv2`v#nBnLl^=Ih$A0JJH=l@_}08)W{l
zY$2AGcHJ$#km8y)DA~61wOu4~0`fTGVUVbqa=#$5hMrR6$I?>q(7x2HmJtS#L`rWn
zc6ZLQPx<mf|MoF4Fkl-MD~F+}CtOabV-JFc^nYQO{@doD`rCY%=lrPf2vL%zfQ=T3
zsNOwXV`uDmV?|8C{_khC8Lx|pA&DuDAgB+DKolhSKoqnMl#_C(%%do^Ze44<-|YRB
z7ZtzHzpS3-R<dJNUx4YF?PvJ;4GfRZ!12Xr&<}4LSg|vsFBY)F5~9i3iw%V8i+1*e
zj<jK?qRQB(%!1lbKwLW6AUeeufmtuQyOYUWSZ%P3?a56O?{#23vi{WL;`>s^wa6Ix
z;!=N(!J)>-Hs@I`NCV+4TidUkcu1Zki{ymc27RaHA`VcxvI%=jD<IB?5_4C0#%>nq
z@G;Ohet8F<s<`|iUEx_x-y;_2*C;5+o-2eC*e^T@zDOJ^G6ogVJBh_i>&yyML}Fy*
z*ugx`OIYU5o}GAVS3TMH-@08)bYI;S=%gH&h5s)zRHED@<y_q`QSZ+X5~abL?3PWT
zZa;+vw?O*8))A4C=G8Jli9~AGi`Xh>%;TI!c9^=3lX7sS?hB@B)K|qN^o@GdAOhbG
z3S)6Y)gTL13U;l@&ncDISLu)QQ^0$mR>U9ZN#EIjv$EM04`GnZ#>~f0TKjxjM=frJ
z#Ag|EH45|BfG<Y<(IVD7d>v_JuYY&^6Rw~$iO4&@PJrc%PFDv7CttwHU&tXpOp)F1
zk6{F0lJAWQ&yxXsJi?L7E}B2(cSoB9)xGcq?5-!Y(u%s+X`I|3!8P~lu;xsI>jp9N
zFMxYTmN89SITBy;#5M_2?&T(C<+6dK!;R_^%jKAl*sHyr`9A?9(m<%?VV^+jGXtc%
z0CLyX-_Q(TKe|wgO=v*3;LlJ$USQx=yxt2UtX?1>d?T3Hh2-KVwL@2k-$=EXc$p+-
z<%%Yo(pMBws*e5DSBIPES!a{v1#emtSB(R2F{c>ac7F$al`MYdcyy|Z5d_Bm3Usi*
zd9Fwr+oFTX%!bG7uw<i8u;eQRGomfnPQm)~F{HMAvKXHJKsZVLs_uK&?|X_5Jd;yS
zJzqrZyA<X;cmswcISenMeWO#(BcVej64Xb1SiUUVrIdAFYg-}1dD3fB#Zg@Y6-l=f
z`l*B8VZ%c%S;v--D@ki~DLeZQBH#7X#9rsYB<$U|0#7Es?{R5en8B(}z=yj?*G+|!
zU+!%qob6et&j24JY2a`050qcTwzGPV7y$rwDM)iN8DY}}YBc@D1FG`u7~H<`hubcs
zK;%fmobp$8A>E}@f7d^$+Q^N3TdBVeam}WtOzYc95<4xcyx2!TuYq@T$tC&;0rN-L
zhVQGJW;93F@-`}ze~J*BPIIz07c|Rrd5((GE$C{iqvo121Z?SYk!qX$_RXk0C(RDH
z(&q^xqG4Ye(G`Vqa0xeBzLX6Z1}9th2{!=c(J@V@!k^9*5Z0$7D#MJvx$@!*pvy~l
zJ`Qs3kP$EzW8nKGhCVCLduuZ%J%Q6mo0c#lqKl#z#`M9$ABlS-QQ#f`yO_JmVgdBr
zh)Ca5U-VBG&x^C0RngfiKmhLi$5Y`Z;Y29p&INXz6^<I@02DLwCjd%B9DUFtzOE8P
zZ*0<GSfQD?u6BD%S<d2Y%Stcp@T29o?jS+NhDv3r_d!D^i}AKtp^9Hq^NMWFZKY$y
zt+3oj)k`Y+hTwl=)Rr6n_lIWMd_<PHc^2V$Wr-iin!<lZ04_SfaIBac924(P(&TE1
zy>J@M4-)MT%;c|+#snGRfqB!~ln;$Y%x%*2wInMSh)NA2op^KRUpV?P9$Xi84b3g?
zZ7y5})R{-wBCO0!Z|U?){XLB*72K$Rvqp((v9_o6pE3j|uY>vI(nM;$8fT(w@gF^V
zC~~jPlxy^gJG_75*#1!E87*SG-6`r+jHl~4EaD8xo02nyHc5p@lK@g|l&ELqN{m*C
z!a%HP8%!5|<P5489EOEwpfAw{#jiYR{a?g`<ARKKFEN#JWLNd16;MXKpO7Gqj?wF7
zsXuH^o4z2OgP_q~`%y%>X;4Jnw^>d?L6cc?<s#A)1@|yf=Wezu2(NRKPQX?6RMm^v
zC%_pA+PYcZQ9`Nz3kT?(4>IfKoVWNp_8L3$dH&A72OCNhk#RC@KdXgg>sqmEhVJNW
z)8?PU>w#<=dOl-CXGZw(BXZ$tPXLLH9y?c<1+#B}Q9#waUc7XC4rQ<Uo5~Tr)$#~H
zau^|{Ko)WyuyRHW7&4KRiA|ela9KIhhHnv2;xUUh9+$eq6f?e^J5a+x`7g|qqvFM<
zpYAYG6X9EwEF}qmW<sg2HztM_HF$kXdyxv6sb&i027<I74jo_2wuqywy<<|^os(&;
zTwCAs_=Fpd<mL3b9!LXYcb+Ny$S&I!bY9Azi>A;DS@@=TZmr;aB(!U5C%58jdbe#j
zu{(k_YDi(xKFmT(*LAO)C;>#i?5Zi1^tMUL>SPGv)6%%7d8fB+#8S=3qp*TQ`HPKZ
zrFH^r#I%{k{Xxyu5UyndTL;wWn^@vTo)*+}lV4DU%xf7VEB5;+P)6Ta&G1d5ws-V?
z<TZ;sptpdtk%xjBcQ;f*TM9Ed-~Fgq(&x2ye+c`}3sq%<6iTV(6WKZd5Wvz`weQq|
z3wKV8aHoyaPka=mgi0;>mBd>20#fwqQu)8-2}O&bFPmoFHrRxNe9F)@!zH$JfpKeX
ztZUBY0@x9V0`WwJ%t!$<SM{t`g<N8C(Edf+n9ptcF_HzEZy9Y;)%?YA6aVreEK86o
z^)zBy;+;7<e?|18er`2Vak+83gAH&PmI7DAbGqOu;_QBDv@+&V2$IVM@=1KA2i5Wh
zjjN1_o$N#P$>*tO{_|PoG;}v3x>$z}P2YheD!S1>PJ63~^fqE!==TF@ZSrGmr@_^>
z5W6Y1aTrKJguQic5YYKhf;XKW(){I6#^SaSW|EF5yiUFYTKQX8ZILTj%s5n4dRki@
z!|Dv68&4><=wj{}V`2no|Cvm3`Ay3^$h`F9Za7g`7-&&gIJ>kFE(yIO&ou=;DU)Xf
zVizrDt}(TgLwJDcyVVUUCfFJ#pBpv+r?IGMpEm;cA_?~`E4~E&OPgx~N#cA%@!-P`
zP}yRX3!iq4Uag>QcGrNv1T;D4031<l4lg?wH1b$bh0I};>oCQPr?ng;pI@W2?99W@
zvLo&WwVTa*-M3d}(1wN6i&RnQ`osEdJZZs8=ef?iZ{b^7O0@|9NGTn!i10m^bCZb7
zCLl%0kv9z`lt?Ld<{tL57JG#iKRcgW`}@LDyN@FCJ?wOew2;54uCjU|1dU#OIC;7S
z1*D$tH?(-qA(7x9{{O!pN!dOkT&Uh9LHc7TeMm$pF-T|tQv?N@78+nMx8x~mx{Y0d
zlLOG?#aXQ6^@<mQdGk$+X4GUPU8vM@MI1%sZ%p97bEkZSoMf}Bpmng%{Lo;yTaXGA
zSxUBq&mJfyF+$VqE^E1v)Je1SgS*vc#d6H$>^PdC8?+z3sk3NW)9Gkp`r+w&VCbj1
zOuBpAGQLk>9Jzb82aPN>CC>BLswkWA8~R+mSd12<ves<gbzVZRyG;VA@vZZ{>0hKm
zxF71|fD~&X>KU05p(pQ_`Z`K2i~6I#ri;EZ_w<q$JEa#!A4#@s{iY~)Fa2?X`y{l-
ziMNg+&(%D;dVGsvMWr>3Uu5<4i<oordO7x9YSl)ZufA;XNp-_=r|-gkCaN9FB}P|y
zZcXJoV+TaDPJHtF9Ah|rugm{|YF+(qpO@dkLfQUUeUUOTw6usnb5|k3rle1Tq0I9f
z>6pnJuyDJ@Y!Jd8h3k|(iKK-~=8c|0q)Qn0O+??Hx@jB}XRPb+e2zT8I|=)6@wPN7
zA#JX9$6^>&ViU<5+t%hn>P3$Qz)|NVTFlkNSa`;f_LH|+`)&m8Tu~bARPU^*VUEOF
ziQd<<$yiFhFrSOMG?})>5)*&J`7>pY(B|8Z@baor^i$F!^>(NZ1{tr>{VXalf4>AW
zm`YLqp5SuO_}OAEzwNvHY=XNqUy&d9C~s@7x0FKw6bY0fvH?Ft(@ry3{h0J`uoE#S
zrT>y3iZ^vlrIClz7A8OyWfCc%&%ylZ>0t5GA}{$QV>r<}3L9m^{Og@Qm^Fby0{uD-
z1@sW|Gx!PoHG2KHht+}?D0Y-B^SY-Fo%9d#X!up#$J?Js10M+M)5z_ueAa(3ii$Qg
z`gnkvA_Y;PfN%2ET}Yj;L|KeH-uA~&!`4A!dTAdG9ESOhB`Z*_^zYN|ns=b>ARVim
zcm6EVQMs#IZO%FU*H?8!qoHu{U0ym#E{?BeO^0yWSNh{Gb&o``<Xszky?x>{;^X39
zex`;zgj|crTP)!(W~gBU-%#||kvn|rwC;XpnykOO59%ce*f@1mVM1$fYiKk+Oy9oJ
z0=Ws5Xra5cB!!gYx%6Lp^}ygY7{C?{I79h}Q;l0z`A8qzvSdtc$#)kzSbSU*AXK~2
z#!+-}tMppud=juZLotU^G^naOH8_6ep4BYve3vklNSL6I`v9l<fZ>~0?5E|*%KB5{
z!;7bGBBkb{rBUcxKk^*A#`-v+?<FHi5!CH49q5r?N3bO`SxzGXlrEmGv+4WTX%i(v
zaQX*n^y_-3yitDrJH9&ulZZf|J#;nv(jIt|w#>&)OWES~|1ce|yP^fxyJMyP`X@3O
z6PK)?BSml?gZWPRza??%nS>2Cb?R4_WZ69BOTb8~$Gkc>PCdt3$+z*Xp?LvOb@BAc
z!_x=bC^5?VPwNj08|V9*JeK_5vgfb_zkHBE0Au<MaMI%H?1^HOT2jz4>tsoe+rtoW
zQdIGs&DhP<S;-SWogng?zC{d$X6W{WG8@wpz~l4^!k@O&1QJdM3ChmSV_#%{-8*wu
zX)fIxyx9qLh_8M%6hL_`|Nk2}g!R+=-ZbQqrTlnyX=Y8(Mn`RXy{LAdSlu5*%NHPp
z2q3@#Gj@T=6M3>Fwvz1(0{&@Iuc}O(N!9y-9mQQSyTc7rS7*GXG+LU*#HtH_Y0v7*
z+)ensw<ASxFz!;D(kR`tF}5s;FEzK@28(yMf|+u>1VB1Bag4)~ylP|7N2*NKH3nG!
ze8DSJrEm07PvS|P#i4!sM{LRRs?Gr@IZY;{OFdofs>Zz}(zmx@_i?>{K7+MOte0tS
zciKkW5|};tQ9}YQHMFI^)vSLwIl!p6J)Y7%%c$?dAAvJ4M`lC|WLa(ONGQo<6lpG`
z@R^_5ArXq=4jF8KmAn9+lHPZh@ksrc_D{kuaEyF$CuC-~KO$k_W--n@c_-Dc=P}Qi
zrbn?O6QG!)b6`ubez%gAw>|OU0#H6lefaxEbGeM`W9z;ppMgM8qz}pjI)~W<H`Q*Z
zzPFR(rA!HMjPc^^%Q<G|<nVKayfhj>7vM$G^E+dwqi=H;iA!K1cROAsMKbeKPB&hG
z+sHr+xuQzq_(`|HX)DG)+y8MfgFsIBJxWxa`g*t}JHoA`C`N!C)hPBxlCVZQ@4@0b
zG~(vL)EM-mctq%SkqQ)3*$1c96uZ;6=az3_G?3W!y(@a9GkPcIHD^+iUyuJ=m`Z&G
z1m`_~9ga+E&U6<{pL2)cub3Y`DoJ=fka=<ETS#p3;zN;@Flw-HsL}h7Kp6*w|7&C#
zZhyXPsd*+eupr?n#y2K!)GmcnvQ$93<U*w8+>G}-`LoubqOaW6m5a$^o4Y!H^0{c!
zG))*E|1UaIOXgAQtq#M5Jrz8%kCfoAG#7jke7-}3w9|tonqqHXf-1j&R)$WV>^zbN
zayUC*6Mg!Q827vPPueV8!AUMT$|>q+bxP~-7LK2J5>s{l>7q?J<?gY2V6-kC*w&_J
zL-!6^VpipG9YfIxSqDAnbS5~eQC=g#{N-qb+m_OJ=(fK9Kasd&4$l!2{3q^QI7YD-
z)k_~meb-rC_TR`53r-@&mIU1O?ap(<R3XIDsjJ-~+^X{*EXbJtUOK5A1ay0EPdh|l
zDnl_nzecA8xrY_M+`v`pgjEjs;r+J+0`ZyC?%R7i>NMdoP$+bi7nQ(}La@yh(o6o1
zMTy796^TvyT?XzWQ#s)3?AKRnC!)#IPHk<0uU%vkdIccvyoyb`8<+SG^mz|e()E+r
z*S(v9W*<IG;40%RgvalJBuloKqk6^K9`4PysT1no@bj~8>{^Fl_dYg%7A*k?^U*Ot
z+M*#@xFR^0rM%6f8L?iM(M1Vss=vSEQ`shv*FyV^TOsmPX*GDQ$R7Xw((0az((y!I
z3loTSw;@myUIy2hg30632_@5wFurMH_!maiej-}^8-0%{?^?_UwIsQe5i=cLkpF+b
zqWUNX`^9%&f9^xV4BT-|hXNi57RJ5ssvWEQSz|^sl7#H5&`$)Aerk4HHZbB3ZlRhM
zzF7XmBa7x&=Jmw}YS=b7EOb5zj_pKVfv?*dJ);RkpICfgcofCqqms|R2(1yq!oy>$
z-dMi9mBYOV9i6wLw@p5M2_=ag%cYyczqq&!jkt~>DJreNWO%hk(M#i&u%-ERH&8jG
zeVJ4zB+YB)Ihd_2?Ekd@l*yG?h@j;?yk#Et3euKh?kbb5#FuEJ)Bj7OP|JPRbj?4q
zPoK{&5zpP5s6L9&)j{lCXH-kw=08ENLgPE;?uW>4aD2C(Ji7dYFuCONI`nJ4CD8sg
zQP<}<OnoG0vK%RRK^B7!#;x}X=^uFjxb;fzt9Jv3YH`QC7VvfcJ;a&Sw7~w#Paiy%
z8xUp+f(*8e6gv)mZs<F8gA}$@hX+&{aB`rOzV;TMT>(DJu$N|+BBTwP3>0W^z}WbB
zeqNq4FX3;;OfBUl6@Y|~&+B+57X$u)v)V(2<hMIxz=wdHJoImaL?lD+!TC|Ndcl!V
zv|8SQccp~t>rBv*LtIS0-LA)HY%feG|3kGW!tPZxK0UG3Hkrjj)R3>3P(a|fIkl4M
zLc;oIQ`j%FN!AKMAIoJr6R<_4>&~o?11FCvDe(V75TsPaRmym9z5B`nX4g$n@k-B}
zk5UJ0%Hbh_HM{dF_LXuH;7|8=lI?A~>Ht8gcBjuD3?Bu;qanhFAQASxmiP7b#m2_s
zD_5{tOjYQ$V|fwc;XUt$5O2M6*u(dcQ?&35h^-P@5Og#Q*uH<+c6G^W#6@p<B&Ya0
zcjNA1Fn5pQ3oolx@(D<Q0Q{3DAOZQ>-UVCM)R7DdPCdC#{`W!$hD|BI0?c9|g^zlp
z?>jFthxz)Khw9N<*3c3Qm%n$xA}_%aU17-GFC5ZqyQ%HRaB)@axBugN#ob_cCe7El
zj4dNi-J9+DcplAjChgSN@=|$-my2&A21{nze!=P`XkL3}CDi&wEc7U<c$n}rQGVDp
zLV2?fFn&{FKL89R81g$ej01zeV_KwO$Ywd^S@u=GML{+92pprn->=)VnNN_!Nr8R-
zN~@~g!8W|rj)Y)C($!U5EG#Ty;%+yPK2!4g^70V~w7qezbpKOjxdR%Ol;TmRZ!0#b
z+Vx#VeiK#cA!_4;78STsNd<D~W`9F#8dX(YI@`#vI~Ep(P!LSBoiX}oBLGSg7*D9s
zT))BL==T^T;0#y!H2!VW2H7X<*Xcnp39P)F^>dv9@4Ajg9$P~ix3qU!s9jSEqi21U
zTt4^gE*_=v;PnV3o~Wpt=Ymp^`upOy1Mu#u(us_vGX(ru+ff-vbpFLeQy{(^<o^43
zS=|yfSCSK$%5?iL%a%j4;vO}RDp`RwYWibm4<+zdhV(=e-pj*slWS6~JyW;~eWM~l
z)Cx*O;oPxIW02y`yRpnYO<HVKS4j=kL2#Ay-<ZU-Tg!RuM8@_rfaLMU^j*^}0ckP0
zd_0Q}L1S>bKytmS(h=@&%OGrtXt1>Xd6iPBVso1W!YD!8voiwV{5qVA7rztjgbYur
z8)d4H$;-jWXnVakxU9(oHt+rogWT5Is-~*i(hBySGcq!gk&#i1`5FBXWpIN9mH>2-
zUzGQ}e-lX)yTnz;o^_OopqnHDXHx%I0JvqOvTdE3L+Gm|IA``*5dMx?(r)%GMsfhi
zVLbT^xU#nY@TwoSK?Y_p&emgSPMew|OYyCi!1m<408NI$S}|vI3Eq#TbQelqU?lq|
zE<nTd=kIx3$~lK0eZ8RK+=+BBtINqxq{7u+t$b6^p{AG4Cx64D%BZqNY#NI|A#0lk
z*+0e7X0d*W`8;~ifS``PmAlamqqir7fspdcUnVbEKg>uT?$&l~mAmlDDxvEYZnQ78
z*#QyKIj0?Y$EWUJtly8GP%Uad|4?t7$F#1ToqZ3>e``++r<VDI6+(jeFY1hVG-|D*
zl6Ci(yDS!5`b_H3Yd<VN`DRRb^^6xtemN)$Ke}$-zjLygr^;i$(%%(EeyQ5vN^q>4
z^pb0MeSNK~t7Bzjv%gAP(TWkc*K~Ar6#4Zte5q3J<})dHc}*U-X7F`ai#Y<I{~6ew
ztL^$^|2~w}6DSQDw}D3fHSO_rLz;3NWDd6J9|El}o5fT=wP&|6dla}7ia}8wFF!3J
z+toJ*esGrC94an}vHnI&7T{pM;3}sym1p&9P`%f3T#tFw3|>$nugyhKha0#Nnx;j_
z>Ji{!kZ(9%6?MtNvu?AMC$QaEq|h-y0OIgXxWfp*-FTv9qDR^D7mk$o*+Az-XtQ1P
z<VP`yaJI~p_taZUyHgfm$1Jo^@%d*$(EWS%!;Mi@t!|(k)6Z8Gu`7R#Wk1k~el^rX
z1&URpHd8Wv!l<`*MzJzd3(<Jc6F3AMO{O<{JzTEVTWlYK!yXt*c~3e<7KljVq1XMW
zMf+fD@%v|U*1ldDl6OSq>ic6n0&az)`aaD5e3`E_CxJXvI_J5g<89bV!j)P#v1cu2
z{0CUSlZFRK3Gopak<@)@4ED_2V-89{IPM<VRx)x(8^B1#oD4hS4HE9>8VV(fEn%V=
z$I`7;C=Y$6TV1f8`%80v#`?A$R^ZX5+HoGME_MYv*uoG6xV`Sr|Bfc8mEn(por}-%
zXDwIG1ibEVHF|Yg4&_C_wEgC<^a*vnjw2cJbI0+}nQX>EeJ@|$&ZkVF3ZZ{`EaBoJ
zrXV61pnBO@yZMhcp~x0Z=|58)?RShj50BNGRsiK%f}cM8_sr;*^s;of<xj$YlW=A&
zL(oD?7?m-Y5;2GBvfD8pd@@Rhb#EIgD=p96;EL?fV{;z0LUv4N;=h79hnL!ZZZ7~u
z@&5SnrYfq-DdO*m?4SQoC-@unqAh0QN#HBa5cCm?^227<m!nG1sL+G}Y;A3Yz;?xb
zK?wFYX<X1?)}UEp#QHMvOgl3&x7tIk;wNnBpgA<h#pOA#1$|r07LHBHY31tQ*gE2?
zc*P5In27BN-#TW~->);xFcuX;_TOV|P`BFHEX6*D$(3pQKfEGt{t?ZK9W$tzbPe6e
z0w`!az{Ub-FFpaS>xdLIo@-4AXblWFBC%u01aor7qHPZdg7@;xECnhX>-T(qhi=#p
z)P34+i8sTZw9&gCmwP<D6WqTFmm^6&Em$rx2tG^;?tCzG<M1pSIKw;&oo;i^^z3CY
zcU(aRkfd{MA1idM+FYKTIJ&r8oSeYH!dm`teEf8|ROPV`R^xpAnp@qjQQ`RB^hN8h
ze(O?iO3NfML+k^87sO%K=uH}vcobD&AUjCIT>%{eU`{Qhn+<@L(*~e+sp<iLrlL_r
zx+q>YAS_{Eh(T|4Ot2Cc*rjj+{Hcm)-@m7L$w@F{hEcU3P)n`A>Ds0iId@fdYs^?U
z{xe8Z#XfNR*WaRdO!m$Gs3%h)zs@)Uo4dtLm5Sp|b1aoT<f83(QW^aDbsaFC(kmM<
zh3KdmY)iRzlq^Ff{b?Ja2<~Jxw<)eeGj^#!@@M?DLT;`#n&vfsT4)x!4@!Mth0I)%
zwYLEh$H`2D7&6?D=k<{1*Zs#dS-lM-G#5K+wj^Xgm9)P=(j^&lg48&HXwbB}T@)JV
z%>2B{8Um*T^?OQyJ`fidHwL^vUY~C4@5h3Ig1|=kpMUqK6t8z2f}yO~9*7vZtYv2i
zAcfI9K1f{j$`x6&FtAN7ri?Lwor=@AZ^nG?&kt#=ctfb-;z`IQ=lOg+LkM+(Y`TGU
zF=wKS^HMH&)<Mlq5+LPEQj!4UtMn!KO#lfM;o7|kx<vpsFeC1KPTzQUhIcL2B|um4
z`8N`fxxFlN_!+`qI^@1Aw>=M?l=K!Q?lK&*y>8H^O3&uy{Z5;+=%jyt*=HZ3J*(Vj
zZ~Tl2;pvCMK?Nu?6197pCiA+zlk#$8Aj$TCuzOL9ag=&EwqztIw+R(RS*x}WMtn?n
zFwvu>O42@hkHQIs_j|K`aN?pYD`hVTniNc%XeNK)WKn^!+22%oxx5WvQt3MVTa9et
zY~t}h;&#OQQue~NfL0GMydoH#*)w<x+Dn=LCZDbLD#zP!9Z{A9Iu%u?tlfJIMbI*+
zvfI+8%)%a!PXK@<Zf(I2xt?NL*nrqo)w|NACV|DJhrMf2({ZfzSg8QNNH29*9)hXe
z{*VwvT&F0G!NI}A#6)lj*}&EHa@h_pEuF^jI^(RjkibF<138dXS8w8lUuh3yhdUQI
z|2_Z!+nicl`DGGrs&W+oP#kmTA-PZ1-wh+FW0b#zq5(Bb>$|d@TC*Gft4?gv#osRO
z1ah{jPMRJP1TVT9?@9^NbhZQqBaF415?`ta#$b07HcQs}Toa07P*1ICtm-wyrwbF(
zHC{cU&JbZOQo5g=Gdl~r;i(K#Tv-N}(slS(*^U!d+G1pN{QejvL4fIJ{elU#!)eBv
z<{a=+5;BF)YANTz<w4w4duYgBJX_V!7tSPFsbRC%$*b+2?Fa5tfK8j|XECPQaXNUT
z6G(an6b*`KeNPF1KwD{OG!hJ_#XQ+>Q5V_$7Dmqfo=2;SP!AXnIVh0AdU|?>hB?}m
z=Czuin1q!vtn-o*5)!hq>>8636DcVv!A9ff7tPyUtN*)xXozxuVf0}GFc^QX)JAx3
zmzzG_-JH<cnW_p23&phuywJl{;@jpf#AY8^Dl9bE^1!@}kyf2y+`GZ#EAoG5UsE?m
z?VyUn9iJxlnz3?pf_jnNnfZy!PFi`jO7<kp!`<dzHeS}&=%W7CpV2o`L4y{X@!FlD
zcm2x#%ZHX!NbLB!ftfFDy{5Eiw2EvVJfe|?oxf*xw2Ip2nDsCJV+=3lC1cZkORp7V
zGSWDgbAP$nZaJHmmWEdj{qw~2a^nO967syYtY0;{!Fl-sejLyrT9u8B4JN&|zk7R5
zo7PBVU}Xhj<S>T*`1?oiAEEmdl1UaFxoNLAu_y$;t|3paj13WL%t$`gS*6@6Z%P<G
zM4jvrV#ZqDfOxrwD~`AnsBeC_i>=jcmeMGqk`04vudUF^I(bs&HDH3JA8KpbtCoEA
zUSxI!v^OC@6^?*8FN8Qt0mt=Ar_ssZm+2i8xa1>q>+xi8xP{S|NUw2taPaot&iFk*
zI<vd`<N5BaSU&wTu)4bH%qt)$NF*`4x3>pQVK&=c0u&Uc;0HW>N`kxZJ|q!seMbv;
ziRY^f2w=BcZf*a%+@}u>(IXArxg@yOa2x`mi1_p)x)c7}D@(p}+lAX)8}0FfddvAu
z-EE(=sfLrngvcXmURNY$GzzpIN*bXjqA2OkB)EO$GnIhtLd8J_{AZ+u1JFgNAplnh
zAeQIv<=ABaj|R!qJ)*`TRw#AE>NOJXO(x7bgfP2wKxfSnQyB^Uw;aavHXS$W79D3-
zR~ZU4K(o#?tkdV|-+?CmMGN<<(CtVZ`NQQVpZP?}>#H|>5P0OO(Q2{GBHJfPp?G_T
z0|xa!eV}pxwufq^3zH0j?_|DJ=5H2X*_^JjW~WLqC=Mq262o7=AtmhLPpVE!w=5Al
zzuCfas6H&%l{Fh2cK38MjT<ROXHzL<yij);2_(t?cybVW_q>)0@2T8%@m6H9JPJH5
zzV`jmWj`EBeA{dXA8ap8_OoQL{@T1)dEHoA_4}+!Q>Nd;$t4&P00WiUmrB^Xg7Rx^
z4_N7D>*$%7Y7IFnqhLn9?a?e`vn%wj_FR0b)u{M9igq=hDU$z(J)B<VNcfQ+p2;}(
zAevPP*>h{lTL29I6SDiU?Bd+2uPW&$z?1Ka@taR+IG-*&czW~av>MRDzt>aQEe6SV
zDIarX00S;cKB3<SYdl%Ou*j}pl~kWrYHmUSm#O?vBK$@F<V$c#Ne$(h<c&&YTnr%+
zh9+bOo3BsMtcIm2HKnR@?O+28!}1AN;p2n;q8WqpHowlVQ-%!js=J~zR<Ne-9RD?q
z@!6`Ap?t~eN)JUh`#{&mP4e2CZB>augQ)D2e{3c05S7@b48JFB>g5IA<dVUx>v{c;
zju*t3rEQ(LsYq_FTjrNDaX(Z_JnB9|ut+m>6OA;BM7;5M6o-F+ZW1Ge0c@OSIi|Z<
zxa#isR&#UWjQZt2iUs$#JQsRpjl6b#YGNRdQ^G`yUx|=ThuQkIh}77}<_vjqwtY{Y
zS5>2|^WP(-O_Ah5y2P%QBbaqLLzefomjnPcar+I`1H3-hh+Q&RQOsF+PgR2=PPg<)
zEH*yyJeTJD%@WAE16!Qa9F;cTErgJyh5o_k^Lz1zk0>mNc?gqgV}vy=ltHLcB+)$P
z#Jjv!KnEHN1!?$TvV!ZA@R1gnzJxMyzn^!-;IUFjyAan4gIK(;i@)C1^eKe^l;oM&
zBmgV`ET*VgT5mIMv@F7ILKH!<4O2HLt6EpecK1%XvkHa`vL@K}E!I;h$a``?g_^~p
z!D0DMm%jDn^P|6r^}IOl#X?&tLdDo(AZ}P@7}V4Zb(x`dbF1heK!!9)n|U0|jNagC
zd6&m_pEPqvTcNpCsN9r_7N_MHFq?OZdB7;NW2?;qr+P?pLp+>0_>RW?DvDR++Gve`
z+HD8P_co7p_Rk#KurN@Q7P`pqes4Lkl1a}U`sTHUU0JWRsTtjjdXEwvn5k)Pd(zQ*
zOft0##u+DP^uT*C^D&6X@n}`OOCS4t=cGAb<YhOr=!5WIea!<lZnwn74!G*8ZSSgf
zPi0g}y_I)R^f9=8LCPHuHQOpA=H$&hi=(yV*}3u}OC7NnDrhN`bp6J!yyiGU8c36N
zyyXGQeB+i)*n>|g;T3s0FY|CjHX>K1Je$v~mNKF0S|>SAeS|4_Eo^<Ph^#i@v_gXT
zKD|*E(p}%&5*+#^k?<a?x;cc?$2>t`_7-qWYdFj#D5rGxfe#a<GcY`3NN_a|>=M<v
zy<L<E^F<4V%OcZA<Z4F&jKQJ+v{h4Vah-y8_I9N-S~z{Y&=Z4MSu?%j_PqK$aQ7$o
zVTx~x!I_vivR90tL|8_@G#WFC-~9vD0AK7dmZw&C;-){_wWHmzuHY5(sOw!7Yw|7C
zKiFmJUvOgt{$uv9oh|?WqqlxtXV6)0xxIayVPJXmjFvxOh~TqEP6j_u-|UwCF5%bO
zZo96V{->PwGpbDN@vv~%np}H{Cy<G9x~S2<nd8%qj)1~_aKCWx@muN&yLRNj{{F3*
zRXMzI^iC;khbv@4&)$;+;qZYWCjaL=+9h0<p=ckyC6wdDCo`jLXq6TW5xniw4+!B6
zw_0Jyz(B)Z#mF5>QfFq*>zgTPzju3>WuN<)Z;^2C9{<m8gRa~K!k}h4K0hS%`KGG9
z`?)Kz-^NhW7x~%hon&*=+x^;<D+HOVPc;$_WqW+}E3uvPJUx(G9m~7lc8J0K38mv_
z8B3fXTP#Js6qK)htNMD9)BL*es#i;6Il1;6Y@cS*6r{p~;Yu-%2MO)JlBo<h9Q-(H
zNRBP+O?+#MLEC8lf68LyDx?Opb(xr+RO-m}U?b>X*n0~zp6J8Dh<;}pbeqSwH`&MF
zyabdr^q&qgy9IAc{R`u%N9ag^@WPb4Y;#b;#H94(XaD1iSyiSW+yQ>fnC1z^SK6Tk
zTRQi?B)vUBy}mGu#BNZm8W<)L?9`Y=c;L@c{LJO22OX{U^bQ*SzEPr)91Hkk9>s3E
zdu05!mv^u>{dHWm;RfLh#*nv2LwQ95AYk?XYBeskPD@=`XQ`cKMCDd{sZ}^iG2MCS
zGED4@P4kB8z9!AQViQ=c@moav#(Gw*ZZ1^+W)bA7ai?nUu<|={4M+b~Cbe@AWM+_R
z5;kZ%*TxBE$Ty-CMbHE?`{V`@yn<rB!C6QoO+O+7UprFtBliAC;v1m>!jJdtu6Zab
zA^-^+t@&3YFwzQ}XgZf(0sh6K9$vs)Y6tGs;W4OTNr>R|W1~2{Z|gxQ)xB3ATJoT9
zMxvo#u<2s7g>iSo)YUcKmW|c?Ck1tw81{Vh)4p4>Ts#!>m%g^vELeUxU<2dVkx5nt
z6j*`Hbuu##x0(lc$<$?c`Lm+}mwjv=ULCUe;DxF?=vT@h7@ExqKhAv7;h_};NDxXi
zyW*u|>h_+(iibb>gXT*9)}!B<Spmmq$0v)YK#ti1;SXq0;jf`6M5GYWUR1<DjXl?>
zDbuJZS)BAe0$3LgCl$c1!_nL(2ZQB+;MhL}CMJQI>tr+r5}cty7}SPbXBG)xnNi}g
zeg=VyZ@^5FHKPCtUI>gUVkH$Yqfyp+0{IfD^i;|O7zVG{l~vBAsZ!n3C^n3jOlpkA
zG=)*YwU;Bh;9JKlL@r{{&|~pX@D34WIh*x~c*!nooea*u1Co8dUM=2-epS~`kCnvC
zI_?y&F(KncAJpz=p<AA|{nW`2B;LcZT|<{?2kxK4or|d1f+;hINOZL3?jz)D=BJS)
zEeqI2n*^lzC8;D6xnP*Xdlrxu)5@0FN4l(<w4A|G^~=6~iObZz8RS<-+1jd`l7P&f
z-T~yryfw7U*KWOYsAvvHRgDVkwN1J-nkG7fBk95*(_O0TA7s3MVQE1L!~rt)eux>~
zV3@)(4pRV0277LoT>gZe{Sy+i`n3l~o{`uIhahEuA5I_n{|c?UQ|6M)eSD%Qum{a5
z3y1q;O~_!4Inx^{H-VXAmH=oP2L3HGP9319LK0PDBY;HeMH$*2wjN9Y<BpzkhZl#9
zxw3~a-&p81j<|9{2#<LAZccuK64CavZNA?`(m_*dpY83w^;#`1hIWf&Fb4p;&&AET
z%N&2c025MJVEf2LLkRN@Sdmykk7`bXK_Xh)x1zPd<ft&?ks(CaGO4E5x>u4*|Igm6
zh$97S%>-kkK_A$pAA`F(`v082zbJ$lU6O9gS7)4&<SFn40kP^|PjoZnJ@Yw-;fKTj
z@PyMV?uF$mpy6~gW~2|0v5lmWZ3an(1BR;lGV@tT+r^tK;PykPEmXa;DoiMFk)BIy
z5E<ZApc^q2XIF*-mIjoklptdL@rM_aEZd{U@w-c5{6j0;ff-#@&Wrd}p_&hTBbV~9
z@K8U>{}XE?3O~LGrg@9q2(~8F+Iak)m%$4Gqr7W61qqL~Fx3XMB1ZAbo0SFW;Z)(g
z$ULuTpP7*CHs)rE2kz!>ScImO1T}O1Mdii1z}cY^$YyKll$};Bh7lvFWLlN`qANm0
zP5M5LNu`6u6<+2CCP;h%Mt&2t*_TQjQs^!BE~`|9JQo<@#hx(UIJVUR3eh<UP{v3G
zw(2U`8#FIvt6Lvu$~aG>1YSom6M1#$S{a(0z(Qqp^+y>h5U`EldhNoZGckCRId2uP
z1y}mM;9)M1D8Xh0<FNtLt7pm~1s-GA_Wvkt15=-HpL+xnwml6U#@;XC`=l@b{YLr}
z*xy9?z~Q{?tBMFX4pZqUMVz|-d@G|@_9||+WsWEAd8o}eJ?OumqRlqv8`#SO>&qL(
z5+(85k@l~rYraTVaBmHwy4ONc{i?fbl;7t1k7)dd>F4itHGL*cp{8W3?f#DIqJ`)Z
zOOMn5#bp?)TRN@W*kB04#kR!p+<%nEcgl?1WT_NCK+BeYc6|Snf+7C5KZ@~dgopG`
z0MDvDy+)*fUwT)BzPMN+1VI7dvt5(Ip!{ME%L<NK&U+8O<-=Ojr`EG;22i;P7sz@6
zt?HO^ygW(b5*Q(707>SaV4ZPA*LRI~g*ZcYYj9*$4mx?J>mN-ah>?^~MUwdXN2j^<
zNz?Qayw%7A5ydT~hQq2%P+R}=wOi+VN!xtvlt^wc{^6L5Z{S&^OA*XlZ`Lb2AxMbc
zC{cGX1gS71I(>RK<x%ja^6itsUB&87#{{j}EeOT@>aPXJ-OHf5IbN^-DN&IK0;qNi
zhRob(cx47+rxfkh&GB8Q74GIThMT|ER*JNZ6gJoMo%~%XnpCsxUXTQZngrEX*3PUD
zqN*Yl?oU?*+g~+<c*G{84HKDM6bk+*pf+73_sj2P(OL=Ybf}>>Q+Dh?hw$s1nAW<-
zmt0YXxaMfGHPxShwZ<>4JwwdaWJ|-4{*CC(!zvING)O=VT8k$2<qQYhp+1|aBp8na
zX7tq|0Q#(ALF%IdxKePO!r}9(#U49H+LEe$Bdmo|rN^F&0eWr4-2bcE{xs9=O=hGM
z+f~<W93{rp*up3hT(&jVh%^*fN!m7cIo238H|ma8W=V!jN~-x3=v5?@MhgWbj0VQW
z24Ih~kh@m7=Ut7-A{p$l7zE;#d6q5nEXYE29%^(dnA^i?9vif88A%OZpgb-vq!r&o
z_)nKz8#b|b_+S8#&5BhX_lf|@6fBA$j?()I3m8tmMiV-eb$p<~d1nI#KK_`probN^
zgj6ch8Mwm%{N^%Rj&_*iRs|{rzaoB5Avqq)@c!@M5#L?}wuZYLYLMS?#03J;7rq#s
zq!(lPQI>qKA{v`kAz)^ZUDcWwD-QpvE_)gstsENQtzV34*UsY%njd7hAy?0;?E5aQ
z<7=PHPZDcUo_fsy7)t2^IrKUwSVMWRC4fH(Y?0<EKL?+f;ao2G;q&8HeKYzV%<?@w
z`t<edd=H$s96nvufs6LeQ;pZYv;~g!H%OGdIrV7#;5mY1{~MAtKMpWXCK=ft@BW*9
z@xW8{N4x^2CIW6v9_+hPm5=Qwa}1=TwGZmk$7)DY($`sU;OiOqk#Zwyq!fW%X)$*v
zL&sxk0nkt<O<Nm44uA1sK@AENOF9IA!X=(q-f-)07%BFG_=Fo2A%x(C#+toG4VwR3
z-d_GCFXYXV01t3}Yt9rGlhvn5n)>(PNxKk`=A!WjGs0n8fqilNW%F@djNqTKs9%cK
zb;-|*j>qePX!~p9$Q=73_33qNUqd^sLpMPX)p2+m2FxkBYf(JqT+@X|rkCw#l{ED*
z-WW$Avu=$xt5XP>^Izs5P}2Wv0h}ST3h@4S5|4}xMZWfZk38u9xtM7#+pmP%NQZ_w
zHE1-YNNSsr>z@j@GfSn5L9!)=#(Q#j=Ey*iYmT<cup=g4sx9H(uT!}-W83Ur1_Dy>
z_Cs1sItEDmrVd8rYXRY1C5RknkzD0@7@&{kd#|bVU>>~!X!9sBHaIFUe)H`Al;Xs3
zf=a^|_x+!sh&)avE<H^~Us%0N{yGU!%dUJUmj9JI$O3LC7mB@ueoo8_sH}MQ7-@l1
zY$EY!MzTCs<NFE98G_cHLF?S=B7z>4=C#om;Bn#xOOON#$cMPFJ$FHHHThOcBL@%A
zFw;fS{Slf&r!T3Q!J#;IfkV|x^@h9<fgrK84c6fXjfv|N&%A5nJfE3hBJ(1aUU{2X
z-dLq;V7FMMoQkU~ldhv9(Wa<AI7+W8wje}E8*a9>6@l<}%Me1XW=|Wx3{7=iA^RX0
zREB-9it80{(M76XpK+H`{X}u4nLqveBizNZ8W(VfBe1PS0+{%9VS!m4G88D~Obrw1
z0(HnOc;{;uT8~kl#0AhD$tvCv7AMq){{QtOIR5w(c!>&!&2Jux1&dO}QebApMjMLp
z%aYz~(}ndX|KsZT)HoZx#?K7?R-@pWM|n1x>#zir9=E~r{%kC9hyVB(Izs+aW@vp*
z{8Q6ZiO&{iw=_4s_IpBQbEAV53EyVtJ)tgk{}OdA+7oujZf5^E<;*E$*%U3KIRbO4
z+1<x;+cOP+9nEjB9_NUNPT^IsZw>)`6qLtZS0ESm!XSOoioFMcQPxkQX5XWD_wSZb
zU(^4qb&cKeC3X0rISIe6uD;U5UPs?*dZ`5^vNxsB&HtBc7enaDH#Grk4gL8n9~1fA
zP#|)PtI_gQ@VwE7dx7p(->#e;|N1H9zxj<4U3jkGph2Npbn>JZHgC)1><WjjWwh?_
z#JXOu2dIzq|7)2XvdJ>`D7V2%BZMtp0*0hAYy~i#7RO_2aOm=;jRd^o7cF##Cr`lm
z+!)^RcZ4Ap1^9x*al$!%(VIB!BYo~59FhL(u-`hSYu3B}<hb4s))$V-wLOMbVtxJB
z4}f#*{jZ64>0^HF>VI}vtzH8A%MD_OrnlZ>-B0vKIStG6zvTHcRrEh;h%Ym^5J6%#
zuqI99q)eK(tTj)Eg>z*{zN2kG%JzUMVmC@|MbbA7G4@TW7SaIyn~KY2N3WiLVX+ch
z3LXW&5IPsIT@*Mldn3HdmU!(c@0pWeb&vJxx1KZ<xFe~BeA+oM@4;P;+VuKbC2h=-
z!_ebC4AUbh^kb>iWg7Ge01b`?!1<;yk6c-VQ+XW>5kdh9ki({5GZ6(LdI11>I>}=q
zwq}2$A~{hmso~>f#lS0EidW0BIv`6W=u+kJ6=P{uGhKng7J0Y02I#Spdu9CtR-5>n
zTqi?fJ-Ut~YBDi#rAlDWBY9<Cr-J$;%$(w{h$_KR<HBE5rQjhegbxLr4)2B9x#0+!
z4ev+BYEwGfzd!?N|3lMN2E`Gr%fa0>Bm{SNf<y4&PH=a3C%8Mog1bv_*AP6oySoLq
zH@WX#eo#zpZS691&L{nK_X!)9-9n>#zrMT%2PBm<G-_V9gDOdVIw|$*FBW{BmS^1M
zdj>Q`@X<26+Z}h<R3Ad#W1+8Df$h;ZHV3UhbfhUqA=|gmc6V01T4FhyW?54#NO%Mi
z2;jB@8Hl(hki(pQ)s_wZ2pY>eI52-dR%}Si=&jW%f<j{cyn-HN>{lgaVo156cd#^~
z5#18}ZbA%QG_x4iKPJ#|(l{%(PJ(9y37GLX+JXVOj5WU}wo7X|t8{HT%dB&45^Sa(
z4sWC9m__{3R2^JsH~rlih*tl;hWnpqv3|$-wm5ZvNCCvj+;L{~Fz`#>j!Rjm8K;Bd
zl~BR2U*9wxj$@l8aFTHtKnaS=0Z1tV(7QN(c)4WMI7sAIwZdTuwgyEM{!+2Cz4lXz
z;$V?zD2hoWkjvA0Vf0ww%}Onlhco?|##p3UZRv{Sx{I=@ANnsBma)+=9=P{4FRYHi
zA^``|^(7xiaoL!{;eaJf2EdsxrES1o3O;-|-@wtt<}*PfPt`NZzUFObb;z8ZeazOC
zgf#ZzIL^yTF6nIATd8Z(9c7Tjf8;zwEG;IIenxL|%Msov8vgJ1iA}FQfVg0@g$xL$
z_&r&DX?>~}uK@(3^XY0E)=#DhXl$`hw5=)1xNc_dSjbj4EX!>H=JyJpb<o%nEc~nz
z$3;z)A-W&CFlXO+5j>`1ppGbHhG+IS3VaNf`W3;_Tzc;xxi&5UDCnrM7}<9iQ%2Cx
zTVBs6Kh|Z%1Tt*FLGkIrH|5|y^<d`;@~f~Mn?1dU@qJSn`%!(uFr_|NZ^LcN|M$t9
zJWfgt2V3?p;xo6dldvw2ARdrcm-h)|HhepXXn1hC{=9y1>pnv`EjYW#I68F9Q;ZS2
z=W1HsB4x{X=6s?j>Y#XzJDl^S1U?|=Yhsb4ow?YMHLGAS6p&6z2snRKojEm+c_sZI
zj6N&oa?EskE2|f{hFJ0H?f)S08VPwk$Fm%4M1Hk>r)@_N@czGKZ%DJ=?+?WAN=MDH
zIE|wciR;x$hH3H-q2rsfu{6EDFgTsNbU&!zJ&h5yP`U4v4%d5molErw5YwhvK?(BQ
z3+iO!LM8^G-|y3C0eR2s5XaWzwzlJ^Afw<>YOtRisV`aj9hIn{G4pS^mbSKuQ+ZSO
z@}&0e_bHOID!r{aG(+_IdDR%18O&$jx4Umj=H5^0%RsU@hPpn3@7xXS96Wk19d~v}
zw6O$>g8U9jAb~i%kZ}r1Xna%&fcKghoXyVVsV-kVi;E@Bq~4*d85VS0Yf6m5Yak-=
zu6|158ufMC?JUPw1V>YZ0U*8oeLyc|e!A8>+{+2#G<xf|X-&05NKd<zzM#7}G!Z(%
zZZa=yF3W=u{2*aQ&y#@r9w58P(0O-wNqyq3)bpgTU@d#p+#9bt2mb!7bg88|5dU>K
z(1h)>Kds+rTavw?tvTG7(tt!^@sVc;x)Gfz;*XAdGqs62HIUlleHc#rBoXo4-Lw<f
z^Mg&sUQhVHa@v<j<8<{l9SQtwx9!$1Dw$8l0Q!ZA>8TSOAau1QnXgoQzljMjC%!o2
znS89KKw=Gy{B;81A7(eD1GSJ6LKO2%8Zn$3H(K!Aa&KyU5BCk3=<BO8D&aQl2a_AS
zP{NUUZ3jlG8&B4nLn}kh7sAm0qM<#aapPyhlicqf4z0xmw^4fK_o*Fc<ixGDFDi8|
zZV^^EbK8_A>-GZd>!|2L^zOnd9f{2?>~A8<tbTX}!Ygs>;Qd(V5KPN&KCp%c)*p0l
zmaQFQT()k#*3=tu+}H~f2NH&Q>6pGdV!4-%NP}@GA&e><$T1gY0fM|Sb9oBUW&6F1
z-9CbcM%^-#j71{@C!(l836mv6_lyw;5mZ1|y+Bb<(7L~CRP!)pg9IKi8??wnDf8Y|
zy+*?Y?%f1Qn;rgJnb=bva7-+rRLV)S=|716K3+=(V{sGgyE4zrXsrMg)sEzt0nAG+
zky_4`d0pIVF>^N;`Pr|b8wMxe|Kz2V{m5dzcUdpvKpla^dzkrK{^#Bd{*hknK|)NO
zu}bUz<$RfM@v64wkU%Vrh(!^|b<F!>e(J?5sR9kuth}RFu0PyooP_5?N+IcqL^l>J
z>+jS2TOJDNn{&8iO(}fB9(w!vA73Mz_gz0*6B7BC$XCf$-}5X|YyJ4G;IP#l91wv7
z4S~}X=6g>H8F5ff$_i~_XMSjVSirD4_E9ziw3CpNbd)2@vBOBZekyNy-1$LnUbQyi
z6r0fu=%3X+Ashlixk_GlhjHXVB+j$GIe-eSYK#2H`&~!+imPwZg_aWs5I{?63KFol
zBmmS<pCSvazPwW|RT=BiHAQTzp1S6e9W25H6e`9`w05M12jKmrCm#`5x{{24dko_`
z$(}tSZ0pUI#IpCk536vA=*eq4>51+f-}%GS@`;`{SQ`DI#d>A<Yoa}LipZr3FLkUX
z1PnwcSJPD(t^#`0#zueNR{%YFtEJ0wcCg+bvf4jXYp<2~wFSHg$noEPK~x>AZ|7r7
zmL5<Nhv;7TV>Z3GcnApy#S;U6hz{B3GhWC(LC`o7L>efg9o(|l`_8}v&!q?n4=p<7
zu}7%xuV`p*mcqv`ME9@k5TNQZV=?`Fn4?Pt%725><KTJ-*}%V6qwu9rm?s!3iR2dR
z>G00YzAlw8!%H)wd*hI_4di4ZW1vv~>5%Q)m<l%1euH++50ow}lLNa`edPCF4hoe@
zLxwvclCc1HvV{;@tlKItzi9yA%|rowMFe-xkLGT&nwcN+3(CyO5USPK<tkRr^9z`s
z(+=ih!<JJ6CNXbv^57GWQKsNSp{L;Oh#mbTTN6w;^HCJ^Yu<Hu@rxa|d#m}C&#rI+
z;N!#jVlJaiFnMnfs=7aPJ-UQGzivrk{KM3@^kA)svLJzyF}%VfKdr_(XI2`WZEn!b
zP8qA{jDkLVDjC1cbz`7VasPYkqrEsEITWBvVwN*IHE%dT-~{DgxsFPm!!AghJS<~8
zt?8^2zhqkjN8aK+sghrdV*iqVkMdKya;8@x!*BCazBZcz>HN&&j(6{(rjreC1vj<R
zjPx_UzQCHK(KI^D7S-*~jFXpHT6>-WqX*agK80C0fb$ecmNvQ2Ciyz?QD?e!yn@LP
z$Z<3%cdM$nH_bXhRXoh^A3{sW2<Gp4NY%veU~WIuVO`yW4QB5p`Nl4SNh%OY>U}$Z
zyUp6Ja}oRfg{h;3A`ynaZ8q@i*lbp(lPb-)tOiam7vtJeW;-L=ouc+~jNq>C0&iMt
z-BmR{w3DOuw2&Vl{vjxKbI5oHYE_jVV;aqUOJlS$&g;1e@P5Ghrw-J<=DyC#H}izC
zqKjWW#TUkIjMBd*|5?K6KPtah-)W#*`WCdqBuuawCqzJkFr*jSbJKK4pQ0xr;^^XT
z+&$<qxZaHi@m2<<Pc&vPB`H~jZiiO@x50BKE+G8@37vO+FbD7iY-;e?^f)y>c=tqt
zyfxCz>s}wmTd9M-c!B;<@31SleD5$cQN3JA5l0^p@gQ<h(O~Ue7DD0n-UyiNp~7B~
zD$74GaFHw%!|w&jZ80CQjqrlFyoLC1-qRQPmL05s=VNa%{N68@cfYmh%Z{?p*<Re)
zM8-Oftg8Ra9(ZcU)*QwB9DflrM!4`>4+!(s9*;m$`FOGNl^qoV@I)V{&x9Hu#{0@T
zx3My?777VuN<jc?_VTpK6A<~v$c&l@0FNKnWDByesehCC&uJGEQ(I5;GhNj5&i2^E
zU;RrqZDO+mH~{=05`SJIBya>}*`x7IOH`2-D7h<#-sYoIq#7`&J03q+SX_g_Q33uC
zDmx;HT@3yhe>%nNqG%EM9cC{{932-V`MA$Qs8<fJoBE)sz4$C{$JFoXl)`t$1B;Z^
z3+KOK;q4SSpt64cqJ3$c)zZ_e1nn7Ff~8>ZxgRjKpwc!j)nlimpXX)=)_61NA9$$H
zvU@E{I9QC**6`Tp(tu!p^L_?`<7j_KHoApM^O$mgn3)0Dt3+`2b9mICuNAFDF|-*}
zw~$NXRiGV&(BBg%pj*El#v~Zz(yNROgS@C@#JQ`zRy->wxgDc<mh7Wk7^Rj^S?VRc
zWe~t7{>pnr!Wk(4uCPr8)W1sru}~BiMEA-zd=h%!;2PEoM6R!os<_?cVGgTu{4a{=
zAYYgG2~jSzVN@9Z-)2VXg5)0`f&_7<9}yI>qcF?Su-+6lViU|!(JWi}MGAPOIepuX
z;>5Yh<HX&eHh&)8>U+kTL%@)9F6G|U;L>+bTzmg~IvJ~^;phhJL&$<cR{aBN0QKO?
zPZl|_itQ-|4DE;Tgx$)q23!Vt*>_Ghu*=;rR(@1x_Ax1uC9&_@nSPIbhGo>SO4;mu
z+}4dQy&Fym_oeAPWSFSe?Qw7MT-TG)$%Xr~ia`SOGa#4y;iWiXzXi145^fD(=_2yq
z;j#pZUy7Ko@`@_5e=p|~Lau-yeryRVy3=}HvZ8z_{`}uvgpvKyfR!SS9zj~i*?+@<
zhJN+M=Wg$I(Ro?j?(90-8FNa(M*z<%O9UORxaM(`n}Xzl%Rz4)XI2#DQ$}h(?W`Yr
z0Y(D)gI*coYs&sB)+HW{W>OV~O0LuAWlqoD=HH=(V{bjtu^WYCOROs&_lUyD$<^U4
zf<8m0aY&2o_&L-aufTZpc|Zqe4BYwRJL>(|-#0_7A$l%=Jm*M|xHjxeg975KjSJ2?
zKlz-CZub8vh)q~b`w@^BJY=Ort{kYm7QTn_nRT9qmC5y5N|W%NYqbWa&Vf(q!JtU*
z`E|TvLfw*tqv?HL=TC96kC*Wr!&3XmxDdoAx$s1h)6Icmm<jLUSV_rSbT1Y&v^2WO
z3Va~_nX`*|zG3BOeLs$rJ;G`xtFPy{+?Aj6q(eBTLT10=@>?Qp)+EjP&^x|EP<{jG
zPd;7#k|OkR?F;`HnKm#QH@AApaf@wi9B~;|UfFmNUs}fGYAAS3NdbR0Wc}kB1)!e8
zWyWe|$NlV86NzIemVnM9GJj%ev?~d@h@0b2lrh;*i3i*VYkLw)OPC8m&;~EPl*0n#
zSf2m@8~>m|kw!&Uktj!Q5?TPz@U&SdEpGfB21)#`id;!%2IpPvo0sMxJmpcO4iPaT
zwi>~E;IG-unUit`Mj?qxG2xAX6b#TdB#cnd%H*Z!tOUu2R;%}E)b%Sd<0TGoVoJpi
zGRMLpUHgwu+!UaER6^X9@4SZ!@#3^`SxG-&N|KS2ur_;>ntqefo8i*<piOfL*U{2<
zwBAQZQRMe=`L!WIK_LEB)B1@ku)pE*bp0=SJF}0C_tQK-vH-t(8C`c?9W`plGy=8Y
zAkNBt<cmsZJ<v^KAFS;|h^kyjps=w6eRskITX^w2AbeCg>sy=9Iv4|*=~bhp)3tup
zd!F?nyA0s<6uiGg6QIJo<RvQ0Y+ZX%sBQG;2lFTL-<Pke7Y167d&uMn5CD(J`E$iu
znOg+a1vd>nkVD1}9IUOqM?V>qGBA`M?7t<NCBfn+A<Ptm@}E0*>A|vh_*kTOFC5CT
zdW*a4I}<Uuy~XDftm*X&9seWwhvP|<WK*E#@7I?BU!YrB1nAbVfCRo&kFC==;gr`2
zDYYQyQaMOD)!+dEn4k7Q>lkG0LI8-Cb;IW?{S5qRN#j;Z-SIOkVth$oaieQGNng36
z1yfpdfOEQi4L++ZvxX>PNog&SqI=n&4{~rgg?ZT8<ln-77|@^ZTSlU&Bn^*{U~~Sh
z-Gc1MwkkP>!q#y3_KhS9lDmS7tM>2~10{zTe+UK}=w1wk^xrGcWsccr=Y{A#6otsC
zZk@2KsjUkJ^vgIQVc4J8+xblOJ;NTfiGUwoWuvAw;tUZyU61Ws*BJYFnT_w5)(cMU
zx?{&`2&|zM`O@dT!tmkVF!ClLcXR2+5F)&JS|5xYWj4Ct{#!m_Q_i4t^(Ln$!rG!n
zD!d65D$v|p!hsp!e19pb@l}nE7hyj}Eq`o<RsZnHd-eJ%{u{2LpG~%G6Hc`_yWf;>
zNob@OMV_x1(xwTTEB2+R@Oc)=2*Iwb>}mDc2Xi&4Y=WX?uQl!J7~O<D=0&YFr&El9
z4&3=$6D_~c;t*Evs(KePM!k@X(J9rmkRyutxc`sPk|M_T(>Cj37@eL@PuPXiqM5vm
zdRnJ#)m)*%_C4jH#-=h8YU<&+){4S|N812;!^5{T9Iw#^oih_*hky&5{PEQrWd(Z7
zTNzR+y#n5;<rmdV>lhhUevJls)dx|rr9ng>2Ufw$wUoE1jrNc7dPJFDwUJObonMr@
z!c>P2Zw_Th@hhKT<ZWx1rc{-gB-wv9QHvtH4|&BY(hsS@jx<AC)&@IsSpRxGs<h!5
z*~ke%=vm%ve(ja85q2n=HOo=fE#h@Ax9C&VcK3w|ne4#ok=_vmv9ByDm7WTVjh~-{
z-=q4WB<ogv?jsrhx7^ng72H7CChE%8pW<cHjG2r85II#u!-^}YlHI_F3P87n?M2nz
z8%&f$B)R1st2bao#brcDnuS~8VsUYPCW>pcIS3LC;>UO09I;|cN!_vA=2X4qXgTLJ
zxCDQz2C$1H_(26|S3P1gj!<3(-oO5O-IM1ZxF5<c;AQ}6CKj)fu=Dae>py??EpZaJ
zGA(LURCsOS13?`uAzKnwI_+p)5#Eaor`2y;odNf?@g3Pj4uZ&foC!zrR=$_Sx9C6n
z_9%8cKu2_c!5@jYF5gvcY&^?{vL(Vb!SD38l!qtwHEFKZgrW322nq<4wR)1H`8Wb2
zn4?sR90UvC7FO>23p-=Y$Myk$^>|I=?;ZObumfY2@~3GfHM(O=cCUj6xHYZm_3F)<
z%Dl{&0P>0mJMBg6F6qgq@;bAW^0#+X$ylt)Mf^pFi>s$EngjG-ti3y6FC@>A&R2Gf
zMh*VHACmo22A_BG?H~q4G!!-M{bEDBOk7Lrf0v!32lRvWO-^qJops-7qM#xTi=>QZ
zK3F1_|4NZBs0`<t&3H<O)&3PX1_3BX(-42hLI0r7wFr@;_xZ3|<)>4iEJw&N+<1R`
zW*;G$jaPNuKJUD%`IOzA+IsuqQ(ezQ^trF!I>j2iowxDDbA?mW%Z3^=Fa7XZv=8^y
zr>oyE@y?umWsM&vcwxcg2FSfa!+%M4n3Ja@4jb3#FqY7;9??DK@54d)FB5Q>MXm6S
z#|K<psxEHq#;icfo$Gcy%jIf;*<{h<!>mByU)R_YCeDjrktHgYcN4=KT4HL2baMsQ
zP!Ks!DQg>A{c6cp6W@O!LHe&{u5Oj~*v6B<gSM2u6hMu#&X9t$Ffm|`b_)rxEhbMM
zQC-3LubmP)Hxk*^w@FV;b54v6&FBP*B?!X&D-A4y$hoHkV_CQ~j@GTn!UC7=2kGN7
z-%27kf*mG8Q9W%dT6!E8uMmceg@0o!K7Ida9m1=I_bm^gJ`&{@!vOS4I3N%MFtpW8
zG6Dm5gxzF}h-!W+1<4g-WnkC|m~pBe9bz_an1=Tm500W)!KL3GlUo9n&ZBbYDLWm6
zM_89HX&rjW{oZ%KyK6~Tzqu+mAOfVg{pGGMJl_ne)S>*HLsaw%&aKWO^%9kzb}Rt>
z!Jo*W6<>FwOspx9iyrf{Z|S|M0B>@G;6svDlqa<)Yy6;;$(bT{OH$}(ax4#^8@vj4
z3XeyV8o+V~uMAGV(DuIKkbX=Gr@Daf&+J`FamUme(q}7hlN9AbiZDwCXBEnmW7+Hw
zLJKdsfc<7UC$NDBU%Lm!D;};2o9#kQm0kJ%`f3W!ZPZMn<y#9V;V2K@j>`eRS*a<P
z|5RKSL0pL2U#buM@O?576oj?{E@n|Fg}!k})>~z+e88Qx(htg=GoI%S?2zV2l4t-?
z0QC9Z_gEee{n7|CknP$rZYMdPK!ZNBJJk#@qd1q{9&)#Y70&j`7()3Uxw#yt*Z}Bl
z+yTj>>Zi&LHr+nqBWKYE3oDKkb}R2+3pB>6QGjk41PK4mVMZYAb!)Cj!WR}$OJLrc
zo;1n#1N<+{wg;MqBE?Uk{F~K{csmb`&1%|wk0AYPyhKu2ge#AE$84H4KL}3&PW#>2
zK2qf50xi9AkDtdG4~MKA*UO>*{f8}r_Xk3gZ7Iz-LnCGoh(Ro<|LNgfa{8n-7S}Ba
zSHjz@GK#M8<b5snU<ZWC8%$|Bl?(%WSNIg#klmn@FFa>jO!g6~2hIFW%Y_$uoe3f*
z+w0+hEx+dShcy20sD?;?{1wiGGUy^?7x_CJuUt>|+v}uSw`pH$Q4yuXJq0jb@?`C@
z@AefJrAFg;`-j)rDPm^;p~pc7KnN)>%V%NwJS4FnF_WyyGwuG@r=hUUh!bIH$9MnD
z3nZ-WQGpYAVH>5-XPNz$aEA;cc6iTZ0mbmGZZDNiByrd=wMyreqD)etff8sWM(lEz
z^o{cKi?Rd+@nMr!nVsv6I+7lLi_4_#o$^-GSXGBj<deZ@Xg)zUf7Hv53kOcR=*ZxZ
zx-`~N)JQv~j|Vlzewp<6Jq=|xk3YpTmN2~|{d<bEk~mj2w--aLrUj#+0AT?Mb!)z-
zuo2=!wO@eH%}Agrv;ei$OTt1kILiG9-%<08yD@x6-2eXpgM{}m1H(zJDRdA*m%6xq
z-Zi<BHq=T_VhHgv28*)1H5_Y<@W5r)Xk~{<{!^}(8#dWhG#|m>#A$HCVXmSbdA5w3
zi@DSCX6+AfdAnA#-v-z0aoB9e4x^c7eSEdSq>4Ut73GQiC1=9A;0$7CHXTpS^~CA+
z>?tvS7^KUq7T^I8Dk6~VYrQ>)h~{ro)#>{CtLxqVpwUdnQjP}3e4Ex{$8<6=fu|on
z8)wNaj&`{!5I2Ehw|+o|r^3lqXQU89mC(zkrfU)SKEVnMNdE~+Z|=QBXjU)Ccs0_L
zU!b>x_Ch+l-5GfkkEyQQQcu#!Xw^c(2!!Y|?f;n8U)d%|FcA52-cjBC-12KLzm0kG
z)RSn{7u|=G*o>8Ww6J_xS+^0FkAAKR+?L@8ak|#gWPs*{2F`)no%r;yr_cRZ_q`Y&
zfP=;S!?nWi>kOvFtg$h)L|W-4ic8J|;<S-HQYKRvo_)M{-~*V$c@NefSZd<a7(4)b
zg)LH>ULGB%Bk1rgWHwn_ps)+h20pBxZ^;;y50?p+yYYMz)RiezSUt=M!R+XR0Ku)%
z3niKVaRH?EA^mG-8t$yvxDP(S(j{BbyLja8HQDa2ji;Jev~E|8S<dRJzZi~Q)&H6w
zMj(orNJmV_{U2KNp>|@3V2#SQ69IAIXd7I?lkinnC9&TQ1G7dHiRQ6H4M^l&POfsr
zXV`N01xe5D3#+6`+^>F^=Y>fZ8V+D45hLbws}Mu<KmZ%eiwv;L$rjumn99+)hPH~g
z-!75A`Mpew9rfX5w7Z`M8zQ?3Lp~3&q_0ND6Uo<dHGX1<iFqrB^)DHaLjC#qMJwg-
z$1%V3d4i+3<mz$(ejRvP#%?WV^q5VkhQFlQbfx8T&**gO0U_nt1U01pk4mYv_^sEd
zyfC<eybPFBCP;rV3;t9W(}kwe6KqPLdEnZLr$k1)Kc5xI`FQ~7tA5RxZ@l5SrK*(r
z8%A4R>k9xH;bB_VUl+TH=wN{_v8v4Cl15VyLT*bpb~cJ%@AE|gA)~1qF#=OaIKWxL
ztA(sTNPbkI!oci$Gxk$r*WEu92GiE^od<~Udi7&u^F-ufBMv+nsH&<;OAlwaat9E1
zy}f$b+Ez`BeB^O1si}#REB1QB1y+zgpboY;?I$EARzJspZTZG;P&(8J`(?F_`)NoU
zZ(3a*o9z`e3$&u>LE6R*A+XY+iPuO#QWG$!=rfUvD82wgZt{4qkBbrwc8)@G-vUVQ
zHAy9qLCsX=6N3g&;ey3KLkPKO1b$T<r^W!dWn6(jSyNvbHJ}rBHFiSNvd!ByTB^CK
zy(4lZbzUxL&fgcl35<2%c_O6Jkc>uctjQJv{>IRuj6|AjH(qL<@B<c+I=p!W_V0lp
z!NNEJ{Mq)pqNlD(&;gQdP47gHWdi3tjcz2Y|LvHL4}&QXH<sjLeG2&J{1I}awYZ%h
z8n{D0o(}cPa5lwt7?mBLE0|^r->R`wjxbfl?7x6Bu6*zPf#P-SLPDBd!n5k8{657=
z=N*ZuI;dSVl9C##x0q(8qNAfbJ~&8aHHnxw)|c08uuPsk8XjOvlR59W%bGMdW=%UY
zk%;}sKuha+*0K-el$Rg>oDk4zv`)LjX|!AS-5X6?wrykJ<$VvtfCq8gbBo8cPoaf^
zsC=-+YD<b9^dBz`IBIx_x{jaXUa<!NjPJKtOn5_`ehh{#e_r=@2?1?6RVx6s{j|ep
zT6U@%>Z1a(EE+-1e4CtEOWP(-vjA${a9iDJ(^<VrfghKG<L16w>R)0pfGxKbW!^Ct
zWBeuq%NMAuslNL4qU81Vz~pY0%xN<se6uQ!89qhqYb9$1XY_;!_G*FkhtFou38{_I
znTvu2oE6rG&!z7HCBd+t?>_8*-{3@EM4(?|c0Hyv%wTsVH7p^)l8|B?xG@S!C8^Y?
z-2!d>+O}hO9UUFBysw7*{eg@zP${RZwB>b69+3z71q_XhXtlf7W@jJ2`QS$0JYP>3
z2`*c67An0XBFc`Bul0FyWlXVZ_)11b#>>OA!sYXH+5~Ej`FtM#VvvcCW(%%^KZdnY
zM1rpelV38e+&_abZ_G)x;ggol?3b_hTfexkAHJn?+3(wH>J7NO6p-wMQFdTxcI;dw
zV@AxA9(~`og#bvVMRo4iRvfBD=c?~{J)MIY##?HJ8w7_4@d}sEX-&g4{j|0}FRzS{
z-xc3_tA2a=&|=-(BEI}{R#oimR^-HB^H2mk=P1{)Z75fRU`);^7q#BNB$6n0?kU5x
zzn1>)9SKn2TL4Z_4#o+-5PjP3RNuNv-IHH_Y755+HE`O+<7`BGkr29?*lA@IDV`qM
zzs~l3Jlq{gf%2a|EKn--?9iph)uPAMOMw71YV><bm5b%F{`wqngST+C&5bQ>w6&Fo
zUc92D1Yf}WzPlT6RnDKJPL|I0JStT!S8K5=n?4i~5qW%i^3io-{<qEH(}vFpRIoRd
z+oz<%O9Rd_{j3W6^+nDiPnLq%W)713p5Fh>e1Al$9;06vPFvipWQx7Ms_E8Lte5^b
z?Rh*_u9=AP?1v(_C-3@_vZ++pj?%W?zZu{r^f(cr6#2&gA{v_iFsIL3n5I|Qd|Go|
zY<teudu_Gc4a*YQi*Ma3W-{=B<*-s?2%BUsT-I++<Ix-iDDX~#2e1Xp9GmK_LapW%
zFGB)Ef|urx;LpGM>ZLlG#fp7?hD=z+o2)I}o$!kwpC==;vTLQh<Hvk^(yz_SBc-GJ
zl0QidzlAHG#rMhM%D8e)LJq*4NKQ&3r=WOvdeXZsT6pw2Ybh=(E32qL1_T~<5>J<#
z@bK{5TwP&dJj6>t?W5aVg(d;YrPgsQh-vSv$8L4dBW4;_aouvHlC6)rHZ91l`C837
z%YPDmj%BkvzkiKo`n*C2<3DQDWDpvRzg2p5A$GZD!Kz{I&Uy|#2gBgp$nL4wyo?H=
zzc4>^!v1|a#1O*pUc1yCQcvNx3orPm=HFgsdc7jI*jBS9+IvPC-r(Tf0S#5PRn0)z
zb97nsR-6}2pWWxOdsV5Prcm$&fH~<P$;;Er)rHDC4iz||uc}okURs`RYeNF!$g6h7
z6$nBV?>^YRNqgF<?3)^bhYmnbgrB^I;FrR!zn|qdXJJcQR(E-bqD|-;bukHA_r4xG
znk{FE42bN!Sp=1XFE{gpu|!1eS#g?yiYhAX)(bU)Ut27ui=NKA-j1ugviQ9?fs@6b
z64mpOqItDOgPzqtcwEZ*Ht%od^)`q9-MMUNuFzvSJ?Fmn<MUY#FNaj=_@qCmbMF;B
zo9;y0<9?$*@XFlYHlR48e&*wvY#VTW+-w^W_ehVtDyCuQ4HKSC_9w*kr1L0Dlr!CU
zMWg4_F{kEgO*CibEpR$0dr7a8D1*or{o2*uVx-07-n6f#dHlV>`E@0ugCaPy_X-uO
zZ*Mq1E7JU-o!?Xu+B9NG*>lq!A|cBCi8Ok5LfUmV*!5+G41b6%=^*X{hW04->Dt_w
zz9Im;WBfHGT1gxEnv_l;Bo=~%A4UW$sNe$3-z`4n2ijOhKK+^3D04_Xl`Br{x%zQ#
z>3d%1e1~L*WaHbXtVYr-wf9n6;@5Tij{nWM3X7~Cv?x!}Jvum8X!rQpbiZH}J851o
zFZeRE?*cAEUEc?jLZuc^aJy{RMF@a?DN9RBMe^Ba9ix^Ft@7wi){6lx8~Qc8whJ|z
zxuGAIz-$c~NK{{(#)(S?^qD;b$t&_DEPL%B4pSk1Ix_0N3hzmz%gaWwdW>6W7gy+3
zCmOV|CHGBQ=xE?I{{8{rPOEZ&D{`VF*OM$%BBX4442$8Fs}TGnwGFK%=!^)!HZ8<x
ze+mFG70=hWyJUonJOKTnXJ-$l4MP5JG1jOVqr$UA=CO8Z*5*WiMw|8Uc?LkdBliiw
zAGx7f$7@xV(yXOd4n$a{VaQT4w)`toLZp)}vH#~z%p>M+Ef7CmbdDmphrz_NmBpNb
zFQ87D-aRPeVAp(n2nNF5j3AAgW~SkrGm-s}R-a3uC@aIH=T7ELZVbA2xjzp=v8(P?
zUF|^MOnj>?Pse*-nWQzWq4#8_6pp}#^O_x_gB-bC6g04M*xW9H;FmC?_W>SQ`dsx+
zUWJoPX#6i8cv8T`Ar{BAw<rR+U&Qe+e6dU#tL01yp00b3*67%n&qWU$=q4i3EaK<)
zR@t=X`S|y+rltlI6-$#R%*?3x`GK?D^z3Xs?I^3Gm#Yz`X><0IgW9$>uj9GO34tg2
z&47i|M(ah#x0kzhuk()M`RcB#CUA5T9dLq6B8-r>m;Y<z&{;_VQCb)x$1G)JpIo`c
z=jMA(Dgb~uln(C<fX)|v?5xo4B&--Qt!;-8Vc@BUUdTO)0@cGt9`f@elu*x*^u7lZ
z+jonn_w)&E1%MD9E3;yU1WhXSRcG*HDuIGNN}_%+7RV78`=<M*-&NFfd`(+~A2E~q
z(4ttu(C;ez2HB2qIfv?_rwTfVO$DaWY-Nq%fY>y~FJGQI=YnI6_~h>BH*by0l68oG
z&z3Ijl<BhCvmN`%rnl@K>3Hce{b?m7c?{8D0CtvvOf7xH6wb~1FvO4khj;udbS)iy
zu~3EJnwPBZ1d51m@OfQOIf_9LuBpi8=4Q6v>qCK5V!I2pFzN?xX779Z?0E|to83!y
zYfd%xT`=2yt>h#phaL&O{B`Jzii`{m1A~H$EGj1E;<{B=!9wPB+AyzH`IW<JuA;j0
zak%ZzMIAU&`^;SWt$F`d!dyD)0Ce~=@mP*6nt=yPq_j>^PT-FwJD~7!8Upb|W!_0=
z%Yh-spL~0SY8V-0TucJ~nWK<^PD{^XtmTEt(+_ReyT-LOJ$}9FNhUF_4i}t^<goLR
zv(+81PMO}@wh7rg>%yY5mO{fkE7R(&Kzj1TSPv39+;DeBSSgcidTvm#QT<E0=*xk&
z=V_$Nf=WceY{Yl@B}2Vv`iy;AL>XVEHQRc<d->27!jv6c&uW<l`RR4BQEw!8RDAp-
zS!qWj$4q<@*i1P)TU%5V6c;+sn&I&9P&|K<H*t6BWUb>V7*DsPj1+giwX~$<_t+Rm
z#+WUPm|~?GFL+OUo^BcRI=w+lroh;bOk>#>G6{Z+UB7U3Hiv_%`;ZIw*qj`SO~Um;
z55J5Rpa0^hl6mFKJG#NOqbL`&&6#yI-TP$6@>6f}B@skCexzRb%(N6X_eV5W#@~!&
zY?7=*UT!~Xx-@(Cly3&q1wRm;w<>*J+%{ZoJy@gP-TQeK8WPB`;bLvTw~DpQT(?<D
z1}HRbRG3Hb;iY-gIyIH{s6KGzdA8q%EzQiR3!dNuQ5xDB?yWh8r`PPbe|4B+8OMnH
ze1l|dc==9LX0IC%MvOwwNAXpY%9&Wc^M6GF5a_UfAiM4;Z(3wir3mglDk;!|aKoAX
zgtIvE1HXarr0|U$I&Wmi=yx|85-SGDS4vVcG85JnmW$idWzeSqt}UkxQI{GU7aQ9>
zGTY}?)7Mwv)(LEte0=y_T@Q3GK<kEI0|Op<N26(MZmTZpU?c$3oo(x3^$AWQ1_=Uc
zb}}Y1=c;MVTLY3V+AbEf2p+1H*ZfV2Fo?e&qjI|WIl_X%*tKcq>1hYvt-wPDq((16
zmZR<P{p_`E-_+;now8+z&@hk?A#dWDv@^jPr*eCUA+ZXVM;3utOCqb`oZ7+?oEeeh
zYBp)JtHGVx@<~jg`)66@BWAvs3D@kc7(Y>u{&Xd6d1t@EtA^@xg!?5q#!H^kgD3?+
zy(WX)^2JhB6Q$5|H)|~`QwNB<(4_?w@Udst*4A`%&eU<PJ(adu4MPb)G66%O#iv>+
zl!V`Gb8$XR)p}LsVKuqA!o=to58i-~qDr9>1tp~bXzX*w$ZY!o6)sx*v*O>GQe_Vh
z5Btd--}}wbcWkC73$;eQK?n<Ld*N7ASJ&68@_cS*+ODp*Q-xpf7`_Jai&f88>$Itn
zV~(Y=KrI`-Ac4v2iizsE0om${-u#{?Ao=>B79l9>SMbtXHf=ESO98)rZXinuZv40T
z3x<6Erv-Q{w~4Z}=gOu8haJ~D0}^rDp`Gulvl{8h;%k?Rfd6R{BuH3c;Lbd^3C(pX
zm_#Bw_>gXy4ZF;Q(xFZe{gA!1RFl_oy`S~RYd4jQv%+%Eltd#cwU&lZN}O5QT6=Nk
z<%`>rdYU9_M$8`;<$CjqZ@I!1<Y4H)XjL^~Njf@(rSfZsuDM;IjjWY%J6oJe-L=Tm
z+5z;HwW12Yj-9U#^Ajpo7f&u$T`xTbXAy3f%ui1+kx5MG;b~KeFRZT<;p2zBL_H*m
z=cln-D1G_zMOHRi2y`8}Ii8mg7mp$2owMcy0rv$vxAQfAqhC=&iBx`I7FqBhF%UK}
z*#$e#RGB@{;_Bt)1>q^%mPxD4_4NL78wYV9xr=ZLUdsOdr21uo)YZhaZ-ipfZntLY
zenzOZMa_&>G5k!5E%`6Iz_E0O%CnpJs!nr)@BkCq-0D?f6XxCe)6x0TPUY{cvBUcd
z_D$C{u!_}u8q7FG-p}IRR!aaa8>6w=JAJE;CDgA@H%hUAIB<Ci21K5wv?h(woL~p_
z6w&#q8)+4RFMNvD>vkFp1JFII`5cAGNo2@VNpWe4Y=0Y4)UFn3TsyZ|%R&29q^9+|
zKIM7Z#U8{kS7bEq2{APZ>C?|DX&{q>JY#lBordzjL^}5G78;8p>L$US-5R-Ou}Ofx
zEXT$xBHIt8Iw!FrM-;%n+AjT9%J{v4R8{Ip-g4EDPh_agweP~zl#;Hlu7<|%O?w_5
z9?-+2#c@|Ua^MQATn)v(r6!7ri~n1?8W#O)9bUmA29}m(vz81rG@4DetKS*4C}q?C
zg8AF%qsPG?5^(!RMIpDX>Z+<XfZkV3o%f`SjJAU@grL2hfE7AKPFEKZXgW1K9268p
z=g0f6y9)D?D`Q~A(y|a_s`QIpKv3q3SoXTV+QkCVxmiWShoD#!vWGIVW`@NuGt#dD
zmL&As`$+6mGkFLkAma%g87RRrDGGl_>Ic~WU4(NU|3-j=gHYymLJeFD28S{X9X~f0
z+=Y7Hi6!{9H9hW)rT9n%Mx(<Pjsk#P{mPUjGndz^r@lDZ<+0;Y7CmRClaD}!M*ocd
zD6haUA)aADrMyuwsYK}J)z{jWsn74I?6>x?T@f9rGl`2xXnt=xuT0l6UrJI|jgXo~
z4A!A}MAmur_GZTjusjpX{lMxWqO0<T-<KzGB7HC-4_ey=&{=uQtRjyqQWB{qv&kD5
zz6-`LbT-0DRuRmHV?YYY%8n&ad_g7TDVRStVO<2Hho0}lZd@GtNz<1U#sN;rjEs!F
zzCIR*<whGi^(wH9y|}&}86Ew>Ww!?Q7#*iJPq(M%?bmV^7Brc1@^W%uIKCx|<qNpU
zS!{OLhC<`pxNd-fg(Zj<Kli`-|7zewur^R^&EB}iyyWz!RVFn|6Vs+>roWPVANtrk
zc{FoGlwD(cKuBxn(GIncXY>YlNC)#Ix9T@MAoP<>*~35JDd17b#;?!cSr;16NLG`X
zPbrOO|ClT?n>~B|D-uGeqx!u9;+}^s``|2U5-vI&09YmB0@j{Zr)(xb&b>FZsjoWJ
zWJlWYSXC8W&m9$Sl-h1AqZx`HNo7~hpSH1C3kp-Iglz5{(@we($~_Yp?#Zfio_0Fw
zE!}9F^%VnK4zE>+0=B|Tt#Ch^xH#?f<3aeh$$yoO!iDk{PE|dDjekH%+%^NP`~d`v
zuz*ORd$N4eI|!Jy0R&8ETv-ooIBMb{dfMcOSvdfptV>upOGlhVV8{W4#1i<amLH{|
za&nf6v0~h2d6z~xg>oG~GDh+o6)s%caXgpay{2r+NzR?Rtm?Gp)LcWUZwyFdhcHc4
zclI?94y)K32@Z42A0B6aLIC2CwgdB0D~!hv<KeWCNYfU(_AF7$=!o1h%PHD3iSfs{
zk_c!&I#CppSAk#Tl*MM=Rh`CQ<+!T7`Ozdx0~fT;B{vSK_kCB3fQmW6Irq3Q{YsX(
zvkvjUxgKUp$Q(Vzc(1HB!O~yFCNZmP+{6?Km5#ZsO3=CXAEPo%GXr~7(2}Ro%MyaE
zQySmA0aF}ffGNDxCx22a+=HUkVPKtSosXHZpldBr=N&%Tq21q;8?koYLX%u7VdB$`
zs4JE%<zEYKP8t@^QyF}jvyL$_9BK!vxdumg@7giEM^OWN14k?OFb0C1QFS`>bS^at
zp9S7=Q^!w;F)tv`3aAcjCj&VeMR77X(_q4|;s1WjBdtOo+f~!Zaa~+dq#C{2)vV2S
zxoQl~{r{9@^+$)tdN9=b=v)h-)nc+3tBKAxG5Fm$k+#H03i4d1uQXZr&;55mMV>O4
zJxJV~BQIjR>GmQ*-*K`3q{-g=wR^*&_lz)wNbB;hJ0l@)br*3YZUujvCiY$A8IywV
z?vU{%Dk2L!Xx;*f#_{&uF=Z3yOdXJd!3lI*Q%l4{`zgBe6j#9|qQ_d_@pPB;Hr_?0
zrPXv9CB2Z$dg{2G@BzF|i~Q`PUu6hu;PXe1od9ZjURWp5fx0078X@xV=x{2;7(nQx
zj(igufzUu>7T2h>bMH_I2-8fLMk#OzxsEnzU4miEj`5_x0S>&o9`_wypg|?;=IJH_
zUHGTG3enEeJ!!3{L~Z{65gfj4L`8^*i`I8}06;+`l}ptXw0+&Y-Koay&%3RfyR*&<
zK1QYxbZkhWtMTQsqOIGosXLjI=PsVRcoJae10fQ1vzzp0g6qQHxrZtn9e_BSj0!r;
zei9>7t+;bW;lZ5(aOcg-RXHER>o^DtQR2s?Eb>kplQuLeT6k9TIj<UzTg1q{Hadjw
zD{90aamKBz^w1RBYUMM94E<%eF!O!Rt$gtl=2<E_0ce=ZdE;NIJ$=8G7N*X6XbpQi
zHu*P!Dw@+>PWz6lIa)iR9OZv&I0z=}h}(hoapU9S8}?45Q;Et^Fb<Vb(`a4e;a5H9
zPkJZvu^cO}EqB8kW>n68&GTB}Ypm54w>)+x_6qQR8^LE}pXUec(4uwIOZdwi&yzse
z^`W9O>gqD;?oShN73QJNJl!+Dl(Un=2-}q8&TO29J$q-V+PLtN0tI%X8@t!-go?iM
z=KXAw&=N^w2>Y>E4o)y@2BbaMwUXfaOL`9H9>tE{O@G{v3^WsWk_d*Tu&)pG;{GH8
z9N3*f`RBN!0tYd-b)g7=|JFozI~Ks+_BH;)5YY>is?4Qgimc=Ae@F}rbCUL=D@@WF
z<h)G;TvnvFpN90Au%nIXVzmX3jNoOH^r)vkT>s#>8XVDdkP%NUU&p75MgxkJIDQf@
zEt(zM{o&;QDacF_aU>7rAF`Mw;=Y(rN@%z73vpPtD|sV8;P824VI!x;@`zI{?~ls%
z;t4}WGgTw)pqK2OybTcNOh2N<m*s>HApXr?k$%FR9~1~sJ7`&YsWR%qKxT5VeFq59
z7t9xWfl`!Ofj*a>YNn5Ow8WJpSWmUv@8xT|PMp+9z2?8;HsN211$}v*D@R##2mH?}
z@#JkJ0?~fm|0y`e%8+Vmvs|F}P0<r|{Pa8QB1GTN<Z%}d0`Tu_L{kvL{&r>w*Xlpn
zp(QI!^TVLZ5y_`kid#76S$0v~4ke8Q7I;|{0D$zq6@7%x5!DO-Wck$eD1%rD1save
zDMaAW@bkJyV&_8ARW>_#grLq~sE%NLq^T$bpq7IIWFEf{n(hO-74o0})5hN_D<dC2
z${2aPdQN95L3X!zWaV)!PD>FIJsl9asv<<}rDkY1BqZ?m0y+B<6OyHI?{Xif37o95
zQ%LibXb80&bc71o3R|~%oZeRzK`Ij83P||z%0c@JX)5@^DU!E9NG-XobF|pqxEqF_
z3KFoAwv(7^JC!~NY-RA9AjkMp<>(8XC$CL$3*8h$BKp#I4^u(@s_C)3-ky31nS4P9
zVT}r{W>D5#bv=Tb2lwe^0U3Z#|JCq!={YE8b)77W7y+>e3SbD`r79qGkO^&BN4rEq
zE`k83XeI-!vx4<Oqw#^WsDLvr;gHa%YS}PVnekgVdK8Z4dlwbIveNdZy{#ZJ0De8`
z&m&`1=H2>6z*KRFo9|Zb+65k4p*(pT5v+J^z`kg|A790-g*vY?c{0|kN|bSHg;^Wj
zh7k?=;RnsDrTQ`|?MdAgOc<&}I{e`G$;mZ5im&!1xA;}FX1%;au7Nf+NWa<%)-O#!
z(k+Xy3J+VmlNBAZ2rF5|zSkBY36eswKvHN=e7%ZpM-q26@ga)Gb|`;P|Kto;-|^ac
zy*c03MYYkBmUVJ<qdU{cTE&4~ty<Tf)W@NfRDe2Z<(#GFFN&1E$YLNjTBH|$jDiSN
z7U}7#3ySpkgIf_?;n1?4(`gax03xYiriRZoS5@fbj~r3mg{{$q=WIa8Tf+Q2)&?OP
zbsrmkf~oXmb&WEUaIK|~<E~$WC$x&cq{6pOg-2rTLDp;O5!n_(&qpYD(O^YMOy8Zj
z%inBvAzh8b#qJ!^U&upYZbB3J9}g&tp8J~(>mY+Hx;(}-Mu=rson_~Uv{4Fq80D8A
zoHH6_)xN_n2l&^Xm<(aRhOp`@s*YC=9}W!FO%$L?T#)$SzT?L;6>@f|I)DVy1d`CG
z|A;1}7|{YhHyttw`iSskuD4{SDlxUG&RnwD>RLTd{az{@Ta#WnR=gP*@4FH04=Mio
z@qPyrX{)PCxusO3W7=reqD$_ye3Db(ytMhZfHxNR<Q7X-=i1P5T{8^iD5}oH*X$mK
zjb-*m<>0}U(9+-mGH~8t+0}aGkisyu|C<a~)KID*nvS40jQMm#h8)IWN#S#8=V_#x
zPZ}zqG;da$fYC$-8w8EwoaQ7SmH+ddS_6!e=;Dfb@c@Y*E9yuL&Br!0puou}aBCqT
zoHb*~ar4D;_T&8e=SjK{#RHYoSGgOzW=Q3s)mr}b7uhis$yfM+aS5<DIWF>bkUjHC
z{>PPv280?PFJr{Abqs}n_d4jDpWUhTuHnnx<TudYhV@!toc;MTmb{Q_{hiNHnB7tW
z#l-W@*J3HeS;QY6IMge=zIsq=XgFkuO}#atWXiUi)tKm-{qqv}MMfukU~FG&R_z?0
z<ss5wh3}iH4a@h#asKVrry3(JqnL%qvroHcr~rH?uk>pW<OtsB($v(AYNnx$fdXI3
zza$6cgOlFr1bg{|n;_9(8pOy3Lvhl5@Bm`(OXlsgk7K?oMRatU#$}|a)l~05a_>KG
zA}8a!>;G{9$Vsjy7``_<ip=w^-R=}xPf*ng@~_xG`N13ZmpQEI!gq>%9wIb|uckPT
zp<aax-55cI$k`aB=E*o)V;aE!K&*=m-t-&ytm3@<8gp#0wBVS-dXQMjTgH&b@%-xB
zMtC_&EkAwQ@A7F>6xGtjkcCvd*X&_bG-i5>zGX2{<M?)9YqM%9et{!D09*TI^5d&$
z%Vh;!D5pXX6rdcQu7i%ek&kfIMUV7$4vt;_BUt&+H!qQTRMBwm>g8q7i$s#nwwLv}
znFRBaDP*Q|mE!<Xy?^%N>v)M|Krb!)O>A_*Wx!)O&$8a?*|jEqu2q(W*A-a+wGL<b
z^^F~Zp@Mf!%dJwH1U~pA%Lo~uSvIFP_xG@hQ7NiN%F-qH%D-r3E50hwD6Yimz5=y<
zk=`-wFYm$QpR8TY2XPIv+pQ#jf2Pqn4kz=I3IT;i|HMXbFMpscrkCGxytlRlUxlja
z_Ql-Bk*RC8p}vVg0JJcGke*fJv7##_mR9~JqXZe;+t;F_@+Qf1TxF2_9ghJ7Vcp}+
zHA;-4_0dw)i~TywBp{y@Jei~h=`fX#KfyCk?O3Eu#iukueoR@#<4;eZ#Iug|ZpPhS
zK9XS;qPqpA5aBIlLS{qz#M+SMyA}9(1^ZEPxAU&o#Z&;m5C#@RWBx7DKCdS7A1Jd@
zR@+eLnNPm<M3`g{*mI=RY335HZ?#MFD3|dTv2D{)82{W|A|nXEcWjE1F2u}21*Xz+
zGqrr~^?t7!=&Z*h<h{xL|JrJw4EI5vzxk~2`^2u6WaxD*kkXoxH>Z0<Y-J!AIcUyH
z28|m2YQeVlE@&;+3DIs3l*EmQnW?7WkD`44O|^qts2Yi4nitq&K<upByiB0T^Op<t
zH&G1G#4$DbS_Cmkh+#iTfRfB3lzV$P6{o4VGTAc<9aAcYMm;lr9d)q1j$QSzDpA_K
zF4f<=lU2#^a!T2R*+eSlCq4bMZ#tiN^R!@2K7CR1!yQTXiNGh`v@xO~!8E^KLb^7w
zb2gEa!*&eF^KBs@%!mIQfn+|}-y<pqMWdBr6`n}lYiEQrvCcSTfZ=?D(n~+=JnHCW
z^HExxv;~?)kk3W-Y}tLkP-*DZ;orQ6%p|Si^+h)lRh=fjPP>Ti&~7<o1b%E4(}u^c
z)N{6h36G6QgE<|B`Y(r8nXXNwCpo!0BpPsn3zuWRm(}_^v|tN?PY&^mo>4#P<e3ia
zrmVLs>xhCCB(}Au*FZY~@O$CMw<(=T%SG#XRD-QI6G%jkSdY#>eYg~Q8mHUk&z61J
z6@N}{WrPv+_(oNVRNj^X_@mrO#8}CCiyFSK?C>Z?`ckkk^Mz$l{rR9`7=q2iHEJOS
z#$1*KP|=8^28nUk+PkuVcd1Pd#<W7%6Yf6@tY8D>i$fVQj$*a!o_p~x4%p5v)NBj6
z(#|X7etAIq&SAvMc13MkGRZ^*E6&{F;hpizbLp6yS!h^h{nM|ahAhInjQx)Gq;W!q
z)AAX1#@?|F6fc48Ua$VjuL;Kx|G#~t7-Ow@nv8fI@O=(W0~)hu)}*g8a+kI`W3nB5
z)9U%!A33y>zSq!;s2d(VE>0)P)Uq#Wm>xYZvRzZ}-7NevX`b<(OhVtS>T)N45X3~M
z{LsAN(O_T~gBFG}vwnIw$dLY#K`+(Az$E^0{(FvlOp6*Cpb1Bn=URW-N1)tN)YX9o
zB+Q#QT|+~EmVRPQOquw(H9|GTS#XVXuNFPai~E<sH!Yl;Ope!*dbZ69u@F3bMtl}d
zWnX=^t^E97E+TVoA~G^2%94~gSo+NGGSPzRLGC6V%$McA^d|<bT*ZqK^stN6TybD6
zo?TQg73f-+{jB=BQq$>J=;}A}$9tIE58=NzLoy6nR2nYbA^C}AU2u`xD7q={{(SV6
zU^kc|%UjWo*E#ai>WaIi_xj6lQX5~fTg%{Ju4{3v_Bki{V#S{@7)9!}iJhOjK^hma
zqJTYI*qT;RAe1N|smm3WJSuK8{@v|(^?hRx8|m&fPRXjr<_p0tqk59y0tN)}X_J;Y
zz2NF5>L`Yo8+AWg(VtZ0Hq)HrX{FoW%%ECjmdKXvL+3@cykO_v|LFMS4)F!1E@;B-
z7?!l{@qT};pV){z>3-CPKSFT?nMAyepS)~U+;YiZL@egMy3aqP@TsDt5?aRooe|t0
zBIt1TKhSyGh=GaS|JYVfok2+OV4XA_<0(i8T**fl{XCSwyz_|E@OP(&nYZEF{HZM$
zbD=_6MdPuO4tZ;@cxk_qTDA}?LAtn=@J!S`P;xhTn_TM2sp?L%4YhUeV<Jude@wk|
zaAe`uJ>0Q1$;7s;iETR*+Y_4;+qN~aZF^#Sl5}k2>-&4}t@^4?^&eezs=A-E&wln^
z&t7XOA_tY@wtCh{IsFs!>AnW_@Beb$YsY<SzZIi>zQJ{-Je4iW+8bq^R;gpjl8M+K
zwAw9@_h9SZwUpTk`TYsV+0|@>Z`GvfR9|ftJ#gW^(L{IuoR@7Azi!&SBp4!v%p+I~
z-3)+=+r~*x2}joA$@SZCKGV!Q^S%2Z>55VWg~9#%oCvCKsSEN94HV$T*7FThvuY$#
zRPJHON*jQRF~V+ef>)LFu0s;@AGY50&Mcx`=#|0qYZ}o>J<xhOKqZ(A_0I${Kn<X$
z*Q<UE!0;H<5(0au5a@@EeJtKqvrn1D01G&Zu5b?He90+CFle5%kO31?H9cQ106uG{
zTsP2z_L8c65%*=SN6<7!G(CZ^<cUU#x<O&BUjuYw$7a%jZsTHiW-f@zR2LRui!1vE
zqh86+Xpg!@i1qHkYVGP)L$h#h<JkLLmy#4TUtEgLa6#u#fC7**=qz%6iSz#u#kWR<
zGOil@kzw1S>nwJ_Zz;m5Lx}NxvA%xGn_T>4b1q=6FIN8I2%#+#et3es^Y3<3CGxdc
zH|Tivct=2Tj>26GQi4@y`{8fVrgu8@xGVC1J9GfRF)nIL5CI|M;%iA#klKL`xopA6
z?LWk>X(7w>Rp%)HHS8VQpNZcz?1V*6?$s6Bq`f-DKTP&9o!-}?b9Yik*1^o#8*RcU
zKc}^LMC|oe3h7P}ddS+&|7J$Z1Et_aBu^kFz)ULYZzE_y=N+@mPxKF|?x%IkEXD<a
zf)t@6#+E3q9E?0jfcJXV>EE&GC?j<Z<ZjbK2HhPmAw`!f^#0DIfTrG#V{3nxv=HVm
zlD!<$&cDk&pMg)s;cXO-?3g(QV^6=(2c`c>T_r&6(30FIN9YuyDx!N+rGW!@BTTr~
z8y^qX*g3C|S?AaGjP6V<Z95+08;)ocW95br#uGEpItKYcb^G)$0P+5kEzd^nO$fTs
zt>S-Ybia|_>a<<-?mCGf^u(~|v?likZnRGA;6hO+^Q{qjQ8Af*g8{Tz39nBGgss7`
z<1z(70T6>r`ONBo_?!61AU-iM`+q1UY~b+O^k4)95E_;SR_t8JkTk35G(Xifd{c~e
zef$lg7|tuOHPf|<>^*wsf3<)G7~6qS1Xy#e;^sY=zDRZpp1wPW?b(kS;F|(np)97j
zV^3P@Qd{};)DE4=GT>m1K7(w0AVI197>B69Llh00a7@Mxsi@Yc5F8LF5;SFJF0!D!
z*4+Ri)B=>W_yT82|J-oW<lx|b+JXvg9StrQ`=|FLiVp)$E`!|`(VOV&?JFI0foaf)
zclU*ok0#=3P61Q#S)7~qhSBrn4=DwyC6`SW5&&!|-Qq@s5%u_v#EHLtH|3L^_w)4s
zFg*W+#qSM~nhrtdcfC=Z9NM({Bd+fgTeurL#ti=B=--fbDghW%(-7)Rt>8k>AFMYF
zKDK!+C$TaB*ltC}OiFMJ8FLTomBgMgT+0i4uZ5JFZ;!^OA+5C^efi-O?P~s+?z~xJ
zn)A<G(#ly2YBd!GT9AOCV?k!frq~#}fPXFY;iTN8@4^-rQ7?r<rA1bF^PW(AStHB$
z8mdpTxvCposzpHCj-&iaub#4@T*ENzL|!tHJhgn}#m-Vxz`S49vS#UH%izhA1ld|5
z0^O|TW5-b#`MVF7we#Y3h-?PQ%LeiP%PjGSr{CPlt_M(P?I}FXxXpk6+E0^Q=~+Ik
z4&Ef3e^_X)!0lqc9WDx-4?MHzh=dhqJ4n_!GZDZKF_pE={9UQz2Nw^Cbe|4Jyw}*3
z4_VVnW{gTnYGk|~Do4J?p){^4;OKb&t)Q`GwgRJJ?N-W%MPP*De6FTBhtRX{ZOe=(
zb9Vt*Ijqrmp3$DgY~`YS3rIjr3HqTi!zWs<BAs7d_b&<AH!N--3Y5I!TUMJ+JR(Ce
z8ZsQ{<OWsRPq|otf6f&)Z32xibItceLQWD<pE)6gXv4ju;%sXRuuEn5bIBKk@LO@l
z04?~o*ITAk-*?@HW)vs3rndtv#3pjX%g7Kf`a!to3I7*~ohT(Hg4c>*v42XeU53|2
z0k04r_OT}q9j5dbXU<G1(d{=d;(t+czrenzdwfVuCA6N|>dW9Air4_eZ*#%>f4$+1
z*X<W3?6-wci+1p~?%zoQv0rAMkFdhWW%lgl8_wvbY>lDBKXSe*UuygX|L>oCzTwo<
zyen3_7lH@|9E;kt8V?{XwUM!w3m!K<QQykmyMRf8J5GrlzkG2%p7OVVvI_H=G?p?V
zTXJ1_x2$p#JV#8uvFd(3LG(!~@>VHtzn3V86A)f$mHvSwjA+1B>$=So7#=;%LC6i|
zkNA~fmC58*XHWR+Ifk2N-=Ew=!u08BI?do1s?ZSUOb$|+Q?``1;KF9uEM|m079wCo
z{ULa`eliiCa`eUB8qVuEkQ`w7(I>e~JuV3QzjkNpMC!I;A-!kCorncY1})B1I~m#b
z6%uft%L*p5hhkExkX3;}YY#b@H(36bPv+91q_c<uFk^Cw=1+AoQneUEtnV4yY**cQ
zO!9hemCk0T{13m)uA_0J5oHBj=!Cza{Fn^Kw&T`a{l%olya3dHpv_9~UX<6%U2Spl
zob`z<{_c2lGbX=kL&~NmaU^@(@J=?s1p19q{0jCLsC{55#L^EVzJcY++Ir-;oZ_%@
z4cxM<9c;}sp=baNFu_aQWo`59G*35r<Fl%cNbg;b!p8i2ofzdGjp=tEkFjv2$qH@m
z(%k8ucJ?(#)M2Gd<dSf5qyI&Q0T?itu=V`|>4Sznb74=xxk1(*Dz&1ECwl60yN-SR
zA2QuHtQ*DfI-(&mh_}p(u0_B(i6H-6L||#v?B8R=o;5a`!rsvudR8#_LZk2?1+zLU
z2$`&&s#!IQlo>Qt8b)#Nk;TVu83E0si}3G?T<cShQ}R|)@PX^uuit_;(CP`PPa!J%
z-Bur!W1Py$ruaNZ?T%=dUWRiM;Q-+~FG?4S51Lo1uL#6&wg*3E5h-8zZ}Tn9Kk&E*
z75tbAfFG%CD}`Hm5P)EQ)XMd;8D93y(iYAtzN^@R1N}HQu6uC-q6i)k@=~zRvRU36
zxKN}7v)<KFZ-d9!HN!6et;DS!zQLNZiAi{49r>wcf5Fyv&1E;c*h4FSAfk&F^8SMF
z+$_@w<DMz&WcPn14M>1sByx9NGyE+z<4+)1zG=OzCLd#BGy+J0<o85A9BT%kPsoy=
z3M3$4&n;4-QjZgMIxiq3%pPl@{-eo4E{C`I#$Lkxt5wG*YKVX=mX@K)znRlbI(q|c
z3(WYA7irb6!Xc5|M|s4MS5DBUbx*9Ul^~QcC!o;s4KG(nlH0z^n&4*fly+|vrOq09
z6UD?pvF+Nkv1CQolPtF1Sn5|oxu2$npmq!gI;^kIa!Uc3vnnnKdsElx{$d4rL;Pqc
z4?%O`6a{faKdFE1j)d=vfRMZG+E0UX=FcR2g`N`^%$jOkfN5^m$3Wz_r5Q|n7SFHq
zN=Kcp@4!H`9HQM%{QqAXj)d)uaW=xM*^nC1Apt18eq(HPK14|f5c&Ha`>B66mS+MM
zuzzfAWO7yJw2+R-DX(tZ1Ux^Iu({Uj*NQH$<;=um7?JqnJ(>JX4ER}7=B-%^@}|E>
zWM`~}3V7yd&(=+-k<xx@J1%E>6y&n<vsAls%;}TPWjud*#(uvL>rQp@`!N&0pGpN!
zB~`aCC0bE)1atzx!Xo3JTq^FQ|0XAM;oPch;H<Vj{~Ugh4D~)+tpvpg_fGTHouu^9
z2)jN>94hfZUen;=Y-1Z4<hp3(=}X(kY!w7LKxsh1YRVgGN=*NSJX=zt3KzY6H?Nam
zrGm=n3F4U2{#wH$NwukSy#HPk>%T3J4=O8d`B~k|?HP2!O-s|gxGt>9wWy0hQpvfv
zqNCBazX=$Wb7S@UFs9u2RstgR>ciu{w+$FE=plVCSVwwnXs@aLd;f(D0cvVnp7gVa
zFnSr|aHVS7SH6c|Q;J*re>i(mfAJ=2*JtWs*+NI@L};gu5P`ft{-bxJ6K%Gh%P`$x
zyrNsVh@=ggEa}Gp69OH`90p2Fp&^yLPEhGyy~g3QIGf-mPKel*_bl!b5SQ9Z+32n%
zf4Z*M<16Zs0Wh)&)dh~}69))w!(wVRyovC^g=W?&G}}}&>n>(Kan&d3!n%gru8!|(
zc#AfUc~%bPrO^a*=iDnx?k;S0_KyvuuRB*t2W6iIY!?0=foS9;5h(Lm2+3vi1Tc;-
zk@NM!IWV71yrJ8}HgC1dI?}#$Rr?gWS-@iTgrz8c&QcFHOu(uB19`+y7urr+aQf5p
z6PaH6#!C$qVv0aAh<o#cOf+!6{cCpHb3{_T)b2f#t=sIU*Hw2Sc<?s)J*5;nn7HF`
z4`}vET#3FD6SI?)I{cnApOlz^9PFEv)KxcC67VAXX%L4hNt(K&?d)~tVKQvWIhW0X
zH7VP_=B@qe%?N%CAV=T@$h0B&{)Y+t`X~0`lN9!Oo7U~3*{iNMwLZR)UAT#&*qaQT
z7fZ^;01uiIZorO6ZH-(>hYT;RJN9Hq&JP|Poifl-JcbZ(<aUS&-E`1w?Vu6ZG#_s<
z&=*i6fpxDYwf!!eS-FjyzKdm|^R%c;8CBXa3q$a!Z~f6pfrzZCI{((+E{`&Q=x+T7
z-#Z>TT>$-at8m^kR=TUFR_>4gOWko2j$B2bU)SD0UoOwtoR0Qv;x00$!0X!D`W?i&
zkLhXgMDieGYT0N_&Zd~x_1;Gz#iiWKVvZU+tcM4xMSz44ftI_Fc6V9SI5~aqFRp|h
zhQonGfeZ}vJDBev(d5=L#h0N~x*%CjHLmlE#)XBtsKJX?^um<a$>(h4SR3yf$uhmH
zbFDed_NUzaAD#Hnz6M#!y+`?j`97cJGxqjd5z_||Rt#5!rB6K$IE4GJLOimJb7tR{
z?YI&8Too|*<+Cqg@=vWshh*ct2Y$Mx?6pemPA_ntUP!)UdAnu<mlsdZVN7=5Vdh+w
zf!ENXz1XL%Q=^M!JW1=Lt#G1Z{j<Rnk~9;`m|T}YlTUEMxO;ufMc<z8lLUba2~Ppi
zxDXN!d%X}<f3F|H9+HQUdj<wiEn@dX#e%LHz3}k9cyRf59fTOge{};50frN60Nmay
z=wW6Z?3$t>$e>-R^j8h%i&$h~*st^bQ(y|5EgX8^a7YPQ6rUw2^451CkBYG^m#dzN
z1yf^cTZwI)a&&Sg&(tG#^cTIbfXcRK<-xkBFK!vqbe7tSjPT^AfcH0~v4K8$^vb+9
zVCq%qmqpx?z;(|@_~_1+m1iebAv-wmia#%Ft_!$4`(i)wrEhPPo_|szK#~6UOf+4j
z^vqHlXtRX$=9O{WJG5cfmF)*1%cZflEtKcoh3m#a;fGd>O>@S*l+ili=*Y<LOb)><
zcpp9Jaa!ScIzR}62`<IWSpi(wU-tC{pCO$5_Ocgwx)jUttnkqaS{;G}^k4-rp(zm5
z`&B{uTA*xpNyF7ndGlSG&x=baHT<uW0t7tco^D6rfJos-A~c3t$<f^CR<xa|cPeH;
zrN~+5Y7m_n-cR|QAL|IRw1KH!5`0&Ksddp8lv%=EzWAlNgecJXRYvpeKiUTgTGdZy
z2jXkfH0eJF{K$73N3CB2=k#w&On6#zJO2LVCH<lhXx?~TM)-wj0uTEFYXy8g9f9bc
ziqa<{h259k7cb6G(O1^<%%5%P8{aT~JBVK%lO0@D(eTF~@lEE==ZN+Z)XpY8v+qHV
zm7h<cl_hfDj3BkX+ARFhNdUc-iuh|I)%7fIr-GNZb%pawvu2~ke98Y`hktxFv5PgJ
zq~|iXaov$?>&DyHi&pNI8w}t{iXt@1!C=Rr7Z!<VM;_1;_0xe`Jwh6L2!dEPt&U>q
zmLVob`?Z5?>jTMn;t^XqFr8KPksCjkKajLyqLnu5@n;fmp@39Etiz<tXTRUdPO-D|
z>CTKDuaXtsjSjDjcXi3Z?z9GaHy6E?Pkn23+FMkV4wuh|_fDBk6x}f{k9VWh{&o~N
zv0|Ew!DV~LJUpj%!_b^*xF6jVg~Cv39pZ%q3@JFayB)0T0IOR%KH~ngBWxt?j@nXN
znWFhsOx508m$dp>E!WjWqYvKe5vp<_-&IW!a*~OkuFD7GsCr*Ki1vNy+9LNBHvu=m
zOG*Ws)1enKm7;cjnMB9(t2eK7e$z==wYk$`03^DGhzte52uAbCjYbmMvA!HzD3_7%
zr{lMZTXj((LpFP5c;a-|vJ3*5T25B6iq#;TwcPO+$&RM;$Uh>4Rg{hXLFkCm&})bp
zBFL?zJ7e^(bXRzu>6FE~UxOoYc?$aH?431voh0g-M)216ffng2h#9~xU)WV;%e%bn
zGbB@S!ZolYo*7>TaiUiqeIemZ4KDRUc_|?#_rjyWB4T~c`~!RF(5^nwLwRP?C(R>)
zAKCZv2HAi}<xAUSGGRG)VEd@PiNkhvJD*X*N_L4KYB|oekGbNE+<%A4#6Bs+=uI<u
z`gPH7=xZ>g8O7fv%RW=JS6u;h8|{bi$ztCv&a^#ub>~ZVQ!8IX9`Hb9gz$PrEmJyi
z>cyKa;5tm#x2%o%833i)3Pm5wuH2W(oTW(1VJ6`hK4*@~f#jv0Ky%&>n2>WdP(~w_
zSg7F~#$eJZUNkASnEZWIj-n!VGoP(Y6=)Dq?b8kr8p8u3A{(90uhg`Hv-%uwWd^2(
zA}vqAw}wf!_@12jeZq#+#$EKxf#pA})^ZTmN?JxX*PvtUYq7|h4(CE(CG|$QN1*=&
z76D{dG&u+w2yx@X!J_y9!2)<giFNCKr^Sxg&6M#p#>;+d*$s5D4Sm}Lp`ZNe6y}}`
z*C($f8zd^Y&z9jkqQVv?Z(?FVW~+n8pMir_8}psDzD`F|lcEG%WccwR{RUe)o;z+~
z!c@p##Q&Ff3sfQK{)yuVqpqFtp2PT#-kkaO;1H<pJQkx_E}R7Yu5>byY-#aI;~4iF
z`b2$yl?BnI#OG8L^In{kl#Z<L49Xu34!=L@29zq4O{rs5R{)s#yn}1BEtE6vFtxL4
zhOcnUm9uJ@nroy&eAy#~nPrIh<OP!z5EB&OtNjKXzk+$`@=6Mjbl$ip!{u*uQEI41
zLj1-s<_{Z3#Jy`=AgH}anSf_vj#bzIS<{f6c9P`=L2v4#tt=*4bai{1-vnrQEz2z8
zay4{xZ$01Mtx;!V+Nvs+#H-;DedZ<?%`Q7ClZK)iEc8@0t-w5HA8j{R_-bs`j@K9+
zv&RI=7AZ8o)zM1vh&XbNu)K(~EN^@Pv3;vMPWI$B@?%1BCl9iE>lpVX{M_Ad_(rE;
zef85<>u$`idiM*g2#9z~d4D|c7Hi$DfwB`pE&sJa`y~-M73|mk#PjkQrDXT~3m4C#
zgMuhCY$T*Ks`}f~za1K|;x2OgX?Dbqp|Xp@%lks;4u0(FAODm!^=)g`m&!~XtQ~#&
zCm)tNc`jg*zV>!ft7|`6+>xA4wx#sz?$r{T#h6^(>E&f&d-vbt4L}YKa^N9dA?*Ma
z1;ul|tv(ctbs<<{+q?7z^;l`f{wylZ8YjdPIFoL6sMc-Zocl%a>x1v@FTTqtmrkx`
z!*@5pt)t)NLicL_C4L4Jxu0DxJRsB9CcXapx4;id0a<V`cH2L0ZSgz4e*8ajCI$p_
zbSb*Aj8E%f-?`Uh-_9xb{A)X9%lnRhX+{=DF0U;4uGkYiS<?n2uGpOQ*g0~uv(gdB
zjbtR>os^+L9T4~wJec_i7QCEAmgb~91{HF<zcj_K$7FmQ^FHLIp$EH*DWHB1Hy4tb
z_Bkfv=7Vt9o)qvtN3u-+zaVqINC?IxGLj|`zn9=g$0e!rH9U@{wceLaXF1(lL(!$=
z#pb$YOR$wCTdReQ4a(!3ShhalY-$7I#Zh1yUZuPCwAsjmX-o8)mq<o)aqG=}{;Uak
z(9pju>(d^)+uXD5w$ATD=SLpWk<sQxS5qbjt{j<#DZamk{_e;#W*?7rl?Ne2nxA+5
z)4{lX@ckau+du^OVXpjAxE*eAc-e`gn_AJeZB||;ZZe<Zk|yAECNs35wmBjMcwti8
zK!Ij_a)A5iJ*%NaS$Wp54i*N0_D2VDN*JFrKaCdb@DtYCLuGYLQGI(=7xTfVlTO_X
z5BZKKgX_NhBf88?ewy%nH3&m!Q}OPW%4fxY(|vI26^nqZT;anJR9nW5!HJZiew8B%
z%{A#WcOdU`=Kd|GWk8eFg9U>C=qaswNI<|}4u-H}>99S>A$P#X{C=9?X+Y$7QwKvZ
zixhsZO5v!udfPzU2Vr^2YJY7WIBibYR@jcF=N=dIG*cgbCAyPga@zfIaiF~!HP_Et
zJjTR-UAw=9LH<~FA8hdt`I;=stl7=^-z<Qx#50$D`(jTmY`_y)easha+tM0W61fJs
zBD$vU-_bbAuJ3A(v!!T)V(xk>T!fcZJ1YutQQ*&~xO#KGglK<!31}5<8$ifO+a&Tz
zgSMzLs-|j*=67I6O(g*IB1f-dDBr4Rf6R>Rs)IqMS%L(ZeZ?dE=n?&R<aA2xwpSd;
zFh}rnoqaP+prS0}dtYVjzQz?kg#Wix&>F8gkqEQ*jHn~kiBJmY8Ls9^4vNQj<n&%$
zd)Xta(qMJz)K|c7zF8TDs3|)xEqd(5{^*u$;h5DwZt{eYx$)m!gWt3w>KEQcZS9|q
zS<+yF3|9w=+rSWDj^)N>KDPZ#g;YIcLoRfbIXk%~S<W|x&F-p~Fh21{7keB=t>MwP
z;mqJ+0f?AIFK;uU5E{i$f`@B9Z5t+q?6;moEx}OvFIs8*XjWzzR14ha_NY{cDAwy+
z(D{D$7Ece`sC0HnXDu8Y=a>03mgwE4<z0n{UQ@O252u+-)j5V2+9$1iN&+Jfr`>4)
z^1P`wz81wsrJb-MxD3-ifYsN!Jb)1$=IMR6inZ(Re{13wG{584ef_kJ=dwwgF{|g}
z#XrjsGn>=^U^lal-Xf<SgN|5dJT(Q1)FkV5l$3lF7QE)qA0gLP*VJt71pOv0VMhQm
z)9|wrBd97UcCmLTN=W#ta__S4#T-7p9(FAC;*>zh;4(ex9co|e<}unh+Cw2gcrf0O
z0&H0p=FCqgl)>7%3TL;2MSG(XDPdQ?r4~%PeEj>F8Qw2j)hXU$poX%A_b*^@hzp{t
zY?9c#HSeV0&eArKB76Z^Le%7i<S6l@&2HR57kJ%Ru_jTHK-g-rcm3yJhT<Jjh-G`j
zS0TW6Kl*C$Z*oZDYz!W=(5oPoI}2E!WZ<UPZEDh&TH?nCN>yNYM8~%N`+t*pPDep#
zRSJ6!*V1OwU$<AmO@OY)#HoEL{+)>f4Q@;!tbpbSw9;1+d_d*UA(x~C-cTEoACk9D
zw|U#bC9`3I_acHH=DbQnK|*ZuBTCYvMS*dk`&^XcBR!%AOEvHS+{F6|A(p41&eHk{
zG*up@vfcyy_xtOpz4;G5Z}GbTl)#C>hqS#E^XC>UW!`mqF-Vx04g6$A8O-vthd^jy
zj}ss~+0Dml3R=dNbhv;cQaj8NW$>ujXkWIm+;Bp&5P-+8su7|k<eT}`=AJ@_++#@T
zvkF4xD%q#+&HTt8mp9?t7^`_9_lZU;AqvB=Kwz={*jghqzs-F}e;HVCPwrHz)46uK
zi?#J-IvE7ClxVMaozFHEa?o~dt*!0{Rds&8Fsz|I{>%#aa~?_I|K)HVS5f(o<>tn*
zd52}g*?|DKuFO0yZ_%(#vYOQ;s`FIGArQ8>m{~&ir2$2JN+Q1NgBBy9$F->vYzx;2
zbU~q3v(u#X$CrbVEg65W!Pk5DCTWqXxZ+!>I~F+~EY4l%BIOkS`nHvIwj=0Bd9#?^
z#nSy`R;wPA#rY(02;Q=})qWRwYMVDa>~FwgFAkPZme<Xi(Qp1^%7y3vJb<Eb+=9cX
zEU^&`@r7}nLSHP=bo945K>W*gp;cR!$udss)yr-J>Y<#>D1XjV+SyMzghBsRbn`m^
z>`u=_{}!yjPD=|z`UBhjhetx!L85|oAp|ptJ!(JYxi)s|OxmJqCT@^J-GE*4=I;=3
z6um^0?`LN*6E?VJ1-L@<Pv}l%_vZ7+JiOgzlV;}e{$GHKw?uO1w3@qXfB(Vw4Xo*b
z7r1UR@`$@;e>YN||MtkbC|u7Um(FK1r?Ajq`Q39ad*5yJ#9rwVOA$)PV2VdUTAc0<
zj`Ehvr!5Tx6LT-dxW55M>f*ZE8@NqE#k6eAW@of+)L_w@->2>X)al8os%$nVhE`|V
z&6RR#PqqX(Vnwtom6P|nL<!U)Qeo11iQ+4HG!V>%hH~Z;YjY2K!?PIsD?>QYVV3U`
zKbNp>mVy)C{J?jgwCK@J<Z&39XP+7tzSff0x!$mgz`i$Fc?>(pb{di6=eckkU<U-G
z^m7oYOLQgCD<q@&lu~xa5);cg{cCds(^@nKyf)N)Dtdbg=Y9;<y=?)KeYdHg%;zWt
zQ^T+EujUhq#&uQf{wTx!-2d5JP0)93FUmg>5tEbp?g|>9s7|o9f~@TnLoswR0*95@
zvq4%iXhrhc+9)i+jeTq~SO!SF(Ce}+4v!3kk9P4iEM92S0?1}imNkHkOqX^yxc33A
zl}co?&No_^3NTUx<kIofBh-itp`kfQ$YFe`RINUH>Afc1me8$-ZAN{fUwUhD1^fth
zJUSm#6#or)5Rj?W>i;GD%4QLTKk8bI0jR+%u%Q5R!N3(_k^4Ds-ypSNY&Ee6VaNh<
zW0pN<a}vc{@=-?FUELh%lYURgdvP$8^UW&Z(0Mx0J<D;_mnWC1<d<}J%H^;fGeui~
zFUpE_Pa@B_3;te0h7$G-F>sfS^;i?Q9v##hyX#dy#gC~RSa?=AUs%-Uhu=7n$aahy
zknm#C+>Gm55D85Z@cdEaak+VJBnW=(%c-4wqS1BD4Kj5!fxo&)y4Y`K@36ATTV4Wu
zQ<(1LDV-J394p-;#{NE=eUanr^R3_LD3%|bc>jVsHkbjY6d)xd3$BD!sn&jx@>SLI
zV$tvX?_?vUB}`NRnVpuwNAdB6!WZBA1fqt4YEjz$Z6fJ;`C%~)*KVzaQ=Ts7cr5*4
zLr2c~o6t0&*(iriZ4k+ZD3G~=R&mKi<a_J#!J^z5g(YTcm$tp_JYGs_G77{h<J4e*
zCRj8b0Z21Wv~kWgz4)Vx6)5gLZ2Z;n!IMjrH<MYP=2Omhd9YeTAilC~>CDYe47-pD
zcPK1}i6xn<y4O0!ln6y^47<P^U4J3|!EpQ~uqFh%yVQyOK{fW=c5E|A<npk?FkTe9
zh4{&);^*-6U(n&*zxr^L0w7ZMl)BW3vcK9>`ymbkPofHC$jm-nycz{ia{h?`FF_G)
z?h%7|TTHL_r{w<6OsSmekf>9uX$=JO=mpYsE-|Z1x*a#-PilFs<4JYqEQRu!O;tF<
zIl&K}1`g#vA8?!pmTJG=d4IR8?EaW6qiYR|tvcGwK_T`LO{P{8gN=|?t!7bN0rvDv
zir$*@EI&TL7(Gjx$ZF;`5jkd||GHds&pFlGcFs2(xRKVAq_yEnD}Lw8y_jgWoO;li
zAg>rG93^=A(a}CY=)&|?tk`dGNQ+{HzjMck^`DZN!`;;86vcJr9Jt^^?2@5#j;q*`
zTw=qPYG-Xbz3BS=DUtYDpUVoi-^~bm%54ox-<<QYU0#t<ju<DIRu;%RUGh*hk{gnX
zZf0koo+u%sZfD(TsuZ1&`uPW^uWf#>g?zp|g|&w_t3hbN(8=FvE})dzG=iRaXn<JB
zZBxnF50G~(Fu1c=di>z>Qqu5GSPnqXIH7=JKZ*f8QV$5GWCQaEV*y+bN5>I$if{D#
zOI{iq+fpl}K7kdSuL#C6V3ixtez}y+{SO@}kmzQx8E1v#%Me!egzR^aH-@mBSqu^p
z3Kd$BsozR}<&?FFMHbRbpzx@dwMnga%JaJ3xct7s3vnd7;fzRiX+<jS1bPcKN7!A`
zYpd)SzB&;4#&Y`g-T#w!M3qA@8y`Ls9T^hL3obZ3<Q=27v3=ZzzMI62b8;UZ8^!SA
zS_{^;_&3*Y%p;`UTOB3dPd05T`@VV%6Xm%wnDl;x2N8g*(Yt{MfscbJ0FfPhdV&jI
z8aw~RGOK-TZMWB}^EJ-HJ43+8FE-77Ywkt8&RQ(jpzWLPTNnNS<u_5Yh(J6v$5nGC
zRTQ{B=U8va*rWG-eHfeurDeT*qRySXe$&J5`Jb<#2ZLtc?uvn}({K+UU4DHvgLTs6
zO7Sy}DJu2B{ME5NqslBzCf<S2%~sq*bDw^Q+01h9qGG-aODGt+qi1SdF87-$Eakn3
zVt*Q&$7Y05{2LQ@2ylPW6jg~MVOmojnLZiO35qy6<+`%!AI=^+H$5Z!#bHJ3tIK?Q
zf+c2b_AGcG7F!el;v<KDI2k#tu|D|G2pfQ}D-Qg+KU$zv$*d2e^UK8z6$Idr{0G2c
zz+ewmb*<#e=Q^v?(acz5h=u9n&w$8($OHpWhl_IKb8!OnvP#$#SM+Qnv`X@~jF$YG
z#Vr&(SK{bQIPo>tNK4pcO>hu(y_?&OJ0A$Q@<JlMBGnMn-m~Y*;O#tS%AG5G=@1&(
z8s=XYJ3#Nz!1xc%(Z|yH;CB<3VbwA_6gv#Wk7HCIb8Sa!ZL^Q2FcG{5W#v&d>1OW0
z=aF_xiQ?eW;nVvXY3isJ%SH$s2xJ4FODF-`4HzkhF$Ea!AU07MA39|iqcZtaG<~*Z
z=A8_rIO4|9;33ofad!=-PgXxa0cUO{4LqATw<eDr#z-X3cn!>^GRbT<eNevG4f<Ox
z=)R$a&6!{iAc;DXsExP8oempWG1HA`hLSqij#G(_KNXn7@?@n!D5;_X)BTjoc|5oV
z*@>MBG+r*8B~AU4#y<!%hxpewkj#d|F`JDQ;t>2>mon|=eb>LD8ySEt$uH*;hXJR{
z{fF!{HWzfwx-VGNbutI7d{^dAqGWzpb?D?)Rr~DMg*9PrVUMsw$O6^Yx$-ozhvVt*
zf;#p>Xm^klI}bGF>8^`g8ZuJMu(82&Em}WoPK1PWhwP_Wz2q@*H!3Q(wiq%(145j{
z;dlJ@9L%k%eA6*{8?Hx-ZOpqL{ICCFsb=^L<c5g)5tiC79&c@QqNaEls*To{cEoxA
zIeQIa_8Ki72pP3SF?p2h^=oZ@klRcEzNl93gxM*;K$yjG|B~|N#l6=@1+;7hsty+X
z0uY)6rxCU83!V#u2JyaW2Lb|+VhA#5T}}WPeyi10?5ljF0KKUC2cb^#z=PC*GU}$|
zlVE9;QUvAqs_(KFo+GKcAL;fVzLXK{UT$Y_%{N|HiX-$pMQ)1!^tU$o+nK=-BS#xC
zy0-TjIbk<pqY_SQ8rToh0qj`V797YOJp~EK@zAlmo<ogdxl@%%p(HymD|*KqL?^V~
ztuq=jMye-w1qk|!F6ug*qd(mEA9OR8-<93=3+g==6v5N=3A5VEM_gfhPr5Y#{bX$^
z7WPO3aFgvp7R*VMb!r5Q9pfEnPj#n}Q)Rs@UypHS0Hkms5Z8QW%b>YI$qXQ5*BdQp
zq>B+S83~s8`3|#q2VDG`aQz}iYt7wX{IYK!t^1I45E;2S31f#6z1&}?bV<wToSc3u
zYx3LIxJ$5E%An%upo`I^Nuo1j{SloH6scU8*UL{3ukQ}M=~h{7|C1%e?87?L?>t-(
zWd<{Vkm;x98G|)T8)XKP$sIkolR|gZ{N*#}dwEZxfHGcxGPX!i-x8&d@4ii;Z2ZM@
zXZ}fwb7U=OT<#p*TXE;Lz$5a>vM$j-H(g|h0jbn-I&h)Ne6CFN7S;hxmNcmp{jEL5
z%@OaS5St>>f0XMb3FKH)!}b$;+FCYaDfQcHTN<;R(xXI<a#Tmq1W0ksTju`KgdCAF
zh=HUu_f|&@J+ry+QE0At>vnV5K#iV|ZI{FzXsOwpy5XmNoJF$Vh$v6A+)m|WT5z6!
z{QlGF0iZBlYsX!B<cy>boT?#JeIa}pA|SM~F@^h6ELl|Rra%9)Eqir|uqBNa$vAfX
zUy9=ZiqOaJnsBP>Fj!12gu+7e8%+H8pg;sQVY+TWdP*!Lt^YwNFE6Km@<k)PoNEcX
z&=46RJ=o2&<7d@q6@5DaJUBLA5Kig<q*A6Gn1kC2f#~i#x$#qXbo))T(QgfSugEG4
zwbO$4CAUgMfYSCSRmtvGJU%{_xbn+OtCm?A^~5KA)Ub+@!ysYU{S=LAY1hND4p+w|
zaG`Aa=(m4JcI-7%jYa0Kmbamc^4I8G#zIR5_MD$95QdKePnY0&TTsqxjsyW?Py_op
znK*C!6HivP_L^Yno|}!GQ;<R@qx_tmo~KXxwph^A*c}Y>VgiyA>~2Z~Av|XFKP=n3
zfH2d*mxrP!C`;>yT%3j)U4A<x7=IjES@hJdHMNJ7CA&@aA5|{CDJw3XM^)ee<t*d2
zZN7DkPyqt9PlXg;7j{qk%-e<r9}{~$Pf$_gnr7qS_uh~O55A1_FGNcAk{_D*abYp=
zd+bLAOdd`a$8GVT;cG|&*1UHs=Y96+UJ40x-{H4gb{6S`d{_VyZ&py=b)%iMk;X#}
z0|CM$80ts7F79~yqnpKiZy@<iAX)!1x5L!V;ln70=#Hzq?2+StitiuZuHKq8Gjur!
zLbJQ6zRS?W#ufB0>aCkg^0`)<1J$PmXJ#;^kB>|QcZKQ07J!qgIskUp+Cnj@;6szw
zD2})?LEaL=X81i7<in5BTVstAK1Z9_T;zD`vuF!*Ery5WrxNKWgr5jgrvT3~2`4_&
zU1%#Cb$vweT6mb%IkKZWqm?T`6vO+1I&5jlK2(iMg~6E;-$%Dc?Udr$3m~`J->-WP
z7$_qexrAuPmvqkqd<H)~)~cDW5AN(dF#wm#Z}u-nE<oSAJv9K24I7}o9V=*|i}6Jk
z8(&Bb9aIlem;mwY<+3>K#^Ol;x3{;rxVWWq8BR&6$b@|9IXV0w9hu~048ZYhUaJ;8
znPe=!18YEEUmuF#yTg33bc?9PZ0_{<xaVm_8GxOG!xto_0FvUd{+j$juxFr)Pht|l
z1SWcN`7Azr+{s2A08US??Y%wbNcHRltqC6}I&Q4}_vxC*?g=id-#y9<3h{Vq^9;9B
zO07%v&Ouh_8l%6Ci=6GzduWsHl94UPuSxV|6ln~Vu^NGXr-ai=Dk+qFH98eRBEWKz
z!+~5*8uHI+l)_4X;F=i;2<Lzl*7a{5x9RdYtT6->kMtdpx&_rvV|`-#2)M`xaL;Fs
zXx?wSrin#-ef&;16ZuY73_y(G=?xnI7U^N}fIah@b0p-V455CDoxSY?#U5a>YO<IH
zRw$9y*<%4Z59f^e+gok$-{AurPR$Sj900MO?D<&L{aB0<B4<B{mBF?N_k##uUooS8
z-#}j6p3~>b_olAw;Y>>__9DuUGmeC>COO@4dq?oEN>>NhUCB$Jgtis8K=-dsMeRX2
zq<&+_XhU(P@8bh&@)^*XfdH8nw~K2gD5W-a{>OmYFUW1tX)s&Dg-1SH0SF<TdTpNR
zW~bgz21;|n#`Wa^s!Fpb@2JZg^<^EteUP+flMU|Ftrl{?K@dDfMd7t1A24G_a2ctO
zAyK?8zhb3?=)C#h(VD59B=y<I_!ZBJeupj>YWMU~K!W-C0WCE1w=4}M{qa18nyV5!
z6qwp^mOmHNF%{ZfQh56fm-Fv5Jco8L7<lT;z@~|f1ns-G8X(3sT?wb{Dzp3L=KTD;
z^YIMu!3)5`!eX;h(>+cDin&Y<8x13)y$m)BL}-YB<m6;51E2aYpUgmz;8{xxCnaSl
zA$x{gOiYYwsoW2bYeRQ;E<lLL&C78fiida^*}H#bL0lA=*v#RYL>El`1(kzdl_fn-
zG1PE)`pD9I2clY51xz2{ufAn$hrwpN75&zqhj0q(S==(h>-lD#%m&1;<E8|1oNhH%
z)1bgILrmYlcaxQz9h^P`?mf0Nu+YLP<T_IL_!_*w>;bb;%zx(e3hg^B<v#jWR;`pZ
zPON*?C8}>oAkSM2yzX;KZ{2kQ^RAz=$!WeUf|zAI9_%TeIc&`3KI>E+kHLy_dZQSr
zL1=WcAUkUQ=}vDA-vT1BlSL?BU>Ea=<Qoy&<APe_yxRNIHqTQ!!+4=qL^pw4FSCkj
zRZquz<Qa3u6)DP^Ar|~@TfG#=l4`z&K9JV4=u_gV(dOF@nV!Rkfo~<?AWy9=*kMT6
zc12h>Ho3x{1;VnuytkvL`ofDyEqb$fw~blE0zTPG!#nn-%=2MEFrNMBaUlPt(rUAU
z7;eS#gp|$TwC6FxX)4ONCmZ`UJ^wX&Jbr)szA?0#19J8o=n#P@-L(2DTNy*#A%1s3
zFVE!FD#&kuk!c;H^cUQ1*JQ{{CRkl%pXmN*6>E5M2xU~>TR`dcp6st*%2i+lMn9L6
z&--^I`S#K73P*|k8e5V!vFA6+IUjeY0&yU0S1}qEk%$e}4U1{oE}#a-FGfBWei^i0
zfumq3UFDG(X{xrdK=_;UhJQgxN-1MVCpxvi*N+nF^!o7w63O8Lm1t8gFE82mUh@i7
zD!RJ6iG1(>t{C`lxyiV@x2C0~DU>;<%PC_BqiSnwqf^SA0D%RgAYCGt`xE5?B`p;d
zQVe)7-A*?K28NiCx*&WVp&t)lVi{Lkh2<HPX3sAA7VQ*98A5-GpD&j?Aq*ryey2Mw
z8VjCwV{%5Th<?*gv;awq*65E-29L<yey<(S&Pn@Nj?hY5hJPLV^YR<JD0a7+N}Kx2
zLf7kF*49T^2ddo2Ki3QF(7fZt%?A^JFsk2z*%nlFCx#{!W>`=leaP%LX5I$xHUZnx
zWI+6rl;b<h-euAjyShf2;Ux<dkxWu>gLr|+7l)(mj}?1$kF6sWKq#FnqM#-yVMJo#
zEA~324aU((r{pM}ix)vaZH=^z_@rw!w#%^Sva-_gpP&&X29}DX@n5a{i?KA^M%o!P
z%IYS)OasU69BlQ<gBSWoND*N3buQ(<bFhkGb2&8xzH=nX518_@R(7?V6!(4bQ-5Kk
z2&hp>qR&R^TL??M4u?|j$K@(;PaG*P1z?<m9ss8VeF{ajYMZyw$)EXW7z%hU(AT3g
z|Da+`HS??<aF2hT@7rWOY?FDi#l6hY^I@yA7g0xYhJZyNu47ONFwA<Fu^q^qj|J_y
z1T>u%lK}mGm$%_1+=i-%dI_J0;Iww4rOY-kw`%(Vx+pt5QkKYiW~+}RFdz-pviK#V
zz=|q^Xs27=c`>?tA!9$r!22*^EY%a(5e&Fv|Izfmy?((Zyy9I}e^8+X^|$$bbZGqX
zeO$8uq6HEIFfcLUAp^k_*Sb9K`h#G!=~Jg!=gUmZ%x+$M{q!RX1wQT<N@UZVxU&NT
z!LtY;ucx_oRuxT{vF&?a%uP)X12kPiC30}JGOj9EcT{~jYN{C*o=dwtzp`UjR;M}2
z<UtoDgSh`o+|kGknv$Kl>>soM9rg`>$TDE|QJI+?A|;teB(Wi%_lRHIl?7+6{u;dD
z81!&5#5Q22+IkC3OW|kvp=*uu(`2aaW94cMpFqJxA=QDtgQD-w%AyGvvEm^Y{yC{O
zV$%H7H!V?rJ_E)i#cK!;z`%;+>Bc=|*xVA3-=YnRv3oUXNkJ7gz&5<<d~aLc@<SsS
zJM;CO>BsYC+x)SY<~hH`+nOr#$AFYoW$~S<^P&yO?cV$;ij6ZS=A!??qHMokq-U36
zi^8zG3}sk<3TyW$yrlgdVfVDRusZg~u(KJ=4g*||4tT)d!YACR1dyt6m=hc$nPI5q
zqDHOwQo%v*15`v}t(U-UWi?OD0bTmHT<tNovrd}WaOFD5tE>rVrH1CSjlSEnu$W?;
zAOlA<6wF0)+*pAM6^;ab>8i>!Yf$rRcH1<K*-EZ3Kuhznjx6zgNp^FUPvRNla^{3q
zlnN*)4ZFLJfYbu8>aW@U%Hd^GFAV=}uLB{&vzar4l`?V*<^WmFV^a;;4F|Q*8n)?P
zYqV5V<KF8=Gu^TpSlFu$+VHxcSYQx?=arRoh+WPlF*5^^K`Lu{`D~1@S9F4cf|QgJ
z^ev$iKxR{r^puOseZbw|z<@@TR=xd>03HocRp5Cy2oy>irOFs7Sy^v;VMI>c_<)sK
zgSZ%1#N7odR_tiIjh2hm`ax(Dm>&e7Hd|?rkUwA-%{Gv@2X_V9a2`bOJ7r9#^<x*G
z+V!MpoW}5A1;_9SZO|3bHd-)S=Ttp_3)*q`wQIUPA@Nm*)5YXNo5lsH>9f$y$ML)$
zMG&Hs!VBViYlKnOI@@(t^|n>w^?i=*YY!)YE$H2HwWQ81?F=R);EiIUhl$n}A_5vL
z{>2HT4WS$XsP$~@&TMrktJWQS^NGL#rewN*I57u*+2v9gw|p4J06k|O5wx+k-t8zP
zNFNR0Y7RE7IW;}y(sW!7BX$=6b>9I$V|iM58flIkHLWmK{EA<qIX`j4*Rc3IkkJFu
zduiUwA{YgC_&(cupR|m2<yZos)Qu=PhA~-gKT9(GXNrKvifj7S@fO`2cNy4k-8+S+
zO3kUR`vtK^cqPI~&*CqybULmm7Bu%;hqni}OsqU$?>_FLi=;Q#@=mqv+x+SU5@4-I
zT{MrsF4NP*%k-_T{iY-*58>Focp~mkkA4BxP&i(D#vj8?Vtn-Ff?-9EBhd3wxd^Xh
zw!Vp3#4l&B)Y4u%M44L2UlYmwT#c@ydY{;K-5mB4`il^Z7UwZkb(4<;3uMn20!@CQ
zL6u>S#<^M*ra@DMxcT}~yBuV1w5t)VVS@kG|NPtVFL1rHPiG>7>GdkS#rWmr#nI6b
zIjly%J2O3<dsiC=2j?U2aFVH)&+GmqflSgih@YRo(PCD=&4Gl!AV1&m_HZ0o(Tp|2
zQjSr(A$ZuBLATAJkB;X*K|?XCWqu9&SnNs)aK(}vCA^|pEjeT4^x>$vK(ad6Xpl$>
zWwoOAM9dnraMChF2khbw)4pq>h%5E0Lek-V*tqGuDQ#4dTp;+4AW#z4al-5nY0JHd
zY?Q=N{cD7rN`M)#BP$C#{-!IkyU^LE-BqKD>V(is3XATVd&Q7f*BS(w1gnkZEAR;;
z91hAF@AvvC|C<GnvdX*%g+nNTtLBk`-S&=C5fyp(wqPDh=lj+I6h4k~1dloBs;9LE
zef|;`8<JV6SnGG57(7Z26BnSc7ufv%6);vzfrwk4ITq=AI&$Zwk=|EaN|}Si91caY
z@QkDLy{E#q6*g4|@(<_2rk-V~o$)%ReadfDS6vvxTcfA!LCoCbYiT1ULB=uz(Z5`k
zioP~dY<yh|(zUd13@7xfCcBY1Ci<8c$TS7?$;$mEQ4viX%ZK@yzIsa*a!oXR-G$l<
zh6+9s(8R~~>P=*=6=n0p5r>@TR#y|3?Jrrjs%z+J01tT=;HL#ez@^tWz>Yy8m$l~C
zIM^MAYSaOeed_8rQ{+jD8)J-Ix};xsPA=k*7vNxXjCKCvL;s+wK7My3Ah;;~iEMfi
zDf=Wqf*t7U>Ix42jhp@S9jTpw*NyLfPINMrp|K#g-;iFbPN-T#@M+Week>r?VXMQn
z<@ppO#kk}9v;|hXFPHj4ch+paqNCWspOV8eCys#umpDnk`lq)+kJqz1|CLYMLst+8
z0Vj+a^J8QaL@bC>X!E9M+=z_H#|He%omgm9m0<3;eb5^&=1vBQfLvq9`G)-)U}G5O
zWk>J1dl=v4%31tkUO446|1Qbu8Qdb~>|%@*(1a4iN7<I#wV?89<h<!j_>%QgB2SjJ
zDdU7EGQ&0EdtOWXGzuTi79MPl3QPGf&CzBoF9;o==H<7W4!`J@(qE;y*g0&UE+>Cj
zem4g5$hd)G2_W66O8;}R`OS$+SN4UbM={H)w{xq|;IW8{4}3S5(Ym)>{)2DTyV9k1
zg932F)X^S%dnif{fHl8DO1>Hg7fLLCbwB`!a?#uy-_D!ezrh)nX)5pU40-CP0gOLO
z!!t+bzn`3#QbeFA*UiS?g<$p-Uwr`0hST4~$hPC}zRSsHji)fPtXa017W$G@e}4e;
z;VOKj`uJTTKfCM|-W`6*RysS{3^De+zChx5H16d7o6hkO3CRu~Se3Ee`nM+BIP4g(
zLHl={RcF+F*&I3kfw_@&yR62qZy;iO*33J6g<N{JamB9r&LuGVc%t|y&IyKZSf8sl
zs@45>i*9;vV({I}j@LX9@wEFOzJx6YB4E+FS&S5Td5IYzh6qhYOuSnZC(ux9olh-8
zkD15k$;!ZRL8)1A)8uxs4yuNI`vakLT7Q|<Yu!JGBH`(K0ZWP`<3PoV62{WjR<#l}
z2n6Wr!bcd9N?bg90RJsiy8;6P!^O$@*c-oq_L;)ra1k6&;^h8bczm}dJn(9kb1vbq
z35y;?l8o*{6T}p9#jUW2cv;*!EQ>q_1{r6F28kwU5Z|K0Y?L%vC<+hQiMF@vvaPek
z!6b0Wi9SX53LKnU#s#A;)FKSxrk{A8j5G&q12?7L_`4I=<f?~l@a-M-u%jj+>jWFp
zX#(kIaIL2N+9rxg$#Ngl-Dozw17Z7sd+mvkB))2@W)4IQ%S%AfJmiM2o3+2)!v`%;
zB2O%=fS}o!NgV%7fko{ZP!~_^en|n^xW9->?T{4TiQA4lT*oI|!--wmea5JI2nV@S
z6&~*Q$GkgCigIsMG;y^_>%_=qrF63mUIyn>)H6ujT^AJ6Y&wgfpufWrpT*?PX@mc0
zQjziX5)pssST8_<vw{b2>nSmrElzFu)>sf0nKK-dK9zGHYPp7{J!M?a(0=r)Y3;QX
zPYfFqZNbvNjRpR^*jjp87t8pE`!h3FpT6tMLK85G#ie<<G8e&iZwjL-m8P<4Y9N--
zG(ylT?n3Y}eLRO@E3hWNGP6N7wwV~%s*Ppu{M(-&{<GqKoGMT3qcS)cvOq~n6;()7
zG$=@uj+%N7=<<P--Ax^NdU`rBHs%4+cL!A-y&!)DJgBJ1$exeK4fh@2G~_~16#^0<
zZ)$4##DEk+h3sC|`uS64MfpDM|AoMj^j^RLMo7BV@;{^ALxHoQ4?HRG6Dv|1rVQbJ
z!4z>+v420%1LC#2B1L(ihb?Iu@b&)ad1w))_CwX#NZ_rcTqKM@qq4}3xtpExjxR7#
z9}r@Ix~V{7$WPm-jB|PxFzR;|UehEzNttvt(_yfbC)2b|O`a%$EBI_Of`<$Xot9Y6
z5P&%cvUTU`LCVMvfkGAalGcm?IEz9lwk3xVdT9)c>85S|GBrf&84JDK40*xm9ZoIH
zYB)Xmu8tZU%x8LpLSb$J!D<eybz1qC$>rhUMLXq0$i0YQeO_)Bf7H<wy=x!WB~1pu
zMvVH}m)p%Xf-+uM@Jo|ofE=ytlloQ#(5yujnx7I(={`nc<*&}^E`KtfZ!NWrsN#v7
z-wAu}&5AEM-*IFXn>+w{)~1Y3Zk`Zz(L6J&7B7t;;iaS=szz*FSv2godcA@F$C&`I
zhc4^A-6^zAmC1#SRss9mcdv;*S9sw$l=1dGb7q_gj+=C(LUZwWM-@WrCmQv&>AFwB
zG{*9wa*GQ5#vLfFzfkB#VeZ7$I6ZIW6YTw)ZQ2pMw0xEzf<Jg`2!(Rx#!#4pPcIAi
zUJ5hZQ#xt>Y`)`Kxo8s#iwy6r{N#(RD=8T!WWz_Mq8@vVv(nPil9rD6P#LhP?QZdY
zy8NSAyM6LP6FD(6lgsN~qfoX1Qu_~vL$^KP+_4Huvnwtw9ogB*(`TY*V94S3Zu!s#
z-67z1uBER}_&N@nMtrrrM;8G&vT*~X;CsgD0r)I4J%6A=grlAT&xDX^zvma0^*1^g
z+fe?on`*;9o_3pH14z>%GaIHu-tOCVIGj;BLgbFlc*l>xO*Av$`cUXP39B9~obszU
zaJ<JZRieHSu@Xr;C*}Cfj*jF$@-?@ZYHgTayKD|Ea{ZF@a2pWIEFPexLKu%~Y+i{*
zG~415DgM9azWS@JC;B$H6{olscPLg$vEUBHiWRrw?ykj)Yk=Y|!GlxW-QC@a+e<&|
z`__8z{RJ;SWhFN^Gjrz5+;e8{vwiU%jnx#pt=dKJm@wdV>(z08Qy_<##29ne+Y2rf
zh3(Rj5u2TH?y`?z=<bm{ICfrkuA$GVHcB){|02DCNDJrp<i6w0do3&MRv5*--d+d}
zfrlrzP8gc<Z7AApZTKtJ&zpfO<e1m7IauNMVCuyUi0DwI7v6Pzpb!Lj$A9ag0IxM8
zIEFe$q#9r?;iLKYp@l}WyVT=pJF%#ypwYEa;WXhaxz_gnu^r@1Ih|eFw%?;ty2DFW
z9&<J&dIC>4A*UEnT^F1+zu^$7B?_V~0wr&)^fdY0#vg&n)p6!iswDZNXsAI=jz&sf
zD_RC0VQtCD+E9?qHTv$n)%acObA*wR@^eaqw2#~(OF`=@c=z*j*+{{BDq31;z}&du
zT>wMG4?DZqn3#W+a*?dBfMRkbYPO5Dy`!TxYpot^Y-|`(NUgG}stMWI*&1a9U}HAj
zrZ^DDRzO=#Eipd+YD$iMaSrcv_uq-(+(1A4l}M=4hoZ~;hMmma*MzSCb#r+@6fvs5
zs9eZ6e)00a9I4o_3z{g_pc2GlX)u&!dn`?Fl51hRq3KF5ElK!5?(X<X2znafH56ok
zMI%!q5!HG(E5_Sgk|A%#(;^oQa{GxwC#GeooJ<t7Cw+te`!w@xXQVW|gE3IU9UQWO
z!UFL@gE3LV(D*)UGRBmum0(Y~akS8F*kB6u!jiNh`h$t}ttHyxu=P=``AI%|4h|jA
zw_oIvsk$d*ZPT;Y(Mf$fn)6)5eB5q@5ZA!7V*I=Og~0TslD8v`jg)cNC3WEUA&;LB
zbk4=x0xpQV?OGOeQhzmQf56<Yh8ORIC!g;f>b6TDDI|5ECludCfb*{vOdr68*A#zl
z6}{F?1Fp)#7Pnd8U=TPJw24FWmaI!9hz8)$CD*UC+lR{~g^_)5U{73+LJE7#!3{`l
z)T8ZH5zkR1h1OH~R7pNO+G>$njhhoX(-BW|ef1P5gjdyl4}CVUo6=Jg)l<8ZW35ei
zNCyonL;rB&Cg7xh4EIVBz_EoL+f@IZoVNZ28ot<D9G8H=PQ!<zw6<Y^itrc=UGn|t
z32$6e<V_WivRR7eWzTs;bBl}omQ(rAy`;Mv7y=Z<^nHEU7ZnvX?vFVg=O@X93Lt#+
zeZGf=vy-&9b^o+~+}1phMC9e=RaAbZq-g5tWwqVZ6;vo@@G3CieQ$9d%*FYY3?(<c
zAdYJHASk;A5Z6muOz8mXQnW$^`--lG)J9DdFtRA&g3>m*0@>qm(_OC)hQ<P4Li;nk
ztqrGI$JMumzrriwqptj1N_g~1$S?<8!E`262d|CDRk`#&>*XGEWT@xY&YbY6=TGCN
zdm5j*mHr;J;UdQ2PprAkuY7Lf%|;*xsqP3%?uvieUU#hXnK;W|8Yk)cEgiATyOso>
zcbyUwfnEUEYAAZZFeXJiJB{8lKuTjVGE&z*9$!sK#)k{n+b8%N=eD*!bSPr6Jg$c)
z1JXYrB!u7K2|gE$a(l>Pd+Ms2#j#{K?tc;h<O>_2E7Mmr?y*fex8A!)deIEq6rwTQ
z|BUh`GVIAsAHR{_voC-L*hGey?QeRVTBYk*;?J38>=5DDWb~4UISlI-+U%gMB13s&
z-&80>swp{-PI1k<%_8Zo-HHT$g_>UwkjG6G+W##A<zD|u`F=X!)&GO-@ZjL)W4nyP
zXK^Vz`0mND?%>zVTo@Ztn1-=4#^*I+B#<`gxQpqopsMDjX~xSQ4xDS;B^3V`_dPEd
zH-K*<n>2WKc2=|MJDHGollTWq3yV*VI|F^uB<P4e(5>OCs_G?kabRHJ8Z-)l)`njh
zxHxqFT=Ok6JDcMD`(69+-wYKR%)g|qrIfOTMt2<(;^RlmoJ2*tpcT;nWz{Y&E_%W+
zpPrsD?>}czIv?>JOlH9Xq9yPELrH)TpI9qNA-eGNu}ktldoqMKX^5V3bSex;B6@{C
znMJH}oA+8n80moKC<h#t#xa+Wk_rHHvnbM9(6WM=$ShIv8cbp}nFtVVKm+eggJ$?v
zmWM~pSW7CoLHZiPRLtogMO2LkS{sc90tjQ6<#bB!$a>fxfV5;(2tP+IQ()vv2-UKG
zmPJ;`fO5;Ac!jHaq}(8~OncUX<A}$pDWlJ%O9@p_$g=y{Ndvgl2`mS=A4{C0u-COz
z^3|q`G{J`N!oPhurj@BZZjr(6N06z7lpiJ{62($J$`5N#bKdhvZ0PA$qKU@Sz_{0-
z17<2r@&Xbdg<KXjky0O#{731Is)}vqs?kXUG7D_L-UqXg{5xPmfAqHjH)?lQ?U?Y%
zM5_j+539lrHH>n1Ce4sPDO%8Ey|wsLV0Vr_xwYjNbG^zuQTI!q=zdi8u!DnWkptdu
zq<j&M;gJz=9>$8n6sT>8{=Iad^&T`i!>=?kXh9<H5;eH?h%=E}OI~*<;g!FAyN3#&
zWDEIdm#977-^*uxzJUr-RGZe9>omq-#A&FjBf!IZ-^^-4<5ZFhk9+TS*@6#`FCZ4}
zI*a|WEMTs3iP};O`4{(pNmHoi3N#|Asi{FDVAHKJLP!}ty(`z?7rob<OZGg>^6CB!
zmITzj3HS{-T88nE6S@&t-RA-0<zN5^=W1+9LlX_ZNHxuNl@OIJ*r}-Tkx6Q!G~JE^
zr&4+L6@EqP-Hur|rVi?B6|eFw5<5leGDW7cvn=JtdvUVa9+9{7F4G1o#nW^d)_v!M
zh+ny*CP(tQKH>M-qT)y(FR;mD7y<?d{2+omB>>`JIqmL7kH2RMpPcns=7Ub5WvvcX
zVJU6QqZoqSKAwK`_xeFC0FmHEsMwrP%_3zKjh|U8X&c9CQBH5|^3hbb972nbBdIXG
zfhIh6omgpP9%47)C>e3^W`2YYB*4{o6`RJ>SbkYYr*yzpT9t<_ZZ_D8b%ud!xcZ5?
zs}4XEWI{=!0?70gC_Cc{xG-yZO(u5C+goP1p2dR52Q#a-GStxNp459<tfvF|dGy}<
zw9ah#TooU#yt4e2-ir3sz~YFq$^K-V(8lO|zhW~Soc+#K7prZMc$2zgplwSF&TPma
zXO#BDB|+riye#sq>}VXb`witkQ(%C%+fiR;SFK+Vusr<@I1*X$0L@{uO@#g+-l5Ua
z$BU(LNr1CUj`r}tqSeS_-={lua{no`owy?R(*hHlWLk5`SuXBXIA{3~DK3LQj2;0k
z#h>>K$QW@iH4V_D+%~i3XZa;9la}+u?&3n(kE2M14X{neR#h8XK$xh}lqdm79=KF5
z!9;56_Di-G9VL6Ic8B@u$A=2e`E|?j^%>ZWfEX;(<`Pxvdk^a>Ev+e>@9p6IZrnMq
zN4<~|)_%xVN^P0zU8YyDp|`L0=Fw0e^(ig}f@c&Kx5jmyDX~mq+!%&}kA&<mh6hEj
zQ;)J~V#x5gUBtqIDL=S)%<9wIRA0>H`lIK&%}c>=2pQTmhNKacU#1>d5Qp9tiJwA|
z0D+WIf;9fOt2XdmaY$S~stW-3uZRE=yz4tcN4HN#1_!d6`O!dtbL&i~*c1P4S!h2<
zbGkm1ck$bSvJvtID9h2ardk;7R3W!VPCM_iaAbkfp}Z@-deU?tubWx_-MelQb*wc8
z(LNzEJVp4m(E9|tnzD5YnpKs4*oQaE|Ll~W-3u4>`WWy;e~U7WqKk+;y38?n_W`<$
zC^QfO7$pBVV*u1iw9+g$<7oT~jp7_NhDcpq8XmTZnBr;9g(;y7AP!`xKZtZ%R5p-}
zB1i^`*5Rk=ppE9OsZSVAK_6F2DCCmx&0Z|G+XqJh$!hR54~cPBgTAUR4yuiQq3$D!
z*(;jMxXG6xLgle|>eo8P2P-PisKA7x6A=+R-Uc{idUXs*tw<{-KS=997e>0v&RX~s
zc7GmB<|qScBVVUiE625+!tVOFlotzBUeE;IYaXjvNHDy&<OK>WjSOmQDxlK#D8}=f
zc1sO{zZCa0DNUtN{-D>or{{#d?UvEmYtkHug;{X`iRJ?Ui2*~8F)FL~M$U8<ISga&
zqU=z%<uP!MRm(z$1)9wZ5;g^Y+mQXs7t(NWFmCmvd@4zq=w1V2Omu>GPhMs(bIpNI
zgTcOkD`I<f8~z_eDXf1~zdPV-p^lpoD(N41k#*}PBdm9b08=#eG#hvh3)GCRPMz%;
z%rh)FhBoPC@!uuEq_<!6=V1WrYwJ!g!KR1UDPyQiFEF;3n3B{%o5HEnDwePac@b2R
zhO?%`deiQ+VRZl?9cmNXJF;w3C<I$6GKkT7W%_-MbmComeBveCS@J}4-iv5z>m2Ku
z%p&GAN&1*2Ah`1CQg7qzeKC)#_HAF%w5u}bTrXGRUqY&TZH-S`?sZyXKbUUd1DcTF
zZ~AA8&T2HO)>Yq+IT`bSCZ4&$W<!P)p6Ed0VFbzx10r=3ugcuLYC1za1d(|OSZI2z
zLddQ{aNtc5v$HqFVUJ8|na?_j!;|jL)p{#}VuzRX-;?X3qokc}OdC)6Fs~1P{oTZt
zkK<eJ$!mo<;FB}7Rv%lzfgP$H9$A6tg1XHj>Abo33HUb*8vP^vz_YL&`nBDElxFj3
zn<Bu*{S(~DB*I3edTYL=JV1013f^XYPXj=Mqo4Z$<K6J>y3q%i8wCTv1BPJ<q*$7@
zQ{yp(Ul_^<QZ5a%@T3*q6P*nFB(<UU`0Jtm7s#eLuo2GqGjKy`a~4XAldM^aWTDCK
z!sg83eTvzn`9j(Hm}aIUJsVVNF#qkxfYVfDMvGg2;`;pi!B{LTYspSM*w3G38+BAQ
zQf*(So1^PP!*$pWrcjN<sal~ciNhN*Z}^}3uoef3F*7_^WPK)zXHZdeU@lrgC@*-P
z15_LHH-qw<8W~gUeuMcj3^W?>s@xoT4o#PbJA*xg_4jI!Ijk3~p~vRyZ(*U}3oH9U
z2UBk2+Bk{b0edxlnN>~wA+mo%hKLi~40Cu=KYGTEUFBO=<O4zvdlg$?Z){q&zu%o<
z%i#GdXUs0}0j$+iW$re`lCLwq0KPa#C>?ymn<g_q(Q5MZm`~U}BX?l=$u6h0zKot@
zkRo*Wx?cSxK7)rL<$sK%fP6?+M>_zhc8Oc`IY0d{;Q%oy%4`vH44f#*IP4$w0X#_1
zd5wsX21US7vSm>s2c80n>YbaCP_stTa7W99%r~kTvI*%#l`p~H$lL$OfljM<ArUL#
z2O+wF!0q>300O(@fuKR?n<mMR9v^{=GO{~S-DJdplx7q+D}2q(jvaKq7<}%v_00_p
zlPr<juyYV_;hcD*4jd(lX`>a91N*~H$C80peH|G*Wy}trkH&6eU-aLE;XDcF!C-TS
z!(S%Np1nT;ds2pQ=bH}&Shx}T&#p*rf4WUBSFmB1R~Ntr!hlE&)e=}xz%TK)P~wGu
zN;3@glQXpyGY=y$4PKPgQx}2KjE=xx>0<_Kb?B3|Gd$L(D0BlGuz>#tCuv(e)7zr-
zG^Y!~I$wwl_127Ec=AaC%)q+wz4Pz6(4K=sUE;6?cSaj@YC5NRZU~#ehrEi-d9XkN
zJ_=nMD+bYcy}4o6cUCgW8(AZCFI|(4Z{K|S6076*+|0A(nU@vu8gIOu;3n~$rQ<x@
zDO^q&5i^mUk2>hhE&f)OPl6X4L4P6K-iU2{>?)eFEtrNpnsLUO4qi)CPI;c%gh?q1
z01?jgh{52eCLVs1HK9BeON>k!`SiikQBJ>)4{uA5>5Jl0Zp@80r?Uz{^+je9c%TLj
zP((yzLQ)%#ni3tIH%9I$s_yCIqeX1aRNeAIh2ZC=C?VrzBP%yZ5M?9-@h=5sd046d
z8Z2qxtt?ahy4SdOlLT^HGJXKy<`v{!+`_N!QVP7^7re`K(gWBs{oIctv4(vYptw1}
z(>NdeY5O!Ocf`Zh$H(weKTAt9{YPUl1pyzRsfJofV56pB@I1<HphZxWf-DQnBlvlG
z;;0^ScYpKnkxLe_AD!!!mhH>Fs<5bqLJ|q)HySid7p4sJv(`ekDu=eBoxTgGe%6y?
zNGPk@{Cvg189$>%!w<k#gnY$10!I1YL^hP70osmwfooGh5;Gj^0e^FPYEMJ!PRHY{
z#Y^ClAVrE$2Hr{WEG~bF3}6IfZu)B#nafi<Mq1wDC0tP~Enl9d3vv!bOD7YLJo&_D
z?&5BY+BnG*e+lPd*mxPkR`_FYo%xphIFnaad;4oDSBMXY?%7-{FV^i-ECm6XE`u<n
zcd38rK{%A1SBCk6FUz&5I=!tk@%{X6X47PIP~e64?burT9r4SdY=?%uJ6Z25hVDnX
z(lxfPbVGK!(>}{TyiWHn+;|kgyM(`Sni|p9+jc9~idXMz>-CJ08m;_5i|Wt6vz)$v
znqH{ZE794O>*%T!W?Eo<SK_EvyYg4Bv!0&YxuHHU!SBh$d<x$9daiTg3D<~hsd2o8
zm)&-LKW53e{`nzh$&rZZ7zHSX=l2$vUj8O6mxezs&oWb39eV5FRN%LQU+h<8I&{?)
zqr3gotZo+OEa&ngub+v#RUqGSB;lvnUN14Od-?pf%fiuo3yej2!yZ92SlF>JhKo%`
z=zf^b2<F>%6J1^1B;v~t`CAhVksw4Ef0&aCevKEl&zMx7LvHFdFrMbam~-k>q+abg
z1r~yk_m$5dcshE2*&n6pK3c4(Q01qDwgo9S=5QVkCK^{UB?+y~?1xZ~(G+E!d&C8N
zxaiNL{6fosJZ_%tB1Ps`eTUha$LLK@mv-p3oe+~Qu(X0|uAkz#^y-1^kM-zx^1(Qw
zYr0GJbsouJ-%P$`z1ZAj$i5PF#(FMF17>5wmh*u(p+oLKt7%)|e69n5;&WWw9v%-#
zlG$SZxWy=;)q>_$%2)Xbtc&pCPqs1}(X-upWa;ia=|k^%*jpSGa$GWmeH6WO1i8(;
z4R*P-p9>}@7R(deV*Tislg&&%qLHGW`c&{=g92n5(_L!l+U=Cc%**c~Zs+(>o=hdS
z&5)fwxDM?EZu|I>E~`~XbKKy8Oe>@~0rI_1-`l3{UPsIT+i$7%7N&P~9rX4;d3<rb
zi<%D8J9-JrarOy6jS|~i;>(oimgOsP{MK}_kVDn4=9qZ@8b{KB4zqR7^4uZQU#Xtz
z9&6Kc4caCKjSF?C!%A$#N{PD5PVjeMFUG_R;cJ^>2s<ttAOgy=P}Bk8GXABge^I3|
z>Ub%cLLl1k{-x2dodan&fDU%j(i@&`{`AG|#hhGkzYq;~>@blYa?@w|JnCc*U85am
z%YAcH{~g`ADK?z#)F-(Dh$M{tq+L0PZNy_LQ-fyvsk5a(_V5_wWu=N2DdS)Xt!d(W
zQ6{qDUe?upBKA(Cc<lsBeKSCc3Qa7k?vP7tBm{AAh|2y_N-JaUEbHQXgG<h!#`;us
ztMQD!V-_O}Wowr~uUESYd(l&RQalM}RLeA{gGybIjMc)9LN+$f1(R1lFD7?|8!D{y
z=w4xDw5|~?n%;Wb(d#Y}3LIPgnP-InuiPykJkh?;#q*-s%QUic$diU94s5kon%}k`
z1vz5o->TP*53C3<p9!QNan*ydZRSq<P&8!(-M~`h>XoU#yV2-Br%SACTHzlNY1Qb#
zOne)r8#RJ-6SxDmi2=y2IkJg1GxCbQr+#T<Kg*56O4-Z8L`EnpKiVeLJgmmi)wS~P
z&0;<|(aGjjaUy<USTAi8s)y^O4yZFoAvRVfabqgjbp*C!Z-jnx&7mR8u;czC`yn_K
zs_+gAW>jGty5fFNP|u(RPfs)zf=?zx_3dP3nLa+}HQB5a2m!8-oPth|a@0Di#Gba&
zM9v-U{Sf%*WN^$MWx5C#_czT%p7QT00b>tj=q0A?uKZ{_ca<)quR6|;v}PE{luRfj
z*;l%CoiLOW1w6Kx4!+JO*p82BY>V^kQ5nC~0RS8X8F5jyDiQ{w74|BxbY%&`Ng?;c
z1)CTbuq_`fp<fa_B^bFD<!F;i(82wrs$F}eU3Du;-`nM0`Vet)mI}bj5k~v|l6AO#
z8PRpjZv=~L?GI5{q2)VQdN)2Ro&s%0kh2A!&;#aq-Tv>Rb`{;5t%QD`6d|&kbE|EA
zNUP00<TV!@{SnT8ie8{k2#3oVbTiSg5t72ddAN1_c4@YjW${k>Emc`yclw<Pj7U7!
z!c0`H)Kk-Qo%LqD9H!~(nuEQE!F}MLwOyzfUGL5Yqj2PuDu-#5jKxyvQ;Tv`H_3?`
zcfK|*t$BcTR9AiWAKEC6^o0CQs^0WJo%h88c|Ycnm{K12gwI3256gd+5GDi;5Q&RQ
zKibQSjJ3{wGW-lMiQTD{fm7CJHCv@c3%K382oL1^31j~!w4V@B@uNu$Hkwc^j790x
zr+x{pf^?gsvHDyp<7oUa<fdPl^e`O#AAF)(kHv)jKgsk+3%z127ZM2G%@s1Je3gZf
z)Hna`;&l8xR2OU*deqozY}>G-YkNX;{o*Wp3Un*2S%XWJD?FdYq<fbna985V@4lPf
zg<{O2)oTV&&)~MUz;G_U2jCJ&kdTdlY&bsM=c2E&GJg&g!lve~q1iQX4Kux!8k6x0
zZ=jQ{w|ZU~;1&jKN}FJnb`9P7VSkSI<Ia>C;ExH6%UqCp^P(XzU;B~Cp*O@7?`@0N
zX%R5mh3Ahpy8k{5O>)x~_ZHqv1$Zd-&?Q@Mt!gn;Wg{jj$Fn?>tc~z4*#gmEg)|5v
zVY8e^x9c$0Jczj7x3SYZcj>lJI*+)YLO1ZvqZbi?)Pedg%e)>hbRMteF2v~iodbX2
zZ7J@EdlZq`)m#`NI$zWAEH)<n>9>_kFRzo8^b=9bk?H(qtL`!!8|qUauKu$*{hG*Q
zZ{LiABwNi9CS;nPkUwhI?qRDoU%Am@f!x#B5p9=(Y9ALBc(wf(LjvHZYl(tlqTgBJ
zikOotnc+}2!hddoV}VQ%3Fr99-)0yt&pb6WD!G)2n?s~H(+M1O{`QqqAgx2rBHeyA
zvhKqoNiP@Mj(igH8fMHJtrBA#yFOw4?a#A^B+Ic)I?B{k`jpp2fxn(oW357SVSh|A
zY+v_^ODb>VbpAR_9;CHiI*o65VEC0C{i?sYgD|a~BHFu6i}(b}FOr;P3u9-c+F2~_
zD3Q_ck2Nr{y`P9@<FMA-^7S$!*`?qw3y-_}6Fu-#87n?}C!nlb)5y~?q&`<$_sXue
zn=n|Jw%9<0b8~ebamPLzZwz?H7ZAb9(RW>m@$1XN2LU4Z5sc(Sv}+ODDe=`t7(gbt
zPvJENZM5dF6{6F#`MbJJGFm2OWL4CssvZOqHxD7$MDLheajL#(4~E*H1uj%?eJFYG
zvfZqpjF-dsIxbFUxkfJ<WP-$D9>TSaDt9Bh9tPGv|3Mg+YRA#*?_?{(3$MGx1<jQf
z!_(}1ncIie2m00_Ot(TBO8xZ8ecuW$T8L64tiA8Ag8joIu+xn54GCoGvqK4D^*OQx
zj271vWUDg}1X&hnM<$`gCCZlb9QqO*X#fwJ8D$;sY~DBq_$j<%ZDvO+0Ezh*lBSOb
z#l8Y;$Hl^jG}Oy)5`a#B=HIP1xy<-!F!0*5XOEQrQ6tKd4YijIeWPyNM~wHY@s*{R
z-kT+y#-_8eahf__DaUCGo>;&!H@x7TM6EZ_<7HU@w82haA#aaf_0DZucc>i%zE$>S
zj%BD`q;MSe4D5vCXzU65uWLJwc_m*TuC3krlw~aOZJyMSQ-2eFQlel+PqUV95}8Zc
z-5uqCE56UTg9tY_M`aH8Py@H|dk^`zb7^CsB$bb|?{Y3Fvuk*I5=V|x8U{2F(P2`S
zw6O1I(`oX8c&y(6Qo-G6AN%T_)03NYg$^+%akw#hEq(<DG-`xyfe#vk;=)Bbj&|zq
z?`Hx2p>4l&wMjl|8`0UyncOVn>2L=bSn^wMM~dpa%iz|lbqfpC9~!~nwaEX2;H{Tl
zCC4REv*WzhLXS+zo1piS*vr3SKO7_Ob@Izb>dTXN!FVHj%gU0*d(cI^%jmBx=dXws
zt50HB;p{OFkK;_s%k_KvPp)5PGMxh^r}KUOmL+5JEvxpW2Gb!bayyJc?n0VGXDToS
zadqD2Oh?PkPj!9HYf=(ugELbsL<RZv&K?sS<~2^i9n65jSIA+@`XFolV}uvr!udmk
zw5vJ;5_A2k&L4H9bmOlkeku1BHS4GErzskExw$O5@p=NkW1kw>N{hxG6sw#*(5Yi*
zcB$um^249?5xFE+i-PMx_+9j!Qy_Yz^GjHw9y=t0T#@u6$HDQ$_pu*<9J}I%eX;B!
zJ)+M7ve}f|(q;f|1urKfopZEh9LHO(7$H}`b}s6simD2NaV<6M_~`<A1ekJPR{K?v
z*mdgX)$Vg_-&kq(9St_XyMbK~<AS}f1;=q_uGPP|-qmL_3bd=GGtcbFj_%{MQ`*^1
zr~KgHmq85c>TFpebR+zN9zkB#E{OmO@+>%gqWt7NI#ijWSAX7&*)}^jovq^b*>gyA
z>>iEr29&Hk=Nw5ry>M@nV<~lTML_y;!HErgBtf9!*Yo_Ud^f|y^|x!P&1l1(kxs^u
z>>WXPrttt_NwfT+wc3|@Q9$;}G0`QL(4qDqv2tU_mJO5U)U?EpT8s6P$8>dc`#+Jl
zS2<OTt<~-Jy7%h5LKB}E1QV0<XWI7><J7H_D^4~vVE~KMtddANejQe0sOH|4hG$E`
z#WZ54#BbL>ku=uNraDlo-mvFEP_t4nAP*8vRZDT7V87Ryp>;#5B-wa4Q+@BxldhGg
z^#k8}()xlyqm2&P;C{S7V6DE*D;7ya``3wlXaBVxnG3Ohrs2{u0UyP;bBd4Rc)H=|
z`X@#>nLmjE^GB7j?82^oJp1-Rknb<|g$=(NgNM5e`Lwwzs{tGm;1-;9fnF)S<l+;B
zbD{?hWGZuPRG?$%0d~__g?*Yu^^bPjO(!(KoCUu1v^MkXjBe#y1}XQ~mS?tvvhU^J
zH`p@G>^~J8v5VCb0k#kat?Z61s#I{VcPg{G_^vT;eUs$yCGJ+p?>c`ir+gvTYny7^
zbgN9{q|+~BO2t3HKUE)kU-c*JwNY{4@B?16e*5E-Pqxwi@)MPL1qk`1!Y~$*k||AK
z%CLqjTPJ@HuptQ{<o>!;KZQhDA>IB!q2kw4=On7`EgSF!S`G1dS4!6kQ5nn@7w5I3
z@92(g_`2yZxf`G|&QB*yf}24tWv;cVkZUvUIkaXE*I7_>$BGLaL%|Eq_v2Qxgz#Ab
z=Gus0FHT%Z0CI_-5bN`zu3~pYk#&FW3TcpI2M?PPxlfzSx@X<vbx!+J!>cvWV8B$8
z^t*U*+2g|cY`(X*>ayT8qGvj{!gQ1?`N>S^x;6i{T?&@t?eAQbDdF!;)YWIBaiG9h
zKf{~mkSe+Rm2M;R8ZjC{gq!2GMhayGUXy4;G6*c-Z-tc7{qr_?IH+l2jKAYD;{w$)
zFAE7$*RU$PY+G<qD8$Q18!S#&iY)V1w(c`?)D{()${+Et`hh<KW<)QK#}@5y{it~Q
zL=mKEeV>g&7VDLObG?)AEjAh5uXt1L-p}XoORV9e!Zcv5osW>mzvH_zGJp*cFe3bN
z9udbyX>xE*o(UBrg5G{5-}hDW(~<98(&#cHr9reAKvLJZbiG7-+x_}Gt6#dq_@hWB
z?o(r_!~9UkcOu*bw&<q06)(B);M}WuC6~8n4<tfe7b-w)62fP3D+!Aq61p$*0ks|O
zkDFvTz%e7}@W0*UQ~HOZqKo_>zjH+ugS9JDiN=R-0~p9{@S|8%sK68|r7hlPLLQxF
zw{b)zXkt;b*-3fFr?lTk4ReW5diu{)Q&k@&W5~mcgiuoDW7hQ&^UJY5e?|qsm)E=#
zk=_FUh3e)?Ihzpyr%y9*%QGh>X8I{VWcUCFwi8i`X(Su``8+A1IFV5m0%B#hhX>=0
zq63E}3<ufRF%x6gM=S#B!8<Io)yD%r#mw8^v9UOeoJs%#L;;ofe@sY>YSGhC#YrZP
z$D2WT-cCkNO<2$koEER717a_fLrG&^GQS_j=RxEa#K=JCKLcB0N$;L(rm%5K=uAF!
z!bs|0^c{@8fn~9RJ;aa<Q{LV)8!Jd3oT&p{6c%l-r$ok29ja0Rs$T=}lLj(|)Bp|Q
zV?6Hz-S~b$cZQY<Cd<QK)|YuL;6QWO7<RnVtesn*klw^)C+J?-tPv*lG1K^_P48uu
z5je)cKflgiRi>7%v~sW_Dk_akwa<jwtr{3Ai9)rLSukairt07DjXD?$XOaOKg(_H_
z8x;sdroxUM!^Qy)@JHg$WTUD<-y;9CzzYt>0)8MyprQ(n3zyu7UcIABtHxxe2=j>b
zfBrHs4htwPp63L;+;Qyd69jG_q4fW{_5WNzN%Oz|721%S>G@dt;0e2vwKkn((~k8w
z_J;Fj9SsfFkzZ>zYU-@)?80dv6)b2&_~A4vv<vn%EG;b+6=N2yUjzDp$bAb>=N%pP
zo86-sd~gO)C8aHnyF+W}$?W>=&<~+l4wyKa5-=E?pT9%%DEV&~cIu89VW2|hVVD%J
zaI80RURyuu_eRoGp+eb)J%}$g2nYzVU#_H;f{L<z9|=0{dn@%Iva+(U0RaEWJSleF
zrVE<Kz8FSfXwNg5^LJi7^ll~wzsO=%Ltz6^Bz(3|z^d?s{B&JYQxoL8{RztWg3GZa
z-fsnirw^SGVPU9(mroTH6xxm}At2AA5)dL=3NtNj@Ba16Ld;~KC$yiMS-O-rRZtq@
z`tu&2@Pt2SgVVlZ)%?>&5ayB8r+okv8Eaav4bytjjRrlePB7JC$MPb!hGLwIYBI%B
zEG!bSppn_s?5w(`=3S3i9ssKHjf#qT;tKKAq-b8LF_!Z674knhIeEC=_q*sq@?^W^
z{#I);2*qG4{nq@?=KQ#X#-^sG7-7_cf-l+ilVM83(0ibv#Xij4t@{ZZ{Xqt(7AXq8
zQdM=lKGJ7<*BbRkBpeW`|C=adanP1;<DR+uAZ|j@5fKp)G5p0v8_RYbKEteyE6&pj
zy}iBklg$53H(~X2kCfHb)p#0pb#=1!jbK$tm)+gnwxBppx?l!&_Ic)RW6(8}b<+O&
zcnm#;e;Q)0%GBMr{I8EnH%DbvLQo+2<Ea6M1$eO*434$a(AM_sLFaq!yyoZw%*@YY
zlJJ(_U0z)|W{=N5<zW5J%QJ@Jz>eoCyiTB|@jRe<si6<}H!%m4c%1e|WD@9ZR(Ob`
zefqw7csz7`#fCzS^9u@YgleG!Y}gZe10n;v9MADP?LiR&vt^n}X&-lsoI!K{JcS?k
zhm{o<7ngv5fLCGAE0@>p$<Nr>*vLpY%3uo{o6+&{j_WZ2D1|RS8xK1C-iHM#IJmgb
zULD(i@-^!J&kZwCpeFq{Z%WI`ykZVYZkMd8OifJWL0^dc$M=u5(2D&U+uB~B!?4n5
zrw_Fel(WMbVx|<__IFAyMbA~s*7i)sIf`x=>tB1ImVYEA@Oi%MU$t%Yg_M+7F4mgb
z*w{q;o|&C(gR*NvLPDUh7-o&~@Si{VUu&W``%>4>JN7|d+^6{sa7F(-)v=|%uFih!
zA3M<)UxMX(YpPSb-`gwbFeeBJb8Kv^9m>{M{rVL;_}LzNX<A^jq@<*1A}++vsRB6<
zeQVx~L6gtTj#%8>vdC04-6|4L7o_?9pF{t@E6YFc{Qvr^+czcY4>URUBK-j9OGZLb
Kyb@>-_`d)`XZ+Rx

literal 0
HcmV?d00001

diff --git a/demo/documented/mixed-poisson/mixed-poisson_u.png b/demo/documented/mixed-poisson/mixed-poisson_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..1003afc0addab5e86eb820a20b2e121b0baf2796
GIT binary patch
literal 34205
zcmeEtWmlVB6E0eu;)DRjwMcMxN^rO0?(Po7CAhmoaA<KJ+@ZKzu@-M}DSFa(t@9(!
zTIX8`J3Et^Yp&5dMpYS%g$_iAgM-78la*G7gG11TgM&{(MS#8Yq7yR%2S*7fCoQ4r
zlXuqbo91x(`NzHRcAGcWR^T52@8xju&=A5fJS$EUb4marb~Ff$B%H;ZOlrWy9KMy-
z3JJg^Fv;<;ksxZ-D9eNn&`5$A*Y6W!NhZq@8PSJB)t)lzaxPHWWp{oacs<JZ$I$c7
zYUR_W{&}L3t<J4xi^_J;i7&XC8FLVXxv%P)`GWMnSDYMF+^`qeKzzx6|0w$ZfBwI!
zjhsJU3qwrFkl0^Ly#Iqk%S?Pb&iwhcFwGPIC$80fc4z{aQ51a)+)77Q&fx#N<1dy@
zYjnGR!k;XKvwhc~gp0NR4-1fu0ftwm`$W;qgbVC~3v604)$j}ZAOpFfx96T)YefvK
z{do}V*!3Z+@nPv}2Q)O?eH;PrZ#d<}l32zoqUMf%@cPeL5F0!UQ2Z)Cp7qYj1yRmb
z&rH$=fdrof;l<&Gbl#vNLJd!H3zCEFHj1cN`<oASE02s{@|`t71?@4!5WTUIh(4Vc
zWArkx(S3s=HrD=L;~m-{KgEw5z4s`dAyI;T#hdwsL+*v53?CYvxS5MX5E>q(pWZKk
z*s$#jK@j(y730(HTvSpr@sLz^%h(8J+>e&1HoT$RkH<(C)xk~@z`=Iav-nC=VXdIs
zmYxSO$MDAXzVYOj65hgvpmaF&fM3RqZ@gIhp^a~=nEOnZBP$OvNPf^lyWDLxA+eZD
zJDQS{i@HKNc%+Biiik*8s?}iI$jhI9%U2$jk*8IJcc2Lu$GltdIfwU96JewK&zj<6
z4G*-zYwUBNg1=cfz>(BStsYxSZl#1dTN}+(-0u|mRTY)=<v&kFH>xDRu)kUSQ&0E*
zPX4quKJB;d<2wDEi@|aN{e%&SR&EuRMcWvZAQ&*IKoTe0d#3TvG`wb#HUO2#Ld7XO
z2hBP_zg(6Fb*#pcqJX4|qp&3@%}Yk6I$`yL`oF6k|6PrLFlvO~O<Ad~gIKJ$wOb}`
z<=lP5GPx>R@?rb=>rV`<!FHwpon!EmkQt5*O29|^Ppdba-FBcuDQ{^~v6iZ+@9lzk
ziU2s`*dIO%DgZb?=!r48xe72Hd7bSjTbsTh^%}o56D^iWk@Z|&fB$!I=-)v&u^V86
zG}A-CO_lBX(5EGp7I*OTe3J_K@b2jw9^u2@+p=P@X`UE;c;uyYH1q1TaxRlWYgm`O
zZ_P;m2ziCfpt=Mz$D_O~cGByu3J)tc#C-&I?+13Vhm&<tF_q(~(872m`3}0Y1@@{s
z0;SSGK|pU~z_`8GHj~MQ8Rq`xKeUf3{Yi*s4M`P;HhfX_jE^_x^~#Gi>v5cLbb~Yp
zrA?tJEPXfT(y##>#-bIQ3bO_6EE#@v%{$rVX43s`-0fM{s^l#2yVN`0XgNhQ!};oj
z-NjXFfjBV77A8CCKiS(=qc+*$8*RThrv@k<G|Wj_aeN%_y~|>>tjYZ5K7R7hX8fl%
zbP+U7409MChu1?L?<sB`<&Oq#Y>i6rDSOb*?7!5c6P9QuST$8E3rUoAiF=0rY3BXE
z+gBOm&VG%=9LVC0Sv=96P<UI^s>ye>h)<W4a>k@dlJz_iTA^d@3;*x8?)V#R4L35l
zCAes>mSE#?`6^<)pSRJ)%4q$%0_bP<+1$tQyq}C|co44a`zW^c?@JK3EXCjl+ZX1@
z2$u9X1?A8MzmBE5<AnZgjV95ho8kzzN0{3f1`{+%ND|6JB?(UEX-aUu!0q9n^4ph#
zAlLn5Fs%W%U%fl`5E!H^)TuDj(&*3D1P8i#*uTvleP{YJML_>;>;UPZrtmn;XE@lp
z0)`Fd0~jf&xenugWhGlGlk?E1spMimy4oKXvI;|G96LjmW7H%ZGiuZuv_Ud#38O}p
zhD%8B-LL3?X|Otrh8v=PrDVKNUN4d1c$G&mrif*rzf_`hK2#PM`s+X7=%&qF*1*Wy
z@gnv+Y8=V`e(tZaKU~c;w|$GeO#8=e`YCCU)L(cP-z`gi6(xNdPm7+=K^L`7o^O39
z4^pmguZrNUZL1@CC!W-NF`*Um@I1o_gC9d83?XNSJjP2(R#68(&?JDK8LYtE$S8}4
z59Q=8Y+p14zAJNN%TiVT0f_)m;Snz8C`LZ&P-O<zVeZ?;!#=!;@Kp}yAY~2@`rXJS
zvAgTGNuTDMzfqv+d@pU#iLPWRk2w0KCn0#$XU#g73HFUKFQevwr@46{-DVf<>pj2|
z-F#S=(k0UVKt;e%mj|W#xMEdi)e^^L-U26yB-|7o7d+-7V-&le@#{Kt<I=4m!&Eq)
z18f8E_gSiW)TK{-I$BG>TLP5-q<vfQQl;IR_~Gi-?pIHT%>TQh@LqvC5vq{TScZn^
zx}x>Nld$kf-QU<Apz`jCeH3)Zkx#RJGtEHg5N~o7F^7O)aTUrX6n*nclR1vu!Y!&Q
zu%{`^9jq(JsBVykfF(}(r;B(a*;@Y}Oc=rhBnPvuEsfW}8=2&$^~u>5C~BR@_X52Y
z)0So^+4Dh6*E-(<O$E~(ohWisvXjJsX6#}((WzZ79^YsF8u;78qyRk4jDWmk6;RMB
zZIviX4yxi3>O2+>6{*l9<&rFvQBsgvT*GU}C5JYiWtH&}aFq3rtHv=7wEb4T6q8xN
zh23G0k?$X6CEj&n4z5Q1vt?f%0n38L7(E-1riA4e=<~rC8LneVX&QC7WrH)W<N<}w
ziDg9;KPo_~6duP;5&tV9;-)6{%BY`5Kz8O7sGvgEW)VdHd~dvFf8*^-5?B?G-8`~V
zoh|oYb9Yyz`hhmbjDE1Bjm&si7PFj+R~Ffat&~&qfFB>9CVODM%{>Tn9>v`<MHw_?
zg>q==!BW@~Hu}z2WNEa}&J&E?s~a^*vZOBhF%P1!67>8VWl;J^nN$sTtknEK(Kyhn
zX!Il+JgUuU4p6~#506y)`^^3)wVjaFq1%MXhl&7)wz&G>y}#m*A*K;i4qq9?vD}a0
zsMu8Z)0yW1lZYWGBCE-Uo>5zPU<RLKV_p~ss=)ob=2+WvSo#O0>?gatB(GZ&mWX2d
zw>AbL)XvX#Ngb619AMp)h?Ybn^HLFH)d+FxM`B<ufGgsxPu#Cj!|O=rA05S*Cd`6>
z{GUY_We->c2GrTnt=>ih(#VWR;#(VB_c%1d6s4p~4~BDQA7~^$v>6IAnk_*TmT_)8
z$e(yJz|Rn!EExPp<6x+f{qN_mm#z0B?Tib`zG=Vk^t`YH#bYsQy^^M4=#8UoSES2s
z)@ewF7Ws=+p<kIumK<K2tIwJfap;t?T5#(3&FYrHrhr5W*e^@gt^G`Vae(bNTxMyM
z{Cj7*$y-Am4lxOPBz67@q|@^AEvZL}q^A3RG@U)K9PN0np+k3n!KkPG?4un(<^6YD
zpiGHAzVf6vi6wKCE88I|{CIkShENt~bcdKIabgKasO(bl@4-37YJ_rK0##M51(lhW
z(rWjY8U%xCE4Q54+an!=&oKV`Kmp@FL^#nu3s3DaqIJ2^RsEa%$?oBhNmOgC{B_zp
zD+c)SLoH)|q2|ZogAMu>#=M}KKru<x(2}Og(3_)`Bb|qzGkh?MCC0;41Q#-_HvO~X
z>^l(6qsfcFWo(-L5TR59;?*!U`Ad_6v_{80Vu;omI!w$-kKt|y(m5^5$@eJX5+Dfq
zFlH<1bw;FH+hp*Ma7O<{SU8g=s|ATd-apGDF~S_&UP@)5#7UP@a!zjVr5CxBC$&~z
zo!1nSd%sG9ug67SKB8E@%G!MlU#X2aS~**3d+8(@;ex}62fh>C>pdn0dsgI>v^I}6
zT6a25T3mUYt^bBY2c)PrRVCOa8epgHmAIPmGMLU2u$2F#Sy@qJ*%4NpfJTHf2=$ff
zn>7toKBxb(G&Y2VsDC`BOQvQBWTaV*iL*lw%BYVyL)90`lJjSru##w%YUVIj)n%bf
zErfVqI}KE^v&g7=lbgmT`1Nsh4hBsPPn48KUIJj@1Cu2IRp(ony1cm?i8ZISBYs4M
zXfH^sbfitqja~Zbp@1_xn^+SPo0Pcbjs4r(spl|(D70V;?<FVr^?%`Z4g|I#6AV5n
zeY}5FF(hNu*wWwZLK@kzUL(y)FnC9!(UpE)t{mfKm!rYRz{5F?OZ|(ehGsE`7~&W=
z4rE4JUzI*dcsIipQ4p8TrcLb4fwg}ejaKY>#FEg?Z${o!SF2Sj`wq9mC=H2csaq9y
z!aIgzikA(Tc`EOfjh*&abN;zSg9=GHyQK6N?^I5VOk?_BjQw{lF6lI>_q`_0up}`t
zHbN#|%Gwp_u{P9%oH~_|k$75ljP{cfc0>3_4Usr%Sy4$r5@$~&2-Q1Dg(XbzFBZX^
z9_#MOqP$^c1qcBfd&Na~)M=CME`IOq&@9L)MnH1E$hYDB$@b|dHth*+*Ev1tfH1Bm
zs@(+kNW0A}9>x?YZ5dirr>1>QjY|%5u7SPAE5+a7xO7DsRZv^xUtG0VNiB`muXAT9
zOl1t+oyh+7jIda2E@?x?y_FNkqo87p89t)a`P&d4$|DpVz?VWh%cH03htu!uzqaQ7
zA;g9^8s7Nok+9Od9pe$I2mPB&9aPP7NHtm9na6Y!QhDBDd}aQ2bz=P1xAw_Mf6%AX
z<lo(KJdZSHdi1H0W88-LW6Wd!DfC!9l>J>7uGEiN37kHDxxeaozh^EQ`w3zHcjD{s
zZ)!LQ)4UH;e5WffaXfa#Qx<&1j9L}UtL@@-ZdqEO!k>!8^N8eI1M*gw`x&t0IcoBo
zSW)kN#I)y>cy_hN8YRLQR&Z4)x1HfLQOQYPb%f^L)9d<L*!^Cq*d{r}u21}@!Z_t?
z@jp2H=*lw}7oN4+J}<^%{%iO3N!AnGVj`K}zbjFFx*IFzc7tZw6rZnsejfo#9;)@O
z`uJ4~?)&3VjE?>U7o28Zh;(B2D75_;^nb*z4|6{e=?=Sg!TvEQ!2e!_A4QOEmn=Wb
z{UO3xNJw;GJVy;VF%gLN-M4==rgv@cQAyYhG0|XjknaK|7;60dsO8wbQi0!_JXjsg
zA<nES*Cs)UFwQ`A<Ptf>)XL}S9=i~A``C5Kwe9V<rn3e5!w)0GD1~0Lb&0I0!W!}$
zU-$;eJ^}*AmmD~3X1F6V%}WjAV6PdT&A@mDdoqgM2h>q}w#Rj*{zW5Hyg}5%U7;Hc
zmQ3BcMx)EO2mM@Q|J2ufK5jQ%>T*G?e)`W)4dc};N#=Am>>RbWBIETgqrp{J8nG|l
z@rJzBLhLaUB-SP<vE9$QBhvXHzx1?}Cj4}V{Aiby=7@}JmmKhZK;U_=Enmb(EFsY+
zAe=Vb{sTpSOWbj?f)wEf6?rcF25bHHA}OEiK7IZ6(A&NC%jWrKDlcv#0gI*H7&7I+
z-7{30NUkjzW1nii?J&~wxx%*~u82quSjy{K^w4su?SfInnmYFrVV~N-POm$ylRn8k
zlI^__qU>|-Ilun}{EtAw&&VA{rrpxpgSZ|p3)qhweSeSVnv9F|i}a!A50MS)0atu1
zgqLq_C}M{Rpqya??TIrC9)c#?MO?P@#LfsmeN`KP5Da1{^4>#1<QpiTtwz(J406>n
z0#$U}0%Sn3_@VpY-D8yAtoNHUDCeV>xXTK)83qlFdS*@Hhu_exSUs?5M_j?EB6;AI
zLI2R|zQk_7YqW;X)guO`cJ4?F6*x+z!^**?!aD8M5%ra)?B}thBl)me$hFAhqgTx$
z)~eU}rzL#kmWp>Vi-rxVhw76<D!~h%)%%}ZJRnPWlXN;CVMb(W)Ged5J4G#Jx{*E)
zIhN3=+!%VndpkMhqj*|UKo(yj(90i@g)dr8Zgta@Rzp)wCGv6+d9CSnyHR+XoSN)B
zi*!YS)wX2R_ua<9_ZXc{Sk0^<9g6Qdj7#bZ5}A+0izSzK4||T!UY{QNUfS=SY7-mv
zrnDN*KeH5-W(=rl$%Y^bPPeF{sgW@uX==d-9q980A2_q|cwVWPm05z0X~jDm0^TJQ
z4d5zog$9{g!ov({6%UM(ZS&fS?NL!?XEO{{uLv_dQDasmpnk4$=I?q767><QHyoZ*
zBap0L)@5swMd|wRf?$|fA9em2d*#>Q!o2~@=^Xnkd!w#dV0bFNkwCx5Jxt0#E+-BL
z4opEOPXGuLAZ0g0;hx&_)3@x_H{(hTrQHVWSg^Bz;x95d^M&06;Ei*D8ZT8QWY!wi
z!Kq;%iUU3M+Rq}P7eYml7e4Ix@69OBp#Kr|l%`%=x4zLpntf~-A<ptDwCj|fyYE+B
zFOX7kS(T*H)?Ua!zqsV#@44_3dyhpq%PY4Ed%oxApI%Z`O7}Qgb4UDWl`a<;?Z~D8
z8CaZe|MpPKe)T(RDrqpV;TgQ!)cbJh`up!o3-R3+Gls%98w5&wp4f~cMngMRkI?Pc
z{%<IM2ItgnLJcTPKhu;Lu*|aWbg_hM2xvyoa9dE(8ib70QcYN)u|B2m86pQC`_G6z
z$7y@aLL(A5Dx<xC$_w_}(bRO>o1kIYwYhsDavn(REiN!~CNUspdx0t{21g$M{wXE+
zDoy&b=e@3hzl8U1U$#-!T|tizJ?6DPAgp0GF3NHbCDz!zw~ybf#YnyLcP0p7Iv+=?
zCo^w~_DY)k5Qj_@_=*jSp0s4Rdq=+mhGI%D0WuCK4!o-luB~(5u%>z2Npdlqk8VkQ
zHl!Y@8Wi=$sKb%0x?klGPJLQ^=0+q&xiCo~)~lO~FuKzT+8ObEJ|!7h_~0HsVtEz$
zHaA)y63vPHltR?G*reL^7Y=UwMg6T@MFOL%<#hQNJYC`U^;ppb9hVc^8h3VA?0N9p
zp~!nMm|yTfu;Sec55}tJg~*;}>%9H;59;Mw6DO4YR(j^V5)DYK@@mby;je6zi(Tix
zNZ)qXf?s3PPsJ-;ESTDC&C8nbdxvDpnX+A@=hRmEZ~v(;9Ok9A|LsoxC*wQWKQ8E#
zvmo{xsxd{qeJLP{`nvpHghb#5TyM<5u2KE2nHN{)S5lej<<FJZ{^RSynf=u2&`H9_
z4?W<OZ>O`CgdRa))a-B^ga_fVc#hAqST4Z#p0RAdcPtr>v~*&N0EnYSD}Q!Ld(Y3L
zjGEj6?b>VtOoIyh7GK2{B$xgpn1jduCsL?ZJTP;Rv}cpSoZ#B1$z*644;*saFVdz4
z7w!C4@l87TPs{yh5BtuZjB$dOnhv?LXfxGl5bE|rcjb&9Z=#Be$B+#Y@gzU$J42Q2
z($n2ek4Bn6fe^PeUbIZn6XEO3G?C7xc7mRU?SPH}xA>*lQ5~1xPOp30VjBgfn<wqV
z{3c}F5WuM1Y)h4EomPWh1J&B4l(Day(5ofZzHJmNfRy+SZePSM3K!V%#L+-NU4v%m
z8?!b&@dbZK#Rd~Y8(xw}?XkLOygsJ*1_rp5<S9DfM${<XI6oKUvira%HtalvgGY7i
zah}LJMQcn}phXOUr^pM-#_i7tblrDZJd3LPC6`45-e&|7o&+8fl${2qm;eNo`jbG!
zHojeA7xEoa`?3G73Isk!>xotm6I8%eDP?m&!eOFG`VQ*&O+`AJp?uz)AEL|{)z^^a
zL&KckU1InBZ+W)Cu($pRNdf<*%v)7AgG8>+efwk8&LiLj?*-un&v3@635;xb<@HzK
z$s_acQp@k_XgYxp^#OW75%lf;`!gaY_%-%M1JjlfyQ!}Fy(zKIwLCNbil$*u=O7Nw
zh{s2G2};vF)KcmZI41Jr%e_qF4#&5}$jfF}<FB3n$3-<gnciMuJ#&d$HGWyAkD}<J
z40!VQiZC{-a8ToULf+{b%d>*5q%@lJACWQUhbOTBzktwvd@}ONWR5txF61uc$13z?
zertjOUw)4ub*cVO$XznHU1@<34)yJC##XGt2Zk#b8_xW3LUbdn>JX1O98dxPaRd%6
z2|$m9PX+NJ!}hp=)t7@Xc|fm!b^bE?(7ovlsTgX3>C!bv4Sr?0=^dMN<nv4NC;2Q@
zibfK7jn?aP5$?Hsz$N6a10tY3#J}Ahj1%VN?Hpyr(LK^VT4wZpHk##{&`lQX?4V|@
zd|Z(ax(gNfob^YW^=u*I?=X4|&oaY*UVOp(h53#uO(HcFE@UYWboPvCpj;j)R-sVx
z<2tWJkRob4#xA%=&>z-jTf#mtI<I!&&=vIllIoW&qK6vQdr3^8gwa*H$dCI(*L<eK
zJn6hK90Y$aGPeIwm%_bCve%;5B0GmjD~X9oR)@PGxs%$*;X~nCzZ=i2G&qi_Eb6qH
z=nms9p6JIlTpOQ<zf{yWU7j%4I1rQ@UcIV?3qrN+fWF`#_x?Gwi|r`05A;V9CQ=;b
zL;=BzeXXh27yK^{li&@rIYR*$nOr{1tMrr;dD(Z?J3UO2hijHIPKuUN&W5zT4B6g<
zPI_ue{7nB+g(8*_NVFx{8aDpGtI`$!c=G(0&x(&I$7_xJkv3cn!~8rrfIg0Hc~rM>
zM<vLztGjBj3cD%6qmQ2w!l;+U839kNSDDxfKhI#`V-J|&hDo$B{r-)-Azt$6KlMmD
zOI_rKA?3;(KE8;axq*YbI5FE9<NJLS;#Wp&l8=s0ENc>4(V%q+ET73YUq3hEgaq7f
z6SDFx)}1bo_Jlfrg&B(+g1rAMP_ix1H6Ge}5TU=g9Dty&M0YNqF}mow2p?gx2@Cdb
z1o?J}EbVHJVo6RA+szFS0I`z#a+n~tb9nB&kimb!u>1L&jyK0|29Cer>fAh?#4&O(
zzkh&T<tmbF4f=uA9sA=@2ay*;kI+ONauM&=jb*bfcI-)d4ZmQ&+0<|>3`<%$Kz!%5
zr4!Xdv>CHAbx#$)*2{p`l!b*mjV1>pSq<qNA?$CDULu{yk91FjL?3IFecZ5||E?*`
z4>;E4qtOgNnZ$F#x_M;KWAPF^0_G+gj3&+_O*g4v>0etig`W~^ULsl+6G{!n^_I6f
zxN00Fcm!g9+R#p>2>!*O*gQ)y=gA}y?Zslv9g*^hddE=AAEvU5ns#!u7q^nodNm0@
zZT6!L2F0XbT4OiAFuaX)xKt?13A;W|B-KZq?g~D#+3%)I@@S9#=f^&(u~l$#SCOEP
zr62Cd8F6f556(S;GM5k;O`k`ZZj$^@rkID{AL=BV(fP2FelTmS{#>QckNACgmDr%S
zN-p5`wV6={Oot7eGP-blyE;g((XDOQ9R_CeQp>M2DSmM+aAfglL$CNRR^KSfw)?wN
z%#;B}7dQRl{ZYo{&IxLbx#(4esqir9G6E<QUX-HGM7yY7)VW_!wExt5wodnw02uiN
zs~tDlUXNG2QhQ(P560=2U2-@#v65P?E{Qt%8z>zUGXwKbTyAPDz0*!V!4D;WwB>Kf
zC^|ZSxw!4BH|;oZi|;_cgSboQtDp@mV`zihRnBX0^ZrUIF9lZLa8Y@<iphAD_b6<=
zY^Btg*EU?JyuNq|5BtRG^5eInB3dZ^D%ERIU7+^=`T5<CM@C54h)gX>TSV}cr(wZ^
zR)!4sp&~iPF`4bNZgxurod*fUcM3eoJ=U*D?c*R`=A(tL(H@MVPv!yMUvDP=3sEi3
zQBK+~aRsdf&bXc8vn=cWRE}Z%!o&#F2MTuDehat_t*fF-I;@eqCR;FA@F-DlZVYJO
zOy7hs-nx(*suJ%Y1U9_jnfLL#dDb#`Und6nUhja}y8G&mkdzm1!{gisTM~5g>$|8;
z=hXI-U=xGs!r<py!x)}3wSJ%JM^!_<CLPv2CrRE%;$esu&2Cl;!7R&%&#1?9<O0aw
zKr5UiI@IBz;Go?Dk@qG|2X4bZk^LVE=5Q;<**_tB3kq^$1kd%R{oS}P`AW$lWTmxI
zyEA(hvX60D1gC~dsC@LPyALC9R@8*73D5z&IeBrqj%Gtr-ZkIR*%eg6%BejEnQ^yg
znfnFyW^P>zy*&vzubhXQZuY~#cBqmbF7tf%(aaocQuZX<VG*2lqoQZ8OOtf$ujW1u
z8IbFIYVt08)z6bohv3ftOr&M27~Kdyc|@Gqb%Xim7N?S1j6S77;X$xq;mR)WZ%Bt_
zlHSn!IwnPS$NPxr=KlF{2PalzamN-=u4H>sK=Ju8;-lJV$geTeS?{<0ki&a&sA@xz
zctllcZ%d_ba$qcBsz+<qIKL{4)Z7n(pGJTLj^kfu(@GS&81`u~5&!Qlz&!LD*}5jG
zy-jnDByR<%#^h@l+YBme*g}pXm2h4K+<ufn@9XL0$Kz3EX%hcqEx6$&{|?~+GjbF=
z8tlb-T($SS-Pa4rd@MgaN`e)!G3h$>X&cWrvktH|q`5~wElH%yGDDeu=C;hDJeEaV
zV0e{!eXM==!FX6G*uDL+#AvB%fVBwWP9Dr3zanO&|1*UIt{Rr9VH1DM;F!+lHDkK9
z0iNZ2;Y`uPT&RrDzR=4TS0<W1QJM_^QVO8(e#~>lzPb3o?st?-+a^C0-y%sUd^O3Z
zJzAyC?F0|uVd}9Z^6*q&Z?<n_y|6V33PK}L7pH;^)tr!R>+)?Q(V86zZ_3QwI(?-g
zPLG5}dJ>$*gT|dAme3kDC#MDl3yys%OlwSM8$V?=t3%&KmnFM#$YNYY6#AcAzC8j)
z=u8r3`BjYGrVMXGmrNQrzb}O6Y-|wvexH11yrTD4Dwc%C=QVCR`ZMPtlK<!2`aX7E
z0trdE-mK%mY^vEw)Elb;s3um2n}7R8c)da}#;7r$I)wqRTW1<rTGYiF$-@ntp(9R~
zQJcc=Hq@!H3J`A-@7?1+IYDnbM<q2wtCVjjg5vk#D<4nDn8hb(7&4P{YS@s`(}$1v
zmTZd5yjOY~$@s4*gR)X4-{u!6ek8$5wb?cN5|?15e3&1dG0VnO4cqU(Hww`!p>t1S
z!jhss-2Gf9gN~75W^6|}^Y3=?Q0pxkT*P7}PsNrnlb8rR@efo#WTe#ylI!{{Tf?+)
zPs2NELpdx2YbY(j#CA&%iaFM~L<2}?&wzKYC(=^{`pzcj3WWDDpDQAkUc<*fSPXMN
zVMwxcq~r3X;WStGs34(p4O}yro7eb3DNFO9X?dJ@q-iT90^CQ&;;3lqFnsNEzU|-6
zlGFY=aynT$&tIrH%i}At;;<HPJCKc@LB;8q$E)BLvo@{bF+*3<ntEuUA*uo7%9*Qh
z5Cj^YUFr@2m>vl;NBMhlbE7Q%rAE21IAl7P0OU(aiR}Td;neaRKMu?9jqlErO%1qV
z)vmi#DPinkmVV!z(+#zWJ&L#TIxw|0G_56|SwxQdXRK?PdK^(})b)6wnri@|Ye)F`
zF7Y_(qXA9MRVWkNM7|5-oQ<&eZ^{KrCN2Z|-zh@pcve9=hI*N(@CIK;zO6_W3SpEI
zC0vwxDcm6HFaUlqZGiV?JU>9LwT`v+?U|<a;g*hiVMA?{Xjs-A@X+HNh~U*ISf>9d
zsd#3>5z+O2c@a37!yuP3?k36=G4r$)#bfdue>zDsV%W76YWYpN8uxb!aoJ$m`@|}6
z>GE*%YvL^4e-<J!?=$pS59@Fp&>gKJxLkd_vzJA3`SGJdy4ZA**k&7M8#)Awg{e2d
z7QzdciWaIQu}q7aO!$ZO@j2GhyWOIvUnXB2IUyLsupX1B&2eFF3tH<>D$ZfNVu8ZN
zu`^+HneS<+WvzceBocOtMB3!#2qnzujj>VpKFjCASM}yA4QBhofhdJ-a22yQx52fc
zX_}3qBI6AZxU@_6QYJ;6itZ_QM2ox5d4FUgLdETEiT!~5b%XvhWFBkuUCBJ@>Yk|g
z7c{VPLY)|FupJS#UG6f!z_iFNfh<@NK$U{4iL9CKq&{r{i24GnKCz#}oX_V_O<}-f
zz@0N>-P9VQ29(QaYU~%C6(G*r?3SewFvFo9UhTR*M|<4=bxK~I%2X@4$&)i7&)b3)
zQAUU(7o~LYwmMd^Pw*uV(ywk5*wDl(?P4lqcE?t<qQ95T=bcv0??djyHf%5rr<kjo
zP1MadA-lN|k<2WJ)xZ-F%z6EyncnnUdI3{?ke`x;+b$2W4fD%%=Pxgs67hDevSw~#
z1PLl}RivNhh3N0%3scdp%UpF*BGa^tk3{|hw~4QCw8{PCR6B67N$x8nNp-PF=#nvy
zoE?!REcq+PTUcw!-=~P|ZqwWnmJ;mottHDfkt0WNb@3p}yyMKR=bLq}WZT|V7P*Iy
z^oRxtUsIhb9W<fCh<;R-t_<$jU2MO9@-?3m5(gXhU26V)+Md(FXxc~Jkkuz439}1<
zR^uD5`jrZYmupY_?BW{F-ky4IM>A4Fpk=B=B$$}nOOha3>rTfe?<UAD#K)yb3knie
zKFP?&SiDjD6jb#MSfVd5VDKcU)=vOGohoboF#@(bP%$05ZmB|CXR1Q61NNkON>8B4
z)EB<uH3jn{FS1I67!_N-GSiNj1d<KeRm}2J!a`W3ygsGi+tb>?_+7Y^xwSW0XGPsB
z6A*2)L*GKhTgg;7^TjPIpqSY`I4~x99&sF1SwU(`v#<n-lMcQdE6R?hD91P$JHGYo
z-6sZf+53lqW(fpkt)gRL;_2uS(=yw4RbY9d1U2lr1`prwE`0U9A1Q?lLp7CrXCDFx
z@!mv)y$ipY3Wqh#LNC)E{`9V>JpQc+p1LOvt#DziOl%a!bIane=_bwT8h%b6RaoQ>
z7F`ItOp@cV&6C$)mVG<Q96dtND4t|toDjsWKnJNOmJ*S!>&?>}3CdY4vlp&z`f+xL
zq#|;NPvDU+0rnkbdYVoIN%)9IsOMpI0uk8YgDK2@xp=(H`sosMP>AcY9uu`v`lp$o
zad)<-%t;U%Dy##fAsO=1pW2~T+8l+46wGSm;+(B`70oQj6RIHub^PP#3~By(7|Vkx
zXChrHUuE-0?*5^!5FmC$XULRPl|pi=5q_yp1&1Vc6++NAEV0Z)T|I95TQgTNaQ8oK
z-kIzgIcaLFyj;yG@hw`x>XHr@dM5V?;K-akd0<0OIK^56&O1YFvhAvUPx#}~M&@I}
z0gGSec{w4y<h?ABu2Hc5sW4rc2U;`YQZ@FGGy;5D^<@6lTr;goDw)+`S!fl}^o=v0
zF?0^d>6Z%>!t#yNAi&nr;z!voJ~bzo_Zw*mq79Z}K;@y6mBoZ0P}RAYAd;_1gL9Eg
zOGBBwbt@~0e3wf?*ZJpsk&k<hpbMNLm2yM_F`eSugUFsVorF*DlONk(d5amy2wgZx
zWR+C(%*_K+@3<j|eXwwpdUzgmSTb~Dx9I9tptprEA-7aFJEGw3^DR=w9nD5{8Rw|h
zt2w4r9v|$u)D)kb0AI>Iqfs1weL)`dI|?P;fjTacAX*hkf)bt@l`2qDb!c>w<L`j&
z6{nc>yK+XUpjIC4b)&YeBgT{8EQ07L2kndjtaP4o*ybT=K@z>vZ3lbNHTGon3jA1K
zmwar-z~75T;>rUqGzz`fdd(tTabc6e0%5$js8l}^6FdT#b=6tc^AO`HB=<4&uQP>9
zmf>uPs!J5-^TOe<aO8f66|+J~wD#{}0F+p8ur4KRXRDgA95uJ>a&sJ^b2Ey{Hd?Pq
zWgXktU5P(UiI48|#__D)&_S{IY>GhJShut^X9GQz{bphn1#defeAPxptVG`q(9SOd
z;NH~iv~k`oqT{MY--<3(;GF|u!{JNr%UyMz8#Ei@mn(i%A1oGv1!uP9BAZh59Et{N
z3AJdu8uj5CLMlwE`b{Z-nqq;x#yDOI5w%@$*=^9<pF(Vk%gjdrLB5aBxDsAd!Kmea
z28MK%?TLczokEiauU4sm4A7VzBp}z2pt@8Y9gq881Q9|)Qx3OI(t)CBG&?gLhG9cc
z8H|IQDF6w#H->@*@`p!9NE6u6q$hGvyYFFMu&hV|Hggk}^PmoDA!ii}UB`8`7lP_}
zHbooPrP<c1W9iAa+DkC#0f1_00p1p<z+WI{vNZS{!O;kl$7v36prq|P3;QVUj6`lc
z-3T0)GI>^ht#M>1hsW9-LB;t<HW6<_^LXOH&TnBEy`Qtcv?Zy8Dc7ygsa*d64I0>H
zZ%+^d#oLyHJWSK327v(q_3|OgyQt7mH{MQ9m6MmktLL`2II(u6UP+k0{7+J(IaK8u
zbNcj>CJSj;i$?!fZj7-#zU6s8OZYndZ*|TFn_^X&^rTbEd1Khxpw<!`9yLy%=R<n1
zaKMo@SR<=4Vc4fuh6`OwD+0VOv<sKQT(zT#CT}++n_kWs!Jx!}UBR#*m2;I1q}-~a
z{KNuvm3y=M4beg0=})?jAUCY6uf({Zc}Cche@Zs3*;hgy9<^S!Wj3Y$%B1;(VM>N@
zXYV9T(zDw|WN8wcQN<iF4$0D#_)LK7yZ>yFpg8e-{2h0q9z8N2oc0;HMc$;!5p9Wc
zq+tn;F>mIBS_)B$3whAx?Z(?92GL(z&R;a2w2B9KgOA}3Qy&>6B2pJ^5<76dDiO5m
z=~Cp;p<2Vwj}TC=_5YM_X%-W7v`VsD-y>~lti*s;fG9DK5-Ce3WRAl<G%YIyCX}|2
zz$kk?Dt_nQ&kyI@%f<|Y?FO(=!Vs3$WO{l2w21qMN04&k%%mz#%@MJzBa@BUOg~nj
z%MpXee9KB4;GG~bipyCs3zfyQz|vI1>p?`&oKKP5Hf{O|vRVI{mcw_#H4~|be1lG$
z$Tn#TiILatcR>35)z7AWMiIMGgs{a+^BT>K&lD@3*DI+d7XkaC!(_$YfQb;X>}>HK
zlctkLG6b?}l-c-2g{DJe2_or<-+n|wkiV2cI^*(B(C;fj_v#EvH{uzc58^z*j)^<U
z(jIv49SAsD@qSQ~RhvG_F7~>L19&h2;Bcy{9sUzVg2Akw>eC$|J5@MCl*16*X+(tW
z-OON@hv=CT%QBX^%)`xSoGcz$j^sgICVVZ>L{wR)BK0KU0_{u||KeR4E%pY;_G7G2
zTa&Jg;kWAXCJ0qIqDU!^147veB3+Tb<X(iJhU=bq#5|Z(5$-FR)2DFyZd<^N^gnqO
zr?C;naOW1&^ZnkX<j<EyuewILvqMwGUX<Q%7ckmzL{QlPIOvl<x<#`@0YAC=$NrWX
z%sP>!ql5qv@>YfsUP9qIKg4|i><WoD>0X_^8-Q*_gTCt9^_sm8(W9>?L{oIj5+p7f
zi^D7j_6ufrG10N=R6tDxoEO4V&7G}_5yPv7MTr`T>~%{@i~oGJ2CvkR9%o+Abi(6l
zwl>)js-jfNBQW#5yCV<r7rl%)f6nanPwq93bWMiU@G5}uz04L6X}<$juGk;f^e@V<
zn=_Ax6|p`TH2j`l>NXT!+2i&?T>I`6+pJe%?I+AZl2%gkX-eugzfY4b`V{Uh^R5;v
z{hklK!4A)TDo2l06I6pxQwzQlW4pxWMcyBe!jy}L;G@(Z{Y`*=3!D~avkrR3WA#rY
zg4ciwmu027j6~kKxt|z;)5IfHn<54w#x|&DZYLh?#hlPMu}%B507i?C27)<E+y!(0
z1co&HEufp#jN(;#$K{@?VXTy(<k?HSSrhv7r$XA~CRm81pV5C%rp+3_3z%*c8T3LV
z`JjXh@1VQ@KKGxEr+G|xLC7V|Iq_2;QrD2xm_rM|AG!HlVupc8sGLgH$}ukze}9`h
zI#<%>(*WX%SlCc!FU`wH6wLnwHZSeQI1%iG+pd9lU_7KxjJeWq4!uJkVE9PkglV|K
zq=Xu8%?YDh{L->V^>HX~2~_h)5u?&5X+e7DCNYSOBtP2Ny)9!9DZG!v#@Aw%;Mam_
z*l#9fie*zcIP%*$t;S#E@5jdtm9^J>pO@Jq@Be~&d+>}s&z?1qKWV1rLs7dNkOJ8v
zEE6)-ue~bqXdLy=Cbve2O4a&PMDt*+48yy1J5%(eRzhw$>@T_!>s}f+6E;}j-x+B;
z76iBx+H~<`iGdN)I3(d7E26J~+b;{wqM622ust5w24(?V!(#zmh*!seG=V(}0SwdG
zhh0l*j|f@^-^`_PY0(O}U)co*TxF-7S4}oeR(EbXo$62dQ?P-ghlQvs6hv_MB1c`=
zZ!<Fxiig7hK$CDJ5;Hyh5{C2~>#U`*?(d?|36H(|p-=Zu19r&@GvnOcf^tM|1uSI;
z)3H_n?}8qghVoqMax}!i_h=`?Y2s+JMR;!gwF+-3yCXZ@ZMOC!TmV?WMWamRQE(^R
zybOiBy0jU){6Vc`>TAA})u(|DV~l+0#{prI@d`R6IX87w<(_tSRP7Vh$8Fqxpkeg;
z_~TNw{Yli@jd-U1FuFcX`JG*JBoN$E#V9oOa@!G5A>t~^{`86FOZjFi@4CA)r)MJ1
zW-be4e;MlgPTw`0LveyLMd)6W(LC5R<h`=YoVbVvIU&x&!%$ux_N!0%vXrT?JFJIS
z0H;2rlH0_29FRermz67X*PK3B68$tO&6DmIsaua%%|zA;;1hHJIeDy_@h^NMUHvip
z4XlZ<s`jN)_x`Qkd(3cU^ZeD$=ls3f-zs&@Ojk|M&xUEOfa=g56rpxb5BkiRGK*64
zrjX+lE$=M4Ml2@2llDVKv;mKJ_tHRLZCKYj^Zt>ak^!A+tqQ|K!cc`m6CuzAZwSq@
z1}F~gBtXslHYX5#JJbE<A9UANI6=n)5yFQl_wwr3b~l3jd4SiKY&&Bs-+o^M56-+#
zgw#wpogbrkh=4c<boQp2{jPDYHG@RCq@5kvnySbU1xqQ1@nBA`#*2%tUlTmRFNSK>
zB|H!TNk+FobP_Gl`jCOr!~<Qu12p;^s19jX8@j2>brt4O%z3`AN2<UW+f&^bAgPPh
zB{zkn9RO@m-oe&74MI+L!zN^Vi{9C&l51%$jKM|Z#T&4~CObYA|I%usuVp`vpxSD+
zdn+T7x&N)u;&ig}Fe1dq>NbOpw`s|Mk+q?u5Pfpq)y>)8SPo7ncae4hv5GXN1tsV*
zAAG%a3w`{cdjJbP+4pK%{nYw{cr3R$ooM=CKzi(0JaH<(wl(t7FN1pHF69p|0kzPl
z69)j(SPHvzw$1+a4~QH@b1j*QaQXp`kU_$rsG9l@k2ZXMp3~+f`n2&&7IF9CVbFe+
zvDRRFDa^Y*us5aQtfBr%8!r=^9lPaR!}w#Hos<Gxw6y~zCMIXUBFpyio4_3Fr2P}1
zam&OXaU*xN;P|d$0u}BC2~I%e+|5s9^V)#oI-tZh#X1eYoGpnAW{5M4B|ZhT?61L9
z(ez*qHN-MG<j(<AIozh&^WCvy)L-<zhOJ>&TL_JDLb(6DX?YdRBFmx>Q&LTtTw_$?
z-Fre~>EqDGj*mJ;>+Coo)<iJ++TT;?v9I%W@^H#yM_j7-GV5EBB<LM(n*dctw^(ml
z$1JTlGx@;+xOFB2VWT3pT6cEDQ1MQ0hhxHhT}W|9jh$W<uKh9Sz51{Ul;uxS!(M17
zp;++zgsT-;_(V@HiE6ibqNxR%GORg_M>;r-?Ct?2@~Bd$`&X#B)G=lpF_Ij*&X|{-
zAjA=kT#;ZERWlctxa^AXZTg{o%;qSFfklDDIN0tO9q44c;Jdax&OKP#Jy&`hyOlX>
zD3OZRILoRMOAdJyeuE3M66R)kru<qY^BSczE>0428KjA0kFoCL`BB&W*VVFaSr`%A
z!?cD%>6+xnNsqXDS~VrQSTse8ejm2&G|?P5Bc9N$<;&Gs+HDoA^aw3jDe9P{-mgeV
zIy6TS88gndSJ=%qf0oi}?f30IEq%Kg?7g6vzP|#F{Q8Gbwy!wL^p81A4wmng^z8YF
z*2~_tIFfyjU6qmES2nbLR~e5ug1f;5u@-dV$TMxP+GX)Z7lfO2$BJ#`zqk<rMl>=~
z8z|z?U!HzNYHbrdF0f|1u$Uq~h&~!3x5}4d%Cl9Zy0bU^%~E?SAXL!^HQ8ETOh#Zx
zG7u`ABS0@=rlG`1zjQqRQ}`5;ExDf!+poS{eO@}(LtJZ7bPIQU3NXjIKPqfxUhNcL
zGGNE2FKyC5*#$L)4Q3~hV(Md73T`gCrfMZolGJ!iZ(++g3F9TyKTav#k{?|!X5}#{
zPDR)*l88fVB(qM;uX>D%@`gMKV{WudwW)aUd}_?HWiU3hW7T=8Q#_k!>GS9D5n?4#
zzg*)qTy!L8Y9f^4REHoCT4D+$!snNx#ajbm*fXbb6l_cuHvvCi{oO<u*|k$YE1Lcm
z)+9j<<;L)gLmJV-lVT!*%?%YtS-F2!W_=B7yBFLHP~q=9ctL<o%+hRA7<R_tJ=E@+
zQS`yO7}_}%F}jTS_abT91KJ45<=AwKWLov(1ZFB(&8_M`BhjZEBjTAX^pbHkA}@SD
zz=%h6$8V{RKUw?}NgIij2maCEc<|r7)3<{a=kpd`2nOsi8Xt$)9w=|!c3#}JlaULr
zXvKPevy-a57f7+W@ix@8ZXUn@b%fbdSZY;r)Iq6)oB-J=liZ<U_#pC8wEliFOwSEj
z{=|qO?ZiCulM^)Yi^@uIQy7b3)XpODh>2~-!MAh*jj-qr9?ee)hUfGc-<ZPV1g0x;
zOElh%q!pi124ZK(fT8mJ7kA!l1y3yhGNaG`e4_tj&o$$V9BiZaE{38)k})1>IVffX
z*)Abk-sl|x5+0*O4SIqca#VZ*;z)dgHSk?Je1|=bM;jmGy4&@x%gRfTJAO};P{b+7
zfxvPwYz0RpQj<qR6NbSqMwt#2E?=o6B@|@0uZ_pb<2wFtMI;0mSzHkvCY5(U8CDD4
zh&9}Us!d6+kg~HPjOs7-QRsQ%=GiJZ<cK4U_j`bm1p-)n;mArGr>r73+i?Ov!ws$F
zx}zzsNjPePw&;m<l}rse3N>A72H#OtQ4WMOMx-$@d>3>#CAL87#wLCEkc)kGB#3D}
zY_8=EThhoWsHpgE*i!_jTVr*!Dr=&6vt&icx)K~57szEye{5xr&cPA!y#kbAR0<cm
zsJa`2okm8Jp2p-+!dx_XvD|h$6a3>6{A|tl<H4TTdk$;g>z~KIYf9|Vjy)NwP-M0w
z=;J0|?Uee0+7c6eqAbm=LR5E}F~T~6W$~RsAB!}ds)oayuM5FN=e#Qm!|lazxBe+$
zl^PS!wp!5d=|bMFlsunwVxuWnSXnDjLA68MEDbjI50WSS>akkt`eT-!T>rKqBmK`c
z41m&1WJ}c%_!?OyrRBxc&d`ulby0ajR|HwIKB67=i#phN*9ul_fcGtf&)d(w*Wl^8
zX$na~vlL89LzSetr3n?wIm+!NE8@JO91{{`UN)#57Lc-$id$w9+Qn&)8owA*(z4PD
zwPWvV?~?47h-M}VT2aV=%B~sxFSS6U@^T@^jwn`5M*)|&85NC>l4S!qn+I7dyy*d^
zJQ20bS((INZA|wu@?%wxhyZUF@1G8PXD-13NAY~GU2*>%M7rkw3vux`t-Xo@<B2LK
zX0t=5UUn8{VM8ordh}!5Xp$p$F+hSXI{?nR_$Jt3Y1IyJH8V1Vef6{8a_ha}s^zf`
z+4SN)fbT-YVyF>bs9o6*{Mf$8JLP-Xk=-pzX|{tKj)?4{$#lzA)k@b>yAGby?Q=^Z
zB0tZPq*Ug0)FI5^cVwfE|FXGhSs2=B#8ei-A;@f-OQ<mp31dX+EK3NTQ!Kv3gl*0E
zaJyy8)a|2$2wMta6lbVoj|Vz;@o)m^CFXGKnvM#JjzU0^X5HVl7dW8r>UcQ6Gq?9h
z8rkID7yf7Y-=TovYBdYUY1i-JgQ;u}4ih&z1WwBk*av%fp!SJz50{kGOib!ChuHWS
zXV+lBuMNl<t0EQ9I9eNn<1%8HK>5H`M*~plmfB5yh{5D?G9vaG_Q&^a{F9OUV0+*{
zFOF0kEKa@aua2l1DrLoI#htT2mtw`&nv;1`FIO}a1n97rkD$Re0I&v#IERXjt1@Vj
z2~&A)%5Q!STwpjjb7Edd;W_a2-R|(Bp#@Bj#JAXuXbG(%F`@B8%b0=kk3Umn@&vA`
zef1jNUTK~riy%h!f*9_eGY-p&WZ&}{riU&!T|}hCsXj4Ye5^Fr4IYasd_8F}xJc)N
zxR1h?GUy5~y;au5ddA#)LBs<G(iOOBN`xG#BQfGkdVuo;9>#SjY@Etjjmd1D_mEyd
z+ApjW?`wA$adr2`|Km;65P&12#LVC4*q;DM(o)@xhT|WW^@P)si_%8L-EwG(Jh7X3
zp%u!S{<7EMTpsK`zL+BxFEAE^eF)pq6kJ*+kpEUE=k^!EAFG=8JRbZrjKbwh<|fFA
z7#2KOnS$-CyYYFLR?&+$2e2b;LmPQQg(T)YM8##&;Y|@^rtoOEp^?u9x@64l24PMC
zGZe<px2_-dc|}b52Cz&}oYD(Sk)jApq{o&)aM;sYDjQzhWmn3hj8T7~*Gm=i{9F-F
zr?Ov!dr3Q7th6P7xgYJanlUNqG^CJ^k_kAxNbKe%8Jw=)UZ3K6Vav0BR^bfyGom?_
z2x7YSc^tpuTdK+nQp)32=od3ei6)CD`|$Bj(#RTdFhUs2c|-Bs)IrLrYt;}KGpo_r
zZ19h1qZtPGqYVs5Ie&Qa{17K7F0an@@sZzTQ&MIrr1`H%nfJT(pJ1sx+N7FTO|ve^
z5Ap@`^`5!ui{J@82BKe5JP~q#=H*Q)Jk0feke+&xxt}BL$fmG~0Q50;$8}#9aDOz>
zh#0EeVR!2bKUv)FCH|Kd=L|T6&EL$$3hx|snvc`^Y6B=Nm&eNjN?DV9n=@k0Fb1KV
z2jvQL7}(6_^5`<2bGX0~YxySCx}aHjBlcF;l3`DXXI&2%uq!=?>a;7!Kf@SB=Js1r
z`~>K*&S19-sSunO@Lcxw%dX=o)EkT;GaDriy@j>gsYt*Z-{r05<;>BM*URnHQKj>Q
zZz?vtJYmlR!`S7HX8pB)tB`z16JaCzsMc80KK_W7F$ZGOtSZGyl8!4_jagkPKP$)|
zxxfbBsUU|#^!m^iX&op|fgq{MM~&%WX!n+=<b%hJWG24x_BZeU?g9`;fIRV;OYdY)
zDpcG6D6@?ngX)~?P|B-bg(tSMv0ZK@-JUX|Rtt2kHO+<!2`-cMN;R<CD2RzR(G<T3
zF<k(4huE9KdE0Y;puWR2PY8y?pfYls6bgq_^{2BUD<N6O%Bl!C+D1E5?S6i3r4k{<
z3e~|Ryja)a@M^2~T9!#KK#$$sHlv#*TNhC!M8*aVYzs7fPjZs^8r0GOE)1$HMbl<8
zNO}nlqg#*UM%s@AGUYr!wSMM|R7KNl_ORvxgm^}Jw6rzq?f-gLDmkinJ~OIPeKI6Y
zjW|hoiff;Zblv!${{E^sUPg><ppa7Ktx3STbHk|B;`+o{A3v3^^?X!Xf<mh2FcN?|
zii>q&jyvqX#XGr$0KTWWk%!O6qVz)fln@tq0?Qr#AyHwFI1*VZ(#U5n4yjDLV09ln
z##4WL0M|X@^1)-7`Egk-bOwI@%66E(BnUmEbHJ$dht*4In4q}2s-{L(a}{O!qH7|5
zNONhd_~zA`4qxz1L0rcU%wJ&q=l_7Q9YAaca<qQ>Q;)-oZ?TU3Sdrc%Bi#}c7a5WV
zgbdT?1ng#sGPEe#I23}-QA%;VGTFl6@}f|Sl8QcKEIfsPLOx)|iVOA)qTx_}12BCh
zE8&R9hFTm8`wuR!^0>}DTa^cSrt-6dS?%dG<tPg_8t&?+M1&vE5f0<3yPaw6F2<k_
zv;OI|f4YluULfR!Y`|9Un^4AC!%}bNrT<1}lM|Hj+;q@>6|to$5zx%~7Di)6VY)nU
zMLCP~sg$EuCHX_W!lVm(Zrk(Y#U}ARHM80q5+^kq2u}i#PR?;~;FtNU43j)Q%7PG5
zF<Y)`<>nj%Y)G)^{qbEdcZ;=9=eI{Tc>P_seP$q9Dt#CrvBD_QbqHd;xi&eiHn!y0
zJre0k3hOf5&3fPv5&qn74D&sgE~r>u9HYEPgeq%+Zb>0YxPoOaP$V0hf*}@0AjM^%
z5s&|0{=#>C(r5%<AWcRx=EDwEz$Lgs|3f<FJyh@kz%qI8zv9NCg}G9_PxY*1@rgsu
zA)iAC76PbL-<7n+$9Dv9TcM;U%n?+hgx~z1=DzZ;tuJ^pc+lcb(c<pzT7pyDr8vdi
z3WVZbT!XuNfug}3iqqmwfda)h{r-0M&He*>UnQT<y~&)JXP!A{=FGVbpCV?y^)lV8
zKJK}nZ+^QmZo88v8+Q60KC>KF+?zd#_04cdu8IPYp5l+Ay;XBmBsYo#laNR`?cCpt
z>UdK8Q44!}{(KZUidi^}A6srpM0TMkfc@6qzx0yHBC#CgZ&&b{$#W4Xa*8Q#ag$$K
zO6w`OQoa>H*b!jMu+@d1F95q5`kMRxhjZzeA0TGEtOw&sisS+{lSEfB^KVril{Ece
zQ&AtM$C<8A2VePPuVIlZ<Jxu0Mddnw!$5EqQO-u1@zQzoXBNG~mr6KXy%_7Pr+f^c
z5N&ybJTDf$(<xO905l?0B|^ncdjD*?(sTEPL(^PM(SgV~1o=I{q8r2ywjPY-{G#L@
zqHXPrX4&JCMIY-z6MmockY+6)xf<jPYw#3_;PuogCJ~Us8HbOf3F<*sEUaXbtTgg?
z?$-Sx(a=w_a|GKj&ZUqg9jla$SnA~>tW|>}T{?4UHE5g1A<X}kTMl1AQJsWuN`uAA
z<w2CY!EL~^;EljJP=wgE2d8jdSbCJ1_@}70Hr)ZbaaLdM84=%Ef#MQ2nrC$`IQruU
z^IP!EB${^$7*NlXOlJGdtO-RhP^OreZDnCfag+#FxS)E_=EL*kdQdM@9eSxGR^xFT
z%;I90zJvfjFiskjT-_NXLhh}+2EUo*G%h*nCx6#LI{De4p~WKikSK4>7W~yaa<-Fw
zy?x@g&p7B}%Q-iJYjQV2i?VnrM!nAbh|Vtl&#a(|ir{E(t8w<+?Q9c<+4zMnF=edS
z_2ZKVVK29BoVKR^^t=;!^YFs4Mrqw_(o|nk-ep?e@A%DzB14ZDn=Sue>06w6qPLrq
z8NY3MZk?SrhQG1Xlf~OL$%3%opAtFZTCVCu>kwF-B`K0f*^-u|?Pto1q`U<Gz)CLe
z%|ZWDK9j=gSBm>x5>q{YyBqgVRQ4AljbsRmGQ)cX5jbjcZIU0irLd-A<&ciR(73p9
z(iPTHGd74_W&Z6~N)<G>v4;VlbSt(TyJN*n+%Ltt1cP2OK9Uq4a{s=3_K#@mzP>ee
z8xTZ+^<LqP=^Y$v9|xR?2Kw8hRH<ML0f&p|fMlkE{I|BI>dmWttyIOhx_s>}54Xzg
z!U;nc&vV1R-#;)gK$1-tCh%2HJ?*=S6)oXTelA)3)l*pEyHGtQKF2R)WzIl$Z_~10
z^<8H~N4E?XbMUu3!HQvWbl%}?J%;u8fO_h^ofmKJHUn2)sbD7{z`7wpiF&N01IZ#z
zxOk?F6(HXG{$X_c`1pM(hZad~cn|H#uMk&i8L#l@dP@|;WD1YQz}<e1i5+k}7G4)C
zE=nU{j2Pdu2Y-c`?#wv)BgdmyG2HrlCv?Hj{34Ou9BeI~!z8?CqYI?=XC0ASN*adT
zW8$TdjFPNUE3{vV8lI$L4x~57dLL(sD;$r@cS$$Crd%eS5V`%r+!=*!5(P2pmsEyk
z98!K<<l^%lv2u{EC1tyTv}mSgEvaaSWyo@^(pN|bh-V))xz|vwXFi=z=Xd{}u9eO(
zVnj7t-PP@4vhY|?ny;doIULzGj+-Rth>~92jB5P`W@0oTXsAe1y0E+b)G*!rOMT&D
zVy<h}mb$MzAUVRLN{jwEreS4Qb7jC-s53Bqm2(OmPrB$zqpqiHvCy|{u-V&1ht=RZ
zw86glbQAppd<%xE@<SP^_Vt`GLCsf4dkY2mxsgbQi;H87X(eGP$Rq&zlR(;Tl|j?4
zynYvbw)M|mAik4xU909oFh}cafRi;-i0^>XQpb9gCZueUYAV4B^8_^z|7T+_yo;nl
z8Mf5x&*uRdZwvA@PBi*(dAVZw#oG+&(FjWgpk-$4`5!Dowh7$wp;x&Q7!Ept_=<Ro
z(JZlp?EDM^^JcL1)A4LJU#6m>iq8nRs6vw-^i|&dK6V#icjKV(MDN9!TQ<9v6CvYZ
z<N+&q+F(}6o=3j(ERCt?=(p28XAElaqDQj(@QcD<@a*C7f^738e$A^JbEm>hK_N31
zou26Y2X~wig-numMMIl4jl7h5=0r1{704J*2@CqyO#F?Imfjgv87`2jGeyKYYt`~<
zKVL{ChAWZTarQQ!&a%c`V&m=Du*#CtjnH+LvgP|9;k)$xG(mesCA~Cv+Jn3W7WRLZ
zb0*?f%J%$7I`whl#-9n;mu6=~{1T?zSG@1^WWcTm7V$IX#Y%P=gxdm3*gPB=ajG|=
zcFlT@nFaCJad@s&p5*Vcy3Ja{lsFp^YKoOi)zD!EGMo6lhd#27ujfTPG|Gz2*q7)D
zB~Tdg*bd=+b=*dWE1$}tDUd_D4l}rpWV&4aGd!{J%dwc{Zmo}8@Pn|l_FAbwbxv!a
zrr(#h&Mm(gbo*~a#H*di>0mb6mNE4-Wv(a}>ZdRBj47~P><y_7zR4*6nW1dwW{=&`
zNRM?O8#OygZVtkX7vT6CDoU{Vlu~x_c#!b3ks>vUu+xpE!8*~i2V`3WYe87<v^8II
z6r?~)k%03R2s~$%-Ne&;Z+DA74jK)-6|(9q3e70SAPJTsFW}?NVo|hA&DQ&FD%7K*
zyT+ME1CvMEFlL4x*n~K><Nr=XuO+dAg60hog*%c;9<A2e!A=;2c~3#-bx!>jAT}Af
zscP)LkxW>cw2mE_2+yF-%`Tx?x|&%GF6gWV+dU3Chq}z^zrhzUrAypH_t>VT{D7}a
z<FfT7nhDgF;u#Un%X~<(QGR<$8L;$whBAL(h%eTC@96Gss9mMl#K(FRxX<Ju<iNNt
zWdFm=>vK-C{4VM2Hu^Z|EQ3f^(N+4iEsP2M=1*f-($;-cwu?uPGj>i-x1_!r7YQV-
z)vMmOP2=$}rho4`i$3*l%YBi-HYASRKC3qOLNzXLX@Kcd634pO`V?w5sL<P^VRp0W
z+UU>o^Ba?6i5T-!SSx5!2CpK%)-s|TLp&$nY?EW=NcXj8+Q&6<jp6A11*)rB$RY5<
z-I`RW>Tr{C2bCIyuq`{~ySa6~51N+jn0!LaDrMpOX?;%x!|$~LEmj_00t!;sYN{pK
zX9si&8Cfi=UDvo9Pp*?{Hq7ZFNprSv`e_f$<Rk*N6>}ONj^I4i%^D8R{apf}G6z8|
zm^(@^wgY^R>D_+Of&WB;KPerl5EG-Cz-`oZ&lpXcdWyJqdoeg)q3OX<arKVx8^Yd3
z1m|5es3nmpL2nx(NjUP_+wJ})>yi25@j54vBbjxjF`%!JZhRzEkl*V&kNLKSC2};+
zeb~65CkA!uWpl~?n=h`ybky^O^HYfpN-|J9&O~CHb&PhpV!UVutk1air_vbmKM9S(
z_C(-!&^z^(_5!!IE{-S<MAO}aY)otZm@I8>U1#PlewxnPcs}#heLTJEpa@xB##pE?
z<Z?0klMG8@$dwx^5Bu*e`{{H!&#_XJx%K%76DJN5Mx(~1!<kh#QetEG^V0M!lr|9s
zy-c{(we954os)V3LY_a(b}y9%GE{4&Ud8;CTbtk*^ThukWGiPrh9Ad=xbT%0z@>m}
z+T(@|c>A&q>o?jD#U&##)K|<LA(SYqY5chl(R`m2luOJ}E{iB-m<%7up>0$FFpw>T
z2AJqmfc+FaIW^rgr7KG%-zr@QIct8lYeU0;(_)xo%E`?Yo<wKPNk^*%QUHEVdd6v`
zuHq+!K0O++FuL{HW{PN~N6?8aYh&4GwzYhL1FV59Ee(^bX)+}Nk=#+7EpMEPO1Ax@
z@Dva%V#0NDsUs=Bk_EvR`$;)>mcD3e2`1SyH_~aw;YcT;4p>Ke$>w?bER|CzkrXQ`
za&<9uDs|AwyV+ou0+y=DswKLGnm-ApueqwC>4swg00f!b)j%!lz-();5feX0BqxE)
z_~)39jnwvV$)me9-fJ25TVfQ5gRPl{&z^c-Z(r7AT-VC=@RN`%c2q&Lyo4kjR(}M@
zI5obkZZpJ{pN@M{SIMa4OW`Urm2hYBA&h241tYnC8fi9@BSlVO8tCL??k~nlVGoxI
zsel8ifjv)99MmXwOrfqcFzvJ-KIoQXH)qDNqG^rMtVyeWp;l+fKmr>2&$u;&^Wqbf
zF)D^|s-;Nfl;_*RC8hJC4@T{mit-X)*@ZKbu!s0AOxgE+Lt*-)_lBmG>CK1G1=LDH
zZ63SgLix8{m(rXaJYG2t%$oJ;i{=4wa99vu`E{37Hx3v|IPv~??&Pr2Ag*!CM`i)X
z)+(}#)i=WONO{=O!)B~9A>U>--@oD7SMTw`p=zES-(+GIeG=f1Gz%`}`h-}Tki}M2
zU(umMYhOnx#(62N6W2k$`wR>_HOeQgag{=1NM9YC@!?5~H^Y%l#rmlvNS~P@OYP=?
zt%sjA?AU;}20%f`$?8AKtZ15oRkoq7MmWL%$r{wTsFx=8_CIkTBfi3q9Q@ivt=l+G
zWFcvKSRV`fw7IFTWTn1ylBjB+U$I}4mRl0Y%Of?i%UY#>wD&7*5YY(N0mHc>R~+{5
z;vj{Hn$m0iBvn~Zw+JAdlwG`=Ns54Ck~9v{$pR7a>vrt1HA19Tv3!oJ&(NpE8**6A
z1sOtFq#2w9@~yiv*w^-P$GbHq^IC%K?%ow4873pxc0_@`;j8xl2_%yVyWTO5`}$KM
z*ppL<vA#b(IGA{nL7z>Y^nE?2R`|C59;QrlSyoGE#fBHYmkzBa70}2czt(9aF@~C3
zDC5V^FRWH05NwqN>~WxlB0Lvj<YoW&&fgPfJI`c7fx`smTfU2)**7AoNbgIr40mhI
za`;G7ES9G#gdICk2IqkWAsMtO@9C2TH5NbfTU%}e3&d(B6GECX*xpCU9e)_+!_;@d
zNh}H-d8JW!Z02f126jBQdXOM_O}~#-2Q^}nj7hy^lAV&P8A6W%Py=YxVTTqORZ`0!
z!edm#!DDX&%t_0pM1y~IK-2v<C=UL%Q=f_)6Y&|o3klEFMjsZkoA0y2O3~uo@|)q;
zNU7FvjV2W!4~C-+mQpPx2T{>9Muf5AM0BTz&_`yVu_bmFHI#}2a1F%~vm0?u!x94v
zjaeA8e;|yAgZbYL`;{wU8YlXD)UHZT7*!gpG1VInHpA0t^6>A|L*N>o!z*}9I(|P{
zjyG?|^Dv*2o{6lhH>c5Bwh@5P-n8gJ_WYvw?~*=RBoUY^&tNCk6eZNDjiRZRYiaxZ
zjepKEOMcgCB|i7Zuy~T9SQD7<tMIOnNQxrwR&vf<lDyc<Uz$^G9EpJ68hNqDz}r?A
z!6JxFpC<s%iA>Yb8b_>TR7E(X4_|c}l-poA5zJf`+)i^Uk}4v7A49CU;hn@Z-^eym
zY<`XvS5fF%B!z_yud5Q$n#4tl*x*Ds+zhA!!bA8)Q<9MgBC&6b9OcoljbqF2+#r}`
z!`OELQQM&7cXVa)tL|YqU~a6^tk6%%VjGZ13mgqSC5Ti@afq)^Qi=HjSP_34LZyN<
z$mzMSD*PbrKJu6(ToumJ-=o#6#!_|k0e@^5$c)*yEO8kFPlR5{>lj7K+0PJzq3UBh
z^ZU2WZ3$4{o}^MjO7I2RkxN>=IJsvXRFV}cQrpnd)V&l-fJhK(mPaD^wR8b|g*}?u
zXWKK;&Q?q5m5XZw?`_I6$9XKx+sO&q`NLW(<Wz5dlJRP$`pHFZ*`d|6>)m*~ox9yK
z#8!$*36sE%m^RYr{np1!NEUs{oa{VU_N6#vx%dmRGM#s-T&^EIpNlO!y*0RV7*$xG
z1@H~bp*v5;GQw2KRE95TrASrtW7}ygPY9iIwap@ajutx#n_4KOhA|dzHbc9B5fh>0
zlr-oXF>)S`3PW{mliX)J{KvAZDz-p)cZA`v-bML}YroZ4Nc1<W`+}hW8PwL$IVlx%
zhFEgM6YGH<K{>E3ttK)P8Kx5DyT~|srzmQgS2L;>!Io2eRi-@<i5aC`vxe0m4MRG-
zsf~)w^0-0q^zw<vTQ_z;lhMCX1B8ie?VfSNJdLW_>;j02HxX>Av}VMP-wIY<M;dE-
zcNScJ*w!8GjvU70S(nECRVL#^@hUx|z&m-@UYNB%qG&(|%ZdIOM}rrAN}n!k&*Bwq
z>ct*2%2+O3TX@~ezD%RATD3CjNMOA3Qnp<$PK2ZspR2!3weOEMU7(-!c!q?_;bQuK
zvo`WBF}q+yRJXC4Q3i&?K@vPT!{!}O$V>^A97&=1<45SVK!40VRgKzo#ruc#tr)6t
z(vtGmX3ZJ8m{7Y0Hh;FSLfnaiDr>x!0T-}>uwCj4HNPyryA|X4CKQ4_M>m=E>$4FS
zsj+P?ghFE^O%t6C(#V3wyjzEqcqIME&#eK>p}@O{E{hS4_w|(*-rFTGvy6rvbWu`{
zt`Cng2p3+_7op3~;bRSMqJen~hv8OBO%q(9Qi_J1?VOeND>XrX0}cz2Nh;N_0<MJS
zVRwgil>e00-#M5cJQmtISNjKNPZPxzvZ~BbQ2vfE8HiB2E&bI(M=RrCD#KwBOu?qN
zIT(;tDOR7!y+;^v?-jv{HV;?2o(UHYhgE9E8K>po>NQ}t0}j(tr4OSI@B4Y`kbaqP
z2qLZpKBE5^F=WdCqjqqVD@8~7HE>PJ8P?)hU6c<Zt)Sty(DP=z9O>KEhXkV(bHkre
zY2kq#uV-p4{L+kwhHWWnQ0`BW@vE_#9Ewjl!m6>9jrAh?ujt39&?Us`R;P34`j4qJ
z-k107cF6(5IRRAtOc*@aACb$972O}#Xw?!L=gjRX!udF_(L(r&CcGb_$ogMs=x6pL
zOF@}dv^aDQyvixRuvT;EWroojk@$$7g%i$egAAqAFBlb(LH6(P;;`G2qfqJO@%KYn
z{pBsOEca1EU?JIItZtqhz?bN0NK9gn!*Z*tX%;d>sr(-IfGHjJNFHiM2=}uha69<j
zAY2O@2$K^elkqm^0o~*D{&v}Y5eZA{#LNXPTtCAX=_md+@AuQ~V7#(v8258jl(ixP
zKi~}4peRX47!b{7Ef;Rm*+UqM*O^w~+fo)n&tBe*c&xauO?$m$yXy&8AR<bpdO5J7
zwag?^O8U~!6I7ys#%u|htngU6mzvkb_38NhDGb}&8F$;@_32VjG^TSY^QvjLzMOJ0
zD7NB3*b!+Isb%29;iS+7C37M;5yJSwU?m5Do)4E!rQ7it;N!GhPADg)Ad(;^&!^v<
ziA_Lf;A4z|ctfbu@#<I2j|MarVd;&Q*aigPZ$AovQdPh;e9{Hcfa5NO1&H&&E=1Nc
zUp*Gj8Zslh4^lxo)FP1AaJTwP%AH-z&&@RJoE7_Y^w)w6esL3DF^Vy}FS;a+H`Deu
z(XooulBkHCPUBlRaXC^5p$l^>Gq|;|K0;0GB{Bp4XZQyU0G!zpX5l}9{KtfP8;tKr
z>1b~h`6xdrscjR1b<QA}gx88%-G~>*bZcx%ueEs}q1r3%C-X#4Ym=SyG#?|MOL7h%
z!|eKv23Rq(k#e!BmY*%Kn%?q~ZzJ^RE{d!*(fmr8Rs`+RL`EY03{~{S+D+G)hoM<(
zf#;SvVVVG7@Ew4NaMp+iKrM8VB!#nOQ?U1a&$%XgU5NMhT2O2N(_C#-6p~5J>nc@C
z#T&|T7vJiN;K!+|F~%)-qr9+Zh7yI3n_kdVhuiUk)Qvzixtuvr5J$O^wFD21AkD5v
zQ|gM(reh>O1`rb3q2VL?MeloM82%L@kNs^sK4n~HEOK&p(Y{Ip-Up-7(L_8zpBbr-
zCG$wF>#vor<FaGH*e>*k_d2Z84c}8K5cVaNky}7{-ulr;MROt%ZJTk0Qny-{-g$<7
zp$adj46Wgk{7FP870aCUAFfMF-%^n<W!AM^>(_vp2149qb86{(^zgM2N2-{7XiJ=P
za8p#q8L+P=^{6y}I!xUOL@O6WjkxH59&{L*BH(@kTws%%evINsDioxf)!-8mC{*H|
z7+8>8uTy4pRgSG>x~1Sy&htyw#=#J6W##u8Gm0e{ngz&S3UMK0zvx=AWe_A!dy#Q3
zq+m{+EY7Qvskko>8D|eX;l$lD`G+|`;V$rVgSV1;)*Z>T>YUZKo;?rq9A}TPH+|f+
z;**&y#z-%Kt~&CbL~u$G=3BHjy*B}DG`vo7g=Dm#tZCvQLdhDcwuC~MYrS`+`E1xX
zBzfu5hzhdHISNVic4$oF@NZw?fR|*;k0K)UE!4bY0N)?`YmXBdS15Vm+J7pTQyF6)
zoqMm-U6w&68)T==GhsQ3MtWg8MA&%F`-xiMGrGj{#YT!t4!n2VEl$@(@+FwY)aI9D
z)l+hr_ARMndsI1Nzm+lc8OxMj^lFrn?1EBq6-zgua8wk#ZKBqbd`}j42gsI?B8;)u
zJtwGrf-j{ITgK~4&s4s|N?uv8#*?XRO|<2h<(ZO|n~mKp!(@Jdn)0|Hs4=7xjo{UA
zr2-{^(+v-#O9?Br3N4`~?JEn?(9DJkK^8ot(`Kd8!=PVs!%MJZ9|iShBTDYM#5FnL
zgtVzMFv#fGO28ykaEhLvKPnZUGV$RiG7|ZnKJQZ_`a4_-#I86T8LtS!YDz)YNU}u9
z%i8{=v^kMGfDo4cpyY#*)TjdCWZfAVTGFIkNL;ksS?NbnTW6$%@uGYm%_eDCoZ-J_
z?^Gg?XuN4Y?4=7gl1xHz-+Ql@P~|G3!cSw&5Jbw=&7KMt{~>AUlc(^yvSo%OLJ^9|
z)lY8X2-#N$rs4@vHx}TPJ&FHnz)`V2?Yi&W7YTC+7~$L|Eo;e-)9uo`PE2PF*lrf<
z^@k&;&=fnK7^j7GuR422)fdZny15n2ri$Q|HFPIIGi^A%qco_anw6MU-urN&P)#jr
z;)F&@ClbF^YHz?d(x>d6>Ry7Z^bfkx^a^`N?Xa<3X`;b@PkfkHBtf+$3Ch|LEcz8u
z@9o&>_Qi=(>krZ5w~W%6m^rD*1$3Pp$Whf?&CkPn0{oMAwK7^pwxCt)IBQRW<(*x4
zq|H|88Y&52w}DD7p5RfV=!RbwWe!8D>Ov87F<rNt*O~jomOD<Zk@sY3S{BQi7jh@^
zwY`uX57!^I7bEUgu>=!%R%mrhrtXG(Twj!c!^!?vTfZ3kcJh6+&j^n{DvffWB@5EV
znJpXJvCDbIMqv&26};8nC}wiW!k`4eBSHX|@KTzZEsfZr!e+3pu^x8OoWkYSBP;eu
zY!wTWKp?<Mn2?&rLa|2K$&ds}f~gzc9kxeRx|_aB^v+PE@T1y$WXn?9<5J9HbSKo+
z<rI9`_wD4O8jU@i<+K_&umkZlH>u=9*=Tl?__0Xn<wjIBrc!@N?F4>Bn00@sDpf2`
zDg#R&L?P0aD|XAFR44CH3%zOr$Fi*}#&uG@GSFbNKK<n&GIoP%JSk{hjA&UVzAJDZ
zHGGicV+YEe1*}`pv}&c~L7b7)LK(yx81#vD$NJxw#-76_Qc{_jRRdHVoLS;2S>uTO
zX`jKCoYRDiqf+Aab2Eh63%3_4o}}E=y}FH-r^Yv8L5pZ(ZxDqHZy!okgIMvdDe>ZY
zV2OjrA-hk@BwCiduS1>k?s6HAa-%@mc%Y^OsKBuAU11d4$jyzbF1?wdq|R@tBiK%(
zPQ;mKKuKBbf<`^>f|s)ye({2C1_GxqFEjGayjOo{NY)1gU)ZTap(X0FJQjcQyO&gX
z?Zl7MiM_DMZRlVC#%MIamc#LirPN2Ud;iW!Q%!>^v=!XCNK6gD?jSHiQ`@|fu^e51
zU*SgOo|G0kd&flgAx<MDvme<jPQFkx`-u7f>;)KJRXtC>imHwer3LQ;{%TyVfE37P
z(>wBLPt(-u$J;7js}qQ#U4tT<>G+&~fy504js$6cMc13E>mDbiO*6<X>pj|V%PGyt
zTB;{jYc16LbSo&itYFWxdNimXOZZ-@^-(9BH%Swpu3ls|9CZ{Chg$0kzc6D>_vcuh
zlt3DwpfbKlk`#`2xx28`kb&QayeHI$x4v&;zT23UlmzPN`5fQwaJ24l!X^}Q6GV&n
z#5?F8ddul%9B?aYvOcBAEmUi%5gNa33`Oz!d^Ps*W!fk9JKWHO6q+1jyfVN&fpHf{
zVTaVZsZ7ikAbWf5Yp)r{^@)z3Lk!bOAObs|swo-Fmg<c%;;(P!Hj?~AW%gR-AaxK9
z^PcJYTse0Z+pKcyX!UVA1I6>13|dP_7&}TjxXjrXyAeb47JM88(l3owNlbFRETA8^
zp(xyw0)6DVK_2BJZI<s(H4N$AUn&|^sT{)1ZRHMc;V<r(Zt}>7e^e~IO%xQA#324S
zo(ViB@>Ipw4HvT**sJ3f+0-ycQaLNQiIld_Nh6UU3_Zs;b}r{crlOf9R;0!3@QF7p
z%|w;^7{_mbz!|oUFQ*zJHM5G^oUBTa=Oa6Rome`s{Ec`7B}(>vbofN9&JWMZ&cyV0
zcH%33q0@bgBjB=^?cG;^Du=7wGDBy!a-{Kz_I!*8udghhEAN_jo74XAb1i)|<<?ao
z-r9I7<=z#0?>N4MWFdZwiAhVr)DevK=+e!mi&KD>EF`Bz(THh79G8#KSP!&=l_l@t
zJx3hL&{Df~S5*wym_ipg-fObL(V&&6kiJu3#3BAseyT^kVYLoRN0v&Jud;2p={Vw^
zNV~GRA*%@J(-VQ^fnIXd46}-*AbK<@%aDbnutZ);>_n%^w5Wc~J6GD4M(u$K&U1AZ
z-@WQ;JCB@{K1}lj&L9nd5@E^VQ}v(JS$YUtI;gmv22P{P#c}<Ut)|onE%<{<g!L~o
z6O~AsSpaB^QL&w?L$c#-ew>QQJ#_eu8;dO~Wqu8P<o=IsXTFvQtGYOE{J6TWKg>0x
zP&*#+CyK}q5MhhSe9oX*XCyHz9nO?6dn7q5zpTUPhP$0D7JeS)6bpb=Vr*MVcK@O3
zw?xut`2=gKm24u=e5M7<JMK}Axj^}c@yPLJ#mw135?+)WauO#Stu`lh-Oo&hi^u)v
z+rRo#@=f9-l6mxDOEmN{qg(WbA;vb0$(jOJAN!ti1MwrO6xQPLK7!%$ZkpYX$M3ky
z%7-UFHHBQNIcwa!rpQ*WCSTo{(fUTDnC{i26BETsQtu^LB+{<XzOU9Xv3`l${MweH
zBuT}pKz<MoOBWD%_*2a5#{sF*h75%iTe{N}o8&jpYI!B@|2i{Q7c6LaG@6|P*P>Vh
zBfw^kczF3~d^Ab~h||;r;6yM%*le(y&YUa#Z}Nt|m66{Rehx%|B69qbzjugbJhcvU
z@L_A-Fh}0<v;;kTgKQLXoCUVDWP(^b2)Y9FS@i*~;<?`cJ^pb$esIU)=&*`@V8Ba&
zzqD3bo@$6ls&whB;QGj{OdLn@aewtaW7>z?J&`l=NM_zBPVJW9k|THJ!yF74_lB<c
zRm{I17FJv##I<V(7gSvX)9wUO2L38*3qUVU-8`gQbJezI;MOQ7jc+mbQv{%*X)@?#
zL`lyZ;TO}04>DSot`#Ik={vp5*rRR#U^ec`<Phlno`}<$7Y=CuJy>J;;4Z}R2}Zie
z^Mdj<R0m1J>l!n8s~v>Jgyl{LZxSBG{-8t55G+?r<m{PcpB4iWa*edQ1gI55upyGE
zX4H~xc~T|hSyJ3yk(wUrZWYnnenI<2X6!x429M^<C)Bz@weYzm+Y$9d)q#^7rNo6!
z?_~6;>OJBbO;dS0539N9KQ$Gl4fYpueE|T8Cvs+daescNt`D#hunUmW`Z#c{a)wwE
zyjU5f6mEqsga<7q#Ctovoy7HhNhX^0(ao4~TK9BpSC9eRCGQXSC^z3DZYNM;(Ipki
zYTE2nBjizbczpeb;l<k==~~6l8oFT?Q0$eM(1f2YiLcoctC9)l390m6I6q0<8$vu&
zU?$WJ%PJ&JEnZq>?*V^AVmy$1p#@w?9g>Soq3%T2Q!b35bTo>WOaq91WMgrU@*S(r
zx)$oEXN-2OzRMsiYV81hR9J*yr|*>nkYsZs0FvQToPWbr(oY<-XpSPLYZIf`X+{q{
zj^(%hPCx!>G23@a4j|0?dyQve3WWo}809mpJM~O-#Y*EgY2OY~5jOD@vm^fea@C}^
zImyp@LeDImP&e7lr!lfRr6@L;i)s{+ulbS6zhHM{5JA;bi8ix1C6{Fxa6+E#r`51+
zU%2!5_T#B_X)Zl9-aQ%Scqm>msAR0o+2_gR8N9RiM8ko{-Cq)Cn7_R*#V{<IB2=8E
z*8fZ0vW}gs!Us|Jq&8I~$g8kX%);u3q#3@2)XT)PKvAz`6PbFe?P<i9Dy7A3Qn`aq
z#K99+NrqB3O6}A+0Uu30lk6x{u;y;RX&Z>wW_|ixo+~1F?(Y5lybk}am|~ma%s@&j
z%$5y8EIo52<rzos)`YKOkj6aLQM9T+CPJ80ygH*d_?J1$5@DqZXp7ucJL|UEj~DE9
zrF{D5t#_QN_~_r2VXjm%xfFZ^d!#q9kAoC|5F7Cu3BJ|zE@20vTle?#Bwn6g4wy>E
zNbavTofS+x0a{haPKDGW(n^j_BdW{A(^h*?1o;de@SiF0GR|>uP6fwdbN9DYzJ;em
zd<5Z*y@*zCXDuJ0fphUv@IJPfAY<UZxaM1GhkS003|%cc0ZVhsYTgMnbfshF5DCNO
zuYt#`Z0O9~0u|zQQTSP!n0m4}!c&?sB0^}dA=TSSCqO53tEadl5h0m=T9Jr!+>Yn;
zHJt&Sxw4R)$&$8*f!et2OjMG*%7L(Crt*N5by2|X0`X+y(SojRbR6;iHyafuw1hhJ
zLY_X?v}l;9iJ6i$S)8*{Nnz*sffcy9nHd+p_{K@DJe$kj+EqvB8hX6r?8SvRp@VZX
zw-j+@W{@CPKzlOH22?m9=EPUCQ;D8F^1-#5P!<2EXrt1XR*)#~@4_76k0X&<AVW^(
zHOF}>>S{YxhO<2zb_?`2?lCnNZTjVY%Pvlq_j6-{tQ-+CQ~uBIg%w?g?+2Q>z#b$+
zkc)C>dq!MNdBlpukZSan_<kMrk#64%7d`7@RRkWkKK-g%^jz!j1i!*%a;PemPM!AY
zzmjXv*e5&(tRI|Ue6fgCe`s15GEHjG<fomKE8H(Kpk{<B(GTmY^+JkgvvPDyxC_mt
zLs}U#)0c_?C0NC^`}3k7c7P=o@jI*t&OnCTrPXhupp0s&;#)3-e9F5H;TTI&s0WB@
zueII+9{v7<pF&B2G#ia#pq!gq);b}VJ)HpED;Qw0VLp>otqKokAWr3e^v#rUj6v9g
z62>jCqe>VkUb1K`U#Uo>E+bnfXAg!0AyckC=Sv*K7q+W>0^^aR0mYp=$!9p0l}uOg
zs6PWeR5E3Q=KoN&#90=PV-OQL?8{DG8w}l$_69`U%Q=;T%1k!LpkSy(hkY=-ji#%d
z;87wb=2)G(D!CI}WESmo{3C1bY$7v|TbP662)6g%U>nqM5?G7Vhp(Nn?YF&p4+^#m
z3}8R1MB~UHXXBj4zZye5RTMon5}CT%iFQfO-1KXpKY=A>nKEtTpB&fAj$+5I^Ix)4
zk!b1bX%VjxGu30)&>m{#Ct^;xe#Dd(h_7`BbfsTq=XM=$t9ip3Xt5{SMWl1T_7nV)
zO<9FzfM(P7%o;=05+3n$@dgCnHl#-6R+D`AGSn@P-zXnGfohj*4Jh73jtjDUR`ByC
z9o-I<Q>m22Gz`QF{G?7&J<=zw1M>&iNN1NLR<mgBE01#1$s}H5UOz%YbV&E*@JSb&
za0U~_mgM2w&jfij%hRRgSoh(RuChzFgA`xl<0aWlGU~HQ*+pNXxSlC;qF|EI%`4&Y
zLD@RU13EN6eAd)5Elt+3vS5~+paEmoEmA8b8q}2#of+w2&|j8Of3KBn?&Pc|KOKJJ
zmA6G>_$w?z0M%Dr$5!R_Esfo9fCycsxaQ}$C))x(;T+fuDP(2KPj<oS*cEKfR?ki(
z9!LDC7z=Va5^O#NI>Ci1E!o2%sIw3z?T#L6pY2(^amm3OGA_a!Ul1bNyN8f6IbvN<
z+^q;PO!ut4R<Zev_(3s504b~~_liS9q-apPcUlo{YIab*tWN?-5-xgAZb?^B-@bzE
zuw(owY*5>2a*XCKE_Q)mh5Pr1C=(tha!QiRCOnWV*b%v~^{Z&Fg@kzS;^BXP#Q#pa
zk@a_%6sen|g}OznMqc}~q7wS*N#O-guFOkv5)5TMyI>D;SbRyrFqAS>+4}Z(w_R;q
zANlrmudJ#6UVAj}hNwlrVU#=L$3l@}n*~EZuik>HI)J!5J{+#^`?17Wvl*bH?YL>u
zllp5X=Qi$)K9doSD!U`nBCX$Hlxu!UQ-JN*1Si{a2NRp!RW>uCO2~}WC$G?u%bRz)
z!_E%Ummkr?*SFsIB7l4$gaE)h0fuPli5ru9=lc*R^A3TCog7gZ=cIqDF>pV;bj?p}
z$~k?VDC?wAd$X$kez<x`{5N8E#s-6xOJcej1^`*oZM2d#1X<(Ot~e37G<7q&Ki*Uz
z5XZC0UlvK8l7liUnB3+Fra@5Y)VD}FN0|k3KgV^O-D&_mdj`?j9wgB!zn`X*_&G6I
z7R{OheCy6MuQ2(wbqjeTAO5pJW}<9iO&^LPGqzj^a?oudVSHFBA^<%h(2;~_?nnqG
zXvzfbLx0hZIE9UzpbHdAN3Q48wnPBddHu@Of4V8vO+uC`B}-HE1ks$hl0#Ybm>kAx
z(w_Uih6cIxiB4I9CD5gy`r<GZGID8^mh6KSh69<W-b>5hv$3Q3=Cm!gG{}scs%Ofg
z%^6_=ub+WR*7?P;^g@x}Zb}HiSCWAUfSFN>uT~oFk|TbzMPXCiI}t9@c148iJm=Rg
zI>flW<$PZj12X&B)0DEas_c##7qH<kR5DD`b0Mcb1@F&fK`Bg6kYn)sC_W}{dYzSQ
zkrdxnd7PDt<JK9NNAL+3V)LN{^PZ=;=;VY2-)M||%gS~8s~R&~8P;sTt>FqGoYM3R
z$I|oyk^ZXAG$(3A?($<@;TlD+WY-D>Ltj0N(9c11{}i?VU1mod$)<(zv6Yn_O~%A~
z_RJU4Ro&s3X&y|opxJ|=Buffvjq#C6Ql>@gW&GOP{{ah<8J6pi@J4t%fkhhX>wDdQ
z@M%o>XeR=e&^C8n{~Dpgmt6cE|CrPGO)TNA!?sl5LIDe+a-8DO=Ob@>9*g(m2Wd0<
zA7N$wsd36NYts&a?xd(8&`&m0r;a?81#&_TM7DHwPvG~lX`qxwf-qEEHkI*}u`Q{e
z75^}kd+Pn?U2_|#?|svYz>6jK=dbG;+4M!wk394v-9<~-jZg2VG-tA;>r29tMOMf7
zG|(5M$v(Btw8~;OU$#@*7dq|M`bauC<b}6+y^j(+^7++}t?TQQ8wDjO+yNmT8<UTs
zWi|RS)|i=eD!`V5)l|Qe{%}ec5CWqNsD7qukli++Xd0PY@_O~`z|I(?^~h2BIkWZh
zMf62ig|Oyrwq8Lvu1X|VN!V(D#t4?;4w&DC_$qtIn7S7=Q8>3Tn^)~uL#Aka(`h>m
z?9tB=4pNK38=?ILU32N3*r2x+Mpd;uM-WYQ;*&$JX`(o>wJVfs_unO42b{bnJ22~`
zipn1froi@Oy-v&2m}!5?)kI6tLZC3T6@|Dt`j4cdATDUWWkQUc?ISGzj8E%W?zBf-
z9@QspPgZ~&sX2npE1!|~#rCD)wQ)@O_zx`k8qXu84*k0lw7x-19n;?!&soJ3OWT0y
z9q_f101*I@21<|XR{$WW*F5K<%37CUG?{Uz6gHWzGKYeAvgc3LN4;5(3(NiMDrhBP
z_!fa;Kg3h_6Wj7QKm4|Tu9o5RFJ9+&)|91)=QsxAO-272<&NhO`sQ=c8xzH8gde;P
zA_-3=wG^nHp0g3;qpvGc+gNBs7`w8yNaxGUZ?uebG*BrYRYz5mu0=P-5oQ6yAeYHF
z;>bH2heNotTGMq-1*Yzk_T~EOmD*@$p!M`+z=2v8C!+a-oY$L58eRjJmxcuPAIw7W
zL;viH|K;`EJK{)!nImJo$65DWHJwlFBQ+2K0;d!xcic1ixPT|Hqw4iTTc?~zcfBdb
zWS!@@8dfHxu-Pszo4_CC*6UabTA%qE0n{%dso%qM3j+dC4d#jHHzsxEww#z4>6+dZ
z`r6UG!4_tT`zI<d*6Z^lvr4mJwVilHky=e>)rVUODWP)53B(Q)#CWP>EEPGN?x~5k
znzp4M<ONXRzlaVKl!o<1F)*Q!9<PA~?YdE#5y?Vdp988*_zK4&y-}&Fs`f%{`FaZe
zD>vWwR79!YvFPR(|L^}Kv0evyx%CUc*n_IE*f*q=Zz_PY6m6LhUMf!15`Kr~NWqV;
zQk(*Eq=cg)@lBflP>5PGf@8h-)q9Vf2AnLlT2uEWnr5Q7Q1Say)<`%qY*$F-bJGv~
z_}DdRn;};@82Uz&>YkJdylU9ktH%e2c(+_RVDp7$vmRd#>mGgfWxa{34pa{v)PLCO
zNHoaJ!X~FdQyEkxourb~QMX0k)RJao=>_4?+)?p)O95<E9?62_jtvI?FkdHZw%a@G
z|H1zEXao8EvB+om=Ebwjh?sso1u4bis8VZ8np9{ddPzZIv`Tt3>XpF~hRhJliLrbx
z!SFx5@w%q;n|FUa{-GGt&KRdYUil~s|Gv>Sun28C*XKG#BWfj1MR;m#J9@^IK9kn;
zk*NBXn@w>c>N+!gj+LnSEfzVq0*|6bT?MDV4$!L#xrzv?FZGYAic<u#l8iI|0%pn6
z<<Mh_Yi-j>UKEazS|T}RpB3n&)%(Nwmw*E*1!VtQOL$YWb-gw8h%H{6x?gPBjVHhG
zT?#x=DS>L|e-Oo$4UY<z2u)z^Q$DLzeX~&Aa)BvUEJV62)Fnyr*YB8fl@XLx8EwN+
zszEVyL&*1zqR&Vc*>4LvXP+Tc8UI;fde%R<J54aUWW?}KzdxacKwxuXn5-gpiiab;
z{ftEbH)dB6n~~!kDpX$|HUd?NncdV{!qaH!`qId16^L^L`XTHjmZI4-%kU8cP6Mgt
zI9pI#Cb5)<%waV@4Dw|}<d4G=y1qYXnm0!BjV##_yL=11UcO^^(Z-BG3v|@!s9XnH
z=isXN{a=!TCC<OP(^JCiHcvKau|jXNOaT7CW~*(+gf=VxB<PI~vQ>YWrLtz8LF?%!
zAKp6bfz?Gx|DmtP<ut#x+)-?{RJB;{TO#vH@qlb$^TatJDMU{yS_d1g%r>B)C3u#f
z)_mgJHHQEyVG}=38^6&uuA_pzl1kWOUmT>m^SfG5L*~F_hjg;WY{>-K3`a<@GY%3g
zB~<k}c#6Et#-ln5CsOd+5vU~++udD{9Qs4EtYS9)R4cB|=Qml$eX7t4(q1+4i;#Ox
z5SRDs36B^G4R%SdK_*AaqjCdJng2xLpxy^X+hl7ig#q(X?rJ30`uc;22KKM>M56k`
zt`8`#CK$+K?B3RM2rIElwW!!lvV^;YYnSavKTp*|)_EZfk-!j-pU$E;`Ea~PAESw|
zbey=z{{@{t@f{m=Cx1lI`M@?iVCxzrDK16<r?~L$sY&x#iu2b>rcCTAQLrHRP+~s!
zL%)Q5{JgSl(u=);td!gv=MWH4@+NYm)1u^_Whu}X;wSt0Hh5Ij#?MYRP#mgH@z3&<
znU9+e5eLCE+S}lbL5*w&TBpU>pH0!&(Kt+*>Xb~9fE?ru_#F70tNf#>%3l#Pu6|?d
zcR^fgSFE@SRUhy+!k$PR2|;%E6L5gD-g&Dr#1N^E@UHeRUoPHW!wYry1-lEWCQzRW
zE2;=&LS`{MI%6TXNwYXV>nY3aQoDeF`i;A`Z8$JrZ=$B<T;!?EFG1LbC28mphx_Zn
zhg1>83jENGaZbDCf9WyTRBXUnU@#J3RIj!J-=@`dTwwlXk~Vyb`JdDJO+LMDa6M-+
zNZwUk0Hr2A7*k_LSv1IUDbirpNFp+k(+Tcj&b&qT!(lv>(ZWRTp!3kd6M&)8Ur`j2
z8|SOhXb`J};9g*ObEOJuI9Jy)11%z&bzL+8Ldb$J4>{Elc=Mk$FI|r+Ru@g+%C_36
zVF=}U4ZAMoSj|pX3&9DcmsiYKlU5{~xmM8<F?VE;sNC@O7rY^b3^*bY739tXRL}%k
z_kGE2_<j=??g(<e{!C-#1ug>2z18Q;xA$>#E2F9--}c*GAluKCIECzgjvo~#K>Q5Y
zU^%W9hq)ar(bNR)?vyF~lN!1ai@i)liUd17TkW~r3*mvVoSG}V8E{4(MYAxqetS=0
z!}pIjumInmWNaK1r+4Gi47siGeA1<8F-tVnwM>8^!1BUYI7?vEe#k!PGNQ5m;CRs#
zuB;6<E^-F0*O^T4bxLCvnzk+jV1zyF7z;_~^Wg9sMvAs!METxB@@Ds$sTHh}f5W+P
zfkpgy?$-g84gwJFOaws5IrNC45(P{ci?YPD3YgUL$FRi`_|~!m90DuU8f*xh{h>&}
z5spuh$#_rYh-6NRUu*>r3MSE>S8zl{1!jS;G*faQTw2Hm03)A2KXflJg;nFpq@k|d
z`;_8N_6O+tNYo(}6>S-4{o26kM4<v?s!kcQf{0b{F22(N;oHESu^w2-56(MII9{u<
z-bSV*Kzd}14&;R)IYyykpO{QQ*Agm;Nhc)uL-ek!>Uo&FEaKnKGqauwSu57f_S1O5
zhkvKXmc%R+mLn<<Lq2QRUm=5Dwvv~H{=4s(RkX2{{>3dOW6q{no<=Q&sm2W9jC{uE
z`t-~2!xTBg04B`7GWtFqt*{)hNjnY(+~v@cDlyA)GHjQ1hifkzbo8IjrYu-R`7vi^
zLo2d2k%9M=THG2Yt3tL1SqI{RX#(4V1OMIRs@STo=#QzxXOWXQDy1ppQ|)`}J$wnP
zxpA4`M*Jq*`aAqp*Q6up`9Vuf?B=+tF6iN?Od;R>7nlfn;I8-eSuki??Cx~6#bGjw
zkI2O5*N@&8Pv1QA9lQz6v^&}Kq)72Ug>Rfzn~y@#+5bX=pP*lZ960#o_3Z)eyUEJi
z(3=6umwJqsLj?&xsK{o6-F)fI$q!TaNxo_E$J6a=-ApjFtU1dB4Q=s714_d`NR$*d
z$@A)`ulh07^KEP1z}vO!1m~|M)z_Qd{#(!I-k(;R?FJ$+dv6STZ?5xSMdRN*4!`B$
zb?$lE<4{vmquusB$Q2L~iHX!T@!gAbKkqnrD=Yf^XMS4Z_33(ABKTk`_xk!;)?+L1
zZgOG*137FmTYz?(#q@scujs%qLq-Yfg%ayd{?lka)pi6X8MZ4lo}%iO-xMvjaY2?>
zLZa9GV5-I82hBE7@82Q8zh|F<9~ZRL<Oa{y+Mv*$J+@E!RxiY;YlQu+^o|bwt>Ahm
zc1ID?RthXbQ=s9S@S4Z|rGtSboBpNzaJGbS_g+f=V38bmHJ_pMft6Rw4pp=Nh8-i?
zI!(F3tgL@vljr;K@%AjT-FiHY&tZvbdu{8*i}WQ<%xl;Ym|fcOGZY>B@}DAb0`I!E
z<OZ>&=Xr}JI&N1Ta4tWiyk*S0-Ov6MG;X+g1?C9&^|LSR7WGS<8nd#|W{TeM^_0jP
z9Lj*-eS({<XM&q|#KhJWZ0RO`Of=$`gLs$w@6wGzBilB-$Z!Hr47a2QD=L^Cmn~j=
zPz|%|TTl&&`j<NDZ)}&d$oknN&=153rk*vHpCknj^7~m{bOj$T(oaehj1G?drlzMk
zu9i20JgQi&bF)i*w;ngYL{dKeM2WJ!JKx|IKPB@&ja|VGIuO~C8iXP2=5jxYR$)7#
zQDdK6)aQ4qmg-8o>rVFOpVA*aw=Kc2x2n19j^I3g|MwHUuaCV6k?E#E_l!F!P|Y-5
z`q-XWn294JBTb)=b#X2m$Jq`0?rw1{Q%eZrDMa|i#JXK~hJD<p^TfymoSzm=pBH`H
zw|WAHEMx9Dkowd39rb~R`~7J}=HoHu<LKt&pX;qnm#+c@?`+JkcYfu(5>2g8m|Vu~
z1#W08`7ZmhUoDFV|2MLz!&sgv$-#p>|M<wf;1^$6qc-Oa*WL!`NQPncM)2!1;5SR}
z70cy**c)*m0H)_7MtAYMj%f<<0Ac`aV0Ccc5#ETp{QUk|E$Axc>bpSqk;=5_^#tsy
zY1_2VcUk_s+mO2V6}5=N5@>$5+M*Co?t7iRg#i%QTrP?}(nvG#`Q3*?L`b;1iO$|`
z1{;*yg@VL`2Eb=+ZIj>eMfvkS6vzo6#%LuUzn~sXvdatFXzV>_JP~yiBl303m+1VE
z);OgyKN$IQCqW`;n8arA`)#dpSNvm~nEY@K>vi`<;2S{DQF_qmX26+)smNH)yqd%_
z<|m(lGKuFSnJ-w+mz1wufOS_W#Z~#hmp89h9IsaoHzx=C`!B!Wy#8+A!5h^~6WAmV
zB)PlT>UH>0OREs?2y<yaKT?4Bb>?*S??-=Bt}#vYH=@4*7+fg=n?5^~&$E<Ho8N?j
ziW5YFPkH@qvb#^Rx=*sZ%Z7O~_ZhOY^UrPbdVJoQoQE%wT-}gop^x<f07$$_vQpZ&
z%X$A}8<eoV6O%h(z%tBv^=)!JuO|f%zGDik*Z&o`&Cpl5U*T23$dM0vn9nx}y5EcR
zd40ZvqFw~QKH^+18GdR>Ahn(<l=)K0e#-b;fij;n&B0eefB3HFt~=6a!}AB9%Jt-@
zpeC}tEJt~L`Ck!a&WD@+e}Dh-?mjV&^nsD-`AXA4`}O1K;mNx3w0XkWy+YfV=2B*)
z*TrVwtQ=8|VH<nU;y+p(DvAiSOo;iw7Y^g&1u*E3IF!654CT!*YM0lU^x#Fnfyk}K
zq7dcF?=N+|FAx6b9Sm5*KBq%OrU4h-cbgvbD&AXx-sD?d-W)V}o=f@z!@9qW6OvL)
zHrJfH&ScYJ(2t93_r5UMR=ckUuE=u3bp0t{hYaVk=kYuxi6KAW3g$2|rX*K%F%uVT
zw6*S@Vqe5s5B_5#n_oMWuYxq^%MF&VFVFeUr#4kv%Pi0G@>Ub0++0jgoBkK?ARK{5
z%GBX7J|ybJsdV4|v|Clz)9JJZ14sA$<R|$-L+6e?TFQGMjfv|J0nAZh*M;x2KlbIr
zNgXA>cwSq#LC&8mnBC(TI%BzF9^ysLsUWZyIrPd8ZaqzIkwdfJzA0jDsfUFU?EV;z
z9^y}%fp;4=`GL1EKY@zhHfZeMW&Y=xSpJUF{{!iyjV|x$sejk`W_NaE(4BX1+e2Kp
z@TY@z81I;PE`Ep<gz<tUH2yHD{iL=l@^ICmPV9Pur}ye>9Y*%`#zm08QoG|n5XNsk
zEVc2gT*KlTXFTjrSGe4dwqrOp+dgg8Utab+f88%mzoSdL>^!NBaZYqvYn_~$a$c_g
zRruvC>Gh+joV@<=NQ#<xRAgPyP1Vlim$!b5>_?rRCsQ`HoyV2t*ZxzkKYWvJ$p0^L
zqYh!LE#iGHJE#_TtmSI8EO5KLX+D*K`O6&^ny0*b++pz$=1JY#(JX@px5v7@q#gG5
z%Q;==ohLBC^78UFJKPUc1U7gD1c;y)->#>WIl4Xk{QTBhohbi)N5LW&tpEELu_<*=
zY}Q)T?+@%9E}Iv*FktcU@W3!fx=)a!{ZHsz?@c>C=vmuVJjLeY<{eh{mV12HR7~|j
zJ@ode$k3YU1SEUm0~Nu(YzuyDJ9Ec+91da%k@a|rC55_@Lo?M)aJ%IxU>|La{!J61
zut|4@$aoHUn7e(^fa5~}cSKmLxNl{Jn2ZxPpem*8;0ws4T&4CxJ-Wp;hlJaAe>pNt
zhGF_`jVhKyyf%Fu33taWo%!<a>R&S<dR=JQ(t_?zIKA4m&Qh;%hcF(X)FHTUg_=Wv
zN9&&I0}7m3>+Mk%$(2S9#lL5-sO!|QZblsnxO<R~Uw^1Nx*3v~&SPY*Yxj#e5JiCU
z>Ogrlm{?@_xm9X;LOLY*B*Gosf}YLdzMcHOoK{x_x0EHq#1Wzh+OJiMudi?c1urW;
zQ9H1u1UdAG&lxt~cFi%_fh~FdKl-XDyCaVB&lDtN{}u%QuYlLDa2x)sEYx39O98M;
NNlsO^R@yA|e*ySlu;%~(

literal 0
HcmV?d00001

diff --git a/demo/documented/mixed-poisson/python/demo_mixed-poisson.py b/demo/documented/mixed-poisson/python/demo_mixed-poisson.py
new file mode 100644
index 0000000..e607675
--- /dev/null
+++ b/demo/documented/mixed-poisson/python/demo_mixed-poisson.py
@@ -0,0 +1,94 @@
+"""This demo program solves the mixed formulation of Poisson's
+equation:
+
+    sigma - grad(u) = 0
+       - div(sigma) = f
+
+The corresponding weak (variational problem)
+
+    <sigma, tau> + <div(tau), u>   = 0       for all tau
+                 - <div(sigma), v> = <f, v>  for all v
+
+is solved using BDM (Brezzi-Douglas-Marini) elements of degree k for
+(sigma, tau) and DG (discontinuous Galerkin) elements of degree k - 1
+for (u, v).
+
+Original implementation: ../cpp/main.cpp by Anders Logg and Marie Rognes
+"""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes 2010
+# Modified by Anders Logg 2011
+#
+# First added:  2007-11-14
+# Last changed: 2012-11-12
+
+# Begin demo
+
+from dolfin import *
+
+# Create mesh
+mesh = UnitSquareMesh(32, 32)
+
+# Define function spaces and mixed (product) space
+BDM = FunctionSpace(mesh, "BDM", 1)
+DG = FunctionSpace(mesh, "DG", 0)
+W = BDM * DG
+
+# Define trial and test functions
+(sigma, u) = TrialFunctions(W)
+(tau, v) = TestFunctions(W)
+
+# Define source function
+f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+
+# Define variational form
+a = (dot(sigma, tau) + div(tau)*u + div(sigma)*v)*dx
+L = - f*v*dx
+
+# Define function G such that G \cdot n = g
+class BoundarySource(Expression):
+    def __init__(self, mesh):
+        self.mesh = mesh
+    def eval_cell(self, values, x, ufc_cell):
+        cell = Cell(self.mesh, ufc_cell.index)
+        n = cell.normal(ufc_cell.local_facet)
+        g = sin(5*x[0])
+        values[0] = g*n[0]
+        values[1] = g*n[1]
+    def value_shape(self):
+        return (2,)
+
+G = BoundarySource(mesh)
+
+# Define essential boundary
+def boundary(x):
+    return x[1] < DOLFIN_EPS or x[1] > 1.0 - DOLFIN_EPS
+
+bc = DirichletBC(W.sub(0), G, boundary)
+
+# Compute solution
+w = Function(W)
+solve(a == L, w, bc)
+(sigma, u) = w.split()
+
+# Plot sigma and u
+plot(sigma)
+plot(u)
+interactive()
diff --git a/demo/documented/mixed-poisson/python/documentation.rst b/demo/documented/mixed-poisson/python/documentation.rst
new file mode 100644
index 0000000..9bbb676
--- /dev/null
+++ b/demo/documented/mixed-poisson/python/documentation.rst
@@ -0,0 +1,184 @@
+.. Documentation for the mixed Poisson demo from DOLFIN.
+
+.. _demo_pde_mixed-poisson_python_documentation:
+
+Mixed formulation for Poisson equation
+======================================
+
+This demo is implemented in a single Python file,
+:download:`demo_mixed-poisson.py`, which contains both the variational
+forms and the solver.
+
+.. include:: ../common.txt
+
+
+Implementation
+--------------
+
+This demo is implemented in the :download:`demo_mixed-poisson.py`
+file.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+Then, we need to create a :py:class:`Mesh <dolfin.cpp.Mesh>` covering
+the unit square. In this example, we will let the mesh consist of 32 x
+32 squares with each square divided into two triangles:
+
+.. code-block:: python
+
+    # Create mesh
+    mesh = UnitSquareMesh(32, 32)
+
+.. index::
+   pair: FunctionSpace; Brezzi-Douglas-Marini
+   pair: FunctionSpace; Discontinous Lagrange
+
+Next, we need to define the function spaces. We define the two
+function spaces :math:`\Sigma_h` and :math:`V_h` separately, before
+combining these into a mixed function space:
+
+.. code-block:: python
+
+    # Define function spaces and mixed (product) space
+    BDM = FunctionSpace(mesh, "BDM", 1)
+    DG = FunctionSpace(mesh, "DG", 0)
+    W = BDM * DG
+
+The second argument to :py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` specifies the type of
+finite element family, while the third argument specifies the
+polynomial degree. The UFL user manual contains a list of all
+available finite element families and more details.  The * operator
+creates a mixed (product) space ``W`` from the two separate spaces
+``BDM`` and ``DG``. Hence,
+
+.. math::
+
+    W = \{ (\tau, v) \ \text{such that} \ \tau \in BDM, v \in DG \}.
+
+Next, we need to specify the trial functions (the unknowns) and the
+test functions on this space. This can be done as follows
+
+.. code-block:: python
+
+    # Define trial and test functions
+    (sigma, u) = TrialFunctions(W)
+    (tau, v) = TestFunctions(W)
+
+In order to define the variational form, it only remains to define the
+source function :math:`f`. This is done just as for the :ref:`Poisson
+demo <demo_pde_poisson_python_documentation>`:
+
+.. code-block:: python
+
+    # Define source function
+    f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+
+We are now ready to define the variational forms a and L. Since,
+:math:`u_0 = 0` in this example, the boundary term on the right-hand
+side vanishes.
+
+.. code-block:: python
+
+    # Define variational form
+    a = (dot(sigma, tau) + div(tau)*u + div(sigma)*v)*dx
+    L = - f*v*dx
+
+It only remains to prescribe the boundary condition for the
+flux. Essential boundary conditions are specified through the class
+:py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>` which takes three
+arguments: the function space the boundary condition is supposed to be
+applied to, the data for the boundary condition, and the relevant part
+of the boundary.
+
+We want to apply the boundary condition to the first subspace of the
+mixed space. Subspaces of a :py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` can be accessed
+by the method :py:func:`sub
+<dolfin.functions.functionspace.FunctionSpaceBase.sub>`. In our case,
+this reads ``W.sub(0)``. (Do *not* use the separate space ``BDM`` as
+this would mess up the numbering.)
+
+Next, we need to construct the data for the boundary condition. An
+essential boundary condition is handled by replacing degrees of
+freedom by the degrees of freedom evaluated at the given data. The
+:math:`BDM` finite element spaces are vector-valued spaces and hence
+the degrees of freedom act on vector-valued objects. The effect is
+that the user is required to construct a :math:`G` such that :math:`G
+\cdot n = g`.  Such a :math:`G` can be constructed by letting :math:`G
+= g n`. In particular, it can be created by subclassing the
+:py:class:`Expression <dolfin.functions.expression.Expression>`
+class. Overloading the ``eval_cell`` method (instead of the usual
+``eval``) allows us to extract more geometry information such as the
+facet normals. Since this is a vector-valued expression, we also need
+to overload the ``value_shape`` method.
+
+.. index::
+   single: Expression; (in Mixed Poisson demo)
+
+.. code-block:: python
+
+    # Define function G such that G \cdot n = g
+    class BoundarySource(Expression):
+           def __init__(self, mesh):
+               self.mesh = mesh
+           def eval_cell(self, values, x, ufc_cell):
+               cell = Cell(self.mesh, ufc_cell.index)
+               n = cell.normal(ufc_cell.local_facet)
+               g = sin(5*x[0])
+               values[0] = g*n[0]
+               values[1] = g*n[1]
+           def value_shape(self):
+               return (2,)
+
+     G = BoundarySource(mesh)
+
+Specifying the relevant part of the boundary can be done as for the
+Poisson demo (but now the top and bottom of the unit square is the
+essential boundary):
+
+.. code-block:: python
+
+    # Define essential boundary
+    def boundary(x):
+        return x[1] < DOLFIN_EPS or x[1] > 1.0 - DOLFIN_EPS
+
+Now, all the pieces are in place for the construction of the essential
+boundary condition:
+
+.. code-block:: python
+
+    bc = DirichletBC(W.sub(0), G, boundary)
+
+To compute the solution we use the bilinear and linear forms, and the
+boundary condition, but we also need to create a :py:class:`Function
+<dolfin.functions.function.Function>` to store the solution(s). The
+(full) solution will be stored in the ``w``, which we initialise using
+the :py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` ``W``. The actual
+computation is performed by calling :py:func:`solve
+<dolfin.fem.solving.solve>`. The separate components ``sigma`` and
+``u`` of the solution can be extracted by calling the :py:func:`split
+<dolfin.functions.function.Function.split>` function. Finally, we plot
+the solutions to examine the result.
+
+.. code-block:: python
+
+    # Compute solution
+    w = Function(W)
+    solve(a == L, w, bc)
+    (sigma, u) = w.split()
+
+    # Plot sigma and u
+    plot(sigma)
+    plot(u)
+    interactive()
+
+Complete code
+-------------
+.. literalinclude:: demo_mixed-poisson.py
+   :start-after: # Begin demo
diff --git a/demo/documented/navier-stokes/common.txt b/demo/documented/navier-stokes/common.txt
new file mode 100644
index 0000000..5de4f01
--- /dev/null
+++ b/demo/documented/navier-stokes/common.txt
@@ -0,0 +1,91 @@
+This demo solves the incompressible Navier-Stokes equations. It
+illustrates how to:
+
+* Implement a splitting method where different fields are coupled
+  via a set of partial differential equations
+* Use different iterative solvers and different preconditioners for
+  different steps of the solution process
+* Use time-dependent Expressions
+* Set boundary conditions based on geometric constraints
+* Perform time-stepping
+
+Equation and solution method
+----------------------------
+
+We consider the incompressible Navier-Stokes equations on a domain
+:math:`\Omega \subset \mathbb{R}^2`, consisting of a pair of momentum
+and continuity equations:
+
+.. math::
+
+    \dot{u} + \nabla u \cdot u - \nu \Delta u + \nabla p &= f, \\
+    \nabla \cdot u = 0.
+
+Here, :math:`u` is the unknown velocity, :math:`p` is the unknown
+pressure, :math:`\nu` is the kinematic viscosity, and :math:`f` is a
+given source. There exist many solution strategies for the
+incompressible Navier-Stokes equations. One of the oldest is the
+splitting method proposed by Chorin (1968) and Temam (1969), often
+refered to as Chorin's method.
+
+In Chorin's method, one first ignores the pressure in the momentum
+equation and computes the *tentative velocity* :math:`u_h^{\star}`
+according to:
+
+.. math::
+
+    \langle (u_h^{\star} - u_h^{n-1}) / \Delta t_n, v \rangle +
+    \langle \nabla u_h^{n-1} \cdot u_h^{n-1}, v \rangle +
+    \langle \nu \nabla u_h^n, \nabla v \rangle =
+    \langle f, v \rangle .
+
+Here, :math:`\langle \cdot, \cdot \rangle` denotes the
+:math:`L^2(\Omega)` inner product.  Subsequently, the velocity is
+projected to the space of divergence free fields. This step may be
+obtained by subtracting the variational problem for the tentative
+velocity :math:`u_h^{\star}` from the incompressible Navier-Stokes
+equations and using the continuity equation. One obtains the following
+pair of equations for computing the velocity :math:`u_h^n` and
+pressure :math:`p_h^n` at time :math:`t = t_n` based on the tentative
+velocity :math:`u_h^{\star}`:
+
+.. math::
+
+    \langle \nabla p^n, \nabla q \rangle &=
+      - \langle \nabla \cdot u_h^{\star}, q \rangle / \Delta t_n, \\
+    \langle u_h^n, v \rangle &=
+       \langle u_h^{\star}, v \rangle - \Delta t_n \langle \nabla p^n, v \rangle.
+
+Problem definition
+------------------
+
+In this demo, we solve the incompressible Navier-Stokes equations on
+an L-shaped domain. The L-shape is the subset of the unit square
+obtained by removing the upper right quadrant.
+
+The flow is driven by an oscillating pressure
+:math:`p_{\mathrm{in}}(t) = \sin 3t` at the inflow :math:`y = 1` while
+the pressure is kept constant :math:`p_{\mathrm{out}} = 0` at the
+outflow :math:`x = 1`.
+
+At the inflow and outflow, we impose free flow ("do nothing") boundary
+conditions for the velocity and no-slip boundary conditions on the
+remaining boundary.
+
+The (kinematic) viscosity is set to :math:`\nu = 0.01`, the time step
+is :math:`\Delta t = 0.01` and the length of the time interval is
+:math:`T = 3`. The solution is computed using continuous vector-valued
+piecewise quadratics for the velocity, and continuous scalar piecewise
+linears for the pressure (the Taylor-Hood elements).
+
+With the above input the solution for the velocity :math:`u` and pressure
+:math:`p` will look as follows:
+
+.. image:: ../navier-stokes_u.png
+    :scale: 75
+    :align: center
+
+.. image:: ../navier-stokes_p.png
+    :scale: 75
+    :align: center
+
diff --git a/demo/documented/navier-stokes/cpp/CMakeLists.txt b/demo/documented/navier-stokes/cpp/CMakeLists.txt
new file mode 100644
index 0000000..beb7484
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_navier-stokes)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/navier-stokes/cpp/PressureUpdate.h b/demo/documented/navier-stokes/cpp/PressureUpdate.h
new file mode 100644
index 0000000..bf4e5f1
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/PressureUpdate.h
@@ -0,0 +1,7858 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __PRESSUREUPDATE_H
+#define __PRESSUREUPDATE_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class pressureupdate_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  pressureupdate_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new pressureupdate_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class pressureupdate_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  pressureupdate_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new pressureupdate_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new pressureupdate_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new pressureupdate_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class pressureupdate_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  pressureupdate_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new pressureupdate_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class pressureupdate_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  pressureupdate_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new pressureupdate_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class pressureupdate_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  pressureupdate_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new pressureupdate_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class pressureupdate_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  pressureupdate_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new pressureupdate_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new pressureupdate_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new pressureupdate_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class pressureupdate_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  pressureupdate_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new pressureupdate_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class pressureupdate_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  pressureupdate_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new pressureupdate_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class pressureupdate_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  pressureupdate_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class pressureupdate_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  pressureupdate_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.166666666666667, 0.166666666666667, 0.166666666666667};
+    // Quadrature points on the UFC reference element: (0.166666666666667, 0.166666666666667), (0.166666666666667, 0.666666666666667), (0.666666666666667, 0.166666666666667)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[3][3] = \
+    {{0.666666666666667, 0.166666666666667, 0.166666666666667},
+    {0.166666666666667, 0.166666666666667, 0.666666666666667},
+    {0.166666666666667, 0.666666666666667, 0.166666666666667}};
+    
+    static const double FE2_C0_D01[3][5] = \
+    {{-1.66666666666667, -0.333333333333333, 0.666666666666666, 2.0, -0.666666666666666},
+    {0.333333333333333, 1.66666666666667, 0.666666666666665, -2.0, -0.666666666666666},
+    {0.333333333333334, -0.333333333333333, 2.66666666666667, 0.0, -2.66666666666667}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[5] = {6, 8, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE2_C0_D10[3][5] = \
+    {{-1.66666666666667, -0.333333333333334, 0.666666666666666, -0.666666666666666, 2.0},
+    {0.333333333333334, -0.333333333333334, 2.66666666666666, -2.66666666666666, 0.0},
+    {0.333333333333334, 1.66666666666667, 0.666666666666666, -0.666666666666666, -2.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[5] = {6, 7, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[5] = {0, 1, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 8.
+    double G[4];
+    G[0] =  - K[0]*det/w[0][0];
+    G[1] =  - K[2]*det/w[0][0];
+    G[2] =  - K[1]*det/w[0][0];
+    G[3] =  - K[3]*det/w[0][0];
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 162
+    for (unsigned int ip = 0; ip < 3; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      
+      // Total number of operations to compute function values = 40
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F0 += FE2_C0_D10[ip][r]*w[1][nzc8[r]];
+        F1 += FE2_C0_D01[ip][r]*w[1][nzc7[r]];
+        F2 += FE2_C0_D10[ip][r]*w[1][nzc11[r]];
+        F3 += FE2_C0_D01[ip][r]*w[1][nzc10[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 8
+      double I[1];
+      // Number of operations: 8
+      I[0] = W3[ip]*(F0*G[0] + F1*G[1] + F2*G[2] + F3*G[3]);
+      
+      
+      // Number of operations for primary indices: 6
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[j] += FE0[ip][j]*I[0];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class pressureupdate_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  pressureupdate_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new pressureupdate_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new pressureupdate_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new pressureupdate_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new pressureupdate_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new pressureupdate_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class pressureupdate_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  pressureupdate_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~pressureupdate_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "02e8cbec465121e66ef7138d34a44f7b23ad14df6f0c0d3e8f89334b7ceac189c0af977563a810b8cb8d6c121e7a76619efd36196310f690b7849e12de055967";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new pressureupdate_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new pressureupdate_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new pressureupdate_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new pressureupdate_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new pressureupdate_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new pressureupdate_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new pressureupdate_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace PressureUpdate
+{
+
+class CoefficientSpace_k: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_k(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_k()
+  {
+  }
+
+};
+
+class CoefficientSpace_u1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u1()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new pressureupdate_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new pressureupdate_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new pressureupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new pressureupdate_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_k Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_u1 Form_L_FunctionSpace_2;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), k(*this, 0), u1(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new pressureupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& k, const dolfin::GenericFunction& u1):
+    dolfin::Form(1, 2), k(*this, 0), u1(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->k = k;
+    this->u1 = u1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new pressureupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> u1):
+    dolfin::Form(1, 2), k(*this, 0), u1(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->k = *k;
+    this->u1 = *u1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new pressureupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), k(*this, 0), u1(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new pressureupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& k, const dolfin::GenericFunction& u1):
+    dolfin::Form(1, 2), k(*this, 0), u1(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->k = k;
+    this->u1 = u1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new pressureupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> u1):
+    dolfin::Form(1, 2), k(*this, 0), u1(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->k = *k;
+    this->u1 = *u1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new pressureupdate_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "k")
+      return 0;
+    else if (name == "u1")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "k";
+    case 1:
+      return "u1";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_k;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_u1;
+
+  // Coefficients
+  dolfin::CoefficientAssigner k;
+  dolfin::CoefficientAssigner u1;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/navier-stokes/cpp/PressureUpdate.ufl b/demo/documented/navier-stokes/cpp/PressureUpdate.ufl
new file mode 100644
index 0000000..3bc1aa5
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/PressureUpdate.ufl
@@ -0,0 +1,41 @@
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-08-30
+# Last changed: 2010-09-01
+#
+# The bilinear form a(u, v) and linear form L(v) for the pressure
+# update step in Chorin's method for the incompressible Navier-Stokes
+# equations.
+#
+# Compile this form with FFC: ffc -l dolfin PressureUpdate.ufl.
+
+# Define function spaces (P2-P1)
+V = VectorElement("Lagrange", triangle, 2)
+Q = FiniteElement("Lagrange", triangle, 1)
+
+# Define trial and test functions
+p = TrialFunction(Q)
+q = TestFunction(Q)
+
+# Define coefficients
+k  = Constant(triangle)
+u1 = Coefficient(V)
+
+# Define bilinear and linear forms
+a = inner(grad(p), grad(q))*dx
+L = -(1/k)*div(u1)*q*dx
diff --git a/demo/documented/navier-stokes/cpp/TentativeVelocity.h b/demo/documented/navier-stokes/cpp/TentativeVelocity.h
new file mode 100644
index 0000000..b0a7211
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/TentativeVelocity.h
@@ -0,0 +1,7029 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __TENTATIVEVELOCITY_H
+#define __TENTATIVEVELOCITY_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class tentativevelocity_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  tentativevelocity_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new tentativevelocity_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class tentativevelocity_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  tentativevelocity_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new tentativevelocity_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class tentativevelocity_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  tentativevelocity_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new tentativevelocity_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new tentativevelocity_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new tentativevelocity_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class tentativevelocity_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  tentativevelocity_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new tentativevelocity_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class tentativevelocity_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  tentativevelocity_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new tentativevelocity_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class tentativevelocity_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  tentativevelocity_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new tentativevelocity_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new tentativevelocity_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new tentativevelocity_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class tentativevelocity_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  tentativevelocity_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W6[6] = {0.054975871827661, 0.054975871827661, 0.054975871827661, 0.111690794839005, 0.111690794839005, 0.111690794839005};
+    // Quadrature points on the UFC reference element: (0.816847572980459, 0.091576213509771), (0.091576213509771, 0.816847572980459), (0.091576213509771, 0.091576213509771), (0.10810301816807, 0.445948490915965), (0.445948490915965, 0.10810301816807), (0.445948490915965, 0.445948490915965)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0[6][6] = \
+    {{-0.074803807748196, 0.517632341987673, -0.0748038077481966, 0.299215230992787, 0.0335448115231483, 0.299215230992784},
+    {-0.074803807748196, -0.0748038077481966, 0.517632341987674, 0.299215230992787, 0.299215230992784, 0.0335448115231483},
+    {0.517632341987671, -0.0748038077481966, -0.0748038077481966, 0.0335448115231487, 0.299215230992787, 0.299215230992787},
+    {-0.0482083778155119, -0.0847304930939778, -0.0482083778155119, 0.192833511262048, 0.795480226200906, 0.192833511262048},
+    {-0.0482083778155119, -0.048208377815512, -0.0847304930939778, 0.192833511262048, 0.192833511262048, 0.795480226200906},
+    {-0.0847304930939778, -0.048208377815512, -0.0482083778155119, 0.795480226200906, 0.192833511262048, 0.192833511262048}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[6] = {0, 1, 2, 3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[6] = {6, 7, 8, 9, 10, 11};
+    
+    static const double FE1_C0_D01[6][5] = \
+    {{0.633695145960921, -0.633695145960916, 3.26739029192183, 0.0, -3.26739029192184},
+    {0.63369514596092, 2.26739029192184, 0.366304854039083, -2.90108543788276, -0.366304854039083},
+    {-2.26739029192183, -0.633695145960916, 0.366304854039083, 2.90108543788275, -0.366304854039083},
+    {-0.78379396366386, 0.78379396366386, 0.432412072672279, 0.0, -0.432412072672279},
+    {-0.783793963663859, -0.567587927327719, 1.78379396366386, 1.35138189099158, -1.78379396366386},
+    {0.567587927327721, 0.78379396366386, 1.78379396366386, -1.35138189099158, -1.78379396366386}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[5] = {6, 8, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE1_C0_D10[6][5] = \
+    {{0.63369514596092, 2.26739029192184, 0.366304854039083, -0.366304854039083, -2.90108543788276},
+    {0.633695145960921, -0.633695145960916, 3.26739029192183, -3.26739029192183, 0.0},
+    {-2.26739029192183, -0.633695145960916, 0.366304854039083, -0.366304854039083, 2.90108543788275},
+    {-0.78379396366386, -0.56758792732772, 1.78379396366386, -1.78379396366386, 1.35138189099158},
+    {-0.78379396366386, 0.78379396366386, 0.432412072672279, -0.432412072672279, 0.0},
+    {0.56758792732772, 0.78379396366386, 1.78379396366386, -1.78379396366386, -1.35138189099158}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[5] = {6, 7, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[5] = {0, 1, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 144; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 16.
+    double G[4];
+    G[0] = 0.01*det*(K[2]*K[2] + K[3]*K[3]);
+    G[1] = 0.01*det*(K[0]*K[2] + K[1]*K[3]);
+    G[2] = 0.01*det*(K[0]*K[0] + K[1]*K[1]);
+    G[3] = det/w[0][0];
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 4920
+    for (unsigned int ip = 0; ip < 6; ip++)
+    {
+      
+      // Number of operations to compute ip constants: 4
+      double I[4];
+      // Number of operations: 1
+      I[0] = G[0]*W6[ip];
+      
+      // Number of operations: 1
+      I[1] = G[1]*W6[ip];
+      
+      // Number of operations: 1
+      I[2] = G[2]*W6[ip];
+      
+      // Number of operations: 1
+      I[3] = G[3]*W6[ip];
+      
+      
+      // Number of operations for primary indices: 216
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        for (unsigned int k = 0; k < 6; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc6[k]] += FE1_C0[ip][j]*FE1_C0[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc9[k]] += FE1_C0[ip][j]*FE1_C0[ip][k]*I[3];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 600
+      for (unsigned int j = 0; j < 5; j++)
+      {
+        for (unsigned int k = 0; k < 5; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc10[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[0];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc11[k]] += FE1_C0_D01[ip][j]*FE1_C0_D10[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc10[k]] += FE1_C0_D01[ip][k]*FE1_C0_D10[ip][j]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc11[k]] += FE1_C0_D10[ip][j]*FE1_C0_D10[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc7[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[0];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc8[k]] += FE1_C0_D01[ip][j]*FE1_C0_D10[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc7[k]] += FE1_C0_D01[ip][k]*FE1_C0_D10[ip][j]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*12 + nzc8[k]] += FE1_C0_D10[ip][j]*FE1_C0_D10[ip][k]*I[2];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class tentativevelocity_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  tentativevelocity_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W7[7] = {0.1125, 0.0629695902724136, 0.0629695902724136, 0.0629695902724136, 0.0661970763942531, 0.0661970763942531, 0.0661970763942531};
+    // Quadrature points on the UFC reference element: (0.333333333333333, 0.333333333333333), (0.797426985353087, 0.101286507323456), (0.101286507323456, 0.797426985353087), (0.101286507323456, 0.101286507323456), (0.0597158717897698, 0.470142064105115), (0.470142064105115, 0.0597158717897698), (0.470142064105115, 0.470142064105115)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0[7][6] = \
+    {{-0.111111111111111, -0.111111111111111, -0.111111111111111, 0.444444444444444, 0.444444444444444, 0.444444444444444},
+    {-0.0807685941918872, 0.474352608585538, -0.0807685941918871, 0.323074376767549, 0.0410358262631383, 0.323074376767549},
+    {-0.0807685941918872, -0.0807685941918872, 0.474352608585538, 0.323074376767549, 0.323074376767549, 0.0410358262631383},
+    {0.474352608585539, -0.0807685941918871, -0.0807685941918871, 0.0410358262631383, 0.323074376767549, 0.323074376767549},
+    {-0.0280749432230786, -0.0525839011025453, -0.0280749432230788, 0.112299772892315, 0.884134241764073, 0.112299772892315},
+    {-0.0280749432230787, -0.0280749432230788, -0.0525839011025453, 0.112299772892315, 0.112299772892315, 0.884134241764073},
+    {-0.0525839011025454, -0.0280749432230789, -0.0280749432230788, 0.884134241764072, 0.112299772892315, 0.112299772892315}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[6] = {0, 1, 2, 3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[6] = {6, 7, 8, 9, 10, 11};
+    
+    static const double FE1_C0_D01[7][5] = \
+    {{-0.333333333333333, 0.333333333333333, 1.33333333333333, 0.0, -1.33333333333333},
+    {0.594853970706175, -0.594853970706175, 3.18970794141235, 0.0, -3.18970794141235},
+    {0.594853970706174, 2.18970794141235, 0.405146029293824, -2.78456191211852, -0.405146029293825},
+    {-2.18970794141235, -0.594853970706175, 0.405146029293824, 2.78456191211852, -0.405146029293825},
+    {-0.880568256420461, 0.88056825642046, 0.238863487159078, 0.0, -0.238863487159078},
+    {-0.88056825642046, -0.76113651284092, 1.88056825642046, 1.64170476926138, -1.88056825642046},
+    {0.761136512840921, 0.88056825642046, 1.88056825642046, -1.64170476926138, -1.88056825642046}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[5] = {6, 8, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE1_C0_D10[7][5] = \
+    {{-0.333333333333333, 0.333333333333333, 1.33333333333333, -1.33333333333333, 0.0},
+    {0.594853970706174, 2.18970794141235, 0.405146029293824, -0.405146029293824, -2.78456191211852},
+    {0.594853970706175, -0.594853970706175, 3.18970794141235, -3.18970794141235, 0.0},
+    {-2.18970794141235, -0.594853970706175, 0.405146029293824, -0.405146029293824, 2.78456191211852},
+    {-0.880568256420461, -0.761136512840922, 1.88056825642046, -1.88056825642046, 1.64170476926138},
+    {-0.88056825642046, 0.880568256420461, 0.238863487159078, -0.238863487159078, 0.0},
+    {0.761136512840921, 0.88056825642046, 1.88056825642046, -1.88056825642046, -1.64170476926138}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[5] = {6, 7, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[5] = {0, 1, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 5.
+    double G[5];
+    G[0] =  - K[0]*det;
+    G[1] =  - K[2]*det;
+    G[2] = det/w[0][0];
+    G[3] =  - K[1]*det;
+    G[4] =  - K[3]*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 966
+    for (unsigned int ip = 0; ip < 7; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      
+      // Total number of operations to compute function values = 40
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F3 += FE1_C0_D10[ip][r]*w[1][nzc8[r]];
+        F4 += FE1_C0_D01[ip][r]*w[1][nzc7[r]];
+        F6 += FE1_C0_D10[ip][r]*w[1][nzc11[r]];
+        F7 += FE1_C0_D01[ip][r]*w[1][nzc10[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 48
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F0 += FE1_C0[ip][r]*w[2][nzc6[r]];
+        F1 += FE1_C0[ip][r]*w[2][nzc9[r]];
+        F2 += FE1_C0[ip][r]*w[1][nzc6[r]];
+        F5 += FE1_C0[ip][r]*w[1][nzc9[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 26
+      double I[2];
+      // Number of operations: 13
+      I[0] = W7[ip]*(F0*det + F2*(G[2] + F3*G[0] + F4*G[1]) + F5*(F3*G[3] + F4*G[4]));
+      
+      // Number of operations: 13
+      I[1] = W7[ip]*(F1*det + F2*(F6*G[0] + F7*G[1]) + F5*(G[2] + F6*G[3] + F7*G[4]));
+      
+      
+      // Number of operations for primary indices: 24
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc6[j]] += FE1_C0[ip][j]*I[0];
+        // Number of operations to compute entry: 2
+        A[nzc9[j]] += FE1_C0[ip][j]*I[1];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class tentativevelocity_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  tentativevelocity_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "2975a0716fb36262c618c28dbc58714e172982554b8c5398a13912292771a755aae852b1d331d5389db2e0f784528efa14f4f5b640cbef0d37ca8740e2a50764";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new tentativevelocity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new tentativevelocity_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new tentativevelocity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new tentativevelocity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new tentativevelocity_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new tentativevelocity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new tentativevelocity_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class tentativevelocity_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  tentativevelocity_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~tentativevelocity_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "a6851cf9f35ca760f8fd419c516d611eedf7a4c14b59f0e20781b93590f44c882c7c904c06f68f1b320474769183c4d69c875a619e35dd58abc53931ee2efc1a";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new tentativevelocity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new tentativevelocity_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new tentativevelocity_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new tentativevelocity_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new tentativevelocity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new tentativevelocity_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new tentativevelocity_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new tentativevelocity_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new tentativevelocity_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace TentativeVelocity
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_k: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_k(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_k()
+  {
+  }
+
+};
+
+class CoefficientSpace_u0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_k Form_a_FunctionSpace_2;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), k(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& k):
+    dolfin::Form(2, 1), k(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->k = k;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> k):
+    dolfin::Form(2, 1), k(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->k = *k;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), k(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& k):
+    dolfin::Form(2, 1), k(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->k = k;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> k):
+    dolfin::Form(2, 1), k(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->k = *k;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "k")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "k";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_k;
+
+  // Coefficients
+  dolfin::CoefficientAssigner k;
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new tentativevelocity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new tentativevelocity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_k Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_u0 Form_L_FunctionSpace_2;
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_3;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 3), k(*this, 0), u0(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& k, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 3), k(*this, 0), u0(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->k = k;
+    this->u0 = u0;
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 3), k(*this, 0), u0(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->k = *k;
+    this->u0 = *u0;
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 3), k(*this, 0), u0(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& k, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 3), k(*this, 0), u0(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->k = k;
+    this->u0 = u0;
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 3), k(*this, 0), u0(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->k = *k;
+    this->u0 = *u0;
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new tentativevelocity_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "k")
+      return 0;
+    else if (name == "u0")
+      return 1;
+    else if (name == "f")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "k";
+    case 1:
+      return "u0";
+    case 2:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_k;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_u0;
+  typedef Form_L_FunctionSpace_3 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner k;
+  dolfin::CoefficientAssigner u0;
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/navier-stokes/cpp/TentativeVelocity.ufl b/demo/documented/navier-stokes/cpp/TentativeVelocity.ufl
new file mode 100644
index 0000000..ce6fdfd
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/TentativeVelocity.ufl
@@ -0,0 +1,45 @@
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-08-30
+# Last changed: 2011-06-30
+#
+# The bilinear form a(u, v) and linear form L(v) for the tentative
+# velocity step in Chorin's method for the incompressible
+# Navier-Stokes equations.
+#
+# Compile this form with FFC: ffc -l dolfin TentativeVelocity.ufl.
+
+# Define function spaces (P2-P1)
+V = VectorElement("Lagrange", triangle, 2)
+Q = FiniteElement("Lagrange", triangle, 1)
+
+# Define trial and test functions
+u = TrialFunction(V)
+v = TestFunction(V)
+
+# Define coefficients
+k  = Constant(triangle)
+u0 = Coefficient(V)
+f  = Coefficient(V)
+nu = 0.01
+
+# Define bilinear and linear forms
+eq = (1/k)*inner(u - u0, v)*dx + inner(grad(u0)*u0, v)*dx + \
+    nu*inner(grad(u), grad(v))*dx - inner(f, v)*dx
+a  = lhs(eq)
+L  = rhs(eq)
diff --git a/demo/documented/navier-stokes/cpp/VelocityUpdate.h b/demo/documented/navier-stokes/cpp/VelocityUpdate.h
new file mode 100644
index 0000000..7893281
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/VelocityUpdate.h
@@ -0,0 +1,8040 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __VELOCITYUPDATE_H
+#define __VELOCITYUPDATE_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class velocityupdate_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  velocityupdate_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new velocityupdate_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class velocityupdate_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  velocityupdate_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new velocityupdate_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class velocityupdate_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  velocityupdate_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new velocityupdate_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class velocityupdate_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  velocityupdate_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocityupdate_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new velocityupdate_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new velocityupdate_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class velocityupdate_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  velocityupdate_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new velocityupdate_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class velocityupdate_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  velocityupdate_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new velocityupdate_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class velocityupdate_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  velocityupdate_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new velocityupdate_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class velocityupdate_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  velocityupdate_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocityupdate_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new velocityupdate_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new velocityupdate_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class velocityupdate_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  velocityupdate_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 24
+    // Total number of operations (multiply-add pairs):                  27
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_;
+    A[1] = -0.00277777777777778*G0_;
+    A[2] = -0.00277777777777778*G0_;
+    A[3] = -0.0111111111111111*G0_;
+    A[4] = 0.0;
+    A[5] = 0.0;
+    A[6] = 0.0;
+    A[7] = 0.0;
+    A[8] = 0.0;
+    A[9] = 0.0;
+    A[10] = 0.0;
+    A[11] = 0.0;
+    A[12] = -0.00277777777777778*G0_;
+    A[13] = 0.0166666666666667*G0_;
+    A[14] = -0.00277777777777781*G0_;
+    A[15] = 0.0;
+    A[16] = -0.0111111111111111*G0_;
+    A[17] = 0.0;
+    A[18] = 0.0;
+    A[19] = 0.0;
+    A[20] = 0.0;
+    A[21] = 0.0;
+    A[22] = 0.0;
+    A[23] = 0.0;
+    A[24] = -0.00277777777777778*G0_;
+    A[25] = -0.0027777777777778*G0_;
+    A[26] = 0.0166666666666667*G0_;
+    A[27] = 0.0;
+    A[28] = 0.0;
+    A[29] = -0.0111111111111111*G0_;
+    A[30] = 0.0;
+    A[31] = 0.0;
+    A[32] = 0.0;
+    A[33] = 0.0;
+    A[34] = 0.0;
+    A[35] = 0.0;
+    A[36] = -0.0111111111111111*G0_;
+    A[37] = 0.0;
+    A[38] = 0.0;
+    A[39] = 0.0888888888888888*G0_;
+    A[40] = 0.0444444444444443*G0_;
+    A[41] = 0.0444444444444443*G0_;
+    A[42] = 0.0;
+    A[43] = 0.0;
+    A[44] = 0.0;
+    A[45] = 0.0;
+    A[46] = 0.0;
+    A[47] = 0.0;
+    A[48] = 0.0;
+    A[49] = -0.0111111111111111*G0_;
+    A[50] = 0.0;
+    A[51] = 0.0444444444444443*G0_;
+    A[52] = 0.0888888888888887*G0_;
+    A[53] = 0.0444444444444443*G0_;
+    A[54] = 0.0;
+    A[55] = 0.0;
+    A[56] = 0.0;
+    A[57] = 0.0;
+    A[58] = 0.0;
+    A[59] = 0.0;
+    A[60] = 0.0;
+    A[61] = 0.0;
+    A[62] = -0.0111111111111111*G0_;
+    A[63] = 0.0444444444444443*G0_;
+    A[64] = 0.0444444444444443*G0_;
+    A[65] = 0.0888888888888887*G0_;
+    A[66] = 0.0;
+    A[67] = 0.0;
+    A[68] = 0.0;
+    A[69] = 0.0;
+    A[70] = 0.0;
+    A[71] = 0.0;
+    A[72] = 0.0;
+    A[73] = 0.0;
+    A[74] = 0.0;
+    A[75] = 0.0;
+    A[76] = 0.0;
+    A[77] = 0.0;
+    A[78] = 0.0166666666666666*G0_;
+    A[79] = -0.00277777777777778*G0_;
+    A[80] = -0.00277777777777778*G0_;
+    A[81] = -0.0111111111111111*G0_;
+    A[82] = 0.0;
+    A[83] = 0.0;
+    A[84] = 0.0;
+    A[85] = 0.0;
+    A[86] = 0.0;
+    A[87] = 0.0;
+    A[88] = 0.0;
+    A[89] = 0.0;
+    A[90] = -0.00277777777777778*G0_;
+    A[91] = 0.0166666666666667*G0_;
+    A[92] = -0.00277777777777781*G0_;
+    A[93] = 0.0;
+    A[94] = -0.0111111111111111*G0_;
+    A[95] = 0.0;
+    A[96] = 0.0;
+    A[97] = 0.0;
+    A[98] = 0.0;
+    A[99] = 0.0;
+    A[100] = 0.0;
+    A[101] = 0.0;
+    A[102] = -0.00277777777777778*G0_;
+    A[103] = -0.0027777777777778*G0_;
+    A[104] = 0.0166666666666667*G0_;
+    A[105] = 0.0;
+    A[106] = 0.0;
+    A[107] = -0.0111111111111111*G0_;
+    A[108] = 0.0;
+    A[109] = 0.0;
+    A[110] = 0.0;
+    A[111] = 0.0;
+    A[112] = 0.0;
+    A[113] = 0.0;
+    A[114] = -0.0111111111111111*G0_;
+    A[115] = 0.0;
+    A[116] = 0.0;
+    A[117] = 0.0888888888888888*G0_;
+    A[118] = 0.0444444444444443*G0_;
+    A[119] = 0.0444444444444443*G0_;
+    A[120] = 0.0;
+    A[121] = 0.0;
+    A[122] = 0.0;
+    A[123] = 0.0;
+    A[124] = 0.0;
+    A[125] = 0.0;
+    A[126] = 0.0;
+    A[127] = -0.0111111111111111*G0_;
+    A[128] = 0.0;
+    A[129] = 0.0444444444444443*G0_;
+    A[130] = 0.0888888888888887*G0_;
+    A[131] = 0.0444444444444443*G0_;
+    A[132] = 0.0;
+    A[133] = 0.0;
+    A[134] = 0.0;
+    A[135] = 0.0;
+    A[136] = 0.0;
+    A[137] = 0.0;
+    A[138] = 0.0;
+    A[139] = 0.0;
+    A[140] = -0.0111111111111111*G0_;
+    A[141] = 0.0444444444444443*G0_;
+    A[142] = 0.0444444444444443*G0_;
+    A[143] = 0.0888888888888887*G0_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class velocityupdate_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  velocityupdate_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    28
+    // Number of operations (multiply-add pairs) for tensor contraction: 66
+    // Total number of operations (multiply-add pairs):                  97
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    const double G0_2 = det*w[1][2]*(1.0);
+    const double G0_3 = det*w[1][3]*(1.0);
+    const double G0_4 = det*w[1][4]*(1.0);
+    const double G0_5 = det*w[1][5]*(1.0);
+    const double G0_6 = det*w[1][6]*(1.0);
+    const double G0_7 = det*w[1][7]*(1.0);
+    const double G0_8 = det*w[1][8]*(1.0);
+    const double G0_9 = det*w[1][9]*(1.0);
+    const double G0_10 = det*w[1][10]*(1.0);
+    const double G0_11 = det*w[1][11]*(1.0);
+    const double G1_0_0_0_0 = det*w[0][0]*w[2][0]*K[0]*(1.0);
+    const double G1_0_0_0_1 = det*w[0][0]*w[2][0]*K[2]*(1.0);
+    const double G1_0_0_1_0 = det*w[0][0]*w[2][1]*K[0]*(1.0);
+    const double G1_0_0_2_1 = det*w[0][0]*w[2][2]*K[2]*(1.0);
+    const double G1_0_1_0_0 = det*w[0][0]*w[2][0]*K[1]*(1.0);
+    const double G1_0_1_0_1 = det*w[0][0]*w[2][0]*K[3]*(1.0);
+    const double G1_0_1_1_0 = det*w[0][0]*w[2][1]*K[1]*(1.0);
+    const double G1_0_1_2_1 = det*w[0][0]*w[2][2]*K[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0 - 0.00277777777777778*G0_1 - 0.00277777777777778*G0_2 - 0.0111111111111111*G0_3;
+    A[1] = -0.00277777777777778*G0_0 + 0.0166666666666667*G0_1 - 0.00277777777777781*G0_2 - 0.0111111111111111*G0_4;
+    A[2] = -0.00277777777777778*G0_0 - 0.0027777777777778*G0_1 + 0.0166666666666667*G0_2 - 0.0111111111111111*G0_5;
+    A[3] = -0.0111111111111111*G0_0 + 0.0888888888888888*G0_3 + 0.0444444444444443*G0_4 + 0.0444444444444443*G0_5 + 0.166666666666666*G1_0_0_0_0 + 0.166666666666666*G1_0_0_0_1 - 0.166666666666666*G1_0_0_1_0 - 0.166666666666666*G1_0_0_2_1;
+    A[4] = -0.0111111111111111*G0_1 + 0.0444444444444443*G0_3 + 0.0888888888888887*G0_4 + 0.0444444444444443*G0_5 + 0.166666666666666*G1_0_0_0_0 + 0.166666666666666*G1_0_0_0_1 - 0.166666666666666*G1_0_0_1_0 - 0.166666666666666*G1_0_0_2_1;
+    A[5] = -0.0111111111111111*G0_2 + 0.0444444444444443*G0_3 + 0.0444444444444443*G0_4 + 0.0888888888888887*G0_5 + 0.166666666666666*G1_0_0_0_0 + 0.166666666666666*G1_0_0_0_1 - 0.166666666666666*G1_0_0_1_0 - 0.166666666666666*G1_0_0_2_1;
+    A[6] = 0.0166666666666666*G0_6 - 0.00277777777777778*G0_7 - 0.00277777777777778*G0_8 - 0.0111111111111111*G0_9;
+    A[7] = -0.00277777777777778*G0_6 + 0.0166666666666667*G0_7 - 0.00277777777777781*G0_8 - 0.0111111111111111*G0_10;
+    A[8] = -0.00277777777777778*G0_6 - 0.0027777777777778*G0_7 + 0.0166666666666667*G0_8 - 0.0111111111111111*G0_11;
+    A[9] = -0.0111111111111111*G0_6 + 0.0888888888888888*G0_9 + 0.0444444444444443*G0_10 + 0.0444444444444443*G0_11 + 0.166666666666666*G1_0_1_0_0 + 0.166666666666666*G1_0_1_0_1 - 0.166666666666666*G1_0_1_1_0 - 0.166666666666666*G1_0_1_2_1;
+    A[10] = -0.0111111111111111*G0_7 + 0.0444444444444443*G0_9 + 0.0888888888888887*G0_10 + 0.0444444444444443*G0_11 + 0.166666666666666*G1_0_1_0_0 + 0.166666666666666*G1_0_1_0_1 - 0.166666666666666*G1_0_1_1_0 - 0.166666666666666*G1_0_1_2_1;
+    A[11] = -0.0111111111111111*G0_8 + 0.0444444444444443*G0_9 + 0.0444444444444443*G0_10 + 0.0888888888888887*G0_11 + 0.166666666666666*G1_0_1_0_0 + 0.166666666666666*G1_0_1_0_1 - 0.166666666666666*G1_0_1_1_0 - 0.166666666666666*G1_0_1_2_1;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class velocityupdate_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  velocityupdate_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "386a3a1747d7d0b8a5d32a358801cc9f4acdb6495ca0c1e0ff70fb875f43e35f6b1fd49273952be2355ee318aab456b6e2fc8d024191099b832a061b20661050";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocityupdate_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new velocityupdate_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocityupdate_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new velocityupdate_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new velocityupdate_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class velocityupdate_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  velocityupdate_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocityupdate_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "2fc1c57b4ec05126c800aeca311c58f43758b8a48e564bd86026cbcb06a56f7c258d47961dadb2151928fd3ad8ba89d2d662893296dc6efc394ad72b24e7fb97";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocityupdate_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new velocityupdate_finite_element_1();
+        break;
+      }
+    case 2:
+      {
+        return new velocityupdate_finite_element_3();
+        break;
+      }
+    case 3:
+      {
+        return new velocityupdate_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocityupdate_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new velocityupdate_dofmap_1();
+        break;
+      }
+    case 2:
+      {
+        return new velocityupdate_dofmap_3();
+        break;
+      }
+    case 3:
+      {
+        return new velocityupdate_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new velocityupdate_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace VelocityUpdate
+{
+
+class CoefficientSpace_k: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_k(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_k(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_k(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_k()
+  {
+  }
+
+};
+
+class CoefficientSpace_p1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_p1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_p1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_p1()
+  {
+  }
+
+};
+
+class CoefficientSpace_u1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u1()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new velocityupdate_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new velocityupdate_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocityupdate_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocityupdate_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_k Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_u1 Form_L_FunctionSpace_2;
+
+typedef CoefficientSpace_p1 Form_L_FunctionSpace_3;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 3), k(*this, 0), u1(*this, 1), p1(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new velocityupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& k, const dolfin::GenericFunction& u1, const dolfin::GenericFunction& p1):
+    dolfin::Form(1, 3), k(*this, 0), u1(*this, 1), p1(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->k = k;
+    this->u1 = u1;
+    this->p1 = p1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new velocityupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> u1, std::shared_ptr<const dolfin::GenericFunction> p1):
+    dolfin::Form(1, 3), k(*this, 0), u1(*this, 1), p1(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->k = *k;
+    this->u1 = *u1;
+    this->p1 = *p1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new velocityupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 3), k(*this, 0), u1(*this, 1), p1(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new velocityupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& k, const dolfin::GenericFunction& u1, const dolfin::GenericFunction& p1):
+    dolfin::Form(1, 3), k(*this, 0), u1(*this, 1), p1(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->k = k;
+    this->u1 = u1;
+    this->p1 = p1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new velocityupdate_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> k, std::shared_ptr<const dolfin::GenericFunction> u1, std::shared_ptr<const dolfin::GenericFunction> p1):
+    dolfin::Form(1, 3), k(*this, 0), u1(*this, 1), p1(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->k = *k;
+    this->u1 = *u1;
+    this->p1 = *p1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new velocityupdate_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "k")
+      return 0;
+    else if (name == "u1")
+      return 1;
+    else if (name == "p1")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "k";
+    case 1:
+      return "u1";
+    case 2:
+      return "p1";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_k;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_u1;
+  typedef Form_L_FunctionSpace_3 CoefficientSpace_p1;
+
+  // Coefficients
+  dolfin::CoefficientAssigner k;
+  dolfin::CoefficientAssigner u1;
+  dolfin::CoefficientAssigner p1;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/navier-stokes/cpp/VelocityUpdate.ufl b/demo/documented/navier-stokes/cpp/VelocityUpdate.ufl
new file mode 100644
index 0000000..3e07333
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/VelocityUpdate.ufl
@@ -0,0 +1,42 @@
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-08-30
+# Last changed: 2010-09-01
+#
+# The bilinear form a(u, v) and linear form L(v) for the velocity
+# update step in Chorin's method for the incompressible Navier-Stokes
+# equations.
+#
+# Compile this form with FFC: ffc -l dolfin TentativeVelocity.ufl.
+
+# Define function spaces (P2-P1)
+V = VectorElement("Lagrange", triangle, 2)
+Q = FiniteElement("Lagrange", triangle, 1)
+
+# Define trial and test functions
+u = TrialFunction(V)
+v = TestFunction(V)
+
+# Define coefficients
+k  = Constant(triangle)
+u1 = Coefficient(V)
+p1 = Coefficient(Q)
+
+# Define bilinear and linear forms
+a = inner(u, v)*dx
+L = inner(u1, v)*dx - k*inner(grad(p1), v)*dx
diff --git a/demo/documented/navier-stokes/cpp/compile.log b/demo/documented/navier-stokes/cpp/compile.log
new file mode 100644
index 0000000..f047bd8
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/compile.log
@@ -0,0 +1,3024 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form PressureUpdate
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[q, p]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[q]'
+  Number of coefficients: 2
+  Coefficients:           '[c_0, w_1]'
+  Coefficient names:      '[k, u1]'
+  Unique elements:        'CG1(?), R0(?), Vector<2 x CG2(?)>'
+  Unique sub elements:    'CG1(?), R0(?), Vector<2 x CG2(?)>, CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for expression Division.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0154691 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000629 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 0.99999999999999989, 0.99999999999999989]], dtype=object)}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 0): array([[0.66666666666666685, 0.16666666666666674, 0.16666666666666669],
+         [0.16666666666666663, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666666, 0.66666666666666652, 0.16666666666666663]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.66666667e+00,   3.33333333e-01,   3.33333333e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,  -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.33333333e-01,   1.66666667e+00,  -3.33333333e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.66666667e-01,   6.66666667e-01,   2.66666667e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.00000000e+00,  -2.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -6.66666667e-01,  -6.66666667e-01,  -2.66666667e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.66666667e+00,   3.33333333e-01,   3.33333333e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,  -5.55111512e-17,  -5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.33333333e-01,   1.66666667e+00,  -3.33333333e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.66666667e-01,   6.66666667e-01,   2.66666667e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.00000000e+00,  -2.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -6.66666667e-01,  -6.66666667e-01,  -2.66666667e+00]]]), (1, 0): array([[[ -1.66666667e+00,   3.33333333e-01,   3.33333333e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.33333333e-01,  -3.33333333e-01,   1.66666667e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.66666667e-01,   2.66666667e+00,   6.66666667e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -6.66666667e-01,  -2.66666667e+00,  -6.66666667e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.00000000e+00,  -1.59906312e-16,  -2.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.66666667e+00,   3.33333333e-01,   3.33333333e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.33333333e-01,  -3.33333333e-01,   1.66666667e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.66666667e-01,   2.66666667e+00,   6.66666667e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -6.66666667e-01,  -2.66666667e+00,  -6.66666667e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.00000000e+00,  -1.59906312e-16,  -2.00000000e+00]]]), (0, 0): array([[[ 0.22222222, -0.11111111, -0.11111111],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[-0.11111111, -0.11111111,  0.22222222],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[-0.11111111,  0.22222222, -0.11111111],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.11111111,  0.44444444,  0.44444444],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.44444444,  0.44444444,  0.11111111],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.44444444,  0.11111111,  0.44444444],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.22222222, -0.11111111, -0.11111111]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [-0.11111111, -0.11111111,  0.22222222]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [-0.11111111,  0.22222222, -0.11111111]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.11111111,  0.44444444,  0.44444444]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.44444444,  0.44444444,  0.11111111]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.44444444,  0.11111111,  0.44444444]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.66666667e+00,   0.00000000e+00,  -3.33333333e-01,
+            6.66666667e-01,   2.00000000e+00,  -6.66666667e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.33333333e-01,  -5.55111512e-17,   1.66666667e+00,
+            6.66666667e-01,  -2.00000000e+00,  -6.66666667e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.33333333e-01,  -5.55111512e-17,  -3.33333333e-01,
+            2.66666667e+00,   0.00000000e+00,  -2.66666667e+00]]), 'FE2_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.66666667e+00,  -3.33333333e-01,   0.00000000e+00,
+            6.66666667e-01,  -6.66666667e-01,   2.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.33333333e-01,  -3.33333333e-01,   0.00000000e+00,
+            2.66666667e+00,  -2.66666667e+00,  -1.59906312e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.33333333e-01,   1.66666667e+00,   0.00000000e+00,
+            6.66666667e-01,  -6.66666667e-01,  -2.00000000e+00]]), 'FE2_C0_D01': array([[ -1.66666667e+00,   0.00000000e+00,  -3.33333333e-01,
+            6.66666667e-01,   2.00000000e+00,  -6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.33333333e-01,  -5.55111512e-17,   1.66666667e+00,
+            6.66666667e-01,  -2.00000000e+00,  -6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.33333333e-01,  -5.55111512e-17,  -3.33333333e-01,
+            2.66666667e+00,   0.00000000e+00,  -2.66666667e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE2_C0_D10': array([[ -1.66666667e+00,  -3.33333333e-01,   0.00000000e+00,
+            6.66666667e-01,  -6.66666667e-01,   2.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.33333333e-01,  -3.33333333e-01,   0.00000000e+00,
+            2.66666667e+00,  -2.66666667e+00,  -1.59906312e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.33333333e-01,   1.66666667e+00,   0.00000000e+00,
+            6.66666667e-01,  -6.66666667e-01,  -2.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.22222222, -0.11111111, -0.11111111,  0.11111111,
+           0.44444444,  0.44444444],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11111111, -0.11111111,  0.22222222,  0.44444444,
+           0.44444444,  0.11111111],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11111111,  0.22222222, -0.11111111,  0.44444444,
+           0.11111111,  0.44444444]]), 'FE2_C0': array([[ 0.22222222, -0.11111111, -0.11111111,  0.11111111,  0.44444444,
+           0.44444444,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.11111111, -0.11111111,  0.22222222,  0.44444444,  0.44444444,
+           0.11111111,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.11111111,  0.22222222, -0.11111111,  0.44444444,  0.11111111,
+           0.44444444,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ]]), 'FE3': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.66666667e+00,   0.00000000e+00,  -3.33333333e-01,
+            6.66666667e-01,   2.00000000e+00,  -6.66666667e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.33333333e-01,  -5.55111512e-17,   1.66666667e+00,
+            6.66666667e-01,  -2.00000000e+00,  -6.66666667e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.33333333e-01,  -5.55111512e-17,  -3.33333333e-01,
+            2.66666667e+00,   0.00000000e+00,  -2.66666667e+00]]), 'FE2_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.66666667e+00,  -3.33333333e-01,   0.00000000e+00,
+            6.66666667e-01,  -6.66666667e-01,   2.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.33333333e-01,  -3.33333333e-01,   0.00000000e+00,
+            2.66666667e+00,  -2.66666667e+00,  -1.59906312e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.33333333e-01,   1.66666667e+00,   0.00000000e+00,
+            6.66666667e-01,  -6.66666667e-01,  -2.00000000e+00]]), 'FE2_C0_D01': array([[ -1.66666667e+00,   0.00000000e+00,  -3.33333333e-01,
+            6.66666667e-01,   2.00000000e+00,  -6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.33333333e-01,  -5.55111512e-17,   1.66666667e+00,
+            6.66666667e-01,  -2.00000000e+00,  -6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.33333333e-01,  -5.55111512e-17,  -3.33333333e-01,
+            2.66666667e+00,   0.00000000e+00,  -2.66666667e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE2_C0_D10': array([[ -1.66666667e+00,  -3.33333333e-01,   0.00000000e+00,
+            6.66666667e-01,  -6.66666667e-01,   2.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.33333333e-01,  -3.33333333e-01,   0.00000000e+00,
+            2.66666667e+00,  -2.66666667e+00,  -1.59906312e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.33333333e-01,   1.66666667e+00,   0.00000000e+00,
+            6.66666667e-01,  -6.66666667e-01,  -2.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.22222222, -0.11111111, -0.11111111,  0.11111111,
+           0.44444444,  0.44444444],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11111111, -0.11111111,  0.22222222,  0.44444444,
+           0.44444444,  0.11111111],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11111111,  0.22222222, -0.11111111,  0.44444444,
+           0.11111111,  0.44444444]]), 'FE2_C0': array([[ 0.22222222, -0.11111111, -0.11111111,  0.11111111,  0.44444444,
+           0.44444444,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.11111111, -0.11111111,  0.22222222,  0.44444444,  0.44444444,
+           0.11111111,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.11111111,  0.22222222, -0.11111111,  0.44444444,  0.11111111,
+           0.44444444,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ]]), 'FE3': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE2_C1_D01': 'FE2_C1_D01', 'FE2_C1_D10': 'FE2_C1_D10', 'FE2_C0': 'FE2_C0', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C1_D10': 'FE1_C1_D10', 'FE2_C1': 'FE2_C1', 'FE2_C0_D01': 'FE2_C0_D01', 'FE3': 'FE3', 'FE0': 'FE0', 'FE2_C0_D10': 'FE2_C0_D10', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE2_C0_D01': array([[-1.66666667, -0.33333333,  0.66666667,  2.        , -0.66666667],
+         [ 0.33333333,  1.66666667,  0.66666667, -2.        , -0.66666667],
+         [ 0.33333333, -0.33333333,  2.66666667,  0.        , -2.66666667]]), 'FE2_C0_D10': array([[-1.66666667, -0.33333333,  0.66666667, -0.66666667,  2.        ],
+         [ 0.33333333, -0.33333333,  2.66666667, -2.66666667,  0.        ],
+         [ 0.33333333,  1.66666667,  0.66666667, -0.66666667, -2.        ]]), 'FE2_C0': array([[ 0.22222222, -0.11111111, -0.11111111,  0.11111111,  0.44444444,
+           0.44444444],
+         [-0.11111111, -0.11111111,  0.22222222,  0.44444444,  0.44444444,
+           0.11111111],
+         [-0.11111111,  0.22222222, -0.11111111,  0.44444444,  0.11111111,
+           0.44444444]]), 'FE3': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE2_C1_D01': ('FE2_C0_D01', (10, [6, 8, 9, 10, 11]), False, False), 'FE2_C1_D10': ('FE2_C0_D10', (11, [6, 7, 9, 10, 11]), False, False), 'FE2_C0': ('FE2_C0', (6, [0, 1, 2, 3, 4, 5]), False, False), 'FE1_C0': ('FE0', (0, [0, 1, 2]), False, False), 'FE1_C1': ('FE0', (3, [3, 4, 5]), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (4, [3, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (5, [3, 4]), False, False), 'FE2_C1': ('FE2_C0', (9, [6, 7, 8, 9, 10, 11]), False, False), 'FE2_C0_D01': ('FE2_C0_D01', (7, [0, 2, 3, 4, 5]), False, False), 'FE3': ('FE3', (), False, True), 'FE0': ('FE0', (), False, False), 'FE2_C0_D10': ('FE2_C0_D10', (8, [0, 1, 3, 4, 5]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (2, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.142801 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.00136781 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.29465 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00077796 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./PressureUpdate.h.
+  
+Compiler stage 5 finished in 0.00116491 seconds.
+
+FFC finished in 0.456587 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form TentativeVelocity
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 1
+  Coefficients:           '[c_0]'
+  Coefficient names:      '[k]'
+  Unique elements:        'Vector<2 x CG2(?)>, R0(?)'
+  Unique sub elements:    'Vector<2 x CG2(?)>, R0(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for expression Division.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 3
+  Coefficients:           '[c_0, w_1, w_2]'
+  Coefficient names:      '[k, u0, f]'
+  Unique elements:        'Vector<2 x CG2(?)>, R0(?)'
+  Unique sub elements:    'Vector<2 x CG2(?)>, R0(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for expression Division.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0118549 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {6: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[  6.33695146e-01,   6.33695146e-01,  -2.26739029e+00,
+            -7.83793964e-01,  -7.83793964e-01,   5.67587927e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.77555756e-16,  -2.22044605e-16,  -5.55111512e-17,
+             4.85722573e-17,  -1.11022302e-16,   1.31838984e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -6.33695146e-01,   2.26739029e+00,  -6.33695146e-01,
+             7.83793964e-01,  -5.67587927e-01,   7.83793964e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  3.26739029e+00,   3.66304854e-01,   3.66304854e-01,
+             4.32412073e-01,   1.78379396e+00,   1.78379396e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.77475828e-15,  -2.90108544e+00,   2.90108544e+00,
+            -2.49800181e-16,   1.35138189e+00,  -1.35138189e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.26739029e+00,  -3.66304854e-01,  -3.66304854e-01,
+            -4.32412073e-01,  -1.78379396e+00,  -1.78379396e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.33695146e-01,   6.33695146e-01,  -2.26739029e+00,
+            -7.83793964e-01,  -7.83793964e-01,   5.67587927e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-16,  -2.22044605e-16,  -5.55111512e-17,
+             4.85722573e-17,  -1.11022302e-16,   1.31838984e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -6.33695146e-01,   2.26739029e+00,  -6.33695146e-01,
+             7.83793964e-01,  -5.67587927e-01,   7.83793964e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  3.26739029e+00,   3.66304854e-01,   3.66304854e-01,
+             4.32412073e-01,   1.78379396e+00,   1.78379396e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.77475828e-15,  -2.90108544e+00,   2.90108544e+00,
+            -2.49800181e-16,   1.35138189e+00,  -1.35138189e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.26739029e+00,  -3.66304854e-01,  -3.66304854e-01,
+            -4.32412073e-01,  -1.78379396e+00,  -1.78379396e+00]]]), (1, 0): array([[[  6.33695146e-01,   6.33695146e-01,  -2.26739029e+00,
+            -7.83793964e-01,  -7.83793964e-01,   5.67587927e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.26739029e+00,  -6.33695146e-01,  -6.33695146e-01,
+            -5.67587927e-01,   7.83793964e-01,   7.83793964e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  3.66304854e-01,   3.26739029e+00,   3.66304854e-01,
+             1.78379396e+00,   4.32412073e-01,   1.78379396e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.66304854e-01,  -3.26739029e+00,  -3.66304854e-01,
+            -1.78379396e+00,  -4.32412073e-01,  -1.78379396e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.90108544e+00,  -4.92966998e-15,   2.90108544e+00,
+             1.35138189e+00,  -7.64507824e-16,  -1.35138189e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.33695146e-01,   6.33695146e-01,  -2.26739029e+00,
+            -7.83793964e-01,  -7.83793964e-01,   5.67587927e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.26739029e+00,  -6.33695146e-01,  -6.33695146e-01,
+            -5.67587927e-01,   7.83793964e-01,   7.83793964e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  3.66304854e-01,   3.26739029e+00,   3.66304854e-01,
+             1.78379396e+00,   4.32412073e-01,   1.78379396e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.66304854e-01,  -3.26739029e+00,  -3.66304854e-01,
+            -1.78379396e+00,  -4.32412073e-01,  -1.78379396e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.90108544e+00,  -4.92966998e-15,   2.90108544e+00,
+             1.35138189e+00,  -7.64507824e-16,  -1.35138189e+00]]]), (0, 0): array([[[-0.07480381, -0.07480381,  0.51763234, -0.04820838, -0.04820838,
+           -0.08473049],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.51763234, -0.07480381, -0.07480381, -0.08473049, -0.04820838,
+           -0.04820838],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.07480381,  0.51763234, -0.07480381, -0.04820838, -0.08473049,
+           -0.04820838],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.29921523,  0.29921523,  0.03354481,  0.19283351,  0.19283351,
+            0.79548023],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.03354481,  0.29921523,  0.29921523,  0.79548023,  0.19283351,
+            0.19283351],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.29921523,  0.03354481,  0.29921523,  0.19283351,  0.79548023,
+            0.19283351],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.07480381, -0.07480381,  0.51763234, -0.04820838, -0.04820838,
+           -0.08473049]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.51763234, -0.07480381, -0.07480381, -0.08473049, -0.04820838,
+           -0.04820838]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.07480381,  0.51763234, -0.07480381, -0.04820838, -0.08473049,
+           -0.04820838]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.29921523,  0.29921523,  0.03354481,  0.19283351,  0.19283351,
+            0.79548023]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.03354481,  0.29921523,  0.29921523,  0.79548023,  0.19283351,
+            0.19283351]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.29921523,  0.03354481,  0.29921523,  0.19283351,  0.79548023,
+            0.19283351]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[-0.07480381,  0.51763234, -0.07480381,  0.29921523,  0.03354481,
+           0.29921523,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.07480381, -0.07480381,  0.51763234,  0.29921523,  0.29921523,
+           0.03354481,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [ 0.51763234, -0.07480381, -0.07480381,  0.03354481,  0.29921523,
+           0.29921523,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.04820838, -0.08473049, -0.04820838,  0.19283351,  0.79548023,
+           0.19283351,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.04820838, -0.04820838, -0.08473049,  0.19283351,  0.19283351,
+           0.79548023,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.08473049, -0.04820838, -0.04820838,  0.79548023,  0.19283351,
+           0.19283351,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07480381,  0.51763234, -0.07480381,  0.29921523,
+           0.03354481,  0.29921523],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07480381, -0.07480381,  0.51763234,  0.29921523,
+           0.29921523,  0.03354481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.51763234, -0.07480381, -0.07480381,  0.03354481,
+           0.29921523,  0.29921523],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04820838, -0.08473049, -0.04820838,  0.19283351,
+           0.79548023,  0.19283351],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04820838, -0.04820838, -0.08473049,  0.19283351,
+           0.19283351,  0.79548023],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08473049, -0.04820838, -0.04820838,  0.79548023,
+           0.19283351,  0.19283351]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.33695146e-01,   2.26739029e+00,   0.00000000e+00,
+            3.66304854e-01,  -3.66304854e-01,  -2.90108544e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.33695146e-01,  -6.33695146e-01,   0.00000000e+00,
+            3.26739029e+00,  -3.26739029e+00,  -4.92966998e-15],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.26739029e+00,  -6.33695146e-01,   0.00000000e+00,
+            3.66304854e-01,  -3.66304854e-01,   2.90108544e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.83793964e-01,  -5.67587927e-01,   0.00000000e+00,
+            1.78379396e+00,  -1.78379396e+00,   1.35138189e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.83793964e-01,   7.83793964e-01,   0.00000000e+00,
+            4.32412073e-01,  -4.32412073e-01,  -7.64507824e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.67587927e-01,   7.83793964e-01,   0.00000000e+00,
+            1.78379396e+00,  -1.78379396e+00,  -1.35138189e+00]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.33695146e-01,   2.77555756e-16,  -6.33695146e-01,
+            3.26739029e+00,  -3.77475828e-15,  -3.26739029e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.33695146e-01,  -2.22044605e-16,   2.26739029e+00,
+            3.66304854e-01,  -2.90108544e+00,  -3.66304854e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.26739029e+00,  -5.55111512e-17,  -6.33695146e-01,
+            3.66304854e-01,   2.90108544e+00,  -3.66304854e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.83793964e-01,   4.85722573e-17,   7.83793964e-01,
+            4.32412073e-01,  -2.49800181e-16,  -4.32412073e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.83793964e-01,  -1.11022302e-16,  -5.67587927e-01,
+            1.78379396e+00,   1.35138189e+00,  -1.78379396e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.67587927e-01,   1.31838984e-16,   7.83793964e-01,
+            1.78379396e+00,  -1.35138189e+00,  -1.78379396e+00]]), 'FE1_C0_D01': array([[  6.33695146e-01,   2.77555756e-16,  -6.33695146e-01,
+            3.26739029e+00,  -3.77475828e-15,  -3.26739029e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.33695146e-01,  -2.22044605e-16,   2.26739029e+00,
+            3.66304854e-01,  -2.90108544e+00,  -3.66304854e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.26739029e+00,  -5.55111512e-17,  -6.33695146e-01,
+            3.66304854e-01,   2.90108544e+00,  -3.66304854e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.83793964e-01,   4.85722573e-17,   7.83793964e-01,
+            4.32412073e-01,  -2.49800181e-16,  -4.32412073e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.83793964e-01,  -1.11022302e-16,  -5.67587927e-01,
+            1.78379396e+00,   1.35138189e+00,  -1.78379396e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.67587927e-01,   1.31838984e-16,   7.83793964e-01,
+            1.78379396e+00,  -1.35138189e+00,  -1.78379396e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[  6.33695146e-01,   2.26739029e+00,   0.00000000e+00,
+            3.66304854e-01,  -3.66304854e-01,  -2.90108544e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.33695146e-01,  -6.33695146e-01,   0.00000000e+00,
+            3.26739029e+00,  -3.26739029e+00,  -4.92966998e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.26739029e+00,  -6.33695146e-01,   0.00000000e+00,
+            3.66304854e-01,  -3.66304854e-01,   2.90108544e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.83793964e-01,  -5.67587927e-01,   0.00000000e+00,
+            1.78379396e+00,  -1.78379396e+00,   1.35138189e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.83793964e-01,   7.83793964e-01,   0.00000000e+00,
+            4.32412073e-01,  -4.32412073e-01,  -7.64507824e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.67587927e-01,   7.83793964e-01,   0.00000000e+00,
+            1.78379396e+00,  -1.78379396e+00,  -1.35138189e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[-0.07480381,  0.51763234, -0.07480381,  0.29921523,  0.03354481,
+           0.29921523,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.07480381, -0.07480381,  0.51763234,  0.29921523,  0.29921523,
+           0.03354481,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [ 0.51763234, -0.07480381, -0.07480381,  0.03354481,  0.29921523,
+           0.29921523,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.04820838, -0.08473049, -0.04820838,  0.19283351,  0.79548023,
+           0.19283351,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.04820838, -0.04820838, -0.08473049,  0.19283351,  0.19283351,
+           0.79548023,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.08473049, -0.04820838, -0.04820838,  0.79548023,  0.19283351,
+           0.19283351,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07480381,  0.51763234, -0.07480381,  0.29921523,
+           0.03354481,  0.29921523],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07480381, -0.07480381,  0.51763234,  0.29921523,
+           0.29921523,  0.03354481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.51763234, -0.07480381, -0.07480381,  0.03354481,
+           0.29921523,  0.29921523],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04820838, -0.08473049, -0.04820838,  0.19283351,
+           0.79548023,  0.19283351],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04820838, -0.04820838, -0.08473049,  0.19283351,
+           0.19283351,  0.79548023],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08473049, -0.04820838, -0.04820838,  0.79548023,
+           0.19283351,  0.19283351]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.33695146e-01,   2.26739029e+00,   0.00000000e+00,
+            3.66304854e-01,  -3.66304854e-01,  -2.90108544e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.33695146e-01,  -6.33695146e-01,   0.00000000e+00,
+            3.26739029e+00,  -3.26739029e+00,  -4.92966998e-15],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.26739029e+00,  -6.33695146e-01,   0.00000000e+00,
+            3.66304854e-01,  -3.66304854e-01,   2.90108544e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.83793964e-01,  -5.67587927e-01,   0.00000000e+00,
+            1.78379396e+00,  -1.78379396e+00,   1.35138189e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.83793964e-01,   7.83793964e-01,   0.00000000e+00,
+            4.32412073e-01,  -4.32412073e-01,  -7.64507824e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.67587927e-01,   7.83793964e-01,   0.00000000e+00,
+            1.78379396e+00,  -1.78379396e+00,  -1.35138189e+00]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.33695146e-01,   2.77555756e-16,  -6.33695146e-01,
+            3.26739029e+00,  -3.77475828e-15,  -3.26739029e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.33695146e-01,  -2.22044605e-16,   2.26739029e+00,
+            3.66304854e-01,  -2.90108544e+00,  -3.66304854e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.26739029e+00,  -5.55111512e-17,  -6.33695146e-01,
+            3.66304854e-01,   2.90108544e+00,  -3.66304854e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.83793964e-01,   4.85722573e-17,   7.83793964e-01,
+            4.32412073e-01,  -2.49800181e-16,  -4.32412073e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.83793964e-01,  -1.11022302e-16,  -5.67587927e-01,
+            1.78379396e+00,   1.35138189e+00,  -1.78379396e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.67587927e-01,   1.31838984e-16,   7.83793964e-01,
+            1.78379396e+00,  -1.35138189e+00,  -1.78379396e+00]]), 'FE1_C0_D01': array([[  6.33695146e-01,   2.77555756e-16,  -6.33695146e-01,
+            3.26739029e+00,  -3.77475828e-15,  -3.26739029e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.33695146e-01,  -2.22044605e-16,   2.26739029e+00,
+            3.66304854e-01,  -2.90108544e+00,  -3.66304854e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.26739029e+00,  -5.55111512e-17,  -6.33695146e-01,
+            3.66304854e-01,   2.90108544e+00,  -3.66304854e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.83793964e-01,   4.85722573e-17,   7.83793964e-01,
+            4.32412073e-01,  -2.49800181e-16,  -4.32412073e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.83793964e-01,  -1.11022302e-16,  -5.67587927e-01,
+            1.78379396e+00,   1.35138189e+00,  -1.78379396e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.67587927e-01,   1.31838984e-16,   7.83793964e-01,
+            1.78379396e+00,  -1.35138189e+00,  -1.78379396e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[  6.33695146e-01,   2.26739029e+00,   0.00000000e+00,
+            3.66304854e-01,  -3.66304854e-01,  -2.90108544e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.33695146e-01,  -6.33695146e-01,   0.00000000e+00,
+            3.26739029e+00,  -3.26739029e+00,  -4.92966998e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.26739029e+00,  -6.33695146e-01,   0.00000000e+00,
+            3.66304854e-01,  -3.66304854e-01,   2.90108544e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.83793964e-01,  -5.67587927e-01,   0.00000000e+00,
+            1.78379396e+00,  -1.78379396e+00,   1.35138189e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.83793964e-01,   7.83793964e-01,   0.00000000e+00,
+            4.32412073e-01,  -4.32412073e-01,  -7.64507824e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.67587927e-01,   7.83793964e-01,   0.00000000e+00,
+            1.78379396e+00,  -1.78379396e+00,  -1.35138189e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE0_C1_D10': 'FE0_C1_D10', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE2': 'FE2', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[-0.07480381,  0.51763234, -0.07480381,  0.29921523,  0.03354481,
+           0.29921523],
+         [-0.07480381, -0.07480381,  0.51763234,  0.29921523,  0.29921523,
+           0.03354481],
+         [ 0.51763234, -0.07480381, -0.07480381,  0.03354481,  0.29921523,
+           0.29921523],
+         [-0.04820838, -0.08473049, -0.04820838,  0.19283351,  0.79548023,
+           0.19283351],
+         [-0.04820838, -0.04820838, -0.08473049,  0.19283351,  0.19283351,
+           0.79548023],
+         [-0.08473049, -0.04820838, -0.04820838,  0.79548023,  0.19283351,
+           0.19283351]]), 'FE0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C0_D01': array([[ 0.63369515, -0.63369515,  3.26739029,  0.        , -3.26739029],
+         [ 0.63369515,  2.26739029,  0.36630485, -2.90108544, -0.36630485],
+         [-2.26739029, -0.63369515,  0.36630485,  2.90108544, -0.36630485],
+         [-0.78379396,  0.78379396,  0.43241207,  0.        , -0.43241207],
+         [-0.78379396, -0.56758793,  1.78379396,  1.35138189, -1.78379396],
+         [ 0.56758793,  0.78379396,  1.78379396, -1.35138189, -1.78379396]]), 'FE1_C0_D10': array([[ 0.63369515,  2.26739029,  0.36630485, -0.36630485, -2.90108544],
+         [ 0.63369515, -0.63369515,  3.26739029, -3.26739029,  0.        ],
+         [-2.26739029, -0.63369515,  0.36630485, -0.36630485,  2.90108544],
+         [-0.78379396, -0.56758793,  1.78379396, -1.78379396,  1.35138189],
+         [-0.78379396,  0.78379396,  0.43241207, -0.43241207,  0.        ],
+         [ 0.56758793,  0.78379396,  1.78379396, -1.78379396, -1.35138189]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621],
+         [ 0.09157621,  0.09157621,  0.81684757],
+         [ 0.81684757,  0.09157621,  0.09157621],
+         [ 0.44594849,  0.10810302,  0.44594849],
+         [ 0.44594849,  0.44594849,  0.10810302],
+         [ 0.10810302,  0.44594849,  0.44594849]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE1_C0': ('FE1_C0', (6, [0, 1, 2, 3, 4, 5]), False, False), 'FE1_C1': ('FE1_C0', (9, [6, 7, 8, 9, 10, 11]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE1_C1_D10': ('FE1_C0_D10', (11, [6, 7, 9, 10, 11]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE2': ('FE2', (), False, True), 'FE1_C1_D01': ('FE1_C0_D01', (10, [6, 8, 9, 10, 11]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (7, [0, 2, 3, 4, 5]), False, False), 'FE1_C0_D10': ('FE1_C0_D10', (8, [0, 1, 3, 4, 5]), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {7: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.33333333,  0.10128651,  0.10128651,  0.79742699,  0.47014206,
+            0.47014206,  0.05971587],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.33333333,  0.79742699,  0.10128651,  0.10128651,  0.05971587,
+            0.47014206,  0.47014206],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.33333333,  0.10128651,  0.79742699,  0.10128651,  0.47014206,
+            0.05971587,  0.47014206],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.10128651,  0.10128651,  0.79742699,  0.47014206,
+            0.47014206,  0.05971587]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.79742699,  0.10128651,  0.10128651,  0.05971587,
+            0.47014206,  0.47014206]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.10128651,  0.79742699,  0.10128651,  0.47014206,
+            0.05971587,  0.47014206]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -3.33333333e-01,   5.94853971e-01,   5.94853971e-01,
+            -2.18970794e+00,  -8.80568256e-01,  -8.80568256e-01,
+             7.61136513e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  8.32667268e-17,   2.22044605e-16,  -2.22044605e-16,
+             5.55111512e-17,   1.52655666e-16,  -2.77555756e-16,
+             9.71445147e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  3.33333333e-01,  -5.94853971e-01,   2.18970794e+00,
+            -5.94853971e-01,   8.80568256e-01,  -7.61136513e-01,
+             8.80568256e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.33333333e+00,   3.18970794e+00,   4.05146029e-01,
+             4.05146029e-01,   2.38863487e-01,   1.88056826e+00,
+             1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.66533454e-16,   4.44089210e-16,  -2.78456191e+00,
+             2.78456191e+00,   3.33066907e-16,   1.64170477e+00,
+            -1.64170477e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.33333333e+00,  -3.18970794e+00,  -4.05146029e-01,
+            -4.05146029e-01,  -2.38863487e-01,  -1.88056826e+00,
+            -1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -3.33333333e-01,   5.94853971e-01,   5.94853971e-01,
+            -2.18970794e+00,  -8.80568256e-01,  -8.80568256e-01,
+             7.61136513e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  8.32667268e-17,   2.22044605e-16,  -2.22044605e-16,
+             5.55111512e-17,   1.52655666e-16,  -2.77555756e-16,
+             9.71445147e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  3.33333333e-01,  -5.94853971e-01,   2.18970794e+00,
+            -5.94853971e-01,   8.80568256e-01,  -7.61136513e-01,
+             8.80568256e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.33333333e+00,   3.18970794e+00,   4.05146029e-01,
+             4.05146029e-01,   2.38863487e-01,   1.88056826e+00,
+             1.88056826e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.66533454e-16,   4.44089210e-16,  -2.78456191e+00,
+             2.78456191e+00,   3.33066907e-16,   1.64170477e+00,
+            -1.64170477e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.33333333e+00,  -3.18970794e+00,  -4.05146029e-01,
+            -4.05146029e-01,  -2.38863487e-01,  -1.88056826e+00,
+            -1.88056826e+00]]]), (1, 0): array([[[ -3.33333333e-01,   5.94853971e-01,   5.94853971e-01,
+            -2.18970794e+00,  -8.80568256e-01,  -8.80568256e-01,
+             7.61136513e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  3.33333333e-01,   2.18970794e+00,  -5.94853971e-01,
+            -5.94853971e-01,  -7.61136513e-01,   8.80568256e-01,
+             8.80568256e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.33333333e+00,   4.05146029e-01,   3.18970794e+00,
+             4.05146029e-01,   1.88056826e+00,   2.38863487e-01,
+             1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.33333333e+00,  -4.05146029e-01,  -3.18970794e+00,
+            -4.05146029e-01,  -1.88056826e+00,  -2.38863487e-01,
+            -1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -2.15331488e-16,  -2.78456191e+00,  -4.37374128e-16,
+             2.78456191e+00,   1.64170477e+00,  -4.36972564e-16,
+            -1.64170477e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -3.33333333e-01,   5.94853971e-01,   5.94853971e-01,
+            -2.18970794e+00,  -8.80568256e-01,  -8.80568256e-01,
+             7.61136513e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  3.33333333e-01,   2.18970794e+00,  -5.94853971e-01,
+            -5.94853971e-01,  -7.61136513e-01,   8.80568256e-01,
+             8.80568256e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.33333333e+00,   4.05146029e-01,   3.18970794e+00,
+             4.05146029e-01,   1.88056826e+00,   2.38863487e-01,
+             1.88056826e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.33333333e+00,  -4.05146029e-01,  -3.18970794e+00,
+            -4.05146029e-01,  -1.88056826e+00,  -2.38863487e-01,
+            -1.88056826e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.15331488e-16,  -2.78456191e+00,  -4.37374128e-16,
+             2.78456191e+00,   1.64170477e+00,  -4.36972564e-16,
+            -1.64170477e+00]]]), (0, 0): array([[[-0.11111111, -0.08076859, -0.08076859,  0.47435261, -0.02807494,
+           -0.02807494, -0.0525839 ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.11111111,  0.47435261, -0.08076859, -0.08076859, -0.0525839 ,
+           -0.02807494, -0.02807494],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.11111111, -0.08076859,  0.47435261, -0.08076859, -0.02807494,
+           -0.0525839 , -0.02807494],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.44444444,  0.32307438,  0.32307438,  0.04103583,  0.11229977,
+            0.11229977,  0.88413424],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.44444444,  0.04103583,  0.32307438,  0.32307438,  0.88413424,
+            0.11229977,  0.11229977],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.44444444,  0.32307438,  0.04103583,  0.32307438,  0.11229977,
+            0.88413424,  0.11229977],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.11111111, -0.08076859, -0.08076859,  0.47435261, -0.02807494,
+           -0.02807494, -0.0525839 ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.11111111,  0.47435261, -0.08076859, -0.08076859, -0.0525839 ,
+           -0.02807494, -0.02807494]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.11111111, -0.08076859,  0.47435261, -0.08076859, -0.02807494,
+           -0.0525839 , -0.02807494]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.44444444,  0.32307438,  0.32307438,  0.04103583,  0.11229977,
+            0.11229977,  0.88413424]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.44444444,  0.04103583,  0.32307438,  0.32307438,  0.88413424,
+            0.11229977,  0.11229977]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.44444444,  0.32307438,  0.04103583,  0.32307438,  0.11229977,
+            0.88413424,  0.11229977]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[-0.11111111, -0.11111111, -0.11111111,  0.44444444,  0.44444444,
+           0.44444444,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.08076859,  0.47435261, -0.08076859,  0.32307438,  0.04103583,
+           0.32307438,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.08076859, -0.08076859,  0.47435261,  0.32307438,  0.32307438,
+           0.04103583,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [ 0.47435261, -0.08076859, -0.08076859,  0.04103583,  0.32307438,
+           0.32307438,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.02807494, -0.0525839 , -0.02807494,  0.11229977,  0.88413424,
+           0.11229977,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.02807494, -0.02807494, -0.0525839 ,  0.11229977,  0.11229977,
+           0.88413424,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.0525839 , -0.02807494, -0.02807494,  0.88413424,  0.11229977,
+           0.11229977,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11111111, -0.11111111, -0.11111111,  0.44444444,
+           0.44444444,  0.44444444],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08076859,  0.47435261, -0.08076859,  0.32307438,
+           0.04103583,  0.32307438],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08076859, -0.08076859,  0.47435261,  0.32307438,
+           0.32307438,  0.04103583],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.47435261, -0.08076859, -0.08076859,  0.04103583,
+           0.32307438,  0.32307438],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02807494, -0.0525839 , -0.02807494,  0.11229977,
+           0.88413424,  0.11229977],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02807494, -0.02807494, -0.0525839 ,  0.11229977,
+           0.11229977,  0.88413424],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.0525839 , -0.02807494, -0.02807494,  0.88413424,
+           0.11229977,  0.11229977]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -3.33333333e-01,   3.33333333e-01,   0.00000000e+00,
+            1.33333333e+00,  -1.33333333e+00,  -2.15331488e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,   2.18970794e+00,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,  -2.78456191e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,  -5.94853971e-01,   0.00000000e+00,
+            3.18970794e+00,  -3.18970794e+00,  -4.37374128e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.18970794e+00,  -5.94853971e-01,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,   2.78456191e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,  -7.61136513e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,   1.64170477e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,   8.80568256e-01,   0.00000000e+00,
+            2.38863487e-01,  -2.38863487e-01,  -4.36972564e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.61136513e-01,   8.80568256e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,  -1.64170477e+00]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -3.33333333e-01,   8.32667268e-17,   3.33333333e-01,
+            1.33333333e+00,  -1.66533454e-16,  -1.33333333e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,   2.22044605e-16,  -5.94853971e-01,
+            3.18970794e+00,   4.44089210e-16,  -3.18970794e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,  -2.22044605e-16,   2.18970794e+00,
+            4.05146029e-01,  -2.78456191e+00,  -4.05146029e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.18970794e+00,   5.55111512e-17,  -5.94853971e-01,
+            4.05146029e-01,   2.78456191e+00,  -4.05146029e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,   1.52655666e-16,   8.80568256e-01,
+            2.38863487e-01,   3.33066907e-16,  -2.38863487e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,  -2.77555756e-16,  -7.61136513e-01,
+            1.88056826e+00,   1.64170477e+00,  -1.88056826e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.61136513e-01,   9.71445147e-17,   8.80568256e-01,
+            1.88056826e+00,  -1.64170477e+00,  -1.88056826e+00]]), 'FE1_C0_D01': array([[ -3.33333333e-01,   8.32667268e-17,   3.33333333e-01,
+            1.33333333e+00,  -1.66533454e-16,  -1.33333333e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,   2.22044605e-16,  -5.94853971e-01,
+            3.18970794e+00,   4.44089210e-16,  -3.18970794e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,  -2.22044605e-16,   2.18970794e+00,
+            4.05146029e-01,  -2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.18970794e+00,   5.55111512e-17,  -5.94853971e-01,
+            4.05146029e-01,   2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,   1.52655666e-16,   8.80568256e-01,
+            2.38863487e-01,   3.33066907e-16,  -2.38863487e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,  -2.77555756e-16,  -7.61136513e-01,
+            1.88056826e+00,   1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.61136513e-01,   9.71445147e-17,   8.80568256e-01,
+            1.88056826e+00,  -1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[ -3.33333333e-01,   3.33333333e-01,   0.00000000e+00,
+            1.33333333e+00,  -1.33333333e+00,  -2.15331488e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,   2.18970794e+00,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,  -2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,  -5.94853971e-01,   0.00000000e+00,
+            3.18970794e+00,  -3.18970794e+00,  -4.37374128e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.18970794e+00,  -5.94853971e-01,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,   2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,  -7.61136513e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,   1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,   8.80568256e-01,   0.00000000e+00,
+            2.38863487e-01,  -2.38863487e-01,  -4.36972564e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.61136513e-01,   8.80568256e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,  -1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.79742699,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.10128651,
+           0.79742699],
+         [ 0.        ,  0.        ,  0.        ,  0.79742699,  0.10128651,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.05971587,
+           0.47014206],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.47014206,
+           0.05971587],
+         [ 0.        ,  0.        ,  0.        ,  0.05971587,  0.47014206,
+           0.47014206]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.79742699,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.10128651,  0.79742699,  0.        ,  0.        ,
+           0.        ],
+         [ 0.79742699,  0.10128651,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.05971587,  0.47014206,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.47014206,  0.05971587,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05971587,  0.47014206,  0.47014206,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[-0.11111111, -0.11111111, -0.11111111,  0.44444444,  0.44444444,
+           0.44444444,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.08076859,  0.47435261, -0.08076859,  0.32307438,  0.04103583,
+           0.32307438,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.08076859, -0.08076859,  0.47435261,  0.32307438,  0.32307438,
+           0.04103583,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [ 0.47435261, -0.08076859, -0.08076859,  0.04103583,  0.32307438,
+           0.32307438,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.02807494, -0.0525839 , -0.02807494,  0.11229977,  0.88413424,
+           0.11229977,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.02807494, -0.02807494, -0.0525839 ,  0.11229977,  0.11229977,
+           0.88413424,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ],
+         [-0.0525839 , -0.02807494, -0.02807494,  0.88413424,  0.11229977,
+           0.11229977,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11111111, -0.11111111, -0.11111111,  0.44444444,
+           0.44444444,  0.44444444],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08076859,  0.47435261, -0.08076859,  0.32307438,
+           0.04103583,  0.32307438],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08076859, -0.08076859,  0.47435261,  0.32307438,
+           0.32307438,  0.04103583],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.47435261, -0.08076859, -0.08076859,  0.04103583,
+           0.32307438,  0.32307438],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02807494, -0.0525839 , -0.02807494,  0.11229977,
+           0.88413424,  0.11229977],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02807494, -0.02807494, -0.0525839 ,  0.11229977,
+           0.11229977,  0.88413424],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.0525839 , -0.02807494, -0.02807494,  0.88413424,
+           0.11229977,  0.11229977]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -3.33333333e-01,   3.33333333e-01,   0.00000000e+00,
+            1.33333333e+00,  -1.33333333e+00,  -2.15331488e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,   2.18970794e+00,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,  -2.78456191e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,  -5.94853971e-01,   0.00000000e+00,
+            3.18970794e+00,  -3.18970794e+00,  -4.37374128e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.18970794e+00,  -5.94853971e-01,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,   2.78456191e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,  -7.61136513e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,   1.64170477e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,   8.80568256e-01,   0.00000000e+00,
+            2.38863487e-01,  -2.38863487e-01,  -4.36972564e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.61136513e-01,   8.80568256e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,  -1.64170477e+00]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -3.33333333e-01,   8.32667268e-17,   3.33333333e-01,
+            1.33333333e+00,  -1.66533454e-16,  -1.33333333e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,   2.22044605e-16,  -5.94853971e-01,
+            3.18970794e+00,   4.44089210e-16,  -3.18970794e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,  -2.22044605e-16,   2.18970794e+00,
+            4.05146029e-01,  -2.78456191e+00,  -4.05146029e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.18970794e+00,   5.55111512e-17,  -5.94853971e-01,
+            4.05146029e-01,   2.78456191e+00,  -4.05146029e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,   1.52655666e-16,   8.80568256e-01,
+            2.38863487e-01,   3.33066907e-16,  -2.38863487e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,  -2.77555756e-16,  -7.61136513e-01,
+            1.88056826e+00,   1.64170477e+00,  -1.88056826e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.61136513e-01,   9.71445147e-17,   8.80568256e-01,
+            1.88056826e+00,  -1.64170477e+00,  -1.88056826e+00]]), 'FE1_C0_D01': array([[ -3.33333333e-01,   8.32667268e-17,   3.33333333e-01,
+            1.33333333e+00,  -1.66533454e-16,  -1.33333333e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,   2.22044605e-16,  -5.94853971e-01,
+            3.18970794e+00,   4.44089210e-16,  -3.18970794e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,  -2.22044605e-16,   2.18970794e+00,
+            4.05146029e-01,  -2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.18970794e+00,   5.55111512e-17,  -5.94853971e-01,
+            4.05146029e-01,   2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,   1.52655666e-16,   8.80568256e-01,
+            2.38863487e-01,   3.33066907e-16,  -2.38863487e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,  -2.77555756e-16,  -7.61136513e-01,
+            1.88056826e+00,   1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.61136513e-01,   9.71445147e-17,   8.80568256e-01,
+            1.88056826e+00,  -1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[ -3.33333333e-01,   3.33333333e-01,   0.00000000e+00,
+            1.33333333e+00,  -1.33333333e+00,  -2.15331488e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,   2.18970794e+00,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,  -2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,  -5.94853971e-01,   0.00000000e+00,
+            3.18970794e+00,  -3.18970794e+00,  -4.37374128e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.18970794e+00,  -5.94853971e-01,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,   2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,  -7.61136513e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,   1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,   8.80568256e-01,   0.00000000e+00,
+            2.38863487e-01,  -2.38863487e-01,  -4.36972564e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.61136513e-01,   8.80568256e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,  -1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.79742699,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.10128651,
+           0.79742699],
+         [ 0.        ,  0.        ,  0.        ,  0.79742699,  0.10128651,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.05971587,
+           0.47014206],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.47014206,
+           0.05971587],
+         [ 0.        ,  0.        ,  0.        ,  0.05971587,  0.47014206,
+           0.47014206]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.79742699,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.10128651,  0.79742699,  0.        ,  0.        ,
+           0.        ],
+         [ 0.79742699,  0.10128651,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.05971587,  0.47014206,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.47014206,  0.05971587,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05971587,  0.47014206,  0.47014206,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE0_C1_D10': 'FE0_C1_D10', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE2': 'FE2', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[-0.11111111, -0.11111111, -0.11111111,  0.44444444,  0.44444444,
+           0.44444444],
+         [-0.08076859,  0.47435261, -0.08076859,  0.32307438,  0.04103583,
+           0.32307438],
+         [-0.08076859, -0.08076859,  0.47435261,  0.32307438,  0.32307438,
+           0.04103583],
+         [ 0.47435261, -0.08076859, -0.08076859,  0.04103583,  0.32307438,
+           0.32307438],
+         [-0.02807494, -0.0525839 , -0.02807494,  0.11229977,  0.88413424,
+           0.11229977],
+         [-0.02807494, -0.02807494, -0.0525839 ,  0.11229977,  0.11229977,
+           0.88413424],
+         [-0.0525839 , -0.02807494, -0.02807494,  0.88413424,  0.11229977,
+           0.11229977]]), 'FE0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C0_D01': array([[-0.33333333,  0.33333333,  1.33333333,  0.        , -1.33333333],
+         [ 0.59485397, -0.59485397,  3.18970794,  0.        , -3.18970794],
+         [ 0.59485397,  2.18970794,  0.40514603, -2.78456191, -0.40514603],
+         [-2.18970794, -0.59485397,  0.40514603,  2.78456191, -0.40514603],
+         [-0.88056826,  0.88056826,  0.23886349,  0.        , -0.23886349],
+         [-0.88056826, -0.76113651,  1.88056826,  1.64170477, -1.88056826],
+         [ 0.76113651,  0.88056826,  1.88056826, -1.64170477, -1.88056826]]), 'FE1_C0_D10': array([[-0.33333333,  0.33333333,  1.33333333, -1.33333333,  0.        ],
+         [ 0.59485397,  2.18970794,  0.40514603, -0.40514603, -2.78456191],
+         [ 0.59485397, -0.59485397,  3.18970794, -3.18970794,  0.        ],
+         [-2.18970794, -0.59485397,  0.40514603, -0.40514603,  2.78456191],
+         [-0.88056826, -0.76113651,  1.88056826, -1.88056826,  1.64170477],
+         [-0.88056826,  0.88056826,  0.23886349, -0.23886349,  0.        ],
+         [ 0.76113651,  0.88056826,  1.88056826, -1.88056826, -1.64170477]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333],
+         [ 0.10128651,  0.79742699,  0.10128651],
+         [ 0.10128651,  0.10128651,  0.79742699],
+         [ 0.79742699,  0.10128651,  0.10128651],
+         [ 0.47014206,  0.05971587,  0.47014206],
+         [ 0.47014206,  0.47014206,  0.05971587],
+         [ 0.05971587,  0.47014206,  0.47014206]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE1_C0': ('FE1_C0', (6, [0, 1, 2, 3, 4, 5]), False, False), 'FE1_C1': ('FE1_C0', (9, [6, 7, 8, 9, 10, 11]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE1_C1_D10': ('FE1_C0_D10', (11, [6, 7, 9, 10, 11]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE2': ('FE2', (), False, True), 'FE1_C1_D01': ('FE1_C0_D01', (10, [6, 8, 9, 10, 11]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (7, [0, 2, 3, 4, 5]), False, False), 'FE1_C0_D10': ('FE1_C0_D10', (8, [0, 1, 3, 4, 5]), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.453338 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.00742197 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.240305 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000939131 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./TentativeVelocity.h.
+  
+Compiler stage 5 finished in 0.00108004 seconds.
+
+FFC finished in 0.71541 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form VelocityUpdate
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Vector<2 x CG2(?)>'
+  Unique sub elements:    'Vector<2 x CG2(?)>, CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 3
+  Coefficients:           '[c_0, w_1, w_2]'
+  Coefficient names:      '[k, u1, p1]'
+  Unique elements:        'Vector<2 x CG2(?)>, R0(?), CG1(?)'
+  Unique sub elements:    'Vector<2 x CG2(?)>, R0(?), CG1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 3
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0269301 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.0018 seconds
+  Shape of reference tensor: (12, 12)
+  Primary multi index:   rank = 2 dims = [12, 12] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00172 seconds
+  Shape of reference tensor: (12, 12)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  144 entries computed in 0.00232 seconds
+  Shape of reference tensor: (12, 1, 2, 3, 2)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 4 dims = [1, 2, 3, 2] indices = [[0, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0], [0, 0, 1, 1], [0, 0, 2, 0], [0, 0, 2, 1], [0, 1, 0, 0], [0, 1, 0, 1], [0, 1, 1, 0], [0, 1, 1, 1], [0, 1, 2, 0], [0, 1, 2, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 4 dims = [1, 2, 3, 2] indices = [[0, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0], [0, 0, 1, 1], [0, 0, 2, 0], [0, 0, 2, 1], [0, 1, 0, 0], [0, 1, 0, 1], [0, 1, 1, 0], [0, 1, 1, 1], [0, 1, 2, 0], [0, 1, 2, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0176291 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000257015 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.357863 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000974894 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./VelocityUpdate.h.
+  
+Compiler stage 5 finished in 0.00117302 seconds.
+
+FFC finished in 0.405192 seconds.
diff --git a/demo/documented/navier-stokes/cpp/documentation.rst b/demo/documented/navier-stokes/cpp/documentation.rst
new file mode 100644
index 0000000..1152e36
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/documentation.rst
@@ -0,0 +1,449 @@
+.. Documentation for the incompressible Navier-Stokes demo from DOLFIN.
+
+.. _demo_pde_navier_stokes_cpp_documentation:
+
+Incompressible Navier-Stokes equations
+======================================
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+The implementation is split in four files: three form files containing the
+definition of the variational forms expressed in UFL and a C++ file
+containing the actual solver.
+
+Running this demo requires the files: :download:`main.cpp`,
+:download:`TentativeVelocity.ufl`, :download:`VelocityUpdate.ufl`,
+:download:`PressureUpdate.ufl` and :download:`CMakeLists.txt`.
+
+UFL form files
+^^^^^^^^^^^^^^
+
+The variational forms for the three steps of Chorin's method are
+implemented in three separate UFL form files.
+
+The variational problem for the tentative velocity is implemented as
+follows:
+
+.. code-block:: python
+
+    # Define function spaces (P2-P1)
+    V = VectorElement("Lagrange", triangle, 2)
+    Q = FiniteElement("Lagrange", triangle, 1)
+
+    # Define trial and test functions
+    u = TrialFunction(V)
+    v = TestFunction(V)
+
+    # Define coefficients
+    k  = Constant(triangle)
+    u0 = Coefficient(V)
+    f  = Coefficient(V)
+    nu = 0.01
+
+    # Define bilinear and linear forms
+    eq = (1/k)*inner(u - u0, v)*dx + inner(grad(u0)*u0, v)*dx + \
+        nu*inner(grad(u), grad(v))*dx - inner(f, v)*dx
+    a = lhs(eq)
+    L = rhs(eq)
+
+The variational problem for the pressure update is implemented as
+follows:
+
+.. code-block:: python
+
+    # Define function spaces (P2-P1)
+    V = VectorElement("Lagrange", triangle, 2)
+    Q = FiniteElement("Lagrange", triangle, 1)
+
+    # Define trial and test functions
+    p = TrialFunction(Q)
+    q = TestFunction(Q)
+
+    # Define coefficients
+    k  = Constant(triangle)
+    u1 = Coefficient(V)
+
+    # Define bilinear and linear forms
+    a = inner(grad(p), grad(q))*dx
+    L = -(1/k)*div(u1)*q*dx
+
+The variational problem for the velocity update is implemented as
+follows:
+
+.. code-block:: python
+
+    # Define function spaces (P2-P1)
+    V = VectorElement("Lagrange", triangle, 2)
+    Q = FiniteElement("Lagrange", triangle, 1)
+
+    # Define trial and test functions
+    u = TrialFunction(V)
+    v = TestFunction(V)
+
+    # Define coefficients
+    k  = Constant(triangle)
+    u1 = Coefficient(V)
+    p1 = Coefficient(Q)
+
+    # Define bilinear and linear forms
+    a = inner(u, v)*dx
+    L = inner(u1, v)*dx - k*inner(grad(p1), v)*dx
+
+Before the form files can be used in the C++ program, they must be
+compiled using FFC:
+
+.. code-block:: sh
+
+    ffc -l dolfin TentativeVelocity.ufl
+    ffc -l dolfin VelocityUpdate.ufl
+    ffc -l dolfin PressureUpdate.ufl
+
+Note the flag ``-l dolfin`` which tells FFC to generate
+DOLFIN-specific wrappers that make it easy to access the generated
+code from within DOLFIN.
+
+C++ program
+^^^^^^^^^^^
+
+In the C++ program, :download:`main.cpp`, we start by including
+``dolfin.h`` and the generated header files:
+
+.. code-block:: c++
+
+    #include <dolfin.h>
+    #include "TentativeVelocity.h"
+    #include "PressureUpdate.h"
+    #include "VelocityUpdate.h"
+
+To be able to use classes and functions from the DOLFIN namespace
+directly, we write
+
+.. code-block:: c++
+
+    using namespace dolfin;
+
+Next, we define the subdomains that we will use to specify boundary
+conditions. We do this by defining subclasses of
+:cpp:class:`SubDomain` and overloading the function ``inside``:
+
+.. code-block:: c++
+
+    // Define noslip domain
+    class NoslipDomain : public SubDomain
+    {
+      bool inside(const Array<double>& x, bool on_boundary) const
+      {
+        return (on_boundary &&
+                (x[0] < DOLFIN_EPS || x[1] < DOLFIN_EPS ||
+                 (x[0] > 0.5 - DOLFIN_EPS && x[1] > 0.5 - DOLFIN_EPS)));
+      }
+    };
+
+    // Define inflow domain
+    class InflowDomain : public SubDomain
+    {
+      bool inside(const Array<double>& x, bool on_boundary) const
+      { return x[1] > 1.0 - DOLFIN_EPS; }
+    };
+
+    // Define inflow domain
+    class OutflowDomain : public SubDomain
+    {
+      bool inside(const Array<double>& x, bool on_boundary) const
+      { return x[0] > 1.0 - DOLFIN_EPS; }
+    };
+
+We also define a subclass of :cpp:class:`Expression` which we will use
+to specify the time-dependent boundary value for the pressure at the
+inflow.
+
+.. code-block:: c++
+
+    // Define pressure boundary value at inflow
+    class InflowPressure : public Expression
+    {
+    public:
+
+      // Constructor
+      InflowPressure() : t(0) {}
+
+      // Evaluate pressure at inflow
+      void eval(Array<double>& values, const Array<double>& x) const
+      { values[0] = sin(3.0*t); }
+
+      // Current time
+      double t;
+
+    };
+
+Note that the member variable ``t`` is not automatically updated
+during time-stepping, so we must remember to manually update the value
+of the current time in each time step.
+
+Once we have defined all classes we will use to write our program, we
+start our C++ program by writing
+
+.. code-block:: c++
+
+    int main()
+    {
+
+For the parallel case, we turn off log messages from processes other than
+the the root process to avoid excessive output:
+
+.. code-block:: c++
+
+    // Print log messages only from the root process in parallel
+    parameters["std_out_all_processes"] = false;
+
+We then load the mesh for the L-shaped domain from file:
+
+.. code-block:: c++
+
+    // Load mesh from file
+    Mesh mesh("../lshape.xml.gz");
+
+We next define a pair of function spaces :math:`V` and :math:`Q` for
+the velocity and pressure, and test and trial functions on these
+spaces:
+
+.. code-block:: c++
+
+    // Create function spaces
+    VelocityUpdate::FunctionSpace V(mesh);
+    PressureUpdate::FunctionSpace Q(mesh);
+
+The time step and the length of the interval are defined by:
+
+.. code-block:: c++
+
+    // Set parameter values
+    double dt = 0.01;
+    double T = 3;
+
+We next define the time-dependent pressure boundary value, and zero
+scalar and vector constants that will be used for boundary conditions
+below.
+
+.. code-block:: c++
+
+    // Define values for boundary conditions
+    InflowPressure p_in;
+    Constant zero(0);
+    Constant zero_vector(0, 0);
+
+Before we can define our boundary conditions, we also need to
+instantiate the classes we defined above for the boundary subdomains:
+
+.. code-block:: c++
+
+    // Define boundary conditions
+    DirichletBC noslip(V, zero_vector, noslip_domain);
+    DirichletBC inflow(Q, p_in, inflow_domain);
+    DirichletBC outflow(Q, zero, outflow_domain);
+    std::vector<DirichletBC*> bcu;
+    bcu.push_back(&noslip);
+    std::vector<DirichletBC*> bcp;
+    bcp.push_back(&inflow);
+    bcp.push_back(&outflow);
+
+We may now define the boundary conditions for the velocity and
+pressure. We define one no-slip boundary condition for the velocity
+and a pair of boundary conditions for the pressure at the inflow and
+outflow boundaries:
+
+.. code-block:: c++
+
+    // Define boundary conditions
+    DirichletBC noslip(V, zero_vector, noslip_domain);
+    DirichletBC inflow(Q, p_in, inflow_domain);
+    DirichletBC outflow(Q, zero, outflow_domain);
+    std::vector<DirichletBC*> bcu;
+    bcu.push_back(&noslip);
+    std::vector<DirichletBC*> bcp;
+    bcp.push_back(&inflow);
+    bcp.push_back(&outflow);
+
+We collect the boundary conditions in the two arrays ``bcu`` and
+``bcp`` so that we may easily iterate over them below when we apply
+the boundary conditions. This makes it easy to add new boundary
+conditions or use this demo program to solve the Navier-Stokes
+equations on other geometries.
+
+We next define the functions and the coefficients that will be used
+below:
+
+.. code-block:: c++
+
+    // Create functions
+    Function u0(V);
+    Function u1(V);
+    Function p1(Q);
+
+    // Create coefficients
+    Constant k(dt);
+    Constant f(0, 0);
+
+The next step is now to define the variational problems for the three
+steps of Chorin's method. We do this by instantiating the classes
+generated from our UFL form files:
+
+.. code-block:: c++
+
+   // Create forms
+   TentativeVelocity::BilinearForm a1(V, V);
+   TentativeVelocity::LinearForm L1(V);
+   PressureUpdate::BilinearForm a2(Q, Q);
+   PressureUpdate::LinearForm L2(Q);
+   VelocityUpdate::BilinearForm a3(V, V);
+   VelocityUpdate::LinearForm L3(V);
+
+Since the forms depend on coefficients, we have to attach the
+coefficients defined above to the appropriate forms:
+
+.. code-block:: c++
+
+  // Set coefficients
+  a1.k = k; L1.k = k; L1.u0 = u0; L1.f = f;
+  L2.k = k; L2.u1 = u1;
+  L3.k = k; L3.u1 = u1; L3.p1 = p1;
+
+Since the bilinear forms do not depend on any coefficients that change
+during time-stepping, the corresponding matrices remain constant. We
+may therefore assemble these before the time-stepping begins:
+
+.. code-block:: c++
+
+    // Assemble matrices
+    Matrix A1, A2, A3;
+    assemble(A1, a1);
+    assemble(A2, a2);
+    assemble(A3, a3);
+
+    // Create vectors
+    Vector b1, b2, b3;
+
+    // Use amg preconditioner if available
+    const std::string prec(has_krylov_solver_preconditioner("amg") ? "amg" : "default");
+
+We also created the vectors that will be used below to assemble
+right-hand sides.
+
+During time-stepping, we will store the solution in VTK format
+(readable by MayaVi and Paraview). We therefore create a pair of files
+that can be used to store the solution. Specifying the ``.pvd`` suffix
+signals that the solution should be stored in VTK format:
+
+.. code-block:: c++
+
+    // Create files for storing solution
+    File ufile("results/velocity.pvd");
+    File pfile("results/pressure.pvd");
+
+The time-stepping loop is now implemented as follows:
+
+.. code-block:: c++
+
+    // Time-stepping
+    double t = dt;
+    while (t < T + DOLFIN_EPS)
+    {
+      // Update pressure boundary condition
+      p_in.t = t;
+
+We remember to update the current time for the time-dependent pressure
+boundary value.
+
+For each of the three steps of Chorin's method, we assemble the
+right-hand side, apply boundary conditions, and solve a linear
+system. Note the different use of preconditioners. Incomplete LU
+factorization is used for the computation of the tentative velocity
+and the velocity update, while algebraic multigrid is used for the
+pressure equation if available:
+
+.. code-block:: c++
+
+    // Compute tentative velocity step
+    begin("Computing tentative velocity");
+    assemble(b1, L1);
+    for (std::size_t i = 0; i < bcu.size(); i++)
+      bcu[i]->apply(A1, b1);
+    solve(A1, *u1.vector(), b1, "gmres", "default");
+    end();
+
+    // Pressure correction
+    begin("Computing pressure correction");
+    assemble(b2, L2);
+    for (std::size_t i = 0; i < bcp.size(); i++)
+      bcp[i]->apply(A2, b2);
+    solve(A2, *p1.vector(), b2, "cg", prec);
+    end();
+
+    // Velocity correction
+    begin("Computing velocity correction");
+    assemble(b3, L3);
+    for (std::size_t i = 0; i < bcu.size(); i++)
+      bcu[i]->apply(A3, b3);
+    solve(A3, *u1.vector(), b3, "gmres", "default");
+    end();
+
+Note the use of ``begin`` and ``end``; these improve the readability
+of the output from the program by adding indentation to diagnostic
+messages.
+
+At the end of the time-stepping loop, we store the solution to file
+and update values for the next time step:
+
+.. code-block:: c++
+
+    // Save to file
+    ufile << u1;
+    pfile << p1;
+
+    // Move to next time step
+    u0 = u1;
+    t += dt;
+
+Finally, we plot the solution and the program is finished:
+
+.. code-block:: c++
+
+    // Plot solution
+    plot(p1, "Pressure");
+    plot(u1, "Velocity");
+    interactive();
+
+    return 0;
+  }
+
+
+
+Complete code
+-------------
+
+Complete UFL files
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: TentativeVelocity.ufl
+   :start-after: # Compile
+   :language: python
+
+
+.. literalinclude:: VelocityUpdate.ufl
+   :start-after: # Compile
+   :language: python
+
+
+.. literalinclude:: PressureUpdate.ufl
+   :start-after: # Compile
+   :language: python
+
+Complete main file
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: main.cpp
+   :start-after: // Begin demo
+   :language: c++
diff --git a/demo/documented/navier-stokes/cpp/main.cpp b/demo/documented/navier-stokes/cpp/main.cpp
new file mode 100644
index 0000000..8cb6b38
--- /dev/null
+++ b/demo/documented/navier-stokes/cpp/main.cpp
@@ -0,0 +1,196 @@
+// Copyright (C) 2010-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-08-30
+// Last changed: 2013-03-21
+//
+// This demo program solves the incompressible Navier-Stokes equations
+// on an L-shaped domain using Chorin's splitting method.
+
+// Begin demo
+
+#include <dolfin.h>
+#include "TentativeVelocity.h"
+#include "PressureUpdate.h"
+#include "VelocityUpdate.h"
+
+using namespace dolfin;
+
+// Define noslip domain
+class NoslipDomain : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return (on_boundary &&
+            (x[0] < DOLFIN_EPS || x[1] < DOLFIN_EPS ||
+             (x[0] > 0.5 - DOLFIN_EPS && x[1] > 0.5 - DOLFIN_EPS)));
+  }
+};
+
+// Define inflow domain
+class InflowDomain : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  { return x[1] > 1.0 - DOLFIN_EPS; }
+};
+
+// Define inflow domain
+class OutflowDomain : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  { return x[0] > 1.0 - DOLFIN_EPS; }
+};
+
+// Define pressure boundary value at inflow
+class InflowPressure : public Expression
+{
+public:
+
+  // Constructor
+  InflowPressure() : t(0) {}
+
+  // Evaluate pressure at inflow
+  void eval(Array<double>& values, const Array<double>& x) const
+  { values[0] = sin(3.0*t); }
+
+  // Current time
+  double t;
+
+};
+
+int main()
+{
+  // Print log messages only from the root process in parallel
+  parameters["std_out_all_processes"] = false;
+
+  // Load mesh from file
+  Mesh mesh("../lshape.xml.gz");
+
+  // Create function spaces
+  VelocityUpdate::FunctionSpace V(mesh);
+  PressureUpdate::FunctionSpace Q(mesh);
+
+  // Set parameter values
+  double dt = 0.01;
+  double T = 3;
+
+  // Define values for boundary conditions
+  InflowPressure p_in;
+  Constant zero(0);
+  Constant zero_vector(0, 0);
+
+  // Define subdomains for boundary conditions
+  NoslipDomain noslip_domain;
+  InflowDomain inflow_domain;
+  OutflowDomain outflow_domain;
+
+  // Define boundary conditions
+  DirichletBC noslip(V, zero_vector, noslip_domain);
+  DirichletBC inflow(Q, p_in, inflow_domain);
+  DirichletBC outflow(Q, zero, outflow_domain);
+  std::vector<DirichletBC*> bcu;
+  bcu.push_back(&noslip);
+  std::vector<DirichletBC*> bcp;
+  bcp.push_back(&inflow);
+  bcp.push_back(&outflow);
+
+  // Create functions
+  Function u0(V);
+  Function u1(V);
+  Function p1(Q);
+
+  // Create coefficients
+  Constant k(dt);
+  Constant f(0, 0);
+
+  // Create forms
+  TentativeVelocity::BilinearForm a1(V, V);
+  TentativeVelocity::LinearForm L1(V);
+  PressureUpdate::BilinearForm a2(Q, Q);
+  PressureUpdate::LinearForm L2(Q);
+  VelocityUpdate::BilinearForm a3(V, V);
+  VelocityUpdate::LinearForm L3(V);
+
+  // Set coefficients
+  a1.k = k; L1.k = k; L1.u0 = u0; L1.f = f;
+  L2.k = k; L2.u1 = u1;
+  L3.k = k; L3.u1 = u1; L3.p1 = p1;
+
+  // Assemble matrices
+  Matrix A1, A2, A3;
+  assemble(A1, a1);
+  assemble(A2, a2);
+  assemble(A3, a3);
+
+  // Create vectors
+  Vector b1, b2, b3;
+
+  // Use amg preconditioner if available
+  const std::string prec(has_krylov_solver_preconditioner("amg") ? "amg" : "default");
+
+  // Create files for storing solution
+  File ufile("results/velocity.pvd");
+  File pfile("results/pressure.pvd");
+
+  // Time-stepping
+  double t = dt;
+  while (t < T + DOLFIN_EPS)
+  {
+    // Update pressure boundary condition
+    p_in.t = t;
+
+    // Compute tentative velocity step
+    begin("Computing tentative velocity");
+    assemble(b1, L1);
+    for (std::size_t i = 0; i < bcu.size(); i++)
+      bcu[i]->apply(A1, b1);
+    solve(A1, *u1.vector(), b1, "gmres", "default");
+    end();
+
+    // Pressure correction
+    begin("Computing pressure correction");
+    assemble(b2, L2);
+    for (std::size_t i = 0; i < bcp.size(); i++)
+      bcp[i]->apply(A2, b2);
+    solve(A2, *p1.vector(), b2, "cg", prec);
+    end();
+
+    // Velocity correction
+    begin("Computing velocity correction");
+    assemble(b3, L3);
+    for (std::size_t i = 0; i < bcu.size(); i++)
+      bcu[i]->apply(A3, b3);
+    solve(A3, *u1.vector(), b3, "gmres", "default");
+    end();
+
+    // Save to file
+    ufile << u1;
+    pfile << p1;
+
+    // Move to next time step
+    u0 = u1;
+    t += dt;
+    cout << "t = " << t << endl;
+  }
+
+  // Plot solution
+  plot(p1, "Pressure");
+  plot(u1, "Velocity");
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/navier-stokes/lshape.xml.gz b/demo/documented/navier-stokes/lshape.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..e280aa4e276420a6b0183c5b82f4483696a34fc3
GIT binary patch
literal 3420
zcmV-i4WsfOiwFQB^h!|x1BBE|Zo)7S2H-uXu)J>)KjH@>u<Hrh15{wBrH~*J73k@k
z5?f*-jlGE!`HLU<$Ftep&n@|J*TMH)Ls?N#;<|l*@ZG7QpC9jUhVHhj)#lK*N8gc2
zcf)#qY3TPjUe;xKyWNVT>->Hw`s=BjM@zb05wbbE;hXGT+m4TmYv_3OU)`y7lpOrI
zq5O#^Htk^adpD55|4xhv9Y(^KyA$6X+`XaG2IuGF|5+l6Jr&C+{xTOsm3W=2s8J{9
z*(Q;bHIVqqD!AM^bZ|W5OmHIOY;ZF7mn(Q=9I^ma4u(hyor5AklY=o9n}hXhWlbD~
z3P6KH4WP!M0Z`%40*F@_2iIf@5`_#vfkO@;$DsfauWr6bCUu+|rk$b+R#1v+Sd}Si
z7MB~(h}#9la~F&Ilc*)Z78I{f!9m+dG&TYHMgmIEI1;c1og)DiXsQXQ0mREr7y$7?
z78XGKYRH(5s4Avo<#DTOmG~&;#HFrPEG(s@(RgAqCZ>c{R>qZTYpTRbF}>=!q4}Fi
zNsa#_8FQ?p6wh1t$9I_|R}h0R^h(Ub{Vx_$717z4-u(q1TRh43FGy}|M;nZ^RgCLj
zA3lykn6RCR6;jVS`A`9NG|dpf@<tLrieOA`SA`4~X7+~4_JAwZLMN5>e*4;iL#bt9
zvZ66%?;>7?QUvN1v%a_F>)$L9jEPhA7_EZ_jp#-r))D;Zv{x2OD<lh>@S6t*4=ke|
zv`cGw=bZ0FCWr$#R7dzb@f<j)iTg&hy4c&?zBpKhZy1;mADw_h$~X?oW68>QQP38R
zPq&k2<{O9L6^}JA+90}U4e&7YZwKN@bxbLMLsR*;C1;mob-<yzKJDhCqh{~29+E)F
zh~_`uMc`qi<J#<M;Y;w1htSUzZDYW94RA2g%mptx`6vPoV_4Z5E<PG1Xqc%;%R0&W
z&@Oq4q!U{z<<_G}*0Vj|=CNPVnwt)j+L}A1^m+@Pz#&Xxvx|Dd?^xd60LB#x9%xFA
zl+4YCp*0pFo*(Z}$$j;t(uR1G@G;x0C2v-=x5+uFk259#1kWL}??C!JINwh#03j2>
z2E{eWkDROpqSIXW9-tCOr|<Gmru9Xh)_Y6!2gDB_)^;6G2*OqZL>~Ju*4WnEFByQN
zKu7{e-Gk(6FfD^kDcZnXPU^>Gg}fQLE+7_!oZKI_r-#T7DV&SM-|8*Tb>RS=>`k|J
z8vBMrT{yJWY0Q5R%)=l|b>UEZsovU2s`tCKP4@u8v)}}J=@3LSS)!jW6p6tX_QivP
zO*eNdsA0V)u-B)X=E|HvU+<DP@ldVKK2`S~aw0(>soN&77f9wE6SM-$DVu`M$`F)f
z*GQ5|l!F1^LG%w{;zVn1(f0&40RaiyANj*{45t%r7vYPP3>=0GhXNr(z-Dj+TVoGN
zsnAjG7VZjl+B@7DgrWgXHCpTKvTTUDpfL1DZm%q%?bBOCg@Yyh6DS|H43&$Ez(8=J
zv$LoSK^GS=ET=>Nd?_mjzEmmp*n;%3?8wa!b&(P3o6@0>`!z)IthP`<cN#HtWGKdW
zW2@8^e5-t@JMV1*Wy<`-!w37OJiehlQnVA0g_zQE?lsXxV#1zm(_0rA2^jB>nOuf$
zDGdb%$~pUR7wJP(@`L*O+rMITSq>w4k9XjsYVs|nQ)+svY0!ywtT{4N;@<R7XlyBb
z=pc8PeIsLRY@l4l;rxzT{V--OITC{~5Is_3Loi5lu0H>mP*es*@no6BlY@WQ#UrKH
zp^l`SlT@OPq3jqrm7eK})I(dmM%-*?uzHuMNGJ(<M{m~-pGN2cs`6Z3Ps(Y;a!4^T
zdNWRq=Br0A)Cx7j+`T1nPVj?8y_)i2_GL}D6x5_Gpz_r+y!e?>W<ySTrl?N%%EA5L
zcLa&5pZcOz%U4CZFM?f1C^q`4du_4mwk+^Gl}GdaftBJ_Z7s4zxp++WycoQ}MK^L@
zxpDaR%8^~G56Halem?7^3g6>tYrR@|l&@E-_0sj{-Rhf8+3_p$RpP6sy7qZQWFloE
zBMApmBSa^XfMi(70g^W>V^A81q{vK}%rTjfMyDAIkYgeWM1hn5sT(543&h}M{8=gM
zG!j5<LKO_0)+49&-Ojjg24j&KNt+#eVMb(&XMGV)K?*b=U^Zd%#vlh|{Tc!)n`m~U
z%1(*BqL2uun`J5||N8-{V3TR6gz!wZ`JumY0}`R*JoqyUYZRGq;5gM@K)RX%;wtd>
zrtjV$<bt4u7)r>ZdQfD8qP$C8F`CoUFXQEc8$k@h&?_Z;5_12GRch^#nB7`A03w(N
zIR8YE2k3p+SyS>^^r%@^QRD$y6jblW|08Pk-H2323J4;MNI<|NTLmTzP#o?@8!GDb
zC?7Xb4lJBY5}PQMem;ALf1Tx@fT}JB7{JyM6fzaD!2340>y(**g<)47YBA+i%ARX-
z{ZCgt_SMR=xG8J*2im%NAi$WQ>5<*!`vAt`5MM<F!5IDEF12WbU?6BeWyw_J0z<sO
zV98Vf!&bK{{j=~975#xWuO3Jv0R;_HTxwkeu^{f?Vk^fI;KDIk{#YY5#8J)Y`MNNA
zK|A5y9hO?s2`B;+QqTESO62VQ^}6V95(?U?eWOHrcZqr96619Zpu~|iy-vs>NJE{*
z<O$&@@?1>?Z4wH)MO3xauE=_|$~g6kiUbv2eMc|pnMbdxIQ8~5>W49FJ8~d|VJ*P|
ze)Qj1aydjIJ~S@CvqlI>_Wt~r{8Zu9N9BTT(_)^$1YQgUp+PMko>E+XYclS`3%J`R
z#scmoVwhdGHBhCPYnvErau5vJV6fvatIR8g%n9b6c&7BiFJ|P4XX;qqxx?B-<zPmz
z_qc3uTt$b33PPWh1V5YPe-0`-Ib3A$&?h<Qn;3oa+m|x!&au5$V!MME`(@dz#C8WS
z8hdxDqG%WDNF-e~7@HOg18{pPYzi1jXCsk8Cg3B^ya*+pF)u7;!RG>ck$1qA>jUG<
zs?Av8+~BeACOgEg!r34H)@!0FS*X8D9(7sSuF=*CUYwm~=sfnLPL-P$E3O$(>U0iP
z+^<e6+;g&cS{9;UE-p&I{>UYfaoEQgoe~S@s0vHa{RJD{xhmP-`{Xam%*BR*5Qd>E
zVYq{^|6-L|Oq&$B=>Sm<a6W$b8AK9e8e$b+`I{A$D#O??y1({cVM`ffxA&PT$>+bz
zPi<^iB3Vwke5bKHffZg8=U81jSq~1kWeo0X$2y(tl2LZvPJZ0S^qeYpiwF~CS2KnT
zLudjiI|%a5Zm~3{3~OgS4*iWwAcIB?DOv?W&mMO#=`}#?iKVQ%F_O-<Br=F5aOKi1
zkr=ULX}Qx)|8j5AATN^?^o#t-t`Bn1`d8Z`2<5n)o092dOD4Sp=O)Pph(bB0(OSkC
zfiSe+F`d52eumJd&o+XX_v(xy<IHo^IujffM557d%PkH>qP_Z#tnDlaMdOe+{THPA
z$KIq;u4HIYBO~MP(XR8hZaUfRp+IV{1+i#fPi=g%2c>3|1ThH0&?_}oY`y=*_G2e>
zq&4CJ7#%7QUMhPe!DzK`LmhRG>G%)2B~QiKzZLr;`(&dp=_A_#;V3I6#hE}jN_{{F
zLGPL%9_1r`MwAY#gXxvhbf^J&<m@%)qsPd9x~wt+QfE!M;v^xBHLd#x8R=~s?hS0V
z!^lQp;dNY=*<wIU+I-b783zmwN-fxJ3nP_7rbpB#hXrYAJgw`)+PE5np5<bIl9w{>
znY&Wek(gc_pvRGtb<Rv{Kw}bQg4EQa0WK*Qh)rR8VP(c><%etM?2<B-t$yPZjnzPQ
z`cm<Wur^WgTGTl`EjtJw<fo5>Ia3{(1hsDUaT3&W#YIp5h=7@>(_v*|8fYy@it2<&
zD$gIKW|YG)2*c1b!GMPQUu-{nsRWA&2e7J6Q))l^m9@ac=&vsvb+jwX1WEM}+cM~;
zz*2WIuVwbXR66+FXRh@|&L2ZmH?pTMB}kQ*%c2geQTmc+0jf%mnvC1l0*|cC9b}b;
zIBN=Ft6L{f^l$kDHTywk5&xAY!<PEia^JWa6*4-dLs;EqB-8y2I+;UCcglK4a~!kw
zt4SH4bz2@CWFt6362TW(E8CgcGt-#@ZN)7o{XD$YV?b_71aRGU91;Rmfa^2XrHPgS
zTseBa%8(0{3UDpAx&_C-Ug#rbJ&IIX_WPe0XNc}uN0th7<#B191^B4ydEgAD9a`oC
z(~_R;eJMGk6o^3>i2nC7?M`c}P<sDkm6bjhv>TEG1Vkh{Z^qQJPnTr!$reFgn~-oB
z%7VP^C1f26_F5vEOpsTkoX?OF<aIQB%-kg86&UT5ErPtJBlM0H<aI=Nb{**T<=t#{
z2iWVjg!s3huQ{Xw1%3UA&g83mj!NE!Wt#0los;9P+y9ANJDW>H`3PxhH2~WuD$Q$4
y5ZJPWlA?ma<~0=a5fHZR<_iQr=lX%7jtZN<v%;?Fd<KYJ(>(x%lklmXOaK6CfO}^E

literal 0
HcmV?d00001

diff --git a/demo/documented/navier-stokes/navier-stokes_p.png b/demo/documented/navier-stokes/navier-stokes_p.png
new file mode 100644
index 0000000000000000000000000000000000000000..7865121372e56a54e4fd621108e7384c455f7e2b
GIT binary patch
literal 28878
zcmeFY<wKjz6E;dIP`p6{6p96RZE*-1+}*7>l%mBYxCV;5LveSfxVyGcN^ytcobdeK
z_xuUx)A<A>+<WiNUUSVgv$NsKiqcr<B<KhT2v`sq2~`9HL~R6wS8=F_@J}AK!Y2_B
zC=ehLV(K0lhaH~vcEcJQw?_&8=Dlb%(7u(SV+0@!qrTp^tmdEqNxkC=8xBE6Sy|%7
zLJ8LP5BR}JD1%6eLQPnAX2Z6!v~<K9o$jzk)Q-Rr4w3OE#stgAV1oS-f^0lKnEfNi
z@rnpbaQD7C?^qLI)rtSSl_B`yf}!jFsDnB%g%|<@L7YpNKis3he}QdV!oVr;pQPLj
z!SHW}#S;GiKmR|oM)EMQ{W)*#&<nl~>ZI$3?_^-B!E86($WazSsw3l_$souC0>{O8
zXDFye<Mz*AM+Cw9wwv{AR0Ly$oBl4@le_uVbWc49ECcEi3~@&B{e%3@p35J3@@es*
z!7u%3eYE)sA%kNY)KVxzDGxJv*iUw(K!1Z^9vXJK{BzjoUrj#(Ubm=^Jp4<&2+U|&
z$gjn&-b6=lI{*Ty2olQvvwsru&s){X-@=<!vqq0E|1!)X&fg2_Vd|<y79`F|%{KEV
z!t_t0Su=b?2q40w0`S!}|FU>?xmYxe(@g<2p)dpwQ=XRrQ_p+muvQ>vI25#Mtw)V}
zG+d}10LvJ5hy#l%YC_PjCd2x(Jt2EFg_9PC7*EkKvfv*w#P!^0<t<`VQ;2cFN(}m3
z5SS1hl)XjB^GZv{ldgo#n6fs*Xr8%|`p9~Ih&EuHU}3k!g){6G6_sHU?+)HZB<DdE
zsEH6h1N&avvhz}c{9lK?l>g*seV=kZKv}4Czd3%!MfG2m(G4qc3jo3p(?AdhEckTv
zz8Q=(sUdC#$F@38t?1B<OG^OpCXC;_qGHAfL+#h#B}UrH_T1bN%1XH6gg9fwfm7CG
z+jqY6(lL=YgbJ%H-c=;G{Z+x&vr0Tvp6#`I0|bxb`2Kjq_VYTs<%h9nWi<qLNDZHt
z;e`#0b1CPJn$H2_M_tkLj!xC0cf00qVY2n?3>io^s-LYj@+%B2r+akR6aHsR-?K8H
zJ+m_;&zoD2Q9wN|1m{ZtQb>c@L+PR7)tRbkLiavKs_v1M=F3(|pqn@++>QesY~t$n
zvlWKY%U06RLr|`$l@y78tf;v2X!I*0QeM!9RV&*{NQY(Lt>pi^3;ca$Bm{wVP(ax|
z3vTCucDxw8oM)9%_#GG-B8u;htjR9~HRi|cFkN*^e&G9CzHxmolt!kmrv2Btq-6|b
z0$al^0MLHO$o6wk>%99iNI=SBoFg+ft)Jm#?uq$I5w8NTKejm3Eo&?N5HA70E@%cp
zRE~w%l@IKG0f9ffowqtnbGq`El|pdyJ^qib8;HN?yV^3v-Z$;k8HBh&P0Zl1oWM*0
z^9wJ0MnR<+-ec$&;X|Yvm!{m&5v$k1g%g?D<!+bm8@~wmXa$eHaB`=C?iJyd@HM=r
zi3~;!!0Py8))S0~?@x?;NhVUrA>n<~Hf0$!9@x7?X!pm+Q2U6hBxiIz8X}-QS)jla
z<0Ql_n;HGiv@V|zaU7d<3j^5e*wy1(dUvxismLM^>!20SANKTE7g_fgmF{N@MyeF+
zO|qs&e0rKKWk>Jsc7Me5Tl1Pq3P5D0sHBt{GW`@hYk|H@(2uk*VxuU}9WgOKs`w>%
z1(QP+v0mQt^A+bY|LrGB*r5m<BAy;&`Dev%(~uge;u$d|@}O>U0bTcobEdf%%4=y^
z4Jc|FPK?HCbRUjVzxJdOa)#M)=8&B;Kw^pkP;L|Do-}Ix(?-YepLaqkJ!AN^!xf?q
zL<t$8gWhM?S<<f~?<r4be63#Vrm;_%9`To#(GK;S*^54xuu1qR0e*YnTxYs{4@Rb_
zWx~XI?<nQV!yJq?9U|km9KF7puz{|<vR4X))IP)a`)`4jggOX-L|axSo_-w^ohliF
zyXyz=nb*h2eA4i&%eJ8MC^y|%X$P=vBRLj9)d=jA&@`U+Cqt^0)q3t|nT>lBvaOW-
z4p+I3VIVJsCnat^I=x=AliqjaPJCdTIzsA--yTCrEDo0Z;6AE2-={tzGL0h2+4)(T
z{1#`{N&YK+tkr!xbZ}iAg{kS#7U$L3uu{L{lj06)!Zsls%zShfIBHg`5$gD>Ggd*^
zH>Jn~5urPrAq3$hUORkXn<Ec})B>5uk(^v1hzYD6eb@*Aq)YFJinGbq#bbE8!aS-7
z^Pz)pHDAlWi$>^fjXO@llgyOrR+0@KkLB*`f*tC0YPB#Y-R;>w6!&4foRKjR6a%8W
zAnG9u59@zb92>mE;K{;kChc0MS1iXUggGb%KvSy6Z$FRi8J?w+KwgSZj@*1AdSFVy
z<KrT%s^>4WU0`}vtxp5YhWHIf?-e|}RWJv#byB1LobH3!G*-Pk#!}obA0snIG4>eR
zT^8SVMfzbXt@{@Xh8v!DecGjgTqi&L{N(J5o;$S7H=BMp#QECbcbq|vi$#&a2Q#tI
z3QKgzSDuAdPGH=iXT)!0Gk<P7NUoSxZ5AurQdX;kHNixa-#K?*DrndcPI4L9Huqsp
zlj}FXKkz*xu|r)b7CkTT@V}1HAcuCuEpS2m5V;Iu03GO!;<k(*+emK3k5!l)tUho3
ztyjL9<h7I~lZOetILoc)LtRW0E^@~|4%R|Ck*l~LL<T4m$ZyTklrt?-FmfSnNv-dC
z3v8pGs5a*Zt^URdMBU1KsOU8<Hh9l%DV~bLlmQyfijQG$0gU7SSifn$H<^9iWzBL>
z%h_2cGzBTDerq=I?jZK}LQuje)x@7uF%`^N$vigsGdY+Z6u);HjNhv{qW1nD5so15
zGLzFX&)$)w%oM@o5Bbf9Jr67U>cy^){zZRf+c4^7oxX`un6d@%v~x;`aWTGd$+2*}
ze&Wx^WNGR2#sO6pb%qU$)^=kPyMZ$f1i+};Wf7pe^(j*k+Z}|lsJQp;kzhpvqW3x7
z9}1}p*_7;)Qdjc*(I*2lXM;$m=;O1bT2HI+vJuHz7L0)&_IT!Ebblu@dZfwhS-o*z
z9dshwk1Zo)bztmh6aJ?Kftgo9DCJpYbwK>B2tC-U(LvXmRbKlpXAebj3ral{W_^1J
z2Hy4pzdYuO(F&<hVAF?w4e+>z43BG(sz=5?<*posvc^ntr7b<ain%<j)A$qoe>oe!
zj&F?J&ibTVxp{HlvcN#gUpV2DL#(>}AT5o-`wkx^D8=?Q`=f1-xK)ZeXz2O=qS9e}
z^Xj~=Eg<}Gd1lo_a2#19J0@c3s%l6O0njna^&SlOV+eomHZFbe(aek)jbf4&K$1n>
zo;#2#i{81;7p;RI$2O=%gku{cl-YQ2B%Ja${pf;A4Ex3Z;gn?2($yKckM-7+0uUPw
zy7GwaN2=(~({eEtpF+=+M7xo^h@XI?42=<aLwDGDRB|nZ!dDvxx|fBMJsQ3ir>+ZQ
zuF)!9CLyAt4DG^HriJ47uDN9xRO8{US7rZ?!k}6^#OE;Bi4$Um`cOnjJ1m^Q*SqcP
z@yD-uCc;8HSea~d%uzwrztd<wED)wJmdCw22hI11agsTQ-s=o2PwYHt-5x|6+qbXI
za!IFvykz04b*4uG*9FCu23MdI&ccr6=|nCpCcUxW29=j_9?3BEddjAW91X_0+k$t&
zZH7Pt2hM0?*cup4p~>Q<{F@Py%Lk(ogdyU10=vw=)N2%HyD5CFa6Nhl`dH!(a<AKr
z%ykdbF6d#~nv`%cL>hq_1O!X4)Z1luD`I#N%#~1Q7Wfq>_i4}PWn!Wiavz(=Xr&PK
zQ0goJp9*kkhkaj`ICE3=^Gjh7N)L-PYBLWXLlLG>kQa4-gRY|48zo0PG(q{)6lT_-
z5}P@>b#^t=nbM<w-nwueHCK8;EOyrod6g(o>vfJAHUGe#EaX)Vuy<#|5?3bQG*bin
z4=p$bP$yIRL^y+I38;ii2DsW`frqj`#(Hd$ecJ~XR`eMh?Q<rQ8$|&MV<dE?#`dw!
zt6B&BQ@b%?Rvz2zm<*wi+Mh2L3HtdJt&TKTmg2r)>_?6T*+)FynIkf{k*q~sHajFB
zP9|eEaOD`i(kGB?TUk0ty$7`H1qb?Q?nkvS`e1w3oclA9J&R$GTq?56r|D_K%^ys`
z{K>AAn2Mh@aaIz2NvNY4Q*Qr(T4>+`nKg8)ze*u5#YVN>c3WW3Vn#n`OTr_)sp-9h
z0Y;n~KmXe}H?Rl40Fh~N5RW{}T;#<OL#Z%E5Q4_@3=uhqjRUP~W_j$>zqQUu^BeFe
z3_VmB=*OCd0#py<_izo7)zA{myZ(D<>vsU7oMBCgB#(Fp<^YPs7<*k1QNP_d_OZH{
zysR<mFBMecM~|e>wymg6K5rh{;#E^X_wsO9^WiImv-lGUx>1fZ20ZTPli(X9uwqh$
zilMrTR0_H_YV6FU1Drqn=#SN^4Z3zm2>7T0*VvT**~Az(yL`2Iv6x%4h}*SbD!da1
z(^P$Gf)*Exda+6{+HXOcP-Tq_n5jO}&A{~KC2S_a!)6O<8A{x2F{7Lq#{7@etm*L2
z(^EuHCl-Nb0X3^>#hR}M&($%QZZgK)ex{@hqzW)|qn9NHkUwTI@lciFhVffh*@%&&
z8aOh|(5CI>2}rsNWi<cT3lBV|ekIYMr_xUrYw~{cE+Ya2xlVv{Gwv^B(F6kL+<_I^
ztqpw5uredT=?<t=vgR5~KwG8!Z_=J{sw`So{+ggihW~>si(kFzJRqw9&N3)!tptqv
z^7^>`vr2GXt2B9*0Zy+cx>GV+usk-g>*ov!kuXym6WAda9FR0qq?G07g@u^o$c=9n
z*_L};U%Q*?yO6$RQEgDOlElt`Doq*ZK35;$WI-Rpiym9Df*o?epR*8EfVMlRbkUdm
zykMIfimQM0z{pb!jw>*EG#D-+bUH?@ce@)r(ri`}!`yJtQo)=qN!){bPxgypUKtjg
z_lHNPir5c*T}cDhBQQ)se%nz6U$_;AL9?p+G4*BYqN`w1Zpe?w9h0`P{l%COmNoLQ
z!w)ZSo|2~iO&JASQ0Gz~37e$GqG^;)(;qA*&<gzi`?ziWsAg6!U0?}WQO|4Z!c9n5
znH#?S*O~uWbznppu@CeWT>rJxB%+~JNT|g`kSFGt%8)`M`iDZ=5*9Wd`Xk%NACikq
zl3Z}j{9oo|F{RPa{B-^E8&<5Pn^Rb#+nJKPi?0H)5DwTKy;QlS=h1Ynk}TN%pEsHo
zb$%y1Ja3?ZV+M2I?yknD+@R^3!{6<a*~W&OVqo3px_e3hKLPk4K7r4W7k{YvdTu{D
zR+lZ`)cSiI9i%q-#pAojWN=(MktCjXZUtxNO%@)glwxrE7<Na@N~q^|kGOsHByD$4
zJDwCQm8+4oDvrRVe6jE)X1y#i?1}<J7`DW+fvf7jix=FpJr2%4cj57AW(}@Ew<PR}
z1}{lTP;RF(6zt)9oglv~@?PmBR(zz4V%%z6<v~sZq3ZRqY4GcI>-@blbG5dep7zjE
zL_KoC2XFP@PjEqlfadQ7t>7`{CAC7^T?@)e-IvGzUiX<XbavZljyFv|?!kX5YgsG>
z0AsvMq3EX%b|`2O^<1%Wa=w#*9SZ#iyZPSBLs`IAdyK5A{RR2I4{B*ffFOY4fo|sE
zG9m|Kw3D>EZLY33ZBeIuNZTk4r1sN`X##+;WD8SFrhs08NxB5&^=UOE86}3`3Kp(E
znLPce!BgY$DIrqv8u|YtPvD<>zr(U7&FGtXrCP+lf^5x9JiB<I2{a2u4f&4?in+&$
zMS(}Oh`3g)!E|qA#I5Ri;{M-f3r7QZSYBCPe+Pn#QhzCszON{Fy^eM05^8z{zLjtO
z<m`Uz%WxGr_T>>{WbiasrCHtt9_{7eMp0=+oPHAU)7QjOLDq`O@#2?H)fTWIMN3!;
zw`qJAvx;}u21i4p|DB?1s6ioS+D*ga$k$ZRvSZjq?EJQ=_fIAL3#Gv{{Qdf3B|vLF
zNSAk%<j2yUH(kV4m{m6I_Q!_&NT^~kz&KT6I;)lkTr4d6$>)4n>GtAmT@JQglmJ(S
z^mSA8{y8)kG{#b^O*ZI0e*v@xT;8(?3;<0kGG8cb5IwP&vpquJ3dcNtE8GDGWIml3
zz~?XeGJj1dV8a*k#q`Z0b#_fcrglsM6Ycb(wLgAvWuQw`WQgK^W7e+**SU7W2z1$?
z-c@+jOgJ8#qMtYoMgwW0Bcu!+EMPw`l5TT916}K5GH5BZg5xe}7NBvh6OiGOMR30k
z9x9VV-{_0QATMwH0hN07jW~J#d#6(<z*L&<O1gumK7M<$%trdm+Aku5XB=muNM5-L
z>MLI#a@~4p$O<ooP{ZAf9_qb343f68H|n4gDiEUkAydpTFZS`Cd$SBM@`z=~i<*n}
z{;G9|^Mq<5Q<()RgS3cR9_I7nq4bPzo!ZvHU%_6<WP+vW+!?~;f|?_72^(<0ex54@
z>{AcO5??<$9QWr0G6uvcFv2CF(u;<y&EMv%7uc)K5<Y|&&d^3{3}X)WI%O(Ta0N^C
zjk^!`S{IfmB!$UE9Xkcfz(vu2YD`6w4rL6SFD`z)Xz(TA^C_fpCQ_gL<Gh9)tz2-M
zg+(A)qBH{*8LwGwN74crWicx4upzt>sh>!Ng(rN1qnB<)WmoLS&p>Q|QMu3D=P;m>
zwJL_w^%eg*jKZU~*6pE3ktJ9$Z-@mRVPjudR<?<m?&{Gb=w?qfFKV8k=?MKh<8DTF
z+b=76TbpXU-o5&-SP{Ki{g?y=n$jcs4@sB2Exolx*60c5j{kd}$<c^trts`XLmkdT
zhTI|6dz?)42`$3tK6;t_4}RkQ+`Hs<PMC4BE{W}=GrJh;_i$kaTDFCo2;<Cv%_|XI
z+bk*ILMaq^hCXU}-O5xd=bOc<9q4veLtk1FDTk>m3YwqEAHoonNhQS+ENE%P4Y|&E
zNlnTJB;Sc;TkY!jwdMt4Uea(~94Ie}C{i7w>p%JiUwkEY==+FXz(!*sMd|b?a?!Yl
zlJLKrKq7n#xLqyxn{sGoq%)|kgW^iy1JtDB<`#ATc&entU@3N3DIx9*-+b~9PUMNX
zp3YoquUbbo1SWV6rx#$Lz*&MKut|S%n_<>!pLt>!FY|k>?f02}nno>f{-LH0m#y|y
z`6vzw#;&DWz2fopi9K6d?lfrG>}Ac<3W5}iUH9oC=I92vEHWW7#wCbXY+S9PUb10&
z=M(rfiy}8EpIkz%Y@}`QLSd;p$gTqSHb}GRw8L3-Yw*&igMG@-yL?1^dpz`#0n9;Z
z4;D(4;leP8uP8G8wqgwmf%0Me;8!x30Of~HvKcqBlOF(%VJ4XV_)j7L$`V%7V%dqm
zl<d`e^waq+pULs3W*8_n?j=J^GPrPKM?s`><ra2|2%oQ$O%m27SwOYu2PV-8>WUwp
zLTk9y*;KPzJ%e}cvM(YFi{7@aQO>|?B`hy|K)Dp21Qe9RlTD6<>ax&a;S%8nd<~m&
z{Is;mJztu0DJsc<Bq#0~wW<J68Lk(>kNIIbZS1s83q3ti+J_4b8aU%atq#8PS*RxS
zLhxc5xGJZCiD6Givb>F2;kc-HOJoai>jz-9pd_G6QMGWZb)f6DWXeY(n(DBf((4+(
z|I06^MqbOOc_oaz1a*cO_6!ZalqVZ%*o0GZIUz!e<?vDu!Q+>jDZ*9Ie&X9XIpc6Q
zc8?y+INIS(c!gg-Y;OVY0;Yl()a%S1hP$Lgi!*Ti$LccC-aA{^F0-?^lwyDb_knao
zLa$)1__h5%ni(N43;_Wv5&b6dL=5K;sf7Q@U8FW#;`^$|NKHzWXwzb!qtc%YzO=rS
zIT4!xzDYWv`EINQ_POa4R-2(Y%wxOHsk8yXWMb1(*gYB|qrz};Kn1VEi2S^cXsbU$
zmu_QwD0)MiLTSi&k7N1~g69?QfSA|7T*R*{o?x<v>1BF2C8B<IurMd}#XENvv0(gx
z=Yvkc2<<m`z=y$I<>7P+K|fa(pQ9$kU+Uv#VuGdft|WF*By*J+Q>AD69=f^qNod}R
zCqdLV9!mPMJnb*OBskFIKH7kRLkgWVW&HS;tnEL7^5y><TzVsER4kb#|CoE-KHF$r
zGv4ok?L{a%Rwt|>8TCC_EiAEB#*v)CHJzy?XLk$-H?-%9UarL&E(WCGIPq=P$|p8A
zld1h|U>MJB)C@zbKP|1QO|=1mx77@x`T`+RgT-oUG9>tgV%Qppwn5;LxI!mdGB`w-
z;1IcGsHBkEYytD39cl&RWKvgS#MKJml+dK~Sy(^R41MDIvO%o~&d)87JfU;rW!ekM
z8#~(CK_$jy-Oj2FR$AWq4OdW(+q&@LO1vjxEq?JO{y#H0myz5uni;2eA9smh4g5#+
z4Zam)1y9UyXHv<f+SlY~sYNMW3)h1sDw{{ow#HaZYe-pKskrym8kg$n)C-O17GW~V
z&kHwlL?L=_I=0`AKTW|vd+;PMBfDo)9x?qeRtHtReDxRdI*$R-oK}F%D+Q*c++V1F
zjFZJMU4<S&cdR^1o)R2kjpb2qBU))Jo4<;%=U2y2e!`l?gXi0DXl7({`Bb#cQJj@T
zHi!kKs4j*z6yfPhj)AyIY)#B7p%&=5knxhtPJXGynAC05(y+r}R#H+$B^r6yBRmH3
ziL_SMUtyY+*oK@>rxIdQ7cZuzPEt4rQT;%+;MNIKxo+)M`2+~%nSXfr`Z++~J2lGu
zjqBtFJlTkTfe^Q(iS^{*(u3&xt4M`}G(zVOx$F*e2Q2waacE6*F;M#NT^-e(Rw-&?
zB<@#U3*xhJ@_5v{B$BhKVi-CE94}Cedl|>6>Vs|HP90S<vbcaiv!?rg*cR}_WCx=m
z-L0iNoV3*>^ZZq#Nk=I~Iuc=Iq-tdROC;_9y)2-@qhIKV2pW|?@Fmj?nIts2Mcj(h
z@!W>X$SQ*9z#@?Q?u=KP+lxE!bg$bGxlpwTV*K47o@f1p=d2UMix0hKt<Jb!wOQSI
zeJ7tMi=b!d2a>t#2UT}q_sW(IUtb^gcpF03DzxuF*HwkY8cMajbr5)`_TF9wwoUs|
z)=LOXA=Ah3ue|MI&+4Tl+xs+K_q150!PRoJr|wk9HJ88AkLGeP5C*h!EkHtf>sD=J
z;zJ3+vs{MfL*#Jm^2IlBr@Pz$7{ZIqmd(N!>njr=n&b<N(q7*hXk`0ZILGwOs=}OQ
z{w0Uf|Ln)N5z((G)#|L?!{un6AF597?o<s)^=$PsgMmJL)7PQpqjRN62E4^Dt;W>Z
zCHLE^<t$&E`=+zCclhH=dWqr6;gzrTJM4diD}@ciSGx#JYw|~**cW+hT}nwJM4lQ~
zsW|Oy4~D{#3zZpe=ClMiE&W^|Fr*nAc#Zm-ugkYM=2^-+9l%w|a_tj6_2Ex$66tZ$
zh2mV*qEVcc-VIVVJ;xkg&}MP6b4y=tUF%vime3v{o`R0W=7-35&Dk;i`NUK?Dd`0B
z=NJ1!;!iG~yo790tTrOJ8^vm1bI3BQxg4+HNpFwpdjb{R&kCs=YD=`Y%a>wqq1%=&
z?HCb_Zr0Xd*Q7&x)-REfmM-wX{{o?mYQORbj)@Fl&{B43Rt4=YE#pTu3<603)^lEc
zx*Kq^NBJZ33g)U#cmdLnLkbD}tK@kFcl$Q6RN7tBim~!D6Lv136D6xYxzg1WE#zDV
zE=n`-u%aV+wl*$2A!=tA8!^-A{gu*vxnHagi_u1Ow&k_d+7?ix2!ffZY+|OC#mK2O
z$ca_c9klMi##><f*vMXlFAUrH`7g=qe`xEwFnrS9C2U}SWwt<MK3}E$n#6b?G0*mu
zDgveSu4T`v3SS|CAMfIBNR1Jj6m^CQvYtqQT~uT|3R-YoNUi<sFAS3{t%hnR_!;7|
z09-d*<a~#QGq~UuCP`mwm~u+$6SOtF)-Vli&j)-`R<3ij*F%dJ?-=Zql6sxX%yppG
zr6tiFTqlR;_GRA!7b+!-R>)q5BH2UpLZf7GD0)_Z%uNB;K4aF5PXpcFe^%~U;D}6Y
zjYv^`&ZBE=H}i?R%-TT7Rz+?jVt{CCcvEI@m!XgBbga2uBFi#pJb1fYMmf5{ftZv5
zC%MqZZtf=e6eCNnhbUqmk!4cU3*^no+Wz#zO=W}RG<I0{*Qs$wIV{NqpG{&(Ce3|)
z(Ra!xExaqpw)sNf70$Zq=H=k?{Y?fug7shTG0d#**Bw>b)UO8rZ!bWjI=XB}K%nZb
zncrpjhx^y^uzt8^&UlkeW?qk(4&_Skp<V!!G`Q7`8F43~(lskKspb5ORYlgdH>mgv
z+BL*wF=u4KaOA&O^d&1xrutZi>Kb}J!^&(oOQ)}_4m5cE+QN1qPv7qSz`({62*UbO
zUlFXXN_?dcR(h7(l=1)i$BcbQR?l3xO$njag4E1PT|@b@TvFmFCc``8xYY(2=up#E
z6sRf9Re&b>HIgw;zpL?sJGs!q4>Q(Zi1>t#Y1428Nd2;t${ExyWBrr;(?>$^^EuT?
zD%FossUBilW6Q*1?$QoED(SXjt!pKav=Xw_`3&@tqn5dxM>1nBi~%=(J`gPzl-}x!
z^S_P6dD+OR5geBuMFD2zo7ndj7+J8BOJsIhv&y-;7&E%O4jfVfmBFyNhWoc)kP4lo
zCb0~s>Z>Co%L4h)Ky0BF7_9wc)d<!vD0`V3*G1RUp^$P-`f=-f#Pmi+dUuUN{%_Tz
z*x=}#i%8bj%inV*5b+6IU}zuqrcNZRp4duqux(f1XCv=UlHMV=NhONP<m0;rCov2D
z*2@A7V}ZU)C2;kr^4MHu7!;NW6>3v6ipaMr7q8aP+wIV4Q7=5w=<e+}eJ;HyF9t57
zHnGdH+$82He8*sMZkXY%rI#ErGVn7=q>3%P0v4&BbSc{=>)y8xm7~?76gY7U`;Luf
zJJ*T)06|FLuE#}fk$_~0GL#CYtq2Y;qDuigF7|WmFF>7`l5GGQjg%P@VmzN^IDjPy
z2b=uj8MENF9+Cwk>B=4ILQCR#RPYXU?~k^x#HPIsO|2JfhL6TfNeunalLt91+2Jm+
z1aqSoB9ot9TPFfuG42jbTA=GN8M@RWgVJpH7bj}x>-)~F9n#vzGp!m}ijoyK<uM)!
z<s3e%q$}X`zcmDQkh+<u?vAW0BJzCJo()!I4(i3Qcwx1WhdORPE+&<!kAK(S@bM7Z
zm{E+D$92g7KeKQOY`hU+N!tf!GGE;JkT$S459xbEdxl71BrL?cH3$QA#q;~+3uW}x
zV`S5{#f$3eg}i7)SD;cY%A0@keeX&?+$YGxkY1eSwHpte<}=YzCZ_#hFNw|J*M3A8
z21}zd^|H#ss4VHsoz`KFr&vvtgB&>Be>Xp$mpah6j`^~Zo0eJNgN~?%0^?{tii}<d
zX1(^#1f4#EygGgHJl$~COJt0md@LP&rNCb{<}&;09cwC(%@_?VkdM_E4iHw@{g9~K
zkWQaxFiha53n`u`DrO&hBgs&J#@GJ!i-)LdO`63V8q}duvMtT9T7jl~mQI$^bSo-`
zc6cK$cY53I^0P|LP1yv|stXsE`7Os{m6o_NzECE*T2vUU^J|R>EB%UT^)FQg?eEz0
zcr=8J1jV@5<)N~x!c7=)3&>!V?OI(Q-2+J;D&1Bh20|H^%j4n=jRQqF%ALZ*Lc%oR
z3+bOnw7!WDm^wW6ed-&KJm`1Q>wwyk7)9E*uA@y?2#Diaf@+i}u6v3Wyq^D7#!g`K
z$1bIVOWD3zn66Fl;E1P2*{g;DNGysN?Z(O6)DCIr(ND0&JLH*?&|=v0;f1C*@XYZO
zH3-$mwWR3s7ggT15P4n^AxAW>m1J&Bs0FKpSA&lK+)RLv6?a)qCE4ty-nH>eJTCRO
zJms#fG;FIbX`-Tt<4-!fx?FlrxdK1$uy-V{tLY{n`0%l}pRp6_Hb;2c*sU)h6{Osl
zb#a#EJTz^_s1a@=th*6TJnP>ezcW~}N^@1#^-G(nR3pErW-ci=x;_FcD84bVgAyZ5
zIaIey|K!g&QEFn<H;!%fO4!T#>J;3$Fj$xry?tUk`CKP51LAXeF;S4tVUBt;0%5nE
zkj>5^w`~L&C_VgSt-#%be|^eEZJs$q@zcbbq@9~!JJ3bWt}TBbBlnf+YMmB_`OuN(
ztMHuG<;!ZKQc0r&Yz2+asU^%~`>5d`pNSM;>GGA&=@|i&cQsxIi++zuO|N;nA$@9y
zs1iu9;tG+=U25AOI7j+`_@bGxa&iX|T68c`@^FZx?7B`l7t@1oej0Gj#Jojxs6f=}
zmY&dBCa#f*^opU6<>{2h?|hd|2;F{gqj0>HO+sGehEl|nfm|5|`b$A(;*3%+Ymp+n
z^!L_Wg($AVlk7)2T4H~Cdq@?93dgK@uFxlezL1)=^q)H5hBCsgr4ZR#Dfv^V81niR
z!$@w4bKHiectO?f`|xA$nfwSDicxj&7R}->MOgYvtq-L>1LPKteg_F4%4!X;r1e3I
zN*+@rQTJcB4JVR2E7tUt{REJiQN&~<QgShwv0_5Q4=j<#Rj_X;s!dAoa5)VtWCr1u
zK=WDT(?G-H)bOKW;+s&m7NF&uwpL|e*_?lIY$PHs_R;S=VV6?61(Su4QpE&$2&J26
z4~NwLSN&omk{`SzbG!7ZPh!piJILX~Jk@i8dFvraUpfSkPKy==<$2hK)ZvvxHXi=F
zKJr`Yzt6@nPz%Bft>$dKG5{8Z=SAvhmN}oTZO5m`ak-g%3SYKu6WTQ?zDKb3%HVB{
z%8^hGEpEMx`VyyzZJ#g30R`bI^6mk&T|;?T`T2V@q~k#!V&QSM-h1WkPupp^g*PsY
zGOSk1r6l1ds!K7=7~w0q0=m*xJkgUBSyo7^a~PI$>-o$AOOmqF7H{~{BzHU8K&2Ah
z$I0!~r0bgvboxHO8Wtf%xV3Cl3UGz~BI5|JuPa?EFlj_TNtgTd>HUdhAvSBnjQP~E
zR#29szR+(<yf{@*Gz$)vr##$?!{?3;CZll;U=b+!Kw(jvR*=ywPD}X5ESVFD?c{>|
zX(86<@NId!4!qk&6doOCdks>fT>iNMwqgUxFu&y}P^>$%99bKYkSMyeNqvmneWcn!
zFaAJIdu669v6Q0uj2l>DzWA2W>UzHPoc&wg#;4rxv0cA=ey)F&E|Dyt^F@LWjQTRL
z>cWH3fPJC5Kt`3`bA%(KOp%`$hPZ#d+#B$v)a5i)-UMpxfMBR(YXAxLw?W?9$qF>=
z^_CA((wlNp^Vq%T&<&hc-eFVjeN<OnpW~54(1*x!5(ULkk(-|T*7u_eVm1<#krwyG
zs?;{I4crnoVw9gaS`KXHOQLFAa`@Rx^<599cS+G!DZ+V>tqwYt*|h_!kKQv|aB}+i
z&WLJpM)0=yzG7kiM@Bn$;5Z~9|Mtl+e)%#|@%x)uIgzt_)(0^fh%+yo8j810p1Xah
zWOdPkh?wl-#m|KjaHq=NaOMjO*EX7U*GVb7ktT9Z$~+RFlpeCPO}dMBknb3GxG=P~
zN{vd2>c!WUQ~H!ZU&he>^?5p|YjOf-2OA1;o`nZqMW}aiRsY+qV*vjA6r}iC`P<u_
zQo^)((prB_pc&Ren1%kwaR|jP4W~v#58LXAG<H50PcgbsbBx|AU3kONJ35s)mz*I=
z<uFgm*<So!Pz##56*nJ&-^u;Sn<=zhnqByT(nv}yG%)Q@hjbcSCvBXn;;A$-JB%9i
zb6Ka4oq7sc#;2g3y~ojpa#hWr$D2{@cPh6z$yT0({p@-X)b;fSvbYy#I9R<}SojiU
zsQznU0jA$Ix%XtDj~%@CFwiA<xHRRVqu*HNV{vSLF=biqcqb`$tLP$e<2U2F<T_Jg
z4+4oV0S;8&QIWEb@=K$o$HgiI9N{q|f`GrMu6Wp{5m%fwLW+4M3A^bG%%^H-U$`Pb
zEer+J@`^hNPqU9R^&T`io82qC?-uR3r?o~t8qpUA)6DkM_TF}B<K)lMxqM6Q!EZGs
z{+{@%>^e-ljC8>sRc}pI&boCab$}0i7ABtqwSL7?X;`!{!5n9DtT})kf#ZD>8%SLa
z<zl<9f4+bTw}K#w@M?@R=k?&ssg_z)bfYF2&FT;r*R3E$nLx0Jcona8Y$3<twueio
z<(@8D6y*0Dc5UH7p!D_znR7CA@W(MmH}RvW5U1ZD^abMJetBufkOMzbQj<!~1W+tH
zT+<Fa74s34p-AT?!+O4-O)B2@dS;^6VuwN57k-ADHjOl%l(w256fVz+ep8a-f_B=}
z`xDcr*lyOl6$w!nLtXDTYGTwmp=+d+dPRUaw*z|(E_$7p!MRi8WE3q`?f7J&qa~C{
zR;C_y()nn%HXzocxhlD%HL$+&gGHpDOJD2kI(s5Nihc<`zE5l63ccPbp?8$CK6z?v
z3$IPvm7_|GO5@B1t|NrJ@YRMYgNq9gXqXa?L137Y?0&nW)LKgJ0V5@ZlPBKI%}ED2
zps7&XV|Gm+c%3-4OQeJxkx@)Nv`PU)wtxSH89?@)g|N&Xg6B3pZR)0sZafrDb2MkL
za0dkDHY8Fd?PKV;9nY^2FGoTCDmI_1up${gICOlvk9*-~xV6x%d<vw^tE@9MgKezp
z+oaZuh2K-QDWev^I~G6nnffoVL{$9KxnKU)*Zmh&V_toKNJ7z@5?-{*y=v;h0R38)
zls=%=-KzeBQDGi}?qccVvnJR|`n>$(WZY#!i3tL$OYrlcrDHDxYdPoXB4SzQHPDdC
znvuF*y)ii@LLP9U6I+%27(wCeAb&&2>K_?zN?IqmoQHqf_&8ThNB(8m86(N?uXBf#
z^lCne9F3H$eo!8?`7&M=F2A4{1hlM|b3nflg~z3YZT}aYitt^)7LO#wV5%-Q>`s;#
zNHQ;tmaZ6OTpd4-2wN9l3QG3wqsrTQ&~Klq_e`8Wt)DX`=47~Hkg}Xt!JoUaY70!!
zu#AYA>Mhv9DD8CBWK-i-l})!D9Q6AveXN`UiWP(#ja7K3Z50#zsCmsr+Df8AM##eo
zZ-?wd7HNol6FpbHZ4*<SAc}FMxTEL-9vVP;TX;}qA0wQS{*&jAWEE5aS?>-I*Q!cR
zLcphA`QGuTiv}l@xB>!`4tpTitHmQX)@Pth<(ALOu;Tl~n>h@`)c3Q{9bX*?E75Ax
zMXn=+9Z6M6D2Th%3punvrSzf_#mV+ucSxu^j`Q=!2K6hy@JVS2>)I5k3t)WKL1)w7
zCF|UubzJ$I1qzkm?==UqvNB>4RyzWgWc9cCA8BZjIpMuwTI=BnWh!%RaaT(c5;Us(
zAyORziS-r$$>_{G`CRv43)Cc=uei)u2>I0JfVy(IAY}g*(Te2K_?bT=S4TmMVR|@w
z%fc1#W@<@vliHD=PyhZY-529bv&VMs^r=ttmu48%oS=W6*7YEs!%;w9b`GXgAcC^*
z{_J<x{e`~<70(B_5lf(?6n0DFhVJgD%z0C$_!laY)qJyn*A%fL7Nm;M61L+h;p&A^
zfI6a$D$gg?s@~LI|AE6tmF6Njvtw$zQk}V>Oa38Sc13sYpS;P;Okg2%k19s+x$BPE
z>F4yI*a~3_{6y1f6>^foadCZJoW0eKUv=cSlR^;eXgI+#TJ8i31NMt2<qGONdvrNR
z&TJk{ZMVpE<O}r&#*9jmDHo}^4hqK=1nn1ci2KDxB@yAxZ-<KJ71Wu0y#QJZoq_rd
zFoD4jswc<IM*nU^K(kQA!t9a6?#|-uxpK=Bz3CRruZ(sW3*KU_Q)rEXpoJY_Z8$}h
zM`bfRd}Y7oqoypBaKDTX!w2mawE?)$qP_POTHPGcg8*epM~gAjuQ~%QwXEuGMK7QT
zz~zB0{z`p~#|!5r(*g=stH{VCVWXjTCwSRx8;7#VM0Ur!zssKKyX((>dj{^NS88h(
z40f&CZ|3S&tQW*{$z9Wecnk1qn}XItj)k>Xd&oG=lWCee+<g4Gk9!L4w3HkB;pIIn
z--Y7#Z$4?Vt720N%q#_&uKzsk=aTbnV-fAE?L;xGf(nHlnuY&BF>(POVrNAF<1J^c
z_4K`Ywwu<`d*g)vD%oSDBzW!-+W!Ixf!~aaBT|0w4JL31&Wl=o2$~w_)Ncri)3%a<
zteCuC&-x)_u}6IS=V%Mp$O0c6FHOtJIne1e`jODmFoOq)>!zzK{JpFD>WGtAR6JtI
zsJB|?D4PIBgWG1|IHx>pTM9-TW{!-#iaY<TKJ{KALw^;VC=g*GpFNa0yH(~>7zO<>
zj3#e2sp`L$+%aaFdn*0-9zRYrd@U;4u6B@K^i|`+FP59;e)1i&ji<fr-1$*<TeHXo
zoqi*S@z@1)61(R-d{e`$n*pQCA-^Yx^GA39r4_s|`bl0FL@4@UQmP=ldj~bs2eSy^
z|L37sqv!%qp^Ad9nL%0S(>;aqAlQ2w8(tqGZY_zCiQY?siq>m`uG1gY0&wK}2u2|q
z^n3U*Zg!Hehqr}&kbzz=6hMiimBIr$HNyWYZ;76;9RjcB%l|^uE}7j*nFUxy#nf65
zJStvlTG|9I;`*qP1+h}CbhJ-ozTtbkum_TTV>S+p+0U6^h+)*;t|g&%J=5^-31+E7
zk-=E31>z@>VJ#P9_B20*h#;ALdDhd8Ql~0Zz_8tvkMHob?W_jyVsP@Ofj+?CmlC+z
zb#L_3A~hlyFF8~#v$DP?Uqu_w9irP~Dj9tybjRXhlP~keWG^=?dK<m}z4=e0>j;u}
zl==yP6?F}<fQ5eqy86)D+dePkWgpHXyz~3#qd}5AlS>38H-DKI;=x!i_+iSAO<w8d
zfvsga+Y?603=e@>Zy&L{a-t@55FXC0IThm86MG=lYGlTOQsNSG`gB`@U}8LQPKl7Y
zP{P1Gtt1C57o_&}UUD^m8&U6<y1*(?GLIcwftZSQ7=MHs<_G_SDxdXfyp5uC(;<rb
zh;&P=NH!{#mNnh~iS#UpgQF^rtioT@?YTikjZN@FT_Guh;dJS`Ab(lfU$>GIyx;~d
z`H~av$>$~bFxXsycdbv+HXY+Y+%z^j#-UYR1)F&xV|~Bz@3C1o+w22zf#{9qxs^R`
z51(BAWF<IoLttNExzpwpKO`U3PNKaf@EuYrs)`oPs*g3eF%nuAYsableSe1$k<dta
zNd83i!uqjWvToxpG9{HE5wNt})b>x|DoMq^ED%|kU)S%w@4Vx=W~5Bdpn-oqvBYXY
z;NG~%y(jQSIRT^t??6EFK7DrU!h1h@Z4Gj&getNJn$4c(Cua*cebO@fhns(+;487Q
zMWpjlfH7Ofl`Ry39Yb(`+=H#{9g4YcxGlb=<%Vu&b;MR**V(%yX1ig@K(!v)Xda^*
zpr5XDC|m|}z-2JnO|um_K2#IhI4|)%uDML*JSg3p9pOCn2dmhwS%UBgiQu2(LE4$t
ztrAb=auCM7Tl?$jM_-jpybb=Jrb#-mnG)9zdU}WNqC%fmtMY!uxO@NQEk^7>=Z)1v
zh3-y1oBzXtU#Aj2cN_z8&ZGSuQ|_9cA0AI+&_~}{vMFXvTIreixUbR@RbIr476)%W
z+%35k(bW3empdVwMviq5tTiMwvBBCl{L%8^DvdLFA6u{5W%TXi7F!tureU0TO1<6Q
z=j^9%bUwatrJai3+kcbe*!9!;^_$G@66hN8`+FJ7;!hQ`RkX9nj2)aU<|eBPCQboC
z;Gos#VFj?u{6Tg{XP3R77J}V;x>LQLw5$4HuJog2N4i@kBI{CP;ir)#a_@oBRXcQp
zfkZl!nWOBEvxjU47>Eg8*uhTV#%pn9aZ%l7MZm(+{1X-~S`8u>FBTbaQFrKOE7{Sf
zShJ_d_#V3cy}GN@y`IP0R(9{*G&ZMOh#cg37VCTgaO{TB>}1_}+LQcf$MONW3WQ->
z4F}pNEtK8*VcfC92pD@z<D`H=8Jk(fiBmh3JKN|~yC}#vN)`de=+_E|9ZI$~h1{iW
z>OK~lD?1(%IT<FgnqrOrcAf=0i7~YQdE>iNeA}$mQyFu49DBR9H<%0>Zh?1jAbqwO
zW6?oQ)xs{fGWj&uK9ibaZ8w#X{TwgOok3(+^CjEnO^398O^BeOgm~2^R@nXJ-Fn*B
zSQ-17f>{YFD(3CP&jTcB2^Cf9sCw&1rvcedXid28vt1PPQEkF^<k|P)iZFBd`JJ`X
z*sbdXW+ox_M42n{PrRzAp0V4-K%d1nG8YB+!Gd2o<7wC#9zCbd$Jfi`f!5pI09=}7
zpPEORpEKMwN6J;Nd-aY^Sf17c&byU5wgZwo&FkBr;Kew3_|+0Q_zCAL|E@EIf5?v)
zA#W8irisOlqtojAg*BI>icl@M4TJ7Nl8Y!jz%p3phYXtS6#9A@CHm^`HL%xf*DL%7
z#6{}@k)G=SX{5L;xS|Gu=CW4mMsu(L*YjUNB9GK650{gPcN^0NlP_-@g?ALcVh4g;
z%@6>{li4=Uu7pz!3K(>5>=AjLamd(jMtAW7ERi;)_SKe<Gu_SGupgLO?GNtL$^NRN
zs>+Keakw~ZXGcgE6k<_O=@J4oikZ7q5=0sDmW5C2L`aYG?+sGkKT^W4j5wpg;dRsP
zi0Y=iT^u1_Mcl*OC_dqzDqEvfK7sfH7?DRG!K2+LENUa{I)?9-r0%-hl?SvgUlkKC
z;#v__a~L3wOyuWN2hww>>V~bTOj+iR7p-e}nPbJ}+10EI-+U3_zCGx1;MCeugvr6X
zSc!RtLCSgA98b&HY$&poMTAbUyuN+2<O@7%de#XvbMEriK>5=c{X+1`f&{;OQXH`G
zG!p9d1&@5tNMA#_x-7NOnvx}lF(9&E2AH=G1olpc#1K;HgoJF$LSj`K-*z5$HBU+k
z<F_11`%QgOyz@u^@dd!M@f1O~i(L&C`5aoesZzsFhk#W>yS%5;=UJ_E3F#}q8dkHO
zc)Ow_>6K=F`kdFRUx=A~dgiLdyq^bvy&5yjFkyUKt3qyjq%hRcz<jJ2UJ9ETqwkWV
zjW(O&Y|lLt{G(N(W0xgwU$ze;9_+E({v3H?mLN)y5uR6ajKr_<`RAO$Dzk!jedMl8
zUH<P}`aZ)45R6!2<sSScwff^Hb=lAa@xTB4uRIF0B(wvS%PCD$@C%fHdC*;}TqbFk
z`kon0GGuhergov7qw8F)2mfTZf8xep=kAN)4fD4UN<o*_6U`Vz!aOJ?Kd{`u$>58?
z$FsnmHUG9q58(cQqx=WN>)p#LwGm~q{l0>yf3I7^ai_^(vwXYeVi5Fwgi-tj2!1e@
ziB5HV;0)IER-~K(%9)j#Up2F_)N&fz1N3<<a9}eirwDqI0KZZAH`wkdcKg($tEz+T
zFz=vibv@&A-f_HlERSgAdQoaqr0RVaYw%J*39>@RPbwZm%U=|~U+q9*kz^q9<}9yh
z4)A|#CnHK{aI#_T%~^=7;x4UF=#Z@zb=WE~)E3Vy5Ck|JyuBdw9;@)dv`cNW52dv$
z^c($X*=cxlmlQjCoqI4ktuck-g0!-BHuu)n>pBTpz7~R<&z?el6Am=o5{VVq*t-yW
zXZ*?@E<i6%*@RDUtFl2}VDwF~i%z32M)q+Ra(HMG_`S%w?;#FP{*!T~tgQsvGHjKK
zkre?HzGd-oCYgtj$_eb{jV^UtfdR6+;&sB#g1f)h=Y?*X%QT@@nV$)Wbf}8(ZQ3B*
zDv5)4U&a9ATzrC-8?}(%gx)@*ix@E&<c>Yk8mMCFOedG}1ig$AjKTB|-AV?5gd1nq
z*{}F}^VnKTs9+7iDMaR9``&0dp@vU~kzHS5g1y_m!J(t~zE?go<_jH21U8=~5mWZL
zJk6aBUib0R2FsXeP^`Phq5WbEx&qv4)qE^795hh2RRfz$9KR<g<Ke5<&wrcXHf=Oa
zrh0R)>>Gb=*xYu6SjwEMGVi;Gqt}jrX;-fMjhBa7c8NV8Rjz}MF=`w|{wiVf=(Fd|
zEB@AZ!J&S)_s1TgZ{O6VpPXEeG$UwjTqjhMnk)mz0??cNBS6ZBLXFlmtZVwu+%3Ni
zx=JO3b;SEFPuU*WfUOmvmYxD?LH&)t-}|v6km9`5n}Az+k+EU>iyhd<;QYB|F%fyg
zrM-~|F_*jGU#RYvB`d>7p3myuxjNl=LZ(ik!u%tY{40&IyI%VKbN}oPHZJE;sZx5)
z$k{A}H%!|qVpl_}*tAZN?JFO?#fs|m<KRY8BV7cE+!K7dOLn?UB7eo7SE$>Kl|)@;
zSk2eVq#e_b=pc$wZEXlJMHkxuA|fR<KCyHoP4#tMGJI-n0(m0IPzow%o#owoV=Jl#
z$t!Lag^Ol0T$YuFi&Kn%?#xXDiZmTr_#<eu%_Qdj)uZS|sl!76kJZ*+l$*Jn<n9!K
z#7y5vDCGB#mOArI-tx3@6=eJPBSu%M(01gQwsK0dQT>!yjF_qmx5(c|*LSX@j>!T)
zw?<a|)JK8mh;(pl{F=;`#fUxj6R|t)b`HhsQkWOXqh{91AbrnAd8qF68Mh>_WUFZ?
zRDtxZ!Sf#_;aQOtP>War;6451&B*;PQ~fj;1_4JH?(Pu<vjUM_cCr*t*g0Ykb4apQ
z=Ec^h$Bv`#LhT!Ux&qXkeDU4FMkT_|TNpgl^!I<<8n_gYn|yGvz6Q8B??zZT*;#|x
zLg`sQYZDFX33tZ)HWS`RI#|5*@VYX{;u*&eJp0Ae>HV)OVEp$+W|BY|V8;1P5>r`V
z4t%;p-+xi*E<ucop@bOl+rYCTNq(=UX%Sr>wS@PWpM4XyIpKsQk#*L4A2N(6xG=y?
z_u(v1+zNjOCs)h=%0<Zl(Add4wrSm-*nW|Joft%wcM-OaF}P3kk6S%qqA%CBQ#sfk
zHQ}yzx+amE^qjH8%YZBr*)9T=wFk!r2di;xaPVX2#Ngs+-&?I%k3j)H){$N@RAS_}
zk27V24jYGL=})NuO_oG$D=uhRATGr>nxo(Uw-+F@?3Xf+8i686S%3pY?vIgw%kV+h
z_1UNUH<=(Hb)*G0&T*59lOHA|QPm|}qeizTs_0N3IlMkqK6{@sgr67PR!fdju{}sr
zppUc)&vCjVi?^X!YV@Q2W>oZF_L(A<iH*okwMiQIo$Tc**$wPra)2Gy?W*Z3B6$h9
zHcpP}(g16%f3+6000P<~7Os>qv9W#$_tV;3i#lfMKbxT`G2~B$RbA(b+2pd8M8^6)
z`^kcrqj)T9f_D`)E&1bO%t$Lk<lI+dh;z|^tI&W7?{=h}M&(S$oTPdD)2$8e=c?CF
zc(EF)cku{0Oed!&uS^XQ_@5m8KD9rCTJ&dd-jgalpL^Mg<9#7SlstJD@+lsqx5Dt2
zk`7xq$C<WP#^1F5;LfhyeSLLUq<3>p9QIYh2=$-_g3oI4F<mym)kr(fmYGAF(L~kp
z4aXH!kf^_cg_$v4l_fPGM2d%>@wi$>^r~4(7QQ)WXB>@#^!h-Cj`J9!;9l2=&Au*6
z-R8B=?p%K90(-lPcE|nGne{D<I-(FjD?;g5j#F$xj#V;)-2f-4X#t5qX0X&aS)+;b
zSEg1S1k&d_X~W%YUs!ou%;_mWyq_vyXQkww+WitXr{^p%`&Cf(+!Ecv=p`P{p~mvN
z=~S+RC-Vz8<u+}<rU~qkHM9%L!@H|Ex4RI(+zpJ8G2G^->Nn5}=$fTkoc#BkLWo!0
zN~C^FcfZ8gDhcDxb$zS2ZWwx4YUR`ps`Togk$LAw{zg4Jj7B|t(ysmN$T(8A#ZKZs
z%_GeAl_p=1({1ZpLh@~w^b2_l^AQSHG|;805%m1K_55|)mIV=IZ)8xrsZONg8x^~i
z>q?$kw+1!e*7#KS7pQr3k4~#S{p3Ht`9>ZCY7taLeH;1D_o+h|f4;NdETg_OTY~PY
zIm{H$awjy8W)&9pW3<lD8f7(n6WynJPTErA8s1H;yvQeOOf=I)ZX(EBWaEr_27VG)
zw|$SpCOZ9o#>4tRXWNeUOP9jKlr3c%VV-|7mc7T9KP2eM2ZQbFc~9zO4tVds^L@|4
zcX5eMwyn3*XLd<#(s-t~F%hz%+W#qx+rtzLeMJ{AkT|oUK+fh`!T($@S#fE^`0C@`
z=+EN(7^ADP<<KP1Ckp6kw{ea8TvmK?8@<{r%9{GuFl6;_5yX`HS$FrR$MNIZ`!@zy
zbTU19+>>vt{JBY2SpJ{hzAB)tpxYWKZiV8m#oe{gV5PXbmE!JBaCb^^g1Z%WZE<&Z
z*8;&MfBN13d%ExU<vb)OIeTXI-e=FuT5AH=sn|h^<j)QHq||kpWt*FC745QQ>MujK
zJF1<nvww<mWX{*CFKTB2-`LPt$MlN(+?b76I#@_JQg?~f*7I>=H5R(<BKYQwXZjML
z=%ap0PV?o`@(cjnVl*yRV~*itKIwwIiCf^=S?=X@H+kRc`KF~{Xu2y3Qb{ORSX>Sm
zay+}M1%%T5&Y-y#OX<08u(ih8sz<%ne?OpStj$oKSJ-gSRfkAa146RTCbGMZWE!Ed
z=Y4WDL~(MKJKNXGC=IKILej`uO4COLgcLWvz0&HX1$-$kOnA|lLXaaUZ=<}L($tiI
zHw0%N5>wIUGrdZVq0K@k@<sdDvJF_FsR#^XzP|_EWU$fZ>JIks;UXl6YM%q&40`HX
zVroJe&pnQBC%r}@;oTi7Qs&cA!2P<Jt+B2Uc~0A}W9WaUSA8$9Y`Egn{!L#c0J~|y
zKX`41K8V$m<B^raG9^!Jd>%20V<%kC5zZqJ6D5_C)?)gyY$#%RsE<~qI#7*6ov*t5
z-m4NXtxLQixb3;RyIorppI~U>rI9p`rI(58xPx*yRkT!m2fE6($Y1a0t$~KBX2O;m
zszSKRL=@AfEgouRf@>@H%Gz)e@>2@W0maFn{F10WGFx%AoKi(a77puH$>%FLG~f3K
zt}t6T2AJIlpI1&9-BRbLT1N+X9!iHUn5+-hyr!j0vdA7l#{pI8d1lZA428aBAEMOl
z`<WmI4+QRIYnAxC?F+D6ijwRT(>cSq3aUSb#mTJFP{oOZL(wCWryOSfUU$OYDoPcy
zfsYCX&b2!zqYr)w^p!@}8kZ^j`m1ZHRTZaPS*ti{qcVE}L1j_>3ga@H7|JJJ6~n5B
z-HqX8P&r!qju_YM@ie?~uq@Yy0<f-@YNmeK0*|ss$Yn+*?;QG6cD$*xBdlYXuP{Fa
zr(P3^eo)Z-;sFx}JiMfqRg{4iqQ*=|-7PPvoqq9|p*O0gZ5GlAQm}A-$Y9*RXJxar
z^$EX#w^jrpdOo(hr}^C9;3qjiL;5Oek~5cfJp6)BeRQR??#Yq@ja`ysI_Sw!;`qvF
z2_w_0v1ZX3O}-{3y0%_|91&J((Wc54be<@#(S4<_d?>iFdEXAYpX<eEqs%J_)Gbyf
z+1HkPKG3<QllB>aq<GC>-Wl6-UI6q7&2B<2*WNBRg>Nm={|VC|^_I%Pw^YGo^YUQe
zqF9T*c7(g9X!>!Je)Bj^XLAM)0dk$^h?$mShzp9YEG?)tU|8lD<Il*S7j2ZzCB3R5
z8EFMi@(Xv8*C_Bi*}r3if0$R#K>mIjV+H8s@*>b)3FRFg4AtwzbP{b=1Sa&U$c8q_
z-m8`t6xZs=C0b@nGevI?BPk=)rKQtp3&TrM!5*fwHy{pEIj2jp`#-@FJj-E3D?(Jr
z;0vms`nTF_Cl9V5&d<*f?xa0hRb&U?#<Scd?AF^7KVBA&sf&p3vK-I+sdfUVFc)@j
zmyI<NJqGcZJ_QmPbx{GfEB#Ob%QoF;{c?6G*@>frl&jRY6s$k-cHeJ8g<#B)%Agy<
zdwhj^$;cfEBQkF3lJjKLA+phu3OXCVnEWl1`LuKHxR<Rsnaeq0)qGR>j}HsPHeQbP
z&eW&0rqU{)wEAKfp;t8rJZGouu+OjA4Jnv$up1qZ%?^;Q+3<MBl>L?VR3zX9csF@9
z7`HF@^WwGZ=G`kn_XFY2^LGVKyH~V8e-}iT=VrN=0rCqWvtwQd?%w{|i!~_H*a3-N
zD$kJkR^?~P=f#@qTwStUzLGxGuyg)W4eq>R+(N||sgn#2R+tFgFhx2VwrfLmL08?S
zV!_fsHN5}<LEEObucIGEq?g$%*<y2ncYLswcdJ4=o6eVTuX)t$@buvu#B7{S3~E$W
zoxFLC-C^ak^XT7F`b`7)?}0aW7?XXB+SQ%(4^LLobj?JJA<cs0nB@dn<&-X-Y?~Y=
z6Cox#zj<ZXLMM>wQ%~X+kuoq(&$G~T$cab3e=qc7O^(i8*@9vc9MU_38?ZKv5Ur-t
zv)Sijj0I%-@*LfjgNhW+qvR+wcUv0xjNL0R=(vLvFk7?dS=jlFq?(Mj`Zmy>H0qzb
z4TS{HKH)eyyn-0cD#=^DRZtUE!_+?C2I0Qg_=Fr&XQ9IN;4ejy*0JafX8LrK_uR#Q
zA~<DP+#p$k8x$U(ZH6)enz;=TP$D*Mf+`eh87#j$3b}-yRoj@lzrW|?IH$q;sP<ch
zH}G$)a67|ezd3WZ)Rq4)s5Nw^V(sYprmu{=yQ-|lnUZ-bYR-y@5sh78d$`zQaFMwJ
zQXyYW8x1w~V7yYA==dUmQ0(p@L;z9BhAeiU+~Tsiejnx=s$-Vx5Z{1YE)xaiPIG`<
zr&@`Z8Y?<Q#q17iOVl!_@_maCBE>tB0RH&rjB^U034|R1rdHp_$QZ3FC+;tYELBGp
z)%~VQRNK>+oaaBkwkM8+igtMbt#J>iJ<R!QS$e#&&y^bwmc<-jO!XQoF0*trDDF-#
z)#rZsdC8Tkjeq0zJ}{i4`6|n(9h86W?LF-MW!wl)EFk*FQcI<YowC7m`}jA?R+sb=
zBi(d#=svt<j`!y>JG17uOf#JGw>A$X7vUxE0S$Ak<j|E?JBYf@y#v74%Hv&r=$lcr
zb{nhmt&;ykppdKA8QLgFq~sYl)rMkAojdd|7Swh-uS@p!!L9~HE-!;geS|U!bA9>8
zGbT>bl1-;zMjkDsXFB^-@vLtS_3Zf!m_<A|f@hb7kkQY1SBz~Xv?%I7J(9Oew6VsJ
zgMQzbB#edXQqJLGtNU4>TUeuYYu{qQ=KjHpiz-#t3!Y<iJT-E+&f|~1)>C=z2b@-j
z*K(fa@P|fIROM`$OD-9^*Oa=iAxW+7{&ES_!vW|cQ3R*|E#BueLUw$tuc=~h)ql?H
z!S_YiN2<241pn)KyY%)RHDt}pWA`tc>0pOXo`-I9pIA;veVO%(gjdMZ&hR>~mkTm<
zS8F#S;VT`b?I?Uruji__W<%(roRJg05z+fJ;{24MwL~Zr09X+9&MQXRraEdBx``L!
zkVvAHxft6$Ha5l2NJ78_PM|Dg(ngPl>hOa6Aua|cqlccMZeHr}H(W?+^a-fLSmUz;
z>at${DK8lHuk(GqaubZMF7`O)&(j(yXU{^cjU16zultb8?+zG<3k~u#MZ&-B6F3&J
z&B^PYg)SsAUJ*2fIunoLTKrJg`77*q3e32a>+_0hJ;JxN^N3@OJ)L;9^O`f$KKRf6
zM5tt<Y1ftwSQz}$`2b640gGfn>+n#{ZtFvVNMMOE?v%kUSsP}Kg;FOO_cd3RF2G+!
z^cOTU#RG?VTE8uZkuZRi=KxD2A;^Ns?9yE)n@u_rwyS)qRPt?h6sp-=E?`=Yzdat5
zg2vF4Zlp+Mx~l@`4{ilIGuA)?jewUZH2IbTdg+lx&$=4psN_Y@aIqz>#eJCoJ+(0s
z$x97S^z^tHpE_aq-vrbw>e5`Rz26EGbnbZH%9OIraNP=pa*4X6VzvO|l=$tj#a?^3
zD%2n<`H}D5(yBa#AGB+JzZq%2*oYT%@@3yqz?4nS-iP!L!lyYk$EyZcz$Opgng3g4
zK;Y|f@+qYGOQwqEvPNDesD=2q7>F5g;l+8xloU)G`j>C-c(U6<`^XFqR_x9!wZKcw
z|HuVmxdMURbnW)b8z=qvgqZ;r-Uk;?dHbS>z0X$s;#aG1KoC}H<sn?BCyH3s|5u^&
zTAejvwvUk4E`M<>8EEaK!WlHr$fZN6ejR<w$oc{MN3Lasv{kdJQ3HOJwN%BpyyO%B
z{*@a~wU-#O?=>Fmmqc|Xcei{r|2iipx~R|iZd_B2Sew4jJ^*1UplK^syPwq&-dT$C
zwnGde4Fg`PasDJAC=fvp(NnTF$+>#*q3cA45qm3g@C|V|_|XAre);$)eOu9=;Lx&F
zf+*<5+vp!4I>O(@Ryt5cjs3JFI<JGnciW{PsEjfvGfeYUNw{-vf=-boao7_TtXy?i
zDaB?d|BJI4x&nTVci6A{rW&^p!B7D)P5){+i&})!wORFPg&1vdWX652n5xavT0|~x
zWkX4`>IBsHIC>$KUDsr?;tpJKeCC$UYHvCXFiqF|g^>D|cmZD>bOB?4V6gtSE!L3*
zoE>JB66#yUjHG>iaJg5%llI@MH@pOOT{eF*Ty1}oSCip7h<{PLBnxk`reHs>rrcJ(
zjksvklR!+Oa4;2G-K#NnR|aCIh6fAOFNi0@8r&8A%mj>D=nDM!`YhZ-@_9yBJ+k~w
z$!BG}g|JMpZ=n=QB<p6L+9PmH?L%=jpLV;un2HB=fWC(h0x@_E+kX8pS#@b?>8@1t
z>K{Ib>a~2Y@fv9E3KbIJ(GuT*=kYF+i|{J>Qfd0z-LXFG<k6bGwPIKWGp^QvkFed!
zf+xbe)Rku4^Cr|@{#QkM35)gF+&O~MvSPEz-3*Qza_bLbc6T~?i|gYr+`tXuC~Tg6
zlB&X?5&=2x(CwWQWKKd!2iW$KC&Dwz$ttQ96c(l>VwmbE8j=3K!eKk8*4+1+$E(Sg
z&K1w6=1wyKj+M`>)MqS#2Zak`AoIL@G;|ulmsCb_GDAB7uBG0qGEmQy9ve|^-<B_x
z_)mq(KYUeZ2=F_hJ>u!<ea690ikUWfNp#f>ouq@;L>i1fE8WpH4zS_)<Cs}974rml
z-IXE3ylg$+T2|=|b}m$gsgj@+(p%4!=1#o5Og3-fU%|cGvGMkMM`(74d4!A#SbY>+
zkVT?itM+?fwlMhh<AdBG@@o-t!8FU8l->@<9vrKQRh;sx{bqbGdwEesdiMsSP%w0|
z^WX+VP`m0SXuC3pl`5h$R2~!`r_j@bz@3~Z@~-Lnpr$ng!ON+CYq(nxpnSVE?+!4x
zVafUZ%R)0^*zbgtGd(RI{i|pjP5X`Jx~o5J6^=C*yZ+~#ccX=(=_ePJd2tp?UtrqU
zGSDdz+Y8Kv=-=2snR!vsDQA5f`lg2>zKT|EU$edD<%=}N_(b6zuC>YHRiborH{g+$
zjZiuN+y3I4?|p+sa@gMl=x&<5o&OUzu$^yXS8v07s<nmDnEmGpQ8!#R&-Ik)WFJ4z
z<0milR16c@NKVAynTymkw~US$mC#we*gTaQM-$YJyCFHf%=0=szEIR)@)`bdhk5wc
zM`9rDmq+x#@NVvd2f6Vr4p->g`5iA&@zhbnl+gmD_>QYAB>W%FIP)(z=r&`;^WMS#
z1IHs`qvG>IrtiI*8(wuYS(Jo_z;L4CUA}>u9Y=ZyN|KhcWp4?A2oX)2l!Bk|<l&0q
zcD`@9d{Y?Pj|2HU(GOH~+CmWiYRi>aaA_lYuzOdh-+p-!-}$b&5BK@2qyVSe-++Hj
z=J&tQ>DC|to@eIR8kJqOJEPY41RWDN)kG)T%+~hH@XsNLC}e8T3Cj?Y#Rvi-Hs-dO
zM8=Jp!t@tb62`JTvhbBte86?hqj$%(=@86rPx>fRA5RLUh(yeRY8!YN!b{)>DJ9G}
zD0H}K-wgCxzT(;J;42K{0y#XfB(-KSZ!BK_z%Wg7hp0kk;GhHc&&O83a&i8`vQfP#
z2ETstkv8Lt_^4i%&Ro%)^>JARX6SoRR2B8+rGg3j<E!1+o}C7q!T?w)FlEY&0Q2@R
zjQKqQmEWLZQ`WHEKh=xpn`?{iI=+otlAQc(`iJg~Pkg`9KO$p4XT-FWl)KE}xN?n9
zbu`I-tzicJ;%vmB>Tf=27W!ProR-ercvLhYOShJWXCn{+3Q?jD4<c7$F<2w_BE=G;
zksJT;=Y3+|@i7|CKVqzS$Bv8tyB=ZSs}a%rD(!x6<RiN^Nthw(Ahpw7kP2{4N}x(@
zTsuwpXf}#o81UFsV}}-Xm$70kxypjAMRpQp)^^0ep({~hapj~qx440MGRWB`0U1?%
z1=$=$zHXAfsX}E-Z;+Gw_kq4w!nH=92gK@F<W1$`spZ+g%%eRD2k#zr0-EsA+i`Tv
zA3{s~e<^4FJv<;-VRXbn8botHx1wKzm&t56yrB3S{ymI>-5_3Uot0vjf}q{jL;bZB
zHHRl{T}6Oou%E{GezUI|Ir#PX)#!s}MEh%Sd^<K|AW82Z26p>e4s>tRcr^#SQ(Vw%
zbma0~cgZ?AcI}xeAd`RP2uej=ts3^b9X&%9wb{XLOlB!Qk++Blx*LrJDAxC?Ee<7X
z@!#Xw?#v-zn#Xmd9qZr<4Ko@+h@jLad8*cCAwgv*q#C~aCEmY?Z{y15Ej+K*1rx+n
z&NmOpr)*$85r|l;1j)ba)9Tg*E#Uy_PKMW{I#3l)zX2o=Yz^4^P3aT%aI1Ogh`J&>
zraNZi+=0@R(lRnCS^lcSu)qFM@RLM$w7UOxzpW6w&P<VYX$XSPENgCKvT<y_bXg6q
zYY8TjQllDOT-Zmh)n1@736@WA5tdiF-XZoKXCo>V4k~OMNv_YWiz*6PeX47RWw|mh
zUX;iD0o5j*DbRhmWB1lN&io3UUzI1<rOb@1i>k~_{f-0k`EEoPPV0ytF*14V!39cY
z#0IAeQXiw6<)6dHiFQpFd%0dXTEp)$pEyw2to`OOZ1+BdvluDSN+^*KcPmdF&ikiX
zTk-Nl&<)q4X82$)tQJ<Sz<f2+C9f`%oW19buENT0e!;8pB1E9UI|%|@W!Mu!Wg(nH
ztpZ%tTOtb;28SH9Q<B<9se*<Sm_>qfq!Kf~9)O)Z08VePAHxAq^7|gV|E?fAaNouM
z(^LHvVK#MGUe_{f5|?~)gtg4>V#BhqI3gCHgk%9^b~WQ^#zj`dCLWa{&QL{BXOwXu
zwym#CQ<{BwMdRU`Km5HWRQNlW#@{JuTBj}9NrCK{HD2uzyxgWx@ietk)ZR4;yAP0O
zWUr>vt2MU5H&FnU)Y;GP)UOR4Kg_s7$=~U1##ZRDaq-@!ofS8T)yd6PvGR~Fd@0=c
z6JRz+*W}^ABxp43iHICOUYgXuqnf=ou77&T30)u}rw>0!MteREn2ikfUwwKj1#vOV
z!k<gFdij-e)2+wL*TC-_8@%hkef6}oI(kvYqs?(^EAijSy=*8!Cs4S>o@O&+P-?D$
z9Fg3<|JaK6Pv7HkyE*5XyYZ^Y=!xg_)@5r=q%}p1uLRMlYH$);zZGx^1?>N(^_pDF
z7N$EFq7i88A4XWtX&YUkxhkI~&B}KhAop9d!=ev!@CC>2IS!MWB<V+JiCq@ecx}kt
z9<vw;;B`Dc_)|6KD2jB%VSLcO2|e$2Vv=ep96c|KabuUnJ+*&Y6*$)PfEX`m8pw#i
z8)v}5<8b!a-$;3o$*<%-@CZUT7wDjxq8Wz}+JNS_B#SRHZl)$Nt7OVyLxCGv$9Oz}
z{3_YK^TRs0sE*RpC)xTu(Wci9c5f2EM!e=j#F&y~7HuK#-ZJT#?~z293s@!cAE{+S
z{$cHT{GUgG9ef)nf|p3f`>XEC?AOxDA5EgPWPq`FMROp3|84o3lV!u<m$k_Cpf)Dw
zDXrt(HdD_g1EgTKsC1IOSc|r_sI;t<f6}`9H*Ex6du~RLG%(VB&Sm{7ZMX*L=H-sw
zk&Y375?S-koQVv_^xvOvUS_SbncUddX%n6~U+ro^EZBxNF9vM`QLflmOG<<jc-U?p
zAX+FNR@S+|b3NMs!NU+N0W(mu)v|DeDTUr|$(Po~{(9Bn-?OzRG=6H@R=`u<6Vv@?
z&*EdZz~ij}*ptb$<T0`NJ9UL4MtMytt+*oSOOi}f^FvVgyxly{Shm0)(#YYV<2X4J
z;$TJ45^r8U#pYz4@p4HSNsRr-@4o`JJs|=xc7%OuHhLvKzXcQk6zwK_hB*V|Q+Kx%
zUZ!Ht|4~9qlKC+Rd<%~dX^{<YceSsMW454*`5iYp0d6FD->!=#LUPu`5ppS3Bn@zl
zYe^L^NsUNGE}(WUaVfwLD{-XJGkt!FZ&RUgcaBc@!zFtias6y`{|ZA6@uJ|1#>pW!
z8vgL?@sa?FIXZ=^5jD`bF}Sm}u&q#AwCtNQj8T#X<tJOKwj$i|bHrwR^F&t~UPy#}
z3X{~dQ!N0tPh2(8H`D*?M4X3L0!Yb<=gs6JGR&z9t>!NS%B&uqJl*JP^u~hx=yh5Q
zG0^9UDHnQ|^Vfjw`C{<L0%o;OLysb-GM=>7?S@CKOpBi%Uux><VxiFqwbYsWG1%b&
z__jsT&3{*=+qTi8fJJmlKXK^@qKooJeynIUJegQM|19i;kX`-V6<0)*pr2~48^&F+
zN2@nSXku>)TB0OnPEz>JLSDlh-r{E^X3272oU>0govHoDZr=Dr$de!-L&v$XWj@??
zc*1q6Yis_sF@5576}5}5z@^~ZXIac2P#0b%*!au3c@w_*1gs(xmD12l2%q(v^)R=&
zwXTxD6i}FE&N{yfB97E4G@u!LKIT=r=;ten!f1b`z4{K-Z@!Bbduh6?j`a~c-&Jx}
zKZ@$oa`%f8V-vKH?N3+J?<B^)YJqEMkJ$`^N}$$eu#m2=uIxfdL{aWE$-klWmn6~s
z__se0*exf}6Uxjqys6#mseSM!x4@8W@0T?et7?k+*P|-foh$O73`_!k_R-g^Y`L;l
zzWZ=@CZh>5IT*@AXlz&Yh=Q(VcN_ZbSDr`a`h|8KiIlFAF~hBb(#FcdfvCA4Kg(uV
z4|?sLW8}qSiq+{_mD+K3{q#?p<Q0QO#&1G00$yKN7lFTHAE%P^!u~~eO3Pugm={xs
zNx5*%Cj&8r8^PN%HwIM0&9c)umQHu~=+Uzu;$*d-{*c=MmbylFe7#6u2)_PQQ$@gm
z0uQ0O)*BBsZ+HQNZ%UvKLHV2mo*CVC;bH+Ep|b5FMgl3%CcJfmw)=CNdoLPmxIQO*
zI8CWN-h13DpNGuOGz%2uKm6mU?Jew&f4Wlh>E^8uKG^u$5ay0bhp8%&JB@aS7M`JU
zs=w8D@v{%lJwzIbVClIplEBsu6Rlj~JXgd?^cWcj3bGou>oNWGHY*WjuQ9)8c|7Z5
zp!n;3)(OWLj{|auHPAOjYJEdeP0y4l1k0(%o{ALH%Vnhqr5Eb;P>iN5bnorP2_%RE
zKnJumNMjqM+wu2)5*|`Bsqfg*f86@*fIA_pGUkcQjZ#?Z-i9INN75#7ec`(N*~-=k
zvdw??PS&0XTD9yo?OeqBEo6}WZm_0{L3b;Zu&rk=J(egI=AA6W4#1tOM9Ev@Q)CSJ
z8(mo^2d@Zb2SZK&=N+p_?U0H3NxBe;bw-ZN&%KKIiZp?&D}s~ABSk+Ikz3V13ET_f
z0n#2KNmXrRsg617bJUP={$sku#naK`shtsfNZNPQcJi@i!L^SeF2aN}fy{ycygoKz
z0USUGQJ}<p49c#zB{-cQ{HkP+^3U2kDEjV2rU3g4!B*k!i8BptJMIf3viuxD1e==7
zkq|7HAQEu&RooOIR*onNzD{f*qb%q@-Gvz{1AHJr^f<b;mAY%w&GgJ4%e`EPyV4@(
zi4p2O4Ry4}Sq#AnIMKIzKFd9VE_&sKt05;t<w}!CN#mK@5$j-Ju$=y#5%4wzB#kms
zyo*qIRE&zdbHVTsDaTr9Ir83dyhC>Jqzm5@q4uN>!KYd8dg~|e^$=Y)`e(Sf*If7u
z&gF|VRTlmzPi70Z5b=*|c+t$|&uW9~&d9kgAtKz-*JS*^zx?;HLh(<zheFH!lE_L?
zad36j{8&g?gojxJQZ|QNF*=fm;EV#AEDNNP1&&aTGU%Ad!ohgF#j;0dg!597)`xvV
zb!s~*U9A68ri<672wB)uo(;^V3AvTo-;JbsnUcA9Rk%xoMw4ueu-Mik{suU3cK&xB
zDwTI<h_*D#sWTy+B1|2iOhhAAKT$%Xs|yQpOPg_IoJc4Ts!7lE???jqmOFo=X|GQz
zy@r4Hj%yQf+7Onc1uI=>@r~H~ab8LGl%KIXjoCx~FjHju%}rUNn!x=tvo6@?@+QR(
zZ_F4=!g5YVa}cV9&5Pmip%#{1mA4I@Mn>>QY1w>)VsJh>Zf*o}`RDI2tDBGnnWuI6
zyOe(hD;})Oc6&2W|B<B0OTL=cN}f;)!?I~n7yRzx!|c2iqHJ2|9F1e6-J^kwHkixM
z!x$3z?<9p`tJbH6nph_l0pTT-JhWKnLx{Pkb`OcYP_qt76q^ciss@#<k}wrZbsSG9
z2PbsUXa%{oHgEov`${;Kfj$Q^BoJ2S$<j2#97`8Y4Cl2DC?cmme&9YYD@Line}kN_
z18s55h>`vtroS$mkMgogiRUU4`+t4>C=D&9>DIioKd!;DZVwW@SNg^Q`%!uqC=Hik
z>5YW!(U)xj*vt2bQb2)~XW)~b!)Hpw!Ndq%Z8x;Cv(o+AF8sVfad~le=5FrM;O?>V
z=wG*dCJ!RI^GlnUy<hh*r<wk9G<C$zmBCfZi3@;vNc0``rvR}FeV<d;LYCFKNfHW`
zMDa*gaRm`ryG@&I(5NT*g#1|I{UO>H0$>2CAX8z6V!?!swz~p%(22j25*O_$ny?5E
z7qtK25Ms+v#x!Gf9i$sNLN#$+K*#=w2RJ`id77S%uz!-5w0rhK<c4nw10chQVO%D?
zi%hm;_>{u)Denh(5}<`^I@tz06QY<`8Cp$cS{N3p?30HPJ_0EHP<BlO!VW@&KG*--
zMkvy3e4I3tp#NBHr7Od+B0Sgac$#x-AW_fsMH0a5Ppt_jTPlg&h(Ul2z(u8ki9x;$
zlK3&j$U{mt?}5tb6fjprLagyYD0HRXolL5)2t1uCDVb=$L#hJ_QD$6Vl=Q#?uPyt(
zgW=%AFkGQC@;rbfMnp(9;9G~h=}0={llhTFj<d)9Miet+Oo@K7h>DL>-FYj3d=*Qi
z_l_ot8qbEE`W%l1!_~`uuXHRF`m{Y8lBbe)itDUelCVa*RtTX(oxw;b&z4+yzbjF2
z0x9QOa;+5xBg0bS03a{fzT4@30*@9~m)Ji#rM>nkh86Rssy`JXqu}FGeT(xz-S4-X
zB8#yvZJ(A02X?<v1ty*I!@x{@XshFOb*p%zV}JUFM?w~Bggm*DP#h6&hpH;oQ9BHx
z+ZbYfiZH!Cu@^_h3MZ$6`TqIHNN*oa=@^^3_jizFrE8=%B!1^s-jaQ82_Y2l+nQF5
zmam@f?!6^{#<YgSfj*Ue0T$o`)Mti@ry4g$2riPu2A@J#ko>20xJgN{W5-jc#Tud*
ze11yMO+<uz)byvDi;HPMm&QPkg$rN}>Gq+1S;vuVyOfJsN1!`Kc-E=~3PygJk%)+(
z#QzO&1cx?x<dOJxy70`}z4Pg>RDr3b@whUI_yR28&1+voe`YS=Rz%7uaFMxvUzJq;
zc_$<uRqB!=;>-D~4}J!`dnnYanhtXA7Jr{IfEzi4D47u1J}v+V5?MkZbktS&Q5$}e
zg?C+`qT&Dr6H8neTUOs){%I$bL;=;WS12WCtTdM$OE9HbbOn%WL;N5!Ja|G>sK=eL
z`MSt~XFo&#AmT_&0=HdTc_QU%jLO5R@_UkhU+K|0KR5^#1_gSnbl~4^{?RVV!NUpU
zDtzl^;*Z~)Cuu#Lz=*cjt6o0$C9N1F0wio8n1E?2(lvR>i{Z-;$6a%>kRtrT_0}K5
zys_{&jZt0iev#F(!BJw00$>Og`XI|aZST?ktgBrK=A&$aB_(kyf?~+23Im|cEs%fc
zCUJdNi0yRWP>nxe_`5qZl0o<NFA)`?1QmS1H2s=pGDkf4qHO7i;nbRn2v2Md@FnaN
z8P*urMZr_d+bj=~+E$ZkO#NX!vw?$-8sGYIv+jnicVmhMK0rm@&WPlkU_-P_0q0{r
z)oy+W6SBE7^tY~R4zEId;@(ML?*DYRIjJ;WYU6KGEs=&v!y2<V#zK%#2p-83qw{_0
zS%MO~JnA2tjCp$8LSQ)XOUb&askOG9u0Q3w!K)zjqC!2RXDQFUx;PNW*%DU+i=}Uh
z0R~2Z*gFIU1}gFRzphOTAt3*!<B=5RcY!@EPP+@$2CEAT=As8D^A+>+^9TqCf#Sxm
zPq)qX>oa^hwZ?%^{CR%I^$7FI2=0~XyyFZBIwHT_in_9LLTYNWNq^X7H{_F)F9)G|
zn1IWH{D5wTo2IIrJA8)S^DsT=M{4Tx>zkm<L6)!wn@j93PG&E~ME-v6;Dd4gO?BM;
zWeX5lnTMFS_HaENqeIzbgQ%!zG(M{;?tbfG4oNSfHhtasT$vhqe0X|^LgvBEW183g
zND97b*TYV<)9wJLi<8qYeIpHxkNha1fTE%zK|#T>muVS_;S|Q5!Se0G=FZN}mX@^i
z%g%el?#;=u3auJN?9Hhu4pH-yxw5gbF*`fEbO$$0ZP~_UY|Eze$D6}W!<y0k3?8cw
z+>>dXG-w$0ME|w9xT|Yp-<k79__Bk0hxHdfv)2OcKI?6|yRmU@U0qVTR+Vm1xiuYe
zvf@v)yz+8xi;3?C_ZvP+$WGgR2<Do&QlM;HPBeTL;{zI*IAp3%kQWzo_xANCyU~%6
zwARK(4YuM~3e&Lk4ZGDQ&KorL4$2Tqd;6cqsG$I>d&ZE`sw%UC@l1Y;hTdh<kMn(d
z$nuFZD=RDI<>l|iUTRB91|7o{O*tp6ZhpF&C$JfI5F*3xQ8=cu8H|X#*p7b7Da!Mb
zb1IINq~_)29TRcb=vZxbuxQdLuG2@(%*aT43`8PNh<<&29m`5hwfK0j(rEMe_{gkT
znQ+?P)|S*nMo9SAQv~{vGpF6l5_c9Dl?oLNExom%KmvJsd3kuOwY63A&g<r2T%0li
z1iH++$W3WTBMY=@etkNv0Ri8<%niGIy`*(bjWn+-IY;$o(m$gj2CEgzGqSULw6FVj
zi{YZiD&t5aoO+RGG|ySAWD9$6xtN%2H*fl9rZ;IP?(0?hJ?^JUg13U-kNg=;Wyev`
z(MeB%uEJWlySZ7J)O5cIVT;}^nXY6&zYOm;v2(E69n9G-)Y8y+jNH0CT|`4e+b?0<
z-{04~dmQ7Q1mE702{>-$_*@XRE-Xj=e{-uUD{UPd?!7x5I&T*un)==<_jF8uHWzZg
z!@j+})zHvDfD7#Oxz|)zXEE$pI(G-3)3Y8db2u<gG(6v5)>Kt}%op~!7|RiT?s~ou
z_68qyc-?T#6sy;X=p5|)iI!||+y=bv<V!{STS9O0alhOUwVEkhH1tu>Tb`K#&~?*>
zU71cg&YU{8;<FpdOG3?+l9IaqyZ*~mX2p+O%>U)#YWIE<2vJiK<;}0E$73#An576T
zYwmP8oTxJ!g$wN2+S-a{?-EFgB}Aw^6qMRXnm{ivUznSN5AMaGS8Ql%`Y@gJQBJxJ
zyC5J%L~l6rO#pIIQM0E`+`Va}u3lJfEhjfRt0a~U-CatV1`tL{Iy*ZzJcdA{MfUh7
zlI01vo2onz2pNbaG4ehxTCTSM347RI?+u%iKwa1e>caiu?<cc`7x$gr+}%G+x4E5a
zR_UgAgP`H~&*=_=k=`>!u^!M`gr%s<NyPWetsWd4EX>bmi~9VGI5|C~NgVpp{Ac2S
zY<I7Nwkuxjt);r!ejtX3fK8v0`jI|2S!dYgqys~A!pQ$|-%&u{z+io2V`F9IsTYX?
zYuW<j_w$!@QPQx}QYOE{L}X&Yq?ec1*xKwY&AXA&(e&1`GTCm8s5BCOdlsF#ko3hG
zqZ$NDa_=K5^H0FHjwU)csE?0<zd}dU;vgw0>Ehy|;Y!&3%=qAZwK?8(_H5v5dFU{<
zWy^UYjm+J}`s&mar50lFXLB|trjai;XUujvBqSuW2MR!Q0rxXPZX`HZFT<o~5SQ6k
zKR>_XmG3fEH(5dsVS}w%%CpPMj081C-S(i!DV-b^8hTECK0Z_`#T=0`hObUePBXu0
z>(j!*!ccJNJUci1p6`e*I&yQxRep4JeQHhP^FJd}^xjv>%*^!r1e!dwvA0(w*_@l(
zb8e+m%wmu$F8H79)^ZMYwzSs#d}>^1M#*E<YZAC&kD;}?d4Udn@p$IjSS@sz_-1Bi
zlD3PNzpjXs3}tRRRhO5qo|_-kTTG%-wY9fX_<>c-H#&Vh4)pldf1+(?@Y<v;?_T}*
z@neXwiC!@a3n23Lu)8}LFXs2upfkq5=}S}NG(0{&Uu~dQZywup2<>l<n@XMfy>BZI
zoX0XHTJ{^Wvue7!BV*y1WMA7S9R)gEk5$b-d4nzaRx-@2)UtPwdDiZr?<+3<z7Q1W
zr;C@z8)!bNTc2W)%RFrGk`v-Sa&vX%xB(x}axap%*Eyd|9o_ug5!kFXdB@EhrK+l$
zZ;&P+Adr@VNH^?Eb#`=AT2?kZIyyQ$Tvl2-g~($*p7G~bg)h44hX3<<9xz7aaW8o#
z=k(+x&1=2Q?O(P_0~gFPYiMb4-#|US>P*d0KpUEP$_AF@R@6%b;KrM(Dk_+nnQuHr
z)JhcB8*Nhk*xE*@nZsRAIzDC-fr&{-(jT|ODJH}vY$v|v@IG}E2~7C-_%z$CYHDjA
z-8_zrjBI%BVq~g+rh@N+7QQf~<DYMypr_@90jS_%U}Q*AJd_+2cyw(vXAKZfm&}|w
zf9mnB1W$jZ=0m>=kq_#Z?hPL3l|Egz`EW*7+cLwm<gv)1eRWR)|Ev%c>z<#6KvL!L
zirX7@y6(Sg`;u!MKS>D*>kUhk+~a(r0H?pW7}oR#es4*NfMU#37x$FGt>{6obV#jE
zwckk3=!0+lx!w$(O?suZl%6z_jpw&^bFyk>9fv5FEE;BPI~}G3mV}LKH*AP)YiIlx
z1(r;4&$v+BiC*&wtJUT2#KXF+2fBfh?J@BfnG*kL9tO15gCYIDzs81QE&IQRcC1b?
lw0?({NzmENf3Hy7$Ghq!w<i6E8R!i#vQmnY)d1t5{|7iWB@X}q

literal 0
HcmV?d00001

diff --git a/demo/documented/navier-stokes/navier-stokes_u.png b/demo/documented/navier-stokes/navier-stokes_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..328f18a3fcecee4e2d7c204c4840fde0be2e73a7
GIT binary patch
literal 60472
zcmeFYRa6{Z*d<)uK=1&;U4y$5G`I$62=2k%T{^f+aCZw5f(H*C+%;Hmcem+x{{Oq3
zwdQ_m)kVw2Ip?WI_udtu@<|3Ag$M-z0CYK7NeBRdwEzGVj|7JO@~jy#4geH@oa9G!
z&#a?t4`21qO9KJBBQ#$pbj3N7#E6i-(m*Nb=^;f7)!`^*@ZqwmuCwzipRfE@4wmR6
zv?Yz)-0XfFRv>``3!wDkL`qYKMJn$w#fL_`Rz**;GvvZiz+B_EJz?Y7KI84TBc|s5
zmqNP?f#F^3Xg%y5k!^pmjR-=G(}s~zDSOz_Hm7SaIbnZ@p#Q(G|IZr#cg{e-b_<_o
zIK-5ax2ZkXspnE#4kErmxCxJcFL2<1dKg!%O@y&<nPce52BK&R?|6#M@n7^)e6apv
zTGo+m*MH;c?VCO8)unJtMB5uahzSg`!a;w%svuq@U8YF{@Pfk+-U8a&cTeoX4-TnO
zX#3P_o?_DOO)F(2%Wo$g*4*1CpF_`sNckRwg2;S&%m8SokZs$(PVg-b;2gC-?0470
zh%x?9)n4TjI{Z(MXSd}tCeHe4UnOjvUZUW&yyOk+fg{vNdCs~B4KJ|_P1uyZBFMzH
z9u7UMa23T3FFV}Gp1ZKV^Z$B#_PAVjJ{I=+&S>ofe|c;89f?`lU~MS+`6D6r7lIw@
zuOSl(1Rv<uyMqYmyq9pU!dx+KsGvRuR)uyrB$ju{JH6~9+t84+@4I1k*P|E<uOZ+G
z>h7?YxeUWAd`_dMWHT`?G?$38d^Q<}ZPB<Vq`b9Y)K+Oi!THsq&dXcB@(gmXJD2er
zsvdTGOjR>8Ge19J=*Y;(#f5X+mrprD$azIYTZcb7?R{NuPgbN0&wmb()t#1q|NgzA
z0<I?D^+m0e^-rKMYCb+y@zG{|W%5(2j@_3%t><w+`qJ6bT*N1TFNM^O#!??G^Hy>G
z_`_;bKK%*@%LLAS(Po+H`uKHvIB2_re%HD=!5aW;G=rzY=k{c}R2dNy8=K4HM6Zcs
zc6OG_Vk|m595CWc-x<x^bq^^hC@5De{glOj9)fQ$ar3lE{<=3+JZ#sr@`i$y)&6%N
zLaNCHbMPwErEMe^!%a(f`MgDd^^J*KY&G7bQ@^t4?yO|?KWQp!8Pxdl!P*NjWse>v
z)d$bBb)VDr+n2{vht;<9@Ud*c+xy*IrtJ$XpUoJ)z`($p<7FAiHNRVZfBz0YsQb_;
z-<mCF`l{D1DZ_h!vX^UI=yEGj*?zG$B>dp;kk9__p8IGN_(z~821`ULp+_nf1z_yg
zOO~noZ}?PJA$KDD*g;nGz+TEM(|A13GG`FeG}U;nEUHG{Lv`Uk!EkLAEM`Et;^_ki
z_5ayls^)6rx%{Z{1iCb|74}LXhYBubP2RLVe=|yBO2S7^-R+2L4UqD^p4IFLMbG5;
z5_-eV#Z{-2$(xb0sNHBw2vF7PR7FHY^n_tFVPJ|A#Poj|h}C9JfdT`X+FDu*n{lGm
zcBhMV18Zw*#~JttjY#bv7K47T^qTiy$qJ>1zjCnV7MvOUE7{PDgf4n{#coVo_P6jw
zyEzch8EkraTfMTsG^@VOj}*V`c18oVBizj)(fzSp0J}v+xaYI$F~Sytc&HU6At52P
zbaaiVqOvkMw`Kf50uK)l%(GyoHf(jTY77gvwy}vL7qw?60E5AAN%$SN2C=BXH5TJJ
zZ%ID@nBtXMKTT%JRR8}+jK@}J{CeVUK-*@tZfQT6+={Xn3Xz=2a_D_M8t?S{#K=V6
z^JE%~30pM?5u@=`PFXoFCdN*vwxndIyfg>QZZ$<?7ZfgXw;q(2m$$dK*V`)zaBy%$
z;j`h1Z|&~tR%sMYBCQ8uh%B^uT~fyhIWz2xi|>8DB06|Il^F-^k<C(t{joTd`s4qq
zI{!TN_~J7j;&ye}(-}Hv-AR@CuSY33B_!Iq{ECF3hn<CniD{TMSUh}YMm<iPfPkRc
zqz{F~-F34+Mv^92tIhK~i9wB#iD|xCUqRBm?ta;!6G25^|M_B=4Q_CJJYfAR;z`@(
z*q=l?!^l6EMER+CeZ!W+!Q0w%C#s=`J9i2Ue7Pv_n4+Iv56C}goGdP2&dH?8QBe}z
z6Im#>46aT-xJd&F_ITQ41?8aiiQE{~m7jP0QLe3xqISNLZRhv;UxBG6T`W}Kwr$G%
z=o{e3DD1L5ec-Iz)t~n<2o`wt#}^kDS65eecb<=`RE!J^4D|HP8==JY!m!XWXtH0a
zXUj`VOWWGoYP7qKJAvg6G9n@rSXjcYG3$o0G>$@--LW6-H%sp`gi!PO3X^o2L?>`4
zK{#f*-csH#E;7OS^y6mZs2BwOeNjl*z*bUsVS?M4RH4Qtc2_83W>yfb^CvYb2L0fh
zWbM#%IRA_*l*uBxpt9oB+OX)@^z9t!?(!?NOSOBL(OB?M0V<suqmOZ9!vFsLJCcbg
zgZa_%Qp2<_uX&x<{l#{j#rPa^H(SSDL1Uu^aY{nMc{eJX(Bo0v4K}&gRst+oPFGqr
zb(!06YHVf{9Ai@_Q;>Bp>~eIGxGR`G#5`4=YszJ3yqRAZAL(Juw_jfM5aPC|`0;XV
z^6FHC)>9w9(&}L&fAf61w&psmq}yb#Bqujn+1}jTe7xM0nw(53<XL04+z3m(KRO-`
zpddJL35nOc0Z|mnMu#<n&!5fM31UeFZ(w=lExCyANE(N-&^bInwbbnN#o75{D48kS
z?7G0k%{Q9^zgNJZzoT}WgzXF8;aEKf&X(cU_6H|qa7JdgeW*80>5N~Tu*biO_N$p`
z|6IFs@+EBqO##VIsDvSEMQEi{TqDW_u#67N5FbB&{L&vySwJf2u9(4%EavL!DlILo
zuAcPAl#!X4gws?OmM$*GMRU{A?qE64^=JXB%WYo&c1BG(BsBCbnULq<Tvfp1@*1z*
z5-fxe*K>SM(nb6pDz)qISoJ*RcE?#MPJicU7`o;e>-$;Qr8~a9tzZz(pxXMSKD%Gp
zpypBEiB|&_(;{~gI(AlmFu^2em>1ru?(M$}KZ$0^S!o#@r<?uc#oR>7+k0Bxe$1bo
zW32Njl~o^>i?jP5<46U~*K$6%9n6%g5yx3gmng~q?`u=ywBzxl^|ZqWYj+U`Rv<!Q
z1tLU70ka%d6G4yz>nn1_m{7=&09=zYd8$-ze*$Ng{J5Ty9>;G^O&-lPP2y>sB~IgU
zr<XXg{gPus_SLkDA_L2-R{chGkaB=a)Zv&%N88jiN(2s0iXvu%199iQgOw0!@s&VR
z&2{e!8*WBy(grLEo|9@JwIkZ4*ThK9(-&UedRoPTF@^h(W+7e*qaAm%Ppk|nU3loN
zFWzC&A4Gd#`#|ftdkfp}AHsaW_D9cy>W*ETFci!CH$!eLER6v!_OnhuJFN*DkvXVp
zTf?4n=r$f=@h-q>vs7kDkm1`#pBI(K4vDA#?Bt7XKz+qn@0niLh+?YK7A<U4Ujwv1
zg1egY3q}RNDia#OcLt?jN6cg~4-KK=v3CMowx%!s%@Nh4hn~&P0m#a&x!ivn#Rd~N
zM?QbGcJmTxGcXtTTAVg^G*z(MX>qC2)iyMQ6do^jN`Tm<WJie?o^t<wSvht(*UW<O
ze#*lC2aYvt>d_grv@C*;e+luASKBA-M>M9qdRMJr>$WSpL^eKsOyH7{@l<1|8|Aj3
zRVw-u9-8APT#?a!asw56I6w%qwY)YvTFB(E8*ZC|vj(z`k$lj9rM}V>25xAg0<9j{
z(0jJVxwqG?eSKd?VCLIYtHJa}_L-l{n4U?8$Wj)^OORXpxwe8aiC7QO3b+Sc&J=!#
zOti&rw6k6Krs&1N&MpyfQ8Op2W2h9uhb`Gd)HB6_sR3bmyJe;5p8iO->2)h?c<iPp
zy4H{b70|WQ$sd?=W)$wZqc}pkAiJq7Cv0G^@hig;QxSblhEwj)oCZN5L#i}NSbCc>
z&QVyC!}_!ll7@-PA}pdG?`8`PE!xiW{-(%j7c&lR?Ki2nCr)8LTie7-!iPhx!A93`
z(3({sUehu&?$D)aJ}LdG<`tj#U^%RSW*lWb6yfQYQT5x(RED^TVMTg2pAQ{lIXpZz
zrP%@=WI##v9ss<nDNfXEvbz}f`&}~bx{WX+=?Z53wv9)0teIwwuzypJ<9r2v&2xNl
zWsg?wB6nlknwA-}BsQOS6`MBup0uKVTO1Xu3m@aNqDtp-mKcX?o4{GVOa#zW+WVED
z0pArq8-M3HWcr-$ll)$d6YcWSi1JE@if%6*2pS-6=u#E5_|W{cl4+^$ird@0uy0d4
z+L++U^I2?+i~(D44Ab&wip60zJ&IbDpkW2e_>L!G=sB(@OK-(bTqGs0T6YCEUH;;C
zFBxj_EcD(>X@fWL3W=u^PgKE(&q-FzB0`=M-;wj{CZGC)b^)U$<t+LhJrUM<qWrKA
zq?%l|Sl)DWwahhDPqPH3xs?7VUkfAalP<~ap8vAMtfI!~66sSF1hOp^A1n(tO4UhM
z2}44S3CP1jCT#YJ%tn~h*KC{AceL%bjQ%#Pxr?cecYue4gQub>A*lY;4+wB#A3;`f
z!S3SJi)`KhO}zOY-ySaZzt~h%$m8b8h~t&;>IkdNoU|bwQvXeXa~bJe;${;e(^W=t
zZX3s?$o^hh>@c7D2E%?+>SO4+>RnTf$CSO%p&eUp=2;oJt+wxTHz-f3(&@1A4HR&y
zMFVQN&JKbCub4gbr6j2*|0e90F%)tb$LATwBfMU!-1rXCzJb?x2UOT7d@NU*-q&1v
z!q-(c*s2}bxUCSy4>hjFgyo+^WpaV%-D1kBw>kS*44u#KfXG;##`dq(`GK-XAG`lJ
zK5P@7CXfQawb-SST~(1n<!sOa5-JclX~$|`rv_!uDlQv42@8(Dzen=;e7G~&!nRU7
zIE?o~NZ#$89%=7G$Q*1ClN9gVt97j%369Us2NrqM0i9`NQ;Uh*07UiHoSELf+R<>d
zS>LEs?^RK3KCYj-Sz0N<d%xlHGNr`WgyHz5hW<J>t@LkI{%4r#nIGIc_=O0u;=0uE
zywB5|em^+`C9>HQAt+rEg;ukiuyK$;lB%t#>ZEbjJpxZb!u`F!_3B2mzo^ySxal^8
zWY|%N2Aoh6%bv8YyQ&9iJ>J%7KZ<Q}v?C2QZo`Fjyorw@$4KimXstKjr{K`x3S5<R
zFKPqkt(l<H<#VVXB=wU<)vA9Z99ByqY=%kW{tO_j_OM;WMg=^tcx_oHnu;Z*2%mgV
z8Tz2hz+mG0g^qmtzt13ij}){XJ*l%FMr=j8No(mQW<Rp-dr=BqzgI)_#Kc?z?o%oS
zBtt!y4y`}FJmhmLaWs^E(GC1Q1c;$%o8dtUD4v~1qm2C-&_SuYxv9VL^6{O8DnMNh
zbFQ{)a2{igOE%HRYxx-re2m32(OvQU5%L&zhf>3Z)=w*HoI)!<eg!RVhufYeVHvs@
zE6wUCH?tU9b9^kCSuuViJM*Y&0K9A_k$+1q!K*}bWEvWRWdPV3^B1`xvj=6XsSanJ
z)KJpXCAIC~nU|YLz%}9*6?lB_-!o%fOaIqzhmS&RN+5o1c`qyLBWe&3NY%@;c~{rP
zE`kzp*G|~fX|It{%q`Opdri+DxHnW2X{{gKnbH(coBFotp=SaBj+OIPoZxc`y2!JO
z<A-i^fFfpr&g<)zC{8n&uUaqg4Dnm)+0TqMdwy*xc}`4q8>J|~c0{?(&LmNp9@AHP
z<!+Z=-XpVu_MuRG$wc^>Y8#2>VpZcvw$TS=5jUhX2|r<ddbtc8@6aU2jZE$6|CW4k
zXY3(S!z}TuosEjft-_<n<p_-e=K+zrg^5AxU_K_>shr^C!Icx^5Shv^4Auqru)~rF
z4;<Zt6;aJ~@@3*_V!%^ZpJSppEn5&c8xF88VA>cj{dtn$(j0?}r9Y`ySezT7bZMI}
z3?7nLkLw>?^oMFxhF&5O_Iqq#bpD7>{hDZ|<Hy4goFp#7DgRu=e7BQwXs!F7+uE7x
z2DT7XeI>5)IeFQUmpd>b*g^TqBA#pXudr&mac;M$B3x_nm!KTOhbPN>=28DFAW2i~
zox6Dyb=cXGFo0?A{3kUYGc+UWa+#r)xORxG+wCvga)EduxN8AX=Q<L5rQ7Tw#T)o+
z9>R+sAOiDE+#1XW`1}OUO_%%qhfB5H`=;{GKs6yfBNGF^7TA?{7=?mSYg)*rSH(92
z9WcX%SLx>f7TU?lg}>%925IAVmhIc4)?x(^As{^TPqMKXpM!2bz(MjTW{KWeF%R#U
zD~`-cw$E=j8saVR99%ayQ;X^w22>}*J8ofuAPlpLXi@PH*=&qg3jhAr_fP*Ca+<yf
z!7a=j%yM5_XUGeD2XM%(4$v^(F4o#AeEj~o;+Kw@#^z~qdjWg}Mb90rE!G1`ZuO5>
zON)ve<NEzI*Qe&AIVIAO6gX;Cf0Ez&ly-K9!;HvcI~<iA<d{h|9f1Y)4SAV}qF*85
zF>j!+f}hwYe)|rj)yf}zkOrpWj8~uEh#9h}=MCgucKYOOoQ{V-*&a5D4#~L$hs>iB
z_J<iqO$@6}Np<<(Mz8&D)9~{Fy8g<g2_g@~MIDx`t2EmAet}bs$JC5RS-KyniicnZ
z$A6Qx{wNk306}5kstZXnc`4M0`=r4zSrO*U+6#+0jPCzpPRyAJpmTOb=V~lL{HD8|
zY=ZYIX)}up*$aVyo7Cn7BM7=)9m~W_@HH#PG6H2MiJEGUYJ81)gR+ZopeIStY7)`J
zk(==oRZ-@bfJLW)n{VaZrv?&gSQQY12%>RzmZH_%wJv<n3(HZ%R<X{<GFEJgOh1~U
zBnZ;}&*}9w^6o6;GJX)C_AnKQ1;`=|$RZ3?Sx#0_3wpZqNW0nB4j8YCzaw*DKiF7U
z+tZ^o9m=k!&j4_8CSPX}^VBe0Pvo+Frj$0tAaD8>)^?BJ%n15P|4Xc$IxQIfl@c|@
zyt_70&%2)tGI)3wz}%ldNde8(q6k@TWg&CF#Am2#v1^BU2Fj1|E#V3Rq268OSjJ+b
zY#ENDM3Ymdl1*}`a^J{~;(ABJovd#vt_$$NhIjyi27nj<i1~H<PYS{M1`$|wBV^c0
zL#T4E`f*Bv0))BigpJ}0dRQU!UnO@&asqc7c`EYl8D$Y!)$XrLiomg4P<fR9M@p#|
z4t-h$<$s4%03(ZXYJU-7=Nz`ntqTg&AD@la%7mHnql!vPJhm&YWH<Buo|<*{O6L-6
z$zLe2ZpXj>uf^YoxKL6#xA_<xC_P)@31uMCO+)9P297{9U^_Y^brN-&pESgZ>Es9M
z(nC<gr=Qg`OH;@Xw3*KPllI3zrFFu|6;j`&4HkO=Qy?%C(tpGF$bgeGHxLYe$aptT
zM}uRQtp6m(Ibv2M0-Z-<12YGAh&z2fSed6N4kyZUV=g!qQ4M;?XAuK|F>kiJE>Mt=
z8O-#F<%fexLX;9x5COT{h?J|b(GRRTIfk8A*g*IpHIP=3T|d#EVw;pR#mm4#4pbqP
zzK1irpqy>ZWEP<YF!R-viB_<4i<w}7?>Zn1R6>6rTlb_k$XV^R44z6V><+L;H+6~c
zN#N{g2i!&*&Kb)_*#9Q*uXsAa=BXiPRHi6n3O@=d#f6TL$GeJ>`QT>YrQ}G;(hU?x
z#;Hl;{p-ObM}an$STpVwguE}k!n-U-c*rsPGI8NuDA#1NPbWJpqengtXUiB~?+bWZ
zGKUvIy)E--3hsS4jG$1vbZjv%1UX88L_~2-=nHaGqP{m$R&CNYoLKTAtf;*dK8YBv
zO>`5&#sE^-7{Haj%uJc^VlSBMHI^s)eENuE`!2v+UgX(=r;NNP*g58pVh27vbBDfU
z#+l{2UyC6Sarp#;;NR^O#jMb7IiwIA2v`FMKSfrfla)g#O)xB0par#Fke)0~d>Tug
z|4~@Zd;sL#!7FA{0vj1;dFAWhwFg<}cPKzelsP1k%HuwsN^i+a96F0JI(REzB{k9~
z`)GhH=GoIh#zA%wq*CQO6o+HG=g(%DUlXI{6L6gOFgaM>052DYU@@=aD2^sa0stxV
zy3yn-pyEB{6;431&0kze1Y}Jw9*5O;+(Hg?7>XPZOen*z&f!^jRxdm2sX#~!8yvTO
zv&<M8B}rOD%E<%z?$(U_)W0c$vpg!IE_RE{_Zg0b^s<esjSimr%<esY<=#q#hD^|@
ze2=&i2D(<7TH2}{PC&9@bz&7fF0V2Fymg(sStd<hu1#E<^#r0gBS}h%E|pw6i$Oq<
zq!n&fc0psWbl7J76L*F<u~8~y_mC}IV#?vlIAO)uQK^e!;+yB+RfUz+DEo-~V5j;$
zKK1w?9^1I$vF*~i=X<}THDEoTHmq7?`~ECrw5>tfr^c|e0x&V@-HRz5+P7c4asnQr
zBgLDMfo(iNGk79>%`2LRdMVTJOV*#xZ&`d4&`v^Xt%F@%J8gA9d6;XNL~Q8RQ}pja
z;tbsOQ8v}iwscB}(0Pog851Bp1^{C&A>?WRP{>VA_mC}@?zHonNj)Bj20)6Bhajy)
zvWyh3ZivgD=UN=@yw)YR59utZyaqmBlNnO|PxJVbAsdBrFKO{79h;Ky^X^W-E&nQ7
zQ3f+;Gq!sOK7()W^7m)11nxu#DuU~_3tfW>&1lgT6+ka~-0=ySq5-HVg`=R9GC?CF
zJ>WNWcb@&0@?_~!Y`%re&=*kUj)tkkmp3mS%vf7FDy#%s6CY3fhuK8oF$yP%;fc~>
zp!?jZ`k}{^=C7-N_*d(lI`lzMjb#K`g0HpKVc*{CMS0DOW7ll8Cg|+l|J@?Qguqr0
zPRK#5?9lBD_ZzR>kR3l~hsYbdYxni8k=KSqFXcRpwd<M07!!EF9>Zwx6&G4t-w$Tp
z<7F*T^Kh)LlGKC9M^pe_6&EZ9blV}Q%AX(DdMNMA^`JoSX*yVG0V@Gd*EUzXY^Hb8
zn9xdRNdzlI60*sn)_j_mUx>7&dlSKwja<bldBL7PDL-S7^Jr31l8LwI^?tgj(z-x4
zp%xN7ydtU0V5%KG)6#Ywws?u)LJ%v(1)0F24LJnO1y^-<*UpJ46#-8?mqJv3E$u?9
z%i;$&TDZFaW3fsk_pb4r2u~Z^OGCD}o!RV#JY^mbPyHSPVzT{KM_7WpBlb7}5tJ#2
z(mnUcJKXNy1kh6&REp*q8b5=4K7~Z(q*q|#GJm7{Vuv?EXPjFaS`tWR82p!t7ZFxv
zfL3Y0*mP91usD#IS6vlN)=IQJAy$Tk^WrF3A|5=nawx^s%Th>E=n88p@<<!ok}=by
z=XN1Jbfl*S2`4-79&Hdq0}cUkvNxfg;gIgmjWE=Bf$B=i|CVoa&EFzo|Fk1u)pF=K
z%I%bQ->p88TgH@6wMk7L<jjXijQ{7xcX9dW6?G9Fg~*5#LL5i2&L=7Jw<d+~Vu8WV
z)~w9}#5>q3_n0+}QBw!@iAe=A<V67r`)gCb3*n7!4csiK0^kYy=QkWc<lE<+LkB@u
z`b2IRbA8mt+yD|Ko>E~_On8i=hfs#HxO~wr#UF;Re#@#0U`6Cl`T1BY!GJ3Ew_Ogl
z9G#CdCf9bDdBx;WckF2uS?z`3Y608|2gIkJmehUHUA`zQ#JJQ5jvYZWQ*gyeK(Z!3
z_jLk3x}E4XpR0^n$M+FUV5+m=>^BaP6}N@1kY1E=wUB4bSplq^O#kK5AABQ5*%@v-
zJB-w&fPq4JzQfCzE9s%@sj#E^4T82Ggl>opsL^d{2IisW(6YOS_}szKhitX(*Y%w6
z&GtI4p3!n~BT?PES1Q;zFO?%``L%Xrb0XNpf}lxIs;ce`zoMyHMm?6HAesI2U9{4#
zZQM3%{6TYt2TADw$#aGl0%89=th8$fFEeKAqALTpD^#n0{}EsdikXrX*ZXd0An3~G
z&#KmC2C0WFr~nJ@>ion3@*v)({gzXTVi>Xr@os=zS`8?QDD`b=#XECQCEC|1X9GXW
zL?N-=zTkY`!U<n6z<G&@wR@IoZOK?>C(1ALw8>(#tMaVI?)tH!>acl^zUPjFgn2V0
zT7NzFQm0|C8aYyIY3|`dXjthI-LQBwPWg2!>s$a^(o<7$FAmv_JaP7av;fZ>-`P@P
z;cVTig=q(EitrDKV+N1_Or=&u{Q~Es#jp&Nj0$$PH<u=V$05?p*7d8%Mt#1_G58#K
z`rN}zj&}qnN{(&2xaGfv<?0Z8VsC6N?qTfaY>m`ji0`@g^8&&Pg)67rC=)%x#q`XD
zC}E__%1Xizu&AC?-1nj&XIOv@scy!H9IUF+k^E%IP%OcxZY)J?sPi(kdoNL;7v0@Y
zvx5FT1PI1b$tzh&iF)XnLQ%;Rqj<O2`27RK#F}P1S!IntHDInM!Uk`i*_WqgG~{0p
zY#u5~f%QLcU=TxJLqwI5MD(%G;A&ITPx@rTf^MZ2lTjtheMITzVql48d~qPnv2dX#
zQN99m>i6?ik&mPXp_FUSgD@GZflhHLF>FsAO}ikX@(|e$TzH{+EP2X~I1voKjhSev
zM{S)j13;l<uMV9rpKNbgf<z#OSel{@)iGtP$<2#rj=B1NI$wG`*qC4q8ZuF_&~)<z
z+febD!x|i9XsZ4}gz}#&A<Q;uS_7J|UzHx@wem;9v<*J`ya$D2qKNs2L?tvc5$n7W
zm(KA|*jf~y7C+7}NkE=&3EzHFU8tF_8%;G}{$@Tg^(y7-Fb)SnO%Q@BLxj#w*KB<$
z!auM{guk^#(Zq#^;zm#{N9X>Y&_1FtOUp&ZA{F&-gE4$BFE8oo=`ctiMnpIWRaRHC
zQc$cnF546H+Ad5hi`t1cb##bOP~<f?^9u_494-93c`p5weK1w5ASWkhV6eJ3S;*Em
z;uSNo3_F_d`HOe)O!~Xz*6DX#zuA0?Mg)xzYTV^kQc{Wi7woF|S^qlEAQxOS%swPd
zWxV}BPJ`sE->%Rhv(_vEQ6zz$PXg?eQ^L$4&|mXjX~x}-G@}5h!oui<eSF;H+BG%o
z$LgDfC81=m@1w^fOsGg=rkVsc8N@qSozhqmFg69ADuc&H14c!cD(AkXprtiG`THv-
z3`SxG27-bAkK%I|!67Hd$did9!w@=yHkP)uc<+p)V_{(dinP-(3XgSiOB<;@-p^)S
z=I_+^0s77J$~O$f!d?^{0_&N6u4iRoYDK-jV!dttmQZQe2Xa=NTDz)KRbpohearPA
zwcp?MOk>Z=d*r%4zYP1;J44e;NjbLfyZqf?>NrVtAq&1_`^&6tWn0r9kP^ph-yC_4
z&DvP^3LU|Yg}5Xl2AMC6CR+`7eICu^!=C)*vMciXblIP+5+nV^)%7Y)^hHZueTx}J
z5XQ%2QpqbTkB^VjQ2`EZ=h7-F6CHk!;d?OpVt9Pqp`+noJXF7MH3H}DGin5PbjEgR
zRhIB=bwDfmETT;n;D+J6&rJW`Y{yu|FzNH}nZ9YMuVHj3vSqn1a0e;=Dk$2xG2eIr
z;4(~Xk(DuN_rexTWktlYvM0NGw?$#n0|NZ_RuP(lO<X{E#If=U?WaXyUHq)~e&5L)
z67S*cb^A{Pb`Eyh&gD7GVZ>F1aZl)I8i#~WT6+3oi4yUC`7<GwnW?Gk-bB9U4}%+F
z@o*U5g*|y1@cOv0phXD}H5*Q`lBv?LF){gfw$USOaF*&)+!j9a<4@u^F(^s1g?_9p
zb89UpKHW<NrI>C-S#JFI_eWy=K@^~S7LO*vF|o1qS72em<YbmScR)%!Z1ba?Z_G+T
z>vIG}y9e6$W4Uk3Gc&=Mk|&>xU~vD1N=nkVl{_?;$-%)v0uGblXJc>g2N<WBL3reT
z1tW^k(b2`j1zdKXu73o$iKwfoec>j`4S2b4u$ecwva*5UBlJxpZUhqB$=tqq9aUEO
zTxOqvngf3^ZWdJ~4Ggz@L!@AwcPh|2IQKtcR}(Vz6-dN4(+}!DSumC_YTl#jqSQ1X
z!9MX|9NrkO_*W|99!@i`WQwfFG{G;AIb5-(K=216v8%_6zX2pqARwi~#L-_Qf8$Bp
zC@nVvv)gWzO;}i%m$$L}d`w(cl04wa3FZ>@R@1;=mvLc-&gVuyQzfNQHDzH0qp2df
zrT${5=##<Vw;nR81|k=`wq~a!*qz3+DAm6+-aTm3JNoH#1Az|+431~9(>)D#m%faB
z-V%g|&WP)$$ya0&SDG#U=ui;*H;e2^@y78u8KkSNe!TiAJKy!?iRR^u&PU4OyA8Fd
zcT~p%3gL2PcK3D`&#^R{?aH^(e)j0>%1Y)|OcY9pnp);NaY{*Z^ODQ;Vue&ztr{_1
zJ)wXXUt{BZKNfa&cE`R*TuIl9tv@lud>2HNE?9entj`B>3JQ+2ZTOC>ZmBq%Cg*q7
zk%vJ6_CbJRHV!lplB(M3oF~BLv5U;&V|;D<Kqy+HvBpaF5Dq~Vro(SZaBc13e^0^j
z)<z#C@qjATlay%b-z$pVSo<SyJdXD^Utki|de(QFQsw3r_2i<8AM?%acxWym5SwNQ
z$y3l9^vKA_sm9^q;pyq=2KtG9%*lL-uq^#T7%S?vlWtLzBv}u0-^oH5RLaPxC{z>_
z`{s=|b|WzL$UN+b3iZ;1;)C1+Q5X>en$zp66iAm=!hWmwRb{C_6(U1#sF?gx$_XV!
zNqt6=b5hN@mXi6BSds<^4}50zf%cFb`{zF9KktvN=9YAd`@!QEE4tT2&`5GDlASw9
z8lN5}QrDG1nL`wdsL_+yJF!&^r1t*jxu$U}@^&dwB`^TP!=BJOo-P!k`oPd|JZ7zl
zLYX*Nc8{aJyto+46%}<{7kkWUTJvu$DR~3!Gtutwy$?pl4*wr!yjy0}{PJRZ7)F%)
zMbM5{tL}iAGgyxz4wMo!WPzfqiR9H#AkVhleYEsi9X;;#XgCapXmOYsC6aotyx83n
zEp>YFA$8raC^cP8Pw`4Nmv%b<_L=YBD6^{^D|_1!go2>3S~Nd52fq7HYtyn{Ql;Be
zQdDG_kn7~+wA|#-6h~7~Utb>{9^Ta@W;fnww>&g7^z`&}bGjz#eYH0=HPsh||9{}l
z4GQk-r1qjbE13)JOvw<S1O2UKeM5-ndo~1riOou}rhcoH>J`eemE6G;HdZ`}q{4sI
z<r8$oB)kP~=%vOIGH-0VuihzX96Oga93ZUcOXQPQeP)BElAk?QW}ix3aXE_-gq|zD
zzC2@NWAoW9nf}xYMJI0jGVrzvUJ*u?ySq28n4uWKcxRY$sop{xAmB0|fmw9T|M3``
z?h_iU^zM#jPfkt(u%p0=lgriK<jG1a9W5=ZVMm+a<4vmNi#V4M;SXailfxVdxTR2W
zd9M;lrOvqE_~mbhw6R5_Y;y_>ZzLt;;oT6j>W$}VdFV-0kdFW5leXbS7T|DRa=1a=
z3;fIKQLOH@1c(>S<sV2g@RovA<{5p?6s#$c#eLa8mIfN*;%PdP75>yky(uJq<Gt+6
z&yw@qB|6t7cog@1Dq^4BKcL~1A<}@lr%<l#K+vaapKOP)3|{_eX}p~&k5(02%e1yZ
zWd?Obf==0LpWR6p(Oox-wBg^n-xmw6Q=<iH_fNPqDW3`#mhb$J@Bcl!0b@yJ`fS-Q
zCy34L#mRW$i~MJd&S`@q2+#{g?&LqEea6-TzC;<WRasTpR2rixI$Na!HRChlI)16L
z8Sf!cdftnz7)%ATos&%t5#7B8X$$zkw^H8QN;TAY-=+>ytSv7^dye)CVc6~G3a{Ha
zu$n!jrzqS*uf;<mTkW;`+a>pX){QT154!<+t8{z34f*~A1H}JjVt-Q`{q?)s{cqUD
zW;3K3IG&}pkyq&J3vJzV?u(GF)wOAb@#6^yBL<CZMbUuU*pPfY09jT^B=IC!;kB5%
zbz;=b>c?n`YZJvpsDoZ?O4h`z#{pm~{6=|$_o2VvFU`G51tl|<qM8j8Ix&_;5~vjN
zsc?AESKeg<qC*B82}!;_WG0CNm=D<@5Sn6m?Yg(Hxxd%#xI?!3@+uMrUX8-K?rd4g
zPF<I`V%m+kT@H9ex)>A7wQTzPd;%XCOGyN)dPiKwBd`9V>bd`+0l@DzP1rv<#8;H(
z1r_<2b;oos(r1ajyOjB${1!feJy5<Pm^UV7-xSsJYdo3wml2CBrXHhd|IyO#5%1HL
z^^KMUF(y~h-*wgI11j1l{Oa1DbhZxLiZoK`r6P>em`Gr-Zf+d*CqwMQhTY`fEBQFV
zD#wp`Z}<(60U2jd$Rar4g$+3bLj<yuSVJ7L1m0-l0Dp0;RGcQ0350J5Jj1aP@F+Ug
zOrdj1fCi@VLCD!fAVN=|zFRPK%6fxiPFljHqPjyOUeta+=6xpS{Cp34D|gBE#&$@V
z&0+k3nZ!@$PK7+BxsMsCGvEK{a*p6C9vA<qxa7H$y7ISQp4bTMiT@N8(yjVUcRnaJ
z<#$I0foQkzZ=)NQm>&lRPqt4%@(NmfjaMv<2cHsjf=lYyNNAL?c%5+nB*v%Etrz)@
znc^62KU@A)+=PkWq>bkZB%(?N*`rfoKs`QWZLp8;;atP8Q_E*mOj|Y9zESI2q%-CF
zSdxNNvcOERJ|AWREhysnaj%77<>m27_qbMF#h6^SxRj#Eo|M+_Bk;`}84$n?N0J`K
z%KPjQ9wu6JXVA?8D!i+&HY<run?lZ1&`ZH6l`5<!nvn+Rg%kks*8EIlfHtj$0b^-v
zbO5y8`kdz03hFvypl9wqQGBwAahnQya)~$gCBhRo+^9~{(6`wic0;dj?KAXeb4npX
zER7G0U#KN^GOot}24@z7e$j@DFCQ%D!%@C(B%2Bn_t*u{AIy%6O@nQQ5p|E~K~xQc
z5_FQqgZ`26_F)w7<tr#@dcBfT13v&_i%wWXl2CPd9|LiDnX{urHU>cXNgwDUgyF!a
zN><Nfoh+nE?^N`AoE+p2yW!@@JL=VUF1}Ir+`&KTE@Y;==l;C7yd?aQQ+1y&;-U8J
zAxH%7ab(5(^*Kpbif}QF>lj=;h#$Z-g>rQa8RuY#Ws>#Cr!sR)`sQ@vw01|e^lxnj
zgk-0je;k36oK^5m&9vIRY(FH@X*xksmLbDa4I6qz0zO+CZ&obikE!2Lq}bEXC^E%0
zC0K(AYcm(`O18B=eC>^Jma*u--WEqm&)zSQbB|I<kQ@Yr^ANg%xJY&Our96g5>UYL
z5ZJJ_!D3G@C7%ERu#igLrr}YS^m(#orDz1s_+sEYwPdXRqPizb$bkdQQ%@9%glE*x
z?g#$TEwO<;RyOHd^wX?Y?uj&YzEr=prequL9DZ(N<2)j|7Ds8C54*aYZ*=gaa-2uy
znG7mkW?T<o!$<H+GK6s&y>;U{|6m{?WdoY{_rburI@bvv9aIBfXC$>BPK-=n>abSS
zClZ+15O9j|RDIc0b+#Sj<r$I+YRy@MEa2mHWY61)S;%voXG-L9XjEd7BDCspe`1lb
z)*cvu_E*33jP*|5+0y-obReGd8e0%?T{gH6aL)Wefmy|;1l2;{_e3B)VLo~dBE!}A
zS8$k^LMSPM5-1PR;z4EF4WF$O($kjD-|H4p_UVwEvQtv7O#4Q=WS<|;iG|ujDxHr<
z-fE<tIDQi4!Lrn!M`i>wKY4J-#B$oVseG5_kwqOrJEhWm)NB5fh`2_gjxOb8`@huD
zvLcU_Gue@JD{&uAwYiaZtnsCOd61lt!+A2MHy+rF4d($n`lrUxNd>CYdZZRsdVZPy
z171PwqN`4_ToSu|kSRN=W%JBPBEK(+4vNP?<$mn>qC2rpo&K3bsbR$eZB&Eo9WdEf
zdyG=lCuO<)iTqM#1-pgLouf63gX^W@_^Lv5w?%n*ZF~ywn4sUag4jmK{l%yoBQJPt
z@ydP5rN%m^Mi%81E+7-nTvLqe<)l@P0#mSK(u~Cz4F~=}u9F`yTD{ilTz;;-l>WDI
z`xin>vUrkz%-~AVxbwkdBcvQ%K2DIfV@tyCwSo*T;Hp)vQ9IbfLtv^jZlOIB@V)Dl
z?$Q~A4C;l<1lAe-NA(!UN>m;3tiG<PDK{UdLdaO^Z+MXbrhsL@$T5lk3Rk@Kpd4w_
z0Vm_Je!|?y%+%PD4bb8lmoxvXOMpe85_Jw2;y)u!wx;bOV?7PvAW<NQ(X1c<hqnh`
zc+J5SRT3fh(YuUX;(=&;tH^*7@>Dg0NCiMLN)Ipg2SEjeO|%j)K0sVh{4=-Pd+*-3
zY=?n#=u>=kXHKwF+f}W4+DmUH?tD1#@<U0gn#U#c{ju)DmEl|*g!u+EY;Xe?pCAQ{
z&~ft>s^N<v0EF7jJZ}MW<@(&+-^q*ohQAreC+ZIC&R4zWjeThVMPm3am&$VDZC;s*
ztNNDm20FcKAj3Nm`zQJ!I~oif>`R(O%wlx&omXz3uep=L=Q?gI&dFvREBD+CjYxo#
zGGGA8XjhrH^gh*_{hLZc<`sE|P4)BPZ7FStQtu>Eh52W1*=48_g67B<wK(H6)ShZp
z2lJk9mzQcwuDm<~M(zdq%4rLCp|dcMu3A5xvvxfIFRoM3$ylYUNk09<;m;Dthmi*1
zFrx#&hZ^berIwL%zakM{_akA|`*s&N1E9hJIKj2Bye9pZkKu+`PCPcH<*yU$eqk#p
z;@Upk^Hw|QbHpl~@mSHs$EU}*^LK4*#izBfgEa&zTOt^(6u2n+PO(<2lG<6A|7Cc+
zg$rXSeNXnZ?KF9VMi!7hg~HB{1`K`2nsPNn0><<ifP6avU0X7BM_O1Ocjy1`fKpC=
zohDeu5rAai@dG)J4U@K)ijqt_xu$PL<?!7=+L?+B<Hq$oYEz^OOkGIvWYhiVwJ}F7
zeB|~peEQVCG%I-xqOa5lnf?B|Z0cgqg9%vgTZ=@rh>Q;0sW!AeJY+4VZqF9eVe`2K
zucN3SSw%6-8!d_13Q`gAP`E}bwdjttj@_H;o9zw&U2R%4y-S5(Tz76=Zd-}$(!Z)!
zXCMBV{Z<5rC&kE^6F|fnJ^q{Ahs|`k@Ut@CmF2-+DH9RUdj$uLr%+8$;5}FE{^R?&
zOx;E3=d+<$)E3pu?on8Cm1GaMWMaoXP_Cj>jJTv+S(4NEZdKlDx8Numz??GZ!sD#F
zMgr1407ZmRU@>c~Vmxry0io7IIROc6q(2RVl%<91X{^%h15dH!30Bgcli0+=44mgS
zC^h})UMJ*w8*mLhx6(rL3;bbNc}z|X>h%cADyhhZsFad2c)Mc>-NEHN3TN3Q{2{8;
z3znHTa%AJ*y$3--Q;}1QoNmt59W22#vtnkYQnHAt>6YpEV@^4c1C7GQKrQz-l*gGq
ztZHAbVyXrlZD>IB0&sxYF6LC-FKnN<H#n>1cx7+I<Uh(!&S8*u+6nunJ&bS<)ipEx
zuA%?sW{|P;;H~d6Z$i)?1;eM2>-~eDzigd5!wYUF@6JV>0buS_T9Ar7!V^7jXEg@W
zF&ZFG*$GYzlVG4ns$<c6U!}E1@a_O2uda)v*o;N&exOrUUfF2KCVWtTVZlem!xB7N
zRQClV9(iAkcdgvTfZFTo9Dgp~$3ef5?kW@l1#QdZ3r}lI#wPfg6CF2w!8NU>;?I96
z=&}i3m9{m>6cpY6*51Gx-~nsg10G*mAv&bOWq^88Yxc*nn?=7w^l{<$$FY)4W2a;;
zxEd?(PslgPnm9e80m<$dNB6`r(un){=^nnQeyc#(beUiP2Fxthv83GVX1Cp^V1RhL
za{H8weCZz>IsC8BpuB>t|JdK#-UAC9Q|M<{|AUSv?m+E#{EJ+n3h<8O&Kaqm_pomQ
zHy<{LDWPVU*UaWJRP>gC9&XeEu-sXKTVM8xO3*!Du=Ep8T9NtUaA5Z)V&tz_lzFNR
z>1gs$Ck_HWF+uIFxxQ8N-NmN9142u4KUJHa!|#DhFnnp3<jHyd;KOz)#n))tfx(`z
z{hWJnmwphtN%RqRUwIhXrVC6zj=ES|_ORbF!KfTk<ltHGc_KZOdQHXALp|xs6~z@Y
z7jWkuM#QVt{ZA$QRhu>EnY!;f<UZ+yVz!Jv2tZ~iL5GK~EN62e{qddh3mM;W#Vwwl
z5S+w6@Q`bfu^pZX!@`2TC*O18I~SIc^~scIAOav!3?2AHyZ>xbl~}rKjl<u98Ei%1
z#IV&jI67Z{#N}0!iYUNAWoRLWl<^LuY?Ob83`#0O1tCi*B|07Y!z<!xQ2<QNNOgQ7
zuB_NHj<o*lmNM<_fdU_fIx}(YG85UyzQ}05W}={911_e^XBjiYiMTVkF;~Q|&y{5W
zg<mkf!z_svXSgCL%WXKOpg8&!MAaaB>s#Fc2fy?XB*IKd2E40ANLp|Ns;xpE(q@~Y
zZ0p=f740$L1EH1j!MBAxh>{q(RnR^^75w185__(s1s^sg-ykasJdPxf%P3f%$XfaA
zX55f7+jb|O5YK!czB(Lj&5HO>Ed7T$%6WX<#iBPR^lfR?9tt3N5OaNy+!vSy`IjwR
zkbzRN3shYT?=WI5A;<g-^OHvwiweY|3C=M(#dAf84^brjh^baR>CmuEe?_kWhT8p#
zty4T!)j76A%F<B;G+y5T6K~11i4?U<CDqw5!YZru$jI~z!VI1wnhW*?W&#GYG*q#l
za(<k;+u8_25i&otixjJ3u!r6=oDHlBTH)_|JZKf>#g)`O9)P!=FZW`uafm79l|Mv_
z$3W(3L-wU`$mfD7&A23w(?c4=Rs1L?MxAuLQN&R$34`lBP8w*q5gMe<_ev9~0w)T#
z>XAOHX@VwF^jHG0?i;(*i{o{`$nv%6ZQ9AP!4GFDS+(PH(z#^+XeS;xt9$+WIQ*o1
zU_9PaixeUGi^l7@o6s<L-8Eu%fJJ=gKmN_-=sD6`#&e<bQt-TV7j68h$?ZQZnX)LM
zAvGsR^Id{|<k>1!9+87D$OShmM!ZfbcxbE{M=B9QAODdLULRK-|C7wtcZlh{cqw|G
z0O|bCc?ShHN_rZlHvpxSsfFqChjTnK@zam=!rw9JK}UCFd|$hLkRDyrn7-~aEy*aI
z!A-CX@mrUlgiQ4QxT<I=m<iRlIouNSI`$1<Zp*qfZG*!TUo*Q@xDG1l`>hYl_~;40
z?;dP;>??DoG)?QkTye&-Y=Gzc$w|EkiWA~6zNSQdRE1B8@l;iqfQdv|y-u^0v2{m|
z$ig(k)f+Kuj=l^MrT|`4NZb#ncBDw<1eic3YYI<zx#SO5{O4eLpZ89s;x=wTf{l+9
zv2ax7Xs6}K`|gv=V7l|+rMa_!xUAni00rXEBE#1@H89ArMlt)E(=W_t-a#5q{8UPB
zz3Rg~M}QLQ%FQ992#6T@awdxEMW*8E!)3LkrkBT;hjjd=_)4cxJhI;R8RgPG>Gf&J
zxHDPf%gJ?`PkTI`PLo3O`{5rgx=$_`ptr{}l@iM6X~9V<=q-33B>amg0^Jr189pvR
z;Kh!H<`9eU0K|CT)))3RI)6un52pTZS$*Rtm++24!`~XJHo9~h`W_E?&Zl2GACq~3
zmq(*V?0b}W1yQTVv(jTtC9`?@O9hxJpZ6a&oW#H94_8-k>~_kfwKJj5He*Y1q0&Qo
zKv#a;AxKYDRWr#&%&ZugXl-C2nVI{3n?hV;hX3yYV0BOXw2AYGi;6I2baEXS4H#Kr
zY!c?bH^=OKBDP#%HReOvjRoWE#CD6`@*DP$schz7!vv8(l+;4tio-Fc2g2MP(I$A0
zuA3Wfg57cJGokX6r-_wo_7kEA8?;}I!=reMNWZk6&F68?zT=dP(XkfFF>}K2w1LWC
z^3FK)+6Dmgif3?+(-7g7eaQ|;(WlJwA0ZZ*t)QNIw2!X8lks;LsYN(y*6h9lwY+n0
zNf&@Tg|Z@Fggk}#nnSV2x=$?oUn5Zhm5`V|fnnl7Z!4_4c(p*c(|sMwgPF1yZCn+Z
zl27)+2-n839SR}9*|zG3tI9!v*fJxaMn2pdfPeq;3m;1B(_+YN%%4}ovg|a9ya7<K
z05vC=irHs>D3wqr+u_z3N8Bm@epdQ9j|8mf6RXgN3}K5ikPLxgm?O@wzN>A}lgOW`
z0{o2oK1IXHRbTaEmxrp7h};t2->R&?K)Bi(fJ`HgD?0vX^Uv3I&pQFUx2fMC;AW${
ztIwkn=s9>#Y{C`K&aA_JY*_y#Mz}C>ppCZ%tt+Skt|eF=Ncw>@!Ge@gu9>R5(&B|F
z&Y<c}0-TUD0SF;k?<l`EoF<fn+$`nG8()HYZ|58i%$XTOYSjSD19cBwd5AneDh+go
zD#IH+7^escdLQj50uSqo2aGI!u{2y~$g&mx-atCuf{f{6ch7)Zwm)FP!;h3+701*I
zMW-K81+%feqo~1r$w&)*gO)S>U7_e)F`~guN#gR~?eX$8!sGQ#0_??!%jbV@R19cE
z^bOZ$u6Zc+ZVF)9Z@-67j~69un?g3By>~T@vp<KO*A(Dk1?wMkaE(=dQUT@s5{qn9
ze^KK0Oeu>I7YY;O-UL<#FRXKp-Q@Eq_?&$vh)O@i@KqgF8O0nNLc!ik+&}JUI4@jT
z>QReA=_p-`Hc~(Tx)UPRpcQChcdfriAUQbHbCRZR(83l6<;|q<7Rc1guS|X)qzpbT
z1c6)x0OPm3uIRWApb%{Hz$AhFIi<slr_gJse`J=qH%kZ_J4H$EYKquG02Vg5URb}-
zHi~n=x)v1;kdD;^isIe3;m%G9cQab}p<$YP#jbS_7NvC9OGz?@H*k44?H9UiPeHYq
z1~~sI_}6kyop|T1@x=jUzl9I}1#8Pu<1*;qRst!C%h+|7a|+juBHjxP{*M-bvUp<T
zcfvCRry^s>(oOddjfM|#(&FKy<wZC{b~k!DWO?k|IM66DaqRACC~lF_K~dlQf-Y`k
zEhF%jMZJ***3<e_=SQIwSW(VQ9c)q|Kqo$_$j^(*ScfU)jMC*pqhSve9_g>!TQI*n
zij5CpYv_T8fN@Es`k@7J+cdOhlUZHVZG@EE<N4=Ii=7iLbRr)#7G{zS&t{Qo*88M!
zLPuVqD&`pc(PI+Tc2UfUIytG<(c*XqH>LK7*6_ZJe{<C15aq*_xwgjo-N^^z5?qW{
znRw{|!hvz_E2Q~{^oc*tu$K$yh}-1fY9q0sz%&y~!B;#$TK3e#vD9vBOd?Q}WW4Dl
zq6SLi)Wz9KD4SCV6?xTVf;M*mnAQr_Yz&ipf8k7NPFe{aPR<<Fie(S_vkL9l7^rml
z6*sjAQc(}9P|A;@k*rQTc+2zgQ_~p%r1d&^*@$|f-fOo{F0M&+31UMyZ8lPR$P<J>
zfgttI!3$N7PDDZ7{P=(r_j;?F;<gK<SZ)pODssSH7Hy$nuDz>!Fy!l6WjW}~@H*$<
z1n3kd|KM!AeqGTDX8$m2mke>=V|bmIfb06(zEYoEMTF~KHCWiAOBDDRnPulj=rEgd
z^5ap)kIwkgSHlzwO1(@p<c~?tCWI>1KNvjw@&*4c;M`l7=nol`ZvG*YisTg9Yh#n+
zvnCaq`tmt||HvG99mD1cpouPfycCpXFl$nAMRn8eHz$BK(S{rKxs>olNeA46%@(cO
zp~#`+oU>gC{qaaBht!qT$>TY`i+4{BEG=1Cu9o@4I&hJlqRfupU}#9&{d=CbOiC;T
zl<ksM$u*~Rx{>X!Erm%c@&I%qvVPx9hKEHR<~^Q~YWl+Z02BeBMWB3yHz0)rFziYu
zCS#fXFXaHwJW=2;SzsWfi(z2v#t*$&iZ>z2vzY6o>4mI#Y%IqO{fp^g8yxFoO^N3w
zDTAG;p6iX_{O6V!HbE6sF?j*%V!Pj=2e<e+KXv_gp52;~+*ReD`^L8`!{Xo<5yo+h
znTOS|zb!jxtE2D1)L}z)m1~ui`@S*fD>CE80C3elj?v}EhG1P{L6?{Wsa_@zm#*EF
zF0U$SgSd8AhDLL@{ru5T5+K|yoRxe|t}t?Z;c2Bd|K)$<ui^~HQ7@tnylq$JT>-1M
zcei|1b`QIdBEe2*j;CtJ*<DD_vBoHVgV_I~>8gU_>YDArHMqM?aQEOA+@0X=?m8h5
z5<IxO6WrZ`ySoQ>*T9|cuevq!aH{5M_Sw6;_v*D)I}-Lv<k;l?Q(3m5SqnLJ{Z&sY
zA#R|yC0|ZaD8uZ0F=aQ{a*>meV2E4+3T@O@m#h#9EzMslvIqgomES=zc7cFl_5L*R
z5Km|v3i_Jj>QTdON?_=d*uP*{a7pEmtHYA}9(AFAXJ>kVfPIO757wG>!rOs&XQ$nM
zYntKJcd;9ov%zQw2LP2-H<;|bvSZZ-@&L4}Y~F=c+yPj;9$Xh*CH7Lb-&ToCHYo#F
z2FB}N&;96~r=qU+rQS+PyDkd5#jr_?I2>f|qB!X+{`pycaj<=_E9VA3Q{#!g5yz@|
za`ep6Vbso*CXT$39<Q*+1_K$B4bXG~GD7Ef6oDW}asB)-*b}3{sn}Vm#_~nH!>fli
zZxT~r0@$i~$*4f^`@lJFQ6};_>w4sccM<qIBdS-ijh;opTHM19wee!MOZPhFg#I4(
zi>m!s3nyfm_IiTAV!-%Ctox(uP32(w2^<u0XXE;sNwn&JO+Qk_54(QHUeldJ_4yXX
z>lMmYTFQ6;-u(hDOJ1E;#heTJG_uC7>&O*z*{bC7q9phcw-%}4_Hw|wCm#QA>R97}
z{hql%Dh+st`9R>oW+r52z`U}YeSOQBHjAZ(Y_e5!J9HLQMl&BwA1!24m3cJ3czHP(
z{q*jlOe}>qzuXiJw0d?L<=1-GGAL(qjJB`aJ~JT!cgTP~vxwq7PnB)TYxU+EsT>^<
z58li@qvZhfddte}90o~bILAEe=fEqyfVuH#r@9L-IzYCoYPQ#wVZ8o2XwL23Oa=L2
z&B6b`fYk`F3}j#m5tcmmjKH}rNX5Ib$xJRnJFoA&EZP-#*wtJR`$gr(3WazSKE@Rg
z6e~*?YWjr~Zyw$Tj;o*wLN7)xnsDTGssAp+2u-84F8@JJJKLoX4t%z$st8ldfPots
zwm}6{;|ii2iBg{37E1oJ)nxM!wf-VBGarb5bM*P4A@y5ne?e)^_w<HjgAkd)@RXrX
zUrQ=6Ml6<i-*X9hja+AYvdG@t*a4M-g4p6~4@~4}jM|zD0w4#{nu_Z;$_(;TjY_zV
zPG}t0_-&XvjV5Y{^f?OnOi&-@DThqQw|1rCW}h`u^lo+0(U)H~^LRDsXNd(JTrcX2
zNQv|#!5qMqf=UGNsv~p`=|BmZUii)i1~n1l;@!AXJ+(RuaH`tjOCFktvWLSouyG0u
zlsNRmV?JF$8LRsfuxp!MU0oiO*$0BkmJ=C%=Ph0z58O7<C_d@BM;1wty&W|Si0x($
zK0E^iauY&1Xw!kTwQ_!8@*RLAEcR4BZ;OaiyG2~Qs8+IYUr=#9iQ7kC&P|mr6W5^a
z)y#vJ7Xe{lmxUdHn72UPYEEOeAAgrMMu7aE8z(+bpCl({){8eqIUHE222HH-!13ag
zRwC@f6rb5G(_pKDk?r+zh56)I@zW#)^Y&@+M0;}2)U1_Vvp=i{i<QRKyi+RaC1d)~
zrE+&vN#oc|^-axt1jP{jULmiF33GvD%mmOqwy7}_mrWqLfJhUD4NjP#D;fCA`?=te
z)UZwrT1L5N0Q#7mwlN7_8!hNP`X++>>J5HkeYIdN<w_$$@!|<M9skgIP{#L_)A(Uv
zfNT-Iil@n|&hvD*eIO}7;uEa^TCzM~#BAp}ap~w@0FB`0Z}jhu25hma2i=+6#CwE~
zv%ZeBb#D%MKkn>KUf4PiSKoh)_hLb(9*tpGx!ye@Pz3JnZw)*fqEZ?z9M1$425Dr!
zCwR0y8i`zvkc)S&h6|ie&HTm>Ji`v|^k3&SZ{K}nIV)lL*?J%RfjIZG2c{|x<{s=+
zTa(!>-A%#G0sr+)Lvi^JnR#iHY{cb;h;*qwOFFJF<&19xoxcOp3BoXXJKoGE7zY8t
z*!ev5-;IT2*Und-Ps`=SP-B4{w@E+qc3mDx=v+n{@7jGEH1r8@9hK-n47P;9*C;;I
z?%NJuW7S_@@O52s73r9&VA_q5D5nzq<ZUt+O3UWs(JT2%g0IU&KJ)6y4&zGG>BWEM
zicW|djTQ|_Tdf@NG6SjVgsYa6ycSY-Q(%cQ0+1InAVjc%3&aV46P?fi>%8p&==Q`u
zv6kxN^w>N#_{;tnpxXFnfQZ4rs-&;d^snvx!rQ4&*JIv~g?Mm2{@dLu-?r0wJAxbx
zY8$4VOLT*ny#IZ+ENvbq;=Q`RjR(#REe+?!&w^4RJ#;xTK4vawl;uWQar~2A_b0!T
zgX>`RndMbgBU!bPUmZZsT|ca`_n#wyfgb|JpFU*4T#hfUAeS*dE(n~V!-gaBRwPuk
zLW42#%7Uv7&5UFhD`B_tvZ5x1A{%7`C;zEk|9jviatcxu9CpGmJ63;ZJTRDLdFXQ8
zc$c<LLYx${PYLvXti5;G4KWo1SgkU$vewmv3W%8qaAHJu9&f~rY&kUN()6v_mLt%u
zCvW;KydBX(vwF)W`BcPO{{d~S7~t!CqC&#$ZvX>CDYe7{jM?6OzfuOhG<I{55Yf=W
zimDJwN4XSj+OV15BAlq}Hslkd#8#q&4%j57aS6eR#=Dv{@#Sk#Wo4YfzQX=#Hja+?
zN}h-(3&2$3A#N!V8)bcEf@q_ZzYurXu2^XFj09h5%joqmbp`C-Cf>aEV)@=<wRw#+
z6=#!N3y8cFV%+W;5x<~;F@kl8B1`P3TeK05_*ek{>M_4ncUn%Kb4vO>nEYEOxr6g8
z{0P#`VV0j_G+Ps@b0XWfn@u4^Ld;5XqAm?Q%2F*C8`F}CC7}<eXiwgW^o;Vu-1FXl
zm7^L>9@go!s@^wudo5o#^HUKg760g4B+DEV|LOikX%baicdmRjJk1l<_#F6&5=zqJ
zBOpyP!ti)(A}*(^sR*J4j0X+Z4xzz}zHA6MMufb<S^<{Hh<pi+=Lc^FCUZDkG%ZDC
zA9YV2;K4$Jbd42Hs>_&&RF6wr;(Kv=xyjMtN9JT1Zn4SHq9&P*SV@m%WF2@{n^^@z
zftPdF@IO9y3^8uuCPNt~_MV~YKmHR?%7puO=zLgs``5lWuWu%g;>CtS;EkwLkW;tJ
z`bxe#e=zJLh=-dH(8mfxc*n9mBjlqQT23su8=oz9%Cd1pOB9_nga((_JsEgK&p3*2
zO#1H{C{S3cLD6lV&JEDqFaD^|R(>{4eejwT2;aOCx}k;YCO$2HdsH-f4%jcdJ)niZ
zj8V8Si0@G_Xd}v2zk}*U($I1tR@thudJlYIRaex}9B%W3n-1x?Lz)^3JpiTsyc87w
zhG7y5#OW(}MdNoHl<Rc}Y@1(@m6Yt$F_Smp*`fEuE~$cv4N6M-qYa$1{=}@B*R#Bm
z3g&eD2p84Oq#tr%g#&{)*}VwW+N>#Wd{uG=JgIc(Ixt|XVMC;<%lX1H)N}&m%vPxy
zD}2S|NRfe@Yoa^;(FF}(EL8_gOelbw8iE&qRaB&L?|>;vq#(aE3Pmk#rjp**C^z2z
zP@~t9OfE1QRCS)j;qwex=}Om9wE)TYSl(_&9?q+axIN`B{y=X&y<pmRv}bflF%I>r
zEE>?eS*h2(eA=tFIxL`>_;||fvmW4?Tj7RN>W6PzdVM%?C-hXZIb<kw)E^e0UL3Jw
zN)Bdwhh=TOLnGGqdnt~~3WEa57!gIY$sSkBQ<~U@xIaU*9^_q;2P`ux#QrZ8pFMJE
z3FF8||MD7b{p<RHN84QZw>n1<_4Z6@S6X00XHh@!@2fZ@*QHx$&h1#6#N$zGBa`{{
z(uW+*5yD7YV}=ZNbI&JCjhN101I~LG44;O41nN6Sd?k4@Q9g$*b#eVnvDuel`d6$F
zbwf-6`}Bj9M6e=qr#IspDml~-hp;7{ADurC?VrurMvjNmh6Lys(5U4`PvF4`c#6>5
z-<N0rB<herBT}_qq#4#AMHLqP>Obi#eJ(G~vsSbv;F3eO)45a<TU5Hv`Z!SVmBs2V
zR`;)k9n{mu_YazWuYV{gOSF}lQdjvb%VaIX%NreTJ$~liy}LIz(4xx>S2T#?oXM@X
zc)yu!75wY<yDJD{ioeO?>)UC0r0u-1gtp!^(a>fC4<Fs$k^?!)=>FG9^(!c}6ZZNo
zb8COf&{a~upmihwkz8k?uv2EK!T?eQL4^(?CiYLMn+$Ye2W@T?v5t73SL;Due*L+S
z@;N8u;*N2@#~@&w_sU;V2?{v(siA*|^T1xJ!Jqu6w7L@?Z{7B#2o#q<gujB7MaXKD
zB34Gy4kSflS2_LKyZdosEbCgNU5?(__;3HD*7r~2Y-CW+=Q?(iR5Hb1>fyu&bV8-i
zihTuH731hxp8&}57XGfKwYBJ++v5;^mWF|G_B@lbSZ+-49)c0`YPfp1Zg<Am=~0`u
z97erjf1GzL=s#)Qo9b^d5&Q^y7Wz%~iwwX}-mI;Byb@~i>kW!b@CWdb%IibH-xY>6
z?h)Zt3ErJx^}tP?0?@+d{jU!l@mIHkPlvl{6ny*!#3ai<8SDtUH#hI#o+p6VxOjo<
zAFGqsKa3^S>D)xCq2`(dd}(>pQ75Unu(zLr$v149EkC0G43|$G+@0)Znc&DDbIsMg
z)DB;UjPO$Y%Bw(R&Fby1l>?z-H5~+;(rM}Prc}-(oSOq-b=xqSdd<j6EBj(y)*`to
zpy@3Bkfgw2ev8xayVYWy+Mo^zDT6@AJpRHA4<RUut$9-mzT2B3OmH#UG+vlasF&-n
z4H$+Z71h>zqHe;oP`P&-T#TTo&fBr(<M59@d6qGotGCk|2>AR^sLGV9(mXUDGk*Hv
zO*{x+CwMR#A3hIc^HS%P-+ffKfCAV?kCCB_XBrfWPuJp806>}P^6g0W1r3`}%qVbD
zf(5-Zt4z+3y2Oj)eQ%P(5+mwIVQohdJ8Nyc=Nx3UqB=Gv$IDvb9}4TlT)$t~0UG;W
zx~fr4i@D}qE$yM4{nYXn8noQBWoW7^QuT+FgWp)W%4H`5Agjp#!(?>Dh=7=?kmSu^
z@B=yt5f3{JyW(0ycgy>%Is{|s`xvS)>gdy)Xm&wH4lc2V*mj+6fUx1&M1`C@JvWX7
zNJmWG#0OBi+<@16y+(Q&H<WJCF4))VZ$V2Y^e=!v-zwL=&efQNwK_6D><M(2SiDZd
z0M_r6YfIXxScEyXzEP=ptcW<s|8y|AXVPn`u;@us#Nx4^=1selN72n(^9a8lR!XrN
z=MxLKdE1rh3$D0SfQs1YUl&~|-Jz})Pvke>Bay5b+{RO7N5c{DLxB{}vnrCnkFd_U
zKNILasX#%(A;8uy0%csp?AL6JAIs8O$lcnsTDL9ZY|9~3(=G5mOfmCi*$^qGT*|>v
zb65+r%gJkqL8(=+`9;H=7ArWxNZA9jhYemRK3j`$c>P2VxkC3f3ZjffLE0+QBbp=r
z=DRBL;@Hr<Bm6W`Cypp-^QLt>bCKzmZHLAyI5@2kazMeODB^!2of+fjy(&L=3Gh_d
zlkl*^iWc*^$un%QIHjIPDkA^$8J3me&cDD3h`4%l-5e)G1G>0U??cYpu`&Dp#-Tby
zjCjB>Z}a`kz^c&k2NXK2m5=~)eQ99QKLV-*HE(n<1t+g9##Y}NrG%~=0bEP{!|9?)
zT1hSx76}2_mL5ccnidC}^g7uGyVV*kDlO`>D-$c~%7<*r&V<A?Eu!@LbcbPosW*(?
zrN=UN-dDAdY#1*W`*_8TfV5IO?-WOSf$j_QEuSKW(^1N0Sob>!wu;##&xvCX_qz9K
z;|b-gfcrP=E=?IjLwSlI&ZE>z+WmQ~E+;A9Fp%|}|4<`R&Y&B(ky1K*I|sdKw7=Sb
zxc<sK2+U=s3c?x%p#!+w7{Lp_`!ady4;W6au)uAS5n-xKkKN;ROuv8(VLnmd`|UuP
zrr;6TjkLIAA~)cC@gu0OoG$NY<V_bQ7uRc9i2pbrCnU+QNh&<UH7pMvBXds*_J@l9
zh-QcVv2)h>p(?BMy`_4I2Gb)Tf=sp3lNM?izbI6}7gXSwjNUyM;ZF`zDho^TiG==4
zWv8b{&LQ3J-DSHJuDit%NO`aSvDDY~!pO){KPLhWP!5@uN@w%`L}mnx7uZJD{(M2d
zJPc%j4F)6)0BWyD#prrlY1)Uu0V=v8k_9Q^qe=~*L50{HOvM9g#dC1)CsgIH7`Nle
z8zDB7^=pyL^2pLlf*Vg1g&}rD&41DKb)*$tOx|H@8YFLu#MlB#cX8C*_sHDK3*47k
z)HUAc3RoQFqc>OOzg#P4PnYsoEiX(Ge4L<mOky3!42VbSR*!icP*{*DFGB{V@MFP$
z*W0dkP%-)t@y61W2Ifj-y-!`9ma>C?({QH>`;$AU0XenEz`zGibr_*%*!MkUh`x}e
zoeu^WcoXZq<C1a@X%z{2!AQQ<wqid~*ILL)C!?&hBe#s6S#xJPwk`l&-<!7I<B4!9
zw{_vp1F>D`1W>>)iGV~SSmiadwWe?)N3EzVbnB13ZrEWkWwQ=?%a3{zVJcM*tBXWl
z{uXaegCCJz^ET4b5$iIN&h&-*(ogp1Xs+j|W<<<4c8$u#9HLn_lxcj<kri2(1kix#
z3JQ=DV+bP|@Z3KIxjK|F-zSSAuBG4!I;#Zb;zm!>?=5ASH;*Z_hr2-c#cfv>(2Vw~
z^{P4(TqgfT9P?FDC6?LxhXyN)nLh>h_$*&_c=QMlsA&FN7qEEKci{2Bg9mwtnlKj^
zt5D!?1R!;|hc(u8{=+^<l6jmpk(2J8+AG74i#NUN$KW+tsMR+XT(i*nHJZTj&oP@N
zDWDS<Xbi;jZ+s9Ltd(v+AiWE{S1jTgR58e3&!Cj0V}^&Y=h?kz<RYe-qbmt^UmO)N
z-eeSe&6F?IgSc2J88V<W=AcC_5<R!$zuUsq0W!ljKfP~};H$lna}YFixHs4_oqey?
zZB;d3L~oK?oSJ#IDp&u=a|Vkbn75DVqGN!cl;yvn+&pYQEyId};PoyGGQ6|@IiK-w
zVHDU~_T0dYOL`k_?e{ytkJ~RpZZ_+cuHGEMFZg8RH-<}#J}>hhn%3w;y0It258g2J
z({j{N0j$M`V2q`f&&QN=&F5;~wyK^u7)yqchlW7x!UujS=Y9#fHWSvz*S9vm1&6fY
zgr3l_AIhR79D-koYtaJ?cRb=R4N@y3nPIxiT&tjx^gz8&Tg9-Nnp9L+ag>yBNEWDm
z<>)YUB@3=eM6Q~ye7JL_I#{dCY#qh?LB7gSID>aRt0#X&7Pj}N#c!ctVPwKVKqniY
zQYthRC;N@=5gYwN;6n<iu0nlra3HT4RdIXeO=e1pZcp@YX}>amcPMPX&Zi_LZX@)g
z`M-<FX(3OOGK~1*lk*3Tu;9!#LWzo2Ir!M5A3u*qVoCfhK?ea%UpT3Vm=L#|$cMDT
zj)tXAy%er8#Pz85MVO)fUi85<ZOwPR2=V^bA2;xu@*^e`4g7ll%e1FGVEl-75+9Od
zeZB^b@iz{ww$ygxXBRk7HLdR*E=L58U4NE*PGnqqbKA{V{^WHr$MZmYfC5}}4Q73k
z{9<0!ZhET-3m)<93jAOzE`nC5yXdlCOoXpRl3UW)!#Ghs9u14BqK6Kp&^(t>x2LZ_
zIK*NQ9_|qKuXQF7#EH1&5wD_Eb-=-F2I%qvZ>D*;H$A;SLlX;JDCI@R@I6&U6(RL7
zhy<>|-2n@g#a{nhrbZGGM<ca8Wh0*F9G>AZ3_0T*kzS_}18D94HOckI)-;??ab(Q0
zgHyJ~eV;33&K>XCu|_cf8n}!xS8;FVN#>-rVQ1rUCp!A_DHV??VN&q#!+0r!L6!t$
zSNo9<wN;`NaBZ{@b4ov{;?xz9E6M+%p1fASIhEF&Ggd}33i!EPr870)hJrWpbGM$|
z=+&HzY?(}sc9R!sx2o{-FwDi(hjxUiZ*((Ql#p2CdTy9~<)ot82VCE~xSjra`esQb
zXoZ=*VZL$jCy=s#)ju4?u57%347trqj(%^PrRFYMFZJ=#8{pG{0iIq6MBlUO19%_g
zVZpVZ{=mCZR(HTo!923aONiGGW&F@(EZh-K7s!!|&2)=3VE@q?i`t`VCI*Nu=^Kjt
z1QxJIVs};`8P*Xch&>J!J@ZsGZCbvRH?b%ogdPXlcsPbnwHn{(jsj^->)@MGsvHTI
z@sx=i-<k(o^JUmmVDc;ueOZHp{wUD-V~aAG9bDk8Sgn~Cv$6-e-17pPQ(BK|k!=Vx
z*Vq5$%nGFTh(LSZt`ft5A5Sx8(EdhM!T9zV?7#1|A2&xDZI3SMf^H{^>Q3{?+|<d%
zStQ(cOeyJb88b@)fb8Xm&BUfno9bWur@v_bhFrl?1hE<lO#mdcV|%hcJCSr+!i!@*
z0@NOho6-O!#;PhYHdibT7~?P<On($znOW1NccQ^mQgX$c^|NhRcV8qJvd#}KcYmiU
zZSu@Au)Cv8Wri0O&{{lgmnth@ohJ>8)Qb{o4~<+!y=)n%OL{+)5^($&SOY&zy6DY5
zF&m{R0Jd$pkHGWh1Q5iR?$|DA#xZGfR?iP2n3oqYANI!4+Ib=U(TcH%+MR)$p$bi%
z<NS~2PP|adGQzEN(>9bsf<)i<+jND)xHyJ<36bz=SASs$j2~h50Q5g*3ecK|r>fd`
z_8iptr}3Ej9OTOb5jVYeB@siWf~dBhd>XK$3kCEqHX-3kV{qpqX6{`Efkn2~5iZp6
zv}|vdu-*qgzk9-t$4K%se&YFUtLF~|9{uD-f29ZqzV4$=pB+VzW8hn5#zWaZ>w7Ba
zZNI@$p)I6vXA6a0zO`YA`rrbmbbll54twyuujg-{iT#ho)BGBIT#hFNttV}5e(E$v
z8>Nx?kBeJd4QHLFn3QU8-{2a4N(>Rzqk8^0b#EFN5Mh9q;a=hGaO0GQ5;SVOpO%*9
zdA0(v<lH|v@H$`P=is>3j^>vLGB7Y0j3yl&8G(q`s#=d3%*r5+%T3nPrVt$x3_Pm$
z-(S*zcgF_A1R6jKqvqkk6V=d|OLyw@Ico@1m44rrR2+Z&U^-g<p=zA3@OWNVRrQec
z-gya}%A6pJDyrDPx2{K*T6K+K%pU2(w6leKga%;TzLK=Qz>6wRn^H7kw1j%w!E`lz
z75OqC-PIpfXLF{{N%sYjZOO<h+(nxmk$!q7yfa}c6ky5{pPEkxG@c2P^gZ<%xwct#
zYcb3#ED%L~Qjx!k+R}a%Em8?d&N6)(#E>}#2kUhmcdpR(l1vT)IXNTtij<&Udtk;d
zuY>q(z2u2-UL<$NO82fVL5*YdkB+0k&yzM|9iuzzJRyXV0j8Dp5aD&31vyi^uZnWQ
zc4h-@NvD}vdId(PmTVGomPw899mja`=c{n&mY8*NL!wFWlo-A%r=?}snjRRz_bvSV
z-<cHGo(n?71gKi6S$$=I_IwB`R($RP$#S?h2AG}+@n*($;L=oO`M>koPt2NfegZzo
ztP1Y!Y|~e3-oB24rG5DV6t$!wU`9;9o@jcp$ylzHn!nYj{I#iP3?k-^ii~VODoO`#
z&)5B4AFr%PIbC-CaFTp6G71_b^`ZemH03{ks(!<5H*}JfMFO|Cw?j0;WfK=&?}0<H
zl$U=PMgN}*An_elx5X6%ZrboIhuC?0Ir*X5)Jb|f?raUj^UPbv&{sTE@@)uz29~-E
z90R2|p^&iXwZjW4>mBmZyX*Uzf!`VawaQ+wi6|Etaxdt$l$13&x{QDQg7VbXwUSTZ
zd$;&3zT^5vQ?ynnvP;pVfSg!!RXd!|`Yo$`Ykct4@GqZBxyoWTiAJKkKf)!EepRH?
z`1-wt%p8@{?vK<Gw4w0lha7qf;4`J){ba+3oE*G!J(|$+VM-8EE(BZu#5HikZaMXl
zcT2lhhWwr}q#wQmnR=w&YK}+slQM}_tjdDujJ$dKWwmFUc;GZvX-P8<DJ(^<eC*Bf
zR05P1x$(6dFWM`Vwf+!RmT!SaL)2pIMl#^9Zho)OjO9f3`CRPTAW2{FMWKKSbU`P%
zz}J{4r+5+$VVj}M29xBuQTiMkUlGUgptzgzfu0y!nJHgwvGhLS$`^mK?A)=UJWmI}
zX;OVbC}aPL@Vy|e;Sk+-+gamk%2TpY;Bvi9ysAt~DLcgb+KSI}zDzSy!0YX(I6LKO
zkUVIuE2xV-clPLXqvNFpqADa4w8q%h)HY}c>Pl+7x;>gj7kRxDdRW88G<kQj|F16I
z6x0t3+a5l@ed3y3nz<Um8>YXlT2vxrLImr|i2=`r0%&+HHoqcIK02lmx84`R1Jk~1
ztLOgb@rc@}`2VokNtYQe{V%QJ)K)b#b+#iO;`1Q_@TLqH@zbc89ov)rQE8PPtpdr*
zQ%#^CyvhmbceXG5d<LeqHKHsN?0R!>a!hW?J>YC6&A=ZS*SAl@gQs8i@(WMH?IO9_
zok2{QsPmPG*`Evx1GZ<qPgP|!eJvr&75-B}upX-NG*|hq;cgp(ZLy5<eLUv3I4bZ|
z{=Qv24iqA;V-L`6%qGt>#~;ude?=2Zk|QQ1A&L%wbteJ{BZ^a*QnZJb&4vjsP(tm}
z#&kDmZ0M&iD?S9e@9~F_KK=fI0Z_Q1)R<ENh)~+lu5v?a&1{ICI8-;nwb!}|e&Zn-
z3%KaagIq!_X@I@l`XSm<ZQ`uKf)N@_!B}h`%*Z{wxXW=Z0?DiqPm9VjW>C7m_p?Uz
zVC5$Kf0}nF82B~MRfl7Tz`!>+e0_>na%Jd2{lKR^$Sb`+T?SH?4{j7wIre7cSsRpw
z#(aEyAWqLwF-=y#jQ4$R_A@_u979~s(e-Wr13#PJ`kX2METS)n1qD~qUwSCG036$L
zv#l&3PX6f7p8cICd4h36tT^sPM%X+7DA7sbg!IYMpEO^uC4L|&H08b%;g4hSjSJJR
zY%++v=I^s_mo5rNIm!YIF>K%rECoV45@q@G{!?E5;sgUrEWA~ecWk}4T;UBAQS3*C
zXrd?iaYCJ5FG|_r8d7U>L9s3D#1{={$^?GG>gt@}o!$a86-oKv8IL#t7}DcqD*!{u
zj{BV02n&^ADu5kXLq-De@<awxR16m@Zr(z|2dRSj;74>x*;o6Ww^yREk)#e5Og5b<
zXla=5Mcvb|F+^;(9DZo2ndmG@5k)XLYvLpA>CQw0=wpds-bJ%D=X|BwR3#b2Ym(j>
z_DFcY(DjsiKqZjC#$bAVhtU1i$<*vzH<)C^RtGVS?e?@u=A~kx=Od>0drcwe4X@>r
zHv$s-Mp@d%ywlUuSBqo*nb0_oP31~V`kwy8re$f~3bx7)Xq3lq8=z)oWxZqqAc}7e
zPR_d8TIhZ;NcG(ke#fi%kh*g3ysg_<v&PK91M+r_Dke|7F?4Nwl4|7pAX6FXj7rrm
z*uu^YVgpinUqu73DZznPkJok%>5rE&X#thLwN|AY@u{CpHF1Lf16*hc0n-<lJ+S0H
z4!d2bhQ5xcWVrxA^Qd$a$2Uw`edO(aSXsjCG@7!5>&6unZe>DdlIaw6Yj`CK$1$>F
zFRE`Snsgnm*r4i!`sIpg6Ey@8IUcS;cv2R!vlMn%@tm-8P>!@O0A!2j=BA?B#Nn$`
z0hvUJ&h&avq8hZ7d?9-+{)(^&E$WKYXAeVU-!i@pF(v>>8*peJi^qo{*Z<3t>4?4O
zetT~;n<^^{v#0eTe#E#T=D)xFOjHc&$;K#PH`YS@!Z?pk?nuNp9D#Okz3SkPpKwSW
zHwG5b*mhVa-J@(Z1@3<(2$sC0o=4?%kNDcV-AG;C_DUiE7Lu?3h=2c))buJe!cvs=
z`n|M7VjYBsp$c&sskbR&5#Z(J<>tQoZT2~u#An}3IfJjpxF;AQ^^PIozur%GGK7o=
z@R-Pv92)al_edVyYkhy);zv#Yd6^;ga!&bh{==`%%VtX1sdI2Tzv(b%@%hQ5sZmiw
zdnjP@@&0`4Ng2@+@trGXaT5LC0cTXHY@m29#vEg4(?wyRY>)QNyZa;%)%6`X<qxh3
z3?Y#D`5pB8D`znxP^UFC$HyQv#;@7T4p-3DL09mQJ1ziqIVBeIsT;}G*y3{ZaSns7
z0)>Kp*(Kvq-1`_~wI{1f1JRy!pf=ZdeSQP{%jkpe9IWVwuEt&4Nqu)D=M?2PowP<F
zTu|vc+VJr9e(*9@$3dl(Yc*YW0%CnikCRAoX=wf@Xs|@_uwuU$8j|F_PJ`vWEEA~&
zVq;C)POSQfTb;@9M(<k;K3x?|_lTFxh($``cpN=9T9;pHvJ%LflG!g(uALUd5VJM@
zq4|Pn!dG<mOKYpj1XNa?K1-IXXH$ZB%;uL9?fufapyy+4K_51Ys=b6tz**7hr3PR)
zfha=pZ+;WQOgh$4LqoOBTC%yBm{4+(3;EtcBHEpAhxiYO?Mk1Pv?M=2|9@sHXWiZG
zBTcgl7dKA>QN+a?jkfc)S3CV<{ty$8yOYH)QPGkK+1VmK*XFA$S`~VU@$okh2byJ^
zI(P{5meH?`zOd0IG3wyIS(^kX;UULh00TjOVgco`9Rlq_zUm%uUeO%8_XUzYEbuC7
zAuM{<upq;oFD)r$wgjSbBF`?Y@RH6?lw*b?c6f0I7#QOC5Bu3DHlj@SxexG-_+~42
zGSMGJIVC{@TeclZcI7WV2H#5=<xf7V1$*?RB*M|^!^7`TQ?jxN$i{LAS#FAQ3R`NE
zBrck*5M{a2S6-k1xYDv<Vi1xEwb+MciJx}{h7QpKU6Gi<mUQCr0@ewQO+;$8xzCOH
z#&>O3fRYRb_&gKhWT7jI`POTy)=bW78!ed&<kaQpkvrNT=>tG0w~R8hUX}sJt0Mx8
zbHDmT52v-(GOjd#p@O01Syqk9*TM!SSVa<rIxW{gcHq(i_O1}B(mU-1xr<Bl2mF`;
zrBNEyD}fXUe3yK{#iCD%uUs1-;(4D4WfCo?55ra+hG$ilGq+v|EAw;hUy4h7pi_Q5
z`!QXAu<pY<!=lRFjiJD%%dGl)0E@jn;y))=C}3oC6k?rIVTew^CVHiqEgYbx#?>za
z8BgHoSUI{^OG>~uu<Z<c54ldXK!ybr78Zg)AZ<gR!sDQabuR(WQ|mfR$WOB$G08*%
z{r`I^R=!xQGEzTrg48L5XYmaeUU#?g;V2(YpL)OO9>TF*EXS@egq#qy%v96{A%}Fc
zw(U)1t~9=VE|QQ7$pFBI(T8zGKBd2Ptux~^lp5+K1@P1UP$O<NdW~2-*uJPL2*@~V
z3cKUM-u8w7uIM^KrYfGW*a`EZK=*z{&f8i(T&VCEun;wiDqo2hWu3e!&cC;hitQU8
zUKC^@Vk(d_nl^*``&TMCxen*_Qg2OEREx9~^VAf9Kl~>RNb!usRw&`7V?`mVV~!$a
zqx89012$L0<EU6ZdJ2E(m`Ptpt!&*&TX5WflJjiMtQS|>?QJAgy}oJBw`43@2w2M1
zRvsgh@HCAm<`vn!TEqgkF#f%RIh9|@KsnT(hrq%528i7mi+>}D$BL=w6+K!p=tLqb
zU0^Bri2yVWH;YWq{hvqQZ*YK?4g&d)rhA`DVAOYibtD<34M_H?z?5GwE{^NY2I8WK
z)2>_ooC;rBS`zX*1+jNM?x0jHqJUFrm9t2QiPMvkJQvs*!1D`1JAaTYqaz~hW{aX`
zw*3UNME)HqLkiR;k4DIdjCfk*`{Vi1LzDfZ+2XL!P-gwZrZ3A=BqVN~TRPuvoLdsq
z$XJpQT>TS$wa!N`(CdVavh8KtAl>S`@NY$=Up<oXVZ{Kksc0&|`_0SrRB=D%ILS%}
zM4G5n4KpfiL6zl?>xyR0nY{QdP05rB#PNOiSpMkv>s%pYQO78u-D5+Q_a6T1KeB@Q
zp05G*Hna=MId|B>r!Vj*(TBlE9Z>6MuD06xi+Dh#Q^d(?+AfN1E)AK*Ke^*A=|BcS
zG;kXlK-i)kBC3Yawit<pT_J<CIDp6+f}id=JFxy}&+D`n5#>h#y4SLGFanipsYLbK
zem7?Rt7@&LtHrN5C+g&Ghgi~61=Wqz$cv(<6bshHTE->+dtS=E0_IC=*iqPTK4srW
zWj|}MBqOsAgzFDZjkkVI-$ynupwqR}gDn{WX#^7Ng|V|_#^rP4!ETj)vks}ld~$Tt
z+e>SgjA4(kM>%vXFBhh~pDd{ENP)A~YFyAgyt0FjG?r90;6%wH{m&-^GT;b!eZ85K
z2t!-1HtB=7hu{uFPMgC<`xB}e^b2|5<2IyZflTPAcU*7H%QIcBwZJ#>cY&BlVJi!o
zWc*5Pa@x#FNSG_rWX!i(ZFGPb1l{LJMXWSB5I4)fKoDHATnKiE@Bq_|pLF@N*3{>z
zo^6rsm+uEn?aRr{ky``_&r>)sa>QU41|R7_tX@t4#dH7e0GIufnB$Y!=g-|IVE3(W
zaQCFKvP@}|Ks?H5bS$h+ZOt^@-=ta$Jv>4g_lN>@)?W!j^AdZ4gMj={kjh@rf+AO5
zdV|F97u2oRMm$zr3J{5SPEHcCZK95)H|MjWwexnTo(N0*2k=C`;<Sk`@=QDhO;5xv
z*$Q^3ZGqXWuqj4Z9BL>kTo_hZu%@rtaO}`#7$K4v8MS?TNrNv>8aqc(=I1acdt~v9
z8ix--pyr(+<Jq$p7fmMpn!n+Nx>ZB3gC&>1q#h*-`Xlq_>22b4Zqna()KRKvFk2vO
zU6gsJLH0A93ah(8y`e55qd<bfFyOLdu{Q}D=)Rpt?Vg7#7n%NqGGenz<(iD*)e`<7
z?e3>Y&Ir5lN{gFdM^juoTrePkn3l+lBD9n+xM2AkPt+p7IeW$ub|)`_C5^*E4&wa+
zF#;PK`_El!=odAV`^AP3E30y;P&yHIy~xLp``uq*{ypEx%gA`&FIyEWq(WFzn@x6B
z3kdI!F)-)NyJ&s2h!mWhH*xYTgrD3Gmuk#l@D34>j~Nys-C*jJJjPL1o!Sllp6RP^
z`4vHGR_4tW2A+Nw^J3mg#$>#!-qg+~*04Vw*o9KHukiyZh!F#|;&`WE27UbX;S7^q
z?ToT`MR!r1&~44^FCo%d?sGx3ZBlt>nXYFND`R`UG=c5}IqpVxK&%_s?~j_VlU(#%
zW9~mkrQ=A#i)sv+s2PYGw1dLAsuDH>l%f*9)p`LVC3BJpX<C^g;f6cXR}@=WdgcmW
zCD`iUdAy}BU9hC~LI%chJZ5nTV6I#^?m#C8Zu^VPoQ}s6=a;Wvb3V3z7g@Espce`M
zsr`6YpV70RqU51X%qqG8WxffG(RCksZ{tX4wINZrVF@sH4z7R&tsop33|y0q_z~(@
ztZ#9A?79FQ{a@jjT1_FeoOUu8b^0^07I$cp53m#m6jqRFR2TjRy`0*Y9P-?t^l#SL
zaIR-0FL8olH9N!`hLN2}LySGOS1YVE4-|&Wc~==G{?9KLs;X6R(0hqnyn7s<*xsMt
zM|^?~Z-#^R+TUZQ?5PDWE(h011q%5(4ScW3-J*L;zY-J8Uaqa?=3ls-J{tx;*5Y?l
z$M6dWjpO5r0Ssk)KHfu92qpF+$rU%gwp=W?b2-||BkSXUT3e6X&_pQH^0Ew;OoY@M
z5jpr<;o~Lc%YgZ8+aAf5E_MF^X}b#o3=w`A`?A^3Zq7vt?h*G(Bpie~C#s5!a=FU0
zkV{+Qnt2i(od`%4E3L&UsM2TrLHDgW4sT8z(Vi*CL{?v=yv_J9@cuj5{Llkw^H5G9
z8&KeW9Yn4Iw=>_P*A>N~>y|#n6d|j+#m1>q^+*wS*Us>@iLo*>ksF5dhnoEtpuO=&
zt&<5xZ;{#4*@{)APTCz_+m5US17e0?5$VW@u3VX5-km+GIe?9TbxbI#M*Bi}TtasC
z>Z^a1aF;qpa^V#W`U0e+EnW9LdXg&>_~T*Qxcj~O;8bk>T;$;dA30stUKO1FP_ObN
z&@X`mR@Z_R!?CUgir#_QE+nhecMq=e&yy~aw<vXYr>i9n-udTlg0JE-SIHXz*<4y=
zTUHylFEMHV{OQ1UANk=8nIYe2G@ObTKBzw+SDP<4R&FN*Yp%u3UbR5%7uZJxEf@;1
z)dvU~PB))F{+pdp?c!@^m{N0E?MLh4L*A9&AybM~l>IqlHA5BP1VLY1Kc#Kz3U?C5
z9*Y@ZbS@mFegAcZ1jwn$$yy$FR{R^RC;!I_9D*RPHKXXbq63bCOQV{@z{@rIr8!De
z5GMvR1rYw;S5>iQDp{BsuJUjyC%UtaAamFjgc@}D2nL{N2Kw-e8n$9TQ_JXyBu2Iu
zJtK~^Mio+MQt&VIsxh#)ay$3$FA>h7g~QD&s%WMqo^e{wXfwJh6vFFY-45V&r6xZg
zKvk#GelscwN$~b(Hku=3Jq-JD_G5HFV9UrW7`zs|NrJ+&D-sF;>w~VQZ8tmpk#dT9
zovfCVS#eR||M{@ZT6~+X5<w?Y_y(^o%MNw863USjsu0+pT3(!NK5U4PNJ@EBVAyeZ
zfDB*+qe_)PNrkUIeCyUmm0q-VGinR?D2CEI+kW4-e_bTBRF9DEHC@sff?>Yt7*~ct
z1NwN&xnWC-__sP(kC`pMUofjB$sxO}VzXk68bs*T`$_pwFffoDpmrupUtc=a`u=%5
zM&oO}EkV!GlsBVtYDKqM@;$0^3FT8JDUD19*ft!$-=#in->btG>c{{Wt`;acQjbj@
zvfIaxawz5&eZfoGl!b?r8;0a-+tSU@!A5a^JNO}7<vK0S4A^4V7U(VQH~Nm4{qL>U
zqW}U)X5BIhTGFYznJ~VVIQMEI!>YL{Y*njK!9&sQM#6i2HYs~8b4d3n_CG8|^LAuy
zXvL0C-uFK(U#s$UxqYMa2bUHa$utX^{Cw%aF<LL@K`g&B)n~0sNqwd=@N5@_ReF&O
zraQEE!}pZvRXa3C6B?{|-!EDHA9%zrx7z%jIz=CZ|JadX12YJ=Uwx|u_YPVKAyM%5
z%vP;D(F|^?jaZnWTN=*Wkw*mv82(iP|9xY4^g{9ossyx*6^kt9EA$Z{SirWv%+`ze
zWlT?R4+Wzm@-<=ZaXfIOVv9a`2c^kFT*hXBVovQhgwN2sf8-M1-AruVkGn!ZeYcX~
z(fJ0^vEhp;_gNx!Q`AM8R@0#{#wASGKmlvvDtGPP>!yJ9bVy(m)si3&F(ndooy$G4
z5PXn0kw)zT;RWRjnhH$t`GbXYn!j_jLl_4qEs5+fFLPhQ=&zN2nns=V#7PWxgDWn(
zLVeflO|OwSA!#H;Lu^%-?IOX>M&5}G8EHNLtcu3rjDH#YX!j(JcmyWVtjg~05u&QN
zuHg-Vg?#@^(ebsoBEBEs{ExJ$DCSK4p7S$zv(o+$M@pQ+LvPe$H#+ki1W0~XnILO1
zZNUa(AZk8M(Nq$HPvEDLMcBdflh~Yw8M28UKTz?ctJsbVT~>zIu`d6T6Ld!|>VS-4
zDBx&fwV}aT=@n7h6VH`=dV#c1)dgS7G!c8DN0_aEKHn!@B8dZ=dV~&7$teuTKq|64
zapvL@NBp^8SkY5H?fdl1S0ibme@mxRJVMDtthn!($<82y5;K)M(6+=YeCMiiB}zZ2
z7nEd<8mtz)%Tw4id!)uyyzhO`5l%uyPKa|GWn&*#&}G{dn&|Ai_?$>8ri9dnWjzB@
zEV_ip@S_A0NTvEs8jL;rRVScUTgTSCkt@CR?mz?RGaE^Z-=HYjwmB5j131$4Cbqf}
zeLdrXc06vvLvn64f<avZ?hhoPy5+Ilxx*;z80%z{F}YuoE>FJHll6xJAnBi*i1@xi
zeX>pOVN<_}gpysFrz&}l6Lx-FkV~F%Tf3Gt^VOHFX{*vnSJ~Ft@xqk+HWelCQ~8!v
zRnUutl_PjU^hI2*axTs@ExRmPnc4YoAbpJE!P)!P35$dzt$$9P@so*Yih}Xuk%baw
zs(OfPr}6OG%#__PjL&PKK6#PlbdZ1j2<8;tSqvJm6ES;Ywsg+rCfR7tSVM-7<wl;$
z)W=!#K+GJJFR!U5BIj5TEG+-*A;k!87mu4!HfLA({?J?!l<~ji{`nIwuu1+OcYgnL
z$e9YzyD2HXRp6`wWA{NU&EtE4lAgSylMUvIVr-ln+I0crFCYA2E%OG_=U$9wie%ES
zw#fXTF%vc-rnJu$&=j0M%vL!<T2Qq~6kFE3t!i_SSJ|KmHy`mv&p~_4r?K@NDTz(L
zw%z_3T}=J{WCQ66^IC21k_Zu(RVK3OIPa(bHofOGL>D(}?2fFJc>VK9NnTVBddo>N
zLm=ZLy3K~*Bq>)=@&TOVmkr;UXB4||q6bIoW_!7%O)C;!f~%@75epeL@;60d5mTk1
zy;*T6jRl=sdC|8{ik%1yal{c;w75rP(KoWU7h7`hwZwooqDd|uY14!UPLdqJOgr@9
zshu*rsw*Kc?<>T5x8>+eTx$iQ7s0oT_>O3fDz!igD-=z(Al@mR!&UP6BY)@^yZMJa
z6-eLBg;&LpQpZ&{v5P4W{pCayFn*lg?ivmShDHn(r*m!4<6HYR8sNLM4k?B6%cl4W
z<DlI}V?7wBL_g=4j1r!PQ$j$tmw*`lLcRB~`LPcwAJ~3|hcwc7aGJ5^Eb;7bSMt?v
z^j-T#>fzDEP9sBZ+x`(9xhfx^a6lj!1>?KV=}*;o;rU#ZFM{opeQ>x%e>445vb#`P
zT2%&4R#F1UBn*C&d>?j83AZ~ei}+La((oOiHhuqN$s*`A^(vKBN07E&(|PFLW^R>T
z>L8Nh`6`pzGHS@(w%3>2kbhp7DzEqY^eu`13!hcpMartcweZ0{sOUX!M;r#a+0SAL
zms0{(Mb+Va1$Q2Gt7ed-#qoYF%`c-E&&w#Lm>g?0q5+m_PZ4(4$<6JZAY)^TaWkrl
zx27<u147Bmhp!?hWNk4@>5Z4Xcc|ZyX2ue1WFCpmc}+2xE@tz?z}3vDp1{fP#dD5;
z^A12@v5S(|Gr7<LN(BFUJ>EKxot`!UjHG%km;J<{GYNr>$-1>sDC-{1i(kcjgW}z-
zaU+?cGw+k;p!f>8J)gPx2$f2BZY2IDQJ#33uUA4pLcND!_4}*{vF>H4O|;I>IAu&z
zVag#*s(K(P7BYkARSjciKD8BT{8QCWaRXbmSFloN?f*9S0<EPrMI7}$%L)q*ORF|G
zpL|HN*4Vu~om`3~4HZ2X8zb7TN<0&n=Y5RAgvON~aw8C@=<teH#)YT8SEkuBT8V_z
zYY;AJ1gj;<C&P0A!}HOgJw)IeN|(MnR`<<^?f$1CFLJQN-u_2T(xQKUG409)QFHbA
z(?@x0%uxF5LgrSK3``kbgUsMRYo}8^ZX{WHoJTcSUU<U$I*%!4e(dG|zTB|S%aq7>
z4XI#G3B&|ab}ACU_;t^kTdA={J?Y@)4cUHenAp>7y_wVAWJNk2K4+2Y{Ep<}9WMK9
zP~_oeK+XRa2)G58D#FE16VCQ+mrggnrQZhPN)jZXjsIb%hp=E~)G1&cT;mg#zEs#?
z=BgL%^!E0hR#JPBPUJDoCxmE)nq2PlnKUNV@$Ztxe=hhlvkHZA^2efnujx>ji9I2p
zO{<gdL@9XobkbYdg`p~45)hPb_*nQWa#i6GYyErvYITCX;pE;OSkjUHqkh>R)^a8U
z9gYu#&i%6w0^GZW6KW-Vd7#qaXGv(8Xi3)s53H`fI^o3Q*$gc6DB3&U=X86>WGV3h
z)T}<e#F90bq2;P^doF;t!`#Tk-R}=P-u~-5epIo<JL6fG|MI)df8CGBgsZa(++)Z|
zAQANt%SQ&;Pq#_A2$M7Ldgbr<Zx&Z^13%<=Is`&7NL$rknbD{eTK>-EiFi{w|6{Ux
zBZJ>+Rf=qnK{bn{nD(gW3=F3BsNZcxk`xE@)hM8t{Ksn6$BX-_SvH9*r6(r~Gq4nS
zEke?I#_mmbIx*d|-&EeO&?e}&c{_WrzgRypYk0znTZf{jT_e1f0OYvU?$Ej3%##H|
z2J5zq2rL~+p;*_q&bNXgSz$n9axS7=*f6P%1-T}OenuUKR2&g!;TI7#DDD#&gw5B2
z4f5JgkolqFx|m9pW>3|VjzyL3>37?gAP)srf_!L_HkFtyC1m)Z^?rl!%^djw^Gzjj
zD*ML%eS8VR3$`b&Hy8=I3Hm+8cw-rRJi>^OoX7iClNdVg?;IPPAL~S_O14zfpDx?{
zze}B!GWYd{!n>kT*tM@?OM@T?hjM4-I`=LPM6M0mPv}kr079n>&|cCrmdMINM(T;a
zD5Mo=q~ija!tLOc2|pzybUV99lr-+3q0i^+8ewM@26c(!{nJ_T&#=M!?c0gn(;1$V
z6k)(WTeIn8{}UZWwaAOlnFi7K__`0Im6Ox$YOEJCkB_^ZgXGC$9Hz~JI$x{0;_QTD
z1B^Y^^ZuU;@Qi2?%Fc5&`ho?Pa+6X*Iv@+tWHE<Ym{FxFh84<F)j$HY(F>X@xo&Jl
z+$h`+0v8%QwMtBQ@4yLZIWY23C;>v|XZpUGYQ47qKEok#Rdl$YSP=ehSXA#diOr*g
zBa%T|MD;5YB}Cc|aZc;xpD{uzC746pK*u3*=!w?SELO`<YQf=LsAe`%Jk*D0N|mA>
z#<d}{-jgvCr`P59wjD0DpdDD32#5H<k3a}ZxfPyIuU$gysO8R374}QK2ONbtPg9lz
z2WSftKFQOfe`G{i2}VoaR17VQgztdMFwH;Lk5>=Y?X!7i@C0=yf+Kk+up%F?JOl4W
zH$yJ0Ip0|SBU@9WInK9lW#4_?cr-mJtW$21<uEwy3cCMW38KXpJR{f3chaNYx5jix
z{s0eH%7#43w;TD#eA`=kOlvw+-$ZfizhhaOBLC7jlUDp1XeO|R+U*fRefM$t*mb>=
zitP+dPN{cn{?y@TExdm{F|_ge>di2m`x6^SW5!<@Q3^Lyi|AY%a#syL=};J@giKfz
zG#n5Vz{P~LoKN@i{bS2iPVCPPLU3C&AL^8Pc7Zzpi|kH>lBTjM=c=`+QjV!=@xa3e
zLDbG|&l)J1Y%#-vDYq&c(ywshK2emyta-%tR`u8rU86c2L^jyhoI@QqfI>FG+|xWL
z)rd1)*I#6YTgbqPjj1!Yk)>MF>TVMY1oN{6n%Wur=LM)?dv^pu{LUFJuL?7o6Jir2
zD8hTZ`%#L&eK`if$~9-|-!S7peJxx-)yZbg5wX8ZrHzVF+x_)Kc;fR`F9B$feLY}v
zl}ppTToZF6*?x*nxK#ms(%V&sbAi@76hf}X{tbs>zk3f2O=n3QLgLE}QvZPOmr%=f
z#4oo~d1K`d(A{PIZ!9oa47(tNQE1;yZ^-pBqqyZxGy1-RNW?p#Kyp#Wd}2z711P~p
zS@Y$EnqwxyB^xK*4Mw`oM}Q~?M8!*a3&Y>zFEa`blfXfI#`{9BP$Zf{2_7(3{v-vl
zLbr5W07GJ9oHL;U1=b<ixpbf`Y5fmB#&X?=+p^hGegfDd?Qc`QIKS)5*5xxFNx|T@
zwD{hJKgEr|i%%`OWW*B5aS>l&tTq(@wS4-;zR$&~MeM-7qI%$G|6XBn7n5bozrNKw
z2*0xnq<ngfkTab5mHie2?QcUz1d>NjN_P<5HMx{Y+&!(dqu|7VqK-atMc)1g%}okB
zg{{!X9#3d`{>y~b`x_pi<S!7=k#k$Fd%@K3DQdwf#N^der<y<d@_#J5WS4^KnwvjK
z^Zc~$75Q31-aAgTtFrVDEO+YJiUy~*IA$jYuD47FtqM-rWU*ND4TmIXb~?dTAd;@`
zp^*>rYNzeuS^iDU*E~l1s7B_}qItr~ftMvkOx#1%O#}eE0Ss`C%)lU_7Ww*e0$lc?
z{i!z_Z$yyc1b)%zfL-PIdEnGyKb0oA-}3q6_ZpO2*hA5szyq(oWQmLEBfOMsrK~+_
z98D#t>!xB962DTgD)){)it5$cOVILE9Oejt(r1Et2ST-UU~VkB-!0T=pb-61ZpaG~
z&;q~yrIB&56l0Dv9hZnCftVcrA5B*o6j#?YFBaV0-QC^YEjYmm4#6EZ1PKIpcXxM!
zLy#cB-QC^c+vlzNs_xIN+FSRWIj5(mrzcfhLB?%RZAgEjebDbzSG4yroeL-20Z~q(
zRtmb#p{{AQv*(b9Ecdpx&SyfmU=QFp2OZ#<Efb358wN=6KU0(>%Cqr0s{(iwO*kti
zrlgv7wk1?A_8A`J>z!T4E#<9hh(?)0&<&wBvUhr9QM(-3{f8-l4&>M0HbxgtVK5n2
zIT8)Fw?wioViDXS>5#@HSh9D&Loczc3_qr{P_qHFB&JVM$m~Og!tA@-am&e>e5ugz
z0LlnPY8}<?=!@j_!}82mhEqB-xa-+P((#<^1FtvavVq^DlHvjWLl%>N=Y`1TVqs!j
zzxfyM6-uB%^93VK{xcPRqq#_i%cx|_<E6RXcj*$@C{1~~bNKTJ$9a2NK))qMhZk$Q
z|9xajpIj0GTYC6dIk$e6^;#SVsvMmZyUF&><z=geFh#vdRE)!b55|xfsU^0(It8~+
z)$+k)f;x~)c`}TVMy5am_T{ulrZ<rl=61P|naAxxKVy8TjhM4hdm<n3<H_~l6n^or
zPPrmwo2TAarw7|J?L`zU{DzdjpIJH9%>e@!t|J5{VnuOSI{W32K7uM3X$h=ww5p>q
z?FhY3Y^AV&31qZk)uE=(&}ZTj+nkU5gTLYk$$}5$zn~KmU*Vt#i5ugtFR0kcOsSSi
z`5U#<4Vh2AZ5q7JWyGTX@val`vE}oP1#sB}JOjP#E${&5&@V$?mo-4m`%er~FhE6h
zIb~*5C++FEwKowGBLJdt@MUT{#cI|vGoZ%#n_K5;>ZMAuKK2n$1+?117h;tV@u1?9
zIxj*FG)sANk5-r-A~ndQWw@)?Q6Mptaz`o2Z_$;8{BBC<K(W9og9|}Yf@Zj#@*1@F
z`Mi-PH*LqWHK#j;suDFaj^-;o2d+a^5|*$#x)DZ+f32EcRPV)>#J9VBlyE18P?51N
z+7OCDj8a3StHBh`H6kp=_(u2x8%F>5M4ti+)ohty-U+4a9eF8Ree{IgmcL`0{(x-d
zSn<%r?rY92pT=JS3ClN<WSM3$IPQ<XOMm!5S3me;KZ4BmZ9g@TDMZ_^^GtGc1r{7|
zDDdV0WWlM<`36%EgBb)-3)<J3tu))a;GR%y*vB67(^r+R!n;sxn*>)sd?;{$Z<C*g
zqaM^Pn{rmks96Z9s(q)}ZSxyG?(V<X_j$4Jq90V+i>##!g}wGuL0_*ec5h@du!FS|
z548v~pUKzN<msu$lIa9P{%Iy_$^oCh{rsHIDk;Ut00A=k#b+-P#@rLy)#ym%c=-Je
z6OHTBYC3CiDIO4y(UzN>N2IBB2}K6+DZalq9y*q&+E<H9JS<(w9FAAz5ZXjOgF^Qi
z@kidx;x}J(qwf9cSr|dYKAguQx?fI+5Upm`Z_w9_0;H1qNWYEawL-UUTo6nHYxNDd
z<?Bx2^gK{B)We5P7Co?LqDP~xl`;*Y;g6aH#d+^(9!rwEcL=xD&N7-r4qLZv<^?0!
zI5J?4b$Ba{W1VVW*+iDUXZ{c$&@+FZ<r~*W7WrXcO_X)JAfaX}6lx@u0Ly!k2_~H!
zf)6;BsRUHD<>)QR(9c&Er|64{e5zh8v5v0^NDQ$MHg8#ct{pU$^<#(eS^0jt^=GoI
z`n@#~EzGg|5Jg1z@vd*a+?Yqltlyt44}Lu3ZU{s#KVZVc_i@MnQnZ*B|9#D}VepFx
zD0lIn{168gwZ+lwrKlOT4q7&@L&9S53f!|Fmsg${Xi=U4Fw{n8AAi^)0`-3FlXtM#
zhwh{2YS!rBf{=@V?gUdLC$v-V0+l&p5E({dTq|_U*}c!=>g?^*8ZH<JtD~tUPy0Z-
zaS<qyOxzJQzM$z}YXssNiNU(V8X3b@^$%!x2@T(|rA|;DjGOH_^H5ks9<rpl0^cS#
zg)kR%)A8D)KuwO=XnKX8Y3@O?f#`PyRL-NT#N&Wx+{%(4ValAB!QX+}2`)xk-s$7P
z0t0!l_Mw7@Qdj#Mas=YoN!_t)hhb^1MzN&|QlD_nsgx}fuJ-en8g%E@Z9=6sjE42t
z@9t+>hh1oi1j7yM1LLL|aNX=f7X#^4gg({k^fuQfSI0UZ{={V$pEdWWGp?L+pW5~f
zhpbvY`*9aA9Lkmp`9HXIEOOlDX~TG9h<zz~i@i1jVlhZRBuQ2$fgvOtxkHNIPwCxH
z>B4(vPcAnHjk{VUCh=kl8$*E($#afGmtu9f-(UT`UeTxRerk`kJP=PL#zm(FY>$LQ
z$qL5j5hsb&oFfMY8oXbYy>4l?d9c9O3l{7rlJ(2wQd=5|1`Gco^e~%ow5PMKKM(eg
zcbWLDjB3+j9}+QSL5Fb6$1i_pgNZXs-=CU}f<zS}i9n$UlG11tUMQVaT%>guQ-B3+
zi8vy5O`+Yx^5E1!KJq0l%75()o|VG+gg3s4bJI#cUw4d=WY~Hw*b`n)Nz;HJjtOhN
zZGxw-S+s>EF~-m4%qEwLo_uWBEaZVO?Qq&elZ)u5ou=B$K)g?6kwH}=vExAQzjr4W
zCGCixd>D5}=xIA7O3$sw#+|HTPJhDL=1g1BeCs&M4?0(8t6rE3`MvgQ@FS7%dN0(E
z*-xU^6;ES3QKthTNe_9-HHv2}<NzVP`_Byw`kVfzvl`}0g=C4JqZCf-GER2^`0jev
z??$Ft?l`+w?YsnB{@G$1SnuE3JZDbUhd=TWyzM9}?Bw81mj?rN4`0c~4AN+CekV<e
zFqJp*-EMZcn(4?+R!Cn6W&-UrXrT2jB2|`G(NlkKFD$M5dtXOS?PLIc3I011nIMFY
zn3x_G`jq-`5-~m;SwwU{ALqnAU%?MCKz-?nA4LF#f)Ax4D54`PSox2P+`p{g(@Ju;
zjhi=TCoLUMg4>6`<GcZ}4`l~=9mn%k21)zB-6#Af`EjW)8*q0gjbfwUUau`6-M+mQ
z^)U6*j<{d^;axA}efMdTvMc8Yw3z=~i1}2atcW$ldzIA%tJQO8`@l-Rk>g)-<U<Py
zpv0Jd%adN%c_V}VR{)|Zq?HJMu~0zt4~0@|UFjHr6GTG@mMGIFgHz+?g<O4UreFSE
z#-ZK6*%v$PXTc5ZcW%8XA&FMi&V0revNgxv*%DBucBiv50am^~8oJGAEZ=hZHeYYd
z5@w*PNun=i8USQ@#1+cuZ|{-<%o!6)#nw#W!9D*1<&s@2P@7!94bJ<JREWL!@_gDu
zls+a>sJn?Apt!C^r+I4`{4Dl*T$#Ih-^fTiKUYtJxnC$k2U!ft0z`{RB*g3ScDD**
zi0DSxrIX#M?_wrTbfC<X38lZ+yvUd`p)^s5>ZjQ2W1luFgfYa-aM9;vUk_=wFHJvv
zt54(lycIqu{xIG|$~P2tO-{|gOfxMiGE<@ypvxHsMB|=hNq(9Mc82W9u3>*8f8J3I
zDZq;c7a(l?<yl_mZW`?yRA`HbP6et&URplCKoEbJxP<nP{K~#n*$b_c{7UwERREyz
zD6_l;A2{xPML#dJTT(1`B{StAYvx>uix2L!g=V$TjJK8cNi?eXv300%Zg{t}8^5<h
z225KlVcFSIG#-oke>)HmZHs8J(xgblgBaw+hflrvlrgwbMbvh0UQ2jM=Jq=vzI?N`
zfa%iRf5?f8U0OAO?L*hqk-g2ZMuDcWAlSo}JziU+G$ueZe}$1n>DQb%O*96e%Q0ON
z7D@GdT8cBs<R7f$9+}oH1IAj^loxbR->_~PO(}BIu|5$;pT+1DH-6jtc(5k#tALTG
zd}Hn_7n(%uI#%&pbz657jr*lfTgZ-mrauQK28ZsZtTx*^CDH-|Wwf@_)UqtP5%$Ci
zE&Rf$dP0?$nZNC`{>~1?=a(AB0>`06&MQKAKZWJIiPxey5Tcf8y@@Gfv4VVaYOAHt
zgmiTAp@}t=r`|I4)ATSF$uJ0!c#sUETc4pYxIaAeTG7RH2_Lj600l4*NkLL018kmb
zRIyfv7w)<Fy&=7bPdht{kE%}9IMF<EgMpjS;hh+xqGj$$vC!eQ!(Jco<E<oPLwYmA
zhv>&=M7#WdOh|EVkJ`OEzff}Uvgcwplr>fa6hY^W_kR7S{C1n!d5rkR&mM$9DaUd5
zi?*IKS8|^@G;8p}b|wQ(V;R4zyOPB6JzEu9VnpF2(VdjaYpg(D?bv?P0k*9%S@vNc
z|3|F5=)VGf;bqm5QGm8_r&0H9Nj-==$A>jGPU_^|YuKbVH?W->g2^}d6>Qls=CSAx
zR7#$WsE;$!1U}r-?NNUr{&3oKM0%>R{}?oQSIrH9t3gOSy$&zyHkCOPW;D>jHp*<S
zVg?DOwEXtA44ZGUPH<k?rUBYIRzdiG!dRe!l36>|wCNtIyL64oFcY4B`MX>Vk&y?F
zqPwi15%A3M1gNNKw0E`s47YF~3G-k7tRG|`v*ISo;EKoQQ%{!5ux#WO1VQCVLmte5
z&_Oj5+j~2f1M40xDNil(s6P!4FP@@7qogYqLah{R%#1y@4@b`prbw6HZ?H`jzAf2Q
zX=`<qAc^_FGCUFCZpY~qEet`UJtJK(^h`kNd$&wtrwB0slu!6TlJ%@h_$^8g|7b<;
zG(xcO#EIxVff3R9ne0{0#<9s^P!AIv*+t@l#jQByROwBKe%_&4+K-7D3vC6CgYznH
z2%4)x4>V{;s>gYEl}Ir&=&Bc`g@Q};Tn`Gs@@_Q}5*tp2;-d0J>xtH>F+XvZHO?h7
zwPmCd?Z^o|ov;m_Ocp*_WOpu$0ks6J@k$c1_S96vW}ph(PRNK$b?1Q(2SI+QVXJX7
zSXBAx!t&-6`NMxi3GrRJ5!^@dJtpTioa^0BtAJ7V<AT|>6(;<-v-pqO3*n?Uka*Am
zkxG6Kn9bPp3S%LeoLtiYb9+c|7fj@b*40QC)i(j1>~F6IH9qfcaf}Se335#s67bWw
z?<#;4RlEiqq!b25wkj(_!DUX3cl3E8@g#e2%o6lo2&UU4l!(mM6s@#EM3p%zRw4#S
zh?X^jGI;_Ag_fg*?6+{mY6h@4HFD6(=D;T>21%*OzNdefe~dwT4guOM@sc$%Ns5Zg
zjHI3_3R72B)3;qkWMwTL&Mk!0{#ybW_HyX<c~otzJ@+F=H4KWwM|jek*1g@KiC(tC
zM~#u@QI{5lR+TWwM)Fpt2#eWHZ5x-tuIEq$0DMi7j#eFrp51_SrAQEWK}No$EPl$I
z-MvfVRiVM_WV%NI3qHFOW(7mIMD8orsH%<rXZgmZ_E&tk!hco5QUR1a_*btA+ls*l
zfwYAK6GU(Pl=wGBCFU$Pe>)uB#E;zyM1d`9#CLb_$Da%Guo0iH$@%T$_&2L$Htbla
z<(c@_pYJwi2VBh*sK2!M4LxO-NZb?b-P=zC+jJaUZ_CnvrI!Q_0yK&;MA24()At1l
z6k<~#0x``}9jY)<;-{pnnqMY_;|v+ZXX%x+5VY8y%i!Xck8P0^1y2LhMFVXXA+;VD
z%i99jfhcpSp|0kiCxhWTCScf6=m?2+7N-74)pmfHJr&dZSB;kadyyWN1iuhW)SsS1
zx0^r!-8pA4bNxFaBUHIkSA9BlO!*|nW+Dkr#}voJEZwc%Ku7oe1@(!kMnh*wlj^ZU
zQuFLj+}rN<XalQkXW@VOeB9YZSw+NMI7izU5$LX?ahfP$3B)Sd0-%&A%00U;-n>ck
zWm;kiky93Bcxz0Xm)${C^gSwT4*0BrsrG*tP5)Yf)H$~67M5tb`qEnAE{L5T;Utd#
z4zwnnRt`5q3AN(}4_w2_aa;TGPi<0>jj(n%V|yq0aE6|(W!`l%FT7Mt$PLkYH(GR@
z-b8jXj;&<<n{KS#ObW)K=q%4G=YaUB&;lh#h~0BX3aNxxQM11G7^X}<LGkoAjKpCD
zKcOcUzqhXI%=jFvsFIi^b%SbkDrTlgTc(<RV$0;CjwYV1x-h^*Ay<mA(?D?Vnt1D_
ztuMqnX|NxKdA6iKz+yvUX(Uj6m|zcv#~`=jrw;F%$S?i*gN35$V(<aicimus@q)Tv
zTy`~DVKtynZ3o;qH5Jl%&RF?^uo5%fk?=E*@(SuZFy0j&O)74Lyf+7@_1dLqe7_|T
z4*nhEq}`(4AdR+{zAxe{M(Y9vF)Lmz2+9u!j$SzZUqM&%e!Z%<39Uw9s~=Hv)Xlof
zAt#c_J&q=XqOA}<e4$}kN(9Y^v2&sADcw#b>>DL_#zu6Ll`K8t7N%g`eS)G<pXvmG
zfS_2zm#{eF5$~kR(utZNEgNJH5}A3&b#Gl#Ejm#cD`7#ETv=L)2Db1rNi|(~-H3<x
zZ@N=6c+bX5?<)^)PBMt-&49OH1~9wZ_I6)kDFIYWG{LCtK?3x8<xP^}*ed5dJa9cd
z27}vH=?Vzma(?D(?33YtaTQe`AEm)_<3m*&pe|SOD5#$eXA(c|2VYxQt0(IrsDgDo
zFHbK{5shmz4C$CLwNqF=<I*B96AUI&*}5kqMC>ZY{Hlq1V_KTQ!CeU|s>UpQRE3k9
zs`(IuNdnN?V>hx25zBmG8Cc~36xtG5NrghUud1~|^J3mfL4OrKNmS9-qxYDc4Ns*m
ze*ZQqD($UR8O%T0MsOWz#(lx|3eCD7mK`{i-9H8M9o~0BTg_m5zOY=DzW%n!nf`Z_
z&Q1M3XCQ84TjgO`)v(tIJIOR^w%AN4TydmDdQ13-mpsRCjYa<7r3v-XihEyQYa>vt
zcQXFR6bd3z1&V*buMV9c3Akjpn)3Fy&1|81Ud3=qnZ)vZF?#QBp5xtLB9Hg{)jknl
zgDhNgv=iRNbZcQgSpIj$kCe3U{L2fzm=J}@{bpru(Jt(qyFka40&f+ZBS35~c+0HS
zhBp*bJbbE68}uU+#z#i(!s+AXy4Wg!m4Oj*938a_BjB$tAqa6vIWWWLoV2DRCr~C)
zC%xCmmf|b<;ikI(=v#xsTc9oJWrK+&u0ptagFVph#?BQ1-sJdV_qcw$l%F=E3&*=%
z4KcP8nvN5ow*_(skQ0(!M)^$n0^Q(F9_W0?C=XY1g44~Hpo1pp6^@+c6hTOXb)VYt
z`tuOI&v0MQskl7tA#G_bm1zJC7u!aqli*vt`$kC6W{A*^&)&b;Xl1*!!s#QCMlK<2
zsvaE2F*!2L`?4SBS{|wMVs?C)LUx=`>3B+1GF}(@A>$ddg5GqMr~|7xadN<Z*9fSk
zH8@3z8kmrykdq5f66M*}P~bm-xF|v{H<zWiTDw?t`m(m_4ClD<jU<7XGoFqrVXe3Q
z``of-B99GUjxnX<k)u4L?dO&pzh5c>wgg!bkPv(-xdxqZcr@s^c~$*;nDAu7;W#**
zkkb;uIxq@GHO%V)%?FJ<XEQ8izULwgcw!r2lHmPa%!>MUB)HWkxCVY^Qo<nl8W*}A
z!;2YG(j@VPWqqiT5k>6Q%2FI=cQ>1}2A|Lp=kf|=NHu0;(niS`o{DqANQ4liy$<?I
zTfavT`bCm!iuj1gD$v8eGA(in!S(+bCn|Jj&#y%SL|!9A*BG_BN@9IT7SRoGxC~4<
zk!G&!7S;Rkog23uHI}**kHs#_HIml8ej<1_9R==Ki)5XzQUEx|Gy+!G@q`@zh$K%;
z*z)o7A2f1;@VtMj5N0$tHm?7vKE5KPdtxTX^hdy3IQ|g4+09E8nx&nl17TzSoG|f>
zRvl&tFAb_DV}%IkuerGn>pF-)YbDsSwHTZ?uu_*0bl^x&Qz=2>MjW0Q_3aGFB(g-x
z>q?h8r6lB!YHdc!>-h4}wt%@wx3`B1?Zqi)9VYnls5dTRXkA>$t~s7Mv^^#|^op!B
zaG>owsguaFryc8j=6yoVbTm)1vCSC?k=2z$Oj~O<>Ny!K0YH;mKi4MP+$czn8Q+$R
z{p%;5XkP`6uUVn()f^tB=Q#2Z=qlY6IO{LHnlm3%D!}j*3)k_TwCm$U7^5fhgh2JJ
zi@mPman(;R+3ysT-4{)qI01=2D~bmxPft<a`!=+(7rP?0VzJecU070n+`P_TQ5XwB
zRisu@{VIB5sU8O_20pGd!iA0HfpHB5l(L0lTN?+Hrd%|EyYT*zw2UR<f`^oB8oaB0
z906!hm2BtDbt9p=n%$_W+#nx|7d-ld$=;e&as$g?NJ1C@;v2Sx1h!;!i(7J~z*e|R
z$J~y(F7qjLOyY~?mB(_{i*ZjPu!QP25wD58up5JNML2pMqL#lMkSS&<RCOpvBlA1H
zy8p~{p)Tg8xMX5ckOkksf7rwltj`TV3(*!y*<5+V-oiOK$FaR2rqXQFo(q9+57bQ}
zNqDJ?2OFDzTjnR|BE)Qd89*gd>1Y1+D_DiDu5I$odM0aS<C0vAsOE25Nny#N2U_1X
zVU&FjJ_oYB>{>2M6|LA^uf`qSM<0m;+LJay*=Ku+rZ++3WD$d^T*M#yX42WTJZs5b
zvVSUKzC0fN66eNd>LO5b2vKJx1hu?xXRm!ky5yg)9`d&vS9{H&fOH{=%=rptsqUXQ
zR*n7WlnZKiY*<(>PyNrfVeN!~<-2B5uVL3sV(M{ndT}Zs)9Kf#8Gr_Az|nY~+4@^>
zxUb%LjJO)W$ebY$`Nx?9H2#;V$b-`bF69fGf2dL9IRv0cgcE0l)#48tzROMWOn|0Z
z+=2#Wx{#sas<h#_O;9j8^nu%_YZ1QR`2u8<aCDy`7mR-CQb(L%nd+LzMB6tU48XlL
zoeGUk*s&P4Oe%uwdrvRYMTG-!uI$+G>^@_M$IL0E3O&Qp<SY?8`FsTxG0-%WBPGB8
z&Gxc|E2Agbo?7-QwqbP5WdS`)AO~3W@|l+FNbx`IlgmS^v2oDAjAQ*Hk7BIxccGMV
z*O6MAfA;j$f(l*}bpCYRhOiQ;tI5;&!-gD_^}R1HJwV6tr4iUG)Tl;vR8B_b8Z`vb
zV1VNT=auX|nfXz*zwKr9juo1vjV2hZ_Q^Qz`{gajl6cy28Su5=y}|v@LpHZE>#Dno
zf?EKW1h$@<I2J+}GX3AhHgQ%V_d0j0txAcq2ptP@>S9(zWrdalg58X+m4;pVFL!11
zkr8&i_FrSfTV8@BpH~<qp+QC6w>V)8%+foi!Vt)j{VBiJsu^1SPHGqw&&?Pua49?R
zAnD-x_9aLKB3pINNA~}UK3w-Mk|g5grOAYXBtMV9k<M%_hi?y&lGh+KY`}s#ZQ<zD
z>G1Q_XhtAsC*`&)lON6vhiQnTmAK>ExPvChEy;VY{$C4l%5Ky>Y4vK_a4UUbG|2!s
zuZh$7@F2Xan?ZB5eCw9dzpI;U8%^FLqiTfN+>^krz<uVcFyzF!Z1$6rZ&<eg>4}QL
zeGm3fl5m>x)^5tnoI>e{exlQBL_Zp6>^-iS^f8S_tfd#YQqA45XM@gM=YoWudek9@
zMpmLR)npG!bl)hVILXr}Mwa^*_?*ch<WWM_vCeen&Y^LGwgj^T4N@Wg^SbAkE^C21
zb|35AzHB@#hK-!4DRDD==>1Ps`T3BUd1S5{?SC+UH9$X(jY4RXoW5u#k6sxrQV)F#
zSL&+oixu#BrO7963?Pnawds9YO_}tHHvEP&vhjOQSh|#<5z-O{Lu}}0?k$oah+Eaz
z%Pt}EPzgOtUV$=G^{~8J!^I5ucR=e|dVmK&8rVnbKThg@T2$08`)ERbuzw;9?r%#%
z242stnq|L6WDG|%u&+0gGlc6K5>;YZ*94VH=n)&1g!h5iLh&uFotL^EH6h4snJzfJ
zS{5jprIs*z;2mO3bYn-23~z%|o6@Y1dS@YoIIt;an1vOBdB(Duj}dEZye=OS|NZ#<
zdkTKdKOO#i5-OVbk#i@TZ-SVi0ac^)lDAfNEWi{fWoK2%loS`~@HE8l!yP?T1<eE#
z08zW3bNVCL<EIlM5Us)VQWt>6(9*PQ0xdW0OX%%h$%E$ru!s)smGBLZc;AU}+R%aA
zjnS6%o5%Xp`}Agln{Lm)9}HG@f0OX7<XUZeL4_Gbn)+Tj``d@r>WnSm%Q_qUc*oyB
zAOdA)g_07V+0e`KKRN`bQQ1M8ZeFbJ$HLlDE?%8C8VqPMIp>!`i{g<oJJe=#IHXw9
zmV$;LqRZ~nI{8@u*1Ct=;esG5q?{6V|3wSytL9Yx-M#b)cQ^tB{oZ-Z-R!ETk@b=@
zAfZ6w&#PU9q;QNy7GmCU;!u!{LQ>mPeK@r%0X(cR#((Ni<ukoi1-cHzj_7mKgyirY
z(hT@m2r$;$LqW|ITvQ@~s@16yOx|~4LLzP6xx&s3P1Vh!$+qvp+Q@Jdt5u&0e=x3R
zRi1rLD6bk>k>mIh%Xltn#_4^Lb%F;8-z$>RfHVB<3+N=MSn{yeSz9A_$)Hmm8UcS~
zkt2c1&&%-y-JjFcwTb*s%0zw|8a%>KW;bPb`gO(IICsxx-z{F@pqf4s#JBl`hU^|_
zw4WUDbj-^ws$=E5olW1@$|igw1GQSH#5G)Qykwmu92E1X_oa`k7KG3LdD^;=1G4PN
z%Ee=|H9GPwEiBeseIFP9Aud4@{zaSF=V)MlZRv8U!s^D;=n^p>xLkh?Jr?qm&I{9H
zxF|*It0UFB$v|)^+?EK*j1lTSoKs6X2$yehCm}43>^qjsE`WWq;MdX7r_m+{{91=^
z+^duo@Rx^CzB@3k#$jM5`PCy>YquTc1SWv9#6;qfqnZ#TU6bxJb%UG^`v?@#$4Fk5
zdcB3Z>a#!o9g>g}1dpb3xMFNIt)zwK<Xp4C`W_Gf3BIbYs8w>Lz@kcmv3d!})B~t`
z?z0Pl6R$vQvcYbT_1rUE!NQOtqiVL4OO7A*cqqfYfX5MZiG9)rRkutO>jh4~TAZ49
z72-mJ+jxN<cL-p6nL_x}5j)lbNw#*Ua!KEom?=3@k6ug)X<np7_D%D?%G~-Tc0&Wn
zj?vc>{_;pt(5!CZAk6+)B$fV0IM{-pYaY@6`VXF?k*H1ScAK{ybvmB%5JG;<R%tpt
z>cR7uN`v$aR*dBx4%sd!mHPl~Ca<z&HlZ#{ZoHO1u4!LCZ2k;QeT?24ckX>a>;Js8
z9samwamd;K^7JzN`Uy`QOPlFjJ>-0AJilB{#Tz`#?Wh;~$r1RGZ9nJfVRuYYC|6P0
z17-fiM)QSpW_B-c+W%A*Re`>(uWUpCAof|=Sl-pUn|->bkQ=cK$!w!~yhIoA3ohEt
z=LCfy4v*JG{nlX$C_WnNBB7=h4#-R^5`>NtZ%?~U9P%hE*!bqi?()kG$Zr@@3`-i+
zeIgTA8z$M7=(LWYPSx5+9$y~saItuD{+vmc^j>w!rGP{(GS(wsXXUV8<=Xk;%WMX`
zbv&kEV?m2kLF1PbUF2zV?mjN$TI6eM=yY~mJJw6Ruq#%rSeU%pF@0Zz8<6R7H=4=g
zIK`mU5=LOKBLf=NXZ_n%dfgTDY$`uUa=|&_O|$3c37^FI_y&>$|1sEfi_Gb?{of;B
zLsLM~p1gh%eUFp^3Z32-m6l!^qDoCz0vGPu;oV@<3)Fk3vX1!Q2Arn?rAdt`3SGq)
zbogvS`CpUO8whIM>1VZIb%-a8J~k|Rab7#7z@dStf(@;JW@B=gPj{lzZP_Q!8m8>S
zU-|sT8Rq#V@t+licd-r>=<!@!HmezuGVZ~cRMa5t074DZR_BaUX0bkIYU!J=BZ*d`
z>-A&oNdU%jU@$XtKZ=RR2j`wN+!-dciKF%(1E-rd9v=AD8&_dzlx)+J%&#5bTchqE
z2pcz<xI}QMwWZ36-nsr0uKv!W9xJW~shBDgs*jnsnj^Z)ue*WL)+zNqV_etI?GHFy
zxCA#=hD7V$L`VZ}`>7KG43a>afo@O{fLMQg1ToMezK^4;r>4M^qXGzcLngwBm`eH)
zUg$LRO@qBXn>8~c3Su!XCTOf+%;Nn8)TOs}z~{ie_c4ktTyzXq_}`7LGLFvF2vqmz
z0;v%ZZjSi6YjF)fnY=&MJ-jS|$mmQ)dX~8Qk1@qa*Q@~p@qkC-<8IvdLELgPs#h#t
z257T&nz2X4$A6Hs7i1EkDm@wh>*_h%z3At5KZ?7P$V%eQn_SPE6UDjHtgheG_3sGc
z;Gz(-HC;QKwVq**r2Er(q58TOJ+_poL#^rklUZ0v^EmRMS{16X9aoI@t~YQ?WE1FA
zm13t1YomvrYAMYglaY@LmlIen4<46Z7-5Qfn8olrzcRM_RgA?)7_S`?%in!ypCP3v
z1SwY&A<gh{97-8Ax&TU+KOb?~EfkuJ*@OJEt&>ol(BV1E{WV?Om*Dl5i0_{NswfBk
zs6SgdxwJQspru|SjA?@yw5$)M%mi+ZSVqZy#NWdel-6)Pn!bKo7m)QV`ub7#gDwwB
zz`F`2C#|tTmb27GpIYXd9~R!vUuK+4z3v1PGh6{sP(-+h0Q-m^d-@u>kX?h;c1=4+
z!ic(`ub9c0AEcVPJYZ(VM-$pWLf+KSi2-eq!WI;FN5<YcdkAYu{xm1<HgEpQ_<cq7
zH+-IJr!h8h^#@Tj22;mI_tm^)Y5-@lsNB%ZrSVuWI{kMs_7Lq;fyh^et`N)To8*S*
zVdmk9g3c4V3xQ){+W|5cN+>ZiDvad@0x=nm==RH9!cH?@QJayIuU}UkO?w&PnWem%
zOeTdV-dx9^NUm?9_b)nu&1h<LPz%Y{?>S|{uQ@fY@{ke4BIjh5SVP4tB!;V_?H{;Z
z1YbkvbC~v>?!6A;c!cfQtWm{2(3|mDL(34eME$1SC0Zh*DFMyou&<G|NzL_vS9!yu
zA!{#7zZ8U=?Dxo9d~ZBuhc^fG<VJ*P7iA`DjcaXKl+Go7g#A1`8GwBecKQe*T*<9N
z2IR_U4e6cPBQg)_%n<nf6`>Hs56t2)6wu`CFOXk;n9^YMRMlEGPeK!CfFdA2V?j5o
zKvuJ^x1reIW}-y}TRWAfFgNsqkhu9&(ZWoI?*7or?&I*Cuy1iEKz6ZZbwxmG{U9E`
zooK}y7~G7ulfNQ`0t}d?@!Y{Jr&Q(>8@E;!2MujuuE&4T{*KZ*2>)~%jlCmt=7g}7
zu^K&8N^`0g#IpX1o?Zvy{M7p&VuI1f)Q8=auo7-2`6MCd0Gs`wV#m<EtPFOEt_hO4
z8!8pq*Lx1x**7x#?6k%VUmqcnqFT5^J3WYY=f&xG@s?L>qDZvW4Z|$82#Gu+_&iCg
za&Xa#miD#V@vEJv>|uLOW)#s(`^GEJe3p5NRH{r~+f6h5J-?#lSJrtJZF=-HF&O@A
zbk}|o-Bkp!dq-4I@aO5k;Ikv#AKA|dXBKVt)mX}M*q-lHr3Z_#lT3zu&qh}n8_R(=
z283Xe5)YKi^VS&5+Qv9obf^;Fp(fqTG*W`{<rekbkMQ&CF}w~Obk@Dmf*xW5imK=C
zl+W6@tc}@g_ZHhtLAE?=Xnwxf1xG_u8mF)3FmUpV$$PAz6|c;f1?3ZXxXB^buW@GE
zU@9h=a{Wg`0ZhgVTJpv?E05xL_?$9xh`$Z*&d@6;dHlL`m<pa48zj*f9*LL#!aCQ!
zQtj-)juiInSNKF@oNsW~wt=%ca6S5g`41?eL`ud=s5!4Kskl;J!8+z$UW5aO5sO`w
zM84v|dETS>SmG~MK{N)BWzLvKoQVD;*x8WHL247L;8>kX2C}C%8#KZF+;8^(_XXd1
z_34Ly`d&3(Rc8T|RdCFgt;s;`&j)P<|IW-)4&AE`R-Jh#;6LnJM9L#2$fYJ|b>A05
zf--+`t5iGJ>$i7o)u90`7NM{2Y6ImZ6B+OwcBY~pV*8|hBQBXt3$EM9F`=1%Zc2H?
z9nbk`4jWK~$6c%q&7UA9TQ;_p=ps~hERuK!M{3KOZ^-FbVh5#{z1mIGZk`{!7v(r-
z34mqyeawR;t*9*0`iKFYjGzXb5<v~?AI-`6{~{yHXowLK@v}`V_4Z+V!CXCB1_B-j
z>4HsS)+cEBaKVKw3y3t~R1~oT7zR;kiCEfrp*U#q!Cr<0M29R%iK*7T=d{*4UzoeD
z<h~Nfo&{PwF&oO<E|1;v{=?tJ{spY;rtl9J$2EOP7%M1GpO;{I;+-aYh@s$<LHwA}
z7};D>I$^vi@Eaooi%1&qmahSP`wNj1UiJl(b6IzwI7Zq6P7``)Q!e)UxyE5$%f^6~
zTfr~r4M|A{1S7^uXVnG4DJtwkv5^7tsV&odZjg+{{=?9vI*c7=qu+qlz91b2Ft|dH
zojyLkn6cjovfU$o^O<X_YEa2yxB(uo=Q#fwu$-&IkU1nq)A$V;p==KEZ&ep$FS@N1
z!yM2Wa22gAv^DH!$B>W^iSlrj`c5s=M=3~QCOE#l<^3F-A;^N!zz;F_=(}22MkVTR
z;Xg+xq1`1A1gRW(z`Nl5dHg)hpEfj(!a|>qn$_#tAn_@>K@tw0NMxL0RYEy8OVc50
ztGO%3=X#8;I}$Lg-61_$W7JuiY$+bK<yJ2*QyUnJn2q!DOH*4}Q(ew?Lfa#j_F!N3
zC|IVbE~QLK&Tw%fkS(fn@kr)AG|Za#lsMn37uMjcTdO<SH%h^^@FC}7<jW!$)e@*c
ztU1k&U7P5pmi_M#YX-MGG&J9Y-~oZL;p<p}k@=WKG5!xQeF$;1TP|tuo0$EB7CIYE
z310?i9;Z#f{i1&{dLnY^EUL`~p4iQ63PVWQvg~<v=C9CCNRG3vgJ!3~!BwG<7e7m<
zhm3@harcQ9{6|_GzCSQ7kgh)FEU9)fIKHrw;GmZk1Rt!E&rU>IfKSVFACwG=F4<wY
zic?MIcZhG9J+FdNu3t*sFD<#h&Eco#R)51P2!W~j%yo0vvN<X-!C3^p)TX4>UvNG{
zEef2>TBfJTZ28_00z&4jffK|J_T4kC8#Z@~9aYDf?+JsfKHT7-l2U4Scn-ZZzP0r-
zajr1nkTm<}kigSC`fjBuQC=#<68Pj{9rX*s{)w~;cyjSL3H}@x%a93E&or5pYWpMi
zkDdKNp-}4=gzwSLpS4&BBzGIS+u=5^4uTADU0evjrCqpZ`<gH+w(;h>qGEFMrtU@u
z9d*O+v921R?R<#MhBxS3I~}xemM^y;I{{!5<;xszIo<rr4kh{uvLvkO){Q{4!J6#~
zN$lp{%!uBvV3cJFzrdVq$uQO28}7t5z29$|YcbmrpmK!TYZ0eaazGVrTXM5pdIG-E
ztB0%eGa>7*VOfsnf4A?tFLCFbJQx7OaqTl=_WS~sD3Iz0WdR4#=}iKW{(+@<cQLvo
zEi$3Sjif`2c1(%mo_I;T5TE9;DuB23A#fJ;s)>r6%zzfqi#@fhu75=a>?U4DgndpX
z-N^!^Oz5Xs;m16WPs%CzsaKi9mE=pdr@?_If~Dc2g8vVrR+txXSMJ6~YZTUb-uqjZ
z-k^Y9KytClt;>Uqzh*row^IH^w9+e_k+txmI|%33<*01;fq;L`*J97vh^MHLIw;6N
zEd9v7t(Z^}->UaIPlGi0$;xyM7%<WNeX#2N`EdzV+fdDTLCAmWgcuhct~i&5T+0xt
zx%=gKupZJ|cDJoxu!!8{Ds2ZxbmsO>)?T}!)iE^+COga5c?vIM&Jq{%7d+}uc+{n8
zQhM+cibNx*KH|*4l&CSfYa#Oby`w&K)UNY7!DGZaCGwP_)fO#B2{A_}6j4y2RYbb+
zL>gEi;vLV@@47ovHV^$*&I*V-6UW`rwH?bRiE{DqF)VHEma+s;pbvO%#`<_9))fTv
zXC{7G#FD_E$}@l8ro2k%<^-im0s1F+E7?U-t#O^R>X9S75Rg~IXd4jN$lvCU5S2T^
zwdzmbzxb1M)RUF0LeErdwC?B!#r4fjX6Wl9S_#YC1BlH3)V03Bkl!E+*9PCu(#M;|
zTHI*KK!BHP6+KZ$`blPjOjF#Jf#08CgIwm0rm43+K0Qup$ud<?W_4aicR^d(T%dr_
zlB&R+&Kp`$P$)>40>r}Af%O*UNm-O}wt>wl)4Utk203kpZuIn%WPQJb5CR-@lXj=u
zEe$Li{vYpv1Z0JJskPJL?IsJ<k7e4Qpp##L{;!oB(7w@)j4aS>f{Yd($>q<57Eye)
z3kUAL;Pj{XODeI&*ox;>nJBDQlB-2z`kj;o(s`<-!Hw1<ukY?T@0$10`EU;6CwqDN
z#6$@Yv&1Oo9nrcJARq$;LgO=v#4^9Xh_8e{^<r1S+W8~0B%n3vwkM4dPZm3cPTUcm
zvr%oZPRI=SJ*mo17YmEWeF01!9BaI9hiQQ+!Z_&M=2)0-)x>Sb_@VmT4{WUIlt9}K
zNF*fcP?^T9TV;3uDgw67nHNB@_FbCnb56dHyLM?tOI$=}Ri%(+2PS+Lg}yJ1|NIhE
z37aOq#p(T2@GM1&cuk|MlVU_a)ZrRV-Jw#}S)A(P3iL*kuE@&+Rw-<tN?GeUS`pbb
z@m1ES`g_wQsfwqQm`DqgoC(%r&p(D^Zgb@QYUimgY7LTh4e0*ikxUJ$-RJ&r(Pr6#
zMh_c--=V>q12Akl+`t~QTHLREHeCu~e#HIX+E{0~jF@!>l#Y46NY6VRe)(kbuUD!&
zIY5RS<X@3dPI#u?(h^NHFW_tf>MUj$6`@(1cP$k57DEH|5v5&xTWGcT0#msA$IAuh
z(Mmw;<R?&$(s6^jwFu$8tfIA7%3uX_IW<rhM+9RbwQ32y>0h3ThQ9AOJgtoX8fEdb
z($lP{rr^k)fNn^vub0rylDe4AcMw&dOOEDyQu^uHe3m&-<FL(BR=x=ZFOFW;>{@j+
z#r}RE`#K%K!Z07zL8G}~@jS@L!4n!ZX^WaCU^z=iz#f$ShAjL-2x+}Q4tQPKz>{^r
zp;@1bMX9@8#0<t<U<5vfoUL#!*2XX#=kjn8b)F^yQ@mO87gG1m6Cx^UcH=&6>+BCB
zX!XiKRdE3x>l^ehtKJ!z(dJkg$hk$nfuXBZ!n!v;>`bcEn~oHK?TMy7(ecs|8yRm6
zk?ALl_~B3A!62-NrX0@Gsf^?D;0Bs!RaVYVP-633-%UPDD|qwXM^aBp%F6m5Q{F5E
z|LRR4%+;61vnCjS=2rYQe4Uku6VvGB$}1SbZ<kzqT9^3`;)<9I+9-R;4A)2<EXHFb
z%`mTLbw6AdeF|RuD5`1rlHN60fIgq4DDi8hWGRd};#N?{a$Ea)`oyXk63oecYPwmE
zLWgLZimcE1O-|Gk-Gs}!=&&$h&ut>3yS<2JP|mzW=U_^)u{E)N=8W@)eyp#U3Gqab
zMGj8D4eLwjN=Fp33oN2%ZB*KJ2L-zpod8il_uCRbt|G!y9X0t^3u*J#vxRQA1;s>S
z+9ulKk~dv^Vus-~G!K%5C{r$<SYv2HV_pzxsyOP$z!2oiy{md%3d%xd?E<bmM62yq
zc}Ru66TN!rBM$b)cIOq=#$&=^tc0YjX5|%}G$s_0OGFJj9YY74tFh@!46ajW)NVE)
zrbsir(oF?a6SUg?(Sp)JK7S%sq<<-{)%wV9P6>bn9L|SVqXw7^J{B8K7Y(sFX`fp?
zj6{#?!=*e*mGe#;*MHM%Uci<!C5oh*peI(p1s4(iLk6NTj5ySF&*Trh`6dgTJPBru
zlUkhaci8T4Rfm>i@RA>48Mjx=$NZM##x^LE#vcY(x%Xu~uqf@4e+wH2HAdz^Z3~)=
z_2IB|x=d{obd^s#6st<a<&7;v(Y;-E8aHHOm%LauhZCdeUqyLdU35JmPqyvk|Fie(
zUamgur*S=4q(%p$eH}yH`=&snmi~@a_M_%hw-xi1<yk>$P=ueVeL8chREeY6{->)c
z#j5w~0lgFYifn<JpmW9;U)s)`ThW)pUwQbH_V8tW#7qp)?U)^-!B}YUgFjz9Iy6<p
zw7ie;RJB-C6zY<&d;p=Vj!nYQrFacG{=c8dx?`OVPxWf*!{p!~8nkP-`1U4Hx4qaq
zdI4-~^I5NlbnJVNFLRM2FU@1r4X+#Y3l7uJm<!V#oXwOB<+YBap~ai&&8gj?5KLJ?
z^8H86y(0L_W`b<M5^lpYdJoIS?3QLti8pHln%TR?Q%eY7!jsAaS1WYaMwoOtAgc}u
zqIP=6PxQwp?gxejdTUmLE28I+$TOI!A^*H0HVYl?Nmyl_I}D*QrQwk=W;l9~#9CN_
zQ{S&2s7?Wf2Ps!$HfU^^^eiXM+|FFFX3G}?O&wm>Rq2RTOkVh<B=1+;s*mU7ufx+6
z$xki+l?`l(e4Ebo2mJ3EC-`nmzaj&XH%`r-;(rT&gcmHlcqxaVp?0rmQ+t$+-XIuN
z8uB^HuT<UmLzmjtu?c9Y^2&<3UHDg__uPb0fOUPgzTgZjFUygUxZ3CVm30F}b6&|p
zh+cKbPL&(di@IZu8{Ya`0Zj~qRIwrePtVtk%eL=NUTQ9cj91C}{Es!G`pE9%?{#h=
z7G!LqMBoSD&^~pv(~dWI2=R#)Khi}c_3zvO=3u97+8n_q{|-yqGh)xY)3=qTb?b=5
zXt1+BkhxDilgNS<`whS0{*~!z;XrGifJ(;P5+z%IT(1FMOohCjhB11p`#tpMZhelL
zbk?&g_;A!qrhBBmffG~t9ss!?pu<dq8l)GZdlgAR-kf^Hs`?4EhytjoqXKrnH|c-e
zst>~l27uGvFT-s0C1&EHY7(%l{Z(&}nl-dqv-$XZc~C&59~>a4Q0qpa?N0={zh-=e
z-CP*b3hT7}Xq7)v2O*9^n20gdSvaG+g6G@l+>mn%w%{yDcYak>q#I27@t=C^YHnr^
zb>ZPrgqio2C1WF1=*T2rpBtLZME_42$I^V@9a`--)6Wddd>BdH4I_p9vf822?${a%
zTa2%|ixm((7pT$$(E0sKdgKy6@9W-O1wi1i=(w<`P@$J`B1yy<mCR9qD|fN|8-_-~
zfwT7PRrBajO^7q2R%Bo|6H?CL^%)_ZvU0?C`X8o%%fxEJ%1_~o>nf<OGf|PyRr7Z7
zNr=8lAp&1ypp|*dmw3o4c^p$?TMYf<&O3)T0WYeofW8C`NLJF~4!a8<r%Hn%?|@S*
zncB^(HI!>PN>O02@3*|1+7-8OuzC}GOxCfGWq14)isnO)9?<{;q014a9f$>j$J-Sw
zt95Z28l>nw9MJpKWQ_M$oTfzK=w=v<yH{7FdgZx1{oDU5Fng*ZzrJtT0$@94zb~WU
zH(`%A_nUy}%tNPnHkKS~zBwk&h8S`>`cB^d(UQYKCEWzJp^5~nXZrpltOcXH^l_W$
zI|W`=J(~?N^o2y3_4wsziIrY$le%H&A|Cd6g#rrAKeu;DGB_%s8h@iYt_m+{zlF*@
z*z|z6P9gie+69m8yvUvuB%kWmYCiIWHWD$}ehUGL4i_2YEDG__)^J;-m&QuejQWM>
zB6Ra^0c8)2B3N{AjlY|hVx*Mcv%b~C_vA;B(=f`)jAcC$U8fQG6iiaBG&MZfNmKKN
zP%M7K5amLVrk&!Bo{R;0m>vQmFrQj!jB>W;6OZ=#APYd>Y=ay*y^;2?zG>ny=TLg=
ze){(5{fQl-=S<RMoT*?3zUL5HV=tmo35T?(N=Zl9<PStKQdi;CarxXfE{rU@_Qf7M
z?_=YJH&TJGaXA!_Yhv*pq9ar|jEP1=$$(?{zeORlS{d&sD@zM(%7@U{4n_KHlbeH@
z5HdwY3nJt=EJgwbm|(|;YejUs$7HdVg+q+wdQ}(LLBVo-c5ZG1x6{o|kvRz)9qA)M
zqK#^OIIk!F-R4A|0yQhimwT23es^w9{hZw?>TqOMgErX8(;|Nzn^2(4oMRXULuhYU
zWJ*@70@t@1_6}Z!ivF5PZAdEMD{UXro=-siXh&^+;a9BkdX!NfVGYDgj%BESkONWd
zz}JTO-U?->g6GNazxSUte4y38Fsm9x6N10DK!7ASri5GM@Q&yl)5C3pI4{yC5P{^=
z_4_CMI3z%e7Q$qi4uWis_IMyUK9b_s!R1&@Yrc#gH_}usR!vS-&yfSq3(K-*B#OCE
zv2>}m{b-d%vC<ExKHRUwqOgz0>*HPnbO4{;CwL27^cv@<|JMST9u)$rlZ{wlMbge5
zyB%gtrg+7}C!?H(`~g4W_|&gVuC^>(n|$8|A&+>7X}#2o6^0zR5g;~;yhCN?OG!)V
z(0T^yl>VAMLbM)lsy|zQ-}~4s;)DY@f9nOQMw`B|?Bov$9mqbr4Qq^gDM8Aqsef?)
zhkm~<@BcoQbRVMJUNw8ptIO@2s+W0m`mc#(t5pb*!7s2tjTuKpVmox*G9i|)o85aR
z7oj3(2=x>0r>t>T#BX~oB%-P|VyR13t709{>KBRHR!1d)HUjT|sm(57Ge725OeJE`
z$K;AaG}6K&&^0^IKm%!hGvC-RP|1P5vug>q5W{@ir<?#+^qzIkAOaLN&`*&@A4<_X
zJ4iH4MG%cpMOUfG`O+OWg`nnNcyBsX#S+Yy-JcNXP-GatIMVQaBQCdh@=vKuyqIW_
zWxs3UZW+{L-Z;(3ScI`>^9IsZMi2Zt%SiJXzSFAz#rFI)LRrd)zp_tVhk3Pk8DX5h
z&tzkn>gl^eQmgIT!*I)j05N>!Q)0=Q)SCu84vSl6&p%n4lEHDUz|13Fb9EZ@I@Y#=
zMjlY|nilL50YC=Xkc$fmRQ}6u^zw5-QnZ4wT2hZJa%J`Q@$>y87Nk91Z&`gy*-1))
z*u1#`WA=WY@*BtS%B%JFaEj{Z-Kwg$^WvV@p<OTrI@?NQ<7@O!7q%Ka>O!<-nK4=l
zc@kvFWJp+0L4;AuI(SzR-~xMgt1P|H7+CPW{nL)SXhR}?KX!0(AtEmw8gx@w=aK?`
zp6rW4vG~`+i<KZjg6%hP`F5u>0g^6^uzS3TzkP?M^OSzd21n+}5SM#{UyQvCHs+Qd
zyZ5_$27q<O{A-2g9CH8`vDT}Y<?RoXG$zC!KVm>z2ni6362RD-1K8xF6im*2m@@1Q
z1r|PJWbQ*pde1JlmAmJ6DobHN;>l)%zQ4Y)krK9C?dLo(#Rv=iTPa@a>a<4~q&lpT
zu$IYe2}&8q1Y8gn18^G7DS$!C-_zflTFYWmAYmsC{v!U-Lqu6Xc2u|#$^3o;u~}st
zTOm`&hpKSbR?`UG*o8V12A;Yk6VXZlCSn-b$C@8ZkC@&PQL(1uZIpK3s2kgK9N*jO
z_H7kx#XUcIq51{WxsgS6aUxS+?gRJQk;l%TY78Glga0E-hCO{`HECNEiDrf@dhI^2
za6RoRs-O^A<^trcuYwyFIaMCO+rA%1`hLvb)tmQdn?wt<rAgCuR05pMP^zmR-Iuy`
z=<_i-;F#s1*|X_)K*z<>kQH$n%Xl;}p42YTy-2b))&JW9mzukt!D#CcP^9;)bccFe
z#YPe1DGQHOh_=)4JDu#!IZXh{$M~yA*F^h^#|N^UydgO#04MPLXM0i&#8{eCYR<yl
zd=1Fh&8)xhJ%Y5>yG`$FS>wqXwB`GY)@%ix@y6-$+Jf?FVqG0Oo9b_RS2>ADQ?mxT
zgy|T-e)VvDc=8rOp<sK>@u=ub1b%a?D5|F8oadE#-Qf!I;?NY<AB}&7D_xRie=OI1
zG?qsrAELOmicM{4*({vX94i|OFrBQ#bV+E&w10Ar>b2X(rUM&D6#!pd!LsBFBAavS
z!!ZV!w5oWxItz8uj<T>q@r<Sb?NDx&e@B~T#kLbIBtO#VvY_iOefkOaI8DlarSiPk
z3tk>yO7POy_jV(Ki(q>@f?WkLC;k?v#=>6$&T_Vg$nP`^y~ZL?sxWU^WtW0(X5v}<
zLol_QVWxP{9WY@)(!%8sbOM=g-eLRXIDlg|2@+roC6;1$x|c=IqCAtAh$Q~^h>gF0
zJ}@_6>Emn6X}kgmEIpna^GLyR(LhLB4%@|&j##%5W{3vd6wtFYq-^p!9b3KL8fsZZ
z69JFkd)_8ki5|rU#_H!7edCHYmn`&o5yVnKa5pKJ@lRCL7fVh8HhOUF|JU4CKgIPd
zZ=c021PH;M;1&V|m%!q#!QGu;!3n`V3GTt&CAb9$?(V_eorU*&?yb6YtM2y?cu&>N
z54%VDbno;`KRwfrD-f;#w9%Tl_@&1k@9uaOy<?TIWf6&an-o@N7reLF%&-51L;d%1
z$tMdd*@S1c$V*mU<m9-??4fxx-{9b(tS~5!@7?cFygH)lGiA%@YHRsc1C2?jEPbnZ
zPnR#Behm{Tmho)VVAMc#^$XR?cWz%q9&yOSmXX=BE68$)>PD5QA)N^ijiz%{L0BDc
z=sQEVU8W8FAY2(XD;eorz*s}-=#gCW74mSv5{~5U$v^%*kD#%Ar~E?*o9kss!C;?H
zI^Xd@hwkl%{B~qlY0E0@cNn|0%Q%GzJ=tW_8ws`Y#IL<K(j41^x)00)eH!`vlX<L^
zKd*js1DvdI53fa(RM3JVE3b%N3q3Duh=vBLX<%Q<5UFZVATJTMY?qu?2wexBAo>#r
zTfwt3hy!yqnPnhV!xDy=XR#2y3PR<b7$FH`cM1Vq$jfTLlh$yV7U}Jk{Z~vDF<S0L
zkqLSdr)rs_ZB}U|+MM{{?$Q0xE-K<P&GXEXQ74?Oc%ZVGqz{d-Bh%tRZhqSqmU6b8
z!+@3ancpxB_|j2}{q%+YbU}iuoO+-n_KF_zhqWt{V{ZvRsRlAg3o;;@N?bc3z0Ln&
z)qt4aP1;B>jXa|5a#(u&t*ncz?God+M9H3*)s>Lnim^f1Si}W<ZKD~*-3q=TK?JMe
z3L4Vs^(cyecE=&ra=rt1ioi<!lisKqnsfb{jHqmQT?uY85-Ay|Y%?Nyw9COxH$vN8
zJ&nYZ<HY%1x!xH{7Lf$5OxYpfx<bjifr0$p%E=Bx&L3r7Y*lMZuY42)$9JZ#6H^({
zc`vguuKtYZeTx$ffIfUao6%8Ip~#Dqu}(^2oN}8jT^n}}@LDk!CY7luze&T)i#k|#
zD0BMAFF3tb$SUc|yUG_zLGuQgt3QjDaC4i2+x<w+y4fl;G_0Xc9uHr%@IXYzn~!KA
zRGz=m3OPE_qoE6jm3jTx=eNlqgh5f`XZCj{MlG2Po^U&R95SOH*3_wQQcY7$fvRqK
zJXHl{nZ3<+2rj;u6MO9`FY4N;GXjEELt)jskw5TlrWuavHF4fqC^1W48V~-ETHAIy
zE}r%E!8~kkfnQ&*kSNNj5n^=$$zXp-<y1ap9&2793Upd>Loy5@Ye5BnQWnZe(Ynh&
zrdMgDVu>`PrXZ>}iUEr+4Yv>I9si2zG>s+XV_rS$yd+~~t<A~)gd4xnL-!c6UknK}
zLr1V-C9|PK=bD<kzJ-xMIKHKd*t6&9Zyd=w8LgG;oVIojfpyz$t*zl4*E+s{mA?Il
zS#^JbwaaeL+Mi)3Wjn<%uo^hI_vsf`kj^We@A7KaV0Olr&8&OtAHcBnSEP7hrK@2l
zPp<w0ox^_epje~Cj)ne+y!BrXcU#vC{SXd(OmLEFG$6b{XFA89kE~TQeQRLZ$qNkD
z=+Nb&GHiYH5*Wa;C1>N)6$`pkfitq-3f}mwMm1413!qTqsKh1_d3$X(HnPp5J8#}5
zQ)P#(Xm21nrsstRR1>K`epW$?=OYx6+=32QqEg2BXhFQ&X5q8!TEFoyLzW*xUo0+T
zJYCZZdUC%~(iElTHf@!>=%u8=9xf|9mqB`K_M0XL29$zZTpS+~hbEMCHTCEro4BXw
zii-jw6=X>b!T1*YT<>#O;8!BwXE?$c+FX+D$BH)O10CgJSOHVvD+@6Y!(%>XFPX{@
zu3KEEFB1@Q-&7FKSGJVBpUJ#2wkJlabR+L2(6z*w+hDr%XS-d=DnYtgrhWu#<bedS
zG4LRjVAWq0=_2o`=tC+wFQ_nHJWfT+fDOL>y$Z`OlBBy%WODC|VQvSI)d_@e+ucuA
z8o<i!*GG%6l*Z*_u$DepnSE<}TOm_u*^{1{dgFAxJ1i`$JLDxBJ-w1o+xY-fa&mHx
zMASl?kJs}P>;xo;8cyYYju5j0H}Vou-`qTU8;|dG$p-hP>drYHcHK<H75~nCRo_dC
z*}k+N#JGt-!MOa?!jIQsF*uqRSqpEOO0N>^7s7>VsPN1I<hK)STjeBv>lKoUB}vSu
z<rdu8+F_E2Gs1~o%4^rWto1%ebXtV6n}2VU`R$P$XN;URpi#O^QJ{ch);H}z*1`X^
zNr6g8d-}<2@{_zwRU&RRLz+{@S}~f?r?@wjRzHY4j_vM6$&Y4#$JV{};oBeWF7I<j
z56Tt+xUYN1WfI_u5+X;Xzi!<#lP?x9ILc!$_kRIbs&SBCW=xbICr@Rc^n4G$cxt}%
zRm>7ji3^PiL_nuxEY`ew?@l^OEdAP*nFfXD6$>WmI`M$q#~Osf!`y_nE}PvSHAKLB
znEZ+#8_QzwG3q_e+ljU`uoU2yzToLCT84@AZ2`gYBqNd10HDH$Sd9w-Zk}$xx0SnN
zj%POt(V63~zZAZ4a4-$c>k+OKe(K7rfv;V|G2H%&{Icy1<e6!`ngPkRx`!-AGnVUY
zK3<fnxHY%xG}sp?X0kFc>@7A_G-if^=1t<IquaSX+Zd9ALN7}UVEZ6{m+#ZvPI6;W
zkrh~SfB4~XHTxg*>X68VAZT^m{GcPiNId<}D6vMlbT@H+d#s70?A2kv39DqF%sY6I
zGF(Pds})Qb&Z^zv4a`j6HVP+1Ql`<t^_Bk~TQDR;r~xZbO6nDWBc~sC`xl<upB2_q
zMdk6)+)+9MS)_oo<h2ygbdA3c4~RQFFbCo2y{2aXcTHAB%%aI~8t;cGdFo0?<ZNhq
zsUxlmvRhvCM(9Ne<n4Fwlk#|qU=pFx967-k51p<H$Ys!{_{aNgXx-ckoL*@OnJ=*r
zLS#U)&%<=|;AJ#QXhFGBzm}Ss=jgHK1*P!2ft}JcxTm90_)W*E^5|s&1g~}q2pm>P
zUh3}jS0TsjcvD~=Q7THJf~?k*Tg~b2+&V3c3c7xZ&4ixaLIk(VpHzw4>Is&9^n}PN
z8NCVWXAn_QJaqgMTVJm)Sn17FKy&_Gj<E#d505xkD+ZVSkyGgLI|QSB<eAqLpE8Hj
z-%VoN6!g!Pk@Bn<e*$PhJ|fR?-)B`}CDyp8#8Zq%pweNr&8DLDI>XB)tLF<mvUZ*I
z>)5I!UXXE!ii(PXp?^sX+U$N}z8!>)e|<0;BlX<>{l||??{n!Z53p-?c6L5fp@X*6
zIrXW$X;T3bCq{0Kq%GOajV3yOUt3*+c};Ku8|jY{wpT6=)~3BIR$k{iqqnb{B2U3d
zIdJa&-mHCP7vI>(HO)S0%Veb7cVOpW3cuSk3KI@1kv4!5F$@zGh>guJFt=!9=J~SA
z@pN1fb#nT<xkXJ)wMd;#SvtFk#9;Gp-%XMvYA{3c9Ac*5pM*d=0ZRly5E`Bj*2<yU
zg^ahxXx`O(pGmVg>$PL6oS*oWJqx>?M1i)%&zykqv`^=%>Gw0<44l1#8>8tLP2h8m
zk}%^U`_;|Q|C>;@^>w_y6BdOt+HHfdLmSTal|jPCJ;*~{=y7PcjL(|_;J|&ofg2Es
zIli0_ST9B-RP&T~7nFK^{_V$TyT{BF0=qv9T$QtpyEeay<KJa`fA|)--2V^~z1B;h
zAxWOhI&*xgJ4qT6o$W;h91c`P6VHn~#$}aMC^ZdL;_g(e3B%HG@kcWJi>R#@sMY2o
zxysleTk0)qqbw`q&%~SC+bfRUFScjX($a){?sfC4R>v0>7T((}ARr<NKAv`ukB`5d
za{}$P-%fzdqE&4=mi6I_*W)S(A%lji0*AxyD?x?VoId1yYBqsY@S>6xF-?Achaikh
z=a$j#z0}GTYOJiP=FLa}RrCDCz{Ev(#!p)C18=Y6Q1N}^jol}FUuWf`NRDFtz($A^
zipz9D+6N?@5vqA1jhV*J8>{2bo;Y%X8<aFV<iB0r=Kv^!igGf2WP@4+;$FIX5El0e
z6@cqwvhWHa%Y<27-SI{!fYAR9PWv4V_8peW&C2Cego=|<7uVm(ub!+z)17XI{w+KD
zSYhS^+DJ;i-yx5?zB;NkVt}!U<ww?F%>1b~e7cyQ1_BNatfOYM{!BKUH!*(DGUEHn
zAS_&RWZ<E_E7qwV*<vG5A&XHFw46Qmi+$<0g|nuelKCj{0YEG}JDf<~`l}I!jtXBB
z)zLZ|3zCXpzSfT~MPKaTuFbaBB!4`ahyTiA%qG6v*ptMmDhGG%gV#Y-`tmIN(}PRj
zpw6i<zW}Uh@tAna#9PMz?o-TJuN_MlXf7;ed;8;3t(qZ0kRA%;vuIZHV#0oR(R|Y8
zH7a-$Nx*Ilj+HM3PCKTGR3)Q`#G!pL<S|iEFEBBYP8-@`M<D5iA2=pHU5(dc8KHZR
z-83pRj>hTl?;adQ8&b4^bP~a9mFeGL?-p+fLrEtBY%bs>Cr|wDL~oQk{db;g-FLny
ztA`MEw0oK3;7}mEhy{#(U|k17=>^>Asm}LRpa`YeSa=_>!n5Oz^%xBqDndmvvI2xe
zw(hib!sEr2(dX1q=26%w-+Vhnz!62EOy=EzIa%17({extHBl~LPejLQjm{R?H>out
zP$__vN<8F`zp^5tKqi@r%fbZvjDV?qM3;%{s#j8^uu+?^e>QWGV#94koCc76@($lZ
zX9OP*>0}U@q^q_er9MP`1AK|b{`<gzf{N@Pjg2MRQeU`TrS<nS-{Gr{D+S37t}C~v
z@dXxWTHOhj%c|PqTx<gSRZp;cxn9jM$pj|wloqLw&h@YaAAg-p#486sRxT(LF;>!k
zJz`-kS8;z)V4gLJbs32>S{`qcAk+6+C07vc%2?R_8M&ySAgjRQD%|kgeLpY0SEC<I
z<V<VUpU^E6wS!czPGGUANK}M2U4^ZMw(ULy4ht`w<t$&8kdZ-_#ee~r>a?;;98-EB
zGQrSt%3p)X^Mj$8cc=yfeHtK9=!jrLr^(y6w+>M-?1esLzm-YlB~x#(T5h%kn%u{$
zNfW%}d4nW3Y}qhu3Lx~X>dLLByQa=6!AJPPCKoAZXUPGxQVj9&@p*B@rKKbSpDTNe
zu|-YI&53+`Q}StOX-87IM~?=%<YlF$*(C-nQ?92}6?=Mm>=tUJ8C>tqw?JM^a2lqL
zqO7c3<-9YpHJG@wxjB@~vGX&8EQQDE@0Ee@*Vwc-Y{C~8f9HgQXx^*zhIXH<Ft+zX
z@+9;ek-7@VFefcYdY`J}3(oy?y~ocof6O3?M{|gU)_=>-o=nhK&sP8SEJh4xAoUVb
z*<^4hE6rlqo|r!8(CCn{8r)N-Sms>JL$;)izE)6UOK3$h`Uly66P5r(knl(h3U17O
zE`(@S3W+ex!xW?#f<&~wxy`Z#Zgl)yJak$r&)KsrM~MAKm00!;9*dP*<%P|vdlO?w
z@f$w2O2Js<GP^^5WS@*^CRh4lz~61WKGk)U{_NT}^2mq_C$GlN7fywv@-Me2W1hfe
zDhBBnzQP@i)O`Ut(OF^7b9d_=M&Z8q9|RFkGVQhN7xq+NkpJYxljY0vty?HfQ_P5?
zG59=eTDoItFkjU+bWsu%r!tAP0)LHO@@yWwY%wsR>OT?kGdO4=!{<cR%yivBf4cr?
zIzx-euU!q;wO5=>cDIpGpTIItwa6w*w|&ZtNxy#%A7K>9Gq;kbLYyA1+I9Qzp%d)r
z6~bhkma$KM#%gM6rnz?OZQ%4OH#c`~PP2jSqYN17@V<|VCgR%f!8gDarOy+3IIQXD
z5P_w!|Lf2waXsJc|7Y^OJ)GM535Fs1DX+lr(k5M@RnL>5Z{zLNQQ71fiLdfF-2*J#
z0ncM@v=-9Z?{c{iJ0tiAK!>g3tM3>elskCwEeZ{bOw}nzd_(HL(OQO9SlM|gz;*1R
zOyVOmuUBo$eEEJ-3YW5?km9VnQZt4pdi^c$YT@P-`E;+IDSh#0izd9|{V$BYab}Np
zL=k^+Dyg`5KxtmOdR1whz3U9)%6-Ux1WWX{+v|Z`2&-)6-u}sxSnsqV+gNFRh#0@#
zUH5~8AjZw`+s+ka)T}Z6aRwF@1Jh(T+iLGjJH*PrAALQNfiW5tokt`<0G4%x@ygfS
z!y;#Xg+H|A#16IU$%Ofn=G%$69f$~M-g{kDH*m|%?}yTMFMU9&U!+~vN9!HpgD3>k
zi4ua%E~N=u`?WB5NXJ4q`M7jdGhe>h(9W(U|H9&C)=#;IhJX)F0;VIg2#u>$(iv7{
z;BpK1ynC&>+P1)9v-RT#7c~lTeimhEI^GQCbIr=hxOhG54p;lsCGKWv82K9kfyd4M
zAFLqNk$`2DCP1GD+O(^?+r-#-sqGOYu}x$%IG(M@bTS3GsHdl=0cO0x@YhVVa!G~)
zd2!k;pU*&|&VT0PYioww1rO^4ft&j0=N#R~p}(xFN^eHIia&Dx9n9P5wQmu$(u*(1
zAD2+u9{g65E-|oWHf``Bv`wo-v;>o<NfDF80q2@;GA_y-PzU_&&~1+O4d1;}nQaTf
zO5yp)>>M*l=ztVmNm^@WaV`|$OMPsZP=lla|M}c?G3Km;kN0yVs{h7Yd+H{liA4nt
zmCaZuOq<fVA06z7vJtj)?2OS8SoJm)5Y6-AveS~1{Q^B9m^p<%_tR+84k_&5b&xoY
zh<4Nc+QxlChxozctRFMv@k+0tJpe1aGn`RWCfBs^C{r`)Wg(qSl=xzsYHR(%{S1<-
zRoFzJjO<5t-e|&neV_hZfl+xj2IU|5;lTz8<7!&E*|dt|X_>`}zlT&d@c^ve2|k|(
z>of8aA=1}Cq7Th_S_NRv>{g6f%{!%oNy^7**a6hcKOQx#{?mCvUXniz8a!pkJVu6v
zY1Nny|8m;6{4P_p(HA2Lg>pLBKdd^fw)wywZX71_hsSdy@mX~>m6T5V=`sm|z(BXv
zX`}b{_OoKuJ)0rccgc_fy;l6U>sB|i;=0rL=p!bb(-Dm*VQ<s<&5i`d{MOh~u80g)
zd*|Ly>`B-x(O*>C^}*-%5Fmc@ga-Ach<Ty?<ef$@@t+|LibI*^?5kHz+}}7N?Wq>#
zdR`ta*~oMzMSB=12N<UBjMHSkxBE7@U8ec7aW^M;JXMlsndKKX<EN;O&;xzK4RDtB
z5I|7LD5j(ECvC%*;??0n872Gi?bhQ3o|)1{Bno5yJz<MG_vl(ZZ|x>)!9OR`J6-Nj
zG0VRe95B+Fv7;tqPc%5o$ron4^|-oE;Vk0%IxI3WxLJAm{T1J9r(6!gUhQw;+hykU
z2BeX2XNr>3a#$7jRh`^7KYFL6CQZd>^n868fnAwyaH2Go&ht~~F-vGuS7Hu75w63T
zNsmtaEn;gPsKOeHQScMfV@$|tIkuDOC-iAk3J~<V9vT>Umm&u_oUgGMh-2twMh8HM
zK)cGgCz_OhU|<001<~bJq5()Rtm<dIP;1rfc9a56hL;+hTR+z=1&7(A-S>jMH$(a$
z0Juf8z6(oGRzz+>$Yq7q5d91b_YPx>z|vlA-uJ`I7#?4Qz47NhabH0GJfE2YUq~-{
z@05HOUpKYf#T_w=EXANm)34Z|1q|Ju;CX~;Br>O6CS}Hb8tL7BVNlNBa);(0sm5i~
zn#y}Y_pFVaRf?c8pj<<W#-rvEO<F6+%B1EloDD0LAMXB9OX$F_o<p~y4;v^qmyyon
zq^zwLt+Q8t;a^F%{g-+6vtudse%Sfxo8dy;ePjbI%87~TkY}6MqJeJsH1p?M_&s4R
zSL>|Yc9Hke`dUUZqe?Y1i;Q)M^VN1{umUM?Qu5X?6e&xm;Xd$Sve{m?r7Z8}LrB<#
zkLPUbRl+3O!(W`bzq78Qq0!5=a9%hSo-6gMJ<d!HLA|5fFG*S{Pjq1Y9mMBt!Z<T1
zdy?GE1NEfiL8VQP@Y4lCzcf>JITtHjp*4Mz3vA_k#m_YYgK!iMt7ZTpKU*V$>Be%n
zr-N~`lyG9!1bp@EXTO|{Vs+%&y=}I@F*X_#15$s?WhG^bAd#5$?bUo<SK&0aSfDA|
z-fjF1<?mYIS`m1BRWt2sxY}~}dk6v7V!Lc<f1dv5-OwesArrLycPi7RS5G3aON_5%
zU$m@3bxw4#UG`0Cmj5ogi~*c-A0$0?<Qn_RG8Zc<ZwM}ucp=E?-OWa%XNJ`WL3<2^
z!fh5-HFg(lUNRrjGXh>E+!DIhDPVFr<mC#eq$WgPZwv!6BM_09g6rjdSzQ0QOiO#F
z6p4+UaD&As;!si}#y?dZ837E0)_vp-LAY-mjG|(nT&tM6Um5%wNXcdmF1NxLD)(@F
zsY4?YBjN0Pbbxq&X&bmqIA-G+!MXttS(@qI3rQi1MGUc)iJ8?O#3F83sjQWMSd1SK
z#Yo=UnczgDI6K-;%W;jdx1K)@YQ|GjoS!4<sDjO)-+elK<@;ighq1qQ|7tKC4t1^7
zqyBzttZ`V8wA6WM?~mqU9|=E5x?!7AXD2)vWZ2FTHsiaj_ljP##y62FMBo()g}Z~#
z^wCJ>%&ZRx9_p)W(DO&Rw&N~djH_21S|hCmv}=vt4knfYk2)#9CXF`#^{4w!oFNZ^
zcqqWcdf(89g-w11DnJqc=%{sMLY(qJ?3n%FrZ3%|t>7qC5{)urjsS(?=2xBKM?}Lh
z&BaBq%z$K4{Pz<9b^M0$;U4m^3dAw17Q&7O11W|)KzrJ7TE@n^<%y>7FV5q(c*L2$
z?CiZ6NyG6x>qo(gJkvD|nGZ84tpOjTq6jZsr{>w%Htm>NKQC-}=7Kt>HV;uVGmuVl
z-`1U=QS1>QY|7UgBc%nr$Zc(Ddw1(7J^A$iR7o*BpNm*+6zDlp4Q)wX3+b@X(RX~R
z>cyaN?K2a3aVHL2uFp><cso$UrOr5C9y0mu<a+VAa$RpssZh+sc0qs9$3R9a$wX#6
zXcGX?OQfM6)SAa_hJmcN{R?gGCaJ``4>+09wPc<p3um|RF)3tAf1MV>jxUc>szp)P
z=$r*L1T8q*D=pK7f%fux=n2OPg1qd!#e<9TMxaT1iV3$~HjFs5br8e-swWP<UNBbd
zNIvDtjB~eLcx0O%*g?-V@xko?|H(dli@}=&dzOb$h~R2HrkYh3v_Bm4DhzkOE1PaV
zE9=6E#3v5}*C*BH`BDI=NNJkq)5xoD(p_fNP}M$)OEjdPip~5Mb1U{Ct)IKr$=w7w
zxn?8iYSXW8>^OuA83o-4$x<XFD_*cm*qR@<Agp!X=n#(vL;0qe^S-}02xwCEvSG#3
zbRT7L*ficg#B9<Gouf<Ps_yzph}KagI1MnOZFcZpsmoE5Ue&D%@HWoA_uLX~do;9%
z9e!KQYm)9<ObfZlZE?MG3HR)9=6>VfILw4!c5%W_N3l`E2fpd%>HL@8EolZ~eSMDv
zgt4}eei{^(6j~B{YDG|ko3C`5o#K2nOSKHn)FvZ`IC1bh7LaY*GXt?W-Xm_)YU?eS
z<CoXcWMW4-DoEySu0A(oc7Ov^{|ksk^+C<u+0Ty}K5GUVg)^*W%~#j>7->nKVk<Z2
z1u%y{4^L7Afl~-_vd0rmArEtfe~RJ9>XB9Ir!kV|!Q$7RgVuL@+CRf4{mN!0UAo9^
zJ?4G9I~phJlzyq@620sS+0aRot_{9+ZOzEQ%+b6ewjZD6viLrwh&Nv@vx;(~8-1j|
zRIX#fgqS&4b%fS@w-OPB>wJ(wH{`eI8Sfb*^d#<(9j9WiXIOG34BNrO507=OJ!W$E
zqCQ~Ly)EcChx4G7-gBxO_{qUl8e*kk*z;XcI}U#UTajma@iASD-m3j|#~s|fR}!j7
z`WTRVR1+u>dM=7;c+k?TjZc;HTTfL^6h)9I{(IvC3!TDR|BG@HOFtq{k7?w3VR@~e
z+BLb~NYhftkbZu2ti<4gkVAJoyjh8W;O92G68@nBxKG5q{kuMtfVOy2Zk$B=c@52L
zi7(HOUXJ}v2jdOJMD0nSuc6i{xAH&u<N9R49r{CSzKnHqFebBQpn0etvniGh46=~9
zx!`|Uqjmi(n_x$T#Nq#GftD2Dat;tMpsam_vGNG<qyN=y+bVHq{&;BD1nX^HvFP$l
z8o{4}5Ip>vJP9-3kh^Q#ug8SDMl^YOR5~cMZSH?u#OXq4yWsFF1{O{dU>41h_ggYP
zQ?o%B%l~?PF9{hHJPbPPcVPlOwfEqhe1jkRDy%oWswS1rzR2w%4qran!DAX1;ndMP
z!jA>fFE-eDN3!RRJ0n0eRN3hXnRqD1b~Ei*@!cfJimFKHZstBQMa1<o7qGgpsD~WI
zjVe#@itmcXH&Pc@^tT<#A70iQ?)x0m^#OBYKfRj;Or52K*Tr?Rey2p3+#LV*Wzc8)
zjIQ(XRpdZu(g3>IrDJ>W;995Aw>b+WwH`YZAl7H-{EnZjM*gHvueujwO^xxX<tRbs
z!&{WrK=~Z#<;ix@z%LW6qa5OtR_@gqwUUPDeVx$V#@(do2KOm)gDu*6(<nkEo5Ut7
zgI2^s?VCxHU1TFHoN@WzQXha57FX+{W8Z?+(>>pDci!bX?S_!Hzv%_9%xMRgPgYe_
zY5yD$1VUX*P$)ALn^{Z@SPo_3xK<jIj^2_Ruz9zMw85s-CEDI1?iK%YT6b*}XI&Hq
zLY4!|9zl3iYU9eYw#w;DDvy*f5)vi$GJ%SW2{pEl$ED57o)*)?RTXCzYBdMD;+g0D
zpj~So>$p&RJP<=5{AtOPYITJhj?raK?F{xu{kx`v7aptRs9$44?Ikiqu|;~@7IGFV
zy!~o5P|nC};4#~;az>w8tl0lGK0vwo1##C~;4kLo4)%SwUiLH$Dc0WF;=KcZ^#R4K
zakj;E#ps!D)`3`(9yh~Gi$~mroAKFE!U`GKMU_$54@OxaYMT!(+?0C4pxj*QukX(N
zDvZ`OvU|Deu`#g6<!w%x{qiY15J7=bavjR;IGD3bj3?=_m4EbfzFX-aqQu6&;{-4L
zPkW7x1Kww#%j*|@rGyj|DirnMzuKcgC{$h}eKo2rKnG$I2!(D=g8KYVJ0~dxol;|n
z*po2mD)Z+OrJ_2w!uX$-gjozaWva!i*^918{f3GvvzOw(S|L%YY}$xd`>kL8_xeNd
zbnD`{_;^CLwZ#7t>)#@RDuc==TuB&ou>2p_{#%ZJKf9mU2hxBrgAx|HEBP~yk%gtK
ztPC;s`*#&x-NX8!M&})1b7#j7b~StdA)@Dd;=hi}%nEX=)ixLyN<q{#H1-wEEG!-#
z9t!gE^qyVcfw%he0D>z8iZ9X8z1F@U1D7YO&u4w)?hLBR%IszXaiO6o07&+n#_OE#
z`v{T-=YS;bf}WQkn2K%)!l)n#yU)Y5x=a)a?>kyr^UK}wjozq(i9Fc~{nqkl6|TIg
ztIVL#&?lIj5%;!FnSHUFLYzubQ4u^6#$27vEEuQ9t0c1Op<!Z{mz2E9ZiBn-C3XN&
zHdg%>9xy>dNoh1!X~c>M=r(@JvzaZwS@Ajnp_UTxTpXNW3_=_Ng592&?tcuyrYd6x
zo(sx^ii&zK+ztltsIO?jS8iglt<wgB|A2siXcFGP=To3`4fe|^iHZ2QxVcs-XKJFN
zqAo5jA|f4E1}v!(|EL7a!GvHC8b5L{FfcGO4%qeY?^}aG?EOK7!+dqmR?*?%;nl%x
zg>GZDdWi;z`Z+l{vFOz6*4q;LgE0}aR`qYD#DRZFHOa{WqR@PN3q0TB;=owgKbQuT
z9)ut;*D}10$H@sm?dQu!L`8vkA*(-_qdjQ6oseZ?$kVR3y;~0<_uR3b=ahj$XT|;p
zj6^_2_B-prcVF=+&^HH@^%vX25fKp=E}&N(2?`D-@(GkF0u|;kQ>yj+xFa0(gC{}Q
z<J=TXQxIP>JfZW%#D<2J%l<bGmLUhCmEXR7yYKuD47NcdQ}p=wxU{r{O)ar2DRjS^
z6B~;~JzZQ}oWQL0&hN=v5HVh*zrSByT^*Eu7TtECwg`+eXEOr~qreCFV&Fye7*`=6
zAkgO>gNf$a+S;@<5|i49IF)~(QEU<tjI7GaO26l)7=iOYsSa(ZA`Dk^CNZQujuh0?
zVr+(W+VZrj9v&VCGi8uBZ{A>#3weW>{>9E{`;)90Ip_jB=6{NXSX)~I-Va9&CcTmK
z&F&7~-YppcAVi0ZNkY%aC?hX#2hx-)E05>Pr{05ka`1wW20pL-RrWy&Yks#w&1Sc<
zi~!)1v-9NS<kx_J^Ye3k-@7g490~a}9;cNSkCjGUanN6=o0*xZ7AU+xLqo&BAmRPA
z3Em}-JSH-7ijxH-(q^dhx;ZW^q!$)$S4ig*ycpsD(TlOcQk@2c$=WKDzNWN`Nk!o!
zFpry=X#j=(-k&b9v9W1&t+OSf`NyB+EC1h~=YM_C|8L(szZAvWc)>DsXbgadw73Ga
JT+}e&{{ceV=A!@r

literal 0
HcmV?d00001

diff --git a/demo/documented/navier-stokes/python/demo_navier-stokes.py b/demo/documented/navier-stokes/python/demo_navier-stokes.py
new file mode 100644
index 0000000..f6f7749
--- /dev/null
+++ b/demo/documented/navier-stokes/python/demo_navier-stokes.py
@@ -0,0 +1,141 @@
+"""This demo program solves the incompressible Navier-Stokes equations
+on an L-shaped domain using Chorin's splitting method."""
+
+# Copyright (C) 2010-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Mikael Mortensen 2011
+#
+# First added:  2010-08-30
+# Last changed: 2011-06-30
+
+# Begin demo
+
+from dolfin import *
+
+# Print log messages only from the root process in parallel
+parameters["std_out_all_processes"] = False;
+
+# Load mesh from file
+mesh = Mesh("../lshape.xml.gz")
+
+# Define function spaces (P2-P1)
+V = VectorFunctionSpace(mesh, "Lagrange", 2)
+Q = FunctionSpace(mesh, "Lagrange", 1)
+
+# Define trial and test functions
+u = TrialFunction(V)
+p = TrialFunction(Q)
+v = TestFunction(V)
+q = TestFunction(Q)
+
+# Set parameter values
+dt = 0.01
+T = 3
+nu = 0.01
+
+# Define time-dependent pressure boundary condition
+p_in = Expression("sin(3.0*t)", t=0.0)
+
+# Define boundary conditions
+noslip  = DirichletBC(V, (0, 0),
+                      "on_boundary && \
+                       (x[0] < DOLFIN_EPS | x[1] < DOLFIN_EPS | \
+                       (x[0] > 0.5 - DOLFIN_EPS && x[1] > 0.5 - DOLFIN_EPS))")
+inflow  = DirichletBC(Q, p_in, "x[1] > 1.0 - DOLFIN_EPS")
+outflow = DirichletBC(Q, 0, "x[0] > 1.0 - DOLFIN_EPS")
+bcu = [noslip]
+bcp = [inflow, outflow]
+
+# Create functions
+u0 = Function(V)
+u1 = Function(V)
+p1 = Function(Q)
+
+# Define coefficients
+k = Constant(dt)
+f = Constant((0, 0))
+
+# Tentative velocity step
+F1 = (1/k)*inner(u - u0, v)*dx + inner(grad(u0)*u0, v)*dx + \
+     nu*inner(grad(u), grad(v))*dx - inner(f, v)*dx
+a1 = lhs(F1)
+L1 = rhs(F1)
+
+# Pressure update
+a2 = inner(grad(p), grad(q))*dx
+L2 = -(1/k)*div(u1)*q*dx
+
+# Velocity update
+a3 = inner(u, v)*dx
+L3 = inner(u1, v)*dx - k*inner(grad(p1), v)*dx
+
+# Assemble matrices
+A1 = assemble(a1)
+A2 = assemble(a2)
+A3 = assemble(a3)
+
+# Use amg preconditioner if available
+prec = "amg" if has_krylov_solver_preconditioner("amg") else "default"
+
+# Create files for storing solution
+ufile = File("results/velocity.pvd")
+pfile = File("results/pressure.pvd")
+
+# Time-stepping
+t = dt
+while t < T + DOLFIN_EPS:
+
+    # Update pressure boundary condition
+    p_in.t = t
+
+    # Compute tentative velocity step
+    begin("Computing tentative velocity")
+    b1 = assemble(L1)
+    [bc.apply(A1, b1) for bc in bcu]
+    solve(A1, u1.vector(), b1, "gmres", "default")
+    end()
+
+    # Pressure correction
+    begin("Computing pressure correction")
+    b2 = assemble(L2)
+    [bc.apply(A2, b2) for bc in bcp]
+    solve(A2, p1.vector(), b2, "cg", prec)
+    end()
+
+    # Velocity correction
+    begin("Computing velocity correction")
+    b3 = assemble(L3)
+    [bc.apply(A3, b3) for bc in bcu]
+    solve(A3, u1.vector(), b3, "gmres", "default")
+    end()
+
+    # Plot solution
+    plot(p1, title="Pressure", rescale=True)
+    plot(u1, title="Velocity", rescale=True)
+
+    # Save to file
+    ufile << u1
+    pfile << p1
+
+    # Move to next time step
+    u0.assign(u1)
+    t += dt
+    print "t =", t
+
+# Hold plot
+interactive()
diff --git a/demo/documented/navier-stokes/python/documentation.rst b/demo/documented/navier-stokes/python/documentation.rst
new file mode 100644
index 0000000..623fdd5
--- /dev/null
+++ b/demo/documented/navier-stokes/python/documentation.rst
@@ -0,0 +1,240 @@
+.. Documentation for the incompressible Navier-Stokes demo from DOLFIN.
+
+.. _demo_pde_navier_stokes_python_documentation:
+
+Incompressible Navier-Stokes equations
+======================================
+
+This demo is implemented in a single Python file,
+:download:`demo_navier-stokes.py`, which contains both the variational
+forms and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This demo is implemented in the :download:`demo_navier-stokes.py` file.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+For the parallel case, we turn off log messages from processes other than
+the the root process to avoid excessive output:
+
+.. code-block:: python
+
+    # Print log messages only from the root process in parallel
+    parameters["std_out_all_processes"] = False;
+
+We then load the mesh for the L-shaped domain from file:
+
+.. code-block:: python
+
+    # Load mesh from file
+    mesh = Mesh("../lshape.xml.gz")
+
+We next define a pair of function spaces :math:`V` and :math:`Q` for
+the velocity and pressure, and trial and test functions on these
+spaces:
+
+.. code-block:: python
+
+    # Define function spaces (P2-P1)
+    V = VectorFunctionSpace(mesh, "Lagrange", 2)
+    Q = FunctionSpace(mesh, "Lagrange", 1)
+
+    # Define trial and test functions
+    u = TrialFunction(V)
+    p = TrialFunction(Q)
+    v = TestFunction(V)
+    q = TestFunction(Q)
+
+The time step, the length of the time interval, and the kinematic
+viscosity are defined by:
+
+.. code-block:: python
+
+    # Set parameter values
+    dt = 0.01
+    T = 3
+    nu = 0.01
+
+The time-dependent pressure boundary condition can be defined using
+the :py:class:`Expression <dolfin.functions.expression.Expression>`
+class:
+
+.. code-block:: python
+
+    # Define time-dependent pressure boundary condition
+    p_in = Expression("sin(3.0*t)", t=0.0)
+
+Note that the variable ``t`` is not automatically updated during
+time-stepping, so we must remember to manually update the value of the
+current time in each time step.
+
+We may now define the boundary conditions for the velocity and
+pressure. We define one no-slip boundary condition for the velocity
+and a pair of boundary conditions for the pressure at the inflow and
+outflow boundaries:
+
+.. code-block:: python
+
+    # Define boundary conditions
+    noslip  = DirichletBC(V, (0, 0),
+                          "on_boundary && \
+                           (x[0] < DOLFIN_EPS | x[1] < DOLFIN_EPS | \
+                           (x[0] > 0.5 - DOLFIN_EPS && x[1] > 0.5 - DOLFIN_EPS))")
+    inflow  = DirichletBC(Q, p_in, "x[1] > 1.0 - DOLFIN_EPS")
+    outflow = DirichletBC(Q, 0, "x[0] > 1.0 - DOLFIN_EPS")
+    bcu = [noslip]
+    bcp = [inflow, outflow]
+
+
+We collect the boundary conditions in the two lists ``bcu`` and
+``bcp`` so that we may easily iterate over them below when we apply
+the boundary conditions. This makes it easy to add new boundary
+conditions or use this demo program to solve the Navier-Stokes
+equations on other geometries.
+
+We next define the functions and the coefficients that will be used
+below:
+
+.. code-block:: python
+
+    # Create functions
+    u0 = Function(V)
+    u1 = Function(V)
+    p1 = Function(Q)
+
+    # Define coefficients
+    k = Constant(dt)
+    f = Constant((0, 0))
+
+Note that one may use the time step ``dt`` directly in the
+form. However, by using the :py:class:`Constant
+<dolfin.functions.constant.Constant>` class, we may freely change the
+size of the time step without triggering regeneration of code.
+
+The next step is now to define the variational problems for the three
+steps of Chorin's method. We do this by defining a pair of bilinear
+and linear forms for each step:
+
+.. code-block:: python
+
+    # Tentative velocity step
+    F1 = (1/k)*inner(u - u0, v)*dx + inner(grad(u0)*u0, v)*dx + \
+         nu*inner(grad(u), grad(v))*dx - inner(f, v)*dx
+    a1 = lhs(F1)
+    L1 = rhs(F1)
+
+    # Pressure update
+    a2 = inner(grad(p), grad(q))*dx
+    L2 = -(1/k)*div(u1)*q*dx
+
+    # Velocity update
+    a3 = inner(u, v)*dx
+    L3 = inner(u1, v)*dx - k*inner(grad(p1), v)*dx
+
+Since the bilinear forms do not depend on any coefficients that change
+during time-stepping, the corresponding matrices remain constant. We
+may therefore assemble these before the time-stepping begins:
+
+.. code-block:: python
+
+    # Assemble matrices
+    A1 = assemble(a1)
+    A2 = assemble(a2)
+    A3 = assemble(a3)
+
+    # Use amg preconditioner if available
+    prec = "amg" if has_krylov_solver_preconditioner("amg") else "default"
+
+During time-stepping, we will store the solution in VTK format
+(readable by MayaVi and Paraview). We therefore create a pair of files
+that can be used to store the solution. Specifying the ``.pvd`` suffix
+signals that the solution should be stored in VTK format:
+
+.. code-block:: python
+
+    # Create files for storing solution
+    ufile = File("results/velocity.pvd")
+    pfile = File("results/pressure.pvd")
+
+The time-stepping loop is now implemented as follows:
+
+.. code-block:: python
+
+    # Time-stepping
+    t = dt
+    while t < T + DOLFIN_EPS:
+
+        # Update pressure boundary condition
+        p_in.t = t
+
+We remember to update the current time for the time-dependent pressure
+boundary value.
+
+For each of the three steps of Chorin's method, we assemble the
+right-hand side, apply boundary conditions and solve a linear
+system. Note the different use of preconditioners. Incomplete LU
+factorization is used for the computation of the tentative velocity
+and the velocity update, while algebraic multigrid is used for the
+pressure equation if available:
+
+.. code-block:: python
+
+    # Compute tentative velocity step
+    begin("Computing tentative velocity")
+    b1 = assemble(L1)
+    [bc.apply(A1, b1) for bc in bcu]
+    solve(A1, u1.vector(), b1, "gmres", "default")
+    end()
+
+    # Pressure correction
+    begin("Computing pressure correction")
+    b2 = assemble(L2)
+    [bc.apply(A2, b2) for bc in bcp]
+    solve(A2, p1.vector(), b2, "cg", prec)
+    end()
+
+    # Velocity correction
+    begin("Computing velocity correction")
+    b3 = assemble(L3)
+    [bc.apply(A3, b3) for bc in bcu]
+    solve(A3, u1.vector(), b3, "gmres", "default")
+    end()
+
+Note the use of ``begin`` and ``end``; these improve the readability
+of the output from the program by adding indentation to diagnostic
+messages.
+
+At the end of the time-stepping loop, we plot the solution, store the
+solution to file, and update values for the next time step:
+
+.. code-block:: python
+
+   # Plot solution
+   plot(p1, title="Pressure", rescale=True)
+   plot(u1, title="Velocity", rescale=True)
+
+   # Save to file
+   ufile << u1
+   pfile << p1
+
+   # Move to next time step
+   u0.assign(u1)
+   t += dt
+
+Finally, we call the ``interactive`` function to signal that the plot
+window should be kept open and allow us to interact with (zoom,
+rotate) the solution.
+
+Complete code
+-------------
+
+.. literalinclude:: demo_navier-stokes.py
+   :start-after: # Begin demo
diff --git a/demo/documented/neumann-poisson/common.txt b/demo/documented/neumann-poisson/common.txt
new file mode 100644
index 0000000..810ee6b
--- /dev/null
+++ b/demo/documented/neumann-poisson/common.txt
@@ -0,0 +1,99 @@
+This demo illustrates how to:
+
+* Solve a linear partial differential equation with Neumann boundary conditions
+* Use mixed finite element spaces
+
+The solution for  :math:`u` in this demo will look as follows:
+
+.. image:: ../neumann-poisson_u.png
+    :scale: 75 %
+
+Equation and problem definition:
+--------------------------------------
+
+
+The Poisson equation is the canonical elliptic partial differential
+equation. For a domain :math:`\Omega \subset \mathbb{R}^n` with
+boundary :math:`\partial \Omega`, the Poisson equation with particular
+boundary conditions reads:
+
+.. math::
+
+	- \nabla^{2} u &= f \quad {\rm in} \ \Omega, \\
+      \nabla u \cdot n &= g \quad {\rm on} \ \partial \Omega.
+
+Here, :math:`f` and :math:`g` are input data and :math:`n` denotes the
+outward directed boundary normal. Since only Neumann conditions are
+applied, :math:`u` is only determined up to a constant :math:`c` by
+the above equations. An additional constraint is thus required, for
+instance:
+
+.. math::
+
+	\int_{\Omega} u \, {\rm d} x = 0.
+
+This can be accomplished by introducing the constant :math:`c` as an
+additional unknown (to be sought in :math:`\mathbb{R}`) and the above
+constraint expressed via a Lagrange multiplier.
+
+We further note that a necessary condition for the existence of a
+solution to the Neumann problem is that the right-hand side :math:`f`
+satisfies
+
+.. math::
+
+	\int_{\Omega} f \, {\rm d} x = - \int_{\partial\Omega} g \, {\rm d} s.
+
+This can be seen by multiplying by :math:`1` and integrating by
+parts:
+
+.. math::
+
+	\int_{\Omega} f \, {\rm d} x = - \int_{\Omega} 1 \cdot \nabla^{2} u \, {\rm d} x
+                                     = - \int_{\partial\Omega} 1 \cdot \partial_n u \, {\rm d} s
+                                       + \int_{\Omega} \nabla 1 \cdot \nabla u \, {\rm d} x
+                                     = - \int_{\partial\Omega} g \, {\rm d} s.
+
+This condition is not satisfied by the specific right-hand side chosen
+for this test problem, which means that the partial differential
+equation is not well-posed. However, the variational problem expressed
+below is well-posed as the Lagrange multiplier introduced to satisfy
+the condition :math:`\int_{\Omega} u \, {\rm d} x = 0` *effectively
+redefines the right-hand side such that it safisfies the necessary
+condition* :math:`\int_{\Omega} f \, {\rm d} x = -
+\int_{\partial\Omega} g \, {\rm d} s`.
+
+Our variational form reads: Find :math:`(u, c) \in V \times R` such
+that
+
+.. math::
+
+
+	a((u, c), (v, d)) = L((v, d)) \quad \forall \ (v, d) \in V \times R,
+
+
+
+.. math::
+
+	a((u, c), (v, d)) &= \int_{\Omega} \nabla u \cdot \nabla v \, {\rm d} x
+						+ \int_{\Omega} cv \, {\rm d} x
+						+ \int_{\Omega} ud \, {\rm d} x, \\
+	L(v)    &= \int_{\Omega} f v \, {\rm d} x
+    	     	+ \int_{\partial\Omega} g v \, {\rm d} s.
+
+:math:`V` is a suitable function space containing :math:`u` and
+:math:`v`, and :math:`R` is the space of real numbers.
+
+The expression :math:`a(\cdot, \cdot)` is the bilinear form and
+:math:`L(\cdot)` is the linear form.
+
+Note that the above variational problem may alternatively be expressed
+in terms of the modified (and consistent) right-hand side
+:math:`\tilde{f} = f - c`.
+
+In this demo we shall consider the following definitions of the domain
+and input functions:
+
+* :math:`\Omega = [0, 1] \times [0, 1]` (a unit square)
+* :math:`g = - \sin(5x)` (normal derivative)
+* :math:`f = 10\exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)` (source term)
diff --git a/demo/documented/neumann-poisson/cpp/CMakeLists.txt b/demo/documented/neumann-poisson/cpp/CMakeLists.txt
new file mode 100644
index 0000000..a6b925d
--- /dev/null
+++ b/demo/documented/neumann-poisson/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_neumann-poisson)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/neumann-poisson/cpp/Poisson.h b/demo/documented/neumann-poisson/cpp/Poisson.h
new file mode 100644
index 0000000..72eb5c3
--- /dev/null
+++ b/demo/documented/neumann-poisson/cpp/Poisson.h
@@ -0,0 +1,4254 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None), **{'value_shape': (2,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[1][1] = \
+      {{0.0}};
+      
+      static const double dmats1[1][1] = \
+      {{0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[1][1] = \
+      {{1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[1][1] = \
+      {{1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 1; t++)
+        {
+          for (unsigned int u = 0; u < 1; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              for (unsigned int tu = 0; tu < 1; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            for (unsigned int u = 0; u < 1; u++)
+            {
+              for (unsigned int tu = 0; tu < 1; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          for (unsigned int t = 0; t < 1; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[3] = dof_values[3];
+    vertex_values[5] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None), **{'value_shape': (2,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset;
+    offset += 1;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 3;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 14
+    // Total number of operations (multiply-add pairs):                  25
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    const double G1_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G1_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G1_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G1_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    const double G2_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.5*G1_0_0 + 0.5*G1_0_1 + 0.5*G1_1_0 + 0.5*G1_1_1;
+    A[1] = -0.5*G1_0_0 - 0.5*G1_1_0;
+    A[2] = -0.5*G1_0_1 - 0.5*G1_1_1;
+    A[3] = 0.166666666666667*G2_;
+    A[4] = -0.5*G1_0_0 - 0.5*G1_0_1;
+    A[5] = 0.5*G1_0_0;
+    A[6] = 0.5*G1_0_1;
+    A[7] = 0.166666666666667*G2_;
+    A[8] = -0.5*G1_1_0 - 0.5*G1_1_1;
+    A[9] = 0.5*G1_1_0;
+    A[10] = 0.5*G1_1_1;
+    A[11] = 0.166666666666667*G2_;
+    A[12] = 0.166666666666667*G0_;
+    A[13] = 0.166666666666667*G0_;
+    A[14] = 0.166666666666667*G0_;
+    A[15] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+    A[3] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_1_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_1_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 9
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    const double G0_2 = det*w[1][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.333333333333333*G0_1 + 0.166666666666667*G0_2;
+      A[2] = 0.166666666666667*G0_1 + 0.333333333333333*G0_2;
+      A[3] = 0.0;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_2;
+      A[1] = 0.0;
+      A[2] = 0.166666666666667*G0_0 + 0.333333333333333*G0_2;
+      A[3] = 0.0;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_1;
+      A[1] = 0.166666666666667*G0_0 + 0.333333333333333*G0_1;
+      A[2] = 0.0;
+      A[3] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "e6cecd0b5d1d95eb7fcb61458ecc05c3ed041c4fc98d976931a545c7ca5bc879241bc527cc05473ecfb01c3cbb71d44d37345694f637cfcb82e4cb118937b6d5";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "a15e4974716541263fa1d36f9a0dc870f6da624bd7daed8f4c2c3f1ef9c6a480b0f1595b9c69dc2713bc5980cab5b5093a1a33a6949194e6f046f46b28e0a398";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new poisson_exterior_facet_integral_1_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_L_FunctionSpace_2;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/neumann-poisson/cpp/Poisson.ufl b/demo/documented/neumann-poisson/cpp/Poisson.ufl
new file mode 100644
index 0000000..bd05f7b
--- /dev/null
+++ b/demo/documented/neumann-poisson/cpp/Poisson.ufl
@@ -0,0 +1,36 @@
+# Copyright (C) 2005-2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl.
+
+V = FiniteElement("Lagrange", triangle, 1)
+R = FiniteElement("R", triangle, 0)
+element = V * R
+
+(u, c) = TrialFunctions(element)
+(v, d) = TestFunctions(element)
+f = Coefficient(V)
+g = Coefficient(V)
+
+a = (inner(grad(u), grad(v)) + c*v + u*d)*dx
+L = f*v*dx + g*v*ds
diff --git a/demo/documented/neumann-poisson/cpp/compile.log b/demo/documented/neumann-poisson/cpp/compile.log
new file mode 100644
index 0000000..502ce47
--- /dev/null
+++ b/demo/documented/neumann-poisson/cpp/compile.log
@@ -0,0 +1,346 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Mixed<CG1(?), R0(?)>'
+  Unique sub elements:    'Mixed<CG1(?), R0(?)>, CG1(?), R0(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, g]'
+  Unique elements:        'Mixed<CG1(?), R0(?)>, CG1(?)'
+  Unique sub elements:    'Mixed<CG1(?), R0(?)>, CG1(?), R0(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0342889 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  16 entries computed in 0.0011 seconds
+  Shape of reference tensor: (4, 4)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  64 entries computed in 0.00104 seconds
+  Shape of reference tensor: (4, 4, 2, 2)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  16 entries computed in 0.000784 seconds
+  Shape of reference tensor: (4, 4)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  12 entries computed in 0.00107 seconds
+  Shape of reference tensor: (4, 3)
+  Primary multi index:   rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  12 entries computed in 0.00149 seconds
+  Shape of reference tensor: (4, 3)
+  Primary multi index:   rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  12 entries computed in 0.00148 seconds
+  Shape of reference tensor: (4, 3)
+  Primary multi index:   rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  12 entries computed in 0.00129 seconds
+  Shape of reference tensor: (4, 3)
+  Primary multi index:   rank = 1 dims = [4] indices = [[0], [1], [2], [3]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0224471 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000337839 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.09307 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000836134 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.00103307 seconds.
+
+FFC finished in 0.152407 seconds.
diff --git a/demo/documented/neumann-poisson/cpp/documentation.rst b/demo/documented/neumann-poisson/cpp/documentation.rst
new file mode 100644
index 0000000..2279d16
--- /dev/null
+++ b/demo/documented/neumann-poisson/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the Neumann-Poisson demo from DOLFIN.
+
+.. _demo_pde_neumann-poisson_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/neumann-poisson/cpp/main.cpp b/demo/documented/neumann-poisson/cpp/main.cpp
new file mode 100644
index 0000000..f373adc
--- /dev/null
+++ b/demo/documented/neumann-poisson/cpp/main.cpp
@@ -0,0 +1,98 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2011
+//
+// First added:  2010
+// Last changed: 2012-11-12
+//
+// This demo program illustrates how to solve Poisson's equation
+//
+//     - div grad u(x, y) = f(x, y)
+//
+// on the unit square with pure Neumann boundary conditions:
+//
+//     du/dn(x, y) = -sin(5*x)
+//
+// and source f given by
+//
+//     f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+//
+// Since only Neumann conditions are applied, u is only determined up to
+// a constant c by the above equations. An addition constraint is thus
+// required, for instance
+//
+//   \int u = 0
+//
+// This can be accomplished by introducing the constant c as an
+// additional unknown (to be sought in the space of real numbers)
+// and the above constraint.
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+// Source term (right-hand side)
+class Source : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    double dx = x[0] - 0.5;
+    double dy = x[1] - 0.5;
+    values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+  }
+};
+
+// Boundary flux (Neumann boundary condition)
+class Flux : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = -sin(5*x[0]);
+  }
+};
+
+int main()
+{
+  // Create mesh and function space
+  UnitSquareMesh mesh(64, 64);
+  Poisson::FunctionSpace V(mesh);
+
+  // Define variational problem
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  Source f;
+  Flux g;
+  L.f = f;
+  L.g = g;
+  Function w(V);
+  LinearVariationalProblem problem(a, L, w);
+
+  // Compute solution
+  LinearVariationalSolver solver(problem);
+  solver.solve();
+
+  // Extract subfunction
+  Function u = w[0];
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/neumann-poisson/neumann-poisson_u.png b/demo/documented/neumann-poisson/neumann-poisson_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..292e16cfd7fe60e6dab562d166335b7669ac7454
GIT binary patch
literal 42812
zcmeFXRa9JE)FoQDJ3)gx!Civ{4esvlF2M;9+}+)S6I_A@cMWdA-JyVc`2OxO?qfgo
zQ@_<Xb!4x#=aN0=3RjeuL_s7#1c5*((o$l|AP}S`2m}!a4+&g((FmUefk;8pVj`-Z
zStp&|9R_OOs9!stNnw*$kkv|Kuuwc8lX_qy46%~KR+UEWN>u;E8~3C%$-~(NdSYIF
zSJSa(w7y)--3vNU)e&x0jdw{P_1ML<7b%m1mTd`ls%5q4zW(E_x8b5#O_O^5>?6A5
zefn!r+uPq`p&|Fao{N<oF+?<95l`Lq*bDUji}t4sHU<uG(Wp#GOp_KHF(h9C!w9&J
z{ewU}_`iFt|KAP&&kz4M@lb1IG7#~BCfju;$NQ{x**tSRi}!jrQNeFFUNYxjtN*Qr
zzqpu8Diaay+w!EJ`yjr>N&P4j^S5Cc^U0i-*ZXe&+oSnOjnZSnu=K@Sym!Q3Fw_|j
zM0DQ$wMmrY;ytPDb6>G*Za-@~247F+vYHI4Y3SWXXmo6+=6b)q+@Axl>wa$Ue)jOc
z_h<!M2t6;qKA-zvk8^jQ+BvK^biWXL9pt-A@a~&2doQDKuU^cgcHQv0w|)MO1bnQv
zXB+Kx6Ybwv`gK2+g6D7$+UJ(%v-VuaUWD$eRf-s%?M45WMG}ATW#HBH^fYegfw+c&
z@2^zwE{)K#RcW?7?_SdW`k_}Cc`p#5ON!I?FQfW*^$tEegiw2LSIlqqfKTLPWx)w9
z%q^Rcpf~X3o517LvHpEqVeDtGyo-+O3BbIy9Fx*xni0wOs3xQ*20k}msWF+(Zjt9R
zk;SX<`EeJx`$?6iTEFwj_uPAffBiBBSe)@DI{Sw2{aX8J(~9t8(~7<K{hEhRs{Epk
zZGANykQfj{EW(pNX+SP{9aq7PG%uSIf?@@(!fa&+3&bPOy5C;kEO{<|LrwDRM5T6~
zm^t745qiC(&P1;7yYIU1)aX1?n=GC!ccK;y8kr<|^Ny%Z`(JkUjDhrT3UE=99NG>`
z{9M`8e`;R7dy4<8WryVLlH?q)%VW)LG2J4E*J2{ern=QUlCg=j0H56)IqPc4BsMxG
zCdYF-e6nr!7T=735m@O~Z*K^a$C6Pfp+m=I_PNi#zW1rys?#4m;63kv`FxX)Ca3j|
zm(Y*SLnq4(3V`nqi4HmP!)o7iAp98kSB>xK82hBpu#En82)p?hU>5s?;Qi{b*V#KT
z$U;9}UG$;(-&PuA|Agd5O|ohP9^_JW)q~sIczf9}0B_^&Uvb(jfbj6~(|txpl0T97
z-b{DiuY3Qu50&awPnWU&;1P|k8Khib^#EEPx}MJn2?<?FHyaLaQUkcN)k(IJvXjXf
z0E<vQV5Yo(5G_gO;9pYfX|F!iXg|pFYM2JXvm=V5{_XX7!(+o&L)U5Gr&dFbOlddr
z+Rf{?2r}SVQKO)Kbsf83w+lK3Zu4qTdy9ZOQgrNFAOB@4d>g4WcsUwn?)J&^v9+}Y
z&?_JONuwG7-NwVz7c@Pmfe$P8?WZm$u7Z;PRS4U%gSN9FidfxR!yYI!fz6P2Nd5VI
zS63Lr7a@fbSeoN?RH0Vc(fho9--YIP5d@fAlloJ$ZhI0ytODO5<?_pPtRIKR+3Fu+
zZ(BB`&oA=aq;uMZ?;!+XvNw|aUb`|lZDM%;rDePSJ&XZ>a8M9Q?0r)AzV`q?6Zynk
z{}6ecG|tM`KSvsXjbFi!+^dd#-s{&ndhW}6XYJ>o_p@Bw|5}xPs%|l!mE(RHR`9!O
zTkJer_deHaw464@5%`y8l4D+~fc0Wgsut@;bC-w|2@iy^QQsg%tN<GypVw9h?q>kd
zfaB)DkJq@2+DV;WP-5_gr+<It0x{eDdRw#M_k8-E7mPxQ?r{AtaWS!<Ue5jfpHG|p
zE4s4S{LJ3pzh9aP@8A6&un>>27U0MkNd8x)P5v)PL)?DcZq1_oPubP9*pyqmg&*P2
zevde^|8e>MuP7(Qz5^8T82M$h6m1bA0$6gd%RmMHAN4g>RKwI}M$JVNI_w<Q|NdzB
zQ_((n)?(;7pKZcG(n5CPEaqfn1oh>8A3eD=fBBrmL`rC^bE1MW(eVUpPYR~(+;g6<
zi1w>?dOjddLjUU525yAabh}@w*xP9~5I{`l#Y1L+x`G4klrhWJMX2SoQ2D*yT178s
zUEa|VPbdSe!<LoN{QV#MZd2F2`#<456r_0;j%c8MLlCk#%g$A|&rass;)i3;mJk%^
zj^Va9Ta{u3z*2)iwfm@O-@9m&T;JIdf5JcTp3nl{5g<K&!%yX(Phok{9oAmuT<UbQ
zwpB~&(F*7#y@!QDc=CPB+Feay<=F>GQcX%y2;`_V=p@WCH&upWZUeTF;5D@B-|4-u
z0q?nn1tvxBbKBK=UGf_jDr|Jwcp^kp0G@Dx@QmJ#;g%F+KqeFZX`o;P5>hwzuLJjd
zMa^@^;}3<+`mBiPtR_WjfgrrjKLb%|h#WD{L54r2TOMboHO^S>lUF8nJTz1^H(2Y4
z8QS!e03?ezT|XQ!?i4~Jem=%$cnsXk;SKqb5GiVzA0b+18mz{15Zk4qtLaG(zA=z2
zX=oqcU}J5q1u%l=F5tTHFfJoO^0d{0uE~;h;!G_-E#_*e(!=YljKGQt?mGvUp8k`&
z5Bb0a{a=gb77pjn^V<1I5_p6sJ!*$|47~{|K;KGXI%ppGYd?rbm6YK74Nehcz|LDm
z0uqvnp)YCg70~^CiHPjF`WLDmg#|^#mv`Rt6JHJ5v8IQ4w~htbl{Cfo2HBik^MUqv
zC!Q>V@Z=Q<C=Ut(*Y{s^XjcvJnjlSnleK+}6ks2Ipf2ilUi_%U=@tFlYH=pgrA^xa
z-}CVilYA08hfvhWU3EPF;)$)<F|5~M!~JZF<^wJcfk2a|_U+O_cc;6v5dcUQv6g=s
zA&dGAire%2tig99j$#MTq%4qASjSIRBVkjB0T+f>6#p)iN@dTMV=4}B7A?koSHcHE
zLWJMpoJOtdyVhG-qX(ZSlcKQI{So!c+39g0agi3*iA*_)YKo{GW9ht$BDKH*Ea=*Q
z-TiFkHLs;MkM<o#%sglQhT!%^M(xW@PxxO5uF$n@u+t6bIhd45ePw!bnV=ixz-eM4
zc<yM;%;EMiL-4-cepg{jEeNFPHs6T3RddP?gP~q4n_oM<-32#T)8RCYMxrS@Hdn4l
z5x~a+A-Hfy3K<>eBOZ=ViY{EVRak(YOd4|9Up=y!Lz>S)AX!lm$M-A4`o^mC*eTPL
z65Y@9e7o|^?WTEMIdTHq+AJODWqLQ^&|+dYS`I?dn9e|$=Epr_dKQQZVn+Lvl49oY
zr|DV~U+Wd%oyEXm&_Wu<lHomhOzFZ1VqVqk#+0h)UC*Z>$R_~kG|?1+mfu$Op&1U>
z;IdQvUXVjRs=7~`TMx4>hPs|Mm``FzHSg&zEKE3sqU=M0L{cy!W%SUXqjO1?3^7m#
zE!#oATds7F@I8HjbfQ=26CBbz806sZFzwNGZ$!l<<8}ZKO8nteK=Hs8$QVR^MKXj*
z%(nv5V6p5?D|ZL(F|qLRO%KDBE13FvRlr`8!+D=}?`QGXUdhO}FKAJrlK5GnTdRjH
zq*o%sn^+s{k=jvAVZ=Nb{3FP^y55mE2wot6D^EUfmku5M>ke(WrGhIcEg4eKomzZ^
zR5J1Fx_FIuLIQ?wJ_1uVugzKAKuBK%$=Xf9;mMhrH`w?;xYZi%oQ2{Tc+KM93p9F)
zsgH8CE?`LYYKp;#ntYbF%Rk{*h^Ol{q+9r{)O0SdDc>0`Fdr6A+7qs*2iaz7N)%Po
z|8K>4!T;Oo>YKVQPtt!lnj{`2(FTuaPPFX*k%6awNSjXorQ+jB1VKLJ_2!yKBwDYZ
zA@Olj0Cviy$r{!Gag<;_o@Q+ySyXdpxIaQH_rT=7do1I*odz2hmFRymcz+0Y_GNVD
z=NXLlzfdlc6=Pw`I|f5xRY4_};fQ0$W#P;0v@9wF<PYMR1=w_02q7o?knx{I1|v^y
z!hhKN68;`roDi&b-HO|K)hS7aH|X>RqNR3gXCgF3*Kt-d<;@czFgySOv>JbnHTsv;
zX~@_4jDQ19pHRJz=v!GNW{wV9xSH#rJy*Ijo+{k7@sOHH3mN|1@Rw@}319P$>)`XT
zRrj;TwaMPLf$lZdDzS&Z+3$4}1;1ISW%rod|E3xaSB5Vy0joSwK`jr=>ih4tTYd=6
zk<hBiF+*Q9##QNnYYY|VErGJoM(%3`DzV3itjeLx5+)Zb=&)Zy&<wneu<=dKY0EM1
zy@U$rfpZCko)ox!i;jh%j{=GH{?PyR!kK^)7L2r+y2Xi~#uF9<x%SJ89~s=}MRU%_
zP9GPL;C%g(0tw&T#RuaRY`tTqdi0@%1x8nlz)TeB<>uS9LN2#|50bA2((%V*C=7K`
z-~8GxljR^8TwNcQFiE})Lq&&hbW+){y~MC71s063aCl_J$%IvT;SF}vRy#;jJ0+Dw
z!+>%q3YbyXglplnsktxih2_=#D6V3HIt4J|j&$E3KO^;MxgbC4=eq|lsZFQ3hd)F(
zFq;k%ep>6g=q&_H)AV;bhLY*_>HA}^)0zY_K3e?#n<%~oD*RhfA#pX>l}OQOq?!U}
z0UC4!kF~5T4Z_kIAr0%rDC2}UAmG3fY=ua)EpE&aAw8;x-u?HfOFJDD6XjiQh_nE&
zsijF(dam#ED2l$W+2&X{m?3wlq2U$ye)RuY%5(n|o9nUjCv3`XH>R_?FkIiqa}`6b
zj7*iTB-ao`Attt3`Ir<O>GjJefhloK=7bg_F#UOmnbM8hdOajkz=)-AM%EKYy^oZ2
z2Db08RxQnXleWc7MX4FRfvHD>ipu<Tq8W$nqGY?b7bzSl#73Qc<3ep$FSx`DZU?5(
zlLmRmNxz?dkru?H39quJwV`%?I}zp(O+zm%8xp|TqoIuO6Ae%NEqlO;I4GO>(*V-(
z@2C|X4)qt=6KE@CRN>$RM4=zA>`qn^N=J;ua1u2O(54&mGy&b$K*sB6ZK=KZp8wqp
zG2|A0L&s_F&Hp8x`|V()8VaMmDuI?KJZ#zpPQhVH3ZI->Q<1h#+)%q9Km8Mb{g6T>
zK7Jr_{p956n_CYT8b?U6ktVXW>9P(b{W0z-0$cY|f-Q~*pZMo4xCxHKM~v_hka?&3
znK%7_qe;Ksy)9q%+G)#a#&8JG+Vwttcd35u7t-~nc9ZZnJvM{tUyV)^qZlXHMWAY}
zR#85b`XW62374R-mYIqE-#AkZr*&YVap%~liIxvZ3?Ag_+dodJ30xe|I4Kv4?0#Pz
z)4@b$gtAd-h)JTe<#5`ZW$rVlsabs>#7$Yd-#$FCUrc}d{9j9<dEavRdY<EQYvAWF
zki16y)ahx&Pemx5XqiMZ>R})92y%KzpL4++Uk)CWZu=?wRr{b!OLF`GeXyr1vN2Al
zVpa0BfMyOZnl(U*);8f&fH^OrT(bimOFdfhW~~3YM+6c#^{Vq5PzTRyn1Fh^z`lCX
zckcH(qTqKfxlt@XmcTF}K(7AzIG~G0%`c82xVm9zGN+F=10{dTR+N&kBwSQSQD;YI
zrog5tvctUDLd<c>!u*#lwi;@p%{7%oRe7L-Ld)xHH)nU;iz{h1X6``V%YJUx8+g`W
ziKK)@Pm?69_I-ohel(=|9l6K|N%zkwarY3+EE^d!%D5t9JpGa-&6miD^MTEP_ojx3
z%IVLiWi18?@L-P><&Ms)BEF#ua*#~3VR}cRQlZ=QM@x>})Ppir4LutpiGK|#!>XKE
zk0G;%{layO$c7NU+@r3naoEQRx29Jqbp0LW;A=z1{;#_jKpOZxOKHNjoWW`Mx`SuA
z!3Xq44BALh!g}_CSklCh@wQmh)EvHXpr3AibgXIK2_F{Ida%BFXCWu(?Gy9l(+B4(
zcM~ZLTGKfWrdX)NOSXNEGMkG0#YQ#Pm&v9<Rw;;ses98(6~K5)PM_%aPrpwuu;)n;
z@#U@=7jhtk5X$Rm-c8@~{WzLt-*NrM|F7-2x*(=JF;5XElP0hob?z{NA)5$BnDWz*
zloyGI9%3jNx~862S3Lp2eLmcTW{X_Q!A}@&je7rv-nHmu8QheyBxbV1JC&0W7#G|2
z)amT+M%Z$GB5dTbvvvg$`E2HP{P&&bonV-!bi~=9V?O~CzV^)Ph+G9G1^^2sXp5`f
zw@&*XSE2*LL{>2(Z4|>Q2#szAW3HMVb>NJt%?axA6n{*W(y|((e4H;7UbI>l#XTwO
zIOq~av%38FxRiXm#1X?0Ll7F0In^zOfsBik^0yTfb&<hCa7=LKDofHrGvq;^l`t=x
z@u=*+@w`6TTy>F-g7Y49wVOxY)x5_m7JAPP8XlRTRirmJqJS<6#Xkge6w|C@y)k;Y
zB1NL1aa0ZS(-vCj{Zd*#2<Am|D0&=o*wtvrN-&N@r7wo3Kf{l;(7>!MS-|KRBmH$5
zv~F3r%_3pzCZqa6p>TAunf*}(Dw5%s`)|)t9eID5bZKtcpJ-y5pL<2OVE&Xczhrj5
zE@-X6tAzShwY+GW$nqt$e2|Dq3RE2I*QO>9SKi8@TZqRXEcsU>6M)3$I9W^0-vpye
z=}3)Zk~oETb@T0qB2qepIxcRsW3pxd3d2TME$HJu3j!)k9b7l4ZKAA&W-sBIp8ev3
zDe@7tsT<CBN(i<qtlJfZBzaQM!=gXX76afsd2jqW0$PsFY=nFdEvj4Z36A*AylbHc
zSQa2D2xe!3ti&LhM8@U<y{C1>h~V$E5XhIB*n7kj^!}{M(9%%))}B-Sm1v#E#1y+_
z4YC#Fdf^Lh{&Utz0qRevGc+ps8_DF7xPb8?vl#Jnw880G5yD=F{=&oE6kgL85bLd!
zO{<d6ng-m&SlH8gb|ZsKvc9@*i_!LmfmnCj3{n(ZG!7y&d{;ZTO~H4EU1P&LJ53Nl
zHj^dLD%fq_>gH&lz0mRjX`BdNGlLZ3=wj9rKhg5z%5EUzPb+`Z!|N2wr8*|hstNI(
z9LMMQDlw?v9&4`B=5fKisEqxvXZtog#xvE+<_%VJNA1g8IwB_DGF&-Ak3df$;?3pu
z{5EG04!oVZKM2uNKDRBqx;Jn5dpiHuEM9<jn3=&RG~Jh41WxzFSgdVb6eSo`?2Ne4
z#dAY?sb%uclpLG0eHKysLweyy>cJ$CS-Ym49M>52#0hKCWF-?EU5%M$vzgbE2~<(V
z+d5eE(in}YK_2i@NGWWv@N5M8=G-p&{qYGz(accXOkXwwnzQ_brTb8zfqo<fh-J^u
zPJ2X)Z+jvB9`jenmcg1G-zbF9T&HML5YG7YSfagLDJUb0o$$oxWh8_rGbD#Va$((y
zKHp^p$G#0=*@%cy5=?==ljbc72($4;Io$pgWij2boq_!gEi1-A3*wAO&=FlTlfoGu
z{tUVX(}mK_4@w41x4ckJ&5h^ubNMBfo}g%pc6#Gbt;8jYsEv&p>fY5L_3&&407ZRP
zwE3MOv=!h1_x&NcjKA0YwvV#PelM)B8AJ11b~VWR0{S=6eZOEnO~4bvO{d>jw)fF5
zHm6uWNacoH(0v?qL^y&~1m1!74c3A8c>S^WQB}rAV+k~tDfZh=O!Z0NkDrfz`ic00
zg%(F4Sz&4A7Uc-kM_LIyl$BpHKM<&3F{(_?g=T$0BMOLdG}QPZshwU$VXtt{=T(ic
zPFzyrLeb>A+>E2|zTE5fEFen=P>fD9(ln>7`#G6*P0M5H?C&I&B=NUhjU2aWaa@3a
z($940dIUJ9OMnQp+dKgHS&2kPfJyoWWB&Pm)#V=G9mlyhe9k-XyLJ;~a@IB%qo!P6
z)18su8OR(sA8=)^(DiX{VT@I<NGJ6umdc-lv@)6q%$1Z)nG%e7T_d(%C<uK;7zo)$
zkYzg$lp)p3SncsJ7)Wv2Phjj&*|OnMM>{2l1DeD+#B?IhrqQnYrcAyyT0|LdOOM3j
zMmO>wYO`ZSTdp_3UiXmJUdC4xz3Rvg*)do5?hXHPT(>21oVx#y$nWxrw$1NI06iVn
z-2HM2_tEjU9QWEy>!j})KmiU0!Vw>QKotUC095ul6v=}yP{yH9-$`JzXP4aP)nS@k
zpY3p(Gk~Pk(Eqjv5aPw7OzpM+BRA;^-tgO|n!HKc|Nhea(EUFI+kSBIs6F^WL&$$G
zdl3slk6BmB5FQs1$=z6kgYRT%El}R!40q1%Uo{lNB5|$WR>#CzV1^d_0i;!ri)ERN
zRPWW<)>d8{ViW-(oX~!e#KZ;j-z!#Pn-RHZDd=#qIHh#)fpmIVd9nLD{8J}I>V1`r
zr$bA}{eaX<AgEp!q8DYofc5J8zucx8_yG*40}~aR;LQ{S+{fC<&(B%DcgqTH3)Sss
zPe&TvPur2qDVDn`3W9Ez+XIof%y)<YEo}3Cf5QZy&B$!};~umBqn1Us+ezJ@ufye~
zIec7PO|FMC7JRR_f$*aMjVIvkbJNi+wA(18>9rF56Ui!JNhlpbR-ngv=7cI*!7fJt
zB22D+k@PETFr+oo9)eW9wg^7ykvDtX2-!k6!~+>=viCT#1im^JsPgvLIn@!2G25?`
zPFo71RW~GShm8f!2J0mn@232=cy_JNc7#t%Amb8S>eJ|3SuE-Xi)wa5>RZfb3J1hg
z{ichV=sDSuvA2iVw-&=5NDC2AjnCdETqfOzVrJj+^JltA?M|;-KtphU*a}T#-1QnF
z3te>{Wz^par^$KfLGxqrzB?&Bx(7hv3ETlt)`rZyH&b6+kO*<;HA~(}Md#6b)YnaE
zju|YB!o~jf@EpFp#l7EU6gPtGg%qw+v1~)CYeDdM5DI0l<lBCbMRcCQ#K=uygbF`r
z#mm)x1*V6GxgpqUmFmn+_ZS+F`W=Wc@FjrmEO8+eEO(Lq79t=0_EjYopf8ZyR@KE|
zTQ#&P)nq`9W7}Rn=8k6zNVepO5*xAX<mzUDnHcglvsq*w7xfE<=l-ns@URnGqu=QT
zs31^#F8{{90p$5RCl4e5^DC|QJOI$vY#yH<HiH0ey!f0+rwREtGnpvwJ-|ROd7pO{
zn?7Fc)p*TU<_u7Q$px8?5sQJ7uEh^3ZvXQ<q36CJ`EMjkJh2EB#qgcW1k1h_L`&F&
zSPBP_pO7!KYqM5H7sI52Gkm@UVi++H$Wi2TAj5{|&9UC(ql#mUkZFWoF;ctB4HK;N
z((k~>31=$0bv9DCinB%q>S@?AUCo)}A5FPd7;u*Bu~X_nPbj9iN>eE3&XFlwB0GPK
zJ{X!44W2<~>a^Xmc)c6nczb=|5Tu>`{w~=#c4vQiI4>79mynPEjLpRDei#5zQ&U%W
zJsk->Hwbwj>uel-5L?Lxw5<m7@xQhW<9DkrlYmGC2pFCrj7>}1VH7c*i|y-fd&wH_
z!jaC#(*j*-R)SuX0!cSs{vnus5AR)a5`gNsRgl;BI*y)$n41mbf%Hc4%+KM24djEp
zJ(@Z8iepS+Bo^^N8Nn<xbWLHFI(hsa_8UJ<h*=q#N|UX?yloeo<34{$qKeZXSq|%z
zOmt*{Sxv}bL<CxytCNZyzH~r|Ly2*BqWgqXwvOGdDC#!3(@RRw`LiAuEc+P*XMTy_
zygFgk-V-tls=($=bC(-M{11=yZ~GJc=K^~i@?su<3M9{edLtwMwvF5E*^5B)Q?K2<
zVVvt3K=;K}YPaqPAW;-e`rS1Edcz+8_U{_r2A~^~JPt{|JFl*;4xioCY6<{^2M{RF
z-ESIt_BG$eZR|TP2ZxiupPaT5nY~L&1#mw$Egubsykn#^guUwljX9g&!)}8x@_)|)
z49jts^DBN%FC{Ni!QF%of1pUgytWB%P$W1Kyw}?!V3lqQ@f*-{!wWB(-9=3H%76(Z
zPM{$3<H3j-p-V&!Z&J~lZ@-VxOyKTK+_x8sTxiU1lej57!;Jz6yK#%E0jBsigkd(m
z1QLv`{lt<Xs=VZ-ar`(h_i7E5tu$wrG-Y2%_*7jWE68xmr*5$i05ZoU|9OXaB#vF@
z?Sg~XY$hNdI??&R92)>K;vZ(cwi_UZHUP^vUd}u=e6GiZUJez6o~C2JhP=DuT|czQ
z^?g0eeLZYDuI2~oWHXRHxI4B`0Lk&7tv$mc7LW*fYkqGNI(*)Ve5>94msvL3qUb6Z
zKO~|M$MS12<mB28y)q12dNKX#I$<c)QavSHG?F1XKsnBzImaYFJxL71DL)5(l8i}B
z00VRee_}JP38G)3P)h8*KIb6A&WT{ekE(CxoWL2%xFw+u@8zm0DBm2d_;yfU-Z@-=
zt`eL;O%Q9STJ^R7B`@UIw-_?1gu&+r-XS?}Kkowa+U5p$d_zDjJCdpGAQ(&Db2AVQ
z)Nxzoux4FZ)dk*T_HG#m#HqVwi`<Q;s*R_W?w1t{SA@5#Yb&*2$+0w13><)3R|p^A
zUIlM4`&bQ+a}&Pt&fhv#5JL3CW`w9P6!deDE3pd>W3t!!i0J9cB_bssNoby=s6$Ld
zwh@=3N3j;;sq)t|W4H_J8&oAOL^aMZ3Gh$h$AERNQ(VcYM+|vvxR$2vDsbo%>DZTK
zD#@a<pvrOiqWb+&B*`_@6C!Z}4n}<wu=fNWE$58DThB}z_U)~c$13bqnq5ARKsI~0
z&VAGU=obTocgMp3vp#V3ZpGn^BlGE9(SBF5?l=73RMg&+y#MK<pB<pe0UGF%aU`QX
zfDAxJ<<xk1ua7kTS2XYYpEFJ6<2H^nS@!DEuax;2&@yBTLwe^PF7{t98P8t~A{{!G
z3l!%_hwPma)0-@K;TIH$oF;7_{RALDhQ_ee<abbltj}%iB}vo_JTN$)`*?9AW{^3c
zVVm+F(Q3hnk@V9GQ3g*4&1#s!I5|6OO6M3H_97v^?r}PVRzj9#C%kKv<XY2%XZXLU
zXaDuj^<sy}a%oRcMW13vpEgEkI~my6C`M}%_HOw68&9<zGFL{3_y!mUH!>i`YbN?~
zG++5{v4h`rCe$7f0u5PifXojbbO1}BMq`BWI}S$S8;fM~y8IIkS?u`7DfBq3kaPR%
z=a+W{CP>rgg^_uECjia=l_c>}4k5w_0a+d<NkCOuMMfYhaXu)_(Fi}0m9&T!TB3gw
zVa+`M3yw2Yp=RzY<5Z(Uets|h*;j1IY&ie=V&06t8RZXhT7u%1w0X<H+ZbXUA2^UL
zRFB$5-B&af8+9$4DH*G|Y7a8#W@!=lWbKq$J}S47K?#;wab?d#rRug_B*<{7GOYq=
zZCdv_uB>je&IA9osaXTcxXbt89iY%3Msu%wUJl@*B{AzX*{15bL%f%DpyurX0}zB|
z7gYeCvG7yty#cP&zpVh;Trkik5tqHUzb^?<k+=BoTBRYlP3O-4p6>c>pYE&q8CH;4
z@+gB%KY2vl@+%J4QS`Ry-6=%e;KY#X=bo{w{*;Nc9=?zG7&wo{;C{zI_##gnx#p=s
zLq^L|K~CiTbj+WS6IMDuOl=ZHRo0gIzur(ZLng{E7SgkNn@nZdJIu^}o95-jYt;HN
z_lzQLcjRJCv}_wRQ%lD;AN64~VH79lHk}(tKo8eX9CC1N)%;gO6u1nUq}BXAi9mB-
z7wdacRv6<9w+{4ZZPxSj%hUxM&z&33q5cn{9Wi5lXhI#1TfOfcFbL4V*?~a=fYtDA
z9p4*G_1^^g-W{P=lk*!u-F-Wn-*WK2=z;4DK|$T4V88|$g8%B^zMQs3I<&wfypf^`
zAw>j2cSJ3T(zZEj$D-0HOLX}9_77OX4hSzmACni%^>vBB|0_dVY4XHJioV1W#F1F@
z#_X?<DY4?}_Bli^>7Q~#E;{&d$(cc@pz-mPQry4*)TX;k<o!=l?2c{3eTN{b+RAx6
zEXgWWb96#Vt=#gH*bT~<x=eW&?jW5U|6RD)rzF<4or~YiIqsW*NI9cH950%!&U=9F
z|I2(l!z6~+yfoXrZ6}5wNOA>$41bbgQ@sqx{6!POn_~+8PqQ1ZryE@_cPp`g_zs|c
z)&K3q;Gq}Sd?KqA=x%`n0`~7Uj}1ZpS1=7Qd+}ZsfTvR!b?)x{-|hkZdxN|Caa@jT
z8Tz+LtY8x`0`Laj7xLfd-vC}V1|-^NB;a+Z{3o@h!wK(`Fq4*G1MT+tYcC-`7(a)^
zKQy>N8vQ}Ev$)!Jz`h@C;1PL25}YpZu@NgYsRa4&wEkgqK}=n0|Fk8S(UcDAC%bag
z9A>Gyo2Idat}a^gzh<P}iU;E@BgRI2OZN25=d{IQ!bs6dzNsnuT!X)8XAR}ZI#fwO
zXu<QQO*?^W((!C6AqmvInf+lwMx4DN(|K6*I?N)TS#*vpqqVq90x!RVxN0qDfFq)*
ztLsfK60;9b7n=TBS3X|vGix_m0`a16<P3fIj<s+FpKahc^loL-n)?a>Eif>taQ#sP
z^gi{`PxJZmw#NSj=%JU~7WIG`njxW=Ss@~P{7Xb&uw)X4N!RnRICb4+Qt*AW07LTQ
zCD58Edfwo_52tAU(R^4m(7#E)j^nKv{VJa}nUvfA-90W^D&in%Z0c6R0Y~!d1+8Ln
zW0s;q6e{JXMoxMb@dyHMx?E`vt3Mg27)p5(-tulKk{BP_`l)K?yy?g$e|fahahl;B
z<bfAWzncD|klhwovi}6#fH<}ztsC|+IYX^vxri`5ZBCz7oHD_t92*CQgOiA@X~X_3
z5H1IRiA(MtP%Nn5d00RUBpc}Me!8M=K-Ib7HsIP&`QE;>>o6^LaobNx%Q3GSi;u++
zkbu6&aLKkH?7mh9ot=?cb<f1Wf!*JAknu4cH0o^H3)$vO==%BIQaO#ARYLBcE64W1
ztav^3RpqC6<uZ#lh6#<21xQ1Y)#5M?8`f<aY&G!<Tpv*6Kkz4B?*&r351!`9Q7k}S
zRrBMjz&z^w?S4M1YnbqwrNWK<yi;0HYgB-<#)M2XSfkx^QPVBpcUmuk0@--oWXI(t
zV$JGJTBM4tQ}n5Vcva*fku=iym>YZ}gxa;M&zKdb-N{A%6G0li(N8Q^ya+|Bdty%=
zt5#vcdu7I<jRggkGm<7At{#%oAfUPAr#}uwkyC6A@%)tfln&{O4cUq#ffS`Z-|skw
ziBkG+2Fyd}NDaCmSnVcOxuann>G7jjD0Ih5DkOZKgFG18jyTPo%I+F|fX-zR!|S$Q
z?p4SY@*A%@*!&^4tR7jM!M9gNAWF90CBG*3TBR5KR-+L_FTgY?S5hK4)DfFvS+meF
zp}eLk5GFj~uR>$+WLt9)RI<_@KWm#0A4zK%BWO39l5hwrwpgxx$dE_LDgPL-qTxa@
zTw;A?`@3)P<jFHZdX~^CstihfHYwozoGj?@ZgoN7Rn&BcCPR}D`2n@zw6S@#?n;R7
zk>8BkckANuRY=ytqkBWH4qi810_jWO<vEl0?0ME*355bt_tU~4k!fX7n!3tuN|we}
z5CIEZM!lj6sU({KLn?Xtn>Ky{!gp(Bm=)ZN-tT{R2{5Pr^3wDo9)-qX(Ij-)G1Oi3
z_atEq8O|&$oiyrijN~^-)=<MCyz(M-b2?#9v;7Sg)%-P>maec{!YMH;ejZADpLtD{
zAzEo-ER-Fh8%SY+ky7fvV9<HE?U0i0Y9awFk&t(=yWRFC(E#JMP##-O2t7GIeKN*6
zoSAqq%<(G>J6}M$+GU(`j9B_#x)YKys+~^agQQ)lb@A{ib}TG$ap(42*J--sBQnOO
zK!{bF+NhY?#m6=JOs(X!V4@e%F;_xdDW`mQH)9q`6T}^lPT6`ly)kTh&S<$`Sq+>n
zzgrH)FLSwwnHdDi3!3e^^{r!UFRI8?alaULLo5ipTDuuaY(+Bb!*AvVjmow;6#$)8
zG>(Y|lg>k`0e-hvdOF7dbcF3zlwG~4$l4Ea&xli1=hr3K5<hhz!|Nza_Qa!UYL2<4
z;T>MavpJ1dj+KvYwLcLQ+E}3I((&2<vg#D<V^=uM*cG`mogm2>b$-;W(vizhGFT?A
z$h)#gb7sD<j)vi^C~o*URpF!)INQ3K#gnGO`Vdm$>P3k0m&43Ug-~|epx>eJ4IlcW
z=hPt_k+SQ9&vwI$f7ZmA{7K1!gb7`5uS8hgCkMip{>R7~ZCDMdxv`9@ASpzMS-yZW
z!E7XHnDBBz-cPdj6$N7ilAtNVoe{1>xV=+FwnWinN;l~hC*&W`0xUB_1U6C8Wv-Q>
z-#!k=RxHZP$|5I6(cg2>hpJZgz!r<JWrxHKbsaOY=~+T=;qHjgR3q`yHO~dCPJJYp
z1q;!eDwVBZOi`GgYzYKe9GwnFOy3Rp3)&M}Auma^I|-#bU2@|>(lYrF*SQPAr_hlz
z*s9{aJZMM=U4B4Uv0x=8)+Gyf&In{`sMHZz9&_kCW=X?@1T`2X5WfDd8j!O%Wr;R#
zAjNpn7rcVL8OxrAYM9)FJ^fT5TSdn%gXywuOMb>#k3HxjL5x#vjg7=UpD`X6XB%IX
zPfgnJ;hSsOH4gfRF^R9it_8Zi%zL7ZcBtqT8bkB5F$BhNvU&33C-<_n0>9R8L`bR8
z|7`E5C{YJKeNG`oXVUHR0dIc6vF+~D#pXf;5=Jenq3vP)bgaJ_xV^a?q>M$I-lOsr
z-td8s*&6qB-1MkPE|%16kMj9I89L+dh($dP@{AX&_H0$g9F!uVRRqy5zA0UAR==Y^
zdn!Y;uKbKtP@e)<lpqvKZSB-m0^&VXFa^iXtZizQWN)+?lS}bbRdNS8su($X<>Kwq
zRL;F9qNA}>u!R&0R-`+zN?~d61=KEFW~u*nHxO}tT}8}D66zT%@^ytC><P{Co64s`
z$^A63Z3hfP2^I7(yX9dU8GQ*=-b`+Wh>9_+tPIA%hQO%H8+5-wG*X7LMg5V<t95G3
zR{8_mMw~M9Cvro!4PQf%SN^}B+|fFD5#f}}C&nzuZdd6_bI|Dq9|y`@CU@Vkunf91
zaS{uWcv-aW@<;dybB?(b^n<l@OV$12XZPEOIS5di>L&-Mlf+~dN3<JZzvYcvPFY(@
z+xN#NNOabROR=9nHEc$QK?rPnT#QHJusJ$9ZT)yZ)S`Sakx7mAJNdLDlS=k8Z}59|
zd{#<r$gr4Uq&K23=kyRomaC;Qr^#$%Mj4>l_?p5Ml%GdhTG*wI!lkNRqvIikBJfJ#
z)Fr@>Q&Q23w?9}H5W^>m8(H>~qD4S}E{w!#WfOT0#*fah)4zYiRXG&hwO*wapY_R#
zC0}>JlP)+UlecjU<!{k5!-gtQq@wn!abRpgoZH~KwcLXv@_OnC{Xq0tCM!Hu!NTK>
z@DmL#Fu7%Gh^JF;>vL%LzIKCFWU;~TyZ`#r@{Pul%Ihv6>#za>P5O4=x4yxs8?TgH
zULo40U_i{8RjWIjk%V`K*N3iq+Wwe3{7Hl|jDefikcTAZjbJE77e|#!5}qTw*%C1O
z%$D2~`3ZYp$6CA3sbnT3(QMmPk4Ni{YVRL+2u*k|Y+|9`3@b^9Tl#$2TP*MWQB{b9
zs}e2uR8}OeK?}Mt;N8e~@4}kMq(uAO0NypTYGk_kPA~M;iIrhj5_;IDRus!rt1raE
zaisU>n<#<u9k#^lmt1Z16?4m;qBqbDf$uE6_;<B~G%&5L8(w9iyBb@s8c|5aEF#mU
z?J1t@LZlS^?2Yj;QDb%VwAyfpqim@H=J!ciTmqTad#2p58;ZgzP|F<mTFT3J@@H6?
zDC{+6%Y4>q>Q;rd^r;(n*Gvci!nuAITjHUU$nSKIL3AC}C@9MB27FoETn^nhOdJkw
z*%I9_<bbwXskrvJg33#>3bEHh(km-nI-&|_MfTlpq|=Wnc0Lu}SG_k436GYg)9#iQ
zlaQQ&zp5{$4{*kl$%0|NCXRLiqo>b&e*$O3WIfU*8%89kFQr2hhRMyxSZ>1jT-+%7
zEZ}V~v>jtqFX*16^Vq|l{}H#ubfLf0+3vRF!I&=77#4!~i$P^39qgcAiyjpeOUtzS
zTQQ=x_SM*S7)TdcLR~jpzpch@Bj4ghOGG9{spzo?a!Ir{X$i*n$!FY*r24=E#U-mI
zU$YIwD~G*`%mb*fVy5n>=Ge_Pporm*KKBOx{AOULO25mZq-iEZuvdblCnnMAPLD@x
zW!?KD-Yg3)<A^JGNOVgJgp6{g9U?u$LN4@+a@E-@MMlDg_fy9%3`Zv(m9x5b+ls#1
zPxEbMdwS%?AO9Hi*oG8%A1-Fm{B)+bW_v>)lV_LL%5SE2djW*pqMAek@wW>GTu*Ci
z@K0z&#oQT1dB$H^YM3eGr{N$R$n*}A*g7lB>Xm}qk8_0ivnD$E*hkf*QvFXq&fS`d
zD>If2c^+|nvkDSvH5vI_?ykBs5nJ<bxJR4!rzJuqI*^Y!hpE!Onk<2KD-t$c;D~Lu
zvo-dI+u~jr(9w7(RBEubuB%DE@QkE~Au{33zRjo;B3aulp<yygx_8;!CNa>j{;iO2
zJjw=1Og;<>F`I72ZTFT!=v+AJ6#&`Jw`XbFYzKfjqZSS}JQ|!_h1e46R|gDItR_X%
zP?CTlB3tMz`fhd9rkq|0{yTNHGWgQJFoxQSFzR<0NAAiI)QDKW65EjpmvM=EL@q51
z(x*fVS1vB7=#x+5!lmp6b>O_m6&<FfD)+}kEU9F_)=F>fxi9e%fGI;>#;Y0R1_#Jy
zQ<vvczv?zVhDUeI60*~Ev&`G-`y~VlAdLq$ih>RZeTT<FJM4PM9GLmQW|~89R($RJ
z*~D48ngD`gSb+m=z%+Z8Knb;C0etYGszd+BtkS{$?~dY@e@9`m<h!J=fAw3*6!OBV
z8oJ|4z#!+$cP(5ApBw~a+&C9@md!G(z#6#DP1N0reyMz1Q#3L@UStVMn#yuXP+><&
zU1q~hd{vRI8c~CiE$-~7Naw>1v5MxYk}@lJ<&c)7N>2+msYKEnNS~NZo;AL8G;qnv
ze7cO39ih0<k>-OG?Cbc!cK6Vzf*C$d8txbN_p<Uy?ljt|`|(zZ1@)Vx)0S5>fF!q|
zx`EL_TxLQY=i{Y>6<P4Gt2Hk~KIFJME_=&xq3%rj1Nu=t=Zvm-dU|8L@4sdlWi+S|
zUNiL5dNwGGd^rj_Uvw=xiIO~ju_=iU&ggma)Nf06qQbtJCm}t3Vzc8)Op#Gv7=sab
zJn-q8JvlW}rc$;>W|k+CNv@O>jk6c>%T~VOeq=ag!0es)>tITPHdp7~D6br$p2$-m
zNOvrr7@*BNu?>F3BCjDyij{jn4r)ONt^b9Sh8Nml(nHp*;>rUff9~(g*RHc9$kJL1
zU`rd=n&kuheJFvZUH42Fw;$BGx(IPpxhr8YQ!cdw#tFRGpgaRM>ynwxjyX~F&;Yt0
zMUbqAu`XjZEn>O8F5%<lSwopG-gy|6+iXbG4M{t43roLf^jVDqBiKiFOaJ&hapPta
zQk@o4AX&C9u0xi;MZLHcUoOFT|JIIV_<|A|tuMMRQR+2HYpma)t;;3J8KIzC++Jeh
z;F^ydJ*{fujczPXWdHm%+LKIHBhu$2Kk`Hj>EmcR=G46(KSDpQuU!&;D6y6<PuQ>H
z9t$TK3><yO;7gZFwt%rs1YEkLxlk3o2Er9`N!m1Iluo680>SHS>39%XWQPJA*!pSo
z$gna0tjjx0(5`G_3zQ=AkpeZ@sQF>sv^XQ4s^4y$IW$#=XIfgz19+y-i*GDHm9^r=
z{iFktK{sq7spn8);md{FVT~Q&cjsS!Ed<y5Ky$a>ZDSCNA^w#yD*oBt8l&zgn5uy#
zhw137ZFD`sUfWf6EY4WhAKl^Ht`=tZg0;iD>w$w!WDfrJmRs7;9_#vv`kmv@r;TFN
z=X%<@7Wo=H;!l1%wS4lC-Tp6EaT>Bkn3bS(r$C(<<QJwSl)A_}6lUsm>$0;{oThLb
zm4Q*vDZwg>OEJqQHZw0(8MXpGBndHOWwEFgnZ2B0NQeBF0yz#29M>>SF-E#kpU|Mn
zzf$-`$X>@RHBPh6Mx)jhZ<x)?O6-1op?e$dh}N>vraHpaq*N%wbRT%F;<G;><MvyP
zrKYik4x$JBUe){xA^W7Nac+0ijJB5Kb)bZVDp+xVt|=7u&h_qNy{BL1E<4-HDiay|
zS#nIoB!rfR?%|~L$yqJkv~iVvRipt@4#^-~Ig=2LKSLB&(fvt1aIb?o%`^tMa-FQ2
zv+!%hk{^der-pTktCGstR7OkB%~cA_c;bSaHKi(6VW`QEDE)hIuS!~E>@iPV!^}@9
zxv6!IGt`+&|4HGq2W50n923YbMXnKW>L<L>(}}EA9y<2%@E$Vk^fu0{ZdS$SXC$lJ
z>-!jo&traqWSV)!=!=fO^-BtCIiKf~wZ-5{nSeN6{8JIF)qUlc=aF038?qnEwo_Xe
ziDW{R>lOwihy94Uf#zsteJ&uLmJ-Z_;cnVeQc1hggt=yATE`KRh7{Z}=viE4XW*sp
zcnceAo<zOt_>1R8XD-r*djgB#6*2vXX{{lZH1_1lxIF1!Qr!h*2RYJJ+B22696&~N
zRNZ?}y{yAbof|>clkF}TgRf9+JhRrd5G@s%Y?>04-1D$SIVcr!1)C-D=1z84rj{JW
znaN}*ZE4q6(rxHal_h2v<&aG3$JDIBUa@qse)J!BhMBBy8>|Ix4q!rw*ymgyUVpIz
z093Gd-q`IW@9kwDT-sg%x|N4Y^f!|D1QMTr6wjmjm%hwt(G<|Imd#rPO1E-fg73J$
z<6*)aQF0hU!gwlo<tZ3esZ4#B$^HIzHE0@}$3mVJM8{}q-PPG+D$-JDpCI1oM4J#k
zu={2so7V)^txx))!g5x}Dgh=ioGocOzUN{$zT*55V8NAJV?}%L2V=(x6gIQXy#9BS
zn+g+`fU_i_)NsU;4->cPWQlDRTQ^M1O<o&Hef*z@%GaHqr)ka>hbI_zg)RO$p-`gs
z&03StBvfGXm=JalX9LyH=hDt3(t$*$UUrYj(7)jd$EUz7*BFA+PU1F=2uo|w-Zt&A
zG5f;jjI1Wklq3qFEc=we`b6hnLplR<qu?e|R)i!LBSJdW1R;6|Q$x{eRYoGO!d~Gb
zoLk0Mqf!fmv?C6%Mg7c~dm+(Is2l|6lM0KWZAM7;WpVDIObuDQuGH{NBDGgT<xpvn
zesFPy1*P{ZJTEP^yu(+5TUd%#@LXB1Oh0U?8onVG*q9;hxV>ohiH`frj~%O9^>i%+
zx379bB@}4S4oIkP=U*g4-{*j0Ygu5T9?$S}oL7JyyGFJodn<ttpu94+zHzpeW?lT+
zLEGR~h!Gy8lFjVqu9VQ2!Y<N_H!XSWlbBw!CLbhC86SDw_=m}|(bv%><G6{gW-%#u
z{bQ@?Y=2OD3L;&uAUU~#mMY&_7=!P6^bhw*Gdr99Y*%Zeug&O|4Oe?HkyB)#RU=aA
z9s=@7_j?BDcH29H^6}KtT^0(1zuI213|5`Pk%9ic!*Bs7NFQnI^mwrL1sS*II^C?E
zUzIHiBS=`V(zq?9UuNWEdA?qq_CB-*l!%=x+%fAro|QHFKRCTx3QX?7fbevDXnq%3
z_z;;tLL2tR1WZ_wjvuEZy}a>Z4cI&C$Z+<2w`ZG0tm5T(Mxr}9ru+CYz%YB42s?Yu
zSq;iv8Cg`WF5{JEpcTFB-YB@UPDUk%<{Ab?(nqoX<ba6urLjgoL@Ccrl8FBci<0CM
z7rB9$u!RUW0c0WeK|GtRi1}Qx2edhQTby?nIxVa0kFV%4{;s`+w!8K47iQwi%w*H~
zf?p;C-DS_Ts3|@qy*|QKrW;#CsqZLV51O?<V#8!a+%-B^u7_>njN%dVqa5oC7(;`6
zNfe5^BySE~C_wk)LLVBjhkhyv9R3mBfQs_x^-zU%@1JtqntYCT6AWgHMx_FPj9_>Z
zg#;qjaSl!Qh97$K=|pdeFVWh?NB+hSKfN(+CZu%)DjXb(Wcm^nUEoJeZ^uqELDN1@
zd2Xn!%NUjNds71zBc55*@M#PFymOo&%ANKUvu?D7%LjHw8;>QtoT9nC!ftjk;}GPy
zSgi9`Tr_{ZSc<!mE5B$(O1VE=D`UuhNh81NaOjJ$Q>s6wLR_sBe(kd1iyXDOA^W3c
z#gM*jfv78E`(;9+Z-n|R?@zs2Rlf0aRVk8k5|&VFT;8BKyCplKmfM8B?UB0&&xXr2
zgvZ2dRD45660ImhQ-%Dj3A)4Y&r)?f+buAX9WFbieTfTW853u(?z7(SB7i*@IHG?1
z{jl9Wn6e5}TWbim!Frvwd(#n%?e0^+`OfImg-RgngFj<o*r$Kc8S-NV?7GkE`EBer
z$-LypzG27GjOqTV0(md$kii1c1*AMvY;wJp7P~jxb;L@x<TxIb+o7UN;Dntp4-5q@
zthIri6zh4(3gO{(k1bs~6&-bp#*E)~-e6;6+1+-oysSiEApDFay^KL5fg8~tbUESp
z^$Y{Y7bvIv^)*mkPp)E&MUg`C?I5=p9@Rv4IyOGYTOI~xi!&Oz=mTu$@XIk{GK-5o
z{nj0}c^XTr=l`AsaGW&kIMpNZT50Dp=K}_31>W#<u6zUjq^=4!newKEfWaFD^V>IY
z`Iy@WzpK;hVPgh;EPkep*!4}CaX<!QZb^U04XwXwu%lr~^JU89AY_C`(HQFBk+O0g
zT3=6`i>#3))tueUo;Au6e>AzTy>VxoL9rfdXUR1X+jcdDoPJ=C9EUc`KvJ}~{;7<v
z9P5_MSwo!_AKp-I)r&f4*R-w1vPW4F`3C~Te{F_vU^{Y&{ZQRduEw=-fZfCP3Xe=V
z-7bqwAagVo1M5(n^`dH!gKc9Vv+aEojVN1nE60!0DOgO~XtM<$?X)mP<=n<k(Gv&L
zwQ*OC*7>qVNJ9klLOF0zjE|oKrek#xFP0M8Pf3iadA<9h^h9cGvG=SN56Y=zupHa^
zzVSiNoRqPvZ_At2=(4YGjpy(6r|56$Odzcnb1ZXU6gih^OdNE`*Jreq*cPv26UHM=
zYl>hj2SPccSJhz;hS|e#B8o`~Q(2X9s8*Ki{rhc^me*4}2hSf7)%OtiU2AWVMc%DM
zR><s`PHchje4b}4pH7kXWrDJl=Tt5q32xW$i+7f5K4<Q?MqX=GTtsI>t<%-K&lt;B
z=`+NbD&#rT?cALhj-&2=<oC9W{oMj2()31F<BXLoGvj>9rv<ikLe3n~V7s@SFJqp6
zyt(Klz%RKDLfLD+euHa?NS`##p$3-{&bu%3CLviWj&E-{<9HZ8dVdQ<!)xX>d7Rs2
zULqqyp2Jr0j&K*VifQa}HIE4A#mKyu<swwF7V{3@>;Ze_+SN+X59ujct5+`#&-+FP
zH^J~n;%7r!Iv;VsbfD*7UxsC?@UC;@4!pW{RaEHm+Z-S+XW!T2wu(R>{iK*y6fOnR
z6hXPxUqrH{P%p+0d~ma0Y0CG44s+jBrSTg37Bi*gT}!L_%*!~W5;Z65j@<j>Nm;Zl
zCt}@B2#I(da%I!==VoA@yGq!2-ckD@e*M0r*TlKAQ~F^K6^&VBP5iM5V#rtX#v4gm
z<{cD%UhzM>mNS-QA$=?a<9`kvG?C;=r<U+}mxF9x56^{)7(v}GU<uLCU-hzEt=rLX
zzJscU3qE1DjN1-x`8262DrIj^YcT{Y)=q9|e}`w{U}N~ki~JAt2g;d-ewy)nzfAo5
zTxH%g9tgtcjVxK3w{C0t<);!JxKO$j*s<q6ecEU#)89J;`biyDuL&L2j{2(Rb<}T$
z*Dg#6IoPDdKP*NzMoWM*8Y2q#tXHQ25wStuJ?7c}b=8O;&s}LUrr8DVG`)8qX{9m4
zo&M9cS2a`+ZMHq<OO-hM3OxtH!{en@>IcqWN2Q?>Q3;mmD<jG?k_cClNlDEa9bfLA
z+-c!P(L?tq2`wCY)-_&oO{&p^j+ne*@3Y2>0!GCGF8TlXA9%<wZ600-Dx9%ouf4pO
zkJ8{)Kc5?5=OE$uT!8Wv^h4HPCCIyfzLf;adG11vmr9ezY0iudnRB(sYM9PeP4@F;
z7jadw5=qzQy~%Nr<*!NghIB}(M0XJ~@6O<HYNvcpW6#bMYaolS{Ncm>^OtUwjG$Y}
zB%JkAGXG+_<xB=NdCXc2U#u$GGHkj~4CturdWCG<{eaJP*rq}dgYVj|j;joM^a{>P
zFV1L)z2Gu|R4X0!FGHde^Udp>UmIp&Nl(1i^O6?DSp^4`hDi;*eve-ii{M|1QIQ8P
zoabrXR@N`DZ_S7k8VTZU@%FXB+1uGoL3Q5SS&|DolxmAEN7zTgb8t!1&36RmH@+PI
zA5CW!)n*edP@uR5cXxNENE+NBXmPjV(qhHk-Q6h^clY3~h2q5>TKwj}cipU&mn099
z`DV_Xk-dkeK~;4}sOn|($cGiS?}*q~`1zCUtIm^zb^Mm+D-r4ptR=~29rq>12IC)b
zF<6$@;0cQOF6sjCQ6pS)W7LX!nJHsq)0_Z`g?PfU89|^P33Gm`0*T1o)r7o1D1#Dn
z(ZH(f<+P6W=kFP1`}qEv^r_l)-q*tl+6B8L66r6sryXO)XLOsYYa(lkQ++GK7<HwH
zPvj~LYBX{^`GA_Fe5)V4g=i;9@7#bc$Q7ohJ~d$Ci)e1+yR`%<f99qCx!uR5AzxyS
zjnm*9DjKdBWjmm9=H>KH0V_b0d<)KZObA7ryKu6EDi-fv$0oj!EG4YXHi|D16=!|i
zi->{Mr&@-v9lEp4mgQuodh79I<lOzNhpC(6KYvdc7PGn6BF49bKE$l`3S*J7EkB$Z
z#p7c;US<3ZJ0D4lT6MyR3Eod<PS`MvlBenxY26Q(tDaHmmqO)RM<#Fw(qyyi^?Ctz
zFyxKBpG%(T>p6?!8p?WepA*(Xa+}PpI9~_3JvA*|AXWLhgRqAZ!6I;`+6qHS96(#3
z?vc_G#9;;2Fnqdf3zOj=@WFjC@`=U@z}<HG10J1VhNfMWi(6#B7|`Mny@{SLzEgc!
z(WtiR)Bv7};I1;H%*M2QPu*SN)~F{asjWwC4_B^Qw<QyoF0arf8O@0vqr5>l{u#&M
zXGG#`hvC0i&*+t_?;^ZJ-COaH%YIw4;^GfH6!TFE+B|1$5-m1=@KU!m)Vw?}drkq_
zoD25zkiqir=U5M>jTmB2`)_v9s_NEBX%?6iMbusWs^6Z$q7XgefJv_4NLM->5Tm9l
zQZ(~-F>5?7f-WK{WxD%C{nZQCmr<G{!MGLfwIZZ~sjEdxZYmInUJNDIcucL$Vsd9M
z<q&DWjO}({QSemBwl;k5U;up45mr5+Pb4f-yOSRUCgkX#AF-{19CcP8s66eUCFC<P
zGqpdh(|QSAvmP^jqp9AVSU98efj*}SzZFXu9&<R(S@G|$IJxDE{V0d5QPtRcMyewC
z&2Yj8+zTh9B*ILl+;x<9gvo`RhBZkBI3;?hqJt8Rl`@(mqqp5XpBQnbN_!f#l5=R!
zn`7A*c`3-PL6RV&tpkgP#Wy4iO2NG|O_kxZl_}Aizk-OU2H({{ZT;q3q@Mq^7<zk(
zz6Gk@!{H3X(^Yr8@MGpU5&DEVi?TuYl-<c?xX7<-Ws5?@+=88s<o9Fnt}F5O;_S!k
zg(QZ|&uePJtE?_nVGz1c73ignkMY0<ZeHRYVm<DTxXEg1IhF)s$Ey-P7kvah%|&=h
zW-R$Y#4?f1$Zqf!YYK@)kDwuIgPI4m0sX{22T3V+bpx7*6S~6>hca7Ff0%YF4{j?f
zb(oS1p3iy83Lzc`<##@rTa7{ye8WXJno)SE8znkBcx5$NQ*9WqeBK_bku3VsCy$@W
znr0PA@Z}B@Wx)@s^P=yi*=DR0R4mT5CehXHekGSXThi$<aHV}KQ=fLeNn`Jf1Rzj~
zSvWu#HKis(KY*6I_^gXaDu$CMNGj8RPcY{Xe~EPbr;sgW+aFXZdccc%Q*7YYr)N_F
zTn}&QQ;$U^fL!2J$WGl5Coxqey0-X^EQiY)5-K^!DBh=gq_GtWsG`VW)0p?|YTglG
z%MpvPv~8nV!9J1$YD$zU*+7R}e47p@=vhh$?$qDd!k^fL#k`C(SB3;)rR98oTu4E;
z?MWtci6^ZwLHNa0qXoW~y{+qB=jn<wjB5yp`C;OXPY*xT6?L!gSp0BAtA#%ln(nFv
z_S9%AXvlU|i`W(l@`mIm>j1Q1tsxyiTZ%t>Y4h3$Wrh`YDa%%u!k1%vf-0y6l=F;H
z$byKIK7(<$TXlobJk4FA_lR-dqa~=Kp)0wuqQ>G0GQP{+RVdRJvK??3EZ@2s3+Zbv
zCS%B7FeEB%r^Zd9<nN*TrW2n9e@Bo+`~FCxN8VOG9co^Vw_%DZ1HYZfP}XGNQNKUu
zVfF%kN`z72KN*+yaO}W~Wr+KPfu;VIjH4@JV7*v$XHlXeQ|oX)T+U>EPHo3xP*}GQ
z<T~!yu07TLQS~sWXi(O}!6$a8L%tpbI{I4p?bgIe$>Ae)DMANl?2GOGRwfVAkY{X#
zPeNiQBmPP8NY(Hvlfq+%3mM5D%U*NuANL93z5A_`aR{<B{27H+wFhEBTknBSlSg{W
zSnK+~(UTgf?|L1Z@R<G$4|N#3cSbnV_IC-MakaQNl&j5M&F%-UrSPiNf>-8014_;w
z`3Rpllewkk&4kRQvn5RY$1UJ6?$?kjk*7<JHsker9iJ8;M2phejk>g!{!5ByL3y`0
z?2vhzefGviWPHJ;ac_33z(qGvcLtY5O{O?WGzUCOhB-X4D$Lwdo_QvcTfZpdgzbF=
zZL{9HfRda1h)H3q9-!ZGoe)0%be1u1N@)VkU}k!Wt=CAEybd$?(6y8av#@eYSfJI+
zMs}4ws25cz6v;__SGsd3&{_aDJD!$8V~^Jy6o6Q)(?{TFK82z<eElNxrz;ywzHV45
z$a<VhTXW5ZTG%65`ncvZEqe124cb(&LJ5gd)q1Z3TE5QUg}!Bp+zZzcy5xa5oZpH)
zy$TSBJcKP9Agr0f^IX1JF81ZxFed2xhf-f8L@|Z+X-nGFGPiw%gw<68WPO6XCyM{d
ztm7{_EUB3?oUB_mFDMiqH{!TBHa1jz*8_UW>nPt|w|35o$P|_RF<T;4{j-oBGX2MO
zFW3NMS?)7VuP#!fa+XE1*wd_<lw0ETN(7x-#EB@(ZmShw-ukpz=mdE*lXxSGADe)_
zB`6Dh@-=V2xBLWnpt|X~K>r!dJ9wc`oaDN3{_ocs<3D3YGf{#g7W*LwDgxCG(PO7O
z!b$a6`s?@U-CW5$!7huP67GvW1SUexi{_osomS(`r?mghfD2MgZa9tBmwFxhF3v7#
zCgxm<N;JpFeP~wh!0_DZX`Kum35pfueta-tJBsV3TJ&6n7#u^KZ4(UlGU(EiKIBQL
zE$%zRdy5+^R3i9RNtU>ql~06p7^NH-F8&<`@+=c<n88!D7GYGy@aoApUV*W#NTzK*
z)#Oei`gKg@5nkA$zIE20cC;m;mr;~8E7jktnOkD*NMox!brcRR%8RZMC=U;C07QJ-
z#+STZ$SDX}e4oJeWfW$pEe<1MQD1{;C)}H^N0L+W3{S()=WfeaS9I*(a_{t`*Hcgg
z{YO4T0D?Ml+3w72rY6cUDkN7TG+h6;GTzAu{%;_;HtEl&6!5>wRQ>if;hpESB$8V9
z%T2pVCLY{ee1}fd%XhujN13BxK8E9!?%<2n5Bpy>8_7-llxY-`jRi=3LY2bj@$?$^
z=lDE#Qp`-p*z$Qs?PUsL!^b2_ORN=b&|SD<M3*M_D}NmhNnbQ+8iDpkc&pB0FloG#
zrew&h1n&uh*t>>N)cj#JG>ZWmNVqXd(=8OT<LzIHxw{h_6f7{4t4Z{SQ~wxJKgIl!
zC&kjN(U0Qq&Rxej_*c-N<Q0PVj<a_o7+BUoaf2QQ);wL~B#XD2t-Ux=42JXsUifk)
zAeCc;A1Bi<dzHSaUm7_t$~^f+8pj#`F#OBcbRnzuwTH{8m;BE~>)yZl&a8PUTe;(a
zXAY)BvQc%Aa}+<n9+efxU6kJW8d>TiPa`-d^>o#t#PBOe!OT~VGa|DDr5Jm^A!H<e
z<9~}5MDp4+!vhhpYCJC?p(6GQp#&c&$WNx(360CZd?JfLF(yW;EJuy3JJQQyp57G1
z#4t4!1*!$JDp9{D6_!dJ7IoSmqxEVp`+h%lKwLDM`kx|zALpa=hlB!$_&(gk`AQQR
z{|w8m-mfzF#PDtfI{RlBoiF4M7CIiu>lJRg`cxM&O9rwd`2CgMUK>6%!GLB?E@#DB
zZ5cWC`$y=el(!7SSn=Cv5cJKZQPAhta0)mTFYUb&GwVmfLW)^o@|8o(c206_pq-YN
ziLwyj$akA<*|$^8RaarxJ~~gfZ7ZOOf?fT!i994^=<9GHsTeG1TtIOTdsNFWhxfZE
z720Zp@?+T#W^j)M-SiH>7|t))q`OZ!KyGCJR9o5ydwV0LHJc8(tp*Oi$%qrJE#Vh7
z*X?a-!%L59E58LW_ngyN+nVx?tw;YZR>}XsKx<JbIlsX|{@6}~rAJAg+vFqIRpwgx
zdqcT}LhrZk7$pyRl8=zqX1@a0mFYL(6HgE=`3-`0SLnaVnjS28jL$@so#fphLfHc_
z@tj<duswA%ZmgS?6i`%P=^M85pn8A2_kwJ%eZNHP-@(bCQxpYkM{q{#?>M*Lb)Q&K
z8*LQFvAFsdwLc&ojByyGH7jsT&u>;v77ApypA@k1q2&Fnxg++o>1A0faN)3FZx#2S
zPW^&&Vv-cGG2W3i8NgKvOTS*K<9(x5MQq|8634eG#w^wX*&?xKr8~!FX5x-%Vs4rH
zHiS{JBOW5$z8HZ%7eE$+m25a)yWIR2gXYkPKmL^{CeMUqRzO$FQWZus{r2dbZC+CS
z^)AshPMB@a6q~fBMw!HQ1%1r>?;0P?Y-i&vMex_GGX_RWB9{`EpqHa-8<6d@OgT`;
z&PSu`nL8Km+;!kao&)uh%ZU0%#qQuI+P{@>&Ud1OWcSm%z4r*xA*7@PzS~!V<YsvT
z3GT^y>>HU%9A9%`4<iWO?Iz4W3)=)tGPzyhb@HT_Yijhau|!v*XLBD^V9%74L6rGb
zGCjeNKkJLcikHFD@43$3oc61hbt3InW@P)$JY}39Y;rWn?D10vmEV7<;<D$QE*@6Q
z5A*g;tsjev(HBhT+V>-Z#Nkdp(k$?Bcqa$(xOhdbtzO!Bm#SGQ!rShDh-b$!LMU!s
za$cRkJrK7W57A5^*l$azOUZiFRPOh*Jp9reZB06tk|!ZN@ZiAD>UgRO^8Dgm3L(gH
z3L*HDeWut9`MD|kcm1mhs?zs;^%KpmqqEIF6t6zefsz{w0j6(gs6$W*y3pwWZ3`+>
zicV?>t@K}`ZWxXL&T;Mppvk^zuQ%f~wTFk_;Hb@IS|aE{G@U)QyW&S2rf_W3gAf|@
zq-ZqTIM2siNdom#`dJX~uUuof>WbN@vGfGVhHc{DPk8z?wAQs=vf0lsa=pUk$v<$i
z4I`%Ce>mhjmb*&t!*!V9<auOG&_s<H<hzJ&#>>`EXG`GGEYq~%Zf|KB&>kic;{M96
zbER;NGmXEiZ=e#uBK-oLgoy(memhB$hspBf5s9w${N;C$eXQudL9kz!Jt-{_ocg0`
zcDobNW)9N`ohus_uXWCRd}>2z{BBNxiUKuk?I863di5kR_O?C?ca8G%k(#2{v(l3n
zZ^aI}mRMqk1f;^LwtZQiw)@AH&4e8S2yPII2uuXU#3Ty_v+EiC>D^a@Zff19J;sy@
zyNmqv+{sny&p!t#>^GJr>zNr$6gUT+Oh#q7Q{y0@a<0M&$Y0g_aM2#<$o>h_A|+KX
z@8_ZTP3b%O%O|U2^Mk4`A+C-7U!`E`)HN6_F(uGI5cQ=bwcpt2hkpo}_v(ai3<oXS
z{;eY;0R}kMGLDn2$7^=66=etWg>07*!oxd4vRR?6-=@!`$G(5x5o`9O5t`8|kQoBZ
z3RXMJZ24Vq_kPA}dn<ybh(ke|m_7@sUgG!HX9ziyU#^aMJ#DuQO4fwXa(}7Nlq)$&
zHj2tMaR;x>m0)jZ=Adhd+FrnJyjY|{P<TpZBJhrwk|`$7Dy<|`^Jm-V6<}ABtZC+z
z6ca=t^9GK%o$~4p)ZAu8?t3*Vzkoa`MQpgipE-O$8<p72g50aD%~?7NtBJcvC=8~3
zS_KRab(Yo<C7PHD*QE}|9>^M2T-83DDK*xr-V71@89u=<Zt)et7A*Xz7>IY#E1x_`
z7Z$2iWhkE?$ShQ1H)>Hx-`02dhsN!5MkAL3{>gMDIZ(>##jQ8gHhN|I+<iB$JH5D7
z(~Ymc;J4lRHrn;-nbmn27hGyFT{WVg@y5rGEgfu-x>3AuaEF_CNX}?@y7)^+E;;c!
zGgl#HPmK9BU3WRlGASoayY8v>^?U$zxyRk~ti(87t!K_gH7qoEU{4~lR5msrFDVtr
zp6kRNhUNx$t_(5pVJLw~lMDB+cSpSPu3R&Kyf~UlgTMc&CH3zR1?M^~Qm!{4K{#`W
zv^V?5ZR$$9tq{b-s-5K3Q@IId0C>|1WJTJNp#D9~oz5|OR!!@B%f5?zE1&<R!)40o
z7(&|`4}aXEOtv7<tkKre>U-xHUZoSpTVCm=3)qyG>}Y%V-I@Ri4PXh=c_HF8H`?2H
zw5Ox=0j(A)LM%yES%)6)7u;}YgpwwCzBiEnC;&IHga5!xs7=%VR`9zU)N%P03f{d}
zs`}ZPnbGJ7oi{Dm;5b4ZnbsmzJ>~x)mzx#z%K|Df?A^D@;khUl0@suxtX(0H(Au;t
z)Ta^guN=y?nW&IbY71I<`RwtoPULJs>&%zU(x<xPb^c7NfV$iP?<k@@5ZV(>QKDBN
zub6u`U()4~z`c3Ml!)DWdU}O}@@e(j7}By%Bf-l`UD;Xbz~@GTl(yCfY^>Fvedn(!
z0a@<RB-DeR9ntb}0(;h$89wtLLYw@Y`dOkUi(eXPkOknlEwiU$Ngr7~YkO1cFjVD)
zbR*BLY^uUn>J?khw^WYTC;)MvhqLzO4j~J%My>b9fXb@qYWn$$d%YvZyBevLf@9cf
z37-ciO1HBhL$B;`+x{qgR;bhUCzLPQuN%btPkIV<y4K##NPLHKS~`XvORPrMQPy7L
zP*Cr1CcoEVt--7JdGkM<qNa80X_(XB1xgBa|J#igTmzj)gj4$egOZDX1F?LmT7COq
zksP3m+l&qP`F(@bDB<}A@85%cx)M}p^2_FWWKdk(-!fYk`_`5ghBPW_W_Gk+#vxP~
z%m}P@@GRQqy%apO%!p@FQ94^a0@s*t3R9OF?nMp}U=%yg#`_thcQrJbOycd+p|6y3
z|0|qks#2^D5U^G!30{&KOj*8xfvylDa$t;TjrF2EhOiH9OXyEtL+s8C1_WA4oU=@A
z$iMDV!q%&0y*k^<Ye1%3^CABxiPcY6XOu@e&BEzF-+-T+ukBwc=oIU`bB#vJ%1`^;
zSc(|cUERhO@KcvF9YXbuz3^-e)z+4^9Q3p?EG<EMV)YjG)5Ypk+;QShcjj@10k%U>
z@b&BK{R)(jKY(&z?I~hV%KJYxfcW#78<c&N=+qR4qMzSSH1nS>pmhsn0rgqfjC*{c
z_4*OoP~VQ?-{cgGp4V6YQ|3bP_+>XTEo{>rgrU_`2GqpJ__B(uRLTROR~eCCScZjp
zo4`d113$9)lu~AvIFoGqvB=cKi96b<j+KzbTZC2TFS+@Mr*^~7(rk(%#Tq(+%h<RD
zl<AZy0XeBOne_7qBzmG!yp=!iC=w81W+kch=d+aZIanJVTq&9<>3L}$H<u~L5hyp}
zNemOXiJ6!LkmHs7l30e_kqK64)S1|oy*cG?rGwX*yQIu?&5X69Y-xvzs{248<KMF8
z%NZNEGa*t*YY9><L!JpVq#yqt`ZWRb>Ijo4Mk)NBxJQ*(5#US?|HGuAUSSC+KkoL3
zKxp6$<%glHbjK;;tFh{z6um|(sHm0#3Lv)+K;hBX|0p4-=ot12DhqaKKS+auvkxeY
zIag$|&Ef#lM`S_$$qlda1aZkNp14BrVNj6Cf>BCvK$Bc%0~HAY`ghY^eNOjNnv&A#
zb?n;nEVug<=XH7sGk`}YtDnc2X01k=aqtf~bNrGaU)y6<q>EpS<^EEPcGu)#(JHDg
zf<~^Co=2k9%is8|fWMnVbMb;A^<F|DnJbFa$3ODA!>A75SGHP5KWiEOiK|x&#)2m)
z9s#R^jDUPY!4yK_esofFGI(g($ytYm+}8+2Aa#qCRlcqLkr9U0^?z;cz56XK-FE1a
zj|U{5<s&O1zb!?Lkeag=AxM$RtEKQ?P`br%kLK8)4}RJwo2K}E`E}L4_EF!Sa;3G0
zdz7fLfTxx%i47hY3C>yqB_K$5W>tWT4yaP42yTIhnSGD+yoo<vh*O92n0=#Q6pf_d
z@tuCLAPc;bx5>oTXiz_E#_p!;sZK+5zAVF)s<ox+z)xNL1YO6A=y}uKawK?Gr|vz`
z41EG+e0AS*TX|img{ly~J|3hCI{sRnn@ddfa(8!FZ?YW>!w{X_|1Wm@M~336ig8yv
zL%ks%U+)%31s&l7pyV7n47Af6<?>heg!;r{TJV*{$^R&}kx<vjiU2k>-yTTT{-jj?
zBpQ`SO+$A64TogGnuy3adzE^`ZY*qrtNbbe|5C;lq(-!LFu@$6vedqKB~iH-=duTi
zG)wrhb^oYf$Gq%?a2>au5yU0od2HdOf)ZhVh<uG<O3tE`7De?SB&TjhoPduX=?&K-
zH2-;waO5}KxZk`}0Hf^LFdPqiTtj?%tQsP0xi(E6(wGH(DyATCJ^^h}ol2Ld)asWb
z%}eyI{rH+a)301-Wu|_T6F-*e_M}$ay}y=j3tW}K*ERTWdz~o45xw5<Ns^dj-7-=N
z|I8wNmcJZDn(WTSVolkr2z96vn-ZEr&A2dtv;#Iwp>3!cv)AA6U!9>c6fBm2QA;lS
zUpY3+cB+oi8Z-|3KTa6K^+5yoLt?z|{^Or~N@&$XB`YmouXq3Rb^BP~uU9*5Y*lX^
zJ4*{C%)Lw=%RCZ)unO?NkEDluqFu8Mh?Z-jqI+U{nFi~Z!fU3*dZ_W!fP{${W6~53
zB3ZLIH9*+p{HuQ(U|hmx8SJDLk#-r*Tp^2*k&PACTS^|()~E<90jMUuQ%$KAA5D&N
zzc*}wobYAD*Zp;ofeFDS-rx{Jh^wZArY&2j3sr;}w}(uue~G>(e*4#CNoE<{CEvMW
z@V-Q6h76{Tjuy946bBtZz|yDW6;><i<*&6$rVa(JY2oW_zG7v04F4ig{N5=UB>pWn
zL`7j|SYt~fVw*GT9SU1NsQQfsNz2;h|NmJ4n3t30KY2b@2Z0H8Iz27x`w5>g*PsCA
z_v>h53w)@VARmKN;A}e>3o!ty$^MQIkPn3`p>h&`D3bUe&-tG*e4$L)=YC1Y%R$=@
zjd36_Ca=<*L{paZ*6N>*vg%W>==!Y&t71qEU#0>F{rb9HA!Y_+B{<3djx%9i1fB&6
zS7Y)YRt+rfzi;|Pja4_bC}}V;^i)5H6^7h^EO^4^nM5dG=)qu+(d1-&Atf$a|1a7v
z%*B&xjd&AwXI*LwOq5mKO-dq>`SeBuIP9r6h<FYe^h6Et0<mc~up#{BTwx7VLy#dH
z81v-Cp8=I<#krcXDIqqiiYI8I4Rbi=0U`d4b3ITGFw6)C34=+l{XHkp%~LTSP;MP}
z&$0+0vHN}$pT_b0EXeS{jL_pDIRxcOUmo+{+bw@Iuw_pjLY>}&Zl>cY%ztvdwxH<(
z)c?@67ccP!HH!b^^uLb&&s773;C+89`;P8_g!<+T+&knrt}}VV`p1H8;^?Dd6alds
zc&r-pN);T9o?*bL#h~#~=@Lf%D`HMUM`Da54R-b9FvntVMa8O+aG=w*seXcuxas(S
zMga$WkaHv#ah5hhYNAjw{U;XpO3oAEgD#%)WbiwFf!)uTGkj5tT<d8on&zf*K*+i4
zLHew3!viy+<2Ri#`PD>)Ya=Zn4!#XvX--m0gFXsOM+%do7n2fM`)DoZ4J8uVb_M1f
zkG3RnGOipe|5xCREXhpPjKcf_XBIL;oYTv2((_DSC!do<oilU{e?PO9$o}Z_Pz-f2
zjI;g}d$}6?PqP0B>!Ul=a}<V3`F0iF`_TOJ915(iTl|+8y*-^eK}RI<tefnhpV*kr
zcS__786sAX!Kx&2+&_=ChS={5%Jf@IBJ7G%@@lB@8h1b;MaK$$n#J4-zfUc*#rc+$
zy0?eq@I3t!N_nqGx#^UZ0xKY65is=;obPk%(Z{&lZ31DL2`PY|9*ONpfWLaOvtlef
zbev1nQCm{e1`wnAE<Ajd&|`obTsX<qD=#K_gZoG_Vy6KEs|(xp9XY5rD19YDbQe=z
z=fXmm4Ve$#h#LL3No5+SeK;_Bpdt4~`idlvjSkLUdG;f#1wMG*@dHkjIpZ;X(BaIS
zwDk1zlrhZ7=Xl@N>uQay1>#ekiNh(JT}n`!lYneYVpzo0MLjgK>4~@)ylVvZzurKF
zP(B+QNvSPU*@7SX3Z#NPe?a<?C|{0><MW_?k=)$epS^ES8^7Nk?oU@Zb?dgFuJ%hy
z9_Z&Y67Me^9;Yq#+CO`@{_^cdId2!YA2sc_5&oS%`j*7ptH!uY;AW$cnL*L;`hzFo
zK*jI0r8|_d7oMIDqaRf^F}s6f41bb^DpTYM*KNFxStF*pYd%d^VTr9W2y2!PYt5(#
zAvF|F>JXFV>E~E;F0yEI#B!#fIjf^CN#*E-gMhsfIOlkmrYvn~b$n9HkUU2H%nC)*
z-W5m&!*7fD#1W|T>@KaQgLIBs#I};i252Blx#UxUkvb-m)Q07zkf~(6lq>w4?a0ux
zLo{J`<0V(|&I+Pbhk^Syd#ot&ed+Zz7D4Kls*&&Y@DH)CR?CQsPUgvjP`LXUYN7cr
zLe)SOD_dRPpsxLh@&5m8@)_oFC_k*Oq2E)$AYxH;88#L*tfopdx6VaEYsdN|qm5&%
zicK=lz#%jR2~EEt<;leZFtr=UyfT`^&L<tl0=Y8Qu8AlE`&C(XUrWwy%kQYA<9IZO
zGtVw^lZ`04k0>duM-g6y5W)tYnVCv~ha{sHyDB}}%9^wq88i5MiTD%snAf_9GaBk%
z%BzFZHgE>Ci*59X6clCT)9I)+OxjM8YSO6)bo9vayoeYC5>`=SX8{bf+(Q#z=uk}~
z?F<gIU$Rr0GV<jxGLQk<Hzm~d8ci*Vj}t7|K{w0Ec1tO}pGsTjb9O0dJkz)_#C_NK
ze?J@l{Qgx%qB#_kRKVfi)ecm%KRHhMZ9lQ_Q@Hj=iPlyK)K32j6^m^`%__!^<2nye
zB?T1xo|AotifLY;H(cc3J45?tESa$DSOT>u7c}R<HT_(`ZQ0~&;X_8{ypCz)4EwDB
zOj3-(YJtjEVpA<OuInO%7oF>=OSj~zlhu@f&dKuWcET6i&)R+Hh@>heLtb9a&sq{H
z>!Rm_sa)sX?{_Ss!VWB0;)$(rEJ7f1N<Ts?R!DS^A2-7Blk<cN%P8)O9zvlqDh5Zj
zV%qQzPF1ZU7cQm>QwuaYBd6en`D81}|7M|LlZSJoCb?9r>>JV!YJqD$JTWGf*8!}}
zbu8I@>#+V9fbE;5M>@Io4@mSuooiXj_wVY+_s(6U@2=hwrF{WKOovn1D-HrHKlF-2
zvjx6%Kts}u*saoLt0g3f{&cx!qm}^{nwDMucO}DrdM>EcNgtZIL0>LVf7=>`KlEY-
z!*2(vXasDlThvb<>L|S%L_9?(zFt9&-Fk?`vn2*PBxIE)4j>7QU~S>(hQ21i7el@H
zT{}EIfh-NFuR8j+@FAY|;j?^&WkXj#Yex`LX&UERvhrj)qt>hg5D-Uf<s@9)0A^|Y
zpM~WJQ;>xgSsOMrEUBmizy952MLs!@oFu7g#Wa5<D#1jSq~3{RvMj~wCXf>WeJRzU
zrY{gSOSo_FjdhsYXD=8)w=}R4#?#Y5jx4lM%KZR?>)J0aY({zjp@Ovu69BLilfng+
z$e=YQ4cQWLl<(V_`n3ZH*aPU4NvL7I1itqi^?1b}dxg#F|7SD0*@t8cI*FhDXdH<n
z@3dR0vYbfkzMEHsdI+v6)Qf@SAcJPRrPX@#)^7Q}AOy7klrE#tdr6>E>Ba-qkN1l)
z#Jv8`8^8YxY{fFM-q3l>e?O_Mt-bXB+euA)+=4ZCovitLpi{FyKK`>dyE}~oVUEzB
z=m|>S270tZOwP>5#g?Kju8v^+-IS*ac7B{6JP2i|YHtgf$bxe1^A=|cLRcv|`@!P<
zAKvBP>s<?{n&10E6(n5sMq&slauPl4vc{Ok?h>Z-R<T_@V;rn63rlr(unIp>({cGC
zj=MFSq+V%vStLPDk<Qadfl3epIo4l*q%%jnsRW`eYPmJM5Cht!LKUh-B<3Nx*uZ*S
zlbdua9=~W(EL>9gNbZ4?{5lsWgu^lRo%jeFG~5yf6EwXAz;=#iT8`TZf8A%(*Qfjc
zZprx12LhGkphG(>bY)=$D!v&@q-_Suglx>i!}#A7Q+jxL{dOM2kose(+v>Ra-}(*o
zdKr7DAqba2DMQd{3wjSp4eewLIxNhk-@m(DH^LT-c#8KLyFy&kPH4K8@B5qBm=A&J
z2SMCEFEErg`MXkKgHEZKplcZRnKRX(skbikzBTtr;hl+$tUAlUXDX#+HqMq^fwveF
z1(<KGVv4mH;JRF<wXxZUALGq(^Hu|idl*=jThs%-sbA=Kl|ONmrzp1r_R>j(wIZf$
zrrc9j8Ifrj_GOW&<wa3uQepZ|G^?(G_C;{iHsbiv>f%YxC2b)=ZP&<XIPi|2OdFIi
zWdfP9G+x|*Pimk?z>_-7FSyZ|yoW?ABe%&T+wIlRBP`JBU;pYj!{9t-a~2D2>zT>f
z2DNWY=9+_*wpc0X@i4lAu*Z7dk}xP~jGl*s<820`KOSwWo#l2OSuX;p#88K@TqC@-
zWKzSw&}gXd;!xGW1%@aCs@UU~(m_aL9Oq?Dxut&T$bpEikKSqFNm#z;NdwA1LKCW7
zX_{4K?C86H(+LJhuCg1oPW6m@7~L3YO}6;Xw)`2M45Pnh43y}63*ePfqe0}?IZ?z4
z-9~3HqiZ*VgJC-0RDc*P6EPdrY~lBO0N;FpEtA_rMm)4T_!*$kX1e3268Ht0JqrxX
zPpH10eK$r_V|>P`psG$eU7+77Z0ZqDb0|#pMy)yr1iHsZsIlV_9=2O@Ql~@+$AqX2
zeiBI_Mx`aP<DOBeiFwgYQ#AMTMj1~w$S`44Dk4qg*ym|;BUKm+Vj7d+qaTXW+k5Ye
zfxjM4{z>c11u2p8W5)0sahc?@N;<R(sZ~(qRcazLX1d)|8ys7`iNZNlAAbf0cAScZ
z9Z8kxq!6OsVoD~i|HGiU%G}cVA`N5OSv}vQXsU}%_l<b(FL}~sUCNx|;9q#;t3=JT
zmt&-~fZ}*bc7ch_RA(9o+B+rUTfG;RsmT2=!oE!}7HCow*(0fZHK|q@81(EQQ--q?
z%aF`nO^j1fJlkU4v@P`9Ivd<|9H16)1<7QXldMakRNlyOXvk3j&KW+lR7Aj@tN*gB
zRT{<Db#1&GzLR`hfuOvQ9$|Tb3M9o6Hge`kK`=TxV>9?w!HI|0FIuwBOTKMt>t4<|
z(1)qV5hgWIO@0KaK9uFQ$kd@Hbh2lj$rs_!Nj`#ygFv=ci@WA`c{k}O1^;<5rLOCl
zItTnSj#F1&Io;;{e}9LsEXG!excjBwc(`aNhIxj-KdYE|24rEk^n*Wty<G74L+#S1
z&2d?NR1*909Txx9ATAg@z_;3qjw*e%_RxL(6z?FnXq!*|J){!Z`!{>hQriR?l-TFV
zdP7W{L2{T@W?}DglNpu&@KUpUc`Kqcl}4*D_VAI9Bc?Ta%y8;MV5tc74+O>!sgBK(
z^y=^8bO@dz#?u2<BvDW;HrUracS?MbLNhFx)dK@}&ipL0V!oGNpDQW#Hq>wgT@WEi
zQs#Qxj~XD0!1P7dZO(R`Egoa}M`Gb*(yv#C5wiZWq?|{FGzwQL*%p!j7o>QJ)2kGV
zGnM$CS23-NFIbeEh_uiX<{|+{nz)71-L$#ZL27wt+@I62eII%f+Bx;5571;-3rxi+
zfN}e|fuWf>3dh39LlCiD%OQ%%bAc{~))G9eQrC<o%CvQG(zz5L8=c2cPbA)N?~sas
z<Qi&LX%J*t8vqmbdUW6sj?8r?>ttiFi<CMXe88Jlz{AhUmu7OAVf3%Qxa0j~SB&V_
z+%)vDaMm#y5Q9v|of8Q)>5~?1>EF(R+cnlIxPcX#q1xEvd^nhzMMb(cDFIFRn<(=9
z-*Au^I3_#N^njnZ^QHGHbpPyf!c#rBB%o7-WR`x56^w8n-C|tU&6@A1&q~rY<L9)#
zQBF9QO{3F77-yH=TBGKHg#*}$t6OL?o2V&q+p;L~bw>t{P-SHvAVS=Wn>f%XPBls^
zHn})8!bx{iyM_)*@lIKtuRdS{i9NMtvhij9isGS`{vxP4&8AlpX?Wgito5H^Y7G^^
z5yEaEC(#^XGkydc>CZSPBwMo2+%MBvYWv^mNSjtvv;0VqZCu8#jbH;4e`LY6l^*93
zxdexyI7R)4HP8_B>48`NP{WvN$J@@ps7`r#4WamhKb%@?iJCgPkqVwQnz}pdQ=pE7
zw}=yb0%wXwFq_7F&7@PwDQbnP8-)vKqr~+N%%9jMzyuAyaVE^+nCM!)>fow(Ibdnr
zWCsok&@RMWOX{eM(N_NgmM-X3cW@gCzWW|7J?6(2|GbuwSj|}3L*Bp+#uTQ6Ioqq#
zpij2Z&r$DdS!5hE(%`P|mq}9a!E{xSLmdP2l0>0pGMlx1o@bX{8drB=pFRo5$lpaV
zDW!AADaN9%8f7!$GNO`~ClKenc;}W>E21j#_tv)7C1f6Z-59s@b`l<oFSo;)%?KE#
zv&d82Ehy_jdC<vM-uD3()Q6F@5H+MUl%&l1MEwQuO9JRU#qW%9Xz<4LY$bum*woGz
zS8%A*!C)Mm?!RLfs*_!I^A(QHcM>u0y?@TecPJ!|Ntb{+A?L{TaaNa-t4|dwFO{fO
zfd|7!yf*HDk`5(Na5sahaeXH7y9&TG9egN0_Rp}YkSj4DEmiZmYI?v(*4{(6T1h(D
zju+#1HMtC}*jYE+9w#lmul^FX&0TIT`cGP!a$@iT0~HLO9Q;VNPDd(fZJLt0F~E#y
z7HpMlTls`mOvG@mq>X^Gb`wc<Fdb$TRF@YG5b*oc7Y}4xwrhw@r%mFkvw?Vh+6;9^
zNN4ZqJGuJF`7ckipxEo{{JAISmPh#_{BRVeA1_POBFlm;g1w{RQ$mWfg!BO?S5qqd
zT8J%{r@8m6!-@t`nGVb`!;OaC_eO20Ljo3ePUHw5A(IyFkNFMRI?e|)7YeG^c*C32
zNz)#bD3IK#;}+`Qm_gr_qRxSTZQ*tenM>lP%g3@m$+a44jy)@;?7ZPMT>B|KU?eC-
zDtW51aP!6JU}QK@mFnyAQB-%WlGfql3+)Lc3c(}ra7e2o2Flk1&C(EO@s%ATkdZAR
zaT0&>n*Qx@cJHzst+E(kx6qR07L(?h4_P7>q1u&R*-aFmC_K#y99!cETb<amYqA+?
z$u9D<;fFTljfO4vMHB%oCP9LBGbiDcoLEad#2-jkn?suxIjEN_2fw!HCvA2RX>g3I
zO6UAyxlT_cMA~LvM~Pr-<fYzD6=+vgqe>wQV`LxPB|FgRxA*u}{x6;;#U*;13FCg;
ztiX@><@0c=jITv0BU3<iB9k97EWYau-C6#n?3m1l{#4mb8}+w4y01g~Q?LQ@vYvi7
zCBv5=8(4d9<KDt=VzV}by|{CbH}Iw=#D)AWFkog`5oi|0M`7=EUMm9@$0EKtjZ_b>
zQ*xh!l)nbT)$m3?wFKlO<)N4>E3~OGRoIm`sUypig`gP3!<WRLTfp-1r;Rs?b#$*9
zSperUvfbgXIqVAxoN0`6V}(GQ7KWWsuMydnWJK7XX!!4OxZJCMXLkv}D_ZS>;gcQ^
zsAOs)U^R2B6Q9%Vmn#rkQtZwYVrDs)Hgs~0*Y;$Ta|=*lB6=-CsA#YQDnf3p*~H&V
zSo`a<3w(<&Z7VLVw~ui7L}bfLO3}VTNA(HK8hLJdoo{)WSFQ@076)`BOk9eR!NeQR
z2Npt~JYGP{1wM+lOlW5CX&U`Ji1ch}1|Iv_CBUQ!>0_O=pC?WQD7sv^n&74mjf{#<
znUeEdSRzeTajVtvk#e}$0S2ZJuXIQ|OeqB>UkH(1d>?#7zpS*c-<SpGwmav|7ioSH
zN0ursOzPkWrs#egZLCn#)jCo5FpN)T0aSHl=)As{W3{Te?!!K^9RPO+O6X%CjGdmF
z(0OCoi6;Rs!}(M@sAx?$(hN1}-;lz9<JBgMr{b4P7^}fkONDj}ww52wR^yn^l5LoA
zr-CKaWoY;{@iXlYet|#loXUMo?AXgucP&{IfJIp<wgFiRS76X)k_tq2uRYQw;s7c!
zGQXouwU=d@el_9Ggp(WtXyR0q;QuB_Kn76t0e!ZqVu#)l0>8AFkztTc_Xd18&s-k7
zDQbfpeJNxQfV!r?&$u|Ed7J_MEB4fcN~ZWv95rM$Sywyu4I_<7aKcnWnt0J3GEai|
zQIhs@K_)X>OfKlNjUD+?SOHtIzf8nphGB<TX)!+b-Y?eHPfNNb)pBW&)D0i%$#et~
z8Qf}e&?-U$5QkGKvD{{#>iBM+A4m|55EU0)X4cKkQx9ro7%~b_qdodwGNLo3L{fyZ
zCSLWM?T^GKKWkW&oOBqF4-b)7AWYrfSY@l<35D}nUO~g9pFr;aRdeigF<o1aSDwAJ
z2m3fKHnRe&K1HMUF|{SanqKk|F}ie>t>6xDDaZ^iw%hdPr`Vlkapd?X@s7-rS6w|O
zj~iCGCEa!O*mFKaxC-~?bpmu;UgCN(3kbcoV&kE<U?A0DKxcAm(D;7l8(^SC37+na
zGcgDRC&R4_os(cNhv-samHgJEvVZu#BZ>5O0l?<c6<_LP;A@1%hZ!Sf_aGC#UtnZE
zAri(X>tt_ncqrM36PGS_ySqt!|9OFK^{x#v9p=iAWBfv~^@7$&knu4!wyLp3nYH>(
zm{f=R3!EZAf&}nb(TsWk+`N<=ifpH8^v%%K@wijEj&!EutrD<fUpxsS&>IM>FVogW
zeUu?VK;12|6~ehO;4K>7jfR8IF280;I;B%Ll2YO!Y>bad^a?#$(#45VP!7X@L4XZ}
z9yI0;3=pJ+hYx^DxVsTLux~@Ld>KsO3|`?xlT=Hm4nnhH>$obB-gfS?g(ejI-XgN!
z2`*BLx1>!yS(;C<j~-;ou-8YMY&U^$hg%}}gQow;8s*`f9#gn0c6dyqOxT7>u*T2}
ziJOBlz-qT9Il9{#E;&E8_-R|4+$=>oAV<o7vOH~2Yx?j%mxFMIyb$1$bYiGB)gD#T
z$e<n&oV83Qc$T`1WK!M3iw?Z>yCTPfN|%4|0l9GoMwO7ygMw6c^^%ey8V~WDC}{hy
zN%CZ-FfjEc+ji3AvP$jFBL~UxIU4P!n4@vfJhf)-NUUm3xP#%IiHUvK{5G4#IyHog
z8JpGkiV#1qD8&QEpBo`_K8l>-K~zo}{3Fe!u${^9k0zz8C>M!*))p**p&f&=%J65C
zpCJyHV#!CWr1I(y>(vSDYZE&!>*}%!Q+*4CNQItpqnfnlG&0;jdJ8iNVPFWd%)oX8
zL)=#~6$%M7y%Yd!#P=+mU@~;LpOSC`8a2yjFq3+wL56s!aJ#QeFcm4_UqjCqW_&j{
zHEma~>BjE!mZ?soJF70xM<AMoCcy=TpIz}NM4F4Za+>$SI!3=y&pzZ)dO$pb4^6E*
zX}&2i{$ijEm>K!gvaH-u9~dCBEZvIDtA(K&?=Cm5-CSHNq>ruCy#*gI$(Lm>Rhn5r
zu59{`kz+5AD}ji4(2okHa4=|1V_;ry36`cD9|0a24pWNUdLMBdWL83zoxDV?72D`-
zuQ;3I#Qi|yD2f~rIzn6Ji{6^^TOI(b*dt1<3k0!XYsimM3Lhk8qA^mgt)2RLo>{Hl
zoNV{x1>u@*6wiGF7vEM8u!h!Yg-x(#;M0r4TWa%Z@F<5Tor=XQR=R|jG)T_at$wKR
zk>jA`Ek)+ZuW+=Ggwgt8by!BJgfw%hRKkHmHTyYH&)^*06;QXWfR^~j<|tD>9z^Qu
zAnb~4L_9UjVm`&6LNkLZkb&5<`!nKI4@Rq}N;akq!o;1{;f4!Kz;?QOF3AR5Pv<ex
z;0nbFUqsRrq)F>grS@XbvxEU0XA{2cU8@AfwIZs7U{>&dc+e)k4eu1z(wW>(vEzL1
z*Pya%pHGP>mjg@VePT27R*$XR!3(Lg&@|HIZ7|C<X(Zt_O3z~C9Y*B&dZ1l6rf#2E
zgDhnQ#;=Uj(_~T}xK~4!{&SeB-mSLJaq6#O(F<>(z1U)k%$86@Xl<evaMTEIK%=1E
z{jDB(S^ceL%(tG7Q}}EF1lSB6D7`w_-dAUQIY;=8g*o~ekr9Z*M>w73U&aLF!P@_~
z|8uN|>99dFO!r4)3<1xIZqV3%qE_<qEq(0I)=6t-Ty%2qH|$f)QmjI%gA@Y=J*l!m
zhGQ4WV=nJBeM=Ih_B0<JNQA(LfP2~lS_ZCXgorzh;Bq}}3k(&9G0Pwvc7`hS0F0^=
z%kfIxZ;|R+CSOq^>CY^qkkxpMSqG6O7>&c!MACf89rR+;RNoqzfdAkxEx!*Wj?Ux@
zzlW$Z1`J+n4@AzwLc=%-V+_t|MOCmqtgJ&*5J6S~Yim+W;^e@BjtGCSv=z_13^8)4
zi{m@`nKX)2)O7SWFfw}aYI!F)iT#PiitJjXoiYEH$tAijyVD5F#WsX5p-W@o7Gmx0
z0PW=TtSfD`EZ5Q_V7Cyxmm*3(eK_HTBqXL6yCgwX*|F|leAbc5u0a9)_s^yO&gkZn
z#(XI46fSV;m|!AWuFwf5b9zk<>De#J&9@8ggn+UVQf@m)Wi!tTG`uH?>zfTXBx>F)
zADbS{ir8@$8dF+6y(!zZFPNRS7nYRmDylAV=cEPS7&OU8jT9;*f7NnvjhwLjn5ey}
zb$XZ>%$T<o#V4R{$#hK~Qz?NID(PW0<ShQxBdVC$%}5>8UtT<BX2DS2|F74XpXr;%
z*`<60f>Rmz28_ZD?*O`_00n5!@YcI6?kidw`VLg=ojL}a7xeQ^2tA=eGhB_R@dzY4
zifLV+sFNA1k-;A#Re!CYdO;jYtPk^NyhPZg7@6|ea|!YU+eqtLyJmJLuyj*Q<d`Xg
zRQYNSj+el73iDHEfik#KuqX|^VCbX-6W@<bJTj@mON1Rvw+08ed+-j#xzF2mAy~Qt
zTuTc#MB~d=oMy$Du0cb#c0+uGG5E?DlHkP$U=P|a;C{p&znRw~<jnEF79#5eKzo!-
zvF4BBGd|?&%sjC<H;xJ$stB2m66w-HcJx6apM0C)C{pWtUXt-i{u~^m!_+K2{J|Uu
z2m}&NIa@0?msYg)=FpZSKyDYMWmTRg&=6QWEa@T&EikB4{-}WC;~2r0)TPTK)p}~)
zO1tEV0FY9@3d5|zgtef2oGnTDhN5RT?(lGus{BX28ez0>Y%PRazBQLFa^?i3ScG7@
zqu{mzvh94PFN7^ZG!@FIn*Ub<riwt6uU8Yq4Yr@OpBtaIFteGMaUFsooh?DOH1R7+
zQjsCkS*45cME>TgIFt2JRNVuHMgxQw27GYg>paym!m?u<VV{<vD7{-Rtx~IWEgq@c
z_>7n2u22%<L5x9|uf){W@0^p@#arMps%1&sWC;mG18972n5T_|o-;(k)Y_L;o_GJ~
zT^zg+8`~LR@`35wGzjME`{Db{bg_v3Z>iCM&`a5)BUu~wxTvDpBx9`*`urHoXhzMq
z3H*$Y_8#$;20Yl<nTsFPRkd@7o6{5R9c<_n785OY>8n04j}EEa>suC6B}cPUi{a+w
z*GjI7T4H)+-<KqOwr>D`oKRA|K9OE<(o+2YvjFGEQ|1lvJ-i9vw2xF7Ctv%5KI1B2
zX45QUSd2I^Bq_*fQPn~C+8`nQ$n^<SKzJDW{IDc1JY<t`b#gBwZ&IOk{C&{Tk&X>V
zj<Da>&s&XW3)KX2f<sutoq;OU#p%>{_kLDHav2|n(BO)Eu7^JU<S`(OX}+WzJdB(?
zli%cTX8Hlo#8p(cN9J^Sa)mODj6>nSk!gGzfD_xoNe8W@Naam?%gV-^6ZHh|{?)v-
zfvhs1^px)iP}t_FPG+>V4E?m(!a#S4QAQw(QLT{;Zs^V-2R97GU{ECCk`X&J<(KrI
z4Egl$SIL?(lt`Ge`Ov6^J$FQwN}%>@Fb$3CThEHVcyL){2Yc%)y~xZB!Qg&$Bzc)K
zmHZCz%pnWFa=OJJ*2`ung<FHcqEaN%>^+iy$u}*Gn7EQ@lA}VT+<7n*(2r~c(Ihx8
z&JYNxTbFf!zz+fSl-E?Yn1X8A&E3f0K~1F=H?+ucyf6hf934ENWZYR!wc80&w>bT$
z(KiA(L!LxcbTDkN$eh`JTSb}@D44Pm0l0;<QpIkIH>oVBr(ZEawR+-m$UjwtTJ{Ah
zgzZ@qz6IPC6Vv^b`=S23(Q=l>WtoUq*}bbIGEqe4<baKd^u&^Uoq}gEpXXIS)AqLF
zz)GvoNrjjsivN#d|GZ`z=`bu(qSwnO7D+OTfP)`H*fdgd`2;=AX5mI~EPzPCRTkuc
z0(4RWL{By<c;vLwu0Us$R0r8}vX8cNXKv+jnc(kkWM2@m@}Z~gp#xWr_+?oKuLoWF
zXJytQ`9n4>cr$6%!@)%DPbR2fT61t2U02YPaVlox+Hfg|)p;q5L@)Nkh!$*NbDQ?s
zqP}e71aA^^;kP=pgu`H~>bSjI;zdC?X(?*6_@NI7_W~uX(PE8ou&d=MPDQ^&EI!zx
z+e%I;<0f~z-1!l)|6+jW?@(BkVM;9FrKcG<Xq33lTo9i-`Rvt1JwD}ge~*`gOwLS_
zD=Q!pkEgC%%KYpsxIc=gW!VzqE2Ksq^F~YS0QCD|Umbre1m{+m!;i8GL&wE^&df-n
zz@X`LqSU#~)UzDv5#xc^Cp1B2Iv)bk9j%1P!0$QQ!m%DaD=JfF1*qeeKn9GqnObBT
z0>QjPFgTZE$X%CINWHkQsa>#~a3)*{8mmGmFqu=p-HbL%u_%NUcw_=OWVN)2E>)+M
zRr!43S98tLp7M(kVKP4yMxZP{Q0Kn9;LX7xs`^W|z$9MwJz)*D^D<wRjEd3;AiyEH
zAe_o_ZkJd(k(*BcI1Po7v==D{hnH|TgG6QTBs0@uq#^T9)kA71qZLa6)j!9RP!rPu
zu8fyES0vby9|TWm(Gf!yhyV>p0+BQ|(|Sfp4PB-zpt7SksjC6cl<Fcj7`ynL1qZnD
z&-|y*xoUZwC;?fV|9>TmI~*Wh`13|WHD?sGKBIMvm};l@>44D|A&pLhXEHU%)WD;+
z>C9}S@?%=eGPoZpjc4I-<SlcRs!<d0*I<U<jEy@ai;=me@(TxX=5Lgu0ZR=|Axn}p
zZ!fN|ZMr>+mcWEF`=Kw`lG?b`C6fZw!IGA?7f3-oOtKhh0b>jc8b(+H-N=E2YIZU$
ztbcs>qj=w%E|SRO-r)W#oXnrZSmtF*#1r(q8ai6K6wTku1Twc&ZW=&a8L1Ivb9)3c
z5y#01=2t2P_>}9!QYOBZ<*M!!kJJWp1Nr2Mc@tkBzy5&?JtdFldv|=*@FBT@k`LKH
zn1qip05v4`b9NfYGaSnzoTZD682pVnada>UfuIYQD&%uu4l~{XD+?m5tRDQ1ZdeJg
zQW|vm$k05#-Rwfxa4!xvyqI6%cgD(`#GHXpF+)L}Hrz6W{<D$Q&JSIJ(h@F|hQ=Os
zI>Q=5^h5fxNafQnXF0aDbE{mW-OENKRmd)u*d+IkMKUuoBk?LZBWm{LrYd2=;ga1U
zIcp>k!im=sz1;xZD(PbSnMU|20|lZW&dJo2hA+4f{)u54m@_GQ>LfO9;H0JkQA>I6
zZj4)P&ht)3=MJ<BLq|!w*(0*Gq=yE}IzIB47i~zyHEh<p=&83r5h^+}&CpC{J@|P}
zZ#Z!FieM;jPmd?Ol4>wV;h#eCSz#gkR4T-vSQ0!!$D0qvVC6sAR2n$Hg=A)U!w^}}
zV4?&a?JL8Z7jDt8z?g|N1>y5z?)n$PCy*8O+v%qTaQo?-D6uKVr6QZPsoAp`-!5L`
z63&Qr+P{FDg*<VgWjldR{#+l&%TJdZS#t1ZOpMrl3z|Y2vY6@o<V)MhWaJrrBg)DQ
z%`Be(r@OBTtLlrsJxGIqfP{1j(k&(3A<dBxB&54rT0laO25F=_1p(>qJc599hjeq-
z@%MkY_vL=yeZ4%fH*4)ZSIo878q6^VZL;KW0^WBf6gsGO%nnlF03)Ydk7u_n^Lt6u
zfp`PcywjYW>G!er4@gWeOv8w!`aFC3)eX_?UU0|=g)JwsHmBY_Kk|Z^XJ{mFu_HcO
zp`r?8{q~mZk<)-(7G4#Sf6?ma)}5i6rsxb+cWP|ehY<YiT#Dh4!%UG2>-?<5wWmm`
zbZ@`VPABp9sLbnFHIyn$NPWz2v@Bgypv#KSlef%iP~;EVxmEAiF!64uswjTL80*K$
zvBYIz>szVGplNqeB&TPLJDd<HVWl>qm;Ct94|DrX*55NLYw5s85tV(YZOxHk0VIPj
zGQ%O^ft|1AA<bPL(<$a`_p74ijSSeb6-QvB`v9<t_qon%#|b|<O|?E)Q|}cH7_lm)
zKFPdGz^=+4N<6_$MQzchawVZ!*Dd?<r>C!;hWck^ZqvC1^xCN?Ni}Ie$aI&bcG2S3
z0BOLBmt3bT=g{Ykks1Q-MZQ?$b)9$$E5nq5H#kBFv8}jaKSwAaPwV65e5|No5;_dk
ztWU-9dm(>nb9>oEyzMT6bK93;2p(q7Wc_49&=BhtLJ5Y=)vSrW#kUpXJ+ay^&rx4t
z974`XEa|S35SBM4TJuSNI(ro<P2{y+Hx*1;Bv4D8MjSoi+Lp?uB*GV?&!}#v6o{R$
z+8HYD5Bb(VLw-Ji?Ef7L-|4r}+-I!%Ki#5+lI&0Wu00hwdW<iEtKOsw7kICDfZ1dY
zW|MA?`9R<3qJt=8t%J=!OM+j!Q*3%vOSl(_UQ@$bXPA(rU0rj4(a~<3h9;$?aNMNO
zHLS((#X3DJb1mtC)UVja`e`OAF>SG@jP&E)hC*CX5*Va|0k5<oUtcZ+@+3T#x_HL(
z!wBsn(MdEMkzyc*U$aoJVKL;3y9GwSL`002rX)#3$%x3^4$f%N+oH~@oA&UralA&?
zT7$LeXWX5l{R$annL4kSDZ5BuUR2LYWUi*M^s#K?QT>!hW4Ur`BIh8q0V(v=WESKg
zLsp8Ma^lK_o>~a+A;yxE7m<JPvuUbGnV$hlv}mI8F*0~hV~<Rq{rD7aQZFVKCDYFS
z)B^KRCroOgH}c1IXMyWaZ<~mIA+mV{m8SizLkl*arPIcS0X5bt9aZ%Lrf1GpwI3C%
z$;&4F=DHH41?7J6xHlAOMKOk$lZ-b-_F#sS#47PtDa;KvD4C@xDnodbo^G<~5zJkL
z^T*@~n^01E_gX=*1Gf3-R#Ez85h2ZGNFi%E0q@k95G(ackC??_vl)=An+20{k<BT~
zLkdLfUgbwE2P0h3_fb9ZGYBDdW}{tiwTqNK;y4+ui7F-GaR+GEnFlTxzqi&cEfui}
zO+bg)Vj_G=fh}tzo5jU;zuKnxdv7UUzO5;(YDP1jUnTDqiLS_)j`HcmihnI{J{hUc
zdCa%Tt#1!a(>Nf9Do8B>67hWVtJ9gRNb(Y2sL4erezpm-#lFy71WzfiH;J`DynLMx
z`ms=ro|$nan<1@LyHc7&M_AdE)r^s{SVx__^8$Or*vIisI{6k9f>iFk!pYB}JqWy2
zo=n^H<TQk@J~cISY$8zMB|N#fz{0}7entm*k*i+|3xbu!I~TteGCQ57ylbm9k=cxM
z=SM*T`xQO$lj`ls%|&|I7H!$8=yIF&0o3A>8NE{B_wQrA4$SG653rW&><-1~5h-L=
zQqgZ#_Ay&m$nWrSr?~8o8HnB5BIR)U>DHN7WW@yA{t~WZ;)o0#@(j3z_{UI{KFCw}
z|FHvWuk=NgEZfyq|70{dGInnpSk6Ghl>~AClk+%X^vKbbm#HRphLpgX`3(+pDocsR
z@bs6WuDlPX?h*X*Ci<ny@|Ic*`0Px(&C<Vxb+r=N(xIDq{fjgR1&zNTrKpx%n-)X_
z?y7E->%KdjBl%P1{N|Q&O9K}H5HU^KwD=?+n~g7@hmk^8%Yqpe-1gYyIuD&%i-eRS
zL(9Ht?>nXMXJ?3WufH*UO_1Kl^x_9n8q1G4+dQUR+*R$q3dGpj`19uh=5!<9eTXmY
zASXHgW<OUv<hhXKwkWjhn?|r;<ngoEs0a>=s@W@CiMumFPh8$V=8aE6q{*?2i*7z-
z-VEv-r*NQgu^|T_`q%qE_PXk7A7FF!=&|}Ve(Oq!6q-aQPHb(Jsaoz(IZi#-NpXbg
z=S_rH?HU~;k>#&kV#z+*(FO5p<lx0A!%%QHNCXwDnedHdUh{cBN|($xLQKatR*1%o
zGNwYNWBPSMfcB)I#e9u7(_^Vto|f4}hzyZXIXJp3mvcR=C!RJ@^it`Njwtg49naga
zsY*f`7NWdnq^~CG_%uuqQ(HibS+71~pYt!va4>X5h-6D#0^5qUMbkWuK$2EWe0-C;
zk&`Y`&smc9tEf?()b=Mc&CYEq&u>{I4J2mbQ_|v65EfWweCM{~Tpn#=hWkpbysW1A
zn!{t8Q(wAVlLj#`<!GEwaiiM8WjYp1@pPY%W>+WN8lGwL$A9QDE=qeKMrIs}`JMz3
zFa1gzsSZO|e3;8kW-c39)sX(sKaffnH{`WigZ#wFxlG>a2O2s`w}im+*BF-3{iwu9
z9CFu>XGuv2#gOBX4>gHzSRm(r=uNknzLFzVqHaGPRMmca5{~cZFxi`qjEV=XFz{Ut
zAyQ7|u>>lp6r9FgKtFD_;@!__sPpECv^e`TTrQ1v1w>!lECZR)NLT)Y@2g(h#Xi0j
z`d1o4sCiABp`B{oSwU%x-i%I@rdDg6c^Fy>cy6URP;n~?8)m<qr*vjm%mfV|>ZR|l
zMWh<2wMKU0UC>p3B+XgClKC*ZE>n^qXY1mJwQgEYf|EzA$Q#ob%e=JjSFp*VkyH&%
z`YmU_F7>hhs!B6C+nJ7IP+2tjENnKKA?&!)1%ykFffgF^E03dr1ZEt;tt<l)z|J!U
z1xG<t;d;`$#ZTlJKo9iqYVSjT<}HxxTX;W62?XJY3_RKspNxa%GN@$SrXTtgOo!d1
z-|X)<R`W$fHH?%K3gQaZ6EI}_JzK{SF~KNqo@Q>hxiKmWsY_&Mwz2X=bm^}6GEV<O
zvDOzFE|4NovW-lm%*xEmj<Vf%RzMZ|jd-X4DN9J25!cv@(Tfn5Gw}r`lPQ-t%7eNU
znfn&+raNCWDFWE7VzPbz!vMs{?k<)@-}l9+9s^~fp|1ipH8m$dvTM=m1kkvQe}8u@
zgBgJcNjS?81i_2AY>h46=u{a?ySrbsTr3I!wJ)eESkZpqgZRjlZF8T6r&CtE7W%M3
zBmI+W+YkGjganV(p1BRyvgDhbDtzGWvXQ1v>2y)B7?EHq;7-u-Rwz;nSG~1Uk18zd
zFtSWj^f6?V(taeCyE<kq!dvI~+vpE*7*!6i@&WWX|9ZTJ%@yckIFro&_xGw7_0=zC
zFmd5Aha!MHcF=lrFsUNyTf!}{8p#bU(>=3)IJa+!gi(f#rJIt?f68DCwU3&w?$}R=
zw3I)r!V-A2RQYJl3y)d0zH$ze1X+GUizKZgjRw7aN309?L;sVVG%KAarq<pqf+lN`
z1y(OB46(v?f@oa|JEuL4Ir#9OPm}aUX<u(MMny|n+vk`V{(+DFcSjRhSy|}f_;{7&
zWIo_r0R9_-(9B6s6e&BPS%_Zeip~)d-onM4fMnWkewy7*y8HH-u)7VH5H46V_QgyF
zmWy0@oPQ4Sf6}dj-fw+`Zj3c8aw(L&o0v^)+Jk-*!+neHh|<wd=J%*5`5{HJfCO#S
zHBu>W;CDy#xf%DhwkUm8(T^vQHi-t!uIAI^bdR!go>(Otp=<L9F4mm}j>z;<&irQW
zZR?n;vqmrkLB%?re|~}x^g|9@1NQ}2plG`{j|?<DuYYffG%S6%nTEFh?I8`tq5J^!
z?M@dNT9&1@U}a;?&760U=Et&EP_)tm8{R$kQRcFTb7S$kW;9;SP#tnT>hO*}GwCZv
zr42HZhYm=xi*&x)xs!j);M-FAd^JhtRQ<z!kc2zmOX8gT{d8fPrp4y>)4<gv1CK}i
zbBN2`mZQSXfxoOPT2A+{4S|R8EqbgbbD9vcXmi;8{tkCVAP6QQE87bfVtcs1F;95s
zwfzk+HhqDT@XcP$Xf##>Gu&3}Qze1sanH+R)Q5$5+v$59X?B$9Q_Xq}yoVpWRzs<>
zi3+5;iCn%4WMTZaGPbfYIyxu9FX(WJNJP2oNCYN$q!a_@%A!PosNU=9tXB+w{n62#
zd+NRsxv{iZaPgDblVslQnah5rxEqtiLAFbK<$2ufd6KW3er@h|ZqE1HK@xhEsAuO1
zs1t0>M;)!n+ipN1gM2=8gT}S4S5RTFPe$^TiNH#!sD+HgF&`J<uPn-^nu$iESBhN;
zwA%xp_j@y*>xtuF&VND+i+ORGPVGo#XvExg-)V3te`)CErW$z_5tk$~$a5XzhZ15T
zLE~N3J%I_d$GbvC0;AI((KMZm2>m<?Vb>1f^EmngWSX6UJ|7=<!qxR|#l!TwyJ@%_
zF%a&xY1yrYeG_$cklunBplNBR<sEC<1qUmbIzzjmZZEgXs?!W-!dZ)=)ve!ZVau!<
z$GNC;8ukzjXg1Q5J~GJ>7sxG`8s*U=PR}!9PZM)&vh^06lauDhtH8#COiV<4*7K6L
zryhz%2m%hUOL+t9wdrTBXvX`h0hgI;XxX<tp8`?b2!>->;zAr_V1n}5z#M>%sQEfM
zIXQ^oz8QVE9Sy<}(Z+oEOZo5@h;jb_QOXV9%)tS?>L%NKAWUWx&4j${`0d9THg2!h
zi!X~wbi1tI2I>-O&`ZQe0{f$z5Tu!Di%%(Mu{%XK_KBHAzGcT4&v(r+-WB3$tumT9
z*Rv2i4nL1eJz2txu5bS;;H=C~t#b!gDFsLG2=>;?a`%?OjJZl9M93+H>JmnP2H>G3
zU;P2>KXgdx&&Rk6Ai5WjsnU2XC$Jw+F~Bz>e5ny6lbb%d2SfFxMD^8v=jt^?6y5PV
z5;}*Np;S^5yaZMaN)j5ZoNcLXB67n1#m}0`Nb)4!+Gsu<kf73bnoh^nSSVs$Ii_Y!
ze^}hOUD#+`h3OCrx>)cQ`@$-XIzw^Z0kOW{jn1}Lw4YybxooLoRV}fBAmlwTCtHAb
zz$G{5j)7RIVOJP#BHF|HyZiNVS;`h5RqJjT-wH@Og7u`r8nT)L#k(N{aVBN230yo&
zC+hhUEE^S&zp4fFTcuEo&T~|lBtDKCP%VOXeW;dJpm?E=jAW1%pDOLNOqZf7KKp1G
zX+_-_p%!(Fs>ZF)*}$vcyZ)7Lc}<q2+S6{}6{*7;fMH$h0QzV4o!?!Gc}9`ER1%9$
zwcSFK?csS&1e<QN$6v6Nmpw0eQ_;FpT*CD^nbhvP(OO?@L59~(+K(`Oj8T?V817e(
zYd-ZQwL<ESIoEbuL8MN}9&@gYS`uuf;CJa6gEwykv}1Jy3ZMiAuCLWLHR{?^8K?Il
zLpjPbjL&_UMyU^25^588EFq9um-eb*#m~bGs}7L=r&#!sVQcQeW<WClI;U{T1$+wt
zKK!C*QyL9G#1BNvKLC1}0FoJ`4e$+k&4!YJ@b_TSTc`e)%C1Lylt05U7wnp^_g{@d
zzFSUJnOLx;($A>j@-=<W5BckS$gZc=H1K2adG0Xm3mJ(-hgHLq?O-OKkE)aMPeT&Q
zSwz(aa{JZPxcwjyy69f^(<calV(}jWFS)Hl{l%vEm;cCYwu5#Roo+h-W#gkZS)g1E
z81OB-<v)P*Ah!*y@)@_;Td?BO${t)Q$9W$#ZUQ~yARzXs2yV^-+Pl}3nyfyc=)8I7
zTZg3$w2DbXA3ytYb$IIcoyKL4O8M1Y+MwTiX``~@66vT{b02FgU{wlEuBj|HUrWi&
zA|7cWr(g$+HA&Pt$DFc-$5~wCGC$w;8Drrd7?e@j3;@Pix*UYnfZe+2@~1IQ2enn^
z)S{A8rGqw0=?uXy+Js7Fx$@$yv}Ohj6Ml*XlS)Bmt1~EryG5m4E*Zh{#CjHy17XTM
zU8FqJxIBV5R%~Bkt53HanvsFa?NOyhG!;B-Em@<XQ_U&jt6~<<Tb+j7&*ymhGNgWM
zf{ylw!k8w*2IA-FY%{RTlhA2PQsjFa+FS@<24`AwVZRQJ8bM4;5<nJ2VR^M(Z^9=t
zI)ximM4MP~iK79v-nTJ*v`>IOe71;K&mVa}&q`*?)tD$SC+CUB9vh`jL~m3P@C(-@
zq|mzar!?0$DMpFaVDPxtTPZ6~w}{8GT5$~ER`SEGthijt&wA<Bn&f|NAY~+%_bY;T
z8iv=dDrbKxk4OHlOhcbGm`;Xc<Rx#6Znyk<7o%jY)X$_`_$3McjtWtXs4v+w$GF$q
z25!m0f1Lqb+8dpVr>eb9(Wy?*qB;Ar#;u-aoKCRCtkkDYrCNPfrS2>>$F}=Rxw0z#
zga%e|^4AHd{NoRJpU0D(44q>&vO23uz<1L_!$OI?>Q?q4cCa=08%wOJ;!OYUoBo=a
zJRQ9+XJ##Gc@p$w*0V&}BY%EbJ+C&%HbXH`jFN9q3eZS@L~e^ZS54cf;?4#(iS`)7
zqb@3<`+l?C{m8XW_C*|TN64O)F|lh!Wx7IN%Z%p)62!YQ`#JVMiOaT5?Zc2QxpJl_
z!CW?Txp(G=)Sn7to!vbq`@!p#Pf^dCIm+Z$Yj9P<Sc)=RK&W^SW31QpDPu3BphScV
zpkcZQ%n5NHkEsXg@eh#@3{7?dhNWeNkOj%^5WohDFQR9vGx1?dRQGFFFvc!p&CAjp
zH~p#(b5FrAmlO^&<{*rD@z+R3!oE<S_kCtAgG|A8HFD@hVq?i(h9}%3egGZ}#Lr$G
z&heDKIQ_LEq-*W;TS3gIE@L@i&Q+>IP~CR<L47!%kZG#MNzM|whU*vpIg%juJgC~T
zJcv{S=aK&gfpP%0tY7fIr<m^;MKRXpRFViANSE+%L)%Pe#+jD2IyiQGjWlcP++?DD
zPKLCQtcMqk)qb4RuHZat+aPGg*m9^1wjbIhrjnDQ?mUJj?CUzd-w0Lj=_tm3&D#Hb
zK`*V8x<2vmSqrh;<Y+jbrEUNkghT_!#(=Y`VDM^m8HV)-4DfDD3O@1~i@Ltt5Om{|
zTWbbaFTBsdj9_-3317}UyH|T^=w;c=mSCl4w-m$y!-e0C79eeIkGz_&t(UnZT@@X*
zKIOzW=~_xDoauHygfLD@=}3vH@3?MWLpPwEt&NnHrDI!yh4AX|k#v)VSI6FYYi6~e
zh8I|@cU5v6rS;)S!rQ3f=^f=<++26_vd>BhR}xkF^en{zgi+-|sc)J|Azn?d$O}8G
zay?r93rQp<-rC*~&Qcx66q>_G*{){eY5izdLYHc1kV!1TxL?opd?1D0$IgX(s`;4M
z0sdwTxC>KdkGpC&JqyX1S;kkQeqLw8BauG=fhb(5HdrM2<)1ps*u?kVN+*5wDF$y&
zdqaWf4+gv!5(EI0f^5%_g~%MXDd8)n>Oh$HCDj^9tkDt;K-3sWSY=**n(?ZfQ$7~M
zv~X#u@m%K=)<<oy+5q6BJG{*#@Gf&9ulMQx*-+Zfqmh~uc@@83$k#jiy(Kn=v>>_2
zRF-2fc*+TJ(L<Z32^+<KW95SXL4eGjx6oy>&?GCsN|fZdq|OKf^NWn^l$O~Qab(Jj
z*qq|1PHHkVfDjE5Rdi^>mVp!oH@IAK`-ciY3SsIS7nO%3=!_a`?Rda)r82FtG%eRa
zyf}9z(U&^OGIm;ZFEj`ws$9~mX=!@P%UtC`sNqBxEFzEq&|>qP0_!elX)a`?O$US5
z^b4C5Lb1&6;ymsJC!}oGmZGAiEkPtmTEx=)q;FreetzdNu^fC!d(Ts`mvP_Dgp1--
zj73>mJ`s|tS!9UF#5G({h~o{q2NRMSAq2@PxX~B#a>NcbG0$DM%m0B5yfZyAqa62m
z{7Yuev;swKWcnu4jF^?Fahc3x5%z%FXjBH#(A=e!sMdn)*31BtKiQmTmFvtIMM4^+
zxXInpFdR4X*t}NLu2SlkP4`d0TT~!oph{;IE8H$09wL>r4+Go@#%E~5E4R8`9U6wM
zRQCfUQH6^c`k{}+oc}(BY;E6nrh7ie4$Xyo2<(buMy)VeI6LD?`z%4drqHBS`{%f;
zh028y=r!*qoP{f*KMwqJ=)m>{q^NR3@-jNleo_2!LWr1HjhWq@9Om|ss(((S2NUGf
zh4Or6`1i8Io<a=RY@slvMvzXbTwy_`=-<%J84p%vFcyuwB0+eF+=JpWJC{8M;V!B;
zHtFh-yX%0j+BZ-UA`@ws6ID*@)g;T)By;MbcT?QC?9i+wHqbIp9-SV93Vr3gg4)lB
zUI&4o^vX+#YuX|D4;%!AcPgsP;zD3=e?$B;4m#bhc*wD3-x-fxzHwW3(4(MKXLXU@
z@+g77D#F*js$kavV!<X-Rd5p~lAO}Hyd?@-X_O&HBoWq^eO0-_7l7>D6uq@A(md`O
z47W7wXoxF1AZlY}`{>HgZGF>$|C-w;YHZnopUn58crM@mz;gYq)uB~3vqUJc_w*Tj
zN`qhc=bqgehF*iAgkO;PqA~pYdoAy8o*i%<-6|=1H0wg+!cT@RyVO35Mve`tZ|MPl
zA_L=720l^nQuQA}Z^CaJ{y{i{m$0xt4a%FhBXNb-)9VcXXNWBpU(|o4RL{@gP%J1p
zo^-_f?~VM|0I&P6>c5BgLb`yuJ3Bb5$;Z*}1Gs}$CNf#n@BaF1x1q&TCvjn6A*^x1
z=~uNWfQKl!-uG33tR5h1z(KIM<?Q_wLin}#jy=4od#_3jTD$<c(i;#WL4E-S<*%1(
zaVm?Bz2rftI0j(HE{;lG%PQ;xsHgDULI`b6U2u@&db=RgvF90(6u-S1^}FZuJK<Zp
z8gU0Y+-GJe-H1!Szu7TZ*e;O$Yln&dav&z#WxvV?r-!=>oM&8g@xXFSP<d}}ulZ^t
ztzqsK?6Xrij5<KF7za>BFFF}qWQS6C0Td49+jk(S4QKR=-Y(-T4Q2h;6|nyQ3;5!t
z_mnm#PFZjpV01vXS_oiTrDRo(t3A|`AAh?{zRtX!Dv;=hrwcglXZU%0JZNt=b}tr8
zAp##~L=1Lt3m_swf`Zk@(b3Vb0b3VVx$KXKz4h%1=z!k`QQrOmyk;#UqDmkGUZK}8
zLMZZZdm<T%y}%fB&iY@g#s1|E;qbXUDt)Co4u-~iIS-`3uv-QSOkbTxN_A?0$~d~W
z6*x-HISeMUir)YIOvI}D&!T>D>*sT9AHCsIqSs%7!wl?wGjy)NAr!gjM6qtUK=f|A
zJqQ(kNHS%=0~p9Y7_Ni8y|(}s0Rr3?^r-tdU`YWJ3>DJ0bhog?s#m{P^6qX2&gM5L
z9!}<5h2u{ZfY`a*8LE;gB3z1lF!Mh(z!~HGiz1r<fUP!0(&xR0;r#@-?uv;lS0F#q
z^-f8Jf%7o$53`T<<o`9*y?gfOy{l68eM&{kxh~Z6WMde@VKJ69SI*XYxdO*UDju#Y
zO2kjg9LB^^S@oMv^_H#)A$zc_JEVW3S@pvhV0k6#02C2vXI<|mdN;&m5359gSeeWN
z$?*dqXzzD9k<{t}Fn}rSS}>3oKOgRv?hf2*j=@EUox9=KJ>oz2gz0kvEU=34Qx5S<
z8`#lu=bQ4kDOw-aVr4&Klcyp}BL%;=1jA5HkhIzpg$R)XIK$6I@Q(Y_0#V>e-ZdXT
z3!lR-|E?k!qN41J9{GC#M<KT02jlyuR2!aTtEgkX)^hS@@uC$SpWbKR`W@zT&^0N*
z|AZF*VnejS7})#W%$LR$WPZ4g*HG30%w!?p9)J?h2C^ssq~!|K<+GiuRb2)x-P_u_
zTw@Sz1X*Hi$!h&Ts1TThC?qrG`a+(^Yalm6rt6H3NpG}1cuckFpaH;;Kz1*WsY11E
zY?^Z2I;%ZcRhgjYN;m_UvIS&+K|Tznw3qvTdnrZ1JQEZYgyX$>c8#XsT+IwEMdQSq
z=dut*7640<NgLdNX5iSek;GM?S6Wxe4==|;MNUDIwmB%oU#kRqHqlwERl*g0d3WgN
z2N0rYa40+a(+)qZX}!^}11RD?39y<V``>~|a=^0s-=c^AKR5o5h3kJ`75~2|(DQ)0
XE2Z}!g(PbT0YCE6%2MSLhJpVJKUj!F

literal 0
HcmV?d00001

diff --git a/demo/documented/neumann-poisson/python/demo_neumann-poisson.py b/demo/documented/neumann-poisson/python/demo_neumann-poisson.py
new file mode 100644
index 0000000..ac37eac
--- /dev/null
+++ b/demo/documented/neumann-poisson/python/demo_neumann-poisson.py
@@ -0,0 +1,70 @@
+"""
+This demo program illustrates how to solve Poisson's equation
+
+    - div grad u(x, y) = f(x, y)
+
+on the unit square with pure Neumann boundary conditions:
+
+    du/dn(x, y) = -sin(5*x)
+
+and source f given by
+
+    f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+
+Since only Neumann conditions are applied, u is only determined up to
+a constant c by the above equations. An addition constraint is thus
+required, for instance
+
+  \int u = 0
+
+This can be accomplished by introducing the constant c as an
+additional unknown (to be sought in the space of real numbers)
+and the above constraint.
+"""
+
+# Copyright (C) 2010 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2010-05-10
+# Last changed: 2012-11-12
+# Begin demo
+
+from dolfin import *
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(64, 64)
+V = FunctionSpace(mesh, "CG", 1)
+R = FunctionSpace(mesh, "R", 0)
+W = V * R
+
+# Define variational problem
+(u, c) = TrialFunction(W)
+(v, d) = TestFunctions(W)
+f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+g = Expression("-sin(5*x[0])")
+a = (inner(grad(u), grad(v)) + c*v + u*d)*dx
+L = f*v*dx + g*v*ds
+
+# Compute solution
+w = Function(W)
+solve(a == L, w)
+(u, c) = w.split()
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/documented/neumann-poisson/python/documentation.rst b/demo/documented/neumann-poisson/python/documentation.rst
new file mode 100644
index 0000000..f17b2f2
--- /dev/null
+++ b/demo/documented/neumann-poisson/python/documentation.rst
@@ -0,0 +1,115 @@
+.. Documentation for the Neumann-Poisson demo from DOLFIN.
+
+.. _demo_pde_neumann-poisson_python_documentation:
+
+Poisson equation with pure Neumann boundary conditions
+======================================================
+
+This demo is implemented in a single Python file,
+:download:`demo_neumann-poisson.py`, which contains both the
+variational form and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation in
+:download:`demo_neumann-poisson.py` of a solver for the above
+described Poisson equation step-by-step.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+We proceed by defining a mesh of the domain.  We use a built-in mesh
+provided by the class :py:class:`UnitSquareMesh
+<dolfin.cpp.UnitSquareMesh>`.  In order to create a mesh consisting of
+:math:`64 \times 64` squares with each square divided into two
+triangles, we do as follows:
+
+.. code-block:: python
+
+	# Create mesh
+	mesh = UnitSquareMesh(64, 64)
+
+Next, we need to define the function spaces. We define the two
+function spaces :math:`V` and :math:`R` separately, before combining
+these into a mixed function space :math:`W`:
+
+.. code-block:: python
+
+	# Define function spaces and mixed (product) space
+	V = FunctionSpace(mesh, "CG", 1)
+	R = FunctionSpace(mesh, "R", 0)
+	W = V * R
+
+The second argument to :py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` specifies the type of
+finite element family, while the third argument specifies the
+polynomial degree.  The UFL user manual contains a list of all
+available finite element families and more details.  The * operator
+creates a mixed (product) space :math:`W` from the two separate spaces
+:math:`V` and :math:`R`.  Hence,
+
+.. math::
+
+	W = \{ (v, d) \ \text{such that} \ v \in V, d \in R \}.
+
+Now, we want to define the variational problem, but first we need to
+specify the trial functions (the unknowns) and the test functions.
+This can be done using
+:py:class:`TrialFunctions<dolfin.functions.function.TrialFunction>`
+and :py:class:`TestFunctions
+<dolfin.functions.function.TestFunction>`.  It only remains to define
+the source function :math:`f`, before we define the bilinear and
+linear forms.  It is given by a simple mathematical formula, and can
+easily be declared using the :py:class:`Expression
+<dolfin.functions.expression.Expression>` class.  Note that the string
+defining ``f`` uses C++ syntax since, for efficiency, DOLFIN will
+generate and compile C++ code for these expressions at run-time.  The
+following code shows how this is done and defines the variational
+problem:
+
+.. code-block:: python
+
+	# Define variational problem
+	(u, c) = TrialFunction(W)
+	(v, d) = TestFunctions(W)
+	f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+	g = Expression("-sin(5*x[0])")
+	a = (inner(grad(u), grad(v)) + c*v + u*d)*dx
+	L = f*v*dx + g*v*ds
+
+Since we have natural (Neumann) boundary conditions in this problem,
+we don´t have to implement boundary conditions.  This is because
+Neumann boundary conditions are default in DOLFIN.
+
+To compute the solution we use the bilinear form, the linear forms,
+and the boundary condition, but we also need to create a
+:py:class:`Function <dolfin.functions.function.Function>` to store the
+solution(s).  The (full) solution will be stored in ``w``, which we
+initialize using the
+:py:class:`FunctionSpace<dolfin.functions.functionspace.FunctionSpace>`
+``W``.  The actual computation is performed by calling
+:py:func:`solve<dolfin.fem.solving.solve>`.  The separate components
+``u`` and ``c`` of the solution can be extracted by calling the split
+function.  Finally, we plot the solutions to examine the result.
+
+.. code-block:: python
+
+	# Compute solution
+	w = Function(W)
+	solve(a == L, w)
+	(u, c) = w.split()
+
+	# Plot solution
+	plot(u, interactive=True)
+
+Complete code
+-------------
+
+.. literalinclude:: demo_neumann-poisson.py
+   :start-after: # Begin demo
diff --git a/demo/documented/nonlinear-poisson/common.txt b/demo/documented/nonlinear-poisson/common.txt
new file mode 100644
index 0000000..0f19101
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/common.txt
@@ -0,0 +1,83 @@
+This demo illustrates how to:
+
+* Solve a nonlinear partial differential equation (in this case a nonlinear variant of Poisson's equation)
+* Create and apply Dirichlet boundary conditions
+* Define an :py:class:`Expression <dolfin.cpp.function.Expression>`
+* Define a :py:class:`FunctionSpace <dolfin.cpp.function.FunctionSpace>`
+* Create a :py:class:`SubDomain <dolfin.cpp.mesh.SubDomain>`
+
+The solution for :math:`u` in this demo will look as follows:
+
+.. image:: ../plot_u.png
+    :scale: 75 %
+
+and the gradient of :math:`u` will look like this:
+
+.. image:: ../plot_u_gradient.png
+    :scale: 75 %
+
+Equation and problem definition
+-------------------------------
+
+For a domain :math:`\Omega \subset \mathbb{R}^N` with boundary
+:math:`\partial \Omega = \Gamma_{D} \cup \Gamma_{N}`, we consider the
+following nonlinear Poisson equation with particular boundary
+conditions reads:
+
+.. math::
+
+    - \nabla\cdot((1 + u^2) \nabla u) &= f \quad {\rm in}\, \Omega,\\
+    u &= 1  \quad  {\rm on}\, \Gamma_D,\\
+    \nabla u\cdot n &= 0 \quad  {\rm on}\, \Gamma_N.
+
+Here :math:`f` is input data and :math:`n` denotes the outward
+directed boundary normal. The nonlinear variational form can be
+written in the following canonical form: find :math:`u \in V` such that
+
+.. math::
+
+	F(u;v)=0\quad \forall\,v\in\hat{V}
+
+Here :math:`F:V\times\hat{V}\rightarrow\mathbb{R}` is a semilinear
+form, linear in the argument subsequent to the semicolon, and
+:math:`V` is some suitable function space. The semilinear form is
+defined as follows:
+
+.. math::
+
+	 F(u;v) = \int_\Omega (1 + u^2)\cdot\nabla(u)\cdot \nabla(v) - f v \,{\rm dx} = 0.
+
+To solve the nonlinear system :math:`b(U) = 0` by Newton's method we
+compute the Jacobian :math:`A = b'`, where :math:`U` is the
+coefficients of the linear combination in the finite element solution
+:math:`u_h = \sum_{j=1}^{N}U_j\phi_j, \;
+b:\mathbb{R}^N\rightarrow\mathbb{R}^N` and
+
+.. math::
+
+	b_i(U) = F(u_h;\hat{\phi}_i),\quad i = 1,2,\dotsc,N.
+
+Linearizing the semilinear form :math:`F` around :math:`u = u_h`, we obtain
+
+.. math::
+
+	F'(u_h;\delta u,v) = \int_\Omega [(\delta u\nabla u_h)\cdot\nabla v + ((1+u_h)\nabla\delta u)\nabla v] \,{\rm dx}
+
+We note that for each fixed :math:`u_h`, :math:`a = F'(u_h;\,\cdot\,,\,\cdot\,)` is a bilinear form and :math:`L = F(u_h;\,\cdot\,,\,\cdot\,)` is a linear form. In each Newton iteration, we thus solve a linear variational problem of the canonical form:
+find :math:`\delta u \in V_{h,0}` such that
+
+.. math::
+
+
+	F'(u_h;\delta u,v) = F(u_h;v)\quad\forall\,v\in\hat{V}_h.
+
+
+In this demo, we shall consider the following definitions of the input function, the domain, and the boundaries:
+
+* :math:`\Omega = [0,1] \times [0,1]\,\,\,` (a unit square)
+* :math:`\Gamma_{D} = \{(1, y) \subset \partial \Omega\}\,\,\,` (Dirichlet boundary)
+* :math:`\Gamma_{N} = \{(x, 0) \cup (x, 1) \cup (0, y) \subset \partial \Omega\}\,\,\,` (Neumann boundary)
+* :math:`f(x, y) = x\sin(y)\,\,\,` (source term)
+
+
+
diff --git a/demo/documented/nonlinear-poisson/cpp/CMakeLists.txt b/demo/documented/nonlinear-poisson/cpp/CMakeLists.txt
new file mode 100644
index 0000000..ca1cf26
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_nonlinear-poisson)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/nonlinear-poisson/cpp/NonlinearPoisson.h b/demo/documented/nonlinear-poisson/cpp/NonlinearPoisson.h
new file mode 100644
index 0000000..3618a8f
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/cpp/NonlinearPoisson.h
@@ -0,0 +1,2550 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __NONLINEARPOISSON_H
+#define __NONLINEARPOISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class nonlinearpoisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  nonlinearpoisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nonlinearpoisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new nonlinearpoisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class nonlinearpoisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  nonlinearpoisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nonlinearpoisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new nonlinearpoisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class nonlinearpoisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  nonlinearpoisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nonlinearpoisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.166666666666667, 0.166666666666667, 0.166666666666667};
+    // Quadrature points on the UFC reference element: (0.166666666666667, 0.166666666666667), (0.166666666666667, 0.666666666666667), (0.666666666666667, 0.166666666666667)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[3][3] = \
+    {{0.666666666666667, 0.166666666666667, 0.166666666666667},
+    {0.166666666666667, 0.166666666666667, 0.666666666666667},
+    {0.166666666666667, 0.666666666666667, 0.166666666666667}};
+    
+    static const double FE0_D01[3][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 12.
+    double G[3];
+    G[0] = det*(K[0]*K[2] + K[1]*K[3]);
+    G[1] = det*(K[2]*K[2] + K[3]*K[3]);
+    G[2] = det*(K[0]*K[0] + K[1]*K[1]);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 168
+    for (unsigned int ip = 0; ip < 3; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      
+      // Total number of operations to compute function values = 8
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F0 += FE0_D01[ip][r]*w[1][nzc1[r]];
+        F1 += FE0_D01[ip][r]*w[1][nzc0[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 12
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F2 += FE0[ip][r]*w[1][r];
+        F3 += FE0[ip][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 22
+      double I[3];
+      // Number of operations: 10
+      I[0] = W3[ip]*(F0*G[0] + F1*G[1] + F2*F2*(F0*G[0] + F1*G[1]));
+      
+      // Number of operations: 10
+      I[1] = W3[ip]*(F0*G[2] + F1*G[0] + F2*F2*(F0*G[2] + F1*G[0]));
+      
+      // Number of operations: 2
+      I[2] =  - F3*W3[ip]*det;
+      
+      
+      // Number of operations for primary indices: 6
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[j] += FE0[ip][j]*I[2];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 8
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc0[j]] += FE0_D01[ip][j]*I[0];
+        // Number of operations to compute entry: 2
+        A[nzc1[j]] += FE0_D01[ip][j]*I[1];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class nonlinearpoisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  nonlinearpoisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nonlinearpoisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.166666666666667, 0.166666666666667, 0.166666666666667};
+    // Quadrature points on the UFC reference element: (0.166666666666667, 0.166666666666667), (0.166666666666667, 0.666666666666667), (0.666666666666667, 0.166666666666667)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[3][3] = \
+    {{0.666666666666667, 0.166666666666667, 0.166666666666667},
+    {0.166666666666667, 0.166666666666667, 0.666666666666667},
+    {0.166666666666667, 0.666666666666667, 0.166666666666667}};
+    
+    static const double FE0_D01[3][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 27.
+    double G[6];
+    G[0] = det*(K[2]*K[2] + K[3]*K[3]);
+    G[1] = det*(K[0]*K[2] + K[1]*K[3]);
+    G[2] = det*(K[0]*K[0] + K[1]*K[1]);
+    G[3] = 2.0*det*(K[0]*K[2] + K[1]*K[3]);
+    G[4] = 2.0*det*(K[2]*K[2] + K[3]*K[3]);
+    G[5] = 2.0*det*(K[0]*K[0] + K[1]*K[1]);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 360
+    for (unsigned int ip = 0; ip < 3; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      
+      // Total number of operations to compute function values = 8
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F1 += FE0_D01[ip][r]*w[0][nzc1[r]];
+        F2 += FE0_D01[ip][r]*w[0][nzc0[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F0 += FE0[ip][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 22
+      double I[5];
+      // Number of operations: 4
+      I[0] = G[0]*W3[ip]*(1.0 + F0*F0);
+      
+      // Number of operations: 4
+      I[1] = G[1]*W3[ip]*(1.0 + F0*F0);
+      
+      // Number of operations: 4
+      I[2] = G[2]*W3[ip]*(1.0 + F0*F0);
+      
+      // Number of operations: 5
+      I[3] = F0*W3[ip]*(F1*G[3] + F2*G[4]);
+      
+      // Number of operations: 5
+      I[4] = F0*W3[ip]*(F1*G[5] + F2*G[3]);
+      
+      
+      // Number of operations for primary indices: 48
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*3 + nzc0[k]] += FE0_D01[ip][j]*FE0_D01[ip][k]*I[0];
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*3 + nzc1[k]] += FE0_D01[ip][j]*FE0_D01[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*3 + nzc0[k]] += FE0_D01[ip][j]*FE0_D01[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*3 + nzc1[k]] += FE0_D01[ip][j]*FE0_D01[ip][k]*I[2];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 36
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 3; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*3 + k] += FE0[ip][k]*FE0_D01[ip][j]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*3 + k] += FE0[ip][k]*FE0_D01[ip][j]*I[4];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class nonlinearpoisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  nonlinearpoisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nonlinearpoisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "677a2b61464428b34fde07b7921aeeb31afd08f4f6d69de2edc504610ef33ea0176ca502bd873f98c2093072d09c358d5ca46c69c3283733037669f6273fb6fa";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nonlinearpoisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new nonlinearpoisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new nonlinearpoisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nonlinearpoisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new nonlinearpoisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new nonlinearpoisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new nonlinearpoisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class nonlinearpoisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  nonlinearpoisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~nonlinearpoisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "f1695d3d91a4300d644a6515716cf3a728ba760d698765fc102a4d0859bc04b758fcc852aad55b32e2edecca1c3e7f8f276211c86b1e4ecfb1e1e231b7b68d75";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nonlinearpoisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new nonlinearpoisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new nonlinearpoisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new nonlinearpoisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new nonlinearpoisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new nonlinearpoisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new nonlinearpoisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace NonlinearPoisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_u: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u()
+  {
+  }
+
+};
+
+class Form_F_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_F_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_F_FunctionSpace_1;
+
+typedef CoefficientSpace_u Form_F_FunctionSpace_2;
+
+class Form_F: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), u(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& u):
+    dolfin::Form(1, 2), f(*this, 0), u(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->u = u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> u):
+    dolfin::Form(1, 2), f(*this, 0), u(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->u = *u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), u(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& u):
+    dolfin::Form(1, 2), f(*this, 0), u(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->u = u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> u):
+    dolfin::Form(1, 2), f(*this, 0), u(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->u = *u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_0());
+  }
+
+  // Destructor
+  ~Form_F()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "u")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "u";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_F_FunctionSpace_0 TestSpace;
+  typedef Form_F_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_F_FunctionSpace_2 CoefficientSpace_u;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner u;
+};
+
+class Form_J_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_J_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new nonlinearpoisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new nonlinearpoisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_J_FunctionSpace_2;
+
+class Form_J: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u):
+    dolfin::Form(2, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u):
+    dolfin::Form(2, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = *u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u):
+    dolfin::Form(2, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u):
+    dolfin::Form(2, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = *u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new nonlinearpoisson_form_1());
+  }
+
+  // Destructor
+  ~Form_J()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_J_FunctionSpace_0 TestSpace;
+  typedef Form_J_FunctionSpace_1 TrialSpace;
+  typedef Form_J_FunctionSpace_2 CoefficientSpace_u;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+};
+
+// Class typedefs
+typedef Form_J BilinearForm;
+typedef Form_J JacobianForm;
+typedef Form_F LinearForm;
+typedef Form_F ResidualForm;
+typedef Form_F::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/nonlinear-poisson/cpp/NonlinearPoisson.ufl b/demo/documented/nonlinear-poisson/cpp/NonlinearPoisson.ufl
new file mode 100644
index 0000000..5ebcf7c
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/cpp/NonlinearPoisson.ufl
@@ -0,0 +1,35 @@
+# Copyright (C) 2005 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Harish Narayanan 2009
+# Modified by Anders Logg 2011
+#
+# The residal form F and the Jacobian (linearised) form J
+# for the nonlinear equation - div (1+u^2) grad u = f
+#
+# Compile this form with FFC: ffc -l dolfin NonlinearPoisson.ufl
+
+element = FiniteElement("Lagrange", triangle, 1)
+
+f  = Coefficient(element)
+u  = Coefficient(element)
+v  = TestFunction(element)
+
+F  = inner((1 + u**2)*grad(u), grad(v))*dx - f*v*dx
+
+du = TrialFunction(element)
+J  = derivative(F, u, du)
diff --git a/demo/documented/nonlinear-poisson/cpp/compile.log b/demo/documented/nonlinear-poisson/cpp/compile.log
new file mode 100644
index 0000000..168fb8c
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/cpp/compile.log
@@ -0,0 +1,494 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form NonlinearPoisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'F'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, u]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 5
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'J'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, du]'
+  Number of coefficients: 1
+  Coefficients:           '[w_1]'
+  Coefficient names:      '[u]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.038409 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 1): array([[-1.0, -0.99999999999999989, -0.99999999999999989],
+         [0.0, 1.1102230246251565e-16, 1.1102230246251565e-16],
+         [1.0, 0.99999999999999978, 0.99999999999999978]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.66666666666666685, 0.16666666666666674, 0.16666666666666669],
+         [0.16666666666666663, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666666, 0.66666666666666652, 0.16666666666666663]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_D01': array([[-1.0, 0.0, 1.0],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978]], dtype=object), 'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_D01': array([[-1.0, 0.0, 1.0],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978]], dtype=object), 'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE0_D01': 'FE0_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D01': array([[-1.0, 1.0],
+         [-0.99999999999999989, 0.99999999999999978],
+         [-0.99999999999999989, 0.99999999999999978]], dtype=object), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D01', (1, [0, 1]), False, False), 'FE0_D01': ('FE0_D01', (0, [0, 2]), False, False), 'FE1_C0': ('FE0', (2, [0, 1, 2]), False, False), 'FE1_C1': ('FE0', (5, [3, 4, 5]), False, False), 'FE1_C1_D10': ('FE0_D01', (7, [3, 4]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C1_D01': ('FE0_D01', (6, [3, 5]), False, False), 'FE1_C0_D01': ('FE0_D01', (3, [0, 2]), False, False), 'FE1_C0_D10': ('FE0_D01', (4, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 1): array([[-1.0, -0.99999999999999989, -0.99999999999999989],
+         [0.0, 1.1102230246251565e-16, 1.1102230246251565e-16],
+         [1.0, 0.99999999999999978, 0.99999999999999978]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.66666666666666685, 0.16666666666666674, 0.16666666666666669],
+         [0.16666666666666663, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666666, 0.66666666666666652, 0.16666666666666663]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_D01': array([[-1.0, 0.0, 1.0],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978]], dtype=object), 'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_D01': array([[-1.0, 0.0, 1.0],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978],
+         [-0.99999999999999989, 1.1102230246251565e-16, 0.99999999999999978]], dtype=object), 'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE0_D01': 'FE0_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D01': array([[-1.0, 1.0],
+         [-0.99999999999999989, 0.99999999999999978],
+         [-0.99999999999999989, 0.99999999999999978]], dtype=object), 'FE0': array([[0.66666666666666685, 0.16666666666666663, 0.16666666666666666],
+         [0.16666666666666674, 0.16666666666666663, 0.66666666666666652],
+         [0.16666666666666669, 0.66666666666666652, 0.16666666666666663]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D01', (1, [0, 1]), False, False), 'FE0_D01': ('FE0_D01', (0, [0, 2]), False, False), 'FE1_C0': ('FE0', (2, [0, 1, 2]), False, False), 'FE1_C1': ('FE0', (5, [3, 4, 5]), False, False), 'FE1_C1_D10': ('FE0_D01', (7, [3, 4]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C1_D01': ('FE0_D01', (6, [3, 5]), False, False), 'FE1_C0_D01': ('FE0_D01', (3, [0, 2]), False, False), 'FE1_C0_D10': ('FE0_D01', (4, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.126413 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.00921893 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.06299 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.0010159 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./NonlinearPoisson.h.
+  
+Compiler stage 5 finished in 0.00142002 seconds.
+
+FFC finished in 0.240043 seconds.
diff --git a/demo/documented/nonlinear-poisson/cpp/documentation.rst b/demo/documented/nonlinear-poisson/cpp/documentation.rst
new file mode 100644
index 0000000..75e82a5
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the nonlinear Poisson demo from DOLFIN.
+
+.. _demo_pde_nonlinear-poisson_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/nonlinear-poisson/cpp/main.cpp b/demo/documented/nonlinear-poisson/cpp/main.cpp
new file mode 100644
index 0000000..1d9b21e
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/cpp/main.cpp
@@ -0,0 +1,115 @@
+// Copyright (C) 2006-2007 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2005-2011.
+//
+// First added:  2005
+// Last changed: 2012-11-12
+//
+// This demo illustrates how to use of DOLFIN for solving a nonlinear
+// PDE, in this case a nonlinear variant of Poisson's equation,
+//
+//     - div (1 + u^2) grad u(x, y) = f(x, y)
+//
+// on the unit square with source f given by
+//
+//     f(x, y) = x*sin(y)
+//
+// and boundary conditions given by
+//
+//     u(x, y)     = 1  for x = 0
+//     du/dn(x, y) = 0  otherwise
+//
+// This is equivalent to solving the variational problem
+//
+//    F(u) = ((1 + u^2)*grad(u), grad(v)) - (f, v) = 0
+
+#include <dolfin.h>
+#include "NonlinearPoisson.h"
+
+using namespace dolfin;
+
+// Right-hand side
+class Source : public Expression
+{
+public:
+
+  Source() : Expression() {}
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = x[0]*sin(x[1]);
+  }
+
+};
+
+// Sub domain for Dirichlet boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return std::abs(x[0] - 1.0) < DOLFIN_EPS && on_boundary;
+  }
+};
+
+int main()
+{
+  // Use Trilinos if available
+  #ifdef HAS_TRILINOS
+  parameters["linear_algebra_backend"] = "Epetra";
+  #endif
+
+  // Create mesh and define function space
+  UnitSquareMesh mesh(16, 16);
+  NonlinearPoisson::FunctionSpace V(mesh);
+
+  // Define boundary condition
+  DirichletBoundary dirichlet_boundary;
+  Constant g(1.0);
+  DirichletBC bc(V, g, dirichlet_boundary);
+
+  // Define source and solution functions
+  Source f;
+  Function u(V);
+
+  // Create residual form defining (nonlinear) variational problem
+  NonlinearPoisson::LinearForm F(V);
+  F.u = u; F.f = f;
+
+  // Create Jacobian form J = F' (for use in nonlinear solver).
+  NonlinearPoisson::JacobianForm J(V, V);
+  J.u = u;
+
+  // Create solver Parameters
+  Parameters params("nonlinear_variational_solver");
+  Parameters newton_params("newton_solver");
+  newton_params.add("relative_tolerance", 1e-6);
+  params.add(newton_params);
+
+  // Solve nonlinear variational problem
+  solve(F == 0, u, bc, J, params);
+
+  // Save solution in VTK format
+  File file("nonlinear_poisson.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/nonlinear-poisson/cpp/plot.py b/demo/documented/nonlinear-poisson/cpp/plot.py
new file mode 100644
index 0000000..6fef0d3
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/cpp/plot.py
@@ -0,0 +1,10 @@
+# Load mayavi
+from mayavi import *
+
+# Plot solution
+v = mayavi()
+d = v.open_vtk_xml("nonlinear_poisson000000.vtu", 0)
+m = v.load_module("BandedSurfaceMap", 0)
+
+# Wait until window is closed
+v.master.wait_window()
diff --git a/demo/documented/nonlinear-poisson/plot_u.png b/demo/documented/nonlinear-poisson/plot_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..a7400a3085a7f3f4c5667c92f8fa064ba69b8261
GIT binary patch
literal 25785
zcmeEtWm8;Hw<Zw+!6mr6OXIGMyE~1$B)AhaxVyW%Ly+L^?t#YLU8eKix?kqb{DG<Y
z)K$Aq*EwgMwf0*3kx)f>2}C$tI4CG6L@7z2G8EKDO(>`jF|Z#YE3X=%lTc8^P*Ol)
zRkw`O4$pRdHTU!92v-VnXa`nYNv;&qZhC81ouDa?iY6zOmGLI_UqXn<J&eEf#6q#G
z?(7N)G3c~QY!MS=N_y^Q{EL^2`s5fm2#>cu(GoUZeE1wjvL9$c4ip{lA-B#D+`~8K
zo5Y^PcI-U&Sag2t%<doY8pKaFpKt~ET)PjL;#xC&fIO96A?NxR$S>6F*FY2~D4}9M
z6v)FKu%U=R)-u0{z(PUg%nHFmE_K3%C4qwaDgTM&GZfU6C2=6+0v^Qw|EK@Q1F`oJ
z9*dDJYI=G)H+j9*c(6z=eW6Ovb0=1UQLpVLK}EjxsH{B8^Q_fyNnjk?`qXI^k{1Sf
zx-QG6zmNz>^V03wEKgS&qxr6eP)0YL7xm1uz3-NmmeSa*7b<m{UC%e3&%1m#JH5*_
zsyp|yJQpgoSo`2pJ^qE2xtMw2hAwcoZj$eM>?>6UGY5yuC_{6G>xTOPHYtzO!PIUt
z$mg_iG0SO23Yq_A>gDnJm+`C9&naq1rlKwCI*z}+K3BJ2ja*L(b}0*!rg7SDBr)i4
z*sVP*8Aq@CJfF^5Z+%YvuM$X^w%P2=3}I|L$h(;<OxE{UwQaUtZ94UbXT&ZzDj)xB
zdz}7W^jUZd6;dJ8wT}A}6f#K_x~(ky&fB3>Xwzrwzl+yO3_t#>4@IN<v-Qy=1{DPc
zP-jNS-N`a*BPJrwe<}!VVFel<v!oc4QCAWO27^_sr(?RY|JBxEH)F;TK%|l1?SB*(
zHGqZ1;qRXhw{uHN*r?-2^EaRWb04$*FpO6BT+jP63Q}j&e)^B`rjYn2aGkY)vwWTo
z33y#9^gDQXZZCR~(WlGQ%D<E^GiH?7zWNWdK(2c-dwseEHaH(I+^9CTuHcww0OmOm
zG28-whFI+GR;$fszg;sa)KWnGlrnO1x|x<BBKRu?j|K9&{3ZCZRbJic0a=B_r=$sw
zfQYE;uqfTG^Ks8On%|{27%|@9eC`9uX9`unK%S3NH0o8l?t=ubHcK^IJ@8Cx?e5oY
z&c~Px+D@C^_xz7L@!?oZZ)4^H@j7;bIzLhTJN=$vg%-I^8)gZ;F1i_XnrtASLI(6S
zv(@`6TJY_mx$E^boztGs?PpBLK(SYZA^}q0GwcT?{ng-)pV6Rl91g%L{0gQUK_hnG
zFJM1Zw!dhEAWWO^qjd*-h8i;=4*Y{YPM39~_~8rj2PoDLuq5B(ICq(bRR7)9HRTB)
zf&p0?Bj=WdEI_4@6GK9RfRpC0c`)^#1uhhknBKXKE&2=%gnLw|DMDD1Ar(5}@T99h
zhc@U#iOF3_yd6mhS}U)~?~6BDpM@5=`F5H1)cjEVeNa}+^L+KPmdRrVJ6|<=V5~zd
z?j<_e^ah}yilFIB&Upqq!5Tp^{gdXWZ+t6!^W%YC4Si$@=KZFcdnms4qjyqG2tOGe
z{??PJtZgg2-fgj=5*jW7(t@>)3*`9a*oMZ^bk$geiPO3EDvMD=!{0U<W5l8MU{OSJ
z6sPD#ci!;ge##XJEzJ4`Gt>VVGwl+8!PI<u1HE4Nl|w_x@}r1M!B9r!tw`y*rd+F0
zDH>O-cS6gcgM?eR8M-hVZ(onQxVm{hq^#oi_<KNd2<3hnqjtJ$IYKS!sL&c+X#=a{
zQ4ozAW^N`6?;NL{5$aC?BoEMgCnClzl>Hipg`W)=qo2dT(la(08$T;CO*;?dy6ieo
z7f_~=n|yLjF`#}9e-eSE6gfR6mo*z|0QqNYM57>8ii78vRZQ~|lM+ctJ+{uXw_xZi
z3(eo2h^TDvpmOYq0}WUt#lgB)H?})wai1mvE5ml1#NG<Vci*4w)!8*k>&(s>va?In
zpvG*F#v`C_H6@lT)%D-XXKg>C%0&qc+~U+Rto%(s)RZx)h|5a&OLJ)iRPW<aSVr?y
zFF~$Qa1znPDn%ZvCwkY-e}o!i%zC|2<uxAF_oS8!lz=sZYL!Yi^T?iAVu?MfQE&`|
ziz5*oXbQo_<Giw3mdG>3>a0?hunw(QzAv4;Ge?9X{uEdP9tw?PMdTkl*egpwt(B-|
zc#RQf%C}1J#7wK{aogVzyH#~R3UJHD1LRQ8O`}ZDT>Gvb<~?q0zKQxKe}OU(g5^a_
z$JIg!O)ZK&LLk7)RB%DyJQPDR)%^1q7EGtED7?Px>@c!3iEYdf3oseRw$mZq3Z~E@
z&7;__qOv}kDrXmbx*-s4VTPj24uCIO{YdJM;vaT0hxul|>M;9}wXRXgiyc^E2D@k?
zOA)>R#K7Id6rc04<JZUL6WeFh-op^D1h7-o0mCPkg-j~gO)TFD-uL^eVSctE2G*?Z
zxM)wyTWJM1qaQlOxCN#SD6-cSPgh&vmi2LtDLPui^`2nQN6=2sjg+mTN1z(D9#l9E
zrAcFDKmS^N0$}~Df+9KLioKyAu<^<C0Dxs(Ntc5#b*1*RhZ{Ppg=mb9HU~;`?1Wmi
zMVrD(Msf$If+H#S@L!)Ifx#8IKRnJHeP<Pnp~g%h<*PE)VS>V#T&t=lU|W`S*^ns2
zu0@_2Gu<>N!5x}l#WbZ_ZyYIeZrz*K7DJDrg`V{K%i><CnzsvAo!t8E)z>G_G#+Y9
zia2n6cggid+p$PUn4@l%Yqd2xXct`+Q&Q$KCv$;3cE!f30O5NuO=giDP1l#&emFP>
z(Fk%46>78El?N8&{0Z8!@Rn(5QJ}=@UXV#-;|-YUCHhM*6gDjk)(v;Er^8PamsB^j
z-N2)1y`G-F7_$KBWB6yi84c#RCFw7*ahzmvf2h+buH>^4w}B@ux2riBMQH}+72(22
z#~~J)u7*cJ*h$sX7p%Jdw}g+!??DwL))l7&5BptqmV{9C1h9s`l)!${`+Og=WlxV+
z`v_)FBIlC|-D1LHX3c^a#c##V>bA<L@)LZVfy12a-xvlI6j-@$X3f!@*-UH-LJHi&
z!YJ;F<$nj-RBN{j-tDG4iGD~y7lQpQ&qpM9L<Cc$%W+#9!IfNJvLvG4`-}Gt+o|@z
zw5eib0Up1y>Wpz3_YyGiC!?Q!;g@ZB0J&Q_jYz`<yFICO1^eXt<|3yqDpWlRtl{GH
z^TdZeagMnqMg{U1t<VL5QIYX$&@YPUP9qMXCI5%7z;dPR-zMN7Ovdlp#ij%TfSt4m
zbzIxDs9K|=L;v?%hWVGY{qx_9#(YrT7wGgQFs!(}(V7Z62fI`PC+o_@{l)D<d%@WA
z1Gv>yvI}_D&MJAW+|p}m&JXl-<q;ORG<LzsMlfM#((KJF0VH|QT`j}fq6;rO)<na4
z-=ONDVM#2=Q*l^suiKw6CClklw$PNjEzU9PFZt9-GrfB$<Zvu25Q}^0NjMYdy84+X
zisTiHl+6)hbAOzY&KXk{+HG=9Z=)8scWkVW-yyvT5~&|S8w^0k>&TKQ$?z%gx0p<}
z{4xW!Lb0!(!&K9==5AOl;>^^)cbWJ!<9DhH%wV2#Do;Y2+B?BT;{HHs4H%%H{4n#7
zUn+p(yVIcE+I#K0l{sH98?f2gR(%X*;Ngejl3=`fNkoN-FxTt!BXYJdD%CAVmkk9k
zIZ-H<y1$N?q^B2704F`0bWsVL)OyKfHAuK`j)f4K{povl{p1sA=T~s#r7ybS*Zdzd
zSUZZBiJmXLFYgzd!*@sm58W<z0cTh7WJQJ1A^&dW6qUF2$&W2o$U+>UY%>1IoGDEv
zxNlB3avx33bfVy<<VMkIiu^EW&nW$^V9TnoA|oOl94}I-LXY0{p%&%**3RgHl5A=7
zv%Pfn(!_JBAi4F>9TNYQpDd&fVTl8CD4TcIG|!>AHx0f6M%`(fHjYdTR;2z4&F>ZM
zvTZ;E7Azhcu@+!4t>{9G<|;01AE8K+rPzIodf2Mn<Z12U&G#!`!L%kG2eowJ3?G>J
zg<yq0Ih={F2jEEu8IaZ)lMZj0<65axe1~$pnXW5fu`^#SWh0*p(NwK#4Ss6+WuH5v
z3b>^N&6N?!X&U907a__Z)ZaR?H>NgXG3JL?Oz2z_;!;_UZ&7WgcNjqx;lmngq{bLy
zi9OOHJRWGrxf(GPCORN1XJWA?sOOD5wSg#kQ0(xDh{>5a+I<AQsOcqb^G3ufoN94R
zW%YStF<5i;1?om%kji)3iI_+aXB;aK>SOWM;jG2w-H5atAAZ08(q=k9nlz3;k!AJR
z=c=Wh7p~ixzYv38iMb~ZT?>zl+iH>BljW%<MIUBs-R6VC#Xw2h?};D{q0O+*8zP99
zyrQ=LzCHIyKU}Y{Q-+JaK~5h|m-v_>6ysRbt#w}0i68?s5m)cZhU~7M5AWWt%1}Q`
zKZz`9vDo?J)}{Xy)!7rP)AGjGB!2w;T4(IJi~G>kiekZju*l^?z1<*7LdqUiS7@t5
zZxfb|ZAm4AylN})!}xY@6$mWnMP;eyX0c<MrPZQ8i7v=&h!#$fh<Zl19)GB!V~dAM
zaUu@XEBcGD%oQ~F=Su8ZDD#Wfd-`!ce52`xqY|5tXq42Rtm+~XTyETtiSO7(SxHyh
zCZ-M##bJUPBofVx`W+}uHnE{?wHqLOD(j^Y4*=poV4&59PKrl~zf6Ha0&>xM{)maV
z?v4-c)xUwjIUQ#VEm5%9i>Ggi9vW0UbYM+5{&f?`ek4v(i5!Vzn5$M;Lce(X2;~qQ
z?ZMnMoYn4NLL0tATPBK>+wU<@E{9p;`B)1~XsJ&OF60frN<SaG5Q%8$U;Hb6+){k7
zv1#HT7J5v-CYL&Yb97PB*k~4S%9~U7VQ3{fLW0ecPC#-Y;@l74pXQ^;l2}DTt-viE
zfw}Y%!S;je5#A*w9BoS0eE1wegSyHci+{9fBKiqexqoT);F;cD*$%p-Ny%>Bfs<;j
zbbqv5ojYIwtu?#-`UDI!4~qLi;ccsXlrQ$A`W$OA6ou!bAs21YexHY|7S1@3{b(<T
z1!YE;LjS1<b&;gh`<VD>s9eo+!;q=)oEL4S_;XRIe8Uw({WSa8)^dwTt6UR8-j`(g
zPL;gq)xmW+_0aJy3IKVSX5kUifCARQ#aEUJqeoSf4jWvGIei!dwR)R#XpMMw@TA>@
z9y1jBXOSgSY2(1w>004kdRFKzl;{llJ`8f(eR5`iD&k+-5mfFd@z7llfElT@^F^Fm
zPfrTY&Tq=VDfN0YHVjUVujOe^gDszM8f+a<=Ia-v^md!BF6f{!3bSk&C5yD4icN;!
zF1pNdp$xtg2MST}ic@<@3b-59xXb|<$kOp~l|Rl;Gl><lRoY>58`B=}dhJRZN2;bt
zO1Dy%B#S50x%6ED`&pr7P12n6up`Fpse9%2%J#^bDM#ke?HmlN=O}!o7nX=fG~t3F
z7zzTE<4<6W+E;ue(irKn7%Bwfm`{=hod8b!WSZkmvfMGU#;3v`ViD$1)U#4<zlF8e
z{7ls@dBDKUz#pU%1NP8Zw5ZY(UVTlVigYHh738EO=>T_lDn?diXN8O!tL4Owy8If`
zt2KFj4G@PlV;AR-TE{({VRKVP1S%V9GBMDZdt0Hws@;l5Iu3j=lB=45SC)7K+Ex$>
zB&29#uvZ1KgKKC_*J#p<@akfvALnm;y6lg21qBBN&)qUXa47(313i5`yTG_P>zgK=
zI=c?Z4b#sCP>}uBcO_gigS8|`?pxVrTVa<N;;W5f_g86yK)Y(iHMX>jV1RM2!=T!D
zny3`e2RV&cmoh~C46VWi->8*-3@>Ww#UMU`L8(8r9vpF!N~x`7h}Q*z`ckx*0X@c`
z-hPWfG2alMleD}tmp^A65)tVO*Q<#Wx0W=tf&w+hu4mq~=FG~nG$gIXz^Ccy7UuT3
z6g|(rkH(k7qBxY*^HfShf;<|1#;SRd139%R%q0B;$H!Xx-4?q{UG8CfUSr)jlKGNy
zdll;8J!A+!a`D}N3yS13FhL2AtZj2k(jXu4<rhvYoXIM!T0g0D;#k}&d_1U<6r&Z-
zkXoBXSQl3=Lj}1Ucb_8`h4xJS%NCnSUMN+SlCuh@?+GUrEZ$(twR|YNu=E}HQ(6x=
zQLFqr&9IK;@%F%w^pb+JWte?M6ST!vPtX8>hi9epZxjJ9hwVy(%jpVPG@rxaOkr_`
z!-$%O-tC&>q}Xzn@7v>j$GLa4*DhVOz|%qY`(w86;_r=HFwwi4KS%U9tIA7$8st>v
z-a?GHop!sd*!@$JKq_9GB*t5cSPiY@cZ9QJkKZf-aKS|dYGEW=o2C_$)b-aAdH^nX
zM@pK!Nt(qHmJQ3BAqU>mdsCGm;z%KpY2aQX{v~*Sd6*(u_iBK%^D@%j%NSI6)^=P4
z!GDgce%pC@c|j0^t{a)In?7^}-5>oJg3tAW&kx|}XB%T<<7%JV^3CUsdqO_9i`#17
zSIAji@Sz(y%j2jNeX%DMDzGL1`?Q#y;>QtD`EB+mY?QABjDAJx6%CykpI3I?`r<Ij
zr@ll>TclH?hMQKnyrBWxOvO@oQ{2SG-zz=imGUYi+)`=8@o|l<2CJ@&-G%SSO=V+v
zdMB@n89?US@1`p-S&+v(8^E(~zZ}3@#d6<EHJ{+WU+eva?0XfT{W9U&dClp2&FKmO
z9kTd6|9t`D!6;S;zVx>{Ky9MDs_n=RhVUUk@FBq7`&cLYX|A~Q_0-;erQtC57oo@d
z^QIuT25TW?+LaI&3={NTSQf`kT!1&ban}RLJJ=}abu12fF>Mi`y(epp?ot(y17zQ7
zc`kfZg%K;ht-GC-7%~=wmKm|b?kjL~cOki0PShG}k0k4~m=GaU`MRlggLGFOFARHV
zK?<tMAn6*o-az!7H0!G6F5mY=4Sn~w$Nk^19ODq+0|GALaoTyE)DGHpz24DYPVk=d
zZHJJ(?I^qzEFPmORWCkI{Ssia-)NuoeY>7Dd%gHmF+GtVrcRFtO*0arpSwaXkBz0I
zJ&H3$-O3`36_(02ohh@T?5!^L5nL3+)t{BeHWT~_Z}&3Hv?0fOtxXB7ziC~5D}pV6
zH>lM87HNHh$kt2T@+H8sJ+C2wsVAztZ>iIp7gf(`TI{e?hN<JGY1MAE$#xYQOIHZ^
z53+#=J@f>@V?7~A5W4S#VbFD6XP(RU{Un;qMx9uSVE#D9^>lIZbV=sS#9Z1HePEqy
zxz`}(r!vm#q;D(_ok-{4Y=M<m@m+F$$lD~T@531R)Cet!QnVZr8oY^*zUbblax~b(
znLDgnaAH8u;=Zg1?XBom<YNjmuj`p^oyqV>BHgSCRhAnm>gh(us_$B(^<un&z#%K&
z?VQSQms91@2_E9W%-%^lOA5UT%{wX?VX{JpZ`yaoPuBcYepWQ1(3Z025x2RL?j*|4
z#!|-piCk6`u<p~9$F;d{lHYpyAP`3xQ;s4dYgMI-2;Qr$zHqwDHdR=EQRK4Q$Cw`)
zgZIc1PEH?BHaa|)>r9VIcSn=ary*%r7H#i7suOYmDShvw(&CVV=gs%GAS``JVAs88
z7pGX0JSA+TOE{M8lbmnGt%LXr*^q14Vd`CNRo&+mRmr%4G+yfk>m%G4smags;2r82
zYc1_O|0D^T*%+E(W7m<u%l3lxG3|i@k;<=H3*R{_H*_hrew1v+vz1;l{lR{%x-auI
ziL`FmupZ~Zt5`#XsoDyxSzy$x5#m=96CNBqcI5;)3{ybD`0@uvpvL3&NUdD`UktT>
zTh11_b{y-en4cAVh^{eixGry?=cZyIOH<k{m6$nzULa@-9ka0h6tvw<?k+7;97707
zsMW&wW=2hGF<eGFWUc&J*28ilf}FzK5kE_IEQ%flCuLRp)w*Xl5&zQVLoko$BzIPY
zxDwk7O-%ry*naoU^-2At&;9Ss$|%><6?OpuyUO)u`%Oqpi|4DhprUK6sgbvVsZ|W%
zz=FrH_1I&TRg2u4kE?A&&IZic@z672&bt)MI-bG-q7zHmGAFgl?CylN*=Zws4kK1^
z?AYyMKUf3GVt3R1t+HwXY>YNln;?ZS%$0+w!2J{yGiHA4)`C_+F+q5?4gIzEL=%&F
z_b7w9e+6p)GGOlo#@lQ;$P3@NYih34s^7aDB-*Sq9j$EMcpA6&xgG_*UCk8Az?8e&
zn22*3v-ZF;H|}K6%H5}V4PxS4kJCiuZ|UbKdj?m0*pk#Y$e1{ZO`_A!p~hJ4UK7sZ
zrag#K2|{|>;xia!@l;d66fB90x%^mZPwQYZ|1vBZ3RtM&MIj9A!{iAb>PMCB?Tsr>
zY9v^9rb-=%(cHBNt>Au2+Z*Zr{4gXTaP@C<pDmJW-tai4)4vQ83&-r(#;9)DP11pE
zi#OHpPu0GcSiXSuFY@1DN&bFgi@TjeSCmNAuq2KBBgu>YIEFK&{!z=rCglkex-}Gm
z&TjTQX>3MS5C25WV3B)E%wnXn8?c7H|LHe*omjKj2swJwfrzX{&<uh)oih7A*665-
z#-EY7c4}PGSu%Z%%s4)I;H0(zvADQ65<XW>7A_thS>EIIKKgXAz%31_$GPVw-md$k
z=Y}ZIr*i8AI(Is%+q0l^IC0oswls0*+1av)l1XAmfo{QTP1%DhQ8Gu$A-Jwi#w@!&
z8TT6?u_Ok&-K4C60m#ydxu5|umtnxVl&oysN%3Y|Su9@<EP}Ju)9^04Lua5HlS5kW
zqYLr&i1u1rXn2YL2uG)0ad9m|R@U8R<=hA9-RhOvxBgh|#3S`yk5`Fw8tT`Q=Ikgv
zRWs2}?6FMw$11gnai5W_#B*2X1j)p(LRnntEAlUB(y+h1h@@l6iWX72CmUA!H#W+%
zqyoH#y)xpw7$`g8rZEB085oQ2fzq2F?Kiz?pF?!H=8LT2$EFvT_BpW9zR*G-^tD+9
z!462<nlIOoC?@oIFeKG(w8B8G)bDr-rOM)RyD-=#_CO-!dk7$U`CAY#kGu4<b|WH0
zdIFa0&o^ZRPi3Om$*+wTrZMrHm3JNi%YS==50i4W9i8U@YQndanu3bSKXd{fY9Etk
z%xCgFIYw-NgvI`bS_SdcbR$-3j+N|6yVAlG0gjVLJ8a*}jIEZ@SIfjeUNT|@BZg6f
z_^1Q~A-Bhi=+h8_XI4e+&vgXr1aY2<0{<<f$wIgr^Mw6>-OBCaFCFM{WVqSM0Rk6<
zV0G+{y$ojvwN1DV9Z}<rTVeok>aU6g(p71$OnB7gexOS*Zw4;K3YBvpkmA<1=+9XK
z!^1#BGeOiWAL0-73znMITa;dm9OrIfY1q$>nJLE_rS^NMKb0zb<U>wgnS>sFL<tcT
ztUX~DMjTO$0et!S`O}z!|JV#jg;sSw9VvKiqx;C8KRi4ja;|;99_J+TJgLRwup!QK
z?RsAS*R^yuu9E)EWSu7+_ZyzerpXMNHGjkCs!~SEQxH&ap(9P&aOmD>_D|CXEH8r?
z1$Ii`F8QmGM{y`L;;Pi_LK<+`eyqg-ztz4Cg@5g0&X=-X+b$D3WDzGcak60@55l-<
zoZC4sci5LR6-%#as(lg1A=P0>Rj_x~R2ObsnLnm0s~`h{89U~PscRf|M|jU#j3HDD
zmcHB8-gx>Vgiy1X&U-%leLhT;t=sN)X)bV`YSsD*A=~UaZWqFtIv*OVy-y*;i#*R^
z0i+dfmxEr9Agq~v%T{pbhBp^0Ks_BBW{;f7qka!netWjzxG61tYR?d9$&6@`RSXSV
z?Z6vYjzum=ip}z{5P5%HA>-Ob6M-6>aqD->U5T8BtDasf5OI=m{sbL)){G(F>S--;
z@zdL<mzIr<(ffv4C(~$XWeME8ka;BtCYNPdAVf;G45c?rsp-M4hYZ7zAd^cI5fFGo
z$fj8V-^D6D2=lWHnIa(R<NR>31%?a~W2}=9`pA)8=wP|kasOYhguIjW=HrB`&r`AQ
z(@wm?8(8oSoZNX+hz@W*cH{eCUibK#Rrd)pe~PvrjK6a`ia+C}tbLESwfZ^OxiYty
z-FiySjK#HEN+}?ZrPTMy(x)D;)c=gDf*^qht5C-$sa==m=pbSKJ4q~eDhdz7H<1I-
z<$-hTV79fEkrC!DkvV&Gd;%w9V242fib!6}Aj?;xW`UpDhp%t0lpwT}=`j=%pv5;u
z7vjiQl?mR!YHUXT|JDLv)=L*52&h3jK&$OWI6M2JVVk1U4wXg1710hIU!p5^ShU(K
z><<T*I!-H@1#!+WV>odK?PvAT%odx1k7vPc(>R=j7J3Ltf?xX+v9&@+Ej>&I*I`Ya
zeaPwagxtQ#LO~#3i<=&{5kT+K<Kb+MU)U~8o<IAKYRy)KDiFh0Us4h)m{A5-43<{3
z1?mM#+7bqon_T(Bolv;ta}>Em_Tn#^^G!EdKn47l2-JLM8V>Hi&QJdH#W}xUm=aDK
zZI^~MUCVz9v`_IIkf*S(P^_I%9Zu#vP`%z1YgV(z!pTozYs5@0CAid4XWK>Jh|!D5
z(3q(4WpAQH-M^KFgU{OOvowU)U7fa6PC0_)7D<)9!K|c39*isYP=tSM=bkRS7>o&8
zPj<sg%NhcgZ=tJ*@vEA$I$U$q!+KWw3ICK>qIt+ka4B#$3J4a-Z_?GC30S3eWLqo<
zqM*-P60|Z=tEROSSzXoML0*pAuF`XVq_jv(bS^t1Mki-*lN!HH0BV`X&8TaaK&kY3
z?4SLGvNDzXmWH^TxRw}g5nr9Z!Uz?$MQ=Pd25XKWvV@`Uc6c1uAhM)Fh$ur``9z}(
ztJU%KLw$r05<X@){2hs(vyU7!*ck1(P>IwpDRG;Y+CNn!)rK6ZkF^{mGnBu19Sp_w
zLqmb!^SIY10Tf&@Eq3I|$~DQdnk}vFh`HXtEzFjV1=%+yjGvTdfw%#wzfc8#jMbkh
zI|@d!iLscfPp23fjyVvk>ifr$)JoioBvRV2)78EG0skUFk-ptyveC|mFJIUaT$P7*
z3`=PXXy+i^78bp9Bk>8ZWB9&JDbh*9(U}|Rry~94<*}Xr{YNJHu!5RK=fUKP{#Pg@
zx4;}w*%{Mp{w09v)MS9{Fy3Z)=w4dh)VRJ3xu8JD&V2&)hC7~5Dq^nhD6x!qa!j<;
zolG>0US`L<$ih!uDete=)#vK7!_qaP(BUy#sZP9JLi(c`^DCi%pVZi2P<kc|Zb_0!
zVB+DnXasEqT(uWwsFXiC0(0ASiB$zhjpJ~*ooIe=vEirh5a;`s#)TFJc7BPM)Uc7=
zbC_`w<?GYTnk^4Wjp-c&;n~+7kUd?6%`HDQ7;@H2bGrN~9WqG!gH4j+(I6l)A2@s<
z3x}3+J@AcnM*G`WS#Owfe2Q_?NE-$};J2<J4cd%@mg~Vb&=P3^?(d(61Uq;8>jFh;
zMv_(bvNyusn5;!%B&%H6p;aYMILVteI&u~fZ;?<_eG!Vr%%5V&td6upwqSD724HQU
z;t}2`f|nagn6Q!Y>u@Vp_Hjo+ekQGg$!@Ik0yI5HhlPpweUid*af9c-&Ah@af@CTZ
z$A=rQaT&Xw^p;}8Dk1$$oQR!2YPCj6fB%uD2)mW2Y$(7`WQyqm_P77R_!FfdrrJHI
zP*St0$1hQhF6Hu3Ihw&(HcnU^9N}|f9kLg3psziI-#i*FQI2JVL61N^fXHoo3Ee^Z
zWfk~$8i+P}VnP%NQarzRmP%Vtp3y8}tzn^mBa`l*=}-oI{(ju!;_v%6XB9##1~_+J
z1+aWlI*IL{^-jp1arDNCk9K*QsEZ-d(8wfFV%K19WRD6eqD_HIFX0}-INXxP1dzXO
z^!cfnC)Ncay1uyuMK<gH&R*Upl1UQ8mr7(2F9^c*kaF%+!jta*<TvoOAbGw><^yXm
zfR|-n&dT=?a>nuBwSTF+5Dw*BP?&4Y?hX}68;)Y#icivi+HxM4mPg|u=fg`T=@h|%
zk7Q9b1yfg*x&+CeDUf4FhLwmTNd*ecp9`H>m(8Da2vPZPv~h1RX4?&$T5Z)Go5TAb
zz0bARU0d&i5=Skq0wT6Rc1$~8&zZ=vm?%i;^PpZoM5AzBb?94G_I=i=w<=puj*0BV
z{j0`Spu^6u0R#zRjW43mTF`Wa9o)8ufw0$v)g2c?ow^k`ZPoU^){PXzKF2mL9z@^f
z{LsrK!JYIbP}1s+o_id%>x@Xh+ty+0aI1<ct!rhb(W+!{3(7%;Kx)vb`lif&a}+hp
zKL^~*qD0J3t&UXK8?_QfzSx{FAC}rGd(%+U#>F*8)U`ww#d)Ns#$%PTU-MdrMp7)l
z%SW;m43LS%;c{@cMWnhBX$R}DkZcHVX_x2ce+j1+>VkYnkxuheSW8RMxh42r)#7tZ
zxvh*i;p5~W(E)|qQ|O{5Yz<#Df?XfOvP&&a##L#SP|BHhYHBOA)f7z1k+kSnTvrKg
zp8!e>W_O0QcW|wutG3p#p)L=%To4mi`oAg@vDy0-8EGl_i9LZM*{sB{lFbE_SC(NN
zS1Xu+amXRh$x<)bEPcY(HK^l85p)JW0_KP!P(#bJ`A&PwGTnYP8*uS>bT7~cN^Osy
zPE6aeTjYk{EMc0_ZioQL{|=>=EiX0xlQbr|p3W^gmWSM2iSI<{7Pwxtrj^)Glf7@J
zM;nK*Qs1erdpBxp`|Yvs<6}i;tB{3KJHv5JeK;eUScEml71`HVbY)tv?!SK>ToqSm
z#?1JYeu%<Nr2G7iVC|{VgH72P_U%`ZA&r=TFCbh6MK*4)mXYNr=~+H9eS-QBh+?An
zTPPpDkuH@+b4Vv?axQs$|9Yjgqm6`N#@@$u!68;sxA|a616wcLc_P(R45+Dg8{E23
z#>uT}@hFijc<CzTeA|aux>>g~+V+7jJ%N27@fK}JBvU+v>MCUPqA-Fk{gIcAKTuNG
z69xAaR@8%MB3LuOiAB&W9+!fC`1eE!ycv;LcZ9pPur-+kbETpx-L;B<pjxt7z@H0h
zI{T1fsxtze>nt^4pF&1Q=9C0@B^UnrGo6#3l@i6L)4ryXeiLCl4XNRK*$r;hH>2JT
zbfiK-e8WfjSTUz>4W9|O*32J$z4=jx2d}9|1BtR6G03MG8y{bm2U<+4Xt(GjgRtk|
z=c;4RY2r77*)UVsdT{Ch7_w}#&M=Vqo3(<Lmj&=XPIXSe#uA&JSs9qf2^@HECZK#%
z$M(_c$QDi;<(R1Zs)LG^$-pNlup4j6c8)BvBy|<ryEEIz#^SubvN$+SjhDg12l!f$
z2WLheL(R)(k)QlNJW{!e%7DpXR2J_pt%%?>f@M^u_MHVTudS{%wUeHF^iDVN3wGCH
zT1&5RcO3{s?~rz&m24A2UkJ{uh{&}PniD^SN`T020(G$~kp-2*!E!?gg?mogd6)aE
zRZ+<vF}#I$U`wvr!<5pG$wIwp@~SbWN!McNR4ldXScl&&Ei+~<3vQ87bbsaxF*5b2
znHy+~=?venM|`}?fV&d1E+W3w)q>LY1BguF;=R@^s>Hm6I-vFABxH+=G@0B);aEKK
zz>s--2LLH>Pt6~u6fJs&ewv8$R(_rT?mS$Yqeuy^4hJGCkM+q>mT?|NZ6wB4l}`R8
zqHf{EW@H6T?F0D7-PO8w2}g}n@&=l-G*o|y4lCXaAc0*$<$~#AzS9<rP>}v0H1|QS
zC*DCc(QpxsEZ&i*?vz?y=Lm&OJJFF&$J0*)IgVe_@e7rY{<hoj%9@-^2J3e3FLnAb
zs#2a@4(EI&C3CN@%F(tBDIMQoS{_r83;D6u=#qfe>JzAq&Kz&MgM;ciKatHaja3B2
zOFocfJYQ7(c>uA5niE-pV|@-XjcxoFq|7krMk;@OcrIlo^E=ZJZ<re+g~N5Xm!p;R
z5~^*4qy6Mp_SQd1JdyH|LnCn*lbtk~Jt6xkPE)j7f{pL#sDs~9#M{y9b)(Ye_9rwC
zQece^wYOr0c$hk-^nNHs4RU#b!)Se^9msKTadSq<NCTB&PUd)vbdWAuO%X2L=x1#1
zN~dZ}qeVU`#lD(MEHb|M%K3!0oPF4g#f}BYxU|fGsZR!R7YntGOSpdLqhbI+MA7&$
z8bgqAK6<-EFpD;>=uC<uL`@oTO?`uUURv>OT2A?MBQrkrb^W4D5bN?mc5*qjGVSqx
zA_TyaR1vm!@eo_%HO@O&jr8vGQG7>uV%S*v?reQLz5uj*Uo@a@j~kvh#e97fQujmp
z5dA&s+Fxctp&hLpe?Cwk)LCI!47Sjx>g9%T5Cg1os;e+wU_;OLH85^lsWzJB$oj^3
z(RS3R)OQ%JjP`(^tkmD`UbV<}mtcx)lI0}|&^S>r%z`ZyT$WSSc`dV3q_s~Fw;Ihm
zVy{I*M)%#Gs6v0Zpm{m~#MSHmb`dd^gJbwP1vulw?45W5EYpY@d2FFrMrN>rozYa>
zmo-#_4uVYoODL+}rgcYE<a&Qtd3AUQkHqEqOXaXc{igilC^4nczb=6#o!EWYr%Jh@
zKHduiNM@ER&QfM6s?EcLK5F#x)caC&+yfnJ6^Do|zT{4ybtm%!1>@({&usQ2#xa?5
zvD7zVg)P<SU9fDgF<ItpA5qdrQS|(6L{xhnv}ZUq!q;|}2xL_i571-XO2tknU@kFX
zNTVMPMDvAl$q>UEIGWb3WE5YxqXbRk14Kw@Y9Xw}Fp=~P8UnZ;m4pW_?WY7Rc59TZ
z3mtk{nc8wsYX(`$S7)<wWuwZ8&6wD+In)Lg-!ukvtVFw{D*p<}wtm?LK%@(ax*1Bf
zW?qiF0N{$oo9>O|PiptZm$81Dw#X)YP^AKnUGQiX&*{QE&c=c@s{lo{Z{P`+m+(K~
zpM~%Q1G99I)Fr*Ur>$$`^oZHjXHb}@kEIhpO>P9f_~h6&A+A(66Lw@q<<Y6X*FLPP
zRFXjSl~MrD_D>RzeJL^nes{$E`7M1V&{OPNss$=Zb$3fkiQuYCyN${(>GBIpC5{io
zuv=?XM~alyS9Rz)PA<z~4(tc1xZa&M9At6zXxQaZXRvU~v*aqvu9UdVqh$tf0_EsH
zcfKSYD$yKE>crKY(@XK(xQ|6o(H%Ej<9~p)0%rg`21gTyYs__4Kf?_xc8Xtgru3eX
zgtRI0S%Pe2Y_P_Gj`+t!c{Iz9^iQeZA~t`syrEjN=H*Jii5lLImh7G6sIs6?8+mNm
zEwPE(am5_@G6)uqD#U?^d?QtvwU9{Gen*gsb35D10_Z2sk7|#!3j4hry9s+K(e~RP
zxYjLMqdUXuIgr9vrgU3A>P%uGGH9JNet{c<W&aW%c42@fq5zue`H)qdUY3B9NWN&s
zGu$|JUJMX*k#-Z2vb_w|{3s(=U>}zAvZ22*NK5}qaYvEIT#Ak5k}`iZtV;w!dGVwN
zYo@*pd3Nhsshwo9n)l5L*_CTr=8)*PyHT!1XqIcC5lMX8>mm4zC<MFDGRi1W4v1cn
zQAa3=bq)=^6G-LIk<ug4b1A_2rEG@5@4FJn!5+*VrERtqR@<6f3nxA<gW;sMJjJNd
z&7)AJPu>LC*0r<cEWY!kCt%3hh7Yf8Id#fbHP~}{9~wv=0%onJ+1EBBFup;iitqAZ
z!a*v<Hv7mq3dPglCsrFca>W9=tcE;)X{{nzC3&B(YV8{6f>n$pN=n^s6Xy6dkw~hb
zh1c=}U46bjb;r{#u~9D&NceO>3$Rb&0&dwXp3|DAJ!{pF7FDfo;S7K4IrEjUw(eGC
z79D^!4@5O^u=K(_1JS_amhMiJMmZFy>N*fy9WB+^371Q2jO(KEXOxuWz*;V(f)~k4
z=LcvhyoC*$2vyWF#HO9L@a9BHLyurU95jWG1_CRU<3r;`#YYw*e^mi%Jn?IECvubh
zidz^T2_TtTq$gRDVM+>^Xp*5(-lax5y&;RNrHYMbqd<|?0<nTMLW7S~wEwcH3HLL}
z&WQz5KaN7@Uy5L|$n~U4<^7NnU!%rpPuzPfXQo%V()_alOL7J?NfuYwR_v$9qAh=Z
zhm%^_NiIob@hR~8gi1`FO9zldLv$TIR*_wNQPq$UMf>jPDM={b$LTCKX_nxaQMJs!
zePT%4NO)SZ>IROzKQiIBd_)2}Hj`)zjxVE(@x$B#$H6>@z!>1Qe3vzo{*&-$3W(ms
zjD_7ng!bUrp2!=6Vb7>4A_FX`^;K3oHo$+HrZ7Pcnx;+y*Ps<p`%_Hcz>6cL4>*k$
z&qFsVzC9T6H7l>~8%ubk>snRTCj`7^^zqacklZ>@hdX4T==xV7Ja$+L`E+C50n_PQ
zGiM4?QA{>|hTu9SiZJXxS0~JYP9kMVtQ@~t)zb%;LdzJT%AQVw!MSeJaKM#7o_@?K
z=CP?$N@`N+h@q4E<zpU+)FZFD#95x@2c7tb@8VW2XGd0{^1ES6gaD4UW;ZbQ`%EaC
z_(($S9lS)yz_2m_d5}3Q3xvw-HrN{PgkO^N9hX_&QLSCkluQXHEtFSHO`4G(CVdnh
z99mgBnQBlPXR@*IN4B=C(${UpBv2zTN>5TQ+K?=lHRG@xGKzaXBmE;q!;#5_qxcPA
zl3YYsuTBe}xmRc$)?T9V`r}nZsM!x?LM!Pt8L{$8E?E2sZK-NTd6`x;0~;jlD?@gL
zmbigKv?HrCT$U3$S%#z{)bUG6`rE*_qoI)>_SOB#alx{cd+<qPGB12e0j7wiM}S?b
z;E`t5tCUSdx&6Q>BPNC%D3Xj`V29MZQtk(~I;DXX4)g6m*}}^9wv5kvVI_7kirpE|
zs8YL~$@^tRGWi<7{BIGNs+A1uXnG$p9>?@kLmj18*Hk{j=SAsgG3!*{;DUb$#Cs+e
zUDB>P4u%pP&H!Y&@*jq~adL(KkvBAbnF@5LN7YyKWl%eamQ;Qoqmg^&1l@I5n(Ezs
z9dt{xEYxKym<)Na=v?edsztpP(Uhb-X&H#c4l6jyi3C<Nij}*lb3OqG%2*w|7VSGv
zz7f1t4o`>q{P)t7;E1!?&r=_W106F5-cRLn?Qtt6Ezm_rljQu99^2qIiW$6UxuUey
zqzUu!%kOsZB?@z2C|TZwl)5dHEv(c8rbe`p1sF%o63Kp;2cjR2O?ByP<+?|+?q9$&
zRKB)<KiS|?+TY0!IK)f#0Ae106($QwaV6AwxD*vQR5<4Ov@4AuR?p|8K~u?HDxDQ}
z96^@8_F;yRVGV{`n62EuDvnrbAUN^Fp;1)WqYzG84O%q(h1eMr-l3$Z@Qxa!?)~T9
zKAb_pN-;~X!IO{*xS5Q|{a~CyvYe~cbd#?^XK`ye4H{tZxBC>0@@-f^3h%vK@9m1)
zInUS_dwjs%WO<LrHZ8XU(b6^BqG0JZRVKgU*L+MxLba-57>Em&K|71oD7|wcLbgbH
zPhgNvbm^9Mv#@SLLCnW`;}=+`Xqh~nF69S#N4lnW7@v^7+AB}EdXoPHRP^_WyeGH#
z4e?EEo!hy9Ibwpkzpp75QbpE}jVd%8?(l6^5#uGqoT77Nq<ON?k=MXh3(G8`Qd(@j
zCQay|=#(#ctmkQpHq^daI4XE0Fi^uaG9mV!hd*eOmR69XJzAw6L57qy-?v1-*aQT&
zpzniG1nC^M+7OaCR)VnA>2O9xo_n{fyvpOObwAGrg5Kv&KdkKwaMp|qJ`SV)N7@lx
zqm$qnTPo%)s>qctSl9|juU5{n&!t>z?utQ+i<ye`i!PqnN|}6_D?OFK7N-n{$!l2^
zI@7nPEJvo{MOF52vRmAJ#J(Q)PyK%4XBft1E(U$;^J_OTgys$0wCi-ce~j*bJ9J9D
zOMgRD9uQ)c5D!nM-faBo_84Md@qB;12SGF*I?Z++|7FbqI|@Af4PbKXhM(Zx&nOAT
z>U!uGt@XtPxKzFWaEdR)%H&^zgFG1rCff3xkZ+uNG8=zgafb4I?78wd{2s<M?Xrn3
zTj|KaV^G=dXBJexd<tpSz{$bDm~e|%onR9>%i6b(%Tf6Y57KilV~xA^Sy%dXsE?Jk
zCPOQ2+Um?H1aloDQV`z2WDtB@_iNc$IMeRFD{_x|AO*ta3tSD6MRI3DL?7t#T!uC_
zCrLVX+~@7r5da{>E0jCR)b+ArUCn=35KriFkozBM@t>OnqOXB4YTgj7f+*YV4HbyB
zZ)N5C<k$B&N>VmBZKYd|g}Q7%BiW<~j9if@RHLbETT1MNa=$?;yxxL^afQ%d_jR-u
z&KR<?MpowOsxcU$Ci>SO-CwyeZsg+WF{pz@^OYk(Ny=-*5Pg|erOY!OV8C0Bva?=m
z&;jUmh)wDQ@hP!C-=B9~jnGXBzI%Z?quj6eY#|Z>@IYiV|J~AQ^QJz<+iKVAD#SQ7
zs()8^$m)V7Z1Jsu>~vbUx|%NSp?L%|2rmAkcH6j9;g7~wp5z7ga_*3EzwtiO$F|O~
zVEV(gq$NpP$LTqE*(x#~Yw+ywjHu57Ws+u=5+z(>;SS^N*RJO2St)Ox>TZ&N*iGY=
zpSc%m_dBIk_1@1eq!3S3_>2m~6Lo0YybfVwn&25*euhAzNJ5I+h9V%?WYB_v^o37k
zDll5NKjkF)daMN|^~Ykwj4-+qd+2~^&11Gr=E$l)b;>@IoW7-P8Ru|Z3#nbrsABeX
ze}u+FU=mSbl(Cl>PPDWhK2@JGBK&Bwq{SY4L%H$VVTH<o4{L9{HS;nus+!bh0M6xn
zpDPEzZ;1X$GWRa3=KtixDvypQ4`lreyM=H1v!qZzn$|C}<YTE;NooG>C*wz(*CDHG
zno(!5`C_&lT-REu#+9ZL4p+_wpy_AOrL?2}{`gb{9V3b2Zm1YkUyj~JR>RkHspx}N
zn>YPSE-Ns|B|4(CStne_aS}Hq3Jvw2_bZt}rzlIi(~BGRbh*Cx2~sA=Xw(0A!+*K;
zc(n`hH$l`<px0pq9|yZJ7Dy|!R3;hrFtb{gI%WXMMo=VsN!Y8M*)Yluk}EP`Fhx%J
zr>eQ19WEqFVbz!LaE#=5*q=;<qy;tsTonl@RYMRRmFCFrhCsb|-g480VxDMP?9mk@
zBN?1b1H2iC?rW~f&D{kMp0LcIQm;k`S)Nh11!9#NJoX-=i@tzJO<uRLx-2UBAv7$6
z%Y6Rb_52$`bv|q%`*N9nQ9#2c%P1!YlqAdy%N85MTp=flH`Z3|ZSYAL7SQfPFBFGG
z*SC=lP{hIN>TwiUuR>ph%c=VHYo|^CkQIn<oSnl+>Vv7RZ4Dn79EvcdJ&lT)ZK*M}
z&2@GvmV=p;aEV>ySl_CP@mu@#tpgk{{&rg-9pP<U1pf;dljrj2z~JCH<gqwA4&{8`
z?|r*$mg}N@Zt?@>U*h*~gS=G`_<C9+aq~`8Y)GlbCas&rGpue{D$h&7nu&<TPsOy^
zO=om-^V6FA7egKw<ghrLXvm^<RcnReA=bSQT6)qN!e)uEN^uTbKM?s8Dh+WCrPqbk
zKI-TrvGZB%#2^!-3RYO1Sv;7<^@vzi(yKj&U{l(JH{L0{-zZeK?xjIWvCI2$6tr=C
z3*lYwR~9?(-k#5WFT+7Ewb9-upf@qCc;@h*C=<d-`q<TOazkGWRHZxMX^-@!$S@Gi
zq72??Q>r<fwo7?dc$!j)cm3dh=GBKL?R*0?amekjcZP22<IPR%JUukX=i?IBc3O7&
zMwW0p!_5{4lGm+-5PoBS66>d!ua{jF`Sg;{LuwJ?aR8;`(1$9~4kkEv+vnZ1G~x4_
z&J%+u0ANBbTEgLr2?NFVN!zP&=ogmm9lhod8?6m5G%Y%9X!OoeSs9JF(j^UQr@1(z
z9Y@Bx>si0a%`2%+;pMlrhAPmYrHc%nxiTjX^6C8$HJKkZx5e?%%6RaseMCK=jf12T
zlK29i8Z8|_UL7%3PJd?fo=i>lgp`bo3<e2bQ6Vxi5>=@&t@95g`>jZy_Bgw^omPv`
z_)x~3l_%+4<{DmJQ6m|4JH{;7`~PYrToQ*Lm6RAT_gaK18N{>5uu!*tDg!Wl3@vbv
z<S1ocSSMH4VwnlGYl|)2{^nrpaQ$<xDNlU#u*c_6dlUt_UURM-8h34Nnw$*Xo0KKI
z>03qib%kba&m?^0(r;HL)Jok}2QRM|TYJyd+eJ{d8Sha^e#ij~M5wrf!wvn1?1T^9
zgI?V@6bC@dt8Yu~7W2yE&v#W?T<(*FnK|0W?OYkQ-pxiYMcUsc-chdMz*sKYJ3=`^
ztEw0%9)4!vVLyvvM+f|@LAW!BZtIr8(x)$O(O^&RjPA*3?<C<6W%ld;>dy4&*wE;D
znveE<0e8JWcM00-)8ioXT|l9B+!QhqjQtdaXtK>%gYQ9JgX}U!1m3$Z6yCZQsCX}P
zT!6!72PC6;y9v~U<d}kD53=jxBJEQDQamhzWZcNBmS^3m6WVkEDwYGB)qG;B(Rmxy
zW#h1Zz1|xK?be8q>#*Okrb<`Mt3XHnjGR^k64`Q&^?mSS#{Y1L3Iolv-1j=Yp9QXB
z-R!0z4HROql_uqRf4QbwUl{%@!iBYk&O48?8;IgDWu~4pM!H*|DE>9uO1VJYL@GK+
zS>9&EpZq-if)X(tr)^?QS#+>!g}7bFC+3nY-#>Og8J{<QXXl$zQ%g$q>qvl?fGee=
zG2Yi$xzV_c_C%{I++|jvi3j8N6$Wt$iTq{8|6RXf`SO3#Z$Qd|D&u<((d#tPx*Iss
z$8-zw28`_&J)V$l2GQQF*Zy_EUhc9H0ju5H2&rzze=}4W_bvLKQ3B5@QmVX0iYl?$
zC`PbN7nU(;p6g++9d?}r-c<H!TD%x|tWB;$czkYemCo&s6R#c9YLP^pwxR5+<($Qa
ze^fvJmNzTr%hApY!QxvV^e}S?FOlHXk#VfGXx;`w3lb<xO8;96fOfYXGDkSG;t;z1
zr?k1mmrsw>=-xh$8+dk#4pFN>CKZdheS3&m8lw4_6nH)X4C2?@t+zp>Tk8--tAfDe
z&USzJdFS()M#qtwT9X8k_l<M4=lVa<L|k(F4n!HT0g=l6OEIFii(mh~BbC5qC|3Jl
z=zvs@tJh-~Ixc49mu<m<P;9c3&!+2_*I(+y0{-l7h%jPSQ%tUK<WuyE=ks~=Uef46
z_xh>y`|}KpBx`SAD<-mvVPKGRP9;{SVoZJ(lk?h2YmcQs?|Kj@lS?CEBLgruvU1zr
zoR{rBA2&Yb<GzY&cqh+}sSVBTfH5MGZ3(s;X5~FEx?!3jJ3VB+VDdhc`Grg*@b&=S
ze7kFg$XMOy%hUu`R~oH}-2VEd+jl;yK-9UA*X}SGjsra=f*|v#<AXKbm%o3<u*m`?
zxL~CCdqV%d58%Bi;>z!Tu~~_YR}lLM|6|cVN8CJ>h|+2lS~b+uA!&bq{IL8sQ%6+R
zH2~_`+r)%pIWY28!Naqxo}#>wPjAmWJw3f8=YFZZw0qz9@%0$lIeH3ZdFdLQICz%h
zNslg9gX<4E=wEB|7_il|y}*JT=Fw7+e9lIDPbyX}P8WT6AoftMMeHiL8I-J4$7#t^
ztxmP;R!s|%8*R*WATdKZZ}S?11DIZBR!yaPFzg8<)W~^-ix@{Fs*?x(D3nny^Bu>8
z)HD1>@F)4anczeD-$~WoUvabndpfv+@l8Tk#cIv^6n6-bt5(g85%+LyUnob%xNY{#
z!vKA4grWCe5^n02i?pC`m4j3c!!z7am|`PeUK=cZ^cA*wS0sJ>6@!3uBeZm+^vy}`
zW|w{yO4dPz*XlMIqOEK``g}w{vXDGU6FDpCFYiHkr0;PXUXKs(wcQ-P6ERv&w#K~%
zNS~r>SQCDybO*d>tF;F0x0TN!ougf*<*mS>mE>?y%q&}6YJUym2)e`^5h^e8pMhcj
zA^(o{xF%O`mp~Vns>yyGWzeP&xxLTst2JgmU&UX^jy8%GJG7h4>hEYCT6WqP>1h_~
z%t<2&9Ohs%kmh1z)gOb0sQ1|nQ*FLQgh~@zLJ-jWf*gMjUB>66$2_>W^MC-fm<)Kb
zIe?3yl!kDj-aI!L9Q8s!IsoL{_c-LNiS(poq|(IpmR%h=Xxk*Kw5L~^?9eA|@i2K+
zw{2fxBj@R(5@voDf{fWhh}xL`F_xEm=I>s!6?;Hv)<|vIjyO`O#l`hx=CsApLJfYi
z|JB@GheZ{&ivq_$kq{7x0g*20E(N8#JA|PdWC%q<=^-Vg8yvbzx<~2m?iNXr7|!DR
z&N=t_&i(H5-231Cd!E^Q&E9MFUTeMY`&;Ux?X(eQ8iVW>c>Ud4jrvS4GS?hrI4e~-
zpHLik_>Y8zMRz^;>G-liJp9PGRiyT>nzP6LYPwvbMj$>5epYtsgXdIMvKDXOuqe`t
z*!_BY%t0tiTgFl^C~SIKv7m{!E$Ob(l$G~hP<)LW|Cm&rxNPsBK+zwbp*lL#uVK4^
zE*Y#@%E4R`mH#d9+Wkw!U%D)-bNUC}#dwQ|V(#5aJA=bMBmON=1wIsr`~fRGf%9FY
zXz3KOPuj-kloY+DSDLsB=bB4ue5cYxx_tJ{LFEfr)HU}AtLm4ccxq}l7H1O6$F?=w
za}khV^)yXz%#QWBS2R1FDz)OW80yPBo^H0%uW+;RClEx2g9_dgfnwt@ygp353)n@T
z{_}KASEh^D)^?`;e7R?SW9FPJ6fIR_=1j>NeTee_PdrYht)|J7RFVq5zxPKXpB1<v
z`Ke%p%cez8FPm@{hq0i@uw0$=Fl?1s3Qj0KZ*1AFahQ`*`Pvl~8#T|nhs4)TBe6A#
zdFJ!BNh?IKj?Xh_W{lAS`eN8z1G+`QTrC`7O-1?Fvkahsq(G-E8%Ksva}d|9Mh4f_
z<}#0oKL0DC!=GMOS(F}Ud(By6)f-8^R$=Xv?||iqP2fiK-k*|gQ(UF+q&Z3EMLDYI
z*Tbr9X3%GCUT?UFxn;<gyj~)rZ)?)QH#fPsFyL*Wc3sXseVmvT-yOjCHAh5iU{~&i
z)!#qHp+1HPyaUDSMiV~s(CQOY;mzlLu3&j53>x;HF<U~Mwvh2@Xo!}Ril#+`dMJj?
z-s7E$RJ&FwwOm5!o@lz=O%`OFnP1kP4(>)*glUabJWZ0K-nB*25ArrB`eVXmEFTMl
zPcWY^uJ!q=ZAmaA=EARE&mla+I01NWPr<4z^}Ye7l4|lwM^3<fo7|8mQyCF6kV0KG
z68f-_Z`IcGb7d)X)vY?kg!>{}N@@#&5zW$M6jN5qK4*bE*PNZ7M`>sB<*bpLy`r6`
zGU<;yW;ssz3&%|09#rG!?Aew-LmZLdk&rs?ql=*8@Z`{apzui0h)SvE-GQJPX8Dls
zeYNHW_5#zh^$!6V%uLtsJq^tJnLOyXEJqE8Vz2nF;>lww%YVxx!v^u>Uhu<fp9lsN
zmv=jkM>`v6lxl~+O$x*goa!NA@J5PKpTC?^c>tD5?+lv>`xf~`zMFrS`H*5uLkoSj
zUZqdZ_PVocMR?^jBTqw76Ft00*1mnlWxlEPp*}%?e7`(y7Ijt#a?9K-47GnkQ4t^2
z=X>YnPYAE6^Q4J*M16)&BuQ4b;eDVG#3<x_`5@Y@E5Ga-cpW6m?MTQhtx{c1=lzU`
zHjhTOTe`&ef}HU|Q4<Uidy3yKmdC-%<Y@DpZ2AifqQ9d*``L0-DZGF&@37J@$9{D$
zyPu_1X4ch#dh0o!7>Bi01ma7J-5W*6a~Tzdd3IaEKg^#GzZ<U@(@B1>j^m%wPEYz}
zl%3WCu@nEKKkdac!mWwS;frsf(d}{SJ{Ub1{kh0bfK@O-sx5-rZ0934hqRB42$gnm
zENeKww_A2eetn-RMV>|Q00&19Gj+^~!k@c*f~xVpkTc6pu=zlc6*<=UNEZ=@jrX@&
zx{8T@uXU~M<bWqWUo(EjK?1Qohy?o`E)P6jjx>GD97nkwevD5E$whfs^o|+?^S*L8
zI!ht>D-|w4!_M&GsJ!SYe_A*xpTAWQ<*G5?U8+57`}9NJnO-xb{f_wEOA1A2oZOWt
zxS7Rnq(QhHM+|S2Kc+eb52<H}rJW5CAH}9x)rml(^(iaHN(G!kmzgf6H5$juJCZJF
zWS*^KcAbuwEcT8VK{^&q=$F=8h=|o{Rc?c}%)s*n{*DY>k0h}-C)e!N-_8_jwKd&(
zCXVg%#FOKd)i7bk>&cV=iFR8%Y`zWpe6{q0-Jj}5Go#X&DC}jaJ7muki|=qcF>Xef
zB$R!8jnUQ_EDYI2&-hhs5sbNEtR(*1u_CIeXn_Hq6hpiilA@x^AljB~&d+twUCr^;
zTsG**ys7+^*axFJTvB4`x9S~Sda;9xlN5@ik59k1AZL!b*@SEogGt3-ksT4>YY`}s
z2U#M8#P)bG14F5LwU}ymhAajM1bj3z34g3T!^MZf*8F2OmCcz*9cfOpsi<w48oN2X
zqo6OwAzqs9G4PO$Xq_;P4@cHw>PBA;iUb_!VC(snIw!6l%xY0!kVV|*x`giwRn<Yh
zMdDs6I6lmgmRmKA7Bb6Ocb&9Z`BawWYi(Kb7uw0dE0yiF@XoIJ*_qgq@79Kz&MPYM
zU+zgQII7b~Yms%GJUvT2@l3|5GW}MX6!EFP!5sCL60cSSi}{9wz@)R7_ONm!qQR<*
z)b}#)tq;9_LPWi_vz6??GNYvVZV^;BwRugohT66!|7@#V3q?i#<M=BXA_-ky4(D+!
zUBB@ZZZ95-N&V)^cZ*>o-r2hwn7=WETWM{m$R0l{dY@@F!0^TJ%AYNwR~c$hMrcPH
z7A}k|ypVbS1v=YHD^&2~uH^M$(SVAkOl_yOl^L$y-uI1&IsJog>^hH}T&=zD$TH9P
zM6Q>2@QG0S=)Y<~4<z?vyGxZq!y;H~jlcZm@R*)nMVzWAUbstx_E1@af^kxG!>d`#
z_8?121FYv&HFk`9S~1^f`eu31syFC+>kAwX({({L70t4iiivI%4E3{m+Fm>oEDvk{
z$#r$9$!wP$kS`m!U-|$+3c!I%f=SulR&68f4UCYDSVlv)KuPK^Zy$NqKYz+f>7r4u
z4uLDShpFwKbYV-jx!qhy!OEw(G-ay2wN>9*^bF`2{WT}35BcHR)dmwc^Q*Qo6=}Lq
zA4l!HSM9Le(E~3g%rJc42^~H+-lesA4<1hS7VB)^IQNgs;!w{*tAc8%aevL3lWxg-
z+XN?SVb(5Wlrq%bE7I?^++dVpspiv+`Owf9GL!eyJJCg2O&BRPl+^|(2aH0?Yvby0
z-^wYSx!t#s3Z*+FoC;Iqphpn}e=$ra4_|4pK5QZ?S81wv@Q04!3-toyJyWf;@C)51
z@&{dOYS)-D7L^xWh{FZiq0NWVw$~in98f!(t8#Op-i#ONJBEZj&J}(U(9apLqjR@x
zse<Bdy23}Na`-I!kHO%ib4a7C-75D<d4A0Cohkv0#0}=l;Dv^MBh?v#z_PM>kEW%^
z7b9F_5bbDO|DCh<{YsjZC2eb-C2*IcaBpb7^QyCxUvE;*#A{bH?vEe5<@w@8g{A3>
z6El3(JFp=%5>_q)#_NN>ZO8?PNcEw<cfVc^IpJ#|*}MY7I45eO^TeF)+mc;0D%QzT
z*SY>_%z(?$TKvhsLtp-*5G&HYV3HV%&wRc)?u0d{+#NFV{qP%y<wx;R%OEL+gm!H!
zJo0_ei8o(_r%I}C+FqBUe%vK|WM`={Yts~;L>?qB2cau2&F8EyO(g!QXKdCoz$|+p
zB}hvA9Q~@Q57Aru%T~i;1>2QNrV=Z!Ca=yMhf21iMHRmo<Fl&I2yK9~d+U=^1q)ur
zgk!K$!NP}<HR!q1^tzv-K)D(!c3s&LXGPbHQC?$s1RY;(O!#^)Sps?ir}KIt*YV2c
zbnnSu&xHUp-tXggZEO|g=FI%@Z}8w&Ilr%h^SWvr>nht>`5Y=jze2cpfA<CEeu}so
z>BLsHHn*7gdV7kud}WBSK5CcO<dMc`Xq*Dk06S^UqpnT$lsFCaRkmiQ(HF;ap2Jnc
zT+{hA!!$A*aN51Yc{3XYCeK8Y(Gt0D3D(f)UX{{#%YKMYkpA~H<UEfN=7m6a81M@E
z&=hh$ZmZXd@!Ao4Ye;|5oFP^xO#%r%OI$?cn~3_8X(NwPxTJ8Rs`s1Z`VV!gAvqLe
z$%CYWgU+}mlBwmp)06hg1*2JA8^%R9^IP;AzXGUs5+x`3$?jPQf`^Jc%jd&s_)yvK
zIyUmsa_!-Guyy31Hp#y2yYa*Qfldw6M3;lqQg_APzp_%y`VKsnmb4+=G-B$1QI+}k
zKI-b3W#T=LV9OC<o8<pCXl`5&a?al<sG?s|5I;+ae#(t#P4m@Wi<rhpAD2GAu!{;$
zMW3-QI85xYGFngCv_SAgj`4xKmemvY3@3^Qgz}>mGv3Ij;?r`(F(r;@3`Bi|OZaXf
z@AqteMl9Wbbl5#)JK4j{3xk|ES(!$8__Nb~En+Pu=P~&eyb-vu6Z=5$hiZ7d#r+DG
zZ^fr9&mCAMP2mcz{R?lKhK7&{F=T|ur}mz4;lxRjle5>34%YX#u)vcdKg-)~(=oL;
z2BN-=aTfV?^~>_83bl53fO6S{#}Fr}SHB?Ro&d22p;q}Tbv<2M+nC1HJOQZlTsg<w
zl-u{RJr=zM3q<(bHXjl8?`z1PQQJCM@&tL1WO{Em$uHPH-5L}rGmh+*d^S?L%o0<I
z-sadJKBh;E&Az|z>+^#@;oX-nPIh>MalAn&PuO+Ds(N&ELDrJ&wm9c+k`VqtL;2CG
zlkn8LMtn}4us5UIv6Z1Zl=d<%o0_>c3EE(Ge=cpQ&3lKRD73R(z(P1I2wvbSGM8tz
z#3wnC(^4&0B~{%wQz^sZt?MJ0Ph~$)VK+le;ZO`CDDQD9xkr_9s$hq|tdd}FVm)2q
zFFPkMfn!*M-PkQ-vDL{iK~szS0aMlPFoA=rVMN8A##5q(vox7kkLy#&2NojLK6@~l
z#SZ8xmbDbuP>>^$H(A-dd@~dCs^U)|!wO#Ky^mpcuphH$Y{?Uo#UfG(QOq?1CwCm=
zx%l#{?2r9o{dn!Co0PEh;&N-`ytym)1s%0GQ7`FxKW!Tep=xXXrcZw&>8`XsSIbV%
z&n0M6rde5-rNoJoUcj78#&(NK9^$GY33|4t{B15FoiYZ~g)0xfw3PyUMg*Z3?MQUB
z+Xk-ki;qEEwc@I6L`~bBulSEXgX|0(Q6WezrS!&3(q^xv-rB0ij)0X<PKSR_{st*_
zxvbjuMaXA`dzCo;QkJhouV$5V;m{=~WT9*nqn0cIZmkmLVNs|t?Z<~7+l+TFSE)P=
z6)5dw%BeC)5BjCxT-Cv^3Zmm9c(gLdYGzxiZ<NSbtGM)jY4let6?invV?D-E<?#p`
z_lJ>yxrc<N^uS8EV*;r>J<cTIQCfsm!d<~<h9<ws?{!ixw(@PBQl6|N%4G9OOz15x
zZ{Cg0x2fS{Z4PMW8@G!w>m8rnaHAWZFqZaiR(?NXLK8(zj-3dp$apR`rRwc6yB|;)
zy2#PRB`EP{zy{SH77pW-4*#h~BXsd5cIw=NNl30>BzB}BOwF+;j^{i8z359yvt`?w
zDz*cRUpG*oArbB)Vl49-<8ynY1A8~EqMzDhbY?!W-ugE&cmA-FF58SbBg1tHGV{Hw
z;>5|Hgx;U(DV|{|m8gpil(!vg)KGeO;pTfUzErfL`Sf0pu8ZHi&o-sj=R^QxVvFfA
z5#J0TnJUdloK(Xe2I>(GTAJGMsnoJz!^EC!;GgR7d2bQ+c0v@IMi(ffM2M(dg8W2e
zX=h?oCuBr=Ppzk2qU32sm8vSXej8|l%t}1p<>PGS#W-Q!R8ppeztSVJHhUZG13Vqu
z1gD9lA13`}^)RdhyV?1AV(hEg@9@m@=NnP7q?0vf3tnYbH4-GcqOw-TCekNtEL$uA
z;RjTL+qk1^<39_qa?IO+8+bLHemzax{5v33*!}stPJG*mBEj9F%7u%G+UKA;>*efZ
z3+fct=e*+&ScLo2{HF;J0k<`Npc+m9tlBY{9AoQBTUoTxx(-2z(qRr>IRmFEQeIqx
zm)q}kJ`(nQ@P`VM(r`^N!ct6Fg$tiQZ0R6>C>x496|j|P{~n$p%+Zv`stu3Y?hf_M
zw)=V?32)9k;nx%?>>nedL&j4~rpz!M=|^#wm!a&tn9>ECfA4gBC!EH{pQh-a8`?6D
zH+0(?qN1(`DB%p&vZ4FD>)EtrWOz8J%C(rUcLic%(+%qK&;D#JsAmR#rDcB-uVxLX
zpljY%bR>m91OYv$RitwW<U}7()GKhYl`VQP9Eln@z;3P^ACC8QTdMFooHM#{OTwVK
zU+E`lna=-`sxR0?CQ5P31i>3?MGH&Q!+<K?u&C-_4J%=oPXo6rUv}T0BimBrsTd-4
z0xuDY0X1>5l4%NIWDt~$U9|AzhKpe*p%1e5UqQu8738Tr0brmcu<T!6Uas#@x88U>
zz>UNk&J+(~Yq>hIEp0jj^_?J=9kel+esf#eH>R#kPELLek_p@aN~vXjP`8;DPR1V*
z9u7Ez#UuDNm$*M(rYeW<)Q!7OjBxc<(J>ijyha)1ut-Ox%@e(kIP*eax+YvR?q}wE
zWvFjA>lkeKB?bA(eEoTRzAwk?u|yHQF-Vvj#ntz>FN^7|^`!L%MprkgzUO@(nM>`4
zCY~a_?7wm%%#QZ{3of_~tsD>H-Vpq!Tk!F0uWldU0KhE(VdN#iT(IL`&o5q+6E}ib
z={3+Mg#XOJKw00PMUUNLb%#q1(BpLnQG=c@+--($+}`YcJN4UR51K(oHUvIN#>zIg
zQ`RM}+|Jj7Xp`UQJo~vvmKi!O?7`h0Cr8Q2xe=1wpiq6Ppub`o>!TDfRO7g)BtdNG
zqUy0T0+<5OlG}jxyHzB+_hBeQy64etkv8L?u4O8(59$gi7Q6SzIJ}pBe(rsYk3p5t
zyLWS`yrD#XeSy_$ZqJt>d;Q(dYvrz|L!0n=!|B;8?@NR(Y$EZA)T9{<nQpNi*zXW-
zMTAe$9A+Z}Ua4YqWKX5*aN?|#ShJ=;`C>GkJdiOH(+W~r<{R8^wxmTp0P<jT6dj-Q
zAwpm!7#IPfhn)m54qLQf!b`qhCoEcmpt#m24*2}4DKuqlD`6&6SX<g<HpWznC8z*G
z`;GH!2{ehCInu?Q`njH}TxG;*%B@BUd{wRg)<`SCD*L^MkHf;k^11-Qy3a7y_ZEn&
z7-_R-qRzPy7lSR@EJD@S7Qe}_f4DvHCoz5XMC)6{;!9g4t0IK5pmecOc;73WvYLyt
zwIpnnhr%5kRLZuCzZ8DxH5j+uJskti1Ki5fbB;uvJh$<{>wqSUzprPX_dZ~SXO0fs
z=d%zLt{YwIcCvvo#LSpNu?NGjV<Wx9)*mBWidzMv+WN!6sn(2>K~4quOLhDr0;<3>
zjR2^}yVITV1J6z2+}SudfL4vOt}Zu4<LIBCrn7aM9dx|nI_2YHJ(8ZUy4hN+r9^xx
zv(Af|sv|2P+jw9#ne~|eOi|+{_YjFcYh`~L+xrCwU6Ou>zu&t_L-$nh2#_Xs9m^HH
z-u@;Z|JWch6@s-x<&UO-d4m$Y(Nh#X;z!x$Pd)uk9@pNRnN?;Z#LDeDe^IW|Z8h%X
zP^_j$8O=XO?75>zwpu}qR7%)dbT|rN_k@B_4G4sSJ|+y9iQL%~Dxl67%l$nRT}Yt^
zK%b++NYAR7*CREJuR=F5<KGl66~e9Kd@Xi88|vT)ajLnzGsWL2+u>=#_#;tKQQ)TK
z<sy;DU@O$sU)76E(VM@O146cDW^0w{*L&8vseIe?N{_&0Mx;~Rj4Ik(C|{F)B(N)7
zf9Pccf6GATt-cW~wVv&#B8hlaY)C<>`9R<yW%i0(w%)atE8SlW@~pZi<c8%YU4W$+
zQ@>?pv#iX!Hbwr_;gIpMfMVz4^qVX8n<IAR0J!>Hf4onLy`O!WMHCIr3*+%sOMD`;
zL+if6{QBw@7*@X*4~UtXKkAcp6>8iZ%_i*~vFiGr>l_}Q=8#yoilz0;eeNCjzn_3|
z`Vq;exT04a_{DnFJ-KrqHd8?`XFye&{510BJhCGscqV-drj<(q{M^d0a(2UbdN$8}
z{n<&5#?La$H|y+(rDB{3w>Mn&FIp>(vf9_LhIeF+pRR683GP~u?M?#AV6vqdD7Uzt
zOZSHJXB}Hog9ijw!**6dF?~7s=Yt!L8Wp`BWxr}?SE$a6!RDKPVC+z_H15biy<8P=
zuUXPHwcT5NYlC&xr1%UyJZ~aIolj&OMp%FzAY1aFI#Vrb?;Acr<H@&Ya(pNY=IH5m
z)NC5$l0IY(G5gQJ9pk}qIskd&TdvkYs?W{T4-vOEbYhKUhsemtMVC=UfI}qT=K34}
z+5(G+<@_X9)NA3xX494=`vpkUIOi5U<`(C1U3T=b53a6;?p5xNNPx>hZqinW`o#D|
zOm6Lq9u}0vkx%o7fTgncng@~@@)~3J<;0|vq8JHrZfDJJeN1R74|mX`Su84i`~S-z
z;;pJYcs(~59vOMt{JL6&IS@YeOT+~Fu!5*`N`2yo@I-B4eBP}u!i7x*vR(&jIX?MG
z^n!lWHqFMg{(`ovSLo}Z=v=25-O=+m^hqC1==>$BY$r?pll0BcO%w7w{|%fBAMmPk
zSZJ&xrM&9VZazwyY(&hhv<g)$@wdFvY5V*E^($ST0Q@08CD16L#7ii|^cY7nMFKb`
zB%@Jz-B{2P7I>@UenGxBt*UALDa^M3`iAO@o{I}T<}!;(AO;nEFB+PO_fcz5R_xzW
z&v+40iPS5#B>Ze8(?d9`wn~|tgnrR;&QlG0)xtTMy56@k2!VvuTl&2J*%eY#wdX3`
z$K6MhXONhcF;3JBqGw&kYOa-3ljt%}Te*cygpi|q0gwp|yS>e^NmMTJhGIcImaOn+
z!coH&ibj)|w{ApnS#b6ow$qNi{xV_w_Q)N}OD)ZjJ}G~W{?vW_u+u=VVc831ym_(2
zh%2gUoBvbCdsH%ynU_)#<|v2k3!&l^CmJ)Yz(z9;N#MU=kQn1J3aqOBbglU8n@4jP
zyE%-&Bu17e_F1qsZ#Ok2x9MiY0A|E_wRG<HuJo(p8NdWnfv*aj{G^a(I)1wo^!)g7
zR#ZF9&;F!C%jy)&bq{Bf8>~JX@FMtRy*lK+&?Pz`d?@aR5i0VIrz;vGtH5$xO~P!4
zvD94!UoKhv_7`vmh$~+~W4WB$c~@ZF!eK{dT#Tb{!xWTZzTNH5Uz*e_Qnmxz+L(y*
zXq3W&#?3zP5!0F~_a*g}4ul;W5<8tuLjMfhj}Oiv`Y+Gf8FJtNYeuUK>{z_MhkCcx
z<-?}5=_$|^S*0so_IgjT0xHRod`r|@FbAdAr}#YkYlMmpPTJ@az-&M=GPAWGVPg{v
zyaEyfTA!jvp-8lyliW5k$D||4z(u1|rkF5uOz2)#_C1ap;+qyGhr^}oAK(6QMp(?D
zq2nsW#~*L?=Y*@aB-(G1|H0m;8hiesN0ryEl<v@Y-7#6sLei4=>D^u-HZIh4?eEAY
z;<xNd@dmF=3$_^NI_vHtLGvjQwO0?Y36$;}E1^(NYu|5uCJce7+W{B6&l8zm7wfaf
z+K?&e8?v=kgnldR<AjNlxs=zQAQyFF-l3u0H@Mv+z@}Kl*BbWVmJB~>I~T#f;R$t2
zVUuqy`viV|>(Uej)WB)t9~eJ};%(YE5gz_2;uc>=GZy++#NYH*6GuG!XeDKZ_ws*t
z{gWX0>F9v;m*kKFZ9!8I{x|l25`<Ib5!edAZ%UlzmP`J}VaOl;%k}_aw=Q}D{o_Fl
zOFJnNuwww40`b2b3d94^&{}ywrQB^JXZ~Fy;T;zBtdzdepdlHn|EFySIEZz=J7vBL
zi-@RU{|+1!#bmx>!-lh;G?51NF5651QXALQ2Iv>e&wLl_<CMZ-q)lM?gwoorc;0uP
ztzoZ1Jm@k0up<BbEx!iDi5$iMk^TyRjI)2HzaGriI)X6=IM^USG%k83*e$w@*B|`w
zHsS_EH5wZ1(f{KpeUWRH5;1^%%Rzws6MA?j4Jv(ZP|P5Q=IVH`bS*p><dfB!_r`%i
zyU5v;Y3-u-$4k3P;@fWE5(_3P1jCZVhOue&CnNH3D=@0quf+LujncTuyS-W&*?V(!
zu<mF&X6+IM<<$2paEU7L4nLc=V86W+TZ|3v2XAZa5<P4{LZU>K<zU+X`sjbC^!t_l
zw<E%TyT`*8<G-eMDKwkcOk>?{1tHV}TrXz=5is7Aml%(R$Nl%2Z{3>D_a3_KO+}@7
zoG%B#tw27<f1PAVb)wWrSpwu4D=KR?AX48UA>bnu7GUBF-p2<wmrv2C!Oebb^8n<3
zfV|k_jsDB?AEF{6B5&!Qi+G-2?3OZQ-Lms`c12#GDGMT?`@uryW*I<^5J-X<&Km^p
zyURcvvNW%=Y10V7+ZkXe5o<ljl}YnF>h2091|ZygsmFNXMGv3+ZO?2?$zrFX%`yb1
z1t$a-8cc1+ZnK2}WCpxA7-+)qPorMDN-!t5-4?^|AE5sK?;B$D-{2|+-N!oh3q1k1
P7EM-CNuor|*!MpG8=PQ2

literal 0
HcmV?d00001

diff --git a/demo/documented/nonlinear-poisson/plot_u_gradient.png b/demo/documented/nonlinear-poisson/plot_u_gradient.png
new file mode 100644
index 0000000000000000000000000000000000000000..b968113cdb49b5674363f6fcc39645faae90a341
GIT binary patch
literal 34141
zcmeFZWl$VZ-zVC*JAq)q-Q696y9IZ*;LZ>rxVyU(+?|jB!QCymyZfCyyIZ%m_O18U
z{k~tOx~6;job&s;O}Mh66bd3fA^-p=GSU*N008*~03hPvA;I6gYK2b#00|%?A*$|~
zb+YE+i#@jtcVRhvmt*IB4kK2EAV{K7p$^eu@+*)g0#Q{0!^f*8qKlpj`vgW5KKPR?
zNq+E6oI%TZ(tT_+sd)oGgc$s@ukbzE*~MrU)Ou#_{%E=je9k@uX)yYgx|xRu0KPa<
z{1^;R8Z3YhODYCW8XF=ShA#G}&={Qz{EXHAz4d?5_+PwnYuDf3f4}Bo`2O~4&Zhn4
z%i>mlWMyUL+B&Dto!yo&)3AZhDQ6(b^vn#iOraK4;Qr&;8I%}&K9ahgURFYa*vw6%
z^-MxSf?|$9o748^a`lY(_|5(O{jGtUo13kzE%2>kxm0&-Xh})Q@bGZ%b<gb;#~wc!
z{4TbC?5K>^Y&BH?1&3<4)~->k%3Gb3oUD+>V*DqLlz_|btB;SOqN13Xn3O1s=|Gg<
z^IbNNlUU)DUf<^$j(==Ct9B_+qgl!Au*&0gwUe^I?YJ%gdh-qXDU#r@4r+t%W7KVy
z&lP$NCH8MUYd>bPFRbePYh!XZ?K3)*i@kvX-hh&ZmX;;UM_3g6*}bPc(V$Ta7X^he
z7~v%&mQ~REYlFp@O=6(_vX#eA5()VHoQi@1NWhg(Kl9kT>l46aaXY-+WE&X~;q2nl
z)zxKcYKqHjV8`;Yy?yFT%)<i?T?}5IWH6~jn!?6Kp8<#a{S1bNiOK)<c42#K>y!6E
zesFMbBDGTYMITZSEXs0+M~zO^S;6NHjDLcgubJcjbhx;<DCl$dXV)2!mXS$kw;ZoE
z{-s%C@H$Liqqp4bd1&q@b<oI~g)a$D>iTKodIP*^B<9Y)(xPzX>Q5&P6aH_H`+`or
z`#Aqzd8;0Co32^eH0G8$1`A+I>i4qK)6v=3*r=+ht>_VRSSg#En|pbAX>lxfvA|=9
zm6baGP%5veuyI+dbG`2CwojF&046&*O466?V1Z)Qr4P~W%*bM3jZ@yJQ>9os^5>70
zi{D1KAAWSnqwW2;5IY5h+3|dpeYN98w;%(9e7U;2WZ@c85ISkFH(de+Sa~(r%vDTJ
zPwz!qG<dx}-MZ|L+pkO9Tn-X@_+FDtzTR)V|He|v67*?)ly!2tOjHu`+VHzaa8xHT
z@Ya6c#y(>RLKhSK0%k8+*@!WVOm0U5UteE$_d6xwS9M+84v+Kog99rm6jAi0rKQWu
z%Tq^>_J*i62VyYO{0xG_WztJaOY?lXIYbkBAQ2MsUum|Faij?5phLeuGbf6T_i#F8
zHu=Y?6Po(^T^3^*V3tZsNwH~KcG@1O((mA6W2<k=YY>G8kbiZ)T#aOM+4DJVNyy8O
zf(0Xm*>L@8MYJUvG5CL|V0{G9FydKqFkW1GaObD(VKcM+{cQiIs@~)WV=A_`$JRsc
ziYWD8=<@&hKuA|7+%?~K@_$c%LivYkoYXHcqmu4S{UaZ|7l+<Ie9Bf>9z+GfreO9z
zR0V(ik7nRs{1XB2UXcBjW5KNI_8(IIzc2Fmw{Uy3{`8t)FUCJhf)@H;SrVocQSh7X
zPcUEdKK(O3n*Y0nIsdm2Hv)qHb`6E7|7=BU4e@_F#0AkmIdCxT|Ib#G@B99@v;EIQ
z;Es^|J4EXj*ng{A{Fkd&!v7!dPbJ9r&+F(2Ko{Ewqv_gqiSoX%rY{1oPs_m3O)l{%
zATIjwjEN*zIg|xnC3SmDx1$3|3u>CX5d52J<^Nu9o`M#vIE0>08o)Zwxvf*H#voSU
zD(t6G>%-?7dFYAjwKX^}{<vkWtvr;J-%AdyXG$n3DYFH<oVN#}Rm(ZZ$$w2uO!P+|
z9v*@h0^gELWwOVD{#@vEvREe-LzvELI&iW1Yh-v>=;1F^v8va_U(xSkPOQ<*_Z~qn
zkZ-fNc0ZP9-^l(W^G1<4jC^1J_Rd%7YS1Nb%W7*c1tVaEAmh~=|AK94+27frprB|(
z2rSL@e@eH^S!#2!w6Uq!mK7Hlx3M|8Ih<LjF$7&kH#heGI8lF<%%Ea#><JSMW5QBx
z$*9y{Tk8@zsOY=y)Tvr;b=uw;O4K#j==8dNdAvq}g_3Fadf(-MheIX&NJP{H7MT>>
zo~NVA{T!dOgQ-H?4J$b<G4w4k{OLxBWUfPVb8~peA)-OBO>II}lOzpGdTMGe5EDCI
zZ{Tgn$jI1NOG!#*3;DH2;-4CP3@)pTTc2?Az-6Ko6I$|{`Vbo-unHz&s;Z<U3~=Du
z&b4ssEePmc93@{}U73%hG_|Frr{iH`&$>mslOv1GYP23vx3?p(9VlyYPepORIxj6B
z@trJnXLo(SX^%m)d1lAZCnZ$NAd4>>bF2HZ`qGgti5{#@SA3{xn7%MSU#;D+H?Qk>
z3f9=TVD|QAsV)L}c;v(7^}U%O4d`E->W#&w*0PsTvwcKXE0I5(tJHcn-s*2qUK9Rw
z{Pu~&)jFPZupP`+DM)gneAYE9_;jwU**CW^0))3DU}6s^(Q0UDZ1`R)JgfYjg9t*`
zw{I<IW_}bzKfHgD6#B-Sa?~8c=$p;!?l(eT@H-iIiRlP?@JYUMZh5bL%mNCCC}6sJ
zL_tBpqE-~}xjS*}d7Xbzt*s>JdI774c3<ha)sY!=Eq_wAFGb#Aactg`F){ul{#%D7
z83&TMlMu7oF}MGAU|-Fj;^2O_a(9P@$M0?@D*Ch8eua#joLQ-G4H7J{_tO1Ia#w`a
zmzm(tQt6FI{p{bI@XP(tOTzVIAL#xrH*;F9+dLXllCLKzuKKe2i7Q$+>0~RW#!uZ5
zuXg)AbKomnFP!1#6%?4<987_25LgX^t?E(xXGRJy-uLZBG_X`l*W|QN#m%lCH;3eL
zq*m~bKU^1kC#e-J{K9=luik>}(aI+?aMHTqS$pTkg*j>400PuMM@YSGHukn(3yqx5
zF#quR1M~lFbd<r2rlX@{Z*TvMjlFJ#7RW!6HxfK6I6T+AxYpIW9QX75Yrltw2Xj_o
z(C3*h;@TJ18Mk!Tt?MGX0N(3V#_NWWnYv2({~spFv8O@a&+jz=0%|-*u*3ay`Hq$c
z?8<zLM!cadJY6Mz*jkleXaWn}L3mm1FFVoF9%}Ja;=``sO8=$~9o*X$vk6x$(;~8@
zv-=W8zluz${tb(XM``K8de#=FIZC@jnUVq#D=9$(H@DjiPTOX?B~=}riaDFXXo42-
zYAKGld>?`>$FsoN>aeV8PxgNptZIuQ69&tdjt(EE4`lH7?=6&^rfuH$phwr$)X^cB
z)G|Yb-?Wup;_<J);h1cSu;$|{M5sI}k5%$a#+_BS2f5Whc6;qjyJPC}uJ3j-S-N<{
zE4l}O&6AceT}9j&%ITTG4RV41#v=O~gMINYoVcIt_8k@-Uh1nTA|oe*8@SWeTkXa2
zQwYaD4f*Nf?(k^vc#^KB8=B^Bi94Bg(#xcJ!RA1pP5t+ZUCuM7gzL>atL3NGMukW?
zfuAb`r&90x6;#%!MC{*&RvboNRwdI-?y!mmVjaske4l?rvW=ahsTz2{t$qT^UJHIb
zNN5RxRRUC8duZ$OLVE|UeqaQX@dUJ+2XjCK|3Hpw4+8L^F^18rUXBmlnO*m${1{&)
z*Yca@G8&`1KGmnrm^{k)8!5e1nZfG1m#&J#h4KaMJNMSeOy?^*CtplmUH$h>0!1Y0
z@Gra$wG>=YS5tKwZpq9Yk3o6#C}2f>P@o*%Q%Ak*|7)R{>IS3v!n`H6z*LK^G^bnQ
z_31qQ+p9$ReH!R%L$wC$HmmBf<;0Tx(8Ic9`riCAEwiAm){F`bUs-9C`khv|cxT#G
z$kvC4%dKQouzaFPQk$_Zb#-*$I)o+UHW6!|HOo7X`RFY%J%`8Yrw*0$^y8ej5MejE
zs|$iiNt5S6vzvOA?&}hKB1+Gmb#v99zZoo`CEcQ8KiUF$m$`)9&4H?u$s7BKhfwVT
z>wj-k8`|K)n+di6@HzTaE@A8xzj)k>q0>F_-bFn}TS)kAv=AE{bjyDs<4Qy|w3G2@
z$dP1yHCDwndOKw-5tslUV$Vm$k+`~gK#~SBz<(&ZF*b%{Hv<)S;nlaXus%-exia(#
z3ZhxHkhI}w)n`!O15+OstP}DzrN?Nh{X3r7Zdt00wX|FVV$vpd{B}#Iobf*h^*>GM
zSC9M-S36w1oWJ2-te9aMrpfN{JxUl*N~NvNMg;~o^b{<-H`t}HPX^T&G`fy_`=i}u
ziB*|W{vEdb^h0zCR`HzSsfW%XNUESdH<m&g0$RC=GFl4%+JOJ~Nh!D;5|;GHqUhea
zdU<YHfCBo^k6!EbvY75z)pdGgl$D!a8xWcG!E-D(8}~ifvyPuhYtRjDVUo*KIt)VI
z=-DawEMyW@1VW4}+B{Y|EtVv@V-cxIXV1C2HK{lb8}J3ne1*IG(kW);dcL;)QDVF=
zZ%W2T38f!d_h3Ve^5YxV1UnBl#rbR`y{cxsoqw;gA5S*H9t(Bcx^3%`#@ZUvtYFzi
zlii!z*+{`cz2$0Z_*0kVL}!B<5jrK~j;u$+9JOBRP-*w5?$H>iP206F?T)1Un*06o
zliHq*fx3_hGAWK6nYq06hd7B}O7HIKhnyWfHu3_Z=ywqV3CTnj4e$2h5hW@l#`K&C
zbNh-_d`sO7FW=zpD>Nx9wFc!Ndea<NgdU@gg)!QVm;=st?ao-g*6-87k~#<8=nT)b
zJ}tO|VQYx1bbaULEhqXlXMft~Z~*(Y2~K}O`I{;2`&6^ISjs@B_3OUSy}3B9wnq;P
zaCO<T664@P<atDJme+ZsXX^JlNT8QgPKBI|rT`nraxQ$vhi%>kDG7n^BUz}f1v-l^
zESYIK9Wjf~_?!9KDRuk}0BGL38P0E;)e5JOZj(Erf6j0`8Oxdne}re*Tlv%1UQyUw
z=*ZoAK!*tyB7MlBd)ewI%o=YgL6{G&NV-?yak6|b?o=CN>iaP0)QSbB)vWdgNA2>{
zj#;e>Uws@(C<}in!9oPw&5uwkmfmzX)d-iS^M+V1g^aCaYkF@8$6C=S7llBHess^O
zUO#w|Bmo}Q68>^h62kYnk6Q_-?z-Aw1AXVQlSMY>VET%vt7y9XarM>Ley(qQ9PZtm
zz8G>I1lj*-NPV$gYFL(;B>M&?Jes)8`QIbGQ_}F@yyp|sm=aeHW|6F?3j1@+7V`uZ
zW)^MY1`P))$ztnB8T+sm3A>UE)>u^3%GaKK{n;?zuGxmcDSrby1;4pt!}c;{Uz_?r
zhNtk7<+<7AbxEL<neNf^6lil{VyC!*r_ct7#GTvc<10fCHudQ45h+$Op0b(`06b*W
zWAiViq*)^N!HvAp$G%Cul5@uJ3|chVM4JMM0yPwXBth(~=WZjH4e>=zBtSH*9lJcO
z7cZL_HMAY|(1l&gOVZAP?5Jtk-?wRn?Xvf_87j7eF%ence64HX()RGLE<*Zz=h&RT
z_%sBTgi{c&TF|8wcd2FB{>JA+zpBC5w717K$#k1l^v6jv5`=<F<l>~HA7>ZAe|k%)
z<lImcm?1~x+tB!OB{U@H3vwf@b%@mL$~O#4k(w=qbXL3BoYH$HSiYyQu^Af-_-3}O
zwwlT)>|)rCWV~@po8yytRsZIXfCNbL_85==y%ZQ=-N4N0HTCaM&K?xl)X|5#{3mXl
zy`HR_U@6sfo%%&-J>je|csi&b-3y2ia)-na+b*BH*-Fj@YS>ABJ3Np5U|J0WY-{dY
zz6^(yq<g$q<_M@R3+GgFt9NZyK(*ufX)OH4g8r$_*$yvhoyPao$=QX5&J9J%Vc1m%
zubD=`lj7&YqmR!50g|0Y2g+csEk9?5Z|*>K(j&5(1l1Cu7XH=8tt3*@pyHj{E^~7c
z%r(mtioVcWB<dh6>A-;c210;v<EMYq0Ad*oIJDx6Mt{7zQ_N~wo0HDXY#pZGlF;Vc
z!l9aYeHOdyZEA)((@L2(E<F4rlVTr>cphLkE1<e>`|@+{&9b0Y`tUDC()xn?R+)8X
zB_7i5qWWW;Ss=w2oD#=Nr#LT<D(0cu>+bqp^0yJ{sW+SLYQ5a!&ePqJ)qeggA!YoM
z`6%R@j?Z*R$&jL7WEqIQn`{;OzgNYO0s%~A<vdpQ?_`r5sh+d1m^JVT;cDEkDA-&%
zuM2O_!`Ets<ol6`F;3zZlU>s^@6woHW=s>*1kmNeg78)|nc0}$Fa;pM$|neY@PbQ=
zn7puB{K#>yqTM$k@l$IuFUx?R_6^o(`u=K4{CZHpep?1q_Gt)>cg5?dl7o%O=kTq;
zbbsfbdiA!yGV69<v%>%q0s*mU=I^w_xQ9PPFq?8+7a_(*S(92-FwYnfC)qTji*5M{
zAt6O}<bL&w%98YAM06*<6dBj|wOp?xeP1J}mYL!TE%?0FYTBOYNMW)^1Lbf51(*jf
zYMBE8Ap#crzc`bne!My+eR_I%$+A3BYtQ4bHu-@9{4uovA1fOfVqcIlT+{hyK02N_
z5MVlH;{@??$;8f+4g^q6G%&rnY7v9!S*??_0olAdc2WRUPVjT??4&&>Ol@K5u3flU
zZ1wz;*pd0zm;Gi{A!|-Ydk#mpp7@p^y8{}T4T$Cwh6QmEotoQrAFj9}O7_xC%l$&W
z(15|3;@4Sd8GQHb_@^(&Z%l02uJsOT_!Wr0EZT%cKb{*{ZeXK}e<$3(qz_<4+Ybkp
z+LRmFAMnUxFhL9+rHQRfeJCFC7$&$%8`aV!vdXC!!{tz|2rnpCi?++EAdS5&X4J(Y
zkkwU+j>)2y{ip~t7$2iTg07r12obQGM+D?}jS5*)-5yhMQRNWwrxWrdAtMA0xZ(i*
zOFxBu+0zY&&xeC^o3FJ?d2vB#TA|c!e@B*9`KE_#jlghZOb$_}k%y;VeS2k36BlPX
zF;E${c<w$t%M5FcA98W)G-Utgv>0MG>3i(Y&0jr4y(Ux9<rO*gu>Iavom7mRcq6wN
z6%sPB;i7-&wqUnB5jn(5fjAjwv(#ppg$B_Nfj@WP>1L>dSp=O>o0{&N>YA39?-6PX
zYYn#5fzWc{-x;b#-|I`x(#rkJ`^ev(j1f7Fclx@bzBgAO7s{Hfb(GAN!}#sX^iQ!#
z(LjpiEg}P)mfB}&Z9JLJw+gy0=3kg?F65Vw@wLy{uz-_?#Ew({ilR8UfFQgVU1ko-
zgDixdI5RRTWPpS$%&J@Pb-#qc_nG-k`lrUjHa^%Zj3vjvY4LmiLYnM4i%GRGmM{`Y
zde#!xf_E~=-CmWXr1LYyTo<j4j~oG@kRg}o3UNZ2D>2+qQ_LRX=K9$3e%h#-!ZzCJ
zhzmRjIl(ELty%UgBFgFuEWOu-lL>Pw7dd%2jBykBv(ccazz9qZVnn!sK0L)F?R5P$
zgNJ7nt9uD`3HKOQ_}*Nol-!IUDJx&k#k7g>zUUN8B?}FRh=>b`XW4LQT!MaZG&0<s
zGs<RA#t>4@6a4V4U#+v@m~;@VOI%wtvAJ1JSN}r6Y6On}{M>{F(18*V9uOBnDu^{~
z^N7an1k|3OA_5`zaP4Vu0l_4L&$2was6Z__fu^5NGBOS;yh;lxXN%KqAnNb7QR!2?
z>a)zVGfDcS4STz`ydHX0?g(%~yeS(Y<97-?U!4BxIf8D<^FoB{9~L^ZR=1YQ^G8Cn
zZDP*%N0XVFnY}Bn2FhP^wvsB!VRi@b!-EScE~^g{hSkJpZu|1f6DtYnGZ!O@fHHCf
z%bCa3_gr_`dJa|*>@v!VE3-?3JLj1tsVorDW(P@3(#(^(4h|VqLT!pp%=(e9H8Sv<
z+3812JOH8Yudpsu@QRKObYlJ{H@LmC7?c08j1jT#uG5%QWln>dOE3FAAmort=A5*6
zNh_JQX0qW31%zXxnqN2ygZwdXbBbMWF&wPeFmM2;&6uK~7Z(Ab$Wm+*bX_2B8h*tm
zEe8#R-M|EtC_@J{?1I4pyuUJmGoknJw_@EtU%B+x0wZXRm5}&0v-A8sOX@41XS9n1
z;@R6C6<?eSOh1_`_Ry5EZBbFxRHjr!6of=z4y5}VY=afdo8~nC<V7+V!6RNI8sd%R
z76Y|tBKb#eh=~Qi-4}Ai8h*?9&Xyt2A#{9CMmcA;&mAsq>}@)3sq`HN99=qH18Zf)
zOX0Q<*2_-aaNxVG&z8}jY~u{<DspUk5FOelh2ja<ZsaOn>}#P)#V)1kxQQ&emJ@w7
za+QQ~j}iAyyCO;o(_JudD(u*=1A!jc2mtsJARMJ=BD}sm(lkUF*C!2EbrQ{&Fe6kc
z!}-p+43XCw@cw-It~uD*JB}yyY2v$eVc4c0#9Jml<LC|`LIw#eIzeiJ*09|wEfN7m
z=ekf-Fk@j{!K?ofYnGnu8Jko=V{3E3(dBdO>)>AViND>DtR5*co&Ppwv~(!c4v4s)
zV(C57wy+lfd1=lqm-`-o2(J@e@xlV=%mS#AC!isi4z=ab?0IZDmOb4Os+e*TNf?OI
z3r|G>#=Ev(T7O>bheSdpLrc=Qxk1aQzo{Br2=BvPgskG>u%$TY;EM;A|1oH;Lk4Dz
zZ}M?<8Qbw5f|<S+sbkSX0!Oam*%JOtYXv2Cpr#yLm;io*R27-&5@m|83;`U#rX`)A
zKCQd_w@d6Y^?08D`?u&A>Opx@sKLlrGMQXP3zEMr*)LJ7(7?%Xu-kdAA@kG2sXEPA
z=(Cs@i^$BfDlmwC0S$2Mnw%?}Xd+IrVduLs`Dg!hd^nDHBYlT=(VlqlO=q$KVFaP)
zH%s`TEur1xs>;}eI=SgPGZ|IBQ3#m`lUjwBc=m2L2OWP`mz5G&VnglkqFRjU*a(&8
zyf<FA;j;5zal<Q~FWX!Dof!p*6;Co0;dcJK&Yv+oG*RUu1U;*GMy>!)g1oOD1O=Z^
ztC4n<(ypVuY%6YP9Tr7`U|U{H+F)>M+py5U%iQ9JRUQ#fC5Tl7pNdWa1eE_dD`v4^
zsH_%Py=%C)uBjx^JcO4F3>Jwmr;0UiU;vceL!NhUuWwDY=*XnPp+06BV*fm8I9(oI
zb0yZ$=_MZi%iWlUn=P0_m>~bVS(m6`JGSI<HD17q<I?bKM{ArCf}{!;5Gf+=1+^`5
zK)dpOLGF2%B_=XKFVKX)CG!21+>uy%5w1*E9VUo3J@?v{5O46S4WD{&yGbf^{WmsZ
z#!eFQ`)Y>&HjL|Mwi}FNhkIT+B4;Ghh4hy8Wu7rnp))F3;>CyLfQ1MsxEbTk=nY48
zgG4eVg?d84T~C-rj92?#*4cX4MdlUJM3e<V6w-LLG+;a4sFkiTSlJYAHY5cTf~BY!
z92ZJY_9@mWxL~~Ur@CF`lI<V=pF_)pQZ$<9tf-xG$P^Gj^rQP(Qhs;b%A-josnNSs
zBOe|XtLzSu<WE+tDJg@*!M)SQW1hXt`Rjs_9Nb;5gs#ui{wguWU<OKC=Y$Y3XZ!(5
z)#pj{-KgW+b9eRxK>}qFCAmWgKP7U=k7BMf?=GaSy?_HE*-=9IMr6qY5?rF7e$EYJ
z^yWa(uw}Bj>o!>K$n6?m*K;*_O*@bK0!F$6s^%hFkF5A8|48~JYvJ9uToR%z+3%>h
zn4thk?n}~PYEz7%99&d!kSR*$hO=L!&E9QNZ0_a4*c}<Qu({4vyFK4&jYnn}@b~?~
zbJ=igKApBiwJ0@RQ9Tuuwc9wo|HQM_w3$?=hfhW=UG`Mfd7-eMSOB0u=k?s9C!4|_
zz!%;>{P<tJ0Ft!EL%!Xo?H_@Uweq+uswLq?nc`DYc8{l<1Jk3LxyY#L<Ozc^8Dba#
zBqV7K*#3@C0qr(#Yq$H6g<C`Z4U%BUx)i?vBus%{M~(MVFFM#a_wDz4@O`fxFoCT=
zc(C$@dtg4waB;dFC>g$MTO^EF_|ZO1J_$}E=QBxA6Pw0RfOA_q`M#g)ldGw2GQzzX
z>xgl0PJ?M2zP%RZG2bKT^s(<-UQoPRd|?ND^+|PpB14y1+)~>UtPZh4UH%^F*--u#
z8M~(Gy~dT@vSi!ypaFW8w)Pd7<6mKDBRb2%{px7w6rf57_JEA&6ue^HJU@~G&}%qn
z{N!;YKfTANJzIsWu#;K$lV*lf^1s|DDBSSW+oeACE+5?`kL4dQvvOB03Rv*fMe}w?
zGxDt3#5S_hCy7g4?aBKXeI!-H0CUQx+^)nqoi9=}<2e#<PiQ@RqV@G5#Phj8zy%2;
z*!7QK%Pg?nknyy}a%{W+Ci$b%c+);ERoa6+Dg)jVo^hxEa@>_*liz}Z<nZSWk_O{@
z>)0)VZkR0a9Z31znU0>N9X?a!Q!-1Vb-`e#K-YEW*XWW~u)69uwIx;V%yfN$!?F)4
zrxWnyNeW+vHTHDS+LR<77YU@>hHK5C0Ga{)5#7;}?3HX`7m<j^ze0d=5lRBe$rzpj
zC&4O1#FV_WYD@$*&2;Oz-KhtWKP^1)wB!^aB(#P8LCqTTvZ+zgcZ+FXcX+4|do#9Q
zT6~A^95#?bzJGq%Zy*a-E(>Q+81o}<gtAlw07$c7v)ry6NjPuiYS;^l-zZ=!`0MYQ
z*NY{rVnj4O+P$GZrxTAdiaV_$^X*gQvL!0MI2z3EYc*`Q6k#s<!RKsz^|u~1MUnyF
zKZphs+btoD>~Vb8H^4jjvjt%^ma0(ReC3S^Ebp5<|1?qhCK{%UHGND~y%(|A-i|U&
zA6@Ch`DXR``}$8Dg9my8nPtm)kfZZPgp#l-F0&aQHXl}K0x7pPd&b*a|0Qifn*TuV
z>PuwC(-VPLW%AW+rO!RcA-AT(obR;Mk^q^Lpj-0>4Gz$LudTSxe(C3;CNs>Tmb<X1
z7=4U&JU^&|xWA*6cRTvVXC0PB5?-+}60z=FZ&)Ti`U+tno)qy_1{@t1%?H_5X5DZp
zvh7g%jVRw>WFomQXN8z-$;(J&EYe3HZZe7hF1?z^jCAiSPv;XSho<}Nv=s5)M)*MQ
zP{YeBcVY}QBh4m+(LE^*-`b5!nk5MzI$&hx2niItK;+RLUkw9*yV>Pf{^FDo>sED6
zqb@BtALu203R$f<DY2Ryh1i-Y=+PhjN3x5!&JsbFXc<&~Iw^-c8SH!I+<eo@IWxz4
zsgP{Cr}mULP_xz|MypYA?6@<!7s4zI3(N%@C)IeYS?Xrt96O{NJP%n|NA=uS{rX0w
z@O-To`~Dk3_Pygd0xDTPx_GP5v?Os35RsvoKiaYMdwIWgp(tn?-O4m#PhGqlcX1YA
zZiMfjCboTErQ^b09`Vox1JN_s3HkYtFNH-74L*DTgW9<JKm~^Nx24A6)e_H9c|I=|
zJU%(dNo?6<FW-Qr?o)eyplt5<0C6kKOxPNn@$kowe0kOejStdlwKDx+^Di(g{JQj5
zmdToAMI14CX;jyVy8c*5je^JuF9?~R)=#ho3jfaZ>5wzI^6*Mq3XaZ|RF}rJ5Q^{Q
zbBV}gOy23>ch^5OB~~4AKE;J8y3NA$WywFe;}DszHMw<z_-HH{xqRQ-w-+K16783?
z@5H$2O|XAG4XGyb7MAZ3ac4qX58P{(^z&n?d{Shav$!5Q3RxSsWER&#!-b>!MuFW9
z7M_ZC272$6#|P$%l&`lU*|Mfdp)&9ZEUAk&_uM(&ZO}lUWyLjjla5|RbTYEP3L0=E
z%^LR?Uh;$eO84*({w#q(;!HT$H-au3v3%|IwxM20Glv7J&@NAP@7nGsH|&fo7*YpH
zRe-;^l20$jRPbTZ6o_&UQBW^6x{uq`6P9zGQ#-Zm=x1n``TN2Jf0&_wMX#iHCtT2t
z-Hg&<>0Tm<UF~8J1Bc;!vcvgERwv5<NhhC5{O*ai@V#5kH+71y11EBCUxqCObRYL&
zHkf>0s3SVo{inzHn=Sgbm4&?84pU2HWltG%J#DwS1D^`JULD3wtRJRdmqM2_OQznu
zZRZaMHr$UKiTh{qj=6Y=-+3{oGPGzD@OQdy<*SOXwiyN=YPxDEonUHmqI{}AGpT{*
zDJMQ?4@y^%fI`C7&b6fdQ6UbDCyFL#Xo04A#iISV@BEOaRE)B^R0ISdeUX}ebhXr%
z&E*pF0caHcP0XDA&PQh7Mkk=K1IM*NlOSjY6QJX$5|GYYANl+>yK2`oS62~2L>?Lg
zXS%V62Eb0a*zoU%=#8V`@rFf?u5}`4+4}4(K@16y>E<fTW<@f=MoxeRd#(v!^9eo%
zA5@4vZ44#1@&5knTj#)`)lnt)JQIc5^KIx|?8`0#mEnQiH?vXQ`6>sl7$<+zBS_Uv
z^S8m*OaVZ7+&7MK>_feXI;S7k?y=VWdM1#UBNTFXUG23n_MimXw{j}`L^JJ6QsX`&
zw9rpV9~uspx2pauea5Lphye8X?=?J+xEZ~feHu`mX2#C8>HS|DnT#m(eR{t>nN#yy
zL-gh;neG~6I!0pv@R-Pw^8F4Cw^0~?qVJl`%;`?CflZwtgTjx<0tCzl2GcH8oz|HW
zi03``#DYje?9{zWj0G9r!i@EIjXjqPQ08#XmtVt0!ApHmy}$020Tx#h3>>kfPZmVw
zG#D5_oPY2}XQFV*$_;y)77wc_&y)}@KR!eCYsG#si4i*4Y>=|CM;**LB0~vQ3hUBY
z5BGVP+33oA)qOi-qM|1RgIfv+<}`JFiHF0^X8BM-$Q$x&)}bMHhsCi&Ta2al^2VU|
zi|e+dLpO$ctb*!)Bn?NAWzIsDlJ{PCKS)xF3=^An<|BMWZF0KHnTr7}O8oN}YW^sS
zLD1Y43xX)d9;WRhcQKHs5J#xJ;0~X56V~$nwT(_}XHj!N`S(HbUO{#<QRVT9I%*o_
zyi}afHg*g+0ww8FO&-*aSp@PZQde$-pR*(j95?ErdK-7AA2{#<-$Lo09t8lMKmi-)
z8mRRUexH6H?^)~gXW->P=zAq)`eCiwXpL~d3k2MdzpxW?o9jyD!vl}zEN4?WjeI32
z;DnGj=CB8u?&ULBpuXyt1@XAG+1KRZDe`><J_z--ue`>v*k^_jk;o|8zGzNr5f7I)
z&>Fr!p{?%I6ssIL<o4r@ai05cyKPGclA#>(&abkS_8-;BY{7SVd88~v@i>KLl(T(c
z*f@K7gy5DqD23z4ta}(!`!>@Ad_Cf&u3`LuQ6H?4KNkMQrx%?oVpvZ_#johp6ICa)
zAa@lSxP@VG>4OG1C07lZvw9?RNo3PV74Tq$R45XyVIU=5DK)&Za+7(RBVTvYH4_Ua
zgd`=UFo8)9T3G-9V?wE|AnZx(9k0(5?F&L$pbtzFO86Kr4~R&Rhzx>}pm(5v$m7K|
zb?76(2Djj}iS_R^l>P!242cR7(O9Hl-Tzg)e>s|6!Bl;R0QhVm66vj$?4PxQ3jR#p
zH3U+5ns4K}Xgtn~XMV?~w-o5j;ios_Q_m1kX8T%8j;f(H7-rg6Vfa{EXtKt*Fz0_&
zNHMKMxLHXU-^-OjZ{XgOL~GXnRV5&yszKe?d(`L0Cm>=&;INVHZwR~wD4RmUxTf&{
z>!VzG)0xqBy4FfJiECIVb+2u$P8CNbSwA#F2$_$0i1xWDTtJoFa*jhyEN=gJ-1m}j
zw|I_RdpmVmh~Cgf|M%K*nufXkYZC;g{RR_jVpiZmB0lD)iN>c=MQ*6x!<m=T+`5)E
z5x*N4BtQ;F1z_<+C#~3p2mr#6sITNQQT3Ovm~-9sdM*v&z?gaMlf1&C0gP~wgV#P6
zv6q?n%)8c$4t^!h&VP|%H|L__sIF7U!38)i_yVkVq|Q-oX(_?c9YlOa2q61{Cy~*r
z#kN$!>H36vjW`Yo*b=%9XjrL-?$SQdBWzAX)tKl=-hTx91Pq~5>ufXbY)UE9q3qf=
z8y-DbgZt~3jk)vjVGxmUP=mS8JzYc}_%Y*$7}e3PsAvlI&g&CAvK`UMQBrgx6gE9z
z4pr5!zS4?frl`_q8X^Hv;rz|jov(~tsRw?cL%JaavUUoN+~kNrgQ3PG0vj+XISq{f
zk<`SOE7%Z(Fjos)%!^mu?d8<#;iP_s5~(3W0)7vG`Rc>Zb-x#4kn_^geyFR<V50aF
zdYv))r-zNAGSiNxcW0+HxP3S;rFAjLfSI3LzbOSh84kduo@%k8iC4YiJY1Dj#5LyZ
zAws6wG(=F^7%skJ!K~q_54FBkj|kh5>G7Q|3{K=Ta~%<;_opti2Ta?i?}P?5Sxq0M
zr!T7Ve3I2HRJz}8iMwfwzBCx&pVqWw^UORvqn>BZEPi%bLnC4ey=?RF-CY5BD@4yk
z#Zu7JJ9((=?vJBs+2CAn0W!5&dGNYzlE3G*CzgP}H`kA+^dC0s7e5$-rO>06)ePIs
z%-k!w0Z+xP(d@6cutpKjd&g6fu2o=gh;OrJ>fA<T75(O$fA`!~dcIN_Cj}OJ#JrS>
zUCH+|X1Cyi6k}n-6*`Pk#e7&)ih@FT03HPfAc6mLkC6;oR!?z@ct3b9(UXs&D2*ix
zxrYiU(R0O!0CUrZ<Nn6RG&$~{MsU}lH>|1$zt+koa#|?{+Vgy~ZOnx?pSO_99;62s
zZofhS`SfTHvx_cmZZqV^%0n&D{ild+*ofyS^pBy_I}iyFK}1e8#M4S#t%loZpyjLV
znxWZswuZAr1wiCDNeImV3EO&n)FnO)l@Ut?PiC2(u_%klcj*yl<qe7KMlFaa{2;sc
zi)__xD87p!y{itPzgFBADL7<sc_NJj!L+W*CU!~J5iZ~~mS@Sz=VJRPE*{e!8)fNp
zL24gHgiYY1TXLPkZkRTidFLOD2tWi~IeWs!gBxc5Xt&Bjnb<b~GT<*lL0D&rV5=#4
z*q*)le9w%H`u*=y^=Giwe^C_@!~%47w=@870hX=kPPF<=4Ar&EB>tOR>ogMHjowF<
zqlvpNwcrJhqb?(#={iT9w{9h)I<teI`8Bck&0%UmIu_LY+rg`&%ySdOtJP{$7{JTM
zP+OLG+^*bjW9%Li$ZIcYah8Bwu`2i6rGEEOL&yLET;5v-t?S4!7)x!ifBxW*H?FMx
z*kHq-fq~-3Q+JV!WsDT$N^7H?mXsHEm0Ou);0_ou`p)xFkGNpsJU^f&wjfIuFQ(L$
zobrnS(mAy8{j!Al(sAe_x<r<zIt@R7i?g7raUDeIyytQ3!KebC)HDdALHDzmjz3#u
zK)|cdBe#L|hX`iDe;yG}FkJ4tZ#OSCXnnvkn@{+U&z3vlzaVUDRCD5FYH$9oEo;oL
z(1q<DELz?lRdM>$`31~MQHCusbsue0?@Eiu$G)TLnedZv9QONF!^L1c*wmuzy4_z!
zjXgBvIWo<0Z}jU{Ic%WvS?wtmzxokENz@QXO?kWZ+m3r^LIJOW+m&1|hl1oP_?5V!
zW$899Qx#R!xy%Sjp$v*i&?BdFnx>jnvzMHtGFe{hLrmI?SW~Jtw{k}E{dXWso^oiw
zt+8l>5A?61WeqNwh7UlNn5E85tgI^!zczHwMU{DES^c$Bam|n>mRye2sed#7RWbzR
z9T|?~5T|#NR}EOwFHFyA_zoLk0%Cmuz@K}ZnNa)v81DWRQ>6w(JY$Y);9@Zw8$c!i
zfN__)U8A~P<f9$9>Ksv0a6<}i;B3s!5j2qnG*Ivjw2T(jleQ<(mAcXZ?KcDft~-Q#
zCoO%%>;6_Wz7X+tt3i5h-zJ+_vctu9chZw;K(A7c5CJyRoQ*w7r=djE->263D$lmh
zAw)n6p37QtlSPkT4c20bsso+SA8C9YiT_GVOzWXwgDqB4_sS-$$kYUyYbSY9B{H<+
zmkDjO4fh{~TixeWA6>@YUg0HM)AD-N?P`{7Z>HIST9@*~H5*vQ8Q9n)tIXI>3`Xt@
zmEg3%t5gTxRDOd*#RE9%00WpIFrV6_i?$5$_r&^b1Z_Na&ctL0qT!$j0~?UQSw;xh
zc-t&hq5w#?N#2h)s<?FI!l+7PsGvi(=AglXgsLuqnu!ZaCn(0cV_ymiUQiQ_t)pai
z)dwvX7809|!`sIrW)I;ww5RPAnZ8>-KKqj<*N0EIpiuVhi<xhKY9xM7q;>1=a3#1>
zaZy;w++(Mdc`bqp<(VGmTw`?MiTr+d-(-=?`f~WjfI3&U9<dpo^;7k78K<X1Z4tKe
z(y06~DUopu5aFg&Wak>r&=rrAA2wqSBs*%(rhn}nBc?t)HK<oEC&!rR&LZa0g#iXN
z`T0GBWT)?!M5M?d1IicAD7jP5>QDTZhoY>ek;6GO=LsVq$kY^s;DBZZdO&^0Nw{a(
zMrAa3_v(NnelLKQ1{)yZi=knH26$RSeUAGz8&cV+6U$%2557VIed0PhdaP&w9^51D
zhF!8t?3zpyTK|I3Rz~Wg9w)e`LP_jNa3~pR`S<Vq25ryF0|*cc9JOnKkUNZv>?Exu
zQGAh~)$6@`et%G^?maw_w)+u#c=P?|`w#snY;R;%7u1I{hI~e~uP4@|j&KmY&)vE_
z4gIVlH##g4oH|F`{Gd%Z;HhIktLwRxVP1+`P?Ye8v5kDc?W%kzxNh7KMDY_*icFS6
zVWV`vYs)u*{pQZ-UE4oK;>Uy?ykcSHJ)V-l`OEX`1Dvm42rc%e331cZ<(Q!<M91+Z
z{`;3c`oQJx?zsoYNw%ttda2^@&O&Lf5ixY-8qEFEMqAIj%()aUr5v8@qg>g~V7tyT
zggKZg@KlBZ_&+8=0Bu<hFZ6dQZL`!HwU?|rNp-*DzGcHp0w1{m|Ch*~r@)K$2ncWo
z7_lE(^S{PmW!)`f!)13y^e+rYJ$?StRvD_@ev*DTh=lmf3*~Lfk7c|?LVqr@Cy6X)
zxz`XFRxWl!!CKgzW5SsU7Syi0H|u}J2++(VB>lqFE-c>M_nTjJsm??{{2<hVVx{;y
z;5z~!Qr_QR!}Gq}#EU_IrtusduQT%Fv1X6cf|nN?5)gAln@655o3)VqXQcp|xBU6K
za2jC8f8&lu6!>_N#$^?(jwOjj!GTj-+`&LM?7t;tYhBW%u=`h=%n#gVsIo^S2?>ab
zDG2S4ELEj*0e^)1L9Ygtmm68slwDG)0J`=x_71CxgfVN6CGq=n?n`)<rg8I)!LTGv
zbGm5PlM#A>TvVQ`z_D2$+!U)4OKI-0gx~LI`J9U}lWI%n?>VSbIXqsU@^2c>y!DOz
zO83P2>!5zi{K`xX8J03cVlZ9a^uH+Wa6=_cy~c@*YzboYV$LE#yfHaeNUm|b>++$|
zwJq_(-gPYD2R#(=+%8%Ll8rq(H<|__WRz_fc%S`3eU~6byQlTuwW@i)P5C|?K=#9Y
zeqa<<*C2b_Lk{G0)$_Rc>~|}k6r;?Mx>%nhge$1f463@`X2`($7pK1bPFeQl0+p`C
znL+{jB#$d2`=J5;2(IUN31uAd%!{{8?vNy8IW&xaAxK=f-^Z`*#a-9HLvRIT;gcy+
zO4#5q42;Y$K@}`W?i?KN`7xn>+_<aLLP73x5UH5|8eIwQu@u9|fP3&34IR+eDRRcP
zT=aijImM=XQQ<N?@PGtF2CFO-tGml^prjg##bRsoUY_FHzxc#V1|%UH_GP_AGJ3pS
z>iJw*)646Q$4VqOeB$zDb}a;MQ9LfWY`0tbQbNYFWuKqFxHuC*N!%7;tHgCbb)hb7
zJqddWs%bbbx-0V+r}BI;UDf*X>Q=I%Nj6^+7KA+(E*(yL3hy`uoG#&J`SN4<+J?Q$
zzwb#P6Ur={aPM^<?7)x$G~~s8^RRrFQ*y>+;KVDNc?aY3g64g<0W6?x*zz>#-)pM#
z!9G?R%STED8bLm#ScP_Y!&(b!<&9$flD(`uXz1b#8BZ3CayTJ-!3Qtjys4bFOlDzl
z$|F{|c0qv>^b#H!Nm)arge*e|h)B~kXNhLJ4bEM6N&HK93`_Q#)s}|poqZNhsgum+
zY5aDTJCf4&o;1d(N;JU<kFPJf-xGt2=KZ_baFP_HI7G$7{?2s6ERn*MIt^#|m5}Z;
z%7^dYXZ^MW+GvZ#1btLb2R9%C?oY7}MI1+_8g6yjR+|g5)AG8h@M-FKF=Q}`@pp84
zRvraxMkJ6s6>S+CEY{|XV_-M%3-HS7u(kV2rGWsFpXw$ng7=M)Z#TLXNFPbnq#_8z
z;Q<2^IpcQw6*_8{(jbdS(@?c7=yGywh&-;`xuDls#rdzRr~t^{MJTsmYiLKi;CFnZ
zAvOdsyru~}94k3oVLNXayxnT8P%Vkyt1*eyy&@mY*{I4Kfg1@INT`p~!Kp=<@~-sC
z=bNh*x$gpFI8`SSUFQPLVw2UG)t|Q5L#kYRXbSPNAD~?du&_$E;)xgCSEnBRIpdK*
ziy2HD)p?0dG%-XZin6vb;*Vi<u3tTWX`LgrX$e~5pYEGJJSypSUsqM?s>VpGA|LnT
zF{1RGHSBRk4@hThecZ2nc}<PNgezNwr8llly1#4I$`}zI<}&ABTJI-)*xcFDilOLS
zm%^bVr|HwNVDuDhxoo}04Mt^+eCZ4=!`{S{BFphC;c(74nPk@>np0XPga^R259!}o
z#8vxj_NS3jg5_V4v0f1fKz|USPhK+>GG&R@`~7OihdOs>CME$E8xDxcBxlL*0PuWw
z1$r6ZHETg^3q30ZjHGR5ZVo{nz3=OrLhnaMFE#~uV1Gz#>XnN<eTH8p_X0VwOU$#&
z^G|9saz2t-RsyoV_1bIWh4<kBHRDQfb>D~YXy~^&W=~$Hk9!GH+Oc-H&Nbd|Vk9z~
zF8TG}{LF*k78P??Uv}T*5FQ)@zPyd%E)R97lNT((%8j+8r_6k)KA)b5(!9A$2`*oy
zDiEI>%lBu8%)qK!P=jcKL#8&QbJF<{6?f;)w-_H*+%ro#jztiW7J=*{mA~j%9+QBH
z@JsZ5!&Yps^-+R~=G&`va=G7YTDog)zL_V3@i`>~5EwA*iwe-aH#Z|owq><CP<a^%
z3mcQA^F6$D7ml?ZaA50>=NW)zH2BGvk-?QO#k>N|x;ES3g-BRG%MIaY6P+Sc2Qx(v
z6Jk!4EtKB6JHmW&9j7bbm3U38sw-N0d0`}-po*-f;3_)OWSwnhu~?+D*-BC1qJ4ip
z1BDnWz}c+c_ba4jqk7k4VI09LZY&Or?UIh#VY~1u&avg^<7yOgt3Ctkl2Nx|q2(jt
zk;rwS8I>+_jAJ$%aq4h{2yot6kD@?4H?-?DbVNNS-Vj4A-Z+Lp($1%`dvxg!8t_@5
z9Qk7Rm71P#Cg1JR&bYnGk7m3(^vwZk=IWzCAkZ(w4kY1-xlz8~*Q^e0SBWuk#hlP!
zL-ZaZA8DWk)moA?)qHhB1J5gX19WfPT>HysXWt37e&({48tmJk!uLqddZfQzd?)5c
z1Gb8mnoTzl7*dMH;WC#pXla}Qkrb{L7bhN&@wI%p_q^-y#=^r0akKA!re@3L^P)gt
z$q|=BLylWFTQTL>1N1Ftok;w^E6g+?wywL;+EDZ|gQ^9^i&<yo_IYvo3%FF12fq-0
zfbJICvtX1=w(9g$tzgGFpW8^Jy|C%&`ch(~Q3MZUh^vUMc<}KDAOOBwl30dn5CKdP
zcZGH$fSC^Pcb2qz45AZtCPglB?#K4_)1So>nei=1p0uA$Xp(@Z5$l=?%{t3@g+A3X
zEG%hzLHshF-WpnV`*%c8&={yT@@WQRDj@nU=$g+%F4yu@D%DWFaN5?O;pJMH`bdho
z#SZI<QxNzwz_?j)6+CDxS8;q!L4oPBPJ2Br4AaD!SL1p?vNAL?(9?oce&6m^Kr@+H
z#jOb@|Jyt%8A##uK2&e?`xEmg{kx~;yiizGx;h@^p;_(GB~B*HDN%e1$Mmpv=sxdp
z_vs~>8&rGDDdreXoF#TGO?6^-=O@e;Zu!|Eh8X)Mh&-WObLY_ko9<U_EC4-DdXTcO
z^^pS*5vB!)(Sr~ox56o0`7~PSu|J9`=^np{O9Su-!tc8O@}=B{cKla9Myx16c~JPI
z^5O;8{qDZjW93f^)9cTA<9ly0i%a0~uzWbuuCpB*=u@ug)3Sr6lk`$PHzcB#2;Qae
za5ZYBu(Y2$Ze$OVT@H}r4ijg;r#}tVhW_XX_TO9&ao!UbNeDR)uC6CFcizof`94Sr
z9GrDWvu7R)ufYS$ybH=g8AmOv@82Jo@FgdUc%(;WGsdgl^`*u0l~CL$O!}z@U-#jb
z=ous(`Gid%b*Kwet$~QzBpoGTLv_&T-$nxrCKUZVY6YC0O=peZkJ2nSOZ4|?T{lr}
z32WC`i9d5&wxyrqO`^v>-z6;UHvqM#Q{EZ-k!USM>0@6gRLjEgGa?iU{R(IXS(sK$
z`0sSpnyWyqr$(3S#f>vyjDqm=o|R92fTxtf<7iCe<mCMPD+>$v?Z?%+ZO+9lE%*Ja
zeb+CzhQ626a?HDXdsI|Z)dpQp%eFPAvsln~;54Z|Hk&7wmOuk|LPoMs%%VY3Y@dRN
z@7X|^&92F9;b`2ga`&_xN&0*0BXPbIULt0??@?FZHaakiboNeFfAGJ00jwXKgSHoj
zolLDj@9h)a=+5NDD&A|n$?V#}ze$0xPHg|!C~~W5&%6NWLY^-$0)|gIp$(HJ!r$NZ
zhqjbIsAz$c>`;=6!;IAD8|UpGB-0qq%9Xv+X5+)$;80|lVF6U(-4~xI1GK|Tuxl43
z>7G5Rn&7b3RZ{Kew4sfu{e!}_=nH`)RBv6Z!uEMl<+Zj?$_GGJ(OLMl#{Q3j4r!!9
zA*EE+w|r<o;y0(C9>@x}<<#=dRdeNV(kFEqVEGE~RW4Td-wrdL2ReG~XM5l<8+3vv
zzQJS9`W^0mPlu(Tm&-x$*dVl!sAtW;=Jn4{YZJ+a^N9yU60gE7#O*4cg2lw6F7DL>
zLt2eQ7_o~+D_%<b9qu`<H?kwmia$tB?Fb`G;Uav{xb1B4^@c-Y3txi>dY+~Ko*tzy
zsQ7m`IU@O0m38dus06g^E-r-_y8CQ!M6rLd5?0s^0r6Gb`&{71=eB!3#*&T@kqcMy
zmbP!P-}}J)?p*BQ#b_&#1<Hh1%MMHVx`Z~Y{oe1lb*N0F@%7sVlbX6$t(|T-+9*`d
z;3d2IkSRE@Stt)RXK0ZCEAg^Z=0<+oEg83-DQLhm^8^sNi;o!p0{r#ld)~#j&D=t0
zIP4bxQ~MDT2>dnSh^VI1>wz7?dbzVmYc`@xDBSz_M1+gOsN?##_gj^2ONBb!U~+wZ
zJpvXLG9H`RuMiYmcch8y?(S~K&dUMttR)c)z2=X_Za*Jy@Ah75`1227LoWie`a9?O
zhg!>Im!WxmimM8Uk4#bDcx9!HsGaiHr@FJF-wQWaLn8`3S)f=Ng=|;>%cc8<-jz9|
zvrYT?@qzr)S?le2dmt}cFhrf+M(E^1M6|zFDB+<t1I<4{;=zjQ76ax`9`4$<2e<Kr
z#_Um9rfk{3y!wSfZj0Jk@5k%H<NV?zA4b>q#}VF@bX+8SzBDA5fUpk8puLAU&f8&l
zR?)!n#r3Q(GG1$L-bXe;w{$AcqFL6fZAAhURT-If4H;HYwd?e77;nLEW9&6KNZ^TP
zxGqTEP3U-Hktn}R8Dn5TQ&<j{3G0^lb6^8ls67^1vYn#Csh^86H+-ktw1NaCD(8-(
z3Aq3LL&5ItSSI&GuJDEtOB{t4L`zaq5;Pp#!oor&coy#bY^}p%wbcncE-98Hf*yQf
z5dG)VO1bcr<Z}9j$8+SzU@dC49r|i3e~<euS?W(Wo%ZkbitAUc_V3=Cx6@9?3?RX!
ztB8|~{yk8z13e-ztS!gr!^KWn?Jj36!|KFUuFg4_f3=LzIc2rF={unW#GxEm3N1Fe
zMV{@+kbwkOjDD<>9Lyr!rWp)3@>EZ$-v1IE!Q0=iP5Ir8*u$Sl6#i#Hy%NrA!9h^#
z${-Y+NFdqke=8*xoV{Oz)-FrR>vbO21eLMgb8_42N%<31N1+Fq)})&}$7`5R&6q#u
zoL#8(Ti29JusYjgpQZ^F%gF<AEi+)|O^@K<ZjP8npx>FYCiBDoFuHsc!>wQuLHU&@
z`}shdTD(0*3<E$t-C7PU_}bLeWME*hySoc!KE|5VloVJP7!6I$quVE>*5dqp(ZZ>d
zr3UK%r@6QOsw-&Lgg1fU!Gnh2!QEYQa0~7Pf_re6V8PurxI=J<1cJM}ySv+L-h01q
z=B_n=!2HJIoU?m(b#--h$@8$+nn~`MWO~+FFEt$=T9U~BqLO;u;n83GEzxY8E{<V>
zVOx9DPK<{U2{E`w$2eI{7|cfq`%d$wFBAP|2D$}bi)mPSZU5+}a>eC^Wp{ofXn)UE
zUzFiWc(h~jWV5-0od;GPai_Ct!gP}Wx67PjSh)rkve%1zLrD_(^U4k5Dq71E2F0A2
zf!IAqO|p=m9KpC;BAe@@6o7=wXpc!!2eS;_qH?B3bwj1kTx)6m`S*ojS-1+Wvt2a@
zU5pZEthd0UEfNr91R0jwUT_j;<mP)!!3FH9ZwWqT5h9rkZ=C_<pkVG%$+QC3YXpXg
zj;H%#DK|DYtT<9Z$OqRY<7!Frn6$LChK2^DW~1&fJZ^68llB)cJ3Biuv2ObMMHZXo
z7ByX0(OyhI=v6%YSbMd;C5?p!r+jefm)Q1}3I*2aR~jaQ_qh)|GpNB|^+xU#U0NGn
z%JewrA{@VMD9zo9|G-Z5wn{;YN6E0BBir?$fb06lohveR`}9*Jm0(nUzFp9!5?-4c
z`sE#3a&c1%YQ4)6m-c2w(aYJdEt#K18}=jY@dVEZE=*G?Y6W;Wl3#McuApfabava^
zUM-JJ4obK}4kRsHEUtybU%%`utTvI8i)OcZ&{Y&-P7i9=K1<4yzXOCs44^vGSduLo
zywi?Y_P;L>uw=r=9MU@u225|-y7C_34@*+XeWl___#2)kcSR@%E0(sRI^;+tMiG@$
zpz!oFIy9df)wmuM4F(2A+A}UCJSi_PuRz;T*5Vr*ZV-+{Q8A`(vgW6di_2}+=bsKd
z=~0wmm6xtQn(jM^C7SZ<Y}KQ$Udp%5md~PAjdp)`|Dh&hipW=4iJ8NFcT875TF+ey
zn#*00Sjdp`*r57Y)t@ld=v_5lLrMSQw0^kGfi*!yY8t)vAormtD~appIfCVFDW-i{
z6Yt6D;P(AUJD7yM93%BU*?0D5D7|WQE~V-naG<KNj{S9qP*G$X0kK@vAx9-acujrl
zWD1-}{OkVA?lmKU0M>77T<8v4^zJj2d<gWyyIaww(x<6oHX$fwKg`<UNkbw$O?oZG
z?NaY^c?)m_21~O3JNj(ft8LrO$<YpRn<tP0P9w76-@M^oC|XI`W*zys=H*&%)hl|P
z{Q=BG{y_JS`qILrgXM2Bl0nE}sa~Pmdfa;Rve0~TOV$5~y1J5l)cPrPnSi7Q$RbAz
zVG|C)LRY>7TA`yex3C7XX8A|#u$8ggh2?}+A#W9^F@)WaB;h3`Rt%l1TTh;!lNz=~
zV$$beNDptGdRo6TteA+23JS1}TzI@BBqgaUDxR;0GP?0)w7TEW#P?^s>(KA1Fu5#P
zl!b$H8s&QHhvtYxYaCD?VVgtcbPbnL?d)(dol81n!qs2s&$^3nQ%Q*%e=7De(0BtS
zM)6|bv&koSO}@Y>|Mq2U#g_G=fjdBEBPx#Sjg6EM5{}#cL7AXaQ*kw67roNln0ZgK
z-9?0)AVnPo;fxv^&wz<7Zo2^Kpn|PIo{&%{fsSK#kdDfq@aS38M5JoNN0{J}KHc`?
zv|28glR+<whjYxgKOkY5^l(0`7Ciizd<LSqZvN_NgLxPV&b>67O{mV}flTgozn*LA
zS1I1J%Z9D;BD_J4*B#N|1=!;5ot~QgI1@Mpx<?ocYtt^wW8i&#Zt1GBI^ckU>pKC@
zD!*VIFqH*lvty~rA)JMq{xL%A0FA`J);VL_tuL|W%1V=VIXambGLgXJ5a-H2Vn`yP
z@a6mpmg*&q4ZmMJF_xmEpM3q39iRM{v_;M(@kCbIz3M@omO5TeqaIWfig2gn2g)3p
zwMlQL@XvD75(m?NV1ubkd({VwHD$>Gp{Ue>fuSqj58d*6$HBSlqb5~~n2;%}0GP~)
zmU6!v2`F^$W)zR-d}pT~KCTo@iZgt|CPukgY2Kr2G&F8T6?XOvy=Y}pF&R}2xn$ti
z-A}p50<+Yhe1rVLH|5Wq(vp<?@L95?G~_71P?Sr~**^SU=syIAW%Zu!M^KED10tnj
zy1&1dqXeQn0|KRN$Qz_?-0HN)gVBKQ;hoDNlP)8SF>3G9ABQ|xP^;JC4L`o5%@k}X
z+3eEN(+>>}I&gj9`&e=0xNo6tW@hH*#xoI9SV&c*?6yBy1X|WQ!QUXNg!@TreO(>L
zF1%NJ=ChJMTDBmW>N=0jRC=qO#jwxSF=kdhCnBEnKh|<mW6E;dpLCyKXvA!LCGpnU
zPJ3#CQ<=kJxjUND{|d9l+&Mq!pxoQS1LqXd^W9l49TIXfxobIc^412DT~%`%S45U?
zfvc~ScHgj;u~V;&G+(khgV976nUe@8FLo{2Elg|wnx_U;v3=*@8te&IvC-Yl&Rv;r
ztD|Y=`AH$Oj!r&np`$}dYP7l%|AWIngGG8vzuo7Edg+@D-}0GOzm_geRTT{I>(R3s
zreGWeNDm+d=sdz^Y}gQhAKJ+HAxi}_2P!lwva+(4mX-?#pt~|QHfD7rILgS3AC7>4
z@F|x1_uDAD-O(&iFdB3TzsOwpKHkd*fQTKuijF_!do14@$?Kc69o1)CPhWQAyF2ZR
z5OZf#q2j5WAwF*{jvUfcc|YR!9QQzb_Y!i&=JnNh%is80kG*?=BOf?%nssWCe96z2
zyg-QNLi@Q`<1lkaoJwnmgo7_=p+lDQ+`iy5#9}qSSG-$n@Y%;uJHkboNH6-@;61$-
z${4kR%uq~(JjHBo-flK=MAsO+rOD+xA}nVG3~t7F9Ln=OO~cPvzT_n7kX+;k@^mQ(
z*qpDKsopz{Jr^lBF*!Ga`q-@a{zyqa4jK^l^*v!zbt}GUyyjm%Yg{;eU{m<qK&mLY
z(Ks#dX9VX7$JtCP@6>X15)zO-vZGWo1ws*}vhH}d-P<hG9n~#Zv*IHEa8A9He)MYB
zW>~2-5Em8}ULaDhw_duxIzau%Ct(8fAIX(}Div60?c!uABPBDwO~IuLJiMJ&i0v(;
zKHfk^X@mu=mqW`xd!KBVaVJkKQKTO;x5w#?e}?&a!qf71;)_VT6x)VZzAaUTXMvH@
zfw=JA5RzokppNRdr)X>5Z+9I8vt#Bv$rsx;yj-R^pRFi^Qkny+*)g61H?GI!$l!qN
z<BwyfV(5&TSgmwF6Nzm(=lnjAQaCAyEI^d6Dd@K%suIncs3f(p^YBTsL=+e*wHTV3
z<sbm=t+UZI3^vfKqz)sAwo}?9m03G?vob|^Nt_#|`R7RKPlycZ`h86X%e>29XQzrp
z1u6!qgVir5QA>_9IuAD|E43DCGBU`HUDoxHM1lg8lqO3}(<>w;s%1?lZ4Ymn?|l>K
zbX#sgbQTb42|KiF5_NKB29=P<p)2G)D*q)~I{Gf(d!y68$^5r!WQAm%JT8R3!npbB
zc)YE7nC?f%w$3gVxFbs3pO+npbltc!3M^Vkyx;!lXp9s_atF}l+!wD`MiVhF?%!>^
z8?1l1tZn{uTN>0cLfAo+(nEz3Kn9EW^Xg{q!@VPct0caH@Yl?_>8h(41}X9lyFtOa
zj|tdMLL{7W$72iTnTw)3PU!aI5NKs(QjQj9j_W$E`eBtjMYWeMAqrAK-BokDVir%}
zOT7vX8+xh}USQj=EPS*#K3mxfI@WJ}GF6>g%wYjB0h;j8>*5%VXBiS<j7c^Hu?Ak`
zE(N3p70T95o6SplL$g8`1B{T8Pfj-zdRm%g9E^-3TXsX4f`YWPB@GQO57$Sqerv0L
z{XlazIZ~sQjZyPYj|rK8V{q*|on{RcGjnBWDF_s}GSu5UTW>>D%g(e5?~oA!b~d=d
z7P<bL!R;^hR9y^RPB|V<7U>@LTC#T%WnAR+;=^O@cRWQ9Q+ceEzfT!%l4IRvAM^6p
zXO(blIU;~P2`S=oP{Ufd@s@6vYTJ~{T++WkGytOH+9Tp5H3hO3R6euhw-*vGm{bzf
z6WJv=dxSYYEa<F=a|pas&%K(V@uC|r0F$NCgGHW4>LwJRDC1@*--Q1DXrUO10Tnvx
zNtAn~cMiSx{)I;R&Z5SyK{-j{O4BZZPm5mK0QyfCeR|vMp>w-tETiR7zx!AjeH9XS
z2DH3Gi=N}DYzx^}9&rI0S*lHiiGR3tpPm200XsKMS4O%3*Qw-#b1DLN=`iSPw;dW%
zdZCW*Iao}W&ed6I>FA_uGh{O9cPPp8$H&BA-2RZB0W;{8nq~3=cbm>Do@%<f85tR1
z!OS3t0+%$fHBLmbi~8j?r;Esq;ttciGLxaCcFE}g6s&yq5|1qiJD#>fbY7Ke|9m3Q
zbC@*Y<nkGt3zc=&85QuY4291k_vgCQ7)lsAdE;Z+fz{qQ91+28m0QcM>vcevptxN<
zSJv!htK!6-XfEx!V<=bC@72;`bWjoPP5=928$2-i;`HhMhlq8}q^)p|@ti0$*`n-q
zH|p^0uwzp)Bk}e$`QGZZS>~NTvni`CV44^d*oiGL<GJ5h9^q<{8ibgI353OGG(8PN
z%j3FWU;t^`*Wxh|9?CQZuH!wwxvd4S6hepK0IIo-xvHiO4ILBEJ&cSz=;O?uK}Ht2
zr0nW{9(H%Kvsp^#y~Lccsb?w2ziz6xOjq+R)~f&L!b=@)e`w@%9Ql1-sqTg4AY+yR
zCBVSOK@Gc^*4LXaM`DMboI){k$@>2B^F3!gW7^*cMc$FP<n{&WYX21Crh|8No;?&B
zEVp~;(|++y;Wc$O#U=%`pD5AkI+hG8T!N+(d!2%DnPW`&Fg6Xxgh-|G$`;5=r;hVU
zwPvyk_d5wMLNEYBYRl}!H-H$*ipQUGPjO0XB{8~9Bdp&!)xANJ)AF9O?*;TQLcC>B
z?C6AC_S>D8<6D;c#t1*W_zSxn8RS`CC){W*h&augkGR6V3w|RK+Uca8Lb5ETd4xW{
zF7Gi`89PT{AUAI+Hw}|-JDcFLjiFfjT`jHhW&Ce(-LQo5kddgV<}`ECS444SjLmna
z`{DGNmI{MJ0|P;|M2wu)2j;vUS_(Je8xYA>v1YH0N`|KK`Y8@{go3#oXE&?mc}Jae
zIw^|mocT{DpAj+dgfJp_cE+?uU|Q9#ThXK2i5SewoSOTGrZrD0y&Y@qy|)Q4j1ZB=
z|Fz!~-Ao=iOG!B6WN}>}2&<A10Js6`T@!2L4jJgkBL9$+8^+WeMZG63v4(#!F7;UN
z$7@w%QpS$mm4C$(SBAHpjWC_=T%P~dlO@M_<S1cx(V7uTLDG{&<xNFNJ-krL>D~U*
zxY1=0Q1JSi*|mIW)0Bz9ZEid1H-k<$o>Sj6P||3Nk=d#AA{J$EiZK(m+8s0`n5njc
zCjJ{<EvM72D(?W2OTL6hI}!_varTI$B6(qCol}3?C5MUw*2e;RWlo`Y!+}o`3~paw
z@`IB-7Xbh!tK#&dX9fE#is$%QK^vL~dM)UUluI2x^YT$v>`rIaHM}KixMmf|px@-O
z4CQqBv2tKbX!5;^0|+waKXjhA<i-5}hX}-^o?I;qB~+|H17rSXxiZGjA;<c2=K<A!
zPE5o_xklo~BR>P9d`&)j(UUOD>%(KZe&G~29IXpe?#g$YmVFIj`*7_MU(-jz(J|@9
zYbrD!Y)?P70BE&L+)+X77SaJ{W$B11Z6^*Roq54rt3`zqku!L5PEBk2qtJ+R-;=qL
zX)(bHVq$ou_-6g~P6cZ?Kmn#?cM8SWOTlxFRW~uIf3esQ1IVt{7{c)|a$oFex0_1a
ztqJz{nRV+y(uRJ72=;~;84f=A8~WGhI-{(@0&>@w$JO%wUwR1}haG=4_pE%kKOw)B
z+JQ1I=ts!s+ba_!l={F!S7)O&Vzh;t`Y$A`-nzhDEX;6NL^1z#!76_QuN2{1ANjec
zy(dTWS}P+UG|JfJMRRM6JT-ps_h6#+CEa5lu=S$(EwNw|fB!P-+4-TJCliO!k#iwM
zfX|9{&!JgF>j;DS=r7EKf>M`7yiOc^EDT;Gg~srl;tnEM%>R3;!LeNv3``s59jvN^
zBq_Wxqao<07xGCS;(Rd|sGn2tZrRB9;bV5)kQR}}mQI%vIhe=!MHKRrqsiOjpsE7D
zwb<z7@E8Y8Y*_A4&+`N9TCHEYXNSF$kd1)QxMxOx;%BPOZO?6L*JYE#X`aNWGs?F8
z**?n>0RSG9fpgLaL1xp>plbJ%D!#XRvCS!nIF=Izq6Sk&LPpiwpXPORM8Pvn?-Lqi
zz(mVMQsMmVMys*=#Q|~?iMgt7PjI~ZRo(s0UfXY#q5dd&sZZ*;&2wV2Vc8!7)_yiM
zIs1KJiF&U1JB*)NiYgsNOsu|IXb&q3k=m9DcgvMX`<H_ey;FA}&mAc+HC0r=&53}4
z*bsuia_gB=xXwd+)8wVOGzDY5kFS4^i!$*Aq66Ym%@E5SJKZRB!;M~I>8@#JUPm?G
ze$Efb>eAQpMHoOp8L9J|^F}<q-?4v)JlEzj5<GqPMB{bLBqxP`Ri&)X6oyH(F@;CR
z>zyy?Yu=~qRMT(!*kbztl|oS^$sNOtHwhDs)A>o=U(3SkzNV!72k<K;{%?3ZZe3ca
zR`O6NW@9R0f>PkGV2QmOIk^Q0R<Vb5Z2e_kxm=({Vvs_zfOLHGnNRD%m)!hdGf#e?
z?9R!y02-jVX^iw(+;bK{?)nJ!cRf$4R}LV|QH{*qwO#>>kCC49o*7lncsMAolQw1V
zNKh8mx9HECkID@Ob$=jsuSn8-EBng-@lkwXxx`zb{)OtIpp4P1OUe3juC$JSWr8ko
ziElthgC3Ws*Q6G2dg3V#UipJqKQtz!D=iDqyQPt+5FYA3@Zd-+D}*q!#uCt<;T~Sw
z4+&#d)?RNb_YqStDjZtZXvyKZuz*J-I*{V*SPQW0OL|Nm77CGyg|F|SYDnoK+o_sA
zCsKdQ(n{%o0*HO2Ao~-mb0fS<<7y3>G0MGL_btG$KH~!h7pT>ak>it>u|3l9B(FnZ
z`v$AeXAdSv?lbEI3YtvtWAUBG-jnt$^_)b+8^ZF`)zhL_$G=Q`=<S}S%l7br?{?S?
z@~jJwD1fio$UPx;59**C&8l(anqlO-e_7ubhmJ#(juADbC8%OFkR<cwZK_k+^hPb-
z0LnLXR~lB+MAr?)=9`?dOxE{fCkSokUoUz)x=jS3eR|_D8=37Qm*-F4EaB0pkws{y
z41~wJrC7-lW&Tbazh@|H<W}+g%=a6f23@5SlD|Q(VgutUo%WkNgWf=V)6QR#&zJm=
zU5*E=zJUIyEE<j>rNs4&WK8_0e?1j7xu54m01BvHi59!mhnfn*0jnT!T5!CaGUqo-
z4>tWsA3ug{ixI(s4F(Gd+I<W0awn@qRLCL@qPBrHXJ+1~x_aN698lN8J>a=WcQU4A
zknVC$pnSg{>eroD(~rfqM-`in1jJrL54v&oV^<)Ppco+;`>mKfenSEv<(iwU3xg|<
z>!rx!CA*R5l288vl3_w?o>kEud~tuJMN?!ZA<}hBSdx7(u8T3@FSBuZv7Av!NmXi$
z_Gs_RZe$K5MlfmhlOt6O^h^+@AO&VE((+09rG?Tw@=N-Rrup>O%ZmT7DNs1z((+BY
zr$6w%P8M?}NU7V-N1uw62V7T`u=rC>#f%dHS7{r5z<Czmm)_yI!=;3X(vybv%B{zF
zkmtUxld&NnPIRtKzeQcFN-uuJy3$gAI$eszf&@sa_kaar@RT%Y@{WFH>frENO?pvp
zt?wOD#cx28_u6abN0ms`<Tg!nb#q$R0&KEh7>NMQHtNd6w`Q#bH?zAb1vg^LaSZss
zwkd*^G<nk@mSwGE3LMHL5?F79ChFh4$wLK(`8DPoRpyt*+Uqlj&D+K)!nRC9Ey2(M
zfb8;R%7j!pqaPL^{-eIeebM$7Xuw!MotIll|3-C92ReEMe?ndaMN&?<S?h5!f2iHY
z+sjimbIlf2Ye;f(Ij<}a!L9BvIzM)}WY8r24paWeb>p#XhU~>>tQGUN!~?eMYT*V-
zh;2`-eMzccCBe#JWl?Hph;-Ic)zJUokb7X5Xm3SLJBjwg7$cK#+{i~1fG$|*W=&p4
z*>)0RZg6q?=GyeQAM<hwjc$CxvdpWcWc$iWbUCiPK_FTW-MXyRYY9(S+hWEJOw3#V
z{JDY|O~gnnk?oqu@eQ|ri_?B?K)6cq=-5<X1yh4Kj@<qSIq*kwi|1a#0P+<Zi1QfR
zb8d@%iK4(dpA}#PAcocNa9UK{wY$D@<I6eRA7go;imK2c0q{OcBeNmXPE9%Jj__c<
z)^9dB@>Yk(ri+(k(hja2hA!h^bZN;ma5madx%>dWS_6mD0+G@nrrNZup88gU(#rNB
zV&{_3V(C`>fGGdcS?5=+9k~#nC)Dp*y4vnKgPi7sziseqL441n!UCaXTb{-RKWTB~
zXDU`;f#QXpbC&E@Sm}*W<avf}0lq*?dJ^^AyTsz{k;sWsFh&%k+%dJvM8pZh|Bd%J
z0#X;2)4v6esnw1&E(rmmjLzZOe?^nqL;dj{vn0EnCrypoc&?3|#*8yN=~dCN1is`~
z71CaQw%yrCho#>~21^}`D`QT`<H;7qafzTNlw9sg5X@RO7QWo$AQn6gm=wb6`{Mo~
z@*u1~k+``tkZFexF<I(Xv{=k5uyk)TP%doQVR*7Q0eo(o^gCL-ma(g?j}k8j@-X3o
z#BZQtY6ux@<~*Xj^bb1?8f;nQt84EjHuhbMEZ<hF|5&ATqZH)r(5k@954}4RA>ISS
z6Gj@AhqCB^P(XI`_$G_nhyalxk>^^wN-2byU6$|V2Z=pRvvp>UM`+m|MD1z4r!@Lg
z#2PFHx)*9!=CgkGMPX1xT=>$x#NWvPSHeg8aN!`|)yo%T_;JtmZCwx8=Ue$!N5RI>
znV*Whdsa3_P&a##%@=@g2ZexE=tX@+61J2zcucWsakO_AhET+Z?mTxjv^h#=J6y|T
z_F2w})-N#tzvEfD#t9Ix2W+$dUA|lTcnP3YenS)|yTG@iPeq~0H*&k=7^qN*xX`(B
zg#)%O1=36rBzasbzgd^!N_5=XJ8r=J9qG+CY)x3;K);g`1mgIWmK|04tJL341qYMw
zb8z;At+C^1_<hQzi_PR#L*q?hlr~aoevx^f5raAe{CSVrvn=4$KlT6B0_;0*@&~RP
zftP(S=JfCVa`8+vH@wLyt=ERx$lVvxaNftazFqdu<4c}cEr06)tyR8W7x!$_;cBnu
zvFjnEFr)(dxAg<}PvQV^lUMnQF^Q<+04K7sWk+=9-DlVbx`c!q!EX*0TkFY|;XF*j
zSSV6&frUz9JZOMfex$<P($8*KNK%+3%3s{1Oy{%nS2BQ{KYe8gQj^9}e16;AnUC~R
zewa;epVxh49LvW-lSwPLtuSX?;*{=DTE3+mHR9+RN&QXyg8O;;h=L9@yi@LJ4{G%e
zI<pK|UxN>dw=nlXRsuw&w3d2!{g#6rvscHWZDI}&lRv(_A;R--jVhBZ1$AVlwFlK^
zv;BH(K&;6_8TQ1E4QrXoa&;Q9<VAjk&J=P&SO^jvQs9k^+Zr_RWtk@;5zj<Wd-|Mx
zX<8aUyBKwmtHF}!u=}N0|3g(!1X%3~%1L~;+AX~(%dvo`vsokYG~6`r>`O!&d!=c8
zMY}WpQ5u~b5&q2w$KhYWxL;0Hin)^E03n~3?8<w!OrHaRb3-*+oobwrbwrn9I=KTx
zMV|yj`Kym6d!JJ422OkdCd1^yP>Ou2*K=}e1Nj*Z)YIF#(f&EJ(9fxabzSYxp1(PH
zz1*1mHP^ztAC6!jhAEpafDVNEXvKJ=30fH>ifS9mDg2wpSkP5sp^2kU8i@!SZN29K
zdUw8#DE1Go9NMakEq#Iq&<6@C$+mQ3hZ^pDs<TU`Qjh-ev1MS=UhI}OjYJgh<hx#8
z2Ri#QCIlxX{#8YI#117_>k7rhAQxsur-q*1sgZ@~`>)LH(zx^YYK_Km$6N*|k_yAZ
z%ogil{HWG%Z#{s(_yl<^9_T6oLhxBZB2l+zPip5*D)p@nd!isnDl3<tpaW53YpUOA
zVEZa-nr)*0Ie%m<dt|y>Yss!gMaEpph|}%HG3?JdTc0@s2>@*gJZ|xh7<kvYe#g%d
z{)||E_hGxNBwsfngi?+i=FNpFtY5EnibzO+WjN^Qrn$l`9bd!+ZB5LMNmcyK_B5+D
z7ybyKX**r~6h<LdSsYd45%_##8*OLI!zm^c<!>urdrj8VlP|uMGS7joqf$1&mD+|>
zcX4t9&LpsGeplqj@vp|sOkuf%XyenIf?h>R`&?@6{iUMDaal^Ni_9oWtn<~FFUa80
zF$RL1e}QwktH8*1xykz3O1~6R6Llue@U83mVgb3%CPQCyAf_l_BJsg0AMH~RR8;_y
z20FSxY|)k{tZX76q|Bwv<>518X~ZKOCx=T;v#a%TThKq(m>o^6>$jvZU$`Pse}w^%
z^Kpj|kX`Q{)>Sv5VT_eIs>|UkllkY9b@$KsfokcZ#+P`a5*`<X;VR_YIxk9z4n=%}
zt};pWgDt><wq7Y~)@4+qZEoJ9s$?tY)SU{vjnC}J=#-WUUxN7$ix19+&UzJ&Pfc7k
zcDm0cOJDIjhjbvt6NJ1(NLi{(dr*oWH>eryK0eF$q7wIJ{u{ts=W!ma`zbu(8gicD
z?tvZZIK#jh%jgUIQs+x8Q()(BmgBI(rG9UljWwUh$&62Oe}c(fX(wN;^3p{j?i!_%
z1GUes(eaGl!WG=yXUtoIS#U;(Gvs)ZfuuQ`5=2@+EDVsZmD-QWKmduacoQ7x{3@U9
z8%u77h^zSl+-eSylz*z%Yk)A|v*+9FRI#y&nO^rBwbxtZc>t4(`VbG-pGy0CVC%um
z^I?(RDDIkKi^9mQgUO-^9#PsmAeSwW)4I0aF7v>pK0}zxEO^DZ=ENW^)VGCs5sK_l
zHFnRwdjYcuA-g%dqs6hrV-2}tOy;y9U)F&Wp9VYZf(=jft*570Np;I|L%j701rQ~F
zz=)SB{99t+2a+!&LwsdEw$Roy>WT%N<#}J<^$N|Ffq@UX_B)OPYJM<V@sCk9EQOFz
z0%D?afE{peCA@BRo0$A&T)2Cn@Cz0~+Wgm2N*+OrvX!q!1<M@UWvboS=TJfk9me<}
zg{kY){B{&JYW5~@aJvR**(C^+?ohNWiBbRDXq}tnJkdJfAI~CrohtT*S>X|PVyh%x
zHxu_J)qF>dHj4>@bRL40uLQdMhc2Qx+20a9mESJv1zC$#7&C{172V!#gKBz6RrI7x
z7`lZP8FXP<Hjf&yFks3KcDfa6jjK#xh)6@`zPRe8nDQ-lY`OO9BC-e`S8E^X+yC7;
zc~C<D*=(kzoM(b@!Lyt$fX63}N#{E>5V*eOCmhs)?|nYwWsz>bQiV3q^Egn#k3SE?
zEcAUziiLFQtg~eK6Rg!bHJxkj_j{@K+ODcS(frzMN&B*udO6xIrGjcwvT!1%14bwy
zr0Zf9KYm7UyuHgZg*KT<U3oN-xbNQE1NW@n)-s@1VOsANb%_BJyy>Pd&6|o?l)3r;
zm3wgt?)}z`5YupLe9CI1iK(!O{ROT}h4<Z08DY%m@slhGSumm4@%BxPV4WNT>LQ^>
z*<oH*gX;%B#)=>mu<aXYN)IaY3w!vvGJnW-t7^KHeOGZ`=C*K6`MD_FE7DQxV2*hm
z&zTG5X}8GayDpWe+W=`DPlxM$?$yt98H*{@CDGp!CX#R0SgOe0>xQ;&4V0sdS&KU!
zNYsgS2Pe2YVs{4mMIikxkcB#v4_gzH_7P3GRz{e(wJswB_Lq^pCTZe>=mlrQ<&-eM
z{ZXA7Svv~4e`o~=52ccb<fH)GV*v_qi+(s>-*lfwebPCi`w55Ac2k4z*L1{jwTh?J
zbSCmLFOyB}c==U^TXTuEEENohjC{rP{Le(fEUdtz{$RF%B+edgc=Zy`=4n0Sn9tAf
zctt`bcf^p%d-%|h9YEWTTz~g*pEcF8xy^ZoNsE{)oj>{hd!epCEMeZ|{*Y`1(?bGv
zDvuCLK5CS|nn{s&!W?yxGN~rY6is*W5AwzEx^s8D4@U`4(|WosK4zqE{)~=Py$$9A
zPN(p7h?zdHupdo2dgddG|C7=oes4OfkOLEg#o!o?*kvF;u7mCG1_s7N(lKOKcI&4>
zHAgOMVMmvCYLIg@_-pc4Tdw=dOe1LzRQJl8wHt^-I{&wohp+jy>qQgvE0)l}U57^6
zKlPqU)@>U+nR7shML(#J7*1l`tKnb66^>YK3S9noHWp%phcg;owp5BOPH&e<FM(Sg
z86Ze^zW#ZMwU2T0;+v=t2ECy2#34k&EHTJ3qQK0g`p)vS90kuiH0nKM7X`QaI1U6O
zEzur=qch1sdVW?KOB8(Ek^ugEIeb4>5pa(G$?)pNVKkAz5AA8rkrf^KHV6BGo@b}B
z;&b8qk)}vxNI*i6@7j#*LnKqVJ0g(FxwOt&r`~3e5o#cg82IiSe<;Dm>${HOb+S~e
z$0uIJW2?$0hDqBEQQh>n@T1;x&PRn@oC&G9QL++b5@0mF%q#3~s+Ly^`Tg<p56C7B
z0JMB^K58}+wtx=q#pFVGb66X3F{1q|HVBA%x}kDxlX$Ia0C6Yy6ivz;J`KetmYtaY
z82QyhIxmX}wYq>1_SJ#x{*@RY+n=-alc9o_eXP~NMpig+>xOIQoZejsm}7;?mQ-@p
z@ccoZP8q4;%*xfBlC5sX${V9e+<E&*cqeP1)%GaKY?Aa{okkdAI{PB90@p$NjZeeW
z2KN{S2wdb&n<ALA5Qqkl;uwa&78XG^gSCg<nztI-wym1rK9SQ)N1?_dV8AGo;(N2|
zxYWkT=@X+Ly+;9vUHzTfuO?Y*hI>)`*Sj5zbrR9ZKs^r#5?rJ99jf*w=)cPz#SE4}
zAJLUM72O`ueV3)`bnsPOs&>YZ&FfD?Ff+TbrQ5Ttms1s!;7<x{e9jYF6=p6LEPxGF
z#>m1D1gOxMN7E#AbKr2VR89Kipqh*?$R}ICWG9?|eG!wyJ3cwF0Uxt#OzKt=&d|E^
zAspH$W}BK+3^8wy&z1!T{<m@y;NwM=Jpc#x8Cb8OX!pux?$)yfrUiK;$Fsiyw0CgX
z4B?{&+f(zxF7dCjD6@GKU-~c3wRYUXjh$6$H(-|9M4?jHLlI&w_hrF7w|hLP`S3?s
zu4XZ(8kYl05-Aq=b8^k@jsNJuZXKq~!JJO6<LmI2Q}xigYC(>DOa>y=3~|t5g8~>6
zzCKwSjn4ldy4t8rE9G)M3Jjc;6!DC1^b!v}b2t@4d-^yH!4CS@rw#lPQD|P#tR6Dt
zGAel4EG&RLUu1&L-aH)dt@B&(QYrSm%A{e0h4-k5a5>6s@p;2@+xWm6mxx&^3uDZ2
zn{(l#u{6ViB3*01`>bm`%}X24-dm_o+XxpA=;US(WwSL_f;pOVlfvuFp5`ylu9r^+
zu4d-)v0b{0g%7^gJrqDt(uz16u`dCot%X$<7|%f?AA4NES81Dc$<5opTJ^+)BHn1j
zosuY`+Pg9K$4S2@Wlc9Dt$7D_=xKgNF9=q{0F6gt!1sBBKil(d$E$?!gxPZ?63O|z
z!4lCR3P_F>F?>f;szxFOfEG@Rwz>62k|!dg#^Z);!tQFRS_9p#r_Zij41ifH=d7_b
z=9p6%-e+uOfR^Z(Ff@DK<rL>GqsWN^&lwdo-Oz&LrEfg7%+9&!mLl9T9r9=Z)UYPp
z6U6`Jo#=vS!ILi`5V0h0Q7gUhh3}yvzdUj3R|a^Q8#Vezzyo^7!zR;Cl%VHRkp2^o
z@f;Z~B6ToA+K^gBz##PK!RojPKc9>$VYx$*+EXm{;oCduRcDpSH$F%3OJx0k5Hn|H
z>MvvQ{ubEKoSL@O;NH;p;8IKGKXKib-v!-yV$D#ddNZi$5TU}Xng7;^I57J}3cxFM
z6``8cNJHv^-T@y=3J&JO9=`cAe^4M*iy;93i}>n0pS)Ywrip(_BWt;*h#=3^uGFp<
z*kx<lA)9syC6F^*_aK-N7)laG+<L^2K+`dk&FS@<W3wk}=mS~r&?Uai@CAGR5wcUM
z65Gv)o;Y<2Pwd*j*R=P8&pJd8vk<wONkwI9iS>(#_+v4PEk9(iA;jlWP5g8nLINId
zm+p*-Qjo9d%SSl#^6c@gSdS+nk00Xq!dhQ0&H!Smbts?OeguG$sE8xu*nEP&>D#0{
zi-2=BZ;G1pcWto21CckIfanr0)$?9+hq=2M1X29L6h9-_o*Ha=e@h5Nt+b6QsoBi+
z-40O#g=&Ka;xw&pIkp$_GBct5`6%d-!?56XlUZeUPoYm}-66zDIwF$yFs9=aLna@4
zf@~HcsO98bdusNyUc0i0^6_a>*?#$Yb%>L`Gp(F5JUah%cIPjyW1GJeM2|}rl86B6
zVyhV2je;Wf9w$4u*Ym%ecSb#I@j=5m?uYGx7=>k#%xzzyIC0@SY%l${nu(GU?AfHI
z&Krf$bXzO;;u(_?2J%suz3kO%zbBcxun41N7*`)}_>oX%pY=!`iT_<mta~p3DIa|c
z4D+~8h3?Sp$gmCkwBDta*@Onr^xAjXKCq1?e^O+4*ELTch(yH1W%B+C{uSSb$opS-
zT3f)9BqZcAA@8uzbf<DfL>(V`Ne<GNy9UCUy(?J>Ru>3Q%{^mF#s8}3QKvnaGgF<D
zt4umA@b`9Lm&pF#{HKH<1O6fl^$|THiN$f{Jv0hNT_H4>35bjiUd0EJ_n*#x08hHm
zfU@VLDG#Ox?OUMt9=^!Ap!TZ)+VvaoHJ%~2WY!K?R$%<JXD1icA>*0dU)bM(^4$I>
zG!!_?_2C6Ds=Co@s~gf^!udvMK+O1wYO`9*PAPjf+Rm4}RJ4me70+Qk4+dkb>V;1W
z7FcC%P7x3kE=a(k+@cIsVO46ZB=sfMem8CXDSNN*ua4DvA=eZU%vW>rKD1Bt(@Deg
ziYLKP00<wVX2{?fJ$JUXE2St<bu6_k_i~t?s0)_h6+*|{(Q2SGw<Q=a48P0h{_@N|
z{{(>n{`$!59iC05j%=%m>=mH9zJwo2G^*J+B}@e-1Pz~m5-tu(EOxM<zh<4!m&Z*j
zg#}Wys<D(}LH}AmgljKLpvC1!{qQOUjP{R`tuNAV!#k%iaLkGY%m-bF<+w#?9-p=-
z1J^S#K_&8b8V|UM4S~;8*lAQZU%>1S^jw<_t^?tMjhFr?QuDLdlC)gI0DYStYrRlQ
z@{om!om(>uwEz@#|7U5~bQdTg{))`s?SYtNN6`>+zTx}G-Hf%OWc;F(jNbQ6Fu`x$
z{L$U`l^ld+mcaCooa+=k`}?!}#S(Q>>8l4|4llO!hahU@yu0`qnKXkdLf#Yp@yJx3
zg0yerHqBbhkIHyUs@n)k*d=AKNj@YES*-^&F;Cu_@=<3zzK2ISUxIgM>cK58<Wn-N
z`*e<Hfv^-<zwV$gzt2X44h0U)^>XQ&qC*Y*T4JkwtZgce{63&(1M++A7L#WPB<6jA
z`f2cFTwNd#*LCv)a=HI5kaOjoJ`6bB3+HyK?Z`8Y507oZ!{aFl^n)oVBJ$+fmWudj
z{spQ7^0CbXmRA;$a|6hi;z1f|BzUFB<k@#g<=00T_gj+Al>I;Z-Uh#M&l^%W`p(|W
z(4r{W&bRTSVceTpU>&#ugXjL`)>U23)p6z(!aGHD_0PY_{Lu>`H776em|(}DnrrP*
zz0zQY{`~iaF_tc0Tg&i{1<OM(Ql8<-%6LngP@Ved>3v+O%?``4KN8kqxDxOr=x_UC
z{M&E91bI0=rg&f3L((+Qa%sWD-I<3%3L1Qe*BA<5WYIs=<xmh@h|_msviPNxS5vp?
zXdG-ifWHD>Mdo_=#S~2ERJq39J+b%@w=^Yes|g?)`I~jRYMd=e{@WEV;E~3Ei^rl{
z1v-bdnP!&HVSgJJ;x=)5{L?@eu+fQ&QEszn3TdKiShM-;`#{$Wo&(I_(>EXDAM@H0
zvyAgvDEN4?m}BojzR=NHF{W=dt)><0<-9F!eouddovl3K{UpkX=sz$=NkJymR+@{G
z2|qvsRc4){IS)|6w>9kGT32bbpP@|%D__9E+hsS5#e9^6IEN1#*iB6csM3Fv!V;9E
zA}C&^goh&bhsbColM^vulArz{27u3JBM6||WRc)7jGXW(rcBZ83RcZEU~55#1bLhT
zosd$RzWK9RVqsI6PwKBtQ$ryiBOA#Z%(35%S6gK>av-(Pd8h$=yHXU*+c(-*90O;@
z_rVf<uHH=XAYf~0ts0-2ly@`#qYc$F3rief_AU!}&QZ}(B`_M5!~uFQN2a~OrpuL_
z>&tU6P%w!Gx9gN@DpVGPIYg<;(80K5SCeLU)OKoqwP!~;*B5SLez~oxe?s2}qy?RM
zOK0T=57U(7Odnf2skDjJOJV}Kr7}&YCsJb0ki>Y0yKY)n-ig!;hE@<9VKn|TMfO!e
z>uSv#fO=EQ%Q!)7T=Fx#fErsdk+4re-!5I5+1y|$6l0zhY1Mm6V6?5%vbojG>+9Js
zD!H&EV&WP|SQD8vJAE_{?}CaAtA{-lm<1ix2}o_rM-`MKmU$25lhcg?Y{@684=3aC
zL+?AjI?0SvOGtCf=*!#KY8vro5Axt)p2}P$jxo0I>-{@v7~fO2l+<Y=2W`Dkzr>i!
zj$6=lx<sYm(3&rM2(!x>@nmxzTK`U9a=Dm$i6!xMfx5B~4_|WW{bQOE<n|x3%E=ps
zZ$<Bgd|G!Qrop}8Dg!onBf)X*sr&r0pDO0`XL}D>lg_)J?}sQiGSWJN6Rwp>-S!<m
z#+Iz{!<rO}GRh=G25<HtKmqU_8WyaCV>6}nd4eMAOGQ=sA$3_n6aNIc!Hqde^d@-M
z%G%89u5%Pt0qpbqkcJFoe2UF!h%h5nbR$Pc_<pJc>PE@3Ise!o6&Nx*E_didqY#wC
z)g<kBk;6od&|mzAtAn>ru~5EwM0X<Fe)&q0=gk8~^aRpXm7@#<b%$dRKfCV~C8hU_
zM1c1K{+OU;H+pKl1(36hh?(~r7NGdTpF%)}!i^qK6!TAIPMI_%qy`xMy+)dYQxNQ2
zpxXMwM(QOOG@~Lq(b|c$A7cJS#JQ)04ae+{Vnh>EC@u-4ltn}N7@crWT;~A9tqc>t
z)BmD#C=3LiV{9$rG6QSYHJ1{k9G<#}!2aG@IDzR^KAcb7l&2NN_G}(C;9uQs%v0Ka
zD~31G({MdGImvgkXb;kjb#-+`M@NGcq1vr(wNiQeMHrbQYU=6@-Y?H}uILUhDfO>}
zSz~z`?3skraBuiD4L0n<Qpc3CUzkH-;LwClXRleWnnqB6GD)l>VKyZPr7S!I!HIr1
z__yrF|JOhxV$Xa<K)jk`Ki@x)k+GXmIuS+Xd;=_>pFA=*WRq<%247`!YpZhZaBrgE
z=3u5GH}|zu%|oEQuuvjr>{6nSz^0}0TNfe#zbQJ3zPs|u9rsV27(LxYI&Ehkfn?;8
z-|w?9l#pUne|S8ST{gFZBJrO~12fZL+{)kW9(Lx$=-g6u)!mDaM6d<MlmfGvnRNLP
zxQ^5Fz_0tfi8{rmbSf%OL0mEL7U93fW;<79^b?h6xz)WMLYh_1#>OU-!e;g_2p#0X
zbGnhHp{2FAvkOEeYIDCi7Se?w{P9fhkM!BB6N6>JWJbsB6^y(@eX^6a;Y_N2dXr0w
zU|vl~*O%qno&*j0Quy}vO~{A$VTs+~QCB{7rnFh^7J3Cy+ISd@K!Ni~%1hqg193_M
zNOR0c^N!dmub0k2p|N-dmPD+aBueFh{I*Fvj^+yoTJ_egciXA-*hrEwOVno%Pas(z
z9X0h_jhT|J?#Fl>VR2%3-)H()b>jDV)gFc3>0bCZi<+^|ovp)C#_!^(Y~^K<$g}IS
z<}|D(y*(55h*LzlLk?n#Hu!a}67FXr=SEn09e9n+^2ycSCw<~!)THaV9OA`wNWjUH
zCT|S+4lm;O_m?sa0RaKn1-qbIQBo2b9&QD)!j?=eQERk&J;hK+I~~qOr==|x$P>{p
z`bPZuR{3AcH`$r3wlez!i3^uB?t9xm2jZw%|7L6R>{S@HjN}7MvA2R?A>R$UgwS5E
zc7|>2<0n^0isX}_6QPV5-|p8h=T*VJp7{7JyGE`Latj9xiJ?6k>AcPitgNh?G4u2D
zhlhuFti~Q-o9NDPIueZjC_3QtTH;UY&wxXN?kO7%tWr${-oO9u^V=JXQtS<I3>$i+
zY%tN&lY{~u982tOT9sMPI>x+Iq&wvHaeP-{g1Tubk!-A<wr;ZKsq#l?FbW`-aeVxH
z&ES=jOpsU;q=g;H;4e`unpb^G2nFm4PGyq7&#9dwpoyr-JjJFKeT6(b#u4-KxIT#h
z-#JrKSNMfqX!Rycyy-e6J@jKNMa<_Z?UO!z+Ym2+ZjW%+i?WmYwn9Gx4Z1>_5BmsO
z8q%ZaHD6U=ya?S*5)6Z+JU@5%5MmZV*dEm*C;olB>B9MH33BLyRG>OGox1|<vECXz
z1<)p-8AsC1X8C3&K&goc9E(*yIp`EFP<~Rdhsf)&_8H8y+mib`XDE30VWTQueCv93
zz0A3n2OU!20gZ!m*Gf{KX|wglysX3OmSUZJye!p{q2XZ$DyrEkBP3z8qhdEFF{&hc
z(U<bMcAADu(qVXXM4aJb!M2MoeosFK599Ou0A<oT4^KrWoe(dAvczx|R8RRQ((M<}
zZsj7#M-D&Q1vZ10H_PgAm3-)@nM=DP9!h-BBwMr@X-4w}&OQ$Kr}0#+zoyro1CJ}8
z?(1?R0qS(BrW9cJ>ZuE##Y}mgV$>eIG7O7b@p1sGh<}IX;sodS?7U?$dPd=6b0*HV
z_x&Jfx`dZ2pQAbQ1jLf|=xVG*y|TI+9)L+yc^H@EVU+7k)~!$j+b!AID=RClDmdBL
zAmZW#;UGPAe~sbI@zN^|^=r$B%h~#$mjx$mTnCuQp3g5u-^GH^_Knyht>A#USuE>P
zWiDbGuc6yZ`JE>G!MfPN=`Q8P`qX>T^MQ@6*cfPgh;w>0mVF9mdI4+i-FtT^A#Umn
zifvPDqudrYK9dD3lk_ROnno|ejqnd^LJWztSRvWj+1&QqHLYH|qa?{P*t3Jfg@zOP
zvcPY{K5&mE)Ra)buY(-N8o%{~XUJ}!yzb?<oS#NYE7exR&`2hA*F$3)$3R9S5_D)%
zoGT?6N!yvdyFNuVaGcWMJ=+BUtu;52OAW05f<j9QA_QC6o3Bq++Ci}<CE@OefV9Vg
zULJCC!%dC{g|z>>h`))UsHB87d7ensd95R$NT~oD2S;37e88~k7iZpuGS>6uirX`z
z)Xs;6K;2ifNHSSe7ra|E0WEYi@Dn%uS5nj}6=(M{Zxn$#4yGdM8=?Do1!a&DBk-FK
zsAB^I_Kn&XJ0m0g{WJ^=%Wa;`fAzRrPW3c3@vm5q5(-DD%?g&@B>y5CZ3p8`BD?!&
zwgW;6-ftNd5W$d4wZjIj9!Y%AXp`r9L;9WCpFeDsXF20w;)YjEyVHSZ>6OsZYC%;^
zjWTh7QYPtiQb|59Hy6fhb-Xr3SbDzEA<uLa-E{f&tZ`sh7#h^;bIpc|Uc|NK#AM!Q
zoLd)0|6!JWk=>_jY`Gk!1Ko*YV@K8QEwcSs{*s3SQh11vNO>7~M3R$=5AAdZ-AZD-
zN}De3UBK=>SjCFggbf46R7=~ZcI)C;m%de`#r=AD{x+W)FbV6bmi`_v|C;4^jNDZG
zYO%_xLlA;P`XpP(sey+5vT1|)z^ej3RUH~P+q&~W^8Fbu+0Ne#$6&?mr6fdHxuxzu
zKavG^H2OQR5;r7kA(*N^99{;K8NGrZbnCJ#zV2HXK!dje$BMx5NCaSfna*-f#}CQ8
zoO#if0*vC76D{22y<WRV-(y}Se(0Js1iq^f=v=ARFOT_5H2;1jbVd|ELq*vZ3w4pi
zApWCbQTxHB1A?se`uN|UB;vc4d4mXO5y`X9cIMIQW^+n#z%_!em2x*g23>0|S!A*_
zh4+8G3wIiBD8BwjIWBiFY8xtCzCiR+T)gf^TAv`hEcdK1Bz5{C@K23wr8epCV)Vxc
zW4wB<Cjux<*RPX&&V3UM2FYFpDpGjU(9rq>BXoTY4H7$xw1W2n68|si|KYX9nm#3X
zrG(bqxcTn(fd0B+MW|X{pMZvF0lqSce+O7z0Dj?jV5kvDX?^vP^FQ>|{%)@g@vr}W
z9f7KJjq{ZNyS4jd?+Ld9@BjSdzn|6mVuuZmdfQ?1`p_>Y|6!iSntnZn;RDz~fuf1%
zm)*20z7DMAg<4Wi1O*ysaCn0M+c-T74;Pio-fzHP72^EQxAh`}fb7}s|CtuaWb^+R
z;9dKF___IYv+FZ~|J&pL`%(X)zW!2iw($)Q9AQaWNvYc7?tF1k`-f0eQc{E6mQ=bN
z$nS*K-QtGs)!ts82?b6m2&8=nX_03wufgt}hpPiMMa5S_Xo1YH%F4N8rXsWm`h!vE
z(fqu+XkJ$0BR;Q!Q>y@3lnDhqTtFj=5$xYIK03-|Hl7Q%FSa~gFJ#60Ga2{(*9?YF
zZlv?Z-w|-gr1R7sU4ak=%N`d)*r5UB3*Ik?nj&Dxh`GXPW<C=YlxJi@0@ypm;;=jF
zH1iXM(7b-(%FPp=f+Wnf_I1^>O5#;Z-U0z4W5-RJWw1UdiS;n_;M<iDT4#dw2_^5Z
ztU^22YMO_)?4Vz4Oew;;Tjtk5d-=bW=JlO+%|+=~!LH$>@@8!YK(A7rB+j2{d+L=R
z)xTVI@=e0__O{bZQEfV*wHK-;Mn{qw@9Q!*Y4&Z|1&AmpD^DKZgMG(_EE;;ed^xYe
zoPQPn=u`-KU!(nw!1L{fqod=GP^adnyPeETPMeRyH5n$Y=2JB0N-*gdDF(XIr-tDA
zG=-Se&bPGiB@VEAKR=e1z5<XOEz}br2l~OG=I7-p2!2L`*xK5vs$vge@EGVSJ%Vag
zZag$J1fG!+GBTUrxzN$kk+A8g7#VFIz~UEe?ZHCwT~ux9|Jn`zt=szlp@aYbx6S|5
itN*d1{vY}1nFx{IDyS}|1!PnJ07+3fNV$lf@Bab<gi;;=

literal 0
HcmV?d00001

diff --git a/demo/documented/nonlinear-poisson/python/demo_nonlinear-poisson.py b/demo/documented/nonlinear-poisson/python/demo_nonlinear-poisson.py
new file mode 100644
index 0000000..1d4c509
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/python/demo_nonlinear-poisson.py
@@ -0,0 +1,84 @@
+"""This demo illustrates how to use of DOLFIN for solving a nonlinear
+PDE, in this case a nonlinear variant of Poisson's equation,
+
+    - div (1 + u^2) grad u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+     f(x, y) = x*sin(y)
+
+and boundary conditions given by
+
+     u(x, y)     = 1  for x = 0
+     du/dn(x, y) = 0  otherwise
+
+This is equivalent to solving the variational problem
+
+    F(u) = ((1 + u^2)*grad(u), grad(v)) - (f, v) = 0
+
+"""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Original implementation (../cpp/main.cpp) by Garth N. Wells.
+#
+# Modified by Anders Logg, 2008.
+# Modified by Harish Narayanan, 2009.
+#
+# First added:  2007-11-14
+# Last changed: 2013-11-20
+# Begin demo
+
+from dolfin import *
+
+if has_linear_algebra_backend("Epetra"):
+    parameters["linear_algebra_backend"] = "Epetra"
+
+# Sub domain for Dirichlet boundary condition
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return abs(x[0] - 1.0) < DOLFIN_EPS and on_boundary
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(32, 32)
+File("mesh.pvd") << mesh
+
+V = FunctionSpace(mesh, "CG", 1)
+
+# Define boundary condition
+g = Constant(1.0)
+bc = DirichletBC(V, g, DirichletBoundary())
+
+# Define variational problem
+u = Function(V)
+v = TestFunction(V)
+f = Expression("x[0]*sin(x[1])")
+F = inner((1 + u**2)*grad(u), grad(v))*dx - f*v*dx
+
+# Compute solution
+solve(F == 0, u, bc, solver_parameters={"newton_solver":
+                                        {"relative_tolerance": 1e-6}})
+
+# Plot solution and solution gradient
+plot(u, title="Solution")
+plot(grad(u), title="Solution gradient")
+interactive()
+
+# Save solution in VTK format
+file = File("nonlinear_poisson.pvd")
+file << u
diff --git a/demo/documented/nonlinear-poisson/python/documentation.rst b/demo/documented/nonlinear-poisson/python/documentation.rst
new file mode 100644
index 0000000..6eef68e
--- /dev/null
+++ b/demo/documented/nonlinear-poisson/python/documentation.rst
@@ -0,0 +1,164 @@
+.. Documentation for the nonlinear Poisson demo from DOLFIN.
+
+.. _demo_pde_nonlinear-poisson_python_documentation:
+
+Nonlinear Poisson equation
+==========================
+
+This demo is implemented in a single Python file,
+:download:`demo_nonlinear-poisson.py`, which contains both the
+variational form and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation (in
+:download:`demo_nonlinear-poisson.py`) of a solver for the above
+described nonlinear Poisson equation step-by-step.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+
+The actual CG and ILU implementations that are brought into action
+depend on the choice of linear algebra package.  If the linear algebra
+package Epetra (Trilinos) is available we set the backend to Epetra,
+which is used later by the Newton solver.
+
+.. code-block:: python
+
+	if has_linear_algebra_backend("Epetra"):
+		parameters["linear_algebra_backend"] = "Epetra"
+
+Next, we want to consider the Dirichlet boundary condition. A simple
+Python function, returning a boolean, can be used to define the
+subdomain for the Dirichlet boundary condition (:math:`\Gamma_D`). The
+function should return True for those points inside the subdomain and
+False for the points outside. In our case, we want to say that the
+points :math:`(x, y)` such that :math:`x = 1` are inside on the inside
+of :math:`\Gamma_D`. (Note that because of rounding-off errors, it is
+often wise to instead specify :math:`|x - 1| < \epsilon`, where
+:math:`\epsilon` is a small number (such as machine precision).)
+
+.. code-block:: python
+
+	# Sub domain for Dirichlet boundary condition
+	class DirichletBoundary(SubDomain):
+	    def inside(self, x, on_boundary):
+	        return abs(x[0] - 1.0) < DOLFIN_EPS and on_boundary
+
+We then define a mesh of the domain and a finite element function
+space V relative to this mesh. We use the built-in mesh provided by
+the class :py:class:`UnitSquareMesh
+<dolfin.cpp.mesh.UnitSquareMesh>`. In order to create a mesh
+consisting of :math:`32 \times 32` squares with each square divided
+into two triangles, we do as follows:
+
+.. code-block:: python
+
+	# Create mesh and define function space
+	mesh = UnitSquareMesh(32, 32)
+	File("mesh.pvd") << mesh
+
+	V = FunctionSpace(mesh, "CG", 1)
+
+The second argument to :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>` is the finite element family,
+while the third argument specifies the polynomial degree. Thus, in
+this case, we use 'CG', for Continuous Galerkin, as a synonym for
+'Lagrange'. With degree 1, we simply get the standard linear Lagrange
+element, which is a triangle with nodes at the three vertices (or in
+other words, continuous piecewise linear polynomials).
+
+The Dirichlet boundary condition can be created using the class
+:py:class:`DirichletBC <dolfin.cpp.fem.DirichletBC>`. A
+:py:class:`DirichletBC <dolfin.cpp.fem.DirichletBC>` takes three
+arguments: the function space the boundary condition applies to, the
+value of the boundary condition, and the part of the boundary on which
+the condition applies. In our example, the function space is V, the
+value of the boundary condition (1.0) can be represented using a
+Constant and the Dirichlet boundary is defined above. The definition
+of the Dirichlet boundary condition then looks as follows:
+
+.. code-block:: python
+
+	# Define boundary condition
+	g = Constant(1.0)
+	bc = DirichletBC(V, g, DirichletBoundary())
+
+Next, we want to express the variational problem. First, we need to
+specify the function u which represents the solution. Upon
+initialization, it is simply set to the zero function, which will
+represent the initial guess :math:`u_0`. A :py:class:`Function
+<dolfin.cpp.function.Function>` represents a function living in a
+finite element function space. The test function :math:`v` is
+specified, also living in the function space :math:`V`. We do this by
+defining a :py:class:`Function <dolfin.cpp.function.Function>` and a
+:py:class:`TestFunction <dolfin.functions.function.TestFunction>` on
+the previously defined :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>` V.
+
+Further, the source :math:`f` is involved in the variational forms,
+and hence we must specify this. We have :math:`f` given by a simple
+mathematical formula, which can be easily declared using the
+:py:class:`Expression <dolfin.cpp.function.Expression>` class. Note
+that the strings defining f use C++ syntax since, for efficiency,
+DOLFIN will generate and compile C++ code for this expression at
+run-time.
+
+By defining the function in this step and omitting the trial function
+we tell FEniCS that the problem is nonlinear. With these ingredients,
+we can write down the semilinear form F (using UFL operators). In
+summary, this reads
+
+.. code-block:: python
+
+	# Define variational problem
+	u = Function(V)
+	v = TestFunction(V)
+	f = Expression("x[0]*sin(x[1])")
+	F = inner((1 + u**2)*grad(u), grad(v))*dx - f*v*dx
+
+Now, we have specified the variational forms and can consider the
+solution of the variational problem.  Next, we can call the solve
+function with the arguments F == 0, u, bc and solver parameters as
+follows:
+
+.. code-block:: python
+
+	# Compute solution
+	solve(F == 0, u, bc, solver_parameters={"newton_solver":
+		                                    {"relative_tolerance": 1e-6}})
+
+The Newton procedure is considered to have converged when the residual
+:math:`r_n` at iteration :math:`n` is less than the absolute tolerance
+or the relative residual :math:`\frac{r_n}{r_0}` is less than the
+relative tolerance.
+
+A :py:class:`Function <dolfin.cpp.function.Function>` can be
+manipulated in various ways, in particular, it can be plotted and
+saved to file. Here, we output the solution to a VTK file (using the
+suffix .pvd) for later visualization and also plot it using the plot
+command:
+
+.. code-block:: python
+
+	# Plot solution and solution gradient
+	plot(u, title="Solution")
+	plot(grad(u), title="Solution gradient")
+	interactive()
+
+	# Save solution in VTK format
+	file = File("nonlinear_poisson.pvd")
+	file << u
+
+Complete code
+-------------
+
+.. literalinclude:: demo_nonlinear-poisson.py
+   :start-after: # Begin demo
diff --git a/demo/documented/periodic/common.txt b/demo/documented/periodic/common.txt
new file mode 100644
index 0000000..be315cb
--- /dev/null
+++ b/demo/documented/periodic/common.txt
@@ -0,0 +1,50 @@
+This demo illustrates how to:
+
+* Solve a linear partial differential equation
+* Read mesh and subdomains from file
+* Create and apply Dirichlet and periodic boundary conditions
+
+The solution for u in this demo will look as follows:
+
+.. image:: ../plot_u.png
+
+Equation and problem definition
+-------------------------------
+
+The Poisson equation is the canonical elliptic partial differential
+equation. For a domain :math:`\Omega \subset \mathbb{R}^n` with
+boundary :math:`\partial \Omega = \Gamma_{D} \cup \Gamma_{P}`, the
+Poisson equation with particular boundary conditions reads:
+
+.. math::
+	- \nabla \cdot (\nabla u) &= f \quad {\rm in} \ \Omega, \\
+             u &= 0 \quad {\rm on} \ \Gamma_{D}, \\
+             u(0, y) &= u(1, y) \quad {\rm on} \ \Gamma_{P}. \\
+
+Here, :math:`f` is a given source function. The most standard
+variational form of Poisson equation reads: find :math:`u \in V` such
+that
+
+.. math::
+
+	a(u, v) = L(v) \quad \forall \ v \in V,
+
+where :math:`V` is a suitable function space and
+
+.. math::
+
+	a(u, v) &= \int_{\Omega} \nabla u \cdot \nabla v \, {\rm d} x, \\
+	L(v)    &= \int_{\Omega} f v \, {\rm d} x.
+
+The expression :math:`a(u, v)` is the bilinear form and :math:`L(v)`
+is the linear form. It is assumed that all functions in :math:`V`
+satisfy the Dirichlet boundary conditions (:math:`u = 0 \ {\rm on} \
+\Gamma_{D}`).
+
+In this demo, we shall consider the following definitions of the input
+functions, the domain, and the boundaries:
+
+* :math:`\Omega = [0,1] \times [0,1]` (a unit square)
+* :math:`\Gamma_{D} = \{(x, 0) \cup (x, 1) \subset \partial \Omega\}` (Dirichlet boundary)
+* :math:`\Gamma_{P} = \{(0, y) \cup (1, y) \subset \partial \Omega\}` (Periodic boundary)
+* :math:`f = x \sin(5.0 \pi y) + \exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)` (source term)
diff --git a/demo/documented/periodic/cpp/CMakeLists.txt b/demo/documented/periodic/cpp/CMakeLists.txt
new file mode 100644
index 0000000..403b066
--- /dev/null
+++ b/demo/documented/periodic/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_periodic)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/periodic/cpp/Poisson.h b/demo/documented/periodic/cpp/Poisson.h
new file mode 100644
index 0000000..5a05f51
--- /dev/null
+++ b/demo/documented/periodic/cpp/Poisson.h
@@ -0,0 +1,2213 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d29669d54e80ba045b9f6aeb94d0d33237447c2de5977853d51a949f2f7e7c2b30871cf2fd1dd173fdabb4daf7908a96678f21eb4086c6ed052d173bfb7ea232";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/periodic/cpp/Poisson.ufl b/demo/documented/periodic/cpp/Poisson.ufl
new file mode 100644
index 0000000..9bcdea8
--- /dev/null
+++ b/demo/documented/periodic/cpp/Poisson.ufl
@@ -0,0 +1,33 @@
+# Copyright (C) 2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2007-07-11
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl
+
+element = FiniteElement("Lagrange", triangle, 1)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+f = Coefficient(element)
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx
diff --git a/demo/documented/periodic/cpp/compile.log b/demo/documented/periodic/cpp/compile.log
new file mode 100644
index 0000000..8d7022a
--- /dev/null
+++ b/demo/documented/periodic/cpp/compile.log
@@ -0,0 +1,170 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0164762 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.00062 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000516 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0067122 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000215054 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0404301 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000652075 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000699997 seconds.
+
+FFC finished in 0.0655069 seconds.
diff --git a/demo/documented/periodic/cpp/documentation.rst b/demo/documented/periodic/cpp/documentation.rst
new file mode 100644
index 0000000..47abf1b
--- /dev/null
+++ b/demo/documented/periodic/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the Periodic Poisson demo from DOLFIN.
+
+.. _demo_pde_periodic_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/periodic/cpp/main.cpp b/demo/documented/periodic/cpp/main.cpp
new file mode 100644
index 0000000..f4e7db4
--- /dev/null
+++ b/demo/documented/periodic/cpp/main.cpp
@@ -0,0 +1,133 @@
+// Copyright (C) 2007-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-07-11
+// Last changed: 2012-11-12
+//
+// This demo program solves Poisson's equation,
+//
+//     - div grad u(x, y) = f(x, y)
+//
+// on the unit square with homogeneous Dirichlet boundary conditions
+// at y = 0, 1 and periodic boundary conditions at x = 0, 1.
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+int main()
+{
+  // Source term
+  class Source : public Expression
+  {
+  public:
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      const double dx = x[0] - 0.5;
+      const double dy = x[1] - 0.5;
+      values[0] = x[0]*sin(5.0*DOLFIN_PI*x[1]) + 1.0*exp(-(dx*dx + dy*dy)/0.02);
+    }
+
+  };
+
+  // Sub domain for Dirichlet boundary condition
+  class DirichletBoundary : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return (x[1] < DOLFIN_EPS || x[1] > (1.0 - DOLFIN_EPS)) && on_boundary;
+    }
+  };
+
+  // Sub domain for Periodic boundary condition
+  class PeriodicBoundary : public SubDomain
+  {
+    // Left boundary is "target domain" G
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return (std::abs(x[0]) < DOLFIN_EPS);
+    }
+
+    // Map right boundary (H) to left boundary (G)
+    void map(const Array<double>& x, Array<double>& y) const
+    {
+      y[0] = x[0] - 1.0;
+      y[1] = x[1];
+    }
+  };
+
+  // Create mesh
+  UnitSquareMesh mesh(32, 32);
+
+  // Create periodic boundary condition
+  PeriodicBoundary periodic_boundary;
+
+  /*
+  // Create vertex mast-slave map
+  const std::map<std::size_t, std::pair<std::size_t, std::size_t> > periodic_vertex_pairs
+    = PeriodicBoundaryComputation::compute_periodic_pairs(mesh, periodic_boundary, 0);
+
+  // Creat MehsFunction marking periodic boundary conditions for plotting
+  MeshFunction<std::size_t> master_slave_entities(mesh, 0, 0);
+  periodic_boundary.mark(master_slave_entities, 1);
+  std::map<std::size_t, std::pair<std::size_t, std::size_t> >::const_iterator it;
+  for (it = periodic_vertex_pairs.begin(); it != periodic_vertex_pairs.end(); ++it)
+    master_slave_entities[it->first] = 2;
+  File file("markers.pvd");
+  file << master_slave_entities;
+
+  // Attach periodic vertex pairs to mesh
+  mesh.periodic_index_map[0] = periodic_vertex_pairs;
+  */
+
+  // Create functions
+  Source f;
+
+  // Define PDE
+  Poisson::FunctionSpace V(mesh, periodic_boundary);
+  //Poisson::FunctionSpace V(mesh);
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  L.f = f;
+
+  // Create Dirichlet boundary condition
+  Constant u0(0.0);
+  DirichletBoundary dirichlet_boundary;
+  DirichletBC bc0(V, u0, dirichlet_boundary);
+
+  // Collect boundary conditions
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bc0);
+
+  // Compute solution
+  Function u(V);
+  solve(a == L, u, bcs);
+
+  cout << "Solution vector norm: " << u.vector()->norm("l2") << endl;
+
+  // Save solution in VTK format
+  File file_u("periodic.pvd");
+  file_u << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/periodic/plot_u.png b/demo/documented/periodic/plot_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..c587c0932e2dc651b6d610b618b1a07ddad595ab
GIT binary patch
literal 58379
zcmeFYRa9I})UesOJHaI(KyVB0F2UVBjk~+MCWPQlaCdi0aJR<YohDc_o%fq>=4vkI
z?!V}@&gye|pQ_zktDcHhQIf$xB|!xM02p$zl4<||tPTJG^9>mm`pv6$^b`Q_9v~+v
zrs0)!*5yBKuWLy0SI{>1wtF2z=Yx``D3y(TktA)MB|N;itANFDv8)9?JYyNH)+18F
zs+=Ot2P;}&WOr2`wxWWRo&BJOJ`ih^M-7b6PRvi07r%v+FGgoJw5(2!2mJa3_TOxH
zxJ(xb=xGA49%lJI!%n;&Jv`i1wLIwho;QhX+*VtP^wdbn$x`D+OYZzCFgQW`pG!5W
zXtwXr%TFY7VbPLQ-+5<bsT80O4Mt1jno>dUC~+ns<3aB@7krmY`}Z5Xc<O%WgR)sx
z)Ht;Nq)C4KKO+8*F8+V8i@~4qSOHg|Jez*EO-n|;ulGxvE@RA;&&wmin>k4VXCnb;
zPp36K;8ok6L*MSh?MTY*-fPyE`P9$<nd}bgaM#0z@5y|brO>IaqyMS?W&0@$fYqxH
zO&D^W7-%FEcySnT;a=mro(MTg?A|56{CgEC^6~)L*zEXL$O09_M|Z4dEb-3`x<%KV
z1~4|Csy2O|&s&~l<XYBTV$-`GCmg%4ayIW2H}7J!J9idp0=R+_{q{ai`EJ}&1pM8;
z_wk4PCrKdrpYJf@Sx#obT%}L>6+6D{8$<R>gwCyVwWm^hUiKe01ABM^E?jfru8;z+
zkPbyo`j!13&E4g6dH*@6F)xMRl^8(T|3v+HxI}QD9!uzM`f%Zv+0k3x*6-i@_CAR`
zGIsAUP6p10=RV!Y{O7+0Wy^Nlfa>;>^6u-CiW-WMYqX<BR>)9~*QM{~^TtE>!?|Oi
zFa7?DjN#w1spzF!abMvGuL%lA6U4E9u>uy51Gy{NgwB1*IPmq<`0Z&b0NjxJ<ibMn
zKXCyDun9TegtRYpU9<!~x5z<Wd)^*c@AnM^{|gU;KVt?4Bmnx>fzX*>gVE0T5(?9s
zhHb0c4k%v>1Men1yKnz{H*4VkK7U%>f!Rw5*`@@?V+sG=(n245^zHsT#47Cn<hBU`
z8iRq<Q~yoTU>b%M($l4#^j~1oX2`h;`y}|#Hr4ff(V-vv%lD$~@Np_oIB0iwS2^%$
zE^+mi^=-fB1>Dl}dbZMFzofr$LqNGLD3kp*PZ;Jx4>^~Rj)z9H!FO?UCCWW}G^~8C
z2jlX_PqR<~|Ag5)`huP}-vR)+kK>j(&`-IRBA@mY)C3_H9hZ<4$H$bV&I7I`L(g^A
zmwwjH>v+e`H^?)k`^)WFd;PbVe}T5zWX<n(;_YDbB{MPLt}yVt=C!Hkz6G)v_*(OJ
zuN|<jopYOYXy7%)`gX(mHXSK^*JS+Mw0Up1>3%!G6Zo=A`F3yoc3<=MR1-M=pRx1R
z59<B1P!^c8PprYXjGLAn@zx}Y|6+JiFK|HQ|Gxfz<2ehdb;dtq`~h#sEza~mu{#yO
z-#V|Y;=ID<@=q3SD(wH04(6<OoTET*e?07C)p-IG->!>Eb3JfaKYf=qScK*Z!40S9
z(~Y-PN^8kh#2OgHm*0-=hKNoWFl<2p2cK<qm?!R_Ob5R&=fun<M$39mbMb_F>QIZ$
zLh@KBd}!nSJ<1V1@(wa;+;ixE`KH`U(n?|g2Y@I4*nNOt00;L~l#xv=4**Yb?<n?-
zM4)*%lYsN_oxYH=6q?@)eqnUj?q5RIV8@Fs0kB4j9CSDVSK5$N<Ic+^2(kehfT*+B
z9PslkYXF@s$^=CV&3(DHLn{^!w8#R3XmxB$$a#L+R--zn$P)kz%*ZtQ+qg;zP+I?c
zNa&lIjTg=MFDVY1$MxLUU;dMr`^7y7865zqAf05LG(w=$<Ggs4uzFeQUDY*2<5z>1
ztmPiHvGicF>eV1_G<32hV;eZBUPo)lG`hR<c?Ce{uDsd)Pm7wTfphW3U6+V>(ee?{
zbh=YFc>Z?A<M1}~%!pPQB+)BpdRA%*hyco)_c3dfgH{TMJzz@e%G3;P-3*t1&{VLj
zS)(JARpXHB7JPK67<GwdMTigT<>)~jtWzIpdVM39_kz9v13BY-pu}iCoDhZQo)Ry5
z1lDph043_GJe3BAmLjqBRVMHiO!<sq0$6+O4nekO=mRipq0&uja1o>=?`|bAkTg@9
z{IJsJpAErWSj7O)1?gQ;0YZ8mK7zT+6Ldj;ZfEU9kOd}I4fn<qP8^)9cjE=t!O^g-
z$Kl3vEt{N3`>4HTq&>|dTg8NiiIQeWiJiV)cS?y|)ez&7^<nCMXoLs7Jw__O-6o0y
zmT<+fR*>VS0hp!%_!b1{BwGo#*npJg=`PwiX;OX69&RttuH=GegN@`lR@K4WP+1k`
zjIGKkw+Cz7p~+&N{bc+ZOX0mIK{7$gvXb%ezJ0p4zPbN<8>HrvB_WvYV$zz+VQWgu
zJ3*hh*lvR85&C}-Yy{Bq_SZ2Na=jT0k7AZxfzgbDYWJg_R`$KX*a!aO#lp$6Rnz1R
zoK_QL*OeB#EP&>5^MV&lAJ@ijS6BPqX1Thug;wK=^(Rt|k~k2?#fBbDLpV&jd=d!!
z)8=Bl%J7-Ox}(&;lcL;h#z$TG2am(tUKwd_-BFgH5Anas>93jdbI(iF+}lk{{-}LH
zrYMkER~(xvK0o!#s=WLCH}0Xx$N4%S+J1;q!G5Qar~}UMEIi5la)>RuiA=!+d^^oh
zWwCflHO_OWEtp6IB(cna)8brQ)h+O)@w7Jg&tyY|&>?MZi?Y^R&j@!1S)eW9gF9g_
zO*9J~9vaOT>ga%D=L4bCAmp0IQ>eL*;6zxyoQ{UTYpDbqJSvK2ilVdyR+~Y(wae!9
z8f_gL$<@+N>hy)$eu*;eTCq*d_!@-nXQ8*}Y6<)}2w}31q;B*FcN^+|%;R=oXCcUL
z`4m?a?bVmPR;+d=xEFrxWyzAEdu1?}?ECfM!eXKRd{_94(ks=B)VV%jt>BMKdBb(F
z{+;+$+k+7-mEUX&G%HZB{;jBiCdk((iM~J+wu1QV^g4K%)p>^BgDfz$QnFU#Mf!ng
z&w9Tcq|evPL4MZnQ>>q>0yotpM9p;;P7A3}8!26L(Z2aUlFF->@Nk+fTjs7c<2tU0
zq-H;m^0g41b|$YVEZ#;E(9L@;vy)7Xx7)6-N1k{24i<nfG6ZU8-!N%9QZPQgRHHt?
zN;mnaQWie<*T5{j{eAP=_GW#(P8^FwZWz?t867z0dAacKdDO*3s&}YP4gMJQB{<4E
zOFkYK?<mU=nNRM_XXXH_!P@!5kIH)OTwc1`8x}Mjiz))})FkSt={Dlt83Og9;h-Yv
zG->f@w?39dMh)K44I}Nuxq;fGFwQWW1xxz2!DyU7XDhE;+u>~zFbc({u4R3mVy1aM
zb#BsDLAjz~#bi^o6stVqZIHFyx!G7cdZ1q}&T0>aZNB@Ur|hBYO=Ot-I^)5AOWF7t
zZc1QD=o5>u8V+qW+nVPa<?F&_yQ5Zc!FV1DxA@1wym)Nw%py+Hl3XxD|GG$I*Leq(
z!bwM6czV=YjFT#j`J#gk$59HQO6)+}l8^2_PD`3JDAJRs^JC)hxiH#*#e%CVPf4${
zMJ%y_@P_NvrV*3CW$9>_#JLfGz_TPfg_$CoIQhHxiZm$2N1)7c;?K!KY;z))2?n5(
zA2!o}%JS`^o0LyiRw_-_FSzw`;0-~8=SS?tCkBKYL7#}z-^0k6S&s!c5<DGpTSlmB
z10M2f8kQm&<AIV~@~h%v?Y~rPHCho@NZu7IY3QF)bxYs&@FG}1Y;6*m&wxvl(fdOp
z3|#ew6ZQUGfnn0zLixiUCA2L^i-q0~2Fhf8t`|OT(raxu%(nJD74vY*6ERhR+5jtu
zN=Ih3cTtr&8UVz1-?s4jLVcnFwI5e6mHChXyPCOEq_e5GP<LWPDY<-EKF)pe(%~>)
zrIK|DK}Myr!ahhwY_4aTq&nUIrl&Na8D{O6B#~MFjDeQ86$cDL2bK96*_GkjCus7R
zbTvGdH%DPCY(;x(|HwyUB5AW4oUDD0aX5SYMeee?lL@}Az5LY;R9?d<?{*t?6WdJK
z!;E$)0By)?1vdDCJvzWg+AxyQ?9COZwOaHHvH3e_$HtlN>tn6S%dtxVZ?}-^2a&+T
z47^laXsuu%r?Yu=P>ua1_IsIBqfpSaCD~~Kg9e|4a{UW|>tFoNcQ_4WEMwB(c&jf7
zqB6{{)DC0U{;NOPCPOD&YDL`d?VMv_>+odeRz2T(AH1Kv62PwB_fME7&6Kabw>nIo
zm^l2^dKCCarKNSW01%UOgV8UC6s`UBF}iidCT*NR_A;XlNJ^#+e&5e#%-j*;Ac-Kb
zaku9)w=x4{Z_^l-2E0cY-w|JijHivR^mZ2r0G)a_rCY<6<nhB&p`-;PN_u!=q}kog
z@!E||>IQPhnh=h!xSxK-ON~d9$Z;=(q03u<8A}?7yQ?smDxTTUTA3`!=UBwlbo506
zO*+?o#Gh=8EIH7@b*FsTAqy)p%pM8YOaR}oD9WGj+f4`wv^&(dVh%}>O-!frv`jU<
z#3TCSa<ib=eI8R;MBZCoFIqDxZLqqc{2+H*V_p5y5^<Gi{Cbw{t6<>si%P+OT}R|_
zJsUOa7Ygk%yM}$ftHtZGZ0+Rh$(l6=L5IiwQbFDMYC&%}%h$q+a85Vc1|^`@q><BS
zf$!Qp1Zx(~lLR@abVn)%Q7X)3X5PlWf0LFSKy`k@d?R2~Dv)<o4vklnDT|kbZR>C>
zh)_p>iB<G)gUgsB^`=oq_il~$hJpX#cWZ$6x4Ld}`@9{To^N96MdSSS@2jIE04}LE
zUf-;-0;V=j1=9Z(Vj02Gc%0v=Lt}$ZR`)5MJhLhlb)qd{h-i_hqDt8hZ!|o^Uw7d%
zYVtkgL0;LLiUeo$P8OBSmh<Bw4NWy_?|m7{Efksu+76dTqq3A&>1uAw$iLG2O%D}<
z&(};J{Q1uex`#QG3CS=IUJVe{xCu;Yh(K<vMEWaC4#Sm{p~eDSYr|iC^N(vfd9t|A
zTN!mcQ@48S$*>N2-r<DLgp{2USo5L38Mgv<3F$@E4fkB65{*)3;=$OzK@f-0J_I)u
zg52dq4X7i+Ws`BP=rp|ZyQonArD$kim3_lC(l+iQix@Ber;%xuPyeHU@oqEF{X}nC
zUq(Q4>D8Z^%(r17d9CD2iyCQWYgUs*N4fuKO%phxmz;08!QtB;H->Ao%mu1INiPCl
z6W%#qh#h=`U1ILoSi@wx_8+y|YM-qXZo>@GDd&QViF|DrQ5oMermo74RT(X1(>Pi-
zmrs7zKX?%=^}{(|OSI1oW}}A#AMfS!2CJWo|BV^1Wb-cy;9H;c?}OR^EW9Cj-TAbf
zrPL#WA)pBTqCq$_<UIi*r*bK>v&ysN)G%X35sj<29mwI`Oct0Q)u48@fTD~CbL=}Q
zE6d|puELaH7nwm^TTx8;LVbol;XJ!KE5X599?WDa=fg>C+=DKoVINFdiseW8J6r9A
zXT2)RMY0HnEB`~T=ebW$M8qH_PpR%gyE#x&hwbS_=_ZW^Wqu%yO3x>)7Bm&2W}6V&
zK=W9l1K7$B8{nQdEMFF0XYcpXY|aQ<3Aq7)YS>^4ypQNf8fZ~>^r75M(OQ+n0Sylh
zV;0M3Tr$}hzCRAumR%Jre^g%N10(Zj3a-^tnWDJ6DvG^JqdOBgo(rG8PhEHJOqO_q
z4t+oq2}ihaK85>sRaJ!V2-U}Sm^@6ieC-{df!|{#NTM5#n{7;Uri_GKS5a%uIf1EP
zbpzkvvF6W;Byv9uJc^atW+m(<*fH+li=qiSl%U1a>8hAVpGKnROz5Ff^COh!;ahz}
zz9~L@Z9BIN++jBi@q2oO_B#d_ysyKXaQK)EpQk_Fp^$KWmi&otqwBBeIq&TaI*RmX
zYHgaS=wgni5j6}#w>Xw_yY*N0dL33HoZOXJKD{x}Z=P;n!TCT6GcMh2;Z<e$h1I()
zul*d1!1|^6+gNOC8Vb`-`cy;^c9wVtH)o_(x(MoeO{JlxBTTi{7n4U{v4=tNB4)lO
z!WyvwH1;n3Wiv%)%t~wAi`~j%J(nPFnvYS<_<;w){Z4dR8E<_(w-_be^wCbF&HPIh
zYeUdgy&abka*<p5<bgB{q<-2fB04&1x+WcP9slE#Zao2u^{r`*wvUG{8%;Zkr<{4v
zCyT)_P~sm41v7Tw16gO}EIc?uk@>-4MHTcR+XfxgAfeMFp?StHKpzX0OZ-=M={#gD
zn$d9SheP<Eu&@&<GlS^GM2m&0<>b=x_eQgtffEe_j*$qy@@E7GRtrj<9yV@#dZ4;a
zhLPHcygtPy8u$vpH!3?k_C~=VdWYtR(0X4|IfImcs$cx4`di{p0ZKBpyJ;Z<DZBtg
zQrmFb@i}A0b=+mWE@an?Jc2BE&O(C{YzEhF>+qxeXN3(W%3ZEJEKlao9A=sFv-e}0
z1-<*oAl1UEx{kEsDFV0Inaj$PCm^A}b{Rt_WuTM$@2Y6vQDye|p4JccuSYda2tCX5
ze-@QSrSKg{Yb~E>L(DM}hlm9P`Uu_@%vYK`TL?TN(`(<wQus!V#{d!DImPEM^tk^y
zqAUSHCNX3UhW{IU>u!8*jGQ9gnU_(^`p?kFDJHvo9Sv4c&T)!n)$xy&W^e&|k((QW
zm?Y&b2S_|PU#WGD$(G;qJ!oZMYX0!v-1=oNXIg!dG}}f}lU1H(k8t|4ZO4qXyCLtV
z)OjLIB^aixO9X#AzR+O3RWH)A#?+`Gn)CYNx2I85rmE&%zmb7$3Jk8M*$sh}7=YbP
z4V-RZ>T46ih%=UJOMWwJCWMXu{!HYsBAZXEa<i-ro@MNPb(WLk^M>WQfHkbg$}eST
zG0tL~6|j2=6GW>ZGj<OH5G83*f8XiaV<3v>*Py88o{09H#x!s0F;hw>UjO*spafi?
zUxq%YROfCT;_pTUs{R5e7FJ}wPiy3#Q$ywcX{Or)EkZoA_t4tM6q#naOw@e}UeuLF
z%bhO#oyUj%CqeH?G0rZ`SWp={XG5efcI2o68Y7iTZ~cVM0E4vc6y*_WdJ;3hgL|Oa
zXHy865bHFjhic(m9Zt5E6mc#UoZJsbgxOE<H~(qF3|4Fd>~EYnC>(bxbLr~*O){;u
zlU)dwnK0#}`A`u8vJNMhbGxX;H&_#awl*(Ph=t$e*!{Ex=cR7%bJo<t(wwExaR_Uh
zEZ;H-aXF+_7!z+2!?)8*_(|&{&UL&mL6YXT#gO!j-s6wPe#)OK7EQF<4&o(b7vGay
z8g7zmm=OZ#Z)QNO`FG*`sj1ydL?DkQuv#jc+l63>CrgO9^{!w+;9MufK)z1JpHMYk
zB<4~XK2jX{xzA41-kQ4o+*b|L2<D$Db+_)8yupc1_Y@I$NC|lKr&;nU7cA!pYkC8@
z*|Zpec(g3)gFv1}htHArND1u`vFR@Q%cdo7X5W;EFWej~4a$u<DK$5d$A7g>c(2VN
zI}wqXk58c#sagAr+f$+e${O&>tA7!pxs9(8&Uz<oYp{Kp%U~jp#j8wYE3M<0VhUlm
z9ldY?t=kbc9XqyWIJHoUxmAR_jJ7{hxtrT0T$kPNMOf993CCajvTIte&~xy(9t0*r
z`+Z={oTopo&V--I$1`Lm*L>Eg<Y|q=OowW_ipzS%($!g;7;9zw^y_w8?LXNP!_L0r
zP*44(^XPc^&A;)GGBlN-%&YRoEnPQ?8^x1*Dt&2rHP!XAYR0OqzrQjJQtn!6WL19v
zsPs!$a9hLof)!k@NDeMc>oK$jAX4+8YLjMJ7D=Hyy8xQUTE90Kd~S%u{P3h*Sm_r!
zK!VF_LU#@Rg$&NOr~YQU0`Jpl#Y*E0dVo9}w*DRjhW$5ufeRO;4}j6h*+~xvB0vzW
zN!)Rh?lvb3K{^27lc+KsJ>l0|C5y-G4UEOtr%!fOTkn>xJ<krj0O<r|wOM{p%cQGh
z_|@}rQQg6~9YWG^k?p1*vanSK=`2mEUj2}n&EaNL)9Zs|hC)uvO5q>#^*Fw9eaJd@
z^_0a?z}{SVrQfs7y$8)^uYQbx-otGfYa>y65xcivt@qu>wwzj30@_7NKTRK`smR^X
zF)8*>P=}Stf*fyFM2xF?3_3xYXgn}hnHcEddgmXPpO~U@T23~&ja!n>nI(1<Bs0tz
zLw}?^xl%N+iZ{;(3USq+{POvX_R90HrsV)?p7ya@7!ZJECrQO$9#1p)(&7>6pEH0i
zWiu%F#q*7fYQYh7x$HsAHZI<9u17#$gdXzLx4z8l`l;8nrw)&I<mZ$Oi^$^hvhXj$
zaG{};_5k%FiBpC-aHvy!JtDH*6UTn^81bX;7lY=!;)dD=P1!bSYy2a_RXbr1yQO4f
zc^8>a<;_gFI_<c=0p-o=OvG*%ojpKR68r0h=BW~bC$EHcji(`+2_6pRJy*%`q_dU*
zeG4@iVjEwe8>LHv=`q+R(UdDUKSk+Xlv>n@+nSnEJg=gB{qe3;%h#144yWz|qlK0y
zvF`C-?lKFqlS3-6zN456WuOfkOLH-1R9BwgihU;(TQ>AmFp3w7o#!37(StvOpoXy@
zH79ZpI742|o46%2A<e@zn$zcIDT}J>#^qmFAVTXk8$GK^T{rT;GgU4C`L*G3tztDT
zFIWQYu4z2~*2EH|i|`ZLp>#iC6R1oC>R9X-dQUb#J+L#qvJs@C8!GJyrfHLWY`Rwo
zKEd4c5SZq;*ySJyn-{>Tt1L6@r9#2}_+{~YyHapTUsFFKKqSD>>&5_I$C07^o-og6
zzq^Zkpp$L(%g1qycQ1X~G-yWb|H6m|um9l)o6s!rCm4Xo8uRWFx_>53$NNPm6I+ze
zi#O=xBKZhCR()h=jAF(BgbT#Uas1M)T4_i9Ujnz3(+IkY(u>YM&-&{dW_?2US}F?^
z6-4FfSUBL7Ib}~-;*{!E+AYC9`F0PUhZPlF;qNPwIKxc*s~hTpsSZ)$YIg9tAYXSf
z8tJA^br_<xjP(Uz#cIpC{0|4QfF@drTVR1m3V;(NehTD4K<QO@T_uc0>piG1<H|UN
z8nr-W_cn9)_R#oO%Rludgu3yr$5v%kVm-F)=uAx}<dnU9AyS@1jQnntga>m*0}DA~
z!8!@k!+V%-_Bb0C!;@<>cKN=(OW>i+HsspHC})?mNb+)BcNuPk^aX+iU+yr0TFNh6
zjNb=3=Y0ihwJw^N)&jUb(0E8mI_{Srg|Zk~jIke=Y>ak{bbkuXCWW>t<t4mj+SF|7
z&&&L1TdT39-bL97$8BwIK-nz9o?E2I#Es*+VdJOK!u4TjX+MSrT^I0L*N_~=p5Q);
zpDv~))cRAW<5EgN0aNfAMpW-uqNbpnm2gfrcqFHp5S5ZWTi7*OK^z0B9v#ioKW`YV
zT+ZojGe^F+dm^c=kveQsSbfnTN@D5PKlzw-x;o!^&un^}|7*-r7fye)vs!8@#96~V
zf8tKJrnF>1HyF)|U7+i@3F2XCEpKxC=X4X1z{cIy{JG4HeAT`B1P8XOU*I5>+<1Ca
z+9`-z$BQ0jYn}(<DQm#@&vJ}fFCii^%mPUXqQOW(%075*WO(Z40#m8Tr<4{SEm=Ev
zEM+6BbL6#I1;F-l1Ke_~cKPmM-Pj5vWexom#WOy2T{d5*cy8s!>TjB`jAV0dp5^b~
zcoQQoTI&mA!c3U77C4O4SlMSDUsl<bm>c>U<O<3q+SKSeFYfYrBij@v`u7({idiJI
z`}G7glxohFW!<W^LWQ~9e3y0>TU;2PgbzQ6H=beVl^S}x8T8R!0m#_M<{jbl<+x$I
zW_W~wn~%7u|JHv~ag;V6ub+iqWO|VWV5L>I7+U+dMJK}P(BbGau<hbFG#e~Qn^3yR
z=k_UFkE*TRjPb4JVuf%<8QAYl3r;GtHRCR-(TBLt!6Fjm6a7}f1r8^cv8!|g37E8i
zWDfOkLL^&$4DkB@vH)jlh%TuBZ2V<$xt2~(GNO$R8o9rteq;xlH04d$0G+&gtK3{q
zwu`I+wp=CWtq`tLnu$}Y`xcdbkB+8w%hHYMwT3*Kd}oiI5^kk<wF7Ka0czHFj5rQT
zuZe*khhL-Zi730KhQy#{K1V3In5Ednu*8DNj75pKzHvc!gKsSzdPCRD9~a}{jTA;_
zZGrlU(+<ShFOKXy+(7zzJxNmCg3Ned482A+uokQZ{a7mnW&CroQ%LjCT5^he8%==0
zwa&z1n+Bfk*zM^^m4U9-ZHI(lB7-JhSUTru<=xnt?{O~4&xYD$T%w?Ym8Ph4!&VpA
zjYXsKa&7&@;CyG*W{RmB2cM8l?+CO|i&TCN<K86XZD0qe#let%Iv37#q`TKYLz)#n
zv$}J=Nb27_`j2y4MZ)q5IekvKQkakI#iaZT+Y48TpEMCuJEIav=*vZ#wZG|Oinu@G
zz6O0(PtxpRDX>fVC@H^NzQWR4n>5MU^mXL5$-Fp&#LBcCpMStYOt+6y|BHXLOiL0=
zh?$R5I_%8I{5PGl@foUEL3kdoh_VLF;xg^2-|AV)%hf-)PMuQ)e7jmJH`d3_5uU`F
zMSNnJWjtbSyX@k#e21k*A2RwTpMpgGme+t>PX>W;|58H8oa0|vMLak4ZFU8^({M2k
zEmZjFWtQf{XnV)IFPnk6kki!)87CgJ0wa{e8IMp|^F5o7Km+gN<y2~WBZB3r*;(p#
zMz{FV@~sn=@r8+Udu4aAJRjDtS@n?jA+n@Dyl+I!WmJj&h<$+Qp`^jKp&Eo|RC1JJ
zVBtH_nDm8wK9;79&>QocXF3i8?#Y*SmGid9*|HGkNo63dmIvQ<@z|+86Xdhl^;C6<
zb|0h?Y`(*E19OFPH()Cp1pmH^hE8FjVM8O`A|yfeH?$I1My9jT8UpnMBc@D7TK>%P
z*_^$Ay^|+jq}4F?Z;`i-a+PC7Z6x7qiJ8%eJ=zFo3Q^I(8fnflWat?}Hn=$TIits0
z1&Omy-DHp1NA0^Z>Q0HM>Mcs@Pdnw~zXsQd;-gB||3-01@j3rw8h|G8nQ!>AcQtJ8
zlad?CJ5`zDA_kZ5yur;&;YA0ByS|0^Hat~jzV)DR34vmCf-K@jh+3P@tu2KKLS+VX
z<H!NTQDO(y=}ki0@a2c_;Z*jzy@FI)E0fa`1|<x(I5w%uo=V$S^aw_-Og6hj#H0q~
z1_U_fxb*lhA%tz(2w)kU2KEMIE4fJZ^Tjez#kwyNHCz)mD$4fBVo5SV1)m+;{p)9q
z<iQq<%~XTp{s9_u9!G~j*z$#8!ioxYW;I&jVFsV;ALNFQ*-y`P+RnPnNsIdK?5Z3l
z2#V7hbMW$#qm5h2Zo>n7J=t}(Dc5If+41jnQC#F{o3mnQw|Fl#$(>Fya?fJA?1{Dc
zdIarlWv6N!r5yCJV8SMgv0u!bl7;&v3r3D}U+CES68cc^$Aao%nRKS*sMOFb#D+_i
zoA<fy-tGsrP?QPIrfoUw!-KSNbi<_1?P7CWWBbF21DX<&fOODx14hD8*;uZ`)i(T%
zK?k5A!b)p{efei8#w*?SouwvJzSuF2;LuLcI62LMGtb%m3zFm`QSPSZqbMrRhu9NR
zaS110ZL{E}R@}|Ba@$&20;$!YFF(%4e~}|hesoKjh3?nQ8|vc~3YFT2z^9<PY=G`^
zJ$PM;XKCD<?-3rDL-H|@oeYOO=PJRWHBV^1PoG#E|8<%|N<G^jrxAI<CaONaOH-Bg
z2lExk5nut!cKM3AbvNo#V}6n4g$@Tp`*l{snv*n&B-?)$WRX9oQP(5pahIL&Cw0>$
zg;<%o8jf2mg^Sji6id6~HlyFq2Rv3Q+SXdF%@KK;{X~==4^v$<`L1}^k$?*yCTV;)
zb)MCo)ehi6Lt4U|-pImWW!FpL^E>B|j~aWF9r`VLm38PJV>lT9!20vhVupY?reW=D
zk}J1sEY3i7s@>E3b<F%QwHV<5y?-SQ`<2SNM0)zK{BS4B=nN*tr)t2jL^kK+I-dh&
zz(=dTkRm2BcRR2sp>h+>>#%}X$GL_~X(`fVThLDgpuw+Ro;NdlbUtlwXIg7;{0Dyd
zrG`}h&me@BM{>C_23tjNQ_r*(YvVdl{c}z`JC93>nWnpxU!X1w%_0h}j@DNBB4X%B
zXV{F|H=FzPWv=<7cau*H301y0$Nus%AA>cylvu*^5(OWavOjbrVN^8K_9^2GA2AbD
z*4KQheXK=5yU2VF8%l1K3R9nF%a9NA>^MWt;HG>83l-9Ww_gMO?uSH<(caEJcElg*
zJaK$))!}``qYRpaB{iXzHi08y3%;k6-hBVb3|87COxolG;yp$LG88B*aTgikrse%E
zoiG@2C!Oj>kg7_HFTqZ*6o|(g5@B{<5`;shOG{wRjxNq_6^5k~H>4Bh;T3Jl7e(Wc
zGV~%z6b3^_puOBO1-jqOTU4TS0>tW|Bjoi>=?_w2zK>5ckx85EPiW*TES%c@>q;~w
zPMgU|VVY43!~mioX3uDTxmAc`x$MRZgV)|_$Fo1unSQ8#e<(OQ(a(`)g4j~C8urHo
zZ`>qF4#(%SY-puy@=J*$K0UJUb1sf+%X-)Mh=xm1Q<81Q3x4kh-x6~L%e>=x9;4@?
zx7d}?|8Hg~QSjzB)=Mvz--5RP!jGK0Uxb}o2v9`HQD9H71F+_ET4k_vwjwk`=j$wZ
zwetq@rGf4s$;UzSNRaa4uV6gX0jd)RJ`&XBvmytguMKKi9W?QrYS#@!Y&ajYmr2U<
zl76Var!}iYdEQ+UlbP1tLS6=t+DO=awKSEP#^Hp`r1L&Ge&eT27-+9BU)D`ie?}zA
zk8k{*Q1tPLXjPQ7#OTh_leW+qkbNI2#yG%7JQY8NDYfuyK_`wwd`|W|n1~3gYQAI-
z1jmjZWXfNV9ZqiTry~;>Q#fVninyzr{?%MEoQa_bhKbI$wo0oNuU&1?@T$ayJf&Q>
z?SioLXF0tZQ0$v#u6$Ar=7(PROg26N*dHb#d_q{r{9hli>`8sCXJ50Qb)8}apB85?
zW@r^GO-42#1(wFJRGm;oDQENFS3+s7Dk#kbrECzk5TG>IhzR5w?UMd@pEd9iiu9xi
zT(s``L+Pe5BXB*G$$IyX{DR4{Ox+DeqG&yD1_>{0Z*6VC)~tD<K+dHyq@nv>C4oC|
zC4o1ud56r%_z|Jik|oNE7ZK^q&ZbNVe$sbV$t)wCw~hHe5DT<V%hDB)&Ts)0yi)H8
zM9&-Ra)Q-^?M#3<{h0X(Td+rbJ^fji)e2#fVw4)kIhFn~7nZp-%^WH|CEvUs+~$=O
zQS(G-GPXk}pL`7oU$&!}HpaS!J$(6ogJh>w*pADhvQB<w9xVP9posA^K{Q@*shHkV
zMabhvs;!@`mcGT~?cY*ZOnX>*1v)%5Q=5$|NtUS`TFsa3L^7NFY+=g49iUeqT#i4j
zPJD&lra<UI=>}#X=nXs$>OM4MmGBzC;PE?c2{=7(*}R~nS%(637T^P(o<~^U4XFKX
zzD#Vs^ul2Y?h;R38HzkNi1<F;9dEw9ZoVxTzb?3*-z5Gc&^GUidAgv0)FW*5i#Fsg
zgLSKv758l}HG9Qg0oopLWI>{h1zvyjAd+OlGf`C1Y2}hdkua@NJ?jM(EeOIpo}rby
zGnJAo^C{~X9vx@Fs{RDF9^ni52TO1|e%JQQjM6KQ3sT59g5$PvdkPEwnqEU}(Ns4t
z5He0Du{|DGx*^6@a@?;>8w|wOW(xg5DfEY<GTEM3<Wut`2{C<W(Jd^8xVc}=r%3?;
zEvl?XT)5T{cAW{3L~pPGTDSr0)Nka^*42ZPqU8u;VC#2ok!yk)@)ar=gnBx<o*c-Q
zPO3=N+~t9j{)daz&WRN>{{8&rkp9QK>q6FbPcZ8T3h%w|{|L6vP!Md%Z(^x&*!QyQ
zL9@nZArLb4232ME0awjqdhTQT=41Az^?BgSNZ^0C-#=zAbMxiE^}PL}{Z#mQWlH$*
zk22&Rxkm`;C&Xp+eZ)3}LTD_+7aeaR?o3vBB`|jkiY8_G`2g&Wc{8>08(UrMhRy*4
zPy75wyOOWXQfcF4_ybXIVct^sSTH~1>aJ==!k-L|XH@_?$V&OJ`dsOnANE#ZYjr$L
z>3Z=YY*7edwIl^`t?g8RulFWy(&9mMc{n2uSk!_`1xC8M;Ydn@wIRPv4H2mHRh2zD
z#p)MfF&s<?d*N^$3^jw_`|Md37UEd+zBg`G?%o5T>V!jXJD=NJ^kZAg!eU6`R#~cs
zv0$1ebxU*wsJ_yfpR19aJfnG*56{DZuPprEu2#!C%x#jn@B8%vvwXlbrL0d|p;)k9
zC+fMYJi`0*%HBu$ku05uW$Gmkt=kdZuTbqM1HK7Pu>i0HuSDthD|((PD1DCd2L=X2
zZY?3>hwj&zE|~KBQc&J;XLjqZ=c(uNIbJ#9Bir3ddCHZ^ez}@D0*UnuvDu%H(i=?n
zXs!B6+QrdiMJq)2d3@x_^RTc{om=luR;VQzSo+AfW;|R%A_T%23?Od?<i0J9McmI!
z2w5ht-hJZu75F-zHh26^&yMhq=J%QqiY>0}-lC`!KLpvqsp16}I0q522;mHnz>a48
z+LNaZUr2Fv=3MxhgP3=K54Je`o9z{83T~`B<}+@#hK=bzYdhJI?J`lE$TNly<Tlr=
z9G%w{Tez>p*I@-dGTR<#xgX3iU!30J=*!nIJ$Df-Y_QKCEZXzm$ETVMMNe43ZIxFL
z(CAfnKb<&}v34Hv_zm#bxkIig->wfu-X5XI?0M6YgRc<iKi&0iZ*Mo`zMgHqu5Thh
zc}|`+@5AhW+$hW4&J<3&%QckmZiR2X<bmu$OUf3v4@U>n_0<(Tyk)hk%$cf<-GQuo
zhN&;u_&S#CTE+0qeqlkZ)wZ#I(K-}PG2YJH?a<<~yl-)+fQ!}Qych_y_vDNK)wsu=
zh7AGdx88d)Db-Q?4zK~#--T$T1y^8OtCGeOnOP?sOjT5zMKr`Gd4G+h6-S8LzuRN1
zO63||r7RIFqhtma;K}4TU)I2ph3N$`=lK1!g)rdR9oAcC5PB~;yK`a+<M2^-9C8er
zInrkreeH1e&>$pSyw-C3dco5MTDGrv79pfQYQvi^Fi)%ew45$qfZT)M3ME7XA%}qw
z3CgGG!iy)U1EOp_cV9ktpM$#3kB*M2J1+R$Pv)UC@OIB%!nYl%t{v8YFra)8G#R%r
z;nATp*4CmF)`n~0(S__~_&fYj)|BT`i<3&IH5qM|R{If}kw?4gM^V+sI>wty@-iDO
zPYPqctx&<CU``|`FSHm6k!J?&hkPabQ@+2WW5PM*l(^E}*!0w!Z^AHh#B>zC*g2oY
z|MPRKI5Hg_s(QX$K?O^iB)3Q0Gxw1!Lp3>jJ7H~*EqbI%nZsC)+zXFpUT{1tj&fXG
zBkQS|g4nlf<bM2$D@h*<(<5!SVYMJzlc?}5Lje!&1@aG3CkU0G&;E<HImC99I0f}y
zBipgUtMm1Mvj>TgZ0A1#CwzgJ+QJ*)<`(}4&%lR{jr(dtXu7Cg>IOHpK-0urF2wEa
z?|{h50Mwo=-?l|wA}_tCd|6JU0{<N!FtE!C7^r!9-hAPV2&u<ZjpF7@EiXE$5CZ+0
z^RrkKX0h>YzJIeIX&~{O<L$R8bI=$oF_}9{bNh}YXHN8aUFNs!hxg(6)9Wcob`nI0
zPFF<4))}3oOA^`qigWO#_)eNTR8{n{PKIoo`$rDk_}K0fB52GEcw+$Efvq#-UbOG7
zO*c|V(NxhKiT2J1KPt=YdajN{pC%SW)5NO)qqGW%qJw{B<2i&xb>ZMzhn+Mrf{*dj
z@P5fwtF+o1oaufFQOd4hy0dgEPgyRVJ{W9>_R5vThVCNN^qNk_<O0n$aY;c;Iz8&{
zg^&53@$M1fGT7%6!{K?9UZ4j<5)3ylFXSyKjvmmDmorT=mBqJvp6fW}*||#&rN+lH
zH|~lFd;SjTM_#VG-!DL^4mZCMPrs2dW5^9!=U;;~9%pgq&DY#E=q3-d7M#v;m=W$O
zbHId_E*v|*p^k3(Qn+w9Sbj_E<Y+BGvq&-R76%8PF4Hy!*9!lL7#=}VCRi11&UGn^
zeyES$qMy?&L)Lqm2B}wpTkOC&+n^(Rj!n}MD8`ot_f;@p7HLl<PtGYJh19jp<p*^U
zy~}~9qKwIm&ijH&!CWz_h<8G0IR$w(ofsZ=ob-u{%%Z{XWI4>!T^S5iP)XBB4HNSs
zi(sq!;2JSLv0+KCLz+P2PX3bPT3j4cN60bfp@MvG^Ybe)BfNy#*!=pXGW(LEKMBCI
z%vAF)4aSulW0Q}^oRe+*?6@!{{2>Y8tAn8-_a#H5Ev&aIEMJ%hXmW5s7=rdyP)<BM
z@YWGB(E-hzKWqH<7wddIp`}Q!&vmTvi+<0&zOv8k553))nVA&Q8$sR+^Ixp=EUBlm
zS=ejNhrVK=+|#<pOuPkj94mD&+_Q*Msx35MDv)!mFXSFv<p^ULnD2M9WHw1+zaz#C
zMgYwi@di+qgUsb+W!Sff_^D))qeGq9rV>8!K)y4Yr<=(1;zWM0h(3)D?MvVl61U@3
z0H(EaJBB5EAs(~Yu_43M9F--<8zCF6CmFLLsm6^hIi!RmP5C~cfoaE!JvLbXK?d_<
zWEr}7V+}2)x~?KHEyl5?q`tX6qc!8V`KqphC13XbHF5T9)?~nB!lad8|3Rf&oENhC
z+AfI!VRclWI(MP?M1jUcxe1pOU6wp3it~tQj#vT9{I-M_638W7d5jZp$thf~lP;U1
zr6VCtn8sy(kJ$`n-aM?WJz|-j#o(Dn<nB*k%kFcNo+Dnt;p|@(30*mpuz!rwv6v2J
z>l=3XBR!tFCwGTKOv-zob=v(~B%T#r*$Zma&ufPp{txR_QnNx2Yqu|lB9y(?*ViQ?
zug7S|kJX-Cr;ac2J=f|Y_v-%&pf>jy*K?oY&pCA~b{CzulL5W|{=?!-2cI~{8~J~5
zPHg0yC&c*S^#D#Y;9VuA=-;F}E__$f{M3Yt9pjT{FV;&7%6uQnZM!RYB6be{_Wa)&
z!`L~p;W};tHr9x0p|tg}Z(;KsG%q3V9<jc^V8hNMGf97jqc&#g9*z>1mNu>lBG1#;
zt@^WN^F|$;$%%8IC{m(Lv#@tlox$TTF`-ai<_Uv4022X6#9pZ?i=(9xR}e>+Q@4Gu
z`!cCOMY~8uEI}XEK@qEAB28XKpwlN=8ilkaHlZk(W?PFe??5zWb7VLil3DAUY3b-#
zMLuZn9Bo7YGjBH`NG34n+U>Pek1P3SGy?0v(&PXG67fR#>Z5JS7>yft4)jz54XgK`
z^v{+?PqV2Ml$4vUQ$o;#2B3{M$OGKpaZBM_=%;}uHn-vsnyhpFbu={r_Z7x}`w6*s
z;IHnWTJO5_zijg$CnNip(xF|@*c&MD*^$+EW$fP>6oJdmTWCLIoa^RQ^d9d7j}XQ4
zWxmVv<&ISV<jgBdzfgWG-Twjo*Ce*E`p}7wK#FqX0!*mylkjbSa5?=gPPAIXu5A_?
z{fcDb0{V|K<f()j%5^TwkMi*u&Zvzz_+4L{c@hf8N82^vn7&3ho55&HP8_8Y)0*EB
zKG~;HLeXRokK1HS_uz2xl-Y&f)%0#TpddDjMGkf#BuXy;PwJp73_;1a95|~H)_=c1
zj^N=hIpNNWlt++oJ=1Taw|blh+mswv-slCW9$*-QONOIEtwm}2gq%r5hIs3PZ)3NV
zgOyPT<yS09-t&{5Ew*<Hp<Ni#Q@K!Q;J6)_kdMI5bPZ9opD*^fmHCAw1U_6s){o~(
z0&jT&Z=;p{c3h!HE&{KxAbs&X8^~LDxql^<!wyd#N42|epe4egXQcmDFjBx#WWbR@
zNB6~PH)b!A@KrF#vFG()`S7ogS1(cOg51{xuFmCn1gE~nju?Z(*UkweFM0pY{l~cv
z_4-pn=HFh{MH19_$@0(_x(?mPdh?B=yS?F0^)Os71PNl;1OweCV%nzW)vixsl(cS-
zLf@w8zNt35(FzhFP9iCNG;v6GeMd)1kM->Xy*D3pNy|3k;PV`>>hQa41YrMHHgo(8
z7WR$|P83}2JvKCn^bYht;^;+kqIp^>aIF-3F<;_-&n7%(5k`yA#hA?@5DanC^y|c`
z6PlEsBS`;*OKFOuvrP%rGowAJ_NHuXU(l+U9aO2<GO2jC8gjUNPmHbg2QJyYNY0a=
z!7iVCQ~RQ(uKp`fWxRWUPa)axnnc2#x?q<D5bJ(uix>1{e;i#K5boB=DgW1Zbp_<m
zwcXtF8gJaYIfODY6`yMi3o#G5H1PLmVTTf8>`qr%JrfIJ+9KoW<LYA_?uP?wO$I0a
zhX{V$VZ)Ug&sNph-0FqHZG#GBk+zlV<sardrI^I~6oQL}f48FEv1P#k^E6fx#8q|G
zv4{VxVB%}jRZyi%vy1EWakVnUzrEzN7NAKIe>H6Uv!(i(tLA+YHGPo8o^0uLu5F&0
z3Sx4wMCCZ!594)YHOb%@Hc2FNATLW<bskv(nQZtzz+lR~V&a~ve8)~M62a_OPT^sX
zrb<m8f<c<iLYSd-zbdSuSo`dK$()vt9xqNujBNvD-ML!BCpTj`=Bl!L4D_^p6H1GB
zA|=4TKVf8ohLMc!A0blIPJB3~Psn)2E^F7tzHKbMM7IIN<y(w&$WJivg`aRH5i2I?
zVn`5pYp!^-<556l9jn%N?tUrX3mop%wAbB~Fx=3pkgZ9&L`h<|&gXs~fEjm0<3H}(
ze*RO2W8sE&_@xq<&K@5&ij5LWCM!M{Mpwv;ZSWnAi&!JJu@%>YV31mWR17;*AB{0J
zY%fW2ntIM+o?SD7;r{mmNs$Uoh{}GPEn8SGl}U`f=28)sFu6Giy^SmFva>rz932u7
zX4V@~IXf(SaQlr~no}XSzJGol3j~+z-7w#5koj^%$d&AZH^oj5B6dH{XV-8nR<bJj
z4192%$z{Y~LU1EUb74EDriuJf`(fU-W%o0lHW_qB&R7qsjE9%$%mC}0un3OSBI(<~
z+K557p90fqHM{+j<iAt2L=Mp$_WP&sk8*l42vz-q57O_MU1z@H(P0+UY!f1~@2bd`
z{Sj=2x8=H}|3JX|7To_e?~ApAuvkbm+-R@27LAEgI{uEM>I6U#o5qZjimbGKlo$JM
zzSjb+YQN#tf_h=$aGzV^ojq;u5;a+8IdP;IgPRd&#U)K>B(YdBF@oZ7-yDOi&)oz-
z01ksBQ9`VJU`m#vmh5+^KWa1#QMnENmUY5n9j@5av=e62d#+(TaiSWTv>-)CR(H>j
ztr76m!6<?{^?B#{z07t?@9o_in@T_8Z3=Cg*A_kjC2+TQ0nl!P^+Ujs<>u?a+fypl
zm5clDg%9w{#iOuTSj6QKR<1-UdXkhDg;uR_>|=de!uUZWg>Lk>R>TiDw0b`fj=yK+
zY-sPt5OX=dyBmhJmnJYKue~Ky18$wEla;8&RjhDD#p5t&v*SKaaH1BwU~BHJ8JDVl
z)8>r*c{XD+q_ERlZ(%MBuo3Rpj8-c*G>8+YC%9x)mAZQ3Q0<<l_DaaJyTK-k&O0P0
zNal*fO`4>w|1F81?o7uf7hc3{xy?zxN{y>k`cZ+DxahO#mwhqG!P>?QTfmyMVW8;(
zm0sX|lKZ1yC8usxrg+OTK^{i$U;Y(4`k!+jmioH8Ij;O5ybIl^P*Bc1y(&G)a#{7E
zoff-gJ!7Mf6?;VRQead{658?0hX=mRD8F2-U+(#AonZIz75^a|LXgFjfcH;}WcH%y
zno8ta>LytUi8;tiYp$2PMbJVrow0j#>rpBjWeVHkO`QV6jbOx*pqY`>rN`8OmE<Cv
zZ%{daqSPjFctDBDZikGpcrh)+p9A6~3adnGgr4t4Gm=azi`%1QKClg;5|qXTZow4U
zNFE`KzBe({VJc0)76QTo<mu^>(<6%{kBQ{M*=h!vi8Kvpljv%x6gWarhgC<a3AJkr
z>dkbcZ`u*b3X(GvlKTX|hu+MiAv53}ft6L7`x^7<gl2c7hTw>FF;y@-x%Kx00b-#S
zD+@0^{d%s&c;Ce$Z{;yUX#MF~)JDXkXY<hNZBO4fhj%fE)lY<}YXgfVG~|R599i3W
zGX@D!<)LTeE}U;G-iT|uNBx29mucVe5T)zGS~5R1bOhsb`L;Pz9Ehf=?V6oDzmd_J
zt50~8=I6&>9dsg>{S2l5DPT`cTR8|zK<G_6+lq)JO3*E8?98f1B|6NgVf)z{UD;H(
ztg>uk*qw}?06iy@ZS>U)Ui2qdTZFX471fKySd2l3MVJAm^Z`#BRSee$od-3*7aRpu
ztfB)`{I;_nq}={6w8r#*_+|yCW~&N~f~2bn*)b_NNX7<hQ0<dYKX|tmf564&%1e$q
zuL_WPa-@lA@gAIDw}-mll=vhV3Hy)4_4}jR)xJU#>t9E8H)I7_o@GV~W-PTvy4YbI
zJiv29hKO)@`ykkOF%zF(&;8&U<8EIQQn3-PP$Op{>>!YXKiK^KA*nSC+QRzDUF}@H
zu~SsTz?d73BFzql=C5|6o1)$}#aQ62K*D#k_vYn#rPG<`!<liM9L}-=aX=xsQgzXP
z+&@I}sTZIZunw~+r4{eUV8CuO)T%HsgzAK;hHr7PWla43UlxE0L7kYbG7N5p*w9Rj
z7!VXWkr%0^vRJQL8X{Q;Nd7se{|z~VuMtp`Ct4?IyezKC=!~XGizw56_8C2#E`-W_
zy|bK7^T?SUf9Qmc6HA}jWkx`3wfDT#GVufI=@lzxB)qB(YFL~WwX0=uqz5ju{tVF{
z+%V#SR+5#6*#R7tQ3+FwZ-VexHaf*36lgLW420q=3%fu%*~alco)E&TiWxqoiK2j!
za`pgHt<#paQy(~uma6RZiTr!~prX*L>tN_Uw|OFE_u+caQyo(IN+`hZUSOCX(H)T?
zJi_}X=GdATGsXgZx4QP3%b|+)_fazwMBEFRuHr*7o1*z(KRzqJxsh8kXEiqSt_Gda
zyS^%6?^L*-Tyj>NYCwQoiD(?RL3q6xk)0xmrj`!57aDfLCq`RLBzUt4J>J_Y6)id>
zQ-lR-815lGS!(-w=>Q4=hQwt0EM06a&kg3(d=f)KJ-W~M-`w8m(4i;G!71e9Or#G{
zMf?c4{q@f5V`g5#1fmuv85J&u_Kj_Q!47zhiioQD=LfvP4Qp!oc`kMvZwG;b1PdGZ
zV7Mz4x;T@WP!;#DMf}nlm}5+2s#RsRUWsO(fj(UeHjigR1%Ys<K6eeYZdP+$0h(ii
zFh}#QJvXt>`g}7)Q<NiaIM5X~uefVv2(+2Kn7G{8QnT1P5d}KAa|NCYNf-MXI$G4N
zykA`Wp4+CbKmS`g*vi_7%Xqpey0~6#BpHtr!#3|5J{p%|m`sP)3_;<D*sOd8@o@A!
z+wU@s-Cr{iT%#mmCK2)PF>KLoB?DgT#7Gb;G4+3=bCQH}nD`TUGD~UNBLmMN;%KZZ
zqp{`^TTYt(@F9vW9-N`^dt3c&vMvP4`aD8W!x%rLXAC3CztqXPKN=1_M<0a;pk^(J
zsc5L~HQ=|AaLvtkIwy)E?0&BlmD<N<82oZQi${%)Cy&CXGp(6R{JvMx3x;3Yw@D=n
znOvffP@~2>?98qlDNly-=U<At6G2!l#o{V2!>UT5B_%iuRQRvzP2(*>ii4gDU$e|m
zL|b0Z4+EV889$MmLyMzC`InOs;cMl9ZE`xXV57S*NHw{xQP{}uv}Ka6?68F(Wyu}G
zFtd8gF$-{Ia3n5QJ{`xk1cujq90-_AAAfb`6@ETdT<fIP`|D3s8T$9oAm;)_po(+4
zRm4n8C7FqiFK=m|M%4DS{;&9%{%UV0jD6i(f^A~p^i#%8v`5Cl&)`v#fj;Q5CVVFq
zN#}R-X6jn=DpdmrbZOj4<Fw23QP}uHJ0uF>y<0T8)M*M4TT(xt=1h#Zf|wXp$YLsy
z3;5DMEXLm)R($!PLH!<fnmuk7XBhU8gv>VT|03#~qATs1XuV_Gwr$(CZ9D1MNyoO`
zv5k&xcRIFh=cK>$pK)&Y-L6rqR;_wxJrlF$79-u-={`h37<m%UFPc#Ei~QN4y9287
zd*e}7qK>5Z45aO28vs0R)P@gqjhJms371KQ2C!|-lzjvKaitT5_x+^|axT+tr~K&i
zW#)~6)Jf}`=y9XD>(=wkUeo&!SR0LUS>q(iq!GBJVB(zgOTk$w_V1vT5^eR+=pu(x
z3umVFQB_CX;iyF6PQMVOTyzCfE*@uJbh@TnZmmqOaS7m(VO=&PrLf_riXmM5T-`76
z0n3^qbqHz@S6T$b2hx}&qGK%-BoI=-8HjNM7fbbO^aS^!4JX)uNQtwi;)x(zxFoDM
z6}Tj&jW}c}q2+o=g0i`A{b)|QX>w$QzNU`4s8?<`W%;N^3xn8#xIXzWR7|ca!~18P
z!65NaYUi1vpM;Vuvi*Wrv<c*v$>CE-sv&I0BGr9tk!m*@jB?$osEXF*>_p%duD?7E
zBB*}>Y%8GNBnS;h0x+tKrlK@KV68zrn+v^i&o1)tB<T0If4N8&dDbfMJ<%-Czqb98
zN-+(bZQfiOynSpjXb>#Fj$X>+0PS@s=T~5jN7;A_DYc}})4R`_0Bik8(>Ul!<y4}v
zY*aE?k+FH0vxbS;Wf;;db_%IIRvp}RwkV7iiD~<b$&^4XW(H<QES@YDs*NX%gA@6a
zLR56J4<(R_SRbl-85bP(Osh7iH^eA(i3mt`<Zj=lNIeXd6(6YABRZ2+sHWH055ce1
zehM`pu>P}aqLLa>j#6WZODCOtPc(vE2}Q2EOEf`AtRV<UIe|DxHAoH|wY5f?96e($
z%Bc|$S}8<C2j%jGYlI8~L<KwkP#DQlGFe8lB2Ij6yQn>YO}(#OvWU#CWC-a91&0n}
zh3RHtUGRfRT?2jS)0O^>_wEA|*cJ6s<SWz?lvAUu+*RVWB3|1RcR0<l%E1<f!)Uy3
z1m(M3kAw5u*Sq>Gz4GILK8x<l7e=adTWLddx*iNM!lL5F5o3}_GlV8uY#`(nA2u_P
z0kx&Bo5(MVk`ygzstb)(aVpV-Wo!-gTC~K1O)|<H$7Z8nB!tuOqz4{{PX37oBUFgE
zy25Cv8CYq}mBos9)+~cLo1;de4xy>`$B?V+QpV^*6rF+QZt#`xJ2l3sHO+aKJwQ36
zBNI<wB_pTxeN+NG-Pi#3L!g|q*(vIE*j`1Hr68d(stv~WcdRs!HWn!ni9^DjnV>8g
zp>pV8C5pkCl12^j!9!$vqFb}%^@vR7RZsghGO~zlIdC}>&2>K|Yt)vN-r#^`N_?Tv
zm5RCzB{eNc%=)Jg>Yz#xGK`-211YhffpQ_8K$kEuvwqk(!We3eO)oQ;UXkzHwRUgU
zf6;IoaZcPG=g>p{FM=CaK@1o>c~Uj%%m6p2->dLYX2+*q&)*G;=)^knbT`)0Je^53
zQc)=MU={F*)GjR1DDi#EESh9+H2aMr={V4DZW*lvT<8N&@RE2~<-y@d)+!;2G^tEh
zT+3$j=Qi<y5MVr9@lgm^OfVx%M@LM2c`D=2C`MdEwz`AyFe#O`Q|#o2Dj^>e-gysL
z_;m7UiQ7LwLaOQFQrN2IXb~%A(Td=btmWbC<FL$)36KVPNj=5DLf@UmQvvLCv3DFB
z8wIJssPV0}9VMs+>r4P`pMMQ%sZ?-h2vl5mLR#HTI_@HEl!<k)=EInXRV2pqFCCQ)
z)l)UK31-bjyxv?zrC-;gEs`0Ivc!d`M-C(dVs=^6Fqj4^j)VXn8Cs2OL!hwlWt#Gl
zcLqu)sDBqJ>@~@ipG9>R82mt2-LyxDws-LhFq@qHQ)F;3HjLsOS%0?WT|eqQ<4^>M
z&LH@2fE?&hKuKNt+p4A@dfu853Jg}0`F)v}__!w(IF=c%sxDRLT(nq82nNiEdf5{8
zjZ=d$alL+#BDS20=D{)qcDQ&Te-Qz$b3i4bryxzh63|bP7DEX!V<14)GAz`wL|_m+
zd_6xYLKh3i2zH#=wrkbRsBbCtQX-{jAe%~=h-e)pWjdAyZBT?6Si5Gnp?PNHnxs(>
znx?3~cv+&<r>dGNp$p0BzRc_Zt$Il>VZ0d`YG%2IWocOJVh{&DU1(VZHY|m3XfCZo
z5x`PJ6w`r}IhCy|fD(TF9ntnG^{=@=Szps<Nf724<n&f&s!I4MO|`*D2Wnm30c0~f
z_qKVU@|FT}9KpA?s$27Yl;QVY-sgO$qBIqaQ+PS%EUP+`L|p(q+oACAB@75*BN$lW
zYIj8*ojC_e_^u06_3|?H&R3-qYYm>sl7}p&t`N2^HZg8UC^+^nM+oo;dGT^sb#RLI
z2;_3366FA;bX7{_N)S|_qGKec*;m9$Hr}itwowzevZa8QOQX)4V37_ESY?_as{AUY
zfWLT}Fm}*``LBdc{M)C1!!hq|R%>jk?dPvMMd`-O5WzWJhH+C=Xb1&*!UL!f!$5FF
zG4QP7v0~#asK$Y~VpZOgx>49jHTw5{J~n~#W#$IedQC;?GI50<4vWsrsqMWY5A`A(
zJF|rDKy?MQW_dXFAfXWa2r&>n254cT@P-;;MHf?8vaF7NTR{(EqyuwdVt5&sj~m>w
zp_HD=cAU2s9S5)IuSn!H)PE0i^xCfj_gh1>i2-U@1$Oy5sL<$?4WQb?^+@q$Q3x%V
zXImrYAT2VbMQ59z^I<=^FP0$FG~NHKR7_d|SI^<|+2lf_yB<(j2$>*F86K_;NXIwT
z3#TY+IhwGd1<lsYBf?mf%{CL(beJDH)o!y_IXbd!FmvVR$T>IEUBH$7R1)s3Gu9$n
zR66Jy4#MqfkiUaTOb#p_SJMpyugMFz!Q5klO^;>7@1$aH%7+FE9b2U397chY5h~-T
zn3ct)WDxDRjVJL;X*QfjjM5hyPNKBlG-5RC+ef#824nZSBqX^hsY}+BU0JVP7cDqi
zLv-UZ7|sG8kin!E{5iKF6Hpjp#-%T;ek-XIuL&Z~aJ>hM;b8oEE`jPsU6<x%vGGe5
zKKzOZ@V@=Dd0+CX^Ih+jORkZe6?DFD+o=Att+!m~DYZ;OBo(w^0F%*>d4Tb|#@#Qb
z9`{Crb5`fVwZc2}m<Dw0)sgVwNJ%5S>Ko>8G>9TI^dNodVZeZCaf-4;dXSI^cI=^>
zhB^c!y>1bpQUu+y`S6uGjf<L;C{x|08bM3U7IS79Lfb&?ER%9QgqG6>7|eDWy7w@_
z1A4^b-~|x#{u+b4DXJis&w!|QpjpP_A6^NP$_Bd1hT7&SN-jH+9&1)nA|0ci{h{@)
z*IR`u-HmTj{6`0fLV6bQ<cl3UIz0qi5!$PpcQ=z){3k4Qw2rdgp<@00<$li<u!m=E
zpG*OBIM(df%;ws#cB}r9k;$aRh0EsInar~Y>Ov}@*-Ek^l7N$7cu-Z!##$J1R5&HO
z_!L47RN0@605quI%~E;0wtW#w;28;3t+=cJx+#4T9Jx3o0FG7O6gr`hFq=9Ns{4`e
z=-eXqGu?%Mrty*MY4z!KZ}ZH3>h1LRTh;GxJXUSvmPHlQVY&-;e!NtXCr%;hfUq;Z
zeR0Fgp(5QOnox52I`~G21=8<;Y-yvpKNORCpgt#^cw2pI)XzJM!c>5*hw85ri~X(n
zJ&aF6%HOz7fE}bfWuGgB4^ByT;hkbq!JHJ<krBAILS0)5J|g5mmk25e+4eV1YoI*^
zgv+|3h$JfRQr|@@X_T0!Ai)wjaXv{RxqEm|p1_|Ms0$lbO&8GS%%id|gwTA&%k!fI
z2Pm#eZ5{X>S>wlrl@e77>hgs7%~j}KUZ8+d2~V<I?)n_c>qo8){xHGuwIfPMIN1m;
zbLa^ZXVrTwHZN{+n;@PO$kkt!6erS(yj$eNxem#cmZ+0EQ?wHoX3p+NIpP&!F03l1
zz%dD_DHAiZ<gUGV^z8{mjppq}aL5tpD@)U=71lk{H{1m*Dqwb_<dAepK7XU>9Kz#U
zQBxP`Ef!GlYbfc5kbl)hpTZv6g9hLr&g$v+pI<h<srT0afQ}r!hcL%HzItw}zg|jT
z@@A2012_Y&!_)A$-c$tqJY~|pw<&DlFh8o(PYvjG0P)?!TxNy1r*rD8w?0sT7)wY6
zIggYOuoAE*Qg0PiK?&%>>V2hxYa8;+MLCA%f)3SlnCuyjUg>?i)q43^1=#+9@lYq3
zP<?X?BrFzZW>-i#HSXpjrg)q+H8c|3HUOfZ65s(f_&2C_OOimgym?Mfxc0dV8!jLU
zXa2Ova;)*_a)zb>Fy_(qvNwA_3hmZ&x24W4?s3{YJ~dk=f6VOySsFhMBv24V+OzFY
zyLp6R?aU7gqFlivSqw2qqZ)?8GvgD=Gyc3?UXt#VZ4;-WC`zM(%sH#jIY}L!l4iS1
zVWS;$%_oE=7jZ^AIBMzu6>OL~&)*7N;_|}_HyZyDwAFvLi;<zABq-7u^jleS5-D%^
ze-V4iB_N3OzP}79b76Q@IY5Qwfz2Svpa!Q0KOX}tMX^oUpHS*7y668WtiMKLWw!r7
zi;Ee~X5PuEP7sf(Do`Pws;Z-l1WzxMqT=I|4TCONSpY{Byg)5_7o1UN2G6PCiZG<#
zZ|jhct`N^4tkXLHiC#iOth2j|6&@(js^!)*={$TmvIx5W8z<R&;ljCPPJyoZm=_y`
z1V&7v12yXcnm5U808?b=>f|j4lS#SrUe#$??4BvMXNyAQl17BR)JB9HY)_ovc410-
z!d@YP<02F*@A1Ok2+gk)&j==)YQxH3z5h3k$B$wsdu)2+K^QT-03Y1ue!QX3bbelb
zCznf%l1MQZW0R-qHFiFrdKLen<EbLqfu~+?BzEiJ=(92H6X7u2H~YbPT@9D3pM*c=
z=J(Z$x1jV7HW4($V?C%q>`HyMx3ciW2uz8rT?)fyLyB#&KMVy-Hbj&m7h-^Fb84<W
z+_(`#KhR{ql!o~b2m#nUC*ip|GQX<qLghPGEHf?xVr-Ex?urXk@%}Pjkb(<nBLH59
zr65K@eLTFiM@Q~`@I-K7aPyr9br_!7_d?`0TTc``|Eo{_%_Z0R=4fc#R|~BXsi_e0
zD5gq$&G%Zy1m-quXVfa%h3TcO!tBu92&qL+%9a$oCU<<HXX_DFsUnS}xnnR__H~)_
zj1Y-+gwbhYv;_r~47LRL;!wn}8uc&Cp@i{OC@!w~sfc90ZtcGn1)3zcpOotpv7#5U
zxbR)Yq`4#(GA;A;xB;(tj%jKr7m;-K`nbIYFINb9_X}7uwL58C@Pxd(WW!G%_ggZ+
zC8kV(MVCcxs}$^s?$2J`PpphW+e*Hrf#y%6vd9#S$yaA9s<N;mPOz{xZSK?FE?vbi
zHt@j3laT^t&Srqv%zhr5R)OLB-<IQNbWujKkxClfe8RwmCF5YaL-!8gg?Z#?hO-TA
z*apmGN_xZd1_MgX&qAUHyEx0Z<L!r|yT`qb&cNO{f6+PUH8l-Ut^Q+>LE$IZUzkrs
zQt0)+he=x~DC@V%w|cMkTk%+3GldHHX&C3{chA(1Bxf;?#iWMYsvY|<gB#Zee&O`M
znNQd$*WFJ@zN{5dkp>QSDMD3I(+D!OPH49xt7q1IfVzuLFN{mgAy1t$DbLA|EfO)H
zmw7>N1BK)@{;Ts0WZhT3{&}S+q8n;_=*Dx$RzEb0j<=hlfUk4GLjr@e4_U#W)f><I
zhb%j^#`*=PBx$tGQBc^}0vP$2h4|u0Qk~!Xq@gpMF9%hnj~T6b#sDPvzf+Y^TJ^*t
zaOM9*c!tPpD8U6(N^AoM9<Ax-67UUKLZjq}m7J4uGz9Ozz5vm>B2qTVUZ(2}>@pD=
zc@I8@!|Q+0hrd5NOblghO;>ag`tNW>NV_5^W&G_~YxEM3C$W%jLa{62A$!GpjoCjZ
zcsljRPb``nU>#4E(n|!}soV%iz$TsQhmTw=?$p3h3bW8Mt|-E1kU#M<MF+WK2FoOE
z@L?@bIMOVc<B91Nlvb@Sm~t>Zfd3ovh)t+vC{^=3{dH+0a3c^+qM!4>Fn#$7^!-R2
zb&UK`PJ=UOsh1mg$+88u?^54UO__d}Joe6+RYzA`hiykuxknf-nP%k*RZtkth#m9O
zAt>^uD+MDuW>3O$%}|u5FMNT7z40RC*mXXj<-|2~H;Az;VJ&5q%5{eqgvIWU8Z(gM
zYK>LzkC+9vX5H{RIkPkQw$7oADOO~n<y-dK+D;nonxhV<4Z7XeyUD)Fnc(1=j}}t?
zr?v6Z;4)D~KnA)&B_#HU>>4bKbT5=GxrKNC{yoow&au4T8S#>lI2cA#vDb~fG_^XP
zu`(uwiMnGP`>qxPiJDt@r|EevZ^NuTD|CQJ#6B&76{Zjg#osU?@f*~Imnc7ZE&j%i
zo4Psnb`ZP|aLG$bNb{zPTAzvUbUM6FBa?Vm#1-@yjEemhXm3d@@mE6UNkQh6s?hV%
zcYyZd4NpEA5f*NV^cA`<Fk~<vPSaLUf>vcl;w}}HhyI)~V-!|z@5}enLI2rI(?Z8v
zxLiX`C5iPLOFIc`!U+kE{BCas6>F(RoSKo5?e%CMB4!5tVdp`KLcQ50$daN7rPk(6
zaIjNnsaZ2FRY`@8zGX1C!vh*Da_vZHd+Ixz?%<{g^62sR!^R1!G*geHIM<N__FB#B
zP}-Rwc)4CjxJ7%C?4#N`$j;ru5~$N@U68v#cdQH5#}4Z@5ic#N@+QDE9(SOGQix&a
zdj;}sRB>A@hop_`BMK|S{21x8%+^TQ?|B*&xCuyns_S#Q?|ME^@~*drkQmr6^;3gh
z!*&7vB>JxJMgA`~C}4O-M=CSa41;{$`7u1&S)yc?dG5AyT1faHpokog8A8zzUXWmW
ze8b|ku7)(NprT23#S!9b(dWs3q0A@wnMsYrGun~RpFW&|6l)@N_ou{31u8dS0jpMC
z`ihOLwpma!U|cIT6p3)a5YeBj5s(*|Ki~igtj>EEG1INC+j~8YrNOc^Q;xH|n4ZG}
zY*Lb(zPVECq7fWlH8O3TO8)Zq=e?)GLFLxDV1ypjtwm0M+XRtAFWBVdy+tEBlD32k
zr)OhI^(3S~iLw@F?^elJE8a_(Ik9lrF2!kk;HezAkBgQ!)A)-*WauVKB-7RWoCsm*
zAu+WpVTtqUdxlPJHf!4TMk>F<#C5!V<osXeMETz{2;3w1?|sRko@c0w(6MGtOo_aU
z4iF)?^fx4wCD{S%OXe^QjTJHqv&Q)u7Y|gSF3QKNi(^i-7Pn{2tz*xQvH!V5{2W(L
z;&srZErj;Ty=K&01QKm}pjU^SfYdtJ)H!yBQoUhcTLRXQ5ogOsCHov6ju;c{Y{C5P
z_n_Ka0GfN{x)}$%dNahCA|!Am8DDIWJzBP)B4>y~mMc(m2lwhS>!R(aw^v5e{>w8}
zYPchmV;q?W%~UBwwl;8Ud?u)j=VZEa4mK@QILl9oL4hjrNS?;(1Mg8mX2eSQmWUG6
zgN6btwljJ=e;r^GB}e`?SLU7xB51Q-V`PUZ*Rwa%4JY9vKLQjY(be`G)^lTXZT(B_
z5G>+4_raO}M6szQ(u`r*{DqRnq#rWMKbj3A{tfYqIIGP2<(nPIW>#}8<!TX>Vd<7l
znove3Nyb7{T^2Is=HDfDsTeEClA2A?Y1}fYzb>?lDB!XQQ@q+K;QHH%e_JrMEzJ<8
zeb$znaQl_YWxFFIE!@i;rUxs}IE_oUh9RIhSjKYO`yKpzRbFFVe}d-bJ^R(g@#fMU
zH&mDFg;8f9S}2?l5#>mPKg9@;xG1!W=E)rHmAr-ClT_&anDdT%5FvtR7P+e#@33x5
zMr;ic<K$~a)vArO({8a5SMFD?lo+S95A{r^5L0U7h@!YmO#4|(!f&zn@7(D6YzaII
zh%D+VDbA^pe)n`E*v-M(^T7{}vMSW3+99Ii=1vu{FcJ$Z6oRpWDG1VfW+m%8@`l#w
z@FO=rlOu1=KjY{oXSBOb0Wwiihb<}u!7plY8P)*krn9Q#Hh@c~7XTP+xa=nks%krC
z(dR&oquUUi2k7R;@g+L^rVpy8PW?JQWq|$DrZ71J#<s5N@((*+rQOHX>aF8<C#iFe
z(;2Ai^O7S_*<>t}NTjJ0k>uSyGP7)*VF&>wrqQQN@>ALkHG;)P*CS6mjdvW!W9kAl
z8EvEr`V!$EKXOK)No1K4rTId`_eW$4dgaM}cngsO`HbX!zFs{yN(5cAAkTQd4f6P^
z|5rvteYV~{8Jg(QK3rlL5a*gL3!2?+wX7sLU))8(ye-3j`}D7f_G;zij;`=k9*+EQ
z-v_(`w{Js`N<<j2%0%>^*#g65wLywr+A;T7Td<svRQ1W*mipXrF<MW+#J95~_WvMD
z84VK~D3)s)2->`R-4N+(i%@jq!}4Ei&Z*hnKB3wi3K70JEb3rQtm!yTJW=_~{0Y!q
z3r;X_T9Y;QrXzbiT67@2dFO#|_gtbK)acC_t!X^X1|$0Av^EIjFaYmG+{*r213st3
zML}nZ>(D5Ljz&^{+rX#10@2*BaW`AjKvK%jT+X6ja6BD36g|cf?JoUSXt*WLc&GQ^
zk>h^_14?PdxQbpOxtD$;Cu+SsQ7M37mQx?kY(=+~s1gs~t1&~KhL7csHGCZ|sM2Zq
zFXuW|gl^1WZ$U}?1^1{XaSO|7r9j&{bbC*&NipCSlvb3MUzP-hsw})-%xe_~;=QnO
z`V+|K+hzi`KQFKWT}P-P&rL<*j);93?lwM%V0+PS^?DKE^>gwqIfQk;Q;z^*+lTG}
z<*}O(l5pYKnw<C-{#-xox(Wv$Ne?)`I_c}T`biqo4+3s}Xlvp%XLEE#VjU64MT7pB
z#WdhmviS3tNCjisw>B1e&TBo@7@Y|FWD&z6**?*3!W&b_4?Zv_m^G?y_yW{^>n1iB
z-tY3iDiQv?`SnI1s2+<+tYb06x(LmMciSmFY)N0@$K_6jWG@i{C_hxSv^PTRY)1K0
z=bqXHCF@Gt=W;EE==hh4r~a?FjisD8_8dF*5_>Z_Nnrst(VC%#A^qN1!TI2MKNcLX
z5LR1g7|9k(<g8>9#pE*lzEj@p9DDC}ZZ%jF;ViT*4K8?w*0CY^xini2S*nwQu?ASA
z!mdy79UbYWUz54o;#!OoXYgX24(5TIFJ=Gq-6FX{r(93MR-5UEy4Q4Lqp)vu(Awzo
zPaCR;d*VRh%k1ln>ZYPO*xIscwduIt0P%h_e&rCv+IWIUD)S*C$s)EowQ)w$4}Kl1
zsJSfM7OCfnEuR%r{HTA=N(J`rCxZ8;F0aU8Y*ek@W=u-;vdi!}AzU3Gt}JEQWRlAV
zyhddr%(-C0_R9ceT^&5$jxNwK#=cQ-_J&}bDM6F9QE(K=45CB$RW(&TjlaeyI8oVx
z!0g00&Ic4l2|Du2GH1l;bbquTfpLoCi%~3(I}t>IR}2;Q`2?en9%47a8cFx4{+|}0
z4#TEPv`;Dz8m0(s5+JbO`|4$Mxg8|hx%;CK)I0G5oG5RT4@c$j4-#x!a-~MRF8;yC
zY$8lE&21CaYli!4%v-h0J<iTD1=Zv)OQ#D)*<uv<aw%e_)`_CwpG68B3X7>;uI=LG
zHImwuQG8xi{o_;>&(!b)R&l8?0c_bdnDSUi&WZjnJ-o-;7L1p%xI0L-{e<hgKXi8P
zX_&!DSNizSi^?lf<e{F<i()MADBHIxGZmKw*OY}Ik@3jI*+P*V3+J-Mu?HTe!84Os
zUDz$q^}-KXqY4|2?{H!4)?_!d2!O%UsUT*R0NClLCEy39QKTk6PCzM9jGvXz{{|Cc
zy)v!1`oCIYs{hF*0NB;V0N1bw9pn8D#@nR$D!Ks%!&sT%1}5?zQXOd;l+@ru_cZ3|
z`#v)>9LF5aH<v{u4w|C&U_CEH${ONi3*=U~ZxS?VG<)Shi%D8}{-4KKg}NU_zJvz(
znZyZalH8h_>0x;01WrKHFF%yDlV-F>D*~v)&Vuscfm{nl(ugu|+?s|L)RtvH#g&nJ
zJ}$Pd=Rb3BZ={Cjv<|~H4Blt1JQ+++WBIvJRepQLNH3|dz9yg!UC#|C4O}}DwJmK%
z??$eN%(J{r?f?<WG3~iqdYFfwRMdwgu&M~m{GvDVJ9(fF3=02(B*HA-P7oPiG%#Uj
zR*EGMErR&kn6FQCaoUruy{#d{E&aRFC{~FaZ5{u-hW%Oyd1cEii`kNjpR*ZQb6i#4
z-M=P`?!pS1+7m^1cx{M^i>?_-?<`^?KC3Sh;ZEQd@d54^1;o}7c94D$k%n{k6#uJ$
zFpA2>LBSq*-?p|rF`wrNM{2S9%`Szr$*4@~UBwMP-)Zb_2rn`mC@<5Lsge&eWLS{O
zp(DR3`taIVx7^jQ?(|7a+5aW$Yaiyrn{(HN^4|+ODboM>>`OW47@sh$otca#-W#3a
zTTxCzd^}sWOD!r1=|T&(Mmgo8bSUYjfDzUY689~9yF$<$O&*s9kM-nxa3{ejIX~o8
zj92PJpEnhe15=Jhl-8wXV@9{MSR5sTZb1WUJYW@Mo#6jNnZb%SC^M8$ai(;{qyC(O
zSOMN*D=c{JLjp0k^Bb~InsDjX<fdm7gPMr3N$M~zSbaI}yD=p;7&!dCg*k3<j$8cl
z_P(4>VK6TnqUWf~5M5a_Cf+If(}c6N*9egm%+rW_E;>>~H{5#M<fG)KnhDTxU|r-;
z;lcY4_+aL-_gn+UZu&)0xa_b~?!3<es<#yruP?SdX8T6|7mU1bZu@LII!V5wq9Y};
z<pPYd0ugDIsahyZGoiIyHX1f(q%<S9<rH3ekX|#15_NQ9S0id8>v6~$ziyQH7}{M9
zr9C+(D1w5OV;^8xb6w7Iat;!5%+;}P+uAuFE18lKd5tPn7juqA1yXP-m3a(oHwMoe
z74~vfyx##xSk+Agwzh-VMICsim9fBmbSL<9>f8{j6x+uspD>XVUUboe4$aPh-6rM{
zG;7x3pq26HMGN6+{CNrhL%7@?tCJ0*91bMjyKS%ZLK#pxe5_Qef<pA1b2fdjX!j>a
zc|o;&y^${l^e1pG)&?hy2=nWtX=X+VEMeT;ct@0~MbR(Ey`|kR?p+oX3jwbf{F{o%
zytfB`vE0RY!$WxC58RW~oZtO07n&!yR~d<Y4SFYjP)drU@5XIJ=0D~nG}0QBRILo1
z;_EAhjWxz(0){0i;d^(~SFsnY5KMYIMZ>g33JmA;kP|RuQGXK2mNd>_0K&58y5T5S
zWdz}TcYc#hTC*#myDMZQte6;8WV(2JNsH|AAPIL818o40w~LsB34!|Z>L-Sx057->
z;A!dNJF?g$J9<r#OE3=k(X0bkijTiwsk8A)8Fi@1H0Dwjz78)wqLvBeVk^MG^Em+n
z=B_#}aSJckuPQ*SH!_?Q=P+fFui*MeSuF#xr*i^MY=1yAch*MupD5t7XUurqgFwc4
zxDCzt9vh_au=2s2;#to%aQ|U~x~1~?Rc_R@If+)sDBrB}Tf&2G?0(gTbOCE&wy$pR
zN-17cWAY~BL#CrHfk}g7)Hp0h*-tL@G~qOg6$LbdNvX~jcRidgn=3)mcptdFBzht<
zyfsIbF0uH937|D`GJwG;DPoWmq)iRkz6kkCl^1I#NOORYh2s`9;s@{$BIexAQ4VY7
zlp63g?t**80m9)Y4DMw<ljB_OD8bAO_n;rm#v-2JSmEf_W57_=F^q0rK$=04^6=eJ
zS1VL_G{)cZ6VzdJZQb93qKx=^^sCQ9j+PVikaV`lphM|wVu_|U!ZdfWpSyX_uL>7=
z6G*iU|6Rej{(BVu==gh~>5CWZK)UdXaVaTuHl*N{Cn7X5wzM2_`Fo?$VhL`vsU?N=
z#jL;l%o@4nh@CD??|tM^RnwZ&_x4T%TvyDQ6+)wn11TnkSq}-%$1T|sIX+qU(0Vc7
zQAGSh;G(%YPzx(z#7Gomqu?sm757utId9tM1I#hyK&6c*35?Q283_<^2kj4Ef?fdo
zg;D)t+0lTU3+xYYU?=_bLh%ByCr%CEasdYDpV;NhKEscXgX9Tux8<MbT7{R}t=O*s
zY8ae6_c7?WNTmzOomWC6)_O)itN=_(uZEW9E`QGu-g+L5Hjx?p0cI{j#bl6FL`e1*
zFY{*^1OM-Kr1rm95R1YQo*%_?BgKZ*M?IBGO;<~@IjtXxfZ0|rw)Ht`FHR&uk|{ej
zkYmF#<}<w{B2C+oa36yi3?BnoFh#1d)*(5Ix5OEuaHvIa{1UHl9SO;ar>GdG623D9
ziRPnw`727kSyuYTWqgn{8wL;evw)L>{Mu02*!;9YGOHrM02ARSlIyu*cY087{RV_<
zj$i_g+$<d6RqOPL$Z-ZH4*^W9y!Y_di5;(*LLTt}5-xc~09_5`d?uHxn=SYqO@|~A
z_0U(b1ZZzwmUi+=e?J%F64H{F+|f)e7;}rOqVp0rsH2F4i1DNFg$DUr&EeTMZ&x6V
zgnx{4oFdkPZD{NHO#lH?H0P?qfYRmwp_dyZP!&LpLOK&N`)Mh(I0(kD&^lclvU9m!
zkiS&r31S12Q(cf}0;~MK6LAWyIl-&Q(r%#_3WC#~v6v7IP3p<~WN!w+21s=YrF*L>
z!!nFkvFOV%gTQ_;O>DPLViuPhferv5R}E0H&`LPX?e2-wyJ_Gh^xvI=>1`tp-U)7x
zg2B^J$qNP)f>=Cboz7;YQ69G;L=sWI-W3scofnMTW{W~T9)l|4b!`G(?OIl*sk&)9
zbhOM!hv}9p?)it@$><dd4ZDzo34fJS#}tbAgY~B7EcMe=(dURM;ho>*Y`&X)&6OS)
zOd;hlUcM?R`VUr8?1N*xVi`?=Q2zmM7nx?Riqq%~Jzgm|b<kzVghcdClzuOdVW~}?
z7DUW1&m+k|9bs*p<UNQHsAiKo=5s_emR(SLO4p+hUGka4XCPe9oS=$LfGTkD^2G*O
z%pZowGJm_IK9a<l9S5UJZn=pVE{)^?J&+4Q&x3#_;al}9S&T5INpn8l56VvGAVR$B
zGrJ&+AE$_bvu#2FL1Geel7Oh>B$|asD9Q&WiSi5eW9;}%nk-DnQOFjA%Y0aUHVt;H
z&iNJ;3UWey#!K1qD343lTmPO{X6h(aUZInWY>G2ResDb4mLoJ`@ZM46xLY6fT^64~
zZ~lD6<^9RA=sZ3yhb^W*wpi4A+V!MzIwb}PpZut%$D02Mfp!orMZDN()|lQYm4UB1
zc^X=nNbjk_0@cPNBJODqw8&#a)S_Z(i;ot9><Fy^uV&}a&$1J=w9bcU?rP<exF}Xy
z_H$k=3g&Q6%Ic6p1lFP7Yc5DEg)=+^A8_&r8lPtc5olGm6O4E~fZY*PsG;w8;FI4U
zj+5`9LFU;SsvjEUoq<XNeQ2h8%}{>f@ndK-zce&<CAu1^mksoE+66i3xHZ<L_$s-f
zf}97}rxSTv*jMbZF(N>nj2Slu9eiwZt-AW-rIyc@InLzY<CG$j-gQwEXwut-A%->0
z1&E8rUhjQ`r9SSbPxxpOn%;T=VW9?TZ~!=$s&LWdWIUQFA5lj2kbJm~cLE)0Q}(ko
z)Rd@X4Sp`BAqiy~Y($%-pb1<0n6RB~bin{yvoNu?N!$VNtUTArSVIR~S;u7?aAUN+
zpzzTCFriNx#^UX_&QCKG5n+2BMrd2?a0UjLp)nY7jP9igI8rd1Y9wIBn{rgzbJ`-<
z#bh6zAs<PMRm}~x9cdj~2L)21^QUMI-=ZpXN76Jlxawfw-Gu7!;&%9p%vgWlE7=7x
zT#b1DaP>4&oX&s$HN5Au=gY*9W=A1lTQ8GRGeT&DvJiw3Q-QgNJ9~UJR+kg3x2VUG
zaFaD`5}gPzP33?kciR=_{w>-C?acwt0V--nml~fZf@)M8|EU=!j!4hZSM(-Hk{R>@
z$8DK4l)ALPsx4@8ZEXHWsaG7uVHCTA^9te=dbW<fE%U2Lu2j~xvLA}n0&U!EKns#c
zp*L%I4lgWN@F{4R%A{tUe#a$Xc^%$xjd0#De@n_j@&5R$p>P`vFPp2s3u{$~<mY<i
z&`i+cn$lz&0J)lpyFRD`Tr_9n>h$f$5qBm1U0rztatwymP)FMhIW43s&@+txJ0-#U
z`OwBo3b0^p@*U?c8qTdPeU88rk7OO3q$MigYLqH8GcnIA@Q5-T5U<FnWz4!qPD&7g
z=UPYRYScj>$s(p>I@gJ!L<`wQljQ)0Au6{LI6Xhsz>&30oWrUj(%UZM+GK9+_#)^7
z(!>P1dcBb*mt0@g@CpCkh}(ksZb!ro15JEUx2Io#$&!!xr2ofDFn?FxM6q|psKbh~
z$h}1WG^$kG2NBo}$U6<IPYEx9VXy<F0SSR1q0qey#$wz};aWDn(w2CcZWQ8ygIrHu
zl=esZDEFhphETJ4HJQFX5K&n!%(n>N;F79h3|sL5iv~0`=tj-p){NnnVB}jT(B(||
z{BKaH_^u%E7<Zr^RJJ(dSlWC(kL7sC*DRoI3hPpxNVl(8!9RY$gEv>mBtxgs*Fjr6
zUGB?O*DTA3zLVd)C?FK+ccdhWH@z^~sFiPM8$mWZOFC9boJHrz^cFfSOOaca{Rqu0
z{w-adQ;pU9nhlRv;JVe|@-u#z05H*2AP4q7dlVeXF;@vy#7~kL)tagi^ag7QQO=hD
zIml$CtM#tK6uc1-b<|R}r3og{qW1&MjRyepyvrjl0&R^IgJ9RkcdZ(Q_P!QVXL=yu
z{UM>npa4^AYJ+0dMGD9pYLw~K;-+!n#l+xA%)GmV?bYx-0Sbw;`j`1IKOr4X8qYWs
zA><<MnE{24!ui#ssU>5LrnY~l|Dx%%uRaJ9m?d4x4u^itG*-?2Tpdd$G0UKu44v0J
z2xzyAL|nlxrmacS0ye`PFH}`RZ-Wd5OM^X%k(rxe<zTPmj(*lbwVU|mTos4QpD7e~
zI&k!rp-bnF?TR=AsdgRz4n-;6X1Eg)f+sk=PE<$ZhPjMM3)SzvJllSR4|b%|UDvV1
z1~MKfPTipal5g)qneSC1r>3wJEVPPW=xcIh1_RAm|K<d?XqgEJFmJO)bsMLx><BB8
zz~j^?Y}sEF_!@yPoixFQK*YZhzG3;AaTtShzQ+_aWEBR%#ua4q*D9IzXzDNrEM~H`
z#4GJ!MEOC*{<>_c*XfnI{25dLOq*79%0Y?{-n1xI9S9#r`!gLUOSC}b&=Ew}+)~k<
zBV&T9=uQ-CU2L3^LP|>(J^GThs%H=Njyc>44g2upV@Xw4XqtOB;+v<SBb8S#S=98~
z%#}(k-S-c)0YtwMWuav2tf-JbB(R1aYFg~<O~2X~?#wV86#aFToo5^>9lS252vJ67
z<i4I|0ZC&Uh#0K*To?0#8ynXC3Wa<62yEi`1!*8L`)#B&SPJ)<oPq0X-^`DDzk6)H
z-6ceUw@L!={5w7Ri{fmdPE@-uE>;>Uhl!$5qTYgZxf)Hf6!8%>sDpDDZ79JS?a^IL
z@M0`BGEq#)oEcOzEzerI;-N_xVNe{X91u@9K$hWkqY5%?U?@eq#U6GkPQmxqGT&-7
z6=kj%L?U+eblDnvGq^<RdSe$Y=!&z6?=2R#@rgd+RG?7QE{29!AB!&#m#pJ>hcuo4
z+jaZ7JH2i+4?M!o9KpO8fv`~c>4Zu0Y6fQe0-d|5y)#d~+Mj$BB-w<35!j?K<Uk&}
zCiw7=IFP$xl?gtS0MF~CQ5644Oui>r2fu+Uf2c3P*k{#U%MRbcO2Y0V{|~Yaw`2O4
zc%|4s?Ae{p%ZfF^TwqY?I2IyUOLpE$WV9vvxngcwrL|S#l73drr53fA%+k-g_5l!1
z154uLCilv=R^Uat*YGTD3$Qq78;VBG5YZZlplQ0`0l(nJz;<BC#fOfa-G_Ks=H!>F
zI-|94`W)|6%n$Oa@waKvE3U9^119LI3TQydHzJ4wl$n_X;i0Sa17?}Rw+H+89V^i@
zuaLQGEEEFfWgwDkC^<)Wo#A=7+rsnufkRRl25;wXB`V)f!3j_Q4n0GAkohyL7jN@H
zW@k4fHauCgC`Xnh5V-l?PU<0V-Ft6cD}N^7-f$uPOY^RR%_SAL=m$;E>3Y8!)-aRg
zt#QXhNckC4@}`PW8uZ4d>w5SgMgGvyDXG{?60)$Jf{0AvK%Jz3GA~CETnd;RrPKP*
zso640pL0+um|%!?FxTMriA=+K98ee~);7a9Qq$u?L@67f7_DYabES;>u!CVIta`||
zHrLKf_D5xZn;``rC?SIz+pmDJj7R#}p^G5z=hEFAj1~;WOA%6Zl`d5|jLIWpzq#Mc
zLWZmQK0}RYO~P8W7u1%Ze*=zx9|*gHiJuZ@wRH`lYG9osYHmFx(!wt)=&6Fj6Z%x`
zrS!|jd4LVie2zN^$*ttWtvI*j0@72xtwn)$h<^>mxykT9MyE{VTS{{&Yk{+l4$pyt
zWI8JZ7tXi$Ve?9N--24oStB0&bfGK+w|7oj@GfqKwTptN*RwAi%ls2}NzT!9DF3}l
zK4sRhY<B5dI&rI&Inklx?$YG5eQ3?s%ECS^&~Uk@R_z^?=GwYh?S57PabsJ%ckf9_
zAQ2VAT$|?Y@X*_(^K|%osj<4HbyMdu9zpx+kRPAbDk*a|ggj$Hmz={52gCaPrki(D
z!0qPzeZk;*<U>5aAjgs-x5mSFNJ4`%=ev6g>}1#(!eG{pG_bdrsMRIq!9aZ{_&Q$G
zzx21uQ+|J+`FhvcdR=CC4q|woXZV=^NAmc_5cRwwKl=OwjYURj_^!43;ym4~yUhGv
zY3(L>nK^BIJL+TM`kpi&#pJylAPm6C4=H=VR|X5A(`k|>HEvG<z%8drC_F_Zf28Jg
zx+_%U$jwD%+S$^!&-9|Rg2@ZO5ZkJB<)lG`fUl9Swo45!lcKW<+cO3?hji%nQB@MK
zwHA@-z5olupGhM+TM*PHqCwLmsG~-wVHi&dv~P59Jb_lP`xEPCJ+~5<&Fpz}@lI3Z
zS@Q$cdK&4U$18Z=+552za0s-n;w#t%M#Ua7#=XU11Pn|-s1oqpAs@Z|Cb@T;G5b1j
z5+p&!uJ!aCT7asqw+kn?Rs(Hc5Mc7D3k`BRONCX=+urJ@;qu$1@Z0@1qnsdk2JzpP
z@V}SX`nYrl@mToAoy>gx74WY2{wxr<|28x%K=|1IraFCKe0zHmyw_a4)*#S1xw$<Q
zZoc+$<|*WT2q5H2ohV7**2nccw)&sceq22LNne5Q0SZ|_<I?WobOZ;Q2=o;!^W|c$
z?NG6?HLaGEw2_h>bXi@uI~SSo^t@)_7>;XKvS6PBMLA(a!aH7<i~@;teb|)W1<zc_
zCNEo9mmi%AJ}eHfhx;MiW^zk4DsNaBb5j~fZX-(oCs?6}q_|H{A|W|gT)Oew0@|he
z^dk*&haRUiIX-*bv};kC9PifTbUX^Nqp{WT@-Ql$3$HXdc4l&G8pCA<mBnq2^R_oD
z-cDt|>nQmqfnmKA;jUT+XM|OGh)i>EvLKuu!<o}2btJyu8JC+5u<<gg4h(9WZGj~R
z0(sN(q471K;d^sta4(RkA?`Dz;WPA)?Bw%};&FecJi)v22<!aH>A7>)@6Y{u&-?mz
zwY+8M=?(pM;B*tX7ZJE`Y1O+uRQRkWh!*(7G5C=3A6L-nI+F2w{2V5c@EE)kr7IUr
z%L6iD@rY>;1d(@ciV#BOa%?j#9GTSIoEJ^nRH9$TPG288UtzAeE;0rN{6$5<q7Bc-
zL`@3enLMV)9>7C!3%sTsgV@#|4+|EDDUBATh(0u>VUQIjJh258oH>yuv|{c}x6j4h
z!3m9>d#76)XWU@@J?-CKMnrRf&60*aJd`D$q5U+lAAy#H?oLT9)aK$LzcxVzYTUzw
z(C}*TUdT#Z!0L~;K++h5ScGKjW0Bgl^#Mu*Ax{5m7AVB696#W90>=;-qVcwUS2nnI
z3p1hzp5n#nO-x17_oIod%S-9{+bi?=AE|-ht)2i!NAfe{8yMDopwoRocIAmg@G>gl
z_YZ{kP}|cb%J33U+xu@06Silu`Q@+;z9HpqQc@G)`B$3!gGHE=YXJs@4W-$!#7x{p
zmFTXvUZ60U7lyiU4@-!qR1WitQE{ozO*$1vdIgryOQ9HcAJW7p56%p<QT$2?9di#7
z*EYW^>NeYo($VH;RleYyXd|X!2;;<}is-YN*Q$DNy~tvCG$EiNb4ri)9@Hoasb*-;
z+-Y43T0%&;WlrlnM-$(m&Ae%(U$AW>SNH4yLuGQ4Bsc||eAUQ96MA2@qHo1T0fK_o
zs2?BwYO<rG8_?@Ivc1bGIdObSGUPm6U5^yhfk?((^Gy8p()x~(H`x=eVg7#T@JSx<
zFK^DieO0{uX8!T6(z=ese7;X6Ya_$wF2m=yBd(9H@5f8t*Gt|mkU`)-trNn?jL-I0
zl6(HlK{kct?KCYW0Px+-&d}9g@gf&g^vDROPns=ii#qH7Mu_D+N!%*O)R5&%<{@f_
zXx&=|?D}B%c8U>6>er0q9(={KRpb@Du@lbDX$vx7>MjhJD1^eer6Lo9v$$D03PC2b
zJuZ5oK#pvgizMsRgeLf|lQ?d~(r#y=Qe*w%+!PXFu6~PC6mmbM)C}4uwx#E43@qY-
z#QlcIDmn7?*Xe%Gi};(T_`W6>MENx%!H@tgb-hy0!<EBn-^!)44!J&-Zb>p!gvf}#
zT)wOEiYI;7Dlk#3zs?gPU%>i!PVVjy+jB({XTub^9=ksLJ^OqNyWeGN`{Cg~x7N?`
z+IQ%H+ULkxkHZX$&ufCuf$v-*vCr-NBz=09{rBmW7xC(S$6&5q1Rh)?s^0>d@1Q4p
z9p3~PPdDsz8jbd^k#pMjoD5KO#2%Opay;(0cvCU@>>36;hw&4a%FZe*=oFp<d%ti<
z5L(#6N=>w!zD-D2u_^`>Ek?Q8IUA02BWE19Gzgx(7s(}HFhMQ^<XnpfNOc#{cu$*w
zb2fgOE3RBv3zjpqTko_Idf*Rt|9TP$Nt^1M9FWTx6@0O%{PORB-u1sI{PmW_?K8!`
zcL7q+78MRVMozb5LlCDJn$YviS5Cl2=U9I7Q<Y7O{SiK^c<i-HD-v_rK;iJP4@_so
zBfryTKjdn)_3j%{zIF}XVF3TEl3z<d7xOyW+dZE;w?0x^yACk?b}-~i!(u3E|C9EH
z_4B;8s}~USZbEoK0iyYLWXH~(i6ReV+qt!+%WL`r3nH}XHB~KZ1*c7f&2tNtYnj3@
zxH}5P@dJZu&UY`wU5r?Sk-4qvH`&-nOHK#D0cvRm6eNm_Bs+Rsi@b2m#3y>HoW_G?
zTQKgj62t@25O9Ynkn2e?r(@hnMicnzV|9E*K~`F?VPRzU@Wnt$12g@g{ZZz&Pi@<L
z(-O}s7Qn;8=o%pdlh+qnl^6JN!zU&8@@}eb1IbnJ!9thzz=}9BX_!6r5uTn{S{Gr&
zp*gL*L<|ddTr|SU8j44?ue)E@p`UcTk2e}$rv@J_4sR_CuZ0Ye1U>%@t4Y3V&_B;)
z|F0+iuL*DC|EqU~*v%2R_nR~>)I7C?PZ~93n>*B8G_fmWRcDk;V1g;DVnbks!IZg@
zl)tx&uK8P12n>pi$s@=*dR()d&fq=<oDDqI&kSObYLO?qVN{TeJ=rJjY#;pt2uIUX
zNKQ=E@}66&+*L`%G^-*6X93#AFiaffmX8j1YOI+b=?R)AuwL1Tme(WSZ357LV)qwl
zXA&Mh$1#nw3$!0i0_G^SRMAlP*2H<_V6YD4_EmHxssux_B~F&UqFeSmEozLTquVC2
z3p<Kfs@3*b0i($Wd`c3UV<y{6u|a?S`~l?pKK`Z1^KrI)|F-c)Uo%+E#kd(nQGi8_
ze*UgThu_}J7yrK)3l}I4Gkb#Lwp4?Ij~bZ_&q_WI1*5iVA|j1yLL1^6U^C#Sa{y+D
zmB4a97<MvXg1Lp7hxgMGfqq8~!`(P%G@>w%8tL2<(D9>*9GBIkPl-a2rvtn+RIMnE
ziq26p=*%GIW=Z5sTPWCs@n|rj!Mr(Qg6~u^;rL^`yByO@WH@))yu6E~4G~<j_1VO9
zMCY{c(^Ro&e!Is(>YKxjtS!aacsbP4Z{CH{$H_3~>>lxs-hu1@dL}4#eT#Is8DrV;
zXQl0%xmERz8V(*@M`gk=NV`v>dhQGS0kxUW8$ECCAkTlkUJWc{I`#jb7Qp{++SIR|
zo|mj1&mALACGVP>0tDY<o1RCTt#2ljz{8@7$==k|RFOoS{wmO)wodO7!0f-_v02w$
zm|y!o$vEC+Zwr0?=*}@aN9@}BLEvCj!_0C*q$irQU@8e@aM8Zwop1YZ5bNI5ltrac
z256o8SfM5N3Aidgv3Ae62-K`a^PR^G<)oZtdCJQ}e4H%ryUoQc_aqL-3FEt)ku1~s
zGLEgKVj0hnOBp#Y1DQWXV=@!-4~;MF2dSIyo5AM{F7}PMpS({uxer(M1AZnScmzl5
zT@ITZIjvr2hc|8dg)Vn4K99e;hhW^;uhenw6nt<Wer>3v{;9^V%<|#akBiq4ck;bV
z;wfrf?LNQC>Kemw1?DJ|l4C44QwcpDo~1J5AsX9W%AkA|&Ms)2MT#NZXLtNq!cpLV
z*(Z1p_P-AEe-0Z#mlC)o5xAB393=p9^!9%H7sI^C+!>78Z!hz!%gbEPZ*q*<mETim
z&!J8CVF{jN3`8ch@8K7(2YD^3ApdR(%GKMDzY52jMSAeuDcLg2Og2Kb{Q#T&?*;4u
z<Ywkd_kvRAj0I4k`}>K}l*=dCCq!Fkv(r*eHPUy<2zboJK5<3o4yt=8OzrF7lKCDS
z4jGV8Fi*GMwhS-jUTHYxXlMU1Yn~sv@hWIwg$JeM;4<f#_4ND*mkxYvc}&T~+HR1e
z+ES~<5j0eTRXLdUX-)>r_X=vAox6@{@bjMjjVhvPA}Ke{&thS$+FYx?`iwQ<6>AmZ
z?W6a94Cz+734dyT3UKAoFI2PGXflj>4L_e&IIoQwjqAAqjf{!x8a$i$!`9w<yq=V9
z{o_5Jn-IJWJG>9Ct*sHfBoMrG{-b5B&wStpe7lYt7*y^V7|tBQB+l^OO|ETyK7M1y
zzAiX?7dZId&Kv*z_|H`S+t=Q}&kDlFZ20^3(;c39U+@P(<d#qpLPamG&BKIK6~8rS
zV=8{k$e^p90g<FqdsCx3eNhKO8dVCF!8oXDgCJo^`^y#A-Z`4Apteo|n?vM1zXR^F
zI>y(eC>a@@X!nacQgSkQ#c&+?P0@A08$tOuZ7vkY<lupzC;%LO;@FGCP}iT@gEFA%
zErR+Mr?wRcO2!L;B`{5}O)_VtQ>1>N-<SPn9-C#hunuuzSeZ>jRe#kkZAIq_)3PbJ
z_to11WyAlg$)A$md&|V(<s5Za$)G61#`QJ(qFJ|Bg9`)qX1TTdq15lRG}rI-<Ua#<
z8-ur1j_#Y7e<aM!=V1;%>hFW=X7J=D@UbB9&0PK15O@w2cwSUd_<ca<@bZr#7HaSu
z`d_izo-@7(XUqM}>Uo{+d70?VIL|kPXK6v_=bikt*vY;btS!mX&No#a@PGn6Y!VXO
zwroWYP6c(ngvVdMg;$$_kBkXIaZ<0Jn}hVoK0WRmj!~S!$ow<Gq+M%tudx;mXg9kj
z)M-(!d}MNx-bK${=5-NftY<ous9w5f6gSC?4)jAuF8~7`fp_t~O%EZ1r`X^1RQiQr
z015d3ysd#HO0d#WCvwijtYU*PH3^=IDrp70V~s_3>jf3U!|wqk`36SyxWDq0h=DGy
zE>IM;H!4>7Mx`NV2Hiv1eJazvKk~Ki@B3xYhm@D&vB%)^VeuvRHKy_T{1F2|!fQ-`
z{2oo4p;2-c2}5k(I)Q+42LER$D)RJ+Q#Eyt#UB=#gVK~b_lDm@m8gVqNL0%=MfwP@
z8woxP8zpER2?T&v5|h;dA})RCiZX;!@_zspLFv9+<7J=+`Lin9(7<3cKtNZiuL+Yz
zs$+m<!lB}A;v<#-TSDmteIbCB)$x}?A3@pB4`-PKIEc>51ry|QOx1#Rcpjy6f?qjk
zRtUV{f~z-mcPKpIhzXIi=x}1skP3u{>0tV3_LpaD7#F9^ptt}>)t2=petbE{l@Fy<
z09p~jdWtDgzxhkQ1V_Al;k~`wr;u>~;Ssxd=QF<uI;^s56s*BLi_oJq%URQOYuPG6
za}<XqFI35)iHbuCq)-?#b<t5}0TdJiv#bz_MV47WIl5=7Qlmt+7S)FYCJJt`WOvcv
zBB0=x5`5B7nAiYN>&B2qw<tVF;#;;-aD#V_8g3R{As1<M2{PNqJn+OU2b}CmVzQZ?
zTv@y=1lb47pBLbFQ8mbmw<tW@alvAifOhReFE!GMi<2)V7(H)-5CyCEqU3a-{{Os+
z=uTf}T#d227N(eLz<R2gMAZ3w$YDoB96)%)jHiF_{qs(qiWFR?22~qfuqJuJT|8xj
z8zMI`k!|XL>8dFvH$?dy?aswqQ<zr;h>A5#L^L4HjTU$WBh<jEvXDg4O$IhXk}HPP
zE8Q`XKXatMnEhg)oWMJvF;-D|e3&4vg@p$6<u+ihv0`)-y?1$uhq`$QFmiTs0S0vg
zDVvJroa7J(v3uY*5`Gt==;DI$0Z81v*Teb3`P4qUHeRU7Amh_4bP%<D=c5rdQR-go
z@Nd6yO#$u^Y{>Dko80pbEH=B%ixzNr?$J8^FTM3^p65J{c)a2O!Xxg-xG_(QqskQu
zFdLwNDJmj4UliK`!=;IoNmJX43cHv-SiYM)dbm=D+7*X2CcMNl>=Ls;zUt_a<c`Ed
zK~hqWQ4yTb7{aMYpoO8a&b$;+q8i+cjS{yYjnO$^Vqq9<Mg%~_`R2;|5a-D|fP2s7
z`w2S`iW><pYv`^;bpqjz^Z9~;xIn>TgvISv^W=EEV}}zg_snmlgQ${u%<T*R8_B<t
zB`+{?C2-57TouvXcGO`@aoAtNI=Fk@pyivhF4RE5yHZ~tV&_ME7DLZ7Cik-+2M``H
z<LMv#z~1$*VuX|G)$$=|u|THqS@LHLmk4SXiL-*1!7D2N#bh?MxW=(#_C&%WYf^-@
zQV*dR+T<P0fXw#MqE^wcqTuNH;=<PCC<_k~wkt0P6Ht9eW4p&b@o`7HnQ*O2=?xln
z+bX29yjquG4-%nD9O4qCK$%q?!rpZPXeqm#>ZSM)Q=HzJ$pxp@I+)+sI4LO<T}D^7
zioqjy2siS4m5rUKIl+4egd>J(kP!7C79xux9=d`9Vzuko9$zrE@vM5Udj-7t4PW%Y
zp^o@0#`*4*(yjCW!Xq-Ce&z!U)YXWhL_3Yee)JPXChCF(=3PI7_6;S9nCJ-B%-*4u
z21X)j7m`uMbO7~YlNP9D!3DvjgMzYxFzOskp@}g}pOxwho+=u)<d)D#>;)H$!+L7J
z8j5J1V%mSw<_ee)6&Gc?p5=oM7%qwhhhTiUJwj3&lw|>@c#Yf21?O%%r_2Deyik|;
z=c@`@pu75FYFfoTadncv2k4-<IAx|fTF5u3;j%Gzc!)1gAjA&s#@*4qgx+$`76Q00
zMHDGZkS)9ZoV`X|=Ih@4`rrG&uj7cvG7ca-BIA9(5L3jgd=9I2Gyu<3@KqBcIG4AY
z1_$`8foDFU=&3zGR8cD4C$Ag}X)Ug~Z})Vmr~r>dXrgH7f>9>8r}h{VdI?mGJmlO?
z*<yRRU?3PWFKD5NmQAMR_F{oZuTUj7O9al-)SCM%Ve>L<Zl5c90+e0aHBrR+BAJK8
z!YG!kVtFhyZm)}CNT%534pE|LL7gtaZ@NsUYPy_5z3HHR_4`|x-@+iVUXwD{+`B|U
z49B5%Pu*vc7kNTGK*T9ogP`+y%)eY-@k-I<j(FMQ0Ky|O-uF*Foc_#=oQ<1H8Y?eV
z#ILyBkVBE8Rz4VXu#Gh<_#_HOb1|LkQ*0dd6-5qW29i95vslo~Bqu%GF&KSES%a2X
zcmD)zi;71{>4{~X%UVHU1e}fXfp+m;$O8Nzt_<XpI&*<HPWwmpCA|y^H5RHOGpvvr
zFu|tE9+2|!$l<N>DXrvCUgF%?=$BIGe2fbqT*cCT?r_%2&vze)SXKX*bP!mp>GwNK
z<#SO)FRsb%fcF9O;w28$@4aN|<yoLdCi9YxfAt#<MtDTV0fa{Yz|%kQ0jR@OSm>~=
zh#(Wv(tuzA8`4ESF}1J6z~X%M!p!{$k?_Ncugc-SMI!S!nMjnPz00Iii|^FR%i-A=
zO+C|gaXcd}8)v72T5>Cz)x7zE_(U@aT)d-Ui)26@<NO6`%;FHqb+Nu=gth34^qIa|
zSTtc5P1LGgH8^zUos}l8_)7bBtj++WJ9NK8PIQ{cH{o+n3dd`gkF$4~*4fra#`=Je
z=04*q@*ol1bF}3L?zTLPhS5{a${?z_XFe8s+*j>TFwXMLU-ln7c+ew0YjHjX^B(bv
zil^W83t2DWSvx2Re$HF$gd~Fx!^eQSTCj>8W(mZuz`2Mc3*=PmR4htsSs~`erQ)7h
zN{?#r*84mf5ZzEEM?qtiI#AKlJJO1QUNI-COHs<fOSso$VkCsEPH#XX^Bq$3#Z=@N
z<?4$FR{+j==di;~!fQfM{5_I_woDGni+}}(hI+Zr{9%&Ci=5wsNx=nE7g9LsCI%2*
zQp2@_T71yK?01ssybOC$bkQEhmK`qQ1!E~l+{vN&N`)nn+uXmDY(Z~+!@u{!M?d1R
ziUSCbz|-&grOKSe-SaipDMAS1Vi2>AFfmV}O)M%uP1r>i?G*K+71RvE7X}*}8*?@<
z5p;~>y->oeWqa-b=X}F#F_Q-#XjhB1Qoe-X!Q_bS6|G^k0aKJMbB#cfk{LSSxv)pe
zQ$gIClz>M}xZ9DB1q-HA=3;$k(7sX6j;TOuHPHZCm|{&4y5w*RG)^A5%N<T4xXPsS
zAS3m-V~Y2w;W*BY5f)U}hn}Bz-UR3Z@aAp{rCYvx5B$6yf6-hgE_z3Z+O|AdN06W2
z{DyxYM;uXc0O1jM`UifomK1}XrZzbee%9t9RariiJ~?nP7g>%qt)MY`Y0l&j2)Tn6
z{?M^8*Wab$zLq*>eZ5r3%5amCO+pgcpm>FLN^Vu2mZ7P}I68VVKLgQ9fQ`kxdTKY)
zi}Tc+!a!Se8vs~Ky#QOSq1^q??q|CQAjaOSl*XwpBBnM11E_|PWC6kj(#qy)1N>Hl
z=mLZbr@TxVE}|&rj}ud|;vXt)d2!k+wOeRngdRe>OCeOdm(2YO1y|P#mz{_Z!6TVX
z)~8!F+I}wO_J|`g4j_Eo<LP((Qa)mX#rHu=F;)YOnanG47pk3tIgvZR42tK~kthgq
z5w(7?I24gt$-xpuuuXChYny!FXla;)Ji5tL#eEVfg`62R6&7<XEE~bZDMfK1oHSTS
zcov4z>@PDqsI@eX0$gZf&Wx&>!3D+R@ACvgAyJsT=ah*Z1hyt|)*%d7O34&ETgnay
zFT~6;;`)kb_t@d2jF?!61^?ztpxvGe7aV{$9`DK=vHU%h%DP6oeCl|#J~g|e;r_1D
z`m(COnX+f}B+B<S?)D{gz6Bhxul{{U5#h@pem;7Q9`VWv5_aN3oPeNQZI6HPjLp>D
zETUJ^xX=)Xo|&A<p=idvCeIX`(H9R3N2MStN7%upSZIrnN*ytxLWso=QnWyYq0)_>
zJ=9pOtCb#6%0bKKV1#_gp@o75#+g7c(32*DqK$^p+%41yDRnH#*olFRuA!H&N%<~Z
zjSCP~K}G`MGU^?Pg5Zi<)A_<tM7Ri^ArZ@#44=)n+xbqhV&^?}I8Gz>EO?tBmp?9M
z(d9aXB(Si(al;d=P1A%ruMgJ!<jW=8--6_`T8b#d;b;P&E<Yz@CcgU14{7w}4?n+B
z0O*x+9!I=f@$?V8AMJW}S^<)CSTde*&s|Vg;0KgDCQIOVo)gxB6-(iA6d-2vGSyVp
zG4p`&|8%A#k}B8p!bnRu={P;cx|gkI1T4cVT2{WR2LHlHNA&6T!q^%s5n!$CDI<ap
zpkQ<!A6KjpUj!ave#3i{S9w4hXP41Qtq_n#z%U_jwWSOoEFw6c-F4#5-CU5>Q@i5&
z%T(e7zrh_>BDh2AA&O4IH~${})fV{_%ZJ}{zPg{Wb>p~pzyP^HAogVvgcOsaY#=NM
zaR?iZ-T_2H`hh;MM?Btf0O4aDPrvH}IpiG+&T%Wunj~zR)F%bRA_&I9r^yjf`^d)&
zqaAgbU&g_a2hpw!KbWPeOEfC=l)Npg$1)KX^pT=m1VM=oMwgjtJ(IN%0$kQ8W(U(s
z3J&G7YOiBXFZ1z0!MZHFbB~j>d+oO4+|9JJ(dJ_TG5K(4p6la1v@FCcy*&frmP}p&
zVSbn#E^pbX^}+0*FUW_HU&I2C<K4$c<@AM)rzWA)`Wct&P`~uc>%-#oYh1wR*nIEx
zB>W7bdgV>FnNuG93_p`rzc{`5%fApu9I?a!gpYMR{jPs9jG&^xMmxdJVa}W~DO*A#
z78IPi(`Z_Dfr2aMagU>=aY@;&W^ltPt8yUHT>UJMsk!HT?b0DTyr9tvRGGmHF*UJ@
z)nXfwyc{;2>`F6Ih6ozEpdey&aFwl%n*k_FBnPXV7n%)Y;(SCN&BR$mIPEQYDl5|L
zfl!sD+x02stQ5q)r%VB1(#=A<i^SpLor(HITT*ftsH}<qD@{y{TrSOncy{p^LutKu
z32VD8FVc82B=M3%i-hLaB|gp_+?S3>BKg(7|EQgKMTGnz`Q+t@0|+1Ac=}zxxVTqD
zyGFZ;+3rwJAfy2s<a^l@2~;Rxn~c!rM%BSJWKvD$H_$PcHKn|Xg;ROHuyEE!St086
z^Q=mK9fu1Bh-emy0!R-yjB~4;rI9VzgRrZhNN_H7w9Yf{4^V#(B4YFXcSYPbPfc;Q
zv36Tt{Rv0|5elDBPt~7w=OV=`+M&2$p&b~N7(3-NF3#}UTs~VsJI(>N$Gm-WwZS0k
zV$9vv558lBT<;YIc#dm2zc6(w`%vA(t!)a%eTe|V?*b;XTe_+{ta$HeN4yNtZ;z(i
zN4(te^bh<~AmlV-dlEq5A9A_p70ndF=}xPvv`sEkN~E(|8K*!x*7VFEhGAwg*CeON
z!%_%=>oSuRDZf4c111=+8*97V*AjLDV9SNDQh-R9X3q0Pii=538v(;W!KfOfv^X;2
z8pg-3$?y9MO-4<{4kwZjHmxW!SQ=R~>sKsX*c<IW9Hunt+JV_*iVHiGl$z><z@1H|
za+AWn6Bx<P3!XZ8?Q#Jg0Je*#@W4}Z3-`P3fRhtD$BoE%Z$WoJ{Q4^8jO+?@Fv24)
z;sC<OG@gD}q9C`|<T${|_5d2}1V96j7zviyvaE845fp^k);Jc$VoWUdz_4nHG2LlI
za4aoF_VupgX-%(4^(mz#Jsi*E=HcA2>Dd^9ZJbBs{*WxTxT}CH%ojl;I^~&+EFLVF
z?W~C?$k3=N*+<kWE<iY7TxdI8R8=X+%J$VejO1o6?)kZgd>ZH-rG#r8;mQ;jEp$-H
zfs{LTSiY5u6TpDd!OQC)T=!owZ227z#G1E0GnO9O<K|`@!uNZt4zcq8l@_Lbl*!%a
zcTy14|LA}Gy360u5s!BqK=_!((?9TwNd!m!t(f0ZP>3mGf{`g4+^sT&0Nb+G49zp0
zo?rl^uls1+!e_TKg|A_th!_(rMz6C%DzB!aW@9}aE}X*1rI4{cQogB3YN)$|tj2p5
z6$|oL_3!zT!gy8(vaE*4GJaT8m7rREuWufcd?!(wc|}=r!8vOwj%zvmck(d7A=s>!
zA2bdRk-rIAET;@=%bw@0{b)uabAiBlv?6?$(1?A5Z)lN)7ad{w{XP)msf+rG`l2km
zj_D}NuXnz@*CxyMKw5e}^bVb$_Z*IRT;l-3$1$FM*FWX<M7l#Ga-|@6TB_s6>eH6q
zp+km3SxNU*5TkG+AW@?$X&sLxhc1LJ+Fvgq5^vuq?Uq47ai_mqQdw`rVip{Wdi8<R
zx?b*!(K6*&_8XGOPI8toy?%sZoTb`@Yo>dYUC!eVS=N>TjZ;MgnB4=WA*JZ6*s?q$
za4TBj<U!ihQ40cR>$TE93+gI0=*12(IO49vqWI`Q=y5)K2t;wy%V&B2Q(&Yv=a<Ll
zuX1<0pu9tRU^db?E=r0hQN8Za7Ooj6SZcP)1s07T`W@82^H0C=@*R$NnW8`U=;c0z
zi~|TC$9U)e^1)FnSBq5N5kU;duu+X((3q5tV@T6Z&|DSB#YZ!ZEcIh1;*=8*6K<4m
z9ZwZqA(Ul-788q#YmS9G)ZIxYDn*$CY*%K0fU7-N2mFP+8J3xVLrg-9Wv!0)Por#o
zQdxoTQ~=`=rfRxu1IQ?x@a5o@w4{|}>VklgFT{dv8m7=HqNursQyNv>0SM6O<u=$}
z9HhwNAc8CSVK7K7FC4sZ;g|VF<C-A9G0RO%z9hdVYt--kUU|d>!f+UsnlPL)^#WJ+
z8jqH?VM|usnMwTy@|xyx#1XqVfbg-4r+?s=fIA4lxd3c~oq$p2KDdjr;aR{^aHa$>
zD`_-DOcYphaIfNL<RFU}%hSm7apLjtn&#-gdec}6gQE4Qd7vOz!C@9H?8!vb*GuED
z%9CQXr-_|rvA<woro0dpjDsT1`v6O>Hra~+!bmSZJ76%x)}UW~fOK3A%0{Yh1sH-<
zxA=8v<m!^c8Kz`Pcx6t5{H6Z6bXM~PMB-wO#9_9wvrNFPAXgB$<S)m&?Dkv+_M&*<
zdXKR_sD2Ce`<%O_bJ*vWUBu}vUy^)Pa=yIS>1wt?4iWcN6x^ZPd^zw(|C6JL@QBMe
zfbg-4cmCk}0i?3T4ec5tV!{FzA<9lQj}Sl+qkyhS1d$IW9bB1T(M=47HV7i-c1#qM
z#Nmcl;tetj$F(*;Qjf~gF-I>gkX8RcgG0u#&?b}-qpTviVD4ap@kK+K_2Udw`~Tbf
z+E~r5tGs8O^WJ;MnGl<%aqU1Lgec&qfJy9-II71=Rg7#26BHp;mXQjilo-ShL=ZpX
zPw@ka+8?BGGbF8|A}f`W(jX-NhyydKCk`aV37DAFmMb7Om?k0#^?2sq_uZ>M*5}^m
z+&kCKeB6)yWOV($`|PvNKKs1c&w18fYi$tGV0WRzs9j*sNT9>01gVnC?+C(GMRUif
zA$qj&u!L|0;882XxR8W~ljDplJdBm8vzWz|QKjLIIwe^+2b1#N|IAouD3EiBRgec6
z!co84F9B0GqR?`-8#CE&Ek4_x%pPf@*D>ydxjM(*CLo4xrc79E0b3$NW#Rh9@9&;6
z9W6Q$9xmMXz+-?-LBj^dBVYoSMp`nD3>Y>fTSwUPg0WI+v^XoXSK?0BS`k(lCP|ZG
zrUktnHK198u_Q<;*SxOlvXGC~o~VQp!UnSY;0mna3_*~7rSPL+#y}KHn|56q*o~R0
zdc|@(RyH@Y@=-~)Wg8zZ3>wv=M0frxN?<x>b<kcT<Ai1N-V{Je3M0OwMw5VU=aguY
zWn^Ht7FSpAQ#+Auxe+x@R!qs6MBO?aU(*x!(XKd=ny+Eeg*{f%><wxI@cQl=<20#1
z7IBT)0#<qyY!NaYdj+M(5q4Y>-2a~*3n55rHao8Xs4k&}#jU%fleh_)f{V)}HVb7i
zlc1$W+o1xP8euDZW>y7a?NAEYXFlm<fhskd8FjuxP+=_E8O2!`wUl!)Yie-?DT_)h
zy9{EmByfY%4?^~3r_i)O$TV2I0fGsn*JH{lqXb5#e$4-cVY9!C@W@=iU>e(XL6B`j
z(S$dUE)W)%aXI>8NY15_m<>jg#$lS0jWun$y*n5?re}muiZv6HnLv?p>kRN04S!P!
zYV_Bv*$gA;L9z+X%AhJ^;R}c9y#&m>NmwPv8Gz`<AGmVvLLHX|J+n;5C4kDo#Zjd|
zonp+JoE9l+BEO;!ww_eNTBw<eM@dy_6J_n;sm*5LXwzuTPnjAm;@%8g@U<mXqUOhv
zsh5RFNOh+RP<M)PE30pU;isF4brt4T5X3C0Q5m5&EM%U{C<`<B77zcZUJ9(-Inw9x
zg>4g$#E}pyCC3V%tnQT{TB_}(+QOi#efn4_QB(xZn?V&3wh?6P>XX4G2oEdh_I@&F
zsk2hEnyBQLC1V`bx0Uo#<3F$}W+we&@<_UwG&^K5iW&3MNqS8hP|ko0)1bKy^vA|G
ze*abI=$N1r;UU8P$G?cR%VS+f!1C6-W?tz6=e&g(GcEj1C!@U4Zmp2AK^4xMI<JLk
zOTNjx#*qOFY>{~|G3qv3CTJ*xEkil!L^~A?Rif5=M4|CwvQ}QUDZU8xah_p~7okoW
zam$qK#fVvXAX(A_XIBxgW6V)3nq1A2A?Az`WwTj|4CyejNR|{-O{_^HDlOTj6Ydn_
zelBoN92*BG<J<x#UmI+pFlb>uoH@6uQ=q>XrQbk&s9%Zn6{s;;dWHNZ<ImBR;t&ZO
z;z2XYSzzT4L_$^d@u9g;M+eY}@bKWi4?d1zT@nz-d|j5HHINHI`74`Ike0i0f-mL~
zOr5DvgR&YyO`$*?HIW2gtTLv#GcG|a8DYe4L|W9|CczhpW;|s~Ebzrd>Q}YKZKkH|
z2gJH`ry-EsPU89|z#M7bbgM(9(~)urWT0fllN|Sz?Etu;(#?aTOx_Xau=4$gV---P
zqNGqMK6DFx5W!)jiL-OSejI9qU?nlbWfW%f^hQ{Bl1yTeDr%3>n_5BRb-{jFDRGP`
zZ+YHqcFxd(>@Lc7xt1d(m?Up)sJ|cPWjBrPDfImaJ1#cvKmO-7;re^{0yNIOBQwZ_
zpqFta1j&RIY_iL*`0;w4xW|_OBZ$!0$4}9PGMG6nQHM9^P+oRn>I9j+K<!>L1;T<Y
zEJ>=<pK<O`d33OgziLd(_zGLBLa1sIZyfifY)062MDjg;YXPV8e*qV9V;StP$waH5
zW=wf4(d?QFFo*`0hZRmSXT|oT001BWNkl<ZwyAw}Ew~V@(#=#H>CeP;YSi(8D9kG`
z1L_1sq8H&O7W;8bm7-U((cm~3Zy1_5jqFFoHg002CrOG+L|jT(6#TbRHbLds4|db&
z9s+kF?6{b??}Lw5-)Y3K0cKqwOnjp(7@PnA7PsJ&i%eCP>B?s|^Iid*e4sV6MvRFJ
z>POR%Zm3V|m8?o}ZXBTzbJiR6$Dyd^v#L4J$6ZuwjcMNWU;v+uL9mFxs-J9<)H|*y
zs!Uvbdo>o%BUfNBm4?uK1)6s>oMKFf%UPn~#D2>XG49kQa!ppzAYm0WERqnk7Gz+(
zJbS*xbvZfvkX)`-iuvtDMr;MP)7a>c(_2ET8l9^r?_@maFDgtC_Bj11L$<az*%yz`
znqvlUfpFsw_P~jbd2}K?6uAHRpW8>munyV)Fq3pqZENn5?#4sg5yFL_e5eJITc|W2
zs0${iAF4HC6-1v__<T_i6pd)?yCt15v8P7VAR{BYpdEKc)#D98#?`b!tNgrI;hq}z
z3!^Bn3NULT0m<JDyWgPRq@+VHnu}&(E?m<Rfl`=Y5t1XD@l!$>n1(C5rMu)?;iU-2
z1sIYrkKqYI^WV&H<gxZi*H#n=w$<M-f#!Dt;n8InA;j?t01`pE;Tn@)ly<2^%SwJl
z?^hEfxlJ7AmunZ~6|j=5L0t}ZY==&S2Ol8^MF_%Hk}?s}2wDSxvKfW$jv>KVaBicR
z*|jvk&?lD}whEQks7+h!LG+oOC@C$Z&q+#BzOJQe%d1cXSc*{7j(P;qO}&xEY)Kwo
z*k}~X&c!)39YCI*TPhb9%43LXr-x!AX$sFO>jI%Bph>J|7Rw>oLII?>K(!DWjTLsE
zmvCcIVq0l`oz)7oPz&v_W^7cg2*y?z6=6pmo~3hFdu-1l-@fo7NK~WMk|#7qV5e8c
zoE9XP$ku)gY3--OE3rn*iOr5nj~+hJaq)2f@jnNRpbcnT8UO-s+3~?*2LWE0hl?K?
z(gIjwBRLv#lNmFEa=cz?!v{mMW#%JLNmuu2E-eVT6*b93HHKLxw?<;d4Cqo)xK9(r
zU^+u`5p!J7JO$Iha-bN}HujZkXeBG%Aye*pK;~NgpVJ6Mz=In?;X<&W3XKp|WO9&=
zh9j5(nIm<JB~_C}#Zy^<iLnNduo0KkZU2ib91~3fsTxwXr0H9J0^mGqxzS;ppJ3D#
z*7zA1S0XnxXik~rEfvE8T@;MxPk7(Y`~W)k63XWKrS5{F6X5~JeII-r<7M`s(@Z3C
zkQOEo5&RTFklM4zOUznTy=@cRf*R)xO>_i|%8dV*E2=c=Y5ZuwG26PSGg#AWCN6}S
zNyVVqnqehRCTT>!H<OgB6^j22F<JW2=xL}rXTgxgsoj#IEh&;*v)nAR@qsk8ve*XW
zFd~#9x~+9-!I+eyS}C>Jh#&-nalB4M=sTgVz+hgY6woLhH=r@1>5a+Q9ejdln-4Ha
z>UZSj{#xRCFtekeg!heN&>tR+qz2WM5GN&<C~HSNX}6R+sXgA&F-0fB1CIOu^IyeN
zR@EVLa8TnIU{jbcObwM^Lu^TiH18v3d|^8vxwiYkd}1Q1APf_Tl!-QzS>`Y(Yq}y#
z)M&ifL_k<oF~C+_NK&ejMZU@SH0%gqP=Cv2QYBf^(>@I3gN(rk$`8v48sQCNg_Su&
z%9{tfH;OpRFqb80h@9HAsELrk#q*9<5&C2-$l`tKOK$MKCEY2mHy&8B1tu|LGDZzs
z92Um4sfA2+GIUdVOKYyWWa>8aT)C>`PZqIxlNpYc=QNsA23AwWq7+~S8q5JnaqP`K
zaH3;dbRs;+xbL^0OfSW0x?uu|Q6k>rnE@V{2G4g1fO%#5%>|;_@z{gNE!!Cot~9Qb
zkeDn?SeYR6KC5gk_$l6JgsfE5i;<M;Oh3EAG)~oyAub2f-JYzR{JN#YMd8{p%*G+b
zwBaG>$KM|8bbU`K0I!mEv}`YK$<%Dr9$zmBUzV!XRP(9GtKuRU5uw2xq4a*pzsk6H
zAYbeA;@2(UqRurmLa0$)Z=6#(UO*}?)T^sV)I(W5rh)Zeg`1#*&e(n-D`ik#+V6<9
z0bYVPAzrkQAbNfGy75i_1RWjQpcCOi#{D09vYs4C)m{iM`>#x7G)9?DJK~&g%*L73
zTnMreTgvLG6|)XQO2v|>6a>$s%mj4~EtP;njzL7_mFhOqDt%gFJ3ET(moxZ1rc0P;
zv$<7zCATtFE$$RU^#|xOTV?Hp)fpK=ft-Yqa#FBhF@46lOG(eIishOS9v$Q1<~7UW
zi)55OI4KgBQrW}30*nh8Vl@SzF%_i%1z3X50>oIC0VT`*mVR1s?>QtiMkB4^hOd*K
zJ{j`*Myv&YuVR?(*P|(z<@JR4*qdH8+g!&bMClvzc3fzv9E^8!v4xK6w&xV+ibVOt
ziuJEezP8fjFW}@`5{A4(G^KN&nJkk&i{`3aqrrCU$z@tU!W?~33q&jDU_rf@ot3#T
zFEQ5BabiK!8AP5G#s^1OY8YdvTqwso0n(H$M?|HS6i4s(GU(oZB@>Tya<o?&dzz(a
zpgkqA=qic{7#J(^z3lxFE8AICgvx~#wOF(#7<otQd-2Co&d3NGyKR60S{N_NaK;a)
zl8o7#wB@}zc|xw>Vlg`~>vFR1jI2Kl-*58RbzKp5Y>Q5W2O2u{48Q_|2WwlHpuUAm
zPVH5g&SG}*FC3gFONLC<G-M4X`<7X&P_ZDmSP(rbD=4<JZ6e7**oC<I;8a?RNX}DX
z&4tj*Q_Qf$<`|Nwmq-Mtev<_*v-eWGWTX-2l@er`jEqQ@^jZN}1{=9_2@Pk?s7+FA
zpe(ITswhf1lEEuxVOGydDvQ2juxW6uJ)j+gpkL09Y7c84ANe5RH@szU1#4gi7AcKi
zZH;IKJPo}ao;_+!xiwmE#5XhHRDt>eVaLwsM0j9v|A(Fe09pVRC}!>tPzoeXvBqgh
z1}@G9VCmb{$^o+~vWqVObLm}R)~c+@GFK%U%8dkPXdM;>$%zYDJVGdWn;M_x_Kk1C
z{u(T6U*d`k9<tc1)v9&WRjeYhAlsJrVVq20U{%Z>>-6vWYX}7>B}O1Kocg@5I*wN5
z-UkAJvJwFop^fUjBErs6pb76{tP+YxQ?*q#ST^4dS1W>3IOQvwZrTft_@nwl<7621
z^qeWQQKI%9K=uv<`vH_KyO;O{N~XRWyBzG;5uFGRChq&~C&L!%Ga9QeB8z>DY%f_Z
z)l4VssKz(9A{upJg&;kdjM(-cch#s31^J;-Y+1wE=b)d~n%Yun+nNzw)xNioHLlP0
zwH6fTN$+%JJN0DQ948Wh953&SQqgD(sqj$ZEk@Fd8flQWXs=jsL;-kdgKejSVq+$d
zQ(zoz*qYg-B<o5f%Uh1Hk<n6k_f)#rZbV*gCOHVW`M~zCHakO9X0ZWV>F*ODN|G^;
zUe25low0W;q#uL75QOQ%SF$_yD0&=W$A!iHAO13EUC9r|f~tWA^*MC27$=vC*o?_e
zjCqVuR@Ew6l@SK<x0#GwNGTt1q!`UU6gugp`6~-Sq$!#$K(J-j%&$?d8WMF>nO-F`
zJpl8#K@eof#LV>GTm4LS8)>V0$+c$pqQ+F$UhEt>YEyD^KKK|=O03dln#}XQNWIGM
zrg|FSVuAKUt*<Pm9xIfU<jZCd(b|mB6=n#PQEGeQbu#fZ1ZIVj-iAcpEdel}wOR{c
z0p5~5qJ7~pHJOH|7Ju5kh6NcQy6fM5KRWgxdS;o93y1qY^jGk?OtUgFKwL}&RQ9gq
zk(jM*!j8c%K~6QPkgAzjG8En_z-TH<sL_OD!&S%(hs2KIJ43DuQ7Ogbuc|iCHZOML
zvnqB`wy;HbZxfyC#ghiLig9(gJvp5MfKs5L8YJz^!8SI6K9*Q7^l?+MZtN9)p&SvP
zK%7#RLF9T-R4LzhRXOG~(1)|K3+WZPEWxC^H){s=WVW3Lo4wRVX?h`KDanNJ>`ld6
zz?LshGT^Ea0B8gXA?tGcwGc%dPR)YHuIv7y9p^wN!UGD~?v6<(5%P)K#YdWORYqiM
zUP%<?j(I)-)$A3fDgYs^CLS*EZShQsnOaIZFW50k8l8t!-qeA{RxsOkOY9odF4bfk
z$vok%o*^WI>6HRuY})vVq^8)G+5Bi^VuSfB*-US#TSDom<0zX_w8rHOwNKWbrFNkp
zZFLH**^4a7JSfm_pXv?+EHU+GjfU3%F&Na7hW>=&8u1}JTLlYx3H*xkd$Jp?S=3Y`
zAemZM3<iy)-CztOXo0fS-)j0P$k*;K+Hp>FB0PY&|F^%a6Sq2o64WS~6Roj1wJ&W$
zfDAIH65|^XO1%U~X^sZvhBY%wC@S?A&FrXQ3~<L5)|~|6U0zxfx0tCFG)D@CFwCTA
zU#s~&$ub5&S(s`WGZ7WJg+YaEzRjS(ddemOMtEeNBYFb0WWsrn2xKZySkP>t8Va5p
zkvE4W7<HUOT9kDPoDp!ffiY69N4b-;eUv<Wo@)kRVw^R-NHcl(njTxHw^ftG%_!D;
z>P|Z^9a}+jlgf5a1l|H~VHmW-`d-1w)Zek^(35U=TqxZ4+kfpVf;wYL<}FRNEVU>J
zI9acDyH=xAk`RPN66AM!cu-f?h-l@V`@*!r47m<;zbB-gI6JETt1YVy^G(C*qi>d0
zEoR=_h_k!A925<&l=%L*W$ByE{$U5TFb_^Fm@SqxBwMJfBMMV0!`KVhjx!kQ7)fav
z5*FDR+d-rjri|=NoG;{x+$&0qO|}74W6t2s$hN}-TGz*?>1ModEz3>%v^_@#yuzw3
zXAsP{>okbLD|^276QcFIe(w9u)qcmN0dI9@nT`tuQoATfcd7#-Kq80`I&n|m=$&kW
zD#C!q`4wLGi!k~N?y1wec=$rae>t#0cwyG_McGk}tV$duoK(#Lr%ok<wnWP*W=V|^
zl+GKm74I!DkQ1Cw=!BF(CYZz43u!Pll{iwwba<Meid*obEoCIl$6(#nkJ3X-kd&mL
zDt%gX!QL}?nZ#LQI1JXcqFnB)#g!i~gNV2=bG%r{xbY^S>vsSFYvu&xGfXDD^rBN2
zW&hh4A4PLWMtjI-+e!9(hmB*`ce`lExzUO6pyB=xK4XG!V7S4JV>SeAx<tFF5TH&6
zJk(P;oANUj%o@VAL><yV*+m6e5e7>stwzeU#*-!Wirqoe*8h|mZP%nQt9l$hYBdwh
z)vDC{DR<$Mds34eUM$q|s~;WWvPe#_e$mNoRqKUW#<^XTnXAC|>azM@i%E!XlfTW#
zfE4yyBbqd1kCn}!8Zw=2k9d25h|V;l<l`wnsub^`uQIZo#ll2?b@7?IYFQIW$ja-8
zX9{GL&9H@PjdctJpc7%oZqSMFK;gdQ&lm-!zzHC^;3Eabxu$XJpR6p}3pGsPH4AAn
z$*EH0Fh;q<Cqw-*C`giIUd~bv?wHE#^RJsbBOK6Yw|s6Y(N8ul>PI2YV)~3hk{YIF
zLA_AQsjVDu^K9gTVdbaFEy!hxQ&)N(g+Ue_L4*_+qBm7+a?d0!&j@BL4RV#^`SGn#
zind7>M<2Rep1UNP87s-ob_r?5>8&z2`v)im!b?1!J;hw2UK|Y{E3zd$bG>no8{x%h
z!3JU~<$+`uB~{+DpaH|0H`R%-V>jqTc)&0)){Kpu2*s5E^`=YEtq&CD$j*h3>Bl`J
zlV=Lq8l*cc0H(<XEzB&aljdOI?UhwDLK>_i!FKUC8`h#4yJgm^RR&TDVpD}yOyEkJ
z1w>q`6-Ns0rz&MvSPM<-`63w!(Wf4=*+Mn3rw@}2m~i~yM>*(L46SAAm72b~Q>Z*G
ze>B;UXwmVKXq@vppFC66-vEIC(mSNV$5ngc@p(pjq-pBxid1Y1Co^j!`P`bAwszQZ
zb`$ulJ{yP;wSWeVtZ(i+Qk)M|9hEyjt1Z(4!y=D#C&Imqo^-q8g5drSepTJvRS6YU
zcubWLRON@T<HZ4r={Q7TszZKa3N%!VX4aD;S#1(cGnfxct;XQ&7|d6bo_%XwY-R;w
zvaGf?H)&>oTPVdHRO8R|)j-{3<bTC{Uy=A#!U0_fnvABwcW_KW^!^TzJE6N80XZ2P
z4N*@AWU#Sk<RJ+PtY1yMo5I1t9E~}eL9)%SrJS`v(>DODNZgEpcD*o<r8a0=O;!32
z%5EO*m)~+=8rL)VFat|qnOu!1))&PA2SuG?kQP|w{w2Gqq=^u@Y!&W$PmiPT*cCbv
z9vqzf-1E$C5lxX2ya`?;c0?k=<i2b=N53?SYWiQ+%wA#VOa?SvRdVxVT4>Zr30958
z3@Vzo)K?JQ#z^8Dqm)SbAhO#h;1to)o}H6iZz_HbdZ6&IC$`w_qQPp~&m1vgR!yTo
z>7O|z*;MXkWEx`TR*FiBGoF!LR!C*ETcQ|I{ZC2Dx^*;*kPI(lbHVHrYdQ|FFnoQz
zaIT700bdIgdNv0fB9rx`^sGA58_6F4YEt*X9)mqCRw-?73%&;-NBE$yCNDj*o(ZJv
z=*=!bi{!-XH`39uD|8|}I5_#a)0(m<!pqoJ2NwXq5};jlW<edqqcb3C7W4^{(gbIG
z$zG1+keOtnp3>}!C&xye`&>0@bVM?r+9zX$?6B%&XAz0p$;7sPQ=UoAZkYx>VA9B@
zX@n1LwN6Gxkk-1k=`n(y#?#T5sX47vHXsm`-e?4kdLd^=7w%=NejLebSIoRQD8ij%
zk)*atNd}0*Mp}}Hw?sv92_op|$AGY&VlM>w1;l-D@&Lkqdp>a4Lg8s_u?1{tmG~K~
zftR`rIg9}3oTXh6cI*;+C7!Y4JV4}Nk?ocS-Q1Ol?Vpxo0Up3&dK$rlrJ<48cCgLO
zJ;Z`-p^?%Dq_0C;sE4HGd<fPDFSqT^b(LrVtN|l<jB3year#_e#qSZ-%_4aWF+s~Q
zEl&+X@2Dx4VUgU>w2ooT1j=ag+UeB)$wL83Nv@%F9kvSDTPJ^zmdgq#aO*1(XuvRH
zSYTW;MO!dXA`;6~Fi1OF;4KiRNb^iQ!mL}sQVqqqrvF6&FTq>D3RHj<cnPeOKB?HR
za78HO?UT3WFBaUC69FhuBJU66PBFzsC4Ni*VORiLz$W-C_zcSPD5tUdI+ou+d43Xf
zc#!evqmSNv^Ube%)vI3jy4T%)`|XcE{`gC%x!s{FuDF6G_=~^z3psk{op&~e&YU^3
z%U+eO^^5;+c33(Q9vs~Fz*mh0Ws7q#6HDL(6N<4#(Le-dVjgM|a$Zb?;cVBkAS%wN
zhy)WhbtW59`Zuc29pXbnjkM6he7TAaQ-jmLsSf8i0}NHqD|QFxLuJC6%8Mgtp}Z(-
zRFs&Ehm>e0k)Kl_yEmqvlokt_xvZF%k(w@~5>yU~os&p1jnTM9!>BYVT*52xrf`Yg
z0NHJ5Kz~6Insf?;SyPR%;I_&#A+`cqfrKN^DotV~r|Ul%{Wz;(L;x$V41&z3rX3ly
zgdT;SIIN{N08S&r05FUgHtxFf2hZRCxArt1dg!5J$Bw=6jc@$e$3Axa_;CO?+;GDe
zzxc%$Rda_!fAS}P@?^sC<HukA@|S<xw|$$m`NR`X+;!Joxx)JT`fhtwhD-2o4z_I2
zvCnbxv#0;XzkUXQ+s#xOa50;nRFnhBd9s3ffhIY_Q8{K|)(H`2DTOHp*uqt|D7rxL
z6)Cs_A=Io{O^fMo{gvXgEjQ{+9SzP^CaZ>+!C^*4V!LHK-TFyDA|Z1N_4_4@Ak4ve
zVeWGZEEWafbw)5I!Q(P+5#q_!Swjjg^!DAeG<;K)#X*sA+dWYucEa^&iA@>9qFxDB
z&Kb9vCY1qjEKKGe`YVyzx6{TZabKkO0`nh^*9GbO3cO0T(y`jGY4v<XfdmZe7&ZWW
z>c9NUL*g=e?X}n5cH3?D-g~cnW#-#&zrB?5(T{#~_ceFl$ZfaX_L|qc=Kb$~zkI#=
z>Z?Ee;Sb+(%PlXVS1<pW-}`27{>9_}edtH0g?)|ifZ*gGpK)sAYEI;st)v9-<+r+x
zu+G`pWDyZkTC^>pIyM%}lNu!&^}_hu6l!n7&(!<HsItH`a5oTm1@mgryC|*uXcgVx
zbhznPnuUFoNQpJo_x052Ez5dgQiqgzktgeg&Do5y;--5ZJPra@iFi;&7J3UJG=~A~
zq5ZZ(%pUe$s=<uFN*Hmb_z<L@j4$s+EGgodw!f^U{37jVNydnSB}Rw6XV{Ml_Uz=g
z_02;hcn+i7OfMw>jTn#mz#bA7eBp%`zVL-F{O<4mu9pze9e3RE?sva?_ceFl$kR_h
z{rkWF`)=g?+Sk7Jw}1P$uYdjPUvjVZ2s#lS5S;wu(<n02Cl-{qY@Myr<Wz;_wLE}y
zc47r)vP4`u%Y#sCdLxO+o3JD63qGNWws!t#%l)|XR#hw$c7&!?SR@A!50fyl$Q(=`
z)aXn{X+&%;wnKJlcY+P|LqMH{2S(mB;iu7VmNAO&Qi;B~wyRbXy;IIH*_4_!nN^ld
zG+HG7y-o6$LEjRF5m=xUjS1w)o&yGWX>SswT$JJhqds!%;1q1bXzw&yO<Yn}AwBhp
znCEA3KdV=lP#|(6KGbRp%{glhkDJW1&pr#_>Z`BLg;!m5)pO51xBHsAZ{!0X_`o~f
z@s4Y*xkkP|@x&9uFueA)uYK;h=QcJruDIfg7u74?THF1dUQl!*JRmsv$4g+H*}?}^
z`8kpJ<dN-KTpzN}`JjH!QELR~_Pi`PDwT3ZpQFt>#t|l1T_QV?I&Wmu)RNEL#+E-x
zd*%lQ+l|(ircl&`D+84kp>u!JBh`F1q;P#EQYRTkIa`dgk<gCHNNNS!7hbx@1-#O&
z9<m3iJ`T<~#`NNiqAkl>!us|7cHD8)NM#scHei-_rm_q(bynTvBV*~k=gH6d#%Uaw
zt*2DKVHlh03x>o?cm~k{5RaJY?kG}!6C}3KBQXm8WDW<mwzdEqIZ{QYUv}AL%jI(S
zHFw#_^Upv3;SYcKBOm#Qmpt*r6B`>F*IjqrpZ(dN0l4<sYae*vfw#W(t-EZHmz@YZ
z&L2+x@fp^9$750t#VlYoxWrtaEtE5+PBR7Okm{5*EltD&u=44ZMa*fl3}UJbmD3<a
zwy?g5tuktDLv_*VmQP(f<h#_JgDB6KDi)bby2i98{ynic5oB`@<k)k7sM;c!eMOV%
z%m&s0HBPSSoem%_tQ$5NN7lEJdIj6RPzfzwXxwI5SX;|1?{{ON^x>Q8otK2*>U85~
z%-NpUox<J~a<GIKRV-+tKSUmZiUw(rg-%MaygWPGz7f3H3c*BycfIEa=DXMNP2hKa
z=Xb8S;)+{uz12&;^rbHWc+Y#@^J72uV`tBvJ%0T7v17+R_qorlt?d<t+a)>?9t52D
zqqDX10%Cs#-@nwCbMjmmMmU}*7=OjCS+Lj~m#uaUJ8C(pPYr{8zGF^WB@+U%8_=R%
z=h|)QF)7ZbPV~oWxZ<NYqI59;Ok%wxB%@`@AXC|s9fOWu43tmu>5W8ggr$;|SIcaO
zxPI8X1(|IVgb|Wi6p)B`ugPuNZq=7|Zb3zXaUu5S$gpHL@rGm%bRh6T?|ranNCpwd
zu20TDo?QWn1)ceFA_6b>cP6%{2>_#MZrMA`RxAA{BdOF}C2I--efoF(++necUQ96a
z```cm_q^vl;}`<{o_p@O^UgcJ<2$}XzW&;;{o2>Q_O)OA)nEP1-~7!>)XkTOPJ{;n
zjEE2bfT@7+1Yj~L59v&3&4vPVM0Ue=)hoW7!Iffj>Qeoe`Il^#^oELQ%8DAT6ZtOu
zh!hV-PMM>~ZcwII&rlPqTt*t{oq#zd>}1dgiN7PKGxxKdM7~!`u)bzyyE#ravbXHx
zLL7;h^IWb~OQIG4BZd(GhIK$vau;yHV2hnuTMa7asvHEZ9F!qinW@v6+qn>?6io$2
zCOKIjEk=hWcK?Xy>z9iXsu_{prCC{%Y@2Ay;FI1c^u}lnG@zWdo@|*;9d&JZ8?kyI
zv9YlM;Q8mDKYH}27oI+STFQ4>b2p8gIC0{sr=I$$pZclX=4F>%<}4`qiJ$n1cfIRf
zyX{rqn789R;^b#G{U^nq=|B7h4Jve+se;pABoQXxta8XL<B=?Y;G%6dHyi6k31J%x
z$T}IPo<!^&Cw3%nDO%1K$~<foSRJK&v!ZHZ?nYagZB8eGy1K}@Ln9d{*O%`u1Yx%V
zCrIM7ZH3W7{ZKsmuvLnP>(U}llFgXd=+k=$W4LN{)7eW43H~<YO3sv`i#+WZLb?%&
zQCU-i7GHB^y#>FtKegaU0?Zbzy&5<>5c6vCkR_s&Y-2?mdBqAuG#<I@=MIrw^vWx*
z1n|r=&%EIcZ}7rrpMAD*RN1-aZW{Tm-}<fFZ@>MOuY9GKJo)64Kk_3#^7+qy{#(A~
zTfFe>*|SHE9NA^B_Rhw<dxelYz8ReS%$5bqFEytcqX{18;(_!z#+=lxRO0Ai|1{=(
zNOAOjA}qF@CWojh2jUV)ar$i#y(gwgg^+Nu1+V~Xq(AFFssrJ*SM04tR)GObD1IRV
z5Bjx`j1NjW)cmy^J$l_j>@7&JKdph*F>GMi0IgY{<y;%;FpyG=KuHfG?3twh3Tqg?
zNl^P|qphb8aS8~uz_5;S9peVZ4UFp;)_7c-ETI8luq1^k#=jiG%eAUzkg<1^_+bAe
z!jB4Brgj<zq5;Ezae-kC<2r@`L>N+BX%4H`@O;v0atXDRuIel^3yeo>V+t?KogZm&
zlom&iG^y@8001BWNkl<ZUH|F}|9`kWgri4~zU3`%$qp>c{NRHRzU^&q1F*Td`P5TS
zowMf7jR5$|zx>NjeBu*7|MNeeFa7%0zkX|L>wyOz$Y&ite*C7JZaQa!dktL??t7g0
z%qABybLfnNh)#R}l0=d!R9w^5R?w*9(!`pQ@VGVr!)=w(UUVbk!%*uwG80^*5(%{d
z&8}-bVYY0RW?YTCiylz4=GRObHq4=6Bh_AI1(PkPDu`S*WosiD<uC>^LDra3Df;Zn
zOvl{U8XHq;rc$&q_*3Prj;RAMVjPJnjN&WVM1G}9jN~F75dy)c<ka*@cE`5PDuwEs
zL)HgE8b~*OvP9Hq<D=f7`)Y|P)osXTG1h$RO8x}Mav-HAOzL0igESnWK^+utyzW&v
zWVr9X`);}AmeZ$Czw@2%+}zxJ@WBT^{_&4L^2j3qo__l2Yp%J*J*{`Bxx*m<ANarr
zZn)uwYp=aFUzdm;c;JC|z3W|H{pweL{KtR%`RAX1;DHBDoH+5PfBL8AY;dokE5dz`
zlaFqy*E{n>C%L?sl!Fkt*1+%-ok@ZKNz9G*uSs&|%4U*lO)J!=RI+co@^P-5T%j_P
zb_NUZ2&@6?z=$&F<%%ddauLa)4u@L&W&Jm#RHaExmh`n${gIaKLZn&iL>XfZv<_Ow
za0J5<(7L5z6G}h~9lMCkPcYeW_3Nq@-&ql&N;DI75{3n6fyEK5zZ~l?$Ko=KYZz@0
zTg{`k0<S>D7DrtIO8#)EV^Y#}q?@(LEUqY^LRtK|tQ-am1BMaf8paVIB}>zSdKMMk
zVs|vldA!AKg%%t(Xzg+ukN7YgyY5iL(P!Lz^Ua_9<R>3{?6F&Kz4eYe?)b`AzVh(H
z4_|-%^)IUC4u@WN;e`)<=tIBo3%@XJ@YY*z{nV#E_4&_#{)d0~hkx=Xe{y|&{R?0C
z!mD5X>KE0ky?~x#ZQtYGfB%hp|HIcOOD1f~R4Mq3(rS(GwhE-2GN~qt9ru<g)y&>5
zd6MGPft<t4E)-eNe4WW;5HTS;j+D5Ht1oMTd}8&E`E`AchFkM;0yfq&@-0NKytkI5
zEy@v7e^Zz_!&+CZlt(xM4!M<#oLa6Pglttmmy9jMBG*chs+4cSO}=1R#e;esMp>!M
zDl71+CQ;I#PVwey!Rm$td8^8evkg-??NIczvOthZLv~>q`!#aD=xPg8Knog<RO!}0
z0Ja|cSLoO$IP#;Pz4#YB^LsO7+)bnV9w#2%1e^P~JKDihkR$`4Y{l-IiNj{DJa5W$
zY_CVb17<iiZm{XhUF4k)*g7yx{S_9}+P+6dK~)4rPEeMtn(Tj^i;8a6qlP;RTK8O_
z`qzDhnC(M03r_!XKFY@5K>7-O;n4BSo|y!|HtE$(9EtKBS*{ti%b2fk-W0xY<=>QT
zp=3hPM+RxwoI<J!b1Wz<J6LqT##WdGRkrZu63>H)-9+g>2H)yZZ@l)YNl(kijoE%Y
z@TUfVFbv^1rN1aK)9OWeAR3Qq%w;tu{Jx+4K6G@vcyuD%_c;0KP5bCGop0ajQ<cpZ
zCDWKqAwHwUp&As6Tb3h4SaJ07YHp>$!p1pKi`1D~<6Wtw*^rCa$iT2vr2bdtSxR&6
zpuu(w3k@`qsKUA}9J`{%?37~C&SrcNduBDN#?c*Xjpr%{R9H{iaZITO$X{HPBiw4L
z6;>MjzywQ|kRG%rpyBpNP$17}{YD7J<EvYu5#tCj1{ql4MaclSA{!iQ#!RwF@utst
z-@#0cHkk7B)78YBN6p_q?BQa-FcQ`)1`YX*W7l0dx!;bCbE6aC{ztPEB)iH{{bV)R
zYnf*aR9_maT(+|{CM-ELNc2I>c?1oX4=QzrgK5yAntA;a7*jW_eRZZto+}JZ(+ud<
z+2u&y9@gFlw6f2q6!fD6Ifeq(v?nX$u@v9N2yYSV5QXkZ1L>F0=Tbtt`JL(W@<cNp
ztJu)(2wEg#>PqwHsXi-Kzj~r3NttKHIce;M0x|dYlPf4MQaq^DSv}D|P&GcajP}0y
zGlF~6C<TJFLRR)be3ms%x%aG$)4xNwK-h6!(1~z=<HV;ot0_$PR;9VRC8;#64WME;
zLfu_uTU1fk9t=99b0{e#hL$er?i}eD8l)R(kRCcjx*GvWLAq;TD3uyg8YJZze4dZ*
zFL?KLosZ}2v({O0pS|zBmT<o|W0!&CY~V8!9+;GRsaSIW3~Cv@Vi+nEZAq#s+Aox*
z^BfRsTd#H2>jIGmtaI!#XX$<<;sif<jPQ0Ud6FLZa*a<D55MST*i#0d&*xwZP@+Mb
zF62HxA&SOm8282Rz(7s%{=mJNZ!bf?_|np;(Jw(R$Ha9E0uC=V#Wv5R;;bSB7}sZO
z1{ky@1)TU_kP{N3!tR3~7~s702Yr&D?QY}t)y;6>t|J>fjjLZh5^8O$u7NJ6v)Knt
zeMaA6`kZuC932i=!ULmTC|N;L!B+Q;H#NASw69>!hEr;`^;2*OW??;^oSOdf$~sy!
zL9S&#DBWE8PV&`gWw7t0S?8v|{H<xq@E8#)Y|Qs`A!Mrmc&C2bEIak>Q^tAinyn%+
ziwt`{UBPVS>PqZj2p}{9ht&WLgSa{aU^vc@aWP<2?5&DfwD;7eIAfwX3C#TjoR+m}
z)KK)^cP<4r3|+ALLwBV#?O2pqQwz%z-C<?S`^71Ap#ti!z+0>iy<QR_{6n{^qCOiw
zH+LcVU~A1!(@}q4t8fjDlMN*zIF&66cpwEFwdD@!UZ9bJgcRqcN*rQ2*%Ug;9ydoz
z*5<<uIBS%gv&yLj1u=fqD=MQ_r?d=mY25>A9zqlx{T1rM4CmLkF1j`v)`xZuv&#UZ
z=-XT6JUzwRh&xVihJ2E7_2x~NPS@(@!WTJTO6K`I8Kxm&5pc0|lw(X8bMctABHU1#
zr#gzOx`uL7=oA97-+^jcDci@~Q&J;GH*XdW;Mei-j?@3Ftel+_#Rl57HndU9#zHo8
zZhJdlka@F`n6VAqaR{$}J<U@#?>QfTI{$)P@yq)mIir_S+#VRN)(FpX7Hn&`dLxj}
zoKhkN<`-5HBcIc(o)FXZB3vj-k|*j;jh|WVOX2!G{9cctLo2KAv?3`(I?j>G<i&o@
zS6ue%t&6f#%ZwOVu}05J{K1K}ggj5J+fw9v(qg^Lu&nfKh3B#~3Z4ba#wzOddb1cs
zld3e?V=F8Ls6(cL_$`0)>>eu3=l$ut_47I~kQ-Fpk#6mFU7sU2tu!Qz;p?z^cX%|5
zu;F6G>kUoO^htKw?Cr<1u`f0L-tgu6*-^wuK0oUGY@3F6B_G>*$U7`UlhDWv=n+KY
zdZ#kjMGkx3N~Ba&q4E`phO)nUr~n~|K2xpGwf+`&APH;MM`qmjOTj4$>{r;YAz#ai
zrd79*A2euNE~4Vb60~d(`3D<j60O(2oIs77KB9Dcf_#Fz`jrq^3I^c2?*(OI)thAC
z6d^7|T!ong3#|bEW4a1Sh43Yf_ZPjYMbXcJG#h>8<IqyoJOPi(zH%O0W8h4aJ-R3t
zSI{t#A#p=`sbcZ#oS|fG%_>UciJOFyEkUlPc4*ZQYuO(C@)<vVYlG?uK@1Ud6zh$N
zXgXg)^c&*(>w)kkuw9I%!kG^J`La;Cp~sM$S$c&9jEuX_3EOC<^4tiCMm`jKt2;-E
zPD*g2UC9W(OQ9Uzsh;nn5{K@hGG+E@r36q_%#dhHmq~K33%qTf)c#NmuuLP({Sbj;
zYWA1!#B0A%JU;$D;=;>+ciqJO46n<^5Kg=%HlX5c(!Kk8-|HzrHAl$pG>M0H<&4s#
zwqY1xho{YL51%gSV}VIXvc7jiHafL7jXk5-o=J(--lDL@;<4Z0aIYBtLA02NFwv8r
z*squd`?<h~ppD_4MzJ}=*}TZ^^zjWpX-)Ta1S`ZCapcW4DwYu6wO3JQ2nt_M*IT>$
zSz+AJJwxe-^Rq2*+*@n03J=5Z&pD2@Bdn9bQxGFPDQ{P-I%%G$ml)T@ua^=gQ#U4&
z2sYDQa?Y;8JJk>LONuv`Z8PX}FYsVIlA{|kc>Tzy3(5WwxLMMItV{LBuNL5PRQn(r
zOqeI;hP1+L0Rk**lCuKKh0V6QhSvT9(|JO%E&QPtZ<&UKY5r(O1;#3nq=uU!0+Ntb
z*%;+xBN8IDaq>J3CIi8s@-Gn?Y36_vWcYGYU}?TR7F&o6(5abZ2O@56yv!Ag`Jh8p
zG;kAhGT3+I3Bca~_?bOf)SeKP7mDA?9N6^p8aIu|vF7hGD_f=5@%N^Gxl}Sh#?58r
z5)GlIsC;p8Wb+q;iS7<H?i<;EUH$sw<4Hr2KkkHH4<jv4<jqf>U%RZ&+60doWsdDJ
zNj>3TPo#edaU1JTqeAzQ9wr(nQ>E4l&ZT+7O5V^jdGoe;WXNNiG81mhjy`^y3wHjD
zI+ONoMR>p)AOFd88@!H@8OM{M^OoOXT0mGyR(}E|y(q<d8agyK$bIut!I@67K%wEb
zaMEAvtn5N;7Dl1K@bh!Jm4U&gm6hChSs?FqXh3Zs@osFzjJhBGs5cWKD~|+nSHvH>
zV;>fYJMr<)U3)D`#+dk`Bp2z;vn&<2V70bQqp@3FMw*B+aCxg?sPvn$?eGKE*y1pT
z%HuAAJd4!nQMcP7cD>5b_p-A%4<mfc`S*$r;9Qo)eQg4kL;AFxbN;g}#KZ{A3QmTS
z=$!m(cFZ%@uw0l(`1x0E52l`B$LAHBty5>oqnOV;{3IQdt!NYQp^H*lw|425ZvFNH
zqTLbR9w@d4RnNAuDUA~TatdA2&HufA_<BXUdXx8)kNrT}8=fz#P5g01ISzKPVpy+S
zSQbCs>q051h-Rp=7@fIZY0}SU%A~EToj&<mmfb)XA<6;I$RM=%ir_lse~+1ViuLtr
zyt9i&^)Y$9ib36VqAeeBgmLvmR>Lp;NCw##QFvcVblnE$cIo;I##uEs+KjBgN?Brf
z9pU2dxr$qtc!$}?<g_2q33AZU8q<WA>G0`Lrp7aEQDTp7cNczM@cfL64~Xh~8@9^p
z3+Hl{PVJYmT+ZrV!b+B?0xmi#e3S?shs!GYCVP*!c0>3JeVUuyfr@fQ>SQNypZ=Y=
zq)W^aeGe_{lT@AjikH#kBJ8DcooLdH2PAz%(uFM%^GoFy_w%oLUhSi^%xcxB(?~V<
z^)B_by?SS4zUiPsoL@FGo5SvSK%Xz!NXc1hDFF~TRIR9o)`Mtn^?ai2+l0fyZcZ?*
zWGvT0-KN@8-G57*6^^W0VDqvCC)w;FQ7)0Y47{G5Np=pq<#V!{xq=Sw1Y19whXeFo
z1=URnhgTB?>%Mk$w^JW<SthdRSp7&b<DJD<C$o%{9TTjYj6RFt^51XwI8{JNM-)(3
ziDRiQFk^8RS6-IB#tHq&n7J`E3TUdA3aHVYF*POj`KoPv6tmRp747enrY#S$m($-Q
z7@tuJq64s|C@f#HFa@{0bAK>DV(C>41Ge{fcK_uAFpJ%XgtIS!GaZwOVFqS09>&X|
z&&>=I_W*c$bfKtWP0E~aZYx8h%Y`;~yWkEvYHS`@wvG+&kZnIKv2qzX^ObSqGbyya
z%q8c&K9*39^vS=mO3x->$jR5xyL@-B56oW9;&c>d>{x2FwNqKuEuP*4f8VRJB(%aP
zTZmwmmRJ0sc{mzol(#G0YEpkW-`(|SpJVnV;m8GDV@zHLE=r9Li4bD{{u+hnhbv6l
z%#C-vGxaB5*4%YRzUrLdd?$ib=Afh3elMqT7k*_&(qyIdgh8a9u1>d+|Jj(YJ$vZk
z9o<E>;i+=^@%=07n(XDw+45B2m#|`?L>lSj*a;gRA9IW^7kt1ay3U49L9P#aY{T-R
ztgirUmV#4zFK9=@&b#vd9(GBz2Gw7_odn-~bh@8zQNg;UFdI~o3}b%+>Am)#R*o$`
zJc_mk8+q#<%CDCwPMpS<lynH3KGn~r7MvJH43{PIMcUTHm;511=pYzqHlbY($z(Tv
zPbomBXJ0^@=;@X084#@z@>-Mg=N;NkF5*I_`<Y1iD~I~T;aW;BE(2ZZuJInse3}u>
zTa)J3t`1UhvyA61GJZsspZ4KuW|VN}P!zT(66G3nMr+qO%L;JI{LeMv3Boq|1Azz5
zmld0VjjMDOnRR4lyqB<)cZ}^!x*BMK^L7LJhQobqsVpBwis^S1QZpT7B~?f5)us*b
z=lk9{*bosn|EjaJh6xnXYAC@G>H)kqu}Y`z11S`8Zj<=C^L>mu;a7LDlK8#?)#`&v
zSK;Tse!Yqu^OA4JdjZLR4K;u!omMQ%;Gtf|(;rB~UCq|ar{5P~?m_x9==5#^+I3{r
zW6W7Ev{i*vwC<ryEh)N4)<=G=p9+hjK^>PNg&%&!sl$7R4C@H2S6_5Zh?={|)<_mb
zjLxk1e8Hp>R30#@t&@T&F#7NC6jH}%SL;HInA<GsirHUtXjXcJUR)ERFHOyEK=<rp
z;P}qnRJ?~l`)!Vedhxo}zs?+gWzzFHeM^{0yJ>)tn9GzJ-5Pqls>zUkPa)z6=rMPT
z-yYozrh%k2ww)YKrR@xrW`T9boXaNZMO~z29xrRjom>mY7^<do+NqA6a7DT_nrWJf
z7P9m7Pu`cSPMh+h{Kneh{0>g|RzTTPE){F!nK0Q2&31J#mnZo%$@G(^Jf{*TTU-fX
ztcED{qFZRv*r%Mlk|P~%4A!FlIOiKVo`pTQ9E+dTpJ=4Zk`hC6%1qGKkcf;~bvP|%
zoJmDq>+bx4XW+HRl+ji;Szzo$&1*0Jki4~imbI*50!ey!lqhRvh9CxP9b7Qk^sa!*
zAoa2llj~U=ABdaH>03lUrDVakbMmOh)ZLdgNl6ME(?0G4?Mv7t0T(K37qZ+Sezgi&
z*q0>|3J>|S%CDWga<hehbKTwj33p1S<2yqLODA&tHyzex0Nf}fspv5Gy~`PeG5SP2
z@@2jVv6hW+#@Q9gaZWOliRh%dif<md?os;8N4u}IgzfCn9sf=QviN%8>kBSSHYdLQ
zt6TbVqJVAc&NF$K_t&^)PJ9umkB<1~n{$2IF?Yzjd>N9ED&=ysaHE7D!SVO8{n-zP
zNQ`&gU6VuNNq+z@6mZ=;7}l}@bZx)+iy|>jUiZBBAi@G6ebqq~m@uchGY}#n^Yqwd
zfY+~O-!a2Q)7WDJI67NHrd0#OYq#v#-37&v?yLH~6hw1amp?7mMf+;!U~X;a8HwJ$
zbi_nKZf{hUV@WTDPp1T2lcMXL?7#uul7D=2|MO$e^j02{P<SK_uNOC!ooi$wQA%BB
zu=dFu-*3g@9T~%Dm@8c<C`E|#Nlv(!y|p0J9X+kYnE4~|ZFjdP$}JtftA0$cjZpPT
z@?;n#Yr0|Sm*ge34&8!Y)fnrFlqxH{a<F3`I(;Fh9QL^b)^TKG?6%O}9pF109}w36
z=i$D;d*@WG+vC563<RMdfz%dyLU!XYAuP5`GN#KCJ~qDcI-yzW)D30kGO}hvK<8ql
ztB{TfKSq{1t{a<vx6JWlQK_8gtjo*?8BBf}PXPv+b=9hL<*$`KaV`UVs6Nl}H>Isc
z)2Q)#l#^!p$`ycJ(}xSFIb=;vg#ttK?SNn%YE$cm#8|ui=-<!<WbTuG%zZ~@vf7V8
z+gYzdThKsr7roP^(zJ0(;0sCH=iw(ql+%q;PRIk+6}`KW3SXKS6t)HafN7eKLQm;A
zp}983SEpkXW=-VGWwkH-CG09~{eQtB^r7ivfEZL&1|tYlZzN4C0-kO10cj4Mh3LZg
zo>aU|vf7NjLLXxSn`uLJ$*rN~Jp1mB3C(5{S|6(kM=sgOXiAz#SW2(mCi_EX@t~fb
zn=(Ok@S0ryTger^C_^m%<q>-K!5-h(A{<$|CDUPmo_@c3!T0LPuIIp8Dr8m?;y?wn
z&3CZ;;_bF!9Bz~<eO-&|N>5D|l;|c~EqQ-l;$lOR^B|!!Tw~z!iPVh_y?CqNr6BWD
zwm}`fcZx2_?C$%GCJBm9ysc6-_NgRuW88p|`Zt~HYj}Ymp-aJmpc_2Whk{B_;Am4_
zEm9)OmGjHE>>phpI$FzQwK2Ax)3AS6Ct{@Np#;P@l~r-rK;;BelK9T?Y6!Oa%Gl6e
z>AoNzA>5XiRRpK+WYHRhdxksT;teIm1Gqk>W9qNy$Tz=_)r-_NVaxHfrk3dhseZMD
zq7bv0*EcjRU3L@X>w|Efe0%bYbM*=_+7g5S0zni=v2pQ3NPqeX2KxowQy$m#+gUTW
z3df`pzTiTXuZU4D3z9!0)h$_27gKE6&5}4?#|Ek@&7fVhn?2a&|M`(O97%3WlvOzO
zr7imi5=n;K9ULR%h{Sm^V`H$%DrtM;#N~29Z@&Csx29f=+dBrwb~#xo0s^<6uktQU
zqm=23VAWA*81a;_2W-7~a=(-G5s)QuQIfRyKKp)kiCk~xu#ZXJRa4C7d2uGm9-eFU
zq8+cJmROjVa%}P+pQ=IT(Qdjsh_$Et(p2_BMEJbNXuKLQXtjPnzPZ%>;LQPW7Q);c
zA5Sg-s=(J_4p7WX5}&pFT5pY2aaHBm*Y_(7N&qtN<q{0SnX3Esb;ps?xG#2J1q`Wq
zIFbFv#HPfu#UJG5WLCwW?I1yEUZ4UVvb%bomT=#gsU>ttIdCKxZ~|((nHl{DYlJ4^
zMxtT{uD0vRbpiS;o&JBGE*dfLaZkGO<g|1eS6w?3G(XV$xW?mdXIE&y4@o0T^p4+G
zVrybZ1I)g|*{_!v;?Gb9#J}@8*P`+Ly%__%#oM4XZoMLXcYlPOA|S4=aAT$QR?ip(
z+1TI-9Z7&|QgSxN+!*P8NCB}Ub)Ked4%{CxuscwcBvf(LU?vnvuhd$`Wx`Z7kELPt
zGs0oV4Av(%l#bzL7jyBW(rb5<ceJnB#}dgbUK?8XnX~@UXDdzD2^2lp4;Q#ZI1&98
znB0+uPoJzOifHhFPDQ&<aGI!jZ+_CYZ8~b5nKaPbU7K!k8Y_6pV>ulYmKVHv_R4(3
zteGSeI(-%0V5H^U!#P|+NbFT13O5{LE%YRY)lqbngV2s=<qDGc@?$G)Xo@9yCa#d&
zPR~ong2IjB!faV#p$X<NQk&Q^v&k{bRu$Ys|8>u;)DKPX!m{1gay({iWAi%h>Dco<
z<LdH@9k{Clguio-rD>IX&}Oma`Qh$!dsqH&mu0aq$#&*`AdFor?sllSO}SP6a`q7)
z14&=N*3H?%_+HsIiJVyI7zflmxz5I0W_vU6NfFLY+ALS9fH;5qg?BGn`HLlFdCm%%
z5*+!hwnEHS39^=M?9KbOHk>oW>n*y?yjKzZ-4Gw&07G~*^3%|pO%TGSm@J;Yu8&fb
zn~0J3GIE?9`ZB)v+Egnl<_ALTbAhoq1!aI`TPmi7_WbOstF=6D=1tFY7P9y`!>Qiu
z56Bhg%kqSC6=qx{FUHfI%2PSEY{IgvzreM(O1~;)z3)3A@xwTgd3pyN%xcnP%TIy@
zv(>Il$r2;I=m&Vj;>*!4XVceWaRXL7wzs@i1);1B7UJedFU-8sc6VBNUzAdww0@w_
z5Y6enXhqp0vT{iJxcD+c6Sk?#vz-myiJOfvS2u#Xk8^NsNGc9T&v8`L2qTU{%{w3-
zs3x?$KPg*6WZxqT!vz4ojb={W#@~MwJ>x`%XZHgP{V>!i-vWL~A|W4_)6JsXvI%iY
z4BIWi2HsK)P_2<uhvvT0X1JOMBVUqYDDQzs8MZAhn+IOR!5(4DsM4;-V2|V?Yx!xL
zZBwB|tp%mpoMTI4M(aS6STUhrx&J34^)cCn<}HU&nT{XKB$Ys`PG%xX&fx-6*oWs3
zlp;PkW1n2{t6Dvp+x*Pno%s8xHQ{t*xZMKTY??fVfPjdls4UzjCvM)gexIM2<hY}$
zEnb$@1kbdw!qC|TFKRW?H4N}`HuVbm7Eh&ml(aGdb-sJ;OE<t<lE>sAH1V|gL^{_4
z+LL3PbCR1m>#2ja>$a*d_Ds<eCfl#rac75!0SxtaWc0wKeGVey?|MS@@;5#siP~~<
zgV%$XYj;}gLqng+mTyxgzPzZ(uRbc}m7>L7hNyh%`!#3~jBobpTSd9+0?0V<56GCy
z%W1Hy?>Orc-{e_J_a_X~-xJ(GAR3ymZ-F6Wyn5WRbZVbn^%3^q_VMDdf_eatRMGrz
zafDaaJYgsQ*2sK{zRK`eekSN^HL}*&x5irObikt&xNO#<8q6JJC}d#L=8hr69znRu
zw}=xk(6=XZ0KJb|@uxZvB{cJ`o8H~NapoIgT(ZaSvBA0CSKi31mWwh~@-_1huzGf-
zZ+%_5Nk;g4(UisB#(lf_+r@t4gj4OOe|v)3PfJ>y4)!jEE}up?=Pk#aJ}LC~VX`j#
zr-+G9W!h&3#^Cc~4AqMy5vvYe1rKW+4OW#FQ8#T1&JmM~O*=Hq@0FnE_+raQrz+e4
z!{?)f2!kQ}k=4dUn{rxq)Wu)jmq}j9+c!G~c#s2rHExa829*Dqt0(0G2VlTU@5W<4
zbpD%670$1B#qWA<{hJCfKkjYDx269!tRn`P1+o4}^*K0w@JI9CNSgK=krlPUPm+&T
z5+4wa4B@}ckB6}<k~!F+TQ9N_$T}**5fKYKM8^gIuZJ08uLn)FmVnQ7UQsT!MZWtx
zJ8;s+nC$w;5A^U|4Loe(Gfoq@KH?X6eTuw@->lZrRi*z`kQQkT&OA5C*T!L~ys6^K
zWwo_QW69RYx1bcc*(rSU)Bmi}_@d&m;Y!QTz}pQZ9hJcDuq){dwTtKhG4)RsjO!&W
z&MWsn`aV9q^}&D6LiJ2H<VWiZo>n4+%rA;$0N`n$g0!Tzj*?$AQD*dLvd?hUEf28W
zY~F6^LnM;c39q+s_TQiszpPI{?(|cA!+EoE+z$#ok%6rQyxhhI@2o#$|5kVt=jrYa
zez9`9{}Yg};`a7s#s?U05RRFp7x~tBN-QPdVJ)b8uVf<J?UAeH-2S`S@2FF+i~H<%
z%THs)>m51qwtu8Ik&v1W7bK(lZ+qsyzzZa$Lb!$!mNp|-YH`LmI1~@UI53y!?m^;z
za!E@oZ?Qlf$GxM*mkp(Pfj8}4tTRdC=TmS072v<y0v$CVplV`YM`b5Km$>+sV@Pj6
zJ}~(fCkuf{brcAiS|!ler7pWy36K*(7O4T$bhVw9cJ5VFKC+8e7mxy?5&!dJ4*q|5
zr<V}cS0J%*rLbp`6@TdC;OK}V@V<zf;vZ4Xs=fX@?jw`)y1z=Go#8PDPP;}=Bcua1
zmA|y2pTm0Mv0@&R3D6IHILcR$jd`!W23aS9;W28vAG{L)d5)P|SUmlPq`C#2?`VKT
z0&bd8kRlvX3YP7-KHdntCDt?cVGOqU<ikWNhJ53=?a_(HDJ79Bz(_-kzmNGJl>^y~
zNNk<)|7LSgp}NmP<d6YIY#`vzs@EucOO9B;P41EZHUfbN#S^<aNeH@2lA}gBKA%-H
zaU18OX6t%84#WkbB2oPG^mKiK>)H65pi^j`|3UqrQ|HCJ@L}r)tI74qcRX?b`-_F{
zvPb@+M1c)5e;|jz+)fPADUoie{?DJ0Gv~|x_kH8v#{JU>5E%IgD}|5)m+zlG+})|{
s-02VgcmJa<k=iVqel+R-R}Z>+_`}RK3b|;n2Ox)njH+~vlxfI+05v?bh5!Hn

literal 0
HcmV?d00001

diff --git a/demo/documented/periodic/python/demo_periodic.py b/demo/documented/periodic/python/demo_periodic.py
new file mode 100644
index 0000000..143d25c
--- /dev/null
+++ b/demo/documented/periodic/python/demo_periodic.py
@@ -0,0 +1,89 @@
+# This demo program solves Poisson's equation
+#
+#     - div grad u(x, y) = f(x, y)
+#
+# on the unit square with homogeneous Dirichlet boundary conditions
+# at y = 0, 1 and periodic boundary conditions at x = 0, 1.
+#
+# Original implementation: ../cpp/main.cpp by Anders Logg
+#
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2007-11-15
+# Last changed: 2012-11-12
+# Begin demo
+
+from dolfin import *
+
+# Source term
+class Source(Expression):
+    def eval(self, values, x):
+        dx = x[0] - 0.5
+        dy = x[1] - 0.5
+        values[0] = x[0]*sin(5.0*DOLFIN_PI*x[1]) \
+                    + 1.0*exp(-(dx*dx + dy*dy)/0.02)
+
+# Sub domain for Dirichlet boundary condition
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return bool((x[1] < DOLFIN_EPS or x[1] > (1.0 - DOLFIN_EPS)) \
+                    and on_boundary)
+
+# Sub domain for Periodic boundary condition
+class PeriodicBoundary(SubDomain):
+
+    # Left boundary is "target domain" G
+    def inside(self, x, on_boundary):
+        return bool(x[0] < DOLFIN_EPS and x[0] > -DOLFIN_EPS and on_boundary)
+
+    # Map right boundary (H) to left boundary (G)
+    def map(self, x, y):
+        y[0] = x[0] - 1.0
+        y[1] = x[1]
+
+# Create mesh and finite element
+mesh = UnitSquareMesh(32, 32)
+V = FunctionSpace(mesh, "CG", 1, constrained_domain=PeriodicBoundary())
+
+# Create Dirichlet boundary condition
+u0 = Constant(0.0)
+dbc = DirichletBoundary()
+bc0 = DirichletBC(V, u0, dbc)
+
+# Collect boundary conditions
+bcs = [bc0]
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Source()
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bcs)
+
+# Save solution to file
+file = File("periodic.pvd")
+file << u
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/documented/periodic/python/documentation.rst b/demo/documented/periodic/python/documentation.rst
new file mode 100644
index 0000000..63caf76
--- /dev/null
+++ b/demo/documented/periodic/python/documentation.rst
@@ -0,0 +1,174 @@
+.. Documentation for the Periodic Poisson demo from DOLFIN.
+
+.. _demo_pde_periodic_python_documentation:
+
+
+Poisson equation with periodic boundary conditions
+==================================================
+
+This demo is implemented in a single Python file,
+:download:`demo_periodic.py`, which contains both the variational form
+and the solver.
+
+.. include:: ../common.txt
+
+
+Implementation
+--------------
+
+This demo is implemented in a single file,
+:download:`demo_periodic.py`.
+
+First, the :py:mod:`dolfin` module is imported
+
+.. code-block:: python
+
+	from dolfin import *
+
+A subclass of :py:class:`Expression <dolfin.cpp.function.Expression>`,
+``Source``, is created for the source term ``f``. The function
+:py:meth:`eval() <dolfin.cpp.fem.BasisFunction.eval>` returns values
+for a function at the given point ``x``.
+
+.. code-block:: python
+
+	# Source term
+	class Source(Expression):
+	    def eval(self, values, x):
+	        dx = x[0] - 0.5
+	        dy = x[1] - 0.5
+	        values[0] = x[0]*sin(5.0*DOLFIN_PI*x[1]) + 1.0*exp(-(dx*dx + dy*dy)/0.02)
+
+To define the boundaries, we create subclasses of the class
+:py:class:`SubDomain <dolfin.cpp.mesh.SubDomain>`. A simple Python
+function, returning a boolean, can be used to define the subdomain for
+the Dirichlet boundary condition (:math:`\Gamma_D`). The function
+should return True for those points inside the subdomain and False for
+the points outside. In our case, we want to say that the points
+:math:`(x, y)` such that :math:`y = 0` or :math:`y = 1` are inside of
+:math:`\Gamma_D`. (Note that because of round-off errors, it is often
+wise to instead specify :math:`y < \epsilon` or :math:`y > 1 -
+\epsilon` where :math:`\epsilon` is a small number (such as machine
+precision).)
+
+.. code-block:: python
+
+	# Sub domain for Dirichlet boundary condition
+	class DirichletBoundary(SubDomain):
+	    def inside(self, x, on_boundary):
+	        return bool((x[1] < DOLFIN_EPS or x[1] > (1.0 - DOLFIN_EPS)) and on_boundary)
+
+The periodic boundary is defined by PeriodicBoundary and we define
+what is inside the boundary in the same way as in
+DirichletBoundary. The function ``map`` maps a coordinate ``x`` in
+domain ``H`` to a coordinate ``y`` in the domain ``G``, it is used for
+periodic boundary conditions, so that the right boundary of the domain
+is mapped to the left boundary. When the class is defined, we create
+the boundary by making an instance of the class.
+
+.. code-block:: python
+
+	# Sub domain for Periodic boundary condition
+	class PeriodicBoundary(SubDomain):
+
+	    # Left boundary is "target domain" G
+	    def inside(self, x, on_boundary):
+	        return bool(x[0] < DOLFIN_EPS and x[0] > -DOLFIN_EPS and on_boundary)
+
+	    # Map right boundary (H) to left boundary (G)
+	    def map(self, x, y):
+	        y[0] = x[0] - 1.0
+	        y[1] = x[1]
+
+	# Create periodic boundary condition
+	pbc = PeriodicBoundary()
+
+A 2D mesh is created using the built-in class
+:py:class:`UnitSquareMesh <dolfin.cpp.mesh.UnitSquareMesh>`, and we
+define a finite element function space relative to this space. Notice
+the fourth argument of :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>`. It specifies that all functions
+in ``V`` have periodic boundaries defined by ``pbc``.
+
+.. code-block:: python
+
+	# Create mesh and finite element
+	mesh = UnitSquareMesh(32, 32)
+	V = FunctionSpace(mesh, "CG", 1, constrained_domain=pbc)
+
+Now, we create the Dirichlet boundary condition using the class
+:py:class:`DirichletBC <dolfin.cpp.fem.DirichletBC>`. A
+:py:class:`DirichletBC <:py:class:`DirichletBC
+<dolfin.cpp.fem.DirichletBC>` takes three arguments: the function
+space the boundary condition applies to, the value of the boundary
+condition, and the part of the boundary on which the condition
+applies. In our example, the function space is ``V``, the value of the
+boundary condition (0.0) can be represented using a
+:py:class:`Constant <dolfin.functions.constant.Constant>` and the
+Dirichlet boundary is defined by the class DirichletBoundary. The
+definition of the Dirichlet boundary condition then looks as follows:
+
+.. code-block:: python
+
+	# Create Dirichlet boundary condition
+	u0 = Constant(0.0)
+	dbc = DirichletBoundary()
+	bc0 = DirichletBC(V, u0, dbc)
+
+When all boundary conditions are defined and created we can collect
+them in a list:
+
+.. code-block:: python
+
+	# Collect boundary conditions
+	bcs = [bc0]
+
+Here only the Dirichlet boundary condition is put into the list
+because the periodic boundary condition is already applied in the
+definition of the function space. Next, we want to express the
+variational problem. First, we need to specify the trial function u
+and the test function v, both living in the function space V. We do
+this by defining a :py:class:`TrialFunction
+<dolfin.functions.function.TrialFunction>` and a
+:py:class:`TestFunction <dolfin.functions.function.TestFunction>` on
+the previously defined :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>` V. The source function f is
+created by making an instance of Source. With these ingredients, we
+can write down the bilinear form a and the linear form L (using UFL
+operators). In summary, this reads
+
+.. code-block:: python
+
+	# Define variational problem
+	u = TrialFunction(V)
+	v = TestFunction(V)
+	f = Source()
+	a = dot(grad(u), grad(v))*dx
+	L = f*v*dx
+
+Now, we have specified the variational form and can consider the solution of the variational problem. First, we need to define a :py:class:`Function <dolfin.cpp.function.Function>` u to represent the solution. (Upon initialization, it is simply set to the zero function.) A Function represents a function living in a finite element function space. Next, we can call the solve function with the arguments a == L, u and bcs as follows:
+
+.. code-block:: python
+
+	# Compute solution
+	u = Function(V)
+	solve(a == L, u, bcs)
+
+The function u will be modified during the call to solve. The default settings for solving a variational problem have been used. However, the solution process can be controlled in much more detail if desired.
+
+A :py:class:`Function <dolfin.cpp.function.Function>` can be manipulated in various ways, in particular, it can be plotted and saved to file. Here, we output the solution to a VTK file (using the suffix .pvd) for later visualization and also plot it using the plot command:
+
+.. code-block:: python
+
+	# Save solution to file
+	file = File("periodic.pvd")
+	file << u
+
+	# Plot solution
+	plot(u, interactive=True)
+
+Complete code
+-------------
+
+.. literalinclude:: demo_periodic.py
+	:start-after: # Begin demo
diff --git a/demo/documented/poisson/common.txt b/demo/documented/poisson/common.txt
new file mode 100644
index 0000000..6bd1f50
--- /dev/null
+++ b/demo/documented/poisson/common.txt
@@ -0,0 +1,54 @@
+
+This demo illustrates how to:
+
+* Solve a linear partial differential equation
+* Create and apply Dirichlet boundary conditions
+* Define Expressions
+* Define a FunctionSpace
+* Create a SubDomain
+
+The solution for :math:`u` in this demo will look as follows:
+
+.. image:: ../poisson_u.png
+    :scale: 75 %
+
+Equation and problem definition
+-------------------------------
+
+The Poisson equation is the canonical elliptic partial differential
+equation.  For a domain :math:`\Omega \subset \mathbb{R}^n` with
+boundary :math:`\partial \Omega = \Gamma_{D} \cup \Gamma_{N}`, the
+Poisson equation with particular boundary conditions reads:
+
+.. math::
+   - \nabla^{2} u &= f \quad {\rm in} \ \Omega, \\
+                u &= 0 \quad {\rm on} \ \Gamma_{D}, \\
+                \nabla u \cdot n &= g \quad {\rm on} \ \Gamma_{N}. \\
+
+Here, :math:`f` and :math:`g` are input data and :math:`n` denotes the
+outward directed boundary normal. The most standard variational form
+of Poisson equation reads: find :math:`u \in V` such that
+
+.. math::
+   a(u, v) = L(v) \quad \forall \ v \in V,
+
+where :math:`V` is a suitable function space and
+
+.. math::
+   a(u, v) &= \int_{\Omega} \nabla u \cdot \nabla v \, {\rm d} x, \\
+   L(v)    &= \int_{\Omega} f v \, {\rm d} x
+            + \int_{\Gamma_{N}} g v \, {\rm d} s.
+
+The expression :math:`a(u, v)` is the bilinear form and :math:`L(v)`
+is the linear form. It is assumed that all functions in :math:`V`
+satisfy the Dirichlet boundary conditions (:math:`u = 0 \ {\rm on} \
+\Gamma_{D}`).
+
+In this demo, we shall consider the following definitions of the input
+functions, the domain, and the boundaries:
+
+* :math:`\Omega = [0,1] \times [0,1]` (a unit square)
+* :math:`\Gamma_{D} = \{(0, y) \cup (1, y) \subset \partial \Omega\}` (Dirichlet boundary)
+* :math:`\Gamma_{N} = \{(x, 0) \cup (x, 1) \subset \partial \Omega\}` (Neumann boundary)
+* :math:`g = \sin(5x)` (normal derivative)
+* :math:`f = 10\exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)` (source term)
diff --git a/demo/documented/poisson/cpp/CMakeLists.txt b/demo/documented/poisson/cpp/CMakeLists.txt
new file mode 100644
index 0000000..b27a799
--- /dev/null
+++ b/demo/documented/poisson/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_poisson)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/poisson/cpp/Poisson.h b/demo/documented/poisson/cpp/Poisson.h
new file mode 100644
index 0000000..7c28263
--- /dev/null
+++ b/demo/documented/poisson/cpp/Poisson.h
@@ -0,0 +1,2403 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_1_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_1_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 9
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    const double G0_2 = det*w[1][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.333333333333333*G0_1 + 0.166666666666667*G0_2;
+      A[2] = 0.166666666666667*G0_1 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_2;
+      A[1] = 0.0;
+      A[2] = 0.166666666666667*G0_0 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_1;
+      A[1] = 0.166666666666667*G0_0 + 0.333333333333333*G0_1;
+      A[2] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "5ee927682358c6c0426041ab22b70a08e5ed403f78f13005173589a5c00c41be670a70ca85fa21afd8fb8bcee737b704b4ee42ec7f4dfef9f5aa6cd90a5c4283";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new poisson_exterior_facet_integral_1_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_L_FunctionSpace_2;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/poisson/cpp/Poisson.ufl b/demo/documented/poisson/cpp/Poisson.ufl
new file mode 100644
index 0000000..63c555c
--- /dev/null
+++ b/demo/documented/poisson/cpp/Poisson.ufl
@@ -0,0 +1,34 @@
+# Copyright (C) 2005-2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2011-03-08
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl.
+
+element = FiniteElement("Lagrange", triangle, 1)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+f = Coefficient(element)
+g = Coefficient(element)
+
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
diff --git a/demo/documented/poisson/cpp/compile.log b/demo/documented/poisson/cpp/compile.log
new file mode 100644
index 0000000..2a62533
--- /dev/null
+++ b/demo/documented/poisson/cpp/compile.log
@@ -0,0 +1,213 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, g]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0166111 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000709 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000608 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.00109 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000885 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000932 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0128582 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000299931 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0432231 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000645161 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000671864 seconds.
+
+FFC finished in 0.0746362 seconds.
diff --git a/demo/documented/poisson/cpp/documentation.rst b/demo/documented/poisson/cpp/documentation.rst
new file mode 100644
index 0000000..92baa33
--- /dev/null
+++ b/demo/documented/poisson/cpp/documentation.rst
@@ -0,0 +1,225 @@
+.. Documentation for the Poisson demo from DOLFIN.
+
+.. _demo_pde_poisson_cpp_documentation:
+
+Poisson equation
+================
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+The implementation is split in two files: a form file containing the
+definition of the variational forms expressed in UFL and a C++ file
+containing the actual solver.
+
+Running this demo requires the files: :download:`main.cpp`,
+:download:`Poisson.ufl` and :download:`CMakeLists.txt`.
+
+UFL form file
+^^^^^^^^^^^^^
+
+The first step is to define the variational problem at hand. We define
+the variational problem in UFL terms in a separate form file
+:download:`Poisson.ufl`.  We begin by defining the finite element:
+
+.. code-block:: python
+
+    element = FiniteElement("Lagrange", triangle, 1)
+
+The first argument to :py:class:`FiniteElement` is the finite element
+family, the second argument specifies the domain, while the third
+argument specifies the polynomial degree. Thus, in this case, our
+element ``element`` consists of first-order, continuous Lagrange basis
+functions on triangles (or in order words, continuous piecewise linear
+polynomials on triangles).
+
+Next, we use this element to initialize the trial and test functions
+(:math:`u` and :math:`v`) and the coefficient functions (:math:`f` and
+:math:`g`):
+
+.. code-block:: python
+
+    u = TrialFunction(element)
+    v = TestFunction(element)
+    f = Coefficient(element)
+    g = Coefficient(element)
+
+Finally, we define the bilinear and linear forms according to the
+variational formulation of the equations:
+
+.. code-block:: python
+
+    a = inner(grad(u), grad(v))*dx
+    L = f*v*dx + g*v*ds
+
+Before the form file can be used in the C++ program, it must be
+compiled using FFC by running (on the command-line):
+
+.. code-block:: sh
+
+    ffc -l dolfin Poisson.ufl
+
+Note the flag ``-l dolfin`` which tells FFC to generate
+DOLFIN-specific wrappers that make it easy to access the generated
+code from within DOLFIN.
+
+C++ program
+^^^^^^^^^^^
+
+The main solver is implemented in the :download:`main.cpp` file.
+
+At the top we include the DOLFIN header file and the generated header
+file "Poisson.h" containing the variational forms for the Poisson
+equation.  For convenience we also include the DOLFIN namespace.
+
+.. code-block:: c++
+
+    #include <dolfin.h>
+    #include "Poisson.h"
+
+    using namespace dolfin;
+
+.. index:: Expression
+
+Then follows the definition of the coefficient functions (for
+:math:`f` and :math:`g`), which are derived from the
+:cpp:class:`Expression` class in DOLFIN.
+
+.. code-block:: c++
+
+    // Source term (right-hand side)
+    class Source : public Expression
+    {
+      void eval(Array<double>& values, const Array<double>& x) const
+      {
+        double dx = x[0] - 0.5;
+        double dy = x[1] - 0.5;
+        values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+      }
+    };
+
+    // Normal derivative (Neumann boundary condition)
+    class dUdN : public Expression
+    {
+      void eval(Array<double>& values, const Array<double>& x) const
+      {
+        values[0] = sin(5*x[0]);
+      }
+    };
+
+.. index:: SubDomain
+
+The ``DirichletBoundary`` is derived from the :cpp:class:`SubDomain`
+class and defines the part of the boundary to which the Dirichlet
+boundary condition should be applied.
+
+.. code-block:: c++
+
+    // Sub domain for Dirichlet boundary condition
+    class DirichletBoundary : public SubDomain
+    {
+      bool inside(const Array<double>& x, bool on_boundary) const
+      {
+        return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS;
+      }
+    };
+
+Inside the ``main`` function, we begin by defining a mesh of the
+domain. As the unit square is a very standard domain, we can use a
+built-in mesh provided by the class :cpp:class:`UnitSquareMesh`. In order
+to create a mesh consisting of 32 x 32 squares with each square
+divided into two triangles, and the finite element space (specified in
+the form file) defined relative to this mesh, we do as follows
+
+.. code-block:: c++
+
+    // Create mesh and function space
+    UnitSquareMesh mesh(32, 32);
+    Poisson::FunctionSpace V(mesh);
+
+.. index:: DirichletBC
+
+Now, the Dirichlet boundary condition (:math:`u = 0`) can be created
+using the class :cpp:class:`DirichletBC`. A :cpp:class:`DirichletBC`
+takes three arguments: the function space the boundary condition
+applies to, the value of the boundary condition, and the part of the
+boundary on which the condition applies. In our example, the function
+space is ``V``, the value of the boundary condition (0.0) can
+represented using a :cpp:class:`Constant`, and the Dirichlet boundary
+is defined by the class :cpp:class:`DirichletBoundary` listed
+above. The definition of the Dirichlet boundary condition then looks
+as follows:
+
+.. code-block:: c++
+
+    // Define boundary condition
+    Constant u0(0.0);
+    DirichletBoundary boundary;
+    DirichletBC bc(V, u0, boundary);
+
+.. index::
+    triple: forms; attach; expression
+
+Next, we define the variational formulation by initializing the
+bilinear and linear forms (:math:`a`, :math:`L`) using the previously
+defined :cpp:class:`FunctionSpace` ``V``.  Then we can create the
+source and boundary flux term (:math:`f`, :math:`g`) and attach these
+to the linear form.
+
+.. code-block:: c++
+
+    // Define variational forms
+    Poisson::BilinearForm a(V, V);
+    Poisson::LinearForm L(V);
+    Source f;
+    dUdN g;
+    L.f = f;
+    L.g = g;
+
+Now, we have specified the variational forms and can consider the
+solution of the variational problem. First, we need to define a
+:cpp:class:`Function` ``u`` to store the solution. (Upon
+initialization, it is simply set to the zero function.) Next, we can
+call the ``solve`` function with the arguments ``a == L``, ``u`` and
+``bc`` as follows:
+
+.. code-block:: c++
+
+    // Compute solution
+    Function u(V);
+    solve(a == L, u, bc);
+
+The function ``u`` will be modified during the call to solve. A
+:cpp:class:`Function` can be manipulated in various ways, in
+particular, it can be plotted and saved to file. Here, we output the
+solution to a ``VTK`` file (using the suffix ``.pvd``) for later
+visualization and also plot it using the ``plot`` command:
+
+.. code-block:: c++
+
+    // Save solution in VTK format
+    File file("poisson.pvd");
+    file << u;
+
+    // Plot solution
+    plot(u);
+
+
+Complete code
+-------------
+
+Complete UFL file
+^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: Poisson.ufl
+   :start-after: # Compile this form
+   :language: python
+
+Complete main file
+^^^^^^^^^^^^^^^^^^
+
+.. literalinclude:: main.cpp
+   :start-after: // du/dn
+   :language: c++
diff --git a/demo/documented/poisson/cpp/main.cpp b/demo/documented/poisson/cpp/main.cpp
new file mode 100644
index 0000000..c7f8e07
--- /dev/null
+++ b/demo/documented/poisson/cpp/main.cpp
@@ -0,0 +1,101 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-02-07
+// Last changed: 2013-03-11
+//
+// This demo program solves Poisson's equation
+//
+//     - div grad u(x, y) = f(x, y)
+//
+// on the unit square with source f given by
+//
+//     f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+//
+// and boundary conditions given by
+//
+//     u(x, y) = 0        for x = 0 or x = 1
+// du/dn(x, y) = sin(5*x) for y = 0 or y = 1
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+// Source term (right-hand side)
+class Source : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    double dx = x[0] - 0.5;
+    double dy = x[1] - 0.5;
+    values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+  }
+};
+
+// Normal derivative (Neumann boundary condition)
+class dUdN : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = sin(5*x[0]);
+  }
+};
+
+// Sub domain for Dirichlet boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS;
+  }
+};
+
+int main()
+{
+  // Create mesh and function space
+  UnitSquareMesh mesh(32, 32);
+  Poisson::FunctionSpace V(mesh);
+
+  // Define boundary condition
+  Constant u0(0.0);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, u0, boundary);
+
+  // Define variational forms
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+
+  Source f;
+  dUdN g;
+  L.f = f;
+  L.g = g;
+
+  // Compute solution
+  Function u(V);
+  solve(a == L, u, bc);
+
+  // Save solution in VTK format
+  File file("poisson.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/poisson/poisson_u.png b/demo/documented/poisson/poisson_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..1bf0bede3ff538c772eabdba3ec9534ed6789683
GIT binary patch
literal 35484
zcmXtf1yCCe+btFd?#12R-GfUhP~6?!r8opAPE#oE5ZoP#6?ZAF#hpTd;+MYP{U@`N
z$xdcx_mT6+IUA#<Dvypri~<7#gRZC`qX7d02ZVuv6$8S(o!Rb1Z+ZKI_0W(9!BkI@
z9=-iQG*_0FfqDJ+$?Gcp@^%K<RYA`K1_l-P-vJAgkwy4+63J8Xy)4oS8URm_S~D@o
z4hDu2Mo~se(|6^x%K_qaq(#PmaCa7{`ZMs4!Fo#jPc|$$N-8RH{?IMKgdIU-3|hid
zv~VOsPOKhLL^(u@aA^=H!s%snBrH7FH`5+|-z_9cBv^Pl({Mi`IM_IHN@OZzTCck*
z;YR}&iG@4e&5hD({bTLBu9j}TTfw{evi2K6Et@H^149S)a%Q=B;+x6&;J*cb$xV_6
zuQ`vk*)U8A`Ht%rYo2}z%BsL7N9V62|2Q)d%`=~e0jn40sNOUL(@kQ3ltcu7Mh6gr
zBq`auJ$w40uxN#H>&G{vQ)8@V3Exih;K4~$y$K3gK`%XEb$CL#_;#<8A#nk1(Qne<
zahH?9haprSkxcJ|;K}9IEAa<Ea@x<!-ds(^0Bz+F%-b6Li#8G^L*%l8rAa?*{qN!$
zHyq+3)gPV-NQv{$E#?!VuhY;S3Hd_I=Aj0~L0cR))jiW6BWkyi+~SdL^Sb<A-p~1R
z%cK8$oRXT0=StrQqFo+wY(4VIY7jhfKjMT+7_sXM8$5~JfB&(rzIYh-jd*8y+ykP7
zhRR{^f>1SWZ4G<LdA}Y#ts?TrwWr%ZbtMotwdr0_Ye<DD0fl{f&#{!4d-If%)No*c
za3~==c4T~n{ZMrQo4{2Y8BF9jTl1L($IJIha%6DW>Butq7~TgfJ_)h4|1-(*@kOBj
z?x-fPGw19y4<vmcB$AmgigP*a^Y&z39`k>d$@t3gbO<Fs09WEbQ{)h}uyYJxRW6nq
zo|N4@wD+G`V~$TG*!+v5#dJ(J+snl)hMy?;gKB@FXq<PS1q>E1{m*!!9Ds$ALP;6d
z0et?CsM%y)eTY#gH{TI#w+y;n$UoddNje8_#-Qqdk3Ymewlx>y5TG|jHr3?i<0dO9
zYrHg~)UHp#%}qn(&<Ec<6>t1HR{HH=d@a?Vi&=pVc039Jn7wLP&&8~h1cMCec_=~b
z+<Qc_`=576o@B9lywdDT$*f=~fAml~{-O5S#T>pU4qhXNga|x0grXNZuMum^&NT*I
zH54$WP$Q>!`iMWQ=F0iam^>)DbxX%K>6%FoH&RY#KcMQE{!AW?qN4of{bMaoQ~5cY
ziXoo3hw~U*p8K%Ih=L#~1q%;ULkYn9G{x{kx^F1(U=EJ_@O|V2o`E!goDK=HvaN(J
zhw8X1Bv77$h_lig-gOTS7T>(Xj{1!xbUbJ|Q<x)n<03Ahy&MsE3BQgF_tHDG{*XLl
z@;9b#k8+ue-=b|)UddV(Dh>1|rB;KdQ~P$YgrsnaN6VHIp{UV)%>mBiwdVw@e=vGp
zQ!Zp2c3%37jfIuYOBet|z(@Fgv-68;d+z&VYB9!y2fs{QExT3}Ebpw^dpK*ovMm`a
zWLf$8L0UK^LZc81<Z?AQ6gthQqW`<#6T!faQ`%`XD1ehX;?vW*1VQ($g|qr?56#KD
zHKOi3kT*6o5<QwHy|^Wth2-)gWwyKVAra@YJeW`6zbwu9^AO3AuxKI)wy>W){+p5b
z{b%j=wYXUUUuiwX`{8x@M)IPjjvfs7W12HVla0!WN(a%)M4kYg!hd;kLtD_7_QU^5
z7zLh;{1QlOd5rZN|MiS568*bSlQ=#AO?M*XgtVR--K##o6ev%gKa=q3=>hX%kmC4X
zAm$W340H=Qg>5hNVfWX`1tB4`J_N-5txxQft=;B%>HATus!*kU?VnTyE4P?Z)cd2D
zPeCvs9VBwRgZKE9z%}fPpYYGuBV{HJ^~jTkPQc!q-oh@$Ite(COsAG0yg-F-XV@;s
ztH@`p6B=?%MgY~RYBAg`><D9+*tsPg2mABr*#D2qj_xeh4PurS1oH`6-%to17B#3R
zEolBdCPwblL8<W4xTIV`b8)*}Q*2R@|KJ@(5_T8?A#%P>>gdjKV~KhpB4?bxz+7a_
zH{n#QjIotWbW8CB7G;N|=xEsBvkya=&ow!x{#swX>n?P|CfI9vvRHJI;t$r6VaTIk
zf0uaLx@1)TL494MME~zfclmuf&XoYTllu(}Oks`;G9%qD;Aq0%fY+Oe&*&7dHl;r^
z_+|G|KoV684H2K*ZN$bHsBgqWd2sv(Ya^rZzYrFg{X^&rW6i%N41Z77swrajQc1{S
z<fFrQ2v1dAhYnuS1Q_^#2#*bRI>l#?REEwbavvh%SNlXvIALOz{Zbk})PUW$G3NST
zoNS<Ld0_@`+({c`XK1n=j#IG{Iz*qT(xFrR;(3kD#3UgUnNfk2JrTf{m~~7Fv4CPF
zNP<KL7ERH(zh=dKMyf9$cDzg)RQX@fUB3BUEZy9>h${Ct2WQq-c~9ES#o)Ctc6l@)
zcJ5W~y2{dJ9R<%<OIm8@4s{Y{;HVURBFciT<>F&+?wo@S^BkB<*Ft0T!ieHmg3fny
ziI+Heu|2-}6lcEnY3C-#;;G~uXSObHObw3|Oeqa2ZwdtH35^Vb-H_+UXMo<S)*xa=
z#}*Dpc>r3==cqiRF#`t<sWDK!Xc_hNUUbomuGrnZPT`qAUPxZR$A1CxhT;shLE8?c
z%`xBkDanp1+G>sPxlonJ0;1!kBc_GW=^38~B!cFWz`xQ2+f9XWj976#mxX+_|B)ls
zxZUKbf~Q2X%~&OlIK)@1^R)E;y$p8*_h@?<h7uT{;h_I>0w)Z0RcmJ@IAM=p_3w4?
zANn3};?o7a#QEZp!cPmyP=r7IBlwsLC>lQPE~UPZ9YTJ?XllYE#s4Da*YQEO*|8uj
zs-5e+*<8;`s7x&J*${DpDo+G3V*(4SG*eoQnO*p-=6gzbR>3I!eyeH`AG6_n9K@fQ
za&ZscZbu?*sNv+YUm}S6rRZOwylFiGX(c68lU!F-bgI3-B2&WWX=eAt*z=yJl6zXl
z?4D7Sj;<8RGCBlgmLT|)RNv`bkISnbc7>vev`L2`(DO$5IfyLYl@OO{N}A9AOL%gf
z=e05V^{w6vURO4XBW9*ybtJm0b|Ug4W21afbTsZhGQ|zWdh60<skpm6DE)n7TO0px
zLs;G&DtU6JL2Uo$D1s$K$BRB}k!}A73+VqIJ?rM;Wup->ylP@PbC!in(a5DD3cae(
zb*-p6BV*SQOk${p63V8Guh|Y{Dnw1Eo4y|(QvFpO|8uA$6^RUFy2DSfs~}&8K&J52
z^8t;|ZvLZoq0vn$R<ffLtx_<veww|LQ56Z@iLoN1X5K9k0&(7K9$;dWzF=Q_QBBy;
zVa|S35SykXTH=}NH&XC1*Z}Y_^ipwjMW?TvB4+W<^zOrJ;@%$w1_sgfom~Wm0M0Gf
z9tV>soi6R}<IMd+opU*+M(^z75_Np1LWbiS`1{5D_VW)DiPK`xLKm<3k9wM90X8n@
z59u!H?G1^-j*P(k7dHTmI#hCgy{sjSR^eO~hc&h&VgREz#WiSnXc^W9Nz@<guy}dN
z*ZE9r{K6yfj{oU*;x~4qUoYIMs<oMdXO|T<DhvTxIi}r1L5W|)?gCg*Cou&{U4y2t
z;f-GrJCB<lB)S|Eu(`Mqf0PxEFI+ON!exisogl!As7&9wvj`etJ{oBzEu8;d!VLC&
zicBPqGn*IDdA+^(@bc>q_3T#E`U;)BZJZQ~1rWnjGywSA#O@J*Ggf4fg+;G|TS78r
zYf4E?nExa3b?Yk1r0>ob_(+D1e=Bn8tu_I572JC2xrVPc9+1Yo68Ua@f3~<?6MSYU
z<>NK-AreQ^X0$fo1=g7>K$ZYOUi|uBI$03jRL_41K55iod!j2Z1s+d1?A1E_9K}Dy
z#x9!YLd0f8W-`-j<OY8V?ArRoRJ2V@9*Bo&(%-*$Stt=um;}ar{xVlQCfXJEOqbOy
zcivgJ-5Zp+9_NQtFUAmsh$+bWW*u*^Kqq$1tI;!y2@gSgkGp(4OGJi}fpyN=jaS6D
zpXcvxR6EiFap2Yt;{QNn$XMd$Y%cj6)|s-G!4lf7UHn;lFhq$Gh|a28kS@LCSAK;E
zhmEH;YAHR+{^wJ8+w_9rW2#A7z{Nn<9oLw=$fU@r^{IDsoru(hH&%EQAPT-Z`-pcZ
z9s7E`=G7r;>cK$dtoq!}P)alWH`t!5@>>>vbx5IgKRtQj3!?mgolu>2GVx~(*!3_O
zk#0wI*l9_8Mm(+e8s7Udln8m&t3s4hNJtYdsSdkp{$GAYF#Spll6;B@_K{8kw>%-O
zua{1J&-Gc4WJzn=%m?*}+F&cjj&k6W-(vMPIRH~9$sn+9zXV?5uRlCq88Oi5IpQ#_
z^x2ch>1ZOVZ~d5S#U}?Ym?{0QTbP8EZUf!)$@*~H6-gPje9wpb+?&S=onA&e-_@$$
z6cxqdr7CW&Bj%J*!QCg>;W!!KNWc`0^4W~<xY%`S;p2q%NJ`5vRBCB4(49&zZzj<c
z@v1(ha)>=;=BB#%-*1QuCVtY?G<`vbm?#IDRvnoQ;4gUz|MUsGPBeK?ejTCNsR{hA
zEVc$+i5#4|n-35ynMph8RF#sSO?)_tv(?m7RF|dIowL8}%zt`y=gTg>{f0zbf=qGy
z^82gAt7Zxq^I_|64}9kd`<k0bjbU%KAPOSdwIMAB4hFt`;=6Z@d?J@Zib-*j)0oe-
zm-iHbFF!ZCag7S$_`*Ynj!`NNd|NrKwMe?&#t_A7t}Sn#xk&NZQYUJfYvac=f9~$9
z@B2eDXH7nB0hxJX0yNqs8}1KS4L8K*`{;8Kc0tU!xtLE|N6UBD=N*2JXPusa$B(C~
zwIaPQ2pwYkVx?sLmPmbZeo=mjeu;K(hu~^&>&`h|2kz+yH-Dlu_MOQN-$gOs*R)HQ
zpr?EDmrm|d6Gj3n4c49lh0g;RQnTKy=lpg#VBFTjE`P=^SHZypd%uw+{<W_cc|pHA
z_KzvH!b;?-=B1vAVU8E>(W(=_XQ1C)HCGCSr%$nLn3~5X6{Kp|P!WCnA-XMXj2C=N
zkPA0^nSvQN<(JfAwD)z@^@v+FyUA3hw==1vAA4cmUcy}oF{vE3UUDS6OHV`2k?k-*
zjKbu%;sM9=LLfN<=CVsILry|xT`T%(Xi7Eu5%g6w>%SpVEOmuFp?hmh>d!%%Bfp`}
z`+6zc8hU)1mBtcoAQ|^$ql$JI@0aFr-f`dFfI*X&2?l%;<ENCrTONKl%rzTe<uo_<
z^v5r!jD)l*JSE6fJxTdqSan$=@uF;+_QmEM<Bg5rbEf<0>q{T;=hFt0=2B_}y@*nP
zd*dg77gqH-(?ENat|v@Cl!`9i|C4YE`Al*`=i=CV_ufhH8QEW8347F62dOf$#@lIK
z)!x$5563*$K^GJhzR^0>SEEjXU2$Lj;mta730Voz9L5}mn{`%fG;b&_VJ|XO*vEaz
z+iFg(N!I$581=Pm*9{AwFcuxRJ?4v!T$4MZgRwB_KC@o4UTTFt*;d9cuF3R_%g<Gn
znwV`{FFLP>YG3{hXUD%DW-i=>armFF#1apyg^yO~MEGKe8-F7@*=wA8pbK>|44o+s
zkr2j8Zq!OiOU8X;80Xn|Y};N8QqGC6*#~fZ#uOc{X!$*=m1W#_WR+vw*ExlS&*1H8
z=7g1ryzX8A66@*7ViYvUY3621Ikb|(DX}@;yq|CAeu`&6^Q)zyXg|WUm`g8*Ab27Z
z6-y}P>pk=n+Wyy3`9NtDyB(z1x6p&S;t=JD!(L5O<A)p#P<*qbd5P8C+nP$M<v91D
zXmT0YP7J@4OFzgp_Xl*l`0hV<?ywtw|2#J)*!JU@sU)!D78CbZ78B^4+ubu1muNXT
zU+v{0j+1MDD!goI{u=qNwDl9<&FC98*Dk?VO>a;MBE!(o1yP|7($0S7jrPb#)xoj?
z=bFm|-*<oKe)%i^&vpu3PZU!GY6$JICRKF`4zp_egtebfkg-C;%vIs37_a<`Q4<6p
zR+te`6S7fVn|z`$aJ1bZ?~WJ+TKE024~?Dg#`Vtg6td6SfU=IO`{!pSpVAWIbW+IF
z1sK7J4!buCtbZ8RSQa7LI<yvFY#D+m`wbhvA$v43U`9Di)_3z+u&9qvDO1~<jMT){
z`wq<O2>NqOI7*53uj6a4g@}>2&W)qcF8FTY(f%>^Jb9l|pWbu((~@%<AA3ZsQlpPY
zMn{AkCDars{QjGbVUSM>7%7*4!k5z{@|nrIl=mamxv(bC%83t7(mqCNq9xm~|4KAe
zGRrXsQ%X@bL{1iOJR?Bsu7rs$Xeuoy@XzK_!!CU<H-wqL^&pSF)|g?W95(zx;k$Yv
z7{Y5`OyeZ??pSF!R`dXMb8T4d<+@d5zWvp`2|2;)c0#UajjujCOqx=f9vySz_58si
zV86j{$f)xZiFc_r2F*E^Pc%<|)=e%mDHTrW`mJzBQ&sL+UU0+8ycrx#|BqJbtn2Ci
z7s#V>>nHq{^?~3&bT)iRPqmG%S9ESi9%E;3Jy4%!)^X8Ut=gX~3#iJL$!l`O4jtz|
z>@s>D3l=UM>sexra6?a)R|r2qIv4-M3_n_%3CT_?p#<>1rqh?T4r()9qd!--tmN}f
zw0=5T2N8>JNtXtk@9nMDcK>)*w3A$MTS*syQI-5&e5CM|<r}5kR6nRYpE39wa}ToA
zwUn&dAX&jNE!Kc>TePu~E>8Dj?3DO^@R~;h`zj*Yl}pv;frq6Z81&WYMNfY7_}|Kg
ztQ1wW-fq_9rqJk=!Yil6aQneWTc&q?wquiivJp`mF8}<67Ji@TI?hJo1o<T(U<T=f
z&sro)i&-%8Bkp)Q3#T<%+0xiP+Xqv_GxiA*mG$io_f;gyB&uNWAo>1nQ;E?Iy3fW~
z@ZZRE0SK1Mz6dhXkzaW2C1O#;!0cpzk8qp3@q=_YZ`@l4r&&YOYvXO4CO~>eC|te8
zYKvD518jne>j79F9;X5`ya>6tauoCzaUh?lB6>LA8j(?4CE|^f$lvLhmse+NCVelE
zh8>i-tR~h5;p4#gND4@G`AUI)V^HedtzKDbTB#+1mL61EQ^rh_Z_JFtP=*8bTzu<P
z{YM!sYos~<k4g8uyRLvQGy;|OdVMRpTe_P(_HO{IA#pk7{l|A2RcXV|nN88PV>JPN
zuKE_%Rt`=H7t&bJXD^PCKLpPBP7n&2^3VT<j+SMUZN27W;@eM>6LMQ*BY{WpiNm-p
zn<4GZk@rP1Boomd&Y;L}ga(w#vD9(<lzLo`6=ugC03LIrm}-cUeRvcU*vA-Ma83UB
z!>aeI$mM4j(Z@syKZ=9Smj*irY^sGEMo%&IbDav)x<XWtqmN=DF<((psh`u(x2`<P
zUO)2#Pf~)6gkxD2Eu}@CS;yp0BvNIj(n9^tQ3V!?3$a_cD>;8E5BN2gvX?Y@swA3J
z7^bD+K=*puA1QlB%wL8uZzMF}vGZq|cCD#F*Nqd=%|E*QazzT+Hz##EPfu591UpKi
zJeKNqMGW7SM2_`Yjf`rfoZF(dR1mN=%8NfDxsY%~sfTmL!8t~b9T$zhI0+X_e*xdH
zAF}C8r@YP~&~3Ksk00cbNR5DZczM7;S{s>$7zVT~>ujIa1ETG_jlZo5{jn0B?bk$W
zCX-OLz{uI~AN-PP+@ieJq844MnCZeWL1M`ZuI?SK8XrbgHe>P@!Zp#s=wXb}F&?vl
zef4i4@pq;>;C4IMj>0CMM_MMSo=#-XuV<VDwCJ~1jkpE|_ZcI){3`~GFg<tATgD1?
zgmeD*-38c!-kZN+1|lPNY;!cayuE$m((q<RRJFbL(c89%`s7#LTecLWchB80LERTf
z?{zMAN3624h?#c<3x6Ts$xwkT=n-%X>HP#}cQTiy%@l57jg%c;6psR9u|~cPmG8v0
z_BWOec;*^ze_g$oHt{%H=@$%;nVRA@63nvs=&zTQ+9@f*<}jNSp=f(bg$s;il>L3Q
z8T{z0{+1@&b{`0qk|RzK=*X6@<IcZ3FGOiohvaZ6c#zrW*yaS{QZghW+K#FhHZKga
zxlEJhY08t*M<92Q-7;*Su5^Hi$^BnEH^VXTZyOCeKckqrCx9X=mbgXjJM2$%*_4a~
z9&D}yg(OCo(Qek0HPs;Y9W_Ms5!rH5D$xPwDeTB&eImI;ljKtRSYK2{z>3nAcFS<@
zKUrkPoY)j9YqTG4q5P{4`tZ`q76zzF7=)i?+ir7bMwGOig)=TI)1_^}QS}Uxt$jEv
z^wWqWe#_zS#zKMmclQV<<LRxLH|GHxUvbygr%*7z`-pah;d*4=W!)}oLhTe%!y!Z}
zo@w{vb|K_APpYVABrWBeEEzjRD9pS`d29u02<j+;RKT4|E;F2>$PQfASYz?agV&LJ
zR0(?lI@&1owrf6qdjQkYR&dpF7`q*V=!5**{x~TmC#aZ!MM9(c9H4q!hLZByt!kq5
z38`Kqy=;G`_lO&7D5duR1L7)X`P!Dy3D`&8ea3kF;`88gp*Mw|<~#-EBw}6?m9m7Q
zXv6@<<290_{TvPYWJh)(#{?1QLwe{Qc?ybJ!UjY$LS+F%f;8t`XLTZbFWl^#p}EiJ
z4Gr>cx4=nqzW0il2ZCAKuGM3(V_{ZOO85M9D=PgOUACFl3RoldvkXC-WIJA5Zv~~)
z<+(q&ZL=JBDnr{BFu8~0dm{U|Hzhbqm<3?7mjfMnhE=}@=B}Le-9ThEQnRE>-fx&q
zV-3e#SNd$+Od4H_zlN8HobQd4Nk=YM#<EgywX>IHE%o{bwfq)wG7LQo2+ro2y2{$6
z814DVPaq@}Q!a@h<KdZy=cb5dE!PY2R9a#a71}yp_ubp<zNN~o{ScE~LYpoyok|8!
z8wHT8&Vz`e7DOw=?BB+nd>TK~+Cd*9^d|geGY96zM-2S=BL?|-S~k3*A}b(eUVL|q
zfiVZWSf5N0&PbY9(Nm-fa}3%%*6{GNDn-ZKWe!Kid1vBRmhpF)#OW<3jh>>Z3YWwT
z3H}-Q)VmiAJ_KqydBPJDLB=lCloz}=*5S;A$Wqbvoir+F$W-aeJ$5rfW-XVVz3X>T
z4N=MO;!)=c=5owtDbWhd%*lL0%%q<&vP%$7a!|U!g8zj>YEKWV&%9Y=VHi%rTFq^b
zcPmvB&&z`XIli_APAkfG67l5m5Sg06S9b<Reg70NvRj{%k7&uqRgWAAqpnznG@)G6
zjlu{@uFRIYTPZ%8{Nk6ri(12pwCYW{xV0%=q3M}V$>n@a?<(6@*)iw1UPEyE3?Cr3
zaU$cTOGdwnSN~?#2pR^6Op?zuM7iBYlTX%Wr4^zmp{7Crbc%Z7N_5Q92q~0(MSm||
zr$mM-EapwoJ`6oHQ;3&Uy!-Pl&r_2dw2nQ<UlKA%_=g%*-)PiWT*CeXS^aZTN6Nwp
zNZCarJ)s0qHt&et&!3Vpd=Qx-u}bWyxx>#ry#seV;K%a2ea<P&Oc1`FbP}<+6(A-h
zAer*;+!R-)E@ew!{@sIs^i1-Pa~8)aqu&KWOaK+j+17r@x0G|$I@V6lo|>2G`|Fn<
z&OVB=Oks+Az;Ju4K}GBnEW}JyBNCLY*`EIYHjtw6UPaC#yUFSNKEej+=uNmW&U>+`
z#wucnXjN1mY;=6@%Ld(W%`agVS3i@JC=`bw@G^KIf%Eo3CT$NGs!mg{G;?1?T15sL
zIk;AM`sbxUM2=ucYiz1w!VXl@)5ut#wn)oI8*w-eS09^NfGN^mhLD+Y+%Xyr7sQ<o
zbSrf;GprT)xfil}j-L4Py?nX^SBC2h8^H|B7{*6`ldP0YQ$TdVmbWwYX~^jHFGr_e
zr^*}c;Oqa@7zVi_>VdZPX_6f6^F)vHJP}K^q*6nfR<k*($hNGcI=*Hpae;p7$Ni7Y
zw#iBuBtXO;$Q{o&3jNpOrtSU=KBbjVtOL^Q_3AR@>320Vm<CIkv*ED%p5%G!YS9n3
zYH5n>T8Y#SrkdGH!>ZwULds@mU3jkMSm?-9ZYy?gt({M)pwOW~P+;4$-(1WQ2!t)u
zk0^C+`Sq=dd8)9KXmyq-1@{vDyW5AK0?)%S`-rs06rxXL>!QA%y7>)xd=+wmCB|f!
z3*H+XgwvBRA&eS+hK}ER&BAvZtj@LTOFn22alUVLU;RyS)=Qw;ve|zRd7BW;q2djh
zAgFWbuGA&5Vj5XM6bhQ*TqOO_(F1bjR7iHHYzI^KsiTeNbR3qR8Z|;RF}>Pwk;>Ni
zH&6W})mD+MKm46XX=xoBHr#`hpA`x3(#>}1EAr5aQuhkIb_|F#n2O9O-<I9q!S|mm
zP87VI?a&L)b(bgi30nk~UuukPxewA2E8`CvgOcF(Ir7m-xM?9q7DS@D4{6MHA^QSV
zNZrFU?<T~^It2X|0^aL5A9M<6GNNZEvqK=N99L7A4aHgAxhXXD53o(rt*KlIq6=!l
zma@t?l^EXLhmC@>mgFnZ{A)v4PNxah@&<Wdh-OM#uK8Z4wr3=!8=`KWu*HJ$q8xPJ
z64FdaUYL??PvIpGkE31uFZQPYop14f<r#o>)|V@fP*f1gm?1Rs{T|0P{vJAZkVrDw
zGyoLb=T-BR223Lq?*ix!glV0^;!rdhWj|75Q=fm5`!q)K@j2%FyTnFd@HbX6jsmor
zI$F8u4xqkZs3iq_f$8^&>t)t*b-gB2ht*Swyp0R~wW>1dhP<!5*=!&96~?HdX2%f+
zxm^kQRDd!0L^IzAvN1cK)2;a>BdMADj%ZPp)Um8NL-cuzfAM-2sUfGDJVD>+UzkOt
z#sAX+<goYjq?Y(;ez3m{H#u0&M6d8LjKV#pCg(M=t&u9Y!ii+w`=&yxYChUhlp2Es
zkZtn%&P+?CXmH1W^W*0BvF}ruot)>Gw^FM>fI&weOxe9WXA)<=NxFcWc1&3&vidG=
zML&3dM8GM2_+8_Jr2EWlwZ1mJWb87fDgV;QFW!hEH@P)8{kPQg{OS^Hp%Ft}zi4Xw
z$8$8Vd^B$hK`A@XV90kjm&s91|4lNWG0SFXaz~R^o<}9~Yv40hwE*Oj5M!nK{&sIZ
z5QGH3{$248#m)_BBwiIw%Pt4ssT80*0*HaCOw4lLKINz_`nSNZxe_(jmhY>HL7%PN
zzS&Gk{ioeSj0$g)bG3-sF?j+p60h^#9CRA;*<blkjI6a!CaIY#!k>plM@Z8NVpY+2
zO2~dCTq7TR%vu|4`R*?ikZBxHK~Da&pHED*yiA4vTb?GE#CEEbHk!gs0TLl`UvCq)
zIQBMv<*>i)MjBApW&x#?TK>tK^Yo-<4pI&xKOB@+Ed90c+57{=>oN-S9Hd5)3aLZ0
zJ7n2jOB0-nBlbe}Iy>92%F#^wj=s81Nt*>L;goCAFaj(<%t@5!zE@0w_&))a8X97;
zI(%h+n`N~}WkQYB%0KLLZK(A~UPE%57^(`mHKSo<WbL%Lt(a8M6w`-^+-j)YT1@p^
zkE$<+FBH$d)N|mC9Zz!_yjB=+^unbwO2`u0&%QA!9~j6+U_%-R4V532)PzeYmx<&T
zd-6!+&FHA@&Ts2JRxt}>Ba?~hP8%3YFF1F6*An^4ftps7E=@WwNv*0jP+WmP`O9^f
zCbV7TGp#8AJiR{ER`WS;*$e30#V3VI^NXu;K<N{U1;wQ`{55wjDXlET6w1w#Pj|!E
z4^M>3|E-dj=bV>qjZFcG_26MRQx>}?WAk%fV^@Aw{ajCm&3U_{UY*lF&gTQ>U=JV9
z5~A~oZ09zkXr=s;sNE%#A`$+mP<vLH@}0Ug@H3Px>8M$~Bn-DKdnhfUA2!NEEX%B|
zB#MW0G6|!+XPZ<F93sET?jwe!Nr}un9l_06MN3FX|6YlnlQPo$5=G;T4d1r@w|!-6
zn0-2?WL;rEq8Xr{;2JFYw`$-ECt!qVCd0=Bm55I{6g!TX9;_!_FP2A4FkUL!hVBy3
zW!Mmcj`#@rqS3INhgV;8YDLrjgDz(O-G;<%_xhtn?qkP}*1s{d%FyKIYV77T_;-jw
zA_~cdD;iba7BSkxY3GX3vHCVN1A;)UqIlwMj{Oykt5Prqd#0O&@n#@Y{81Qn_Ji`z
z_jub725grHr!IE}pR_-kBYAP-WY7B`iqBa%Axs9;WuEi&{Wz(szeF?trg+iXWn#9D
z(uv;w;nzG2NNtom#g}iN0WfVSPJd!f9JMWJ<o2ntSBXQOE4U8(B68onNCy^9lZ;eV
z;*zqfS7mVUD_=?Wn1<(?FM0!*97InuufYR1&BM%(GiPpdJ3X#wnEs`q1!`_kwF{at
zc}2>Y5mU);Db^mk>6)?j5&eF$fD+k(aj*yJ<ew+(XwW;YCPF9G0F_XwJtvphxogRC
z6gnnIGbtoL_d^55BvSw~7=>SyU>zz2<mF=um!eYRO-4%Rb+lWyZXoGcbGO&}G9NE}
z(1TV7F0OxBnWrW3iyb9W8DFY3)vxV{Q}&693f3WXT+G&P=sis(h8@=Z?$O@;RS<Fg
zzbXm?9}`R9UBw8uz`6BqO`vgUX|kOP-GAM{3}>P*xgXIDlU<n}B}nPSwPzdcAn}(g
zqQf7EEUXGc)(63C%E@^$j`dK7#KZf-QAun*MX^#ge7Izv{yj^VeJ{y$_US{ALiD%`
zA_yIg+s^bI<i{R%n~iJak7r)r3F@Ldl2Jn+qCpI`pPdxca0Rt_vCufnc}^PIx6U)F
z)zmoY9clGZp$m4Q4A=@RVIHK2pjE~jq~`B3ChEBr6}T5z^HkwNSd;zc2WK<WE%h#_
zb+=O$;IFJ0KBD98`>`X(V#=f2X+EP%4Gm*DIqasApJ3ck+V*)Oqn7y~J=dVOTwq1Q
z2f!%mV%Up#mx%3bfRYGpBE<eU5i^u{h#AtrD>S7auqFUp;RrZWR}o0_WYFlEp=;JN
z5>zl~-dEm5p|%ySzP-2!sB#-y+pvMore-|7s7fdfM)9M=SZ3DJ3gb(zJtJq^+XACa
z5^8cxf$hY-rm+;(#oV^>pWV0UhFRYvMzClt_JPY|HKtx00xDa{JUa3O+=RAg()v;Z
z4~N(w1m-ohh|ehc0TC(hs`G?+%O+TSHEZ|h!<E8lwMd*qY=!05_I^aSjzO`kDc##y
za>!k8y~S98Ho|AFLGeIhdRC+>6>Q+{PYf_RFhLWWlM^dMh-_qX(X&qa65-c3jm1oX
z2!S(!qX_3suP7`b+nTFPQM~tZvHRZE{b5H4*J00RpB_mfx!wsED#;Xs!c%bPZKL!E
zLf0SY2Pp2ZY+n8lbO&{Yy~R^&q*u{{|4?Kpo0nT=JlAx7*h1z0tix0j1Tqp)E*-`u
zT9mb>hByH!`#YtqL88Q11%*5*kPp{e2+8YHey$DoA{q!xn8Emn+!g)pPB0kZI-+sw
zNgW;gsHeYBiCP5>$%y_^ltmes(QrRH5HNnfA~PJ<TcBuHm6MMhX}?V#OR{~exIjN~
zqpTrDD2SnM{=H#HtxQ@LAm_S}G_1FiGg7<lE-02JznRsC=afoyp$O2zR+}%1&SECd
z%D@}K`|}^TlGy>^dk~RpXOcY&X~>p4YU!{b1@vTvsBJUQTQaLvJ#L($UC*M3y(E$(
zLvm7CO?<Ng<}fE=7MV~!te9`!OD5a*G{inw+uNjOvx0N_FFP_ql(Oi}aa19&c1)w<
zKUF7^p`KJo#)7__FME$k?sMfjmuuv4s5+Jb?IAcrXYXVjDChNcV)O7~0c5?l>lJ9Y
zzsT)+KcVP-!w`H7<XUPN=_>oP<~~ZMEhJrbeuiC)<JRf_p9hGfC4!4t#-s#<HA;!?
zx@y?@T>$VHRGKOYQ+T0b7SrMh1%Jnnxy7FYzLXq`5(F}_VZq{2f$*t9Le0`*K;Mj1
zjA1S^yzPXtqyTQEDXpYfli2i^Yv$TbM&UfyXh6sBp|HB6%Wb=L?|d0sl0B)_RRfHY
z!GnXoy#0pC{`m$p{`q;kXdadXV%8kODx*YHROeJNb5y6*3jVP<-F#g8+lV39<=!8Z
zRZUD!=9#ajIqp+zUf0r|Cw;Nss8v_xp9I}c<=sg}_v1Nql>j=gfVGuCSy?zFw8NsJ
zD|RLz6<v-3iSnCR4Lh2#Y@@|*9}S)wABR!S*gSQF(Do?5SDQ|LI(G+dCvKey^FU1<
z(SyD=%i)`Ebe<EdF65xO<>Pgcn<P9kY^rFuW9%A`kqz!EEr?O)F@dr2Wd<Ear#_O+
zD8#$2hMW+Xh~nHDn$;7Lgk}8$LC;gzO#iLhU%42&rzKL)SPtQ2amtu-1gixJ6FvSL
zOIp2-!pPH7m=z9X=eL*G+`7n%zAme^h4DLb`t;6nD9OnxB^6t?<2TkS0+dz1Mp)Th
zu<7hIFY-JNn$`Q6Mxo?a)^*ynC?D93;LgA_>Molt?3pTw^+iB>0HRZA+gSRZDKn9x
zqiPy$PO!YiZ5T^G6nFD&$OFM`ROoaL5n>?IhWAi;fJ|f(?$xltY|`)>lr|oEf)o`{
zF)>*RTWQh8+=~G<#0SHJ{?7|h6P*7lFc9s}LE%rCYL_~Ra+<PCr;3(pq%w&nJ)3gD
zgXNjn1+b<bNOAPbFS_X1Cr=3IWBruMPp|_e5o}Ujr3KHRnnePu0UQFBj~`8mtX{=R
zC&?_V8<_QN=ND3U5sK>D^JA^9&<QxHI)Mg83Nu|YC0H~gQ`a3wOcT^tlyZ?94UpFt
zX`gmbx?g4FhmQb`uJi~eEB31>MvEwb3^`3u>W8mtIahp0$E#}57|Zt|J!(NH`!0t7
zj;`0V?&FprWxKb1j6u=&t-Y42$(NJl$oM=2LwWgnT;@a#1YW{gBQCWWRrwS&lI#S{
z*_@9W!NDU4AX&;7y|3lDn~)&s$TI#+eoaQyEQ6OLUJIX5hs1dvj}1n)zP%7mI|UWg
z*4-`u5jiWmD6gn(QNAkxI80h8Gxo)Gc+0gi;N_XrFXo7)wc{sbO`AgEW&v5LxjEn3
zNCl|aKc0m3P9<O%POtBN)yl7kaOU=;iB10FvNiE2C9jiTj=N(RIbX<jY5}T$k%U$v
zdPkXbT&!1735MC8sKKvHsJ}0xM>7EP>fUIcXzVMULdS%-hmSHma?^&vzL^E8%W$vM
z8_hCnXf7-z<K}H8P<%~zZO>0~sU16l`#z@E)mBQMuq3M`BlYx;JtNmA=X-rddkt_z
zd2d7*igEGcjbMIxBA?}Eeo;l2yS`aF$tR2RFE^tpe6=N~0<NGXDq59+0U^<XvBEF~
zL@jF2gh{QHOx$sjSJ#aHe`O1X^KW$Q`*wRIv^C=?`%FXKP}s#K%3|539_a=m+E@ks
zH@T*mf;HdbAu4uJ5&yh)8%T*+nTAxq<_;c4`9}jHZM*V%drQiTe75&e_SKU<@*pEi
zNI{^B;!kf%h9X%rgAF)Ow?4cv=M&P3AxS9Y=S<M1O{;C06vx`p?=Ii3(5gew%kSm=
zQ_mexzXlwGEOjY}7zYG0#KNRvqqb>R8y4+xVhS(=uk7amtEh-jpyIC{<bQwG1fKay
z{RcKM@a_8wK1${iJ8KR~+1@fPY^F36TAFXWck#yx$5zm~!kS@3XV8!v0ROIpR{Ns8
zAS^}!NV)v05FH=nj62JGmiFbm|N4bDn`}~fl$R$T8#cDC7eSAA@BG6el=!&FU~&*>
zwP@5<ix{4cuGeYqYC0`!pwkVkq?W5y;x^$z_Wo2LWom1IZnbG=fws^^{O$)?39bSP
zlDbgZ-i+{a9+d>m{TL4vF^RQSU{?E0L)L0lO#4dj6^^2%u3?nON=k>W_j$%#P&r=K
z97D-|0kn+*$LFq=sr_*f+*wv7-rD-=Y%=x`1j4q~P0grtJV#@xPP*9hsLs2sYTmO#
z!A7)TKoz87t39VzF^yO{o{R)g>8gdMreZ7LKyY-~*c+NI)UWo#{ZUsso>`Q;NgSZe
z+8DRqzbg=awlFW7=ho9?aMQ2?k-5y2ri-HFDQ!{;-XGc>NsWpy@FvxfT$A(t0~xj4
z`<nA%n*eWuPyWv$N?tluMlgfkjT0n&=7p0O<f4R@8*fsX(c!n-x2D>~Ohx#TSnjhv
z3AM_MM<zoXKXTu@(u=K;WLTNM;2)1`V2>*J!g<Y%jWFTtkt7Q04KEoMK1Iy*M5Uvm
zIdETvkyOntv}PYn<y4O%;ScOLYTy*%Q)IFHGeSg1DiCF}m`ly8nMVMr)N`1ngaD+t
z`G;{daD?VOOMn_B8<1MM`C<E%HogLw+`A*pr$GUXHvt<AIJ47{*bld`%PXfT(~YGH
zYEUrUrQ9yn+-@rsY2H;XM(FFSV8=75{kw-8&#6_ztjrQ=@7fXSCTmKEGU?&`zI~ZQ
z2fy<uc|E)Iz+-maKfYeXX(=f)dDIhtQ5@Cecp+8qotITtF3D&j@Q6-zfbkU|o<M}f
z^8RfM5T6#67_q`^u$LfMch`-b%d0jR`SrsI+15d0)PtOd)`~`${TmJ@NDPX{hdiGL
zv;rr?5;y4e&7||bnV+qIrVX!?%}B6-Nh^I7K0H`W=eM7gtJHE6Eix*zrs$G;q&Y{d
zgC@QWH){Kf=E?R^xLBpfAa`TMfnk6LTXO*q2q9%2M|UsdflX{ZC_fCn8JCwVi3d{D
z8&12!jwTejno75-L8_5w#g-ATc;^)-FfSQ5NYY4+@PLo;TnX>y_%6d}l>FN~jtw2v
zI56M`o{S~-Xj@p{v|21r*)+0HB%c~)p`F)1B!?%2EUL%zqiCobvG;)4Xd8PYS^s)A
zpr#O$Yx*Y5cUpNhd+ebAXl=_@@bRaA_)I*+-F!q`z@w=(d@VF8(jkx;)A4&g*$KQW
zhA4e0=|^1slrB<+!<e_v_(pUz<b~nnKW&m`%S32mF~jKZ7dVV>c(sv<3VB4-#11X7
z!fMqvGBAnSna)58s#L88!Rb^|#q>;o_bHQ<NVpJP9P_u4c43y-Bm6=-_ivU?;G@GJ
zi^IS0XcFJc-2`+)oaQS0f6J_{xPCvJKtvwIzj{t!_gny-%a|X~wF-fm+1tG77s*y@
zk~v49XJiifzb0Ird$hl2u_wV3V*BV$O70h)%cYv*M2CcJNk*!tBi&(DQZTiY?OW4U
zWoT2O-;3ZvdJoZ!4rM#})enE6^0-Xru;B5PJu$4Jb`jYoWfVb>?gYb;dk6FHu#l;l
zk-lD=^HYL}zvh=GYyOlZhtLT97tY!2J@J2!2UvUI`}IXuup-a9>VKh-v?q~@(rPn}
zcys7jzj2$?j7$#I;P#7LzgP?-?<AvIgIk&N{IdAwWwZ}q6lPRQSehM-lq-B60AY6s
zaM%?T3O!ONBAT>{qts=UmrLV*%0jVAdNQ`)Ulb~>&PJR{IxguHo>n_U;;mLQ*9(~K
zi7&B~3ILF3V!iue*$}{dfMU-`qEuF{#LOF_u7w4cbNw6h`@V>Yn6b$l1-F*fv-QWJ
zRWoj<XUntb>;0OMPYo7zVOXr%#4aUGgjdP_a$Ov{mY%tNbHjUnPOECkwBp{i9BI(k
zs*iIM&(uEI%`j-M&x;pMq4dKA?$eu3M1hHz=HHSr*oLD?;#lYW28<L;C4sjdRFFDE
zL^W)LJg<0tO)vv+{CYu@AGrR;_MR#PU}_}}dK$Q-G=t|X?)~|Lk^#kG=vmlzav_?N
zP$YcjGC01p-0}<&$S@3%>OXyU3yg)N1Yr~SvqeuWUsmEDdPOIdQKe*W)1)(m8+(mo
z#5LiHHY|YFf)o1L$$~0#d(#)k1&|P+;U#Nbz$G`BsRea6&z(Jv>zq-s!fHMH+TWj+
z$)`*o#RsdP=S_Pf`A&iHQ9L~xku4<+e8uzE5v_atU|7HCwEa<~U)=ZSa}Y~_ZZe|q
ztSM@>Y`EI~+BXuM0)*%yc+VLbWcnzoi%9lsXI@qAf816k0U;^Oe1g_qGFwi?(mWWw
zeDcmvfF8d+FM)j+g$j))#rj_16hr&Dtn9~b*`IK1M!oW46S?Omv1L!fKPR*Psx)x#
z?RzMZzJ?!51)s@d1RqM|?j$hbt8g{wFrkQ$e70^`R!7n=AqP-lMJn1#a`KhYSJg*a
z?z+?qqo0New@<9<!$BTiOn;X1)REXqW+T>AyE*6^MOh-?MzZRon1#_t2*LAw%!9I*
zqej3{>WWm4=$6nk!QJRlJWii{zth^G<9~y__u3S9@OSeb&_o~c`go+1pN_}wT8Xt0
ze4M1EsM#H+o>Y6GHt#bYegodCxovpauuX@i!G{o^EvR<I3)mk0;eA#jU@MaHQWt~L
zYe_}RoEQ{KNGXqq{G2U7nOIzuBLn4WIs#3Z*?Ct-x{J(xNtX~A@omBrrtAbB7s9y8
z<(&p=2@o?gAU?_bzEGcISLxH{2UoenE9DT`ugr~Q_I09IT2^_cN&lpG&c<Xh4z!02
zqKUB5*Fs}4TCp2}^F~-+)GsT+lZk@uTRbh9P18v|?+2}{3*Q@!SlC(__6R3NvoY_^
zIVjqUCPR@kG%=ZD?KSdPBN6-1lKGuWpq`<ubs?48+Zor%YU5zjkJGT!m3oSf)jSOb
z8~x$0R(A4azMraVAEu5AbldcavJG@*CIlL#4*STb`Ivt0S3s~c4$2iHiJ{GdY*Sov
z7VJt1Yeni8hLOMV*06d^+wxJ=_oeIkQ!w4`#*)_pv>5MuZWZoLg|tfp_=^<|!C7@;
z_7W%l(1|5!_}Wea%GfJ1b=z?Jgi*)`gMkX!DlSEWnIg2mO%!xAzY;vfRL?{W%wemd
zeg;9|OzDWG$!lgPHFR*irZVjVua>Dt$6Vx3%wCmwtd61{nO%lSGOhy`Txn7_X!ny7
z{24A98q`s#T_l|3zYR0FS}$>p@5;cn+orCke(LGrD<l6y^g7`&RN?qWEDBIr^o)Wi
zwYNow_E(xi735pPs*m6vtcw<MG!H>tz9u(C`kUqS0+*+7fAw8)mBWllOe(|_#Ehov
zMXTKaKa1DMWe5Pn>A=v(7`ObeFYN=!m6@5bo3$EKSDE|l5img7Y2oCIFxqMUgX!iw
zh+|w6>0H%pxXICx(c!)Tso09guQ*$_7mox+OwB2hD?{Eeg!kt4DU5$$-or^^8HAaz
z29uioFD}X-cwTomy!$j;tnw3IhU}})3d$m59c@N*z8?+}EIonoX%&>^G`b-Znk7%x
z4SD$$F5jG_tS6-G!3_pHrISOGSJB6C_<XlX79k)@w75L#u%o<njlB$vd_37<d!;Dc
zf&Mo>&Vz~db2#4oL=Ib|fsqBPfCFUdpsGOU+E77mtos*=(Xp;H5BbU|$r$sgu4fUj
z#9jsof2NY7jP}tnWz`*jI>gp2LYjo|O|X+$u6eDz@k@1Vu(48q-e4~6RJGg%MfT9M
z=!7&#i=n|%6V|j!s?Gu#Usj{#qG1}ae;wdFZsRr6bSBQ}B8oIzMnUMjt|sYCK*<y^
zsU{0Vqc4vzdDxKGO_jA+=a7-O&`#6$G1qyQpsl2DAu;<-Gf#B&Y|-p)eFIR+n*Ut?
zNni6_!WEL|kz(;h+_K|vDm*GV9upHs8;etOauyu55H7Az6z3O@Efqv4l$AMl6jp<m
z?)viL<s)YN;>sI^;Y=T%Pgn018!6C2fGjVF6RY{v4H87_xMrOjk?(AuPp9EXUfE(z
zP?4DxLh^iO_0Gr1SmlN<UvckIg*ld*kGhYEGJ<oUVKayaX0UTzKGoT|dJI%m=)Fvp
zhk`YF%_>QUey@=&MA-il3lX!cKhqMc*S=7=@?&7MGeeV?+o&glH*YvWf7|)ih&R=t
z4fc^Bn86`rfUvZXrDQOsA;An(5{o6*#he*$l2p^yHZ;UDZK0OBny(XEKR%!Al|EP&
z&88GhJFn=S2pSwI{*+0JQg1B$6#HN-9ozgQ&zpO7<umF$HeJV0TRPk@sU?Y`o<vQ}
z27-cN;Hcb3PjAy+X8JjvJkrYea}g=FGP1$;4ryIJa)7XXXq?(C$5nj;akzR*5Eu<p
zh*0_jdP_{6#o)Qk0d)rm<aZfAX!k@0e$NpBss04xHBf!M2Md*+#vpu#!cpr|0%6O+
z@#<bg{Qv5r04}Ge?=;*>LK5Oa^ZXDT8a~?eAc6m2(v_aBzPSd8vB!yjW3GN4%8&H&
zpje`5h`*<rI=A}s2P#c<-#q<seYHnUIcgb1>h^(5Y+jmteL!Ux{vkt>0XKh>D*&5d
z&_-C7uRuC=;OaFw1MUQ?y8BAIMb2ZrPCv*k6EM?m3@a0r1NF_bUnOQ$?9iX4n&Oqj
zqNg?cRz4?LJ_<+cV8rH)q&c}a`T8fnrPExc{omNwzbOA{s=+fJY0WvyM;IsZalFD%
zi=na*O|&pUpw#-z-U?CCV@`c8Vccd=$zhaL$~F}9{$!B}B@yYEviC;s-kT{p@aWA!
z%XTmjG+7%4i^>oB(e&SKjnG=c$oXd_7Z_+Q(SUTh@W-ZkP&uXPunGlq-3y3oMoO;O
zA7H+bMrHL;n1$-f88X|aqCfOy2k2G@WbnK=`?d1Wq%Y+NpVfLk$@4M2d$iYZL?`<1
zwYAI$c7^`%6CyO@G<lI7LEkMd)9L!v5CGwE%mynG8%ws<8A7(Zba@o4-o>`r30IYF
zB!4eVZX5bt-cVwgmIL#b`bz*83I82UC^})#w#ddyL1OnTpGaHP#O1ae3T)V{xB9nO
z%G5#zc8ex`RD?*NT0X$e(rpt4WOSgLC~L&%KXh=|@%d)}W`Y>wLs2|h2%^qFfGdql
zWso$pPe~7LmXv{e)pU`r44>^XI#tx$t4(k19xY<OeNh_^Vf&DdQF*6vS~<k+SN$07
z^KGPivN0pb-H{TLWf%4SK`^2V=PPz!48wa?5T+f}T=h%eA&CteDe{2JFu^p{i9+1(
zl?szhF}GyBFDcEWjWL|I*m7@D(BiV|`$z0WWPR05FX81E7u7GoJl$7Y36!&~{K;(6
zGalzI4RNd%`ABiOk!QTFJ<}t_rcnG87Y~C~JZPUK^Oy3K=~m56K>ONlK4#a=EBSv^
zqJa0Fo!Ou57yk%$Q~Y$F?EGeH5d!VH!Eky;MQwLmCDor0P0|1bR~l3zQFoOr4Fesm
z*x!fSy>kHT>N#lKgAh229xC(3$5lG;RObk!&^I~6thuhnqZlyNuev$D?eGy+G1dJQ
zt|g_1wfSjXU?M$vp(9qh#Tz*CBnTPH)60|O_?>(ob>v(U(J&JPY$py=v8=VwvGV!I
zXrn`G)pPRc{{=D+C!&oeIS=7h6##F-pJyG+|4Ui7A`uiBDOUL#rfgtasB8Gwbu{-z
zCA)y47(c|BfK8~NT)xpa5%)XMh+AYFir=;u`pek4D@;{n@N?7y>gLM=!SlfCx7Gam
zz44zgMt<VzzjTZYu}{LOmp%9q=#+RIT$ij3B*Lfe&n1UxgsbO-7C>f;$_69>rY;kj
z8*1GZ|2mIzEqvE7ls<?E#63eR48(oY+8p=Bg1zB|=W|T(CCo8jVRio%w~p?fPc`q`
zyNj(JSh0|ziLIMBsbl^edzp_$<Z?%Pv&SGG&t9J&<*QbnOUwEHrv=bntUEf6TlTJM
zYWqB!7;((IYfTIDj+>Ye4kQ_Eh2qyw%xWlHSMBE-gc#seBFa8~r9Oz3>KBPZ;+2qZ
z+@s^mXuCbNcB<mF)mKvg6|nv$CJ?8q`nVu&SU#deL~fh8LTNb;@0(RrkM#LorCd36
z3eSBnoZSC$>feiSFkljGd5vmStO_1wp5nk^Z+Z-esJUdYaI2&b^};xzsHkSCR7Tm>
zX4A?|Nr5b?`PiuTMeMY^az!_}91#XIuzJ$ZSva;8cq;l^B)jXOY1QU}p!)`M<Km06
zjS-9v?w9G`;7%t!GD9s#HU9`TKqLz1E;iBu3q+*PSdF^9_BT0I0uNZ6PprH9;$y*=
z6lSO&UkqJC>ihSjEjXSy#Qe5-O#-@=IscEQtBz}<dHT2p3l^+6#l5%_9Et^s7I!aJ
z+}+(N5?qT*ai_Suv^d4B_)DMP=gps&+r8PH*_pYK@1aq6^8DAR%3BvplVu}E+7q<$
zSR?GP6p7!cfG<(<n>+-;v_cHc<a{izsI)E43RC>WTnBAnAU^&uFkjnEL}0a*3Y;2W
z_d=fTUM^)12-S4^6)UFJ`1*6c?8gchRJ|Djvc^jks5YeB2;tC5Vp;?e#g)l<D|V}J
z&1B)Mzx<XrID$eS!W-Yq*(lE#^H^Fg`IkY9$6y&V|1bbKM~K+Ec3QDs*BoL9{~;Lg
zGMY?{gOYELg_{i>1A<S|u6B5!-V?h{gNBCjQ~45K)+^pICfj+hcnu%5+v<m<oOR9<
zkHc&hWNxNd-`QcBX(Tp@QYIg7qmPQjtBgBa(7lkxIgNKptOKV_+W`0(R7+S?>_>(+
z4og^CggF)%61hiK;t{vp4f(j%uOy#@1(5e~>`cUyi02S!5gL<)F-#%h<+A1g#$nv)
zRAJiS0}tYw&VR1H)?oK(Wdbh0pin6;pyD|vD-|k_(-14LC=`u^T5!N4#5*RYyZC$2
zZ$V3wWm~pLYW}1&K>5aTr0hV)k@4rWFJrs>p&9o$tACJLWaw|Cpfb75r_{U0IYHEw
zlrLm<L3bpi{XDkxm#Rd5CK>L9aYFM)3SRz{>;9{u!aLt|p3g8>&_jJTt=+3sl8aog
zrmX1&mKFp&XYxWZmJ={_q&HlEB;JxhB{;flvcU?6e?t3R<SC0h@c1J`AW)YLqjm#R
zv&Olm*(V@|$ucy+eT!qqgZG5M&2tI+z1sXm!^#boi}{&3(d8gy*Z_TZmcX6H;AY=0
zEA<^=$uWCqG;GgTF&^^|lLZMKbL!r9vr)u6*Vbyw!(*4vx&-d$tlV)l@NP44kIQTX
z$&LYtCoxYCRUc%RRFDw}i}6T#EdA-F0ueHTCGdag-B4_OdFaFveqieRFP<(vn*jZ0
zd$j*{k}O46+&U;jSE6ZFFG33bEOwxm^{YaZ%97$T!-J*q<p1P+8L;wZ4mO@|Q2uLV
zyJ)Z~QpX<p14;){MR{wmoOjSW^I%rWj;4h#EM&E3Kv>a|jDVEONeIhMeMe{$)6~^I
zazmJ}fih(oeMtG@6e(9oNcMX0`_p1=V<<Ax&Tv;LV_s@Y$6G+IN$jI7YSXZ|qbwi!
zfA*L}MMlkD*ut-~)Xh>H@kE*9k23cJgdW;M0qcv9-v>j%Z$lY`pvRYpXoUwUMfEfb
z&(}tION;0GPD(9GD2-R_^Q%^+{iQ#JTSr)QJx=?4TTJ+Z<xT=W1)*D)t*bh{_>rGI
z97UdIOO5$!Vj`a%;ij6iBYCdG@lFls&6fHuBZPHQSyyQqRo+JSygQ#YZPf@~1CRN|
znc}UOuotzwN8*k?Z+QF0k6qO3k1^3(qC(mf@T`%Kl{!^zqCpnW^7T(^23qM!`G(Fp
zHTtjHLfQjs?;gKsx6e*Lt*gxI)Z-(!_3AyQIF+(EHlVmwrG|_u+Tt+4@G&Gw?;+(P
zjHZy(ilZ<r9i7k_cjfPhaRl`N%*&vmuR+~kQeut!9y~0&^FBN3&LX-yO)1HI5*-PP
zI!|A&ok@lpb#Y&Q)I^|_onkoi%sOo?2y?mofn5DOXfwp*^iNikIr0=zYFAzB;Hujr
zV0{aeR>33!G4xzW+(+Gej3uNw!S87Dc6oR)`9}jku21<c@x59~@HMwa$j+RIu<mcd
z0HY~VOw%_gP1t4G{~85DfmPOSaP1>V)hl7d`t*z2i0lwK*QsB)-wurH4ihyW9Xn={
z<jM2e&_?`kKlXX<<Y+DPx^DJMoySMKm3U0ZQfsmabk`aoccfk?$PE5;{6}Qz%lV?H
z^7=yNXOHvdYhhVJ!=M7!vY8~LAcWyjYr4cNeOdpgPO%RlwPUcv=bvMzQ34r-qBYYB
zpFhAC#y+LO01DCH;mZT0W5c}^)qws6522f0+ZMuotVvY{AFw3aQzj0EFiRn+sWiw~
zG#w0y&9>HpkIr@<yjTNSF%i~Ye#II~p7H9j=}jsq5_ZGm;E7-T+81k#I4H#v1AkD#
z2Gfd9NYDO5mEa}Nr>}8#cwhNsK}w>zWGpFc5cSRD*4Y$%@y$j7n7!;zP=wsFhHh7A
zam<feVpB!7Sk8$LIbKLfnG|aY{fG?67yWhb@H}ebDIw{G0;2rIL$dSJlR!Q5$SZzq
zUaJTGXP~m<@7pFp9UrSobK=?!p=oG6752kDxbiVs&${I|mVL9-_sQlY3^Or-<jU^6
z<#0`vpcT$mRK_h##h)+ylLB7j$AicJalhYCE3CXt9loXy%b&W(!-Fqx0-s4Qi$PyR
z?eMdbU0zR&Fd=L?-%P2IM+j>-;+L<VuESgAZkl-7;yW&)39jkHhwv{SMu)89Umj~7
z*9pCEJ9s=`_C?))E-n?qp)tn4O>vrBytt=;t0c(C3~g@ovbD_my*Bu+Rsp#c<xjI8
zO9ja7F0c9ku2Ji6dBK1!J@;FMODYs$x;E<2?yZMp@ShQ&2r`O6vr!6N4TX@mCJo_{
zI;gO1w)?7wzel!<po5Zstu9b+#MR?e>s*>_nY#JtX`V!VO$vfswR$7Df4NTUX~gd$
z^|lpA6g`6%tHlZaBf38bt$QM>be@hO2i2=oop(Rw5eW9QP91A?2q>2vt0J{Pv48rV
z_{LS3c`wl`kO4}S$r--(+t*m?vWaVXsnNH3ya6%5qJ|d$wOE;Z8Ez+AU;ljQ68@a{
z&lN|B&YxWVEI3KHj7oB{QM0Sc8<9GB>AKSTb=tLn1s^19f57}*3N#`uzcLEeMn6IY
zw~q2O1w>-cT;wWATlu>yh?~*;5)44kcM)s7s&meA=KOZMEvsS<F|5y94G&u4L4g@U
zEczv7l2g1tqtU*@q>m-hN1Ibw3yZJYuE^*WtKCU_V)12DbzP?%rD%SnRFb>fMz|ku
zxX^*TW=Qq;QxZuv(GAUfRM$htCwnfQ9NBjuRx!j9y~leaao*}bXHa=M+fH$P`$RWE
zpxQ>H_NT6%$zs=X)n^>7TPfQ{YB7AdM&t+<eHCfV8SMQ&o0n(7oBqzNtK8+v1Wo}v
zc;_a*He2^v8q{{I&^ntQb_zembyOqW0LK0~VW$*+7ya4_p&pG@j#vi`<Fj9XvnyD0
zp^qVSEEwjyyi1xMHlOoyAZafz1zKRj6sc<pPgc(+XxJo{!@JCxe|3{z$gD!peBRGA
z*_ef(v6%K+*tjQ6cEl#H?+HxRrY25J3Q3OFO&klMGrAaumq~YuY6wnh9$O;X@>MV4
z*qx6X{Bn!VzYKM+i$v7tWo=Ltwh^U$dlicnnEHdf`dgDY$=fZ5z`#g&6XuMzB?JB%
z3E;_RaO^;0f=ZZ)5gVK*?X|<U1jjXI&l|6fZ>GBq69Ze0M*+lz81rQeReX8VStXxk
zbd)g3Prz;TvaYmL_;KRvfXw>Xt6>RRv??$BoRc4I%=&gOWiu+91uLiSRT&?Y%d{|W
zf{v*x*1o}9y98Wt#57f*vSW+2BTb@`G~oIQS7iS9yhnm2(eh3+c@S!H1t&8P9g4=t
z!f|)G2p^9*U&`YX!8_R_S;DThxh&{$$-SDg70>GLM^#acfr!<%pH*M+zSXev$mHv3
z$9P@_1gKFnF;79X9gZm_l-8+FF1*E7Pr1rffFGtqcE69Y7Ydy=opS#UV1+4MGcOFB
zpr+Nqlv#~m%MS#)4(Um<J$(4-<7bvTJhKvwu$gr|G0*0Aa~%1Sl*K!bIlee4ZONVF
ze`_AmTU;Ndor*Ir*rYW=<C#jUFt=CM5Eu5!c0c~x{jxcsq_B(_P<qskX6Ce+`-%e^
zC4-w2;+@F;{BaY(R)^^4L!mzi1aGoK+WKv;{Y`ww-@3|#T-6e>haMBYLLxR0zLyDZ
z7by2?DHq*D=a)%4)=w#Us<{U^Bp1A=?@*q&+0p3y<C<IV^YIbIXwg`XyBdbK#~+4P
zB6!e!cVyRkoo<<@y>UaMN=ZgZlkvF>eDbxb!C$|DA-1u!jfd--$#+yqp-Uzt{}bHy
z+~{Mz<;eH^N@ZsBRc1wsC3$msDn-I~Ji8PqCG8h0q#E?+?BBkvd47AnM`ZFMVlrDE
zhqbJkY|zN8i&TGWdfv#fYM!uT?JUwxzBS~@s7JKJox2a3_rZ5X$G5(W6MQUG3yXAn
zd7P`}K=nE6Kyvl)FeiY=adQ89(&e+5yM6Z@h<u5OIz9-$Y>zYiWjk6$^O=vZ4TxzD
zF2xcMY_mJPh{BCE>f<nMnF=Sct&@Cmqn>ANF26=>p$km(FVMQdqj4_LSPvK=wVJjC
zzi)Np^IJcQAw2wds^G}v;tG0+;UDN}N)A8Cd|Gs&j1wTN-dZy!%$#$ia#dJ<!yCCW
z^F5){*`@xl?_ra_$fqFyp*RZUVT+*_^8ny8^PTAv^3P{RL6ufhwk=2$eiF%oU#oc*
z#G01P{cvInp*=>DSV)#4J)ZZ8`?w_5r82B|JPd2qWSS%z)&|;4GR8_Vb>FC!c~lxN
zLeu-qT4&cg+;d(}*-8E(9MuKD4*44;vAJ-I*R%(h*tbEPc~uV?7)NATj^RE~N?Lyn
zT};!=a^^8odVZ1X3Te>Y)%4Q%B>G7(fIxihj=F4QHx&EANoc6@1WFqnVSR=6k#L5z
z6vAw2{<=*23txzW>}Nn!oijK;2#t5{gg7Ctxu8nSI0hqR)+Q}!TEsaFgG8yU&|*v^
z<o;^#8-$Ay+=IYXu-|^h_v7$xNWt~3S+pdP<N8zV&=tG?%yws{O~pds!>oWtBM*g<
z9gFF$BLM$sBjjXDg0Qz14%KdCM#=q)Fn`;)*KFI@F{2>O!Mrm8lfQmlNAqV_Ghu7l
zJ)<VW#jMBeKbE&}pH*-ZBE2C=2?s;VO>?kS^(e>R<Iu;EY(0~=&7>bNW+u9q3?(x>
zS8o{_&89=R#qxoc&W;>@T**m?N4vXrSaF|@-$0p^so1x)ZZD<%7bd<;Ve*Uuk{wh-
z+6d-jN&n^}j0=L2eRa@oxaLwOJZauHuC6TD=;?2iXNgr?VV_X(6iN*9uO6tv!V+V3
zT_wdG%So4dYHW<7&V3M6VwhoJ{5nhEahm_x)w#pmnXFviGcMn&S~F|CIu669&{6kt
z54rsLn)G4lu?TE-s(U3uKJQ9g!DCpfa_YD{`nBv0?(YT)2VcAK+%9~7^Z@9!Z>yr)
zb<F}T**{lvJG@J;gW7&{btTI@89B|u$wS<)g3r@<&OQ1?AKrHSYaWS{2gXu%Ys1?c
zNm5w6Ieg{^a=6__RS<G_LMYGFA1A7zR8Kl5BZtHX@`WtPgMA^*(16cdta*#aZSf3U
z#%*e;ZB5l{ZMpvT=i|i2EWR4fJa|;|K=Ir3Gq1sI3<pxSr4ox6{?PZ0xpz`*x2VYT
zB=JJhwZ!U6?_AOHNy|h&4-x{`kn2hGYVR1=nMtNo>vjWzeu#*-<<V3<(yZs7E(oI0
zCYBnAmr0|q)%GS>?ZZg>=pn(wJRN;{DYi!<&R*%`JkSgyIl>AT_#7XGe}si{Tah1!
zK|6<oaPs2t3^@?B@WMVF0gG;`gpwR>N%^eh|2e{GdM2=YRwa5er&zy5M?xq#UB(RH
z;2f;o9KT!R`dt6kh3l#23bliuaVx5C&xUk~nb-RS=&lm!zIJ2rHpo1EMz+%}bUkKw
z$g){}Z#svfQF%pri8|4H$rGL5{@MaSnk3HNQLo-z_BQzzuUZ`DMK*E)KcLzsmX>0w
z{4;@do|VyQfaJjq{`$0+F@0SSqjTDOz8uoo3}jYtCqI&dUuiH%O$Wgg5!6#=8+Kkz
z^yzMJer|n3Vib<(&Lgbx(j!T!6a?w0SqTT#xI$-|S4bw7lP7HR-Vo#nvn3kc1o4<a
z-EA3+`w}&`NY{rLyNNsvx~@OOJ2tVuq3F>Qqg7lc_C(kza4myDn=X($_a>*-l=i7j
zEAt=$=DByE+Ec!B56UbMt!)^&#v)}!93mOM-T4oB<I3MNM{Oy2`F}Ay#1Yx_Bhy%m
zz9akt)p(B#Y71!ewfo6oc#aOzDYSm)GULndoZ%emAX%O?HsD&yqDWhiLI$+70J_+K
z{9h7)XN4b-N0ivR^WlU)Er9^m&$3P)&t1Mx$~QI7Rj+4QKHFY}-hz8XbF>&{aaawT
zfqN^d#P1w2uqv#OhCpo@7PrDuOl{p7#xt41dh82Z*`enAeB9RYTPvApt}0R%Ia5->
z+|&X?a#Bn3-@ZPQ{Z0{l!<%f!1uZ1}?7vMY?50@XN_R8)t|W5=*#E5AhJrsjYS|T<
zR9z+On&buBJoR-wDuYcPpLk8?_V|d4pRb%c<o(<o<4<54!!8mQq<X>R!E6E_OV312
z8Smh+a$zptV0S$%&tF&HKI>b{=gGWlzOC0!uQE-Z{?9U|N+YnOBSL>PPlL=06qloN
z&%E}wF>1(bHvd8E{q;O|7OnjVLy8JssWcjXoF0u>&46`9hTjfb(G*DZnl-Cwdk5ug
zR7n%4d`!?e9Z2{{v(@rE^=J7>jJ{-=k$iWcU#E{=9-ay38;ESgpo`G9)|+N0#!guO
z06vu1p;UHioTIXMqjqAm+Cb-#-u2pC(PmeGAal;756PTc!NaU1_g!B&CYIi;^}7IR
z@xW?j)G7bG`!v4gPRp^oHTS<AywRU7W}(ubW|AtX$qqS3@0`T3fNHO@jH+dJ{uySy
z%fJhHq4JIlJzU7KczK1G0$-_PN>aK0W6W9M%{t$!pO*o#t+qzdeU<ZOvK$=^f1V*1
zinf0qgAPkk0!tGfM1x6Im6NB*jwn*nCXM=|-D_z)90oGg+=6vp-zj#(hhEeo7P}Ax
z$P8@1CK?L_2u`ATKNCFWeU{ttFvRb5)_A+I-}yLv-+40-MR=Fnd^Vo;nCsqoRkf`v
zLEqn&vsZA2Zmty^t>wnjFzeinKSX{~HpT_B=6B;W{w(q{lT<a7Mj@iXKHT6%AeT_P
z%ou98MO=|y;9*_K07qD!$j5LInY8yyV@<S*?+-g+>V2NxrD%CFWrZzOzPWRz0PUFx
zXf&xjvi#lPprvhgaq(d4J0rh=Vi3SfC>ER{$!PYFr&5x<WZ3U5>E(2%Z$%l~&)LCj
z3T8t0=8o9?3H!_>&RaPm=PV(Hoha8o155QepTc>fZa+hND52%Z;qPAV+7-KgNeU)o
zCZ4Zkf|dWDcd=)A`&$R3L7D(&XwYpRy(yu<QD-71((@eFVEBTpRgT(IiN=O_>ieE%
zL5frsvk|1f>1ygF5SH$xZKem^%GMsdAfp<3q`Z0=N;gKaBc#p7Dfs|CKFX}Zt*$6!
zXo)Y6a?qrHdJDywTSD3qvQqpl{V*~GW)D>{w_kT>T!2>yCerB*ueZ(Q>3vO2TXTkD
zw;WDF%lLj%3GBc-#0gXJ2Z*9iy!&095~X~Av~YOPSV|&cTfVp(&%s^9Bk3c_3UW%Z
z01@kz)oW9|xLnx6&=jw5{31rF=Ru6B1Hk0>d|-%47)xW9nK~d;SQap)iTg$9(!U8w
zzC3Z|XvWPO4w7Q+GC(0J%*Ui~bNpOYac!XXQAV#?Amy%!=2YQ%m<K=V6D6i*LXmlc
zmX}dEd54*UUHdS1gH-7pq>L_YVo-)H0W*e@2~DHClPq&Kz#bumAQiE4R8QHb->?Wj
zFOwwE=$o~0a2boKjf;D4z!QDP(sB2UWgOM62Fm)ha06l`I>G8@9ZryuG9!``|5lF^
z&2x8{zeJNZA>IHS&Gfkc*6<1VRi|Dg9xaMbP1Y%h9|Jd{TPo8o)oNaTNVilN)F;yh
zj9~IVim|yp?Zh2Go!wwxQ+A<yt{Ch=SJiEpf5A4Bt?y4x?#QwAP>`R17?3!r(MHcr
zXnvxP_=s|lxX?}do#dlk7z+J8D{^sOCYUMv8$7XMswV;+@z7uO*bI*y@yDolMoW3Q
zKEc#%uUzYW(Ld@L4y{y}a?)L?y@(5<x0W9Fo)R?4gUKU)cOvlAtL#E(YwPY8E4K=7
zIqu?330J@_-@%O=UspSqpGvyiQw~bS)B_7G&caKIwuR;xkyT4G=c?#vtLl=7bR0O^
z$`gO==hX_k%TB=Z?+V^?n+;^r>qlLAKmA;;7~!i!9Z4^C(@F}0w>IBb;S!YY+H2eM
zC7*3K=K=Ai8?*oM4a{f1qiZx?$fi_)JnR3c)W9e+xzLx66w(d0OeF8wYcVWdKTJTD
zLY*SA+Re_KOtsabJaMb$UGI!@@Ly3;8w0+-DZ|6v0}BYoK-mNsvBXiWk>J4ZL{zan
z0g|AE^%+ST{0SdUe`B>wZ!?a@%EU%x>KGPUZA;ToBBevd#)LAJZZzpQoyi`j=o&uH
zz3H$&%B$f$wYsQCK2;X;I?>g}G=3wNClE6`wLkW_&Um2mO%@YGLLrsDU<>(mwo5$;
zc>rf6bf_nMN!Z!gUtCPX;bFsf$p>wAIsSVZ=>mZt-jCa@Ss+TGFCP|p1UGyX2(P4o
zvK;wiPO(-okq+5lQ6hUrwP8wuKfP{X8nw2V+#F{FgM*zya9(7*iJ`q#zOWT&&8E!7
z_I~;~W)OoKr9yrs3^lZJ6s5?MhVRf9%^;e_Itjv&s8^Otun3mHI7_F|he)x+wE2oF
zU++lBsnNcJ#E@8SEdB7)g8h4vB8q{?ulKhcVj!Vrwo?&`%@i(yw*Hv=@IZC1-^>Y}
z*BfnUd~VLHN@9BcNT5rwGuxzB9_c-%iq8R6&|pTxc9Auf4Q)0K$!(LblPwF|0L8@2
z_6L679a=JIW<ct*$ChNmE9GNIa`vKnOM4X<9{{K#hGzIbASDC`k)*)Mh?&Ebtg#s{
zf!BPTfkmkEG7yJ{7vC3{-mwp89<C?B;#LH0<D<nlvYdtfww_osYP1B0mconm=iC`Z
zjL4S9Ygi?&uy~IjpN@k)DL&A&`B<ffq#6~mH|5Wxuzcd#BeL76T6_S;vWPZyIpsXZ
zkZ^!<73t-k6Wsd~xGfHTz{!w6zL}s@Vn1Z4dXkRD^PLA21jk<~Mg-KgQKJ-oEG-o{
zUh(i#)^~X6f&KoPJx_dZpnGrIH|cGUySHIq69Z0&lo>djGM20}l{{_IKec3{%gFPh
z?9ny?#&?NcukngaoF~{4g&P0#Pb4QjS#Kp_!_l;kWK{h%%H8zT@-m40XVTl$P($t!
z?kAgW)n1L$ebe`Tj5>X7c6qPglN@YSObN!qYV=AGAIh@X#S8TDIKo49izs(kxT2V>
zbk~+udUKH9Lh*mRlnIgCItlajQfNk#C@@2p(DPM_M&*iO8PRi=sm+rbq)xQI5c6pZ
z4SuoxR;qQ?$3KTkfu5>G$VQne(u^<9{N(u?^*2+d#D&_UzfGvK-eRfEwZ&I+3%}nE
zCvod|LECcu35o1DZMzb~Nb1b2fN|vfPFeig2WAOdZT|x^6JZ#N9Bc|sXtLhV72PfG
zV#jc@?=xsOdyUAyO1iCN;G+D2yE!&GR4PCfYlprMl3@F(!HRn_m`je8Uw4Y~STNHu
zrN1Nwwnabl#<K>D7D{i##hDT4Fq;E;)|K=anj+N)NG;5Q{NIG@j`wBoWg`Xz=<6{U
zsz*YUDA7ZKMKFUhR^K>X>M-*H)t3VCZ5YbBLzwV(D!((Qb=N(}-d-1{+9A_1!N4%8
zat70QV56%Qo(7CDfj?7521?@iZ&2Yo{xsh(d$wULPQ$W{)DPPrMi(f|3si^@ci#c7
zGptXOo#+;3AXqpWV%l3!B-n5*jPp;~7|XxE=6zXt`NfiKnog#`=55rnR^om@_JxuW
z@cyd=LWs8`1wE2E5wrDgS$~@v3=!bKL8Qx1CUklh$h<f-8JG@J-dri%EgD|9Sx<Z<
znts<3!KXIN8$1!pU5tm&<G;f-!yr6D-waI>Vo{$s!`G4u=m(1~pQQ?KeWg02^nY-f
z5l;M-hY6|k`;(sK5A2&SwVC4*s!wvats>vF^!xkfkpvZj?D)bJoS;9Zql>gdlKPyV
z)~T5M&}lJAXXI&8oKuSliD<<jfBLr)(WoMddE`(<g|tLaJP<8X81v>NQs%OeG#L(T
zlS!g#)iT31?Izb54ruPd#zpaQ%nv|;0y%4T(!@z#1XL-ph!hvgeIL#e*wQ=_;^}VV
zQptghsVo%y(nZ~;xraEO)gio~d<E7YPg2Zl%*F&bQ`8vH7&YI?VXD_LDu$}d$d}kS
z6E%*`_ma=Et@?4DeY?p(nDvc$({wBXd6a_fbqjWvaOS(g_+mnEjHr!n6PPL-TKr5S
zhnN$t`Fj;DX(j%$Ar{&CJN-n#R$cYg7~}WKq)FA!wd@;)sw7pyJav9LX*_?^8aR7<
z_~(4)e5y-0p22>{@NS6g1BUeLPyvnsuCJMJ2hkK#XBzYa6qVN!iDIP)`gw^2C6Q0C
z`-ri>B(zh}t%lgtKSk7B|9>q&$F2<W?ody;DnA_wns0>~5q1UZK`+VycQN#m!#Z3y
z0zZ8g=PQf2<sA+!kqIm1UIqgg9sPMmjp;xrSOw$@JCb@BXdfPd3HJ%G55};OD*al(
z+vH;AclGRs!*0xO>PQoMh5deE0Xyvm>O<MoWR?&-27vEHh`<$*Ws{uSt&0y90SALM
zsOEKjz1jWVr4Y)tiN~2*NEZE4P(sDU!8gAdj+S_*J`<g_labKG+^}eFRs~`V<tHG%
zPs|5Ff^GHk(#w$0IkC3`z;uyh3HS<fF5+K;*zxuka#B``vFwSVB=&h5OEXDd7gHZD
zFx+TsRT3$UM}B@Lh42&p3;?%?Atrc>iID;hWilk@oM_4(w1<+XRHK7`T$d`McK0yi
z(d4=fd<#?Hg}Q%^rbcW>$q1KTS&lEq*p8#o5#}oi`*O%=u}n8XytP{u1i%>CaU=jo
z22g+Wjl3S`KXI6nhtPH>`4aDG-Awf-XG^YIEXw%3pA`D+P=9Kv4nV?}FTkF>NgxIK
z?X=mi)Amq#JSrOxmVCmRA)Gu6E#v;0Q`D)-C`_y`kImcFTPg8|CG#!puj<AvGYPR4
zFE_Ye!_*~fo<4|6S$H}VQ?)P}ny9gxvD=SI084w3F*s=Mn5~jvn(O*?gk)r}RBa05
z+=w<DZi#MVFC9e#k&ipV3IgufFnWKEd%QmOTlvM>^-tF0v50*d9(AZH8f}Q4!LNV>
zt@i^Lf{X_{T1u!3Wg&AdT`Cl8bZt-^8hw|^E!AQK3YRv9#Q1<h`5k<fTlrsq3}+}4
zZe#YZRj%3ZX0tT<-_yW*C&@dDhbdAY1_vCaT;UJjoAQ2Sy(6Lwza_*mPgF0=GSGDC
z``{Uw-cw5KdxA5VK3JLw-3Z(;VmcnmRa`LobMRA@%s34foi+vz^U>XJqCAo2qRPZW
zd~ybW9b+59m*~>E1>%#Jkef20Kt~<vP3G{U7BWu8cAOJ@RfFbrw7%=*rUa&f;Dcm$
zP2qzbJW>r|@Hr>xn|LMgDMs#vtaK$e?BX?8IV_%8FEO+cqx3j?Mvk%41RG@PQ+L|k
zO`RM8Zhx#>L|P`f1Xa#{z4zUJ5Zv!ZbCG@RiCd-}!0WSI%a+j6-nqNPV}i@q2tgxC
zSs~LSh;#cw4@!wrSCwa>zl*{tL5PbiG8W^^7te$gstfGIX-KyG;5aKlCb(6qi^>Q#
zjUSM0^~aVZ+<~;vgySu|cfV5#<HG)}kX@X^Um6VI9VVyyT-B+YO$5mwa*UlaAr3m8
z{mbV$d!TfK`HZ`9AD*?ba6@@Rm&&dpyvsR7+1;YA91W6Yirq1-Qf<)~tNBYA%RQ_)
zNn#6~hGIq`hI=E8PQQsEv4?#8s|~)2^>{*N0D@<t@?Fq1hm8V2e<w*g3Bib784BfN
z@hlu<mC8^+agtE27%lk7fJ&dTvdO7Hi&v>dIi6}PS8+%7-pBZ!%x<E$d@;9W4t_q5
zqnu7fsepH0@EV-E@yE>`LFI-{OgInjCbQ;<p(Z#BX;9qld!5Qmso{mT1v<RKL|X>m
z!>?Todn;0g4}HU?UeRPDD)0hSvP86o*E6W_jyr-A(*@#9Y{6$50P+vd-Ssm;iaaz`
zzk504ZtD(*)zq^3wYeG4Z^A#<_p@ubs5`GvrRkU*gkuYg`<whliC%kTN+7E<Ec4k)
zC;GEx?MOZmVADe6_DpZwg2fA8esJCunuVkUWAYsK(o_Au7$hytk^D<Gnt2(!5w3m|
zRANtr8G?lP-a(?i!MWuZh1OF^KGcH>k8_#=KZsS#8mVEx6ROtBPmBN8$u<%TR5VtP
zb|ZFxq~=Q~&qVKo-6w;6At~!8t+{LG-zg<)EPv#yis_+&_)*-t{~YHBm-JVZX-VWw
z4&cjbN7H&SF+82vhZgA%QW&c(M5XrVNOawFgm3)(b5sauHfso*(JaQ6fy);IawgBI
zVFGQ)!flWnM7c<4p<1sAS-B6lSG}%G;~dawnhXc}BP7$2P;e@0mCEpgBZ0QOchdkg
zhh`I-pw`-#;Hh6O=1Z$7|3W@hje4YxxbXZoHDw}#axH6<ah^5VkJfzT?s-FG<0%>m
zjhne|h^;V92thb~rH0d8&k7mBd+ak}6FZ~uqiRfiWPXl%b=%AtE>s&lj5c&PB_hfU
z;%oPsIvl2hp!(G6)I;%Oe;)I!DR{y}3|S}*(>J@32YP%$iai<#tVGMyeihcG6{7(9
zNN8*~7j2jcAImVaL^i=<c2xdbdxRLwA7irhovZHIZW?x^=sUkVgFl|e{p_4hG#sJg
z1E#YeRb%66v;HbffiX3gWbQ^H+T?1>i_wYQ3t-V{6D(xgA<?y5d->>lx_LrqidJ+$
zl#i)AdZauJ10ht+G)F5@K;wso=cBS*zib&=Bs5+wh6b(ZYDtB<F6ht2t7ziD+?>s#
zawq6HW~+Q2jX;Le7*xfVc%+`>VZN>1pGhJ?D#uT~dt0#^a49RPv0P~m!>(z0J}lGa
z(yz-V#`EeC&Nt()M!S5gC}%<R6SXWqO==;|H8e4B2G6M%%qoT^vmKY*-kb_2uh-I)
z)Rx5%939xF#&EsE_H?3~VBbI;xYMJ8DR{5u-%ZkElILU?%@S+c&mI{`slX64;IGU`
z;0ti3Vf(1@-LUwF$UJ>M4e|9_i1q>HVc>)k=dT-m9&TvI5J2Nwd93q0d0^p(A7$@K
z0;n<L)N9b4<R*v$Z(vj?4R*K%Vx7w2cwx@zs4Blqe`k`!)WAq((wKSjk4WPgpGg-&
z6g<OPGb|~?=|f>a!ld>Dnq-5KOTRiH=adRLw^*2FNXZu0IspYA@_nd^-o5}K)ZVSH
zZ3%T2o4pVjzMM?f%}6!hxAHmx$r~$wn!!&1NBsaW(J~;r+V^Ynu}9wTCzh+Y+M|-w
zfPr9*9<QLpr5r{}w63|oty|@GA{H<)dY}rwS9iBuVvgu0W0j;iFtgSMXo3z0jX~z1
zi7tGtShbhJwq?(+=5M>7L0f-C&EUsO=k@Lg170M2I!Ypc%Bbfg>?8;(Hld4ked7sg
zpFkzeDgGCR_??EC&yCmacnit`VARtI4i)kEkz{yrlCW?g*RvmkWxBP)puU|zoIXpV
z?L#)RiSf&RF+`Wa1hh*3o-)J)hiFCk!r*Oi5NH6G?ShCmSwb!wA)#S5`Q^Q7r_5S3
z6G2)&&BA`PC4tQ(j4@`X6pOMW1l2e+&K?Z%?n{{T9#0l8_Em$6hojO~28?P4S9HNL
zI_~1mj8D^@*e;en;}|wh>~{nszCIMyS!K-Ts(mDzoe@!6crMtGlj*=hU#9FT+^|h%
zM`rfBViG)7(IDhLbjtNKgs+Rp&4X~$Y>QAFa_^nbIXOK9-j>YzoPAj<{%hrh<fgT5
z6*br|So76JB7?=`2w~t0Yh|eqHmX~siRgiZg8|4C5$62b!T;g`tETa47OzisJ*<v+
zr7}vcF0;3kCQ{ps)f5x`-O6}y<G798<9;|_T}%q1`==LvWqumdyl`=1TKu{xS>h=^
zQ`ot4c)w{gA{n6eK{`1rggk*!lvr;rk5*h9!Ex_CK_Qa6GMPL0XYDEof>7oo_WS+C
zSdg3b8?Oo2OzGSYSu|EMvOSr@j=PzKC|QZ6-{3HndTsA57>|)S>Z<TGX9$P9sRASE
zc7fvMlCeDn^t6&1OfqyRSC8?}&P7`RqTgh(YzliR!utK$BC-amk&S>U`#Y-`tth3z
z#0uW>l`8WRa)lvfvl9`CqW9FF+{2}$&d45ie<r1<aFlvp<uvWL<10NV*BFt>UtW33
zB1DDjV9}DfP%&Z$`Hn_x^NdbIU0C7v`+#7_nf$-pxvnz?${1T?aPsjsZ>X~e>45M{
zOB*@B*u9V-T=z|g7#0M!qoogTX#a*>$IhadArz+_Rq5m$Qj2o`jTDP#3NtRrn5HmT
z7<w+xGA=}csQ*P-e(i_zbiA6xUmT0|sO%V1^dfm?2|4Juqb3j25)Ajnti9XPx-p)b
zke@FGPCsNg0uie4%|D-_HmYf7yR?<}gd3Ue^wv+Z=zKep4*v2&(IG|=CyprpH^A;D
z*Ce!j_8>56$JsuD((W%3jwC_AH1DE3j+zmjP9+DvM1B<*O<Dg@*`}9%mFYWcywc-%
z??o&MFrF^MtlnLaRYx$8`@!nL8#{o>h!=R<MTIT)9QMt@V)rG`>GE?bdTcksoA##(
zJqhp9TlBU1WcM*KI1|6qVf6>{_e1qpl<IU;y#OY5j!zF!{b_pIJve&!-%>j>d95Nj
zXM_4!u9#32w<1+JdK31nBuzA&6L!0;702YC9eX5%SnV~{R(fR0FsiOuu;eoPL)a~}
zvCo7S)d@p34ZLxdw0iLR!hw<k)=DLr8O}ti%+jNo5Tcvnvt^{Sc1ty{SME}tvRN?(
ztX6*ksAPI2MV*WsM<An5>hfN^Y$-M#d;?-Gy{wcflM58LKj$M)Fs9XnHb(gP7e+hW
zzp-73u(ZNbjiZ;7q0jINB4_xDxeuH<9-58P*|bTn_SgcP*o$*nr?nmH6<VJ6ewvkA
z`&W)*qRj!ZYC)@x{qc9Ak}E}G_!Qv{j?BuA+3zBj&C_zfvhrhT2()Ddh|SnBj7XXI
z2RU#G>D{oN|F#Gm?0B9|KQpLUamw`#JHDB$SD(h~J75g0o>0SkL%`U!S6Rop8C<nh
zzZ*gRbbm2mR4I`eNbrz%WEgT<4i&;7BR?L6ETa>${YuWISH<9C2WjZi>W_-Le@oKg
z7IVZ0qh~>|rlfxzzA9i9S*DvjcBvMxO|zE4soNwVaB8v}gUpN#`R!todKiLZPZ8G9
zG1#Mlw<r4qlKa`<jR+*<WcfW$vjLSaBdOcOsaM}z|H^7qKK#Ii#VqCH1ml-Ho0-Yt
zkyZDZeO|qln$<K)B#VS9kmi+GC>(CN_BGA^9^^)<R1AD4#3W=~=_uBnIO#<hdmViR
zan~IaN^4Wp=Lu(lrjhHbJLs7_wz7TSU5N`Bb5;y<g9f^O)}aeSHqFnv%wj$P-0yXK
z5oqi1Y>MOeP$o!txa|`A6{4ZY+-yKEjGqFbG^qN5pG@~H=r~PLsXj9OW>No>Wv0nR
zs9j(`tIV4xC=$C9i9<6=I%_PPZyXZSydr&C636DCN#S%-ffQpQ`|h|2>6H2PPJq(N
zT5c5o%Na8fz&aQ%?BSriDrL`9q<(=OG3tzuI9$BHQqqX(JjC`oK3fHfwV=y}JSF&q
zR0EU^OF>b*DfF|p_=eMW@L5aEhvJv)!GR`jYuLlIt}WKx{t%%<hw71K*17;gam}o6
zbF8J>2!7uyJvwPhp&TYhyNXAym{9m$>Y5qXw~UqL-`eDoSx0&Od&<(0@;RO>%vc9C
z?L2?%I(9i>I*JTXwSD}LlomF;yL-wLZ-wYyc79-T0aT6P4oW%FTYawuo4k<WQlCz|
z!b}nEkDnEG<wAU$WdR`{d1<kr=nlQGvXQaf`M{A7F!#_eTEe*D4<F|kVDDRrr4&E2
z!j`!ZwaIH(ql};-sROQrlexPub5##M9XR~$YO+KA%3T)qzAX!c*593BJe8)u$BdKX
zCPZgD4b2JBgb~!lz(^7O<>GBnM#I4`&xn-R<xcz<IER+u&aCdY?$@k7f)~`o6pA}x
zBCW2<nhC^S=NQ=8c%j~GA`^shTJn3U>8tH!&OpMvD4kGIgP_uv5UCjm;VXT4Df#%$
zXmcuWH*l6%!ktHKm5-{?2f~6*PvU`EWmswW_6ZTK?V4q?kEWGj^}LMR2@cC{WZeb%
zqx7)OA9-Zk4~H@2Oy!PbC#V!WT|PchC1hFx0gMS-ak8yji%_2dMWyO=@$$2P-+0Ky
z*Po<})A|R|qyeF)$8rJq4djf(nt$J~R=^8oa#yIJpoUI_hPqH;AQ8<J-R)uDT@JAI
zGx^fX1)8LUxFu3%Qd3nz$uw3Kgj}%Y@RVfjXV=~c%%|z2h$eRzX(L5}VZS547j05N
zM#S_PKn_*p0z@*HNv{ERBE`KIxiV>(C`4<FYh{B|Oi4$~jA+fD@f<U4f7qc1dAGHj
zP?ZTS6|+XabtZ!%-7`HZbi8C1{C3P&bAz}uxzpM-Oc^ZwaFLv9^z#t#!I#o<h?>~<
zNDPE|6_6Zv9oLzHpeQP7KAwlo9+|K${d&Pb*)M8k-ve=i@{>SXZp|M83U4-RWB5xW
zj94@F*H|NrIcBi?yX$D=>fzFIzCI5Ko|s$4#>Y`dM4(vH#R*mKOQAQj9&X^J#9P`N
zh@Qu}jYb11k$sd66kR5rU$G3%YF^vye)fdh@piUza|Zla4ZcoFw*$aqeW(g(CHg+4
zE<)PF0#EB6V-5<sJf|pf&7`KtGhWCg;MkZyk4>M=E0rNK1QX$X2yQjaGG+%Xjr-m3
z1_C?HNxq!Vde5IEe~QOR#<Cig<jwz8UkZv>gu{v@yl<du<@O+4{P=r2HXRtK3M@SF
zPG!t5E0%`@IxZ+^1sHw#m!DK29jWjAWXB~9<M;Hmy6^Hh8DeEKa%c1bfiH8H<A=S!
z%k?qFS0;yV`%-Tp+8W$d3aD6R6>8?i<7Ju@CWvo&!~F34*GINhp6CS&ofJ~G&@t}P
za+--*0Advd%MoY()B<yB(|l{kwcsn+$|ftq+h^}&E?|d@vdfJ>paHEP*?;+CPa;nv
z^=b8l_pqZsbiF3p^&Utk#S=12JND<Tu5lXE_b2x&E+*smL%Zg-!dJ>^%*~9(V>7^I
zYL0F8p-x|*Xbi;ZQfQQA@|>C=CoS@zw|NLUp42Z3YShr7S^=Zx>#{+QI%bhuico4l
zh-x6u&#OWq9TLFuluBRgUp^h<7SjOFX2WHcoEvOhq7ks#zl9<73B}Rn>opKFdY3j(
zj0^F0mM4NDeFpeB#ESB8Oq8r4U!OjshFa;6W)s);1#Bli_VPtg8ii=`ftcQsY#;yz
zCjaXSKMg3n&IllqmrUTEsECFVx^<9(VAL1`U0p^;2@X<aVqg4B-q1#wf^$)Zjd5;T
zh>Jc0`e)~ZdJJXT^PKza7)QfPxdeX6GHy~3$4PC4YEQZXF`2%<MOQ(^!p8>EX8A!0
z<(fSCvr6A3WIvEFfjB^bP<vx~SMi{*x*@Rz^i*z%p@W!G1bMpO;ZU&4fFVa+e#Vyc
zh9=wl2$d$huvdhSkvt%dNPKFAL9{D`g&{-svDl%mhvsz_6#bk@ZkrnT644|4*up1G
z(iP&Bg83(}0#Lj>LJx9ej7zU%G;ss&f8?sTU(HXk${}WHe6-bE<)wA~j!y=#ULi*x
z=<dO07~w}g%<K9&tj4TL`+8aFL-{ltfd9m1_QmMs%`PJK)oOj6*hfN6pfA%P+v+-r
zpxpl^3&^D814`OwvT%;+IX||@@hyfc+c=INCYS=UgB&+7IhdS3ei$%h2St|WAAv6Q
z6h$eB&NIHlq1`$YaX6NP;v-SDi!y!pn`&6dKm(rHcqP2y+p@nw4wZ)eZ=*uP>5N(q
zbFIx<9@JD>QH;ayjlu~I8iKi#DWyaV%{3zC+`y9Kad6<@+|Dz4RoW$8r#g=ZZ>a}%
zkihq?nob1b30?-C1j@z=_+Ru&WQLJ<hi1l(!|?JbPEet62-o74NK5E(GnTQ~2(N&c
z8&?BbuMOgVq7`IBFdsk3MN#~Nj5w!HMBU!<T_n*@m_(g<SpfYZ(%*+Us7(N<ji#(j
z13yUUw*#<3pNzV;*Y!5w?fioPlHs9Ue^+cx*4fXU0zlV2{ZWBj19_eGvVzF1-4{;e
z)i@YFv2FSHi8+(wj|i{<FKx#s^*sMJDijZ6UXRYl4OcRO1Tw(r1h`WepfFM5)D<)8
z)>}FMBMBab@AF`Vt>+$uxm$e3ddyb(Cr<o^N0nI?KREz~Apr%H#3m?yv-Yi157ct`
zFt6O<@QcWkj*njle})iG?2{1pY%>`=V!bFohW~GDR4D)Vzym8w->GqoeD`iaLR4e=
z(U3u&#>*8-9JI=}z=0CyP$Co*Q70%BgcH<LTM`ivB`x=z5>uR4We|gz?I9B0yU%${
zn9reRya+f?Q&brwdsOyt^m;1&_!VO>#gu)FNU-aXaJbxm$?u+eWqnw~F`17+&Vpty
za`saM!}ydW^cltSf=x3MXsix*TtF>{Rf*cK)$?XC4VSnI0xU4-rM#&AmWinHf{n0s
zGe<}Yzu0(VAR{%~jiq2?V9>TG(xP~VW6b!p(4lT?l_4WJzvfS_lvrC%DkzAM0F*J+
z*>t!d9>9HCxn#E{T8;8Z8VRWcb=L~JAYJnO5EgHlEXU9+*vZ-~q_e<P#Aft0ho8Et
zLlMHd_BC&4-nRk7Z>9{;UPV-3DV70h;Y-i=_`ZiUfSeqGWX_j&nLKrnk|>YDjeEj+
z)WkmWAw(|!u;=2|0DDo)uF~)=lfwRoL$UMRD+muBt5QP=Eg6CgpB(Y|R~U|s#<7-H
zWakuyPYY3t{+OU{{+1iZS>SQ=TleOfWP*)fpXl<w<$p7X&#PdF10wW>TPP_*L14JB
zey2)#YiQ8b6@K7vMB~fl`7NS7q87U1xw|;`z{f2j2zsWN`dh5-go}Hpwwxwtd&Fds
zjBU8MsYpt`^O{~{c;P)3V?$I@ISr$a_%ysaiTIcAFcJDEZ)KfB)_%{QPH?&Z>B-wr
z%Y*cxZVxJAIVO0y!zt<b@L2@O-98x&-O#z}#pJ1`rjXnZ$Z64=PCYt(Rj+~06Cwit
z$w^vxexE>@A|O6aTlliG9A(5JSYjR|5(tIGQ40J7|8dOSx#xvmv$#!kO;+J!^W-=?
z41qi+$PK;S_q;@Z8v2JxTP5YQmKjq;thvB}C2$Ber~1ThZ)uu9Yuisl*~_)#{^R2o
z;4P&W+QCR{t^qiZ73mv_dV;q+oYEvOOGUYj6mQ^erYz^P=|R*y$CMo_r7JJ#D1MC}
zKm6a)IExoW+8rO`z)U*=d84uJD2OWNWjQpU^g^<CGVmu&X8A@T9JRksUMEG^f*6p3
zj9w#<IDXexf`%7yC{+PH-XxSY-QpqPPPQt)Gfe`;70;|Vaq(LQuY+z<$(Jn5{$m{O
z^m(DWAP|sJ&3&Q<NR|uZF3UqiNL*3(>-VrPO|fGH&34^TG6elo(zS8%ZViV=8gCkg
zd1y+rxPZN-1P4ux76Bc@DhAC(I=%p!_Y&%`6lVJ0)RNQZzmteLvCUT=c)FfdS8o>b
zK|90@cq+ur-A6w|z6)*VS%e>Mt|0&Kc4T%edO2W>)%S50HaVbt!3`MAA^b1J-Gog^
zD=ovp$|_UOFWEPb8mZ5>drY6HT_I66OZRK*mcSL-x<O7Mp_Wy+`6--p2fX65OqV@*
z{C^Z1KqSAvW8l@ounN+ncl6FiL6r50rvd%Im5xWRHg|(j@7UN0{O`_JaG!FV`i*Sa
zy*_7d{ZF!*BW$!cug%9P(P1kyi!X5%F|X@_?$Po;j>3y`mnPD%5SOac*9xW2Q&TFl
z)8Ig*nSw(tEWZ3tGi(-YTga5~KBjA6gp*Thv*Av(>TM}9)mnrQ3;mYqCHilkXJ+E^
z9$L8!<Ka2@!js^0pJ^za`vVGaCQ_pZ4b$+*;lSY`(}&`}Rlg8mh>EHy9^#OpP6a3M
z&<~@EPALHlgMarR2ARmIWp{2xz$#7F|Mzr06|kgE;!aFFy)F`K*V-|Bc&NpJEte@m
z1T|AICQ=kN(La@ejPh{zPE{6v2S{m}j!qN~1u!W79{F(vta{VV{70fQo3>Yi82=;~
zUX~kDC2NT<&V&gZqKUm)`O=d=58t2w)Vga7nUfH#i#efY|92iSnWxVu6;hZj@5NHS
z4~pB4fGol}Y4Wxb5f;b*jc$-ezQi|A&5)11b-S}K>Tow+Su>zet2EMu7)#}P;_BX_
zq*3CrW8)J45e1+O_wT^na`IVOFqvf)Uh#NWF}iq1Kp&;3QIZXED|MwX%;!jK&;CcD
z8u!x?`y_I&WCT|gMUa#@xhy>32DBpep*)zLj5+o{86#aPfDJj!bt<(ez!&1BX%n{!
zsijZ}#G>s9Xx(@)TmAa)7;TH;W4zY2K)$0<aLr1Km{D4WFb4+fvHq=jz*%+sr#l=C
zo%^1n>KJV0$l=jm%BHa5A+$~cU9%RsN~|C^<o~E9auH*Yj`0?YP(9a5`AG$f;OWSi
z++RH|MDicwgT%O>JdMm-8G{2ahpCJ3SAK7h$vx7(rRHutSMC0LNW5d813|by5S##P
zI1AZB%COeVhjt?~&r3cprP)?sw8Nv*5&<3wm~E2yVh@Z=e|wrv$w6~gZ#vy6p#&=v
z`zyCg|7;XrDYy?lX@yTY`JFf|4g`%j!zq_p&RPxq?fuQX(e5o_4Z;+$PsetGrkfZ}
zA}729lSWYMas$P!L;h+wJUcY?g{}vOBmzR8VF^^J<J~1vjA%s%SRAEH0rVu%G;a>g
ze~g!(KHqAYL3=}g6r5*|FPR2tBb4FEmpA*4-7frdm`EGe&Zof96lGsD<aJ3QU0Hd^
zWN&{z1)aPF<ld+pZrygrO+Zc5YslUQtRImA0n_AV)y+RPZ)g7vk4EBEWX#X=Ol>vv
z4+tiK69xgK-&8?qp6^#q9$xyYJigw^OP5@Hs9sBN)AWBM2zZ}-)wp2O;N<IoBOX;M
zi&>ktB$n*PT_K#@Ffgcp<iO$(c93)e$qPFz5TL^9$q`5s*2v#IpJia8Yw>Siq|-<i
z*sygd>t!RGWU20L+5adQ|9!dZ^1EHOVAE+hn3BZm*a}2ns4);-{IJ?&CwS5@TVC$@
zxVrfcQ{-5Cvi#o<%X<r6m4~bA_4&-8&E*jFefIhKnXkLZpT|?%vl`!<iYT_uuZJ^5
zQ3Nb)2L(~@e6FYW{`O&sK1F`|Vf^npAzSD5i~_I2#u};U{Z0~7z_-_@{i`E9a`TGz
ziLvUcQ=P8&Ek>%(!}%8;rYI!}iKOYr<FDIWEBmdd`~Ejq1bu(5PMSA6J#UW6%F2?I
zMedtc?XzwgLvHkXn>%l+E-sv?1oqNR=-$7NIQUaPnLC@Q-|m*<v6lh9PE7j&tv=q{
z8XFrMO<^Kr))E67JgzME{=)M6+Xrs=dSOf@@bdS!$J}?p)yG2e=YLy5TVN6=+{EuY
z!N1Rb6^cO;D}1X(<+(DO%k$xb6nH<!{T<h)@8b#B<?nVFx%-;a5Sjbh+vFDJ=3h4q
z)2mJexZ0aMyEA@Rs8(qiRDEsHxln0*;+?<rt4>|lXKAn3@jMo9n{-~EggxG830>ZA
zv|0S9sCez!K^-TQ7@qrbU4rFn=j0OrI%*Ty4#o{Xh%$Jh;@b4NTL(ilG+H_*+XngF
zM`+Wqrx{AJFPBW>XwSN==NYMVn(g)ZzKn4UVNZA5ZLI!?aJCN?U0Gk-un<1h2D?1p
zEOK4FEnAX`n1rO__~E9;PZ+1;asAAEul=-*iPUet;<FU^Zq0d8=!uEgyaG8pLtj^T
zOL2qgy7sBZ`o2cS@Y{adxBBYltJapuMLp+n{{8H$lp1fd|7-2qpPIbVFzP64kpg8U
zvKCoom36sVgb=yy+Bi-H#g2o(K*FsM6i9%O05K4%Mv0-&V#`G!nL;bYNRWaALc&GJ
zMns7S81CWz1p<K(LT+64gwD?X1ABh?&V1kb=AHMv&-0u!&kyGS<V1Dmh^@r1+-ZA1
z?O}_GY~A9!0UIykd5*HHE>jjJxq|F1a?-2n1}sTpHfnZu*1yQ{2Y3P!iIiyj(sQLP
zqAYnlh1=S|S4$|ng{S?|npZFnAt!O<Gjwa>$QP$Zn^WxEaHEa1Tr21B=A^NvFF!?m
z(^GgF!^m8?Rb8>kPUj~G^KF!n*{!`27$*|MrQW!6Z+%4sKMV?|_tubi1TNVrf}_Fa
z{U+$OyHV(}=Po7EZH>_H(ApN{*PcmQ<*WCHyu3a1eS)uo76>wQH)3SW&>mmAuvjW0
zFPOr|li!@JzW>v9c0^lPP>_k0<8Xb9Fced9aOxS0{g)N<X+Q};kQcGNMK6}^Y_)&N
zDdsQ75>Rk!s_}`8$dTV;ul`6>Ee#nMz|5FAY{VH)HOaXnZ-MHCC-j5WzV3mQ^<9aC
zf2PI}lL%s+HZN*3ldVU{NMleZq%6fSTB5oh&}g)TIzF*Pd`4!{12F+$j2PR?nBMB@
z3gW11LiT0@lfROLJK*Z>{xVwdh|6AWff(>M#dp(GP~L(qY7=&X3)ln-<cQ*?k;$KT
zVEptW{X1#tm^<@NSZwan8;3e?Anbk{KbxsYe8?L@m|8y%sjob_z~Rk1J+#f%(9s)}
zGIlFgzqw+od;idAJY)8|z1dG%-XlPXN@<E8h3xB@0#%dfz^0aF&j1%;GC1-5m5Ymu
zY98d%(B=^lfq<+WL(H$-1R})bT~dB)+LlUnr|haJl2x@!n`XxJxX1G_j=VQw=ZhS#
zRbGRP8XTS?7=4-G(!RBB_!!!7r~~p<BcSmuZ5q_b-veGaaU^#2jzkYC_sbZzb>+9J
z{Qb!j1hLPowMeQWm3buXPoAd2+U8EXv;YOfw#*j=x9f&XV9w;O<C8{_Agd}qA3w3g
z790R%CbdSIPW~ZBhFmhIUs2%`X#=&K$xo(^OEeGg*tG<uDnt77!)u%Ir><Wmyl+Yx
zdonz*G{mAw0VQZhA_=vjjqw&1Nu!N5h@FlDX0IDP-P$z*mot@s{~m$Gj-eNkKr~(5
zaFVtx-}@Gz6s6iuV_UKu&-6#aP-$O>n6J?S$(1$Bqg;XvU~%m!oWHm^hQnnKe)CJ9
zk7`hB`PgPpQ$slyBK&aY<_y?31_xgBskQlD@@Cx<OZ+@^z&i^F7cE}!=qRd=zoV12
zeuNc@uJ#WD8S8v2*;;_Jo?X}+j(Oajp7IXp=J4<_iwTmf_AQSf`-m6$6z8&e>u=Ux
z{pw$QGf1VGEr17>r8XYN@qQ?6U!%I1_fuhL&rzoQ@#G|z4dUUuEiMNH1dz98ZAB6-
zyH)<A+|YOcJQojl9E62Wm5;S$=>dx_A(>lq_K?W-gKO9XA@0-3CGs};->!OZ@pd_Z
zzk+WQ*=|i4)1-NBeI=!amO1Yb@f8wB8YttU?+gV66KY+|yR;B95D64UXiFjAI7L*x
zgS#nNXw|d%-eQVjWqYyk!QUn66Gpz@j^_G5ynK9Yu={eQ-Ijqzc0bC{YVOm&ElR5j
z80F>RybJ{pUHBil=;f_-XTL-@Cr_uGfS8nQWfPFSu$I)*7FoIhCN_T@41K2q68`(i
zDKJav=pemm!;ruYzjhNQn$zZms{c#m8Q<OY;`YSNm0Y|0_&0wxRL&`^DUDC;(Ct5$
zINq!%^mh&gvF{!<>GPb;`|J5@-iq$)vEwh}04nP!+p=P(Fb@Qx<@V6Cg6xf|Z;zH}
zpO#^-obT+b@G_|B3BuslmX?;R;5vDsw(7n;pU>33#r(Z10jzur^RNi=ISUk^$GU{8
zT_`g|S11%eIRvA#R72|xC1%IsSai(7RIM|kM`_(4SB9(c9|40=kn$>gq7eiI!>bB>
zbvCORm*eeZq$DvZI<A*tedN%+lN|vY;L*8fFaaMfZ>0vl<U?@g4LE#Wg}$7%9fBe~
z<Te*Qq6;w>tknMW>R!6P@K$AvqMLovjOff54~<)|v7riX*wDe<Xapx`o7EMXKrkC~
zqm@WeXy!J)r_&ww<rVvO_T*Er(a~|Q?-`x($B2=_8qX02N5+z8PcNOdK67^P*Lzqq
zM`!o$fFT>Y?BZ+EzuIFI0a1#%0E86f?TbL6z3W-Y<Vt+X;_b!;UIwqRSzO=D!4KaH
z5_&~K?~V8Is`fmiBM&BkH{J={qr7APOYM-IAxl?-+Xy;f`v-g}u$?o!1KTdp`M>^>
avuh@e=6v`uX4BpXw688*L$WVM-u({}L?ZM6

literal 0
HcmV?d00001

diff --git a/demo/documented/poisson/python/demo_poisson.py b/demo/documented/poisson/python/demo_poisson.py
new file mode 100644
index 0000000..b1b9db0
--- /dev/null
+++ b/demo/documented/poisson/python/demo_poisson.py
@@ -0,0 +1,68 @@
+"""This demo program solves Poisson's equation
+
+    - div grad u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+    f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+
+and boundary conditions given by
+
+    u(x, y) = 0        for x = 0 or x = 1
+du/dn(x, y) = sin(5*x) for y = 0 or y = 1
+"""
+
+# Copyright (C) 2007-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2007-08-16
+# Last changed: 2012-11-12
+
+# Begin demo
+
+from dolfin import *
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(32, 32)
+V = FunctionSpace(mesh, "Lagrange", 1)
+
+# Define Dirichlet boundary (x = 0 or x = 1)
+def boundary(x):
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+g = Expression("sin(5*x[0])")
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Save solution in VTK format
+file = File("poisson.pvd")
+file << u
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/documented/poisson/python/documentation.rst b/demo/documented/poisson/python/documentation.rst
new file mode 100644
index 0000000..4597ce7
--- /dev/null
+++ b/demo/documented/poisson/python/documentation.rst
@@ -0,0 +1,157 @@
+.. Documentation for the Poisson demo from DOLFIN.
+
+.. _demo_pde_poisson_python_documentation:
+
+Poisson equation
+================
+
+This demo is implemented in a single Python file,
+:download:`demo_poisson.py`, which contains both the variational forms
+and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation (in
+:download:`demo_poisson.py`) of a solver for the above described Poisson
+equation step-by-step.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+
+We begin by defining a mesh of the domain and a finite element
+function space :math:`V` relative to this mesh. As the unit square is
+a very standard domain, we can use a built-in mesh provided by the
+class :py:class:`UnitSquareMesh <dolfin.cpp.UnitSquareMesh>`. In order to create a mesh
+consisting of 32 x 32 squares with each square divided into two
+triangles, we do as follows
+
+.. code-block:: python
+
+    # Create mesh and define function space
+    mesh = UnitSquareMesh(32, 32)
+    V = FunctionSpace(mesh, "Lagrange", 1)
+
+The second argument to :py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` is the finite element
+family, while the third argument specifies the polynomial
+degree. Thus, in this case, our space ``V`` consists of first-order,
+continuous Lagrange finite element functions (or in order words,
+continuous piecewise linear polynomials).
+
+Next, we want to consider the Dirichlet boundary condition. A simple
+Python function, returning a boolean, can be used to define the
+subdomain for the Dirichlet boundary condition (:math:`\Gamma_D`). The
+function should return ``True`` for those points inside the subdomain
+and ``False`` for the points outside. In our case, we want to say that
+the points :math:`(x, y)` such that :math:`x = 0` or :math:`x = 1` are
+inside on the inside of :math:`\Gamma_D`. (Note that because of
+rounding-off errors, it is often wise to instead specify :math:`x <
+\epsilon` or :math:`x > 1 - \epsilon` where :math:`\epsilon` is a
+small number (such as machine precision).)
+
+.. code-block:: python
+
+    # Define Dirichlet boundary (x = 0 or x = 1)
+    def boundary(x):
+        return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+
+
+Now, the Dirichlet boundary condition can be created using the class
+:py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>`. A
+:py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>` takes three
+arguments: the function space the boundary condition applies to, the
+value of the boundary condition, and the part of the boundary on which
+the condition applies. In our example, the function space is ``V``,
+the value of the boundary condition (0.0) can represented using a
+:py:class:`Constant <dolfin.functions.constant.Constant>` and the
+Dirichlet boundary is defined immediately above. The definition of the
+Dirichlet boundary condition then looks as follows:
+
+.. code-block:: python
+
+    # Define boundary condition
+    u0 = Constant(0.0)
+    bc = DirichletBC(V, u0, boundary)
+
+Next, we want to express the variational problem.  First, we need to
+specify the trial function :math:`u` and the test function :math:`v`,
+both living in the function space :math:`V`. We do this by defining a
+:py:class:`TrialFunction <dolfin.functions.function.TrialFunction>`
+and a :py:class:`TestFunction
+<dolfin.functions.function.TrialFunction>` on the previously defined
+:py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` ``V``.
+
+Further, the source :math:`f` and the boundary normal derivative
+:math:`g` are involved in the variational forms, and hence we must
+specify these. Both :math:`f` and :math:`g` are given by simple
+mathematical formulas, and can be easily declared using the
+:py:class:`Expression <dolfin.functions.expression.Expression>` class.
+Note that the strings defining ``f`` and ``g`` use C++ syntax since,
+for efficiency, DOLFIN will generate and compile C++ code for these
+expressions at run-time.
+
+With these ingredients, we can write down the bilinear form ``a`` and
+the linear form ``L`` (using UFL operators). In summary, this reads
+
+.. code-block:: python
+
+  # Define variational problem
+  u = TrialFunction(V)
+  v = TestFunction(V)
+  f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+  g = Expression("sin(5*x[0])")
+  a = inner(grad(u), grad(v))*dx
+  L = f*v*dx + g*v*ds
+
+Now, we have specified the variational forms and can consider the
+solution of the variational problem. First, we need to define a
+:py:class:`Function <dolfin.functions.function.Function>` ``u`` to
+represent the solution. (Upon initialization, it is simply set to the
+zero function.) A :py:class:`Function
+<dolfin.functions.function.Function>` represents a function living in
+a finite element function space. Next, we can call the :py:func:`solve
+<dolfin.fem.solving.solve>` function with the arguments ``a == L``,
+``u`` and ``bc`` as follows:
+
+.. code-block:: python
+
+    # Compute solution
+    u = Function(V)
+    solve(a == L, u, bc)
+
+The function ``u`` will be modified during the call to solve. The
+default settings for solving a variational problem have been
+used. However, the solution process can be controlled in much more
+detail if desired.
+
+.. index::
+   single: File; (in Poisson demo)
+
+A :py:class:`Function <dolfin.functions.function.Function>` can be
+manipulated in various ways, in particular, it can be plotted and
+saved to file. Here, we output the solution to a ``VTK`` file (using
+the suffix ``.pvd``) for later visualization and also plot it using
+the :py:func:`plot <dolfin.common.plot.plot>` command:
+
+.. code-block:: python
+
+    # Save solution in VTK format
+    file = File("poisson.pvd")
+    file << u
+
+    # Plot solution
+    plot(u, interactive=True)
+
+Complete code
+-------------
+
+.. literalinclude:: demo_poisson.py
+   :start-after: # Begin demo
diff --git a/demo/documented/singular-poisson/common.txt b/demo/documented/singular-poisson/common.txt
new file mode 100644
index 0000000..fbf8e45
--- /dev/null
+++ b/demo/documented/singular-poisson/common.txt
@@ -0,0 +1,78 @@
+This demo illustrates how to:
+
+* Solve a linear partial differential equation
+* Apply non-zero Neumann boundary conditions
+* Define Expressions
+* Define a FunctionSpace
+* Use the Krylov solver
+* Solve singular problems
+
+The solution for :math:`u` in this demo will look as follows:
+
+.. image:: ../singular_u.png
+    :scale: 75 %
+
+Equation and problem definition
+-------------------------------
+
+The Poisson equation is the canonical elliptic partial differential
+equation.  For a domain :math:`\Omega \in \mathbb{R}^n` with boundary
+:math:`\Gamma = \partial \Omega`, the Poisson equation with pure
+Neumann boundary conditions reads:
+
+.. math::
+
+	-\nabla^{2} u &= f \quad {\rm in} \ \Omega \\
+	\nabla u \cdot n &= g \quad {\rm on} \ \Gamma \\
+
+Since only Neumann conditions are applied, :math:`u` is only
+determined up to a constant by the above equations. An addition
+constraint is thus required, for instance
+
+.. math::
+  	\int u \, {\rm d} x = 0
+
+The most standard variational form of the Poisson equation reads: find
+:math:`u \in V` such that
+
+.. math::
+   a(u, v) = L(v) \quad \forall \ v \in V,
+
+where :math:`V` is a suitable function space and
+
+.. math::
+   a(u, v) &= \int_{\Omega} \nabla u \cdot \nabla v \, {\rm d} x, \\
+   L(v)    &= \int_{\Omega} f v \, {\rm d} x
+            + \int_{\Gamma} g v \, {\rm d} s.
+
+The expression :math:`a(u, v)` is the bilinear form and :math:`L(v)`
+is the linear form.
+
+If we make the Ansatz that :math:`u` can be expressed as a linear
+combination of the basis functions of :math:`V`, and discretize the
+equation, we can write our problem as a linear system:
+
+.. math::
+	AU = b,
+
+where :math:`U` gives the coefficient for the basis functions expressing :math:`u`.
+
+Since we have pure Neumann boundary conditions, the matrix :math:`A`
+is singular. There exists a non-trival vector :math:`e` such that
+
+.. math::
+	Ae=0.
+
+span :math:`\{ e \}` is the null space of A. Consequently, the matrix
+:math:`A` is rank deficient and the right-hand side vector :math:`b`
+may fail to be in the column space of :math:`A`. We therefore need
+to remove the components of :math:`b` that do not lie in the column
+space to make the system solvable.
+
+In this demo, we shall consider the following definitions of the input
+functions, the domain, and the boundaries:
+
+* :math:`\Omega = [0,1] \times [0,1]` (a unit square)
+* :math:`\Gamma = \partial \Omega` (boundary)
+* :math:`g = -\sin(5x)` (normal derivative)
+* :math:`f = 10\exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)` (source term)
diff --git a/demo/documented/singular-poisson/cpp/CMakeLists.txt b/demo/documented/singular-poisson/cpp/CMakeLists.txt
new file mode 100644
index 0000000..b5f0aac
--- /dev/null
+++ b/demo/documented/singular-poisson/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_singular-poisson)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/singular-poisson/cpp/Poisson.h b/demo/documented/singular-poisson/cpp/Poisson.h
new file mode 100644
index 0000000..7c28263
--- /dev/null
+++ b/demo/documented/singular-poisson/cpp/Poisson.h
@@ -0,0 +1,2403 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_1_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_1_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 9
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    const double G0_2 = det*w[1][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.333333333333333*G0_1 + 0.166666666666667*G0_2;
+      A[2] = 0.166666666666667*G0_1 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_2;
+      A[1] = 0.0;
+      A[2] = 0.166666666666667*G0_0 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_1;
+      A[1] = 0.166666666666667*G0_0 + 0.333333333333333*G0_1;
+      A[2] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "5ee927682358c6c0426041ab22b70a08e5ed403f78f13005173589a5c00c41be670a70ca85fa21afd8fb8bcee737b704b4ee42ec7f4dfef9f5aa6cd90a5c4283";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new poisson_exterior_facet_integral_1_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_L_FunctionSpace_2;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/singular-poisson/cpp/Poisson.ufl b/demo/documented/singular-poisson/cpp/Poisson.ufl
new file mode 100644
index 0000000..148ab90
--- /dev/null
+++ b/demo/documented/singular-poisson/cpp/Poisson.ufl
@@ -0,0 +1,33 @@
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-10-31
+# Last changed:
+#
+# The bilinear form a(u, v) and linear form L(v) for Poisson's equation.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl.
+
+V = FiniteElement("Lagrange", triangle, 1)
+
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Coefficient(V)
+g = Coefficient(V)
+
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
diff --git a/demo/documented/singular-poisson/cpp/compile.log b/demo/documented/singular-poisson/cpp/compile.log
new file mode 100644
index 0000000..f11304d
--- /dev/null
+++ b/demo/documented/singular-poisson/cpp/compile.log
@@ -0,0 +1,213 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, g]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0212979 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000759 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000874 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.00108 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000885 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000884 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0135062 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000319958 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0485861 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000771046 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000790119 seconds.
+
+FFC finished in 0.0856481 seconds.
diff --git a/demo/documented/singular-poisson/cpp/documentation.rst b/demo/documented/singular-poisson/cpp/documentation.rst
new file mode 100644
index 0000000..db88c1e
--- /dev/null
+++ b/demo/documented/singular-poisson/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the singular Poisson demo from DOLFIN.
+
+.. _demo_singular_poisson_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/singular-poisson/cpp/main.cpp b/demo/documented/singular-poisson/cpp/main.cpp
new file mode 100644
index 0000000..9eacf41
--- /dev/null
+++ b/demo/documented/singular-poisson/cpp/main.cpp
@@ -0,0 +1,126 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-10-31
+// Last changed: 2013-05-30
+//
+// This demo program illustrates how to solve Poisson's equation
+//
+//     - div grad u(x, y) = f(x, y)
+//
+// on the unit square with pure Neumann boundary conditions:
+//
+//     du/dn(x, y) = -sin(5*x)
+//
+// and source f given by
+//
+//     f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+//
+// Since only Neumann conditions are applied, u is only determined up to
+// a constant c by the above equations. An addition constraint is thus
+// required, for instance
+//
+//   \int u = 0
+//
+// This is accomplished in this demo by using a Krylov iterative solver
+// that removes the component in the null space from the solution vector.
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+// Source term (right-hand side)
+class Source : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    double dx = x[0] - 0.5;
+    double dy = x[1] - 0.5;
+    values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02);
+  }
+};
+
+// Boundary flux (Neumann boundary condition)
+class Flux : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = -sin(5*x[0]);
+  }
+};
+
+int main()
+{
+  #ifdef HAS_PETSC
+  // Create mesh and function space
+  UnitSquareMesh mesh(64, 64);
+  Poisson::FunctionSpace V(mesh);
+
+  // Define variational problem
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  Source f;
+  Flux g;
+  L.f = f;
+  L.g = g;
+
+  // Assemble system
+  std::shared_ptr<GenericMatrix> A(new Matrix);
+  Vector b;
+  assemble(*A, a);
+  assemble(b, L);
+
+  // Solution Function
+  Function u(V);
+
+  // Create Krylov solver
+  KrylovSolver solver(A, "gmres");
+
+  // Create vector that spans null space (normalised)
+  std::shared_ptr<GenericVector> null_space_ptr(b.copy());
+  V.dofmap()->set(*null_space_ptr, sqrt(1.0/null_space_ptr->size()));
+  std::vector<std::shared_ptr<GenericVector> > null_space_basis;
+  null_space_basis.push_back(null_space_ptr);
+
+  // Create null space basis object and attach to Krylov solver
+  VectorSpaceBasis null_space(null_space_basis);
+  solver.set_nullspace(null_space);
+
+  // Orthogonalize b with respect to the null space (this gurantees
+  // that a solution exists)
+  null_space.orthogonalize(b);
+
+  // Solve
+  solver.solve(*u.vector(), b);
+
+  // Check residual
+  Vector residual(*u.vector());
+  A->mult(*u.vector(), residual);
+  residual.axpy(-1.0, b);
+  info("Norm of residual: %lf\n", residual.norm("l2"));
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  #else
+  cout << "This demo requires DOLFIN to be confugured with PETSc." << endl;
+  #endif
+
+  return 0;
+}
diff --git a/demo/documented/singular-poisson/python/demo_singular-poisson.py b/demo/documented/singular-poisson/python/demo_singular-poisson.py
new file mode 100644
index 0000000..fbf3e2d
--- /dev/null
+++ b/demo/documented/singular-poisson/python/demo_singular-poisson.py
@@ -0,0 +1,93 @@
+"""
+This demo program illustrates how to solve Poisson's equation
+
+    - div grad u(x, y) = f(x, y)
+
+on the unit square with pure Neumann boundary conditions:
+
+    du/dn(x, y) = -sin(5*x)
+
+and source f given by
+
+    f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+
+Since only Neumann conditions are applied, u is only determined up to
+a constant by the above equations. An addition constraint is thus
+required, for instance
+
+  \int u = 0
+
+This is accomplished in this demo by using a Krylov iterative solver
+that removes the component in the null space from the solution vector.
+"""
+
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-10-31
+# Last changed: 2013-05-30
+# Begin demo
+
+from dolfin import *
+
+# Test for PETSc
+if not has_linear_algebra_backend("PETSc"):
+    info("DOLFIN has not been configured with TPETSc. Exiting.")
+    exit()
+
+parameters["linear_algebra_backend"] = "PETSc"
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(64, 64)
+V = FunctionSpace(mesh, "CG", 1)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+g = Expression("-sin(5*x[0])")
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
+
+# Assemble system
+A = assemble(a)
+b = assemble(L)
+
+# Solution Function
+u = Function(V)
+
+# Create Krylov solver
+solver = KrylovSolver(A, "gmres")
+
+# Create vector that spans the null space
+null_vec = Vector(u.vector())
+V.dofmap().set(null_vec, 1.0)
+null_vec *= 1.0/null_vec.norm("l2")
+
+# Create null space basis object and attach to Krylov solver
+null_space = VectorSpaceBasis([null_vec])
+solver.set_nullspace(null_space)
+
+ # Orthogonalize b with respect to the null space (this gurantees that
+ # a solution exists)
+null_space.orthogonalize(b);
+
+# Solve
+solver.solve(u.vector(), b)
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/documented/singular-poisson/python/documentation.rst b/demo/documented/singular-poisson/python/documentation.rst
new file mode 100644
index 0000000..a21fd5a
--- /dev/null
+++ b/demo/documented/singular-poisson/python/documentation.rst
@@ -0,0 +1,161 @@
+.. Documentation for the singular Poisson demo from DOLFIN.
+
+.. _demo_singular_poisson_cpp_documentation:
+
+Singular Poisson
+================
+
+This demo is implemented in a single Python file,
+:download:`demo_singular-poisson.py`, which contains both the variational
+forms and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation (in
+:download:`demo_singular-poisson.py`) of a solver for the above described
+Poisson equation step-by-step.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+Then, we check that dolfin is configured with the backend called
+PETSc, since it provides us with a wide range of methods used by
+:py:class:`KrylovSolver <dolfin.cpp.la.KrylovSolver>`. We set PETSc as
+our backend for linear algebra.
+
+.. code-block:: python
+
+	# Test for PETSc
+	if not has_linear_algebra_backend("PETSc"):
+	    info("DOLFIN has not been configured with PETSc. Exiting.")
+	    exit()
+
+	parameters["linear_algebra_backend"] = "PETSc"
+
+
+We begin by defining a mesh of the domain and a finite element
+function space :math:`V` relative to this mesh. We use a built-in mesh
+provided by the class :py:class:`UnitSquareMesh
+<dolfin.cpp.mesh.UnitSquareMesh>`. In order to create a mesh
+consisting of :math:`64 \times 64` squares with each square divided
+into two triangles, we do as follows:
+
+.. code-block:: python
+
+    # Create mesh and define function space
+    mesh = UnitSquareMesh(64, 64)
+    V = FunctionSpace(mesh, "CG", 1)
+
+
+Now, we need to specify the trial functions (the unknowns) and the
+test functions on the space :math:`V`. This can be done using a
+:py:class:`TrialFunction <dolfin.functions.function.TrialFunction>`
+and a :py:class:`TestFunction
+<dolfin.functions.function.TrialFunction>` as follows:
+
+.. code-block:: python
+
+	u = TrialFunction(V)
+	v = TestFunction(V)
+
+Further, the source :math:`f` and the boundary normal derivative
+:math:`g` are involved in the variational forms, and hence we must
+specify these. Both :math:`f` and :math:`g` are given by simple
+mathematical formulas, and can be easily declared using the
+:py:class:`Expression <dolfin.functions.expression.Expression>`
+class. Note that the strings defining f and g use C++ syntax since,
+for efficiency, DOLFIN will generate and compile C++ code for these
+expressions at run-time.
+
+.. code-block:: python
+
+	f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+	g = Expression("-sin(5*x[0])")
+
+
+With :math:`u,v,f` and :math:`g`, we can write down the bilinear form
+:math:`a` and the linear form :math:`L` (using UFL operators).
+
+.. code-block:: python
+
+	a = inner(grad(u), grad(v))*dx
+	L = f*v*dx + g*v*ds
+
+In order to transform our variational problem into a linear system we
+need to assemble the coefficient matrix ``A`` and the right-side
+vector ``b``. We do this using the function :py:meth:`assemble
+<dolfin.cpp.fem.Assembler.assemble>`:
+
+.. code-block:: python
+
+	# Assemble system
+	A = assemble(a)
+	b = assemble(L)
+
+We specify a Vector for storing the result by defining a
+:py:class:`Function <dolfin.cpp.function.Function>`.
+
+.. code-block:: python
+
+	# Solution Function
+	u = Function(V)
+
+Next, we specify the iterative solver we want to use, in this case a
+:py:class:`KrylovSolver <dolfin.cpp.la.KrylovSolver>`. The first
+argument is the left-hand side matrix, and the second argument
+specifies the method used. In this case we use the Generalized Minimum
+Residual (GMRES) method.
+
+.. code-block:: python
+
+	# Create Krylov solver
+	solver = KrylovSolver(A, "gmres")
+
+We impose our additional constraint by removing the null space
+component from the solution vector. In order to do this we need a
+basis for the null space. This is done by creating a vector that spans
+the null space, and then defining a basis from it. The basis is then
+attached to the :py:class:`KrylovSolver <dolfin.cpp.la.KrylovSolver>`
+as its null space.
+
+.. code-block:: python
+
+	# Create vector that spans the null space
+	null_vec = Vector(u.vector())
+	V.dofmap().set(null_vec, 1.0)
+	null_vec *= 1.0/null_vec.norm("l2")
+
+	# Create null space basis object and attach to Krylov solver
+	null_space = VectorSpaceBasis([null_vec])
+	solver.set_nullspace(null_space)
+
+Orthogonalization of ``b`` with respect to the null space makes sure
+that it doesn't contain any component in the null space.
+
+.. code-block:: python
+
+	null_space.orthogonalize(b);
+
+Finally we are able to solve our linear system
+
+.. code-block:: python
+
+	solver.solve(u.vector(), b)
+
+and plot the solution
+
+.. code-block:: python
+
+	plot(u, interactive=True)
+
+Complete code
+-------------
+
+.. literalinclude:: demo_singular-poisson.py
+    :start-after: # Begin demo
diff --git a/demo/documented/singular-poisson/singular_u.png b/demo/documented/singular-poisson/singular_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..4d49913b292df12672816825846d30aa32b8b8d4
GIT binary patch
literal 45179
zcmeFY<9A+P)Gi#Gjcqoz&BjR^+fEwWwr#Vq)h20d+iYwnXXp2vXN>nhc)y$v8F#YB
zy4POQb6wX=xT3ryA{;Ip2nYzGw3L`K2nd)u2nc8#3>fg_O)Y#91cVqwT1@!6Th?ip
z=dFpjGsE-viePPgXr2VWftwNpB<w$Cj{ZUZ0nf8tyfD<*9KI+CQ3wPH{s5SD4uZKy
zAqw2W_%(z=wGbTKV55Gk&WtkfJBh$=0aCr;@p;!!nR!zk2X96KR%d!Q%|xe9PYuhJ
zF4dY%meo3&&j*E=%&c(1BKeBys*Pvs{=hHP=*?6SFz~>$+Bs@cI&`?;Ugg5DTHraH
zOf+fl=L$OZ|F_`(>EZuZf5^s5)p1$=IY{uZG$`QGvhK2K*YhUNwH;Jh)BWsn{xad(
zofy`ATg)goV%K>!FsmT=79Z=i*LC52A&SJkH(%p(cQBrL@hkA$oY-_@!yEAK;NI+h
z6JXaRgV5@#D*T`QsG)=&M}M*OyzZCHYBU-SUT-FSx4?<qPF{RIUN(LA$cUa!dfrcf
zEj=BdqB%Dn=Sl_cGB;ljYF<Zb_>QF&p0|;G-4-;=&gupU^*){#T{pcSI^3oRP_;i_
zmyOBj`!u@vOUJVhk<)D$+2=A)lK-F5Aim?6&AI2ClH}X#<j1S?q7Em`X6w&ghK|$g
z<QlKPGQWD>p97J2j{4CQI!~b2L6sstgVRNo=|<P{%o#YV;EBfM$bRnY9+lo>FP7~_
zXIoSCbI%0#VHQ~|-*wIVznU1He`UjJv7T$YNL*Wf4U+=ASU!L_?z5R2x7BvuC%^EW
zFgk<Jh4wpQ7JrGj?~{F|fozOL9oKb0Yrv6tY4kc=&g3}PoyOT0t!)O!GdYQTU$1(e
zD|_090>-?CDN^x0j`9<)L-|h)Qnek1b-0g^B9s4bhFO!={`nUJ1UPE0^wZmguP=z2
zo_CX%dVh&rX7|V2#pdK?lo{Xd?X1G4Q7r%7D$(1K<kzn%E{~zUkD=ZV>kq*BLd8)H
zfK+r^g|fK-sD_1R6VTM#s<^hxvdM+VVh7<>m}DoQFuupFK*sLJotDmhdaK1>Z~xSK
z+81>_QKvK5ttdORJ<po(IBogvmy9lMg<Xx&Q858OaM*5~mG^w?BYFoEzQ6I%&FR;N
z#Cv*F80)ixmirjO*|{CXI-y?G<9>5sCit=(itjKKPL<=<;u^AOtwOY20sWQe^Kf*i
zX-`H(FH2e**O&&ve}Fg23%=bVdmo8LdYlj7*?HYJ<a*ElQ1iYmB+~ir|A6p6ub+Sm
zpL{)5@a3WDc{<1h9W!nCtMjXMC&KDi+recYa&A(MPRISo*P7SqSf3<#yVmWHQo*<5
zR9%l_;M2ktZX-PKeCvNwcQ(eC6bIl9aw8N@j`M5xp6e&NAe5v1Ag#wGnILYRQEb<r
zPV2e(vT-Q*@$~kv`2pw_TJrzucFFUi>jALR&7`2O@_SQ__nE*$+hmUCdD}mRPk$8z
z{*oK%xeR7JZQ1mZ4^ji{s*-b^MD%_cn)~s3NOWHty8ie7bDHX=!dL;1z7WJzJ)btL
z4X0T-JD;1(&!uP<=0nm{+2q{F0lTq+@6I)z>&2<M|0q7ge3&ZNYwhRY@IlYVOON2w
zutN9!iWQc|<vr1@OTeP_Y|js+ucMy<EFbk1P*iOnQU{<oy~_YBe5Wa4EFGumw!<92
z(u+QKm3sVJe&9t&sK7&UXac7=>kWrd`jds~m*>Tv_nFl0+s`yX0k|v>w*<hqKhNg6
z?!0(X)ANqydxgc=bvq-M$w6Pg1+RM<u<Aaw8vg!nQ!%)5ar?LTzw)@$_VaFD&2Fvr
zD$8-A?e%)}VZ-yn`DDRnrIE(-j#3Ope>8>O&i7?i@ck<GV^;8O)*qVCtshmg^Zl+S
zHE+uI{m@t7@;7*k3tef{D&NtW*nieQPr>B{Lsb>={;x#iJ*&RD2$EHev}4ezd}fnk
ziT_<C9`s*5w@iwyRcsC2?cB6b@cp0#1q<$t@v}K4)5a(Us=FuM1n;kGSL;5w2~YR8
z8TjDp0(66Xdxbvtp3UDN;9o%karz%mc2`(8RoZJ6)gggRd-<UcyPEy|agty_LDv2t
zFugxxoTdAI*H)*NRf4?(v>&UGI}`Tf)t@ByaD7AAa$nzmuwjypf$mhO^*GDsd8K4M
zCXEpj6NoWhW`V9c&@CjPCu9Phv<Yz%@TiSDaORx1iJjiwn1D|`+M8XLbFy=-g7)h}
zO@cy^+!BG_5aLdMr2Xv2`5PQe0QM>8cFcBG%lJ@ObUJLoeOTJ^2<%o2L&<c%FZsQ4
zVz^{?b!%<yo06D1HM%XMz|*hvMErD=tjWN$Aow<LS%``IneH-p|Bb7)7ECP6X4cQH
zrq^b7_aeP5N(Gh+xsY1+$%K&@yEj-q6jc)ZwykNv?VRXyDV5LbhqVgn+D*@Y(qOz_
zdw&H96V^w5K?gG;6L-+vQw&v&cF&(ODQ;Zjjq!2(X<*Qi|Jg-V#l*hqeKp=@>L<>d
zOecPh{Vl8bUO0V_zAW#Y-#<<Kgc=OvIW$tZsjjWQB=BDpt9V^9x{&zs3>g_55L0ir
zO~&q}j*1}|-diqXrJWVrV?6xw^anM~AKSPJn2m&oUj_YC4aub$(Xx1duA^=)s~4Ij
zWU=t2JM7^#qz+exLI;l2VQ)#CZ}?S!AT<x2wTkwO>#CD~gZKMr%70#L@UrXe+xC?i
z7krDdvx#C)r$DIW6!-L*o-HPc20Bc0i29-5*C>CVfTh^-!&?QAZuL_-b(hYU-Hr+f
z2;4$DVer7|yv9A+IFymtLy|jLUa&BH;qvlu%y2BvmFXKKGSJN#CZDrLz~CGrfbZ6J
zx*bwo6nh{M`?dI~?-NsGQWcjel?s`NfhZ@)=5g1fkM)yl#&u|FWMh>c%nH+7+kILB
z_S0x4{aO<`vw3w)@@|ONjAV5>%`w+mR21GZrnpKl^J*GogstPO@X2!ggc$jdO-%K7
zPn?^I+Uk$#yAd_EDx_Y&w?F;c<u8$!WeXI{2P&(bFj+A*i3nFBj*4kUl9bYn6AXI<
z2gn#7m348<B19l>>6+Kb!E9YdN~c>NEs0BT?|K;Ev<4cr@3RlK2&7Gp9DXf%{^G;z
zel4~28O#)RuslgMY(jJW1ydUZJ#oBbKOB|PoJgccf-=>qR;J}j`rWRc0aZ+*{1<6N
zRM{;Z<w7aQe3Gm@5P^r*E=qOwER#kmVJgz7e-umw*l}+}INd}Lb8Jza7q{a43?l1_
z^>M0G3ax!Qj%qI(gaM7(D-2W$G*J2D6{5nNqA!K@ok6pDf+4OQ)|DU3eh1s<m`D%K
zKuY7FmsC8F;U#%QDU!+uqqq(EEo2sDO*^lv3TOx?4=`)1+0Nt5J!xM26~2FqJsDfs
zo62`$kZO<vdi(7%FAjywU9kLqTGED2vahHwR1`Oq55gb8bxvPY6IrO^QvWsYzE6|`
zA=`oT;q!-K_1gYL;NXAUY}<B#`Eb1yHLNZE5(kZDm0e1`<O{hzMif#sW#8#?FUm-m
z5Z-Uh?5ilzb@&NizNtNG&_Ei=VwggSstjAu&etSBW$WR9=C=uhv3xypp|%BW<qC9?
zknk-05Kuk0$~>ThC&Q#S%lnsw%R&@`EYNimUW3Oi9R4u;t1NeCi@qt)6dr6^)}{oL
zmDMom)qGqp=<8h%`fta8kN5Hy_8o~d)USQ<kV9b%r-oxu<N7RqzY~5_IhixF2STHQ
z|EyQCFcqT=8h13r!U+6lE`Y&foap!aJ35l3vTTX<PtHNWOV5!$D?2ZL%zLij;_tbs
z-w8-H3BPFI4Uq!WCEKQn(I|ul<T4WEra{h|`(+Kq9<Z8?Au)Q<7L8B{zyC&Lv#|UU
z$yQD%tgPFgW}Cl)`kQTir*#nv*qHWxQG7KChRDPI)8G%=Lka?lG;yt{Vc1$rPmG;`
zMFJw>sU*{05MV|~1$jc}@v6eZ-eu@qb&(l$bG_e|mt#-{#s)y996AxWTInTopRF<z
zUgA({=z~HtDLK5we;RE6`i$%)jjJjJzB172pAarzWYWqsXwvnA7Na+$;Ms)+W@&@K
zXbMc@*mCEji_CFQOJ+1L_0+Y`qS1z-@UB<_dr<ymjtvL%(brkp^CV#jI)hz$mR5a9
z(4}4@{7*4N3vc_~)j!E>5u?)%OP<2;!f{l3NXhtM<4{*3pD*Q#dF0AmQ%FmNBDr*G
zOQ2|CD3~a<=Do3(gHZl(PL(R@)7kK7Wb#(HbKCb01D?hk_!*35y^OhU`gJyNlm0)z
zA{fLD7q}z`VG?O3QOj;n1a_@T(`EOjQC7rg1}H@l^7m{7xozQsK%*|9WXhon<;l#U
zl=sGx23)K$%y$IFaIgx{eS2DK?FWBe^_;fTBR_<Nu6L@d1GQz1Bj*tdnPi6p++WMc
zkn#q;nG$!RD{w7CGMWWd42vVEhiO?n8S)3EVNnY?+TZR7bQMulmcC&&+zqkh5cvps
z{~Xoahi|>86WQTh>}`bcZSjZ|QfnGc>aC)m1;7Oi|NZbKl0GRTs2#glnk4huikLi|
z+KD;UVV~RS4bzW~tq@8!U)C>d9pxKHyk)(F-<4i{fQK};eDEZ02(j{rLGdpz<}`)A
z(lk}o(d+4j8iUf`S$=6)l-@r81G{`)@0aqgB8j--e%lO?LQnI?<BF_CCC}q>`r%gY
zH`E0sR8%Si7w(~c3!lj`#msm@2ho<yD4t71T|YQZnfY^I(YaLLdGk2=%a#u{;2Ot!
zYbYF=`HBdc4K^|DTd`=4Avu9d=kpz4n$_S>(?I_%{CGs2o5EEAZ<5b0mo9+_!|obw
zvHW-1#jeFt0xPTuV{SAapkRTqMpmuJ=V*)NyltMTB4gnIp_vWyRYx(x6e}2d+Rc1S
zUqCK$vFP>>IVMhFx>Fq!Ld62i&uN40=Bw(9O)D+Jb0y^WV?zTVI+(WNSdmGTF{Jt-
z-iW_L*Oo|!rK493Uq_EKz||8gk7+#B1S>IzPKpUdONlxYWuTBFqR5?#7XNnZVB`v;
zVlGBATVhSramrIBgyWaAN6(IXP;1=^tf!Rm2s73Wa%qIYHGGW)5>j=+r#|cKr&f_|
zzRHp}kN=8Vq9c_+$Zua3#w2E)b;Bv-#|%O1qFzv<5+{X6p)hK-CkoN|UjCJSBRiQi
zJsE>Q3idIBjM{*!SyomtFSJh`c1@jUPqR#(AS|&-Ch>t^E{T+hPM4NQSBs&qcj2?a
zIi=>>8voFcior#5R&t(83k&BR7n(Z4W~v<ij!BVN1&bOW;!G$fdH`>|O(537=4JE;
z28ErSCJ2jT(x43|oL9VmG3bR!OPG5s6GrQ3uD{~imSk#<dUkkh(;QU;jfThcdqkGT
zRAsihle#+MXO+4i6y+3%F_mRSx#KXpm1j+R1aEB_Af}wmFdwkjH{m5|#+mX=lMu(!
zWTT1aImBhwcSkqHEyh>e9gRy^W_A9H<4BZHx|-?DA~~ptGBadjvCly+p)D&75l5~+
zMPewN&eVQQTLeScI@Po*4fqb^XR=tud8ro63bPoP!#=8j$-LBFgb1g+Al)Iyp%<dG
z%LuR@u;1Y#XRYJ_qYmy<?4Jwk_$4PbO;^l-uVo#RqU=a24?zSnLV@pq=vRF*9@#Ig
z0cNPJO8GYu_ahp<`L7n;lEs&Sc&e^nt+h;BA1~7xHtwxW$gjhnK4c(WcM-0Thod5z
z$=s@P(ral0Wlyy$Xh~co_u=SB-N|J0?7(`ex7=dQje+8W7@9jI=}z`5(GcD>n{n(w
znMI0Wg}G#`F0X_V6k(n;l3Bzk!F#@y=>>9FcbE;mog$@BMDfm8oO8>W0uessGf;T9
z1iStX%X@CgvzFkXIcJoUeCJm90&RwGI`hl(Z%O~CluC{yP_}6Tq(F!N_;pnj47ThI
z-?4e1(ZC>s&`tN=oW!fD;yuPfy`$aBvD?VmQ1R^~X{0^IIyS*n3a9v)B2h$7;Vc|b
z`YwxOCTVM{EB>csbY!mkk37?{QW3?l>dLpoF*Z20pcJuqjz3-FbUYFq^9+^<ivfFd
z7liJ2>3KqR!L+$@PP&G|4|}MZTwq4!9K>cvRJlYF?|6w6MRAE3PPLIS@D-3)Nco)0
zrLDxE&Vz1EZ|1yzhs8r>Vm}34-9C)bfHwFu5X9Xi7J5Kg1l3B?=$zp{CkuztQsN$D
zKncl9utFKcp5M7YI_`%XcxNJ8i-ne9!X7-?n$BjnS(+^M=gJW7hktiQS=T9(p>Sd(
zbD~~-r0L7QG>r=)N*TAzxxPkYC(-8!*1~=<(}kGCuhaHzSH)H?t0|$LGv0QZbabS2
zYd1f8umlMVyOQQ$iba+D3CKwb>86=S!sfz%5Pa(<Zatx8P2ipGXdsJk#W1LxWNHr^
z{gFr=0=eWh-po|otBmYvjpQ+*!L&GR*Cq9e^)u7{pWH;xUj*?<I{evx&f(LL!rYw~
zD8w3btG&hv+iZ^H8ovx~OONa=KEwFcx^A+DAAV;qlX)tiM?uV>6eo~ea!Na7BncHY
zkVFV-t{qmu7Lm9_sztHGJQMU6Iz@GDIm7o8LwL;ZIuxVP2|w%;%VF8sL%~eF5f5&>
zUb9rOpB{hR=Y9J*tqzB9(W<6a{I%^zbg|SGi>~?Ci9KpOef@rtu(`&P%bk-*_|z|-
zp*;!r;Qk(O4&L==N83*^NT|ODM&nEPwUIIg_I9BmyUj}8V5H?tzQ;S=sA9^t#5GdD
z{NhqQ!*><Sk*WvhZ?ILPDLjlU?F?EO?74O28sFG)$izeIe-Q6?)_Ng5-C1}yg)2uT
z%#)Larn7~yrYmeS^ob)I!j*9sYln=60{*alKA0mZfW`Xo<ebmbD9;+u3gxU4q_0-8
zC;yfBOZt#0O!N`9WgN`R0$b@6x58P0v91JSO5MJ+^jX<NMh4juNNE=#d~JE}Zn)0e
zFyjc>2%D1uTuS(qihhz`IeYOi&8kU{etl%KJ<$QXe6rYVw?t^Tc03$(ZUJPrN3hB_
zTn4oFgAh-<(LR3Xnh$k4>(zQ_KrgtSe24Bl!>;zwld$Gv{n>64^<o^X21sM+ysc=H
z;fMNc=lUhx!EW&WcutI$S!vbr^4{`e<eA>^cic{i<#zcDj$CMI?cZ|>S)JE|PB(<R
z`eb;@Ty>h;C%fdBrVf?SbYz?y1xk^e6rsm?53&!kJv84{R?PAms)`7Rw8NbTvhuI$
zg`f|jxcf9yn#89yw9AizkZ^P|L<L#>Ro;-QO+S>WoMtkze|M)QJGmvHrqv!te_egz
zprykBu1XImr|-8P&4a8tH9Vz(9gZYRl-B24NKP1h^~179h;&)dPP=W~Ni=^QIYX0S
z^hAy;&>Ak&*}pP^Ha>TiuBW#XbWMh5Z=`uh<`&vX(@{i~F;nOdbQZd<qWdI#aqOx~
zDCiay!HF*)?M_iXDq4DLXvAbIw_c3KO0QCra3&2+KC242rclmbWYa{16GJIdFUBF4
zZ3B*&DbL8$+0}YlKN`b(-a067U)OQgyz29E=GqHOrR{w;-_o{7C2$qqWVLt>;Hj}b
zw}pbw)3Ng1{C9II7NA(#_Wo-62cO_ttoxYJ{hH%sAF|-<Z0`H*x|ixIiU}_L>22%7
z$CH)0=|@ovR5WU_{2X)U;|F$gJx70nboOsU)Fx|@$W)6F%56#V1quo8pX}$gx3Ena
z9wOosxCp!zlA#fs(<$5XUw@TvGC;;xu+KynAHW3hq8ngNpqrC%sFTB&ij5<bC|Ow=
z!Vqwvx+q<<&&Tn3&4#6gO@#}o#8Uq4?Pc4hgRpj`;cgl$Y6%_%kV^oq($di2-U%Z^
z;=i4W1hC4}hDqH9)A6Un+>hVT0`^v(-ls-Ho*Oqg51ohncI)lVfUJLB09aDNYX@!8
zeZsM`H(rwP=@Z*7N|Yb*<Ug}eST)P_-n;o+ga)AEO8|@t;GjLP`;5MqfkdxkW&#bi
z>+QTN9|V8cG{w}H!s}LjpPbngPo8VU`#}g;6-_0F<IU-8Mc}hQr^=mC$gQRlVI-A<
ze8QHLqRH-#6j9JJ$)*BCw$p>Jn?<x#qha!rB<;HUQWgsR`{NH_lpP|j<xrR(^2QD<
zFoyfg<S5<??GX*HGvL3a`|2B5%6dmwutJ9MJh>ZuBgNN_Wx-wv?N7pfnqRIvx>U74
zts8uQ+x&Pt1mH&ghc%UNJ^&ai0Ep%Jx=Zvy<$Fz~wR*A@h%5kLc@z8(+RJOT27Q~a
z<C|Vjqk8vnpH7f_lXaNoevn>yJ~4*u_8WYH?`90E`!ZPBVT7jCYa3qg5diy~Bwu_d
z<UH4=b<W{pmTYbe4bmmxc_|k7u38rOj>QdCc9EP++1vej`*~=a6`f=_b6H*eGRes<
z@%hY{tP|bf^*03AD>H@_WJ?IE3tT3+ThTg}(JU$V<-0;Pl7+ovHl(d9OkLSG^Pg_G
zR>g5vV5%USC8FfgwsnOnOAf}Ty&@)zU6h(q?|-={IfIH+=NbCVCt?Ox+s$m*I^`C;
zg{LR+EdMN)cSBL(T~@Y4Mn9LtN376vSRqPEcXDRB(R=-?XT4PWM+4<|AmMG^tUT`-
zU|#(T@A)oU02jXSI^>=7xo_y&OP};Q2*%P)`}+DxS&)R{*Ej9z`aJEc={V0f<lNCQ
z0&bLZ^NIa4WRKm8uImP8BRue&QWVSxjj@uN#$z63<7xF%NG(*@?wlGzg@y4Jq7Ivq
znd<n9@4>Q$$H(EA8^#7fB<7``Si?JlOJjmb;X9cZ{Q2Fh8J)3=reRzW#v9kot~QT?
zns#`ENKT79rX%ph|F8ZmuJN=D3bP})@DJi+VX4y^%Db?nI^Ohr3=nB3@zCr_B)mF{
zK?%!-vC3o#lc%acu(+U+0C6r$SCc*I1RfsgFC_>9AeA<1vNh=8-l@A^YeJ?<OS8Md
z2A+W=j?{YIe!^k5(dlxwBK@?|WM$WWT=I#dzd!VR?C1hO_91=C+KeVlzVAzmZ^!1_
z`C+C=M2kpJZ^tKWyd6r!Kmj~-eOPzh?69X@MFX%?UPPC-$)2v0U0vD}s|xX+hTwBa
zt|&_sG|DXUkp3X4@KFH_U-Ki}Nm5h-K4>}*)*V|hREetc2-axDro!6(+OhH7g>u&&
zcWU{_m}z`I40XpJ(FKq%_-i^a|CA0K#}0qBf2XMzc<4|r!v6r9b|<~yy48bgRBGb9
z(C45j@r0$P6s9qZQGqEd8xAX<F2jMZgsnRgF6GmunD$+dJ(<rqpP;0c!IiiFi=hT$
z-;*u+XlF&jD%MzEKcksBc?hsJv!9W**m=ONK^)P{ds5YKzv=q{kZ5OhvEHWx(Rg;<
zPo_1s08c{TJg3xir`2-@WDbDs7|(q>HB;cb>Idi<9M>0ETRZ?|u0_*dlq3kG{Ho@n
zSc+re6lHDcgy7c}JRF8K)pNFeGrF$}qtFsMcC!PM1lN8HZTLVe(&OBs2VR~&g?7fz
zBk>PBvB`8U_Yjm_8T6cn+?PMUXKPVSyTKgm8<M!&m;5JmqaV1)LE-G?%9K8Exj&H&
z9oQ@vyjXj7w~(^-P($>XlrNae+v2p%ZF_I4we4f4u7uP9`^(^h{dVoX$p#XI+q^|q
z7(@F}!6$R3>hhUbFY8mg5PsWsoVgqqrwSYiBPU$%0;MPR<1v=#CT$Sk^RzD3W3KT1
zis<7i+RkeiAgVqXfy`mGaD==3$+qN&5<U}s<kwLlyAO$W18eA%uWbw^FHr$Z*v0(x
zddO&sxQN0F%Fq(^5*FTK`pbTGBTZc)A%Uo)8&_2SoS0J?UCIJ~(%g=WQ8l~yJf7nJ
z&I0sn!IEg)YeIuqw<(oNgShI1$Xy>f3R!fPlG@;gx@%_tlH8pxYX08xy*71y6^?zc
z!!v1|jfiO0E#1ITByk90_>V8yb~UCL>%fpyt$7k1L<Xs2KJz)YVWRm=uO&xP`Yi+6
z_9ue_$c6XG&!wB?wAI%;ygwaA`riV?*X8E>*=F}H!Nn55w-p}%?4}#Qi}GK%Pp-E9
zB=eI2XpnHA`~ZpM`Z~48tLN>$<8dc)^Le4gcDa84;{E*M{F7A5S9v@d_gv3^c14}s
zybJlnmV1#RbdY#dZx(`5r23^er3e263x6kImAVF}gC|W{l?aXGn_(9hP7yXBH?vfr
z#?&?3E@XIAx3GBJ$}hqcpuMH+_-$Sv3@5htU7gIYdJq%;*gwyOZkLZx6(6zspfakt
z>WnTkpdmwhDwu(Y8v}~{06$7ho-JWN4?fzk?uSm8zVHXWG`eO^ppwlX;wU}h1t}^I
zkP<Se__kpc+(%S4fU;>@J@LsIjWG{u16dLz=l!-6pu#qYo`xicUb{Fqy>5U)^r-h-
ztmiT5x#1WpZy-tBdkxr~s|w$KZKO|+;iOw#J$S5zfUp8I8YLbZ<;q+-PqH<~STn_M
z#@3<OlXY0m+>ovfK?O{pvQSAiU3l?mibPbe(~4#a-4CkJgXDJ(`=-rVTH7Pi8@bfK
zN9#%J@K;($0~ydV(eLX%+2ojW4w!S!sTp8_bMWTR-v%ZZs$d@oLphnB(5por@40}6
z`{|w%wD@0oQx{#>-04cB#oe$KHer7!N3=T{tn5;&MR`}qm&<FQM{-hTc<)@ccHv!Z
z`=qmh5(#iu+%3w7SFygYpMLVSrt^9bAgs&;Zqilcx&HzM=U2zM$4)raCnefyL{)19
zAjP%d2KQ6Ds)R0`5{O{LUzAzGHsWMqRVjASkM8-%B$+&EgJ+X_4;&Vm6275Q{tgpj
z-kDa!ns-R?Hi-IyVaR&7o{|&q&97bp{npRmfez9fhbYy%#XjBJKz6HMFM`Npe8r*D
z7VZ5v9i67|bZEjIyz5vkorWxjf}`VBuxvVG<fLWV_yNXqS|aI5EGltcT1ig6j;7R*
zxh(+JZmF@p(TQ4^`LpH~y=GYb0<E<ac>@S--=|dHWmXu1Shs#MKq?*(vux*uLV$I~
z$0b8?-2!;qq7|SK<t)F93+3B;2B^T<!+HYXy0%2Zw0eQj5Q?t=k(qA5Cs{BQwF43s
zSEp&aYBYgf*5J^X_^)HgF~b;2<RgDJ52oWMdFJEEL1jV$w*zD}`@Fhp<%MMpRXz@C
zsk}ce{tqmVe+CMbt;224aQ2tCVos{}^M#_0pwYZd^>sQ!ypc%GJB>)J1L`Uc#jUt1
zC6CHT1!tIg74SXjk4B{iGb8y}&^qSX2ujo<iIh%{4c#)XLZ^V&z5pF1&`k=`e5@>X
zyX3yCQBh&>xB$ZlpDbkL*8&~4?cfB)pF<>}UME_c&p>y`T7J1a>ErSN5W<d={GZhi
zXv1zkXB&!oA%XVuD-M=cpMvIUif`pT01ww@GkacMHGG`8>E~3@DXJKSRFY3Ml0y`X
ziW$_`TH?wuYYm7efiP7TUZ-4`J5jKew>_CcA}T|0$5t3a7}_Y$#)p42t_YbDGf6a)
zNnpkly}%`Bguok~#D|l#S5IzVNX|fbDQrWVG&exQiZS#LC3OyEV`HwUN*~_IT?Rvl
zk=7QW2ky<)@S1jTjmoopO(>r0@#rf_jxMFgB4}QS5qLgA#N!A%k++|f<Lr7GxAS?w
z$-O8UO_T>Z2zn5d=}6t%0>O_P!H-_7?yU}O_x)sGF2L*DF&AF{4CoscfAPOR?mA|E
zHUkPg$3<%0*U3IpYCX^MnVgak2cIDVG+%O>OUH_TSc1<2mwkB%t2KzlQn69kB0z+r
zjY$yGNs!aG(P=W^$Rq}K^fE#>T)zpk)f3VjlURdtz+W`N?P?aH8iGG+dC^0lH@D&%
z|5Sn}iYCqo!wRM*y~Ji5NqCPZlVVRp!!_9@$?hw#N@3Y{f9Ad;jrxmA_7Am)CJFuW
zfo(rdX*HN08>8(Hi8>ppp41V~{NY?^@Fh-cw(v7tV%c;s46fY*Vk@e-rPy1@oea9L
zBhV$_15+=bN$r!<{;ZG%kqkT!YmPNt_bb4pOeHkFz296q#Dw)mC&0e@TmzltBVNxH
z-seEYXD9XflMi&=SUrz_ff*5u-vEJL4_q+tfF{(0(Q_FT*kC&t%ja`?W+pM`wp_v6
z(!>PvcN5TIJZ^`6>`@820~To9^m);77^d)jF7<uB3>AEh)O+0lu1F4{&mVv2JvXa&
zf8srkC!b)#N5a6b;x<6P>B`#Swhc`fU?0Z?QR2}ELJIe)j0Lq=Co5@aqhAI=7xSBq
zZ>!Habe2H|4|G@EN^Fn8DMP$CteO`0)xwv$VkT7L7JbRbFP4SbW*$_#@70a#%1@OY
zT!v#$aW%LtsT^iv-;M1=Xi-Y)ZeCnuyqoXZUhEezYUenP3psl6u&$_qVy$xJ;W%2%
zb@PYZRX3_FW5=jW9-uek9k?!1r{w8;{#VIqyXFRr-+We*&w+||=MxTK7~tdm#WVOX
z%uJ?j`>~Ck=PDrY_Gj`%_FU?V;kzEXJ6YU3(S5jvQ`2?d2f}gzNX5Ir+{6>(YcC_d
z_w96z$9$#3?f7SHUa=_6cHMCQxMuut*aF50fUXS~pg0MVyg&gi{iDJ6e!DjJmTa=2
zQ4;9?6gQppo%y`u$h}F2yXhc0it%ti#IwsJ(ut+jrWXFP0M|J(c%;ameY!Y7{^+5N
z9#HCwE130j3H<@53DXm73DkLKmCCZTC<w`}QsqeQgTlO|$09#`7@)OCsT`yaWi9B*
zaB&(Q=e18VRSq0WZhNzeCP^5WBYKJ`ML!T}QJARCf&}upBUJ%t)&B7B%L~CMZ)fCV
zw#&HTw!`u){3_(x`{3#tjdJW9b5c@pRdTr_qwu;@`#E_L_7RUH+){sl+ndl9k|7he
zEK7L<G_7V65*t(AIokPJ`VcZLMp&21*jgH{1-Q-vF&R{tI+=`grjdK2F~FzJSAqHY
znezYpmO{7tyB>`8>s8<Vb^LK$^MG%4&$j{=;(P6{jG2mXv!IP{MVlTa2rS{!xL`8m
z6?Izstq>j+JZW@#0pu~M1&r}d*ms3!9{W+ecPxi87H>fz-{N)n8AH7xYhe_7nD?sg
zifXqTF_<`P0fv1I7chgMXyZ$lNNG_TqKzf1>9okKEE5K+Slj^Hpa838_?rxmnk8BM
z8?hwuxQ7)-DXy@PRAFG|SQo^;VEQ6#Ek;*|L!Ld9Rizk+Ysjw=C?PHh!|5cpWt{0D
zvge})epJ^OM6w0)dOl*Q*LaDSC<*<5DrI^Z2Rw}@jTN_BbtQZdp8TJ;qSzZj8PhtH
zJ^eNo2&Jh@Bu*EnQhyAdkZS813y$J-i8c1J;^iZUmIW|IN>*ILg@X|B)L`61rwt6g
z0%X+MoB0bqQ8O*7<R7m*^}wJ|92H{!WFwez3kXJRj^!$Y3d;B$8PUT!>=$)@S)Nc9
z)H-;0Q__DrZ%Nk$JsaUg_;lZ5OolnrKoc~uP}x_G#*A-;i@qpEM~Ok4OAmb`>Y!DO
zV~I{t<e{<=Tv|y(5u2kZuSH}d>*s1LA;1q|{hkyPAkCj>msCEHq~Gl#u|GYCFSqLz
zvQ3UM$%YVDg_bHYAYRIujb!?<G7BbxW%;pNbUSR&H;|kV68r<G*{!_O_X4V?K|CK8
zTVjh%8GkXMW`&J~nXjvI>5H#D0`;e8o}y>s0;uOgDUL>dun6AEM}r#H|5fv28jkTQ
zmvdgoNoSf>VFsrZ4@FC7Ckr``5#`l9{DWV9Jw7y9ogyJFvT6zD{6v<k1A6RH)KBUj
z9jJj_LsCXYBb$%n2`7XCTUr`Q*XEVg)h*qJ(hhF$WTK*Bni`@a-ecb$8dFx6dLqIt
zXg6qmvSOyH)ufTM@1UMKwg+!&?bZj!yir?sRLcbPTK1fN=Qj=orW^{sOD#`}$8os9
zX-5XlnHdU*X!}%lQVz<f6et+R%HIVGMv&xSlXk-*BGT2?WyUfTtW*`*ni$##VBW#Y
zGN0n2if+9_r_$5qzNh0V!%7X5+21qiQO=B=8CJw5iQ})-QB0&)b}eSbVRQAjDI)cf
zPjhl;iqWIROH;S9X@7SZX5hIaZcjPvq%oSwdJQWC6+}7R(AbjUMKW=h)G%9Vx($VD
zX&s;mqsIjSaGH^Uon8Vc!Tht_30=S(H+fw?YU|4S`bcs~Xs}zIM-d<yD8Jl6YLDwF
zJWfEY@1f_0xM_P}^&}u?9?)0@*(%^D0nnaVP$0gZ#g*Kdq(6Pku0(lAgwF{oHiKt1
z;Y_4oXGiJBs(WfVWIQ!*WrQkZpg@`pv+FyWDWWoInw<?Bam6TNzfN@hh>$Ji{2($|
z06EubB04f6_%<XvoJBdBeJ8s%{74`QtMfrhHvw%2RPa?66l!Ur@;<b3&FK^>QRLdp
zB|2oC{fQ6WMr}Y$bSVY_rXO&($p$%l>hObOKnYa+q9&)#q?9_+!xnmM#*F1*3|DD8
zI-4f%fXPl<F?d@9xOl{A!85pg8D?6B>EsfdRUQt(zRmTlv{uHA{&yw6e&f@f6!Cf(
zRA(~HRv6U$y8B;vEz-Q%!g&W`d+P`f+4l+&^QYzwzR-Jbx4o0unnwG($L32n5jh=D
ze?$}((>J3d!Lj6v^2>kyXk}W*sHhzN<;~N+j$K8TdycB&+Xm0jA4;rD_k9$LGuygC
zZ>E;`Gr)DH2nSo0;PrbMI54EG55E~Zn_$i%3#@BF=E@IqC6CKtU)^fJ-=nw`u-x#S
z*dRgBQrNa=?+M0O5E)Y_4bqqMY}YI4N8;lC{Aazun+OR3+jT2XI8$Eo{YUgn@t>$L
zsd&YCi+Y)*Ml|ZW?Ac<Db9~q)G|jnq2a;kHcvhOuXfe}St^%e+++&Jsy!07693qph
z3eg1zLk;@cGDQgRigx+aVpQ=$^||;)XaeqsR(pvP2Ia1Y6V57>R5ooFfWNXuY<wAo
zDlcUmPJS{$vJ_%{S;Pl1H+>~XYlBjeU?JLHUN}-*MYhTgr^kM3TZv59?STwT8%B(c
zw~ou?=rSAkWZt?W4FsRz7A=N4`I=9si>{v-W&GSv7pHG#JZbLKPJ%p1GG5NaTS1T-
zO{tR>ek$uQE3PhebTAA}S^V0M!@bxG8=LjeS5Rj2&xDEfiafv+TbO7nOlIeJYjC)f
zua^$d(ewNm&&i<O`lnI=<97cULI%dRlz$?D@KUW0WK?u!1X2sQ3k1>j{e`drG{o7v
z^2%Fr<BMHjzXjDRr^*{uCL6du#t?pxj<;fl!IZELm2-Cb7<`(OmVMf*Or-K8MW!{<
z2&v2bWalOSA!Ff?16Ca|St;Vdg`E3{qA=F6JaqD+hJ9^9m$xC)_|q!JGKaIY?XtLT
z47NdSbA~DAe0||wpn2+TxTx+TNqy`#V^Bmd7ekmMIz4rFvaPxUrItBr=6y@g?Q+Gw
z|J-xX1bn3JXv<T!T+&L5a|^In{a1<OJYA7)O@h2(+Hx?j<@RCVQU}G6rP-@5t%TK`
zm*@Gxfubyvt{~H&I)CcExsiI({hL@YW(lpyF@R040Oz9(Vf%ZphGkmv*B{tJFvsp2
zGPOdvXd-w?VyzhQR`idkU6mPnpvia@)^3V~Il|c2wkx1YDL&}u_hZD?X0UranN-Nc
z@m*z0xiEYhq;*vT24F`Vy@ZKIM4*oa^f`(&gLSMj(_&fo%Ffmc=SsMm#ucM=!@E+L
zzE7H3L=8GCdo&?rrKU~b9#qEehXw)~stMPPqwD!Ey6x|C7$VYr#iFR&%7N!^35_Hl
zxqlJLI22sNxL0ww<0q?)jiCyKVzv;uGDS`#Ir0foqE-XOUg_JrWir&&%p{vQl^NLb
zS?C>Olcb@~%DT#EQXAS%682+_+BrMEzC>jl*v8zt+NB1wV-uS0yh0G0fAL9)r#B;E
z<>=D-I`Gv+t|*|VkxSgq^1ba#iAHiFH%o}QKGlMjA%<pjWpDXpqMdLpy8HsW2en=*
zB*Px0o<78Z`C}ZCNW{<UxA}W(Ic}BbAMnnEv3MZhCkh%Q2hpXIO6tI*5(9yG3zh=W
z(y%SK5hJ@NY56Y{--&>>pm7Z@B{v`RoCF-{9kl|MeGWM(WCwy;q0ma&zkF2k)R1j)
z-pDE#B(kL$tO|qq*2^VM&5h!`t;Ivd;kxBP$!v~2T-t#?q~$jZy-N;<{CQzcA6sA-
zl`|o^X{t?gaNlIyp%7QUlu1OFfc{|4h;s2r4--Voh#boZ^|6|<k4hzBMW@1DlpjbO
zC&rnD_C1ga79FEU)IRcbn>|s;$-V~)OD?xhZ^P;@C(Zy>ny;jthk-7h%yA4o^4kq;
z!B1Hy4pULNDQzVfUKDlu!cQw2adN0&ekDbT4e%$27G_bcLnRZ(<2>7J-A#;L_AKIo
zW2?m<CZkOYjw4Z>VUTyj=ui{E0&Z)i7nVh7ZE^zYLdS~o%~i6v)nQ;Jlb)`4W-Kkw
zoDwO_Z=SS}#a+oCOLDOcz8W=VaOTtJ2j^z<re;Uiw9xR7P^{&AIOK*63-!I3_W708
zDRp4`Iw1tiQ8wKY8<SI0^8I4{fJmr7vA@iTA?@`fHg8Ea{+noexXd-!kf7(4f~*Rb
zogaO_GNo@%0{!vFM2{n)SHyZIzwdi;JDiXRPE?iQH!UZ)=W}^CcnpcIHYTiw!wY2I
z;FYjpKGWg+)xJF<I^IVlto8&B>Dj}0O!=$pq><Fvr18#*r?6}*o#^5)1sngfgbH$#
zLaiJ4FP)qqQX8zN{rYgq-L7Oz%flt8b<fAzYIwc@<>OcQ!yeh#s`BQoG*Ap<WH1WC
z`Pyi^6mumZ@ac3*E=uW(J+>|@nGx_8!_=f}$N9nxznNl>4&b(;c7hwG_4l394ngEC
zzA#KbZxJW)P|{uNO2{{dWqkXM&-e`&yDaP9t;G#K&fjN?n9O6RFPt^Bh*%HUY@i+Q
z`o?X)!S7-$2W6nlHWcmXq@kVvr1lsJr3fMRUdnCPr0}G3Ys{xuaIjis5HUS0i%3b3
znd!2yp`~ePzV-O{x<M6|8W@Y3xq(K*HgrdlT#IP_jXie0+kmgvmcwFsN^=`2{OKH3
zCrBLi5Pmk)T$>&H3z5mc_T8D)(Avv!dYd0jJct+PXrqVKe(8}S?uXhhR;@fy;?j%$
zmT~92a{lWky6Pql0m)eu0ZZ1D<}La|oiON;cwgyblJZ~SQJ1im9x2}jnVabUAzQh`
zIZp@DfmR=~A+3l&W~!*oW=9gltvgR3<rXw0ny4hOEX)nL;3HDt=5b*)J3XQc!D{_V
z63*w1evRTi6EW>89Fm^3&=g-rpBQsNz0si4?)N{d8q>8&4${}gI*C_V;u^>iD8rwe
z*10|}GOA`ke4FY=kL)~%ln1F1w2+93_EmRsb1m=+3SI>{d+&G-k1wE(M(zy>zXA_I
zm=>04yS}N}x;SFJ9>G<z+|w3{S-^Z$I8=*w_0Z0Z+fr32(x8@ms$Vn*BjC9R%}LPy
zr);@VItx3xe{6>zR>m67tU?W29AIsSZwXf|E+TdA3NwPfa6#X?hN^6F>4(LVNt<|B
zD+yy>fv-({CF@gfDTbkE6d|vi0yRa)*ms*`byz-k!)_j6ddne2Cg7g;r${UZo^ldx
z*mQKNMbhNkSo_p-whP9)p=^$sa*+9X45E*%f_&I4BRCLDS^hs)v?7o$xB(AT66*NK
z@xCQWlhrvN)Wl(dYZOs-(B+ctM_W$iMkq`($b8Lu)mKhPDsU31wNQbN9viyzm&Uo4
z9%7TB<XD7LqVA~6&LE<;a|?`gN^7aI8?yK!ZK*is0SithFGYXcI2K=$8}g<3+4`LA
zhoZ{nwlRv+np-lD!02cXy%JbkK_iZqT1knMKT2K6xv;D>`nLw-vpO9_-bP-68yJrZ
zBd-0QzaQpNrC$aVOGlZjlZO)6J|;tGyRT2e@)@tY)~&-?-fqvX^iS}!Rm)&&tbu`(
zj}?ud+x$@CL95V>gH|BehbG0n@7=tMkQV=3g(WC=G1<{DhbE^bm`hmIYol4A<CC2-
zMPBXG&xUryt3&rl@~a{ze$%;DE=eszWT}L?65E;bXl|7_Rk&wl$@W{+2%N^pv@Lny
zhsdGJ2}xg&DvYJv4>r?kHHw=r-&$xu`ME#N7=khDm1+n?MK`)BMfppAQ5rMHp2V)}
zE@Nt-+(tdUlRZabBdfTUc9|3BqeYQzOWSAK@9}q0Wl#L($hPpXEhSldlc9}t(oEp;
z+$!|bDr#oRPD><If>ZLw$0#Hbqx3x%hgsfJYkFHA7#gwxUAZBD8T#h)ESl?Yg9vYV
zjNvVyR3hz>)=Wiot?Z6wkx-Jf6uE^^7TS08<oK_?SZo`#KrXhdO5dthxRq340VZaS
zo4?)WG}BPINJR@3u~9MM56tcw7doFci4%fXWYzo+Zj^-^zTp~GlM4T=RVW^Xxh-ue
z+67X+zx|w6V^P5-v`QJw^^h{C`d91~_bS$r3^Q`~VdC%gQ~|io!@9=iYeLWSaaN$E
z=J#Z2$kPhS4PwdxgO6e?ENRXxI>kf%573!a=qlz&@x}MZn?<2e_nr~E`cewXPcVj&
zQ;Nh^#HH9HK781!i#;AdfSREboc99`jJZYBlYY-P?Bl{pOut3`TG~@-YUkiLUbT#w
zQR+Nvrm+$48(aqwPS?=US2D(jmS&8-JP{rpvWs*^)|7h?E*(^nQl}i5YwmGG)TRxm
z?);<qyu_#sbjI`RhfN*St&Nd013r<!P8%t|=-$ZQLZegtd-B^?0X_@@4H0+U!kJul
zaorM#*;A!HxjclDgJ63zlK$|t^dAS$C0Ogm79)kRLdq^H4w>!;OnT<FQ9;*}qWK)?
zg}qm~KXU9;D^W~Vsy2cp{Aj$KW)Q}{@kengE6C9eG@<Q!q;XXpCNS){`iU)6eZ1j-
z;%zE9xrJWMcH0D+sA}nVV6JaS0MajG7M+8uf!4v4POvktYjS}352du*8pO={X8J^$
z(vLE>rvHd(TtgDBU2sacno=akOd64kC1lHz(Vrjs;G7AW&BS{)l)@~Zqg-X<m;zlI
z2|3$J?2HHrCOj}zGn3$iIqaFQ*uVCwHs=Fn;jNp<K&M)_7W>Yo5z75qsRYwcCYmUN
z<)g-{@e@Zg(C?SBk$|9%N2WNtWe~Lt`>20hj(N>@KMRGl)3DR{0+uE6oTaiFC+L_U
z?EQnI5W<+HoR_NZ3qxOzB<aAq<5UCnW<33ZrTEv_0*Idt{m^A7#zbhi9VAzL<yW>3
zeqK%Q$*V5%jB9d$@m&D%o#~_!{RA_fJC9kdnN$)Ch3$@uH<PFx9Zbqmm&Y>99K20}
zBESpl*dQx&V^v@!VY47jz^*uz6f>Y~G+R_)+J{FbWxdKLwWtd72a5a#&b;dXFhu${
z@Uf5|a+veU3czK?q0Ls+#2C`bewdJwRD72w&zMIRLQsTPg>ObXFS-STTgtE)hl=mg
z0E^fAa7zwyN+?*&l8qV>{bOcmlx&In*2{sbJXCdi(C^pZ`W}QqURn_S1^L+GK(|<i
z$$nLFXPt@T%QZO5&zM}Q;0fJw{BYi2?Ixr`Baw(XR*eMbK>L4R%}x}kdDey%#aiY5
z2>Mipi>&?IVvNX<^=bRfHb`4R<z(!zzU(Vv!-bdbg)o@oSX7BmDB~1BYUk+SWUOJj
zLh(%%kF+)Dn|EfJ5dXS=dnb~SmDH>*E)xImOTReUAwH^Dlo@6<ls+b9ZFt|s4oyN>
z%=z*+GLgtbq%bh6Jk#%o1jHjnFzl5HO?i$SqQ7zoHAmd(LgCpdn^_YcFky><IWkm>
z$XDz^Y&{-}_|ZRNn)hYf^HEG$A!n=MiZXYe&wMlU)OSMsCk@-q@)mlyaQhIvr5lu#
zv-00|f^M8hJHLxW(yCbIJbN~%=qWk1&gOXqt-_zbj^4NwL~l2IrTrLTUS2O}=q|{k
zuA$JAtG{^r={0>l9B$<}C%bX$Q{t|L!^~lEhvu}yR&OW~*-+d1@x6fR+iu;Ax&6P`
z@2OdxusCG$qu<M8N0MrBo}WYAAg&g6r^(TJ@JIM<f^cvyhK0jTArugpY7F`}JczK<
zj!~p^4U5JUXd?@&_OA@P<Ox~+DM+N;V^ONhc*AV}JJkP4BeF!pM`N~6X6!v;@zAux
zM>@yv>4N<9%?=x!!$eG-@i!B-58D0*!ZaHQ-_GC#SBLv`iL+nfT4%($tz1i#<XUZZ
zl=r-6(D&Tuh|iqv%8g`)D7ZWz&^xafVXqbF`+Cm|VQN)ns$v6^JP(l+`K8ACEY4s_
zfvS^(S}@Ig3aUEGD?s5u!{N%T0;KS5_J=CI?N7aa5@oA_Ju<Y=B{)>}d0Q2^tVx(}
zH7zAi-#7ONts262lpD%bXO9KnGv<G?a3CI@)hAa9#jDtfA)4>mjn6V$1|3lJ%FLMF
z6w1imzduq&No1_ZWJ7V^$-U%wx#cr1kIG3_yv+s^v?-n-nEsQc1Ff<ZgJdpixTQU3
z>VZsm;C^j@Yci%j&kN^rEI+igLk~!Nmfrh2t(NF|*+EuuOy4Jw?!suUrs3)jndh=K
zw`*ET*ztDw+*_R&X3y*A`x=wR{)63xng4%h0d$GI)8vm~CBCQ}%-Y#7P!&|4?%yE0
zKMCcQua(LF<Hh@1RP@SPt7G4+pxw+k<9PR*0-r)d=})?wM~a0CUM^ovtS7_^rAKx>
zCAXb$C<?mHwnZ+gn($u~8Y891aFp<rp@Y$dsW43e*n)H^Q6n)#S#n$rxjs3({AH_s
zjq36PT(-d?g*`Dtf_W*N9(nM|VYNTEd?;y>VG!H~ZrToCNnua0eGwLvNb&_}())+(
zDd`OrV@i&b<Vt@2t$&!%V0AQTiAn#lT2+G<Xhu3Wmq8%%3t^Q^i&W-f?{|Q1G)ONE
zV{Z0yhj=J2bp%Wc^5ftIK28``Ws&;;(|YiX7lMQ4UB#bNfpl_VR+H?ad1_R3rg&D&
z0Q69YO#&sBTkfWVVATYxVk#S=tbWnGP*#`tneqcI0G}>10`GNaRno`ZI%eS5)Cx9D
zr0@g&oktU1l=!Q^MkuUU8mb0~ryU-RN`^A}M4<-Rz91egQuVPIsdef2ilJ)(*fQ@X
zpYp)63_%tlB>0bEY&RwR&=D6GqdIQfSskuzZr{g@XCz5o?Ir$2=#uGt6<>oLrhj2&
z_&s34cFTd-^w?M)-_NA{30c6&+PW*?oMfslhCE7230bv#Wv921La$M6IWG|}in`?0
z_akNHrO>%C+^=)Tyt+kAX)>Wg*0JsjI*k|_U9#rmP7@DSScbV+Oz{807rV<3j)ban
zQLpt3E5%#8q<abJ9<nmGxI!g;!!0`rANsS}?<$qZ0TS=Zr`~*{JHx5*6lHV07#cop
zh@jQwr=y6<Y$S0{sN<RYg;^8))TGk^E<tfq2*P_lfU&k@O^jLBFwdF;CL<0xS)5*i
zx5p_p<DRC|amLe=IdPwRL@50uwwk@3;UtgB%vkf`ul4@3b{rBq<ds5q2A^(8WBCH8
zFUPf3<gD+I1JU?sxlPf)7*{otB$Sc|Jchoj|0@`d%kWP8u!wyhCh_KNjEe3;Sluyr
zA_iJ2x?r}QFD|WkEB_zPP8k!8cRb4_M~dqDmbOO9FN39jltfIzxqpbOx+|&(j4wy9
zCYch^sq3)@{+lD&ROI_(bW1tVjrQ;EIEad>q-qHJe%!N~7LGfF_*<t9siM){#}c{)
z_^8hs*S5A{B7WugtT;=<%Vmg?QeD{$971nZIs>|n$+HL>1rs)hnHZ}~0_QsF%v37v
z)Ebn-s&(1d=I26&AP0lAjKonUGolrO0o&XtywtZ9itv(B>2l<E16=lh$QprcLGzNB
zHhuir7~~r8g(p927c?``4hxzuC@uS2xOe7?^Vj4m)=M`e?=#atL|p4&{Ote9SUs;R
z)xMRx4gXo}i9EmY)Oz#4c)x*l-|qM^O5=^&k2&Dn;@*_e#-d?W8D6cABmbu?D<{xm
zPotS25LK=d`)5c{h7>DjOG$aislkSO9Hl3HGq_gXV2V2#7<&OyGt<O^@&pOERKMvi
zR3v0D1KbFRhIEy8wUzOzXQJ_FfYjT%FtH_Kfpw8uJ@R-4V^jfJB}{+14g(Y&Q%d-7
zp~R1>p{WvcWtV-U%9?l#tJojM#DfdJQw*(2W|kz9Z@<LKXjmQ2{N>n|ZUzB6misc=
z`NwtIXyB?8i|rh4e(<<5+$ku+%#b%_-Fq((t|N9S7u&!!r8b)nY$^Tnas>mV-#aeE
z!6*BT4x<Y^N=0`jD2wyWy}a)%+=G1ied}cMHrC?*&~#T(Z8dEhfP)7s5S-%f9w_ea
z?(S0DDK5nwio3hJ7k76lE~QZ1>7Vyo>p#xQ$?QEdPbPC;k4wD5qv{crAP9Ti$d-MA
zs3=!X6m^8R73OH9DZAkS#3;+*xrUY075dH7h081pO|8ktw)TR3Z=UsPomsJKrDvpp
zM8R{4xkrD0KdEMDWK)_g4n}x&-z19Wo8xFnP{d%w4>AA_K~Ws9hKo3-9O6Y`^As{r
zdM&~Nwbine|9&J$q^Wc~f-rR%HA6GQq?}=X-=TV|+wa&^o?P|5WV`}P0aJxTbG<u+
z@}y+dP%$|PDFzPt;*+I?G+KglU2aU|WCfYI<(P7F7Fc~_se{&2oE}BWax2kA)#I*K
zh-cFoq+Eo>eJXusrSwOtLrd;xJH!uIh-LJz@Zn{*dflt5Al&~uz$oCD^{8@~c6Ow;
zRz7Ua(H$vgh=vNUQuT$L-nSYx<2>s74JoS;8s-O3K}BjavdCw<9Dn(u!`qneEMD@Z
z>FP^1Ry<0|7$XVWVwP>3C4;JOc692{H6l>1BE`!moSCG^HzQ1qDQcQIr$xw)(=G#=
z&5ji8wLun99GXe+dA*`)zPe#JtT8O9uthx9V?DyUG?D#ppc2|)gS%DXR*{YUGG`Ml
zh+8Rx6nSvTqA$5)!M?sx&LJ;WtI)#B!i*(Kv`xD)vG5P*Z8Wi9&)|<Rck3n365Na)
zF-tOVfjO-8%F^X`xTkjHRvyho>1E92UXN<<Um)~|2V~C;*uj%8LM2@Qb<Hb2$9mk<
zEoXNVDVNR@!F_utX?g87#WwwH2bJM6vN2=D7Q({GO4}V~oVKR5ab+Ut&aj{yyRZax
zP=7|Yx6)GMVRsRNH!Hp?eqcD7LR+?of4a1<X3RC~^~Q}aYCn}JnFPdnE2pvfBMpFu
zN(a|ac<-9tF7-?e(XoMHTiikYF*;3xzC3!yWj;G@+E%(St=wxk5kcHlex(^%|Lm8c
z5F;|qL>p}vL;8lv1sKYi5+l~6R25U~t&9SM<HuU97TMXm3VY|r6-qb65HB!n!(+c}
z7Nx~9JSQPuaK}(LiSd~eMO0lh^fbo9K?RLLYgN~N$|jm)W(F>1I=^ndU&gNgDi;wT
zXzY2@n(q>r9EUSvjb-mAvRNvE?H})3iEw`T*TXonkms=e!Kto9!iWBHAJDvfHTI91
zu@TQgOvQ-)aQnc9Z*oYbyyNK>e-PU|%_l|t-1v|Dwi6Bt8!O?Y<^~}m3-&qpJjnrb
zcnw$YIqQ04xbiK9xo;_0uyQ=&2OB%wuR_$!LgQ;{7yU%+=})+(DpRQ(sHF*mIut(w
za}!9vTa!y3FgT!ABL7i>t&-?EO|Kts%*arkj;fNa!YJ=J*Mgjjwr53PMHcVn>a0n`
zg`P|E<xu8ItDY4g-k+_wQB)o+Wu1cx%^E4HIAabG76Z;a;y0IOOqT)-$)rZpIYR?l
zH_7PHr{4HDk!Sg0JkY7mR?NKfTJVPr2uwL+OBWl=j(7oqt3CNSZ@aesJCfx=I}LMn
zuSG)|4gnJyjr_WQ+q}IioBNeBX21NgzB@o6V3c{8`jZ+`B`I-aM0UI>Z?Bm%HQ%_l
zJbo52IgP}4m|K$Yl`Go0K11@@u1pv}iQGn7N=VR-Iw*{3lz&m;mmr9#TO=RF$Z3<u
zv5DA#j~q3i=Dp<I0DgC!P$^tK;C*JpM1EJQP%-c$-Df_q*PM{-a9oEv6FV%1JCalV
zFQf{Uw?00U@cLJsbwrfoQURrweS#92%C%~H=%(5nHY4dWgr`x7xeJlQ=(z80jypWv
z<A$O%P3lLk!Fl^xN?|4jnHv8GhHztXTvJZ&F=au$o@l{8+2%N~s2Lbu(cho%`82a6
z;CSsLvzb+-?{XWkAvmfBr8K;<;>Grb#T79Y`v#Lk!DitQ=a=r3Y$;3QNjYI5(>%RI
zKoX{TLFP4OH~F<PJclFF`YE+eww0PeA})nOr%D#(c4CWC^+29O28?j*Pecm?jq${h
zRLb0@Ca`c#5aW%Sk41F-3rFx8y*rXcfD&_sN%Ehm5{a4$YBdrBRKjJLbs#&dSff(u
zXqJ}=bJb<St+lw=W?HfIkO@OdE(gar2jDqyg6hy7j*7^J?Wxiv8L$=syjMnvM9^ga
zEp+%`+V`^I5=Xt<PS|08U4GbV!3RW?Xj+|UU0jp95^^!)XfR-de)Vni19si(^5y@u
z?U6Gx_e(+B_7IP%upq*2A836QD-{WrQ+ipJjN$hCrV~@LNensgrG06+%5^C~1{((v
zEY>;EW~(Rf+WWgYZp>FFXksFRm`H{<@O@f@^Ul@|ED70u4>|87KCf6$jnDQe*dvG@
zipom{CY7N}I%c0TmGtY$iDnBN2bl345Ll!btIgBzi!`5cZ*cE7bf|svYIQv1=fu!|
zCiwl?_5MzxjV-?dcZrq;RT#CCOY1jT1VHb~_lr9)k4MgX1F+8}BdC{N!bcMHw!qW$
z$=?3mqfzT&@fLCr@_@{{hx}!Ey}Z7q3ki3y3Y65Ql}ST%s~_J_g!%w9&WxF2B96B)
zP=Y`1wj=>|xh|&8@ilvLNS1AC;vTo25Rso>ysz5!dbJ%46&=a|1H5JqM_XKrAg9H8
zVto(WFOk_l-w^uG7}m57n--*{iSdHd^#?UV56LEVndTRaW!QOjinHmoX^w+Ldf1;?
zgalNq5-tU&*vuW_XAoqrjMP<DmtwGEJAN~}Z`I`2_tgiBk|2}^SsIIK`IdG*PI1zg
zO3>}GrbT(ypV8Y{vM&=2Tbv@I_++9AROcAi50_dp&}#D<=k_@e)fafw<*w7~-9Tr)
zFYXSRr|Gq2Mg?1fgFqZ>J}q-!wuXVH!_DHzq&I|9NU}veSd^N|#o(@=iy6PuKeL;P
zQ2cVOFLLSZu;{kvzsVB1$1%PN-^F_IjbL8iE@p@u@!P9&T6ln3z?*kth+JQE3|QBi
z&OJL>$l!DR&~d{E_Fya=C`I~Jd@^U3*Ye~`x8-dgK+n8|1bJ;79tHgGuUxP)gVlnB
zD(mQRZhLk7DSHXOOwgr$FOnZyj?e1C2#Sg}ooDbxzHyXu#ftHxo3>;ZSx00a)v=WZ
zN<Gr)E^^?iNE5?Tv}}lumt)B+Q_={C0Y%P0;heT^K<TBn1>c2`Wh~!n8Sc-e=IpWG
z3E07wVpIrexmkdv=+UX(dZ^KVk^NhuCY_M`9l<?~KP1Xb#N?>Ao3YtelaeTgC@W28
zYe~f>#z{8Q(>paAyBJZ6za~U(vYxB*rsYKH@ZEnKcMM_me@XMqRG39AwQtb`N+rey
z*Zy5pV1%x(CkS9~R*@9M*A|!O@_hlD@riNFQD<I+(8q#)waltR2TXb&)O9(Hszf<S
zN%cv(6*vb9x!4wnkObdC{*qpI{MPB%icfAM9?&|2!G@pWpX0#g+8JeQ`%yepR9|M~
z?EYLQG`i$9Ne=ZVePmS!+9!ni7>~MDHO~0bB<`&khd!allvY9xlTb`jBWT*I#kRD8
z^Jej3`7e&!z9MOK(OD}?6>|#J3SLL|0Q46HhfekfV?sM4XcOHiJ_}TTC=5Bj$%wW<
zQnUmWfs;a}(40{yvOc3oa<^fMz&i%tlaRLKd2W=1E7QCK{Ly5hdk-t5`w>DiJxv5U
z9BLa8p<3l9O|A6@Nx*o))bin;Sxj}%Hsf|=+@15FTaCaFI65=2Yj*#KuVH!@leM7g
ze)b7T^YFnF(?wX_bKPC0I~DpBNEYJ~_H?zoYg@^U>_p0)X}q^5h+q$GN0VJyeS<ri
zpFmF<K~477;n3r4PLw(^AkAmk=5Z_0vU5nlL^D|)j$L#(3gtRYS9Vp`o;4RBztfSK
ze6-jIEAH~qpP8-07}FwMBT;t~cU;54^K)Ov?MJ~~$Z##buFUssbJ-gfP`V2xg83{~
zkLXT7c^~WdfpV>7l7w!ezVFqTwdmlBaDsG-5awKmv1YtY)RFU_VFvKrrkldPQ=gV@
zM<S4+&{BgQ)6|S{w!|`0Xj7EYllW@t)80L7E`I*}5x`jawt)L=Yw{(W1c7Ye{Q==-
zIl;p#CUHJdQHVV?(!UReF=mW@=6#iBWZ}&>R}Va3x1y2<(~tk}>gjc3&-s?A%l?Wv
zg?vk9uFn4vIv|GN6VQKxnRD$Bmr?pm>R6~0@oa!NGuFb!dbUL8<y6RMVGXGL=w_(b
zy$+IT`Wmj3X#ZkewJQE}dok7Y9nE8|)p+W@8CEFk;z2A)Uw1lJc*-c9-{UeK1)%_O
zdfvi%VXm0C%TQh?WDuKtThkex-1k1oh1`_$GFD`2&raN~{}(Bz5h+^>t><IGE7ng6
zJR3Ak)BV|_{PCevRmPt<JK`N=>R1ywCQNQ|j<-e00-7Qgv;(?L@CJ;!=X-~K-^W06
z4qANTK1#{Y&|P2%HkQfKg@Q3Tj}`{otZfHh@p=0xRqYjj=VUEfvW+|l(RF-Isc*F$
zru&@ku9D`5aJLz)1mx_{=snk??*LHNtb$Aa8Cz|OTj2|!Dzf8EAS*g<WWq3SWCG8c
zeKp4)T*3c#C<Rk(hp5vx^i7(e;YXpEd$4sw9dft{2Pe9?ixUBfsyD8sso%CLQeCsQ
zS~3%<;<6i7hR8W73LKr|R%-v;fLXDkRAdDf-FW}hRswUqxub2ZUU;G{EUPDFpO#BC
zYIWf~&y&&FnEqG##)bRBrMR4gY>`RZS)^&#s!xOMVf;;@e{#(*wMr`w^+b8y*}07_
zBw)n}#A8a(gmi90!f(fP7hQcwv~xa@`_`%ZFHoEgyn9{$Oeks}G`s&5HRu`=5tpt1
z1zD1sHhCadR}832hC>)?PKECmq&WNZ7HWvx1`#WB5Z})qn_o$+^lTguB+rvb*oKwR
z@s_guWfh0yiGQjm&}mLEsSAH53~;wEpv9}nAJE`GYcCP-Lgx7<X+_PYWtJ%lwL&$)
z4;1;SJ(l4@s{U>k4r^nLuAn7Jos|(XQtX-5jVDjsU5-GVH9NI3F_7|$n1vysLq9G_
zp%lF~0bhkeX>D>(Q|M%_6o!nBSWrWa0{P7IQ*-t3N+`RTcK68)Q-)xqvEwh~<7<1=
z<L0vK>=PK#&4nLd1E+sUm$u`0Z=xP3vQH=y_=s7e$CIX8i`F53Mm<incp@bglCf5f
z$Mvp`h3j9-ncU8l8!+cr8hyA;@4haCat(-UO8$wJD|qTVliZ{JaD#`Br!a$i!!Yxt
zuktHL9Ai&0+<$p2tSU6^%U%bw{JB*&G00O9L)GCI2g+C8_zCA!9)qvfE1R>aqq~pI
z>=Fj2_7>ys$8dM!Hcqg?>+3TcQ;d@~u=2WIwY=!h0nXID4>p#vn1ozZ@M<myoR~p?
zX<;-2>zYx9bnRpUJe($^gZW=T&+zr-l;cb<;&*#_izHA~+4p2*hWj3q?Cw9A4I0X}
z*DwqX=gRFwf(C7;I%siIk0}*jT=1<9%7z%Q7!S(K#v<KPBy&K2)*0y9*swS+>r74$
zpDFl#>7`9f^u<pNj0}!uw9fKN-5$QY?wPPtQH=PV{f=%F%(`c?WM8quxhJr!-<}sq
zrsGzbn0>lXln>(GZG5+}etpb$k}A;ul8`{*7{>_218-1pj6@l8M7>zn?n%z4*WOia
zrQBBC#^S__Kx5`~dWkQ8W<IO7%$&?NQsoR5a>;6ASE65vS>k{TpXQJZCr=fPbxS%)
zAg6RQqI7VAhxR=Wbq0pwy2B&%iz~#RmYG%3ZQhs)tN$72&%KD7sLL5GQD2M8q<oTo
z=Q*HYzWp0$9t=teAN#jQ`iyrt6kGs@v1;KZKS4hgzF}sWz1E0MNNlubL~zy2rOSpf
z%RX0y(YV+}xXQN82y1zsWIw1GJ9n~mc<2XM0MOJf8`h&yMi5l7B$5U(J<#Jeb+~eh
z_J1SJa*=ve+<G@b0PK96<)lM<5@KOorkrZ^l)Y~aN!kkisZZQ!yDrYmnCdH0-#y0s
z=U@3{@lh?;VxmE-==&HR?H_g~PvQlQ#X{s4wBOyLJMF9H$=t*U=4e+b9wa(bU2O9n
zwd8K1)5T+HMQhoWoDU&c8ypl5YHl%2x?Dxm{3uD71&20?u|n%J!ERr<<ho$a{;@9)
z-^H63Hec%)uaQl${W0wt#+2;r8v^kDjsGnX>U9mb(;VMfp~beVH8N_6{_s7D)0`K{
z1FigE=6Ac-bag4N*YXKclOT;OVZ~zJP<xr<k!&Jk%~v#2TTO&VuQJ%KV~+b{`HIY0
zM{VO9MyT62m78$8nDT2jw!U{Yi6GC<Q9w`4JBHmw|H~)i#0o||roiE<8dGJ|(2D3c
zJ*!0<i)}IDt9MVLBRpCsa+&NhbwqhyY9q?;c|zmK-Lp#DUspCG_7RLVd(!39J0(J+
zX^Q7L?L-ljtpgACM5kkn4cLbW%{jb6*ySdpW7nGSr~XLUvd2z2U9;KJDv(SEyr34@
zdByV`0}35(y?Rk*tOU!F6*>q#6v;HY7O(`+ULwbNglLsL(q6#qGZf~g_lss_Oau-E
zZ%_NHKVq&g)SJ-F1&UJkjW3R-H?m43k&E<%6|ih+T=zq{n2AM5(6O&=GL+tV<6%nV
z5&g`ew6)UaJ3koVUSrvQRn3y(_@_JK`<scUzn(jIY_<KHH67^s@3srLal}+Ed>neR
zs)72_7K%kVZnL}^F6#|__9{7TbX-_x7}dlKEr_hu)#r3eX+1(;*mdJ6)P#LF+vmY;
zn(c=VV21O8N<2#7o|`o~ggGqf6BIjvHEs1~ft?)k0GRyxo%1sRH7BJFZHld(y~lxQ
z0it*O0$x)P=T`<I+DMxV*x~xMzZT3e7j*q%;tR|9=4xD>F+sBf><6(JN8=l(x4mt(
z2%ME{Gt#gQN>nTCI#}|@qE}Ap(Lb|F7IKjnTG4WML)aJ(<Ae^67j(gre!>I+?lkF(
z#-?^Zv>6QSBwrE6TzJ?}9<Y`dSt9pspP6{MMd*sA@iYljZ`uMH({_4aRm9sdi;SLg
z9|F4pdgMYAS)2}~r%5KeGV`{TZ2p&+w(>~o#CB$mnavoMMIwhXC0uU4`L3&0TosZo
z!>3XxspB4pmhNlQ31m+ZbM77J97SxX6e55a=xH3@WV)qlFZNMzv@_>Dm-J5)%R6fV
zGqz}a#OI$jyOIfnyuJz{u)jXbY?zu{hN#Jyu1<r~niL<;c*Yms%J-K}P1zk_x`<Jp
z8gd%$7~&Ydc$<@xAhN%gieFwWv%*+3+k_IeB{ngeDkr09<n0+VppOy#<TO!5d00ic
z5}*mPR-$Jk_82_lNsOU@h$1r&-%{NRaAw2^EHmBEr~)}Y&U0lT>t*-vhf7harK`hJ
zt?td-lcTy2S^+hhD{*_D#CMlSfpURqH^MH`-=eT&Hhu)3F!EEx^CS>D+{~XA`PR3k
zD>9C=*pF<%rOmMHYm;R7r;^jUpsVMQ<4C2Q9Jxl=jrItFZ=Pu_H9EX=cpL_#UBAzo
z(#q5y6*YA>>{SOD-xH7KOe4XTXWlTFkL6Q2{R&A(?sc`xg*n7$Z&R^6H7%w0R4P4e
zcjE18jN{>_@-tgjV64(^FNID=-2sjxo{^yUe0txn-<pYfHk<vnu~Hd+>%Z<9qY<@I
z#M{*jXn`X5(%HIYCLQgJLKN<>%aXio7xUmR9vZOxp~;nuv=q$L?EQfXg|k91QNBFn
zp;N|J;1hubn!CtoHWJ)z|IyJG{I-`*rT-BR?FVtb5W=Br6B0ItIH@$*PJ_!3@s{D<
zahADl%ViS6-V#5yk3xV_LnW_4%$Y9-F&*Mpc!~n|>bm{^#qG3wT6$R9N0IsH;0>e?
zJe!qM6qGJ$GB1NQ#%8k$WfYbTQ}iBQh*^7;clS+&Ye^~WXXvtBdB(AL<;yrZ$pxHc
zOVTMT614(nI+cH#*(RsZ>J%Eh(TS`j(`vvZugIfL*xMg*axq|bsZ(6ZEbiTazT%(t
ze3C@6X}^<^I6uYcVTGTzG+Uo9b5Pwo27g7TzW;;XI#Ncg_^`jE6vqoF*YQhM_BN7z
zXJg4MHw|Yk6Et%EM%AUg6e|#XW}EMUzy<{}$U4{N+lJNyxxX45D9M~&v>7&)IF!GJ
zWEu5$XWHtzwIGa3`N8wvZauURz2fxz+DQI%83?x>cpcZ|s0U{VfqlOdd8|!LOkhY6
zI-eGNH~e-z3}G%FAo<K0p?`0XM0b#<!;dV-Uhn^m3`4IyIm4SI7&QLBo4X$mdGG6a
z0@smB|ML%0v0EsJy$=&13FSvcNSbf!W-<4n+3#Wf<kS6m#lPPHebcVppRc*m-uEHw
z)1CnApP<naCM_G2*i8Ruez}cO2c{$=)1e^l^;|Qa-i$f(V-7sF*SA`#2VDai`n=yX
z_aVBB4$z9Rq-&o&#T472&9mk>bO^S2aib_wO`$1VN_atrx4C#mgW6y7h2hr=*CVfN
zT=ZqJ?TuuM*lMoAq&Y2LXlPkuzuk>KNwR?BDSpl~T2Qy*1n=mYPMpFw!)1cVo(tBA
zDI{y%O`8OrQW)7yaZxkIk}yv?2A~GK@BXzt{!#JOILeuA+6{z4lo_IzgaJp(qO;hs
zDWvGychRf<fGY_uWSaDdW!4%1uv<gXvHc1g#A8-fz+kj%RvY;g9LUQ!o`T;%h7yBQ
z5yWmSCkjMF#1KTK^nT<BxHxHj<S_!dy!L+Ez17nh_kCDzbKT)S@${dya3tEECr&PJ
zrD6z0>6YahXZOq4YNMYVKrOjt6k<jtp>mLu%~*g*E=-`JQve|xlMd|nZIbDo;#*}q
zLjtEP2Aysj%{C?G)0yD^W(vf5=`tTr%CU1fO4VXE?0(AoILot~%{8F^-=o~zd1&o>
zo9yF<AO^DIc1Euom=K=;67F3e)`7!-_n=u|_>G!He<|k4n633Xa30W*2Pfw$zAH-p
z{#KAcV(SM=3!7OlKBn>u)?-krVocTd4|6U!8B-N4H$QVHn;4NneJn3jg&IXcl7y#5
z5TRAB9b}{JoRG*WyeUy(3Cw)iqD$@8HURE=FHJ%fcz47CWs~Cwo>%ZiGOuTQ-(@Z6
zJqr<cMbqNOQ?i?_a`@ZFQ)VraX=!LN-tLMSOfhWaWdOo5mqI=sjOG>cbbWkeWu5v=
z9jXY8G@_+4=ni#$@y-8#7eGyw5rmp*I!sz6g!%XFM@O$#YzkC3d%~g0Tmm6WT9Rsz
zJkZ}yYCA~W?e74>E`(RU@_+2|dv5D{|MOo&m4bqTuH~bS$cEi&CR-vJC&&NgtamVp
zO71^idX(4~1&|Aw1ZRt7EIN&c|H;+NGw1EtS8D^&+e}XbDxU7hKc&7nC**am$l(Lf
z{b|u)U0qW+T2z*@m{Z@BhrhQb?da<*NULak|M*k6bl1n}QYKpt=nIan7r({TwVKju
zj4C@vCByMffr5H{5Qak>BTV{&i&5^vtU0T32IX=M7wokS`g<(fpWCNe80~Pff6HLl
z412NZO3X(q*i8xU*mS9E2d%Sc3pNF)5PGd^p`R2IpU+u*Sw(u=->@KP-LB0ID<wz~
zw7A;c#{?r3e5m-ZC<f|5ky`k%0RGjQtcWLhA`QwXxRSwLa^XfLirEx8qJM;hE3$D!
zODV%2@k;m>swd}Z9|bZ#%-@(bh`!^4I`UFq(M<YCv1ao&*>pXPMB}!@<XdZC$;kIp
z|506iL5A*!kQq{vlK<K0DYIGJj*F!VpSkSUBB}o;?m&{p|8}n44b}E?ARx<s9!p{(
z2EYrlf&qR(Oz|CqCIUTJ3`N>Qa6pX<3?RGEg-bQM^bB%s=uk_A8tsVBjVRGi8Gizc
zCg*R{fB@N3wY+@th%8usB~5q=ZyY4Ll^m0P9x>iuE8-c&qC|(@Sl!0T34L2U_=a#<
zU!S;XQGfBA-<?iNVNT*l@g|iEo$<4n=kb^K4}1m+)&{DA5q4N43u=-iG3Ge<n7^U=
z2K6Y9M$TCmJ_SKsI#>>vfkmhVQ7tA+bae!mVv7kBCL%><-8~6?cDQ^ns^sqKaC$`0
z!~~%Pa`LD*+J)=%%u|6D7@D<_mqgVT3WuwdB+f+z0%I(?okp<ZO6j}1heG&${3~d`
z7#yn$RXkuJDPp+5{j^&z2;TDv&@(`{`L)scKoX#wT)GcQ590&)AyH(&Ux@bu-H*z>
z#R_?MVIXdOx>=k~v-Lb=&^>)L&7!6A(yhnrY8Adm#imT_pGJhDW{Hvt4q?UAw#$yv
z+L}`j$!z>6zSD7E&CbrGWTQz!jzehpn+kHM@<m-KV$j1(-_{UJuBL*v-#D-;HpH@m
zmHow#8j8Rr>(Wn4TE?4PT(XV=`D^%yG5Y3^DKc1ETsxS(*}vgC88$iX{WF`i=BIOA
zh9Tuv>HX+JpJnXB1b^>elSJ27tkq8j9zlL><=%l0`=a>_ensEhGnYSQl8RVHr_u49
zAi2bAv-2ky1t}jA><Zv3jV7&fDI6wb!#&>CFM&M8yx^d9v<Tmrpx;r)h6_jNZwcpn
zyw+_#u!H=3zwt#9D#^s4{Uxv6kdld%>83;_SB^x+juu2MpzKUJALejcc4x_iKB`3r
zT(lW=mF#}JUe#F{*(d8XSrUEwJMizn9s`gN&$iYRM3d(<8;KD^6Tkxa-z4V&`u__Y
zBQv-EQgHNH{BMo@_P;mzvG+d?M=6KboyHQ}3M9`C{BPLn2&noJ)&VsML!U>jQhUlB
z<RtwCtnLS{a%*DtsVKP9eAS<8X!xJ+r<gjvleX_|rQDgABi{R`aq$Y71=VO#_EPOh
zoPF14*TW~H61LE!q>QtmA}5`?RHQ}209F-volP9%dR>vUflw#$8Br?=<vSdw*ri1q
z^dqVb#KD^e3lG>O>+*nlIrm!i%N7vNM!1)`BhPjO3>HJ773X_F&<BnT2k?j=A60F*
z<Ptak{T!9;H#8K0y7;0`C{$cJAu=F^bk&e8Z-x+x9b{Ab$&@@Nb}O*ak}=_y|8G1y
zl=)aAeVdcOqnH@+ekK*4Opx!V2(O!QngEF6-*Y>|2gc$*>2}&1gpdLiDQ_!|?<;9c
zdbQm*6A)Cs1n@Tv(t!Ym<f;Gd`Sw3BpHa8@R06f_Ic$sq<pTeZrp{gJ2r6PYO6MEq
z{kSfeo}<F;B3ENp-$2Rm>Rso?z{T%2+sUy!j4~$`?c3>ZhL9CP`|sJO)FX_H6<)&Q
zsaR+@dhJupvibNyTQcxGS;a~}rbaUYc0MYo7xzsW4JElOD>={_ePA)U8S|Q+p@Tq9
zVolNKbCd^_+=)vQx~rk~X{sPKdhHRDB!(m)=tHkN%O_fx@ca3Vc@zDs!hI<=h>N3w
zKzDkaW=Gsg@TiXouY?o9bRCtTKouqT#y?2+Q;Er$>{Rgz`Vc6({Phv~Dme7P7b>9~
z_ha1Lsq9cf@gGORn{-cV=x<VE(G(KJ6}JFk`3S_myHw}VV7ULF|Nl@o$nc&02jW9$
zrZg6#4@e`ATZo^pk@R{X^l|XJwyU<@ctFnRW#PZVy2|MN98baf2YQs#Ai0qDpFnq$
zq8->&AG?_cd<h+f`igSFDx#IIG7+u1vXV!UQz9!$&iliEjI0f8SmP?i@Mlnp-xO;-
zSX6+jq||D9e}AS>0rK_sin8~RX+Ts=_f+g+2zxx~rfO=$MywTwjI-9`Q<96k61~<`
zt^0+DvgpsjrTf}GJXICty2gv;>$(ztQ5x77K-E1GQJdn%$`|bN8da>M3YGq9lgtk(
z8lz-AAp+q(B#hu*t=z(?5P9gr`sk0^>|yObW=GUxM81YG+z4{;@D7qPC*k<RCl`F$
zNBFzA;6L9Px5oN-<s-y(G|`U~GL^TEXxm_a$r)`Rb-_@*{pT@wjmsJCPeyk+u;N|l
zCqpLj9b^!nPNjr=Aeh>JCQpLcC!Ie3cSskI+y4l#&GacqW%YWPtW>Ml=J3CnEb%3g
z?c2?UY?cNZSCacZ5n~+uMG3C(*laX^9l=p@LuHwyU)V@zW;e~Gj!p9Ur~AEvdyyEg
ze$zx-3EHba-Id5#P%&@eMlZ8~LdSlFf(0%ZYd0AcFC9+h#4k9|MOG39HeckAkBlK0
zuAp^?9r>V2m4#qQlyY-UvkOUnc~2!Ku5}SMZ{tE3kgP)2eSpOugD{De#7M-<TUsmI
z`DSU~v~f((D1!FplSWmA;o(kysBvvtQX(k&9IFQ?5Ei)5k(1hDwkFxHKw9u#de;_5
zYd1>zPk16r3Hp8c)DZ!*j_7BYh3wc-fZzR!UER6>BM{_&1L-rueMH6H#9iQzkoBL0
z0g)6=Sp2V}A?!!4&v^yJ;#1}Ef;4IAhPWXsb9loL5`zJd&g*`zIAv>(A^v56P2caU
zfinM7F41QW>g9VWzN3o7qr{x^Qtd!#Hi4=o+7<GI>Z6H=p?4ZBBexs^E)jkeU7h2}
z;^7+3g2B{;>fn*3u?&<rihGW9rX?Z*T+24YOfy-zG+Ot}c4gd$GrUQ~ppod#zbd(6
zX;kadD3zu}V6KH@(xJ52g_tSAZ5-qpU7zKATf*b&BH?@+>_HP#>o7%5x{~UVsZ#Ey
zuuhl1M>qt!SOH{BH$7@6Xwv)~I{6jc$s4-~^gro5Cxysc1JIrNk*Q|G-tqvLH!O;g
z_<yFS{ha};{?2VG#se|<9F{ZL9ro*urEk5jmsx^-KHN9A!(2QNfe+Fpr+`W>?c150
z5idj;l-rw^B6)}G){s%mQ9#>;=pZLk85|JtA}4)$4SLiBpk&-;#yVLy5Y8lVMwV2>
z7LZn~Im)c7Wf`reQLriW3|}kOK;FnRuCdZ*p~2;?u!^+N;UNJ4RET3kw~7Axn{575
zh71aHHA?wYM^@0fF<YpLK82)jIXcL)BKpbsYnGai>jX^p263j$xkh<JBhRF|clcp%
z7d`S$E%I325n6T57Ob{1Tk6xHPfnS832vdgzAF~nND||<3zv3$gu~#=u_;5KDTdEN
zLVo4(2XmT&gElR0#+|CcI_M8nptM%<{43c8zO{5CO5W+plmI2YqJ%7|Tm@7=dfMAE
z&Kk$le_e?naLzYKqo6#nohIFSv(4hwzmKcFJygg4Ogh<d2*?uvS>t;5vFp~Zsp0;s
z6nF1RxrrdK2ju5!8`#P63n4MYAX9?)mW>vZ&EFgErXbCTx{U{dalu0Y+8;aH{z|Pu
z2s<uzZLASajmE5YP=P1)nbn!rv*E~kw$-oBDy1VnZxs(<O??f|BfT?!X>45j0oqj@
zM}?lmI_J-)-!m0C-PEcOMQ+Tt*KkXERaGVf-V9CND5(JSqLpfg%%dzyNFJJe&Wj$=
zztA@j9-{!d(1RYlwJDp8%gVdvHo>TEk?wO%1X0sUY1%(K5tK#G(F@E>MV%%uS=;DP
zt5Q^V+^IBoRfzJSVGA@^Ck~(RmAkk|q0MDoG{@0$M&wD)u{p;R?F#3JEf=m>W#BgG
z!4~r^RC&8<j6eXSF3b@M_<$66N_>BsJ6um{wHx*yHXQ?wGprz6gFmEY%HJO`?WV&~
zkk2l?l7k^+)d@sr`UmNq;{(yko^PZ`{O+C(;sgF`iUhGji6K3mAPeK%{i@Nw&A#`|
z-RBw43DaUeL2+~w<2qATI}wFYNn-%&rhC$*RFUM}zf;VuCZd+qtlS_HV^w@x=Fq5T
zes^cJ0?FOJ`4FdqB4(xJmhhs=1iMC#u_lA<&(3Snf*8*q-iX>YQkC8NSOpZiLP`*i
zHZHXCXVe+gH}C=1Up0_kjy~`uGuKn(q=;fdbd#ED9BrcrId!DC_a2~19zw9J0ZSKi
zD)+@#g7Fs!Ygz#B1hL0mHXW`+p8*RyJ%vxkTFG}TP`F}ibqZ%0wwsHa#U>dM*!!|B
zARQD1QDayjrA6zegI<r%J!IO(34J_4xHh+$Y#!YLvOyvnXaEG7L5qhVtHaT_d5|&N
z7Fn&)^Mois|LIS<kZ*n7`5UeVdG8>G>U|I^A3H282K<8{e4U{(QJbpLw-E(4+|Jkl
zy;g=L69x@UD~Yl%xz=7w0nD?Dp);jgzxh`ua?`c3eV9|IQ~g!XC2+Xo_~v5@SB4mb
zSYRz?WHN+V2F`>a*?WY_(DP7=z~6b5pZC4Xsd!eADm81E)pzz;M2+-Ql74@PgjFOL
zfL|+3lO0=`A9oWMOcpf6^vK025i!2Tlni>;WGrRy5-Fsil`x&}(&kF41*x}II?2-=
zA~4?;VWpwZ*)NTa%--an$=s0yw104XWt7RsJqQ9)_?d!Wsseav(JCxsm5-WSPG@D=
zdGehLS}6QEpT*(k;Eb9HWO>G4So*L3lvhnz@AJ<_g!~<MCc_B4q%)i~+&}(Px#pGz
z5D9T3Y`HmFlP`f1TAM66@);~a<Y6h5Url0`zPUc~c{YzMrNm;3`bykWER){?J%{Dn
zsOhpoumRsYO!WH_ZX%S&rXT^n4{vOyUzwaW(ny}OXry$AJF3~Y$EBWS5k}>*PT^<W
ziJBh_yUefDPfuE!OrL)FuP4chq&@8=DFT(#glRpAD;+0ZT$B4lg{ho_HOhK6sAhhU
zhJMC@N4}(OjR^^TAsrkK+ru;>=pKm{RT6hulS}xPQgwv!H3-k!_4`f}DI-;Cs!$Bi
z8{^Y;O-10=XP`zPzg?KVw!|6*ioswwKbd>T-?U1V!^Gb|bGv+UX$zS7i#Qf&c+x8p
z+cOhnGXgVBAl3i)))6{;5hik-DiDxef6}3#S%UGin#;3Bm`-6P=@_gE7AOs)$H$0a
zOk9m+K=VJgJ8VOLx2-RyRI-u%ZU9aB$)Ymq88<ZPi0(osv84NsR^&!WwD+^$u5k`M
zBdt*nBh^7!Xm_u&$CB2i7*11$K`<j*vcRGl+q3_lMUkLa;$R>RQFs*r^VECeEXlcA
zDmX!?4$Z5SQqBEa>rQblC2QGT$mIZ{Xb_-tf>vgs)j6G=g?`ivB%YPJV)dPZBTnw{
zS2P(Ihdu9xqHf<5c8nKmqxm`UH(c#Zq`fbyx}_wmCMIt~EjnXXE@RH_IK2+h^6%CK
z+0{5PE>>Bkex9RhisA3aZe&(lA+1!x(xq?h#ovU<=pS|S`>2U!`_gWbO@{4NC&wK<
zud?G{VJ9r(AFbX#!@3r9Tk_<{RlHR21V!HbB&UqSI*#!*OhtWqEsPnDz|<EiVF!?*
zJo5s7jVSd2g8a}$LX$BD!(^=u`JcsVlo`rocQnd7>Mye?-;%VX)JpHr=*~2c(lf_X
z*zflyNs>;XjVCFA$tEsM%T_F%C298=(E^wa>t!Rd)S{L8)oH-Cb5&>M*>3(onX<C%
z>hJtYASA|CwY2!bm)40GZRO=`L|W673Uyd)7IbF)$uilP_<GVRZH#*1^q?3z2^$6?
zB)KRPf+20$%T>y<!);N{y86ssBFf(H)G#7iEXyR6BBB+eyX55<%l0rgzg0>Z8Ez>5
z2FIV!q^UNvfIbVYPw3SqIGXNRew{4Cgq~ZS4d{K{C9AI^jc`gbZ9kU_S<OB|lBDQ!
zQ6*XQvwBvBobpFFO&S*Qi&yR3IbSfAD+}B;>)VdGuDHdgZ>tM-BJU--hwqmimK9|v
z>5w9=b_A`vX$h<b0h8)kq6iXwMTHaOd>hO`WE)6kL!QEgLDKsI+CMAK8AiC~zb*$a
z%p_{5kU9%T0M$sT)LDQ0P^O4bn%7Q1{bqT|fvByY6vvf80f_BR2@{@beIZw6hGx)e
z>_HRO8QMr`r4zt7>3=YLj@n}S0oN7Ti1+<IwWwTQR8~BLM^RdvurxxPlHvC{o$+V4
zcQGYtG5?zJYVy6$c_=uLi(-BsRGW3p-yvnCH=DkDtW$yD_<MlQc?yFF_##YGhhzZh
zKnTNoWh>8C(jz!&D)TgxvhH>%YqU_j)V8Ub(T>oN0wwAX3Xqlxw?<{7i5XgW3Rcvd
zefW^Vq8kdWUnN=M>yt8p11-|XU0yjis1!?%PGf*Q4w@-$q}X;C#luRty3RgaBbq@@
ztH)w+s(i%;TAg@4{9`n~?z1f8<?z7rU9DJ^jED8f1ezG7fKB8_AUdUf1TuI57^=Wg
zz#SUg3zNSUz>NVNd`ND0$PJ4K1!PD6rI7cA4g25+Ip?xP(K6uhnqIH%zZID`Hn6qN
zwaDFjQr_qOyj=cCv|f|GjR5{$N!h7@nKVSNAAX!*YdjJ-H(Ec@e?Gu?O?J;XEENWe
zU#Xn)vVjP2eWw=|XBSI3KV14uI_4o*e%qjpjjHH;DVFG#&jMX(BoAIu;XtLESXI@d
z_|pY)B*v^(B(`v$3WpoU91lA*B3o0P+8JP%6II46^5du_=^&C6#yP9lNZ4gO-_3a;
z71`Xtl}Ny-udWzP(r&KoCRJ~0dqhFqcIHL|1cu*G!+gtQoey{wum1%rg1%=y>a@H(
z6=sP`Ky{P6$1{U00`@vXe3c`38O1&oGpaT#)zaTx5to6QT06P0)7{OzAD6Evk!n^z
zz1MwPT#iOhQ#it~!Ki#mkZb~c{!Rsmga)?^k|SCmXyNFUq;|e5V`s@4r$$!7sSIb+
z@RZ;juzpH5Noo>F<(B7*d~f4Fopkyom^{?&^H^Xe9IKO*MSjK1%&>eZvEEj&@(mQb
zU(<Jl6J56WzH*2_UMtl@99L%{GVyySUw7(xIQ%e2A~x?E_fsq^R8Y7wA47D)p&V@f
zzmG^GQDbPb2v)#P4J|awAE^`*u5_O5^>J_2#kqoi4_oq5kSEm|KFOpu0Z8AMd~b1j
z#l2CyRe%Ji1#BfCDaR4%8hORp`nfZC;xF6E2b}lSg2jko_IDK%L)0r0xhSq0qTby%
zOisAFRIDv=m4h%Pgh~wrV2b<cxG1J9oGf~GGg%FB=)e|tHmZJZJy+B)1P!{$w<FYI
zd-vbk385_OWzsjyqO{Bg_*?%_-d?3D`eTqKGm1mc=rE#DHz|t}@Y``oMWt_klLJtt
zmH`HHRnUr9B8;E0J8_3xY@A%{e>q4z0bw8^c@t%a=jtqHlf*lZG_e=m*UET;8Z5X#
zLC?E^L)6MsH)5?{Ww?&#zjGsw?QYVfm)M?+paV+CNtS5K?_<P&>lG1!)LP*~0tK2S
zW-Gig)!(k0(t!7ZfBA(S<&<0>-B!eXt!d{Ff}>OqGhOP2oyX$6l?&BqsL)yTYoU8P
z9YfdQRukrsmxD@&L<%H|8WYq9G`Ho;{s~uF1j5?3nM3K>H<0S}|Mt41(UIRuuoa^x
zH@~K~BpyU9?-Lz_noH2bHXE$5iWN2{Cx<*R0IR<Dvhf2CQOi=8pmpb6c#qX&QRk=F
zvrIiGX`EoX*rk7~3d_nQAff)bG_pjRR*bU66iXeA5PGHh^E|*@?&B|?a!XPkw95rB
zWobfBL(5PYv`tz#(%K3v(lNCgd(18xBkTy=QiK8ebo=?B$TPOEpfs?;8=a>Zwmd0a
zB7}VzTSY-0JTy<PVU0#kML+Y!7m<!KjWW@w7id9=9bNrfZh{yiXp?TSm%(>=K_B^_
zyO}9sr4eQD#V*`SuSVt%Eox^*GvA`G)%&v4u=$R8_xi6zsPb5lq7>4Z59#sz67Ajl
zFUov`^sFSg^PRSg=nyb4U`~XASLRbqFc+heYW0wAK?8k0G}tn<3(GUjy_~&8cTuvC
zUm_5yipWh+qRRs(xj1Q*jk2;!)(!QAEyke!XISAw=uUG-I=Ki_-qC&rNye=>P!yZA
zvQ!0gmq6UMS;2JKoQ51LmmFD-DQ1XRS#Pkq9`k7M&i;?MIC(|oVB;y*f>xw?>C)C)
zL@3_7W7(FZTtBICBUTY?<XiPlEPy?=<bXh|0skiyN57{~F9tLwfk-G+$bqPzsHX*q
zcG!7!Tb$;yv>q;Eamm^^_>Ne7mfT)m-UF#SXhvZfqD~~zo27n1|I;L&HC11Fp`Rtc
z-BRRSa6pQ$HOQC4uU=63z;{gB`>mvTA&5r$t9EIiJrSJhHZ=-xALB67k~EcN7-8G`
zZ@da=*9z}7xUn=QAs(GE_@=g<wxSwEYwAZ5l9BA1+F0RqS}a`sU;N&f#$yJC4wRWK
z`E+p|pPv=)gRqEfR_`B^tF<beN8Cw)q-50Y2_UG_{e1;M1_ub^)Yl3gS@9d>InkqN
z8G_T_5&3GT(iQjav%}(OIl&s-xX3Bs)$f|@8`a$*im~el#GzC9{4(<@iTt*h5j-mH
z>6igChNX+;=EN@pe%eZO?y>I{s_$*w8HGR6gc0X87W*YEKd}}jbEDuy=Qe~+#-201
zA!z&yQvFdIL|rRojtXn4@D<k#bCdFK#CauS9l(COWzvzI0YDi?o!mFz1AX`|+N*ga
z=x?&WKK}CcW<|xEDsiSZ;on?LQ-2?ZL1DNuXY~SaQ~p|VYStA*JO^HQi`UB=^P9Hc
z$R3C~?wGr+JGj}}&*;J(iE6kQLw^EX*qmuk=uq=*`{?C0$)pjh<CLR-Q|U#>7zyoC
z{8M6Ftn`&Z#x(;CT#}C32C;nsBO0l>Rm_{rp%p!{J<8un(ubE3yeE?LD7o{uBn?^=
z6{?R)0+%vv$0GoPnQ;`}4<kZAZ5)ThrxKSW^dK*buNcu59*9&H1+v=Qt4t{@I^9{*
z+n8J@qRoBmk@tG|t36TW?)mk-Z|Z<V+TU&P8P;d`pEpRvjQ1hS!(7PT1OvkN96Pjp
z*)=FRZoWzlip}2hrd}A6B3<01Dwb$>pXie7DCL|}s!@iEPgNrtkUg4%xq(!b3_c4h
zkTrppZ4b>UUVDzlrsOu10K?uVjVGVunk0Qwfo{BoZu+@v=+M~P50o8DU&;Bp16v}Q
zt@$BQaX^?bbBst}2MzjHm_nDlvWsAmx6PtB(1?!T8O_OED4$h+_>S#psMAscH0ljn
z9<(Qq*#09S9y}$vtI9SmunOrn@Y&6Vv@m6g_>+s-#|i##GS&=qaXdV@B>`f;WTg9q
z^#VBo$|Lyr@VCrk`U_y7xd?a#zm!0xV@^Jvv5|h15UFYGwtY$}o)e%}*W9?fKHP~5
zQ?hw%S?&*OqNqW9{*MCO^m3|}WVf^={L4ujJb=VqmE;N?XJs}}XpE$~gCQJS_>IK}
zrJ#S2saK$<MfT6d;N22DY`1m`I8onAoR*lIQeHS^QV|O<R6#^gX!gQ`;aFNw2cwNr
zbh%vYqhLB)yru<aZuYmsFoaZS-b$s&h`@iVd39m^hhpd^`6NG6qY;{B!L6r3cul%M
zv9YesI_A8L^X`wzN_BmpVb597yfq4u8aiUtGpN#Qo|=v%GG^P2wB}TU6gmO6TOD^x
zqLGFzG1d;0@!D9Ai$67#CRvErcD=ZhgxnKI;r<IzOD_^mGVP=nxg0~xx<C~5_0Tbp
z%4{1=1!P9I>oAu^YpOu#mHxz>&<!=FyQ4aG7Y<B`>YXGP&JZV~;=~{G+#bzO%XJ0-
z5)e5-hyaU43%_eo;nqZ}KymxOJtr~X_g!;iCDW(3rG{Kl$Qg?piWW2R)Q8f{!y4`v
zvEF{yoHES)KBm?oHYn*6Td;cCpe4}gQq)FTR!7rzs?<rVgkb!*RLS0g+D|>r415l1
zmxHkz#&k6)*Hv@S8t!|W-vv9yE|0hW!c9)c#;sJDF99W`<Vy?W<`8JDPe+h5w2<Vo
zMjC=7#>_2k@PySh-BbV2mTMa!A|_WePQ+v(P7=2sCef~aQxK-|DE-zDYMq6T(|ZU7
zqP*sr$VuJ}Tic^DM1WTn`4*dgNHmBo3JoaKU$`TKVdQfK!&0*a17S7?osMubkVW!d
zbJ4aqvLg#rq)bDr5!DpAg3$?cl3G>>26N)v6JkBmzA%-E51oEFtqWE#8E;4LCl^^l
z(pGA-^mOtVi0XV*rcr-NZO=f);DnWYDh>6CT3sZVB$Re*q}qVlC9)l_qgKx}v_Sp;
zy8u7bu96uD;YwYQrJqu>|D@Am7PcQKr+F|G>!LK-<1Q1O%8?@Zetba=u7lFyo0!Cb
zGRAq_0R*x00mImJ(l=IXj@<DpkvMU|)cK4;z~Gn^;FZ8_q)Kl~zqttHS@Gf3zU}|2
zzttDHZKsiOzY@@6ps~J33q*@0(}+FJAm8nnU{p#L4HD#(L@Ca{WCY1&Wyt?tZ>)7`
z2$v@m9Du5PA?TYR0T+jr!APtps7sD!EYKj~^1hZKX)6>a=ux@Mxzgt|gVa#6NDX92
zV?f2Tr3ss`%woG1`U#3jv6-ZNO4lP88AW2qB~BodjKrZ|5$KGS=%fYra{J0|$i6P7
z7MA#V3G8Ilh4zoW{XBTW53+$Uhu=O1Gb<vtr}_{;ZKf_pU!c(6^5W}4g-Ih=>nZRA
zKl1qW*9`2Ih`1J%pCeVW5E)8J^iS1)P~-Z@mEPMI(<zOrtK{$;E@^z%V6ec-3FhCK
zM3nm~Z1vnclDis<EF+PwfzA`Xg4+kk9|z~g6uW&v1me&R_KX$tP^w;JTN^~)tCn53
z{F#Q=+w%9Z3F`-XyMwP8EuB;vWS}|SiSSJ*iX=Z4WS7dBxGQ(LZaS^08dIn`B_^a<
z(MucG+0r7RoU~CAYD6ZWR3i<-Q=;=N5~DwIuTRk!pFDvvFenu9to3!qPfr2Fgbxs~
zc{yyxer-Z@G{w^BzEbgz)`(MaPl4+9+!k~tfCjTR5%d|yy3|BM2C9gL;lCC<5#C!$
zHL}b<82QOIXg(S)B@W+_e2Mv(n=_f6B=?P&Rz@;?@<@bJsSD;A2;%9z@A4b+2#hMZ
zv{M3=9wo&hcS*7hS7YI!IGYR@ODdjD-JoG5_*}FTit(ULoJkr}TTm1N@!9(WDJ;+v
z6L5(n2<t60cGKFu)3h)ccg5Jcq4R6BY#k-C!>@~){67T+LRLEC)u0?S+n;ww294K9
zvmCS<`V%AalZKe7dtII$Ds%Op9?{(r+2gz@)j`EIXlHjz;llpnc-!W>DrtRN#fWhC
z0&EnNYetq7N9_x|)k`hQ#Qe_~!q|I=E?-SI@2*SEPdFE8NlnOGa(F}N6AuS(g}dQD
zOZl+R%YuX`#l<H&PSw{LFlebXv&O>ZDDy=?(?2-B!Xr?cfMphhp%6gAwv!Z;(t@<`
zK>+wn9$TYHp}coISZFY0^7BRQ9cX<~Sv%qi_|mz+9{g7wp(RXhys#EP8*Qg&9}yd#
zE2Pe4gUV(`Ko$jFm?hDWkok8MdFf3wkXzFk(N@_LMKE1Smo{6vl_iE4m6^y3EcBCE
zZB5Hky)KND*3la!=Z6xRt@xTzq<=AU^WK1`-V*1dfCwDRQo$<R*N<io(GMkPvRsdW
z{=&yvpsS1t!qKB;SZqa)WR2!fgLciQ6&ixVz%Y;0Pi2W3?l^TFg6(9jcnv4vKT!d~
z@&d_Gx`8MpeWp%pWlzHEljYIpV2itCI6~g<dD#m->f8v+!L?Gdl$EpXi<!PUh|Hx+
z_?D^dgl&jSng!V!eqia~JjdZU@j3anS##UMVP4L!G<g}R>6$7$S^qR{4qP=D&_7qh
z<6!$m7>;bbeWey{(*Pl!hq39&b&|yoQ(IP6V2J3TCKyB$#_K*nW3iALrx7N|`+R0i
zO|2_Pmqe7!M@5;~2WO0Vl%TsyQ#FSx<?rHw0Kbd`uUTQCiy)Kw?>_6dx0`_rrFFKZ
z{HUhPY{1ZQ1tA%lX<4zpqk^l3JuP@%pf7`OUc-}G`K(*hLeb#{Q!`jr{Eg1jTA*df
z_TNNwF7@+9_dO`TMACEf&e995_)1Zda@mzqS7o}<Jd$`&qm>v{ErUW)<-3ooxek7g
zI$1G!uF6%W#k8yXr+D$=Z&U9-^s*(iMA>X6dND1C@cTh|S?EYGrZS4=ayH{s;<O&x
zsgbahbu346(n&EuDpgJ>jAB@IqznwYpFdCDn;-RnF$m(Ke#Uu2PDe+O?g3DMI73Ma
zjykVz23EwJCY00D2H_esif~B}2kseozwEh1ID$3+fu~8#=h_NHia%}bp~3$$f|_rr
zW#0<*^ZK~4B{UHZ9jLIlGz6@$Ll36?<(OxQ%rPZOdUz=YtHe5VWZh>9($hsUEDeNX
znFs;G_{u+hKZ9i&6KIeHNom8?4w_&i2+xBrqb;B^C!Gj^AuyB^R2}u^rljc7?BrE_
z`v2G5S4LGCbzxq*TR=*>Q=|leOSg1)DGEp<4VOl`q*Ej=4Fb{#(%p@sbSf!5=YHRs
z`7yI*eh-TutoOa^y@!4F+3(r=?B{t@E823}1MC6IEeR%SV+37y*BH|Nc(Zb;U2OJ=
z9Z%}4^6t2CwSg`Qr0A{4;mWPeR_X8Jq^V+fQ6_KydAaA=j6FvzhF%6{TxzC9W+uC?
zSYnEf&v=uxwO#)QxzF@(|8W{CZ|bFQlDJn*Y4!2f*=V~e=~VoRS>V{KKc*oWPA%Qk
zF?SI$%uQvmL|%V6mMQ#AfjKxF>P;5b!ym+@{y{cDSp%2u)h{Rd+SQNb`2|T<ktj@b
zkCh=Wz0WC}_n6W&SQH<QZ)rW8eCQ_RKp=VzvgJjKi>oTg^0)`JjRFNbRoT0wFFy9a
zbZ7+D6rLr!#(vcEo_zF1B|F{8Eu~S{29J~Z6<@&Cr@YcEz0tVTn~7$e*@L~W^>wXv
zQb`V3zdDRrxCO;DQmdHw6rGq>c1J2J-ecJ+m<j8Tc3hq>#u%~+4lN^<Ikp-oN96?d
zGNvymC`zn^Ln6sn(UDEl(Vr<5;W}?I5HV{Q+ZA-7LT%e8Y{GhrV<D003CbM)%@|lu
zT7N!B)7A8VrF_5?&dEzP(gA_2Obeas&O|&v|Gdu0s4?p2p}qCO)HXcSj^>9zhteQb
z8a~zHyzJb}dhz+64Fb(lO;gt?q-V)QX51udY)b{LN|bIzx3UK`4q@<5!czhvqP0_|
z#HHCb%f)%MKL)Ti?+QfL`GdU9E1pG}bI%gjq?2raE*q>^q#h$1qR-D@^r1sxe*CDG
zqdbNIX`}GU#$GDevQGznSW&jcf@-Hun1aocgP$ZI;F~|;!h1rA?yip5^&wu|SLPbp
zId1i-1iAVzY8NrqNp|S#;Z^unrn}Q=sv*J3j7)gt8^t_tr({XLOkbER4@j_(k1{(|
zG0vLkV%fs+il$mA6~mV7IpLA2Y9uqQHsKb~RwMg<3K-ARA1_mV6&*-zQTW|xBIpXd
zuJcz$JnytdP=C$JSc+A%JeMIMB7u%kGonOs&%c4DdpC90T^o6KLb39Yf@LeFv4Z$F
zP*+%yn5cu86pNB#9*%L2!=OKV8Nt3ng^-8K&VbP9)J(srfwT=PMOLt7$fxn?2TEH}
z-I5OOLr4x6aovIHxaOxzw734}by&<QdG{;}k#iw<`idGKWv9a(vo(7o`RRBU3`2T!
zZCtlFQU*vZ!cjEJd6EB^X_B#9|I%_y-?QJq+xKQ*DiG+cPlr5XRemJH)*p%NJS5v3
zAU%|j0HJ%$wg1J1p|eyTU*_`^{TpQoCj2}lEJ8vzr8Kq|iV061Mjnn<K0+-bK(e&p
z;SjPcI>Tl%<r1hQNa88jbhXu?4ljDSs-X>{C44|Tn8_xjGO<Lh|M4VF|5nnZybwyo
zgf78lNaeFJM+e!BZJ)HggZl&(dx)mHL(@#Q|7`cpJf`4qg`Kqu1CR@ukhU5$xb>q}
zRjz{?r>dE+SulNj%E<7nB7vDSDk@_t=qgqJ*OsK6s8~I;7d1pWk%G@96ZNgyQxuDE
z+;WMV&g&xsx*8dTYjcEiN=l~t)6<?AiL};L3;sP9C5O@OXbgWJLWR2~tYCUP%+!@F
zTegR4iN0d7CR?Y#3r?B->GP~E<?%~a8A0K1n!fWkdzs0_xSo5T$Qw65H3G^`EaH*k
zqKFnG-k|6q7hg5Hpl#6<UmfC~Bv2OAwC43BPQ%->q!8J%qVCr(MT=rE1-gDo*xW@}
zNvVBb`&RedA~7log4wn%FbFTQ#i9x#)~LTeRZ+P5i+X{#@rMYV1sySJFST`PO%LkX
zGM}<J@6C|fSNimGOXZxX?N~ZrV(m@y99JUH`cgi+TYQ2Ee|d`;(}EkO%vpCPe)GoC
zV{VK7B&DlbO8W=SVUb}`_->q}n@NH_$1Q7}k^otd3Z6|sstrjVKW37@2xRNY>iS1U
zTWCyfo4P+1HFwz~=CLrh4WglFSspW)0_YH*B5LS!<1Lgu{vQ<2g+qd-Pf0Z88I+md
zGayYRr#%p0qIyzDg~C=t*5Ts>W~Xn&j%vC~$#kX_7u*^-_@eWzk)s6O=)XUGb5fxL
zk9yOA>N}E+&9$T;(R5u`?R^e}ifCj$3L`5-W#SDI!l!YefxDteqmoYFzH#uV^e{-T
z`lGOJDbGiFG!op{7_())XBN=WVMxdnmTEFq#?sJY`6`oSgY$(@BPDX0;o$=sg{@$Q
z4nJf#t~pduU_|6GG)iRiEDARv*T_#{8y^)}EDF4J-t{=oZlhN>50J9W?w;i1y|&P8
zn$*Q>f=LX{))>B@lI;lU^A|xWQ#W&9w3W?^5}&hW*qe3FFeuJ<)uJ{DfN#8dH~LjZ
z-J31hAv?5Ny01e}`FXU$d;yo%(MT^Hx@A*Erdh~_19TAy>$9vxe$<WVJfXJ?a{@Om
z5<d%=lcWPH^&nZ4pOx9lPw1JTg>`ePiy^|S!7-RA5Ep2s6=t&yiG;^ylkYnar|S{U
z{9J^ekHjij*}(Yr#jF%<(;|Dyn%`+3Dx9G>U`wB~cjnbViv&US_g<Sa<A<{$Sqf8$
znHyo<5mqaBzw1(PQ{E;K_vLDKs6keK!7m$Qd3;D>)QH2^OdPh$<Vd(57UACr2Ewb}
zU}D7sI~OIEF=AEiNP&tJGzMm<Q1-_#C`M#Pkh4alAmjFLw+GizGKteOU16tfd9(|`
z(0D$+Nj{VF#c%fabv)&piQ7UrXP0(dg&U6H9%u)ApT(A$S;bLHzD^{EqNV7aM{S$p
zPfnK%%BnkyehyF1@S$qZ7t~X!lk4{yEWI0Q&);%{Y@QdwV+xUJPO)70Z|Z&A3Q3iI
zn0f_DV)4ik%~L03KHvDl^s<P7ZINYYkVG!%6~l;uU4s|d^dqHEx&-DQLHxxq5lXCD
zS)$Ez^ZR2$%mXA)Q}lcmUd~h5Olbd(ab1Y}vFU{%t*k<<)zpE|<sIjA%C(?*V|f((
zyy5$9$%iHQI<{bbY4ubKkyj24JLL%p3ePjHjJNj3DA?yot2nF`seL(gXoK{%hGnW}
zzXw#^8O=W%Ajh7j+-POVN9l_(DoVpzFnEzzUhZK?4`^JB&pwJaLADwCNRIWihYm^Q
z+f*QnD%Jf~Cz#=WL}<NxT-D<KCo>v}+M^+^oia6Q3axQrw?l7=5dyUhI1nYzVd{P7
zpX~36xgiqo=Wo@%6;aMBWoxAljit26p?qgs=pcdg(_qM@q{%Xv!)P?zow`p$;&l4i
zbmd=8f-N%=FLU^aO`l4u!9{_{gYvn9kEUaRjvj_wKG$L>D*NC27Db4m>ph^~$=|^F
zU`?Fce7_G2r-bO_zyyY)XuG!3hZgD{SiZn+$6~cah7WJLEdM=(eZuAg`q3P(&Cff;
ze-rD*x?;x4rx1<Sz#SHNHdy8(=He%D^`d|3knfa5>#(#;Dy&PBvoi{mn;4h|aVXaV
zXZ>uvy04_4fpqi%llXN*>p%7On>s!!MabKz;K8BSp$T+Eyd-J$3wFJ{292rPKegD5
z+<yNEz(a<K$Ai_p27B?{c=?mC*F|4si#6@wuZ(J9(~gP2qi3a!)1}@K@T&~B$$wu{
zqr^vJeYyr$j97$HY;x!l>mH^1XbUxpZAGx-Ze7+TJQ*QVzORVM(5UQZ7Q#3uEvQM0
zw4BS|G}(G8m^H!8{m%Q5Y$yf06iYBJ2Oj+-gekZfTW0m2c?UL3Dd<)jbr_X}CtTfx
z-|M{FarTcxQN+&po+k;moBQ*3&rqzNLDf8T+~PlBXw-8XYVQolnlg8dE96~oLQxU)
z<gJ`1-CyjXp8Q{4va624m+fs{U9$FfMZS_7&mZy3w8ea@M@j=v$`n}C49j`<!lVQF
z7Y!ez?7;9F#W`C`LaLiGREd~gIUZGU;GOhT!yC-g`oQ<5<Db!xeQ`m27LQyfi3aUB
z3#HkPjrl`)CFr{LW`X>|xdKl5_S(!djt1i;<&@vNZz|$AI1)>Q#FNfmpiX%F5KZLA
zq^lBASR2Y5yMKch^W5~V%C7IaK0TNy@^C~I#@wd;_5+%3<9h0b{~^ra=ZEPy-_#WE
zm$8swf!=B{@R}w5AeJD4M2kg&{HBc!Y3rAX-%;niAS$viIbvARh+)-BSob?7yha%h
zUdb0daPjxhO%vAC8uoL%Y=^r%s<W(|EnO(;j{clK?cGpML{pw|a)>$l#B^srxgLM`
zP1?K3ng9ZGxVP|M*^H}yD3?x!8gr)BmKdr|ZHsar2k3%Fj$~ePas|f^5x*HbQ36J5
z&<STp#bSJLCPhWIh5;9P((io!8jM5xG{g5r)6>Ey3s?C%a2stZ#Y%~0>~^W5B}I?d
z*6wHJ1;J-}X(>}I=nb!|%)V#3@nO2VL6Q57c=YQU{#w14qR_gEgtY0wSGAgD2K`_&
z3jveGFFQn(2yz{V6|o41k`|{>h>(ieUwpWF6qP0srb>+b_8=X?M^9SM5p-bn)b-Q~
zQ&ky})}7=RV6z&>5WEOH$VVeJ!befC)@%P5wRJm99Tg`xqgeaWZ|2-E^KYBtX<b7_
z8!~Cn^9%#e{lnFuuO0Mv{FCN|=6QV-p;;;s8;a#Sl53~kVY^AI)Eg{C-H9^;Q9;la
zVk$zh$BA_Gn=z$i796em7ExlG4c1?~2e{Lu==h2eZyh{beO~GjqYdort3(3(Qie$d
zxB5(@Wq41;f@R_dN)^~h!QkIZMk8#gjCf+3o*cZi8+;EmO<^1>j6%jYtb0bLJ1V9f
z`R4{z&4wC%1Ig}vuh4XPLZ2A3nSXs53B^tSdBRadi_gH#P9{t7Z15tqJ1*)y#B<*T
zh5l~uVjK)(4lxYo{|uw$JE^;lg<Pzl%)cJZ2CG#|dy501gVFxd!72WI(+I2e1A>v-
z==`~2qZ|CY?2RSjVHsC{-Gc>+NleY-)DE6>-WuxJ=sbO#ncWYoLtzYj_1Yg<_y&&`
zb^5-+;M*K7$RC_Xeu;2Vgx2he<%K~l{164eOFk3-T9*RNuz7JjL9KD(X97!$5^#IG
zqOy`#X@Fy=>RBE~WBp_fYC_DHpsp;N%7TB$Qj2o0*5{D^_{7b7m6MfC2AGJjeKPd<
zl9}&JUl+sJ5Zp5B%7+BoAYvIUB^*`G1Spg^A7RG7=#Qv1u;CJ^G)M_TtKLshks*ZM
zp|HWozTQnn!6BD;rRimL`-}xG)3o(WMT)w2UZLU0VO-6Q`YdzsFU*=wlOE{mRJBj9
zq+j=&2F}{n6pa|fA8K#ism-{Q9i`85(_>_~7F71L>?gjRDyVz{(P1#rSt1@lF0x|W
zbdWRiNpXgxz#y~G53-6td-V+_Y9EDs^c)T<i2v$lD+M1j(IZn)Qnop9lIxI=g6|Ud
zh$)oj+Nf33{yLToHaLkeb)S68k;#d2qI)*2DK5-Npl0`WN`kRIn)eOCH&bg4`gDGh
z4K+GCBxW`<dAPzx6*?3%<sYAY7%Z1T`YO3JyAWyPJ6`?8$DraA;=-*1h#e#)h<HN_
zsVqB~J)!nY{`qdZ|9usX*%>cOO}#<G+gTt&>kSlFshzu!B4`8tExyic54gKNY!uy0
z(blMmeG7y;Ng39FAZ5oNg8QEYH3XekS)I-0<n<9S*~7pysD--qAGpeXaQJe*b@}(b
z<OBP6+_D!1<(mPE26<@1Bs<j;qwW=ht^V@v_*tr*ESI&UWmP@7I)pV2id6IVEk0v=
z=wEz)s!n_+T&0l?9RJ4^Jy&O#)Z3P_w*)`?L<-(sbq7K=R5&L%4>yuh7Q9xoaNX1G
z@jQOpAtlzFvp(UDzd(t-dAB&L_+?HDXqHCEL@wKTfllBGqlUdG)?AU}wo`fQh*VDf
zj{EcKhh)jC<Z8c7&W_uo)?*<09?MH#SU)b|dw+ZNe#NEVj`7J^;<DLD>LG`Gm1LRm
zV{pPng-PC0;uLmdX?<s3T6lA@l%k`$NP#cFq5G1FUpYu(S;=aeIZm&@a@vtrx?wRn
zPx1rrga%1E7drN<ujeMSD{P1Lf3o)pZ<`X+$89#%e@lz^qO0F&RI$kz>KQNm4f7oX
zGI}70{=e~<heClsxiMaJuXJ)@9iRw0jyrAwuBY=}=1KT3-+|6i@qU{3EAKmRR^PYp
zn|_*o{wMx;>B!HMG2s0D@eWxy*k<b4$r{gh&Re$TV*AME45``S&N6!LY4hml=+=xz
z57dX=4r6)wEQ~d}EDJ{69_net&gxm)2n;hcq^ixoO)_sL-%~pfrNhzc4=KINbW6;y
zpo6Q7?>uUFdP78no-bT3J4uK%wMEObLnU7GT1wXZ;d&nEf3w(1K}60bWO$o5k`SOs
z^ZS!D?IrJ$1;?gU&;81#HP>P8W$+n;Hm|=c&2H)<>!CSM-W`MR!6)=s!dufvmjrq|
zP(5tF`t>p4B+Ab=cYlqlrMNIKd#`Aj@>w+FpADr>L~<%prQIxy&87V-xN|nBr^9YY
z8_*JLFTNhDK}(IPpe%P%gYkrPGtYc_nKiU_(g-n5jTxU;Y%vioa1ihGzREak$2;J5
zSo!K=V`H<{=B;+s=6#CLjkN3uPXpcJV)Lg10|N+6-ph6%8wrFXn~bjzVA=CI<Ia=R
z>I3ZKBbu1YD>N3qlVtKmSg%jI^{`yWjwMM1@`&TcUhB(!Br)RphFc9^CVGzVFpivS
zR6VJGJqIzLdV3dc2YE75{v^p&HP-SmCGuNg&DQ4^h=&N>mQa6uw;E~+RYRs+xEsHp
z>9Vr%$y9auD`*=Sh5FplET9kH?*S$r2Cx&zU7+nh>!dqSjF|r!B~Sa=6mWZqiv{Zl
zYS#gvY}tbFbnwr883JJVbMRSp$-6UP>T3E&mKI!zd2MVod-G(wn!(5i<rAjc$@+rH
z@(tKUaY*&A&l@`2qu~Lj1*TDt{GXW(Y5OO&)V%$SJ3FY)+a7z4rWZv)Lpoqoqh!XF
z#^tHP{B{FwB}J+yfB2$o$=Y$SSRa`w6gHr26^tR#y7_RgfEgqB!O01zSlbU>{s;^d
zZzVy*BLql)BT*q2^hhfJA#}$07p_;EX$XMl)yXCXt)H{@6$n{Z2vJ?oVNUDy6DB6S
zvW93Tk4c>OYl+9PXS56>|E+d#pLXnONigdeLU|)vaiO+xm5{@|yRlcuwD?8+hW1Zz
zo?c<LK8pcuu(@THV?pjOqqr26D%`v+D=u!s`l0sSWtnuqJJg1msTL144mf+g+@b>W
zr$y*?Bg_aiMVp+L0j>-I6=-Tdbj-UNc}>RqZeI0a4=B`j<M3vCZ(VS22;dX%^$1Wt
z7XC9gc^!JU&kehdfE)QA=>K%Lv=utARGAOV3nSaZDqT7uGx|j11jurfXzH@Lar8g&
zl~Ni}QI%!!QL!dJma`?IZiV#{!u6($BXqb*$M$fN%tauXTC+^3qxf7Uu5}LGF$pfi
z@gZoeB9S{=0Fi%tGTh#s1rRd`-FbxOc<j&$05u5Co45h#Qh@ZfuO4@QjX1#f-4M)s
z$DNJJeVJg*QksGFeOcc{cRELzS;5pZcZmq^ZIZ{R@80{eNfLE*$Z&7@<6%**=(NEU
z4L$6xCl}nC_w}`6CCfNC!Lf37Jo2M;<AW;!`MJ_#al90l5a!h<Eo0r41OZ<AA+&2{
z)#5c&&c9=Yg%<Y#GMZUr6X2-qIGonnC?Mz|-(KQ=@jP4ts=;lW+)i(Xwnwv?fTV3n
zuFnwpeUIdA4+3WnG|;VB(J4tn-w5#W09-U*`^jllzWwHYL!^(Fk9HhId%%8lMNZ(V
zU(6(#b@`sKknZck0~el_hLt7aqdd4HdX~~m6DBNeL+IDV-_MYsF0n_RzJJOa1dlO$
zKkTn*e`jksFQE<YGWZQ*Yyjxb-&4VV@u!RU(J4SJ0rlbPixL1dhCr5ImeS(!dJn2V
zENpCwqP_vV2?>PSeL~7eS~i-TH{fRZM*w)W9(;#d2ZJrLm(*w&9?nI#8|j7SZ=pSz
zh>ZMVo&^a(=_<DyQBtn4UUew<7sI5T+DZaxr43mo$hO=+3YYxYg@{o@%v+(L9j~#5
zSHWs?WHT;o_RhxAa(Ka&1c5cjvKCI(*Jrz{ejNZWG?M+?ZL!X_B-`}^Zzp&?6szYQ
zCF8uO26xiMeJ`dyt2~^kKg^^7A?j7|zW>VFO?&$j1MoF;aW}2hg@{jYr5$|t^W^OY
zKC9pLfn%wk?|hc}b3i=o%W{o&foqZAnnbC8M2_T)V8$z93a4!y`?vGPyS|))(Iqwf
zgGoHK*ij4QJFCfi@*c0WoYAL*Yzv#;qW;O1uCa-UF{YK^HgL{n{OrD0R>EWQ)%kpH
z*68b->Hjcx+#LsY@-X<^Uu~z!M$>#pL|Ft7_O;|q#z(}P9IPn^1}idNvljr23>?8_
zp2w=1;iCag3~!Nsz&9!pd%Ss8lI2Kcb0oQ0!KKNZnI|Jf3rz+_%axLg_18wek;@{>
zhXq1jOE23xWPUJS-{|OAwFgn@z5Z5NGE%IO81o{V!`e^^4?-9opS#pN)g{skRH(sL
zqtp9z3n)!H9=TU$mO>ze=t{CuIxEebdKF*qE|&AWw=y<|(`W(E<ug75z{^-2tu(K0
zwX0M(0tg@i3Io)EB~B9K+raK4@N81S>FatpK+oI*aHX}<2qXxBm>FP<Z`*^HkBRPA
z&}8q;B;SwonCwLNoi;V><3iKrQGVlHmElZr^87}*cUtfm6C@j}s-Fma(%Woz0aXw1
z@TYb}UcO*yoY!$GRcULB=C#X@0-abvv+PQ@(RncQN9bAgCRMT+nanWJt2)x^ca94k
z&bYK<pQkM?On#GAd-Vd&jvBkkLMQ)y<8uA#+^2v+yq`93_jB4<#<SNYH!C1e0|-?W
z0-^_Gk(;VI@2`LSi~V5$kf9}#cW?4)yv}F!)w6^S$L|luJ^SSj#6uZyV-y~f^EXO)
zbl5za6naartO29hgBu+OVf)pdFSEb*{nKcY*KEL-kfg<$(VnhEu+Jh#_VM9CDQ<99
z3PO2*8!!5d0M(P#>;!}0Xms7|AFb0KSvW{%NJ?$7VT(sEt{TQ(^t<n@xEcsE9fS@-
zX)vb~Q`=$BNS9|_1X9FCw)e?jTlV;QJgDisH7qFB8fj@2R}T4p=Y>-vm;dq1E2>C=
zjsZ1Vi#h1l>02;N36aTq$(s3gM0WekK9y5%kw$?p`P{HJV|U2Zi^dUiMg_=j8(FiQ
zrs6agf5@UTU7+N1`+UkqrQ(vdHT#HaD_^MA^C;X<%%j_fe$YVMp(xbg<ICZPjyvX5
z6c|<rc)W<5nQy>#L+8?~RL$%_$0&IByRhOG_I`<ND_RdreL){r$Lr%_V}Y54;hdRy
z6QKwDw)hu$9726>q>!Oqu=y~xxbJ`d=67`!Ax`mc8LDrhGjW>wZQ3UbxbULS3NqIl
zY3vwBY-A^Eog0P5i)F<3SwhUxg+@JcKV3SFwq94C?S4`%BM!^1IUY32vNSu-ZR~+s
zxFRw&rvh~}y<IXobx-1HT2G^!3OBp5@<E1@mAJ@U$rihTYR;R?If{uaXuaG0^Mxnm
z0@#9u9y^~@b<u+Js&S&3htyHg(ED(I15paFajVjd?yj1xoeNB|G0S`F2Qyr#EeooW
zcCw;v*1Wc1@O;fo+TtS6@k+%PPms7P-;6r{D53P6#YmO#%TtjRdUX*=7p-jvI=)>(
z&SBI(v6Gfgi!A!6l6XoMlx^fQZ=(B(xm~n5(z+b_1T-tkEY=oD<}ob-Q@5j{<$}D<
z>Uaod%KogGt8aVbSI;TA_T}BwdXrAmZWc*zEi)Rf$CwaAT@Gu*BM*+_bA{{6@lSBP
zjqso<Y)<=E-=qv>toq<R^9~=$V=RhUtg=fD>;8xSa}SR%W4Q2L=GL`WCS7e?;@)Zt
z(kMtWV1eGS$rEJLn}1uBT;54?#K`d!J1#=k%aU_1No2<9sP+~_b@ks7!CBsmjcsbo
z*XwysRlQ-oQNq9=z;^^SzM$P_2kYg4aX@{(Frft=Cu&rwX1=gSN7=7ckwc?9pYkYm
z&W)@b+cb5NQxqvE{2c8Xzt(!~`=LIeW_q5FQ;h{3A0=pxxWPS{&ZAuAH>|;ff9k+C
zMX|0zxAXTEPu>&w;Tas!LZyj6dl_|9@40}vNH0Lwc`n<}r1HGlU)_u<d;)4=j3^eU
z4D2`Ub2<2VaFDp9ux#u^aBx`dtsuQF@HqzU_hT6m;^$=)Rtr&v=awQrk;5|ahu3Q=
zdBwLqSi$e{ia$Oo3u(8)<8-!#kE*g45cpy8zI_ba9BXDzpXt1*g8R?#{*G%D;a<zl
zW&4uYoZDFXpZT6_LQzpYea-3fodn1*f3&RrH3g7)E%YbM2XfH3Ua?Vlp{<Hgu1iY{
z30B9<^{~w-PblG0&&}*K>v7`R)M|WzQsqKl8&1MQL-%U-)aaWpz6HX%#^_Z)!Tbrl
z+eL6FK2a$yOFNAoR91V4W(1~QRz*!CrCsTdZQm>DlKQ!B)KIpyw5+Xs=cr(*4m1Y_
zt(itxBYA*IVt2<%K(~Z86Pl)1jbsx<pY{cJdtcyU9KFZq>ttCu`HarvIn`bJ%z8d2
z5kaTO*xx8HQ)z@#@HEooVF^0T(m!+f%rxg&`JQl3=JRr~^!ssXyjdxIDe@QgZ6Q5x
z*#!mrt*nt9=K^FP1LJ-czVlBo52*4hZyY<Pp2)L-quLK`>&ZEFRnMoQILZ@j*(s82
zT8l9n<hME`$_<?v@zue30-R(bPRUw%7P?G*?eHOv5EU|Tl|g`tgO1!vuDIHe3CxPI
zYpefdh=B6mj+nLPv{~IS$$t4j;Tz7-ze1Lo-ri=1{R*ogAx>NfoztzxI1>uk@M_=p
zEVVyhnZq!f<i?eIywH>=>^D`nBd@9HQ8w>a6^d4v7PZELrI!&NhgKV}5Rv*&XZrrj
z1)8U6MuX}ImE<F^(hfAi2}jMb^$ZjC!(z0YYgVJMO8X=Cc{Inq$BwI-^qnkM-P<aJ
z?%83+tq&xpyf2U2;ZVAoWuoHAE?H=%cbMP7jra{8g}iWT4d;PYyPsV$yGSXDaxH!~
zY;5f;WNd|!gw4(JzBli}M4FCI>glH1_`&FUql8F3B7IM%Q+&o-9p@V`kGbkm>+6|a
zs$W;NC$OyMzU(<TF8p}aP%$CzPVs#otSeN3(2}l3Eb*0D2g<9d;5clq+!xO>3Tdu&
z-@vyfN|5h5R2Hg=^-h>adPD{~G4F9y--0ND+)D8#d_Jtb^Kc1u>GZ})q|R{R^Q50f
zGU(^YpB@S};)4X;9`yTc(_*R$#b7YRSY&j4@4;_d)=kV_Rve-ABy0Yt3vCY}#PEnf
z*>5x>5|i}pyVxefRArf%t1T(e2!%z33;eE@7gwNUT*_}%eD4PTi_g)tc|D<DBXL@f
zBcG#1$JhMS>(0&B?d!UFi3d&yCJG55H+f@*A0IY3{!MmZ*aM{|=CVpMEyUuFIbDq@
zV%WaeZ~Dw<?>i^`V008mWtGvf*aw9qnA%!D^KQOJ=f0!kGkp3a()l2^9@h0l>Lz@C
z)x5@VJxtU^fZ5)x+{5#GLnZ`rwfM6WaU|~-3hT<1$qX<osc02T%6$_oN0lM+Vek>g
z)#9nAOD?R-rtham*2R`{PoQ}If2L)?+2rf!A;hsWvXW+TKAAT$?=E`vX)BZt<RqZ$
zyJ$CW`DLu9g2~QrX;ff8v{pwW7!(2lQ4ZD~62Mbbd6bXEP<dfGG;aEZ^%W^5s)Zln
z`hqVzxQ)HEL@qMzpq_Z@Mt*!4g@&9={G}l)ytRqw10NrI0>0Ts-0fPMu4RDGKVHIx
zaz!_x<I(k#@rz?JbZ~-<LrpH^J0}z1xxSXCPDdC-*A2DcWu$2<HM`<EGpFP0191WM
zLTKt+8tMZY@^6gYKa~JJc9ZbX&dSdc$w!C@isIpap`o9+D8Q(YVO<+g;8x%=iy%Y%
ze{V;uFYMRW=1C#0B3nm-ZvcP&*O_2Y3oV2-!Ij5ixGpyy7ktuSvi@`VzYk9as0GCB
z^cloJ!1Igb!PyDo6C+R}F3=eS&UIkA<$5__XWCEgHiCpf?F<S>fVORMf4=(1->v7{
zzvIO4Yi-Mno!UJ>odbi$eIo0}?Uqx(X;$m|iCXCc2_o<m61;M~%1i(UPhr<aP_}_m
zTWtJ`lL0m1RRNE^8QbBH?V#wflK7;m{bC6XhYS+59SIW8s}${*&q4VRfr6%e_}3qJ
zDjetriafbqzoJ_C**dJ|dCuj6=PpJ8x(Q*F#|ZMho8!*F-Ko!j#fg*Iey-yAdMHVp
z_{9R?IB;mX0=V(cc7Wpd0?Am5`>xhF5u!GLprpGwY)b11!y#Yum^Vd0tl!&C0K-H7
zV;$(gb6Sv%fuf#*b^!SPC!ogJv+mqF`r~ih`;lDn8$haXO8qz5{1zGVk;|}<`4W(x
ze8Zq^Ge)N|2ABiHjIjORi$TkF_YKwlhgGdd*GKO=%e$*A0EL=yql3~QgUXY@+rKjS
z&uyA;MH?e6G7xj6VbJQy4FUOCJv*<?m&2V@R$vcA&F=1O`p0?Id%+Sym!TAP_Rs6i
zh>Ym7N?I=9#0dNs5%_gKB<?xF>!B9Xut<o-|0<c3hM2eDA=rfc_GZfT&Ac~-uK$Cv
zNAT~_9DDV*c<l4E{pmKPc7Fl3cL+~|Kms2w0|SB8%zY0V-u^l0ZT)d~1YqgEhd8TW
zfC3$Y1|i<9p^5Roo&~8eZM~?dAM+XaU2_{^FL7wyDmOcaBT9_h*=}QZmp}5fT6PMf
zFUD{$ssB4f^WIqDwMapEd3og*!#KQc6FR`bo<VTYL)NOuxD0AM_UCv5uZCBdt|$N0
zrL`XvM)R~BHZDUfw$W)=|NE`}q^x;<Cm$#QBaKCry7%>NN!AeH_JRbhty~ztYu-e-
zDtYI>UcjexjxWH^f704{)0!z&DsnQwDEw{(6J+Xz=rof5^I_8^>UqYDpAke$AeZ4W
zZmcNt1NpC7o<zIS2ez+QTUkgy8ELN~$<u&WJ%Z5vLijm?KuGdxP`v|G`ULT40o}%@
zcnL~~r`5z?u#NxEgetP<0HzWgavqa*p9ZpbOJ8>DhIxDe`$YA}@zZh1&W#t4uFW*_
zj=~T?K_&*N0i+2aZ6zW?_~{R?-?8t1_%~fNgZc(wg}a-iy_<|95S1WOsXzlOTDIqZ
zOFjSJ>E<VolRrHKv>r2>Lqwpg(s?S@c{(9OfZ&=t-5ND+cHIQ);}R6jE-)njNew10
zBue$O_c`lkfqw+^fc^#WK^!tJk=s8#m&;C_<~I%IHxm&OXA9QxSJ?j<xZ@dO_~D?E
zTyAdaI>@X5s2pd?wBseNcfcI~K@e+bhQz6ZJ?wwu5dijqHON;+1VTBuq7?goM7aNJ
lDEptG@;~nM|L-Gi1Ix83ewt%y%Rs=7lH5z#Drt-0{{gy1X<h&T

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-iterative/common.txt b/demo/documented/stokes-iterative/common.txt
new file mode 100644
index 0000000..521ee7f
--- /dev/null
+++ b/demo/documented/stokes-iterative/common.txt
@@ -0,0 +1,85 @@
+
+This demo illustrates how to:
+
+* Maintain symmetry when assembling a system of symmetric equations
+  with essential (Dirichlet) boundary conditions
+* Use a iterative solver explicitly for solving a linear system of equations
+* Define a preconditioner explicitly using a form
+
+
+Strong form of the Stokes equations
+-----------------------------------
+
+The incompressible Stokes equations in strong form read: for a domain
+:math:`\Omega \subset \mathbb{R}^n`, find the velocity :math:`u` and
+the pressure :math:`p` satisfying
+
+.. math::
+   - \nabla \cdot (\nabla u + p I) &= f \quad {\rm in} \ \Omega, \\
+                    \nabla \cdot u &= 0 \quad {\rm in} \ \Omega. \\
+
+
+.. note::
+
+   The sign of the pressure has been flipped from the classical
+   definition. This is done in order to have a symmetric (but not
+   positive-definite) system of equations rather than a non-symmetric
+   (but positive-definite) system of equations.
+
+A typical set of boundary conditions on the boundary :math:`\partial
+\Omega = \Gamma_{D} \cup \Gamma_{N}` can be:
+
+.. math::
+                           u &= u_0 \quad {\rm on} \ \Gamma_{D}, \\
+      \nabla u \cdot n + p n &= g   \quad {\rm on} \ \Gamma_{N}. \\
+
+
+Weak form of the Stokes equations
+---------------------------------
+
+The Stokes equations can easily formulated in a mixed variational
+form; that is, a form where the two variables, the velocity and the
+pressure, are approximated simultaneously. Using the abstract
+framework, we have the problem: find :math:`(u, p) \in W` such that
+
+.. math::
+   a((u, p), (v, q)) = L((v, q))
+
+for all :math:`(v, q) \in W` where
+
+.. math::
+   a((u, p), (v, q))
+   &= \int_{\Omega} \nabla u \cdot \nabla v
+                    + \nabla \cdot v \ p
+                    + \nabla \cdot u \ q \, {\rm d} x, \\
+   L((v, q))
+   &= \int_{\Omega} f \cdot v \, {\rm d} x
+      + \int_{\partial \Omega_N} g \cdot v \, {\rm d} s. \\
+
+The space `W` should be a mixed (product) function space: :math:`W = V
+\times Q` such that :math:`u \in V` and :math:`q \in Q`.
+
+Preconditioning of the linear system of equations
+--------------------------------------------------
+
+For the resulting linear system of equations, the following form
+defines a suitable preconditioner:
+
+.. math::
+
+   b((u, p), (v, q)) = \int_{\Omega} \nabla u \cdot \nabla v + p \, q \, {\rm d} x
+
+
+Domain and boundary conditions
+------------------------------
+
+In this demo, we shall consider the following definitions of the input
+functions, the domain, and the boundaries:
+
+* :math:`\Omega = [0,1]^3`  (a unit cube)
+* :math:`\Omega_D = \{(x_0, x_1, x_2) \, | \, x_0 = 0 \, \text{or} \,
+  x_0 = 1 \, \text{or} \, x_1 = 0 \, \text{or} \, x_1 = 1 \}`
+* :math:`u_0 = (- \sin(\pi x_1), 0.0, 0.0)` for :math:`x_0 = 1` and
+  :math:`u_0 = (0.0, 0.0, 0.0)` otherwise
+* :math:`f = (0.0, 0.0, 0.0)`
+* :math:`g = (0.0, 0.0, 0.0)`
diff --git a/demo/documented/stokes-iterative/cpp/CMakeLists.txt b/demo/documented/stokes-iterative/cpp/CMakeLists.txt
new file mode 100644
index 0000000..f7d46e5
--- /dev/null
+++ b/demo/documented/stokes-iterative/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_stokes-iterative)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/stokes-iterative/cpp/Stokes.h b/demo/documented/stokes-iterative/cpp/Stokes.h
new file mode 100644
index 0000000..9412f92
--- /dev/null
+++ b/demo/documented/stokes-iterative/cpp/Stokes.h
@@ -0,0 +1,25833 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __STOKES_H
+#define __STOKES_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 30;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 26:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 27:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 28:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 29:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 30; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 26:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 27:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 28:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 29:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 30; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[27];
+    for (unsigned int r = 0; r < 27; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 30; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 13:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 20:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 21:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 22:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 23:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 24:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 25:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 26:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 27:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 28:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 29:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[12] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[13] = vals[1];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[14] = vals[1];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[15] = vals[1];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[16] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[17] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[18] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[19] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[20] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[21] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[22] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[23] = vals[2];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[24] = vals[2];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[25] = vals[2];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[26] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[27] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[28] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[29] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[10];
+    vertex_values[4] = dof_values[11];
+    vertex_values[7] = dof_values[12];
+    vertex_values[10] = dof_values[13];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[20];
+    vertex_values[5] = dof_values[21];
+    vertex_values[8] = dof_values[22];
+    vertex_values[11] = dof_values[23];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new stokes_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, 3, None), FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None), **{'value_shape': (4,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 34;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 4;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    values[3] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 26:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 27:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 28:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 29:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 30:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 31:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 32:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 33:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[4] = {0.0, 0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 34; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 4; s++)
+      {
+        values[r*4 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 4*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 26:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 27:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 28:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 29:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 30:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[3*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 31:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[3*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 32:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[3*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 33:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[3*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 34; r++)
+    {
+      for (unsigned int s = 0; s < 4*num_derivatives; s++)
+      {
+        values[r*4*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[36];
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 34; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 4*num_derivatives; s++)
+      {
+        values[r*4*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[4];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 13:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 20:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 21:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 22:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 23:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 24:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 25:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 26:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 27:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 28:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 29:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 30:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    case 31:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    case 32:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    case 33:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[4];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[12] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[13] = vals[1];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[14] = vals[1];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[15] = vals[1];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[16] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[17] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[18] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[19] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[20] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[21] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[22] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[23] = vals[2];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[24] = vals[2];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[25] = vals[2];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[26] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[27] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[28] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[29] = vals[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[30] = vals[3];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[31] = vals[3];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[32] = vals[3];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[33] = vals[3];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[4] = dof_values[1];
+    vertex_values[8] = dof_values[2];
+    vertex_values[12] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[10];
+    vertex_values[5] = dof_values[11];
+    vertex_values[9] = dof_values[12];
+    vertex_values[13] = dof_values[13];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[20];
+    vertex_values[6] = dof_values[21];
+    vertex_values[10] = dof_values[22];
+    vertex_values[14] = dof_values[23];
+    // Evaluate function and change variables
+    vertex_values[3] = dof_values[30];
+    vertex_values[7] = dof_values[31];
+    vertex_values[11] = dof_values[32];
+    vertex_values[15] = dof_values[33];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0] + 3*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 30;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 18;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 3;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[10] = offset + c.entity_indices[0][0];
+    dofs[11] = offset + c.entity_indices[0][1];
+    dofs[12] = offset + c.entity_indices[0][2];
+    dofs[13] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[14] = offset + c.entity_indices[1][0];
+    dofs[15] = offset + c.entity_indices[1][1];
+    dofs[16] = offset + c.entity_indices[1][2];
+    dofs[17] = offset + c.entity_indices[1][3];
+    dofs[18] = offset + c.entity_indices[1][4];
+    dofs[19] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[20] = offset + c.entity_indices[0][0];
+    dofs[21] = offset + c.entity_indices[0][1];
+    dofs[22] = offset + c.entity_indices[0][2];
+    dofs[23] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[24] = offset + c.entity_indices[1][0];
+    dofs[25] = offset + c.entity_indices[1][1];
+    dofs[26] = offset + c.entity_indices[1][2];
+    dofs[27] = offset + c.entity_indices[1][3];
+    dofs[28] = offset + c.entity_indices[1][4];
+    dofs[29] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 11;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 14;
+      dofs[10] = 15;
+      dofs[11] = 16;
+      dofs[12] = 21;
+      dofs[13] = 22;
+      dofs[14] = 23;
+      dofs[15] = 24;
+      dofs[16] = 25;
+      dofs[17] = 26;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+      dofs[6] = 10;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 14;
+      dofs[10] = 17;
+      dofs[11] = 18;
+      dofs[12] = 20;
+      dofs[13] = 22;
+      dofs[14] = 23;
+      dofs[15] = 24;
+      dofs[16] = 27;
+      dofs[17] = 28;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+      dofs[6] = 10;
+      dofs[7] = 11;
+      dofs[8] = 13;
+      dofs[9] = 15;
+      dofs[10] = 17;
+      dofs[11] = 19;
+      dofs[12] = 20;
+      dofs[13] = 21;
+      dofs[14] = 23;
+      dofs[15] = 25;
+      dofs[16] = 27;
+      dofs[17] = 29;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+      dofs[6] = 10;
+      dofs[7] = 11;
+      dofs[8] = 12;
+      dofs[9] = 16;
+      dofs[10] = 18;
+      dofs[11] = 19;
+      dofs[12] = 20;
+      dofs[13] = 21;
+      dofs[14] = 22;
+      dofs[15] = 26;
+      dofs[16] = 28;
+      dofs[17] = 29;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 10;
+        dofs[2] = 20;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 11;
+        dofs[2] = 21;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 12;
+        dofs[2] = 22;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 13;
+        dofs[2] = 23;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+        dofs[1] = 14;
+        dofs[2] = 24;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 15;
+        dofs[2] = 25;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+        dofs[1] = 16;
+        dofs[2] = 26;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+        dofs[1] = 17;
+        dofs[2] = 27;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+        dofs[1] = 18;
+        dofs[2] = 28;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+        dofs[1] = 19;
+        dofs[2] = 29;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[0];
+    dof_coordinates[10][1] = vertex_coordinates[1];
+    dof_coordinates[10][2] = vertex_coordinates[2];
+    dof_coordinates[11][0] = vertex_coordinates[3];
+    dof_coordinates[11][1] = vertex_coordinates[4];
+    dof_coordinates[11][2] = vertex_coordinates[5];
+    dof_coordinates[12][0] = vertex_coordinates[6];
+    dof_coordinates[12][1] = vertex_coordinates[7];
+    dof_coordinates[12][2] = vertex_coordinates[8];
+    dof_coordinates[13][0] = vertex_coordinates[9];
+    dof_coordinates[13][1] = vertex_coordinates[10];
+    dof_coordinates[13][2] = vertex_coordinates[11];
+    dof_coordinates[14][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[14][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[14][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[15][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[15][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[15][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[16][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[16][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[16][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[17][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[17][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[17][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[18][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[18][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[18][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[19][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[19][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[19][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[20][0] = vertex_coordinates[0];
+    dof_coordinates[20][1] = vertex_coordinates[1];
+    dof_coordinates[20][2] = vertex_coordinates[2];
+    dof_coordinates[21][0] = vertex_coordinates[3];
+    dof_coordinates[21][1] = vertex_coordinates[4];
+    dof_coordinates[21][2] = vertex_coordinates[5];
+    dof_coordinates[22][0] = vertex_coordinates[6];
+    dof_coordinates[22][1] = vertex_coordinates[7];
+    dof_coordinates[22][2] = vertex_coordinates[8];
+    dof_coordinates[23][0] = vertex_coordinates[9];
+    dof_coordinates[23][1] = vertex_coordinates[10];
+    dof_coordinates[23][2] = vertex_coordinates[11];
+    dof_coordinates[24][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[24][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[24][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[25][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[25][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[25][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[26][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[26][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[26][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[27][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[27][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[27][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[28][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[28][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[28][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[29][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[29][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[29][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new stokes_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, 3, None), FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None), **{'value_shape': (4,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 4*num_global_entities[0] + 3*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 34;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 21;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 4;
+        break;
+      }
+    case 1:
+      {
+        return 3;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[10] = offset + c.entity_indices[0][0];
+    dofs[11] = offset + c.entity_indices[0][1];
+    dofs[12] = offset + c.entity_indices[0][2];
+    dofs[13] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[14] = offset + c.entity_indices[1][0];
+    dofs[15] = offset + c.entity_indices[1][1];
+    dofs[16] = offset + c.entity_indices[1][2];
+    dofs[17] = offset + c.entity_indices[1][3];
+    dofs[18] = offset + c.entity_indices[1][4];
+    dofs[19] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[20] = offset + c.entity_indices[0][0];
+    dofs[21] = offset + c.entity_indices[0][1];
+    dofs[22] = offset + c.entity_indices[0][2];
+    dofs[23] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[24] = offset + c.entity_indices[1][0];
+    dofs[25] = offset + c.entity_indices[1][1];
+    dofs[26] = offset + c.entity_indices[1][2];
+    dofs[27] = offset + c.entity_indices[1][3];
+    dofs[28] = offset + c.entity_indices[1][4];
+    dofs[29] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[30] = offset + c.entity_indices[0][0];
+    dofs[31] = offset + c.entity_indices[0][1];
+    dofs[32] = offset + c.entity_indices[0][2];
+    dofs[33] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 11;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 14;
+      dofs[10] = 15;
+      dofs[11] = 16;
+      dofs[12] = 21;
+      dofs[13] = 22;
+      dofs[14] = 23;
+      dofs[15] = 24;
+      dofs[16] = 25;
+      dofs[17] = 26;
+      dofs[18] = 31;
+      dofs[19] = 32;
+      dofs[20] = 33;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+      dofs[6] = 10;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 14;
+      dofs[10] = 17;
+      dofs[11] = 18;
+      dofs[12] = 20;
+      dofs[13] = 22;
+      dofs[14] = 23;
+      dofs[15] = 24;
+      dofs[16] = 27;
+      dofs[17] = 28;
+      dofs[18] = 30;
+      dofs[19] = 32;
+      dofs[20] = 33;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+      dofs[6] = 10;
+      dofs[7] = 11;
+      dofs[8] = 13;
+      dofs[9] = 15;
+      dofs[10] = 17;
+      dofs[11] = 19;
+      dofs[12] = 20;
+      dofs[13] = 21;
+      dofs[14] = 23;
+      dofs[15] = 25;
+      dofs[16] = 27;
+      dofs[17] = 29;
+      dofs[18] = 30;
+      dofs[19] = 31;
+      dofs[20] = 33;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+      dofs[6] = 10;
+      dofs[7] = 11;
+      dofs[8] = 12;
+      dofs[9] = 16;
+      dofs[10] = 18;
+      dofs[11] = 19;
+      dofs[12] = 20;
+      dofs[13] = 21;
+      dofs[14] = 22;
+      dofs[15] = 26;
+      dofs[16] = 28;
+      dofs[17] = 29;
+      dofs[18] = 30;
+      dofs[19] = 31;
+      dofs[20] = 32;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 10;
+        dofs[2] = 20;
+        dofs[3] = 30;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 11;
+        dofs[2] = 21;
+        dofs[3] = 31;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 12;
+        dofs[2] = 22;
+        dofs[3] = 32;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 13;
+        dofs[2] = 23;
+        dofs[3] = 33;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+        dofs[1] = 14;
+        dofs[2] = 24;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 15;
+        dofs[2] = 25;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+        dofs[1] = 16;
+        dofs[2] = 26;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+        dofs[1] = 17;
+        dofs[2] = 27;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+        dofs[1] = 18;
+        dofs[2] = 28;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+        dofs[1] = 19;
+        dofs[2] = 29;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[0];
+    dof_coordinates[10][1] = vertex_coordinates[1];
+    dof_coordinates[10][2] = vertex_coordinates[2];
+    dof_coordinates[11][0] = vertex_coordinates[3];
+    dof_coordinates[11][1] = vertex_coordinates[4];
+    dof_coordinates[11][2] = vertex_coordinates[5];
+    dof_coordinates[12][0] = vertex_coordinates[6];
+    dof_coordinates[12][1] = vertex_coordinates[7];
+    dof_coordinates[12][2] = vertex_coordinates[8];
+    dof_coordinates[13][0] = vertex_coordinates[9];
+    dof_coordinates[13][1] = vertex_coordinates[10];
+    dof_coordinates[13][2] = vertex_coordinates[11];
+    dof_coordinates[14][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[14][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[14][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[15][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[15][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[15][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[16][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[16][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[16][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[17][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[17][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[17][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[18][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[18][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[18][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[19][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[19][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[19][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[20][0] = vertex_coordinates[0];
+    dof_coordinates[20][1] = vertex_coordinates[1];
+    dof_coordinates[20][2] = vertex_coordinates[2];
+    dof_coordinates[21][0] = vertex_coordinates[3];
+    dof_coordinates[21][1] = vertex_coordinates[4];
+    dof_coordinates[21][2] = vertex_coordinates[5];
+    dof_coordinates[22][0] = vertex_coordinates[6];
+    dof_coordinates[22][1] = vertex_coordinates[7];
+    dof_coordinates[22][2] = vertex_coordinates[8];
+    dof_coordinates[23][0] = vertex_coordinates[9];
+    dof_coordinates[23][1] = vertex_coordinates[10];
+    dof_coordinates[23][2] = vertex_coordinates[11];
+    dof_coordinates[24][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[24][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[24][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[25][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[25][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[25][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[26][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[26][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[26][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[27][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[27][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[27][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[28][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[28][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[28][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[29][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[29][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[29][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[30][0] = vertex_coordinates[0];
+    dof_coordinates[30][1] = vertex_coordinates[1];
+    dof_coordinates[30][2] = vertex_coordinates[2];
+    dof_coordinates[31][0] = vertex_coordinates[3];
+    dof_coordinates[31][1] = vertex_coordinates[4];
+    dof_coordinates[31][2] = vertex_coordinates[5];
+    dof_coordinates[32][0] = vertex_coordinates[6];
+    dof_coordinates[32][1] = vertex_coordinates[7];
+    dof_coordinates[32][2] = vertex_coordinates[8];
+    dof_coordinates[33][0] = vertex_coordinates[9];
+    dof_coordinates[33][1] = vertex_coordinates[10];
+    dof_coordinates[33][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stokes_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stokes_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    139
+    // Number of operations (multiply-add pairs) for tensor contraction: 3627
+    // Total number of operations (multiply-add pairs):                  3769
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*K[2]*(1.0);
+    const double G0_1 = det*K[5]*(1.0);
+    const double G0_2 = det*K[8]*(1.0);
+    const double G1_0 = det*K[0]*(1.0);
+    const double G1_1 = det*K[3]*(1.0);
+    const double G1_2 = det*K[6]*(1.0);
+    const double G2_0 = det*K[1]*(1.0);
+    const double G2_1 = det*K[4]*(1.0);
+    const double G2_2 = det*K[7]*(1.0);
+    const double G3_0 = det*K[2]*(1.0);
+    const double G3_1 = det*K[5]*(1.0);
+    const double G3_2 = det*K[8]*(1.0);
+    const double G4_0 = det*K[0]*(1.0);
+    const double G4_1 = det*K[3]*(1.0);
+    const double G4_2 = det*K[6]*(1.0);
+    const double G5_0 = det*K[1]*(1.0);
+    const double G5_1 = det*K[4]*(1.0);
+    const double G5_2 = det*K[7]*(1.0);
+    const double G6_0_0 = det*K[2]*K[2]*(1.0);
+    const double G6_0_1 = det*K[2]*K[5]*(1.0);
+    const double G6_0_2 = det*K[2]*K[8]*(1.0);
+    const double G6_1_0 = det*K[5]*K[2]*(1.0);
+    const double G6_1_1 = det*K[5]*K[5]*(1.0);
+    const double G6_1_2 = det*K[5]*K[8]*(1.0);
+    const double G6_2_0 = det*K[8]*K[2]*(1.0);
+    const double G6_2_1 = det*K[8]*K[5]*(1.0);
+    const double G6_2_2 = det*K[8]*K[8]*(1.0);
+    const double G7_0_0 = det*K[2]*K[2]*(1.0);
+    const double G7_0_1 = det*K[2]*K[5]*(1.0);
+    const double G7_0_2 = det*K[2]*K[8]*(1.0);
+    const double G7_1_0 = det*K[5]*K[2]*(1.0);
+    const double G7_1_1 = det*K[5]*K[5]*(1.0);
+    const double G7_1_2 = det*K[5]*K[8]*(1.0);
+    const double G7_2_0 = det*K[8]*K[2]*(1.0);
+    const double G7_2_1 = det*K[8]*K[5]*(1.0);
+    const double G7_2_2 = det*K[8]*K[8]*(1.0);
+    const double G8_0_0 = det*K[2]*K[2]*(1.0);
+    const double G8_0_1 = det*K[2]*K[5]*(1.0);
+    const double G8_0_2 = det*K[2]*K[8]*(1.0);
+    const double G8_1_0 = det*K[5]*K[2]*(1.0);
+    const double G8_1_1 = det*K[5]*K[5]*(1.0);
+    const double G8_1_2 = det*K[5]*K[8]*(1.0);
+    const double G8_2_0 = det*K[8]*K[2]*(1.0);
+    const double G8_2_1 = det*K[8]*K[5]*(1.0);
+    const double G8_2_2 = det*K[8]*K[8]*(1.0);
+    const double G9_0_0 = det*K[0]*K[0]*(1.0);
+    const double G9_0_1 = det*K[0]*K[3]*(1.0);
+    const double G9_0_2 = det*K[0]*K[6]*(1.0);
+    const double G9_1_0 = det*K[3]*K[0]*(1.0);
+    const double G9_1_1 = det*K[3]*K[3]*(1.0);
+    const double G9_1_2 = det*K[3]*K[6]*(1.0);
+    const double G9_2_0 = det*K[6]*K[0]*(1.0);
+    const double G9_2_1 = det*K[6]*K[3]*(1.0);
+    const double G9_2_2 = det*K[6]*K[6]*(1.0);
+    const double G10_0_0 = det*K[0]*K[0]*(1.0);
+    const double G10_0_1 = det*K[0]*K[3]*(1.0);
+    const double G10_0_2 = det*K[0]*K[6]*(1.0);
+    const double G10_1_0 = det*K[3]*K[0]*(1.0);
+    const double G10_1_1 = det*K[3]*K[3]*(1.0);
+    const double G10_1_2 = det*K[3]*K[6]*(1.0);
+    const double G10_2_0 = det*K[6]*K[0]*(1.0);
+    const double G10_2_1 = det*K[6]*K[3]*(1.0);
+    const double G10_2_2 = det*K[6]*K[6]*(1.0);
+    const double G11_0_0 = det*K[0]*K[0]*(1.0);
+    const double G11_0_1 = det*K[0]*K[3]*(1.0);
+    const double G11_0_2 = det*K[0]*K[6]*(1.0);
+    const double G11_1_0 = det*K[3]*K[0]*(1.0);
+    const double G11_1_1 = det*K[3]*K[3]*(1.0);
+    const double G11_1_2 = det*K[3]*K[6]*(1.0);
+    const double G11_2_0 = det*K[6]*K[0]*(1.0);
+    const double G11_2_1 = det*K[6]*K[3]*(1.0);
+    const double G11_2_2 = det*K[6]*K[6]*(1.0);
+    const double G12_0_0 = det*K[1]*K[1]*(1.0);
+    const double G12_0_1 = det*K[1]*K[4]*(1.0);
+    const double G12_0_2 = det*K[1]*K[7]*(1.0);
+    const double G12_1_0 = det*K[4]*K[1]*(1.0);
+    const double G12_1_1 = det*K[4]*K[4]*(1.0);
+    const double G12_1_2 = det*K[4]*K[7]*(1.0);
+    const double G12_2_0 = det*K[7]*K[1]*(1.0);
+    const double G12_2_1 = det*K[7]*K[4]*(1.0);
+    const double G12_2_2 = det*K[7]*K[7]*(1.0);
+    const double G13_0_0 = det*K[1]*K[1]*(1.0);
+    const double G13_0_1 = det*K[1]*K[4]*(1.0);
+    const double G13_0_2 = det*K[1]*K[7]*(1.0);
+    const double G13_1_0 = det*K[4]*K[1]*(1.0);
+    const double G13_1_1 = det*K[4]*K[4]*(1.0);
+    const double G13_1_2 = det*K[4]*K[7]*(1.0);
+    const double G13_2_0 = det*K[7]*K[1]*(1.0);
+    const double G13_2_1 = det*K[7]*K[4]*(1.0);
+    const double G13_2_2 = det*K[7]*K[7]*(1.0);
+    const double G14_0_0 = det*K[1]*K[1]*(1.0);
+    const double G14_0_1 = det*K[1]*K[4]*(1.0);
+    const double G14_0_2 = det*K[1]*K[7]*(1.0);
+    const double G14_1_0 = det*K[4]*K[1]*(1.0);
+    const double G14_1_1 = det*K[4]*K[4]*(1.0);
+    const double G14_1_2 = det*K[4]*K[7]*(1.0);
+    const double G14_2_0 = det*K[7]*K[1]*(1.0);
+    const double G14_2_1 = det*K[7]*K[4]*(1.0);
+    const double G14_2_2 = det*K[7]*K[7]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.1*G7_0_0 + 0.1*G7_0_1 + 0.1*G7_0_2 + 0.1*G7_1_0 + 0.1*G7_1_1 + 0.1*G7_1_2 + 0.1*G7_2_0 + 0.1*G7_2_1 + 0.1*G7_2_2 + 0.1*G10_0_0 + 0.1*G10_0_1 + 0.1*G10_0_2 + 0.1*G10_1_0 + 0.1*G10_1_1 + 0.1*G10_1_2 + 0.1*G10_2_0 + 0.1*G10_2_1 + 0.1*G10_2_2 + 0.1*G13_0_0 + 0.1*G13_0_1 + 0.1*G13_0_2 + 0.1*G13_1_0 + 0.1*G13_1_1 + 0.1*G13_1_2 + 0.1*G13_2_0 + 0.1*G13_2_1 + 0.1*G13_2_2;
+    A[1] = 0.0333333333333333*G7_0_0 + 0.0333333333333334*G7_1_0 + 0.0333333333333333*G7_2_0 + 0.0333333333333333*G10_0_0 + 0.0333333333333334*G10_1_0 + 0.0333333333333333*G10_2_0 + 0.0333333333333333*G13_0_0 + 0.0333333333333334*G13_1_0 + 0.0333333333333333*G13_2_0;
+    A[2] = 0.0333333333333333*G7_0_1 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_2_1 + 0.0333333333333333*G10_0_1 + 0.0333333333333333*G10_1_1 + 0.0333333333333333*G10_2_1 + 0.0333333333333333*G13_0_1 + 0.0333333333333333*G13_1_1 + 0.0333333333333333*G13_2_1;
+    A[3] = 0.0333333333333333*G7_0_2 + 0.0333333333333333*G7_1_2 + 0.0333333333333333*G7_2_2 + 0.0333333333333333*G10_0_2 + 0.0333333333333333*G10_1_2 + 0.0333333333333333*G10_2_2 + 0.0333333333333333*G13_0_2 + 0.0333333333333333*G13_1_2 + 0.0333333333333333*G13_2_2;
+    A[4] = 0.0333333333333332*G7_0_1 + 0.0333333333333332*G7_0_2 + 0.0333333333333332*G7_1_1 + 0.0333333333333332*G7_1_2 + 0.0333333333333332*G7_2_1 + 0.0333333333333332*G7_2_2 + 0.0333333333333332*G10_0_1 + 0.0333333333333332*G10_0_2 + 0.0333333333333332*G10_1_1 + 0.0333333333333332*G10_1_2 + 0.0333333333333332*G10_2_1 + 0.0333333333333332*G10_2_2 + 0.0333333333333332*G13_0_1 + 0.0333333333333332*G13_0_2 + 0.0333333333333332*G13_1_1 + 0.0333333333333332*G13_1_2 + 0.0333333333333332*G13_2_1 + 0.0333333333333332*G13_2_2;
+    A[5] = 0.0333333333333332*G7_0_0 + 0.0333333333333332*G7_0_2 + 0.0333333333333332*G7_1_0 + 0.0333333333333332*G7_1_2 + 0.0333333333333332*G7_2_0 + 0.0333333333333333*G7_2_2 + 0.0333333333333332*G10_0_0 + 0.0333333333333332*G10_0_2 + 0.0333333333333332*G10_1_0 + 0.0333333333333332*G10_1_2 + 0.0333333333333332*G10_2_0 + 0.0333333333333333*G10_2_2 + 0.0333333333333332*G13_0_0 + 0.0333333333333332*G13_0_2 + 0.0333333333333332*G13_1_0 + 0.0333333333333332*G13_1_2 + 0.0333333333333332*G13_2_0 + 0.0333333333333333*G13_2_2;
+    A[6] = 0.0333333333333332*G7_0_0 + 0.0333333333333333*G7_0_1 + 0.0333333333333332*G7_1_0 + 0.0333333333333333*G7_1_1 + 0.0333333333333332*G7_2_0 + 0.0333333333333333*G7_2_1 + 0.0333333333333332*G10_0_0 + 0.0333333333333333*G10_0_1 + 0.0333333333333332*G10_1_0 + 0.0333333333333333*G10_1_1 + 0.0333333333333332*G10_2_0 + 0.0333333333333333*G10_2_1 + 0.0333333333333332*G13_0_0 + 0.0333333333333333*G13_0_1 + 0.0333333333333332*G13_1_0 + 0.0333333333333333*G13_1_1 + 0.0333333333333332*G13_2_0 + 0.0333333333333333*G13_2_1;
+    A[7] = -0.0333333333333332*G7_0_0 - 0.0333333333333332*G7_0_1 - 0.133333333333333*G7_0_2 - 0.0333333333333332*G7_1_0 - 0.0333333333333332*G7_1_1 - 0.133333333333333*G7_1_2 - 0.0333333333333332*G7_2_0 - 0.0333333333333332*G7_2_1 - 0.133333333333333*G7_2_2 - 0.0333333333333332*G10_0_0 - 0.0333333333333332*G10_0_1 - 0.133333333333333*G10_0_2 - 0.0333333333333332*G10_1_0 - 0.0333333333333332*G10_1_1 - 0.133333333333333*G10_1_2 - 0.0333333333333332*G10_2_0 - 0.0333333333333332*G10_2_1 - 0.133333333333333*G10_2_2 - 0.0333333333333332*G13_0_0 - 0.0333333333333332*G13_0_1 - 0.133333333333333*G13_0_2 - 0.0333333333333332*G13_1_0 - 0.0333333333333332*G13_1_1 - 0.133333333333333*G13_1_2 - 0.0333333333333332*G13_2_0 - 0.0333333333333332*G13_2_1 - 0.133333333333333*G13_2_2;
+    A[8] = -0.0333333333333332*G7_0_0 - 0.133333333333333*G7_0_1 - 0.0333333333333332*G7_0_2 - 0.0333333333333332*G7_1_0 - 0.133333333333333*G7_1_1 - 0.0333333333333332*G7_1_2 - 0.0333333333333332*G7_2_0 - 0.133333333333333*G7_2_1 - 0.0333333333333332*G7_2_2 - 0.0333333333333332*G10_0_0 - 0.133333333333333*G10_0_1 - 0.0333333333333332*G10_0_2 - 0.0333333333333332*G10_1_0 - 0.133333333333333*G10_1_1 - 0.0333333333333332*G10_1_2 - 0.0333333333333332*G10_2_0 - 0.133333333333333*G10_2_1 - 0.0333333333333332*G10_2_2 - 0.0333333333333332*G13_0_0 - 0.133333333333333*G13_0_1 - 0.0333333333333332*G13_0_2 - 0.0333333333333332*G13_1_0 - 0.133333333333333*G13_1_1 - 0.0333333333333332*G13_1_2 - 0.0333333333333332*G13_2_0 - 0.133333333333333*G13_2_1 - 0.0333333333333332*G13_2_2;
+    A[9] = -0.133333333333333*G7_0_0 - 0.0333333333333333*G7_0_1 - 0.0333333333333333*G7_0_2 - 0.133333333333333*G7_1_0 - 0.0333333333333333*G7_1_1 - 0.0333333333333333*G7_1_2 - 0.133333333333333*G7_2_0 - 0.0333333333333332*G7_2_1 - 0.0333333333333333*G7_2_2 - 0.133333333333333*G10_0_0 - 0.0333333333333333*G10_0_1 - 0.0333333333333333*G10_0_2 - 0.133333333333333*G10_1_0 - 0.0333333333333333*G10_1_1 - 0.0333333333333333*G10_1_2 - 0.133333333333333*G10_2_0 - 0.0333333333333332*G10_2_1 - 0.0333333333333333*G10_2_2 - 0.133333333333333*G13_0_0 - 0.0333333333333333*G13_0_1 - 0.0333333333333333*G13_0_2 - 0.133333333333333*G13_1_0 - 0.0333333333333333*G13_1_1 - 0.0333333333333333*G13_1_2 - 0.133333333333333*G13_2_0 - 0.0333333333333332*G13_2_1 - 0.0333333333333333*G13_2_2;
+    A[10] = 0.0;
+    A[11] = 0.0;
+    A[12] = 0.0;
+    A[13] = 0.0;
+    A[14] = 0.0;
+    A[15] = 0.0;
+    A[16] = 0.0;
+    A[17] = 0.0;
+    A[18] = 0.0;
+    A[19] = 0.0;
+    A[20] = 0.0;
+    A[21] = 0.0;
+    A[22] = 0.0;
+    A[23] = 0.0;
+    A[24] = 0.0;
+    A[25] = 0.0;
+    A[26] = 0.0;
+    A[27] = 0.0;
+    A[28] = 0.0;
+    A[29] = 0.0;
+    A[30] = -0.025*G4_0 - 0.025*G4_1 - 0.025*G4_2;
+    A[31] = 0.00833333333333332*G4_0 + 0.00833333333333332*G4_1 + 0.00833333333333331*G4_2;
+    A[32] = 0.0083333333333333*G4_0 + 0.0083333333333333*G4_1 + 0.0083333333333333*G4_2;
+    A[33] = 0.00833333333333331*G4_0 + 0.00833333333333331*G4_1 + 0.00833333333333331*G4_2;
+    A[34] = 0.0333333333333333*G7_0_0 + 0.0333333333333334*G7_0_1 + 0.0333333333333333*G7_0_2 + 0.0333333333333333*G10_0_0 + 0.0333333333333334*G10_0_1 + 0.0333333333333333*G10_0_2 + 0.0333333333333333*G13_0_0 + 0.0333333333333334*G13_0_1 + 0.0333333333333333*G13_0_2;
+    A[35] = 0.1*G7_0_0 + 0.1*G10_0_0 + 0.1*G13_0_0;
+    A[36] = -0.0333333333333333*G7_0_1 - 0.0333333333333333*G10_0_1 - 0.0333333333333333*G13_0_1;
+    A[37] = -0.0333333333333333*G7_0_2 - 0.0333333333333333*G10_0_2 - 0.0333333333333333*G13_0_2;
+    A[38] = -0.0333333333333334*G7_0_1 - 0.0333333333333333*G7_0_2 - 0.0333333333333334*G10_0_1 - 0.0333333333333333*G10_0_2 - 0.0333333333333334*G13_0_1 - 0.0333333333333333*G13_0_2;
+    A[39] = -0.0333333333333334*G7_0_0 + 0.1*G7_0_2 - 0.0333333333333334*G10_0_0 + 0.1*G10_0_2 - 0.0333333333333334*G13_0_0 + 0.1*G13_0_2;
+    A[40] = -0.0333333333333333*G7_0_0 + 0.1*G7_0_1 - 0.0333333333333333*G10_0_0 + 0.1*G10_0_1 - 0.0333333333333333*G13_0_0 + 0.1*G13_0_1;
+    A[41] = 0.0333333333333334*G7_0_0 + 0.0333333333333333*G7_0_1 + 0.0333333333333334*G10_0_0 + 0.0333333333333333*G10_0_1 + 0.0333333333333334*G13_0_0 + 0.0333333333333333*G13_0_1;
+    A[42] = 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_0_2 + 0.0333333333333333*G10_0_0 + 0.0333333333333333*G10_0_2 + 0.0333333333333333*G13_0_0 + 0.0333333333333333*G13_0_2;
+    A[43] = -0.133333333333333*G7_0_0 - 0.1*G7_0_1 - 0.1*G7_0_2 - 0.133333333333333*G10_0_0 - 0.1*G10_0_1 - 0.1*G10_0_2 - 0.133333333333333*G13_0_0 - 0.1*G13_0_1 - 0.1*G13_0_2;
+    A[44] = 0.0;
+    A[45] = 0.0;
+    A[46] = 0.0;
+    A[47] = 0.0;
+    A[48] = 0.0;
+    A[49] = 0.0;
+    A[50] = 0.0;
+    A[51] = 0.0;
+    A[52] = 0.0;
+    A[53] = 0.0;
+    A[54] = 0.0;
+    A[55] = 0.0;
+    A[56] = 0.0;
+    A[57] = 0.0;
+    A[58] = 0.0;
+    A[59] = 0.0;
+    A[60] = 0.0;
+    A[61] = 0.0;
+    A[62] = 0.0;
+    A[63] = 0.0;
+    A[64] = -0.00833333333333334*G4_0;
+    A[65] = 0.025*G4_0;
+    A[66] = -0.00833333333333333*G4_0;
+    A[67] = -0.00833333333333334*G4_0;
+    A[68] = 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_1_2 + 0.0333333333333333*G10_1_0 + 0.0333333333333333*G10_1_1 + 0.0333333333333333*G10_1_2 + 0.0333333333333333*G13_1_0 + 0.0333333333333333*G13_1_1 + 0.0333333333333333*G13_1_2;
+    A[69] = -0.0333333333333333*G7_1_0 - 0.0333333333333333*G10_1_0 - 0.0333333333333333*G13_1_0;
+    A[70] = 0.1*G7_1_1 + 0.1*G10_1_1 + 0.1*G13_1_1;
+    A[71] = -0.0333333333333333*G7_1_2 - 0.0333333333333333*G10_1_2 - 0.0333333333333333*G13_1_2;
+    A[72] = -0.0333333333333334*G7_1_1 + 0.1*G7_1_2 - 0.0333333333333334*G10_1_1 + 0.1*G10_1_2 - 0.0333333333333334*G13_1_1 + 0.1*G13_1_2;
+    A[73] = -0.0333333333333334*G7_1_0 - 0.0333333333333334*G7_1_2 - 0.0333333333333334*G10_1_0 - 0.0333333333333334*G10_1_2 - 0.0333333333333334*G13_1_0 - 0.0333333333333334*G13_1_2;
+    A[74] = 0.1*G7_1_0 - 0.0333333333333334*G7_1_1 + 0.1*G10_1_0 - 0.0333333333333334*G10_1_1 + 0.1*G13_1_0 - 0.0333333333333334*G13_1_1;
+    A[75] = 0.0333333333333334*G7_1_0 + 0.0333333333333334*G7_1_1 + 0.0333333333333334*G10_1_0 + 0.0333333333333334*G10_1_1 + 0.0333333333333334*G13_1_0 + 0.0333333333333334*G13_1_1;
+    A[76] = -0.1*G7_1_0 - 0.133333333333333*G7_1_1 - 0.1*G7_1_2 - 0.1*G10_1_0 - 0.133333333333333*G10_1_1 - 0.1*G10_1_2 - 0.1*G13_1_0 - 0.133333333333333*G13_1_1 - 0.1*G13_1_2;
+    A[77] = 0.0333333333333334*G7_1_1 + 0.0333333333333334*G7_1_2 + 0.0333333333333334*G10_1_1 + 0.0333333333333334*G10_1_2 + 0.0333333333333334*G13_1_1 + 0.0333333333333334*G13_1_2;
+    A[78] = 0.0;
+    A[79] = 0.0;
+    A[80] = 0.0;
+    A[81] = 0.0;
+    A[82] = 0.0;
+    A[83] = 0.0;
+    A[84] = 0.0;
+    A[85] = 0.0;
+    A[86] = 0.0;
+    A[87] = 0.0;
+    A[88] = 0.0;
+    A[89] = 0.0;
+    A[90] = 0.0;
+    A[91] = 0.0;
+    A[92] = 0.0;
+    A[93] = 0.0;
+    A[94] = 0.0;
+    A[95] = 0.0;
+    A[96] = 0.0;
+    A[97] = 0.0;
+    A[98] = -0.00833333333333335*G4_1;
+    A[99] = -0.00833333333333335*G4_1;
+    A[100] = 0.025*G4_1;
+    A[101] = -0.00833333333333335*G4_1;
+    A[102] = 0.0333333333333333*G7_2_0 + 0.0333333333333333*G7_2_1 + 0.0333333333333333*G7_2_2 + 0.0333333333333333*G10_2_0 + 0.0333333333333333*G10_2_1 + 0.0333333333333333*G10_2_2 + 0.0333333333333333*G13_2_0 + 0.0333333333333333*G13_2_1 + 0.0333333333333333*G13_2_2;
+    A[103] = -0.0333333333333333*G7_2_0 - 0.0333333333333333*G10_2_0 - 0.0333333333333333*G13_2_0;
+    A[104] = -0.0333333333333333*G7_2_1 - 0.0333333333333333*G10_2_1 - 0.0333333333333333*G13_2_1;
+    A[105] = 0.1*G7_2_2 + 0.1*G10_2_2 + 0.1*G13_2_2;
+    A[106] = 0.1*G7_2_1 - 0.0333333333333334*G7_2_2 + 0.1*G10_2_1 - 0.0333333333333334*G10_2_2 + 0.1*G13_2_1 - 0.0333333333333334*G13_2_2;
+    A[107] = 0.1*G7_2_0 - 0.0333333333333334*G7_2_2 + 0.1*G10_2_0 - 0.0333333333333334*G10_2_2 + 0.1*G13_2_0 - 0.0333333333333334*G13_2_2;
+    A[108] = -0.0333333333333334*G7_2_0 - 0.0333333333333334*G7_2_1 - 0.0333333333333334*G10_2_0 - 0.0333333333333334*G10_2_1 - 0.0333333333333334*G13_2_0 - 0.0333333333333334*G13_2_1;
+    A[109] = -0.1*G7_2_0 - 0.1*G7_2_1 - 0.133333333333333*G7_2_2 - 0.1*G10_2_0 - 0.1*G10_2_1 - 0.133333333333333*G10_2_2 - 0.1*G13_2_0 - 0.1*G13_2_1 - 0.133333333333333*G13_2_2;
+    A[110] = 0.0333333333333334*G7_2_0 + 0.0333333333333334*G7_2_2 + 0.0333333333333334*G10_2_0 + 0.0333333333333334*G10_2_2 + 0.0333333333333334*G13_2_0 + 0.0333333333333334*G13_2_2;
+    A[111] = 0.0333333333333334*G7_2_1 + 0.0333333333333334*G7_2_2 + 0.0333333333333334*G10_2_1 + 0.0333333333333334*G10_2_2 + 0.0333333333333334*G13_2_1 + 0.0333333333333334*G13_2_2;
+    A[112] = 0.0;
+    A[113] = 0.0;
+    A[114] = 0.0;
+    A[115] = 0.0;
+    A[116] = 0.0;
+    A[117] = 0.0;
+    A[118] = 0.0;
+    A[119] = 0.0;
+    A[120] = 0.0;
+    A[121] = 0.0;
+    A[122] = 0.0;
+    A[123] = 0.0;
+    A[124] = 0.0;
+    A[125] = 0.0;
+    A[126] = 0.0;
+    A[127] = 0.0;
+    A[128] = 0.0;
+    A[129] = 0.0;
+    A[130] = 0.0;
+    A[131] = 0.0;
+    A[132] = -0.00833333333333335*G4_2;
+    A[133] = -0.00833333333333334*G4_2;
+    A[134] = -0.00833333333333336*G4_2;
+    A[135] = 0.025*G4_2;
+    A[136] = 0.0333333333333332*G7_1_0 + 0.0333333333333332*G7_1_1 + 0.0333333333333332*G7_1_2 + 0.0333333333333332*G7_2_0 + 0.0333333333333332*G7_2_1 + 0.0333333333333332*G7_2_2 + 0.0333333333333332*G10_1_0 + 0.0333333333333332*G10_1_1 + 0.0333333333333332*G10_1_2 + 0.0333333333333332*G10_2_0 + 0.0333333333333332*G10_2_1 + 0.0333333333333332*G10_2_2 + 0.0333333333333332*G13_1_0 + 0.0333333333333332*G13_1_1 + 0.0333333333333332*G13_1_2 + 0.0333333333333332*G13_2_0 + 0.0333333333333332*G13_2_1 + 0.0333333333333332*G13_2_2;
+    A[137] = -0.0333333333333333*G7_1_0 - 0.0333333333333333*G7_2_0 - 0.0333333333333333*G10_1_0 - 0.0333333333333333*G10_2_0 - 0.0333333333333333*G13_1_0 - 0.0333333333333333*G13_2_0;
+    A[138] = -0.0333333333333334*G7_1_1 + 0.1*G7_2_1 - 0.0333333333333334*G10_1_1 + 0.1*G10_2_1 - 0.0333333333333334*G13_1_1 + 0.1*G13_2_1;
+    A[139] = 0.1*G7_1_2 - 0.0333333333333334*G7_2_2 + 0.1*G10_1_2 - 0.0333333333333334*G10_2_2 + 0.1*G13_1_2 - 0.0333333333333334*G13_2_2;
+    A[140] = 0.266666666666667*G7_1_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_1 + 0.266666666666666*G7_2_2 + 0.266666666666667*G10_1_1 + 0.133333333333333*G10_1_2 + 0.133333333333333*G10_2_1 + 0.266666666666666*G10_2_2 + 0.266666666666667*G13_1_1 + 0.133333333333333*G13_1_2 + 0.133333333333333*G13_2_1 + 0.266666666666666*G13_2_2;
+    A[141] = 0.266666666666667*G7_1_0 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_2 + 0.266666666666667*G10_1_0 + 0.133333333333333*G10_1_2 + 0.133333333333333*G10_2_0 + 0.133333333333333*G10_2_2 + 0.266666666666667*G13_1_0 + 0.133333333333333*G13_1_2 + 0.133333333333333*G13_2_0 + 0.133333333333333*G13_2_2;
+    A[142] = 0.133333333333333*G7_1_0 + 0.133333333333333*G7_1_1 + 0.266666666666666*G7_2_0 + 0.133333333333333*G7_2_1 + 0.133333333333333*G10_1_0 + 0.133333333333333*G10_1_1 + 0.266666666666666*G10_2_0 + 0.133333333333333*G10_2_1 + 0.133333333333333*G13_1_0 + 0.133333333333333*G13_1_1 + 0.266666666666666*G13_2_0 + 0.133333333333333*G13_2_1;
+    A[143] = -0.266666666666667*G7_1_0 - 0.266666666666666*G7_1_1 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_1 - 0.266666666666667*G10_1_0 - 0.266666666666666*G10_1_1 - 0.133333333333333*G10_1_2 - 0.133333333333333*G10_2_0 - 0.133333333333333*G10_2_1 - 0.266666666666667*G13_1_0 - 0.266666666666666*G13_1_1 - 0.133333333333333*G13_1_2 - 0.133333333333333*G13_2_0 - 0.133333333333333*G13_2_1;
+    A[144] = -0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_2 - 0.266666666666666*G7_2_0 - 0.133333333333333*G7_2_1 - 0.266666666666666*G7_2_2 - 0.133333333333333*G10_1_0 - 0.133333333333333*G10_1_2 - 0.266666666666666*G10_2_0 - 0.133333333333333*G10_2_1 - 0.266666666666666*G10_2_2 - 0.133333333333333*G13_1_0 - 0.133333333333333*G13_1_2 - 0.266666666666666*G13_2_0 - 0.133333333333333*G13_2_1 - 0.266666666666666*G13_2_2;
+    A[145] = -0.133333333333333*G7_1_1 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_1 - 0.133333333333333*G7_2_2 - 0.133333333333333*G10_1_1 - 0.133333333333333*G10_1_2 - 0.133333333333333*G10_2_1 - 0.133333333333333*G10_2_2 - 0.133333333333333*G13_1_1 - 0.133333333333333*G13_1_2 - 0.133333333333333*G13_2_1 - 0.133333333333333*G13_2_2;
+    A[146] = 0.0;
+    A[147] = 0.0;
+    A[148] = 0.0;
+    A[149] = 0.0;
+    A[150] = 0.0;
+    A[151] = 0.0;
+    A[152] = 0.0;
+    A[153] = 0.0;
+    A[154] = 0.0;
+    A[155] = 0.0;
+    A[156] = 0.0;
+    A[157] = 0.0;
+    A[158] = 0.0;
+    A[159] = 0.0;
+    A[160] = 0.0;
+    A[161] = 0.0;
+    A[162] = 0.0;
+    A[163] = 0.0;
+    A[164] = 0.0;
+    A[165] = 0.0;
+    A[166] = 0.0333333333333334*G4_1 + 0.0333333333333333*G4_2;
+    A[167] = 0.0333333333333333*G4_1 + 0.0333333333333333*G4_2;
+    A[168] = 0.0333333333333333*G4_1 + 0.0666666666666666*G4_2;
+    A[169] = 0.0666666666666667*G4_1 + 0.0333333333333333*G4_2;
+    A[170] = 0.0333333333333332*G7_0_0 + 0.0333333333333332*G7_0_1 + 0.0333333333333332*G7_0_2 + 0.0333333333333332*G7_2_0 + 0.0333333333333332*G7_2_1 + 0.0333333333333332*G7_2_2 + 0.0333333333333332*G10_0_0 + 0.0333333333333332*G10_0_1 + 0.0333333333333332*G10_0_2 + 0.0333333333333332*G10_2_0 + 0.0333333333333332*G10_2_1 + 0.0333333333333332*G10_2_2 + 0.0333333333333332*G13_0_0 + 0.0333333333333332*G13_0_1 + 0.0333333333333332*G13_0_2 + 0.0333333333333332*G13_2_0 + 0.0333333333333332*G13_2_1 + 0.0333333333333332*G13_2_2;
+    A[171] = -0.0333333333333334*G7_0_0 + 0.1*G7_2_0 - 0.0333333333333334*G10_0_0 + 0.1*G10_2_0 - 0.0333333333333334*G13_0_0 + 0.1*G13_2_0;
+    A[172] = -0.0333333333333334*G7_0_1 - 0.0333333333333334*G7_2_1 - 0.0333333333333334*G10_0_1 - 0.0333333333333334*G10_2_1 - 0.0333333333333334*G13_0_1 - 0.0333333333333334*G13_2_1;
+    A[173] = 0.1*G7_0_2 - 0.0333333333333334*G7_2_2 + 0.1*G10_0_2 - 0.0333333333333334*G10_2_2 + 0.1*G13_0_2 - 0.0333333333333334*G13_2_2;
+    A[174] = 0.266666666666667*G7_0_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_2_1 + 0.133333333333333*G7_2_2 + 0.266666666666667*G10_0_1 + 0.133333333333333*G10_0_2 + 0.133333333333333*G10_2_1 + 0.133333333333333*G10_2_2 + 0.266666666666667*G13_0_1 + 0.133333333333333*G13_0_2 + 0.133333333333333*G13_2_1 + 0.133333333333333*G13_2_2;
+    A[175] = 0.266666666666666*G7_0_0 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_2_0 + 0.266666666666667*G7_2_2 + 0.266666666666666*G10_0_0 + 0.133333333333333*G10_0_2 + 0.133333333333333*G10_2_0 + 0.266666666666667*G10_2_2 + 0.266666666666666*G13_0_0 + 0.133333333333333*G13_0_2 + 0.133333333333333*G13_2_0 + 0.266666666666667*G13_2_2;
+    A[176] = 0.133333333333333*G7_0_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_2_0 + 0.266666666666667*G7_2_1 + 0.133333333333333*G10_0_0 + 0.133333333333333*G10_0_1 + 0.133333333333333*G10_2_0 + 0.266666666666667*G10_2_1 + 0.133333333333333*G13_0_0 + 0.133333333333333*G13_0_1 + 0.133333333333333*G13_2_0 + 0.266666666666667*G13_2_1;
+    A[177] = -0.266666666666666*G7_0_0 - 0.266666666666666*G7_0_1 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_1 - 0.266666666666666*G10_0_0 - 0.266666666666666*G10_0_1 - 0.133333333333333*G10_0_2 - 0.133333333333333*G10_2_0 - 0.133333333333333*G10_2_1 - 0.266666666666666*G13_0_0 - 0.266666666666666*G13_0_1 - 0.133333333333333*G13_0_2 - 0.133333333333333*G13_2_0 - 0.133333333333333*G13_2_1;
+    A[178] = -0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_2 - 0.133333333333333*G10_0_0 - 0.133333333333333*G10_0_2 - 0.133333333333333*G10_2_0 - 0.133333333333333*G10_2_2 - 0.133333333333333*G13_0_0 - 0.133333333333333*G13_0_2 - 0.133333333333333*G13_2_0 - 0.133333333333333*G13_2_2;
+    A[179] = -0.133333333333333*G7_0_1 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_2_0 - 0.266666666666667*G7_2_1 - 0.266666666666666*G7_2_2 - 0.133333333333333*G10_0_1 - 0.133333333333333*G10_0_2 - 0.133333333333333*G10_2_0 - 0.266666666666667*G10_2_1 - 0.266666666666666*G10_2_2 - 0.133333333333333*G13_0_1 - 0.133333333333333*G13_0_2 - 0.133333333333333*G13_2_0 - 0.266666666666667*G13_2_1 - 0.266666666666666*G13_2_2;
+    A[180] = 0.0;
+    A[181] = 0.0;
+    A[182] = 0.0;
+    A[183] = 0.0;
+    A[184] = 0.0;
+    A[185] = 0.0;
+    A[186] = 0.0;
+    A[187] = 0.0;
+    A[188] = 0.0;
+    A[189] = 0.0;
+    A[190] = 0.0;
+    A[191] = 0.0;
+    A[192] = 0.0;
+    A[193] = 0.0;
+    A[194] = 0.0;
+    A[195] = 0.0;
+    A[196] = 0.0;
+    A[197] = 0.0;
+    A[198] = 0.0;
+    A[199] = 0.0;
+    A[200] = 0.0333333333333333*G4_0 + 0.0333333333333333*G4_2;
+    A[201] = 0.0333333333333333*G4_0 + 0.0666666666666666*G4_2;
+    A[202] = 0.0333333333333333*G4_0 + 0.0333333333333333*G4_2;
+    A[203] = 0.0666666666666666*G4_0 + 0.0333333333333333*G4_2;
+    A[204] = 0.0333333333333332*G7_0_0 + 0.0333333333333332*G7_0_1 + 0.0333333333333332*G7_0_2 + 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_1_1 + 0.0333333333333332*G7_1_2 + 0.0333333333333332*G10_0_0 + 0.0333333333333332*G10_0_1 + 0.0333333333333332*G10_0_2 + 0.0333333333333333*G10_1_0 + 0.0333333333333333*G10_1_1 + 0.0333333333333332*G10_1_2 + 0.0333333333333332*G13_0_0 + 0.0333333333333332*G13_0_1 + 0.0333333333333332*G13_0_2 + 0.0333333333333333*G13_1_0 + 0.0333333333333333*G13_1_1 + 0.0333333333333332*G13_1_2;
+    A[205] = -0.0333333333333333*G7_0_0 + 0.1*G7_1_0 - 0.0333333333333333*G10_0_0 + 0.1*G10_1_0 - 0.0333333333333333*G13_0_0 + 0.1*G13_1_0;
+    A[206] = 0.1*G7_0_1 - 0.0333333333333334*G7_1_1 + 0.1*G10_0_1 - 0.0333333333333334*G10_1_1 + 0.1*G13_0_1 - 0.0333333333333334*G13_1_1;
+    A[207] = -0.0333333333333334*G7_0_2 - 0.0333333333333334*G7_1_2 - 0.0333333333333334*G10_0_2 - 0.0333333333333334*G10_1_2 - 0.0333333333333334*G13_0_2 - 0.0333333333333334*G13_1_2;
+    A[208] = 0.133333333333333*G7_0_1 + 0.266666666666666*G7_0_2 + 0.133333333333333*G7_1_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G10_0_1 + 0.266666666666666*G10_0_2 + 0.133333333333333*G10_1_1 + 0.133333333333333*G10_1_2 + 0.133333333333333*G13_0_1 + 0.266666666666666*G13_0_2 + 0.133333333333333*G13_1_1 + 0.133333333333333*G13_1_2;
+    A[209] = 0.133333333333333*G7_0_0 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.266666666666667*G7_1_2 + 0.133333333333333*G10_0_0 + 0.133333333333333*G10_0_2 + 0.133333333333333*G10_1_0 + 0.266666666666667*G10_1_2 + 0.133333333333333*G13_0_0 + 0.133333333333333*G13_0_2 + 0.133333333333333*G13_1_0 + 0.266666666666667*G13_1_2;
+    A[210] = 0.266666666666666*G7_0_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_1_0 + 0.266666666666667*G7_1_1 + 0.266666666666666*G10_0_0 + 0.133333333333333*G10_0_1 + 0.133333333333333*G10_1_0 + 0.266666666666667*G10_1_1 + 0.266666666666666*G13_0_0 + 0.133333333333333*G13_0_1 + 0.133333333333333*G13_1_0 + 0.266666666666667*G13_1_1;
+    A[211] = -0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_1 - 0.133333333333333*G10_0_0 - 0.133333333333333*G10_0_1 - 0.133333333333333*G10_1_0 - 0.133333333333333*G10_1_1 - 0.133333333333333*G13_0_0 - 0.133333333333333*G13_0_1 - 0.133333333333333*G13_1_0 - 0.133333333333333*G13_1_1;
+    A[212] = -0.266666666666666*G7_0_0 - 0.133333333333333*G7_0_1 - 0.266666666666666*G7_0_2 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_2 - 0.266666666666666*G10_0_0 - 0.133333333333333*G10_0_1 - 0.266666666666666*G10_0_2 - 0.133333333333333*G10_1_0 - 0.133333333333333*G10_1_2 - 0.266666666666666*G13_0_0 - 0.133333333333333*G13_0_1 - 0.266666666666666*G13_0_2 - 0.133333333333333*G13_1_0 - 0.133333333333333*G13_1_2;
+    A[213] = -0.133333333333333*G7_0_1 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_1_0 - 0.266666666666667*G7_1_1 - 0.266666666666666*G7_1_2 - 0.133333333333333*G10_0_1 - 0.133333333333333*G10_0_2 - 0.133333333333333*G10_1_0 - 0.266666666666667*G10_1_1 - 0.266666666666666*G10_1_2 - 0.133333333333333*G13_0_1 - 0.133333333333333*G13_0_2 - 0.133333333333333*G13_1_0 - 0.266666666666667*G13_1_1 - 0.266666666666666*G13_1_2;
+    A[214] = 0.0;
+    A[215] = 0.0;
+    A[216] = 0.0;
+    A[217] = 0.0;
+    A[218] = 0.0;
+    A[219] = 0.0;
+    A[220] = 0.0;
+    A[221] = 0.0;
+    A[222] = 0.0;
+    A[223] = 0.0;
+    A[224] = 0.0;
+    A[225] = 0.0;
+    A[226] = 0.0;
+    A[227] = 0.0;
+    A[228] = 0.0;
+    A[229] = 0.0;
+    A[230] = 0.0;
+    A[231] = 0.0;
+    A[232] = 0.0;
+    A[233] = 0.0;
+    A[234] = 0.0333333333333333*G4_0 + 0.0333333333333334*G4_1;
+    A[235] = 0.0333333333333333*G4_0 + 0.0666666666666666*G4_1;
+    A[236] = 0.0666666666666666*G4_0 + 0.0333333333333333*G4_1;
+    A[237] = 0.0333333333333333*G4_0 + 0.0333333333333333*G4_1;
+    A[238] = -0.0333333333333332*G7_0_0 - 0.0333333333333332*G7_0_1 - 0.0333333333333332*G7_0_2 - 0.0333333333333332*G7_1_0 - 0.0333333333333332*G7_1_1 - 0.0333333333333332*G7_1_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_1 - 0.133333333333333*G7_2_2 - 0.0333333333333332*G10_0_0 - 0.0333333333333332*G10_0_1 - 0.0333333333333332*G10_0_2 - 0.0333333333333332*G10_1_0 - 0.0333333333333332*G10_1_1 - 0.0333333333333332*G10_1_2 - 0.133333333333333*G10_2_0 - 0.133333333333333*G10_2_1 - 0.133333333333333*G10_2_2 - 0.0333333333333332*G13_0_0 - 0.0333333333333332*G13_0_1 - 0.0333333333333332*G13_0_2 - 0.0333333333333332*G13_1_0 - 0.0333333333333332*G13_1_1 - 0.0333333333333332*G13_1_2 - 0.133333333333333*G13_2_0 - 0.133333333333333*G13_2_1 - 0.133333333333333*G13_2_2;
+    A[239] = 0.0333333333333334*G7_0_0 + 0.0333333333333334*G7_1_0 + 0.0333333333333334*G10_0_0 + 0.0333333333333334*G10_1_0 + 0.0333333333333334*G13_0_0 + 0.0333333333333334*G13_1_0;
+    A[240] = 0.0333333333333334*G7_0_1 + 0.0333333333333334*G7_1_1 + 0.0333333333333334*G10_0_1 + 0.0333333333333334*G10_1_1 + 0.0333333333333334*G13_0_1 + 0.0333333333333334*G13_1_1;
+    A[241] = -0.1*G7_0_2 - 0.1*G7_1_2 - 0.133333333333333*G7_2_2 - 0.1*G10_0_2 - 0.1*G10_1_2 - 0.133333333333333*G10_2_2 - 0.1*G13_0_2 - 0.1*G13_1_2 - 0.133333333333333*G13_2_2;
+    A[242] = -0.266666666666667*G7_0_1 - 0.133333333333333*G7_0_2 - 0.266666666666667*G7_1_1 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_1 - 0.266666666666667*G10_0_1 - 0.133333333333333*G10_0_2 - 0.266666666666667*G10_1_1 - 0.133333333333333*G10_1_2 - 0.133333333333333*G10_2_1 - 0.266666666666667*G13_0_1 - 0.133333333333333*G13_0_2 - 0.266666666666667*G13_1_1 - 0.133333333333333*G13_1_2 - 0.133333333333333*G13_2_1;
+    A[243] = -0.266666666666666*G7_0_0 - 0.133333333333333*G7_0_2 - 0.266666666666666*G7_1_0 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_0 - 0.266666666666666*G10_0_0 - 0.133333333333333*G10_0_2 - 0.266666666666666*G10_1_0 - 0.133333333333333*G10_1_2 - 0.133333333333333*G10_2_0 - 0.266666666666666*G13_0_0 - 0.133333333333333*G13_0_2 - 0.266666666666666*G13_1_0 - 0.133333333333333*G13_1_2 - 0.133333333333333*G13_2_0;
+    A[244] = -0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_1 - 0.133333333333333*G10_0_0 - 0.133333333333333*G10_0_1 - 0.133333333333333*G10_1_0 - 0.133333333333333*G10_1_1 - 0.133333333333333*G13_0_0 - 0.133333333333333*G13_0_1 - 0.133333333333333*G13_1_0 - 0.133333333333333*G13_1_1;
+    A[245] = 0.266666666666666*G7_0_0 + 0.266666666666666*G7_0_1 + 0.133333333333333*G7_0_2 + 0.266666666666666*G7_1_0 + 0.266666666666666*G7_1_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_1 + 0.266666666666667*G7_2_2 + 0.266666666666666*G10_0_0 + 0.266666666666666*G10_0_1 + 0.133333333333333*G10_0_2 + 0.266666666666666*G10_1_0 + 0.266666666666666*G10_1_1 + 0.133333333333333*G10_1_2 + 0.133333333333333*G10_2_0 + 0.133333333333333*G10_2_1 + 0.266666666666667*G10_2_2 + 0.266666666666666*G13_0_0 + 0.266666666666666*G13_0_1 + 0.133333333333333*G13_0_2 + 0.266666666666666*G13_1_0 + 0.266666666666666*G13_1_1 + 0.133333333333333*G13_1_2 + 0.133333333333333*G13_2_0 + 0.133333333333333*G13_2_1 + 0.266666666666667*G13_2_2;
+    A[246] = 0.133333333333333*G7_0_0 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_1 + 0.133333333333333*G10_0_0 + 0.133333333333333*G10_0_2 + 0.133333333333333*G10_1_0 + 0.133333333333333*G10_1_2 + 0.133333333333333*G10_2_1 + 0.133333333333333*G13_0_0 + 0.133333333333333*G13_0_2 + 0.133333333333333*G13_1_0 + 0.133333333333333*G13_1_2 + 0.133333333333333*G13_2_1;
+    A[247] = 0.133333333333333*G7_0_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G10_0_1 + 0.133333333333333*G10_0_2 + 0.133333333333333*G10_1_1 + 0.133333333333333*G10_1_2 + 0.133333333333333*G10_2_0 + 0.133333333333333*G13_0_1 + 0.133333333333333*G13_0_2 + 0.133333333333333*G13_1_1 + 0.133333333333333*G13_1_2 + 0.133333333333333*G13_2_0;
+    A[248] = 0.0;
+    A[249] = 0.0;
+    A[250] = 0.0;
+    A[251] = 0.0;
+    A[252] = 0.0;
+    A[253] = 0.0;
+    A[254] = 0.0;
+    A[255] = 0.0;
+    A[256] = 0.0;
+    A[257] = 0.0;
+    A[258] = 0.0;
+    A[259] = 0.0;
+    A[260] = 0.0;
+    A[261] = 0.0;
+    A[262] = 0.0;
+    A[263] = 0.0;
+    A[264] = 0.0;
+    A[265] = 0.0;
+    A[266] = 0.0;
+    A[267] = 0.0;
+    A[268] = -0.0333333333333333*G4_0 - 0.0333333333333333*G4_1 + 0.0333333333333333*G4_2;
+    A[269] = -0.0333333333333333*G4_0 - 0.0333333333333333*G4_1;
+    A[270] = -0.0333333333333333*G4_0 - 0.0333333333333333*G4_1;
+    A[271] = -0.0666666666666666*G4_0 - 0.0666666666666666*G4_1 - 0.0333333333333333*G4_2;
+    A[272] = -0.0333333333333332*G7_0_0 - 0.0333333333333332*G7_0_1 - 0.0333333333333332*G7_0_2 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_1 - 0.133333333333333*G7_1_2 - 0.0333333333333332*G7_2_0 - 0.0333333333333332*G7_2_1 - 0.0333333333333332*G7_2_2 - 0.0333333333333332*G10_0_0 - 0.0333333333333332*G10_0_1 - 0.0333333333333332*G10_0_2 - 0.133333333333333*G10_1_0 - 0.133333333333333*G10_1_1 - 0.133333333333333*G10_1_2 - 0.0333333333333332*G10_2_0 - 0.0333333333333332*G10_2_1 - 0.0333333333333332*G10_2_2 - 0.0333333333333332*G13_0_0 - 0.0333333333333332*G13_0_1 - 0.0333333333333332*G13_0_2 - 0.133333333333333*G13_1_0 - 0.133333333333333*G13_1_1 - 0.133333333333333*G13_1_2 - 0.0333333333333332*G13_2_0 - 0.0333333333333332*G13_2_1 - 0.0333333333333332*G13_2_2;
+    A[273] = 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_2_0 + 0.0333333333333333*G10_0_0 + 0.0333333333333333*G10_2_0 + 0.0333333333333333*G13_0_0 + 0.0333333333333333*G13_2_0;
+    A[274] = -0.1*G7_0_1 - 0.133333333333333*G7_1_1 - 0.1*G7_2_1 - 0.1*G10_0_1 - 0.133333333333333*G10_1_1 - 0.1*G10_2_1 - 0.1*G13_0_1 - 0.133333333333333*G13_1_1 - 0.1*G13_2_1;
+    A[275] = 0.0333333333333334*G7_0_2 + 0.0333333333333334*G7_2_2 + 0.0333333333333334*G10_0_2 + 0.0333333333333334*G10_2_2 + 0.0333333333333334*G13_0_2 + 0.0333333333333334*G13_2_2;
+    A[276] = -0.133333333333333*G7_0_1 - 0.266666666666666*G7_0_2 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_1 - 0.266666666666666*G7_2_2 - 0.133333333333333*G10_0_1 - 0.266666666666666*G10_0_2 - 0.133333333333333*G10_1_2 - 0.133333333333333*G10_2_1 - 0.266666666666666*G10_2_2 - 0.133333333333333*G13_0_1 - 0.266666666666666*G13_0_2 - 0.133333333333333*G13_1_2 - 0.133333333333333*G13_2_1 - 0.266666666666666*G13_2_2;
+    A[277] = -0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_2 - 0.133333333333333*G10_0_0 - 0.133333333333333*G10_0_2 - 0.133333333333333*G10_2_0 - 0.133333333333333*G10_2_2 - 0.133333333333333*G13_0_0 - 0.133333333333333*G13_0_2 - 0.133333333333333*G13_2_0 - 0.133333333333333*G13_2_2;
+    A[278] = -0.266666666666666*G7_0_0 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_1_0 - 0.266666666666666*G7_2_0 - 0.133333333333333*G7_2_1 - 0.266666666666666*G10_0_0 - 0.133333333333333*G10_0_1 - 0.133333333333333*G10_1_0 - 0.266666666666666*G10_2_0 - 0.133333333333333*G10_2_1 - 0.266666666666666*G13_0_0 - 0.133333333333333*G13_0_1 - 0.133333333333333*G13_1_0 - 0.266666666666666*G13_2_0 - 0.133333333333333*G13_2_1;
+    A[279] = 0.133333333333333*G7_0_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_1 + 0.133333333333333*G10_0_0 + 0.133333333333333*G10_0_1 + 0.133333333333333*G10_1_2 + 0.133333333333333*G10_2_0 + 0.133333333333333*G10_2_1 + 0.133333333333333*G13_0_0 + 0.133333333333333*G13_0_1 + 0.133333333333333*G13_1_2 + 0.133333333333333*G13_2_0 + 0.133333333333333*G13_2_1;
+    A[280] = 0.266666666666666*G7_0_0 + 0.133333333333333*G7_0_1 + 0.266666666666666*G7_0_2 + 0.133333333333333*G7_1_0 + 0.266666666666666*G7_1_1 + 0.133333333333333*G7_1_2 + 0.266666666666666*G7_2_0 + 0.133333333333333*G7_2_1 + 0.266666666666666*G7_2_2 + 0.266666666666666*G10_0_0 + 0.133333333333333*G10_0_1 + 0.266666666666666*G10_0_2 + 0.133333333333333*G10_1_0 + 0.266666666666666*G10_1_1 + 0.133333333333333*G10_1_2 + 0.266666666666666*G10_2_0 + 0.133333333333333*G10_2_1 + 0.266666666666666*G10_2_2 + 0.266666666666666*G13_0_0 + 0.133333333333333*G13_0_1 + 0.266666666666666*G13_0_2 + 0.133333333333333*G13_1_0 + 0.266666666666666*G13_1_1 + 0.133333333333333*G13_1_2 + 0.266666666666666*G13_2_0 + 0.133333333333333*G13_2_1 + 0.266666666666666*G13_2_2;
+    A[281] = 0.133333333333333*G7_0_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_2_1 + 0.133333333333333*G7_2_2 + 0.133333333333333*G10_0_1 + 0.133333333333333*G10_0_2 + 0.133333333333333*G10_1_0 + 0.133333333333333*G10_2_1 + 0.133333333333333*G10_2_2 + 0.133333333333333*G13_0_1 + 0.133333333333333*G13_0_2 + 0.133333333333333*G13_1_0 + 0.133333333333333*G13_2_1 + 0.133333333333333*G13_2_2;
+    A[282] = 0.0;
+    A[283] = 0.0;
+    A[284] = 0.0;
+    A[285] = 0.0;
+    A[286] = 0.0;
+    A[287] = 0.0;
+    A[288] = 0.0;
+    A[289] = 0.0;
+    A[290] = 0.0;
+    A[291] = 0.0;
+    A[292] = 0.0;
+    A[293] = 0.0;
+    A[294] = 0.0;
+    A[295] = 0.0;
+    A[296] = 0.0;
+    A[297] = 0.0;
+    A[298] = 0.0;
+    A[299] = 0.0;
+    A[300] = 0.0;
+    A[301] = 0.0;
+    A[302] = -0.0333333333333333*G4_0 + 0.0333333333333334*G4_1 - 0.0333333333333334*G4_2;
+    A[303] = -0.0333333333333333*G4_0 - 0.0333333333333333*G4_2;
+    A[304] = -0.0666666666666667*G4_0 - 0.0333333333333333*G4_1 - 0.0666666666666666*G4_2;
+    A[305] = -0.0333333333333333*G4_0 - 0.0333333333333333*G4_2;
+    A[306] = -0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_0_2 - 0.0333333333333333*G7_1_0 - 0.0333333333333333*G7_1_1 - 0.0333333333333332*G7_1_2 - 0.0333333333333333*G7_2_0 - 0.0333333333333333*G7_2_1 - 0.0333333333333333*G7_2_2 - 0.133333333333333*G10_0_0 - 0.133333333333333*G10_0_1 - 0.133333333333333*G10_0_2 - 0.0333333333333333*G10_1_0 - 0.0333333333333333*G10_1_1 - 0.0333333333333332*G10_1_2 - 0.0333333333333333*G10_2_0 - 0.0333333333333333*G10_2_1 - 0.0333333333333333*G10_2_2 - 0.133333333333333*G13_0_0 - 0.133333333333333*G13_0_1 - 0.133333333333333*G13_0_2 - 0.0333333333333333*G13_1_0 - 0.0333333333333333*G13_1_1 - 0.0333333333333332*G13_1_2 - 0.0333333333333333*G13_2_0 - 0.0333333333333333*G13_2_1 - 0.0333333333333333*G13_2_2;
+    A[307] = -0.133333333333333*G7_0_0 - 0.1*G7_1_0 - 0.1*G7_2_0 - 0.133333333333333*G10_0_0 - 0.1*G10_1_0 - 0.1*G10_2_0 - 0.133333333333333*G13_0_0 - 0.1*G13_1_0 - 0.1*G13_2_0;
+    A[308] = 0.0333333333333334*G7_1_1 + 0.0333333333333334*G7_2_1 + 0.0333333333333334*G10_1_1 + 0.0333333333333334*G10_2_1 + 0.0333333333333334*G13_1_1 + 0.0333333333333334*G13_2_1;
+    A[309] = 0.0333333333333334*G7_1_2 + 0.0333333333333334*G7_2_2 + 0.0333333333333334*G10_1_2 + 0.0333333333333334*G10_2_2 + 0.0333333333333334*G13_1_2 + 0.0333333333333334*G13_2_2;
+    A[310] = -0.133333333333333*G7_1_1 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_1 - 0.133333333333333*G7_2_2 - 0.133333333333333*G10_1_1 - 0.133333333333333*G10_1_2 - 0.133333333333333*G10_2_1 - 0.133333333333333*G10_2_2 - 0.133333333333333*G13_1_1 - 0.133333333333333*G13_1_2 - 0.133333333333333*G13_2_1 - 0.133333333333333*G13_2_2;
+    A[311] = -0.133333333333333*G7_0_2 - 0.133333333333333*G7_1_0 - 0.266666666666667*G7_1_2 - 0.133333333333333*G7_2_0 - 0.266666666666666*G7_2_2 - 0.133333333333333*G10_0_2 - 0.133333333333333*G10_1_0 - 0.266666666666667*G10_1_2 - 0.133333333333333*G10_2_0 - 0.266666666666666*G10_2_2 - 0.133333333333333*G13_0_2 - 0.133333333333333*G13_1_0 - 0.266666666666667*G13_1_2 - 0.133333333333333*G13_2_0 - 0.266666666666666*G13_2_2;
+    A[312] = -0.133333333333333*G7_0_1 - 0.133333333333333*G7_1_0 - 0.266666666666667*G7_1_1 - 0.133333333333333*G7_2_0 - 0.266666666666666*G7_2_1 - 0.133333333333333*G10_0_1 - 0.133333333333333*G10_1_0 - 0.266666666666667*G10_1_1 - 0.133333333333333*G10_2_0 - 0.266666666666666*G10_2_1 - 0.133333333333333*G13_0_1 - 0.133333333333333*G13_1_0 - 0.266666666666667*G13_1_1 - 0.133333333333333*G13_2_0 - 0.266666666666666*G13_2_1;
+    A[313] = 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_1_1 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_1 + 0.133333333333333*G10_0_2 + 0.133333333333333*G10_1_0 + 0.133333333333333*G10_1_1 + 0.133333333333333*G10_2_0 + 0.133333333333333*G10_2_1 + 0.133333333333333*G13_0_2 + 0.133333333333333*G13_1_0 + 0.133333333333333*G13_1_1 + 0.133333333333333*G13_2_0 + 0.133333333333333*G13_2_1;
+    A[314] = 0.133333333333333*G7_0_1 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_2 + 0.133333333333333*G10_0_1 + 0.133333333333333*G10_1_0 + 0.133333333333333*G10_1_2 + 0.133333333333333*G10_2_0 + 0.133333333333333*G10_2_2 + 0.133333333333333*G13_0_1 + 0.133333333333333*G13_1_0 + 0.133333333333333*G13_1_2 + 0.133333333333333*G13_2_0 + 0.133333333333333*G13_2_2;
+    A[315] = 0.266666666666667*G7_0_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.266666666666667*G7_1_1 + 0.266666666666666*G7_1_2 + 0.133333333333333*G7_2_0 + 0.266666666666666*G7_2_1 + 0.266666666666666*G7_2_2 + 0.266666666666667*G10_0_0 + 0.133333333333333*G10_0_1 + 0.133333333333333*G10_0_2 + 0.133333333333333*G10_1_0 + 0.266666666666667*G10_1_1 + 0.266666666666666*G10_1_2 + 0.133333333333333*G10_2_0 + 0.266666666666666*G10_2_1 + 0.266666666666666*G10_2_2 + 0.266666666666667*G13_0_0 + 0.133333333333333*G13_0_1 + 0.133333333333333*G13_0_2 + 0.133333333333333*G13_1_0 + 0.266666666666667*G13_1_1 + 0.266666666666666*G13_1_2 + 0.133333333333333*G13_2_0 + 0.266666666666666*G13_2_1 + 0.266666666666666*G13_2_2;
+    A[316] = 0.0;
+    A[317] = 0.0;
+    A[318] = 0.0;
+    A[319] = 0.0;
+    A[320] = 0.0;
+    A[321] = 0.0;
+    A[322] = 0.0;
+    A[323] = 0.0;
+    A[324] = 0.0;
+    A[325] = 0.0;
+    A[326] = 0.0;
+    A[327] = 0.0;
+    A[328] = 0.0;
+    A[329] = 0.0;
+    A[330] = 0.0;
+    A[331] = 0.0;
+    A[332] = 0.0;
+    A[333] = 0.0;
+    A[334] = 0.0;
+    A[335] = 0.0;
+    A[336] = 0.0333333333333334*G4_0 - 0.0333333333333333*G4_1 - 0.0333333333333333*G4_2;
+    A[337] = -0.0333333333333333*G4_0 - 0.0666666666666666*G4_1 - 0.0666666666666666*G4_2;
+    A[338] = -0.0333333333333333*G4_1 - 0.0333333333333333*G4_2;
+    A[339] = -0.0333333333333333*G4_1 - 0.0333333333333333*G4_2;
+    A[340] = 0.0;
+    A[341] = 0.0;
+    A[342] = 0.0;
+    A[343] = 0.0;
+    A[344] = 0.0;
+    A[345] = 0.0;
+    A[346] = 0.0;
+    A[347] = 0.0;
+    A[348] = 0.0;
+    A[349] = 0.0;
+    A[350] = 0.1*G8_0_0 + 0.1*G8_0_1 + 0.1*G8_0_2 + 0.1*G8_1_0 + 0.1*G8_1_1 + 0.1*G8_1_2 + 0.1*G8_2_0 + 0.1*G8_2_1 + 0.1*G8_2_2 + 0.1*G11_0_0 + 0.1*G11_0_1 + 0.1*G11_0_2 + 0.1*G11_1_0 + 0.1*G11_1_1 + 0.1*G11_1_2 + 0.1*G11_2_0 + 0.1*G11_2_1 + 0.1*G11_2_2 + 0.1*G14_0_0 + 0.1*G14_0_1 + 0.1*G14_0_2 + 0.1*G14_1_0 + 0.1*G14_1_1 + 0.1*G14_1_2 + 0.1*G14_2_0 + 0.1*G14_2_1 + 0.1*G14_2_2;
+    A[351] = 0.0333333333333333*G8_0_0 + 0.0333333333333334*G8_1_0 + 0.0333333333333333*G8_2_0 + 0.0333333333333333*G11_0_0 + 0.0333333333333334*G11_1_0 + 0.0333333333333333*G11_2_0 + 0.0333333333333333*G14_0_0 + 0.0333333333333334*G14_1_0 + 0.0333333333333333*G14_2_0;
+    A[352] = 0.0333333333333333*G8_0_1 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_2_1 + 0.0333333333333333*G11_0_1 + 0.0333333333333333*G11_1_1 + 0.0333333333333333*G11_2_1 + 0.0333333333333333*G14_0_1 + 0.0333333333333333*G14_1_1 + 0.0333333333333333*G14_2_1;
+    A[353] = 0.0333333333333333*G8_0_2 + 0.0333333333333333*G8_1_2 + 0.0333333333333333*G8_2_2 + 0.0333333333333333*G11_0_2 + 0.0333333333333333*G11_1_2 + 0.0333333333333333*G11_2_2 + 0.0333333333333333*G14_0_2 + 0.0333333333333333*G14_1_2 + 0.0333333333333333*G14_2_2;
+    A[354] = 0.0333333333333332*G8_0_1 + 0.0333333333333332*G8_0_2 + 0.0333333333333332*G8_1_1 + 0.0333333333333332*G8_1_2 + 0.0333333333333332*G8_2_1 + 0.0333333333333332*G8_2_2 + 0.0333333333333332*G11_0_1 + 0.0333333333333332*G11_0_2 + 0.0333333333333332*G11_1_1 + 0.0333333333333332*G11_1_2 + 0.0333333333333332*G11_2_1 + 0.0333333333333332*G11_2_2 + 0.0333333333333332*G14_0_1 + 0.0333333333333332*G14_0_2 + 0.0333333333333332*G14_1_1 + 0.0333333333333332*G14_1_2 + 0.0333333333333332*G14_2_1 + 0.0333333333333332*G14_2_2;
+    A[355] = 0.0333333333333332*G8_0_0 + 0.0333333333333332*G8_0_2 + 0.0333333333333332*G8_1_0 + 0.0333333333333332*G8_1_2 + 0.0333333333333332*G8_2_0 + 0.0333333333333333*G8_2_2 + 0.0333333333333332*G11_0_0 + 0.0333333333333332*G11_0_2 + 0.0333333333333332*G11_1_0 + 0.0333333333333332*G11_1_2 + 0.0333333333333332*G11_2_0 + 0.0333333333333333*G11_2_2 + 0.0333333333333332*G14_0_0 + 0.0333333333333332*G14_0_2 + 0.0333333333333332*G14_1_0 + 0.0333333333333332*G14_1_2 + 0.0333333333333332*G14_2_0 + 0.0333333333333333*G14_2_2;
+    A[356] = 0.0333333333333332*G8_0_0 + 0.0333333333333333*G8_0_1 + 0.0333333333333332*G8_1_0 + 0.0333333333333333*G8_1_1 + 0.0333333333333332*G8_2_0 + 0.0333333333333333*G8_2_1 + 0.0333333333333332*G11_0_0 + 0.0333333333333333*G11_0_1 + 0.0333333333333332*G11_1_0 + 0.0333333333333333*G11_1_1 + 0.0333333333333332*G11_2_0 + 0.0333333333333333*G11_2_1 + 0.0333333333333332*G14_0_0 + 0.0333333333333333*G14_0_1 + 0.0333333333333332*G14_1_0 + 0.0333333333333333*G14_1_1 + 0.0333333333333332*G14_2_0 + 0.0333333333333333*G14_2_1;
+    A[357] = -0.0333333333333332*G8_0_0 - 0.0333333333333332*G8_0_1 - 0.133333333333333*G8_0_2 - 0.0333333333333332*G8_1_0 - 0.0333333333333332*G8_1_1 - 0.133333333333333*G8_1_2 - 0.0333333333333332*G8_2_0 - 0.0333333333333332*G8_2_1 - 0.133333333333333*G8_2_2 - 0.0333333333333332*G11_0_0 - 0.0333333333333332*G11_0_1 - 0.133333333333333*G11_0_2 - 0.0333333333333332*G11_1_0 - 0.0333333333333332*G11_1_1 - 0.133333333333333*G11_1_2 - 0.0333333333333332*G11_2_0 - 0.0333333333333332*G11_2_1 - 0.133333333333333*G11_2_2 - 0.0333333333333332*G14_0_0 - 0.0333333333333332*G14_0_1 - 0.133333333333333*G14_0_2 - 0.0333333333333332*G14_1_0 - 0.0333333333333332*G14_1_1 - 0.133333333333333*G14_1_2 - 0.0333333333333332*G14_2_0 - 0.0333333333333332*G14_2_1 - 0.133333333333333*G14_2_2;
+    A[358] = -0.0333333333333332*G8_0_0 - 0.133333333333333*G8_0_1 - 0.0333333333333332*G8_0_2 - 0.0333333333333332*G8_1_0 - 0.133333333333333*G8_1_1 - 0.0333333333333332*G8_1_2 - 0.0333333333333332*G8_2_0 - 0.133333333333333*G8_2_1 - 0.0333333333333332*G8_2_2 - 0.0333333333333332*G11_0_0 - 0.133333333333333*G11_0_1 - 0.0333333333333332*G11_0_2 - 0.0333333333333332*G11_1_0 - 0.133333333333333*G11_1_1 - 0.0333333333333332*G11_1_2 - 0.0333333333333332*G11_2_0 - 0.133333333333333*G11_2_1 - 0.0333333333333332*G11_2_2 - 0.0333333333333332*G14_0_0 - 0.133333333333333*G14_0_1 - 0.0333333333333332*G14_0_2 - 0.0333333333333332*G14_1_0 - 0.133333333333333*G14_1_1 - 0.0333333333333332*G14_1_2 - 0.0333333333333332*G14_2_0 - 0.133333333333333*G14_2_1 - 0.0333333333333332*G14_2_2;
+    A[359] = -0.133333333333333*G8_0_0 - 0.0333333333333333*G8_0_1 - 0.0333333333333333*G8_0_2 - 0.133333333333333*G8_1_0 - 0.0333333333333333*G8_1_1 - 0.0333333333333333*G8_1_2 - 0.133333333333333*G8_2_0 - 0.0333333333333332*G8_2_1 - 0.0333333333333333*G8_2_2 - 0.133333333333333*G11_0_0 - 0.0333333333333333*G11_0_1 - 0.0333333333333333*G11_0_2 - 0.133333333333333*G11_1_0 - 0.0333333333333333*G11_1_1 - 0.0333333333333333*G11_1_2 - 0.133333333333333*G11_2_0 - 0.0333333333333332*G11_2_1 - 0.0333333333333333*G11_2_2 - 0.133333333333333*G14_0_0 - 0.0333333333333333*G14_0_1 - 0.0333333333333333*G14_0_2 - 0.133333333333333*G14_1_0 - 0.0333333333333333*G14_1_1 - 0.0333333333333333*G14_1_2 - 0.133333333333333*G14_2_0 - 0.0333333333333332*G14_2_1 - 0.0333333333333333*G14_2_2;
+    A[360] = 0.0;
+    A[361] = 0.0;
+    A[362] = 0.0;
+    A[363] = 0.0;
+    A[364] = 0.0;
+    A[365] = 0.0;
+    A[366] = 0.0;
+    A[367] = 0.0;
+    A[368] = 0.0;
+    A[369] = 0.0;
+    A[370] = -0.025*G5_0 - 0.025*G5_1 - 0.025*G5_2;
+    A[371] = 0.00833333333333332*G5_0 + 0.00833333333333332*G5_1 + 0.00833333333333331*G5_2;
+    A[372] = 0.0083333333333333*G5_0 + 0.0083333333333333*G5_1 + 0.0083333333333333*G5_2;
+    A[373] = 0.00833333333333331*G5_0 + 0.00833333333333331*G5_1 + 0.00833333333333331*G5_2;
+    A[374] = 0.0;
+    A[375] = 0.0;
+    A[376] = 0.0;
+    A[377] = 0.0;
+    A[378] = 0.0;
+    A[379] = 0.0;
+    A[380] = 0.0;
+    A[381] = 0.0;
+    A[382] = 0.0;
+    A[383] = 0.0;
+    A[384] = 0.0333333333333333*G8_0_0 + 0.0333333333333334*G8_0_1 + 0.0333333333333333*G8_0_2 + 0.0333333333333333*G11_0_0 + 0.0333333333333334*G11_0_1 + 0.0333333333333333*G11_0_2 + 0.0333333333333333*G14_0_0 + 0.0333333333333334*G14_0_1 + 0.0333333333333333*G14_0_2;
+    A[385] = 0.1*G8_0_0 + 0.1*G11_0_0 + 0.1*G14_0_0;
+    A[386] = -0.0333333333333333*G8_0_1 - 0.0333333333333333*G11_0_1 - 0.0333333333333333*G14_0_1;
+    A[387] = -0.0333333333333333*G8_0_2 - 0.0333333333333333*G11_0_2 - 0.0333333333333333*G14_0_2;
+    A[388] = -0.0333333333333334*G8_0_1 - 0.0333333333333333*G8_0_2 - 0.0333333333333334*G11_0_1 - 0.0333333333333333*G11_0_2 - 0.0333333333333334*G14_0_1 - 0.0333333333333333*G14_0_2;
+    A[389] = -0.0333333333333334*G8_0_0 + 0.1*G8_0_2 - 0.0333333333333334*G11_0_0 + 0.1*G11_0_2 - 0.0333333333333334*G14_0_0 + 0.1*G14_0_2;
+    A[390] = -0.0333333333333333*G8_0_0 + 0.1*G8_0_1 - 0.0333333333333333*G11_0_0 + 0.1*G11_0_1 - 0.0333333333333333*G14_0_0 + 0.1*G14_0_1;
+    A[391] = 0.0333333333333334*G8_0_0 + 0.0333333333333333*G8_0_1 + 0.0333333333333334*G11_0_0 + 0.0333333333333333*G11_0_1 + 0.0333333333333334*G14_0_0 + 0.0333333333333333*G14_0_1;
+    A[392] = 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_0_2 + 0.0333333333333333*G11_0_0 + 0.0333333333333333*G11_0_2 + 0.0333333333333333*G14_0_0 + 0.0333333333333333*G14_0_2;
+    A[393] = -0.133333333333333*G8_0_0 - 0.1*G8_0_1 - 0.1*G8_0_2 - 0.133333333333333*G11_0_0 - 0.1*G11_0_1 - 0.1*G11_0_2 - 0.133333333333333*G14_0_0 - 0.1*G14_0_1 - 0.1*G14_0_2;
+    A[394] = 0.0;
+    A[395] = 0.0;
+    A[396] = 0.0;
+    A[397] = 0.0;
+    A[398] = 0.0;
+    A[399] = 0.0;
+    A[400] = 0.0;
+    A[401] = 0.0;
+    A[402] = 0.0;
+    A[403] = 0.0;
+    A[404] = -0.00833333333333334*G5_0;
+    A[405] = 0.025*G5_0;
+    A[406] = -0.00833333333333333*G5_0;
+    A[407] = -0.00833333333333334*G5_0;
+    A[408] = 0.0;
+    A[409] = 0.0;
+    A[410] = 0.0;
+    A[411] = 0.0;
+    A[412] = 0.0;
+    A[413] = 0.0;
+    A[414] = 0.0;
+    A[415] = 0.0;
+    A[416] = 0.0;
+    A[417] = 0.0;
+    A[418] = 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_1_2 + 0.0333333333333333*G11_1_0 + 0.0333333333333333*G11_1_1 + 0.0333333333333333*G11_1_2 + 0.0333333333333333*G14_1_0 + 0.0333333333333333*G14_1_1 + 0.0333333333333333*G14_1_2;
+    A[419] = -0.0333333333333333*G8_1_0 - 0.0333333333333333*G11_1_0 - 0.0333333333333333*G14_1_0;
+    A[420] = 0.1*G8_1_1 + 0.1*G11_1_1 + 0.1*G14_1_1;
+    A[421] = -0.0333333333333333*G8_1_2 - 0.0333333333333333*G11_1_2 - 0.0333333333333333*G14_1_2;
+    A[422] = -0.0333333333333334*G8_1_1 + 0.1*G8_1_2 - 0.0333333333333334*G11_1_1 + 0.1*G11_1_2 - 0.0333333333333334*G14_1_1 + 0.1*G14_1_2;
+    A[423] = -0.0333333333333334*G8_1_0 - 0.0333333333333334*G8_1_2 - 0.0333333333333334*G11_1_0 - 0.0333333333333334*G11_1_2 - 0.0333333333333334*G14_1_0 - 0.0333333333333334*G14_1_2;
+    A[424] = 0.1*G8_1_0 - 0.0333333333333334*G8_1_1 + 0.1*G11_1_0 - 0.0333333333333334*G11_1_1 + 0.1*G14_1_0 - 0.0333333333333334*G14_1_1;
+    A[425] = 0.0333333333333334*G8_1_0 + 0.0333333333333334*G8_1_1 + 0.0333333333333334*G11_1_0 + 0.0333333333333334*G11_1_1 + 0.0333333333333334*G14_1_0 + 0.0333333333333334*G14_1_1;
+    A[426] = -0.1*G8_1_0 - 0.133333333333333*G8_1_1 - 0.1*G8_1_2 - 0.1*G11_1_0 - 0.133333333333333*G11_1_1 - 0.1*G11_1_2 - 0.1*G14_1_0 - 0.133333333333333*G14_1_1 - 0.1*G14_1_2;
+    A[427] = 0.0333333333333334*G8_1_1 + 0.0333333333333334*G8_1_2 + 0.0333333333333334*G11_1_1 + 0.0333333333333334*G11_1_2 + 0.0333333333333334*G14_1_1 + 0.0333333333333334*G14_1_2;
+    A[428] = 0.0;
+    A[429] = 0.0;
+    A[430] = 0.0;
+    A[431] = 0.0;
+    A[432] = 0.0;
+    A[433] = 0.0;
+    A[434] = 0.0;
+    A[435] = 0.0;
+    A[436] = 0.0;
+    A[437] = 0.0;
+    A[438] = -0.00833333333333335*G5_1;
+    A[439] = -0.00833333333333335*G5_1;
+    A[440] = 0.025*G5_1;
+    A[441] = -0.00833333333333335*G5_1;
+    A[442] = 0.0;
+    A[443] = 0.0;
+    A[444] = 0.0;
+    A[445] = 0.0;
+    A[446] = 0.0;
+    A[447] = 0.0;
+    A[448] = 0.0;
+    A[449] = 0.0;
+    A[450] = 0.0;
+    A[451] = 0.0;
+    A[452] = 0.0333333333333333*G8_2_0 + 0.0333333333333333*G8_2_1 + 0.0333333333333333*G8_2_2 + 0.0333333333333333*G11_2_0 + 0.0333333333333333*G11_2_1 + 0.0333333333333333*G11_2_2 + 0.0333333333333333*G14_2_0 + 0.0333333333333333*G14_2_1 + 0.0333333333333333*G14_2_2;
+    A[453] = -0.0333333333333333*G8_2_0 - 0.0333333333333333*G11_2_0 - 0.0333333333333333*G14_2_0;
+    A[454] = -0.0333333333333333*G8_2_1 - 0.0333333333333333*G11_2_1 - 0.0333333333333333*G14_2_1;
+    A[455] = 0.1*G8_2_2 + 0.1*G11_2_2 + 0.1*G14_2_2;
+    A[456] = 0.1*G8_2_1 - 0.0333333333333334*G8_2_2 + 0.1*G11_2_1 - 0.0333333333333334*G11_2_2 + 0.1*G14_2_1 - 0.0333333333333334*G14_2_2;
+    A[457] = 0.1*G8_2_0 - 0.0333333333333334*G8_2_2 + 0.1*G11_2_0 - 0.0333333333333334*G11_2_2 + 0.1*G14_2_0 - 0.0333333333333334*G14_2_2;
+    A[458] = -0.0333333333333334*G8_2_0 - 0.0333333333333334*G8_2_1 - 0.0333333333333334*G11_2_0 - 0.0333333333333334*G11_2_1 - 0.0333333333333334*G14_2_0 - 0.0333333333333334*G14_2_1;
+    A[459] = -0.1*G8_2_0 - 0.1*G8_2_1 - 0.133333333333333*G8_2_2 - 0.1*G11_2_0 - 0.1*G11_2_1 - 0.133333333333333*G11_2_2 - 0.1*G14_2_0 - 0.1*G14_2_1 - 0.133333333333333*G14_2_2;
+    A[460] = 0.0333333333333334*G8_2_0 + 0.0333333333333334*G8_2_2 + 0.0333333333333334*G11_2_0 + 0.0333333333333334*G11_2_2 + 0.0333333333333334*G14_2_0 + 0.0333333333333334*G14_2_2;
+    A[461] = 0.0333333333333334*G8_2_1 + 0.0333333333333334*G8_2_2 + 0.0333333333333334*G11_2_1 + 0.0333333333333334*G11_2_2 + 0.0333333333333334*G14_2_1 + 0.0333333333333334*G14_2_2;
+    A[462] = 0.0;
+    A[463] = 0.0;
+    A[464] = 0.0;
+    A[465] = 0.0;
+    A[466] = 0.0;
+    A[467] = 0.0;
+    A[468] = 0.0;
+    A[469] = 0.0;
+    A[470] = 0.0;
+    A[471] = 0.0;
+    A[472] = -0.00833333333333335*G5_2;
+    A[473] = -0.00833333333333334*G5_2;
+    A[474] = -0.00833333333333336*G5_2;
+    A[475] = 0.025*G5_2;
+    A[476] = 0.0;
+    A[477] = 0.0;
+    A[478] = 0.0;
+    A[479] = 0.0;
+    A[480] = 0.0;
+    A[481] = 0.0;
+    A[482] = 0.0;
+    A[483] = 0.0;
+    A[484] = 0.0;
+    A[485] = 0.0;
+    A[486] = 0.0333333333333332*G8_1_0 + 0.0333333333333332*G8_1_1 + 0.0333333333333332*G8_1_2 + 0.0333333333333332*G8_2_0 + 0.0333333333333332*G8_2_1 + 0.0333333333333332*G8_2_2 + 0.0333333333333332*G11_1_0 + 0.0333333333333332*G11_1_1 + 0.0333333333333332*G11_1_2 + 0.0333333333333332*G11_2_0 + 0.0333333333333332*G11_2_1 + 0.0333333333333332*G11_2_2 + 0.0333333333333332*G14_1_0 + 0.0333333333333332*G14_1_1 + 0.0333333333333332*G14_1_2 + 0.0333333333333332*G14_2_0 + 0.0333333333333332*G14_2_1 + 0.0333333333333332*G14_2_2;
+    A[487] = -0.0333333333333333*G8_1_0 - 0.0333333333333333*G8_2_0 - 0.0333333333333333*G11_1_0 - 0.0333333333333333*G11_2_0 - 0.0333333333333333*G14_1_0 - 0.0333333333333333*G14_2_0;
+    A[488] = -0.0333333333333334*G8_1_1 + 0.1*G8_2_1 - 0.0333333333333334*G11_1_1 + 0.1*G11_2_1 - 0.0333333333333334*G14_1_1 + 0.1*G14_2_1;
+    A[489] = 0.1*G8_1_2 - 0.0333333333333334*G8_2_2 + 0.1*G11_1_2 - 0.0333333333333334*G11_2_2 + 0.1*G14_1_2 - 0.0333333333333334*G14_2_2;
+    A[490] = 0.266666666666667*G8_1_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_1 + 0.266666666666666*G8_2_2 + 0.266666666666667*G11_1_1 + 0.133333333333333*G11_1_2 + 0.133333333333333*G11_2_1 + 0.266666666666666*G11_2_2 + 0.266666666666667*G14_1_1 + 0.133333333333333*G14_1_2 + 0.133333333333333*G14_2_1 + 0.266666666666666*G14_2_2;
+    A[491] = 0.266666666666667*G8_1_0 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_2 + 0.266666666666667*G11_1_0 + 0.133333333333333*G11_1_2 + 0.133333333333333*G11_2_0 + 0.133333333333333*G11_2_2 + 0.266666666666667*G14_1_0 + 0.133333333333333*G14_1_2 + 0.133333333333333*G14_2_0 + 0.133333333333333*G14_2_2;
+    A[492] = 0.133333333333333*G8_1_0 + 0.133333333333333*G8_1_1 + 0.266666666666666*G8_2_0 + 0.133333333333333*G8_2_1 + 0.133333333333333*G11_1_0 + 0.133333333333333*G11_1_1 + 0.266666666666666*G11_2_0 + 0.133333333333333*G11_2_1 + 0.133333333333333*G14_1_0 + 0.133333333333333*G14_1_1 + 0.266666666666666*G14_2_0 + 0.133333333333333*G14_2_1;
+    A[493] = -0.266666666666667*G8_1_0 - 0.266666666666666*G8_1_1 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_1 - 0.266666666666667*G11_1_0 - 0.266666666666666*G11_1_1 - 0.133333333333333*G11_1_2 - 0.133333333333333*G11_2_0 - 0.133333333333333*G11_2_1 - 0.266666666666667*G14_1_0 - 0.266666666666666*G14_1_1 - 0.133333333333333*G14_1_2 - 0.133333333333333*G14_2_0 - 0.133333333333333*G14_2_1;
+    A[494] = -0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_2 - 0.266666666666666*G8_2_0 - 0.133333333333333*G8_2_1 - 0.266666666666666*G8_2_2 - 0.133333333333333*G11_1_0 - 0.133333333333333*G11_1_2 - 0.266666666666666*G11_2_0 - 0.133333333333333*G11_2_1 - 0.266666666666666*G11_2_2 - 0.133333333333333*G14_1_0 - 0.133333333333333*G14_1_2 - 0.266666666666666*G14_2_0 - 0.133333333333333*G14_2_1 - 0.266666666666666*G14_2_2;
+    A[495] = -0.133333333333333*G8_1_1 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_1 - 0.133333333333333*G8_2_2 - 0.133333333333333*G11_1_1 - 0.133333333333333*G11_1_2 - 0.133333333333333*G11_2_1 - 0.133333333333333*G11_2_2 - 0.133333333333333*G14_1_1 - 0.133333333333333*G14_1_2 - 0.133333333333333*G14_2_1 - 0.133333333333333*G14_2_2;
+    A[496] = 0.0;
+    A[497] = 0.0;
+    A[498] = 0.0;
+    A[499] = 0.0;
+    A[500] = 0.0;
+    A[501] = 0.0;
+    A[502] = 0.0;
+    A[503] = 0.0;
+    A[504] = 0.0;
+    A[505] = 0.0;
+    A[506] = 0.0333333333333334*G5_1 + 0.0333333333333333*G5_2;
+    A[507] = 0.0333333333333333*G5_1 + 0.0333333333333333*G5_2;
+    A[508] = 0.0333333333333333*G5_1 + 0.0666666666666666*G5_2;
+    A[509] = 0.0666666666666667*G5_1 + 0.0333333333333333*G5_2;
+    A[510] = 0.0;
+    A[511] = 0.0;
+    A[512] = 0.0;
+    A[513] = 0.0;
+    A[514] = 0.0;
+    A[515] = 0.0;
+    A[516] = 0.0;
+    A[517] = 0.0;
+    A[518] = 0.0;
+    A[519] = 0.0;
+    A[520] = 0.0333333333333332*G8_0_0 + 0.0333333333333332*G8_0_1 + 0.0333333333333332*G8_0_2 + 0.0333333333333332*G8_2_0 + 0.0333333333333332*G8_2_1 + 0.0333333333333332*G8_2_2 + 0.0333333333333332*G11_0_0 + 0.0333333333333332*G11_0_1 + 0.0333333333333332*G11_0_2 + 0.0333333333333332*G11_2_0 + 0.0333333333333332*G11_2_1 + 0.0333333333333332*G11_2_2 + 0.0333333333333332*G14_0_0 + 0.0333333333333332*G14_0_1 + 0.0333333333333332*G14_0_2 + 0.0333333333333332*G14_2_0 + 0.0333333333333332*G14_2_1 + 0.0333333333333332*G14_2_2;
+    A[521] = -0.0333333333333334*G8_0_0 + 0.1*G8_2_0 - 0.0333333333333334*G11_0_0 + 0.1*G11_2_0 - 0.0333333333333334*G14_0_0 + 0.1*G14_2_0;
+    A[522] = -0.0333333333333334*G8_0_1 - 0.0333333333333334*G8_2_1 - 0.0333333333333334*G11_0_1 - 0.0333333333333334*G11_2_1 - 0.0333333333333334*G14_0_1 - 0.0333333333333334*G14_2_1;
+    A[523] = 0.1*G8_0_2 - 0.0333333333333334*G8_2_2 + 0.1*G11_0_2 - 0.0333333333333334*G11_2_2 + 0.1*G14_0_2 - 0.0333333333333334*G14_2_2;
+    A[524] = 0.266666666666667*G8_0_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_2_1 + 0.133333333333333*G8_2_2 + 0.266666666666667*G11_0_1 + 0.133333333333333*G11_0_2 + 0.133333333333333*G11_2_1 + 0.133333333333333*G11_2_2 + 0.266666666666667*G14_0_1 + 0.133333333333333*G14_0_2 + 0.133333333333333*G14_2_1 + 0.133333333333333*G14_2_2;
+    A[525] = 0.266666666666666*G8_0_0 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_2_0 + 0.266666666666667*G8_2_2 + 0.266666666666666*G11_0_0 + 0.133333333333333*G11_0_2 + 0.133333333333333*G11_2_0 + 0.266666666666667*G11_2_2 + 0.266666666666666*G14_0_0 + 0.133333333333333*G14_0_2 + 0.133333333333333*G14_2_0 + 0.266666666666667*G14_2_2;
+    A[526] = 0.133333333333333*G8_0_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_2_0 + 0.266666666666667*G8_2_1 + 0.133333333333333*G11_0_0 + 0.133333333333333*G11_0_1 + 0.133333333333333*G11_2_0 + 0.266666666666667*G11_2_1 + 0.133333333333333*G14_0_0 + 0.133333333333333*G14_0_1 + 0.133333333333333*G14_2_0 + 0.266666666666667*G14_2_1;
+    A[527] = -0.266666666666666*G8_0_0 - 0.266666666666666*G8_0_1 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_1 - 0.266666666666666*G11_0_0 - 0.266666666666666*G11_0_1 - 0.133333333333333*G11_0_2 - 0.133333333333333*G11_2_0 - 0.133333333333333*G11_2_1 - 0.266666666666666*G14_0_0 - 0.266666666666666*G14_0_1 - 0.133333333333333*G14_0_2 - 0.133333333333333*G14_2_0 - 0.133333333333333*G14_2_1;
+    A[528] = -0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_2 - 0.133333333333333*G11_0_0 - 0.133333333333333*G11_0_2 - 0.133333333333333*G11_2_0 - 0.133333333333333*G11_2_2 - 0.133333333333333*G14_0_0 - 0.133333333333333*G14_0_2 - 0.133333333333333*G14_2_0 - 0.133333333333333*G14_2_2;
+    A[529] = -0.133333333333333*G8_0_1 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_2_0 - 0.266666666666667*G8_2_1 - 0.266666666666666*G8_2_2 - 0.133333333333333*G11_0_1 - 0.133333333333333*G11_0_2 - 0.133333333333333*G11_2_0 - 0.266666666666667*G11_2_1 - 0.266666666666666*G11_2_2 - 0.133333333333333*G14_0_1 - 0.133333333333333*G14_0_2 - 0.133333333333333*G14_2_0 - 0.266666666666667*G14_2_1 - 0.266666666666666*G14_2_2;
+    A[530] = 0.0;
+    A[531] = 0.0;
+    A[532] = 0.0;
+    A[533] = 0.0;
+    A[534] = 0.0;
+    A[535] = 0.0;
+    A[536] = 0.0;
+    A[537] = 0.0;
+    A[538] = 0.0;
+    A[539] = 0.0;
+    A[540] = 0.0333333333333333*G5_0 + 0.0333333333333333*G5_2;
+    A[541] = 0.0333333333333333*G5_0 + 0.0666666666666666*G5_2;
+    A[542] = 0.0333333333333333*G5_0 + 0.0333333333333333*G5_2;
+    A[543] = 0.0666666666666666*G5_0 + 0.0333333333333333*G5_2;
+    A[544] = 0.0;
+    A[545] = 0.0;
+    A[546] = 0.0;
+    A[547] = 0.0;
+    A[548] = 0.0;
+    A[549] = 0.0;
+    A[550] = 0.0;
+    A[551] = 0.0;
+    A[552] = 0.0;
+    A[553] = 0.0;
+    A[554] = 0.0333333333333332*G8_0_0 + 0.0333333333333332*G8_0_1 + 0.0333333333333332*G8_0_2 + 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_1_1 + 0.0333333333333332*G8_1_2 + 0.0333333333333332*G11_0_0 + 0.0333333333333332*G11_0_1 + 0.0333333333333332*G11_0_2 + 0.0333333333333333*G11_1_0 + 0.0333333333333333*G11_1_1 + 0.0333333333333332*G11_1_2 + 0.0333333333333332*G14_0_0 + 0.0333333333333332*G14_0_1 + 0.0333333333333332*G14_0_2 + 0.0333333333333333*G14_1_0 + 0.0333333333333333*G14_1_1 + 0.0333333333333332*G14_1_2;
+    A[555] = -0.0333333333333333*G8_0_0 + 0.1*G8_1_0 - 0.0333333333333333*G11_0_0 + 0.1*G11_1_0 - 0.0333333333333333*G14_0_0 + 0.1*G14_1_0;
+    A[556] = 0.1*G8_0_1 - 0.0333333333333334*G8_1_1 + 0.1*G11_0_1 - 0.0333333333333334*G11_1_1 + 0.1*G14_0_1 - 0.0333333333333334*G14_1_1;
+    A[557] = -0.0333333333333334*G8_0_2 - 0.0333333333333334*G8_1_2 - 0.0333333333333334*G11_0_2 - 0.0333333333333334*G11_1_2 - 0.0333333333333334*G14_0_2 - 0.0333333333333334*G14_1_2;
+    A[558] = 0.133333333333333*G8_0_1 + 0.266666666666666*G8_0_2 + 0.133333333333333*G8_1_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G11_0_1 + 0.266666666666666*G11_0_2 + 0.133333333333333*G11_1_1 + 0.133333333333333*G11_1_2 + 0.133333333333333*G14_0_1 + 0.266666666666666*G14_0_2 + 0.133333333333333*G14_1_1 + 0.133333333333333*G14_1_2;
+    A[559] = 0.133333333333333*G8_0_0 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.266666666666667*G8_1_2 + 0.133333333333333*G11_0_0 + 0.133333333333333*G11_0_2 + 0.133333333333333*G11_1_0 + 0.266666666666667*G11_1_2 + 0.133333333333333*G14_0_0 + 0.133333333333333*G14_0_2 + 0.133333333333333*G14_1_0 + 0.266666666666667*G14_1_2;
+    A[560] = 0.266666666666666*G8_0_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_1_0 + 0.266666666666667*G8_1_1 + 0.266666666666666*G11_0_0 + 0.133333333333333*G11_0_1 + 0.133333333333333*G11_1_0 + 0.266666666666667*G11_1_1 + 0.266666666666666*G14_0_0 + 0.133333333333333*G14_0_1 + 0.133333333333333*G14_1_0 + 0.266666666666667*G14_1_1;
+    A[561] = -0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_1 - 0.133333333333333*G11_0_0 - 0.133333333333333*G11_0_1 - 0.133333333333333*G11_1_0 - 0.133333333333333*G11_1_1 - 0.133333333333333*G14_0_0 - 0.133333333333333*G14_0_1 - 0.133333333333333*G14_1_0 - 0.133333333333333*G14_1_1;
+    A[562] = -0.266666666666666*G8_0_0 - 0.133333333333333*G8_0_1 - 0.266666666666666*G8_0_2 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_2 - 0.266666666666666*G11_0_0 - 0.133333333333333*G11_0_1 - 0.266666666666666*G11_0_2 - 0.133333333333333*G11_1_0 - 0.133333333333333*G11_1_2 - 0.266666666666666*G14_0_0 - 0.133333333333333*G14_0_1 - 0.266666666666666*G14_0_2 - 0.133333333333333*G14_1_0 - 0.133333333333333*G14_1_2;
+    A[563] = -0.133333333333333*G8_0_1 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_1_0 - 0.266666666666667*G8_1_1 - 0.266666666666666*G8_1_2 - 0.133333333333333*G11_0_1 - 0.133333333333333*G11_0_2 - 0.133333333333333*G11_1_0 - 0.266666666666667*G11_1_1 - 0.266666666666666*G11_1_2 - 0.133333333333333*G14_0_1 - 0.133333333333333*G14_0_2 - 0.133333333333333*G14_1_0 - 0.266666666666667*G14_1_1 - 0.266666666666666*G14_1_2;
+    A[564] = 0.0;
+    A[565] = 0.0;
+    A[566] = 0.0;
+    A[567] = 0.0;
+    A[568] = 0.0;
+    A[569] = 0.0;
+    A[570] = 0.0;
+    A[571] = 0.0;
+    A[572] = 0.0;
+    A[573] = 0.0;
+    A[574] = 0.0333333333333333*G5_0 + 0.0333333333333334*G5_1;
+    A[575] = 0.0333333333333333*G5_0 + 0.0666666666666666*G5_1;
+    A[576] = 0.0666666666666666*G5_0 + 0.0333333333333333*G5_1;
+    A[577] = 0.0333333333333333*G5_0 + 0.0333333333333333*G5_1;
+    A[578] = 0.0;
+    A[579] = 0.0;
+    A[580] = 0.0;
+    A[581] = 0.0;
+    A[582] = 0.0;
+    A[583] = 0.0;
+    A[584] = 0.0;
+    A[585] = 0.0;
+    A[586] = 0.0;
+    A[587] = 0.0;
+    A[588] = -0.0333333333333332*G8_0_0 - 0.0333333333333332*G8_0_1 - 0.0333333333333332*G8_0_2 - 0.0333333333333332*G8_1_0 - 0.0333333333333332*G8_1_1 - 0.0333333333333332*G8_1_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_1 - 0.133333333333333*G8_2_2 - 0.0333333333333332*G11_0_0 - 0.0333333333333332*G11_0_1 - 0.0333333333333332*G11_0_2 - 0.0333333333333332*G11_1_0 - 0.0333333333333332*G11_1_1 - 0.0333333333333332*G11_1_2 - 0.133333333333333*G11_2_0 - 0.133333333333333*G11_2_1 - 0.133333333333333*G11_2_2 - 0.0333333333333332*G14_0_0 - 0.0333333333333332*G14_0_1 - 0.0333333333333332*G14_0_2 - 0.0333333333333332*G14_1_0 - 0.0333333333333332*G14_1_1 - 0.0333333333333332*G14_1_2 - 0.133333333333333*G14_2_0 - 0.133333333333333*G14_2_1 - 0.133333333333333*G14_2_2;
+    A[589] = 0.0333333333333334*G8_0_0 + 0.0333333333333334*G8_1_0 + 0.0333333333333334*G11_0_0 + 0.0333333333333334*G11_1_0 + 0.0333333333333334*G14_0_0 + 0.0333333333333334*G14_1_0;
+    A[590] = 0.0333333333333334*G8_0_1 + 0.0333333333333334*G8_1_1 + 0.0333333333333334*G11_0_1 + 0.0333333333333334*G11_1_1 + 0.0333333333333334*G14_0_1 + 0.0333333333333334*G14_1_1;
+    A[591] = -0.1*G8_0_2 - 0.1*G8_1_2 - 0.133333333333333*G8_2_2 - 0.1*G11_0_2 - 0.1*G11_1_2 - 0.133333333333333*G11_2_2 - 0.1*G14_0_2 - 0.1*G14_1_2 - 0.133333333333333*G14_2_2;
+    A[592] = -0.266666666666667*G8_0_1 - 0.133333333333333*G8_0_2 - 0.266666666666667*G8_1_1 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_1 - 0.266666666666667*G11_0_1 - 0.133333333333333*G11_0_2 - 0.266666666666667*G11_1_1 - 0.133333333333333*G11_1_2 - 0.133333333333333*G11_2_1 - 0.266666666666667*G14_0_1 - 0.133333333333333*G14_0_2 - 0.266666666666667*G14_1_1 - 0.133333333333333*G14_1_2 - 0.133333333333333*G14_2_1;
+    A[593] = -0.266666666666666*G8_0_0 - 0.133333333333333*G8_0_2 - 0.266666666666666*G8_1_0 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_0 - 0.266666666666666*G11_0_0 - 0.133333333333333*G11_0_2 - 0.266666666666666*G11_1_0 - 0.133333333333333*G11_1_2 - 0.133333333333333*G11_2_0 - 0.266666666666666*G14_0_0 - 0.133333333333333*G14_0_2 - 0.266666666666666*G14_1_0 - 0.133333333333333*G14_1_2 - 0.133333333333333*G14_2_0;
+    A[594] = -0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_1 - 0.133333333333333*G11_0_0 - 0.133333333333333*G11_0_1 - 0.133333333333333*G11_1_0 - 0.133333333333333*G11_1_1 - 0.133333333333333*G14_0_0 - 0.133333333333333*G14_0_1 - 0.133333333333333*G14_1_0 - 0.133333333333333*G14_1_1;
+    A[595] = 0.266666666666666*G8_0_0 + 0.266666666666666*G8_0_1 + 0.133333333333333*G8_0_2 + 0.266666666666666*G8_1_0 + 0.266666666666666*G8_1_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_1 + 0.266666666666667*G8_2_2 + 0.266666666666666*G11_0_0 + 0.266666666666666*G11_0_1 + 0.133333333333333*G11_0_2 + 0.266666666666666*G11_1_0 + 0.266666666666666*G11_1_1 + 0.133333333333333*G11_1_2 + 0.133333333333333*G11_2_0 + 0.133333333333333*G11_2_1 + 0.266666666666667*G11_2_2 + 0.266666666666666*G14_0_0 + 0.266666666666666*G14_0_1 + 0.133333333333333*G14_0_2 + 0.266666666666666*G14_1_0 + 0.266666666666666*G14_1_1 + 0.133333333333333*G14_1_2 + 0.133333333333333*G14_2_0 + 0.133333333333333*G14_2_1 + 0.266666666666667*G14_2_2;
+    A[596] = 0.133333333333333*G8_0_0 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_1 + 0.133333333333333*G11_0_0 + 0.133333333333333*G11_0_2 + 0.133333333333333*G11_1_0 + 0.133333333333333*G11_1_2 + 0.133333333333333*G11_2_1 + 0.133333333333333*G14_0_0 + 0.133333333333333*G14_0_2 + 0.133333333333333*G14_1_0 + 0.133333333333333*G14_1_2 + 0.133333333333333*G14_2_1;
+    A[597] = 0.133333333333333*G8_0_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G11_0_1 + 0.133333333333333*G11_0_2 + 0.133333333333333*G11_1_1 + 0.133333333333333*G11_1_2 + 0.133333333333333*G11_2_0 + 0.133333333333333*G14_0_1 + 0.133333333333333*G14_0_2 + 0.133333333333333*G14_1_1 + 0.133333333333333*G14_1_2 + 0.133333333333333*G14_2_0;
+    A[598] = 0.0;
+    A[599] = 0.0;
+    A[600] = 0.0;
+    A[601] = 0.0;
+    A[602] = 0.0;
+    A[603] = 0.0;
+    A[604] = 0.0;
+    A[605] = 0.0;
+    A[606] = 0.0;
+    A[607] = 0.0;
+    A[608] = -0.0333333333333333*G5_0 - 0.0333333333333333*G5_1 + 0.0333333333333333*G5_2;
+    A[609] = -0.0333333333333333*G5_0 - 0.0333333333333333*G5_1;
+    A[610] = -0.0333333333333333*G5_0 - 0.0333333333333333*G5_1;
+    A[611] = -0.0666666666666666*G5_0 - 0.0666666666666666*G5_1 - 0.0333333333333333*G5_2;
+    A[612] = 0.0;
+    A[613] = 0.0;
+    A[614] = 0.0;
+    A[615] = 0.0;
+    A[616] = 0.0;
+    A[617] = 0.0;
+    A[618] = 0.0;
+    A[619] = 0.0;
+    A[620] = 0.0;
+    A[621] = 0.0;
+    A[622] = -0.0333333333333332*G8_0_0 - 0.0333333333333332*G8_0_1 - 0.0333333333333332*G8_0_2 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_1 - 0.133333333333333*G8_1_2 - 0.0333333333333332*G8_2_0 - 0.0333333333333332*G8_2_1 - 0.0333333333333332*G8_2_2 - 0.0333333333333332*G11_0_0 - 0.0333333333333332*G11_0_1 - 0.0333333333333332*G11_0_2 - 0.133333333333333*G11_1_0 - 0.133333333333333*G11_1_1 - 0.133333333333333*G11_1_2 - 0.0333333333333332*G11_2_0 - 0.0333333333333332*G11_2_1 - 0.0333333333333332*G11_2_2 - 0.0333333333333332*G14_0_0 - 0.0333333333333332*G14_0_1 - 0.0333333333333332*G14_0_2 - 0.133333333333333*G14_1_0 - 0.133333333333333*G14_1_1 - 0.133333333333333*G14_1_2 - 0.0333333333333332*G14_2_0 - 0.0333333333333332*G14_2_1 - 0.0333333333333332*G14_2_2;
+    A[623] = 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_2_0 + 0.0333333333333333*G11_0_0 + 0.0333333333333333*G11_2_0 + 0.0333333333333333*G14_0_0 + 0.0333333333333333*G14_2_0;
+    A[624] = -0.1*G8_0_1 - 0.133333333333333*G8_1_1 - 0.1*G8_2_1 - 0.1*G11_0_1 - 0.133333333333333*G11_1_1 - 0.1*G11_2_1 - 0.1*G14_0_1 - 0.133333333333333*G14_1_1 - 0.1*G14_2_1;
+    A[625] = 0.0333333333333334*G8_0_2 + 0.0333333333333334*G8_2_2 + 0.0333333333333334*G11_0_2 + 0.0333333333333334*G11_2_2 + 0.0333333333333334*G14_0_2 + 0.0333333333333334*G14_2_2;
+    A[626] = -0.133333333333333*G8_0_1 - 0.266666666666666*G8_0_2 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_1 - 0.266666666666666*G8_2_2 - 0.133333333333333*G11_0_1 - 0.266666666666666*G11_0_2 - 0.133333333333333*G11_1_2 - 0.133333333333333*G11_2_1 - 0.266666666666666*G11_2_2 - 0.133333333333333*G14_0_1 - 0.266666666666666*G14_0_2 - 0.133333333333333*G14_1_2 - 0.133333333333333*G14_2_1 - 0.266666666666666*G14_2_2;
+    A[627] = -0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_2 - 0.133333333333333*G11_0_0 - 0.133333333333333*G11_0_2 - 0.133333333333333*G11_2_0 - 0.133333333333333*G11_2_2 - 0.133333333333333*G14_0_0 - 0.133333333333333*G14_0_2 - 0.133333333333333*G14_2_0 - 0.133333333333333*G14_2_2;
+    A[628] = -0.266666666666666*G8_0_0 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_1_0 - 0.266666666666666*G8_2_0 - 0.133333333333333*G8_2_1 - 0.266666666666666*G11_0_0 - 0.133333333333333*G11_0_1 - 0.133333333333333*G11_1_0 - 0.266666666666666*G11_2_0 - 0.133333333333333*G11_2_1 - 0.266666666666666*G14_0_0 - 0.133333333333333*G14_0_1 - 0.133333333333333*G14_1_0 - 0.266666666666666*G14_2_0 - 0.133333333333333*G14_2_1;
+    A[629] = 0.133333333333333*G8_0_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_1 + 0.133333333333333*G11_0_0 + 0.133333333333333*G11_0_1 + 0.133333333333333*G11_1_2 + 0.133333333333333*G11_2_0 + 0.133333333333333*G11_2_1 + 0.133333333333333*G14_0_0 + 0.133333333333333*G14_0_1 + 0.133333333333333*G14_1_2 + 0.133333333333333*G14_2_0 + 0.133333333333333*G14_2_1;
+    A[630] = 0.266666666666666*G8_0_0 + 0.133333333333333*G8_0_1 + 0.266666666666666*G8_0_2 + 0.133333333333333*G8_1_0 + 0.266666666666666*G8_1_1 + 0.133333333333333*G8_1_2 + 0.266666666666666*G8_2_0 + 0.133333333333333*G8_2_1 + 0.266666666666666*G8_2_2 + 0.266666666666666*G11_0_0 + 0.133333333333333*G11_0_1 + 0.266666666666666*G11_0_2 + 0.133333333333333*G11_1_0 + 0.266666666666666*G11_1_1 + 0.133333333333333*G11_1_2 + 0.266666666666666*G11_2_0 + 0.133333333333333*G11_2_1 + 0.266666666666666*G11_2_2 + 0.266666666666666*G14_0_0 + 0.133333333333333*G14_0_1 + 0.266666666666666*G14_0_2 + 0.133333333333333*G14_1_0 + 0.266666666666666*G14_1_1 + 0.133333333333333*G14_1_2 + 0.266666666666666*G14_2_0 + 0.133333333333333*G14_2_1 + 0.266666666666666*G14_2_2;
+    A[631] = 0.133333333333333*G8_0_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_2_1 + 0.133333333333333*G8_2_2 + 0.133333333333333*G11_0_1 + 0.133333333333333*G11_0_2 + 0.133333333333333*G11_1_0 + 0.133333333333333*G11_2_1 + 0.133333333333333*G11_2_2 + 0.133333333333333*G14_0_1 + 0.133333333333333*G14_0_2 + 0.133333333333333*G14_1_0 + 0.133333333333333*G14_2_1 + 0.133333333333333*G14_2_2;
+    A[632] = 0.0;
+    A[633] = 0.0;
+    A[634] = 0.0;
+    A[635] = 0.0;
+    A[636] = 0.0;
+    A[637] = 0.0;
+    A[638] = 0.0;
+    A[639] = 0.0;
+    A[640] = 0.0;
+    A[641] = 0.0;
+    A[642] = -0.0333333333333333*G5_0 + 0.0333333333333334*G5_1 - 0.0333333333333334*G5_2;
+    A[643] = -0.0333333333333333*G5_0 - 0.0333333333333333*G5_2;
+    A[644] = -0.0666666666666667*G5_0 - 0.0333333333333333*G5_1 - 0.0666666666666666*G5_2;
+    A[645] = -0.0333333333333333*G5_0 - 0.0333333333333333*G5_2;
+    A[646] = 0.0;
+    A[647] = 0.0;
+    A[648] = 0.0;
+    A[649] = 0.0;
+    A[650] = 0.0;
+    A[651] = 0.0;
+    A[652] = 0.0;
+    A[653] = 0.0;
+    A[654] = 0.0;
+    A[655] = 0.0;
+    A[656] = -0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_0_2 - 0.0333333333333333*G8_1_0 - 0.0333333333333333*G8_1_1 - 0.0333333333333332*G8_1_2 - 0.0333333333333333*G8_2_0 - 0.0333333333333333*G8_2_1 - 0.0333333333333333*G8_2_2 - 0.133333333333333*G11_0_0 - 0.133333333333333*G11_0_1 - 0.133333333333333*G11_0_2 - 0.0333333333333333*G11_1_0 - 0.0333333333333333*G11_1_1 - 0.0333333333333332*G11_1_2 - 0.0333333333333333*G11_2_0 - 0.0333333333333333*G11_2_1 - 0.0333333333333333*G11_2_2 - 0.133333333333333*G14_0_0 - 0.133333333333333*G14_0_1 - 0.133333333333333*G14_0_2 - 0.0333333333333333*G14_1_0 - 0.0333333333333333*G14_1_1 - 0.0333333333333332*G14_1_2 - 0.0333333333333333*G14_2_0 - 0.0333333333333333*G14_2_1 - 0.0333333333333333*G14_2_2;
+    A[657] = -0.133333333333333*G8_0_0 - 0.1*G8_1_0 - 0.1*G8_2_0 - 0.133333333333333*G11_0_0 - 0.1*G11_1_0 - 0.1*G11_2_0 - 0.133333333333333*G14_0_0 - 0.1*G14_1_0 - 0.1*G14_2_0;
+    A[658] = 0.0333333333333334*G8_1_1 + 0.0333333333333334*G8_2_1 + 0.0333333333333334*G11_1_1 + 0.0333333333333334*G11_2_1 + 0.0333333333333334*G14_1_1 + 0.0333333333333334*G14_2_1;
+    A[659] = 0.0333333333333334*G8_1_2 + 0.0333333333333334*G8_2_2 + 0.0333333333333334*G11_1_2 + 0.0333333333333334*G11_2_2 + 0.0333333333333334*G14_1_2 + 0.0333333333333334*G14_2_2;
+    A[660] = -0.133333333333333*G8_1_1 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_1 - 0.133333333333333*G8_2_2 - 0.133333333333333*G11_1_1 - 0.133333333333333*G11_1_2 - 0.133333333333333*G11_2_1 - 0.133333333333333*G11_2_2 - 0.133333333333333*G14_1_1 - 0.133333333333333*G14_1_2 - 0.133333333333333*G14_2_1 - 0.133333333333333*G14_2_2;
+    A[661] = -0.133333333333333*G8_0_2 - 0.133333333333333*G8_1_0 - 0.266666666666667*G8_1_2 - 0.133333333333333*G8_2_0 - 0.266666666666666*G8_2_2 - 0.133333333333333*G11_0_2 - 0.133333333333333*G11_1_0 - 0.266666666666667*G11_1_2 - 0.133333333333333*G11_2_0 - 0.266666666666666*G11_2_2 - 0.133333333333333*G14_0_2 - 0.133333333333333*G14_1_0 - 0.266666666666667*G14_1_2 - 0.133333333333333*G14_2_0 - 0.266666666666666*G14_2_2;
+    A[662] = -0.133333333333333*G8_0_1 - 0.133333333333333*G8_1_0 - 0.266666666666667*G8_1_1 - 0.133333333333333*G8_2_0 - 0.266666666666666*G8_2_1 - 0.133333333333333*G11_0_1 - 0.133333333333333*G11_1_0 - 0.266666666666667*G11_1_1 - 0.133333333333333*G11_2_0 - 0.266666666666666*G11_2_1 - 0.133333333333333*G14_0_1 - 0.133333333333333*G14_1_0 - 0.266666666666667*G14_1_1 - 0.133333333333333*G14_2_0 - 0.266666666666666*G14_2_1;
+    A[663] = 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_1_1 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_1 + 0.133333333333333*G11_0_2 + 0.133333333333333*G11_1_0 + 0.133333333333333*G11_1_1 + 0.133333333333333*G11_2_0 + 0.133333333333333*G11_2_1 + 0.133333333333333*G14_0_2 + 0.133333333333333*G14_1_0 + 0.133333333333333*G14_1_1 + 0.133333333333333*G14_2_0 + 0.133333333333333*G14_2_1;
+    A[664] = 0.133333333333333*G8_0_1 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_2 + 0.133333333333333*G11_0_1 + 0.133333333333333*G11_1_0 + 0.133333333333333*G11_1_2 + 0.133333333333333*G11_2_0 + 0.133333333333333*G11_2_2 + 0.133333333333333*G14_0_1 + 0.133333333333333*G14_1_0 + 0.133333333333333*G14_1_2 + 0.133333333333333*G14_2_0 + 0.133333333333333*G14_2_2;
+    A[665] = 0.266666666666667*G8_0_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.266666666666667*G8_1_1 + 0.266666666666666*G8_1_2 + 0.133333333333333*G8_2_0 + 0.266666666666666*G8_2_1 + 0.266666666666666*G8_2_2 + 0.266666666666667*G11_0_0 + 0.133333333333333*G11_0_1 + 0.133333333333333*G11_0_2 + 0.133333333333333*G11_1_0 + 0.266666666666667*G11_1_1 + 0.266666666666666*G11_1_2 + 0.133333333333333*G11_2_0 + 0.266666666666666*G11_2_1 + 0.266666666666666*G11_2_2 + 0.266666666666667*G14_0_0 + 0.133333333333333*G14_0_1 + 0.133333333333333*G14_0_2 + 0.133333333333333*G14_1_0 + 0.266666666666667*G14_1_1 + 0.266666666666666*G14_1_2 + 0.133333333333333*G14_2_0 + 0.266666666666666*G14_2_1 + 0.266666666666666*G14_2_2;
+    A[666] = 0.0;
+    A[667] = 0.0;
+    A[668] = 0.0;
+    A[669] = 0.0;
+    A[670] = 0.0;
+    A[671] = 0.0;
+    A[672] = 0.0;
+    A[673] = 0.0;
+    A[674] = 0.0;
+    A[675] = 0.0;
+    A[676] = 0.0333333333333334*G5_0 - 0.0333333333333333*G5_1 - 0.0333333333333333*G5_2;
+    A[677] = -0.0333333333333333*G5_0 - 0.0666666666666666*G5_1 - 0.0666666666666666*G5_2;
+    A[678] = -0.0333333333333333*G5_1 - 0.0333333333333333*G5_2;
+    A[679] = -0.0333333333333333*G5_1 - 0.0333333333333333*G5_2;
+    A[680] = 0.0;
+    A[681] = 0.0;
+    A[682] = 0.0;
+    A[683] = 0.0;
+    A[684] = 0.0;
+    A[685] = 0.0;
+    A[686] = 0.0;
+    A[687] = 0.0;
+    A[688] = 0.0;
+    A[689] = 0.0;
+    A[690] = 0.0;
+    A[691] = 0.0;
+    A[692] = 0.0;
+    A[693] = 0.0;
+    A[694] = 0.0;
+    A[695] = 0.0;
+    A[696] = 0.0;
+    A[697] = 0.0;
+    A[698] = 0.0;
+    A[699] = 0.0;
+    A[700] = 0.1*G6_0_0 + 0.1*G6_0_1 + 0.1*G6_0_2 + 0.1*G6_1_0 + 0.1*G6_1_1 + 0.1*G6_1_2 + 0.1*G6_2_0 + 0.1*G6_2_1 + 0.1*G6_2_2 + 0.1*G9_0_0 + 0.1*G9_0_1 + 0.1*G9_0_2 + 0.1*G9_1_0 + 0.1*G9_1_1 + 0.1*G9_1_2 + 0.1*G9_2_0 + 0.1*G9_2_1 + 0.1*G9_2_2 + 0.1*G12_0_0 + 0.1*G12_0_1 + 0.1*G12_0_2 + 0.1*G12_1_0 + 0.1*G12_1_1 + 0.1*G12_1_2 + 0.1*G12_2_0 + 0.1*G12_2_1 + 0.1*G12_2_2;
+    A[701] = 0.0333333333333333*G6_0_0 + 0.0333333333333334*G6_1_0 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G9_0_0 + 0.0333333333333334*G9_1_0 + 0.0333333333333333*G9_2_0 + 0.0333333333333333*G12_0_0 + 0.0333333333333334*G12_1_0 + 0.0333333333333333*G12_2_0;
+    A[702] = 0.0333333333333333*G6_0_1 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G9_0_1 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_2_1 + 0.0333333333333333*G12_0_1 + 0.0333333333333333*G12_1_1 + 0.0333333333333333*G12_2_1;
+    A[703] = 0.0333333333333333*G6_0_2 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_0_2 + 0.0333333333333333*G9_1_2 + 0.0333333333333333*G9_2_2 + 0.0333333333333333*G12_0_2 + 0.0333333333333333*G12_1_2 + 0.0333333333333333*G12_2_2;
+    A[704] = 0.0333333333333332*G6_0_1 + 0.0333333333333332*G6_0_2 + 0.0333333333333332*G6_1_1 + 0.0333333333333332*G6_1_2 + 0.0333333333333332*G6_2_1 + 0.0333333333333332*G6_2_2 + 0.0333333333333332*G9_0_1 + 0.0333333333333332*G9_0_2 + 0.0333333333333332*G9_1_1 + 0.0333333333333332*G9_1_2 + 0.0333333333333332*G9_2_1 + 0.0333333333333332*G9_2_2 + 0.0333333333333332*G12_0_1 + 0.0333333333333332*G12_0_2 + 0.0333333333333332*G12_1_1 + 0.0333333333333332*G12_1_2 + 0.0333333333333332*G12_2_1 + 0.0333333333333332*G12_2_2;
+    A[705] = 0.0333333333333332*G6_0_0 + 0.0333333333333332*G6_0_2 + 0.0333333333333332*G6_1_0 + 0.0333333333333332*G6_1_2 + 0.0333333333333332*G6_2_0 + 0.0333333333333333*G6_2_2 + 0.0333333333333332*G9_0_0 + 0.0333333333333332*G9_0_2 + 0.0333333333333332*G9_1_0 + 0.0333333333333332*G9_1_2 + 0.0333333333333332*G9_2_0 + 0.0333333333333333*G9_2_2 + 0.0333333333333332*G12_0_0 + 0.0333333333333332*G12_0_2 + 0.0333333333333332*G12_1_0 + 0.0333333333333332*G12_1_2 + 0.0333333333333332*G12_2_0 + 0.0333333333333333*G12_2_2;
+    A[706] = 0.0333333333333332*G6_0_0 + 0.0333333333333333*G6_0_1 + 0.0333333333333332*G6_1_0 + 0.0333333333333333*G6_1_1 + 0.0333333333333332*G6_2_0 + 0.0333333333333333*G6_2_1 + 0.0333333333333332*G9_0_0 + 0.0333333333333333*G9_0_1 + 0.0333333333333332*G9_1_0 + 0.0333333333333333*G9_1_1 + 0.0333333333333332*G9_2_0 + 0.0333333333333333*G9_2_1 + 0.0333333333333332*G12_0_0 + 0.0333333333333333*G12_0_1 + 0.0333333333333332*G12_1_0 + 0.0333333333333333*G12_1_1 + 0.0333333333333332*G12_2_0 + 0.0333333333333333*G12_2_1;
+    A[707] = -0.0333333333333332*G6_0_0 - 0.0333333333333332*G6_0_1 - 0.133333333333333*G6_0_2 - 0.0333333333333332*G6_1_0 - 0.0333333333333332*G6_1_1 - 0.133333333333333*G6_1_2 - 0.0333333333333332*G6_2_0 - 0.0333333333333332*G6_2_1 - 0.133333333333333*G6_2_2 - 0.0333333333333332*G9_0_0 - 0.0333333333333332*G9_0_1 - 0.133333333333333*G9_0_2 - 0.0333333333333332*G9_1_0 - 0.0333333333333332*G9_1_1 - 0.133333333333333*G9_1_2 - 0.0333333333333332*G9_2_0 - 0.0333333333333332*G9_2_1 - 0.133333333333333*G9_2_2 - 0.0333333333333332*G12_0_0 - 0.0333333333333332*G12_0_1 - 0.133333333333333*G12_0_2 - 0.0333333333333332*G12_1_0 - 0.0333333333333332*G12_1_1 - 0.133333333333333*G12_1_2 - 0.0333333333333332*G12_2_0 - 0.0333333333333332*G12_2_1 - 0.133333333333333*G12_2_2;
+    A[708] = -0.0333333333333332*G6_0_0 - 0.133333333333333*G6_0_1 - 0.0333333333333332*G6_0_2 - 0.0333333333333332*G6_1_0 - 0.133333333333333*G6_1_1 - 0.0333333333333332*G6_1_2 - 0.0333333333333332*G6_2_0 - 0.133333333333333*G6_2_1 - 0.0333333333333332*G6_2_2 - 0.0333333333333332*G9_0_0 - 0.133333333333333*G9_0_1 - 0.0333333333333332*G9_0_2 - 0.0333333333333332*G9_1_0 - 0.133333333333333*G9_1_1 - 0.0333333333333332*G9_1_2 - 0.0333333333333332*G9_2_0 - 0.133333333333333*G9_2_1 - 0.0333333333333332*G9_2_2 - 0.0333333333333332*G12_0_0 - 0.133333333333333*G12_0_1 - 0.0333333333333332*G12_0_2 - 0.0333333333333332*G12_1_0 - 0.133333333333333*G12_1_1 - 0.0333333333333332*G12_1_2 - 0.0333333333333332*G12_2_0 - 0.133333333333333*G12_2_1 - 0.0333333333333332*G12_2_2;
+    A[709] = -0.133333333333333*G6_0_0 - 0.0333333333333333*G6_0_1 - 0.0333333333333333*G6_0_2 - 0.133333333333333*G6_1_0 - 0.0333333333333333*G6_1_1 - 0.0333333333333333*G6_1_2 - 0.133333333333333*G6_2_0 - 0.0333333333333332*G6_2_1 - 0.0333333333333333*G6_2_2 - 0.133333333333333*G9_0_0 - 0.0333333333333333*G9_0_1 - 0.0333333333333333*G9_0_2 - 0.133333333333333*G9_1_0 - 0.0333333333333333*G9_1_1 - 0.0333333333333333*G9_1_2 - 0.133333333333333*G9_2_0 - 0.0333333333333332*G9_2_1 - 0.0333333333333333*G9_2_2 - 0.133333333333333*G12_0_0 - 0.0333333333333333*G12_0_1 - 0.0333333333333333*G12_0_2 - 0.133333333333333*G12_1_0 - 0.0333333333333333*G12_1_1 - 0.0333333333333333*G12_1_2 - 0.133333333333333*G12_2_0 - 0.0333333333333332*G12_2_1 - 0.0333333333333333*G12_2_2;
+    A[710] = -0.025*G3_0 - 0.025*G3_1 - 0.025*G3_2;
+    A[711] = 0.00833333333333332*G3_0 + 0.00833333333333332*G3_1 + 0.00833333333333331*G3_2;
+    A[712] = 0.0083333333333333*G3_0 + 0.0083333333333333*G3_1 + 0.0083333333333333*G3_2;
+    A[713] = 0.00833333333333331*G3_0 + 0.00833333333333331*G3_1 + 0.00833333333333331*G3_2;
+    A[714] = 0.0;
+    A[715] = 0.0;
+    A[716] = 0.0;
+    A[717] = 0.0;
+    A[718] = 0.0;
+    A[719] = 0.0;
+    A[720] = 0.0;
+    A[721] = 0.0;
+    A[722] = 0.0;
+    A[723] = 0.0;
+    A[724] = 0.0;
+    A[725] = 0.0;
+    A[726] = 0.0;
+    A[727] = 0.0;
+    A[728] = 0.0;
+    A[729] = 0.0;
+    A[730] = 0.0;
+    A[731] = 0.0;
+    A[732] = 0.0;
+    A[733] = 0.0;
+    A[734] = 0.0333333333333333*G6_0_0 + 0.0333333333333334*G6_0_1 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G9_0_0 + 0.0333333333333334*G9_0_1 + 0.0333333333333333*G9_0_2 + 0.0333333333333333*G12_0_0 + 0.0333333333333334*G12_0_1 + 0.0333333333333333*G12_0_2;
+    A[735] = 0.1*G6_0_0 + 0.1*G9_0_0 + 0.1*G12_0_0;
+    A[736] = -0.0333333333333333*G6_0_1 - 0.0333333333333333*G9_0_1 - 0.0333333333333333*G12_0_1;
+    A[737] = -0.0333333333333333*G6_0_2 - 0.0333333333333333*G9_0_2 - 0.0333333333333333*G12_0_2;
+    A[738] = -0.0333333333333334*G6_0_1 - 0.0333333333333333*G6_0_2 - 0.0333333333333334*G9_0_1 - 0.0333333333333333*G9_0_2 - 0.0333333333333334*G12_0_1 - 0.0333333333333333*G12_0_2;
+    A[739] = -0.0333333333333334*G6_0_0 + 0.1*G6_0_2 - 0.0333333333333334*G9_0_0 + 0.1*G9_0_2 - 0.0333333333333334*G12_0_0 + 0.1*G12_0_2;
+    A[740] = -0.0333333333333333*G6_0_0 + 0.1*G6_0_1 - 0.0333333333333333*G9_0_0 + 0.1*G9_0_1 - 0.0333333333333333*G12_0_0 + 0.1*G12_0_1;
+    A[741] = 0.0333333333333334*G6_0_0 + 0.0333333333333333*G6_0_1 + 0.0333333333333334*G9_0_0 + 0.0333333333333333*G9_0_1 + 0.0333333333333334*G12_0_0 + 0.0333333333333333*G12_0_1;
+    A[742] = 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_0_2 + 0.0333333333333333*G12_0_0 + 0.0333333333333333*G12_0_2;
+    A[743] = -0.133333333333333*G6_0_0 - 0.1*G6_0_1 - 0.1*G6_0_2 - 0.133333333333333*G9_0_0 - 0.1*G9_0_1 - 0.1*G9_0_2 - 0.133333333333333*G12_0_0 - 0.1*G12_0_1 - 0.1*G12_0_2;
+    A[744] = -0.00833333333333334*G3_0;
+    A[745] = 0.025*G3_0;
+    A[746] = -0.00833333333333333*G3_0;
+    A[747] = -0.00833333333333334*G3_0;
+    A[748] = 0.0;
+    A[749] = 0.0;
+    A[750] = 0.0;
+    A[751] = 0.0;
+    A[752] = 0.0;
+    A[753] = 0.0;
+    A[754] = 0.0;
+    A[755] = 0.0;
+    A[756] = 0.0;
+    A[757] = 0.0;
+    A[758] = 0.0;
+    A[759] = 0.0;
+    A[760] = 0.0;
+    A[761] = 0.0;
+    A[762] = 0.0;
+    A[763] = 0.0;
+    A[764] = 0.0;
+    A[765] = 0.0;
+    A[766] = 0.0;
+    A[767] = 0.0;
+    A[768] = 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_1_2 + 0.0333333333333333*G12_1_0 + 0.0333333333333333*G12_1_1 + 0.0333333333333333*G12_1_2;
+    A[769] = -0.0333333333333333*G6_1_0 - 0.0333333333333333*G9_1_0 - 0.0333333333333333*G12_1_0;
+    A[770] = 0.1*G6_1_1 + 0.1*G9_1_1 + 0.1*G12_1_1;
+    A[771] = -0.0333333333333333*G6_1_2 - 0.0333333333333333*G9_1_2 - 0.0333333333333333*G12_1_2;
+    A[772] = -0.0333333333333334*G6_1_1 + 0.1*G6_1_2 - 0.0333333333333334*G9_1_1 + 0.1*G9_1_2 - 0.0333333333333334*G12_1_1 + 0.1*G12_1_2;
+    A[773] = -0.0333333333333334*G6_1_0 - 0.0333333333333334*G6_1_2 - 0.0333333333333334*G9_1_0 - 0.0333333333333334*G9_1_2 - 0.0333333333333334*G12_1_0 - 0.0333333333333334*G12_1_2;
+    A[774] = 0.1*G6_1_0 - 0.0333333333333334*G6_1_1 + 0.1*G9_1_0 - 0.0333333333333334*G9_1_1 + 0.1*G12_1_0 - 0.0333333333333334*G12_1_1;
+    A[775] = 0.0333333333333334*G6_1_0 + 0.0333333333333334*G6_1_1 + 0.0333333333333334*G9_1_0 + 0.0333333333333334*G9_1_1 + 0.0333333333333334*G12_1_0 + 0.0333333333333334*G12_1_1;
+    A[776] = -0.1*G6_1_0 - 0.133333333333333*G6_1_1 - 0.1*G6_1_2 - 0.1*G9_1_0 - 0.133333333333333*G9_1_1 - 0.1*G9_1_2 - 0.1*G12_1_0 - 0.133333333333333*G12_1_1 - 0.1*G12_1_2;
+    A[777] = 0.0333333333333334*G6_1_1 + 0.0333333333333334*G6_1_2 + 0.0333333333333334*G9_1_1 + 0.0333333333333334*G9_1_2 + 0.0333333333333334*G12_1_1 + 0.0333333333333334*G12_1_2;
+    A[778] = -0.00833333333333335*G3_1;
+    A[779] = -0.00833333333333335*G3_1;
+    A[780] = 0.025*G3_1;
+    A[781] = -0.00833333333333335*G3_1;
+    A[782] = 0.0;
+    A[783] = 0.0;
+    A[784] = 0.0;
+    A[785] = 0.0;
+    A[786] = 0.0;
+    A[787] = 0.0;
+    A[788] = 0.0;
+    A[789] = 0.0;
+    A[790] = 0.0;
+    A[791] = 0.0;
+    A[792] = 0.0;
+    A[793] = 0.0;
+    A[794] = 0.0;
+    A[795] = 0.0;
+    A[796] = 0.0;
+    A[797] = 0.0;
+    A[798] = 0.0;
+    A[799] = 0.0;
+    A[800] = 0.0;
+    A[801] = 0.0;
+    A[802] = 0.0333333333333333*G6_2_0 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_2_0 + 0.0333333333333333*G9_2_1 + 0.0333333333333333*G9_2_2 + 0.0333333333333333*G12_2_0 + 0.0333333333333333*G12_2_1 + 0.0333333333333333*G12_2_2;
+    A[803] = -0.0333333333333333*G6_2_0 - 0.0333333333333333*G9_2_0 - 0.0333333333333333*G12_2_0;
+    A[804] = -0.0333333333333333*G6_2_1 - 0.0333333333333333*G9_2_1 - 0.0333333333333333*G12_2_1;
+    A[805] = 0.1*G6_2_2 + 0.1*G9_2_2 + 0.1*G12_2_2;
+    A[806] = 0.1*G6_2_1 - 0.0333333333333334*G6_2_2 + 0.1*G9_2_1 - 0.0333333333333334*G9_2_2 + 0.1*G12_2_1 - 0.0333333333333334*G12_2_2;
+    A[807] = 0.1*G6_2_0 - 0.0333333333333334*G6_2_2 + 0.1*G9_2_0 - 0.0333333333333334*G9_2_2 + 0.1*G12_2_0 - 0.0333333333333334*G12_2_2;
+    A[808] = -0.0333333333333334*G6_2_0 - 0.0333333333333334*G6_2_1 - 0.0333333333333334*G9_2_0 - 0.0333333333333334*G9_2_1 - 0.0333333333333334*G12_2_0 - 0.0333333333333334*G12_2_1;
+    A[809] = -0.1*G6_2_0 - 0.1*G6_2_1 - 0.133333333333333*G6_2_2 - 0.1*G9_2_0 - 0.1*G9_2_1 - 0.133333333333333*G9_2_2 - 0.1*G12_2_0 - 0.1*G12_2_1 - 0.133333333333333*G12_2_2;
+    A[810] = 0.0333333333333334*G6_2_0 + 0.0333333333333334*G6_2_2 + 0.0333333333333334*G9_2_0 + 0.0333333333333334*G9_2_2 + 0.0333333333333334*G12_2_0 + 0.0333333333333334*G12_2_2;
+    A[811] = 0.0333333333333334*G6_2_1 + 0.0333333333333334*G6_2_2 + 0.0333333333333334*G9_2_1 + 0.0333333333333334*G9_2_2 + 0.0333333333333334*G12_2_1 + 0.0333333333333334*G12_2_2;
+    A[812] = -0.00833333333333335*G3_2;
+    A[813] = -0.00833333333333334*G3_2;
+    A[814] = -0.00833333333333336*G3_2;
+    A[815] = 0.025*G3_2;
+    A[816] = 0.0;
+    A[817] = 0.0;
+    A[818] = 0.0;
+    A[819] = 0.0;
+    A[820] = 0.0;
+    A[821] = 0.0;
+    A[822] = 0.0;
+    A[823] = 0.0;
+    A[824] = 0.0;
+    A[825] = 0.0;
+    A[826] = 0.0;
+    A[827] = 0.0;
+    A[828] = 0.0;
+    A[829] = 0.0;
+    A[830] = 0.0;
+    A[831] = 0.0;
+    A[832] = 0.0;
+    A[833] = 0.0;
+    A[834] = 0.0;
+    A[835] = 0.0;
+    A[836] = 0.0333333333333332*G6_1_0 + 0.0333333333333332*G6_1_1 + 0.0333333333333332*G6_1_2 + 0.0333333333333332*G6_2_0 + 0.0333333333333332*G6_2_1 + 0.0333333333333332*G6_2_2 + 0.0333333333333332*G9_1_0 + 0.0333333333333332*G9_1_1 + 0.0333333333333332*G9_1_2 + 0.0333333333333332*G9_2_0 + 0.0333333333333332*G9_2_1 + 0.0333333333333332*G9_2_2 + 0.0333333333333332*G12_1_0 + 0.0333333333333332*G12_1_1 + 0.0333333333333332*G12_1_2 + 0.0333333333333332*G12_2_0 + 0.0333333333333332*G12_2_1 + 0.0333333333333332*G12_2_2;
+    A[837] = -0.0333333333333333*G6_1_0 - 0.0333333333333333*G6_2_0 - 0.0333333333333333*G9_1_0 - 0.0333333333333333*G9_2_0 - 0.0333333333333333*G12_1_0 - 0.0333333333333333*G12_2_0;
+    A[838] = -0.0333333333333334*G6_1_1 + 0.1*G6_2_1 - 0.0333333333333334*G9_1_1 + 0.1*G9_2_1 - 0.0333333333333334*G12_1_1 + 0.1*G12_2_1;
+    A[839] = 0.1*G6_1_2 - 0.0333333333333334*G6_2_2 + 0.1*G9_1_2 - 0.0333333333333334*G9_2_2 + 0.1*G12_1_2 - 0.0333333333333334*G12_2_2;
+    A[840] = 0.266666666666667*G6_1_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_1 + 0.266666666666666*G6_2_2 + 0.266666666666667*G9_1_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_1 + 0.266666666666666*G9_2_2 + 0.266666666666667*G12_1_1 + 0.133333333333333*G12_1_2 + 0.133333333333333*G12_2_1 + 0.266666666666666*G12_2_2;
+    A[841] = 0.266666666666667*G6_1_0 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_2 + 0.266666666666667*G9_1_0 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_2 + 0.266666666666667*G12_1_0 + 0.133333333333333*G12_1_2 + 0.133333333333333*G12_2_0 + 0.133333333333333*G12_2_2;
+    A[842] = 0.133333333333333*G6_1_0 + 0.133333333333333*G6_1_1 + 0.266666666666666*G6_2_0 + 0.133333333333333*G6_2_1 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_1_1 + 0.266666666666666*G9_2_0 + 0.133333333333333*G9_2_1 + 0.133333333333333*G12_1_0 + 0.133333333333333*G12_1_1 + 0.266666666666666*G12_2_0 + 0.133333333333333*G12_2_1;
+    A[843] = -0.266666666666667*G6_1_0 - 0.266666666666666*G6_1_1 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_1 - 0.266666666666667*G9_1_0 - 0.266666666666666*G9_1_1 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_1 - 0.266666666666667*G12_1_0 - 0.266666666666666*G12_1_1 - 0.133333333333333*G12_1_2 - 0.133333333333333*G12_2_0 - 0.133333333333333*G12_2_1;
+    A[844] = -0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_2 - 0.266666666666666*G6_2_0 - 0.133333333333333*G6_2_1 - 0.266666666666666*G6_2_2 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_2 - 0.266666666666666*G9_2_0 - 0.133333333333333*G9_2_1 - 0.266666666666666*G9_2_2 - 0.133333333333333*G12_1_0 - 0.133333333333333*G12_1_2 - 0.266666666666666*G12_2_0 - 0.133333333333333*G12_2_1 - 0.266666666666666*G12_2_2;
+    A[845] = -0.133333333333333*G6_1_1 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_1 - 0.133333333333333*G6_2_2 - 0.133333333333333*G9_1_1 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_1 - 0.133333333333333*G9_2_2 - 0.133333333333333*G12_1_1 - 0.133333333333333*G12_1_2 - 0.133333333333333*G12_2_1 - 0.133333333333333*G12_2_2;
+    A[846] = 0.0333333333333334*G3_1 + 0.0333333333333333*G3_2;
+    A[847] = 0.0333333333333333*G3_1 + 0.0333333333333333*G3_2;
+    A[848] = 0.0333333333333333*G3_1 + 0.0666666666666666*G3_2;
+    A[849] = 0.0666666666666667*G3_1 + 0.0333333333333333*G3_2;
+    A[850] = 0.0;
+    A[851] = 0.0;
+    A[852] = 0.0;
+    A[853] = 0.0;
+    A[854] = 0.0;
+    A[855] = 0.0;
+    A[856] = 0.0;
+    A[857] = 0.0;
+    A[858] = 0.0;
+    A[859] = 0.0;
+    A[860] = 0.0;
+    A[861] = 0.0;
+    A[862] = 0.0;
+    A[863] = 0.0;
+    A[864] = 0.0;
+    A[865] = 0.0;
+    A[866] = 0.0;
+    A[867] = 0.0;
+    A[868] = 0.0;
+    A[869] = 0.0;
+    A[870] = 0.0333333333333332*G6_0_0 + 0.0333333333333332*G6_0_1 + 0.0333333333333332*G6_0_2 + 0.0333333333333332*G6_2_0 + 0.0333333333333332*G6_2_1 + 0.0333333333333332*G6_2_2 + 0.0333333333333332*G9_0_0 + 0.0333333333333332*G9_0_1 + 0.0333333333333332*G9_0_2 + 0.0333333333333332*G9_2_0 + 0.0333333333333332*G9_2_1 + 0.0333333333333332*G9_2_2 + 0.0333333333333332*G12_0_0 + 0.0333333333333332*G12_0_1 + 0.0333333333333332*G12_0_2 + 0.0333333333333332*G12_2_0 + 0.0333333333333332*G12_2_1 + 0.0333333333333332*G12_2_2;
+    A[871] = -0.0333333333333334*G6_0_0 + 0.1*G6_2_0 - 0.0333333333333334*G9_0_0 + 0.1*G9_2_0 - 0.0333333333333334*G12_0_0 + 0.1*G12_2_0;
+    A[872] = -0.0333333333333334*G6_0_1 - 0.0333333333333334*G6_2_1 - 0.0333333333333334*G9_0_1 - 0.0333333333333334*G9_2_1 - 0.0333333333333334*G12_0_1 - 0.0333333333333334*G12_2_1;
+    A[873] = 0.1*G6_0_2 - 0.0333333333333334*G6_2_2 + 0.1*G9_0_2 - 0.0333333333333334*G9_2_2 + 0.1*G12_0_2 - 0.0333333333333334*G12_2_2;
+    A[874] = 0.266666666666667*G6_0_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_2_1 + 0.133333333333333*G6_2_2 + 0.266666666666667*G9_0_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_2_1 + 0.133333333333333*G9_2_2 + 0.266666666666667*G12_0_1 + 0.133333333333333*G12_0_2 + 0.133333333333333*G12_2_1 + 0.133333333333333*G12_2_2;
+    A[875] = 0.266666666666666*G6_0_0 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_2_0 + 0.266666666666667*G6_2_2 + 0.266666666666666*G9_0_0 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_2_0 + 0.266666666666667*G9_2_2 + 0.266666666666666*G12_0_0 + 0.133333333333333*G12_0_2 + 0.133333333333333*G12_2_0 + 0.266666666666667*G12_2_2;
+    A[876] = 0.133333333333333*G6_0_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_2_0 + 0.266666666666667*G6_2_1 + 0.133333333333333*G9_0_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_2_0 + 0.266666666666667*G9_2_1 + 0.133333333333333*G12_0_0 + 0.133333333333333*G12_0_1 + 0.133333333333333*G12_2_0 + 0.266666666666667*G12_2_1;
+    A[877] = -0.266666666666666*G6_0_0 - 0.266666666666666*G6_0_1 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_1 - 0.266666666666666*G9_0_0 - 0.266666666666666*G9_0_1 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_1 - 0.266666666666666*G12_0_0 - 0.266666666666666*G12_0_1 - 0.133333333333333*G12_0_2 - 0.133333333333333*G12_2_0 - 0.133333333333333*G12_2_1;
+    A[878] = -0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_2 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_2 - 0.133333333333333*G12_0_0 - 0.133333333333333*G12_0_2 - 0.133333333333333*G12_2_0 - 0.133333333333333*G12_2_2;
+    A[879] = -0.133333333333333*G6_0_1 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_2_0 - 0.266666666666667*G6_2_1 - 0.266666666666666*G6_2_2 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_2_0 - 0.266666666666667*G9_2_1 - 0.266666666666666*G9_2_2 - 0.133333333333333*G12_0_1 - 0.133333333333333*G12_0_2 - 0.133333333333333*G12_2_0 - 0.266666666666667*G12_2_1 - 0.266666666666666*G12_2_2;
+    A[880] = 0.0333333333333333*G3_0 + 0.0333333333333333*G3_2;
+    A[881] = 0.0333333333333333*G3_0 + 0.0666666666666666*G3_2;
+    A[882] = 0.0333333333333333*G3_0 + 0.0333333333333333*G3_2;
+    A[883] = 0.0666666666666666*G3_0 + 0.0333333333333333*G3_2;
+    A[884] = 0.0;
+    A[885] = 0.0;
+    A[886] = 0.0;
+    A[887] = 0.0;
+    A[888] = 0.0;
+    A[889] = 0.0;
+    A[890] = 0.0;
+    A[891] = 0.0;
+    A[892] = 0.0;
+    A[893] = 0.0;
+    A[894] = 0.0;
+    A[895] = 0.0;
+    A[896] = 0.0;
+    A[897] = 0.0;
+    A[898] = 0.0;
+    A[899] = 0.0;
+    A[900] = 0.0;
+    A[901] = 0.0;
+    A[902] = 0.0;
+    A[903] = 0.0;
+    A[904] = 0.0333333333333332*G6_0_0 + 0.0333333333333332*G6_0_1 + 0.0333333333333332*G6_0_2 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_1_1 + 0.0333333333333332*G6_1_2 + 0.0333333333333332*G9_0_0 + 0.0333333333333332*G9_0_1 + 0.0333333333333332*G9_0_2 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_1_1 + 0.0333333333333332*G9_1_2 + 0.0333333333333332*G12_0_0 + 0.0333333333333332*G12_0_1 + 0.0333333333333332*G12_0_2 + 0.0333333333333333*G12_1_0 + 0.0333333333333333*G12_1_1 + 0.0333333333333332*G12_1_2;
+    A[905] = -0.0333333333333333*G6_0_0 + 0.1*G6_1_0 - 0.0333333333333333*G9_0_0 + 0.1*G9_1_0 - 0.0333333333333333*G12_0_0 + 0.1*G12_1_0;
+    A[906] = 0.1*G6_0_1 - 0.0333333333333334*G6_1_1 + 0.1*G9_0_1 - 0.0333333333333334*G9_1_1 + 0.1*G12_0_1 - 0.0333333333333334*G12_1_1;
+    A[907] = -0.0333333333333334*G6_0_2 - 0.0333333333333334*G6_1_2 - 0.0333333333333334*G9_0_2 - 0.0333333333333334*G9_1_2 - 0.0333333333333334*G12_0_2 - 0.0333333333333334*G12_1_2;
+    A[908] = 0.133333333333333*G6_0_1 + 0.266666666666666*G6_0_2 + 0.133333333333333*G6_1_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G9_0_1 + 0.266666666666666*G9_0_2 + 0.133333333333333*G9_1_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G12_0_1 + 0.266666666666666*G12_0_2 + 0.133333333333333*G12_1_1 + 0.133333333333333*G12_1_2;
+    A[909] = 0.133333333333333*G6_0_0 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.266666666666667*G6_1_2 + 0.133333333333333*G9_0_0 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.266666666666667*G9_1_2 + 0.133333333333333*G12_0_0 + 0.133333333333333*G12_0_2 + 0.133333333333333*G12_1_0 + 0.266666666666667*G12_1_2;
+    A[910] = 0.266666666666666*G6_0_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_1_0 + 0.266666666666667*G6_1_1 + 0.266666666666666*G9_0_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_1_0 + 0.266666666666667*G9_1_1 + 0.266666666666666*G12_0_0 + 0.133333333333333*G12_0_1 + 0.133333333333333*G12_1_0 + 0.266666666666667*G12_1_1;
+    A[911] = -0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_1 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_1 - 0.133333333333333*G12_0_0 - 0.133333333333333*G12_0_1 - 0.133333333333333*G12_1_0 - 0.133333333333333*G12_1_1;
+    A[912] = -0.266666666666666*G6_0_0 - 0.133333333333333*G6_0_1 - 0.266666666666666*G6_0_2 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_2 - 0.266666666666666*G9_0_0 - 0.133333333333333*G9_0_1 - 0.266666666666666*G9_0_2 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_2 - 0.266666666666666*G12_0_0 - 0.133333333333333*G12_0_1 - 0.266666666666666*G12_0_2 - 0.133333333333333*G12_1_0 - 0.133333333333333*G12_1_2;
+    A[913] = -0.133333333333333*G6_0_1 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_1_0 - 0.266666666666667*G6_1_1 - 0.266666666666666*G6_1_2 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_1_0 - 0.266666666666667*G9_1_1 - 0.266666666666666*G9_1_2 - 0.133333333333333*G12_0_1 - 0.133333333333333*G12_0_2 - 0.133333333333333*G12_1_0 - 0.266666666666667*G12_1_1 - 0.266666666666666*G12_1_2;
+    A[914] = 0.0333333333333333*G3_0 + 0.0333333333333334*G3_1;
+    A[915] = 0.0333333333333333*G3_0 + 0.0666666666666666*G3_1;
+    A[916] = 0.0666666666666666*G3_0 + 0.0333333333333333*G3_1;
+    A[917] = 0.0333333333333333*G3_0 + 0.0333333333333333*G3_1;
+    A[918] = 0.0;
+    A[919] = 0.0;
+    A[920] = 0.0;
+    A[921] = 0.0;
+    A[922] = 0.0;
+    A[923] = 0.0;
+    A[924] = 0.0;
+    A[925] = 0.0;
+    A[926] = 0.0;
+    A[927] = 0.0;
+    A[928] = 0.0;
+    A[929] = 0.0;
+    A[930] = 0.0;
+    A[931] = 0.0;
+    A[932] = 0.0;
+    A[933] = 0.0;
+    A[934] = 0.0;
+    A[935] = 0.0;
+    A[936] = 0.0;
+    A[937] = 0.0;
+    A[938] = -0.0333333333333332*G6_0_0 - 0.0333333333333332*G6_0_1 - 0.0333333333333332*G6_0_2 - 0.0333333333333332*G6_1_0 - 0.0333333333333332*G6_1_1 - 0.0333333333333332*G6_1_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_1 - 0.133333333333333*G6_2_2 - 0.0333333333333332*G9_0_0 - 0.0333333333333332*G9_0_1 - 0.0333333333333332*G9_0_2 - 0.0333333333333332*G9_1_0 - 0.0333333333333332*G9_1_1 - 0.0333333333333332*G9_1_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_1 - 0.133333333333333*G9_2_2 - 0.0333333333333332*G12_0_0 - 0.0333333333333332*G12_0_1 - 0.0333333333333332*G12_0_2 - 0.0333333333333332*G12_1_0 - 0.0333333333333332*G12_1_1 - 0.0333333333333332*G12_1_2 - 0.133333333333333*G12_2_0 - 0.133333333333333*G12_2_1 - 0.133333333333333*G12_2_2;
+    A[939] = 0.0333333333333334*G6_0_0 + 0.0333333333333334*G6_1_0 + 0.0333333333333334*G9_0_0 + 0.0333333333333334*G9_1_0 + 0.0333333333333334*G12_0_0 + 0.0333333333333334*G12_1_0;
+    A[940] = 0.0333333333333334*G6_0_1 + 0.0333333333333334*G6_1_1 + 0.0333333333333334*G9_0_1 + 0.0333333333333334*G9_1_1 + 0.0333333333333334*G12_0_1 + 0.0333333333333334*G12_1_1;
+    A[941] = -0.1*G6_0_2 - 0.1*G6_1_2 - 0.133333333333333*G6_2_2 - 0.1*G9_0_2 - 0.1*G9_1_2 - 0.133333333333333*G9_2_2 - 0.1*G12_0_2 - 0.1*G12_1_2 - 0.133333333333333*G12_2_2;
+    A[942] = -0.266666666666667*G6_0_1 - 0.133333333333333*G6_0_2 - 0.266666666666667*G6_1_1 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_1 - 0.266666666666667*G9_0_1 - 0.133333333333333*G9_0_2 - 0.266666666666667*G9_1_1 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_1 - 0.266666666666667*G12_0_1 - 0.133333333333333*G12_0_2 - 0.266666666666667*G12_1_1 - 0.133333333333333*G12_1_2 - 0.133333333333333*G12_2_1;
+    A[943] = -0.266666666666666*G6_0_0 - 0.133333333333333*G6_0_2 - 0.266666666666666*G6_1_0 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_0 - 0.266666666666666*G9_0_0 - 0.133333333333333*G9_0_2 - 0.266666666666666*G9_1_0 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_0 - 0.266666666666666*G12_0_0 - 0.133333333333333*G12_0_2 - 0.266666666666666*G12_1_0 - 0.133333333333333*G12_1_2 - 0.133333333333333*G12_2_0;
+    A[944] = -0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_1 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_1 - 0.133333333333333*G12_0_0 - 0.133333333333333*G12_0_1 - 0.133333333333333*G12_1_0 - 0.133333333333333*G12_1_1;
+    A[945] = 0.266666666666666*G6_0_0 + 0.266666666666666*G6_0_1 + 0.133333333333333*G6_0_2 + 0.266666666666666*G6_1_0 + 0.266666666666666*G6_1_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_1 + 0.266666666666667*G6_2_2 + 0.266666666666666*G9_0_0 + 0.266666666666666*G9_0_1 + 0.133333333333333*G9_0_2 + 0.266666666666666*G9_1_0 + 0.266666666666666*G9_1_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_1 + 0.266666666666667*G9_2_2 + 0.266666666666666*G12_0_0 + 0.266666666666666*G12_0_1 + 0.133333333333333*G12_0_2 + 0.266666666666666*G12_1_0 + 0.266666666666666*G12_1_1 + 0.133333333333333*G12_1_2 + 0.133333333333333*G12_2_0 + 0.133333333333333*G12_2_1 + 0.266666666666667*G12_2_2;
+    A[946] = 0.133333333333333*G6_0_0 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_1 + 0.133333333333333*G9_0_0 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_1 + 0.133333333333333*G12_0_0 + 0.133333333333333*G12_0_2 + 0.133333333333333*G12_1_0 + 0.133333333333333*G12_1_2 + 0.133333333333333*G12_2_1;
+    A[947] = 0.133333333333333*G6_0_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G12_0_1 + 0.133333333333333*G12_0_2 + 0.133333333333333*G12_1_1 + 0.133333333333333*G12_1_2 + 0.133333333333333*G12_2_0;
+    A[948] = -0.0333333333333333*G3_0 - 0.0333333333333333*G3_1 + 0.0333333333333333*G3_2;
+    A[949] = -0.0333333333333333*G3_0 - 0.0333333333333333*G3_1;
+    A[950] = -0.0333333333333333*G3_0 - 0.0333333333333333*G3_1;
+    A[951] = -0.0666666666666666*G3_0 - 0.0666666666666666*G3_1 - 0.0333333333333333*G3_2;
+    A[952] = 0.0;
+    A[953] = 0.0;
+    A[954] = 0.0;
+    A[955] = 0.0;
+    A[956] = 0.0;
+    A[957] = 0.0;
+    A[958] = 0.0;
+    A[959] = 0.0;
+    A[960] = 0.0;
+    A[961] = 0.0;
+    A[962] = 0.0;
+    A[963] = 0.0;
+    A[964] = 0.0;
+    A[965] = 0.0;
+    A[966] = 0.0;
+    A[967] = 0.0;
+    A[968] = 0.0;
+    A[969] = 0.0;
+    A[970] = 0.0;
+    A[971] = 0.0;
+    A[972] = -0.0333333333333332*G6_0_0 - 0.0333333333333332*G6_0_1 - 0.0333333333333332*G6_0_2 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_1 - 0.133333333333333*G6_1_2 - 0.0333333333333332*G6_2_0 - 0.0333333333333332*G6_2_1 - 0.0333333333333332*G6_2_2 - 0.0333333333333332*G9_0_0 - 0.0333333333333332*G9_0_1 - 0.0333333333333332*G9_0_2 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_1 - 0.133333333333333*G9_1_2 - 0.0333333333333332*G9_2_0 - 0.0333333333333332*G9_2_1 - 0.0333333333333332*G9_2_2 - 0.0333333333333332*G12_0_0 - 0.0333333333333332*G12_0_1 - 0.0333333333333332*G12_0_2 - 0.133333333333333*G12_1_0 - 0.133333333333333*G12_1_1 - 0.133333333333333*G12_1_2 - 0.0333333333333332*G12_2_0 - 0.0333333333333332*G12_2_1 - 0.0333333333333332*G12_2_2;
+    A[973] = 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_2_0 + 0.0333333333333333*G12_0_0 + 0.0333333333333333*G12_2_0;
+    A[974] = -0.1*G6_0_1 - 0.133333333333333*G6_1_1 - 0.1*G6_2_1 - 0.1*G9_0_1 - 0.133333333333333*G9_1_1 - 0.1*G9_2_1 - 0.1*G12_0_1 - 0.133333333333333*G12_1_1 - 0.1*G12_2_1;
+    A[975] = 0.0333333333333334*G6_0_2 + 0.0333333333333334*G6_2_2 + 0.0333333333333334*G9_0_2 + 0.0333333333333334*G9_2_2 + 0.0333333333333334*G12_0_2 + 0.0333333333333334*G12_2_2;
+    A[976] = -0.133333333333333*G6_0_1 - 0.266666666666666*G6_0_2 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_1 - 0.266666666666666*G6_2_2 - 0.133333333333333*G9_0_1 - 0.266666666666666*G9_0_2 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_1 - 0.266666666666666*G9_2_2 - 0.133333333333333*G12_0_1 - 0.266666666666666*G12_0_2 - 0.133333333333333*G12_1_2 - 0.133333333333333*G12_2_1 - 0.266666666666666*G12_2_2;
+    A[977] = -0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_2 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_2 - 0.133333333333333*G12_0_0 - 0.133333333333333*G12_0_2 - 0.133333333333333*G12_2_0 - 0.133333333333333*G12_2_2;
+    A[978] = -0.266666666666666*G6_0_0 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_1_0 - 0.266666666666666*G6_2_0 - 0.133333333333333*G6_2_1 - 0.266666666666666*G9_0_0 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_1_0 - 0.266666666666666*G9_2_0 - 0.133333333333333*G9_2_1 - 0.266666666666666*G12_0_0 - 0.133333333333333*G12_0_1 - 0.133333333333333*G12_1_0 - 0.266666666666666*G12_2_0 - 0.133333333333333*G12_2_1;
+    A[979] = 0.133333333333333*G6_0_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_1 + 0.133333333333333*G9_0_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_1 + 0.133333333333333*G12_0_0 + 0.133333333333333*G12_0_1 + 0.133333333333333*G12_1_2 + 0.133333333333333*G12_2_0 + 0.133333333333333*G12_2_1;
+    A[980] = 0.266666666666666*G6_0_0 + 0.133333333333333*G6_0_1 + 0.266666666666666*G6_0_2 + 0.133333333333333*G6_1_0 + 0.266666666666666*G6_1_1 + 0.133333333333333*G6_1_2 + 0.266666666666666*G6_2_0 + 0.133333333333333*G6_2_1 + 0.266666666666666*G6_2_2 + 0.266666666666666*G9_0_0 + 0.133333333333333*G9_0_1 + 0.266666666666666*G9_0_2 + 0.133333333333333*G9_1_0 + 0.266666666666666*G9_1_1 + 0.133333333333333*G9_1_2 + 0.266666666666666*G9_2_0 + 0.133333333333333*G9_2_1 + 0.266666666666666*G9_2_2 + 0.266666666666666*G12_0_0 + 0.133333333333333*G12_0_1 + 0.266666666666666*G12_0_2 + 0.133333333333333*G12_1_0 + 0.266666666666666*G12_1_1 + 0.133333333333333*G12_1_2 + 0.266666666666666*G12_2_0 + 0.133333333333333*G12_2_1 + 0.266666666666666*G12_2_2;
+    A[981] = 0.133333333333333*G6_0_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_2_1 + 0.133333333333333*G6_2_2 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_2_1 + 0.133333333333333*G9_2_2 + 0.133333333333333*G12_0_1 + 0.133333333333333*G12_0_2 + 0.133333333333333*G12_1_0 + 0.133333333333333*G12_2_1 + 0.133333333333333*G12_2_2;
+    A[982] = -0.0333333333333333*G3_0 + 0.0333333333333334*G3_1 - 0.0333333333333334*G3_2;
+    A[983] = -0.0333333333333333*G3_0 - 0.0333333333333333*G3_2;
+    A[984] = -0.0666666666666667*G3_0 - 0.0333333333333333*G3_1 - 0.0666666666666666*G3_2;
+    A[985] = -0.0333333333333333*G3_0 - 0.0333333333333333*G3_2;
+    A[986] = 0.0;
+    A[987] = 0.0;
+    A[988] = 0.0;
+    A[989] = 0.0;
+    A[990] = 0.0;
+    A[991] = 0.0;
+    A[992] = 0.0;
+    A[993] = 0.0;
+    A[994] = 0.0;
+    A[995] = 0.0;
+    A[996] = 0.0;
+    A[997] = 0.0;
+    A[998] = 0.0;
+    A[999] = 0.0;
+    A[1000] = 0.0;
+    A[1001] = 0.0;
+    A[1002] = 0.0;
+    A[1003] = 0.0;
+    A[1004] = 0.0;
+    A[1005] = 0.0;
+    A[1006] = -0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_0_2 - 0.0333333333333333*G6_1_0 - 0.0333333333333333*G6_1_1 - 0.0333333333333332*G6_1_2 - 0.0333333333333333*G6_2_0 - 0.0333333333333333*G6_2_1 - 0.0333333333333333*G6_2_2 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_0_2 - 0.0333333333333333*G9_1_0 - 0.0333333333333333*G9_1_1 - 0.0333333333333332*G9_1_2 - 0.0333333333333333*G9_2_0 - 0.0333333333333333*G9_2_1 - 0.0333333333333333*G9_2_2 - 0.133333333333333*G12_0_0 - 0.133333333333333*G12_0_1 - 0.133333333333333*G12_0_2 - 0.0333333333333333*G12_1_0 - 0.0333333333333333*G12_1_1 - 0.0333333333333332*G12_1_2 - 0.0333333333333333*G12_2_0 - 0.0333333333333333*G12_2_1 - 0.0333333333333333*G12_2_2;
+    A[1007] = -0.133333333333333*G6_0_0 - 0.1*G6_1_0 - 0.1*G6_2_0 - 0.133333333333333*G9_0_0 - 0.1*G9_1_0 - 0.1*G9_2_0 - 0.133333333333333*G12_0_0 - 0.1*G12_1_0 - 0.1*G12_2_0;
+    A[1008] = 0.0333333333333334*G6_1_1 + 0.0333333333333334*G6_2_1 + 0.0333333333333334*G9_1_1 + 0.0333333333333334*G9_2_1 + 0.0333333333333334*G12_1_1 + 0.0333333333333334*G12_2_1;
+    A[1009] = 0.0333333333333334*G6_1_2 + 0.0333333333333334*G6_2_2 + 0.0333333333333334*G9_1_2 + 0.0333333333333334*G9_2_2 + 0.0333333333333334*G12_1_2 + 0.0333333333333334*G12_2_2;
+    A[1010] = -0.133333333333333*G6_1_1 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_1 - 0.133333333333333*G6_2_2 - 0.133333333333333*G9_1_1 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_1 - 0.133333333333333*G9_2_2 - 0.133333333333333*G12_1_1 - 0.133333333333333*G12_1_2 - 0.133333333333333*G12_2_1 - 0.133333333333333*G12_2_2;
+    A[1011] = -0.133333333333333*G6_0_2 - 0.133333333333333*G6_1_0 - 0.266666666666667*G6_1_2 - 0.133333333333333*G6_2_0 - 0.266666666666666*G6_2_2 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_1_0 - 0.266666666666667*G9_1_2 - 0.133333333333333*G9_2_0 - 0.266666666666666*G9_2_2 - 0.133333333333333*G12_0_2 - 0.133333333333333*G12_1_0 - 0.266666666666667*G12_1_2 - 0.133333333333333*G12_2_0 - 0.266666666666666*G12_2_2;
+    A[1012] = -0.133333333333333*G6_0_1 - 0.133333333333333*G6_1_0 - 0.266666666666667*G6_1_1 - 0.133333333333333*G6_2_0 - 0.266666666666666*G6_2_1 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_1_0 - 0.266666666666667*G9_1_1 - 0.133333333333333*G9_2_0 - 0.266666666666666*G9_2_1 - 0.133333333333333*G12_0_1 - 0.133333333333333*G12_1_0 - 0.266666666666667*G12_1_1 - 0.133333333333333*G12_2_0 - 0.266666666666666*G12_2_1;
+    A[1013] = 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_1_1 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_1_1 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_1 + 0.133333333333333*G12_0_2 + 0.133333333333333*G12_1_0 + 0.133333333333333*G12_1_1 + 0.133333333333333*G12_2_0 + 0.133333333333333*G12_2_1;
+    A[1014] = 0.133333333333333*G6_0_1 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_2 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_2 + 0.133333333333333*G12_0_1 + 0.133333333333333*G12_1_0 + 0.133333333333333*G12_1_2 + 0.133333333333333*G12_2_0 + 0.133333333333333*G12_2_2;
+    A[1015] = 0.266666666666667*G6_0_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.266666666666667*G6_1_1 + 0.266666666666666*G6_1_2 + 0.133333333333333*G6_2_0 + 0.266666666666666*G6_2_1 + 0.266666666666666*G6_2_2 + 0.266666666666667*G9_0_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.266666666666667*G9_1_1 + 0.266666666666666*G9_1_2 + 0.133333333333333*G9_2_0 + 0.266666666666666*G9_2_1 + 0.266666666666666*G9_2_2 + 0.266666666666667*G12_0_0 + 0.133333333333333*G12_0_1 + 0.133333333333333*G12_0_2 + 0.133333333333333*G12_1_0 + 0.266666666666667*G12_1_1 + 0.266666666666666*G12_1_2 + 0.133333333333333*G12_2_0 + 0.266666666666666*G12_2_1 + 0.266666666666666*G12_2_2;
+    A[1016] = 0.0333333333333334*G3_0 - 0.0333333333333333*G3_1 - 0.0333333333333333*G3_2;
+    A[1017] = -0.0333333333333333*G3_0 - 0.0666666666666666*G3_1 - 0.0666666666666666*G3_2;
+    A[1018] = -0.0333333333333333*G3_1 - 0.0333333333333333*G3_2;
+    A[1019] = -0.0333333333333333*G3_1 - 0.0333333333333333*G3_2;
+    A[1020] = -0.025*G1_0 - 0.025*G1_1 - 0.025*G1_2;
+    A[1021] = -0.00833333333333334*G1_0;
+    A[1022] = -0.00833333333333335*G1_1;
+    A[1023] = -0.00833333333333335*G1_2;
+    A[1024] = 0.0333333333333334*G1_1 + 0.0333333333333333*G1_2;
+    A[1025] = 0.0333333333333333*G1_0 + 0.0333333333333333*G1_2;
+    A[1026] = 0.0333333333333333*G1_0 + 0.0333333333333334*G1_1;
+    A[1027] = -0.0333333333333333*G1_0 - 0.0333333333333333*G1_1 + 0.0333333333333333*G1_2;
+    A[1028] = -0.0333333333333333*G1_0 + 0.0333333333333334*G1_1 - 0.0333333333333334*G1_2;
+    A[1029] = 0.0333333333333334*G1_0 - 0.0333333333333333*G1_1 - 0.0333333333333333*G1_2;
+    A[1030] = -0.025*G2_0 - 0.025*G2_1 - 0.025*G2_2;
+    A[1031] = -0.00833333333333334*G2_0;
+    A[1032] = -0.00833333333333335*G2_1;
+    A[1033] = -0.00833333333333335*G2_2;
+    A[1034] = 0.0333333333333334*G2_1 + 0.0333333333333333*G2_2;
+    A[1035] = 0.0333333333333333*G2_0 + 0.0333333333333333*G2_2;
+    A[1036] = 0.0333333333333333*G2_0 + 0.0333333333333334*G2_1;
+    A[1037] = -0.0333333333333333*G2_0 - 0.0333333333333333*G2_1 + 0.0333333333333333*G2_2;
+    A[1038] = -0.0333333333333333*G2_0 + 0.0333333333333334*G2_1 - 0.0333333333333334*G2_2;
+    A[1039] = 0.0333333333333334*G2_0 - 0.0333333333333333*G2_1 - 0.0333333333333333*G2_2;
+    A[1040] = -0.025*G0_0 - 0.025*G0_1 - 0.025*G0_2;
+    A[1041] = -0.00833333333333334*G0_0;
+    A[1042] = -0.00833333333333335*G0_1;
+    A[1043] = -0.00833333333333335*G0_2;
+    A[1044] = 0.0333333333333334*G0_1 + 0.0333333333333333*G0_2;
+    A[1045] = 0.0333333333333333*G0_0 + 0.0333333333333333*G0_2;
+    A[1046] = 0.0333333333333333*G0_0 + 0.0333333333333334*G0_1;
+    A[1047] = -0.0333333333333333*G0_0 - 0.0333333333333333*G0_1 + 0.0333333333333333*G0_2;
+    A[1048] = -0.0333333333333333*G0_0 + 0.0333333333333334*G0_1 - 0.0333333333333334*G0_2;
+    A[1049] = 0.0333333333333334*G0_0 - 0.0333333333333333*G0_1 - 0.0333333333333333*G0_2;
+    A[1050] = 0.0;
+    A[1051] = 0.0;
+    A[1052] = 0.0;
+    A[1053] = 0.0;
+    A[1054] = 0.00833333333333332*G1_0 + 0.00833333333333332*G1_1 + 0.00833333333333331*G1_2;
+    A[1055] = 0.025*G1_0;
+    A[1056] = -0.00833333333333335*G1_1;
+    A[1057] = -0.00833333333333334*G1_2;
+    A[1058] = 0.0333333333333333*G1_1 + 0.0333333333333333*G1_2;
+    A[1059] = 0.0333333333333333*G1_0 + 0.0666666666666666*G1_2;
+    A[1060] = 0.0333333333333333*G1_0 + 0.0666666666666666*G1_1;
+    A[1061] = -0.0333333333333333*G1_0 - 0.0333333333333333*G1_1;
+    A[1062] = -0.0333333333333333*G1_0 - 0.0333333333333333*G1_2;
+    A[1063] = -0.0333333333333333*G1_0 - 0.0666666666666666*G1_1 - 0.0666666666666666*G1_2;
+    A[1064] = 0.00833333333333332*G2_0 + 0.00833333333333332*G2_1 + 0.00833333333333331*G2_2;
+    A[1065] = 0.025*G2_0;
+    A[1066] = -0.00833333333333335*G2_1;
+    A[1067] = -0.00833333333333334*G2_2;
+    A[1068] = 0.0333333333333333*G2_1 + 0.0333333333333333*G2_2;
+    A[1069] = 0.0333333333333333*G2_0 + 0.0666666666666666*G2_2;
+    A[1070] = 0.0333333333333333*G2_0 + 0.0666666666666666*G2_1;
+    A[1071] = -0.0333333333333333*G2_0 - 0.0333333333333333*G2_1;
+    A[1072] = -0.0333333333333333*G2_0 - 0.0333333333333333*G2_2;
+    A[1073] = -0.0333333333333333*G2_0 - 0.0666666666666666*G2_1 - 0.0666666666666666*G2_2;
+    A[1074] = 0.00833333333333332*G0_0 + 0.00833333333333332*G0_1 + 0.00833333333333331*G0_2;
+    A[1075] = 0.025*G0_0;
+    A[1076] = -0.00833333333333335*G0_1;
+    A[1077] = -0.00833333333333334*G0_2;
+    A[1078] = 0.0333333333333333*G0_1 + 0.0333333333333333*G0_2;
+    A[1079] = 0.0333333333333333*G0_0 + 0.0666666666666666*G0_2;
+    A[1080] = 0.0333333333333333*G0_0 + 0.0666666666666666*G0_1;
+    A[1081] = -0.0333333333333333*G0_0 - 0.0333333333333333*G0_1;
+    A[1082] = -0.0333333333333333*G0_0 - 0.0333333333333333*G0_2;
+    A[1083] = -0.0333333333333333*G0_0 - 0.0666666666666666*G0_1 - 0.0666666666666666*G0_2;
+    A[1084] = 0.0;
+    A[1085] = 0.0;
+    A[1086] = 0.0;
+    A[1087] = 0.0;
+    A[1088] = 0.0083333333333333*G1_0 + 0.0083333333333333*G1_1 + 0.0083333333333333*G1_2;
+    A[1089] = -0.00833333333333333*G1_0;
+    A[1090] = 0.025*G1_1;
+    A[1091] = -0.00833333333333336*G1_2;
+    A[1092] = 0.0333333333333333*G1_1 + 0.0666666666666666*G1_2;
+    A[1093] = 0.0333333333333333*G1_0 + 0.0333333333333333*G1_2;
+    A[1094] = 0.0666666666666666*G1_0 + 0.0333333333333333*G1_1;
+    A[1095] = -0.0333333333333333*G1_0 - 0.0333333333333333*G1_1;
+    A[1096] = -0.0666666666666667*G1_0 - 0.0333333333333333*G1_1 - 0.0666666666666666*G1_2;
+    A[1097] = -0.0333333333333333*G1_1 - 0.0333333333333333*G1_2;
+    A[1098] = 0.0083333333333333*G2_0 + 0.0083333333333333*G2_1 + 0.0083333333333333*G2_2;
+    A[1099] = -0.00833333333333333*G2_0;
+    A[1100] = 0.025*G2_1;
+    A[1101] = -0.00833333333333336*G2_2;
+    A[1102] = 0.0333333333333333*G2_1 + 0.0666666666666666*G2_2;
+    A[1103] = 0.0333333333333333*G2_0 + 0.0333333333333333*G2_2;
+    A[1104] = 0.0666666666666666*G2_0 + 0.0333333333333333*G2_1;
+    A[1105] = -0.0333333333333333*G2_0 - 0.0333333333333333*G2_1;
+    A[1106] = -0.0666666666666667*G2_0 - 0.0333333333333333*G2_1 - 0.0666666666666666*G2_2;
+    A[1107] = -0.0333333333333333*G2_1 - 0.0333333333333333*G2_2;
+    A[1108] = 0.0083333333333333*G0_0 + 0.0083333333333333*G0_1 + 0.0083333333333333*G0_2;
+    A[1109] = -0.00833333333333333*G0_0;
+    A[1110] = 0.025*G0_1;
+    A[1111] = -0.00833333333333336*G0_2;
+    A[1112] = 0.0333333333333333*G0_1 + 0.0666666666666666*G0_2;
+    A[1113] = 0.0333333333333333*G0_0 + 0.0333333333333333*G0_2;
+    A[1114] = 0.0666666666666666*G0_0 + 0.0333333333333333*G0_1;
+    A[1115] = -0.0333333333333333*G0_0 - 0.0333333333333333*G0_1;
+    A[1116] = -0.0666666666666667*G0_0 - 0.0333333333333333*G0_1 - 0.0666666666666666*G0_2;
+    A[1117] = -0.0333333333333333*G0_1 - 0.0333333333333333*G0_2;
+    A[1118] = 0.0;
+    A[1119] = 0.0;
+    A[1120] = 0.0;
+    A[1121] = 0.0;
+    A[1122] = 0.00833333333333331*G1_0 + 0.00833333333333331*G1_1 + 0.00833333333333331*G1_2;
+    A[1123] = -0.00833333333333334*G1_0;
+    A[1124] = -0.00833333333333335*G1_1;
+    A[1125] = 0.025*G1_2;
+    A[1126] = 0.0666666666666667*G1_1 + 0.0333333333333333*G1_2;
+    A[1127] = 0.0666666666666666*G1_0 + 0.0333333333333333*G1_2;
+    A[1128] = 0.0333333333333333*G1_0 + 0.0333333333333333*G1_1;
+    A[1129] = -0.0666666666666666*G1_0 - 0.0666666666666666*G1_1 - 0.0333333333333333*G1_2;
+    A[1130] = -0.0333333333333333*G1_0 - 0.0333333333333333*G1_2;
+    A[1131] = -0.0333333333333333*G1_1 - 0.0333333333333333*G1_2;
+    A[1132] = 0.00833333333333331*G2_0 + 0.00833333333333331*G2_1 + 0.00833333333333331*G2_2;
+    A[1133] = -0.00833333333333334*G2_0;
+    A[1134] = -0.00833333333333335*G2_1;
+    A[1135] = 0.025*G2_2;
+    A[1136] = 0.0666666666666667*G2_1 + 0.0333333333333333*G2_2;
+    A[1137] = 0.0666666666666666*G2_0 + 0.0333333333333333*G2_2;
+    A[1138] = 0.0333333333333333*G2_0 + 0.0333333333333333*G2_1;
+    A[1139] = -0.0666666666666666*G2_0 - 0.0666666666666666*G2_1 - 0.0333333333333333*G2_2;
+    A[1140] = -0.0333333333333333*G2_0 - 0.0333333333333333*G2_2;
+    A[1141] = -0.0333333333333333*G2_1 - 0.0333333333333333*G2_2;
+    A[1142] = 0.00833333333333331*G0_0 + 0.00833333333333331*G0_1 + 0.00833333333333331*G0_2;
+    A[1143] = -0.00833333333333334*G0_0;
+    A[1144] = -0.00833333333333335*G0_1;
+    A[1145] = 0.025*G0_2;
+    A[1146] = 0.0666666666666667*G0_1 + 0.0333333333333333*G0_2;
+    A[1147] = 0.0666666666666666*G0_0 + 0.0333333333333333*G0_2;
+    A[1148] = 0.0333333333333333*G0_0 + 0.0333333333333333*G0_1;
+    A[1149] = -0.0666666666666666*G0_0 - 0.0666666666666666*G0_1 - 0.0333333333333333*G0_2;
+    A[1150] = -0.0333333333333333*G0_0 - 0.0333333333333333*G0_2;
+    A[1151] = -0.0333333333333333*G0_1 - 0.0333333333333333*G0_2;
+    A[1152] = 0.0;
+    A[1153] = 0.0;
+    A[1154] = 0.0;
+    A[1155] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stokes_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stokes_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    30
+    // Number of operations (multiply-add pairs) for tensor contraction: 285
+    // Total number of operations (multiply-add pairs):                  318
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_20 = det*w[0][20]*(1.0);
+    const double G0_21 = det*w[0][21]*(1.0);
+    const double G0_22 = det*w[0][22]*(1.0);
+    const double G0_23 = det*w[0][23]*(1.0);
+    const double G0_24 = det*w[0][24]*(1.0);
+    const double G0_25 = det*w[0][25]*(1.0);
+    const double G0_26 = det*w[0][26]*(1.0);
+    const double G0_27 = det*w[0][27]*(1.0);
+    const double G0_28 = det*w[0][28]*(1.0);
+    const double G0_29 = det*w[0][29]*(1.0);
+    const double G1_0 = det*w[0][0]*(1.0);
+    const double G1_1 = det*w[0][1]*(1.0);
+    const double G1_2 = det*w[0][2]*(1.0);
+    const double G1_3 = det*w[0][3]*(1.0);
+    const double G1_4 = det*w[0][4]*(1.0);
+    const double G1_5 = det*w[0][5]*(1.0);
+    const double G1_6 = det*w[0][6]*(1.0);
+    const double G1_7 = det*w[0][7]*(1.0);
+    const double G1_8 = det*w[0][8]*(1.0);
+    const double G1_9 = det*w[0][9]*(1.0);
+    const double G2_10 = det*w[0][10]*(1.0);
+    const double G2_11 = det*w[0][11]*(1.0);
+    const double G2_12 = det*w[0][12]*(1.0);
+    const double G2_13 = det*w[0][13]*(1.0);
+    const double G2_14 = det*w[0][14]*(1.0);
+    const double G2_15 = det*w[0][15]*(1.0);
+    const double G2_16 = det*w[0][16]*(1.0);
+    const double G2_17 = det*w[0][17]*(1.0);
+    const double G2_18 = det*w[0][18]*(1.0);
+    const double G2_19 = det*w[0][19]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00238095238095238*G1_0 + 0.000396825396825396*G1_1 + 0.000396825396825396*G1_2 + 0.000396825396825396*G1_3 - 0.00238095238095238*G1_4 - 0.00238095238095238*G1_5 - 0.00238095238095238*G1_6 - 0.00158730158730159*G1_7 - 0.00158730158730158*G1_8 - 0.00158730158730159*G1_9;
+    A[1] = 0.000396825396825396*G1_0 + 0.00238095238095238*G1_1 + 0.000396825396825395*G1_2 + 0.000396825396825396*G1_3 - 0.00238095238095238*G1_4 - 0.00158730158730158*G1_5 - 0.00158730158730158*G1_6 - 0.00238095238095238*G1_7 - 0.00238095238095238*G1_8 - 0.00158730158730158*G1_9;
+    A[2] = 0.000396825396825396*G1_0 + 0.000396825396825395*G1_1 + 0.00238095238095238*G1_2 + 0.000396825396825396*G1_3 - 0.00158730158730159*G1_4 - 0.00238095238095238*G1_5 - 0.00158730158730158*G1_6 - 0.00238095238095238*G1_7 - 0.00158730158730159*G1_8 - 0.00238095238095238*G1_9;
+    A[3] = 0.000396825396825396*G1_0 + 0.000396825396825396*G1_1 + 0.000396825396825396*G1_2 + 0.00238095238095238*G1_3 - 0.00158730158730159*G1_4 - 0.00158730158730159*G1_5 - 0.00238095238095238*G1_6 - 0.00158730158730159*G1_7 - 0.00238095238095238*G1_8 - 0.00238095238095238*G1_9;
+    A[4] = -0.00238095238095238*G1_0 - 0.00238095238095238*G1_1 - 0.00158730158730159*G1_2 - 0.00158730158730159*G1_3 + 0.0126984126984127*G1_4 + 0.00634920634920635*G1_5 + 0.00634920634920635*G1_6 + 0.00634920634920635*G1_7 + 0.00634920634920634*G1_8 + 0.00317460317460317*G1_9;
+    A[5] = -0.00238095238095238*G1_0 - 0.00158730158730158*G1_1 - 0.00238095238095238*G1_2 - 0.00158730158730159*G1_3 + 0.00634920634920635*G1_4 + 0.0126984126984127*G1_5 + 0.00634920634920635*G1_6 + 0.00634920634920635*G1_7 + 0.00317460317460317*G1_8 + 0.00634920634920635*G1_9;
+    A[6] = -0.00238095238095238*G1_0 - 0.00158730158730158*G1_1 - 0.00158730158730158*G1_2 - 0.00238095238095238*G1_3 + 0.00634920634920635*G1_4 + 0.00634920634920635*G1_5 + 0.0126984126984127*G1_6 + 0.00317460317460317*G1_7 + 0.00634920634920634*G1_8 + 0.00634920634920635*G1_9;
+    A[7] = -0.00158730158730159*G1_0 - 0.00238095238095238*G1_1 - 0.00238095238095238*G1_2 - 0.00158730158730159*G1_3 + 0.00634920634920635*G1_4 + 0.00634920634920635*G1_5 + 0.00317460317460317*G1_6 + 0.0126984126984127*G1_7 + 0.00634920634920635*G1_8 + 0.00634920634920635*G1_9;
+    A[8] = -0.00158730158730158*G1_0 - 0.00238095238095238*G1_1 - 0.00158730158730159*G1_2 - 0.00238095238095238*G1_3 + 0.00634920634920634*G1_4 + 0.00317460317460317*G1_5 + 0.00634920634920634*G1_6 + 0.00634920634920635*G1_7 + 0.0126984126984127*G1_8 + 0.00634920634920634*G1_9;
+    A[9] = -0.00158730158730159*G1_0 - 0.00158730158730158*G1_1 - 0.00238095238095238*G1_2 - 0.00238095238095238*G1_3 + 0.00317460317460317*G1_4 + 0.00634920634920635*G1_5 + 0.00634920634920635*G1_6 + 0.00634920634920635*G1_7 + 0.00634920634920634*G1_8 + 0.0126984126984127*G1_9;
+    A[10] = 0.00238095238095238*G2_10 + 0.000396825396825396*G2_11 + 0.000396825396825396*G2_12 + 0.000396825396825396*G2_13 - 0.00238095238095238*G2_14 - 0.00238095238095238*G2_15 - 0.00238095238095238*G2_16 - 0.00158730158730159*G2_17 - 0.00158730158730158*G2_18 - 0.00158730158730159*G2_19;
+    A[11] = 0.000396825396825396*G2_10 + 0.00238095238095238*G2_11 + 0.000396825396825395*G2_12 + 0.000396825396825396*G2_13 - 0.00238095238095238*G2_14 - 0.00158730158730158*G2_15 - 0.00158730158730158*G2_16 - 0.00238095238095238*G2_17 - 0.00238095238095238*G2_18 - 0.00158730158730158*G2_19;
+    A[12] = 0.000396825396825396*G2_10 + 0.000396825396825395*G2_11 + 0.00238095238095238*G2_12 + 0.000396825396825396*G2_13 - 0.00158730158730159*G2_14 - 0.00238095238095238*G2_15 - 0.00158730158730158*G2_16 - 0.00238095238095238*G2_17 - 0.00158730158730159*G2_18 - 0.00238095238095238*G2_19;
+    A[13] = 0.000396825396825396*G2_10 + 0.000396825396825396*G2_11 + 0.000396825396825396*G2_12 + 0.00238095238095238*G2_13 - 0.00158730158730159*G2_14 - 0.00158730158730159*G2_15 - 0.00238095238095238*G2_16 - 0.00158730158730159*G2_17 - 0.00238095238095238*G2_18 - 0.00238095238095238*G2_19;
+    A[14] = -0.00238095238095238*G2_10 - 0.00238095238095238*G2_11 - 0.00158730158730159*G2_12 - 0.00158730158730159*G2_13 + 0.0126984126984127*G2_14 + 0.00634920634920635*G2_15 + 0.00634920634920635*G2_16 + 0.00634920634920635*G2_17 + 0.00634920634920634*G2_18 + 0.00317460317460317*G2_19;
+    A[15] = -0.00238095238095238*G2_10 - 0.00158730158730158*G2_11 - 0.00238095238095238*G2_12 - 0.00158730158730159*G2_13 + 0.00634920634920635*G2_14 + 0.0126984126984127*G2_15 + 0.00634920634920635*G2_16 + 0.00634920634920635*G2_17 + 0.00317460317460317*G2_18 + 0.00634920634920635*G2_19;
+    A[16] = -0.00238095238095238*G2_10 - 0.00158730158730158*G2_11 - 0.00158730158730158*G2_12 - 0.00238095238095238*G2_13 + 0.00634920634920635*G2_14 + 0.00634920634920635*G2_15 + 0.0126984126984127*G2_16 + 0.00317460317460317*G2_17 + 0.00634920634920634*G2_18 + 0.00634920634920635*G2_19;
+    A[17] = -0.00158730158730159*G2_10 - 0.00238095238095238*G2_11 - 0.00238095238095238*G2_12 - 0.00158730158730159*G2_13 + 0.00634920634920635*G2_14 + 0.00634920634920635*G2_15 + 0.00317460317460317*G2_16 + 0.0126984126984127*G2_17 + 0.00634920634920635*G2_18 + 0.00634920634920635*G2_19;
+    A[18] = -0.00158730158730158*G2_10 - 0.00238095238095238*G2_11 - 0.00158730158730159*G2_12 - 0.00238095238095238*G2_13 + 0.00634920634920634*G2_14 + 0.00317460317460317*G2_15 + 0.00634920634920634*G2_16 + 0.00634920634920635*G2_17 + 0.0126984126984127*G2_18 + 0.00634920634920634*G2_19;
+    A[19] = -0.00158730158730159*G2_10 - 0.00158730158730158*G2_11 - 0.00238095238095238*G2_12 - 0.00238095238095238*G2_13 + 0.00317460317460317*G2_14 + 0.00634920634920635*G2_15 + 0.00634920634920635*G2_16 + 0.00634920634920635*G2_17 + 0.00634920634920634*G2_18 + 0.0126984126984127*G2_19;
+    A[20] = 0.00238095238095238*G0_20 + 0.000396825396825396*G0_21 + 0.000396825396825396*G0_22 + 0.000396825396825396*G0_23 - 0.00238095238095238*G0_24 - 0.00238095238095238*G0_25 - 0.00238095238095238*G0_26 - 0.00158730158730159*G0_27 - 0.00158730158730158*G0_28 - 0.00158730158730159*G0_29;
+    A[21] = 0.000396825396825396*G0_20 + 0.00238095238095238*G0_21 + 0.000396825396825395*G0_22 + 0.000396825396825396*G0_23 - 0.00238095238095238*G0_24 - 0.00158730158730158*G0_25 - 0.00158730158730158*G0_26 - 0.00238095238095238*G0_27 - 0.00238095238095238*G0_28 - 0.00158730158730158*G0_29;
+    A[22] = 0.000396825396825396*G0_20 + 0.000396825396825395*G0_21 + 0.00238095238095238*G0_22 + 0.000396825396825396*G0_23 - 0.00158730158730159*G0_24 - 0.00238095238095238*G0_25 - 0.00158730158730158*G0_26 - 0.00238095238095238*G0_27 - 0.00158730158730159*G0_28 - 0.00238095238095238*G0_29;
+    A[23] = 0.000396825396825396*G0_20 + 0.000396825396825396*G0_21 + 0.000396825396825396*G0_22 + 0.00238095238095238*G0_23 - 0.00158730158730159*G0_24 - 0.00158730158730159*G0_25 - 0.00238095238095238*G0_26 - 0.00158730158730159*G0_27 - 0.00238095238095238*G0_28 - 0.00238095238095238*G0_29;
+    A[24] = -0.00238095238095238*G0_20 - 0.00238095238095238*G0_21 - 0.00158730158730159*G0_22 - 0.00158730158730159*G0_23 + 0.0126984126984127*G0_24 + 0.00634920634920635*G0_25 + 0.00634920634920635*G0_26 + 0.00634920634920635*G0_27 + 0.00634920634920634*G0_28 + 0.00317460317460317*G0_29;
+    A[25] = -0.00238095238095238*G0_20 - 0.00158730158730158*G0_21 - 0.00238095238095238*G0_22 - 0.00158730158730159*G0_23 + 0.00634920634920635*G0_24 + 0.0126984126984127*G0_25 + 0.00634920634920635*G0_26 + 0.00634920634920635*G0_27 + 0.00317460317460317*G0_28 + 0.00634920634920635*G0_29;
+    A[26] = -0.00238095238095238*G0_20 - 0.00158730158730158*G0_21 - 0.00158730158730158*G0_22 - 0.00238095238095238*G0_23 + 0.00634920634920635*G0_24 + 0.00634920634920635*G0_25 + 0.0126984126984127*G0_26 + 0.00317460317460317*G0_27 + 0.00634920634920634*G0_28 + 0.00634920634920635*G0_29;
+    A[27] = -0.00158730158730159*G0_20 - 0.00238095238095238*G0_21 - 0.00238095238095238*G0_22 - 0.00158730158730159*G0_23 + 0.00634920634920635*G0_24 + 0.00634920634920635*G0_25 + 0.00317460317460317*G0_26 + 0.0126984126984127*G0_27 + 0.00634920634920635*G0_28 + 0.00634920634920635*G0_29;
+    A[28] = -0.00158730158730158*G0_20 - 0.00238095238095238*G0_21 - 0.00158730158730159*G0_22 - 0.00238095238095238*G0_23 + 0.00634920634920634*G0_24 + 0.00317460317460317*G0_25 + 0.00634920634920634*G0_26 + 0.00634920634920635*G0_27 + 0.0126984126984127*G0_28 + 0.00634920634920634*G0_29;
+    A[29] = -0.00158730158730159*G0_20 - 0.00158730158730158*G0_21 - 0.00238095238095238*G0_22 - 0.00238095238095238*G0_23 + 0.00317460317460317*G0_24 + 0.00634920634920635*G0_25 + 0.00634920634920635*G0_26 + 0.00634920634920635*G0_27 + 0.00634920634920634*G0_28 + 0.0126984126984127*G0_29;
+    A[30] = 0.0;
+    A[31] = 0.0;
+    A[32] = 0.0;
+    A[33] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stokes_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  stokes_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d2bd1464a06122616847f30e2eb63a4d3f1032614dc5d72f0d8470e88d514e6344c826a64bccbc9fc0744cbd7b28cc4a23c844352880b1f9a091c2f45079692d";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stokes_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stokes_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  stokes_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "33fb69dce1b5963691113bd78aeb3ecb47e147b917a8dfef4c9cea032026c68c38b9a0ca269e8d87ec73bfe4a1d02d4019db9676a8a534a56c780aca2e9a89d8";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stokes_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Stokes
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/stokes-iterative/cpp/Stokes.ufl b/demo/documented/stokes-iterative/cpp/Stokes.ufl
new file mode 100644
index 0000000..09bb9e6
--- /dev/null
+++ b/demo/documented/stokes-iterative/cpp/Stokes.ufl
@@ -0,0 +1,37 @@
+# Copyright (c) 2005-2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and Linear form L(v) for the Stokes
+# equations using a mixed formulation (Taylor-Hood elements).
+# The sign of the pressure has been flipped for symmetry.
+#
+# Compile this form with FFC: ffc -l dolfin Stokes.ufl
+
+P2 = VectorElement("Lagrange", tetrahedron, 2)
+P1 = FiniteElement("Lagrange", tetrahedron, 1)
+TH = P2 * P1
+
+(u, p) = TrialFunctions(TH)
+(v, q) = TestFunctions(TH)
+
+f = Coefficient(P2)
+
+a = (inner(grad(u), grad(v)) + div(v)*p + div(u)*q)*dx
+L = dot(f, v)*dx
diff --git a/demo/documented/stokes-iterative/cpp/StokesPreconditioner.h b/demo/documented/stokes-iterative/cpp/StokesPreconditioner.h
new file mode 100644
index 0000000..8767895
--- /dev/null
+++ b/demo/documented/stokes-iterative/cpp/StokesPreconditioner.h
@@ -0,0 +1,25227 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __STOKESPRECONDITIONER_H
+#define __STOKESPRECONDITIONER_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class stokespreconditioner_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokespreconditioner_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokespreconditioner_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 30;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 26:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 27:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 28:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 29:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 30; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 26:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 27:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 28:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 29:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 30; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[27];
+    for (unsigned int r = 0; r < 27; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 30; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 13:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 20:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 21:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 22:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 23:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 24:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 25:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 26:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 27:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 28:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 29:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[12] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[13] = vals[1];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[14] = vals[1];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[15] = vals[1];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[16] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[17] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[18] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[19] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[20] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[21] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[22] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[23] = vals[2];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[24] = vals[2];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[25] = vals[2];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[26] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[27] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[28] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[29] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[10];
+    vertex_values[4] = dof_values[11];
+    vertex_values[7] = dof_values[12];
+    vertex_values[10] = dof_values[13];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[20];
+    vertex_values[5] = dof_values[21];
+    vertex_values[8] = dof_values[22];
+    vertex_values[11] = dof_values[23];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokespreconditioner_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new stokespreconditioner_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new stokespreconditioner_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokespreconditioner_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokespreconditioner_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokespreconditioner_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokespreconditioner_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, 3, None), FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None), **{'value_shape': (4,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 34;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 4;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    values[3] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 26:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 27:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 28:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 29:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 30:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 31:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 32:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 33:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[4] = {0.0, 0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 34; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 4; s++)
+      {
+        values[r*4 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 4*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 26:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 27:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 28:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 29:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 30:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[3*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 31:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[3*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 32:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[3*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 33:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[3*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 34; r++)
+    {
+      for (unsigned int s = 0; s < 4*num_derivatives; s++)
+      {
+        values[r*4*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[36];
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 34; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 4*num_derivatives; s++)
+      {
+        values[r*4*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[4];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 13:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 20:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 21:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 22:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 23:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 24:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 25:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 26:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 27:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 28:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 29:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 30:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    case 31:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    case 32:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    case 33:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[4];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[12] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[13] = vals[1];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[14] = vals[1];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[15] = vals[1];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[16] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[17] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[18] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[19] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[20] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[21] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[22] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[23] = vals[2];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[24] = vals[2];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[25] = vals[2];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[26] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[27] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[28] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[29] = vals[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[30] = vals[3];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[31] = vals[3];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[32] = vals[3];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[33] = vals[3];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[4] = dof_values[1];
+    vertex_values[8] = dof_values[2];
+    vertex_values[12] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[10];
+    vertex_values[5] = dof_values[11];
+    vertex_values[9] = dof_values[12];
+    vertex_values[13] = dof_values[13];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[20];
+    vertex_values[6] = dof_values[21];
+    vertex_values[10] = dof_values[22];
+    vertex_values[14] = dof_values[23];
+    // Evaluate function and change variables
+    vertex_values[3] = dof_values[30];
+    vertex_values[7] = dof_values[31];
+    vertex_values[11] = dof_values[32];
+    vertex_values[15] = dof_values[33];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokespreconditioner_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new stokespreconditioner_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokespreconditioner_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokespreconditioner_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokespreconditioner_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokespreconditioner_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0] + 3*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 30;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 18;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 3;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[10] = offset + c.entity_indices[0][0];
+    dofs[11] = offset + c.entity_indices[0][1];
+    dofs[12] = offset + c.entity_indices[0][2];
+    dofs[13] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[14] = offset + c.entity_indices[1][0];
+    dofs[15] = offset + c.entity_indices[1][1];
+    dofs[16] = offset + c.entity_indices[1][2];
+    dofs[17] = offset + c.entity_indices[1][3];
+    dofs[18] = offset + c.entity_indices[1][4];
+    dofs[19] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[20] = offset + c.entity_indices[0][0];
+    dofs[21] = offset + c.entity_indices[0][1];
+    dofs[22] = offset + c.entity_indices[0][2];
+    dofs[23] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[24] = offset + c.entity_indices[1][0];
+    dofs[25] = offset + c.entity_indices[1][1];
+    dofs[26] = offset + c.entity_indices[1][2];
+    dofs[27] = offset + c.entity_indices[1][3];
+    dofs[28] = offset + c.entity_indices[1][4];
+    dofs[29] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 11;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 14;
+      dofs[10] = 15;
+      dofs[11] = 16;
+      dofs[12] = 21;
+      dofs[13] = 22;
+      dofs[14] = 23;
+      dofs[15] = 24;
+      dofs[16] = 25;
+      dofs[17] = 26;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+      dofs[6] = 10;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 14;
+      dofs[10] = 17;
+      dofs[11] = 18;
+      dofs[12] = 20;
+      dofs[13] = 22;
+      dofs[14] = 23;
+      dofs[15] = 24;
+      dofs[16] = 27;
+      dofs[17] = 28;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+      dofs[6] = 10;
+      dofs[7] = 11;
+      dofs[8] = 13;
+      dofs[9] = 15;
+      dofs[10] = 17;
+      dofs[11] = 19;
+      dofs[12] = 20;
+      dofs[13] = 21;
+      dofs[14] = 23;
+      dofs[15] = 25;
+      dofs[16] = 27;
+      dofs[17] = 29;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+      dofs[6] = 10;
+      dofs[7] = 11;
+      dofs[8] = 12;
+      dofs[9] = 16;
+      dofs[10] = 18;
+      dofs[11] = 19;
+      dofs[12] = 20;
+      dofs[13] = 21;
+      dofs[14] = 22;
+      dofs[15] = 26;
+      dofs[16] = 28;
+      dofs[17] = 29;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 10;
+        dofs[2] = 20;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 11;
+        dofs[2] = 21;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 12;
+        dofs[2] = 22;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 13;
+        dofs[2] = 23;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+        dofs[1] = 14;
+        dofs[2] = 24;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 15;
+        dofs[2] = 25;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+        dofs[1] = 16;
+        dofs[2] = 26;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+        dofs[1] = 17;
+        dofs[2] = 27;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+        dofs[1] = 18;
+        dofs[2] = 28;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+        dofs[1] = 19;
+        dofs[2] = 29;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[0];
+    dof_coordinates[10][1] = vertex_coordinates[1];
+    dof_coordinates[10][2] = vertex_coordinates[2];
+    dof_coordinates[11][0] = vertex_coordinates[3];
+    dof_coordinates[11][1] = vertex_coordinates[4];
+    dof_coordinates[11][2] = vertex_coordinates[5];
+    dof_coordinates[12][0] = vertex_coordinates[6];
+    dof_coordinates[12][1] = vertex_coordinates[7];
+    dof_coordinates[12][2] = vertex_coordinates[8];
+    dof_coordinates[13][0] = vertex_coordinates[9];
+    dof_coordinates[13][1] = vertex_coordinates[10];
+    dof_coordinates[13][2] = vertex_coordinates[11];
+    dof_coordinates[14][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[14][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[14][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[15][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[15][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[15][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[16][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[16][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[16][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[17][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[17][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[17][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[18][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[18][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[18][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[19][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[19][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[19][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[20][0] = vertex_coordinates[0];
+    dof_coordinates[20][1] = vertex_coordinates[1];
+    dof_coordinates[20][2] = vertex_coordinates[2];
+    dof_coordinates[21][0] = vertex_coordinates[3];
+    dof_coordinates[21][1] = vertex_coordinates[4];
+    dof_coordinates[21][2] = vertex_coordinates[5];
+    dof_coordinates[22][0] = vertex_coordinates[6];
+    dof_coordinates[22][1] = vertex_coordinates[7];
+    dof_coordinates[22][2] = vertex_coordinates[8];
+    dof_coordinates[23][0] = vertex_coordinates[9];
+    dof_coordinates[23][1] = vertex_coordinates[10];
+    dof_coordinates[23][2] = vertex_coordinates[11];
+    dof_coordinates[24][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[24][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[24][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[25][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[25][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[25][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[26][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[26][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[26][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[27][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[27][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[27][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[28][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[28][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[28][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[29][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[29][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[29][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokespreconditioner_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new stokespreconditioner_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new stokespreconditioner_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokespreconditioner_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokespreconditioner_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokespreconditioner_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokespreconditioner_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, 3, None), FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None), **{'value_shape': (4,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 4*num_global_entities[0] + 3*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 34;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 21;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 4;
+        break;
+      }
+    case 1:
+      {
+        return 3;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[10] = offset + c.entity_indices[0][0];
+    dofs[11] = offset + c.entity_indices[0][1];
+    dofs[12] = offset + c.entity_indices[0][2];
+    dofs[13] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[14] = offset + c.entity_indices[1][0];
+    dofs[15] = offset + c.entity_indices[1][1];
+    dofs[16] = offset + c.entity_indices[1][2];
+    dofs[17] = offset + c.entity_indices[1][3];
+    dofs[18] = offset + c.entity_indices[1][4];
+    dofs[19] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[20] = offset + c.entity_indices[0][0];
+    dofs[21] = offset + c.entity_indices[0][1];
+    dofs[22] = offset + c.entity_indices[0][2];
+    dofs[23] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[24] = offset + c.entity_indices[1][0];
+    dofs[25] = offset + c.entity_indices[1][1];
+    dofs[26] = offset + c.entity_indices[1][2];
+    dofs[27] = offset + c.entity_indices[1][3];
+    dofs[28] = offset + c.entity_indices[1][4];
+    dofs[29] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+    dofs[30] = offset + c.entity_indices[0][0];
+    dofs[31] = offset + c.entity_indices[0][1];
+    dofs[32] = offset + c.entity_indices[0][2];
+    dofs[33] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 11;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 14;
+      dofs[10] = 15;
+      dofs[11] = 16;
+      dofs[12] = 21;
+      dofs[13] = 22;
+      dofs[14] = 23;
+      dofs[15] = 24;
+      dofs[16] = 25;
+      dofs[17] = 26;
+      dofs[18] = 31;
+      dofs[19] = 32;
+      dofs[20] = 33;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+      dofs[6] = 10;
+      dofs[7] = 12;
+      dofs[8] = 13;
+      dofs[9] = 14;
+      dofs[10] = 17;
+      dofs[11] = 18;
+      dofs[12] = 20;
+      dofs[13] = 22;
+      dofs[14] = 23;
+      dofs[15] = 24;
+      dofs[16] = 27;
+      dofs[17] = 28;
+      dofs[18] = 30;
+      dofs[19] = 32;
+      dofs[20] = 33;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+      dofs[6] = 10;
+      dofs[7] = 11;
+      dofs[8] = 13;
+      dofs[9] = 15;
+      dofs[10] = 17;
+      dofs[11] = 19;
+      dofs[12] = 20;
+      dofs[13] = 21;
+      dofs[14] = 23;
+      dofs[15] = 25;
+      dofs[16] = 27;
+      dofs[17] = 29;
+      dofs[18] = 30;
+      dofs[19] = 31;
+      dofs[20] = 33;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+      dofs[6] = 10;
+      dofs[7] = 11;
+      dofs[8] = 12;
+      dofs[9] = 16;
+      dofs[10] = 18;
+      dofs[11] = 19;
+      dofs[12] = 20;
+      dofs[13] = 21;
+      dofs[14] = 22;
+      dofs[15] = 26;
+      dofs[16] = 28;
+      dofs[17] = 29;
+      dofs[18] = 30;
+      dofs[19] = 31;
+      dofs[20] = 32;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 10;
+        dofs[2] = 20;
+        dofs[3] = 30;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 11;
+        dofs[2] = 21;
+        dofs[3] = 31;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 12;
+        dofs[2] = 22;
+        dofs[3] = 32;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 13;
+        dofs[2] = 23;
+        dofs[3] = 33;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+        dofs[1] = 14;
+        dofs[2] = 24;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 15;
+        dofs[2] = 25;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+        dofs[1] = 16;
+        dofs[2] = 26;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+        dofs[1] = 17;
+        dofs[2] = 27;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+        dofs[1] = 18;
+        dofs[2] = 28;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+        dofs[1] = 19;
+        dofs[2] = 29;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[0];
+    dof_coordinates[10][1] = vertex_coordinates[1];
+    dof_coordinates[10][2] = vertex_coordinates[2];
+    dof_coordinates[11][0] = vertex_coordinates[3];
+    dof_coordinates[11][1] = vertex_coordinates[4];
+    dof_coordinates[11][2] = vertex_coordinates[5];
+    dof_coordinates[12][0] = vertex_coordinates[6];
+    dof_coordinates[12][1] = vertex_coordinates[7];
+    dof_coordinates[12][2] = vertex_coordinates[8];
+    dof_coordinates[13][0] = vertex_coordinates[9];
+    dof_coordinates[13][1] = vertex_coordinates[10];
+    dof_coordinates[13][2] = vertex_coordinates[11];
+    dof_coordinates[14][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[14][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[14][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[15][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[15][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[15][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[16][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[16][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[16][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[17][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[17][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[17][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[18][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[18][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[18][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[19][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[19][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[19][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[20][0] = vertex_coordinates[0];
+    dof_coordinates[20][1] = vertex_coordinates[1];
+    dof_coordinates[20][2] = vertex_coordinates[2];
+    dof_coordinates[21][0] = vertex_coordinates[3];
+    dof_coordinates[21][1] = vertex_coordinates[4];
+    dof_coordinates[21][2] = vertex_coordinates[5];
+    dof_coordinates[22][0] = vertex_coordinates[6];
+    dof_coordinates[22][1] = vertex_coordinates[7];
+    dof_coordinates[22][2] = vertex_coordinates[8];
+    dof_coordinates[23][0] = vertex_coordinates[9];
+    dof_coordinates[23][1] = vertex_coordinates[10];
+    dof_coordinates[23][2] = vertex_coordinates[11];
+    dof_coordinates[24][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[24][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[24][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[25][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[25][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[25][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[26][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[26][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[26][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[27][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[27][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[27][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[28][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[28][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[28][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[29][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[29][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[29][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    dof_coordinates[30][0] = vertex_coordinates[0];
+    dof_coordinates[30][1] = vertex_coordinates[1];
+    dof_coordinates[30][2] = vertex_coordinates[2];
+    dof_coordinates[31][0] = vertex_coordinates[3];
+    dof_coordinates[31][1] = vertex_coordinates[4];
+    dof_coordinates[31][2] = vertex_coordinates[5];
+    dof_coordinates[32][0] = vertex_coordinates[6];
+    dof_coordinates[32][1] = vertex_coordinates[7];
+    dof_coordinates[32][2] = vertex_coordinates[8];
+    dof_coordinates[33][0] = vertex_coordinates[9];
+    dof_coordinates[33][1] = vertex_coordinates[10];
+    dof_coordinates[33][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokespreconditioner_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new stokespreconditioner_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokespreconditioner_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stokespreconditioner_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    121
+    // Number of operations (multiply-add pairs) for tensor contraction: 3287
+    // Total number of operations (multiply-add pairs):                  3411
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    const double G1_0_0 = det*K[2]*K[2]*(1.0);
+    const double G1_0_1 = det*K[2]*K[5]*(1.0);
+    const double G1_0_2 = det*K[2]*K[8]*(1.0);
+    const double G1_1_0 = det*K[5]*K[2]*(1.0);
+    const double G1_1_1 = det*K[5]*K[5]*(1.0);
+    const double G1_1_2 = det*K[5]*K[8]*(1.0);
+    const double G1_2_0 = det*K[8]*K[2]*(1.0);
+    const double G1_2_1 = det*K[8]*K[5]*(1.0);
+    const double G1_2_2 = det*K[8]*K[8]*(1.0);
+    const double G2_0_0 = det*K[2]*K[2]*(1.0);
+    const double G2_0_1 = det*K[2]*K[5]*(1.0);
+    const double G2_0_2 = det*K[2]*K[8]*(1.0);
+    const double G2_1_0 = det*K[5]*K[2]*(1.0);
+    const double G2_1_1 = det*K[5]*K[5]*(1.0);
+    const double G2_1_2 = det*K[5]*K[8]*(1.0);
+    const double G2_2_0 = det*K[8]*K[2]*(1.0);
+    const double G2_2_1 = det*K[8]*K[5]*(1.0);
+    const double G2_2_2 = det*K[8]*K[8]*(1.0);
+    const double G3_0_0 = det*K[2]*K[2]*(1.0);
+    const double G3_0_1 = det*K[2]*K[5]*(1.0);
+    const double G3_0_2 = det*K[2]*K[8]*(1.0);
+    const double G3_1_0 = det*K[5]*K[2]*(1.0);
+    const double G3_1_1 = det*K[5]*K[5]*(1.0);
+    const double G3_1_2 = det*K[5]*K[8]*(1.0);
+    const double G3_2_0 = det*K[8]*K[2]*(1.0);
+    const double G3_2_1 = det*K[8]*K[5]*(1.0);
+    const double G3_2_2 = det*K[8]*K[8]*(1.0);
+    const double G4_0_0 = det*K[0]*K[0]*(1.0);
+    const double G4_0_1 = det*K[0]*K[3]*(1.0);
+    const double G4_0_2 = det*K[0]*K[6]*(1.0);
+    const double G4_1_0 = det*K[3]*K[0]*(1.0);
+    const double G4_1_1 = det*K[3]*K[3]*(1.0);
+    const double G4_1_2 = det*K[3]*K[6]*(1.0);
+    const double G4_2_0 = det*K[6]*K[0]*(1.0);
+    const double G4_2_1 = det*K[6]*K[3]*(1.0);
+    const double G4_2_2 = det*K[6]*K[6]*(1.0);
+    const double G5_0_0 = det*K[0]*K[0]*(1.0);
+    const double G5_0_1 = det*K[0]*K[3]*(1.0);
+    const double G5_0_2 = det*K[0]*K[6]*(1.0);
+    const double G5_1_0 = det*K[3]*K[0]*(1.0);
+    const double G5_1_1 = det*K[3]*K[3]*(1.0);
+    const double G5_1_2 = det*K[3]*K[6]*(1.0);
+    const double G5_2_0 = det*K[6]*K[0]*(1.0);
+    const double G5_2_1 = det*K[6]*K[3]*(1.0);
+    const double G5_2_2 = det*K[6]*K[6]*(1.0);
+    const double G6_0_0 = det*K[0]*K[0]*(1.0);
+    const double G6_0_1 = det*K[0]*K[3]*(1.0);
+    const double G6_0_2 = det*K[0]*K[6]*(1.0);
+    const double G6_1_0 = det*K[3]*K[0]*(1.0);
+    const double G6_1_1 = det*K[3]*K[3]*(1.0);
+    const double G6_1_2 = det*K[3]*K[6]*(1.0);
+    const double G6_2_0 = det*K[6]*K[0]*(1.0);
+    const double G6_2_1 = det*K[6]*K[3]*(1.0);
+    const double G6_2_2 = det*K[6]*K[6]*(1.0);
+    const double G7_0_0 = det*K[1]*K[1]*(1.0);
+    const double G7_0_1 = det*K[1]*K[4]*(1.0);
+    const double G7_0_2 = det*K[1]*K[7]*(1.0);
+    const double G7_1_0 = det*K[4]*K[1]*(1.0);
+    const double G7_1_1 = det*K[4]*K[4]*(1.0);
+    const double G7_1_2 = det*K[4]*K[7]*(1.0);
+    const double G7_2_0 = det*K[7]*K[1]*(1.0);
+    const double G7_2_1 = det*K[7]*K[4]*(1.0);
+    const double G7_2_2 = det*K[7]*K[7]*(1.0);
+    const double G8_0_0 = det*K[1]*K[1]*(1.0);
+    const double G8_0_1 = det*K[1]*K[4]*(1.0);
+    const double G8_0_2 = det*K[1]*K[7]*(1.0);
+    const double G8_1_0 = det*K[4]*K[1]*(1.0);
+    const double G8_1_1 = det*K[4]*K[4]*(1.0);
+    const double G8_1_2 = det*K[4]*K[7]*(1.0);
+    const double G8_2_0 = det*K[7]*K[1]*(1.0);
+    const double G8_2_1 = det*K[7]*K[4]*(1.0);
+    const double G8_2_2 = det*K[7]*K[7]*(1.0);
+    const double G9_0_0 = det*K[1]*K[1]*(1.0);
+    const double G9_0_1 = det*K[1]*K[4]*(1.0);
+    const double G9_0_2 = det*K[1]*K[7]*(1.0);
+    const double G9_1_0 = det*K[4]*K[1]*(1.0);
+    const double G9_1_1 = det*K[4]*K[4]*(1.0);
+    const double G9_1_2 = det*K[4]*K[7]*(1.0);
+    const double G9_2_0 = det*K[7]*K[1]*(1.0);
+    const double G9_2_1 = det*K[7]*K[4]*(1.0);
+    const double G9_2_2 = det*K[7]*K[7]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.1*G2_0_0 + 0.1*G2_0_1 + 0.1*G2_0_2 + 0.1*G2_1_0 + 0.1*G2_1_1 + 0.1*G2_1_2 + 0.1*G2_2_0 + 0.1*G2_2_1 + 0.1*G2_2_2 + 0.1*G5_0_0 + 0.1*G5_0_1 + 0.1*G5_0_2 + 0.1*G5_1_0 + 0.1*G5_1_1 + 0.1*G5_1_2 + 0.1*G5_2_0 + 0.1*G5_2_1 + 0.1*G5_2_2 + 0.1*G8_0_0 + 0.1*G8_0_1 + 0.1*G8_0_2 + 0.1*G8_1_0 + 0.1*G8_1_1 + 0.1*G8_1_2 + 0.1*G8_2_0 + 0.1*G8_2_1 + 0.1*G8_2_2;
+    A[1] = 0.0333333333333333*G2_0_0 + 0.0333333333333333*G2_1_0 + 0.0333333333333333*G2_2_0 + 0.0333333333333333*G5_0_0 + 0.0333333333333333*G5_1_0 + 0.0333333333333333*G5_2_0 + 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_2_0;
+    A[2] = 0.0333333333333333*G2_0_1 + 0.0333333333333333*G2_1_1 + 0.0333333333333333*G2_2_1 + 0.0333333333333333*G5_0_1 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G5_2_1 + 0.0333333333333333*G8_0_1 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_2_1;
+    A[3] = 0.0333333333333333*G2_0_2 + 0.0333333333333333*G2_1_2 + 0.0333333333333333*G2_2_2 + 0.0333333333333333*G5_0_2 + 0.0333333333333333*G5_1_2 + 0.0333333333333333*G5_2_2 + 0.0333333333333333*G8_0_2 + 0.0333333333333333*G8_1_2 + 0.0333333333333333*G8_2_2;
+    A[4] = 0.0333333333333333*G2_0_1 + 0.0333333333333333*G2_0_2 + 0.0333333333333333*G2_1_1 + 0.0333333333333333*G2_1_2 + 0.0333333333333333*G2_2_1 + 0.0333333333333333*G2_2_2 + 0.0333333333333333*G5_0_1 + 0.0333333333333333*G5_0_2 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G5_1_2 + 0.0333333333333333*G5_2_1 + 0.0333333333333333*G5_2_2 + 0.0333333333333333*G8_0_1 + 0.0333333333333333*G8_0_2 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_1_2 + 0.0333333333333333*G8_2_1 + 0.0333333333333333*G8_2_2;
+    A[5] = 0.0333333333333333*G2_0_0 + 0.0333333333333333*G2_0_2 + 0.0333333333333333*G2_1_0 + 0.0333333333333333*G2_1_2 + 0.0333333333333333*G2_2_0 + 0.0333333333333333*G2_2_2 + 0.0333333333333333*G5_0_0 + 0.0333333333333333*G5_0_2 + 0.0333333333333333*G5_1_0 + 0.0333333333333333*G5_1_2 + 0.0333333333333333*G5_2_0 + 0.0333333333333333*G5_2_2 + 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_0_2 + 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_1_2 + 0.0333333333333333*G8_2_0 + 0.0333333333333333*G8_2_2;
+    A[6] = 0.0333333333333332*G2_0_0 + 0.0333333333333333*G2_0_1 + 0.0333333333333333*G2_1_0 + 0.0333333333333333*G2_1_1 + 0.0333333333333333*G2_2_0 + 0.0333333333333333*G2_2_1 + 0.0333333333333332*G5_0_0 + 0.0333333333333333*G5_0_1 + 0.0333333333333333*G5_1_0 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G5_2_0 + 0.0333333333333333*G5_2_1 + 0.0333333333333332*G8_0_0 + 0.0333333333333333*G8_0_1 + 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_2_0 + 0.0333333333333333*G8_2_1;
+    A[7] = -0.0333333333333333*G2_0_0 - 0.0333333333333333*G2_0_1 - 0.133333333333333*G2_0_2 - 0.0333333333333333*G2_1_0 - 0.0333333333333333*G2_1_1 - 0.133333333333333*G2_1_2 - 0.0333333333333333*G2_2_0 - 0.0333333333333333*G2_2_1 - 0.133333333333333*G2_2_2 - 0.0333333333333333*G5_0_0 - 0.0333333333333333*G5_0_1 - 0.133333333333333*G5_0_2 - 0.0333333333333333*G5_1_0 - 0.0333333333333333*G5_1_1 - 0.133333333333333*G5_1_2 - 0.0333333333333333*G5_2_0 - 0.0333333333333333*G5_2_1 - 0.133333333333333*G5_2_2 - 0.0333333333333333*G8_0_0 - 0.0333333333333333*G8_0_1 - 0.133333333333333*G8_0_2 - 0.0333333333333333*G8_1_0 - 0.0333333333333333*G8_1_1 - 0.133333333333333*G8_1_2 - 0.0333333333333333*G8_2_0 - 0.0333333333333333*G8_2_1 - 0.133333333333333*G8_2_2;
+    A[8] = -0.0333333333333332*G2_0_0 - 0.133333333333333*G2_0_1 - 0.0333333333333333*G2_0_2 - 0.0333333333333333*G2_1_0 - 0.133333333333333*G2_1_1 - 0.0333333333333333*G2_1_2 - 0.0333333333333333*G2_2_0 - 0.133333333333333*G2_2_1 - 0.0333333333333333*G2_2_2 - 0.0333333333333332*G5_0_0 - 0.133333333333333*G5_0_1 - 0.0333333333333333*G5_0_2 - 0.0333333333333333*G5_1_0 - 0.133333333333333*G5_1_1 - 0.0333333333333333*G5_1_2 - 0.0333333333333333*G5_2_0 - 0.133333333333333*G5_2_1 - 0.0333333333333333*G5_2_2 - 0.0333333333333332*G8_0_0 - 0.133333333333333*G8_0_1 - 0.0333333333333333*G8_0_2 - 0.0333333333333333*G8_1_0 - 0.133333333333333*G8_1_1 - 0.0333333333333333*G8_1_2 - 0.0333333333333333*G8_2_0 - 0.133333333333333*G8_2_1 - 0.0333333333333333*G8_2_2;
+    A[9] = -0.133333333333333*G2_0_0 - 0.0333333333333333*G2_0_1 - 0.0333333333333333*G2_0_2 - 0.133333333333333*G2_1_0 - 0.0333333333333333*G2_1_1 - 0.0333333333333333*G2_1_2 - 0.133333333333333*G2_2_0 - 0.0333333333333333*G2_2_1 - 0.0333333333333333*G2_2_2 - 0.133333333333333*G5_0_0 - 0.0333333333333333*G5_0_1 - 0.0333333333333333*G5_0_2 - 0.133333333333333*G5_1_0 - 0.0333333333333333*G5_1_1 - 0.0333333333333333*G5_1_2 - 0.133333333333333*G5_2_0 - 0.0333333333333333*G5_2_1 - 0.0333333333333333*G5_2_2 - 0.133333333333333*G8_0_0 - 0.0333333333333333*G8_0_1 - 0.0333333333333333*G8_0_2 - 0.133333333333333*G8_1_0 - 0.0333333333333333*G8_1_1 - 0.0333333333333333*G8_1_2 - 0.133333333333333*G8_2_0 - 0.0333333333333333*G8_2_1 - 0.0333333333333333*G8_2_2;
+    A[10] = 0.0;
+    A[11] = 0.0;
+    A[12] = 0.0;
+    A[13] = 0.0;
+    A[14] = 0.0;
+    A[15] = 0.0;
+    A[16] = 0.0;
+    A[17] = 0.0;
+    A[18] = 0.0;
+    A[19] = 0.0;
+    A[20] = 0.0;
+    A[21] = 0.0;
+    A[22] = 0.0;
+    A[23] = 0.0;
+    A[24] = 0.0;
+    A[25] = 0.0;
+    A[26] = 0.0;
+    A[27] = 0.0;
+    A[28] = 0.0;
+    A[29] = 0.0;
+    A[30] = 0.0;
+    A[31] = 0.0;
+    A[32] = 0.0;
+    A[33] = 0.0;
+    A[34] = 0.0333333333333333*G2_0_0 + 0.0333333333333333*G2_0_1 + 0.0333333333333333*G2_0_2 + 0.0333333333333333*G5_0_0 + 0.0333333333333333*G5_0_1 + 0.0333333333333333*G5_0_2 + 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_0_1 + 0.0333333333333333*G8_0_2;
+    A[35] = 0.1*G2_0_0 + 0.1*G5_0_0 + 0.1*G8_0_0;
+    A[36] = -0.0333333333333333*G2_0_1 - 0.0333333333333333*G5_0_1 - 0.0333333333333333*G8_0_1;
+    A[37] = -0.0333333333333333*G2_0_2 - 0.0333333333333333*G5_0_2 - 0.0333333333333333*G8_0_2;
+    A[38] = -0.0333333333333333*G2_0_1 - 0.0333333333333333*G2_0_2 - 0.0333333333333333*G5_0_1 - 0.0333333333333333*G5_0_2 - 0.0333333333333333*G8_0_1 - 0.0333333333333333*G8_0_2;
+    A[39] = -0.0333333333333333*G2_0_0 + 0.1*G2_0_2 - 0.0333333333333333*G5_0_0 + 0.1*G5_0_2 - 0.0333333333333333*G8_0_0 + 0.1*G8_0_2;
+    A[40] = -0.0333333333333333*G2_0_0 + 0.1*G2_0_1 - 0.0333333333333333*G5_0_0 + 0.1*G5_0_1 - 0.0333333333333333*G8_0_0 + 0.1*G8_0_1;
+    A[41] = 0.0333333333333333*G2_0_0 + 0.0333333333333333*G2_0_1 + 0.0333333333333333*G5_0_0 + 0.0333333333333333*G5_0_1 + 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_0_1;
+    A[42] = 0.0333333333333333*G2_0_0 + 0.0333333333333333*G2_0_2 + 0.0333333333333333*G5_0_0 + 0.0333333333333333*G5_0_2 + 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_0_2;
+    A[43] = -0.133333333333333*G2_0_0 - 0.1*G2_0_1 - 0.1*G2_0_2 - 0.133333333333333*G5_0_0 - 0.1*G5_0_1 - 0.1*G5_0_2 - 0.133333333333333*G8_0_0 - 0.1*G8_0_1 - 0.1*G8_0_2;
+    A[44] = 0.0;
+    A[45] = 0.0;
+    A[46] = 0.0;
+    A[47] = 0.0;
+    A[48] = 0.0;
+    A[49] = 0.0;
+    A[50] = 0.0;
+    A[51] = 0.0;
+    A[52] = 0.0;
+    A[53] = 0.0;
+    A[54] = 0.0;
+    A[55] = 0.0;
+    A[56] = 0.0;
+    A[57] = 0.0;
+    A[58] = 0.0;
+    A[59] = 0.0;
+    A[60] = 0.0;
+    A[61] = 0.0;
+    A[62] = 0.0;
+    A[63] = 0.0;
+    A[64] = 0.0;
+    A[65] = 0.0;
+    A[66] = 0.0;
+    A[67] = 0.0;
+    A[68] = 0.0333333333333333*G2_1_0 + 0.0333333333333333*G2_1_1 + 0.0333333333333333*G2_1_2 + 0.0333333333333333*G5_1_0 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G5_1_2 + 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_1_2;
+    A[69] = -0.0333333333333333*G2_1_0 - 0.0333333333333333*G5_1_0 - 0.0333333333333333*G8_1_0;
+    A[70] = 0.1*G2_1_1 + 0.1*G5_1_1 + 0.1*G8_1_1;
+    A[71] = -0.0333333333333333*G2_1_2 - 0.0333333333333333*G5_1_2 - 0.0333333333333333*G8_1_2;
+    A[72] = -0.0333333333333334*G2_1_1 + 0.1*G2_1_2 - 0.0333333333333334*G5_1_1 + 0.1*G5_1_2 - 0.0333333333333334*G8_1_1 + 0.1*G8_1_2;
+    A[73] = -0.0333333333333333*G2_1_0 - 0.0333333333333333*G2_1_2 - 0.0333333333333333*G5_1_0 - 0.0333333333333333*G5_1_2 - 0.0333333333333333*G8_1_0 - 0.0333333333333333*G8_1_2;
+    A[74] = 0.1*G2_1_0 - 0.0333333333333333*G2_1_1 + 0.1*G5_1_0 - 0.0333333333333333*G5_1_1 + 0.1*G8_1_0 - 0.0333333333333333*G8_1_1;
+    A[75] = 0.0333333333333333*G2_1_0 + 0.0333333333333333*G2_1_1 + 0.0333333333333333*G5_1_0 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_1_1;
+    A[76] = -0.1*G2_1_0 - 0.133333333333333*G2_1_1 - 0.1*G2_1_2 - 0.1*G5_1_0 - 0.133333333333333*G5_1_1 - 0.1*G5_1_2 - 0.1*G8_1_0 - 0.133333333333333*G8_1_1 - 0.1*G8_1_2;
+    A[77] = 0.0333333333333333*G2_1_1 + 0.0333333333333333*G2_1_2 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G5_1_2 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_1_2;
+    A[78] = 0.0;
+    A[79] = 0.0;
+    A[80] = 0.0;
+    A[81] = 0.0;
+    A[82] = 0.0;
+    A[83] = 0.0;
+    A[84] = 0.0;
+    A[85] = 0.0;
+    A[86] = 0.0;
+    A[87] = 0.0;
+    A[88] = 0.0;
+    A[89] = 0.0;
+    A[90] = 0.0;
+    A[91] = 0.0;
+    A[92] = 0.0;
+    A[93] = 0.0;
+    A[94] = 0.0;
+    A[95] = 0.0;
+    A[96] = 0.0;
+    A[97] = 0.0;
+    A[98] = 0.0;
+    A[99] = 0.0;
+    A[100] = 0.0;
+    A[101] = 0.0;
+    A[102] = 0.0333333333333333*G2_2_0 + 0.0333333333333333*G2_2_1 + 0.0333333333333333*G2_2_2 + 0.0333333333333333*G5_2_0 + 0.0333333333333333*G5_2_1 + 0.0333333333333333*G5_2_2 + 0.0333333333333333*G8_2_0 + 0.0333333333333333*G8_2_1 + 0.0333333333333333*G8_2_2;
+    A[103] = -0.0333333333333333*G2_2_0 - 0.0333333333333333*G5_2_0 - 0.0333333333333333*G8_2_0;
+    A[104] = -0.0333333333333333*G2_2_1 - 0.0333333333333333*G5_2_1 - 0.0333333333333333*G8_2_1;
+    A[105] = 0.1*G2_2_2 + 0.1*G5_2_2 + 0.1*G8_2_2;
+    A[106] = 0.1*G2_2_1 - 0.0333333333333334*G2_2_2 + 0.1*G5_2_1 - 0.0333333333333334*G5_2_2 + 0.1*G8_2_1 - 0.0333333333333334*G8_2_2;
+    A[107] = 0.1*G2_2_0 - 0.0333333333333333*G2_2_2 + 0.1*G5_2_0 - 0.0333333333333333*G5_2_2 + 0.1*G8_2_0 - 0.0333333333333333*G8_2_2;
+    A[108] = -0.0333333333333333*G2_2_0 - 0.0333333333333333*G2_2_1 - 0.0333333333333333*G5_2_0 - 0.0333333333333333*G5_2_1 - 0.0333333333333333*G8_2_0 - 0.0333333333333333*G8_2_1;
+    A[109] = -0.1*G2_2_0 - 0.1*G2_2_1 - 0.133333333333333*G2_2_2 - 0.1*G5_2_0 - 0.1*G5_2_1 - 0.133333333333333*G5_2_2 - 0.1*G8_2_0 - 0.1*G8_2_1 - 0.133333333333333*G8_2_2;
+    A[110] = 0.0333333333333333*G2_2_0 + 0.0333333333333334*G2_2_2 + 0.0333333333333333*G5_2_0 + 0.0333333333333334*G5_2_2 + 0.0333333333333333*G8_2_0 + 0.0333333333333334*G8_2_2;
+    A[111] = 0.0333333333333333*G2_2_1 + 0.0333333333333333*G2_2_2 + 0.0333333333333333*G5_2_1 + 0.0333333333333333*G5_2_2 + 0.0333333333333333*G8_2_1 + 0.0333333333333333*G8_2_2;
+    A[112] = 0.0;
+    A[113] = 0.0;
+    A[114] = 0.0;
+    A[115] = 0.0;
+    A[116] = 0.0;
+    A[117] = 0.0;
+    A[118] = 0.0;
+    A[119] = 0.0;
+    A[120] = 0.0;
+    A[121] = 0.0;
+    A[122] = 0.0;
+    A[123] = 0.0;
+    A[124] = 0.0;
+    A[125] = 0.0;
+    A[126] = 0.0;
+    A[127] = 0.0;
+    A[128] = 0.0;
+    A[129] = 0.0;
+    A[130] = 0.0;
+    A[131] = 0.0;
+    A[132] = 0.0;
+    A[133] = 0.0;
+    A[134] = 0.0;
+    A[135] = 0.0;
+    A[136] = 0.0333333333333333*G2_1_0 + 0.0333333333333333*G2_1_1 + 0.0333333333333333*G2_1_2 + 0.0333333333333333*G2_2_0 + 0.0333333333333333*G2_2_1 + 0.0333333333333333*G2_2_2 + 0.0333333333333333*G5_1_0 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G5_1_2 + 0.0333333333333333*G5_2_0 + 0.0333333333333333*G5_2_1 + 0.0333333333333333*G5_2_2 + 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_1_2 + 0.0333333333333333*G8_2_0 + 0.0333333333333333*G8_2_1 + 0.0333333333333333*G8_2_2;
+    A[137] = -0.0333333333333333*G2_1_0 - 0.0333333333333333*G2_2_0 - 0.0333333333333333*G5_1_0 - 0.0333333333333333*G5_2_0 - 0.0333333333333333*G8_1_0 - 0.0333333333333333*G8_2_0;
+    A[138] = -0.0333333333333334*G2_1_1 + 0.1*G2_2_1 - 0.0333333333333334*G5_1_1 + 0.1*G5_2_1 - 0.0333333333333334*G8_1_1 + 0.1*G8_2_1;
+    A[139] = 0.1*G2_1_2 - 0.0333333333333334*G2_2_2 + 0.1*G5_1_2 - 0.0333333333333334*G5_2_2 + 0.1*G8_1_2 - 0.0333333333333334*G8_2_2;
+    A[140] = 0.266666666666667*G2_1_1 + 0.133333333333333*G2_1_2 + 0.133333333333333*G2_2_1 + 0.266666666666666*G2_2_2 + 0.266666666666667*G5_1_1 + 0.133333333333333*G5_1_2 + 0.133333333333333*G5_2_1 + 0.266666666666666*G5_2_2 + 0.266666666666667*G8_1_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_1 + 0.266666666666666*G8_2_2;
+    A[141] = 0.266666666666667*G2_1_0 + 0.133333333333333*G2_1_2 + 0.133333333333333*G2_2_0 + 0.133333333333333*G2_2_2 + 0.266666666666667*G5_1_0 + 0.133333333333333*G5_1_2 + 0.133333333333333*G5_2_0 + 0.133333333333333*G5_2_2 + 0.266666666666667*G8_1_0 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_2;
+    A[142] = 0.133333333333333*G2_1_0 + 0.133333333333333*G2_1_1 + 0.266666666666666*G2_2_0 + 0.133333333333333*G2_2_1 + 0.133333333333333*G5_1_0 + 0.133333333333333*G5_1_1 + 0.266666666666666*G5_2_0 + 0.133333333333333*G5_2_1 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_1_1 + 0.266666666666666*G8_2_0 + 0.133333333333333*G8_2_1;
+    A[143] = -0.266666666666667*G2_1_0 - 0.266666666666667*G2_1_1 - 0.133333333333333*G2_1_2 - 0.133333333333333*G2_2_0 - 0.133333333333333*G2_2_1 - 0.266666666666667*G5_1_0 - 0.266666666666667*G5_1_1 - 0.133333333333333*G5_1_2 - 0.133333333333333*G5_2_0 - 0.133333333333333*G5_2_1 - 0.266666666666667*G8_1_0 - 0.266666666666667*G8_1_1 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_1;
+    A[144] = -0.133333333333333*G2_1_0 - 0.133333333333333*G2_1_2 - 0.266666666666666*G2_2_0 - 0.133333333333333*G2_2_1 - 0.266666666666666*G2_2_2 - 0.133333333333333*G5_1_0 - 0.133333333333333*G5_1_2 - 0.266666666666666*G5_2_0 - 0.133333333333333*G5_2_1 - 0.266666666666666*G5_2_2 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_2 - 0.266666666666666*G8_2_0 - 0.133333333333333*G8_2_1 - 0.266666666666666*G8_2_2;
+    A[145] = -0.133333333333333*G2_1_1 - 0.133333333333333*G2_1_2 - 0.133333333333333*G2_2_1 - 0.133333333333333*G2_2_2 - 0.133333333333333*G5_1_1 - 0.133333333333333*G5_1_2 - 0.133333333333333*G5_2_1 - 0.133333333333333*G5_2_2 - 0.133333333333333*G8_1_1 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_1 - 0.133333333333333*G8_2_2;
+    A[146] = 0.0;
+    A[147] = 0.0;
+    A[148] = 0.0;
+    A[149] = 0.0;
+    A[150] = 0.0;
+    A[151] = 0.0;
+    A[152] = 0.0;
+    A[153] = 0.0;
+    A[154] = 0.0;
+    A[155] = 0.0;
+    A[156] = 0.0;
+    A[157] = 0.0;
+    A[158] = 0.0;
+    A[159] = 0.0;
+    A[160] = 0.0;
+    A[161] = 0.0;
+    A[162] = 0.0;
+    A[163] = 0.0;
+    A[164] = 0.0;
+    A[165] = 0.0;
+    A[166] = 0.0;
+    A[167] = 0.0;
+    A[168] = 0.0;
+    A[169] = 0.0;
+    A[170] = 0.0333333333333333*G2_0_0 + 0.0333333333333333*G2_0_1 + 0.0333333333333333*G2_0_2 + 0.0333333333333333*G2_2_0 + 0.0333333333333333*G2_2_1 + 0.0333333333333333*G2_2_2 + 0.0333333333333333*G5_0_0 + 0.0333333333333333*G5_0_1 + 0.0333333333333333*G5_0_2 + 0.0333333333333333*G5_2_0 + 0.0333333333333333*G5_2_1 + 0.0333333333333333*G5_2_2 + 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_0_1 + 0.0333333333333333*G8_0_2 + 0.0333333333333333*G8_2_0 + 0.0333333333333333*G8_2_1 + 0.0333333333333333*G8_2_2;
+    A[171] = -0.0333333333333333*G2_0_0 + 0.1*G2_2_0 - 0.0333333333333333*G5_0_0 + 0.1*G5_2_0 - 0.0333333333333333*G8_0_0 + 0.1*G8_2_0;
+    A[172] = -0.0333333333333333*G2_0_1 - 0.0333333333333333*G2_2_1 - 0.0333333333333333*G5_0_1 - 0.0333333333333333*G5_2_1 - 0.0333333333333333*G8_0_1 - 0.0333333333333333*G8_2_1;
+    A[173] = 0.1*G2_0_2 - 0.0333333333333333*G2_2_2 + 0.1*G5_0_2 - 0.0333333333333333*G5_2_2 + 0.1*G8_0_2 - 0.0333333333333333*G8_2_2;
+    A[174] = 0.266666666666667*G2_0_1 + 0.133333333333333*G2_0_2 + 0.133333333333333*G2_2_1 + 0.133333333333333*G2_2_2 + 0.266666666666667*G5_0_1 + 0.133333333333333*G5_0_2 + 0.133333333333333*G5_2_1 + 0.133333333333333*G5_2_2 + 0.266666666666667*G8_0_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_2_1 + 0.133333333333333*G8_2_2;
+    A[175] = 0.266666666666666*G2_0_0 + 0.133333333333333*G2_0_2 + 0.133333333333333*G2_2_0 + 0.266666666666666*G2_2_2 + 0.266666666666666*G5_0_0 + 0.133333333333333*G5_0_2 + 0.133333333333333*G5_2_0 + 0.266666666666666*G5_2_2 + 0.266666666666666*G8_0_0 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_2_0 + 0.266666666666666*G8_2_2;
+    A[176] = 0.133333333333333*G2_0_0 + 0.133333333333333*G2_0_1 + 0.133333333333333*G2_2_0 + 0.266666666666666*G2_2_1 + 0.133333333333333*G5_0_0 + 0.133333333333333*G5_0_1 + 0.133333333333333*G5_2_0 + 0.266666666666666*G5_2_1 + 0.133333333333333*G8_0_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_2_0 + 0.266666666666666*G8_2_1;
+    A[177] = -0.266666666666666*G2_0_0 - 0.266666666666666*G2_0_1 - 0.133333333333333*G2_0_2 - 0.133333333333333*G2_2_0 - 0.133333333333333*G2_2_1 - 0.266666666666666*G5_0_0 - 0.266666666666666*G5_0_1 - 0.133333333333333*G5_0_2 - 0.133333333333333*G5_2_0 - 0.133333333333333*G5_2_1 - 0.266666666666666*G8_0_0 - 0.266666666666666*G8_0_1 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_1;
+    A[178] = -0.133333333333333*G2_0_0 - 0.133333333333333*G2_0_2 - 0.133333333333333*G2_2_0 - 0.133333333333333*G2_2_2 - 0.133333333333333*G5_0_0 - 0.133333333333333*G5_0_2 - 0.133333333333333*G5_2_0 - 0.133333333333333*G5_2_2 - 0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_2;
+    A[179] = -0.133333333333333*G2_0_1 - 0.133333333333333*G2_0_2 - 0.133333333333333*G2_2_0 - 0.266666666666666*G2_2_1 - 0.266666666666666*G2_2_2 - 0.133333333333333*G5_0_1 - 0.133333333333333*G5_0_2 - 0.133333333333333*G5_2_0 - 0.266666666666666*G5_2_1 - 0.266666666666666*G5_2_2 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_2_0 - 0.266666666666666*G8_2_1 - 0.266666666666666*G8_2_2;
+    A[180] = 0.0;
+    A[181] = 0.0;
+    A[182] = 0.0;
+    A[183] = 0.0;
+    A[184] = 0.0;
+    A[185] = 0.0;
+    A[186] = 0.0;
+    A[187] = 0.0;
+    A[188] = 0.0;
+    A[189] = 0.0;
+    A[190] = 0.0;
+    A[191] = 0.0;
+    A[192] = 0.0;
+    A[193] = 0.0;
+    A[194] = 0.0;
+    A[195] = 0.0;
+    A[196] = 0.0;
+    A[197] = 0.0;
+    A[198] = 0.0;
+    A[199] = 0.0;
+    A[200] = 0.0;
+    A[201] = 0.0;
+    A[202] = 0.0;
+    A[203] = 0.0;
+    A[204] = 0.0333333333333332*G2_0_0 + 0.0333333333333333*G2_0_1 + 0.0333333333333333*G2_0_2 + 0.0333333333333333*G2_1_0 + 0.0333333333333333*G2_1_1 + 0.0333333333333333*G2_1_2 + 0.0333333333333332*G5_0_0 + 0.0333333333333333*G5_0_1 + 0.0333333333333333*G5_0_2 + 0.0333333333333333*G5_1_0 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G5_1_2 + 0.0333333333333332*G8_0_0 + 0.0333333333333333*G8_0_1 + 0.0333333333333333*G8_0_2 + 0.0333333333333333*G8_1_0 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_1_2;
+    A[205] = -0.0333333333333333*G2_0_0 + 0.1*G2_1_0 - 0.0333333333333333*G5_0_0 + 0.1*G5_1_0 - 0.0333333333333333*G8_0_0 + 0.1*G8_1_0;
+    A[206] = 0.1*G2_0_1 - 0.0333333333333333*G2_1_1 + 0.1*G5_0_1 - 0.0333333333333333*G5_1_1 + 0.1*G8_0_1 - 0.0333333333333333*G8_1_1;
+    A[207] = -0.0333333333333333*G2_0_2 - 0.0333333333333333*G2_1_2 - 0.0333333333333333*G5_0_2 - 0.0333333333333333*G5_1_2 - 0.0333333333333333*G8_0_2 - 0.0333333333333333*G8_1_2;
+    A[208] = 0.133333333333333*G2_0_1 + 0.266666666666666*G2_0_2 + 0.133333333333333*G2_1_1 + 0.133333333333333*G2_1_2 + 0.133333333333333*G5_0_1 + 0.266666666666666*G5_0_2 + 0.133333333333333*G5_1_1 + 0.133333333333333*G5_1_2 + 0.133333333333333*G8_0_1 + 0.266666666666666*G8_0_2 + 0.133333333333333*G8_1_1 + 0.133333333333333*G8_1_2;
+    A[209] = 0.133333333333333*G2_0_0 + 0.133333333333333*G2_0_2 + 0.133333333333333*G2_1_0 + 0.266666666666666*G2_1_2 + 0.133333333333333*G5_0_0 + 0.133333333333333*G5_0_2 + 0.133333333333333*G5_1_0 + 0.266666666666666*G5_1_2 + 0.133333333333333*G8_0_0 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.266666666666666*G8_1_2;
+    A[210] = 0.266666666666666*G2_0_0 + 0.133333333333333*G2_0_1 + 0.133333333333333*G2_1_0 + 0.266666666666666*G2_1_1 + 0.266666666666666*G5_0_0 + 0.133333333333333*G5_0_1 + 0.133333333333333*G5_1_0 + 0.266666666666666*G5_1_1 + 0.266666666666666*G8_0_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_1_0 + 0.266666666666666*G8_1_1;
+    A[211] = -0.133333333333333*G2_0_0 - 0.133333333333333*G2_0_1 - 0.133333333333333*G2_1_0 - 0.133333333333333*G2_1_1 - 0.133333333333333*G5_0_0 - 0.133333333333333*G5_0_1 - 0.133333333333333*G5_1_0 - 0.133333333333333*G5_1_1 - 0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_1;
+    A[212] = -0.266666666666666*G2_0_0 - 0.133333333333333*G2_0_1 - 0.266666666666666*G2_0_2 - 0.133333333333333*G2_1_0 - 0.133333333333333*G2_1_2 - 0.266666666666666*G5_0_0 - 0.133333333333333*G5_0_1 - 0.266666666666666*G5_0_2 - 0.133333333333333*G5_1_0 - 0.133333333333333*G5_1_2 - 0.266666666666666*G8_0_0 - 0.133333333333333*G8_0_1 - 0.266666666666666*G8_0_2 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_2;
+    A[213] = -0.133333333333333*G2_0_1 - 0.133333333333333*G2_0_2 - 0.133333333333333*G2_1_0 - 0.266666666666666*G2_1_1 - 0.266666666666666*G2_1_2 - 0.133333333333333*G5_0_1 - 0.133333333333333*G5_0_2 - 0.133333333333333*G5_1_0 - 0.266666666666666*G5_1_1 - 0.266666666666666*G5_1_2 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_1_0 - 0.266666666666666*G8_1_1 - 0.266666666666666*G8_1_2;
+    A[214] = 0.0;
+    A[215] = 0.0;
+    A[216] = 0.0;
+    A[217] = 0.0;
+    A[218] = 0.0;
+    A[219] = 0.0;
+    A[220] = 0.0;
+    A[221] = 0.0;
+    A[222] = 0.0;
+    A[223] = 0.0;
+    A[224] = 0.0;
+    A[225] = 0.0;
+    A[226] = 0.0;
+    A[227] = 0.0;
+    A[228] = 0.0;
+    A[229] = 0.0;
+    A[230] = 0.0;
+    A[231] = 0.0;
+    A[232] = 0.0;
+    A[233] = 0.0;
+    A[234] = 0.0;
+    A[235] = 0.0;
+    A[236] = 0.0;
+    A[237] = 0.0;
+    A[238] = -0.0333333333333333*G2_0_0 - 0.0333333333333333*G2_0_1 - 0.0333333333333333*G2_0_2 - 0.0333333333333333*G2_1_0 - 0.0333333333333333*G2_1_1 - 0.0333333333333333*G2_1_2 - 0.133333333333333*G2_2_0 - 0.133333333333333*G2_2_1 - 0.133333333333333*G2_2_2 - 0.0333333333333333*G5_0_0 - 0.0333333333333333*G5_0_1 - 0.0333333333333333*G5_0_2 - 0.0333333333333333*G5_1_0 - 0.0333333333333333*G5_1_1 - 0.0333333333333333*G5_1_2 - 0.133333333333333*G5_2_0 - 0.133333333333333*G5_2_1 - 0.133333333333333*G5_2_2 - 0.0333333333333333*G8_0_0 - 0.0333333333333333*G8_0_1 - 0.0333333333333333*G8_0_2 - 0.0333333333333333*G8_1_0 - 0.0333333333333333*G8_1_1 - 0.0333333333333333*G8_1_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_1 - 0.133333333333333*G8_2_2;
+    A[239] = 0.0333333333333333*G2_0_0 + 0.0333333333333333*G2_1_0 + 0.0333333333333333*G5_0_0 + 0.0333333333333333*G5_1_0 + 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_1_0;
+    A[240] = 0.0333333333333333*G2_0_1 + 0.0333333333333333*G2_1_1 + 0.0333333333333333*G5_0_1 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G8_0_1 + 0.0333333333333333*G8_1_1;
+    A[241] = -0.1*G2_0_2 - 0.1*G2_1_2 - 0.133333333333333*G2_2_2 - 0.1*G5_0_2 - 0.1*G5_1_2 - 0.133333333333333*G5_2_2 - 0.1*G8_0_2 - 0.1*G8_1_2 - 0.133333333333333*G8_2_2;
+    A[242] = -0.266666666666667*G2_0_1 - 0.133333333333333*G2_0_2 - 0.266666666666667*G2_1_1 - 0.133333333333333*G2_1_2 - 0.133333333333333*G2_2_1 - 0.266666666666667*G5_0_1 - 0.133333333333333*G5_0_2 - 0.266666666666667*G5_1_1 - 0.133333333333333*G5_1_2 - 0.133333333333333*G5_2_1 - 0.266666666666667*G8_0_1 - 0.133333333333333*G8_0_2 - 0.266666666666667*G8_1_1 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_1;
+    A[243] = -0.266666666666666*G2_0_0 - 0.133333333333333*G2_0_2 - 0.266666666666666*G2_1_0 - 0.133333333333333*G2_1_2 - 0.133333333333333*G2_2_0 - 0.266666666666666*G5_0_0 - 0.133333333333333*G5_0_2 - 0.266666666666666*G5_1_0 - 0.133333333333333*G5_1_2 - 0.133333333333333*G5_2_0 - 0.266666666666666*G8_0_0 - 0.133333333333333*G8_0_2 - 0.266666666666666*G8_1_0 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_0;
+    A[244] = -0.133333333333333*G2_0_0 - 0.133333333333333*G2_0_1 - 0.133333333333333*G2_1_0 - 0.133333333333333*G2_1_1 - 0.133333333333333*G5_0_0 - 0.133333333333333*G5_0_1 - 0.133333333333333*G5_1_0 - 0.133333333333333*G5_1_1 - 0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_1;
+    A[245] = 0.266666666666666*G2_0_0 + 0.266666666666666*G2_0_1 + 0.133333333333333*G2_0_2 + 0.266666666666666*G2_1_0 + 0.266666666666666*G2_1_1 + 0.133333333333333*G2_1_2 + 0.133333333333333*G2_2_0 + 0.133333333333333*G2_2_1 + 0.266666666666666*G2_2_2 + 0.266666666666666*G5_0_0 + 0.266666666666666*G5_0_1 + 0.133333333333333*G5_0_2 + 0.266666666666666*G5_1_0 + 0.266666666666666*G5_1_1 + 0.133333333333333*G5_1_2 + 0.133333333333333*G5_2_0 + 0.133333333333333*G5_2_1 + 0.266666666666666*G5_2_2 + 0.266666666666666*G8_0_0 + 0.266666666666666*G8_0_1 + 0.133333333333333*G8_0_2 + 0.266666666666666*G8_1_0 + 0.266666666666666*G8_1_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_1 + 0.266666666666666*G8_2_2;
+    A[246] = 0.133333333333333*G2_0_0 + 0.133333333333333*G2_0_2 + 0.133333333333333*G2_1_0 + 0.133333333333333*G2_1_2 + 0.133333333333333*G2_2_1 + 0.133333333333333*G5_0_0 + 0.133333333333333*G5_0_2 + 0.133333333333333*G5_1_0 + 0.133333333333333*G5_1_2 + 0.133333333333333*G5_2_1 + 0.133333333333333*G8_0_0 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_1;
+    A[247] = 0.133333333333333*G2_0_1 + 0.133333333333333*G2_0_2 + 0.133333333333333*G2_1_1 + 0.133333333333333*G2_1_2 + 0.133333333333333*G2_2_0 + 0.133333333333333*G5_0_1 + 0.133333333333333*G5_0_2 + 0.133333333333333*G5_1_1 + 0.133333333333333*G5_1_2 + 0.133333333333333*G5_2_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0;
+    A[248] = 0.0;
+    A[249] = 0.0;
+    A[250] = 0.0;
+    A[251] = 0.0;
+    A[252] = 0.0;
+    A[253] = 0.0;
+    A[254] = 0.0;
+    A[255] = 0.0;
+    A[256] = 0.0;
+    A[257] = 0.0;
+    A[258] = 0.0;
+    A[259] = 0.0;
+    A[260] = 0.0;
+    A[261] = 0.0;
+    A[262] = 0.0;
+    A[263] = 0.0;
+    A[264] = 0.0;
+    A[265] = 0.0;
+    A[266] = 0.0;
+    A[267] = 0.0;
+    A[268] = 0.0;
+    A[269] = 0.0;
+    A[270] = 0.0;
+    A[271] = 0.0;
+    A[272] = -0.0333333333333332*G2_0_0 - 0.0333333333333333*G2_0_1 - 0.0333333333333333*G2_0_2 - 0.133333333333333*G2_1_0 - 0.133333333333333*G2_1_1 - 0.133333333333333*G2_1_2 - 0.0333333333333333*G2_2_0 - 0.0333333333333333*G2_2_1 - 0.0333333333333333*G2_2_2 - 0.0333333333333332*G5_0_0 - 0.0333333333333333*G5_0_1 - 0.0333333333333333*G5_0_2 - 0.133333333333333*G5_1_0 - 0.133333333333333*G5_1_1 - 0.133333333333333*G5_1_2 - 0.0333333333333333*G5_2_0 - 0.0333333333333333*G5_2_1 - 0.0333333333333333*G5_2_2 - 0.0333333333333332*G8_0_0 - 0.0333333333333333*G8_0_1 - 0.0333333333333333*G8_0_2 - 0.133333333333333*G8_1_0 - 0.133333333333333*G8_1_1 - 0.133333333333333*G8_1_2 - 0.0333333333333333*G8_2_0 - 0.0333333333333333*G8_2_1 - 0.0333333333333333*G8_2_2;
+    A[273] = 0.0333333333333333*G2_0_0 + 0.0333333333333333*G2_2_0 + 0.0333333333333333*G5_0_0 + 0.0333333333333333*G5_2_0 + 0.0333333333333333*G8_0_0 + 0.0333333333333333*G8_2_0;
+    A[274] = -0.1*G2_0_1 - 0.133333333333333*G2_1_1 - 0.1*G2_2_1 - 0.1*G5_0_1 - 0.133333333333333*G5_1_1 - 0.1*G5_2_1 - 0.1*G8_0_1 - 0.133333333333333*G8_1_1 - 0.1*G8_2_1;
+    A[275] = 0.0333333333333333*G2_0_2 + 0.0333333333333334*G2_2_2 + 0.0333333333333333*G5_0_2 + 0.0333333333333334*G5_2_2 + 0.0333333333333333*G8_0_2 + 0.0333333333333334*G8_2_2;
+    A[276] = -0.133333333333333*G2_0_1 - 0.266666666666666*G2_0_2 - 0.133333333333333*G2_1_2 - 0.133333333333333*G2_2_1 - 0.266666666666666*G2_2_2 - 0.133333333333333*G5_0_1 - 0.266666666666666*G5_0_2 - 0.133333333333333*G5_1_2 - 0.133333333333333*G5_2_1 - 0.266666666666666*G5_2_2 - 0.133333333333333*G8_0_1 - 0.266666666666666*G8_0_2 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_1 - 0.266666666666666*G8_2_2;
+    A[277] = -0.133333333333333*G2_0_0 - 0.133333333333333*G2_0_2 - 0.133333333333333*G2_2_0 - 0.133333333333333*G2_2_2 - 0.133333333333333*G5_0_0 - 0.133333333333333*G5_0_2 - 0.133333333333333*G5_2_0 - 0.133333333333333*G5_2_2 - 0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_2_0 - 0.133333333333333*G8_2_2;
+    A[278] = -0.266666666666666*G2_0_0 - 0.133333333333333*G2_0_1 - 0.133333333333333*G2_1_0 - 0.266666666666666*G2_2_0 - 0.133333333333333*G2_2_1 - 0.266666666666666*G5_0_0 - 0.133333333333333*G5_0_1 - 0.133333333333333*G5_1_0 - 0.266666666666666*G5_2_0 - 0.133333333333333*G5_2_1 - 0.266666666666666*G8_0_0 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_1_0 - 0.266666666666666*G8_2_0 - 0.133333333333333*G8_2_1;
+    A[279] = 0.133333333333333*G2_0_0 + 0.133333333333333*G2_0_1 + 0.133333333333333*G2_1_2 + 0.133333333333333*G2_2_0 + 0.133333333333333*G2_2_1 + 0.133333333333333*G5_0_0 + 0.133333333333333*G5_0_1 + 0.133333333333333*G5_1_2 + 0.133333333333333*G5_2_0 + 0.133333333333333*G5_2_1 + 0.133333333333333*G8_0_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_1;
+    A[280] = 0.266666666666666*G2_0_0 + 0.133333333333333*G2_0_1 + 0.266666666666666*G2_0_2 + 0.133333333333333*G2_1_0 + 0.266666666666666*G2_1_1 + 0.133333333333333*G2_1_2 + 0.266666666666666*G2_2_0 + 0.133333333333333*G2_2_1 + 0.266666666666666*G2_2_2 + 0.266666666666666*G5_0_0 + 0.133333333333333*G5_0_1 + 0.266666666666666*G5_0_2 + 0.133333333333333*G5_1_0 + 0.266666666666666*G5_1_1 + 0.133333333333333*G5_1_2 + 0.266666666666666*G5_2_0 + 0.133333333333333*G5_2_1 + 0.266666666666666*G5_2_2 + 0.266666666666666*G8_0_0 + 0.133333333333333*G8_0_1 + 0.266666666666666*G8_0_2 + 0.133333333333333*G8_1_0 + 0.266666666666666*G8_1_1 + 0.133333333333333*G8_1_2 + 0.266666666666666*G8_2_0 + 0.133333333333333*G8_2_1 + 0.266666666666666*G8_2_2;
+    A[281] = 0.133333333333333*G2_0_1 + 0.133333333333333*G2_0_2 + 0.133333333333333*G2_1_0 + 0.133333333333333*G2_2_1 + 0.133333333333333*G2_2_2 + 0.133333333333333*G5_0_1 + 0.133333333333333*G5_0_2 + 0.133333333333333*G5_1_0 + 0.133333333333333*G5_2_1 + 0.133333333333333*G5_2_2 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_2_1 + 0.133333333333333*G8_2_2;
+    A[282] = 0.0;
+    A[283] = 0.0;
+    A[284] = 0.0;
+    A[285] = 0.0;
+    A[286] = 0.0;
+    A[287] = 0.0;
+    A[288] = 0.0;
+    A[289] = 0.0;
+    A[290] = 0.0;
+    A[291] = 0.0;
+    A[292] = 0.0;
+    A[293] = 0.0;
+    A[294] = 0.0;
+    A[295] = 0.0;
+    A[296] = 0.0;
+    A[297] = 0.0;
+    A[298] = 0.0;
+    A[299] = 0.0;
+    A[300] = 0.0;
+    A[301] = 0.0;
+    A[302] = 0.0;
+    A[303] = 0.0;
+    A[304] = 0.0;
+    A[305] = 0.0;
+    A[306] = -0.133333333333333*G2_0_0 - 0.133333333333333*G2_0_1 - 0.133333333333333*G2_0_2 - 0.0333333333333333*G2_1_0 - 0.0333333333333333*G2_1_1 - 0.0333333333333333*G2_1_2 - 0.0333333333333333*G2_2_0 - 0.0333333333333333*G2_2_1 - 0.0333333333333333*G2_2_2 - 0.133333333333333*G5_0_0 - 0.133333333333333*G5_0_1 - 0.133333333333333*G5_0_2 - 0.0333333333333333*G5_1_0 - 0.0333333333333333*G5_1_1 - 0.0333333333333333*G5_1_2 - 0.0333333333333333*G5_2_0 - 0.0333333333333333*G5_2_1 - 0.0333333333333333*G5_2_2 - 0.133333333333333*G8_0_0 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_0_2 - 0.0333333333333333*G8_1_0 - 0.0333333333333333*G8_1_1 - 0.0333333333333333*G8_1_2 - 0.0333333333333333*G8_2_0 - 0.0333333333333333*G8_2_1 - 0.0333333333333333*G8_2_2;
+    A[307] = -0.133333333333333*G2_0_0 - 0.1*G2_1_0 - 0.1*G2_2_0 - 0.133333333333333*G5_0_0 - 0.1*G5_1_0 - 0.1*G5_2_0 - 0.133333333333333*G8_0_0 - 0.1*G8_1_0 - 0.1*G8_2_0;
+    A[308] = 0.0333333333333333*G2_1_1 + 0.0333333333333333*G2_2_1 + 0.0333333333333333*G5_1_1 + 0.0333333333333333*G5_2_1 + 0.0333333333333333*G8_1_1 + 0.0333333333333333*G8_2_1;
+    A[309] = 0.0333333333333333*G2_1_2 + 0.0333333333333333*G2_2_2 + 0.0333333333333333*G5_1_2 + 0.0333333333333333*G5_2_2 + 0.0333333333333333*G8_1_2 + 0.0333333333333333*G8_2_2;
+    A[310] = -0.133333333333333*G2_1_1 - 0.133333333333333*G2_1_2 - 0.133333333333333*G2_2_1 - 0.133333333333333*G2_2_2 - 0.133333333333333*G5_1_1 - 0.133333333333333*G5_1_2 - 0.133333333333333*G5_2_1 - 0.133333333333333*G5_2_2 - 0.133333333333333*G8_1_1 - 0.133333333333333*G8_1_2 - 0.133333333333333*G8_2_1 - 0.133333333333333*G8_2_2;
+    A[311] = -0.133333333333333*G2_0_2 - 0.133333333333333*G2_1_0 - 0.266666666666666*G2_1_2 - 0.133333333333333*G2_2_0 - 0.266666666666666*G2_2_2 - 0.133333333333333*G5_0_2 - 0.133333333333333*G5_1_0 - 0.266666666666666*G5_1_2 - 0.133333333333333*G5_2_0 - 0.266666666666666*G5_2_2 - 0.133333333333333*G8_0_2 - 0.133333333333333*G8_1_0 - 0.266666666666666*G8_1_2 - 0.133333333333333*G8_2_0 - 0.266666666666666*G8_2_2;
+    A[312] = -0.133333333333333*G2_0_1 - 0.133333333333333*G2_1_0 - 0.266666666666666*G2_1_1 - 0.133333333333333*G2_2_0 - 0.266666666666666*G2_2_1 - 0.133333333333333*G5_0_1 - 0.133333333333333*G5_1_0 - 0.266666666666666*G5_1_1 - 0.133333333333333*G5_2_0 - 0.266666666666666*G5_2_1 - 0.133333333333333*G8_0_1 - 0.133333333333333*G8_1_0 - 0.266666666666666*G8_1_1 - 0.133333333333333*G8_2_0 - 0.266666666666666*G8_2_1;
+    A[313] = 0.133333333333333*G2_0_2 + 0.133333333333333*G2_1_0 + 0.133333333333333*G2_1_1 + 0.133333333333333*G2_2_0 + 0.133333333333333*G2_2_1 + 0.133333333333333*G5_0_2 + 0.133333333333333*G5_1_0 + 0.133333333333333*G5_1_1 + 0.133333333333333*G5_2_0 + 0.133333333333333*G5_2_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_1_1 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_1;
+    A[314] = 0.133333333333333*G2_0_1 + 0.133333333333333*G2_1_0 + 0.133333333333333*G2_1_2 + 0.133333333333333*G2_2_0 + 0.133333333333333*G2_2_2 + 0.133333333333333*G5_0_1 + 0.133333333333333*G5_1_0 + 0.133333333333333*G5_1_2 + 0.133333333333333*G5_2_0 + 0.133333333333333*G5_2_2 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_1_0 + 0.133333333333333*G8_1_2 + 0.133333333333333*G8_2_0 + 0.133333333333333*G8_2_2;
+    A[315] = 0.266666666666666*G2_0_0 + 0.133333333333333*G2_0_1 + 0.133333333333333*G2_0_2 + 0.133333333333333*G2_1_0 + 0.266666666666666*G2_1_1 + 0.266666666666666*G2_1_2 + 0.133333333333333*G2_2_0 + 0.266666666666666*G2_2_1 + 0.266666666666666*G2_2_2 + 0.266666666666666*G5_0_0 + 0.133333333333333*G5_0_1 + 0.133333333333333*G5_0_2 + 0.133333333333333*G5_1_0 + 0.266666666666666*G5_1_1 + 0.266666666666666*G5_1_2 + 0.133333333333333*G5_2_0 + 0.266666666666666*G5_2_1 + 0.266666666666666*G5_2_2 + 0.266666666666666*G8_0_0 + 0.133333333333333*G8_0_1 + 0.133333333333333*G8_0_2 + 0.133333333333333*G8_1_0 + 0.266666666666666*G8_1_1 + 0.266666666666666*G8_1_2 + 0.133333333333333*G8_2_0 + 0.266666666666666*G8_2_1 + 0.266666666666666*G8_2_2;
+    A[316] = 0.0;
+    A[317] = 0.0;
+    A[318] = 0.0;
+    A[319] = 0.0;
+    A[320] = 0.0;
+    A[321] = 0.0;
+    A[322] = 0.0;
+    A[323] = 0.0;
+    A[324] = 0.0;
+    A[325] = 0.0;
+    A[326] = 0.0;
+    A[327] = 0.0;
+    A[328] = 0.0;
+    A[329] = 0.0;
+    A[330] = 0.0;
+    A[331] = 0.0;
+    A[332] = 0.0;
+    A[333] = 0.0;
+    A[334] = 0.0;
+    A[335] = 0.0;
+    A[336] = 0.0;
+    A[337] = 0.0;
+    A[338] = 0.0;
+    A[339] = 0.0;
+    A[340] = 0.0;
+    A[341] = 0.0;
+    A[342] = 0.0;
+    A[343] = 0.0;
+    A[344] = 0.0;
+    A[345] = 0.0;
+    A[346] = 0.0;
+    A[347] = 0.0;
+    A[348] = 0.0;
+    A[349] = 0.0;
+    A[350] = 0.1*G3_0_0 + 0.1*G3_0_1 + 0.1*G3_0_2 + 0.1*G3_1_0 + 0.1*G3_1_1 + 0.1*G3_1_2 + 0.1*G3_2_0 + 0.1*G3_2_1 + 0.1*G3_2_2 + 0.1*G6_0_0 + 0.1*G6_0_1 + 0.1*G6_0_2 + 0.1*G6_1_0 + 0.1*G6_1_1 + 0.1*G6_1_2 + 0.1*G6_2_0 + 0.1*G6_2_1 + 0.1*G6_2_2 + 0.1*G9_0_0 + 0.1*G9_0_1 + 0.1*G9_0_2 + 0.1*G9_1_0 + 0.1*G9_1_1 + 0.1*G9_1_2 + 0.1*G9_2_0 + 0.1*G9_2_1 + 0.1*G9_2_2;
+    A[351] = 0.0333333333333333*G3_0_0 + 0.0333333333333333*G3_1_0 + 0.0333333333333333*G3_2_0 + 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_2_0;
+    A[352] = 0.0333333333333333*G3_0_1 + 0.0333333333333333*G3_1_1 + 0.0333333333333333*G3_2_1 + 0.0333333333333333*G6_0_1 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G9_0_1 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_2_1;
+    A[353] = 0.0333333333333333*G3_0_2 + 0.0333333333333333*G3_1_2 + 0.0333333333333333*G3_2_2 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_0_2 + 0.0333333333333333*G9_1_2 + 0.0333333333333333*G9_2_2;
+    A[354] = 0.0333333333333333*G3_0_1 + 0.0333333333333333*G3_0_2 + 0.0333333333333333*G3_1_1 + 0.0333333333333333*G3_1_2 + 0.0333333333333333*G3_2_1 + 0.0333333333333333*G3_2_2 + 0.0333333333333333*G6_0_1 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_0_1 + 0.0333333333333333*G9_0_2 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_1_2 + 0.0333333333333333*G9_2_1 + 0.0333333333333333*G9_2_2;
+    A[355] = 0.0333333333333333*G3_0_0 + 0.0333333333333333*G3_0_2 + 0.0333333333333333*G3_1_0 + 0.0333333333333333*G3_1_2 + 0.0333333333333333*G3_2_0 + 0.0333333333333333*G3_2_2 + 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_0_2 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_1_2 + 0.0333333333333333*G9_2_0 + 0.0333333333333333*G9_2_2;
+    A[356] = 0.0333333333333332*G3_0_0 + 0.0333333333333333*G3_0_1 + 0.0333333333333333*G3_1_0 + 0.0333333333333333*G3_1_1 + 0.0333333333333333*G3_2_0 + 0.0333333333333333*G3_2_1 + 0.0333333333333332*G6_0_0 + 0.0333333333333333*G6_0_1 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G6_2_1 + 0.0333333333333332*G9_0_0 + 0.0333333333333333*G9_0_1 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_2_0 + 0.0333333333333333*G9_2_1;
+    A[357] = -0.0333333333333333*G3_0_0 - 0.0333333333333333*G3_0_1 - 0.133333333333333*G3_0_2 - 0.0333333333333333*G3_1_0 - 0.0333333333333333*G3_1_1 - 0.133333333333333*G3_1_2 - 0.0333333333333333*G3_2_0 - 0.0333333333333333*G3_2_1 - 0.133333333333333*G3_2_2 - 0.0333333333333333*G6_0_0 - 0.0333333333333333*G6_0_1 - 0.133333333333333*G6_0_2 - 0.0333333333333333*G6_1_0 - 0.0333333333333333*G6_1_1 - 0.133333333333333*G6_1_2 - 0.0333333333333333*G6_2_0 - 0.0333333333333333*G6_2_1 - 0.133333333333333*G6_2_2 - 0.0333333333333333*G9_0_0 - 0.0333333333333333*G9_0_1 - 0.133333333333333*G9_0_2 - 0.0333333333333333*G9_1_0 - 0.0333333333333333*G9_1_1 - 0.133333333333333*G9_1_2 - 0.0333333333333333*G9_2_0 - 0.0333333333333333*G9_2_1 - 0.133333333333333*G9_2_2;
+    A[358] = -0.0333333333333332*G3_0_0 - 0.133333333333333*G3_0_1 - 0.0333333333333333*G3_0_2 - 0.0333333333333333*G3_1_0 - 0.133333333333333*G3_1_1 - 0.0333333333333333*G3_1_2 - 0.0333333333333333*G3_2_0 - 0.133333333333333*G3_2_1 - 0.0333333333333333*G3_2_2 - 0.0333333333333332*G6_0_0 - 0.133333333333333*G6_0_1 - 0.0333333333333333*G6_0_2 - 0.0333333333333333*G6_1_0 - 0.133333333333333*G6_1_1 - 0.0333333333333333*G6_1_2 - 0.0333333333333333*G6_2_0 - 0.133333333333333*G6_2_1 - 0.0333333333333333*G6_2_2 - 0.0333333333333332*G9_0_0 - 0.133333333333333*G9_0_1 - 0.0333333333333333*G9_0_2 - 0.0333333333333333*G9_1_0 - 0.133333333333333*G9_1_1 - 0.0333333333333333*G9_1_2 - 0.0333333333333333*G9_2_0 - 0.133333333333333*G9_2_1 - 0.0333333333333333*G9_2_2;
+    A[359] = -0.133333333333333*G3_0_0 - 0.0333333333333333*G3_0_1 - 0.0333333333333333*G3_0_2 - 0.133333333333333*G3_1_0 - 0.0333333333333333*G3_1_1 - 0.0333333333333333*G3_1_2 - 0.133333333333333*G3_2_0 - 0.0333333333333333*G3_2_1 - 0.0333333333333333*G3_2_2 - 0.133333333333333*G6_0_0 - 0.0333333333333333*G6_0_1 - 0.0333333333333333*G6_0_2 - 0.133333333333333*G6_1_0 - 0.0333333333333333*G6_1_1 - 0.0333333333333333*G6_1_2 - 0.133333333333333*G6_2_0 - 0.0333333333333333*G6_2_1 - 0.0333333333333333*G6_2_2 - 0.133333333333333*G9_0_0 - 0.0333333333333333*G9_0_1 - 0.0333333333333333*G9_0_2 - 0.133333333333333*G9_1_0 - 0.0333333333333333*G9_1_1 - 0.0333333333333333*G9_1_2 - 0.133333333333333*G9_2_0 - 0.0333333333333333*G9_2_1 - 0.0333333333333333*G9_2_2;
+    A[360] = 0.0;
+    A[361] = 0.0;
+    A[362] = 0.0;
+    A[363] = 0.0;
+    A[364] = 0.0;
+    A[365] = 0.0;
+    A[366] = 0.0;
+    A[367] = 0.0;
+    A[368] = 0.0;
+    A[369] = 0.0;
+    A[370] = 0.0;
+    A[371] = 0.0;
+    A[372] = 0.0;
+    A[373] = 0.0;
+    A[374] = 0.0;
+    A[375] = 0.0;
+    A[376] = 0.0;
+    A[377] = 0.0;
+    A[378] = 0.0;
+    A[379] = 0.0;
+    A[380] = 0.0;
+    A[381] = 0.0;
+    A[382] = 0.0;
+    A[383] = 0.0;
+    A[384] = 0.0333333333333333*G3_0_0 + 0.0333333333333333*G3_0_1 + 0.0333333333333333*G3_0_2 + 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_0_1 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_0_1 + 0.0333333333333333*G9_0_2;
+    A[385] = 0.1*G3_0_0 + 0.1*G6_0_0 + 0.1*G9_0_0;
+    A[386] = -0.0333333333333333*G3_0_1 - 0.0333333333333333*G6_0_1 - 0.0333333333333333*G9_0_1;
+    A[387] = -0.0333333333333333*G3_0_2 - 0.0333333333333333*G6_0_2 - 0.0333333333333333*G9_0_2;
+    A[388] = -0.0333333333333333*G3_0_1 - 0.0333333333333333*G3_0_2 - 0.0333333333333333*G6_0_1 - 0.0333333333333333*G6_0_2 - 0.0333333333333333*G9_0_1 - 0.0333333333333333*G9_0_2;
+    A[389] = -0.0333333333333333*G3_0_0 + 0.1*G3_0_2 - 0.0333333333333333*G6_0_0 + 0.1*G6_0_2 - 0.0333333333333333*G9_0_0 + 0.1*G9_0_2;
+    A[390] = -0.0333333333333333*G3_0_0 + 0.1*G3_0_1 - 0.0333333333333333*G6_0_0 + 0.1*G6_0_1 - 0.0333333333333333*G9_0_0 + 0.1*G9_0_1;
+    A[391] = 0.0333333333333333*G3_0_0 + 0.0333333333333333*G3_0_1 + 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_0_1 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_0_1;
+    A[392] = 0.0333333333333333*G3_0_0 + 0.0333333333333333*G3_0_2 + 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_0_2;
+    A[393] = -0.133333333333333*G3_0_0 - 0.1*G3_0_1 - 0.1*G3_0_2 - 0.133333333333333*G6_0_0 - 0.1*G6_0_1 - 0.1*G6_0_2 - 0.133333333333333*G9_0_0 - 0.1*G9_0_1 - 0.1*G9_0_2;
+    A[394] = 0.0;
+    A[395] = 0.0;
+    A[396] = 0.0;
+    A[397] = 0.0;
+    A[398] = 0.0;
+    A[399] = 0.0;
+    A[400] = 0.0;
+    A[401] = 0.0;
+    A[402] = 0.0;
+    A[403] = 0.0;
+    A[404] = 0.0;
+    A[405] = 0.0;
+    A[406] = 0.0;
+    A[407] = 0.0;
+    A[408] = 0.0;
+    A[409] = 0.0;
+    A[410] = 0.0;
+    A[411] = 0.0;
+    A[412] = 0.0;
+    A[413] = 0.0;
+    A[414] = 0.0;
+    A[415] = 0.0;
+    A[416] = 0.0;
+    A[417] = 0.0;
+    A[418] = 0.0333333333333333*G3_1_0 + 0.0333333333333333*G3_1_1 + 0.0333333333333333*G3_1_2 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_1_2;
+    A[419] = -0.0333333333333333*G3_1_0 - 0.0333333333333333*G6_1_0 - 0.0333333333333333*G9_1_0;
+    A[420] = 0.1*G3_1_1 + 0.1*G6_1_1 + 0.1*G9_1_1;
+    A[421] = -0.0333333333333333*G3_1_2 - 0.0333333333333333*G6_1_2 - 0.0333333333333333*G9_1_2;
+    A[422] = -0.0333333333333334*G3_1_1 + 0.1*G3_1_2 - 0.0333333333333334*G6_1_1 + 0.1*G6_1_2 - 0.0333333333333334*G9_1_1 + 0.1*G9_1_2;
+    A[423] = -0.0333333333333333*G3_1_0 - 0.0333333333333333*G3_1_2 - 0.0333333333333333*G6_1_0 - 0.0333333333333333*G6_1_2 - 0.0333333333333333*G9_1_0 - 0.0333333333333333*G9_1_2;
+    A[424] = 0.1*G3_1_0 - 0.0333333333333333*G3_1_1 + 0.1*G6_1_0 - 0.0333333333333333*G6_1_1 + 0.1*G9_1_0 - 0.0333333333333333*G9_1_1;
+    A[425] = 0.0333333333333333*G3_1_0 + 0.0333333333333333*G3_1_1 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_1_1;
+    A[426] = -0.1*G3_1_0 - 0.133333333333333*G3_1_1 - 0.1*G3_1_2 - 0.1*G6_1_0 - 0.133333333333333*G6_1_1 - 0.1*G6_1_2 - 0.1*G9_1_0 - 0.133333333333333*G9_1_1 - 0.1*G9_1_2;
+    A[427] = 0.0333333333333333*G3_1_1 + 0.0333333333333333*G3_1_2 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_1_2;
+    A[428] = 0.0;
+    A[429] = 0.0;
+    A[430] = 0.0;
+    A[431] = 0.0;
+    A[432] = 0.0;
+    A[433] = 0.0;
+    A[434] = 0.0;
+    A[435] = 0.0;
+    A[436] = 0.0;
+    A[437] = 0.0;
+    A[438] = 0.0;
+    A[439] = 0.0;
+    A[440] = 0.0;
+    A[441] = 0.0;
+    A[442] = 0.0;
+    A[443] = 0.0;
+    A[444] = 0.0;
+    A[445] = 0.0;
+    A[446] = 0.0;
+    A[447] = 0.0;
+    A[448] = 0.0;
+    A[449] = 0.0;
+    A[450] = 0.0;
+    A[451] = 0.0;
+    A[452] = 0.0333333333333333*G3_2_0 + 0.0333333333333333*G3_2_1 + 0.0333333333333333*G3_2_2 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_2_0 + 0.0333333333333333*G9_2_1 + 0.0333333333333333*G9_2_2;
+    A[453] = -0.0333333333333333*G3_2_0 - 0.0333333333333333*G6_2_0 - 0.0333333333333333*G9_2_0;
+    A[454] = -0.0333333333333333*G3_2_1 - 0.0333333333333333*G6_2_1 - 0.0333333333333333*G9_2_1;
+    A[455] = 0.1*G3_2_2 + 0.1*G6_2_2 + 0.1*G9_2_2;
+    A[456] = 0.1*G3_2_1 - 0.0333333333333334*G3_2_2 + 0.1*G6_2_1 - 0.0333333333333334*G6_2_2 + 0.1*G9_2_1 - 0.0333333333333334*G9_2_2;
+    A[457] = 0.1*G3_2_0 - 0.0333333333333333*G3_2_2 + 0.1*G6_2_0 - 0.0333333333333333*G6_2_2 + 0.1*G9_2_0 - 0.0333333333333333*G9_2_2;
+    A[458] = -0.0333333333333333*G3_2_0 - 0.0333333333333333*G3_2_1 - 0.0333333333333333*G6_2_0 - 0.0333333333333333*G6_2_1 - 0.0333333333333333*G9_2_0 - 0.0333333333333333*G9_2_1;
+    A[459] = -0.1*G3_2_0 - 0.1*G3_2_1 - 0.133333333333333*G3_2_2 - 0.1*G6_2_0 - 0.1*G6_2_1 - 0.133333333333333*G6_2_2 - 0.1*G9_2_0 - 0.1*G9_2_1 - 0.133333333333333*G9_2_2;
+    A[460] = 0.0333333333333333*G3_2_0 + 0.0333333333333334*G3_2_2 + 0.0333333333333333*G6_2_0 + 0.0333333333333334*G6_2_2 + 0.0333333333333333*G9_2_0 + 0.0333333333333334*G9_2_2;
+    A[461] = 0.0333333333333333*G3_2_1 + 0.0333333333333333*G3_2_2 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_2_1 + 0.0333333333333333*G9_2_2;
+    A[462] = 0.0;
+    A[463] = 0.0;
+    A[464] = 0.0;
+    A[465] = 0.0;
+    A[466] = 0.0;
+    A[467] = 0.0;
+    A[468] = 0.0;
+    A[469] = 0.0;
+    A[470] = 0.0;
+    A[471] = 0.0;
+    A[472] = 0.0;
+    A[473] = 0.0;
+    A[474] = 0.0;
+    A[475] = 0.0;
+    A[476] = 0.0;
+    A[477] = 0.0;
+    A[478] = 0.0;
+    A[479] = 0.0;
+    A[480] = 0.0;
+    A[481] = 0.0;
+    A[482] = 0.0;
+    A[483] = 0.0;
+    A[484] = 0.0;
+    A[485] = 0.0;
+    A[486] = 0.0333333333333333*G3_1_0 + 0.0333333333333333*G3_1_1 + 0.0333333333333333*G3_1_2 + 0.0333333333333333*G3_2_0 + 0.0333333333333333*G3_2_1 + 0.0333333333333333*G3_2_2 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_1_2 + 0.0333333333333333*G9_2_0 + 0.0333333333333333*G9_2_1 + 0.0333333333333333*G9_2_2;
+    A[487] = -0.0333333333333333*G3_1_0 - 0.0333333333333333*G3_2_0 - 0.0333333333333333*G6_1_0 - 0.0333333333333333*G6_2_0 - 0.0333333333333333*G9_1_0 - 0.0333333333333333*G9_2_0;
+    A[488] = -0.0333333333333334*G3_1_1 + 0.1*G3_2_1 - 0.0333333333333334*G6_1_1 + 0.1*G6_2_1 - 0.0333333333333334*G9_1_1 + 0.1*G9_2_1;
+    A[489] = 0.1*G3_1_2 - 0.0333333333333334*G3_2_2 + 0.1*G6_1_2 - 0.0333333333333334*G6_2_2 + 0.1*G9_1_2 - 0.0333333333333334*G9_2_2;
+    A[490] = 0.266666666666667*G3_1_1 + 0.133333333333333*G3_1_2 + 0.133333333333333*G3_2_1 + 0.266666666666666*G3_2_2 + 0.266666666666667*G6_1_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_1 + 0.266666666666666*G6_2_2 + 0.266666666666667*G9_1_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_1 + 0.266666666666666*G9_2_2;
+    A[491] = 0.266666666666667*G3_1_0 + 0.133333333333333*G3_1_2 + 0.133333333333333*G3_2_0 + 0.133333333333333*G3_2_2 + 0.266666666666667*G6_1_0 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_2 + 0.266666666666667*G9_1_0 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_2;
+    A[492] = 0.133333333333333*G3_1_0 + 0.133333333333333*G3_1_1 + 0.266666666666666*G3_2_0 + 0.133333333333333*G3_2_1 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_1_1 + 0.266666666666666*G6_2_0 + 0.133333333333333*G6_2_1 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_1_1 + 0.266666666666666*G9_2_0 + 0.133333333333333*G9_2_1;
+    A[493] = -0.266666666666667*G3_1_0 - 0.266666666666667*G3_1_1 - 0.133333333333333*G3_1_2 - 0.133333333333333*G3_2_0 - 0.133333333333333*G3_2_1 - 0.266666666666667*G6_1_0 - 0.266666666666667*G6_1_1 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_1 - 0.266666666666667*G9_1_0 - 0.266666666666667*G9_1_1 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_1;
+    A[494] = -0.133333333333333*G3_1_0 - 0.133333333333333*G3_1_2 - 0.266666666666666*G3_2_0 - 0.133333333333333*G3_2_1 - 0.266666666666666*G3_2_2 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_2 - 0.266666666666666*G6_2_0 - 0.133333333333333*G6_2_1 - 0.266666666666666*G6_2_2 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_2 - 0.266666666666666*G9_2_0 - 0.133333333333333*G9_2_1 - 0.266666666666666*G9_2_2;
+    A[495] = -0.133333333333333*G3_1_1 - 0.133333333333333*G3_1_2 - 0.133333333333333*G3_2_1 - 0.133333333333333*G3_2_2 - 0.133333333333333*G6_1_1 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_1 - 0.133333333333333*G6_2_2 - 0.133333333333333*G9_1_1 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_1 - 0.133333333333333*G9_2_2;
+    A[496] = 0.0;
+    A[497] = 0.0;
+    A[498] = 0.0;
+    A[499] = 0.0;
+    A[500] = 0.0;
+    A[501] = 0.0;
+    A[502] = 0.0;
+    A[503] = 0.0;
+    A[504] = 0.0;
+    A[505] = 0.0;
+    A[506] = 0.0;
+    A[507] = 0.0;
+    A[508] = 0.0;
+    A[509] = 0.0;
+    A[510] = 0.0;
+    A[511] = 0.0;
+    A[512] = 0.0;
+    A[513] = 0.0;
+    A[514] = 0.0;
+    A[515] = 0.0;
+    A[516] = 0.0;
+    A[517] = 0.0;
+    A[518] = 0.0;
+    A[519] = 0.0;
+    A[520] = 0.0333333333333333*G3_0_0 + 0.0333333333333333*G3_0_1 + 0.0333333333333333*G3_0_2 + 0.0333333333333333*G3_2_0 + 0.0333333333333333*G3_2_1 + 0.0333333333333333*G3_2_2 + 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_0_1 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_0_1 + 0.0333333333333333*G9_0_2 + 0.0333333333333333*G9_2_0 + 0.0333333333333333*G9_2_1 + 0.0333333333333333*G9_2_2;
+    A[521] = -0.0333333333333333*G3_0_0 + 0.1*G3_2_0 - 0.0333333333333333*G6_0_0 + 0.1*G6_2_0 - 0.0333333333333333*G9_0_0 + 0.1*G9_2_0;
+    A[522] = -0.0333333333333333*G3_0_1 - 0.0333333333333333*G3_2_1 - 0.0333333333333333*G6_0_1 - 0.0333333333333333*G6_2_1 - 0.0333333333333333*G9_0_1 - 0.0333333333333333*G9_2_1;
+    A[523] = 0.1*G3_0_2 - 0.0333333333333333*G3_2_2 + 0.1*G6_0_2 - 0.0333333333333333*G6_2_2 + 0.1*G9_0_2 - 0.0333333333333333*G9_2_2;
+    A[524] = 0.266666666666667*G3_0_1 + 0.133333333333333*G3_0_2 + 0.133333333333333*G3_2_1 + 0.133333333333333*G3_2_2 + 0.266666666666667*G6_0_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_2_1 + 0.133333333333333*G6_2_2 + 0.266666666666667*G9_0_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_2_1 + 0.133333333333333*G9_2_2;
+    A[525] = 0.266666666666666*G3_0_0 + 0.133333333333333*G3_0_2 + 0.133333333333333*G3_2_0 + 0.266666666666666*G3_2_2 + 0.266666666666666*G6_0_0 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_2_0 + 0.266666666666666*G6_2_2 + 0.266666666666666*G9_0_0 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_2_0 + 0.266666666666666*G9_2_2;
+    A[526] = 0.133333333333333*G3_0_0 + 0.133333333333333*G3_0_1 + 0.133333333333333*G3_2_0 + 0.266666666666666*G3_2_1 + 0.133333333333333*G6_0_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_2_0 + 0.266666666666666*G6_2_1 + 0.133333333333333*G9_0_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_2_0 + 0.266666666666666*G9_2_1;
+    A[527] = -0.266666666666666*G3_0_0 - 0.266666666666666*G3_0_1 - 0.133333333333333*G3_0_2 - 0.133333333333333*G3_2_0 - 0.133333333333333*G3_2_1 - 0.266666666666666*G6_0_0 - 0.266666666666666*G6_0_1 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_1 - 0.266666666666666*G9_0_0 - 0.266666666666666*G9_0_1 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_1;
+    A[528] = -0.133333333333333*G3_0_0 - 0.133333333333333*G3_0_2 - 0.133333333333333*G3_2_0 - 0.133333333333333*G3_2_2 - 0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_2 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_2;
+    A[529] = -0.133333333333333*G3_0_1 - 0.133333333333333*G3_0_2 - 0.133333333333333*G3_2_0 - 0.266666666666666*G3_2_1 - 0.266666666666666*G3_2_2 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_2_0 - 0.266666666666666*G6_2_1 - 0.266666666666666*G6_2_2 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_2_0 - 0.266666666666666*G9_2_1 - 0.266666666666666*G9_2_2;
+    A[530] = 0.0;
+    A[531] = 0.0;
+    A[532] = 0.0;
+    A[533] = 0.0;
+    A[534] = 0.0;
+    A[535] = 0.0;
+    A[536] = 0.0;
+    A[537] = 0.0;
+    A[538] = 0.0;
+    A[539] = 0.0;
+    A[540] = 0.0;
+    A[541] = 0.0;
+    A[542] = 0.0;
+    A[543] = 0.0;
+    A[544] = 0.0;
+    A[545] = 0.0;
+    A[546] = 0.0;
+    A[547] = 0.0;
+    A[548] = 0.0;
+    A[549] = 0.0;
+    A[550] = 0.0;
+    A[551] = 0.0;
+    A[552] = 0.0;
+    A[553] = 0.0;
+    A[554] = 0.0333333333333332*G3_0_0 + 0.0333333333333333*G3_0_1 + 0.0333333333333333*G3_0_2 + 0.0333333333333333*G3_1_0 + 0.0333333333333333*G3_1_1 + 0.0333333333333333*G3_1_2 + 0.0333333333333332*G6_0_0 + 0.0333333333333333*G6_0_1 + 0.0333333333333333*G6_0_2 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_1_2 + 0.0333333333333332*G9_0_0 + 0.0333333333333333*G9_0_1 + 0.0333333333333333*G9_0_2 + 0.0333333333333333*G9_1_0 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_1_2;
+    A[555] = -0.0333333333333333*G3_0_0 + 0.1*G3_1_0 - 0.0333333333333333*G6_0_0 + 0.1*G6_1_0 - 0.0333333333333333*G9_0_0 + 0.1*G9_1_0;
+    A[556] = 0.1*G3_0_1 - 0.0333333333333333*G3_1_1 + 0.1*G6_0_1 - 0.0333333333333333*G6_1_1 + 0.1*G9_0_1 - 0.0333333333333333*G9_1_1;
+    A[557] = -0.0333333333333333*G3_0_2 - 0.0333333333333333*G3_1_2 - 0.0333333333333333*G6_0_2 - 0.0333333333333333*G6_1_2 - 0.0333333333333333*G9_0_2 - 0.0333333333333333*G9_1_2;
+    A[558] = 0.133333333333333*G3_0_1 + 0.266666666666666*G3_0_2 + 0.133333333333333*G3_1_1 + 0.133333333333333*G3_1_2 + 0.133333333333333*G6_0_1 + 0.266666666666666*G6_0_2 + 0.133333333333333*G6_1_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G9_0_1 + 0.266666666666666*G9_0_2 + 0.133333333333333*G9_1_1 + 0.133333333333333*G9_1_2;
+    A[559] = 0.133333333333333*G3_0_0 + 0.133333333333333*G3_0_2 + 0.133333333333333*G3_1_0 + 0.266666666666666*G3_1_2 + 0.133333333333333*G6_0_0 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.266666666666666*G6_1_2 + 0.133333333333333*G9_0_0 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.266666666666666*G9_1_2;
+    A[560] = 0.266666666666666*G3_0_0 + 0.133333333333333*G3_0_1 + 0.133333333333333*G3_1_0 + 0.266666666666666*G3_1_1 + 0.266666666666666*G6_0_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_1_0 + 0.266666666666666*G6_1_1 + 0.266666666666666*G9_0_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_1_0 + 0.266666666666666*G9_1_1;
+    A[561] = -0.133333333333333*G3_0_0 - 0.133333333333333*G3_0_1 - 0.133333333333333*G3_1_0 - 0.133333333333333*G3_1_1 - 0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_1 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_1;
+    A[562] = -0.266666666666666*G3_0_0 - 0.133333333333333*G3_0_1 - 0.266666666666666*G3_0_2 - 0.133333333333333*G3_1_0 - 0.133333333333333*G3_1_2 - 0.266666666666666*G6_0_0 - 0.133333333333333*G6_0_1 - 0.266666666666666*G6_0_2 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_2 - 0.266666666666666*G9_0_0 - 0.133333333333333*G9_0_1 - 0.266666666666666*G9_0_2 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_2;
+    A[563] = -0.133333333333333*G3_0_1 - 0.133333333333333*G3_0_2 - 0.133333333333333*G3_1_0 - 0.266666666666666*G3_1_1 - 0.266666666666666*G3_1_2 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_1_0 - 0.266666666666666*G6_1_1 - 0.266666666666666*G6_1_2 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_1_0 - 0.266666666666666*G9_1_1 - 0.266666666666666*G9_1_2;
+    A[564] = 0.0;
+    A[565] = 0.0;
+    A[566] = 0.0;
+    A[567] = 0.0;
+    A[568] = 0.0;
+    A[569] = 0.0;
+    A[570] = 0.0;
+    A[571] = 0.0;
+    A[572] = 0.0;
+    A[573] = 0.0;
+    A[574] = 0.0;
+    A[575] = 0.0;
+    A[576] = 0.0;
+    A[577] = 0.0;
+    A[578] = 0.0;
+    A[579] = 0.0;
+    A[580] = 0.0;
+    A[581] = 0.0;
+    A[582] = 0.0;
+    A[583] = 0.0;
+    A[584] = 0.0;
+    A[585] = 0.0;
+    A[586] = 0.0;
+    A[587] = 0.0;
+    A[588] = -0.0333333333333333*G3_0_0 - 0.0333333333333333*G3_0_1 - 0.0333333333333333*G3_0_2 - 0.0333333333333333*G3_1_0 - 0.0333333333333333*G3_1_1 - 0.0333333333333333*G3_1_2 - 0.133333333333333*G3_2_0 - 0.133333333333333*G3_2_1 - 0.133333333333333*G3_2_2 - 0.0333333333333333*G6_0_0 - 0.0333333333333333*G6_0_1 - 0.0333333333333333*G6_0_2 - 0.0333333333333333*G6_1_0 - 0.0333333333333333*G6_1_1 - 0.0333333333333333*G6_1_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_1 - 0.133333333333333*G6_2_2 - 0.0333333333333333*G9_0_0 - 0.0333333333333333*G9_0_1 - 0.0333333333333333*G9_0_2 - 0.0333333333333333*G9_1_0 - 0.0333333333333333*G9_1_1 - 0.0333333333333333*G9_1_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_1 - 0.133333333333333*G9_2_2;
+    A[589] = 0.0333333333333333*G3_0_0 + 0.0333333333333333*G3_1_0 + 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_1_0 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_1_0;
+    A[590] = 0.0333333333333333*G3_0_1 + 0.0333333333333333*G3_1_1 + 0.0333333333333333*G6_0_1 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G9_0_1 + 0.0333333333333333*G9_1_1;
+    A[591] = -0.1*G3_0_2 - 0.1*G3_1_2 - 0.133333333333333*G3_2_2 - 0.1*G6_0_2 - 0.1*G6_1_2 - 0.133333333333333*G6_2_2 - 0.1*G9_0_2 - 0.1*G9_1_2 - 0.133333333333333*G9_2_2;
+    A[592] = -0.266666666666667*G3_0_1 - 0.133333333333333*G3_0_2 - 0.266666666666667*G3_1_1 - 0.133333333333333*G3_1_2 - 0.133333333333333*G3_2_1 - 0.266666666666667*G6_0_1 - 0.133333333333333*G6_0_2 - 0.266666666666667*G6_1_1 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_1 - 0.266666666666667*G9_0_1 - 0.133333333333333*G9_0_2 - 0.266666666666667*G9_1_1 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_1;
+    A[593] = -0.266666666666666*G3_0_0 - 0.133333333333333*G3_0_2 - 0.266666666666666*G3_1_0 - 0.133333333333333*G3_1_2 - 0.133333333333333*G3_2_0 - 0.266666666666666*G6_0_0 - 0.133333333333333*G6_0_2 - 0.266666666666666*G6_1_0 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_0 - 0.266666666666666*G9_0_0 - 0.133333333333333*G9_0_2 - 0.266666666666666*G9_1_0 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_0;
+    A[594] = -0.133333333333333*G3_0_0 - 0.133333333333333*G3_0_1 - 0.133333333333333*G3_1_0 - 0.133333333333333*G3_1_1 - 0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_1 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_1;
+    A[595] = 0.266666666666666*G3_0_0 + 0.266666666666666*G3_0_1 + 0.133333333333333*G3_0_2 + 0.266666666666666*G3_1_0 + 0.266666666666666*G3_1_1 + 0.133333333333333*G3_1_2 + 0.133333333333333*G3_2_0 + 0.133333333333333*G3_2_1 + 0.266666666666666*G3_2_2 + 0.266666666666666*G6_0_0 + 0.266666666666666*G6_0_1 + 0.133333333333333*G6_0_2 + 0.266666666666666*G6_1_0 + 0.266666666666666*G6_1_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_1 + 0.266666666666666*G6_2_2 + 0.266666666666666*G9_0_0 + 0.266666666666666*G9_0_1 + 0.133333333333333*G9_0_2 + 0.266666666666666*G9_1_0 + 0.266666666666666*G9_1_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_1 + 0.266666666666666*G9_2_2;
+    A[596] = 0.133333333333333*G3_0_0 + 0.133333333333333*G3_0_2 + 0.133333333333333*G3_1_0 + 0.133333333333333*G3_1_2 + 0.133333333333333*G3_2_1 + 0.133333333333333*G6_0_0 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_1 + 0.133333333333333*G9_0_0 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_1;
+    A[597] = 0.133333333333333*G3_0_1 + 0.133333333333333*G3_0_2 + 0.133333333333333*G3_1_1 + 0.133333333333333*G3_1_2 + 0.133333333333333*G3_2_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0;
+    A[598] = 0.0;
+    A[599] = 0.0;
+    A[600] = 0.0;
+    A[601] = 0.0;
+    A[602] = 0.0;
+    A[603] = 0.0;
+    A[604] = 0.0;
+    A[605] = 0.0;
+    A[606] = 0.0;
+    A[607] = 0.0;
+    A[608] = 0.0;
+    A[609] = 0.0;
+    A[610] = 0.0;
+    A[611] = 0.0;
+    A[612] = 0.0;
+    A[613] = 0.0;
+    A[614] = 0.0;
+    A[615] = 0.0;
+    A[616] = 0.0;
+    A[617] = 0.0;
+    A[618] = 0.0;
+    A[619] = 0.0;
+    A[620] = 0.0;
+    A[621] = 0.0;
+    A[622] = -0.0333333333333332*G3_0_0 - 0.0333333333333333*G3_0_1 - 0.0333333333333333*G3_0_2 - 0.133333333333333*G3_1_0 - 0.133333333333333*G3_1_1 - 0.133333333333333*G3_1_2 - 0.0333333333333333*G3_2_0 - 0.0333333333333333*G3_2_1 - 0.0333333333333333*G3_2_2 - 0.0333333333333332*G6_0_0 - 0.0333333333333333*G6_0_1 - 0.0333333333333333*G6_0_2 - 0.133333333333333*G6_1_0 - 0.133333333333333*G6_1_1 - 0.133333333333333*G6_1_2 - 0.0333333333333333*G6_2_0 - 0.0333333333333333*G6_2_1 - 0.0333333333333333*G6_2_2 - 0.0333333333333332*G9_0_0 - 0.0333333333333333*G9_0_1 - 0.0333333333333333*G9_0_2 - 0.133333333333333*G9_1_0 - 0.133333333333333*G9_1_1 - 0.133333333333333*G9_1_2 - 0.0333333333333333*G9_2_0 - 0.0333333333333333*G9_2_1 - 0.0333333333333333*G9_2_2;
+    A[623] = 0.0333333333333333*G3_0_0 + 0.0333333333333333*G3_2_0 + 0.0333333333333333*G6_0_0 + 0.0333333333333333*G6_2_0 + 0.0333333333333333*G9_0_0 + 0.0333333333333333*G9_2_0;
+    A[624] = -0.1*G3_0_1 - 0.133333333333333*G3_1_1 - 0.1*G3_2_1 - 0.1*G6_0_1 - 0.133333333333333*G6_1_1 - 0.1*G6_2_1 - 0.1*G9_0_1 - 0.133333333333333*G9_1_1 - 0.1*G9_2_1;
+    A[625] = 0.0333333333333333*G3_0_2 + 0.0333333333333334*G3_2_2 + 0.0333333333333333*G6_0_2 + 0.0333333333333334*G6_2_2 + 0.0333333333333333*G9_0_2 + 0.0333333333333334*G9_2_2;
+    A[626] = -0.133333333333333*G3_0_1 - 0.266666666666666*G3_0_2 - 0.133333333333333*G3_1_2 - 0.133333333333333*G3_2_1 - 0.266666666666666*G3_2_2 - 0.133333333333333*G6_0_1 - 0.266666666666666*G6_0_2 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_1 - 0.266666666666666*G6_2_2 - 0.133333333333333*G9_0_1 - 0.266666666666666*G9_0_2 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_1 - 0.266666666666666*G9_2_2;
+    A[627] = -0.133333333333333*G3_0_0 - 0.133333333333333*G3_0_2 - 0.133333333333333*G3_2_0 - 0.133333333333333*G3_2_2 - 0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_2_0 - 0.133333333333333*G6_2_2 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_2_0 - 0.133333333333333*G9_2_2;
+    A[628] = -0.266666666666666*G3_0_0 - 0.133333333333333*G3_0_1 - 0.133333333333333*G3_1_0 - 0.266666666666666*G3_2_0 - 0.133333333333333*G3_2_1 - 0.266666666666666*G6_0_0 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_1_0 - 0.266666666666666*G6_2_0 - 0.133333333333333*G6_2_1 - 0.266666666666666*G9_0_0 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_1_0 - 0.266666666666666*G9_2_0 - 0.133333333333333*G9_2_1;
+    A[629] = 0.133333333333333*G3_0_0 + 0.133333333333333*G3_0_1 + 0.133333333333333*G3_1_2 + 0.133333333333333*G3_2_0 + 0.133333333333333*G3_2_1 + 0.133333333333333*G6_0_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_1 + 0.133333333333333*G9_0_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_1;
+    A[630] = 0.266666666666666*G3_0_0 + 0.133333333333333*G3_0_1 + 0.266666666666666*G3_0_2 + 0.133333333333333*G3_1_0 + 0.266666666666666*G3_1_1 + 0.133333333333333*G3_1_2 + 0.266666666666666*G3_2_0 + 0.133333333333333*G3_2_1 + 0.266666666666666*G3_2_2 + 0.266666666666666*G6_0_0 + 0.133333333333333*G6_0_1 + 0.266666666666666*G6_0_2 + 0.133333333333333*G6_1_0 + 0.266666666666666*G6_1_1 + 0.133333333333333*G6_1_2 + 0.266666666666666*G6_2_0 + 0.133333333333333*G6_2_1 + 0.266666666666666*G6_2_2 + 0.266666666666666*G9_0_0 + 0.133333333333333*G9_0_1 + 0.266666666666666*G9_0_2 + 0.133333333333333*G9_1_0 + 0.266666666666666*G9_1_1 + 0.133333333333333*G9_1_2 + 0.266666666666666*G9_2_0 + 0.133333333333333*G9_2_1 + 0.266666666666666*G9_2_2;
+    A[631] = 0.133333333333333*G3_0_1 + 0.133333333333333*G3_0_2 + 0.133333333333333*G3_1_0 + 0.133333333333333*G3_2_1 + 0.133333333333333*G3_2_2 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_2_1 + 0.133333333333333*G6_2_2 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_2_1 + 0.133333333333333*G9_2_2;
+    A[632] = 0.0;
+    A[633] = 0.0;
+    A[634] = 0.0;
+    A[635] = 0.0;
+    A[636] = 0.0;
+    A[637] = 0.0;
+    A[638] = 0.0;
+    A[639] = 0.0;
+    A[640] = 0.0;
+    A[641] = 0.0;
+    A[642] = 0.0;
+    A[643] = 0.0;
+    A[644] = 0.0;
+    A[645] = 0.0;
+    A[646] = 0.0;
+    A[647] = 0.0;
+    A[648] = 0.0;
+    A[649] = 0.0;
+    A[650] = 0.0;
+    A[651] = 0.0;
+    A[652] = 0.0;
+    A[653] = 0.0;
+    A[654] = 0.0;
+    A[655] = 0.0;
+    A[656] = -0.133333333333333*G3_0_0 - 0.133333333333333*G3_0_1 - 0.133333333333333*G3_0_2 - 0.0333333333333333*G3_1_0 - 0.0333333333333333*G3_1_1 - 0.0333333333333333*G3_1_2 - 0.0333333333333333*G3_2_0 - 0.0333333333333333*G3_2_1 - 0.0333333333333333*G3_2_2 - 0.133333333333333*G6_0_0 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_0_2 - 0.0333333333333333*G6_1_0 - 0.0333333333333333*G6_1_1 - 0.0333333333333333*G6_1_2 - 0.0333333333333333*G6_2_0 - 0.0333333333333333*G6_2_1 - 0.0333333333333333*G6_2_2 - 0.133333333333333*G9_0_0 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_0_2 - 0.0333333333333333*G9_1_0 - 0.0333333333333333*G9_1_1 - 0.0333333333333333*G9_1_2 - 0.0333333333333333*G9_2_0 - 0.0333333333333333*G9_2_1 - 0.0333333333333333*G9_2_2;
+    A[657] = -0.133333333333333*G3_0_0 - 0.1*G3_1_0 - 0.1*G3_2_0 - 0.133333333333333*G6_0_0 - 0.1*G6_1_0 - 0.1*G6_2_0 - 0.133333333333333*G9_0_0 - 0.1*G9_1_0 - 0.1*G9_2_0;
+    A[658] = 0.0333333333333333*G3_1_1 + 0.0333333333333333*G3_2_1 + 0.0333333333333333*G6_1_1 + 0.0333333333333333*G6_2_1 + 0.0333333333333333*G9_1_1 + 0.0333333333333333*G9_2_1;
+    A[659] = 0.0333333333333333*G3_1_2 + 0.0333333333333333*G3_2_2 + 0.0333333333333333*G6_1_2 + 0.0333333333333333*G6_2_2 + 0.0333333333333333*G9_1_2 + 0.0333333333333333*G9_2_2;
+    A[660] = -0.133333333333333*G3_1_1 - 0.133333333333333*G3_1_2 - 0.133333333333333*G3_2_1 - 0.133333333333333*G3_2_2 - 0.133333333333333*G6_1_1 - 0.133333333333333*G6_1_2 - 0.133333333333333*G6_2_1 - 0.133333333333333*G6_2_2 - 0.133333333333333*G9_1_1 - 0.133333333333333*G9_1_2 - 0.133333333333333*G9_2_1 - 0.133333333333333*G9_2_2;
+    A[661] = -0.133333333333333*G3_0_2 - 0.133333333333333*G3_1_0 - 0.266666666666666*G3_1_2 - 0.133333333333333*G3_2_0 - 0.266666666666666*G3_2_2 - 0.133333333333333*G6_0_2 - 0.133333333333333*G6_1_0 - 0.266666666666666*G6_1_2 - 0.133333333333333*G6_2_0 - 0.266666666666666*G6_2_2 - 0.133333333333333*G9_0_2 - 0.133333333333333*G9_1_0 - 0.266666666666666*G9_1_2 - 0.133333333333333*G9_2_0 - 0.266666666666666*G9_2_2;
+    A[662] = -0.133333333333333*G3_0_1 - 0.133333333333333*G3_1_0 - 0.266666666666666*G3_1_1 - 0.133333333333333*G3_2_0 - 0.266666666666666*G3_2_1 - 0.133333333333333*G6_0_1 - 0.133333333333333*G6_1_0 - 0.266666666666666*G6_1_1 - 0.133333333333333*G6_2_0 - 0.266666666666666*G6_2_1 - 0.133333333333333*G9_0_1 - 0.133333333333333*G9_1_0 - 0.266666666666666*G9_1_1 - 0.133333333333333*G9_2_0 - 0.266666666666666*G9_2_1;
+    A[663] = 0.133333333333333*G3_0_2 + 0.133333333333333*G3_1_0 + 0.133333333333333*G3_1_1 + 0.133333333333333*G3_2_0 + 0.133333333333333*G3_2_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_1_1 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_1_1 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_1;
+    A[664] = 0.133333333333333*G3_0_1 + 0.133333333333333*G3_1_0 + 0.133333333333333*G3_1_2 + 0.133333333333333*G3_2_0 + 0.133333333333333*G3_2_2 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_1_0 + 0.133333333333333*G6_1_2 + 0.133333333333333*G6_2_0 + 0.133333333333333*G6_2_2 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_1_0 + 0.133333333333333*G9_1_2 + 0.133333333333333*G9_2_0 + 0.133333333333333*G9_2_2;
+    A[665] = 0.266666666666666*G3_0_0 + 0.133333333333333*G3_0_1 + 0.133333333333333*G3_0_2 + 0.133333333333333*G3_1_0 + 0.266666666666666*G3_1_1 + 0.266666666666666*G3_1_2 + 0.133333333333333*G3_2_0 + 0.266666666666666*G3_2_1 + 0.266666666666666*G3_2_2 + 0.266666666666666*G6_0_0 + 0.133333333333333*G6_0_1 + 0.133333333333333*G6_0_2 + 0.133333333333333*G6_1_0 + 0.266666666666666*G6_1_1 + 0.266666666666666*G6_1_2 + 0.133333333333333*G6_2_0 + 0.266666666666666*G6_2_1 + 0.266666666666666*G6_2_2 + 0.266666666666666*G9_0_0 + 0.133333333333333*G9_0_1 + 0.133333333333333*G9_0_2 + 0.133333333333333*G9_1_0 + 0.266666666666666*G9_1_1 + 0.266666666666666*G9_1_2 + 0.133333333333333*G9_2_0 + 0.266666666666666*G9_2_1 + 0.266666666666666*G9_2_2;
+    A[666] = 0.0;
+    A[667] = 0.0;
+    A[668] = 0.0;
+    A[669] = 0.0;
+    A[670] = 0.0;
+    A[671] = 0.0;
+    A[672] = 0.0;
+    A[673] = 0.0;
+    A[674] = 0.0;
+    A[675] = 0.0;
+    A[676] = 0.0;
+    A[677] = 0.0;
+    A[678] = 0.0;
+    A[679] = 0.0;
+    A[680] = 0.0;
+    A[681] = 0.0;
+    A[682] = 0.0;
+    A[683] = 0.0;
+    A[684] = 0.0;
+    A[685] = 0.0;
+    A[686] = 0.0;
+    A[687] = 0.0;
+    A[688] = 0.0;
+    A[689] = 0.0;
+    A[690] = 0.0;
+    A[691] = 0.0;
+    A[692] = 0.0;
+    A[693] = 0.0;
+    A[694] = 0.0;
+    A[695] = 0.0;
+    A[696] = 0.0;
+    A[697] = 0.0;
+    A[698] = 0.0;
+    A[699] = 0.0;
+    A[700] = 0.1*G1_0_0 + 0.1*G1_0_1 + 0.1*G1_0_2 + 0.1*G1_1_0 + 0.1*G1_1_1 + 0.1*G1_1_2 + 0.1*G1_2_0 + 0.1*G1_2_1 + 0.1*G1_2_2 + 0.1*G4_0_0 + 0.1*G4_0_1 + 0.1*G4_0_2 + 0.1*G4_1_0 + 0.1*G4_1_1 + 0.1*G4_1_2 + 0.1*G4_2_0 + 0.1*G4_2_1 + 0.1*G4_2_2 + 0.1*G7_0_0 + 0.1*G7_0_1 + 0.1*G7_0_2 + 0.1*G7_1_0 + 0.1*G7_1_1 + 0.1*G7_1_2 + 0.1*G7_2_0 + 0.1*G7_2_1 + 0.1*G7_2_2;
+    A[701] = 0.0333333333333333*G1_0_0 + 0.0333333333333333*G1_1_0 + 0.0333333333333333*G1_2_0 + 0.0333333333333333*G4_0_0 + 0.0333333333333333*G4_1_0 + 0.0333333333333333*G4_2_0 + 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_2_0;
+    A[702] = 0.0333333333333333*G1_0_1 + 0.0333333333333333*G1_1_1 + 0.0333333333333333*G1_2_1 + 0.0333333333333333*G4_0_1 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G4_2_1 + 0.0333333333333333*G7_0_1 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_2_1;
+    A[703] = 0.0333333333333333*G1_0_2 + 0.0333333333333333*G1_1_2 + 0.0333333333333333*G1_2_2 + 0.0333333333333333*G4_0_2 + 0.0333333333333333*G4_1_2 + 0.0333333333333333*G4_2_2 + 0.0333333333333333*G7_0_2 + 0.0333333333333333*G7_1_2 + 0.0333333333333333*G7_2_2;
+    A[704] = 0.0333333333333333*G1_0_1 + 0.0333333333333333*G1_0_2 + 0.0333333333333333*G1_1_1 + 0.0333333333333333*G1_1_2 + 0.0333333333333333*G1_2_1 + 0.0333333333333333*G1_2_2 + 0.0333333333333333*G4_0_1 + 0.0333333333333333*G4_0_2 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G4_1_2 + 0.0333333333333333*G4_2_1 + 0.0333333333333333*G4_2_2 + 0.0333333333333333*G7_0_1 + 0.0333333333333333*G7_0_2 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_1_2 + 0.0333333333333333*G7_2_1 + 0.0333333333333333*G7_2_2;
+    A[705] = 0.0333333333333333*G1_0_0 + 0.0333333333333333*G1_0_2 + 0.0333333333333333*G1_1_0 + 0.0333333333333333*G1_1_2 + 0.0333333333333333*G1_2_0 + 0.0333333333333333*G1_2_2 + 0.0333333333333333*G4_0_0 + 0.0333333333333333*G4_0_2 + 0.0333333333333333*G4_1_0 + 0.0333333333333333*G4_1_2 + 0.0333333333333333*G4_2_0 + 0.0333333333333333*G4_2_2 + 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_0_2 + 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_1_2 + 0.0333333333333333*G7_2_0 + 0.0333333333333333*G7_2_2;
+    A[706] = 0.0333333333333332*G1_0_0 + 0.0333333333333333*G1_0_1 + 0.0333333333333333*G1_1_0 + 0.0333333333333333*G1_1_1 + 0.0333333333333333*G1_2_0 + 0.0333333333333333*G1_2_1 + 0.0333333333333332*G4_0_0 + 0.0333333333333333*G4_0_1 + 0.0333333333333333*G4_1_0 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G4_2_0 + 0.0333333333333333*G4_2_1 + 0.0333333333333332*G7_0_0 + 0.0333333333333333*G7_0_1 + 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_2_0 + 0.0333333333333333*G7_2_1;
+    A[707] = -0.0333333333333333*G1_0_0 - 0.0333333333333333*G1_0_1 - 0.133333333333333*G1_0_2 - 0.0333333333333333*G1_1_0 - 0.0333333333333333*G1_1_1 - 0.133333333333333*G1_1_2 - 0.0333333333333333*G1_2_0 - 0.0333333333333333*G1_2_1 - 0.133333333333333*G1_2_2 - 0.0333333333333333*G4_0_0 - 0.0333333333333333*G4_0_1 - 0.133333333333333*G4_0_2 - 0.0333333333333333*G4_1_0 - 0.0333333333333333*G4_1_1 - 0.133333333333333*G4_1_2 - 0.0333333333333333*G4_2_0 - 0.0333333333333333*G4_2_1 - 0.133333333333333*G4_2_2 - 0.0333333333333333*G7_0_0 - 0.0333333333333333*G7_0_1 - 0.133333333333333*G7_0_2 - 0.0333333333333333*G7_1_0 - 0.0333333333333333*G7_1_1 - 0.133333333333333*G7_1_2 - 0.0333333333333333*G7_2_0 - 0.0333333333333333*G7_2_1 - 0.133333333333333*G7_2_2;
+    A[708] = -0.0333333333333332*G1_0_0 - 0.133333333333333*G1_0_1 - 0.0333333333333333*G1_0_2 - 0.0333333333333333*G1_1_0 - 0.133333333333333*G1_1_1 - 0.0333333333333333*G1_1_2 - 0.0333333333333333*G1_2_0 - 0.133333333333333*G1_2_1 - 0.0333333333333333*G1_2_2 - 0.0333333333333332*G4_0_0 - 0.133333333333333*G4_0_1 - 0.0333333333333333*G4_0_2 - 0.0333333333333333*G4_1_0 - 0.133333333333333*G4_1_1 - 0.0333333333333333*G4_1_2 - 0.0333333333333333*G4_2_0 - 0.133333333333333*G4_2_1 - 0.0333333333333333*G4_2_2 - 0.0333333333333332*G7_0_0 - 0.133333333333333*G7_0_1 - 0.0333333333333333*G7_0_2 - 0.0333333333333333*G7_1_0 - 0.133333333333333*G7_1_1 - 0.0333333333333333*G7_1_2 - 0.0333333333333333*G7_2_0 - 0.133333333333333*G7_2_1 - 0.0333333333333333*G7_2_2;
+    A[709] = -0.133333333333333*G1_0_0 - 0.0333333333333333*G1_0_1 - 0.0333333333333333*G1_0_2 - 0.133333333333333*G1_1_0 - 0.0333333333333333*G1_1_1 - 0.0333333333333333*G1_1_2 - 0.133333333333333*G1_2_0 - 0.0333333333333333*G1_2_1 - 0.0333333333333333*G1_2_2 - 0.133333333333333*G4_0_0 - 0.0333333333333333*G4_0_1 - 0.0333333333333333*G4_0_2 - 0.133333333333333*G4_1_0 - 0.0333333333333333*G4_1_1 - 0.0333333333333333*G4_1_2 - 0.133333333333333*G4_2_0 - 0.0333333333333333*G4_2_1 - 0.0333333333333333*G4_2_2 - 0.133333333333333*G7_0_0 - 0.0333333333333333*G7_0_1 - 0.0333333333333333*G7_0_2 - 0.133333333333333*G7_1_0 - 0.0333333333333333*G7_1_1 - 0.0333333333333333*G7_1_2 - 0.133333333333333*G7_2_0 - 0.0333333333333333*G7_2_1 - 0.0333333333333333*G7_2_2;
+    A[710] = 0.0;
+    A[711] = 0.0;
+    A[712] = 0.0;
+    A[713] = 0.0;
+    A[714] = 0.0;
+    A[715] = 0.0;
+    A[716] = 0.0;
+    A[717] = 0.0;
+    A[718] = 0.0;
+    A[719] = 0.0;
+    A[720] = 0.0;
+    A[721] = 0.0;
+    A[722] = 0.0;
+    A[723] = 0.0;
+    A[724] = 0.0;
+    A[725] = 0.0;
+    A[726] = 0.0;
+    A[727] = 0.0;
+    A[728] = 0.0;
+    A[729] = 0.0;
+    A[730] = 0.0;
+    A[731] = 0.0;
+    A[732] = 0.0;
+    A[733] = 0.0;
+    A[734] = 0.0333333333333333*G1_0_0 + 0.0333333333333333*G1_0_1 + 0.0333333333333333*G1_0_2 + 0.0333333333333333*G4_0_0 + 0.0333333333333333*G4_0_1 + 0.0333333333333333*G4_0_2 + 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_0_1 + 0.0333333333333333*G7_0_2;
+    A[735] = 0.1*G1_0_0 + 0.1*G4_0_0 + 0.1*G7_0_0;
+    A[736] = -0.0333333333333333*G1_0_1 - 0.0333333333333333*G4_0_1 - 0.0333333333333333*G7_0_1;
+    A[737] = -0.0333333333333333*G1_0_2 - 0.0333333333333333*G4_0_2 - 0.0333333333333333*G7_0_2;
+    A[738] = -0.0333333333333333*G1_0_1 - 0.0333333333333333*G1_0_2 - 0.0333333333333333*G4_0_1 - 0.0333333333333333*G4_0_2 - 0.0333333333333333*G7_0_1 - 0.0333333333333333*G7_0_2;
+    A[739] = -0.0333333333333333*G1_0_0 + 0.1*G1_0_2 - 0.0333333333333333*G4_0_0 + 0.1*G4_0_2 - 0.0333333333333333*G7_0_0 + 0.1*G7_0_2;
+    A[740] = -0.0333333333333333*G1_0_0 + 0.1*G1_0_1 - 0.0333333333333333*G4_0_0 + 0.1*G4_0_1 - 0.0333333333333333*G7_0_0 + 0.1*G7_0_1;
+    A[741] = 0.0333333333333333*G1_0_0 + 0.0333333333333333*G1_0_1 + 0.0333333333333333*G4_0_0 + 0.0333333333333333*G4_0_1 + 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_0_1;
+    A[742] = 0.0333333333333333*G1_0_0 + 0.0333333333333333*G1_0_2 + 0.0333333333333333*G4_0_0 + 0.0333333333333333*G4_0_2 + 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_0_2;
+    A[743] = -0.133333333333333*G1_0_0 - 0.1*G1_0_1 - 0.1*G1_0_2 - 0.133333333333333*G4_0_0 - 0.1*G4_0_1 - 0.1*G4_0_2 - 0.133333333333333*G7_0_0 - 0.1*G7_0_1 - 0.1*G7_0_2;
+    A[744] = 0.0;
+    A[745] = 0.0;
+    A[746] = 0.0;
+    A[747] = 0.0;
+    A[748] = 0.0;
+    A[749] = 0.0;
+    A[750] = 0.0;
+    A[751] = 0.0;
+    A[752] = 0.0;
+    A[753] = 0.0;
+    A[754] = 0.0;
+    A[755] = 0.0;
+    A[756] = 0.0;
+    A[757] = 0.0;
+    A[758] = 0.0;
+    A[759] = 0.0;
+    A[760] = 0.0;
+    A[761] = 0.0;
+    A[762] = 0.0;
+    A[763] = 0.0;
+    A[764] = 0.0;
+    A[765] = 0.0;
+    A[766] = 0.0;
+    A[767] = 0.0;
+    A[768] = 0.0333333333333333*G1_1_0 + 0.0333333333333333*G1_1_1 + 0.0333333333333333*G1_1_2 + 0.0333333333333333*G4_1_0 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G4_1_2 + 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_1_2;
+    A[769] = -0.0333333333333333*G1_1_0 - 0.0333333333333333*G4_1_0 - 0.0333333333333333*G7_1_0;
+    A[770] = 0.1*G1_1_1 + 0.1*G4_1_1 + 0.1*G7_1_1;
+    A[771] = -0.0333333333333333*G1_1_2 - 0.0333333333333333*G4_1_2 - 0.0333333333333333*G7_1_2;
+    A[772] = -0.0333333333333334*G1_1_1 + 0.1*G1_1_2 - 0.0333333333333334*G4_1_1 + 0.1*G4_1_2 - 0.0333333333333334*G7_1_1 + 0.1*G7_1_2;
+    A[773] = -0.0333333333333333*G1_1_0 - 0.0333333333333333*G1_1_2 - 0.0333333333333333*G4_1_0 - 0.0333333333333333*G4_1_2 - 0.0333333333333333*G7_1_0 - 0.0333333333333333*G7_1_2;
+    A[774] = 0.1*G1_1_0 - 0.0333333333333333*G1_1_1 + 0.1*G4_1_0 - 0.0333333333333333*G4_1_1 + 0.1*G7_1_0 - 0.0333333333333333*G7_1_1;
+    A[775] = 0.0333333333333333*G1_1_0 + 0.0333333333333333*G1_1_1 + 0.0333333333333333*G4_1_0 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_1_1;
+    A[776] = -0.1*G1_1_0 - 0.133333333333333*G1_1_1 - 0.1*G1_1_2 - 0.1*G4_1_0 - 0.133333333333333*G4_1_1 - 0.1*G4_1_2 - 0.1*G7_1_0 - 0.133333333333333*G7_1_1 - 0.1*G7_1_2;
+    A[777] = 0.0333333333333333*G1_1_1 + 0.0333333333333333*G1_1_2 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G4_1_2 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_1_2;
+    A[778] = 0.0;
+    A[779] = 0.0;
+    A[780] = 0.0;
+    A[781] = 0.0;
+    A[782] = 0.0;
+    A[783] = 0.0;
+    A[784] = 0.0;
+    A[785] = 0.0;
+    A[786] = 0.0;
+    A[787] = 0.0;
+    A[788] = 0.0;
+    A[789] = 0.0;
+    A[790] = 0.0;
+    A[791] = 0.0;
+    A[792] = 0.0;
+    A[793] = 0.0;
+    A[794] = 0.0;
+    A[795] = 0.0;
+    A[796] = 0.0;
+    A[797] = 0.0;
+    A[798] = 0.0;
+    A[799] = 0.0;
+    A[800] = 0.0;
+    A[801] = 0.0;
+    A[802] = 0.0333333333333333*G1_2_0 + 0.0333333333333333*G1_2_1 + 0.0333333333333333*G1_2_2 + 0.0333333333333333*G4_2_0 + 0.0333333333333333*G4_2_1 + 0.0333333333333333*G4_2_2 + 0.0333333333333333*G7_2_0 + 0.0333333333333333*G7_2_1 + 0.0333333333333333*G7_2_2;
+    A[803] = -0.0333333333333333*G1_2_0 - 0.0333333333333333*G4_2_0 - 0.0333333333333333*G7_2_0;
+    A[804] = -0.0333333333333333*G1_2_1 - 0.0333333333333333*G4_2_1 - 0.0333333333333333*G7_2_1;
+    A[805] = 0.1*G1_2_2 + 0.1*G4_2_2 + 0.1*G7_2_2;
+    A[806] = 0.1*G1_2_1 - 0.0333333333333334*G1_2_2 + 0.1*G4_2_1 - 0.0333333333333334*G4_2_2 + 0.1*G7_2_1 - 0.0333333333333334*G7_2_2;
+    A[807] = 0.1*G1_2_0 - 0.0333333333333333*G1_2_2 + 0.1*G4_2_0 - 0.0333333333333333*G4_2_2 + 0.1*G7_2_0 - 0.0333333333333333*G7_2_2;
+    A[808] = -0.0333333333333333*G1_2_0 - 0.0333333333333333*G1_2_1 - 0.0333333333333333*G4_2_0 - 0.0333333333333333*G4_2_1 - 0.0333333333333333*G7_2_0 - 0.0333333333333333*G7_2_1;
+    A[809] = -0.1*G1_2_0 - 0.1*G1_2_1 - 0.133333333333333*G1_2_2 - 0.1*G4_2_0 - 0.1*G4_2_1 - 0.133333333333333*G4_2_2 - 0.1*G7_2_0 - 0.1*G7_2_1 - 0.133333333333333*G7_2_2;
+    A[810] = 0.0333333333333333*G1_2_0 + 0.0333333333333334*G1_2_2 + 0.0333333333333333*G4_2_0 + 0.0333333333333334*G4_2_2 + 0.0333333333333333*G7_2_0 + 0.0333333333333334*G7_2_2;
+    A[811] = 0.0333333333333333*G1_2_1 + 0.0333333333333333*G1_2_2 + 0.0333333333333333*G4_2_1 + 0.0333333333333333*G4_2_2 + 0.0333333333333333*G7_2_1 + 0.0333333333333333*G7_2_2;
+    A[812] = 0.0;
+    A[813] = 0.0;
+    A[814] = 0.0;
+    A[815] = 0.0;
+    A[816] = 0.0;
+    A[817] = 0.0;
+    A[818] = 0.0;
+    A[819] = 0.0;
+    A[820] = 0.0;
+    A[821] = 0.0;
+    A[822] = 0.0;
+    A[823] = 0.0;
+    A[824] = 0.0;
+    A[825] = 0.0;
+    A[826] = 0.0;
+    A[827] = 0.0;
+    A[828] = 0.0;
+    A[829] = 0.0;
+    A[830] = 0.0;
+    A[831] = 0.0;
+    A[832] = 0.0;
+    A[833] = 0.0;
+    A[834] = 0.0;
+    A[835] = 0.0;
+    A[836] = 0.0333333333333333*G1_1_0 + 0.0333333333333333*G1_1_1 + 0.0333333333333333*G1_1_2 + 0.0333333333333333*G1_2_0 + 0.0333333333333333*G1_2_1 + 0.0333333333333333*G1_2_2 + 0.0333333333333333*G4_1_0 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G4_1_2 + 0.0333333333333333*G4_2_0 + 0.0333333333333333*G4_2_1 + 0.0333333333333333*G4_2_2 + 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_1_2 + 0.0333333333333333*G7_2_0 + 0.0333333333333333*G7_2_1 + 0.0333333333333333*G7_2_2;
+    A[837] = -0.0333333333333333*G1_1_0 - 0.0333333333333333*G1_2_0 - 0.0333333333333333*G4_1_0 - 0.0333333333333333*G4_2_0 - 0.0333333333333333*G7_1_0 - 0.0333333333333333*G7_2_0;
+    A[838] = -0.0333333333333334*G1_1_1 + 0.1*G1_2_1 - 0.0333333333333334*G4_1_1 + 0.1*G4_2_1 - 0.0333333333333334*G7_1_1 + 0.1*G7_2_1;
+    A[839] = 0.1*G1_1_2 - 0.0333333333333334*G1_2_2 + 0.1*G4_1_2 - 0.0333333333333334*G4_2_2 + 0.1*G7_1_2 - 0.0333333333333334*G7_2_2;
+    A[840] = 0.266666666666667*G1_1_1 + 0.133333333333333*G1_1_2 + 0.133333333333333*G1_2_1 + 0.266666666666666*G1_2_2 + 0.266666666666667*G4_1_1 + 0.133333333333333*G4_1_2 + 0.133333333333333*G4_2_1 + 0.266666666666666*G4_2_2 + 0.266666666666667*G7_1_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_1 + 0.266666666666666*G7_2_2;
+    A[841] = 0.266666666666667*G1_1_0 + 0.133333333333333*G1_1_2 + 0.133333333333333*G1_2_0 + 0.133333333333333*G1_2_2 + 0.266666666666667*G4_1_0 + 0.133333333333333*G4_1_2 + 0.133333333333333*G4_2_0 + 0.133333333333333*G4_2_2 + 0.266666666666667*G7_1_0 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_2;
+    A[842] = 0.133333333333333*G1_1_0 + 0.133333333333333*G1_1_1 + 0.266666666666666*G1_2_0 + 0.133333333333333*G1_2_1 + 0.133333333333333*G4_1_0 + 0.133333333333333*G4_1_1 + 0.266666666666666*G4_2_0 + 0.133333333333333*G4_2_1 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_1_1 + 0.266666666666666*G7_2_0 + 0.133333333333333*G7_2_1;
+    A[843] = -0.266666666666667*G1_1_0 - 0.266666666666667*G1_1_1 - 0.133333333333333*G1_1_2 - 0.133333333333333*G1_2_0 - 0.133333333333333*G1_2_1 - 0.266666666666667*G4_1_0 - 0.266666666666667*G4_1_1 - 0.133333333333333*G4_1_2 - 0.133333333333333*G4_2_0 - 0.133333333333333*G4_2_1 - 0.266666666666667*G7_1_0 - 0.266666666666667*G7_1_1 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_1;
+    A[844] = -0.133333333333333*G1_1_0 - 0.133333333333333*G1_1_2 - 0.266666666666666*G1_2_0 - 0.133333333333333*G1_2_1 - 0.266666666666666*G1_2_2 - 0.133333333333333*G4_1_0 - 0.133333333333333*G4_1_2 - 0.266666666666666*G4_2_0 - 0.133333333333333*G4_2_1 - 0.266666666666666*G4_2_2 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_2 - 0.266666666666666*G7_2_0 - 0.133333333333333*G7_2_1 - 0.266666666666666*G7_2_2;
+    A[845] = -0.133333333333333*G1_1_1 - 0.133333333333333*G1_1_2 - 0.133333333333333*G1_2_1 - 0.133333333333333*G1_2_2 - 0.133333333333333*G4_1_1 - 0.133333333333333*G4_1_2 - 0.133333333333333*G4_2_1 - 0.133333333333333*G4_2_2 - 0.133333333333333*G7_1_1 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_1 - 0.133333333333333*G7_2_2;
+    A[846] = 0.0;
+    A[847] = 0.0;
+    A[848] = 0.0;
+    A[849] = 0.0;
+    A[850] = 0.0;
+    A[851] = 0.0;
+    A[852] = 0.0;
+    A[853] = 0.0;
+    A[854] = 0.0;
+    A[855] = 0.0;
+    A[856] = 0.0;
+    A[857] = 0.0;
+    A[858] = 0.0;
+    A[859] = 0.0;
+    A[860] = 0.0;
+    A[861] = 0.0;
+    A[862] = 0.0;
+    A[863] = 0.0;
+    A[864] = 0.0;
+    A[865] = 0.0;
+    A[866] = 0.0;
+    A[867] = 0.0;
+    A[868] = 0.0;
+    A[869] = 0.0;
+    A[870] = 0.0333333333333333*G1_0_0 + 0.0333333333333333*G1_0_1 + 0.0333333333333333*G1_0_2 + 0.0333333333333333*G1_2_0 + 0.0333333333333333*G1_2_1 + 0.0333333333333333*G1_2_2 + 0.0333333333333333*G4_0_0 + 0.0333333333333333*G4_0_1 + 0.0333333333333333*G4_0_2 + 0.0333333333333333*G4_2_0 + 0.0333333333333333*G4_2_1 + 0.0333333333333333*G4_2_2 + 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_0_1 + 0.0333333333333333*G7_0_2 + 0.0333333333333333*G7_2_0 + 0.0333333333333333*G7_2_1 + 0.0333333333333333*G7_2_2;
+    A[871] = -0.0333333333333333*G1_0_0 + 0.1*G1_2_0 - 0.0333333333333333*G4_0_0 + 0.1*G4_2_0 - 0.0333333333333333*G7_0_0 + 0.1*G7_2_0;
+    A[872] = -0.0333333333333333*G1_0_1 - 0.0333333333333333*G1_2_1 - 0.0333333333333333*G4_0_1 - 0.0333333333333333*G4_2_1 - 0.0333333333333333*G7_0_1 - 0.0333333333333333*G7_2_1;
+    A[873] = 0.1*G1_0_2 - 0.0333333333333333*G1_2_2 + 0.1*G4_0_2 - 0.0333333333333333*G4_2_2 + 0.1*G7_0_2 - 0.0333333333333333*G7_2_2;
+    A[874] = 0.266666666666667*G1_0_1 + 0.133333333333333*G1_0_2 + 0.133333333333333*G1_2_1 + 0.133333333333333*G1_2_2 + 0.266666666666667*G4_0_1 + 0.133333333333333*G4_0_2 + 0.133333333333333*G4_2_1 + 0.133333333333333*G4_2_2 + 0.266666666666667*G7_0_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_2_1 + 0.133333333333333*G7_2_2;
+    A[875] = 0.266666666666666*G1_0_0 + 0.133333333333333*G1_0_2 + 0.133333333333333*G1_2_0 + 0.266666666666666*G1_2_2 + 0.266666666666666*G4_0_0 + 0.133333333333333*G4_0_2 + 0.133333333333333*G4_2_0 + 0.266666666666666*G4_2_2 + 0.266666666666666*G7_0_0 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_2_0 + 0.266666666666666*G7_2_2;
+    A[876] = 0.133333333333333*G1_0_0 + 0.133333333333333*G1_0_1 + 0.133333333333333*G1_2_0 + 0.266666666666666*G1_2_1 + 0.133333333333333*G4_0_0 + 0.133333333333333*G4_0_1 + 0.133333333333333*G4_2_0 + 0.266666666666666*G4_2_1 + 0.133333333333333*G7_0_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_2_0 + 0.266666666666666*G7_2_1;
+    A[877] = -0.266666666666666*G1_0_0 - 0.266666666666666*G1_0_1 - 0.133333333333333*G1_0_2 - 0.133333333333333*G1_2_0 - 0.133333333333333*G1_2_1 - 0.266666666666666*G4_0_0 - 0.266666666666666*G4_0_1 - 0.133333333333333*G4_0_2 - 0.133333333333333*G4_2_0 - 0.133333333333333*G4_2_1 - 0.266666666666666*G7_0_0 - 0.266666666666666*G7_0_1 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_1;
+    A[878] = -0.133333333333333*G1_0_0 - 0.133333333333333*G1_0_2 - 0.133333333333333*G1_2_0 - 0.133333333333333*G1_2_2 - 0.133333333333333*G4_0_0 - 0.133333333333333*G4_0_2 - 0.133333333333333*G4_2_0 - 0.133333333333333*G4_2_2 - 0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_2;
+    A[879] = -0.133333333333333*G1_0_1 - 0.133333333333333*G1_0_2 - 0.133333333333333*G1_2_0 - 0.266666666666666*G1_2_1 - 0.266666666666666*G1_2_2 - 0.133333333333333*G4_0_1 - 0.133333333333333*G4_0_2 - 0.133333333333333*G4_2_0 - 0.266666666666666*G4_2_1 - 0.266666666666666*G4_2_2 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_2_0 - 0.266666666666666*G7_2_1 - 0.266666666666666*G7_2_2;
+    A[880] = 0.0;
+    A[881] = 0.0;
+    A[882] = 0.0;
+    A[883] = 0.0;
+    A[884] = 0.0;
+    A[885] = 0.0;
+    A[886] = 0.0;
+    A[887] = 0.0;
+    A[888] = 0.0;
+    A[889] = 0.0;
+    A[890] = 0.0;
+    A[891] = 0.0;
+    A[892] = 0.0;
+    A[893] = 0.0;
+    A[894] = 0.0;
+    A[895] = 0.0;
+    A[896] = 0.0;
+    A[897] = 0.0;
+    A[898] = 0.0;
+    A[899] = 0.0;
+    A[900] = 0.0;
+    A[901] = 0.0;
+    A[902] = 0.0;
+    A[903] = 0.0;
+    A[904] = 0.0333333333333332*G1_0_0 + 0.0333333333333333*G1_0_1 + 0.0333333333333333*G1_0_2 + 0.0333333333333333*G1_1_0 + 0.0333333333333333*G1_1_1 + 0.0333333333333333*G1_1_2 + 0.0333333333333332*G4_0_0 + 0.0333333333333333*G4_0_1 + 0.0333333333333333*G4_0_2 + 0.0333333333333333*G4_1_0 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G4_1_2 + 0.0333333333333332*G7_0_0 + 0.0333333333333333*G7_0_1 + 0.0333333333333333*G7_0_2 + 0.0333333333333333*G7_1_0 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_1_2;
+    A[905] = -0.0333333333333333*G1_0_0 + 0.1*G1_1_0 - 0.0333333333333333*G4_0_0 + 0.1*G4_1_0 - 0.0333333333333333*G7_0_0 + 0.1*G7_1_0;
+    A[906] = 0.1*G1_0_1 - 0.0333333333333333*G1_1_1 + 0.1*G4_0_1 - 0.0333333333333333*G4_1_1 + 0.1*G7_0_1 - 0.0333333333333333*G7_1_1;
+    A[907] = -0.0333333333333333*G1_0_2 - 0.0333333333333333*G1_1_2 - 0.0333333333333333*G4_0_2 - 0.0333333333333333*G4_1_2 - 0.0333333333333333*G7_0_2 - 0.0333333333333333*G7_1_2;
+    A[908] = 0.133333333333333*G1_0_1 + 0.266666666666666*G1_0_2 + 0.133333333333333*G1_1_1 + 0.133333333333333*G1_1_2 + 0.133333333333333*G4_0_1 + 0.266666666666666*G4_0_2 + 0.133333333333333*G4_1_1 + 0.133333333333333*G4_1_2 + 0.133333333333333*G7_0_1 + 0.266666666666666*G7_0_2 + 0.133333333333333*G7_1_1 + 0.133333333333333*G7_1_2;
+    A[909] = 0.133333333333333*G1_0_0 + 0.133333333333333*G1_0_2 + 0.133333333333333*G1_1_0 + 0.266666666666666*G1_1_2 + 0.133333333333333*G4_0_0 + 0.133333333333333*G4_0_2 + 0.133333333333333*G4_1_0 + 0.266666666666666*G4_1_2 + 0.133333333333333*G7_0_0 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.266666666666666*G7_1_2;
+    A[910] = 0.266666666666666*G1_0_0 + 0.133333333333333*G1_0_1 + 0.133333333333333*G1_1_0 + 0.266666666666666*G1_1_1 + 0.266666666666666*G4_0_0 + 0.133333333333333*G4_0_1 + 0.133333333333333*G4_1_0 + 0.266666666666666*G4_1_1 + 0.266666666666666*G7_0_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_1_0 + 0.266666666666666*G7_1_1;
+    A[911] = -0.133333333333333*G1_0_0 - 0.133333333333333*G1_0_1 - 0.133333333333333*G1_1_0 - 0.133333333333333*G1_1_1 - 0.133333333333333*G4_0_0 - 0.133333333333333*G4_0_1 - 0.133333333333333*G4_1_0 - 0.133333333333333*G4_1_1 - 0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_1;
+    A[912] = -0.266666666666666*G1_0_0 - 0.133333333333333*G1_0_1 - 0.266666666666666*G1_0_2 - 0.133333333333333*G1_1_0 - 0.133333333333333*G1_1_2 - 0.266666666666666*G4_0_0 - 0.133333333333333*G4_0_1 - 0.266666666666666*G4_0_2 - 0.133333333333333*G4_1_0 - 0.133333333333333*G4_1_2 - 0.266666666666666*G7_0_0 - 0.133333333333333*G7_0_1 - 0.266666666666666*G7_0_2 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_2;
+    A[913] = -0.133333333333333*G1_0_1 - 0.133333333333333*G1_0_2 - 0.133333333333333*G1_1_0 - 0.266666666666666*G1_1_1 - 0.266666666666666*G1_1_2 - 0.133333333333333*G4_0_1 - 0.133333333333333*G4_0_2 - 0.133333333333333*G4_1_0 - 0.266666666666666*G4_1_1 - 0.266666666666666*G4_1_2 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_1_0 - 0.266666666666666*G7_1_1 - 0.266666666666666*G7_1_2;
+    A[914] = 0.0;
+    A[915] = 0.0;
+    A[916] = 0.0;
+    A[917] = 0.0;
+    A[918] = 0.0;
+    A[919] = 0.0;
+    A[920] = 0.0;
+    A[921] = 0.0;
+    A[922] = 0.0;
+    A[923] = 0.0;
+    A[924] = 0.0;
+    A[925] = 0.0;
+    A[926] = 0.0;
+    A[927] = 0.0;
+    A[928] = 0.0;
+    A[929] = 0.0;
+    A[930] = 0.0;
+    A[931] = 0.0;
+    A[932] = 0.0;
+    A[933] = 0.0;
+    A[934] = 0.0;
+    A[935] = 0.0;
+    A[936] = 0.0;
+    A[937] = 0.0;
+    A[938] = -0.0333333333333333*G1_0_0 - 0.0333333333333333*G1_0_1 - 0.0333333333333333*G1_0_2 - 0.0333333333333333*G1_1_0 - 0.0333333333333333*G1_1_1 - 0.0333333333333333*G1_1_2 - 0.133333333333333*G1_2_0 - 0.133333333333333*G1_2_1 - 0.133333333333333*G1_2_2 - 0.0333333333333333*G4_0_0 - 0.0333333333333333*G4_0_1 - 0.0333333333333333*G4_0_2 - 0.0333333333333333*G4_1_0 - 0.0333333333333333*G4_1_1 - 0.0333333333333333*G4_1_2 - 0.133333333333333*G4_2_0 - 0.133333333333333*G4_2_1 - 0.133333333333333*G4_2_2 - 0.0333333333333333*G7_0_0 - 0.0333333333333333*G7_0_1 - 0.0333333333333333*G7_0_2 - 0.0333333333333333*G7_1_0 - 0.0333333333333333*G7_1_1 - 0.0333333333333333*G7_1_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_1 - 0.133333333333333*G7_2_2;
+    A[939] = 0.0333333333333333*G1_0_0 + 0.0333333333333333*G1_1_0 + 0.0333333333333333*G4_0_0 + 0.0333333333333333*G4_1_0 + 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_1_0;
+    A[940] = 0.0333333333333333*G1_0_1 + 0.0333333333333333*G1_1_1 + 0.0333333333333333*G4_0_1 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G7_0_1 + 0.0333333333333333*G7_1_1;
+    A[941] = -0.1*G1_0_2 - 0.1*G1_1_2 - 0.133333333333333*G1_2_2 - 0.1*G4_0_2 - 0.1*G4_1_2 - 0.133333333333333*G4_2_2 - 0.1*G7_0_2 - 0.1*G7_1_2 - 0.133333333333333*G7_2_2;
+    A[942] = -0.266666666666667*G1_0_1 - 0.133333333333333*G1_0_2 - 0.266666666666667*G1_1_1 - 0.133333333333333*G1_1_2 - 0.133333333333333*G1_2_1 - 0.266666666666667*G4_0_1 - 0.133333333333333*G4_0_2 - 0.266666666666667*G4_1_1 - 0.133333333333333*G4_1_2 - 0.133333333333333*G4_2_1 - 0.266666666666667*G7_0_1 - 0.133333333333333*G7_0_2 - 0.266666666666667*G7_1_1 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_1;
+    A[943] = -0.266666666666666*G1_0_0 - 0.133333333333333*G1_0_2 - 0.266666666666666*G1_1_0 - 0.133333333333333*G1_1_2 - 0.133333333333333*G1_2_0 - 0.266666666666666*G4_0_0 - 0.133333333333333*G4_0_2 - 0.266666666666666*G4_1_0 - 0.133333333333333*G4_1_2 - 0.133333333333333*G4_2_0 - 0.266666666666666*G7_0_0 - 0.133333333333333*G7_0_2 - 0.266666666666666*G7_1_0 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_0;
+    A[944] = -0.133333333333333*G1_0_0 - 0.133333333333333*G1_0_1 - 0.133333333333333*G1_1_0 - 0.133333333333333*G1_1_1 - 0.133333333333333*G4_0_0 - 0.133333333333333*G4_0_1 - 0.133333333333333*G4_1_0 - 0.133333333333333*G4_1_1 - 0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_1;
+    A[945] = 0.266666666666666*G1_0_0 + 0.266666666666666*G1_0_1 + 0.133333333333333*G1_0_2 + 0.266666666666666*G1_1_0 + 0.266666666666666*G1_1_1 + 0.133333333333333*G1_1_2 + 0.133333333333333*G1_2_0 + 0.133333333333333*G1_2_1 + 0.266666666666666*G1_2_2 + 0.266666666666666*G4_0_0 + 0.266666666666666*G4_0_1 + 0.133333333333333*G4_0_2 + 0.266666666666666*G4_1_0 + 0.266666666666666*G4_1_1 + 0.133333333333333*G4_1_2 + 0.133333333333333*G4_2_0 + 0.133333333333333*G4_2_1 + 0.266666666666666*G4_2_2 + 0.266666666666666*G7_0_0 + 0.266666666666666*G7_0_1 + 0.133333333333333*G7_0_2 + 0.266666666666666*G7_1_0 + 0.266666666666666*G7_1_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_1 + 0.266666666666666*G7_2_2;
+    A[946] = 0.133333333333333*G1_0_0 + 0.133333333333333*G1_0_2 + 0.133333333333333*G1_1_0 + 0.133333333333333*G1_1_2 + 0.133333333333333*G1_2_1 + 0.133333333333333*G4_0_0 + 0.133333333333333*G4_0_2 + 0.133333333333333*G4_1_0 + 0.133333333333333*G4_1_2 + 0.133333333333333*G4_2_1 + 0.133333333333333*G7_0_0 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_1;
+    A[947] = 0.133333333333333*G1_0_1 + 0.133333333333333*G1_0_2 + 0.133333333333333*G1_1_1 + 0.133333333333333*G1_1_2 + 0.133333333333333*G1_2_0 + 0.133333333333333*G4_0_1 + 0.133333333333333*G4_0_2 + 0.133333333333333*G4_1_1 + 0.133333333333333*G4_1_2 + 0.133333333333333*G4_2_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0;
+    A[948] = 0.0;
+    A[949] = 0.0;
+    A[950] = 0.0;
+    A[951] = 0.0;
+    A[952] = 0.0;
+    A[953] = 0.0;
+    A[954] = 0.0;
+    A[955] = 0.0;
+    A[956] = 0.0;
+    A[957] = 0.0;
+    A[958] = 0.0;
+    A[959] = 0.0;
+    A[960] = 0.0;
+    A[961] = 0.0;
+    A[962] = 0.0;
+    A[963] = 0.0;
+    A[964] = 0.0;
+    A[965] = 0.0;
+    A[966] = 0.0;
+    A[967] = 0.0;
+    A[968] = 0.0;
+    A[969] = 0.0;
+    A[970] = 0.0;
+    A[971] = 0.0;
+    A[972] = -0.0333333333333332*G1_0_0 - 0.0333333333333333*G1_0_1 - 0.0333333333333333*G1_0_2 - 0.133333333333333*G1_1_0 - 0.133333333333333*G1_1_1 - 0.133333333333333*G1_1_2 - 0.0333333333333333*G1_2_0 - 0.0333333333333333*G1_2_1 - 0.0333333333333333*G1_2_2 - 0.0333333333333332*G4_0_0 - 0.0333333333333333*G4_0_1 - 0.0333333333333333*G4_0_2 - 0.133333333333333*G4_1_0 - 0.133333333333333*G4_1_1 - 0.133333333333333*G4_1_2 - 0.0333333333333333*G4_2_0 - 0.0333333333333333*G4_2_1 - 0.0333333333333333*G4_2_2 - 0.0333333333333332*G7_0_0 - 0.0333333333333333*G7_0_1 - 0.0333333333333333*G7_0_2 - 0.133333333333333*G7_1_0 - 0.133333333333333*G7_1_1 - 0.133333333333333*G7_1_2 - 0.0333333333333333*G7_2_0 - 0.0333333333333333*G7_2_1 - 0.0333333333333333*G7_2_2;
+    A[973] = 0.0333333333333333*G1_0_0 + 0.0333333333333333*G1_2_0 + 0.0333333333333333*G4_0_0 + 0.0333333333333333*G4_2_0 + 0.0333333333333333*G7_0_0 + 0.0333333333333333*G7_2_0;
+    A[974] = -0.1*G1_0_1 - 0.133333333333333*G1_1_1 - 0.1*G1_2_1 - 0.1*G4_0_1 - 0.133333333333333*G4_1_1 - 0.1*G4_2_1 - 0.1*G7_0_1 - 0.133333333333333*G7_1_1 - 0.1*G7_2_1;
+    A[975] = 0.0333333333333333*G1_0_2 + 0.0333333333333334*G1_2_2 + 0.0333333333333333*G4_0_2 + 0.0333333333333334*G4_2_2 + 0.0333333333333333*G7_0_2 + 0.0333333333333334*G7_2_2;
+    A[976] = -0.133333333333333*G1_0_1 - 0.266666666666666*G1_0_2 - 0.133333333333333*G1_1_2 - 0.133333333333333*G1_2_1 - 0.266666666666666*G1_2_2 - 0.133333333333333*G4_0_1 - 0.266666666666666*G4_0_2 - 0.133333333333333*G4_1_2 - 0.133333333333333*G4_2_1 - 0.266666666666666*G4_2_2 - 0.133333333333333*G7_0_1 - 0.266666666666666*G7_0_2 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_1 - 0.266666666666666*G7_2_2;
+    A[977] = -0.133333333333333*G1_0_0 - 0.133333333333333*G1_0_2 - 0.133333333333333*G1_2_0 - 0.133333333333333*G1_2_2 - 0.133333333333333*G4_0_0 - 0.133333333333333*G4_0_2 - 0.133333333333333*G4_2_0 - 0.133333333333333*G4_2_2 - 0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_2_0 - 0.133333333333333*G7_2_2;
+    A[978] = -0.266666666666666*G1_0_0 - 0.133333333333333*G1_0_1 - 0.133333333333333*G1_1_0 - 0.266666666666666*G1_2_0 - 0.133333333333333*G1_2_1 - 0.266666666666666*G4_0_0 - 0.133333333333333*G4_0_1 - 0.133333333333333*G4_1_0 - 0.266666666666666*G4_2_0 - 0.133333333333333*G4_2_1 - 0.266666666666666*G7_0_0 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_1_0 - 0.266666666666666*G7_2_0 - 0.133333333333333*G7_2_1;
+    A[979] = 0.133333333333333*G1_0_0 + 0.133333333333333*G1_0_1 + 0.133333333333333*G1_1_2 + 0.133333333333333*G1_2_0 + 0.133333333333333*G1_2_1 + 0.133333333333333*G4_0_0 + 0.133333333333333*G4_0_1 + 0.133333333333333*G4_1_2 + 0.133333333333333*G4_2_0 + 0.133333333333333*G4_2_1 + 0.133333333333333*G7_0_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_1;
+    A[980] = 0.266666666666666*G1_0_0 + 0.133333333333333*G1_0_1 + 0.266666666666666*G1_0_2 + 0.133333333333333*G1_1_0 + 0.266666666666666*G1_1_1 + 0.133333333333333*G1_1_2 + 0.266666666666666*G1_2_0 + 0.133333333333333*G1_2_1 + 0.266666666666666*G1_2_2 + 0.266666666666666*G4_0_0 + 0.133333333333333*G4_0_1 + 0.266666666666666*G4_0_2 + 0.133333333333333*G4_1_0 + 0.266666666666666*G4_1_1 + 0.133333333333333*G4_1_2 + 0.266666666666666*G4_2_0 + 0.133333333333333*G4_2_1 + 0.266666666666666*G4_2_2 + 0.266666666666666*G7_0_0 + 0.133333333333333*G7_0_1 + 0.266666666666666*G7_0_2 + 0.133333333333333*G7_1_0 + 0.266666666666666*G7_1_1 + 0.133333333333333*G7_1_2 + 0.266666666666666*G7_2_0 + 0.133333333333333*G7_2_1 + 0.266666666666666*G7_2_2;
+    A[981] = 0.133333333333333*G1_0_1 + 0.133333333333333*G1_0_2 + 0.133333333333333*G1_1_0 + 0.133333333333333*G1_2_1 + 0.133333333333333*G1_2_2 + 0.133333333333333*G4_0_1 + 0.133333333333333*G4_0_2 + 0.133333333333333*G4_1_0 + 0.133333333333333*G4_2_1 + 0.133333333333333*G4_2_2 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_2_1 + 0.133333333333333*G7_2_2;
+    A[982] = 0.0;
+    A[983] = 0.0;
+    A[984] = 0.0;
+    A[985] = 0.0;
+    A[986] = 0.0;
+    A[987] = 0.0;
+    A[988] = 0.0;
+    A[989] = 0.0;
+    A[990] = 0.0;
+    A[991] = 0.0;
+    A[992] = 0.0;
+    A[993] = 0.0;
+    A[994] = 0.0;
+    A[995] = 0.0;
+    A[996] = 0.0;
+    A[997] = 0.0;
+    A[998] = 0.0;
+    A[999] = 0.0;
+    A[1000] = 0.0;
+    A[1001] = 0.0;
+    A[1002] = 0.0;
+    A[1003] = 0.0;
+    A[1004] = 0.0;
+    A[1005] = 0.0;
+    A[1006] = -0.133333333333333*G1_0_0 - 0.133333333333333*G1_0_1 - 0.133333333333333*G1_0_2 - 0.0333333333333333*G1_1_0 - 0.0333333333333333*G1_1_1 - 0.0333333333333333*G1_1_2 - 0.0333333333333333*G1_2_0 - 0.0333333333333333*G1_2_1 - 0.0333333333333333*G1_2_2 - 0.133333333333333*G4_0_0 - 0.133333333333333*G4_0_1 - 0.133333333333333*G4_0_2 - 0.0333333333333333*G4_1_0 - 0.0333333333333333*G4_1_1 - 0.0333333333333333*G4_1_2 - 0.0333333333333333*G4_2_0 - 0.0333333333333333*G4_2_1 - 0.0333333333333333*G4_2_2 - 0.133333333333333*G7_0_0 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_0_2 - 0.0333333333333333*G7_1_0 - 0.0333333333333333*G7_1_1 - 0.0333333333333333*G7_1_2 - 0.0333333333333333*G7_2_0 - 0.0333333333333333*G7_2_1 - 0.0333333333333333*G7_2_2;
+    A[1007] = -0.133333333333333*G1_0_0 - 0.1*G1_1_0 - 0.1*G1_2_0 - 0.133333333333333*G4_0_0 - 0.1*G4_1_0 - 0.1*G4_2_0 - 0.133333333333333*G7_0_0 - 0.1*G7_1_0 - 0.1*G7_2_0;
+    A[1008] = 0.0333333333333333*G1_1_1 + 0.0333333333333333*G1_2_1 + 0.0333333333333333*G4_1_1 + 0.0333333333333333*G4_2_1 + 0.0333333333333333*G7_1_1 + 0.0333333333333333*G7_2_1;
+    A[1009] = 0.0333333333333333*G1_1_2 + 0.0333333333333333*G1_2_2 + 0.0333333333333333*G4_1_2 + 0.0333333333333333*G4_2_2 + 0.0333333333333333*G7_1_2 + 0.0333333333333333*G7_2_2;
+    A[1010] = -0.133333333333333*G1_1_1 - 0.133333333333333*G1_1_2 - 0.133333333333333*G1_2_1 - 0.133333333333333*G1_2_2 - 0.133333333333333*G4_1_1 - 0.133333333333333*G4_1_2 - 0.133333333333333*G4_2_1 - 0.133333333333333*G4_2_2 - 0.133333333333333*G7_1_1 - 0.133333333333333*G7_1_2 - 0.133333333333333*G7_2_1 - 0.133333333333333*G7_2_2;
+    A[1011] = -0.133333333333333*G1_0_2 - 0.133333333333333*G1_1_0 - 0.266666666666666*G1_1_2 - 0.133333333333333*G1_2_0 - 0.266666666666666*G1_2_2 - 0.133333333333333*G4_0_2 - 0.133333333333333*G4_1_0 - 0.266666666666666*G4_1_2 - 0.133333333333333*G4_2_0 - 0.266666666666666*G4_2_2 - 0.133333333333333*G7_0_2 - 0.133333333333333*G7_1_0 - 0.266666666666666*G7_1_2 - 0.133333333333333*G7_2_0 - 0.266666666666666*G7_2_2;
+    A[1012] = -0.133333333333333*G1_0_1 - 0.133333333333333*G1_1_0 - 0.266666666666666*G1_1_1 - 0.133333333333333*G1_2_0 - 0.266666666666666*G1_2_1 - 0.133333333333333*G4_0_1 - 0.133333333333333*G4_1_0 - 0.266666666666666*G4_1_1 - 0.133333333333333*G4_2_0 - 0.266666666666666*G4_2_1 - 0.133333333333333*G7_0_1 - 0.133333333333333*G7_1_0 - 0.266666666666666*G7_1_1 - 0.133333333333333*G7_2_0 - 0.266666666666666*G7_2_1;
+    A[1013] = 0.133333333333333*G1_0_2 + 0.133333333333333*G1_1_0 + 0.133333333333333*G1_1_1 + 0.133333333333333*G1_2_0 + 0.133333333333333*G1_2_1 + 0.133333333333333*G4_0_2 + 0.133333333333333*G4_1_0 + 0.133333333333333*G4_1_1 + 0.133333333333333*G4_2_0 + 0.133333333333333*G4_2_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_1_1 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_1;
+    A[1014] = 0.133333333333333*G1_0_1 + 0.133333333333333*G1_1_0 + 0.133333333333333*G1_1_2 + 0.133333333333333*G1_2_0 + 0.133333333333333*G1_2_2 + 0.133333333333333*G4_0_1 + 0.133333333333333*G4_1_0 + 0.133333333333333*G4_1_2 + 0.133333333333333*G4_2_0 + 0.133333333333333*G4_2_2 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_1_0 + 0.133333333333333*G7_1_2 + 0.133333333333333*G7_2_0 + 0.133333333333333*G7_2_2;
+    A[1015] = 0.266666666666666*G1_0_0 + 0.133333333333333*G1_0_1 + 0.133333333333333*G1_0_2 + 0.133333333333333*G1_1_0 + 0.266666666666666*G1_1_1 + 0.266666666666666*G1_1_2 + 0.133333333333333*G1_2_0 + 0.266666666666666*G1_2_1 + 0.266666666666666*G1_2_2 + 0.266666666666666*G4_0_0 + 0.133333333333333*G4_0_1 + 0.133333333333333*G4_0_2 + 0.133333333333333*G4_1_0 + 0.266666666666666*G4_1_1 + 0.266666666666666*G4_1_2 + 0.133333333333333*G4_2_0 + 0.266666666666666*G4_2_1 + 0.266666666666666*G4_2_2 + 0.266666666666666*G7_0_0 + 0.133333333333333*G7_0_1 + 0.133333333333333*G7_0_2 + 0.133333333333333*G7_1_0 + 0.266666666666666*G7_1_1 + 0.266666666666666*G7_1_2 + 0.133333333333333*G7_2_0 + 0.266666666666666*G7_2_1 + 0.266666666666666*G7_2_2;
+    A[1016] = 0.0;
+    A[1017] = 0.0;
+    A[1018] = 0.0;
+    A[1019] = 0.0;
+    A[1020] = 0.0;
+    A[1021] = 0.0;
+    A[1022] = 0.0;
+    A[1023] = 0.0;
+    A[1024] = 0.0;
+    A[1025] = 0.0;
+    A[1026] = 0.0;
+    A[1027] = 0.0;
+    A[1028] = 0.0;
+    A[1029] = 0.0;
+    A[1030] = 0.0;
+    A[1031] = 0.0;
+    A[1032] = 0.0;
+    A[1033] = 0.0;
+    A[1034] = 0.0;
+    A[1035] = 0.0;
+    A[1036] = 0.0;
+    A[1037] = 0.0;
+    A[1038] = 0.0;
+    A[1039] = 0.0;
+    A[1040] = 0.0;
+    A[1041] = 0.0;
+    A[1042] = 0.0;
+    A[1043] = 0.0;
+    A[1044] = 0.0;
+    A[1045] = 0.0;
+    A[1046] = 0.0;
+    A[1047] = 0.0;
+    A[1048] = 0.0;
+    A[1049] = 0.0;
+    A[1050] = 0.0166666666666667*G0_;
+    A[1051] = 0.00833333333333333*G0_;
+    A[1052] = 0.00833333333333333*G0_;
+    A[1053] = 0.00833333333333333*G0_;
+    A[1054] = 0.0;
+    A[1055] = 0.0;
+    A[1056] = 0.0;
+    A[1057] = 0.0;
+    A[1058] = 0.0;
+    A[1059] = 0.0;
+    A[1060] = 0.0;
+    A[1061] = 0.0;
+    A[1062] = 0.0;
+    A[1063] = 0.0;
+    A[1064] = 0.0;
+    A[1065] = 0.0;
+    A[1066] = 0.0;
+    A[1067] = 0.0;
+    A[1068] = 0.0;
+    A[1069] = 0.0;
+    A[1070] = 0.0;
+    A[1071] = 0.0;
+    A[1072] = 0.0;
+    A[1073] = 0.0;
+    A[1074] = 0.0;
+    A[1075] = 0.0;
+    A[1076] = 0.0;
+    A[1077] = 0.0;
+    A[1078] = 0.0;
+    A[1079] = 0.0;
+    A[1080] = 0.0;
+    A[1081] = 0.0;
+    A[1082] = 0.0;
+    A[1083] = 0.0;
+    A[1084] = 0.00833333333333333*G0_;
+    A[1085] = 0.0166666666666667*G0_;
+    A[1086] = 0.00833333333333333*G0_;
+    A[1087] = 0.00833333333333333*G0_;
+    A[1088] = 0.0;
+    A[1089] = 0.0;
+    A[1090] = 0.0;
+    A[1091] = 0.0;
+    A[1092] = 0.0;
+    A[1093] = 0.0;
+    A[1094] = 0.0;
+    A[1095] = 0.0;
+    A[1096] = 0.0;
+    A[1097] = 0.0;
+    A[1098] = 0.0;
+    A[1099] = 0.0;
+    A[1100] = 0.0;
+    A[1101] = 0.0;
+    A[1102] = 0.0;
+    A[1103] = 0.0;
+    A[1104] = 0.0;
+    A[1105] = 0.0;
+    A[1106] = 0.0;
+    A[1107] = 0.0;
+    A[1108] = 0.0;
+    A[1109] = 0.0;
+    A[1110] = 0.0;
+    A[1111] = 0.0;
+    A[1112] = 0.0;
+    A[1113] = 0.0;
+    A[1114] = 0.0;
+    A[1115] = 0.0;
+    A[1116] = 0.0;
+    A[1117] = 0.0;
+    A[1118] = 0.00833333333333333*G0_;
+    A[1119] = 0.00833333333333333*G0_;
+    A[1120] = 0.0166666666666667*G0_;
+    A[1121] = 0.00833333333333333*G0_;
+    A[1122] = 0.0;
+    A[1123] = 0.0;
+    A[1124] = 0.0;
+    A[1125] = 0.0;
+    A[1126] = 0.0;
+    A[1127] = 0.0;
+    A[1128] = 0.0;
+    A[1129] = 0.0;
+    A[1130] = 0.0;
+    A[1131] = 0.0;
+    A[1132] = 0.0;
+    A[1133] = 0.0;
+    A[1134] = 0.0;
+    A[1135] = 0.0;
+    A[1136] = 0.0;
+    A[1137] = 0.0;
+    A[1138] = 0.0;
+    A[1139] = 0.0;
+    A[1140] = 0.0;
+    A[1141] = 0.0;
+    A[1142] = 0.0;
+    A[1143] = 0.0;
+    A[1144] = 0.0;
+    A[1145] = 0.0;
+    A[1146] = 0.0;
+    A[1147] = 0.0;
+    A[1148] = 0.0;
+    A[1149] = 0.0;
+    A[1150] = 0.0;
+    A[1151] = 0.0;
+    A[1152] = 0.00833333333333333*G0_;
+    A[1153] = 0.00833333333333333*G0_;
+    A[1154] = 0.00833333333333333*G0_;
+    A[1155] = 0.0166666666666667*G0_;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stokespreconditioner_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  stokespreconditioner_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokespreconditioner_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "55da8206021e2c10190cf35b83aa9ca97a1ada78eb5f2f8ce767bb97e2f4731001a9d030e5378186cfc42bc5ac3278ae3525165ab737b02e94a691cc7fd116d9";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokespreconditioner_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokespreconditioner_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokespreconditioner_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokespreconditioner_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stokespreconditioner_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace StokesPreconditioner
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokespreconditioner_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokespreconditioner_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokespreconditioner_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokespreconditioner_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/stokes-iterative/cpp/StokesPreconditioner.ufl b/demo/documented/stokes-iterative/cpp/StokesPreconditioner.ufl
new file mode 100644
index 0000000..d2c429f
--- /dev/null
+++ b/demo/documented/stokes-iterative/cpp/StokesPreconditioner.ufl
@@ -0,0 +1,35 @@
+# Copyright (c) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-01-05
+# Last changed:
+#
+# The bilinear form a(u, v) for a Stokes preconditioner matrix
+# (Taylor-Hood elements).
+#
+# Compile this form with FFC: ffc -l dolfin StokesPreconditioner.ufl
+
+P2 = VectorElement("Lagrange", tetrahedron, 2)
+P1 = FiniteElement("Lagrange", tetrahedron, 1)
+TH = P2 * P1
+
+(u, p) = TrialFunctions(TH)
+(v, q) = TestFunctions(TH)
+
+f = Coefficient(P2)
+
+a = inner(grad(u), grad(v))*dx + p*q*dx
diff --git a/demo/documented/stokes-iterative/cpp/compile.log b/demo/documented/stokes-iterative/cpp/compile.log
new file mode 100644
index 0000000..9e79fd7
--- /dev/null
+++ b/demo/documented/stokes-iterative/cpp/compile.log
@@ -0,0 +1,2677 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form StokesPreconditioner
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Mixed<Vector<3 x CG2(?)>, CG1(?)>'
+  Unique sub elements:    'Mixed<Vector<3 x CG2(?)>, CG1(?)>, Vector<3 x CG2(?)>, CG
+                          1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.043849 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1156 entries computed in 0.00303 seconds
+  Shape of reference tensor: (34, 34)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00392 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00313 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00311 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00319 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.0031 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00435 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00327 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00375 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00346 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0745051 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000211 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 1.96972 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000552177 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./StokesPreconditioner.h.
+  
+Compiler stage 5 finished in 0.00318408 seconds.
+
+FFC finished in 2.09242 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Stokes
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Mixed<Vector<3 x CG2(?)>, CG1(?)>'
+  Unique sub elements:    'Mixed<Vector<3 x CG2(?)>, CG1(?)>, Vector<3 x CG2(?)>, CG
+                          1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'Mixed<Vector<3 x CG2(?)>, CG1(?)>, Vector<3 x CG2(?)>'
+  Unique sub elements:    'Mixed<Vector<3 x CG2(?)>, CG1(?)>, Vector<3 x CG2(?)>, CG
+                          1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.076637 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3468 entries computed in 0.00282 seconds
+  Shape of reference tensor: (34, 34, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3468 entries computed in 0.00478 seconds
+  Shape of reference tensor: (34, 34, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3468 entries computed in 0.00292 seconds
+  Shape of reference tensor: (34, 34, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3468 entries computed in 0.00291 seconds
+  Shape of reference tensor: (34, 34, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3468 entries computed in 0.00296 seconds
+  Shape of reference tensor: (34, 34, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  3468 entries computed in 0.00285 seconds
+  Shape of reference tensor: (34, 34, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00333 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00696 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00644 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00716 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00597 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00496 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00345 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00345 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  10404 entries computed in 0.00368 seconds
+  Shape of reference tensor: (34, 34, 3, 3)
+  Primary multi index:   rank = 2 dims = [34, 34] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 30], [1, 31], [1, 32], [1, 33], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [2, 26], [2, 27], [2, 28], [2, 29], [2, 30], [2, 31], [2, 32], [2, 33], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [3, 26], [3, 27], [3, 28], [3, 29], [3, 30], [3, 31], [3, 32], [3, 33], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [4, 26], [4, 27], [4, 28], [4, 29], [4, 30], [4, 31], [4, 32], [4, 33], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [5, 32], [5, 33], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [6, 26], [6, 27], [6, 28], [6, 29], [6, 30], [6, 31], [6, 32], [6, 33], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [7, 26], [7, 27], [7, 28], [7, 29], [7, 30], [7, 31], [7, 32], [7, 33], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [8, 26], [8, 27], [8, 28], [8, 29], [8, 30], [8, 31], [8, 32], [8, 33], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [9, 26], [9, 27], [9, 28], [9, 29], [9, 30], [9, 31], [9, 32], [9, 33], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [10, 26], [10, 27], [10, 28], [10, 29], [10, 30], [10, 31], [10, 32], [10, 33], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [11, 26], [11, 27], [11, 28], [11, 29], [11, 30], [11, 31], [11, 32], [11, 33], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [12, 32], [12, 33], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [13, 26], [13, 27], [13, 28], [13, 29], [13, 30], [13, 31], [13, 32], [13, 33], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25], [14, 26], [14, 27], [14, 28], [14, 29], [14, 30], [14, 31], [14, 32], [14, 33], [15, 0], [15, 1], [15, 2], [15, 3], [15, 4], [15, 5], [15, 6], [15, 7], [15, 8], [15, 9], [15, 10], [15, 11], [15, 12], [15, 13], [15, 14], [15, 15], [15, 16], [15, 17], [15, 18], [15, 19], [15, 20], [15, 21], [15, 22], [15, 23], [15, 24], [15, 25], [15, 26], [15, 27], [15, 28], [15, 29], [15, 30], [15, 31], [15, 32], [15, 33], [16, 0], [16, 1], [16, 2], [16, 3], [16, 4], [16, 5], [16, 6], [16, 7], [16, 8], [16, 9], [16, 10], [16, 11], [16, 12], [16, 13], [16, 14], [16, 15], [16, 16], [16, 17], [16, 18], [16, 19], [16, 20], [16, 21], [16, 22], [16, 23], [16, 24], [16, 25], [16, 26], [16, 27], [16, 28], [16, 29], [16, 30], [16, 31], [16, 32], [16, 33], [17, 0], [17, 1], [17, 2], [17, 3], [17, 4], [17, 5], [17, 6], [17, 7], [17, 8], [17, 9], [17, 10], [17, 11], [17, 12], [17, 13], [17, 14], [17, 15], [17, 16], [17, 17], [17, 18], [17, 19], [17, 20], [17, 21], [17, 22], [17, 23], [17, 24], [17, 25], [17, 26], [17, 27], [17, 28], [17, 29], [17, 30], [17, 31], [17, 32], [17, 33], [18, 0], [18, 1], [18, 2], [18, 3], [18, 4], [18, 5], [18, 6], [18, 7], [18, 8], [18, 9], [18, 10], [18, 11], [18, 12], [18, 13], [18, 14], [18, 15], [18, 16], [18, 17], [18, 18], [18, 19], [18, 20], [18, 21], [18, 22], [18, 23], [18, 24], [18, 25], [18, 26], [18, 27], [18, 28], [18, 29], [18, 30], [18, 31], [18, 32], [18, 33], [19, 0], [19, 1], [19, 2], [19, 3], [19, 4], [19, 5], [19, 6], [19, 7], [19, 8], [19, 9], [19, 10], [19, 11], [19, 12], [19, 13], [19, 14], [19, 15], [19, 16], [19, 17], [19, 18], [19, 19], [19, 20], [19, 21], [19, 22], [19, 23], [19, 24], [19, 25], [19, 26], [19, 27], [19, 28], [19, 29], [19, 30], [19, 31], [19, 32], [19, 33], [20, 0], [20, 1], [20, 2], [20, 3], [20, 4], [20, 5], [20, 6], [20, 7], [20, 8], [20, 9], [20, 10], [20, 11], [20, 12], [20, 13], [20, 14], [20, 15], [20, 16], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [20, 32], [20, 33], [21, 0], [21, 1], [21, 2], [21, 3], [21, 4], [21, 5], [21, 6], [21, 7], [21, 8], [21, 9], [21, 10], [21, 11], [21, 12], [21, 13], [21, 14], [21, 15], [21, 16], [21, 17], [21, 18], [21, 19], [21, 20], [21, 21], [21, 22], [21, 23], [21, 24], [21, 25], [21, 26], [21, 27], [21, 28], [21, 29], [21, 30], [21, 31], [21, 32], [21, 33], [22, 0], [22, 1], [22, 2], [22, 3], [22, 4], [22, 5], [22, 6], [22, 7], [22, 8], [22, 9], [22, 10], [22, 11], [22, 12], [22, 13], [22, 14], [22, 15], [22, 16], [22, 17], [22, 18], [22, 19], [22, 20], [22, 21], [22, 22], [22, 23], [22, 24], [22, 25], [22, 26], [22, 27], [22, 28], [22, 29], [22, 30], [22, 31], [22, 32], [22, 33], [23, 0], [23, 1], [23, 2], [23, 3], [23, 4], [23, 5], [23, 6], [23, 7], [23, 8], [23, 9], [23, 10], [23, 11], [23, 12], [23, 13], [23, 14], [23, 15], [23, 16], [23, 17], [23, 18], [23, 19], [23, 20], [23, 21], [23, 22], [23, 23], [23, 24], [23, 25], [23, 26], [23, 27], [23, 28], [23, 29], [23, 30], [23, 31], [23, 32], [23, 33], [24, 0], [24, 1], [24, 2], [24, 3], [24, 4], [24, 5], [24, 6], [24, 7], [24, 8], [24, 9], [24, 10], [24, 11], [24, 12], [24, 13], [24, 14], [24, 15], [24, 16], [24, 17], [24, 18], [24, 19], [24, 20], [24, 21], [24, 22], [24, 23], [24, 24], [24, 25], [24, 26], [24, 27], [24, 28], [24, 29], [24, 30], [24, 31], [24, 32], [24, 33], [25, 0], [25, 1], [25, 2], [25, 3], [25, 4], [25, 5], [25, 6], [25, 7], [25, 8], [25, 9], [25, 10], [25, 11], [25, 12], [25, 13], [25, 14], [25, 15], [25, 16], [25, 17], [25, 18], [25, 19], [25, 20], [25, 21], [25, 22], [25, 23], [25, 24], [25, 25], [25, 26], [25, 27], [25, 28], [25, 29], [25, 30], [25, 31], [25, 32], [25, 33], [26, 0], [26, 1], [26, 2], [26, 3], [26, 4], [26, 5], [26, 6], [26, 7], [26, 8], [26, 9], [26, 10], [26, 11], [26, 12], [26, 13], [26, 14], [26, 15], [26, 16], [26, 17], [26, 18], [26, 19], [26, 20], [26, 21], [26, 22], [26, 23], [26, 24], [26, 25], [26, 26], [26, 27], [26, 28], [26, 29], [26, 30], [26, 31], [26, 32], [26, 33], [27, 0], [27, 1], [27, 2], [27, 3], [27, 4], [27, 5], [27, 6], [27, 7], [27, 8], [27, 9], [27, 10], [27, 11], [27, 12], [27, 13], [27, 14], [27, 15], [27, 16], [27, 17], [27, 18], [27, 19], [27, 20], [27, 21], [27, 22], [27, 23], [27, 24], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31], [27, 32], [27, 33], [28, 0], [28, 1], [28, 2], [28, 3], [28, 4], [28, 5], [28, 6], [28, 7], [28, 8], [28, 9], [28, 10], [28, 11], [28, 12], [28, 13], [28, 14], [28, 15], [28, 16], [28, 17], [28, 18], [28, 19], [28, 20], [28, 21], [28, 22], [28, 23], [28, 24], [28, 25], [28, 26], [28, 27], [28, 28], [28, 29], [28, 30], [28, 31], [28, 32], [28, 33], [29, 0], [29, 1], [29, 2], [29, 3], [29, 4], [29, 5], [29, 6], [29, 7], [29, 8], [29, 9], [29, 10], [29, 11], [29, 12], [29, 13], [29, 14], [29, 15], [29, 16], [29, 17], [29, 18], [29, 19], [29, 20], [29, 21], [29, 22], [29, 23], [29, 24], [29, 25], [29, 26], [29, 27], [29, 28], [29, 29], [29, 30], [29, 31], [29, 32], [29, 33], [30, 0], [30, 1], [30, 2], [30, 3], [30, 4], [30, 5], [30, 6], [30, 7], [30, 8], [30, 9], [30, 10], [30, 11], [30, 12], [30, 13], [30, 14], [30, 15], [30, 16], [30, 17], [30, 18], [30, 19], [30, 20], [30, 21], [30, 22], [30, 23], [30, 24], [30, 25], [30, 26], [30, 27], [30, 28], [30, 29], [30, 30], [30, 31], [30, 32], [30, 33], [31, 0], [31, 1], [31, 2], [31, 3], [31, 4], [31, 5], [31, 6], [31, 7], [31, 8], [31, 9], [31, 10], [31, 11], [31, 12], [31, 13], [31, 14], [31, 15], [31, 16], [31, 17], [31, 18], [31, 19], [31, 20], [31, 21], [31, 22], [31, 23], [31, 24], [31, 25], [31, 26], [31, 27], [31, 28], [31, 29], [31, 30], [31, 31], [31, 32], [31, 33], [32, 0], [32, 1], [32, 2], [32, 3], [32, 4], [32, 5], [32, 6], [32, 7], [32, 8], [32, 9], [32, 10], [32, 11], [32, 12], [32, 13], [32, 14], [32, 15], [32, 16], [32, 17], [32, 18], [32, 19], [32, 20], [32, 21], [32, 22], [32, 23], [32, 24], [32, 25], [32, 26], [32, 27], [32, 28], [32, 29], [32, 30], [32, 31], [32, 32], [32, 33], [33, 0], [33, 1], [33, 2], [33, 3], [33, 4], [33, 5], [33, 6], [33, 7], [33, 8], [33, 9], [33, 10], [33, 11], [33, 12], [33, 13], [33, 14], [33, 15], [33, 16], [33, 17], [33, 18], [33, 19], [33, 20], [33, 21], [33, 22], [33, 23], [33, 24], [33, 25], [33, 26], [33, 27], [33, 28], [33, 29], [33, 30], [33, 31], [33, 32], [33, 33]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1020 entries computed in 0.00555 seconds
+  Shape of reference tensor: (34, 30)
+  Primary multi index:   rank = 1 dims = [34] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33]]
+  Secondary multi index: rank = 1 dims = [30] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [30] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1020 entries computed in 0.00589 seconds
+  Shape of reference tensor: (34, 30)
+  Primary multi index:   rank = 1 dims = [34] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33]]
+  Secondary multi index: rank = 1 dims = [30] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [30] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1020 entries computed in 0.00432 seconds
+  Shape of reference tensor: (34, 30)
+  Primary multi index:   rank = 1 dims = [34] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33]]
+  Secondary multi index: rank = 1 dims = [30] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [30] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.170998 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000327826 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 1.95159 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.0005548 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Stokes.h.
+  
+Compiler stage 5 finished in 0.00262094 seconds.
+
+FFC finished in 2.20312 seconds.
diff --git a/demo/documented/stokes-iterative/cpp/documentation.rst b/demo/documented/stokes-iterative/cpp/documentation.rst
new file mode 100644
index 0000000..c2bb76a
--- /dev/null
+++ b/demo/documented/stokes-iterative/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the DOLFIN iterative Stokes demo
+
+.. _demo_pde_iterative_stokes_python_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/stokes-iterative/cpp/main.cpp b/demo/documented/stokes-iterative/cpp/main.cpp
new file mode 100644
index 0000000..86fa6d1
--- /dev/null
+++ b/demo/documented/stokes-iterative/cpp/main.cpp
@@ -0,0 +1,184 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-01-05
+// Last changed: 2012-07-05
+//
+// This demo solves the Stokes equations using an iterative linear solver.
+// Its also demonstrates how to use a precontioner matrix that is different
+// from the matrix being solved.
+//
+// Note that the sign for the pressure has been flipped for symmetry.
+//
+
+#include <dolfin.h>
+#include "Stokes.h"
+#include "StokesPreconditioner.h"
+
+using namespace dolfin;
+
+#if defined(HAS_PETSC) || defined(HAS_TRILINOS)
+
+int main()
+{
+  // Sub domain for left-hand side
+  class Left : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] < DOLFIN_EPS;
+    }
+  };
+
+  // Sub domain for right-hand side
+  class Right : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return std::abs(1.0 - x[0]) < DOLFIN_EPS;
+    }
+  };
+
+  // Sub domain for top and bottom
+  class TopBottom : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return std::abs(1.0 - x[1]) < DOLFIN_EPS || std::abs(x[1]) < DOLFIN_EPS;
+    }
+  };
+
+  // Function for inflow boundary condition for velocity
+  class Inflow : public Expression
+  {
+  public:
+
+    Inflow() : Expression(3) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = -sin(x[1]*DOLFIN_PI);
+      values[1] = 0.0;
+      values[2] = 0.0;
+    }
+
+  };
+
+  // Check for available preconditioners
+  if (!has_krylov_solver_preconditioner("amg"))
+  {
+    info("Sorry, this demo is only available when DOLFIN is compiled with AMG "
+	 "preconditioner, Hypre or ML.");
+    return 0;
+  }
+
+  // Check for available Krylov solvers
+  std::string krylov_method;
+  if (has_krylov_solver_method("minres"))
+    krylov_method = "minres";
+  else if (has_krylov_solver_method("tfqmr"))
+    krylov_method = "tfqmr";
+  else
+  {
+    info("Default linear algebra backend was not compiled with MINRES or TFQMR "
+         "Krylov subspace method. Terminating.");
+    return 0;
+  }
+
+  // Create mesh
+  UnitCubeMesh mesh(16, 16, 16);
+
+  // Create function space and subspaces
+  Stokes::FunctionSpace W(mesh);
+  SubSpace W0(W, 0);
+  SubSpace W1(W, 1);
+
+  // Set-up infow boundary condition
+  Inflow inflow_prfofile;
+  Right right;
+  DirichletBC inflow(W0, inflow_prfofile, right);
+
+  // Set-up outflow pressure boundary condition
+  Constant zero(0.0);
+  Left left;
+  DirichletBC outflow(W1, zero, left);
+
+  // Set-up no-slip boundary condition
+  Constant zero_vector(0.0, 0.0, 0.0);
+  TopBottom top_bottom;
+  DirichletBC noslip(W0, zero_vector, top_bottom);
+
+  // Collect boundary conditions
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&inflow); bcs.push_back(&outflow); bcs.push_back(&noslip);
+
+  // Create forms for the Stokes problem
+  Constant f(0.0, 0.0, 0.0);
+  Stokes::BilinearForm a(W, W);
+  Stokes::LinearForm L(W);
+  L.f = f;
+
+  // Create solution function
+  Function w(W);
+
+  // Create form for the Stokes preconditioner
+  StokesPreconditioner::BilinearForm a_P(W, W);
+
+  // Assemble precondtioner system (P, b_dummy)
+  std::shared_ptr<Matrix> P(new Matrix);
+  Vector b;
+  assemble_system(*P, b, a_P, L, bcs);
+
+  // Assemble Stokes system (A, b)
+  std::shared_ptr<Matrix> A(new Matrix);
+  assemble_system(*A, b, a, L, bcs);
+
+  // Create Krylov solver with specified method and preconditioner
+  KrylovSolver solver(krylov_method, "amg");
+
+  // Set operator (A) and precondtioner matrix (P)
+  solver.set_operators(A, P);
+
+  // Solve system
+  solver.solve(*w.vector(), b);
+  cout << "Soln norm: " << w.vector()->norm("l2") << endl;
+
+  // Split solution
+  Function u = w[0];
+  Function p = w[1];
+
+  // Save solution in VTK format
+  File ufile_pvd("velocity.pvd");
+  ufile_pvd << u;
+  File pfile_pvd("pressure.pvd");
+  pfile_pvd << p;
+
+  // Plot solution
+  plot(u);
+  plot(p);
+  interactive();
+}
+
+#else
+
+int main()
+{
+  info("DOLFIN has not been configured with Trilinos or PETSc. Exiting.");
+  return 0;
+}
+
+#endif
diff --git a/demo/documented/stokes-iterative/python/demo_stokes-iterative.py b/demo/documented/stokes-iterative/python/demo_stokes-iterative.py
new file mode 100644
index 0000000..7a305ee
--- /dev/null
+++ b/demo/documented/stokes-iterative/python/demo_stokes-iterative.py
@@ -0,0 +1,114 @@
+"""This demo solves the Stokes equations using an iterative linear solver.
+Note that the sign for the pressure has been flipped for symmetry."""
+
+# Copyright (C) 2010 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-08-08
+# Last changed: 2010-08-08
+
+# Begin demo
+
+from dolfin import *
+
+# Test for PETSc or Epetra
+if not has_linear_algebra_backend("PETSc") and not has_linear_algebra_backend("Epetra"):
+    info("DOLFIN has not been configured with Trilinos or PETSc. Exiting.")
+    exit()
+
+if not has_krylov_solver_preconditioner("amg"):
+    info("Sorry, this demo is only available when DOLFIN is compiled with AMG "
+	 "preconditioner, Hypre or ML.")
+    exit()
+
+if has_krylov_solver_method("minres"):
+    krylov_method = "minres"
+elif has_krylov_solver_method("tfqmr"):
+    krylov_method = "tfqmr"
+else:
+    info("Default linear algebra backend was not compiled with MINRES or TFQMR "
+         "Krylov subspace method. Terminating.")
+    exit()
+
+# Load mesh
+mesh = UnitCubeMesh(16, 16, 16)
+
+# Define function spaces
+V = VectorFunctionSpace(mesh, "CG", 2)
+Q = FunctionSpace(mesh, "CG", 1)
+W = V * Q
+
+# Boundaries
+def right(x, on_boundary): return x[0] > (1.0 - DOLFIN_EPS)
+def left(x, on_boundary): return x[0] < DOLFIN_EPS
+def top_bottom(x, on_boundary):
+    return x[1] > 1.0 - DOLFIN_EPS or x[1] < DOLFIN_EPS
+
+# No-slip boundary condition for velocity
+noslip = Constant((0.0, 0.0, 0.0))
+bc0 = DirichletBC(W.sub(0), noslip, top_bottom)
+
+# Inflow boundary condition for velocity
+inflow = Expression(("-sin(x[1]*pi)", "0.0", "0.0"))
+bc1 = DirichletBC(W.sub(0), inflow, right)
+
+# Boundary condition for pressure at outflow
+zero = Constant(0)
+bc2 = DirichletBC(W.sub(1), zero, left)
+
+# Collect boundary conditions
+bcs = [bc0, bc1, bc2]
+
+# Define variational problem
+(u, p) = TrialFunctions(W)
+(v, q) = TestFunctions(W)
+f = Constant((0.0, 0.0, 0.0))
+a = inner(grad(u), grad(v))*dx + div(v)*p*dx + q*div(u)*dx
+L = inner(f, v)*dx
+
+# Form for use in constructing preconditioner matrix
+b = inner(grad(u), grad(v))*dx + p*q*dx
+
+# Assemble system
+A, bb = assemble_system(a, L, bcs)
+
+# Assemble preconditioner system
+P, btmp = assemble_system(b, L, bcs)
+
+# Create Krylov solver and AMG preconditioner
+solver = KrylovSolver(krylov_method, "amg")
+
+# Associate operator (A) and preconditioner matrix (P)
+solver.set_operators(A, P)
+
+# Solve
+U = Function(W)
+solver.solve(U.vector(), bb)
+
+# Get sub-functions
+u, p = U.split()
+
+# Save solution in VTK format
+ufile_pvd = File("velocity.pvd")
+ufile_pvd << u
+pfile_pvd = File("pressure.pvd")
+pfile_pvd << p
+
+# Plot solution
+plot(u)
+plot(p)
+interactive()
diff --git a/demo/documented/stokes-iterative/python/documentation.rst b/demo/documented/stokes-iterative/python/documentation.rst
new file mode 100644
index 0000000..274e7a5
--- /dev/null
+++ b/demo/documented/stokes-iterative/python/documentation.rst
@@ -0,0 +1,211 @@
+.. Documentation for the DOLFIN iterative Stokes demo
+
+.. _demo_pde_iterative_stokes_python_documentation:
+
+Stokes equations
+================
+
+This demo is implemented in a single Python file,
+:download:`demo_stokes-iterative.py`, which contains both the
+variational forms and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation (in
+:download:`demo_stokes-iterative.py`) of a solver for the above
+described Stokes equations. Some of the standard steps will be
+described in less detail, so before reading this, we suggest that you
+are familiarize with the :ref:`Poisson demo
+<demo_pde_poisson_python_documentation>` (for the very basics) and the
+:ref:`Mixed Poisson demo
+<demo_pde_mixed-poisson_python_documentation>` (for how to deal with
+mixed function spaces). Also, the :ref:`Navier--Stokes demo
+<demo_pde_navier_stokes_python_documentation>` illustrates how to use
+iterative solvers in a more implicit manner (typically only suitable
+for positive-definite systems of equations).
+
+The Stokes equations as formulated above result in a system of linear
+equations that is not positive-definite. Standard iterative linear
+solvers typically fail to converge for such systems. Some care must
+therefore be taken in preconditioning the systems of
+equations. Moreover, not all of the linear algebra backends support
+this. We therefore start by checking that either "PETSc" or "Epetra"
+(from Trilinos) is available. We also try to pick MINRES Krylov
+subspace method which is suitable for symmetric indefinite problems.
+If not available, costly QMR method is choosen.
+
+.. code-block:: python
+
+    from dolfin import *
+
+    # Test for PETSc or Epetra
+    if not has_linear_algebra_backend("PETSc") and not has_linear_algebra_backend("Epetra"):
+        info("DOLFIN has not been configured with Trilinos or PETSc. Exiting.")
+        exit()
+
+    if not has_krylov_solver_preconditioner("amg"):
+        info("Sorry, this demo is only available when DOLFIN is compiled with AMG "
+             "preconditioner, Hypre or ML.")
+        exit()
+
+    if has_krylov_solver_method("minres"):
+        krylov_method = "minres"
+    elif has_krylov_solver_method("tfqmr"):
+        krylov_method = "tfqmr"
+    else:
+        info("Default linear algebra backend was not compiled with MINRES or TFQMR "
+             "Krylov subspace method. Terminating.")
+        exit()
+
+Next, we define the mesh (a :py:class:`UnitCubeMesh
+<dolfin.cpp.UnitCubeMesh>`) and a :py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` composed of a
+:py:class:`VectorFunctionSpace
+<dolfin.functions.functionspace.VectorFunctionSpace>` of continuous
+piecewise quadratics and a :py:class:`FunctionSpace
+<dolfin.functions.functionspace.FunctionSpace>` of continuous
+piecewise linears. (This mixed finite element space is known as the
+Taylor--Hood elements and is a stable, standard element pair for the
+Stokes equations.)
+
+.. code-block:: python
+
+    # Load mesh
+    mesh = UnitCubeMesh(16, 16, 16)
+
+    # Define function spaces
+    V = VectorFunctionSpace(mesh, "CG", 2)
+    Q = FunctionSpace(mesh, "CG", 1)
+    W = V * Q
+
+Next, we define the boundary conditions.
+
+.. code-block:: python
+
+    # Boundaries
+    def right(x, on_boundary): return x[0] > (1.0 - DOLFIN_EPS)
+    def left(x, on_boundary): return x[0] < DOLFIN_EPS
+    def top_bottom(x, on_boundary):
+        return x[1] > 1.0 - DOLFIN_EPS or x[1] < DOLFIN_EPS
+
+    # No-slip boundary condition for velocity
+    noslip = Constant((0.0, 0.0, 0.0))
+    bc0 = DirichletBC(W.sub(0), noslip, top_bottom)
+
+    # Inflow boundary condition for velocity
+    inflow = Expression(("-sin(x[1]*pi)", "0.0", "0.0"))
+    bc1 = DirichletBC(W.sub(0), inflow, right)
+
+    # Boundary condition for pressure at outflow
+    zero = Constant(0)
+    bc2 = DirichletBC(W.sub(1), zero, left)
+
+    # Collect boundary conditions
+    bcs = [bc0, bc1, bc2]
+
+The bilinear and linear forms corresponding to the weak mixed
+formulation of the Stokes equations are defined as follows:
+
+.. code-block:: python
+
+    # Define variational problem
+    (u, p) = TrialFunctions(W)
+    (v, q) = TestFunctions(W)
+    f = Constant((0.0, 0.0, 0.0))
+    a = inner(grad(u), grad(v))*dx + div(v)*p*dx + q*div(u)*dx
+    L = inner(f, v)*dx
+
+
+We can now use the same :py:class:`TrialFunctions
+<dolfin.functions.function.TrialFunction>` and
+:py:class:`TestFunctions <dolfin.functions.function.TestFunction>` to
+define the preconditioner matrix. We first define the form
+corresponding to the expression for the preconditioner (given in the
+initial description above):
+
+.. code-block:: python
+
+    # Form for use in constructing preconditioner matrix
+    b = inner(grad(u), grad(v))*dx + p*q*dx
+
+Next, we want to assemble the matrix corresponding to the bilinear
+form and the vector corresponding to the linear form of the Stokes
+equations. Moreover, we want to apply the specified boundary
+conditions to the linear system. However, :py:func:`assembling
+<dolfin.fem.assembling.assemble>` the matrix and vector and applying a
+:py:func:`DirichletBC <dolfin.fem.bcs.DirichletBC>` separately
+will possibly result in a non-symmetric system of equations. Instead,
+we can use the :py:func:`assemble_system
+<dolfin.fem.assembling.assemble_system>` function to assemble both the
+matrix ``A``, the vector ``bb``, and apply the boundary conditions
+``bcs`` in a symmetric fashion:
+
+.. code-block:: python
+
+    # Assemble system
+    A, bb = assemble_system(a, L, bcs)
+
+We do the same for the preconditioner matrix ``P`` using the linear
+form ``L`` as a dummy form:
+
+.. code-block:: python
+
+    # Assemble preconditioner system
+    P, btmp = assemble_system(b, L, bcs)
+
+Next, we specify the iterative solver we want to use, in this case a
+:py:class:`KrylovSolver <dolfin.cpp.KrylovSolver>`. We associate the
+left-hand side matrix ``A`` and the preconditioner matrix ``P`` with
+the solver by calling :py:func:`solver.set_operators
+<dolfin.cpp.GenericLinearSolver.set_operators>`.
+
+.. code-block:: python
+
+    # Create Krylov solver and AMG preconditioner
+    solver = KrylovSolver(krylov_method, "amg")
+
+    # Associate operator (A) and preconditioner matrix (P)
+    solver.set_operators(A, P)
+
+We are now almost ready to solve the linear system of equations. It
+remains to specify a :py:class:`Vector <dolfin.cpp.Vector>` for
+storing the result. For easy manipulation later, we can define a
+:py:class:`Function <dolfin.functions.function.Function>` and use the
+vector associated with this Function. The call to
+:py:func:`solver.solve <dolfin.cpp.KrylovSolver.solve>` then looks as
+follows
+
+.. code-block:: python
+
+    # Solve
+    U = Function(W)
+    solver.solve(U.vector(), bb)
+
+Finally, we can play with the result in different ways:
+
+.. code-block:: python
+
+    # Get sub-functions
+    u, p = U.split()
+
+    # Save solution in VTK format
+    ufile_pvd = File("velocity.pvd")
+    ufile_pvd << u
+    pfile_pvd = File("pressure.pvd")
+    pfile_pvd << p
+
+    # Plot solution
+    plot(u)
+    plot(p)
+    interactive()
+
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_stokes-iterative.py
+   :start-after: # Begin demo
diff --git a/demo/documented/stokes-mini/common.txt b/demo/documented/stokes-mini/common.txt
new file mode 100644
index 0000000..0bd4a03
--- /dev/null
+++ b/demo/documented/stokes-mini/common.txt
@@ -0,0 +1,71 @@
+
+This demo illustrates how to:
+
+* Read mesh and subdomains from file
+* Use mixed function spaces
+* Use enriched function spaces
+
+The solution for :math:`u` and :math:`p` in this demo will look as follows:
+
+.. image:: ../plot_u.png
+    :scale: 75 %
+
+.. image:: ../plot_p.png
+    :scale: 75 %
+
+Equation and problem definition
+-------------------------------
+
+
+Strong formulation:
+
+.. math::
+
+	- \nabla \cdot (\nabla u + p I) &= f \quad {\rm in} \ \Omega, \\
+                	\nabla \cdot u &= 0 \quad {\rm in} \ \Omega. \\
+
+.. note::
+	The sign of the pressure has been flipped from the classical definition. This is done in order to have a symmetric (but not positive-definite) system of equations 		rather than a non-symmetric (but positive-definite) system of equations.
+
+A typical set of boundary conditions on the boundary :math:`\partial \Omega = \Gamma_{D} \cup \Gamma_{N}` can be:
+
+.. math::
+
+	u &= u_0 \quad {\rm on} \ \Gamma_{D}, \\
+	\nabla u \cdot n + p n &= g  \quad\;\; {\rm on} \ \Gamma_{N}. \\
+
+The Stokes equations can easily be formulated in a mixed variational form; that is, a form where the two variables, the velocity and the pressure, are approximated simultaneously. Using the abstract framework, we have the problem: find :math:`(u, p) \in W`, such that
+
+.. math::
+
+	a((u, p), (v, q)) = L((v, q))
+
+for all :math:`(v, q) \in W`, where
+
+.. math::
+
+	a((u, p), (v, q))
+				&= \int_{\Omega} [\nabla u \cdot \nabla v
+                 + \nabla \cdot v \ p
+                 + \nabla \cdot u \ q] \, {\rm d} x, \\
+	L((v, q))
+				&= \int_{\Omega} f \cdot v \, {\rm d} x
+    			+ \int_{\partial \Omega_N} g \cdot v \, {\rm d} s. \\
+
+The space :math:`W` should be a mixed (product) function space: :math:`W = V \times Q` such that :math:`u \in V \, {\rm and} \, q \in Q`.
+
+In this demo, we shall consider the following definitions of the input functions, the domain, and the boundaries:
+
+
+* :math:`\Omega = [0,1]\times[0, 1] \backslash {\rm dolphin}` (a unit square)
+* :math:`\Gamma_D =`
+* :math:`\Gamma_N =`
+* :math:`u_0 = (- \sin(\pi x_1), 0.0) \, {\rm for} \, x_0 = 1 \, {\rm and} \, u_0 = (0.0, 0.0)` otherwise
+* :math:`f = (0.0, 0.0)`
+* :math:`g = (0.0, 0.0)`
+
+
+
+
+
+
diff --git a/demo/documented/stokes-mini/cpp/README b/demo/documented/stokes-mini/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/documented/stokes-mini/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/documented/stokes-mini/cpp/documentation.rst b/demo/documented/stokes-mini/cpp/documentation.rst
new file mode 100644
index 0000000..f27e487
--- /dev/null
+++ b/demo/documented/stokes-mini/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the Stokes mini demo from DOLFIN.
+
+.. _demo_pde_stokes-mini_python_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/stokes-mini/dolfin_fine.xml.gz b/demo/documented/stokes-mini/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-mini/dolfin_fine_subdomains.xml.gz b/demo/documented/stokes-mini/dolfin_fine_subdomains.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..2a350b80234ffa631d882d23022732043901d2f6
GIT binary patch
literal 42459
zcmeG_dt8)d)@2!968vc`KPy2iG_UNMn-^|r@@-+JpQU0VBdx7=F}x)r$fT6ky5CZ`
z%9<C{F1G0knT07ZBDG5P6SeKr#pLoSk*hewBrwh}^PTgY=b3rmmv`Qof%$&x=Z=5C
z>&)|<=RD^*_j8_?&~;sIVgKy!pP&85k(ZNZUrNhbJ^Hr%V(aeE$M&tgzsp_cf0ucG
z=eI_@oK?L0`K6ZogGc=K=#sEE|33EFE?@p-cJkc6eQanAw_nJ${d~x7TdOypiLup|
z>zmKj#@Mdc8?1Hqh5~y_PE0F&Zcd4@pU<^li)l65YmFI}WPR)982c`Rd9(fc+8Fy!
z&Gzf%_Qo8$CCFgEthXLFSapV00C1?PwLYe`MrS`)Wj~|0n2h%8rped!_VspSjKyeg
z*rm6WR@rUg`s?3@+FA`3SfeJ_){tUoZ8~JImFsQhTzk{e82hz?s@4mk_DgkkOR~WN
z2<7G4uQV=dy>_|4-Wp^!AGKOyYElgLQrJwh-fD`m)#$C~lMNXF(bj0uw|rY=uPN8J
zUeMX=4E6xKO@A%La2~#`8hWvIWNNFuOqW-7{DpG^8}sXXr=D$EQPK2P<ja-`iCNhN
z-+n&%ViJ7Q@L5sr=PU0IIv4%U+PwM;``N&^BGVVdJcS=E$URnirpe^|*dY1XB0hdO
zZA{GX%76T6<!fUyqcX>(eKOy8(zL$m4<W(PF)!wrcC#nLOF5=e`fNdt=^Q>~eDVqm
zG|`6(b4=Zv*@uhZ!w2v&I%Y|ZDS|y2mYy+9gr}HUTXY96n?FeVkF4&wx`RXRtE~Qc
zS;nQkbval2L=8{(^vO0dCCae0{KrK#riqfL2>k4)x~btCul8M$acSGB3r7Gjz{jVC
z?Y*`=bL73RVFnw==6e4W!`3Jtc_R1HRgSgIbim@+5`QwpA53{DeP}@L@vXXps^8jA
z!#DGOKG0zP;1G~P`IH8Pn)h={T}@s2(kw>1;An%^)0({Phf}6hPkaclTEsW+oN6C)
z{(|*%)O$zYC=VA;x}oO}B~N8ow50syMELomd>8r^W&t7Rs&kt7T6d5mw8l8=NbvBQ
zdvgHCP(h3*oB3Qgg~mI?G0i(z&Ng8WxoZBv63Guwe2QDk<p44+MFWZtuSjV5>U7be
zFhC2Rt(&fz2>+VePRkG7k{CW(|Dk{rJhAy|2!J4lXnvLL-nbAbnCGCJ&H=tyfIPj@
zaRQdHirL6GmmLHPE{qE>;&};p_MaOq?At0kuuzrQ`=#1uA|W1s!IuuEFmf~;)9@7d
zP&j+>wG&dtrQ({RMavgit*2*aY|TA5XKl*S@~rc<!G%$_Zvsy=*jmDuud;6HyQSvt
zMqS;g@Utc6ul`w7lw0%b#(B#Yt_d#Fmu$XRex>?OW43*DPFe0hO8O)Yw0AbHkNGsy
zWG*)jH&k!Hk<l@$b94>U%@0S6E)9$uAA8T>yZ&=k-}nFUwRzx{;I4mp{E679gHKO=
z=g(j7e)sEHzgRY9#o)ZvgOiOt&W?NH<Hw(l-8p#bwA2mLQq#631%&Ns{CH2}fA?87
zrDAZe8SfnY{l#h9^A@i<9G8D|t1fJM<-YvPo-?~PwY1*3X~Ud=I#br8;ZvUN3dr_-
z{cK!*=EGO|{XBhj-!0|(^`=f`Fk;^5pz*JUoh|9p?YBJ>X<QSI+Y-><(Cf;gd0p}o
zwjb^VTP%<5e*}J8p9`o;k2QDdyAhxVN3;MYJ)a#~5@-)R5;*>kVP|W`mIjW0hyVT)
z0$$ehAbj6^$CZBX&s-gK_0B~b=VV0~zW%iE`J{mUCwpD_$<n9Su#&(N3qxLyn+PkX
zM|ar)z~`MEH~+KSBSss}mRyeb#j>6&V9Xf+mW^ZcGp8&dWEW1%KRT-O>0u=yDH(Ss
zr>1P(QHj{rjq7p%CYPr6yk|I!Z%DXn1pW?R)=>ZIM#F)A`o*_Khra%2TrV>Cjcxe*
zO1}qZ17&Kyc<34Yt-DfvsOoaRD@cUL4<&4`C$Ps35!i0wgz_<*x+P$TiN1ckh)^y7
z6yHwkx~yepKtz|Xa^|eH0O~u#0n0U40OPIwt&3MR($xMoPS)1%U$gO#ZtV?wi0E?n
zpXq?Q3}AG8_LpqyZ)eih?|+i8f9Od(`{$D?XV3fb2x1pF{vMoAx%suRFvPU3Z+i2m
zft`MZbg=as`5bHxDBl~GD39H77yKToe`mVw!M|E3J-d8(w<28h?6}AOc6-|Q=4m5;
zIA1>YqrVZ@(Fk_iy73YC`$Xp3S%k=HMC3}p33D0b9S;!lgEkTJlVI>nTeQX8_s*vL
zC4dh+fJoTQ)pxHL0XWsAG<1uCv2~`1<!@|5P}VP&{aA)8>Rw)pADGO>b%{F$0@(D7
zfV`9IVby3u<_sDWIDYbgvlmX}tr(F!^Xxe3XUz})%rU~LKu%l*cE-l!#sm>a{&}6L
zJeEL%q`;y_x9%9YgwO$zK{)05XpSHMASr<1qyP-m2ZWIA+3xZ)0pF$rrrq1VIkcpk
z2107{kW4mCCI*Pfu_|^RAp;`D2rS#cqPiJTn+k@q&!TK;eZ9t!2*y;)TomxAO+y%r
znn)SN)i)?6qZASw5wV-+?q!67GsFk6alQ(2uqyG>dedMNotYR_hlif_eV-L0q+BCE
zq&7=v;Sbv8yY;EZLFXa&o$DcGE$xkR+Sf#_AU@O&Uy%trU%NFkDn0r8?TpK9k<0Nj
z6qUkp$W3NzU?qK(5s=Jw2m&yQ092LSOC&Q^_aK2P7hlB$v001e{a8kjJ>b<gWDqoD
z@{<+u*yJDX@Orm07+eNXyG;IJSa-QxdPF=KI7A6Gz{&MrFj~nZPkT2GZ6I3}bo91w
zh?Fv+bH{tCf)D)riWmH=0z+(pX(YxLXvAG>HrZa#RJL6{>Z<kQfu@abFiqE<ZM8&P
zl0fYsW?WXwjn#dDe?yi9GWAZDAy8NbZV37o;$edu7FcX<HM{y2q(ztuqY_UBNS%Up
zrn-^{4a(+%tV*UcRi`yx`y{|=aM~p%S8O}NKxt3b-~guPQkZUV0i#^Hvbqd#zG*rD
z{CibG!ZyspG%NEt@LaTHuY=^0?U-paMn3dMqb#eXwnL^JG`A-cEjn4*sdzM5K@ulw
z9Z<I5=Y#^)rT&s3Gf3$B0HN=16Asj^TufSC<7OlMQHPjB*2=#n-e;#lfV`nsv_6DD
z%TAiHNr)Dkc&_A8nV8r%)P>Xw`Do`Jg-g<g<06>}?!d9qREU25SypHXyjw-pU`W+e
z`5IHqrLU@DBKKsOv}0JY?Hl3-g}(QmpKrJW0K<Tc8g=D9764>|D^8!VAZ>GbMYM2@
zV!VG4M*?n*jDEoA)^>6slLo@c2fU(0%mbcKSI0LjS{NHa)<Y663B9aPt#Zy+>=H$Q
z!Zs7rcV6fT^=N`g7HZ-4V59K6m`rsPEz}Jk_G#=2x;`i(AgyJro<*7v8)W$AA+@15
zI$)?v2CC?$c2E?JVS3wmxIGlT@zKJJk@0~J#vmBSm?=v4UUe(vMMC`(Dp7zs+bhIM
z>Ig=Y!zy?A&=t3=l<7_nR1_1gTs7g+in<k2h4HZ!T|Wq((J0Je5i|S5@l`t?Bu-Me
zmMiUf1jP=vgMKPMU*^}e8!c2LKOA~dCm}vlPo3Kx)yo*7?LH}!+D_j|Wv}h#Wu`)c
zeW=+wDC<02@(o(x6OC%)CE+K`UFygK#Rp88u;5$f`nOw^6Gq;|9;#}^j~3?p-NoKQ
z)!)q20zW7*W89Pvt4sg8b9hBvL4I|t#d?qJa9tgH>IYB3pWtT$;ORH)X(&9Uu%{95
zw2M8BhNm;^DH@&v_Th{P@H7gZW=-$4_~Fh$6+O3@S3Murf6UVjJBJPF`rW40!3$<S
z(WU&Z!uiMJ#;1MA1~xtnSnSK5vVG9<QyVwD-epqBy3hAKxO9HE#QiWe_UVT0J%07>
z>VO5uPFWA{%kKF;4I4ni=Dxs&?Rb(_SoAJi;m2=jg`Kp*;9s*9dVV};`N=iUOe)EI
z<jWT`=FEKJ*mpGS6B@RYhMoK?t+13<`1?zQ$Q)Xs$7Z&|v9otY&VTIKht=cmo%%>j
z{+<WFe3=lLN5h_=VINh{3TJ7BibohCZx_%CM`(o!uXGF9-+u{ibjRk<`02f-jv|U2
zqG8oEY-BPal13}k(h6@@(F%52q1R}ndI@gy&J#gHhji_~h2cBDhK2?1Vl@B#Xrjnh
zw8HSGO6<R}oS6k{pN4N{!14W)k2r>)COic+o3NPC>>>dgM1Y<f!vLK;PJre<#SZV8
zC4}l0LbaZ7I97)=dvq7jtk+ni*@UG;v-fD&psftmk1o*)Q)q>E#}duHqZRhi3SYj8
zG|NMpt=ft->lHyX`v(m>NyGLpBSZ>lg|BFZH?PtPDYU}rh|ZyBiXTrKSbd@5*6@n_
zZ1yAg1>^07^Go9r-!JOju(QXI)OVVmI=t?YJr`puB0L$eFZ*<5*X1WSHl3ge^nc*+
zKOvmY_q@M9r4w@a2MB)HkU{lZUqj(ws~(Sw18hKwrn0sCp!~G@zhH*^>>0pr=?M|l
zvG-0Nfj=4tGd7Gb+s!DR6qbifd}_^xLdKA82N1^wRh+K;LWP6d!TkR^P(Ac-n28!{
zLg_7D^V|sbG>M?MgG^{Zg}U*Ba;H!8vqvfUegNnD&7AL(1>Zk`iWvA_dw_)R*#x=f
zZpVQ#{<^tA<yAx&Dv!v_;_*rMs~N)DN-e7yumBD-a=zh3W8oPZR~q!Fni&nB-q>11
zmNsX%s>Kxxm43GojCAJb`%_+Fe4w>_@PaWDRdwCKy)^ezwDckSb)ThFzC?z-W&rag
zls>@Z1o8!huIP>089Zh2dnS1Ui#MVNk=eAn>BPC+!x-P16Qqv9sf<sujd>jUUd3<j
zaV%bcOzLBR|1(kH|D>?R4e@2o<Pk00ScpSV7KXD$M^CI|`1Y8bU?gez^x|yp8_{Ii
z?YLPL5z_z1-g_cj_J1KPjupiBr88-%`rsj{sogp4UPLU$S*E4c)fdt3TM{@%YKmHD
zMx_ka4wZOZk@F{})zPl_VOqY5ORVC|`Nb1+HN3Rifp5utxrOV|lWeo;Stpo+c7=xE
zAu)<Ejc^aQw|-n?3Q=XkhTEnvk~b7{+RNl=-RE04=7Oi#p-YhCJSArFWo5*{SdAE5
zAV)6jBhPfcisz0lE}c7ZW*gsDws!2S=p5G`a6tWx`mN3RL{QGUA;kuE&cFrcM9wSC
z3a%Dho{>##T|3|%h9rtGm%UQj<ADMavT3)HaMj6<rD@%UbW7}fx!lQjzotAa6t>-R
zVA<iLc}<To>VsxEZ+tL_O#`Ow&*dYUg$}LHg;l*&8g~Z-6Px=f#>AJcWd^4vVlRCI
z@|I$_l}%))&Nm!1>Ma^K)ciIJL$)v^z%wIkFmh&8#SPfkPoThI6z9xWdNIj}OmJ$-
zwX(otZSI3if>CiKkrY{n3}UKSXv&;4PI?FqnX=(W5VF@v;zWeshFt(?vi=tGAER^9
zQ92yXY~z=5Z>25UHwA2GJD1_>Qs-&}SB$j^V)*fMGqYUB4@;pz*EDnbstVoCVYy7@
zGc6P~RLx{Lb|@rE3o|+vP(j2v-l#DJS?HXZEsW~K)U{Bq3Ov$}$_T&a<HN+sjRW3n
zOK!BVk&KsBt!AuJx2Y-}G#t1_=$SwaDDK1`R$}Ho7fA||!eV%^Z6->@mpSBx(96$8
z*>g@MH9*Fd3%HO3t|7dMuv@0Z0fOjyk(6nJ0BI&<Hp;kmXOH@=g!OTzT!SjW(GgPR
zP^GfS-V>D3L~*;vIc}})1FbVrUqKuV<5`)u^@dP#ghTeDO5F}hn(tfcS-7&lYK$vX
z2ihl2S`D$$&X#Z#nVXaruTBh^-PX*(AWx8`BTm)A-i_!3lOwqn)kC@`zKs2tOok&a
zgOud-#;2K8$<NLe%+7Q><eqjh;p8A7DP>kVF*H*l?4IvaoEF-2TB`#)rK!jlv_auU
zcykyZbxW5x*Gx1Wb}o&1T5ia#z+d=T3<oDTho2<Z<)ykLo0_wNxd9bQqqh-F?u8tV
z*ty(+66!_O+d>(j<9A_#)K^fWty{FzCbjY6NMnE{kRFKO7l%SfA1>iYA<xPq0>z&V
zUd++YZcE&s6vloSgyIk5fq1xZrY3S(&<R<<shEe&;j%ze$ugm(O7~sZY-VeTb5gL9
z=Vlreq=`1>`6S`|%k>hAREQ)#5pp78yLTp#L?NdW6RhqzPbu^`GCrNPPZ+=0dmE{y
zE`7pS-~qwr<Q@<v8jza{1UEDN0h%2s%8Wy@Fb*R6Mi5w~sA2*^L_!fS*3vwl9|zm1
zmg}fS9>p1QfoJ-aZO}I&L?rQv2oVu|B0_X>J`o{0YoCaalsnXQx%!zYG`de1Yh^}Q
zo?&~@(+x@WtAp!JLuNMYgpc&qK74}ea{X2)63;hck@#dKRRNoL6)=VBjDP`_p<y8I
zeZG;ZfN8r}Nwk6rh&c7+8km^*$o>>8c)A`2M(=fZD?q^$;E%hvA_5DZ`@KX&zCy_U
z9k7G#J?dG(Q-ZI280usksJT^pXuZxj2lj>t)&+R56Ex=I+tP}!jnsmQ?2aPSZCb;C
z6WtR5sRdQ+la<&z;C3g-u&&P=sdWRgMS6nee$ek(F9l$U8B#--_o>=&kR?aJOyHLo
z9<1Y5A)Gruh3W%zdoEf+Ut@)9QfbbzGbB}I85fUK-sp)`^>#W{3BEI<eo$b(Jvat5
z#5V-3YFA2&m*}4b%kq4l`xcJ89k4joR^|L}h?~uwpVST9E21P7)u~xChV}rmoQUBJ
z5k9ys;d*`uzH_X2g~#*QP2F@e*6?HX|MCQ(lW4sx_yy&iSMbX{b6FTLi97eBxYu9F
z<6<@k;{^2qPDTAaO_*0km27pl6s%2w;Z{jvMV*ouw=O|s)w$5=Kq{(8YDqhc5VcV9
z!s+#c@;t$MqtPlU3~R+$JOgGXmY3IzOXGM|c}QvwHv-xND70j($|iUeYC?I}wt`ob
zYhRS{o-@@;>v~|R9cE3n*n%MxE0lt(td>l4QBzT~s(w(OTh1GeR%<q}(x<e=G>9vC
zR_?`Yz9@%@Vwal%PG6rUc*Lq&=@Sea{Gi;mkNL^YqEdC&LZ(YGO&O}x_wH)FaTy}W
z6=HxO+SYs_r|zqIIh5Xg$o3sB5fWw5bdv&5(A0Y|$B2lC=o1q}`pOHtrS3nnOtbgN
z2{i@AGR;hTdSw1p?KDS{6>B=oSn*|(LAlFXtK~&q=!${vM}F5JS1`Dvwy9r#m~{;C
znlSh)#RlrbgI=S*f=2;eO&|bT#WomN#Hqm>fRyz(_bohXPRKg!G0LOUZ_^dTyMuye
z0LMWm1-3qXM(j*|amrHQMp>6+;{MvVsPkOZL`A)pDyN>7rA3`p(at7-v0X`uzr3OW
zf!H}c^~+(;mS#UmW8V8TOEjtRHYjl>*sNybj-|rERFAb19j$A87RoG9Fgdvwa}->t
zfn+1e(6$2<(24#!QHqtfHaSTsNDbS*HjJ8>M6;LZ2NRtw>ZfsvAD#pxZ>p3pDaM_0
z1I}3%j?P$5Ra|Hl)sbur+{+)RcD(M9En%)|#&H?cv@PaJN@SjAG1oX2bUb{@OU_(9
zOPVr|e<#<gF62#~^*cV<Wm}$*6~V_mZjd$a1TRSaA9-?1^a-=*5ZQ+)<`6N>=tCwO
z3KnHWAVxZni|}OLA(+5#D=B|#_BbIZ-jG>T(o8jR<v!%u1nfz)Z}<~KUeH;PPAD{L
zsP=iUkGwcuwTNXU+hJf(K;*C#EwQR<RxBjsG%3u0DL-f&%F@**Q|M5~tH5hM<ppFA
z<}}e(L}MPCR*jk@yrN;iF&9N<XtH6=WiYOaq)mY1K3<P`Wdw|?AP`Fz11BdiBzF#D
zJ7nDov^sZMK&)t{TwpwDK66`5=G$<X7-e&*l>eFa1P2SMENcElc!i>uS!h7D!4kyM
z(|*Hft?i;|o&L#;?<!M+T&Q~K4n*q(?+;nKNG1D$E~M<>TsS_3U8&$CcE=@9-VDn6
zk(*fiy@SN+`*cApnKolOrK2hAmBoV>S~^38FX*M<^p+RxhwEmrYshhM4cV7ZGaH+_
z-}E)f8?{u8m0(trXZM-i7VkBS;n*PH<B~Vt>j78MbqQLt4v&^rt>qwc<bBvM;n7^>
zj+4T$TrA14Zebr_1nr`JOf#GVEY_;q&8v889@U<mPSkK_BD~SxU@oX)m}}qM5Beb3
zg(!!^yhQaflt+m^S>rV-JF1s+tJVGh_1_3o%}U;6&~Bo!)H|J_!a)`0#Jh4uhtH61
zElc=+&qXim$j}l)uC=%b&0T)rFbYq-Ar|;%vbz>eN#Yj-HLSWT??h&I(UjiYpx9l<
zyya?*y%-)OQy^6+A`wp_5U6aby7OATnR)>Sm4)|Qp{hT90xBsiS+4#?(HL*31*Cgf
zS?1+xNpehH5w00ZrD+kZcp(`W7Ew7{#?I==LTyR7`9ZZaEKrb*Czas!3~I8Z%9A|4
zPymv2_})mMpsxt8@jCm8ye=n0i-o-2OraPOE=4N~=eZL1gVLfECQdK&bmUrgy&cO0
z-?uwbl*OXXd)~NA(~LnKJ5eV%<vRdC)z%y7POTS0<&rZL$p}py3nGBk3#kaSx4xX8
z9V8(TVkiB-n<Ri1lK)1aN-dm->`e+}=(Jxbpr9+5HhL9B2*q8BnnwG4Y#){=ZzNFs
z0<rXNC2?%2yP`6veHV3UMqnoC{t~gvY^ltF!+3;L4wMV@MQ@NMSj_8yn*M}J;eiUB
zRFKswQn0e5<zCgd1;~U1l~1S#ISkFk$ldi#t=NYgMpuSqq3<q!g@D~Uc3v5#0yXwj
zySa5N*{N2wS;hgHE<BSZmD{tLlSHMbt#Z6E?kTt7uv`x~Og2feGahR)S!%cQBeTJ*
z-NJ3pucEBr+U+-Yu$NI1QEIj^c*I!oW#Qnd$l5JDyf+M8cZw^=ynIZh5?0%3_bp(X
zKJJUn)4K2L)cr`-+~>FH8)n~k_V?po=y4@OpY>m*j~c&D-gsrwqi?VOYTN6wTa}mx
z@Zq&WKPcxLXSCSqCMG+0Mwk?;lf2+Gl==3c|M?XIvv|QNl`x@mPkR7S5;HHJ)I2@N
z=l{z<)!Xy44b~a_Eg^b&k<{UTM|+{sXUX2jCJO<X&(QvohctHfgYv+Fu4}rsq0rt5
z>W2C~v*F_L%CPQ<`}6WH1{W7+!z+W&%xLVc)0M%!<jX_MZ{+38Ex`%aBWGCs_<CGM
z&1H69d1aWP;o63w%TK{HUCZ^jUlh)VY2oP%99>hzyQbmr%4J`bDB*sB>kGGFKE1g~
z3$L>CRfV$HhZmXs<nrK*o%g;wPA>i4mDnwq>$rGa8b^7BH5($i9Y_`J*Wxw;#a{7c
zq8(cV%F<*I230=H1o$x2?r<xwGd%NMgYgpIwLOpVyr)rShZK%JMhEwKVc|4tx)`$r
zN)m_ak&Q>;o=?~+DQq%eV_hP7<Cf^f7QrzNz*u-2qX5VP3%Q{7#o{GMsj^@Pl0=da
zn8mTa3xbyTE;JkCyMS?v?^xm~-?0Q8n=HCj4^$QTBn8i*zwg6DgoHO-q$|`5$nuPs
zPuPlI6t+uW?XLX>Yv6J10nT{%Mk@IEvGP^}VMgO7Jwaam)$i?#f3Twu`>P$ET_SE%
z^%Zqv>LKe`2~wt~{Gc?O-Tk!k+Dh_!!!eTg>av^0_`+S`x(k<`>K^<mvg-llD54+7
zi;mK)gTit2$ng3>d655-r2PG4cUNiz9!7^*8pzVCS3w+vvo5@R;oZ9#;Oz9F3Ep4A
zP{;yCFMd#N-yY+*ujZ$fJ6e^-6=S$xE_rjVj)$!L!sPTuQO=?pXGvjh29U+YP>3eT
zEU<#1J&NT0pfqwLDiNrk?Cz>_NnusM<g(&bGEdmhOK(Bvi}&b)%4KiIbu++OyrKzO
zWkGp-?jp3u;*}qi=dVuj)5;yKr~oTVTV{z~9<KAPB31tYyU7|~=4OC1l}!^oDW7RI
z_Oo1-AC%*-@AzreQD(p@Y)fajYio}`1b<LiQD^l@*_JA9_>y5A{N31&y++x2H#OLY
zuTX}LNngG8I2~Tr;Hx)S`^n|O89Q%Lcbr`I1PhiNrJ0>}7HLJ5*O}P4kqUIq5X4{i
z^(ecBIsBWn?n^aTnXli@B5iz`w6=%-`3+Q{b9Pnx>%Q)i9?rbnO<MPjXD@5EeIa=%
zuKH`9#bsPx-o@7|s$b`ou$L$AZ+4%sV3+*;pj-t1^18mCR-VL_O<B_$n+=w8xwfBj
zVyt#^sIBE(p22o0%WgSSWwYfS*Xvr%cAL%kUX}f-KEraYT;H0}+WQ|%FP^gn1l{t#
D$Qv7;

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-mini/plot_p.png b/demo/documented/stokes-mini/plot_p.png
new file mode 100644
index 0000000000000000000000000000000000000000..0a65a9de9df03d76ccf4694485b686bda83f4e2a
GIT binary patch
literal 56331
zcmeEt<9lRJ)NRMM-LY+}V;d7=Voz+__Cym-Y}=DeoQZAQx%u7uy#K-d_<rg>{nY8+
zy=(1NRr{<JsjMi41dk670059=q(Q0x0Jt^)0G0p?{`JYbR^&7Q00hW@MAbcV&bmBP
zD71VJU*FdW5;HZ{7ov61t>H)~l9bt-!_m@e^XslXY)vN#2m}ZFY_VY`>$KNUP-61%
zSb_)1Y-@EO{Y*TCj93ttVMuj?jctWv%!&EIzcGjb<$jkeoM_f8XryMMJwAH-uX&T(
zgCsS%|DIH9eh5)(<l=d<lR3}44?A>GkSSwIsHEr&<s4!B-**_1@CAi5QEYQ%sB}?<
zH0-hed-=cF`2Plm@qxfTBauYA)#j$Wu9J#NOTHSPefqgRez&vbZr|5X90ML<;U25G
zU(w9nPgyqAygpA?PCnctsb`@4fG=1&BYJEj7;2|c20V5i3MNk*_*@TZ={XJUJzV-;
zdgnh+S{xi4R50eh?NR4{+?Aq)58O@*f6mG=ueUgCrgz_!X!X1-{5SM-o8)8r?RMJ#
zXrn(e2($;v4=$vkM$-B`@9eo<DP_oCW>@(o3c@k)*tTm~cjE}ozmBnZyEpv2KX2Le
z>x04pEO)qHwjJj26C!VZemn}l{+p&E1DNY{zwI;oAM$T{evR=t{kA!N`&Qr!F+$V?
zizRXVYqryBx&k}zY|Zy^eaX=OT`lhhvnB|zag)}<z{J#jtl;1^<&vj{G*N%HVpFr;
zU@<Kv{4x{oduBTAd*Pz=_gP5&t1idoZ(n+lgjm4<;GyRybXiazXVV{(ypQ$iT~#YL
z@t;refV{8#C?NY?M;pG)#QWX-%C_el7JK^6cavc{`nhmDp-HNqqO%?QX=A@|XoDpn
zJ5M7}u47=}xB0s9m@y)7pyhwBRT=xZ<}y7TOVDD!&d2-Fc{>GBYqM0n>mD_NfF&m3
z+3NIXQ=*R?mc+QW&M16Q;$|j0Sj*q~qp7D_*F*KD0L9nx^W%L<&m|TG(#!39#dV7J
z@JHNcy*WaFp!Wk|=`DZUe}6_s{<o(Z5aK6g_<hykeH;Vq7S92Ub5sSyJ%t2l<2ugW
zcBS#S#s9VC+v@AP-=Q3IFc{!~T>o2c$bWZ_^^y4hS`>&h`OXI3Yc3bR!Zf9hTq={!
zDnb?xu#75IukeQjRKLu>X;@?C*}lDRe!jbR-{#WSbULrMyHY>Mn>p&4hUCJieI<l*
zBwP4fsSUhbN>}-9Xu7yob4w{R>fi_79Mcipq_FhQgcI>H?7SbH@8=HO!<}~}%z`u2
z^;F7Vw_;3^ysI&Kr+n<*@*w?2KTHOl+b%BlEABFDhok3x&%{;u6OJKuwsJhruD%G|
ze7|rPzAsnOcl&2P*B{sr_C>OUS|3jcr?4t}u;!#cSC%rzV;<$<MX&*bO)y3~lvEG^
zx5``*aRx0kmJ=TBQh4~lfJ$M(&lT!Q6%S{}^QI+m=}IcPswR4R`rI0P<ZuA7-@@I0
zk%gxSzlf0o)GGDWf!P=UEomZ;X!2DjVdikg(^|Q#7$|@n(bO!LGX-OgbHoF#NI<2K
zpnt0McGh8UAcX%lj=$541kU^0^yk}NLutO>OJnC>-`5AQqpB*Ne=1+!Z#u?lXkZ9+
z2NF?tXFX%7+o56(H&+QgTKSDqxs+7i#DX=ijS^oNu?h*2N(8672F$_0if{}Os<#}C
z4d;J8=QA@hcAc3s7ggJqHB9lHe!O08)|rkJFWvEPJ|hRPPYc{G=fxw&oqxmyP)*Q`
z*B#y)>PN&WkaAR&0oDE5x4phWR7gx6I7)O3AVfAANMao4UXkI;1pD^&cyTx{XOS-V
zkQh0mq+&_i6{*DbbH=$`<X-w59+&2SOj-yvxb&8!8@w#k_}zDX5d*>I)9|7i$?Nh6
zK;T$L$!m1_rnP8-g?1ceQo~T+W1SJ9ro(*uq=pF=2uTVnEg}R%X)j|xyjgG(_QS^~
z^}O!^7}*G`;sp_!n+&Csvg>#X%!2?FI(|a}gX~8QlveK>BOQA^nSZDh>e3BY-5+$`
zjpe>ruG^Jh_L^xl>BH&Vg39K0@Vm|4eETY(vKu*;Th}H1$L`0j%NX{l*0cJFx8X1P
zbX`fICbveT8&|mwH(V8&!6qZC!7zi=SYyJKYKomlzR@_&nsI^;5E-j=Tzc3V#$bkt
zDkw%t4ptO)fG<U#?i317S&7KG0JqDI0S7Qq9pL85DMD|2JhU8oeiY(#S*`^9{?_96
zwoB6U^^;6JZ#Q2RbCV>;q@%6<w1d;*ahU6Fzg)Zha$1xB>nAnm%dSR>y@BV1q_z6h
zvzZbpN!e|11dBd$$!sfJPoeYxEq;Evgp)w^Z$`1-`d0D@Nm|YEvnHy@<>z|20&~O2
zs)6#*co+`@=3UQC`FTCMM8!7oHU96XpZ@`G?NG@5J|x}nrNr>%fV;=@3+)>}<`nYZ
z&n$9XEb@IHE<Zmm4L$c$M+8J*1L7TGYUdCtPSNOO|Il~0N19kNhP=aKa{jH1V08tt
zF#bU46R76ad?bL@m~Y-z)gMe>(M9Tz>)%ulqv}#2Vm=OPrz4B2H`b&tcU>W-czzB0
ztkNwb%)AL6;S@{P-?)y}idN2aHF#K1qthsA{DpFrmh$9C02aW?xXPds_RDqI`jVG#
z&5;SZjsr5naiH^bbikI_+F6ABx}gZ@)bAz_oxy|PN>A40?l;J^ag<~&p)*k?Q8r1&
z{CtvD=99DmW)wugp^zEUbpL*p0+M5ml9=ElWbR9K9hTX@v$Y}JYC=_bm;NI)@0G$M
zS6bT+tFRKsD94VuJ2$w+M5khQ!38p`kt}egSPYUV6DylU{XBdm5v70*fCYnQ6X;ce
z4gRNfoIED>of=)`ZbQ*jxkIvqG<;u{Aq%h^m@v8xn*O_|IPhCnID2saq*QaEzo>Dz
z!Zvqoi6tC=uqd1eq>hkE5_WA!q(yorD6U^LE`PIgX?Jgx2MvfI1wo=g-*e-M1C3hq
zjYpUHJ`Nk?DE4Y8#(oBvqK@K9|H#CqS7De#_YwhoV?-52EypmUadLj)pSO)#ulP|T
zSg4-6j52M8Z8^b-pQIcABZg%Xpch?fphr)Q^96X6Z+?dl4G~5`$5d4FTYXO}Fla#;
z3HaoWj^x$0LL>xLh^;FJay}W5DMfVVznts90g+GoO;y}X=I#14$7y_+IF<L=!HN3;
zy_BwZjI)y&3;R|4e9JkwR9JOI(7^=Ln$wjkWmWyUwXhnnso@0a{*Sgbc2r*c)J=a0
zA`GfKJD*wYDKvVOa^zu+M{lc$ozX~~iD;`DSwJ6Iy3zskVklXWy~gI6;6l1O`)!Tu
z1)`SE5$mArV&?<>pK22IHYR0zwJs|elSSo-pan5=d>c{N1<ncqd5;wwVsq(w-Ww+6
z&0tD`1T<r^Alyq#D6~P?Ku}1;;NWt8dGtCMtgW<JruK$l^D52Bh>&TcHJWUI@(}{v
zMpIVjvOD(u)a*gE8a-3@-^1S_F6C448BhUZTY5!Q{;p=K)p4`7cMiPW&2#2i526a;
z?=(z$`^NG7-3YgCh1dno&bI{l{OQt&GU|OR&v=tUuxK};1I)Usp@@zH)<4Qy*x{81
zXirW@qMOw?4ie#$w4QzND0GU3LAP-t0R%1Mbj8GJ-L+QuR7A@mNe@hxHZ}p&^{O^h
z1j|1JIqmX}95WT`5DZHt3ucGLH<x!kTiZ6zv`geem3e7BZ-jF%@0mYBNynfw)J1DO
z(to9(--;zC!Sx$KWP-@M+#AuGIi9GEwaVeCh-ZHK#}cYIUH=>8g6EH4S)A|x+Xk&5
zQ+PChcwn7nNN2>2R})QMQeaG^%hQyO2vobT5#(}Raid)K_`<G?IxN;c%x=1{%Xaa{
z^J_VL5XK+!-skWjbR@=NNwjUF;K!8ySjZ%*9u9QlwWvll)0NcFCV6MlVJ^g`J4L>3
z!thcbJ4qXsLZ6_M##t|sbnHcwwwKSHInzM&N0+-095$Ar2z5qv-6|;3dE5eL^eZ{;
zPfR>g^6$C#2Fj*`jJ)uI{KhYmppXIh07%qCG%&Pu6Ij^yA(I<PmUMi^n(*)-MrpF4
zBzak&sE;ocn5Qt(tBSr87-|HsG`UG+JL|$$nbLKL4-LyHSechy_+p;1Q_1``-Zb|_
zatr#Wc$HMuu&V346~(k-^jl~bQ7D<L&qOi8Dh)NtR}I-@89t3fM=ax#qO+Mu$6$T_
zRp+K>`%ZFln`UTtp4b~1s6>WErjD$dj2n7IhC}X?dfBMGqYfMUTQEPBaQGFxT#osq
z6<B1xvC!A^9Y>9+D~!XIU#w6S);xmtqu`Hd0Dbb#$U(puPGLcg+9?#ZMR**lk;Sb&
zN$OdWI468+%1{q~HTHIY@;qln4#nHqroPx7RQv!Dd6ODPC1oues^?(SlT%@k3Q_P>
z+qlh&bAl!>bHOnp)bAt{8Njm9ET;_x0Ni$Q*&sV<)*4$)3mzXMBtecjr0zR;+##->
zEgUJ;jt_?7l3R4T24S&OBTlIx`;2^(smQK~g2dOv&@Bd`R@kWPh`-%^zO@1U!eF~`
z`?v$)81=;FWr1NKpb+{ZIkDV8kx``%p-&6|S`}qJgf&|d`X9V*XYIv>izFVV2Htu+
zkG<3}8>ymWe3z@*m$YK^uuyS|5-*{B2>_-zu$`MW!z}iC7`-E`SfRsAK@M!7puBSZ
zU&t1kg0D4xd1qo|mSB0roXz=yc}11zJem3;r0{*>=bxHB1D(KUXpHp&dC7>awDA?P
zNh9f-dv%=<5ZML|#Wtz8Y4tczp{t0(>cY|v^9BAz+ud+A0<sP-Ko-F!8wK|FP}Ue{
zEf<em<sdfrxKok4{5|)?+xr&29TF_loFaLR7j7y;q^KK@^f$`j*j#xnogciyGE|CU
zd^ZxM-;43Trl|M-5g^8x=|{dHklbu}4>%Bs?bT7cjaHHYw01@v+_QQq!$r>y4)>#G
z5z@vr3DoeTg+<37=YWSdt*t$CO!JzyDDf8nM_;d?WSr@zv$ljaM@yp{3?X2DKaEdf
zve1s*Q~f0YGw}XPhMP7dBjI;ktUkNw>Poh1>2hHzXVx7otP~c2%)#SiT;)vOGo#`2
zVD}_r?QJm5Uj77MLlJ=Uw%H>eHpYU78dCKr9!98m-A3RF-}9I-jPvcL9_R$-@tF>V
zi{NP!*Hx4vy+f2#aqMateU74K6@i+lED4$DI3^vC!O+ws0$fc_SRE^e(o|d34{<yY
zQ?sj%pr@ROkS|+vH|L>47jM9*=xV(0$wgL`QM`y)Z{(%;nD=tyK*yb0oOdYLwR4x?
z!`g=|6e}YXp7MQ7R+#UBzs7J^g+XP6R>uy}s$N`UERjYAOcpR&DAR#;629P))9?uO
zciZ^>1jZW6F&d=>WzV~{%S!`yjA&>F%cj^OVHe3vOy+CZ``Ee%Q^g>e2j&R_tj0y{
zDD4I0@3{R^>OL*nktNk+>ES^4XNhZ)^G+ySFsLg*a^9T)k3X?4HCjc=IuKuHq>*5k
zk3D~Ca<e4Zv~ZC{;P-Y&nJVfJOL>|3{um1F1VEr1D;K^&Urx->IY4I<jH9B!(08nZ
zgqG7ah)<S91`gG94Cx=Yw9PO=@N_cbvn2b%Sn~;L#W|Int|<Y>q;}6ALu~2MbW#NH
zV)BF;io~23S+c|~&BNKdsuhCD-<3a1vfbdN@VlZ2#hR3L2);r>!LsOiwgTo4uu%=L
zfDf=tN_HB~<8rm3q4B3bcjA&!v0+v~<Hf}mXiG^CXD9WeQ~Tb?WJ8LhVhGri&S9b^
z0+}dK^HIp{)ukW@VntAScx2K_15jZZW;_($V)UKZB0Fvv|HPEvsDMtu7Gy?lx$kYh
zB|yorOi>-X*>b7Zb}WLIt7Hh!SITXL6fctVPx}SQBF{~d+{e)YqCO&pAh5*tGh7xq
zr-A4se&hk+yJeK<oP*xt#s^jT66;9~rwq$A0+@#~Qf7#V;-jz3P|#!`$q+Db7>OGb
z9IXh-YoVF4&>164H0PpLXy0|Uu+}?X&Q$YEv3~T$TRUxE^tho})@-#&Y*FRGK^ogu
zC9QJ4$HSvo3FE>+<-7xOy9Hf!#r0;nHrJG*Bb?-mj@_fmHhY3)0nK-6>g!F14Da<4
zYfL(7^shK^Ywu4iV6NGd#=q9>14ISDvj8?mQQ%%0p>+K{G+?=gQfbeQPn^|%n7T7y
zR3r#d^Oq7!XD1F8>40Q^^eB?)Ii$%qu4}e59&`FX($hF~#iTqe9fWbTv85%dgN~9%
zs8hi3c|WI6R@fwgTs~c$d-!<%WRQm#zk@@Y;zLB_<<DI^B34zN{h`?u!QFK0n^IgQ
zktSu{y04iQrYQaFYlwt|HUJMDypt#AG*yRujR!;#mBRtYxbDr>A+tlvtnp6LmaA`d
zkBWjo;Alzx1STLS;f?o*GV8u|%eQMENg5i>y$({XNX7+6rzA_ITL&5+rAH(un((7P
zua7ufNu(epMpbUorjD${>-<4=L5x5Vy5x+c^W$8NerKn>!4Eb4!^JJGxye6wt(AC*
z8@btMC3x&m05)S*i3+k`y*3UR9lBo;i~bieptO6(nb|uPSR%dMNro;u&WgtxyP0m5
z{X+UgZ32y#cvTiK=xGRqbYBkqH<gIXMZqF3X=^W{r|?U(s&f{SH>LFlBiI%z2AsGp
zGVL;O`2CIEdkdWEw^)3~KKMd?DAyw%{q;{p`8bo3IwL3v!3V|$LB`$k0&7?#onKZm
z6Mk815L6tKhEgH&1=u0wo)wtz8&*5C6a-oh14tpmd<!$Ewm(=aGZReY`3a69_6ehI
z{uX>uPbMR?x8L6$jx4P2)en;jK-%GM5oPTNT+{|8ZV2+pt3rxCDNE?gnDHOsJ0XZ3
zgKnsUQ_Cx(5U3|G^b@o%98iwraZR@X5xmIWyBN|$CmxyPWLSA*+D=}0^~y8V^A-+I
zQ{tM%B~CmUJX42XABYv4Py^U$RZ7w+R9Lvo;d=d8GApBl=op^tkw(t%?!u~K%8jPH
z9uC7Lp#gTe*~^Aa*On<``SI6rCqGbF#r_d}<P^qht@F62eovSpmiQbrge*s;TetmK
zKa3{8Fj~Anm3u!i6f;$W^+f~F4li^Pn^|?kM8pu@$EJ&*1&l?T*x{3Dpl_qi<y;&0
zk2_;vqjEB!`x^<Le-A-t70`|a0OrVP2k)#s*?DD1$+ij^NvYz4j04lQcjV6GSby6D
zrKNt~k~CJ^uptOl4GZU@2Iz5U40^i<Izs}U>E=MWePRjiJBgMiBBk((4gZ4d)|WL_
z>FlJPTg9@PS)hiltn0lKtTK{5WERBsLw<^tL2|uMA^1|nZxPvvc}h}r){FIR(~5zk
z&rO$G6v=3c21u(s?La<R6v4loKoK__zm@=fP?@60C^EvP%ugAmBVruNpi%i*5ph{0
zAmWT|dCW#(3Rq0D2{%k`4}c)T=n$xEF@lTsV0=;S7^Dwze^o9N*}ZYPUvSoRVdvpd
z-j3=Kw1r|KywCxihd5N2S!LZ<B~Su!mt~pCYB3?`yoiaDVM;9@Z^1*E&BMRED2I#M
zuIx)QsFpDFt<$v|Rjx8t^CkD8I29mfD7Y>nx#3grB)wy&m<aOyC2Citw}xs|MZtj}
z#C(L4C|sPo0v@owJ9dg|F)}dL=dwH$Nc_6fo0ZZNsh5och#S*>=MFAx<fH^gtT2jg
zWi{AxzC`p;t~FyjDvp)duzOg_9IP51@zIyE;a*BPHW|xd{icm(Y;{jr-!$5#m19G5
zv4k3fA1rzpgGx**(*;g6>BcGu#(OTmS&b<Q;Rvb*eo-Edy;3kRcF++~)iHwcnK`%5
z7LS}D;)XE`lt+NhDe{}YU05Dz#~b?AZ7x-)@W`z_#=dzFUsQc6%iF6*JBBS^t<k^z
zAYkAkP^C}4QuivYZ~-_Ypr>@dm*ksE3`5;FjJr@xnhi>Yzu}$=7G9lDnGM8&T}9Y!
z0){QhB5KlMb#f#_Xs23?nYbdnz<?=ZBfK0;#iweT7~ev)mh<xnqDfhOMMToJfE3b6
z1aQD0R*diZoC+gptW5x1F)}%;kecy#QgH8hhc%}*bmS$1AO2EYD3yxFVx}Pygv(F}
zY?PiP>q||-A&k<gWGxEXeIYZvo`~6@21U7twO-dd3*1xX*i*>6oXW~I*xLh{NYkEZ
z%Apf<!6?!nFUS^^8Nmh{VzD3{)V}n?=k+Yn14G3vO9a_w^KQSf*0NZ!UAubpg7}yK
zif^ND;Fxu7F$oUkLA67BunHC+=^VpSA>5QQoL{i+y~D7g{cM;UVdSLf*%G_)%1nGc
zV#%MYhDyU!nm@VWOALYwb*F@yW3F-F$e4W6F!?(uznkO=?MD3t3N(>>yHMz%RDR$?
z1j#?7puq$^)<Dy=Yn&#|8nabb2N6v-rzrKu?HVOUiW`wJ|MH?!|ErXhy^z-0vM67y
z%R|2QoV#m{miLO=1WU5W@U|GeMV+3&L3?bNwG8fnUk?E{iux-f7*%BQg*O2J!A53&
z%o&4HGwKmT6aJ6(R9vaaY=QK|e1n{heplORlSOZBJ4pI0On#UUa{5*7_OA_6|HcP7
zgf_(YO(rD0V<nDIiXYu>^mW0Ap~Z`h2?I#~9)J><q`}Uaky}emkNK%hNNRK8913aG
z9TXd@$M0pN19SP|!l@ucTVl*Q!a{Bw!Sb<L9IOH!bTfHz1bU3|Wy$S8gikfOG%b^p
z2`sJm--88q?F=e|lDwEwe?h5cu3^bmg*svN8CP>$6pg#BUY^y2O7mm_kvbm3(Sb){
z;w5gd>31r~18)-NJu^kAM};Mp_|PtYnI=gkQIp}tuI+1<Wf>un|Fj!i#r+DNVAGDm
z1|gEu$f9Bd#wf?}kx84>8*vW16{YghKvJRa4n$2t+B0Yz{T{H6zW&F$la><*Nfc%C
zkcF!dQi;ugD5s1%xD3?on~JVP)Flv_ylN9e)wDvbW-~B7ykwxuC$X{<1oF5NARk-T
z4M_4u*2w&{=8XU`2I((rpMeA9vGrT^Rfba@hG`2%t}r!>#WH<lyr(g?#r;RH7D_ah
zNVA@}Jr?HXX?&g<uo=X#`jdl0H&>8N#lcPJtgem4!O<?1)2$-tBzgXrHJU9=OLVZ%
zk(AU^lbUIpkIzdMXFSt{o8#RWzWwonp-o0hPR88c@4Lqj{Uc|(Pfm$GM-EHS<HroA
z!#Wd>|6YiQElwzy@APhfj>n7PVnJi6nyW)DaZXgyYRepd>bKTSPoP~D+ts$KrtwjV
z)BiJw^}NKK^Wkt88yrqj?u$_S*P!8t!af`^HY5(r$~Qo;mAaA?!}hKbS&9e_CUVP%
zA&FY&q{zvOYL)WDu8EW<`Ni_l$jxL8kz<v*Pql{~?sstlN6Svzp1WhQC;0l}wjNW_
zr$2rO7r`ezOC>y0$V(SS<f7v;Z<*puG?UUC@13|NzIfUdNOR_Ee$=)nYI~41pwE#~
zWS)6g?U4ula-eWyy~Vl)fs<;Jlg&?z!bX_uB?-fUNh`xkmr13B!^1ntr}@lrz{Spq
z?KafL{WQe?OA-YLBB&1-nkSm*1t#TtANm@4J!dZPUzy*}Vxp{)gReym#v8(-YEjqD
zTU!Lp|3eh5emlfJFCEw6HK>+od>O1K4hzTaU4ss4%#9ji@j2y+W|n5bYwE1Q>I;v#
z`m;0=Ei|f#1xfYRXqRXs{1A$FPI=a$D2|TMw2=Bsf*!nrW&{SSpR+IQu$yL*eZKn)
z`UEJO`XHu5e9<u|S#{9}iEeEEGmTWbi?|R??Xr)=NKbkCm0p)`CL@<-A_6pyj`?a#
z9f{56CPWjF2Pd}$Ps&~J+~|=GRAFYv8?~s%r9uyoX*H13>Wq1A@6jd)iY@f*pv!gk
z6IOLCH(@Mf0|K($e;xwyU>iF-?zlGBurV;i0EH%@3g#Ttmzn+76=vf!uHb_gbRS6r
z{`&Xg5Z7V3y{v#`hBNllM1qN{pQxm#7+F{$8{?Sa369w`Hrken$qv-_I?f$og1&Z-
z?mBi+nHmZ!UHz5ezjX96-ok<^o};F{rjHeq$f6q8$OIP`mQV~{O~`MA|3?eZxV@K2
zH_i$Qb&LfjqvJ9?oi;6Wpc@pDp+}}jaI#W=&;R@8lgmICyR3fO8;c1`93Lt2PKZ>h
zLnI4dYL0mCf)_hbS-EpQ{)9TZ+!v9s?CPl(B<eHP4H&KgH-u*c$AAT4zD7p!TvsYR
zQ6fZ$fpz;c>a=3vOkfzZi4U3q&9&KDv=90u*}@RFuW}{qYkwGSyE5e?MAg3q+~$k;
zL*U5{4);V3hTU)_3@&(uhRWw0bx}CJLLk@oN1Cc_Ns21p5}OOQq5)FK%e^WT_;?Ax
z7con$nEosd$8pR@<|>UJa&$C=M%tNVQPBWugX^}{&Qu2y{8K1TA2naENLEgTgq|+b
z%dzQDNb$+_=s`ubNdxoDvMgNJ)?7&Zrb!6}%4w9-g$2=m2pW_g#`U%b(To1?m1X(V
ziTxQ+$!H7I3G-TrBSLM%hwD$Vzbt|@Lur7|oyrN2;t3V6Ig3+r$D<L)5~gUZ^0-MR
z8R6!7%`H=jr0B$HgC@OU#XX5Jfu!9>5RV`GrB5@L9+0A52xg2v9hv*DL={j+v8XI9
znGp#n{cCp8#WC-eorqE@tRkr=VhPSPkWY|`mnd<XMS}wPDFeE?Z<`+i!xP&U$~ML&
z-5(;q+L?#vm*h2)r)8oUe~=yy4=W~}7B0?|UUa&koKfXTN5Iv=DJ)rL9qdxAOm#^%
zT^Wz}Y`Ewlz<s{|D;kTnMyn>GfKG4kEJ_`TdW%6<y{wc7s=$*RPpW5N5FjA5P+hg&
z=AqIJzYi?UTWtO5N1TS%NHzNH=tl1uj#lpm#Y+?!3YbtcSd-=dBKM{mGPnoQv4kbs
z@EqG|(1kVYe8OASj_HFQ+(^135pU}sPUtZyYh3%yf`);BS0|Vh6fLewNCUU?@-&8$
zCzG(BYwi%Z+-J5oytWB~WTPm8STj_Dl%@qYQue2#3QpOpAt-lC1|O^U*X#eD0B%oc
z4c}luMo9*Uk?<E9H+x(DJ+uZ6sA3qNNY#A+pEQsTnWWp)xcTk$b`uYJOqfT`^QbUq
z)f5)}98yRgc*1@Qt~OmvwA$1LWGI6qJZY4p9g$`@;7$1o+#|kwPUy+SHdFMcgPQBB
z2AFataj@cEtu6`c0ERi_K{~?HCuDz_lFKfCZjk8__)y(xRoac`(5yr7CnWrCkT+Eb
zO+W)u#GyyB_7C(YBy4|_Yii0mAl!`V4A_^Cda+23){){}(ns#?FrSaR_?#!rnN2Rj
z2W%Tqjiw>6^IQ+-$D5%S>s4!5*9OAUq%F(Y@3T<?s^L|FXgG`}oWG9lnhN+<2fn!3
zR4HM(%SSrDCEMf9>`@1Ctzpg5RcOX=2)GolYnof6ZM>iM<tvO%jaRh=lJ4rW>l^0=
z@l*v28qu!9m9&bkj3abIWT_eFl!2)>@|v!~oHg^l<%ZwsJ5WU$F_U|owu9o1$9RQN
zphlKvWtACv84zdxHJ^Ag&Xk;Pf<LnfMj{Nc8~NByi-3lMa<=|NB#ki}kKF5C5i<>$
zVHO69{cE3OjJsj<HPjrP{LaK3=2=1^$CBbOidgrJ&JOn5xI~Kp%TzfKb?_l!A4CB)
zX2g#4$Wx0Lh!o!_g#V2Y+jJ{zTb~)Fqy>5A8Bg!0@nSP7HESRo@Y>g)&^x)zIRt(U
zmdV#num7)x$`a4I3oYO#kel%I6xS^%5<1V=fr@oPw+9Zc^d`8>sH<zPs<`!#L>($r
zoYjx7_0}=j04;l0fgAB-wWK0+yiO|AQ2}jedfIxdo{tS*)gRECjkSTAvS7;Q7hi%9
zC|+3WW!Ln1l}@8WubD#*WTpJtNswCwq14Pr!TwadF7}{grl2scbKgCe2r%x19?@w;
z-J^iQNK6+o$q2MdT?o$b%B=Zi@f{8Sk~#A4sx2JuB@y1ha0F{W!8Mo#(rS)2B>Bgf
z!v%4l^Aya(m`6|cs_h^g@RY>ZXW5~XX2{s{3V>1jtarLFwHjeh0~n_S9Q_FnXp05G
z$|-q-M%mDf-58|M1Em*>{w58FKw+01Biz&B?uDF&u5>XTb^O2<KSrV}qVXe0jiNAQ
z1&h!^u``$T)2VFhDfdiS#L{q0oS&7mw&lggy2JfsqPr}Ud7SH}La>jX3IR&+N|xFD
zutV!CYRYC`(E^?ztqfhJ5+oCyq)Q~}Bmm6t#L$S{apo}+bjU_MLMSMyc{TOb4A)E7
z`swwBZBjQ{KC%MukyUB4^{oKx7QQY`>YoX2B=^TGf(d8_g!mJXT!LiiraF?LIAS)L
zTCz5HCFE%03={iB4(koKig(=Xu=($&H`E4o<ve?^EZEu8P3p|9@g^!<?-`Uv#+8v>
z;w6M$=|$=%`}DlqI5m%G^{O6-K`}Vu3t`jR6<PBU2y{n1$+A$pj}WFo@GqAg?fqjg
z>u9@tW^3~>7_rAz_1mWmMT!5O>L^HeU)<61Yz#0J^2TN=ft(~<InNs7_U$c;d<sFI
z5B_B;PqjPrDDuZ5pMM?4$oc$)=|XIxk*2%I=ycJ^${TApVcJ7jitk$pEoQ&i#YjO{
z)KCVW=HZh<`FnCKS&<4ZT<@S}4k^^H4U|kHPIL;o!c7PaIHW?!mwj)<B1c!k8Rm^_
z>w@xuC=Dm$6mhD7VP`HS&>1#@=|5a9$KhH`<f2(^E+d=PHN&b;LzEo1w12K7@tKj9
z5KnzBhqpq*FnA*Vf=FD+1luvuV#(Ct<5*y|A81s+d}Vn-srV<ihCW)&@9u52tOFM<
zghH>Jr${WiW<B{8+AQaDND-MV>z!_4SlCb?q)+#}N%U0QdH-y>P%DGKzu^AShFn{y
zhVN6k&mJ3|YooTx92N#^d|qEbpoMhIYl-yIYaozFe)YSEY&+j5cl44tgUdoe?_fYX
z?<wUH&q!>=vY#XltLFD28cPgUlB9I8F*2;Ec=0sT)=0?yy8!X-30=-S*!h<G70gr)
z$wWE6#s%g^7p^7*h4>Ktb$cX46I0%7^7?|fej-Br0j^!!JP#{dq={OFhuA7(#EH3{
z9)F|Bckk%^_oSL47<-ppU!QTx_tbZv3;(lc?hAO90W)p?b}%D0d}6bJW`UIsnW1Ii
zcTmEtyCw#D3cU#`_G{OtQabT-l&5ev_s^L^pk=|+a_J{_XDn{F`X{$goL#rE3oJKZ
zGwRR>+Ze(-Hy0e`YtAqETrbT}O)5HM>c=&&g_8zpxrMF6Tw3PxdXw1Sm1mXo0oK$N
zp(q4jkBF>e9FfS(Y%?ec!zWd;oX5nd1|2~nK%1eqayn_D-G1gS_45KeAvz*9grA8f
z5NyGs93ov|8qC<6J^1Q^ckC^Rs%x_ufQD-755hNmzd@Ft4B|ReBiI2RLz%pCJIR(I
zM9FnPG&dGhQZjLfiODeKD$HTnkQ+up9_p#czgK}|6TF5NQGybm6R**8h>_1N4p+2?
z%QZfZuv?$&?4Q6)?ziTSUA3aQW*soDTvHf=<9P)3-WK=1K%#nQ<%e~Hycf$;VXke<
zI*EZYy)>lwt2CDPi3uFvn^O8gSV_}|TR&DYhw7;l$Q4(#*n>j!sPT6x`wBitaDWyx
zqb;8QQB=On+5m?x+Q8z(*pC!$<uw=gDQbn8e#>S}>Ro@(g2N*FZ;HY1#wb!~NLnc*
z#9w=R83yo>Ce&Wur?&5nV()?Znc|FFdvffn+Gv~_q9D0A{d1~Z#FrGxeQXVAD7>c!
zOO^8z$0B<16WVBPGPLo+;Ay31aMIS2I^lNxrDP-Rz6q{-L?~)&7D6bov=FF4kYolJ
zst#@Lv4xq>H?AGAvh=amNp6%3BGzQip}?fCmY<>RNC{&=SI3&5;ct3$zvsq%>Nm-U
z@gBm?d-suSMQSj~SC3Yd{iK}h)-9l*Yqo@?LhxL(Ic8dE?}bC!JatgQ-*yEMKo)F^
zjV$rnn02FJ)Wr5Lbq{)tq1TwwX?gHWY_PIfR~WpeF79IaRdDohQfHI743RJ-_^f??
zhH}ROT&!=q!8a@8Z$i{fEJC)qk&g*#K4Xm%UjG)FC>L_aCEs?H5I;m>`@^A%-e6wr
zgec^DEY%fJVT3*OZ$@9)8LI;8?g>|-o~3Uc_N7i$MQhAI@V%|$#Id?bF-pI~`(xxY
zn&X*c>x40o+Zfx~Lduf;X&@tG6JQ7>CDi0bry^!U(aD%4h=-Ezm&^!3y7!*HoN4cl
zFqRTP=MLgAg%)i1i^FCgF%!IR=|C%XI+f4ul9}5QZ!!{^D*7;l!ql`uxPO;-P98&v
zaozXFB|jnmS<P*Uap=M!y`x9pi?YSH-nad8akekz=fG>-2SbNr8XA~<>vHR<-2S>D
z-Niq0TUG<J)>`#YFvQwU!&X2#E|V;4%8ap0jimITE~-&%Er!;hPv+jit)eLqSMP@w
zp2_%)B&+fLkw$H1I~(HxHzi)_ak!<xQ1U-k4U3**n5@C?wOmI#B>p?C?ei(&tY2K7
z%)uzwW?F@5y6Hxl$taqP5%~w-Nz`Uk_mg|HqN$*yw15SR@}nHp#<s#pAK`+1g+7rz
zET*JWs*CvkMi;@?G8u97XH-=zVSLV#Sj2VIs5my)2Q*iI7(xW<e<_P@IIH4`W+?Sj
zd?&v58g+5gTuuou(KZ`r??`x@&LX*R^6u$uJe`9<;L883gea;u<bjCyb@scSb2jcB
zGa|Zp(Yx+#Szq+e#~VG6$}ABSFi6_>Er^|bZ%LDbQH~j~n`l0}%O6Evn~v^yx+CG{
zcfh~&L$w`)AE#_Pt-Oe1ZXM__w~EK@vs8(RKpVxSz-1iwP>I4q>q!v^=gp<KE7}$t
z?KS(8Einm?EuuG*`+Zg=6NW`eA6S^I%L(`M>6?v^++1)_ZYcH`t&FL*vp``OnW}Ho
zV(cer&pz~5*BbYySSvQ~Q{O3{UYg$yq!~xm0mdgcuCIbCD6Ma~HqSPFx}uv6g<w~G
z?=_oO@_4YV9a7*&yXZ}VQDFuavL9!!fikFmQ4UCvm9#BsfFL0~=%FItq?`e%DXT_|
z?Vd3q;U>4!^f#J}fA=$OqTe<|;j-#p@B8HU&n09Gna{?zDQ0A_wYRXYWRlCn8fN74
zgH@q#)vF=Tu^cTT+0C>4<s5vy!3tFGRcVhh-Fe9C6OVqzKA$});P^QvczZkHTmm$Y
z=Sd?%yxw<8GhK$vm+xMls}|!3#BvCyb$)`2zenEqP|2q$rb7@|6BvTgQp6Jm33EJJ
zO=yIqGyALG<ygX&7YsQmHwEx;F{%aM-iJ?6^<Ns>StaMzp{4%zA1DIKXF>dK8P<%U
zHtf^IQQlS-i@gQTlggxeuO16gzeT$WIEkCXD9}?aHIkTBJf*=xBGumPlh4l)+(o2w
zl9Nh)d>G>%G-$^zwapXBE)eCfqEmeb>WpHej*fa>(u9O4)FK!|X(mLnf5DC11WI%H
zD#}q=bixE`QO?M1+{f=AtbQ`50p;z_MMIv`%VKH1ll9`EbJOO7;oH)77-ORY%(O!x
z<6(wRToe|qlu8BOQ2iaYyhGr45b=G;TK?k=*m17O>$fu)|6QZ0`hB0*-zX@b=c^Ye
zc}&7i#EU4;cs(HoVfveUuifX;kd!gKPy1AmZI6y>f2p-VGh_h+WQfryTze&|qNX%_
zas%#rMds%s`b+OuNYaj0TukY2mvkGyB26rmQ7bKtZyWND6#3qZvtbnMKyKTMUZMD*
zSiyY(WUI|~r-TirBXQ@eEruT3p|`iU*<5z*Pdm{yZ3kHc;V3O(v64lVHQg^x@!o4M
z_ox5qFuPAQYIF?@F4nf=r&x-1Jx>Mx>mSKs(rkv97S_s14)D++=QO_k%}B;KIc}NP
z)sBteugY?U$qi14(Zz%tmM#oJP3q@t{HvX~oR`cH!}>0C|H^SR_fzSe*a(cg76_qT
zk0(D2RSdv^T)jot&Wx;Wlcq8m()k{2Fm0=MI6j$*m;SHd8*<KdBfA!HO8w-pt;74N
zV5NUIcb99UJ^Q+MC5F-V4_*Iu(jbC~S)pUQpFVv&Fwm^MV%dHI{O^T%5LiDQKH|4)
zI<32bbfTMIEpVe~sa&bgYa9hDr-!z?vRkVO?Dog(&P#(0f9Bv&?eT&;m{GP`j0gvL
z{3J&OX<=}%E@EV18Uti%yFSekJA3Rnx39xuHWv0a=uNli7c*Z^ls*q*E-$e*4IjiW
zUaNAe%;tBTHG|zTlnO<eroXrSINeuK^wq69QS`r%p7yAP+rC7k?p>$)lRn2K>Hq1+
z&xqXDu1~)7@znk|)IFc?ms$g11KSvRS0R<v?G-dpr9$`RQ*GQ`#|rWOU$Rg>MuF`z
z)M}MZ_eK@A#2>ELqn67#gpiiy={-r@v6CSuez{`7VT>6^g~hWOXUf{ejx;%#io?~U
z;VKBEdkqHSJ26jYc<_NDtYnbd`8W{ue*F7_m(2V7stE|@Kjr1a`UKK7DKISl;oTjy
zj_M^kWv0r}q}6Wks6{&&V0)^34<%ecc@5)6JmkWFWdT9oe(Mjfy<~c@w><0>gK;0z
zp46^d&sl$&A%)mwTXi(3fn*dK{k(fN$ebgeF6F;SS@$OG{d|;hzdZL@<ZZMfZ_bgV
z5e*U;u%un9qY7!&Q}OrbszjiG)m~xV3CXR+a3WKTi9g{|;9II_Jbl_px@^@=ub1mW
zXRj-l7@LUSP>}7WDSYXBnILUMfX|k)^!6g)*IN&-1YCM8b!>bIzI$HRFE4!DE;qWS
zy%rmCT>PKY{XJjLTm1LPNuKXYg}W@K^S%n>@=FX%tK=!G5(28Ssct*4F??O2H@J@a
zZ}{_7xbR!e=S$6Mi^Jz)OZWZDQqKoZclK@+{I;$n%`{D=gRx6t1gXK%@AjjXvsRHB
zx%NumaB3>TVhnrL`Fc8OGfsme2nqu<gpmnyJZzzl@I5L&a|2RhzK}Cz=I|!$DBPBv
z5F~R!c42C<PStkG?-s?4_A;%Fdb+HFd$)Rf_Bk$zSmAwB#GRg6yi?KU-{NjdK0V8}
z4ziFdeFh7DKr~AMvxFCH1y)nU|G9kA!KOjL6n}opXTUNUu|>X2jXga4_e(&yiQD9L
z(Z2;pBvH*u<vV0Q1j^P@zJ2}+!|RhFi}z*npVHYi0WaRFA)~y5gTmzqb%iB8FecU>
zk&ouuOhw*-8n*@Mr$!z1a7|^$S*w5Y7#DPPkr3H=v%k_g)a{GmwG3rtb~R%iXiC(3
zvVnmM?8$D%JgaH*3cR0VBIIEHg_7He9uwa->RVf%+LyX6c&9xTQw`G1|1~Wcynd;|
zZ@s^a5F<hltUcGm1P*8SUJf1u1Tn0D7*_u~DgPAnf14lYn|ZYj{t+`%Y&Kc3={>~;
zU|m#G&fAsAMzn(y?>q(br!=9leRbHrxeK*hE;ds?j};61hq2bO5rh|9oa9x1zl`3o
zlc9}l%Wv^B1+(>_`<~Gz-)*s-!hpzj>vT3BrARMjAR`7Rb=VM%$C09fs>tcgJwv5!
z^JQdBiTro_9Q1uBP+n9FUl#8XS9}7SZlQbgE_qo8e=_2H@341u_jU7`q30rgxu9WZ
zTVDItLdh=p_z~?6-umI<3pibZ=&jbTX9L$+bEW3Wk$fgR?^YrVhU;?0e1R&M8b1F`
zt~I|zamu~)+ymnl4G6vm_AY}i=pZJ9lWN6(=z}RN&WDeOw-&+{GvVn8ir`MOc3N8-
z;%4*V6-JxfV?-MYHTX9yv@QD28Je#YRqwOC*R*p%0RkeJI<NXy?K>FPpV)<O*$qE#
z(%moC+FVZ;7oV~nx}R~rEC>I2Z9EwDzHBGI6tXWmF1vqB>R9A9Ic#>Prly+uHTyTz
ze`H*`VEMUJ6QPFchS(5;@jF?0>Fo?uL355LS(#Y+43?+U)zOw!KiCKnAXA{TF`3}j
zx1|K3&L$-99wAWTrK&zzTazF(7MK;L9Dz8&$!FB)Y|SY8p*=T==qSEN$>QC7$$YMs
z9TVFqoym74e=Sej&$|~H)a9h^b`l=$7TrcSw{Gu;FXhV8znVAFyek}3$%zF`2DhXF
zrap!~-nnaX-UmN)dj686|C2uB-l&J&Lg+Xk_5@=spr{4IxIeHQpl!4$^|>^B-ZD5w
zaUA{!3Ytl}^E$fkw@5c1b#ARQ<Lzf0xDnOSNlBFet3Cd);=_k#WcS9FWnklvu(ON?
zde}d~h@{03><m5Kn^kNV512D+C=bf`JLA}|F*O1D=QkQ*Md2QZ7!z9OI=Xu4d(W<=
zdhumhiY4GytN;ewPVu9BVW6WToZtQ8%iP0X3Ff}(>s}fpWc!z7W-O40IUIv{Dxn*%
z#j8BqdJl$CzDu)ClI2g9OmKt>rp}u>Xjs-#^2=**w>#9KWWyK&`WNgGPtzH%UO0hi
zVpJ6Z?=@iSL9tU+>l!|+ipzwA13eljpHMg9Y1=m1IthZ_)ej}OA6IeMq_+R|a?m|s
zDC~IWH-r7Tdn4}e`YZ~7xiE%VdD{K=!rpLivGQTn?63P^s`L$)|MjuQ-EprTZT0iU
zdnjC(yLBJoEp>XL3^azzkI&Bo!FBiaY1S;bSY;UR-NPLHYQ8RJ*(}~`l=lL0_Yw)l
zjEd9PXCdLmtEYpRJdfF27(AAaPnaF+z=u0`%}3cfMQPAHcs+*W(Ma0sv8ntck(&G9
zMXa2!OEVSr84Uw@R(;kd5Tpw>%j0+JuC);L7MZrJWU*AO|7F~`@UfmqV+1^$!9ANZ
z`yR`I37qOox4&L=fSql0z1~bP!(6=`3V-tCo;pc=tNLw)?041vAA49EP*xW=zTWKR
zh-jn^H9m|Q%u089$5?Nt)ZQ@;Mam}e`<0Ug8P5LIt{^NHD%aSV30#hj1&Itp$1;Xi
zMFs-Fq~QymiGe$WG}RYC0LHxwS_BWkzWk?XKCHb&S$ZI3iSi;jIFAdtlSG_~|E0Ik
zdjvhPaQ7onkJazzy6geW&OrLbqkG;vN@=Fh8tUi6*fzPp@B6Yj^v?3fVV~kzxGh!o
zZq==Ce<jP@`{U>iSq2NS+#&+WbI~V+iX`}?orq3h*-O8)cFz(oYg$#Pi)zz5oFSVi
zKr7-8T!5AD?feBBIl6DL3RKrtq7}Twy^A#`G9}P0;ItN;zddGnpYhwPQ9)66Z}k-8
z!Vn#In*LpiYz(QUR1OaZ!1TJ58`<Dm-8I1tNcQgcsCyOM2LOz0og)}N^?QGTI@ZBw
zm-jHo<sj4IVx>tA)a<bNQK8j!@|1gVEfMN?J~v8+ss%m|OQ^a;WNcM#+?6fENFhA;
z!^Sw(Qmyr`Y~zX!QNhkhuV|*+Lzl=YqvQNEtuK8vd4v5FGlG2E)izdu8AqX-7qIuC
zm<C88NBIXO0wnp<fGQ3y4W%k0lo$1u=Wu<OF<sc{(c6CGiC!40590E3IQ}gYqF2g~
zQV%G6P=oE4`LIp!I=WSOXxfSh9yY<IH@pT7uFUeg%4h()9^&64Fhm(M!?1T-0w|lS
zba{s)5vq*c=S3X?h4vc?NF~QdJ1B>y1q=ArWERuc(0Fh8UdM*cE*xjLK5z2?9veAA
z6fB;8y~j~D(Oe11aBt^^xLb_Z0v0gYY$Mj+pnpBH$X|KUb079G!A#_OCc(@1aJlKf
zr0@Rx`b7bE?#P5ZwO=GVr^tUElDjA#`L(GSAqYJ`HFTRNk!Dq7N=@bm^y|mXbXz`a
z%t`(Z^}GAQcvo{RQ&Cbh83cP)Swnk(s%a_~2C0KUYL=N&;!g|9MhE%R&)`q7kB8a8
zq1fx?v#XB>l*sdzafc@u?8HhGsw7z(rN}s8@6)E+YA6!!y>aUre|@RF(?DJA_BF^b
zjU={Z{V&WFe|iwCdEf^C0DY_R1C!r<zWO*eTN*Z7X}}TI0geFT;rA&bYBczJxG}>G
zjcE}UZZw09&%m+oCtin`Z6#rAiKA%dV8)f5W)0GI%ea%s`90-w6VixcGJWv^2U53v
zqRStSngeHyWQRig>a^y5tC<&4wVTTL4pl!8HV%&e`I6sx+BbX8joZBcY?fzV*3mE5
zXOI7v70GW4g5+tKyW8pZ54XdYRdJcv$x_KD<YF*C(3wMi>hkLe#RkHhD18&MNU9Dg
zX)_Mp(wlFOa2$AOSh7av#{&5ABMt(oEKIeS;upO>#05Te(`tqc!iCUGB$}%ZRRHj?
z1Q?2qoDx*m3b2SHV{|0NbWl?I%r3T+;UgOC%MqX1#IH~<l#j9h*$Ol*^Z(c-j`!YS
zh*#h}V}4tkZa1HhNKd^Jzb;*R{3i;@70fCM1x6?oG9(TNw59pDy?x!5pdH3VCJit(
z`SlD1-b<+$$U!^of0Sz4ARK<5y|T%|DeULZJD@n&Li@WudFL_agdDqPQ8PF}S8U9V
zEMcWUP>qQ`V|8jy(eTI&fx|)Q<(rMSx7nH0o;%q!B4uQ$TaK|ndCSJ%a|rdgQT{JW
z=QsN{^Vf%SlBZr6ruL)4(9qE6uh;iW|Idf>Rfn$o#g?vfJL(rm5_EM~CHM+@&&FE{
zFW)^uqmvvcfO#Y+901A7vG@r{YJ#L0x0>&#n<L}Jq0QyN9&rR8F}M;_5Lx)~TSrgH
z6QxV&9y;Zb_EN0|C0Rl($&3eCr^v*JZPV!wW9$%~Q(8I^&KB!93`)8;vRtNIqFm;6
z>xhIsSKibvFZW4&I<jmcj(41b*W;@Fkyh8XPjM`-54uiRXZSXJ8nSq&m0j=k99vop
zrN12z(q=$P7aJ84VwK)x1ECTzD<+B+`qawam%KDNspo#=QiOFKHsW-3c(3Gy9ur4)
zX^y@KoAHxRVXj{$RVGut?SHfYC(=^qf5j>qYv)kSU}5AMjX$!6eS5aPm*h4{ksr4%
z`owR~tg0hqYul7!2_uG!13dE}p1uwSh+7qv)z-0|=Qf52KPxzWG77{z(6?~DTT@fb
zF9K9*lsuW65HN-)dTmIvoVEYqW8B)=h&U=!wS`|Fp~FO*(&7zsslgUu_y5%O8e<;r
zl^pEdGavx<(ibIY(g~@s!I%sD=-e69S>`o!*@@xj*~7X@FoNE{fY_gU7r3}~>@DK$
zI7XzsdFOtAXMLVD9aq^Ezp;Af3N~yY?zM#4Re6#gNAIVRqb14^AOG%8R4-IdeB)>5
zszvg<2^U2L(Y%#GNU2_!q`1@-p_CM<Ey{Og)+VQY$8Q$v-z+(Jl^uO<OZ#l@6W3We
zn6B0u_jJAL;*WgBj@p85b&^DC9IBXbIfBJshVX?Ruf(>xXkC0?c2%!boE4MJZeM_p
z>tGxa|CGS(q?#gc3Fr5(Rr*_t{k>-~iZF+yM-mX6%vv*g%u+g7G?yytQIu?`b&e;c
zo+5i_lte5i)JGk)@54qn+nB1tf-@;06iv+*Bqm>HFfSxX(Hnqt%8N>E1)Kzu;7-z1
z#RG`bQXZ`#QX;e@Q3ocVkl3_M71wnyHv7yKxr*ArE`=#(VIsmIHeBfiO)#QNdx%9X
z*OOAPW2B6^T38F51fbb(h~bPFhD`yEgp;P(rj6*EYAJ!^-38jx-OkdG8Ji+qU=b{`
z)$6BQCeE7bln-3tuE6t-@-*C4W7uX4Suj(2nM!x+YCkFCWl(2AR`_l8%MW=hg%l3w
z%)AB!I!lvHfZLG*rtFhzywt?~^pzd=-DmXoKcFx7ZPn{#kN-#<(brO{cv}8tljR3|
z<xC#%bv^afAW*@S$m1?Vlu!|P+6u<ebL?XkuG_|^ffBs7_(@1fMi$HaE9#t+&@?5y
z{@hC*%Y=5KIlo~;#~T|9&Tj3k9&!d)CKfjH=l}5ZjnQ$oUAPlZY_@4^H;s+Pwr$(C
z+1N&7+iGmvwt43L);VXbnLqRInf2UzUwhvdD10vZN4F(y2vNaB=i=n6yCj=5667R;
zlC7-V_PwC;YA{7n`U@0>s#;7-{-pg$Lx3O2U2kk&Z*+a%xVm9KvX2#opkl^F9QBUm
zdp+WQafj?SYX~Y2^0`WP+~LZ*!6|}}MB9qcRpsTk_1gsO3hHZZit_UF_N;Rnaolph
z<5%mwpaAZVrgPvKs);*#aT<3jW*=}>?4xCQ+0>obaf>pv%KKavOh=6f86T{{&G3Tt
z(-`J(hRnyS=dfb-IqGy2q4vadO}SD_dO7jNLnVireFgCg{UsSXF?#-+9siYd^xuK>
z!)SiPe4jVJ<=5TzqAQu$Hr)*6F+jVmy&td4JYc0L+26mvPdhV7SIulni1Z&{kQO>D
z-+g^WD$RUnNF&lwb7wEGL_C3HWr9#{EqM5j7xP;lsy}+}4FF$_;BLPEFx8yok265O
zrmrj*x=m}`A4%h7rw$h{2pZwN8U3YO_p*1ZJO@`Cjy3@6*)U_CmkIVci#!(hNf~Av
zB*@;oQ$=24+~4WqOLvtQR8g_I$-;V=qN0mXSvB;?qo&>(p&^aQ?hj|PA}1I%dd;AW
z!7POae|!A2o{88TQ{L(~s;Tuht-Ea~INXr<OAju#I-t}~E)$Y*LYKEW;}m9alxE5^
z>M`O`X2`o)_%fZ7pgQ1=uvmr#t#ciKZME6)G67OLhw|R%S*Yk8o>jG9f}9z)a7{Dq
zSBz7@+$Jn_nE62N4ItkJ$DB8<ht(<H&%5p?&+etGC*6-zRn>3J)@zHkq|g7t+eBnJ
z17zzChX1HdqAZ}5ewlZ5(Vl*8(2;LgpXf*5=*+~)?tM{3pp=Z?g}_(4EI%4)jf?`p
z$EQ^1=m>Pc`8##E0sZz;o}}t{v+Li5g@Nh>dwD(lVk#<i^#l`<p#v-D!vw>7+2`)l
znYUMN>o9iDkpvvCQ#Zh0By~jTWDi?#Il_qty`OirJzju;5!x3xl!WsANrt~;J~K!#
zmhlgLL6ao8)TOaFb2duaQ+(z<6&8G~GtCtrgkAAX&(a~7>f}e9hO6;>RQgtiPeZx1
ze#!V8-m4e_Z9__DQbPrHl}l%DIeNENXFr2c5*)H*{i+bpa81t^D+#`yhZ)*IGHr(L
z_fe2cdp|)E3k$33d5~e#{V3}jt5wVA>zQ}!$IDU9mp`)CHWY(fFM7`NfFynEegHgu
z%U%rEf36ir?mipNOVXN$*G8flHaSvO?-$tc2~L<OVWoU9V#i_8h1S^8RdW~&d9X&-
zjdk7+)Zlt$#!k@hPG-^#ko~w)^kn?*vO$3#r?I#LXno)D-NF5$z<@eQdr2Ma(2{1d
ziBDhwaZy=OlE5TnUZCmuB0*^COmo+yr)%0otV8?dID=REd6(z&#M3)4$0o3OW4U^Y
zdR8rhNXO_8lReW}JiwR;eBAcFm^Ekw+wmvKa}#Wm`sIa~aHAerP!L|*w{cMbQNt=7
z1)}a{d<44RB#Xr9jWMe9C;NCq0!Nt+81-QBWBveXWeZFOi%geucCmAIVt23GFk9(e
zRE9v04nrXZm_C`=*7n7qY<8ZWzUiFx)MOS{b?4)1hE3ZEXcOTwndSYsBI`b?Sk-YW
zK|om1a+K|<^YyyqdqAVx`ti8tdp_)QUgG;&@^y{;bq%uKaN;xpt-b#<eDHOGa%X5p
zcl@E?vvi)ZUMlGJa|WgF6=_BfNuLP@Qu%JCbCDEP8Rc3qOadG%2ott^cd>BJ_5SL2
zWGugri-2S00=px0sCaTP{Cz&at2%=+A47S%n{cepvlbWfCv`w`lhOSV5$SJO@-Qmb
zi$As3JHP995H`ElGF?8OGjjUX&fU9%VXnS=KTY{GAh+~t^34omVD2nGHsV0^geaQb
z!~yK0oWGg*knprfzTP>XFRrnTcWudzBvx>*B#|9SJXhx}pqAR3M#vjWDVC@%^eHRV
z;K}lHT;gD3Nk?Jb8Ij;@VKs8vRtG1=6oaU-eU09lgIs^No`p{lr}N?$>fISWa`>gr
z(HJc?+|X*Vg5<OdC`hEcDch$FikCvCz$(`hI(;gG!{NYDR27UPl)0E|3u%f)!X%yP
z#j%W``I9V)hlEl`0yzi)x7kr5pH=GJlUwmK>_{ODB89zLz}tQAD7feCgHc8!9XN6M
zRmCZ%_DeD}-fMsd{I9RD^YdY>t#;)Q+)+aniK{&NwdJXKUKy3BS|12N$G&)8>j8`J
z0zovRC`br(;C;S@Kg3006wnvmW3n%Cll@QlXr!6bj-H)PbCWNf^9y3a#h9Nf4Lv-6
zK=1CJ4e9GI3PH9M9pBZ4w2%j@Wk!e&p0ySg@m22=+4b|R_yB?7#=|d{d}(DA^iQ3#
zcT`2nA$j<{TV-C0+@-fs>eAnC2{VjvX@9@E%i7SO`Eyr=NPqrV@TP+R_w$NH7ZyFZ
z7ZKeh5!{?EI7Yu$$qH+Jkjugh&>8^$4Nf?T+f83dKnc!2w6{v@0FLqiL&T;G1TY{Q
zYq|MSJsb-DjG0*fcxr)w8NlW3Fq3(KUA_O7y2kxJF!dpqbF8%KBGk>Qj;3q;5C>F`
zsT;WZGFh8<d%`|~JbtM4Lg~i@ggH~|J<?4Fpksa-^!)0|aFN9-&ygUIsq-NA*mF*F
z_MFfcPACth`DQ}qsLiu$Y~o<+oQ@0{vF^DQgLQc9hcs?QERJC0tjG6k`O*W4)PUP$
z78q4L|FbA?OF#{pZakyZfO?4L>KYW2{)i4GUnQMS7iiaV%&Rur%_J5q$S;@~tK(?p
z3h|?+lZwjH!>bEwv(rtAMPc|eLkWo#+#}rSjstIWIZeb)VijTQtHWLr%zV(pbKtG3
zaZ&#UmbRE)ILdVMxJ#4G>TL5-&oGXgi<9R>IV=G5-V|Mg0H_wPK7Q3dUEU;XIcFU|
zwW}y!bWYV15E1!7I`or_AY#j<#Scd<J@4ibi@Zw>4YL%G<WidKQ_G89_W@4D`h-m4
zwzYy{^GnxzXHY|EC=nQM<NxM{qZ64i#yKVMdjIfTGOXPCFyygNzVMdGxpZoiZ997_
zb9$^QZ!C9N;5=*hu_dUe1HhtAa)mw8ro8R;G16nbH!K(QtR|1IkGUe?FYHty*#2q8
za@22e9}cdvT~PUVT`Bmh%<<pp`{}*myL0F0w+)sb5#ZD;0mxczeoQDkesjIAPhVl|
zYZ$3jE1rURU%7#QeKH+jbx)SUS!UMI?Q=xq?kc{>c{qM%)@7JV!`a#w0_Tm;Fza?d
z|59s)K+>rY?z_SI;ZXdUzC7orG)Bx*isrlp){bT``%%`Gw_Ye(e8eACX&T+7a(upg
zaQAx?JLt<|A@FVSRS|qObsjGIer=Hh(j~k&ob$^d2!gna;(_sYfq}Dx?KA}EgTa@S
zt{nSSD9-zLSnR4D#4$9kQ|dVC@jkOU&TOI@tELh`$91ZjW;&eei=3_9#$b)jP&C{4
zit#93mwO>`#whAN!4RlFeyx*YXHATC{uw@WMY0b<mSAK^#U6K*)1cs(ib2}#uSpcS
z0X7ydDy2*G{xZW0QhUQ;r4PHY#}6AL3c-nLF}rJ6TREvW1b5-A*W_xduvV8;msExy
zu_;DLlQBNk(!u0!Y{2u$VjMf?(QSD0LY<gj|8Vy_zgs!bMKrz_BKX_AEB=D6V+Wn%
z_;#K!{qT&VZNgyLsX1Zu9A2Fh!G9FRVp6{jHLqxzXPS!`29MW=!xh{5eWkNw0lsf%
zrYlINt3mAr)iDS!ot%fOi%LEPA5T)Z5|M_ixhSpi4DA7->1NFfrErRT_09Ym%bEi0
zDO7*<H?N=$AwwMINMujIjte{64=A@W0z~~_h*zAj>)vQy5)rDJEcQSS8bakl=hvUo
zb&a@+8VA~|;-N^cD-}Un^Wr#NwTxJV<!$I5$ThkwN=BCOcH}~(4+W>w@?U{<Q4zVv
zB-n|In@=2K;?ne$BR6X@PwLq}v1<0{TRu-u4((S~LgM6TCI2uhF*BrjrhK0Y&9c$t
zg-@IH6gZ|+Cr614Dmffrfrn1WWx(21m6i}Xs!aD6kpD+1>cY|JIf%un9*9~a-IBE5
zx^nC^H}Rb^>#H%$3CGfM;IKBBRJwCDZ3m51(B#=49_F4AWhW5%TlZ)2OI8f3zYW0A
zmsS1PiHR@1L~%?f-O(J6iS<y)GQ5%mC<vMT6(!9;;e6qx57?56PFa}!>6bf;*4}8&
z79*)$P+nNo(y(h2_q&(dH2zHTN1n>k{3)I&iHQc^ZTL$;cCz+k1CPyHR3Nu|Wnj+N
z<jR!qkyR5_z4Qs}>3kuQGZAL~_VKpFufn4zdL%jXV+8e>3PJ!;<-q$X9kxhY!X+3(
zPq3pBR)8e{pq?$3sLiG^ypg?cb&JbCa(uD9sCr@%eO{6g?i~Rr*M=(uihGGA)tEZy
zf6)NNTN%0G{Hy7>_4p%tMV@m9K<9U)YWQ7{=Rq8(t0+mt$!xURwWgf<bK_`}HmuM&
zwL|kv>1$H(x|Q$n?16Y8lCza$T+_u+2rtF=w|xh(j-lkrCUgToR513%Bx^2FTygOz
zSSpuo@F<|n=H<F-%7TEs$b$Dx{N^3Ln`_cRY~-iVMRYV;*r<J;xFC{NR5)DtME@ow
zRY*$s<fw`Q5dv>S?!k}^Fn38K0|k`<Fp$2;hqb{TVb*47D;LzKOoatEflp&t!zGFv
zQ;wgl;mF4Ps~yeO;?rrP6(!G1z)9=m`R(@>BMv+=q)u$))Zu|nOgre<qU{8t!3PV*
z>Zmm?v--l?)eT<%nANXY288R-q5>*{F>zp5+B`#q_;F5`ht}Y~7)<Nx>A1MEUZtZC
zZp$^e_7TkvV*W7yVo6^u3pg=C0a99+r!~kWyALH{R#h0qx|es||MWg7czo}q7^X^M
zSVp$|Ja-+}Fto8tl1dy=+tZHpAdZh6l8kNv@MCXW5oo3`u2SHu{*d3J&b49tCJ7PI
z4mK4aA9i1egXnK#hnsUwjt7-RR}&f>Y0XBfWiC=po28osMs4`Z(M9P>X40`JuK-Q0
z4SzcHZg?T52L=pr><f$vnwVR6CPP?zv+jjEKl9Diwe(lJ<7to|BYLPM3pvLh9iZPB
zd;f36_>sq^jm_jC$TM6(X`_&qrYwhQDR+tB^tjwqVOs5oo(ZGk3MYBSFn{TR^8xWD
zGLBXr*}|B~j*pdU?F0gKAe<A_kg$=!9YQt4ImK7z+cYtjHd3-y?KNgwhgf=8v|pKg
z%EoVLi?*onEwu5a;@JHx)(aelxjEVaLGyB2t>~^tM?ACTBB8LFrHnUBCYWqh0?2|R
zO<qRTf95^G5&l31(rJe9Kr!rhGM6#k6=+0CUAv9yF6GdFvu!mqVMYk!-1x7TS`$Qv
zA6ksO(_NY39Es|<mvV`?DJl!I79Gk=B32N<TX6SDLhSNJq3_t=W94kZE3v~UN@AFG
z<}ORJ_n2o2yQon)EnQtyDL462BPLG@Z226G^9-yEw!eQ1;wuuDE-$1tm<^uHV~)!Q
zR^};L4mqa%&azOVC9DMEpk4&WJ(|3xenYS}t{GrngsqUKlkQY=C<thrjnTryGMPo{
zxqlhgMBm5;6&Q8|);<^}8563gUm=sBc3~HjW&)W)nu>&{Omly8m1i%Q;tY@yVkCt^
zJ&LNlTL&&VW`ChLyvSwHR8<w(qu0PUJT);=<D>V9vjn0@B!XvIcYlqO?rp{%I(}8W
zr1M=HqZ%}l!}^EFkH^^kOxF_t5u5Hysf`#U;rH7%SDlu@oA<AaAOoGS#8kge5sC8%
znIi^Oh2Cei`*vo@LWZN4cHe7}538V_c2Ua)K}MM$j44fLI>s1lToKFrIANmZ;WaE?
zn3AgWr+D>O_&P#N((90=WKWEJe80-v;t&fuVseppzBCclIG)uj&||woO}}2*9HXMZ
zU+g^YUtA>tH^PmS&v7Ce|0!qm#(s+C43(n1ph*;*CW8(xN0Wl66-{ozO>80NSgeLZ
zLDHJy?ddL2w?~uBtc-hFtjQ<vE_KO1xXNlpm|)y(7WfztKgtQ$qtjMLng17onncke
z+zX3_7B96pdNYw!hQv(qcZH{;kJ0iF8x}0pZ6AO5EGgQXLwT@Whvm1_A<2B7?uN?4
zxka^lxs7RUJt*9npqZ3+13$MrLJTAv(moijM>33JpTZ5Yo9_?eUw<3s_Y>ns*I%r&
z6L^Lboaacv81IaMT>VoEln&Y|%E#G&fq2Rl1qQ&?4S|=aqI9M;yuH=OCN4=I2G7a$
zXQ{03E8Eat(K2Q+jb^hL1jus?Us<EBdEyE~;{h9&1~)+^y;Tu_85FgOqJM6gKs+VK
z%Lw94=YnwyGE{N3j8_%QmS-GxU_EktSgSmzluwFih3IUehoXhy7F%nlQ~OwPr$OC$
z^-sLSo=KAo8@eWse+z+HZj*K>q<wj>1256SxELj+Vv$zejYm!+6^d2ER6kA*0)8nv
zXkLM<iG|8o4^tYn^hu$xX*T~f|2shkSD4<3BZYDy2yTYvSL-98qTkhw1(zFgD43JU
z9KdYG{_gta@R-h**<$QRb4V!WoD?3F`X?0yKB<va4xd_muqR{&&Qw#M2%SJUe_RQd
zXg8T@FsL|zR;Y1r%Y&ELf2FC#k^{@hb~Pzp0yEX1FWOlos@u~-nA0&|UvrFVU}JfR
z;@0KkO1ZuZ-g1?@=raaGk4eX7$?me)ggJ^lwSwtTdyRu>1PsE@A2{WBPsZy)L0w#d
zX)?}}1gS!*vI6^9h$X+ZU(GyRe@ASFKkLGQXo|;)-R9?4z~n{67gqiDqaifH>9Cqo
zsuf&;7$dS{8AR77?by{Uu70UTFG-8a&u%U=!NJb7_B4n(NM3)xj0#vlpoVEPSX>OD
ztxoK*lEm>6k04XX#TdOH%tasmocYnVymUoPZWYX@S0}Y5#sWbYMlN-h<6CZNcTPzZ
zqa#R0C7S40AT;3QVDH4fs)*b0=$T&JA53);0i{gwyTcc#9crdr!xVmxD~r^;e`!~D
zXh^kr-+L2_Ah^TPCw1sR!jr3J1deAFglv;Znp?xP36j7C%gFGXy4EmGL}R4T(m4w;
zLieh{<XYZ@AG3Rss-E320dlM4*%X!(mUJ5Qqgq1Q+*^m#WwKsgohy^XbAi7p4-Dpx
z9po+zD0o2paW-k)8)-#IqJN=_V8wYT1xdnpDFctc?Mu@0GhNon!Qjln3>h~DCSk)8
z{efU2W8WF>HW|il7}TMxywodt%>=WA{H%f;s9m@8ue$mtT^R8^|7~@e6un2Xu}DQ1
z3o7POd0*nJ_27m5RxEln3iHR|7Y+tw&OgkL1^BUduT*@aLRE%>ix=6mWkZY`xN0#I
z^PkH5hOY>fDox}>RN7UVLN<!l*5mtL->c@fV-N?NvZQQUG4eQ2B=J2_%XW<?G{e4d
zvdi<)80O@z{Ly4wb3Gx6Lak(~i=YtRsGv$0-p21gZ#*61sc`a(Y7;#^?~w*f?{0(b
z!s81Djm>Lr-rMbgKpK*;v&4)gc#?CIMh5$ItQSHV_dW+4Rf!pB%$gL+ry|W(n3|hu
z&=gJ*tH*ojhU@A(iN@|hm8545OK}OcElId#AIamz1Y1F{bJ$tuC<t7}%XkV`_#O?`
z^V@;Ae5kTn7%wG*ykn;rTx){rrh+^#%4D1(W?PzspXu`NkvC0-7xX~HSjk@Zut)b@
zx!qDXSSB@2>V(m+V#V|&<~($i;M;9=W<>TqoJ`|MnDgDA=)Y9%!f219ts|At;q!Z3
zLM1GZ?w@P8ILHQr-tJUr-Dh0lid~Q>BvVYiIog%DPEYaB{!DCn-BG<q1V$`<og}<5
zZde7AVjg;nifKMY078G9B2P7C?j`~jV-o0BwdUH=CE&(l;Gq)9<Z9}P2wi0KjPWyE
z|GD9UYdwNi8?8q&D=R2)x0%JsZ<h%-Xn-~;fz7KSPL9}F#ALf0+U%cm$8)TwHJ0i~
z3VIB?f~K2$#pZp~V)fR+P2%mG7M;$-UN%|dTQ1lB$u94o*K;Lr9%K-c-*xl}>{%I}
z@SKO=Ck2SPxAK&_|0u*lxmuU{C(h`X00h>$$GuP2V}mlpY-u&VB_ZvA>jy+_GUci2
zR`Iv}UKHQwIK@K=^M}Gldk;im@I9P-pH%&vNpNuy$faV^F;RAJ&ls(73S0ZeYxg-|
z?|z@yfcBDIkg@fcSWw+w<<|r9Ijra0_<X;5<&2O0poZFhW-7y5zlD7pzOvGJE=ZeP
zFRH17MmvxK{6YjXN|PnI6y%iNfV-C2o0dnav3)-q5Q9wAzb~`L2+MVxZvC>b$dmEz
z?O<G0cXHp$KkBwPL{{mUg~OfL5vXjFqxiWk*h7e#jjTqB3hiAOD4oe&8wT~XjWAT#
zW<QmQW!{_pNdF4s!9~Kr35(_bMXJ@TS~KZNoIpL3iClCg$d3ZPJJ9aZoQJfG&hWMn
z&kXr_8z~83@HMnQ1`fgr3O3dWv)sjc9mt_94c3S62^I<U1@`#LRO6q0ys8rX6{RpO
zzh12mu=jHkM1WFX!j1?Z`!l5{D)M=zZypSZW1Xx&-t}w=lXqRQ`+8Vc@7}6A*~QrH
zNZ5A=sZD=gmmAnf5fAm0oU=UfGQ-zK03oR>4@EdcC6bi()qRI*%{N9Y^Se|O44|zl
z2){kh4ui#==r++VLhx?wcn=I}d6zhFPQ_CP0~3)1Z13`ARokdA))Z{%K5KDS25^rF
z93;~*iK0wP51bkbhId@&q5dN>a{M7Lt-!xbMz)L?1D_<={vEx;h_J6dGLSzgaOwCZ
z^f&GDW&8$9zEo2yuOVw?Fipuz*5x=WvqX9xSN2@HoSuOAyy=Xl=}cw36?2Kpd|`hN
z@15IV<3XrT_sc~_MkD6Bcc|98oX)%44{zWwiLE($BsT<<G_0kbMJ>xI+5&=sK<=tQ
zYoG&MQJiU>NCNl?bDL?Jtb00nT{!41*E8Tas%b9MD3NRC7*-XKb8|7In`LUL$HbR2
ztRwC?>6T^O2H92VW>PFaKd?34Kv0(%ROP=J-><C~MW&LhF~k_IWK0u2%&teHGRY=G
z0uA42?*2dp<6}jcd8;U@et(5K=9ESy-~1)!uQEM4RR{3{u<m7e7sEF1x^BXEM+L9<
z>(DG}g;kFb%N?oG`#TgsumSwH){n*{mWm4EF?ktznGIOGFU4|A7Fau|&@%CjwkQuC
z@1KHaaLyOI#FT}8oXDFcGE3!L7&v@UDdtcj3AehrezxydlF0YW-|cc4rLc~;g7h1O
z_{pd`rtMc96C+@Q)t|~3Wk0@qR0f<$nwnacJ7u%0?55#UbO&|3x$ds-RCdeaCrC|c
zKM#C;gm`}hft5t+zO=p$>n2UP2tz8vf<GWgS^^k#jyiR*z~n}apmJMgH3?7AR)8o{
z$+h*-4lwgS)$KLJ0gR0lm8CY#36PROc419Qzel#F=fxWK3j5q(0WPe;Gcb|>r-aF8
z$)M{f?~`YkO!@KiR#%H}q<!!RS>1QSYvw{$j&rn5_8j6lWx*6lR7X28ZJae9YwAuL
zIy02#-mW{?i0m|OAiy`P=Z+g1tM_ZjEUGw2ffmFUL#wJ#faJ<ZwE@4rGB#CYjrng4
zgh3*!Jx6Dc=X7x@YaHH*!XF3DH5x#P?Lk5ehO;K0nXCw8QZHCbMz(M0n}JKbo$_HE
zk~gP~3I?$Gc%i^C5F!Y>ed_HUveEO_h!so3JXl4Pj1rp{fdM>~*sORA4zEbu(k^|R
zF>#qLCbW5kOA!TTO!4{d`WL*1g9dJYlB3UK7H8CT5)F4z0+Pv7X?tgubV2vC|2HEb
zuWaUzAQ+M6Fpuj&u;QlYU`rBf`?u|eblM?E&VP_f&`AQB=1jFdBxGWOeh$L~ry0oY
z8MRr}E;8|a+wVjCLD)D3%5Cm5jF(m(wSn+LBrf)U)1JZvV!@9XxMMFbbx39@X21t=
zYHjK(4;*Y|d%;Zcsy)oTx0qU=QUUB9s6*&cqH5`SM=j$`@s?Fp3V2e@xtK$eskB6M
zb>8cq=4f(%aJ(t`Spv<qKJ>v$X)w?+42?LH4#Ck4ZMwJN=P<D}nc0{!+U`1mrIGaT
zA*%-FSxiqmTgb_M@X&$L*Wkj_oc3(Q>1#CSklz?EIy^=zvOOh<Pn|t%+fQ|Vk!$Es
z?!9al{-w5-<+=HWTsLlk?9y>7dZyalm}--cW60g>1hWWQ<5C}7av6UBDbUA@msbX6
z%YEfF#+)Jxj42n2VU^+b$drtSYkzOkMmmLuD9lU?H5T<ui=Z@V|52n$Ue#D=<5!eC
z?{klD<@W)v%h-DGgMlvMc>47VG%sOdnTv8k3i+uo&V>COkR4=ZWWWefOnN-*;pq^;
zmWb$`r#Ru{uFFNgUG)w0ab}~l<T@hb#h3*1>EY-@<kJ$6n`GR8L^w^08dlRjAWOL(
z;1TRK3h)R)f9k{APm>jbW4nc%Lw9($xzT@~Tv3PQS8;=@5DJz!Ld<$q0we6~npdTe
zDR2g&)LW-rj98T<)@UZ!qkA{4%E4Wy@OF76|Jd?#{BIH`q#Zx0gFpO}h-$vx8EGnu
zDMg_z_OwjT@^-Px+V*d}o*@sz$rQ(td%!>I+xm6B1iC>@Lr}k{+m^P&d#V(hu`|@S
zC$UzN0`PCc`!Q=lJw~w7R9xREMQBB|Gz6I7A_)Ne+WBQ4)O0kd(cJKDJBK91K%!Lt
zNh6%l9RqYius>Ws*W!y^gqUv9^%-IeYSVpt+`~brpN$p;P7$-<ZGC9DC}3MKk8xQF
zt468r?ia1&2ghMyIpr&*B>_Phzo6+fhx25`wprgyP(e|z@!|K~k}qd6tOW#33cGuv
zj(dI5nzkVjWZ|++DT1Z<{6#_XzISBo2~hwZ^u1eB3<KSSqlpbL=rvw(9kA*|Gh#t>
z@}nQ625UYBHBjj&MdiXwVqFKPA5vK)X~xu*qV1;v=+q6I@i75|kNBX8I|yt1a39Ix
zha)!%mn)aCX-bELP)qi0Q%=R!WL(f`6axuCw=pz;&f+Gfs+{QNZkKL0#%-`38Xct*
zggsa(2ypiyzE}La*6w(koF3nn2|-3&L+^#in@eK?KJo)4EsI?9k;k9v4>UQ&!itiL
z1!W&^)il*q3%JTd9ORB129*5l5?}+beai6WQ_&2T*w?#f(Dd9}_Lr4^Kz-s_4H6|P
z2RoZ=C$6vrN<)IG5>aociWUd;TluAgW$(YTNa?BWV$W(S#n*y+Eu04PS)5aSu^i8i
zb59z8t&i)?0aww;O@QUXDD~BQKKG7<&(4+A$M2Uj&HaB2Bd2f$#&JK@^8kCsaB|=N
zC^BJ<k;Ehe^_upK1+!3R#mP9=;%CqbT%!s$jS5ln5c0Ud{>i7^z3#5V)-L$LAQ?Me
zewl<8t{qV<`feA^;1_?K$v{*A%i4=P-Z-WJ<4m|{BEQ}!)o@CR;t2nC#>N1{CbKtF
z|LnI}N3grBQs?xANLqfg{YXpPTK01cO?j``1YOf|4AZzB8*6ojVWn2g0Y%1?a7WP=
z`@sKVmob`52O;<&p>^;^l2yNAW3!`<s=wZ#qSX`KYSkqqvR4Q;cL|5k?61+C-p}dQ
zJBJVq002EtR=hh_I+t00eR;a?))jC39HB=q4;u(e)z^;tKCsV?F$l>1B*|(U?iLA3
zTz2l<)viz?DVQ@}*D|@Z6)=28^mguS?@idU0J<)}Jt)g6jy2=ljd;DFTyli`BhrZE
z-XjhDTd6idN)Xy6lg6L`%*9dkLb9Q9Wz=}21p=szbX^-v*ZBLlu~$)1c3fR3=RVX^
z<6NzK++%mha&neiUW%(^OnXgD++CZUWMOr&*WR(@HIVI3Hc%l4j~s;X0&7k8A^JB4
z;Bcy<S$N9ky<U)N`{R7<woP@)A{my8Fh4g;t+gE=P|k2G1}Bq`E9ib58^CRdM0<^U
z^_i)taA?=z3<q2=p0)LmO29P5Fy54cD;;@}>t-#isdc>iR%Bk7{@S+E2aRj4VN(+4
zyv>sZyx{7b-_!8aIERuk-kQ@$^#kB513y0MTJExy(aicU)+FU!WWuI>cIw}{I>C-W
zhMC>Qz2u1np>Df6sD4n3NHjz;>ohc?We!SYb$v^O_M}U{K<K*MkwAB5zRRK0EiVo&
zYD=P@?EI45Cs>|B<{X`WnwkCy=A73F3ql4NrdNcWHfPHAoE#%Wn<ua4YnYb-<1!E`
zT!--el3DC&gco;lEUq>#I7NCPUh;lMG9>jC243gkw3z<-z`4<9z}Uxsl4B!&p@91p
z=)9`~Jh{(T@+*#$L&-PKjogNp7_f7r_^BXjA2*LNorE2!|9tlifHKsB(?TsHp34&)
zM2-RV9{g47VMDO$2Lpsa&2C<9;V8t_)Y{;ow|6DtyH7QjR}#{tb?hVfAeueXeA+Jl
zVM|xY1WqcD<E=nNof6{U@1a7_W%SVQ<Mnig$j-0!BQe1D-P3&l^K_aF^ci<xg^upc
zlT@djA$P#RtYf-ks%MH0rY{whYc(AxKA~iF-drR+KjAK*V|=vo)&Rnp;Z222^ICP6
zu;AP27!dZs!@=KkIVKAN%>KR&Np!y*w<E$xeK|WdhK}_L(pwFVmM%K0^a(qkDYx5n
zKMZ|Wh4bzS1hY)JwO1|cM^+9gMU2W-8(M@-vk?LiMUcg)h)Gk+6_m+`S_E4|6`5V1
zVX5BE6gg^{LH!)IE>k;cDh{z;_5a?iiX^!666RQ)iGSUrzjv6i$_^J>h0AD!Sfo&S
z?}8`%(-z9=f)n@&U%p`am@)houInk%yI%mrZpj9hAj7<X;RecCV5O`4I~_dj@+2jg
zGj_%93s}re7w|hMfUI#8T;G0BKG*(5l-Iz(HZwmGaVdB6HM5MP%j}90mL8oQA>8r6
zWG)Q6zVq#Rz0+-U7s(lbiY}j&^_hi;5+LqC=~3dMRv8$Q=m7WAh-|EL)f)J5Q(UL^
zw5s3RX?sOl@*pdAS@gF?`QD=z4CV*l=c~cNPTQi_DBB6cCjDRJ9Wy9FBXo^fSnCxW
z@XQubT1FkkJr=w(<&-RpHNVL`$I>Y3rx2l2v!g)k{7+^ZgqLN?px?xzli?xK(Q)M=
zj(AaEM-ZTm{}w9jRD>E$`#+<b{f{FtNkzR#Ov^!y0bJ74--@(yahD_+tHf(j%Od0J
z-sK1qImu#N+g1g$<>U7EOy%-k&#Ke~W+OL5c>J;K8V6?41uR%&v?^x*+5|QTzcGJ%
zYsimDa}vmM{b~F+irOui*hu;=;;s})x}o5QeJe|jA2e^fCVLLw(~+g=83!W!H_+`M
z_wZ14w|Tcn7seu~Q;XcXq-#^oprZNT-SdL}U~{p%%`+=7wCu+|P;P<^gs>I@Yl~;H
z9~cbKGIrKjAZo?TV4x`S4-sM--3;1vL$2S;PbjCCMkqUklxSG;8(*Rf7d-sZ+nQ3z
zmP*mk&PwB9yRHHr3KdqC)4H)Nh)HbFsvRBxj^d;x7XLvp=wkYK7kp{^0|h?Kk><CP
zVY4>Yzz=_o&k*g={lbFjS@(&!-$Vxu8Qq>eV1wQ6QwlZ*@Xfag!^gWQO;=d*YTl`J
z(3(#YO^{}#2*ke{`SZ+knWvL#syARx!6(MkUOQHM4phSmgs}l$HnXV)BHL06=1$hY
z3bInI={((kMGkpy&GhlnfNj$+uM6z1(*cObAbLWjht`rj&@SU^XO}Xc#1EctSyhrv
zksWsYMCoZTz!T1hw^E9F^Wje|ePhPcuDDZc=Wej0>is4%xZcYP!^W^T61%BcPowB*
zF?6z8qE^0!0^$nFUcqR9%1l5qV=}Ku0Lrw6Ex1!WCa0N126VCi7>f~D#)vx;V9S~w
z8YUhiFhZF>?&kYbt2NF?r(fHB{*K=rGz6-SS(tixWA$k>4P>D!UwDzz({vp@Lhe?{
z^GMYyGmFurE5G20jJ&Syqz)5-^OaGLz(BXp)#+`~inTADsy1_ZsRf#$@kqIVv3b~y
zys_9{x#Su@G9>}9=pHn1Jb24#9Gt)*w|}y$9rcXR$qh04V#;#ZP8iFltnJj{Vs2IQ
zYDx+~uJl<-l|?d}=evjc*KKHSJ@%)cCw}!{H@*vwVAs3h6XfD=8{elbGl?DY5Y5AX
zYvJrrRU~4z&mjF%HoA-ui;nbvCmvhPeI(9fiNY<tCNw;mtsti!jDXAwDn|huM<BF-
zs4cZbQGx=@Gk@i0`PY<noJG_D;$jK)x`Hf3^OdKJBThhuq`e^x8#=3+7=?R+{;9p`
zxt4KIC9v|Ufog8qdT~GoV1v3zP3qrN<1mg2>^F1za;_c7fu2b5=Ph&C;H+x>g-gzh
z)(i>Hia8zrECJK$m0WzD)aN19YE_k#blDaYEqP@*mKDFoI1&e8mOQdZ77flaq?MqR
z0dt9eQ3XO;K0w2BFYOoP$uSI>3tS78$0i(m|ABMt=8bo=xS-R(TpQf`t@o8}UJqV9
zP@#sVBbX=)Qb_d?4~0P~ANKjTA*K);5KtUaw)T_z4lO66A5HG8H4!?~b6z;>ueo?Z
z(o6+Zqn=70*f%?sI@%dv6r-ksKfL)rtMGBN6I}ZjqKNc)zYxqTV~b#q`S3`_$d(C5
z{auwLI~_45yxC~*2J5^(ZX+PV;L_KMfKr^#ldCV=zyD~dogZ6oom*qS-M-$od}n#D
zWY>7)lm}PVu{Qg2@jB&d?C+${mO7R4JC=^n>L>*v1@Eyp*iy_cj+y1-T$HmYDp!JR
zW;2#Yi_ri5{Dp`z8&T*YVMrLq_?PLMys-fSBn^Yx%A%*QaW|iS4@9i#`#4$bdvcNH
zr`b`&7td2y4!@!hM6rk>no2`)a8Ce$Ie?KRJ&j*a0@a{FLNUPaM?o3~W-D^0UCihT
z(0L_>)H3T%@<>JrX%2|?(e^ey5B{uyH7^gl`)!Rq4s)kt7^yJv7L;Grwe?!LrQvqW
z49WwGClLi{Xwx@8MR{-IDJ~vA8+f)srB85>m|5$q1{={GF3PR^SQF0Em0VzlI-fap
zDA5>iDeo6Rg9H#Xt28e1wlIvu-flM1{nmdnBWmjUCF^*S=m@VVOU7U(pc#=L#3oLi
z*MlYv3-A~y#^5p0HaKd*ki_uQV@)W|2Q)!DtA(Jhgi&Fqw=w^y3jipIxQZosq+NCt
zizLGk;GQr{t+$r>JQx%3+|$VNeFC^^=6Y}ThIQ}rv9&?jX098~s#kGLhqj-GwpCrP
zry$91Wy$Krhq>o9Q>h38sn|P3z=t;cvOJ?IxGPuywS%i9QM)F8IU!k((G9&g$IbD?
zkJw@X?5gAMkOoEBy{v&(#{&INTW_hN+|`sw=3qY_8}~%mHv;_2sckk%q6Mt=0Pun{
z0m>(i(QtZTJj9L~B;bE08AJ#RCH)uYON+ad>i-hvIch*O|7IyZtE?imQF$kF>KsVN
zlRiMNFS?dcvZpt=$PNrVtM2}s<ht_O`?kgIdko_5u3NFT-;UDA7OcI^J#HI<&LyGM
zy4T#RGhg!Zjz<G_L&1$*x<m$wAx;)EHZi3b`Z<x?<99_@^WEa_&0N%C8_{Lk7&~!P
z^U5uz_Rxb#SMN8KTkiezpb<=JxBc@}zA54BCEGgYp+xuPpyg{CoqX#xFZAoE`YrV6
z{iNXXIdSD+iWcbg!f<Ayh+5}>iYXi@k_$v-_c1piGy^+|`~HtwSN;-8l<mkMxSmco
zsjw;zvr@>O)r1HB3DxQ7u7X9@`7;mzu6Z@;NF6C|eQij<<Fp5c0>}5<i@fP|H}T(V
z=P|*u)NvimaE=cOC*p(Oz8^XNY}ojAVC6LQ#;uHiwi6uA;lNoYcMOWfacY=^Xn&lH
zu>$HX&7!AD>eN5~;0LH5eke7<u_e2K9YEa?KbXWhm@Y*ku?x9fetE9AejXJ3rrbVQ
zs-PZC{JIzfB>&*m@DaY5AaEn4SONXK`8s6yb@oJ8siX7#OUv*ZhePlWe1!wnQR}e$
zI4q1=zXJpjvmlFo2(YXuvreaxwi|(x;wzHip|sW{*V}P&$H|}KDzi@a<DL<mr5!ng
z8(I7*S6t7rKOpn$EG^Gqe6L}a78n1QS64diAQyg3_+Lqb|7P3G^d2s%UXC8rlYge1
zR8DvFRYy!Bq9BD?*h4jrj8A{w1otCvHXGNPQ!O`L0gn@1F}w_@?z4$}`Sb(&{M*#q
zNI~{f{8;u~-v7RksT+nRPpRlRwyd_*$hzuM^a@}1#gaMi^`Z=4myJ`OqdZrht4H0>
z{uiO#WzV~!ra7Mr(uYbMi1W|H*1<0kbv;(1qxj=4g_*qpSi&MHBtzD6Hhk$ru=@14
zR8ha1gp(9QrGti=CUaJT;OnL)p;Xz~hvjPsB=Q_eJNV|kFokrV<M?i8`jOuQx8T{<
z?fOB%f1i=v&ymQ!&;8ih*J)E;&^`Z!0X{6K67YC9SzBM6fbNfN--m2Rc&$#KN-la~
zrebrL^uFv?XE-Ev8al<#xZp_3N&8Ny>Ju?J;ELM`e?JC1yXtyApjC>$^|s62%OXL`
z5PU92x4;-R?a83%z43jmiraYhd|sa;^Q8m-jRXNqT-of-NSk$PiMJOo8q?GPD?sFr
zbW}`WnosLLc*+r@tl5!Sd1}8u2PB1<n&G#39@Dtxbn2Xf;KdlG?5ss&EfgnklZfD&
zbZtw3TH;8n^~HN?bLgw-jU?<QEZ7*<g!dbEqFZU%?yExNYp_0$2)@>odk^<N&jJup
zADOBM5a$KbFSw4;H4ivewVjrCzy9rZ$U!FH<<62Zt;h8P$y;Bp+=jUpm!2XZTKTM>
zhM2z&Pv>kr@t)^s_}IH0<A5*#eo7dEZiCBuRc!Z*W1YCmuXdVBMTI!>i#46hF9=8j
zeZ1wNH~s<I;&{Pf$xJD&oz{b+kH3i<kA9uk69nGl&0gmbM_%V}%9P4-m{u-@X{#m{
zcghE>DN(YR<06E{Uc%BbrH!ITGFGcE2}E)gHEKnTI0VY_o8?VK>EVrbf<Krw2z7TJ
zJL|lw|E$d_mD1b@F&e>0qeUoSexTji*RzJ%IDT`MvN)qodWmlL6#tvK680cfo>oYE
z?6Vii=dn-Q8B1?czXA$pW5bKyd~9ki)BcP(ZF4Dn{?BXUzup5%v14Up<9pvh{x6&C
zKjFd?I^PYt=e@7*YBq+ldgg@n4$prjA?)GIhqeuAybKpiu)JJR;-n!+P(VVLYV5N0
z9WFoHE!s?}t`3tkAwyc_>R%=G0_;nvCB?PP$7F_#!x02{*UMCuSrZ*VJ8qy>_OdkK
zZwj_Vfto65VUu0J>b$RAVtAT(y*0jm*?4Gx%#~FgI1REQsR}`H5;Ht_(7qvM7%@<u
z+5<Ck62v)1W5c*(qC!ChU!)rf@RvCv)Wag<M$d4=&5+TG`O@1(SVod(6LkHnbP<!h
zmLR-H;^VWnaKum9u@mx5=PrGz<I=g>^JPqTbJJ9nxT5?NB=D$bIs~P}$<l>oWMs&C
z?V^LS+P*$PmKP)c{YSwcTRBY>gLAwe=W~{B9-s?`M_mvROxTUcpw^`Uu^?bxS<=Uv
zaN#q2dLXeqtQQ3q`%xBcxoJ1S>DOO*+~ie+4NM69*X;J%SV4vnYH7VY9=7cLPX;Tm
zj~s5D84EHKlfejj3_^uSocJMdIlPxTa5-DNS5f--2r-mhu|K?%isYe5lLBFrU?h+t
zGy-k#Rdj=ObCP2Ff<fH$6H-7UD8RDDyVCbrO1EZ(KGuJuk{ojek-@9-0D6a79y;9Y
zJL!CQW<Q5^WmRF~1}xjJq59F_|6&tw7IZ%rWIbjRd2hmHjnuyZ8LRO&5U+fm+W*rN
z<h=jO@%lK^^(|NJ=Cj5}0!KyKLC0q0WCm!&nDdc~>kD^~m6pl&1xs8Ro1lVOUG;q&
z?zTo_oV0V&YP4}U%Z-)o_7CUZ$s~&wU7osjI)R>h;>o^iSH0Uec=VcLsuQtiugdqi
zvip6I#^+xDr43qcV-CppHY^b&+U+7u_4f}x!9rn$b~Z$=fpedcAp>-26pGOpeK!6}
zx{VAD*dKC#D{ycVlSmfj3Mw_KSa<TY4O7)0RToMFVM>Dh2tZnG;j)1QxYDMbW4VEu
zy!K*X?r>pbWOF4;Lev>)8giI(ULg}&66XZQ92kq|o8e8L4!UXx>`ubq&(Vv=bTsH~
zXJ4=93VVI+CBAD2KEO6eVY{S&#ZAWjaUu(I{a-DmZRTPB53CIgt=VdIUk(>O80NWB
zg>P|z1^Z(Z;M;F$1T_dl0(_I6S6n;c1=SH02(|3~1s}lTf3<Rv%can7;0=$B->Us_
zdkALOc(1%mgRlM!6!pF4$nhPr)vfv&u-?|$cDfL&SFA$MkbQe7O7L+?rU>V^FdPLi
zqWKGHWeiKUh!xt9Kfk7eZPkRZeMYG$ga;^X4(4x?f}0Nm7<dp`<~pz{{v(HE>=H{%
zi2mSM33`CdV2J1M8t{rL#sHTfjG%__FSc@|HsXM6P>w@AF?<6CBp4Y0=Tm1EQc%{C
z1#iBxCBQeFYUEv4T@YY}Yx^8%j^%g5cq28M{ug<8U&8mH$oHTq>vNm<#6F?%_MZUx
zKZhhxxa;mq!PwXs03>a68Cv62V`LvgPz&PuOb8Dqk|>!SEXzDRo?b~@eGR-%Jn&*K
zn4MmAwL}D3APSCJr&$-IODKvfifdPLe{~@Kb$cAH!qLs-xlrvkczd*PQALdRl4jr`
zW?00elITCj;UNc<RVdVOVfl@IVCWFAE!a0_^EaXW8ix!TH#0SmWGbS&Vj(YNDhRMH
z<kiox*0h!EB$-gkN0;EPr1~9;(PJe}RE{33(z8y(KG?0Cj<*mK32y~|Cn!3Fq2V7K
zOWwe%1AhIfM&v~dn+SYe<RvXbro&GX+t!r^%QYasoY%z|jA(W#Zn=z|QlK0JsqAzB
z)!rADM~?asEf0&D;$1t4wsI2Qw~0CbRipIcw5xr^oL3CL|5_M4gT3$SC5-g{FS<~0
z6c~??0)WWIf;)!{^W3NJ-11zbN&yIxA2N8CA7LQ~)YMabS;kLZ3bvw&5(Vb`jB{u-
zs$n<rVZ=0BH`Q9T{u5iR?$ukjxqXg&_JfmIEF)IpOxPyn9VIj9bV-aPP@vM&BSlB6
zBv3}@cbduw;WvYNk&L_8W5aRrOPY!rBJ*o3OrrgXa3Y3`R8yr14X{!NK5!mZSy)c%
zR}{&D3FWXw=UgiY4U<+BiQ%{6ojl-{RcnL>rbsd?L7Voc>w3QvUB?{>FyujgKH_+-
zv5pe5SGj3TU=s&jJLR2J12|*fPF1?Q9L}I8<gXofU|uK%1Q0y$^|SF^!_AJ-w_90S
zTJGd&+IF%`-TfyXyWZ&sWP@<)fBsJY8Q*{){OkQM!|}g557dAq9nT9JRZu@CzyL8>
z=(U`*O%#?|2V8&IC!Y9jW&n4zO|TFd$-gEE5-tzgOeHuM<O#Fbf7cmioa+dTs@F*Z
zjw9(~99M^YpIs?lIFO;e#&WcDvTIh#ZJLT!nk*_n$fh84A28}E)l>{7)jhxecXbgQ
z3`0*K+Uhqd3e7{vzokES!C*Um@Ic19QSl@w8U1@@)Ff1SdSX5AJ`1$AYZ<2DuO{;S
zkv)eeBr9`kGE(wTalcXbiD%XG`D{)ILKzhFZ(hR8VX(YEeew?GYTTdFHYVouak1DN
z&lK@?tb#hl2rO4?B3MsZSy59t?P<}0c35F{$oHAXO-)VzVI8i^mOW6G@@pQ!D-pJ_
z{rmGxO2<Cge?=YSLxBw%(msp1?ruN^S(VM3>7NIe-52KDWjW7}b6@c#F|s@tPe=dt
zww>L1FHw6uVY9te&)Q&Hfj;Dhf4@Cd&$ANgPj@g(7hN-Sreu@zob1pH2LCzy%zG&w
z{_3}Ud>4non|j$d)Dsrdgdkoh&e}8<5pBR^T~moww^jqpPgbI%FqUN8Jd7+DW5cBi
zVehm)H_Y|PEwGC1&t}U4@*SrBe42&j5(&p1x5!z_=6p)gNCf&R=qTKmE40XL6H~q`
zqtQoQwM<O^NHA?Ln58kFy`zFA{BX=Cn#L8*8p&|TGnBALuDO5)jxj5`cD4CV5n)ey
zMsIqYRsNSxZQFj)^xu0_ChL6)8e;ig{>j={S#g7+v3>qa#NH1>4#=eF`)KAtL=a}*
z{%&~XCs_9P8ues<?s7d6zNoUgAr5KfqQ)AVw2$>@nBEK510&-(cXExPT|e?X<eOvN
zIUkF1$NbPlcgr&yzLM7xb~U8kFo8`OYNRtAIFI~-{TQg^n*2&a@heUXAN9U;S_`9@
zH<hFj95&LqgDnlH5frQtc5WCIz+9e$X^A{ybupW*m(TrYweO`54&}iin+d*lkabfT
zl|s8=ZH73Tm`Tz{>H-doq*@D8h?>DbYrO5H#i62Wu)!p-=}uj|n9Dl8WKJk`?ROY<
zYS*)(!2>V0d1{daKF8R0JT+{dehl_qhoe)-bX-{5dV*}goY$<IE32#d4ya^7TM5f5
z5E7Wb?v4XKtvvp+TM+F!`~1bH{C-fs$^0Kr2Oe*8vMKEUaRDe$;b5u8V#po41@#5}
z%Wf$-u!_^B^*IqpurG^*q5Ra&iBH;&B+`#HHk2VyCD0{U!tKtBgoZ>kY&$L*+jX7@
zchauB_HPRucoe{w6_h56gRBQs3~2I96yaEiYCshWU^;u(m3y;d_8Ph^%r6+-XEEp=
zZZ>dA@);~HXay-8Ae4v_vk4Gkk`db<Gn&p?U4;*jp(o|R<`jstp@7_lNk0;NOt#+r
zm1!UV#K)gB7u}e-hN@*Eu}yQLCtYPxrok3@C<911W&^>h2@&b0$WTEo3nWo;L}tKv
z3`g1AoJAu-Yg-kfJV&D73m(7AT;p+Fn4Cv@q#YNY`%9aRU<d|WXtk2Xm~b#p*p74h
z%%Dw#!>}#Pw|XC5qHB5e?{(yT!LeXnTl_~^Zx~&@PAT_0j0|8!CFj?}st;=b8KibZ
z3paoO39k7f#U${I4i4Jc*_Q|l-lFAwV=xM<rch7_^1GKroN|##I)!DBk46Il<cN5s
zt{~k!anj#nf8HUlU#G-$ys3&3y{BSZ?lCln4KEm?9Vh^`l`ix6C71PtfJCEH=M>c5
zo?y>yLX@3t7S5g(k9Xo0Aw2LH5jyOqfK{7~b012HEVQKjjf3X5P3WsP#lUQucr8vz
zHdta^&v|hoGX~iE?@$@(>O0y98E|oOW}&4tU}{lBkijp{(~_T+*zu>Yxg7KFiOt+z
z2e&iF`Q!8aWQ$>VG_pHrCRfmMdLn9!mRk%gWYe8$c|ELQ67tXnawJD#ITd~$yls$Z
zONQZ(EMjk+t~h>wsbv3&SgV4!#d-OG=M|?uDi1BY9eqjiN8PR4zp93(I2cqmW`T($
zg+PcrSg;QZ8vmMD2byxxmqCW(%M(^%wh8HCn|a{&T&3*V^{n*p2SK<9rC^{ois>Jo
zy?Zkl^!mWqcxO)Qvu$Rd4E$*_maC-)wuMEk(~rFZ{pPpP)5RU?7HP?O>xh%6{-&wP
zpNZ<>&!9olF8N+V1B+~A-b);-S-g8MRC&)=&W3rrnA_Vi^c>8q;1;CFG!;ySSJUi-
zdE|dSptq_mt9@Yc-%9-{2D#kXXXZJSXUY+B`iRQ`fHc;Sb&2o4aC3Ns&7pUYiD%Nq
z7^uqQB%(3w^NDs0SqGrT0GCkyxyvrwt>lw2z#i6}2;4GZtM*@Tkqq61XnTXAn2v?w
zdRC@z&OAjxAu69Gl6l3g`HLI2xbXt`rNFOYn3#^eZ_s&mOz9AEsjhO-NXv7^Lzbd5
z38I;_kT&nrZ;#G9AY<w5bM09{*^x6+2}{}JAkjI=`;1WBwh}z}!eifTzd?3kz2+tn
zv0E4-aDNRxiRumb8&biQ&4jj)xUsX0tJiL<k0BVWuXk4h{NI@%oa)jwk0JUKFxQS}
z4gwJq$xyi|{|8+`qP~=qqnaJBqh>~1OGl#@G=$cO%dhR9I|C5{Fajb{l=n%AOAh#>
zPATi1NR<z$a2_{EN=E=ts@0?FoE;|`BA#H%&}X7hwatPuOpd?%(pmZ{(N8_<e@@8p
z&OobaQ<bC>aHw};%D?{AT&ShvN$)k|yYgrL`oM*Y@Pt49p0jzmzy8K|&hH!~!T~@>
zW!06%M1pp7(YdMjK~!O-1f<j=E}U0Db(E!DK`}@q40Je8pRPeitvaW{Q$Bk*WB!ra
zE3la7;id?ZiV}H|up9SK=VGi{I|5O5YXhJfuW&@WvnkbV<vV|p#l+lm=gxn9+uScb
z^Z53^z0#Dj`k0Xb)U-9MAYa$kz|3s6tem|tU)S}9F;jsiAu3k@Y$IYs<%Dgmx6UUM
zfYu$OnTViiNrLf-1{G!R0gIKSdJ(M^rNTN}Vt&wYGJt5TtVM^UHUve)%p9=^mDg{(
zrn;a&yymuQb)hOGTWdoof?U{99CXug+wc%{2B(Zw8KPCypVK7t1^~#GSnnju!UVQ~
zL}%CBbK!so1qO+50B}k!GpUs3X2aBb!6BMp0N8~Cj2($EB6^m(S*{yC-?r`FBs=8V
zrcj;hKh%~Anz2@VY{M#IE3MHO@9JTE_AL<uA&lknI*gHW3ZV#~3Q)<;hRcRRrKPEv
zkGKDyGZ~5Tyj#8!@Zsdr2z)>rxBsC+n1XF10P{5^7WHxC%z&Mhh6oT1X5w5zfbjf`
zAax~;L`Ww)3UwkiBJ4~hMTDavpu+7}8MKeD5VIpxPD|;XZgfF2v#od+F6VxilLZ;n
zt?`_;5=Ccxgi&PBxgR7k^4;ZGyhCXcdJAhXUrZ`NJ?*n#@2k>DSYh(FF$jh87$m|0
z2MiMCw(jb^<1*uShEoYK4RzKP6cd(8Xsd%(#7KAg37c?E>p{c}#FgA=%7X2e&Y27P
zpSzRjxf*h?u^1=HTLn_Ah0<sY05w??)5y-YY@fh*8QBO<vNSaWTv`VNRv=_P0c80F
zKLcR<y=Opu`gMPJ#pt1h9xHKtp`^UKaaG{mw62yF00r7g>JyflYNUJ;7VY1wDP7jI
zm?XtL;lLb?q?E~oTbMgCm|weuRZX%ZO7*q@Au4yViQ*FTk<?3|^JNV^G}9Qy!@wN?
zpnW15SCJyVcf!X(!rJaYaKFdO{EK(*v#sBp9&=jK24rv=>e@!7`@^$|Hx?#8xdUU+
zl+bg=ukZW7k^eMsVHXF%MmP}R0FOnJ92QUqTghUs#hm_2b+nxOg`1p7@%dts45i(3
zx;GH)U9CoJPKgRYlIZ)Wwsl^kPE?vr0dTzJdk~OX#EMuoSp`6qW3nPug}MecvVznA
zWx9=~g3`gF81i&kv;6#@W|nXL_Nz|$Q2+qG>UEbkRz2eRhd2MO8a=cCV0J7a%&DQ=
zSG}Zc1C>)iQ(AxLnsl##5a$J|8AWk1(tA#NtQaIt2bF_96)40K5Q=vmLiz^g=+F!F
zga~XcN>hZSL}eoYHKHvcDd&jyb5enKC1_{8X^>EwE(|fQk^+tUe<c}+iLM}wjQJ2l
zr;>$tnbBECt4WRYo+I)JckW$0w&Pw?LI6G5<!@`ifx%FHVgLYay!}RWZ7K^^xkwb1
zoe8fMrvN8Kso)eE%SY`0URq&<khUw*JNqLBW6aZVuO|y@T1Oav77?<1#TJAx21GiN
znC-}P3Twq$u@(Ymx!u{cJ6m?TDdo)nOo3OQTH$Dk`8X*EED!^0p)yd#YKW(b@A%?X
z5BX<nA~aSlJ$fv{>ON~`(v%`X5vsAukK`<r8YxqXEiE;vo%PT0kSpo#5|IOuI$BjD
z{iX;7=8Rdyq=BuSRgg}Jni}2OhpGTVWn@NXR2i82XW-Dx#LR3nm1Zio@y*3oabjGk
z=n?gZu@Xgij($wINX2I6D~L!sT4VVLKS<lQ$z9M|K!q)V)8wW)%(&kgSR+ljU@MkU
zEMp$Mp=nAqW!vlbec<%7kqvl&Fc9H@h*Z0nexTEihF!@-p$Mg*lsB-2XzI`#JDrey
zMP(n-r{DS0)!zLiD$`U7baP~<=Rk)PW^M6ax3w0kx=L+NbS2VV$B|!kCQT`(77?FP
zOey~;l!nd#fmoPk`FTIF=g(h&=idI5#;C@qhdgV|T4k)NPgvWCkRmiQQ4?hitx!an
z5>yI`s-UMgp;$nZisG_oi?3l7G|KIh6boBgQ;I3YiE*~Fwz9C0T5Kb>fiw^UF(O99
z1l@B~FQ*~x2%-Av>uF$()LXVZ-fn8duqp8xOgffJ6_Ns&T1?%lM@@yMgb34jE7Edd
z%7XJlATnY!Y=%};d5005Hg#T<bl8Iq(|_HAb%(xp;KBojfd~h9IH540XL5s=?VN{0
z+>(<3z)Hx`oc80gNJg6DB1;_>?1@5Qf4}=z+Te!;x7}5ux-;Eem}Tvj=g4z6K}wQ7
zi)p%?x)UAEEN{O=v!cqJUq3`3BsEn=9b_UZ>Ku82VlsEbd*Pe@?rR#On?@V!HZ}WF
z<0g9Bh#2VQOoRf8MZIO4srdYzTIq?_6BR{0ftS?;5TOXf!U>KHVjKW3CudXz^EKW2
z;aVr(cC2EI0ePteW;@BORmk5hjoA5Oc0@LzDaF>_wWO^_m=q>-qs9gJM{aXl$n8QW
z9LFp}(E&NKV7yQ14V@5;pR|G`ES~b;Zd{1n>97Y=iYZTi+JLi+!A3ZsgI%o|1oK?#
zdd_bpwzOetjLvr9oCQG?iG62pDRCibwz{r3btS$U{XV0y37|?Oxz^d=`GSfuUgqn_
zvXHuBK92jDjX;%TjSe!A%Ei=7VhG>`94k`y0|-urufO%5l8O{d77v?j{_TuAl`4E}
zdbXkfiW6&<G$(wq#%5|&P8tDVE2|167Stf=OAZCE5hrq``3dNJBk6=K(FKbmnbh$q
z2uM2(Q5P}9-MFxKzy*~O0!kx#1TR(-dIXHz5j5KZAe#h{JS1QPo&MH`QZO)-jh>&1
zq|XQ%L-^-1J2(qw>s2Fx0@)w6&U3g!?deMgpmLhB|H|SpUkJyA)%LC@cv-f@weLUj
zuICP3Gr-_1GvMGMOxB$_!?D5~V=+$j{RSR3So;=IT{{Qu&V-~>=bel#qs+IEX(DT?
z&aFB|bad!G3#CabPX+6yP^!{%p->>O;thmt_XI$dw-YMKEDuw%g4nI!e&tDi1pwg6
zUwr%}&$-C4po>h{ylq>lU>a2%U0T$e;f4Vi=w;8oX2&>!vXuZdm8+U-0bgB#icl2m
z<f3RG3}qt3yTyn_GqoyH%xNoevY^VKCkifDB5~;jAdN^;+meI{K9kY8MnH=AN{6<S
zug@=32!zybE;>Hw75%Uj@tMJuic}YB@rIGhgbS?+Ik>}HPsg0JS=QU;@va1r(+vcS
zbjako;a{&#HfG^i9dK?is7430XkBK2IeudI|2>r$fL-#)NTdzvZ0QMmgN*Jnt#NDN
zg?2m2L_9?@9Re_>_4J{%&iFbDy5I1F>(U85UJA4VDCZ^<JYq61haQE`jz<-gh8S>n
zwOYVe-t?7EeB%@JMBViV$G-IbdyG-W>dn8MIw=<xBFGM9R;UWC3T+$MI_M9D)XY{h
zHPLD*(<@r9XuYJxKpI5J#yjC^Z$9+TKHi#wSc#^-dec@XtZlrAZ=1+9gl1$8CnTkn
ziTwG_+?YJWR)kli3R=zNwTOW=5Chx5Hthl^ePdJ<&?k+v?q5bybC<IwB*=EIPPP>d
z-ASDY)mD4%ciP7PSgHl%siz?AjcY%;$zr9qmW=;;DfVBy@9=!*1I`HsA{@{|Y8{+A
zmM0dnK7q}NZHn!-H}>E{AMYJEuZZk>%yf)`UGpJB-qE%sU2@b~s&EMj|Hj^wP6a-x
zO24MJ&QjNUP)Joml&h&H)`h7ns0<=vYACh!o?mchKJog8%>T+Kz5A>F$)7%b{i$mR
zE<Ad~d;Z(K_kDZ=p{_%=mZ^~zOR)->wn7%V-Zb?I>&#=;IyzJ$V5VB7<5+pR%E|D9
zn30-dy`<Pat&A#TTvd?X_0{>v*d|QmAa&n>n-p+&|B@NSS8ND0DQu6bD3XRtv@a9@
zoQF>IGNo>3ED4wMy*a8A*ap_b_s5jvB)FAIGP--8BL${M({m6nH@BjjN3p`u$|5Qa
zxl#u%JRlfUqXRnFc>9g(*S$1+i&~=a|J~#*Ke_JCc?7ghA{plNqVvJ;@u-W&>o;^4
zq;!`0$qhxLpgXD(E{sN=Ai`29ak5}cA<|UA3J5f{&o3#&bX$aK`N;f2L7Ewa&;{UB
ze*&eTax^v#;h3H9Kl7jc)iXYS;}=Y$k9_?l<A;rHEzH&0lh+kR<+%6b8!oXxb#J})
z#3j39TmtZV$4$#L+m;knD5-3-WqdV30E8_qjKE5^rm3iMs&!?i77%Enf%x))pbAA*
zgI3vn)nf&~=~TPF(WjrwCM~<9uZ`N<1-*DC5IQCkm!Cxd3WeSZh?wv?8D0Kk*drl!
zUhCF2>2$8C;?X@HDtHTH9F_j$Xv<Bd)<h9%JNnajG>*RhkWJfn(UT)bD=fE!o$lMF
z|Kfdz-~Daptcv|XfSHZY^(_oUIA9S32`jZT6aitLOI3Lrj+fB<5dg3jYEI1{y~$(o
zu{kbGK6kh<Z7sbM+nvB7W(5FP5!*n(#9zi=B{ocDldK?sx(*JEuv_=3<s<&W`4~dR
z;DmfE)izxKc3!|VqGjtnKjZqk;w4|PaclLJzw-FQ-*73df*?Oy0FLsU{*#z!Ywe+@
z9R_6UGn*?{u80N4v{Ms>Zs!O?imfaQg(NiImX-iANQLHv5g=dHYD6_wwzLozA@03Q
zT$}<yU!jSB%ire0Kng{Ott6opk7jCJ1~vbT*p37D%$y^Sc$+Fn9}%y74k9||(x`B!
zb~0ecN=NaYIIeqJOJbN5m62M+ID=nHZ_$gUGniV%Y3#x8aXqv*pBMpx9kKJ<J3a5V
zI_x6l!f?4gm~_C|#-JJ<Fb_ukSNIyx>WpmfNPBGFQW#I`5ziTbESN{UPA|+h@r;<7
zSq$j7wTT-^n7)I5cnSgldG4wha=gUxlGLTtC9(;u^B`5;WGITu7h$x9(Hhj)p150f
zHe!cXXsud*`o(wumt&%`N51sYB=U>LVhN$G!6Fk&p;v(}U%6&QS)o{RoQcp1O)2ov
z0#t>{Ry1?vw?bvBS+=IL)hs`nIsOuXDaDpzE3viMTF~nBya6^w8FtGVLI71z6;y?v
zE4+a1BQD}1CW=}NIl1Fk_so4;Q^D3Ew$&+iwAzX>DkFZ57nN{hu4f<Gn8eX19d)Rx
zGn|98>HAD;?RE!~<5VhNbg*}5moK}R6#-{5Odl@8cI}`bJ=YkBa6lj3fI<N2pE?1s
zaB<}pHnE-%{VAc}7671iI|0m}v4<<^ywiGEQL~-d{N_c1){K+Lch<zfMlx(l`3st+
z-R8h7XI7+XbnNyCM@X;=q5u`BF|+sGX^;OSvV7<LKJWG;uDjwP-*(CW^4g~~b#ARP
zMho-eVaxSBb$xGL-BVZh*0V3y)+({IR#_9m<1DQxYspb&XW~NZ+%IFUtSB|nVW)F}
z@eT7Md44o!p=>3lcJT<_Ma8{9F~Qx&+0xtxrL2LwL}Jo|DwG;g<ss;>Wj=sGsP+39
zIoJifdt+o+BgL4)D95!_M^gLzJWe&8a#(tPH^`kmPb^P`X+`I`!Dzclhx)HOEC>aQ
zxlrc5?8buiRO+cvx8AV5(As}FaN#+{pc);p2rfyA#6RprJJeGQMWtD*EbS^tdxY21
zeI^R6c<EgOwNeFXS6N54byVmh)}pB>xm61Lge}48LYQf3f}+hD*amguucNeDIs^d4
z1Z4@+gdAd!oeho;BO3=#8RZk2O^zVbOq@l_yUMyMq{#mMHUA$ehp)a=6!S}#;?H-k
zCFNa}dp7xzOa!E}sY$cZfPe)FXu?8`m48u$nrJii(S-0hJ_B7<mboiJAp~t@qdf0T
zpG|lb0yy&_eZFjDOal@S)7ynB{QvE}d6*?tl`r~RJK~(otbr;(X$sKN2MCH&sq}Sf
zzwZjPHe83-_#E0+8$SI$e1M=neD-qyq-||!n@O)v1)-(AeQB=tD{#0fmv(4z1VtN#
z0z^tFut2Dys<JZkMC|qc*n920B2JvlEU3yVD%a2aiZ~HFcI+68U;NgzS^4wgA!F7_
zFgG%(5KT&Vn8G{{?8?}2u%tHZ@znUZ(k4^HkwlwlI1&A1rKA;KwGA316A@Fh+j!|n
zGD(_9T<ELW%%r*!w?;Z~<TB!@2U;!DU#{KvpBAOFu(mux!yb(AmI=vWx}Y+FnfiU6
znL&DqA$*@xdQC=jdQf!K47FZUh+Q=X;u_0wYZtBRPST5>xw)++Vf8FTOhv(U4PQr>
zQg}7Hf*JLujbL&s4~)C}%5QqWJ?=1O;+ZK-Pt(MHV1g&0&x375gsR^9FK0gGpHBq%
z{wr=CKVYJo>23enLyv#u!7KmM%I)j7{^n!1J>j&cFaQrYa7wrXeC4M%&hVg)1V$*9
z78Gv?qXvU{D;LY0;-Q!d2p?vmmuMHF;H)Di6ma7X3_s=Lw@x_IK!FZ~IB{dVs}(aq
z1;mXeq$nRBkrR_Jj2|3|AcK*UnCr~=iTr%U&gH2vVltxQ<uILnG8O2QQhi@TDe*Km
zNAb~eB`YqB$MrRXqX}O=mNEy2Na5kfHmr0dX)cU2)TezNI)b-Gpvj2y+{v&@V5U(+
z2R481;<U^_!{js@LbEV2(6AFxeY6*<GPT-1qF3MeOM#%x_EEZqw=XqTDhgy2PVy^4
zg%Y(X{BfQ9Tp)&X5DO}Z{ifeje*#s-bw$fo)*J5(enGJF+cu+Ef?_G$GPmqtTDpps
zu6pW~$KU;beWRWp1Jk~L_N2i~uiS5<+;5^9^y)!x_5btCVnx4P(Jxo@d;5<U`}D!Y
zHR=He`4uMA4dt`zZ82CT))Hf4pxWxg-(aivHC2;bPx@**SKE9&%`t60>UM&oWEXYg
zt{5+h3CF`PVJDUVM{r^OissGdMk%$nQFO#(5=(&tR7C$D$$?sVe$5Y-XfH+lKx!4%
zQ+h0%niPAN{V8O1s`eC#-sw*)iWHslUAw3$tgNe;WzkVI4j|VNE*5qk^?(;W3V&}}
zyK+Pm!>)x9p<xy@LuMHIB@sP^+Ip40)jfR8gQ53C_bYN9T-azXc@BCn0*Hb};cUWF
zea5{2p#7qXi55W^cq)o$m2;qek6bX)G4=aI%u`$I-``RHVZDD~ec0P?ypwv%P%fi#
zIr|cI$#uzf3GV&T3$ChW#-8{$|GA#-7b}+3ZX9Kwy(<q|IeGVhdwpgXU5uskp4gLH
z-Y@p)Q{kv|R63N-EeWZA!iB*A8%m6FB)Q0TgT}j-Yvzi%V&*t^M@(Q>wo3MJV=mOZ
zPCL53bA2kt;|E8S-kiU4k`Y?lE%nkYH914}p{BY-T5-bR#%;?F9RN5Wgh5HUB5f8(
zS&5oKQv(`h{A$GGP(E%x_l#<atEsN|tl?f=_p?m;7(*y}^jBXsXW?#u5uu?QS`>C5
zL_zd=jU@C`{-iUjp|z?JLE7ZP*58gG%!9$q%s!H0gBPW=Sm7Gae&Rx65K}3tF|?$R
zOh7a?=9Vr2F&tB`@S8W(8*fK{qWaAb;0vw`)CErufC<#ae$TnOo*t{G`_=T=rZ4|;
z{K);Q2WJKk4$6a9R)d}|$C$$uyN;RI%fFtgZ61XXBomcIu}`nur&sRNFZStC;o?}M
zD2#OI2jV0pHBo%{CK<4w;d+|=Om35;JLKxPG3WY@`hlnj3^(Q)cP31+)OUJX2~mZb
z-twW56?gn%Vx+fD<5MM^R46M0#edo<%*}-${vh>#THjNdUu8{G7pnFyFK9Z{TsWBG
zYHG)<m!!FHXxANlt_`~u<|8!B1y+#=4d)2~jG_PozRpe-O79-#K}EghGscuZ*&8YL
zqe1GZ!*;i!H%iQohjKZwsx_0$szj(nvlb-?YO-@s>A0?=D=at;Ioj3S(xupEKOPLQ
z<zXVOfA@2@;)&JW-!Be+3D*UfP`Q0yvbLTYW9NOrpnBq|`?9Z?U4PZGda?#kKRn>V
zd*@x@d;9hRs{!n%Y9fNn{6{^f&RBBhkSbP+Q!&1~byLK8I!*YQ5M;ts#7eG2+R)5M
z$$vz|?8cm*_8?H{l9?PtF3e<HAs>`Nwu3m8!zfbVNg5;KGZ0ervd2-4+*bgxb1FzD
z=ICpGFA-AB)L8F39Y>~=h|dm-U7kwzGcvD9ej3_gSjkVxj4)Y5%f2vA1TO5XJlGzA
z!e4!L-z$z^L{T$)LPEVMLc{E!S(jyvD^Lv0$`pNDL(sORwzH7C{?z)GQk?U(L=5;4
zjz|FIlnJq-g%Q>j>H+EjSNV^?Jh_FpZ2>VAMQ|(n&G*;8Umv1ZX!#177^fvmd1^CF
z6#US4QTI^yRvi65>rK9%>etg_)l~ofOTWGS7web3;EBB_?1!Sq-VHW}@}a~`<$e>s
zrZCl?uZevudj{vIEK>ReGx-71lo#1R8uBFoDqYGZbbVKhOO}05?4dSFxbii#hth~j
z%yDv!BI!anu|tOA$|i{!N##Sqdf$*KD5i8YRC#zd^dpgLq)7t`RZnGLDaS+3N#zbo
z`<6+ztqbcJu4iIzL2`1sKJmK(gGrV@9~MHQY3{LkfZ1&p(W%`!*%6)S-poL{z%WH<
z7>UiFyLiRPvD}*aW~cmWAy83r)KwH&jn({bK!+&Qoj~it9Wy=6@&?MHu#v5;-A@bx
z^-3O8dFBdI1~wvq-LfTq+cutj7))GE^Y%&V6;v*%H{1>;lzlhR2eIeJ69#}Ed)zhS
zPk%CRFL|cN?6|<@tFJlaLobhU{GPYmxS@Z*7&%5s@aR2m!iSpOASUqk0XYQq;>HSu
zF9~8I=IJ`>w5WdM-<l<+mnr7_F%^!9-I6j~Qa>4DOeJ(P)RT#`@WIdINGS2Pg%U6!
zpCRZ^;+kD7t4&<_I7(6#TpHGbq|BhzUmPVMniJqK6-K-I8iFK6<U;3?Rt5afqo{tS
zBtlVv%z&R}G}(yJcJ+k;_a;!O6o}NuSGkPN>|bA_{G&OYajwVQtfmVOQ-p>&F<fOP
z{eOC>ZCK-6l6piuB5I~n7j_<h&Z+IYc2bFqq|0zOdx|9Oy;7X4W^d)-6y$me&bwt}
z<UEyd`z$LDJb<_U0j@3{_qcM!)?%NT{-G<u<f{_>6@Jiv_`iQ~><QDW-gknpdv#U%
znPS_G_r`N);u^(1V}1bkgra1oda@SDMX|Vc6nw7U9+K#T3PdQY9Xeq^=8=egPB_O=
zZpLCUZb|8u6jTyi3L=%@myj6dssI2W07*naRP^F*USamA!{kl*UX!m;ZTEhfQ<$jS
z#$1mkiL*>JNzzL&XV!@EX-PZg_R=!D8)KboRrXW+@UrL(C&d6q30OB~R&L&XwUCy3
z6O`AeC!9xxi5B_Kbv(%2=tUmqIiKj0OcX94avHM1(1{f%za#iulv)b^$v?TO;@TEv
zhF6vMRCd`OsQLbz{ZXXmo39OS{Wtz%FOwzA)_1FpOdN>v?G%sOKW?fj0E0Vjr-`LJ
zISFFFZ4w~fx&_4Git7Op^Y$%|f7dIhM?^gN<J-x3S27j8+_yh*_zH4N<jFA=0C`tZ
zy>*&MRyua$1*KADGc}PXVu)QAVAR2!7aVedJQ348iday9B-tFqTuC`pv3(N2mFGHE
z7)VY%%ID8SaQ%GW{eT0%Q7Iopk^&#plFZDM<yVZ`kwc`FjjeJlr0S#6ZD1rF{6npu
zt;R^_3+S?M&_jxMvSnPCpV<mJ*v`Yx4gszNjrej4E$hK7PjdS~oc*c4d=WSc5BS)}
z7V>Z#-}9c~m1Y_>%mX<)FPOLF6@^)tN$u?%YN<7&y@qK~3Nw#<E2OtzYqA3kRxM=}
zwfoeTPldA7Tu2Ra0IF(m*PQ@*PdY5V8OO%Jm0LOnLb30%nP2@90F@<tO(mhO_J7C!
z4)*M6`_Jy6o+AgKTJo%e$a(e*_>l4q&-LaRI3|~hy|F7XcyNZ~S{2L6=H&(vyqCmt
zF_$7RLJ_NIC(*=6g=50Si1SW>Ks`rgg9xQ|IDt@4)*P#Qlb_)<p7xz7CE-06U7#rO
z)HSANCG2FH&7~R`2$Se~eXiN!%IaGv?Zx>L#5KX6mv1l4{d}Tn;wXA?pYa}5%}O!U
zY&{AgQ+@;;=7&D~lTD^`PgrT#RWKqn%ms<KPjBO3wvy1h4*u!DJWZRb%*lubBc`EH
zL+j`>C5<bFP+EWhpe#`h<R=3}l%h}JmM`P2TL!<mJ$Ds7SIjfj*wc>yu^TVlL=S~`
z6UAV|L%k>LKmF6&sYm2!;;2<b%<RD~cmx4gKfIlY;X*1yo@<>Mu3z|>I>@$qYgH^O
z8iQ|LP^oiAh1{F$L?a$}g04W8D1+lyP4+l~eX2r(Vo4#giHq_0ZBS3e$?mB@N}}MP
zM?FBn;U~vPem+KC8K0f#H<TNZVu=X_!%G|0Uf<DF(MAqW0LPkeL(f_cTkS$HW|Ark
zmo8s-CDM65$w1K~uedN1U{?=}oZYV<@RPo}?_v;zyB+2uG|Yj`mtT^7J3x99q{MoF
zs8DmHsy1y0NoNo#hF(&$yHIv$Q!p@wxW_1Kv;VI-0!CQ^%!3&o%!J7$$Pwy6Fgdz?
zmSvNs^W;4I0Db^J!;{<GSP#TJJssY~Gk0y+_T8K7hqnPde&m5thLo78dSH9?!1n5a
z$y_Qf)pKLO1=k>4zewY&w^sEQl}ca7S=u4`4It()9OePS6cc{H^`x(-d_C>`6sN|~
zz|5+APGH2G_7@{R<2_d<#$w#L30I6e>QTc*$JBh~H*SR77Ro!cw#DkO@hG~cUhH2v
z?2@%IrmzBjz%B2cYS|it`~+M<u87Y;YsSH}Q1nUfvZE;alzJF)4YK}!2gx4*sksx|
znX_;KV2aSNBS?}fe~gcC!3`TEN3q~2%wj2Z9T{>%do@d1b@!&sh*cG{>3aoNQ48?&
zcEnO90N_?EcjNu)_rI6Q-CXRqLgYgQ??LP*2hR0-2k#sCa?A}jZb=o|$oXR2#g`rj
z1r~Uksb3H|xaj-?!HuEbGJ{~T?7MnvT`Vo&b9qos#?F-cC;tPnAAkr{5Na@SJsm<o
z+4Ts)kC*~CLF`2rMsY@QvrJfs&^u(maD8;aYszzTWt%4hp&q*ah)O0@r!AaWiZO^B
z2h(wE54C%0lVU`R(a%FeAV;_YXk@4AL&u?|s@#tTQx9i??JpHBZ;!NbdRo3}F5HWC
zq2B}Y2#p90b7S-6m#jGX^v0_Ee`qnf6=lv(?<BC!IeUR-$V_X~NUIh(;)ad1;g4#Y
zPlH1aOaz`83L@l`o+zK^y#iImbqyD^N~jUSM2@GY%L5-zVg5k^PfdY<x(0a~D~UXa
zF*Cq;k%_<dC@G!|!OzrgoTzXBQ|ZVt98>8y>M{T%33OB}?*}gA8PCK#Q<p1x*;N%1
z*2S)gTw9xYCZ`avXgVgi!f~2Bi{whiFPg}xkV)eKM6!)m)G(KXSjCfXF6>>mQUfUo
z%ML~fX&|w1Y)I!ovTi3*q=L9^7)Uu0txB#30N0q*x8s0O1;SS?+KXR8>G5n4WYMR3
zhSMdV9a9f$Ijrorz|6LIN$10e={T3Ye6QudJqkvIhWVl69Yfh(y5s2$L;Z6n;k6-3
zL|){>)~wKs^gF2W-VgI;XgC5=B^o)EUg0Lj{Ny%(!8JJtN4Xy{57WdLPfei!m1T_c
zWQJp&8PIq^{UYw-JqnUHBU4d?fYNBMWbzfek{Ey|5ED7BLqH9R<vns-KOFp*s2(1a
zE6Q+A;($vfVp!NphROuuBnn;ObOn~6nPdKbtmlRtiAsobBr)<V$6juG_Gy9;%Y<gS
zY(Fo;aGD)cQlJB%$y~y9!l4U_og)h9B-&axJ*HrK9)46~v2QQ~u8cEGg=v*KbzzW$
zv(Rb_gUN808<JI?k$edP=43=8zlDbpp<!nr5R-H8b=HWOliDN@b)GCZ-03XlQ*HKa
zG9r!j8eB*c(<m+~X&RFV<(CJ*g8@%Z(|A8>!IaP7YcQjvK!?S$v1sjdELjaqy)w8M
z0narML?gKn`r#{frDL$)Hb{B&(WdIS*r(^W#4!g_?5!-h_LPG!gLnfNzVewHImW*@
zm(u77p2<aWLM3;BGCu_#QszOCU{N{3m5`2!JwwSgg{}%}c{xVPum>DeGfFf~U|%t%
zkeYcQCN_vV95uBiOMIy-N$k6MBrTRL`V>mjX+-jq@1kfH4kx1Qw8J)yPDW(LWiQ_}
zzf&~qd>9cL=7r6dU$Ww)(?^IxArGP)ebt(ViDjj0R$^nlc?4#E1$J;@BEJq66kXWk
znE}LHiQqh2vIIna+qO8Ix<XmXJ2=uL^-I(>R|D#os0JzSh6prPf|!VCyok&(sHyML
zyO1kSJpywKH?7623DnywBK8C-Scx7za4MGfArlLySWG`t$FqnAO-595k&=VY&lN!~
zF?-Qmq1cO$$qHd^3QDEM(miR)M+oI{C1%`G>XYTsN_ChtcrknGt=a_2UUDZyEc!Y!
zuC61hACuf`=R@J3;#JZ5S5AzP=}^l-&B_fV@*8zzlA{BSOrOp#LjwNs&o_6Uz+!^=
z2n~A$I_;u?@Pa_Z@N0uRmLH*cRSc5dBO0j-UC@O@0J|j<X^UI3G_~{7+w;53IcAT#
z7UBf;3lNjzDDH%%cxFIjWqhp%E|ku>^5_vU{B#9kCQlAjsM6FPC^Qo?jhE4Lm)_=t
zdb%b;s<Re+T~ZyLLwZBDlS<SJ6Uarm2V!4IXpAC?&{dAaNnaH49iQ?RgZ^apaq4!i
z(GrDfR1GRpXP32JC>%q8oKB}PzHJWe0>!TosN_YxNvxx~{}gmu^z+C8p577}y(p1A
zg(Hrd#@3?4R<kRN{PsK;5gO);j*uCQV8Mh`aw;(*(7}RkgsKDPOOG9|NTmx~rqN`Z
z>-YTRWU*pJ+{AesPi;@$GKBX(5fzSoMd@80=42oyM<7O3MS=u)W<X0y5HmAoDg+@&
z498#ub6<Gt2QDF*O9%jaCI>KRq97FF5S0vcgn8!!`BP|#KyoQylo>UsNF*1(6jDrS
zOyUckv#5hOibBMw(4?ppHO7@pQ1Pmfx2O<LV%3yhNSr3a$R5GWl<l^SpJ_)Vo@?Lj
z)?=c%wwc*MjeQ!u%xqx*t_apnPQ8YERrU!$J=6T;LcC?eqeyhf9+w;W?b$FQH0%iU
zi=>;OhHO{?nGwC>&X!PX^~2p=wGP#>3$je?5*OLj2Dl|l>dl+<W;Z?-ETsUV&I3R(
zslbi(K;W5~=o*YKXAy`6Q9%?5uMUO0foK#}&PPtyN!W#1X)_uth&V*Jz~!PWJmaIm
zlhAMs65v%2fu3qck^Fd>!eY)lCq^L<!;vduLVf6)ViHDk=6FKb)L7G$dQ>Li3Pj-;
zTg9WdZk7tYfw(7!Zs^d>C)I#jjYsa7IJG4Tlk%fHvsL6jAeY+)xa<Q+^-H@grD6GV
zuQu{~%)p4y@W`NQedq*13K?A~US{Zh6q1T{sh4g99Y)<57Xa5y+g8{`NCn~FhO)>N
zOd2~8yQNEbQk*{wKRxBfdeK!C&NIb}BCt5qSST!}X1xcaZ~((I3Ls1h;bI*eB5>`=
z<y7%dMLWOA`$f#~3-;AeAtvPQd1eAvK3=&X?8K@_$%Ezs7lyrK1SV<@QKORf5N4~8
zM2M)PnLy;g%;e(X5^XA}EtDV6C)rL3HB&68ART7^oR~%v=Q?69Ymy~49kgXcRrg8r
zT%Pz4IfGE|*!)-JT?iMZuBNw$msFl<U$ZU(PwkNaK+#vyu;~jl{(CIKh|sVD*nIgV
zX=0`fc_X#0VPS1r?-er*2S4aU__%_AQQ3z~MWISyH90lCclBsGh&i{Rr4t13w#jG|
zo0+Duz8bj)Ax^NMyCTF2H5Bs#!+MscU{J4cCBZR~=joYHfJTz*L(%Qv>SH3}im6Oa
zwWz54z(e9%Bh!eQOEICD3zG<j#AIrsN)<|lBVuX<B~`}AhES4P)l$+-vlnHGVWm2y
zU*u%`933Ns<m77!j0WeaifheH%y2~(YKlY=KT|mG)$A%i6YADeJ;U<gV)$QQcTR}X
z_=HN9QU)$J@_Q8U(-tgac+4TiiMQ9I+b$YqRab$~Q30Qc1!sqIar&g(R(f+yT5UI=
z#$G9pe%S<Xn+$6L7p5s706Fn6X^;}Z(Pc=%XviQ!RdLZuWCQ>=(O14PfQf6SB6A)C
z2)@*k2<&Hq3QVjZX@d|&sPZF1Iz7af7vx<Mjxw=Bik(4{h{z>i04B=HlG(>ykU43{
z>PQ5z_i%-#@LaM60DKDLkx!tI|E^+G)9q=Hmll7bV1;W_lu*8<b0Ww%&3XN$M8IGh
zYo1FD2q-$|O#uLW))F4}78ns4b_|;@|HO)uPRqnL%!sYJ*o|d0UWZ9pbZWtbwkVVr
zUSy!o^=(}kkEg|4+`s^+EaGc^#c~OIX99RIliI{ye2t<xjYdewt34GC0N0)f@E&E9
zi80$R6KXuk<gudysklnyk}7%slua-B|Bwp22p4ib>nPxyNFq+WsVcCg42ML)sXh%y
z#iqnu@~p{KkieNZHV*=aTH>yZ-a9Eq6Td`qntWPt3?E9nWhNG(387^r3Wsf;`8g8m
zg-)4B2Sqh4;;->!<v5*?+b)a<AQl$aPhHyeQsck94n~BAM~7J$5f~DD8p`|?-%pg1
z!rSODkTL*d18I{T!y@U3#9@~q0W1?Gs&P68uETJsUjpF4AiTn3%Mfc{I!PiF?MGnm
zi5LY%4y)@}K875*Xkbjl0!T<p%?u`Dc1*-fQsJei>tRX>(AWu4@T*C5hg?x@v24VV
zDm@p*1`xu0gsunW&&vkV?A}ZKs+q~>8<7gJaRmmu9;FOGJtioAimtUxP)c`dVaVyD
zL7bvGNk65Gq?@nI3?Zb2^v%s-IqiojbkoZM5m0i_vfcM?7!ewF5?Urx-z1*-fQV+P
zrrqMg)Oq0~w=a%EI+IqB^P1++@XqWFJ^z95oJ_zJ*7ZvYbeN2y#9Y^ItPBMNqIHx(
zWdZo;IMm$C%oRuCBt{V?Es`V(pkbd(XIy#LbBM3$sM>^bqZ-P*m~Esf`ZU{6k*k-*
z`JmE)nBfPBq2mM<u1|p@l>?B&)n&P}aUh5k2+{UL6gmXS^h{yTNTQA1wN0}n{-k}w
zBiQf`Ld3BWtpxai+>VaNXkO?qjr@J-u~zMDm%|e34Ub7g>u4vUOvrDy5zVx9H0&Xq
z;D)@34QlN2DJoq^MKSdLV*sd!CzoTcDk@9Wr}F#-N)E4E=K!YhUW}SSNMPVNHm8oq
zQXz$+#E4xfQ1V}9tqKw&aZ3#Gz@x8|*wM(3r({!2Gf^PwKy4&!Buk`&C;iRINSKU@
z^%O_{XmAh`r<hd{?r0Emin~dq80wXCK0$qvT7-vqIa)VYaisDHMsC(-QU(asG)U@P
z2L&r5YuZ$GmLv@y6aX$e_QBzmhP@a@god4tz-LlgEX1=Uw8J5y3u(6goMwiGH!&|b
zmu;$@g(=G-PmZC$RYhe-fS^Q*x_k(h7#wAN6$)tPMmiNMn^G@AS_O%;OVlP8M0vl`
zdIFdSo{3%0L6jMFP*EZvg7_J8eX=MG!5k!?8b<O9D!GUhBdYIJqK)9m^IBz!v6o|#
zz8o$~@pf<e79>|@JWevAW&%t554jA<PkZfw9R{Ujj>fqNgQhbBE;s&LtS}-pJQ9o+
zg+p(oWY6rL@OwBwG+WaeNVZD-a!rug^WqqWxsZXfMBT}SHT817f3T_1@F8+XTFb@b
zL6c!%v(f>aJd05)X4@XJE=(>tYLEsMgqXd~u^MM1FcVQ7X^s$9W@POcSwJcoC~=vM
zlPQ2R8($MoG&1~Tgf3WQf$*JEG>nt^Vx=(AY@uz+LD@Le9!R4X&P(1tX7V#$Zg$6U
zQ~!D2Sa}ujB3lKYKkg4*H`=g>U_@xxiI`p3$(%%SI`9yK;aU~8Len-EdL4So-3qdk
z3tQ%|qUg4f&dkJIz*fhe(TvfF6-VVDtxbTZ!XZsb0in7OJrg2GNDOvRorGNbkl7yW
zu91Z}>pTy3$_pq#m_Y0~1!U^^b%i8|3WN|%$fn4KDLge~ZU{BXMHO-DGIz-x5LabB
zw7M7hXE=!ZsV7>}<l4BI$$F{pQ<_$S$;AW@3^f~x&@9|!kAFJufqCq+H(-2xe0q91
zEFW>i5x3rY>nx2Qdg!62J?&|O!Qi&rZrgwV{pZvF^z`&cKl;(NYuBz@x9-qG4?W?8
z6W;&+_b*wpWS+ybJVL|XgrQf_sMk{~{<Ae%fi%io=(_}BK4`=4+UCMxL@tyUbIL?y
zjt43n4ZWA+q0(XW>aszfTzeu$sJX3cs4}>geEC4nL~tB+UeYL86b3z)PK214JhMZJ
z24$!@`~XSPNc<;W!?-;RBXM6tG6ix^{<d&D6=2zj+e`|wVH1|ykvL4>|6vEHhOC!!
zAIcXDlTknpCm%UPj){PJxGS`u4cYvKWAE=8!rqLxzV)qDRRQ?)r$0Ss<Fn2>>%RN$
zyY$ja=gERoQ&TT~@r!S~@y4e={pqiI)vIp4`R0#&<RjNybIp%_^rQK6;cf?U=gY!i
zm<N<~bi@aF$7-FTu2s=+;)DlAvtT0A`08&QG*2X}8zf&-c#l?t=6IN#Qz?T?k}nvh
z?vo-iAywQ1EC$u&rSmcEAry`&LySr&!xrmzheFt~nUmg}>>``AC={C>Ll%N|giLl3
zjw?Nc6G7UAB(6v3meo%g7{?>V-NS<Cur*aTO(jO92em90fgl!0PQyluVG-{mi&w9)
zpnHzrA~mGYUAyzNCMfMtG^g38a3=uZpO4+x{U9wS5Yg<4@cQeoKjxTYp8x#kfA4$W
zb0ex7w(!9Ze(=2W&U^Q}-~F+Veat!My+8BJGcUR1lJ~y%y&w6=N9NPRvbSC{-xJsw
z*m~(JhgTXA8Xh@>2xm1*wKq0Rg50F2mfvWETQOI>Z0@TMnhLUjS<{<dAOc4^6iNtz
zIr@!XI8B6cN{95O)-20D@tF{nv_}p!r7(G~i_9eD)|%9q7`OEk!#^`?5<pJqP4-Px
z6bBZAWfT_%N2cP-bRZcaC{|C^Y3agkEe->Ra;C0FA;~?YVZ>%#L>Ttc3+%hdFVU?B
zQG*CG*ZMfH)Z2eI{!^Hp2qz~epZUyZ-gVbqKl#Z|)~s1G&pw~^tY_VN>#dtNZyp~X
zPyMV|vEpe@d)m!6-#nil_5>m{)2QK5Vm{89R{I<e647ZgV~!Jkx7XLIL5jX;*+@B0
zF_F!4X(6>_DobcOWS@gnlb5dcq4dn`!L6-Pipey_s3g}Q*Pcq(h-%4uQNy|$ETVEE
zD$GW9(I?IXr|N#DqGo9(!X(+6^}Z1Xm!`6BACW={(==xj*Q(f!I$>XlF*-!J448Ug
z1{KkK8w!!9qBPm}na(0oG*dxb=fNq5W$=({A7t7}K?(=2;Z?`}e*U-05ODU{XWx0}
zou{9E`utfCz#Vto@wmr5F0mkhB}<kZaKHiU)~%ao4}SaZx1i2T{2C0M*nIgXX0095
ziI#NJ@6ur_=MV^RF8`%SN9NIcb{a_ak(tVpdL?=}kAfT#ks`&;p(vyo>B<6SL1mF8
zP4lP}R2!>5gx5PsZU}L78dCaZ$OWRKSfa+su=+O*PkP|=QwuHRYo_*-G02eM)EI&T
zv7neE5%#U%E9Q!mmouJGOl(*E7eo%OAc%<5S4LUP2@EPok8SAQHZQ(x{+DC!yZX4_
z|I2a4f;)_#{NyM9@DKm+M}PE3ANtUTc4)^#4?T3lh7EV!byr%me*O9l8#b(3wQ6UN
zaTmgf(D10iLPgzMXW0>eFw!Ho(07z}8#bKk10*)!;Re(zsoxV@sH`WTs;Rwu9zpz1
zSs<q*s*`GyS*t_<Sd$_*_&_);vR6A9F843&lC6*7h;m$3XB*1Cd1P9Zf14~Qk)okb
z=_;~#;h5p8C`N?>n<5SH6&f5LbYvl&Kn+qYgq4|bRVdZ)Q^vp-kG=PQ9CPp0$K2Q6
zW|$wUs(R~N-|D?zwQALxHEYJl$B#PdsE>a1qg7YxZ40NKdMbc7yx|S&*RKb#apT4}
zzxmAoPCDtNT|Mlb2=fsd9xYb<)lfnqbuvW)w>LGTX3$MkBNSt35MpW)bs-w);w}w2
zn4MdIR#u@Z4Fe&_g+ZyxXzYYyebG!hV&r2ul0X<1&shp@kt*In$OYe9P_vR~L51w%
zR2a)pm`t~8FfJg4<b*gE0OUZ0a`mO*c`t!BjgS^G|FSEPBW0iicEo-eD#j&eo^qN-
z2cBGN*Hb<`S%?!tkwmyCpI<nHat(4LWJZO_{C~%7Xg>^wSux5-c<H5=zU^&q3(G54
zuB@tR>(;FRUi6|DU48Y{vunG$uFpRE><@qV!vGFC=%D-VyN{VqJMFX!F1VoRn#*b!
zOWt_hBRQEzipeh=JG{~qp<x%Gr4hM<zw#yw5$7Y&hx3bYQ{tj&CM_HlMf1RfAP{?H
z!)~W{<EFOr4A1Pj)yXiKhj@;x0&}J~jTD8lMto$A0kLNe#k*^c-ZjxyT!(U`@{PbT
zuOnJMiHPK1N3l{(*vgrA#7LXU1Bj$kGF#RB$$}4nui7hvD1`dixZiE1NGM|aFy^(#
z-Lv+%dyEBl7Pf8M_Q4N+5Wq3V9COPpw><dZgPS*R{>e{%^1SCg?|a|--YKV?GW+fi
zJ@n9Te)F5KykWxz?>#eb+O+Ax2OmpidMsGRuqzSXj?OhrTGV{=>Go*kziZ4Q2Lp7{
z-Uz22wYM>Vm?qJ^9|26gUWokUs-j*2=8hr&x_W95WMLv%meY03^Gd1usWJ?prl-JA
z9$_pnDrz)o=pa%Zyic)1s)#5Q1p<;%IGn@I5Haj>`L}dP%0*#_!Ca*&oFa?mtD!y;
zQmr^&h50Cw&6>eL0n{W{vQaWe?<+O~Tzl;AhHt6i(c_X!F1h#Kdtds}mww|L-v}ua
zMD*O}KKHxd{qD1#^{i{Ix#nwM``VxV*`IapyJgFkm%Z#|H{Ep8Ti)`PGtM~Uu)_|!
z<BmHnzWCxRuDIf7Kl|BtzVn@xD_71r0Nw)<>P-<E9xXOs@rgNFcpvk}M^uCXlqeK3
z<BmqNK;E$$T}M-mK}A7Dk%i72`%!mQ(ox6oo@)*h`-Nk&nEJAIlAfcRP>g~(GzJp$
zqC_Er-Ipl(N25Q_4fQLBQ=%}(%QzjOBZ7~#Pfk8Pk_J^C$B05-Dt&*O-x?r4;B@+F
zB^BzY7SfzMx%Q>&uYKunuX*Wjhc2*T=isWVt^#o3g%`FG2gk?9|K@N02Ef<9{`FD&
zUUbn#H{Ep8>8GE5#T8eqS+i#O^5tvRthxO1%TGW3^k4kq7Z+S`!LA<s&Vmu4VWE%+
zFTBA!=P&Hqqx%;|@YS3t4q<yy&@9%}A*KQ&3Kb4^#959qyh$-cc7RgQU(BT6`@tre
z$tkx7YOsgOY?t6tAx<htOs2_#+89!U4!OluQD^2;Pqdc|svx8QnZ%LvwqpC~v`6O$
zK?+YL0AD%g?ynqk_m_`ZKi}RLE3UilIvT?7ezybadEL5o%a<=d>ZqfJH$DIP&j&C|
zI^Y++@C5+poO4cV{n=-q4WZb_1k5yQ*a_Ht#V0yKW;8lx)&)qS5=l&p>HXa@0OpmQ
zXbC!(rwc~hO9Ek_%Z8~PTXnkCrttReU^mJm4-Lay^LZ35Rr^$ZHhWH;P|VYhMnQ_D
z+L#ccW};vNxMmbFYeW+C5Hkls<bdF$ba8dGafZDpCOJgIsS6Xt6PSZQOj8f$N$iQW
z#g*$62s32CcIvc-?oTM;R!`@UnPQA$1=Kp(UGcSJe=~HU4YOg%k|jqRaYSonS?<7#
zeQa#Z>B(D~odc*l%JW9tefQl59dyus`|a0SzyJRGuUfS##F0KGU_@wGK#U@@L<x;T
zGqde6niN3<IGL4Dmr#i`L=v~5Tu`ycmbxLN`r5Oc1d*b{Krk*=lS$<|^FbpoN4uk<
zd`7dpCjk<C{Qv+Pib+I4R7us($bqVV&m3lZV2Du7(@c<aF@`qoFGqxoC>$<%3KgsA
zX?QaW3PbWtC<rHgb9NJU-i}e#(Zh-P>0F@ay5sNaXlIxQUiiWn&R#@&POMq8=KAZe
zzvrHN4msqI)~28T{O16k{p@Ft+IRKp)py=`=U_1C^?G{!U@&;#fd>vh{P6h<fM>>b
zeAGJ`W*Rjt6uPU1YSQa?anf+JxPtPZbEN(no-^sV(TV(Q8}~-oLc5HA&GE3<qzacT
zuFUyx%9z+#;F=RfHR5m59F8pGgfs|-(>f)vlkzOez=|-hy>c`HJYYXy9<U#HKNA<y
zanoq^v65eqwPDkPy_y|FC)elyXgwWErVZnN9sld=j=#%TaQEVvV~zoE-g)P>)-&_p
z{oUWC2A%lhKmOyvV6b-W+SdBDYu642gXcWwIXio>y9!2xhMj}CLuLX-xs>v|axN!d
zs43HwjorQGax-1BZq)D?L&>$edULY}-O$M#>TNo2hLEs0`2tDQo^|I8_KLZwL6e!T
zn7HO#gC_E2X0H~LNgKog$at8EJ%^%osSaq{O$drCs6HA(N`7R-JjlGY<5~%>|1Wo5
zf5NZ-*9pIdVGqE&-~H~RjymcypZUzW=boD~=%=Qp&OGzXuYdjPC!BD?D_<Fla~^r*
zku3}A2R`tDB}<l^dg`hF{_p>uR^D*K4X2%U+Su6G``-7y1v`sJ2{Vlv77(4D!j=V+
z^oH3xY53dn1bE!x(i>r7mGJ#!qGaD~&da^faR1~en|4z=1SPj%!#dhF#xkLf(>5^(
zq0VO<1Ix5W>HM08)|#nQZbHN~2PyDEc`ha|EUdCT!c~mbNJG-PqhU9ppQ(w`j@g}?
zE_O(b0D%YX?+XS{=QIA+f4OtywKeP}jE#+5ef8C^d)@2KIp>^DfBMr$AAK}4|L})D
z+_-V$pZv+6eD<@Soh3Bvu)_|!;)*LyKKbOAyyPWEAAR)UhaZ0Dop=7|M?dQIdY}5#
zr;a@G$b~$SM+2)YW7wHk@s?BPh}#TrU)_X#b4^wjX>y;qUZ)slLRAm2ng9q;aWNs}
zBzB^9AvsFiD-ads5-lRDT19FoF9QXsadQ3{%hQBS9+3Jh1W2iu6u(0S#h)^l6Lk5Q
zAn}}Xd8WcNamJ<8e=a>EwX?%~4xXf3POLA3RCET(R~JjY6iCZFs8ffe_mv_wMUV8g
zjoO*OgAg9WAbjVQw~u-p3=4@_W}ldunYrkqi@y2IZ~p9OKXcBlS+nL9uXx2Nr<|g5
zDvmtz$lGqaZJ08C``h21ciwqF{_&63ty}k`Cq3!8&wcLu-~axnJmo3#9M#y%fBuNi
z=n-K0e?D_~r4gZFXJW-$PR&0?F{0+eWNuT0C;BFI(jcwSpwW+B6AznqX)I8K9o0c4
z#8e1O5h0+;n*nH2W8q|3Z3?0)Hsc}MQ@v%nWdf*7%9t~yrG2HhNQa3a2~>!OFwJ@x
z2Ef9OVP-*Ho-GzpQ<tk*7Y)SZhzGT%JxSciMcoQ1pO!8H$#(`3fBWUPbw2<GgTkIb
zgk~Bw>@w(YEKQ2Zw%PR&7TGGLQglFcVW*9Bq!qMlz3;MB0%9^vrbsbH>iu0#7m!*o
z@ibE@7BPMz+e=eeY|~uI1XP}iJOJHsBs`~9rYY%JD!@=0OE9mBt(3E^R7%x^<!ne*
z=1>_UgDX#@h8T>ZEU6daU?7?9o|D=5yT?DOAVz~>;bBB**qPY;kDqLa!h~E_o7!s>
zW;3dC7h{d!!g=+;ol&gHjn+DrbV9un1o%2Loc2(n;Y3tExt#TvkC1(nF&c${n9T>#
z#*)O%edj|{Tl0132tf=+2nZs*O9<^!1nC_vO+b3DQWZg(fC-3H>AeK$3L;IA8tF}t
zCJ53I5NUFe7JfTE?;r8zL%t+AXP?<Kv$JQdy=K(M_e9LvhW|BY=;c@@Pd~Hvo}6JV
zwExEP)=LXY_KppHXFn^16aT3%Ih6Z!;Y#Ds(<2(pT?UX`&}3@F*xE%WMU}H789^#m
zafY663hO_YvW1I^u?Eiz1n$L3qfgWy4jC!KMf5FMEOaXv=h;(bUwo|iH>Sqe&PvSj
zl}lT}C(Z)Zm`6RGJs-OqAR`P3cBFbWu1}{TW7wzsvaf!DbU@*)ef^RjyZ(&sWe_lA
z9{XZmZOZ?YN-S0dDFtn!j4dOnqmGBUwe~}k0*JoAT0BZ}rzUG-hl(|@-lX0}QGxC1
zUb^MDfA-HQ^~*e7<rX1xbkm->Mis0wQ;vsm>LZl`9`q|D`spiR^hZL+=Nln_H6JFD
z-$0JbnYm841sDy~)LddkPpBZ08~U1X@y6=vestE(r-an1bc1`^{<LZyuTQo|&_&DI
z+V6Hvow;0P$g#YXLkll6sGT{tbYk8QaZ`QSm-Q<=5uBAZ*7I49a=E=G8?J;(jM)Rq
zT}!!~)KH2{ImP|*=3<L8wq!5afrQHhvN(4nf}R|hn(X=8yOzehTHWZ1<_v)Y-%^7i
zA}*>V>g#jEZhSg4IWG_T&q_F7&9B5>XKzoT(^@wmea)@SEN<Z@X04B~Gk3T;i})4s
z&m74bNoB2bk)r)4C~=%dlEI5lNp<q7(M`7eEHJ-RU8(oJ8{#edkL7O$a?xOV<*I69
zZ8z)><wI-j-#96djX24uD7glvY49(5x(Qoj^>3R#zwcgHnQxjWq&s?(w?<iC(aATu
zm_+;vtkhG5swbJvH~#RB$ntBE*z@FZq80s#A)P{~j_G%i*q(ss?SJ3vT<v{UEK>5G
z)G*8Oh33Z7xWPe}bfvS+o1ss?Y{!w&1W9SbnCMA!1x>-ji_mhnIJqS$A}n#QOACXv
znBM%y`;9l<gwA9*^@EXSVk$h+qUeWKc-Dve)N63`Z?7^VmPxD6^`G`auj*&)G|m_O
zt7y+8f|Bx{fKBtIS`|5sPxcidgO7WB=X?&RxcOP413Mn%Eu8n<bZ*Th$LW&Lp0)&0
zrv2+R<JiY0%29V4QhZ{kzFB`?HF%))u&wgtMAN?Lh)jMC+7`4eQWxVf=aWnhB^E6`
z$u^*~sz_0F<*Gb-#a*p6bnX3d`R7<@hgRcGgt#)woi2k}Ve3QLyp-lzN7zq8`7zjx
zZm4sNql;Z$Xay=+hV$F`EGyK~D$;hk=$Pk;(CQNT_mG1<piO|WjD=I8WB|=V;1QQD
zQmk69F)<sqiLA~Qhm@|}hb}ZW$1hiSvzIX8+)t_BSL>91?fsfWyfpb3j+V-JpWBwG
zQuy+r!K{ovvzxYngWaw|x!S&LPj%E{rE+Zbi}duQ<rf(c{K?HW`Ft%m<j*$*)K_z;
zJHo;^MY(WY@oQLgW>;~GQ1XvH5^qaG{jwiSFBolAEU&$<kn<n1Gg7Aen1FVldf=*U
znVl&(_FyC|nn*z3ZtAfo-A;~+siyrOm)j2_h8kglH7+Vcx5+;AO-8Sq&||BZA?j!w
z&%l*q)dfVPtw^Uf7Gp{IF5bTaX<J%UdLGfQT5)|LO0%QR5@R`~ACr0?@<|Y9qxiEX
zo*ySzzVJz!Kl`_S1{FiatM&OwUkgLAs;mK0e(o<3pD=v%6Pw{bM~tqeY7F{dxeS=K
z%f95s6_rc7NEe}EdUV=@51&ZyMt9ci{kSL%0z}A2)?2cFx6MSipQ`Y{dM@dvZ`^Q<
zq&6QDz-1*6nH0Rm-Zf-UfSp-4!nsN<LY{H-bEGJVDccUF%(~!GDMV6L+_<0WqDLXG
zR(Qw_%FZb^iY5)$@MEUJb$aNAr4Vhb^W-aK2H#in8n2y3;?t9`5*L%!A(h*|5YU$_
zgn(DDp?(+^J#xoZV3@i1qg~uZ_TB%UmTl|%kF8Q9vwqDk)qG^2UdiK~?y8(E{kY1t
zLCM!xEooYy7Kbzwa4(6#&=i+9HIU|GI@gE(xOCF6l8g-ZpapxZGz6eZ#u}$hI}a}<
z^35HPf)6rWCu-c2?A4?$t`~gs>C~B_qDRj_4nz4Mq!2sC(PqzzepT35)eU>;=NZ>E
z9IzRZ9Gg9KlLONHD@p$#9!F20m}J9iT^QB-_3I)^#5<WQIMkJb1$=J3XefxelcFHu
zQS6HEf}ilw>$k0>cr|!oI%_rv^V>}dQ&B`|*ov5t@W(WDCf$$fB<9V|`B^5-OZCTX
zLd49^9qv$3@UkHo6WQ~Dj$?nd>-(5*W?9q9VG^U!B=dyrfZ%U!GA<In{&T~f80j~B
zT)y}8rqIfZvyzW&fw(Bs4UUXwG7I>)z;CpXwh0iE*7>`ngcwQ)j8^=YcQe9YTk~Jv
ziFXtvI=Sg?1OFa#uykjR`@PywGkYpw%m?$!jWDX8GKyDaG5j(f-AYV{BC+GQm<YVb
zQHUJvoJ)yxc|P;psW9R}%*ELIneRvO)&6-+oi#kz;9osxS&PRjL@f5EeJ}*{hwt%l
z!@MZv&k%=!swIOm%Ayg07^jf>w|R5E$iSmlzb9Tl?9euXTbQ^V&!lE(uwm&;illGR
zMo^6DTk|)TpUy3lPvU!XUUYs|=`!P$taYurk0V`_bheV&HoFPMNd4V~4RwdVzlS0=
zw<v4YwU{Zw#<$g~=)duB+Sihn6)oc>TBje>RMy5;8Yu|TRGJXq>%OhJh)i@#ZMqg)
z=#3agcYXA+-e{_rZa>RnX^AF}ETkrEen_ROusUkls5tgRO_c0_gT}Cvq9R|0sNjS#
zN1-B%sm`@Rc8fZqv;*$D7^CypN==oMJ_pqbrE6s-2JS|jxrUUCH~d^saXr@%HylNu
z+Fr<9_C^nSAZ7mp$GLFJBwRaR3>=i`-e^re-tL-ut~SD^SC~kwvjTHf$AzoksE552
zsJq8G=Bn+;mp1-i2KJ9uIc=PN_k<$SZx~{@q|C5|!}P;j))r5nTn@%tc|<OWJPRiq
zM9|Yr)EyP2GR4$*{NSI|6i{>(Y_3Uy6V)WhoEF-NZT4y85K(fyQIh9d<no$)hjeA*
zmwIbRZmSVT9vD83Dxb-5k~iw9kbI@qDP;Ml<@nt1_yYnOL^j|oSC<%78QSL6i=g)<
zB`1NrSy%P&s8G^fYj9Mt<oIk$mG<H!?9g9v{Rf=<UcH(=>5U9O*aISQjX9C)u($;5
zTLT`HMlxv|IN6ohWpDZ|JY~a|7-k|jqm>ygi$hEOxbo@v{QKoYiaQmZHUY(i3=CUr
zj*+g`N#ghrw=M0o>{n~cen;$u;SN?2skGrba%^hY(kFsSWSrCJeu>F<yz&h2wwS5H
zh~wB%<poTb4>j*BM8g4<MB?M_fLbUE4LL3z2O<!Si;=v{_j%C;e;4;ghuwp7C$7#P
zWoUMFhc3Y9`C~C%!x<03!Tt8YtBQ#zC(J#B>!=iw$m*;~DnfQ{CH(_Q;fiOiN(y8z
zWP|CFk)9)_^r2ZFZnE7%?r-{(eD?L_5cVzQ=x3KHLCSKG;UODk6YJWP5xd(vKPCLR
zoraq|)p5wwpmyONgR)qK7ZF4hfdj^=gPqZ0Dc+2ngKo9)3r`j{oLdaY!BU6=g-ivQ
zG8;)ICE3I_N!349j6tt%6e>R^hre_4&vC!PKCQ~v1s6_sFmo69oPvR5oVKctqkof>
zb<oc{kJP%9=&94*ln*}fNbk2X6$1xNOpDdu*0F`BVTE2>3hd;LxfB`|9A{E1-1fQN
z@H=1520Em`kxfkFs=l&fMm#`lNQq|Ke4ELw_pFIl-+0VGOI!P<yzf_zW*aa(LLI%P
z^cjWd#5V03nZfFC(PG6G(w!Xd-W@N&c@rb_I+LcQs{Eap1cd#T5yY^1x-PmTR#{v;
zgo9qK3hQ`f5l?&BF0;YJ2n}MbnAcMx1fQ5e-%w3>%0Q^vDs?%x@wD>w5l44t7smAx
zy{U=&jK5MQryua0r*9}2;kEkHO<Kj5J%6{qi#n4(ux=3!@3grF*ZbNAymeX!TK(<9
z$OFl_XLIiY=EzNa2IoRcJJayO7+*6sKCEE5P$3br7_-yVfOt5Gju;hDuZVD&A<27-
zduY$+dDea2f=AQ~2S=DZJNgnCOVlOq8N#oUMNGv|TPBg1j>oHvLDf<<3&&%rN+oIa
z7R30oZnWkV-z_fZM?9C$3ES_xE`fk@5E#;Bg^EsDmFD$I*za#P_XGy|(3zUAu_(Do
zKAd9naCR9ikLf|OTh%aD31KuL;3&s)it825*}Vet++8}bHr}NcaVQx^$C;)zmHdEZ
zR5I18E!pL6*QTVos&#vd2t}*}|C0Um<SB|fR@-4!;pj8Z5Z)E}lhoUIXx@c^;P&&8
z%qVO!ab&nCCwz;O>g%^LeRX|ai}xOlo*i+HQ?=DvOjnN!_JG{RB@~l;<+y!VaCPat
z`V1!k3a$VBBc@WgT%PvWh@R^@YhNKYM$K<u&n!*j3C!>k^V&B13hU`Am(1D(lpJ@9
z60A1!7z9eRm=dPK){Ju?9ye<Ci7F)9d?&=~>Oxd;2a1|!I$?xTL%=t?Y2uF_NJrmU
z`_S0sz`Opdf7eL`QI0Q~6>|$+Kk!JQSCss;94LktMbN|Rvs;GmV8C|h3A;h^)#pUl
zs<0s^-q_!l$r3wj9gJo-g_zkIg$ET1amp>AX?>ASezVI)UOGr9P{P_f|Kf%hXyt3J
zT$tus#WC;P(2?msRd6aKf=V$*J=4i=7@~-@mBhXI#m`VbxVZZ(F{}izIU!vZsycfU
za0pYr3%aN8j#9X2oDBnC!BlLLEpfPH$Z15bR6u0s9wLh1D5~c0tK~{e*)v3J|F{X*
z9y-h8U3%S+2!DxhY#dJ7bK-mL+uj;kAiXj6iOZ%+bCO@z^BQ#;mqIUoo*GVPykvx8
zz7n_t7l|$-Nr69QTXTsdB}B9`V)47{qm006n3FETvm}@)I{ii^L>FjCdmnC$d^c7S
zLqJ=|K>#7(&5BMB7R&jV^ehnVOR-=+dy!jGc<Xk^-?Zv7oxpeiFLBJ9y=pTkZ$8`7
zX)_~*{8DC{@XS=LaImLNvs$EPt=(+cJ<_&1!o0qKd3AT^S^>cpbalv-wW#*J{&~sU
zk)1WigzTiJ07pYIZsAKWn}aCq37fZ|2=;Fmle#pRXTv6;TT6S+f-Xo|w;aC_DKVzq
zklmoiD?4+I`9Z%v5Q;}U+}!u8tuD4q+D{Kbl~UGmeE!Mzkkidl0tZ1WP0;Lv@7iJB
z@yGUyxpq*3-j?m{7Z+N!-avp|67V*wXyGuRRgXVNkDC5YDAZbqU4XKb9{@X}#M}RL
z3tOGdP7}m!39|JGa;HB){pk;(aZZU&cKqG{W`u*6s3`#WDX4ZbVA6H~)bE|#+_pgB
zO6K$jmNj^<lNG-gl`Zk`LF>~afD%8Mv5gv*(#?8vmP@-ZBTmkt7};rKDjTrl4q8A=
znp6Wi#2${80(ti?p?63S81P1Z7(UZEZ!?Ev4}6mE)5B<D;nNM|m@C3Aro*_l=nVj-
z#hM4;OFbPO%g~cGg77>n%h>qn?UUARfTKvA@8P^Ytfg61OP&S%4}I>mK?>4WS-0c0
z0Kl@}%gSnct%D5U2HS5M^S}*upH8<BQxnfP=ZD;B`B}>V%mA1g7vt$|Vik>tqw-;c
zX+i{ubm32rBzLXg;KA}s;ZTB*{n<{V_2Wt7meW{&s#r=Ikp12*Cg-0!SWY|V_^3Yc
zn}0k_6fhdJ@WpL2=d6Q54q`)(I%^C&lZ1E$4w_>mTQ7FJD7<&-r$?kX7n%yfa)DP7
z#!98Ft9#40kB#D1z@kv&w^yX!R#-0s*k_yGMY8__g>{mv|JV#?i34cF&^d}wabI0s
z1@nWEoc9~O8^!F~r)72U$}8+_PG%qO5BuN57j>kXSe*dwN$U#B?q|97BHogc66qUb
zzkiE8a}Z|f0k!+a-L^A-&so4(A^Ha168t|?6aSsCnX}Fz2Fpid1E~Vvf0syZ9*qXC
zi#B?EJ*c$4a0^Jk>Dffo0aIfZ(aN{Cx6jQ604z~JdjVNJtH}SXvfE35T&;oAdIinR
zrQNXv{~v!k3X^zGnK{=hF9DPfe_DOX)Uj=K+>B=4@C=6)0yF%)Xxi(d&h-QMt(*G=
zz<}@*rE*8$mRkgGklFp1oVneM#~-&}MlgI_Bp^oAR(la9AD3^mICfB9sT2ok1R5me
z2^5+Mn&~`w0n1yHmFC%}7kFb6%cG4j{02ebyMEfL1w?|5o}SlSgOJDF%kx7uF4!*}
zu=Io9Cm34*JRG<71?XLWug@YhD1tnidfp?Nw;!AB*}R#%8@vIo+UPmo{PbuGAn5Q8
zchD4qq4kH#d*)W&7!bKnJhQU0h>^|`7q^JD^1(GRz5Jd{OPFLmxexUR=HE}J!YOWL
zgn9zRGEwPj;DBMC?@FBHh}y!u|J=jTfF4m`uu~ASzLOQk@9SiL6hulqoE4LjlKSWh
z(0U3GbUwW-$8lc4_MxS<GPWi9AjATymeC+ofh4zdP&PsKe6Hak@X4NF)5O0paHq{4
zkn9fjrziE^>!kP|wA%`j$Z<`#`18VBk3K8--SW|UmZ?hc=xP<q>2wR<ej*Cyz0>LT
zP`RCI(3EK#AYHG8LpC*da>bliKrWhu$Q@>mLcOStT=2j3E+0|!wgiE+Oqc<oskfFv
z$Ma9}eFylkba=4_;5Z{s+WhS7mI)RAnqW`><}eq~166O}gva)*XEVT6Ge3GPoB>g7
z!+ek#Xl3_0uItJAIOq1=LI1yTb)y-qX10%XrPfkT#N>{@`AK@r>>Y<)9<!M`=>p!u
z7NJ$Z3!c0`>%jS{080rZsB~d#d?f4nA{hNFi1xPMuZ4%BLXJsIYhnowm-~m%f*}W>
zBf^&l!qp!S2BdCY_J*DJz6XO4cb^IdO~Zr-uf{!EO;TF`lY>inXN$wU6mI)7>t1cy
z9vWgftryUBJzgIFhro(@w|x8gUr$EROAV<JY=Kds`5RD3K{vqlgaY&G<Dx&?fKOgB
zsXiws<i-iG<{&_#E&}T|7!!hC{BI0()|7#Q?*B)Zh`VG(H5h&E=r`$ufR~1fuJT(&
Hn~47d`6wAZ

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-mini/plot_u.png b/demo/documented/stokes-mini/plot_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..f2b93588ebd7a3c7584d8e0ccb08f7b4922c5d04
GIT binary patch
literal 60770
zcmeEu^-~<p_x0cech>}WcPGK!-7UB~EFln*put^(ySoQ>*Tvo47haxE)%U-6f7+_u
zovxX4?!A5b^zHejq9l!qM1%wY0IICaXEgwT)&T&h7)0pzZy?&gCIEl}ko_#K;hla0
z_DDCFgYaHVB)F{TdM%XwgUkJlNYzc*goA{G#9XH%Po5oW94ax@fI~lxcMpq2Q9(Q*
z#iQ$$0bX)xcH4b4=V@57=aGnc>@a>b-#g>iwmRRb-B0(Mu*CTSMHzyDRlIoai-1TO
z5_66PNBREoQ%YP0k&-G`6$48G@s|xwNC<|+N234#)Bi`~|6)VbUa9c<7i}gTJv}=C
z%F@yjzM=b6Dz}}IJo6V-JZ3#E(CbT66JNbvMq;Apb|mlFa{ciNf7Cfj9^J54JNkP(
zDXCdo@2B&-F)%XjPh^R@?hM}D-F*qiTe5F3etTL_7QUUOpKrNe^UDgj(+%(A2za`|
z{3La<*6z1dW0_0$`n>+uvH62|eDE>@6X`u>$;(PBJM{9^n2kGLHn3X3A`Z)30C~X8
zRPn4{yDxXpRGze#mlrux!`GRDhX?P>{o~`~&d|I^N0smx42i&^mX;PQZ0z%v;|hEu
z@6C%{4-b##=4Q9O(Z{FbO68XMU^wKChpljKyLp8Sf!hl+(A)F+fB*J7Yu-<>&g7qi
z@s8!6<4!L^fd3^#^oi>Ij!G_^!4ZU<@Jtg!L$We5i!C0<#j_<PCDVuQakR>0Dkm@3
z69_80x<0=J-yq`urJSe+92{I_=j)TMbq2SI4;w+<$|*y_k%n!3UERO_{+g4n<e%Z;
zFq2bLE<|V>&)?oEyn-+!24&@xl{*g$(xQxBm+dM;C32i+PXF4$eHYJA@^WX-n?e-B
z2#Et9pOYd<NFY9{E_DPv!=MY9)a#M^om8ur^|5`A*hFo)*r8kI6qe#UxGS=Ye}_cK
z^JJ0T@6KK}R^;WPcXV{rseV2h{=X{lB4ZD3@whu#3a0SC?8E1@9v8aR`@W`ivE8~5
z6#O5YDD!2yoNjvxKTNgCbl6{TNOBXE3f)@4(%P5aLI4VUZ}Iu{J?#I++F;hLu{c|8
z)++UQ9~7HLfseWVoe2k?G%8t`L@y5yC>cdX;al))W;Vrts5YRBzFg#nvkVUn>2?MN
zn3`@LmT)_+@~PrPcTj_NhZ6v)2m+Vit*ByCnTMe7x&OPUig(R>dzi73L^SZ_JxqVt
z<Quw;ajO?7@aO0?f<1|YTF*OL8yfC5dI|~(2FO9_rpXt|AQGG3+!7sM{9nIEcwp(^
z22J+EN#m<1>f|qWz*6uC`4o6Xy<7x59Tp}Txc*Wqd>`Za#uqXLN9KEwa}nOt)ALUD
z1?Zu-@^<i3w9xCrHeR^pJ1~!rkFB1k?@?L5a10qSe!c2~K~H~r9bwHn>?iO`^S_Zm
zlEC^^w_l+J+q(LiFx#%=dBV?pyyM1-XD2GmT>8->In(#3`1!mO^b;E4ElgAhG0Ygb
ztHyG~=$($MtE;uOwW6XT**F@o+k|kf)tCTjtFpMvAYl%f3sjm8iO%Kzxvw-LCCo3U
zj6;eYCju(OuU3RtpZ=Ag9@U;9mIWdOsWcz7u8~R%-oID<M^lxgF?`Pe%s_{ZYs)?`
zve?~Xew0A9OW~p}$lFx+0<E2AJEA)E#T{s81?7$paT|N(?Hs^#U4(UD-W6uSW|Ink
z5quOfUH1fXmcf98B6s0slTuX4#<<FyXvc9o#g24vi`3BlpUXYo?i#gck>*xC`(?*u
zwWFsUPRQ)gQJDe@4LqRJaDQkWR$H=T4eGlf0dgu(gC-}@D5_d{bQYeN$pA_Vf(}~4
zJe-i7)|}2A-KDvqRIIM5-;L5o6<D4fqBcW|2!W^+Rpy2JX}i{*<RJUmnUT=Bxc}V%
z#wLW5G~_7s{bGep&PwYzd>~@=wqED{sIf7p3;~(=wMO(s;PA-(n$PZ`o~IYc-nv3v
zUn>YRNfjM|^r=)kbZkN`S)y~Fz+jZ=h*mv0oWsPBo^CeQw0{T!EzygjzWj3;(w09x
zPk%g(MSM^8LHd*`Q<_pUDA*N<gcn9oXB+<=lleXiT9CP7w4L>O5QF)`s42I>L;d6-
zdMDy7Y%l9Woeog;1DVSY9=!E>9JWFg*>S2@JmK?zrRmENlv!v@wnv2c3l=AY%2jtS
za&CwEvKo&K!w(Fe@DF@Yj;kEuifph|^8mUy08hheGO_XU4_}e<P*aFjY?CPUu~|m1
zAQSl4UO#|`(p8r@RO5-Vkyd^pv6tCz*U)L#+(4p2MW2br)N&ny^qi=UNP6C&kEtgZ
zJo3Y5&^q?6M;RA{o>xt=1B3B!)PL?9jYvrH9z1_$B3W+E7oAc$WqCUYf_T(Fc?$L!
z@dlYVgt<*6I#(YMUh=<bBT+1p0bR58pQCxbiN6CVDXFQVy!)c*m@J1*_y%@<*o6l`
zvYW<c=qAOBjlp)$xFjd}o#QomyJ#5e>Z8nlF^S$u{$uq54itt%#|0M4(N9^F(ux8<
z9z=eTxBXSZwcN9wZ*D)o2gjs)?v*;4=H+_8{kHIW<UK_@DMqbd0jg|`@cxOH{>#iF
z;pXq}5}d)43QM|4^qbrqZtX|u0^<lQo?JKFS9Uk>1KF0v_+t0-k{=2qH`VcykJswL
z)|FmG?T*~bxsB&;#wex`fe-NRx9fJ*J9;adqSf&Pa&O5EXFU+wSHhRBB3hANn=&A~
z0UD8|^+0fq5{sP<aVYxpsMFiWB|qSc=gngxh;mt}qgwM$-mZs=8Bi}k0tjwSkxwD5
zpGZ8^&)5N-`!f8ld}TtBj`N>saD{6*a521+9uGYs&=n*0up5qKJ0}Q17I}@_?iU$6
zuRjItLg~VnH(@uBZYBoke4=zFh6(+`+zi;YqvoR(zCNCAnd7o$@G64Fb<d&`pLn!U
ztV4lWpY6voReOItK+5{_<bL3Bj_Ex0j$d$a%=<GS(;#W4q2Rv;bN3BakQL|ARCyfA
zRyrJoUyi3v1}(yDe8q%vcS0iQGugAi1?+ebf`l&umY!4ZS49t?9*#Z(v70~He=tux
z0z1YopQU$)@2j3I7qVM(lr<g&B)`8Rirpz=9~qwtJS3VXhb$#t96v1K0j*^AMC09h
ztPGJIWeRoV2h!YjP=g|rFAbL!(Ex#U=B{qFDz9xw0iSY0CTtM<0hIgOnN#o5KepnL
z3Ovt@BhBoR8id6IRkdf=>Zkgd8f_{wRg742tQk~g8B&i9CnNH}guldYsQFqR!FWi)
zryVU}4WUWO0qi2ruGqbR*fWu6P|s>McU-AHO$aBe9vW2D+<o-df&D50acGQLH)12C
zh~(wBG1+lJoNp@~f20)lW04mPjmh(Nz2f&PZc*QKeiUDjW8Z{Yt>q#a|6=g@40JHy
z0|W5-6I%^49er`V)(U%Sv{h3+uV1_Z7oPtoyB}YtGrUCYA`-x0HS2m6_OfFUv%P|w
zz`4ZdS#OVEt&5{sUr-fzzx?3Xzwq^-hd(JzZT|pjRHvv4VQX}W;r0|iZ+fZCA5Kj9
z`|1KsG!X*OmI`HJcN8t<H-Jg&uof=~Nog;KSn{;vGo*AAV(Cb0gElitcXCtOq|R6`
z79+mRRE<4=3N)izqy7H&bw<gje>D*4+-#zT`aB^Ai^0uJ7L+rHVsf8w{6n3c>F`k+
z>ZhS_&OF*c8aaCBM@mt|v&so~jMVXbiU^bvm*<^3{QSF4bVCK<OXUa=_NFUZ>DjT&
z!Td<1ve$(V4(!{P^d)@l^jW8dhgYYkhmTFZKYQHPm7zD5_GD9vIOwo~if$wwT05kQ
zUGi*j`*LNOf*w%t#F`!-qK%P(5}x1M>%-BRgV5d^g^>2}S|{~rp(F$qfzUak<X+x|
zmH8}xaaM&sTi~p{CtGljfzzuERD@8Ee{>PPTp0{_cI+~?F?#-MueN1GpqQja8h_;$
z^h5yaSlxI#_W91NJ*M5w<+=KNO6sV9GNXmti<tq2ukCM|Ku^b*8KlBwx5^QYa!2sJ
z$alaj!x{Ik<LU%LiYpo3Zm)N<{|?F(_4=(|5MKvzJEk|3v0)_i&s89X#<6OgX)8|O
za?6d^f9o|zM~FRde}*CawCKE-Z*eoQGQK;#=+->m9yY!=I{GR09NcILU{45`ZIY!R
zm<(@%Jzy#g6f^&lxo0JTew6VO0ef^`$o>Aw?A$p#B_web7+XNaa4o=6_*%Rb{iSJn
z3x|AFox>oP8F!ljW+AR)7?w)-9#gQIo+<a?PA-Au5=v<A)jMZ6z^9_K248HYRzHl6
zXAjCw4>PvE_=G!`KT@5_VxJMPO+?mwyEMG65@3mhnq10eLlMvl8}6?i`Z~H-@5*;w
zXT&f39cpsk_W(yx_B6Wju0ax6yHaCZ`0eMS;IdC`w9l8(Y6FO-K@S}+AbYT`H955o
zds2c3Riux#dfnMg?$*r~)}ebSsu-S$*M9xu6AMCQXG0ek<+tc5=nX|%AXooFTX2<F
z;5m^y>!2c20MaIHsf>=FG-9I&;B@apHt?+jd1e0QP*90Va2m@G>X<ms|G<$QV#LHH
z1dfv6^m#)#<eqAerr}(hx)){&fFe5!z(A<v?PPVXe-NvnPksVo$U;1p?#5GF`QbJ5
zwU&#s79@Fks^T&@&L0oT$Os$Xp&p5sjngeX`{~vyYs#4{87F7JChFb?bA+Br(w26U
z{i~D1;VCW6G`VNQo&WkdE#Q~=lhgF%m-|MX?`V&^(-l3fTd`Ke+D8614{X~FH+3s&
zP;|M_V(vfB+R1=~&NZ)_hBCKlMQiG#t2{u%@cwpEP--w*Y(13|LML`yCw^vCKtWY_
zRF*X3%dq?JvW-QRI{bGZ6QJYkqrKep+If2i;<>Q83n!npiry|8iddxU&u0THJ_w2+
zCPZ2RR0V8653QA7samTNG+RdmR7~P(=MUaQlOv6SrVyWJC#)d5z&;OmK+Lu~M`ZMj
z1x{=%5Ke4J2(2rVHUBTW!Ko3U*sDKoP=`{!X%dRb$^ur9=6SkvFMIkQ8Eza1hmz$c
z&}0`3oCrcljhoX%M9gN{HhV&n38w&sKB=`H7!1;nL5lkhP$~~YxG}guCi7`Ih-}_{
z)8F2G6sB?5k+pPT*a%d#%eOF_TnWL&&zip<ZKw534)G^`pFPoahRb~%Dra}Vab_%>
z7Na}3s)ssfhxGSz9czL%k15ESjBDtSBT1N`b|-k2CgsT99@cb!K8!%SHC*)Qc4oVT
z+L2^UKQ<p6*BL^<Ze+I!hlVvyxAt;!DJ=^M@bEwiYJ(9ja(#>VyXckO%I<d8RY7q6
zZA~#c6MVc2g+u%qP+~?lnM`i;|0?m&7q;&~+EJ40w^d?vAlu2raA*+c@fR;>xd#g4
ziHhVC5n-b0&Zmy=F50+ZzL0_sL(4*pb{g^(6u^ppYewl0kBQts|C9p0%JazRA1nog
z>_!Rt!_)<wdf&GnpTlacB$Nb^B(8enT<wfzXCIQ?8xQ`($86c5+&Q=mBwhjyqO&5|
z7a2|mZ!U4Hs}GC{aprL;cfR>v;W`|#vNC3RsW<@haej5ajH21RgVuDcYPD{P&gjXG
zj=Vfb`Kzx`TpTpOYzV|83;;GosvO}20I3JWy3)){4?H+ws#UJ7<rIJ3X<C%xkFSZ&
zk*#CUe-pKESdIdCHEtaq8@tVTe(3r~4_w5hzm6I-F;P1HB?=-@17LkE0mGHhC)Ste
zb#jYYHn*JH3!4`%P)y(y<>#>>wEd4ksc9WvwaK=HuNt17MMzdbrk2W;ZzH0C3x1yi
z+1`0pY5Etcu*H3`@LTgf!^ZG-Fx0=FYH5i~2QrJ%$Fu-Gc{%S4tL<@q9irr4+#2Z!
zx#mXDU$5rw1Pgyo=se^2Ld^jz-;Gccas*Xa<#+cRq_c`c1zp`<!G$8B8Bny;{b=Uv
z00Gh4le6C#5MsBWOx#g`mqSHMe@wOQ<f6|7`Kn4I=1~4EGVspZ6Hzuh9;C_ab^U07
zY^tQSH}1$D9w*QQ#tMRPLq@dStI35Kfn-ot!;Qh3%Z5l_1Um`9f7u1Qj<A>gq0qc9
zcCz0q6mx;7cJC0NiqL|Z{9Mh)MAX?<y{|*AdK6jA&Y8;?SY!7y`ZBxCtI`~mVTknP
zbwFyN#T49=e6hb?B~ZRNx2@YU+!=81T!PZwbiqFH9F6+)Nvk|A)Lda#ZZM{W_kD>M
zktHMkkZ09&W>{=lT6N02<Tm<~Bb`&)P@_!7)p<bcZO=SPB430fuJLH>&~b?I$Mr;e
z?Zn+-RfSdCH7ex5r;Vy-o(@LmEmBRb1o$au@{dB`c;~?gvuo7;F{57LQig^l6N=*Z
zVvP)m;V1xkq#bhRq65^npTbZU?9~er*s{uEp_r1#pxF@Om2H#1nqPKXf6wYi7n*SL
zDSvB=<}Vaw&69Q^UgN*9lxa3V&9-&1>2>Ar;wTm6+w$XhrVQ9L(7cjavy1akMFE^D
zp|dSZ5lyxf?#?u5gQf+U3HOho{C#AtHxqu8`LsB*KtJ67yj#`Z24*{4ZPd;q1UaUi
z6n7Q<2QiVBBrCvY0r#XJ&+{A632f3p2Tv4WK0DFio0x;sz)Weh{*><wuD>l->CBK(
z)@d{=N#n~D*QW_ot;t)#9j-hIDr==1VRR07$s*s*`(sw>eRiiOw0+~MrJU&N)PVum
z6@P%iNnkUqEn37lflXGJ;;m#}UNG@z6wBjX>tpY=a#@ly#Y-ZKRzE&eSm=7e*l_$u
zz~->8?h*yafX{^4KS`}0*4?iGPFAA5`*i|1(pX5Y{{_Bs!gWmq`h6Ch4p@xmaQuX9
zQYvj}iwLb#t){wLlmuBCC{AYA{wg)94JAW5219@mSrB>&)rxcQr?nBD2><y=<PK=6
z%F(dgdauLZ16Bg`&q(-YliYpGMk5He5n-IRpio5dp>(Wv3Hu9eYt4_Go}Kx2!?FeK
zc<{4EY4bS+U;yfkI01cdR(jW8-;i{=_YxHF=l+%ZH=R#o-6LZwsWGaD@rw&&tFvWP
z)xfXbpY08>c>4E4FW;LACg^KYo?H`i_`e>Th#_l|me-48yMcc~4>zL&^1HQ2$z^mv
z5R&c(AY0XRh-QZdI*2~SrI8U(&{fFRh010z3k`7fBM1H(ERs8c8(y(nYmfj>uAU_Z
zQQvJ$^Dy+bTm{knNpDkGm$zdFMVThO%38Kevc8#8z-EyllKyaFc{zi_P2Bsf>S#d;
z__SAwHqlqlI9HuF3(Q*aOn!nnSR>MbT(4cS=EGFQA8F9=EHXkBy_icM@58*Y$hI+X
z+S(duV5*C_U0;Yk7Wr64v4+i!$PL~jyo;o>-F8sqaoX#*nhNcP^i?@W|MizWi3Oid
zUYzt&mJv)zXyC-)W5;vrM#SOhSfg9@B}z~W5w&3~);0kUpeZLu0?al_s+wFd61o7B
zlW+k4)VsehY112s9-B)D<c4_Q4%ex{2bHT=Td)CZkGXFr?FX*#UDo7ifgBS|lKqhk
zz_Io)&~Hr#crpkDsYdAdn7}7%9`8is-xh*{!|L+ge6*9GDFV3gYwkdX{Aq~Urloam
zE;jRwQ#D224je%ZV>!x>?f?O(-E#y4jlgT@9>)(63OJ#wUmk@<+}{$k97|c~qZ(rm
zlf)FO(th$)d&A|TZ``8+Czs100oBSjKGn+|W!p`ip=G>Ie^#O1Gs+O^xiw9g`1l7M
z$@Mic)XghoY`Y>c#t9dWlHUOZIqRb1t(CL6FLs@#PmxzHkYB!PcT5e&W}W(OR)#v%
zRk0a%LlhlW#JD0V()zP1)Z}tRHJ+{jTmJW{DbReqd!AU~iw`PUDm<Y7MGDar%wTD6
z1bTH?EKy*D4&o7<HdE2)0v^oDp-s+&;JdVq8QOl9@lj<>R6r_GD0ra&0y11ek|4~r
zPri!1{^opz*s6Kn14@`(ui)SMBhZ6}+0Ylm;O<Crau><XX7pq0wMrO@aA2c)2uS4#
zr+#M+Ri7G|f0P1@(pDSzHEw;XuJXPuM2ARXc4=#qUJgnb4Mc+I1GXc-8$e@&Wc6le
zy#v0ba9){ZZ7gjUJ%caFb!;+qi^$`0#v@So&8}Gye9mHB?lhJTIYu+kD1<z{a~EcH
zK(}QlHRS#y7q$cP);CmCqR<Y4ngguvdifDVJ4U8RJ>+b?J+u~ncFx<aHTU}I$38(r
zPS(Zd-b1Vd>@0>%j8E}Bm}<%yH&4_oPUks;DZU%S@w8|E{D@O}uxJE+U<M-vF$?|?
z46fFxe*5HNL5Yoz3NUu4_U}O*Omt3Y4-es4xsu_a@qd^sQknVIf(H!#mNaw%EtCEg
zxSANg6Z!jE_J%yKQV1+IYC}0YR%~6N2yLFaq*EVFt|W5R`$Px993IGNI{7hUjQ6>b
z&sX}=u<hC2{(L-&R}}&>QlQ=uRZQy>&O#<!kcJv$PzP+rM!WmBGBufkQWsA7;1DET
z_FobTYce;(TTanL*o*hkqtjEy{vdu9mr;s6Y*?W9b++IrnxnUeTxcU-gR5F2{Mc!p
zAp7#Q`m4Xh*ePSwtLl(b922#k(u7o4`XMLRovrE({oRpDZy2O;Y_3emtfD4#!EFKD
z^JRc7@)il8EGm1+;yOYSNe6w=`isL3X!+;ue96fUf-;FVU+zex-KF^ViMIhHj2h;F
z<jQn{2QMZrkm#TZ=+q|n7{GV+J3VnG({BQ0-gX=A!RC(Yy9w;@ttef16EKsrKlw0X
z0Fq_~prA!Xbtp$w@~@lWQcH+0sA*TdUfr{Fu{^x5%~-dbUnnSw85+o=`x~*<o3m)i
zLwJ<_j#Gf$-?m30;8&i8FuMz2P~S5y-KvLoFS@Z+rW{_r9RVzhoD?@%7iEsB|9L%{
z(8<udg4J^b`5eUlnh;`ne(C8*HL*+pJ!AGprcQHsh+_gG)cNPlGmqIOSex$xE5(`Z
z&HvcTXMwzSoALNv0+W*4yLi3YMIRhR*R8H>*%~*H+C%%=emBRLVGy3tW`y>(-eY%~
z_CCrgdHMJrP#=(nQ+MUqj1$@!bz&#}eaWlP{kl>ZF>Z>Lr@DfsE&~-q6xqT83<^$i
z*d2v_`b}7>Juj%T0`Em$fX4}Lmovjr*MJAmMJm&^VJqSlZR6A@%(XjM?Ia%bEDDcz
zrbM?P;n9c^P8<w&D!#40_nlAZV?yehnv_ltave{buje^A3UFOj0>DO^$y*4Q$L`io
zH_bI8Y7Z&|F>5Q|&tziHYHtVZNI}cxHHZDl+46Uu!wzY%D|+kQ{kdZnHy-l9{M&pE
zD;L!m4`M)Uy~YUfl33$xZC~T1wL?FN;o-~@Wta`iyqlC#RVc}d@BnJxA3Iir$$L%p
zYiwG!GP_if9@k4)t;)nzsGN$CyNSvlbY;Z)1@sIX>Tx>l70-V<Q9z8+WjiN_B@y-u
zg6?2?ewz2Glv&Pyi)RU+K<V{Tm585isnh1<`RM1!lbcgG@uf-dPLg0^i!YBagopmQ
z0oDVj@hq4DkWA;vs#GIZ@V06exVB$g{PfS~b2#pdCI>(nViFfifT{`|bjrcWPZ73{
zuV0O@kGoN<NH-$R9%h9Klz~HZusOEa^CO_LH8&3}35vD3s8NE_4e+|gzo<EWgrVR{
zLdbrS)3{vRuzuJ3m4QYuCfB@IK9*rm_J(0(eBMR;$wI#nR5U4J1_=hBiq<Ii*X$P`
z6GdHOTTJ6_o)pOdb;r4J-(?iBKbwc~X(N*P*i%)qB@YJ4caE-ncYIz&4sj}w;?5)W
zx6mva;3u<sv0_=J{?RJV%hMhi@Ywj7c7huX@e4q>K)dtukx+~er}TAky4n3=Z8jwB
z_h&!0*B=t&UEu-Z#`%yC2~4pU;p;g<m-71#7m4~P#yu|(bng$M<Cl@7kY#<P^WmXr
z<=&2WmtXe_PRJk1*PP>!79Jo99iCi)!GB+9E%$Cg;5+l#e5a#mOP8*bl~nYc-_iH>
zw1C*rzDx(4fSN*{s^`Xm&ceX%xc;<)utX3|7y>jTaCCM^5g{|R&J|w@hi#tj0mg>c
zRSLWR1Sz0}+>-xixEZjxwe%)Ty~dUX6@xWqL2LH-zItwe`(Xa;6o^p=nAmAW(3ce|
z!dETyK+$>L@xq?Y%uSVsw&+pkg)D&-qJAL%UoU{gGlOUr)Ww6}M(o3zR|f1xo)L49
zY&9iN0Hdf@ND9pUVgj_^#j(g7Vzzm)aa`fr<$9McC`yZ%z$t0=LNoiq{?3H%h~?*<
zryQ^qo8ZjpGNpJ|voe;le{43Q0rccNXt@vr^}ht4>*Jk2LO)QHzpaTU{33spP-;qf
zP@GbkXh8~ZW_$iD$$pyOs*@owJ4MUoe)nQG<T8SN<?y~iM=K=?ffn%#nFSv~wvxa5
z_o`m)hJN$K4_a>3LN#>V0$tClu73Dp(t~*R(iB9E6eyZ%o3N+1+c(g+pSiK-t>1AA
zKTia=p#tk`AXEMU>K(r$52gk=RV|AYD2h*LjCW>t-tb-W?+bQ$0@;4S5gb5ywYNf-
zl2$L}hlpifbo-SSSx`4LuoXrLFka8fNxtDu6Kf5MLh_#SL39g7z1|$Nz_KX%C{a0J
zL*Ve!a2L*m*R4m#aNEuZjN{OYM}I7Y8ni0K8r1#_Md3w-oXx&MFms5E4%^~~1GF~w
zxXQ+F#Lh|e&(JqIq2OhXLEEsPpBl`IPI})tp=9iKPs`7(DLv-rDgm1+FE3l4td8Mh
zK=SUlcG7ikzl}(+1FO#~#9wvz6O)l^Ep@?--a7Z&VSQkaZvvk(=j^B&K?epAZ`-|P
zQlC6mfS;s>K=8BOOPUu7NI!%mDmVruoIzNb_jo#Pu(QdJrCwNY7Tf2CGaGc;>&#5Y
z!NY=p$iuG=>HOc=lJJb2(;uO2iq!)HQ-F<K>xUi#oxEh>=Y$f2$YS+~6=H@VD_gzz
zCc1)rBf^BS**eB3k%$qg65M*jL1pM5YR7_7y%ddqfAgV&q(b)-H_O-~jK=^O+oS|H
zpLe}ERLipUo&&#{g@PcJNXYB6^_>J8)Vu9ux0W9$fga_EGxUJRFhe-?dTIC=o+tzr
zLrR!Q<#~WkBP_LiIVcsm{s&Qm%m?hbC;!Mo{nr;y>tUI|M{=RKvswJnnSWW<&>N?*
zb!R5=SkRN{80FKo<I6Fb$WZTdzEFm%lU#bK($8unhELn4@d6{?yLS!_s^NjL^QA^`
zz)PWQ{Hs^4$U3Yprf={VsPxQ`efFioG(|b9a;S!(W{ckGE65h?GJ?*0IrOa4uH@>6
zV@xr-Ot`9lyy9OnlZfSt@vc$PMo2rYXZ03FKrxW-qVNGKF82n*Dee;CW3T-mCQ$e{
zBUcY(rS@5}-V4L|CC`-TU|u=`Vk5NluADFO^_*v<W0v&Fr-aHFC=L6>d8Vy$)d*1l
zu=CT&`>@^Gr-KZf6l<%^Dg?s;4Em~g3vX<>Ei4-Drv7Bu7JpI@0lP-}dg!=P?cqIF
zU|Ar377MS-_%$ygV|=gv_nnU(AS(|ORqC#K{$z<OqQqe^w+(Kcgr;yzu<jD6bTWe~
zd)KZc(HY^AaJ+<2@fJS;PwoqVMll}DLnzjZSM2?58O#i`*s1$VP=2O{{pM0JD*5BB
zPo<PT2Y<phxQ)~Jd7(4<v|f!sERr{g+~KYVfxizp^s5S7O3|CBWu5A)Pb+6|Z`Hnn
z`2|+rMHI(~o5ZvSJNjBr&kEe`GMRm-0XrIdq8m4*76xHky>uUi_(|*=4L&<Ekw7Bd
z{axaLLR;5d-FDmLoTA^2{coMexU$d`e$Y7u6>Hjf=yZ9+`en>Rr+(M9+ZB;9+a)FH
zS)0swJ1AF7j_;cHSCM>yjXVdA_)Qu36s*EOsz>h?!4??_ew*P2XxjeR(a-oDf4>{c
zgeW(l8eS&$C05AMo5B``n@R1<Kt)d*F>A{{p|c9zRE2`=G(q5h)c94I4mr~<Wdos%
zTxKdj&=VS8>|$*IWTDF4g8>jJmHLWi;Ay~?2&J<A3*$RlD^}cq#k*&kDi}|#Ir>x9
zUW;ty#+2^UhpR8PyPV<{7Y32Owm)FA>9w;|k6}!(EH=CRZN)R;Ofm;y4#+HBI+qZ-
z{PVaAhv2$q3Kykxn*!GQ%dvvukH^~QJ_g~iFPd>f)2TeJ^7w3voR$$%0+CkXrw)FA
z{Vwe{NERH6Q5>GA5pwpEXvOMR1J~Sx!}w!N<ZSD3)&MRZp+&)GdN=j@VZB`b<e$vO
zEl@kFL`iQWA>V)5WTt%dp&IY<U_D&&dt={kVSF0Uk^J_H(^*2<c_7%d{t@kmSvLP)
zX1Q1)sP%@uihYD;Wvig%6;_o(THwI@VQ$m@XAHK)yYh~n?OZPp`8@Dk8kPkDT(dI&
z>CbjBSg(ZpQNK~Rp`mWRgZ}VQ$<9=dC;T=+;R@EHi_+;WtTFHq)2&#jPNtHZqd<vW
zh{T)n)4Z3-7uvX_kz|Dn?@6+OuQ%^|GxV*R_Fo5tli2i26Q-IKO5gz77D|1n>>N~1
z8ctx?P{9gsdy(prDWX<0YBy(0H#JtQs9fq#1-DiC?J#Bj8He2_J{n->sv!SLIT1LI
zb&x=u_#|I3qgYf2b#cgFslKE!l*y@kI9Ceg{ccMtu24a|4OjLiBbpC1?ApMt#|0Qc
z@xMyuuT(}qXHZIS7onC1WIMe`CI)kfW0NtR#6nOOYS?iict0oEYWViAP<l9A>?>_+
zf%gd@as{1|C-nCT2E|t%GQ?yjbNO~^6P#$NKYzI~?P2Pzb=9+a4qC+(PdcxDR%l^p
z-v*lsW9`_K{ZM|`W%AHMDb<#*5UVQi<7@V2x&$@hi<#`_aI!Tu(&%V{rWvU)-*;fs
z;g@^dfp3sr$U569Y&=9QduirnVOwFI`>Y%~A;s(D;^Y~UGgYRKr$0@5DV{XlZj400
z4HdRp%UgHEJKoFqdP=G&MK+_8N1(Vk_Vu4~`;|d^{VIqJx{+_`gu_!Q4d^-xHjbXf
z*vbRM5}~piU|OG@yK!h<>UtJ<%|>mc%;UBTUBSeE+m~#CCqqi0`WMOsopFCkZW`p(
zX9{pPUWQ7>X}&F~`{$+i!h}rG5f7u%j1RnQH25=&L98`uwva{na{aSDbR{45L}@Yr
zQdzW?Z6&tR%LmtZM%kC1BY+-n=zBQIm=ZU#PqCZXr!biCRF{w6p>|`cr|cuyC*4L|
zdHpy^YbV6UQ2N|DJbI`L3M0T~EJ7JAWk&^mpZ!Fm-FoKd4g<L(V7tf;k$J?IJTwP8
ze}r!hMdd^=5=p(UBuuq{2@=NlXCKAh&>5`_HyBYmap?|87eJD5-J>!{!1nTKI6xc@
zEZ(oBd9Iny8Hx5Q4KgKEj(od7gmoS<L+&-ZmG3!NL9GdyhuA;DNE>vx^r|oKKzsVf
z+Ou^Z_sgZ}T`+3vLrY<+8y9*DdAk*J?E8w8vS^S*5^%nV18h(^Fp<;q&g-^J0M!8d
zt;6uVXS$!rfQ!xA$NK$CAl8@4r$I^=&mhr8foU)9uBCN6YPt<fJM>f08el{5>?4G7
zKf!@YmO3WN|J(3ZI_%A*Om`m9O4UKPh?cFFgxK{eiyyS=LzJa>w)&CE0Q0yE*FFs<
zj^$6QMO>x&sM4L6ZLZzhengrnyh`#ULe~oQGp@+rs#D_cGHg2Xb?KRxjp1wMXzaqv
zYJcIr&nuHyE)=zqsy#x4sVk!p-I1n-Bt~c}t^}j6AITkV(x?k0dQ*RWkD%Ct*!>U?
zpE&ZV=3RV^29MXD(zdt)DV1*;t_V8qdY%Zu9$+vli{P&W4A)%GdYkbJypic(Y1Y3K
zFV(V7V{K8Q0X`40>9n*&(gP2r86Niz0*<T))gLjscEZMv-zMrW!gcC@q4Mnn8PW3X
z41)yplKie|t~wto8yq^zxH;lt^POQ!ZX*h{(F(H%@&Ioq!8F5unsdCXT7qy)L52io
z5uVCqm*vgKeQPav-cxO+8Gf$8{6__|rte%ocRm*se>wDIQ-%M+o3gJNVVBXwY?u@?
z;e+q9z1?+<5~P_=pE?Hyu)_I(wNw=qGc4C7j0qNWysYwd^lTm+O`P)vetsZV^Z5La
zgZ}r(@OHRP*#@WU!VD+G#eZuKucL6jp!ZcJb&Sim?sevdGZUo!>JFu9KXnS<ww%^g
zrwkLW#ydn3eB%P7bwL+4Omo_Um($!Yr%vk_DE(4jqGz53CE9n_oIeV9RDV;VWYI_Q
zO3CE{*Z0C@U*Y>jJ*SbjI+B&{`r<Wm2{pJ)Lc1jGC66o3?&?`|?toY9(zSM$X5q6R
z-!gQv3cpIJzNLeG>rc??R-YRzyS?|fUj4AuGvD}wUimSBC308{+v?jku8SHXprvM2
zMLK%-%I%?vt}4R93;Fi6qVHJQ1~eE=@UEFMZt{!gOKIu8#n?THOgt^e>GWb?5_n1*
z#xDP>OF$;m{S<z%LcDrq^On!fI!jP5)qkuqEQ)1`jh{7fD|WiH<L91va7lN23rv!Y
zyiWvIj;8+f+m}#XEkNm%sWft$UYC_4DxMW*t6lsS35@_e@EKG7KHCCz%bWlZgk@nz
zJ&pXm9=7IP-@sv`V>4NKRY9JHLXnrhu)rXPg`Lm?#8|$ZQ+uA6SBqP}-SV~LiUYT#
zkA#=pz`tMAU-$Y=qGzk{hW66{L}9aaPvd@n!(JpCiL(Y)!^h4Emy-*eQOy?y^NB*k
zjvxk0({yuH{rNBO#)Wjl242m^vAVq>I(FK``XpnA$#?MI%}WJEIK8XBHQjbsoCsnu
z_30@MJPAq|N3Qc8ewR@HlQ~mOnzeFWIqm5_;Ho#iep30|nYyOgF8LOv=E%yHsORx$
zr8RKNe9ou!5qdDtwuWV)=g4Qm=v(wctw6#KqI+jUZ~be?01h_Dty$ocmg|$wcda{k
z05OthMKl_O9(coyJewkWr;YzXF=K#P;Uo4tMZ&RxoYCB0Lw(au=jwYa6YfVp|FAAS
zU*kI)gFe>DGcWY|`Ci)I8T-f>>Bqk|h=lf-#<+~0$^Xt5HKxO}1rSJDInQ}2lCYt=
zCupeOIBd5-ukNU3nN(e2v?~$$(4lnf#?a!sX(FkTFU1E}ZuJ1Yp##`d)7KkW4O78)
z?VZY{{Yw|lLQtvJ<6xbHnzX<3qOxOv{0PxX(#t0>Us3^990Y)QXk4HkBi08GxDg7v
z4bOv~+8&!y%oGkNp26K$s`Qb|on&lcSnYSa`a5nU*|4^L;HJ&z#<C3&&oIGG7hL_o
zshFOL>KS$?x<=w99($U$Rug7^lGc_oqnkv}zqE*}^e<-gHvahq%44<7`-f!N($r10
z-9R2#{WSw?cmksZ_T=l@Ymr0G2w|dG`9_TINc&xT&Vz1Z5qrN_p~|C7ElqE_r=LLK
zc1!0$#nV{F)?2y*(=VhtZ$=h_fU<R&?(n!DaX-W4-+K8|N$mJ=?3`Xvf;<9U*75zq
z)V+Xh-Ov`*lm-xs@UNB-lK;$1*)5oTc9M~zCY4t62h8NBYs`N3sT$>)fa%%B+<?_I
zxB}>mLKeVeq<$bhe8-ymm!Rk$^8p*QyHK*1DMr$Qi8lrfe`ci?%`}1E_cy~GHV)f0
z8!fa3yh0_8tDh#CGZzjBwJWF1tmA&`Xg8__#YlxYBl$kZ|H+I|p7<v|#F<m^<<K<w
z#o(ku$`lHlbc~C4@YRBa<qwofwQ8dL+>vcg%C7k|0niY8u$XbD0?2ooXf7n}wU+t^
z{AT|HdC5Dhrk6I5B<7}<bN>nOmC{(Cb2G`xW}4og9B$XDnNRyctGN%7-JBhACQA9-
z^YLj8atxnTIQLIXUQ1O#(oEK;_f%OeLUq0exG);09<6N-CgasOT}egqdQ~9f7{e!g
z!?hS+r}TZ%Gj6qKnhksUM^Jm5HX_&`$f5UvKBq(Fv1|;u0+AUzD+?8xiz<TQHZI`J
z`r2<ltrJ<&vHfP5YMwh>CYEWT4x4ceW@bzOyei_+#F_tvb&yv{=4+sZ<ykAQ%o)YI
z0#gEQXON@SK4o+9|C(ADyC@UMjn>vrcYJ<M8Yq!Kd`~2wLso;{BL1A}q|N5L0esZL
z;UL8KUa0AVA_DJPpT&a(X|e98G{%7!p8gJLy0#^uY}Om+P6Ml`k=+wT*CxtELrkQ?
zjnPt{NHjm*K~%q;zw}2;St`c)f2}#8M336-CGd!qy8pbJa;La*(nML4^t%Q0c*xt=
z-==`B5{QBk`?lwMkBDb5e9*_dz)}l&9xDOiTd7Y$kcNjFlUDjDOzM-Oh=zXT7#tqG
zJQ+Eee1s~mN7NsqdP9fE^Pay`byMAkQrkZr@W=;rh<PLxP)S?Hc)JfZkOgEe8E;SS
z>+`{o*B}Vbb^l8_QmNdia6XbZyMd2(3lsGDM!iVtYJcl3EC3m#QvOmoH_gaszdg`B
z)j9te*Y2fkYMmuyJ7%VaH0$=HxsvC-qva+m{{x#~XT|!P%G@BUwf3l>ySUulMC_Ke
z?r`P7n?BX)-i<R1`y%eDP+{AFF}BAejnc?%AXxS7pdv32rcnCI$;z(AyeEgCsM<rM
zR^TZ3Pt=zI5Snwc&z+2eZh^Hf$Y;Hx-|4I9Q1nnD%PHa7)<a0w6f!*`DCWP4x5>Xy
zBRA2%EmT8$fB4~>Z?ua-UFG!Vnkl;U28L9pNHDL<xWn0zC^vMIEeOxar1bT4^-1SE
zyKtB_DMfwQyV4N8s=cr2nq7b7i6V&i?wDJk>2x?vS>D>PbdQ^lk>T%DPOd@meN8dk
z$>+SH84jz;6IaIi+bYXzY>n8de*ng+TtJ?g{1$bqkS{cGVEVasYxC%zvV|N(aahQ2
z$vmFOnfeMe+fkGO@f*gp&MkH8<E|Q4l{I6pOcIRAHn_uWLa*A5NvN1Q%a(sp*@cTS
zy2lmt)BOu{P~tZP!da}pny(F(4tGZx0FtM=6yJp_y}l)EFAou%5MLNl(7NTI8tr;4
z^OdTCar6T2>54hAi~8hT4^l7<jz%HQovQ%PB<7I;{-Pg9vD=Q*yR=__%C36ReD5Dw
zMDMKNb!{NgfbC+%7w{Pk&E>MaR<9$W=%6Ky>3e2ry7cBaPB?#*J5#wfzP~LO-gCD*
z1SOLNPQ47Wul$j$9i=yk{81DxCCegeHz{)#q~dh!8~8X>9vNf)-j+qnw3qs8dCP*D
z!c(OAGaA_&%fo6RErGPuNZ{8AOGb-LzUzF{pJIUa=|t?8n^WwL=B>%koOy5QSehlc
zC(}>I#McGIj*!W^0OFD3<O<Kg`|GH2SJD4Cg6o{tD6SJ&Y_gx<*Vx+&Cn7cQJaKVm
z;Ewf`fD0{~$!S})NygcZzLo!~t02u-!z^b=>buRCkZrNUA(gjvzcqpy!JRUcH5x7s
z*i^>(Vcm)se*7TU%0TnwzyT`{YVeN2dZ*!aCWdW-0*>EiPNHkMd1rsCLiCVk_v*vf
z2q|*c&y3=gO!1fVJk&e*X^mgQw{p}NB~;>Ao;!6dQbm86N|Y%vH~UK%(((;)P2&{R
zq!bj?5|LFXt!El}#2Ojfqk25o`-1LmDUan6XI#MHt&hPPajPZcky~~4*^)(|74k+l
z=@Vovqf73f59IMWQiL$1J<DHLpdtdT<C{luPEdH-EtQ{SS@Jed<X4CSJF&ZpJd%Fc
ze``-7sg-6wY$^Mz@7j=6iy}5Ix_1z67W|$B$5BlQY|oF)sbzF@zisXpR=LVVzHiGl
zc}3AM;)z|eu2mZeRGe>bi{gEc$$4*}#g2L1;*OmmFRQ(M@oSo)i`Mfry7xn^a80wm
zcd;59e{)E*j8Ju#Eq^<#D?ecs+W#K!5PiFNPd1e$a@xzJG_XAHbN^C|-L;Be=91sW
z`S-)(U#E&gP~r>m^KEA<g)@Zl>8{<?TZIjy+{$Mbvch?5o6x9yh<L%SdtxwetX}>Q
z$7d8eO`uz9nU0pfJW^uuw=n2WHfPWFKS$zHwcgZWg52Z+$nSxQhuqmGGezTe9M|FT
zw$H#BDVcM`f%efIzHJlBxb20;VnT>ncmGc_&#GzWdI$Kd;DhIl2lPB;Yco8KRN)9E
z+Q!PzDrw<OqH0Is-r?oy?T~h20+yY}7e&aDb()n$v70(oQqoNJImj;djEw&75k`~8
z(4~yh(6hp^RzViWFqmK6(OX`LzjQ#wWYI-hfBFl}3O?B9o@TIESE8_U|9bD?_`0tn
zn_yPk`2H|RIq*g>F9Hr;JFR3ZSTnRT-GQ$9$2QwrLQ1LzOx`BRh+f)T6Rz0MRjHw!
zp24v`=?GEuD{8-ykx6R&U)Ctp+b0Anv(Ybb@2&B*0!DSutww8`%g#NGY-G%~-E<>;
z=6^-Vf%(616n@VWar4HVZb!$of8N{VQMCKz7s8fFzm+IG`_bNA%;n`n%tBn^=UNA*
zUK-nVMU~ZcAM!pqs~`{u6Fb_d;q0c1>iw>q5+wR!Ei==w+6bADo^8L91^;8zY)gH7
zYBqUM$Y_+#6jt4uTddVXDl~C+Gg;0za7#F8_!N_yTJeF$SC<k<AUdR<JlZ^hnYbx5
z5tA@uSy{>TK9MVwiwkTh**Z1ZlIiGBpQwsh9+su#O1RFYL?ddK!?u66&UaZuF_w;6
zG{0kh1qZ>HMsg<abjr?|&(7TaN-HcWU^eAaFqz_mz(va{rp=nOVtTffXK=lna}pkc
zx7+I9pYOh6ebMx7!$N^OUf#X)T|YaE=*%3k@wrd!kFuWM?cg&sw)gO#VffHyrBJ<d
zL91933Qc6~_i;hnfdJFPn?!)Oc{!7Tyh?sZbV#;?KW)mH``%H$jebJK4AtY&%dibv
z>@0ld=2NaD&szs$r(9Dpmz60cL4SQs@$FFe{$5mj8^zi3N39X^jGq9<t9KO70K>Cn
zx1%oaM{yeu_!4{4i88|R6v@Fx(+oqeAB}v}%b@pzLOn7rY|#2y>$KrD&9i)a<z`dN
zTEfe0?y%6wcczIu+UW`3oFy^33?pTOwX09j9Q^0;&(MTd*HcFW3#V)3@wVpH$eNkh
z<I@KO9OSlHbmi2~b*Y$=qvJ^mCJHoKAF2<r3ZaQryt(IjO7{LD;}Y*S(H|v3IO-H6
z@Jgq<R|?~uOw4NdMEPV@bWmrAr;m^#bG6TkwbDJ?)8jFV&Jrve{3L%-F6@D)m^tDg
z@~@-2fpl|5A}05XvkcAk0FWoE6?_VC)z1HJ4eU*NP2CLX;?*W{@<tBYFDKTi*TREt
z`G9>>YgJ7Yd2(BVRoAw5x}xO(Ivx4DZd~yhH)V#ng!R$s9a;~5E9vqtjwN$SOm3AW
zO3e}zB};3DQuFpE8tG9Ed_ri{stb=Nn9+*!|Lo*NQ(HWac!5~QQN<_OiUSO^{v4Kp
zk1Zhq+JSHs$A>A)Cv-!fG>k!`-F?m<&sr@^h~0yVu9400qAWZZrZ&+vmfZ6=p=Q@F
z<|pfwlKwqUXi_H=CVqXLL$J0A-+BJ=?$A-fd}M2L9!{-Z)9W-3FWt-vdm45n8|Hj>
z=ZtDkH)4CGVbNLAuMFBeLRuV}D>q@hjKN)DevtAZgLbW>D;M_W^j7uxde}naUTvnN
zmM<bS;iNIa#TapJ1k#PUKWbL;Do}~?=DMNBv);*T#Z5@i{JL?Z+F*aE-2I@ow$6B7
z!CCv;f_dKa91ARxw_vIvQPXo7)xu=7@4;Ld&mH%7zWw(Thsztxz?04*6K!vu+-;x1
z+P>OYsQs+{(iDi0Hp{J9=bjSq*t7?qFj6IDa`Hh&)^SRn^>^4i+rA|H!CGt?xx6c^
zzK6tf6UC1UHzXwvtb#gyA_i((<l??g?fml)y3DW4<=zKp$)Jha@yMWoW-^>;*L0k{
zk5%HV6hUXM)dMTeD=U(3WSZ<PJ#XVyT&oo+S<ouF9?fqeSyNY%To}rO-6}UH2h$dP
zRq*vYD6n=8FwoB$e}x11aoCtX-TA`I8Fn~~ee+#8)Z>4od_V8E-Xi|#LPySs@Pq8v
zH{-Mb2i73MEGzxr^}@Ryy~M%z{u#EzTFt}~VP0WTPj<`W&-y);S?5*$kW2&D=7vH&
zdxzbmHIvqTR8sxy5572weVJc^zy6(1ALjp}$a3!5!01*mOkSp5NIPVLp(NgHn9Qy2
z;>oxx{6xjFSf@<iuHmr43RmAo{T<vf)YamjiqgI^UL&;afc04&CsuuR#h1jcb<Vs$
zJg{Ov<sKzTcoTBqRl-g_)Ie8kIX{UoPSZi<^~&_3$8F_h<5z4u`bHpGp>g|j7BZJ(
zMwD^cFUoFPzU4NQ+kHJh5m{SEWTmXy_Ifsu6&ZL?+1611T>b9fT!d{@7_ukzJ?dd=
zsD;wdR-FA#dXL^;E$)A<4cj+Q4A^ZNgdx=+W%YTt{Uao^^bsQ8wbI|6ZmBe^<LxB{
z$9;4B=U}F#fJm=4!O?Zslb)WYQfU;hn9$e6CAj$!X&6Kg-#J}&;mQiPO5qfr@E(Pk
zt5rMODC4NlDF3xHFg)AiS#Jr?i7zqU`Rj?^d>*B)jMzbKb4$zHJbX=Kmm^aeZKl^d
zh)Yx`640^#x2<dLWCkrfy)4**?ir@^O2NAm!?V8ZT(u}!?!tubRru0VWCSF2nvnPu
zr<zv3um&psWNgw&v%)GXX6pUOO>t6lsakA5Aku8agR9d{nxN*2X(ww59*gD9@MvHx
zp~|$}Jc>#1PUw_AEJOTt3GWd_X@YHN7(r`-MfF`ke4)`WKH~A4Rpsf>+ac>qX%&Q-
z=1idY%wdUpb!7u>AZaeVwFbRocY0hsvYq%hm6szPk1&*&pl5|u51ia2eofyKKA7Zs
z&^QDvxSG{Qe0^}Oc6z1KIKk%EAh-Il<hNyG8s{NbKm7BS5_nPVn$BrpTOOM{bKgi4
z47t|?YBB|rB9;H7zxHRfr`;8X_qf=AtnHqzwPh;0y7@+Z_6uWak3M~F`M+L(Mek#f
z(w4JQQvAB{hF*iQD34(r=?Eb=K&6b)^=5s})SK7T!WSs@z9W!{@m-7p)(f%QFdU~)
zCP(aRPQ2Nd-|E>q;p%krAN#;Cut^yBTMdq!wdY}A-uG7pNX5jApKtb#W-waceRy7X
z+f9$JL=TWCwGpvnk!vRR`4=T&c_{JniCFv^6R~|&H$hy@g(wepoT;|JlttrGFSAL2
z><3;_>n&EhUPgwGEZW=KBUuA$%x;%LC&O4%4o6Y;GX-%p<-8TcqDyJ{AhGm}<_GP%
zDrBH5JD7Fi0EK}rM~AW^giAf^>St508P6dAbYXtfa;+bP!xhM*%S8Z?B&iOcnuM&X
zkP|KvyWPaj*Q+m`8Fw1@gj*<FH;Qx{(t`)GsdbBRwVxys+}Ly{C(uzkk1*n8{QB*y
z-@qCefP!Ys)J3RKpXwVJ6##s<*1)QzJVg-aA*c6)UTluMg%ItMkxo-HyEA<0_~*_&
z)W6B%p{Y1ILO-Izjp-^48X%^=SASumhRKl|$i==$5`HtiglTB*zrW-cGRjcs$nYQo
z2t57Cr|3q1V=sWhZo5^Y%OxY$HeXpWX%ee%+O||nR(^M^`AJbK2wf++{XW0}F8E&(
zwj6`E0&`D%f2D`6A@m<;3IH-B>Spy59=hZWo!?p7*?i<I!HVi@ukKiZCH9spn2~*d
zpngj`r8t_+xW<RlDm@&NN)^&)4Gs>v?MGk}yuQ9x8YdCbm2kbEJ4PkqqCnglilg=P
z^el+hU`P<7ppd=p)uvU>{O@Qzw?hU0q=Zf>29JmP14s5EGLs~<FpbZqgaO9K9dB2)
zKzWYQ&{S6%A^4ui1tnnzuryzc+|kqn0T8tL{vr#l79W)A@s^JPwIU-b<);F~St161
zcr(5AaNCujKS2RcZ^QqOrmqZ&s|&V0I6;EDySuwXaM$4O?m8j3LvXj??ykYzgNGo&
z-Sy7*?z{72rfO=c&Y9DDclTPoy7z<Qw>-lF2mT)y7t*q{sf-y3YlkdVs-2Rqk4m^e
zMtW%F-g7Xt+C{wFmYS0(TMg5A{fNdB=E~=(c{cCQq>5BNW!bwRx_S8e=4^`zB@wFr
z(`q+Qs?N#JKQ<@S1eH7tZ({#Ck^}jWumJE(EY4HF?1$>fn&P+NJOLks;2m<mvjX%T
zyC;tKe9G49=<NM8d^QXzP51DCqx2@>^GM+SYEoj>agYct_*G}dvC3cU_hfp+bzAT`
z5gH){B0|nG)9B+nFTh)4NQ=J~zpYX=kq8C41F59LKgke7fWTJHgEATpsz(I$&HSE;
ziHj5`<loM5fwo`ww|u-xfgH?syI2Q2%QXzoJ{Kf3y+mo<V{PeathZjNl_^t)*oHwd
z`N<s{240vbNdT!s+?7;z(Bb%P!(64uae7siQEdeIi7SDxIb*;`ahT&oN9i<MUJ8@o
zRqzr0w9eD{SfEYCuQJu5wH60N06e{*Tuq|e@MAyCsO0BQgD&qm1sI4wtBqEavT=lb
z?4+c9O&h28ZsEE3)l|@LSmhJi80hRD8vdbpM*}QeE9%dWQciO6`FJKTkZjzUUh?>@
z+|6aPtVH;&d;%Y;F0*rNV~(`2Q3}_h=}(7dg{LsgWv5J7AGkiOG%~p|ir&@}UcYLX
zlA^yN;JYuL$adqB6&gC9oq7-w+zty%S0+lD2-4m6BVde9zUY;i4b_>@Zrg_T3+h(!
z_x4F+g6OtriIM%#y}O*Yw(D&VhwsuXr#F#+u5ScOJj$fYn-TvOD(=a8FebTYM)%Il
z=V8xhZ^og}s<>a$g;zoRMWYg9_bGqzI`Oz|Is~%@xG<_MYglxIrd*cdkHcqv#~!Py
z>E0K5aBnM!`Uu9sC9*qyUkH0L|Hk=J>VXaCYOu!Pa2{FswQ>u&>NzZl-Q#*s1VVJ9
zsHaU?LasnI!?x#W*eB2{wY0gM9GmQ1O?!g{(}H7EoXVJY+$0HI^ZlFOwO@)Nv(r*#
zjYseEbs1($ZFK=O2EK9_RZPhYW*{Ugba|3Yo9EdY9*5;*7LU`_-=Uv*j_WNB10kPk
zje74N9)fBu@yp57i<(fEVT0eJpfTqxZIW4T7I-uhBJx)^wHijy$Dm}7<IF!|W53Oh
z_&e}Pe)-)aswOLxdpUd?Uwm6g3b;RxsOLyHiv^h2yRgm=2f>zeG|%)zX1y=7z4KAa
zQ`f}JK!Orj+R!SYL&waAp@{wt-P9^~@t4f$xn-CxRti%oQr}?OGt^KEk4S^Y)#nNQ
z2dKt1a%e*+0;&rDS=rmUQc7KqD}~LBQVOAJil;~luTL^l7JQYifrb;dY-s(f$95;U
zvGGUe4*?G|O~=N<40sSzi=|&1IyWU(ooL6=b}2DjSkePM&6N<&4;3s+RipH^x=YOe
zN(KJo&eUg9&(^Mc15s0N?W8>=YveYX$C5U1^~z_xGQn}y(!=L!hfMs<bqZp{{_+n-
zXf^P2$!F86qNh#W+~vq32413_M+3@<g=NyHGElW|cA<9yWAEF!pSiU#wI=!icv3<t
z)7P-@aHDQtEO3zoHSlgpyVL6;b<7+$tlLQ*0#GV@Bq>~XJshh?HO{~um?5sks%8}~
zVn?@*5`)ydx=y}3_%InjftlE*h54qhE;C!u&FWs=Nv>+fPlN#Eu=w5x;mSVfqJ*cy
z!x|I^zg=|LP--M1K=xH3g=@<!ZIqBJ3hR=Zfmz|&hobM~-!E;7g9xdd?L?`Gf9zYZ
zO7#B4?3o{JyyG^}_bJpu`Jx1yN69J{!Fv?aZ8nizD#W6zoI?tqOr^|E`fiJ$sYCnb
zMgr7P1Zn3H4Z;i6_$~e;5}xq_Zl=jFP66OXH?s4$T}`}s^Hz1ca1zHKddD1j>_e`9
zG&j#PspshycV}_IDQ4A{PK=Kh2tdSeK(wn5%n1(ev&*AJ5C3z<-XE9s3^UyGX}kq&
zD9~;u32i&O-}@SUhPgB959y1lgUU|=u(B*Y?&)YI@HJuANOY%1ZADyZ<A^5Um$kJu
zcx1=!NW74sAmg&la#e<5ZLi;oAi}SgU~KWs<7-FsLpF{CZEeONeHA@Oh`y4HvMoIl
zHL31L=6;tZlAi^J%6`y5wes^-!0$}`ziKDiQYnL4{64qX6%7#tyN%{7(H~t=8mzB8
z51^WK!`khW40C?DzO(`AXb0My_rD4j#!ibriL|e!vogkAkqdAkId>8;5nJ4l=Y>11
zhfF3kWo<8=cP}x^OWDNW^B9uMdvA>+_ndI@yk0!AshKJK-sqHWn5!<Cqi$3?(q7Vc
zCYn^;E)%}~TEI^K=fh4{SV3~y`3<HxvDQG<g@MsI{yYw+Xvk-?8eXXvv7#s^{Z2+@
zbp{tX{E*5<!70&w#`GQM#5u9h`340rejCI;YYe}}c!2<Iw-fccbxz{lK;(xI)?`bJ
zVXY$a;10WPT@w9Nv6x;}@wtI^IL2o-r{bXMhN6vAm4qp<vk}Hh!4&T{6mkC3M<EmE
z?d#jHdfL>~l%Jo^?XWhPBcRR5eeOgqt452tT&_N{y886~_ClXhVc6~Ku-=lxVHGDz
z>dmq|FaG7`9GdV{dary-5mGjzrm9^9u>Rm>{HW1Lin)S>o-cb%R&)VWoC=}?1WX3*
zvww9DXUzOLLpF+u{;Yox?oz*3ZG){j>lB=$UOY>Ytne)3Vy5>QXp6l=<!SZhe!c?1
zov-4>oYGv{8oq+Ui8CRur*y|V*k&5bg+1d#T<g_-+V*X(j>|{?`LYZZMz3_dA%nTJ
z)AEwka;=lv7TbL5YJc7X_o{TZkHg$JxJFhcH*;22+Ln3ZhIiMyB&0iL?QHbW#&+EG
zLyqJwF3*+Am{Wdn^UBoIyQW(s4NXw)!ITDYemT`5CK)5~5btTE0pN$v$p2ncFgrm2
zj_b_X%Ldoj0R|lm;MMM`{o&Zgog!f}!`;<llB}P?71VeWcCk3Kd)-RJWV`>o&SPF6
zXg2M+P?J8rtP~w~eCMlH=q+G}1GHVF$24SI6R^0o=6;vkZ78DwzOeN8#)m_09<-YB
zUm^Qs?2h#Awh-Z$HK7s<`8EZ8yxVj8f#<}44I-s_yIlR1L8}TC9(p8>$ZoBP4(JMe
z<7Z_>1;UW<<~zNdz+;rYwmLEybZAhb6A5@SGBQ>@|3CZ1LFb(+(tFgxY3@vr8>^dj
z6W{X6Trqx}l^_rX=QG99BB#`|=(=vZ9yWJ$4j?!kthVmh-FVEDraXRV6$ca5F3w>m
z+0ama5{TADKDn?-zf&%eu?h<ycwhHJ75WPU+;$yiW=uBOP<wOp+?|QQRM&>*D^R{G
zbB$>KStLvp)~4m;CTB4?wqX0>MvGO@`U!Q>YLCQU@(OB^Ej05mT5G$CPDkK7+6GFq
zO>w*M$|CWiFMCRF`8A1#hiJ}CnL7c{*EN&$DX~Nk9+*rGZ{mTw3d_+vjoynFq~3PW
z@5NN&r`;691wwwbRw~u3{M0zDS@q|@$GDE}lIYAB#LH!_cwyl+5d#u>&&r<LU4+0&
zFw&BEHybHvAbd4ICvdu0vY_ow&+|U<toTb<XO5w~^<Q?RLfTV8dZC9hMgsl7W2HR?
z2++P6B0#&{Cc|T6kEO&9`zi#8p*fTUkE)tq_*O(!lP;1dT9n10%26ie=aXhAcs`tO
zf;U{@_2c7XT^(!Um)pHD4DkEw(+x|{qv`G8+(HS~g@C+*g8gDyVsrBy*d0E-9*^TP
zg>aI5N-MuRCAZgzymloNgEDl3R3z%3f1E_w^S+_i=&!qT{G0<_(b|#L88P`b?7#(!
zH7S@$>@tx@_Dd}uM>xl6!)R?stBzXUtMP)M7K_Qhqv9tErfbU5gsK<*`6s3BNsFr#
z{MeMghDk5MCGBvAAUDziPv(u5Ip1SwMe;)4<{{D$pzo+d{_Y~}=ajU=gGxI^#bdoD
zV%0RowPKkrS*3i_fr5l(w8Prh-3;Vj(RS|RECK+;V~m%QX77wFwQ&DsnLu&hgP@YP
zyC{hQfjskyB1_#h<yxAv*9}pwd_1$a{jgjNE#<-N`h#`me2=vgWnq)qW1M@ix=sSV
z^c&8^HVi=9j=#?;n^AE&N+h*N;H}-o?QYV6;IWDTh-M56;YfbN2a+tc`Z0c%Bc-4X
zgd*ZF>(m*atu-%{D)aa?x$F*?tCunxbTnm~;SzA$r-Pl}cnX8nRHmk)-N!sa<*I}x
z-e__vbMXw?va7!qkCopgMp}33#x!HE<!q`nqm1YAa9aamKiH$Wpi%gERBhWobe+JA
ztw(=PhGn@q@NGb*hX>-&23kugXRys5t3R1_Ixjh;e6tId<;(ElBm%D0GopC+E1!l+
z8C}h0Z?`$}Sx9lo0}4jF5aGe=xn0+AT7qt<(SLSr-@eyI=p9j!KMG@&6cq|MH?Ez4
z18D!-8mt-*&!7wh(?I31->AUjD1C%)vHF-amSm2V%8?xapgd-Hzd=>r2%S}5RV{Zm
z&%GdH@ftjoz2`uEcp+1r$XtdqO7cRkl5k*xbsfD=inR$}S^|uA@*8fvCgtpV@rG|*
zRfW8D>;9SFS4aS)yu=3$f#d5o1d5dwZ>}4+TE6AKN@$>h7d(jm-NOJSSpnnPU&q-7
zJ*|s2pirg|5NC$32D8<1y3JCJGashGW&rZ-R%(8dNJ&ZpecgWhQnhCr?HquA8xbc7
z$r?pf^JA6cXWxMH`d<iCtd9@F`XYhL1&a-YVgUTsRzd>0I7-NFztYzIvIY!9{^ob-
zW5&%KN2(qPs8+5qk-S6?N-AeXR%S~<f;U`XO%Q2D_{W27?v*`gJ*|fL$3~-)<p^`!
zjouvjhdcUA_!;NC{FV5%r%?-S;peZk(OEt#HjX%Bq3)B@(z9%&0mGJtFYrVAH-#qO
zX(>fpyvP97udh|zcY~b)DkS)fmqsB+(t_nyZ5A!RYrF4Y09O3T1tCLlH)jOX@eRh5
z-lx)6=1tyVXC~ZxsBtXZJrzNV_T#@MQ+96kbckZ5B@Kud{}AODDPktm+{A@4ay@C|
zk%46WYQ@RvRr}jx{R1ycpLJB9sCfr<%l8{Y`~32Raqo~=e6FatxYRF{;sxyz)IY{T
z#7(@tA2T?tl(Ko}3Z)Q5L_`|-)yl!{{=czj^z;>(%k#u!Q{m)~)>g^kl^DfNJVN17
zCCtG=PLoYmvLx6l3N_nK)%)?T94+0P)yCTst3C0JdxqbrWsmD7c`oz{G7z{0G*M6~
zZS45np|*{_4l8zlqNdkr5`zVf9WHTruoI&GB8L|aldCBvy3X5(3&rJqaeb@)2xA>W
z96K3%Fu37&lWZ7}WT_P@Vo%MjPmCRZ@hF|BH9~ww*3uWAIqCi4vWMDP&NhlM;LN4}
z2YCj4E^+A%dYfUdvIYRHbjk?YK?1N?(7@&{)hY4AB25;qM#91y=s1~elE~@Tr=eUn
zDWTE(HzeTiQI-eW1D2I1LT|EOP%B^15G8<$gv%uGD#KTVQ=XqMFW?x>>Y%3AALk|b
zkC{)mfAM);>Q?aIKd~=gzPP*JPNcCQXPGMa+#RPBKxR!5g9pO>ip1ctXWh=WS6TJF
zI}RYU6M+Q7E$-u-vl6A`@w`2Yv+Bjd>1ehGh(0R^w-O30o};i;B(Yuj>eCnAQj*b@
z^P~MWZO`s2A#3|BiTRe87>ssUtYrNeQ27x3??cJ9wsy_wBYRwAz<5(U*@g0}oqB0m
zwc5YiiW@GqpEsKu+$L+t=`gRTSA#7$5Wp9D&ozg2Iw-n~%p>vxuM=267tsq5HU<(9
zWdmmI@WKLB7;a`&xRC$q{vc=K1idhkn&Mz?RwyA`c<~qau)+hFe!lD{DE$Ef^zqme
zCOaLnVTeaHKLOCE>X2P*6}hDK8UcZ>=KDMKCy^Jq_>(%@_UCtrv4X({4sEbCO3DY5
zR+FVE1Om0*1f^%2nQA56)W{d8O0du0zW#3hnQ!$~u4MAjQ*qyDsv>ANm_kz?kI8!P
zkX2YRs{jB}D}jDhV0OP8AayzLn|PK~$FA0EUTd~naq4~3(u4Op{S5&yeQnuuZJ)~I
zdO4}>#b(qoc5raevpQL>24=xi5|6(YO3xj8sRbOC&wcRMY=<}>N5~5VgR@O#GyRBv
z8!Ee6RoUO`qyFs=nQ@dEPwzbTIVf@-RfNDOL*yS-rygT2?UD`Mc-P$M{Xkb7u6+Rd
z0#q3cTG-8YB}zZtp;BkQSF%aBoHczLcuwd(;x?rD^2VEbMlowimYx%Px;>GtCB$pe
z|74fu);Xn?YX}2WDXnwj4Da?B0kwQr=B~)M@NDs==B^P#GLy?rO)Dqqsda1bHSKzg
zf!U6B<pbtZ)!;E}ByJ#uj?#{%ttyPljFaZtBCJxcuR#xpKh-cDb*wp@u&91uR<XpT
zTX2~$4h|aJ>}BjFu)#3bDyj#TF2hIbw!PFn`yc_}9$=V-^_=7}E)?QKwa|Qd`H-n%
zb2*3k^<V><e5CAydt=|VB$(kN6%CbaO&W`N$7sdZ2ZA^6v6SRVBJ5O3n+geC^&*Mz
z&x*3L?LIfuKmz4ziDDKwYpe#R{m-{Yv{8^CFi--Ig$((G0UnR&xjT%EG+1NQy9NFk
zIEWJRI`=uZsno7GfvJhVzaka0xVwFBEbj)VPRV{@Y5Ug3^dZXQ%!}*Tx#VtuFs!Tn
zQ?u%uCok~xny2pc=ywDr?7qak8Tc>>%EBaa&bY#?I1Qp<r*`bcNnzQ$lV@urlz@XN
z@dQ8h4BJ8Po&Fa0(Mu(O>fa%=mH0TBBTd!v<_oGLri>A=|JWQo#p;CUvpg>AGV;3a
zh*inn8noHa@c3W`E}uUNdD*j8O(XA@1vUOe!c@;~o=jN3>w9%NVu@6sz#L~P{#=Cu
zj_Xp!GmYy%7wxzhH2FXiDqVc7=>3Yhc^yWie#$}I`X_#i<zqM66&5QtGp^lx6vg3R
z(<!La*EUaPBJP64*S7VKOvqTmsX)Gu&1>N=Z+$gY@@Mi|4>Lo_%2OZd(pk@8=hQrb
z#1uH7L473!Wip60<@-pcqk=YCVv(rM(001{Hv}N5S4jOS(3)OZR~#1=6%_+R{Wdf&
zJ9`7n`-G#AgoT7O*)B!(8*hO30~n&+oveuX-j>D3#}}*}Ol6fS<sAR{Gh6+Yr(VbZ
z=3olUSAcQC!{gO%PfyQMYbqE?qeQH*RNp2GUwC(&8cH9PD(ynD2^TTS%z`{ZIz5zG
zp5Ce^H&eAYyS17r5SB{le_xuyfvLi>A8b1y#jopKmF>Wv7D{%HEnVPJA1krtk)KQz
z3iMK_l_WowWJh-|@%ChL|B1s9S8r8`AiZ^`Zf8bqv9x;cQ4^@k;$gBH^W8~vEAC8%
z0BB4bj$f%g_o(ky$6`PQ@U`FWckHEqP;~gcRo;~cNM8O)`xTw<N}t{yW(hw`^uyr-
z5g4Egs+e||9m;gV;~F}6u}GG)IVLsr7p7}<&a7b9i9efgc9U#p1V$g1UH|Z873}!H
z#jMkY5J4g1Y@nu1a^Y;7NOnR5@`WF{_oVzx5{Cz%#q3ub_7}_5m2(B>j@-da_~AzT
z&F#?w9#WXiAeaThV$j;?_S0rg<FTG4B_}rpBQVBgztM9@E@}89u7Ne_PoEggR=Pd3
zy}DC<`3}W(bK0hnuv$E)e_wZ19nH?uA9j<5><-TSP62XaJYwkEnxapAAzy>k7W0Dx
zJ3HN8tJDs*0U%3ws}?r9K8Kst>&*yUc<A2wsMx$E`!D(_(!&9_2)mvv8{NXdp=LXf
z?-u}CYWTH=d(fSskPZ!$-SN_IzmobOfAdBQS!(~%bEKm&V2xMXd8F?C)ik(iMQTZe
zNHL2*LxuIA?(~7|v}6QkH;4xPypq`wEuh<=!6bWC$7doIZs0d^Cb-Gzs@qFT3>e*Z
zK?1T@0+9iwN@@ZGx}UIsd%5n@x-$P%Bxci1E5Z8wWyHP>6fho6*T9e>6lu-V7q7jY
zdNe7aBAHbr?sL1MfkivfO2-t-8>gJXZZV!rx9^2ZOdJSCI@c#%99-tH3GaxNLbwOw
zOIJxT)yfk|q5wSqBHe?x>Alzl4V6Dn%iPJAji?mP3+BnjjqfWJp4VkaEi|3yW6b|O
zm^hS=q099!`_LikfOV}W%I?cof=;r#HnPt)@-+nGY!Hoq%n6Yo0B^28F=vbK?Y+bh
zz`6|-mUdyRhkbMqJ$hs<AnN%WmqNNW2@<%nCrPJ_T9VH*t4SMcnlc}toOHv<xTPW|
z);cIvfnwDZo3z8q;6>bTQ?E!a6xS-1$wVvwj8()CT_0b-l_)6R^64saHIl36w~)&!
z03_o4nZ7Rd{hbMjpsprc*xe6uf&}h%{R-<Ft9lGdv?~#U44?t-8*PxG@|ZcyNgyn+
z9x6h?m`eTp?Uu#tz_8M#2(jhs@084U#S9ZAj?^4*s+qPMRemEQlgeO}Rr4oY!2Ha+
zAcn5Y6^E1a0$PYmkKj^o3EyJ3SU>CbZHk`jR)2xdMmmz|!b91E27#+KJmrYdx7LBB
z^GEK@%1H-J=b`HoThZjhBcJ~!@$ECXjKCYTo~m}j9@M?h--<<TjKzeUS~5!1^yVvi
z4!i64c`h9<X?q0#YA0BSG6MeAYL9y|QT%+0;ZN+~u~N+9AgG=f&V~WJ|9Jjg;ssdY
zO;lkP_v!AIuRT+gArAs`6xg<1!eMerjqVr?GE}`1&!1ikzbb8?RG96bEt_#2m-~1_
z0xG#WtghwE!g@ZA;ojrE-O_ZchJ*|u3r$3wnv#j+u9+==n~sWCtdXKdZRTUvYlH?&
z?TorbS8>n(#?-AQi^~?5$h}uN2KrnmCUz)*AKFK+QSzudgy{UKJZ_p8y~omN-T{Xx
zfrWv~&xdjEMe#n=HHz2ME4`)6{Q+$n`O4zpa}lpu42^z~S`%p(lfE9M$VMl-c_zXL
zSRhZ42pqf2b}2OdAppS(6O%@XL<GHu>Jhucq@HVfz?p#8R-LM3DP;4j38Z6x-anx4
zz0(91%U$n1#fE5Ui30%Rvqmo%pj%o>?gj#QID!UFnX{IxVn#lV#<&^tvdH2EEgfNb
z0X>Yz71HITKmuL$R1<1#o?S(7Oo@}bS8S)O$IL&DEaKTME@C#$GSbo+uB9t(YyqA!
zQa}Y^R}Vhu58;#11OVD><LH#t{!U(Tjvv(ToY|tj*<ILSr(Yz+r!V(YW0S$qeUH;d
zt8K)*b1KOPAQkbH!!jVeG?=X~sPn@BNN+4G@6DO%bK6>?ZtIEka4_mHQ8>8p@Z-V~
zujC^!@0$?j{n4%CFK?(1&1=(yDzF;|T}*L1<6^IEwC-!7IJDu{AEWr;il>FB?01gY
zITWx{5?i_^f6GhJ!&4KO1AQj;gH=RxC0q`r$kPTvsKD=j!_$tf&~Ro5&`pQU(L$^h
zRMdtTINqH9?0QE5oc*e_a<j)AKYl!4i$}xe>l?{Ek&Kf}9QjFjRAB+ma7JpxU?w~J
z+|GmLgABbUFl27EfUHV12<S7&fgruWxp5<s`W@>?e!N#ZkxGGt`QB@%@kUK!<>j%P
zH0yu9h#H@OJ@A1IE5mwMDwm_{X@DzB=W)aUzMbv3(ckq{)Rbq`O%tnn8_J0Y`~eG@
z>wSEId;JX^%~@QGRw;Axbsvs8_Xvn1eeFbk^enjmuv4cSwa_^hOb8fry^3RWlQbfd
zy3wZuyl_BztVvoZNb4B-Dw^^wr4!}auw;ba{JCwf;NQXqc;DU&<{fR%tIcJYW!hWD
z&CDP~S+B~DC)LQ?8^~5Gq6V+|08!bPIMPH%g<k!-7iU!>{n35SdlOp9)W`qR0>E{$
zXIDdzzP-Ht?5IcTHfmaK6mxn>lzGJ;V>0-n9Q#gFM_@>@%l6yDezD#s#RVFo&%>nn
z*g|WI%#1vDo<5>3>Om*#Id~(Cxq%>(wL#LUWkF`IW*zDy50eX9=?tYU6smn-=f{7P
z2fUHFiddKtoWUuT*6t@M`ceBHbw58$3hSQp{lf7sRmHIJbR;mA`=!s5U^5i?iETyK
ze2spvSquh`Y5K^~gSo<3qd)hb28}Potts^9;eZahcw{)>JVC<z*ns?rtaU^@#HsSp
zja|T>w9!Rm>Bz`k76k$%;tg@IS1DL8jYEPA6xw_R&B}4($>1R6!U7H7EjoOGgu6HP
z=>3|LSR2w5RhI$cSdDmeH)bJ*N{kajhz;L+1*`t`A?+OMC9{r8G;pX8!wA0?=EBc>
zfIdTer@0gnOh~rdm3}kG7{ABJYTT%Hd)U(M9&ga;w=q;!tC-$$-f})^X(0JI+hgF|
zQ1!W5`eC6fN_)!(iTXz&@TcjuGUg(Pqk8PN8YTaq=b3t2zyI}*1&<6ec?p;Ox}`NZ
z4u%`)JPL1T_N#%S!_+xmEw5hQd$#i%uD`#hG(IzY`j{~AjTOK8XYM%TlWs<|+VWBA
ze=I=YRw40gQ#*GZ0eJ1%Hm(Wu4aIEo@%>5Y<}9H@C`UIKLMS8)PTs32+11?ZXSik<
z;6-iGE)+Kb2s86$eX4ad6aFhyBvrvF&7M&fglbXslX5a*GNzDblI@&sM5XRA0lllV
z=*>~*)K-r<_cE#MgF6i&Stdc7TTB?H00(I<ZD}eCr*6l3;f2k}^#;|QZ|cCGE??j0
zNsoP8Qr!D)`)${at;kXCc&NUk$D-rErqR{5aOop<?0oqZ)#+z>wk+Xw<ayT9%W!~a
zyq#~ghFgt{#To**wB>L#amJ_YWBRFf8(qViWt}e<3%|g}y=Qzm%lKiFcB4ORGL2ke
zHw1$!1xj?fLP*Mk&`O$>PznHeGoPmlj*(<;bR`hU6k`XiE^vx9esDg0(Z!ksD?2s<
zkFxk*boc_+6o^tEPK1HFj9IvSH#e=cR^eZ_$aBLPa3O;^_^5dCcn}62wNpRFGY711
z#UEJPvJskzEgwnD|B{$bD{fpM3K|DLo7;J|_AZtBrEN#82M8ad=C?OVr`-bJF@OJz
zl^`U=laJ?15M-Ki-#Dlk>Pc|-udlT~e%URlxKONBHLRS^feJFy6+G-)*!gwehOhl4
zLVu%NPYK_Wtf6amKEa%dTt_sLb-II1@_}_a%xU)YyWGff@4PXawh#Qbe1e4OUsoD-
z54+k(P|de;zh?f*ZV0Qx-$GO=Huk!Lwx63P1$deAlCIvQ8>xfef0)a}L@pwq=j*~~
z{TR#iqv}a?iO-dEjl`Yx{-gCbW&cZV9!yzhoE#n6BEo)4QSt@ZC#cF3pQ&E7Q{qxl
z8gR*Q5(zI7?z0N<v7=V3YAFW5dd#Vws|O8C_Q9W3-c0%?PD(>@uC$(@Z&BrtmAa?{
z#*dG(DCb;EBh{gQ#m=1JDkot&$1nOFMTs0Em=+>&1nz@Z=BXL2n2o{AgrU;RhVHtj
z{F_xlXu`qn4tsBOZvK3l7QI3C;Hj{s?gT`i**fjgkHu3(3*so2>fksAOSz98a~*s}
zM8nelC`350FL2J}ewMTGO4u|hc%D}-p_<eZXy%dDJdhFwPZDy_IDc%&H5JAgeN_56
zfj4F9?)A#BAksNPcQ<wp?rOe79B`Y>{>a=kBY3*+Ik=~{JXDz!2AWYcPKo+#IpLdc
z1_{597W-9Ho<M*w_z2uS&sS2WClqPRqG6)|x3+v4IT3!~@|<C{2C*)4?rrSBkh;Sp
zgM+=oTz<AO%So+o0*os_inzZP;y&hb164ciw#GpO10qGrRm)<w0&hof4WA(tc?d)n
zHPRmS52opHNzR(A_z4%6us>L0E{etmOREKMD{jYxhR;{#j((|WBhYokl@gV)Jbx*z
zn~k7yV@Y7bhKlgL+WkUqu-SX9W8iLqp$Qdm{-~FnjB}+o?$I7?^GrFa;QqEEASp=j
z%l=8huW|fHO|>Or(=6-yl5~)XqYMswFvQRnMA%oQJ;9|_s*43J0Jz+k&D!Z(u^5Zg
zms%@C?EknIL!I3(GnLM+Zevq)`1T*JjGK66&J5XTI1rz5PT!QNrD|A7X@6>jcl-gH
zU4neQe8IkPtryPLt*@ww3P`>Q$j2rB17#{jrSi>!0>%e5<8Y!}gK1OtKN&7Q)23|K
zRuC=Is=Sbto#ruA4cp)8`xP-)zClgx*C8-)9LJhNBT=f?+MU-Jdp+VcBT}n7+Bnu$
zb!irkF?cw|L<e^~S^@d;-i~eiE!NYw_XGA0z#wgTlkxh6RCS1hKWc8o$^Z!}Wx)Bj
zaTFPKJDp;$=TVAj8Ai&zg3vn8zs(L2x%sXwTNN=BqjqXCv*ltoGPC4`{hO-Hoqtev
z!|*#VhS4+HE$OY%lp4Rtku3>!JG5aT<!VhsaCwI3Eu{q-L*FfTbKXyuiO4(@|4QWA
z2%<u}aR}XA{>*B`hd08~A%#2bYv4<@&W`^USC=E22Zxk+pBd_0QsVqfSipV`{%Zi>
z_#u)a6V{d0e=m=tszwLwF&kOjk6J4DDfIQ9NlE5bU0xD7M1>mobAF)NMxf5a9ovx^
zu7_Ep-)OLKFldO4@V(tq4%r>#wePW%{W?v%OWrXzEZEC;i49+1jUbsTWCw@tvfo-B
zBfKXTTmj9`_q~7x0-0t4JOIwo0QmLkE_CLy$+l)Fbu4HQIo7Z59FaJ2`>jhtjEO4=
zt5*%eFJb3L%BM9vOCK%JfYzSP)T$%6O5~whOU>z}%^KYM>ja5>TNny=;Jl4^XAR=J
zOm}xtduR5}0t5<PFzb_VtVZ4kWb+*a5JCmyT)jxSm@@<BGdU>0Y1r9gElr`;=lPuB
z?*%Ow{A9eT-RGQxb6T^FMAgBZToB-#{bJy=b92_Rkk{bRIBzguEM(EfO|2SO;9UyE
zQ&n@_e>2{Mg_Obk(%6L&Qc^cSZB1-nU58Ixm+JkdNcHl{0tzoiSKdTgp<O|_d-?7?
zUooIXI}tUH3C_@mYT-v@-RebvI=vb(@9AT=?+~CRTNqn{LjJ9vNtO{-j^Md6-w`Y9
z4!(l9>g{?wnkr_}eBVd$z;{pG9Nqwu#QF{I>^U<RFf)t-Ah47kyvjOdlxzO~B$N4m
z!PmUD)>{e{u<yY`#-w_A3FdxsusFW)i%<UO?mX0b98x%XU)o=^YRxO{>H4+jS^s<;
zUxKBB_F+5i#T2Bn=*XC&zD1p>2X(+ig%P4@8_dHC+m`M<yX8D#AMj(mQ>iO`;@CUS
zyE)z8ukiKY0%l~Xu^iIoK8b06vHpA=w7nr;3l~?d_Jg|U4&1q$=K3~D!7Rlz`D0GK
z=)-`%JQx72uUi|A^kyMM4ZlODhk^=AP$O3qoIK(^A(K%D5WxEwl&qm&s->a{2IGHS
zj0RySZfXCRZoYj6m>@)Jm%wcO(pArasTpAG*;YK${?m`21klNuR^#*Xh{s7jPuP6H
z9Qbo&L8oCtXg#me1I8StC>x2&mfd8He>oo}DQLdL3mGrlQRY56>|ozG@P1ZbuM@1g
z^PN2zP1YUx{&7|`5nQ!xRQ7`sxJcSf3oDVEB_>mZan9mV+p4iYhvWd?m*dE{@#y`Z
zuKVs!QXZC`7W^Y`IH+uha>?Gc6zKFGhrz>0lOC8EmVs?U?rC%suRI2e+F&W*b3{b0
ztfe6=I6Z;$^+`IA`=F1t;P47%-if{abAg@LQF~MxH<g<0WA<htBP46V{N7k`Ax=~N
z=>NZ&6z4_kJiQLt<gCe>4E8)L1kgC<d)94JLghV*{rBh>I#r-R<nJ|~Ht^uRo;h=U
zi9xR5Xtv&)UzN_$Tp3e^5j@+fK11K^o#W9W0<_s}7*f>9JCF~yNFMS^+EuPPirU$h
zYfj_TZyWUYGyW14Bk|yf^%|NhF^?v-BL{e7z_foIM=Y=k`<G;?U_~5EzDAgGEoHb|
zqpjH-RYI*I5t5LL|E5fVKP&6{D1P^{<3)s|phcybu(K_TV@8PiaHgZh#eM`Y`iYEF
zT@1+AtYeG<r%<<&CUacG?rGkui_Wopu~Mfp=*oH!`X-zKqCFX4;vW`RypcKM5&`uC
zef9z0$2-Nk(h&i3xePJuDdX06G&J6C*Pm?v{Y=|WdZOy_weQKQ(JrTJht#CH&h)c*
zb=Pt&oV1@QfzJ|X|G<qij(C-=p|4@J*~*bylaNpsZjyQ29&%j%;$R=Omv=newD&+9
zzPkFQB`f?>Gkoa;`BKJHn4Po=%jQH7qZY&2XLddPl}%fNz<*^^(Db!`&q_D}P&hSu
zeAgrbo}$soIkr`wafs2Plm|2*-A&YYH7lhHe`yKAx{5#WXE9^A_}me~-k7GNoL3wr
zHz@So0*;Y}opaE~@t<56Z1EFehOD=S{!w=WzB04H7sQ<)v^kJcTaM<|!FB3+6hk~Q
z&68Q@kW3fzAS$-Zd+UDb&mH#{U61GR@x@<+dWpI`^s5do4BLL@`addKDyogomB*43
z<g|t*j8NmF+`L%vMV2?6`m717JGbkywNjdYt%a|;cN}k*XCDYLB#W+>zm19O_HVgO
zy9pEtTCSm_Y|cyF@TvW;X=hA$>?o}x<tp;M2Z~)a66hzH_$iFYPCXkJwI{#FV18?m
zOdf7K!+0Rj^uhYI!IMO%j<nK*kf|n%C5g*jwje%e74bwuW%djKq|}q3sG=%=O<qE9
z@<+bq|0|Zkv0laP=i$|3%AHqE(`+6n2t<@tsc*J8D@kygGHU9O3b<%2c4958r1aAp
zckI-NJmeFJWyZt)m(7BS5sq&CTS{FY8B}-vu`L7ayr|NeS-~Dzb4pEDcj=tZWwBnm
z%DPO;SYYx4wSGVJm|LQ@{_-WRgtKhn6MYd4V4SNwTKpU)J}IJAJHb$4rXmK2+RI?X
zLrwYi5z3H#E<z5!jeK!nj2nQ@sa*k2;3&1JL59P1d@gg|b$7flN)E!gKs}Ihw`lYE
za(`O)R1yESfhK7wyplHd$x{y3!si1Mc?vEVyhCdLG}(r63o~7`j`IhPNB?WSN?rKx
zc2%}{e+KH)mBwybmOShElpba5h}ad;a~a9qkoEcRj`D7Q7#Wf8^5fQAJ^TE^04r8b
zdZ}}vlUIAt|Ge-1R$L$TN{h&I6mXI~Px5(vUwA5zQ!5;O`q>pT_47(+1HaW|M48`+
zXwX`i??<!6yYRcHy(x7vb8%=w3H0B343$LQpu4Dt`LCh$@KiKXHn#9O#^_Ju7=X%4
zxyF61)PC7+tA-_3gBti^sBuN-SEh}whNa9=h*r=>lPPCLdP;6DcyA3Wgj@`_;HzP<
zA<oe3=M~;82Hh{Bk`<Rq+eGb1Ngk&l>`&2OsMUY506TJ9H(mNsYj05;p~WWX+MsA}
zwSx+*DL;rCMT%Yh|0sa}iZvzl5i7A&xi2ZJ@&B~b?Qqf5O}}L<dA1)MKLGhFSM6u8
zbhU)+c2vY1C6`{i?SA1TVVM>A>nKyI+;NfV4Sq*YrGNjNczN^T<4=HH`4rqY9`oA2
zGdueleF3m&R|nhQIh%oG0#Jtnjj250vpF|zZ9vzQGZTJqFykmCmHpBa`npWCM#6fZ
z%xtyn^2`t(LQc>jz5TCw3);Ul+P2J#B~GGSZ2W>pR-(vP@HS+{J~Pf8%<69fr31FK
zGofn9cwNbJ#--<1orI|)`c4Tpnx6y2)uG8VBO`iCljNzoD`2yGf-2+gxS32sk(UH%
z6C+!{z*NIF59K(xF5?G?8J1-&fuwER7?kcT7I;8kSK^L-!6Bu9Dc;qG)3<Jjsc_S(
zifI{Q7r1|lN8)<$Hd{2O_uG{$+Wrm156AM9#Eq}C&P-QPN;Mi3qC##EJ8F^oK%alZ
zn71GJLv75P2QeiyG2$-GeBQXx)v|M8jbSs&v3(OeNtdmJe)RTs&+|~!Mryv>E?YYe
zZniYYE?ed9x1dHEnXHk22O&j3i@OEy^>uvr&f{0A59d1~qm%;-F+{Sde{i)kt>&H$
z&#9r+rAXVJ@H2)l#eY|oEVD$KR-}V~6Ki4aGHXgII*uCRtw(;BZ9!aAOALjBZdRuH
zw<8)w`+`%DPpW17l!Qmd{H;{!c<VRqmHt3|2}M(}=Z;Rz`kWH!|KiRTqXf7|6e>uA
zu(iu9fyWw$YKnB1K4N*ej6?sy(ut2gqJfCc!?L-m_$eX3#ziC3Y0d%sr4I=?25btg
z%h^oX`k)3(M!!Kb%e&@gy!xwMpyz<)^=OykkYUkO*=HXCrVt0WufL}q&EJ06SXDfe
zb8?o<ihnVa<TXbpjkxVAnU5a_b6ub%@8pAbB@oNR5#hsONg8zm%>GY!W6o~fIIysW
zX7qRNK4<9@e0qiPQ~G}_tjz&iC!2uC&ZzEBO%=gn?VY?KG3%%5VBS0V5GfCXHH^72
zR%VL3(qrlIp9K(L!vY}PQsPpnkkda-*#E{tF@hK-&^Ytkjl@WCEf2jUU4145VcosH
zrrsoL_0Ql4J}PVcn%!caHXXGUCTSed)Lv<nkk1Y`;jxWtXi_jzUJwsF`7@b^g0tDd
zd^UFT&pL@ymg5N5K2He0P}&;xxg0tF=~smGl)3k#tY;0gU9(Qde&zA)jBU5nOIh&l
zQw*$TM7i|Ms#q7UT5)i?8xBCqQAle;4U~~=(pOLuJ~cn@I4BkQhWbSX$c&J{rk5M9
zZD6pyeNHI~t`YI@zNi&d?<_~NRk)F@%j|$hO*pOkGwH`Qr_ZBIZaplJmrRR%{D_jW
zdeZGKb@PpMVWuu~h6X*_toi1dQG@U!a-pjGc-rD+sPQ_G>z)2@m^VTP=cJy?q^Ee=
zMzz(S4|>{T+|lxr?Dpw_q=FM=B9+e+4kj70`PSBq;(j3?s#QIP8kZ-p!N@lvDj!w%
z1Pto2XdMp$VAIUfKaPpzfZ@_X3N+xY60@o<{Tmw)ZKL{3m((r`^j#uCf=)@IZ+=Ah
zhN`n;0e~z7=ph%)#!VRjdYkjg5u(<7p+K8;D)C&K<~&JiJ+=1ynE09Ghr1Y@7kC@Z
zT&7t0el67lnUmP9&8?Y1&_Aq&nRIeE^1H>T@dl&VvmBSVazZ*oFr12XcAz*_!=Jjt
zkGSxMGXB!3K#PSyb;!N*pIyFzs`kT$cu?dr-QfYSg7Dqb<mwxOexGal8lg$PWDot#
z$~wtYw{^u#U+{Rzq`%Rt#a)v-nGlzpx&?3I&FwtW-PyLhh-vfomtuojbCD%gu}PY^
znA+3N(wXr{$IeOP$KN`LeyY7d08b@|TVHfu)8`=pVnIxR6;8yn674y=G;@WjC-;{b
zEavH>Jnme=ks}<Kk!{LblupyK)|>J%^ebr;%_5s%G~?IU5DFnW9Cb!bf*HTf`v~Z*
zl~uRP2S*=-y3Ck9`z{TuG@ZaT*Ybmdjd-(9)xlhN^p$V`uEs2IRp;$h#%;?FsI=Gq
zKEwV-58;NavGLo?o05>tu)~S~AZ5e`oW%ngv~V{i!>aq<PdqzrA;ZV28@UbOfL1EB
z@*Bnw;(e~`I^s3lTTnjyxQTg9u{zhB1^|{pri8BBwI6Kdy3%Wu1;<GD9uaHVq1f`}
zJKAVeoWLDt9}x9zI3|`4J%@*9Q|IEFRoAaMtVla?>AU&)Yiqz+xB#N4tJ0qLnG1y`
zwBa_4R)5ZWk!A5aS3F!Enn;xUKQw16{DAdsW;2gSf4Wy};kCWjD&#bgy@|O+dN3PP
zj=S}T$=9ajdK>0q1B$*Te9en;t12K!Izyt;SP|@(kVzQ@x~WH+LNM55JbE78W0|?o
zfOLp0AU}3yay?*9#Zjcv?){y%Qk^VW91#%igxe$XhP)A-9iXsKy5d6^p_^jo*(#vA
z<Pfhk^S8wS4h@PpQ^Z`HO+CQ*ciDgyi3W^~Ew4_F1Xz;u^6^d8gSd0Ta*&E+6!*(F
zoK?hq<F4gcv06AlP6lth8kT$MCyre0uS@)PdFHMIE@!RYan+tl*UY(j4HzjRe>UM0
zvu;$yYOur}A3qZX{<w}180GnnnhIyljuaZvm);vZ9y^%*wpvgP1~6WIr>AYzgEz|;
zkU&^tY{BP+DQc$&kIF5wh7%Vc-#gpT`TFO`{AUnp2~;Gx|2A{)vx{L=Nh&zHC}vzf
zzfIZ*)bI<jW>uBjVpL7{AIE%AU&wFh;n7cU8cvcuL6Z5j^sko{)3y+$NGq<b5-fZ7
z{0x3>%4~w-zlUWxLLxt{zkI!`VQDv>Y_{9vQ9<zr)0`tC;|{Wt<6gI)#527@3@M81
zf!ggE4a214<9o03Z>#3W8J?;BU-!X-bO>%jJf-r_gH-9DwpS@Ll_8ItLdVnLf#f~r
zgIV<lV{)KQzzOb`cQ9U~N9p{0HFcmtoyGU1y|MJ}IkaL-eAdb6lD+Fe0}GyAp_>lM
zDM2W(Ze7%suE!caycXZWAqe`0k>C$!X(h8nQs+tP{s?CtW_69UwMr~&a7kESY<A>j
zmB-Aq?e<1ln<ri!KjBZ;LU(0tVA4Cj1p=rJ&Lb*2;rNb#Pui%&nrXkXNg#uDkgr9)
z(Tz5M=9bANQGE(50{PnXXat1d3m?O;Jwbu;%{G&-1Ri&Cqh7{NrHH^pW;Cj5T3_&w
zVFhYphR%G!Tzcw}flGi{<Y7!lnuMgd9PqVG9*!_RB}t}~aJdaX1{V#jneP^as!7MW
zr-GpAt8;fCo4GA5#D9MVKx?67kXF*h0tO0KV%~xOrhSt*^&4Len#aH*gcWp05t-4V
zq*G}gMnNJdpi5<>&1C2)4^1+Sx187N2gE<!DW8IK@RfaD2Cq==966i83Rjz$QO_8y
zZ9WwjA^gmW?-6hSV0gis5`YYV<ciRvKYp_^zyS$)0;Rk@*-3N&XkoPW&m|G?C8q(=
zf&&2UlcjDd?!&I1G)vdJ6A~~w{;N<-%ZRnu93*+TM)yRdlYw#QIR;O{=!R+k`Lt00
zPGyDhVrI=cWCBE*u{cQxHGUJI$v^@r-6RiZ1NQYO76<5bbG!?QI|~sDZ4f%^h5AH5
z-O1D8JUaxSS&G9&V}TF!c`E?U&m}gmzcIpG1Ivg6`si$yr5bmjnKnJ}l47Vz6%hHz
zdfK|v*Sm=G;WJn!USjVtZKD38vW5C=n<d?fV!9Dh`vMNouH=Oi5DHraKnsy_caNw!
z3mRC9LU~E=4qcwapTD%+AFzfQv3O=hf=Hv*dlBH`>2x?YEr-GKJH1tt7E?eJH@zUT
zE(K>|J!<>+QiT-&<P+*I&X2XkYY$Wj7*^_8FKAj0^3B-R#7)e6yfoVsObp`{LY#qX
zxg%cNA5u4Dv$h#|Yta9#ff9b!;P6HPM`#fJe>m$ZwJ4<rr);CX31OMA4AX89M(Y7T
z7<7NYYkAY1u8h*njtsO_^XJEbxw@TpNWgKB{_(BO#!bvDD|>Tp12ue+gauOc6ldhI
zpyi6gNg(EvX`8?ySFw%7w$VE4sgETX9XOR%jlH^b8anz&D4vnBv!g$WKtMoTRHhi#
ziuhccw>oZ~o}Q*Flw@VCk0w&&2{$M7?KFnngL7mUrR^UY&qSNi-Fa)MnKQuR9bd2^
zjXJdnvk~O2c&H=%I|3GeLOY&<vXx3HBv27#wg!zR@Ms?uk>{VgPY(btRwC>DWLk>6
z_1ha}eh2`F#1@C+4=oa{<6l<t1ftW-*G-scZeIVDuUYAD{f1Wy9JY&PEe`9Dec;2W
zx6CTRop@DWTa_r$n{5`TX=x9^&644tiPn09K1hOI*-U>$JQ#aTfxtYtmzYNtoM=3X
z5CSo-R2Ra>Y|*U0by-sf-~j>h?~GOrq8gYz!fKu4&rP>8o6V@b<eRZhtiNwr$c7J#
zmPL^xTG6bH0w1(BJc0&&rDuU;u4iTNJL?Dq0PWJ4`bIF~8>{pO_u9G*42XS?d2y|z
z4B2n(2z+}6>%qh&BxZ61tgNgQN(r&BmWpKJ+02H)a<TD=iArCs70knO)y#P4qMhRk
zZl8Gi2>#5Voq2x+mC~H_84>TI#)vZF0kz%0#IjLrz<q2C_`^DbYaM1VleNQ$+ENPz
zNPb&$^rk)dd)V9VvymnPLF%x;pej$Jru29bKPr-9ZXNsy7wAK55%Y=R`5vGC*>-_v
z)<>Ennx6J_ZrXC~66I|<PoVep8WE^6>h1Xg13@Y%=>Puu1Xf`Et}A$!uwJZ+f1N4B
zYeJp(*GXskj7zD4BXon2DQ4mM8d9{Nf>$*9XbAtL<|l-X<p&W31$vE7goo;{azOUj
zNcDg#cWEr6Cc^>j*RMRToK(4C0efX(;8McDEuP9)yyQky0C3Ji7p0R0>IhELSO;HU
z8G6eZj?q-~V5)oZW3G99PL3kq5F#QYcbs{d^wO=+j^=+N0$u)3*Xp=;V*i``tZO@{
zBLUV<$Zt*PU(_+ceJBvXfQuRQ!(8Px?q5t%)Q#cH^-)caO+o3hI(1+jMtukyHFT{|
zJo)>}<du~l0%a@vk_);7*+?1*2Nwe1Tz{3;lmD%H`}qJcUf@yj<&yP0k1R)MIQCu(
z6yX18{T>Q;<jjHfBQw+1&Mvy}fZfCym4lsKI8>Dc8thEz!xqehN?*X)meD(?Q)ru|
ztkS0mEmJuncM=Nl_N<iuKP`YL>!K&=;8vSWD25?PKbzL~Vfe5l7<Qm9=NEh&1h4|L
z!%H^KgRZF$p<3qPT!#iYceQUAGXN2JfkYU8E<b!!Kf2M5DR=9AU;4LvO4Y%X_hR#(
zZJn{+IVo=5nG3S_2CwsR5#cSnpaW}8{LkU)9oaMgpg>xcOmBxAq5pwC>WzY+Z-%w6
zZVAVGP09|@eCac?A^Rxi!e|SNrZDu?D>B@XC4{IYERAD^#u03)$pz3>!()ZH&f=TD
zmp}Rbse9c-b07zdJNyF*#C6Mth7`nPg5(qr8{Hs4$+o(mc?)JCKr2=Jge19T89BQu
zEI{87W99R(TX<V~N|5l>erM{ql`d=NZ{S7ttbxbqsg1>eKveFagTC}~bJq6IErgSc
zVE@~<aS^zHLsi_Jm8}9SyzTGax}}U*{&1*DFAqytifCod(DbKqKIc+CEKLt#W?dus
zD^Sz3yMdCv)EuKE5{SrLV~~8(`^VcGG<eGZspF_c=S@Z?(o~~{MOAVFY8X=y%QN0h
zhB>jqO~!elToQO0&oijW0-*eFOh3sWfYu$%SAwtRu!CX|>xkp*Nef-E-t&x=bd7k^
zjwHw5^UGJkSoS8@q*+Jj=W|CHH_2!cIqOFi!pWg#nn)Ag2OVoIBamP0hiZ~<*r55~
zjoG=NCd3dkseVkw#_NjZ_6e<}PHYvaj}2QObV`Xz^=oP;h*70}^Qkzcvw)-pF3&-+
zaQfb!1%hmj>#>L#aQ63x7e}*q89z<~`tJ6vhyoFT`|sUmrJMI#8^{(Z=_d_Yv(y3o
zpBB)s{(LcM)#4VZLH$fp+YwOhd{Yq|+j}^#E;1c{gIBO}!l3)8E1?`auYqIv+daf0
z6kh*s+<xkgFY~KNfNk_7nHeDfH0Ma|*Hrj3EK0~ztwi`_&7iT*K>)0^`{rwM(%t1%
zmPSS50&na4j3O)s_}}Wh_46c?Cn)!AOSq)3#hncV6N{kXj5`p-N~PVB?(BuhRO<zQ
zDWsxLOwIl~N<J!9<RAu&A@vEF2VjOLyW0{Hz32$udo5sFO?&ZNn?}*WOQX#YNqxO7
z_N0LT7L&Lb<4Fq$A50vZG|Pkn=`+It#PJVvOwTI+6&gI|gmp^W?|wX=;!fSsXYai|
zYRJMsfVBF@zemX1BMlP_8~1cVfaEd<ZF@3fL_ljDq~63Fbz}pUjgXQ^epm(Q>hw$_
zhTyYlX|8}iXS4$Q7%57EY5B`XHCTD8w&6$Ik*w%OI&o>8)@BL|=$Uw&&38yZhpUxs
zGMYdBlgbbn+-kr)DR#FbZ*tkFso!{46C5}(x%^ESCXb7Y<KyF_l+8@Bvao;vRaTyq
zvL1gI{ZAMHi}H@~@HKu-)8rrG!L85%_|R~U$P)O){oEaKBkPz{5Dd7Pg?ue9hF~nN
zZQ$5f+Rux-^M7c%s-QT!ZriwP@Zb)?9TME#-QC@t0KtO0y9|Q`f(CaB?oJ>CclSHr
zUv;bIp=%!Z>E35;S!?Zj(=S1NfcfT|<ZPa4#yzJO|M@dH82ZqjB|4@i;HPVP%#=I@
zjb3cRhi`h=dti2bgOC(#=AnK>!mpPuYeP(u)wA~T!oxX{DDPxxpV#HmKsP!2=D2_Q
z?(pzd{yobR08#$jA)&Fcx8C2!POaicbUXKV1B41bL&(9fqPfDso7FE6suqBWgQM|E
zfrxfZ_5RZa(op6q0M<(yeCeX_#iN#OHI#5C#S#g}M^h_-kVh>ruAO!X$qEtTKg%!g
zBAt$Atvw$Jyvq~o1OT9F&&aB3Yhi!w@aLVYAB%Vv2Zs~g(46_h$8-d3lGoJv_J*68
zR>b~kVj))a7PBKlGdW3UfPrqAGyvTw3Tz1^w(SwtrZbqO8L+Yd11$2eA*Ggeh=hcV
zJ&?MfE1*in>m=DHHLg3$W6lIVl$;(P0k|z8Q1_m8JzUD(w}g-V*IYC4Iqp9g(O@~w
z$W15=>7y&;32?Kp)PmUf`F$a@f5cFN{6+KwZpeHc{qq&02^07Nj__yN?@kOr;;KG@
zjfGIV@|>H|I_r@6A1j^t1KCiq9(0zCbE^oSP!tFytu4vtMEfRn!3#gjH9bmr<YO0E
zljl%1zeS&?S5+;DCBAeyGjqyL9pNtqQXcbMf7*Fb>fj#R2vcn!#nCYfwiUIb;yrPV
z<hNEWgz(r4LK>;%Of5M~H8Ev^;K}d(lBf#T9-<t;witY+229USqx~2M7t-SjSycd7
zTM}@rWZ#JedHauUWsu;e2ZtlUE2<gQOjs+Il$4m8nStj^&4=TK-yU{%2EX_B^$B<!
zs6aN@E0hb2+PxHuRH}9Aix**u;8v+h9}z)Q&6)*H<(=G%g`owQ)k=ex5;nL@X#a3E
z15ShCu6f|;=Bjoof5%-2-%WA|#n?Odyu0d7$$6#3p<q!bZsRa$9SzD=s_U)Fqj+i`
zb>6m|iG7<@lh%`)p&Vo$*x)^G|G9e}Ik6Fr37%f_KNl*nnt~udFQuU8zrp_y0o5BO
z?lbd-zevFLl5s>b>8Yf%d|81@Re?wmDFqbnC)IiBtW{T@-%GGAAHwKtWNK0O?QRK8
zy>yV1M4&@j@@2E^qr+tY6Am5hXpq<U?z9Vsv(iT|26CvL+R7YmexlhB7?C#=$<#b#
z?MQ!39p2w+_XAM0!?B0$OX)X(^^<NBsTc8MMp;;}Glo8aCM)uEPxY_7KP*O*&%57)
zULG#>n;m?wM(H3t8g|pZa0stv)9<*ZJLobP{W6Me@*UId@eooz)y9$zJjRW1Z&VeG
zTYfMb{tKECN&8mwbFg!17`y3ubCC0SoWy^`A@UMD2vQy9Ls9LLw7X6r%mQtdNJ)rQ
znW-?hQE9w$wN(;U)o3#5am<HOr@(&O^+WsPj8BBc2!(%S04qtYY>KOdrWp>wh@y65
z0d&Uy-~k?as(GKrO6k}5L--sL?Z1G?>;zR69&wYhpwsNHE@80!{6hlGiLE;{*%yDx
zf~D@X-3doNx6*r_xNZo7&*ZY5EtRFSuQXy8DiTu46^7w&#%2w;#V~lN!W(dVn@BpA
zg;sok1~4hxr+(^K9d<WN9DBylADa7GYUD&<njTK)0U~&lln6@JQ@(QUZ~bm_EM=$G
zRwj&p6jH$$COSV29y#S0)dES5>Qbr0Y;jmxsbzlbAW{FREAjl2BocxCOeLg&E{9y9
z@+ZC=jRSbVaMdV>0&d{A_!MUF!+}DcwvR$K2!Mk0HhiuEpImq}zJ*87M&i31Qu$}Q
zDyVU8bv-hEu=1wIocd<Q8CuQL0k2RG-+Rq~B*DJ72wFix1JX_S+Om6rbw&4Y1^-OO
zwwv%&g?OLSdm~DR-|6Vg0ASX$_V*w#xB*(n&Rc<88&wi?Bdoi<g*h0=0)WhDfWpI5
zo1M>sQ)3H{?_+m(Mg}DE!^y002OOB}+e&u75pEjEphS=sFF&%BR|txt^WjesGMpG=
zy<L@0H?)I@1<w>d+*QMF*5plNd?V+iR|hjFXMRQ%wGc?kpiY<7C<DXC?1*Y&;<)4}
zrGygwHU(_nN)^*I)Y-*XW$M$!4Iv@Ub~RYzR^V!#qLNNs)N}$|YCviIa)mdbTGe%l
z?22W%x=mf77Jt%jmTwX~HTP3_`;|EWFlTp*f73b4#L3-d^zsgSSv$kmjqBIv=yQY^
z^!$;o#Km-tjO;5dX=}%n$5kq_sk%}@MZ9EfH>u}(apMc;lj@%RyG!8PWMMp6S~|op
zbbb|J5zjjh(*ZXMLIV$pdbZwvTse)OIK86RZ=6mDW_}<tOKB+rfY;M?p^V%#4e<kI
zx@d4OuA4pgLbq_1Rf5AKQY@jFBbrjy%2zE!k8L6>x)(7+1fgYU5o8i0KNAitJMkO7
z+QEl-MEkT@?M$pHQbq_%+MalXE8w4HGM{2J?GIi=ag)CvE3>p|#?&%q8(+B^jaGQ;
zXtlnc499T8C}7jxKJ8dUDB6IJud@zVTIZjizSk$*FkG|y3)B4lqb1Z=^SF^?GxVrT
z&C<u$oi>t?P|!1rnLCtB2ZU&}9KqtPrGVg~Majm|SQ*aZy0e9?L<3y%8tH2G8MqE@
z%N~bPR7bnv=WjB1+DL%ZbR^I&N!cC;mu2OwOVX?lJ7A*gJfeBM*I#le>P!xcKu?pg
zQTcEO1?XP!6)Wy96(}n|l3#6n>uV-`cKLRU*~#2+hXt4nD^Nb;R~jH#E&f@A)~JOk
zAl1Msp~`-vg_Tgjq5Xz)gcB>G!mOBSo2HG(tQfv3cV0cwYP86Y!?iHNeZg4bwqOuS
zv+gRwvu9qobb#X0tkPZfe%2w`JaDOpGbrfK4~!UED0lFMeY(DTDOYIDcSc3=>@`vb
zhQHjtFAbyLMvUV>Yzl$H1RD-ZU#jpcluLI{QlIfZoD;=epNpnZs%?N%ta}M|y7;>X
zLj?~lMFEv;=Yc1GC4;gzx5U~(QI&m;0X9+q)5SFF+#_$Vd0Vn-K_;cqIlI+e0I|&H
z-M_>-Jg?>QcnTq8#M>}u#D40%;%v+tAn$mpoTh7m3VDnl28qJpbjx2peqrq(CtauH
zZh}7NQJSFsAZw7oyM7N7|1I@LxapTe6Af8aB0WSd84m2TX~M|k*nZSPFlZPeUonU8
zRKh;+sdNZlqJgD#SUlU6|35=qauV=|Os2SIG8iD@4YL37+2BKT;COPva|voWY}=7^
zykF(0MUJK}|6S$5WY)@fsOuYVv~;+u5_M)78TX?p_dFDUs00&2bjeuj7BoEmeg^go
zvu2XQp2BW<eG=gdkf~~1BNa@?$Sy|Exr1tR>yfSA8Vz9p0H$38^2Q$LJ_JO!{#zhq
zzZ2e}Vf}>%NUR8e0}x>cJ9(v9i<SK~_tsw`J_8|Hew=nc<Tdpl4L4Xf6}~$`=^`_|
ztJt0EEw1~Vv29fPhQ}cVv@6cBDxV-yU}s#9`4lZm>T9a1VzrFxM3KYFuGqqA!fY*B
z=hk7ouS=~U&akHF^|ELG)1!8bhG_Q;DI4gbRKJO1p+q4`p7bD)V8@J@`VPZMyWy`e
zn|sj5oVS7PoeYK+l;&*2Ck)$@>n39srh{D3)2i7g4z^sh&-YYEa=)A&T0@jDN%n<N
z|8_f*T=KmKCYl>bXG$c(4Z5qWyT3;>rW4fjl#82PK#Xgyhrg55_r+Zm)o+k-@{TMR
z=2)4mkhaZw6oWnbL?<wy1pzkI$^tmRrjKc`lXxodgH6@!OU#ZQ5}>ogATdM5s7=@M
z5@H<(z^aGcMzQcWxPA57Y<D}xa<aV7hG`ufQW8Mn&iWSS-<Q*c0Q8y86mTjz)mled
zn&JiaFVsPaoL%t;=zg%J0pY}{Y>xds&=7@UQTR+h${NZ${SZCQ6U&9ZI6@f$PEKWt
z(b=uY({;arEqWl*WB~bKNIq>?+&j30A&Z!pi4<`(>Q4%CyzJp<!haQaMQFb+uI;Ub
zd4~{5!n8kg$R7PQ$1**WHxFGvv@(mwHO=jYf!i{C!QZ;PNWD)`jQ!50l<PE7Z`n5#
z6qw(4wKP(u{w$Q%pzHJy_+9%Ij-0-V(G=+6SQ=SSSAFFh?1pmR47a&1qq>gn9S0;u
zY^8K^eps>q+ml!iA@X~_ntX;T*IQ7`_e^L%at6WMHDGyZ-FXbXAOQcWthcSg{@&Tf
zFeQ&~1uRMb%YtbtnQIf&M5^E)oQyht6(4;cLCbi`!Xcj9=Bpt$fbGTH$_LEVxCwFO
z%)_yyeMtY%aIBFpKC)}tt`YOZ&pKus310a|{z-+cr)b>Yy!(nF5b9_`RK3F95^(WB
zHaV0^s@eVL`Gp`iU_t;I|3%aEm=kiHeUi7^?lnLAH!JxqiPco=+lON(BP2j0d&NiV
zy&3;ka}O75SL=0~P!Jwe2>&aK(_TMamE+FK_w~Ae?}Oe<!tDv(J^$TY!T3=xD3@>A
zm7(}P-8&5GdO^uY!N;UueHP(-Ho4ud^<1Zth1DZLaF;;|a+aO=<bwGS{WWJBQ6NeW
zQ_;9~ezFhczWC19r*|Kbr348kDj63vTKV7=<?mED)E!5}5e=1r9mbM=%o7#a?kBWT
ziEkRsA41+x(WyOJ{$1HR=K7)G*QEBZcG;Bk?9990D-QWmDRIY7mXdZaGU4NX0a3?4
z8F%S9&4*i&g^R(fK@QhfUh?eU*g>>8NMx6)(Xl#MY7*S*BXeNN2g_%Eq_ey~C*Nar
z@ree8RQi|Rf|m3`(>j7c>>A_yhR$fbQP6aB3XAfhgg{LGlwAAoF>VP!1ozh#9Ia8R
zVf{hH$-UJQ(}~{a39dkuW6t;4zpX`qLcFk|BUl+1`dg>h4!Q4gJCw24-l9ye+Ze{5
zG$r>X5+K%IM?^u2EsdG(EiT5fZ-HfL8&JUC<-ES3WMPA{U{;+~Z?_E`h$ti0_$zGq
z24YT_4OdK^(V-9i%zjk6(=fuOM0^n9PYjKKdfhM-&kPnQP0iQSR>8IRGgW>09iE?W
z9Z0Q%QFcw6_uAjQ(~_0c`+mP=Mhr|iJeX9O2MI4tIo(&3#eag>wu1LgkwazY@N=N`
z*D~EnQsGKYONmvJY3;+6*j>mACoEN<u|9RgfEWcL5`BAF?THDj2FrdVv+JMNr7Tky
zzj)q1)ctIptRs39OXdl~Bo43MiF9(HS6E0FHo^cJ!xAk5-gCp+lyOe88%P284#NPK
z&9jqzDQJ;BngWSq<+3d1YpH=Qbi-6{2R@n7v;pP^VVMqlu1RAw!My?yyLg-rj<+V0
zs_iPpV(x(8P8Mf(M$QsSd$6}PKD%2@>#gxQmi%JW=Y)^=Z)m+&UC9Z#arn+EhQ_0w
z%20snOLgn9-&LwMR#VDW0A1kfce!i7FOCuq$2lXp6c&GE=1p+Nyd;`ES;y=;E<7~G
zckoJ1?!3F!X>f;Y)LpBz+~6uLhyXkMz^u0m8Ao)IN|ZlHss5T_*H;#O5-y&m$vCzs
zM77@^?h)8Exp3_@WYM(0F;nR<RGWZ{qwGM*?votu+{6)8jye4iSnviop}1H)85_R}
zA5)cQWj}cRjb6N2@l)+1>b_Y~l7F!ES_;CKoU&#}W|T^t{oMYRo6IV^a5E<d9_p^y
zxK+Gg7kx&nxI;w{|M;XM93}XAb}<&I6d*sqj~<*-3n}S$Uob@f8ike>;66Ix0c`u#
zn!er^w<pG(F~r@<I>Ml1pWhUw?teyW_M!oKU1%^puaFE*Amv#e8ZbYgINOyI{Rd;T
ziHyER7>fo4tI`m+KPhhNfW?;pNA}V?qRUT6E7Wu{3zR;{ghWu;%zT(_p7?abq^Sjn
zhUR<{G(Ld?*4Bd@OreuT)coLhRsHGeye6mEl$$GKkl!$!dUO#;YZ29=spI7|D2wFm
zN_nD85GM<N5zE<Z8|a5MCo!e<UEKZw!BOE-1ft7s%UPE-ocG4d3R@vm`D&zQcVp<$
z5iJuN{$Ol4JZae3R~s`vVhW(wOuo!>M<22i+CJSeA;ILKZT_S_MnbhJT>azs#~F{U
z7N7?QpU6tdv2*vZyPAK8IN`rQEfsfqFo?0)EpKqD#yvohH}0G_S>bZOX@>I*dW__@
z<Ua?z)ERx-7h+6%C-G*N_;9YeN;=T6mGX%d3NTxScOB;I*zyE5$t(xJ@m~dL6aa`3
zGR$Di7>59<;M?PvcHQM?G%H#1tH_6~fO)oOVvYV{s}FLb!~N2ZBZ*JH9e~8o2Ca(w
z&vxEBWxik#h*8hga%nm1Wgj6ax)BVj)<x2E%M<omtsnwPs9j2pz;?Ko&|PYDZewAg
zB9S5zqA<jYil$=0iV|`Wp_~O3nh%s{iDP|lAlN0>`kP)a`?oMhvHUHyTXcw7V>hF#
zT2j_N2HnEIK`GDnX5lMk<xtYUII8x(b{jtWnAqCohWBc2K&0Z3<a<n;6g3_?(SANs
zp`Y-}-Mx^J+ktr$ZJM$0y)u_-Zpp}t#h*HBfg+8mpv&cf|6=KS@aHGxT84CjYVy!e
zX%hyRR_=G-_WlpP8D@vp9>*?EQcjXf7D#?a!%5ukL62@s$4G5QkTvk6vS31Xl;jEr
zd>*t4T4xnKVQh>JvAnCO^$S6<9gER2u(xoi9C)OJDQ26pm>YI8n9=mIiF_Opu6DRx
zZ`#EV=`$q;pm%0?)auA_Xo3X`onxnx%d4aS2RpFna=M}KM#?gOw=|9g09zP}Pn0BC
zGL`w5X)<yoxt6Is8sqXTq`exmQElGtNO0jSIbi*>CR9o+SauwhKk!BF_9N`+wrfN)
zxEweo$+ixyx;Ks(z}M_2_2Q_9W878IaJ~7wrTHI94Syd~1-%<_gi>P;2q1f2E8^VW
z60E7HV+cGEShl!b78+mYel6OK1o(v>AJbkBirfFYeZ^jFH2J!}P@AaD`Pw`kBc!EL
ztYkP@m*W|l!>D8s?)o-2GvQANlpf`&ZIISm-5UpZPkbw=EClC9>bvfZ(ie<$6U*n|
zX;OI}9nbb^@7?7YR>YiP-V6D4pkOg7?mZjLU9rN9x5}ZVe<C@qj4lY91#<;QmMKH_
zo?j*=P7Yfrx#AM3FB~PbB6I=?1_N6Ai)6sFGu2P}hs6O~v#h9d!`oVpF1J?KaFXC^
zN<<&66G{@I=4k~1F4cD^Ag4^RlO@N44G~OFB044-jRqAfSt-GxF*qYtcpCn9hv5@T
ztK_vxoV7DS3QZtXNfh`5PcInN%E$qk7tu~cLUtffL?+7#mH3Z9P`nP^Vc;6fBDP$z
zDn;mnoyD-mtF~_>RN>!I>eUz&EQxJbNwrFxiK(CHeEX{(rW#>Ciln7pwg1XUt5=v>
zh*L^W3V-_8j?lV#p1JaLP%&fvTCMxGXZZd*39bS$lK0i~6o(E{X1WGJZD<x$VRf(n
zkOr?&Xx-OKSSTNi%B$#$D#Wa!Y^AP^wKgf=uw0MfCXwa8EX?}#<zB<w?+w)M9_F;-
zR(Nb&=GG*!LT2pzN6ddJHgoVKd!GX7G87+A?*&vb!;JCn4L%5#4+;0yb*C|Q!T$W*
zw<T1YbxR%^u9~M62dk=;`dN>iB>uo7YB{<P+iDsM9*gt1jEB`UDx?|^agqP#<N$9O
zg&Cc_JsJPYpBF~tF8QsMl#T=ym=;K?+M`Dp<d$&3WUe66ltnwco%IUk`FfCsh3duX
zL~s#8^+VX=Hys1#zg5!aI19;yC^h<_LRA#TWMm-XYxY>n7uXs~SfZxF3WGj^@KLiv
ziI?M-*<`vDRJc^?;(WP5o|)EW8|9lEJXYp)&zT}9XMD2O0PPdizg>K4JBLRfgHIj<
zn6wpLI~TdzNJTL>9`~Px-}s)A1b0_2T3B=E7o+FCLz2P3qhg|O%8yjD`Q&I!hl|dw
zMszq$Hz+IC9*4H|Rl3qAL&4d7?AIw3s<-LkrI)YSm~htv{m!0{)a!V7A@BA)1&Am<
z#JpcR0EI)&|CYR`7*5*qB(-B6(aNr=<I%|@h3OoOQGvgORVwys7N@V-D8ivKX+&NW
zIH77C>wkK&J?U9KWF3m>GUPd`NMdQE$yq;AdHRGZ**atD!92O@s^uW`;`EI%8j&T9
z#5kIEb#R-?VFSezLjZZ}oF!?AI<8GX%_5tGG@bfc(`k7x5l0d<u7!4{EG3Sp<4fQ1
z1}@R96vq|?y#2s{DyprB_`;WSZEX0NP;IAIioz*s0Kn9Uq3=cBWRF1i28WbHr6*F2
z-CNJ2`G1-D63!Ahk>S}U8(a9XLOV`(&NywJ*_xQBjcLiaikw=mG+Rs>y55ED^^7uA
z;v447!^7PfUgO7!4CR<_VMCwlZo1z5ZghCxAA3H2S2CI#I8150e>)O|@yxiXFOm5#
zZ%o)sw$a_}h0)aooYI_A@GXo-ovb97Eavv)`~*Zeud%`x;WCVtt{FE%E!W4SOCth-
z!p?)o?b)tiO7kL$z}3Z(qa+~2nmHBx^pJ6F5rTh`j*bx>NIhJG&7%MVSUqX?IPPl+
zDkQW56cUuynHrs0zenNa!lq+ab<1I4GLy=m_|qo6%1XX5jAG?{*3SsAFy?}vQ)^WW
zGeZugr>B4taZzuwDvWOUDP|Apf*KlI6einr@l*O!HKLWJFsSr4{Sx$4g0`e-o?sg9
zo|vS@D$+B3e$kU>UwgNLAbZ=-f7bA=Qd}fdEsYF4_4?<hi0Pw={bn+{MG{89MZ&wQ
zA1P!tB~>NWpri*A?HCs?SSkbE>Fs)BQDWcV2}@>3P>yKNNMHIB1!2hKshC^GIG*v-
zF&^C{_U}*AFd#}AW4+~D`qXY3Q!Z?-e{>|A9RnMy5>g4-L)V&5>uf9ehN=F`CIG;-
zzlr~}17$U42J|oy0wF3y0Afd=n$g>>nEwhwuQv-UFcFKuuAlzCR{{@vgvW%^;U@&x
zSP8|lJ#9a4G|U^;e>qY;-7A3K%0~ix&Y&w_H2sbclDP4c%@+}KDx~(wu?M$e+9&zy
z7lw#izW%{^9LbtV@VP6?bf@lqvja@5JCKroU9`x1Xm`LR*-3apm1*nUB|nPeIHNcf
zV`i)M5f8}_FaV*Tn9!NzoojmpeNCXNQI(fV)CO7Z_B30pgpmOtU-ZJ1f>xdfLi`mu
z<K-hL1h|>zI~KG3-8oVeLXk=A4Uh(z9O?RQ``$k1w0gO|NHfHeIO`Gqz?pNvCbj(_
zE4bLou`NV@V{9XW1LvXu$89IdUmOm8%*TT?ji#DI0&%Eh4t`zdNOk^!MJtj>Mcdav
z3*s8(ied<!%kfI0!R|8@_G|Uh{A0P~eF~^NtYWH`;uuKlWX=*A+K*vsIqno+2Bgei
zjvd*=?B)9#V7$e@_plA)w9#~#94@^&_5J@Y01_?aVBSC3SZ@`<3z|*5<wu*XcxfiR
z8)^!WYK(f=9Vncw4G%umGM}sFX>#6w6Y>P*v?x@s;;dXi``-y;4PojnHnp(1Z(^+P
zf5^ICbSqG%q)SB>{+Cjr0SYK-H5cQ8N&k~<&qN2F)Y)MxJ}4f^mIOr5x)FOB)_cbs
znGr{KM-M>^gwSPb>YQ0t{R$StyUzM=>?uEzTQ}w}|GKSt?rMr^;igTLi)apN6&&5m
z8>!lP+9PBFa2!cm0x;!CQuoT64Il5~4FoflDEphRYB@{_tdN%^`r<m;0PEx^5gM{u
z{IPty(_m{eF`-H7ozomKL}W0C8nqC%Zij!s*=Sk7(>FPgi=-OQLUiH2M524PgJr-U
zXP7`>2S!p&70qg_LP(+N%jq>WtYpZbwqkA04@yH+`Uq_1^JIZw<RK<{Xd3si+O~}p
z#GhxQbPC~^1C@QLnUJ-X$FH0!?r!}}b+1?b^9tR(jm7tjfj-^#WepGQ{V8IQ{Il~i
zERyz{`n$EHC#d}>u+j~s<t*)hVI%Dmbe%E+aB4XocK$o&t^^zI`bXm&<|-<=OMx;B
z;P#sWkg$DMW9)`ut=1OMVmL*43m80LV5QG@`?J3fCE~x*{_-?@fHjBdNEvR=R)zZq
zteHBPl1#3_%F{gas-}{z^@^5{!IM)*fMAM|-xD>F_e+%_ANLu}JY^6bzm^JsnpJvU
z<jz+92_v#Uh8LT98+N-mvns<G?BeP>$*eRa8;XqJ1RCq!=q<-A6gysWx>iZ|#AY`3
zXQtr_g*NYp<~AF%t^Qp_X03(RwP5k7NL8Z@`^UfATz70L$@#i+u7bC=Fpi?eJQp%-
z0gULj3?d$b*)KNry_!Xtk<-k=m#y$+HGE4w`jPC8?XYv?RvU+!R2h3-PH3yFGI$0%
z&75~q1yYNGj}GY(7+8BKEq4KO(I~^naYprqh)#mD$52H3@BPnGOCGXTeYooh&Ua2v
zqaPp6hhHDlW9H~4m(E_kpD+6?Pz}=#NfOX0Z5>z}AH0|P|H}$mG<d(lXcsoRu7BUF
zef;(`ekMX#bHCR<LV=IT|3QU{O4H%bVrSp)<&i+1^!z&{IafD*!tPrvvkUwv+I{aD
z#V~;_4Wc?ep1k}kN^&<Y%-G^QUlJ$EzajvIZPPVd(n`WsySo37L{p8%T?FV09pf|6
zxk1v~U4W)m&lUyO!;Se#{uBnm5G_Km9b4>A&Pt{&Vrp&<+ls)o4TH*Ij)j<FWYF}T
z;%CvZc=z9h&`SddcTXSWxT;eSc@bfYekeg}*gOu|Gm)#8+Xh&Q6-ur9NM7e2Rf{w&
zzZjC2iv%~xWU&p!c#&f2e2y;+!H#0d(XhNA#tLT(2UAX}XARXP`yzJQxor$MbKbnt
zZ*8(wO8e`nppJlaKY+K<H&&Y#vrn0%cVaE()2Dwmf=~O;7M^EG^XTOjb_KVHpHV&c
zCy@g#>)Jl}nt!9}c81yK3(o%!?C_f&uy&FtPo{1-u45D+<35`mMtpJ_OqqQMTnjZO
zY3gWj?N#)Fyw=wK+uxm9vd#m=ke&pUy;-?!+uqq>`vcB9DKt_gg&BK8o<}3!J?~U$
z2x0@dHm-v0rdhpH!K?12;JCjbGf@WT{<m6y$>cMX3S3goSGN(PyfJUY<KX-BAAb+Z
z`qIAxAw=$EVuXMyrG2~C^n#Lc6h|?{&yVmiW=cGpU&36pEeu4Z?aFN;g~s?y9UtSc
zRz{K)N~l}Zi_fp&+)1w-C!-42Ko|=aGx3k)iF6BIa>#eUTH{|;x?I>)p|NIKyhVnp
zGIE$J#hk%p)4-#>1r5o9V!-3%!1it<3qM-dsKrO6642PH>l7A+E9^x3o((zQDQ9FL
z4h_7ft`s=^X|{r$qt4BUT!9ZiBwX}n*cSKhay7}BFU&uTBh+t<W{$kv^HYL7+id80
zuJOY0BTg3&wF*TxE$!)NM@6O?*A16>v*_CDMU-DY1mKwn-dY%d(h)OBSg7NvZEKC*
z^^MvUYbg5q^K@P?2>_e^I@Z8_GaY?1GKZOrop6F4bgjf>7<_5Ao<%{tx-b`Y!jO{5
zo`S>j*SFb!I{fiW8Y}dIHBcOMa3saaq9ehlZYIEG)QPxo<aelIE4&kU&iRm`n0AM}
zHETIPodx+tX`nDZ7<H2XnYzbmLv=sq=laIWRZ@6mp3l@4Jh&c7ZJmXgAlx}mM$i2}
zulA*3g!NCDVWeVQ41LNO(182UXR||&O24#!9g;;;?Tc_UoNmjq)<rrWf?LrSY)4{o
z%5D(_*%Z@$Tr9$rUrWa*I+9EU7WkaX{OUnZR`Z>aE@wED{r<hfnAq$ZZI!ah*}mP{
zkrSX+nt>1oaEd;`a^WT3&3)*D+#%7tdu9q8gw=TcXwc!l`?`LBjXqf;&b9+~E#r@O
zc6=$(Ayg93kG<^0Wd9FbqkNT;10j?sNB9*yhAwPr^(JZ(fvlZ8MTr8|HT_NcHfv)m
z5s9f-HBafvM2dq<%UyB$-a+P<uUf-=v?mcDxTQQJ?x*iTtHf4{e>Rt|552vAnf_pz
zmwoW|!=9X2@%Fp-!P^~B*ll!xn_JkL7R(VsR{s)3^hIEi0o?vF*s~UFA@(u<HG7OC
zJtzMaW@+f_|0;{l1J*XpJ+aJ*Xq8y(tMLi$-ny-~Z!f?2zq9AeJ-;wZ<GTHKyhX4b
zoA_r5G(`WH`|=L^-ty{!8J|7M^{lb;4cv#9lG;?b?}*lN7Uz>a*5liJ0;s`1ncPaT
z0f&SQ4Elfm$AND$ZC3xNG6hu`*QD^`@GzV-dZP*C#mMp|^4|@8R#Z99F5jjo9GY8q
zQQhV_xM$<HDMT<$pB)9SZ6@`@Ii7kV4Na?TF9ks=5!129S>7MW+Qo4tP>EFZsC+|H
zVbnuAn8+29LuEuIoGUvHr~tNtB)e`tX(#UzJz5PsSl~=W|7gJ$xz1*m0a(`PfCFgB
zSmL>mo@;A<cMC?lCL_{=k&i1<73-K0d86{$`~DDZa>UM*V(Q~_p|vd)%l3+XGw}_d
zF3PqrNYhkjDT)GjOX;yUyBgU?JSR^7;%+!SQv&#|)pK}|P?{MXC>MQYP`Spl_K#%+
zf4Pc2Cq_Dcg4cu*ft;s!Fg#|W>N;P@CQn_Fqq)gZ5#^HAdoA2TGg8DIS)eM4o2c9g
zPW-yhybaU3$mesywF(GK`19-W?ETpMa*r>V{l8Dr9jE+bfh4`uUMMm?EYMbl4h+P+
z1{_ZA8j4|%$|q$13%m@k33lw-t)G;3P6!-8mD=@eVfcf&>%zTtg$xi_$MWQI8(hI=
zJNb~r&lFwneY7x6T-*BddVyl~J4-{9CqI`m{q67b11Df2l`oqhK-ap%?=>sgLo|4m
z2lC7%x`YbRSqsm8s#J@Axc*Z7*GPpr=(Vig?uRwAl&4ji`>h5!kXe@%cjQr|*xsjq
z4=u7YVNJm$YeHH(TLsyJKlo6(N))RZeN#Gyk|D_|+r=TxEAriraEUiAiaMN8%ob&i
z-Czct{gI~~ePbCH)|`vS$+KGpZHmtoRz$Ptl2duF>J%{fU4gLSxKIj#7ybA~Yiv>}
zp$NwkQ%)@I5n2V3poZ1f^xf6ci1Ys2t#AH9M#mzIuO76=4&{E9)T{WvPNB962jO!i
zxd=;J6bwAQJ^<8lOMeaR7uV(^;-JaI8fs-Qzg&TfEK|HOUV=t~0Q%OoEH<&VdS)|%
zYWw%-mb~L-*RhCYLp8j6XP+~Z)shd#XAebFT1u@?9QU8jUy`~L_~?j+uY>LAPK8Cr
zi~avMDw{+S2|h$?WtK&Hdj4`8_?R%2Q2`%M-2e|O{GO(IPWN%WR6f8ZANy~IeD^;3
z;_`XExYg?3WXQT22E?->c#HGr-kY>-<fo3;A3<id%m32!1T0Tsw{zIP>ms?^v4KJr
zLG-xe7!*$$PUHJGpzre{B>7qp>5c^k@5YiL3E08#{+y_Fte9??mK7|ieg8{=(^B<=
zV(7Lx7*K3ZoSA#O_u&#?q8}h&m|4uDInoh>NidcyGw?l;AT4eAa+1Z6R_$HQbFn{c
z<x3~gUrMw;W9=BU`HsqMjByI3sd&zyn9nZalGSfin-irZu%W=V4k%`gy_+`MsCC(l
zaHufK?)T8ErWqG3YN}K<O)9afCN3rpP#7p}F}D+cKr_hu(M#|UCZwo^=%k-s5xZOl
z(~BV$>sCvy6-u6Ty!GzVIB$`--M{g3>V$<v_tj%aj5{NWT)`QAa3xiGQ3ag$Z$37M
zxmF`Q3lznep`+L4;@y6j`kV0YL+u&0k;aYW{*&T=SkHxc@(5nQt^2U3mvQb)|GVf~
z$RD$+9>=Vlv?XoyZMkS(!z7DNae?W}7qC&5qxWwbPU1g~ksHo69J%}o!T;E3dj2>p
z-~LOVKJx=)g8!ikEHV1_)l4}r7_nje$&vjG4`%f55Ad~r*auHf+Ijt^=2(iS;|G8u
zTW$hW$8+i{$Ywx`&ZWD>vGvK{N1r>D_wfzkuJT8G6ZpLSTMTAiqf%J@-)4ATHFNPY
zA97x8)R2#yB|J-Y^af);;pszT-r2~Xyv4=YjHIzmVuP^JN~+y_sVr%{b6b|!1(O=o
zpS}w4AgR-MKHsqD6FmRS($-T9)BUFH7ZE~bEYpz6)=*enNErn&a&yIgV=VIXE!^g)
zp(R9s^Ag<Id=EBqhvI(;nj2ej1XKck_Oj>BmTjkf5@Ux;Mk2892X`U9yJ!y2Ti*Sx
zSJ;Po8)ujRRNNv*RR;VpB-F}(SP&hrj@IO;20NIe8E1!WN9`A4Hks7@R7LUg4sYzw
z)6@>am0v=gn28;A4*pjaZeNEvRu#HcBiw9p7wg}*l|O(RzjGt|UkQ}Uw2T!7Mc(14
zJS8!lvV^>#m?Vf>RD<BZr|f&{2chYGxCr<Wzh;aE#3SruM#Iw(M5l7M8@&oWcdi)N
z`fpeGy+_yqKQ`DiWSSX8YxnM!fI^c!rqsSpd+;FJ++82!`1o3;zxV@UyK2^%pVwLD
zJwQlVPe`v2u>gp3?L<^B{8uF)ktW$?)lW<6iUF8@ywOh&&ZT-(SvQ5z^c1`$0x~P`
zi~0KztFd^0n*9`ZYeiBv;S$g5`|7sK=U>XA6F8MW|15=tr^QsWh<Aht^OeY^Y*0~m
zRK@aPnt2aSc~6&?8q^TewsBmME_tr=5<q0y!=}I<H(kXTkTdt%Q1gCkb<74Ys=*Tn
zE!zuWJH;1J>DM|k|C-6<%UvwnDHOZ47JYV+%ZPyz0f|CR3XH5-5P8KiA44IT)T2#R
zrf6<ybgL;}5N}WVV|rxu$LYN%w8$t)`3<M8q=qV|V%GHQlpn^ILxE<+ni5a`_a8e%
zjgA$iqh?;lMyu^u`1jT*ik8~9n?jUUqQH;!u94g2YZug;%*UjOOYMkvc*s=t!#-@{
z!wr=jIXyAMJ_cz#@xf;B@Y{SIK>iGErWkhr%4&8v%DM>)H1Hni-@&wWH+b8&Oi^%>
z2*%lTThpfH(R;&hoIA<{`s7YyZ=*N0e3@&y^}Ry*o>Lo$4m23$7E4eI%+Vu!yZDOE
z{u{*HG*r(s75~H13u+A8fO(k2X$h4}GTsBendfLfpLVf1xiVd*Le!BT8nF1q+|jLT
z=dRALw4P7i4g(UDUT^4o_0011qfj@YInnFN8di*5CQ@1Zh)qi;>(HR5Evs_~f-cdV
z#o*wplcPh0WqGKSP@C6V;JKe%c?QUj1u8t<pnbwh37vKRDG`(-X<d|4R9iM`Y0gjH
zb~$Q$!kHe<-NHEkv`M~fR-}kaL7b2ACv|ybd^}jmgobItj;K_9*9;<ZL#<#GM!{!Z
zjLfFa`><ra6H^V{V;>)3{;~G2miV17QE-Zw{&XS=!AGeT+2FDtM>j$o_?v&&;&^=S
z!z;OJObfjXXX1?rgL*@s=HOetJjfOVfBE&@356+;7|4W(9dEt<ociLb#Mn&dcaH7e
zVB3AWX#QarGD0T<KKpt2jHmDBEhzDGKWqr>zQ{*Ye-=}RoZsRiq!-Qf)KWtzZ18yx
zC!Eq>cE)dxn1fUI4*uJi)csoLeipxRD;@>X$_JaSQ#61rSJQ#73byECT6xa_KAla9
z>Q`$|{N0oEFZip}7cNaCc>wdv0j{O^d{jh$1bR$y4hG2ubV&Hxs_`?!-Xi5R9hYD$
z`)z$RK>p|hfOK0|**1}Y)#L%2udV%|iS)+1bSHY1RI$2>nMp`BE9E36l&7d$eMNi{
zxS*d`sbQ<GlcWH>k1M8a(T~IoIcgdxZ3%9054$ibt)qlb!gsFSBE6uczF#}|v&0pI
z8oF`wuFp=6#2%54k=Hpu&zD4&Uvt&qsG(?>czDLgTYO&0s#Fybw9ctg`9Uld(Qhgx
zkOzT#lzcaK?{X>4UUwZCrlQ8t%nAbytWwX<7{GDeIV>O_>^2_=AIR7RiEGxlqaNLv
zvziXVzZ%VCWy=kOhq?+b(z?LN?gDcnu&u$_KY{sD-9^O;;-<$k*VYw*7P2vuVZG^~
zXVmbXcx%zqljE?0mrGj=&?{aU_t~Vd{QufPTGjID^ncjI=72)@Ff(&1V4ykaI0c0N
zIi0v^%|{`ohSw9LsCkns(q$DhdE1Nh&~~62zk<!zsy+qf)WJ5O*!~mQvmoavj{B=-
z-M=m&(S<d%=Jf3#GJsgO17eH0^>NVRSVU729|PzOG;$Nc6Wi61rvWgtcmNd_J*Rty
zR8jO8AcWHmgf8iVL!mmv2#D<K6*xKkS|&;q=vz-hUuuA<R4({*zG<78j0BvH+n;1u
zFyyXZjO715R%bvMTyRII{jBzKDl@Bq9I5{R*pXTzr$y=u+1u+aA_Km>t8tP{-{fOq
zj0KDQ9>y8okcA#m!x*bn;p~!KB-M_)(GGvgxU<(>fWcz7bZ`BvtxzT}pLo_(#<UrV
zqZoZs2Z~CWK)`lg%I~)D#c1D8G{Je)k*U@0%LQb&dy_K(Y>g{wBJqAbh025D>5(M;
zvVn}XjNA69?YKHD+209QW5zogxH`+VuXSUx-gxy1K9l}IV$8ceMR6AFep%L1(oZcR
zOApbTcrLF!$%-eJ88f#I6>59S)_!`qemKR8O-SXh{BKb=82z}!@LhDA<Wz93th_d}
zzx$+rbBP$iYMG6L6+>C>DBz_2gQnod-=eSQ!Dnfiw>vl-vfou&=LxN90xm)-Alg8O
z#FZ#NNixc%69&;YyNC6Cy_XQ<JMbeL+Wb-ni`C|>cZ;QC4e9;b6T%{)XTloR(EkPb
zeVr$ae}O>vOevyXtCCE%7^;Ae!P_yNhu0+KMSiqt$P2O>l%w2I=my>pH6y2wbi__Y
z*s_`$(H11yWRJc>n~f;HW5c2trj03HJT!N0_1$ehV}Z8)8K?DW^<r!pijO#vG~wQP
z-di}=iZzMeW0<eMpn)(!c$5>xlhO8^(Gg^AU}f=&E{o0E%(^WHJPjSeI!>@4K>tjA
zLLhoqDUv#<^Z6eOu2!sbS0l~wh<?|p_wA*COHYl~K37d~5nRiO;K*rPTf(FoFcR#F
zC|BG;R@ZR|+DPRJ%lpS4_S|UF*R<4X?6cxBvD=m59JVF09!i(<zmnEJ>2*wkGHDOJ
z4XW_&Y*Vm4UDwz4J12j)))A`us>|>!RZRi+{cn{Ey=YqP$c9Y4O#n!9_E|q}57<(V
zfjy6F^yqZh&4#7Tf(0D&%gxPu1hf!<H>wVygk%W=s}Dfo-h^8=lK1nJ=+|PuB_2A|
z1sk=|NpX&H(Gui!zq2A8%UKq-eFOUv$MAWASVl}>vW7v!vgvMtM;@t0wy(1+lp6yV
z%OFP<jI8luEWPMkO&Qj$1%Bf&2#B1~X0TItDUzM$LxL<Id2;Nl0^}+TQkn>ism$lI
zq(EvQcD!Hx$(&2KZZ%kB*feRrM31hP5zLaKM!jJCDNx{7<<!3L<*tPy2a6ntu@d~X
zSI5KhU3}Q;lb>MsU7Xi2jcov@_N&V|1?QrCq*~U$p=YgoIcdy+#tXZ96jri|ODF(T
zpK$rH-8u=oq#M6Q0n!d|efyG56BuhKP}zERYVQ2MwHVgqx0Azg#c>h{Q(%Zj`0h&@
zB<ws})e_Y8oU>PbMq{y1BEw4?qOz-=gp<CN1Yxe8rthQ$m_<xkhI2#SMtbaKlKEXB
zgH4$SX%9-WcHaRJkgnbH<l3)U_pv+E@Ms{!#5T&Kf&Lpbu+@hWl%`~gNql*J2Y2^u
zUr+@fqVp127=_B0C*$RGW#iF7n+6-=QquFtb}SLbSZR;o)yebe*JvtV?&c$?<(+v^
z2ZunA`wlI#P9cghv5#63nl?w%vdPv^rzELqG?TJF;#=)qU|(gOt|LwAVze~a7cLP5
z-JLgw4v0H*NHpO)VBS_{78g%b!JaI$E=Q_y)Pa#7j;X~-D;0+{2#uQV*|8|4ZfZ(t
z3GaCs8{w+nrkBoHD$d!opLFbpm3#B~Iq}PMl(-*{+4>ZknQGi?oK7|8FPUWaZq0{d
zuR1Q}k1=l>whN#ZCRCxj=bg#ur2d!daV<JLWlM`caoGFbfC@%#td%Qf6$`=1IlJiI
zT*6Il`zyaIhG%r8YSf`aWW+&#4%McHnwM9KEon%$8fjuV?XMaMz9W%z)O1tATL72>
z5>sd7Kx54vdhll$AY6&Tt7!XB=<e*;$cKj5RNh$t7AVoeu*k((>Y<{?w*3c_vvz8(
z3jnYlS=4|A3rgCn@mk2S!kwyzI^3b&dCFQFq`B3o)UlT+XESYt3>#AK%*PaFyZH68
zDVOqVw^U;u`2Fm6gy}tjIWlozozeb)*2I16uc<=!9aXsWK;mY+o%Vb*34furdn5<w
zVo;P2?)fquB)s`@>_kLnT*dBYVCXf{yM-Y9tjCfKW4flZ?ck2upW5G1yC8=fJ6paj
zY;?-_YwmX>V68e7|2+PU8RZEbFD~r%@Lh%$)u#|{DI?P>)@Vsuyj$R7@66FBA$VY}
z`cM9zVV!53wm}5>h_O{KU-$p!?1vvu!&NOr<DUn;gZXnTFHa7>9=DyDeywz7lCV{~
z`_}f_v|bA-<Z6+yC#9!Ko@p3!$^BbpbnR{Y6<wqqr)Jg2@)azzRfx`MB=;BE;_6bR
z%WN8&U_$&;DsDe2D>Fd%gz(02`RV~tax>k-`%jaaFKUbcA_;`3`Zc6J#7TFJWQX8+
zZur@*m&z1i`=@T2U#Nlws6Zp}ey`2L8f0CSp84eg-3tKVbU5tDImo9ECdb4vAI6n^
zW%_9!x_zO4`)b7ohR%zNq9s(Pw$UY&A(B$bifvJgW&H8yxX_%S(%mcu74iEx7B>;J
zT6nd5uipLGT~R6voV~%+p*njYEfR2hOxdA5nl%Y#oUi-t5ZJ?O6>U@y({z&Bp{Z6~
z;c<A8Zo?h1ZV@}l!DKvXIWY}lggv4r9E9{Z+4xeTcxzEfmA?WiH-194G-9|0x8Elg
zIa7{|L3}*QLsdUtg|)nbIz9r}&io%NN789N6<0K-D52Ft^jxx|t;2)(?0neVR}I&X
zBC~!9{p-qi?`R+X-(?CJzhu_sMAFeQ_Ogw6Rf-{bN-CKJ{=9!Z<4$#KF$~Z007BSO
zu@Rv{ROYZ(^szQI%M19T806^GYUstsy4Z|Ypn+QLB?yyfqax+dDwV<l0|Cf8cRXbn
z40pet*vAmDB?hQ@wLJ&->(vLx5$vCA{}#s96Kqicz?mCVPddbRlklpJ9Y$nU!*L`z
zw4MNPAZ#!_Xoq;55XV7_$jlb9kP#&T<jeF#*Olc>6l*p-8gxhQBhAdFYlu85R6qzz
ziUbmDeFJcz`R}XE3;wM!NY!qQRF#I?K0-^ALgka43=(i-yZq;t9++o6B@Qfrd@tD;
zm8IyXl_G{5v?`F~a-AB@4o8XeuLj3c$sj`(5LqivWPyW$3+YP;!1RbEzpd1P)P5Bv
zg`o;2zi_@xlQ*4U2H={_%BU5@d_^uRkT663(!kVsZ5!-Sly$%)Zk$)F*sF;vfIb>7
z^ox=Ahi+rHn9J+$*8u%<B_+URvYt+9(bP%`cfP>--bkWcIrGJ0Ze4Zao=NyF^{uZe
z9HyP>xg9~Ee*X*U+Z8WbR<!$-OzU->k>Jehi01#sX8Ya9r^}RnB6vw=;sjt{*ZYTu
ze52~_qcWXeu6n_{vAy)-8paP=b;ZO#lYv4@U(TCv*E<&1;o&#xP)laT#_=99!1fB^
zWV;STHAEks6dhu$St8&q4HUXUG)0HH4x`eh+jxt|i`bCifF-5)>7rE+XqrTmJOU@Y
z$B2=y)}58sHhxde<4vbD_c^juV<9GEeHcMKGzrwVwgjOe-A0=pb;8G}0=9gFr^TrR
zVkzNO$$C#6bYKxlD2}kpC0Wl;(5i5LjAf0L)nEWP@te)y%8g=#m<d~u$wB_kN4{AY
z`!x9<_=n2kkDL5l02N}=NnL3(AN(e8ShYfOQHPm$4QdwkQTUoR9;%y>xlC=4wt%7L
z$7(tKLA;3ed5D_PP+BkQHmv#Gu7vZoI{KYph?`OnrZ=CUu4Cr;X>Q}OVm%&H;bHAL
zsOc}?|8UNWw^`Sj+m}&vK#qLc8os`M;d!$n*s&~#SCS0h-mNJUe%G$=trOC-Y=3o`
zLe0w12XA>n^*p5UA1l`p+$=(%4G$6A6-lTl8AO=%?dr|@;jh8Wmyl}XIo$a({~_K3
zc<}<>CRA$@f9L<-1)zlL31))^7G>dqWp{7=)k;Xyj)3~__L<x$*Cc@K!}DzZX1~d(
z5lDFEO>6nFUjo<Xq5opr|2I3F9dTxz)SH>p{-HBX>v-w<VJu}>oz&IYK8n>e82VWo
z@zrX!Fr-Cm)2HQqU3uac4yuODDrPj}#kBN#yfqBKc0wD-1?#XuWjleXzMW)AVce;9
zY0I{Vvf8CQ#;3hohyB_#>+P-&wcQtSV$!+XMFkD$JM)3f`JIy{zNA{FM3XFWTW@6!
z@QtWAhX1hdXouOuxXm|P{+{}*G<cJ0=MvGZ-DY(DdN$qoKsva8*?BECC2{u~p?_=r
zdVEl-*L^E#jP;qBfA@v`e|?T~rJ3QuQ{xs~!TjIeUW(7xEs1ZPZ*SMKn>0v5D?d3=
zfr+Ysa;^b>&7V&vwU-Q88G0w`HxX}KkW2Wt*yACr!@2p{yt=JB6qZAB$%>u!x4DY?
zQV3UoB;m1ml5_t9u+4z~!OaD5(UvP`>UgxC;ZHtb%7DDGfXBCx7XQeNqLz%rYWgSG
zb!{qcM_iwlSy!1adq##_u>V2Mf2S?>DQucw_fl5r*6S8N*AIoobcQEV+G%_>o;>`r
z8y8M81y9F1L!dSt6*?%^(~)&D(ti63=eIr$+%b(I9<E^gw-A2LCh>DF8}*Cy+gujh
z3|EDeScD@Qfc~A{hD@}Mzq@QdjM>0}|0Wj&xWZdeo8$&DzI1@}zxuz;_}@PY)&C|b
zB{{1$d~rM)zYhJF&?@{?sSQ83;~y^WFK*xcwt<EL06uTXl^#!I?L3pt|MAvb-&jy}
z1ag&3ONJLPh|dg`7C(tkqKy)2e+ERZ##`}rKT7}?XXsLt8vFMoB}PACLMD3s$KilP
zJ*q`Yu#+bN@FETC-9-G!x=&pSK;#*VJ8nyL)evJLwMm2$!NLJ97RHeHeHu$<)tR#z
zTyPKo6`ayzMg1n6TjOrd%ElQ9G5Cn`88Eb`J(cmqDQw6azMa%&?E;OdN<UQ398G@h
z^JZUp0(oqujXlgkUM4u?x7jZX1<fKa=J&l^$Os4$+0r6d78x+~rrzW3bthnQto&D@
z1lfAd10D`|BSO;9%#nRO-n)<R@FY?WSlIdWfrN^|kP#jD>UVgodkU}}z^4Sl)+i2!
z-KuGX4}I~Q7SvKih61_-zA4gbKr;16gecKB^`H{yICXay&MJ~K9HM{;Wv91=7ger(
zBeJI*P?^Pn?3C1^5!rK;B};0R@k?CUAipZ4Af=l;mlAGT?zUPgV6wPayr$;G0NxxO
zyW*HP(F}zTVA9d8-5cFh`gDjP*ifi-YX7b1Rfo0QFxe*0W*+|sFg^DjNaXrT*{D;z
zXskVcH-2(NjNUYMVV}vNq8wMOECm3ANkbC>*IuT_RA0Z<$RYy3!^gcVZ)nx`)4)%;
z-0{;1OOMCYfRDG0z8R^|DTSh#05V{drty)|S^0hi<<eH3%SbqRlPsFyM*v)g05oqo
z1OVpi`5roKF|^pJOJPRfq>dH_++O8~uL34F%zFEXedq8);YV{WDw@W59fv~i%QR01
z!`=~1IoG4A^0DmiO%8kBLZ_U2s{N!g)8#t=rn-p-YrhfldRHOE^=j!rC9S4vH|u&}
zE`mEwa~s?*q&84IIP>R8%U=Y*?{Axrp6SJIq&dU<a^ypt^yz1r_%&Jwg3FI6vF_09
zn>U-r0n+E{8N@jR_@=q<1Sj74%B6Z~BKJ0G{5_Hw;n`Zi_MKK_bH;0V@xQ$lmfuM*
z5U@w|<!EqP)LWVLUpJpbN(BrMJNRw#V7185sFc}fV1b)NWw(dZ`T+EQ&3*M-R8iOH
z85%)pN$Cbb=>|z@rG^HjySpV6k?wBk?nXdTItHY>85nZNZ+zeTJ@>i)!9Bmt?6c3_
zYwfkyUbWZCZA>BV8d=rxjhLK{O8z5b7yKS5)*U+bn#=Z}94&|y*FR)QnH6=SwPBqt
zvkymh1WqXk^Qd|adEHPZbr?))KOcXkVFdtLL_~p&TBkO}AMs!%DtT$5y%O+2<M+cy
zQp7HAK%c#LDIQaRYok{By~*H?{LcD8Gv}i2{ek1g1L;aJ(({rOrO*FZ0}K3MYv))J
zhQVdt7gnJ*j_WwmVdznUiv<GZ9K^4!Scm{0n&;#Aq;P;-@7OWp6w^FEztf_T1Am*c
zC#=OKqzCPy(o#DI$`>ahC;AbFdpj${H>W{aEPuSRowLX9J3OLY;=V;7E}(M^aV`^y
z#{BgjZ;YC}l2{#KxHeepn9f6gY%u#(!8_S?a8XoL8_EaZl0E3BVgX3vyf^&U9mDcF
z;)qz{c$03P$#4SSy&PeOsG~*V@7pC$-MlBkrk(0Yz{=}34<{hT1tI9hs<fC8XUAaA
z(bl^2B2;`eF%zzabInR$uRSd=Bq}(_92F?-+~69Bcja1XZLq0m=tB~5Csqr#_2x<t
z4FUk0t|td*Cvtu%Of)b6+Tl`UYR+ZFy`M>llq-*kf`Km`n}@{u?TZ}|7TZzYNvB`)
zRiYcDaZT50yX5fJw>SsmTOI~JGRBlrV2pyKcdFsZpS#T$Qe3GT)W6|=k7*f#*I5KI
zomoDr>j`Hfy*-}&CzxHezIVwsKc@YusCTkE=kb#Ikc=7rEH;sZ8L|=4;d0Cq;cL=k
z<v2I}jt^i&_V=9RdB99e2~cK`oPFoBgknfAKzTdJcf=?NBx4PmS}CRiYd3d{swi2a
zTR%uRiEO*!G&xuw3I|;`w^Z7&D#8K@ATsj7f=(Eg>~-m6c%n=b8uktXmO|B~y}^vW
zFlpmSKO?tue8f!}p~wt+d&_fi@I`UOiLo1%fQ^02R@0>_VMvI+0u6uEi%$Q7oF>3H
zQ4Nr+ler)EZk<apvYrQvm~LL$1`-BNn1ZN(ZZ34)3aqglh4ppI<5^Iypc}(>F1oQp
zrGGD^zXHnLUI3Beq#z9ko3v&Q$%^XPq`Hkz7P@0`dq>mPj^D+}%KStKBY!x9ic1Np
zyz&kdO{O$DbESctDrZKO9r7`ZPb?I=k@tP4o1W&syfv3l!l$F=;2z#xAJmyWVO6;r
zH}EIh8g;W<{I3x82{<{=<mOGcW#ePQ>At~huxRc~UyTYWIAAz8d{du;CmDlkc?N@;
zJ@{G#)sBNmtfl6$6w<5qvU#<@UtoKwkLgPvOFm3mFi>io_q&t?;Bv*lW<n1%jxt+u
z)L&f~nMuS6-9Bnqh4h$%+sY-QY2O&bczvzS&(VaatsHZx=?ge5%?r@=@z@lxQ9sn)
z_q>St1^HRrFE<h&49aLdCa5agNRmNf_Gx-{+_zf#JUbVYf)WS>x1Ep2N4*sk0ZP&c
zM$)f&1+gxqoC|>$?RID}&J8n%VZ9b-_=00ZEx_Jqk|;T;aCPi1qt5EYtrn*8Fb1bo
zmqKnzFw&bu!K-$A`O(-6(H)He7rK{&z)U7SnL?<CgDq*pd$9*qP#Q^P=lfG>>Odm7
zUZi}T<_V1hTNZcA4ejQ&1ec(<whvbCen^C8WWsTjw>()K2=pb?!%wrx$w5o*%%!KI
zQZv$4aGa}e?5RHM#;Ls@Z~!8s)bD&P{G+LLoGp)mq}`oFoyo?H#4!atnQxK4>8Bz5
z5BL(jSHo-RvcEzJ&V9?VF8tz0aD#r>BFYz-Y&tlXpop#A)envonLQ{UW3gahTG7Fq
zYA~;5<uxdPO;YZ_onAD6SD37{>*9eL{6iK9>P2>s65U`iQm;a##&Z2?rdW8rH=(in
zSmp5Kea+fCL)v~rgUC*&!0-Y*Dj&3so7DGs+Q`c*m#4T6yf+1m@wJt)(Q`@=!g;YQ
zkVWX)a(Wrx4>fXL^;!|<{W;AiJn&uh-MXYn`1#?$b4V8z%38yu8^9=D{(Wd8ctgM|
zuKs|$jwI+4>C})a8rcCg)+bT82gmq<>sve>F1Plre0C_m`#xJwPd_^I=FPDnv3U?9
zXY{u$s#YKKbp7xaZWVqeionMo>SVcq<Ne%;3d$u$ijV=HZ^$&GjlYc@q+v)x5>dDq
z!c#ZE7vPk0=$)(!b1;!|;Yp-|SQnv}aVG%uyXanx-omZ1QIt&qq}bHf30u?Kw>LFQ
zF>LTtZ25IQ^1yHFOZ%L5Qs(lY_nLn^##5($o&&T~f<QYG>np4r$FCJ`H@sk>hycPU
zy9PG8B|IO~_`9>sNOGinIYlw;d6CaAs00#L>-BMr`=Lbg1Pq`OHDzqD(N-YV*C)F~
z=gN@qxHZq09QS_u@k~g+Kd!9@=wb1vij3@{VirXu@(>H^4pZDw+N7OIR|~C(D({S>
zb10R}77TMk_7a>#kV)8%RykRaW7<V%Ju_ITwa{{4bz#$oWdI623xO8HQ2sV><Q~c+
zxe{j-aIj7}jy}iU5<F{3W_0}U?z|x2BQE|F>1c*inxKhJp^{~bqjd1}+C$I&QNF>^
z=yIXFSG;I8xjO_BU|`hN@iYGRZA7nL(I!6~>^H1j4vAn~6(kBv!jsU(2YdV+Wj?(M
zVEK&$UA9AUyhLv2NJO5{-a+YRbG*mW8?~~qjzS4!y4Po)R-++&V)ngSWpq_a{u7zf
zTcng^NuUE@e=VgY4vaz3N}>-QL0!9KiG+v|;Zlqv1!6t9v^m|zv#LHOLhHEMpEdoB
zGap(`|Aqt#=kjYo?hb!?8;)QzMPgi(-nm25^%fX|Kw-MBzgNr4-LHYb9}BxXr~oR$
zM&PPmBTs>(%l29`dsb$d7bWma+vRLpZo&?Rmv5Gu&x{m+%8Y^8qW$Y!me2mNr3f6#
zsZjcO`UAXPjML9Noe;%{?%}^>;o#VnF->I!n(&ek(;#5LF&7mlvq5QC5;c-F+O{=N
zuXGxZt*Oo^oJ>r$MgCyO1i~$JZSr(X&zWrnTuJ>c(*rhQ34K=Un3NMj=&P}V!?=n>
z-sxWDcfjj=xlwG{UHEuvCpW!*9l+W#{uov$bZ9cT2q>w%kWef+-H&twB&Q0+z6REu
z^Tf8WT46xEF;Z>=Ih=#$v~4fRkdT@`pL^;QEUDR7F6*j4YDFij7CSQyRgrM;@bP!T
zv)72aJQ9-k#V>1G+;?x@X8#Rn?JNSvj>x%P?}*t?p3b#jg%XCCRxAAVL@!Ht_WGr2
zxPY04>FZMD4-YU%1t;mlD7(sU<m!Z03wIJ#9+2gVU*%akYt_?BT4LEyB`i=5St;5Y
z=3sv$YFBv~a!%B4{BD_uIs-^ayF#U1_i<gbL9r<m_(m~`%zVFO&DvD71%o^2saZ6p
zvJj-QSUuz`jRG-?s958o@e{uZz*YBUV*4VQoZsN+5<j{j4ij>w?{#rN<Rcm6FY84d
zrOU$23^;tR>tjFR3CH4m-z~=vZ+802NtJfpHG#A?45?q=G~H;$s4B`qAgq^a7OfA~
z|5<PUXHuQsC27ESjedE!B?HL}bT&dtBATu72ZU-8Spd!i<=$>1^t~R{|JDzicIs83
zI`_c@l1DD#yV+e=e{JA!_~_{9`uh5Gk?PX}G(a4Y-BP8JD}B_uK^M2($iQKt)@&?8
zaJg!_ZBB+Tq%YbMyo%IaU(`F9{uYWqK8mH6Qb|UobGz4c{1j5u6>H!)zEa)dly>9@
zfUJUmzCe^U%UY0tyGi<SI`PY*rpFo>8*<<b;%swKPVb^Sc;O}9{`z6+BK>-aZBLJN
zoU^Rhj$4Uce9bV+sCpJ{?dIjRaxF9o`TgiN$X3@X?JkAgDsO8^o@wA$d_XIqmhr-x
zXCora>%7V{JAdbg%T8Kg>+}~34DI&unnMRh;F@Yq>)sOiLx2J<9d01cJ4XAft1-*#
z@b?if`v2w7c_9XI-3$HsvFuAv-PWRm7`pM?3eB+gis#&lWA~D_F%D@F0<$0t>{ZV}
zjJ4fWw;FZ#WTYxmNUdGhRrGZWO72OOUk4T>r_Oq|G}+KwK7Vp+Ys=KsltR?ob$2ZD
z#aENwu;+@&x7x3%hsVdW-+byp<o}wQUc5guY<66ap^<7eD)Oj^V8#fintZg!qbjST
zxb&yqpR8U#S6tkf7{vlGl(n?BDMK({6Vnds&r|ys-;8u#LBd8O%N93GmLGm_;(y`Z
z2H4$*dsIt5=|O7v^lw<{+m&VQe;l$?CeR!e!`0rN1Jb6==sA~N0)TXZ6R_qS%23VJ
z=?qL1R#V^r!zAH1)oyo2e}o^c(W>{9-IhG%9VxJgRgP;Nv?r!oX_i0u-%hi>eF7*R
zCTg!8&~CU)I~9mHF~{S|#-YiL$L1bNKdUezjEbEw@PVJt7CQ??Rm60Za!$r3w^jWi
ztufIUn7RU?)7DDx(AP$;et`Neeeaxbl(=IoKk1D-bR{!Bp4<Ck?|8Avra`ynjktKg
z$x_Sn=g*l`vy_ySF1*&s9on6s9oH`j2@47f-CWN(4li2W@K9-J9_T#H^H|xQ1%7^i
zI#ig6>Ij2jEMG_fW>5&Icxh=K9>6Id@g=WP%g0~jvZp1Nf3V9>4JQy>-D_{_f+z{*
zOerB%qW-5{UD%dIoqp;=<H1_!mhfe!-`?zf(_ux4dfz@bI}jx|twS7`g6V70LLedE
ziQMhuK@Nz(TpS(Q*^-iX7N5?^JqDla6{j@HY6kqJku_E?IbHwKFW;s9TV*2{zZo(x
z=k>s`f&1Y{_w<vE0HQqTnCkb~0XF>?K=DmM$tl$ec}?R>FTKxu4IhnDOd>egzkl;%
z|B3?+dbfQpuKj%(C#eC)a3Itw1kLZ5ZN)}Nes||j>iKVCqob7$A4IL?iV;Ya(bHNm
zPNjYe4DmMtWq#Mo*C%bzgG=wIO`%q=WH;~SR%YX&F_q2^3MJ^crO|tYRPoiEC<=`l
zbIbO5)ZF$}qd4CyCx_mvY2=fj$@+nrp%%4e$7?o;2RKt+t;Drbs$+u`8306XkEOko
zk6C`1H4L(3c2n2_CiJ(TeLxQ6ORZpY`X1c%v#yd`TuAJ$uBE7J(9Hqux!zvZ<n1zd
zf6wc=B?}GU3%<Y`OAZ3D_Fu2wSDaTp;KqOoYCt;*ci?y|AuA48qx9^cu}*!D`<S!y
z>^mS9$83RB7b(mNj*-|gr~SC=z^UPHO-lT;q#2r+^{6JD5Etisb)*ygtGm{YQU#I9
zjS-Pi4}qY?CWmXU^}cWd0}imEp&=7Lv{t1`j~F2>a0wKYe-pWk=F|Jrw?a~yzAmN@
zjwfAX5%(P!3X{AxUud#>j>j|tFwZ-GdO2RgS^g=O#Jl0H43B&H(}MFD>e{qLg_L=7
z_O>kcW*k8#;NEV0{P9Lv2QP+46Lu2$8u(fM?ET;lD1_b#JK{c)&k2Kh$4Dm2Z(J9V
z^{2|(ZF756=4wu=`;1erDWlPQPR26{?Us;BRFaYnY#uh4M`WB5cC48QZ3a&>b?|+K
zuqexw>Fur-_C&+UwZk8}hbzk-6^6E*GgZJ^I}cT|RS<MEG;?!vO2G{itMAkpK|w(!
zB_$s}e!RPe@~4lcrlwB+RKDA!dMef`Yx~D>d_EvVrZDpp6!@v<riYwxsqszj0Ktp9
zKh5GOzei)fnkj%1?7MJvH*(J_X8l$&d>Oi)>=X~X3B<oKU3|ZoJ$YAf{Ns3(ftc?x
z%d-lpyAv`BFs@dS#PuRi{Hz_1w#Pr`WKTuzR&YEiAn1hQbe~1De|`-A*-@&jn}hTL
zUZF#Q^y1F$8;2qum*9l9?V-pMz>J^Zgj4uFU$geT%t#QL6ULql_v>8vVw{To6jp7j
zPq{FohXE84^(kd$W~N6H>H^m1ARei;va&)&6$^u+qM}NDeSuo-dA4y_)g{KtY7JfK
z7#F)Mm(5?Ox0;@>F=^BJU&v*TZtp-C%KcHS8jt&*A!A02{I<^_QE^Byp^gAq)S|Bz
zR&AP_6a!G8zyr=OGV>HWWxWyxe6RHU4iz<oIL^_mV2LN|`5c+Z6CaoX1jv8@OWifE
z&Efrs&p=wtXapR5k^jMnxt<cqn=;6INhi~?*m35l38`3geF9Mg%}Io0@H0_=-4!QO
z*2xxev~E%kB@un}N9{89Mp;mIs`$0Bfk+EIN!UKKgAn`xF?q!#_LlQ8VJh!E8r4ru
zPG>}5eLQ@8=bO_{i3+osLLD~C!Czuxe%Z}K>j#XA?F_ig3wMf=(}YU{?slkwNrd8>
z6>h~X$Y51_@rRQ9FQd_8dXiuO7-@}2>GBi$-%zT+YSXC19Lp*?ds?FaUBr=EvZT{E
zp5?9{$e4xNn{ZT%0OYnnKJmAHzEUd-ZeUH%$8-m=Tgk6wBvLND$QuQ%Uh6M}anRfr
zOUFBx*G<<HLp6WHOtS0z+qRtfc}NUQ3BA0w6Ty_;d%3&W0sfZ<v&$teu@!7DuRLuQ
zB1|9W2h>rXNlF3|lmxg!>cknZypJk5+}ktGyd)=1vChR`^G2z#`uK`<_U6uJbd|>a
zg#Fd1tWg5G*+>8;gfPvhcrY#?x{ls$4g$hJfYt`37MirvFHDNSe*D~$C3sbfvWpP}
zyG;j_Q>YJ|TANplyE8q|<-rq1xlwqMggbR+7UY9!Jo?b0CYh@y-eOO;cjc}%eHD62
zbYrtntPe^Ixb@hb6=E9kqGESg-Zs%=r)?el8gKXv3u}6MnwVYt^lX62qi9T~QB2~?
zhpEnQF+oaXq=fF{^}|eJ9U<2l)gFISIGMt;2Lh6(Z`pk6mdjwdUJQV<xFW__LiTd5
z9RHEt$({7&>JF-nddm^|a*ef>bK<ebDgKWx1HMOh(g8YOW^nEJ$24dRDi?T(6}?;G
z!+l4`h1|du(~tA(Qn}Z${9u9KZnvC~*4@m&yfYO3(JBV|Xj+L8l|rwYQibMt;^Q*J
z*dc(T!8CFylXP`y0{u2SiUlzs{!~%V<7<Gtc9CZC>Y+BxW`MbFy88_;r{82|fIw!Q
zzg&Jd2Q%Tbj+KFIso-CLM2SY@Q)zDQr}LfBg@pwc78XMz8Ch8*W;V7%mCTg}G2kO^
z+%I}q*RG5hZ?^i7$zx-2yfsmo_=OH-C%v*LjlP&Pa`&X=TVg(VIa<!e(1Rhv--Xx{
z)pKC&@K6CT_VVyKnP$_8td-y}3qq2($42d@`;PNx4ND<V^4f?4$}z=R@&d(i1M9kM
z;M&3NR|8PJFD43@y3X|#69r8!I4j3(1)n9RneN{dNzG#V4!^bz3q31G?&gnRt;Q(1
zwvifOV`?YbZFzIVYS;4}#ic}tk`D3%tMs9^@hEbP594`<jZl%+dsniBi9N$;B(oOs
za--FSHk$`6X=!OMuNG<yL&b;EvNBL#UtfKfG)MBP%ed%BGH1Xx5mb|H1K{B1t`m0i
zhTH<u@7|-umln0He5EyAAB^fO_3y&%j!7;WRR8j~D2KKo7=&=eU13puy>K_WB6#Nn
z9**ub`IeoFtJuTk2}E>a?dmDN<ekNEkFUGUIX={?GhgXykii>HJ@lh+U&T{>G+X-l
znO*=E1uxATT)L(uc^UR>;0pDG&P5#xQ4xvF`H|eeOkrDE4Q+=NwA~NY*LM{J2Nm`>
zpN5S^{fd)C3uRBGo-En6`e;GrRW%YdBx}GXpS{66+;q}a?P!>G$<wP)Aub}xGLMDG
z;`*9{W2MGqpj@X;HyQf30ZT$QEc)r=GYpIr0jCW)D!+@H&FHToA@z?3mk=ZLH*N<r
zCo}s7hZQZhwf0YW$#@-f^j(xg(B<J0Q-DG_v!Yel<qq9%mJZNv7p663Mo4E|VRcBr
zH2he;4CgP9v0%-yGWWCh`v;Egu)yYhXMkq^ge9MRz}0W9jp+$U*cMDvU7%wen#F7f
zKbFLA_d=wZHw%qFl~!kaUg=Mt@x7WbC?gP`v8@2*=!r<DlIq?Y*<Fc5X!|ut7oqiP
zh%8;Q;FkU#Z_(#S&i!=(FBEx~1<bd&>}rAy5;HQ|?H2jQAF~S!3)O!rl@u2<v$Epz
z3$|@1=?xDLUmZDh#S=8irt{j&p;P%HG8UtBZ##FK^^+qAVSIS_Z=D6sfYWlx^yr*0
zZT9ZN-nMg{EhVHg2EnT<f3FgQZ&g=q_O-)(q@FL^9=D8h9P#rVsQ&F8Z?-5oRp59;
zyGGh7*1y(^U;D%bL<*C8Jb^dAwao&$Oxg5-AY&mWK)|CLZEbP(c~&|b9fLdsRa!L>
zy$H5@rAwx|m|wSDO3wl$eXUVj>-BUKsp4!PXQkkUCrR0m13%zCN`uV^t6Dlq5K%TC
zar^uN;#3oG+k#<RX#l-%B8|Wr4kDNmKB`fy!V8A^{3mSIOBd=MkNYJ__Xfpcb}R7l
z6Ai|W(|MC<(aRZivPedLeturwOGG_~Rln=ZNlX1U_hY(f5!yL<RaH)QcH0Ny$Fi!<
z*3ZAcpPrr~sw$wPq8=~QF>!J_+?=jw`@+JRrdrjDgeyEkzQo*AbuYx5l4AP)(6YSh
zu#V9jETuGD9q6!jfCbr(TNE`MGR2FV?t)Sp=s*$^A4*DwMRPUstlQptWFo>4RMnND
z*aZ?H$ylF{ay4NMQKBDrU=qOR8_=5RpV)wd{GWpa=7S_JlnYf%3O{5zM7C%Zs%-tf
z4tNs2?a}KXZBtLIQF~LoY;*rfp4i9q@Ffmrr%=)-61|4~KXk;65QQbr<op$k9N$D}
zQ#B>14qTh&*oz);)K1o-;f~N<?3Y{H+uLt%Z*y{T%FD|W*}ywHJKn7IIFbND<+g!T
zj*g6QlVIn|My3h6>>SLNnQ`f;9=a}g%ONyDBlU3#PO2pByN!U`Ho9dlm=T?SXNR8R
zZ<i-dKGy=DmzE2=Cxt#<Y>Vwi`c~hNjYXaUFJ>5B&a_<i`B$P{ibSaXYM4f6v7%Fl
z8U41m*`n7`tdWZU1M!%l1_10?dFgi=oA+yoo8+j~PR-EplDv8NudMOybTXovXD%(#
zMFTa_QED%+oCFQ7$XpKZ55*StbbN132lgM59+I7PIpGa)2GbDXH`+~b0ftxvC4(%6
z&vQS<o2Ai+0MmlMv{^KuP5pm9pfH}XkMAiS^()Xkh4;I_#gc?vCGpBgV3v6zDr1gH
zk4JnX3~u~5;mvHXu#b3mjFNnpCtnHSHQy`0u^kbI9{g_Tb3jPzlD^GVg1<aZdQ9dc
zt+u)O4|KuvHT6H`_-!)-=2&e;KKY#qUDK&Ak4h!bNtt~F8K-_Jv>T&+@wCi4%V~Rf
zKL)GeF6?D&Y`>G{_vsnlTnJ&JKyA7%e%b=t2BOfs&Zb5-SUVb$4E70aw$+X+%7~r>
z75m?hKJL$%)g8Z+n%5u#+`dx)Q{EZAKu;w$Zx&xToZr_ktfF7HDSstCpq4~)=Aqa0
zBZ#JMGp$o_(Oan4{ObMe3{Ti6TZR=TLT|@k>)$g_Z9g<`cSqS@$#ET!53KL2C|a=L
zVeWJC(9$F8&a6@*QS*=k^9surn>tZhd{nTNseQFrCQEjPmAlYdH5KmBj`?<{uh3M+
za2y80E`8dM3iXf>5Ju{e|LY<p7gd7ogr!ajs5*qe0SkFT2rht%)vbGIDPk(r+V3-7
zcT>2Y8$Sd1>#nS4*}YZFkJmz2zcl`q@0N?NZi`LOU9EqNGfowFtb?RPXhF~Q^HN3C
zvR)3!SyEhvx!4FV;W3_G4S@O$n^)Vb>X0Kb_kV)8XbY(6`(B^@*7s7w1>`zXHDQLU
z&qlS*diQ<)ioDUVC|0Lb)cVN`62K<Ddes1FyEdPunub8Fix=HKksp4t$?IV(nPG8O
z4;>}&0el&=^_iY`F$%cG>87%ycMogZG(4ABi6m}xRPtjlyg!CbEKTG%k^Q3iSfrps
z3Bb$^wXw1vPh73)@w;P5^>kOocdGam>#Y^vX)?j(2F++Q{aYTR8|fMyrv4JE;o=9-
zL_WuC6P6<*w-(ZWCP79ucdN%I@vQseGP=|Wk0IKBaXLNPlbfJBcGcB0C6C!jNBi%v
z<9PI<ER};1lj~>W+ca&LRH8sGov~qUV9r`^`jg2o?(O5l=!c_cGUZF!8^)e<T6VKk
zRvcc1#p%m)qH9@ehIO6%1g7opr;OYPmjceNX&(QH>5A-*_U<D|9UB(g1xjbZwkbX)
zSh=-4d$(@^C3Hn4@kFw7&b#$@9WfnlDO?}NhDlsPEAmejAFJx?$Q1~vlu>iOf!~O*
z#bSvYCa&^}CYX!bjod*yts?FZ5c|b>NV=mvE>Y3x(JoINYDmx2sZ~$$nu|(kA$s{R
zw)ywpYOA#Dlgo!^ju!))+cls@G8<L&0Al$#=XiSmMzh`8POGRJOoS+YpLrGLd8z#x
zkjZ=2eTIngE`ZJ3odoA$4_u&@wRxiXU=Hot1sAT=21iNJCR2(RMkq&d2;N<bU5OPU
z++PFrigNtEzDlBkl!4Algn*7DE}*rZ_1VRH;mOMY|J*ptTgh@ciR)6kg2bmh1KGH$
ziA<Fzv1@+)%s)BtAnXo1d*WqI!74&m<+>^GZ%;{71OyJ0CF4;8;Tj!pyCkz$*B4Go
z@n~2$m5og)fa!2XL@4;n#;rRs-cE;N`{wB9Q$o*2!=C(F+yu+MZ!n2jJsg}o9*~^z
zBfOf}S~TZje728;Md1A%rWsq-7VPEy%5Gsw<O#7S;60P*kR#XOb@Y{7*SDuU1fA<m
zbX+Ua(q_DVy%GHf{^}%CmM*YApnZn3LrsN@g*<KM^oq#<{HizsBHE26H?K-reSew?
z0mEz_2NtxA@6J;F_esuN?nB1-BDyG!#ATZ}5xWODVkfFCebuWBx|rB6V`<;1YiSuP
zZS@=fnn$ApGq9t+bbr;z+n|SaOT}fpvExJ$#BFbq5cF!BiUt|<&;BLx);@!W0Tm#|
z0|mw^9A^8xkk~`!KX=00rM&bv$DlrKwURW5XBWi_B#AFq`t#o8_^(InYCWq(fvu$o
z73uJM2F-x>cD({?O7BrKOIxq>C}etMGQ^ktq_2~^07nfiq-wCn{Ih4}U9N}Ejb?;A
zV&+H27Zl6V#Ev$2!sfob+!>rQdFA%{GYoT7R!?4Y8j+@S#m|u}(tCwMh5VVyXHoa1
z)9ow6rH~lVHw5WN;J>kpsw<%cvUw7wWkALST!2b^F1(`QVZJ5>60mFgHawe+%D=*c
zKeiD2<5*|dCmlz83q{4v!&hP)Ns%cGq(Y-+)_itejUIM*Q%3aQiyPC#h%JF)n|~H9
zw8Ayb0FW`~{X+F+@8iixVUf?3yhQ}1#Inn{hlZTjw2LvxusB!oKaY`zDP0}B4_k$N
z_TJn>HI^Yn-yWGBW8c^i#zxqD@sWdl%Iq!3F-<q5RPAuw=dRpMtK>!VtvLq|Qu~aV
zrTxOqwU|vB?i3b+e{bPq3}$kYi!NAkHDixP4XaI$Mc=i_g<vBgn@S_5HQ3!#G#X#<
z2Z`;i!=rM*b!g0pB3E8bw4N&k=GA1R*a->^a=h=<XA74GdUpYG3S`3rE?%rznItIx
zl@7Y;=E-JUrSn{NJ+b{soh&9z4jv6n=^`Y83j4`BCtqmlN2<OnBYDym7q5_ws-FK1
zn940G#;D=H47xz-VD%n7(CctIs;+bV$%N?L)Y&z68p%BNj$QPH9TbD~0^uzpEhnrq
zG7l!mbVKdH5SQOj)?d0DJAfXey5drwdFY3AM(Yu(6fYw9Xxy)NZ+E?tbCaG&nb1E2
zI27ZLPrF`iqa*BgzQeYBzC8KiCIYEm=e3HH>Z_*et0o$lNfq&&Mg$?)LWpg5ksc_c
zmw6d_l}{e(^7XcjGvtO7!D=`}<)<k4?w|3!0cG^mx_u1r_=-D4`mcc$z7!48Ze%}#
zM&U|&2P*PjJ4N)!%iKvmlicv2KRaKjc4`bxekd2?*mxo9k-j;2F|v$H6HNGzhUNT6
zn>h6HM|2$)eLN6o$K8;9_a1|$uj+XWwdq~+zbVDlgYVj~LSja~$%cg7^ji@9J)aUP
z>1MFSRX91Sd&Gqu_A)NqHp}diTKyYR5`*T!1R*qtk}-tfZa@&2qY1g;6^f3*<>$C0
zhb+it^hYdrCE!jO^aPUpm=yj`hu}z$3#W)NHLBh&P;7sQKE3@s2S?@$cczdFw8(#7
zxQPC@RvsaJMvg<`m@+1}ZNwolT6?c(XhLuU`uhd$nq@3PqxW9nS}9>5-X{LfJp3b9
z@bD!u_L-2TS49C!>3@KY{}Y!m&TJ5f#+AJPw~s?`yJX|d{`JBkR!&0vbUxGPfF!-v
zGat{Yn6)lcv$C~4LO3O&C<L9)z?Uau!7q;4r7&oM7fUtE488XmB4y(dPi(By#olD5
zu!j&u)N^t^c7xW7&y@$unQhUN2KS=g{hFI)<o^cc@;qMY5N2YsK)j8xze21VK7aD}
ze_U#DAtxhK$r4FTNttge^Y+-KB&B|bK}-`8^Umh#XaPWY0gg30?U#iBHgM(9rDjLl
zxv?}9fg4j?Hg<LmW<rFG!En3Id=$xXqc7ahXtqrlNA^DheoIVF{u&xuQ+{o<v(fvf
zw6yg9Y1OIF3YDDf)Gt&6RWI0fbe4K}Q2zM0Y^IJTBvfT*zAvvXN>`S>CUU9i|93@A
z9bMqMsJnI5MgK*}KQv;0eikZO1!>~sC&3016wIos5YVI3{aXprK3ZB@M9nVLcc-jX
zm6d3?1Oy1*H3G(82!@9%iHPns89<=zm9V>K;(rxpS=s+~FMQM=RmGs$+VH)c1p{&M
z@v50Z+brxXEa8!nW+Vs`HuvWtM8TB0x;h_MO@8P-o5Vlz4PH#+wE--7(%|R2PwO}V
z%?MB4Z(>h`T5&leuc&xV26x>pJ(+<M<tR5H;G9@Q=(32KaWEL{;P5c`%a_{PTCGa`
z)b#Yjl9;S4Lv8K7OJe_Iuv^`jvD|;R$D}DKg3$dV|4sj!QU3qM41(7G5AFSb)pQqd
X^z@;~a8C0CKs@p?D$<pb#$WyicX_jc

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-mini/python/demo_stokes-mini.py b/demo/documented/stokes-mini/python/demo_stokes-mini.py
new file mode 100644
index 0000000..e7789f2
--- /dev/null
+++ b/demo/documented/stokes-mini/python/demo_stokes-mini.py
@@ -0,0 +1,87 @@
+"""This demo solves the Stokes equations, using linear elements
+enriched with a bubble for the velocity and linear elements for the
+pressure (Mini elements). The sub domains for the different boundary
+conditions used in this simulation are computed by the demo program in
+src/demo/mesh/subdomains."""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008-2009.
+#
+# First added:  2007-11-16
+# Last changed: 2010-04-01
+# Begin demo
+
+from dolfin import *
+
+# Load mesh and subdomains
+mesh = Mesh("../dolfin_fine.xml.gz")
+sub_domains = MeshFunction("size_t", mesh, "../dolfin_fine_subdomains.xml.gz")
+
+# Define function spaces
+P1 = VectorFunctionSpace(mesh, "Lagrange", 1)
+B  = VectorFunctionSpace(mesh, "Bubble", 3)
+Q  = FunctionSpace(mesh, "CG",  1)
+Mini = (P1 + B)*Q
+
+# No-slip boundary condition for velocity
+noslip = Constant((0, 0))
+bc0 = DirichletBC(Mini.sub(0), noslip, sub_domains, 0)
+
+# Inflow boundary condition for velocity
+inflow = Expression(("-sin(x[1]*pi)", "0.0"))
+bc1 = DirichletBC(Mini.sub(0), inflow, sub_domains, 1)
+
+# Boundary condition for pressure at outflow
+zero = Constant(0)
+bc2 = DirichletBC(Mini.sub(1), zero, sub_domains, 2)
+
+# Collect boundary conditions
+bcs = [bc0, bc1, bc2]
+
+# Define variational problem
+(u, p) = TrialFunctions(Mini)
+(v, q) = TestFunctions(Mini)
+f = Constant((0, 0))
+a = (inner(grad(u), grad(v)) - div(v)*p + q*div(u))*dx
+L = inner(f, v)*dx
+
+# Compute solution
+w = Function(Mini)
+solve(a == L, w, bcs)
+
+# Split the mixed solution using deepcopy
+# (needed for further computation on coefficient vector)
+(u, p) = w.split(True)
+
+print "Norm of velocity coefficient vector: %.15g" % u.vector().norm("l2")
+print "Norm of pressure coefficient vector: %.15g" % p.vector().norm("l2")
+
+# Split the mixed solution using a shallow copy
+(u, p) = w.split()
+
+# Save solution in VTK format
+ufile_pvd = File("velocity.pvd")
+ufile_pvd << u
+pfile_pvd = File("pressure.pvd")
+pfile_pvd << p
+
+# Plot solution
+plot(u)
+plot(p)
+interactive()
diff --git a/demo/documented/stokes-mini/python/documentation.rst b/demo/documented/stokes-mini/python/documentation.rst
new file mode 100644
index 0000000..f6c5324
--- /dev/null
+++ b/demo/documented/stokes-mini/python/documentation.rst
@@ -0,0 +1,165 @@
+.. Documentation for the Stokes mini demo from DOLFIN.
+
+.. _demo_pde_stokes-mini_python_documentation:
+
+Stokes equations with Mini elements
+===================================
+
+This demo is implemented in a single Python file,
+:download:`demo_stokes-mini.py`, which contains both the variational
+form and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation (in
+:download:`demo_stokes-mini.py`) of a solver for the Stokes equation
+step-by-step.
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+In this example, different boundary conditions are prescribed on
+different parts of the boundaries. This information must be made
+available to the solver. One way of doing this, is to tag the
+different sub-regions with different (integer) labels. DOLFIN provides
+a class :py:class:`MeshFunction <dolfin.cpp.mesh.MeshFunction>` which
+is useful for these types of operations: instances of this class
+represent a functions over mesh entities (such as over cells or over
+facets). Mesh and mesh functions can be read from file in the
+following way:
+
+.. code-block:: python
+
+	# Load mesh and subdomains
+	mesh = Mesh("../dolfin_fine.xml.gz")
+	sub_domains = MeshFunction("size_t", mesh, "../dolfin_fine_subdomains.xml.gz")
+
+Next, we define a :py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` composed of a
+:py:class:`VectorFunctionSpace
+<dolfin.functions.functionspace.VectorFunctionSpace>` of the linear
+vector Lagrange elements enriched with the cubic vector Bubble
+elements and a :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>` of continuous piecewise
+linears. (This mixed finite element space is known as the Mini space
+where we have the vector Bubble element for the velocity
+approximation.)
+
+.. code-block:: python
+
+	# Define function spaces
+	P1 = VectorFunctionSpace(mesh, "Lagrange", 1)
+	B  = VectorFunctionSpace(mesh, "Bubble", 3)
+	Q  = FunctionSpace(mesh, "CG",  1)
+	Mini = (P1 + B)*Q
+
+Now that we have our mixed function space and marked subdomains
+defining the boundaries, we define boundary conditions:
+
+.. code-block:: python
+
+	# No-slip boundary condition for velocity
+	noslip = Constant((0, 0))
+	bc0 = DirichletBC(Mini.sub(0), noslip, sub_domains, 0)
+
+	# Inflow boundary condition for velocity
+	inflow = Expression(("-sin(x[1]*pi)", "0.0"))
+	bc1 = DirichletBC(Mini.sub(0), inflow, sub_domains, 1)
+
+	# Boundary condition for pressure at outflow
+	zero = Constant(0)
+	bc2 = DirichletBC(Mini.sub(1), zero, sub_domains, 2)
+
+	# Collect boundary conditions
+	bcs = [bc0, bc1, bc2]
+
+Here, we have given four arguments in the call of
+:py:class:`DirichletBC <dolfin.cpp.fem.DirichletBC>`. The first
+specifies the :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>`. Since we have a
+:py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>`, we write
+W.sub(0) for the function space V, and W.sub(1) for Q. The second
+argument specifies the value on the Dirichlet boundary. The two last
+arguments specify the marking of the subdomains; ``sub_domains`` contains
+the subdomain markers and the number given as the last argument is the
+subdomain index.
+
+The bilinear and linear forms corresponding to the weak mixed
+formulation of the Stokes equations are defined as follows:
+
+.. code-block:: python
+
+	# Define variational problem
+	(u, p) = TrialFunctions(Mini)
+	(v, q) = TestFunctions(Mini)
+	f = Constant((0, 0))
+	a = (inner(grad(u), grad(v)) - div(v)*p + q*div(u))*dx
+	L = inner(f, v)*dx
+
+To compute the solution we use the bilinear and linear forms, and the
+boundary condition, but we also need to create a :py:class:`Function
+<dolfin.cpp.function.Function>` to store the solution(s). The (full)
+solution will be stored in ``w``, which we initialize using the
+:py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` ``W``. The actual
+computation is performed by calling solve with the arguments ``a``,
+``L``, ``w`` and ``bcs``. The separate components ``u`` and ``p`` of
+the solution can be extracted by calling the :py:meth:`split
+<dolfin.functions.function.Function.split>` function. Here we use an
+optional argument True in the split function to specify that we want a
+deep copy. If no argument is given we will get a shallow copy. We want
+a deep copy for further computations on the coefficient vectors.
+
+.. code-block:: python
+
+	# Compute solution
+	w = Function(Mini)
+	solve(a == L, w, bcs)
+
+	# Split the mixed solution using deepcopy
+	# (needed for further computation on coefficient vector)
+	(u, p) = w.split(True)
+
+We may be interested in the :math:`L^2` norms of u and p, they can be
+calculated and printed by writing
+
+.. code-block:: python
+
+	print "Norm of velocity coefficient vector: %.15g" % u.vector().norm("l2")
+	print "Norm of pressure coefficient vector: %.15g" % p.vector().norm("l2")
+
+One can also split functions using shallow copies (which is enough
+when we just plot the result) by writing
+
+.. code-block:: python
+
+	# Split the mixed solution using a shallow copy
+	(u, p) = w.split()
+
+Finally, we can store to file and plot the solutions.
+
+.. code-block:: python
+
+	# Save solution in VTK format
+	ufile_pvd = File("velocity.pvd")
+	ufile_pvd << u
+	pfile_pvd = File("pressure.pvd")
+	pfile_pvd << p
+
+	# Plot solution
+	plot(u)
+	plot(p)
+	interactive()
+
+Complete code
+-------------
+
+.. literalinclude:: demo_stokes-mini.py
+   :start-after: # Begin demo
diff --git a/demo/documented/stokes-stabilized/common.txt b/demo/documented/stokes-stabilized/common.txt
new file mode 100644
index 0000000..1fea095
--- /dev/null
+++ b/demo/documented/stokes-stabilized/common.txt
@@ -0,0 +1,84 @@
+
+This demo illustrates how to:
+
+* Solve the Stokes problem using a stabilized method
+
+The velocity :math:`u` and :math:`p` will look as follows:
+
+.. image:: ../plot_u.png
+
+.. image:: ../plot_p.png
+
+Equation and problem definition
+-------------------------------
+
+Strong formulation of the problem:
+
+.. math::
+	- \nabla \cdot (\nabla u + p I) &= f \quad {\rm in} \ \Omega, \\
+                	\nabla \cdot u &= 0 \quad {\rm in} \ \Omega. \\
+
+.. note::
+	The sign of the pressure has been flipped from the classical
+	definition. This is done in order to have a symmetric (but not
+	positive-definite) system of equations rather than a
+	non-symmetric (but positive-definite) system of equations.
+
+A typical set of boundary conditions on the boundary :math:`\partial
+\Omega = \Gamma_{D} \cup \Gamma_{N}` can be:
+
+.. math::
+	u &= u_0 \quad {\rm on} \ \Gamma_{D}, \\
+	\nabla u \cdot n + p n &= g   \quad {\rm on} \ \Gamma_{N}. \\
+
+The Stokes equations can easily be formulated in a mixed variational
+form; that is, a form where the two variables, the velocity and the
+pressure, are approximated simultaneously. Using the abstract
+framework, we have the problem: find :math:`(u, p) \in W` such that
+
+.. math::
+	a((u, p), (v, q)) = L((v, q))
+
+for all :math:`(v, q) \in W`, where
+
+.. math::
+	a((u, p), (v, q))
+				&= \int_{\Omega} \nabla u \cdot \nabla v
+                 - \nabla \cdot v \ p
+                 + \nabla \cdot u \ q \, {\rm d} x, \\
+	L((v, q))
+				&= \int_{\Omega} f \cdot v \, {\rm d} x \, {\rm d} s. \\
+
+The space :math:`W` should be a mixed (product) function space:
+:math:`W = V \times Q` such that :math:`u \in V` and :math:`q \in
+Q`. In this demo we will use first order elements in both velocity and
+pressure, which will lead to stability problems. Therefore we use a
+stabilized variational formulation. It reads as follows: find
+:math:`(u, p) \in W` such that
+
+.. math::
+	a((u, p), (v, q)) = L((v, q))
+
+for all :math:`(v, q) \in W`, where
+
+.. math::
+	a((u, p), (v, q))
+				&= \int_{\Omega} \nabla u \cdot \nabla v
+                 - \nabla \cdot v \ p
+                 + \nabla \cdot u \ q
+                 + \delta \nabla q \cdot \nabla p \, {\rm d} x, \\
+	L((v, q))
+				&= \int_{\Omega} f \cdot v \, {\rm d} x
+    			+ \delta \nabla q \cdot f \, {\rm d} s.
+
+where :math:`\delta = \beta h^2` and :math:`\beta` is some number and :math:`h` is the mesh cell size.
+
+In this demo, we shall consider the following definitions of the input
+functions, the domain, and the boundaries:
+
+* :math:`(\Omega = [0,1]\times[0, 1]) \backslash {\rm dolphin}`
+* :math:`\Gamma_D =`
+* :math:`\Gamma_N =`
+* :math:`u_0 = (- \sin(\pi x_1), 0.0) \, {\rm for} \, x_0 = 1 \, {\rm and} \, u_0 = (0.0, 0.0)` otherwise
+* :math:`f = (0.0, 0.0)`
+* :math:`g = (0.0, 0.0)`
diff --git a/demo/documented/stokes-stabilized/cpp/CMakeLists.txt b/demo/documented/stokes-stabilized/cpp/CMakeLists.txt
new file mode 100644
index 0000000..cc49360
--- /dev/null
+++ b/demo/documented/stokes-stabilized/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_stokes-stabilized)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/stokes-stabilized/cpp/Stokes.h b/demo/documented/stokes-stabilized/cpp/Stokes.h
new file mode 100644
index 0000000..7501bff
--- /dev/null
+++ b/demo/documented/stokes-stabilized/cpp/Stokes.h
@@ -0,0 +1,6386 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __STOKES_H
+#define __STOKES_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[3] = dof_values[4];
+    vertex_values[5] = dof_values[5];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 9;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[6];
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[2];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[2];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[4] = dof_values[4];
+    vertex_values[7] = dof_values[5];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[6];
+    vertex_values[5] = dof_values[7];
+    vertex_values[8] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 8;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 8;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+        dofs[2] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+        dofs[2] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+        dofs[2] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stokes_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stokes_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    const double volume = std::abs(detJ)/2.0;
+    
+    
+    // Compute circumradius of triangle in 2D
+    const double v1v2  = std::sqrt((vertex_coordinates[4] - vertex_coordinates[2])*(vertex_coordinates[4] - vertex_coordinates[2]) + (vertex_coordinates[5] - vertex_coordinates[3])*(vertex_coordinates[5] - vertex_coordinates[3]) );
+    const double v0v2  = std::sqrt(J[3]*J[3] + J[1]*J[1]);
+    const double v0v1  = std::sqrt(J[0]*J[0] + J[2]*J[2]);
+    const double circumradius = 0.25*(v1v2*v0v2*v0v1)/(volume);
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.5;
+    // Quadrature points on the UFC reference element: (0.333333333333333, 0.333333333333333)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[1][3] = \
+    {{0.333333333333333, 0.333333333333333, 0.333333333333333}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[3] = {6, 7, 8};
+    
+    static const double FE0_C0_D01[1][2] = \
+    {{-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[2] = {3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[2] = {6, 7};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[2] = {6, 8};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[2] = {3, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[2] = {0, 1};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 81; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 55.
+    double G[14];
+    G[0] = W1*det*(K[2]*K[2] + K[3]*K[3]);
+    G[1] = W1*det*(K[0]*K[2] + K[1]*K[3]);
+    G[2] = W1*det*(K[0]*K[0] + K[1]*K[1]);
+    G[3] = 0.8*W1*circumradius*circumradius*det*(K[2]*K[2] + K[3]*K[3]);
+    G[4] = 0.8*W1*circumradius*circumradius*det*(K[0]*K[2] + K[1]*K[3]);
+    G[5] = 0.8*W1*circumradius*circumradius*det*(K[0]*K[0] + K[1]*K[1]);
+    G[6] =  - K[3]*W1*det;
+    G[7] =  - K[1]*W1*det;
+    G[8] =  - K[2]*W1*det;
+    G[9] =  - K[0]*W1*det;
+    G[10] = K[3]*W1*det;
+    G[11] = K[1]*W1*det;
+    G[12] = K[2]*W1*det;
+    G[13] = K[0]*W1*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 288
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Number of operations for primary indices: 72
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*9 + nzc10[k]] += FE0_C0[0][j]*FE0_C0_D01[0][k]*G[10];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*9 + nzc11[k]] += FE0_C0[0][j]*FE0_C0_D01[0][k]*G[11];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*9 + nzc7[k]] += FE0_C0[0][j]*FE0_C0_D01[0][k]*G[12];
+          // Number of operations to compute entry: 3
+          A[nzc12[j]*9 + nzc8[k]] += FE0_C0[0][j]*FE0_C0_D01[0][k]*G[13];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 144
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*9 + nzc10[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[0];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*9 + nzc11[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*9 + nzc10[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*9 + nzc11[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*9 + nzc13[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*9 + nzc14[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*9 + nzc13[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*9 + nzc14[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*9 + nzc7[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[0];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*9 + nzc8[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*9 + nzc7[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*9 + nzc8[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[2];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 72
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 3; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*9 + nzc12[k]] += FE0_C0[0][k]*FE0_C0_D01[0][j]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*9 + nzc12[k]] += FE0_C0[0][k]*FE0_C0_D01[0][j]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*9 + nzc12[k]] += FE0_C0[0][k]*FE0_C0_D01[0][j]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc8[j]*9 + nzc12[k]] += FE0_C0[0][k]*FE0_C0_D01[0][j]*G[9];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stokes_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stokes_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    const double volume = std::abs(detJ)/2.0;
+    
+    
+    // Compute circumradius of triangle in 2D
+    const double v1v2  = std::sqrt((vertex_coordinates[4] - vertex_coordinates[2])*(vertex_coordinates[4] - vertex_coordinates[2]) + (vertex_coordinates[5] - vertex_coordinates[3])*(vertex_coordinates[5] - vertex_coordinates[3]) );
+    const double v0v2  = std::sqrt(J[3]*J[3] + J[1]*J[1]);
+    const double v0v1  = std::sqrt(J[0]*J[0] + J[2]*J[2]);
+    const double circumradius = 0.25*(v1v2*v0v2*v0v1)/(volume);
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.166666666666667, 0.166666666666667, 0.166666666666667};
+    // Quadrature points on the UFC reference element: (0.166666666666667, 0.166666666666667), (0.166666666666667, 0.666666666666667), (0.666666666666667, 0.166666666666667)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[3][3] = \
+    {{0.666666666666667, 0.166666666666667, 0.166666666666667},
+    {0.166666666666667, 0.166666666666667, 0.666666666666667},
+    {0.166666666666667, 0.666666666666667, 0.166666666666667}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[3] = {0, 1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[3] = {3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[3] = {3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[3] = {0, 1, 2};
+    
+    static const double FE0_C0_D01[3][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[2] = {6, 7};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[2] = {6, 8};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 16.
+    double G[4];
+    G[0] = 0.8*K[2]*circumradius*circumradius*det;
+    G[1] = 0.8*K[3]*circumradius*circumradius*det;
+    G[2] = 0.8*K[0]*circumradius*circumradius*det;
+    G[3] = 0.8*K[1]*circumradius*circumradius*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 132
+    for (unsigned int ip = 0; ip < 3; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      
+      // Total number of operations to compute function values = 12
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F0 += FE0_C0[ip][r]*w[0][nzc0[r]];
+        F1 += FE0_C0[ip][r]*w[0][nzc3[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 12
+      double I[4];
+      // Number of operations: 4
+      I[0] = W3[ip]*(F0*G[0] + F1*G[1]);
+      
+      // Number of operations: 4
+      I[1] = W3[ip]*(F0*G[2] + F1*G[3]);
+      
+      // Number of operations: 2
+      I[2] = F0*W3[ip]*det;
+      
+      // Number of operations: 2
+      I[3] = F1*W3[ip]*det;
+      
+      
+      // Number of operations for primary indices: 12
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc6[j]] += FE0_C0[ip][j]*I[2];
+        // Number of operations to compute entry: 2
+        A[nzc9[j]] += FE0_C0[ip][j]*I[3];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 8
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc13[j]] += FE0_C0_D01[ip][j]*I[0];
+        // Number of operations to compute entry: 2
+        A[nzc14[j]] += FE0_C0_D01[ip][j]*I[1];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stokes_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  stokes_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "e93f366239c0a95b7d77687ec4280e2205009455fa7d3a92b0a8033a36e3996bf2dda5cb95beeb7a6f03157d0b4b0ac507ae0bf86be7c9dcf5cc992cfc6b564a";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stokes_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stokes_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  stokes_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d4604ad643cbbe4c46e97258ce6269f7ea258a2f6592eaae95337d9841bd3a9ccc2188d19f05ef1c9ab24601eef5358c6577d0860e27ce15f476e4bd101c4e78";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stokes_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Stokes
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/stokes-stabilized/cpp/Stokes.ufl b/demo/documented/stokes-stabilized/cpp/Stokes.ufl
new file mode 100644
index 0000000..e4622ed
--- /dev/null
+++ b/demo/documented/stokes-stabilized/cpp/Stokes.ufl
@@ -0,0 +1,40 @@
+# Copyright (c) 2005-2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and Linear form L(v) for the Stokes
+# equations using a mixed formulation (equal-order stabilized).
+#
+# Compile this form with FFC: ffc -l dolfin Stokes.ufl
+
+vector   = VectorElement("Lagrange", triangle, 1)
+scalar   = FiniteElement("Lagrange", triangle, 1)
+system = vector * scalar
+
+(v, q) = TestFunctions(system)
+(u, p) = TrialFunctions(system)
+
+f = Coefficient(vector)
+h = 2.0*Circumradius(triangle)
+
+beta  = 0.2
+delta = beta*h*h
+
+a = (inner(grad(u), grad(v)) - div(v)*p + div(u)*q + delta*dot(grad(p), grad(q)))*dx
+L = dot(f, v + delta*grad(q))*dx
diff --git a/demo/documented/stokes-stabilized/cpp/compile.log b/demo/documented/stokes-stabilized/cpp/compile.log
new file mode 100644
index 0000000..8c8318f
--- /dev/null
+++ b/demo/documented/stokes-stabilized/cpp/compile.log
@@ -0,0 +1,941 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Stokes
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Mixed<Vector<2 x CG1(?)>, CG1(?)>'
+  Unique sub elements:    'Mixed<Vector<2 x CG1(?)>, CG1(?)>, Vector<2 x CG1(?)>, CG
+                          1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Circumradius.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 1
+  quadrature_degree: auto --> 1
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'Mixed<Vector<2 x CG1(?)>, CG1(?)>, Vector<2 x CG1(?)>'
+  Unique sub elements:    'Mixed<Vector<2 x CG1(?)>, CG1(?)>, Vector<2 x CG1(?)>, CG
+                          1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Circumradius.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0580299 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]]])}}}, MixedElement(*[VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.33333333],
+          [ 0.        ],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.        ],
+          [ 0.33333333]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333,  0.        ,  0.        ,  0.        ]]), 'FE1_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.33333333,  0.33333333,  0.33333333]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333,  0.        ,  0.        ,  0.        ]]), 'FE1_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.33333333,  0.33333333,  0.33333333]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C2': 'FE1_C2', 'FE0_C1_D10': 'FE0_C1_D10', 'FE1_C1_D10': 'FE1_C1_D10', 'FE1_C2_D10': 'FE1_C2_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE1_C2_D01': 'FE1_C2_D01', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D01': array([[-1.,  1.]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE1_C0': ('FE0_C0', (6, [0, 1, 2]), False, False), 'FE1_C1': ('FE0_C0', (9, [3, 4, 5]), False, False), 'FE1_C2': ('FE0_C0', (12, [6, 7, 8]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE1_C1_D10': ('FE0_C0_D01', (11, [3, 4]), False, False), 'FE1_C2_D10': ('FE0_C0_D01', (14, [6, 7]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE1_C2_D01': ('FE0_C0_D01', (13, [6, 8]), False, False), 'FE1_C1_D01': ('FE0_C0_D01', (10, [3, 5]), False, False), 'FE1_C0_D01': ('FE0_C0_D01', (7, [0, 2]), False, False), 'FE1_C0_D10': ('FE0_C0_D01', (8, [0, 1]), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}, MixedElement(*[VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667,  0.        ,  0.        ,  0.        ]]), 'FE1_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.66666667,  0.16666667,  0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.16666667,  0.16666667,  0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.16666667,  0.66666667,  0.16666667]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE0_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667,  0.        ,  0.        ,  0.        ]]), 'FE1_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.66666667,  0.16666667,  0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.16666667,  0.16666667,  0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.16666667,  0.66666667,  0.16666667]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE0_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C2': 'FE1_C2', 'FE0_C1_D10': 'FE0_C1_D10', 'FE1_C1_D10': 'FE1_C1_D10', 'FE1_C2_D10': 'FE1_C2_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE1_C2_D01': 'FE1_C2_D01', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE0_C0': array([[ 0.66666667,  0.16666667,  0.16666667],
+         [ 0.16666667,  0.16666667,  0.66666667],
+         [ 0.16666667,  0.66666667,  0.16666667]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE1_C0': ('FE0_C0', (6, [0, 1, 2]), False, False), 'FE1_C1': ('FE0_C0', (9, [3, 4, 5]), False, False), 'FE1_C2': ('FE0_C0', (12, [6, 7, 8]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE1_C1_D10': ('FE0_C0_D01', (11, [3, 4]), False, False), 'FE1_C2_D10': ('FE0_C0_D01', (14, [6, 7]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE1_C2_D01': ('FE0_C0_D01', (13, [6, 8]), False, False), 'FE1_C1_D01': ('FE0_C0_D01', (10, [3, 5]), False, False), 'FE1_C0_D01': ('FE0_C0_D01', (7, [0, 2]), False, False), 'FE1_C0_D10': ('FE0_C0_D01', (8, [0, 1]), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.236459 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.00423312 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.207484 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000589132 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Stokes.h.
+  
+Compiler stage 5 finished in 0.000930071 seconds.
+
+FFC finished in 0.508117 seconds.
diff --git a/demo/documented/stokes-stabilized/cpp/documentation.rst b/demo/documented/stokes-stabilized/cpp/documentation.rst
new file mode 100644
index 0000000..d2a8a2f
--- /dev/null
+++ b/demo/documented/stokes-stabilized/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the stokes stabilized demo from DOLFIN.
+
+.. _demo_pde_stokes-stabilized_cpp_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/stokes-stabilized/cpp/main.cpp b/demo/documented/stokes-stabilized/cpp/main.cpp
new file mode 100644
index 0000000..5b46231
--- /dev/null
+++ b/demo/documented/stokes-stabilized/cpp/main.cpp
@@ -0,0 +1,120 @@
+// Copyright (C) 2006-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-02-09
+// Last changed: 2013-03-21
+//
+// This demo solves the Stokes equations, using stabilized
+// first order elements for the velocity and pressure. The
+// sub domains for the different boundary conditions used
+// in this simulation are computed by the demo program in
+// src/demo/mesh/subdomains.
+
+#include <dolfin.h>
+#include "Stokes.h"
+
+using namespace dolfin;
+
+int main()
+{
+  // Function for no-slip boundary condition for velocity
+  class Noslip : public Expression
+  {
+  public:
+
+    Noslip() : Expression(2) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = 0.0;
+      values[1] = 0.0;
+    }
+
+  };
+
+  // Function for inflow boundary condition for velocity
+  class Inflow : public Expression
+  {
+  public:
+
+    Inflow() : Expression(2) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = -sin(x[1]*DOLFIN_PI);
+      values[1] = 0.0;
+    }
+
+  };
+
+  // Read mesh and sub domain markers
+  Mesh mesh("../dolfin_fine.xml.gz");
+  MeshFunction<std::size_t> sub_domains(mesh, "../dolfin_fine_subdomains.xml.gz");
+
+  // Create function space and subspaces
+  Stokes::FunctionSpace W(mesh);
+  SubSpace W0(W, 0);
+  SubSpace W1(W, 1);
+
+  // Create functions for boundary conditions
+  Noslip noslip;
+  Inflow inflow;
+  Constant zero(0.0);
+
+  // No-slip boundary condition for velocity
+  DirichletBC bc0(W0, noslip, sub_domains, 0);
+
+  // Inflow boundary condition for velocity
+  DirichletBC bc1(W0, inflow, sub_domains, 1);
+
+  // Boundary condition for pressure at outflow
+  DirichletBC bc2(W1, zero, sub_domains, 2);
+
+  // Collect boundary conditions
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bc0); bcs.push_back(&bc1); bcs.push_back(&bc2);
+
+  // Define variational problem
+  Constant f(0.0, 0.0);
+  Stokes::BilinearForm a(W, W);
+  Stokes::LinearForm L(W);
+  L.f = f;
+  Function w(W);
+  LinearVariationalProblem problem(a, L, w, bcs);
+
+  // Compute solution
+  LinearVariationalSolver solver(problem);
+  solver.parameters["linear_solver"] = "direct";
+  solver.solve();
+
+  // Extract subfunctions
+  Function u = w[0];
+  Function p = w[1];
+
+  // Save solution in VTK format
+  File ufile_pvd("velocity.pvd");
+  ufile_pvd << u;
+  File pfile_pvd("pressure.pvd");
+  pfile_pvd << p;
+
+  // Plot solution
+  plot(u);
+  plot(p);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/stokes-stabilized/cpp/plot.py b/demo/documented/stokes-stabilized/cpp/plot.py
new file mode 100644
index 0000000..c5efa01
--- /dev/null
+++ b/demo/documented/stokes-stabilized/cpp/plot.py
@@ -0,0 +1,9 @@
+from dolfin import *
+
+# Plot velocity
+u = Function("velocity.xml")
+plot(u)
+
+# Plot pressure
+p = Function("pressure.xml")
+plot(p)
diff --git a/demo/documented/stokes-stabilized/dolfin_fine.xml.gz b/demo/documented/stokes-stabilized/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-stabilized/dolfin_fine_subdomains.xml.gz b/demo/documented/stokes-stabilized/dolfin_fine_subdomains.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..2a350b80234ffa631d882d23022732043901d2f6
GIT binary patch
literal 42459
zcmeG_dt8)d)@2!968vc`KPy2iG_UNMn-^|r@@-+JpQU0VBdx7=F}x)r$fT6ky5CZ`
z%9<C{F1G0knT07ZBDG5P6SeKr#pLoSk*hewBrwh}^PTgY=b3rmmv`Qof%$&x=Z=5C
z>&)|<=RD^*_j8_?&~;sIVgKy!pP&85k(ZNZUrNhbJ^Hr%V(aeE$M&tgzsp_cf0ucG
z=eI_@oK?L0`K6ZogGc=K=#sEE|33EFE?@p-cJkc6eQanAw_nJ${d~x7TdOypiLup|
z>zmKj#@Mdc8?1Hqh5~y_PE0F&Zcd4@pU<^li)l65YmFI}WPR)982c`Rd9(fc+8Fy!
z&Gzf%_Qo8$CCFgEthXLFSapV00C1?PwLYe`MrS`)Wj~|0n2h%8rped!_VspSjKyeg
z*rm6WR@rUg`s?3@+FA`3SfeJ_){tUoZ8~JImFsQhTzk{e82hz?s@4mk_DgkkOR~WN
z2<7G4uQV=dy>_|4-Wp^!AGKOyYElgLQrJwh-fD`m)#$C~lMNXF(bj0uw|rY=uPN8J
zUeMX=4E6xKO@A%La2~#`8hWvIWNNFuOqW-7{DpG^8}sXXr=D$EQPK2P<ja-`iCNhN
z-+n&%ViJ7Q@L5sr=PU0IIv4%U+PwM;``N&^BGVVdJcS=E$URnirpe^|*dY1XB0hdO
zZA{GX%76T6<!fUyqcX>(eKOy8(zL$m4<W(PF)!wrcC#nLOF5=e`fNdt=^Q>~eDVqm
zG|`6(b4=Zv*@uhZ!w2v&I%Y|ZDS|y2mYy+9gr}HUTXY96n?FeVkF4&wx`RXRtE~Qc
zS;nQkbval2L=8{(^vO0dCCae0{KrK#riqfL2>k4)x~btCul8M$acSGB3r7Gjz{jVC
z?Y*`=bL73RVFnw==6e4W!`3Jtc_R1HRgSgIbim@+5`QwpA53{DeP}@L@vXXps^8jA
z!#DGOKG0zP;1G~P`IH8Pn)h={T}@s2(kw>1;An%^)0({Phf}6hPkaclTEsW+oN6C)
z{(|*%)O$zYC=VA;x}oO}B~N8ow50syMELomd>8r^W&t7Rs&kt7T6d5mw8l8=NbvBQ
zdvgHCP(h3*oB3Qgg~mI?G0i(z&Ng8WxoZBv63Guwe2QDk<p44+MFWZtuSjV5>U7be
zFhC2Rt(&fz2>+VePRkG7k{CW(|Dk{rJhAy|2!J4lXnvLL-nbAbnCGCJ&H=tyfIPj@
zaRQdHirL6GmmLHPE{qE>;&};p_MaOq?At0kuuzrQ`=#1uA|W1s!IuuEFmf~;)9@7d
zP&j+>wG&dtrQ({RMavgit*2*aY|TA5XKl*S@~rc<!G%$_Zvsy=*jmDuud;6HyQSvt
zMqS;g@Utc6ul`w7lw0%b#(B#Yt_d#Fmu$XRex>?OW43*DPFe0hO8O)Yw0AbHkNGsy
zWG*)jH&k!Hk<l@$b94>U%@0S6E)9$uAA8T>yZ&=k-}nFUwRzx{;I4mp{E679gHKO=
z=g(j7e)sEHzgRY9#o)ZvgOiOt&W?NH<Hw(l-8p#bwA2mLQq#631%&Ns{CH2}fA?87
zrDAZe8SfnY{l#h9^A@i<9G8D|t1fJM<-YvPo-?~PwY1*3X~Ud=I#br8;ZvUN3dr_-
z{cK!*=EGO|{XBhj-!0|(^`=f`Fk;^5pz*JUoh|9p?YBJ>X<QSI+Y-><(Cf;gd0p}o
zwjb^VTP%<5e*}J8p9`o;k2QDdyAhxVN3;MYJ)a#~5@-)R5;*>kVP|W`mIjW0hyVT)
z0$$ehAbj6^$CZBX&s-gK_0B~b=VV0~zW%iE`J{mUCwpD_$<n9Su#&(N3qxLyn+PkX
zM|ar)z~`MEH~+KSBSss}mRyeb#j>6&V9Xf+mW^ZcGp8&dWEW1%KRT-O>0u=yDH(Ss
zr>1P(QHj{rjq7p%CYPr6yk|I!Z%DXn1pW?R)=>ZIM#F)A`o*_Khra%2TrV>Cjcxe*
zO1}qZ17&Kyc<34Yt-DfvsOoaRD@cUL4<&4`C$Ps35!i0wgz_<*x+P$TiN1ckh)^y7
z6yHwkx~yepKtz|Xa^|eH0O~u#0n0U40OPIwt&3MR($xMoPS)1%U$gO#ZtV?wi0E?n
zpXq?Q3}AG8_LpqyZ)eih?|+i8f9Od(`{$D?XV3fb2x1pF{vMoAx%suRFvPU3Z+i2m
zft`MZbg=as`5bHxDBl~GD39H77yKToe`mVw!M|E3J-d8(w<28h?6}AOc6-|Q=4m5;
zIA1>YqrVZ@(Fk_iy73YC`$Xp3S%k=HMC3}p33D0b9S;!lgEkTJlVI>nTeQX8_s*vL
zC4dh+fJoTQ)pxHL0XWsAG<1uCv2~`1<!@|5P}VP&{aA)8>Rw)pADGO>b%{F$0@(D7
zfV`9IVby3u<_sDWIDYbgvlmX}tr(F!^Xxe3XUz})%rU~LKu%l*cE-l!#sm>a{&}6L
zJeEL%q`;y_x9%9YgwO$zK{)05XpSHMASr<1qyP-m2ZWIA+3xZ)0pF$rrrq1VIkcpk
z2107{kW4mCCI*Pfu_|^RAp;`D2rS#cqPiJTn+k@q&!TK;eZ9t!2*y;)TomxAO+y%r
znn)SN)i)?6qZASw5wV-+?q!67GsFk6alQ(2uqyG>dedMNotYR_hlif_eV-L0q+BCE
zq&7=v;Sbv8yY;EZLFXa&o$DcGE$xkR+Sf#_AU@O&Uy%trU%NFkDn0r8?TpK9k<0Nj
z6qUkp$W3NzU?qK(5s=Jw2m&yQ092LSOC&Q^_aK2P7hlB$v001e{a8kjJ>b<gWDqoD
z@{<+u*yJDX@Orm07+eNXyG;IJSa-QxdPF=KI7A6Gz{&MrFj~nZPkT2GZ6I3}bo91w
zh?Fv+bH{tCf)D)riWmH=0z+(pX(YxLXvAG>HrZa#RJL6{>Z<kQfu@abFiqE<ZM8&P
zl0fYsW?WXwjn#dDe?yi9GWAZDAy8NbZV37o;$edu7FcX<HM{y2q(ztuqY_UBNS%Up
zrn-^{4a(+%tV*UcRi`yx`y{|=aM~p%S8O}NKxt3b-~guPQkZUV0i#^Hvbqd#zG*rD
z{CibG!ZyspG%NEt@LaTHuY=^0?U-paMn3dMqb#eXwnL^JG`A-cEjn4*sdzM5K@ulw
z9Z<I5=Y#^)rT&s3Gf3$B0HN=16Asj^TufSC<7OlMQHPjB*2=#n-e;#lfV`nsv_6DD
z%TAiHNr)Dkc&_A8nV8r%)P>Xw`Do`Jg-g<g<06>}?!d9qREU25SypHXyjw-pU`W+e
z`5IHqrLU@DBKKsOv}0JY?Hl3-g}(QmpKrJW0K<Tc8g=D9764>|D^8!VAZ>GbMYM2@
zV!VG4M*?n*jDEoA)^>6slLo@c2fU(0%mbcKSI0LjS{NHa)<Y663B9aPt#Zy+>=H$Q
z!Zs7rcV6fT^=N`g7HZ-4V59K6m`rsPEz}Jk_G#=2x;`i(AgyJro<*7v8)W$AA+@15
zI$)?v2CC?$c2E?JVS3wmxIGlT@zKJJk@0~J#vmBSm?=v4UUe(vMMC`(Dp7zs+bhIM
z>Ig=Y!zy?A&=t3=l<7_nR1_1gTs7g+in<k2h4HZ!T|Wq((J0Je5i|S5@l`t?Bu-Me
zmMiUf1jP=vgMKPMU*^}e8!c2LKOA~dCm}vlPo3Kx)yo*7?LH}!+D_j|Wv}h#Wu`)c
zeW=+wDC<02@(o(x6OC%)CE+K`UFygK#Rp88u;5$f`nOw^6Gq;|9;#}^j~3?p-NoKQ
z)!)q20zW7*W89Pvt4sg8b9hBvL4I|t#d?qJa9tgH>IYB3pWtT$;ORH)X(&9Uu%{95
zw2M8BhNm;^DH@&v_Th{P@H7gZW=-$4_~Fh$6+O3@S3Murf6UVjJBJPF`rW40!3$<S
z(WU&Z!uiMJ#;1MA1~xtnSnSK5vVG9<QyVwD-epqBy3hAKxO9HE#QiWe_UVT0J%07>
z>VO5uPFWA{%kKF;4I4ni=Dxs&?Rb(_SoAJi;m2=jg`Kp*;9s*9dVV};`N=iUOe)EI
z<jWT`=FEKJ*mpGS6B@RYhMoK?t+13<`1?zQ$Q)Xs$7Z&|v9otY&VTIKht=cmo%%>j
z{+<WFe3=lLN5h_=VINh{3TJ7BibohCZx_%CM`(o!uXGF9-+u{ibjRk<`02f-jv|U2
zqG8oEY-BPal13}k(h6@@(F%52q1R}ndI@gy&J#gHhji_~h2cBDhK2?1Vl@B#Xrjnh
zw8HSGO6<R}oS6k{pN4N{!14W)k2r>)COic+o3NPC>>>dgM1Y<f!vLK;PJre<#SZV8
zC4}l0LbaZ7I97)=dvq7jtk+ni*@UG;v-fD&psftmk1o*)Q)q>E#}duHqZRhi3SYj8
zG|NMpt=ft->lHyX`v(m>NyGLpBSZ>lg|BFZH?PtPDYU}rh|ZyBiXTrKSbd@5*6@n_
zZ1yAg1>^07^Go9r-!JOju(QXI)OVVmI=t?YJr`puB0L$eFZ*<5*X1WSHl3ge^nc*+
zKOvmY_q@M9r4w@a2MB)HkU{lZUqj(ws~(Sw18hKwrn0sCp!~G@zhH*^>>0pr=?M|l
zvG-0Nfj=4tGd7Gb+s!DR6qbifd}_^xLdKA82N1^wRh+K;LWP6d!TkR^P(Ac-n28!{
zLg_7D^V|sbG>M?MgG^{Zg}U*Ba;H!8vqvfUegNnD&7AL(1>Zk`iWvA_dw_)R*#x=f
zZpVQ#{<^tA<yAx&Dv!v_;_*rMs~N)DN-e7yumBD-a=zh3W8oPZR~q!Fni&nB-q>11
zmNsX%s>Kxxm43GojCAJb`%_+Fe4w>_@PaWDRdwCKy)^ezwDckSb)ThFzC?z-W&rag
zls>@Z1o8!huIP>089Zh2dnS1Ui#MVNk=eAn>BPC+!x-P16Qqv9sf<sujd>jUUd3<j
zaV%bcOzLBR|1(kH|D>?R4e@2o<Pk00ScpSV7KXD$M^CI|`1Y8bU?gez^x|yp8_{Ii
z?YLPL5z_z1-g_cj_J1KPjupiBr88-%`rsj{sogp4UPLU$S*E4c)fdt3TM{@%YKmHD
zMx_ka4wZOZk@F{})zPl_VOqY5ORVC|`Nb1+HN3Rifp5utxrOV|lWeo;Stpo+c7=xE
zAu)<Ejc^aQw|-n?3Q=XkhTEnvk~b7{+RNl=-RE04=7Oi#p-YhCJSArFWo5*{SdAE5
zAV)6jBhPfcisz0lE}c7ZW*gsDws!2S=p5G`a6tWx`mN3RL{QGUA;kuE&cFrcM9wSC
z3a%Dho{>##T|3|%h9rtGm%UQj<ADMavT3)HaMj6<rD@%UbW7}fx!lQjzotAa6t>-R
zVA<iLc}<To>VsxEZ+tL_O#`Ow&*dYUg$}LHg;l*&8g~Z-6Px=f#>AJcWd^4vVlRCI
z@|I$_l}%))&Nm!1>Ma^K)ciIJL$)v^z%wIkFmh&8#SPfkPoThI6z9xWdNIj}OmJ$-
zwX(otZSI3if>CiKkrY{n3}UKSXv&;4PI?FqnX=(W5VF@v;zWeshFt(?vi=tGAER^9
zQ92yXY~z=5Z>25UHwA2GJD1_>Qs-&}SB$j^V)*fMGqYUB4@;pz*EDnbstVoCVYy7@
zGc6P~RLx{Lb|@rE3o|+vP(j2v-l#DJS?HXZEsW~K)U{Bq3Ov$}$_T&a<HN+sjRW3n
zOK!BVk&KsBt!AuJx2Y-}G#t1_=$SwaDDK1`R$}Ho7fA||!eV%^Z6->@mpSBx(96$8
z*>g@MH9*Fd3%HO3t|7dMuv@0Z0fOjyk(6nJ0BI&<Hp;kmXOH@=g!OTzT!SjW(GgPR
zP^GfS-V>D3L~*;vIc}})1FbVrUqKuV<5`)u^@dP#ghTeDO5F}hn(tfcS-7&lYK$vX
z2ihl2S`D$$&X#Z#nVXaruTBh^-PX*(AWx8`BTm)A-i_!3lOwqn)kC@`zKs2tOok&a
zgOud-#;2K8$<NLe%+7Q><eqjh;p8A7DP>kVF*H*l?4IvaoEF-2TB`#)rK!jlv_auU
zcykyZbxW5x*Gx1Wb}o&1T5ia#z+d=T3<oDTho2<Z<)ykLo0_wNxd9bQqqh-F?u8tV
z*ty(+66!_O+d>(j<9A_#)K^fWty{FzCbjY6NMnE{kRFKO7l%SfA1>iYA<xPq0>z&V
zUd++YZcE&s6vloSgyIk5fq1xZrY3S(&<R<<shEe&;j%ze$ugm(O7~sZY-VeTb5gL9
z=Vlreq=`1>`6S`|%k>hAREQ)#5pp78yLTp#L?NdW6RhqzPbu^`GCrNPPZ+=0dmE{y
zE`7pS-~qwr<Q@<v8jza{1UEDN0h%2s%8Wy@Fb*R6Mi5w~sA2*^L_!fS*3vwl9|zm1
zmg}fS9>p1QfoJ-aZO}I&L?rQv2oVu|B0_X>J`o{0YoCaalsnXQx%!zYG`de1Yh^}Q
zo?&~@(+x@WtAp!JLuNMYgpc&qK74}ea{X2)63;hck@#dKRRNoL6)=VBjDP`_p<y8I
zeZG;ZfN8r}Nwk6rh&c7+8km^*$o>>8c)A`2M(=fZD?q^$;E%hvA_5DZ`@KX&zCy_U
z9k7G#J?dG(Q-ZI280usksJT^pXuZxj2lj>t)&+R56Ex=I+tP}!jnsmQ?2aPSZCb;C
z6WtR5sRdQ+la<&z;C3g-u&&P=sdWRgMS6nee$ek(F9l$U8B#--_o>=&kR?aJOyHLo
z9<1Y5A)Gruh3W%zdoEf+Ut@)9QfbbzGbB}I85fUK-sp)`^>#W{3BEI<eo$b(Jvat5
z#5V-3YFA2&m*}4b%kq4l`xcJ89k4joR^|L}h?~uwpVST9E21P7)u~xChV}rmoQUBJ
z5k9ys;d*`uzH_X2g~#*QP2F@e*6?HX|MCQ(lW4sx_yy&iSMbX{b6FTLi97eBxYu9F
z<6<@k;{^2qPDTAaO_*0km27pl6s%2w;Z{jvMV*ouw=O|s)w$5=Kq{(8YDqhc5VcV9
z!s+#c@;t$MqtPlU3~R+$JOgGXmY3IzOXGM|c}QvwHv-xND70j($|iUeYC?I}wt`ob
zYhRS{o-@@;>v~|R9cE3n*n%MxE0lt(td>l4QBzT~s(w(OTh1GeR%<q}(x<e=G>9vC
zR_?`Yz9@%@Vwal%PG6rUc*Lq&=@Sea{Gi;mkNL^YqEdC&LZ(YGO&O}x_wH)FaTy}W
z6=HxO+SYs_r|zqIIh5Xg$o3sB5fWw5bdv&5(A0Y|$B2lC=o1q}`pOHtrS3nnOtbgN
z2{i@AGR;hTdSw1p?KDS{6>B=oSn*|(LAlFXtK~&q=!${vM}F5JS1`Dvwy9r#m~{;C
znlSh)#RlrbgI=S*f=2;eO&|bT#WomN#Hqm>fRyz(_bohXPRKg!G0LOUZ_^dTyMuye
z0LMWm1-3qXM(j*|amrHQMp>6+;{MvVsPkOZL`A)pDyN>7rA3`p(at7-v0X`uzr3OW
zf!H}c^~+(;mS#UmW8V8TOEjtRHYjl>*sNybj-|rERFAb19j$A87RoG9Fgdvwa}->t
zfn+1e(6$2<(24#!QHqtfHaSTsNDbS*HjJ8>M6;LZ2NRtw>ZfsvAD#pxZ>p3pDaM_0
z1I}3%j?P$5Ra|Hl)sbur+{+)RcD(M9En%)|#&H?cv@PaJN@SjAG1oX2bUb{@OU_(9
zOPVr|e<#<gF62#~^*cV<Wm}$*6~V_mZjd$a1TRSaA9-?1^a-=*5ZQ+)<`6N>=tCwO
z3KnHWAVxZni|}OLA(+5#D=B|#_BbIZ-jG>T(o8jR<v!%u1nfz)Z}<~KUeH;PPAD{L
zsP=iUkGwcuwTNXU+hJf(K;*C#EwQR<RxBjsG%3u0DL-f&%F@**Q|M5~tH5hM<ppFA
z<}}e(L}MPCR*jk@yrN;iF&9N<XtH6=WiYOaq)mY1K3<P`Wdw|?AP`Fz11BdiBzF#D
zJ7nDov^sZMK&)t{TwpwDK66`5=G$<X7-e&*l>eFa1P2SMENcElc!i>uS!h7D!4kyM
z(|*Hft?i;|o&L#;?<!M+T&Q~K4n*q(?+;nKNG1D$E~M<>TsS_3U8&$CcE=@9-VDn6
zk(*fiy@SN+`*cApnKolOrK2hAmBoV>S~^38FX*M<^p+RxhwEmrYshhM4cV7ZGaH+_
z-}E)f8?{u8m0(trXZM-i7VkBS;n*PH<B~Vt>j78MbqQLt4v&^rt>qwc<bBvM;n7^>
zj+4T$TrA14Zebr_1nr`JOf#GVEY_;q&8v889@U<mPSkK_BD~SxU@oX)m}}qM5Beb3
zg(!!^yhQaflt+m^S>rV-JF1s+tJVGh_1_3o%}U;6&~Bo!)H|J_!a)`0#Jh4uhtH61
zElc=+&qXim$j}l)uC=%b&0T)rFbYq-Ar|;%vbz>eN#Yj-HLSWT??h&I(UjiYpx9l<
zyya?*y%-)OQy^6+A`wp_5U6aby7OATnR)>Sm4)|Qp{hT90xBsiS+4#?(HL*31*Cgf
zS?1+xNpehH5w00ZrD+kZcp(`W7Ew7{#?I==LTyR7`9ZZaEKrb*Czas!3~I8Z%9A|4
zPymv2_})mMpsxt8@jCm8ye=n0i-o-2OraPOE=4N~=eZL1gVLfECQdK&bmUrgy&cO0
z-?uwbl*OXXd)~NA(~LnKJ5eV%<vRdC)z%y7POTS0<&rZL$p}py3nGBk3#kaSx4xX8
z9V8(TVkiB-n<Ri1lK)1aN-dm->`e+}=(Jxbpr9+5HhL9B2*q8BnnwG4Y#){=ZzNFs
z0<rXNC2?%2yP`6veHV3UMqnoC{t~gvY^ltF!+3;L4wMV@MQ@NMSj_8yn*M}J;eiUB
zRFKswQn0e5<zCgd1;~U1l~1S#ISkFk$ldi#t=NYgMpuSqq3<q!g@D~Uc3v5#0yXwj
zySa5N*{N2wS;hgHE<BSZmD{tLlSHMbt#Z6E?kTt7uv`x~Og2feGahR)S!%cQBeTJ*
z-NJ3pucEBr+U+-Yu$NI1QEIj^c*I!oW#Qnd$l5JDyf+M8cZw^=ynIZh5?0%3_bp(X
zKJJUn)4K2L)cr`-+~>FH8)n~k_V?po=y4@OpY>m*j~c&D-gsrwqi?VOYTN6wTa}mx
z@Zq&WKPcxLXSCSqCMG+0Mwk?;lf2+Gl==3c|M?XIvv|QNl`x@mPkR7S5;HHJ)I2@N
z=l{z<)!Xy44b~a_Eg^b&k<{UTM|+{sXUX2jCJO<X&(QvohctHfgYv+Fu4}rsq0rt5
z>W2C~v*F_L%CPQ<`}6WH1{W7+!z+W&%xLVc)0M%!<jX_MZ{+38Ex`%aBWGCs_<CGM
z&1H69d1aWP;o63w%TK{HUCZ^jUlh)VY2oP%99>hzyQbmr%4J`bDB*sB>kGGFKE1g~
z3$L>CRfV$HhZmXs<nrK*o%g;wPA>i4mDnwq>$rGa8b^7BH5($i9Y_`J*Wxw;#a{7c
zq8(cV%F<*I230=H1o$x2?r<xwGd%NMgYgpIwLOpVyr)rShZK%JMhEwKVc|4tx)`$r
zN)m_ak&Q>;o=?~+DQq%eV_hP7<Cf^f7QrzNz*u-2qX5VP3%Q{7#o{GMsj^@Pl0=da
zn8mTa3xbyTE;JkCyMS?v?^xm~-?0Q8n=HCj4^$QTBn8i*zwg6DgoHO-q$|`5$nuPs
zPuPlI6t+uW?XLX>Yv6J10nT{%Mk@IEvGP^}VMgO7Jwaam)$i?#f3Twu`>P$ET_SE%
z^%Zqv>LKe`2~wt~{Gc?O-Tk!k+Dh_!!!eTg>av^0_`+S`x(k<`>K^<mvg-llD54+7
zi;mK)gTit2$ng3>d655-r2PG4cUNiz9!7^*8pzVCS3w+vvo5@R;oZ9#;Oz9F3Ep4A
zP{;yCFMd#N-yY+*ujZ$fJ6e^-6=S$xE_rjVj)$!L!sPTuQO=?pXGvjh29U+YP>3eT
zEU<#1J&NT0pfqwLDiNrk?Cz>_NnusM<g(&bGEdmhOK(Bvi}&b)%4KiIbu++OyrKzO
zWkGp-?jp3u;*}qi=dVuj)5;yKr~oTVTV{z~9<KAPB31tYyU7|~=4OC1l}!^oDW7RI
z_Oo1-AC%*-@AzreQD(p@Y)fajYio}`1b<LiQD^l@*_JA9_>y5A{N31&y++x2H#OLY
zuTX}LNngG8I2~Tr;Hx)S`^n|O89Q%Lcbr`I1PhiNrJ0>}7HLJ5*O}P4kqUIq5X4{i
z^(ecBIsBWn?n^aTnXli@B5iz`w6=%-`3+Q{b9Pnx>%Q)i9?rbnO<MPjXD@5EeIa=%
zuKH`9#bsPx-o@7|s$b`ou$L$AZ+4%sV3+*;pj-t1^18mCR-VL_O<B_$n+=w8xwfBj
zVyt#^sIBE(p22o0%WgSSWwYfS*Xvr%cAL%kUX}f-KEraYT;H0}+WQ|%FP^gn1l{t#
D$Qv7;

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-stabilized/plot_p.png b/demo/documented/stokes-stabilized/plot_p.png
new file mode 100644
index 0000000000000000000000000000000000000000..0a5ad4e46ae55f45364c3432eb05981918708fa5
GIT binary patch
literal 49829
zcmeFY<8xi#8#f%|#I|)}tMQ3_PHfw5n>4m<pV(#_yRn@#O&hBX8$S8|=DGid`^~*x
z?Af#S%${}eb7@6`)#Nb%qyQKg7z{-P84Va1I6W8`*d!FV_njBr=vf#TY8XWsDXmX=
zXFZ=A>E-?TeFOBjKW57=D3DHAq(V^WKf}jL2DFzY4+J-<iXy86B?0iGYXMXOu~A$R
zC^XoUOmI$IKqoFUwEf1W0fkx~^Xq72UOGZ$y;_4gxQ)5`^+S$r?aw<@U0OCe+Pl3U
zGekT^u%@-WwQY2CwABkf^f72E(9-?4EH#RCzQU9IZ`DMrg#GUYFaH0%ko;d_!j8j7
z>UX*9yP3JT)a;scTs&)^DUK#b{7)i|fQYMu!*+&EN~XMrjQ1@X9vmAhEAsR!`ol64
z&?gcSOOQgn4;9b*+Q3QK8lVv!IO}Ft5BTeiywefKA6kpT%fq8Xg<N=LK!e=X6W12}
zzyC&JsSZxwO~q-;GY-bZ#f2s^(CO&Fs$tI5`Kt3Ia9Pn#jgRXIC&&ys$_m8Tc+ugR
z%gK!{WaaJxD#{KH+5udGeHa`IGtE;tWS@u{i;nlVwpQ|_lJ}CMx#;LhMgycjU2jgc
z&$*Ng_*lHEf4v;nHo_pB8dpeq|89xfv<u!I)WLotY9B}`ENe?ze)bvkadM+U2%*b#
zJ_(@cD$Q^DFfNmo+?3JeYEBm9k7fvaX1aD@uMRTTb&V|>2%6GpBO+JroV!S-i$*hE
z#Usqi-OW%fA)(BEr*{SJj?IPF@^vTN`H2wYpL6JMVbb>NFO0A~{FTZua=)0ULkI2l
z2VrW4!s%p9RzgThl5I04#)Wbk{mjIC{0KYFNu2ON<Y=VHObM-dOC{S_W8nojLn-ZU
zMMW0y_Jbw8U#=Z{uIDh=x4(>z{;4Fo=s!ElsQ5Ku%|qV&&N(4alV_)Dka4K<*T_v+
zlqTEGY3!6Fn?#v2L<AMEBY)L>3U<TQmR#kv5j!{ML@~!%bJRwAF4A&nJ=z$ipZ$XQ
zgIM2_E&cyE@cq-bElkNEiXmr_$W53tQWv60Pkg4oS~b{zMMnw6OTc!*%;s%Pom}n7
z8V<8Rg?0u)hr*HjP3jD|TFm6|{^JKG6=hXB+Lc|`%O8)g#D7`qJ})-soA;LH>@%%N
z^Gh()i%&YhnTOVV_(ko&=<HUELhNbo`84NVyhfOzYi)%XICmIkWkvn21EVy9p^v^W
zSh}kcM$WoHL5UfwtQxQfuG4|Z)v;q9IH=zq;?NR7W*ui~p|B8Hqa!SugON^-pMRss
z$eWnXZA-$fi>i`e!s9tIl5zg`!{DF2C#NtMoDG3R-6qVUA*bn!J~Y?NOHTXi(+@v2
zbd82+<lR4G1Z&Q1ut;CqSe-aUb#VaBz}^T5I>tWk=G(Tdt=J|YEz0@%-^D|kYaTIc
z+F5x(b&k~k>7pgcgW@d)%zc_^U&Uht++|H~Jq#iX7#6XTg$1e$CTNqN4o((Zyh?%z
zL(-Cr_eNj}{aZ=Wx~RXlra-4(nvw2w;o90xPn1ByJd{DniKi_4y%k|Rj>0IFd+$H-
z%qMI{?&4m}{LPi9@2$eWtnW2nn^`RQM;3BGH%Gu%giohzGfnlAm<6CLl{>+^WP7E-
zv=ojJQ0*T^fwbTQP=T`zi8at5qO4XR`N$Est${{iLpY@e_)lywKQczhWIk>F=yRod
z?Fi{@dCb5igrb>48e!6dV6qdc<0J}}s{z1y);UcGhU2feV+`1#HuRq}94C_tmp;jP
z7#}HKW*%Lsk*Ap#`?G`4l1HPIBzNn_lnrFCs5K5G*I0e+kASI6nG;v<v~asWyuP|h
zUxjv&xte?{KDurnz=*g`Ys4n}?$nQ2?7b3#@*^x6yVP?tyQIMHdED^`jMD>$B5w=J
zj9tD(DDRB~ZE8>Bp_ZL=cm*HP-SB0AAyC!a3baXi?@Y#W0uOU)C#-revh9tnEuFlp
zj8NafxDtYQLRWZPHeM)jzSv%>?rwfe#eI3{a%Gj(wkzW+BB*&q_d}fbRH37ZmBN>S
z#m2=a@`KXjM_|a>`K+8&RZGSPNI_sUVxdwFn=<~?Y1ZZwN%(l0wueX?3iW%@al_WE
zi9RLiXq!ekkW?X{+HhQ4IxU|0=*B?D$5)t;xAm8v+`BKjt*<i$mr)B5cWF=!17;e9
zk^{bCNen<`_Nykg0xXbq8)g<Oqt;-$G>T;YD>|$lfDg?bmJ<#<T=vA!RAiRVzh_-6
zb4IHGa!qnGluWq*+cC?6KH1T9MRf6RlYC#S?Dt@Ut_No}oxC&JUF&BbRhKq`plHB#
zeBv%!_-moD1h#e+NV!-WQWXLPh6hoH<1hRz{8z0E#1Tn?ua(hME}r-72G=s+M+mWB
zqf#)(NXo!yM8-4{hIoleMKPxDgBXBX&V{uvffk2+Ew+{SL-&ii$!kxm-}Pu(7_5$k
zdyLT{g1MZqt@a&jOs~fcLZKMK72-qhj(s#a!ByOiDQwsG=<Y4xL7tX0y!TI&p^Uw@
zR>a-=v$N@&8aVPM4H#8lNkIWZIf(%<)?wB54;DljRJKi6Vk1VhIOBqY8)jYzBmt5l
zzV6oB<-|{AkR-Wddkwy{C3cz&ozV;+MvOzm6m<f>s*!(&HpR!M-ZrpJ4bHN+%GN)T
zCJPSHpA$Tmpm%)OM;R2nctJ(j?R*>C{qln&ig3hL>{BGZL0UwbhL(~&GmADC4}Nz)
zA)t)=I;L1!E1g>~B?NFa&pOd*D&;tiPaVw8L%v_u?$f<N`+X{wan6RHNW{{+6yJE`
z8%z#01O>RlLP{*Vc{GQ#B1DS0REn_ba9`>~r0YdyY_pIC-j?-=n)%W0HS#rrfKI|z
zZZtXM9W!e}8+QFA`WtpVcULdJ63vDDCA)ta_9$5RDG^Q_SOAPtpkPqM#-G$Km7Ft^
zlGdk3S;m6^a+cDW9rcnB_`&_8YKR6>_D3<*$o(X;@C0^}6?bs$ymuO`iwZOfI4OK4
z5|iInR;u`mz(vdQdW*Q0?b58dVV`kSKd)x-@YSxBO*lBj@iTnMBvs|_;<7(cDCrmN
zQi+gy2XN_x(@S6M!G^bo;L|`43H(0y`xo#Aia3xRS`38JeDB;3gNwmfq?bV!Mo)<$
z@cmrARh*Rhjcn#fO4Aq?Q6@SZt}PpDT1n7Yid8EI$VM@kQhquFj1n?G*@^^#@n|jn
zGD^zFkQx+~?q!EYmnyC^ewV@@QwUC+<8^M)RSl%UxzbO?(S7&(KL+XIUU_&l-XjPh
zyUy2yNSd{P!y%ZyfK_Rj`o7Z&umL{J=r{W;&Lj!K2xuA*mPHT4Ixc=C`;dm#*|Lt8
z$oKDcbbwrD_Ag|LY|&yTyGmg2-HLKCBQ?F3EPDc4e1i&z$ZRRpsskUJp;DpqVL|dA
zx0&<OFRM(|>Sz{^ImHw^qGmlHKx8UQO72T7CtitNH)RhimB6Mw^X+#3-_Lw>mg(<m
zX1Tr=@Kj>6|0qJa9xz4+)6jQq&YcXj5Q@IlrKZ5a%S;aY%KV+41Dn20aX<E_Cd?Aj
zLL(%FW8N5rw<}u{Ob_F{E<l?Ef&oRdAf!u@(Xbfgwo1$se2?iVC?4vz8Ez@YCcvJP
zG-oRdmrP9;k~&tc$hcORw<_MSS@gLFW>;W1DGjB~f^<#YfMpAnlCi4G-?WzeQL37l
zUlUZG4pIJ#C(z%+y|}?UDlwZ^m%bNn-UyezeTcL-_LvXFXs4vW!>9O-a(g+GDmoU>
zN+~ea9IRijXr=c7hD@aTftbKC@P<vHC<JBCZn<DPY|0K+5oZ}stCUcWmE}d>o57&c
zS2-IkR8moWOi5q86fY32&!oPK3%YQmD81}0TO=dczvhpph%RrMTzXAb1#l8=?EF_B
z8$Z0ObmZE`U|C?qIP?zUNH9))-pE1D9b&yN@`>=+-1v4{`FLC<LYzSqs&)N1iV+KQ
zePiA9*l~|=4k)q%2PAxuPc-_o*Pxum^?@Dv>L?UGNERd)3Iozo<-dh0h%qC~4Jv77
z2a$rJC#o8Qi<-RoxO{w#iEZ&fT2jnmIk@u)bGaZz44~rpEHe+5dx6>t{%>y+RafUf
z{N}lPfw?xb-Qi)Rp-5PX4=ovc%LkKj{D~@Iso~BYXJKYf>>|`_0X1)ij_Li4BwDGX
z{el-L<3C(KCJ*DiyWSCuNDRlysKpR$JQRlzaGVUTuVs~8UF=mHEq1DlI^LB1!g)_%
z6HrFwdq}@9fwWE&+dMjX{6$Pq98gInE^w)ph+PHi$pZW&glB7*%fsuiAz*JIlIwVd
zB))RB4O^V$=+e3H)4GiJtQ(Ir9NvtR<bE|B$K1xo#@&71snC6tq+{F1ux0A?<!SeE
zrQ`K5@b$3ge&^|0;_bTc?WynWM7PhN%8G<w%X3!j(*M%0@A)_9?#Eq!O-;>;!hlCa
zBBQJB)gG6j2#m;Q9v%3>=k7Mbrt^$^nD*V~MVDCO=|kaBJG!O7y>zNDxXZngP527T
z^M~{A!!{a*va#6TUG4f0WY^3fsC0HAVoGRyF-mC>T2LizJ7yMU7DzfURjT1M9u&JK
zgI3l$(F<l-D*<Yt)`0A_k3ibh6=>R3Axd86<tBJ_fID9;P}$kprcz~PY)Cj56|E7d
zhwpRC&_Wz;m{?_!q8Q?x1CZ*83>ebkvoUCjy$4Ckq8N+Z0r8I}nghfmo*~zjevFLy
z^F%ef&T(w_?Y54wn7e|YDk5-|`SVp90)&pj6bHw=V((k94!~#~`*$v>@yk>Nmd?T>
zPPA^%iMF*qT<1x3jX|`VyZfK@*?>E&fUD4!S@EaVMYX2`!M=Zsg|9auXdIo7Cp8S6
zw{L%_-rV=Xi8$EU@_aVzXMI;%e9qR~hcE=sw!hvlX{z^Jbf2n8yxa`=YDXgK<4}&c
zZAH9m)mp%*8l71CZa3Ohi3)WI{WeZXhKuF5ghXy0{>ZhP%3Z(+Veyw4%JWaok)DF%
zU&V8Zh#l4Ws-uh3)fJjhqm)i2TlOXD?3bFt1g)C|#=3+wS~M-#6+V#J=ZjOFXbV&@
zhu@;`sQKOd&RXft{a&x2ZRBpr2_&8gaB@-pfLyh@rii84Z1IG%)FjWY?x7f0av`VC
zPta(#u<>h6SK@gOD>uHTzPq}uA6fh=nCkfl^4nA3+odvRkCx2c<?fqb-@RYqzbV`L
zu7eyj&Tn&RpP&DXarQp^tge1NE_^+<=Jd;^8Q*jJG{KPhyuJIfeffHEx%1_E`X%7)
z%4ptPnsKm%xX*tCgGNw~jNB|<zjzZ!9YU(AkyfgrP!avnZrCs2zAHpSWx8&Z^9WO<
z*#10X=Yzv}V5R0(6|AFAYpVmC?I3V!KGeOxQSL44=F8V})p+*F?oDx=9fFgE!#!ML
z2wv_X=VZ7_{^#0UPt#3i?(Uj$CCPx0ge#IjvXDYq%Y%yp=A+j|qqvX1{EbO}*5Cgq
zj@9&UbqR_7Ue)(5VD%5jrGmYG;v;re8cg3VKK4E3dCvTMK9snOzUq0mq@5nWhR&Zc
znePVGYtgs+HWw*=^RS=zpUpj0h~HLa_TH4$c)~`aSJ?~g0|!6bQc!(SR?&rBs2Uul
zu4ddEAt#aD6I3TPT-iXkm8z(#KvR3hF^3i*>^nQ31K!Atw8d`YlwGd0jzV3w`dv|$
z&T!lxTXf=G3}Z3Xh(;S9)!p#bzQHke0)3;eOvB?Sr9DEup536E)*B6+wXe$enYY_2
zE_(90mNbvI!<_Q0AnHpj009zKUrRrI=&u4Xzjmi}+>@@BnGb0F>>XP_@4wvEm?B=q
z=zfE)4;H?x7s7VlZ8&0i>tabX(;DF^5QGvTsj7iwcqi=8U9D@;;`n{(M=O2a)cs7I
zKk_>dD<}v8XaSWcI_XPLY?lKrL4mI%^&^Bns}{4hwI(v>UL}`7^MNM1v4zjFc^pp1
z-xd{vTdQ4Rr(4~yPZ9Zi)N@5}j6SpfqX!4qroIl3a*RZWRwc;X^phAONW)99!G^K|
z1Vok!>NY%D{Q}y!2Ojcm^@$7j7{^pL!lIs!<Rz4RNCBdIVR+94PZwV=*DMqL2k{E#
zoCZE2Q+>G_kY1l&meL86=LX3tyxF2ch--!#-DHC4G~gZQ!>!KbS#KkXiHrrrg<fN4
zev&_Ekb&xOQyMGObh>jA#1?pk0{AMLzjNBfb8&otnUN>fN?@9=FEd|zvI=DX@PdKM
zYE=6LM<lS?-6{t|;T)^Y&w%>a#!LB`vg1?O>cWJ-a*l()Xz>H@su`X3;@|1+$)EfQ
z58hs8iUe!gla?t&mfeR1esSYZ`x38~eb)oXR9mg~nvS1`G84rgkM@pt_GJD$dwZVu
z^H;abb(c7rfyuzBkdRMd@|K-SeeIZ8)1(J+{Ak1catUrXI2CSQ<31~`(76}^c^6QW
zEz7CDmNUhjwAl;gk5Zj;TRbIc<VdICsChDv#tUB5?sSg9MY-Kj<v4tZS7j<KE=`m`
zg;~!YqrS4KSq}aZqyK(PuXBe)y+-P^N9Q!>95*Sl%dayJ5;c_9A6TzH%5z;F=Mw|?
z$T4^S&3x>A7~#B&R8Uh_?^wyn&W0^&a}n$Ic>cZDrr+1}d%#w<lMpANoZWzH9pzIE
z4WK6p#ek|9b}+cng+8VF9QLnNmdX}l$6iMsSm{Q=?Dvg7CX)qPyE9zK_NlD`nox?0
zOPCloE68n_`jViUk~yvWL~vN=NpWL2aH&bbI<ms2d+~H>CZ8f7D;}QR-?6~mDGXQQ
zLrX0fu6>Y?U$F1?2j54n;@wLkS@S68)0MjWcW`vLw@XiscEbp@Y&5Hk|A0I@s+Yl-
zQ)W#n!eGzk6if3Dao<ae&P!y}aU{a1GM@gXWv>;YX1vO=9INAKYuV~dl5bzv?j$5D
zUB0A!owJXpa9z5Oem5^>J(nPO|6!V~xQifuXM-r7duILaC*AFJMq2K1gLn3sb&Jjv
zDkjStgU~mNUkU>f&qESl?!WH({|H9r=zIQqTL1N;Yu5jQE>X03Bi}&PidHnneMf&R
zF%6?2JO|)-tQ6niB%IUAio%wM5_x1NO}cMUabp)3Nbg1ArWl9>x5EdJ{F*QKD}v%r
zHnD&k=xD{SnF#}`SfcEBUPM){y*Y^AYD`I@u;5{ZP&aDP8fw0k?}&G!T)-|qcWaa4
zBk}2^?h<=D|6KH`_*Wk~44Ht_r_IeBpX0L3*M~8QfLXttmW^%w{|?p-8JpzeH_{AS
zuJYp+ULGAPH})bgv0E~Tt+xM^0attwp^9n+;d<x_-$5nyO*J?hwpn64xrIMgN!uu6
zd{{n#?Yk?MP*=69XMzkX*|}rfZDtX59Jwx~x-@)GA?HVmUgntoML}nzF62<LGsN+9
z5|wYCo^Y2Mz%i-O{RN|o7TeP^m5j~OYylwgv_6~DAPbqAo$bgl($j-+n`=21W{A9A
z+=x^Ob0pqB?aNx$P&=Os!I>SQ^O>$v6<%9Npy*AH!g8(1hh3VWvK;j?vgRWvXO6Hf
zBCFUAaP9UYFs|;w6-lr3Kp6bgUw<BV8xk@<@nH?*#8$a>gWAMTuH5#`Vu|U*p}oZI
zXu(k@?I3fUW8)z_j)|u1pAi}1{7Q{pHlHZH-d_Ss=e>6u|8_Nq_V#-D*86#!URm_{
zYUtopktu(PfT-JY3=^gz&*Qt)Mc#*Rg$W#1<Rej@C)^%EB=QDv^Lh^dR1$a?X25oG
z_^d86Wo;e?WYE1*Ux8_ZehmlNqtBD{0@yn=2T!nv19+)v*x>kdJ98#P>_FPF>YbI1
zZeq8qV6kjhX7;nx%i&FSvck$QUNwuHHe<LpL&@@~DsM;MEQ{=S5}1APiORQxbNa9l
zf5ztJZu(ZLcb*6xWLf?P{WT4}-Jk7TTrS=TdG0EF6288TR{!$z`T2SK<L)+_eF~<b
zCVHaJe~Qt>Kn+T^xiBJLUih-zFc#WrvB+`KRd?J|z3HmL`n^(#jjxVD0N4DrQ`yn=
zVfX~;8FaC7VE?P6C1b_<L@C3;7?!7pc(rEK8rzrn60d(s=fp2hVCjLy4pk)avKc2?
zxo9GDV1|&?aKUAwoyU^4N{EtZPy#x{i9rT(TP{1^8+g1uofW&^YWVV-_2bTGTaTlC
zs<+OS$JK!I)u~mY-m7pJ@xRH5d}RNAF-f5Q=m<FNm|7hfk+ozqh98&d%#h5=3(g4K
z@|N>{WZXI6Bv%ZMCo}*IFP6%R-Q@D)@MjB`dPNv|#ct&|vm;d2snAQQrYzZrf%fqc
za8#O*Cc~Fx((o^Da$2lD@DN~kJ6+9c(Ag>fjabc9oRE_(ls8pJUt|+J*-|t$JcoMk
z!OvErb#blFwo_TPUS4GZH=T;hv942-H3QeJGqtsE2j5SeAaZdf((o>b|H719LD$~1
z=E<o7-QK_HxdP6QHGPjYfzM-sH;#DrbrKH)SSH@f+7j2i64y|op7FCUqr3&&A|if2
zC@e1<0}PV!PF5*_Np4<bmd{RjU+O|#$wtb3>tZQ}^c!Dv=w*AF@WXKA`A%m<dYCh+
zWP*LzrM}8xmne3?7U$AO1RYV67uILCD&7P{{6*?n*I$`Bb6t{h_*U!opk~A5_}AV`
zWW$uvz`*!tXDMxF#H&$259yo72c?J?tJ7nsZm_#ZK+%y)ASlc%>QLhC-(}$2)7$gx
z+jAW6%tN^8LpblO==DLaYwzz2Ljl*F=Lz)ykL!c!@-^mn6Pe~;{dOeF>HC}2^dC{+
zAENiTy+zPv>(hH2{$J8FM(#OfD}J3_@AZ_vk78C_i<0QV_azKTjr1|_>Kwu5tsH6D
z>zRTXFmzz(!L&e2aiG9@tl^i9BR}Iu%q)+S`R~W|146N@`d5rab_~eOt-`9!@?7af
z=_`9k5Gs6KM0|ZmTuT!M&kx^SZpU6@4e)4uoLnZgqwD+=vvfU0rkA`I^{2b|c3ixR
zVo(jcn4D&jT1evDkK2a8myX`sx>$~GyRig{RTIDSv$Hct)2EGhLjS${d>6el;n~kK
zSb+~if<4EoOod<m-maPkp0};OBWvI5ZA0JfieccbZlHJDhd_m7q64v$KbyK+M?{QH
z{XLO>p|)bZzLTb%NA>)KF+w%wJ*2hUjlDfZTwzd@BVPs+)XbCRz4mRe+_W~>#@VDh
z{Zku0pYlTv!AED<Gz*<|Z38WB*I50!j^@+*>hHDRYqkJA)$(7>SB}$_qIJS`{@aRW
zCiF=*Vc|Z#L2|r~AuL|##wMK8Tm%9-h#MNQ@mY+rR$Zl=OzKwa*3qmp_V{BTW7z4?
zSC88^e`cODq!k0>KZF3I=sXgaR55<+${96chp@ah`T1fQC>$D8S{9J<)Z2gdmT1dL
zCc6tqG8YJJau1#-7WRtY9smD3SC)jcLPv8{Vzs_1FMaG2D)K?VX`wLUq0DgivqGs@
zFU`#5oCWJRL$OS?QHoFH8}Ug#)OY7RddjntGJ;g)`VrflQ<4BaAiiK?8#_6vf-zXF
zr#oylf#4kU_vSzoTIt*b*Nq@Wv!&(Mt{kuZ3IpL+UQaAtYIEY63n!oDV&y*NtM(H6
zW!2Z_kRY@jRZ@2_*LckRfy-tjU16FHHUa$#rBT_2R`lc@wR5`(XoA|MXpM<zTZI|P
z>Y|*|*mdUSrl_MP`8v67nE!PpIWvYETCX0*`^wqdzG?vGKsYfzqY&J%xtUHI9V-ie
z)}u$tY{O~sjgg#_-pI6aL`E{{fm)4m4uij<__!%Db^OYSl+$JI<p+)lee3p`s_rYs
z)LmilkzP)Tz?FnQonM{_(GQr!D+0U+s+KRL?r`d1o$Np2`SMZtO;YS=_>h+baLFO=
z(Abk>cz!TiFrhvU>0Y5&OEL_D+nZce!=sy9@mDyvkZ&_q7FW@rm(_Ivw9|Jre&&bM
zYQ$7r?v_lE`Im^hEN2%W^F!)pq5Jn8|Az&}-Az{)!~4wG6_)*Rh-vFK_C`@F#2@WT
zz+MX#+Wuz@UPkh46eg?!OtK*_`F|0<$9CM}Yct{V5X;EYYfVFO_z<s8NH<6dr=2!3
zg;;q_f&S*Zh#%yv`eU!MiR;yAN)*@&oJ9mSMvPMs0^_3qWv-hT9wTr>#+@gNDDy)%
zLBk+ksmV~%vC8rGeAfM#vWyeskcEv0*PCMlak|;l&Ah^_PuX!g?_hN@k0Z1pnM>|8
z$!cj}*9wz#BvCgOA|RUj*}~lt(rGT{)`(NE!R{crrT|g5B&C*N-q2riAS`XKIeV0x
z&X^QnjwbLTVT)3btZnA)p5}oT`jjh?!Y|xRQ-4hOqt<{zqVo|BVqt2wnSZO%%-lAr
z9dLoFe6KIp)`HJG%4q<hB5MF`i&f!fW&fX90Q9o!C>}cDhTaa=q!g0WuroTN)2Pw?
zaTOMJL{RJBT@;P9i;|m@*;xx!RS2L`0jK*7GR)@bm=_$DO<{=O;^5SD`iFGC0;P4W
z%-5JLOPC{^49Rk`{=SC$h_p362M31!y~Bkjqa4XNu^p>mKCO81XndHL<kaHh`<QH2
zis=WO=&`yg)w`@BBVR1f`EqWNfRl(5U(nfb+-<0chKiQ(fD=!DVAC{1>GNe;2(H*x
z=PR;4PCZ6zEGRniSuzI(MTgRXN-N_Ao*ko)1Gi_kVL6D19BTS?fQZnQ4r2r2V`$g|
z)M&(YFt-+Oq&gpRKu8)NKKWp$ZqYfn&Fzp&t5KsB9HaypmcI;J1-owc>k#c21P<~v
zl9SU*$RU2ibuNJJyU3H7SW_YK*{(>3-hJqcc-p@YCFC349nkRmj1hzS-oNILSwbPO
z!}|K%&5DC(B~Pb34`s?7*IE|XT8;yHlei~Hdg>tgKrFA88j&<=&<I*Rloe6huw%5A
zI6jPC=OVQ>zE{6L##0x=qQ-XBEOLzOsB~$pqw(^Ulgk6BH_p&2upG0s)qWc4D$Ci&
zmbizDoJUT?C^~Cyhszscv8xi)CG-eXI|>lTY&ZVGW$UCz<YD)mi_g2p>r(TNct2oU
z(Dlp)zQ1b%cHKt9V$$(Lv1N0()fZ$Cp7|FSs>5}GRTMEITo)Hr_h4Q))qS+uNxNb~
zhYreOowhl?v!kv#_70h^0^!3{M+-OwmmMC25<`OCq#~e&cF=TW1b{4L7R|*^#OXE)
z{+T7N>b+LV-W;xrJ-f5t=G+oq_K6ntT3;A6YMjA`F2b7wC!eWLl4X#^%Sf^=-$~f`
zyLNv!{A<uf;EE3Z0^>P^x{auQPbk$+!E%djBEp;txM}vSd*X+J7>3<8b5s((v#|VB
z8Vf$}C6K*Xcq6ok7UhO5JxXKAKt_d_k-sR66rao#{`ZN)*Y60T#}TZD4ubQ_=kt8J
zKhkUWeX0~q5C%x21*o`xy+x^}itW9)0J|iGI<~Jl1g#q9r`sU0b%Zl_sqL4F%w6lV
z){Qg73A4Wi(%b2719>UxX>V})LGqGBJeY)XZ;l5%Z(U?If2BW9XGMG!^&WL(N9-QY
z;6Gs$5{51A+}mwKqW!^wqJWcA>)RsVwd@<OIcJ59t38JzMboP2OVq7E<Y>x(YBvq~
z{1+z^hjR)4z9ATa4<bZnlSBsON?n-0&if4l{V11qjA^%HbD3Y)G2*FPxE;g^AZSG@
z+0c!*38dviS?fde)^Ob{DCbgDXQ^8iYgT4GsNgm<Gp0RUYM@;+e7R40&rM(j^cWu^
zw?lLwc2K@Wk7=BmuEoV-;=5>i>!tW4Soo}9gH7$1DL$S68zMRp#eLD%>k5*FVl;D{
zsODI9;VMRGWxAG6wn<%d$dREE@2Oxo5qWliYLJTgbox?I)^El<y18lg%qY=lfg_%0
zM~xc>XZ9+^5RB72=Q<AQ#*DbS@N*go>&lWLz7*asiqT}zy&Q_V?0oBL=d7dV1PLW?
z%T_8#&53T)!G9_!ww)$gRYaG(6mv>l95V-*CH?P*IXPyJYO-Op^c#xnDr@xsw%LE8
zBk*|}+H%2iK_Lc02$6H}TAn%Z&CqzpI>~9SekPQ{V3bPKZ5OK6Z^V-W)bSF)AI+R|
zJ)=E+$_W$X{}2;teoHtm)j8KGHa$8@vyEo*5OyOnIHul5mC0i=(09eN!h5Q{$k5^K
zkxJPb_<xT*j*_C^`FgO&IMh{DqiGU19VK8)V>jU<oLkCk(5>0}r3^`Bs=`u}NR_1&
zC;Z)xtw>m8ooOx7^uI}ICPUkjG%(uob;_ajC?N!sh|ai7Cz4>>XPFU@6f+tA{=}BC
zGcEGzSM0DXBz<Z)g7i29dotCH#{9>L#(E~FGt@#=YV2*bqCcO;q*wzR&cs;hN>HnZ
z9_?iX;?)>8A{xh|*KE*kl~oiBVg)XH=D!WAE+^1~@T;a{@J40Ox<9wK5faH+3|dV&
zt!C8nf$exPV^OqVRW)SbEp%&E%eZrM$UoJwLTuP8HEtwp?B|-Cv^DH?l<q5>f7qq%
zNI^?aO29xsCAgJD#DSRNL^r!J?bt<fD$PW^`aL|kP@isw^$y1;+j{bfE=zg_y~bKu
z<i0g{t80uD@_uG_STn}L&z51r&@S*2**Bw^F0zvyBOY?IQ)V#xfQ!V^D2()h*K#tN
zL0mOU3X2uHtwVif^3WjGE=v_FT&W3;rIB7)Ba}feyAKYZvCbs(2X?Iyi!5_kV@Q2%
z@FLO(44a}eV_g$(v;hRA*$Pqw1_$9j2|~q$aE{NjqmvhTH5(<2-lWTF*E>gao)H;s
zMlT8D_^C=(P8$Bmq2>52E%EfW&bQp^W?1=?lap(~J0)ahTUpT>(djv00I)u!>y&VV
z%0it^{Uky|CX&)H!L0{#L9<f<uGHyE2PCg;j5>(Umb~YWZCXnJgZBZCN`f}!nn)<2
zgRHS1cAaSw6xqNLg#HE_gmTkAO{8frg4Rx?<AaqRy*wXQo^-nq+IG9Z(akF5Txdbu
ziRH*}SdR@z2(%EWcJ+VGduATwA}K02lrMCr3ud_tFx#h@I=Xa`lA~1hYbJmAjG6&q
z&|c<$H=vaFij&2h_+N(lst92|;X#|K;cDH)*(NXh4`}(fGpv21Oj*^njSwz_u7>Z2
zt6w{bhhpJaDno!%N-8VS3WBg?urVgotj%5tnhd}RjTR`3QZ|@~C0Ij%-88z&Ua<yD
zThvyLG{pq>+a|Axy#K)ek5Lv+Va4)Q7hiPUzgoDjj{e<tCBk^q8r@v%bMJxXvV6^~
z0J+9jyHCr;URm7P<Klz-A%9ki>=scbgJgCjF7d5O_`82Lx^pK3%09BO2qtEeJQEZn
za$QKn{FL_&PGsXh_F4I;&_Y~1A*v-X*@%FWL8`=Bmrveyr;Rzl3|pGR>F3{%h8ApM
z=9)npR37H(fX8;uw*^O9pcw-Iix<z0j1a?Dp~z^0Yoz^FLm+F8Qj;aGjw+TD{S<W{
zciG6JX4JfJw1<32lK*^S%ldn-!S<=hsa1pBafY4MnR=fZny3HrG3C932iqVu*szZ&
zy>NxDPl!%DcWoh=#C1lHX=S!=nF<PbOEpdvPz7hNk@8xjSEd6o@T#C~>E;_i2@6Op
zPggX6wlYXb)1ELLmyov-3A?Tf);BpUf|g(39_2PEi?J;NdJ`10gfE+x)>|S5Mg<gG
z3k^p0WT`hwm@^-upo_(#7RuTa-%6tu=5igBj`OdLTiMO~T-Y-rEi-P+EOgtB4C$e1
zQu3HM;0&}H*$EK6D?~`LYKbFqK9q~J@+TLu{rav!T^%gd$$|x29Z?6$t$LD(q{KKf
zrPNbXf*2x;4qQuujAF(QNl!g@1><A`p~@S{({LrMRt_m+$w#ZibPHyy;u?_dsC(s2
zk}ryeSF}fAIiVPRBtAANxklLXH#u3%HZW@=3>u;=A;*mYIU37S7dEckT&Ey<1!BCr
zK>3i(rwS&CKvOtC>w)oD$gP}ADr8udNn^-s|8wFmQLkkOcF_&~@z(y7FqS{IUxqUY
z^VXc}d+8_iw5@3Kuo1ox<ZO;gmT2*mt_H{*p2HI-{&MN88WYPQhGY^Ib|bye5&-ZW
z5HawGEa@y*q);)(HP$=9WTciUDCsupnNVaiW?#sSWVP%O?((;l*c^ju;prIPaR-xF
zNvyh$*wW6%u^Ukmsqy0`yF8}qkf1>yOr<!DFugLpNg1j0^On7mKfgE^h}Xs3AIE-Q
z7FmQM(v^*0t#j0&sqO{gkLfRQIhPLPTP`Siba!7IMdg-aVNg;)1nWrzaN08Vtr-c|
z`MQ1F-V?X?Ze7WKk&vzlm#Ur6mXFT0Ha)2jXul%f+evNnY`P5hve=av>=TXbr*M|?
zEkhAsAvp#*jMy866ux9I1?t|os+ZFy{eYXxw^reEx{Sq43q&v|h3aUL`X)OdvFWon
zbFGt&@+%O6v`;L)%anLH<RA`TS(u}!L)NE|flZ!Xegie4%Zkpw(i9H=*>4VRE)66E
zd}iS!InBfgG|Viq|2aql-)5!CXOi7bZ`RybBT*M77=ozzYRJ8Dy0UW?w+vc0J*Ry4
zk;;{;MG8MYv-(UVE6Wsipnv|Exb}%i#JSB<Di;?^P`~5BgC>4O4HPxk@P}F;YT;Cg
zRfu1vHJd>WoCKFa8;+KPa{@pprDkQu2f(F4i*(ZKwTiu%;h@MGCGuL@ffP4Mq{D3A
zU$k8*Ajz=?k4tFjC}1!POZZ^zoeauR9CU^6gn7Er3|1yiuR+HyzAR!v>$^|em-dcQ
z#u<ad@VkB_q7{K7wLg(*3#DCw=#VVH7$%mf<1I%!SzF)yUm-hTKWBUllf9F{Y)oA|
z<CY$BwRdIX6Uu0YFxSei35BZGy&1?B6D2?#`8B(Pfi_lx)*Z%_iYMmLK|uL+1XaDN
zwbG9{|7?aM0)emy)+0)udJY*HU`du#>PkNFO;OQzVfHy5*(u!~O71xW7Jc<J13-Mt
zf^9=$h!z9Q*|dS6ISpgtpv_9IGZ`nIT!1g+C_Cl0IBFr!k&FIYKdr%~VvoK%pQ?XJ
zYW!%6Jg(3dSE0aqYuQUe1|8o^U}Os7*pXF#$P7IW)#2c)bIa+B>7x~iBc?nIku5oW
zT)NaeaUGN*pq<E+2b+xhBzY_2FFnx*SGW#SQEn#a5%JgBZ<BDX7n0GU;iItn!3L<l
zl2}KO`$_`ufoij=N<V{pJpzrX=98wgWdDqqbc?DRxN2GcHREI4-zLTviwH;}O0bcB
zEHm1~4n0M}a~ck1{1FEB+eCz=3v6lenapYK7%McqEH<4ohta%HKt6dZ$A=0{3j=^`
zZrx5+0i(*E{BSJ>62`=+*mT%4E~$&SP3QF^h55v<vH53T1^vc<^>dOh`;PVkl|p@i
zr?^a$dL`pAZmN6VS`sdO@O)*UT-a`Ovc<Z7`B3Z(UHBney#@AXml?}eqkLxbRjp>%
zlMjFJ0kHF7`t_MQI2#D4ElBks#H30-R(8aGaUvyV85A%YDh7v!WHtdhFx0_8EJ9>5
z+rE<WHZP+fLqnY+v;fMYkK*SKbS4i2w>ELb>_{o(F6$a9ImT-*7Vm$%+8#JZJ_>OR
zX+x*Oy(M4Kil6Qz=BymbZ(?pM_`yh{JUrWXtfUfvwfFj`x4f<{3Ne?{n*F?Gzh5KX
zmOMaf#NqzGVHQ#IY}knSWx)D}yP|US!OsA8{S^!WgfjloK@t&+>-j&?59a#e1)z{Q
z0YC%@9IHPHM!C^X2V<i|!WSW{Vn#yoYkJX%%8r6b3A7s;6sM*w^~?#0PyQ8R+OC*4
zTCQzYPL5PpR|2NRk<jwC*?K5_&D5o|&u)wON<k3G_3Y(Z;iVg>&AH??Eq%c-%JFMV
zKIaTi9%wlH&L_-8Rz1=rLNL3*vBDn?7R^U=^A7pqF&{~mJrYqKZ05T&&(_KF_gdn5
zKAZ=W&dVfA&{BJz0b?_UCQqqc8z1V!m*ZT>d70HVO{d6I&-a5o6DoPGFN+WqBH%ZS
z+u*?-TU1M(W6%PpkPK%K3Q%e)rJRYy-;&UE588uDp7yRhA@MSe559y}Y05epH{}Q?
z@Kly3N^$=>L&9eemI>^+k<^BjoF|&cmof*gRY^X4k>XsPiYV2YRv=AL7&axBx7>mK
z26VC>kip-mSYAWv<q;!QmVEoRXe!wl_6L|9H9C6;ZZz|)jL*$<=+pkeVY7HtN{hFb
zGe}H=4+}?nN*FHnpzKKJ{St+k|JPGKcjVN46`xhI1-)K>Ua^bdcl<Y8bF8JH@`=tl
z82(6j6vUkF<~j#hzBW)7P{|YQ4h~7L6z3BLmcf-vy188boRTBCV2NFK5HfAX+FsNy
ztI@Z^(D3!gq)dJNvj8t6&F3eEgQ2Arp6Y@-^_dVanvN?IeCeW|&qI}zXOZM(9>p|8
zijE0u4+`%aQWP-v`il2?N0m$}6hnB|AoDyjhhgl4>z0lD*aEJxw`P0lodpR=Hp(h~
z#!OM;)sO`{pstCh>_b(2HanCnOMjY;DQZJs0Vn7uYH~7P>&0**9dL?P#f3}oPZ8--
z5J1jmRZ(>uzj`6eStD~ayn;204XuYO(HwRLYBU!L>opQQ3f3jRS<y`PmE#mQxm!s;
zRfF!7SV!=l&Xc+6L{EA80$$*Jv8+>X9+PmXW0_$g2pyWsE6RgCSP$87qK5;XzTe$k
zOs)+0k-mGN6RNZt4-2*#d!;EZx(e<Z$r0BL;wj!2KOWJT4YdBA|CeT&v^)4($9p<!
z+HEvC5GoD_65z#AqtwuF68Y6afiQ1cq^kcom<(*~1<}Mc;LyxEOui4xX15bm)%~6u
zUX9{88E&uJ22RGXq3?rqVT!`LY5A%{x-F`>!TtC|5p1w(5NQ?<q5i?wzw<9I7|UC|
zdl9KZdbQQ|9%6{TS3<tLc?(K>)!RUp>~-p8%Dcq$DiUtRFzm*V6GIQ2%-OwosN2-9
z_&gm_IB5KIsvJ0k%Us9=XONe?&O{4WK-=~w6I&L&V>?Q-BwM@Us6ecp8z1vrvsef|
zS-!n<MU5US+6qA~+j!+L&_QJ;+xn*iHPezUxm8>T5+Zb<1knO@R9}`1+PIRe$Zl(a
z5j&uf(?o9|RdUw(I|l)VTR#M`YJ{6XL31smc;Db$q(K1|mA!V#gAkGEPzYwtQn<en
zi@g%b_pR4qY#$nl?N(4ZE?#q7OkQ)F5CdN{+$(=GHSza~!~d_n!yUpgj=zPk+zo9R
zmUa+)WiJph4IF;1GpX0Gt!jRr$9rQLqGm1@vf@?^diBJ`Hm^r?=yrbmm-4w)ew}`d
zTetlW)Qg-{)h{vwQF?y8GWS&=*Us{y7KQ2klE5nIyF%KL;M3+>`j*P#N5~HiMNo~b
z>)XEsW~lfx1lJKoDK{x|1<Mf)*6&zV<Wo!L-c?Hr>jeYyEcn9+8^`uwmipP|EVVrX
zVAPtHd}qZu9MTqj-N*lZ&d_f2EEqfXk6muE4Uz8Yj2-#lv;}jv7p<=GTg_Ol%A2?H
zuDNu|3BRYX2Sei~+zPTpxx9o#Y}={1DZB;)mQDsqj%hYW=iAKWNFtj3(2uJtO2+m&
zBfhY|t9bqJ_=0@CmGlLpfg{;^-*Lblh;9G2so%J+b&n-VS3>b#freMkiKP9ssG%Bk
zUNG1gK_dX`w1L>;jSo87&~w<RXZmE>AHoj+N$a+aG^s5SX}N5bdEf|$>A>5;EiMsM
zr{u69YBHUOB_8)&1E0usfEC{QAq09!8W+1Y75!aGST|E_v4BM}vqJQb$KJVCd*(eZ
z1}lX{dco3ab$FP1D#Z&L82T#08|8}~{Dt#1>l?3zu<7p56*)Bm)ZPffI9@bOPdj9^
zb^{?p6Zb*+Z3c`~q^}+GjoJwhBNSf<RXPLnQU%nNVf5BIFqpjglAC<qQ_MQcrBm+B
zyN~F~(ZE(Ra~>II6#nkH&WAigbUiNd!ssY-Pc}T*n4*@M4TThcWhnzGJeanKsU(7G
z+%pI(2b(03uY17|s9cTqP+vS^kCuoP9kDyHy8A-n_4=9p(Epd|&OFuMmbbe*2dWEy
zVs$aJP-gNLSY9&lMe0CWftZ@M=R#owt`=GvrNTVmCtrRi<_6*gMesin7Pz`%7&|;`
zhr{Fc#c83TDsS=#lKTTSKD@(RWh{ZI(3GtOMu{f>uiJob9zrJrw$w{xbu=IM&rJLr
z6>g)&LuL-Qm%i^+(+FTF)N{>|5<^Mx+qp0&UvNY>*Uq_)H7#|Tki$}8rZ>gcFQTAL
zW&}C9M;?T<eF6*=zM$_j1Le`*Rj!ST=qGWtz+*=v!WsURB$#)eQY9yz0hB{<(yBk5
zGhasj8P338^_e{Cz<k_!X!CP<-N5GQz*G0dwTkkf60EiCGQDA|NR(}h$|hk}2KU2-
zcUB!mIoRD+ha{~)Sc*IZ%#E9ogAT~jd4mDiGsDg<j&?Y*Dv@`u><kEo5f6Oxw66rM
zO=f>Lg`L>eus=IFdy>O`fHIMg&?E%)FUN((urr#-rI;64K1T^mWqKv4Ad?_Hy$GC|
zixxC$p$OJhrb^bU@T~%mbh^tX!eQ)nNZ6*7!sY;4bB#5)AjmzKSqqV6q}oioh-F+{
zc)EFvCP@F7LjJC}VqPS9D5e>eU?RS<dXm%6_>+FavuS2wqnZr?_pevuG@2(wKr<)#
znRQzfC08CDYg#P6Y|s)La;=hG$W;q8ri*pw%8&z&pp?g)M=Q)OO8+eLhNgri>)Ukr
zS|>(=#Q-ojsS5k1D(3aLe6z~!7tT;f9Kic6#t@@)p^_iaS{UwcI0npbT1kp_V}~lE
zB)t1pF@x5gk`8wo4Gx6-(8PKGBI#TL;!DKdAb|fG!sfrGE|pWZ?^gup7qq@;tL>(s
zgJ_k}9PA5dPDsa{f%avG%8vhmCP-Z>0@dU$GgE6sUP$`>e2e8Ym0)f0KZ1>jO#+a^
z5mdwa#sHS!bEQl<EINbsXj`*Sr&W=4wTUr>vgC#P-Eg`G%`hvsP9+g(WHk8*U@`1c
ztFe;iq!8>?%p&T;T7yeaRl6f`d!JjAjO=urhck0{+q0y<@?6U;?hKd@m<66TbgH5y
zl=p8OOg-RjLU|c6-jm6dA3VVB2q-4<q>x)IIvj`mpguPpnf*ggLEm(?TF*;M`e#eq
zBvzs<$0}!XW`3_Ep<+aEl6@4CFO)?Ik+4#!`NyD|UGS770nn!G6I|mT$JN~@vO{qO
z(SL6*e<xjgZyi5wbuH_OJo$s+30fOTV{W7nb%@c6Rv?e_4@T+0NHClOjs{<t87gKa
z{v6%=2!D8NFoA5@Rx1x~+&CP9xeQIy^2Z%bORq(TR$t_8n#T{g9`PlGzhw4G^fjKn
z@0k9H3!n)EmX@^r(4){hNq05hUCG8c<b(kCf0%zlnBvbN*drbOY&*IhHchmhA^0!J
zFUdvTMoX}j$F5r-o_1}Yp!i?Eg0#jFdzn@na7m5rG4T#b{&#PV^N128w_B_cOGT<&
z0r94YKpBI@0x;qZOptaL^<|ozvOl6qe6_*X1jel3{0Yf4F+sIikwzd(Os=wrg<zgN
z3v~Z<o3}dGXIvnSz0TT<?eec=u`|dPB-Zm|4jTE)aRINCDb!HR_XKB2CyP3t^nFb^
ze|#~h{@lB$MehU6ksr1gsT?UcPB?C^c8M0?@yX>r&O)j*^2^h_I^v&KxqlfvuxJUm
zKG7Z&>#&LeXLY2>f9ht0zFpNP4qe;JzPq8AmEhR;_!W@3G3UsZ&-ZW?6s)%2cms3a
z-Q1Mz^exKMAXLsPnmmsUK{vs@`m}Q%)kt1ab(I7$@%{KqX$n-ov3X)G=vH1*YDJ7~
z)Z~g!e?#F!Uk(HJf9e_qY@s&Wx1=$AUvQW)p|Z9g@`@ui$=m-aihNDXW}ydyXDba!
zBRIHsU)}%q^yIrb<l7kJ5HzT;hzmNRIsBL^?FNH>ZV?&7#zzpp+<He5v!|A+L+oLm
z<+9gtE@my(sVuhg)i%k^Hk2LrCCxxSlWs&KZaReSdxyZ<S^on5(WS=oqS2Jg;Doe5
ze7#iO$CdK)4hG@dI`NE$Ppcw*9U%e&D6S9qelZ(tCros*{*^s=5p3&gRQD4q)(+yO
zOll6G7Lz3+062shimWq-062CH%h?0NE7=slk+bSCz1-=4DtP;v*&w3R`&9B#2@Ax=
z;dUouJ;Mk{A8nK=3o0NEW(fyN<6S>>K1p$$9X?uG3t=s%Zi_susrf(u$r4tqZ2DLs
z?h}gttD9Ltk>MztfvuH4Qps!j%$GWPspe8=(mB2g>MY_^oO+d`%CEk(GHZjiIT<$_
zLRZ<;=2yo=QIZ@N4blm7#5R;uX<ZRVXwP(9Uo1xpWjHR=`Gmp;O(b&u7j`~YsE4_L
zXuZ*>K_mmu-s)Z|X7+tUq0F^~c?mt{_Q*91rkZJlF9t3g1aawcS6>||ygzmIUr3!@
z4N+2w`DTn-LJl<wV=Q&cP#ADawvHA{{8Q24c`1%w<s+VupZI4d_qJYM58@*_9C=ZF
zCpv5|RjjY2Cx}r-GXspltq%Dc%o`l9<p9xhT_w3ck4Y--noX}FD#vb5veUd%+)Sjd
z;{SPy>pjF{*<!Y6CQ{8CKY4RsjachCXtvwV{aD~WSM>Y8p&x?1uz{KnvGwOV!-!M;
z3_5?J^HrA!&@w9;+oXRJwIAnd{+WLebkw3&L1&Q)Zs#uJ3eF|i{#FtaV?|ZnXyJY$
zqxChM!5W?=_#_mL-=X$3u;AnNVY}Gn404C6YyabZDI0`EGI}Cm&Oj+X#V9M)91(+K
zrWk*obO^QvF%6Ap>F?s#o7$raQEkF|bMT3ULBvyKv^iC{By3*DNo<l*FexoA;$){E
z^}zP!nHT*JI1T$2D@KB`WS7bGP~+vr7*)cvhyP%vbbZB>{SeB7$rSOj-1qVx$-yxH
zGgq9UTR)I;WG8i_fof+DCP6mi?=%<N;opZX#34YzVrq+&)t=b-->YbIc*_+!*cdmm
zs+JCTx0JBKl<9ERr>akKrt2*;UnVKABpR}C*ym`$b25l_$pf^lA<3Qwie(UhS1?VG
zeOsfhF2h{r%Tv=6cRg#-{plXZ>-RT?G3T^wl9SKJs>R?RFz;6*r>D!0>c*7@NHR_h
zfzB#xt;~r<k`lA(20|__$B}((!fPWT1A91ZLf=!?+2+nBnt@4rTe<#WctMmx*Z*f0
zAkvA{IF#5ABZheLDq+}$cNE?=AAD3>Vn3;~)|FW3zmcmkRMO}<)>-N&p=fI*wH%W(
z2gnM!flR?DfhDJ*M|hIlp;eX;d?0nW0*wY+)8k~S`o`as-3JLWb^PPl95}Rjj#UVJ
zj>bRH#{%?-{<IW(Z5HMP?Q74h&BRET#V4x$eTn)Akxxccv5A&0$bxE$++ik?Qk8(;
z<a!1rmBjGO&XQGjIa^Y^47ql$aS{7p0{gzXCq_f~1d_VHQmq;1_5~9Xiemrf3qd?5
zTdK4XVb87$A7eYdly2q~L1B8o=ef$bfF1+UJNTjFXWHF~jYHHf^o))E!$nBxWAzWq
z=Ba5FHhXgB9~M?tfNCt97~Tv}Y1W-)_QVnre#j0w{@khS%f<6b?tz@?siuJIzai5C
zi6`3~Cw3^Umc{jJuu`ZJSV12O1xsnRYVc?t1-Rd<`p&|4S9J9znnYKnv=B_@f4K>W
zm;DY`^SL^ux|DL`235y9rsrsb({Aw!=Ze<h0Ijl~a2pko@)tyWZv@A~O`mOzO%xL?
zAt}^3LE64sf&^0XtAGA~zS5j+mi$9=J?x_E?ITXavmV*Coh}s1QMkKxbg`&@*IaQP
zBW0j#>%kR`EEoub7WJ3cBeHIO*uR?63w0UZ7aXpd5*bnX(d72%pKW3HuO6YNUxJ1H
ze{)?w-5Brso*CmuHUEoeTvtbnfKQW_R8*X&RhRhxX!_=;&c5&OY@3stY}?jUlWp6!
zU7u`ElWVd$+4atxY9`zD+`jAi)vC4Xk6P#6efHUVzi{sL-q`{l!YnoUf4ch{yo7tI
zzkq}dJQQw9F&l0~c^z;Fxy4{qAh1N>|7x!orL7m{GA_QA^?Fvzx8o!06e~~+8ZCrn
z8)dmTtsX9zH|+ezxBnLt&+#$c)XL>WD#yJ~YRviq$Bu%&#zr&JZ`Fuoh3ddgka?2T
z29GO*nK05HnA<w>L0Bo9u*-+-7C2ZfLGcJx&wE#1*_r`SOrxVNicACj9SpiT{hfmj
z+9nCD`^@)c`>8>C`+9t8e<RzK%g|@~P`>vG)Janu+=*LDf>au^!TaHkEO7Q{82DW7
zI<w(+u08tJQFCecvaRfYd&Z8Cqih`b?G{3b7kWv6I~R;`Hq9Vd6;mh8IWhZH%Jq(*
z*zVdyP@PArd3z&g5Do`RYxL*pV6%#U!6-qJ)b$h%g{Ar*qxv1V=CY9L`X6!dLG|=p
zWcyYl_qv|1_ni(<Xo*hoX9NL8PKUo_a(J2(n5;vQVpo>=gz;cGG#7|B+fOWBMME6k
zgy><<3{P+u!}$qL%|!W?TfaHQSU9NGd;>ofRm?hs)eZa-iE+_$!0UUl?(;9T2=Taw
z$QOd^ORQp!^9J=CLbtUsIPGjfW4{#5j$^3HiOLgpLMZR7N%!^@3TA^5EFRW5-!f$l
z)oHQ5i<3D6=oOiX3RyaEIEqlrPT&vYXzulL?Y=ZM4leHYP5y)5xobh^+x@ySAVtFM
z+JVl{_gFnWt!BP#Y3)8ca}4y=y!+%AUIaXJN*C;{Z@=HaY(4Zi`k&~c3cp@vS>}6B
z^B(DWtePwP%%`H%AFW(u>UYfc54MlaaC=%v@^~A$B3TiN{ylSRpqd^;?Jk<CY01cT
zG?uJ;%546M4h;j@#qAQ|Kn!DE?aAVjwCW&BW}!%lP6J&N9)=+nOeN8$DgozxG)fXM
zL9cY)p$nUEqdeG+?ZFJ82I_);`;w3sK2Nh@XCo&fc4uu_J4Zggd26&~Ur=Cjfw151
ztT7%U|0SL!MKV1-bhG(iZ*3fO>VW*3ytLZ;x38GExVWFRU&p|gbzmWfhz6G-pE9@$
zpOsF4^UJ*9G>Dv!2uQq6g`Z1=ZI-)lrukbPHu>1u*`KjU-j1aW@2WIu%K)j&HGS_j
zee0Ibi8R0y4t!e)d;^UNc>waSFR$`^UBGyI%H(b0{ikc+@v>79nVOCXcJ{?byeNPy
z!`HeSq1gFu;ryfRdzBg#@PAmcShdZZ^f}_E`~~4ds)e2jF)YynCa5B6i%YGcf)&*7
z-V0j2fgE8B{K$p90Qr0fO~P~K(JY)eZ@?$f+VROgFNly0W5L~)=azFe2p#?rk+jR$
z2!fmH_tjqRO&;uPGx<5Ev`&c2uZ>_o$4blq+KOZiyeLs5>|2ar{3`TDA74w<-u8Mu
zv3-@`spm3A^|_#$w5qCq?sdMKfRd>Q5PRLm(AVPWKNQC@Jug-Wxv$%|<^g&`eRGGd
zs}WZqBtFTxd$_%i%@u-Er>}J%&vmiPJzhLS0Us~hf&bJBI`*bN0y|e~+RhO!H%xWK
z4qO(kq~bhKRolMeSk8Gd#4FD-2zFDgqF3ex3Te-_8flD{*iL!OD1XPy-w6C}qVXIq
z`>g^_G8$`K$wwcH21>4wCPp{k+v<b(T(>V@QsK^d!$$#ogD3U}M3dS8hM))s3l!b)
zILz;uJm(xRJcVw>QOrBHlKyx_>Jt16=#!)Q>&xN_Jgk#fg4n9inGpGVV*v?&xLUzA
zclF(yf)Bsm?La_!QIiItf;DXT{>Sj%r`xu!+rw@6Q&05oXWe_=_ER1@1Kf_iqc35Q
za^UkqJ~X(%$J5M5PVZBW|I2;%P2Pn-(liM?`vicrHSt_b?wh*q!8L#I$#`hm9j7%n
zQgFd=;CxR6G3nF{s1<7S%&dt)qebcWW(4Tn!F=CtG!+#wTH#}ZQH^=z5EM4lc7JDI
zPVC`_4JmjnXuasL{0Z~y50;rX@JtK$4Q!SMO3;(FMH+mNvtk}*qwlO`op#jVRR+iI
z((q*N*;XtjzRp_hZzqbzWC%viml0LpDb3*Wcn*KfN>Aj3mfUCl^EOj}NL}RZ`u2SH
zHP3DStaV$cWA8Hns;ZdU4^q(0#~WYA0Zw_frQiu}AS-9Cp4V<TpyL}MbkuX6NkjvX
zH?6px5vx=4=4uC9R*8tI>?IS)Or#bhx1tJ>ugE9AOl{-gNN@?X<<6ofLDj{pW9s$G
zhQ{gdp`ibg{#D<VSu*j0ZM^^2I)Mc<B(mRT>NE*cR7f*RUl<t#14fnpA;LWzm)LDC
zuz-?kxlj!Ewt_<!V?`Sv7GE+q&01aZJ~rH&DRH;*T`bO`zqU?aVdHwiVctwLx<nOi
z4-jtp0z#Veo)?GSqxYAKK;Q=@-al#RzYY%%g#gJCkP@;01<Q>T)_RlW%--Ifbw%E?
z0EeKU{{Z~g4ez5o`m@JRNxv=5QQof~H(C?I?tgjc@_mtLM<^sG!zI`{T3n6CjdzEv
zF}@j{A!EMiB1bQryTvcc#)qj=Z$Xi!E#exR+8(zSIlVL6A9sC&jaaYseGy@)=od;@
z58F?~gpfq-{sLyVu>)&P(8JZG#h#UrZgAbony12FUiOV{wn(xyo+F-VEaYBZoWSE3
zn!ANILnhjdOPZlA?7SxU%6f@BR?qWN9gNe}Fz&YRMK{<N|J%8Y?o)FxgR2<LxXL@`
zk85Urk5jMB69Y@6Dt%D1^#Y*L_$qW2eOMIv#pn3*+a6|t7ik^|9dB;Ivd}^09A_+}
zCGkh?%+`{>p3X?=H|as=2zLQ%^~MPa+%5<12~g-=RRj85#CNeWjQCo)p|W*IH0bO}
zegu*1ry6Ve7}DvR?Q40$^$vd#kn{F3Y|qpE=7WQvL#q1F82fBU(a0i$j~Y$%s?aku
z$LZpBcC&(#Z*X}<g09_$s(*B4?317yKNa0#umt5(p8l^j8kS@Dk~-7e#dO0I=#r-9
zK>N*wt%BtOzmpoCs>`o|*IysD13$1e^_>6xs1VwPSM~x{CDU`rS=W9$FW*^})O9^h
zp9n<zr(Cmy5I4CtbKbLSpBT*GIwgZh<|uOb-}aqC7-o3bR!6(jP!Qf1%Tz>v__`T1
zMUm9oQ8hCRPJ~u42e0uyCcG#y*0^0IN_1W@2%mKLXNTd#bVGsP3_PF)_oEuez=MRE
z8`on+aZR*htf+xghS^XUuIh}tlTfCT7MmEYReeuQ@w84s1wi=y%jgkj?k=B#f|l|r
z7>d6WkXjt4;H5$@=)^ZQHx_c-bNq3U&nm&>_dLJ#n1lV|)n|7K$WD)@^K!UbXK<Z2
z-B&hUCKw&P1_=R;YEj~=Yr)G#B%t4|5cos;`CE<Uf#gu2Uucr4*!p5k3X!D4DgL1(
zKc*A-C|H|Ln*G%NZNv`Nndvrtp3;URzK~V%M@O<!*dS$@K_j!?A7$|?qp|+o+M1WZ
z>jdfAle6c0N0*u9AKJH;^}Bf0>p}6OCLYAgHIY~}&pd~CS$W~hvs+zb&)<XNq%8}i
zkH<!2NA6({>QHN6k9`+Fsp&)$SYwsrUU(VMS+5TBDf>-E6Ms9VN~M#n-2gr9OyK*C
z@Kv;O*B*9V+u!n>`_ok*o%$W2eq5q{JQaLAaR=UTd!DT=>6}24JO-(bgVZ&HnEn6C
zGY4G7uGHv0{8bM0Stxg4p8OV44YwkYZVQ2oia!L?W<;OAI)R~k!?>aI2nC)69WR0N
zO}UbcD$;}%Ct>#sd<TUyYpOmC98^a4<ph(#SQp;lrfy_sOL}K31m5YEja5Nd<_|}j
z(dwfPd<KSM44UwMFi8@^l@eiSI(~@Qtd_-^O#1iyXF|(!gzhM4v*=O$4UW<9=t>VO
zY^Qk*4Ex*AT0sid7*GCeIVwlb;cpdMa!u5Wh(^vA%i@3dgg|XTbUJqYEtdyU?&s20
zZ$2d}rX(*QRzSY;=ReJ!kGBg)B^uY4v(~`B@`fEdA&3F@mVqA7mao?ty?*`BxLA@`
z!@zR@G|Iev@1A8GL`nx?&%fffd-g`oTF;K%YU1$N*XG_ww#*;m7`+(9Z4Wf7Xc@D#
zVbY=O!1v{l*qCfM;h(8aDJZHO*)wafz%CDC^ZiyOmCt*&aF9G5^Lmen2RD=TSc+xf
zYHApp2^tw#8AR8P@x(1HS{$&*p-Wj(!NH(o@-zQ-`S(Qcs(0!?#wI=AH^Y^&qNShC
zi(g$y=yUQ=c;Wx0I}Ajmpsm-Yub%HXHuBw;(v`qeMcSSYNl_!55q^&=p{RJTZkp}@
zPBTDHpG?y<N)q@wgsCjBAII*{dDc=oZfkIp{i)5@1xmF>^9dJaOT5MUozLip{Kp5j
zvkf~+<VCT+Kdk1P&EG_xYgEts7#~27A#4yfU!QDu42#1I)!hZJlseuCgGkPRMgTV`
zZf}Ri+H@kyVdkU#tE;tdbNgdz_q=9`Y^z0v{#r{EK>?e_C#aB|0~xV%%p}d-Hbq5n
z)YbW;cm=LEE;8&W*6}z~59B;t^J{%rdr^!Vk!iTGCngXeB-Z~D@pY7LGAd!eKUy^!
zErI(~n_}i)hL!tYhhZx5{7F+&AhM3q@AUA0-6sh=WH0dE@;+jG&@+4-z-0mif>~Kv
zpFs|&gU`qL{lmy!;8xgx?ih!5?v)RsL|;^?fK}jIJxr17I19S{oyTNIJnxXrvjQ_^
zp@^e#b?aLe`oSDz$OMzmIA|rIJpxUE4}3ISJqV-ZfCd7+$*u@X1zH`vjVf27AG&sh
z!r5w)<IOyeO;oMWd{!82Vj9#NWD#N{ZM&J*kXXj6-{(SrKi7ZQo&u3vv$Qdv1ikqm
z@_n<w2?b_FzR$msL?J#Rl+?G-{+))=FTOw#n0?v{SSkRn0fB%SKvdk@0XSH}+o`4D
zZ85GrsD2mFY>n%fhyumZI>=<-T*HD#7vZij_0mv!;*Np+D*xFQ<fX@8CQ7RH<M+er
zjOhNo_Z{A)9S>6P6V(KJ%=G39%KER7QO~J1(&6eCN-^{$@j3Cj#Nx}QJy5SCD&1@d
zqa*DZ^B3oS$erHXuo~P$C3J1t{h7zjq|!g=`UD>x*%sloQaTb<HD-t;ms5J!pF3!9
z_maKfNulxMGo+k&{Fa;YvCpfk{yBc!J90a2`OQh<x^uPxANBP~r?0ma!f!ww?6pv?
zX!!O|^K*Hv8Uj85@YXn2i!P0=_z;f;lRq*qj%2NDf@5bq3QAjZ;(6Zk&i{EwvKKVb
zF`ChB=I!FNxGQoIGx3r!z?1_r3B$gvNTOto<eRb8(G=j-A2ro|=gEgV#Ik=W(>5yo
zwuoyR5#6HncVSgb_baHeu0&3cTF0z<|2i?fZ?3iL4<n#!_B{jCWWVbCr!F>n{9itm
zWk4)VFm*C8ygmWR7N}_hmVO#=nzTn-3hd+WJ}ZK~pKZUN?Zq;0b$Q<`*XR~p#aR+<
zyff3d^9a}Y16<HwaU7u##Q8W8FcjKjK{_Q<))`$tTXCIy2@ZuIhzD3ff3=2~{+;C6
z-P4DjV4yh~pddn6amI`YqEbdY*`~J{4V{vE@Db*0Giz)_q(z^@?l6P&%BSd%3TXFT
z<bSdMGn0LaVA3mIZM(X)+<ky0&!;fo&>D$BUrCu%I+9B)o+*(a%@26~OY-qJ3WScP
z&=Kzp@5^aZ!F_WDa2)D?0LCZmf`V_mfNJjZIM8|=r>{GGcnN&22;>WR`Si9he4fv+
zshQzBseS-_9BRzpcRv6(u@XjLOxo`_+Wyd;5n4(_NmghMZ#N5;f(&9x$H}TQ8q?>R
zRc~E`_y)2`?-ve3#u}MWY)zx3AY-AjVf}4{i&F?;vkGA+T2dUS)s{!wN=0T1W-AwJ
zjUUHaNT$Zy<9QLiDQvRFn(KPu@7m+p<9>IY%j3K^gpXzD=X(*=_H-z@IcQTtF@T)d
z@a{;G^<z<??5k`Hqx)a^<vAFfTfSHf3{rCWQz^+cV~oA|NihAJ=Q7fPNdtU`883w0
zS^$*d>I`_3&~*NDHl9BZ+A>L1YT}+zKaAum!s3IMhc^6kJ5Q7lF{xOfdLtLc_{zuB
zXzqKq!q#}=oU(I0!5sKBVHogsxAIv+eunX9*9=6DVdr7CEe4JsP&j{Df0T1~|L{kd
zhk`}@vZw?3_$e|i7a&IW&{_bwzbEjM_|nOjS2yHVQsI@LE8;N;vsR2L;3gP}V$n}W
zM4VQe5jBy*^)1N{gzz>>;~ipuwc?p6-*><?L6~DBTt4)wBEnfbjwYL2ic!GAvHjzc
zppl2~S5QWIzn}KaTuG`&5=RfrbhrX)GhZ;~K<6g%K{1by|LINx*0R9={;TlQ*u4O=
z_n7<$K63_AtJg5SLBqN9s=EY;Oj?XNE6!HbtkupT-}UCOjp5k!uy*v804gXd)mE`K
z3<j1kDyf)@gH^q;jx%^Nw-`%iI!27k;kkYQBifbL*zbyGGbqODzh^FIo-MPDVO^}U
zp@YROE(;DW6t$Mz`~v=f;BW+2vgF;kW3Zrp_Lus~)l&Yr@F)0C%?wCl^jg=`4kKS#
z^aP2qI9`krTt(&=bDU!6(c08XB*?bsYuDQL*IZe7YkI9y?D#AfG+|ywI7=RL>Wgu^
zE-YOxbJ`0YfyAgFL2lpfHYkr-yQwjFZKqpW#tLPnU_~zF7dknHC~`v&t$<@rkud$m
zV?JqPsNs~4!2E<*tEm<a2AWM(it|XZo8<#H!r(@04jg`{irwD?V!Yl5SQ`QJ^?$#c
zb}-r~I;put?!B@bwc#W4Xm{1CFGSB$!{TZz^5BhytlE}R+r-`dwCul^_XGtUV;M(6
zleSv66h~8Fn&iYme+}l@&z_jcyFHa6F`oW=h%=M~Uy~<^MJ9!n<-c-SKu2ppbrVS+
zjlj?$Osqv&C-N#({1dkdJ0mMY7^8+EGeZr>LvJ$4Uu4P>e=_ke;knZ_upQhJ2H+47
zv%4U>z_eG5CXob^C=n6D>Pxr|NKnaIuKyVddWurTIV0bouHG*~MJ?+n;GO%0U80DA
zk)}F8QCSWh4q6ufEbP*)#p`sDTHMmn8QYAKNn~!xWdI#uG2p1mFc66CPntFwRiJ1h
z4Gw$$!HG|R;|3eKMyKlfy*gL+a}om4j;BoIcon(R<NP00TIkiC?BkKvIuGtt5Fx3|
zmbE3h<P=?33bj8O#T~npuyE&O#QGOhB1hHZ=*Qw~L`78_-<B(Fr)DxN<D#SH0~2fH
z%)mo41R_CM)>FSQVhymVVii(*4Vw31-qEj3QM$uop(XV7GWCzEfpzbOGx}?`GLN0}
z=TiUHn3&LOYOPi>NC#QwLY*cQL3=~?aUCw;h;W`6H-S<<T_90{8ABc+XzoVRiqgy%
zxSLVRQ1eo#+$c4EJ0iE3`a#N_k-T3qvwa5sPdDjr1aWFJn?J$9r1RIfd770W1)-Bt
zBP^myTv}9Ied^QJ_PS)XEabI^Q~zki1lq}5X)Z7A7x(c+AExoj!>T%N(~Q`-ksoT}
zcTS=Zf&)Pw*oKaU=!AeEQ3NwFuRb)fnivWXH5Sqx8XpQL5Ar$RnmRh=T(8JA#VmM#
zcUKPl;6uyeH4k|}z6yFqLPs3AR1(Z^gjd-CB!=cL^`hxgzKaUqyx+r$rCgloUeKf?
zxdeuiTLl6u+2bAH+$7rG8(u<)FM7{NM#uSZ;A=!8vl`=JnwO~fJf98<t3xbBqt7fa
zpm%pr>mF*+degf#1D^a<nwrosJ)}lrGVs4!A!5g4qOj{IGQ~lg=Y=ZQ+mp8n1ZO9(
z!F-)DQTWQNH2cr@n2&rTiH2Z-Acv43%M?k0Np~$od<0(+-9_*1=fp5DR|%}@3xQex
zi0m$Px-_iiCZAExO<xnBea+#zh)wrrY+$#0`)|rnq`bD6PWe_puH>w(UQlS{T+02}
zXbye%c~q;Pt<R=~Fqv(9tsx9O7VGzwgCBita_GJ?$C_}>R7A@euP->!^X^?f1O>bG
zk1GQ@1R`YR5GpRB{t(kNK~YI5K4`)|dCo{Z8fVdAcOKq`=j`S|1f!KFNv7Q9zgBRM
zb`uw~^VJ6oc*S4+C(GzrEJeAd^Xm`k2d5iM0zQr!<B1hmOs2$))?M$XbJ=Y3P5M=`
z1UEV4Q~HIQ8glID3^dbJ>Sq(o`Xhd(Ry!UNmr_FN@l-PS<-XY57UKNFOsH=&Z?Rp(
z-S6XDIEE3efa6z)sg$*zVAl{o%pUjnmI)INg~LD_Jekk|fmfI6wB~wG^l{&FMPl5T
z$FY1`fk|8uLZR?GSJS#5XKs#-ez)u3w(Ps<`}Bs?KIDn|j*U^irbgm_27$m|W<XLz
z7S^7(xw!-n!dE_m)(eJiHxJ-kFAWz_6W+G2hV?Y`T7x)LPsLl|KtMt{Bh2!)I5};x
zyhx@!OpsPs%$84IR>^k3AI_4Y>gGf}v~7%P8Cy%Y{l#{S(PX64v5v>gAM~Vz#l+5G
zMHM*A2ZR|}{Yl8#gql<8FQ(}v?p+2c$<`dHh3lL_aK@+P*Ru|%2JWr%CwZ26J_Mt6
zZC`HtJgTVwXi}2zWN8!wW+>ma(TH`VkZ#jyPwc4Hsbj5V+Y*LD)Snq^sP`v5H`F_?
z$1o4hom@T-|KLA*p###|9B};{i&Xh|rN2X>B{@pd=!m0-o2NPt?~at5=&2MW!c50U
z7pB)Rn;rDbd5v4gW<!Pu`Bv@Nu8B(p|7*~iy-uIVZ6qD-&1Gx9)ul1p&D{n!e@GGp
zy~^I~RW0sPib;nN<Aj!bkRM6rVEDFMaUep}*r`+pVdH5sXG4SEwknE*;UywkwoFgk
z<xP1{Ad21}Zbk4j2tUZC+s3_+qdUf#^*4`_Rj{&GMEzKknO7N!k`KStrQeVi7f!k^
zrP0M@ZrZ?Ot2wCCiUiUrl+H?_7M_mJge0Ujxj-0}+;3(x874gLD#=7`CrpSgC>JzL
zI<YuQV(9v_YQZr^DKRv$Hn_E`hm2kxj6~Pq@!2!82(^Z9g&DV1=3hxHpE9spwz0oC
zmHUnkKv>wHv7kq&&_B^H7f}qvheQBLXi&mF)SOyL^`MsV*YEL=`%(>?DkyfX(7SU)
z<-F1qdn<g}0@K$W0@B}yY0&aciIJ0VL-!W`ete}}9N9t8m{ZaQ=p(|El8lVmVHV;Q
z#^i1>P85Z}3yOpGaQ|Ar<n3C?GQ?R=Dn&UiwRC^0E%hH9Gd^UTKJyyaNOxQ~kmraE
zaTCU}*>x=|TBjjG8b_>ZvnuVF?E(Gjorcl2UY6w?>zs#Pvt>U~d$3!wRuno9_^)#h
zkj!zEQ;E?kg!HJikeo=82?56*TiV1G1rrUPWH)Q_VoIycu&e}bmg|eQZ`%-)<Ubo1
z1RU}(1Xl5qHkB_4;#!CSqWvLrprJ76_NP`j3G-$gPUl+{KZi){Pz#+g!v+*$bO$Uf
z2x)lhaq>A0RcEweui-|kN6-tFq=>cF+vb~$v8?6wSpgS+0!{AkD843loch79L0-SZ
z_TBDhWUIe0CwFc!fTy)3rAp(GDojNyxj_&`%`5UKh&hTXOPvrXg&ZoID4^J*77{l>
zdAB<d?Yfxu+5G>lG*|z-=Uj_%3{Sh#yA_XtF4XEE6QQvtz+?OzH;+r|``131A1lK4
z9`k4mXBI@z!{EjF(2&v?U*#C3YJW{O8;64w8<j?!$UsLcX0($fiYYw#ecsTfw&{#l
z#D^xVFMia;eb+^1y|<Ku!?bdzL%UKU(qV+iw*8oF(XP}4|MITPRTQjwI}N+cgv3JM
zt(z(?2)L|!ri6bzG{^P|Sx5c7Z@LF!9$B%b{(=A`xsO|11C}O@Pfdl7K-3_UY6N*v
zYTxKBHN-p4l<i~|(Ei^+(LgL1*rYNR*wQYg1oz6ZR6od8g#nB)zEYC_={k<8HOIuV
zF@8*E=+E8@5Eq+%(_5w=Zh3Jic{JJ7{r8q<yziU-U~sd!1a7pLGp5C_DpO=id{{<I
zn8x{1CcljwnDwpRim$W8B9b4bksHeCctZY<3&4vgYJkF7>Z#=kL=B|z$`k*&-{}u3
zMz$7mPIGHpIZ9d_rCpj|ZF%~M4KKs;cDRZx0TPokc58h6P3HHH$^O~k*xPvg7E$(@
zR`$i_uq8C_alE|F=#8$|lDo{&cn@MME_5yGCUHY1T%JpPv1N8t%Ey%{QzRbYqmkof
zHPD3P9V77iH6GYN-j^CN>FkiiakHoW^JId~TI_!npT0ez#<sf;A)oGaI)t#(F6<xa
ztcY!fpYh;AU&4uz>V*{jeV!Nss>ni}Ha6ZX84|agfriO6FHq9cr~!l|y9?dliZ)7&
zov*drWJA{$o1y*ixzHk@wuN|1qU?mn)z9Za8EI%78*xSQT^)-cwmc)lo=b@hrg~Cw
zm3a?cXL>w5Xe46WOuWWgK_UB^_DZi8>OhgDIQ3=6?tPv?IaZdvBj#uThS_v|LDny$
zs3MI7`9EE_84sQ@;B1B&I4^U?Oi&K?UI}EI!I1uFp6E{{<S+Q;dDJv?t#D6^j+t46
z&b@6iMw<h{vT8SH8=X8-E*FD+^QC!0B6aVHS#O+9*dubhYUv%%s@_McVt8bd`ZqZ0
zm@*b5{wQXi0b9p}Kpwf?!!b|@Qj2XVap23`98_;2_Vn?jS)~1`&SjFCVQfuw;;rAG
z?B<`|cv(!W^ZoaAg)rIzJBQtZK*B$0$nzK~{sE%V6#>S}lT=%%@mvbR*^6RKO=(e=
z4viwaWsbX0g?PqHDA9L`Os-<mt;SSwELQX5nw{}PO;0MuQ(sbMqr|nZ5p+`Thvz0V
zfbuiA`9EC=-kN{2Bq^HKq!X`cdg0AWlzYLcDR9Uhx$O^@1{@&gLjxRYxtOfUcSS9<
zpeB!qA&@G9CE^lNO_4igc9-ikTN(e90Sl&=*{E4mG|~Z*SA#wK6N3zv*dCpTgvD95
zFdrR>yn}Ii1qboeN9!>|8GVR@MHUKu43NK7>lNPv{cR8xQJquBU8y_Ow-D|1D7}Yv
z#bUi&Opow=4ZL<=r`hlAwi@|63bcrQFiV3i`~9riW#<?+!pv%Zu%SlV%P>v0De7$-
z>Zbomz!9!gcN-xth&I^4%i`q<aFL3<Zlb%#IO=c?J0S*AB14>3Xz`N5l8>AyoSZCL
zM)qlh+8!g$3As})g(Ih87W}u|4W742LCXT)QE%Mo3jzO`!>P{X2XLe=k7S*gy*_*l
zR!*iS-qI#ZS-`dSuK?*#V7Xd#^chVH^p$+7^suz)AKS_7{ebYr=bN%&r3p}o3aDk3
z=iszHVeScz-zzGiqqUB)5^pZ-4;4r0!M|Bw_qc*MeUnFBHk1&s)4=1|F<as(=VyH1
zAVIKvuf6Az(FbDw7U7veILr!bFv_hWZuuN;1r?<a=m-kxGlZ0IgrpA<P;IEB_LoPu
zn}B9_DV)Bs*1lc&LX!xt=B9Fnh+#{I9;*98m<wD5KAgS{_Lp+yJmOX^V(NaCx}Gm5
zQBJ1DE70rvtar%BQTAN~*~J60WR|563u-i5&@l{|`s6n9v1)RuZjaULD6fAjE_jK3
z!HD=<E-H(}2j)y)5{O$Dt@49&<<bOxfT<Y4G$5<a5&Y-<%J(Za#e)OB;$R1Vy1}S+
zhD`O9e<C3T*Q{9A)av(0b=sB_CSw9xLdaGU<`<~H5!tJby$d1qp&b+hDD-igxTjtp
z_S>|?w49n&#(DQASlTSx_D20?D>JnN&Q1SW!LIZunScbf8@z8$52rK=a~oVygGxs4
zi3NLlyLW{={0hFsNGG0g-<GdB89z^g%Aj4#?yx$(Aanach7i-rx;oa2uoRPgKNu+Y
zTzjwOE#ea{OCS|sHju>=?J&>eA^;kKAg8H5o^JgVi}?s8@5$KtH7EeTda5P%&8v*d
zh42qJ{dlolPPKL;vRf7C9R6m?e*ZhKMEU`oC&2F`Rk)oA&YKsU5D|Kebno}z(Qqp7
zH;1q6iz*bq!rWR`yZUqVxT_V~;MKVNCjYAMhakSeVUk*m4l(wLSQ6-802$Df423BE
zFFoZ*yj)3^8wQCI=FESDyjktqyW!>BKb<03>&+*spM0PH`sTl0xyLwNj;;*Oh5C06
zFvAr=l!&86!%#8dM<??!xCN#pXiN}3+){HIHtq^tvKc3KJ6J@97g@^;$`yZ>I~#Qw
z#PxXgh}f3D%p6*i*M{1x84rt!{Tcb{1|>k=hX!ElGaz5!9}vH;oFE^uii6*w37U9N
zFw*P`hxYl8kS6gQVesMCVSYai^2TAf54pymF%?pdQIK%ZA#j)tfpLvQ1eYUDhYIZ=
zRM|EjCX+B$vxWHzpAG>%Hfw^V_!A2Y?&}YGI-?Kq83om06!7)w4d3(OP<tTLgAv@J
z%?c0&aYPxHJF~CPg{={k>gVr4q^!bz&rVP$VnmQY8JPzPq1{L?it(A*ci5NM2&0r2
zcVa*?15~A7s7c$TpjWoo7^+s2zPdV_N?hg9+FpS?mbVIg#&#AhFM_l97g-BTXa@Z_
zA$*Uc(1S&U81SOe(6OTJzDPlEeIupFHeNar+igRl{kF<#Xd~=T-zV`@{fDm#(p{kK
z95_NE#0LqmV#SNftf=SE<w%)ZHi;#6>u$b!=(SOT?l-!Ry8OJxUGJ~Kuyv;_X_F}4
z5g9TOS%*6JDmf-`^IW$mthT$<v(?+wIjn=m_IrsDB+-Lql-NWL7mV8#{>vNMn5kVb
z7A(0zci=hgF&cew)IGF~`=e$zy`0Ik{7YH&w9;4jwP!HJ_@&*KKE9nqPg+Q|xh=c&
z7QM+oI(^J9jCo_iot6>2?D9`k0@@!gmo}4}9sN+I98bYUR44a)WfKdG6?SN}LzD~K
z9+5~%V-`Js0-ZMkH!WmJ_0&4;o|NAMWJ6?)jM$RA;&;4zVxA-Kk^CgPs(Xt^7lInQ
zkNYdEp`3KA)1tg37`_N$XGtJ82y3zyiF0(U%u-Ss{|j28qa5=zi&p3D<hlstn}*c!
zHt~9m)mq12emk7Au4f7*geb^rj?7=zij7D3SGa!$kmeu_Mvb@P-wV504bZz=4IaAQ
z=eu03v`1VoJfdnd1=9?g9aP;~9CBeuNnH>#1Ryesa(Mhj+NDK0RD`s~Rh-7oO8paC
zQ^vs_->3}5u`kg|xBDy!6pDnHokHp3ntRbTyJ(z83}KYyM+1ZoZ|^22AhMCg`_(h%
zw+;vyabAMmT*N<=n+ee7d=s*Y!?6EJ*+oFkP6y%V_B9MOcMUTMz@k%d@ny(j{XyW^
z5^W!MrnBU)<_CI7^f|r|6KfSZ&r`gt(n>aHxgNK5Q67_z!AQPuZ3oBp1!s;q$jNL>
z@AGx&7nHhDq{wsBY=@LM_wjT|14TQ;)5l4~(T$xwO3S$^ei|up?{sU5+9*Zn{7iZp
zi@*L?;O8YeiJR<p)ONGt&Df^$(oERL{g#5d|Cx`=HB=^9KZ)EL5Llwv+yas5{r*cj
z-wzvXxN_Co>vzYgSt0yW`2O$&Qa^11zgqj@0KYwNz<JmZ6oK?O<-2rX(XqT|>Y<8D
zM_o{A%9wUuq?2|74)vzNXE=CsBo=C|ee6s6reG<I&4p!Qy3!1C8IV_zZAKw}g}Hi{
zM)4?i8k<{ZUEdb6U8YdC5DAB|=Au9;8U~5BTaX1Q03E4$2oz<1$d@fB0`{ylf3ynN
zC7OUWege!4<1TthGPqIYs=hh;+P09WY2lAosxb>E02@_>Z`}@fQC0WmoTD9xj|z_~
zq#4;9<0ZL43dcx!b>Y^&r%uK|n#Jp25yEZTMciJ0+l!^{T0)^<d1GH$e&|Ao0GS0<
zdWS2hIKbG0!C`tgMPVU#%&OtWUR^ghGM9E5vmv1~=Pu4j`bzyN)rPnp=AJ6YSx0Ow
zs)hl)7V9>APHN=;o7x9x6l(y?VxFO&UJ6X3S5uc9&wzduIW~F7yk2EcWp0Nz1aV(~
zJ0<>b;2>ha{Xy8z3V7`vy_M`qOjJJn7C(ub?owY)>!Fa<H6q#j2KelIL-tIt_5=}G
zrTY<&a|21Qs>0pX`G_bw$VW2*xEpy{$S_Jyee}q}A!S{2?a%gi`a?DK-IoB$-V@+%
z>2<X#@UJ7_c1{}La?Jy#g5J?KHbr;;gjc6II?!3i;9|l9OVsta$pL`IUfl)Df%{kT
z$ancsbuWH=unnh^2ORY`6#LBgEL*az@GOAXBaV;8N;j0%pxyyC{7qTwv_!wOpFM|q
zM1Q^9tL!(@rpXPZTmY$<Za|LL>F+Vti~G*)w{w#B%Si4`w}lk5n@7M!+jnm$8gNiI
zn!{FLCA!zV)~pr>W)Vo~<{E75iKYQRemjRnx6R_@<R8-}*%^fk%7H$97rmi+<_}Ow
zIUd<LjxylMb<ME+<qFN5O8lj(tSWwjrf8#z!A;g_r93x*UX)Lr=-+-VsVjDu-&?8h
z(9SXprA?rQr^Qk(t{wa<4&Z?7f7-a87(8@LF!%ahtx|pocr*r^5Dl{hMwkvNP~Uh$
zK5!Hh)l(uC37FM(!~)Zs0<a@N6PS`s?t{3%F1^hR=>K)V|7DF<tO8|hbPkRTt^&H7
zDpj&0!Fz5VBi5YUgz<R6R!Q6xttFhb-#*g_Uqvb)1<Uk(KQ$OGk%;&DlP&fMmjWCd
z_~Ma&30aK&;;4dQ32^+?++jGDf8RfpPIIr}oP*b?cLv0`Qe0+_THP-*OoM=!Irb;U
zW#X*LYwFHxx|~^;&itJmo-ozcBKM7-_t>3`22Tt*#C}OzdJHp#CD&$Dt8@=-K?Lxs
zLg|Zwkp2_@?NK)L-&~39CWp`6lBV$c<39J6*ZwEYIczC!gtfb$C>#J-`<`#K-+VgQ
zAEd|&0ZzKtzwgqNVch!J2(dbufJ-_|mD3X_MLFOVudVhJ_J#Eu6J4!4v*BE5hNe|g
zrW99C#b|e!6t8F}x&5vRz<PkWRa~WCq%6x_i0w(Ip}D7m@DOcP>AGoVnTIINNL=(d
zyy&2%=y$18Npe4!^U9;)Bn+lMEeEqNlwT{f2`xSLQ%&*9d*9Z3y8&K^g{9@^T?b4;
zx+o=Z+m9pM5FlXR8L_l|dL?(9)UE?00RX<8Y_VU*(YtBKTtF1^{4q;AfE=?q?1jH=
zN4iRL+MWhOXhFLPMP>G5qiww$(O%AGjWs3-DB~fbwm-@OJ9c9eac$O(iz+>)HTW&{
zODnwY11#{7Yo|Eus);AYmfk@>Ws7wtp&@zZs6G7E5pz*dp=jve^)BUEtjC=QHO0C%
zkC~Ak$e{PKhodpSZe6FhDkv*|j1{~_tH#$nXRf*+!GuD>qJRN3ovq7R;Pqb(VMd~o
zY_&RWhvOPN{s90veSoEku`yUxtQJOy-~MPj7lM2~px!#xBtJik>KBEv|0{K5F`Qzj
zJ!!`T-|=yNpS0&$vw+(Go><ECAM{Fo+spSLLRzaYtsZJqnfMdUz6JlW$J2pT+VZ!F
z*;+w-CtDl_NpgZgn<F&H!>2rzgL1%2S7!b7=Vtq=e`56rp%`|v(}G^FLz@U~K~P=*
zI4FD%GX1;{!0<8zmjQVG7Cl!Zgs`Fgz(#l2*HD)`+v<J+cna;u#jy_Uf6{>~6Q-J)
znqoU5ze`rYanlr|V?hTRV<M)@RIYM@NRip`Bd^?xtO|?8baZI%)49;LFUv-Og?y~!
zwhx;9@6lU?2F-hr`I0b;bKau)z)ejCNcs+jAi>xOJ8fotAAIf!8JjeEMPn1k3NZoW
zLWIfb%My4j;}zl1(~%lYyS5#fD|yj4qHWy^hW+xm11tPE4;b@%1{`_f6x2lh`0>ND
z=O(ZBrL#8&YQ=7|;|^fofCZ)cyJRV$JLmzB-DqAS0e8`Ch~)6nK*$&5TG6k_YK9c(
z*ltCqwG|!pKLUixv>Dc*gYD3{{r)<G<uU2e-5PqGZEW|%baj|mBC@n7uvQ?^AI5+{
z^6(0?NHkVF%0&>gA|3{D;i((a5@3aSJM40EeZG<F&k_tHMKQk^_7$#b@7OF^Ic*^U
z8U=U2J~!9~aCbttfvK;MMGN#!iaZne<xVInQ(IWS(Vex`o$ajgQc}dYb62t%;UKB@
zVb{n6ZX1hr?wT&A_oh^~8yB;L<mTn@Xg`26CLm^jNntH3pNFELW`S8PI%v#fi(-SZ
zxYk60->RUB3brbQp_|eDW(HGG5n>ua4ZFPJ`63hr^Y^7ypYlqQ>JXJbH?+}pD4%n_
zR+eP<lPLOWt}l4uJtGfr>4q)o#cbaa0BT*=&9v{!`gT6aX0tVB5RmL_=1m0Ka@;xx
zZN$0AQ0BC1c-FNf%cs<D{_17>QyaK>n&C6Wh~;98u7r6jl5hMk5KJs7^a*ZfI+uSs
zEaM@u5Q(v>go3iAv`fC2R5B7St?@y0_q%GDs;r+G{Zt>4sNOhW9<U*p%%{;}V=ST`
zq}*e@-bIs;P<V|Up{*5s1vq59LBfxr!oPuukJC;cIQjE$X(2X?mOZL8)lUK;K(2!g
z6%DxUc{zu?1T2=Fp3a@2fy@yftB-5fd&9b#s2hf(z*3&V?j7A;7LWgv21X>nAK}4}
zrU-mQ8}xTzSUgW?UD)yBa_&S6lG7*diNIBS64+|=i%5&d%Hp<{XvfBtMLw0bPS6%r
zoXui&2n^;@7h{rsyL(nU*0eMN7@g6*+IFsZ78Ls?e$vr<7x8(cb9gu?B<sEI6Ke?Y
zyhpjN2}HcA0&Y8f!2!J=z<m^fFZXAr7VNaHuC9{;?CkqDT>u-j2grp&0NLSV>*6h6
zptbhoq359+Z0ok1n{n!`8pFyTDe|-)Y~$%zt@riamwo!Ob4#^@RAPf`t#d#&AZmnp
zo91XTF=DSNKImuQoi}jgz{4c=c)nlMnZ_GW`9wXD!Nh@MYT`kNLp*10h3F*zE1|Z6
zR-Z+vmH~*nRj?8G=*F+%W_l4q1|valOwf>G0$Yg-s714@80qRy!oe)enRuEXn}RR5
zw)y_g`QZZDOJL}EfH8NX;612x^|QPKlB0|bkI(J#Fs|Y2=ZzbKKq;}lb<f3qyZ5)E
zpa-B8IdtDG1LfeJ^2e<*uHKB{W9Nr;{}B_|!~3h|&5#nhhgJVLe(1*RBMw%mNmyj0
zq@23j4H;M;vf=CbyLA4R`)-RZQ{a2)(mCl|?~cxwz2A@*oa{fp6SyNU3lPo2kEn>Q
zh>+OCMBbFrFLE)Bj0E1(S=HTO75-MhH&yHUsT_{A?kT@SHdL|aaf3$xH23XsR9@Vp
zL};z!8zH1_i`~=OO3(f07a+5EiRa#WYy^n8K$RBw;2G%oc)7dMb;$WiWx-WztNmG4
zbrb@Og1DJB;9{s-bW@qo5vM(d-PW&h|4g0#j^|nbxLn}&+r3ikeZC89eRzM^eBLy#
zd43*Qlw3J)Q=QTCV?;F$7)>-`nHdCEnk)jA!#ato!frF7Vrl?<Ivm5G57>yZb8JCv
zXF8*=5o4GV(lnOf_yt>-N3+a|B_xQ@kP*Z==Ed?U>>dV2Cf40)FQ=m(0k6gXVe_E~
z)!z!Bo_cOLkGA%{oqhU@169M(C-?Xq#QJW-Ws8+(?IymTu^o7kmneiC`OG-?z*1z5
z6#)K46Lk*tLGn+LAg}IGvXJ#u5Q}bf8_oJEb5@_vL-@L9x77>hN6|tQ;%Kt(*305{
z&jSc7k!0vrBOBI{H=Zjmh62)#H~e3WyX0}O@9~sMAc6`Q`ke}U;m)5zc<x{C0)GsN
zB~6&}L#Nj7)_q*P9py$cp3zC^%mmCA&TnSkCu9r6BR#rK^FO?)m_4_9pIq`mSyJ3w
z2<oh|g%d8p@<@@D-upadnGKoaK_uVsvQ@`IkVf8n1AVqzQMxabKdc`l*FAf^Mmaxr
zD{#E%3GsA4rhX}tjHDU{UKEvNlASvayn?w#7I7KFA#t!8^Yq<v`1tcn84RMZR?~5t
z^was8h-CF+TMU`(u_@&aYj4vMd3c1dC`FcBVas}q)!DK;-I~GH1&4d{lb<FTEorle
z+w3wtL(A`rkhh8SH;-W<l7q(NIWjkhGHpIu^H)D=N-kbrg)e%n)@x&xvbw$2&tsLf
zQ`XnucwXjhk9t2=KKy13KXzpKUfLh8*g+nAbn&J)h1M)8nC0Bxkgbr(MZgg*EmV`(
z&?_7=q0GGM3q=Z20vIrgyQz-c;;2nylQX}*BH$6H;|z*=H*EYT0kp>ie}TxPY9Y5u
zFXp}JU*_cSW&DmCVYr<QgP3V+KGkAT4-qQED#0K;_wFdzbdfXDh5CU|Y`b-<$8z>`
z*M#F!M+lc=7;u*Qa<5nr@-@HTFR>zG@j|U2n1Hk1nmwXExme?X^%>g+EXWztXTLNr
zHeNp_$sd}(V^vWY@dmwZmT=U*J(LDLBjP{Qyf#;K<>J9LNnD1eqHj8(CefKrdnR&o
z`Dtc5Jjuk;F&L)<u>1Ps5&t^DkdW&k=%f;V8Hu)yEI=880gn!K`{5}t@7)ts>EoLF
zA@HYwz|T<8-hl*09ybVKF9LDNQQPbVo+4Jty%>uYRYg3u=3;_Ma1A`R%tF8wxGp>h
zp}G*BlV#Dv9A2?B)%^&OjQxJWn2=MP;4h7D<-9f-W#r@{>fIW9hMN|Kn*_*MvL4M~
zG7B~M34>1|A{4uw<=;Uk*(&*QQqiQ}ToCvCw^IJoB|jD6zQ?ldm(dg9kGj;Yt&#q}
z%&)D&egui{U^m#r3w>BD$O_*!#RCx!BQxvzv8~yw>n&Fu;5u)^j3qRpK)~g9i(F}G
zs@FG$iTEiO6k>`zG-7Sm1K}Yk{zN~_6{jkJ+03(~CBfz_=)2y3PFYD3x7bZQ`<Wsp
z5O*IcdZdUY8NC0>ZMdjd8p)Qo6zD1wQhqeQcBM}zq!T#d7e4sEOE=*<Zu(y>FTZRT
zwjF)Eo%nBC{L1q{o92m6u%4VMsjIg}$a%(NdG=ov(Jv8JR8aWO83!X(b4M&|T~(H;
zgK+ZS93e`9A}w{?9uHpY-v}HX(`x?I&F8*IrBh*hiw6@DIoRM`0<Fwe0L@L%Kf18e
zstQQnf%#WrA=QiyUo<w6#SEY29G|hizhl+-*RB|;iHztV-R~E!sj$ZyHDA{6@-cO9
z(^I+u(hh)8{yg!~{4MIT@ABN|3z7g|;6-f9Yw?$zWK&OJm&aODVWO?O_}(77^}yFe
z$DTvNhck*pU5EDb_s);!G_~Wdg7PQY=L~TkOTzNjr0jtpCpVOCS|r#~pJPQeMKBrk
zs(eI?A|AQ$-xtrMxL0#<hAyvXNf$Cy3h;+!#$;;cgc3Bp1XatoDW8Zt(BYBBsA&&)
zWx3qSTWQI~;T=!Cj*gLS+c^7`$Ay1ozLp3S+Ds}-LC%fBcoRfx!lWiWzHhKT!P#E+
zgnYdCDpbuW$kk=}4p+b<_O?*9o)sbeOGt-)c=QmaLNG_j{{{AaqCkIzkY(zmX}Z*2
zShAuZ!KQPq5qrI5mq!$}!8+TboVEJYs6PPu)=n=@`@b<^M=&HB1lvoUJQ7PdVw$0X
z_}7s=8nxd2BMVbp8FS0G1YxKGkn!6mw4Px1?~E$k&JE#t##|2nTeC2=hETD11w^Wv
z%w?`2Q8E;+91fC8QZ7+i%&bHGGLzEa--#X0xDKS3UU##P)`aR9_gmc=KXJu{*or`7
z_z8~Y2Ydeq&qoKa?K#iTzHCu-TeR72K$eSY>mT<|oYQ)FkihkBk)z<AXn5TxCoTU4
z-d+$ghi=Q8Pe$BcR8Vmt2OK&-cuk_pGA{%&$o96PD6L7#1}#`UQ&RVv*&vFHx=--g
zo;lnN#_L}wJXe~rx;`B%egwVIPn6yC0h)g+a9w!B+MKpkizB7jC=DhaFCqcl+R;#h
zOMim9Cw7QlLP%ArbH~4T8B8?vjn2CV`?iF^tVs^a=pp6>js!mdQsLtamfQd4ar;i`
zOcWiRHO=@R?nB@gBl51w4>t0`LtMqTF0u(}m~ED4gfPfE!SZIvLEqCwi<sW22egd=
z>FanFRux6`8FtjWMI_|JzfTm^9GbILGfO`z;ra9Hp2e3Vo!30<wj-(z-*Ik(rz*tI
zPiXDd#1?W`pwv+-WxgNZ6~f<$*V1KvH;q0m6&^v8gPKz5M<d`ukeQE_N{DdP?o<}R
zL#!Ofoj$EMn;l##ux$pAl!?glkrGLWk+@9stfx_4@bC+kQ}dIPM;iPE4{Cw&Y%+2g
zL3Fm<)bTe%0_tk@_wg^C%v<xXMCll)ua~v!t*^LMmzNveK2gD9fj=P{^vl2xJuWYI
z3{=4$cXzujWCg3-myW7TB&+E(5G3r<e^c%In`%rB5y6v2xX6#t6EaS83$<C0pW8!|
zth_A*k<kq_h;M8Ubz7oO(RRcCgUa;2;kqqn*$l1qI-#{$K*BVIyL~P#KWnOnk151*
z4kzp6qyfFxq)~ORW%mtRvZf#s8@sTySr(MZ%<jIekJ(m+;0P8}9NjyfgqWve`LsQA
zG(U45*K^ei(ACHBOiPwi#o;AL{ayCYB)TsDwg8IWnQ?NAzlm}p@|>yGkEyQXY<<=N
zsd^fAxzE(q4DCEKzaLN(_`a6p%;ae-#AJz7miMp4hj9>Dtob#@^MawN4TJs6M^0Cm
zii84_3&u-_ivA5)ud%?Ux(LP~sO3c2QXAcHg&aP^X=2aVi6&aBEMU=QLrxj16};@o
znfk<7KC9nlKC9E-VnwmcRASv>Y5J?iApgg1YIRzS{aYeZ^;R2-jK-0o0lIJazij4^
zFk>DP?9~6`0_fi7?9Bw@uL+AHm@FzZC;4j-FQWob)iF(6VSV25AK-3nbU7*`yBRuG
z6KXWmh00s%arv=z6JnWuK9s2go1UwOn>?`EA`}>Yu27C!!}p2;gWr&uP_Qr$ufxfS
z{x`Fm3l*AB6u<iv#*ukFZzl~V+f`&?GNYE#IJr||!q8<gE4`+pYg?+p@FM9jD<N#9
zhL<?Bilk>F+oUsjLw(|QMc10ezu)*wSP&4+2^8wEDx#NHBT$A{MFyb$M{Z%&2Axfe
zO>aVD9O+?Zam?$omW;>!?|4RUAn^CrH2(G23n#;|vh$zEUZ<NiH?550sQOTR(T371
zHpXrXCAc3Fkz6^=!GHYlmEvU9IijQaWa^MvP38<$BUv$)0Y|p-HCc=WI7kZz47Od~
z#|hN#!Z%}vFNVDD4ZS?q4L)F;;&QY!Ew44FH8d79b+=(SP)3o7;@?}w9qh^Fc_W||
z^JT<%%Sj!_xKtOM5XI3;#5j@7C1|fEe`Hog9m*`}<%J-WMzuv|Eu_s)eq~W76@gsh
zP={uTnA9m@<2Eso*}StsYsj-AJdelsFBi+(vB4K+!)X56+q#^ITb$G%6UeGFmv(>f
znztE4DUZ1PQ@BnZ7>#P+MC<?Dl+Hxx&t(p+1~-!k)zbrm?)Y!w3^cMzJP&4TNl=r!
zq7n?Ip#sK^iAhV-aX8+T&M9@+cbU&j@&PIty;%M=rvgR3U|=hPZcD8yRp@QcU_CLJ
zu$O+IR`wfRm}`g-;`hJ$zHlcf>xl2!5YgY*gJnxrq$O3@OKtQOA#WDftLSRDr)cs`
zzleNSpK>yEPAufmaz+*bSC9&$Cq&=3*wUc3Q3o+@`ciydoSV%-SkH0?`z?gvEN8~x
z#DFKH2wkJg?@f#o=F{^z0U+qZNGyaqb6VeZt80+Ogl~^zwonu1T03cFky2QW!sK#-
zSnyiEO|td4sr<fdW&>$vvxu|=$xgp@b7IMO(zQ+^a9uunc=2Ou(I6(%zAZ*mLZgU)
zzsNlnnp*=c(1nW^_X$IAFPB)~WJd<n?)}OD3B}Stt}<L&1g9>F{v8QIlfXuXKu<CG
z-{2&Poc}R_gr07~pO`)gPVpuRVbCy~Y(t_de7PP(R&YdP)%<|$K&|p0)T&e3gttJX
zN17b4@M-BbrvK3_t4cWT?#bs&0{0$|MD{XB;;+prEWZ-qL-EM}NNlyT8P@XkFf&D8
zg4ztFUgShQ^74Wh^j;+3EU7KJ%cq}NbN$ow)sJC+kKUE!CEn8D67(wQt|%421}DcF
zm4<BO+&H-w+})r8y<fo@0|D1D%QW@{ii8q1#axa*OWp|!2B#U*6(iMHbXYDJD|N35
z_It1boE2(LOL8_jwfcg(BBtgnX|0Hwgy1|vwv|jJxP1qaU?J))xVgnLHFr+s%ZV@b
zRrRXQEBRo{hSQcl%<9_LNSOn&km3XRU!Gg&yFL;C=h92!{r?qr&hK?Z>)YRrZKJW#
z*tXr+wv#4lY}<BYn~l-fw$-FTlQeiI=X}rK@cuN{wfF3`XJ%p6de(D)?xv75W?Y#Z
z7nxX|IQiUySyS5V5R&*n6XcQ^_+k*^($43$Q1b=$W$=YtL$Lc#Ovpm~ccs$jn_qbC
zrnB-`Ppe~tMneB?xL=e?hHW!lGV<!#MCfrJ9wP+#^1-04NF)Z&Mfa^JGD|WhFF>Y2
z46v-P@_(`rM(jp{V}pfiWS7(aPARmeAS#K8QAA2DF2joMrCOYUtK@TbFFe7QpNRt}
zgG!?Y7dczGgTa`u)#!$jm4?k|fqjH{FCF$b!Mhh`O_0c0%3g*4Uyet)<Qr`8Y%mf6
zANPs6v33|Rlnl&4#>O&5w&eGb;-y@eSU5`@JT^?(TP7!EMRYQ8!}PWL=w<+M53(JB
zbGRyhs}np!$4S28Eez|e*V`W(H}$uay(6=2myhzTguSr(`D^36WYpXeE`3Z_!yB7o
zub;42_jALdyOR}(J?80;VOP-wtz-+=^jB&O%!r!xszvYpNu&xY!sXRY*_07$a3L1S
zpjgq9Da=K8%n1sr1D&y?Td?d!eN$u%h<Ifk)P9Zrxpbft9rT{!Kng^Tj~JN}Dt6V>
zUZ65p?}P&c8BElzSnzaZG-d~o!v&&T67+XBdbm??<N9VRP;-!cq}MPR6sIu|Wd%0)
zG)1uY{?H=@bO^_w{BL;6VHSQ){|JeC9T#Hcq9viXJ>FS+ky;ITsEmV?n;%zaolH$6
zHk8^mA)RUA#E}CVV$fdlxh;rORMwfmI%SwuArT<S9{fp^0>V8;Gs`vVE5dD<(!JDZ
zgc_F~5Ure<c~a|ERRxz@sEV=;;)k{mD2pVC6IJ8tx)k3H53<?&jW?QRjdFnbCK3op
zycLhjr*386sM~Z_C~uCq$PghuqW#hwn`kq#$`KD&T&>pBB4~V#(&7Hji;~X#mmC>(
z1Dy2^!z2<aXf-YG{yxh<z2`M#FX74IWvE_|twpJZ8v*=p!xZ}xU~gy6XNFHq2DMIs
z926eIMX4OhP5GyVM+sGK(&%R{{)UJ@uu5)jOiqMlAT?LVOlU#wJOj^^<1A7khOD_H
zI6CMTLmUW{XQC-{mM~lwtQ+5IY<z)mzWq_@$r=y=>naogHY6Is2?OHiZga8l)3_Zt
zbNushW3mAa%C4r+UI_J4V=b+Li6()2kR@&l_?y|wGZQBSDTZr?lU|>zjPOkLZX@!p
zZ+;8g{n%=B?|rGN^)rvqx|R)lzm}C0w1=i{Fc3&UxoC#)_>zxLvP=7U_zw3~rv+3h
zEoOhkLhL2^hAIvT<7UZNGl3#F`gAfn<vlFsFR@5w%yH|!W)upcUW`FUS)*k`YFy#n
zIvius8Y{PQ6B%m{m>}dh%&&J7zAMi!V|6Gwm9}9MkHCv$qdH)xeZQ*vJcDWkZAh`4
zPff-VSz7(IF4*g9a?6e|O=hwoVRNK(K(o#Gi;|CVAQauv8VfA45)m}G7n1Hxgx|1#
z{ZrRwZ`)z*+l62D<8anZh$zu}|888Tk|N7rQ>)3*&kmp1qL{>xA)+lQ_<7}+yoikj
z`PcDDs!iEUQ#C)+F#fzjzgXa9jGN3~K~lMM<B(*>QHqRiPs>P8_X^I$g_vYldNPVa
z;B{5vUWzf!>7T^?SJzGuCH!~yD2F>a#EQ=gqCt(>CmK6E5PRTpfzP{iV6ULlDVT5x
zM#e@dI;;T;gQiH!F<N!wYc^{biAFY+ll_kWs1zKqZw-~7-5raehWHr;)kS`x(Yw$F
zA+F%c<O+I*J$CEgyZ7$v{<Z|~+uaUTkK+ltk$@sAwtoiof^zr`m={OlFFgnonkPOv
z`Ov<Tg28K-@!-vuF_)V!8K?vo+t8qRQUv*JFoBStq43fHn@y0B1+*5MrVo|Kq3v?7
zLz|5O`@MIR-nLO}P;G(;4p8wUVk5MjX6pee&aH-ImvzA>=BcN3OEZ>6))Pqd4*v}4
zjg7YNuf@?X;=-Y(Vws?=Y}8GJ60&$#ao2v9(H@Zq;Y^7xLrh{Cy-A<!@9ZyB<||(K
zEYHamK5XZ{6bbS^N`}5j1#rpjpoKy_hG2BxFsDn>tcd5>E%1{)1W^wr!B-5!;6K%o
z*JBM>&D&uW&hWxqqPONm63g=6aAk~6dDw^*m{X&Cjg{q=JAgANb@`13*>KxsZa@}d
z_XToDuj4GN(<~64vefaN<hyeVE90o-!{GJQ{701HBT3zV4+btj23t~T2kgM`22FXJ
zzxkB{8~b)V{Sn2YBFVD}w%@Tj4~n@AirGu3S~(ANl#i^e$m+j^z{J^kevIXfj{La?
zIT(ll68YWk@ON8XO~#+0f)~fs$4hBZ44VJc<@3~p!6cFNr;HyIMB+pc60nMOXE4*6
zie`w(Rpc*vj><%g+%h#J`Ev*UH#L3ot^gE(vli>E6glC#=F37r=Wi600iqVK3gMmi
z`G!$rJ+@|}^lsYEnaL0BLcbh!F<gj|F^yed0?!%+z4YH<4RNPf*+~-#GyOSWZ@9Yr
zrr;!RXGJ=6Jm3;c+>p8@5yDi1l#0|`LY|+=3c;o#H2uoymF+A@jUOCO_kH&L*}>o@
zF~a^NfDC!#Pm-eOIW+QCB?h`x1?{Bvvi~2ncpN#rVqDBsR4@YOm~IlPv~16rY1%XU
zuN{L@E09C1*W=S;95+(jzM};EqAbhkW(mK|N9*+V_p2ZyxS5AAmR8-?FhOji9ri{=
zX@#Hu+*CiY@rDixWTJGPoqxt8#?|K&eb6g!`nA(CAJ{pzm<qq?1#}&hVa*^?fXv`Y
zDL$?Pb5s@#Mus%?h%5#F2Y0i|l-S&EUek)@xzKoz1pnJ62D87H)S~j8V!ps|`numc
zc-q^V!`97{pjB_&KV-k#fB|Fy$AdoTIDVl);%bZ{6<r(Z!dzqX>b_egpL15S6-{JI
zOaF=I4*lAGq-A(@gWn_+KNUkVW_omtNxzdD^VpN+$|%P>vvI?2n|@NM$U?zeuC9|i
zM<_6C>`&?R-!Hs|CJ|Sg)nuASit}MBB{CvP{Yx6zN$(RSY^?IIQ6&aVY^_6kMm50u
z#nP9SkP`Bn*vhWy069IEJu(j+>tAhY2@I$iE{b}jqcmbr@d}dU{2E6D<_Z`3ah%fE
zdA8H`{gsZ4yf<tfGdL=wq>A5NzqjV~-#gy-8~omL>9$CJb^o3T`b+eD^eWlww#~Y&
zmJ;#Plu1pzctWTnlJ=Uw#{4TyweTRH;nx5!F)?E7$%@NSrvk0)Z}XFN!@e9Ca16aq
zVXSk180*MqJD&@o7p6QLf=`|rtD`F;b1IPr4G%-PGGRe09fw`1<Q%A+!f*eC^HQ-^
zL!jybKdJNwb5ddI=#jnQ4I{+>$e<sc9VUHc|9(mdj40sM2m<lSKI2(3YOLWv6^%Lv
zihUCrNVvVCvPt+-Wu)84M291JsLSEpe>7d`Wl)Rh#t5N&erk4C!uJbD*g}&=zI3}Z
z>^`*e<;ZVO7J`o!ME|zm)7~$?rd_=iNeaB~TpKN_S|^Dp(i|Q=L;NgeN5>z@)~bsr
z$Vkx|iAQvyHn$r_p#EVuieSuU7LV&1&j(|o-kgZCWT44m5(SNtTS&oRgL|MEo7Ac@
zK9ZZ9i6C`-f1gH%{rPNPXB7&nKI>v+OoVhupM5QfUrRY(v}7j@&b;ljh;2V61hpUv
z1h}XxlMJl!DkfT0X|iv^(5Eay1?&IZb2KW3y!$MqiXq>uw56XeiJ3&S4oNIaW@=ov
z(=-t)tuPw6jkz7i&oz&;vI<KtR^$MZn;oW5@at?Iv&^`&v*>wdKB=tIpNoEPy@F3S
z{{))v_vR~90n^<`%*RnB`AX~1a2$THtZOweQM!`+@*hf#xTIyYV9c!Nc!Nv`GUMZv
z>y|b+C1uG8zKpuVI&wqqD4YQ}k+n46eK5#V=fkTVNa&_dRZufbFIs!3L>L)|m*V+c
z{=sFm@7ews>=omBk_d%FZO65{mlYTqG!=U5wY3k>WNGXa0DlriF!;O+dv&y_FXK8u
z#glzOt;sHVEZu-PnQNthwT{9_o;Pw%iWQ@yX}>(pL<UF6+K4w$(*j=;A@utB)_jP+
zLSc7bQOS)!XNoveHOoS6NJ*#6U{NjaaoNZr_Rd?+u6n^WPRQ#g<=cELwCmTIVhkb7
z{E3D}guohhD@t>7b>c(2EZPlN+iK7ueG&bmq5z6}<B?RBK2!FvyBbB~<48gmm<#{x
zrJ>?C1s&Bg3te1U<*gm*LBr$KCUKAE^WvNW(NHP{6G=oyaj_|7!A(4}n$S)LUT0CY
ziotV|h@tDOHeO=#BBGWRqtpE3AOD>TJ6hrhGs9*!<-53H#tt?bm}8{3OesH-IxRf+
zXI<{JDP`x1{c4171R`nBhVqors>tE#9-z-)R0~I+XUH;z`SUXb?()|>X%QFi+F2JW
zGtT;$ORM=8Yc*Mup!^GPnLk6B4Xpjug|GMoMq}1(GNH|CqXhZ24^85QTx-1<M%tOg
zmdVxwZffKxMfE9$oE$HxP=31=C*bFXenS$92a4(-IsK95S6zLCOn){HXi<BV@b;;o
z*78yV$$2}MQZUu?GQ&QkbF>ekHEFap+1x&4XW4{?RKY=6LB}9hszo^CuEvQQt}Ovv
z5PSGngMwUeWMTGDDodH93Z=$1mZA#o#cer+ic(zFGU)Wvc{UeBeq=RJM!DKb4LN*E
zqY^7laYiy_+0V(AdiN_fR`4iXO$9i(mJoCQ@McP5^%kLNKT5bEBuQj`h-v+D^+=-f
z6mxqoMGJKbqul5npL}0!u*Bd)SqiYEjGmuE{WyUpNb2%J>0E^65$B0{WItKH;{;Ok
zM+83xB?NMJZ}$hpW0eafcE)ChV7)l`9A|vxEcJZ_<W)$Y>>-8%Z3X4+?32Mu?~$ye
zAp}2d`BNemST-j}NaI5GSF@l(lpw8YCe4u~ShGZ3)R*dutHR-kC>G3}eAQj7;1uT@
zoItpLW~&bPWOJ0sW<&Ogfr7>#GeFN!FdzjgsYO6U$BL915Ex}nqVOM2SFF;{A5Y|x
zTqhzbKQf=KS=mt8fQfr<TfVs`V*D;5|7%YDy|RAdPvC3@56!4@owF_sZ&YlfqY5$i
zatg^xMyL2P1y)popz4wspX_)1C(grGxQkqS831i<+k#;n<`xRX{Mk&{T9w!0n~oJ@
z@*qXaY#O+&dv_G%R#0#3t>xY9GHGT?nZgIqF3q)ZAxR-~p{<qVXE+2A%b?jCGZZIO
zdnNhhzgCxW27IDa<7aBDX{P*&YBQNxy*tmg$F4+UlVWC<m-bKuV_Q~IqHnyk1{vbz
z%zUfGdt(ExfN0T%t0Q(`8lDz0%0%Gyi74id^3~sQZZg*de!tBSZjRB_-L~9(9LJ%a
zBM55ppb&11g75ZOCLw||Bo8|*37N8@vC@s_RlnYT*J(A9B;d4KtYv13v4d~M#?WYM
z5qbHv&iz9lIr|3oHcixeJVDA66a+pk!zpYY(0$Od&VKxyhwXRJsI|sQwjqo+E+rJo
z(kT}i!NwFkw=l29%!Hgdf>D_vV|S*E49q|CX(2`2&dk;Mmm=APzgE!-)l-@qt5?Bl
ze;R*;)Y5@2c(JlOs-nb)JsSxE_$8<Xq-r%=a`tkNpJvRHKSSI9Z5X>r_V{+-q3jGU
zxeEC*!3r}cr=lp=5%W8<Fi)k$(C_PC`wP=u+d{dqZz{w+AWxVpafy<r=i$>UR_8^O
zhk$<MQ-jv*Fm8>dPlh`qZrEHMHNaXY%zsn5E84-Fvfq;Nz}bct|6Bqt87!elMCENh
z6$~>7hc>>@OxTj8*wUAcyre*gf5uhO?yU0k^RszAQKh_(3It@c6<lW7S$%~jojGJh
zI<07cHaag{6X4aC9>LB`$I6Mz+BY;+*P^cUD}lH(G>=^-kv)rLMQ*b^r}-<_Sm2G4
zzyf813+~0Ky-aF2rb=@-TQ!8_5rv%@MJ-J>nEbHAtX>?c{)A_gF1E0Wp+uM*L|<lr
zeN?Ywr916fne2>J-+k;9+nNz+@lp#*Tl1wQ8>f>IZ?iiGK_o@#ZPBXUdPm~)5hUpV
z6GaodB`uUyAccYo@thj-J?#-3&ddaxC5+|S-*h$`b92jlmDF5K9YhO+?|2KWtofFd
zkmjTuvgpi)>a`(}T_(k!4*Ti({c!%~+@M)=3}C$S*<Cp~-atO_G3F+1NO|dm7$V)b
zkD<aGI?Uq`SN~Gct=U~?YSu7fit;lW*1(xW-Vdc|yQd|tIAkO{%1clMkl||X-^NSk
zlOib=?}9VMMu<N*at*(O6Dm*wFK!Y;;Kgmy3gX7bDq~Iv(wf@ai3~=X<bae+jDo@J
zvV`LB5Vwruag#!@RJo`sU9(1;qr_T>49@7$a-42SAXbSi$X}gkwBksw_DqZRXN53?
z5=2o#&AMOvq?dJrMm#AeL@{#VStx>{RhrVuM$R>n13Cu7D8`fDSrxK1>5JBs;-OgD
z$LY$Pb=xT$MT;agFHKk2NF2bJCIIJT2>kY%(3zcAzM$rxUE17Ex&_ZWgs&iQ!~$Qc
zD+RhHd*#HA@iHbH7UPVq8(16kXmEJxFKpr5<%p9z7Vobw1KW()f|4M0fe8yJk)F$C
zslNZ!U?{)!4REVUngivhC+q2@=9fzrKTog+m8mEpSXN-bARx+%!D%;UFv%~MC1dj7
zIm(`)W-((%YJDgBVf3|@tI0f2D~V>}m+_0Y`(rl#wGkXAHiBIbzXC@Te^L$##&lMo
z2W?lY(BM_HsdqOoc}Y64iKGE(ZIPW{V4gN&z!$R1Lzsj@=asM1%-?Z1(;L05QobkY
zUuBxnQ#ZJA%pLy3OV=|0NKTUngo)LKjxSH4s++0loaoKiU%K(_9LeCd`KdISVsi>m
zC{5ln3$7?<sRiYW!Qs{A)RN|u<WgWM*nbH#g_o03n{DbvO3~QlTzn-KFUE;%2Fp5C
zp7?V!Uef__9>F3YLT62@p-f3eF`&2(!sYzc(tMVA+}AfC>7Sm<<}=7K8#4`~$hydb
z=<p?Th?19rM^B<?@M(WpnpkMnRSO-9Flp4vLf0qR53&BjW!1mzI$lyM$b}#a{kRwm
z9xJji7Ihh)M|`CKlWfAWq{X%BC4teFHBtg?xTJ&(HOETLx=#ufE-v57cGZq9Mo5$3
zt|ah>(265+CnGTpDX(AJGL8A7rw$KuhNoOLlxcj9##$}ZVQhsM2zFt{yj+LMoq(?0
z=~O1V;+uQFB|Y)Tw0e)sgMgIPNOX$&z;}e9!6Jm9b~N9hE}39Qs>Ip~9{?ld)_9$K
zxlx>gJis)F$>7#b*P!&Pz}SciL$j@qx~<9eopB)UZaX<oAuI_Um^Osht*}$eEKT+6
z8i*H_Z7ZBI3FOE;@ehQ&Y^hXqe_`T+v?C=Yw8F0XhRPNT^R*<}kzCwghj#3F1Vb+W
zM>0aOA(lYZN_3C~nb&LZkFC)YtAubPpRm;Ki!yMX!2LAK=D&ttqY(<2Sz2sR*@{Y0
z=;WBs+7auZ3^{+xyTUkOZs-k^9nUm6-DN8v(jlG`AQTj^%z|J0gdXYR4sGYqjq6dc
zSc=WfYxE4D6?|+GWDeliC`p9_&WU!1snl~WklZVl9ZB+8*D#^8W+KG>bY01i;yfUE
z`}`1TgchYk`btdhkU=$?{1#JV^#uwrjOg>&2=+#>08N|5(qIa<PPn=vfj(n|pH)j@
zTQ4+u0Y6wg5OFjmD#+2uP1;-JHRGc0FtKD%k_i&T{wR~Dd~>l3YDAW<YCJHlB^q_`
zM9zM~`2;gY*kqK^LS50)>uuajP46OZxFh*IWl?UQ+DrjL?l8<iI!8q0P;`;X{F$jB
z7gMOPHHOhE@4k>B?^LKHM=*aai$sIXdv<8Z1yQ605<<mzqQwI*Uk(LjjEQeztPg4r
zjB`W%<DMm@fkr<YRc`R`649kd>RI7Zw%~|Xz(j7A0+T;=N+qbbYre63;!$X7K1dtk
z+Q^oAh{O|8ic==?Cx$dLr)B8-TQJB7^1!weX(e33<srR5DPRjM9M!?y!>X+AhEdZ<
z4(e%pbQp{hP?QUxoFi5GYL9vk-W<RbI5RjU<sQ5o_~0zFG?y&QM3Rrt;)Dmm;jTPs
z%O7Goywn*XqSdHnIX1?%EC-)e*2^s$Yibv(PZGdS^E|S9V9xeWOQeco50-+`@0M?j
zl0uhD<oTc6KJ{Gmj~vpt(k-Z$>v-Gi&<(2!JyE^xV7XiqHm~A==l(N%KqA9_!Q(f=
zg%~FKeaf)RmY+2tXb<C$A7aUvv7TWRwrA|FN>o{i9BKv*u2jsQd9^<A84pF03mSht
znSQlUjL~s{0ly2#oE(-I97Z7wAv6r@<4jm5fx7ug;-^msP_i)J%iBbsUbuWyXUW`I
z7uZm+A~u3Ub(KTs0<eO!;O@gt(uKPEJt9#45L^i&fuuctWWB^}V6guAhb#Kei;lX}
z7!n>0MI^}wvC|{tJ{ZU_Oh=I)XrS*>8C%Qq5Y&l4(fX!?BW^}27L=`$zb_8c5YJ8K
zM-qLQq$@;|97nlm4p9I=bf?Y^YpjpJ?$_j&Li;(=N2f8)up&y@BJK~43QZd%hvzD=
z5i0)#aF5W0(P$qKKi{o>(naGOgO}YVif9~Klyr(tsU)x(K{c512npNI&~8pbT_G&!
zZHz0Y&NKTF4YQhr_v3+(Qi$`^J?uWJsd|(_5s5*eFWz4JJN9t|800X`+8W;_$AA?K
z32AeVeO7vM%gys#m33*Qno9B@K22*70s$(IB8g}9t{Ewry05Jo*@fxG6^nq*sW4o`
z=ot97mub)i#I_33(OKO>Q`#L7uG8sO09|naE`4`WWOUCBl@LrJ6A!yl=}T>Qpa*Y=
z^<%l%Wo4W%hZcb|{z0*adg=Gyf_wH`m-inzF~w3q9C>9P&wb>aI_>2PjJ&QX24XSJ
zx^hmyxT;~D_wd(g&H1eP7cY#P9k}Hg$nT~~8e)5f3v$m?hG1f_V&=-8ts4*<@t$1T
zqz?-x{7I?8A(*r5yIbShb$+DZNgSK-EHEI)kEzpp>$#jt4h)}4sM0{;7ar~yzE?{$
zGSQqUO%4GM-Xt`tEnD%~PCD5s;*(<Cc}r*-m;ed-!13+rIL>AK_xsy#Rn{#4sXaQO
zq3>zNybj=Ud-yn;oKNJ62vy{`0t*Q<jA)p>lv|7%iFuS03t!K<=fa6*-MP6Bv}N6!
zu#;kGR&L6&{3)0G-sWmddtd0d^<7&{Bvx%gwO9j%<i-_#N@S)F5?I(qNlAuh;lpwW
zIPwu>uQIru1WMC*B^yh1O(TmkT^NK`y8f}gIL&6>Oy42p7Smu>HPoxI`d=;p(!p7+
zF5U(2L7S;DZ+XWgd2XuG>1h%QpxHUnuoWf9Tt9i%=kI!&boh)E1`@b0SB&u-mj%FR
zAK*C8=Z~Ct0A@TnAtvz)V8dDh3B~|3Tr2VEqH$VZ$!8e_7*CkE=Vqs1_pn;1XJ71_
zlrJVZ@rHx#=A@9yDMJ=etByn@4o|)tq*~=RYY-N^QUvC-WTEImHn_22lM!`{r8<mO
zh)(t>{Yxv@Onk^C%K0%JlPlE*=X-@ix?AP!hFK+qqCYUmv|8~P-whT~#fJKfkMo6r
zg}|tGpF2|*O5cJtsuSk;SR{F`ca|iQ14ya+O;uwjjFjqJ(`T3=__i;|fxnNw`=Rn#
z?!I#Kd<NLCpLSv#yo(ge&!1-{i2y~EtV0h#U0Y@gyc!19)j>EWh>_k$abR4RqG{ta
zrYI4~FHs)7D^)|28a&?pQL;n^XX7NwRjOh15yIk!>l|y;GRJ+vrhO>C6|c!q?VM^3
z|60-O7&drL2;vbp%8Aazk*-nrU`O1+maEW6#I>9fV$Mkm#2=}yMsNfC_rD^$uEAQX
z2lrB2A?L^*>QsWxWLVzDYb|%5|46GwwT?VJWUBhm1^o7V|M!8c^F7q?Jp{7qZzBLv
z)i*@|9tTiA>0j@ceonAd8U!KPpa994YEZ;SZL{hnH}S1Jr5OhohCCqVEw=&kpD6Y;
zyYQ|d_>2g$ZxlzWtPP*9MR7(|K8<L6<9^Yd@-3$v^yBXhSwZ*{%Un9@i1+zZyArnI
zU=N$~c#<vb*x{h6D}Dib!nBjN^~0(jjiB}g0tKnw9ia?l=dl_KMw@5}8udoZdk9w%
zn_$$$5N&(1#1_7&ObwAYKo%}Lf6n>s{X@?CaX0J}Jv?g7Ct%8M#OJt$lW18l#*viR
zWP5XUB2Ev73qcbaQz|iM7o2AU3gJoKpV=$waf&5~R5p9LpUk$s2xMiT3V~X_>?ky8
zF+s%tVOb<UmX2^a7fRYSNUuV46-;B@69w;KI$ayjAsnT@6du#ABO41Nt&$wofteOf
z4~l3f{=xR%6QyBWCHe>hF(g8e#0#PQLlicSkoRFs(f7~G?eu$z!81k18=%Sg*s3E0
zDTaNfU~GCCrnhIqyD04MkX&_ImV*0{Z_`T}iWZEg5WqWRBUyeu*z9xvwPpZrO@W$~
zglN}eN;jqGm(xoSkxjuXCK*;V%v^6db!~pGu`U9Y+a!_4ZZ&()X!yAZ*hqwX7|Lf4
z^$4hbbQ;ueU_Gj6c_(4g9$NYeWA+rqRVK_Z-fy>gegN8d3&6EgW7Y>L2gd=@t&%kT
z4wvI8RYm@LKos(HVIlbI@->I~XV9C>Tcq0uQUb2+xgqcE@Gobra6)vrxuU@7JK9DS
zjy4kJ%+?;JPU*tR5vCC-I)6+^AI?<xn$qvCvr<1pGvW|C4M)R#Ht%^{Cs?BgCIbMl
z3_(_)m!QXI3-;u;EnVX&o2rIRMQWxO=7>%1JT&i#k4O1lxc`lK+owPg!`>)5?W$d=
zsgB+Oao70b=nFQxe3WblIRSn7n3?3i?sC`ObJ&TO**IU<^%lF2q11VlS_EC75g2v)
z3>}yCzJ0J9TQ}X;0Ss=2-FgedOW^<ucQyIPEc{b+gURUU7&DQrzAreNSQw6s&BE5$
zDLf=NO{R#6GDF>7I+Ov3*rh%?o~rF6wQ9dEjGf~%Vbm~1P*57nohmf+=xyWUF7k?g
z4I6dtBt`Mihve%ip#S*}$2%B8P>!eY)z(>vFN;8VveAO(u5&`pvhpdsvWdWob~uc`
zx|jL>BLki+j_=P>YmeKnR0b9wCL97TN6=3|#})d)(~h9Z<??>K1~h3O_|^}w;)mOS
zdU=m*=!YaB1RXPEiR^BM#>(OLsHOZOVItjp^g`A66qc>&XT;wL)qER`OHKH~s#7e?
zlq2yBs*48nz(J9Q2w$*}FxdL=>Q{XAm0JyVudm`(!vCnhHKg}VbjKGOOQVe>vso#Z
zZmGp9R(q8{mP*1@I$ibif&Ep&8*OG%*4`hI^iENcdzX4gtVr#mA_9C2;;2h}&s%-z
zq%Dr{9lD&DaJv3&{^q!umMP!t{I=~f&5y0;I?K?y@#l!M*VEnIoxP%q4M>&{{q&It
z&VvvmF<VET`2;CsE$k#687on(KBh&jkmk}JGL*Gp5UKOCi(hVKC?>Q~ja)s=?3b;=
zS2`m}j26kFkx_hc^gi;d?Thx=N8d&GKEG6lAm;g)sMb|yO2|kT^F;iogx<CjI|+6>
z&ml5(+nrKX(OP0X2QJqyB0Z@J+A4+vHPyE2Dwz$Sq~Wn3zsE4YM?hx*m{g?Y0Q$4B
z0zleD9=>1*P*8~;e?o5oD#0z^f0yu7{p?KM0N4P@?7!l!Vf%hCLJn^AU<DZ+<j*GH
zp8u%mjaEYs;u}cVxPN6Vb(KsS*hH7OucR5l$}l0yj-9lyXWKg-$yXx!M2Gs627H0H
z6U1njZY8APE)Yd2njwqbF*SJ0>dqRr7m8w$g}RXB(Ol@pgkXcxjaI4O`_z<u#=~pX
z^oOgEscTBP$XL<c`@)0>T#393>%)fu^x6Bm57OWp1N}tjv)aZkIXKw^;gOwes^AkZ
z2i`awzF8+V=Cm6XRG@u(MO$Anp}CV&JYAfK!man<wYYzNh?tm%e{@}!m>eI*(VDx)
z#OhYw=Vj(S)mD;&y7bUwm#;W9S9?Xa3F3Tv9%O}AUtM{%!t%X+)#p`?j7KWC!=w;c
zU8C-ZZk}-koUV8JfK2GaW8bS|_sg{uf;nw~fBXI*&$+3_=LFDhLAhQP+$~q80Ah)7
z96*dK5S#gnFBzv~Y05l|2vLV8mZ~>|sgYPMj2`HDj-P2XBn;7~ZxBPuG?Kw2;fZ(9
zJgvIukvPA?^$mjX__G>JE$a!tI*W(}FD4h1lcHxYw$!=!+6UzyJl>9uNd4?BZsSY*
zA(QY0Z3*{d&O*rVbqBmxsLbN@Y24ml|NaKrEECQF)z-IdACNvkPp%PTNJ9h`ztkpw
zPa>8YmVV3-lpLfHP?y9?YD20XA6(9JrA4ldqAfZN2Kv%>z2hGjXzmZP+t<xI(SZNj
zoZ(2~!f>S>fG(w!f2M9iS)ap$iy&7X)1Y16VOSnSEQt4%vivu^OX~F2B#{_L!#_lx
zt!r|2d~~Fc&6V(D+3gi*lwlUxPN5mbY$KHbR5b`1+4pgPXiCxh_xEl19eD?@`NU;+
ziVyw^Jr0KUD$6{3i{3uUl2j0Z_zQMr`51GDjAuxoUor>^eI3(jsJk(TWIdg1)4E>F
zC<WGl@t<G;s1-k#IZA?i@qk2(oTas626c%zh0x9;;3Dr_Y|oahxaUh*eQEyz@wZt6
znGPtJrH%eDr8<+QMOL4*(=n<X#+TK+*Hu7kbs)Oa3#i%o07dZkhYRV{tZR?u&aL~5
zY40Pz`Qifz{2%Sr(%b)OuK-Vls}JoJz!$y@v>CenpUM^qeyGs01{1O7^LUcBW!&&+
zBMMAV@oF7e3mKJeI`1&SAK87Vu)O>#!!v}|bojoNI&BOltE|a{Zzvokubu}GtP=Kq
zuVBVCbPAh^YW%$(q!S4I__?GSw#6?JOE$&u%8mdfu%l^v!Fs=l=+&}!`vWkY$zr?O
zaQJ~ZZa>cb_W%f#JONt=K#TuSq0xN?FrC})mvjtnGnc&q$hN`Q8Y46?hgBK|LJZ0A
z9*5&o{RoiFt^TqKN^kwLB-|~Vf3jH@o}uPT8gs7cs}eu|gK7WC>zon2B1xU>puO4j
zaEf6RZ5ybOddS9~@3j8!!8>@A;aGt>4+GsasJ`vh8S%4d^t+yTcNrQXk8%&v@Pgp=
zPw;<#fBU_j8@vNA>Q0Jvz+3`osDFJ<M2XhgU5*LAZQOjQ#8PU#503@@w%7XJSMs{k
zmsM-Z<_}F{EE{$2r8%^55(+2eGeNeT$aIo;k+(EraEXkuJi4};Cg#M-DP&xxMS%KA
zc(w4r5$2SfaVg~ol?bp(HROsnD=^qGl2|<1XyhMU<;UqIjHc#_<svDEirJDmJV#5?
z5sI4xqmozZR@>^bUUUm(RCaFt!!ZMreFQjAjR$POYY3>#&<b{BgGi}NE>F#+Jy%=~
z3taKVsvz{%5yAS3Ey6TQJuV4Gi5Lk<kh`w1He+URVQD7SAtE0#d(KMtLmKnMYulRM
zw{@b<nZQ_UJHG)!tiAW=5Wf0bVD{}9@50|~9jNYyP$F&e_gDh2oogARr^0BU9ek3;
zwA(+yG+y*yAnRgHIef6woq3;#7GZg|)SHg;8ticqKewFDI7$5_YD5t{i!Em+QMuA~
zgsb^W;(TZRb?x{5B=v^mvD5A@0Sv;N(SWsrPx9zSwd6eWmSGanIKm{e!<J9m7ZXgz
z3NJBL79ucB`YZz4={l_LJu%7>*~aH2kP=N*iSy*{8R5x2F+MDrx@_%u?dmz7dY1-I
zB(|327YePukv_U)nUip0JFwI{zu<e8qY;ikjUC11&o-{mUk`rKGbnyp2`*`3En&da
ztUjsz(E76(13_z8yv$fwMJqf^j<d6UrTt)-7!P6yjZ{L6-8FHWF&9zF20CbkR{1Zo
z+J{wNDIM&QPWyzVYN$0XV6Y{Z#<731j|)oFocs*z#1_ySU#>z|uF_l>D|~5_CrOxJ
zvxU7uk9#H<YY*vIi$(DDRzb`=nfdr@dMNn`Dsi-a_xWv!?(`Bi_L-r(p{(kD;|FJB
zoN=)NJN&HnpDaYWPA%CFI11SMq)p6yPs{172Ab0SsaK_^kIn(`I=Fl>F@Kk+xAN(k
z-;3Aak+L}xk+`3K4DbjYlU>Y&&ju99UXeK=u`*6yq)S(G{8mkD-;`cbN~)6x)<yV&
zKxB&EgDT-aV$a=6TaW{}{(XX=x&;S+KPVKQKM7JkT{rntok3u&Qdhb4jb`eKZeOU|
z=i+VGKAd~yl$BT#+Z1L=mf<I<eHXG-1{rkzM8`EC;K?W3ZG3>q!xnJ9XwVM;HIZba
zg3*kP9cf~ZDan6;X)FH4ls=~nXJE>vj}$Y(xuTxQ)gsiGTC)>1G{$NI3&S;jvw4`C
zpo1^Oaz<;7ui9L9{55D>Xua=>Cf*iV5@$AeFB#OH&r3C2){1xDg@qN(5jmuCDmCc2
zXZ(<qQPx2yQK;{OcLu}*)|ehF`yVo%-~mg)CH%&E!rI9Qud96y)&35gH}eRiFDEez
zYLt54n7|*S*%w#0yaVj*uXgff+#7Z3TCr4urR4Cg=4d-k`HvM^RF*{a#ueEcW@M0c
zcNHkZYO5Zb8x0TE7~ZsNFzHKfhUf5vd8!~kmQ`a33C81$4-Ob~naS~eD=#u>`+NH4
zeb)3^rnJvl#e_^8E#mYiDqI50ku>c4=kM<iQ<P0L)|dO!E^G1nz{aOe66NIL#_$1U
z`CqSEyXx0bWeC)4DQN9%>Jr*;H4MU&p$KBlD5PMKs3x8zVaS3hI5-(-(i0)Ope_`r
z__Ro$AuN2W@44UV9<<N3i2h|Kv5iSLybH=SOt0G1Ha{q6y}$Y`VXGFK4bglFd0HzU
zkjv6#yR>Vbvo{VK{yvG;OzYZ`^EZ{tm51mxioomYT%DF$%-7kfu|b=!`M{Z>5a&xH
zoIgsSIa`h}iBY<>z?X3}BKA|ZUk@^?+YCC|PVFw<q%>>z<7lclKPDC@9ng);<1Iqx
z%2s#vC4XgIELo$81!PGn6HnD|+e$d~+KpC2)NE*+LS15n1zGBp8D>2SimK?+EyJio
z=O9l79!~h6<8KwekL6fxP1G%p4%Rf=@&!AqHtki3{RRA%*BD0i_u?+`R-Im>?DQrT
z?n)(<!dIzU#-b^s_$gYZr#@qg7)x$o5XMCC{KKD<q%BDvDT4o1POH8&o|c?hlq0z&
zqM+S#(L~-7q#Rlfmzsh(5*LFN`UOUL?_%Dl5dIJ3tY79L9vdY7ZD2~c>H6u0WUWjF
z*2G)#34W4d6PkH)NKK$Apye28W3X9ciF(Hr2X~>=oF+!7$f5s}kxXK0v0b?uEY4S(
zp27@$DV5~>SfGm`3l?wGuWpU&r(Nc=8N{wx&0bsur{X2}RMR&RJ^jbRXWt!*UWYh1
zA9u_!qe<Cjtw1dK+#_l|>G7W5J~wiT1{R27(l%nkismrVjSY(Ukdl3Wwh&NUvc?YM
zPjNrWI;ZwCGUz!$B(?3V)_`D4E2}GswHI9N<(#eZ9$s}=kLR$@Y#<c3GS`%)%U76K
z?oGtkSl^;JA=8B<W`kR!x;(J{U3d|gB>bor#<t14E@Z6P7G-hfn1kYk+I_eF+l-QI
z&9Qij10mkL0uO@K?mqG<mQj`0Mrnnpv7)e-Fm~OQ@`ro9S7UWcQ%lIMSJ4;^r_7IX
z;YrABy;M7|&g*Jo!2;6yu?Jsn7)Ulck!3dgg=h!yi*+^PG`Uqe8o`vs#fs%A!i#+`
zEA~FPPa-hdN_i{SL+u9ZGMQC8gn0*lLN!l?i{&aXshnQ9w5h<J5Q@G@%O1@|hSQBC
zm!;M`be_VcHH8`D%^H6Tvs@yMsB1%TsWgnb{eGp8fu}NP$wf`!;eYmvvJk6_BY3)R
z+v81Ss!UB2_pAN2#+3e|Jy${w1ES2A+kfpcAwy<c1cB6z&$7wm1)e(+x6wQI8T)vH
z4!dn@p15b;h(8-F7=8G(eEwj`<F{Q~7<xtSla^vnNnK-2d6QhEl92WKM`27>SWAlb
zn*L&BRQ}PhC7UH;)Tpb?yxcSVAcB=(tcPus09A>9XD*wyTqxIgZDyJ?xRu|#?f#>(
z(#=tqe|5P)6F2|yAH?4>B(g7Ap2Q5asGrSqt&<Q)85Z81MT1=yqg;~y+#VdvSn4}e
zZyh5Lu{qS!Xu*7^2|x+NTA<?acDj0BOA@8?e^OVGHF)$fOwZmr@h7KYRyKpxlK<0T
zvslQ6VriG_!C4Ake8A$4StlwnU`X{;%${%_BD_#OcsN`|Sf;H-73C4raLBWdj(6Tb
zMJTCtOJV@~M%>pOqC#l?bwl~d4;G2h(JiwT%N#D!{znSq2zQ;*@5~OA`$fv{)eFM6
zwD7?wO+Tmd9T{sWXwBvXR=;q`{cOMM31NIOI?#}!P-pPi6PHQEu^YE6$Q4f5$Yc+x
z;(dXWwCR9~QDTY+Uu8|7mw`cLwi)}&pNwJ2r6X8!#g1<p>-v)}FOiJ|`}C_#KgBm|
zMBQQkmVL>r8Qt2%$YO;Wk2Tt=v76H-h|}st=`x4O;-n6J%g;(eFn!rG<0e6BCGt8b
z0SGU-tlm5z&Cv*CLCVq@at4vOgnd}JxiMBu1P#RdBHKhrW!JC!jR8r<?!0R>f^_sT
zQ1u*X!b6GBS(n+r9xqavRoty~MwmpwJ~4XYOEqQ4z%%;|t>j9qvXfN0Jhj3X3gns=
z_Gov<p|0pMOMw?C*Im$P*|TAATR)lS+NlgA%V*izl-x0*2>kvdrH3}OaDVg17E>8d
z?#)C2LF5)sOg8EjCd#YB!=aP+KH;*asTR9H5X&a!buxK~&&}>Ww8Oo)^7~dzWn+`X
zVdQ!!T!pvm9(miw-E@suPIx%S4LK_FJZ0|17YW;ON|>$jl7LOBpE5)2=Hs>T&;3*g
zS@(|?JCzp{+`QE8+0f;5-U;oa703k@+W&5C*FE*H(520JN%U~P3`-xjOStMSj!c$Y
zmi+D0V$9WH=uzblUWC@#-vB!_|H7v%rM!A0f_NK9*vsEk$e?U{XbJ6+7?E!3PbF=c
z&mk@L8oe3&vk*iAQC+TR`?$9;bj{27R2J%1>H@_gqp3R>fI!Z&e>jseJYF?e?Q&Z{
zAdW|ZG&t=`Ug>G<P-Y7y{`uh@4wj`zI)+pN4L>4Dzz{7_8&5-ykw#;QB|@%tw8P7f
zqf&<>t)<#1zbL3FEh0TCNO;SpXB(jzTox%9Wg>`jmh0R+aP#e@sY@5)>#0)tRvEvu
z5302DH;!d3OR%_#``DQL$^H=O%N><^NLp3PBiN2C+9l!`u}UdZSqzfap+usedv~-z
zo)3O0lTNjCz3Z8)Hsqp<A;)w(HHr3VQx0}G`7agwWB#L<9rrC!u~wb(&dJXpp#?U!
z9yK8tVVg7b^As}MHL9=q{fP?jWZ$tf@G*awVEZBz7S%K_MdIk{V{QM+b}qpm&?ueH
zi0)qvF5tmx=A2#H<0$ihNf5+Jl?V!&LS3S3uBT;2qay3LGQ#*fi&BC48^$PR-URlu
zx0NINV@7CH>$N?lF;>fn-#$O(7|L&}XM#^ky60U8Zaq+jPel*;Fc+fr(4x4rjMpXn
zf%-{z9cCCjxW5f;SD3KhWc#CQC^3*&rDO7!MV5%jGT6kiDhwyGxs2upROBp-9tjFt
zKUIcI-PGgL7m=lm;ftpK@G7tmUx=)$_wtTt>p)iL__g3y-119m6Xv&ZVZs_?(jC&4
zo--tf4h@DRol3lGW&+J3Qs<2H;iQR4jhA0uV1KuPW~_BX-8uVGj+I)hK?#E*{^0qg
zYJZk6-goaiag1*{yP4tuH%|TUrc-oGjFiUP5VSG<Yrc6#o>w@O3GcMMjO3~JM(BN;
zZ!8g7^X9gb3Y2&{F12HOzir$Pb7?@8STH1(F*(AhE5f9IN<~LuM2vaJVPecjyp+h3
z%B7_{alkv%%B-q@{H{eLb~N^r{yX*q!+YG{ND)J;!oLkNMEczKu(`RVW$2rf&={ig
zzC914VB=&LRok?(s#Z(rEMFOxR_pz3dpsLl%Ygs^gN<;On6R=8nRSRD-Mk3lUzbuU
z^uJO4KeQ55x68!UFKX-D-FIzlMn~_jF)hd#$O&Vjo9o)tsd4B<GX!LHI7y9vgH6uY
zG0y8wiOl8a_cD30!VtapzB#wn?;QC{Uum~)ZtMtlenSD#!3h(QXwm@Ve#Z^VVRzsv
zB&{gFtQW+X8D4t7BQj-HgkCsr7ZbzGi;9ynzSvjRC3FTg#=23hyFUf)Q%1_noSLD9
zW(o_GN~CI0lg9Nl;yYXsV#UJi->;0ZZXMSBw#Dh!-_8w&CYfIUmHMR#cmQY@pf9_S
zBScb~hGJLva^Yt#!0QbgjSUi7E4y0#xm~kGb<$;H3#mUPk6d6x7!CzD58vE~Fho$W
z+*x3_=yD5e>!TlRa@lW-=-O(0Q{bGk9AS8;_Dl!)mw-fI*7~RO4aeJhKvS0<7NVJQ
zM$yT8b;S&1*ckG|`{|RmZX*SeQIUG#l$){5U7U=yAx^Go=~C|Z+rsp^=tsjf0jQ*_
zi-O}VZQs9-WC~D#emVowiZzkRe3%Gx%C=h8*N{+=>FB`vZ;^AkZy}$jw4{BuAjQX^
zxg*p@$V;4*-Gt;wzuV*QWupAbT@MX60|*}y?kHzheY=#%a3Chm8k1_}I#OwJMotMz
zL3hf?gf$1Q7{6!Fzt&Q+EPKfVI9ALFebC}#5Aca8a+ImvI#3ZIlb^=682s329*{QO
zO%$O(Op<jC2%0p>7s9*4BgLC0>hLbh!Ic`Eu#u&^Gu{+kUz!f(k&sc~SueYb0AIjQ
z`$$w_oUIA?pnPqhZFL@`Zc!FeYD<|BeitA(`?t0Ci#v5d^9z;azv#*=f>kx5OIG#_
zf>VR=?~ouh7@*&=;%22TiwM?{_vH3VL-Oo1NoW)OW-pPC-P9&JrywOQfA4lM`V9k`
zp_%xcp93iZgB9*<povCIVRwJF--;&f;|=h*1V`-k?s&jKJV@?k&~)LBP~wc@bPTSt
z&5KkV8=O6}ck8&T;2?j6Pb3hRg%(O}&E+N+>LT|M_eY7(OZQiQO3JAKh&$}ZFdzXR
zvy(8#2lE+Zh}6W&<edP_UEG1U15^Fv^WgKpNN~%~pq*h&D4$^Z2806~5J-rk98pha
zd=F31?84x<1o#AWLX08;98!RjfCCRS<pMYeRL1tpaMmtZ;u8p@h6h6e0{P1X%}@h}
zso4`(NaFvT3HuBKd`*uFZ0~Tf#>K_`_yO2(jilNJvH+%6KaTVKd~IznO0(=c4pVgi
zbG)0QEC>A_Z_i!p?h`{ZT;M+-^1T0y0b38@mcWTGPq(wHAJ#}~%{F3pfd8oly6My1
zydn|c5W2d$y1To3x!!8f<#AJ4+tcBCIyW;jlfh~sAt9lCq=c`jf@nQqia;HV0s^TE
z_5uddz@^k0^!o1hhaB;YOxVHg*7m-2nEgrxib|qV6aWBr6LMl2wfa7QD{?H6pa2ig
z^XuR3Z*Fev)5S}@O(KuIxFlkh7$3!b>3#V#F)=Y)B#F&54Pc*+=SpOO(w>tP1+3KK
z!#g@UVgb0d-}@V2{dWVn%2{VbuzAqDo1FvQ8|43W3b;&x$DJU_&z=W>(VWgtTfu)9
ztfV}SJ3?M(Km?GiaQ=tl7el8g=>J?jYuXnB-=ho*FE1~k*dy=t!0X#-!EJ!5mc{9y
zpqR1M2N<J4(%awoqkw^aS|2qp>u2TW0{aE6(9qD>9LK=7_vgzNigp`q3E{p^hiM@U
zP6<ExfGXB(&gTFAa57u;fe)Kk6ztx~h?4sD?c2jbhue90*{mhMjy@y3WA)J|0-(aH
z6aaQ%p4VCV)zuX`mBNCx<)v%@8E`|3V;|cuZ!b?|lCjaTvF;s=zy8xgs??@(`M(2k
z_>*7Lg700uz3%|VliT@V6kr?bd!3fVF4#c=O&a8%G7dZ_W_ET=AJ5CR=8FB~P!I@=
zTv|+6tx}^FFM!YU&%s)A)Z$dFR^!ol3f-zIfaMcgaOQYr0R|uth%N=7xG{C|tn3bi
zeblsufzLf)52xQX_wV_6d^kkE%OfEi3JMCV_6`za^9Kl2x5njmhJgz3w{)_F#8g#P
zCtiT_w+v~5f`T+^bTe{u6%=2u2av^*bBx;%{(FzZGc!u7Z^*#OdU|>T0|RENpkI$b
zJ%|rZL@`~gxBfn_?e+cL{TGQyfPmr+_;JLCHEpKJ5HC2^CKSjYZq`};vH@a$e;+79
zo5kGR{0i6)2cG-uU<5ie5&@HY<E$ltpzq5}f#~b&>-_w@89HJbCQJ+%2$YTt4i5f9
zA?NJ$l-uLl(81yN0J2~g(7u2^AR2~re|P8oax+3F0tx%^I1IP=fN(7koZY0W?P{=^
zFa2n)cc=54o10&H9`}G~t^4n-&C|7Jc#$HYf72p<RIa}aI8YNHC9D7RWLm_JmM2sa
x0JJEe=l|bu@KJdFoX|%f|KAYs|My2vep_8NTm2dZ8Nhvjq{S7)YD5eJ{~w(15H<h+

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-stabilized/plot_u.png b/demo/documented/stokes-stabilized/plot_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..065789088ec6cb718f082602cd2cb8447a4af170
GIT binary patch
literal 94743
zcmeEt<8vi{^yZB*v28mO+nN|R_QbY5v8{<S(TzQ^ZQB#uPB!2D?fwn>W~;io`qNe2
zFV1<+InPmql7bW>JRUp%06>(H7FPiPz%>B?uy|PTuQ%@+5mNvF2|z|%M9m}XY{T7<
zV4#Qd%DhQeXrl}pd!!C%tCec1rDyJ70fr{(AwvR|C>%i14#_ew|M<;N)z}L;csdCs
z3B`+byG^w^)kJ3iSm(8L-^O_RPWm&t*0Bd_`t2j}!OZ>8#of!!%-jsF2m_&y1%XY^
zk-8Q9zb9w1S`rhSP@`fFtl+Qnc*9^&yb(@l#-b+5_pkFD-Z#-uBOEjBpCZF72z_$a
z46wMNM(LI@P^AC;rt<%P{Qp>B>Gp;952NUMP-d+p$+PHsFkjjV<uTHXiZ@C}|LMEm
z{W2Q()5XENaY>)UFB)mmXQ~G4e^dwezY*Z$Ur~)m9vpyU`<#ichaJkJRw3~}nm)t(
zKPs+L4mIjLU(~oq6@&-D1XPmjife>DcN*yxA~^Rld=6~cn1%pgiPclBYxi*!U1A>W
zJ3126od6Zp>zx%e1F2(GpR8N-U%)x=9?;*ouviMXieCo^KdmuOEZdLlclr3O)R~eH
z0L6m2k{R=wit1yn^>7c?0>2<eARn80-S(jZ=D^NvMLz-K@H$X7)PnSI;)aI@CCsi2
zuz|81Y5|wpRz&uJXGOBQ`m7q^nQ=8LCj3IPGsPJ&rm1&e=ukIyQN&xq*3&+iw`D{9
z@3Q_109eN;({{c@IaC6^W%j^}91g8yE9*kt$~5kd`2~5NzjJn83oERk))(857V-JH
z0Q`2%M2hu~HR9YOkT2Kz^E}p-84Z)pht1k<VTR^IrZS#|ff>DE<d8`*K34F!i+Od~
z;hoVm9xOAr4qraU`dc5R0b|pqa%V+!V|OR5H?XAg%Ht7}ZG7p=w0u5!)?NYJTo*3v
zHm&zuLQL`zU^OpW4-5YOTk2}U`y}@YpiP;z#1O!bdKFo=LxKxhf_sjv6_$Hv8Eve9
z$cw7iC116~OlTm~c4_6tYyHC{A{Q9V)~53+aLL(dC##3OG25a6Fdu*%a2f*BH8W?1
zb1+>)V$zv=;dN&JShZFK%|B*iI?tuh0nx1YjBhSWPO741r~aH8dlSRhZ|J~j>+#sc
z7imUG^pY^;yB`?I_?x>h7FtZat1V6O{sm0Q9|im~cdLRyVe;?k^$@#d*~9(AtVC3&
zSN!kK!#4q;we0;SmBmGqbo5Xt(%Wp4YP)~EyXUTzleR=;N5UyOlM_s1nH^ib=0bJF
zP8!$%Qy(WS%d+o+Opl1mKV)UUAE;Ji3m+Hs;g@+lCdFmBtkODt(g1X1j=B6ew`Bf<
zNlqo*SoXQaQ9-_pj$;)gABchP<|t=ilf`JPk*Ftj%)fR~Jrl-rT|L>)rTWMBEg=Tj
z40}SUs3HC4zRhL-*P?H>QF{-*E`5u0cF$pqLTx5?>9#VVCq#AojNHk6yj<*rcH6Af
zSsgR=o60imwE&xtvL=G}h$_@uf&QTQ=cXEaoR-rS=(PgrwONdl%Vx|!#JRVNZc9M>
zO4{@^<N#!JfSOGy3OPG~8&RX9QZjlT@R#hpPM3a6IrN#xSY((0`C(NLh3vxTNlZs3
zmXY~F=cc36E^o)4oSCDAODW*T$-HDQx}~U!@92DWXLe`7xG2E0wx!F!X@9egtMzy8
z`juQ^TZV&)qvk{4WWiH@Xfiz;69h?I7$Er{hHqb{#@V_k<i`i{hpJ%={n(hsdtl-n
z1ZUJ(^J9gdtL;i+R$?**-c=eC_cj-Txl~uZCw{}=>^u(MO^RuWPoEdj{LQx|l%EBa
z9;^VAPKKoA8>Bri#y$efFG=q8Z2ptT8&dZOmd#3bxA}LsTChS3>>!*xXw`P-vR_PV
zw)NQS)%mvD#g5fwEEa;2k2)?oQPoOiA7zMU^?H&^?@2b4j+mF<3>wgDX0f3Kutrx~
zIdaA>E+Mj~9~>{hZOu#Ca)Z@OC%gNfL>U;AgC0(>>W()LFAe+-oK`3=yT%_R^?pEd
zgWpFX<CS2m<yM5cNmcU``Rtb{9)y|_E^hss%I)x;5;9;K)9b~(pG>6!mHGrrxO&TC
z@2mK4hZ4V)S`1?UG`RGAWJ8%$)=-Q#ie2@Z#DErI(2MuGT^Wly9AAE|DgUS?0?E0U
zdCQZ}WDv&uwhi%Yeru><x7`vvDYWY-46-QbL_gj3S(8&x5PVqv`S~;?<aV}<ijV(0
zC8g1LAhNEm?$?FK%W;YS(@vPGP)SiyV{`MRYJkeiB;O_f``uh)V`EZMQf+N5b*|4%
zBqlu;ldi{I?qEdU7s@!D=9geuQ8Cw6L9N=LA((KIE3XjfcM!8CH=o!EZrgE5m-+_S
zJ3>`cSB}FUBjY}`gNOvY0dn*l$X9TFYII<}oxk5YnQEPS!&T)6Z!f9>MWPNE6e=uW
zt18};>heUroi7OQ8+E8-u_jZJ0UCiS;0h017<+=a6jVN|@2ti<8j19zc(~d1(ZV8N
z5IujfqEcIn*S)Dz#dAFRe&+d<#V8NRlD}`(y;=K(^`Q`_-f_D!A<hC$0Q3o-OE$%~
zX{n`dRiPg2?(U{7$*S|bJz$&SXXE2*tFFF0Z{8vzBGRul9?0ad?)2O8|G3TNb2|e#
z+)i*^a=})2JgkNh`z;&SF55JXkB=`dF1nsBj?}%q-A)<!Tn`ML&=R_Tff0SGr6p$W
zn83A>gIp(g*+I${aVC=T78__+E;ekCl}c!F*|yK+ue1@ESg~HFck+UtbLwB~_jhKF
zx9qp+HmL}(?{FA>BJk=NZ${d61{`iAA3zGOJV-esXHrcUC#_A73JI!ph}6KmpGWC~
zPy+H3H~OmPJ=o(DtrwJGBM|K5LjnOk%BH!iD)+Koo&K}2g-<0<13F6)$}gbvm}j=S
zZ)Qy3Bylic|0K-8XtJEMuw41*2r7TMh21^~Ww{s7-w3$xgkV?cwLSbo7UX{ZmsHXe
z9T%7DJjsI;wim;-$^E$QjJ!`09A6Ec-?vk<V#CA3L+tlt<l=HSKe)QOT0bS|ZDUhW
zU++Ab)tBS=dj932cv!Q3uW=V1Z#HjIdUbRZ6tI(b*f^RE6rU(9bu)Igw!7?Le_k(D
z8+6&M)V&k^0d=(2b?|a3KFPj|y=a1UKSBFzl1*95JTV-}sZFB+K=5?RKrnz}a|NB+
zgVI)BJ9~%PP3h0yVx|&J28=C6Q%1Q@+aHPTbtAFcIgFL>n0z58w~5tLQ@kGTb6j`Z
zL;fv~17S9lrlP^IbKe>vCIFD-sjviqh3bI5v64@oDc(=brGNOXuM3E=p$d2|sA33e
za0K=`t=o&A8SVwA_Z{E4xpA<u-4}ow0$-NqZNJrIyVmY`tH86L94Gj4q!e4fMZ$kt
zQNQW?s2A3!to>5NBdW-M-4E2zbDiK=;=h{~+j^t*!T$<{u{`G1)U3f9w{8Oy=9p+A
zo%S2%`@h$Is2tE%jr^W^PB^(u-9IxQeKxWrDxKH-8+E~VDutchKBozTw0ExJAUeU0
zA-A7pucVc!58lm{myEfF)OY}V2yGbBff+@d;RnD&QUd|O<gdvtkHe(DHVsv<Ep7n}
z(ey-@)PT1>r;D?VF+;S%tL0bgoY$38sRx2{Oe9iKjTvon@uNt#n;UbVIic0-=1t|=
zifBf7FLvLz>!FeyuanhAYyX$I+>2W!U0q!o3_N^%zT~|#E?89+6)$gZ0V3of$1llr
z`o6BWI4cU=&kHPJcb$Im`=S1vtNJDO<o$7GnP`TIAB+=n`uDT+;)S$1sP^;%H=aim
z5GjDwHz58{`FMRu%pR~+8Y$pkAwW_`tW(5P#^qyuTIH0X%C?4|Hw3$38MT6Y#b=ND
z(ibbYX9^=~g4MvM=~U+&V65T+=snc9IMF7Are~Exml(6Rl$54t2xkD_u4quioR+#7
z<VFgx_(u^!L&aD^LzP6Q8q4<W`wpN~gf5*M5Zw1iryNBjD(_6$BxGtDyHo^^AmQ6=
z6h#`iVZJ48z;?K9^1EJ#%MgM2#>Pgj-^+1XNls>be9hy7A&Uj)@4mi17#JAjeePF8
z(QE~5bo9B6jSfYl<~2ertkjg0h1uB~#M4j4o-YI8C795O*aVlLn~>)Ixo|s)_&dtj
zwfXadt0-e6%r8Fk;^n0lal)b;-_FbKSga+L`GDfh_Y}gul}P`4^B>bvr^{vM^LTb8
z>LzI{`hBrT+R!;GHB|)j=zqmz^6*L^(dwc=nb8on>=bnNZ8#_ri--z<@bov}%HuDT
zI{*M!YM%VTa*tJ2U(;}PnwhBR>#=pI&^DrM$<==YAV_fo?BKRJH#YSh<LCcw8B9vU
z;H5h+D#?A>(K+qI#_s_OFe(nc5=R8JClr1cFmN8Al+hsEC9d?+kagV}%nXbPiCB>x
zFOzWYva9<EyyTSfwe|Eql^5#Fqj<j>ECZ+6T7B#TPNn=Ary0|O1kz^US4Sf+-`pZS
za>MK|bNh{A`ZJD2LRLc=(lZ9(wVsPMX+P$B-HcFwUWEziI*m{=w_o+<CvVxKpoyxe
zs`ByjKG4e1?sMC9{jx?{dw+GSB5>xqpuW*WQLug(4A@WxHiZ)$k*$mH@P%o-`wHZV
z77efstogUue~ybRxGV|X948e^?6~&H0}?{PWz7#1xWhht*My4U+v_YRbUvgS)RBZ8
z<Zw3_B&Mhm%vSPL8ze<NjH4+4K716U>eJSi!(#h@J8jUCil+(?sQJ^~fEI)O=rTy*
zTa0i7e1g&x4TmOdfD&Mk1&2Kuw7mLfGSM!B*V``D)+rvGhLLw3X`yeww88qPIA9XK
zjYkiLgqy;^_W|)0qx={I5uf`vciyvfHw9+t9WfbxMv_#w8v4)M6Vy#<wTojuKk9H?
zc9%PERc)8^C4Tjl5j4}dxLAHcf5UFF+`>L%R<=|4jD>qD-<sRiweuJKw{x{ybsC$R
z{QG?Nb1l+z0~A*EMFJ`+<O*llIXS5)DG5iJVBmWpiZ+(`T|B-ln0h*UDyFY%LOtGM
zEb1fEI5rhkYL4mTwC&y9{GwxHWwYyK%T)<zs&RY%`C48F6~+bk64dpPId?tyoZ7lW
zRT?iD6eX{<cN%8bxjR^J7xb=HIBOTabK0DWPact_Sv#RR2?yBD%?k?Gi~^yT<^_U;
z=X)-}0ZFL+CGg2~1T#mdSHdOv01u-_R^O@(A&cld0=VaVF0$<+03@Mf3{lOE%2ia{
zc#E@;^fd8pqhzj?=S2pgKRP*w()PK-{=gxYDHfd_50}r3hI6g4b9TpinS4Ve>)<FM
zzLl4bXH+cgdU?sGrKR|wU`RG&Ov>8YGi+30Rk4#fpZWafqyHsM7VD#?5c$EfrInR-
zr%%h)rT^oG`(re@01Z|!18kT5nJbw0FDo5(BYJ6WkK=d8hS<$}A4*}nu7-54SKH?d
zsUl-naz<ng{w)T341~yC<y7(g=r{MJ35^S(x8nH*-b&iuu+R4fLqAIs_)o7f--I%s
zA@LB7(BZ;51=&U~NMAKvWvXWSy~6ZmI<cN0a3(*jnT#Dbql#R#po<B*0Lm3kKou)5
zt1wtH2D2*dVq@ix(F0Mzli!elY*bW7NMXao(1G~CstsZkXNn#6HlYS9i^oAW^i9PE
zKT85j+wwk~iHSJAmx)5DbHzoMC6N%f)K0&@GSMgz-Kc>yM4mDx3i>`(?07fso*HjY
znbj9MwJlZLw@2=VL>X-cAAfwtERNq+Otm74GOmY?7`{MqRZ!^H*3m+&*781^SO>K;
zbfmjQbbo(elI^C=g5z^q*^DFr)zd1eh2l50T<&FQamdwT)ZAeNv(sOf^(8UEMlnWY
z-v{gs2Iq5!sNICrK_-MV7v{nBy4|{hXov%YF~fl<*GFm$%e8f&7kWbhC|VlzTATzF
zT9WSw)qTXtag@JjTc`hLM-mTJ!Wf;zN?MZwto!z=l_p>{4Zgbb3<<DjC*>ZuK@d7&
z`>^%-WA)W#s@=!jai(s0<zH>Hf_$c;3-otaUq`EoEDT6M>`-tw1d7^;yE34UZ$1Fq
zleP%((xh_ApKn#SiZgM{Kw(zE!q!B=A|u7SU!>JE4)JfdF*mz93bmg_!Ko}`wdfnd
zGY?!y*hh2aNof_n4Mv5rgsSO86|Y!i3k&0Ch6FP43+jXV$^u+od&m9Y98#PAtHZ{7
z^P?~<s{|hipGUU$WlFFSlkt7~BA2*vuWR{_mm4F!zNlDIQ_*YFudZqWq#-Ty?4lWq
zP4CN&BH1*e#m=vI^sC3PQTz4f<$;!;L(}YfcK{I)ajRzX&gf!0B$m!8rZqR_i_iW%
z?B%MmOXT$-+<RtoQqQ_>>qbhe{1<S0#fg+Gr12^&n$Tq1zK*BZ+wRv9_#?;=CApho
zf8*xJ4LF~$9gGJJ{Ac0w=4U*$Cgq7*r928_DUMSrH^D0|-oplFO_6beegBu0`hjzZ
z`jnj9h!aA1&CFW`tya_4^ZE4S<|Z3AWc`$QGbL-HajA5NwM{Xf&3IjQy#CpNh5#np
z@{vm`_LtqGo+~L7>v)uapphg4B>}(#Ts-0E9|agojk10wFx89^PEO@Bm{+Lj?nC3k
z7N<hy!!zAthbO^-Oqr6dWdVVdnXit7y{xq<6pI=Ii-~`JQ$s4Gu;K~UoOkmvcS*hL
z4qNYlVA7Z=I#)F@q3Goo)J%Pxp&X*~TgT_e>tT+!ot)hGS8|Y^<G1{6@he&QN}=4(
zS21BBJw9aV>1{V!IVdUjrG#E){6Al}>@{s)jvSGD%eB6E(3jT%+ZKLa`mUMZ=wN>*
zRAX5}&L0^$!dqBc3LiWYkE2GzvR(!Y#vu@q2?^p5E?gt@o)?QSxTo#El=vHX0|ws>
zc|!O{`Ib8dIuc$V3XmJui<}!LDS@7g9R%q3`+BCDYnKyt^L)bE;rr@Gz>e2Xxt^2h
zCgr*B1=!fUIr}#o`GXH|dWg$&uVf4jvpr`O#+j3wBm+n%gBubvr;yhP3HJm?RHjkG
zmt?0ZfXtW15T2G#S={CEQ8tvTHM6i@rRPLYlVqAXEr6UEKaUuM8uYP`OGY>Fm}!5%
z^C6O$OdXsJiMsT=QMMgrFt=9Sk9BiYCqN8^FEH=$+^>Y$=<t#KD!SMlX(CXXBAJ}8
zHe&007+G1Jz!3YeI3Fb3?SB!<DWT6d|Myda%Z|rQT=T5j#|QIV--nwqW`h=|eSydI
z+nAGyp!kd?I-Sv&kyasKHYSfjA!~e|EJtvUxR?lb_L(wPf7%__u&2xb;N$&Rud8dm
zsbh<EA+Zpn@0Xf-O?N>i$FxP>f~Yd-Ev#JkuxbqW7jx`0;wJ)3pOVsVb6@59@A?Ra
zlfA!%{n9N^0-{veSnjm;`DX5?oHEwx&LJJDT5B-2Oj<<lapw&Coe(PVfDyn@3X3rT
zQ5+RUM^(w}*3I3eiaP9cLO8_AW43=ogEC*rU1ox4m3;&px4v;2+?P+OD`_#N*Y~e|
z_j+&9Ahw(68eN$k&OjI#fw4DVzs-&Ns+n1mvWCElI;x0jZ5p4rVp59N=<>Vid+dbB
zGIuoO<!yf@va#Xe+)B0InA>aG+S=ONeY)Z<xL}tmb=*g3OUASL9>4OsbT0eHL}5KW
zy`rKb0Re%vCfnBo*@~~CdT{~>>u^x1gMh5fteL&-r1z)kMDQ9{-uOOzm^H*$<S2lf
zeu>)Sn|;^*=fkGs9M)^e?@LbY;YBd1S>sI{`Gx>fQRN}EPwtc$ada7<KDA^Ec15r!
zT@+WA%;Dli6##jk+7#cq$oLe6z*^bp&ug**RMJR*FyNS;D+V?cU}zi!?$81t!4S1t
zO*>FHI}=^0<1?ESoQK1ls@8c=Yu0!_J0bq-H7_r=pSse{8afw>sz3q~|7C}lt~6Ik
zdAu_a2<Mtp<<SFHMZ0KQKKxr}{mfcTtif2U1&5ZY>EK{ubgN`JlZ)8<sIX+hbH+G0
zbnd3}Ap%pV^#|U!0|`@XihUyE>@FTDRawthPA0m|mG+UDnw@tbR|*Aj_P42rR{8SJ
zIprn_h?6w+ppN@?u~v!O$C2OmozF?RZ{pQU2LA8&(7$%dq13B%dG5u$yu75Oh5|o!
zh%GRV2;J8mm-O7V7*hAg(n^Ypn;IIH&)uq*ytjNGH$3(_w>Dz~UjAJpiC#Q@Q3!)G
ze4mHWMLxf-%g-MBh|p`q)1~U>eQZI!>#ONAJo{!0XQ%WN_<P^oZ2Muwq*TD)heU{n
zCR;)WZnvsP#hoT3?p<_P()m9sAQJW}JSc?6IW4o3Te3xPAk<XfUMR>|mYT!5)|z@k
zhUxUOZYo;_FdiOKK=yq<Hk430e2C9}BO?O|U}Uz7eCGFwFDJg=?KmA7|8Afr_LH=b
z4wV9r(dRg67L<cPLVd9qVU*c+bybYROMhO>U1ixehce>&m+m1}az<JW4kRucM2}_x
z7cc<#+TywM4Pr`g>A8VQ1tCV7XGhklqNPqYhnbl{|4t%Ey=m!3VPNZy*@lhkhLZF7
zHZ<#xl9!bB<+C?jo>|Q+|FpM*8jvpm_nH@=Gzp?9h|<7dR=@eU9N*S+>)~D_u9d@j
zaowS>Q&r)y=}_n`0g5!>t5_rO@wB(Fuuxc7s9xUqWhj}}Ra%`s&s^2~fP3a40a#{p
zk*5yBt?icE8P}#a6P*u&HL_b&f}R!Dx|7C89cCH^`8b}F1#6tGtFx*!t0pxZ)oAVA
z89dA<G3ZI58La4viPn!go!bLK2k}#U;&t4#URMOZj)R*gNHU8&WRQ2Sy;Jg_RT)E1
z!A7<Z;Kgm41%17bofd6xPdYY49YP{RGI%Sh2h6H20CYqcNcYnPMJsp8g8<BF&L*xx
zPskfuX5^qW0_Sd<I~)%H8{&qHdw(nwP7a+jiY6*T^IeUY5;beA_ZmDQXr3=3!ibl?
zz{WVem^#&y>UbS;ZT+c_sCKqtg9kGPF?;gMdS--RZ%+|Ha;DW@B5w=iF@Zu^A4SaD
z?m`}qlCFI>Y-vmPi=40c_w_Dn`H_kfS4_jdTiA!{a#M{>y=`s%lc**gKCO{)RTzFV
zf1EkcdsbAw9GbfeUOmZ}XUnofd%Jcp`a7=lVu0wHv)*0D_F1;{z6b@mQMFYV(`M>V
zo-@L7{FbYg@(-<VBF?8R-++(tjF$oL(wKa1>z^y;xo@WiIgeXH{d<c01{)4Zf@r)k
ziiJt<9X&SA`j6J+TzYP7q!`_^$-d-Q#KapZXa;5xRI%CR&@kt>i8GtAMPod>g}S+-
zuHq^Ah4Td=G|HA}eh~TkC-<Z(MWn>Wm2K6q@cbB<KLDM|c(6T&p&~G)fIP~8AQ@41
zG6sGiC14wphK`#EE#&3-&{!iJ1=AT41gJB8Z0rjN9~42u2P;R_M~VH_0|=3-&Q+Bd
zXHm)^CqRz)HJ&6Bf`U{iSnzVJ#yg1n1MJSOXavsm)t0;I;j+^#3A4-I{b)>w_(Nyz
z*D8%ZF||dn2e7zMK5#5bJ(z02vva-oj2V%#a#Ll2Ti0L>xItj^y$BChaXx@|LGx|m
zZ0r%kyWsqCA0NbBcy$s-#NV&s7I*Wo2xBF<E%y>s^VF+VHe}9TR%rB9CH`?pO&I3P
zIz;?U^x%odcAx&?q&P0OQwH}$SH0=;R57-dSCI4J!}T<ak&)8Ul8ecp3IU18!tyM$
zM?S8(`u(g>QQ<j3zWi|!kqb4)#QAn&hV%pxT5A8Acgpo}D?PV0*RF#WvGQRsV!=+V
zWfD>rVaG#r(4-naj|JKiG9M2S1F8;kK%Nne1H2BQg9rdgRQLO3&@iSa7+;-`os2@r
z1P=Uj;BUH-5JjW~A%>winHjkY9j2+r8$j3-CkBUF9LA#S#^_J3{SLPSzbG2OWw>c|
zf}Ju%O|1e3z&N5n4GmGT10XpK-x`gRfO~PIl&Su~uPpB2sQ@pMK(n)*-9I^Tf@$uD
zVNL^am18}@_Y>Ix4+V*oO8}_Lx=Cx`b~53u@$+8HeZ%Se9J#Z7H8H>PymT2<jVwDC
zX%;)G_AtY<7v;PQkB#$~?R!+}!XCSXpLFlq(FkQ3(v@*9f%5UZrO2=ST3}Zt5k5OY
z9%yZoHo6x$U~F}~3(=|K-S&Dc^_3dtjwuMXn6<+QJDvpXCO_vh3UGbi)QPQZwA5C*
z^tfa!3=zQZx9kxHznOlS$$QJ?`y)LJOg28J+`fU#30N9u&S+O=r}_Z?Y&enX_k8$?
zg9GIElEVXfyO&HT<A-bY`wg7|?+V9Yl=gcii|aUvPnwt?|4fj9m?mc3jlk<hS`o%t
ziBdD7Ncddh$jEruIXSdORUnWCWArG*@BhvMkiroJ_8`O&g8&`jfqD(Chyxko)S~3Q
z)hbeKp@SsX;j!YURBwjQ-vKi_52c#M)4#}3Bv8P$HU%6vF#{AOaq`K!+LUn+MBr!h
zq{(J4P)y~#j)uAGoKs_>RpXEW1%)ya175QHo)_;xp{L5D?7T(I0-%Kl0<ODAbs)x{
zECjqfXf_7&=B&<tO=aXlFRL5X^Bc`a@P&(_+zCohiD^_xy$IGb!r2XqGzyODt2zQ4
zMz`#7ABUZ#y4kc^eb*E$bXx+C3s8e%9oo7x>Zhd+c=d%=&^lJHI>9uAh%}$Sy|0Zz
z3hG_0Jez73nE5Lwr0Jr6JNvGzNYo=g9kg7|MS6eSGMTiv_<6}l(%t`!I;5)A%{us(
z7VC}zk6r)Ox-`C*WlnK-!=k3#@LKuknqNY&fh6_5VV26&V{!Itb9J`hE`9npFc?Db
z=j6e*#_6HH#I**5+UIyU!q7*b9QbqPMbC;($qquY(|~CzyMCD^K3sp8@_!ovxl>S)
zeorj*gEyR4Of>JA%g4iTxu514q448OpqM6k39}3$67W@`k<S(JAYvlMz{H>Di}r%_
zTC}&XokAFT!#(=((IwBP)PMub{je0Fv$QNM2!F=y&!hgzg26pfK>F$OSFMJe;N6-S
zhu|4Jd4PB!VvCa-!##yRS=XPDvvzB@XCJi}RTo$s45{Pe+nIcX<PMS(2V{w!GDDWI
zm~Wshd1@HTVBJL4HXFmJOf-W<e%%bVl0O?jt*xCiRt>4*s7#h#I0}|xq~;%8bUMc;
zDonaAbAF%csxbo-`Kz+utMqXEN)5yxlxNh}wk^vo%54$c;FVk3YsS-3x7`22w7ix{
z*}ra($}c#ubELW3?G^52O;lp?dH*<|s(hQV9FUPR7pA@4=>2L+A#r~eS^tjlz4<F7
z<kqtg<)_bLy~8DR5Ou14SvQZ+gG*d2o(cTP4HpB_s~qhI#4M#vV#to&*y3|-(!$1u
zOT&VLZQu5=$(bLQO+{Hiu;a;vY#l+ypml?33zPRAilF4dhes;GQsun7Z8yS3^p7gX
zKxzd@NkMNoAYb^cd7C_S0P@(9hH=BADc-?%@7kCJoCr!YqW|XCC+?ugV5sGOD?lZH
zu?(_`HepC5Rv(5g@!C9YM!qOOHD1|0^JRwgTXvoD*SU;P*oofhw+IeZ>V-g$oD2_u
z2^RA&c{yE2HuLH9Xs#dKJT6C2MAffq;o_8<*KR4(!m836RXkir$@(KCzdA+JbHWIW
zA-`{rfT`Ky!Gr;_)u49!Rtq}KL22w$n-Dj=&ForOF^%!~mHg}k{#S(0s;?jF^n15W
z`@9);tG=+S!d<06^sN5ev5))V+XPLQtKG(bOd+p{fvV=J_+j~yB7w_!QW7C^^-926
zD~`d+11C_l*H$X=D)AISM<rDT{H7ly8BEcK9sqsSN{bz=9-tmP2q2~eAOt(1wM&8v
zOZCXO%>Dr2h_VFJD7!0)?twe#goCG>{-7w;Mo>W;0TWj0K|+!gV8yAKgHb@PPe_*o
zkbJ{IOg!H{kW@l10%JV9f#{AsXQypv7*yljm9X;B+8y6$c^aiIZ<0?f|9(!6S&wz=
zMPI@Jo)oz$2Tp!68~(eGpOQlEX=)n+1W754J&2u)?z)kq<nz*1zLyp`sHtzg&va7-
zRpT+(S)TY|dYi<IBvcYJ3mI0lRcwHZm%wCj^(yA?N>t_b+@ol~Vlwcg9cIV>IJ(WW
z6sgKAP_gt#&CD;2*=TXFj<5JSVs!3twp@<?_lg@ZDbE*P+V*_*Ykbr&mhEdaqjvY~
zOzZveG22$J=(ygF=W~8`+`jdt57pwV+A8VPkM;EA{&Y#o6!y|}YstPW2cJ>LR0den
zA(MfV*TXnqo@>m8!p9vp0~-^nM2tyQMux&zWJECNrc?+O$|B0Iw!Mv)hbPR5QV&?7
zC=&Tgg@TUML6j_7q@;G_0ho5cK@tYrZNy1qq38jL;7E{!k2s*Y%t+(r005BkHGdKV
zV$)4dhyzz(>CTC)**JWIMp2*uILJMO!62{z4f+J`sB!54`rs8-gFipRfBi<;lxxNG
za{$+ZUfB!UQ}vqsd^4C*_u9m5R(y9HEkEP)-Pe)K_6{@d{*@Pn)B<S%D?g2z;{lVr
zyh+JZFFUE&>1Q>Rwnn7O_l!eaUI;I+^%gcG`3W@lu~Y~t9KAj}pdO2~QCtwTlbdnY
zw#)xZGt^2EWkPI>U;AHI!CqGWb1?HmopiKjKCzSC&M$|y^2+-1k<av=eroG;@^s9v
zrX6G-cJffk|4C*#4n#>%N_E#QY31d*(0n&balW0b3!w!l`=S@&MwqsIBY|2unzR2s
zeLBPk%W+sw@}}?Hbm_$2q=pn~G3<Z45)zi;AN!J7M=5pKwIFG5ewq~5oUeZk`u01i
zzldYdL6jSE-KA7y7AmC@@q~x6S<m6+{P)_$`hv5D3wr{^lMl<2B?iq@p%sK)Q@mmF
z4ZkpIydjpzn;N|6m>9XRa=vr`0svE|mVpoy>4@1T$>Psx5<3ib0!O+H4iE|ZK!F}2
z^=3UNPK>1?OEgbBsWdHfCUuU5Dg&UHk?|wf!vWfpSTtD(D1xH2In>}uFoOO`rGo)_
z%~x9+-AxV|$}2RtRxIOU#s8+*Y_|K!h6y-gMPyi)lLH-{TX1Jsr0Fh!F_M4P6qL){
z(bl-iwV<ex&kC#()sa+q!oz#Ob7p--YuhxGC{J##=gDyPp5nuhI3Ss6|60~CanDk9
zHQXnx2-P0#LdJw3$I^CX`8ImXUe&dqK6sK|_+NKk6&WFSy&8%qNU(gH4R+BQ-Qhsj
z5PHocr9b#+RK&v`P?pg$mhNy{p?t0lYw#M|P!t5oWaw?qs&UNALw*!HGifF~%9j|X
zxx3{0jY0UB_{eCJ!E!AWFi-sWMV2-$OCyur=x!t>X064f!}PWm3q|V8&a>veaa&wS
zL0d=D^S9!R#ST+vVeZ**!aKM9{bTtXv0oBA`-4VD`+0(b-Y<)T2);kAue;`SY(FtR
z|MJd=#rTFC9&9EGJVsd_*uQyuviwWeMr!Da8yqZTM-_qV>rgYN45bm}qy<pW=hOOl
zgcaa!yh}FzNp#F8-J9Q%^~4Oq+DYg)6lV#LA%@N81;YaaxcGG=a4B*lsfE%g1N_LZ
zal>h5x(~VVT<B3M<Ec>Wpa9HaR~Fw>hap&`)x^rKo{w;3Buip7q~>uVkm6=K!N#TQ
zCNi2U>ap1pZM=)&)YaC``82M<zvA?*;%;9-gbXq&tTe@BMI?NRX@%|V<S-_?WPvoh
zS)BuC<j?hx#I%dMl%YRPpCEn0gkim$hYP;TWpcKG!|X@O?5ZVg9$;~f{{CCbQk&bT
zOwSuq?auMNHJSq3@vitvVR5<aY%(S7$AHAjYbO|!&&^>g<T+KHNN#B%d<Xk;WK<t=
z_1bM<+y~ttp7TJ9l!Jkoxvc8I!$ZoUu0tNUc~xg_Tm-#LcDaHA7BzLsq|nnl^Ag_}
z&rcjc!PnH-gtXwgHtQDje{&RNUkoi~Zz3~+$#gxNIK!py_%MxW{gW=)wU9ARU2sW`
z*SY@=TXAiw<KlrGi~}U+))K>-#gX|#pLdze)VR!FJR4vA=Cs~!&HO90y*_c1kzKEZ
zjqN24=bQ#@2sAXRGrqzRV~M!2m*;T0j)<a_gh-0JW8WjGWCv=-gwKANq{=iOq<|C;
zlo=`+7#IfXhFy9?_?#$e?SgDHZ~v8=8fmG+aX58kI(6x$;^VruBpAOJc=x{&ab&>n
zZm9co%TVzi$2=^wf2{e3KD@^Fs!1Bap(C|h<-{4=T`t)-(Njif1Ir5y=&`qEOJMzn
zpDg%Lxmxuvb#<2FSg4Ud<8iSlT7j%GEJKcoaTlNz=HafE67`pR%jQ&#6<PQ$?&L2{
za8bF+tvzE4iW$df#F`WWP2!A<MKTHsJ-<*3zTAfHfU1Jc<_HjhM;^}Gk-M1Q?pcEM
z`_+ogpFkG4ivu`c27l8*Qw@ffKBEpJ&?_gHl5c*2=a5N4+QO&qH}Fk7{msQ4n@f@)
zrOX87I+A)1NuTR=^y%g)0^<LalvhyS_;o4ZGTK*7%?(uYUnUm(d-s23+EUWunys5@
z@35=!tR;2+(43tO&g!@<Zg5AR-lEq+?7?-$K#8_b*`tPMV$#mA6WCU<V(x6<CmYRQ
zFjoAyw=2rGVO^Id2d1DLy{XMf^_l#D<@b||orNTfhNOccRSG)7hq#~1Lq2BfcDxz`
z<n5En`BtdiwXpuQ@+b+)K|$kC67(;zhf#~|e?FeaQUo+4BWs6C<`=V$Lcq?JjRp74
zOHl=*)JRYSNw<noFc6?p;UK``g!3x2plsw}SJpz3)QNLxfP}Q%)|9vezFfeW|I4Mj
z@4T<#lN=LONR-0CJujV;8pSr|!e!u=yp#`r38kPi?C+isewP9r0q;rqJ-(D%=Lfcw
zs{{>=37Un@)tAF?ml>R)+)(RDc74A4X>{WE6@JBApE)t3W9^s_A*q&|v<L$^%fH(h
zQJm71gDz|(`&h?VOcBE)E=4K-2xbMcmfAm?!>m8b<Rd28rsy;4r@Jh-i*r9Ol-&4@
zV-Y9zvvq7_)3B%~1dFMS74o{f;@nYACQU`21c0@^=8jIYBBL%1{0-N0quI70j?Nkw
zIj(tc5K3IDH{xSaF`M#{QlmGN26`S^%7bZ4#QFyQ`GWcuhbNfTtDj}&HS6XRoMudg
z=rQ^l%}$OZqhktf`@%4n7ft>LnmGwQ*Whn{HphQbwbp})*(&?fA#a26ctl`0L2wb`
zh=wjf(9lN}u*U49e*%vN`cYiv^TuM5R8e6?xARcD9dT}Z2_d1(GKF1n_N3!~vDChH
zoF9@<p)AB)>$%KF!7;bOq802A_cbwPYPH)axgH$E%V3j{8-7Pkf)f!MhtI}iCYPSC
zjCXK-oH4=mO+3G!I;%%dh!?KdVabqIA~B1Fb`?k56D37(SRaNBu1&1yuk#Q)ZV%ot
zAo=1ddV+_kGdG4RMLe0`qR6jGdC9lcT_w45X=6t)R-v;;iV7xwsNs?_H=fZ+!_jZr
zlkt9i)0$~;aCS%qKyG(ZbV=CR{U>zs2=o|#Ho1>ojSaTVO1*7psn+rXHpQppdRz%k
zfi4zL^zh5QxfWWQL5Z!#E6jh4E?tYT{oeIc1a#m?Cu8s<(c<QMZN}Y0J{dp$Ys0<A
zC0E;-h&&M<tgpLGt$wOKJfxX1dc1<@J3Fs3r#>oQ#0D(22Am(eL_dEv`n%32H{&&1
z7q~<rW^_%pdsy~%W*f$I0PUp}n+gS4D5xJ8N9E}@u@>4hIEVG`%@4Np*!M^}Y`=I)
z*4_H~W8Yr>yYCeo#l9S=in6@hicLWGuS3+M5-(x0@M+TRf-5m*aBxV>I>=mNJffh0
zfZ$D;^oAPko%|!bV4(0bXI2JGOo#(G;0Oq^f*b1jNg;w%fKV9)zRiQsA0Hoh6k4`_
zTa$GsGArULra62saZ3<ZW43}m1VwRl;6N0aLHa{VO$0o^kvK?wttO$mw86Z<VyD+s
ztnWcj;6b2enNNz1?8Z?%Ul31ex-BG!|8r4bqF+(WT32ASJhuXk8!u^GVk*cL8XE`L
zVRjy`n7&WD{OoAxscgB2Rl--hiZOJ|m<5_nAL(V(;b@5%z%J7Fu4x|3_qsZllEXcq
z&diw+w-yuY5&Ea^cx2oE`f=aD$>TJ^H)W01_ls}Pj`uP$%TV_?(U;m)PV1-t;U<?p
zmT|9$;~wr|*@vOXoefqb!dIbf7-+NQxkc^fEg@kPyq_B7r<_`Ugimx;##qhY@eXwF
zJDUA_R?P|a__yi>e5IUen%VYx(KZ=h&bgseFP{hE8#D7?&QJPpR+m2wyDv)H>)rhb
zvq^EddFSvE(&o2WvN=FEb|*JvSxPg=qJVB@l4uC7A3*pYwblq;M7&6wBmnVA$OSYl
zVRM*$iGB$ZIfxk8oC|#p7tw(lWM%Dc;dV*m>^~wzk&zCuPJU1F!F$s-RAu}OKj{E=
z)or(<UbEPfjS;##e`b@0UpY+1<=?-L)5+l-Md#UplJd1%Y!iZ9H6yNv3(1d2sS%%K
zOpAQ|#7A()MhV*J`a^)q0zEYj#!bR3&ZLMLcio4BsnA8`QQ{b<WT_Tn`n(M?o7W=S
zP387FI`vkIWPZ9O^_pd9c>?EmS>q`)ZK-b2$x=l(_BQPrNK3RMW-Eo0XL|ewU3Xlv
zRa>fuU5bM5#!E?&iduPkH%gOHQdiI(U)sBq2_2%(ZM_)sZ)d+q>|0&Z->Go6uRPg&
z8r(-FXsD?#D)X`^`MR66W4CG0PmJ$XO7RZ_RT{ixf9;*{*zD^xZ$0)5sS@UMWji^^
zXpiP!>MX2X3qRv8G4pkixNQm|FWhkgFH4ahykzU(qrP`td@73>+>dR<HCy9BL2x}~
zct6Be2z@+-*6se<im|utv&yZ~J<`W!SfqZTkX6da5<WCr)h`p5p2zRb(&`6^EfUBv
z#w@N%vfc17DmMA#0hHv16-e30NUt0gXIHMp!Pvjso=R%r$?+n*<Sl_=(8U2z=#6IO
z+5r(%0J94v)1U;D0`a>)H~Q!qOC-M_0E&QZmX-iwE(a5(1;lb)@LDTYh9phIeN#ZZ
z>6ugD_})CMopDemSp<f7fN|E%U_7r_xzn!(0f|#=ZlFk;o}l$iC6;?FQ}o}L1v~%e
zMdcD3M&v0}V61pJXp!<Xnqs?9z^_(n;ixiL<*!#VG4<Bn3;C&^$7J1-U_1Re1t~-7
ztvJ4}-K;9=+d#qZN!d=LKBU9B1!V0x4jp#aP>-1<>Q9CPE5&B^l<=u}!MD}rxj}Kp
zqI9k%7HX$s`|lr*(_2K;!5!;b0(DVw4Y~$i2ZG2vCst!OsebPl`#SDfj_;MmPMP0%
zI2%Lejvx7XKl(eQnw!RJx4jQNVDfhuu!6TtC*^;C>guCgt$B=5ViT&P*LXRciXqzb
z{XV^6hvUlf5|LR<STAfJ(0O!P+S3`AuhYn8tGSx35Mqkt|5JTsjjyf&eepYEq686&
zfs}H)M37k<|M;qEb{n$ez3Fpl<%ycmm7+iBkaedwkN6E?5~WXGVOj|}o1<(JqYM;;
z0?7{R@TW^eJ~BWCIq;W(=(}5TaUkd@Tf93U+`^bdNfb6Xsg<{t1yc;;77B2bf>M_#
zjo1Vwld687(V~xTegk3^<h40~?rqWPg9i-2P)bunu;7ruUX`QV^)rA6^oyavE{LU~
zes@+u=?4Hvp|V2H2zJ)VurU=qQ1|R+kCUggU95vT=h@^ag?zhS^*P!GF`(<ActJQA
zyzQzR>oQ~zl<zY4j#1*kKzAi&y-`b4E^$N*m*=c-3<H`j_sL^kXK-fEW7@aIB)${_
zrcSu-+Zg1xN<aCmiEitNW{pmo{Z*~^D0(h+CCmh<Vsm`r+5?<Fj{6$7RW~+py2=h$
z1BT`9^FkfBKu?OiA1Bt>g3f>K<D|4dU%Sn#!8DE9gfp%T%=xzEB05r<o1MG}0}A??
zeT!aiU*ayGA5VRPfrPmXdg*#unfa{(lo_{WLQ09X_Cta?`R9BS?=xTR(c3Zx*pj3&
zDnp>6)J}B6>5acG`ys6Trmy@t^J$ZYB=&FJ^FWNpf-RHx>%5LUzzHX>WKgWtZRTHG
z3b|BQwFP(SJ_wg3g)H~M);qPep-)~O(NiVbf?g3=sykhSU&iD6h^z#-`HMu9-y8To
zMR|j{MNO>Wj0&RgI9QJIOK~2=fJO^s!}(Tx3X{SC)Ey#LoG5X`?colHy`HNF)Vklz
z;Z&C71X~p&&NRY2(DDP9q<K|>Th>gX(!eb+|ElRjbvwp4nurfcIDznjqsS{!chj+1
z_v*gOkSB6;WD={7H1SI8sqdPj$wEfNQUfT!HR2tDPhu$Yb|?a)>3r;kuWS+&vTJ8|
zne2!eON3J{0{?~t5k>wJkxM7I$?p;)mEn!kD)%Uxfk#vp(+64WWt!1`cutOb6ScCP
z^S^KDT*i%KKryZhjCwlTA5|wY37sE=>FW`yR`};Xi&(dYE+wvrwS4RQ=9l5b7%(KL
z`}4<Q$KO4;Io(QgsjJ!X&j}@L=8R|8awiS9`M2Fh`o74Y7|lMw$!Z9_9BYNvo0?5J
zf4@s8($%-^mnH6`DiXmC2eSi}vGsyv2tUhujpU`<k5?hTB<P?4%WpqazGJ2}(>QL<
zH;S1%qYD$nAR6z=0Wb+|G1r<LjEYZhW$pRTEBZh<x0M554x5UO_jfr=^I~gTTppa}
z9PsmBaTmw!dDPQ5w%-*_K#E?M9Z_|HfR&v53ntVO(GO;e4ap&?jmO{v;6y=wHlMUM
z6&3Ae`MBb2s+>aJACC;JsJKs8ryb+oTO~}Fk$&_sDH^qgvDAUANr^s)`O5-!NRC9B
zUux)*|46M^g{gb-0f4|?D4{#3(d7<MwT48f9yIV&V&PoI<FXu*1&?z`A;D7U%27R<
zc2~qsPu~M$XT_`WBB?g&Lp0M`Lr6y2ye*DO6Yg%>Q&hizXj06AJ7|g+$}brHz12L5
zAj}gYkzy_oQhtpB8y$|B(hnOk5ORYB59K7$TxkVOB-wCfD7V5ucQ7ObePPr-x#8IH
zJ2T04aV6#n&q}k+iu4w~0b85+&j@mD#OR**JW_3mV>}F>`;g5nXjSlPQY#B-EEf~d
zSVOaV>s^D+$IFPoPFe4Nn3$R?{Z43;sGfbdrRIwoP$JkV#31qZS|!zcXkF4Or~0ow
zE0_%MpZ7lEvo`yn$eMFXV(i>X(eqaBU8-bIUE5OQo4)J*9hZ?NUPgL9j8^NT>U+Mt
zcq5PKx=EO&pzAmra#M3CJR$Ba!9!DtcZ^EL5WAXra;-m^N1w$}O+jAHV)h^yBXQvU
zwXWrS2YhtTdF}ly1Uo+Q9E(c)Zd+suvjqcC5?XwdTN=AB#20=4XvnVr^q9T;8t3ow
zefPgnjq2bNgUT3qE`zazYC_~bkG=2tcT!seFAHv-it(Mswn{C;crI0Yzx5xNY?Lj4
zb7|xFq{aCp^d@_)j5IQMt-pqqqfUa;BEK{qGkASowA&fQQwdis^iKdetn~7CgkPwA
zA`H^h+E4}1fL2Kh707Em6cX698SF7F+Iv^kEpYw4d=)@P08s1=JYn}QMfKUN!?~Rb
zS|TQ!GL0p|RTM&`2GwtL4z^#Bp5iOGBn27c)1_)8`6wI5`yPlHm@48#eFR)~yBljM
z6`l_C!P<Y_;z)uWRRBLX;O~|2n2~G}=Xzz0-S>40hWo0kTQ5KDJ{9jle+NXfWcHz+
zXe}$17Nlo(X^EmMBlJit@_zh^oRNcZpKglVU(VIWOf!yzEGadDBk+L-vaVFVaX%N&
z_1OcimJ}~MUp5way13p=^*;rxd)3k`ZOV44JgZH^4es>#Km=<A+Bvp9{aK(kkAq8p
zRNpJwfY={WQGTafa^isU&zpEb^M{UVe%7bqlCaLDd3al{9H+^hoD1QveHb4#3;-T%
zvI&9DKHkBT;n&WYFVL4T-}YBnjz56t<E~6TwbE5go~IS6OZIbN_G!RC^>2RlOGvh2
zv1eU1uj|0(+8T5gGhz-$jm(6g#+jvxnoy&ewVqhR<y^NGRI^@sn-eJAzgK_5L*uu$
zk=}5aW$8e5qzLb{tg07Ak31%(7<$8ym_kIMs=JfLYJ|o6MM41p&0IvC#U2YIUKkdD
z*F3%M((625E-bVC1lTvV0jtF`oXOYPtq3+#YV^&Kyq=TpTE(15YY4%Br~5hFFZH}o
z$u=OumfJ=T$cu$-p_14^MT__o03HNDDJWfDMb<}7g7P9ypo|Xr_Wm>7D6c&{RzYrf
zy@I{qgj-pWibAjyO`_oE+5)loy2nG-#?<@1qK0n}%+H&KL=E`}gljtq<(k?Q{H0Se
zHi;40KJbqkNQG}4N5%Suo#vY8c(5T-bj6TFf*~&p>G^Lwv?W649)^}bu0@?UrHdZp
z4lCC$$Np8+rD0vHxqVts-R37un_v3fy;Ob*-ZjH?CWhntzl?klU4iB2q!K%{icrj^
zT&UGob$y3r9xoHRCj0WE3p#u2Jvm8lPaafAJouH!$mHwm=IXU6`HFOO({)mUL$=Vg
z5rd84AO~JLdk_XWyJ|;Xq?CTY`3KXv22AF6R#Q4~zUT?@?&#u%L;vTOoUjjIJ&5vb
zsu-v4SP#x9$TeS`J+TLCWWDpQcYt12=u&=zbDL(Xg$_dtmAHcs90p=NY%0v<*GW5f
z-Jj$mSDcJsp2WWbI9Vh_*o1T%4bWMsvS_^`lyuK|sCf$kDp%l5h$5T`SKPD9a<bU@
zV~E~tlTW0FNaUel9KGR_9!C1P46PRS1jvz}Q=6VcQoy3m&n)M)I~l4D>OWzSv-og5
ztq=O$qN-jnP<m^0L3f*^7!nw!B4^U_mvCi&P-nfV=FIIr-%&fYzLA}rT)d3E4iN8*
zw;XP^JSHMfIp-AE>^3q<uYEf&R4ywF-i1UCWYY}56jqemzAx}8?MhUihnU|Xg*$4D
zS6ODDtll*Nw<9z(q?VWg{K(I<Y#!-QZUml)J2=tHmXS(9BoPhIcbfntky@U}euZD7
zSgi%~ou@tOp;JqAskkwo?xQ1n#Fey5ie&}S(N|hyk9~*yojf0m5{pU^;sN(hnuG;H
z6q&h?a@wNLA(d@GXTw+~0qdmePmC8uRIO@=G{XH|!?eUy>qOT;SSPvpP`)EF=Kq}q
z=-KQ;Lyox5G;MvogDPwG+D4IBJ(0ytlQthIaO|p*wv<#*XI+X|8R5+0i8L`O@RqJK
z=qIL&T)B5`sbs|ES*aGhB>)Js>!^_X+xyMH`lFDGa`zHXhE~rxSL+M57`{Hj-2RR-
zV9@-roFG@t@pt95h#Kp&0Mf5?Lx-BVxnb@@0F`Z!K@RrEmw#w`c<emYWSb__l$$;z
zijXd-s>7Gflkgs)$JNM$48nTVoG<B>hjqJX7DOR$<pu+YxW{QOL6Abd<BA-HJU`wF
zN;hbV(|?mu{=)(Qv$%wTL?R#vhzY>Lqsh*jL|}pEE)_us6pAY=_PPbXjR$4Z9E>^I
zLsTaQk=aL#4?Y{ckwjqf$X;4=!4a^Kj0YZAA_$}24Z}5d1L^-j)54qDETOCj!isHh
z_mJT2bK63F$G3;^j6lGuMdR|$p=8l(GfYH-7j-bT_<<Cyou?6xMSvf&HqJ}Z81`$U
zpdS&PgaBX?ht$Vw>u#00_DEGk@yA!K^8ukl23=&=Od;}?dknb={+F4Y{h+QfO^Avx
zmU>O3@5HX5P;$ty1Mc_vWfQzSH^^jxc@C#MlCqUbU0gXMw7X;<yCvK{J;irh_lw1U
zSB@@1W4KQ|BV47lNg263=kx5MVj%SMWiU5|`7<Rw=^tvNmF=>ZgzF9EJLsl~-qHNr
zo0P^PPt0mb{|nMUEx)-T*;OTZE!DX#RYj(jVNqNh_0TULSX+stl9BzwzaAq(IKm%A
z?$yg%3qLMqnr)2((Y(hOs}B!<wB^F?{q09Bjm9N^o40V>FBGG>xdaaJVdm;;Q?4PP
zP^v-t9v~=*Kq`5K%kiO4ODi+7n^zH|a@-`M!oo`=u-giCjs)JuQQe$G1YsVc#R?2Y
zv91Raewe=taLr~bn#J44K!E_X4d9H3LjXm<^1#M`D;>auK-^eJ5<nCINrDzLP$6LU
zL;wI6iwLb^3B>G8f-#aX+o8y22I8Pej@xm9#w2vg37QbmfMB))(G6>{k`l;w6F6p%
z<TMW<FyNS9uZ6UOIudgycq@*qUAz{<ls<^1flZ2I1TgmrGCRoi^A7f+4Wc$HK`Ibx
zrJ)O<wP7R_9TfZkOZ0R@m4(JSX=NZ`zzJtp5hFowt9YmVa&5EFT_<LH?@;^U3Z<w5
z3`RhS$mu(Tt6fsXXbEQ)R5(pYAqjYG1LvijklT>wmMR^rVWbrQh-&eZ0WSjpc7C_M
z(o)zSP>GS~S<m@j95}0vw`*{ywDqvleCAB``dO1}-H~;wSoOa8{gf*eW(tjUj-501
zmh7{2pX{LgR9i9*k{-%<=kVXGh~WQ3QLr&99)EFoFt4ley$|=NC8s1h_>2o4Gc>sV
z{O3q6U3cb`V76ioD#2h*jf@ekG_Ny`k4q4&wj}paDIvGi9BPFBHb#VSgnvH;-8I{)
zPv&=2#jArBMm?G2eXAv`3R;U3y#Lj_dsqUEbyokLh}lVte=33dzh3PWj-Rt_kh@}L
z9k2mhz);(F*2kQd%z5C|V_&Uo>dSP9%e8ldN{b*F<jqFVtb-s{qPa?k*jR}a=H!bC
zIcPUR=P1mP5gdGwcL9rGKoEc#15f}8Ml@JJUOmvrfSCqTIS2@W2m=HLbS4o1pbkI`
z2A$0UfUv;;)C!>W!*wJa-Ocs!&_qE$UZ{4UtQ2%=pe?~<o=Tp|8vy|Qh@?0n6I0(N
z4oZ;Nr9~=d$ReN@2pbOvO#mk#Zxp30tMP(73mCI#G6I&wNd<J2bNv{>Sph&m3I)9h
z+E}D<5iJ8Eq#z}StbnX$VB-;?LjBcje<AIUC$;G_qaG*hJP-qr(FAlYLd{ujbntCO
zby-1A$<>ZPO7IfE*VhnMf}%7Sva(W~#V}Fj1U>rW7JHrgxMkD(l^dO6BtR4&Bo?-Q
zZC*O%H2}b>%`3egRv$O)!ez+P!P*Qc6pw3gu0kYwUNf`z+~D$QH>guO#EzVuJF<7E
z6YWGsoDuM%vBJ3Y;ajTT_Fno%*%+tatcdr_oTR)nT;zpB*PwW%&-mEuc^&T^J3s}v
z=eE>lRg~ZkDsI4#>=l$670>I<Y-{h|r_TidWL1;_0J6%8kxGGUQ~-dN(tezeKf?bC
zeR+Sj5IQA|2;pCpOP4N5L!7r&{xj!Fahy76QOr{*;kVi}u4M4?{<imv`pWi<-WcZ^
zonEuOPElUXmm2G=o|Pes9)9_!5(oe|*|auGvWbvFixFBl3`(*7%gjCe!Z{DT3INDx
zSalU&eXU#wh{4LvauK6|#hsvJaKH@IRdkY*V6g&00LM=X!S~~V@tC}Yck1Sqa)9xm
zy<P03flUqV#$d)80awAVwzIT7eB?3Y=K$<YBFh1a1bP5?5waw(iqMr3ITgHuPy{3N
z%2BNuj)#1&1Z#951I=`^f+P*RqeSS($W}dyms$aUd9*xCX)~Ba0Dui3fq*84q#YpC
z34<z`r(kF&l~xWoQ8puuH!})f%&1ffb+ihjIiO>qfh9v^B+qN43`W3)eyLJq>?zjF
z;)Dbs8z)gC5dZ;4MjOH@Xc`2{j&c1t=7%00|4I866ew2!#$9PObO?9aFaP*(hUJku
zN@UcI0Ao0P7hrM1BoLSs5j;mhR^f&XRI^X{zx1%f(!J-`p0;kY3n4KQJ}g~mY+<Lx
zUXT8GziC@~*=DD4a{U#$<7>mR8E+mP+>azEcrYS@jJ~0>bcpK)V%>hqjWX4kDqkqS
z^>^?4iiqSgx{C$~EsCAEDC()3AGqPt@%3LH6-+iN&=o+Cp!ORV7R_AkdF7dZIV!R%
zOLMMW!5vgNja9kLwU}Dgv3U2bU)u=({qz?6*+S@?Fd~G1MYfio*j{rANpV|k&#?zq
z{wfLF*L<W{dpVK_pB*$U&NX^b$<#W<W%E_qt2$(M^5UP%8a!j%@SSA?YZh$)7uCdI
z4WllNni9KwXnvV)b%k*?Z5Fj%B4tT+3dc>F92Q6IO(3k)=tzmxS415PHQvZ247mm(
zMKkZ%!$SbfR-i`!`XI^)_UHg-hshYRqELv1<6Jy4r2=5}fM-P!fa*378jU0rz(mkG
zAbL8(E)}v7z*j5i<)}tNgtAN*j+L<Fg9;ljfKp5zq%)re_A#Coh{2K;CFv;o*joe$
z5du9n8RCTc0eS2wT|*<uOK}Gc+tq<Pk~WM0gC>G^me>gvghQPc5)!DSSPo(4L0}dL
zrO3!!kiLmyG2F=qP)O*YWyr`n31-5L;y7R%6cief$M8<GRL)vzKemkV9$&>4d&FQe
zHP9%z5G(;yCW-cvPtCh9DYR2CY8eXvfEKP(E8|2kB!|{Ui|2TWse?Zl)D8gHdw%WC
zFV}?6v%^UEfp^pQpU%$j*1vysn^USBBhl%gn)LdedyBVgl9a|;>x}UEH}RJO05*TM
z1(9&kT|X<CH{reXjkn)(XGUIbv8^euxt#K~qnotLAD?5X>RIvh%`z7O0IT+Fk%YQu
zSCteRTQIeZY3X0_)Qlz35B`SB7~y}55g{Dm-@ulFkG7T`M-nW-DRivSb;YDx3I*JH
zao2&)4@hS!+!{PTepZ}obh*B0`mv|SMW^bkEQ=m|Dcbp8;WN1v*#Lm#G1o&Xn)uwe
zavm1sgu<WH*08RvF;99e8<xzHfz_Al-t|z7|Mt5}GIuQWZi44TvmIs7Ls@m)M7NiN
zL(>Wy->o;Sa&(0@vuN!SLolJU2N>#kK?x=P(B2IhaEQ5L@><TdjY9}XD1adVFvxPi
zWCa5Pu=jx4Zn3yreC%nglY_39$nl`b1f)_ZxS&QU8E3T#Jm><Xo&}6OR@zIY_*nq}
z1QOe61>$)}WHlOro>1x#X*F`rQY(X?l_8k{nsHQ-cAQm*Q7UNZXGkTonIYyt81$IE
zoIw;C=mau>QF>t7eniM2V-Ro(kSfIJ1YSh!Agk~pFbdK(#PN`~iA1j%@3Trg2vQ9x
zC)}hHP3`<$*iy`aJi}~~x#G}7H-2Via8gi9?7}4yjFk~AF7R!oqUfo{WSGPb-~vPN
zoL7I$nxqrMk7o7ecOII4SGf8H4Ig%Xw>~9q{8;<z&vDzg8+T=Ib$eJN(BjW+ALcg~
zmt%E;nd43D{MZ+NI^kE5k&{)5S_?X>i%bn7!!J#Hp6xX+NqO#<56sRg&|MoJo0#Yt
zbSo#yEG`%y`x^^(kMJL7L<mRtT@>_GZ?8U4&{Y+y3|tg7G0|(xFCLP8Id{*M^cuTH
zffmN1uvtOVl0&ZV&E(hRCI<i51)5utonE)I$-5@nA#P*90RTXGPtF&XEp7HitXXtz
zjd{#zX>7m`Vh)=JGJPG!pKo1VWL=~2LI#Krn6dhA=zAPqo^ju6C%;?SDXt2LKsK}3
z+6s6(qzOQ@8ORzKe|KQDfIcH2Jun)8fI8ORB48MR0Pq4ZnnAk;Ggk4W5(I`IN&*NB
zSVUl>U^fo|08TFO8jj0o!IkHWT9CUN5*$FSD8q0t3bR50L|$yt$t4(5*yrHkY2j(H
zmvF!Y+Rlj;1R(H`7XU^=ZNIG7Xzxz6b{U<d62{5VWU>%~h)9;9r4ru2k!r*nIfMX|
z;n2!p6u{(!%>bnYEl5c#jVlDRK#PJ($`}Q?j1zE-vx$NT4Ydqw22!cu6Ub1`7!W~k
zEnok+ZQ+am_?+2p?<ztQJ<uT9x5U>f%bmx`fYv6(Sxf?HLZ;PH7|UQ3AaTyp!97aN
zL!RoO-q3N8w-oR>%(ibg%123#>i19co-^6y2BA_r$`0;p{SZ?Va{?z@>J7gkeg1}Q
zJaZ6tR&2>Wisa<g=_h{qfLkN0qI64Lc1~SoO4tvwBQlE%hJIL<c<+jbZmH_&2>&U%
zivMgObc-Dk!oLIsJ=HtvPG(mY#;JoAMNJ$x`j>s71uaD{WXz{LWW13JGX&0$pE)dn
zKSz4q&ZD}0m=p!}g-`XGQ)|pVZQP>r!x0W|D1k%lue`5Go8=RYu{i28<J}DcUK~3q
z`c=#!>ull5*a?WG!PRO}%RskSOzjNeRnC{<NecGpfQdv3S41^&GNa&$i>yv;ZV}sh
zfk!0jFd~aihz|y8C2a2!%~s$RimY-7Y@*f%MGAUo#2On808knEI#0Qc#KuUhA}{uv
zFe^uJCZ<iM=B<LtOArB+Nd$(61A|HhGOz#%BGlQW^$meYG`a?w7=ulw63w`hHX_)q
z$J`WJty1G|Ml5S(WpV{gi53o$G=nSbIFhp&^aQCyQr;x7L#7Uaa3Ew-uCI$ARG134
z;1m!sWV0ZQf<`lGvk`;ECaO=b_JPjHQaQ;PJ9yu(=K4LV_?+3Ub`tJj7q@<8wu_J+
zZQC{^hZ4kknUX#`o$K+4J&AF)CbNA6W$EAyCJ9eTBk;&Q;}72An^V+Nx+8y2{?&q|
z4=jo#BNBXX@aC*Jyg}-x*l=>2=5BXZOD~9jaZd2B>&o;aavRGwWq*WgWFpJQ65cOA
zG~@TI_9HT~v-0{{#`*tjrI^$)H!Bb^!hf8O%fz32MvqALr-LIx_`k%q%1_sRxSblM
ziRg7${^;ymkw5^z)^j^Q!2c=O_`rJaxzRJyQhuTC%#S26At?Ey#tomFwn&|^&Me!*
z^2I|DF#v$P%B-VJTO$++v+sBr0I>POy)ZQQYCi9DyUdE?9hdnft|y}WQ*&$I?F6ex
z66gj%VW!{|fw_7^XQ>Fayq5+HYC(qys)I3`S(LT#fdWqwz-j}XG(;{4LqOimtCWxz
zfgl15fk6+fxq|l$geD`<XrPTmEeLZqb4CSb!=Oq7`%I|CN(S+k0UEWD>Pp%@!MPbH
z0ELSdy=arjdIqIc*)A@D1DskeaKJJs2N=RIM&`;hS`J7h7Oh<EFxcPbEKwM6!3F>a
zDUxLg(L$4IfU9vdXs~FZ#Fc<Ni%7)uGJqBAJ$ROq0-a6jL9s0cnL9z*Bb;SA^co6d
zoi%2LMaEu;JCMeHG|6r@!O{DB4%<0%LWk)gasg}LcYe8c^jtec!bfBao^)FL!L_Xi
z%QxGFOZ@sGLs1;92gh`K9FrB|pv~4~9_yZR;YztGLT+uRr~A&D74ZxEa6@F~XT5M?
zuI4Tm>oxPd=$W$urv2>9+{{W@<F?#=(m>VRu&F}^Vqs4OZ)Q0iof>_E5UQK7Df?KF
z;c7uwwZIDTO8?~0n0Qq{a==KQ`~UBZ2;m67jwjO>;~J^CtZV7*QzuNAaEnKk7|JuV
zGsi_Hb9y#8^aoa8$>8M}`yc!!`l$p00FIQdKP%bh&nNVkGt&~5#|B<E1dldt`KM(k
zE`wg3QJYeZ=NZ;y54>kI!$CddN6D|Ap;xDziU~+5?|iq(yvk+)*J=b{k5oYzC4(N#
zv{D6WS{yJ#!5*oUKxpEXO5nx_hJIi)iAHBk;frJqoJI{9D=?XW0SAHrOj@zU4C9ia
z+8z#QMFR&-?u5+@<W3MF(8m)>$csk4*G}4Lli(O|RMH#^SUumXm-OpMqu^vV%UnbH
z0D%M%ng%ccfT2f*B)GMM7I-C)P&A`LN?;vS$Q^YuqLXG-oC#41Gr)0#Si%k$tt_Dg
zz(y1HIHzMF#~}(5lwchYF-)YSJPRnEN6=`Nc*&GXi(nCGD50z-OpZ&D4M=c|f@YfP
zDP=94T$FQSZ(ym6q}$J!r$oKP8u(-U`%*6onXJ=%XAQ~Wr>32l6g{b!*ZGZ66)rn`
zZKry))Y@e6)5k<QB<{@G>hho?)6Y(}e_>wA!hKiMcbDyr_lk>gh@Kg6<0>#4KieYn
zR~+d101@a#kI6TYLjb_W&$pLatEv=NSuM>OMb3&SKXsfsEK&?udgre&?=o_;(vnkG
z@7pXL?Yj1pJ<?DY5rAbAo@M*YaWcQum>cYL=G2!X87WwpaX}-Emj0TI2;m6-F?Ln#
zPw)BwNwHl)8{%AJ006slwj9;%lX_8MT;#Kg8Q)KtsHO8ms2?b3Sy$fYXji47pzD%(
zlIz0x53V@dvF5C01LcNu5M3)56-Chp7JUT(sOow5%Z!yuFn(YV@V+^t5;1*`=w;;8
zxX{-l_8Fk(c*15DJ-b+`1lnw%*@Cqev7^(lE**$<5iyf!GJ!5Lu#(W(4+&5tIgzIU
zF91OXEh@~4pwb>#Es&A}o)MdoWYB^zK}2#?Z*=f;Fp_3#hf$%IDiAIj2kg|cp3XWC
z3+-sE?PLjiMzrG$Qo?}-gbG(Nya5To0l{8q?Ue*L&^iSs_6i&h5J@@kxRkb5_h1xE
z@)^tYS_<lO9qzD)Bu=Oh*KNj?kTD~b4}>-=-OEZH5mHe+hgmF?oH8pU7AVDN2Dc3Y
z+-OERv)r4Mc#@1jHXJk3gS;YG=9NlNob}HBIRmvqgWHvM`vTr3Jjl<Tm$EP`Kcm^@
z@(JrMM8YQ(^PX{CaHw&|{?e`L(bDH!=5&6cBV8p&`VZJAsJcJzpPRTqgm`+#VTq4)
zhTn8^t!csdc|Z3i?5;epBY%%9NI5HHx~0~*Fzsi}%3%X>$vyMVeVKvTODd$z0?jXs
zn_{l$TmHmvX#%|V(>>HEhc!ocN`svjL_D5Zkh3gp(y$_K%0GoDd_%^kh{Obj8y6fY
zTA3uja9(c#03>;Yj0^lN>X=hsfn-#YXYg-0c7%UBZ54mE5PFRn5yJoP8InMO7Q*y_
z^W$bEg(S}W;@N6cCUGZ6i&0a(=R`Z+tSxw1SKbNZjwW@9{tE3_7V-X)&p$3(Q&g1+
z#uro0_}~C^Xpeu?aaqj&Z6CJvWda%e^y0f@SPm(HS}gz$xIjSmyd@wEs@zdyxey^2
zkVWk66)#>C#=NHRv(WNEUM7b$4fHzDZw7Au$Y2y3DuskZ2m!Fkv0e_D`vtWRvYLTP
z10V*wSR6>8g}@mAZ5%GgSrbQeTVxE56Ql?P(a^;9R6!r~P=05rJi-w|&OBf*ass1Q
z3mg(`NaPfNl5i#hmueZkFCnW#$V9lPc&(1GM*_!T5{L)^S0a8uhe#0!{KDvGa*NMZ
z*)<amIAW}PuR-ohGDaYECq;yloQ@x4ketLEq=OBj+Ji?D0*5w?5(lf8vC`NxpPU_a
z59X30>+hl_+0EuG;)nYE0wX-Dn)zb*{H@<^KGJtU87dD0F%c+oZuG28$KG>FlHm$8
z$?3Z49BSP0kzp@J!AW+rCwt7@`pxDe{Rfnx@)t(UdgIl9yt?4co%y@uA<CISFZ6!i
z{mP3ge(tgEt~{_kcegx5HJIJMFlEk7<nTvqD?YOR<W5<*gJ9+sB~2Ym`=!SGI+y7X
z@2p#`{#)3ltm6Oz06?NgSh8OPueT<;g`PY0by{*NW+%&St_A?$j>_D|3QQ%<t|`UT
zvQHj;<>!J+^V(_wgjpp8x!0<3S3680&AxIONl9LBdFhU)mL~pkUAGbb1g>5AvxU$v
zbVLaMe<kN~ZaJ#{kpuz&W}SJiK~u>Y`7L7(eqRF13?)&jA9peQzAto=>%zEzaR<L!
zUFNx2<%!V<Yr8DmFIh4<cKP=YIp4Udj(D%NLU0X0ZC%hMo&>FIYYuzo!^mb9o0@>&
zjLTfHE9utYQDSH!VrgJMz>yT}?GXuoTxtiH0TFPb1c34q!6h8CT7lUDoWd~?0!jh3
zeWKL_I47c?AaDv2glJ}oPP0_TSvv=13Ri@X*x#z?D3w^HE_MNC+aO`>u(!5!TJ(1@
zo!l!=Kbu)nEJB~W&MMJn6pTi~*PS;jal1j$W(F8ULOWEc2zwDBgJ>B{RBB4eKGABW
zd=!ASAqftwM*5moFxy0n+2Ns4`kd~i_sm12c%btGxzY&Ls=+*?(g!JBY&4Kt%~Crj
z3)`%dxkFy2=xbJn4f?ORYx?%QT`g{90xkAlGBRe-ce=A*b6Ajm%;JY%+F!eSSJh#e
zA2mfiWoEz&J4^PFZc?VpIu?#jiN4+#>rmqkT!Ef<y{=ySYj^K1+A$=DU8nlg2@ba?
zhnv3Ky6wVFhx^=EEpzbBU9p;|TYS4Ra<j_Grp=eqCH`vLRee%mJb;A2@*h9G?iN?L
zzD`b7+PKv0>f*eXYTQYY*Hn?$UX9sFMVgOS`hEKRs#{!V-4`EhsW^iqMDnO`uHV29
zno=U;#s!WMOx9cP%{juK!-x=$@Mn;7Id@NO`W5G^yovk11OfokYj<XsW-YjLDKp3o
z=S~#07ar+7P{EejA9Fpu^^2jwYD>Wh<Bsq9LID6(UD<mE9+kM_ojJC~Y<~BwuVa1~
zM>?c}H~|Mcg|b2r`JBXdjSZBs1O>nQfOm~2ToMUGuc*ss#)gWHuCTvL1PX-NMA*Su
zA@qqv^q@!q0D)*46q_1E<?Rv&g<!D&Q3Mu)$nekxpv{f|GQ<dw7XTulfyLW;B{EME
zA<=5a+H$FWqnpedQTD9qipgwn7o;9^H<_RbqpRy*pR-itteNG;OZg_z+Jm|J0L}_=
zb4JA=?kGUeCG<9vql1KjCMdxPH@lZpQ!ak}#W!o$todZGG{kMgnfFOA2hpmBi~)C$
z0+vUJC0t0hWne+Vi-L_m*nJ2orJM~nmv&Q_(dk|%)`n~bqVHt;I|~==xpF}2Bb{tF
zWvbU4|5cI7SO<5%eoHeQXo{*}N|m9q=QJ~?dd=DV%~thj>7kB&h8o+9z*%`MWeq`X
z(Xxm=5u0xE+=u0GOTg|ZyO=#y`)^SW*B)MPm*RNyUBjQ_z4VRpv5q1uB0Kq}^M`O1
zmEbZu-ZeZ<5tQWr8>2Tfa<U5bO)23qN#4J%nrKFLR$5BxZ#(G-e;Ok~IKm&x#?xDN
zSEbt}IUprvt~E_pKDF$Tn^g=MlE4~irMccR+2MtGDGLDr2TL|yRhAC<LLZaOe=&X;
z0HC}p2O_Yl_Hj)F*;B~e%`cjL|BtI#)^}x|?zzv<D|WVuE(xT}8MWte<3d=T1I^W<
z;DkHI5S`V$qnQgF1u$If>VwD*0Rh-^yo3N8D{3W}qag5oLQ{jtIb(j~aFG`cMnGbK
zl!9I(YHo#2qj5$6W&@C_pq7&uL<%DTD<FW-fL7JtA+_10goGCbq326I^b2DLC|jF?
zv)Zq??TNHl@9~k!;S0_v>dz>%WLB8c;vC-n<XYNjG3zS(`qLhwz8LciUGq(mFmMHP
zc0<SjaSoH&mjCTRUaQM%$}c7QF%`vi4yHwi6n2#YAR-w~C=uO3GgsSyAi6x@1Oz@z
z7m$^8UKJ`)#%LIZGE`Y2ZKG~aOZrg1pXp<LTE}7@b`@Biy$^FSEDHc|uwmzi`u%ht
zyE!~P&MR@)Q#!@*g-azR#r>tSAmxi5lV=A_0|1ohD+{{Hcmo@ShYVYa0D%3qyJv*_
zs|W8-<uI?QIB8TY_yfqPDFOf#8S2*kbC)d4831u{;&XJHVcFfku8Y$Me{DvDaD+dQ
zt><?hB~AzouyrxR9p`^;a!z?p`qe#+9<_8g<9j7wZpy;6lr#Xq!ZS~Hhg68XIP41r
z0F-y-tnGZ#K7e4&f;21YanI{zWnQU$-n(P$+&f+xTJvDZJ#|Gwz<t!9Cbz#6R2;P4
zf4}IaNc}P^%Rh~fyJH1M=|_`NDNUx?B$|0NAfg~8Pf$R#iL@D<|BQE@Z!g&4&I4vU
z6Jzg;bb|nsLktJ{Ua_?c*(FehPM&ZjSet0m3Kq4TA@Tl3fzsfF1|R6A+OIl^Rz~he
znrbb5HDd`+WvrF8_4#C91Iey|sUhk&=lwVj^7e^^8RgCslDM>Z{GHtefUir7!g6|p
zMO({+<e)R}J^0?YCBS9|$d;LPu7Kk)jXmTBmf!pEx>E;R<XKh#03ZNKL_t&_w2<D8
z%f>ynYSZhaEAjH93%1vtl6!NIv5a8@3tCI;V-(sN*`l~7OByeg+x19fIsuZp2EtO_
zPr^afUA{9spSLy`_jMeV25Un5gJRWTgkVaq-*tJx)!{4LU%UJL!E}KUpSOEaK*WKr
zqwE0vqU-aEZkwA|U-&}d%Y>8UMf;}~#NSM8hU9S3-3wpzp0=~*gYCtK5QWY5owP7v
z`j2K7_Ec=IILh@|7bZ?k8uh!JiW|?S=eJdq(2cl*EL!wU@E8L`xFq$L3(fqL?5g6e
zRbS*bl#d%710fW70RX@otN?)2nCsq-c$shVZwjRu;ZLUSD)}d$G1#B^=^*xxfBfT5
zzK#+8PzqX#U&~$fEy$ufY5yvZl~J#(cz&6$x6jYb-(RzPgKl*n-V@Ln@<zlvOCDL~
z>+K5w_+(&vE_QmL)Ta10^uV-J9vW`|z`^<*2lOlK+{A`Y&98c&m_B}mkGF57xo}4P
z9a^G`w+Q$6JTbKFx3$OcltQbdt-b~es93yX*_jicWhlc)r_?Tng*~U@!|w}f^Dk*q
z$`J-I4YET5vWlH%)TF~0B{HXIBudd?!0N)YECUP>lSqMaK&)v*j2mSaiZcKS2qFaZ
zTBMiCc?sf0Bz49)oEYq-bp3Lk0TNG%u8J@kLL{DWN%#ae#kivvI}=qd<71-UoO6TU
zl2e}Wcx%30b6we6i=xvaCBA;K2Uk5Hvh2mr-=FgQl)t@Ik{amp?!hmzN-KSX6DCGP
ziX3ob2p>m<2qi6An(H&?G*)7+UW|cE9u<E4(YFN-%jxcTeDvQUL1?skY^k}j9IvZ7
zTNi=FG<KSy&8!MWn7cD8^Nf)OeWN=g^5Q>&U-ou%Kizw&NOvXHE$;B+hrWM>F^+Lv
zCwehCevZse@QUq7Z}#=`J1@%y2tML}zv;3TQxabpF6Le-Z0%@G{6AAKuc^e#-hFtH
zSm&6z(X*q~Q2>B=r?IB8{=&ZUa=dX{UOJ+%c&C5e84ra^ySDQSUDg-cEF{6QigSLm
z947lmKNWTFqPS<Rwf%lU{;PIwzO3lkTJ~vvXLTntm|I`U^_hL#y>4YGZ)bORp!9Zf
zYpSSCbPMqy)SgO5UoUTOXLrC085tSP*P5Y}NFMdewU$Qsk25g1@=rdaqvnmD4vtua
ze;o>1iieucv%R(%p3g15ZO+Z-@66iv5qKYyq2T_o>AtfPga4JtRl^i+KfQMLZ7=KV
z=pln|s4-KOP-@85#wsJHCN7T+Oa%Ze&YsjhszP6Fd&o9(!GqU#p3e8J$>rBEX0aw$
z{Cn~jG5)EiN>?>Ft#7-`%N?LXpHeU6`QJfe)t1ga6gF1uEnpcA%3~#t?xLxc?@}pM
zDqhC05>ddloQ(kx0*nIPqD1Ke<dE;vVFHQhUanh5Q62<_306oMI|Y%zOq|jtD0(j#
z>~C`!thF=u+TjXeam4-SGP#Vryk!3;_|E#Y7@xOZp73+GB_q#p+mq+tS}|cltTv-s
zbLrb-6YiPx=8GBtKxUObtETVm)f>*G&(G;*-#v7aaCaQ%W1kxA_sRpQ>&|?U+j4bT
z(u9J6#?4ikf{9)fl!hpATf;?}Q_rHLDaOp^N=ajtYbV`F(>)?`&~R5<Q^Uh6?D}kd
zqT#|dhlhOFK4#(A#|10Duk%CPMLom)*?B=XC=#~$>#Ya7j>v-*(_N?7x|u!I>BFAV
zjh}Dda(<8IKF>LU&(9w98~|Wv_0b(wAJA>4k0<YrcfPSatlY55?sktotsk@fwnfP=
z%nN&d_@ms~qMR#*@-dFv%Rb<=wnfR)=7&Ff^H=Lu$f+&{0OYk*=C@TAnHzD9Ot5ir
z3jcATv2n_P<bYcZ)fwS`n*S1ua6}0I3gkBzPrI;C;w3{Q(&hA}CvU!a#(ny=y*n;#
zRffny4B<bLz#B62^Jh9DYK?W)XVkN1CoLWtEbYo$Uh$lA6zS77_AzYEaNX^Hwye*P
zZxOp0Sw-x`xL2bB#{&S~u2K^c&{4%-$q{1a%PD6Z_OR}9R@*Lw3$IkQWs&juQWew<
zK$DE5<NzOJ6u2N&LV*@VUL0g_6OU;q77<X(6NnQSv)I{767D#XAQLAgB%);y=nXQP
zjiPCaH3D;&#AeYTrTxO-d;hVmSmfDPAG&AdN2>2udWak|A=&+BzwHlsduIbM6#}U*
zl!Z-*$1+O006=d{z1}K4v!p7!&6ItmCbwfiWNoiLaqla4#R34{J9c>OH(x7LeYmdn
zPaj|L^yllOe)v59hnB=Y;rjX{sTU)02W+>Mvysd0nu;+4`@25Wx7qPVhEPFuplzo2
z^PydS``V6HyLDQ+s7TKD_%j;-0EPWE@s9s0C$^`0|H0lPg|}q`0CrU#IM8*}(qNnu
z_QImu=5G9a``*@L(m>TL?`P(QPT6vC|K7e6n3R||=J`23Pv7MGZZAE&v+8}qQ8L?i
z()Z<Xh;7A3wqzcZ_^TI;ea_mbONksOa)MxH0RX=_9A=1&oU9^aBjGI1yH;LkX!z)X
zw|Tv7L=OM*j0oWf{~iijif2|W2cl@YJUBae>dQ|qzWMw^9s3S6?6ovmpHogFoMi{Q
zj~u*jU$pYZ#jf_`ZaG1uV>0C56ETsRF|2lTPCeO|P@}K5J*ApABVp;#;HQo2JM9au
zVfmefbaMBi#gktj8sC<GU#lfc+L=tb;nt`khDQdT3^wapEBJ<dUJ*{kK8Q(ZzP*y?
z;_Wmxi$oLz4&YE^%%HQ1(|9ABl90P%=623z1f)Ny?}0Ri15U8Y6c7s5KHi2&StwzV
z%-jQb2D2I!mOeX?!z@+Wr72U^T&#Qb!PIvSGbx_%;<q(I+rpdQqDy)Fgd_|Akdbdn
zOH=>=G71L(0B>*l=EBF%y|X(L%6&4+t^!<{7ON3WP2)o~X~{9~ojRXcR+(qQlI^iq
zpLi%W)N|e0&(~*sz2e@-UK)4z!(0DROj?qpxV1&dAJkHsepQSlxFN8pCpRrAX^z`H
zIhBR`tQV~{y%X-Zqo}KR-q>kNQ=Z;gad6j_4+V++7_;B;XVz!tXFs30^5utTMPt6n
z0nq?}{Dy+W!0Wvi)*e~EtKxvu1MbDQT^t(Oarw}`_G4^6JvVGhj5;E>wrF?L$I<}x
zoKX|!jlS9b-1gGLTQm1dgVgiFCl8)!dv(Uk-~V*|sh!29D;3gaPDf+*a!$`d1Q$j>
z6UqAgwmib`lh<02bERZg$2Sm1@tR<6z>*r1#Otg~ry(^uaYP#bVpO$IfASf_edwPK
zjtJrZFa<5eds~lIpjtyw{|t}keo+De0GG|BYxljk?3v{S*NUo@b;Z4<qs<{R171k_
zNe%8{Uub`pA^qv&QU8}^IAjQ_0x9qIG0(Uyh!4CTqxf;t#!P%;TPE#gO`I6Ed{{Eu
z=xo|77B^?-;2SlgFe}1!I^<Rr*?!(?A4c>$=6fgLia}au!+{1PB%;*F@tjB_oP@&F
zYlKBkd5(obuT7zbW`jtnQCp{!)IgkP^+qYDln6$~!pp5@Lc|H(6;VV;R5|Mk86eYe
zCV1kph1u<bNV5X%kx|%@8tD7xT-Qr^mI+C+TfE6{Z|w(c`&%zX0s!7#^8vu^plbY^
zGt~fqceb7!ALWwWrp_!X&M0hpbJ_E$en_-*=W5aFQ(5Dq$0obEzV^h}`&X^a>l<A0
zw|Go#zrFV4lBnAmojj+p{*Gj?jrnI|6=CCpoVFBvJTLHxc$wGk?r(CNFDH78Ddsv@
zBRYQnip=w0RcV?_*lUa)n-}mzyi?e7=l&t`;{2dTU%L0j^<V6l_}Rrs{D*WA08rFZ
z8t3u@<7`L{4Tb$5Purj97rVXW$d=3lw<3odPVd-Wa(Kn_OXddNz!y4{J}7b`-DxRh
z8na6C6fthLCf!T-&-nd{_|Cf3cTIdCr>2B(mS<#VkshkNw#uQ(-9Q8hu3?K}o=S8Z
z{d-O^!hZu5ZGW~9j`121!oLc?K>~*<Y%4l!I9k$QIu?(Z<}mrE5(oe|Sij?#elIh?
zecu-f0C>M~>*un4hFbbb`P^Yc5CCxO+UD<6J585O9$m4M6IR3oUeDh;RKH!~N={PE
zdf}4BWi)QJp{{m#AF*U|?DEr%Yx1cL5QFk7@wJ8=krfdEyh0GmL92|EJ0p`38Lhah
z8_Q}rfI*QJ1y<A#BHBf%kg|=ZEKawnX&W>RV4_0KV$$w!jq<ThwtjKW=o#;wJc;a`
z7mazC*9vPcw!S>Z?%h)k^x50)nBH{$;HXRa+=RqmZvHZC7v7MJ5?x0AH9)z&`J(I4
z$jbDy$j;~8BRQ{68TZ=bL2J$wt^Q}_I8X4+o72~wKfmtcnNt%dugj_^(v>WYN&*tq
zniHRl_g7w48!a`4abB+ZEWYBl#Ax38xx8JZBh7Re0ZAd1YQE1sFWoU|&EZY^^`DXc
zE_3~!j>ddT=%(#eC+3Gez9{PHNvB>dwqBj<_281!AA2%~S#x+prKIu0iF<}ewwD~)
zl9Mj=Q~jbG-Z~jMS(owVO_vT)9?E#<aNfiMgaZKPdOdi<Qlh_soa*B2ibBj@`qDkW
zCDU<)|2F<hgm5Hk^nZ-}=HdzaAH1M0Xeh3o3?KXWg@fZp|3X8hVG7%d-np{+Q2+Z^
zF4Uyoxp!9R3@=B|AI&*Xy?xdf&s_7W9xS)fG-d1KAB%hp0PtbQ_D>AEvV_mQn#U~i
zc<-Sx*Y}yKP5C?9UMjTzrlUx>t##JQse9ZVu1BaYtD1U|{c0f3B)GKoI2SP#(O%3Y
zwJ)4~@2iCsndcOXI0kfG<{Uf%rSUyVr6^hi9VS6;goF@my}X`MIFn{WGb@Ua=1}=5
zU=%6bPc~RZ3vx>4FYPU|4G{h~$#WdmUrCs*m~mINzQh{qIH8#Dvs7EYSiCsvn)$*P
z-=vLuJT<_Y7VFj0!KTH@eLc~w+%8|QA543Dt93#m0RXs^RngK#06<Q8)H^L&@lN`{
zJG(Bo^h<%Dc;mSMz-v~0d~M~{J>#PiQat$&bD99|_{x3pyhT3$bk?LX0hg-HMRZ%T
zXHZU?zRhf2=$DuplXASKCdtA6ld^0t_kfK2GQkQ+7eqJo;R>t-?-6X`%lA%OlsFA?
z?3SXBIvL%Ak{D-;Y-{1MO&1P7D347JjM{niGbAPA9YTjMczf+hUT5>txB&oCB9k8v
zf8hIHC&4{(QNlFd#BRU*{`SH{30~12a+h0tk$(1$dHW=Kj$M*6C7K9;5PVYlbvJJ4
zM*7ped7Crd$CPAtY5wo@ZF)Pqr$oe!I7t68^cdd#lh5d)9*G+LA7{(iT}R+a!Nxyp
zd~o@srN4Z@|54ahl-_Z;lB}^bnxDreE_?jO#~!HO{wX-X83kjTh&jnwEj!g|+Wgc7
zhikWdhW650{xLZF`-b3$^_#u~+W~_08TiiB!-@Y_s=K5!e_8c3sR#M6ewvJ6zINEJ
zvg7Iw>Nh>|d5nJw0N{do{l3%h)}Liv?~waGrZm=b$_t^_oJzg#mWurhq%d6_EsIu&
z*DN}fgS`vW-KhjUgPJiEYZSY)EG$N)geQDgSu6FSa8fjA?MGF4)c6{?LCXheZ{5H3
z2<fR<mi%y%gXZ3~xvxGDpHVn4KEm#e8DrkwTJzSTuuD1G3F9=s;r?IB=>np4LdvM2
zzh)G1X>tFuEHjGxGApt15qxGj3#H=9L*?JCO@J7g(|+wzR_B>D_q_LIZuXU?aY2FW
zGjdbIHG)}^T~&%Hj4$8z5GG~TpFh1MGHr8Zc1rMQk!7+AGyeX}#3iZEO+5K}5!W4q
z`F`^F^*z@ewI{cheLUCmfhDPvx0Qdgt?c-Mu}?)>-FMWTye#RMAM*I3sHXt{8_yov
z)$vt=Q`oWl-?{ns+Fo*GLCo)JI{0(EcVN?P_uff2>x<0|`E3=&wyU^<EZ#0S!F6=3
zGAP;qKc;7SO=U@=M%45_&*k<%+aiqg9C3~QFO%O~T+~&X;2q29ndGorwE_!T3a5WF
zQxU3U^n!nb--3jhKbKj*J9kT+?6USUU8|`jU8KR<kjcs^X(?%Yvp0S&-4_aCz1zl&
zu}_$gHeqk|o`g{eoR(Q@oowr4-RmRvPB}fi&Ys-OC&_erfPc(3-6dJ_4ZlT-v5r?`
z?&cQ{Z5%dpIRX!gTJt__-r$rdYi^))*?NsD=b0uE`x&#H8gLv*@|QOo-0o1=kCABm
z<s1VX98LOq206+NonWAf8|#$P5?*g=q%lYP7rbX$+r_=zC+7J+NSnMi6y$K7eJ`av
znbU5`DC)ADe17GD`thR?K(1*Cir@breo96mn-+h)K*l>eI^Ue{4gk26m6z4z1^^F4
z3{wsOO#b&rLf$)FkX_%95*+m2$<H9{<+?3|w=3=>VLREsKN7pCA~U*=D=_!|ecEhD
zpq$!@larSL049F9HlwHvw?lKCQeS;;4gg?F!Lc0;r;gqGPP{|t#&d^u)SrsC3!WeJ
zXbFF9YsvAUpHpL#H=aF2daAdU9bXXg*rMp`Mtpu-WujNaA8{XUh1L5v$--UMo!l)A
zaRLA=jGic%*x!~}e{-@*^HQUe@|wy306BFfgrmHmry5C#{I&{_6Ofen@NaL&JBI$^
zIwSm{6!l2{<TJ*(*nT=VB7}csinW)gel<(#O7wlxb8O}ZH}6Vc)LwY7>tF?29)ZS8
zv7egse>oME#)1fC!tk6!-RYH}!hFS`3MAM8?m7DzbCUm6x$RK>_LJnn=A-=wo<4qB
z*jWpU)yUj>);eKu;TwN{3ji>$WELhv+d_9wF89DCu(cXJ?z;3Mx7IEI*OuD)Ii*_+
zP9Y|9Zr|hUpKgJf=02?UBoj1UrLVMFkcM)^cwA$t>Q+aR{go<(AE&S6nwDO4e|J)f
zpYJEnzGpXUF7D>NEHYZ)d@_s6$H#=f_GB0ldx0&!{q602Z!K`Tl-)KV<(3k+Z;?y6
zx(Ug4mvXK`+zkjcKnehi0FnR_X>rubBR%izJp1O{yO6Y3Fmh>eZuhRc#CPQ2u6_`-
z7(d>6|N28Yjg`2wG+yG87U8m?sC-#$Lcu^oN_dpW&>JqCKJnx{NKsFm+zV(euHqMk
z-IwGSCDIH84B;dn{#CxC_T<*G<3}gFk>D1-z4o8m%8n14hU@;hXM5c#B*hoUP8`}t
zoOtr}f}Wbi@e>!tJoTfmv;E4+&6yu0dW0{Gc{<VU2jx8r`f4_Qb5In-lrizcvif`2
zlKbK2f@74AJ*TxKdPF37kKuII1lQ5O(^4$xs@iz|aIv)!lMw(wPG=n#63h0OL_tjS
z8k0OKk~h$|*wlK2KbjFC9N`b7SbKS2>jy<Wr4hE^IYCpBLVqDtVQ=-G!+nQ_eW5=$
z=ScrSM$1B)wvUpHY73j{Jv;GxoeP&$O|2G6{RhU(j$QCk=e7o_WK{2%=lvIlJ6xZ$
zpmKIWQ~nf(7wlcxujG6BYK2Fs`7Zwa7lzFa^)cmGCFx44FiUqGX&L0yF-mJM<P{3B
z-+*vI+o4pA0#G8mcFgL0I~9YEI^SrdT=+RI4*<E-x_@q87<4b@7qjN{7rYi4kFQ^K
zvQcD-OJ}}4cW_olaaUTb+rR7H-Z~kDtjKk*e1Bj<qTBef%6H#C|N66`?;gy_?PmlQ
zM_A9dE1%8CtIQkd5v|(s@o||Ym(yYb*Pgj}divD$=RVCh=tLez!oZR-X(BJKKX;n)
zQDaiu;+V(QUp$lO=yiJ0KfZsujpq(6yK~y`&pYZ*as8I#&#W5?DBY5OY<vBw7~C%g
z`K*{Y@6nBO%g9cV6BdL#^3uIOD6Y2gyF*3Bh9Z64l9cCcP1=|4`9Z<9i6>qyGBt36
zwxts$FN*rHj{XMnTPrSndrlhel2wvdsI4VER7g(JjRVUco6YI0OUC^cV==$ABD=aU
zWpq5<s=G;X!4dxBj0oWf|9<kDiy(sO+K-C*$|5X5vxBGJ+zKpgEyUIMq3(lay3$~6
z$cv+9B;6>ve#j6kXUoksMuOzkV`PqJd_P`(a(F^XXZ|tmo*Gp4uznhj@n5O-@>cO7
zc6Lub{o2C60|0W$a~4$2#+BF;0~6B=)`!g3&^G*GcGjHa#j6^h=&1vW2ziCBz^^@=
z#_X%*HEJhQPpL@y+Jl}xQiBgNqoA%=;mr1)HO9x>lUb0xY|_ddRqrnhdw5~wM3;Bx
zaNWYG>GK}gmj2o^Pw{3XicUiJ<&5ICwA3fxnCAJ;-i|kCdAz;3`mH5@cEEi`A$RHG
zXK$@|V&%cU@uN-eequPgaqL|SK1z#{XI2<;nl1~h^7ZHM%<FAV_Rt`u91;}Q+ORIa
z;>-C{3v?|PE|eCs7F?oT8gs|;d!N`?a4!2w<*BJl-up1UkkLX6J30AgTgCb9m5H7|
z@Pcl?a&ptfBTL3VzcBm>0Kn$FV>{|j(=CIG<0pP!4m0zz^E<1gVa{6%KZ+sz;xxfO
zlEck;AFeyGM>g7JNy@WquX#zzb-Bta$@~2QqB%81d2N+L$@L#Uw)%IjHo|{1BSJXB
zznT2zqM2pOEVYL5NvX4gr^UPda;1;(ouloO>;^6j#CRr;rN+MW=ndLa3>kugjWd+$
zoNrUH1KgAB)WwgyG(2H=Q*e@M*6gIkcc1Yil&JljHSz983tEeIkKKmL(URu*%mA}3
zba&-o?pN}?Hl6q|nl~r;dSb@y-}*~k3Fo4)(T=yBkRP-6v~-;_Nn$<3euK<e>}zqP
zToGN@$0~f8ZllD93cluF?w}KG;?X<b%-43TK6+}!!;^tv1sIl5s!viHSAA4v%XsI`
zIbV(s;?h#ar^RUi02%qZv_!jq)6M>MWEAQFMrD*}Gt0ZuqOgq1y%UnX$A_!#UV6xO
z?zO+YdOXDsTX*i#tCL<pQseivFf}4<?b(ZKPM`eyL$|$r_hSHn4O!o;zwr4YpQyi2
zow*_V>vi9rcq!$+<@Y?1S(sl0jd7xKeEcu$AFuo8o(<m|P~Gm|_{{O4ks&#ZA$;RC
z!9TJN0RUU_j_s&F#p$d|#y>ygYaM3wfz9$5k1aVzA%$aVDK}sR5H60N7^nJUYoukB
z=8^8o%@+?Rhs6q(8#EIbVsX;X=97%@UqZH4`X`?;MPvQx;7Iz!UxfVTq8G9kvAy(y
zq*<#|-|$fWvL|qM{;Xcu(|<viGU1+bqMm8DJ`wxK_b23(=d5X8^_}%hm}zu-YXhml
z$51g#l&?R1_cOzDj<oJPMWzpyS~iV2{K(iRkF{^3wR{5iM47Cm!_YaTf{UBxv08Rp
z=<dXzq?c=_@gnvZoHaXn$<PY>uk5OmRr*{Di*QOi$bKo2Glt80%tI5@8Q9v^Y5@Kc
zXEsU*yk-y?Eh`V8LasU&*!0{WFqU#&5^`fn)=PIh!?o70`RZJf96R!P&4lEXwAkSB
z5pFF#*qd{ceLb%KOY`;ov;XfoOmj=`gan6`>Bcvv5HGAOO8@(q8EZ>@?2Ku#Az8JC
zeT#1U+mZv{y!PyjclM-?i9&J=DO5>n$-I+iQhYt0Ns1RO^qOz8$N6~rI6Ei%1PTW8
zmiht!z{}(B7fjYo1>YeFIVo{MR!Pya+|yZQ#gh^z+~i`$g~h)7(9C%I5Kq<he2FBl
zh((c4wwwEQwS0x7L{?F5a^SyYEYT}sVdPUl1e?ws-ctNAlHkL8hpEv?iEg78$4}x0
z%xtf@8|jn%B3rsUcGR5Olz9|WQkO1VObP$hyK#m6S3a#gyS3z_=B8@^!RBktKdQ%l
zx+mx3jL(X+S1={j$!UN3=i`je@|wz)q)q*`ryk)?rqz0@{g(e-cuQaZ>EMV(_!ptL
z|1#5SyY*<&;_jmC%eh-F?A83uEfNd+kp)@UT2R<rcuf3&(Xvw=r>jG$J%!swgUEgN
z9sT|y>DAjmGVC!m*dF6vlt(+!9oCe<Xdor$)h;&InbPmtJEVf9E9SkorDIa~p>|(2
ze)%!|<Y8NI=9wv1y=uM60uDd>VbJz*kY|=8Pu^K|i0-u2zh2|B=1%(v-co0nciSr)
zzC7^i#Hp)3II`^iIjaxu5G29NqGJo0!AsedDWk`KwS4O8Pfm*{0I<5$FwgO0ecsty
z4hg$AruzT@GV(gok~{zax0p)*N03p-0%!tAddJky&+YQds>8Dy$nVyUUUi}&HCO={
z{pv59zJ2Syd)_$q+N3ln5&5q6`}bVLh~6)k%t(z0TXp#T4TYsE?!M!dM;-(KWK~{%
z{P?cZb6!dE7zF@$c<Vnfd)4BQ<eaNlHk|(~H7a&#++D+_VO~cgZ?vR@+)_7&Z8fL1
zWPjK+^TZ85-I8}qVELuvZ)|C0<YZCac0(bl8_pccZ>=oDI|PPbGVU3E&;kIs#puv=
zpYD=|Id94TP_VEfClD@jkr6~uOmH0yI5EjTlGE7$085hp{jsM1kG=B@Xd>(S_?aYh
zP*B&dpdtcNq=$rLVy~-feOPR)y{x)+DG5uc3ijSzJ1Uk{v9Fo*K<HJ9fFdf2^q%s5
z2rs><=&GCFr{w0$%}faS&pr1PC106uWJRbH!XFJ`cI45l3y2Et6e+k3vx6}wj=wrD
zDX3oBZ{E6*tD3xOe$Z6cp=(KM6?E4#d(~(2oIeU<$`nls8?qtZbzZNP);%4Ly*PLH
z*_mYn=R;NX+476V`9od1&Wo4FUXq_H;1?dDoS>3X(k)Z<eyX#pUF%fv<ntqE-=BDU
zzbJ)~HvjfoaenL(L!Y(T8>(_ESJ|$;sISKW03ZNKL_t)*_3m{z^)G3DdA?Al<Ir=t
z&dB{a5#~9nvAs&m#D$(~H#>Ik7A$&N^}L#5Ve3Ad1^}8f4wqkF2>>i!G$*AieewS%
z{D}%s2ffbtbUy_aH;3lb-+O<B*BTAx;kT%LSB%SNtQ$4<4-s`lFS@IN@5N+K7ZaZ&
z*YLfEyZ>S`fquz-hBeh{nD42p0e1xV{nt~B2XNDK1FqlaXT{ZNVH1M6VZrP>*XRC0
z(l-ivax<8Hck}3Jo2XL&0ORxKJU9+g>D8&L+jX1*0LJH_q)zMY9{k|6>HyuH4^HEC
z)Bpj8UZ#!)meRtC^-djaVS(}31U(IITsT2bU8Scs#$&7Y>*6@rYOQ4_gzEe-Oqej?
z!Gi~i$HRsVOG!y-_mGN;3LPCCsZ`oz{PykJQ>N6HUr0_)c5`zR3WYM6%)!CI&(F`o
zqSIPjDTPo;C!>(SsPY6WHPcll3+?-~yh)=7C>4K*F)JCmxVua9n7Y%sCl7@ms42rq
z)wLIQb8fqx6E}u`x->+TEneDpo@#genSygevj(4E_}ARS&aa5sL-UO1Yr9g(=;^FO
zXWt&pxm89aPCPetzv5WS%S1`m`;)(%jZw`y7=Om)-B>L{jT0}<Ea~Se)9iX6<(k>c
zuDsm08s<GW5`UId>jHuVg&ie!8^n28lfQG%<iNw^fqesRaY{mh0l+sT6~R|~%rXN2
zpEG%M*Pe=ZVIFwL`2DBP{A@oTOjwK(yLj(^;k9NU^I$T_Dp3a=cD#gY-2*|S%%j-j
z!*l$u#dypb!H!Cvz_@(ReKJb2XGbSa{PX1f?dvJV117iybDw38965a3)X8N17BWD%
z3DHhwwSRQKqX%|HJgQq7aucF=Mcn7VOx-+w_C|+E0KiL$BR5zh20sbmXC{(|TWxfl
z-eg)qPIA!wb57>A4tj&hMlBa-Jbhz$+}#)LFIHnUw%ORW)7VZLwz1K)vE9bDlZkEH
zHXGY_-v4v&{W9}BGaqK=oH=Ljwb$BvUBI_dei<TbqfJVo#YwT+s@EuU4sRIKCu1tF
zp8ve2!@2Zc_xty6b4yFefV4C{xF8iu4D_(RAS7I{(=9h)7N>1;PEO8_qnKD=Mn*<>
zcz9V^nLe|y^MQhfMv@F=ZS6_A;Ff<lpYB~_-RF5w+f(*e@DL3B2`2e}nHtGo>wN-7
z50;tw+JJzgpvR>MXI1Pgd+0<dTxlXX0U{=Oc2Dka`>a~=VdBmNCT{ts3CM?5gt0hU
zOfj44nTB4LuRqN*63vcj4DJr9>b2d-caN4|)p`*XVq&V!7+RUVrn4Itq{Gku`XBkb
z?yCZS+)raJ-5m#`J|bs_c;2ba;|5s#BX!Z^7?QE(W$3pWm(Dr~CgagtF67&oM@J2o
ztp+m3hEAQ6&#=~tC)Dy*mSjgkqLT9$eF*M{A9TsTZ1UW+-s*^fwqML-EnJZWQWd_M
zj0z&+oimfn5ebTUM+_s$rsN1BcqdcX5#{FR`@+2Zh=9+8`LqG@(v_sP1gviyCx1?W
zP2pg)916UA>me^Tz)B3ZthPmDy6tqKx%BJHK%P(^MX?CvHo(7binA#YMXj>WSK5^b
z>#Kc5cEjY3FQSk9rK9D3^?itH=1w!A@wF{`TEN8Wq3>1kv1Al>@GrI_OJg%w*&|rf
zC_<ltqhUw5EH>EZwoMg|os-kLbcnFd!J_y)+Y#dU5<+K<3N6Y<`&&AiP^a0+!qT$v
z=TA{vuJE8j@NPCX!T~udM@L6IU{CcBR1&w5Wg+JG6)~Q|2=KN_ph#r!JzwYMS9?7H
zDZ)|}-^Ty_7&*rL&aA$l*jhTd%u%*azMgA$HJpnks_Q|3)D0C^6w{7SQ%v~vt!1xy
zo?!Oj7p}W|vkZJ#0!`E0n2xvsGGIP7L0F@|<Xn^ISg`@mmgk35v{<sW9Vy?MMJz0i
zBJk%@ODyG3-fPUzOpTzNhrv9=ax*-94%JQY?155<YRjnVgq=)#Xq9bVhkAB*KpMe`
z{l@)bHnn5B;~^g5*6g8e;cErlOZs*VMV8=7Cp_R2Z8hQuZ&m{V7^7<xXW#?IVhGPH
zXDACl5#&^)Gg^u^T8U?9-2zfbJzPr*qA!|VN<DE!%!Q;$1o_lk5f0s{Hq4?u#hJ{d
zX%v>RYwb%DUjAJHtiun0T>U2BKnI9hgAw^gc`oH0p~=O`eNKGFSS?yR^kN#OsIWGU
z&HiR-Ib7>kO<6Z83z-dl+TdHu&m~%q5it416w=-5u}F_;WS;@*)2#UTSssF(#8NhM
z)1Y9~w&5^P<j*F6B6rSV^$*--hO}L4G3v0^6qk|`LMmg+1@>S|O--#bY%e7^o-I<g
zu&@vn6)j4y_zIuogVUq%r6Xb_aMkuls>d$w+ag9vLmZC}<=NQJ&|S-YDTYtD4GVSd
z-4#iWCnX2iQWZ?l&0k(IVREK9hdZ~6Y*6OE+97IE;{JB&G`wp858SqPaZIe&w^?0f
z&Lv$|nuJa*+3Mayf=if~{9x7fjlCbvRbjwRa8`Su+c0h9u`?R8$Uo@SK{T6KH_L~3
z_Wu)ui*ry%@!S9V<$23D!5sPV<S)AxwZz%Eh}q;UZ=@j|#C1_VlQdr=_d;7B=EYVI
z&6#~2jR52GN%L~N+h!6Mn(m#HDH%SXYo}8LP?-^7tc`DeIZn92Jhk(gEbyElIdR?-
z%4HvNK4%3kk;2Rd+kLjU@piAS+F|+e?qPw*!OaOdH@1@tA#Z_!-3v5IHR(T%IYCSq
zx0844s;JyisbmcF>yE+_&mG@J=REa_=7Y29$wGkY1YfGhX&5ooGvsLY#ns8BeuQmm
z2`P1Reiv@av=tY9^oLO9t9XhlgE=B(M*7(sS#c>^qWmo7!Jw&$iAwK>^NEQGtt!Lu
z@o^%KZ&R;NH$}?d_XtQhzNt7koWDF=xVpFi+4c4H(lNv>EiK<S+Kv<JG!S#*m8~9n
z#l16$&*aXnRRvv=hI?>a%gDBy<L-U!0g*r0*gmIQ7s)pSBirZFA<>;30i@OSA8iXb
zf#^?;5ld<GY~d+)FPn7`I^l}lt`u6S=Z%yuWQ=&1t1GIV-1Wk-POcBLYDHt~>Mz!d
zC8RXrBut8esot((3-xzq$wW$>T@kpI9I4X8=K#?Cp})$6(yL)<sM93<xLu)7ziQ0?
zGv&$dxx^r+F6HLNR)ks-UPEsxjt}YWqB85t^r4SVah1`x;K4Dn4zlHI8|>%Tjxh>H
zmCUfO(zy)=tlRvFj~5px3*DyD<n&VEl4R8MQbaArfeH%xL)vCRl3?$qxxxmlri&n~
zV!9g_5Lh`9%OmoG*m*2<jLZ7P=)7)#7x@?pfM_I!+jzICYmYl*(*m{%t@!ZVj!=wK
z9^YYC5dgH;+voG6kTj`@Vuc~6v`&R9n^mXJpPdxeo0Ko}kQQ-R!vv!MV_X{ZmwB_3
z0bd{{K|`G%h46f8{RhQL@~#W_gV<#+dogBE7Gc=pY^;V{sBeh;^=Jm;KMRX_ly=3W
zC~Bc(6hsq6#i;0LCGevHwJp#2$%)ri7X%X%Q~zvsb~ck<gF+gYJ=ih6w6xU!^-5Ys
zW@w>84+;v3f8XvR$;Nd=fXFJ>P3K0m0L{-|qAlVns%~1!?6G>x@4T$R?X~Nz<`Bgy
zc<F)FJt?vZvxnl?D#kLM$>aH8rzfET!6t)0k>^L>mDXW_MZ6gozwAJt;KMzJi^h0C
zp(3PQ28%uXN32WqK%X@RekBZQUxwiI^@u5`<aCe`D&W_ZzebWPlGo?!RL4vvoVRcy
z8n<Kg77o_OVUY3p=J&P<NRh_<I$9hQ0y}H9`%K1W4`=|Aq;IHf#A1e6<qBW@Io7-V
z=A|`I$o(_5pR$n+r`I{cz%#E(LI@weDf)hK1~p(DNIq9{O5-z^A-V2UjS_?g2{`+6
zm_=a&kLez=Mqf!FcfGgq<`q(GmXT7e$p$cM&9Y{-nmN*Ai7<tEFaHdF?{pwg-Vqx8
zQ~NTsaK+JhoFIH6@GHx36Pp;PrE9!qGWJ;%Jj2{PO{!5}A8Xff?vppV_x#0>6D9@4
zNZqgVbhkO~L#YT3#%C>y_Dw!-9gFKz`_6`w7A*zIsd*JU!fSTZpsF2k&|HlA)4pJO
zAZ;M|_E+L2qg)0c9SesB{8F`V>7^<<xeWCrZ`lx4`>VJzT5XEuy}>PrE-LW5J3EX_
zOpZM1At8fff7xH|P6zj$7ORZ1l9E6^PuCREHhNle1vA;%q}<$%El^-<(vR00Wr2=)
z%?y(MO>Col6h8umd0KlRFjBfebu>w@I3EmR3F(Z<^7bVn9g_R?VgI?c+~HN`#0cGU
zdZ6ld_#m3;fRuhM2mQNQ@;k>%%rt}48iCGx`5t!#uY-Ie2L}=ge+gf8S+31u+hFFa
z)y@GuJV32A5L1ljWPP5qlK0-+phwssx7uSiPf{o5#&b{75GN3ohQWWh@a{Um5tLS0
zl=a}nPOhXU{d^wPdh^N6Ze-6OhsxixIOew4=j0F<d|f64<bTSCC*=uO#mlw$?Kq2f
z8VbIiEvAOVx6&lgB}zTUc0#SO^l)g>Gm3|`O}M<yMF*s;=32bPU#`wkiz%Mxt#byB
z6mK^VTa_E_*v{?;w}EQcNZ+m`g0;EBVoXn@D0rZ)9M}BUPa*+sQHK^Yqu$Bp7Ha6A
zw}KTTmZNT7F?S|CuoJ9P)-^`|-gX012c-uw9bIXzc3f(tbM7OwAm~liUox3yc%-1T
zof85uzfOIX%l#RZpFNYa37`8D8IXx6m8B**{Q7=>oQ-B_ZeDKGxiLTQIuQBXDQRMo
z^Y^cggM)*IM^i-w6A;>Os-?Bq*Vo5v&_W9TRbAcO)YR!@j*h%0k8adH4@->72+Blr
zF6UN$XJ!w5{#VLF#(W%PA6%wEl9ueEHV=t{fH&o?n5510^02ooHOfw)woY?jN0uVy
z%la!4T-K(p8J}~;-N%98t#O3Mp%j~Bb4}6SLq*r+%*Q?b*uC*!ne%Alt1iLxh<sF<
zv-f68&QWs7jeA6Ilk9X3k^o?=<?)$@Z)d=X1%PjhAuF}HKB1S;us@|G2cTb>Vzm;7
zG?4f9FVN?SXWXwspGlv|ZL`#dZzZXPXf|hXA54io$F-;7fVKxq?~2)rw#i!ds|~#^
zkP<4us)~N1(yH5^I|>1SW^Q?tB#q3crideCh(4@5_Sc`WoIdnq0|H*uXQ|oY*1RIO
zE?51C5rChKB(NL)EoX<0dqV3)#2*pmU=yQ*J0js><BhkINWupgd7*v8v>NX7i!FcV
z9gw=Cu8rFY?7aaT=1Xd9h@YI$z*xJyi=8)uv#AJm$Or1Jh`M8KEq+^rT*lvwOl$Py
z-3FH%R637}=_|n=9A4k&+g!<r2K!YUG_=_Gcri*0PEO9rOhJCH+i!r!_1<tG43eCj
z+@nuNvnLJ5%~x=kWkKTB{lWOrA_l3IHcpY&@F7k*BL8?dLM<!0pR{=|)rLXh>3F<8
zKgLj|JUvxda_jm}8F8HeyEb>wqc-ktjg>pZ4=1JY0s!)6cjfXn4N^gH1q&prgQHY)
z^9dY7Simz3(}qZDOPm1HW0oy{GdD|&ZZw}NknLVQc+v7pFoh8oSl2iY3VC(aYTkTy
z#gKEn7IY>l;_rG(*|zD^(C862!+BDb{<GDx>M=3@z?%VE%Y5744gi>1c@3pN7e+@O
z=LUuORhc#Ayz+|xKdu6$C=omm5Ej0tVa;K4mJ1ibEM36?VSM|FsXW2?l@v$%$Xh75
zqYIX55r^ppH3~AY<%L5H*vjwN&hKzMsS+jnQa<c`=0OhtgATf{Z4W=)&+XF$Oir7o
z)0ebK(P(>5%VOaiiLbuK6TTdO&rokAYTBJ1&)AM>j7&33xN%#()y3UW>K3$iTu#2K
z6FTdGSw>jvlMzF;f4||GZsh=YYdYzyV}t68+mvuUWzj>}zF%fa?#v;$8HA{o6G4cm
zDoTCTmL;}C0)#|6c5&YsnMyQ$YN#aV$2ZF;HlIjhCb4=VBR`3Y_sS+vueW<IE-&*^
zQc^N9+U@i`$5vKXR}Ux9C}#=1J>Q+$kIjlYX!_Zcy-FI;{r<p%^;)uCy(^WWYZCa#
z7Vkt^cbRNIWM)?S;=Ral`_KziUtT?H4BQYsFD@D&A@W-kapvdHzI&xH4~2HHE+7?&
zYIl9i;&W5>S>OVMK5oZZaLNn1Od@o5NK<@=MLS=Xr+nJS`_8y0iHFe3@nlxmT!jET
z|643ojrG8I2;&#Exbh~nZcGv8)%zQ5KqarT!t~;%HIuQ5_A*@_64*pq&UCh2^cmaL
zi7bF+GQ^KClAw4?^Zsq$yOuJb&5s2>p8Xyb6>nxHsuwlIJ_GTErCj$hDw9vi#flZD
zGY|j79Zo`CIwpWE_w&pT#he$r(vX`YYH7OUVD|+UXEwt6U;TIdo?fSW2!Zb3AD5TY
z{++EK%q4$YzS_DtYpjyLMq0Pz{hoIG2}pnZ)}8i`$i0f}q*RY)d_^Lo{%xT@V<*Hz
zFhena*v-SBln5PwZa#JjQ`a<{?-p}#{ejsRh#Q6o_BY{P-O^6$-}d)OIk?P%{yV+5
zeg8QoZ$*m$?Kduo(v%t;q1e<c5O8Dm_g*lSIW!5}q`KMe?Y`X;^u=u8&tFdD9(sEE
znfZB8V<T>uM7#F`GdQDSW**r7;R?(4S3z1@T2JrgY_&1VzX2@F@p-2t=_j1uIrt?<
z_6qU$!#JUd$FaYQ_mt4@G_;+T#biSq)l_(NUfc@fg?ruYE9=X@1)1eh4Z%UX)OvW}
z5${Wg)49w>O4UD3GED}nL6A6#@3^=YiRNb{BPmQc4#a!g;=tB^leNC1sUSq@BO)Ei
zJ8BnL;0H#6|Av3l<&Y2n-{hK=a&<isT;R(7Xb>R=Z*$)HiKOv(t#@mMgFowr<>&?$
z61XuJvQhoDat8}s_#znEj&FUeD$dR0YM6uk`wkyLUF4;z{2D+Pd6|eNU6q0b&4U@^
z>8Jok1X>GcWVR}++c=D}RtO&$i&EDm7=mF>o(KL9ZWLgRx{*r8&p!jn^kyA*qH0(U
zwaqK3!?W&oJdKa{R@k4K^|tn8>!)7P*ph&g*jYWU62i4%c=)CRF|P%tYy3r=FFsdq
zAh99MF+tp?VA-39z~x4G;bRA4ZuwNBHqU=FmAL#U0~QPf$PF^mzpKI1`?SCXik*Hq
zRARg9co9<4I2rIHJVCdAe=;*OOG|B>yHDrKQY6TSCnrB%>)xb(qb>T#47-na=OfwL
z<7BeF)ltw7h2e~~A9iffnay_{gTtMkx~QMj*qT42y4OiM$e>C^bULl?>Cbo1f2X7D
zZ>lsW@4wN)qs%f8Apyq#jjpF%#!qSj8Lpf%*M%xMft`f6Yv^vOIf1~|(xMFbiPd7T
zl8M6Bf2Bd#m><n1!vNo`5i($MTIIng7)k^R+owQ96bL9?1kpD&YQnTX9B^8<+*Xv3
zQq!sms1%a|*<3b^4unyrA-W~(sKQp|)zGo*4|QpTkKaDlp0T%sv`eF8!QUld)f`F3
zGj4&AB&+ujB7i94$bVlo0Z#yDf<?enTk|U+A)b-bO9KbX_m|y4QT@uv4qsqPXcF`|
z@P@2OndR&4Wv7pGdn*JqjT_uPcvW!<Dxz^FW!_rk`M-PStv_-TOB1;~SNG?x59@QM
z6lgwqSc{fyX?SIwjr#NUd^%XSl!oWOR)u#?2z1EWkwD~oKc>^TbXL*QqDdGA15e+N
zci)5*6e2!ofHoX5ASp@1(9lp*Q&arc*w|QG8@PeG<~}N0AN{>Lbb~thkf!2G#(L_{
zn|<WC_)jkmg=M!z2_cPbX|-wYj{Yk|qdn)`@5M}Ld^c06OU&P~bG`s*nJJ`YiD+<K
z*B!8eD9C<ZyDJ}DDvae;>E`6nZDLOin*yyYzuvrAyc<17Q`@FdxJb-rm^cst=#9bb
zLfvhYyUrv^hM|FD<oKla2N$p)$jwe@zLp;h4`lONQDA_B8r)(}>=Pa=fOQ&fE@!pK
z*VO25ix@jHh0Lk(dA~}ypiRZLGkJ(jfli9)67*&S!oQ}qke|D$kuL_@(E7Mdt&xsd
zHiE++jQt~H_NM%Abd4cFFl%kcHOAeRG(|0<{U=k-{U=Pj1RBo=hXOQrBx^q?kA|a&
zOtd!6+SK`1H*xO|rH1HB%d$E*4%)t9HV27qBi@Hr!MuWuX1#zRQC;<)vnpiwoJsQL
zl)dOPxrhMi{TDL4hKr3V`Q$CB8w4*KAYf6m#G7#}+@+Shg77+zN}i(#gq;%+F&cr(
z(xhLxQvyCj3BzWC(d|A@wV9d3z|j7+cnHed`^yCuVo<;7_K&96STrlELj+9f-@(B)
zHa3tVo}N!&z;UtJ>3=*!1%7K%c=i7hE@<61N8-!eo^(5$h0Y6kNP6|lS!lH^&pRh%
z>>s2|-=+gFsRSOciG>9%HL@I6^)(q_ANmc~35c#=Vy#c<DjEdVvHkpC*5wy1EAzCq
zxo-m@14wB!G&RJDXNnbH?`g=D)Oq;zRebJD6H0t0*9Ki@-Lq_Rzbtp|RJNMNvc96q
z?ht1=vsf&rv<q-U1w2%;Rv{+<UEc0Zi_aG<LV^9!B6HH&_w<M)bksvVee;o=Qa}Jg
zooa5!WEkOd{JZPD*+Q*~Gt=|TN-W+%w~EpZ++?#RZL@W%XxAAJ@Z)8<=c0$`W2z`K
zB4eF;)p6&m$9K7*c2`;)rn&nyVw?uonf!^C`iwQbz(u^*ax2mV@LeVyZ=`^4EJ3^w
zxSE_s>xS<zs)z-qMm)nzdz4pzuF24D_xUZV&?;v5A4khJR9_uUUJbYD98CmrB1+4}
z0@Y}SES!MY<b@%6%6L=_bv6)R<5)+`Jm1U?_@lljFZ`ZbT6$crvqJX2i~;xQoA!ri
z3VJJL3g~EQrSxw94hhlI)!k@vG@Hs^3H(&1RVCzdG_}?Ji$*y!vUmG@qdhG%^S|oB
z$y^B+Vx4PxU3}F#gEvG@_5X_Ov^=VT6yMJ!umtPkk@fj^w5~6cy>o**mG=fB2>sY7
z(m;#^J>0UL8}|(w(_kl(Rui*%-b1bmqA!EPZTGa@r;)*b7qeBmS8=Px-+!5!2;P(n
z514cc`*lWPZoG%0!ee+axUes8tT$V05xKf3QZ-~HylOr(CrK3m0h7yCq;z>KwFBgt
zd2YWT0L*>kxS&W4OQ1{O_GeA0-~MleQPrJA=B-=nIVMC~kcvKdJWU1ujWObUZlqL=
z$+_8=g_)Coz7w60I-I_uzE6K@I<usR>;(?F=09)lYQ0rO2&7E7Wo@JVU>UiX!+u!K
zLsz^DAoysS#P75xM+YD;ZV2zxRYO*UIR<tW5mv+r_|NZ8o&|LcrGm?AYfTc5rMshI
zFxp1<2BgEnokUQ~DcEasmSJ1N&PWit!Z3>QT$V?LN5gg!f*aD+Xy4J~*&0Bq+~g>=
zaX1=KBCY$$e(HS8zX4L5h{o@m6NfkQ^70ks<pVJ!osPRw8uL<d^WfKoer$>8>!(YQ
z*Hl+)H`pzw^E&fM!iduSmgCD1?70CavMX+Q4GTN|eGq4G7YIf)7m7{o`u!cUchl|D
zIsBC*>#R=i1F99wFThqx@5b8R(!<M%c(HrX=7X@mfXh7zZBT83v$OP4Kj#~fpjKmQ
z6V8tt2$o$c*FKfuRqk_UMWmF+&Bz4#Qb9}3=j|I_Y+0i@+PE4A-q0Z2-21x^^^H~|
z&x(u1fhT{Y>LwOzB_<AaNZ?}Kr|OOpoK-NW61aYg)ye5PRNzD7IJ!Bhn!d1s1w6(a
za)L#`=c+NwwiDwgSckH=O05ke6nZJ>x6tc~(wucZ3CGg<@jSXPea9`hN+N^+-+a*V
z!%uOAJ*L0&tgE_fwQ=3=Nisf74_C9-JCm%c+=cB8-ZkBEB`qs6ptxjbZhjG8HAA6d
zNQ%ivi#HC^N9(TT+2$pe1?Z}jrb*@5#+DHRf76=I{=yP_&?mKP<XkYI&ImrT-|4Pb
zQL6tT86&Ib|JH8c?dSDxqe(CD-)~o(S*~b@ITBapIZhKLvFY`EZ|SOfHy##FKV=Nf
zgqQb&QsGlr@Y)_yOI5MEh|ysIfBfc7QD>)-XK4V^tp%u9xphkgNI(JW%h_#(p7Y@D
z%dIP$-R)|Hl<xbF!x@CgGVGWJ1}Ptw&iqfz`}x)*a+&O!k#^t41l}`i>ZRA!7{vlt
zKr0r3{Z%<}>bl-{n?e225_62$!$FAEm!@+aNPzK<*qkOVxUO{rkL$`RR^hb}^N;V$
zonp}}n#@db6nh%0IuE0G0pxgt$m{ZAfu$rp_;F$|xv7soVzQO-@{`-4c`}Q^^Ci{P
zuFv~!<YSFDy`^P!tyym{a{219JGv-_^83x2!GS#<CkpV$!v5uFfWT0!&0=W`-(yzU
zYdwz+NWxVFRY?K5ql|i}yXJ#+294cXwV8v(sGxD7<55M-U2*uuDc$mHQ(jjc0l>1&
ztuM##COa)Z<hj*6Q1W@8{g2HB-;JpseMm(GYy$EZg@eP<gtdA<T$T4+`I+8?|5@_>
z<<$L-ut_=0Kot#ZUqSuEqGpwTy~*J<KwVVg`m3(;A^|(e;A6ZZ3W_(3PR)&|^X&z)
zG>HmOSawdGD=T}cQk1uUT9-+*bdpv|r)ThuS(#6+ylnroeavP)7M~EK%(1d-Labn3
zUTGBVLBjZ;`$qIArUQvLUK12xkHeBCwEzb&w!wn5x+Q|NJ-(PJ>J>~^7Yod_SS55{
zW$Kq&7{x6Ag6Lx52x1Er0XdYJr@C*UaHdVK4y*toT@{1zqbdJ?F2H+=gBP>Gk_tHX
z@)fat3*8J$aBmmL2>x`<>!C8fCUAM6*oenoIy<wsZ();c385uU+dIw*foelPuMom_
zPrPMr{xu`+tmB7jD+xTeP<&RB#L;vR6OO}^r_gX0768q%V@{=k2$deq2UL67wK>>}
zJBL@~^(qtDj4Vy)4PItQaWKsk?v*);l|CeGIwEug!F~n9n&@pSiSgEp<Ehm(Ikq38
zADWG}RhL1vnL_Oy0z;~u*5vli9wk?;eW>=Li{k~Fet|W5-Am&jScwOi(bF-v@E(uj
zu*E|M2Qzvl(~-%S$=CMRMLuj7HvD>fjEb<oA5k8>TLOjLPM{~lv0E4GIr*QS0(yq{
z7a%`G>i2*ZKawxG<0e<~*7?b!Hr0<h@P??aN8ys{H9V?@1o)gZJrXP`A-b;SjuJxB
z6rWEEv)y2k?R~`AfUX;V@ue%?-A2PZeU1sUg&!Y!VgHV-9zN_kC#=A0?{`?azA5UC
zzt(m4yvU0m&Q-31{}~6z<HmBk#tih`>ry0xT(hVkCY2*IEtPS|S9FGC$J|`(-^S>0
z{@eF;+(3d}t!cIX)8f$D{x*r6XAvgRQW;Q6iySxSm*xt4J1V0@v)Zb+kJe8QIsZk{
zPBV!rOu}cEqm&>_I)T_X74_JT0b?Ibqi?p*f(Yw$@T<R-Rwe!-0*s$l6Z&?j2RF2L
zL~Fj)%MbehmBXK^ClWyF#b3xiX7j&mkj-23&p-ema!l6d##$YiXdgTtMp0i0`pwxN
zj0W$juU<7euSm0M4&a(2zKf$^dtB^z+5fQN36xAS+kqUY^$NS@eZfcjE!63rVCKsr
z40gObH1Q*=(UySh&*v8d(lf!pKp9-RR5InF*$2IhP0(fQhkPuv(?&@Vf6Mk*u@8!n
z``8FA9RZcxWJIR<nZfYVLEy$j5pvc(&%@CqtSE|FJMzxo&rXIDFm;`lo_$(RTB6Dj
z%Lgx3C_M@Q@we^3H|bZ0{dfrdi;yM?ls!aOhcbT{m0Sm*9GUuc($a8?2kA>rRJpse
z(YFXN4iS`PY|wT&MK!wKTCxA*fHa^QmLHrJXkYz?5Q9nJZzXO&nL+n584Gvsmd2HH
zmiOvF$%hQgHB3AG_*W_)gTiU^O{<ZxoS+-Jx!7zoI(>;-CL=A8inf5)M%>mqC}bn2
z!6uvuJckb&kFlFwGEt?X8|;s;5%I34hFg5mFLCli5PY10%hvZ#drmQb2mDezJ7~Vo
zYQ3EZt<QY8F*-k(Oa`e5;3|O^ZA4yYTQ70x{b4T;{y=!gs<76K{K}xdpufNziXuEI
zsysh3|2yq->_8Y+$?Zk(7Fy(Jw{;oC3B89sG7yWCvdf{qh(c6naorYN=a>hx{e9Pz
zvyNdFN#kX4Lkd1qn(iwsIyNCG04!j)OY+7=i=Q#&577Rlrz<7H`;Zow?bJyWE8eq3
zd%a9Q5>ItiWEq6$)jL((j6LI?I8!oT-fmrYLn<X$b3DYL;c^;HG@?sZ)Kji!6*t3v
zeLAAL?%G(Tj<y>o#*}#49Ld&2?(^72eW+0V^la!Si>DsW_vew&YBps-YRy<Rs2Eh~
zK1EeEZhz<X24Q?<I5VV}C;J!fMg`75QqU3R4=sUfu@OTZ54jQ>1aLH}`^NsoJ<Ghj
z%GKq?;NU3}#k<Lyv%kLT<4hZf_4NpwJv;Z0+W+DnzX~l67)uX=rNF$7bS9B2!n8C`
zyfUR0`&6#SI3!3k%&94Hffox&DXD#miYxaKH`GqEfdFFDRU8m7t4f3S=}-azYrZjv
z_e)&AEQJ4==Imk|jyxc8ofB_&zBM(df1QItrG^dDL`6cMG;h`6i!$8O_<gRVya%L$
zrvy%|Y__e0kq%zRy>Z;%zywOr)?n=$0_yHn&u7p&Vx#au4F&l{ONISz?3Kgf8ufjl
z>S??GXW`VF+>jz?3aU%qw_xyJXORR<MBy?z)Gi)eWx0We_%j;fMZMBRHGlD=ma{3k
zYnucYys}YJp3}o~CP@P0?SZZb)6yb&wFg&c$n(C@eYPS9{Iy&C%}$3YEtaoCCSCTG
zn?{S^q&1~u^y&{c)8$XrOXflQlcCfx^T~o6h=8<Y7(huJna>GZRQdhDLa4V%e{#R9
zfXV_8!3Sg6RBuJ>-<|SnxXwC{<Vw0<gDwgo0MfW^j*~q9f_{zr_F$vu0%xy6hNskj
z2@l^ki`8@@I4bDjz=tw7APs~2^n`eLHShrr?64495~6IE!Bc5+^gDNbGCA%pj%e+W
zB?GoGou;VkVu0P#vm-Z2f(T6O`uo^fW6Ec-UmRDSeN0w2O<F7cTIGB(G_J|}Hs|J6
zjXy9khbncLr@8LSvIh(a9HQLvz9%++v@9lLXWsCo-VDl4Y*Q9;CyH+-q`*T3KM}u;
z_PTO4`)e64=%q(jZXU~@BUuhJghN$sh}PGyXB3Tw3pFWbbtz6l1D+Nz{pCSvrCq1E
z%cj%CSGxdsjegJ0Y)MFy+t9<K(4@#*zbakMm_Az9xUM6*ZwTk`$xP-P{&34j1O9>F
z)a*jzQL#rjHy@(^(>RDj*L~-`=cFWXJJO0zNF?k-k43(1jIOeO_!ZXUUi}+O{>C0t
z*YzhPaJcL}QvH0<egQ+AyWDH$m8T@$fy=(90du>Ff2R5+hMF~*TbG$NCXr3E9?dK;
z%)GewK~=6J%I^6-X1{NW7DV1HkcnE0IB@-5f%o#76u31faEN*>m_?bQDYg%n_^l^;
z;@-ucVJkG@kKj+o3Fm2+>+px#8Pv>5b|2-C9dA_Xhxxru=BrK&O`q_b>Q8N>SG+Ee
zR4c6?-x2xg5jXQ<KKfN8q%n(1s9s``z-GjL{-qV5+i_d>l*0aBsda+4zmE(`wUZgD
zk^>Z|8LC9pf6VkC0xB-$&_IY`@4~8E{a}0icf0~L`X~JAelRxwJy?5R_m5v@>#X`L
zCd+}1`%3$37D>a~7imL-cKffhTpq~aOhL51WzkjLO1j|5Aj}hOshFCFdSXi;!E3_)
zq|YpK%#zUoi|08b8T*WsF(*;VZjJ#86DOzdIXQgn*Hdu@y-k(ccTz91Do@maA78y@
zQaG4OdZYcsL8Y#YFNS_foU^->`=bm<|1EUEF3@%H%w8l^P;53kF1cA}@^}ul&sK7)
zLGBwA@xh71&xb&TxnBTt?kvUa7vWKw<oT<}@s%6qI^3xd53_l4##4s{jnnl*UMnEm
z$$gZs)~~GA0FGO9EpDljk7pV(uo54*RO^Q}xN}7TNxB3r#{r}=NLt5*1M*m4llzrQ
z@6q;wL?7S(?&Ao|$n}-sPBVrxr&VXGB88@1x{$QYnqfES`O=OVZ0<AOtxF~G+f|;a
zhg%{CsbSyEXHs0Z9lcofuS^6){m~;ix{V*0!vgw!+D~U(E8x}XNR;Y<0wRp0D12{|
za~_l$76)($fBj)4qQd72%d<xAWH<&$J+GiQ?OAi@q0~Wwg{b{~vhapUHW~y0;Rt=&
z9*N;(vdjr1qe31$F?~D&eqq6ze+h^qEa}<`&w57vx=~OEk5A&B?;wD1YYKllJx21|
zxqZQilq5|K!olOYWa%XVOUrdq8acE~T#_rYxG4iD;4&53Auu$%ELv@F7v9NQl~+lg
zC`29eMelkC23n9a9hNxX$=W*VS4Ty;SZ#gEjeo<ZW9}i8Z@MTu@^vuRsi^cpmxI4Q
z*j(NB#66?T+sB)fqkT$#CH%qgI27uLXxO_eV=Y`9B%X+tMQuuOnsk<XDFlE3N!)Br
zqt=bSMiE<VD<Oz1HBWUULNt!0>Hgcz=X(2p?wqq`_oTojFJbs8*JpK*s9}`g8(cxG
z;DI(&7xW~Oy0`ps8PCem^z}9QM;T%GlQHUH-20;T&vJ#vs{;q&#!i>j_bqgOW|X4B
z=;E>(GgEX(QA0x|5Xg~@IJg)0>g%rKN-9|9fD==}po{e`MD}X`O8n02sR2?5PtcHo
z=(hh{M|)inn#DNBIyZp+qd}0d%rGfVfw0s_D^`J!GH70I|HV@EKXwoj3?|*zFmck_
zyDi&ZdiKvq05p%?lZNAp2BuG+ya|82p>#wXB!4+-kR?K#xb4i?;*bfkDMSVSusT8R
zt_V&JgALkGFL{Z=R#0+Mxl6f^oKJXtRr3OH53a}uW-j~?9<8fAcsZO#%ghhJ28+LI
zN;Bs3C;z&Wrp)-Cjz=@)=$_Que?sJa9sa}D#!a(dG1)zuIqG-y$83DfIi2-)WX-aA
zZdBVpBBiRV&11dH2&*|tL9$Pv!@k16aK8DT*g0`x4<iLoUHpFMwKgjhz;i{1b(73b
zYeI;Uo7Wo_eyu%cgU99Pbvpr9)EhBVEWyUD`+HGCTKy6rWhyQA)C%TPrS!Dud$%O`
z27=jn8YVCJ=PUg`P?$I5za^}^V$5wa+Sg#iyjZiVx)kkC%u{T;d3SC5PR}o38bS)2
zKf^>pWI@#*E+uouwz11n3JMz>TR|2WFL`&sgqzlCh<ysV%H!2B5H!HI&YUc9dCo1=
z*&d^)`pnRAr-_mEDS{<0?njig+_(H>?1=v8LRH}c-loYC!cq`1|2@&x+|kXd4#h&Z
zl1FdY=q<13%XBw#ZJ^!U^uWi3N0vD5Q5kO2hh6ECXkU+6akA7o`@grUTC_6<p%<ks
zZ{#2D#KX~%yB2#}9GrU?2o~D@;eTuNsgqK$`H_i2PfPzhcn?R>TR#BOvTu9nRH#$#
z&;FYwr2I;WDW3pkhYe?=4pq&s2tdUhuG;l_&VNM<*(u>g_poyv+!8xyowa;u-H6Lt
zw!o)9`sB;sOr-Iqdr-?h3T#DRkC-UJ9N2Zwm^RW83{%o0y}TwWkn@ZOEk?@ZPHn8X
zO>P6TX{-n|XzzG&kf1B5#fAh@2emhjI)kW&3Va(2%!QC~F0iBYy%_=!!c_(fPt9=j
zWb)kVssBzMbC7<UJ$$%oznpP)NPA*RG4oLtyw?A+ZWf$l^ey+|FHPnR9kFxy5&}!H
z<sC1<J9p1|(c&PpV|*=bA#C{IzhaM#GE)f+aYIeg6pdYu`sz!WHbWLCBZ1sPM0iMm
zXIv^m_j)QvMPp1pDlf8nx1gU4T7a7lc2g3nsB$C>lcMzZY2_!=tQ?}YB{$WD^>^H>
zq{djnSIH}h4Gt1@#O)YB_yv!fF4)d|A^*uc;zt7JFCJyqpIgx{SxVv|oZMTKlxJI^
z5TacC+O#(2?y(3R+{5c~$7Khg?}%H@Tw#2lM2YY@(LUGh4eVmhrfGBG_HY>^P;v}v
zuCl%@v7#mgmPcNBSD~z!O+S53iE;TNrd}^-@C*SiWl}x|;<zRHPDY>w;uqU^kFnmi
zlXm@%t5-FngMDlXNR955m9Z4`l{2a<MNTt#P3u;!R4M<r&-r!u#WZ%92<|T=;8_d<
z49PL1j}fe&IOak_8@O)N$#ma*<AhpwZD2-e4|dLb0$;Ih4dJW|U-i?$#eeknNFj?;
zI3O_c$23yS0UA*o3fZd$R&F5wcJ*qZ?F*AYk_(@Lr*sBp1`L$vx{nH&tY-4ts57|a
za>qnizjrRP);7>jj(@&uA=z7vL-=As$(=W4cK$6&)&bS6T;(4U*Wkkpd#r}{#M?)M
z9B$?))&6Zz)=Wf~chQjTZcGEh+#3H1^9H|%q25r1(omS?;DdSj2^^rUjyDixRc`Ov
zK4f~s`*$53+rGJe$@>MpiizO}Nnz=VWN$vGc-$DcL>|umO#b;E>wCb+sIbRGot2|U
z+k+r&u&(;eeV)(hWv5F<N>aq^G)yxgur%%H^cM?2)3~!&lWJBZnw|PXK(Z`xi3QJ=
zEBPIR=ZhF8ltFr7_@xD-QWPmuIpq<?4-Y!hfJMMl5<52>3TUH7DJ?CK)UbKuEZD~&
zgxF(iu2<h-ohqa+%BAiM=UJMVUh3{>tUbT){PkZtXzwP_F(|KCleBYWyWl$VJAH5M
z%7NzMg&Ao61QZ`IX?@t_1_E8tEZM0axVvJ)m=^|;0i=efX~}yI^Fl{l_In<Zo?j2b
z9<E=#MUGBDjy4hf-%h|c_qdmj`(9#DK!TWJa~oqyhfm~1l0t0au>58=3U!B76Ya3n
zGgtW4OS<D}G#UPSaYJGJp)x#_z3-$@4oeo5cUCmta!p=5UEy1CGSRh(Qv#;P-{abA
z#5M<92Qk9jg0RJf|0pjG&#f)JGA{Zt6iTDjr#&oD<#nY+30-YjLSr(z;_yl(cz?_S
zE)jz6pBA7TUn7RxpRVR6<@v?BiP-3I1hNg}dbWT0k5=UnZEdd0RBCI9#~TCxTbIqp
z52A>mLBY$6%?2H3>{snSFJJL&SE~}9pn5TeL=5F9K;`~_ve8`seM|e!xFcw@*n2pq
z=XnQLszWtC{6B3wRJ4fE6fI$xXJo&&6cn&II=P<&Lz*(>?+pG+7@rFaFKwM1+wHki
zMKzy7o6S1K==}0k7L;(gYkv!D6KLc^E<Ui-B!||>N?5#VS4@ANt2WEro<lE<`di-i
z8B_-iO;be=2RI44N~R&bM;x||fxVWshG2uSBG7AVooIHq0a6BrB5kgfu7je%9S#ks
ziGNxI3j{@#J(Efz>X&3{f}!of5P-0(1l!wm8;mg5r{%?se^xtAY2XY-Ww?m7`+<7C
zKI<jYE%3pIr68cZkQ2MlRBj4A%9P@7NIX#0ue~wU8IItry5rBlabR|}p`}<?_KjF{
zmP@GUTD#m|MH+KJP9B`GJiwN2OsD)|M->ulK`ENFz5NSLbkC3V2{uoiH6wMA^HU$7
zfh^1z)p+FjdN<z~Ny_bdZ&d{wJ;Z7r0sNp(z~_*VZ!R#dM9^_i0Cl7YhieI!C03pg
z5D+B2#o-D7s*3?Dhy{0excu)zAes~ET)8gWvSBK=>uU7c5q$4;GIMcxYuSBijV#sc
zif!f>_(iXxt(Z}3uy#<4iUfk6i)gPF;r8YM3a7DwNZS_gBiiOYVKPVWR%2F|<C6CV
zF(3Q3KMG1B=I~20S9pX8F|%>G-HF8A#`~15?P!$uJB7zZ<&|#LOosuSF|lGUN|h<i
zDO)lMB#>3td<)|XVf^m^t2Btq*Ux|RMu!mxseoq&7v-isalEIgxE<Yh`jDDc0Y#v1
zd?YB`saZXcZ)ten$<vieT}!o`u~D(y-QYQEqsn0o4#<BhsHKnHg$HX%#_N+i)#W<)
z|I5w!dq42A67H4a6ONAgU_iDEeG?D*pU^l2{q5(oh6Uol*y|_)|BNm=)p;w6Awv`M
zt`h+Xb871OoMglME5zo!t)ed>-OUdnGYcf5tv2_N=^@L2MNxb35M-Z;_Itss8`^K5
z=W`<_OFl2`wo=eEdrT1QIWq_KKU?kn$pU{0=UpJtUAoPij=cz^_@wGt*iSO6OX1^d
za8h|<qg0q&TPwGt4ArP$*Xhw1e*yU)<O;s*d~N)guV#%&Qa{DHrdp~whA;_BG-+SA
zs_%r@^`^r%$CzxcSa9vly<V=_2cyonVACDQV!w!ZU1rf4u8;l1u;_pwt-SlYGoQb3
z&JaaC+D~fjqUta<6%fD}MOY+u@83ao>@sl}p+m!8`h`oP=I0-2QdFu;-T-hz8<9}?
zL_0(bEM38nCa5sk9^STp4nfF8cNL7CAF>@m<J6e5f!{I*NLjpNE|!td2&qFwI9dY~
z!i&Ki^3uXH>p>TTl^cyC8YlKOTEfY#);Us&>~#bk4iVzNJu8V_kUEhU_Xq`srQ{As
zBhZ0xN#M=Bm3V|B?0cyFjIv$V^)U2~5!e5MIx07X?F-bHb?E!TRXvWOqBr{IfutlX
zyBytmZT^7|O)Q!(tM=(+^9>mRxRE6L-eiCI+K_xT^mre&J#cKkU!vn?=PS0k?|a)n
z9&v4s^<Ib?j%#bQqJuLZWDll+cw%6yohGt5>tk|0s@V1IB$h~Pqz5{5g0;ogx2a^(
z5j}TWjky9=7GcO1t-|m6gj@nt*0y6WzFBfn;;r7g4FsTZusV_lmgVTi06Kr$YJc0z
z_N0U-Bu1)fp*CRzemizDHNBWw$8Tu2vmvDFa@W}OyvQ%@FnnyKl)%22vTf3EWl5(e
z_rlJzE~gm@>nTCExn__Rx0far2bZ<{|5+96jn=5n_*p+rSkREQ{*SpeZ^F~z&qUmh
zPpzOJ$_VBh_pMCmvQJ3Y)rWu1>=^cDa%Y>m`hhq5I)6~TyZNg=oG*7@_nWp08R;YS
z^cQd;R?!Q~`@(k{<Uk5|T<m$;mn({x6Vt_}1bN$+Gm(u7s0Qek<t(I*8TkJSC(h;l
z-O<E?V-OhBnT=AF%d5lwup#Oa`7>J_e2Lp{9;$z`VGpp;DH|NiQ?@oIDAkdk6#!Ra
zu6$nB;X;F{xp{+3E$JDmNbgP+zi`GKw2RUyUQ9k7Pv<To^k^acCQc0;)AmgIUHqM_
zsyH-`G9j{DqRJEy(bP0soUP@c|9-l5H?w0CKa9Fsf7&VquHSW#+RKxInI3O+^V$kb
zLON=3-L$?7yU+b2`JjJYd;^ud%3u1vEHu}f^!|6gL8(pRtFRHV*=}+nR-@HRH5@i&
zlKyS(9ak$$1gYQg&RMQ?XR*ODxcnIz-;)(QFA|xXXJ1+{(?-rH*Q2djX0_p+^_)(Z
zETIf;-<t&sB2?i;L$3H?0QC&*d3{|PL)EURPRA4cnOgktW*7_YvKOhf#6GBDTnfam
zXpohRCwDl9pjGk7*kIk}ahHuz{;-Qu-J2F4B8#xEPaU}bs~~jA%Dg{K;e`k3*n(X=
z)APYS9Dn>=e9Ni98~8-%En*~43)0Aj%$j8pHJr`Qkr1yQvYC?t4QD_6gsj?3l6^2j
zJJ_%aI33ZRB>=QvKjD|$Cx?3OQEk<K9&MQy5=@5q%^WGY{)gs9<T|rv4GYk=BRhOD
z_SC^gtH&E%E$tnQ9!*$Gq$8%FUkOM7NZ}1(A||#d+ob9_iVu8wuN*_e>4(e%NYB}e
zm4c&^)7BCtBn$+P96z%#tPjtPiE3#4Nkdaj4k|9=M{cZC7+PjCLm$q5+X<BG5dGf|
zWHpH>I?RPp8ZhF5B8u=if6;=L<G69LK7<=O>|<}v53R|aUv*~8#lpm8*Q95M>EvNF
zWR6<9b-owUJ^|?x0Ds_&*fkfEpNxqa;urTkD=L`~dj;ahwR2E`G0Z9mGFF^LxD{5^
zYms(TGsicB=*ho_0b3=>d@5>zE5|RH^0AAF^oBjwrzYFm>hivG3%@gB2NdNXusOlf
zfb5odwzjz4pK0k`qa#~Z`3uQu)2iLJ>O1NXMPU>KIty)dYaGv7I<i3to`;m^^rsFV
zdgYbx<x@M#TiGW!|A_?EujwLJeX`iFq>b*Ihkdjq&~bFewXf7(3O`J=1?Zw8Khp6|
z(hD|3rw!98fPntVf;bz==@${QaiwTJ4g-Jo7#uLbsHr7!&Wf!`K59=n1Vw)W#?(ku
z7&zxj8!Vu441y6dAq*pG+B$;yaqfbd{18gliz#lW(AR}d>>59O?FW1LMM&*3t_Y|j
zuUzo3Umr0lBZAGcOzu~pgcV;;@|6;qU;$CDrX$Jx;M{XJCCc3Jy6GAo*_Ag0c7`Xy
z|F%gQHiFq$+CQ7c#uch|LE#aD%J1yan#$GVLhfP37#`5}z_zJ^1vXwXy(@?!5u8*8
zSEBe1YD{D0@ka0dyhucXKu_#ryBEd1Gs{<ek@KLWSsgnen)T3*;=#d8DC$tLmfO3x
z(=6~993UX!l5y)^n1_jov^d_&Mr|xuHFEU{2NcCB??ZcT?qZRf-y{V};ZyoWnle&Q
zz=`tQpuxLOX%<qth)rn*C##A)tgVxIX8WH|eiO3;w};n}7qy{rr7o9D$jUIFKE2~n
zEgmw-$KvF*VB=*2GWQH5g#<q4)ZP_kXR$#+xMp!|19AojIfR~)@rwgq+&~1A@!)B8
z^e<K0aktG-BBP<`v7TI`Y!u6}cHD2pFu9NbTUVK93lCVN=`oq*h@nP@Q|K@|AmhYt
zJsv2T)+--%SkV9duRcL>|77SgfuGJLd9<CSzx8z%(4~wsKu!mqnBhgdZ7y#pu3w1N
z1|FXd4)&UtsQXWupYF6-mwP>3ZnVIe?zTXRN6V6m0>4Y0u-CRxBxqMPP4mUxG*_SW
z_8T!#-ky9fhKzNz2XKkvcM2*AY6$vMors+ixYAY>_Y48ts34eW*qhTi8)2Y%ebIEa
zB4(1PFfaBEY0LP`0y~W#7-nP~$Fj7;@%)wC_pc!THYW{TjOl{3;XMinY}WU$SldAg
zWoTciH}XyV2`k~9xHH;@4V&f06YW0Hj`bV6Jr@7h{2BT0T8{>XPM@q}k6}Zu5Z`*O
zi+N7;DnY4dJeRW(ZD5*#vFu+x>?qORA1~einvve!O$G~|jP}X#SI+BbvGQ<SMjzVX
zRWIZ?&!$BY{=xrgf<*Ek)wY<r64!ne!!OBO$4+!1#Hk9EasVlD;~4&0DFY`bU3#Ui
zcu{lL8T>a}3<D?6e@ql^G2jhqF1d@v{S{(=V%$NDsH8RMo*DPZNaU4WT%q|)l98sg
z^2g+VD*NDaN=RrBZesDskSFHwxH<abfxI-_-0lDL32gMJpnxVD)WiptE#%B~UL;as
z8@1MqAw<pnPXo--6RntW<eGe9ye~8#%(j+ok=7>w#HQ@$+@IA?S`7MS>$=(bl2#hm
zG#e5OG+1_Fv=#FDoxPjO34Q77T>F1>0dNl97b7|E{HYJNedh2*iG-NRVRxk|4B%c2
z<o6`j#VZukPK>^ib5lubYeG6bS-McF<0!9!G}c{6hr7(%*Y~#grSszKBw(x-=f7o)
z6BfMtf~OIv40i@^HnWB&eVPB~+<x<K2~}v2qBwc|NM5)RY%6QL{S{~6VP)-oA~v1{
zPM#J<hi;3*S^^s|HW6c7fJW1(;>6!*&28hF!+q_8u2LC%27&v~nQf||YHhksX>}nQ
z;Rj+4@`pv<Xd-)ySaJgP#0`#x6wreBbfLQLtNHnfg-Gv6M7Tf)h5KZ+Vs}5WYimcM
z5|8sm3jtEEG|I9>8Tr!mF~04HqCF#t|01{<pB5yxaW3MVXkMMA+O^_ONie@HoE`O-
zo&{}Iiuda{0k*V-wD3b~D)h`r%eV4?&Ma8{)<g6BP2IOn<p2UEm9r`)FYG!?3I6r`
zBp*)w(GEA6b-aqi|Ls*(m#pVL$q3CGWdV!x`&h}+my4Q9j%T*Pd&MN5Lyrq)5h7PK
zAW;SY6jbuReMBH2shYkJG-^u_Q!_)R)7zB6aW>P|99I$ZUsY`O%XmI{Pi{(mWrF>&
zqxLH9046Te6@o*WTN`+2SWbDDvp2v4Kq6L$n`<nt^-Zgi8K@B0^4tXZ3N1FoF9k5n
zoowe#Qr;UI&9tiaBG^0g=eanILY?_!$KjI19)I;l%ina4Y*V)Xz|TM37HC;V!PvxN
z%!!ohdt0@-A_41va#W@3Uok$gqvj^PzY_yHAh5z8{tqiIRf9fzXvU@G8c9wu#r{ua
zdn3w^SpHXTs%sl?Wkc%A`KrK=#I*GKUvJRem<~)j2p=pzb6*wU4Bn9YN|X+`5ZRSD
zgdfk3r)R0*XPe_J=y;g0^_a{E6wL-j7f{}GJIJX%aQ+Ky7FVq!2bMTu7GbS7M>xO4
zgb^9(BZ!{TJL-?WC&ZHw;85r0oSCoJJT}8C)onwfM--dZz;GmfnlYWrv5uf+Y)K?C
z3fwACcP1*8^j)H-p<4Wq;^}Xydburxd1@M#6-_S+O+K(3k+~LuGSpo=A7Y(uJ#;(q
z#h1$_k6~@0*Da`Wa8-h+`3T(%X;rtx$x~8SxmNs7&Siw=CPtl`OI=lxn+lrc&wVSw
zi11OW&M8dn_`Txhcy?gCgQ0L6Uh_Qa09DO{$1!4sO`<x3uHB}^;UtXH36Ck)&Q(uH
zF|yMM3*eUoO&Kx1!r;7PU><I}yv*R@aVLtn+1YfpV|nW2yl|9JD<Qc_Jl;z`1X1m$
z5fRDwzHGJH&{Iy8idl_Hr0^kNwaczx`tj!SL@kZV#6NVu)7&8MCcCaAF+7=$F}<(M
z&#<`2+Wik%SFpLAX-KrE9YQjcE)Pl$Kmj;9(UKZDT&cyNl@uOss!iNKP4S+z={5DZ
zCp_iTJi@^luRl}NPOgOY!X4FUP9|I3;jcG_L_?PHE;Q$y7CeP}{tr#x7*J`~hP!i<
zn{3;*cQx7e<jJ;cvTd7_&B?ZFvTdLJe&?Lu{b}v{S+_1M1-<2UxmEre-&{WK^L-E#
zE9-XzhrAzz%_r4xyyO4YhXnzXr35wm^JyxEH_6*K5&F9SC1zSn4B4bGUhnd^CQfB&
ztw8CF!dEO$1B&c0w_X8sirF94W(Od~?G|>~*!3D~!;8#$>zqTTD8F8mfZk~IknudK
z+T;b7!tJ(C9A>}XG@^VE%mnvMsj(2*Ei?SwzqP+hn}Lxq4VT~F(yLis26w0uW3uXq
z+2$PLqM7Nw1D-8^8krTn{;P4f!I&MV24Wxs!sjntuh){D;r{#lwg<fwXrqg2%WkXo
zhx0s4&@lB8{UtASE;DzWc)y{QGN-I5OCnfvUwR!PaY>32RP_0MC^IH+ZMJs4{CPjW
z59`OaO^V~5@!mTQA>io>3k(hlKLRopI%LrPhe)`xH^!&PP(URkeMq1nS{I3r>34sD
z|A&h2qZ!>4v(K3~Q7GT0*Fmyo7{h~grPV=GR2T+=FZ?+u8Phajxnq`aVlBWO&oogn
z47Awd!^b2H4N86AaEk~ryu&HEd>U|DZ2MzqGa#bxNxxdR=sXY>2&o^)TtTarh9)yJ
zU!R1~&hBI$TB9<G^}pc;gINS!e!BN55CDP@6r~L~AIM@31_PH2U7f#0V%_ckEn;%;
zq~BWqGQR5E%dFTE`rL@$?2^%0o0|jQ^rGY%`ED9Eg0c$7nhf&qv>d0_!3hKp^tVnT
zkqOx#-}IWpq;5o~-Xya;?0R~Fd51#>s;2nfeO7v0wmoI#>?bQs@l2yg3Q&kO1}p~x
zGsrNZ-n+c^np43Ifvq?@+bmu-+b^XFwu_87hmrrHZz~UaCbH*zr808jb=O<3H@j~W
z`bj#triiZl_?5mSuL$Zr^f5ag*;={{?g<xdWf`ZT{6`o+X}IcprUc`P+ob6ljbeP+
zd?Z8oy3=5NAilClngaZ`jzew}T^<u9f>1sc=Dp@<C))V{4bF|%b|y<PZ<J^#NwBWO
zfrz3HJyQ*SwQ(oXy<mVaVUZ4&&o@!wRhB*eSMNu$xr^U-<Dp@l*?b$+bnUE$ABQ0j
zZ+j&p88YU+ghF&<A3MCP2lAsZUMUi9!4u9Wi~4mMDcSWjFT?!vUU~D14ARYA#D5##
z5U!9BU!S0F^(QMI<zH7R&!h@PV87hrF}I+kscz5SkK_=spU-|IT!oSG#nY%IEbxt+
z3Gw@qIjI5xSKV+C{7H032B<G-a6Z{#aWEYww^mODn>JvE2YrR%SWHZ~b6ia|`1kkI
zi9Hs6Vf1t^DwijXLuU=|Faqr;x^A}1T#HBc#z{(6qSftwn5>iww`zRHc<#Okq87cq
zLgEQk-z9P961zFcZ##A^yq+5(<YPrkG~!>d0~aC2%uYuzsIDxFWWa<ooCtQ(;XAad
z_&sq@HR(Nv?H*2?q|_E=_a^U~y`0EAncSa(9z&~my3CyhuZ%D+Npwr0t`s`${`(&e
z1C9IRMo?7T+Ql(;FtIO9M#%0;j8Q}(pg$p{D)jMVdM=f)pW%Nf-|xcW=R9sPY};F|
zX0_~g(}=EUgCc@Ps8i<P#i(MS-+g;*8f@NfA#Auy(biccdu$f(UFl6YD^zh7bR4z_
z({coxkuc^M>s`nGa+q8j!6=LNj8<?wDL$-XcQAd<!oD%eHFwc=53;VMDj479KWD!#
zz;=I9TSn%w$-OC>B@X@)8;Phaeo3yMd!-l%3fas}Cas5<d-r5*Qq*3-WuwvFzr*^q
zpOF5GwK`(91zd5Lnu+xJ&*J*+;_zR)E*Jo?OyuHI<%hBhas@Yq9-3qugg=lpJ_Y)F
zpC{>vXvQ-6EgOV?Fp=H2jy<5iPfy4&Ch|p&bAyDsu7~X^ccKzns{E%(H+TJjvBvpI
zeKDof%D~&m48@fnR-$96v+Y7&bb=l~a%K7!kvAdt&&^f6^~)Tg8LCGd3^<iBr|-yi
zqkHQ01ai`$1b*rBhX1BLjvjN#uf2A%Tz+`XS)lZPao5u|eS<Lp`2WkYa3hP)tsFV>
zK!zHf!21S6hpi@ezR(@j9S!U5`Dg+GO)e$3TUPomN;>Zh#D)iqEUW{c$wJQAXp5nm
zV3*BKs7o=Zq|=A+%Dzde>(ZR>G`{|vEASOm(#sMLh-Fw-KVP|3Gu_I{%Tb!LHPCw_
zIH)u8cp|*nd#A3ATb(UzYSC#{%a$vr=jNuqET^R&my)Wbnb^}PR>S(O?J;>zfb;96
zqCpqe{d*7!t~<t$J34^y{`xG=w0}TqFwj+v{`|F!;xe;&rQ9137w5==O7JBnH=&vN
zys5>47W6u`DH-fJe8nA*K6})S-*RgG*cO63UrM326>)kF38;L$T63pxkylj6k9~p(
zRi8Q&aFqY+W!a>0NtLAK<ovcYW>DZQTH<p0Wf9SobepAAiuo;w%z3eTRn?=lp@;Qp
z%X+7ky7tTP-}|~<j}J&I_~z&3>6wzmUwo<$gZ-Pw>2Lz%O*KD1pP89yV`H=Jc~;%#
zboBZv7<Hjit~xX{gf8yV`gDIX4*`wvd^F%I7Cci&@j!GWL>4f<tf%uhXbg2kKFYBB
zBXOC75W)}G0Vl0|`WICl&|4M(5CsU!0wDl1Yl02FZ!RiV!D7o`#$cH}&dv*S;dXc1
z*&c$IMkVKew;4&ST~*CXT`~SLXb!|w=b&-AgN_NXH-OsS=4YF3<osK87VBfYewA!m
zYF#UsSllt?z$s5F4bS<wL8py*c?`2tYfGrlf<`He5;+K{vzRS7>NK6o;sN<cuySxv
zz!reaLZG0aK!!aaK|=54X2)<0fme^5udkrE(%w+?+0w<Ia~J~sPa6wd50dGZP;B*J
zXasC`E&A<^U_*;@b~HfP8!rw3r3MxC7ZroGvFbtCAGYI4)PThVlAOw^qiX)g^|lZq
zi4He#|3!0OscxsIg?)uJHT#S7Z2W2YVF~&OXODlTiQWQkPP5;FBdzQfj_N9q?zJ#4
z_u&DV%1?F-e1wO`l^yf=ivs%%d9gW8jWh>5fIK^8c!;k-@lsSsj~tAARay#IQextN
z{UPv6OUV4tbMx~sNcbx=Gm7f!ho`4-fb|x;Twa&cXgn@mU0wYl3$JaI?x<nGplw}K
z1zbcrQ3&L?!z2hDVmUgLke9H|94_IU30ue{2!M$)W8K70s-8n9EGbro81{u*pKN~I
z`FiWafuMnvY0^E{eXy})%!<?)SEEqx(n-xeAFJuzfS4g78B9MEXwO9-j3f*!s?XPT
ze6D3z3==-whx2W7`I+7~+B9#5tFztQd8<glr!W7d<7POxQa&Ukw_7=y=~ZP%`UmyT
zzWnffb-!mN+3uVmVt=?5nq{XsJZS*&i#F1@HURKSx!5N{r+@n1Nm8ZN01fDVJ*{-b
zfb^f40m+9}aM;YeKOUCxxNIT)&(E#t=;+LkzD9=Th>SE*KWpdhPCO*$qwFVvTaTo<
z@=^MO7TRHPN6{iN>+TUKAs}LBMwtDykku!EwOXH4&VaM_OQn`^d*l8X>o}J*ej8Kr
zt4TB*S|7|LLq0*Z-8zN~aG#L|qSE<WMr0Fa*IiK>YD=tl-dc<$<P(;uQE3^Gpl)Q_
z+Gz4OVgb_RpCNY&xQY58nb&hsJU#LyHef?xav8PMPpL=SsgZ>yAG``?!m1Cbp3r10
zt9|#11w1I-%-xX?S#Iz>?5Ey$=1bi^{>|PLEuz=<wDPIAAaWg@SS803iU9Ju)^RWQ
z@m2?Of6W3tx_)VVruI42z;?J^c)mT_gop+d#D3V*Gcmb2Ii0PyTz#MogVb;`GUM@N
zl7s>v@=7*eO-+sQP!tZU$p{D^!mB4`hs_UIme^SG0*3j+a(He+uv~*`;#F87pOo^N
zzvXvHL3_5Cw`QC&>Hb_g29D%Iy*C$Qlm6IZ*b?ZdNou>il&QQL2|0Ro0-l9VHizEd
za<}z#)G#8Ah<9(uddwD(fGVokX^P+A{-7q{@8~ns0Hxn0oBQ*phvicQ60!k<T>OOv
zZ>-_*XZMYixaIoU6y(ljsDxmOI$w1O^TZGyAR&TPnf9*x_-m9dH&f%U6C6qEc+;Oh
z<yBSZhITeK94st1H#Z;!?ed8;D0T5>$CR8%u166G`HrVBfCm6RS?t14aGNC%J2`)r
z;;|-uE~7|pV+l#%uSzATGRB;KZ>bJ|wWesWv@EBYr^k9}rNXb#<Q+>~Hy?b#-pzi%
z`7?ik=G$85-0wd~w(aFMNJ~mf`?9o1P4zbK)V%F?7)QVYTnS3+k1y4r$L8cwG{4(9
z!A_}G8a!?&Pxg2@eDX!FU0SAI&R*3wR1&DZi(4(Yxe!Y@C;}z5>{VrD-d#ul&?DrX
zOWpSiC0b%&Pk@3hF+Ls@V9}%vXmvb@kSG*UVyC1uJD$l$LPBzE^L{*E^?E$tvF8Te
zd_S-O#U9kA6@*fn|B}}%u`U1*ELPGI(J4)CdElQ%N~G#KKx<ZDw=tAWhjf%r`8eu=
zudUQ|n&f>G=3A+tkH9sALWtZ~CVqu1Q`wPIXNm@}{vj|}&z5_zO$3n03d<C-c7*M@
zlRWA%X<P^p90w40Hf)!wf6Ut+S$8}*A#JSSHJvMA==$w+go{@yF?O$e?O3IUbKyXG
zL<}DmN(2ZqgVJxIWbDx3;LFR4mX=o6)0P(x4-e=t+rDo$W@d+U_~+w;b)@XqRB@v`
z06-Q@s4Fn;><m9Tzz<^AK1z0(B#nnSEiEi5WeeN~f*Fo<hGj?C;XLYTuO*jUl&|*r
zW-b+;a@g*RkPR6^HE4bPTSwa{9DEpH8Y)OA3vbEoq3^0$wUqEw01+Vg?29^Penx9G
zv~&UAaN=umJoe@@>Zm-VuRZb9d^6v!o9kKQg8)jzI?}Ob%}LIh#JKLh8yg$)*}RK=
z7G`FcL_|UkyMOnFV_{%mdQt+q>_JWIKP_^6YOvpkuyA?Zb|S5lq_syfwONJa2W?@!
zL9-kYoojz*{e&QHZyDrv70JXXoBdG7m*Y}n9#Tde0pKGO9X)<{W2gkWyft3^G4o;Z
zIA%uy+8L5dShd}0;O&%_W}Jam<XBU7)HGqt2UMR~Y7L&X>})Phg9mN9Mzew<MBY8H
zEgU@eQ=~@^SHCknigab9YMJ1g?%Qhv@ip!gY_{Jfz6Kt*Bni{f2P)up-OnHOpK}p%
z{Ydy1MfN>9C4eCH;Qo<NasNdR`T$pCfcc;M!X6?{8A#YLe`)}+3U0vqgTgulAbnOe
zn4dzzcQvZ#AMn?|hk9?DmwFGqFh!*Fa`Dz26Kx7qYpfo+#92;MRCzjuc1E0^oxD;$
zw!S@!ST@Stn@DS%9$I~K4rCgHTc9~3-jU4C)?Em&lH><+h|RhtLHZUX-iHdatq%*p
zaPoUG97nIIT=l`g_i+Uqo^(_=u7A`Hdcq1^ZLcQ^<M7k=XMXX#bTT{syz1M#(bmz)
zZKOko1E9b{HZ?VYs^sxzM@vhKTPP<;$_)UCy`QE-^XI!zaqlG%`g>)>)s-`^KRlGm
zn9@_C?d1YWP@4T`8|ew|QtC1%>97H)J2zPjIC>2JQX9?df94T(P`=c|sAT{EeScs|
zleH`GYShj5jk9z5K5GRB;%!o>&AHQJaLdlPBuZ}OkDX5&E*o1c65@{<+NJHTE{m10
zzeHU0InOT}b=`Q%3Z@O0lea!@AH@*VFfcY}B}H8g1w%f`uVUR&i(CI%->gJPmANNv
zG&}wwZga4us^DB6fB0CuH>fc;wY#gV?L-|~y=lSc#^=8YMP+AiR_nA-NAxqFE4_hS
zAOO9yv$HEJ?x5a}2;`;(a?;}4(9zXJ0QmYc<;}2&^`QFFLX*5-k)4}$nSh)f!d;Ol
z0=JJzi+6u;0o(~O$mg39k}6Dd-8^1`Sg)}}pa8^3dkI>Mphp<F;?lW_mRm`CtPSx7
z?N<97pYl)X5-KuqOl^v?amIe>vpQa5#dm#IAo|zpmIJzbUGJr}5!2J({M=Hm@<5N2
zHb88x&N?${p0w{gWv^dlXZ++!TT(P;V#s;gYP7T+xO__YWTU&VH3~S$CLa5MxgnDH
zD?^?T)qGofr;w++WZr!>ZI5@|QyvIF!N>Oob#fqW_~X@=Cim6Bcq&*PsO!^Z<f5fL
zJ)SKbPi5-qfwVSXZw9%+q5Q4Hzm^#U%~EJ#-k(<CBw>o2g_7i>Tz})CkFvQCw7(g`
zMIkAo1Hu5!RY?&qBMdwLcxIOBx*+b8#ep-DXYe)j_#1vkx%Owz;-zF>Qu8WYW;wZd
zAA*3Yj%$cx_6AC1aDSfucw4@$7k=-kL+t^#(>pdF!TVBOzOsMEXl#!6#pnY$v&IVu
zxuxW)>-IM~3&Bj2Kc;uKBJW|jIUV%UCL^ViUzmO_lqn@ACp)&ie~yDZT8IQZoew9{
zkEV0o-2CDOTM7zD1qBI3;y{0b5Ec~`RaIS(B=P~Nq)D8doB)Q{W}xGOJoB*NLWq2y
zcZePyY6pmep+6}d@Q@3d<D;6>VUPb(+o8rYRSsEhJmLbvvgaJIT7n=GEUSTOH!8Wr
zQnnb9f*%P1Sdru*?LDMPMY@vF_`A)fXa$6G=asOfghmdE<BZM&o5hL0sd9P%Ylk5|
z{mWwq@SYFQ{?2j?)dhzSIQ5tPPyEQACQIv2MBKZ>JVvg9U`gY_?OhFC@(UZ*ga(**
zWpE&ru)24ja`82kmfL!Gfxm&bBmiT7;bFK}>Z?Jf_x${PZf@=|74%8RgolU6#v&sj
zU4kq#LPI4%ZM;;1bTKQa{QDNnhJ}R@@VUySvlfHGf7Sg~lb)U~ODUtE@N{>#-r;5!
zn#AshtR4H|QJ5M_(hwD3PQp+@rs5c|gw{t0Acpg{rc0Orjl@41Xi-F{@*bS$lUGiz
z1m6N~I_y~1Z~^?TV+P!Y#2^&fAGXO|J#)cKD&yzs5ps)KYVE7#Y5`UX{8;ZDar`zI
zF!Wz`ik-aJaV0Pb&2VK*g#q@A^BB*b4ylfwv`svn60>1b4^_46PgSGs0j{Ol+VMno
z?$a@c2KyXM_cqp*@4E+xMZ1zzf0cO~R7{lZqPKn*Nitv3f$S6$i5Vgps^zk|XzyNW
z?9Hg${BdZchxc0k;MGt-<%%7}Ph~23F`A^KA!-dSbm#S@K%tnC{yY6Tp=SRlri4?-
zRZkU<=jgkVS-S0JdvZ#O>vR9tMawowp`DPCp>1Gb2P$rago0K}Rr+0?0&A3PY-}tn
zEId3~`HGN`koRZHc9$D%)|_u4QJmBlU0AnSM^tp@M^w?!B<z5Xl<cH;UlIDt@VeHh
z3N7?gctC;eQa|A%Ag+!J3LB2w40Z}iThc5k0>loKf0hi7-)*J@GYhuAFdq7Xvdb2_
zrSVxIZc2ys!(J09X+%N&%_~=%ae!ybkhzEcB!_qmZ`y+Yx6gT_M9dwF2z?x;=B&V1
zKYVyOpRzf6+j=X_DL((0r_auAqAjexDc1`T+t=M;Y_aMELNMb*$aV5hb%%@jhs#u2
z8>-pRiwJhEz5ygVnM`{lmH^M9ah1N*Rhi%vpnLsmoH;aRD%VQEdb6B|$a>+Tx3@_F
zNjW3E`SOXZV8-4<pVHPmMKvS#mM5>YpbH!)0*S-*z2GTKgH`A23_EzH7Y{C73ld=0
zsx!GQk+1<5CX9b0@m%pirPa-tIFXMkNX8UuG3>3S1vO*^ya=?n3ad8_&Kbgks}24J
ziO*O4z839e;G63H+S`ol5eNRQ>1I`($#`cn?^m0k&S86vd83AKnBGjvu9#e@G+(sC
zGpBpkW6kUQoOrId?A+2xcctJtynxwr%r`erYaL&i$IGh<WJ}e~6Ftd^dxD33Sd}Y%
zJthH0rm^tTOCqxq+WT(>i@e(T5s%+I)e=qqf&JGmPr)KO?{i2SzCUsJ_c}46jV|Z_
zTjvK-X<D#-sx`5n&pQx8LzwXXl;QRFFiiFkTvWxSZkV{ZifAGMqGxN6u+`ht6C%>M
zA8}`VjJImxp%I|`5l78ikzPfu2#_eT*&PU2TF^@;p+dRkB}A;B?lby{f^YV8gb@FE
zgswq(;v+?#qn1?9UsMUOj@mv?<i)J#>(sklS$~#SM{GUGZxD$q2Cusb@cuNqZR%WD
ztLH%-(0`4>em2GyGt!6nQY(7lAl>dE%ExXIz_L$VQTXI%|M~KJ98}&&JMX@FWGO^f
zF0@;{^-k-Va?}!Z6J*25w!<1;zYrYOlZ4g2qsI6M3I(sO<>?X>(nCJj*w(ewRK=MV
z4qA6uMATrvG+6vqwwRt&ML%6A!S@YnRu5X&s#}q32+lpuEVrYLop0g*$C{EH69Knt
zxX^gof9&DE?FiR6r=!9~{?dP#FU=OpS~8{wSdYKix(x(OK30;ohuBGPH8gx$<XQG2
z7X+Ilu)b(-m2|4mV1(qpA-)zY-=$n|T(e#$Bl!&q97e|QTmCn?VJW=lAgm^H#>a91
z=m|dDq#uTC<YKZ3U-%hDWjRnMZ2a21#m4G+kjEnvPdvqbHfunq*O0R*og{YvvF!%q
ze*zgqUZ}@MrFHbT%q^H{c=~S6qa0CUvQw6J!5-Z6O?l)Rln8Nc*R*^;;AHY7l@N!2
zhy}!xb_|iOxl1qKWO$u+E&Op9QJe_wYB*H1l1HnpTx}#YUQ@e%OCh34i^@3UvIKpD
z1RO#>YaR<xgnq|Meg@$4xHXfvc<g-6$8=eE5DLTpm8Z?WSDmf9_C^z>5CJ8@m-I?`
z>xni+ZEi)yyrae2KTDCnzi11s{^N-!H;pX(G?`A6t+qD6b?r<lfsv34#)Bj3rYEll
zx6C0(*Ne{hBQE%3<1w;ToNT-pZA>j+6N8pnWPxk7MtyC}EaeZl|Ij4Qk9j#mc<KlS
z`(g~9XzE<k-H_9(rt9|Wrs~%Af1Idt-qtre3zhKq57PMtniA^|u?!N{bb^4S8uPeq
z$jloWQ=GTBLZbDkm&UW;SR@4+cE&G8VwQz&W9;cQG#$5-Dc>W)JGC38ljvo!C_S^#
zPNItsqEXBbyZ;@R;9kc&4))Gmb+X@9J*px-?D$xbc(OJjx!k{mT*{Iq7YY5rT|Ev0
zKz>fA%Ufdn*l&*Z<wF7Z&enH=W3$_wgxa^^%0SN62oMhDx4)%S(FwChV-*(x^2dou
z)r;a=#tr#Frc21|7yCQ@jd$%DBEWibCL_(-*MKkPc}e5Rz1}5XUMRHS=x3SRrrim3
zFQ6w_SIsY9YJh@6x0$z!=03~-w1dVw!}R0wSM>n48p}SM<P6gYYbQN{*K2apjFEEE
zmu}8I`k^!GAEzK|KVpCsP()Ry?7)EWjDN~g`?#^>J_X`@PsLj>eV_RehxXZJXv^k6
zvN5_<pAPnF;iAFzik~K6ZlW<s$JCu_yv^vUvm%}C8t~s%)n#Ptk{FhDlA&Z>8we(l
z){IHY{~TYr=wtquj9*1559^qtU<NQlZ7KdScN28Q6^E%ReK&?$LlgMZ#Fd8me(q0K
zaE`j)%zAEIT~F974NCXs9I7A5w%kUuNw5_W+l>f{Kzb$lJ0Ipq%(`zZ?Cy6GWK!x~
z&TY~_oZbt<F(YZZJbu#iKC^OiEt(i_Ftz5dyC3_@V5nh*=j2k0CeoAjOx~mH8L(ob
zjqAOvvD;c=B}aqu50TrS7dk;+(swe<WP-GLAydv7?U=?b%n`iJg*1y*hi<b?80<To
zLzI`&;_3P`A%oNzpxVB!<@RH9Y^Yp41w%n=!(!jGqGQwKd{k}e4|+ZAo+4e#+2!!z
zC5WhJ=OZ3pfc!u-MV-qfU_F*d+xoe`EN-^!ie>=O`({O@>rkt)E#YiaRY=wyWq<j6
zNB5$>x^^e2Y(+<!)jk!Ci?VodWxa>@Om*MNeTea-x#70`KR~LsZZ}jVEF2@Spm$e#
z-U+4qTcKs*A^I0<L#`&htsUhgEwEK$?%fJ@+2SV7+#};%Y`6J6D#HaTW!4};jI|>G
zwh{CkNF}Fj<@wVlL1E4)JqPOj^+?>r40v?{xdvnAhfs#Xz8%N`4JC#M)re7QF?>La
zpeCVQt+zgEU0F8RE#Z)QWM3vsm>APzT-pgWMgN%bM|n>)@ghB*@x+h94i7A@;%7qZ
z3eehc)!R*1si;1pXyJgNA^gv}-IuP@amFM-rUvSG4JA0F{1;36AE@Gm6eHbea1D(L
zS$@rE)0N8{gAg7_d2XIREB9k{UPRv8p3EBp)~W85M~^>Jpv+tB#X8_F2mD?ad^S|4
zZ-_uiw6fa7AQz|?#JG0!C*fYo6e_$FxrAfuJM`}fL@%oTzK=z@nt)*z*nBVu0AQ})
zEdD8oBa8hBDLny??ZLyXY`1$fEF1T>D0@OVzC8KQyZ}+>#0(e!b?%0b06<=z#Qk2&
z6C=GpxqEz6G4eci{O^-i%IGhu-(@nRlu{&FD}Y$40#kC8!638CdTSo}=O}%3a1t3f
z(aaVJser%o_k8ua&e!0eWRpXX1A)jlp{#!TYG!?b<4h$ohQh@iPIc=BKG>nYSw4jR
z<>jSs?U@xdP4@JQ-dx7wW=&emOf&TRw<m0rKdDNJG4}R!jpdAUV&>DQOLR12N)Sio
z%r-U0SWQ1mLjZMMhQnKjM8Bpt4xBmrt06rGRJv*2jLa92jg|zOU%U}x%kmU5kJ1c|
zB1wZ28MY%&Z!}r@o6NhnRY{B2h&R?u^?QtdQ~a~~FZUtvhXfCBfu$9b<!~jtZY=kF
z-_Z+KOpSSD7z6@S9~Vi|mt=#}KfktLLput~(Jh<?3;eXmo5;(x@E_8!TPoMk7_Pv7
zQO5lHC_YNWffHtCEsURC3@2*`6q1TogZax&iAQaIe@q42lqkVMi)W;kq^Y$wO?tpS
zBm8v{Oxl7IJiWWwXEUML3}?!Qy)?mMS?G)no>tK~#UF@evY+fLR#G@2YmIA3Ajd{8
ztknE%aL<Yzx29Qr@Xx_9M&o0Qs7g6Ih@<f`IYT>3G#kWWZe>&8&OWqy{Hz9Sv9G-n
zmED+))f0UA>!RENM;npU;cOlh-G1fgrWfk>YXup;{#Zw)3TD#JZQmfv4uT0Dl<=6Z
zL&?vXApMIAyNbo5=lXwxew^KeHKg=PNbPSGw7U+|bFDU9VJJ?de-Qv9vWTb?ZFZ^T
zYQ(K#9hjeIn%y-yVZ8tj@EJE0At_}JV&a&_Gy6y&DQMOi6!kNtCXJFSX+kyfX6?dI
ztl58339~dHh1L3W>E`aw$=4o4tr4~gn;D++AKlNwC}j@kSHnMHIG-W~pHR=4NHnkm
z2Qu6?r(j_?Y`jF}{5&1w(VJj#ZK#p>hELXA_<IQ)&c?b>z2Y`UDXp+Qe0*==boEeI
zo~^JHb>=MD@I08=vrBzok<0QW8?bl=0E-5HP;+Hyps!2z+Cb<$P`Zfsr5i6OUHoxy
zJsoC=H*L*N%FW(3T#9B*wWZN#*^QPu5#55n_Aq+BKDz7_dSyTk7nyOm!nF2AqXP@A
zkF_}!1L}!VIvbAu1F;d`$+q<CWzhH07Qgu{yp<4W-DG1(vK3gb{Ve%Bh+y~z6LE5Q
z_Gcb?=t_!YKH{g~i4^2VK7NAb@-C-ASo(L$7+-7bSVEj3o3Y632XN`|?w=qO+J6m9
z4JnPyUmt%ox#)Co=h??C`QQu=Ok{9&)87_43BrGSnTHjPL{#Y;XvTv=%~x=MC7riT
zY<pi(n9N<HN!L**L6@qvK*^FZQzKR-L*40c?i4C)W$0O@u2mhAwi4C}@~2&!q;5Lo
z9iN4>$Y@uIN#Diy(%l~V&Xc*{>k>S$w4q#Ay?TEE*TAgeLNL~p2M`f1H(b311G8z0
zu!{}Q4l+_ziAGhJ8RCGkiH2supuWSc76-pWlc#v(>fh*3!&Lk8!qLJf;QMT7uB<;-
zrIQPj0dpDl+N=kq)^fjYi=Vz_ykHI%%fQM>`O!-AwsIbZY!3A$^&Q7jg7=pRIURLe
zYVxkSI#sFc+xk^Tz|r5m1*+QC;d&9iTy|X0=#xuE*98S|-s>u@*c?MU@o(5|xs3ie
zM{94g9sO}rs8Jk}eCsIwz68OdB0*2M`_?iXXJ3X6NQt@kmdJc2NG|}$kS<^VMs%Te
zzBHX7)62nx!wfkAKN9T1$#OBGZX`&gj7HEAQJ3gr>XVC(!N36MA~;ggXs8w9iYmgZ
z-&w`!;UI(MN>m4Z58(hNr#7S;B(_#Gs7v9p9g@LmsQKz9u6XI%;=!w6|MIFyN%;vc
z%AOYBO|*T_qriZ10)-V4&zuOwq~Q1f;S4{QL6Y!J<w#t-FIKt6*Zq*B6iSK3V4Z7`
z^<W(1JdHn->&^`PNj0XK7O0#9tY&4enED#VHA;AOD-S(On&S3~Dqv*`{w(-tN!=>7
zc~y|j=p`!4`nH@%%xtdUa%y;ksC7KNIT*X{#e7ibKj-OGHioad-Zt$oRxFirDGn&)
zCeuhGP;742)@lM1vxlMtx$J&Fl}X;kjMb~OZ1JWlYuQ^|-%`maAZW7*CECLNbd#a&
znL2hZ3lE=J#=3tUnPO}dMcpivbk;y-zD@vDsQ|9X#Uo|xhyuJTaW7}eeqLLmYQa<r
zI$A1~xm0;v@fJ>?7jJ|&->-zKGEv{ckckl;){5Af`R0K|jL-y>7#2f!XY-Vip2~CS
z<hqVM16-s2SaCp|a}pNdKHDz^_PpN2Wcaq?h7TSnk{t$+VXc(UsEm4fM%GgvbtXW4
zMSn`?f{{{2%ahoJ)lDeClKeNmY!cTdD7;M~%F*izRuV01rNudr1lvNaQVD2D`Z13Z
zK$Nadal0H|*a=2WdfYcloUSa5$qZ{t-sT)nTwqM)0q|#UL1IQq_Yli4KyLMiJq4Da
zhj}vq1vJB?s4PDjv~C2nMB1olr1bTpi9MD4VbY}w_!%gLm7LHdX2S|_H!@;x8q-k0
z+c`JF=8~4L^-zNCr0G<3@uZz%ch}1tn$;I4xauvSkV1`RNlu$PieiR;aop{(VU}=5
z7Mw0#K5V&t$Q)xf)h7?I6tqb!{79tf`AkXL%o^Z?p0~~VmMw^5^+p4DzPx97z<|tr
z;n8@$oF(k24OE!gTAT0SOwIZ3jsr96N-zbF=C{?t@+R77H*-W-P;@Ju-{Y4QncsPL
z)(0w@TlC*u345*i$nbO6*(6g8`k5O?*2U1jV;>k&-g}gJ%$)}oRj3C~CSvH%rxbm*
zJAG`Q$!Dl72z`#sNey6jy=gk9R-Na}6c&aFx*C59#Md$as<<5yQA|dexd6m$W5UbQ
zK*7Vi+cL}{n@P%kz3{wHzJP>%IEQ_MunqSI5DUhHw#%ARhm?-kNmt4;1(-v5$q@`I
zGN?2K_yr)IKlQgEAxT7S#xeBnH-OirvUCj^sU%$C1Rw-{`$_5g-X}tN^dnNc7%JN2
zF?!_$#9`qE3R3}otaw=tDil*|_+M+z>P4Ye$@vzFtSmat#vNm9+sdd}GNX}6EdMq{
zD6lhKy#?HJE67;6(8D8uWgn_nI%pu)MWJLJrZ)$wM;lTPCoR#S*5Fjv7^85~GON(o
zDS5-_YSiwmIRPZKcqyc<ENcJ*_YWbS3t{72%5Ui*-L=?HFV(9RmDTD--T@FxP0gT%
zk{4A@hT>9r(!i|RS4}T|wb(g?tGLhNr=Jb?0|p6s;KT=491Le_*3a}~vyiB?!_T@r
zWo50t-xE&Mxoqn#3PpXU_lS9C(}@NSu^QWNkN>wQk<6WYzdZ022<KXGg$mhyv}ig2
zQ?5To(?G%LA$t7E#(aw9t2eR!avf(2+jh}%Ek4+7?*sHA#eTS)X_6lQNn>W!00TTd
z{n+cKiOPOWisBsS+SKPf+YzFc%HNJ7l^f?;0+@-8v5s0NuB=|>F~x2NK#WlaHubVb
ze=MM5WB5nNGNh)sf@@D&Tn<e|QG&aVFB6@vb};49v+iZEA912yLcub|Qx3{sh?ymi
z)Rc*Ls}~4k&CmcpkpOkO_6g@>1bNQ&x4$jS3yb$&*?5~q)^PwP;)CHm`tsdAsY*?x
zGr#K`QnG0%0gy`hx`s&%YiDW_`7sM!xOw-w8f54T^xa4zIKTT8qjodq0kFkT7HWC?
zm}bGG(iF?M^Ry_2*l@;9vz*=K-6u%n3pn^Pp6K;(FGHSPNLr?!h~p`EJ+znl)0riN
z^mapTHmQ0Yw62%kU6F%xa?T&lJ6M%lo~2LhSK;vjguo74?uSLNt#5uQPmDK9`8p*S
zS{nSP9AuNSI!qrtXf_#(a{N~|V%2?IA&inGJ-dYCp>{qXB9bUXZ7$V;{o=`cE8;pP
zGS-mn$K5W#$DBxqbuAaxQGr`?tnAE~5(w_!Sf{kVIg3VqnYp`CF7R)(^=$!@^gWt-
zhfYcfqMyXH?Pq=qFb5f5!Jl(R13d5tyfwKp4eFv=#<Z9{=X{D>@Y;8y7+@KiVl}W%
z?!Bh!S-`Z{BEZP^%?!5C4nhwNb?GDaH6d9w{<bK&)RBd*)B;N-coNmsO`Dw?0bnwy
zp-vzW;N~dXt{!*`C3|KAN@V~19dRJ<sWX>0YfRH;v57QOsuXh)`ME~fHwvm-3E8;J
z(wTLg2o{IxJa}Vx24>3IQ~DmHV;TU)jTK((>j-FR7PvJetvKTg+JzM`(J7l<O_Hjq
zd1zHvsthYAgTdwTxgaElhpR*zK3a7dW6oED5_DC}G$M?7nWCqGwbL{qf(tu4(7lEK
zoAoaisY==q>@@nCdI&c`3)+h6Of(+*zPOm=OoUE}|55#ntGG$U6s>PykR#=*cvWBl
zk<jk7yqRQj<NPh&bA_O7HUeqEo|ajEyknlTjL>}&Cg;$V^sCDr01$Vm9{ElLM2{;!
z0J>uV!q&-SvoU<Osii7VB)g_;=H5#EW3^N4EXn6HQsub7Qc%;&p(+F~J9vXBh(#xX
zpW4c|nXPVqO8(!NaV@9xw8C>_JEViXU^^O6fDmc=8Cr1GWTY!989F!@QxWMiDj9wl
zMt8;OFSnVK{!RsaJN5M)GDAp^*%HSG;7?e7Jz2w5RR_y81^93lyzP~Eg(_z?dee#;
zMrPni)5Nd?^?y+%rt5_jWhE=`RT~nn`U|ulV5<*YMDME+)|1SPZLo>vIZgl~586=!
zv&7a>lcjCmHclL&!)oQfEG7cSF^<dB1;zt6bt|&>IbW!(Los)dh6Qo9Jx(*OG&G!h
zJm(oT3~FQ8UKl@YmtyaIYbZ_^mwaSaE|D6RMWA}hc?Cx;db0$PA2*it1mm^65^bv{
ze`hv;hfcx0{7ddEhR*qK3~^r^iHHCbK7O#{#no~EHvgP1hd&ca#V{~%cy1XK3#TCS
z-0r!bYEN_?$iAa1b#0~C`O!8qF1l|@IoW~NLv^+s4N=s#c(Z-<{;KvRnHi50?SD(C
zht;h=qKc7c9Znw#%Oz&7)2r#QZWW-8vh!%Nre>Lwk^d{)kj+vZs=o=QC^_sNke#5U
zF(mJmnXd{9Uj(H#H$gYIE8(CDTi8km=WM{bQM(<;Af@&zzl9C}?8pcQ?-DNUuJr~9
z;JX7I+baEd18{E=tWJ+hO3E1Z3IsL-^2w?$LO#K)rq179Pp|w7TUo$us_AvWju)|s
z?w_=Ut9QBWH7Th#=YHQ=2m^Nh;j;-_RySjCG+U@N)zQH1*)K>mH#Q@R`%64%r=V(Q
zmMoQ{>IBx-SPaOmj5%Ud7n~Qg{X%>r%Pcphr-JCMxxElt@C{{KGnyDyAvJ@-zvpu8
zb3h{aiI;SIy;*qo2m-$Nnb~3u{!p<qPV{~K;k*sX9QRG%xqaMdkq~mZH3i-7%hgon
z?Pr;Z0_xP#WoDLZR%TEGry;j%>M{3_IhVz66l?1&(?Crh-0r4vd`5QvI<VP*H5dUQ
z3G@{dz4BX|t#I-H)Rlb&+4rjT>?f4t9PLqo`JbQajb8N(%6d!$#7$7ktR%jiEh)`y
zoVH%{d^LZNfo@gHOtr?K5;Er!uXSQK<_J3hfcX{9A&D<NpPVf-+z^fRqrK6eWZv$(
zlCQ}t2Balf0e|s{IH{kp<sV$^V(xmpc~>kJR*D0uvgD4D7PLYe3=g;OFWj&lI$vLj
zY%K72tO8=b2fV**DQ@o|vz7II(GKoRp~OY62pgp-Zg28%@d~r_aJrz`c2pQ_MwcBG
z!MIeM=&DPwIWYYt!s~I8!~-M-j_=pTpmWF~FDzua=oItp@qCF-b3Eym7a|8Z=9G9L
zjajym6vi&VoBivLtBTQiReNo_YIar|v?CT_;Z3y~PH;ntL421%+*|hMK6-+>GuB08
z8=-9Z3F)cS;b!?m%{_=SD*5oVCJxKH&y;L$uPkHP*nhIPN6*ZiAo}yKN;NN-OYCMp
z#y}Dn=xRSzDAUz)9a=_W`g5n;KGZ3NQLao?U$z^!?;^7=U4yD(UDUl_qnyzCgi}Hj
zK7#`4Q9coVM2`ol2Hm?3*zS734%biS8MmDdAA;4ik>w+GF)}l=n?ici*S<aY?UTE6
z&~@F&=>A&yYdP=02P0AI)_kI=YyTkrvhI{>s1ABN>vptKimRf8=ml!$TT!{CXl|&?
z+~4gY1)DEP*p9W)Tbb=oN35B~k&eijftuZ^uFspdlUG_Ss$rUK1IUc;9vxu45fE4h
z2Xe-qFWl?)kJ-|Ae9XOrvu4|NZouvot}FKOn!Mm1@%J3O;2w{`i={5f2Gor5vcop+
z&Kzep#u!cUCg}{Z!HY5~(aFclb&APlKAom0uW6t2^;YgVhn^y6qj_T(ZkdKVy3Bjn
z65y(~IUi<WYq#^Rj`6FfA0L@x<47A@&uUX-6Fnc>jpI_R7KI9@pC8_y44YHdMb(uf
zkCcWZ3ex3>Q7jyCcpdvTr*9)fG3LXuvXWLxew8NE+X+zaGrVG=Fr>$n#Z8lwQuwU4
z*d(Yv+*rJjo?yPfB%PRF5}yk^<=Yr%KKEf+iG&PS8G7@gM2!C*3t;WA$4tU{hFkp#
zB{o-miE}mkkXQh8GgM6{JU`Hq;IA3FHk(G(1EX^4mf6K{0nP+(n~v-ZZSl*+UPbk`
znV-$+I8i}1`{)-N;CcU9(oE1hOU{Qn?OhdP-=*KLCgoSAVa52hQ2@jm9=XBz$8{>C
zB-+`4Shq8)*93;gLEiv~Hb2Sz=wzz*5!eERf4x7qHaoT6W+96WNS!R{j0DZutG*vO
z?6@G7>L<9=LGo>;TK&21%R{EpR7?S2`v=VWqf1Wbea5>)^81*Ymc!~U>eUHt4a0}~
zMqx`W|2vx5yyZcxBvzM@p^+a8fLy<|@$^1qa9}G_fnQl&kU^lSjb|=Dac2BXqz3~-
zX(~2*r<ymF>iiep#pl1wvkNE#wAuJbXy~WdbuzenZFXWvfO_^Qj4&o5$XkSUpG!M6
z%2OsoC)@rR8r1^h!j_g{E<k^rn(k+5<X-b;RQ6%LcbD_3?(7GQbOP<5Qti)3SyDRT
zl@ybd->^=G>|7{0V((9G0ZL!ZtCHF?xIHb9_tFx26diL2YubP7;R9z#{j9VcIA-AT
z*nz;_HgO*lC<;2?cZw5r1~XG+VK$rUSv@{U7gnuzrQuV2kc|Vw58AQSxJUSYGZKDR
zXEz}qITavPi>w|7abtHgMMWi-;%oF=S1S%4SHB|CB&#tAY!DuV=$Snyl&}$amhCKY
zV+w;IiXk=P0PC=W#Qai}6>ZXz05-z_s7_C2S>pDw%OPx*^}Dx*pou$aKGi!@GP*A}
z3%f*jZ;*ysO%qn-u+KUjHs%VIAyOA9$;Q@inN!9(Wi{WPVQ>^!dAxda=Hi;(roq*`
z7;PH8%|EFz_p+WRP7#G_@;iS^F)cPJv$bt|y*t0&Ve4?K0`}bg+gVs@E}N2v-@5!r
z*iwg>9{qm=&Ytkjd+oVs9oW>C+w1TWyCvt=_Sa6xoojW%Ps<w^2(0^<Q+tk^rzEvu
z1twfh&CFa9%*X^hZH;X1rstqg$5shaJ)hT!KwlrMd!K7H4*QQ+3!+>opSNZqlj!|9
z?;D*9CXMXL$je`J=f7G`br}Klr&q`TI=`_vv;ACy7l$vko*B6oCUSXb|KOky*uXhB
zj=Bkd5piD$hfLF+D?)I9i8R!|$BPGe1Hy!&N&s=pskB)Ipf8M=GhGR%ry+RODh!ZP
z1!Q7Sj_Bm>vGu5Z8n#01#`ra>mZ1XK2+r1k>bd%@0}fzh5)x9@)<xd~FeOvc!!OLL
z4&KU%lBR+4j_Z@mNKa8!{t*VOM7kKXnM{<vRRRmmFFU^MR+amBcaxBCJs}yFACzsA
zqFAMtFrVj2kY-&4fzeq0bAKk7Ke{M4q6VlJUn!H7kc}6cFmuS@(F|XqqvPR+j<FYQ
zs>8_&)kKX;MF08gxbIk#{Vow+2HsSm0IN&2S}UX_7c1r39Ujofh+zW@ZJK14J+Gug
z`Eds@Lf}rq@aBC#^B9YMC{5N8xDRlv2(o^$zuAu6Z%aDyPuOz`44wWVn5`w(d7?!=
z!Da81e=ZfE^syGoAGlwW4d=W%!jIy?$6mNee4(a$y3*tK++f4Sc3=IEZ14qnJ9jpl
zqcDxye!3u@S0*k-_*_S>FMmoMs{ArGAbA*BfE9}^Pf1lfK9!Q1G=T+&6^#uBs8q<+
z&W-2gBDdb@?E?_^xT>XOcUe4xr0_1ZYU<9$0V~mAAo=lC=ehP~fiI!dgLj^@C=;KN
z#@m14or+%fW;RnckQhL7ou|Z~i3E@ON#&I|$`!D9(v2xyq{Y<943(~~P{J|nyL6CG
z(Zb>@nKGgv4B0`9Z@WEs5_Ri2p-E)vi_zbrd8=g6KV@9jtE%pZhr-d{A7-dvsh%@a
z8CjP}V5m9waONyCzq-N%5Y|@?zFqlWWUKZy;1mU+8yVNub1SU0n4iV83nNeG1YSHD
z$INSa+Os!T`Cqgd$MGejd0=Pq)pOcA;G(8Yn)Zz)=u6}V8ZEhz_>;u;@S#mfWHaHo
z`n7a%ji{p_8kL7x2Nkm{$JCF{7E%Iqvtn5hz_I&}ag4oy8kK4b5WmTEYqmzd+1dPE
zh-NQXb~6^$uC=;)!T2+&h*?mZNY`moc<G5*c4`qZZo{Zfg-EmMX>>7NWw$EtEf5mT
z`dXw1m3Vg$-#sh%21+>ne}K6afp`aRE&5-UB~NwJL7#PFz`4n@pl)rvlXFkcr9iB=
zPuyo2?hD=L2(QkE(bNAiZLZD!yiSBHVljTOx=AEOq5-O&jflpZ-~kqn^*;sQtQT+g
z!p)}{)0vI*o!J3ZyuQ{C3d5<stR6Y7rSw96*ExE#wwI+P(~$pZ78GhKUP<#Zsp+j3
z70fkqr}+h3f;&6aT${90QX8JTm@`g;|LL+eKq^{~UZc!#KIJ&^xhl7$-EcZ&-iD9Z
z0*~SKu@cg?4I6<Y0|;d%@;>iwJis!U33oR@*tU<9zU2gaDhWTE)~KG6p?Q31{LJ!8
zwi*>+mJB=EekG~|>A(S%F|(%jdq{}>=ZoRQ5!-&T2aTH@`0q&XE}U%4#tILgP-a}c
zBpog-{gfFd>KE<Hp`;*soy4RF@8FOSKF@hLxv+A+F;PXrh?!SdjW4<V7JNQiZ5Och
z--t<s`OfVboDzk@9tgv55YURjqKX+dznvyfW>gR+%dUQ*Hl<jF|MPBa)3iBd%4=dD
zlW4OR5S{%+!OS}}0=FWO*I8aH`@${VqsRA+t3SrFdq)R6Rw0>4<=8n)ObGPE5;o?c
zNT|nxhYIeiZt13fzGu|Kahu`cMWbcv5TpyL-m|#v;`nYkZR_Ln($xZ%nP+U)3D;@)
zRUkW=kB==c?Z0Wn@QBOTA7e$GtimY41F2^FQg^ilC7iI44aZ%u`Jo^1AL!Wb2*Y+*
zpbbSOWv%!BHWbM5SXif4r-TfeU%%^K&)fb+_Aue{+xsej1D1XihnFf$qrqVz;X(qe
zO!q6uLXW<Miw{UvCCAgbUS&{`r^vp$&n!*ef*wYlH-qcy)X4sHc_`l(zk;4?^y%+5
z@Qm;l*~Z*C4h2QNR5v4|sJk(1LhbKW1@U|IPeE7xZjx`*7xf+j1|!d-2vF%;vcX#4
z`@Rf_SXxMSLMurfY&6IJKNmpgF3o{(F6%b9YqTB?#YH?-{`lpwe%}8W==&H|!Pyog
zV$ZuasGE_Dgb>ZgGZWp^Z!2G)b)VxCR&-klTNrtMF3rKgh%3lj-+%`o*PB#mPe}A`
zh%+_E{B_P>`*rMc)U9AgEk!deu1VdIsFddNl)edFx-}u)meY6fGeJ3H>cqOLQpKr?
zMHjI4E4fDf!(*D}47rBmbcpTtAH?sIt0q$PLARY>r!LlLNw)KB{>1DdWa!gK8e59<
z{@5LLkcUz7LDaMll$?#~LCT&B3o#{Xsx~FKt*zx)wRQ)8@v<7}-o3L4jg;CMCj;8#
zaMb%chpaqpsUBgfXdG9IUuQ^h2dJUvjjLEVRfJf-?mweIf&XB6d`kL#qKu|^s=6ft
z6>5XqaGdB-U$9ZV93vnGg*Kh7PuIiVv%G${?KxpA>e}Raz(Ui12)Aid*x_ayTg`r5
z|9_YH96h-PF7`sU=GC>;2K=7<n-yV>E|Hg)4^=vhIY#%duvT75KZczxM%B2MvV^3X
zs1L=TP(uVe+YkG1ewfD|+bTGieBGfY)V~DReH>`Fc^_=qrN$89_BSV|CRLCB(7FGF
zx%(@ik;~nD*b)i9{blHT)g68`UDM?(I5&E^Ffll{5!mGTz3)b`nWCR_xQbq#kRSa3
z$KLiP)ThKQUeB^<9rq{YJt_PJtY2kXtlkI$B5MB&-kx>ngzB)39Z8@TkU16BH||S2
zLnGJzIb}u-jg1BY@G85V<E%h@|A*3>ubMvxJdCh!9lHsfqXEQKI?fa>HFN$o5fy5$
zrTT!lvGyGsG0=E+bAu^YVBTtGeUvLwk&$oWZ=k77maY;4LQo$1;tCuuhi%_LwBkh4
zco~P0tA0H@>l_<#gJ7y@z|IhTQlyIXru-L%B^TSAooU^~^?6Aa?6N<;IOCYOgJ6N(
zf`crMgygIZ`ZAm;PN65oqI$``c7a5VbyD=P4vk**+TY}26*2^XBw$TD`!ENyPbmgM
z((v1>XLUsixRd_6O}0+7U62OSFnBRe@Elo+hi}N5Y^9;TT*}Z$;*svjzz)lzz-^OF
zn0A1owJQw9`|2+Pe-Ha;UA<FP!BNv)@|MuijA8t@#+iF<Cs(|V$P4t2zJ_3e)NnwY
zs;^D;`**;^10w1x4F76xuhsv+0wDSKZ)UbB%6`ZPjwVnZqiV^o8EY2Pm++wov5pt+
z3#sm(3++kcu)?j$T{FW>QFf1IhoiSn^XLzi3iw6I72;$P(`ZjH{tx9?OH%To=_`^e
z9rW0@#1QJY(Yr-fA@SKA;vRxk^GVu190#^Ii+Rrl%Rv)y<s8L3oUzHBKlt5j2a2;>
zn@-Gg1h5bY*-XB;Mm3b>qq5NsPI}ZClS_(yP#J(P8&BPv{`NOa{a#G?yuT1>^dvu7
zhlPIa<cU;HkyCx9z_*u#d=!#(xYu$gk#tl<T>g|>UPMLxWZC<Yufbt`K+3abg$Ff}
zsIQu9oR%Vb{ae<(Q7OL1^tWztn44NJPJ$qbFQd0*UvkkpLzzEf6134CwIs4L-sW7C
zA^R_*a7POOgT;DUGv&q<oQP%80CNQ8L{c;{d!d@KnRoCkizl4viE!mmG)wOcii$$J
zcmOkRx$c~mVeQ0_Xj0_K=_0D0SYu0auDCY>EV;Q<cXwyo_J}V}gl-B&ruzJ;ba6ae
zj1w5j49BrW2&Qq+ADGx*^OaW?avgtg5XH~1n*n`V>_dSmmADzuXd0NA@DXRYlL8Fm
z_*_l{F1V1hD%hfx53SMxw2{g30z94^GYE6pSgw0i2b+XYx>g&-EM*&{rRpUp&i#}8
zs|c}bsnupYu&QcnMNiUze{c1Z>1ySJ@BPA+aUH3P8rii9u5Yb+P!!)s1>Z}p)r_2K
zQZ9bBQT_Zs02e{%zInLgQ%X)Io<FnZ!s!L?zBj*j|0k~+c#U-07W;~OyfZECNuxms
z4g5K)j~@=Vw0*{w>FN`QaXahP#|{Ak3x|x*->Y3X^r4@^>Yond_ST7~jz-u!N4a}O
zI=ZCZt5|dP2*P2{e`nYi!gm2+W7fI#$tPzAy)!p*Q2UL^H;ad#TuU`7X9o_LKWHof
z3_rRYFf>qQweX{d31!wvj&IEP<%>SUgS4hw?nqPaR?QB0D+ISoX;CJgK6z^9tf($-
z>r;Q-m~}ExYkF$-io{=kUzeV~pjX5f;o?=NQj>01C*7>lT`yTOegv(vN!ax}ReuB6
zo-t!Xzf3qDJ7<_U#Eb}kdc`O*UCB_*WVR_0*dmUwCo`3Ru!x|?4j0Lk9BFZbywVg<
zSTfvA)ZIMc`_oDHP)SmTIK&~UlOU12hS^vkNGs^u5S9^U0#tJo!o~q;mNlDhs09`V
zdJS&IM=*wJs>dxj2u>q7Ml~rxuSIbk#%E!CU}zdQVKF+2(dtnSFs(|iGn-NCLv8&P
z*)`FD5mNH<{86*h%F}Y%a#<Ga97Qh5K|oJ4G(#(O91Bd}s^?hYh+eO*)*8FBS$u?{
zD7uZpFa|*wN=dQ!z_n(n>-8KS(_Erf-O*Wx@F)hwfkJ4C%>#}FrfkLZ&3a2$=%Nk1
z@SB{W5lc5jV2_~)gBs)3r2(~hx+YPvx>i5RX2y})uPnQ>)GffUFpUazR|ck5Wrey%
zjIo;%XcIR1*ofPHSAd1PR{M6T_B&*HG=S%~BmA5D6D!Y69(QIc&&}AE9h|8tpXM@j
zR^$U0&`l`^W<@;AQk!(M9JES=$BA?@lo))ou>blgvh-59``J^Z*C2!jUNCDfpGUYH
zc}ell6FMeOT66IfYHGatr$Y;ejQk?3=c*rfbGkaM`Sqvyecx9X-w+F<(i$t)C!d-f
z*k6@%ed+Ys_wQOq9@~_EPF-|s{yU@R4;nk-^vbk*WuN;FoE<tey`ebN;z4-+#_V(J
zlTOVJd|P+B=Bt9UJa<8;vCCB3{wycQ$j;6Hu%0}=_R=|EG@(YexUC(-V6vjJ1^oxl
zd+Y60XOa>xrUAk*V4=TTBkbOV(VH&$D45Jv5x&NfWEJQe7{m<0j2N8`7&Xv$5taiH
zVhoIi2(!3905Ulj`9Jo~J3h|h+WTi_p0a(_R+ePRMa5l`)w^s6CDZ_+L+BlYD>#ty
zx%VbCgKdnv0Rsk85(orhLJhWhmsKoFvMkG%)!X*nr_9Xzhx{5Y7?Rv1+}uRpzofJC
z%xpQI{q33OoHLfh1NA3<aq9vAC}|!3^-KFp+D4INE1Dnj^XnEDr^W)n<L@>+w)Z_^
zWyl~SA|qKu1|6t^M2zJiLK;_eBn!j>>fs~etQf8YvB-o_1J?pbK-d7>7Zk!I?ZgNu
zKGWh@z#I!47$pY8b&UrVV#F+{A)s8L)D@7Y%ZO9iAu^{|ij=5_0^-!8A*xHE0v0#`
z=pG$ZT{3eiLgG5Zi2IKR%rhj>jHsUpCL~)C^=McGrf`3+N`2HmTQEimo)bFOb=i&u
zGv)+KRty?T)G{xXmU~a?Z}e<%W;P+tWfS-N$R)yq?jC)gZKv*Ii4%(lW;PH5(sZnA
zm~x!xOTT%+N=_lwl3CGQ_FH{dS7?)_lN-YB{z>@V*KE9Y?QLt*?P;|qYqDaq%MMoD
zUbehAugKjJ1R_3|c0<9U?8y(}n!Rgk-JP#r{OjDfQyUCVfBw$;st;GCpZD+uQ|C_n
zb1@}^Q~di<(R(aE?#rW4*VlaV)Vr@UUtsjPw*X*c!ylji=*@>Nyxv#dc3KWM9^Ciz
z$8S7*!42NB_MhLka#QpB>-WF0GWW{5k-D;jl@Dg#xcdA%o_y=YT5Y(rv1WDg6_SH&
zYTbuea7ETN%QLP9fGc-CK<skm$sVd1NrVw74R!~?5X$^|Ud+t0qbE2sfe^td0>&7N
z)`tM`G3peT<Sgbo1ByA9cwh`kp})K*^+4URU)+{_puPu*VgI$GY)O79_Z?r76<<<+
zu(X?&whk3%EhwI6FIp5?ydZq?C6u;y{CfA^ssJOQ)`D0^`SBs<8W18wfQX2>fNB6B
zM3@U^&Nxu|xfm5nOc<F&K$LrZNWw(WkSq`*LR>>wM~JbYE`~}7R74P0HAEP5E1)Yv
zh=@4F20?eLJfJCkK0}mfjFW+JViCB?<WLSe<to+2R5^@r%6U*1t%L@cIT~?=5(y#1
zF#%4wIzfRl(S)!7nwJrv#&Ap-Mwk=e#!%3F+&{`pF`~iDS&+^XbIuPw@N(_bBMJ4y
zguNr&I#W>m_?+Q;Zp&J8QDuTD42gtFp(HTIz#u9<09m-oc<&9-%eH;8&XH@1_hvqD
z;D*o)v+Bn;gx`Hj+?Ub+&O<x)Dtn^-G~@8hzTEh%=QB2Z)vrn$D!2FV!v^u*=nD%L
zo@&T`+4lb=Vb&G%mlUOZYbDHMd-s*pw|u<e`%dMbVoC_7_`WG?Z&_dcSwYeQ=JDsx
zO#G`dR-XR+J+4z8P}W{{=6t-ro$~JXg7_~_oS&4#Tt|FPWc=D6o$4TZ-G`4KXla|2
zL(yTb=K~ep&7w_}V+;=@U+ez-*duqXd1n7R8!FykbMDmz(_?QgeH0r6UpIeX?qzE(
zyzRPoe_9tf;%^*4;nBz(f<+w&ra_z1r-LA^z38$he!q|VRWQf0@o|0FS(uVhoSDN$
zPl6l+*uKBy5Ry#DU_DUNR-Ebp(2J8JiWkpVk{&bp^nUfi$4l}v5gmK%jSqf)%hiQ*
z;wJ4SHMLJ2s6S9qd-g@=t^Gk>S<i{5-hUSf0b(-(XZbO4<=q`ptPK-C^LPr9Qfgd1
z`p_uCIuEK+v=N(SVnWmvBnH4T<*Lqux)34))dicN_B!>6pgCS9HW3>LCcqVq`BVf9
zs4hnvbdT=u^olmD^!p7Ff+b!;0>TpFD#L^`w<1pyc|a!ytWHpbxFCaULr6ee<B7iX
zIsUZYjBgfAV2Tz@4org_Vek!5b0jv{LHAJi05?Smx`$dLLGv=r#juEskpxRf^Rl2y
z0;4SENa~$S*S^)WesESjV~BDbaDfmaPPA)sjFjk2-;lZYzW1)|OK8#qKt%}%<_76H
z;~igB!P`H$r6Zz!yxJ=zMWh)Pz4U`EU-h5L?#650T3awT<BcnxIOS2DEtl>5)g#y6
zzAEDkU9|w<Kz04&@0OCVm`ATzQkeK%$3ai=4<hQ>Uw_Xl4zBq5H;q$5`0vHKPu?x>
zI8>aITYjXiqNh_E94ky(P?VOz{7P<E%r}!iPxI7!uUC!smUp#bvoSw@UjB?Et!Lno
zpWN|n<Nsc4sC*v~T9tdrY0Gu5FKaXo1&0l9T=cWN*m)bu-r898jy~>_9AKYAGt3K9
zXwu3b+*3Kwl^2~@(O$cyb#DW7A*+4jk0(~<T)XzV`?qwwy{Yc?U{8>Q*#k!d#4ZUD
zM(V?BmRy{HVk(aJ3ek~I{O)7ou<4_idQ<>`Qvv|M2-8D~;*G^Au^<^9xhT7|r4wZ1
z<8S^EnL~;fC6pdMR#MkcoU-7NE6!rBvEq!BvaVwnJ+WSJSTVSfNqYCD`__H<PUUbf
zLOLjJ!C?SI5Rm{WNWjEMnBSl4NXU(ty|Mf?LsB?b7%}mjsN_#xdDog7DMrZ5ugOs|
z4+fb#NQ?+cShNw&IN}U+iZCN4#C<9tNEK7H;XsqShKOK@7K|~nI;vt3Q9l)p90|w}
zhBY?@#%O?xMvgEtgkyDrrdV@EYklgd4wOfv$w$N*^K^l!pt-2CO)*a=VGAWJ00!>s
zqsAyQ`M2t3&Q8rXQwVs#9xrGv=IqjtQ2@@(;b4ix-XSJfF(+iAL*tSlg$h^NmeriB
zPL?wlN93+5zt)jw8f#XBNFzvufp9~}owvl@Ti0Km8Ix1qRDS2Dw}lmi4u0gcWJleX
za{FCzr+yn%9k0)wnX&He?Yq36J&=0!^0ZT%pHF}O&ib+sR%Kss#_iD3_TI<d{1}^T
zk6d0<lr&W-_`gQvy6<ZJ^N(Qo;fKFzoD#x+Yf76N%e&i!Fnd|&q4FbbBTv2bmt6JK
zd#?-85f#TfE4tdW!LdiKzbz*urf^<z#j&<^@4r&34X-Y^Oz9qa<c3oR!advY9(4tB
zr_V2#bE>s}RsSJvz+IG)_tk0357$;6Ys{Ip2mp#QzC4xixvJe+k*T^<DM~+O+|v5m
z#?N<Qqp-Z-wqWO2?ySsOeQ0CV+e_xml<c&2qQzY?v@GrBHCHU(b^PUxA3T>gH>aef
zQJ4|Ikx}bBNhEdol6$#m-g0O!Hc3jKrg^C56r>p;92xWxZ(dY<VOqgsFTTt%0Xb6Z
zSFy#GKRv2AGlvJ<$QJSV8~Z?%i{{VdY7h~!|BFAJb?$kO{HVCJr2#Qdab|Y@%*3*e
z)@QzWzsl|Ax?VItX;s!ampt(c;t1vLVKD-W(KaL+=(v-PI)yM<jucX1e(}PEl}D=T
zd|g7Q%oLVkNXm_xzy5>GKe+hpn!zSwM8E-Iod^sYi0)L00TGE~fpH4@gn|&)ClqZY
zC`XFKM65|Nbt#A->d`$N{)h~N6oQ$?H5a8miYOCpSTKSyN~AuvP|p7JgU|0>vRa*>
zwVkEmiw#{;ttpx)<5VypWsKQoV$H(<Bd&4XqjLsW!bS&?jNE-p^AAw#3_&y_T}PUN
zyxpokq3c0zpCdX_B`v@wOC~@jgEfjJ(SRj%{^;F{jM;mSZ5&KI$OHih8mv@8a%`Fp
zR1eJYr0lxzwcQ<CUiUs9-7v2iACkhv`C3}D^;jyO|H_5iCOu(u{YyJfyph6EDhE4O
z<li`{f+e-p&$b^RR?~`<vkT(SaOl`$uk9-z2o}Uzes<lNBgHAcH>QMeihl*lyW1=K
zjxvAn;qy<mHh$)d-x9ld-TQm6#js}SRocKfv5T8pKftn>DNN6aNP6g^Tguz&wjBFI
zRbT6hjH}amTv6sJMcmT<+s#dHWQEL2L-DK6I~8tjJNm}f)>i{ZTn{Y1Y2`V0pI-X8
z`d2oUy=Yq?_&YrJExK*_(o=hATWX$v4c<~ml<_Lx@}+ml4)Vglt3<}$b`K*)WHiZk
z4M|uVQ_{_;W$jHI$)*$so$yhws%s|AiMgUl@p0;4Ky;Wn=UgXDBY+SK=**+6DY_tU
zW+ro;BsL>9$p>oc%8zu2aZzO*hnU}w0P<pI*Q(>dxz^kF{@SPVV-w0do1T1Qhbd!L
zt+So^6-1c7dDJ-HK}?W0GgTiCR351?CRi8~3ue#v9ronLreufC+3?AZ_L=>HUBsX<
zg&N~z-OISD1Ecc?6O6H9?eR)EQr29WWW{onD3}S?nKG=f01ck-8yrI3{JdswtszR%
zJXCX2>QsX#m8HeSM-25e$fQtVq}1a-rWm6H%XGmQC2)mGAs7)PhhXYwnwy#;F{fPj
zF=H53-E6i$J9ap;TdX<}T1yOgs78^kC?rW>8c0T<93cTsv??Jp1xqXeg1p0waYW2S
z^#ez!{bhH|c{XbtxtQMX?od99+98+_7{$?pO3;f#vn*FjcU81k-5h%_Q`qi~t^FCD
zBV}H3hCL%PbMu02w|sK{vaGu@Lr)b*T=U|chogFZJsgMFUoHOm>C_neWrgS7c-7li
zF8?0<e~Q16DIuKVU!1bmh8j<AMfah~fzF(eS^2XURCLtU`i~)5Tvc?9);A$Vo3KfG
zw(c!|ec$TyZdr4|Z2+*T`c)EY*m&S&ebm2l$*n8$ZvueLbuSBHhUaQuqCV}x<m;JV
zeQ?RCwp&}9Uffjryk&veci6ow`IZNY?+1V#ExVd%OZ`M6!-mn%#+NU>iw6{2TIlw}
zFLISBZh;DBBIuIf<D#UEDac|)2BSJ0M3{jfF_i||U287Bb9wH~>;AAuoEA#m!KZ%z
z>XO`i&Ur;=3o^?fT9GJFr#nABEyq3$8>PyD?uxF%bbOqIT0rys;OxZ}T?gO1;#W_-
zyQdxxAr>@56CMaKm2!sj6VjDlPwm)21ey?T)<y!EhWJ(I-<LZhwfta3-9+Q|&R5L|
zM$t}afTo#KnFjvDuAI0uL5619RNGq}l4WNKB?h8<HGh{M5zhUZV8*5x;k5EGzpe~w
zk`?4IBH6LQA?SXljq3=3WaJ2g(SbD=<BaP*W|>Zu2`ZV9Xhyn^Q7@H4F)-ka&-Q1J
zHY$z1Wz(|ch*Sv+z*X)(u1j`ojV8c2)j?Omdt5h$AX7A9fb<~Ob)*M)&;wG0kVLbG
zO8x!ObrGqO`vgrC@_VP%YXMLKc>Iux!(?N$bm{o5DW<Hvl)}3H>ifU=iEWX|*`^xj
zhTIf-%N?`t`fsk)Sn-1Mox0Jc#n$Yqq0ajgezdai)K2L$`+u9CkUCW+@qdLWA)Mmh
zh-db{Ergi4MptHCTz06wp7uTS$*WvvYkqiB@NmB=HEP3WuP~jiUiy<@=jhsN?*o9%
z&2Mf#^p-vzSW$Shx2o^ayVn4~_U<>IKeCM&$Q{#f^0v5EU%p~;{+*pKz3SWvqU3C+
z_sqE^U6>C5`Kg6FTA$x}<OOWEjDOPi&?WcZSMb30mKU~E?J&);igtt;r3%%27#l=o
z9K=YY=Hy63i0WK4Fb(_LhQT}y+f3>xN19J}t60#5P#Hvn?&Qm}u7SWrowoy<rJAur
zfup(*WhVwkU4gurse!`-#o74>g`Vnx7GhxB>(^Dm-{D<-!R^od_E~F=L$J$Pk&8>q
zJ{7UAeN{{K@!IG1Z!;xXn)GHQVPA(o&9*qhv{15PuCr#^)D&zKY=UUUoH80@i>(<8
z^^~mG?Cl5E_slp%%mj<be=Nu}CYv}QkVCP-A!u&ODc8m{M7b%N0Obe+F(RPcb4;_%
zB<>@sb(Ua?7MRKdgZg}9ZtHltb%uZmj5Vt_E?B+g?Z-pn1#_Heh$ONFQ6CMAG0~0<
zAy{)W-OrJT1Pi7<W^!N#NcD41FSX7V<JFw%BNYY*VSdJgG-RGQ-lmOr(a2mAF(4)i
z&JOjd)Yl)ZzDafnH-z8k=?uKXcP@_1Yu1}IANL$*=DF5eqHg=D3T|tDzWP{Q%|u83
zyzE8(xf}`Ej`@ZEzi{H|KfJW%<Y#YQ@JQawQ%5qDwI90V$zSgK)zkTLr@EXUsIFUA
z-uB3k&Mr(ib8YAp-zO3O_1yQo;^;3Q{HAeA2&Vu5D5<O7ba+4KoKAT2XV1@zPAJaG
z{YNkQ<ZpHw=S7zvZureL{{aB&KYmG!3wgHUb+ym6>g=0V72OB`n`&MY!i~>0yq?Bq
zWrfUNecm0Foz>erUa9G;x6U^?_YbT%=f3+39t41`6<eCMgN^P6VMYk{dPU~P0xZPo
z`(FOUo^B7zwF2i8?d<mHw=K4$RrS`}(n7b^?GS7t*K~cvk4=IYAyFz5Gg4flKH}4a
za5m;CO3ke7tP&h1Js=>F&>#ZFu}R_@)kXuvYGhm>7CCry3=13uouU;H1NV=agfN2~
zC5vJJfa#;Y?CI$@vCEe(UApb)n;SmZ!Zl4c2F-~E!6s-Pt_<m7xGaVVMmvpboW1;<
z2QsH+-t^iHoe_tnP(id{!Gv7x!L*Q!I}-2KCiL7nc>u6~|NdRo8}k<zzS_IhI>#W|
zupxo~<C;s?{d`t`>XN*oJ+15QNfHtuFsK9Pf(W7+$)Q;Da%G(A0cMK801(-kc6-6Y
z$)S07Y`(aYR+*!TY(pW5qS=7~fXEP>VBSHdIhkZbVROWRdewPEV?jRiJfkIsP|6uc
zdXNVuI5A-?qG?^}q7epWHDJUA3z;~g^_3{bSjj$DW(<S~DdtGZO^GXhGqzb(Q0%dk
zW06h0@hysrb0YMA=ps>8;|$|<{KjQP4@`PX`N4{p{ckiXEexCPa9n%ef}6hPPFKG4
zNR9L8TUY$@v<j~K`1enje!3?2thE=P+P8mf@9&=asPe=ASpID)SkgLipzdhN!M-Iq
ziw@LwEXhnNPK_*HX#YFA{uKY8DIuKVpN{oqzporP%KS?8#0jow`iSeN*W5;3KK1Cp
z&+dNUt0OCV4n47VN1fhZFn4k8v^m+<nZ=oZH{sk^@%n}@_VoVjqtll1!?lg1XH(^?
z%NAU{JnP0u<M!qk_PVxXtHE<ryC?PDyAw}!nA}>i#gu4zv2&Y5f<(qxMy?h=F<{L_
z!?Vnou)r|&cB^-1uPAFMYqfTnW{8;SG|0T|ei9-JVG?H?8%3%k7G&GzKU+Q6`fT|g
z%4H;zg1C9Pu_-J-b7E6AeDXp)>k&gFEU1Esa)lugQ9s2JMkb@~QUt8fao>v<yqF!G
z4glp%<qgipCcUXiYZhz**EtO^F+{`?_I3Kq5p)5hXN0Cz9<DIP$*sJ}I9=3Sx;~+1
zL}cC^dv99Asko<MpmOsEPlu!$+EKk2DqtB2M$9SK-E^TL%h#jcx^RU$u4g9|>^Zcd
zvZb_>*BBy+Ig$uwB-yaHR}Tzm2yxpC0SRDoka#WU#6Dm6La{wqX^s(04onDe&Jjkg
zV|rkSat5{;f+dD%KGt8QEDFsROt{xpBiRt=pi{sCnsy?ys;z8Vj=|rrE8}!pmLys*
zV59}%_=o;QQH6tv2LYjg7nx#2>qqlK=1JZ52El~-z6jV-%~FWq?PFr3e7W=Hjh}9@
zCR^vb7rc7&-pQA|;e$<k4Zq`v=!$gD?CZa#f)!m&mp`}itRJ4UY{q$oi!uSAq_*an
ziqEj!x;m|}C^ZcLN?SXg{HPMBzHjZHNp(I@-L@p>3@J8K{3DnW!YTgQdFuVWLbweZ
zr6=FrLu}^$hjx8!z%%=QQ$5tlIj<h>V%}g*L_&U2>fcus0ifzg)eAk(*Bq~*Uj5WR
z7y1AIAOJ~3K~(nHcdq);s?!f``s2n!Vly$5c5ADDh~E)^XYlYu#`N6$)FJ?QX?XYZ
z9XkcA2_{UqN{m={s=xsOlfp$}5p*y0bt@nVR7L*dLE~Jz94S#1L<>R~F@;fu5(5T6
zfDiyMjydB&mmnB84{89Qd-O%doOFBI=Bnq#Fi8lJL<{$KdTg^1MwA$_=G3kV+*Ez6
zCgR+P`muV!z*&Hr!kB2}no3+fP`oJfgYElXU-35A*o%j^w#u!7Rj@=b47#Io{{2f=
zrbT2|HkZi`GAVusN2@~?7_fv8L7JPokE)9dS!s?ObyQy*o&x{|2iaZojL|{b0#&AH
z!4xHM&OztCe%(9`bB#+Dq_~;tVhDk+R|}gb8pAOF2r|-q3;?(e{t-IUmrX>}jjJrv
z1y1=4U(SyrR+ZNr_`tm}ZmEH3e4<M?Oe2y71;<zt<jk`b?5SI4iz8ukMMfd$;atMU
z-uHV>ve{SL1QYTc(+tx@V#Ll))f6KNW<1)cfKdodGX=+4U>q{z@~)z{NihaskY-B<
zfM@q@v}f2q`=s<p;&Ii5)N%guS?jZ7zHFKO%pYH@897|-A6Sub`O2&-Cyiz8hc0{Z
z*|it{_@N~~oU~l{*mi8PuKi(N(fl(XjXA~t7E?kv#lI94#}8Evc2*p1sd4qt313b`
z!s?~h6wEn82js6(b*xTzs*`^grk$#es2^|8J-Rlo0YG8esnhLu54`yD$V)UpJ%_ya
zW!`sB%Dw+>o+FhVA%|Y=dCp|hbsxJSX4!ayzgw(PU93esq^P1e(@L0{H7%o6tpNtE
zI(OJ?U<hL))>UMfVbtA}2B@c(OW~5gPYXK1vd9hqY4&sg_<Y}IYp!0cj_XxNYis%&
zi*pJpsy{1SlwEnKJS5$M1VqBjz9A4L4FI$eC4E}<oeS=(Y_Dt#wzLYZg2ZG=^_|eP
z(O`I?U7er{A<cUvu<Yy=)$Qf44(%|_luS_qAP|Y}J+3XbW%_&7)bQMjhSHE!Lz`Y_
znI!?^TxXge(jszP9m?sj4**`QdV24X4PnVLk&!7%;EW@JG^Z|y5@nnk!?7~1bDh%w
z4~$ZS9dn(B&Jmc-fdN%`V2JjWD-p>eLWooTpP9d-0sawtw#{9kdAYBj{$kNP83~1Z
z53c)M-Xw?MkwY3GKm=}|C13)&3PTNQ=mOasO;i;qLwbP6t2r?PnR}0Ioc;qdQ#q#`
z3lMa1Y!rZ?{!hJJ5<)V}EXV_HWQ;RhZ@ug0uhh<$H<iDpzIw>es!RZ-g0EZ4PcBSR
z5|<a<IXR%Tp>q4czFO}ws^Hhp|9S4TQ{C7veeQ|M!QS_7d$1t!RC9(4ezCqdJL8c{
zmi`Ytdy0P~VL#vTJ+C<a>wCUwoD#w*{?2Ty*t=o>>+<ZdU|Zkn^KZ*ECKP4lZK~NL
z*d%>I$)1*+7oUE5@U#1O?l}6Y5F)3W7N#2(tT^i)0NB;_;?9m25J8Kjlm+g&t1dg$
zWvy<wuDYx0O}ZOfrC^6ED=sJ47nH4Bb1}_LU%K;mHAgGna%}~K+Hj+2<VHIPpmU8Y
zF6KJMaG2>b*G>0buy*&6Ev@dVW291wlCg-8sxytNL4<7*=#=V+0_GaO+<og8Wo65M
zy!M4dTbq@7;2?zyNI-IgsC#r|5Hv4G1O%%X>{mn!3U+%<(=bpjhoY3Qys<;9l{Oe-
zB}Bm29W=(ux{A_5GH;uCci^OwJ14JUpz^hWZJm}T23P>y9Li#c(r<`<Ake41KDwn-
zZm`Z4IRzquyGLU#?fTdU)1vc~F)D?U;DFZHUlEcd9vrGXI9L&xZ6Fd-z04SfsgDIl
zbjglIBbsl_^$*g(px)=GoecY!&fUlLWJkWITNg|S0Dc_3IwPU*j2~rnONl9x?BBnC
ze0FW8QfZ0CrbvPX<R4?0KwzA4gaS_PNR~LjM7K^X1RL-ioO7vh#b}fA^VVx-USbZ8
zP(wI&AE(GDm}g0Iw9J9hKpSohNjAifELH=!4H{BIvNq?wa(dk@C7buM*N9D0-6$<2
zeW7nb-n`tb@Gnm$S@-t#ZGC?bqQWz+^G<Jv0>IM;KC0;JdH4D=eA7+w&q>&$U*Bi?
zM>GETUEefL3E>p~5H?oq6+(?0K6{yjo0OwtYc9TX{U5ekGacGkz*{}A_J-x@V$$iV
z`5nhzLl|vqdqo>nmSx?p4)}AXFMhG_<?8Ml^IVHE6ufuw-Q)X5e|r1c$?>m^?cD3!
zsZogqsbuCRIjH;DSgrrg%$1{6zQVMks;){~X2|P<o8>4;W`3g;BqabMR)aX`=0jh2
z@A=_R-AB|9?K`QC?a`b_z!72^2xdf800g3qFoo$s005O3oCBD6{py5n3`Imj>V$5X
zYo|JBJ}%14;^4t?rn*^rbZ&Wbg>jY%1fu(CvXJ5F4BWqTC8Mac^iR3TMU~BE?NEEf
z)@X<zmRJE0ND|YXdZL>7#h(uN2Iz&?pVR8EF-8l)F%~$f>JwU6A`y*Xjv;rPe8uP>
z+dq6FVzJyU*I>Iy2nZ&G5ZBzydt6U(<o(#O5&(i@R1U*i-+h9q+!jYphSi3|3%bey
zpy1@PvWoq2#fFyQ@|;CQ56^n1WvINmrKHbR-7;MM_&L9yIHH>($!m2_9p#mwiGnST
zFbbNV%Qnmb6ekOeGsVpnFSpJRr4URR1V`CWgBr3xN}X2V?$MGUr_Ej2W37!yGbmm@
zaYR?V$UIA;LDs)Nke9in%YJZiSk5(;dyz~4Ak~t2+HGo2*6beG-K;hFdZ`d;x-<5s
zyOVDFs$bQNv^@2joy{S`nw#ZBr@nRBFTVO{*^$GAN%H}qyr;WhR{U2VI#6A=BqtNT
zlLHlvOY*0VD*RrV62d9|&ro^t@Q+`7l!Ta9<^7oXl`PAwzv?dF#>%}ysA*%_t6bI9
zUZ-(x2+|cH!WitFSaspufy3huU$ty<<d(+Wbz@D9+Tlq>^dE8-Bxko-+qYD0mmRXV
z&2xYDJ;{7gVOl}sSWR_TrFD+srS5H*>6mbCHX6ksXPh|w0%mi?oaucTHLhlZ4VDxX
zzFhN^dAewg1PL?%;Ig2&xbCHjiwS1z8)B-9TH<A6v`7^$m=FzcECEybWV#J7jxcZr
zK969uP=rBqGfqJnr<#|ECUCSaHiv`Jfse)<4m+Fy0Q0rQOEUATT1tAXwar5nIg5(A
z-V5|Z9t_R1BFaRGY2*4rbIvu>me(DxI2PJ?nAIQwsY9ANp$nK<qOduJXg(esqsll1
z4xB-FvP2|=C8SKS@lGu*roi2$F0$pO#uQ{G7FM^E7$eD^+I1!e=};=IvBVTff)h+}
zF$7?+Bd&8!xhaxpel8fm*{w?^gat4~5<SR?gghs8EFen^;S4zC-XTULkZpwNJTT6J
zPR=+O!ihCj(0t54&XS`Gef|2y@=8mbFwc<NG+6Og&-xx~tvOayynMVv54ypcC<`X^
zW7D#c2Icpb=go1_Rq{PI#w<JS9(DcIyF0cNq!)d>uk=VvXNDuQw6#tMm2Y$0cz@cL
z-&vK%8n$)4)u4B$iHnxay<B%Hg~?gpbhiEb_pfiLA=4c1-SFk{ypO&5ZpCnL-|FkW
z%|%O^M}PfFGgrnx-E!q$?$}fO?Mw;b6#olU_O@TX^Oq#Vlx>YGNJ`NMC-Uc{{DrEv
zvHEw&AXc3`TzRsMt9owig1qVT|0-Q9Z>y_Qx~q;i<t3zL2s0b>BUL9F>w}&8cyM{%
z&Dx-E)j6l`08J`lz3&ipYs<234>k`q^JY`Lxz5vyB|P@|$b)Aso2;D&fZd&2Wry%m
z_cm-6Q7|ZJiq)#hQ4;g&%&UXKF1D^xU37nA<#|`0`*zRMMk|-C2z;7k!;B+jz%<Bp
z4T4VY?W2MjBLM#dw<OAf3A?-0ti*!aj?#HjZdGT6H9?*anaw@>5eC_c?1>_g(d4e9
z;$~PtGhEq&Rl(2&QhTt<6irMHqHBm4P{4(d5$isl5X_wA%v>Cio0V7q0Q>jvABaD=
z{nK@#2^k|vRJwqHV*v@64YyMo<n}odLY!%!2RHyogvAVJU6Z(GQD`0j?E2)1S8CS%
z;M}u1luDC>SYn7CWReAIUPdHPCYb7GA@PD9<U|5b9~EVU1TcnS&C38IrgH#bIw&p{
zK2HPy|0tcM=2o|shR+uzEA|c1x#s*!!&kSCRqXR`G&*o#lwBaMND}gNKimA9$JZ|V
zg>RU>T>Erycx_~kLAD{!Fi%pm2J5wxGn>pa#F>L>SA{%)jrgIqn-+)X{3LE!a6o^#
z>$zp;uTfllcgL0va}&o{4G5fww?^IO@71chYgU~9Kz7WRhebSB`^vWN-(b7-p6Dwc
zOuhQs9PF`|cdtKK`_oIWc=+sdCoQEdolksNRkSeSk&6q?c*!}pY*_lktBM!diWg1Q
zNc=Al`qLM_=M^WOJVV;>lo0+q^5pB!OS2=fQK~q8xU#pM2Q_WjnV+y|QW}4H{TY5S
zeT}l#`s(p6VmF=E#S;&__CJ0;n`-w6p$6(vA56RPYY$B-V(#oLTc~Hxi7iy&iW@UQ
zR=H7DoG|2EWXZX^U=;vVHJ9%0+?t#FgErjAy&5(E0&tkUA=80rfEb%-Rk%^`^y&dO
zicZEMGq7kzs)tJ!3<3&{Qz=Y97_bP8BC2prfr+D(j;IqSS!BMENa$;t=Q*x3o$Enx
zcB=LS2@x<)7tGOQGAC2O92BO98nFQ{H02JK`tK}yC?zzvb*QYmwY1+>bxG{n<?mh=
zm1mGcu`vuI1OjI2I7LRR>6iwY;$(uE_=jj{45%&|8ZWr}Sc)TW^pJMl{D-PrO8%%l
z>qwUYKr|si1kKBIKO+)C7^upzfczuW7>0p!8ax#U21Xg@d~!L_f;B%Ej7V`Z&LBz7
zyTG(6Fvbo$E37jFPPzL8%}6X<7*?>)zftpY{|ME5T(Y9FsslY@)wE365>33rOw*A$
znrJ#!6%;p|ak=%uW@q(@sK($3O$=nDM&xDBDX8zO%$T0nFi`dKk>@&14T1^#hd45e
zRAIhBEI5oAj?7yew`N9uefP5RSi{vX+-uE`QwHhY^ZxU6AGL3C$%b`gnqy6Neqqw7
z#F;04f1s?Z|ECw^6fKDVwyR2-$BI+J|3_{+#ovLD)qB3@6`kw9UV#czLO8`F6+LZL
z14pn?VnJ<H?xlbJ0ssIgKU7D;j92e@m?>=a**B_vuC>?P_xE~Adxmy=@%erLxW9Ns
zW^671)O1z6KC!)3t&<%ha4tzyHZtmGx{q6II>B7^u<1jYDfZl#j%;BZ-+95KH`wob
z{n$pc1AjE|ge8h_j2J?QAT0=*3Yv>fv}-XbSP%hW#2APc6mW9I#X}Pa03eJ2KxZ)8
zk1bXv8@T4>01zCbq6kDr?x27OGDQ(tVvNFAH?vq709eBj0BC-GvQ{&;=B&N-r@KCU
z!m&s=qEy;qi7^~&e(uu+kV#;I8_i4|qXe^AG_PTx(hyF##zX-OA!t&)lrcRx#(tjq
z?sIQEb`({`<jS%Q8N!KZ00cZR&SWc6T@(vwq=U+Ke2%`Np}TBsW{q_^(N)j_+#H6^
z6<57d{$%J}kw^&Ol<XbYf57Cx{$ZM(TnqqufSV%mYjsbVBk?b@eh&aGL*=_Zd^}>I
zc+ys_`nc)?+blu0W6B`tM@T|Uhnb%2pp(rv<}HrNSH@{p(iu{3CMEEQwQ(}YHpCef
z7rViJ_omVv)@18^_x#-#f7$T8`b1rWw|V|>{MODlTO;}w(*$);TXX4Mc{9(Dgj`Zr
z^Yj-VRE~^4{KLym2ZFzT{<TUsDV#gw+XBHU{z;e;!YTem*jT=|;%E~wi`8Qt0H6<g
z)?9LjHssB5%=_B;5`Pshwr_pSxl6DT-9wW`7o~+~rx-H|78e3QO;^PsUf=AlX${m!
zc4Cag)TvoQC@4$}6GVTIXcUX6zd~6Mn(sZXXD1hb@x}i0FI;-y!2S_OwQU9odI1dB
zJWG-YlPm~SHr}DxXNyebL<UTN7!YTmxEL0YWJO<lZk&PY<yb^276u!&*aaZju;S(b
z;OfyAL==AX&gb`B_Onf|{`&k&&+4~TBLU2jMDugM2Z)5Q0b?0!ex{D=+^t(<ur(a{
z16VMii9z_P_*p`@WCUvr3A))Vv9M{V!ZKY5PH<B=h!R)a+|{Emj3}J$%F+BhGpX>j
z+?pNO5<?~<*U9})&C5?e4d*dEf#kIgm4_t>mKYL`@<tA8E&u;t0MPtAawzAxR5f`A
z5eWz|3c9(j0Fp81oKXmRk*7y{EbE=gP1-Y3*;3XpP<diTb8E0xFyYY_%@AiKCVUmU
z{mzsJUg&u~BP=7>ujI`;HAC6Kid`r6G?R83fWR;*NY1%0{_33Ri@$CDCx5qhea+{{
z?D*Zax1A0I0pP-4?Rxau3k#E`nyCG=GbMym{0mZksIJD<NkWVpK7AQmBw&ys&01M-
zeSYGpWW0J;6W95Hk^=y+`tmQ&2WXh6f1ztvX<b=nRAvfEU3uxLs`-Y|nwDVww$e@Z
zR1;?~QR{i&+*QtlzU3FMnH;dIW}|hE;pLt!M8;Ux1p{DR4-KbSqf`fnL(@H!5#n=!
z&BhEs5e7y9VNg6A0Ca_`3L*xKMG!4W(~vUGkc<JiY{x_bJqYd-G;LO)>g7!*%R-X`
zK!7k3O-S=||0r{I=@|3z!&*oz);O{l`Lsm>0GMNlp9`9w#|3f^_Lqwxf)q}49}@_7
zb*hdzcrt2K{amL=!6G6M82nQFj1fc+GSQ6PC#e)h1Q`KAROM6y%}GTAxVrTycb?+n
zjzvQ2S2T=>pnAC=a=#OZgeJ@9gHDbR$achZU^<_aLt;RxmrbUF>Oqc0<n5=%NJ4|0
z7_eYMx&lN-K^LFs(m_I&83GORM4mf-Si5fCn#^x0x;XX04OH&wdalddV2lz1qs)DR
zAqk5S(i~^XwzFUT=J>LM726KJ(B|mQjnDe@!wNYu;=cH+mnGlu)iD)aO;sbEtMaY_
zfU=I(^;Mr@qhVFXS=8+>PD}shoKyVsGbMym{3}yCacE21>lK}iK%{%8Uz8QP@bqbd
zyN>VK*|UdJ@VC2GoO{2o)itSzTgx}^YTs!~v2xCpK{c5rr#mv!Olbvar@nAs?AR(h
z#N9`?5*Y^u)CJn&wD9ctO6t<3O95b4%|>IawEOULmf3RR(4w69+*doFwaRL^O%-Eg
zbyPD)3jm<>DqP{_XhJ9>oCyYm2+|agEC^u$0A1mXA%sC!xYq?D=F>)Uy~C`}UTt#V
z@e#x+*W8SIDaK&1qKG6S$Y2V`z93dP78wPASYPgFhkjk&qg&tn^}Uz>>}Q`|YIfl8
zIYcxg0KmXwyt(`LADC+^2#mA-uo`nD27u}5LeR|wBM!K^V8I3>_&vaM&NM*4O;*sn
z+#HUAZYGBizY72((S$hTf{Z3pLnSjH0R>$g5yUyTPf}wTo|Hp9$Qc9G%jFOR42S_~
zeoht67yuxqpSp?20kDJtz|%+P8uNY>u^LI}efLJDan;QdA@_!b4}J6F-oJl;$ULbn
zP(9n5^?cR(!$L!3t_cZfzK}K6q;%L?jImPu$wfEE-kUQg|7+KNRRZsfxv`?BrK-1a
zdG0OQ5y_{=l-5^msC>Jg^=DaUy>sj1>pp#NedQ+)ExBmTl8e5>3Cp^M{_MH)B`u!f
zWa}9pI#7KQ0D%~OprZYk%f2-#o#Jo7cK>g_=M~*s&yZ|2C4^IaNqJ|}v(5WHf9DU6
z-nCpGbmk|e{*BGjwjO!2W}vxds2Ryv8wq5Z=jYB&PZ#IZoUD_h3{tf5xw0Kngn<RA
z|EOnq@x8(0zSWm6-&(QR5M$WUv`vbXSb+JC`0vkO=06rV9VYIm+GLqy+)=a1Jlmj7
z=%c0XmWPg=UbLpGLJA{`!*T#%+j~zOoVO*!!C+j~6&@gx6pH;$ZY0zoFr+X;w1C7@
z5*X;yB|A2V8~_4NW(>iI0Hq+C0006$r1^Qk3+4zc8-Y`f1q1+GVT3>wE;`o8jNv#*
z&X4ovSR+wwYsveg&o~wcj(ChQs6HOy&I^q3E9R{I<J*54a#TBKSDU91$%OPE_YE_Q
zxb9-M7>qf`VZ!k`Y6}I%xG5ZK0WgLkJ-|Kv%sa%aaU>*OU<}6E_2^WA2%z|Qz=IG5
zcP|Z$vG93<AruP+r1|;iVNLb$kOX3M5F#P>34M;K;E(ToZkr*5&JnG#1QCd5dCqP<
zZFZsiIJLwH0HAr<)rn^iywg;*l;$QERkf5>9V+Xe+1PEVGer~C2i`F(*a@X*0nWTG
z^gcbn-v~TE*OQtVo0}e){okCeseJQ+Ev<&bIMT)xcK58C9>_U!me!^Jb??ClPyURB
z%aboDJ>2o+yKgLAx^(4&{G!xvjRH$M`kwfGb-@hV&#pb^+s6EA$AOY&&oAyNDo#0b
zzUYBE7a(y-hUq)rhbjI>ri5^ce@33!|5im;b8&Wl<%zb+-os4M^dVP%d~#uG7V{~2
z)93x!u4!ka{BTXZ_plIV*tq{iViBoZ&9u(Xot>`sdLO!S*`@>Ajq#Sv<vYbl0}JRW
z+Ps_@nG4;COP4O))wV;75TEbZiDi5`Ok7rQssng+S7j@0U@BjlkPZOVEhR03WdM+5
z%)jHjM^CT*$>>wBS3WU4T_6G=3<!f{K~#asun!U73>i2D05B2>GeF?%WuY?(ryKwf
zL6pJh5Qrk!?OgS8Mgahvy$k@7XBCxK9Y_i-96idS7n0WA(&$A*kdZkYDH`e@Ky-{|
zOwW(f3!>D5`a=gstQE&;MQo7_0E4|;9ikC)h{1vc2_^=(Yz7VpNr)Jb>gTQ=IzOUd
zw4Jt%mrqL-CWVtTE=UM;js>K7nRl2a81e&S{6~pvkN7KU50{!EaocD)RXNvrSdw6k
zApkIPNLK=Uo;m-BT4{FR%V$0`)S^$mKR?M@JNfSABp084(<ZAD1H<&Rv8tuCx~+6@
zW<z_h%HSX~gSnHZ*y{>XJb+|Ebx2Y&7FlzWO<4et<~Z}OsG8o|9j!ZSh7Ot%E$Wzl
zd(^i|;M0G2c~i>=g~^%AlP}4ex#+2P->43b<yahRFS+L1Jgubp$P*vbaV_}Kf86?Q
zV}AAG!IH+|pWl|eBt81u#!T`3FeQXj{NJFW=TOy9Czi#^6K&dn^LKYY{<qJ$;q&JW
zvurg(%~|1#?w|W*nR8`FbwjXK43oAW+THlWFTQ%ogP&d7%$jv1@PPiz%$<3uMODqE
z0AO_B)aU{L_{9Ir@B5xM*fAC%Fvff%%-u`#7ZoKK3&xJ<i=qnuc>D>>xg&ubJXUJ3
zfY$})a4eY-0B{6)fCB?l6p<|mD@?W_=K%BcGu6v|V>~OlIF1xhj?xp00ATx@zv@Hf
z3#S)ZBXN&XZjD6d2rNh-%D^dbokuDK$7*PTwE$uC;vXNo=+dP<YPr>cj1gFpfC~r!
zG{CwJs-Fi&SzwHr6GXv+H6NcI$ej!vpWgCc=UseOmr^lctPF|60N@<tp|M!?b7v2o
zA5n0;RJ-T0pSey@QzU-=!^a~Qiid{FPAea0oCEUoQPVV{dAT7B1Ayk|2_!G*;unXn
zcK1?KB&lvGIcckD87>b^6fO!`J=&_Bu+}sWm4_sWmS{55pM5@F`BLrEovhlPD4Jsk
z5X?BJ9_}Azlp>0V7$PWR^ogWBsbSx>e=vFY#@6a>5$8uR9sBxuiZ<`nD|UWuSZPD$
z`j1{%vg8MqgGaGhT9J0y={}-o<nh<ve)8jz4<C7uI-QTb{*e$f?~zL~iWbiPj!O<y
zwJpj0mpWg9bN+`v{9(tA9W^yIE|+WCv}tFbefH|rt5Z_Gwb}##0)c?lYNeEZ&Hlj$
zA6$I##gl)#T&~TVH^2Gjo5zkFn>KA)a&q$O)vJq(i~rhrzKtm%oMMW<h>E7N{M5qQ
zqva>2HN4~9!ZohC8B%qFOaZ{#N3Ts-tvcBpAtyJb_}!j$Z?-&@99=kMuL_L<pp1z`
zRlx5A0z5R7ivdkGBQ3}=L9zvO1(?c-;Z$Czt^fcy`<QG&q8ZV^sf3!4k^G>G0RRFB
zPbA%1xjh=oMuZ7q;23~W(7X%)#(EfK5FRY-_Ln)5$fQ7OK~7BA>jEw!K|)%P2geu<
za%(uyAh*Y008st>a0yG0^RLZ*^f&d7n<B^wW0iFpGMl*;<eWmJH-D&u-I)J~f0Stf
z{?5^LM*<b135CxUuz<{wnCd_X*F4M=jyVU8kftHc&nFXEXVKh6kp(qvrJA32DwRih
zRcN9xnG~w|IhK*)<ysI-4x;(F9^|TzBbguqQW)`%amh}Qi2TEBp(SUuK6q#0L&!i7
zMw*8LfI3dI=X||Tp{}p`h4!sY-ug}HFK;f{+!5JHj3iY|xntJtAc>iwU*B4&>~38D
z(F;wMerz=d`uT(NE?o128{pe1>pFhHBmY^PzIfjw4+6jsAKhM@neylr|Bm$%D_5?3
z_St9ccKebgOBO6x(9+WK*=L{Wy1sk&?wf8pLvF|<)z#Ixxw$vreDl0{^S)}o^2#d{
z6B7YoaB%S4bI)ySYrE*8i&9fl`}_Mp_~3()k&)G_S3mR2Gk^I!-+|?>_x>j@_;0|w
z>#}ber-X2de^R!WZTKB|0by{r2k**R;p<i&xbUIZjy_x6R$7?7<kilNq5(`s-4HDj
z8R;%v^KsS5Tt~HAavq-4#SvTOp91SnR%@ZNh$$S479`sc0B9M{gp>dPAOJ~3K~!VZ
z7Doa;5L9ND7{)-^sYNBr*DECufNz2ut-w$1BZ44<qJZB6vcQ3Y$p$Ci&FMoG5p%G8
zI^hh=;V9tdM1aww%sb4^kNfGq-luFciEKrxmrF9(BatA1>gT>uKFd&Wp!7h3weXl$
zAz4vG60uF{qK}UcfF9&$i)$7q6ghjD#erY^<71Hvg>JRn?7(s)(HItGq&TT595V_5
zKQdTRV4S&n>7?@chS_s(Jhu9-Uo@R8GdajfTlFdB3veu<z$g>#gmX@0toixaVGR&q
zvj7O}Nuugvii-h4*g~iZ3yrx~M=$rD(6SQ0D_Io2qJOppCS5_AQ`f+#yY+b!bMMQ%
zH*fA4YAq_e8#mRzQRnH%owZo^krkO&v!IqgJNc_)N@{D?ef<6-H{Mz>E1~pI`?`{P
zu4_L%x3F;DpZTi&m#3tpWXX~xX=!O6fBdn-;g~em)YM#Z$tC0C<DH$IvuB?<KHjlo
z$G!L7d+gY;S+i!HalrN0U;p;oZ-4aBM`xdX_M~NEV&byPE-NW1dFP#XuDIfgzi^)K
zz;eg?f9)lIBi<LzP$xYlgj4(#R2(@70A+_89=`OpKRftu=cSI#yXv1c&yeIukyEbw
znY%4;|2eDuy=t<Ym7iL;yKcQ4Mq0g9Ev{<YOd^?p$cP}ugOq9D?bWSVjWlb<Py_&~
zk0XqH6C4pBMg$_pz`2hZfw2g2^2VXjsZo`406|6oz$iD^v1goH?1%`QU<mqP^2Q+m
zj2>s4f<2CSRD=Mq00^UKEk8;xm_My({}=oFaJeU@QVnqHG<-Vj8}DIrBMOJw*$G@u
z448;uiNv-T9CUFkz<4+1I<O!!hhcL#$~UY%c%rPOw={B*V2;2_5M&DyB%pu*VEi}>
zj535_tV0i9DC#O)k+?S2o0FbU1OR)gpW5fy5WYYVO_=FiG$H3PJ?P?67?DE=An*^<
zdB(hWJtrlqpv77Beqa+Izyu}o>?<8BgJaYbE9$;ezY)HzQXT**n#<I2-I8QHt$%?&
zMV(+2Nn(^~u`%_ws9Q6qow?z4Wq0G2_P1+2otc(752jpm#>O!vwKeNL|FGISk>`lc
zjhOMo2m6;4<WEW9X)eC_;(hz}m6Vhe6%~EezIE%?Wy_YWSg~T`#*JsZ@UFY=diULT
zhlhs|`ugub02mq?ii(O_wrttv&6~e!KYH|NVq)UC=brn?C!hQ!^L#f`LO8|$JvKGH
z_sqwyl29Ypm^R?bpPgKolEwULZuI>8q<>U?dE;1hT6oURnvJGdsbQe14L3-3!Zhyh
z)8?sZS+nvcgT>mT<t-Cc<~Z@NR^95UHkeqVH{+0}(l$%5YKqYlOrBY!`gv1#DaK$5
z$Fk*A;}{|W03Zx9aDAKtfE-DJUOvs8=N;n!5F-?F1_(n+eDS0O08$eE+ijAAT_xsl
ze6XwJs;ox=;N!k0KOcG09*Z#nXCIF@6%2Q<Yx5uVjWWrMKJ0&L&{$!P#F&6*fFt0Z
zJ{CC#pWY_b8KNrJF_uioGtP+slmanhO2N~|6c6{0F~NYC&cou#<i4mL<dI{!=Y>36
z-BNNysq73^#4VArggAxKLt1E}5a-MB4)e6xg;g!3ZLW&(cJ1tQ&uR}=zP)5%@+H)D
zl>vYpMv}wM5VSQ8RMs7@xHEV4X-j>7)u#8Kwj>!l&5dH1%n%9mDTyPCmMvY8?#SL+
zvn_9K9t}|4shzHu|0)~H_iQ=zTi}psNqTVcbp;F0&_TPb{m_%|{kGaW@$fkp=7vTV
zrKVl9Vb>!+I=?Vs=3nbY2M&${z>>vb-!-OQ1*R^^vi!A^|L>BNl+@SP=k<Cq#$UB}
zcXuZwB%F8Nc^`lL|Ju9r_^7J8f8gJ{%$|Lc5Fla6P6!FvCX;1mK*Y86acQl!t=jrn
z?ebJ`1DE>zsuc=aix$yp7y78RtyHa61x3m1lbP(3eE~v%K**li@Ams+V!$v$2nY%J
zzW?wA=iYnnnMm@<x%Vu4LS9%@RHRfYZ@cZbx8HvI=+UD~moELm4}NgdO*aLPe){RB
zS6y}0u3fusx#gBg7bYYm1OkD<!NIB2b7mNX=#nwFH@wiY*VIr|Bwwh>Q?bW}G==K2
z^fSFzKb5t+k#qU1-A!~{7%3OodYY|Angk!qdjq9QbN+G5|9-8Fhc8x^k;c)lR&A3n
zk_0=8pA<9&k9K*@cBkR3mgguxvphjF+$%H<TYj|mu?&$~#eHR09l^5p;FiD!vVq_b
z2pTr-?oM!b_Yi^xcXtU+aCdhnxCICVcX!vjbM9H|zW?BzZ?jfc_jFfPch^%jRZhc2
zzaE~0)=0P|WV;1KAq7BJlZ*Zls`~=(7?_D*yxve%-cywKUViywZL^UczSKxaqGk)-
zjzB80uHN?V;K6vv^YOl5*e6*j$qgxD<V-O6uID~w4r`pj{dw`j&~#01{gJLZznMKV
zcXVnC3K~F94T6FBO1V$4EtQJ5x7Fs)D@pAK-!JTLM2Dh4BJg`?YZTJSwz)1{SWPN-
zc_GoM$beh_P*%f9YXbxRf(8$>U-uAJtq)%~Fi%wbC%xcfwC#1ODo5~h&jG8n@&57a
z0#>`yoV@zf*SPF8@dNX$lPL+4VXgf78u)5&S&$?xq$GQF19fNhUFT<rO2<B)^``i<
z{c>BshAm6u{M=wf*+^$ICj+0WUvd8V!UR9NOTB={wi7``)^xNAz{pC31RP&L#)y8;
zzr{~y(6x(T-=)JoDNc?)xDZ^^EtQ@rbgfJgp-mhZ93<iXW}$Td=Z}V{XkQqZ4j&(1
zzBA15$JyDJAVb$of%+%trnT7N*(&^#6I$4CH_O{=R#p9zM%CJH>?bd8S6A0>->%L#
z2Md)ZQV1%WE;oz4r_p+z=dBeWeWdBRvg20P_DEm`G=_Fty9%(YZ$hX{9P>hVbxmD*
zaK+tCGc*Oo@;rRd>X*ZI^A`JZQzI&Opo*jh&Zl_%4S=y!^|B;@#CnzbYVfM7n!D~@
z;YppSR_a&>eldU5?BrsI-*^&~LS`TZy}JuS0KO3IE>pSAL1N&_=)*K}I7bdEl$VvR
zTz7co5|srMu`m_XxUN;@d)ruR3N$+n-m^g>;i1{i{czv_Mt;t@eyY!@1;o8QHepF1
z5#yMuggoRk6wx!L;x3d&IhzA;PKc<L1psT@^PF<}{Q+TsuC3L3WX(@{fG%L{Lv9>(
z6y_a3Pc9vN<LEhNgKHQ*1`dYgNv5vBZVpMr^nJlCl_a%9D3&dZr!<`n9_`*jV`xm0
zFO|5d-6wZ4l;+y>H@Kj|63ZY*67r|dG+Kro6x1ie&LmG7D@;+$e80}=dxh@%EmM+|
z2Kc2wO>B9wGog&Fgavpd@Qxvveag7*tZhF&Bcj!;dwN-l&lPDr@p|Pt><F$?=d1bH
zH&GVzMs6_jlgQ%sd8#SZqlbd+U$MS-2WkVEWUvr8c%i()!p8b~Ia*wJUy7lKh={ql
zxtU5U3yWW4W0X=C=Yu4j+ez9u3_2FfDRY(j-e+sw-%s0b6V*GuZr(vlK0Y0p3$$L2
z^SGQWx$$4a4|O))rVE_ipSQg?vZ6sG;~v^7Yap~KF#aGNpIo||(Tny2*ZNf`<QMM2
ztJLSbzYcjeZi<%TLTkS)ET#3nG*6Xa?w0eMB;|{p*|86%Dd}nK2y8J#XijDRx&Qur
zQ?<Pg3u)5Uxu3c}_-%A56iq9on(1=0?oD#<b$c+FhMOSmmxh2iaQ7k}bcy!9CeFW1
z6G#5;p*bQ%$u_jYxs%DANz;20n&vtw7Aq;YuM1(|a2?jqMFlyWa^ed_K|sJgBwUiz
z|5V8Dm5=R`8uJY?rVlXh6B8qLuj9v=p4TrpwMGQy%>|VFw!1m#2`jd9uu(Dtn@r;3
zK!(zOyJWsJBjy}W9*=DEOH~hoU1cF3^3UJV0eA4~7-{ddGk+zm{OFiEVZEZId!1@y
zBM*(E8S3_b`UR6@9(X3IMJ$1+u6fCn*99|y3X5U65od70MC^O+;~jDu$7SO1t#;z0
zOt$|J5_u0t*Gw$yF7_UBnB%1;R^p-H8jHV_CNYgZ_0E%rLC6RSq{Vn$0ZzomVR38L
zu%M@<(|JUoK_Y<?=U0;Fje{85f(#8s$=+`y^;NwZPM$5wooA$mqZxaR+7_FkE%ToP
zbGfOb2*BB)z$qm;7L}MmOox|bG67#?!8ilFkcaAG#yYf~@BG8{;c3fZMJN*lVC3aZ
z&&cq++EZ*@*3-b-sJD}oi&QHGhxbEm=I)<NGo|LRh-58GHp}%Qh1#laeNvM9!yh8&
zPPqNZ5%dh)2Y*X(Q4YDyeQf9Dl3ha>tmf9D+4f9-4QX{1(mS?*X0w*4?658Wmf4hP
zOKRbFd7hp&2Hq};Q^9V&i`nMckc`7Xo<rQ^GsTE>M!djDNZPW{d;I38Q_*DF*TXW&
zY!*u^B?T`v4FH5_zKSa|gKiIZIT06L!JR6#4-?+6vn_v#AB&u3+VUwRk=@=1)%uZA
z?n4lxQ3)rp@D6cBnPCk)zD3ZdBR3&PaSFwCF~gp9-3ekL0&5PKMqDAHYuB)!MZ2Kr
zd#pHvd1ym#Us6(;`~G!dMaOzr1ye3_N)9C{8kH+CUKR)$<VnOk=*yeArSZ971_0e{
zG+THRBomh!wh0Rb?bJte^g{~M9!3pARqkM=>EW_bl3>*EvWPg{W45^@3uJ_3rHy}8
z6W=^8U_hd25rEQ}JF~&lD2mx%8<tu^@Zxt}$elWRN8CN!%jo?^Ohn=rFl5Tq!ywel
zon-hzxRu-WV?!D&-(W&F!;kSC?Pvawi%Pwf4|*W<yby<(BNT<9>7{GaM$cJzA!Emp
zq~-7Q65mJSlI@zl%DK5O_WcYCLv@V4O=;x!-pI5UaE?Dn@n*NG#b(v4p0WPBZRjp^
zr}}b{-1)R8A+XrwunE28QW2Gum+RJ=Ma~~SpY>u;4aCalW-1$ka=5yko4Qw4g(WRz
ztY@`3y!N$wR<yO*mL!L%2hX`Byy1i})6;C*ww0}0%S$S?S_F+w9aJ#pLX7(ZLUd@x
z-MC)!b#ptt9befsVaKA*;onAtQ%M>X4P}+8U=wDQ(_d#8`0s1fuKwn=iKQKykZAZy
zK@<L=*9QT}Qt3mls`#j1_0}OYKt(7-()S$2-xHKh&j|@d4hJmpCYAhh2DJ}~ah@2U
zg>IPo1RF^sDV`XF2;~F%V+j>vC`8c{TMz@RXGqGeSnJ;6>!OwAwm-GKp{38vvoP@J
zy6h&)P0iG*ST<HGm>Rx1M@r+x;A0OWHT3PQJ1+{oMp2}>x}cC#&f@wQi7Fq1;R>&a
zx9^M@KzattG}-gnXv3B0Lns9o&JM1OBtEg+vpVW|zUJ{KS<}s;@|_qlLMd+UG3~II
zb%Hhd3|PZcMwuL%@4@$(aY*a1)y}hkkWHz_vezh$d<3;h-m3l+oN;6?zk3YPw@OHJ
zJui<aq}!lTx!OVdW*;Ta!=&C$2{QS4wRztbn=IP(C`n09yeH7=z|_D!TD(*G%jZ3(
zdEMLfV3JHNJylhw>sj^3=a<`6@7FRK*C6+gvEH|r#f`^)XKmn|bG!g*RuNT7FvI3R
z+hWf~xTA!Ob$)xJ-SPpb60h{3goY~-mz|%n-f(h<WW&!`6ec^cxQyEXMVlVgj;k-?
ze1(6`#cxEl#Jh3F7WnhsNaoVPxbjyI0=yY7j8FvyMd2tuMaPo{t85>dh>o8u&-B=*
z>=77JDoq}C(yrve@HrR!chWgOXMV(&NJY-o5wdh>HxAYQ!Y5XUdDndx@ROMTgBmuU
zPHI|?)9qz5%_2i(^L0S6=kKi}rcjeLA{@Nvt_MShl#nFgXEricpAtwk&sy^A=CXKN
zX#(g>ps#1c+q~>&(-oH%zn~Y*5Azc-=FD2->du#u@ql}BVJ03A<6dw=Lw7CaGO0MO
zpUbLRY21lDrL1fveXW%@FR9mPEjbj`z3HvzEzi!)3tWGHi~A~=pFWMxkhZ!~KWj2&
zVlI#~lfDRb>WFwg7Pt_>e}ZQ5Hch60y=I3X^Xm@1@f@a29?8wgi6Z9XE`|mke-set
zY-w?y{)tT`-v&h-)%Dy=oo}{+r$2o7ps1)wn^;m)^EGGEfYD=<U=<YJPvUtME1jR}
z%vTuiIl|f>?e^2vB@pkuk5GuPtNbei4Ormx?uX0cpAJJgJ<J)Nq9MqJ1mCtM9mI?~
zGd_q+TQylTmZF5m%ppom+PGMEgj<2{r}3Wz9Pq|p10#6L7#%5CpT;Z!wo6)C+IP}5
z7J<$e{rYoECS|9rus%9cu80Bl;7Ev@l?y&$WYDa7nY;6&@`zmw=l6)qn*Fr~Ff2xd
z!dVn5DVb)bWMV?p)t6Q2)wTUyORoEym)$%j6Q@E4@_UWwH6qRwj}@4XwQ!<XzoFad
zVC|eFse>p@a;5&7d)7lNA0PT^+IS^Ts&!nzz>-nQXdidQo1I+wVYA1H%aE*q0bbzi
z7xQS8#NZMe-5Y%MXN%d%*3O5*;yH3D)W2pgwe5}ay!zef_hHzVVH;}9BBOAn9bbzl
zYNyrJ_QMpM-$#B5W*cGH8uxQ=C1_IA9Wt$%wD|h<tAaxG#BMJ2!S9Rl@$tI4Is&_<
z_0`vx+dLT$etl@Q@MV|P=V=*;9JfimmW+(dDb(~=*Y{-8_;=lcLWpDM=jY#Vj#BEJ
zN4aLPr{ACmKU|Rq5Kk||1GM)~7vTFOxKHBdZ`)bJ6G9_{dAx21h^62Ew3~lDypiZA
zXytLIg;~3I$%M!==-rMX6?hrS*KrqqehaLo+=j<c$>tf1Fl`DPr=>=}AB;jf@c0Bk
z_cP$LW}!Ou;A2o7d^WV&Jbh+@7#1T5K>Bp|h+YT-v^;OFcCFHS&^xZ&iJAq^fN&IC
zB?3m>Qgci`QNRIzGJ-JBZ5%$;ON|V@UfOE6_!1I>aUeKvNw&nJ&r_zhEBIgL5~C|*
zXMcaghY`dPVxXh7zSOv-X<&=iq9~@25~7eO4E^2udVN1~>$P`%hOn>=0L2Ejj2%<w
ztw^65!5@>^zSEha)FtHL5v>XgTmEjThV$i#BQ7ecq^8p|wPZYYN;w`WAwnvzfsYON
znevr^MsMui?aoLxzj=i|408cPWzOB|le~<m-5t?fD=IEdXVodCo0Y4ocR7X7!SO91
zg^(0ySy_fPp<Z>}vC-Go>1ob$YB*8lf1(0?CefhD@NE#1$V827U+z3I4N&o|ZV9v=
zvYI?gSXi%SbGxGU!*Jzky$^1Koer8tJ|e(mS5=*L`NCy+TnyFEds)UDcX&QROJvZA
zM(fZfCM71eKi~ZAe3-2?GVZ(za)LSufb5xlKkwyw>v?EZ@XXB2fB14=-%w|iY<uQ=
z^zQ){0}Bhcg#y2iL4#p}z<6)#;*wZsNscHOa7A|wk5lRPJeVk%wzS|h>o7mgEyN){
zOXXjBP2+FYEF%?V_RI4n?K&kEkPa7ILtqEUhwhY>qrkwxtMpXYJ$xpd78LyX(#7<p
zE>@cyVt>FiK2ZSpB!S|-<oI|tHOBI+u>|+WKQpOWQmi|{ee!#8w##g+YZ=4K6pS%4
z%2B?1?Rogf)?qmb3-GM`eV0MTym+;Eq55`kOtCn}be)nQeg)BIF*k|h*8VU-Rm#{>
zN!B%rd1U)w`SpRGN^5zo!CLxTgM69|@i7VJyCEzsd8~Jsct&VAMa#>+-)9dsIR=|h
z%tBHm`3DVy$;BALzz)WQgIK;DJ{CfphcKjq^;KOn{5RpM0^5A)#(7R@=h4DGbV?OX
zoll(;R8Mc5gVj{OF~4#~9Ui(pMcG>>Q7WY8HqP-r5A&4Tw<+7#@jA?d7t`~UttaQ-
zzCS>$Pl=HCtSQW?bl$gyYw>7i(C0pG7$b+WM7P!1R$6-aWVw}U?&j#^WX^&$7=z^G
z-~g4O+WGOg5o%ihGQodE7`Lj2a=Bc$_2$(3_4_wyHfUtOD&xVZtk<Vq{K$fw96ySo
z3?7#i&)a3I`Uigu{*X|VcARdN11^zGbIE9sKWOZ8C40wcMAdX47EpBH^gF!>YcQM!
zfszq+cSpze#P6<W!{j=;*8A&2ecE5U3IUrWs3LbYAt;a_0qG<_Hm3y3?`~K@g)WL{
zGF0VZiQq1i5{)0?qO=IxMpy<O5fQ5hybu7u1*B!Gyt+@Z@-VxxeT;qbgeWLo(K!*}
z^$avYoIqH1{u%*XU>pDpP$BbH(cg)~N0GwEAu~`8KfwD2Q>vuc2Pl}x>^{oO($#^M
zo~WbTw{ypaw>Jzf5X?mxiMx3iJIEJZSV$V!@qB^Zs^iET+kgZUUO%<k;r)hqR<h7s
zsG+Me>4gg~5C7Hp_lwuf3Ahva%~$LX0>{Bem8@+`lH4@!DZ{|ky*6I5zPB-rob^}v
zEdolISbpRed30)Fwc)s6Fs07g*lMI)`NWZjZhDLCn#KxJ!FWfU<c|bz;OxqpBo+Ol
zt5)Gjki}A`Xl3g8suVptPvJ$hbS$!|YAh`>6RM|$Szg@C%wNY++4lGM-@bk8-oA3|
zY`;*m9V;=AwPa#u)=*!c@c{Q)Kd;w%+VQxtxmnry@=#PnojYaG_}9_VaTUtUe3|49
zDB{nt{4HMg<M+Lv!CM!gG-kV{CI{N<^yckp0z%w9Yev<MTah;8E>h9j(DG$1&m1dq
zA}$P<&Idhf|7yz5n#;E57!CrD13_KLr##&qtGC*2O`r@ie4bH+`9(w^CGK5dY++RR
zPtna_WGp45i<%y37gc-r?5hue>t?OFI5vHa1v76Hsifbo&>8}O$NS5X{tJCyfg&NA
zA8>&O3wY$hO8K|yuOVdjNM^#tA?o3Iqy2ga`02k?^XKb?&llqdMBrBl;p^Dd&0r;0
z<`(tXOnrvVO&}FAd88VW`2Ctz_T$a|$nR1cdE@v(W?C7g<<l4m<Y_nZC`=CqKT?Bc
z(QR(LUy(H9`kyyQ3=m+f9_dc$-kuvY&*^HjeAaF5jEl;?B)`1uxkTNhie9g)`y-v4
zF`qeF$jnI?Kpzn^#NK&HqO4t5p;2#Gu6Fh~%refZK0CRD6rqsTYN6EJVfTYna<o(G
z2C9gjkIrdh?2L>cFgRbWbiQ1>(QGU=6k8rc7$_<!S*$S)?>BO2)^T%lgPyb3P*tPG
z35QvO9=qS~)>&-FJ*-sCi*`pDk*Da*_@)iZs?+eTowze9&$B=3gTLNI<mW~aTw9_t
z{E7Y@;~d#>mwd1){we+oj4uXqchTk()P4VmrzGwGV_3%m0R8W`JFsnDHfrdNp3;OK
z`U$#I88&Y(sVa*bO0ATy$ZIM_iYkj-Ukbnb_43~mK98Mz&?euB@7B@jN@_;B>sQg-
z!aB%E`V<DQgfA8IE`o4fdD}D-#t=odg;{KKANN9uHU7Z6-T9DbFe_T0rl7COHQ<}W
z&@V6Nsze&~L+4isl0@2zt4r)&J!&qRC<@KSH3Bevn2vby6V)FQv&u`1s*<|*jkht~
z>)A%e9PQ_b?O%TWY)K_JKOANysBF%$v7BCjh&v)8lBF(tSwC@*VW*`YNT&Q*TA@DU
zrNOR+qP}ioOFsseOuU~?zUvoxW5D~~GLN25P4_QsbJ4DBVh|Ed;S|x)^4n{Aj7}Tv
zE*(9v-2#GZXBuu^G(1}~TMFhUH&J}rUhdb363LoaA~1rg$x>L*+<Fv%ic@NIAD0gW
zAV|Ir$3RAa>Zh){cMX7+>YQP(`_Xz_?0!5QoTxbI2HlX&lm|v<X#HU~DLG~yHVS!_
zUU8jc=Rns2*799ABuqmP|NhydcX)P?5iR+V*S(uhjuX2gL~21UQ-;q2(!k6em!TdD
zRfO|t@8#`3W0_Cc$8#`EZm$`veh5>2&2XJpsYoRkNz8bYY=1wWR;pI%RkcOyzihYI
zxw`mQMqC`95Z%^r{e!w5&E50%eytf4v!QD(fe!}h@j}7!X%-ifKUWX(x|+pnmn=x%
z>k!1WW>qA%Gsd^d$a?dj_qXy0YB^24xEL(@MrV%H)RMiXFG|vBY1T!O#n)eIyUq^o
zQx?nWCRYA_(67iN?~lTk2iBem0r;q<5w&+Lo|!ry@25yId%LD$UKU<#T(PdjuaiP3
z>m=o6%gWfhIl2&Z$T~3fApGp@JZju;0n+fouRC&4r7e0gwSU>&eJsxxjgrEx(KWX&
zX*3DJc-ttczutkPi49PblKyIa0?wBE9>bLi7yq)%ru0k47LWI!vs??uQwV9zs(%WL
z|I94C7U);RyJ~nkZl6v#V#oK{_?yNNoZNJN?9N=t#dgX3ydA1$ZS(RFA(2MCRbufh
z3cR6JStTKlos}hg)XdgSGJ_OEH+4Mnq0#FCg)G^=>A}j&LbCSaa4`~ISDs>iPIrsv
zK>+<6g6;pM;_t(Pov}!JMbjS*eF;g*q)h*(A2J3SV`1sR^E%266x)Zb^~Kc(S77nc
zPtM%J8+camfVNAyyXDJ7t)0Miz#8}Rj(a?9ag)t<Gapvj2~=W=%JzzHIBmzz?*lJ5
zOLB6AOY#6x+Q@MzbVL!c+A?h!)32N;FVZ@J3e<28FPKNkgB7u2Xo^)c9~D@c%JtId
zqii_sLS?bf1&57jvXKWq+#xlYGS}P3JbLZ;zra+S*?eD-$4Wmwdup8+nR!?Lp`JAH
zS8@nKl7UW}m5^b!K$TKLxfT?MV4_U1GLF1PIMja*9_&HIrj2HulzvZ>ABL@lOt1eg
zQ8oR?$ahUABL?_+rI47kRBJjU^i=$k{Xl7hrs)XY6$y=Kr(_0c)5jq8C07Ct#+;${
zu1$+^{lM)%CDW7fCv-NWwDo)BjYt_OTd5!(X|kUV0D!3_B`Tz1>{0&IDq>UX54HUm
z=jLNk-;?1aGjNY&SB4+W&IueHJz|5!(aO5qIQ=MeZ0!JQZOxt2>)Kps4%on5A6#J0
z+fn+j=AZPSPBlAQPP-`CpO?uAGUQScttddww8h;9Q!!^mx~tys{av@2SxOECo+}_Y
z4HZUYU=9Mmt8ypdrU)-3EqRIzi6&URH!Mrj#Z*7w9|+Ga*2b;4#rP5d1<|KemvJoV
zJtYpF%`Nhv_j$FjhNC5XRXjsmX6yRW(%=JXE)>Bk<1*UfU#o*Ls8gPruVZdaIc^B?
z46ipN-fC!%QYl5Ol&dZVcfO@3DIx7B+AGh8mp2$Fm|{Ug!z^E28#^_c^XNUr_NU{q
zry{P|aLJyoZhE<AznM*{|KLWRGSWR?7_`WK59<&5Y5CxPX=)aL0POdihZ;roI#(;f
z1JJAMx1R|ZX9?-dTdDpMpWYTsr%z^-t3_WsT*_g}SXjOpdVu#MZG$7+#1cgn&LgEk
zIim+rd{*)^hxdgGgH1(*x-(drrpGP_x2UX-J`IGh#sUG7@*s*kiTf_(ES}0yf#Jfh
z{ah&dKn#(pl`SKpapg|YC+NXDYnw<p*}Z^1N_`t!;`vm2^#{&BLW8D+*T9jmAvmAz
z2+3x{m5DOf)o;T?*lSCAu75YoQB_K86r>!7Y4rE6rR&XR<1a={DWiwtAr~gT>o_n4
z+I7JJ)x2)5HVx19=fGm$m^?V4ebj0h7tL-`(LHMu>&CEmXGh~>)mDMUi$&7>Gn<no
z49X^0_q|I<CmJt;o|T%!5`0!oOtfO~K!+heRfo+H2o2Cwq<r^wgR!QP;cT;XaCg7c
z^R6-PN4BZxX7=oCuNUNzY!x6`I%wD_ax(vm21`dBCmL@A@%9?JvkAVZd=XMh)ItQJ
zh##%XD>(z*m88QG$(<vN2md_n^>~<eON;Tdj80;b1JtsdGac-;AuB7n%8?l4v+5Wy
zLi-mYvSE`v9(caVbmxl&;U0rsg(LsmRiZ4()dM9%Sza!?*SUW!x$0{-#iR(2c?L4C
zpLW$>^c${ZJ`9)e$RX_BtuPc#S-)zZ-l%;+=DmAZ@C(c@99*GrGG=4zon;f5ZNM2J
z>8y@-yhJFJJLRF1G3NuGcI+YH$$eTa1eW<5zH#=IBdrejB<t2WjU?0a&B%)10=pl!
zp6B<}f_@Z7?x3H8<2lCeS`hd#s_${3{*!Py`={ldb@<L`mq;sBF+Xc)rV3x|#SQY4
zzH_N?W&%QIrJvLjsOLQMTy8IyooyPoF5Ftfgf7YDpJ4!wBRZ*ZG~%~}#BhL|(2(d*
z%IuB$PJd=E?RwI~xoK8kH97Fb$(71;l&0jcae;@vOr2U90+CL)f|ISs;TFG06R?Y<
zj^a>D!+5fn`!y3W%TB9gWmjI0;q)W*06r5JqKHLaLSe~udQ+OCG_2&<%%uP8ZFGm)
zLy4U*794Nx*xPFA<PK+*<Y343Db6>-tk!r|hf>Y3K!jX*o(>GWPzYtv;={%0@5uR#
zrR}dXX_YgfXbmUJ(ErZ5Y64V-Gxp|7RA2`$85%1judAG|<#-wa;PfW3uo79XpP1zL
zJ1`s|a4?0FA&cf%o4YtaboE{IJj@`pzBLLx8SrVY56hOi-bl39d%n8jSDZEc+i;s{
zU2td;y3s@7#CR`?S;v|5v44|g8%7X|4%P=8_hcSFUg!5R#6F+aFTJQ_UqMukLnpSO
zp}6gpW|FB<_KvU9bx^v0%kX1?R(SDv%|X~~1N!$_i(G2)BThvH8Vi70e%KuG$!)q!
zzvvVOkTE9$erQ{l2dC%U$0kK-G0T!O>S($X^BisR9f_!WoyPU)#dPfKK?@2VsO*Cu
zZ}^)}aC{y1FCbZ}<x}%W{vh3#h-;?+9dw{z&P?uPxJFDS;w_uALRME5AUNDN5CrWK
zk<i@Ao&sEhbW!PX7iP&n$TF)%Ar*#u)2;-{=xzQXCDDv&W<=(39oI9D^zwPZ&Z&m2
zgwkpS;@a}uEz-YF33R=wDGP?k6L`~(ys0icoggM0u&m(Vz;ycd&bIEoNqFA$J(gl!
z2$AsuQw6nRe{-{ksi8s0CutRMAGjO0ozGJ&&`7MVxqFfH1T+zU?p47_lXdw80dpZx
zkqgL9^{y$j=9#N0w@UUb@;`P-Hr-*N(!tPoq&hX0#wq`?f@|e|rHb^1E%+))i=3Ir
zRb2bW(+Cg53U1OA1!@JmKS(3dVC?c4w`@!jEXoDuw-N!F_r0fVfwbM5S$jmVUByIw
zweHQE*SK<(Vb~@|UjSgQXwrDkJI-s+lV&yR&f2s!pOf#36aSH{)x1;U9VHe`KXCTM
zGZCCGb?8|SOC`Az3M2TAZhZhxcnxhMoD*`&cLWK6&`PT?iM%<)`4bBe(G(a{%%Oib
zb*ZPPTw2@*^-D{=M@au%G}_K_-rC?lo3Gg)I7JpzEoWr)Ex}x2H{8a;0tpZ%=U^vd
zY`6iDGo3x<u2N6aV=ys^>pRAPXy6CRNA#KZCuh9t4piPRrcY{vNLl&F$9%&*BnI#{
z^!cF|@Q=z8jm5R*mz}p(HA=p_*HQRN1#9hgx{4hic^rEacdLZQ>}^Tx@7Ky}61KZn
z$N+erkf$F=$Q$k7Ngyd%9&^%u^q&&*N5-vZ3?9iIFG*~y(d`qV4z4f&h*j!~bO5@d
z-DH@hH5%8T6CV1^(mSev<^>Bhu$MlBbG<3h8j-p7E<R@;it9y?2Y~VZcMygv5{FWp
ztzul<nqJ>f9K^wfKknLP%i|Y>v(H?wPW+$d)zxAzkVR~3*&#Bu<U{~_r~dun>vsk9
z1pNjIt+Y-ZyyJNs*^>dj=f&Ni0?Z8ez?GGf5t-?oPt#@-ljVP=w*QHJ!<+iIi*2>H
zU(L#r2_fO+mbuHWuZxc`KJU$>nG0I%TxUaOR+QfYN7TxA8ID%8+S~_a5?ZoOi5p@}
z1v^&UYC<7<ae4H<;IPeU864Bn-9T3hN5r5Yc4Lv&>gxC~eH}x_vKFJa0)I+}v>yJH
zTTc`d2QYx&2nURZ|14qNO2TECX*h84dc03lNof0=pb}TtcBK>a4WHmIa_G@K<TX^Q
zDj~a{ptG1xK@*xF?$s92=b{cFwJfC`00}Dx2!)st8ehhu`b)Jks}^RqiO)wE*;!W+
zA9}3Z_;!8Cv$<#$wEGPQ40>HR%1qUv4g7Z6;viAM%P3DhdIL}^=qqJ5t03R8j&uyn
z>SMP25<STLCl@$I9~j>Vf157w=D<sHXVpY|J3A&ABRK6Ie}8^j>A6vH$lx?1%*a(b
zqW(@6x(!W*iqxi7H!H_G6)am93hVQs253O@VUo%T@4;e$Nt%DTn9$;8>V*h}bU076
z)qlTi-3c|shaE)DR0Ld~kXC=2$eP=lvVtE<4BI!G<k?7&wUVRJnzB=np^B*(WJLvl
zY8ZhZ!y})Jt#|GDpJeSB%e3n80UuJ=Xgb%uYHfRZ1ziuARFg(H029Y%`ksNSyt0fO
zydEHGX0y-iL`dE@9XW439FLp+EG+X$G8ZMb=d+8b{&Kl8#CxM*a=9DTk&jF_r;!zg
zsF+SKXGA^SJPosj0&1(<e4QOwUL%<*cJv_)^g#paG^ZAyipQ-uGpfs7W>&9L+eYKX
zU^sw;!hUPVnU7gZi&CJUhcpwMyHvsR0+$inXNIIw!t{tjpeHX~DHPz0p9E-o-6Y9U
zwiP$$0q_n|ht4c!x;G03#BIGQ)^6q7X0hAsY+n`zC-L!vuT*sdBrC=;Fv=uanfn?K
z;XTU<I2$V%U(!><CS^r%ul2TgYN9~a#84-vV{Rh{b{sMQXcg#I@IJ$fY*yF1*iR>d
zVSLs|D8c8zSs%u{MUq@*`14`L>l9c%bFN^h1K?|`WuBYO*u^=R=X*@5F4vB4#`Bpp
zp~q@tu=Q#HouPFo+IpSj#lIcjbpIY-y^Ns)xCX_Do-VZQc$`E{Zu>IqwL<w@D)RII
z<*ylzh;n6hh0IxGy4GFa^1S{iJDxT=!CwVnlTC#KvqlmWdJTTygV;@)1gtzfjY3^F
zvcb7^bQ^We<_BA3tVqy_j0CJGmC|KQGk}!OM+FEM(<$Ro*+w=PRG!UEZ4TMkiGQ0w
z5C*93bQXJ#!kw)HcJQIHn&SF!jSh_|_QuhOX6MmSZ`z7$*ps=6Dv&!RK^TA<re79&
zWZUb-wPVivZpRHVIRhr=ea8hHVo!g~1>BY6Lj}zaw?QBb)be95{U=lj8p!&TTJQoa
za9B7cG8d}};5AhFJJeE~#S+*#`ar}1lW(Bf2NJfBPa_kO)ZY@%=91T6_`v872!<rI
z80n}Xl6~8UPNp)il9%3<N4;FjiHr_RgW^C4_;h8=IDre?{aM~1!$P@9@m76YbdQ;|
ziiO<&Y>N6pTH(1vO+5(#aCh8{e|6+4GmHeKDi)PhL%*tm>*-4PjqnxQG|!V@4C$F)
zr>*L}Is;2V<q?t+Ds*h8!1zX0VPxG3Mr2H3<S|PY3S{%XOHI~8sCxnQl?^}vxWPB;
zAmN!F#pD(Q;Lit9WU_C?pZ8b(b*}5|PUaR%;0uCMQsV_6lLhRsdPqQLxi<~EtNi2e
zxY0xUuYKql%SQ25gay3tKVkzAc>pMN2Kwp3$UkLF%w$)4|F_i|k8l8#Hts*Ktc8aE
zZAV1*uN^$q?+^dT0^VZ=+*!OM3z$p~`rifZmB@vT%z*i#!~p>RnT9U&T@;8c0MxSe
z@72N?8-5)MuQk0q9ByuG^cguQDNSd%tSn4UetA)stK88H1_h*4@6kYqvDEDJdTy}&
zOa9@56SuCKTGGt^QmYGOq{jQ@GV8QyGwQP0%AHMtDCJ8vT!;Y9h9Ny7^y|iq5dDP;
zXSTPuj~8mG7#J8dpulVA{g^#EI(kE6BLw=Vm;1kg9EJO`%n^2F_s|qWqQ#+KhV!?@
zi4JHx>p{cTL;z?L51_HOCYm?>xcccgsxzf-?Elv9r)F7sx!lM2#Kc57+RmFrYnbfj
zX1B$E9WFpOJhA|@YN%fZ8Z{S}{?yC+C-U(4IOD(6Zcv`EhTlJXrN}zFyJ=|P0npe<
zOMSNX)Cs9y9L~5TH~(3m4<VmFkcogZ5C4rh2eqZ3RR3B2$s?SvI7^y^19ICX`?I`<
z|5!Ik|1o}OU|>KV;?k@GWPheE@SMG}%8dNaQsc--N^&}Ezz;ga4@Z*-paY?yp)(!O
zC7TfcCm*cgU>uwp`hOwCvb3v>_9TFbsj1xKzrN{EpiDF?R}gr92Pi2iadUHjM8zQH
z{gIF$3hH}#e)OkYeLis+86F<rFQJ+9cn<}sk$)~6LjyV}0a0=B6{v@jfWxlsq~*{L
zat4iJW_FMl7az#WoPYvm!(7QQI^PJO{kOM&zqMQKST?JD`{s?Pm{{@b0W>hW92y0`
z5imMB+R)G-C2%(3KKpJW<@moE!Ks1x{|ejxEe=!||J&rhq7OZ$LBfvs|0Lok*V})b
g`9B%`|4;Tx(u#0&GH>B22S6VwF?rDnVFSPa0lk)@2><{9

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-stabilized/python/demo_stokes-stabilized.py b/demo/documented/stokes-stabilized/python/demo_stokes-stabilized.py
new file mode 100644
index 0000000..ace0d2e
--- /dev/null
+++ b/demo/documented/stokes-stabilized/python/demo_stokes-stabilized.py
@@ -0,0 +1,85 @@
+# This demo solves the Stokes equations, using stabilized
+# first order elements for the velocity and pressure. The
+# sub domains for the different boundary conditions used
+# in this simulation are computed by the demo program in
+# src/demo/mesh/subdomains.
+#
+# Original implementation: ../cpp/main.cpp by Anders Logg
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2009.
+#
+# First added:  2007-11-15
+# Last changed: 2009-11-26
+# Begin demo
+
+from dolfin import *
+
+# Load mesh and subdomains
+mesh = Mesh("../dolfin_fine.xml.gz")
+sub_domains = MeshFunction("size_t", mesh, "../dolfin_fine_subdomains.xml.gz");
+
+# Define function spaces
+scalar = FunctionSpace(mesh, "CG", 1)
+vector = VectorFunctionSpace(mesh, "CG", 1)
+system = vector * scalar
+
+# Create functions for boundary conditions
+noslip = Constant((0, 0))
+inflow = Expression(("-sin(x[1]*pi)", "0"))
+zero   = Constant(0)
+
+# No-slip boundary condition for velocity
+bc0 = DirichletBC(system.sub(0), noslip, sub_domains, 0)
+
+# Inflow boundary condition for velocity
+bc1 = DirichletBC(system.sub(0), inflow, sub_domains, 1)
+
+# Boundary condition for pressure at outflow
+bc2 = DirichletBC(system.sub(1), zero, sub_domains, 2)
+
+# Collect boundary conditions
+bcs = [bc0, bc1, bc2]
+
+# Define variational problem
+(v, q) = TestFunctions(system)
+(u, p) = TrialFunctions(system)
+f = Constant((0, 0))
+h = CellSize(mesh)
+beta  = 0.2
+delta = beta*h*h
+a = (inner(grad(v), grad(u)) - div(v)*p + q*div(u) + \
+    delta*inner(grad(q), grad(p)))*dx
+L = inner(v + delta*grad(q), f)*dx
+
+# Compute solution
+w = Function(system)
+solve(a == L, w, bcs)
+u, p = w.split()
+
+# Save solution in VTK format
+ufile_pvd = File("velocity.pvd")
+ufile_pvd << u
+pfile_pvd = File("pressure.pvd")
+pfile_pvd << p
+
+# Plot solution
+plot(u)
+plot(p)
+interactive()
diff --git a/demo/documented/stokes-stabilized/python/documentation.rst b/demo/documented/stokes-stabilized/python/documentation.rst
new file mode 100644
index 0000000..6a2efae
--- /dev/null
+++ b/demo/documented/stokes-stabilized/python/documentation.rst
@@ -0,0 +1,136 @@
+.. Documentation for the stokes stabilized demo from DOLFIN.
+
+.. _demo_pde_stokes-stabilized_python_documentation:
+
+Stokes equations with stabilized first order elements
+=====================================================
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+	from dolfin import *
+
+In this example, different boundary conditions are prescribed on
+different parts of the boundaries. This information must be made
+available to the solver. One way of doing this, is to tag the
+different sub-regions with different (integer) labels. DOLFIN provides
+a class :py:class:`MeshFunction <dolfin.cpp.mesh.MeshFunction>` which
+is useful for these types of operations: instances of this class
+represent functions over mesh entities (such as over cells or over
+facets). Mesh and mesh functions can be read from file in the
+following way:
+
+.. code-block:: python
+
+	# Load mesh and subdomains
+	mesh = Mesh("dolfin_fine.xml.gz")
+	sub_domains = MeshFunction("size_t", mesh, "dolfin_fine_subdomains.xml.gz")
+
+Next, we define a :py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` composed of a
+:py:class:`VectorFunctionSpace
+<dolfin.functions.functionspace.VectorFunctionSpace>` and a
+:py:class:`FunctionSpace <dolfin.cpp.function.FunctionSpace>`, both of
+continuous piecewise linears.
+
+.. code-block:: python
+
+	# Define function spaces
+	scalar = FunctionSpace(mesh, "CG", 1)
+	vector = VectorFunctionSpace(mesh, "CG", 1)
+	system = vector * scalar
+
+Now that we have our mixed function space and marked subdomains
+defining the boundaries, we create functions for the boundary
+conditions and define boundary conditions:
+
+.. code-block:: python
+
+	# Create functions for boundary conditions
+	noslip = Constant((0, 0))
+	inflow = Expression(("-sin(x[1]*pi)", "0"))
+	zero   = Constant(0)
+
+	# No-slip boundary condition for velocity
+	bc0 = DirichletBC(system.sub(0), noslip, sub_domains, 0)
+
+	# Inflow boundary condition for velocity
+	bc1 = DirichletBC(system.sub(0), inflow, sub_domains, 1)
+
+	# Boundary condition for pressure at outflow
+	bc2 = DirichletBC(system.sub(1), zero, sub_domains, 2)
+
+	# Collect boundary conditions
+	bcs = [bc0, bc1, bc2]
+
+Here, we have given four arguments to :py:class:`DirichletBC
+<dolfin.cpp.fem.DirichletBC>`. The first specifies the
+:py:class:`FunctionSpace <dolfin.cpp.function.FunctionSpace>`. Since
+we have a :py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>`, we write
+system.sub(0) for the :py:class:`VectorFunctionSpace
+<dolfin.functions.functionspace.VectorFunctionSpace>`, and
+system.sub(1) for the :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>`. The second argument specifies
+the value on the Dirichlet boundary. The two last arguments specify the
+marking of the subdomains; sub_domains contains the subdomain markers
+and the number given as the last argument is the subdomain index.
+
+The bilinear and linear forms corresponding to the stabilized weak
+mixed formulation of the Stokes equations are defined as follows:
+
+.. code-block:: python
+
+	# Define variational problem
+	(v, q) = TestFunctions(system)
+	(u, p) = TrialFunctions(system)
+	f = Constant((0, 0))
+	h = CellSize(mesh)
+	beta  = 0.2
+	delta = beta*h*h
+	a = (inner(grad(v), grad(u)) - div(v)*p + q*div(u) + \
+	    delta*inner(grad(q), grad(p)))*dx
+	L = inner(v + delta*grad(q), f)*dx
+
+To compute the solution we use the bilinear and linear forms, and the
+boundary condition, but we also need to create a :py:class:`Function
+<dolfin.cpp.function.Function>` to store the solution(s). The (full)
+solution will be stored in ``w``, which we initialize using the
+MixedFunctionSpace system. The actual computation is performed by
+calling solve with the arguments ``a``, ``L`` and ``bcs``. The
+separate components ``u`` and ``p`` of the solution can be extracted
+by calling the :py:meth:`split
+<dolfin.functions.function.Function.split>` function.
+
+.. code-block:: python
+
+	# Compute solution
+	w = Function(system)
+	solve(a == L, w, bcs)
+	u, p = w.split()
+
+Finally, we can store to file and plot the solutions.
+
+.. code-block:: python
+
+	# Save solution in VTK format
+	ufile_pvd = File("velocity.pvd")
+	ufile_pvd << u
+	pfile_pvd = File("pressure.pvd")
+	pfile_pvd << p
+
+	# Plot solution
+	plot(u)
+	plot(p)
+	interactive()
+
+Complete code
+-------------
+
+.. literalinclude:: demo_stokes-stabilized.py
+	:start-after: # Begin demo
diff --git a/demo/documented/stokes-taylor-hood/common.txt b/demo/documented/stokes-taylor-hood/common.txt
new file mode 100644
index 0000000..231771a
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/common.txt
@@ -0,0 +1,79 @@
+This demo illustrates how to:
+
+* Read mesh and subdomains from file
+* Use mixed function spaces
+
+The mesh and subdomains look as follows:
+
+.. image:: ../plot_mesh.png
+
+.. image:: ../plot_mesh_boundaries.png
+
+and the solution of u and p, respectively:
+
+.. image:: ../plot_u.png
+
+.. image:: ../plot_p.png
+
+Equation and problem definition
+-------------------------------
+
+Strong formulation
+^^^^^^^^^^^^^^^^^^
+
+.. math::
+	- \nabla \cdot (\nabla u + p I) &= f \quad {\rm in} \ \Omega, \\
+                	\nabla \cdot u &= 0 \quad {\rm in} \ \Omega. \\
+
+
+.. note::
+        The sign of the pressure has been flipped from the classical
+   	definition. This is done in order to have a symmetric (but not
+	positive-definite) system of equations rather than a
+	non-symmetric (but positive-definite) system of equations.
+
+A typical set of boundary conditions on the boundary :math:`\partial
+\Omega = \Gamma_{D} \cup \Gamma_{N}` can be:
+
+.. math::
+	u &= u_0 \quad {\rm on} \ \Gamma_{D}, \\
+	\nabla u \cdot n + p n &= g \,   \quad\;\; {\rm on} \ \Gamma_{N}. \\
+
+
+Weak formulation
+^^^^^^^^^^^^^^^^
+
+The Stokes equations can easily be formulated in a mixed variational
+form; that is, a form where the two variables, the velocity and the
+pressure, are approximated simultaneously. Using the abstract
+framework, we have the problem: find :math:`(u, p) \in W` such that
+
+.. math::
+	a((u, p), (v, q)) = L((v, q))
+
+for all :math:`(v, q) \in W`, where
+
+.. math::
+
+	a((u, p), (v, q))
+				&= \int_{\Omega} \nabla u \cdot \nabla v
+                 - \nabla \cdot v \ p
+                 + \nabla \cdot u \ q \, {\rm d} x, \\
+	L((v, q))
+				&= \int_{\Omega} f \cdot v \, {\rm d} x
+    			+ \int_{\partial \Omega_N} g \cdot v \, {\rm d} s. \\
+
+The space :math:`W` should be a mixed (product) function space
+:math:`W = V \times Q`, such that :math:`u \in V` and :math:`q \in Q`.
+
+Domain and boundary conditions
+^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+
+In this demo, we shall consider the following definitions of the input functions, the domain, and the boundaries:
+
+* :math:`\Omega = [0,1]\times[0,1] \backslash {\rm dolphin}` (a unit cube)
+* :math:`\Gamma_D =`
+* :math:`\Gamma_N =`
+* :math:`u_0 = (- \sin(\pi x_1), 0.0)` for :math:`x_0 = 1` and :math:`u_0 = (0.0, 0.0)` otherwise
+* :math:`f = (0.0, 0.0)`
+* :math:`g = (0.0, 0.0)`
diff --git a/demo/documented/stokes-taylor-hood/cpp/CMakeLists.txt b/demo/documented/stokes-taylor-hood/cpp/CMakeLists.txt
new file mode 100644
index 0000000..08a1c6b
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_stokes-taylor-hood)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/stokes-taylor-hood/cpp/Stokes.h b/demo/documented/stokes-taylor-hood/cpp/Stokes.h
new file mode 100644
index 0000000..7ebd9c3
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/cpp/Stokes.h
@@ -0,0 +1,11114 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __STOKES_H
+#define __STOKES_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class stokes_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stokes_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[12];
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 13:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 14:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[12] = vals[2];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[13] = vals[2];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[4] = dof_values[7];
+    vertex_values[7] = dof_values[8];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[12];
+    vertex_values[5] = dof_values[13];
+    vertex_values[8] = dof_values[14];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stokes_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stokes_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stokes_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 8;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[12] = offset + c.entity_indices[0][0];
+    dofs[13] = offset + c.entity_indices[0][1];
+    dofs[14] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+      dofs[6] = 13;
+      dofs[7] = 14;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+      dofs[6] = 12;
+      dofs[7] = 14;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+      dofs[6] = 12;
+      dofs[7] = 13;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+        dofs[2] = 12;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+        dofs[2] = 13;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+        dofs[2] = 14;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[12][0] = vertex_coordinates[0];
+    dof_coordinates[12][1] = vertex_coordinates[1];
+    dof_coordinates[13][0] = vertex_coordinates[2];
+    dof_coordinates[13][1] = vertex_coordinates[3];
+    dof_coordinates[14][0] = vertex_coordinates[4];
+    dof_coordinates[14][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stokes_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stokes_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stokes_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    32
+    // Number of operations (multiply-add pairs) for tensor contraction: 282
+    // Total number of operations (multiply-add pairs):                  317
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*K[0]*(1.0);
+    const double G0_1 = det*K[2]*(1.0);
+    const double G1_0 = det*K[1]*(1.0);
+    const double G1_1 = det*K[3]*(1.0);
+    const double G2_0 = det*K[0]*(1.0);
+    const double G2_1 = det*K[2]*(1.0);
+    const double G3_0 = det*K[1]*(1.0);
+    const double G3_1 = det*K[3]*(1.0);
+    const double G4_0_0 = det*K[0]*K[0]*(1.0);
+    const double G4_0_1 = det*K[0]*K[2]*(1.0);
+    const double G4_1_0 = det*K[2]*K[0]*(1.0);
+    const double G4_1_1 = det*K[2]*K[2]*(1.0);
+    const double G5_0_0 = det*K[0]*K[0]*(1.0);
+    const double G5_0_1 = det*K[0]*K[2]*(1.0);
+    const double G5_1_0 = det*K[2]*K[0]*(1.0);
+    const double G5_1_1 = det*K[2]*K[2]*(1.0);
+    const double G6_0_0 = det*K[1]*K[1]*(1.0);
+    const double G6_0_1 = det*K[1]*K[3]*(1.0);
+    const double G6_1_0 = det*K[3]*K[1]*(1.0);
+    const double G6_1_1 = det*K[3]*K[3]*(1.0);
+    const double G7_0_0 = det*K[1]*K[1]*(1.0);
+    const double G7_0_1 = det*K[1]*K[3]*(1.0);
+    const double G7_1_0 = det*K[3]*K[1]*(1.0);
+    const double G7_1_1 = det*K[3]*K[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.5*G4_0_0 + 0.5*G4_0_1 + 0.5*G4_1_0 + 0.5*G4_1_1 + 0.5*G6_0_0 + 0.5*G6_0_1 + 0.5*G6_1_0 + 0.5*G6_1_1;
+    A[1] = 0.166666666666667*G4_0_0 + 0.166666666666667*G4_1_0 + 0.166666666666667*G6_0_0 + 0.166666666666667*G6_1_0;
+    A[2] = 0.166666666666666*G4_0_1 + 0.166666666666666*G4_1_1 + 0.166666666666666*G6_0_1 + 0.166666666666666*G6_1_1;
+    A[3] = 0.0;
+    A[4] = -0.666666666666666*G4_0_1 - 0.666666666666666*G4_1_1 - 0.666666666666666*G6_0_1 - 0.666666666666666*G6_1_1;
+    A[5] = -0.666666666666666*G4_0_0 - 0.666666666666666*G4_1_0 - 0.666666666666666*G6_0_0 - 0.666666666666666*G6_1_0;
+    A[6] = 0.0;
+    A[7] = 0.0;
+    A[8] = 0.0;
+    A[9] = 0.0;
+    A[10] = 0.0;
+    A[11] = 0.0;
+    A[12] = 0.166666666666666*G2_0 + 0.166666666666666*G2_1;
+    A[13] = 0.0;
+    A[14] = 0.0;
+    A[15] = 0.166666666666667*G4_0_0 + 0.166666666666667*G4_0_1 + 0.166666666666667*G6_0_0 + 0.166666666666667*G6_0_1;
+    A[16] = 0.5*G4_0_0 + 0.5*G6_0_0;
+    A[17] = -0.166666666666666*G4_0_1 - 0.166666666666666*G6_0_1;
+    A[18] = 0.666666666666666*G4_0_1 + 0.666666666666666*G6_0_1;
+    A[19] = 0.0;
+    A[20] = -0.666666666666666*G4_0_0 - 0.666666666666666*G4_0_1 - 0.666666666666666*G6_0_0 - 0.666666666666666*G6_0_1;
+    A[21] = 0.0;
+    A[22] = 0.0;
+    A[23] = 0.0;
+    A[24] = 0.0;
+    A[25] = 0.0;
+    A[26] = 0.0;
+    A[27] = 0.0;
+    A[28] = -0.166666666666667*G2_0;
+    A[29] = 0.0;
+    A[30] = 0.166666666666666*G4_1_0 + 0.166666666666666*G4_1_1 + 0.166666666666666*G6_1_0 + 0.166666666666666*G6_1_1;
+    A[31] = -0.166666666666666*G4_1_0 - 0.166666666666666*G6_1_0;
+    A[32] = 0.5*G4_1_1 + 0.5*G6_1_1;
+    A[33] = 0.666666666666666*G4_1_0 + 0.666666666666666*G6_1_0;
+    A[34] = -0.666666666666666*G4_1_0 - 0.666666666666666*G4_1_1 - 0.666666666666666*G6_1_0 - 0.666666666666666*G6_1_1;
+    A[35] = 0.0;
+    A[36] = 0.0;
+    A[37] = 0.0;
+    A[38] = 0.0;
+    A[39] = 0.0;
+    A[40] = 0.0;
+    A[41] = 0.0;
+    A[42] = 0.0;
+    A[43] = 0.0;
+    A[44] = -0.166666666666666*G2_1;
+    A[45] = 0.0;
+    A[46] = 0.666666666666666*G4_1_0 + 0.666666666666666*G6_1_0;
+    A[47] = 0.666666666666666*G4_0_1 + 0.666666666666666*G6_0_1;
+    A[48] = 1.33333333333333*G4_0_0 + 0.666666666666665*G4_0_1 + 0.666666666666665*G4_1_0 + 1.33333333333333*G4_1_1 + 1.33333333333333*G6_0_0 + 0.666666666666665*G6_0_1 + 0.666666666666665*G6_1_0 + 1.33333333333333*G6_1_1;
+    A[49] = -1.33333333333333*G4_0_0 - 0.666666666666666*G4_0_1 - 0.666666666666665*G4_1_0 - 1.33333333333333*G6_0_0 - 0.666666666666666*G6_0_1 - 0.666666666666665*G6_1_0;
+    A[50] = -0.666666666666666*G4_0_1 - 0.666666666666666*G4_1_0 - 1.33333333333333*G4_1_1 - 0.666666666666666*G6_0_1 - 0.666666666666666*G6_1_0 - 1.33333333333333*G6_1_1;
+    A[51] = 0.0;
+    A[52] = 0.0;
+    A[53] = 0.0;
+    A[54] = 0.0;
+    A[55] = 0.0;
+    A[56] = 0.0;
+    A[57] = -0.166666666666667*G2_0 - 0.166666666666667*G2_1;
+    A[58] = -0.166666666666667*G2_0 - 0.333333333333333*G2_1;
+    A[59] = -0.333333333333333*G2_0 - 0.166666666666667*G2_1;
+    A[60] = -0.666666666666666*G4_1_0 - 0.666666666666666*G4_1_1 - 0.666666666666666*G6_1_0 - 0.666666666666666*G6_1_1;
+    A[61] = 0.0;
+    A[62] = -0.666666666666666*G4_0_1 - 0.666666666666666*G4_1_1 - 0.666666666666666*G6_0_1 - 0.666666666666666*G6_1_1;
+    A[63] = -1.33333333333333*G4_0_0 - 0.666666666666665*G4_0_1 - 0.666666666666666*G4_1_0 - 1.33333333333333*G6_0_0 - 0.666666666666665*G6_0_1 - 0.666666666666666*G6_1_0;
+    A[64] = 1.33333333333333*G4_0_0 + 0.666666666666666*G4_0_1 + 0.666666666666666*G4_1_0 + 1.33333333333333*G4_1_1 + 1.33333333333333*G6_0_0 + 0.666666666666666*G6_0_1 + 0.666666666666666*G6_1_0 + 1.33333333333333*G6_1_1;
+    A[65] = 0.666666666666666*G4_0_1 + 0.666666666666666*G4_1_0 + 0.666666666666666*G6_0_1 + 0.666666666666666*G6_1_0;
+    A[66] = 0.0;
+    A[67] = 0.0;
+    A[68] = 0.0;
+    A[69] = 0.0;
+    A[70] = 0.0;
+    A[71] = 0.0;
+    A[72] = 0.166666666666667*G2_0 - 0.166666666666666*G2_1;
+    A[73] = 0.166666666666667*G2_0;
+    A[74] = 0.333333333333333*G2_0 + 0.166666666666666*G2_1;
+    A[75] = -0.666666666666666*G4_0_0 - 0.666666666666666*G4_0_1 - 0.666666666666666*G6_0_0 - 0.666666666666666*G6_0_1;
+    A[76] = -0.666666666666666*G4_0_0 - 0.666666666666666*G4_1_0 - 0.666666666666666*G6_0_0 - 0.666666666666666*G6_1_0;
+    A[77] = 0.0;
+    A[78] = -0.666666666666666*G4_0_1 - 0.666666666666666*G4_1_0 - 1.33333333333333*G4_1_1 - 0.666666666666666*G6_0_1 - 0.666666666666666*G6_1_0 - 1.33333333333333*G6_1_1;
+    A[79] = 0.666666666666666*G4_0_1 + 0.666666666666666*G4_1_0 + 0.666666666666666*G6_0_1 + 0.666666666666666*G6_1_0;
+    A[80] = 1.33333333333333*G4_0_0 + 0.666666666666667*G4_0_1 + 0.666666666666667*G4_1_0 + 1.33333333333333*G4_1_1 + 1.33333333333333*G6_0_0 + 0.666666666666667*G6_0_1 + 0.666666666666667*G6_1_0 + 1.33333333333333*G6_1_1;
+    A[81] = 0.0;
+    A[82] = 0.0;
+    A[83] = 0.0;
+    A[84] = 0.0;
+    A[85] = 0.0;
+    A[86] = 0.0;
+    A[87] = -0.166666666666666*G2_0 + 0.166666666666667*G2_1;
+    A[88] = 0.166666666666667*G2_0 + 0.333333333333333*G2_1;
+    A[89] = 0.166666666666667*G2_1;
+    A[90] = 0.0;
+    A[91] = 0.0;
+    A[92] = 0.0;
+    A[93] = 0.0;
+    A[94] = 0.0;
+    A[95] = 0.0;
+    A[96] = 0.5*G5_0_0 + 0.5*G5_0_1 + 0.5*G5_1_0 + 0.5*G5_1_1 + 0.5*G7_0_0 + 0.5*G7_0_1 + 0.5*G7_1_0 + 0.5*G7_1_1;
+    A[97] = 0.166666666666667*G5_0_0 + 0.166666666666667*G5_1_0 + 0.166666666666667*G7_0_0 + 0.166666666666667*G7_1_0;
+    A[98] = 0.166666666666666*G5_0_1 + 0.166666666666666*G5_1_1 + 0.166666666666666*G7_0_1 + 0.166666666666666*G7_1_1;
+    A[99] = 0.0;
+    A[100] = -0.666666666666666*G5_0_1 - 0.666666666666666*G5_1_1 - 0.666666666666666*G7_0_1 - 0.666666666666666*G7_1_1;
+    A[101] = -0.666666666666666*G5_0_0 - 0.666666666666666*G5_1_0 - 0.666666666666666*G7_0_0 - 0.666666666666666*G7_1_0;
+    A[102] = 0.166666666666666*G3_0 + 0.166666666666666*G3_1;
+    A[103] = 0.0;
+    A[104] = 0.0;
+    A[105] = 0.0;
+    A[106] = 0.0;
+    A[107] = 0.0;
+    A[108] = 0.0;
+    A[109] = 0.0;
+    A[110] = 0.0;
+    A[111] = 0.166666666666667*G5_0_0 + 0.166666666666667*G5_0_1 + 0.166666666666667*G7_0_0 + 0.166666666666667*G7_0_1;
+    A[112] = 0.5*G5_0_0 + 0.5*G7_0_0;
+    A[113] = -0.166666666666666*G5_0_1 - 0.166666666666666*G7_0_1;
+    A[114] = 0.666666666666666*G5_0_1 + 0.666666666666666*G7_0_1;
+    A[115] = 0.0;
+    A[116] = -0.666666666666666*G5_0_0 - 0.666666666666666*G5_0_1 - 0.666666666666666*G7_0_0 - 0.666666666666666*G7_0_1;
+    A[117] = 0.0;
+    A[118] = -0.166666666666667*G3_0;
+    A[119] = 0.0;
+    A[120] = 0.0;
+    A[121] = 0.0;
+    A[122] = 0.0;
+    A[123] = 0.0;
+    A[124] = 0.0;
+    A[125] = 0.0;
+    A[126] = 0.166666666666666*G5_1_0 + 0.166666666666666*G5_1_1 + 0.166666666666666*G7_1_0 + 0.166666666666666*G7_1_1;
+    A[127] = -0.166666666666666*G5_1_0 - 0.166666666666666*G7_1_0;
+    A[128] = 0.5*G5_1_1 + 0.5*G7_1_1;
+    A[129] = 0.666666666666666*G5_1_0 + 0.666666666666666*G7_1_0;
+    A[130] = -0.666666666666666*G5_1_0 - 0.666666666666666*G5_1_1 - 0.666666666666666*G7_1_0 - 0.666666666666666*G7_1_1;
+    A[131] = 0.0;
+    A[132] = 0.0;
+    A[133] = 0.0;
+    A[134] = -0.166666666666666*G3_1;
+    A[135] = 0.0;
+    A[136] = 0.0;
+    A[137] = 0.0;
+    A[138] = 0.0;
+    A[139] = 0.0;
+    A[140] = 0.0;
+    A[141] = 0.0;
+    A[142] = 0.666666666666666*G5_1_0 + 0.666666666666666*G7_1_0;
+    A[143] = 0.666666666666666*G5_0_1 + 0.666666666666666*G7_0_1;
+    A[144] = 1.33333333333333*G5_0_0 + 0.666666666666665*G5_0_1 + 0.666666666666665*G5_1_0 + 1.33333333333333*G5_1_1 + 1.33333333333333*G7_0_0 + 0.666666666666665*G7_0_1 + 0.666666666666665*G7_1_0 + 1.33333333333333*G7_1_1;
+    A[145] = -1.33333333333333*G5_0_0 - 0.666666666666666*G5_0_1 - 0.666666666666665*G5_1_0 - 1.33333333333333*G7_0_0 - 0.666666666666666*G7_0_1 - 0.666666666666665*G7_1_0;
+    A[146] = -0.666666666666666*G5_0_1 - 0.666666666666666*G5_1_0 - 1.33333333333333*G5_1_1 - 0.666666666666666*G7_0_1 - 0.666666666666666*G7_1_0 - 1.33333333333333*G7_1_1;
+    A[147] = -0.166666666666667*G3_0 - 0.166666666666667*G3_1;
+    A[148] = -0.166666666666667*G3_0 - 0.333333333333333*G3_1;
+    A[149] = -0.333333333333333*G3_0 - 0.166666666666667*G3_1;
+    A[150] = 0.0;
+    A[151] = 0.0;
+    A[152] = 0.0;
+    A[153] = 0.0;
+    A[154] = 0.0;
+    A[155] = 0.0;
+    A[156] = -0.666666666666666*G5_1_0 - 0.666666666666666*G5_1_1 - 0.666666666666666*G7_1_0 - 0.666666666666666*G7_1_1;
+    A[157] = 0.0;
+    A[158] = -0.666666666666666*G5_0_1 - 0.666666666666666*G5_1_1 - 0.666666666666666*G7_0_1 - 0.666666666666666*G7_1_1;
+    A[159] = -1.33333333333333*G5_0_0 - 0.666666666666665*G5_0_1 - 0.666666666666666*G5_1_0 - 1.33333333333333*G7_0_0 - 0.666666666666665*G7_0_1 - 0.666666666666666*G7_1_0;
+    A[160] = 1.33333333333333*G5_0_0 + 0.666666666666666*G5_0_1 + 0.666666666666666*G5_1_0 + 1.33333333333333*G5_1_1 + 1.33333333333333*G7_0_0 + 0.666666666666666*G7_0_1 + 0.666666666666666*G7_1_0 + 1.33333333333333*G7_1_1;
+    A[161] = 0.666666666666666*G5_0_1 + 0.666666666666666*G5_1_0 + 0.666666666666666*G7_0_1 + 0.666666666666666*G7_1_0;
+    A[162] = 0.166666666666667*G3_0 - 0.166666666666666*G3_1;
+    A[163] = 0.166666666666667*G3_0;
+    A[164] = 0.333333333333333*G3_0 + 0.166666666666666*G3_1;
+    A[165] = 0.0;
+    A[166] = 0.0;
+    A[167] = 0.0;
+    A[168] = 0.0;
+    A[169] = 0.0;
+    A[170] = 0.0;
+    A[171] = -0.666666666666666*G5_0_0 - 0.666666666666666*G5_0_1 - 0.666666666666666*G7_0_0 - 0.666666666666666*G7_0_1;
+    A[172] = -0.666666666666666*G5_0_0 - 0.666666666666666*G5_1_0 - 0.666666666666666*G7_0_0 - 0.666666666666666*G7_1_0;
+    A[173] = 0.0;
+    A[174] = -0.666666666666666*G5_0_1 - 0.666666666666666*G5_1_0 - 1.33333333333333*G5_1_1 - 0.666666666666666*G7_0_1 - 0.666666666666666*G7_1_0 - 1.33333333333333*G7_1_1;
+    A[175] = 0.666666666666666*G5_0_1 + 0.666666666666666*G5_1_0 + 0.666666666666666*G7_0_1 + 0.666666666666666*G7_1_0;
+    A[176] = 1.33333333333333*G5_0_0 + 0.666666666666667*G5_0_1 + 0.666666666666667*G5_1_0 + 1.33333333333333*G5_1_1 + 1.33333333333333*G7_0_0 + 0.666666666666667*G7_0_1 + 0.666666666666667*G7_1_0 + 1.33333333333333*G7_1_1;
+    A[177] = -0.166666666666666*G3_0 + 0.166666666666667*G3_1;
+    A[178] = 0.166666666666667*G3_0 + 0.333333333333333*G3_1;
+    A[179] = 0.166666666666667*G3_1;
+    A[180] = -0.166666666666666*G0_0 - 0.166666666666666*G0_1;
+    A[181] = 0.0;
+    A[182] = 0.0;
+    A[183] = 0.166666666666667*G0_0 + 0.166666666666667*G0_1;
+    A[184] = -0.166666666666667*G0_0 + 0.166666666666666*G0_1;
+    A[185] = 0.166666666666666*G0_0 - 0.166666666666667*G0_1;
+    A[186] = -0.166666666666666*G1_0 - 0.166666666666666*G1_1;
+    A[187] = 0.0;
+    A[188] = 0.0;
+    A[189] = 0.166666666666667*G1_0 + 0.166666666666667*G1_1;
+    A[190] = -0.166666666666667*G1_0 + 0.166666666666666*G1_1;
+    A[191] = 0.166666666666666*G1_0 - 0.166666666666667*G1_1;
+    A[192] = 0.0;
+    A[193] = 0.0;
+    A[194] = 0.0;
+    A[195] = 0.0;
+    A[196] = 0.166666666666667*G0_0;
+    A[197] = 0.0;
+    A[198] = 0.166666666666667*G0_0 + 0.333333333333333*G0_1;
+    A[199] = -0.166666666666667*G0_0;
+    A[200] = -0.166666666666667*G0_0 - 0.333333333333333*G0_1;
+    A[201] = 0.0;
+    A[202] = 0.166666666666667*G1_0;
+    A[203] = 0.0;
+    A[204] = 0.166666666666667*G1_0 + 0.333333333333333*G1_1;
+    A[205] = -0.166666666666667*G1_0;
+    A[206] = -0.166666666666667*G1_0 - 0.333333333333333*G1_1;
+    A[207] = 0.0;
+    A[208] = 0.0;
+    A[209] = 0.0;
+    A[210] = 0.0;
+    A[211] = 0.0;
+    A[212] = 0.166666666666666*G0_1;
+    A[213] = 0.333333333333333*G0_0 + 0.166666666666667*G0_1;
+    A[214] = -0.333333333333333*G0_0 - 0.166666666666666*G0_1;
+    A[215] = -0.166666666666667*G0_1;
+    A[216] = 0.0;
+    A[217] = 0.0;
+    A[218] = 0.166666666666666*G1_1;
+    A[219] = 0.333333333333333*G1_0 + 0.166666666666667*G1_1;
+    A[220] = -0.333333333333333*G1_0 - 0.166666666666666*G1_1;
+    A[221] = -0.166666666666667*G1_1;
+    A[222] = 0.0;
+    A[223] = 0.0;
+    A[224] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stokes_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stokes_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    12
+    // Number of operations (multiply-add pairs) for tensor contraction: 42
+    // Total number of operations (multiply-add pairs):                  57
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G1_6 = det*w[0][6]*(1.0);
+    const double G1_7 = det*w[0][7]*(1.0);
+    const double G1_8 = det*w[0][8]*(1.0);
+    const double G1_9 = det*w[0][9]*(1.0);
+    const double G1_10 = det*w[0][10]*(1.0);
+    const double G1_11 = det*w[0][11]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0 - 0.00277777777777778*G0_1 - 0.00277777777777778*G0_2 - 0.0111111111111111*G0_3;
+    A[1] = -0.00277777777777778*G0_0 + 0.0166666666666667*G0_1 - 0.00277777777777781*G0_2 - 0.0111111111111111*G0_4;
+    A[2] = -0.00277777777777778*G0_0 - 0.0027777777777778*G0_1 + 0.0166666666666667*G0_2 - 0.0111111111111111*G0_5;
+    A[3] = -0.0111111111111111*G0_0 + 0.0888888888888888*G0_3 + 0.0444444444444443*G0_4 + 0.0444444444444443*G0_5;
+    A[4] = -0.0111111111111111*G0_1 + 0.0444444444444443*G0_3 + 0.0888888888888887*G0_4 + 0.0444444444444443*G0_5;
+    A[5] = -0.0111111111111111*G0_2 + 0.0444444444444443*G0_3 + 0.0444444444444443*G0_4 + 0.0888888888888887*G0_5;
+    A[6] = 0.0166666666666666*G1_6 - 0.00277777777777778*G1_7 - 0.00277777777777778*G1_8 - 0.0111111111111111*G1_9;
+    A[7] = -0.00277777777777778*G1_6 + 0.0166666666666667*G1_7 - 0.00277777777777781*G1_8 - 0.0111111111111111*G1_10;
+    A[8] = -0.00277777777777778*G1_6 - 0.0027777777777778*G1_7 + 0.0166666666666667*G1_8 - 0.0111111111111111*G1_11;
+    A[9] = -0.0111111111111111*G1_6 + 0.0888888888888888*G1_9 + 0.0444444444444443*G1_10 + 0.0444444444444443*G1_11;
+    A[10] = -0.0111111111111111*G1_7 + 0.0444444444444443*G1_9 + 0.0888888888888887*G1_10 + 0.0444444444444443*G1_11;
+    A[11] = -0.0111111111111111*G1_8 + 0.0444444444444443*G1_9 + 0.0444444444444443*G1_10 + 0.0888888888888887*G1_11;
+    A[12] = 0.0;
+    A[13] = 0.0;
+    A[14] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stokes_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  stokes_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "c9e96217bdf0b022e1a9d4f90d63fa9416a1eee23b1a54c975139f2f6b9c7cdd37541ea9b58f1cb326bf42f666b50c6dd5e092cd12a6ee87d8ae82cf4a165465";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stokes_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stokes_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  stokes_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stokes_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "b3978d478cbb126b3ad3d96db8c676051eff4290c965fd25417010587d83bcc7aba002f10838a92bdf2eb21220165f78c8d99743bd98f2c7fcef11cfc5d7530e";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stokes_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new stokes_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stokes_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Stokes
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stokes_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stokes_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stokes_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/documented/stokes-taylor-hood/cpp/Stokes.ufl b/demo/documented/stokes-taylor-hood/cpp/Stokes.ufl
new file mode 100644
index 0000000..4f33cc2
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/cpp/Stokes.ufl
@@ -0,0 +1,36 @@
+# Copyright (c) 2005-2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and Linear form L(v) for the Stokes
+# equations using a mixed formulation (Taylor-Hood elements).
+#
+# Compile this form with FFC: ffc -l dolfin Stokes.ufl
+
+P2 = VectorElement("Lagrange", triangle, 2)
+P1 = FiniteElement("Lagrange", triangle, 1)
+TH = P2 * P1
+
+(u, p) = TrialFunctions(TH)
+(v, q) = TestFunctions(TH)
+
+f = Coefficient(P2)
+
+a = (inner(grad(u), grad(v)) - div(v)*p + div(u)*q)*dx
+L = dot(f, v)*dx
diff --git a/demo/documented/stokes-taylor-hood/cpp/compile.log b/demo/documented/stokes-taylor-hood/cpp/compile.log
new file mode 100644
index 0000000..5f7ba02
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/cpp/compile.log
@@ -0,0 +1,738 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Stokes
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Mixed<Vector<2 x CG2(?)>, CG1(?)>'
+  Unique sub elements:    'Mixed<Vector<2 x CG2(?)>, CG1(?)>, Vector<2 x CG2(?)>, CG
+                          1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'Mixed<Vector<2 x CG2(?)>, CG1(?)>, Vector<2 x CG2(?)>'
+  Unique sub elements:    'Mixed<Vector<2 x CG2(?)>, CG1(?)>, Vector<2 x CG2(?)>, CG
+                          1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0582302 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00522 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00502 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00475 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00479 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.00474 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.0047 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.00465 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.00454 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  180 entries computed in 0.00456 seconds
+  Shape of reference tensor: (15, 12)
+  Primary multi index:   rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  180 entries computed in 0.00446 seconds
+  Shape of reference tensor: (15, 12)
+  Primary multi index:   rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0903139 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000355005 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.594072 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000649929 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Stokes.h.
+  
+Compiler stage 5 finished in 0.00156903 seconds.
+
+FFC finished in 0.745597 seconds.
diff --git a/demo/documented/stokes-taylor-hood/cpp/documentation.rst b/demo/documented/stokes-taylor-hood/cpp/documentation.rst
new file mode 100644
index 0000000..72d0391
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the DOLFIN Stokes problem with Taylor-Hood elements demo
+
+.. _demo_pde_stokes-taylor-hood_python_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/stokes-taylor-hood/cpp/main.cpp b/demo/documented/stokes-taylor-hood/cpp/main.cpp
new file mode 100644
index 0000000..9e90191
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/cpp/main.cpp
@@ -0,0 +1,118 @@
+// Copyright (C) 2006-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-02-09
+// Last changed: 2012-07-05
+//
+// This demo solves the Stokes equations, using quadratic elements for
+// the velocity and first degree elements for the pressure
+// (Taylor-Hood elements). The sub domains for the different boundary
+// conditions used in this simulation are computed by the demo program
+// in src/demo/mesh/subdomains.
+
+#include <dolfin.h>
+#include "Stokes.h"
+
+using namespace dolfin;
+
+int main()
+{
+  // Function for no-slip boundary condition for velocity
+  class Noslip : public Expression
+  {
+  public:
+
+    Noslip() : Expression(2) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = 0.0;
+      values[1] = 0.0;
+    }
+
+  };
+
+  // Function for inflow boundary condition for velocity
+  class Inflow : public Expression
+  {
+  public:
+
+    Inflow() : Expression(2) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = -sin(x[1]*DOLFIN_PI);
+      values[1] = 0.0;
+    }
+
+  };
+
+  // Read mesh and sub domain markers
+  Mesh mesh("../dolfin_fine.xml.gz");
+  MeshFunction<std::size_t> sub_domains(mesh, "../dolfin_fine_subdomains.xml.gz");
+
+  // Create function space and subspaces
+  Stokes::FunctionSpace W(mesh);
+  SubSpace W0(W, 0);
+  SubSpace W1(W, 1);
+
+  // Create functions for boundary conditions
+  Noslip noslip;
+  Inflow inflow;
+  Constant zero(0);
+
+  // No-slip boundary condition for velocity
+  DirichletBC bc0(W0, noslip, sub_domains, 0);
+
+  // Inflow boundary condition for velocity
+  DirichletBC bc1(W0, inflow, sub_domains, 1);
+
+  // Boundary condition for pressure at outflow
+  DirichletBC bc2(W1, zero, sub_domains, 2);
+
+  // Collect boundary conditions
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bc0); bcs.push_back(&bc1); bcs.push_back(&bc2);
+
+  // Define variational problem
+  Constant f(0.0, 0.0);
+  Stokes::BilinearForm a(W, W);
+  Stokes::LinearForm L(W);
+  L.f = f;
+
+  // Compute solution
+  Function w(W);
+  solve(a == L, w, bcs);
+  Function u = w[0];
+  Function p = w[1];
+
+  // Save solution in VTK format
+  File ufile_pvd("velocity.pvd");
+  ufile_pvd << u;
+  File pfile_pvd("pressure.pvd");
+  pfile_pvd << p;
+
+  File pfile_mf("mf.pvd");
+  pfile_mf << sub_domains;
+
+  // Plot solution
+  plot(u);
+  plot(p);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/documented/stokes-taylor-hood/cpp/plot.py b/demo/documented/stokes-taylor-hood/cpp/plot.py
new file mode 100644
index 0000000..c5efa01
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/cpp/plot.py
@@ -0,0 +1,9 @@
+from dolfin import *
+
+# Plot velocity
+u = Function("velocity.xml")
+plot(u)
+
+# Plot pressure
+p = Function("pressure.xml")
+plot(p)
diff --git a/demo/documented/stokes-taylor-hood/dolfin_fine.xml.gz b/demo/documented/stokes-taylor-hood/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-taylor-hood/dolfin_fine_subdomains.xml.gz b/demo/documented/stokes-taylor-hood/dolfin_fine_subdomains.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..2a350b80234ffa631d882d23022732043901d2f6
GIT binary patch
literal 42459
zcmeG_dt8)d)@2!968vc`KPy2iG_UNMn-^|r@@-+JpQU0VBdx7=F}x)r$fT6ky5CZ`
z%9<C{F1G0knT07ZBDG5P6SeKr#pLoSk*hewBrwh}^PTgY=b3rmmv`Qof%$&x=Z=5C
z>&)|<=RD^*_j8_?&~;sIVgKy!pP&85k(ZNZUrNhbJ^Hr%V(aeE$M&tgzsp_cf0ucG
z=eI_@oK?L0`K6ZogGc=K=#sEE|33EFE?@p-cJkc6eQanAw_nJ${d~x7TdOypiLup|
z>zmKj#@Mdc8?1Hqh5~y_PE0F&Zcd4@pU<^li)l65YmFI}WPR)982c`Rd9(fc+8Fy!
z&Gzf%_Qo8$CCFgEthXLFSapV00C1?PwLYe`MrS`)Wj~|0n2h%8rped!_VspSjKyeg
z*rm6WR@rUg`s?3@+FA`3SfeJ_){tUoZ8~JImFsQhTzk{e82hz?s@4mk_DgkkOR~WN
z2<7G4uQV=dy>_|4-Wp^!AGKOyYElgLQrJwh-fD`m)#$C~lMNXF(bj0uw|rY=uPN8J
zUeMX=4E6xKO@A%La2~#`8hWvIWNNFuOqW-7{DpG^8}sXXr=D$EQPK2P<ja-`iCNhN
z-+n&%ViJ7Q@L5sr=PU0IIv4%U+PwM;``N&^BGVVdJcS=E$URnirpe^|*dY1XB0hdO
zZA{GX%76T6<!fUyqcX>(eKOy8(zL$m4<W(PF)!wrcC#nLOF5=e`fNdt=^Q>~eDVqm
zG|`6(b4=Zv*@uhZ!w2v&I%Y|ZDS|y2mYy+9gr}HUTXY96n?FeVkF4&wx`RXRtE~Qc
zS;nQkbval2L=8{(^vO0dCCae0{KrK#riqfL2>k4)x~btCul8M$acSGB3r7Gjz{jVC
z?Y*`=bL73RVFnw==6e4W!`3Jtc_R1HRgSgIbim@+5`QwpA53{DeP}@L@vXXps^8jA
z!#DGOKG0zP;1G~P`IH8Pn)h={T}@s2(kw>1;An%^)0({Phf}6hPkaclTEsW+oN6C)
z{(|*%)O$zYC=VA;x}oO}B~N8ow50syMELomd>8r^W&t7Rs&kt7T6d5mw8l8=NbvBQ
zdvgHCP(h3*oB3Qgg~mI?G0i(z&Ng8WxoZBv63Guwe2QDk<p44+MFWZtuSjV5>U7be
zFhC2Rt(&fz2>+VePRkG7k{CW(|Dk{rJhAy|2!J4lXnvLL-nbAbnCGCJ&H=tyfIPj@
zaRQdHirL6GmmLHPE{qE>;&};p_MaOq?At0kuuzrQ`=#1uA|W1s!IuuEFmf~;)9@7d
zP&j+>wG&dtrQ({RMavgit*2*aY|TA5XKl*S@~rc<!G%$_Zvsy=*jmDuud;6HyQSvt
zMqS;g@Utc6ul`w7lw0%b#(B#Yt_d#Fmu$XRex>?OW43*DPFe0hO8O)Yw0AbHkNGsy
zWG*)jH&k!Hk<l@$b94>U%@0S6E)9$uAA8T>yZ&=k-}nFUwRzx{;I4mp{E679gHKO=
z=g(j7e)sEHzgRY9#o)ZvgOiOt&W?NH<Hw(l-8p#bwA2mLQq#631%&Ns{CH2}fA?87
zrDAZe8SfnY{l#h9^A@i<9G8D|t1fJM<-YvPo-?~PwY1*3X~Ud=I#br8;ZvUN3dr_-
z{cK!*=EGO|{XBhj-!0|(^`=f`Fk;^5pz*JUoh|9p?YBJ>X<QSI+Y-><(Cf;gd0p}o
zwjb^VTP%<5e*}J8p9`o;k2QDdyAhxVN3;MYJ)a#~5@-)R5;*>kVP|W`mIjW0hyVT)
z0$$ehAbj6^$CZBX&s-gK_0B~b=VV0~zW%iE`J{mUCwpD_$<n9Su#&(N3qxLyn+PkX
zM|ar)z~`MEH~+KSBSss}mRyeb#j>6&V9Xf+mW^ZcGp8&dWEW1%KRT-O>0u=yDH(Ss
zr>1P(QHj{rjq7p%CYPr6yk|I!Z%DXn1pW?R)=>ZIM#F)A`o*_Khra%2TrV>Cjcxe*
zO1}qZ17&Kyc<34Yt-DfvsOoaRD@cUL4<&4`C$Ps35!i0wgz_<*x+P$TiN1ckh)^y7
z6yHwkx~yepKtz|Xa^|eH0O~u#0n0U40OPIwt&3MR($xMoPS)1%U$gO#ZtV?wi0E?n
zpXq?Q3}AG8_LpqyZ)eih?|+i8f9Od(`{$D?XV3fb2x1pF{vMoAx%suRFvPU3Z+i2m
zft`MZbg=as`5bHxDBl~GD39H77yKToe`mVw!M|E3J-d8(w<28h?6}AOc6-|Q=4m5;
zIA1>YqrVZ@(Fk_iy73YC`$Xp3S%k=HMC3}p33D0b9S;!lgEkTJlVI>nTeQX8_s*vL
zC4dh+fJoTQ)pxHL0XWsAG<1uCv2~`1<!@|5P}VP&{aA)8>Rw)pADGO>b%{F$0@(D7
zfV`9IVby3u<_sDWIDYbgvlmX}tr(F!^Xxe3XUz})%rU~LKu%l*cE-l!#sm>a{&}6L
zJeEL%q`;y_x9%9YgwO$zK{)05XpSHMASr<1qyP-m2ZWIA+3xZ)0pF$rrrq1VIkcpk
z2107{kW4mCCI*Pfu_|^RAp;`D2rS#cqPiJTn+k@q&!TK;eZ9t!2*y;)TomxAO+y%r
znn)SN)i)?6qZASw5wV-+?q!67GsFk6alQ(2uqyG>dedMNotYR_hlif_eV-L0q+BCE
zq&7=v;Sbv8yY;EZLFXa&o$DcGE$xkR+Sf#_AU@O&Uy%trU%NFkDn0r8?TpK9k<0Nj
z6qUkp$W3NzU?qK(5s=Jw2m&yQ092LSOC&Q^_aK2P7hlB$v001e{a8kjJ>b<gWDqoD
z@{<+u*yJDX@Orm07+eNXyG;IJSa-QxdPF=KI7A6Gz{&MrFj~nZPkT2GZ6I3}bo91w
zh?Fv+bH{tCf)D)riWmH=0z+(pX(YxLXvAG>HrZa#RJL6{>Z<kQfu@abFiqE<ZM8&P
zl0fYsW?WXwjn#dDe?yi9GWAZDAy8NbZV37o;$edu7FcX<HM{y2q(ztuqY_UBNS%Up
zrn-^{4a(+%tV*UcRi`yx`y{|=aM~p%S8O}NKxt3b-~guPQkZUV0i#^Hvbqd#zG*rD
z{CibG!ZyspG%NEt@LaTHuY=^0?U-paMn3dMqb#eXwnL^JG`A-cEjn4*sdzM5K@ulw
z9Z<I5=Y#^)rT&s3Gf3$B0HN=16Asj^TufSC<7OlMQHPjB*2=#n-e;#lfV`nsv_6DD
z%TAiHNr)Dkc&_A8nV8r%)P>Xw`Do`Jg-g<g<06>}?!d9qREU25SypHXyjw-pU`W+e
z`5IHqrLU@DBKKsOv}0JY?Hl3-g}(QmpKrJW0K<Tc8g=D9764>|D^8!VAZ>GbMYM2@
zV!VG4M*?n*jDEoA)^>6slLo@c2fU(0%mbcKSI0LjS{NHa)<Y663B9aPt#Zy+>=H$Q
z!Zs7rcV6fT^=N`g7HZ-4V59K6m`rsPEz}Jk_G#=2x;`i(AgyJro<*7v8)W$AA+@15
zI$)?v2CC?$c2E?JVS3wmxIGlT@zKJJk@0~J#vmBSm?=v4UUe(vMMC`(Dp7zs+bhIM
z>Ig=Y!zy?A&=t3=l<7_nR1_1gTs7g+in<k2h4HZ!T|Wq((J0Je5i|S5@l`t?Bu-Me
zmMiUf1jP=vgMKPMU*^}e8!c2LKOA~dCm}vlPo3Kx)yo*7?LH}!+D_j|Wv}h#Wu`)c
zeW=+wDC<02@(o(x6OC%)CE+K`UFygK#Rp88u;5$f`nOw^6Gq;|9;#}^j~3?p-NoKQ
z)!)q20zW7*W89Pvt4sg8b9hBvL4I|t#d?qJa9tgH>IYB3pWtT$;ORH)X(&9Uu%{95
zw2M8BhNm;^DH@&v_Th{P@H7gZW=-$4_~Fh$6+O3@S3Murf6UVjJBJPF`rW40!3$<S
z(WU&Z!uiMJ#;1MA1~xtnSnSK5vVG9<QyVwD-epqBy3hAKxO9HE#QiWe_UVT0J%07>
z>VO5uPFWA{%kKF;4I4ni=Dxs&?Rb(_SoAJi;m2=jg`Kp*;9s*9dVV};`N=iUOe)EI
z<jWT`=FEKJ*mpGS6B@RYhMoK?t+13<`1?zQ$Q)Xs$7Z&|v9otY&VTIKht=cmo%%>j
z{+<WFe3=lLN5h_=VINh{3TJ7BibohCZx_%CM`(o!uXGF9-+u{ibjRk<`02f-jv|U2
zqG8oEY-BPal13}k(h6@@(F%52q1R}ndI@gy&J#gHhji_~h2cBDhK2?1Vl@B#Xrjnh
zw8HSGO6<R}oS6k{pN4N{!14W)k2r>)COic+o3NPC>>>dgM1Y<f!vLK;PJre<#SZV8
zC4}l0LbaZ7I97)=dvq7jtk+ni*@UG;v-fD&psftmk1o*)Q)q>E#}duHqZRhi3SYj8
zG|NMpt=ft->lHyX`v(m>NyGLpBSZ>lg|BFZH?PtPDYU}rh|ZyBiXTrKSbd@5*6@n_
zZ1yAg1>^07^Go9r-!JOju(QXI)OVVmI=t?YJr`puB0L$eFZ*<5*X1WSHl3ge^nc*+
zKOvmY_q@M9r4w@a2MB)HkU{lZUqj(ws~(Sw18hKwrn0sCp!~G@zhH*^>>0pr=?M|l
zvG-0Nfj=4tGd7Gb+s!DR6qbifd}_^xLdKA82N1^wRh+K;LWP6d!TkR^P(Ac-n28!{
zLg_7D^V|sbG>M?MgG^{Zg}U*Ba;H!8vqvfUegNnD&7AL(1>Zk`iWvA_dw_)R*#x=f
zZpVQ#{<^tA<yAx&Dv!v_;_*rMs~N)DN-e7yumBD-a=zh3W8oPZR~q!Fni&nB-q>11
zmNsX%s>Kxxm43GojCAJb`%_+Fe4w>_@PaWDRdwCKy)^ezwDckSb)ThFzC?z-W&rag
zls>@Z1o8!huIP>089Zh2dnS1Ui#MVNk=eAn>BPC+!x-P16Qqv9sf<sujd>jUUd3<j
zaV%bcOzLBR|1(kH|D>?R4e@2o<Pk00ScpSV7KXD$M^CI|`1Y8bU?gez^x|yp8_{Ii
z?YLPL5z_z1-g_cj_J1KPjupiBr88-%`rsj{sogp4UPLU$S*E4c)fdt3TM{@%YKmHD
zMx_ka4wZOZk@F{})zPl_VOqY5ORVC|`Nb1+HN3Rifp5utxrOV|lWeo;Stpo+c7=xE
zAu)<Ejc^aQw|-n?3Q=XkhTEnvk~b7{+RNl=-RE04=7Oi#p-YhCJSArFWo5*{SdAE5
zAV)6jBhPfcisz0lE}c7ZW*gsDws!2S=p5G`a6tWx`mN3RL{QGUA;kuE&cFrcM9wSC
z3a%Dho{>##T|3|%h9rtGm%UQj<ADMavT3)HaMj6<rD@%UbW7}fx!lQjzotAa6t>-R
zVA<iLc}<To>VsxEZ+tL_O#`Ow&*dYUg$}LHg;l*&8g~Z-6Px=f#>AJcWd^4vVlRCI
z@|I$_l}%))&Nm!1>Ma^K)ciIJL$)v^z%wIkFmh&8#SPfkPoThI6z9xWdNIj}OmJ$-
zwX(otZSI3if>CiKkrY{n3}UKSXv&;4PI?FqnX=(W5VF@v;zWeshFt(?vi=tGAER^9
zQ92yXY~z=5Z>25UHwA2GJD1_>Qs-&}SB$j^V)*fMGqYUB4@;pz*EDnbstVoCVYy7@
zGc6P~RLx{Lb|@rE3o|+vP(j2v-l#DJS?HXZEsW~K)U{Bq3Ov$}$_T&a<HN+sjRW3n
zOK!BVk&KsBt!AuJx2Y-}G#t1_=$SwaDDK1`R$}Ho7fA||!eV%^Z6->@mpSBx(96$8
z*>g@MH9*Fd3%HO3t|7dMuv@0Z0fOjyk(6nJ0BI&<Hp;kmXOH@=g!OTzT!SjW(GgPR
zP^GfS-V>D3L~*;vIc}})1FbVrUqKuV<5`)u^@dP#ghTeDO5F}hn(tfcS-7&lYK$vX
z2ihl2S`D$$&X#Z#nVXaruTBh^-PX*(AWx8`BTm)A-i_!3lOwqn)kC@`zKs2tOok&a
zgOud-#;2K8$<NLe%+7Q><eqjh;p8A7DP>kVF*H*l?4IvaoEF-2TB`#)rK!jlv_auU
zcykyZbxW5x*Gx1Wb}o&1T5ia#z+d=T3<oDTho2<Z<)ykLo0_wNxd9bQqqh-F?u8tV
z*ty(+66!_O+d>(j<9A_#)K^fWty{FzCbjY6NMnE{kRFKO7l%SfA1>iYA<xPq0>z&V
zUd++YZcE&s6vloSgyIk5fq1xZrY3S(&<R<<shEe&;j%ze$ugm(O7~sZY-VeTb5gL9
z=Vlreq=`1>`6S`|%k>hAREQ)#5pp78yLTp#L?NdW6RhqzPbu^`GCrNPPZ+=0dmE{y
zE`7pS-~qwr<Q@<v8jza{1UEDN0h%2s%8Wy@Fb*R6Mi5w~sA2*^L_!fS*3vwl9|zm1
zmg}fS9>p1QfoJ-aZO}I&L?rQv2oVu|B0_X>J`o{0YoCaalsnXQx%!zYG`de1Yh^}Q
zo?&~@(+x@WtAp!JLuNMYgpc&qK74}ea{X2)63;hck@#dKRRNoL6)=VBjDP`_p<y8I
zeZG;ZfN8r}Nwk6rh&c7+8km^*$o>>8c)A`2M(=fZD?q^$;E%hvA_5DZ`@KX&zCy_U
z9k7G#J?dG(Q-ZI280usksJT^pXuZxj2lj>t)&+R56Ex=I+tP}!jnsmQ?2aPSZCb;C
z6WtR5sRdQ+la<&z;C3g-u&&P=sdWRgMS6nee$ek(F9l$U8B#--_o>=&kR?aJOyHLo
z9<1Y5A)Gruh3W%zdoEf+Ut@)9QfbbzGbB}I85fUK-sp)`^>#W{3BEI<eo$b(Jvat5
z#5V-3YFA2&m*}4b%kq4l`xcJ89k4joR^|L}h?~uwpVST9E21P7)u~xChV}rmoQUBJ
z5k9ys;d*`uzH_X2g~#*QP2F@e*6?HX|MCQ(lW4sx_yy&iSMbX{b6FTLi97eBxYu9F
z<6<@k;{^2qPDTAaO_*0km27pl6s%2w;Z{jvMV*ouw=O|s)w$5=Kq{(8YDqhc5VcV9
z!s+#c@;t$MqtPlU3~R+$JOgGXmY3IzOXGM|c}QvwHv-xND70j($|iUeYC?I}wt`ob
zYhRS{o-@@;>v~|R9cE3n*n%MxE0lt(td>l4QBzT~s(w(OTh1GeR%<q}(x<e=G>9vC
zR_?`Yz9@%@Vwal%PG6rUc*Lq&=@Sea{Gi;mkNL^YqEdC&LZ(YGO&O}x_wH)FaTy}W
z6=HxO+SYs_r|zqIIh5Xg$o3sB5fWw5bdv&5(A0Y|$B2lC=o1q}`pOHtrS3nnOtbgN
z2{i@AGR;hTdSw1p?KDS{6>B=oSn*|(LAlFXtK~&q=!${vM}F5JS1`Dvwy9r#m~{;C
znlSh)#RlrbgI=S*f=2;eO&|bT#WomN#Hqm>fRyz(_bohXPRKg!G0LOUZ_^dTyMuye
z0LMWm1-3qXM(j*|amrHQMp>6+;{MvVsPkOZL`A)pDyN>7rA3`p(at7-v0X`uzr3OW
zf!H}c^~+(;mS#UmW8V8TOEjtRHYjl>*sNybj-|rERFAb19j$A87RoG9Fgdvwa}->t
zfn+1e(6$2<(24#!QHqtfHaSTsNDbS*HjJ8>M6;LZ2NRtw>ZfsvAD#pxZ>p3pDaM_0
z1I}3%j?P$5Ra|Hl)sbur+{+)RcD(M9En%)|#&H?cv@PaJN@SjAG1oX2bUb{@OU_(9
zOPVr|e<#<gF62#~^*cV<Wm}$*6~V_mZjd$a1TRSaA9-?1^a-=*5ZQ+)<`6N>=tCwO
z3KnHWAVxZni|}OLA(+5#D=B|#_BbIZ-jG>T(o8jR<v!%u1nfz)Z}<~KUeH;PPAD{L
zsP=iUkGwcuwTNXU+hJf(K;*C#EwQR<RxBjsG%3u0DL-f&%F@**Q|M5~tH5hM<ppFA
z<}}e(L}MPCR*jk@yrN;iF&9N<XtH6=WiYOaq)mY1K3<P`Wdw|?AP`Fz11BdiBzF#D
zJ7nDov^sZMK&)t{TwpwDK66`5=G$<X7-e&*l>eFa1P2SMENcElc!i>uS!h7D!4kyM
z(|*Hft?i;|o&L#;?<!M+T&Q~K4n*q(?+;nKNG1D$E~M<>TsS_3U8&$CcE=@9-VDn6
zk(*fiy@SN+`*cApnKolOrK2hAmBoV>S~^38FX*M<^p+RxhwEmrYshhM4cV7ZGaH+_
z-}E)f8?{u8m0(trXZM-i7VkBS;n*PH<B~Vt>j78MbqQLt4v&^rt>qwc<bBvM;n7^>
zj+4T$TrA14Zebr_1nr`JOf#GVEY_;q&8v889@U<mPSkK_BD~SxU@oX)m}}qM5Beb3
zg(!!^yhQaflt+m^S>rV-JF1s+tJVGh_1_3o%}U;6&~Bo!)H|J_!a)`0#Jh4uhtH61
zElc=+&qXim$j}l)uC=%b&0T)rFbYq-Ar|;%vbz>eN#Yj-HLSWT??h&I(UjiYpx9l<
zyya?*y%-)OQy^6+A`wp_5U6aby7OATnR)>Sm4)|Qp{hT90xBsiS+4#?(HL*31*Cgf
zS?1+xNpehH5w00ZrD+kZcp(`W7Ew7{#?I==LTyR7`9ZZaEKrb*Czas!3~I8Z%9A|4
zPymv2_})mMpsxt8@jCm8ye=n0i-o-2OraPOE=4N~=eZL1gVLfECQdK&bmUrgy&cO0
z-?uwbl*OXXd)~NA(~LnKJ5eV%<vRdC)z%y7POTS0<&rZL$p}py3nGBk3#kaSx4xX8
z9V8(TVkiB-n<Ri1lK)1aN-dm->`e+}=(Jxbpr9+5HhL9B2*q8BnnwG4Y#){=ZzNFs
z0<rXNC2?%2yP`6veHV3UMqnoC{t~gvY^ltF!+3;L4wMV@MQ@NMSj_8yn*M}J;eiUB
zRFKswQn0e5<zCgd1;~U1l~1S#ISkFk$ldi#t=NYgMpuSqq3<q!g@D~Uc3v5#0yXwj
zySa5N*{N2wS;hgHE<BSZmD{tLlSHMbt#Z6E?kTt7uv`x~Og2feGahR)S!%cQBeTJ*
z-NJ3pucEBr+U+-Yu$NI1QEIj^c*I!oW#Qnd$l5JDyf+M8cZw^=ynIZh5?0%3_bp(X
zKJJUn)4K2L)cr`-+~>FH8)n~k_V?po=y4@OpY>m*j~c&D-gsrwqi?VOYTN6wTa}mx
z@Zq&WKPcxLXSCSqCMG+0Mwk?;lf2+Gl==3c|M?XIvv|QNl`x@mPkR7S5;HHJ)I2@N
z=l{z<)!Xy44b~a_Eg^b&k<{UTM|+{sXUX2jCJO<X&(QvohctHfgYv+Fu4}rsq0rt5
z>W2C~v*F_L%CPQ<`}6WH1{W7+!z+W&%xLVc)0M%!<jX_MZ{+38Ex`%aBWGCs_<CGM
z&1H69d1aWP;o63w%TK{HUCZ^jUlh)VY2oP%99>hzyQbmr%4J`bDB*sB>kGGFKE1g~
z3$L>CRfV$HhZmXs<nrK*o%g;wPA>i4mDnwq>$rGa8b^7BH5($i9Y_`J*Wxw;#a{7c
zq8(cV%F<*I230=H1o$x2?r<xwGd%NMgYgpIwLOpVyr)rShZK%JMhEwKVc|4tx)`$r
zN)m_ak&Q>;o=?~+DQq%eV_hP7<Cf^f7QrzNz*u-2qX5VP3%Q{7#o{GMsj^@Pl0=da
zn8mTa3xbyTE;JkCyMS?v?^xm~-?0Q8n=HCj4^$QTBn8i*zwg6DgoHO-q$|`5$nuPs
zPuPlI6t+uW?XLX>Yv6J10nT{%Mk@IEvGP^}VMgO7Jwaam)$i?#f3Twu`>P$ET_SE%
z^%Zqv>LKe`2~wt~{Gc?O-Tk!k+Dh_!!!eTg>av^0_`+S`x(k<`>K^<mvg-llD54+7
zi;mK)gTit2$ng3>d655-r2PG4cUNiz9!7^*8pzVCS3w+vvo5@R;oZ9#;Oz9F3Ep4A
zP{;yCFMd#N-yY+*ujZ$fJ6e^-6=S$xE_rjVj)$!L!sPTuQO=?pXGvjh29U+YP>3eT
zEU<#1J&NT0pfqwLDiNrk?Cz>_NnusM<g(&bGEdmhOK(Bvi}&b)%4KiIbu++OyrKzO
zWkGp-?jp3u;*}qi=dVuj)5;yKr~oTVTV{z~9<KAPB31tYyU7|~=4OC1l}!^oDW7RI
z_Oo1-AC%*-@AzreQD(p@Y)fajYio}`1b<LiQD^l@*_JA9_>y5A{N31&y++x2H#OLY
zuTX}LNngG8I2~Tr;Hx)S`^n|O89Q%Lcbr`I1PhiNrJ0>}7HLJ5*O}P4kqUIq5X4{i
z^(ecBIsBWn?n^aTnXli@B5iz`w6=%-`3+Q{b9Pnx>%Q)i9?rbnO<MPjXD@5EeIa=%
zuKH`9#bsPx-o@7|s$b`ou$L$AZ+4%sV3+*;pj-t1^18mCR-VL_O<B_$n+=w8xwfBj
zVyt#^sIBE(p22o0%WgSSWwYfS*Xvr%cAL%kUX}f-KEraYT;H0}+WQ|%FP^gn1l{t#
D$Qv7;

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-taylor-hood/plot_mesh.png b/demo/documented/stokes-taylor-hood/plot_mesh.png
new file mode 100644
index 0000000000000000000000000000000000000000..8801fc8492aaa15a8de36513b0cde9c7407eea95
GIT binary patch
literal 35671
zcmeFY<zH0o`vt0EAV`OlA`L^gD4~>eGjubQG=enJIphp5fOI!QBcU|Iz|b8MLw7fa
z=leXr^GBS|c{TCo-h1EowXSuowRX6Q(ia>o3am$u9^uH!NUA-0^hEp7qsOtBPagic
z)e1*Fdi3s*tmJ16_q3g#cFuIHl{JTy-;E|pZG~BnkqCD`2-Fjz`R-@T*F`fx$5N~w
zpCSfhU-1*ewX~dJD?SRa`r&<R(<89-!!K`!6imv8Z%%yw|L6a=pTpgH3HHzh{mlip
z@BQ7DI3LCR8-0$I+uIWC;S1s#TH$AHettJ*sK#q@v*s3XKl(GgzW(q`pxZr`P0f&F
zWp~#J@mths_3ZBM@I(>Ok1l$3%CWy6qi)DSErzmes5oFYU%jlvg&vEcV(o4#t(P}Z
z<`+pbSAAbfy6&N`a@_HFqw2Q9S3W0$dGQr}8j<z&pp^Rh7>C8hbu`c7B6V(*IVE$4
zkG&ju-@?KgnUs*r5>)K)PPFHucis82p#;gbUMWisQh%v6Ze>&kn1j!Z<)SM+`4)A>
zD1{gKhF#uTydUmKx87c-zV#NIjj{Bc6P56p%~=uJ$QONfRk09db%R=Tq;Z*w0U;fE
zOUWLu7g#|!_ZeKDT^@!5Oc)zAHCMNr;>GY8cF~Yhy%uNRo^idTuIl=Q=AR6yDE<NO
zu?Y~JsP_q@^7f-tVd#>t=${v5>HSnGn5fT!r!0T{T!kd>cH?~b4YlC|?`kQ?1DiOK
z@Se=xNIpqSeA=<T2aD?KOerCNom5W_A^pFjmp4h+bOvJ`>S?1a^LZ{gXi;FG`_!Mi
zksLvnI3L6j^tkJ&5xA}xwEh<~csb=ebFsgI22~dM-BOrEWr!uc1hO21+x%jT+9E0g
z(w1VVSJqLf=jF&D=j+q$HQc$s=liKde3oBPn(4rJo>`fk*)sRTbyUVmPt3#C8X6_(
z++MkQ&9$ES-dtQ%a;6JwpV^ohz{KrS=1S3BJUSjNw%bR;Aesy|<-y8Q6r3LK<Jp#2
z_TlZ2q&pU(YX5vchQ^HlH%ngYZ77`uM|V1>k)i#olQUovmm&RvRNy=8*gnn9Mo&<_
z`QrdzZ4xImO#vXUMXIk<t`RlR;HNR39=_zk!wSn>h5Cs*Twdi1t_dkB6-7SW6SbHq
zt&tpay(M$q;m^bI_?kmm=G3dph999cWELa(40_~%<LZ;o^`&WcuOQkj1R}u^W3j`o
z$A~jSC;7SShhwU#Ki%VFj^R*_FT!DHV-(7>Aj+pMW{pT!7R*Lh%E1O=lv5NkqCBS0
zyIbsF4EpHN|ISLu{Z?4-kYnX}NBARzH{agPaUmAva{rIlaENMTvaCJ{3NUZ&pqXp6
zDHo;3v%5>@>{80osM0mGOSx=m->e$!u~9MaB@LSmd0x77CsfUI*kO*2>~RgjD*3hN
zN2?Rg*zPivKdi1Y<6#vRS!+ru3FqqR+LyV%x;muUk@s)u<5p1fyBlNC1due;*o{<L
z=a(fV#R!`AebJ>={5XraN%a9Q5x>gFxO}IT*mqI)&2Pjhc|MlUXf}iIk@QuI&qu7w
zl^zTiqg6)K29{S2ZC3O-SKiF+63>~K-(GR_#AZLJxz%^I`g{iWTkgogLjJJJ|F$$a
zfZIOkWXO^+DLKS-p4sqK{lqZ_EW{UT6E&-A5v?e#8}|usWHwlj**VjNx%>shu1{eJ
zldoX@`nv293_~DD*Fvf@T1)_|x~fxwa&J-jb9Q<5V9)3tQie)WZGkXYKRBDK#C>}X
zBS%Bvk7sMp%FJWLK}lwZqE?OEwlOSW_~Bs5kX&WdS9yt9#!vzM!~R6lc7<{&k`I9+
z;#7rn>X>C&!UNn54fmc{c8f%+huc4qlhCX5rPaw7fhM5fk!Ek|30<C$(uH2wlu-N`
z2~#mLa@gU)zW}66N1pmOsX4~Va?q^d;PIMMu~|Dr=`pYhASmpO+I@_-^2L&T40&nX
zs=HrWJpf`#Tg*~NPe<ku(`cu9fJ}OLHx>47FL_H;Y|7sxIT<>Bk2nmS^t+zeFZ0GI
zl8P9wR2y6;;y)^jQC}WsBfcoo{YjFyzsg_L(82EFFnj-9bo4{bqhmMg_qUfx0yHag
z*=Ya~AsWhAA=v!2W7i<#-^TERciv@@@Iz}dGkXC`6L)d)vP!IWwqp<H?NT2`Z{`mE
zV`p3JB^C?`h^FEBoALHEb};EFYi`&Q;1Jq6?)uCg@;Dp4qG2rk8$fQvBnUH=0J`%S
zuEA6o^S!4gj%U2_%--L3$KTw1+b+ChFU5x9MO^I+A5wi&&j<+Je!7G3jgt_P6RjQ{
z_vRZbcY_VT&CO=OxjnNHig2!VnQbnZO6!=ty~1G)+!(?{6}K-4?tiXcvY<q}K-gYC
z;v(ZWLs5g^mdwXAMuWv9XQ+ANk$916iqOkdVXb|#vZ41+=f?`(RR|FYm|QiTFBzbE
z5#By+wCs2;9=FnrKNRv(Lv5rwDHG9XG^qO!6avt0^o<_A@gkrrAK)`Cp_fg>)0&)i
z$;g6f!Y?N;k4zBo7`yx@LiZ%Y<%xQ>5xJW(EBOE1%mDe5lBIC@SMobrmCzL>Su<eo
zEgcZ!D@(X}3!BiV_DOBY6cj|V5g703RC}lVO>gVS)-6#cPh>*Qs`z$EX#&qKBsJbr
z8v*Y0wm7}be<4cj?RjM*+T)ssXB4FMAL4WQQC3lhY&_D#S;pf>Z+)iB$zx!?<ivy5
zXh$@O8%!^IT4>8D@13(dd*&N=#{uHsHo?(}SjrN@k>*0H#l9hD>A5f*&7ET-^kuWp
zh_i14OAvb@>gyIYpdD(Rb=We@G)5hoA=b0K-SakzQj*JDa<pq7^YxhSX;^3EGdKMk
zj)xwO%82>f@hL6U#+ukwr#v_MX;dNAN}cHk;OR3UL6nn$YL3GFnOh{-JcNLbBI{<Q
z$;ho!&zVK4`3=EWtd(#!moaFfousjOr=#vkkvJ6zM@ezrC!OaX?k-pS<AynkQEA2+
zI2yEua<hyOZBQNuq+g(X93Dde68S<@n8hxg6xU%!+^>;6dvjUsJ<(w`-d*3N#p|?^
z5X%tItm2`j@TZE9sD@VhYUJc(=)0!p{93d1dzLIJIx{r~;H)p;Ac)hwu|c#y+dt!&
z{ZI$gD^5>$U$0}2u6N6;X%!v&fR|$?kYX#^QZTcy*Mc}$%E_r10hZROj5_H5<>hDi
zRlkR*Ki_c2^?b9$qWzQpx9j#yXD4G<>byjQL@H^bwL0M*EAXvKY$W$ylEb!K>E((N
zcio_mv8%zt4MRl_N^jf>+_w8s-NKX-(<(SEaT?vV2EuWy@>rOP3g*+XwfwddGc>~)
zo*?SgP%-2iw`h}P9u7By%nsn^k*_Q<x}=&F2&5jJe0YHM2mBH+V*p1mEQtsYmkCpa
zVwdkO;Eba?(E_yBy94Pu>L^vc8VcpfGY1R1>SE@4bj?v1E?5#24vGtqY^+thVfk1v
zt_|_4os2=`;H-aJk#UpyQx~(ex&oV*b0M<Ll>LDPv=_|zQXx<<&lzh3mDIzBP=ccw
z+Y|m-9C$xY$dJ_UJf&+F&k{1_@Sdd}=3EK!_)7BYcKwzyBWDJCw$5ZUKc|jiimcvq
z2x#|*NE$qomhj}e#%#(?7c5LTlU?GH)}y|1vF)oN(kt^RkkBsbW2nBYfGPT2W!04E
zTEM`BAZ2H%%-8Bht40uW)gnLp{%Q4P0(v+y=}krW0TmxXdcgQ_5e7yYWGDpu&CEIh
z8B6;Tk_wq&v}DB|kMNSC%vY*KAJ$P#NR&)pC+c}^v&{Lr%#~Qq-a(Y9Vnr`wr*3h}
zvt{Q&&4q*ruGH`3n$|r5w&`=C9~YKkA~HGU3yauvOtKpBA5a)!p`?@gN0xlcpCr{X
z6?4{?zZyWm$`Xwu?_Pvh9TQ_OR*pO4y~do8Vz=(y?i4)S<_)%<ig5llI56V;D!R<>
zZ$J<gc`l{PBh1%a%#yutdxD9CxC*>=ykdEfP_7bVhDhq^P;3I=8i_{o+|d4h{ZXYa
zTRM6vM=Og1Z_;5$(7SS+g;c2vBsK9t<U@L({g!&=WoSku)Wlp;wb!N;86`DXP2ktz
z4Ojw9Xmm_BQwP{Z^{-_1CU1|(sMfV9TpBt|&W~xc>o4?dj0(>TUSFY7OAfQ7Ey$^+
zwcLAMN<Qg$MU?Mf^6;pNlrmR(&jEH^sEK~9U-aL~4Jj<SarQs#JZ@8w^5b!}?(`*v
z=Vj7@v!S*L_q-k8ix3Ged2w>cX`%?Nn5yR>mPLiNn!DzXn%!#rYG<i330u7stgQ1e
z{}Q422&e^oxiicfqHa2|Yhm4KBhuGlE@zwV2V5V!&$9zDS^yrXXlCjau~pYB)^(mm
z-2hfCWHa2EYEhx(*pY7KtyWB&K&PKj$4IXA2j$YD6cYw!7a}5{m=1kaO<u5~C&aAA
z8gT*W0C1^0_XV@!F3|sl!dbLXv>;tZhS&Dx6}B%+I(6dOTIR{(T9*5GkR|1IQ~?hU
z^b^TxGxJ<;rfmX}suHDtV>9<j0I=%|d4mKK%Xs#Z^UNZDPRGM0zmBFBG96{xn>>yJ
z$O+7&cm;r?Em;+|k<O)@C6lqNejODIS$oG?6|B!PJp1K>*9(&W{BV%dX63{Ehr$oJ
zn+%G{(^)m>^u5E-R2BLSt&_wxXBAU<%e}cjro~3t2*VY>p0H~81`Y4arBh^Vo%bqM
zFp>+KorUs5n|TVMdf9pEyHVpR<(FU^WxyQqJuhQWOR2`4MXb9FZ?U8L$b{ZmqDcuy
zs`t)EZ=$9D%_bhry-_j)s?H0(opCKy^fO2f&k2csO`wvH9+5Qgkqv)zNcZB}YYkih
z#t3$WcDQi<H~GU4L`4-g4c;vMS>B^*c+(th0R$$#iqHi0rya$gVeS$mz;*@S%g-<?
zEoIfDggV1M#6PT4(FaRX75&#rpaYCMMK)?-$~K+Dw_%Pwo^PBd*U!Rvo+x|EB5P7?
zpN~)G!!QE(>}?Nlh$EK@bQVa|eN!ycq&?BLMs86vM^*#Xmg3=I9T+5{eQzoMvv@&m
zt&+zp1;MnddR>fyFzASEc<>}NES{YGx9-_WX=^rhm4Ze6tU@y~t@>J6RE=<YSAZ~F
zP98C*l2k+mvj3L6O>>OHV5>n8u6}NxTM4bMQA=?|6;E1_$;k%t&N}7gA<kwL6tw~H
zJBd+d)ncR~ji6f?QWH3fu8Daz1*v{OpNIbc<k(>M#haP@C<43HS^^uhRkkk*tWnxo
z$Ov(!uWu+P6>f%4n0EU=aEl5|OM+OGJb!inh}B5GpKUQn0=_4#hSD#>k91Whl3%Jy
z*0vX>L4doILJSj}psQlaO7=5)^Jnf0M?&@f0>#;|n$5LMutUtlA^m;7b$ejBXdz9n
zPJ!tA$l?Z?LT;AHjD66NmazyAy)XkJV5C8vzc$WGFBZJ5J(sV2f&jsc*mU_dX^I?e
z2J;R864fRQ`Su(Pwm{df?C^c2MA68391K+~htAuz%?Zu76vjGB(^$o`T9*$P8+d;{
zuGh@p`lw1hug*65Cr#~ew$JtPy1O6s%+Y(?HLxAixh3{f+k!842?Om`k(T-4IP88m
zWSpEUlNGaB6*DP3bxBd#TS5O&j5KN^YbK<3TCkGYkVSk|@EX~7<(Gx-b==m%9}Kya
zyfqm;33lTtlxyOxlC%;fErAdw66~46(V70Em}A<bmZ~L7Vl~j(+cJ#QQmoVj=m~sB
zOUyTlTFidel;8LZ4kcnVWVaGRVtRg1m_0t4!6v<e>CI0hDEgApLC%_mopX!zxW4SI
zxwV|UR{BLn{sHn&^Mgu242Srj!6lu1<7!*7ONtv>5xh18yvRYXYIFN13m|^mXBN9q
zS~kBrZ?-=Os-N4!S`D89?KUq{p%CxZ7b73+GTRNUL5VI7gS!tr_d(})O_P-iKsfLg
zig!2k)keK1`myB?up3<N9>V`HLmO=v|0L6J*qWrdkf&!~hAxk%xcdAX{%6?xnz8Ne
z-O9IbbaMkU#0{iUdeyUq3?+r+J!It8=w5$=_x$E=cY7|y(xW(`q6FjMn-<KxIjZvZ
zM9-z*{qco=9`l$cM|erR-qIl2RMONiFC5iKhj>l{hu>ow4RnH)+Yv4Fk0DjVFV-A#
z{KD?IIuLJ|tGb?Q$P=ppUShmvPctW>Ejb4ju6M8Gea{M1nPd^o7N9=`el8#ikQJTu
z;AC|{r>?k={Nk(k<;-Kd-@I&%AM{*=*34Xg7Zh!VLiB}-ccqv=Xf+*YVOKT}uAe<H
zCS8KJFN({Pc|t{dXOyBzX$EBlgH$kSPLG_4NIgCnHDS1#8ig@!CCijzU`o6j`C1rw
z*zQ3de1DiT6o$bR-`4620b*&c^Mqt5Gfi7avF@9ZCefT`+pm1a@Z`v(bX{HQ?+@Jq
z^OSfpaQBQWemzf|YWO9d*3vvz%x%NtyHj)Jet0qb2aK0DF5!3ZRzX=x4<Xt&u)*7?
zlxu&l#+@CmNds0t7+09Ppdb2bDlVy2xO?`t;l}cJki{kY=R=cCMQX`(f%D1To9ZzS
z1b7K@LgB0!tgmteN>NwA%R5<WVSLO&#qJ1k_yV(9zIJYt|52N{v`cZ9l4GX>p1yB-
zZ8LUTs^^m*R9olO-Dp*-IzcJ_%k#F;O*m;^llJZW|0b5qs4qi>y3quDJ-Z#u7m)DJ
zi1#ddm>@-H3oDbwL0F5FFmozj-$s*DduFkB)KO!;sj&xjsDUpd_SWa(5u^n0=%p#J
zj_s561qo_^FQu(*(S}DojI3pK5YB`&r&-<g?zwG${tHekUhc;1WjhEyTUC5)p&Qje
zBM!}S!kppr#0Tb=QTcIxT}KdVi-)L}IfhYnkBgJ#D^0&WEqe>N2JFJxe8K1EF_5TY
zm7y2A84eEAKuI*?HIrQ%+$6dL&2Af_+xNRSsS+W*?7m!KM4c}`ZLy-`X{G&<gdm53
zd|J(hhF7;V8%xl|sabc-Mf-r3NH+?qJ+anHvjd)9X14{JR>G#FA7lwtF|<Ky8mLN(
zZ(=r;azsnW(u{F36ccM$*VSS?cNt0%n)xuu+IBaL|0T<z^s%P0e9<fyCCb3t)!UE$
z2I4CU5nhRpYo{aO1Te+QiLdL=l|1Ffj3+6Tams1u>A37P4;go-ATNFum9|;}{;FN%
z9?kl?Yl6;${Fw`tO_4tFN5-c>nWh0YW#6v!SP6yGQW;=*3>(dJ{%*qH9?F(BKgX$%
zkKlD@{3F2fH~l~*ttEunoCO~EA9ju}pk^F(cxPDAJRwt%^<^cDUF)yh@eOf!NM?&4
z+*gN202uF_nIx?t6bP`z^OqqH^pz2LHW=2YP10@1-KzeidqbEop@>2&(6up*j%PUP
zGe$iEXaO|~K50!O(UAqRT0XVDa{B2f{IU#kaqIOk6X}1gkb!BY$?LeHBT@*r9x*=d
zI2a;!r)`}Pn7yEPB&d%SQCPEIqIm97K6T{M0jNy3FCO`B^>qsUSeJb&Rt%ZuNJ=Lm
zHm5+qTt`U9nf8~CEG9>9;~kR!;i9~P7R3GKLA`y=cx-UDD#%U!LTO6nyP`R55YY1(
z`euku=0@}N-y7D}7IzlUTFsJ6CQeiClZV=W;EVouCG11Syg_9R5#d^_NMMv+cRyGB
z=o12x1zHLs%~dk;9A-*5Id%uLVoQK~QkxFf5ywkyr{v{2;lGA^IeLr5#s(!wO-F0;
zZ`GFkN33x<;HTq{0--<xZqf}%zcD>RN2A-uMzj0Hz;&5bpW~G(gw0Q2yd7bk_T%4v
zIglyzn$`^1!SIr?fV1d({$Vhc@g*gTF2x8F-CO?dIRC=cwU#Eh`D(w~y^ek9V{Y1M
zReoch{<Wus5FMa1M3DPuDzrFBO*4<*zF{u(OFYvQ2ZMUz17%fbmT%soEJ=fD*Y<2i
zV-?-045BcD|CTpY{znn6D-5gVn*lMx(dMdT9?qYZs1{#Yoms8Pa!lv)UFX{KJrnxF
z%80wBsV!r=rFRtTyrxppnN38f@HUCzv7(S_@RT<4=s3$`x!t+gxAY+Qg;OKN&+$QO
zo^n8zWFHY@SpOw>J~eMC!oL)+Sra%ga;B0vO2Lrx|1O_jG05SZ*|&&A@fY3|6;wr|
zf%VKuHh;w9O>tqYl?@$iQ*a#Pi}$E^-bMBH^iJYs_j4<yC)!*&RCz|@mE1v^t~zfA
zUyadfAfGE@^Yo6g9%>2L>%5Xrh*U-BugS(6{^{H(CcADmAk8@h53A;c(k?%*ts*sB
zH|;Q$(s16LC#yf`cdqLEl$o;|UP|OaYjuD|b12<1;i^)ce~ypJ)>xvebaaKp)ABAZ
z>|s$8<eJSH#u8*9{odj7k~%a0O=RWM2(8*<Z(V-;sm*V3_dH*ULO+K*IO_b3_Hfpd
zRTAPVK|SKXyLMJflIHgP`!y>DjlR;@?636mh4!=tA%7=)lD0!O(d?JrdH!7_`g46y
zlDaEUEr{YAXOWExiOuC{S(|hCKlFzvDyqW617lTKT~`@hJnhM{VsWxO<P5KH^HA_h
z`CvXG2F;(ZzUPss=Bv8A*fO1PxiZGm+_%RH>0S*t7|`hREG)9C3n*6NEV<&=+g2E1
z>ObEZXLU$B-qZ1X78&4?yt|d{ob!8LPqcbQuV{gdR*TNazO?)0Kjy(r1u0Eg+NY93
zRwC_pF*>X+R6To8ns1DBb^-u^H(jcPofQzat6Z&2(K5Zl(+71^;;!=Tbt%>~)Q3sH
zoH@j$d5wyp;Lp=1NdK00imKelsmf&cP#w@~<LO^kehXw`)lL^CgO??WJifF4j&gq*
zx@W92vxxe;gImN{T(a`kYkp2{uJ+4Co7ERCJ0JR|b})EYnc|RlNHCuwQIdyAE_JBO
zdYn1poK>@MA%jUR+Z3UFIjNVuNv38nHrAgF9(+c9{0psHkFZ*%8y;C^vw8uAR=C%q
z>j$Trl`iLa(CL`a2jKpn7C17OdpO8u>p^8c_l4BO<qf{FV)Y0u;73)db$)5WTJyZP
zG%<IwBx{#Z(GypL?`0a9QzgW4fFI6gj8_q-%7%Oha;<(#Mj@v*SSJ4_O=k-0=(3Hy
zxl1s~HY6xll(%xnSpt@KSWREB&adC+XwkwnEr|Q)-n%vieppoL^N}vwB<k>i$okw)
zz5eJRc!O;T|7zKf>EPkf*k#(;s$)hhB*|FU#w>{N^tr_xV8)ZBo(v<|wY%N+9Q3mF
zdQ-n`EVaum(#`&kd0Fmci0UBQfdrQqU(#%tuerQ8=b=x6r@P7aAKVl)9j+A3+lmV6
z;QCtuXgH|+yJc-*)tI-p;sUcI7o@xg>`A-GipalRr`=+TDA?^GZarD~GH;R%cr|R9
zO*TWu`DI{Zm|zR;8HB#s_O$R>kmOqz>vs2O^xBScPW}CVTG%_G_zEI{Mho)@hQB0R
zOdU4M4i;)f*&|6g<eqLbu(~i|MaGdo7WL`}AXk}jt3>TqxJL9hLU0W{AcZF7wWcn)
zxFSsU<B^ZzldVwp^x&UeryIM4Z7czT1gs#xWNc8kX_5iRbssS@Xsc+x-Sf?G&y3-L
zI8Yeoo1!QeDL6UllwNUp5KO+b4p5O1u&ckVefEZwMnwa5;qKGIQowB=z@uaq_JlcK
zY%Jy|>P`Lq&E=4v{_o$YON=BD8Btw1c7HPbNFAz!tGg_^@Ob6|dV^-`v|a*n_M@@x
zAyuZ*rNXD>abZLERz1z8e<<X!l$+S$&>xA}Z?J1~M|dRUerpzt$i3pX-;=pC^kT7Z
zR4StA4(CDr&|I_evm+^GlU?yzE`c>1${MSSMRCR|A*LGe$d9<z?Qqizwut#agGcTx
zVDAJCnG+bSV5rlG)Maf?*ZT9;JTya@Q>i`!5_);h_ClSDE&eXI6EYj68E2GeGpp;C
zQ@+;RZ_bb^=Yu+#n7+^?XOb%IruR~04TQ5_A1mztdijENG5bMleVC1bj4C-ClwXhD
zLop<U5Ear3Bbhdn$0}U~+bp@ChGPs>o-3~i>3oq*gdvf}$uCEGN8V2{KFw3rz%fZ2
zM;cOHk$;hh$Qz$*H#c85KP|V>(=z|~6T5m{KLH0^()dgZHGlHhkT05(x&>w8+P@|D
zp8$}z4bnHTnojt#tTV9D@6XT6z_0HyA2P4@sLEF7EbfwrByK&bTt<LloII<1ME$}(
z49MBONMugdmi~WP06Ep>URl`*X0{MTmT#OM^-%=;^Z8F1XLw$hhpAj{6ez^<YEYX|
z8{;s?yFde5u!%}LGg@Q@>;5bFalcw?T$<xV$&jZ&>r^<Zgdk!Pgvno`we~9f)lpj5
zz|?S!L2Gi~eijy+y6z<}`KoQ-t@mdv$&lar9QAT5ktn{r%v?GTho;VSq29R0UCi#X
z(gw>s9!pwPuZ@L#8!3QnOJ~CB%*Db#fQt6x4_3V^ZZ3=)RKfZKeuE5CVHAz_p_))M
z*XI!AA(d631Ur3?Gv#m@k(jCOTrR#L5mT8RUeJ!Gg{4cf2GCCyD<P%j!iyr*7@FI>
zPNjbe*BGYgxQ<@|$ZCI@C<jpz8tCwB3NcOzu9;S4Hc9H_{-Z){W1^%=e~ly#Rc(N=
zuWivr`eX4Q%iggO$p5PGKWgZv?v~>T&gG#{iM&5r7Jv$nMs&ILRfTbtGZO<#&<hKq
z9DoN}b4s>*nUolLNcucU*O~-M!Js7xg3z}{^!B+2YhRP?zhAd|oXtaysi`@a;|7V|
zCRpyBFSMK7cW)|Ywl~kI$V{o{P%Y;f(^cc(ou^xXKohSGci5E*W2{%4zard6wRswJ
z*$Q8K`1t7KfgK_%ES9^O{tzeUVpxu*ohF$oeNfQiOSKT?iz|zYjpsbM*<=C4*ygI0
z6T9gM+u0^xW$Ekn{TY$A5wd;Cu#M=<=HuASc3GG&Ny@_=Z2j%g_M(U{gWOu)@2$~+
zM*&4J%d^5f?wqSNW$Z%k`DSikIaJl>e_Eh2sq{>hPf$<xgWeb0^4_<syGZeO77o5e
z?aD>r()-sIycaf(RF2YXn7BEzI(;XS(4eysWEcaus$4Fm<{a&)P)Axp8Eh+~>Y-Hm
z=Ih9U6naeJG;FT*akb%yr|omQc&rjr39dXG_4>l`6Sd9`8P*&Re*64Y_uFydA09_W
zW)dx6hp2zlR0`65Rt;YP1jIS(<Y1uY0_FVoRR0yuFGK=Iq0l~aP{z8*<BF5z2<$R4
z&swMgGJXt`j!1#AOARxTXG~OmpgLPJZ^Dq(?2#VLWPIm@LTQ?++J5JW6lXF^agBsF
zLuvtUg5a@EksfJ$(3e4bTHzNDHr4NL#Vo2iws*XKAR)(Z)uC$zQ<lT2;A*NpUM*Eu
z?(U$;%N)M^)whI8X;KuU0kA^G0Df&Ss~YlEu2>#LPs<kCpx6&lio_QvU`b7f!^hOn
z!XZ;(mBNjEy(c-}+4ep2V|JPR&_pX)V2OkK)|oHU7s8$8J*dCVBENm8We6$jaBO=t
z)BQ!uXH8i~Btrwg9`9lP8gg1C@F4J~clvOdR=+Z@^TSC*c>aucba?lW=8S0a<x%r3
z4OvzD7uJO!uVyK3+D~-F;>uBxb0Od=UV_7{<kuv=`WRsgiw-1Y1RPbt=V|rb%Y!pB
zD7MU>a6uZHIqcLWB?j92=32v-iM!4s&AxuCKCP^a?J{|a)T6GgE6<hhQu$hOQZVt_
z6U-(a)jsWbCI+>ZEayI%`YUfmq^i~%L;XE3<=8BDZ6kl~p=J<7coCM*JUU(N_=~7^
z=3dz|AQrtK1+1$$GPR$#AF(|5dS>k;IQFg!^C!r7eSfiDg!dsuU|z&yRgcuCf17f6
z<h)`q+~@0E&sRJy@>+DY-@lxY{JBR-8tHBk0FHZhrF$YB$qjU<QZY2}3wcKQBKu+d
zl&rb!ux`kectuT7XZk4OulvhC3iNo5T=tV(uho>XX`V{e$YX`A^A$>2iB2y&i==Lz
zp1Rejm*!mf_;rrh>;^%e{+WdQSaAh6n|^)C$bSEKZKX-oZ!KQ3_C?2oeqr&-^!x%J
z%F-T&mzCAyqCmZ)NAXIatmuf+C_YFWjrR@OkFIMKH((|GeZZ1$<nj8PwBU$ROI{jD
zPe0*jr2HZ>UbrIw@BRzL;w!}<OB1o4MVS{kpSU|A*2(U3F;Q_YGHFh4MEH?V8?}`p
za%;276(MgiKVOI(D{)Uti^iEW)F_v~8=NMPi8<OB4nQ?vsf*~c^_y;kTpiM05atgu
zYabM9<V58WBGj4=;Z70ajITs~-cZ=ulu?r~@b1WzQk|me`qO@1s`<z!&XQ!`cq1g{
zEy6p>Gc&kFqn577wNEaGm`92aCB17C;D@r6Lk(0Pdc&Yc90n#_xv~4Tj)d&4y?Agq
zH#{SYmNXAWXGBJj)8$b&DLeSNZDm%m#wWT$bx=q^Gp_#C(y%g2FB%(!i7XYDAZN=N
zA`3=3q9y*``X;3Cyf3sp4+rI!m;{brb4^&BYLdet`=*&Zerx<3Y)RnZu975l{eRAi
z@%^|oo`b{bfq4f^YBUbFOQKt^<g+Dpr}E%mJnRbOB`F#U3ukDVgc44Ty9hW27(&cT
zxn_j+8;YAFzrHM$vQ=D48w>-KO%%ok>MUKhNYcZ|))KeI9@~az#d-EsxO@&Ww;#vg
z?c2uIiYwVdrn1ZfY`*b|ef4(u$5=jUOYy&8KyaNPqw`U{jtaINFsqL4kMUU41CV%6
zHoQ~P9*{H17n_yJ{s)Y}qQ_eh*F~tYMM~v-qPt`Bt}e}OwiqY>nL5YBF;xnMtBrr<
z90XC??g{R!^Xv<9tH9V<S^M%6AZWq0x@>3MD!;;}TbuI#{GC5rZMuOw5)u<O%feYp
zm`VpwWQdd#9=Viv0(J&Y0X-DSJ%V$iKQh7_;b^+`Zi)6%4J${%dQ~`4Cqy(+KPLH{
z2sh^iz<}b>z($f5J_QEoFh$6L*Pxf4{#hR`P?tD}?Jl>tYwj{jd|KY6r+OK>yYTNg
z^7*c!E~^<5g5KH`Zi_~0NvLfuXA|(tD^M!ieL}(aaaaddI7q_j8p1Wu5&|<sOHXOY
z>*KoV`Q;4za%I}_rK(nmzA0_-e>5*IWZO7b6k75@YN~FPrHxw@OUmg@(>NPx{@fp}
zFtl^c$=3(T{%5fFc5{G%HvqjFW;u6G2b1NI;{t!f8%yuRa24vK4Mt7#&K#2uUwNW)
zr6VYQ${XkfJX_hlY??}GyDUXQx|5cL)%{(r-YI1vUliHql^rdy1x;x`vrSZAP}<*#
zc($HhQEb5@kwn$z@%rpj$$}y`#Uj~1$UhY=AtB@^XkTfPofgO|_{-3<()}Z6;#JHI
z6YFxbmaoM?>bZEQ^Is_v2T_q5STx%++6r@fM!K2Mov-xgqcSq~IrPxs<m32we_-9V
zW<~G!fiWBb$zG3+2wdKRk#2hu67AYI+o3m11#1zK{c{wHBoE8}rE!I74<uO|)OZPz
zx@=6Zcc1_Os3MS(YK$jR20Z+vR1Ay>E_|!|MMq4n$y0HdL^dfv+PtrR^hILAnPF>w
zvCQ!!ZjPSsbh*NKl?nppb^8J^Uf`RKl!hH+??^@R(qVaB{sHzov!7fN79;;|tpD?A
zVeQhj{bS$KK463J`@sjnEF@ixWky@VJ_o*Jkgv-Z<t)Sh*xW{$*h*P7MboadxL0P3
zuTT?HY$}5_uW+VcTKtzF-m*0KN*#z8r|QzRl(MZ}?$tSDzOR|nAR|$06O;m^W{xeF
zJZJY3C2{*-K;sGGSqJ0UAL*xHU=4#>t;)7=P5#<rjkLJ&ka<vh^rS5P8oSw_PVZ%1
z!l~nIm7#a#T9v4qKDyei3HPzq?DA!1RFSN8$5_9vo*s!^S}i$9;&^t%M4vQJnNJP%
z@|DFga#IVvs9&&S@9p)EAvCIasTYv5Te{3*J96u0pdhfXm{hXyk}@3`*jqI&tZlKD
zji4vD#HRl;#nyI&D$Y*t{FpdF9);=R!9$n075lUgF~*8LQgoG&skRzu-oe&5O8Awu
zU5mr+(V5+I%SWg%@l^6swv6HuMWFY`fny4$|M{f95k&VMVgbn{Ux6!;A)8V0pO3AQ
zb-?wGRsw3dd6Ac+Jl23vam5^(T4I<puiHJVw$4HCbc$hN`XzMX8?Z{8mZ|k4dDl#e
z3jvM1o`ro%ZCaQxpL`-zp;2sqw_XlOSynNlXO6{L3%}z7P5);D-<KT!Z4eAVKkh<8
zkuWVeK|&osOgw<;3&RmZURi`me(wn1hy6EsSHoIVbNA=5mz-Ze>q=_MpTW)TLGco*
z@H{8<EGq-Wv+S3ma(#q0wa$CBmMr}fX<@cKH$w`?XT*b5rKyKm|GB}d_cpj3V^rjM
zCcFoZJ40NGA_a#Z@H7)KdcHGeJ|19B%M}mKjf;kNpXgYBx_*6l=X>4|Pu$f5(U;4q
zO6AYY=c6^3iu>GOXUIJovDMwa**hoG1PC!s{1I9zykF#Vte@xzm3D3AF%^6;z5XGD
zmlbQVR|jV}uIP$|DkI(W6_+q%V>qwvBlL>)+KvD(yOcjII6EMY^ImH=yE^~~$XWMj
zE0*kH)M+&^2qgYfitilAT&-c9mj)=Z=Ou?nP8?2sqVEs&jGL6*ZJZ3Bb;cd@yT;9s
zU%2SrIL4%`&r#$|iW&WW>>vCgm}9V=;ekID%(b*G4F1#tevqjUKI6o-8h85s_)Wav
z9?Eol_~1i~3h3^5o$kfY_1B@7UBe9@#s!q_A~PQHchMn};lJ+XEr+FG$Bk!KWh>^c
z4aUt!8DjO-FMArilHMo1zl(B-%4zp#{`F>M@YsLlul}1%?ex__mnaN3(~LdSCvQL7
z7Enrm-I7|C>9WMd_dUwJX2x68^-*&r6q?c*0=xVxnw6&L2C#ihgcsRVTmtJDJyza7
zMiIHCSjyL$bbs>w3Mk;~K0*X#nx|YG8@-r!XT(w@*kY%D(KG%>7N^YI+h{zw_UBfD
z+aUDvguKLhPkuVHr71~;2y!&WGo7s2U*G#C6WMk`S8iB+Xz<VYjJUUnej@a^MUMWZ
zlxu_x1b$Mx(KKbn@jSDIQZ`E7E7O_xJ4Js!9%+F@+q*BTe%K86AlAZh`up5BoPsaj
zSR_`Ds|j2tf={Eyzl}Sl;zP%)t?EG7&WY72KW#CiaGJ1IVduPU@x`hCCT^KMq9yva
z7SjzGz?=dq&MN&K3FuM+eHL&ALJibI<`K|bSn=)SEyVLFuWFs21g>+Xz!pNSLL&(F
z?$jgzuhdsT@N0-kRNf1_Ie$-rK9&(ekzlXMdHsV?#!odjh&3z*n8>E&+`Ik>FumQs
z{XZTo@bVQOH^}j#I?Iv7=5u>xRceUNbOpUMloH1XuzGzx&kg|+YIa9jBzV827bfyP
z)9efO_R$P03_Hd<^tYOgcQSQqoE&1)wB|(rdOAfkMdbzVLZJShj_Wfm!W|&qIe-YF
zpCmhH$l(9#E4c>IF)dAC6Xm6LJp3BU@Z{9U?U*d9oR3y2S=#1#3Po3h4020G^+HR>
zvCEN_CixllrcR)*e%jak`X`X%M|A;)VBS{`)2akyo^CdcrBrsLWGnuguXO568sm42
zU#jX<w?&i4c{UX{chS86^y%m_R1CI4+fto3=TB`1hx*SdtGRz5y*yGU@66b`@Tu+6
zX~?g31m!`(C&EaeesPOJXs(}nVO}&bdGb^9-9tUJ*)a(bx;Pa6(xOYDiGgP_X575|
zX|ZNstv+lz$k@O>pa1kYUB66XE&AjJseCT*Z*6DBeM|UlylMBOyaKrJAYpc&kL;Ou
z+D53*Re<Zf(_X$KV3KEOXa2HVUvEnP5WEavHAIRD@ZwKb8+(6lZM9)TVX*xv_CMLU
zS+;#P62+o~!D6FiDc7n|bbqp;nN+<To}585dHLGsv8Ut;{zGP~8o$3F{c~xBZr<c_
zTeETGHs<Br`S~w%U31cs)|xa9QvUAvkL+g=JzX}{4cu=<%H{vi`p^$$cl3T?#l@)7
zK5%XXl?!?j*5PyUu)LN#iU6)`24bCEpMSw=ZkY!vAF)H;^F%>|^&h=H?Y6wVbkTa1
zDCBH5ZD?rE`nkuIdxPwIB!T9Iwt&sWVaIEJ={uVS{}1(DkpROzXOG}zvijg3-a`@_
z!>D(LxlZ`4DdChEPiM%qUIvAV`@gn+4w(p-{U9N7uERn;kj~2<n;F2Tw~-c%#kURP
zi-pnN$A7P^aXYFuKu)6jHEPxS2j!k6PHeI@SSPG{p>5KzJLveg<-~Q4r!(@b|L|Q&
zqT<H+>cxvdn=z1YvkiDIvOsj&Irr~>=r=Iv#h<z*Z5p>LcWIig6R{w1+hZE^>x2{h
zNb~}CNb=uM0OC4IhE;Nq<~xLqSWOAl`FK>?zgcVWInaTSq2!BIMhdgSjujDQh2&4G
z{nQJaC_IKY@gJO{^)$w_?h9M8XUuZa+|%3)RQ2vJT}G$l*iRF6RhCij*gtmve7FaT
zZpXgDr*#sFg-t>ZEzDwq^+|Rd9fHu#xpxTIN58P6*sess|BDq&jFEoFe<|<~=hba`
z7Y-amSdvtKa!7zLQ>9&nKa`9~Tagf1CU=74m|nlsd6F^Od`$-z@OU5oG(H5tb(*~e
z2yJd%tVm9?GWB9ffC3XPu}%|HYF}CRp-f@Nba0iNfgcpysZX6%6iD+yFZzcbl58{V
z|BWdscUmr$tUYo8a~=L6kmDh7&FIhcyij!vk=^p<__E*{7dRKg%UhhBjkIT>(78mv
z-Y}0j!Bl#?x?(E0MY&rmrw}wzZ6#U9t|mX^uWMr3bJ<#hJ%O}*%skg`nuLlvQ?g;u
zvUCT;k2e-wjl;#Le>!6li<i!d-oqOLwkaR##0F<sU$FIdDJ1bl2Ybj_<lU%r`#37E
zJMs4+c8aJ@I=TE2Z^^71KrUn?9m0ibQUTOr-D!f`I?4NxzJ!a@?K;_dIeYRWJsqCQ
zD-6=MDbTeu`GZbAP8d8XzZve}uyT4ji0rkASzCF&902$-UJ`;kYfHuiDtiO1RiE`f
zKJ97P#TX3Lb>ODVF&x-xoAXSq$j}2Mjqa&^O3b`PuY@<ccitK0AO1WLGcx$mJxTZc
zGhwp-D+mEbjlTNBN?#bbqE-Flgks~BU!IT0P}c_%OFj}}Q^$M5La3(n4yWQU;NdE6
zZ#jgIIRAtxM$y(Ul6_x9>=yiT#xD}~i_`8i70;ZN68fNPqTlhc+JS8(#w$C5lCDmj
zruM4k!#xdPf>sE_6SOUG@+NwFC&=zKO~qL!vnGdx#?NSI<qI^cnD5+z$YMLhd6Xx;
z(TTZLH(o&WWl6qocNr~FqC!gEFXlz@#bkD$gkMUVr#j?`(puddBWu>11BA@|={|Sz
znQ?V|U><wkUxX{iq65u~)gi9-j5@lEWg+CDvdUbetIr~z3=CQ{AsG)xL}gi<%6l_y
z@<6A$xX$RoYdfdXG$LtZ3(Z9Eri*CF5nrp|gJt_LhzYzNw0W-`r?STWYa8|m>>M?b
z!B#yd<mR<0P(4H#55_vv`n<+<H%i8i%DB8lO7y8!J(mlh?-~)abitg6ic6fA;;cY?
zY8_jF3s$Yh%()=C)kJ|pB@JY$LWdysmgZF8OygQRRaZg+|HG*=6m?>5&pkW%q~X%h
z+sQPk;SuTW`Z_I)vQolyQ-_L+BqW0^b#VENxp~5@*Q8quTTj1~wX*gYPIbqy>Vsjv
z30iV(*dx13-PB|<AwaKT@I1M{@u)s35;!4ldGb1~^H+Z+Ahcwz%A^a7e*7Wn;`G$s
zdVq|2`)Xje0B#NQGYsJlnXQ_>0;EnTy(+C}(?=2E64_7lu1E=d71yq;+AEyEyB~4B
z?iTF)H+GzJ^a|bVOZ^N0qm|dN-ZdAUSg|_EiOnX9x6QWTNhk__2CpIAXyZ=WRqb|5
zDdV|^0EUpMuVTj3t>$YTK)Sh^=Aa`KJU)k@x;OQBk05W!6X@B(XR5cBKk0H>EdDC5
zOg#Kps{}-I*1)q2dF}P>e}duPtSV-_qLSnb@0EpdzWsskbpVcE4I0J_0<`)f;$5+Q
z(U6SL{k9+y6l`FWuu$WS-GMuL9ZWBFL|zR(haRf$$gJh#Bzy&wQk220cxt-`qBMaO
zaZb~Y3XOuWLBvMOk;+;m-<jyK(f{cI5+deAXQ6lE23gWHJ6P&#Sp&~2j<Tg!g*C`!
zW1aaLQjKp*dU^I_*{!q`CXZMn#2V@QJZPKQjyk;)V+^OowPdn&^iyV7jT}!WR=Hd;
zwqG?mX!Ecb`$$bP^7aihZLUry#%5LgGmT$k;srcG%QKVutz^-xV!u*WejfoeB=ziS
z7wa_kY=nIC^5Cu`P0&*{%sU|KQ$D-$JQk~}S<<?e$A01A)!6H-DPN^zHu%vpeSx-o
z=<EA(Tw#W2&?Eh41nKRIZ4SPoWzk_$1XXL2N)1z(ioOj8uZx>BE~a!9%5_>^FY;jt
zt?ydu*Sn39v|0#D;lV{(ds_73uGhK!fuPQ8%tnE-!N#r`3E>s&xr;W+MbiIessdm~
zh2_YD3ttgCjzEF>k<|9^x`92GBVan2i;>O~c^1VENK~CsUr(EVX#`N*k>SH4zM@V2
z=!JE}gn12lXb~<GKujygKKE^QQ#Rn|I98(V28Z3|G>N6OF-5tHr8bNTK9q)?AYt9h
zKXe6%EBj!gDTw=-vrr6kuD8Rj=<Oz7nyO+%Et^m6iZt@X>~jlGqyC=7a#gMf<3*iT
zq_~8KYHFQ~Oi|E?LY8mtJDuL7q~*_kBy$2?bt<ZV*m5WEUmr&^scMAthSVMDAl3VS
zpGLa@Mz62G5J_UP*7K-ve={4?78Vp(4EL)2;$J5h`;>YTYcl=0+JR?cX732MeKB8C
zVx0<e)`ropKfX^O9Qr4NCSZKXLxP$$zE~ubJ0|*_2+sc=){}9ymjhvf)z*rMF2?eM
zihu$IX(kn4Nsr-lC2~0}^1QNzZR)cVa6PBd;wRls{lNHlYGP-I>FT`gSEBKqCiaY;
zaJlHk{L76xWVq&Y&|7yNg)#4@OSda*cI7_cw(y!D)WnSB82YQ~pyCA9?T7iGdAz$T
z5!5d<L7Pzd>(mHzq@m5|`gv8!YSiO^#~XdBnu2=+P*e_IM7hGxk|j-@Y5A(yZuId2
zt}Gp|g9$fZOD2J4VCw*3FC5mPox!Jy1qe5Q6=`XY8sVEF$dj8$_YK&6D=nQuYBtv`
z@CQ{UZT{8vKi!X)G*<T2#tR|%NTUmBWIMhI?O8pokMI1^pR6X0Or;pwxQXT`LwMYC
z_`PJ1NXkB-A&9^0<6wL&B~B=4zBv9B9@6*X$~NZR%3$t+99a7<`52Xqgwx_wXKC_I
z7&4SpQIx%oGr~!9ma0M)I6e6Xy3_0S2U5}R)#N_l3`pCKWu}=PBX~;~cd`j&l_c(Z
zL3dv6h5BGRL43=K_t38VE510(j+StGCG{wFWGjL^#JY8y_zOOH$>1~}1DdQcrIpVD
zbgTEKcy&U4cUL>a`L5^WI#i&Q``<RP@Jbfl1+C%vs&^@=JB7IX7-=q<{Osw=DP*H6
z8R)2@_m9wih`U+EQ3;ca86z^nwX2Cg?ll*?%*W!X$T3s%KHY&GQ+729;r`7yv^0V^
zIdzO(vuN!@nz-r}>vS<w($?s23c7!w;R`rDGOU|wyUS6RLObO1(W6W%pQLKj%y&+W
z>9YkQfS!hD)JL>APe~##)=@pMU`a`)?wJP7AKQ!11BLo?ifTSNK1+YgzbBzaC!==Q
zL~u{8r9t8el14>y``%JKFo6Q#W+(I4kK<5Ual4jGUslj+er=#FMMyuuNq;y3^}d63
zQnS=EiXqBrgh&sTRa~X7Sz<iySL4p-sWk_xC>2F6R~?;RI#h7mdB6BKbXt<1_{CDp
zC_Py{6{@h@(flzVbKsi6JiNnFr>e*n`KqMiL}+&4PQa?xOPY9ZKIp+f1HJv|8#`w9
z_=4RozIfI4LtRte4)3O|??+MA*i)k5H+hs<aM`}9G~oC&m*IpBFk3CO5n$D>8I$+o
z%H-}pE9<f%5l2p<<JxCPC^UJ88NoON%YI=OJ5B^@?cd8DsU$Ze9YtPe!Nl(OJ|*tL
zU=$hk(FpbAmT$#GUWKKt$G+mfZPLz1iFv>1HAk@_SA~x7cVWngGJG-?(LBE9hu~WE
z+@M#<KB$UBVoldmVjQ;aV{ZF=w<9%r{{Qt}3p&<H0WYr9-rMU-=JVSfWdB&Py}iBd
zCSqie&&qk?C^Mk8LY++<T#^wg2jS;bT6W;!&<RR2xpDfF@^ppfYb#s6<{Hmj$e7H)
z?O7dtYML?!$>nUr#M2fSwew-=IboxCP-$S9#X}PC!90XKXV!gJeM4*I*MDga33uUM
zyM3#hlAeH3s8aOsatNaXrSv_!FmZq~-1wbk*SYD>Fbn#lqt)N^bb7q3V)3!Q2_afD
z58+@%6-jWlE=mh-CKNXkSy&!5IlUoWj+|R|g8!uR>+*}}ruoNPwy+13eWK(*@;dz*
zWbKw!h<!#2`aDRVMDrDM`u08Up2zL}A49vYNagm6g*)P&gKz~prR)`;t9@;!SRbv<
za~($i$0+Kb-hB0Hs49!80hyN4&>d(^xCX47C*!=%UznzMq>e4{&h}p@`4QOP-Q2j0
zm->C3Tcaa^PhY@ez)P``M*<W$u5X125KH}g&j~giVJ*qfuV-y;`{=UD+B|qQCRJid
z04*FW7BS|lKH>zxoYfhc4LWj?@dltC<?rA~LKSwIY)!ios8Hz2>`UY{e7V}0Nsu<}
zKGmS`&=3CsJB=OStR7ZSV{xQ4+u-^fqtgFn0VHItj}VFVpR7}t4_e4q_-a(SU@14>
zRYy$9{YA*;Xr!~OA>;jcO@iuAps@|S#x8F}2ZMCo(1}3>+qoY!Mdb_6HH(<N#~ooR
zI*-Wlo@`+NlIKC=QZ^_bx_SfF_MD-0g11lKVm0{V-mHKhSWe=v&6<d#%!ahxv{vWn
z#jT*n98_a;M>HhfEI(`Tm8(Yg?_4`|ejMg>`Jt$mWj20yX_FNo$csEzB-k1$&6=C%
zNGYU64x~S71r^|J{f*Z4J-_;3>T0}7wXQ-jW|@6QC-|nQP%HU3XQs!s$cl=lJ#l21
z;SjE`&?r<ZQQ+d(Rjl$>nvA^oZ8p;T@NmQNWxC_Y`zQbAsvEiop-o)hgOWwJU4$kF
zbxkq~bQX|-WShGjm#E}$odtSjYuRi0<((2^#0Xn91XxVflER^;RRvIZlY);DuoHN3
z>t|t{JHeNfMG@)NWh;fc6Ph=jQ9`6U*i3IJmo%~QVF;C^=}nVRE|PH`8!fu$9QqM*
za(;JNZ(fqw!&H0e_H_O?@`F9w@y+2%VpQXy=Nz+$V0mi%)4Q9-zGtIP<5><>pkj3_
z<T>s??^DC<)OTV%-za1(iU>q!ag8hmcz&1T=9d$;%1yxSaSeRy|8eEuovhm<sN8yE
zk3<el4YtCkXBH;((m9304B}VnI`C9*iQT6yqsy3*`GD-i;%K+%8<>w;M*l;Noc~Lb
zE6<;le+UpN6o~#LRP*#0Pj(#Y44w(|e@iT_Q2JCsng77Ze@wf`iD8UB`9cTWKABXW
zjZ%goODdwHn_#qnQ+=EFFC|HoVJhKjKaO@G#^POT1?yyKjfUZ<)-1!6eV)92@0|}s
z|0GRkzPQuEUmwtzrlidq3nz-?nhXkX*c7MVYBz~?yL(+9)IVf)WnwSh;Z6U*hb(fp
zrW|vA+-ju~b}+zX5ssISdJEh=MO@)23jLF-+C8}3o=iT@uWsZo{MOj{eXN>KCykLh
zy2(m19kb%qiks|I1KAtt><H&rfk&6e%Q`17*7t}RG@dkC<RE9hf1A68jxP<&+TCMX
zbXcVY3V_oCY}d1_nf>Hh3q#VW24j10=b<?2myOM|IT-?Lb&x9M8lI^6LRakFi2E|7
zvfW;g*jVgOaP}d>iMwt!-#TTtuqd#+*PdK4ACLb3;pr^H+S<CV-Ih`)?rz21f?JEb
zyE_C3?q1y8rMPQxcL)$%i&Na8xYIA^oag<1<xg_O)?RzfF~_*){BP_9+n3aGx884=
zF$)Mu_&YU?A7U~h0T{%eV$74CTNUDfsi<5`9g*!d^tMG0jFT`}52k``@`Z3)l~h(c
zNlIKza-tSI#Y0w2S1dp4oM+`EcMpA{(q<6a9;%nz5ufn1T85{i|LT>d9?e#Tb3{TM
zhEp(*DC*G&0WB*9u<QNUm+V~?0eGHf&A_3t=@F|>iinMDqQ&CfTAfH8xdvZ!R~Dp!
z<|%@P>sn2c&p*#i9#AiHPo!dcV*ZiVpK2Gs88K|bUT>zu)ll}g{khpi;_mb2st0f+
zFwBC+)w8$!5qZ%x?PUl6q{sA&$=9Ldv~uMiZ#M9Q2>4UQ+5Z-IsgWHx3m=w4ta6mq
z1I24}T8zCg++tyyJkz_qHXJt|{D7oeN7E55=xw-&of>u+;(Kf^(?ot-L&guesrC2}
zEmdEt)x4LG!Yh06H;&ym+%Fy3BBVPFRegG-_z|9kok5PK9;f6na^-bDSqMVL9$NPk
zC6O}KmEhp4^DT=KLI8Owv2{zz3}o0OM0ZO8t}$K|O-46$e?AUdb~&9(?eoTNup7xY
z6_?#mTvh)K-RZovg_cyzCU`1pg1^WvzO)ono4j4_?3hGLqW{RJn$r6vfWug3sy58&
z;BN$adVSvE&?G5@B<cJuWW+=Ji_BPn%X#dwoZiYRAa==!K>7Iq-`6zZTiBk23z8)U
zf<F3RM`B+P85*wonNBtOE$Kw{?bRg!Ol%8R@JoES!2^G1rM0YpeV@ue=9P)$2mjAj
zRs%zIdFFY|iI9Wsf7eBCNwaU;A?$eS_*Fr-$%EfU5d@^PJVo;t*`5tEwK_WW8bofA
zvp@HDdL;s5pRovi7AZ$>fXtu1M_o`?$ijQR!Hgn>Qw4ukTk4>=J5f1PVv@FcBg)QV
zEYfYo)1JjVYnC-jKeW;u`r^h85EdixLCi(W-$!e5J0JS1NDuOl%W<Sb8oE>lhW3}i
z+A-pK1$(6N3mgchqh`o+?Wezf>7so##iD=<rPlFz@kfVx6*z+BJm35M=0m`b93Zb)
ziJ$lbm5e3@z(4TGKou2o`lP@TN9>SA2xB6bNK|4l58_tYZ0HZNkGU=ehiU|?DLhZ#
z8awzRxQNhb@kRND&yt6}{1|R(P)62$V3@%8zg)<!XQR=qyfs-oXR7$#P;~daahrbz
zBdgNdxVNovpYgHfhHSv!c5+JEyh3)SOtmeVXa$q#&+a1eCKdzQ=@G|<UE==i3X)H{
z#r40b5i^XV(iY+O2EG$?vD^|Bg3KsK>Hum1=A_Mba^_W2F{0B#{Xuy~k%CyX%Acr%
z5orYcAxtizpF5&`1)@@$LQ2@|3%K%8e9<x~)TC&?#}hQ`o%Y0*S<-Qx<$-_Ar!JdD
zL*1wLd#-ajf;FCT42cmt6+ibtNnhCuT<39|&?M?vKL>Y53-#`u&4jNI{hrE2^&Y_E
zeoqk67*dgFhyDpW{&Ws5YBh3lQ~@u9j^77M(UA|`1k-OqX*Z@2x`=Tg?-aoD@R8xl
zSf5~wAvbk-S&w6f9Ov58sjH|zjqoPSvi53Hj7bq;h`Es?FzA^tp95UVNJGjTwA;s5
z>PaJI3pSR>citQ#eu^gIitA+Ov6e-yzD93lz*UK3u~(d2R*|WNoV|dB$=L!37seTN
z4Euy<J})F_>`!d=43CY){_#_XbL8k|`^O?Qbv&Nw`!sD#ka8F3L_uYXYeD`=?~!pJ
ze`qlCXpV)ahN24VJ2^cz(ZhsMl<xKr-A|L7H0$~PP$^PAmR>5_w6Pz*Vm9i5=dG7e
zmdS68OpjnZcRf+QAn`$I6>n=*Y9(H#MUI~Ct2hOWBtYNICjCbamkN{^`ku3xMFmmJ
zEywWpCidWY2m+#+zmUJoz;E7qvH?M^omh~2=MM^3)<&*HzV~TkG3fZY7}J(a1rNT0
zAC#~sb@Adv7uBX?<QcJqMEw>tlPlh5XsN%ear>=;|G70BgC6RMeVr3x5i&Ru2T;V-
zsd+y&YyaW-pHrs9LM%F@6p(7HAsK-AJcM2OCtI7C11PRu1T$car)z9@HsH|B4bn%z
zm2yD-)WV?Zr5l>S9a}d-U@)}`VSS>mM>wS8tr*%6(HH4s#91n!xnlPF`I`mYzuTQ}
zm)i4Bl<lTuwKQ){I6Vnys|b2xBqf!yZCUx5o5~^LC33=S(rvFuq!m7aoOh<XEaj=S
zz6J0SFF`8%ChVlt&276aT0T)#MrP}Zka9RRR2MiCj=s!6ws${5pvjB+kWP_3{8W1P
ztbxLg3%9gqMli}=$Gt8D*A@E*xa8FoR+At_ijG|Q4Q8l%iOcB8O>e;Y@K0eSOI#v*
zCR@^Xfsn9t2~rW&7{?1sWa}a-=je{nNKn?UK&3iA0}s;AJ_c*yb_{X-{jNDDi95da
zGI(RpZ*2w28Nkszx796-Z}LOHEA`LXzvV6MvIA>Vi=g4Sit>i)qYT1p91;$L(Lpf^
z%gJVrN+(#td&g8``F$b3F?mZAj+i&~stQMQ)xBB1=TStorsp;d&rhu?4$K;8lk-id
ztB&igQm+#lZ*@j`ZCcE^>JS>uKCW&Cs7o3Ff(b{lBE+b(g0Q<4^L~h3iYh%Xny&3M
z<AsZ`^^_S(;|g)C<zYG66(|7-1fLm-HqlITR8XrD=rD?AUkda~O%;BWWFN5+q@Boz
zIg{<+=GPKnXlV`3ds6qbwivu!3WycUlK7`oCW#~x%PADRS7J0o@?QoF??rfS<<;ow
z8LkbXtJ?KEsD9qY<_HaSRWn=m_@t8$jO}Gx%a+pJ`_@?_m+*9be?eF%CTqo6LCwY|
z@`yW`aM0jqD*CRu1gI#>zioygA#A@$jM9oU`eQ0sh5Mh2Fiw;g?PHD}aOB~(cVGxR
z?fLcXC?!8JYTOm;9q;U5u*rQPYid1r<csXIS16la23u={ZIKXJ()USy2m}5&slZPt
zEulYQZQjXSy#6DFld)(<kK<O^{6VkN56~m6doU3CCpAw%mGL#q*%zuuge2{c0$nW6
zrVJ3!7z{by#U!(|f4&>(-dn~BC<zg!k-=)GHW1Emm(-Tt=DEA#^9{{)LS@`*z;p5}
zA~4FVHPB?^o?CYpfXl$qT2`W0lN8n~<h%XtANQ5I14J(jgBFGSB8$i<l=oUaSsp*j
zs1Of^*@@%hFeiIm=sZfsBhAmHj82-{LGbe0hb%-m+pY5c62^V;>e1f>7$ia3R~BoG
zISA#kW{7CHapA`9*4f{o8aGZ3DrV`9En}>0eRh-Jf)wK92PZ764ovV9gPWn<*E339
zqa&4XohCm0Qyd2q-@MxF%GVwUe@n3LJ&D+Y+}d(plY{c--vdQZ0UoD78TXxUQ_)q2
z^7Eoiy+N|<t(P&{oY?&X_g?j%R=#;*L65{}t*g6$Jjqf@Y~AnTwb8b_OlgVfEEhK{
z*3t6vd(7;X#z+$;^2E*DUN2Age=sFyQL6}|_l<5!QjzGJL!Kd-g|UDyoL&2Z=qG~`
zYMb%*UV0hoebDX#p8mPhdOXYQ%Zukp*VH|-e9wQ0Jb|8_<`34Oso1a)m|S9AwwjxA
zWD^c2<f<c-rGU!z``6bJdX5u+&$b^N^L2%Pi6lIB{4PEm_aNS_b9r*t2rHVdwF{dK
zfnz{Hhzp*e4e-NktMYRLD&t6-k)a;*?-^B+I|NuY?nz<HEo~1Ap7@ZY>&t||G1;9`
zjBB%OACNfybLlECmI|(QE;>mYT0)rVnnaC8*k7DMH&1(9Xvb5Y2p)U7NGygE+^Ppn
z9E_QY`RVChUVB-HbI<}J7KG|rr+J+8_;Z%n+Uu$letX45%YSp-$=a#>0R=t;ikq^#
z_1^s+N$_~Q))R}Yal=M;Iy7R=4?&@~lz?bCAP-pbx!r8Sx_4-F{7k`@t-9M2*SEw&
z)P?kaALF2x+pYD$IT5d1@4^=tvS*^r9QA_g`ql7?!TbB!1Pr^z*s4l3i}kCvVX;;G
z<rGIRg<DZ|7#uaTwiMXx=ZgJF>GAWx7tv`10!s>jpUiedtl4rG%+-c|jU}nIx83!1
z2!a^_aaGwneA@u5q3M$Hr_uf87m1yX{x6S9?=>t73MHn7rcO{+I_pW{8^?K@#Wg&>
z2y*N|tX)3Vplt{RZL?qz(C2RMwU<V}e1jgZPWP#<f86=aO&SQczhct9Q5~zAm8>Iy
zn?g-7&!G4$w`~;by2I(-soWMYF_}Ug<AJq|+$I1<62MbVkG@XL=dT4^CGz6<zqZz-
z>`Ysuc2vTnXhS+vGD?*~sIInZo7@IYYV~QOj&TXQ&CtE|p7xIYz#=*dk!2Y;^FAi=
z*N(IQCuY8JLe4V4__Lo4>JP*$8qLFoUL6nXA>G?}65@Z^XtaMTZHqfS6u$0dnzuX4
zIC!w%(ML>6a9i~2UIkPxdy5Uv4kXlEQto<S*5dU6uZ$;kJRNN5Ud65>uomPb;>lS#
zfkzt#XYhq~RaAG26K}IR&)^m@D6(PX@4|{By=;2~#i=a0_8F(D(3psh6E#5vJG#Ot
zmMOn|T`<!2^psw(0>|5@`sME~v?W_$=4=J|(<tx*fwXiJnZK$$yMzRC=GSq0=4dXM
zp!C)DO{lo@`5#N(XxYqnp2XxN-l|S_W+_b=6Rr@p7WMM+H);OWPEs>Z{#!}=_B%x*
zk?9dRs4vmVJz)Xp-J|Dj1K25@+33tAkq*i%YA`T%$H%QVt-7-M&x}S$EOW*Qy`l-)
z*gaDDSO(;b#jJ#w8k(d9!zw`N`fcR|{xJ0h`#My(PWzOar1~!H%-HEnf2_+HAI8nK
zG7pa^)F4;aK6d8fJFA6hirKIvmPrX|vzTrMv&ZeWH6_^@ewbkVxL60FGt=@AeA7B*
zBKII~e^N)V!N&w}ZWhcj!PK{oJndC0K;8pazYqnAstrj26S$ShE~0fC{!J~tOoV%(
z(1ZFHUJKcjmU7`9TU{+0zp>}E-8bzNS(_)Le!$Ea4T=cSem8kO9{-*2?w&QA{@?52
zFp?OTl{Cs`*gAO`<i0`lkXn5ytUS^I+7>5`QBz_{T+K409lwSw@Mh56@5S6TM~NtW
zQ10x5DqUNh@=eQOh7K%VmzsB*BSpUB9{oC=pjZpTWeH7XP|5+&3Ho)he43z69E^IV
zs5+#Z8ua2Hs@?cO<Aw+zZEaO1r!TejO1!d_zvyE~B%QOhHz45=V8Cw~LO#T6dkJqy
zjO6B@!9*nAu?J%z@dWl8hN&SGF(g|iQL6_&i{@fgfFD8FZ}YqTdP}nXNxpI8=#H)k
z^A!w`jZ%;T(#S8@D5j|cl#zg+agLWwH4ddpc9-Kje&ltLOasK5;<LdApO<oGVh;LX
zFD!HzPreF`d$v@U5e#X}!8L|hwVideLs~Q8K6!-{Cm5$n=<|ckigvOa@7<F-9Y6e&
z@HP`Fs7v_W(={^dri+q%UXbu9O|bQ|Q>*8;mar`5PUf=yUdU`Wpne(L7wpxyRKfr@
ziRm|Xw<SE<l*r*VH%M0Ipf<LKJ^Og`d|#dW5qqc(bw;I~+_^GV@$vP!(DD-y_17Z}
zxsJI=Rs{mly^i9;rRn(c;!M(?f8lz0$}{6)#SwH$2D>`pKI<Pg@3kG<w6rU-c?%7!
zLKj-lozs8S9MLtutGg5!=gS<BJcH5fOja&Ama?X9FlykhL$d$nTHwh!DQ3A-AvS>L
zP8ZV2Q+j#!k1vezytAmR)4-u*D-X#m*XmFil0p%$FzB@GExmL@C?B1JV{1QI;i%tH
zGDYAci(&`*sUxQRgtAxH&}HR>x%2_4rX>99f#6w!>O>pRx#T-j((l~Lsejy2(8UkW
zFQlmieBSTn(#{@d$KiKeRmH04=B-EzQ;xpXj&NhP0pZrXdx9G86e>s1LstrU4IFw~
z32c~7!#ltT42Jdi0~4$yG30YDYE7Ux7hb~}$%VMeAXXAw<RUjDS*vUbI)D{p%I6m_
z`ot%%%-pt(hdU@94hyHWH-92^?Q(V8?Xf+Ca<H#+hYzbJ_E>$}$E6~6Bzz#n1X~Qr
zlj{MjDbPXlB9XvokUI92T!<Wx&CZ_BC%jVxEc6iz-MMWoL9a1kb|j9r#jZ8d)(h)8
zB~Q?c6fPCXI>727rD;O~m-9V)b5w06Y#dlqb{0&N53)XoF&W|Sth)QXWUo6E#lUZN
zH#gE^d1NKCAe&LFhSSiwgBxSN+&#=-%eZc2j?P)Q2QkQ84_HoSDsA!-A#<129|e0p
zMm$d6KRc`K_V`#p<1X&v(Ct*~Rdehp5$*%;qtkAbukOB;|FL_l%BUD^?Np?RI>;c6
zM*80Rq2WUk3h!H{f9287kCu20%?(jE7yCCWJ!ek(*cCSt-qx41wVjuU``QV1hVs7u
z^oVLH1YmVsQt}1sz+E;p+mmpqZhIXXQD`?j8KO-BV{)~8aR#Lqv-JE9Bp2WHWf{7F
z&O1!aTJqh+T6w93e{TnU>Tq?;rp<NxQ_meUjNGVJNH`V|bgU|FS>J27`M<p^#n`Xi
ztKTu`rqBWdD14IwCVJ#{vhpMTU?u-uF#GYHDS&kJ-ZcJM(jem->mt;1b!aOuNJ<<%
zlyrW}ixV?+;DOl2)dZKtrQD$hetu@sHjofJ$K_Au{|r3ho^b&_ygpBEwf7}CqtsKU
zjVHO-;tXY=jV6wvHQkfo5_|%^_v=jP{3Rd!KN+vLWKy>F%9=@5&w_Rb12=M1fK$TJ
z)Qyz=@|ftmr~L}F+Sg0r2!p&(c~^DHEVDPaTr^$$9E3<@5{Gg4WtKXaTr{386t-yL
zwuO;C<GqGh>j6sBB0Tl?m;bq?LR)Sj>DM(P++*h0doBjX1<)>8ehxaA_h3ExIRj6?
z)|P6oB}@ciCmoUD`s74@ygWFenrm@OlfD%HNuy(;tLt{=BexjK%97Lq&I%&`#X;%B
z-+r0$1(tSAL3#p_fWj3WT9&rYyd$?<JKZ$)v89JWGALr0Tf(%O7x)^oND-{xhVayw
zC6EFm9EWizmzda7X9=i>&2|U&FzLTBH=v}&=h7t(VSD13Z_V4K>eX}6tNzsY+@SP;
z*Qi9PXNi}kyP-kHabo^HV<v9lpze2rb~~{7%QTB)H7YfR3f~E1jQHo*zeSE%P#Hm_
zip8&N_9_8XS?)rIGu+CnWAgY5PY8pKVKtPWg%1nX8U#^eI?DS=fRd*|=~bAP1`Q3(
z(dOfd#{Ow7L$0^Kbyzx9$x@ldtpsle(|xP{`kUT@CgN_v0KuA(*tl%nWnp2V+$DPp
zSYfjU4d^op@cNweHeb0x?+CcF*7S2YNAV3#$PQ|eUme+hF6*Qi={+i@8dyUd*WEnz
zCUQ*9e_P<+aF|_NR*44Vy)Kb4jz?llSEy+YN@F-16CgX<gNEU(yz{i+NxiYzgkv?3
zQ_9IQ1-(+83H}jD02Yb?suyE>6axB{=;@_r9}0~}cvM_yp_yq75{~kbuKM09*nQuX
zn`AcV${gky`|UCNb0d6cgDh?=<{Ot&YF~>5GzPDJU@g8G<(3?v4<gvb^#^0oU<{kl
zvd7&avs_(la+l11vd{7y7ag$LA>6JkbS23B$jPZmgt%wG`XpoQjqkR04$vKU_zak{
z;q9~~Erfm0OP^9<vrf+9U$qZ~ccSVhmv!~UX1D%|Y=S9ly^8f`TMX@@^X`39ppK6T
z#VxR^GjBs^HSqPFGeb*|CH4B?zo@XKs|d#)Xif$GfbkR7^W9@HE<(8FcW+O<?<pBD
zW#R*Ag(MN1cbJ}`yC5`{TJG=#k>t+gelE|M4K^KuzQ-5~aXEpxFErOV1Fhe}f0CGw
z(Lge^cRn^+-H45hT}{uJqbH(wVc79*kc7^G<k?SvRW=q&QH(}~e9Yfl!r~<3DEj&6
z<BXbT=(vZtXH`AgNX+w2_Jw@#Fdjd{6PjwlR$u*{5>X#UZoL)8^*2OCir`jJN<ov1
zqD?M|#*amaD87u0B?(8KWK|TldbEeuy8q-cp<D3eaQPi*sB3@cX%S~eb|J;vb}T++
zN*+5s%VN)BKGAx&-&0%W_6*NGS6jz-a@8#>Alat9f#@aM{1!E>^1|jVDS-iEJ*6@1
ztnJ$vg;eC37MhW4XaJj=1-4^s2{jTW{HOl-r_Xn5D4&>qf3T;Mxqt&8_!&LUZu+@W
zQ0S0j8}n#oD+A`Ts?$EayZ%L80Vie0wRwMUDz`UKQN_sW=j-P0p|Cc=HsLsGB1U>|
zvX<{O=99Z0IQZ$S%jp|D-^Q<`@6=hy|Jk4~IK2?K2x&ssrQwG5ZfD#IbT_Kmkd!)=
zaY}!FAF|&lyJA&5FR!*u)~00YCDl4Ado?GY+FTM97_Y|ZqrEO)1Um0Y;4N=67i&tt
zwYU@cwr1RZ(p$+d_O9dz4O@jjbkn7-lga+I02GB`iVUyn&ygNDYHhZ<c`pP7A_6kF
z6qPa)0>4hASA7@+i;l}5c1cV@i2$ze2@H{t@241BQ2Te@R<3GbLmcpfu1J45(oE_R
z@5G)-U{}=KS`y@gU%!zm<UPC|Ofel84KF$J`-CAh;bwueBAv)bgwRY)<Pg;o6^;7J
zB75WmcKl}e2$lDG^z57i9TijWz8D?sIWhePoR21IYfE`vL?5UL5JTZ&^BnFotIKCP
zO7?LYhLPG>`ZFt)wVf@FAOEYF+RCk9)yEAYQoN@?^1Kclt7=xWW@tu}*^^&&4ENd^
zZ*Zu9IW&BT*q-)mkrrf}_KSZL#noUR!oDv5D0eTCS3zb1)YkkVf~GvDuy*oY)%^6d
zo2}Z5i1}N>zr|ft^$T0sEUb2^+k}lDR!sfRTAKIw*ym=j6II0!wiBK(Ex&kP^g6x2
zj;EpO6C;JD^E{nkTei=r5?R7~o8HJeg2lhwT7NbRp#4XQt!)x-ijMvjRr5?udsU+`
z%RO7p_8;m+iLW^+Ns59pl$sih{JX8pYE23TZWqun2?o?j(ue2Xu=7$KAEF~|%A3(`
zA`qpI<S?nwRBF{>H%>596toc)A^pyW&r<|Ji<h-AZ0Dh8GLUQAa`|SeO=&@PaVD5d
zm6$g!DMD|Arp-Y-Qlci)4`2E~p}(Y&!~~VRQ1=JoX;+(fCB}bdfu&O(f7x`D277r(
zxCpRj9Nmi`6r{8x8q@pWVkM^gMr8i8)S(d@PRmN3X8D2ndc9{X@NW$QG<56E_S~Q~
zyur<2TCeQGoMEAgQP|EtrFWf;Z57y0fGH=eVpG9y4x5qXWWHqd$NE1`EHZk{qUIhQ
z06BWcx|u!=JJ!r(VGdw_nNLJZHzQ+0J(_UMkvieMxrOJh$@4KS=&ffYkP7xqw+N^+
zoetKDZ0bAa6b2#xI6yFeqq;6<ecB3=l1ePPOk$Ye(G8sSQ1IVJZR<G_KE;y{mduBm
zA&~IiAwR<gUR=0Sz)s{a^qK8AHM_8xyP+i>aD-k7<1P)?f8*E!7SdRW4!DrqoJIWo
zxCeZ*pCMs!(&-HaxB~S|zB0&ANGCJe2uQMPZ1Y}NXPw!sm0Ma_i+ICy)VY3t$7?gc
zX!3tv07iF#PcwL>I>R<Zfd-OLYPYNRd*(?1FpBeBk!x`bE@c(Z9kH{OAON-AHK0?R
zYX0-SP9m_f`@vcdxu6gU%y}x5DiQsx-+dL?a%o?c{BzH)Q|MfiGx`9BGMU!7nE?u#
zvbjCgHkZBvJL&xC^&T@1q+n`<7t=i)`R1$ibcn5|j~PQkH|(p(Fy*<w(&wS=)}ZBU
zT-&Vk2T&te@e7?K_}?A%%T$7<KSJ~oYn8>O^O@JEh1|v@!*c$}kpL&TZ%o?Qx-%W4
zTuE|d<W~m8<0PXl<#$Kx&hOuHBpN%)dV%H5`+0mEQDsL%mL%=y30P~X-`9ViohjUv
zQ|^N%KfzQOxHY^mdu2COnVaYS<JW}hIsx+b*8+StgRN!0+@MJP^E(wg%)$?Y9}VYx
z>?}>Qyau~;?CdjBEXSl5j<hdJR+ufnJt?KfdRJ2jtf`YxI87(S>=>k4S-!KbP1&vQ
zK-!CeAw2vk00o4uk7~ozjlQ$7Uqe*oEXH2a7}V|4g5DKuUar0T7t&J#atq`0uRpBB
z3u8FzJ(F;M42SWcA~(hE$;o*xoqXn$72SE>`Im(;BF|K8o@Cc<w%<>jUb<y(b)=3@
zm$_H?Ia&R%yp86FqX4OZEN@cF3b*5-2nWd@Lp@EvlG;ah3V#k1{A)8Q8i}MXJYO#(
znxc4Bjw)A^hC#Q&g~&p(&`xbXxne)pG+@{@#n*085716dlPhEQ+He}bi0xS?Is7jx
z5*p|s%!%IkU=g6VXYmC|4*Z_>YyY?l5tWr5=NO)-2OhS`TGFsh6m4BHmk@Xf^3!iD
zwQArBa4zu`N2GqM4f{;nG{HkHv6a1)W)4vS4_jP~k@WzlO)3K%oqg4j_K_u&D=`cH
zlzoh5GxkTAV1-^+;W;F=emQyq8=|oBQ1g$Wr}D3Lj28o&*lix$h!dbToemX6eV<>C
z7pq}1>-tVx_?q7Bh+sE8eb|n0E?3z|``yqElu%<=NWT!RES_-?*{0bjFVs9JqZo%v
z3Z+HCl3^d|LqukArNnDQtTWkbRN_=|tlYZ;Ba?$f7VeqvPt2AIHC`7tE}fc)ep+xf
zbp2Nu{Uc$?u^6jffwqdG^B4;S=mC`GI+w}$i76F<$)cG>RdlK~Wp=lwHx|^AenY79
z5@5H-f#Zc!802)`_tI%1ZW|0%I361;)ykGiTe2(6n=9Shdcx}z7~`IW5<8ULQ8l~E
z>fI)}&?9}u*-{;E!>DgP6x;-@pHF*q=B~A47@r9_o7s~*zmiNeA}D2~ff)#^H#T0j
zJ6HPBL$e|F!wYRGVOI+twwa)z5H5%7vwESi%+Z>I#HyuVk(#s75TjeuPYxAjjA-h`
zjM1YVdZzoa3qfikHt-ro)B;IY^f}QP1%K9Lm-W>@b+K16+zUQSLMz>W&LB|3Bmw%z
z*@%SYs!*8Nez6i28BA3?a;8)W`{)cZJ;`khi5kix^?P0{A!%<l(*pdf+#KNjEUIMl
z^qEA!Blf8-wGkw7eQe79UKYLn8>Ml4kGda)mAa7lLMM0I!7q-acZM|Xnmc~pxNfK?
z0iK`Yy-{+9q`xPa?|2tNw@u*3DYapS{n@MtcwQF*8GCt>EU9-Y?=T%P&6j!n*c6eg
zN}QN~!WkHm%(uLNo-B$-)AP~4z<EW9vcXjdh7=5AIG{~sjvoe`GLs(fS=%>ihx?_e
z4};a48hSI@?!O+ZWpm4=o7rOIxs~Q76059#k1pfWR8*~NsLMaiJqB@XaVdNw9rs4t
zUb}OG!~fE3@_1?b@_1eMeJXZ<c*jk!`NI}nIUi>Zo#)cgo)bU3CIhVh>r*QmDHGwU
z|KaqC7G_D8tjDoEBLPJLQXR?p?d=Y_3{KQ>&gPQ%*o?_5{#b92kE<X~F`MOTJ5}$1
zhi%(dt6gE?iQZHi>SRoDlFob?viXNPpX-CE)ri(d){TIs@9hc0!<FyqNZ2%1#CzC*
zQ)#s0tz5ws%s4?33DAV1EFSbDENO(UtDA?rN2Au(noh=1`0U_tAs}WygImuHRqeiD
zb=}z8-_Jc<Z2i06&~oaL*$jG;PSHgqtq1J?+#1Y{YX*&lW!4k~)}3(FUP5hf)br!L
zS{2M4Qv5lf@6^atJVjr2DFH`vmy*|v#WY{jaMoXJYlv`GlaX06IXJA$)%oVoHSZX)
z6(22yv#F{+^V}+8<~7uROqWyZGc%eN&%`f#oY#`;tP6oQjo&skF&%fVjh;Eq^W`lm
zk04B%es4r|&)~5!Cg&{ktda2AGCZ&=4(Z(A`+K&7^lJ*Lg{^E-`Y-#ZkgeNW>T2k-
zp|vm{83{4Fl=hG%X2%o0W=65CB<06jzRSnqxU9~7yHsVE*}f__TOYof557%NF}nor
zR`}9N^Z^(Q1BN|ziE7oDxSN|_>1irBE>J4y7c2xTg3$`??FXRABupE^G!OY^CxOe?
z*TRj)0NL<2U=@^d+5ul~Bb__b*vl@fwEx4V9zIsGjHTQ>;>u)a^*^o=9y~QiGBlWP
zl4C!5eaU-aCY;gZ+M;5jV_YPQ*PWl7ESzYfCIyIyVBa3twgE5vl@xAp61_T0Kj=*B
zDNb(8t<u9UD<I#qr{lOS#M!d!T9NyZfZ=eBfYCvi70|ZnM4=;k-Q}X(HT2Ph4q@!g
zltg&JmP=eKLG3sA3sBqxr?u_yQ)arQ{GUHyHgFs%X^RaGslhjAMH#Hndnt$nzgcW$
zD-um^vR-Qf{5mt#ZXm`cG6*&2edf1IgKS>5q8Z;Pi1(!j5$V@?mtGZpoVg_4ImU~s
zh=&>HIxd1F)F2E=e<`bF=E)2?uk)}IAP+_-j;D|KXi}6v#s1=Oh3uTBfKA<~^B`X+
z?D|m*C<B1eLXGwwfTp*jWEOR$`e(c3(eXboy@$jS)RLxH(CZl<Rl^lo{$HYNzl>o)
z>unK-Rf(8glzB8B1<<0Q5s!IQ#z=2YRIJ4u>N!8IDDj1TYl*>rD>spBA2$0QBluVe
zwIDr9nkUmx$)A2DX(f5Gjn^JmeyG0pNv@PwyqZ0EvM@`DK<#rCHZ8NZeTm)j`F>1c
zvZbzSN`1a&N#I&ja*7q?6s^g~Y8l%pfN+zLnA3~AKMKeB*ynJNzFtlBExc(g=PSQ4
z6x^aDf<dnaA4D@?EDCK3H6?JUniZIyk#j@H)(Jl+OVdWTmZ`Gz2k{(0jckaW(ZH!`
zZlARG=oGL6Q~4;jN+cn8{o-4-j%<3W6(7NaGDV^H%#>DUHGIi_1tSeSv+oq&3RUKV
zXlIIi<pGyxSmV$!A5eUkH-)-=xKkIIt_(s}jXXJDX{LAaI3C)V<OoHX)XYdEiTqHe
z3<R~YU#P16Qt<x+^%T=b2gA6n7kji*crM(B7qLH4sU$1)nb|Ad!6-jwe2vawa{itn
z1<6c&W0l5)l&37#ozUYo{J7^!FJ>>7`5`k!lv3b_mu&@!BN$80wU*#b&oi@?t!5|X
zgU=}4Sa-=;{!%nc+i{!8A(Ea#?*8doOvTLp=^%TELAQacTkxOi;<#r;0(@XU4kOvS
z4de=?1}s~>n*fUfk{!_+!;wOv<Q;%4fxI=iu&4%PF^^|kA{*1ms4^;Xy%8w$!IT<Y
zzx#FX+ZzSlEUT1`$q%y=bF0VkCR-~lYzu;gxyRVz@}#yDF3(Go9PgCDR8mP$yUDUE
z;U)<&qcfkG8Y3=oZQfFRT})wwL)Ldjj~9*oMOG3Ckgrx9)*7ktIXjqMC<L*Q0-oF{
ze#R+!Ro~b+=}fkGdlnvclL3XwX)a45egv=O@GooqkiN14ey}=IB;4nbX8a3s=K^g+
z(>8Z4+<|P`XUlYFt2C6(o=v2P$Pj$Z%BDaiEDw=N(`2y)8%wgV&ur1Dfdo|S(Yd@|
zw-XzIVq^B;1tF`h5JXMLEhT9C@^IH|W%L#SX`NsoO-{^k_Cx+b8Xjji>c3&oU?&`?
zr3yk<I>n$mJHSJ*!gXK*(|m=l<|=1YFY#%hvtRfVo2objf>farqo$^<4?TVaWV|z}
zD|Z?<vdN6QFeexTg#xOhSmz1|H19K+)!1F%b%Yc{iYIJ`y_yLdq<f2a2{rBeR5F&B
z5PSLZw*-~AIAZ<;v;S{$$cHyg8;8&7t}{yY^Kye+!eK=9V^v&4(#<~yi_c<%jVUa6
z2eZavb{OG+$_b%rgtakVF%<`0ZE<^3&3f`;H{^}j3|%8j;bHhXk10JhJ^G?lF;^40
zG!;hbSur|am!m-%s;Rl2scus0;ZCfEzd!EOt9fx&GQf;!uPE@!0{;cX8^Oqr+5)UP
z+6?jqa4AA0@a4}!h+va)`?Y;Y;@FYPD7j2Bfepq#M62!C%ttSwj~-Eha`#u9qiaM>
zo16A=tbQ0BQ_tn!4Fa4rP}KuZbF<)`Mx$lf4X{BalS%ePvnuaTZ?!}3?^l@s@)cU&
z*F^6|EjXRo(@hsB_djZL{mYM!M+X65aiR${y&O4J(qH2XE3g!`KY4$=4Hm=j%v7Pq
zv?NL9?A3k<9htr2P@o#th49*6NPTG7S{SS}=lPNaD%#h7bfzPx^Q=yhhttiWPlqUO
z{J76HOTtL1fK1~>5siMB`v7_kKrKelL`<D)lFOCJK0~{M{4Xi41i*(x0ES^-@gPW?
z5Brb&*f7fpi}Z={5}vU$7M?qQWXw$=aWHlD<VguwF~>klKv$*QerJdB-b`-MhJcwR
z`Ic(cBfI!=E=2frvSf5VJu4ly@Nl<73odWP^f}eSz#AuPX&>!4jL}B{EKTxx{Ha;~
zqim*GnALy(f+<H`J=p}7wEf6Vcum#F0;2*Ec?<y^3Zx+MOpK80%{uRwZZdcv5lgyJ
z4T-?H9ITbdD9I6f;ywz8WtNGYzRNku5R<AcnJLt8XF^>;l_A|=Fg}N#<jX;3X;S#n
zj91e++*2|2)CsKaB`HGApGD3k*n_>LeE7qBQpEFJ)}8I>v~{p08v30MOt16lsbhPM
zgC}#N(Pblkd9zoYDw#`OU+ZR{O1S2t0xciE(&ONE<X3;8yX6@bxYdr}lW#6~23Y)&
z!^j%jGP|II<Cte#yMlLhrlmMiz=3gEw<@CWThujr)i5J1!sTY3y1$4v)XfnynP{Ag
zy`LD|OhW6)8#T;~Dl<J)Z4WUmb*(!x%G8-uBbuX}kxdgqQwJSvw9knK<(;prVpsOU
zBChw@Ax!tPTIU567=$!=&}#Ujt<>wT3|%$7ZZ&SFQ4q+^C%Xq3SiV{DZZGF|WlaAy
z^M>h~Ml&oRLdPX%zL)+RRjZ!+@}f0w%)AT;2_iU3&M?8+80%nEZRV$H3tJ<2+<469
zSAh3^l}A3eX@z~U*Q$l}GQRmk9F0Uh?+N)(RQQyOfy$bR?5hWPqF>`Gj}3*)?bWva
zh{i`J*>hl(*56XUj^nPLTJOP1o&8rfgPz*w(gW}6G>J?tj1?%ooJks*Nat!|G}>zc
zRM)aT>mEr%npGS4ZAI`j=$v^5I#Gwy8(6zD#5r^&tqO{|l2f^L%#V_?G@b3ZdNW6V
zF(yG$W0?WPSH*__0H)2+QiGS0@q>gD8$$hw&R!blR1~j26gfp>TY8si-rT95Vxh<(
z>ga}Vab3RLwM@Rxw*I0DJvsiDdNN>B<xPgaInMY+AM^+k!E-|K<jKL?b{=JdGiXd$
z>69lDonQf?vk|#XR2SD$@1qeJix1#nn1paoWq{3hbl!5pU+dtiSAc*p53M@$sMUu0
zsi}QtZ~rfqnMtV5wss@z4IcYC3ei={j4l7sVfXxRS2-C2WvCi-NGJx`vhcDqwlOq4
zYappGq#PPLLdDQ&V?a#*q)^Y+-MsOH*VlIT#KsDw(GFg;pn(?k4@cU?U3#KUYS`qg
zRs`(a<vK1y{U@BZ?D>hipV0~}((`lr>Fasn5X-qzbS4sbvLjQHp=}-p`)wOJp-Ill
za##RVzwH|vC)owNiw#mFhXWCL{p#I=m02Ib?|WuWDrus;{a^l+j<GfK!lghxb6;3*
zBtuIlL_~Ipqfc-i^4`TiFomTSaDh3iL`xB24}Yp<sG}l@A(SSYn2{TWotKs2w9!)(
zh~+f<JmVQ)r;SyA7+$!?_hk1A%V(=1(oevhFp<#G)Uev=9(DSL*5!Li0~2`FF>N^V
zmI{-%&CrasI_We$RF8V1R_;jpfVuQC#?g(R39s0<-=i}iJnCl37EY@}8H###1ezcD
zvPwb#(}gYfg^8#N`!=utFv1KzB_3|Y@y}ijM3^g*xM|>pr@10nSn3Hqj{Z>MF?_VO
z_(AGs%9~<-sGp2UDcoP@i@)Ji;_lqgb^>;Jh;m+)^bjd*)S+we__s`Mu?Ll199{r5
zfCN`_ej6ew=up&M@fdH=XYo03LS)I)BZ`E0M${ao4KL;*`d{~<$nw0)cWp74I`)`J
z$h)%a1}gayUPLK2Oj69M7k@?xW)h|@FJGNepm)(_>J}3RAoF=*yr}Wv2w+I_Yc;r-
zBP+a`)x0rET_KjuIB1_I?bH=82Rz~#R~Yo%Yyy@}RL8GI-Dlz_8HjqxS=KiK-WzT{
zb!t~T+b!QO{|BH)N?i_<W!;0|0~j(J4<gS-m`$)Kdamg99&GG-t|UyO#+j?|!EMQm
zHIAF~bAiG)KvVhRx<|=7kbH0(1Tz&zT}?o}o+uLM0+3tSKAxs=kfAdl1>&MGBVTjj
zQV?<ywbu*Hw$h%c{G=9;wJd!E1pQ}KdDA?|!y`oGGKSawkh+FHlG$sgXEmK&{igRB
z-PFZfb?ygm$qYH*R-G4^Dr&jEgP6*f-bzQsB3tlb>KWOPBiWgtFKxlH%VJSI(tp(A
z`%7SjamOza{Rfq8qeX`r+LNSlhdJH_+lOgABh|Yii2-YqU;m>R!7W#9LE1d2d$5aB
zL_g)KRDe~asv!V2`27cPRjL*eVfk5G+H<R_X*na%qFDLLMj}*O#F25ICuc09I<2^y
zQP!M=^9yNt`$$OvANwJ7G1X+s&x$S2p6$Sj^VfECf+Jqd`ix{}{jNT(iKxuXrQ7i*
zjo;vVi3>(&v{TA+!PE3x<q$&nXq?YlP#mzlL_&OJjH!k=!7n`VA$isZz_uZDZsO7~
zWwZO|U0=Cv*s*(+$4BeB)iFHxxcwSaFZr$?T(Qb1dv~<sVtX&w!|tk4SHO;@B`*mU
z4C9Oy!7$?t7M2!UlL8pvHL>krl6&ur_?Z`GMB7pHor0-Y9IUg%BQ{(S+LyDt0&+T+
z)Bx6sUBjO9JB0?{s9<&!?S+Cad#<1Gnc(~3e}nHz1R=pOo~qY}@|MdUM_S(}av8qH
z2#VwMsN_j8rGVukkgk(5zS8L;PJA!#Pgd8d$X(#ij8ME&l<8_Y(V5B^)UZM{-=aEA
z4xPY)^#(q#Q*xD-9B-=O4%I|AQXlQFFbezAFlZ~98K;lR=&lAq-WDVO&_ZWwz?UfG
z1Q$%1ZV6|=Xv$PA!m8*jyN#MwBZ_hd_eYi5(2OrBsvJ`msca;vKCV(wvY5<3v*b++
zmIBO_npj$67>x~ktE<D7)Fn?_QO?l0N!VZK4_7pu^*GP*DC~XlAAxgcWkhF)d|-KG
zn~r(MO}Ulw6cc^h((R*m98D<&ZHkIrJt<6cQ_R5*AmPmfc=5}}+wh22Wl@y<E@$=J
zQ0TA5EW{yF_2l_~#rP7>F4r&T?-7((K}!3Jvcpwc>FR8|RP4F<7ZVD@r?We*Lj7wx
z`>^wv&e^a*@`sBBhvW6*)}ghjutZT^Dk9h2`t>8ag5tNT?OdAl(+C=&?c<dOrDle_
z5%P^gmWzt`h}KSPSUDszRrA%@6u%^1mj5?hl4IID%YavlcE12gkhNm^f(VPE>XY7{
z1UcRH7JMuF+#Vh#6@{P~xmq8)`#xC|JB~zz`EK%M(iRPlYym0)FtYp|=AoMfxrS;G
zJ7wftpkCMZ5W8D4r>YL4E8^o4sFTXI`ZN~;DG_SJu&_4CkhYD~aJ#*l8DH%G0i}|;
zr}Dx!%ZK8#o+;XnC&WnY831>zOB$+GPCIipe>LnCQ1&>Y7*fWrOJCVhSDFAQ!&pWh
zaL*Ab_$^N#io2G%I^qu_#{C<<>QOdy&E3Qzk<}wvQI313AcJ<P`K_60?x#l;@t2B+
z0>1}$e#U3Xqykt^otx~5Av>35btX*rF30mmj}_E_?)hQi*ccg(eUP}7oOkkxLO9Ov
zH}Sg~#+4tesqK6)WX=j6>*XUgO>FFEvqwWy<;!t6zKm4}o_J!`L}tP=FnKT_QbwgU
zF#S@{!e?wzsh5gL+3)itJ+6nye`PRE9%4SB857e;)~2>PDDpAuGh<~nd*0o1@(#I*
zQTxtFrTNO0H8FP2E-y#;sl$Yh=zkOkqbcL8{A$Xe>;dZc*K`B0xl{B#Au;ZEDWK*`
ztzm80*x6$n)XY(bcJ`8#+@X)Vlo^5MO8T6U8S1y^na0y`V;tjV=6sX#Q$+9$A`KZ3
z4b!=~2W<t!@gh3Y+P2E;wIN6wd&(-)F(oQ~*MIUZ*WU$`Kua;LyWC~{O1KPot&~BD
zg#|Pa?;N4zUh-ztfC+U(6`t6q%k$;5<}1HytX&8`xW$x>>lgsHZ|2!P({bI+*$~M@
zL)A8<9bkbGZ=a~1NoVPrkZrj(DlJ-*tFCKSHR1;aECv6Q@H!|3sbJQlD~d{Zj>%*z
zD^yb-`K!le%EZGeQc%05m?u6?ZDc~^)WwR2Oe`mJ)W5}86|#4!Tt%cBQPs*m|Ktgh
zP{<U0T%_`xYWkdsTCW|xkBnhJ?WxH!xq1yUDlstbe4DmYHduq-1h+^+Jw;IEoHKj`
zkOud|r%*0|0nt(;hQQ?RQ{@EN*!x(%paHMRc#012CgZ6LTe4xi7_hlp<s|-dI`y1$
zO$(b{vC5Ws%=qy6w(d_ys66A&8$hdGTM;gAWF0q{%^!-bZmphTs-B!>U-$=VqrGlh
z(0?Qj`QOYbnd&^@37`>Y^W^jAXY0Y`kyb`8jgq#je4^8O3<$58i~%oQgL*ZQk7niq
zIm@YH2Lm8GrFniro3K3i?rFb$wS|lZj`6Gim1fBu*X@AQ{wI~F<QS8pvR{VFpMZF@
zeT15-1HOU(IZ;{ZG$uP>75-Yu0p1rW%SEIdK%|;x)6Cf{A`@wcmrw6>1t%G^&Dmro
ztcgSgC`Y=?6?v8L#5MLh{s^bCAH)M@pu+$u?veG=%A0r7kryVOHAYl1kJrPx#3NH*
zY}J0;@_Ao{{yfwFr(F;IS>rDOsPCy@CS0@IKamCOAW9Zz+w!)WePG?-)CDphK<p$m
zk{0X=!5U8~LtNK85+{QcPM^mH+h)_NcE3_|&fWr#ee9oB9VnOi3agT?re<||N8_a?
zsmZfZGkTKR%rC1gsDxKet6$>&*90&!9oO^RhXl9^ZBgh&<i}hl=~Pp83IKIHolFE{
z8-Fa|af;Dl+R_?IFR7T#Z9`r(_hlGFH3EE6=|qq(llPM&7|^r-Hf~?aUpLYjE?2$?
z@X}H_H4jEEfJnGn02te^uZwHhUHCo6N6?%VwC^D!Gp89`ve7;!v6UjKz{*zC2j%qA
zl5<mKk0Q0w^+598*D(4kWZQPKSD{zrT1x!IE=*3fo=H(l5HcI7m6&;PbIp(Vb!*_A
zbOk7S+ie-=)w~^8X)p^-S$8t^-RmmuZ{Aks|F3k{YBR3?GWO|ab`)y~k6w1mwQbE0
zxUSM%DeSL-e)kB#l$zN`8e`*@Nw@9P09C-@uW{8XCDsgvDXUpfAAj*~?_L2cLL$a0
zM!09cceapMEr}FQBt}6vzb534r9xP2LdNyU5x2V>)cpTbEWQ!`V9VXjjFB(qbTXZ(
zU%UE7kx{Qq;~i3`sHm7Iu>~F4$@kPS-#u&nG^2YM7W8aTomprj{*_Ue`TIs722Glw
z#7yFED{RJc=7ZcQ$bQMp?27|qv$U3sK?a&eL$(TRDzODrSK#nr$w2$xlKJWIDW*TW
zfsjK5q(=64H(tkyavcyFlTp*jelcuvWjMM_<g952U`Q_`H)OOjsA#!?wZH_@4PE(|
z-&VcYlDv-HXR^Li(Mz38^3g_6jkIvuh?I1O&Agi^;3CZSG?iYMPi7z#T^8r=T!oSo
zq0KvQLj5Baw)5RaeGhOXXYGzM9UIeM%Qv4ZY%WntPgyHlQ}%APqnDjBCS8}u*6hUP
zb6ej^`=btDFcNLe)8DfnHg*(kC=w}s>zdms%MJC7ni}_T#F<;NDMr)p`<>A^Fm$Pu
zRhqgJ#Zp1Aw=|HfXKB|l?IoV|!MherbA7IG#7Vci3}(HaE?YY!-2#T8K(xt#njDcm
z<;3#>;t)ldCb8uxnJ1+S@DH^{`h}TW=~wRJ#HllgS-YXD4@t*dxuseMq|>Fq6DtOU
z$&s{U(N9dMg!?XQJ2QrZzbOXjIGKJk19`Kefiy>{|EUtNNhy@7M6+i1&hMfWLRO3U
z)RXS-_k>6Lz_yDdAUHln!q>XkzWF-p(6YL-Cd8|M;iR25c1<SuD7ZbDq<Tu{MfdBZ
z-5{4{q576qO|Hw}m!kl?<7o0PO@F_fWLhxMunsA<`zUkTfv4Zy?pN=UA0!gA;=^;8
zoKr0=MV_YSL+Q6OCV$_ak1VTQI|SqQE=i)_y+b&c786#ZOhzq61hE`y2cdXB<>`47
z#hKkP$dge^Ys@&=MsfrYiI&~Y+MgYqI9~uGymWSN+c!3$Z%?Qpl&p}p;py#7Bn^z2
zIo`C3!(^r+9fgqe(jgzldO&H4!J>6x-H?ZRcHYL35h^F3Bm=(VED=36)^>Rh3jVwp
zN%q^az+UgF8X__ImKzAWp;*Exu!gWU#N%D<VVD}Ly09Souhdy1#VC2z3Q7i*M$T`f
zHbre}Wa37Hzs+OMnp~xA=nvLbM4msM>ptVviNJts^@xXz&g@o?oHp!1N!Vr!skAMT
zYb_NwPO<|)KQ9>s{|Fa#`di$e9sG-9bvlPpl|Gp~b|2LFJsmMe_{`N1U78IXCs_5@
zU3+){*;C=yRMP$h9r8_OHn;`r=gH?5+AI*DfsXtHlfIp6(_va)maC?vL<$*KmBzH+
zHrM0q`kr;bO2$@qWY*jfN&a1eezYqq-#=?B(AhA$hoJ(FPwGf1(TlXm)R6C#t1xkW
zaz<WKTF*9XXx5t)Q`f7>)H<qJ_q*~uCnk-(-335huOl~&Z^viUwQMEdC1k~x>mc6g
zl)$sYTuX3b>8#zQcJj6()r6Ef*rjyY7n?ADW#OFrXOp}UJWE*BO0WIF-d>wmxv!n(
zAIA0zbKFA8I!5kgSy1T7waKs7Zo3xfYFK<dl_@`WWol@|Zn5U5gs5q@>svOYwHEWb
zr^pkfIlBhTq@JJ7z^ZH4SB}pinp-m9Gz!(?oowgm`pWmntJX{*R=XvEe5<feW`TN`
z8jWtgAI|iu)2al)5Q!it)vHQD*VJXGwf!~qD5?<_gex_sD+_Y(us7Z8v)}XoYWwa*
zy^2sOq*bJ|Tj*8hqhqe8x9<J3sgzD`Sm!NUa%WF%T3T2|`DR$OqaA={9lw6fF0M~%
z7IgM&`xK}}7rfnkqc=1J(mlb>j@Wfp_I-|+5YsX8J@m2;UH4YiM9F&d^M7&b5L{4;
zXRf4F4H?WVMaW#aR^Pot`->F?Z|u?|!(w<+hh2SV$Q)NIMzMoThQgo7cvla4fBd?(
z_Vw2Z#q#UMI@6!$Z}4z49X0S8fVJt`5j>{2V>g#1n}vj_63y2+q#uJdask<!G8G~0
zLhajPh=zu~F_}8Le^E3Y@qNrCZ1i>XP)tH6Wep5Sz$aMRmf|Y4(2)reo<C%H<Kil|
z%hgxgE8BrAMUQG9>@kaEs;r4gmFR<t85tI?@baw)hG|O=7lT~9uWM1+G!*sI`xR>^
z`VGlllMgAH;=Jyu&MlU0D)V}6m$ZBEQ&-l!Mb*x~+<_IH9VQv;fWO%7!sNbQP~2CJ
zw>Sp41ywr{@-`gpF_$+haOT<uS}QVh(uL}4Wc@fsXk535eIL^PHPc|p5?(Z~vUEBu
zo|Hzd)JY~<!F?jPTtXwrloNwfW0@l+*KEh;II?U!ifyO7Qo-fPfoqs1VyVJv?BrlE
zZCIztHRx2Fp^KhNbH}6eb&l8J7KP=qjdFkau<<%UdG?vctG)js6nbg2^OX3dq>vDu
z(VG5vot2%<UY}NtnT(O<(&htJsN0j;ugV-q_@bACJIY7hz}czW6(D_P)i5x93lGCt
zsl3AXxn<An;<l=%^C$@}?(fJm<yX;eTxXB!>ah!TcVxlN&~IUM@QohH?VG)nC6|Vi
z$rFU?m4^*Ffw?N@K2B@k{$3HRW^IOxQR&dt7+B}_l!UVRy7Z&jtv&qM<ih3sqQRa;
z<OIR*x|1~E#(n#g??RQp$x5v$zo9*Kx$ckixt@%cDT-j{UTq7aCvZ$!TIsKcMeJ)Q
z&sI9-9lU}!f*I8AD|18szf)iR7f((G2)AFxOa`$F+~HkV#4&Lv02_&ms;2m)IJolp
zF>U>oy7c$tT^dQ+QxpfZMU$`pZ{M6}-~Re*hs#}^>(9lndHg!2c}y%s^|o3-veb0p
zkJ{Jn>#kG1{73ba>fYmPPKW-Qq~Ix#Z~t}G)7Wfg#l8Zr%z!C9BI*C0pH9%#%)N8f
z=wgnRhtkHC`n#3%)=WQb)#q>6y3M7~<;_IL{g<wUJl-FeJ^cpT)uZA^L$_X=-r>c3
ztHJ3go0{HZ<CV<Ydp;Qk6xDL<safr`l%Gqg?!x!eQRfr(y*ijQ+u>q?6t8UL{QHNp
z;`_3qi?WyRtxsC$HMQAnWl8(7Z#VWS^cC=(;c#DkIAFcG)sisg`8?+9*T1f-w|lw%
zZnaD5gKM2Dc~?&`T)`QB;g74%`6KRJR!#ZO51MT|*t=Zl?u$bzDjgdncdx(xe2rgx
zWWwXWxvnLj)Th7bSaa_0It9VDt@E6+qpt!_YTL;8a`DOOLOW8zuI5Ztz2TNK+4^`}
z>zALWjVJgjZ{N61!{eD~5&w(L=T81+uT$lC7-O<#L;a`FryD*`5|P|<?#OoC%}ilu
zZ(KXhHRGAg#e(0Z?_wEGzi<&%U3v0adzXc6*k_XqXZM9ItNiY@W#P(>SE(|K-#(hR
zPVu#l@lm}+dEx)xgskM6wMI@*CS5LLP1@}lr*%L26(6d!6Pxhi=gU7|)Kved2Kl=#
zET5L?^iIqC``Yim?>!&-<SOkA;=l21vawwM$3u2@>p3TPu(`KS&p5f(&gzC_=6&|t
z;aa>=D?a5giT2HP&zQC86Mxsksp&Fp{br8>^tYG3)CJz4$h=>AR~1*S$&Hf*kJbKF
zNuQ0a4P`x<d$wD1ze+;y#Ffi4gw-~d9<_=3>#<we_NCI_mq-6`7`9HGd;2-t!~Io0
zne)y(+O9YMilN0`vtHRA)q9)7#UUB!!tN#WYtrnycDh>0|C(1dcgmB+63cV)(q;Z`
zFDx=#{W&oE>~p;(=g*!qZCEn%!kw<|k~z$bm-#PCKUiW?r@uXJ-7J}3|9*XY+_$Y}
zDnp%N$ybqWicfB5c0Iagzu)BWi_%5$!E28!)+*0V)G3s1N&oEQ>l^;(mpZ@o@*bnG
zm)l?K?A<VHPuSAq_N!mz<Z~{aG~vd@mD`q9hVj-tD}27kYF><UTRdB=ZR@`SmJgq3
z&7Zq<PCWmc@;#SM`X(pZd%XM*_4ee_%Dmt#iMsihJTHbdFV(xfoMo@pT+Lm6mgh`=
z1akKne>$T(QEE=u@v?x_C*hxMZfV_4Z~bTA^sEiiI{d{YaoqE%MUV4wv!`WyHoMN3
zth#sT;r7tBDz-OfPwS&!8!z5-HsI5pbxm^C7p>+${CG6#zTf^A&%Mv?cst9uU-r<<
z-G_FW&V4D~QozS@#ov*CJ9C4vK#T=@ivR<I+voHC(hLj?A0{ibFfbTMfyJ5ym>3RZ
z2skk?NbovwFfc53<X~h-FyT;SVCZ2}WMOEyII5V~(D-RzBDY3ZnfYK7Fq9cQUHx3v
IIVCg!0PMic;{X5v

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-taylor-hood/plot_mesh_boundaries.png b/demo/documented/stokes-taylor-hood/plot_mesh_boundaries.png
new file mode 100644
index 0000000000000000000000000000000000000000..ecf60f930d7e6a56ce6529bfc94c9a518f7a2d5e
GIT binary patch
literal 52672
zcmeEt^K)fi^kr<n*tXemI(f0tab9fO>e#kzt7F?%#~s`1q$i*6)XX0-HT#!$>(r}T
zr|#BT`>Ye8q#%imfR6wM28Jvx1ylh8gU|#61CNJ;_*(hUh?oTfBL$NNepmCzzUcO?
zr_%T#)O7_FsP+d|nO(EQ7wV@B8C8fxu;sz2>`!%2WE!w)DyNJ7C8Qh|m`?Ws*{L|(
zNbg?XCsLpS4RJWxEmj{59HJdQC0N8kyhl{ug*H;AFMExi7*(VlJNEtO@#Ob(*6sex
zo0QRhKmT5#qxzh?*zNs%mHTngveL8y+T7es3jQB!*ze1@5)u8+1~P!;1OKzAOo49r
zKP%-4;jCm|X1F8;OppIERx3(!IjJwh<-$Oxru?#K{0KMz#+OON0E6NGvm%NA|C;|7
zzYVc#DSv#u;>)t}G=J=26`_`i>lSv|Sv^P8*<AGolLqgd+}7hM?ue@2YL)RLjN)rR
z-ktYrFKE$c_eAEODaMRz_2uPd&Z!XP1uXaB?tBeNYFDx}o5%0WKPik>yaFVA)fo}t
zoGFBQPoJC|T1)J7l=|FU_O%h=Cc|_67ECN9TM4C!U1x$$)_NOWo<Ut{HuTdr;|V(F
zM`_Chgv1Um><mB?i$2HIu;bFhJ>uF0(g1V8-=uXtGC?#C)f!#R;hy_dU2U=izqQk(
z8@l?%nWircyqCKr<4{^s9ePOHB}Sp9iqmxqEzCl-?^Ie>rXP3$V%iTvdte;5#Jh{R
zborW`PmZ*U^M0-DwP#rM_wN}-X>+eqvd9OCG=I;HwL}N_?tJa1)c&Q-9=99j9mYpF
z3+8^}x5AFpU2Pak&9#@xSTU~GTw(6xouq088;M=KWbMn>);PCEu&zrgLQyy%d#eB2
zm<{haO}65iEH13w@6MsWZjvqTlFQEVUL->NJKl;7&+DFlShqxX*bIYso_cL;&~T9J
z?$%$oV-_|u2!@F~B@eaxu-3({$GSfY;DnE9_E_+*>Bvb!CC?fTnZlme+*jwXJlzEy
z+_w$As{}K<O=tPu(9%F&`SRD$xE4vsD1=9P<<}jRA+mN|4bPGA$2b`1vCy$_&t9ct
zk^)W7@<rQ*kV$GgQ*dWqiiU7DyRfh)+g3m4SBcEneQ~v#>?KwnIO^?gwCBu2whov)
z!a|VGI?pMhf26YSY2oi}l%u|l1vcp2E<jo*>`@f85&GeF+qq8x&|_igB)(zWO!OBy
z)xGmabKBMqL;7te>_zz27T14&DeYQ|Ud><C=HU2b1_r#<m&@D8<&BwjpEt_$DZKZ2
z5GX!(gbClPw60RsQD!}Hhk#MC3V88h@PhGSb?YR3_EQc>0%C+hNuHqT24{<A`Mgdo
zXf!Sq*9=?)iUhTuj7Wa}mSY=8Agz!XMF^Ju3W4N6+R46z^sAzD%!R8LSRjFbK%9KP
z-Y~L}@|^DO=G5l`O^jg|Y(lHU_9)Xy1uH{zvRQ=Yppzj7hZ^i#fA23lok=$)tp=4L
zS#<-KX1d96C7T@>ltGQ{bRdcR16`OAZL|Y7vN}ftMK{}Zr_0Od!@RA>WBvE7jl$GR
z*Y)(#FsZgywUA^7zXQ3fV)*yqSnK5cAPZ6%C<|c|%v{-~>v|zcQxB%k0oAvkwl8RH
zbMBISD&Yq^s^7}a`<T3+LsT8E%#V*4eAv;12M+~c?Z1(B5!zXKAf0yUot1*-Q@Y#k
z#2&Oy_}N{AYfspT{0Igm@dVA*+N!<R78RUgVqwS033=*OwskoqW?3z=Ltp}3n83ys
z-)qZpF6ISdx;QH^3tbW|nlkVT1pLZSa#I6)C^pRFO$YW1ev#x6Zk;!u+No#2UB+5+
zXN?dgk~?`Y>zprK0qwG{R888I8&5Lym7c_0={`cg=>XWsH_IcAVra7PSwB2+a2o=D
z<Ccfy;B*{I?ffEX?(m?voWUr{u+MzX#5499-8fG%8OHe0q<O$^2^{_EKnE~pKeVQC
zV6kniErG48IjSg4tavDwNVAjKcZFe0yD@5u497xNJJJMX)RlRCtvSdUxnx$EW?7W!
zfl`_v8RK`c4aie=EpjCAM6O%@I*5VP+;6GJJ=iHqwDc!q{diCI##3pfejPgJmNFek
zZOK~iMzh^%wWh{BL*oK;zt51%!hMC?Px`MRm35RA9v!HXS*a--rZjh>Or-)n=`Lem
zO;Q9L@eQLka>fj>1`G%$S5~FMXi}V34x-H<Jgn>%)X+;koLj{;;h0W#(S%^vY}C?|
z+|S`}aNPoW9l*MKq*vpSvlc`Ux_A(+@A|ZG9X<lO5Yd&Bl8u=eq=JERX+Wd|;3~t3
zNgk%SK9M_7r8W@H!6SsTgz2(ijfaW8SM+<(9y>HtJ4b}6L<BI{IFLeAK5+ZD;6>K}
zaD@g4#gd4bCW<Kd%jP&*LN(%J$yZGA1-=uwzpk4U)2`@bq(%6*TTMyEdw`%e{%K9o
zm+4w80^QIU@u5#`xvh>DvilB5vdu=RmcHR-`&~6cVbyR>TEsEl+^L-cHtPMP2mB)F
zD&=V7rXTsCzD@*5(rni^w&z|K{;-6SoDh&`?PAiGywny<f);*8s#}hZb&fJDKwgzH
zbH<OfY81ilarThc1uQyiJ;5cgh^EfJqWqfys#b2or#8ANaqDy(nhST6HF8=-0!F!=
zlKv^78(Y9JTIybascqZ%O5zpji%R6th@&l;J9<B?>&P20^F<Fdg@5a6vS;mRC#?9{
zLmnuKt=G`!gj(bCf*M#XHc%(azn-d8U_TKlvq!%zTIB@$4tNW_2N&!!%AVIeM6ecJ
zGNvebap}MD6-5;*)#8;Js}7#FpxM$-y^qwNq;?ypFDZtQQ57ZU-s$*#u6x?Y{@Vuq
zb-Jim?>m$Gdve{8G|2nHppNm&xCMf(pwex3Y_A7Aj+9EctK+#a)P1j8)VJf1fa<F#
z1*uuPFj~;;7^ZH@e$OLAM<72@U9hN5V|=q++i;*DS9pym@d8Qf$f}O7blB9k7v|e;
zB^)za9oSCV-b&jFAEwyHnXR}X)yZ1R0b{SUVDUQ)FGGK0bLD70Q%7^icmw&`PAj8F
z7%`OnglnqN&!L{wC@qkmTVx{Ud)!2;w>K7y4epLU9@VHkM&I~O@tn7p2XU4WMW183
z!n%^X_$dFi{;3bXhmL@g3@vfSj!(<6luZJl%_MrE;HQf{0=XOZ!!0Nla*pIU8(8<6
zi@cp&X0dl``Px=iVlg=w&gOsUH8UuN(ezil^qtL-{%BcOYaFOYsYMB^XXdW)OasX*
zv|=ZO?tZg>K9?F6LYGg?{}=BLUyBOV6<8LN;_ywbfHhBNX;Jmv9lIfla#Ps}S*7m4
z*8}YalynepnJ4IZp50LZW)T02H5jvTwDf+SRTFDL;`2K*X?ybXEV1qgxlMCJifyN!
zhD}mdx#82b2qGi3Gd(o|pE*;L5EIoh!F3SNEq89p`T*NE&<>Gh9KbFe8{*BzddDN?
zCo*|_dyCy$dpZBT5dW+TdMHy7Mcpba#+r(+=3%`dKvj6LhljQKPoah+kX4s(_iWyV
zFw{md9$GcpK}`zyjXl_I*3jTBlt+a@HDJ*BKrLFqWRDPE!GurT_ZRx55>`pu1NFN2
z)+@Nd>@C3d#?hN%y28PA;9mt(yKTw>&H}MkBoaa|RVXt{3>{s+f+D4vmwf*;t4|BA
ztFt_IOOu7GQRvFdO*@*hW6W_?G=|7hG-BMv!DP9rFV?6{b5g<b7<b$1bUhCT$B|1e
z4@X<Qrq`Bp67=)a)AsxJ^XHJ_-=PEI=U-(4hjgoY?px+U_ZdHCIv!Va^j`*WKu+US
zaefa)O^n{-vLL7DE%&?=wqtOWw;|2BaSEjSW6GD=opK}Q7X-KT8D_Msn&lM+tc%zq
zb?3a^Qc2EPZ5o>}JW~9P$x0eu7A|>`(u^Nv@C*1W^gh2mq((~VHhJt~qWn*xQm-sH
zWh&xi#T;d-N?7DeB5acgg!+FFJFb<Suwlru!^cJYt(k{Cnt~+uVw!YzT(~+G<h@Rd
zJ*R+PPoOK3KxbOt{b_r@`^Q!Nf7!<Z$B_)RFZ(#XFS*ZM$3GF7f8EdU=iNq|BV|8U
zYIL8;+j}h@ko<c&b$N?67dZIuF-+*80G7n(hUnU3l;vZArN(c{GvKS7ey1$ReGKo;
zC_gn(9X2;HTU_KDukt9UWBvFI2^gVDpI9d;&9PKpq+4EKs!erwz8lCE<+P*TpP-tG
z_~l$g_g8@G92@P1`jAomvDAJRwzV}`J2SWDEY0qmZ5KCsp&j;`=!5~g2|+&;83jNl
zfd#{yh7)kqwMTT;Em@&&4-z~XX%`Lt`tm#O{?G3Eey@ilFMY5mgx^TXNj`7F>VEA<
zR@HW#+5da8f1m02c-kymJZ;MRxY)GoyiAm3?hhmRIFZzUD8%tSWYB+I_5WD?&(&3g
zO{hG-P^CPBjfaa_O~2#X1BRs`H^1MA)hs~m3Se4u2jVzmgCRzGd)CUL=gD@Vn5(Aw
zx0dTcbFp;Rs<LvVW`^dn4o>m%8jia<LrL#t`Wd7(^Unmy;9J|8t5<BK$WMp6UZ@>j
zEL%EsRAxW_(2-=nKLMYad;x!>CwI(*dH{PGz6Zvvsocb(%<{8HH2;n+Pa~7*L$vnc
z5u^)vd%D+b+-*NahZeexQ1p4<-1!XAe}S&g4;T3NI_tlXl>3kn=VP*4Jv}Xt{(2z%
zY0RD-E^y2{`}(o-??a<&AB$(pWszX#W#mUJFH>9dwG{TA=B`d~FwQrvv$4AwEdHd>
zQn1P?Fyg8Zwb4r21y#051`3RBPT}JI0^78?L5U*ZyLSIN>%0ZDgl%0p)26x4Nd-2I
z7nR2y`<0I!{d&4&E5PXAdv^K7>`<!cVFboK1H?&U(iS}fNn2~TkQzUy4;18$(X#KM
znTMqw2CbKJgz`o}QhP)H?porZZUdZ{&wbWT*UNqsOZ%V1S^v*_-_gH)sDJy8h5x<U
z`y3DyEAH-mUhXh=KP=>Zp62yjwr;BP9=U7{ev)ei7r`R1$;R=ZhSxse$wm>g=-J(D
zrEeiNSd|Qw@+ukR?G;`Mi*`!$Hx9}SX=5b~(E0WOK-{982aVL383j;@Rk@(|XbxK+
zC6vLnJs>Yk#Xh=tD(8y)<5G@-GOo7eUb=@^*yiuXQkwCRAr{+I2q7~0O!O>Qnbaa0
z+?W&B`_ITTW$QXs_U1e;wn`5)<t#<_KK|0WR{oMMt&2@(Z2k9*RnX^Mn($2@Wbemj
zub_kGW-BZz@dK^`(BQA{ZIr(5ZTdarS7$-W{2m@JZzKLMep}$07Cz{HGC&c@2OfxX
zgvlx4ZjUC;^hVET%-H2+EF0>@3z_~>KMMHky|Ghn58zC4-Q?Vy!x1u1A`)vOD~|q?
z7}GAi#Ur>pK)d>95q!>bBdS?TFf*aAPHF>j?=@1KPce0^ae3;L+3Z9i@29=;LpDPI
zE%;!stzA>zX7eAevwsf@u&_SG0^1=lDaoh5U1Bh<{r|n!^?tt1`d&Gs3O>wLfgUSY
zd!AY#VRzhjd~rY?hA*$~e#h>SV;|2uz58r5h<3kP?ZaO=zE~Dk%*K@Bg%7e=*;WKA
z`8c)7_tOZ9$UA^j<xdxJk|Xm@_cB&N__Mx5?yeVJYJG<+<{9ZSynmb$xf3U4Tt~yu
zuC&V4;9*T01DM~34>=FLJJj#6%hke4MY8w67OpeXa$+zAyyqV%^YN6kd347!eQ{%N
z=D`EN;Z5Z`VCcL`#LAQ*Mv9J+pRm3^%5{WK;{Zh-*?gXxB{NxARgE&&T9c14bN~LK
z(RZHavfbSFI<L9*d+ucE{d;F!+ite|($WG4?@3bY^i>U$CBF&n3U`H14r8C21Nf8J
zePiIaUQ$2%$`$1lKmOy+zg;*Q$T8F9-^S{Rbki2AMt`--FzT#Px?fHNi6tg6HmzW{
zJ|WbAcSFJ~%<Q5pJ5pcw$k8xJ&c;l00SBm@z}I62oy9g^09DFqS>>gALJ-Q_ZH5W?
zP^hm#+$7A&n<^|D2(t|Szd6$%%jM;+!Spg13F9O5I1VelGEUc;7c&B7t)VS<41+<*
z!E}jlxQuZdM9)f^@lp^vs^*i~K`#j;uL(Row=vh=JMTh|6^eR3x5L8!?uGr|FWd4?
z6><o^dNwtqjh;+SDe}pXTc0tI@xHC*jyyQGnk|lG>)e9bBbDcns~?|m)zl&;i8Ryp
zA{I?9%?uVuzR27-nU!G-x51$KIcOv@&Fv-)A+viDXg_8fc5IgXkUVi_T`0%w7ZqcU
zH((Ngwrbl!WjqB2GdME{^paLsx{+vCIu4eK{v!%2LZTm8Dks}L7?oSU7Bl2A#xF;L
zwBA%kCYsl_l4BbwNyxlAa6`6gc+5x?Ii{NTw$#@9afvGQvWv{~o7F*6jqcR<*Th$&
z{(|3(W7w#`<S<~Ky=rwyVF_}0>U^q^0bNswV2cD><Q^?bM1Q!J8smgqU90h%%U#Sd
z8X%#I{Y>82><4u?+|i=AW^+Vee*REv-N5u&KHVyK&%Z^Gg`s4eK^OADIATcA@hg+7
zg=&X_F>+kc;Gk$wXOcO4l<-73;D;)8HzMR+Dr@dUYRf+XFI-gY7AyGY3Y?Vb1)7Wq
z?yR)N7C$LJi;{y`+OKq~`xy2AJGz+r#5r^sKKT`aw{iY||MSgrj>ldI&gbmEzltxf
zU(Q2DZ$BxFQWrR)Y<NETcxsfWOAB`}Aq@-xEcRV+(`75hU9p5#JP4qm;F^8+<<%7D
zRPAa;Kud?Zy_C4b!PQQZXwlT+9hqvbfc~z{AobG(=<Gb5?)wXy2M1{|Ls#TaiH(jY
z+>}<S$2kEeRza}sv<E>l#R;x)b75ChGtnS!&4Y6R>~%eBJBLQ2VuW%dln>oU@_3;3
z2Ai+I8yYg+*>JEr<e{lOuFBHnQ3#k|N{q{X_%U$)vh%9r{0o_^ZEyEHZCH2Lt*opF
zxGlZpUcctH+LCyk6nr5S5&zFa7Jn^Z&-Htc{jjkDwt1K;JNlmHoI=mwkH3)<hSVYU
z1Z-;9TtO#qi!x9R3@-M58Bm*l213LYB4y|WC}y|h<m6_hW8kqiqAA8LpGjc?KlXCY
zHk0joD6q=X6D%{BY<?y1^JT1eVH<h{SkYicDcCqc96g-yQTUK=lgg$cisdeb$s?HC
z@YbBhhHJBm=Rg&{s31nY1vr$JB}G2P<OkzgCg;9L^)hK@KaTsnsQ)P`GC|2#Uv~j{
zG<U6Ub~nMy`W$hv{M!Bb1w*DO2KcYL?ydFTwUse_X+Uo4rvE;#|9w9D|9jTZb4~g5
z5z32#vudhwntBcVf?N>P5I`BHEc!CMguwD1cz1)5{$pA`8C69<jTw%%GPy+Wb{TH+
zRW?IlU!cCD%Hkfw^a|(h3%tBUrO2??vIDLs3U{H)fu@?x8N(fSo0=6klBr@J`PL)2
z5G9wyDjw)E3oR3|NI|^jhLdc3;!$<TzWwwF{SHjU0HAh#agNJ?hfGp^FLDxzlc+x@
zh+;!4l`5i?$q+(cETK$y+8z`Hiwbhza=rFB=KqRV|Gzx`_dK_IX*~}mY26p5|6#LA
z1PI-)e?$%M$MRqG<*|6LPulgo9__s5?7VjNzIT=hURu7~{0Gy%61Kjz^{Fwf+h*8!
z2K7H4BM`STgppzfG*8C7#TFPunX|+|tRgpT@;roMiD7CLg*5WsV)`d0oMQe*9s++?
zV?l4pe$~#e7<|;eyG!tm3=ijl`)V9wQ!0(ZkQwul1!+`;r&!N<1GmsPl|&+_Mc3Rz
zXitelni+}X6_~I-w6Q;!ntd#V>F8D|HJYgp?KAhw@pOTh0FzmADPoXxUPdH!FCls|
zQmRO<&l&Iqva^I=#}z+U>_1jIcRsH2{*LGUozUpH`wv^{f1GLX@bKh)!S37o|H3`j
z`)V&w1LS#luK(|i!0y*x<0NzEek6n64XppoRp<5g`ugh;Pp{`e3{PSB3H@j`<<nEn
z&qB5VH6vR_2db5azgK~^0%(H{=(YyR?wsG|N7!&U7LKN~ypmuq^Op2aWjW3OPr9nV
zuHgCeW7Kl=Mw`*>3D<Op`|{}mOkTU#hdcTvK;z7HG~W{QPGGvN9fR>OmyAOmgB92w
z_RSZ12_RALVRTVDTL(pV+k=`1FiZ!Jojk<R??q@H1-;-V{k@Bb+y+&-Ls*K3dDV<A
zd)}`)PfN2t_gOyoIr3ho`h#HoA0+)BT<g5IOw;sA<2>IM^ZaH7pFIGd|B;Heu0y7O
z4~qXDzF_H&qQ?Lr_x<<r=hgM+6_$psW8tWPk-*>94-^bykM+U5u&?19Ng>xbuteCJ
zF0!Je5Lek-((($eV3^v9`Yv$~3}45Sr-AR`Vowa0FS+c@Y*Sm?db5EB@w}t>aA=Nn
z(#(rlMwy%3w`+`r(z&mzs0FqNzyo1U7e3Kcegd>jzH6=Ff7g^x{>d{1+Ep^()D((o
zO>Q?jElg1k{x0K&G?<%4{TG|pojPhm(}1<?t+;@=*{z~%z`Qs~Wa%DnpjzB3n41q_
zEdPLBP`L9peN^CREP+BYmJsjT(PG}G%gbKMf6h+PK;h~6YCwE5DB}tPLKJbf84TRC
zQp~_m!X9z6lr&bf+QmU1;MO-YtLp{)q}(AZ>ad3Itr?pFC)KQ(n3&*wbaF+d2$-Xb
zdlk=iA&H_krKI0bd4G<qRZcBC;-au-k2V&joWi)aUa)%ow9oLRO)Xdl43_fS1;3m5
zQ!gDjja8UCu$|Kfb<sey7Uj+PmW){%6Y~nv#}p(G`Tp`id%>O+tq!o*HJt<PL@*8K
z@6=kLsi_sx1KanOA3e_U?FTdy!X1)tN`+yb3U@-IX}O>6u)cR4=MJ!VdF7Nx(!Zsb
zp2->NwwiORrKZ(ZQ9p4zFL5<!#Zkg+m56T@FrcgAglZh07Dk3y&Q@wJBJ;qBVXMdX
zpf{ruuoX8)APAo6v1d;F{_KNWEX#y8Dcy{7+7nHo8?z<vg<2XAM`hc+p9-2_^zfNa
zWEK#AlcsfHBFuf)U4sP_)^241K)%Cvl-UXwL~GZ1wEqFk_DVtQj?jm;H!=1?s6$Th
zX_7(=+y{+aR%~U&7%5*%1;g~=jg5yuB+8ZW`6h08a=joJABil*XGyhsnayy-AM&At
zM*E&A2i)<n%r!A)xv?W{Hh~1G{D!COx(qB^d4nq)G2%DteQLyqqIK%BOLvgX_aeg6
zLJsJQn&?Uv!6BpfrgL*P@)pcXBMgdx-L<m3sJdI%Zu<itBilvK?=+FXU<wJl$<AQz
zBo}iLWZMuarDM6ECV>R3*z!Vg$rcWdCQDDgS_$uvE0zzk_v$V8W;IGU6|<0{`;-3C
z!s(?F_<<)Y+v507p5mLR5*2jS)tFon6zHw``CXErpBOI$r}WY4dAFrbwhErQxL%k!
zo&5RO+fFZ>X+|nT`b?;vc>Z{WDa%7ndn+BDKF$2RN)LX=Kk8}-FGHbpD5;|%r5QQY
zmH1)pK^B<oa#$0B2H}0=WY4TTq)iWKGk3(SMg2u<=<Jx}q|uf%uhpk^rYOVIzXA_6
zqN#hF0>$VZZ+J^J9$IVUu_<CiiRI*BGZZ^?-V(Cs!ovx-IL;EMt~!DEV?SWZh~4a)
zb$;a3wsfK%RYJufMf$Zj!k<RUYz*FSGkRZf(dxOEW9KuA7pYME0lLtF5aiRbMR)Ns
zJZi${4$+(`P@|<Ec5S>M#2qkZa44f3eCE_OK+<N%$#boUM8%s8yrK;1+^cf+Onh3B
zgMk+Q-doQFw+6cC*a4vT!A8RwF65szkKr-2D;N_9gLQ>IW#3>lmOkZXVb~Ycs}LXU
zkV|v%bUFn?%1CZ0t53L#1w9Z5L6>ZyL!~u2^Xp-TB&S2z_JgcOl(z?`_NT?evW<n7
zEu6#xNWNXI7DZ<IW?LBABul5!Eq03K1Rg`m8ny$kQ6}iI@P>^<WdsgEt(QYE&>592
zEw!!b8W{fM=AUAhIJq!4HJ|ZGnNmQ)dEN#L_*Qn<=kU8^GjVfnbKwl%a3Lw4bjeTy
zaZY3BWbUmw1f9DDM_%K+QjQe<v^NTE%9_K~F3g4wVr^kg6Y;+f@*5Kb&Q0&IHm29`
zXJvEc7l<hA_Y51_f|4!O{cyqKMT8w@4x>FxorVRgc$gaJ{F9JzI0;>m#UZ~W^?Adr
z)*8)~a^ov_4DCLDOrk1$;}!V3#<2y7E{(nSYpyJ(Xua5$zuOqW<Ns&@8a&~eow{7z
zIm4xr5@5(@kmt*7(Wy#%%cP;G1E6=8TP$rt@Cl`VuHMQv@X2ZCg_fmUVY<tc?6zKV
zU?9_o)6j-Tg=)cG6r{>~QFBe>*iX_k84i#28CNd~pO|8$i0lWZ1?ef|j@6`dGw41#
zd~gz!bUo%Jv)2^zKUpp-hD)OhGepL=>$dZ(aJ=IlT{JxnJodw9c#RVh;(ZkecwY{5
zX!PJ*J{mSf158dl4r_r^WIuwIP8Ks}dmZ4V{_>|B422^CugGlZm4{AIMoofi^R)&C
z_SoQ>SV%j9xk)X|lsJR4<&BGRRNJ0**U6KYWT)aL+e5NfV#aS7XWm_}y@5dJ4`c0B
z6>0f+)(@_b=6<tb;sGAA;5HLOQqONczwI_1Dg`_eRE<CwvWSBuaG5K=<qRdFcMBO%
zYM|OuXXE@wzmTRJeUpmP!t#%`a%xG{<ttmr1fn0nEXUmp1W(oqMyW8yC~`o}PEZt-
zDV2+Cl?IIiT7xE?3TgDK{vNN*DcCDRmSzd4!wd8|@!GuOI)i**0A^2S2EHJ=E#N!a
zSKlL0BrnaZ;yJb6oUvB*FWG^r<?fOVs(inrC?XB=ias>$tV;y!-|EteUa4lwv~5?c
zBEN~NcNP85Bz!a&Tvg;k;fgq0uGv8q^%#AoELTRf^YdYusOGBr4=q7YLOsoV1aYn$
zQ)B^83Q;Kw3Jl5LNEd}few-GYDgMA_xs0q__;f6ENR1(6;~kS4{!^`ST{egPQY`*_
z3e%=y&e=Oe3adfIFz#-=suU7aI}WN1?TwsmU2i^aZ^68Vf+({kU_VYD2l$?c6y~ou
zj~C_l4}dtvWHgfJKOq?-KvfI$(QEhv`IafEix%3L+B7D2h^$MgnWl{lFsL2g+6M|<
zEJlpu+<~d7j5o_V2I&a+5S9VCRR2YNRuj{h0g!pS&(#jpX$30i4V#aLDFtY$d}1m?
zz;(Cwt#qXhBP!6(h2jW35+x^gx@?Xl4BS%~V4Dq@(?_vK7Ni!SeY?NXKkuzHt8t;6
zD2f#yv@xjiO{Yn_!p(yC!t`68v!|kT`^kPB#&4jXIf{3jwvON2sU-P8!uMH6*<R%C
z9IqUO&cF(LeBy&d#+K2>26`Z_v>|=L9xgvBdq!L!^V9(+toZU6_Cm_UT>RAvEV&u#
zfSFkn7z4+w)7cb)dzl$|?bP*)_|SzsODeVNOrFcLaG}jmd^yHB{&+bC$ctP@#+;+Y
z9ph;elETa_PGlP3QOZ{moKLAqFbal8rOE|+)1G>9=5DNsf0l6K#^i~Wh8>n4-E_G=
zsT5@_&X(PigH}U-9nWf4Y@0p;(T1E<UVKr`CP^{)PA_+ObV0qKe48O#DH!yivAx3k
zr=C$W>zpC9okT4Y*E3}LR(~yqjuR66cc3EdY}epR*$fX@yH{w45E#YWTI43Fo}FA>
zPMDHgfL~^Y^9hsY?|k-$K1fb1ORX55bX;b;ioHXH8{%nlG2V{HZ5%sIHy^tvI0_#U
zfv|S&TX8<v=WYUDrt>Gm;<GY2)!eW>Lu49R8|HP}Gs2C~)8E5w+y4DR`nLoB-V1I9
zzsfR3*t@lC<TqhM&7n!>Dx;ZYKqNOJ`y}CZa&dQQa%vys`coQ9Am04SOvRXxMH!y<
zij|n&AT-bRnjra<gm}s+e5}on_sqY22%Ok4C{5h%!6jm5=S?Q9!ePfb71-!>Z=&*V
z`N#+Zl?Ti{xY&R9nRGqCIwJ{oT2GmY1#NVgXG=e4Iz*Pbqfz9%h!LWdk+;}TEPwSx
z<QB>g)|)Q!=ro48^|mU3zomu&U@duyAS*Jb@I>{oE_}b#Ne$%qj7!+L57jFXtXiTS
z_nGB%LSB~C>F1gnOM@$GALJHf5nQHyg2jBH>(Ru;jUcY<Li$sS3b>7a4XwQsWdHq+
z(9MewI3I-^bX!RTL29e-eGbOPva=@wF0s+EjA!$62hosy$%Sx8uXmZmtf!0fl^>hr
zc3Nl+eQFCGX%;&;<zl~<mZ`!UWXq@L$u>`JeO5TFG#tw(tU7U-O{aqwL&Ll(4X!z6
zQ1}$q{N*BNplVv2C7<~c=;=9JwMB7-DDUhb^sS?eZP$rBSt|+{%Vq$_%OwnnNbAXO
zu{|}(C(n}%&K+!VHV{Jgtj4i=mm90hz=jAyX61e-O&xblj=F4>Py`h>_~-P^F7MK|
z^C@>*svy!p)*y%~WMlgu%#IK--ly(pi(WFyA2sT%r?PWqiFQYFn3#=6ZqG=1IwBO>
zqT#t9nB49u1bW$1`nW>n^H6F3eS`FXgt7^%199>J^g%g?RC-RPKuf2T%hA_xKw++3
z;W&ooi~W>5zo(LCF^gWNOSlirjMg7`jjC#I7V=tpY6V?Q;)%=FzK2R>>J3e&LTgOW
zcYNkhRC?!#Qm1EG=BZ1RZqO0}lWJzUGcPqa()dsF`b!IfjKwnM?9ggRLN}M$+uB%n
z_7e-Q&8?il$vjJ&BhzGx$D79eDlK@e9(Vw_Wo#WtDO6)Uo!@)wK=^u$*50#~8cm)M
z3BXGIo!w}_BK`};=flGxF^oC?aF3C`A}%ovj1OiOx-6%hG_&G)o%@X$F|}Hbyyey=
zVPp{x0w&DJkbKzK)+qawSVs3<XCGQZv~ovEn^P0Hya79sX+nyynZ8-6`RSOIq&s*g
zKBadF!&mdkNZ_<ojRjGOrhg;B$o-U2eE8D@CkcaMbvcL`k!20G%AA|S1IEJPqyl_V
zY$H6ZDX*bpZ~lfW#BNCV-$9`V7N-S`=fC?VOB4JMbH!xzirzE1I>CN%xt46jdrf(+
zdFq5iVl|?JRCEC|=jm5s-js7C02JfV^9G$3c8hBD4OraqjVyMP`zgxd>`;e<Wsnil
zcz?a!@W^Xs#@Atr?<ESBDa3w42)<e-SNk;kpYC`fL7~NwyiwRUG6{JGcTH12ytOAi
z5|S(3*<qQy?{tDQinEFL9+S=<UR&|YxOR^e00n$hAvfDR|H7^RI`zYkx%_HlQW4QG
z6N@S7RsKpXrA<#h9TAe*2o+%K<@WxDwCp+@wOy(%IDaD~sd$0{W_<;cc*LFU!VG}H
zuOL)>6rzOx(n|F4Gh`MZ+{~C|hs>S3J(X=}>p~mCW_2n!!m<H>inaAbj4km62sI#$
zIOyIlhApzE{s_U8Vx=j?&<FH*0p+to2@88B*a-uF{B+A~dy9PZko1azj147DRl-Vf
z_$058kc3ghk%ac2Axbvlos8MAzySbi_#y=i%|h10I?z8nSC|9`D`-#!oSIS7uO#BE
zi`W;Pt(}y6X01$&f;`)6pa;!jNE*4*B+^cx4^J`5Ed?5fXb7B>ep7Sn5%FPa^R6#x
z*#oTyBad(o%_VrchMa|}s~yae7K<vsQ}p%N#FH(sDunhZ=T>56=?W<KET#P+p7tM0
z!Az|xDZfvuD&G_E+Hx{}u6|~0kC$Xq%9>yg-{{dIyPV?!%+UNd7K$&KD?=|^M2Z%_
zhq(VXTWF-(;gXJZD@qnk@7Y8=9(^Qhr}`i;0rl`VBqIvmEn~|Ft$J|7rnn=fef&FS
z3N&gfr0<zxb4)or%NYfhwM8p;XHc(A4Ff}cVv)C91z9R}0z%@tOE>E!@E^p{0opA{
zj<A`(^;bDtNQ#_v-c?N5Q{zu1BE82h4jMK67*uT=C-Wt*dnq-2^0WHK=xZhQMN6Mi
zB91w8j;`(<nrw5a6w?t1RV_1gn~d{iPju^lhLwe6<-I9ul=~^nNwqBV976Fc)60Ce
z(`H9Mb&A37vNfNH<P-sss_;mhnnk_wHxAZ&r+>4<OhevRJ6moxPguwkoM}SZD<YTz
z2DIs?Ld*><-ja9+NQG-k$7P=h2X|AS>+xG`S?b6q0?e@UACgJ#>3eTH(S2F4a*{wf
z;4wG4*QHKBob<9PbtN9yvU$>dA=ow>)U?b<Zt_Uh?Ts%Ij|Fl4(v5;C#AvNnW4{Fe
zhR9n770QdW%8T2o<B=I`#${KNC1L((CyY_K_`nSijzABeDGz5Fg&j+%79IGwgx%rT
z9!FpWnY7N<8gC7zD;2~Ixq9N-{|<hpKcJhgR>I!eOy^fFUz6@?7$*j#ut|HTB}x(H
zr_@R&kcs{6Y`Jn$FklF?0wHDM5Dg(f*36S^rtRzp&N9%mTAKO&)_C^8`c8*B^4_OZ
zg2K$qNbxjo%7rLHdcDw{;zuw4ZF!Bqen(jOD`2SJTpW{c=3!f0a-9%n7n-YUc-T{)
z=9S+PbnxNW=;Tr^yUx<_bGN}6x7CPBiytfSV%xnk)9GU1*JJ$?WnNjZ*tGV3w<p;d
z6>1Jbf4F=azGEfsY_V!T@m05y!f00oi9-~oaRkWDu};XgF~Sv@8h)C3h-`0(S&82k
zgAACK=Gv1-*TfHgE({1G5gklO4_#_0TDbc@46iWK>OC?hXgXAXRS|Uu!EKs70GHz9
zJQ=lmH|6TY;Ej_nh+nayTy-LILVx#Iy(g}THhKyHkeY=V8#$!y3VIXBU}<ywZmSBB
ziEk-%M4we(LqvCn`8m+He3ZGqF{f!6Qj}fIdWQ$5%7F@^MVC+K5OKykM;ftf2lmBV
zVO61ETkX}BL(5w<*Nla1-+KHcgAVmtip^K+h6I^Gufom`148o2216Lf&aLj*8g|3K
zhCxGPwp=Z?DeC>wR)u%{f_y`qG5D5yLwk;7=Ct<e%Xy3Fm9MxQs}ejqzjfQ3YNdW!
zqIy{^<~6SnAwW>DSbg4Sm+%z~aKM5SMtIR?OeifOMb=<|=>ZIklCG3nu!^N@>Im+c
z<ti5mD|~$m5&C3!Qemi1WSR1NIRyfyz1UYRR4;IIwi$k2r~APQ9GB6~)+4>qa}GW>
zkUDs5S9s@YI_%ueLH|buRAOQYk_kMxCE+f20G-!B65QK~(pa_PD$>WkZqfmaaTm8e
z{q9jTs!UeEo(CpF%pP`-(WPj|D!VD_>5gC#E3lN4OCS-et=sKxLaSM=ncM0d*eXpC
zO2B9`u{u#9teP^BK)v@W<tWf(L^{|%w(A(a&}+i2WrR^p&w1CsgzxS;NfpyQ6ltY`
zER+-9(M(sdBLP?Uasr;ySqS~zFe~H7IwiIMz~h_kRF*@i;gewbR30eD&rUu6`>i;L
zDMN_Unmsaf)({ks`cRm=-No82KXlmbC~9xUJn_r4q+VxbZGz#ROuTGkajY0RViB~3
zEsp)#Wo(p*;y$STkpJ^?$PN=4x3wIYj;n+>Op$^5ciLVY>DW|!6k$j^xUpzT;<WiP
zJOqV=4TsGJnIU42D;}zX3&=Sc9~*48Zr9zBXJEbcL;phi)taTp*vt|GbM+`!ej$l*
zj6i?s^9di`Sd@G~`6oIBJ~?mO<Ej3mDtND6Cl#+bpS%Ic3g_td@=?K>4;F>SZo?OO
z&}39;Nd#qaPY~Y+lsyX=NQW~z?71{*)mc`VaXa6Smoq)WRqm7%&tNf3pM#UEsZxy#
zJtiM9oboLmgPz0$-PX%br7=sN;L~c7@3!~3neYru@lGhUM=Yy!>;q=iG9|b3OxKj*
zAF~oqz>q&is5Ow1XjLq-3A*l3?V=7xm_wUu<b~7Bu4uB$zH&~8vr;ZPtmm(VoMKX+
zVTwE8Ok7JZog~M1#WtRJawf5h)z(baSwtr)c|<Lxagj~awSBsKkY>G^<Ad#>r$xh%
zQnABHDP-M_%9B@^oP78qeJWGbWXqx8sT9LRt3wQ4?sh7I^GGiZGiP=FNFbhK?^--u
zIgV1^)~DPZztFd|$fY0wId&*a?({%xzCflF*XwM(OPdSogeg5;Udmr&Y4j?=!Wg=3
zBPw9NZ!3hFi1DcA5u`f%>Qn_v;@RUo*lQ9iP5e6c%V#V^ZLd*JNn<{c2bj}3jM`k0
z`+#eagT`J%==8m|=aU|XR#p<%U>;&NerEHDO_RVy_rGVR&A5ScW<VbqY+)y+9ircx
zdjd<tOpeoClNNp<bysu+w<^72y^X~GkcyPsvsl^(<1S<_Tv-wFUtEF&SYXw%{Ve<3
z^_~H1XeAwGeV}!s<H*Rujt=wTnz@0Pno5tZ9q9sOWt>YF0aXN)y^V^_=|6bUe~f0w
z^YiSf?e<@PTNFe~D8?tk30)k6Q_xwEk3SJJ=J?Ynvbs&bgW0=4r*DK6kv=+nq~H<A
z+zksj#p5tgZJ$mVWB!};O4dGs9j9zS5~*9M$8SW*l$r9D*6QX0$6#)J)f{ESfh`qj
zR0SU1NRg4a2QM~tokE6smlSSOi-(B%7s$buNh66J{ZlO1pXZ3$n1v+=8s1}5$l^vh
zG-l8ctl#0GBok_uie+opX6@m-uaRo|Rmk;P#1Z1rcPrxoxGyv<H)gz!q8#5Hy8d&K
z`8oMSHvSp&GMiSq!vHRa6Q&=L5lppGf|naSk-X5Ta41mAkX-R4<VsR-xppLE8NK3E
zcR7vvl}$4pD>i#bp_Ee32RD&C$M4s7JDKR2sGJq98sgSdY+OPiMrt!DwCG|E0}uHi
zK+E_xY<H{{LJvJ|$>k$eOqlt+>nTy+v*9ig|GZDX2}&$d1l(xw^7AxVOE5pP=V-ic
zi#0P}e?z#1HKLwTW>Esoe&R^8;Ga?_g0z8<Xt6q{epzEZy8B@%1g**Dvx~Y(e<nB4
z0RUaxm`xi$hXhfv?Paw}BKbsrKyx#dReB@)fk?lsPN!zhx@`l$Bafh#BcDI|v5M~^
za}^z=$Ebr^Si1wAex%orE>UD7eWnj>v&#Bke*KLVyn4McpqC{3sI=3uSq;Pf;9D~E
zy>zsz6C!B&Fo9NIX2L{B=EV|S+SUs=g4rsmcCHDM?8pN4OJ|kInorTuY_!11QU&D*
zUB06I2D&rBcEF-o1KT))Ic6b2GXyxF_`O{>&((MEo-&Oj8ulLooQhgmm_ndS?9yt9
zG*W}|IPT^bIg(Kk&)~qa@lS7`3h8oqgc$NswP!$>ZH;^F{(9XT<7LOg?|Mw>L$?q^
zr@!vNi+y7(Y&pOAkAaUk(B^TT1<%(A5oyr+uXyk2E;Xr+wyA;Wt(hXefApH+(;rTp
z7HZzSg?%X2b+&K|+5&br)Eb6MmK@9(s6ccx?OLE(wqmiJaX(YSD^sK2?+rtXyg-IK
zk|cJ5AM+!NN8ypCk+|X(I#~u})qEWyT4Kj1xlDpZjCwcZ2y?-~{f4W5BQ1<L9m3Pe
zB{lOxZg-l!|AZO}MBJ9dsxv=|H4a!U!NuklqDm;?374wKnO;RP2=`dZ=8%tD5t1ZY
zx%kX=DA~?h3X-wX{r%JXd*wBov1;^tExGX_cL4;^T;WqIx3=n~x$z%4#v+SRiWIt>
zd;>c2#+tiMEl@CWYa{`F)eU6^(KS))S@=|DW!Fls0(;gPk}pdfL{Nk;nkP%NWuQW9
zb;2k;hxV=vYiH~@nA+e`3Ii9ZI>iJ&gs0`5^pLgzYh3zOqY*i<M>MlS-NT6&iw~(V
z1i#oC&pUSdM2in<&C=ZNidjy4y6TY1NiHQ~=;y(I9fn+^9aaQjLkDXT(v&weLp^sY
z-g3m3g?v+r<&dlJSu~sEYdklGNEA`aQ$tx1vph<0oiUwhVRM?{Hk#qME2Un9eVD4d
zG+gjYoHiVjxzv?Ge5HgzKCtjtnBzp(9iGOHHi);-$}HzcxTi!5=l<`SZzI(-LzD-L
z@8%a|;-Ye8#%Zh;h*i~Eg6KajOW&|v)H~J5=ApY0nw@p3&%F&wLU^ER{o<By<{FM}
zhDvS_kp3WsRt*L_l76Wc`qwrKiP;hR$X!Mw7IqDVmfb{*XMf(76@4>A+23pDz=l@{
zuW393zW%moBJZtlAV@o=Z_3R_AFn4oap=TuKmt0kV=u%?kqM^TVK$wY{A!)Fy09wR
zPutaof@_(sT-TUg?Q)#Wnh>GJ;w(I}Mu{S(vQ_d5T$X-jSaKKFFcg2p6U)4}7+7d_
zeZ#koX^;o`g2~61)9c~Iy7NVI*CL^9J?w7PrTxX%8>IRVkdQ9p%YVDiuTmY-{|>o9
zwG1^(ydJ*xD%(V7)@E~7N~w4N%WPx4Uf*l+O#M;vwy@zi0Su{T<=w~)2$7(K58|q8
z8kjy!4lomEGOd%QRr%A{q&$UvufmAT!9Kc`KS%m&1=%<af>+3BJrmYuYRe1a05WsQ
z@<nT&j-n4*-p=}D?)UQ)sgO~&_@Tm*b>xo_;)RIA_trAe3O8XD8!99>?Nh+VWegMB
z#&Oni^zzC`<Rf#A22tZu9l|wFbxo4{V{HWV?3YG+g56w_1!D$|)O@U_e`$@ghqf6q
z36TBX%I<~y;c4yb7>#2Ulb5!UQibduf76D}foB;v5KMl%%djmA!iPqf2G$&bZ4tNL
zC3T&>JisUuqi0|?ZB1DGz~}!SH12@aJT4A7EvX$pe<6m%Qfh-1M2B5jo)H5l-sLKp
z3SY;iEmGIKY$1b2%NFjJ?4feO{cp$_yn(HV%}4P@sW4QJ7FqA%dYwSVb&cwmr<lxv
zQSCL8t(R`~64qi|4y();g<+tL0XGl8b;%4~*_huA7k%H6viFiHBuLekDOC)2fe6Mo
z+z*C=7QJ6^gpA?%H8~ZdmRjqkD-Xzo$ZnkfET*m7${^BVcREB*=*q5HuST82{XMx0
z&lx2i+S92(+u+nit3HWv%p~>GPwyf7m7cP`$lDECi8pif5L-P|jE6cDUt31GM@C*7
zEEIZTIec2<Rjo|Xq-jruPGdo-;m6m6vG}HBB2sF*K(lBr$nDd*x4isJ+-vA9H2|JM
z<STm%Pp_6L4>UdFFBk(?)#}!}BT}^Pi5n{@#zv0Rn;^HfbbGDe?I-Qj?XvZ_AJ$f8
z{IoT%@$4oTB*fzMt=j@%=hW1tRIwx{z1&}43UE(1xJnG=lj@Z-NRF6x6)#_xelDxS
z%ZOvmLZKFH(pm&8x`JVuoL*insU^zmX_F}gXNKnA0$mts-Z{N1Y9q6$CRRHz5nU&J
ziQzs(orXiRN*pWj5+n-DU-z8f#QFbfWTq(%y_x}VuK0;ToB#W08TDmHs5*U>xTd@<
zUNz;(?M}A|DbKBx_y)YojR<RS>4C;XiAcQY8nbv9IqRVq-kebrC^_TOcF#Vr*sRX8
z8d+US@b4Y%5PiK<gObHOFDoj%i1~|#R-b4FkJ##D?A$_13=u!SgsApPsDEox>`)N(
znJKhO-`NAL>=U_3cfg0}u6S5y#-Ba35vzJ3VIC@92BWq7i8SN6E7Wb6A6VQ*WZxg@
zDxz69kf6}HC$ZG2>o9RRcn@9-fbB8<ztbv4ue(Dr$yAscJV8mhY9T5s*np1KPFZ_<
z`r`xvB3&uF#Z=_3*rQ}3bIC&J%i)myAZK0cdjz!MKZi&J^3%vpBC%H~VP>-3MZs*y
zJN0dDT5SBFrB0P&Z?}=UDOaAO$J!-ZGFv^_L;O_+q}cIRSIaXOxLWOBNBK!gHd};!
zSvy>04YKv<yw~S0ig8mesPF0m3oV#~_MSn?G(eCW-@$$le-3+V?R4cm4PJuh!wun0
z7+lq}w48h<y<HrJwYRtTWSq>m=LS01IJ*xAUHrEC*Nwd}q;}qUvl5IX>$D+>^B9h(
zvf<SjDV{|U{p47AH`hhGwW?VoSoW&Xy<-cqx@cZ0YnC=VZ@$>@Pv--Xube&~owy6f
ze2s`<#jUj~-cBK}qGI^+Su75@3LyqMT_Zlhj$%`eD7~|``mfHuwZ^2Wt2zC{)~hYx
zWvutNQcyuA4l2$du8_6Q0NFwa3QR6$pUIp>^Q`Rs4YAA1#BHQOrv)0@27qYqe%nEi
zk)f6PNKlxTXWRS1;!h8T0@3H|WZc#<!{<v<50PIw;{aP=NB`Kd>oH(9>ab=<Tz5-$
zgX*DlAF~|WwKxn4ZzF^cDqRbUss`^sxmjYckh?Ih>!C(Y@lM1zfmsGuCz-MEJ3c@?
zPi4%;JVdG>>@GZ6(!?+7VvFHWUi=H@6AW*6H@eqN*?)l%m7ezW9gOS|IPxOhH%F5Y
zj)EI3b59Eyal%C@o=OBc8=nL_oolVZfEgPBm9QOyKxGser4|Ov_o*p5<+dg$6ToB6
zUHz0FL5G}Rk<wBp{^OG>F%?^zIpAO;Bm$2l(Laha-9czy*}MZ1{v9P}N!+CJr`)2d
zX=r{0S%W6UM@HB(%A>7KT0klLeP_eJBl4B#0CPqbej0K<DFUeuYQ!VSKYR1x1^A`~
z7|ZBoCS<h|G;2Q^+0wX{mnDP2tsD737u{yvNm^@eL@r>Rz*YkfMPREfwZ1WAAkund
zxAn+W<3L0-rN;`yZH>$)K-R`A!honAWMAYNOwKIN+H{&CYt7}s^mVbSv`MKVrkVeK
zqT6`8GxPa){`h-n&oNF3<T`P0=f}KM8$f~X>KuOKlH)&B=~{A-<RR!D_IO%)weZaO
zXGkpLte&(--VN}h{b@L)iBhn<z!SD7m;g}IKp@XU@ZG3(zR0`w!D7@~J)@3YmCNNa
z<-Xhdkkjxo|Dt>3^BDCV3CF^?iM{ViYtJXEOKbXfmt=j>ambTE%zPNRp!8w2#ROQv
z@wZ`8$;ZNn-;K~LLdV@|9l{{<zHnSZ-_-&Q^*mhP49klF{(+9_fR2;?>FGcCf?K~1
z7;vucvHb5kd$9b{b&HCC+cnRMW$J1&fS>!}U7d#&LrX!PmP>?6PpVyI47otIhOAf1
z@$waEs}xwu<fOtR`Z;>~X@)imj5o`_-YM3_HR2|2UFETicma~p9SLW1Q?5ld{Gf@5
z!nXgT1yIs<#RVx->AA33o5_E}lEX`=l3HD)RmX>ffXj0&&wyAo31L7uU?R0J3lZ5V
z<V6iIzeefx_DFab+`8fgJ=2`Mx|A9&!-Jpr<OU~vv4!wGdFJX_3_&MSM<tD^yHaDX
zGa%tV!wxM?M8)LIX?`4aZ8ILu)w!de8CPX9;Y(Wv$}$a0;h!#vgfgSpx!iZjMj!Z&
z?;7coSV#IR+5m!j-SV81cNHxsf^Sg1-1PpsbvEqp)x0Q-b|No$==2W+Dnxm%`pt2X
z#622@!!UfVh9k&Ljd-<|G}{#+rQ3QQxr(IG{Glof&S+n{zSV!bsGqwTUz$&G9KDC7
zGNH#|7QfrewjDp2nYWd;p2u=YK`W-doxjsN*||Er98zopP$`!}bh-xP#z2_V%>4b6
zk>Bt<oCJ>A$IVzdc4+xO7gaj9uv^x-$=ay8vNGTSD)VQL8J@u-mg*5}HI8l79bwGh
zU)Jv?8eBo}MjmCOEFFF=Q+0aJ<8m|`gLL$%IEKt^EzRPRs~xr!b=8yxcOs=<xn-?J
zWj%{kjRz4Z^2UT`yf{hJid`uU&cZ$_bRq}eZACV|C(-InpB6gD)6%|TDI?jlPI9TW
z>_y&ChiqqCf%xZQ<Ug4wPS-AU-hZO`|E@@V3FrU&wd;Od`MOVZrqTO`Z0|8Bo$LB_
zXGi#9PK?EKTsHUfq3nFITbP9Hs&}_K9G#k+P>_}<e1_4`r)2iXcuMix>eQB2--=hA
z9Yi+lGHvX0Z1F-t%@(&9+6$Z0%4sD+ZpLn5<<+!&=)9o?U!!Grw<^%RT$pz$W-3;i
ztckozT+NEwe>T}cty(K-6Te2&$KugUwLJ(AHb+yHfRJRF&5|6xgzbOPbWVYJbkQ14
zlO}0wtBq~jNn_i#ji!xl+qRv?X>8lJc_#lk=O)*gZ}#lHX3g`gSBulFhAry2y?>H;
zu}OgdaXOzIxu0m#2-iA}f|j;m`npVhGX7ngIl*)FmdAf>@;b#4rR%}7%N5`mUwipp
zdvCHnyu7aGs(#%amsP#z@jd4W1;M|aPQ0J~OTVj$@|F@VE%msL%ktvn+)zC>&Wh2>
z+Yu$$+ZC8Y@Tft=uri_D6m#iwLXp+XOf_LU6FtZ=h=#hJ-pLs&952J#|1&wPZxQ4Y
z=Ye|O+6@P7VQ#|JMwZUY{<}5iuFUu>d$h7@#Hypck@amiSD^0u`)Eb1O8FpWmTjeT
zXk>15glm@@p;>83`h=Z)+x+wK@sw@LtR?Wlv3<TB48p5u8bw%Z@k;-&HRWlqrPuXu
z8w^zYl{Y-pk^OiU%;R-ZS9?Rl9ZuI3&Mp&D3n1ofTt&JD4}HovnY-!$&%1z<_1FiH
z%NKmwY<4c+)d8MONwFxVY|XuydqKm+`etvm7NPMYu!eB>`lgUxRt%eG;SigWt-waz
zo)0#%*9FWKAB+h@d8u)MD_*Fnl%bANefCa6U6O%MpaAx`#=YMRICxzPhFpe)82OZz
zJZoJ0g0o$_IHiWDk=TO@PSwQo|D<~kF6@Vxnbs~kg}Hz~5J~?;&O|?)Rz{Sr2zgfO
zwS~ej{I|#?D>53XB(H2SUpK>(=cl$^zHJ}i_`bRtas)uP=rOtE?Gto>SVYEi^wV|S
z{orTj=iNIU{B=6Gepl(b=5;gnxu`R*<BMKDNmrHyEyv^Y&2pfots!*sx%;C5+nW4L
z8Wyrn*VBk=f$pR}B~w?*9eR*l@S)NM>1>bXO>{ZZZGvX3s&DdD->M9u9}|(QO(f=F
zRRi`!m8xgNVxpZ&cLuHB?66N@=A)F!I}FpitK>T+;q=n$w;eFWG)*1<f2lBYRJOg4
z7jB`p48NBxhexI;@O<t2=>4hxWGQxe=4i60K3(h|^*vH^%L9f*)BHgMg67UxrlQuP
z5Z|qk&-;PTd;0;;#LFvy?Y;nzvcpwBM%Ji00{7+LLB97ZNPM@=#ub}hvX5)Jk84$*
zJ5@UGBgu{H#3n7LDG{=b4@mfQw9YBOL<b|;p?VKGxLT1KfwAhOC+)j)J_H3%X=!gt
zcJJPdaB?L+xD|T>8|6YiXiOLgc1rfNTtoVqhm2YNh52Pw%R!OL39Ve0#<-D|aA1pq
zP(hM3c1ibHEqed^3q6I>-zr8wKm8xdb-zJuf>bseDd|A`k`Ja6*3b(BM6E|;!Yq(Z
zT}Cd`)Ryx&hNx-}_Tx*=GCN`}E1heDev#bnfpD)zw3N_9+RPvz@gNBptb>p3$py_p
zQj>00vbzcf#{JtZpz}6=d;&DO`_GFmEvw{Asrxiw0I|>;K-S&f06^Q3@4<27rDMZ$
z5YM&!Sh>pMfNSFkV0;TFE<6O?zJ~x~KS1yqU}T_~-taPCSarXR*E#)hKqlts9)>bT
zZAH4qf`t#I$jwD~p6Qd>SZVknqsC;tKu0-@wWu_QW8_?8Cib)~z=Ufq^#Mgk5(tVn
zgXY*Q{C76$E=XlS!WC(9KEoNLBgqLP3=b%RuBWd;o#48^FtdgcWVo`m?Z9VSOK+8t
z7tZP^UW9m-kz6G7`W1%pDzV&{<hcsiwwIe6S6q8!-8G+7wngIecmVfWRoR)*R2#UL
zbRJV-I?vNd3S5qNbE+63SEGRGYHjPeQuVf6r41+vMXeX65T7kX6ZNxtw5Xyn*G16_
z;491Fo%31w7d(|dgDeiCEn*S2&4E?x3K>Uw4-BK!M*7np#MC2qW0{Lo%Q}}%59GJg
zWN{`ctS6Z6fnM_Ozlvo1(J9XwtteOSodTPkzT35(WY24C$OxK#Xoxi>-nrrZlS(zw
zQ{L&m5^p?`M<tOjluW>j%XQ3k%JT-RIs`sd+|HXc`mam};0abxrFx9x)NF{z%0Thn
z*F<Rpp!KJa26()ka|M}Gb)Tx>L)XXKddw$i4#4(-x=#tZPa|EgBR7HH;w+qu*ngno
zvS%X8C3|~tbX9vI9!uM`*Wz)KrFtmUJS)f}i{blajbay;%g3V8;s%2`IWyemJL)EI
zjGVh`HqErssJMpCM@aE#B6b*Tv`>7oP<(=MhcSPrm;DiidbA3zxWh!nZ0))#_-CiE
zs$fq%u2MgAp0w09Z4K{BogRkqCFBgVPy`7(qiRCnkR~@z*xcRx8jLQ-bS4D$YBCqp
zRcK+Rczy%<^<rVd0qA-A%{Wz6`}O<F#m8Sr-fXm-qWki!=aMYsvSyB-`4R3Y_jno#
zeBovtWp*CUA_8Z;b{@z6>pXRZIf47*Ket}xA0-yBrfNu*;aY~z%`6Xih}iAJ*dfr;
z8UiJ4(?Tt|R=CI#83C?|BGiQ9%bgUzHTE>I1*NNHaz?{8pHf?P8Ap?%YX9$Ih-trG
zq?x<X9{pYMec)RD1?#ke3;aZ#Dn51AHWw%0pRmSXQDLLnuF^u4DjuRT^b1^(uoEfB
z+2aF?STP>tXnN@b%Axny13n*X>$6_K+&!jVbe;d)pgNDFZJ+zdc#$%%fxq&??<ZaF
zC%Z3RAAi7JUQx~f!inJziW$4Tng3noGyf9Is-pPfG>7JQ?$ju-GOM~d{<S6f#Ow-w
z_x#{IHZ}3BEA_3oCX9NNl(WRxq_Q->Izt7c((d9LMcv#AJU(e?CRfAb!Q|gyj|q$Z
zkkr)Smi3JHC{~Q4*G`uPB=%}&5_D?~zB>BB+pN~M(xLD~ff58~APb4Q$#h#O;W}pY
zQaXJR{{O;|7i)8awJz8NG_)-S?(Bak8Y;iEUC)wKWJo`5Lh?N_@!c?C=z3k@xvpM)
z8ri!O9;<+8z6_X?vhTaHJ$1Z*L=rkwmw8tncX6-o3&7!EG$2Pd-{7e&P#i;_Qx6$X
zIw+f1b=BaN!1jsgiZD(s;Aja+FNJ3OZG>bR4k7%)mbW0}zRJe@i2deFgyN{;{Q5OL
z7qsi}$BJx?fS8H2{}5GbX5}>7{+l%wII;+_-SZdb68XsAfvI)Jr8cB(+CtT2Zu1@i
z4DFp)_07|J@)H^?U&e=R6;al6xlX634B|0)=5!S08>w|;&CIPBR~3SS_61w7{>>kl
z9GyLMTzCUjZrJBBT4=69_lwnQ-jLvBk$b`xP<<w^Jx??@C<$lG^&GS6#8>Dez%#6q
zzp*7L+wgUDs{eN2wT+nI6WaNX+H)DoNhM=-o>VLaTm04BUSVm=nE4vHKIJgL(3Bh&
z$@s*m|J2Q1a6j8Ejr`{*%ray+ePou}8Xwna74v1n&p(StR{w~*tJBKjGpfX`Mkj~L
zWJs877Ku663<g<9Bp4~RCusQkV%9DF4z~ZfOcGQW7ci5aLfPoHiW)uAx>K)=a=KDZ
z+e1}Tq+U;rhYhvV!OZ~s{<!YjoGzfeW_g}eH2qp|^;X@`|C|tDP}95<$)&<~LPYQ+
zo_Rp$)(z9x)D)xD+|=~&S?i-!x%KZQ>FO-p{lS;rId;2v`#2%iWS4(^&HIpj)c^c6
z?UW}UmeU{PpLw2^44PSC&Qem`N?%!0vT{C`=4ZBNci(qw%|2l>LpiT=^&Ac9nFN*`
z(`2b?qbUqOVcMlA`O9E`^E6p02=xSbfl611OEKZ9sT9Fu*%h9c5rGXmIi{Bj-M2W}
zG+x^)r&eqMd#t+ui7lA%q;ycA>0dBXk2CLW^Mr%3XW1+8_xGV<vrdXykewQrQu&5p
zYk6a6RVLe<lKr(y#9}V=LF(1PR-&fO)1L189t>UkCE)M5t*or0<6i<x8NF-Oc|rSO
z)o}tU;|?e^E`UOK;y>$o2W!G@3r6?RpNxBp;Nyyb?|CYU_e6cdW1(%``I?%XaDx{u
zBApwUyQWqnw34MRutN<^<1=9m%{0H0j>0h4L%kEUj{9}K4;8AcKt5rG^vly#u0a^1
z<1)$Cl+LIXi-jbavt~R_StOzyo5FGIYCR*?eOx7fpbINS^h2cXA?X;jV>OC`#tSB-
z<xQB>KnE|kr_zcKXKzl8=cFYEtTLs%gxaFhi>MYCi0zW6wbQAb)sP|+;m~560e;yS
zjmx3<@p?dytd@E+r9&t$W1apo+CwKh)fMoXCo0@|S7Ezm*9$iVChi|~TCV$Xr|WZH
zm*ov;T)!^;2wn#OPxI82?*-xG65-Pc`|t8ufTDS`TyMvp2`a;FQp{OTpcFlbh#~I#
z9|79|Pd6J(Haf1<3{f<at5xqzDfz)xJ*XVM#WdAc)<3f8`*BMbvm(EG?ix<C?N`JQ
z)wdqQTQOhVM4|R?+i%?^HA4~Ma&AT!duQ~GkoqRo;HujWXCq)SaKpczOybQ`DYbe~
z!DjUJ{IOOJ;UZLu4%OJG&TgzsssOKFSJ#h(yvR78>BNW<u+*_ciy#+TI54U84{qOQ
zsanGM8ufZx#5cyL$|osI+jd%;20Y-vi_q&r*ZW;-rS3!PLWU_dIbgEG9ZLsh$S7HX
z#@U2hfb2qaw6u?Zzg5^H&)SMXHIOSjG{@jL@DPQHkjIpw=8hO?xC^l`63(~DA5tRy
zrNZtoy(}}`68+TrgWp3gLaLBa=ub;Buf=OvCXqKN<PPMRhk<;D%HQ8cGcubM4T(JL
zy(S8wP6>+C)_MIYzdNDvQ&ggnm(?K2@%Pb!oEaj<uD%OcI2Q-WNer)xMm=QLxg!5J
zA_)8-Rlg{@NNiI{#E;qoy6~c%5m}B$GH_d{#<4!wu&w=8$i@kZ@Hnt+GUm`+S0BWf
zwTge@kxWf2aB(T&S_6mMGC@*Nc7xuvy}n1}OlIoVJg_Xb@EDcgcMA9*UWXSh920Ls
zT^Tw0UdIk~hN&Qg1?3=?p4`!O0mV%Pwbc==F8i_#_+-N-4`1W2=TlAm5mMoi$D=r#
zZBYmZK_}aS50Sg|UKEKYS$5}U;K2NkH)H_1>FO2p%k!J?Xq>p>hA^N?GIl6!F^FZF
zENg2}$ui$-%!@0u8;oZh)9Cq&&^?CGc(9Gm*apf@6Q$}53FA=6D=TX1sQMd34v4J3
zd%(*=fIB-?D?2)w6jW=l2zgKD+g)S5N(zEUR|b6*{@%oOYvAv!ZcWQ_y9_$v`$G-m
zwJg7aOICLVqMn0O8!vpt39Y|XGP5;VHNKKI(AL*>g9;B$c1goEar@GMwyBL8uIth(
zOhsvrI31dMwO8sT9AK>xGRxw!zx<%`lqL(X{ds7H*pZ=SV^}gy%|8I&551)ScT3Dl
zzOou2=q#xHt9l~E0SKvCV`FidVN^7DnV|xHX*x|Y4R_R;FtBW3n1l<-oDVRh)4y}5
zx#6#1(HR(z@~&f;)he5IYl$Y&=QOzx=|Y$>on-kpCj}B!g}H*Yy?Zn!4Q%lfN<va}
zEa5u|>YGu7CLa{P)lW6!ZQw@c6xl}@7&tTZ*8D}&E`d70ixmObRG52mi1xzolCpmU
zjSbaiLx+@=4+nnr;JMc28gjZ3SX5zH!x)y#Rw7M+4?5l9#*UXrg)ZH3&BbgM%6wZ6
zkNcjm{?52kVL@Tq=3LW8q~J{HWI6BuCdOoM@IlhuG>q))f$};GN9A^rYX8JFCQS?P
zWLb#As;PUR1VB;XRW)&xNLM1X)e9_*G;mDHF;B?7i7JMQm}6mVu39qmWU;pJ(CLjX
zlF&tiP%iJtZDyJp9$ZTSdB6-z2K~i3sGx))2_3~FPQf4LW(JyQpsB^&q1JPqwUJu}
z1O}Bx#6PXJ4GkUPaOh`d)tO40?kdH3eT@D)V-{WMQN02oFH~ZaZiomKMkCP(Ydd*p
zYBOSK{(gl;p-jH{zC8`nml}@Jwgh?tRiC(i%lbXjNd@B;$-cK=l8y3(Fm-N_=uWd+
zJ2!p7qp&BjE>aicVLFLAM;rB&j7Bv)x#=JfB1$WuLuIOe(jf8C<QG&CBEqox7Pho7
zJGxOAB<FI3o#5826o!`WVSgAnXuQ1tO^oJ+q(2=Ni_s;N3o_r=k<i)?r(p3m)26fY
zwo!qv*9zATZwX}8J9@z-#Y=I4*@Iz;;6Ixl3%Eb8pl+??rw}okJUcY>(xFQE!1tL=
zo!Ln6lqaAg2NIs3%@N-2t*seUGbd7QmTfMQODJhw!DX?#IDOwE2<cbFa~%1b%9S%t
zn8I@VDs$wImbmYQkj;bot`Grx>>Xq{QLCjZ=_wIDH<y7w@IvM5a*aoONhENG2p|mU
z?YSf-^nSP2d)VV*t-rsSDqj~AQcW?J@ZKu@aEb}ZMT~Y;DaM+2ad4Erc5sox|DzCJ
zjFVzw@s%Arw|1dUaJhAv=D{YUUJgHIsm8#?tB8A+WeD*g&%O{&81K|+)&K(%$I&&)
z+Eta5-0yl=l)#z-Od*mNiKvhx7L@!<@Ul1t8+XFj)&x&c;nX2CD5Msn>12=Oja0;R
zN3_EqT3wOLflI^qj!P`F7k@aJL<D*;;B!jXXTKZc!g)9b@iq*;S(ZZRAzi6ej#x7<
zp_i!FBi18vHtF(t^WTPJ8ynAFiHCyb?6|ub*?EKIa2x|95s7HWVfLFB(DMERQ}Nja
z(6MrAo>BGpK>bFqMYb0II|Odb_l&i?pjf-g9ZUUT64Boj=ZcAUzEJawi5v4T1!wcO
z`|Hx2V}vg>MsrD<F`RN|4NyWHO2r=AYH#muS~wMcrBkEAyLygW9P*a8=>yW9va1JF
zI$h{XJe2ByQ~y4Ja54n+G#5Z~L$uOP>S=x>3D7a-3(WX`SjZv#OJwMdQE8wkNgyJv
zRZBB$To5s8)XWIyI3!|*PAIA$I&P(SwwMRLncNXjg$b>BShaf(fd1QS<)u`mG<iLH
zvseM|aztb_4m)TRZ9!_2F;);)VSg$vQcW#h$q(sjz^~gp2@c{vsG&y_eqf?AZewLF
zR-5?pvx82qg2-3rSFjo$9MSv~`p|<1&EDPE>axl1t^W-Yg|~r`9xO$8fZQYRcfvu2
zxc6;Fn1Th!+y&$W=^6$$<z^|GN(tfBAkNKr@H8G4CO$}^vP*=Cy~A}YYgrk)un@$6
z_1N_hpUIEP=~+<*E}NaO=B4sOtKxh|;!$#GlC)G}=o;!C#b!su*OVcet-RIRWA&rN
z3Uj4yJUrz2eBY~4>z^2_4vPQwQ=f8fQAhLrg7FcIhX?MU|L$90c(OJ#A4EakfM3q`
zuOoN2F>hLDkeB@{MUlbl>~PWhKTe)^@*it94Cbcb1?GN=IrMIP{=!9{pf$A^Bt}>6
zzHbM(TJyBlY%S<<Q^;N56ftryc@(?7TrV-W#qH(B>+;=FO-^B9P`-^dI6GNgxs;`~
zHH2KbVoe3y+YD;&C2PW)2;6tm`vG(n5q|mn8?);8sR6`HLrvFYem=ZP`r96GBdIdH
zUFh1|_BJaC#VO%}%4ys_vqM+Wl|m40cr_t2=w1Fjfit!!a1v_6G&Q??fDn|BDxZj$
z@h8)W!Nd@aVn_|+tfgF7Fi^a0%k{R63~M!VrXIvZObBLSoTTo@21WA!7s2&20#+Uu
znz!e)%A8*~H~xqvA<RgmqYQhhB80tcAw~{~;TnXO6#K-(Wbl#Rqx7NtuR8q*cUn|l
zDO%1Lb*<eOtfu)=u$F6*FLVa({*t{PN41QFcuX}ZDdj#k(x(MCp3azuZWkl*3v}*7
zzV9HU=(uzW;dXuO+^)W1<YuEHrjW8}^plarM_l1=My$paDHM!pBD}Md0$NBCaJ%*9
zddt=)$8cl`j5+d60V^JaL)m1Z<?H6A&Wi9>*7Bb_io3np8XJ{BSx`dPxJn=scg)hN
z#A+>*F(nd%K9eZoksGRg8o7OW@wYkD9{YK*WAg0z00;d(GV;XsBSp0Qy;I=<XaR}%
zT#@y#U&G790U{$~<juV#s^V^KcIdWPn_T5>kZ!fp?Gn`N8i2UFn#~+oAjNIg7CmT2
zM@|jWy7}B*l1@OPwm&muX22BlPEQvxBc%ij<*g?{5YZ#1p~V$?9eg@DJHuj3Y=A1`
z%+CN}mtTkH4AZIwW2?gd)bOMtDYfLwVZ5(GM$RC#1sl$)ap`}rohDZn0kbVjS7M^j
zY!xx-w_MCDjDJDcEHU~su-8UWo=LtO8G7wfic?!CNC)!X#ZtR*UK&?Et>t;Z`D<&*
zwuy1iQQw;<<oy%bas*Ju;0K+t9_GkK+4Hh>BwFa(MA=#?V235|vX;pzv0{#<uA)!o
zBE|>`oVkt}LIoI%RM9VVLOC3WJbF5}vn%iG#f+S)aaf-aDypBoF{Uilkfh-yiW#}Q
z)w@aSYuK%iET4;%OSxd0HWN~lMdCyL;ru6Z7P?sTirGNvA<~nmnZT6SkT;N^!H&bA
znt~6@pny6InFA-LgF1g^wC-I+`LDGpkEBrAhaym}EL~cg&5a9X?>-pYt6iP$Z+bPI
z8@qDiPxhP1^RdEf(?t3louHH4Y&w`5Y%)fk1*y=;slR3P&HapNkI}yb72w<SNqHqB
z$}xQr_LMwYhly$(%k4Cg??;4Pm)CDY;A;gnsCI4*3YzH(IVU$+=T5B%@vOzL&+V89
zDdghS{*@^V{7#9RR;tANeYyw!EoWxy3n!dVT!c<x_1<I%v_5Jax%kTNRHp)LYcZU5
zx7VM$h~IS`7F^HxM+7?9)Z*;20DN8^oUfz2KS7S2roZMArX2utqjeVB8v=WI{jXki
zxGixZo5S0N8WS~AAgF16jQUijinvN9M;DdcLA|Sxx+)@GdFE209Il>~%Va0=_9U>9
zV|AzJTp-v7$8yVfm$)rhpjz5sZ%Y5E!71@PIGCA96(eFlPgPOW58S+eUdPPjT>-+Y
z_c1FHT5QSQbL~xL*~T+;+^#^x$FKNr&dp@$b3HpFaZ52Lsr?pti~-Ov?;(@^ehq7!
zi%+`7v-hWZns1q{%hmaEdW_5vAAH|tz-p3eR98uG8a(tD_J!HraUM2Gk;8h6Vgvx$
zxs1SHd4_?+SUd<jpko=2CUC$v=4nf+5<@Uiw+4DayhBZuBnC=EdkOw1ZoELknEfKY
zk8v$K%yKk8E{XG6mR|6!hMW_n_DIkgXpK;Hw|}EEorO!S$oi{<a#k>y_SYphL9!qS
z{EMtyh8^eC=K3=4hj1J4GfOSj;<W75a6@A43Q`)|!OraRfWxf}z81Su?at0DuKqUJ
z|28U_i`bCo`z}WyWt+xof6DD9F%8KRFD6Xd|BNG1<S4&Zxnl74==H8jHo1KIsKnuL
zh9_PAPx4YGg?*xo>0lalv#|y8F&bWB4fT#Oe&;$T+JEsIKCacd$$nLO<AU+ZeC(LD
z#>iF+U<?1UGTIPY45=5NkmbLL7amc@*uW)sY7S%)n8|qD6#W-IQt}0TwumhK7dQF;
zKApSRcqrUr#;EZFZZpD~TuUA{Y*>Ts^YW9$_d-cY2ktObQS`?s&}`VsM>vp%$g?;n
zf8oteG)l$yH%j>3`>aT649O(SfVG{QSlezMB1#JC!P1};awU(+lis{#H_&+PVW~xj
z(L-%USu}l%O0Ff9oSd#b%*@0`PA(Dp6O=Who>+K!+zLB)F@sr3X}Z$9xbu%~TzYG@
zCZ&Ta9RDDDKeP^}!R+~Jd)05xicu|1Ulz?XzMgxrB-}V)a5qq`_^O)aA>?RdLVz-u
zPCd<=8hDI(WU^goYJ_I=3Fzd8;*O?SP}cQY>kLnIWHjV3cgBgi_l-`?L>!f8T!?e<
zD2&^3FrYK1+$p5|Oz|U{C*8R;Kveq$+b{-VNV9}O_9sR-j8gFq(m|6K&Jw16wJ+51
zI-~p1cDZBcpVuZ6YAS=q%<?Ie$S;Epbd}+J@0PGu!|fnEki3&yOkaq~ht^o9B~$O6
z^{cBe(l9$=;J73;+cC$y^#RrS9<3uMgXW)z`2Q?`mp48oLgs<=gk0oJ>9~Kg`j?zc
zwg85@VUA(M=4G8E6BRZ_9v<``!0`i6I5_>U=oB06sZz}RF=c%M68r+NMs(}!VO>_E
z8J>z<l0U+=oF)qVrl_(+4~08K_cBk|36~dalwHC{NZm$|PFFQt6Kwi;8O4<y+ep6k
z_fE&@QI@X4*0JQ;(n;y}Dc(tvltSRZYPFkqCpd(hb@$vt6~QB1RGi(&*5jDt6xQe|
z!s91+ig*}-PBFeZ#h53wM9y9HnWgE-Q#I~eKM;u?9OYw4ojo+7Oe<R*miLM*eTdMk
zoSY0E+<aJ9dAb<B4IV!=%>N4+^<OQOxlKOo{-OHC37g1OFyAorDks{kPA{#fy-gP7
zEogd;U8f7=6fGgEncUTBI>|<<5}&I#JW1;;cy^St(*RnmgQkg|vDG^!ctTMz<KEG~
z>%?{X{g<61lXb6C>(w!2mrqvJqgd3l)uVnW@M`TX{}(YGgPtUy<W?sw&9dXAJQlnc
z#l2OvCIIhm7AHsv89Qm(N_m?)7agmCH#=7hnzJUVLKt~PVcg$Y!fk5XBB~Or^$z9Q
zU_4IMYUwkDuepMxU~7R=3cI=f2t#I!XN__oaKiFYAb<E>*sE6atgIBLz02ttj-WQ@
z^obbhc&oN;u{RP$z1b;7&m}d7lXsB+(6tv%9Qyco#^ysEumI#tJf>XG{TI$hdc<V)
z70_RG#U~9%Hp3_bHH-1Vjz--{bIaZVjdLzCPFeeF&lZaz+v%zO68T2rY$(0O(Z08^
zbWJ%aEuMpNlhUm%CJ<Ob0=i&Q@w6et{!~3jW6|{E{bZMdK~Jm(1ZJ9TMhG>L>K%gt
ztdLvtg_p^tQx)gDI9n(F_zDW1i#7rcatV;P?>NuXn6z&mZXZa<Fp+4$3tMP`R`cOG
zb+RfIIA{Zzb#ABvyqFgE4?jsEC6czG+K4s1U=+4(g=(nOr6cilc5lFbfd5I8P!=J0
zMRrJ8*S=RvQx>^_{CYqwqN#|AFB8~?8DLyady+VS-mq$ZX7Z4Yg<bd@pihjPy+y0N
zL7j=QPH-QA8UTjgh)Z5snHSX_{p*MN7j9U?I2evVa?WM7ASOqS#^w<*<L$f<@WKD)
z$Pi$#u7!Kb$41Z?C&ICXm0P2n96#%Iln!$qep@0Floq9BcP@qVpVa%gS#Hf$q}fqS
zeQcmUb^`RaBYKEY8xvcFwJJdV=uRa<_Rda#LmokLA~pZ~VZ42m{!Fs??Psfo!6aG*
z)g+i!1M^#p<5uoDW-z^Ii^en~)@`&2Zborj?oDLKvM*)bmmw<)nOWYD0OgZQ<*BA#
z0Y`(ZX{$?r7XPL#CUuUQ&CZ<_1l{ThzA2l0%&q2b`VeweO`ZOvfffk@+(^1(@d<iv
z0muphXxe&aq4=flaAwk2Itz2x<HpOi5L2E|t=&R{H#K<^=NfrTFp)krtL#4}^H{QR
z>hdAQvH8L}squXSg~-0#jTHn5zNm%I`j}U|n}X#65{Bd7oaW*RK*Xps{x;4iPpxGo
zFgNbP)uHKkaCC&z4ABx+u<*yk2HPatmDGM*mTq<w{3$M@y_612<4J2}&!znd=ILs_
z$-U(zT>DK7fph!N3EK{lVNd-g?tsymmYQqj-g*LcF7=v9f&-Hdm8;uaA-;R{x8qk4
zT7dP8acJaWSw>l<sM|N6p+|-=VihwmxcPc1Tnw!rffl!D8rFFDEo;XwMH2B=sc(p7
zwRVNjgw-2SHf6#$B~siapD9sB99=uFpMwGyaz{p5JB@NX?wc+#okMt&h*fn<O36YS
z<HA^58V*~j(*_jyI0`TdhY**cn)o31*PRnTC*NIp_pacxl6tK4!tgeQ{Q5LHWfR2#
zMc6WNN4Mp$IC2y>n>r$}csI0$@{`XJZJx)W>%N;=1rngs#`Vyk7MlX+vH+cYH(z*W
zTtxAzT(PPh@sljT#jz$-SFBaj9Y<!(bDs}0`w|=#3W7$^v<{TX(bXL~RLD0iSJvK0
zN$tLn^5|PR0BdI`fEnYutS`V25b5Q8XCfA{3DnE8SrHTG&_!%*-Wwo{b<q^ZtLahM
z!2$)uV$+M6=^&a&1MK7F>3ZeVnO2r~t_V#{QRK!yskx=A+#3-~u*ykOn+mRH3=^*6
zS10Xch{~P$O3%OX^{=;&Y2jhRLryotk0#w%DbjJ9sUbUbiCLGl=0xRlX?QB*{vxX}
z34Us#zg6^fM0F5ugNCu&ZIP41Q}3O&<QfZG<RpIr1TY=G+oP}ddx#5BKQR8Ao=67_
zVrhQZm<6+YxGb23mEx5?XXeW?Duaa%b2HF|O(3KNX9PL054AFRmvW7i#FwixaVgj0
zQc+o$Cz0Hpd^1z4NHZ3XDo*kvSIH3Os}moDi$<e$+#rIDY?M2j_8xvk=PVozbX&nw
z1@q29=eb1ro!0W#H{%%GPkzNkL3rE8eb0$)pEmyA;-Yjund3v_Oey+Ht$7z`%8I2h
zZM^?Xc&7s0OZevqL7?4X+1JfUZG;PM%o2{qkYGnq4CN0y%>`bE&pJ1g0(KTDi8-k(
z*=X5yvrcwEO^t_cSw&qcRCldWc9)$U;@GssQKrwpn36J=T)c==r_L=icL8?jXn4+g
zy;d2)t~k51<C|BL!#>TlG8Kze6BXX6RXCxDFba#M;*EkMVKfvME8h;4V-x0*`Ae3b
z^jSRWQ7F>tMCcl)cY=JYT>wa8fI?M-HJrX6J-hMk8J`68Cl9=%mP45S*q2raIveNB
z{<4VMg7)$U3h|jU3TStAc!~f`J-9uq1q~4+f!`!`;5eNt%&@TieWZeab*!vvlILw6
z^$xtzKFVNgx&<UOB~I&@-g_l#OLh~s#M=Qh#Yiiz|BFUjRIFO--i;t*v8B5S?`#QD
zj?wIlHG^?9ziBQVw@zA!^s0X!guV2M{(3?Yt&bqo0r;o;Bmc!z7gcVSv@#Qs)PwsJ
zVyzQiz#M(HlK!^{kKV@=+se{N2_ut9W$g5(7uTS29?--XdiBAGO|q;?uOgr_T~So!
zz#c&HvtD6!5&!tn@-;>kABtKnxiGfej!-#cYH>aTJQQ8o+Vw`FBbaEjg#oL7_n=ut
z5epnHWL2?O!pb<Y%wa_eOW3yK)(37^Yv1@{1=N#s>vpF*2;uazeEEboxEoE!F0U5#
z6Y8d`1vvC1Ecg;2tEurCrJ4@9wT>L;3(<Asu{bG+=^peqLYTnSf<&cn0z2-?3T(oj
zlc6Dfk-BxH_mFX<4$F>@ZDEiYNRb+tS}Bn7OuIuW?t;RWMZThQgmXO0U^Gzr8nQub
zW&PE626;I$m*z41N3IiFaVJBVXZmsXPe-rFVW#-7sdvlIUoj{MpZCB0AK0G=ihFTE
zn5ejayd0ld&P20xeB0-8`~mPS$v?7X52(X8o|MhP(xdnXeqh?0GG;a0G^mc7o_RHD
zh7>Q)yYER+MdJ<>H3YO^ZJ``R6VeDS`^4*pvfzqfj8v|wHm5gzfDv_bYAaJS%v?x=
z!E4NzErV5jSnp+Jp^gik|Cr4<_KHG$Wv$s9`W%Z9+{*BUuFjXr^=Kk2s&OLX<k>Bf
zf!KEahZv#I--5BTA>p|dBL*q2IX1M+E)b$|TVN4Ju(aO~KP}_j&qqxxL`|3u0*%7C
zIQOF2NcqUwec5>(Bpg@&BLthgH&d_i$7)70Y}@>2x$>XOB@fmls__P~0!MSFeRy;0
zaV^Vn#PuKTo4Q$VMNrOv@mgoqQ|)w!&cxW!o8P{%a9*{WbJq#J(DbsWzpMBSD<IU9
zCA<E)>vR=CGX1Fs%=np)**(-Cj##laeS0={pCMW$eR$<x3l2U#ZQVH0rl@TlauLpN
zZ&XQnOkjKojZ{S4Bx7do(6I5c(4(XEz;39>*5Am8yu<3m#CJn8-AS~m$V({RdI@1m
zG1(AIuw{uTQ;n>Q`70&$f^-h{p7n9l`{LFA@!<33vlRq%CRgcCZYBB(i4nL09NI4Q
zI;mTFaH$DHr~TnuGh`SWij@Rq$G%LOLmYx(QZN%lYVZ6O0eRn}#dTIZJw+$1y&qN(
z-mgkI!%e!5c0#9OhGsc%pCD8<#~H}1lf*(vQ?foj?fAJs-#;I#!z*hjIe^<Z2a>Kq
zwwNYY1RLs%(~SC8Ef!&`!vT!WvB!J>456QC^#Kd`3W=a?nMWtbCVv{6WYc<uT*rQ4
zXR)Hg#uC%w4*JoLOW7^qCEo_is;aJuMHqK}IvR|Tt~V&_^;PsY;f37JsTxH~vcI>L
zffQd6y+DD>K^!(uQ|Z@+KgmsE#&J#3Hil(w40wob6HIDDsxY1Q?Sij}5zReT4dSxu
zfuanRzrdD$YJ`@Vc9R08F+&fMpMA{ez`9CQjl4Y=gEw<a^t7<{3#J*w2(Bq>2xz{f
zVNWrlbt4O9>~}RY9J)_ohpR>(^G9?=)aEu|yI?WUvefqUgMN7y&mkIvCc87@gmY#t
zr|`3F3HvtB<8_$d+pfTYKc9S~b?y{v8sNSpRV%!=&JZedrN7YwpY5XL>(%$4ajAwB
zIwY%vBt%27EtE4aQ$!XR;`h4BMA1wTUCazsK{<;9!Qv99GrO%Z+drjXWksz|kzCF9
zvg+lc^;5K;Quo_F1?cR_G}=GD5*MTsG*i}6Dk+Vntdu(8yN2Y7WM@YdbK_LiTt==q
zCzrUx2`<!;+G%Hza>4=`b|0X#;1w+M^>1iMU~4CAHFJxBf|CiA1vp7H21U{XaEK6;
ztcjVTk6WtZ#{e-vh?{g7Hd3Z-#z7y4F@aFUaKiiaastENNrF$67zpSIMQ(2A<*iz1
zaD!yad*4~B7_2rt+kO{!2^_3>Vn!>FrL%HhZsz^ht3xHi#cI|gpk-SgC3KjihaRGr
z#biW1QiCwK!L3K%Xv?L@E)a}up}FcOhc_9BXi2-1vr_Ck<!oyqRd{O1K}pQv2K;Ur
zs>1rCA8pl>yGbk8R=>+$pgY2cT@Wp~6yW`^tDhrMQCZ)MO2a`>vrQDu`-(Nmj#<o1
z&Zn)U`x5CZIM1rp+h4)J_vDcXpBc&0@lOkKSD;?tj*$`xo93cp<f;O)HP}&9-WFzp
zifXs?Js81z)UEU_4Ri6DIggTh1Cq;4_Q#+VEv80I22WbCoB?DRjIA@7rqH<1sU5^S
zIh!ASys(j^39Z$=9o^`dap^l>yz3y0X!o%`#ubaRL|so6s9AZ(u#(iA-g02}`|50J
zg@xvkKKrv&n{4=h;U;qnEwJtS$m$GrzFOi1;SdL0iCo<b_23bk>!Em~eHty9abjBp
zBWID&s3^1+46!M~{!xgFciSJf7cYj?6qSw>dY)qtxWTpGiQB5A#SQB1@dfwQ-B#Q@
z@V^HkW>&wwCf69x$7GPl*zf9=SEG8pq_&g8+QV|&y-FsA_?o!kjKl~?{5@Rr4DsAK
zb^NPAJj%%sdEtDDX(h%WjCnuU&L=acs;jEJ(K32IJ}$LTgqC`AR9RVRb6n;)?kaOv
zTH96@et<z(qh0Z8pKU$0ke_sUEuH}>=_q=W`xmls1kZXHEsADM+Hu5-RJYph9b`30
z-**`7=H!;ZM^T(hKa8;d+lqgwm;Q&RBR{Q9a!uy%et9fgsHo~(3UUp%gm;nC_@Z+P
zW&YqXn_WHqAlP7d)*qBokkhZu+>;$T#25GX36bD)ETvUMWMwcaT=g_ss`D_jR}$Z<
z@Eyo#CI;xHym9Jl9F?nH*K0uK-*%-C+V<1ab2DdraMGn>?Fj96hbT^7>6U@qC+nVD
zw5A`$Q|?B?WyGvk?kg(6W4fY$Flk9j<;m~EYfhA@?`UtOPZ8%fnK=PdLz(pKu%_2;
zE7>b#7_N2aD=%z~0ydI*dP#z{;vuJKpEm@d2@y@Z7Lp-p&vKmJ+Q73yU3#i>R;c5e
zqPCWG#K>3Lv8T#e#B}u-JKva48?tm*DJHyT;)+TiG@|3zzJF+E;V3qmUp7o`9WtRC
zSQ5c~^VNUSZJSh<N9W`5;7?}IhHDS0WG`MbJp1xXvVRFfZl^{<`9QJUgNey<OkP2t
ztK&)uFOK1%8o)a?=j!$qJXO2Hg`sQ*PGgj>b5NQ<?&3<&zZn6=FTXlMTj*QEa$*V8
zSgnHUi1KaB3{;c>yB!_*wf%(ZD2G~^Ob5A}fXt~X>5miSPR|oCs|&Xh)R`DN!&E<!
zSC0rW4e1Tua@;yPi<5q?A3KxC$k?Q=G5;l6Fy!u0H;xw8BjxfYIa<92>++LzXF@;7
z@_A=Y;(j@;`{db7L017JnBCOacyHbFqT_m)YJ&5m+<K+aSiKQQodg4r=;{M@4snAN
z6;PvIK?td@(z%#sTzMzP><!-?ru=>-dh>9BHdK}BNZ-MyH6+%_&!-zI%hsx6Aw*mw
zq8O0WPRcG%?F5|PO}7>32BQa4jLGL=6c9r<Uf+G2XOOTW^(kcb@da+%6O%M0d<Iiv
z#O98$NC3%7L3(=e_fsgZz^|~X@74{Yp>R?E1!RN@3iDpaL`k{-`vV3UiOW&z`Ct>p
z{<MGqph!(Xqyd&`Is+G1o8!T_7=iaKFp;_inBfeBY)t5So;3`vpXG@uJ`4B!6S1K(
z3rnUjS2ibi{4xF2@*i5jH)XkA)FuCb&I|j5=W%zF=aaOZl(`ckcz-E`c$3P}My@xy
zvGKP*!4>=&)vTy3qaEr-NozTBCoSY};gBrjGid*=)BjN`O%ShFsm7wV>gM2y$Z_)!
z&A^c{t<=~tfBn`L0)JOG6{UN_&&mW7Is|a`d3;i`{!!f5!NKvyPe57?rALnt0*?~_
z;pqT#@E<mOKGaP!3LqaYHhkukRXbkRE;@H(CC7OlRt-<@w|eO~2GAp6kdYd3IPs`g
zmc*LigE_ge(p7SD6G$P(+8Q91PH)BqQn``u%L1(-_1w)M^#YHHvJEo?IRiwYQIPP7
zLbVyAYd1^htulxb<gBm>l#<&0vPt_bL#&0}xxAask<yAwN$i|Ez%c~zS19_+3M&X!
z0HWNDiY*F~kyguu(&hl)RIybk3JHPl^)eEVOXq1=l{KTfxtW}>Y0U*kO-@(`V5Yop
z^9VYC3E?(fZ}+lZ+bAbfQz%iw{%3)e<qQ?TZ8(&fbT9h(YpFgmu!emp4chJ!A#$da
z?8ZBe6mwj$Wvv{y&`*@00X;-onOc~b%H!h1<-?Vs1Plr#NBzG4&d6MuwLe-BDyAbl
zE4tEf6LT}0ky<1;ZZ2uu+4NFXIHOx<$_xJhhi(i(aD<w!jUX$f3~HT|)@wILOb5s=
zSqH#AV7b4&KXmz=w;XidWL$jawS=R<<8wEAzua>_V8j9gyaR%{?-vbEme){#@HHBU
zZ9=U|*bh9o@F>Zm1iQNYVFy`u68rCn33KtSZmssbbJI#tP?CAwK3p3QbhAr}5wICM
zlx<%)ou2Xp<nIDEs63jQ$DWXN$irPxsgswyy#wwA8S@WE?GMO;LIz51$&E_w1?~zh
zSb46=N1;pVp)+_XLQj7578{9{AEM%!(0+|?xx-1r#a<L-cRHNRi{kY-oXmN-=+cb>
z5@j|XrvZJb(zW9R7)#H7RzD+b#EqZjeZN$czHLc4$N$=m@T+><o7Y}kcv0ezn&}5^
zE^f&(pZ1Pe5fr+F6o_!CU4Swii=@2oNSjs#G}FZVNP!2TnmGQfc_TNOr%EfKqw2_M
z<t~vn7qEyhF+^AqbIvFpA;}`J9=o6~(y0UIvVFH?ixr#UeyLOVRe@INn4@h^7jp(C
zd6cqLU>^r><G}EB(S&{unFo}kRf?i?2LLJjqz%2FMs(jl#Un5v{|KY=GT>9h0+KI^
zgm+sGGFLiz6im-=XJj#AK6kUlwyV_%9goupTrP!YVCHKf6k~3Q5}sx_`zSB$19td6
z24NZYii-cgfM#>WUt9j=u-=I^6>SwMYsD|^>@yoIOzj0p3a1O<=XZ>_7?H07M&CmB
zdZzy7H;g`LKViOMat4eD@2cf_pboHp@eBL9h2~f|=C+B>k0)^)T${Z}2VFW#Zyq#N
z7y%{Abyg1qG+A7%cK~qkAT5xIfXC&c<$X5?JmW*aHC=y3C45SBcl9YL!KF+dc8Wk^
z@5p34X>sys%#Q<+D6tzDcL(#<HbL78LKtN>Gw*{!Um~3sPMDMPa?YFMs++eZtLV@F
zmhkgLc<IyKD|VTUAHc`lN{}ell94>xcENISt0uvS27$)tZ-2{eFINoaZqPz%uO&+3
zz(!An`cs(8LXz7+)JQlEL^aU)JdN18k7zz_rkG~B&q%XXl$Uz}fj!*ncw7|Xl~b(x
z4ygGQkSR!GE`P5kE56c^_hsQuTY|nSCD7PV%sUsR3QcqeWLo-%#8FK$#29p9(js^?
zp;D+dyBGz8k1SWAUEKd})}s&{$c@ojVp@_e-B{TUUm2BrJD^R-JuwJ{zTsJfiSS#~
zsodY+&F6RV7yYncq_WAhkZMF<e;i;7{id+5s-n{4m<!1UL>D)LFC9h)-$`_97Rdea
zlTuZeC?PRYlrqBZFCoFuP%e6hdQKwcG)nMNA{fGomUQeiwdyX^-z^yNL;)o9bL`u5
zto!`5W;?h;9l8#_WSYvFE+Xck59P)Ys~DTgVvsLI*a4FB_7w+ZS4~z0`Pn?>Zp;<F
zeA?nxw=`{L_U0Pnl8zhXlUaeIq1xAd43Ue0{fe?YpZ=dNAeL0Qk6E_!oh{Y~2?I%L
z1R+EBXDeC1o{uiCfge{?SV_(?oZZPx$Zj(5P`HOvZ`D0yWo1Y*?l1L#y6)+h8?6{T
zE<l2gF9;rDgwoHwJVfL=I;2iaqD7E8?c^@ZHkMZu{X6?Rm7pZTz%p|43s*oeP#Lsn
z#@d<CkUJb12gHopRm&0g1RF^IEoH6`x~L$%KIL={pG<RTdw1EXFFMPMZ2yI}T<)RL
zt0YJV2^O_!Ze5;fx$&43c>!XB+kR?H*R~aiv;KDOy5WA1v7W_Du?<A3A;vh4bC`1D
z6L2`}0(K2j)(v1a06Y6ts4A|ftO|CiUKJCoFd6bZ)Fh~r*#u;UnbZDsMU0ytF>$Hq
zP-+xaZen^+`w1x{T8kNh8&npXlBkFPinad(^dx$157t-1vfmXFNJqL%3om}Cblj}f
zw5Vd3obMi!N_3RQIdmy&9FjsIsRN-Tslo1wlJzH5xs-Smsjn&1uOVHCykdO#XeB21
zeg|~ibp?u!n!74h+B!5h&T%`lin3!jUcl36@x<`I3c~4WdGM$16@)<WYx56eyW{g)
zXYlE2i=#GY8$PfTGBTI!H@gu<IziVJfRLkbV#{b>MjARmEm3`irV3;BkjTlQZ|%;h
zL9)LNu5IC(uf$tP7ul_pk1p{UOAj7R&u}Sr)Bjvr-Y$#135ax2(Y>?^D_R)Fwf(J~
zgJ6m^vQdu0)gkwZ6*cVG&FswaEQFB)F%Fd7+vOo=iTf5m%QV4leSieC%Rsix1wgs{
zgsFesM!L4|d}d1A4Gj+uXSl9ECHXuhC22YQ>*?_gegy(1DudfEyf0n=1<q9KaSe!d
zDonFUO-Y&RvVkKev?36sokjB)+=r=6rLF%)W=h-p`zD_Hhp0>0`l<~H!<NyiJ-40t
zni+wFYR3L1%FOWE<Q0wwYm#eKQo_o9{xJz>I=%?4pZ(T~FF$jIT)902j`rz_R`uOn
zwF}bK0vl)$$5dvpQh|KvwxMF^oZoR^#i@+ccO?+3gSU{kOHCM{IIvT0dCmExsIve+
z76{+#&fs$G1StBa%OE}=m<dA{a4s>l?79K#py20i5};{Cu&qCy0Y64=7_A53S3Cn5
zaJ$1)Rj&=YFAZ02uVg;gWP>_pO2U!&zos}p!d!rzl!~F7)}NFKx;kTWTrAYi8!j(`
zO#~ZU^UmYQKoZWAMDXhm)}j3UfDn1O3~)KNcVVkZ@t0BNC5qMsSe49p;h>qkMdc=N
z0XOxG?>w|q^`TRL?SACChPFGsyK8&a3?jcPd!-DQq=vRmCS6T3w@tdrIA}AmEP2T{
zuC!8P_Fue?U;O9J;;df=c0HwaJpo{R8&E;;z3=d?clq!!tquY<SC!Wum598O@?DY7
zbJ5GgMOIpx=VdqK!|9Tv*0bI1P}uyF?q`p41$sQ`dX$&0A{ojS+cvhTPxQN7Q4iG8
z?KC2iKflt0u`*4rjQjeoX2QVZh$K@}sc|+h13B`SyL_54=PImnFE`SuEoNXjIzCLY
z{q2+stkjTOhb2}`sF$LU&h1!4fLLN#zZO@em+-`+yd>St9g=)ta)BBkgdLxbK67ZJ
znn~2_PDn@?B=F(pet+DF3NlB)01UhJ4o^S=__+JLDhR)BF`yy`-Wl8vw16!T2!`=_
z`%EYdg2(eXE-5<icvzPNycyxUcj6yN`eA>pN+&_XQp0slzcPc}jqQ3K^)ci3#Wgjn
zqfX)XqcSg*!<a@|w<hB&>1bs#Erha@yaoG59)>&Au}~$zn~FI)R!J+Qieg@veJdB=
z{Envjw)$!=>@#fT%sf^e^jpzt>??JMg(aSx_Lfi6Vw%oc(X;*`A*@re71?%sxwy_M
zGIeq_EAUXTsU;ssQ*HJ{R;1z?x0ww^_y00jOQ4?CbcTGgnjg3~fX0?x_M2uM4lBMO
znb%E18;I3oLh6I6bKs6HC$AOw=;bN#=+KOH#uRh+4u|2O`SHpSbu#h)EI@-H!m)!t
zRlV^Y^JIH@3!?C9k9fI@5@-Rr&7bCMwMu0K;lXv)g3?px->y9RYc&o|CK(?hZ86v1
zG!gPJn#v3dImeceLr`K1`Ph)qj(-X^2Dw}05Tx{j6#rlxY11F(23yyjxH&pvv`b|y
zHo+BT;s+|c&l8RkDJDg;b??snAQana;#q(0<ebvd=UZ7+PqGk_ysVgCw7v@aAO);&
z4Xd{e48&H0MfzfLavd!ZzJjtAxUM()h_!Yq)3{5DL07f^PDF2zjzewRcS6RxyU;yi
z;Tm$&ix{%EJUzVMMNo8KIG`sJng~$5<kT`H*Gx&aH6yBt9NRj6tA%h|v9Hggxxcln
zfynx3AGXa5fNk){EH*-|>&lO*3k!R^40pRVCd)P~SzszLwv%l3khde*a1Kd@Ok0vm
zmGYZJf?lX9dMDr8eQkJXK5y)yZaFp2`$IjE1G}{p7AA{N_ETIC<$Xlx!!hH+Z8PG7
zj5|5Fnx+^@zZpqkM(W2G&lYr3To~vx$w6UXEVyqZP?r`SFfJ21w<f)jYqjuL5!6z~
zhyLvNsn%zUv70@~{PB1wcmtDdBEy>bz;3>jN%6JWy7PkaU3`sJtGZ!^SpabqGH?ex
z1^?DyaeX=zLspG)%P%Bzbg%-F5NV53&kqqm6B=RDJ1`{J@~~6P?6JO?Di!30Ad)Y3
zFH}Mk3sjZnF=W)o3a;(<oG|%@5z2_=jg7BZ6u*)=q7^jfFjWQt2fAy*n<cR4j%jyz
z5NP_I-_>5{!*abfdx`dSgza%Wlr@e24YgQG<OR8LPYD?IMU2elS0I06+}At$1<VFq
zjfbZ?TMnlXhyi|!A<>}iB~ScR1z0RJH1jZ0BFgS!rS6%2e@<-e@E}fXROqc+D5vk!
zrfn5b3fSpo;)C<<(R1jWTtvn+PPvqa;;yPoWBbS$jI9fjwzxZjk>G+9(B`py$CnY-
z(t+*FZDuV73<Y$t({x`qel%M5SRhc`JQmmX1c0UHj>mn(+iBT9n$l?>_)OUV4;;)u
zMv}NrWi3Xw?;J^Jc>Zyw3>~(>tdmg2KKEN|6XipCr8uWn?av_nXJPR<@kGp(XLjyC
z$7fC`Tmk2+VQ(I@I?V7j)6z?Dz|;4mgP7d-_9IoI>ZcSt_OS?)20aD+qutbrMIaw?
zr4KVcyP|ADuVLBK_8dMh<y)d$rZtPz)*2ZyH}Ice6*@hB@2B^0*U7r(u0r*czLVuf
zDd9ydbC9yLqS#jwo4sk+{#x@2DNDB!Zy*$9u$DPAG7f#xLn9(SUu7U7%$Y_kI4_;b
z+V;>b3F!~w{I}yrKaw3XWk9K)QiNyJ*>Cs+$Z27>3gtesY6Ybnl|mQTuzXS_9;78Q
zO_zs|uL!{2?r*-D2}0Mw@(_7aW}l{mhAAbK+3}5YR*TkLCxJ@(7<E40{ty|?kJGw2
zEcoXfeUx6^g+TAkn?^r7kq?a#DEFO@uSkrft?tn;Q<UhKxwRbSBS!1&7<u=wPBHdH
z4t0Fx+u5lKvJ-=E>YN67L&e8r@fAokJ3%($*O84dA>T9uC(k&(sCiI<SGKZ^G2iFX
zj`ph{eEIi>CC0V*teT<(#!Kx_N(IqQdZkbkO2Fdgq??&!TS6fiE(>bfPm}yWFqG=_
z-&g#?5HF+|vEPw*XHR@uI8%ce#&Ue8K1$JoVR54kL_}um<vew;8&QyDkCcZq$QAOW
zIBNfgv2%W}E9%yEV`Im*ZQHhO+i23pc4OOaj3zs_**IyOG&aued(Qj){N)eGwXV76
z8gtCCp8I*|sXrcYqM%l=E04W^vcc0BTTJNa1q+}!Z&S`n=O5(NsTqKEY1E~46$Ren
z?<(akiy0$Tsa2KKgFgh$e9<d(Xye!_xT=%H7QcuSq6@+f%DA#HMH^Nl>Lak8QL368
zX8@9};#X@|ofWtz=l@LaDJaT?KxQimj+Bj!6}Ctv^@ZH-+Qi9;qa)PugZhW-|Mn04
zWm^^|^aNp5+G!3+bOv>0IzI;yQ=;1vNOJVbl1#e3lo@3tqiGDNy^1(vzys#MX9@{u
zH3q=rc|uVNpJ3Zvc$k)bLtaHGL*)G0MmLs<TDG}N65WpBq**;odi9d9{ZaA5ah%Ij
zy*s_ahYPIRsJ}2R(wHx~pW3|Jr+f~O&s7`=7ZS=)F6$xIwzCpReH=ZqT}oQ`nlJ&>
z^t1%iiPO^6?%!V6#4NN_3tMvRjCZvSfoF#hrs+OshJ`E%>{5<}437P)>7|p8lGHW_
z<_Dz~&1HF7npt=p#X<Z|MCBd^GRGJ6lz;2Q^#cB4aVu6ga?;Olavp1zM&6}a9}P<;
zAw@rnNmzN0@wqogh*EA+#i#@no|D{nm-%WBKk(}w^SgnIiV>z1qjAF-x#@E``|d1r
zz<Xw#wQ<8QbF60_GD}rUQTznOz5b44(E%z=$LC^u2qNEnUmA*W_4EzGGwpG0{8=`M
zL?ffBhHx*L%B-3Iy)Gtbl-eZV5@sdEg`lWwK&{e<RYLj^1ji7ylx{|jpmZliP+jL~
zK#X<1Nfz=)^fQY$ir1v23Req$GUgBG@F`z!H&2C@ZLN2VN3&l5t`8MhY>B&H`h)U;
z>Z~`1vImYOGex%9P#KaL9Mt;$Z4Z2~pYg@1)<$aJzWJZy@GChgG6z8d$C_cC?sn)t
zQ+fBYaYSNl3`Hu{ki}{@cN41S-%uGvHiAihnp`TycwocbICxG{b|kU9Ey&VZU%>>C
z%@TEY&s7(CIbAwzHhda{7+~Sgjo2?J<FT8~SeU}eldc=IJ&(2+@J1P$f~>l*brYja
z0DO9yNF^&+YbHwiS5KZCsBsx`^{bqbKhGrfSsM`Vt>a<T<|tn>P5H-I92aw}v>jYn
zc3uzuBH=!^&a_05Z{Vx`l>tT#CLJ07JEW5%S^6!DwJFDuxPh}M&%*R)QSd#vHpUE(
zG>lP<`@p52f*z--^-FDI^HJlM+U4lDdRn(iJ-K|6!JmttWdU01tD%)P!x~YQFOrzc
zQs)=+)<@Pc&$0u}R)}=Cm+YSWT`P#o^AcL4J}MS!GPGUMb%+)#CM2aER+bz&Q{nTO
zsa4!H;lq_YL~>mG^gV?hrRpBdykqc!y1&opw-cbr1Wz#7PNPOm@)4ysbx&-0W_cW%
zjY^hneu^aYdKd;Dv^JsOfAx`m;%Yb!Ds@_BGW$4Pf|U>x4Cz?-kxlxF;<j+y0>>yq
z*SU!$;gxT~Ory1-h(9|(wGTg(H_n8yiMu;c^9?RoiUw=k@TTeA#Ta?BUp@M^aRo9^
zGd>iGWt-cbzLi$xOnoY87LuY-;cwm^<XSLYP||fl7rhkq0y(0!)&1#_7*vfb)o*JP
zsu~D0()pz>03*%*{W#COJizsDSkl7Q#0EzCFo=BX=3BzN%4#Bz%2&!?c^!T3D$Q4)
zyYTE|e$RibyCuwj%J&Y3;ST-AWoj7oW_Cc@cgCZr7gpDwWH8E6<_FnJaN?H%Ux=|(
zsfbPl<aZ+qGb)wr>9^Zjj3Q$*yJa1|-{ZUu_>|&9AkP+y1fHd;K))VHH0%^4cT|@?
z!h|?+aoa*foB)>HcWWRB9UJFVTEd@YB>nrXB`>T6Gf~0|JjF{25Sb>s0*OesV$#T}
z9CUGimi<0Gw49RWYyETAt&DsTdqLD)9eALkD(fyJ1x%B2i))2bC5<%`V3D5W3cNRg
z`=}aq?D?EcsOlGMbS11H-9cB^_!*Eq4DQ)dcW;)_x9GPpeS8qcb<dG|N#B)ku;h-9
zCG{G9RrsNe$(Lx=5at2g3!aAWw$hQY<+}|=tVeC=L5)V|41s2H22&b}S6oqF%t={h
zv+7DL6<0JI%6}sG87rURG_>wG;oefM!jFMRv%r0pc|_=Ue^cXvRYJa*;U(oB@kEXy
z?3@ak-6xGG@YM0#G^;CnVM~B!L@;Z|DvUv<;3Sle@M%2FljCZW0`mG`KK;V+B*C#r
zjh>rq1WL6kTE$)vtMQT#ol&`;eXUTitf)!B^_l}|$7uR=zO?(I&Q_8)`yGM-Q-JZ)
zWOEBq7SzBcu5_47->{tg_R1s32fh?iP%`*ol|iJvszi9^n7M9RI9U|1y+(emd9Q@y
zCEB+%EG$=NrEPU*+u|a2R=Te85s?#BIz+>xOAs_%Yc<)h)v}hnt)@665p%^-l0U*J
zygW65bz3%sy#$;wr}{al)qoPc8MJeDU&swyrIOYHyfjXMwyy>H0Pd9dniN!IO%BWP
zFl;uwyWxPO{o!C&>0?OceY`I*Bj%OSIxyaYCVN$&>xYQxH-G$7x!l%gKt{p{S8;e|
zJDoj)epd^oSJ9=RRVDIv2$s9ZKBhK+E}$x9=`H6?`@I3cR^gW%?bHSbs^pML6<LQC
zfPL_(3ShaEfrP;%G!#)IcfFE}W<oh;N<dH#ZOL@JS!qDowcik~v(?NfUPc>{A+&NN
zi~8czZ7c04h&Z=P3H+NU#y4Wk{vt}*^N1AQc1Hjejy!-3>2*;=*y?frs|=4?^8jEb
zL<r-2wPXO15?8B_CjFylb$=@1dw$$@7sn(_7i#I(#Qq|!;wHRbHcCaa_D8QyOQiuK
z2PpEmO6&b{G8LDI!Zm@vBNNE{rZSu0E=1JgTA`FU@$C3@{ZC9eT!<vSs*3<vKiuri
z7zJj|GB8{4eVdefAq5AK4`pN**KniNX`nrOLx_?$TVL3Nt@!}v!FA~K8-nj<A3C}!
zJp~~FY8D}voZ{tSrnn_FvYBI7$1Hvn%(*IBk#9wUroS4+zFA5A7%g}PYJ61p#`tzw
zk_3wIzi7I6#r1md^gYYpcEc7Prf81C(?o}1Nh!h!oAp+d;2FYL<ae3o{^bdr$q$85
zk8KEmy)6~XPX_;S*oY1B$K;D65<9cMXsVA-?>;I?+Ac$)>QEfhQNLHBhK3il*oECl
zw5SL8kVV|>eZ(Az(@13GDCn6lFGe)vFoOC%BK+L~c5U!?StEH(A;P-Zkh-f)f@BTv
z_myTz8K+uU&iU?@<V?c+dsUc;#;gdWQE!{1ihNv6*e<>YGLC<JIhBUc9vhX9UipLI
z<*XG{fgR0dU!UiXmFU5xzc6GXjyWA~SuP2Lld57!ak*)*yJXS#G(W?>XW)&m-mTxd
z=`O=);Q~9ADx#r*ucA%N0~<oZ=g9lmsxTbHEt?JL`!M&piQ`MJiGylkm~hDloj2zx
zZrb%-^09ERRNwV5g$wXi;bYav&#9sGd96B3zSUNYRz>bZ3-&s|g)@4-@oi%_*6cU(
z@a;Ua#Kl>zVOw#(YJ^p&o}Ltbv2N~j&P<nDBE#VKXsQX4SqW%7&s$=K_q1N+r}G5v
z-vo{^uM2^02J{60lz<XG#~^JJW-dTE^yghYW~#u$k0Rfbb73y@02F*#WnF%FJxhGm
zm8S^}7u`YD>glH!hMKgyoS=uDjeM_ii~huC=y^uB6D#+3W=u|Qh6!=LgY0_^>S{OA
z-=?biNI$r?xy4zD_^1n$qpgr_>;?RyH`46qG_ZO$^Dvtik5`cwVQRe~xoB>y^?UDP
zzlQT_7GM)bSFnr3YG{@!fAL|WSLls<q@K-N3*mm!>Oq+&@9uVBc*<*70$uuszL%CZ
z-zJyRFb|<pH^16!B<hZ0=|n_-6N3u*BfxYZlNXt}&ms>*ycaNEcNa89QdB4-9nol&
z&y3^rGg43L7s8E=G0R7M<SnJ4bD=we)7-&GGE4WUXMS0VJ+RdFBO~h?4OJ_JTY&Dv
zV&uc>B*r}#McT~6^HB#^&u8I>OVYFruJJ13cHYplRf(`uho@-uZ<~n3USq*b@l`XI
zHZ0rG7P);!eb_fC)ag-Ps;-U0c%oY@99KO}T0*++L^@-~XuxdreH53Tggc8bLjqsH
z#V<mKqedD|w-K~eOcLYT$(jZz6VG9i`dV`os??N@o<bi?+f(ttU?>(Q&Tk^?E8D0O
z;6dVk@1TS=qiqr!4lzrwInTmBPuXqH=qS}cXG_OeQ<*unf*6bbsB023N1lr7c5s>{
zO-Ps^B9)(GSMG_oCC{sX5y;XPMRhR#*>^wY5xMiCo)vYu9yArp;@7aw-)fRghKGP5
zw`A>_(%XAI8_BzC{=IgLihr5ggunUAX;fsfEa^7YH&q$}kb;X@+Ko;>dUwik?Xpqv
zRkm*K9w<i!3{6R(tcFds8bj=3nr#3mc7^LggR8Tbj*Zc#J+CfME>ABg_(Eb(MqWj=
zkSxKAhNLbYE~}`L4btCjlckX1gN6kmuB!4r+y``Qtyu`Um7ZFfU7?Pg@v*`AY}uWC
zFdfurv!v|Y&0QaG2*KldvFEUbPfWLv&YN}nWe|UI%l_)=Yn`RROtHiCxD-D!Tq-8H
zXjK0>>6)EWxeP5#Xsc8e{Lt|53}cioA&Ns@aeOl!!2HYjN&<g|(c&s&1H%<+M!icR
z!U&O$vC0V}9($Ij&=?F=4^Zgmz2HxvZ7O<`d|2m|Z}gxh2`q-`=&y0fH1f5L1XGpG
zh2)p4ogr&!$QcRdgSr(4G)~W~lQf7zS3^-HojB4Kc`C{;5KE3I-I3l#E&2tEkbJqE
z>t$R)!b1cXE{jLudJgG_55u4~#)D`y3M2W8Hj%~|P`SljOk6duit!kVtuValI1reX
zQpHld;(1qwo7j#To`qL$RH7?^_0l4lKs`L?(gff8Gv)jhGr{u0DILxc<iY*`#vZ)P
z1})-Nc%HW_nb8i&{raqMFDIH^o+|3WWwBYg`aKS^IeEc&b-Z-C-{x@#6CYP?zou!(
z#>BdTaBLE6Z}(f7FbCV0Cx{=QtYGbU-WtW?O2TMXSuEc&=rLa_dhfp1>O>F8etg#G
zfT+}#WYJX_b8p5OJ|XcayEcWn#wv7y%NP<TD@=t%wv%dBObKg4Vb4g9H`O#SCNTCA
zFWO>|Mq<uLQ?PB+q;vej3?YZHWH^|b{4ZWv&fgWW@;BPUMzJk8YG`_CW!?XbURG=-
z3X~|Yuvtj*0a5uR7|4*hUvfUFF*-y&&1+s-pe&+HagEl3i=wlLQ|Xo0vnK2aL|*mQ
z5XI6AE3DLLx*?6t%9;E$t{7(WM2J#c(kz5R-q22n8%S>F6`NoS8@-^Z3(WEU0Btvd
zQClMKmG*lIW^K6W_ko*|J<H=sR=l9-#<G?^4Yp^NQii*@c8qL}>wR*wkxPTXqCXv3
zSy7VNrwo#<{7jRMP8Eqb(NJtO$?;|g4Sqe|p+=-VFviHC?31~NjK}oyk|3Lqc%fex
z7T%&10Mo95!G#}q^(rx7Ezi0(ePdx05XHYnZ8?$hQxi>(qAWeYfrGUgLC@OM62@A3
z*1gfKc;09kMQLQi0kgc?&CQY<wz|6`r&JI`?0+^bPa)35NQpF!z)s{$V6&9g5h%<4
zj5#*-uQuWFBwy?!OUSCAA?3o$f^mUc_la1T4Q#Hd3syBZ39-5T<+&g<Nuu6jGbjiy
zaGtTzl!9oBSM^hOrh|=5vA%<;Z7h(d54F8kGdXEuyu5FqH3o*tkYiIi$WnlQ92U!X
z4C|4Y`!cPcE&5vRYRso`8Wxgq%weY;GzIVC-`w;|Fbs;+Nncf~=kH8ihdU14y6Ox4
zW>j4D9aiCTt-1A<VluvWEZLhpV6ed~iHubSwsF-3a^3EDF$<QkHf$b3CQ>Zz-cS}&
zFXK3tzG_BtF69IlC-3``NxcQH85@2hU>AQSYvNJI?}XAX#8AN}<Pu!hxD1lyX-X16
z9wikjf3K0dC5@{AyXdgH$GQz@%X0y*@H4=b_+2>?b$uqb?Q8rjzif(&RAXryu}J)R
z@}VrdiU#_gM%7J%`Q?CpUo;MUU_p%UE|}^3FxiAm{TQ-#<NMxb<iT~%53$u2%F|TF
zO<TTaF;X~OSO!&qH3uvvtLZNqvac+Vn1o&U(CJkD@qRd9tNjA!W&QI8;HOCa8l)B<
zd)geZ`f)SZ_!<zu`-QZ)i;?4zZ8P43NtcFQJ1W66<djm;F&fBo&zn7pBeqT>2GJPL
z3Fc`xk|$DbMJxyEpon1JO?!>qsUzFl6277Z1f0S@1c${Q_lGiq$RkG}q^%7`BCkaH
z1!pBV<5+sOJSUr|AG)rjKc!zd_Q#p5GC*Fxtg>0XU00u87H{lhwmpn=Po?iq#+)!f
zJySB0(^F`vGUr~@fnXq5H9zl#+EkA0t;0Gjr}F_O36@#xB*h!)odxQ!bpLOaM{#)^
z&+i@=XKM$-*utO+DQbz5f@r1Pyy*?U<x>5OxN57ZxCWDXXwON0$*E?-celj?#B>8Y
z5<I22u>{PyzY*lYgw^?GjT|2b@5-vBAl)!<E<d+(`tx6a-zuBJSlBc+-YR5Dp?fL3
z4(jBDBQJLXiLNAg-F-><c&;4RPD#~~fE&C)d{nCC%Q*V!lsE>uka8sgeeC%V-yKO$
z<+;;<10LCI3&+u21+Fc(P78CIl?TlZp`~(-Ok9a375Vb-F?q-ggYY0Z_p#M12^Y_3
zMFvq=t<%tQ=%TR}8rv)X_}f|K#zW@dq)x1$$dw!cdk480q@94ELwR~b7Y!I(k2<6q
z7un6oMf4|#$iRx1r&DMYZBK#LjonZ$5`gJz!DocBOiG1AYvyzU+U+;LBw?ko*-x`x
zcK78zgCP;}f74raeEOGeqXcL(Bpe+v0*H7JcRXfTDJEFg&aWUIh?N`PF~dvUnPfW}
zUNB2mY%Xrh_v`3KP1J2_0x1A|H4MRSa+E5BcHp5}<t_<Vl>y3(6kN;<AJC|Cs6;N<
zk~3l|MyTvOt8pF534=2?k+Pd40SuRlH1*rdp3^?Tjok3<!QKvL6!@x5PNz!26$gXB
zc^x~E@s-L{p1e{@KZ-z8Dx&4{X!mb4oqXeg@y{+PpCsWF1XIg=!s?FiaHY3d)0;fH
zj<nEv;miQP#i|<FqkFL#4ZVU*=s`KG`+^fYTe3(!RlLyhgF?2^Zu{selEcubdCaE5
z{3X80$n}0TnwL@t<X@DhXnmiR9%gk-f3!v59MtXVNfI~|9HhlZ{UD01m#x^yWxITL
zPIh>P{@`c|5dIv|8;H$^z1we<Z3>XuHZk2_6MtpM_N>HH%oz;U>4hQ-o`t_gQv|EE
zwVXhMyOW+jUR7T01nn#>lif*GEJNMf!9iRA{46ON#7%gO1e69Mo;wg=fgXJihG&=K
z`9MrBoXVz2rLKD-0AF^{nuCK6Llcyi?iA0pHKBXtzAxrvcBJ^@5~CW#r!YD;!#7Ks
z>8e}ow4>1tzMIK{pTznZ-@!Nk+5&8(ta*sIu)pOu5MHYpX!~DU7K-NHfwEcYd5Ri=
zv%M!+SbU>08nYz;$2j3HEj)8ny_7~_1@d}zxiB#Fq}05vbF(Z1L6&2=y_*f(Iz)`W
zBX_=T78o>f%5=2(R3v7gD^YOC5SfDJAov8HDV->G;|SVIa}{P`hLss11r6UPlu8aw
z)f2D?EMZBOoV1tsV!}5k@K{;yOm{IfdEsg*Y9bk+Cc_?<30U^UxEj27vnCuj?J$bL
zococ(e_}2o^i&*vfwgS5$>$sZyVfq`uE4HBg2ye_DYNjl(d-20AirsEa$bfISfcSB
zX`AK3w$4dOTVag^`Z+hqGVDJeOfiNB;w7wL2p8*McY3dj2{*M4l&@ki%kYTu_>KF0
z#(+Mwp6zNxHm4}vesPRcSe!FC1qGk7IW&1V2q?Q#haNgv0(i^|l`CmP^~>jSqAkb@
zRqENUYt<wy3XLapG0qqbj`8gxBqa3*Qi6qe4`E&r@#K53!=e08p(gw1`f`igO!#KH
zsD6}wsFf(wtdT&DlK&DpgOgAg$~s3a6!8ICY2l>pd(m}yQhuX|%=5ch+&GoIeoCF9
zFx7%6_(+8gL1Y~o@9iBUg8j>m0CI&HhlCjthq4tzNCaJBSm1-}*v*R6MSk=xs#BwT
za^$^CH)H5(klhzq%H>~u!2J<z_6*}8(>s)%RdG16;ucgVhS`$&+tE~XxHm9k?q90|
z_@(0~f`VHU6Ll(zVRzeD0Idwhjv$vaStZ^=dx4mY?gKsJ7^QS<i7^~w^IpLhJGzQc
z?CNV6T+NKIOr1u^mxp6*lvH6bs@@fe!xWJwmyb+jNTiUqc^Xlb9=cuC8$W)iYC?;i
z<g~`wA9*JlnGvp$1-gKlh1NnI>Yi)SQBY?xWDZb_rbt#4oARlCk6U$*oG9Gfd2nTW
zLMyK{R{Dhhq^25~#1k3D<UPY6!&@7d*T(g<NP%DdhM-O4hXAFh#Q%ldg~rRwl9;)m
zSMHd<;5cYI*-?mtpUJMcyiozk)wU+-S!6_o7=1EGG{i{CzYYadn{hOT$U8h~&$3J;
z@)V9OCC<~L1y>qlL$lVwv<9!Fp_qSqMJ*`v7pTe4JIwhpFd1+xRi*7LFE;|IF{B_z
zxVAE3{0Khq(3M!S{-3S~^BneO=lQN^Wsjo_$p9GwyftzpJ)=u79)n*}%gYS-HG-T+
z@dD+EcP({%{u^qB(wWS<y8S$cb1_m7dl#m-QycB9v1@9yL#7kIq#=f#V0A`6JAJ>T
zFGh>g{V&+^>tosx8~)Ke4dP0)i>7y6&rOQa2vhVCgx3?lu-xh$u}d83__-dX#2aC<
zHM(smFB~G`zhcMe!L$horsMu7z|o6g3?4;in7s&IoWQZSBK9+fBT6W;DL85(`iR!r
z+g~=^$&#y79G233Txd-fE|Bg4GA62548wr-Nxo&1>nCkhSI0_yMl;(cb)Fu7C(Q5W
zbS$-P$E!UnsgqbQmuvTs3P~B4tS8xe2IA?K{lld~@*{^RF6+Z=L$@Akb$*;&X8MCH
zPPQ}==H`6r)vB5}-a5bjs|83Bq~1IA7H^E|E3}r-5@aWNF}5({DKE7oLBwdQClpWL
zA=1`G3QhO3w{f~(@-M5>u119W(B19jXtdMmh9&$;IB=CB{;7F4@jw=miz=eI?G7PE
zQF&y-Fjcxqy&eK;RltGN)xqyM?ONbiq0&i>7HykBoW&~S49%icR?<*BXzm;aVVb(^
z5>g%(nGZB7nuQNlP0x0Obcl?5GO9HITbo{w1UO;*SdAx&RMI;O7kmY#(w{b1RQMyP
zciKH!+-L)wt)-kxh3hByZ6&=z&b`ah-&^33p;^hX(RaB8N7=BL!$%0!<%qDA4B(G;
zlWVa`1XWD|F~)3Xi5B70w!&pOP5dVD=173Rh?b2g;C;%i8GTjA=`(K<WYqLA%sDS9
zmbHXMdN<z<5qc{bXow4^Dr<ypGI(5q6|Ppa6V`!k6J*Itv=~a7mzP&tF>W*pD2uLv
z&mffZ#A8KcO%gcij3QcBqTpq?+gz-?i-N-&!zYVZGKmeY%7y=RR%Es#Q&>dTAV$|3
zU@IWXiwmqSwe4R$qnx^@)E$7p)`KuN)$!m+v&p7-@CwH3Com!8WZh-JWTi*R@W$&4
znTifE&+xN2@N{rURut(Lovw!a#rid(p~ROpB5xo+iXrf4WxXv2i>AwSHsU~#$zW+m
zz`pSfe@cTSXeeU|yO2Ve#))#^sXA%Ff*{qS2H#4q3l*X%?2QsAkHd6K*PYZcHFt=M
zYa|q4!E<*r54D6Lr^-^rGmrowdG&Z&Y#ZO9$DTTMoZfk8BfvrcM-M4*aNX~7Ttky#
zrdAJEU;rFuEnzin&>CEIu~Ro|DYRyq=F!g)?0oTB<-xLNh<8-C;uy?{P1juW<7k*R
z{EUciM9kF>O786%!e!5x)iFf^BvYpF_2L$C#Kxxa`!)62J9i=4KFNt@PQ1R~qQ`Up
zryL~flqrs$os3n3GTP9i2PHUkPGVXP#LyE}Q=Njg7Y7>r=R(xBp~i9zIw^QZeScJ=
zB8PILP#<H|lcjH5?kyIc2X8oika%fXrbf6fBuz@6;?GDS5poXwbZ(clI@@pHq{1MB
zy0h+i&BII~tPmU=Wxi9aU~ao17ObV!6(ffH+B)mqO73M3)R#g?v^<TQd}=tZ<bc=<
z5JLzG2=}gKMmRyOFr{x~Hnp%HjCt4UaqM2ys5O(t-qNl*s$ifg<OH=WLMB;xA`uz7
zJab5v13-j*z~EXIXVg8vy@V^j&KGqz)6uSYrP1xwH3nzWF`;d32eZB#gQ;^=eU1Wj
zi|HWIbejn%l!hFZPrsQMM3_b<(TveyYkTI&3oopUWmb|he{ue935uP<$rtMM8gtYQ
z6g!MA1`*<-uDk0LGQ88h_)=Snzsv9ipgd@b+WZv0Kz`P-iaMDeJS~-p3`3n+*9MrS
z1Gg(-)|03F+Ae{Dy=vV*Y$CZq9VAHO2FMD}V3OQ;!=I{mQFjbT$eRUT!J?=)Lw0(}
zP+w_hj)v_LK1Xt6!sp~e+%A@dX8*zQbOVlQtqJBOf`QW`aYaurW~qR!I9dH|v3QiW
z_+8y3i?DS?7DHe%9-3)M)Xi~*7F({DM#4Dw7P@8r$5F$=QALHE2W}wJ^%hzSN$5e=
zZir0~H0j>v#8N}(H|N_=Xgz>(wX<(n>VAX2H!52EGRo$`t5NbY=7`j~j^Fs(iDT_D
z8;qWw{t<+kq-q=aF6&x@6l07NO`Bcb#5^u0K+3-$w_Gc{E06@AxLol6@RR{}P=G<N
zdB>}iI7nE7(~){$+PINn43M~IagLYuSn)upc>Ti6HNYm^%W?pur2l&5cii&DcPI}N
z`*b0bqq#*;++IzSWu46_bT&6JD`Y?q&$(JooMkk3XA)jzbd@eaYz(@4HgSojU9I&a
zaZRn1gsymjlpjY$Z$3NAHN#Vu#Kq0-3#L~`B*UFzx&|jX*Ex(NA`wfo>Coh`y{Aj;
zlKfici_*QND9qrCTKxTTQLT7>b`XmN&Tw}RxevM6Mt3F>NNE56!KTc~Z#}fO<$n8k
z-s%TQIsN}7HGm}9QRE=Qejc}j(aX)Qo|NYm&J9AI^~BY-=?q=a-+N8yRDvY0e}Vw+
zCq71k*z$L8u?5#jGb{MKd*ucDmU$S6GN}~N6HkRf0NS?dU?Qr#n2t};h~OBCeq2oy
z6eyz1li|*uop~njn0*-RA~Lth6iyQ)9kAc6=sttiswKt*iZJdOGVP&AN(~o97Q5hx
zyks!M?e?2SP*_ljWRU;Oe0m$_i3)>(A(EkFH`4T(0s1K^`^P%%_nuB2zDYLzowf&q
zDc-({w9AD#>uAQt&fjR3<`N+CJ1$&XTl?p-46=L|KC5ZI+xd8Zt?xXo`j@t{4T_Ta
zhq=&Zzx>mOf`AyI>p}EfCFz8(r|S7H?;tVk->*mf^?pm$N`srq-)7Rw&wpP7+4Eoj
z?)F;%s3H#x^_}cG8N?+eeUZtS)G(=F{SFJjb>H$>N3`M>#m%|{61vQ7>&z~Q^JE6s
z2+XYYC-ds=vM!9Yn2{rXg|9*R+Jb@yglFTWBM8rH_&L6X_3#sA5u3Qkv%Drix45bt
zk$S5kF<kJT3$zX`y#b#*WK`((lBL?0gYdjw_Uw#ove^<46UVK*eYT(gBlVa!;6u+9
zbF$`4zo9v)A<3ieQC}Sd>D5af;{J#RK*tm8FBb=yt2eqXPlXQ+Ndh`9T7UP6lihT#
z^jsDbzaN7L74O%Jwr_jr`59%o|1`Au@8{Orpe+*wC3&zLLA=#yK0<H&JdPglm=Xg*
zYoK+c%Q5pdsX{s=kg%0yBfp@?z)F;+)KAZ;ViViUOki2}iC3rlV<3yt#?q;$&mT^U
zBNn9(oZl{TjK^fQtQNql7UYM!RSb_8ZOS#+=@>PXd-M|R0k8Zr-Q}0_$0VhF>ms%_
zBRY#5Ab)HECM*n;D$LdQGn08c!`U0lg19kJn9Tf!;upHluwB4Xe2rYaLia){{XEmZ
zdnUT6WM<BHx9HwJbq||4f8~JO5j;8U?+<}#bKcH7>hOL8Id7vTjS%@ejC%<^cFeqk
zJel8TBZLNFh<y)|K(_KN{}Nh2GSpw7eUJ}=y#8&5?YBd2;z!W;XV6SdAJsKZ>)y;{
z{=DK2IXu1}u8iW%&BYK%3deI(EG2+~A86%mCW)!mZV>71Hib;TNw~}Fp})6gzqS#2
zreLiTm(z%e-+5A!w^a^}KD;)e66!cI-4i|TLQiV?GHi&dB>_6KG)*IDnNMrQ(`}#T
zeJQB@@m#yjL$bu)aseYgLPjJnjhddmwU0&Fe3Rs~2d|j+RHv{eUwTs22hv-04T{V2
zKsm_P`GR<H-TTVI?{_nwZ!@1S^`9>sovEOp9gxb~_XxzVx$qo>F#E4fAQSR=+#Rb5
zJsW~5CCF&sb=|g{@O4x9_d9p>!^P8{@ZV^SY5A%-t>Dx>q9D`odkVO(jPi68Y0R({
zxgfSz>Ctz^qTH0ZaN}}^y`TQ<1P^1vooPam;g_E~eZ;JSn-QrQRQ{Ixi35LGU3BRr
zRCb2VdC5E{0{NIc_6bJI0g`8R)`qBBTzEowTZ;GQAA@Fn2P^P`J%!X#n~B>1Y3NkV
zJ)GUihP3iXf4H@^JZ^nikl(>aRQt__4-Mfi+;2D67QEI^5=AkmaO+QB*AW(1aAF)Z
zD<4P_4kTfJlI^d*SwL^R`|mbql!SlK1li5o?Tqrm=s$1zxDoRi0?_aK>lx&~9yR(;
z8Xo8Tb-%Ja50vxKdj~@2PC*9j;L`%bUG)TkWB(`Tn)u@SZL0=jX5avRyv6J{!qI^K
z=y%-RD2DG<u{iLD%0aa|fbeuh;~2~(Sv}_xL74X|h$>=~pYUx&Iyt<`AbZBkV?is)
zN@M~4n5P<)eNBoFFSjm;hDdvs4e)g7`qK_b(H_q19lu~cqL#dk`JCr+!4>T2kgGkq
zn0;ax!c4<%Wtj+!pDT@(nFX3DKg>3hZ#7Vs#g($}4u9|f6!n(gv|~k#I@9^VatJzP
zS=iax|Mb&nX=w?4Tqk^v*T0QBzb`vqUoR-}Uw~3v*1Np_{*#X*FtwYE#1m>82i%i`
zz#>qV(HndI^W;Bq{l42{-1mRi0p{P@m_wmuraz!Cci;A&<ujFLaV4@ThQkyM(OB`3
zzx(u|rYc&hhsb_{%`G|{Jorl5Weo97Mtz}nirerFRCx5TyqGIMzs^g?hhroyWQ1-O
zqtkbaLnks}vzvHpC=N<$WZ|ret45;Rj<6>um~>pizxQ>U%j~|(AHDSj;)F%<R+U@r
zWg8r4Ct8;?i42iw|FB5rd?lr7f4r|8&;uh9sJzk|ap8Fz`Svz~@^uHIJV(tu^cKV<
z{o|zcw{Eb6d=4|Mw>%aUL4AYq+aC5xTQ)W7KiQ%!4eHhMeM4rE_06EF<U}o!U3!E5
z<Ua6Ng33!wf{$0uOVf*77jQ(pK&G!pFMqU5Sp|fmjhLR^4;q7qiF5sAhi6_2t#nTs
zSq$7eSv81v`vf)8B8`?#v*?Y@!d+_ObW^tOLe7$EoGXa?*yC>MoE*;uQpEQMS-X-6
zw5$nye)P-ug-1As34er{t)lGj3!3=Fn$OkpcD`f!&7IFgyn3@`y;0($saB5My(A=j
zd)xo@6!WVc#2C`fd;_t0G-R+JgbSMqc}-iNW-?WCT%y$D*e~CBa#VHaWK<c(?D?pR
zYrZl=Qch(F`jC(!Ogg}+I9o*^lTBJ;oXtqo1?Sbzqa~_awh*;A&14BzvX0!SHY#aL
zXEukEJfB?cXa@L`qzCA5=gy@hX$FNa72W4pcIiV^MKb=5qcVX{faYu+u-7Xh{IPRz
z;0>c%G5e}_%-<9Hh&Jb*CUG6ZE?^<qn$?BYD=lJ7iMH#D%E1uFzt^k^L`b*a@?N@Y
zynZh3w^~bZd40G5l`apTH&CYn0D!Q9zWoH@!0mv?_g&(T-I@1|nd|F+b?#pqciuE%
zbepx}lYahRJPK64vc1L)ttny}6n#W7+b~hpVOc}7%p%YFI-{jdzUwvA#^yjE6wpmg
z|7?g`Y+%`9&wl-rDa7X-E~N8deag7_f!<Zi3zTOeZvuKMKTG8kK1kmw<S^WW(>Sd&
zZYDO(aCuxWVG&y%q>4Tj6N)1#H->UJOVX>=*F{bDeYk5myl*nz5yD-+iXBEhqV3XX
zJx|^kTnzOa!SG2sA{cLM#^6~=QXr25L}$Pz7%INvzEFn>wW7`@Iilr&kSJxr`^6-3
z>F#~uw_Oy;gMVol2NR#5gfxfWt&abixSsugrTbqvkMQTMFbeZrNhIjy-C6zHE1Jjv
zOd~DNRnq1}V)Z0@kAF8Ir|%B61%IW2&mhlvf$p0R4x#_sSz{-pSiT6wPiP*z&v0G}
z&CCQIO#=7Vx5M)2_s^0EM?1Fdz1THmm7o;O$5Bed#TSVQmRPYf3yU@|yx-KdHtu>j
zEmm}GTN;6dD$usb#E5HEz4=MyOeYv0UFy^7+iV5rO&Z(XQ43FtEMe}c(o`NeBmpYN
z7qGfxJl}xc*>jhAM!1CLcii=p83?RS3lS(>Uzj?Ni~b$Bpk%G@WtU*@fyNSEmm9ph
z>(u#QZ$JTJ%v+!=wSVigm9GR^A%U64%gx_s_luB_|Any5S+@fAN&bLnzCfZvZerhG
zWE5CTIoUq(6E!}bE8SM4IHorf4t1o5v&V7WflU+<>Ki&M19bu!662SA@@`GMJiS%r
zy?+da$CSY}Bf%}X+^cfKtq)|mCh;J<_4iGC>?}-$=U{pGC*KBa_AQvpQ+6@UZ{LRb
z{N@wCoaW5@C_KKGe*Ln*e)q$#ir$gHlE7q?ZNHOJPuHL6!Ni}AB9?m7zWD$k^t2O_
zZXEawV&NX!zP+}A!j*p2!2AMn*hX$+l-vKpnBFg(?US0@e!X85&mC7Aztb7(r&-po
z_}|S*i+`3!zJXfRfV`uB|K#T8hWQQ19Qlvoq85H010`2oCd)J7B0_`6*YO|T&cKJy
z>m|5vf&ia~`Ylu<1uRqjxu1hp*tpEqNmI*%%Hvrv>`9wPg?DGGi_UrR;uFqGsK}`6
zVes#%7eLB&LT}&c4A;n?g`5V+R$`O1%!=t5`FBaaf?!w?((#U3aMKzVUVjT2Dtwqk
z!AK10eL_;a?Tb(KS^;u13X@%fFMG>ic>}(g%QR#k(4%va482%`S7{EK-KD%o#C08f
zj`;(YsQ52rE!u~ZXTX+B{o22ybpj%pE~45RuqqW~Gl#AbZ2vMd@SVG_LHrqLm&E)_
zsrq+*3%cy|folD~9tV`Dfh%x#HGo1a;FHMw^<mBWZ};sqch8BUDi%i4e+jW~e;)&#
zkEU}$cf~)T;_~eM?a>=VO8wdiMgVc-OsN@4zK>Kj0-y8ytk5IT7NDIJC)qX-nRSF0
zoh5CG;J_~hhj>^pi1ne)^=A!TY{3|_#48qh+IqtK4zJR0+GAFir<jb#Gz?=#%C<?a
zSh)BQw;jwad85jqYTlc0zjVjQ0jIxn%7GRaumXE-$gx-2Uoh1mmS`Oq=G=cvATyx9
zuZ^;=HUlTgM`dB7DBFWw!mU;hJ>7GYH*sc>Qf=Tcbk#@RsmmZX6oMk;0}5IDdSP$;
zdY$m?E9g`+0ugV2zkR-fxG1$8myhS8e``Vgm9pbsUfazCbN=kjzl8uTmG5?Mz>L7{
zWEi&5QyFNH#ED;KTOB!*CaOUDrSkLrv**fMkm~Jx;*;|~_)EsmSI7(!JjKkNIK)pn
z);cvGDG?7dc*52^SeA7j*qIoA*IdRK!5D=v2^2dfv6od~XY4-<lYFt%#O?~eS2X|V
z>d$@bu4EybE1ms@&&g4Ia0HNAD5ChfkGXVuORz|$WTF4tsS;J{ryTK0h5C!d<-zIE
z?vuj98++DhU^8HsY6zMXSc2y$NOdMHW@3eXqsUs6oqbDDP1J0o#*UHKj-7wffgT3`
z2R7B9UwF|7!1gt%6!~wpQh$YXmc3|;nuOigdSoLTUlA)C#jye|6~8k+qyz^{R$HaB
z$u25$w(JVLKdN?i62{ePi;x!;i|FS9hohBO8Pr&kFpE%Gm~{oBl5}PU^R#xf+0m?}
z1r1eP^ah{Ur}(q<g}~`yZh~>+Ql(wQcyNw@6p)e_G+4mTz)HVBMl@Y)s5)vS4O}j%
z-?!lGjcMAka4g40MT>s$mBKkkWFOJRwLquTpy*!Y?Gcwk`x<-PaLnKUVFK%VJ?olN
zNoUA`JbKE1420q<OWH+tN0{*9hjsX@&Xp!Xz3{OET#_0&IXyO^v=p;Mu^^M{J8}|;
z(*%m!Gt=j6>kocQz`TGS^7l9>HMMt+%<?+cbeYQCxU2<3a$ohm%g4uEN<kiIcLPR^
zj2HS`&v=5O!dk(NM3(@4_k*Y56^%es%)A7g#Aw(lOQM|}GbD>eI!XRhYKu>b%Q`rV
ztbpU8IFG%7;>y%RC|drXA-uoQ-@f~hSxV2WM7z(%3r+a!C|~k4+x{VKl&fmc&iLhd
z8i9chG0MDxFPqw<5%jU3I|*@Xtn3zL4VZWlGcvOXIX>E*us%;DGl@zM2Iw#IIQ0y?
zy<`o`of=23QmQ^#`WdtnIACoy`bNzC(EvvEjsLI4o><JVV#In2O&|M4tO*&KUTi2C
zGFI#fzxWt~YC+_j07J>BCOI)9O*&F^K(fc$3>bt3&ukjk4{pT{ScW*#%g~?Qf-M|{
zRbKyT)_0DW&r)v0!f_Fb(EFYG@O9eeA=cB`7hoqnhu#Q3f7~3o$R&M;s%Cgm?<FJd
z92ALgAI2PJOk6+jA*(UegfmCny5h>OfsKdscG}b~&zWn+Yl;B+cs9}384mX)Q`C-h
zkH03=Oqj`if@(!RWLy|hjfAB(qC49=_dyVn-DaUE(4u)U$(-mBLLDc0N<s(as|pob
z->TDV{0pt3c+i;kc|n*n43`;)IpmfGpfanvNW=3QAROuc6<_IgeI+UCCTFp78vh$}
z6TTn9qBTM~ZB8Goi(G(Ui52my^R@2jsVD;CbyyD1u2*@}NRNihBOh58!av;znFBgc
zdc5jTm2NzAT&AOnzKJbLOhg=7W3pskYSFZE?#2j2<=}P2k-UbHDN5lA@pnfCM>*!8
z45D)1#sMn!Ir^}D2Wht=zgFarP=LwS{i=q;6w8cZ)PjKWy%>qK*_pb$hW|-`sx>W<
zM8EfS=TS$Dpc+agvXy;>e!uv2eqTIqs@~GVj++Z%Lu=CtOjNDRRX~<>Uh1D9S2q*S
zp|%j`Vme8uv{3ZeRB~p%HA7TciB%$tVsWx5BROa*O-53xz1OClhG;w(G#qioLP8s(
z)fP;}o<tG@j0==LF02SrN|qC!L(C#sR9Tu{k$qLwaE{3P+X69;%j4<4okAgcRXUXl
zaR||otEpf=+1n?YmQIf0$vq%^hH<yUc<22I4m;pbs*%F&Ym#a!`ihSj$z$VmGN>&{
z4km~6EII$u*AXJwosoW3-4HaV!s;4Ueqy8`@FrM8CHQdz`#TskS5v;<k~xudCNtl*
z#guQ{lZdP+qw-7j(_JGtXtK)%W-`q8Eh}O!K3RW>CQ53@2<wW|*9J|`4Cw@aBo<=Y
zt8vQRo`p)oq7$#}o-Y~hTbrh=pMBQ`Af-p-glY)j@a2_Ohy%ji=2B>8uH89H<A7F@
z4d{ZIY`@rR3{m4z2s$>#u2TA{GhO0Wo|Rm^S_J<9@@yPlonf?vPulmMKVMI;cEUj+
zTb^PmsztLjdPEpmH)*SRZkz1WJg4Yecx(|4Txu%#NK)iq6`&cScRzf_@g_geqhr~x
zBea6GTppM>W^|V08&Y{izttDvQ$jH7ZiOI2bwLKj8;1GZ$jnIAB$&&Yc)yb{)kSBu
zQi%~@aD3_Z+c4z{3x3@O8(V`RK*_xTy$ur>-1kB(%f5%L?S_l5ryZ38?LH~HkveYW
ziFT|vJ8=2{kcJ$F*{IYVOnUBn1$VNwzBAYLn;{Wh_9sh~^^|nik*g^U%^!X_K^ZJP
z86yVNW@{X-TfQ9qAqN?J2jxB{RS2f>E>7$U9OF`K=QBuM0)+SWi(scvTyh>T51>OR
zN!?9RI>T;e-l=d!FkwB$C}NbA`uFl4*I8}22vMai6FA`NTaa&(3}B`0>iT+!YiNkl
zL>Eyn#a+nsj0`kZ2ie(@n<_vxa;Jey#gKTLrPAR#2ugS+6c*xg>f@Gam&%Cm)*X|_
zlpe4+EEi(LSJ=i-z}qIKWH>EyEA3(UP-zI*YIM_43?%s}$t)P(FNJnyxD2njkR-pa
zaU)dhj_xU-RE!Xonl>BIkQaw~LU1ET1T|AR_F64f^E$7+NFaHm;1y|w^x7^BG2mmO
zQ|9<MB!Y4;L4$8AAv$tBM7Zvx(<n1ZesT*@Dy}z7sqCaEWNlYOvxi3xY(7U)zjQ^x
zZ%bD5L9u5j@q?mN0?Mkv$kqpGh`Q|c*b&(#7NH+@y<NfBWU9&qs~H9<__M{1USFCf
zlYRM^H@}C9@JZi6cGuTjcK>-Coj@kt)jS>wI~nVw(-IETi1-TkehSPH>w#pzN7fU|
z{`Zl7R#x3QVwMK32lP~83`jL)?&|8xCMl&j%TqU~FYg(jZrKKfK}8k*EPM%P<UY|_
z%3{DqnpGq|64S3g$4C*?&LQ!Sq=>Pg`J$_RD@K*8zga@WH=hCL9&EA+zmqDmtw^P?
z(I;mpO_yDz14{YhwvjJK@#q;4(qJyNeaKg(36X28x?{84;pydM6~ax<8cD~0Q{+Hi
zS)_aCg0tj&3vyV7Oc62Zs8!yi-D6aENWY=L37c+}Ls@U~@+756OjFio)s17EjP-E|
zD7v1d*!69ssYJnc;v>p{iEScLKJKOzLtkBw&#U}qIcB4TIXp)X@)>jGtS|gBpYQpj
z+gG@lj%zFBP{YYT3%&c7A7EoP@&4n$*T%HNPpcrZ@}1DnqXUJdz*YKPW77LKr)1B4
zijoa0=sUEW1cXUmf>Mu8Mmg0JsjfQ21Qmi8*a7=<ndVG>xIhfMpE}C9K+gAu?h;6L
zD@{H#ljZAi=e-@ChQ1>B_%fFQ>qEQFHb^;DuJ6EKOuFRBX9Z*=r>FZI#~P+>lK77`
zotjFpXfScFt|}9O0Q*c+=Dr3_LfkFQ@!O4X@AOXd4p}_9yLgXdwWzt2Fme3g5YR&j
z`Di7<2wvivHVn*yn;YcY+|*4z))KhVRD&1FC9OXQ>U6|tswpff-Og`STM+gbC_-lF
z`fE)ZDUq>lbN|}Qml;H^t669FLvX<7AR6_td63-Oor)d}@j3K=TB+d2fQXb<2}Ze)
zY;npKidEXhvAltsR3`sju)bzy%;Y>1+E>B^09jxR=p<>SG5(?|M#m2SIUbocR2?V)
zM-59~Ui0`1hYJ#)x`w_;3jmQ;bhJdETU~l8S!O6yd%6}79DYrbGgu{UC*<$(ny13M
zws>3CZjP?+^38-S^2ypN>~j&e{?HTd@<69x)y~fBV!r}dVU-0VrL$lx_zWl9<rVwe
z)L)fYqPSbpqJTbCQ+f0>87qh<4A{BBO2`xnG2)d@^J8f^JtV@hsg+;yfYBc?Th+1b
z)VtnG52ug)Z!$Hel_X}JQbsqQhdz&<4&49AL!R4vdl)=$r}E_slCZ3Vs0JxGwde0?
z8aDU^jS_YZKKbSGFx3d60fdvVoOBr8Z$y9k>cU<ZyEZF&BZ}ZffKD#wj<(ae3H`43
z#qz>!g|Y;pSWoqN0Vk=vhWKnh;BR2-9Vl$W(RUDYEOk|(zF+s9FJl;05MXIC2B}mp
zp;5T4dsBAE{to>oXXL0hJd7>tlT})x5`^krC2+AC$#H|5Es$<RGbd4QL;C})VVcF>
z6H6Vf9}nK3j|#)*6jp{RDzuHkx~o)8i+uzOr)FuhrSNs2hGCX&R?qleTK?1*;;(dK
zQ?C`^#Tllm&*ayHonp^NIzD(Vqr-`ejaTo$u$SYqjo3>Fku*`G^S+<nnazD6<hloP
zJP;2(`d>$%S-M`)C^+zRv#xDf2wON-n+jq8YjAwz-|4J?YC9~W3PT>JX&4ybJ(w_0
z3ZF1%Lijpaj&6|DV3Whs;#TujTtUIuL_2+blPn2Y968qTyx50{`f7>qVE4F<^%8o?
z^F^q^u_S@%JmZw)Ws!p;G`r2OQ{1kF3ECVgxy{9;P|v<Oq{i35|D2_L?YGIA7JI5^
zg|<>AU}5WEyDdf&S+}#aZ_tAF#brYYL%+)u(q=6ZG+9M$&Gypor;x*LuKO)~#i7G=
z_NihMPQOk;03{tgI#=wM24ksMEWEaib6BldiF8M-HT4^+u${9}xO|dd^kL0I^Ma|q
z4jE06+!@;-N>4@69GBNY7ZH~bfdH~9@tu6#A3x&5%lmCeiu;*lyOe)|3@m?#!mT+d
zDrjX_LZFn4la-l@a#6l_|K$5^T6X(ZWK^Hku2Qa1?A^l2l6^x?eYded=C_HzCPwX`
z7`zqA1Kq0volr7@gvx<u?y<c2vvS6F<>Gy!2R@&^`UpWw6mH?FvZui9=_L)~b;h3z
z#S~%E9iE8z4jpY_RBt>`j5Nu-9hJ}^6~Xb_!x(d|n-x$?lnj^#hRl?Qtfg4-9refV
z9}>TBS*ZE9Wu6Ha28mWhZ}a;=yw5cU$Oc$yUImjMSN#J{eKsk5M^Pug_i++%y1!JJ
zgw|sJ#L8x{L*Xx+@#}IGp;PUXa`v;!!OEIQF(#hwH}nbkUI!e$_i@S!JiJFM+lWXU
z9k5JOI1nQ|DEk0)Z8eks%7YpRni@T`{YwUzAnAte>W;?5wbB}m!0aq%$~3W*bEl9!
zQaqpRrPGkj7+QSZA~%6vu}bwUQd??}C$I|+4|_%Nv(M@(z9BP+Sy)9giw`1SH@Ezy
z<4a4{5|^g4S$w37I&>A6rKEokxsqw6eE@z@gTHLOlN8%ppSCS_j=#_2^rQUN4_CkU
zFNb|(=zh!qsJ6}zcRThM<@8AB-6d%C2X-j-)m4eza+Z<Syf1mFM(5V3sXpdXak?py
zZnH8|JFb?@%KnN{FDCdEUjEQRS1Mz;F`5fnivWwsR+T{)<syBBScg*9MlHPfTL?0U
zd7s*dLxLK;tJ{NBQZ6r>@t?Z)kRrq?l$A^ngCB{Qb<S$Uvdruhkl%!N6@$vKSV~^_
z%sks>j0_a;Z}V)rpMJf)@@-#V1sO+rnCJ2*H8ipmIqp%5lrOpt5Y?KMXFDug%tC++
zK2TYKEK5=zRPzBd)Ft!<0hAM(o+V$JptM>-s*R>rtKKU)OnD1AqN;MLnz*RdfzeB4
zPogGonxb*%bZHS^N+~1L)`r;awBu4l6FLvkyB9K+o{~7%q+ZL6kyl-p9z2l-kB+So
z6M$d8B@fkae|H*PlJ#uU2U&zNLWdHK^C^mqVa5$8W-!MxJ4L^7k)r4<nyK5_R^9GR
zmyD;WyOH{sxq<RdEQpAU{iTv@#G}@Uk&SEDBj8ZLdl8Rpye|7A5b4?By^88i-}TAV
zD``Deeo9=iOa+JYX1g<KOFor8lVw$^lTZmu0=1+;*Xv+U)W~)Tu)pZR;u(J3iK*3w
zYTJE1Czl<Jd1!n@{qX4REE=*k<6#Up8rV)A(2$SxJm-rZP0%XZoUGRk=sKeIiE^>b
zLEZFgHNTe#%RSA;g2lS)lsA7~;?4<$kzJP`Qi?5d{b6r3gUyD&*G*-V|5+6u#g3e5
zHb?L2cGb*rKP!ojj-3Zt;}DAj%2IAc+mcxLK}W)RFHqk!;;9z8!Bpj%uqBv9aRf&I
z@<+=^R1ZoMM6w{V7^3a|@x}QokOPh~11^E#01nYSdW*dI&}I#*3i*?D_gdUC$nf|N
z2A5!q&_rG;o@T_rG~cAaXxLRA_T}Z(l0+P@_Mf`gpR}UGg^!|cAk*s!x~O1m7_zzo
zL$Oy-^A`}w)K-ixr{h){wOd6(TWcHbko*i*xNd~k&N5k_(HEwuOz6d?7oW;MX1l}C
zl20=AcqtSl>{0X=BTnCF$Jj_t3n#|fO-N+x9!8+sUqc5Y5Oa4&!dNjQk=-{Ft?W};
z{Z-u5n!>oKw<;r%|Csf~BGVp(CW9(X;TVV@H?R?={ht~1`uRyrXv;L&V|_m=eai~{
z)3XZ}pQ^~5QJ}u#)*e5zsmVuMPW#KI_Dx6*i>)lUrTXUd9_y0}9`5<g$>w|caZ7jq
z3hmpAXD;(sdUD9%bX=48+?&T1zx*HAwmM0&?vIYIvo51}+kO6|jh)=L+rhPG=jS;m
z4IZ9Zm3~BA_}rHhrB1xMcd9<Iv2JyFlUBRzc<bc(t?GA{b;^~;&s%L<YNGUFqf_uo
z<9ADD%{Y^LXI6)Ql+>*+JvI_1QmIoqO|R`;K2P8R>sg=Ao*J{RX$TcudU9p&golgf
ze)(xyp#ETAgtpHQ`NXEk`2|V^Ph4OB)o+{PenU*>)XnN?b-ALZ?S4LQUSv0&`#S5D
z`A;AH%Dhi&E9F0P@^)ExXE-(A$jqNRU+VMkRsOuEuB7aCE7V!(q2^t*EGHoDL9lo1
z!IC$;N{b6aD+M>aN>^K5EBYdFf|11Ahc_Q<2gyC`Jl0+J^=9e5#}o5i%|wBncCkO}
zUrn>G`TTYDys(t!gF9v{JNWXv&AS<&t^p5yoTz!;rqjRn&h0xtc;|JPE&s2zY|s0r
z*L&oC+@G8LCiGB>ijt295M-E|aR}yh$n>><fLPMg7iUhsYw`f@fdhfbZM_?v{{m0N
za{_@wCxJV$z~W)bJKcnZfWS}4tS!P=FcB>6>C`2trUC+UO5nx=uh#~NY?0D*n=t_h
z3MNeudIi=S)jO5fvE`)cERgVpEVzzI*(QoW@KEL9i<9pfI-uefnZTpW!Irm7?sIA3
z1cKSpxR)+HxUoJe`t)qR%=TX(O=o*SbD5YY(H>-%x2gH@;W_Xq+U)gvzeTJAYP$S*
zO7XSX4SoNjk4Vn$FaSCwQTXw~cDY$|=kEP*i2MEi|Nl0hv-0MDcYptX;PmgWlm2y|
zfQMtg22O#;-VV*q{>hs7>`ijc1J>lHCr=!FBIOGV<{L*MVq!!l-p<?28>6bUzWVNK
zJKza&a&|R8zTM7`{|wYsX$<V`f&y9X7`6o$XT#U7eR{S7>T!w3A1i=U&A>B5{hwtW
z`}=_1J_2gSQ*dzSB-vn0*{}b(YU|cNO#;0)*4j^U1;xdNorcE3!A{5c_FY(g?b@eh
z&hXfUxa66e33uMrD?2hlp)#AVlLHiOW`^7H@BafH^VxoUe&sVsK}+Bnrq^n&-io@{
z<KY4}wX^V?<#U^_SAyO9WIp!&2QCy6nHaw3k!be5tX$oEH%NTmII;sc55XsI_vZjJ
zf5q|N(DVMl-t_I93XW*sZqSKrN=3jG7k@9?{}tx@cX~hYtnO6ce7wKS#}>KBh=>!P
z|FFiIrk;*wfV$2+Z_h_JLCeQI#`iu=+kOXlKRW2Vx0Q^0K=T{V_x!rL{+rJH%yqM#
z&CzWLDX|7c?&Zh8RIul9pEYp(%KE=Qj@#RPK4YxE@5iI>z-27c<Ek|MEdKxb%r9s2
z!uQAOIMb(=vt=Qc2}Sj)O!I`~B6u=~OF^QFb1krR1p6ioxJVF`O`KLw1ScxRg;yZ~
ghMe|?oH398Gsn1kW%i1gUSj|PPgg&ebxsLQ04b6!od5s;

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-taylor-hood/plot_p.png b/demo/documented/stokes-taylor-hood/plot_p.png
new file mode 100644
index 0000000000000000000000000000000000000000..c1265f0f773725dcf22c06a381be970fc6fc6df5
GIT binary patch
literal 45135
zcmeF2Wm6qbu<&trcR9GbyStO%5-h;MA-G#`3GVLh?hXehXmEFTd-&H=_e0#O`(kUi
zcBX23duDoix_=$6sw{(yK!5-S28JvrE2$0!2B8fG1|A0o@%83iD|{LZj0{XpQcTl5
z^Q;S4Yp$ik{nBY#-Sl|j#ZR7s;=bS_+v*)Lo9llJrVeNs$U_)Zz|Pc^j0Ip3J^Keg
z^owBx<w{{op~-f>1?>d!>xxP8<sZXTrBakq?unxeUd^T!3dp&YcwKfa5?wyCU6{u3
zE$P2*bZwM;ugOkv%y6z2%6{&=6c{G62o)tmgM(^7Xj(!3x<dpQbC65Yemw=Ig`(yC
z*JeQ=9t;s6N|tH`hmP=HhvNV1@V`(G!^RDS|BbZ9?$MKKjoJNq0)`^(Vf}N^;WyY9
zZUqMm@i0{~G{pcJA?Mon90DtZyMZ6K%aj-34vYtF7SQj#*C<IS2vA_baL|DqxH2aL
zz8U>~NHE}^Mdv#8J|bS?9)-e+V59pcs*-5QC%jk+iD&7=;;yWl%tYJCyORaJLEwh)
zxCn>{FA`rL(l+u2zNvJRHg`gJcYH*syJmo~VqV34AgoXjb>nZ&|4wqEQ-ZJ%_oh6<
z2<RQmyRysxN0Yfb;0r|OD9V#_m=fco;+o^+i}VTj5Q&LVF>A#h6Z;|7r-=r@f<t(E
z8S{e{9el{RA}zV3WJSjm9o*D!4+_I(LuX*6`#$&>{h{+spN^I_0J{zXOEKNMKwT9I
zf?>qWHAv|p^$IRs$PvOAP<y^ioW-|3LI!ZHv}h#cyI?~aL8_<2%-;zvuS7EgBa+Nh
zn6iD-TCnFMc5>>ZS&cYPkkMA10VfylTM6>}sCl)WRyhN?dXE&i5mHl_0J?9lKf&1O
zs>1R((J@bJvYy)2(-XhTGYnlfua|10Gt5P3mszfPCvL)U;(_R|F!cz{n!$UW@G<>+
zZ6t>q$JkidFo6$h8{Dv|gv6cZt(5?;h-DovVq0CMVJMS8`=ANzqi9GL>Xd`=@m92T
zmsZcLCD{JJK;JK=*r1{Kz50c2OuwcOb>D1Bu%1b=8q}}6pSY1iv7vV~r03>6<-~eN
zVqsd*D#<69d`Y%qo=>2!QIsT9k#JrM^oYTNjU?x_CM3MyUll|j1mi%m8oH<&hH)I!
zs$(}*VfQbQvaqC{(=QvGl}=uT$ak_S%dUpNlp$a{5HH|NSmeKPc}v$<a8J+F%xa<x
zvcHU2uH^}ahVCMl<YnM}>wP@`zQHEBjt&_t@%Wh{K(qs)^y&T-a4Exvk-0|$<M6b$
z$pNjF8O7_6QN-Dy<f;d$7$L?#lfB*Mj?0y}Qf2!Lb>qwGgia)Vrx~^yXK1%<e#)&;
z{Tnr#M@4c&I1D6wgm~8yl;s=)UZsYwN0XU1r^BdG+@#Ce=&vI%3|OPq<~Jz^ey2w(
z=>ph;O}5e3#jEQVFz_FUqqQa=#{ct|b>Xhe!aPP(lRF&=`_ij08Xyz?-(8DQ$FY5n
zU56y8><@l;w;5l7!0Syc(tzC_UNPPyd64$ZL(*B>yqamAX#P<p4WFe1Z77ypz*agz
zh<hO;BA6=FP>g40rHkU8fFD?4Sd{rZ4mLK%0GsU_`81DB>E8{oDtv?_1f9$+hGnLp
zu{pL>QxT1t5`sA-f9z)%5AlX83l-H;zy>S+r~u+_q%$Rc6BT{iq-eyQNhi`T8U7=O
zofRu|k}A;|RPkVrNDG!j9oXcAeCBo$#8CAvv%63w_i7V_ztEx1F4*;PdHfODtoag~
zsgh(KC%>?cG)<lI${OpG08)h}ecz?Y7vm?*Qx8~QQxK40w6Vun+|Rax3BFyN*mfd?
zgsGyerExl^B;r`&O~Xz}HsTJNP&f>ab&wg-VTT|?mUS@)cU~m3hS7E#PoJ(s)S+Sw
z(KXU&6Mq>M^oT#qpROh8@QglynI9&I_v$P*8Jx)vfR7+5a2S^~=yM)H;!rSrZ7(`>
zwdDsUR8u^5m?ln;Kfrpt?`$#vZcsJG9eb3$8oNT$VbWBk)6AR>Gq*3P2N?6qn`zxb
z;`A?26&C#&j37ac0}C4EVbk&~A6+tC-)Bse!10HrGXRRB09fd;)JseMMx!k;s$anI
zTd+0XLpZ@@&;z1377&IZ*+>1Ioqts#R|sK^I>nW7G}#NHh;8{ce?CMuMlzAev8qJ}
z<Iq*@v~hydNJ2Lre_S*z1_^&T-ak*s+&N^{+fFvP%>n?>`=w7cbZ-1<gHb%XMnKHi
z$S8clmy>lGrx6j2x_V~_f-cH|JB+K$3SMr&lIr-7EiZ0!4_LUQK&wRmQWXl8-^hBI
z07UMXU*Gx9ZU9b{)pVwkP2uA5VcaY^=JPB><{PeC2G*tLTr|JDh~+<Sf7#hRv45gu
zY$?<G`IRrcGTy=SOx#79X+wMk02*Dwb-@lC$8p8Ult4w*m-8sZhM?^b06GvJm)cx<
zyy?jV`-pY*7gN**t4S9#63sFt9QqVg^=c2Qs6q-f*^bDx^HymK0)1^6CK@Sau$^FY
zWWN`9mfdat6h0qu)YGj2<%lh9>Q4!)YMc>*#CDPdGWE-j6J%+E3jEWOu)nHXFbHS;
zWYFcb2v$;zYNi3&p1N|_Z1aQXjA7zhe8zvR&Df}&@{{{9rxjcud92KIt-x(Z-n}&N
z&wDfijD^UA#RDYzrtme5SJhHR=`09%Z4VWuS`ucl7M9^K!bWEa)zck<Cw((>ma^1-
zU%1kdJd2tYNFcrhA+gk<-WZ$In{MN)nq}-&1)X`M<r_R1+?cZLTwzY|JJiuwuy%CO
z1#CGH7UFNj5mppr>>#*(@^VXu=F^T1kjpGkf{k~$m^R@zRp~f+GDtLx9|kR!9N@=?
z21W<cii=e?5*@0!{`>WiwspICO&dvlt~M`CFm7LKJfNDaxh>=8psBob2q8n-Dmtc}
zNPcdHSggMEo95k5_97hu<sQ@7^0z?7(Z5QEiJPgdG%5v618Q&%aS9IkU|DGUB9+DJ
zv7Hn3sfZ1H1dQ526<a4(F)<~aOO*|n0OK#iO3OML<y^+kn5pENP#2nfg3)2w=ZXJ&
z4v#;#aGEA(IE-(kn-0-E`yi2gj=^~cC7a?;-t}25KqNicRJYgAq#yO?XrWTA3jY|k
z{b2nnD(jUQaRPuRBj8PW=#b-LYX_TBOJfSojJ!-vOuv1)N?+C^f;$kC8OsJI815&k
z4ok8c1eo<PL<Vs^M>iFKJx{3Q`JZbcg>zZLgD28a7)n-gqZ0G4;{Z)PY?9?DrXzMH
ze)`BN|GWz_8jg&Dk{<=rb0!p_6B$zhhzac`>**Xuf4Kd4tS|#-8{}efb(qvZ+dU>}
z>#3ADw_Zu2l?8#w0chJu6p!0j_Yx9uoD$NvGvXI@S@<FYG%Z-gFzPf!^T+ch6Sn^h
zaL;n$pRAo7hISP?1K3QhFGnKHE#tD2*POU_+&P*MJX3y%p&wM;{b^I0rsCYCL9`@m
z1I_h0{7uwSt8D*vqO{eZ%!~!MNGcv2m?~&Ob=ZRjwK>Rh*V<vX=1Ms0;D3bK5cz{~
z(GD#*CDgxR<j<~b@AbFJzwKy=r71>Ic3_!ne<prv#LIaw=RViZD1zb>6=l*2`&Y2F
z^Bv{q3l;w@#EfA#%kn5=KJSj&i}M;vQn0n;;C$(p^-H%9TIW5Z_A;Dm0PeN2mQgVy
zDF1%Th~?}Q^Vnv(mT4smCejC!eI=ROOj)L78E5#+6>X)<DUX}8tlZ_!MM$$oLo)-L
zX|vcDR;`Foc$|ix7IStT=EHr^R7+-$e*zkH#El@2ty@)F>tJzka7MTBr`@I9c1B3N
zY&N@nR6NEtVn~Em1z)#<P`mG|?7QA>CR*$_eW&;i^*#2JcsAU3#}a6kO13jl@rBtG
z!iM|Q3hb>SO7&47qAxg=PX4InK{l;v3T`Z}23o~!{Y2bNtw>k0uJfj5+Et}?n;4zS
z<}FrazJ}Eq+n@TKhs7-CPF79zpscQL`0;PqiK&AP_2I+cMBXhLpz`qi2TKkzPMDe}
zHJGkv^4dvR3DFTo`XrXRVo0ExnU5kh7+BqAAxHw*dcUYgL+yJgu=)Ic>GzqeXUBKh
zd0VfM^Z9mY^w_?{#LR5yG)7h9`L`m5Sip6J*o{cg{R%VZX)vYxu1JBU%f&#qr!2RB
zJUg%f{qXHk1QIQ+mo^m&e-t1RU>WCSgNwX*yo$b2KBlH7JViyoiyGXAapC@hC{HO@
zt}Q7wF~>!-V<`2Xe6Yng@wtaYqwKhUCqaWhsKn=dk;Oa26br|yM<yg)Z4Dd#F}D?Y
zo}1i_R}T_4Pdb`FXeH@|W^4Cl2100!6F~)puP`Z2%j-nkMJ{C6O4(ru48otykJGp`
z40(><CAj=%#H!DL#Wo30Uq4NuhTnYXQ+HnlqiK_mXo_x&FeNJ(v>iTH^0yjCZ2p||
z_#2>PH=anAKf%)TmhE+6rEvA=_xZ@;F{Y6H*m>x)&tRlRUx!E{<azho@98%#F0Oss
zelkzzHZnE8CnrJIxvl-{@`&)mU5Uthb;kt(%I{NOWI{x?=qUoHjKWKP#PrxU2i7rC
zXL11F@&TEmK>tH^wF@<es&sN&sn*3lks`u4N8|X4|BXvkVy#T#@}`mNasHY?HJOJH
z@(J>obcF$)$9V0zQesu;BsHB9XPmNxj=>LsWP6@0@PLL@9IumwGNacfBMtd=@7qay
zM2M%E-@-0CgW-?ek6rfOyM*tZfdkuD2O0Lh@25t7pYM-;FY`GYSJX8EUn>dcI_zBf
zP$K$+6&ovYmJowE3L2W~SK4m)8iOG&;1jDuQslTq;M6jxZ;ac!Os8cyV5fvN?9Oy0
z@Up6@aZ#>oH`JW*NMVY|=3i-gM&f}RA*9Hg5>ty{G+DI9aJZMDSH3je2l7+k0IG?>
z?1P|JS7lb+Q`hEe7c7bU7LVU8PfhDi#K8)S-}3}mb=yJuK^afa^CXyE$9eNFyDe(b
zFo*AGLlccae;8tESiQm@Hu4e!Rw*a_g-?>2g9DU*R5lhRYq+tk3tewuBv-l&T4uM^
zT(Nbeb2wxC;YSQ`vq>*+yjDDfv2*k3er;XKCk)R^tJQDEl(5h#tx9OBEo8IaTMnvh
zuW6;*Jpsi~nG1Ve&glxUPRB!r`V&ZpbVh>QHareVKd(uR+_yt6y*6JX;7L4>@`St|
z^u4c#CN+iy-1kP~?`?N1zJyKglY870T)Qzixy!#0j$}}5W#wva8j2aNpTS+w=urC?
z^a4|el}UPKo8@1alGB;_O+9bB{LIeDDRy*1QhkqF0cbj_s=!F>j4fr6H;8fGl%lP=
zGduJ$=Onc@s>$i>8t=JyGy1*O5zbZ^QO7}$q~}=4eopstt>rR;p;}v8+x?*-$7f!N
zCk>4-h(adjY`vo;bv^j6;LRun;le-UV996%q<rSpnk>B+<q<MT1Ac*5B8q#0=2ti$
zc)RwL(7#M71W-A)@+5AlhA}mq<0{Ad%L>Jm3S}VP)CLNj(uOSZKLbPU-U+s5N()z+
zM^4}pj$^VHs>@`zafBMbTaxr`GOFSvRzs%>)a8mAnMUAc*V;@P4OJ2Wor#&huq>|*
z{XPyqAM8J2woZ*cU-%9)Ifzg$yI(I(YkEGK*X&+FKZP6YH-*7Kf+8YDpzhjQFi~LF
z@Z`%tbl3VN{TrGj`V?<_7kL{|A)_N%wVkO6rEg`c0#gFAo|#t8kZl?5yT}gsC9k4V
zC~=Y`blat3-hp2AqD27#j_lJ~-#i!GRRK~LBLia17;L&_S$2lj`Y4;&VG@0gI6<{0
z?l22l)ym|{*y6F!b<zpaaDs~Pb4Sl>2bk}}Prrw+CC=}9wv4GF=y;grX82|9jh@G~
zeBYP+d>RN_)4tA{g<-$PXyj40-NoasLK~<vihQ$~5p6!*t`f!dXn8rAX7D=7Y$Bu=
z2U+zbGnBdP;ffj(2bU-xV*uvsR(F%*=j%*7XBkR!C(E+sF$g=&X3?D2b}uM@)9dfu
z2SbRLRH9Y1r1ofQ<2u!zbpm3&_r3<1=*wCe-VCw$Uh7PI;-J$N`R>s8?#$##q!_ra
z7`^{B^4Uf-T0Y~pBlvQl(}Ks*k|%(LEF^RofeZ|bDyMhF#QOSq2(B7I)VpGxYTVqe
z)cnn6vq67<gmXr+F#34WQgpvK(GasgUPmiCP(DEN5X_T5&1ocHXYBX?L2upvxl{|@
z@~PP2UI~A5<J<22lOI(38`bY=Ad$fMYXh}w-G%`(dfUO}DKXar+o8yGG;{8f9Is~8
zQYeRw5Ux$)bIx?5onAN4<yA1YO`o<fVW&QvXZY3NT8@RFFvGqkr@m@tG~j(oBTr?b
zTCZ*Akto$~H(TCmCY2Y-w=bL$b7sSR7}=3CS@Af;y&lYzw45W^`px#3#$$VVUdOAV
zJx0Uwj(#)W6O`tKv-368)|!Az4cYgV2W5vsmmXkIueIgn^Cc>{3flVmP_+jI#~yYP
zq%w8vYQYVG?(J&5owzb0;mzbu(kR0|)8l@PhTo-!n)Et!U-^L>je#*M^xe&@$_IPw
z@8*>0q3?nM)R9T7-SOcdhJWxd7)A!%dt}Ng*DzE$ixn43mpn@I>xTm65q8SJ>QGun
zMG4)hdJ_(-lr}L|@Y~zlf$cbXzhi2I;%XomuD*kqp8ipt=?GYAYI;-f>avOgCR78g
zy;;Qf=toQXzPT~80!vf+x4vi35}$&{fwrK$xXd=pu%DO`SBUjL#9S$lk0%8X<2A_8
zMnYRL%Wx|_`plA&Gz85*oSy-Rq(v><hf?<H7hV}JQx&`LbRG{_NKhf+x@A{q3ioa+
zE9f0auW52+&TiHqR$D{IA?%SD;@1neo;AVy%g>KXFyFHgU!-1*oR@_!_4$1{7gp3A
zuNNKQSikYIkG~=WTv&%PbTdCZ+fRGtUy@x<loIo4SS7Pso(}{~bNMa&0f(eg48kj9
zbH&V2sq8}P)?DVVYA`(}k`qzDE6F(96aynW{D=>p6+?AI8jEOp$;^W)_(vg>Z}-{U
zg=2hJvw07Mb2E-tSouvnt<G+)SASAEp+udDgg7=`=9Pr|fQGjOV5FZ<BN<fQCmJ~r
zS92-d3unwsO!%h9I$-4eY2wa4H_a~RUi%vHE;q7g;XWNVX4SQ|`qBe-mV+s{A#80>
z-wy8pL23VBjRRqTqJ#{<nbORZt(Z2})l4q=EH_0Cw(CON1mN=bjk`9_sY3a_yG%vo
z1a20Zdv@wKU0n}OK$D!5;yrZ}3?p|#`W5k|`$$91`<b3y+rFFcp__C;JfHi^-Em9j
zK9k?0o8RNOR`<={8ecAdU`?0n<wh6j+ZOES+4Kjfht0Z5<YhK?!}GKX*T7{KX!NS<
ze8o5IG1Y9l_I;C;#OA034n8@Js@B;LTgjb|Hov7hF5*b@sDz)$5L0)#kl+D1#wLlp
zmC8VL%qb$_54U0H&Ty;zKWj-Oi-waxC7h&G9mh$ZFqFCs3MOFF-$H3wsrbrc%4)u6
z$C-Uww~W<0Q(d3<Y<}%#m*&n|@9o@<&2B5K99p5j*{P|(b`yyPJRqi(7xfQc-w%$Q
zXAsL<KTGH5`{m~#jj-c>k{0_dvD-h#yQ5i1SQPJ@gdEO`0iV|gpZ|8ObD)vedDBw&
zZPumtg>y~^aH(40qII_qmh@kj*W;n^V_Wm~1H%Z8G5LRMvf|-V;ULn?HC?tOnLQTX
zqH0bWSe;2XfHkGo-HbqCfTy>i-rO`E;j=XHfRUDkJ*~@3;V~TV%84_dtQOiGzi0Pn
z4D7~63vbOXb(Ii1VXM$V1mRxkVsmUGHAWEm=5(u*3k<utxU}59{rI?|Xpem|XWjjP
zBgf;*>VIsLer!8u-)8zfr}#ZD`ModwCm!khk<8~;3pq-F$91I9TlAOjwSMXQ7=ml)
z{&cmyX4hf+rImAgzt{g9oI{b%=Zxi#`=Cmh{~!M|y02pavpheBC)?+Lv^*DmC9YzJ
zlU(Fk79Jw0tH6++KrZf3OZx%tijBd!MBO-nCN9A?%E)YqL*cSnTY)6Lk^~L^Yx#S6
zuPPT^75zg627M8oVG?VlaOpQ}Cb`n(i}qg#72{RBmcrwVig1AHM1$<O<xHufRAVhF
z%35^`NQ-yz!1Z6G-~APkBD%5vwFiCZv@!n3m|q_?RLr~xwXX=L6F$OtO&p3g>tM4|
z!D|<nrEo*se<B?U=4=zq37ow>Juc_&Lu~fhj?#<00tJ2yhMut914HO`n*C|9Z8$Y`
zKx}W8oyHN8PTlkTtI4ee6^_(`6jAM7T&5HudeQ4mF-;m#p+A+NXfRjUJdvosE2fJM
z@;fwZ0F^VimyCX=OijANYLs;7V)|O+uBg(}3+~{hFc3X*Xlb<5+Nm@mCxK3E<rW^P
z+^w${>>>=Hi&42_W=x8hgzusH15c4RAYA3h`|%|O)wn`}LR@^>>(8)-PEs{0h?HpS
z{{2}1NgLZv18*NCpe*VuR=k=N##s>wVTqqZen;<XK$^*644REBrMya<a+vK(hcQP7
zMlamr=i@>^Fqrb*7i%W+h{q?SoJCvTrPm}NMy_Nu)i5m<UWJD!>M01|DtjYhR#Ldz
zHRzEE_v1r*<mfQ!dN0|bV1snxO^#XBl03~1<uekQRfb)$a$n<!ar^9w%?=+lh+yC_
z@G8^ZWyQc$iS&@Sm91{J3-Sb_^xc#RIiBGN9&i+>?fZX)udLG8>afXh+iMqN4Xk8?
z=UZ7}Vit}86s!gm+wR|~7$~Zbo-IaNKClrN(Zz!sB3f?|U3lrT^UF+}8taT*0`)Md
zrJNOWrasMiW5*sAZL*B|pbtXjmf0{&Eha0od{`ZN<nUu^VSpCr`R2<du9Mdi2l$oF
zEAqzb!wKVMP@MVEOf7tCbWTn?sxboW;V8GWSL-be3_1yT`3lPb-LdZY%66^*#9KGM
z?f#VzwCzf=91~<Z+~Riy>o_ES)|L_&7x$LHu^ITP#Gr)FAZ7EBkbsJvWEn<0Of$5Q
zJ<42aONU8|vs~0IIbgIkPdKD`sF?3@;=kikcxS&i`d0sx{EuSvA)EzDhNPG$psijW
z_dL&f<kRpe#ew2KJYehJ+Ga*<e4-oO<}+fnN`^rh-rXy|Cmk6LRolc&K<jcGx8ul}
zpyM792XiWw4OG#A)5>uz`0g8!EB6nVWZ*K?44w)({`M${dHl~Zf+U*NRjL|WP+sYg
z!7j+Cun#+E`43U5W>|c9382BPf8hk;58%PE1`Hi_1uV_wk8%X}4(&{3TJy3iuI+Vp
zo~ovylT6^E2IgtjpV7sPIPpjX=7ERJMq}b!T<#9&d^l)i7o-Ba@fI?A_S>K7taoqW
zw0o2RJihJbE<(`m$TCRm5~S;RvODQ&4aflj_28_b&$7@QR)B*rE=T0*mBfK=AtJ63
zJ>{kXK)sfnv~T>p$Hg@5wiE<iLUu;-aBt)|gA|KU&@WC8C}mX`YsFS>C+p!h)j_l4
zhGETxl2&0WennIbK&N4%Z!-Y-C&JgHiI$|0^!vo`tJ->Be%Us;%o4iL8ToD;9p@XD
zdV8BT7&Dv-J~?ydDQ?n?BQy~>Jf;-{Z2tB;7pK)%1zMf5wkbVu1k^;VdI`#%Rf5o7
z3rMP_vq{R?oe&K`$6Z}_h)ozGrl2TakIf2%-v;0A%B4ib%-9$d&A6MZzhs;oz7q3g
zNdLLiWZmeLH?tk}b>13A*L!3i(5ZeU@QRmr8K)W3HCBmmdUi<d^%FyBH+U)=hoF<j
zw3fjc+?uKgm#HMCAW&{Xz+j#l;v+UND{};3q;6ALsQzXS;HveMZfJ=f4IWsw0*~r+
zrdGwg#TeuA(^F5wvjY~`PkEZvf5RFyDu}~aRaT;FUW}zApsK0KVt-h-(=G~Rg1$zd
zBB5n-mL5e>ONpj+|4!=!Mvd<y&%<PSh0C4>en~BMmRQ$5GX*2(u)6~;!)UcaRuq*;
zp%-JK5x~tjN)`%()fkyD3*z)QDGh)~Z5orOZcoJ5=lC|&G#2yYEvlp%Jtn#n76Xd*
zMiE~&-WXD5d$K!?Gpc%wK}5U}U~(;{n#xX1G?8T({d?~3fLoTH#DU%qH4U|2(=J55
zphP3T=kExMIG%{LGdPxk#sv<4KO#{?u6#&m(WMZvI(kZ%<boBWVyY>qWjV@)_zsSy
zr_O#*0Evj(^RBL(N8Ow61noXi^JhldXa(}3V6fuT<VH|R$x0)*G$uhaAjwJ?5L7i7
zH3^UauYwNJhADqfu_e8%9+DD7CO#b&);1IE9i~k`lOf;aRtbkGclg0Ex%{W}e^>w)
zJSv6X68xdciUkgh>j)>Vn8|paleJ?1=6(<Hu3GMk_q_zdW_&i27tgLp9_F}t6xV3W
z6sP|gu>10kPc6S^oCauUSQE$uEu#^1pNH~Pq#LN)(T0%9<Y|u#e>1@(Go4VY#BOj>
z;}|r(3X6tL;#&LG2^2srNpqj7&$9ph6~m=N6GQKJgo)46;Z#H;P#6fljlkL4Dqs(t
zX%^1XZPp`o+;vcyDhTg*_iR8uzb!VYi~bdf(2Vt87)Ad`QUP+dU;Nyz$AH+?|He0T
z7g?pqZa~#kk)LQN#u~40guvKhGMk{vJ{AJV&fu`G6PLCe%^Ou*0=~3Gpv$oY0$Zva
zas6<tZpzVssr`|kj2jI^Q#6(uTUZ`1<0&$s!kv`IoNSH$LkqIAt4&E(HlOw<*u;!G
z{!IFzK4mg7(08wD)E^Q^f;NA|IMA_)wkAiX%v$DesZaLDo~%CL1<E(V6d34K@M)t4
zBKU4735j+tcPNZh0o{Is9x4<Efmx~!LRu{BL!uSMw4PR09JC(Q6{E8-*Q9otO#0DW
zXJH=k(_e0lA5Im!S210#4x&Sf63+&PpuV00rHd(XtePv{kzC!)cpzY8%n8#0=9}M7
z4jegd&>I((9pd+udKq3mRxbG-T>30s@_EHf@(#Gq$kVh|8w%`7T(ddbJ{-|!mhO3q
zQODm{n1nh%bE4hSc$4ai2nY{%mLlOcr;;p{(>(-}ZmHPO<I{wrktXPS@Sr6ixwO&g
z9Fz*N!t(IPRbzM9*7~q?Z~e;vQGM72fg}y-kiCK?={(Lp4eFKjp%xGo;2<Xj<L^m%
zTEWK3yTpxHM??Ama5{6bae2#SLB#Uejg(*rrk-|K>^kEMbQ}5M#WqChJZ-1?tku;C
zk%;8+CB;lGgHYQP2L0B$(w5%BwXd`y3TY??=@?o_I~IbaP8Tgs$n$m-#aDEHja9Aa
zddoE>%j6v%u!wa`Ii#E5G%=arRB+a`A0`iuglsaI#1tdP1{5*@Si<yqP{M+Y7Znjf
zAUq(K{dswzHeKpIOj2aJ+Ms+uAT!b)?yTNa;7S$H$xKFtNdAi2^i?pwA!ftL$$F}M
z-46TAxzN3QG!R<SR)=F1SW();EV;`f;qYLB7^dDQoyWRPi}owPLs7xIKE7;LO45-n
zPh+3f@hvNJa_)6D7>nOlCgE7MpED5#p|X{FF`@}RS&f^y7$!C~B~7MqWXALe{TTgk
zq;9NstoBlAO4<m>RA5Gx#aiIPAuZg%zciekD~NxYskb5*OiGoSe;Ao4iY73C)Zem(
zqj;>>Z-sag$^-ygFcNnTm^IA2u-L~%!O?gS&$v$bvnl^(xSQDrjoxXf9Y3M!uqc6*
zM<yj>zb6zJvg@$J@^KNcB_R1n$dChliotR}_gH(3Wp7Jsi_7)99uEU;s6`w=v$6?!
zgA%&D6^0&}mc*(`_FEyal+SWf^VGT|%}tMC$g}YGZIrIYBxmhQtg%*63vfOtiIBZi
zGtMMptGFfLu-|grKNvcL@Twi{Lx^IEut$Teld*SAVNJW1)dAp9JC7!swzt!s9%#=G
z-@53sV1!#Ou^(6kPc9Bl;CI2aIJ<aOjmh*Iv?oPK(BR|A&cM?LyF})U^8$y@J@=P7
zZ#*~-!ry|!kp{D%8r)VJO>j6Df-s~+ry-3%^RK9sF2}d1h;Kz)oRdMoMTK8QsVQ8j
zsoIzUjpo90x^!`i)?g;zu@$wg*&Rr(B5~=(8DWFg|8yQqy8IA((}7VM18sUX5atvG
z`zLt%Eb5~?7zWlVZE(dL;)Gb7Yy53WK5AWzjw=d;+6|fPIsT%Wf<_hjwtpU5)i8vz
zV3`(3@7mXpN%%))0IA8<T@g^B214pY5x}`!%S0P?f}|&16@@^J>`*Y@AQzEffKsMP
z5sl$L)#R-VSgb%nDV)+xt5dtXyM2apkpz%c2VXM=24wmjvf@?~ngQVlQ+|2<g#>$E
zS@IzsACtLo=NtB*7p72?wzQeRB##t{SOyt}b6)ZtS^f#Xek^p+a`#$)VB1mygDIk5
zhl<UHS>t}1JTAhN>lcNEWCD{;VmM57pk#OKf-KfbH-XTX?}&SGVA4=oq78J?-(E;@
zDzajYXYUwnryj}$j~$s|-ucP97Z1~0iUssPMXw0h(Z!56oNG530-0J=ok|Jev9efk
z1qV_$ztpI+n$jfVYp7Ii!OVIkJH@lxIpm3uqzNUcoG5T0u(Lb$o5%jmC=o)i*`si*
zOk3D=OzFNBYy}xck1S?U*W^E?FZ2o9zAcsJQ8h$5$f>)Ug&(Xim0%TT;(rMbX0{pw
zz%-9I6Ka3f&1!v?7n0)y07|BVp(&tO_QV&V{KMsf62tErZ+~`xV;e(oG{&b#u?1nD
zrb~0hrj-^)v{@{e0xZ4(3A6^Tjk9GUCvLsiJiQxhf8Uo8tbr|Z!k}wy1>p1M<zZ=!
zM}cIxU|AVV%mdZ7VU!&jUH=G>gtxi#aK-UoD_E(Pk~eFk3^yKDG@}AMGcRIV4MysZ
zV{=&uqDDhB=6NA#G>m1Ge@@UQv*n#!AV_gdA${$1a9Zb^u-;wX%rWd^A8%Py4SUp4
zP)0H}eee~0e0a0AyhY$xDr~S2&{#msF)PK~YIF-tC?Hx8m)g*MYIwLD5Kx3Cv0zF&
zM=|5Bh$jjREEXH`R3!LS)mD9vvNKO%L!-_Wtv1PFRoxpAZcV+@NAwL_3oJgGK#J20
z;>;p}Jm!f7@prhrg*c@hMqAu)14X_Q8txxu9{E|Gxu73BYU`8Xe(lX`s*0OgY`e47
zX3<(rjHm4mIJ=fUN1Z3Vo{3DXc&I!b&|jHLW!2LRSKv-@8HYT^C_8&5|482BExL0)
zoDi-xPxp)^)nc<Kptkuoj8Lc)oO?o5^E>sT@tpBd9a|W(J0}c>^~_BwtZ9^tAW!xE
z%|AOvVx84y+=*CbdjZ&&!tWBsX}>#4=RCoX!mtwn-zA|)G|Bw2Kyc!{1R_aZezIMj
zlQXHB)J~oq7}r`BVhD_*-ErI`<K?so=BCjP%&v^9B3fofEQ#~#AMLj}#*pM36L8HW
zx)O9dyS8il7zKDl3ensPR1V}emxRSC&eWPQO{E5O;b0=p=}ZahmRz4&MJq}i5|v!q
zKR6-41s4j?ttS<xc#2`~)vGv<sj9V4Jr-hF&Ux*5eNFVw)i}!?5&ohqj)XUxvc`hv
zK`@9*>8F7$xQ~)S#~M%`^HP`38N+u}j81eoAjDi0n9~BJUF3y}K?fYQw9vM$w~Kr1
z8PvgY9yBR};qpt#pY<(VeU)Nis&Rl|mzxD2@d17U;;WNdbUMh^cyu)=I=God<J0pd
zC{x5}6TPHcy6?3_Wh)Nk9Eyran4s0*U(hgR<Semy493~OBg~RKnVEZcEBxJ|zJKm-
zPd5+Fb>1!>)pIXq2It@+Ww=u{Sa)v_v#GxkC4(cxR?|iMsAD*})ubto&biw4&|M7K
z(Pl2{xf%}`;ehN?)rb<mx@kY1=9Juh@T$)>y_wz{QhKis(kD8wv5pJ}p*Wz(#l;YJ
zP`ISEpv3HOkqgMrbXrMPrw9pX(PU+i`%!++SS)wWNBW}uuq<*#)~Mwuv;wPK8J-Z8
zK<(vX-Alil!#Dv4e;G43EYCY+gNWri;S+4r<~SaT-w;#TaPwT-Px8$tVKMb(i6vRQ
z74WyUZUtjZ(9M+(@DG5XGcf@OfCf}`YnfN?-6>X<Qc*g}&<l1ShSgjL@nfrCqU)bz
zQU*5wf@2s0>WW2UD!D!_+FRq4xk76hfz;f;?rGoepicwaSI=<1Opb0{e_UH7q+BYi
zwy;ugB&mR<gbW2nlNCsMm8wmOUO$a~p;W22RNPi(#o1u(X_C#kDgb<`*S#<$g)Q5Z
znuNuq^4^rjy>T#d_qvXXfMwUEYgf=fL=6?k@{#0hSs~(XDl2&Y{-1I=3_|*EY;-W>
zZ)wA!e18@1s2lWHAk*rmVJ31110xK`>&|Y)3O`yYwETC?y|#JTwX~4y{x+}uJCgmE
zWfPKW7+=MQSPiTTMDj#r1TjeRN?4`=7kW7s?+#QsU!&Z+Q#onbn?eZc$;cA^<jJuq
z5oDQL#9gZe5!nI{$;>L~!FO~yfLCbusc8Woi-V>I=+2Yg`3L5cyB<E)IwIYYc*hAP
zhp_JBDw=;~mtrk9zGZm_x@AJHew#eceQ_kX*zXJM2WYLqK`kgkR?Gw@%^~3+iSzt%
ziI0=lVO<PkQ}WCUA2gHyr*An{X?G@RxSPjmW|ZN^$_<<7RW@8^x6TK>Y_Prf1=DQG
zA^yikK)~8ND>fScBX9bpTsO(l6oNDQH$qUxsV)Qy9U4$eHaZ-rixbsOO&Vm9I(J3N
zp}LZ0ZVf|kIjI{2BdB{Y3ug+wI>mK2h8}z9;aI7%&<S^7@G_QgkLhjVq1k23%U|8X
zbafQA(fqslo3*#%<wlhyO49Hf5#ePaL7Y9iK(fim*2i~FapOvXTDD79z^JAR%V-x2
z@2^xvA<PRKJUH~sF0jL~o5LkfdYKkN`(KQyYh*8S15JQ(rh(2tC4aQMT>nl51ZjD{
z&J}yrL{7;z$r1u8&yG?@8g@*qk!mK98U#A-kN)1eAEVIAgi=aQwuyjKg4H<Xkn7YY
znCUv|D4@>?*05+(<d;t~;i+>CU@gbHHU6~`V*UIPzu0-jX%m!QQ${e$*U=_i=4PP(
z7qpA%Y1cAmT0D-P9cbF3Nmz#)29G$rdx||?2v>vRgA~(4p2oMZ{#Tn~6(=!NeejYm
z_)QMSC3`bwl&-pnX@Vg4T0##s{J_4zVS89&;tIYGN8ASG6sCm+MeqoLY5E{DLh4n-
zQE+F&ZFcWHBoCGI48B)-&|%LZmch(|dI6*_rlr3$7@;=b&uv(JZz|)_i7XguxYs^h
ze^5kKKIO4w-@VV__sd}frCND*=X2puSb<4Icgc(GpH#^wVn_COD}QUDOs)IW3TP8n
zpv2Bz3Cy$|-02(~!ox;4CE9}7oyJ^h&?FimnXripjl`}7q=gQm)0A2FzWMkuXM}6*
z!Z>`T0YNo9-S8#LyJo2|6FKAwv>t2`9PU9eCLMrQ(wWOCn}-o^R=PTr^exU~*}!kn
z6EkRt&06v#tx<g93c$gT(F}t(v!yG6shSr`60N4ysehV46JXnmSDJ@6G2*VDNAmWL
z`>`X%;`x;tywdnQT=TQwG$xq8F<tg?EK)gX>q;Up@fM%XD!2<{H7*L1i30CaA(~2a
zRsOm61Bj%&SdU6DYv{oU9&b5lncjH!5|9X?wh;JiI-$*K_j8yHbGbT!pLT7#`klS4
zYU6%6@X9pCSK}*=gsdl;h`>!sETonvVwMx|j<TOsrRL5}?3kF`U^fY?=2RJJjA~tf
zp!A(Pz?CimwRe!95`ML2Mz4+pOyUZRbDGnP3$+RPFN$$?vjN;HjF8!C-#yqGOOb6#
zefI0f+9x)c716uO$A+KDt7|EN;KBJCEC190_-$BtTY0XG{x^RZYf(r7knyBzy@s35
zpxCpc%R3YYex|ut0V4LYB0#wo)0?4neYld-0k$vRLDG5PA8|7io1JDuvxA%oAaDFl
zCe9WXV5OEhCT55}U;~EOywG&Oh0sj><sKmx_0GCyk4Me_(L~96R6z1~gh1IOs-h<K
z%crvVp~H$Lm5n747QQQP=c~x1Dhgc<Hl!cGFaySETqO#r5J!Pr?XC!tsAd?3fa#Ds
z&ku=&!#-fiH_*ymh2DzD@t!5zeA~$J1~+g=4-iYgha2#S8~!JFhmotpb{B@dB6a?5
zP(SYzs}tKs(m*1ygcO>EBgp=k-hrkfA#o8<Iv6&NkJwM#G99$D8~S}6F>tqs8bQ3a
z&vtC37Aw?8c4ZpC&=~|lc&WrRYLq^HZiJ7(nA$9>?chpQJc}=52XU$%RQEj3r_q`?
zLqI>EUyyjvVg-6~zxf#i9S_cf5Rj4eO_#7EDj7GkDRu>;Ha<L*(JHJD;shNAv6Sl@
zHmbkJ@XhYBBYgDl-k42+Cu)tWj_TL0o)5y8h0phHA(erCZuQ`8qTxtEeKHb`0NFee
zwr`UD7HAwC$84Nut3Abax<RSh4dSW4GPx?jwbtb13+Uv|IUNTpGmB7|?LnjgV@^iK
zZ^^Tcmp2r3?;QN*cEAee%-Xe=H)^W^0DcX+uFi}W6KAWMcJ|tv7gK~ovYJVsIO^<E
zTIl0ly=P-dC-a#sDBd*EXJyJUIWoVvKA0=b+FY^NCb)n*q7;I`Ik*i1rnDIna&der
z+`u+Sx7UHjRv^b!Ul!5JatU>?%4=xC*Ub+0pk>||ynrp#**Lln4N7xRf9(-$afae+
z&+i23N_=yb%@fLae#X=1SW+B5uv(1R(Z{9l$%LlJ{6&47`zbEn0Bqvsv%)(a#jeX0
zT3*%qh5FYXZ=FI(M=<H94e%l2Rk<V;aRig|>?yDT?<)iWcQ`nqQ@f_IeB^CIIy<W(
zx!WH^KACan&9~Pt5}t;Upl1=x@C=QaQ0BU(i%&?$3KpvBtm?dlpeR@#0AB8a)NEQS
zir68GK6zOj;#_Bo%XBtcz1`FE{Mm<AYWYfH0`YBz%Vkn`O?A<8@P66ubr^zG!7vJ^
z&IMsY<>rR2T4u&{an%qvHf?!avS^aMr_y+lcQ0xz(T~`e`m-JlUd-MuhOhow@Xyb*
z2ICIm`jQFOm2+D}rdr(+$9g8m(gmOXB&R1VzuH7!w@!YzDfuuf7w%ar^d`9o`drIB
zn<`30%w6QdA8#J|!j7!<{0&$#`-3t&-}#t9uql{PDbZ=*LzTJVX?fTSU=g|4->_px
zR3VWL;3P`H%Y^g~Qy!w;SvqY#BV$ldzkYF_VBj1qfW90UW$iEKZ0t`zuV@nO3EGva
z9+AYB4G2gVliWp5kRB4ughcKo07Z?nCj)?tMXX?(Awk@WvQx)2h#xjQ^vx0d7mQ3l
z_4K|e8|C&AC4lmzaBK{O3N|krgO*BYr5vawz5u2^I$&WV2mJd{91$)A9dU9Ss|}@i
zgIVf5?iO9#wor&oXK0-@r(;PI1adAtV6yPbJfX0eFrIDiv;7_X_TK;V($;XKrfbJu
z#O-r}gx6ITxr|`W9V$Dhy3fBH4h*=UFcYQAf%$he-Fp(@Ha%^)bfmME*m!~KiBf9~
z6uj<ROQw~C$(D%b#aTt$yK!)0uOPTnXdGc9oB;7sXB_17y7cX-%muE4n|RSez<|wj
z4;x3{Ey}D~tq*3m{2iCrcT3jApN>@nvH}$!4k8vzxq0%q_yP%Ks1++iU`OU>;9d6U
zlR&;`^HeKBL>_j4_P0T72B}haL71RW#MCwLDz=^qcVdxW*L|1FJ>DR^zq!z*9t0e0
zxm-)8CMMOIlQU#!vtakj+*O7<v+&jQQ8|)6=`H6FIR|`0_ZXqhs)G@Ec&@*USeHTQ
zB-QN8B7E8H!|TOovu%0;a{GHcner+f45qM%2gs?EP&DY)GRaBrg0Fk>n<&tyVO6XR
zp#K8i34Kg!LbG!f?lmOpb`u`VI~<piNE>OP6Eit~<Cjz^wnb9&+#<wOBQ*CDQy|bq
zRUsb-erjTWgMvPgic*%4In|YPKZ$`9@%Zpc#<?CWK$6-;KVeJF<*K{3TeUaocZZtP
z=8sN@y$P48b4Msq*;&~2et}Z<Hd-n<Z$%R_F)@zvjE9d(XA9kyn)k$=GnFuoAgLM5
z+lOKFOfk$zVUQ!e__f>SWXxr4b}34Tc!00>9%fq<0-$Nm(^ht4mY;(|oce;F5LRcZ
zu?Xqb;b7>aOTwDS{52^;^{rrsXi39kOMKaY;Yem_cCBZM<I<gIqS(mTv7EW8EI|%O
zA~8({d$-K)(>+4&M|Uwb3sLEP2-dRceYxphr>kDe!3hOpYUE7MsFBFZgUKy8-?O#*
z>@N55Pw{)W5|Y22{zK;3Ycj^5NynmaIAao8FNt&Hh)h2N%J?pj>c?IB_xZ*A8wfs+
z<RbC<C}PGiPV>_;xi)I`ElnaFc}7NFJv1raT}u}TjXSXDM++Ho!*$1hj{8J7OC-c@
zrhD^CkD4v+OsT-aQl{`h7b;b$A7P{g>eSNE^7F=Ub9i&-=lV~6f{%zI9iN^}qSgTm
z5RIYaQU(d@#<}?foFqZmf911;V=jFPeBZoY!Y@xcM0&h8H<>W6mi<m<9lM-q=noJ&
zSy7?CgCNbZ$*lx3qQqO#hg7J`^Vd>^O5W5uFih;N--r@2P(JlL`l<wMK?~%wt9zzy
zFCX%CajDw}|KxnT1Am3230e;bON9Zjcq!>8e-QBe$eTB27zU^muGM-e&v7C(D)UGi
zxTH4o<Afd40b{9v&{Bgbg`(pag<Q$(VC9KTG%?tk?;k3gpDiLc8n#RBTmMdvp@=<i
zP`M<6IAuAkM1weITSH;;@@MIyfX1RFF-t*0K_fj{q<;EBA3~mQYxi$xUQ>PX1uy?9
z%J*s9?ZAX6i@>0{D4mLRuxpM_NyNmZG|IAXM0?M4Mr!D>XpYblH8=K~p{~cQLX7p2
z|DK3Q-`)^hS_a<tTedzwYGZBNY?r^k_A7t1^pxXn{agCtfP|;iAWF{9AOeLI%5OW(
znbZC-c_qcdv#T0w*695cS|<7?l?0e08y1Z>p)C&aK&p^<6m)zwsLDs{{nk<4@sV!|
z>)N#j%AEAKn2TzM!O8<@y1a!M@=K|Z?C+a5xulbLsrtRvsEB+RPf{4ZvH09&?Dpjg
zf8=m6-AtY5vT1>^Ijp~fBH94d&5oQ<hrA#&C$$Hz5EQpMV?gP=S32SwhHg}Tg-Ksv
z;i(J4!=>Z|Mgkwu!B2^f7f2>aYYD4%$xPndh+UbR_ZS(a+y^xte>*)-uD5Aoawi|0
zo1=s|suaGBk*^#hYPO^M*0^XE%1f&hp~m(tz5FHg({XbU(RX{wt>-ac#;EbuU@A@;
zWDJ;WyrWz)C5W{GMO0WL{rW6Xd4Hl}ArdKO@g$fA3e|XAD%;EpR;DHEM5hi5Qfj7`
zNlU5Px!Q2hDdP|)Y{VN={DK@_4_-Z+%vK6c>yD&MNi`&d^{O8l*Jf1_86#SS9UG#4
zTk__@1OWy)`3J&Y+io~1F`)q-^(XSCDS14^O8Od^JUJ`Wvct3<Tm3WqQof>mGIVlO
z*)^jJG7-K0^`{#_(W@pVlj&mKM;kKK2CYNWXWmQyU62Y!&x><fT=PDWpDxooB1}1E
z$est)xKS`qv!tGV&dlx~*9tOPBA?b^_OCsLH_;s*j*r~NJ?%&0a|qUhc#w*JGkt!N
z*=~w>_Yf^^hhTQEtkaj(jc%oEhU_#Lq#-vHfDg?rjuWkVcA9dxw$4obdCkPmRQjU8
zzDd4+|9~Y`v<GUX?e>F77=$w*Q1J)rL<+NgVC!p@X&1UE<~4Z_nj+#!O1j$F0U&@D
zQu0-~kpDzJ=U)%~2zn<T!N7cL<98rlKj#MYNzJ<wdhS(t4~gEkIIyHsH>GtO3<n*+
zbqOcaJs}Gok*Ot2btn)~D<+9n6|)JE^cq@n2Zd}8CIPFw?g)#VuzG$CLYLFQ^3bON
zMNC^1Sb$71RV|t2zCh@y%wlyBSK%4Fk;KLEPDdBT)tMPRX_I)NPn~L|UwKX+($bue
zL;<NFr@&muX<qxGrIjzz=bjYjz_Cx`7%L!|wS-l-|BWPdpA8EWys{vbB(ROBM^*;S
zqYR2cu;r-;;Ohz;52SnCL#1POt<tXjjdtewJ0n>ix&iDfgG|=y16gHQKte-99+Mlc
zZ}8mjD(v_Ie|I1x9KSS^G#sLfc9%1;$GzME9}YIBnl5Yf9@Q@itQc9keEMCq+gZt`
z-)o*SzmfH}M**TR6zm(Xx*%i$oeG6)WJEk|6hWRKKC)(5tO^X}fB2d+;{6MzLrh+`
z(WoPki7hSKfbgs}{*8N8>4?V6$QU=kk$oLyk`7DieN|=ebGn~m)cu8PIe*nTj5E}9
zUJnzhWDBks+^~G?u(&3A;D};vgDBK=m>8FieiU>f`>eFotB*meXoxZ5C_3(C#u<`w
z*+zmruXJ@a#U~yjaHIy}pBBR5%DC@g8NSTlC5T8Zhh}xaOEB6{sF!-1Rlv}}Bmf$Q
z^LoG+)keuA*%aGA%;YJ7w!tz(0))iJ-cvfmV?iid_QFyPeYQO%R^yx{i!&UxYOM$9
zz~Nmse?9xIrqr$5uL6ft!^ifap&<q4w!Lp(1rA?0<ri8O69kLuyYp4x@P!1r92ceF
zIKS^3ee8d6{Kvm+9&!B9wr%nn#os9teh$ky8VxXP^_!#(X^d*u&M3T+W2%KVf^qza
zTshzj=pk|gRZ}X$GW(5l;?CpBki3k1zT+OHiHP5$aRqRmm}gg5R_0-a^>Ueta^K9)
zxn5a?(&A6AI%uS~2=<+oHR8z(%znpVG=rNKR$(L8r?OYn7tJtXAXC|VTfeIi@~9A?
zc%I%>`PfqdNyo#*k_f#h^xP@@GWZ-adK)6#xPk#duo6UXJT$lXoSBk(4KWxxE*ZEX
z{~lmm+Km<YAnds&`~pe)22e#hl_w3Wxs9SDtu(i0cW|N9=hdv`BC@=N7`CO!$LL~H
zq03+q`4No;{}z`q>b~Rt$Rrmy&2x2?MlRaC?J?YV)GZ#QK<&EBk37DnvDMT0F+u_m
z=L$~aPue=bjn>+^w>^AfZgoUoOx7l%m@TSK7hEWUHb^KyMT=UUtr(ZCBdZF7PRKEM
z@Y?0bfTr1zAbpt$$E4YK-N2vxe(*mmz+?Ayv_0h`4?7WxefRUhQqRZz<EEdV+C$ea
z@g=X*-l&Z5P5k{Aaha+k9i}=HlTFFPhYucKQIpDkIUcxMJ1eHP7aj53O6d-P`$9C#
zf`>W@^j-x2ycFqCnV#+EYjkEAj<7^IJS*x0Bh!T1#dYBbr)cY}R2w^~w;QB_1Pw7~
z*Kd&K5e?$5TRN1dAyAJLGd0pcKbZC1pbo9)nDq!K#DBK#pAEuf);-;%^dN1e1FNmF
zJ#RBMk+!}N_K6t3V+Es^d6D;dt)7>^BA>S+Js-&b6vM1EXQFZD%`MQGmSr(3EEra0
zIpO+}haDURvc{3s8mSuKk)Siu{(ARX212Tcd<xZgE*46wL=XJle4IA&+1zku)Ay%d
z{l)B>Rne#eQvk8dyk0>c=lsf+i?_<dNo*xPo7@ul!bQqqlq=Hy$8NpOcnPR{$@81N
zt|?Bnj?I?7mI*PWW4<Oru4GDI@NP!J>*1{JX(uwHB+Bh-G~PXcJ5$i(M$7MB%k6T*
z=XR3E3)-Xkt2Ta1%)=fXRZ!GU#(KYBc-`c8ENgjp60}c~9PatQpCO4hPn4AxG6ai$
zshr2X=7*1#K1M_$KCeQkA0GuWcyF;HcSx(vVCAYD&6mY&65mQ;j77hxLUtr$jmk4L
zPfFwQpwE&6nh_UNxLv5bOQ6-Grd*VW2OaC#AxKAL(#;c<pXU>FYU3(Xm=gPA&75{V
z;HOlH_?-4&{jOjmOQr-a{~t})6kS;ptYh1@?M!S;Y}+|8CdtIMZF^$dw(VqMPV9UB
zd)Ix)Q`XvNuin*F)%BtILE`umr^uad_xf+VPx$_0`~o@2Wi>W~l7M@Mc9i`oV2ktL
zLFU~!&+Gfll8i1Q)##hEKADKk$pku!u=PAi>=o5e+%<P?(3>(=vc_+?vDWWzBeh{a
z1%JKkyF0O;5NMpx?@p@R-5AddEEsVm%=G#y)?PwDIBPzg2Dr&uh9iNwlpO~*uc{Yf
zKzeta`0Bd%KuIe;b|gCC1>5guZ&Cf;Dy$IR2uLqjkz`lE^DI9nWSAImR$Pmk{@d5L
z#{*z&4C)_?b@*`(jG6=>wLgT}dp~REq4d#y%?ci35-2<+(YSAvh5UJHf)8lOuwj$O
z!iCR4v@rCD>YzzI)DAJ(TyJ9V@P2)|$@LcUKP=i53&N=qY4-W41fID&^B50x4`L*0
zn$EIf6j;fEQ<|j1E-dHvg|n;m)Kakq7b)GOn?(m|EG^-?KBho*gx5PU2Z5EHXbN{a
z9cUvOpdX<dWmv)bIyHK5a8Ua(Q9Cs|>j$LqssV92Y2fgSi2g&j3=NxWZqaMVZhO9X
zM4Kp_L$Oteo`$hynb+m)k@?%<a{~^<o!IN_?(gP(QH_p-5qAP@&@u`Mei|215bm;n
zs7pR5hms9T0G*0DKX)ajmG7Ksi>s58eKuZQ^(zO8x$~W#lCx9crN9w`ML*LQUzFP3
z#O-_U_xtmf%Ph3uZNPsCJZn1@F%USs=Ki;QqVJGR*b?!cwz<vIYMEIGmo`45aa?6U
zkbLx5dny~eEAaXS2LHA>sNrhuPsdJ;kUssv$w45hzCw5!LIRA^Rx1dJtr6pNlETeo
zm+nL98)U?jaaI%L?ya2smv}hsw)Y1(tvYB(yf=qe0kbnrEJ1d@myOk)rvPN{y-~l9
zQNN2;UmH_^E&f7X0<ak}uL_sjfYX-vx%ez?0P*<jsIx;(ajZ1RvD*D1<(YanH~#GR
zeDp3G%dHvFNnAWtRREF?b(E_AAVwjKP?=Ac-vGTo^21p&z!q6yTfH{Hsg`;aBi6BJ
zm0dOga&mP*waIbgHiL0aq87KZlGo?W^=|3lfXsj2@dsW^P4|-yNb8pKq*0y7WnC9!
zRV@$(-Ld*Ry^KQFZ0l}u*Ze!{+>E#+LutCqg-Z%#@4^e6RP@+6#P>F6-eu#G#=rj;
z4oC%^dppEcIQqo6IQjwHg_W6Cg|b7QvJA^>P5&SHXf9GM1%BGUc#TG7Q;bWTNgpRp
z{gBvZP6b3j@c?+8!)_0<&#4$t`m<WwdEG%@(`I6-+d97HO^0R6wo-aX@vLp>7y(JW
zG+8h?H9E;2{yr%JLd9!gg8x}Z-&lo?ULJ^7h$o6D49*?(Lj+vzD2*((cC5idiT`p%
z-!*NyYmU<gZGGcm>E$S*j8SOQ!MOk5->O*1O=r8YI1iWGr82?ChqJ}q*BSTBvg@9A
zdk}0x?>kGOcWn^vZC7+oki8wR8_L4}<SY1_w=w=S0~v$r@65a({<u7R6%OeeIIUzV
zS9!D+J#BfH>Y}cU%4HtglfDmcX`fcJZ^Y;Qf#IU^YqA1JL?Tod@MeueiD0xRY;pwY
zB;OE)4hQ*|0)Z&ezoQz!7YllQ=``4tvs(Bd6Y7oXYbqY}o||3u@oEo{>{+{xIcwYR
zXZVD^?&7}ti9bZ#fck|u4FCVsnA8f{R=N=f!1p9X3QN;-9^dJ9vr8>0p|s!<W1evZ
zf_^I~j3O}fG}Hw~mUz*#Z|4JOPw2R;s(K)Ed64ge&RG4yQyzFO7j$SCV=z*GnF}52
zh4&t!ZJl+k%|3I^6Xc`<uB;=WCvP+s>-JnR*2>hUxgMh!c^e&p9R06(;?H?#p_l$i
zrp`-X;bSFJwE3)$^SN9Bc3h{0Q3mfDt6%?^znyj6$U2S^Wv|;$i2RQJ(<yX6?@Wfk
zW|j^fVBMnH`@%!$!q`|)>FYDy1UBZmDp<#I4czwUcChsS65=L=f2xlfKs>dCc&A2>
z{zv{-a=;7j$g!QI)t1a8aMlnuQlY7I0v2m&N40!mLaUAfny*s2kG0i_9^N^%LCLoM
zNN%Aya`=?`MDsWQ<bP2&>-*H$>3-Amv|%$V^!<_6`|-Ed@AHDW{V4H2@dfZ-Ut1@F
zt6W>YSR~><{+!C<Gv=1Vo-QWMB^TfbYOW+}{gYb_(*JHac~IP1WWvMShn5b8>M&?!
zwQGY#FPV8qZHG?kplThualU?<i~@K-+;a$&(&Qb0KDfd;pBcsBQD+Lf_&MbsGq6R2
zffxV<QGSQ`yB^P-yFU9N*hGTfFTma*D=*LQeRKC~+QIk!b=L38qSc<Av{bqOt>BdU
zTr7T@vUr>q(Yo45uN6shzT5-E=-(e`s_E$3$ikgg9)Msfea%raIa~v)ltmp^aN7Ji
zT(FUpzEiy(f56W19Iah}oi<$Y+Uvx;`d6w{So^<&DCVBC(k%Oqv(n`>+^nCo!04GF
z_|M+pMdwV;)+M{+-db^LSnn)PT{bQKdFAIxbEf;_g~3yi>bQtpLll*nSgLh+e$nCn
z*PD%saL{)mT2{}Wwo>a6*`@{K!)4QH6nH_&x9_*QJ&0Wc@d<jQJk%=A)YiTQEFhsc
zdM?VjUe)fY;q!f)LeU@jz$$lQ-Y%IDCdU3tfrSy?gzmRZk?9yqc5Ch5VC+p-Sv%l|
z*TEC}s(EUA10&>`X)#$Sa-d~2-VD8}r}W}0Y36F!&E`bco?Gd8&AG1<hDU{KfjAKI
zA~#zpO4PvDj?Pu*zAE(fbB3j7i6jD^XAa<nXKpYo<R>F0l#IlK69PEgJBEMzU?pv_
zUo_oN)Bn!1PG%t$F?z8rlCoxGSfc{v%Uq&ZjW7?r%~;;0>c<5G8s0RezuB!<^jX_g
z3i@>c4EzKE)%K9iw=e&$?*53P-n|E9m~bQn(ZXk{V%S;gl;ry+?7pYNXIXY8{1kiG
zZ|N}~<!yD4J?L6gG2#(Hj^HUcZ{+Y+n+rxMF!JdaW_u}sA0|bq2Sx2MJf9y<#dS(y
zWfL$_t?LR`o*sm3Fr{ci$p&)R+WeS)pGUf;Q%qfJ8(!GuCDB7-GY{uo+6oh6Wfz0N
zmud6`iU#0^++npX{<ro-wheF>N_>z{G|7BVAM+L8z8WaxrgPEBwB^jJ6R*Fsg#<kk
zk#kDLjFwETplFrM(c}MFFH)Ycf5}P|dqM7rizuiC3`3~?Gfyqa`_=g|$II_M+$f>j
z=X(6hxW784{sjgSKkm<yVN>PDXL$lV+}KH;mW-{Ltp@+{+G{Z)G?V^*vrEOc9l^tt
z%eUL}*0RMrAN8&f(V_0BgA$1KngsOpbOG#+R%}mH_1RxPu{JyXv&8V!f%U0|&Cn^%
zwbrnULG>j(q{S5a<SpO3fk1X-(gE!ePblysF1{vLSLMRg7IC5m^<PS>-Ir3e9S;MT
zW*kTZCb#1Edy8&gEtVo6LQVIrpxK>Q=X`Nr1n3+=<>CPqvQ5yXy_h~kzve$S{20qp
z8jP6B^65Pr_*kqZ0wA+u`(hgdwf(0U*#D3`6O#@xs1${{1u*GLl~&Y#z7&5|Tjpf@
zOtJY#V-Anu@b8OCM#+z9-9o#4xv@{T-)kDaCNl@ZRQ3mAbe!8VwOhn|HLMf`DS(NI
z#w(@`)@l!QG#KfYB=LvPTZ$xvvV#HTPLYxy`<^By-x-q3Eg@5`Mb<Q~2Aoy*{A@&C
zWQ^(iTkU_IZ+Kt6b9(yca3pH;3714@7-l)f7h36tm?qD(>ROSRjh4B_t$nd#9tHw+
z!K0d9J#FuGN!Ivn2|JNf*7~LuLtO(KETD%`GwQOy7MbrxAxbX{zf9@vw}5?`SLtPL
zoa=XNP@1ifwAx#v&6(>xE7(`&0f(L(KVf8pEgV&NbRqsoAo?ad<}57y3>&Z)B;YT2
zX9#nVdnXg5RW?o*mK8_fwha#u`RqV;Q?QvuS?%@?k(}oo{knpFMnYzhxVLX*^&-~@
z=5qjq-MP`paTwR`*@7Zgx9<$GL;m+rBH%+&WBTUX;^eE7_dA`O5#!fibjZF$7ule7
z#Hk2WMTXd`YC0YYFSsLN-mOMuTL`14<EHt}u}e?!w-?SdE`O|Pm?Y(x?i#;?VRZl9
z<G@<w6k*14MbZLl=0w8dl=kXqYx{BGC7tW$A<c6v8>5`taX{K?U^4@NF<dvnb)DPU
z(fjKGxT`xi1wufckZO1M_;1%v<G16OO4`m3%$g)rxKs)(IV=bqv|)(t>~#JGx24Qz
zjs@ljg=3m2Mgo5OpjfwoY8}Tco0f#p0l`Pqswf1bWqNtV7&iEk@V`c$@r|k#CCRwu
zTAF%`kF|R3?v9YBjkf!gn@DfXXF#R09T;Q&pyfv2(Lm!uVb+$A<fs%aCZ?ILy8dZf
zZcR}4Kn)w#kxE;Y(PzF0{wr+@kbs3!FdniV;OinRcg=8kn_3#sL_ogCkOMa(8Yxo*
z*9FBD7ppawVtliA-n|U^r}YETO1vMVZ=Ra$6UiNbPJer1&LAD5Xkd%nk(~-TdA&qs
z=dN-nj@4ux3~7k~Y#-em>kZEqC6qKPqrn2$_AwipC~x70h9~36)J4=+za4BypxtNn
zx9zT?oqz|EFE_PWz!n-l2DRMYg5txZliAZHdQzgA_}zClkr*xMoP~w0qEG>6EF?9x
z?8Vh1yPX5TgBpW-A3+#+44ogHZ|X1zklnTx!{h1@gu{2*lN0>n*M#<=&``t(8?S{D
z>bf$*d7AS*q((DSl+hm7&rc8T(5kEEkzZbGM2V7y;j)RSuANr(A@a#GWLd|;(({YX
z;QFU(8-%jYZ~z>GQ&9uVt9-2hZ3hX?&{@zk96F+;t@sRMj&C&H_g)5%yQS8y^lwoE
zwvo+TmxL77nXN1J-s@yIM<iu=3a%8iw=!D6<=pUYEd}0`gmzc?eOR#4CFtg`oA0CE
z-b=c>@EXCaOOn2kc0jFolaYQlg}e)mdDqzMI*i_$D=4mn`>~FJn4<EUAzv>052G!w
zb{Hp&u~_Xyh#2cNFr7jNHjZ_=I-~vAXA_aga&z7R8*9VH;9#(O)$XNlHF>xQ35*$_
zO`RnU{s*?gG#z@o_7n8q4we=QNkWp*?b_|OuM`_{XhgSJ{m-VK6x^&L2v4cAq2Ted
zk(5P!8iPcS>S4#dZdeG=R1HQ_922fIoJB!kol$VLXa$$Bf0IjE_iV$W$uX+9Jw%_!
zzW$J6!2>AHe>FA|lpU!vsVfI7drddPB5qi0*$;l%LErG-HB^)r{n1qzv>dR@R1<XZ
z@UhZZoupke8M&PJOYE6lZ3lL}W4mN`n_U=UGkg(9G<R`Z#>)uQsb7GfZ~G~4kh_Jk
zI2OfCcrKpComZCCy3zQc3)S7X`Wc-#2)X|Iq~cieR+J5ZIzg(v9^`;RzoF!IqfHIH
zSX`cqgdrd2RL*`}HT!&Ra8C$C?6V4jUP=QtcTrly8(sJ-Va3kzqG8uV5Sx_9V(vE;
z3Dc_qlPkF}h%0pAuHP*|$k{ys|J?o2gq{py)-0dSHkS%WCo3p47Ydi_jWqG@cXiS!
z?{(MpOJVx8hmTe3jo9mkzZVE!F}oDGV##7HqGtk|wFBd8{FdWvl}t4QWLpX4$OvKO
zmN-xpQiEtyLLZbVN(2&oG{m`^uo$$WE3^+m%F3Hyhig2w#rts)fvv@gBmvcY^o8^T
z<lsnTWd%4r7xD=bvep;9a{jP5&shEZ8ZpfJzNG$0F?^F;2FhQ0Vpqj{a_{CB+EhKc
zx*F*ngpYpAE`OLAEa32|4l)6+sY*Y&8qL)y6~n5|SeAm<@zrx(VioHh8;OYTwILQl
zqVn8<O2W;C4bHhRejzIz-rldvi2>2=%zSxEdZ5UoY%Me$UbS9#j7kfd;T+JIMG~n5
zQuTXviT>1=l9H+f+IY<YYN<NH1zIytm(ZWdwJqbK5mVt7Q}*_+BYauv1UxKI5t>ew
zB&@3G3h1`Cvo)+bsBkm1#s=Ec7#jC$2LR9Q5zF77wfVt23T1oHQPc@et{zapp-)Iq
zwsSkssz|l!ckIE4wDa*%65$!7#Spy&PUztf+4*^EHEfG~-U8)mU2F|&b`ztD(K?+j
zjPyUsf)m;By-OgS%?LcfU0OB4Ffk)Z^>klyv*U-m$D`uaTb2tn^pw3(Gk+$B$Q=o1
z=f_C5dGV68va_NosuO0^C4O)N-h)^Ea5KH8hMLh^jA5c&T?Gp9K7+}^ZG^lBa%t=g
zokf2s0fY>LM`-s%9^a4KB);!s-6-y@UJr7mIv0!8RaS@$n9FQaxA32yF6$-rVBv#g
z9i--q7nycV%xX(+UCga=<03Js3ijik9Ab4Q(JlUQO2F}^xYTY#%V~KDY6nmP(zI(S
zoA>K%Km_XAumd$Tuh8a-{Z*2|6aiZ&WRT#;EOWfN=VSgQR$0=FT(PjL;QZ2U8y!ZV
z|J#Wjt5~*it%4<L%fJ+y2_B{`i;m|&_Fklgh|Cu?wZVj+RMz)uGZ??m{vQ1k|L?O8
zuPOUHj|>zTv3+pSbSri|&Vp`bj@+BgvC*lxbhJ>;Y{{jyvu}1x4xvAubQ0Km!C>1d
z7TC*j$JnLrGs_%c(vBKHv&%YAEAn1n*60#8nzJ(eZOnb(cu;Y^k1=!-3#sQ{HZ^mO
zpQ2NBgvWH`o|5Z4o$^|wVs`LPt~0YjsVa{+v1uN|#<)!DIkPzG9RqnDb*}^)v<J%T
z0d4<uNyv)`rd31tjV1ogWC<!xOzKrZS%U*+-5(z71O4x*_H7Pll78_#mY6o*#rbAv
zT4|)OZ8Aw*vT2CaH$6cSKR43Ev~T4}u?OE7snwNOHd~I)@9_C#eNilFM?CKz*N$6-
z>u9xxU5oyR%?i>gYK)~uiaIC>Z1Q$b9wYYvo|Dq1dr!K~K~OHUp+X_6r<2eQEvuFe
z^jGFK2#xXil6JYUh1LaA@Vq9CFZrTBJLLb+z82<8$N{2-D3gioEXT^j+u1>zHU76w
zV-y%o=F{9v^)FOpIPdCl`JvqZ;1ztZ@_8>h9F%$_EviA7Md?GhN*_<k`)Ts^FgQ&n
zEXJPPuwS(0O<rm>5QvsTvCl4uQkuevzm6aBd{ia=)ef)Me`6Ht%L^2R0ZlNOG*;qX
zStdl)iWnblhkgfvpCBUX2_l0$Gi}4{?aar3G{pwzs0JI9TSwZ*$52s%g(+j%t}g-4
zS(|43+^kcH8^mSQEP)km8To0WYl8;0&Hog_X>`uw<XGtcdp_M8A1b=?DX;uYuO)TU
z{=e7f^c$%QvAAd?fl6cnHr^vs@%`(_6&y8?f*L!FGpnIFtu>298ln7w`Jao1IE6-;
zSJHV#i}P#VB-5gA(w!DOsoLXBQGEZX0Ui^EW4W(?$|gzD(R7VpfCr=e2+nVPH;nXb
zvdDA>RMhcM*~8#SO)@zqlpv(-=P_Ku9~;Dq6-fLgyeP!K&Aegy1`owR`aC>bPn88Z
z(!~V8Z1M|LsoPc34M8~ktsF^JifBGOBE<cvPg%k`oaK%q2$oXw`7|jIb=&89xs(s3
z+y4e44wa{ZJ_crpZCoAY5TLi84x$+1*rmtgOr~Ya6@mT1lb?Nu&g;GCGiTPBg<tRZ
z;pf=r2k!C21>#XG_;7j~zw+Pj_eePiz2eLongwYNO!V2O;@XfmJF~FzKNTVh*~N?x
zptsHS?sG)l6zyIrl7Dkz$V?sTj7x0dNMgujs{=<nnOfbl=A7$%?Q?D!%6K-DE<X8x
zMFqXT2g9ztJU+21gbp2jf9-vogZNuA?+wom<?QwvuYyfQ+mEeOD2|Ob<Ujui+{m*J
zYA&b7?l2@Maa*^(+9FuT*jPP{j4j5*NTtA-f&z9B7(k_mJJ5o(cF3|phN8Lo7ayaZ
zmCl7*1PyB_q)@_;q})gfHX(#?U;TUmwPX1(B(}8(9Q$h@@zvet&o-3)#2iWh+h5n-
zNfNrxo1*>@<>8$+`-PXG^(nVNTwszniYi>wFHK!2C3x^50)GkW?UBVW=4RS-L)pBo
z9>yoq>gey0etDH%ug{02ktc?F)cQwCp&%-$+lF%2sEdj%e;`T%F%-&6E@`<d`a5Yu
zIC>;YQH(9$Al`)h(O6TzA|yHz-`4OR^-)(j%;)7R40-$eR)_P6VWb2e+RuKr;u9X)
zIMl$ZF5+kr1f-XrbO2h~EeRQX>(y~RHG=?_nMLchc8-tl6S-tR@!B5Gd+KTgPsRdw
zswpAQ1RuCS_~xy18>zhq?lw%g6$>GTc2dvZt<T5%ZW@2rUp}k4XX6uwgegdfVXVN)
zF{ASe(JBiy#EVUo1^t|r37DX1HVo7#^UDo!edi*hg;2`?LM0j)pi!Kfw1MHqp%4R0
z%;l6?BoLyB>{rjPpY^4dh&Ma$*+)m&X0`7d*<FKpyU*s^7rrZvD+^cU_l6JEmprSr
zxmMQ#VV_WGy{7%gpB7BDbZU%_lW;>5Z!>DXg9fkQ5QEY@DFzWep_iJiDS0N;OjVN<
zVi_UuUQi)0@G48nnytxPXNcj8NS<ord6C%>B5i-?3t>jXJ}sGc9afw{)I)^$N0wpm
zAS&~5hLonRE#KF0>%(u?q=lX6c^wNzwyhiZti|PQ9aOqzp(s=>7U2Vj`J6E>i)qBy
zilkTZwwb<rRkIrHO^4k$LS4P7tzAw1qkg$|t@*9|Ywh-!w6FfFyP}C>thTW+e$<k}
zQe2+Lp*kjJabDmfiwo~Qkif8Oo>qsNaBCzSZW7?Y{Li-j-|GZtKRmpGpblfRfZsYB
z2HB;y9JGUf&Gz!)leA;OuOpJ50itEu_xI|Xm2CncLchmxp)Y-YfDT1RVg~apg_3&k
z;Pg2eA9;}dP%-h|Ej*lY^=5;`AtceMCxxR@F-nu@r!eJZ=+F<ZGs-HmJ51QALR7G;
zR*AqSXO(b;fr|X)dZ6_*Vc27J%+^#@Tl1ivSd8Pj_(REd5b7Ly=b(O&caU;*=RrG^
zjs?w6n<;sHRK<DpXaEQgfQvVojib5$t!kVp^!(5F<RbkT2-*5h(3UY6ba@<4W!xW6
z>vp)Fty|`O4!|?ZSqQYCm+m+;8<k0vwjT_+3wE;+iKAXkuzC7mtemmOc3BP2exHZK
zn$KN$EJuA`)llzz9jS67a<SMDDTD8*Y7WLzP<%_n&7-4rq-j{xaa$rOW>g@OZ>--9
zb$FSn-cp*^e`7$CCo`=f0r0wkNP11jdFAN=X&Ax3ePq8Mh##j#aXUb3ouHtgtHrLb
zw~Jk%&m1Bm;#KEOj}+mrrMJfm%^JOS@7I6-4fcm4G2d@`zq#l?)$&n{MFd(JNbBU~
z!tb1oNA>l@h~XQGgl$hO(ZAp7g>qd6ee%8=HDemVAVF@0Eb{J#4!Nh-!ME5<>*bz6
zEEWp1?`GD}uEOoySB6g?M~DYJXj!5Gy&{?hZOWozsRcYsN2b4Br8r{j*Xs8F^DP_*
zf&YH*1=k&$mm>Cgn3pQs7rG5V2Kn*za=2OiI>kOq;P-J?t#Q%0`*|HE_&^Fo(Rq12
z&nwCdd|&@c5&b?oU;gv{_C}?#SDE=%rYBbfiI#LLVd1tK0TtVzNmFMi-<LI)eolAw
z=y%P0-Til-dNfN0)L;LE>3uQC&sxuP2my{~@5BI=b?g$ww#HJ}aVFau$8riHDuDM6
zQM`1%t1SAq$SGq&jf~ye3aKQsV2ThN=!oanXusV79Lu(4_4WQ|p7S3o0qBZzaxfgV
z3DLP12+w7|<*}k|nd3MBYxa)h<Ky$6&6m?C;qw@ITrpUaS9HuHa8BBS5CY?ck>g%&
zxgJ17d~jSF3%_YlZ}Dg8urTY=j(rT%$X80=Q*3`A!uV;A4HAXDRoLHTaq+fCW*>$O
z$J1HDKovHP$^~WH^3U;rpi(N>y(8G1?=V>%4OLJ;q<~YT@?b?8EqY%hCjEadn1sM3
z_PfLOo0oq9;sRC6fE?gbUIlG?9L9hs@ZSwRtWXQR{saLM6SmtXd2^J)>qsCi6-GrO
zdlYXH{ti^t7Fd-^>#WZy<58{KO93wp_`f>>rrBAO7g498UF_S+I_WTm(zkn~>7*Q>
zDr$d<8w_b|$TmcPh0~+Xk}m!Jr?GAA3I8U$kX<$&7m>3iNA|{vXXWh$smNmhwC;=Z
zeJFA{nd!c4m@J1U+wJ;&kEy9wZ#JIT+I?krCHD38+zZSt`cG@7aSy3PgnF&^+d~ul
z^1v4r7Tt(Ii!O@m!qf|23#4pgp+@AZloZ$-gecV|dOhr9`jS{}rnz17`N|0WN%C`$
zsT_(Kk@MqEoqZREFW8P^NI$83X*fgPJR>fZz{<&2D%W-*gOPB@nsK}1>%YH1t0RH$
zkNf}dOZx%8@AqB9Uf<9ET-#`u17KFFb-De%J}#>v;jutGfWbMUyI~!2z@Tc>Z}+$Y
zA$itRCKE3`<HNE7=5`d`g|NJ>dyzoukf2B!PGnxN^{7kqe#pbU_5LdKo^-cTHp*%_
z(!j%>YKQlpk}F=j+RRluan9Iwm7N#^`p6Z=AP6edN(ge)QUBF}nzT>7$jGi;i@!??
z|E`}3pJ5v??&nSQhBOq|3iO~F2Et}9`(b`Z<iuxG{Oo=}2d6A<haFhz>^b?pfPjEY
z#w&Xr_2o7hdRG2q#ou0qGy{P@B__PA!vt-fY?%?atE(s(;Pc+vxwpJ#5TD&Nzrf-I
z3|vbaM&uUYr}K{?LvKiZHRom7-x&1rLn&!rrGGL1@S^{Ep`oXbxLO(PaZO!y$3Q?t
z^m!R1Cc?pa8R71kSKhI%(yBiQfF^nYvP9TyR;tFCb{?dZg9YNAL>=)tpa@Py(+tcy
z7M{U=(Lm%a`?>k$(0Hd2y00FN0$&6^|8(GP;FPELKE<bfflTHOKDqW!;x7Jgh04a?
z4aiZa^og%zuvN1~96!B%$?CT0=BEW+-#xEL^j=bGz0IdHIf4FAJCg=a4NOIPz?hS%
zQ1m%hP130&gp@#iV&dhCwQtlQX~k6-xu?X$F7#>6Bzwv~)0_D?T>$>NYPR%f$a>JE
z1tL>WHYe(}2<q!h@K-Jfv~FM0Uuhm;Ep8MT_mC<RQ!$I|sNpBw{p{TeWiJYtWf_&(
z>88P|HlOEh_dK9oWf+0;nBn)Mp*!y1{V?J$AdKWY#X5S~I4hW>-9!ild=<8)9kR_|
zikI4(g6tX4n_Cylq*1D_iJ{GQ8ruSb&!L^WP2W*M&z50w`Mli`+wMH~_4}=7WffBt
zLiDJ^2MotvWZ#MF`psjWqc576p~0ri?t0)zadNDQtfI`&!&>=Cp?l?Zi`Yd)MbtU2
zX#POHSi|~di$E_B9|UpD=G>pN;%Kp5PweL8;D9h1XgmXrj#Usql=p#!D@CHc*KX7l
zd|BZ@Dy_gpCX|u2o{@vI893hpgsihY95-?cbzL7ztypLLYj?-uy^Pilnv{OX{CH#2
zxzx_U31>vKSUrK$Gh%B2YfCrSFCh*W+gW3(LYZ+CKAwhVVprDd%#YU2ci4EJ1hS$a
z|J!%}8F&RD3${(t;B(o&%((a5|3|^78$`Nbn*f%Pix1J&T0>-``9cYOs+2$*tbv`}
z^fxpNId<{rfo6BAz&<8S!`ZjV7jN=G>lNP>^Dhuu;Q(07ocG#iVBgVs;(MNTqUZPA
zhJGn9g{KGgqRu;fzBzzktu5}gQg=&}%z&c>bg{Wwfk8^DQHx~4ccz-|le{>D1FzsN
zPs|b_70h>RLK|q~oxVFH{>JHRKgrFiDMH*U2qPjZglFzjl6*bp?rpbTELBw$XwGU6
z#q$D!uBnW=D>eFAJDz(1&>&`IIM>27;#zxk+h1k1MT54|BrtgOrta(GEAyN&OCT6H
zR%hK$OY5uK+|TH{d?y|6Bbr%6gHi50i%D_5?AJMM)t<)Kri;)|<|ShG>h=T*vCBW5
z8zkYu!p9ehw)Ev=%zi3U9h@pX6)cE|OXZ<o0_+?vfq-w64M=`%t;5~Hurr*|pXL7m
zVYf{??(QKgtii#-jlDBRU}%E8ysh@;LVW>S44A$DJknY!=ac<C!f=q7(jf?bz0NxP
zzWjOf3X(4I9n|i(pSil(6GmW$ywogELpvR8W@#RE*w8yehRRJdG$k3z!j4K?M>;%9
z{5Y|=`#Ax-3OE_5+|7tETyVu*K**qvj#NSwE>ADU`%}eX);FbFODVLb$S#>HPFlVy
z{-oiQA-A_}T8+l5yn5rg8Fg=Jx=1YE<Z*YvX|pmGrD^E%SP!&<KF+Z8eVsI{iE0Cu
zkT4=oX_di_Ul&Ncr}-y&eqZ>zFC!7ux#cBh>gs8RzOUodd0jwX#9IB%7W+bDsjjD3
zcSVMSA;<Rxo5d*e=sNei(od}Ie_Atk4cp<HYOg5broo`$>D{V+`fv-zL2FtUW4s$E
z?a3K^t~1SlW?$FA^ZcIaL9%@xM3R(C2(cTXfGPb8^Qf$^)Llfz;f#d98l(=#&_az2
z4P;u?){?;k>w!7RTdF+t6)=hy(~FQ{OVc$|qx1y#p+!|UD3^CiWC(=q-`?H??;;eV
z=~oIRqI^FNiHW@~>wz11!MZHx3CL-2o5|*(*R1jWxEnp0$?<wz)>KS~1XZgZ2|l!^
z#~@=^Q=W?rvT0*UO}{h`Svc`eVrPKLpSsD;6Bv`@uKj&nH{6-?l?&eTJH<_jVe9YI
z_xoro=vPP^E1v+9RR_TYOO~>hy`3WI(B*-9257r5cEgWUZK}OYRk5&KotS5&(VF5J
zQl8DTjd~|ws{8(LlkPza{Q%uf{m)eIk4AL|FuwpvE*n61#gb(JkgQ;k_w`Vw$amF5
z=;Mzv%&{@~<9YX55coHfE(!jwe6U;>gK3;rI!_}kXtpDHJ{sP)KszwPx-lGs-5w&D
z-#4^lDVF2=a4?v9>A98&iC%S~5WH+t4HggIAe<%K&w`~)1?bO^R7MpkXsBm^OvLYo
zRBE4zz7>t>vpbnItL3ZYijbik|M%@r!td{X+0uTvNVA65b=*2?J9~NUy{)(yC4q|7
zBvn4Ru}(yt`&I1Ttv?Azv7+Aj4GK@zBu+0C1(NMEJ=k`<KbXq!!}cz4G0wWxZ&M*I
zBWRKf@e|I!GP^-EYFsC?zay>y1dNr=`pRr`mxRrAte@$rpT(GiH+sri|9Prn`~ln)
zrG(uf8??uwb|`QhL@_AlH#{oVk&;bl_7dwrwOp5A4PigqbmJ=cr36K`qIJ4XQxuQm
zeWs<o!99Y%!SO)I{fxKwHmVz1_da6Ds6j*<TO=N4`rLwTnbH}y2uRVv5EbIP#n>k7
zL32CbuaO_-b=eh*+A=?p_*6WUqRlrUO^eX;qI;{AN)>^*Q)$(9O`c`*qSYR40Ln77
zj0CDe4}|+kqTr_20dKbFc)zjscX?;vb#OXon{DfF%Lc3^MkUDT0z8RjQ5y`afKh*}
z%G6)7CXRo(tIC@)bS9Z!6+pU!jQ_SE2mA4yHF>(V*mZt8AN0Z@ttup;Q{*Ey&Wv(~
zV|v3t@^Qlf%kfT=A)67?aJ)mtK&(?%Dd`g@tafz{HNd%1mUk+2pC&jN|B1+Eciu{A
zZcXCq>%8#lNG@RJ>ugXT!>Mf8{(g4LZYP5us;190pLGt$0|Lj?zF?sjt{UqC{Bx0_
zY`nfw>1+{B4_2ed|AU{W{#AE94<Wz*PH~a3Jwdwd8Mn9=Je>Bmf6lmHAyyRFp}1L;
z+Jk9()CLvfqRK5vSc@BI^De1TqR%D|{rYNtg)fAlQr?F|KfdH<PHWr|T^04JvMUyd
z+BR@Ku3_eF#Op6T@$g`evz6o=DiYhm+Xnz`UCMR#A}eLGN;6<nGQ<^i`uYV-DR*(=
z-_wBx6$*o|u>{(j4ms{Pj;=Um%o-W><Y~_R{((8fz?1}HQbcj0a6O{h;Q-TMM#~H*
zI1z&BK2X)D4C8B`$yjx_?!PHRjc4_b)PxwJJ{ubvOj#p1(X`|D^rFDEc!y&vJNC8P
zu>gG>&bs$vDk)KRL@F5fJb>kKQ48{1N}ZK^ES(oK-+Fe2(2VQ;qqs8Yi;i5^YI-z1
z9b>?;pC$k9_)b|%+~mC$Q4M3?txsz`z164#c$Yv9V;q+eH>0Ei`EkR8K~_DlTn$7=
zJm^!9=g3G#ZHV<9nooZKO7y`>qx<aP^0&)yp}>r-MwdCc&^JSi?Qw!}G{XHDjO3^m
z@^*~6#Z;|IadlA&!CDkTLBd61t1c9LBmgw6>PIGxL;~LC@~)gTnmc-mHYU|2B8J4;
zVf=(50n7Pw{#Z#u?n(=ZXgnmTDJa0fIUaP~MiBDC-GPiHpIRcyT&!GjvmP@F!KQuD
zjD|Nn*Pb2u=;8UH=Flp*+u$iA%i$vqa9P^_`xJT}2PzXHWFA!wGavw}e1U&Rjzj`Q
zu+YFa>FdpQH53%?q!(n}eLl2t%*{i3Mzx8yqtimA`Q@LCRGE|#hH-$z`-}q%j4Ju0
znW%OxZlba1FKMO<*S4@jh67{Kr^Mt!vhhL{9py&3ruuL+Emri#PNbTL`hQi{PH$cY
zJI4W!BuGLBQHnwlCwas7v&Lq?pjmqXlN=dCYFxl6GPjUdntY3GxJ9bQsfNQWAGWH;
zj#8)lmzWpSE7}h|bbA;Agvdmd7}ly?^yXHtBqbpEI3md|^(pw4!oY(sJ4c-AKu{%|
zJXp_^Th#;lS+e8pH&iAv`b_Y+wC$i<6G%Iisgx-#flaLNxTNwW)sb4!&tS~{+TRh2
zyZ8SLa;4ITbKi*sSAKlN;rljwptc~~S%CwnVw&4HWs0RQ_$_Ee^vwuGDhdp#SVKm_
zjaaxFok|eU`<YTm3Muk9%o7*CiBBm9qA0Rm)lAK+=L4-ntYXrTFtkiD5S2`&5kq&J
zL#1eU+5`xpi~~8sr@Vh7rRj2+O}ix)fT6cGefOBOg5hA$vdNdQ*PwxOG&6Y2hHe&|
zF1w^DsDp0oG5VDf=?7VI=Vu035Wl_kMOzTh)8HYhVX7@&!>{>UNI^;W%O8^)lP{xC
z$ysv#%E{#wC#1Sz5j!xw%j>*yZ69814<(0h;i;^zC@ZL77U^#iUxG2CWntBH3*p72
z(SIOQxr{~1!9tiAZjWNIR$GxOU5F*{{Fxk@aXd0aLiRU_%-`vaHL8^we&^M&RluL`
z{g_iDW~-lZtMRLK8OF&kX@wrZVZh@t_6G_H^mZa(^)#qrc<#30B)8Xz+|)Mt4W|)m
z-fCeD=k0xJk04(Prl9JOhE^CCoR$X{8YC0r5IJ-`n&eooDVvp~TWp^jYm}W%-J321
z(hC|mG~6JOvd<6^3A@gU<)TCREd|-Y#GebEGd)>3^}}yAa7TzNUzb}xz8@~->4MsS
z4ln3jY*>yFMO6$QH~Z^kGY(SI&fqnujH%sg@G2<k%^JR0Cpa>TJxg6^uC@{`8n8T;
z^BlJY3xeNU5Hj_h`H2eUfkA!wG;gPs?v>jUBeGOx&^>9hJ*<1(^_u;C^WFW0?;F&r
z-I)4m0?E9V=C%plXjw#zgFm<@7tK~KF)i4n0}&!gtdrv9AnBKpHh2kiGzc~BzSW(p
zRk6)U*_jCxy^g-B8ku22`=d064s4l$?vQFm+^riFmp+Q;_laDJKJ(4$fv8u-zqwq<
zreE@w11Ua@*54-aefoeqL`hu_b!4Qiat;uXsf3A#sDg;X-Yh+T=GXJ`V4CWxJ6+ue
zK1l!l+Ae#u+mM(6<!+OS2N0_z<MfZz<{YY=pXrl&5n|R;j`5dzeZOE5IFgVx<n(|+
zRU<C{$ujF7;RwRG3~`uSE2z)@q?@xKR=o>m6=U)^H-WWOO06^dT?3f8utBJ#tPaw}
zmwdNe%u%e>>-=hO?0xH1{GP%Ex$b%|rLTSYH`qJ)=eg{pMadKc5RB(zh4S_uj*nwr
z2$lJ%c6OQEtUV$=GGnu}!UEckZL9FvOV&g{j4*K4>3llJ&`Q;w=z{eeXopZ!x?|Z0
zoa|9YM;(piu=!^ii=vM#6d)t?2do&JQ!i{<EWS>*b;+SXtxL#*boXJ$v9<+7wyWTP
zYvv#OyRjZgN+5~?lh2d?Uq8V!9mmJp3BPrZv&#KV+<d{3)lV{g=kC@Z6ASap<_*x{
zYJwTb`}oQ><l<YB?RLPR%mKg%yAUcsWT+C<;uy75qXe%i(-Rbn3XJwNIRez8rVW4!
z6UkyTdwi<&2hW;T?N44WqPop~BCb!Xh8NRC?`4_g?(f|g<c|~iT0cc}=0V@j=@BNJ
zwHPaGz*ON^21h9iS75*PkZ_}jDI-XJ=z8tk&)@$9(U0C4SsY;ZG21+n^&&`qCy4!%
z6~(iuMpj98T$snpc#~*_M}6YhY1+MR<!@0ifc4tVHi%?3$b2whX*U+7u*-t&`)QQ!
zHj9V|;9csxh{wOWBf=KH4z)w>=Afv7As5r5CBp4Lg*oIwu^RCfO~SSG-t+%Es=x$a
zL!|v$6q8m%)I;bg0w@_>_`sn|=rQ4^$DMKmhwT4E5Pn2Y&~7W?QB@biWLK)krTUZJ
zS4q4~gNv+CM^pmNP8ZJ>nHjMJQV_C26J)*96H_T_6I>56#PPNyouuRQ*>(C0{QLF6
zVVNlg`sM)pM!xfMF`bjRno5!mp}8EdD8QEk+N$Y5k~l`)ibELDzr4iI|4Z?m0p4z}
z^%LbrX?5P+nW|590tcm-N3>(Au9YQOqSXr$m?<EBoG|UgLXK8oh;^z7f{#}%bSttH
z|B7;F6Y-p=BSk2SW5Y!Y4<E%rtTXtheV1zadyz^FZVUPRWQ7G}@AupXyI`Bys}po=
zZRuhEc|wZNhR6DO!ltp6NSqZK`nV<e77=2yE)KE*`T&!bB%D=1I6k<UD|v+Gh?4xf
zUJ9$)2B<oUe<%|iUL?pdDix#zLQOd+kh=MMhK!RX|9Hv{NoYLF@-|nt+_ON%g=M90
zYx^fCM^sw`YA7I3q!JV)CD6H%c1(R^i4_+WK|cdml9c?K2-5qw#zMbiKw|Zv69i^?
zrcKO8gb)rDE1Fo>hQWNTWwsn8%PLX%N0;e8PTfiX<&fi{-%QrXZ0OQP#83QHhEd1A
zx}rpf^~y#lReh18nK<iHz`o7Y>dAESX7*(d)RN#kvbx-suZpPsQwpD1U%<JOXVqLq
zja9lcu#Gp14xos}=t(HQ!4&8dZ$^yG*^l|hmu!;z=+b8+TqZNxmd(t1^iddQs_Ly=
zQRplZzfmcMWuy(S66)BoxgfKiZ#sKE{hdr>=>AE~NB)|+Cew<8RnqD~*%XCQvM~ZH
z-*&fXJ{W(CB6X&{3T6R)WSQYrlBR=LXL#{Pfqua!wOlz)C+F@Gmr}n%plC4U_Mlgp
z97Mx%s?02l$!DU*0G@>kiF?pb-Y6}Xa&5-RmJ$dP>fEg!FgS6&m{@<Qb_pDO&}VhU
zUG+~V&S_uBX}`z3o_$VBU#tH8TCa6+`YohCVGiFX|Al-zd3l^Bg=b(+ZCNc3-vYet
zkjA+7uQ3Z^NPyMx;=jZo1%wQ_?p1_#eK1n_1|tnbphBvszcMZY2T_Aj1s<Pcp%8Sq
z5uZb^0@NNUo=hWXiMwwaO3SGPW@xK8QW#Od2F29#4$K@-0HRVVp0Y<P`l0`lDTPcT
zDja4VY-C}L&}wCvp(ONbg@~x|3l;d0<&d=`T}9<v#n0yQljH1P@%eV;IP4+>Vq(12
zc*%n39Kj<C{1X`YKltyb0G~lPTUp#&8*jA^aw_tg$kkndLv!Tl9pf$yi87L!YMYxJ
z&(vlYDA8c#$Q<kBYSOvNzP=aizTIa2L)T_)n=l+Wwfb`@$Wo|EM!BgV7vZYPlQ!1;
zH@qbf({jA@pW;@aOa1_~H=IbFNDQUsHqde^P`OBqfaFpg_T#e`dKzOkw;cEEpGv(Z
zHNE}&My8jB>T}@00#~OWpAeM2^CUH*yr3r&PQn3Z0Ubi)Oc|0<FE6fEFfaVagscz?
zZx6ukfuZ{){MlIUus5YDRG+de@AQ4Vsfk$q(Z84mrt}#cy1+hB(l_3`(Vvtc8$St~
za?Pd;=^zG05GJyzVuvuD%!-@YTGTBo;VN5WJC>4;AE_>c_qm6v!q^0y=oeU30l4~$
z=SC|7j!9@OENa3zF8&CTou+tCHL#^<6j*3;n$$U$H1Mu!ds0%|Po^<BxKEm`tPqtb
zQ=vW~0grSXDz)?D;wIXd-M5!CDCQUia?Hgln{Uv7glu|R+}59sqr&irRDgOwfyfe0
z!7)snfGqoQ0QdLV{-*O|!+Y4xOIaCH=XXd-j4$vCFqV6g%1BOTa))a%7HbGKbNNvd
zoEU~Ap0Kn&h^xVn4i<DM6I~cnZ!9kjry^L1z0}-F(2}`y2_M8#EMtgImwBZ<W%dhH
zkj#-wZPesKnc1XTX<C+a98XHV>5vpgu1W9{siXnJX&**?0B?VWn|hDa5YyVca(G?e
z07s<V_io-=IBZGSPbP)Uh<X91DE0!=&5W-!aouwVlr=eNC5Rd&R8E{?X>}_#4llRn
zJJ?$)Kv$osnAL+~aVF{Yrt7;8^VV0;Nv#sNg@v$s#{3U^P)uo5R4pD>2!G{vR^I!t
z^~~sDPx^>-c20Tqq_sH0_$3^E$Gm7lsU`**pv5mO6$_n4WIL#Oz}vi0Jlo`rnh^lS
zzw{}D6e>Y`L_txlB0pK1AvEO-TFs>XJ|C>1G+ATr!7q?i(eN(*9@R(us^`8-(YpUA
zpY9$8z7&;hS}qtCG1Dx%@Si7Fm(BWlLlSw&e#KKr{Y<z;1e(C#u7;xp3N=hgT?CC!
zJycEIl|LEN=NZ^)-!Pi9et(IXethJ8&$ijXZFS!<foN`d!8+jnHXG5OZuhZL5)<K+
zM&xQMIg^7I>0HdsI;ghAtorAIrGTEVfS!;x6M(pmR+-{TW_{+Ln6R<p24D*z3S9mw
zv9JiE5(+diLI8gBs6WaamhoV7U>M~A00fx=GAgo?{A5xcePnBF^LVnS1I52G$z*;(
z{|o_+oW^6~7%i_~a4n=06Ks%+MCeKWgeV?#N6rVp?O|%PFKb&}e;>|mj~Wi^S(GQU
z`Ier=SQtq^w-%pSosI|4h~gGh{2b)2?RwSh?KWS(*l3^Gef;Pqp$c*Me0B%j`W)Ei
z=aAH+RafWdYPt?tf9J4<06;Z|27soIqc}rlr9&Bqwey>|Z<uYGj7RL}HeZv%1pLLB
z|7+_-%{c^TSw+?ARg)1i15y1A0;yiFLS@^i$V#V{PbFM+vd{T8mF)vXXV?BqER`4E
zq(rWiVawY`Uf-IBKLvCM`f%`=NbmNe2yf8WTJNRy1PFuWBT`X-7D4zcA+6v`+|QT9
zs3A~Fy3N-Sx+0c77m=)N5-Wk1r^7ChaA1aV6|l;w8N20eSTdjcjh~YD+Fdtau%38(
ztY07tJ(PrbKYbEIJB}{82cBIQykC2N39@W=zxozNmXigZbI<++0@hOq9G2W~hWuLU
zTYv;I$PhsEWAQIEEGu@GEjA>h6a@0p=7)ZzKI7z2&Lc~xE*e-|g9xLa$y?HY2wj6|
z+t-J+KoOQHDwWi?tP;W64kVNCBIisR2g$=D=;K!cH-3gEE37+^!}8G48I&6euJ|U@
zLoQ39abQ1C4`pa&aC#RX@5<;gN3W3ssSAr9i@s6*ofkJQrORhTxS>&aST#TS)q}Ze
ziW1t4?mXhTy3Y1Wf7!AqX)9tL1ERyNCDGaOyR5;X!r!5mNGkP@kuF;&qcyu;jyH*3
zp8Y<}A9odZ#cVWYJ?h$xBu(v!AGy{12GOtz4pvb9_=>Rrgzuz>F`t<)H4#yqhUGke
z)D2gq!^lV=*wIxmwype9i_%z%;KHZyuA|5$@LH$~WWl2{+vWTT*%3v9UhjflaMcDv
z+Zd1s04qXZqmnm$v;)JeHz1W-uTC11u9@iAUn?_W9AWZ%4!335MNN!P&T!k#<_1ui
zOs5wBTJgO5xun+P>Wp}e{+Jtb{RCfskrYHk71=0NfI_VYmOMn7cA%+LvaJ_E=1d=>
z><`Q)Q=wKXi=^@ci=ZWG(^c$dt{8;x-7>t!Ou&5fB++-;SIBgaMP4Ny4p@vjf9MDa
zs6X4Z8|Q!wXs`^ZOaUeI)1{$=8yYwJrVra*I&$tKzm%s!Q%I}Eu#ugW^4Te<PP~_r
z8L^o>`VC@b=J{}YtOUzNT!Q@irOB3*j$8#)c!h}uiAq%`I3_;yLgb^jXHtv46jZ{5
zy8z-h!hUbUn0Mw9iQseO+AqNa3N4~``-#F4<6r9-w)Bpq1A%9dHAz<b<jYv|`3ej-
zTlG!Wz}k^*Uo*PF#^dRgrz*`v?p^}MPK$#*0*JOks0^tm1+?^$PeV4cHWjdX`7aBb
zu5PQl6jxT(Gpd`WTPdC4f-KV{kvW6S)R+}LFPN5uXT*T_<gFG=TJeiq(k+f~0K9?M
zV@nCuXRoz?{2(thu$sOS_&Yw^3LH$+mjCe3!H_a`Y|D&hu79$;8#-D`z?DIzyU+d!
ziiuN<7af`242x%b8B>*1D{S^yuK$DMeZQS_FngIBU5_BDHmK2<OyW8<!=)R<x}I@u
z9avHFWnHZ)VzOe5tXN#4kJ1M(&MKPn%p>Nq(Cyf7HrnB2MynAnT6L773rIO6m$L<T
z*yMr`IW4&!QKxeY@Zg4Gcw$CKG%+iU0W&tv!xoF7Sov$`qP-m%Dsbgm*6l;b^V)IJ
z-Q_qz#_mBZF0eQt>zvNnCTwbzJi{8=YH<VHg9inWrJCQi;QCg>yxOZujbGX65sE$h
zxdyJp!tWG3;1xt5OOcwiRAg#K{&);9@~f*$)3p@KUYdOW&jpw<`TU{ls0;3#!i_E9
z5P7YP(LO^KNh0T(%^i<*c?s-fNWR@29H{L0%+g(&Cwa!i`wvtncHnSWaTm$_asol-
zL3B%2HOav=<(Akc6}WMHe8k~!lpEj6@k#_k0J5e}Br(lz$2Wm1(jlqm<Q(mIP@DyC
zFqjC08zl?;7k~~^_UsV?kJogXiS~$i4-K~nwQ=6thB2-5^_M?wfFxs7AzJdqO_aJI
z7md_*f7XIbU9(aZ9MTJj0<SX}ZLdOYvcAS1^`?NU`BFuN<_q)Il2+LcL{*iT@}WEV
zPD&{g@tU$WE<->+MS)x%O}g8u$}{Ac3W?}v7|V7|u`$zKcFL43Bhx91oZfv*4zeYT
z5kh1Hj$VLHG0rlLvg{+cX=J8cB{3iw>b<>E&9ITR5w>aV(!`K8;BAP;==8;*ZAt+J
zgWMA#K1&d$?T>wsK;uj_EiXKBzO5=#N`bm=vh*K{fH5trRjTITlhtD`u=&KcEE!|;
zhcAW|6`7X3>-9F06sP(-op|Y5TGQIKPKpu}duv;FWqyKIIXqqCt4EidjDZHnul8^x
z(SC|TymhDxO<PJ}r`)6&kW+Ykz<a3c0UMZIXe!)P_hm0!STFn#P|eBw0^hdG3F=Sh
z*9uTB0#g^?=vgnMN&@5q62PD`)tasHe=g%7a?M+@Y9bUuRl=3$C!45QWZ;-TML32k
zs`5kmR|dKj!qS^@;v4D71pAw&M}#nJ+^dyGoM24RxLU~NRs29vBv*(xI-U#@okR6{
z`50zhw+@We!?7hW)pkegy00;2z9Bc`ihZD4VgKWjclF?;;<`6^Zc!v&5?0dJ^{X)6
z@TLI8Sn*K){i+AEzO$&$`-K30Le&}_UJ|ie2?o5g_wu!`b4rcmq<zAwZb!DCmVMz|
zi4{W{l~x6@)FKE^Tz)_+DjDpoJ21WdV4@~gV_m@iDsZPm9N`f4P+D9UCg+sBYHtK$
zm?<(Bb4|x9V^H@sjQBRG8x3Xx$<we=^U_5eql@O^C^3Sb+mG7x3L|swT<Z6@q<LB%
z=G;&9ql1mY0qYQo$;m$r7MKI+2uH=1^|4Pdz{PhBw6#6Yns>vXc@&QcM^H)qkZPbs
zuFgT}2U(-F4@HuIBkAmC1l=MtQId!ZfU6|yrc@15X5~!J6yE|FnX|R(FL}$HLZDIc
zH}TiL53#AE7haZsZjFXE#l?s%h{alC;vGz-Z04iXRdMQwNbj~!(lB(9+>eUyr^sgH
zTzsQ06`vdmjAl&9cyta<C)1BG`WH_AKiz!=Q(R5gEd;j&x8M-mU4vVYAi+a$cPF^J
zli<M}f?JSa!7WH|cZcB4?RlQJ-g~QV)%OFwE~uIs=A1dS?B2cCUTeQ)fcbt$ql1h5
zp#9LFQyg@JH8mxJ%gv9YXIJ{dJEVuNFcjD=k?h2e#fjK|gF<;biBLissho@}?vsSp
z!~!f1V2=p&6vmKkv&$&d{8O+4>9Z*eYg^(BIWHy*a1hN!SV$D0(vVBp8+4{K$)ze&
zgIoeXK@ZjhRK}|EojRd%?(vZ*NwL%84C2lX?5J#@BON!6{CtT8J9Paiw{i1(rbD&l
zwV1?}e_&nz@uIQj60(R*qlv}`v&+pO=Q;re);bzN6QS{RGwP&JjGiP$ncRyfof0i|
zsTDL>7lWRo;8N>h9oEOVI_RU>Y8!SD8z;<u0g33ZHw;0#Ui%|OIpiPqg$2H6*3}rt
zkr2XukgVzs3PHTIPku|Lf^4oVPGB48Fkl?AlplMM&nLi-D9~i4R-VdQ8M#_G2xHIC
zujxq!GYFeFmUZYcmr30A$r)jjRB~P+ylF(}NIx=?%Bw>#JebW*O_7^yM|3|E<$>ha
zRljiuc7fzFEIm=2U~;p4MdW6Co`^&tsY8d8GAvaQNCZU!k(y@d85{B0!%b!n18Gq|
zvM4f{K3F!q2rjD&3s%kIt?U-_P<V#i!B3SJ%*aaW()5LeYP_(PO*n;I-_`Zu6E$Cs
zV1C83b4_S^&5GqjIh^ll^l0pA%GYNTm-eb*{?h9ER+jHEPSe?~5>bBI5Jj%WyJNOG
zZ_YO|lqXSJs=PhsKDEe`lhniMuG@OjxzNPT&8a1iy$s2}REKBisXr*E4!&~=7gB2p
zo<VUXlz)Vc2`K5Az8%7+3K?%;#82fJxcnV0G|8SCxm!UM@jF#0e8d^?ysQqEij_{m
z$GXQ*G9uaqTfSGmRAU^LOJtCV<){EA8!jzCrM&Uhq-FsdJxr6-N$HI#*2LYZCVL~-
z>9q2+XOrh=6h9lN5zgWGVvKK4l@U<Yo&hLipWcsB%gFDk#Va2LpPFj&UmKRge>na+
zdz&dXgdptL2*q@Y#7*p^A#8+4(y4pj@ksOH_LTm9crzCJwo(Eg7uf?E0s#ASnQXld
z^6;n4lh~KQOt&5+cX9x;4YdzZ1y4#mP!SFp$s9WeNhuX~f+PhgY>)&!k)kb@k&CmF
zZubWkKhpFkCNR@Ym0a-@NKC`z@!rkx-;A@d*3Nw%+as}oQF!ydX%V%$x{Y7>HH-B;
zR;KE5H7D{io+OMV=JMm4C|hB4Z)==thbN>$IbMtYL!&#-X-mtUuVf8Qggtn2&6{5W
zd@VKJmF3q=jWw2*d3A2)4pTCw#Pp-<5#voe=A%+B{Uz729}Cc``Lb!YJEDv2wsx4s
zj!(tnVL<jFk2^7;z7Ug*%bG(`sx!rr{snf^8MolKaCR%JJ2Qh}FYBoEX>4=SFS=Jf
zieG<I3kkpPYW~>uVD`uoUC+5(BQ{Fz9IJyxGN5|@0f}pnrS;wBW|DVTCaI%#)>0&^
zs~&H3PlF@08BK%Sdp)1x@yd5QdkQ|ZnKyY);`WE`Y92KnT{P%TXZ3^C-XNEku$+<O
z@(pc@R8_QEK6UPb&4z2ds3oCG2!pigr-yL;@tdq2v7z`(Mj<_ZN}_lJ(YDrl<)G92
z;y*dz6@uimq;uqSP_C}Ld}gnf)-6lShEqHo2s|e>-;Ll{sk<!m__+`}G^pP5cI4C;
z(6A%Lm%5G(lkg`b9AfkjoL=@{e=`}m$aSZe>LGknL8mlVWL-n1YTuX{?fbYM9g;Sq
z``1<ZUbH_>Ue?`n3H#fHv663DX+Rt|^MGBkei6uJgCj5JlH*CQ5Jq$R9gTeW!oQ3r
zU$gFe219h7l=qwI;07j_7>)pzfkumI`7|OZR5;NHQ3Day*N6lrd%M4p1sL|BHtyFI
z^0+f~6(*+#()b<?E%|x1P>Qv(Cr5?teUB3VYX7d-ryxnA^};<v3$f#HucoT3LXG?U
zOm&8RHYyp1b(F`tewzyOw+RM=(KdWt>*V7s3r%Jk2JXzCU#VJJ=Gy6Y@qul@ARvgC
z&IVO6KwfFKuQTRAlPR4qCSFZz&VoetC3kl^(W(~BNeiaLSk!Rkm=A5WA;Iklw~B=G
zXV84o{=8xhzw|M-zq_Q;N~ON=k?3%;5qcQiwpfc{J<XdI612mB2_p31*aT04&XrxE
zH0Kx7xvQ?kV$@WwAu<hTEckFZD3J*~Z(i@bpRMovZu`>Is6V3Wz^4B!+#Y+$vB*FS
zcH^2}w%UH}N>t0aMgNYhFZk+Z=wxn-Ob*O#eU7pfeQj{|Y6wf}ig_1XmW__MRVpPP
z19ZWnac8^%bDHSacppDK<X%)Bi^z1xf_kTI*`}Z-Xf`3o<TzFALHj%-F#%I^@%zug
zdrpa#1GSnzht@R%bdTo6RZXX`5O>4Zh%GHmj0(|>KQFmpuFft^wpO?bD#S_fTZFq@
zqLs-Sq*L-87@J_7)SRnVF?Hmro`8A#;UjB3`Xo)U!a<J=qhexE6XN0XJnppnOp7Sd
z&hD}ICB`Y~udy<bAy<CyBQC5)-_2(iDdhlP^}~vmGZlLc6iK&LU!S-!wf8)eho&aR
zq)qMk=!q69THLp{u>IWE#(9?foZbP1ycow$d8>u*wLhUQ>UgmeeIV+pI3f)`8NzSA
z3Qk<g;NK0irG{Uy)9kI$@Y?eFIc~)?TcV6@AR1K6!Pr+=4wHx4@pGiof;)G+ERV>U
zhKR%-Q}Jq}ZJtv2tJqyw7go`<xlh%YV&iF99Tl2&2<at}Xd`whmcIY^h$3Yp$9`~$
z;&6a{EQ@=?dVI(PI=ivky5zn@CGOgzjF12_4$03CS~c1+GW#bp(r73YHPHvyB|<eO
zmsp(TJva_qvV|LGR4dVuC7Fpv<2&@bIM|Y!aTEz5Ux<u5Z)=&2?pYH~C)6W38e2ya
zy#-9SB_*8AW!OL+qceo^b0n`sQqJat`&Lz-XhUiZhL=|Q?D{*5guVNVHdSw;a1)NP
z*)-(M#D}Fhc`QBo9rUCp%g%`vj4%rf*;GvZY2}eONK2IN2HqiVOCS1BU_8?Yd2H``
z<6OW;P%svYzb?V}j`poZbJDyw`CGcgH=-y-m_lr<{UiSr=}shK?LpKK)VT!#6C*?r
zGv5|74N2EBuW7uSrQ4F3{Zne(u#a^m($r_3g(e%5>dZbSoVSwy<ZQ?|aUr%PFwT-t
z^<FGltso0_YtT$cS8}Q&SKlaZ#ewep`>ms6N-QnM;!q?qQBi@O{gfM0w*>q`z)|2{
z)vhbBD>iYzwHIBd24b3*Z22i{%xnTl>~jRF3`H96yJ$hp=NC-H>E=AIy37=Opp}(F
zjNfTdQF@En$_##9-SjaW^_4i7Gb5|~RoEJ1<7xxNr>T8zOZ)chL<IRP%;!k0g2|ow
z)f@s_-_>^~bP<xc-^b8R+dC-oel?y_@Gzq#txU7Gz~h^Nq{7v=v3!}3SjDeCSKN>t
zB_eH_E*GLh)+x>rU+HL8P5(lPg{<SuC%1T3{$u$mzNy7#-^%go>ix<zf>?zR?@f_H
zn60gYNBpmqQ^TJc=rpnhFV>lQ>j-N+JAz%O<-P<Q0nSD%HqqB0&H$aeRo~yQ4-)4L
zs!WEGSiJY-D&2b+Oovmdua`YZorc+-Z(^TQYy-dcfYfFYzK?E8F6^`aBS}Lsm>RB!
zQ=65!t~!|-`Wzv54%>CKRhN^WjNq#`;VKo9H@VI0o~aHp69(FE)l>d$E>j<}km%DE
z@OJ5iyVG@FB)lC_lN+NjNs*MEOJ;MQXS7U3>P`(M3!wCIqgY^dwWj<&B*2TS$Y!k-
zSFD@!%gOahpLnUV(zLvMI&5FXR%1q9jUzSm@PO1fDbr19(f9eW4^-Yw<FbNex4X4&
z5JLoTqIs6xN4RFZAT{laeD8qshu0AM)ACR0?fFjob=ygF#R<rtJHEL)sPtXAU*_TD
ztOI4*NnECs4?s5T567*ut)a@Mb&&tBe%Su}wD40s(GM8>1=OWFh4AW;C8TF$WK?W8
zXqn0|O_i60S26>G##lw><rt@moN1V0DNFj9-?l}T!{{5I*(#!a+7yWuu#>FeT%`S&
z^fpOTt?st4rf#S9`gSF&wA2}YoBF#Imo<7-E%^uX#O=`#*gC1gNIsGmQS9F)GUGVL
zE(l2pr~iKQb%b6cuXuQ^Z|9vt{b+#zMM!99EGQ)$O6qgddOmue-hP`dl?S~Fa%cr^
zHxnTY3tym`ct7yoCxHO5%Di6t)!Um@3~3@r!Q$!Q&mhk;M)>JQz3dWF%@+t3#wpr3
zJ6}wxzHfUt8;TV?>;F@xaeaAN&tj&wje&b;-e3O;%Yq~5t(^8|3JM(D9YgA~Z|&Bq
z5*|fEhL)r`K3kdz;zoq#Bq(t4)|2)Oqm;hT`$Rch8#BtP>nvOD+#;pXzN~I0kVaOt
z{Nen|nj`sQw(Z3t-RC@ejbXj}Y$sw0ym<6>F|vxJqwO0#V=QzeDVM)P%<{V}nTj_c
zC9>IcBu!P3Z_Doa%8m==#VjB-{JdW}fru)$LI^!S@AkRJfh6Ixlezh>AIwX0tnC04
z=Gi8P4ZtZWh%UY})YF47AzT+7`h?E<DK&Im)OG^YEnA)(L5PJ_vCf8szmfO{{KvZf
zzw!s!Hc>D74-8fGi%~G14$p>u2G^nd<lXtBE&fSAkn<V#!0|TaFvDb4;m>(62P36c
z)np(_YB$%i&2F4!s6Q=rbXtrg5d*z~m@-ANchWIPP0kkvwZL>lgpwVU)EBbQZTrSq
zWPS<yX1(lTq?K#St0nUTGY;zJ&`kKXuEx7>4!s0W^R-ietOH#~)Aib}6{7=W-li<y
zZPExMkr66nG(aFOVstuxesV+yJP|SfZSBF}C%pOV&C4kEzqrc6Qo9?fN>TG^)y4wU
z2P}mBN#>%7tkBn1432YeU!)=ztnpKHU)vN5zvIW8;Z{n3>S2-EB$oB$^;yri&&(?4
zsc1WH#?IB>6PGDrn+fiZJ67xr2Dam*0?3=0EBC%WjuQuoH-I?R5Du0Xy)#AE%Jb88
z3m~G9cpk<tPviw2On-l^ky?Zd7(2upi#ea_3>ho`5IKh|ny{KS{r->yzdK)wziqA>
zH+fpX?vOMD`>9-sj8<X-bq;v1DH2_ZinoIJGEJ)c^rE2~mB+lRgX459n~#o;`hjx<
zOsIdoVCKvA5K{0^G4sC(o_+Y*EBFnY)59*;bL)K~LbZ7AxH;;pS7yW#($dn<w0|ld
zXCmy6=Ig;4_!R($vOW6kK7^;0{ESx@aAF>A&uho=7&W0*ONui0H5EyY7Bbtd2_kCc
zJJkazeX!w+!U!kZEwo)6Sxw)5CVSR6`Hcy`^*6YB?b2|9d<nj5_^TX8@?3f*G+W=&
zqT}9=*49!Ks!$Zls|}pgCd!C|p3jQ8FGb_tk`5BVNljf8GJ5!|2{q8+8^-%E_u^3}
zQ{yi$aWb{*S^6zyc~LlsCe{VS(#^G(L{kpD^w((HR|C3UEHmX=iKWde58FIYxGbL*
zshib<`bd2R{eWqUjfr^z+48p#fvv=>hfSchbp^;kP^{-29U|O!tE*&wKsPTbv5((<
z(i#D{4OLu-76aPHyxeQ4thtvwzD|y;W`c<bE~sf6?TSpPdZ}`uqw}``^eO0cqG4Gd
zZAU6PnF^T;w+ibnmc1QboaI-%CQGoKRLx!`RgJi@r51Pe#b@i2iFDOfIUACh7^73O
z*dOje&JAKr@x)s@6RYcPi~&XB1)wrq=PlxC7s11Ua^at$P5?LPU_B-#<}DEJ<R30o
zE6en`+lzk91L5N#khrhD_r04O^V;S}{CIT~P5hvSClAMtX5!9+-)u4S(<Ct_N-Yy>
zojaq;o&CNdth+*BI!ACLh<hts(rWf(1n;3$JUXh}6C0?8GLz`szYG|5HO$^+^m)V%
z{f<O-G^>tx*RD)m9sXyu+--)pHBu2*IVe_d8L7pTdSsrM*o`Q|agYvy$iCxpM(;WE
zx^)L+$s28}m$@w1G!lF4=ET0e+XaM$yJNTZ7G`D+kR*Q#$&`Nuqy+<C^2^ZuvF1)@
z(zyb|;hN=r1=RU|I!!9@*o-yHb4OUz>1W6+EHIL9jdlB{%&Mf7c35AWeu${PV~4lV
zpK#vUaK;VeGKne<e6dmV6q+}kc`4aF;=^*Efli1A*mYMPVG{n^hdIiydY@jdz)=d%
z6XHqZiv=p8-Fx;r@9lhqkChG@*-4zDs0qC5CVoe}=yC8J<h`pn{}q1P5O!VhzJ7Xo
zDg#`|wi9p2uJ})_`dvvDLK2eYI*Y`YPT-$utbV+@zRm))x4p}`TC*%5lnmzFgA1U%
z0iKjyI{z1tZ|#boZ^VT(->kL$3opHQ<;mtX@4Is5#EXawX^hQpLKW{ze^M=laCQa%
zc3l?V*>4oR;*!L(`ef2^w<daO+I64QqN1Co=5Zv7Vdde9{dZ2G=9SwE+hh-OYz4cP
zm)egL@RQhphBeJCA6{L}=6yP-@$(GWp}Tdwc6X4jU#Zh*`}}xKN<!juSlzb_xSMT%
zqp?1U9HZH}!}tN#2!cr7_-u`d9QW++-{^iZwR`?GY<8U&A{sGy@me*<K5ivb6b)eo
z@sv*5(~AY-W>Q<uD3)#+cv{r(!uKp@*ecRNCTrYZ&*}-<$t&&=ZJJRpaq=!WSH?tQ
z;2xK(U#9jf(7Es0vq+IT5zR6czO31(`jH>Nz#pP>zF4?n{rC1ycM(qv?>eI5X+m=A
zFSryAvr*xPZsBs>7FT!ooBguNC$J9#o>^-ob91pmni?qLbv6K~XbxA$Q3M=N<$CQT
z9sg2xT>K6<qb<UKOM=zm9`eYJ52!?h`y#SF7zD0Z*X)dQN!H>EA8ne#XXT9)=p!cI
zpv3U>{p~S<9iwJe*%wWdop5+}g!(wUt9|}KA|e2Vqe1t5PsW+vM`ma^g>d8R>|&Ir
zNx#(hZ*Mop$H&_N*VJz8{ksxi^bb(<ZUQn*FxG%FE$k@}2qx;t1bqwK%X+Js!cMSM
zp`qsJLMG8ctgSb67L}`__XiU~&-Hwx?B??{wS<MLz;Xz)B^lORW8_*{Uw#kEkIppl
zQWqTa&6>vrE&LMLGiWM=)`>nXWEJNWDx99;u6l$+!Lr!ol1^DsUPx?xk#-bjwJW!$
zd8Ci#fP`!Jc}NE$$;jT!B`8?Vl=>1vZw*0v{qycmr4+f&_i3Oi`38#gVHE+I2zb0u
zKc6lui{>6rLxo{auNvFE7yjsDLO>)G`KT+)iCOLu`NMbfy3-Dlm@BExi;m$gc#Tep
zS<O%mGwJGocuov3deLH@q7%ntHuay(rQTBCRVub`#Whxk5SbMi+@atVmel$me|adX
zcG&2JSS$|HVc<wIsF0=#-zEx=!@m!OybB03C&0%90*#nFc&88wG$4Dp19RfN3PZ}f
zUz`V(;XEOGz5{V)&)Xl5>{?_A)zox7_6i_|-wiBUqgbH^qd9kDeb1*F6W|8?CRyTq
zX%U;2r?Vh6Z+yOV7s80gWcsri*|@fx0QZ3COP@GeXBX#EQm*P}>L6zkW+oAl@^Jc>
zv2@^=@kWUe%}RhY%07`v>Y?B`A0ixn@eAv{*A|1`oL&24Gm<di8v?oUoqIsFqbtfd
zgM0vDFm#sBk^mLzzO<~uW2R-<1*nbh>qp`;-TjUA6?8jZOjP8zXk2pj+!0v$44f_q
zmzpNa>um9dQzdZLn)j|I(I8P-(Z_6k!H}Z(G}y+5ZvzdbE~?ipa#kOgsR<$?LfKme
z>qgv7LY*m)GQy@DT)6@7qdr<=Y(^K?u#CvtaR%$0#xnX(z+DYv(>dEZ*gcqAPrC}_
zl1<GdrVIc*3-AVa;P5_H>30SI{|flElwgBQha3d<Qt_E*(?OrAm8pAQ)n<ABjnwlR
zVrqmOg<xP{APgHI5#K5PO2`@0l7lXrxsjfEHr(O3eaRdAsyeA&uQFjYGns9LMS<av
zJZ_G9ZF{DltQEsD-@fU@sq-a~mm6a#N!IX{SW7Hs;+dxsx|*XLvS-=53RVnpHSVOy
zQ6>2g@u(&Acv4bsNGd4-EfiuDZza8WP?6erVCI$r!w+rIe!<>IT(GU?rkw8S5s&}W
za>Q7(OZ|=$E|hpPf-B0M`&Yf1TV=rwy^q=Ce8!7|Ti}sh3-;8vXIpVSFA}}vK-;N-
zNozET?4`M#NB47{Pr|lpl?|Kw#nA#sOHNiBcbg_~@8uCug*}H!Y8&+jxO){}Zd8e$
z$vI6I=sE4j@GTI<U^yVWN*Pf*yh!2OU`qXAo;UL)-dfOshc|vq>Fo}y0JoReIEQRa
zc|E?XSIA|-*vc1DDaS~<bMqy-A1C>d>~$@+DrIdrE>BL)_6Ne{0k+DG=vP+~0HIdQ
z-esK`-U_GB@5mmArI7Ze`PdOtEZhEC5v`kb2X8HnR$wSo!VRvjEPY1FVrDOjbUbmF
z`qlLQ2iR@%v*siG__7a%yUx$nCOAaWH3}+3DQMJ<BZ>68@Pe0=&Z>F=0TxjW;+lL$
zYMe2_4|KgwZeoZDs9SWFQHDnbX+5p5gGIGyeMG!0I#967aSPj`t}+D`+Fa~xH5xHR
z?HlUWU-#@;8ydgL3>~61fYfjZjKH5W8W$9YQu_pdl#FTBO;NA)Vu|yH(bqB0BVD8j
z2|3mEcZ^FziLUxSwFd1ExjhT}NXyTKfuE~XKll2Nnhr(1i;~agDwz(M4e<_lAhVNT
zo=sH-H2i;(G5F00@aI`QXxXXXkbm<Yo0B|Hg?ng<@0VOWiZT~uj~T)kxWOoGrVql%
zi*&VDL`9Bp<}IvpKwP_H8#hnyKAvnug5z^tA90oH{7ZoH_&e)8@ifuCCDn@J{RNC_
z>9chM?jDbg@NmEptSwhzGa~qZsG;`IF-WC5=V@My_->d_QB=k;+Xag<Mh8zVEPtl)
zqY>Vt=2#XjNIMl>7m0D8#7W9eKrMp9Siq@y`lK{}m+Lmzbsl+gF0(DGG8*$1@9=}U
zf)E<cq`By8SaBL+9p&s%KXpn{J|XHd*=AVj=jO>Ys(@ZWb^DKr+RWY7Y4P6f0i|M<
ziG;5@x6kDCWC^?7*m;{02nL-_$czZM6KTo%juKu(B^Cx4Z#vG_+mX3XC9<h#hBfd&
zY&VHbNNetRXV8S;$ZT9jj*uteE8K=Tl+ca*b;s>=m3SX?$&)=STZF9eOtO^ZCBB>K
zT*Zqy4!Sf)4A^R<29$1P%xvx!Mg!+I-;lB5UR;ubtlQ&$^z$2~_s#_Cq;~6Y0_*^5
zoa#s^tzr6#823Z&sEItH=ge?QTh4o%Spv<}*gCK24`-Qtf*l+da}*x;!LQ&9gNWnw
z5m{S(j$hmFRrlzli$4j>XUggX{{nQ8wy?i~0+_+h32Zv`qrxpzf~v2Ap`c#P%SwoT
z5a$l;@@k7J;Tgr1cazBDEGDSi^MUG%n(E07Ox^me%PY6E^nK_{U6;NXEe?HB0!P*Q
zo3waK+dt|?jv@mq<<+VCqw8OC88C<&Hst!yiM|#INm$V7FUlV_WGQqcXW)G+QOLGo
z|NGfIg4Jy!wm_d<nR}ZlrJ`8PbKD|22{}J=#=vJWQu5s7DP+URw%5<R%)~A;@6b3^
z>mgxU9#yoL?uJ4$nm6+jp|N6ac%DQy(_P|fL0_r9<%RSfoC-g~4_YQk$4t|2o>Z5(
zA-tO3u1MQ4chdAk{YAlYHx9k4>tsW#Xrr(RuYXPLPCzXi|JV_CQ$`TU1f!LP{VVkg
zlV#t28rS%7HEj-)a#!JPvvV)E$}6hpHv<SI`1`ij>|>w!{FC0aQ(fKMP`*^??IIwW
z6?Q2d_ku<eZy9s=D7g<WiE>2<hAgN*y+&odWUXseQwouaOh9WRB$sgq@O-ejp98dD
zj6d3)#Sto>W@UGq`?1=&9E>K+5G-NY*++JFw>FeyAx|W6^|!VA#rK8Bt;u{E4mwJ~
zpI4Lis?>c#MppU4*7d?)21ROv2bFrzDqy}-OsHW;>f!K|EV0c9?+5NoXPgrj0ira*
z5gCO@SRuK}&YmB$gN9;=!U)c6a(nG+3YB4b3mrdAP{r9UI@J&2OOyUfkql~-9s+1X
zH^f^|nL;(4;?2HtvD>@1y-kViwic~6fq2$%Qbm~|g+F28CQ%Jg(3#LFf3P;aK>|da
z5uv+W8oq!W=|0~OI0f8ZBT-C7{jNV>7AyTIo$$DIkAm}lXgQJ_i(BolZ!d*T(V}pW
zXfBhuNg(uH#fw?zC0W`!goeDGSSxXl#&H$_A~`sWw3A3|SS^vtH8noLO|Bn7#yd(O
z%Y?y?UH*Ag+&hEzDlHV$e0~vD<6Q(4as{nni_cI>PrMG{s~tjOX1_$!;yc1hlIAm9
znlr>U=heC{c><AM)z3wzdv1((W{C13p)VQ|FuaW0#C?YQOh6cU-b&Y$tzQOm@}OiM
zO;D{5upJG^I5mk(UehVK7>vE$;X>~A8sE*P<Zv3!>`s|8wPfDX888l#VKijgWtH}+
zpVACv4s@B!*hyt+Bbc^fK;F_n%yxO>Y}E`aA-NYy5fOT7mySTFCE<-pq@LK~{RT@4
zBegBikdVn7Wkh&0tY4F}jbJKvIcQorNZdOPUd4{^J1HYJU1vkY1TFkR(mc~E0%{DN
z!W1?r_>F*N{(bq<ON8;H)~WCTT3pV(N8_1GZUsBrpkd;@Ys0JL%J*bhA7+Zb4yep*
zyEE^@{@G@Z$|6Uhs6JDCi-K#-W6yQzQI2llFEZbH04@6CfunYdN+>RAqpJApSve(F
zc7MEe>0xDxyU)4SmF(?r?kE(p&zzH*)V~;Ca3p?G<*KD`yk3`0k;qU<lame#KJ<Cr
z%0F7B&?%g2+reG(>(Ju3_9*q2GfC;Rbqrq%bU=lo5Q+yEzr{z*`%7$j<kFHAZ^QkP
zCjGST!H(a@J<A>a7LmyWA21y@OrsOp?{IsXyHYuck$_Hh81747=68iMT_W_u4c71H
zB)?b*IXT8z&cSw_nN=#qDG4y6W|?*1Uh-|P8&AqN(+x}xVCfjX`}!v0U9#rDk^hN=
zJ$g<rx-eTBa*IA2?JXyY2P|YO6&ni(CD`XU(wx2s{&<f$5E6G4AYuF^Xu>$%dRi=g
z{Cf!yxM^xr_`zBl^CtsQeZAtG8wn?sQt`QxR{TRwz7N}NbYm*1-c8lmgd&}3dCQ)~
z*)di$enN&9g9Mr5y2`KbW}TaBE|I7x+xRW^2Cs5cq)_(B2w_#`%Yu%)UO+i^u;AY~
z^~&-g7Jcr9V?U?n<*+PXW7M1AEPXvtyylu0c<lIFK0!uKO8$J}BdtwN7q#`a4>}gs
z(0ajl_CIW9A8L8iyp~0k7kcDnesUQ5QYp};QwBr#Cr`87<aSH6?oy~E!C5KByLa~%
zY&=|Ez4teUD*e$v&=WAw%ZY!=1ibf`xzSaD!LW_*TZ%Y^DXT`ee<h(vPK4xBC^{C!
z2q)@fVo0(rwMuD4)D<|x!Y72kUWbWK|9(Q-y20T{v~RV8)@zeTBc)7d1;-vPlN4~o
z;EW(E=-*MwVpZH7v~85-qGOR_AnL7)-5XMUA}n`q)8JWZbWR0Td!oOE$bP28l=30!
z-yIuTiNl*>X0@NKcDK3Ch)))asHz2rCj=2&*)lFMX{^p=tBNmrf7PcUqkiCy)qugq
z$-tptr1wW*4WDj*r*LW_S-41hh`>4pMfG=^IwPs_S4n(0VuIUUr?~>IrFDvg5t{yz
zoQ9&M&-ImrKipW}4$gak6t@%)dgheOe$-;#octX@{J&JX3<@WA3im7#b&6l2+Gyd6
zFG?9|9A1cc9c=iXHY=q`ZLvuXjmYTY?n@O|k<$vWH+qOyR2ZRGHGHlMVE>Yv!7Pi_
z&@W0Z*li|ZaBM?mk|J~dO=7@NHXR>Z4^u$1@Kg3WZ>n<&e*dr)V&$gXw{QZXMcSl?
z%vMt8QF-m(DBw^91(oG_-)T2*7vHMF(c{zC@x5J-VRyQwoNs$Y@Nddn)}wN25<`l`
ztG>`E?}U^v(bls)E}vV~mUkJ|UD{SQgQCmwX<GMF+9C(r!u>E9Ja#88MAo+UQ$B7z
zv0UWCi89keqwkng6Z4%0d(IB1scs_~);y}XdWIDr#<crXUzhNdpa?iwQ#0*C0}TS!
z*_>3CuGd%dMI%e%*Rz#R+wn{J?PsY7tES@^P>a<DUyIbrY)|IhSunCw7Oma7gwl`4
z!#C5k#-_QWHk9}F3CVvqnO04&l*PMkSZ;9<_fDTu2`NW?S@=~w`Sa=BVAwI|f<dt_
zAv@mO>p@luBxYF8zH$n<MjCg*C=5lQV1n$*`!EKFAf@q1;5qwa$MYZWv}^01Iu*?D
z1{$q)H;QK)#XdFuc>{m)8nHz5g<@o=qn4K9t4yumXz7?}I9<)L;S4dv_Ya=qQgx^H
zYkex`=zz~pK}8NJ7{-P%$T_giCnDm2I>JDu|2XTEeHiB>Dk@sJwl-}CE#Zhpo+YHd
zv^|{Zk2d)YIld9MJ%`h;Dl(#-z|&Zr5_$96v7VTnwQ65-_L44?XMOZ1RswUPCI?T`
z84rC$k7_{W1FiFm0YAC{TQn{<X!69`s_oO}z$t;Wl5S2-twQ-?7Fy7DEkJ+&=LPU$
z|GCn?tb`{T_uscu_~iqM_lv+L{7+Mb#9|;#C>rb}kn12H;L-&y$iH7Sh;IP7iD>6k
z?!ONr`abW!FQWeYsi3=m9wk!>p!V62rf&&xa3QS-az21G)lkb)6iCuKX!`WZy@)8t
zpf$i`dSA^+M&cedA5@G1QqD9&qB{_?c+a=>r6&?^EQ8N!x%IPLGP4jk!s`J69~<TU
zqo9AET0mG4$VfoW<p4&~0mtNN1g9n-fR@at<v8#rIVw6D$e$^LYrR3VFPTN}DMF)l
z9Y~KYNtt9hqn~qX{;m7xVJ1#bo}W%YJvALj2^8?tu3oDC>`XAcmTH#y8Ptv9=j3z-
z*ptt$I4K1M6j0D9%JkR=#n+x{lH05=_x}LFuOlqw7CViXrJ2K;hLQjD^=xYO=ksk)
zgv01v2}FMjt<8l%e*ORAIxbyEH0HRlzh`FL=1hRz(V_zcx>D27{lkV)Vg8@+h?0_0
z6~{)T-orWwoLoV)i&g_)E#K*50;G`A59_@kTiYeT$uK)WOq1t$T@elhW+DAs)B|q#
zw|S<`7DO?0YE4H#$hv`DGe`(%>r56Z08JekyT=*d#~Ha#X9*w*wgdv!M_4(*y4wvl
z9nar>Xo9o>FzTZqWLXW$9#N{PF=^NBg6}3FA`;xq4jctH0)Ik+m8%BQXds4fW@n+7
z4!Xrs=Z}dBB<bLvtAWVS83=e4zs&^k!P(iA%s;0<6Y8(D@Es8DiR{H;gu`G0s(L`B
z39CuqJK)YkE>jFsNayxmL(zjeZD?$>0sRZmO<y3N11S*)!Xr;$fSzvpgx^-^LsTOm
zGxad23DnG*`L1(4-T3noul=S6=uOE;yepXjMO%1Qyv~R8p3br!56zzMDxc@QtG>Mk
zJ2;qqt{)&_WjRbifIC86Oa%kwp5F@AzwwEP9$MP(1)#u<SejooIOUadX+wr0&k(5p
zy%M@ma#j}jA^33G?X*42ciI6nsR^lD0=?*Y(zb*!1i%~XxtcegR_5l2B7JiglMsL5
zpKk;34Tj6hSP-I-z}^##?(7tW`mSDfudl`Uv8ig5#rg5>5^A1zUY-H_pT!Hh0%#z)
zgLgsc8`23Kps+&f2dQ5MzQk}03_*>_(0sksq|PhBQz$<n03`<$to#HU0OVP*)<KCt
z20s?x+o5q6)3;#Yb^VwFq47ybra?5%D25Nd15(G0^P2SOG!$z2>8jB#FwGjl9t;5(
zgV3Cu8~_3!b`Y3lu(7k}ve+)SYO(lSRk*d4m6jd{vYi9*JIX=#^>CW)v8)wyPKe^%
z4}BosmmtRsT?GP#uh7tJiso&J2mdt=->@Jk?mfWSfc~KGT30YwmnPd^88qIW4|9YP
zyUv1{zXgBVjN0(8dJk=G6hIFD0(2bM2QvU~o&Nu7H{EDFL;%NFXc@&4`_~$N!=<F8
zgy`l#lz^6<#)RILfF8Vo0L6WvZjZTdxNU$*IC=+IIS%8Jc)9>JXa`8F_V;N3Ah>MC
zOJ@RvM_>?&{67}(f)~JOkRJJe?cRS4;Q#g)8_x*qu{3+%q~H&sK$DeJl&BEX5BNW_
CbJqv}

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-taylor-hood/plot_u.png b/demo/documented/stokes-taylor-hood/plot_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..4f3c0cfa0f6543f076e0e3c90bc9b45066013606
GIT binary patch
literal 95531
zcmeENWlts1vOO?34DPOj!{F`=?(Xgk?k>aNdT@7lcXx-u-QC?ek9(8%BVO{7PI`A|
zcYml#RjswEc9?>k_;)y5H~;|fT~b0+2><}s006*ZVZguMe5i*_0|3MTNl_sc_l)xm
za|8T^T>kf?iHXND2F*cLV7iH9(%0qsm%#G{TIupTa^GKaLE->~3+xd*`&<eYG*8L^
z1DGI0sD|>y3NuyhCRIA=I?uI*$Bk63D`@H_rlDnYWoO@PwRUr}Xjk)x<B1GmszL+o
zV8fKu@V6$~o}UQ)Kev8h27TQoB8LKF4Y7k$XEl(Szn)oe;e~?@vCYJcg+{)%O<2&u
z;Cy|D69q}q{}X{Fzn0kK>py0!|Nrs-Rf7fDwSyzDIIWzvRkS+Al$!h*R+}@Olm-Kg
z+DuBnnpqG1WP#01@Lh8;NMY<(TY*u9KtTY|jgxkdRgJkl{ImBjX$axh1ZKHkYb>}d
zVzdr7l=F!kv_nZ@QVOFY@lt<pOia>3qO~mF((jUnNE|yy%nJussFP@Ua4RNoXf|bs
zo-G6iRDUy=TqKe<HA`a_7q`3#v}?zlctU~~K5RFAU<7GeQRnTzrW?OiE`jFLj9-7_
zc+EZQvu~(-4*iAUvNR}|SNc85D_pC*#D8$?m`s-``_0x%mqiipV6^w2DrL9ZT?`U^
z)5(LC*Bk>)`1}!sf)zEGplPegXa=wW0uUYDHMg`OEfO$I*mrjog6L)TaYqDzFnKNd
zricg7U^YuG81@Ns`(v1b<_}47Ct_A^({yM`==DM*a3g5yW_|-iNbh&pmds1HrT#oB
z!wUz-oJjp}I{&<FKKz$QZrzL3aAKpXXB`mT_>y7={uNO#39=y1T27lA6n&b}G5*a?
z)pJX|R9}2a@4ywScA-!<j)S!-n11i{uP79Nz_6hQgo;7-T-Ipc-U95kOg((q%>N+=
zv^QOwQ?^JY@_G4sgSdY=R`8xsXeIKV(2nW~`3M12if#+4$vHr)>vLc#&Mqnq7c^;n
zNdD(HT8?+!V-8E*^E#W%qQ8g$5{7xqO0#}<gP7xaq0^XM7jaTwKH3pNHzo43Kf|C{
z4E(EqaEx&0GY}a2V$^iX4+C}PxEID-(pfYF%tq>|El(_20N`KPWN7JjITiQqH>=yx
z@|}>sJzC|d(U2}=AOos{@xcMOzzlwgy8V022zp2247)6SY(8_-#j$++s=QM0o-tE#
zTID(A_-sdS>c*Q^ap^iouxn3Q&DKnglcFrFJXt^$E&ow8haO5EDSPLwytJ*Jhw-;W
zQ~oiT4=@_3SaNCGO>5AbH6VKGlIQczR&ogS^bUhjQ{tO1fI?bM!6I=5|KLJ0+q<Rk
zUi`>kDz>9p@1|8ZWb8Mhc75u#r^3l1?NN3Lt}p%X1;Y_S>m8I&V*}r14df}EW*fqy
zUF3l<0e$nAb!MbRCCj>bC74lohjp!#Pd2q4HQjOXp>I@M3zF!kx4N0c8J$(R?w@p~
zz_z^lOeHwUBr!25d2UJE>{#7+it%LW{QR<)S#AB#Cwh)`a<6v)%>Gyv<|qM`W)hO1
z<7)*4v|s+~&4v6Uzv6~wW-<^-@Fz?LkQ0|CAujxzDJR7+-m__01@v4IPxt(j&A238
zhNljP#@qSw99t(_S0{fzs?RcY)r1ZXE)v0Od(coHEsOe?p{BERGJV&(wY$^UMMkf`
zNY$|I>(g5FA|C~p=Hn{2oE^EA?#rWRo{FMWCeqf+Ld?id7R;{*JTtVz0V}SdV<LK4
zICRaM4^&U!XimOb1r>w1!eZ@TE~~yzcPa65Oaaq%fpLibuY5@vCp=coTYeyVb^Q+v
z>j(EYV*tCISE%ycO7Qt>mkk^lR%fU?6d3W0TMb#szY(X{q~U`yQb;|K&5xr+<!SBj
z#6M}kODrlEr)HmrbE8S2*<srN1{EYZaw^ou2|;84oi)le4rkv%D;5MN(ytoSRluzM
zGUOJRbZ~e6@K)kC0Zg=*)V9!kE$#Bd+bY>;8C0y}{2Tmjp37o%vVl&z(6{;ANiIr>
z)3E7c)huIJU)`sxZvaf;xG039WZt=846juN&3P0WE<|`>0XK3~NeMOx8lc%L-|1{1
z(kD;3TkhmW@G-MCd<Mq5`l_L4WShfLW3&kec#-tb-(nobpHka{R`d_9cv)p+n4EB@
zgGs$gP21GcW1PQVRBf`In^@FC{!CrCEv-GB{DzSVo87jc-q~Ljl`2=)p1s<lu8qf*
zyq7?37S==EOAE_?M`8asa+p9SBdEc853NWJTK1~$8!08@1eJ8Cbdxexa`JLz=10ua
z77>~ZV#)F?>wMJE2t7#5<p)Y`tKfeh?@-G@#n>=%=T)i65kwq+k$lOmMfOLqJej>x
zW=6PcG*+%)+ER2eeqif#2_jPt7{&`){p9{tpyV78MA`cZ@aJVx$0<*v+2U20ow>l4
zEUmP5Gl7o4^CDQq&QeFw%u^64&q5TQGiAl2p+=xl^#2iE`Ml&qqyt*hj#l{72~D(0
zJ61$Uesrj*rnP{wZfxpC%_`NHdOo*!fmfl7%LPyh?Haa$B9=z~2GeR1P3bE+28X3r
z_GxK*N;8WArO@h>&MXECwy=3BsGrl;-n6+U>_Nd<H@`8HcNM#ClryZIq1r%tkWy5i
zs`z_>Y<tqQX-sJx4tX=J{CU>~`>;eK;u?BN?FxLyuKlVrChOy*SvNVql)&=+xidyB
z^Cmy-Gq~->>~C24+1d~_*BI?D^^xW!bxwilcBedh!`?B9zW_KaO#C(vFZVSfJx(5W
z>D(EIpb&FG@SIrFsIY4i%L*cZJD9LS8qE~}@ZA`=C<@5%U3LDWq#$>7p<chW$zlK<
zn|0l~5eoS2`xZ?*tz%qWW4Y@Na1Eh1sx32}i9^xXsc&EB)Q9cSGmMy2|F&Fneh?Yj
zH@&vNSG}pu@vlUZMM1HOz!s1r_ixNF6(-|6-Z8)4LPIYOh)0N|o9c3M)7`#B*_1{C
z^W)TxR`+Ft!0$zO&#{%z`?@z-&$G0=oR)!sfsAag?X0R^Bii**j_aafZqpC+Q968b
za?<X0#a{s^ysvED^xTgVx3aR*VNlo6Suay9uWG++o0uS)FYXV#hCXYWR5fKE&R)`!
zqr{W09Ncns;aAVBf4OSUE_Z5j#~q%(L+I7B>s{BG#i2>b#3Q_^(oxfCuo$epx`=D$
zxX7eJ;u*|v!uX~G326K@c)~o52UEbHECCQ7gB5Anh0Gj>mg};L#&5Wm7A(^Q|Ky^3
z)79v5ew`jO2<h-XadvGJ-#?J9B<LMmYP(WPZAlUmAFuCXTUv)R$P<~+H`2s?qNsLS
z#b^JOQ07`gD7dhx^|i9Hn`|@(?cB~s#JH(HwpmGEI&_3=acfU1X#PT*WdQ%a;ra4p
z2^eZNvbVq9kC(T#vEjR$U`eLeUfkLO9j4nwM@H(nZMZzGJ5A3v`@9?^x3{$cDs<Z)
zLxrA)1wL=O-Y!{EWz@=DZgvOh>FKqbZ83h`lon^T9p^=KmFk}aePL+taT+%@F0CeN
zQq=&Ttj6xno0cXUoHD@7@|gurS*Tvw&qXtBx<cLFaC%idB}Yg=e-w!iLh&pq4V2gj
zAi>K1z1Wp`ktX%XzT?qA@0G%~57r4?1rD(74nYM*3{~t0fs7cix8o-3=R;0^Md|%S
zT+Qwj7)<pb3MZUoG4l&HCN6UaLz*t$=ihD+FkEcdF5DJyUC45~tm@og>$x+^{a4=g
zE&PyyZd8k*z4O;-DeYXc?_3CfWT)jo9o-=Wk#jI7=>4ww_sZ?2*Hxufqt$6@SXdYl
z=y}++{bNC0pYN*UF4~kbD0Uhucf+<>t8!&!<*FOxD>HFFtgfu=^tfUk6BE<i*f^Q_
z_AS*R7LvqCA$3yEsxjdT7r<EIcPcxDT>o&w(@zl1xOtn-v9NQHdt}E!uO!B(S|X!U
zUaxcp+v+(`f?A1*s_Fnm4I!A6vs)To3>ZLGb(lZO0|@ss6D4f$hw`7|B^slRzN-ZO
zRHcGdlpRjT1|J6N>G>%cn)zuJBy#NuX5bxKM#|YpxI+v;KonF$1-w#$`|pLhxjE=V
zPiiaWMID~HCZFxTl>PA9g`)uI(iOAX=Sf+Bh!Y%W7^PYFbEz9F*uycc;6BKddjIVm
zi@lXsE;(}la+!WCuVYB!-RUTq2;>?UsJ<RDC!!r4t6XlE4rNwtxTsie4&gYlq|#yK
zu`xXbo~dOx=Im=e@hjFj$FXv2@cK1TfX+JjJl^WtLvwNskznM}J#ig39B;x9jR8$<
zf|{n379|Z-3u#Xx8okCA7F7KFpJnA$p4Yw5NIqTl^-jHkkd)cpx6nl1_H=JtM#xz%
zi<)-bA59y!jMOjlqpcoyhvijmr)kzztxua?-LKWxx;=rhsjjE8F+86A6cK0#vsKzv
z&ye4t>7>p5A|6)uD!m(zvNDY^UZm+Or=(=bi(!I7XupjXTd9C2Qk205V}MEKlIQl^
zbJ0ET2Ox3*jOP1T#QqRksmOE>yqIR9hz3tf?!||41p^c;g}5Rk1<QZ=P4|je-vbQ7
zd6&iJ(_o4N>4b_!ID=}k9eIP(!i^g-r^zAZ>yov=Oc*$Cb#c7@$`Va4H1QzZB``K@
z?pYyGRw<O_a}~zLb4IJ9Y8DtG5!ih<oo<E@{mY8m;eJAtJcvPX@ZphjI{HQ+4}(HO
zBK!;es}_1NjjMfCR<vG&>ShBuIfunrc1F9h>gD$FG<Ag(=j+wISIR60XXk9^u~NJ&
z?<AI#aIE5F6NUgPObSs#_K2v?QUZTd%~M6h8;>tKW0Yb(ne{-?WQusV6GD{bI7Y4A
z^!sI0-q&$i`sU^)SHZ&D`(5MFX@FQpR`%lT?9QDR|EZL4-s|ZyQ^4<&x;Vpe`*Zh+
z;0tQCaJe?3My<{^73Y=zQMR__Jo$pehu*Eas;p`y=GMvLCU({geumRqQqq-;-x^P`
zb4`u3omF6}katLE(8+lEU?qXk!KScXOk9&HytVSoC&!loj(vuM>qdpMh)7YXzuxt%
zA_0Ib0c>OFs=uC;0xnHnKfrp}<l55@X#Hv%OGlx46csTsVE+V6NY?+L&~$59K|ORz
z%sh)i5w#A|66YkuB>;?|0whQ~l;3c2N8>P$U}U9h0moMbD>!OPFq2cy^T&u@e<$ny
zaX;i#^`o?Elt%BSLD61dG_`mqBA4Eem6a^lNYTHA6n?b--NMwx%SzzO?4^}&-MQNw
z8e2R){S-3|Y_i&VOzR!`Hv4>j+I^VT<=sE7x3#}K*PBW<uD!O|by+8(zuHo0^r37A
zm<Kjbq-E244M|~6)zKNB31?XF@$nJ)z2AJ9mf3o-__G!U>JQW(5>iql3yb6bdP1dq
zp|-a6Yg-70Yx{;+J`)*PerxLs?IMUL@GBw7TzWrMj&<qfDJFApjH1bn->xeRZ@P4M
zMtb@TH~#2Xxm~zlWRqR|eP+X6M7#5FN0`h7tJNvW2@d|WdA+}>@Yx5vvC*6MciuQ?
z-lwO6vIosIpY63sPiwdt*zJM6^~Zn)IoAxsiLD4sU}?Swzga|r#o?<4TgH-U5qNK&
z+)6<Xy_V?ZD2DCVyC_qIdfTh;y}sJ<U)*aWy+2Pk+j?zZHS5}+NP@|70gTa^egOnE
zgnt46+;ed(juvlYXN=F+*jq$ie{HZ%Rirct25qjYR~NO*qfzdiR5JocP%%1hQAyl1
z=fkfHGIA%!B{>~ARMPwPR<tU!%;_}s67b?2B11m^+4?<u@bfRIsp@amJ$<}YF-pdO
zieg5*b3=%HpT}sc-xsQVA0}9)@ugqLph!r_>FI5zv%ZX4l;DW(HZa9Dd{IT_jn=Kn
zK}d4@MP>DKjO@fcl*wkT#`)jvH%ybI|MV{c8N1ROE6cN%sEJDa0_JEs9z+DR5|_4Z
z$~M)@Wf%VH=BXX9i9(s6bO4_{MOGXj0|>hX3&S>Yx3b&KXda^#k8%il#G}sKE^7-5
z(2_$YCbyN`Q=O%?zC-XONJ*dq>`{XxX&`gvgw_14C`pJq7|Lc)Nr~~Ze3{Ro{3Vef
zf3im_U;~)zD?Wqb`Aa(axS}HD1jpIA%7c>0#~iRvisAT<;$i(qNlvq4W#a$_y57=q
z@7&&yY!?_&#tUN-UA{S1<~3><WK>bS#l+2&yq%)GW+kbvYljyKlp+~HoQCu|2z{FM
zY+J5{T?7vg510|ZN>vt@mZno#jx^X`I*8vp8hFN}heN)^g-TjGOEN9vm0_Z-_w>8&
z-Krws)#hz62GeR<E+&ogUo|zHZvl@E7v7o2m|ywe?a8B3^JQ05BY8sgs`UJG__?xq
zy^ZvNlUv^PqPg?+(B^M(<tcsxB?EEhA6I3B*&9F)yn=)ZwUTDAa6w(<rr8Rc@R6xK
zKjXrkg0dBO@T;W}s-hLKG&W%lppP_fGH5SX!T-p9+ZJY8p7Pi*X6;e?kglfdeeohM
zOq6jq@Q=!3d<#0bpj}_dfMpc9mTV{3HS@()!KEVC=x@n%n}?R;4hY&voeRWvhO`VW
zyNhJ6@(V<57q7pTaj(sgOTMjq-b5?7L+9Vgwi}a7p{y5|Is^w!;kRn4bPzUSMy)5=
zH14{F33Tvqan-8zE}q`DeBUm<eMod8!wX{uu}HjJ5+YB{wl#M+jp!{|jOr=z@|2OY
zRGQo*pF`>LE#Dg42{gT}Sx5kRcivkHyNY(weLZ9sE~Osmewm&%J!N@4MYZek{C<C9
zvbt(sd#bQov(vBZ;off^wkX-oSFGpKlNZdn9s928sK<2Vpv;FfP42CSn;Vc7GA*4b
zC0fGdQmUNmPbUK0z60|gmkjf-%$`w}Z(G=*x|3fvHa7ej&q<~uL_Q7f4@1^x7>fE%
zg8cyDzZ1(J3@z+%8nE`~wF%XVA+tVozG3x^@*)mupb*)Ze8>G*cIH@uGpICpuSIK?
z5<cg6gW)sJeM7W4K{Wg>$@gaYDBt>;b&RAnuT&VNw8Ln{G^A6DZ`pBa9LX|y5G9&U
zoqj}-fok+~efDF^)RaA>(>FGyo_-}x-wXc}Fu$;n>3Le(Yj7<9dYP^*CSER7{Ice7
zk=v=Q-*zpq@XoGl|7iZIi4IieB%<=bx)^yGBqOkXJCznurP=ySTS?_r;v3WH@OzJQ
z%oG+5gB%6W_W?}JuY-t(qsgwIm?>d;U{j(ZZYw<x(3b{CFo$M?U%wK+l_-jL@YB2@
z+d%n;!KSDHkZscVGo-*Izap`|@pn4C3*xTP$h<8VxTG*K1b_iam;|s5DbpqtFaly|
zVmfX7d=88$B1~3KNUWf9QAzkU0L;8#S4OwoG+kS<m7hM^HA4$SW|D(}GGq@p<z#}f
zOF_8**SfmPRkj=FdXij@s3*QbP?aRyP*$izF!`;;pm#RSU;du|L1H|A%%bo(DJdB1
zi1Oed#ql;CNsp&<`sQ3;z+D)nTzSC4QlqWyn$%%FnW(+N{u1T#R_)vps)qRkFI#Y6
zbJ=){$wCv=c=R&>LF%n(`QovDid(u=rR#2r=jCPi$&}X!*{V^ier0`Y%THscbc&ga
zi)*df4ixTE^h97Nwq=LjD#qUz{~xI!ZAal{vFO1o<Q$9<kYY5m_I-nn!4UBXFV<LQ
z{wLKC3XSx(N91YCvLba>u`se~WdnJ<OraJhU<qbpZ$Oeu^z|y0aUAB21gfOq2NVT3
zSkRwX@)2<Ip1t7^#5TI&)dkb^WN_-h6b}UV;<eD58*=m^6J!)znFrxSav9H`mwm^a
zQLJcg%fM7s?vvblB`I-A3p2G7bH7Fcf~F+IcBb%#C?3y{F(WglV5&S8luB3vl0qr@
zK7I&3XM>REh+P*jtjtQSm9h%ZQJ0shS(dVaFR`7a=#GWY_ASwd^FZ@uH05OlUWK;L
zRLteabmw87#9v7i*Wlz}EGz~Zogq^~n8EN&Hr2OubcfeB{An7a21kX7g(56^ovd={
zY`DR0wN9s}H_&e6>Y4O(;irMn{duD0mO*j)8j)XegoZ)6Ef~q-d*Qr*?;T^eyz-7W
zR>#|A`%$Kw-tXV%Z&%&j_B#&M%iaUT860+cc6N5e$lEXSvcj{ovvFx@o>N>$9XCUG
z`n9X~0ceCleg;A#_}$@;W^(y$Z-0_+zmHn`x{h-Av_$iJO(MR9|BKhN>>~RoO6kpB
z2<{-MfK~=9^$G+(UKJV+ImWj<sCuoN!<vyGb3Q#m%nn49q9E;HJ^rI4D9a&**?R^J
z_#R_`3}BTSf!N+jhVc((PfH9Zh5?Y}W@ouV*|7o4fJsuU)DVDavh6}CFe%9Oc$gPU
zXHu-)n$DyoGa+CRV^Xx7!9NjW7J;d$hTXeF^#qqzf;VqOred*wH+3*_2_90Gp=Fbz
z3dowmGa_rJ+kcEKwJh(B+2_C^i^)lnGo}uR_|U=LFQUBIoEo1#kMx{`Ac}YQk#z}E
z<Iz$(ms_uUaIwBp$W*&HN^$qy-#3?)8yl<+UxT~wsmw&(c7n;Zavh%xF->H)c6Z6e
z+MwMcj<NIa^hxXIjphVT>%L8CnFp1|9QyC7)fhx|{aI_5e$CDc)Br(rmD|nN^lB%c
zldC{_?WPRB&lgKe%d5^OJtd`o$;<sHf3A<dQWR}<$L$o)Rfg~DNeDmac`pX^*xapK
zZ#G#Zo8G0=sfo-?3G6Id1p47`z|*d#)2?Y*_5X>^{0;~|q=$Wq+PaUAh&W_;!L@Fj
zQ|D{r6BMMUC<M47a*aJzV0onf(2Qlv2$PUXh3c3ag%&(v$imK(2GT3W&7eZ?vgd<=
z#SrvVa3WkJf(=X@c=KOp*7+rzE-dp!u0twV=BNM!e};w`rZga%UgL{(z<}LwAG2b^
zAm?L>Nl`;*eVZ1-6ygd(7bOA54>XLl9^uD{U<Dxm3&e)?|0G7apSeY*ER~Ds;e3!+
z$j@>&Zqe1VZ8FQ$H01hCwPVirav2=M>n2`&BSpaU!@-c~oeYRyKvGNx^K$?=cT_=-
zY723_WX?g3ZcXU^5WVdEkeiz_Rc-GQ6pb40#_Lf`J>B6`;rn*{SS;s7x)$rAL!{<$
z_gJ>$qns<j$^3j|9<ArQm-NJCJRf|d-)KV5pqa)Hbzj+jy}rl2%Q4Vo)7*I7f+w?O
zI?a1GQJAc!rJ!*AC5DKJiTUc)-c1X17Z(rjaNde4iX-$@YBy(j-;UlLP5XU$5R)#2
zkbHGxLsv<u&JXlCH8oYuKls&8Jj6RXUT;2G;CK#|Nbj#bT(4jHe6Gk(?mmjAcYD8M
zQaz=^MUD9KTf^h$36Qq`ZMcF$|N6?q#cku`ASU3S-}~)Ne)4bZii)eM^Ypc4);d|V
z@uO%u+qK$8s;yN#Dvs%0=cyV}87?qF%3v>xhB_0+$Y@p{r3A2Ulc?|@ufAa9e^~LQ
z(rn;J&CmdH#)p^Kf+9U4(gX$SZHNAo0-*oC`|gbhr29wgH&)KDG(=B5La-bagDt8C
z$;BgmdKPiydKB+iu`^hIP1sOblH8x*LG!Ak#byCV0RJN)@@xFQb?0wP=tEJi%mQEn
zJb!{<Les8!#RN0p`fg$=o_Q^-lcxC&7IXDH?-hO@Q`sFi3>U!1bTsj|3Zi5V-NAty
zxQ9H)N3u=XTC!_;STv_~ce@o+t2z*)Qxm^fjxFEv!0U0n7GGl|a@aABzOUnKAS#<N
zRv+UW7{_z)f~-b&U#==X9yqj`Qx6}O^aZ{oD>mH8uT}K|p&`aDoAsg$pGJ%QP8OdR
z{}s~b(F1tr!=m<=KHwTZ+Ti(c+R)H&cxaYBdHCS@rRGfG+3|Lz2E<7CK8r$=Jn?+t
zgdPIBF72-3KOCtSQImu4bBkFnW&8NeCVn^FAh+&2(qeTxpO+|?WPRO?n?b+Bvi38p
z;q>(5%heqynz?HW`&N>@7bl|6-=jA42SYDoM_Qo8-Lmirl`y@sf}L1tIkh*`d&9rs
z5~u_#w9vfHwk0KfYG%<wX7`ioI*!&(8#W)A&4a@znnP234OB4@!6jY^G<jiC;8*#T
zmGf!x<Tz50<T!N*TrdHD@Cyh9NE5D~4UqwY6vW#h!jNHdZeRT18}E?Mvl~6%Uc$fI
zN>dalV7g7E{jv&tg(}bQ?oXy!%TPt=PAGu49&*?zo4vfz$X^J)dt7^b6W9cRKh;hm
zfrK0-iW&AjIaLp3EIPq=s;~<3JpbOGT&(EwV_g48LqV!~hSpD<M*sd|(Q-^_Rn3US
zl`5Q9!RTvrEUwUhu<j}6GZqQoTwQH(m8-nn?p86rKX2<kDg5s&Kv%}tCHo2yghIzP
z9#Qc$euUR$>rpTszuOoI0Q$4fuay|0#^r1=gwV63tjy~7?}^{+Sm@|FPLpiq>eZj8
ziO|FXu6=*5o9STujxXKc{@e!tuyj6_?{2%+=(}oBaamZQ`CSHaF%?=R($A<YquttY
zJu?VAeWP(gjlhMX&93;g{+(+!Y=QyElv{-Uz(>NMER`icFC_a;(kKsse4_g@m*<jt
zht%Yvg=f3ge8ip~u-z?!-a;G&r7EF7lcV|vYUiSu26CR83Q~eOkik9E;?Cd~4Zs~7
znf(5Vj1*TCTwX|&$^!ycrR*dkn>7*{Spgt;CWk&P9y{!hBtc#H<4jrp-E{G{Xqv>4
zFE?YHNwG*dB^((b)EC?1nHT1{R7p@GDA0%wU{kPw=4ZWTt1ZI{^|<zU-gH1mCRq>Y
z$)ObcCKjpFGjMT9;$&nJbM`Fk@MJNVlgsQ{o5PN#Cj`#GWxn4A()8W$4Q+fY2MZeR
z1B53L_~u{E`Y;BG|51*q9^;FKL>y0V+WOeBc3C$OT3^rOI{7<WFaIu#8KMdL?W1Yx
zW9b0qj^W~_&75EPSN|?`+S}=i>~3+by}FKf&5X^H-KT)O-kf4w`Q<5SUJ5%(O!KRs
zDmveb$g0qv*Dt;Fal8a)P<4UCo+r=I24<qY*whi3e`1pz!9DSJUQY8sJRTd@a<wLf
z7=o?&6$LH#H6Q1;ja>MqKAr4n=E|ufK(3$R^DI(eR14%xoIab}k2w|$2<STicSO}U
z15H38z|X$z!2BN>c`t1sS;<Kt8%7l|)SsEs*aC3Xo=SkY0s4-r;37(vi0pUz=PQ}{
zi#`8P1#EIeDf&30u$54IK%5p}o7|o>5DtM>!iJWQ7KKdid{cbyNW;81$@OtIh--26
zqAA5fG-WixZoTQ+Th*C)R)SS7fz|NzOPPa}hf&UT9}Cy!jpy{FVs}nz<|0^gOGd(_
z;TuH>>UVdtS6&>4#K}&(JX#4DCbV9u_<57X4m$AY20ip`5j16sb7ya@KciP;B}u~H
zq1IK8@kiS#9LTQGK3<lsx0jEt3|p#jWIeK2dfx^U5zILXY~gFWly}y~q$ow0UobX$
zyJ2mcAP#<YujNWC?5YTDt8vdN&VL8UFsdJ|dmrrlS@?WC{ByeEncm+t&vmsZu;DrI
z0a)ItTHW=oaj?LvCKpldDhv*MA50<$Sp6KqRV>E!_S_C%;7CwU$jt6`EpwYVI$1II
zx+qi)AXYkxFOdKuBS~g;5m1d<R3@7jq6|VLNI9?W-)G;N2_)i~fXMG@M1P5dlH^Kq
z&wh)CT6@g3M+8JhU^|hqVRAzPf~a0IH4MQ05gEtYZu}y8osLn6X-0VkFu)Y9@yWp@
zztaf5Y?Ur)sh9)^mIgrlf{BB%2u&x84-y?q2;CMdQG_<|lxp$;1FF=x*zVr@^!jx;
zwO9J|4*=*p6@H2$XG%N%!JZsgVjQGE0qh_zgeLv-AObx1I6a-|y4^@co}*&@LI<t9
z9va%s!`t|IExh=12Op`LR4}<)_C84Za6zNa>KV41j6*68{&=9ns6JS4_f}8R$z*RT
zpmO3Szw~(cOzVZ}tyni)9k+D%d)sF#ul}N=noMsRS0FHr?iYTSq4y|xfjk*`YALzS
zO-EP7+hk4PZvB`WlAZgg;i#rW=iZrbZ{S6Ur04Ee*#TL9jTiy8tD3Xx_c1;zPqz{?
z=~<~TC$-biBI!oQXs4c~q-QSf)g$y;D<;$gYHX@odt<8>e^8TG^InHhiX?;5->vVu
zE!Z2ge3~|^)&~4#^GUo`Eo~8RUbbD8kC6Mg;P}LS$Zpp;sS<PcRJL<Zi_PN3nB58E
z_0G4XAu&ju6(p`BMJRHbz6;R*CGRKlrv$|NdeY1)U^fwH@WW>y@(bP@%M<bH!R2@c
z>SRE6;{gs$QA{C9!c-P#;?0#wg>#6}0SVybD5SqA16D*`+a%U`QHyhdfHHDc1l+#Z
z=sU~SF56bBy`<ic`L=gVKy-NBZerm9hH1RiaD?4P*KZ8Fa0<oxP-`GUla%F&LL}C-
zTE+Ni4fwP81%aLO7MEKiaLoQ`6l6CQRb_i}gkz1^VVu6zT3^+l%X;TC`cR}ov2(p5
z+HqFOLkfrBSM57fqu@o1l1xg=abxi3Gi&K`iGf`}<t~U+jlQ){{ZMCj?V#;4V~c1B
z)_%BKU&HD0?{MQNR^7s-{rO#Tv-4Wh!p7}ega*}TPv~^!F)=!Wkr3zJ#=~JfQiBf_
zbU!VY36$$)_epWG@8C60j<12XuA8Zylv90q+88q5t&*<q5<D7*&TBE_L^t&YLG$;E
z?u{#GKywJx9}7GZcs1B?J?bXqe^t9|hGnP4`G1_Fad-tb*nS`f;TJd}*J?>HtALZ^
zpbm~e+|&Ht2xGyLt<IOGzL$c45yp2%jPg>bfziWoxAhF&DM9mP1Ghqj+v|KfC>)n=
zt+7dnonTG5C;tHs6NpAV9RNiFLGqV+S|~pdKbS60mRtyDmC79~KMVUFThXc7J4jlt
zn4j$EE~gSH<i~EpZFrsTYP*;!qA`9kAPT*}9!8JykzK<4aEo__WZ0U{&-)XheDE|)
z87*;08E(1<1r?>I|7vrEwa$hHg?dnQd?(DpX?c~@Z5_0@l_w?Bkpzzz;#dFdR%Ldz
zP)yVTWj}5GRDN`P)htk^YmsNz`f?uAb((sE6aDDp*74vlT1R2z_SOdCiQaBlxZFml
zrGPi?exzaA!o&=kXwGr8g9nVF(T%<XU(`30)fY75Dd=jGG{AV3K9~GtZS_)h>)>60
z>aLdvbfT9BNoTt4;L7Ef1o<)Jc1twJem^efQzT4+i5Ejq6K*>o%C3N{J_$#;YQ*^d
zoRS!*r>`}hOdWFWIu<x$mQe0Ez{ndEZq{(fQBgQK{nSWiQgXwQZ=G=5kfJ!?Le)rn
zB>RKlJvBinDDVghO4s;QF*{UBoe^0$U}b_55dNL0ZLhJ+@PK<Jauf14PUf9rF}MXP
zRk&-;+#f$J!32S`Y{A=o+FR}ij1(_HR-@|@*!M7HVZvb5Fx7%>?Imk=x*0~ZRu$t(
znqVDj^|`A~AvwZ2G>j1BKI9|}sp{b99|X<|eJ(``H}CG_@kGCW6S&|fg?=>dfV4k~
zMYbkFwmRn$ir&qqJHI>|sGz6zey`NY9%4gj>D{s$P=XrYN0(9Eu@8JnmhWuvSc>>(
zBH;`LuT%$F&n&RRxwy>jYI<;>8lTtc>UEIgbTK_uw4<O{Fa!iWyvw`l{7(G7nD-md
zWb<9&7og^Fg6n1>rS?DQfO3rzm#ECQ!K_A)MVqp%4=Z@O{nOm9qw6!!_2SVmBzcT;
zC?Y$10nNT+rK6W}?I=3P^)7tZS#w%>Q{0C?h<hKKBhkeDTSGlTF?}GpNYPA+&=AV4
z|4|Mqu|0q|Z2k&*TBtmbQAQXQAZk@4f7Qg)fVi9S3-Bv;7(zU+e~$4XXhdhB*Dio3
zQ05hdC`bt`3;;nIQiB3;2K&Nm=vku7sQr_tiJhaOlD#1$qu26%;v|+55Y(wN8W=yy
z$Kj7^=>J7>=)Fi!DFJ!m#rRGXu1x}dlEhh5Cm^G)ty%7bYg1;Z<xz}dYUsK9eUvZY
z-TGC{{Bo>QkB$teRu516g$d_(dqJ-k$Fx!VIEuv1|2h<mp>91%?L8vC@z%|Wf>o-%
zj{mW1z6A=Qy##HHl_R}>g$<GIoA_CU?<`IS%~_u5r^n#d_5FJD7ATg~<>YlZ3v(BB
zOV8<GtTk-wcn8tc?zr*Fc@6JTyAEk;$noxPguDhM_E(g+>AJ{g8Xyy1`Bb^KfF-n@
zQQo2^={t?7dfadUvVON<`5z~O(G|2Re;+Vjs@?kZ1^p;4?c<G@b9CNB%vKWWGn5is
zT`R$^`|WcUKPUI;WYIwPBhX#^_ni@PVSrLV(Z#$CF(lL}0VKc=dlR{jgj*V^6Atj`
zsaOZ|_G4t3_>ckMAI3xzaLiSvB1j-oG$a?=AG-kaHvj?^t{-i{VDH|o7ajJFL?1p)
zY+q&SxF8KBRXG4j7<C67nW8scSlBRBj1=t|AwyYqf&up+uDFQg0<Q?Jo{h9OP5IRv
zATRKleE)*IbQ4t-H5$<Zp@@ne>L48-6bUhsW%eTexB1#vTCJ$DBk#A2?oFMI$RUof
z2^<!7qVC@F?0O@}qI<YlMdne8%PHKC`6+lO_}cfO$@~IOd0K@aEwmUHiAdw|y4@`a
zU4xl4n(g0ZwP*PCKK~k8nu=4++Q+am1J97?yY^%|a2$R+INr}Qa+o{8*iHOKxM|`8
z0rhn$3{m)C`b)O~sq(el*_lqm&T1WLdu?`I5ruR$v_95)`b8KZH}Ry4s=IrbERJ+P
zRd=2j8S6-ms@d{LQC;HDY^`?Iy3J=*Bu|b*(B}&K2a6wk-v0FO6?(t*6Igxq)wBw#
zEZtO7uviFx9MF(ph6xx(Vib}HR2D*=3myOaQ5|ki%7Os^=FP0hQo#L9J4RUM2<6jt
zUO+W^zQXNz@T#T3kPFvCGQ&Z>7s(Bgg6<9<fwK@vxC8WDlY^(OKSKoaHB>37S%f9X
zsO=-?2b3iIj7ZqaMWsFh`>xc8Isgs$Mm%Lvr#?6tAsnfX=n#acoR0`ZknE#1B<Zzi
z?YZq$k^OwRyx7=#O#EAT#a1P+H!#VpBqZr9q?tr4>D(@YI7I9Di^NH8w7uHf`=Z*`
zx6r6R<G|YljuL8?W6X<WMk2tTGqv5dPMcTYuILtSEjP@4^SS$*v611>&Kacu$D_MF
z@%|a2j?baX@U0^F^8NBg+xc+_ZnpZ=zeC)l{XsLm*6YB0yW6EQw@Yd-UHmi+ug^kS
znXl0Ky)p6Mp0u{Ymw&oeldUqn$klU*x%wZ3hTFDuyB$aGSqoh9zsEH3>GG%$;lu4)
zuvBv$(CCK@YkAAe5!qc;du|K3QDm9c+12y-E_y7NKds7TFEfTH(Ztug%lWTRqsF`+
z?ipQXNA0~G;7>omyUZ=Ah(9Gsel$;qgH7i*#urUfI3jSQjD*k*ltB6?QRzBcgifX9
z6d^B^<)9)b5uYJrGHp|mRXPi?y2IuZHhkY(r+cPwmLcARF|@+x`<o<U2O~@lTdL5U
z{;3i}0G@{)`o)PD2s+|)G^A03O?PvZ`(FgsLu!zuZ(GAm<cfcBMs|sLSb~!xVB?Df
zfej%ik~>F>m<EZ7dvhE8BrYM_;a{y61PH?5UO3+5rK_9!S*2{_HJ+s(@a!Hs1t1?P
zIMARx$;XP7Oh{(X<!U(WiN^5GAj>tw*s<GWG^TJ+0&id$DllFt-GzodpbN4mI(O*i
zTmYYJH($2eoTMz76K;hEZ%sDwvm&1`rcci%^3pLx{YRN>X60Bl0_v~L=5n+1P-vfd
z7o21X=afxq*)B8frc1eN&8HhnZ&G)?P$C!G(tT_@f820>e9^Zf&FcC*08Y&BazRNS
z&IVg8r?+u*G;9D<m4K;{u}eU{tFtn|or|H+NCvT6SA%Bgzs2}08(rDhgWpUq!A`zt
z=dQl&J5B9r<S{VY`OQsLo##%)cAxV<K2+hzK)|~lwKm=R(f;ffmirfZJ$L)6aosPG
zjy)?YVYJ+t96xW0i5Mn745FjqT?nLUEjM?m7iY%6KwWov)$qM}vk1io;u?}zGDW9H
z+A0sVq)TbN{!bO>pE-|`RoRf>IAmyffZ=xtdYr3V$sa+&*N8n8f7HIo0|5A54u?hv
zugLjg)8ynVOzAb9S%(^7<U(wcohSpGk_*P$kbrHjd&a{Nn5c{5cGOl1IUIaZ04Ot9
z8zPX|^$`An?f$ofk7dUk{DTf6v0|oCBraONiuCNNEKeh)OLJl+9We@uLK;_fU<xV8
zw?A;U4KbKSn;pejpZf_XqTZjK4{TYo^_Y&e)S{z8^rPO$3vBcG>e%KEDAXC)g6gKv
z_xo%|rWHOr9}hPt>*=z1Xe`g6k8C_*wBF;*c*^cf62-Wo{6wJYun-w|Rbu-l2;av2
z7_6!G!=7P>C1tmBrYj5kg<o_W5W&LTn(yr*;+TZG4+;_I-|akav*sAN-ojtHIg?}o
z>o2eH;RDA!Td$N<ohRpa)ss9I*c`m!YeXIaG1`I&s}Iv1dUeiKZ04os**Z^mWI7=&
zA2-b?&JMHiy*Eu`+(uGKucuA?H^tLQCS4d`?I$}ORZujvR+Gv@6LNq(&5n`zWgBf3
zNb6B&<$PvZxpUvUWmHuJf;rJIx$@cA*J?I*u*ucVYX1u6rNj?-X_pkGSr*Dla-RQZ
z(x{^T`e?<v{zzWGD;>X~6EtN*ZCRjwFoO$wlt{UH07<QoCUK7_xl;g0dnBQSB|%C+
z&j5T!qK-5`PJFXpHEQ_)2m+!|$@pcSd(lJ(zy*WAfsswf&Q^Kw3U&~2FhE$(j`<$4
z@DObg07OH<A7WXsyP)%Q{|L%giEA)~0tdi7`)E#}6(J5HSqTaJ`t6LjFLN5af_H~1
zgRU4Ww<we)Rb*@k`&p1L)?tY>zsJp<>3F43HlH!<#E-nWK8)VhMxB0s=0)miy%yWD
zfR>k)HEznW>GvB+Qy;uNC67#ES~gJ}V877$#hyF;O__UQk__UQ`Gj8n75#*^mE~oF
zysVUYbxjoc;(Pu{RSJS(SpfE0w%u|Z&l~Sv#Kx02gEF+(04VH51O%NWkmYC3-}JWm
zUQVt2Bm*+;NW!Ca`|y1r^6NalUNJ{>(jR0=U(?^2?^DGArI*VxW~4jm98DBq5vmtb
z5>dbq5a_1sc_y;_LNA`|KAHb#ymj|#zO^68G=HSy*1Hs2HxY*Jejy5-`^x*J;!2vD
z_rKU}^qnP&_8$Ez2=UaZ)_d7@xX8_`73R}^8~8Lo6FVcC^dTOORbA1j($C?K^{dJZ
z7&Lh)l&<Ed0~N70t+_oe=VQUzJ#1h!O2E8X5DOY*{5_iNBAL7|{V~#Io1X6`qM%Qh
z*mFX~_Cj7MstacuBcjDgk}f=t7ewiQj7<)OoCN4ujP6@eKn2XXAwNY55^r-(q(VQD
zJ3~SA|2*z>Qh>7$MlSy~OqG`}C>q)FlNQdF05$~%P@THRNmqvD7Eb;zR01(--2HE$
z$vNgPL|M-%d`THnf>nBHu{<Pj8f=Ui|64-|)Zp(Kq`?S*FmNM#^A<fNF)ijd4z^s5
zGOKfvbLt?!X1mw%>8Ym6vd;qInDZE=pd(mI<V-@D*EpPZ+md9$7L(VZ$M4zaTPZDH
zc^tJ-W(Vj&(IKa@9H)?%VMR>iT9sl)$A2|<XDjgeS@i9@=v9rk+JH;^Mjj(EujbuS
zP`q<TG~WBbo1f+qp=;;;&En)21OI8%Ds(G}MXB$)T+`PtAC}4H=W{fBnoAIj0o!{y
zYAp|%yh_Hmp1a1j`I^@6;Bwqc;!rCh*Q#TIpIqJ35{i8By#a-Qc7^q6C%OKaXPXE;
zi?A%f7nwO@*{K}-Drn!d7Px2FX1d5NR{IH~{2~qkluSbGUi7=gN!m;pYR>*NczlV=
z>g@e>drM2VWcG`|1Lua|<A5gw|E&*0q{wDSl>a=RkR$H<Sj~VWXw3cnv>7P@|8_-t
z0}pykAY6Yc9Wq?<^vPIacRegH`Di}+{d!9NuvoDA4_!YOEZbksuv|6n%fio}VJtlb
zf2SiFAYh~>q<TITC!(N=s+_oYl5!7FxMJJ`_L)vIWY@t{7Z{L=oe1f}u428ETbEHh
z`eZY}9XIM=p2=F}UH_S`kYf+%#7sEl;J?n3M}MPG7`ZMZmb#Wyz#b6=#EB8Z$bG90
zgSXGIBE5zAJ9D}Z7pY_)DMqW<D0p#W<e0#4xQH+>HJkcA{BTx}dN5*PBuAVPE%RDq
zN2HtO?4(Y#!ltR{sdSRhxc<ZI;K2MkjvD`mslxre{S`kM1GjAM?(w;B0P^l>yjrRq
zH{XGB|Ea*5pf|U*{aw2oj&h<lFVYDR{W5yyFMO3G&Ioq{$K<bR-JHzwO$t^SSw5$g
zy7K5v!S&~3zBbcZB-T$6l;V&6y1Q?0I!jfryQA&2?P~z^Nx8Q^Ai%a8B=l<)C<|H_
zZfFzu*e!;{ji%T|`p>DTGnFo%H4$CV%X8Ed!eG7n0Anlnkzc{+cJg?4uz`~WaV%OK
z-@6uQb!$_lrDpqN1F3`c<tbL#u^G}g)mhbbB0L`<$*=Px8Y$B)73k5|%Lb>Ik4%b@
z7vt)84Dy>@Vqn60kX<I*{fSDIZ3T|&12hv(GR2+0AxnVA=BkpurIl<G&nO2{;B)~@
zVEajeb~&rk|H;Um0vl}{J0vjhjbyGpbAW)HD!e3>$Y-YAud1z!?r>i4>yCIBE&7iq
z(FTUBQNBc-GGW-^t0@o}2yKEI8_FCmgWUonw-`Bh)7rr#`27!1Uf%hwR2U5KfgcbT
zab)s5n@&1GfWE-5`MqHnh9GDOAq<uTN6_f~o??+ns)0L{mmIbZ7#SoHk}jVn4Ngh}
zqR47@)CEr6E?Q@sB;FD=S51!)E7rFNjSVV{?&Sg3{$W<B(5Z$AoqO^)zm&0k!8D1n
z?Xc7>BDIhW$J#3`e!9*rKl61XJ*-JtXX&rJKBrBo*WkI4OEjSJ&EcW6@JN)XgYeUP
z*hil2{cDb2%5dM;?DNBW`u03X81SFLlBXeYbVVtTK1#&5Py1UUM!B|g4Y~AoJr9Xy
zy2pSvtP&Z&Y#(1W3%Svwn7Wp;PI|xcmsksxCG9CVmveouUZ%-=T{XQfoAvrfQ0C|0
zuhc8NFZ#N4vN?tYJKYJ|FSllR?Pq$t<K6xjQ>`#mj^{0_{L*Y;Av6o@6M>dixhjQ;
z3|-tM3)0usSGC>k1rl*zy^c7!EsJk_tNST0qWUgjOf{Ma8qdH>o@RtHSZnOEG!fYd
z`RAcd4bD&VAf*W8Wkx8DKV_W%Cr4e%^z$czG(QQ1Et2b1VJG2$`At1p&bweFhe&x)
z&o|~^aTJ@O6f`KdCKuwBNNlp*No)im#QthBPcn4U1aQ|j#pd|WXF6LA$d8|@!;XK<
z7|dj%9Y!~5-z}K4H&JZmFk93`{^AsnjF`eOF9@mt%ecl8P-c&ltTD^bz9|K1!<9%@
z#!n~x$_i2H$r+F(hx0HNa)Z(J8AvaNn7O&K{|$G;Q%kPMo?49NKqnZ<9m>sIwXZA0
zJi}maxioa0v|gCxw`5bIyk#S|YxE;97$)!gcrNjUBRn6Flsl1Vg)EcJe6puWVet5e
zU0xHp04u7>ed8SJLsWo}!*t2F)&=DyX>099>3hgC7Ldy^v`KZ1&trGe<kjW^X9s<g
zU_Hsl_DCx97@?;lNV!bYO0QoZXnzyrb3POiZG5osR-V;vJ$~5O-St@Z7vz*+)O34$
zdw6jg3F+o@jhowYlL4atIsLl0<Y?4I-_<PVjBGV+^mT4P>%(LZ)ajLKfF8Vs?S8>n
z{mk95m^h4^C!4j3HB7icy<`{eN2eSQZ}60|x6tY4CO%JNT$JuVTJ^5a&|O<#@rvXy
zHxir__8mWDh?$yxP)pNzoJU^a$E^^Nr*;9C@eX*r49vP-B#)&C7ACr5o2E`*K?Ne2
zQA`0ka?%WMc%UeR&Q~RFFdpOuz(`{|8|ny)af8h)|H7L3p_}h)%Zh>;CN8<V;m8w;
z{OjMVNp+G6965(zz9@Gt*$43*<vv`TbQI}VCmqJo2Ob076_S$l`D-Cyb^8tbuoZ<x
z01H^qV-YG^imW88&?7xkf;S4DiC^R()<EsSK`|Rvur>|(3suEls`}g-4eO*ZNEAHB
z8sa8wU>Hqv_yU3YM<yrB;ZR4YfKBPzGA(yTT%tqmJn@KD++|h5DPC=bK_jI{I@jOy
z@cvDkoqcB|tY!4nzV9#Sd_L<mj=Fj6J(&#`pY-Vy#iAwotsg|M3}YRi>YC8n0gSSr
z8!NlhtouZZJooiDmgO}8c?&IXwR|z<@vPF`5p}HNRWxn4@bXaU{Zp106kNj`(33+)
z*$Rb)>o14W%3<ys;mXn0PKVGvAH83yM?du!#+EPty@5%HB+JKd^yjMn^tCK&<;gz1
zD{O3j4n^a5x~=0nE$vl4_-OtC*ZRIb=tg&E;HCp4+ih3|>)wOcF1OLR#Qt?Wq8e*_
zSGjd$@co>QzhYY_J|kpr@~Ra}dM8)W{bPGl6ixaN^9CPUH_GBs`Ad<Ie?rRh0z}k>
z{gcsgVFt(}NAa;Li9-c)*2mi8|L9by{-OB8Jpmh@7z}$3tyiLrw%{Lv5!R?wv@6A}
z-6dIa`Cx34cY_Rpz>iPRd8Vni>hNl_`H5>-I|^1PC3z6Jf?cVwHh#GFjgp-_e4)ZR
ztlGL(j#MYb<>h78Mc405q@7%JC5db&MENZz$B$b>^U74d_!aoix2)E|WFx$N(aa$C
zj%kgYf!9Hex}e$Z5r5q4pTw*VsIbD8xs8AOpCx$0T8%5hps1jT0~G+roPts)^(b1u
zf0`1--sG^ss)ElC<Pvy;4+?7I(zDm-$|}Ie4WpsHt=hUj6BD@dwz9?EwLD5OEIwuK
zUg4+&CURZY5d95xh@N&JAAgv4>cp3Xy2XKq;Koc@mdvt?Jzz?ZPQu(4&~&}7RPf>8
zLDA%JnK+Y{<4b4dKY`yP%)&o=e{kcH8C~^&<dGVi0dPCM9nbZ9vp*JI$d_`H!X_(r
zCQ%q;GTwJgqilDL(R#r#I%2xE9?hK*dYGo<BQTeQ#+ofs^1dW<M_+?@$b>ojwi4Ex
z-V@UH#udv76#sV?ARkLy>m$p)HHXD~T74}etD$T^JTf!E&2HqjpmC>(sW3AYMCBX6
zB$N#CDfmL<Ds+`o#6r(PndmS%FU4G`i<~Ct0#mg>@*tq-dfJlQw}l=dXt*JkYTcHJ
zX2dSkg*(Q>X^r`h?pXaBF;oQ$jiacHSxyn4W|+IIrHUwp@&^T8y6v^)wjs0zqDq5s
zDnjY;H#Aff1F$A^2*7@7oCI}++aMhLw$o+J9Ofj$H%3o~59W&Ckhdr0Xqa>0b_t|Z
z6dj^%FiE&+j<(!=cvudYayq>t>2ApEk3`JU`XlkQiG-xNuu!PL&=U@|dd?rB7Zk`G
zwYD&8w!iMJk=+tzX@q>?aoNBOUs8l2?YWB7z5xUkt~{5g3OGzUo>g`k2h(}~D1>2v
zlguwtct6UP-LVJ{E9eY_pt4M&k?9Dm6%K#Lj^;+;4ca3)&vAK<b?(oaOJ7GD&8Fiq
zxlGB6_SkglN2_~C=YN^;3U^mPjN+S^dmiI5JZsK;f2Q#q;MNK<Fi87tIX%7V!V=72
z;|I;ty-tA`hi}ct)S_QjJyV(5@H&la*X>K!T-^rKRL4EOTChSZqW^9!znLAsG7n5k
zho?_!KAP&X+q<t@y)k|Vsfxs0+nI{Oh(CKVmH54EKzbwPmaeq0n)KctQ*8S+2};ku
zz(hm*GrYipQscW@-A-CP36$?LcfHw9$pbnr4PR#8g^bk>J2ubZx}M}$e*<)lZ2b=a
zu|Q70RK{+RJ0c>hKS<ys)*GZWYcWBAeLBa#DS-`DP{;t=5S&!7MlB$k7`+9AK8tBI
zHzg3(u{;QRt2q|{Jx2k(0zeMfN<d356x$&@D?|$6fElQCz|R$F6{E$a+>?Hwf<)~}
z=wyTnDR#6Pd(DaZEKF>BSs&z$sC<Z034ctVk%pklfiG4w*>dSPlcq_;BlXY;vi*IK
zCq<%h3jm;7h>LNK!jK*gGi!ldP1`yl-4t4`BV0xyLdY>qw8D)q&@hfd4&wpZ0yqTd
zR8ZiIwJR`*Jz}vSW04J&*QsUG-UR^MXx{u&<Hw%in1uoy2Meyy27ro2;XV(OJitlJ
zG)5vkMZ)=WX+AFqq;A+9a`@3F9|XN57>*q7yS`2A!@F!ej0w@dB!>WiLuDxkvJNCA
zB_9afd*8;pGS7Z;`Jgb&IZEg~)@{t1`1@pK8xC84N!{}KRYWLy<GH6fjrxsAL;KEb
z`7U?U;gf(TOp1;eKPCV`jveSs@O4d!{X=Ps^tx^UKt@eFKu`ccYHkrCkRlik0C;Q4
z_yiw^e}2Lv42KaR9N}-lp#G5#ydq5rqoIQ|eybjNHQFJvpgre;{z#dz0HDCoZ1LBJ
zE{R(m`^R{}T64CpoiX-uiMMU5W|yU(YueT2Rf3DqmaDq$@t4hZ85PJDo(O1qAnVSj
zg}Aa4hBvO9|HRwb<r{0dH%aBd#{Q-R_9%c|2=3sI@=csv#ad$!L4Z~Zv<v|Dm<0ju
zrHqY%D{p~gJP`~72y(Mn5=sIsf=~d61b{C9I1gmEg78tGnnQbQxF>vpLWH(h5I>Tu
zwkL4}y0UCpFB)ynS`efgBY}o-6mwk&(Ls_CX2Sr6OGuVM5hIDxBw~P=62bIsoKS{X
zn<$YK5Gq#3B2p4+?QspjT_`%cpY)Qmav^6B;H|x=nBbfk8Yck8Lk7$kfY4$Fl$Nvg
zMrj0P_^4L*yBuC9*pkWLA$3LFfmwoav;}n6bImkg62e1JAc3?@z|v;W+>BX-BoATu
za#SLP_m#u6%+yY&!aL+}(<dLgJSV>;hsF+SVdR=&J}m{k1yK&eEta(T@D5Ro>#mHm
zsEAx0H8q@d{i}zFcXJ~>Jx8rWrLxTzE{z{OdVEkooP+K7puizorln)HE*TA-2v3++
zRF+;@uRFW>_6BJMWe8sk5M=OIXwnb9NQ@duj{4wGrQr{FM5{#R?u#Qr_+QH2w1XK%
z8P*f*O6W?e+jvX=2JfDz-G8#>03pK~Q~IuL`zG8rW;pLz+?{o?V^4#yfDoZwzZ#qx
z!j?~Z9rw#jS8p`~l%asK51_sR>(1Dh{ay=_$7h#s?4>pdgox1qJ6oZ`g4%{)%5rve
z5-L}*asUw&^z}l<8U-TMtcIkL3(~Vd4*&o<<IO?8Zv&&;5V?u7azeyXL~H{(nqg)M
zh<*{RD1(oC08Ri(ji`e?Qg2T<nORqw<yg?EN8BYaPbku<V1&@zO%O5-WwOG$jQkcI
z7A7-N5Wz`+2@y>%hG0Ns#W5ttpa@5Dy*S_0K*>d{ogFmmAgzZy5ikPGUd-xA+(4ru
zl!G0#l_OGbA$b5waIQ;(K?1S2g7yrh*8n|=$s`=hLp#i5cQ5MF7yb75Z;t=4xgF0^
zx#!wD02_`%Y1rNbit7lEhj>yM6kse5a6G{2ELa;YV$4uXTL=*%<Z(hi$C$w^{uf@n
zaktCi$AYd~AI*iPo%fK#8TQNdjplpEVg5i#p|%`S9Mx-Dm9*rqK5W~+JD$^CR)n-S
zExbBpgY?qE=MH^DdOEM4@XYX?NYjc-vilSn)iqzQzP~%q2!BsTgm8ra8wv)B7G^A0
z{L=3<+mkT>bGzwi^v?KzKZM4Y>hn#VGyuTTPv7oDQ=%<A(RgUGe%2lJC5pSVuITnP
z%L`c}^f5=h<gjXt)z}7oW<hmYx%D=lJ<g!0N{w1~#y(@SZtw)Lrh8Lq<3<DpEp?E>
z5Dkk&K8^FbSecTM$`G0cwKb6MigF}k=YyJBIHzX1wi!H>h;%eTEkwHe0U-cD$)Tfg
zYl?HQ0TvTrIbd%C`gjPBgN=Fw0O03`^ztwR2S%CL9wQ<U0aOby8|0GQ`r!d}D}^yK
zbd;1a;V1?H3Sog>9xl|Fcqobih6M#m8!xH8Ud<n6XY4cy4J_s-&}Y_&;;mION2H39
znk<MfPj7=WX&SkNp&X3{+>11rP?3ORRUCsMv=Nd*ghddFMg-P~&VVu~%CUfGH-i?l
zRRDq55E2{MTERWx`DT*r_08Kp$Pn)enl2I{EFZA?X1cu&8hE6~!#qC1B6>zDfqlK0
z3gZJ5uzi$N25}7X_%N(zT@hDO&E$KjB0{ZV$N7v6kl$Gwa!?M%Zp3j}!>x;-*6qEh
zK19edA7xlD5&36wxb5=p6S~j%?xLl^b9MOx>z@4!3A+bL%}Bd<V9%DTX9*YkTTY}S
zVHN)kj0oWf51QQ8f?`Ygk=8S;fu_}TC<tEj*zy>s`)7>IEX^p<7B)Ckl^P25^`<HM
zSsUiv%w|$)%)O%9TZ`lyIv5{w)XVm(qJ72z0KV_tdiuuZfG2r(OCSKCqc63fDAi;H
zZTfW9C3935YB2&~592_w2nv)6P~VRPOvLy!G!-ybE~pK~K|RnJ04GJ%HYlZnjs{kM
z0wEtE`M|^g$N^N2G;{%(Gaw11yb4A{ARQXS!wUA`Xj>l=AmduKSdTm3QNqYrcEE^Q
z@i;yXSr%mLY{$TXHj7Zir%()V2xzC|-4s6n>FtoqTsfVYMy!OaNkHIcmX=^9lF+FD
zp`rVYB#_{44i*4FZ4K`0Me8}7HA0F{$WY3PqzM61(<6|XOgxsgaz`Nm5P;rJgs{Uo
z6j3y=oj;iq!xNxehQJBqiI71#6c3Es);`6?2a`G?GR7hVY;P^6M=*sRw;6>=?Et5w
z)h(Qk!wC;Qt%qVUhnX0j9C-*`xADvl*XLvwB|Am5e3tjnUM=OS?7IsS-jc(uUMGWz
zp*KIXs&n@j9?u^r5skK57C6V$pj(wVtf2dy=@+xxDp4U3Yva2%@%|~<?g*<GQN;gX
zMuc#L2Si3m7T;Zz(t4)YSYhcgg<(Oj#x5L={(=870n3?Ugg}DX&{y1-MA$_G01jN=
znp>UGA6jNThNr2e+&aVOMXeu{Kmfo;sgv~HIkXX&Da6K@aJvNF;&k3)*Dl?7`7Od?
z1PV2v#W-n;3d${}O3G_2CbCEM?VN*>5eg6pL3Jf0NYK#)$4tRR3=|J=rPVON8DTk~
zA^?Vf&Iaflg^I)o$3cz*IvwD9VG15<$8f9|DXRj35h#X&FPj9<co-oIj2fsEiduUS
zxi{>fg^sL2jo>JW5G3F*q@mr(!?}lM5JG@Z6o4q&KOllEi}4XuXP`*25Vg<{*x6D>
zmH-f7G)rpDgb<-cq!gpH{lH8TQa+3GQAHP!S##Drx=TsY1m-0%4ay-)Vp<bsGJyUz
zP<K}U^g{`lU#7qb)6ux0gU&fiFJJb-`SMS^lL#S?6#`ZW*s3~GFXZ!u&_+ygN?IUC
zn~I=Hi@7}{=u0>9`OrNMXUwqTH`L5vP7}o12FnY)<?|!{G;!!HwqM+4J>JUHY650@
z`NUzgzqV)BPls%ubY=DQ68||X!tb9TCN(2%%IUX-VQ!qkvTovx)sZjUw+pyU5&Jfs
z7*6{U{=cI?`#}q#UEGKe{+E%{oPV_ITxMCeINX{wa_SqsCm-EAoV+sy9k~ZG_Eh1e
zLQlS-$sA}Ly)=H+SihTQ#D&h?*NpoC3N$s8Q$y&y==F*5NdSP9>mM^Fs0%ObvdO27
z(7rwDS*tY>zC#Rmq4aU1IHR$c6*-`^1e1B=go#t$Fnf(cY@HB`2{twZPkY3+gRX0U
zMiZcY@rX!7mrwT_ka0dx)dh?uXtqOjTHxe`vH;>1h!X$+z!xEu33O`#=8t!_LAeWJ
zD+6r|0a@rtGD;d%_CdV^iD96QvhtK_aR6~1fE45aV%9^w8W`0OI0zYlKol`(rKH55
z?dO{?(#=uP%i0)ARAv`@TYZ;(IH}PP1OXv|>UuargpxEx*y1Pxr5H8Pjo>1LFGWxQ
zENTwH08X<;i1UpWksQIrm`TmK+EOfuwdn)~9rChd#hH(O>~tvbnJu#=Ei%fi?c!pQ
z4aH1Rw>;a*9uOScRmS$4`L^La0m*XxW*aBKN7(V;wZ3ljYtwF0j<S7}xt+T7v;qKd
zreXKl*1ZxhVv1x%*N=LKr>yhaa>A`+Or6w{*j0CbB6B~R-Q?R~Y&5;%Jb!uIis3w6
z+pq1BMA#fGKgsIp<&pE3`rbdV0RXTw?ZTFeDS|OB>k_9i3jNygQ-{;*ZqoAe5~GK8
zbUnh~nZDcyErj;5BSQG!#QuU~#}pSK3m6R*AqaUjc43TD_`SPi7H4EvWwr&?-)#ck
z;!^LPOTBy4RaE17P3u>>Th~*rf1GBu*UArPDPZ3ob;}COE=z9^7S8hdeVgub<>LyN
z-d4qtHkde+gdC*1SZ|c#3z4dP&dv{`WEg3SQoUTs_e_`*8yJIGOi-%f_#CXPg3dk&
zDnm7Dh(I8f06+s0K$1X|DySwfwHi8xq5uH`5dslVn#Bc0qYVb!K%f%HsY$%fV(n#P
zw3ARA1<fi>&G9XI$ndbrRwp}e0|Rgjha5z8eF!ec4JrvwsKbRArD7n-#{rF_G=f7~
z4^RYADMbP~Cl{$HmLw%8rqvSy00ksYQ$SB4kV6DGNwByC*QroOL0dU;7!N^3n5q+!
zGK{A*G1Yp9D4rhRGJBwGhxUrG8U><q&y}H+tv3dgbVB{Lt(G}Xp%`c39PDUC8AYL(
ziN_~pC=W1FIZG?qIOXc*A1qzY1-jT0o(z2wU-i7z&2zpp4ZE*c4iaK?vT*s2KV`ND
z)o>PWhJ4XH{~@Gq`k|?{)-}RW0%fLpS?uy*%3*3oTDh?PXx9ZqfGu{PF-$r9@Z(LA
zhXQt{UPMLY+Ju)Q7>Dr@WAARZBj<-tu73tt_O&NpjN#cPM%`4tZRx*k{rVcfu-Bh@
zmeU(vfBfkoN6DzJ%V=mu_yTA$B?JdRvuS*Az;LEF!UJPO2uJw0P@pK?n{%`jt3_}m
z91B_+FvrxW8;%uNtSVTZJI~TXVM6Q<6YzFQ2eK_nHpcJwt<Exi{(0r0Hki&g8tbkY
zr?{_MJ^P)(Tg$Fa?)E9gCD^<2Q)8^g0su-hn{Q;L^6jyH>ui}5QkThMU35Yuw3uK^
zH5B{fB43;`0aFd_%IEq!Vdz-2R}CNlb{$MsE@x|vgglF*95D7m0)v2pJRYLcz`9y!
zlSBdt0RmVS=v2_w1rb@JReHi&4h;yZG9Y4W1OU+2i&1(AS<u4@2?t!Evc_>}@1!&;
z0Lub>J4?~1g|J3Nq(#L*1VEH9cN&ErB*ofDZTs5Fefh8xwU_e{CC=yo562}0!g74R
zg*CEb57N?0iR>T_Sq$TJ7M_gL3hgju7i#aypa3Wg0+xaTjN*v_hoTlOBzlaD9<mzB
zEs;lvkgjsJ?5vq^B12y0TM3!wEZT({S0yf$1@c6E#)`DyG=t)x+bpJ8fEsBYNAu)p
z)3@fCQ5&?~@N3g<w}%AkI{Ha`)$GvM000NR`{YR0cCV>&TFdGO5R(S6OOz^e^>aO!
zEsh?-G~A!Q?`TbmG)%I<dy&4@FdR9|?I`AGu25A18Te|<g8R0=oo(Nq%x<kH<T@|E
z{6VbU5LGEQ?ca^N*b&ZlTd$o%Fl@s!QwOtkf3W!@R3hO8`DN5rXLYu+1FE-X&AD3?
zH=nzVTG;>uNy{%l#nQC=0?gVLLO4Ds;EhR-jPrE;OS2u}U(SdSj_|J}qbT!e|Hb^i
z62gWTDH`2>t@X_%uixPddJpp3a!&Oewe(V&QbY8p_!|4VB4tsmckJQF1NZ24ICE!<
zTSciRPgiFSG=?r7yBYux<vSh#aHe7RRpWkKg87;wr#h}2R6zj1zM`kfn$m(EBNRP=
z-x+U9(WoSiYE7syWVnUn5*M_sj0Ih6bO_|}LDo;)s3e>uK~*6)E(q3@aq$x|Gl3vI
z9F72%h9)g+Y=rVhc`_+rbsS{@wZ&Y-BRI=}z5!siBYM?{*a^c4*xbqMC}pD_=K45c
zznb955FBMu1Xwg&PbIFbgMPl#iY-+DLm4w-Xt6<g8id4A9)^igx?f;Xi6H{40@@MA
zi12WMwT0DE98ZGldr>)wau%K=4}%nr(g+S%g&DF?C}xa(EP_DCAOK9XSpgjbp;-$k
z3(Dgt003!?Q5*_zOxFhu6i=+xOZk+&A7U~9SzUBSb(USc(9RPO6kYox^K#VN*Qosx
z8Aq5c)=r?gfoHOyJUPnev24FZDrcW_dhH3pS^&VM<{h7P?2vjBiZbfMu+Kvs#{mEi
zeD}#`y8VL(hw2tcvzS%5XomG-pZ?K9mZwjtICL=kz@QxVe$#*7?Ar(G&L5~aODiq&
z&?n!Vw{DnET~2S^uH37TV$3z&U%hj$CvA|;XO58`j-UK^6&3I{JU)e0X<vKz`N3Q1
zCB@l_-n4@J?Cy5O?j!eotF+>h#PG0T&U1u+AKe8HS_qw@MuhM`lmcbx>~B}F21fNu
z_ZJ&44PXE6ph#VOyzA2vs?^eD2~_(pi(DG#Kg5O=0N~TweJ5)6ibwJKGxW1umalr|
zwOhB2W^eyoyI<l(_NE(Oc6@ckQ?K8;m8#m3q2EfIU|lvh!TybfPrL;HnDU_@AQAHj
z!!*5+DvvAZ$b94}6bMkX-mEks-a&{!&7vsaBS5DGtQb`}lJ*0Xris-uh=xK!AH^UG
z)M@}t9F7Bn7WAtT#2II#nA{fV^$5!Xfi*Hf@hWl<hX|6U0L}-UT~6j6N~4$2Jdw!8
z2oVfY4Ao~2vrV{BrlUGFtd7QfM{x#(GY~8yN6k&bAikkufONIPtvH-807E}+D}W3l
zur=V6($cJ!jFB;Fi`a|607a`A9AhyNies!r$x?lkJcLiNq+DR2wY0Sh6!DmDjl|f^
zj2dk*n-NtH#)|me-)SZ|gm(FrSbL$Efs!@H8ZDU0Emv;CDQcPUo^@CB`)#B60-O<x
zShbc=8+bekAdDtcHxua+_nz<Xbtf)0?;vI9^VWZeg*el&`!n4EQie{EtoZpxW{X!f
zCO~FbFP`nRbjVNnmK@G?n5Vd*y0;we$@z5G&qqXIwkt-@GB<11BrhDs69=}OJG`st
zOWr6u)?isbaoU=w=Z4cOy|gI1w*_$AhR3H2r~L?jTRKaK2Rx!n7=8D}5g{A_<hAFg
z)E+HIDi9nABggo4`$joL4OxaFt2E=&y1lJlmAD8Epd)6vEDOJ_HgAO?_jB$33SF+I
z&hjj>?3M(Ub!G@`(2aS|I*cK7r6!y9SVv~ut8?E40Gud$LMzSW36ZSxlod0ciOF*g
z#c>lv_^2ypru#X`0HfDHqW~-Zm30e2^#B)6lE~C1#~yP_2NDv4YWg@RKzRt%tD(u6
zrzbH9!crWf9)J=j4B((kMN$xfQo_XI2+L7Mpi+<>zp=D~Bi{+<Sph>Ut*)`Rm?Ti>
z!kP(sfMc}IjLPQSIiVRfnLyw&KEP?~4~5WZKyW2)15s4Lv(Z^}P9m29R&OC}c^GEq
zEEcx2ciq!VcYn2mFQeq+tWdxKodE%m0X&|NCZS1PL)#~bwH=5^&WU(N6hJfJi%E;M
z)C>uf;!p#{Q#QliZ<V%DBGgS{XY3oNTqW}%zB2BS*ddSMt6#8QbGC8!HEKT}V}v-(
zAb4LFj@tA2IK#skmyU?%#Vau@GTQZC--HGa4!;PlOUq2Hw<*7%KT2!a`GL#tA%{n6
zQUo4?xeoK@yWdCNwtc=&6mGY#_%vsrSH{d;9yr|OYCCRR%<ibp)ilRSJmWlr*CpPo
zmeUCTF^mY|2>-{Vrl(3qOOJPbT5K-2ben@Te)li|kC*SMWD6^p!h1+y4b0cnTI|b4
zpIY_Rty@RF-JD~y%i0g;XdtPMe$M^1@KHAlqwo3kaoQ!Ty@Ks;=0ZXzfU$Wjj=?V4
ziBEG3$h}5;IDlS=1x?|}D7sIF53q#9761k9WwwwMEK1{opCeEWXVgI@j#CT}Ss|!B
zt{H%BjnFL+)pT(xxx_>v5JknV7~nuht5jzcP<j-z5+Dd;ZZ~UdIacTd1vbVyKwDhD
zSv8MUs}jR*Zkla8R{r7M?1|6C0IE8*P>u3?31^bk7zt+yCWjbbkI)JP7;!O0I*Kup
zMo~SAaw|fnZ+!0!yUDIRTO2VPG1|y?6W}<DLkosM&O`%|KyMHb&?4h$NgJF&NknPn
zF(#e^ZlHJuJ=Xq(CMj`Zw_~nYKuy9|+Ezzg>EES|EirVmkAXFo0s0%>A&D0uz?qY-
z%_r;kUPX_fW{Qu~qzuz&_<eQAqR{0bX!xHgVqQaL%>Tr??EQB8@!I{aQ*87Nmg$m(
zLmnIg08%Orol<_9m6$i2N9)5ao2(~!9;i9bYAmbb=M7&DQ`6H5*skqAohL`xt&M$w
zYFEDY#H?ZV9pV2+Muc#L|4ZgxomcBv2LWpCV}rH+D`FPiUWxY(j+gKG3?5bF=ou3*
zsZgtATi<rS)3eS308Ulyszvjg<wcrW%C012e)PJ;_}`PxTxi<)qvjKV5Grbzc<q{1
zv);LN>$}R2dSGT{I-6UO7PmrR?S(2dxHZX&drby4%>R-Z6E_jFNi(RSR|M8c^R#Bv
z#hv8_SWO*c?+Bm;0x@Q116x{9PJ;3sQ5nXn^eBxY7A1$0NFT)mGQ9C;%HvUizLVj(
z@{|fecZ-CBI4*zy$NEd%v~4z$09^#@6eWxP_@~x5TQ|0kes^h7QiS8Jd8QWYQ}b0H
z?!5B;>yK>u^jFj-7_%Bk3X^1Y)B#$95G;zCUVHd)oajdoZddLVo~H~KSP<3_MS7=a
z{VE$PXY~wJXeY!*=L}R6GD0p>@}!7G!y#fm)oT$-If0C&Il|DxAw61qKS*;Z<|u5w
zZVJL<27C(bMseMl=1KU<B6VT&m}W6*m}#@<1?x4-uTEA(l^eR4=gH*^ja<|m5_yq)
zoDo}bO<5S>DfJx)o++C@E_8?^z`Hq|z57Jt0jqG)cHiTp$;dnIW>x2uqBX{9?Yigw
zT0)t<c_(*g92fY>mw8WRS&~(oql7-g$vFDap`C&VPXs~M#616(MjR#?Rh2hx+!zeN
zK*gflZzTi<{X0e+VMyA`9<&g;jTsTb|9W!U3JzBtFT-n~$ugSukF<(fIpIEe8c((C
zFEiw)W@T_FE(o+@^^CtVaB0M{v3_wIil#LR3yhtNM}PSIsCBmj>We!vt4%qV+IC63
zagB;}{MCE$GjB!u-ZTWWN;9rvN9OvkG*lXn^*-Yoj-wJ>p~bq(nMrmL-(F9BKH;5T
zG+X`RF|mO$YG5zU7rUT*g@qsiN<)N$9p#++XcQ;G0KsD*VvW&&kM{Kfj07kKn$#kK
zV{mKC!k{J%1USkGcm_tO=oTVkK7u30UY@E>hDaoUVV2n^vv|m+a|Kj`B{A~ppZ9s*
zy#f<w8xX?u-g4o_PdifcGEu$;>Y9H(y5QsQOS2R#O6UOH1t{ZNFFnH<w1mjCyW}gv
zR)F)(C}s-PxfL19_?|LDK^vqw(I~#u8^vX$xr+jNlT8RPnfNA)(A~Zhm*EB#+LZ;_
zKBK*-*=n3r(~UG7Q`p2wy&fUG6=OCAT%3LU<$k|HjE_#@RxF8Kc|3o|75zSm7cp7<
z>PxmO7k&O>Pk1$IrpQbFk_cH9UP@XKv#b{^2wVmLC^nRYi~iI-<XGFMSykC(nw*1i
z$79^1?`|;X`tovKT{u6)x8CKAx$Ez4a1Zw8o!s@?(X~&l-j#C>TG%z?XRRFb(w{ZX
z?yB8#{xIob7v~nZcI@vem|0u4J?#rr#E<t3To?Zb*U)G8ZbU@<1mEBo;qM_9e?~@C
zWm-|u&Wch<(U7J&jV5XQcmM!`-}Ks8KQ1xBZwUX@5&j)CS3hVW^a>mi!v9uM|8Ow4
z001BWNkl<Z(^JL4vLmgh3e~0BJVk^&Y*o_IdzgT?li!~AY0vRWeuc5o7-S9^lt2K$
z8)ef<2XaPBW4nGeoZav>03bCZH7Ow}yCiL!e!9$u&>DEnKhSerm#%u|_y0E!XYTxh
ze+(C+&uHe~sC(aMBBAZ#EK;6zSM1}wwd3QGmV7U>_s4i5&|5%jT3ENqVu1vR%rs_X
zjT$JC0;2{h+9B>pa7LE&<&jFNvx>7B$7d|Cw~9sWd59fB@PST;ViJtS2~9U*0eqcN
zOq(&tA?7YxtqjDaDAl1{YWHZS!U`eqACG4xj(sU9od4ePF+;3gw)#d!N%DkoNm0bZ
zD=OYy=#^gHzv)svFxDl8@{{8|H-G-qgomOt>q;=bif-#l@bNC<8hE2@0L$V$6ELYU
z5rJVQ(h6DPGyBG`HyTIPQwEaKBV0qf(?fjBN?@i0JhKK>t4S|;Z@Xlkd<Ku!oM<{=
z9U+`5UG`gQT2Ex{bgL!Pt(R;&x#cqYsVq!1UB1L$70l|HOTBvsO~Vg8&gHjdU(z2E
zdGcNsFLi4OIX!T+#jno0GjO)uLRQbMs9(AIiB-l1!-{c31VyCO9y`%<%F=CK;P%Rj
zam(&*@Zz4?rJ!0AB46x2bBXVqVLp4elUb3Ur>))j%SnNs&B}<W#?qb*Q-(g6-2ThO
z9hp~fD`AY(Gu|_JUD8eA+@AJDPH$6IV-=&&yz%lprbo45()7)zj&8Ypdg60WXVzCC
zB$41BGR`-M)fvWGIp0?oNBF;GL<mQCK)mwvvU043(a@o2(2AJF(T>APt_A=o(iDB#
zeY{vxWNbA0wEL|{STR_JaFEje>`=R#dtCYLdB^Hg@;h>0)J?NIUsGerQ5EPXyS}z4
z?)Q9Mg`GJUR0pe&!huZv{)rd9q4%g<a}h12YUjqQS1o${O#r~hzdlI^<d`+koITbh
zfv3h&1#%SCvk)LkKr&|N=*+ct610f0v1dU))t*O>N+LS)8KIxRz!Si3gUka{83h&%
z4QSX~M2nIgEi^%y2wD$0La3?3EP5ekYiq1Gg<AsCTiEfzo{Y-(Mo#xTGh&j$9g<>(
z{%3h3n*~f|TB*l-D`X$0^t`v&apS3)w4(a-%FcJ@#Y0sC=3txP>zJ+R-*V+M!o!gp
zXo9+aTx{V7I@3+<Z_k;(x9|*UFJLq*!8e;KdPpaMJWN1qIOWg1axYpQXHBvEKz#_-
zKTvB`$q7X-a`U1cBiB?f6u9v$<-PuFRNJU3eWPWnc+sm*tUuXy=xEpJaO>!4#+S#1
zja&KKjB!D+FFULR0HkH6Ueq4y39s@sgg<LoSfVdFqdYoj8U~}`ON*BC-S`V!=Pwwl
z;{3D&GYVA2HWO_Zddv&x_Z=5@XWDK6!2Y6Rd(%_?894+1Y`uI?IND)P-g&B9xBkfm
ze`X+Nlo#YE8n;|LDhPIok$NTsg|CUe=~lY+i!->bY}+rNqauF1t6!W)z*rlPaekxI
zON%lat8p87MqOoQeHAJZeKCK1oU_;eZk{9jyBQI}5gr67jVE&&^B6Vl*W~{08}AOM
zOI~Ykk-DgoS5c%YROhJYdo5i1+`S^hUioZxgKMp&pJMur@(>;_#yn~RW;rgo{jl)U
z+P#<bhbcAVTpsl1qBl2u|ExzWhT@1_TlCX5>mo)a004efZv9oUweA;+!7-~SfrC2$
zy_Vh@mUJd@UjbibQZ=)jt5|?Dav4J#AwU3Y0SEv+6$}irlGt)=Kh@KM3&W+X%EB0+
zPGEzQsHP2L%@FW;#sPt`U&iVfNXV9oLbqn>IaS-6GvEC1U@kN}y)!f5{gt-&U7XZh
zOHwQ^waA>BRh1NNpA_r5>0%3l!?e8Ow4(2m;$spc$7EDwCb&sSAJ1)RKcG+r^u4%)
zRP#f_`>Pfa_JTuA=lQk>-Kh!%0gc`btPxq@Hk(J7PAiXde37n|RejMc^Cui1lTDW|
z{^HZL=J0Mi4;@CET<S*G%gPBWY?^fOJpWe@mmR)jK5SNkm*_bF$Bs0eSpC?_#XdLF
zex9t~dr5x?0PtOSby{ZXEz_|38`Y#0Pap3%VQw+awVktO(h#*K4wW6*pLI|&MmpbV
z?n1Aj^N8**I<_zSs4zhK&&XkFMp_Ztwzu#iDk4`!O})o{X=-{}KHGgu5!XLFEzTw2
z)~y^xE8%LJUXXWf$@_P7OfM}OA3EG`ej_}1Muc#LzavG8!o^t&aVZ`q2p^4xr4{B}
zTzu-!8Xu`VbZX!PCdPCn8nGKDbR)cbLgu(Gy}f?#Ekn>p5jxX(#i_FG>Vyi3(Lfua
zU3=7)$8P$UzEwO!alK#YK{S!Mo{tGkEZ$H^gbn!F$MD)EdAN}#ER0TrsA$s7-qKsa
zkoE*A1hqF1p`XAe6k{!rFGW;cfM<hg6#}}?030O@DH<r|7!A#H7O2XBp~fhPAH(Rd
zReldKM%mV%Dqah-`sfFbw_osrj1;P}-+yCRL2Rkns-!rp4-faHmeNTP<a-P4(n__7
zq0+P}bz+eG<8O;U{_+O|v%LAt#5bN8zdh@hE#G{e6yljtU51P3^$$&B+By&SeN9N=
zVyBl#D`a=UWl12u&}qhR*@ev>RXm~2Gyvv1&OVra$R?gY({734r`~gdFB~GlQyp_7
zdHz?(<8|WF>GH+1oR;nRcE=@nf^?P4Am{v+o6{8B7D5FbOSl=CzWvn4LN{XB#GCul
zN2?E>RUQKX%(7mft+$-$`BXYaI?wTyAx%R7z@f4upZ1?-bj-q0^OlZTG-R9oMaPbI
zpGW!FV)vP}4rI3!#rs7^iUQ-j?sT{LGxnB!PPJ>Yn~T%(GvC|r_N&47i3=Q5#P!J|
z!4>}@)Hae2ctn41>h6mpLipc8zM}MS<JsAkNq3YIyq%2Vj0?zFQ;UgXvD}_gVSqH8
zA2JKPcy~<U{<OWP22Kb(__{JJPXZ-AJVlo7j^jXZn;|$=vXm!+tu}?#be^fs=&g;I
z9<ssE$0d$S%5TqIQLq3dkzIZ%+v}gTA43>1fv7Bs)EV^=g@h1Q*U^Nx*rH{v9XVwU
ztt_!PJS8J=uBq9^bfYzJq0BtM;u4HD1KI$4d#pHnYo4(ekfgFl*8gRf;|zCmKeoVn
z%9iUt@dNBv2EXuHLXvdB_SYXC18FyalAK<a6pkmw$cMj}H!>QN6TAmsPkdp^`)|)l
zD>nj^_wMYQDZ4gb{w<@aA*)CA##7?~MU54~<mBX?xmR~r-Ov}Pln2gCzPO{5D_9%-
ztf{j1g#I(Wua&k~7il-P5-pP0YB++Y?Y5%YRkA>2v^ik0-z&2|TO?0*>i<D`ao*t?
zI_ood?7DyH;8^o6PU{G-pCMlG-Io~+zOANKV@lNCgs^b{fSi_sv7W!zRJz?XoNc$T
z9IgCRagx<Bb8Y6Xh#$gdDm62$!K>+5>!+$r#frFPLmnK0|B*vRO)(Y%w-uS2v@1eq
zt(h>afclRP?>N};9pBe>_1I}tt7_e&bBFsGjPM`9-$V$pfBfSg4|pCUJV<g{3*O4u
z{Evp+*J`g@bqb=bLp?n_|EzIaZ#x9UmmNPVY;@7iQU3^heQD5qPj`>o+Z1aGx3q2g
z$@2YZFs7ra&NfECnc0`|`A46>FxLO3A(&a5-p_UK)4cnu=__AN*jl&E26@+)?17e+
zmPyPqH)P_wkM44|@$hi>JX(2hH@(GBZ`>DgtW%oPWnZA^#U+_z#=1t=x_`l0VDUi%
zFWQRaLm`h+RMD<j5)9~p7Ot~dgag_=5$nshkXE>E0ImHRc9#*nG4>?TaSYJ(N#}}Z
zRLSaSJ+j1SHpBVn4U`&d^j|GsyZK6HYF^Wu&%`g>(frf)nA9BQoagO7*r7;{7Y=h(
zJ>9Kuy>3+nw=^}pw`5FGsC47mo=wLx+jVffkM&zGK15ZQ;*M@xe=F={_^sWV4HF+>
z6s7{IdvDd}J0E_fxwiFdV=lC?zfQZ9mj0X4ooj8V);B;XwH>W-Q_2Pyo_+t9?OHe0
zmv!G9pRm76*Qs)&nw#4;CH})l73yl^HaLN2L#9{;=raRH`pxZ5zq%-`H9wQ7tbvJk
zjC7Sdd%O|CcN1DVjP8zZ9`2sc1iWAwpnqk)_i*!A;JsM+t0K24w{cVxWMG8+&Mibw
zcaI23n6^k$LY37z)<XtHS`Cr6J;o_wsoxyPaA%&}Ybfqdo-pB1)1`g+Cs7_2V>g8J
z(d{Hg#jl$<o9@(LQr^DmYdcfVpnRO}(s?-jvspkhYRWqd>I-={Se4Ghc_gRk-xP&v
z;{zVi)_RB&q7jSmKbAoguwbAxLKqy>?-}D9K4h|(L2}#j4_BQi!)sUr6Rh=J5j{j$
z;j#LZ%+kyTw_1xD&i7nYsm-XM3kNcF^8;6`n)C-laCPp?g4S%(2Ae8bx+rGNsmh(#
zO#8JBl(LRXm^vk^BI`iN{y4v}D+(7>a3%iQkQst`?=?+xc|@e?LY}6UE{<LO($5YS
zGvaTP*yLD-aSWd}b=C9r-IU!!QdDVH8f6^C%DoU}w%)?G;yGXdCzV+md6dZ5LSteC
z@&vCqE}#rHDJ@4<hELU3;k)ZA0IOadoD3P;&EJ&2`Sf_GR{_57yR#fq^R!7Z(*MN@
z-$>0$PP(c6AEs#DTPz!VomSGG-eB68a`oM1liz;ccjKM|WJt`G?{nj9ZLYsQZPUR$
z`+ADw+{4z49=E6Z=K`i{T|`o}edJ45HcNffh*@K30i1~&D{^ca-D+m-L)4>6U@a*$
z9u50=&#wn-eEP<)!6%bGxnnYiviF=;9One0S%R6_b$RvPEel-cEE+X0ud8T5-dbEr
z9P<7+)??_3yNAnD?rj<Z01lNMNvS!uB5vsdw^xR<ID7L>9%{S%SM$qk|L#O~TUin4
zU<M59pPIKS?8RYryqj&meYyGgLBibuvzBr?BP!s<x%na}8t)wljTXo-uRT1hnusI(
zTlt$<gd;-uA4N`60l>h)@{^@#9jm894BjipE{qSnSHi6WMMulA>H=knzCshM^Ie&=
zY)HL4(R%bm`%z_viXY|#5j;xhzanhDsf)U01>WLp_kpvW`!!YO={C#a;vO+nX|C$`
z&5K%>-Bo&)J0ENgnrl557a$k7lLZ~QQ_;E0;#OYj+jB*?&!hkk_bpj9X?;O`Isjnh
zuhU$f5Vw4$iT92*D3R94R)N^kR|*h&8Pe4+4G<`50C2Do5LyO^JbK60g5QAN+*2rb
zcv|9_Wxf8zwbRp&jFre%hD?5H`vJmDzCL*>qp{v}<P1ce%-5GcvNGrGDICHJflOcW
zIG?|?&Ns5?<ah!A@WCf}$w^U3vFPCS)FLA=x20BDzqi010I>1ccbkrX_uhtA0d0cX
zQo_@J)3I}LPF`=nJbp*kwah;LwJDG6EJ`coSFZ_w`nQs<ysjLHx53hn(HahAG-E}M
zvB48kl;2UEI*C6{;JTTX7leVb<EqR0R%EIFtd*gEsP>+gnRbRbSIMiK=lBYxVNdj(
z83Tjo+0QCamhJiNkUZIbfz{OI5kpspNX<+=(er7eSJOPlSH_5<^4bfj0n6&-VHKdi
z2ZM6Rsx7O={gwPO8EHkJeaA1S_`bHQB42*h|Jncb1ky_j$A?A&0Mg3}(~AmFnFzO$
z0RS=^D%U4HJI*`sfBnuQ{7a~4<vrjLLp&^ZUmOv_{~Y$_96Q{2marm+V*&yIa+>o`
z44f+%C=M5mS>pG~J;EwV^hI;7%)@LY5GO`k{FnI6{j<E@<)-|-Uw^VJd40Hj?3^zb
zSBUGTsh>%V9(TO!L^&vTNptyZ!{wuu2Tv=H(Q0OQK+0I(xZ~CPzY-s9JJpx+(r34-
zJDqMna8<KM*JycCy|`H1-r-YbF6hwq;IbqKpwi1cK!1~j6YvEhBg&Y)d%`k0Y7#=C
zEjno-)?v!8?f5wR#S0%~mS$d_@lj^4`IDc2VKrLyp`9OHtxGSfOYn7jXGZ8l^S=G%
z#8V&au77{E?~RQ1<OH{WX7K?4AMEQ(j>eP5TBjDOADZ`TQl#XU6ORA@Hl5A-=(BD_
z1dQh=e|+u7&0iHKhIoFv?&a;-KY#M$*M0BrdH(n(qysU!o!H%2f)fLR04qZ!OJMDo
z2s`)0#ymw;it;;CjY1mCi?oaOud}g=6(3VvGHE2s1E;PCcnJWozv}Xepqnn2hs#q=
zX-+R3wLqP(Ic2_p%Za(7>8~a%J5YT5xcbuKQL`3%%mM)9v=o*gwINE+gz(?L${a3F
z;V5od<kGyZqIuct0fH=XpS~jMPH&ow;;h?y-Iu+2C-;}1#Y8w`LRk~HGJN{#xM7to
z+<NJtAlP~P&*u>wTNV23tt!4bJ+<3^JeSp6o-jHp*4AevG3o!ml(j!-Aspj2gb<FL
z5&nm;{mR}lUcH@O_Bf3H<jMEP1&_VsZ0~N~&e*8UQ#|eZ#N&8!eDI%Uy(&<a9BMez
zjcP{ILGOF7Upa2Eo9)miE~y!5G2Zdd1i#d28F=*b=X%(_d9rB&7xJUFk2?lB4u&3B
z{phMiKg_v-{}^Z-y-xb}xUhu89|CKIrC!}**86-MA2uEUkk^v)UFR1Un3JQrL)Ln4
z{ZgG#Y_62RUTr&+jB}i8HK$BdFwpOWh)}9gfk>@;i-n$kUhM;&PkYb!Qk{z!22RC)
z@OfM9`HWm+4Kg)m?DDf$5`4X;N5`aA(p+EFsS6p2(T^sDiCg<^lOhBND)n^1Jl$pg
z%;JCWNkQ^B=j2$Cr>o#bW_@z3%X>=$=RE7Z@kH-Kb3RXuiX89O3Dy0JQ>w>DjDG8x
z(H~v<1)%cRABhLJ;NvSlZg}LStv~#X3F&>)7GEf>j(2cW*y*F}6FptzJM+F>JK>ea
z>K3Jo*-)+PA&vP=|Er<X?bL!wq@a*)VoXSkZE#LU>9i}aL53Ua78>OcWo|WLVto17
zWlKXAW)x-qDo%$iTpBcASE@{DIDM$%1g)Z`gg%qoQS?FE{+-_)TsiipnHc2|73~}i
z0C15wX|nnVEAl%_8bHw~t3Mp|eWOdC_1(JM?h<Fr*44`SzUvd~6837uY|h9m^Lp{K
z{BMiVmR*^rPyrrmA9C-G2_ez3_5qxUW_9K(4H<jNzsl{d>Cg{2=!w@Jp9MMS;q12K
zmkWEUuJ6jZija6_T?wFBH*3dxzwHQrA9}T$9`J|`vXL{w5r!hCrLaI#xgzw=FX;u!
zl9cAt1p_7bwgLeF`HIrnU#&neWQOL6=CH0}sv^YbA7b=v@Tf0k%7XPlbELDy0m2i_
zhbytt7frL4#jOMYobEVys^gG%PsowyF5G&n=rjHRfYH3j6EB^gd1Yy_xiS`W$>}Jv
znqWVhKhxMo9qza+^yEk2exdTjUD;>Hx%d>CD*QYA3UDncW|jxMO!pdh<o*)lI6mHr
z%rR2&cCt;ED-55%`_a|9w_ot%J$A$LL-L0yZAoLy5b~4b-2nhMGMbYU{#`NGsoAw@
zHBwHMg*ioSJd*#;%)qp=_N<oQ#`z@wxZ{aQd(T5v9h8I@nhV#4MSOhqCtPNJcgABk
zid#6NIlJZt-w9nYX3p-iuf;x`sYZc2+j2C1;nCL-&RoPa9P0QYSmAbQ`Y!hm5=nR2
zBFW<$rYz5CFCFU^dTRm)OOKq=pPva{dUf0~06<FHnZxy`7Q4?{;yY*B>BZ&ZCaTN0
z$aU)a=U%;g^4qWOO=&$R3YIVSoUzpJ_a|g;?x*|9&XCT+rK6?|f6wz4yR%R4`t4J`
zzs<_9X_glC+J}Y?;kbj0ih?|4eNI<(?m#_fVb(t~lkV26e{41Y;FGUU;&#%krt;kW
zI)EUt@=@y^o*w5sQjh-c&WJ@g!v8(_{blcz?>W?X5z^4Qi+{_AJXm>R=A}j7TW;8>
zWcRiLb6N`CE#8*WdM=y@vh5e7k1A;I@9?X49qSQ!k$<scpktcp<t>vw{=Wa~Puf3h
ztZ00GV8-f6>i__!I}R4B@)P+}E_WB2s#W8HV*vn1>W<a&ij<k!ccV7{qj7hks%#eZ
zj89ZRjZM9Ozu%*RC*Em2$+N-ePNiJw`lTk{T+z{Q%`LQ^d{t3n=?2DD;cMd`Tm9QL
zMlG10G!Z4y){ahByNL1rZs|2zuD>QJDi9hJNm0&8Q8G_An^T{6CCAwT06g8T{<RBx
zBcq|UTkPqIrDiJuVdrku-`3~w?tJgWK;-mytw|A{34S3R=4KBE+i^~^EkD=0LQQiw
znpu<g#tYNa8~P!Dv9@En=>F*sPi9n>PL6Z6^JwWe2t5$0SwXsqFIQwv_DP-`@F=uU
z*O|Pm=F;?eX90?&D8FSj7AM5|q3>5@l;ydK?cJ=Mq8%ecOaYU_Z|3ccl7+Gw`bf)}
z0!7Ipm+4QC<Gam$KT8WB3!`mA@AyOF17lalEo9VmO7pq>g(n!LWiTEi)-^mr5a3MO
z9cs9+C;J2{!0+oIdOKs?Lf4F+YpU!g?1TsEKHu@fQB20WuYu@p?;Phb`o)k5YhtFb
zDg!1H?8>^lr}WD;(UZsdhsC)DzBD>{?byjNLU)A3UK*YJ7e25N{*UO^ZGs4RkUx&n
z5sPpH0000P#aTs6-TvZJ2#H0C16Re*k9Gb%9rNM(lLtzV8>%#moM*nV;7@C@W)x=~
zSASMyt_<e~g;Kti!kR%taK82Q6*aF4yoDj=;02==#QBW{0K{Dn4U<GJ@Ldw=cr*87
zsXjlosv@QP^WZ+0%L|VH0QTjdINEo4p6L12$%|k4ZFOE((JbnjH(psEc{OS@GJ0{~
zq62MTl`$ojHj`fGEwEE9b(xf2*NG4aid)7<#C~}C`?bD7{L$X2nHj0Ig!aUHsp%O>
z;}iIgeq#P{!$%hj*`Dsy3YZk@^WMS-?ILj_qaiuL=flIw_m)@#05+a%OwBC$`RHW9
zBd>q|kC#9CESDJNoZ#uO^}FkdVJ@6mnB7r;ifyA<qKK_qpEN0}vpyjxG^4UKx3l2Q
zXQxoz`a{Z}X(hPu=<D&mVS5Ws?khP@_0wk`+gwOB9BRF`BIqTmOMkfc+ep68#h11X
zIi)Sfx23e5k%U_>cAvRCV!^(`6Gu8OTG|bNW*Vkuq}8~#AFMjHJoJ^IK9Aea2>0fH
zdbsT}YoM37zdX!(ym!2FG1juL<N_)pRz}TYl$Kbh;CSyL;xvXNqoN=oWN2^LyUA{^
z*>dSP>1hu*4ssB18~^|zFjRQcE=eoQy|#GcSckvnJT=1qn*3h=10FHj!F>0{5h48V
zBB!PBV8g{iLlr$>3Q@SNe|mX*;2*LQ=XDmM0*vZ0#|PajCHMZq6DjTISS|gEaPoni
zLpF~&8ftZCrW}oSj5yYI{7B7F-!`8`feVwyB>@0(YO(+TV*}#%WS<ISy^<0V0RRUZ
zE*z*lyFl{nnu&`50EZjT9jrMssDkq{*XFhq9F5u*?;l&FE@Dkwv{Tf~pWeFh%dhL7
zTC(-}=fXhgsxi;fCRs*xS>hP~ZP(ANdFWMWq2fJ4wtasx-v1$1V|r_H5&&THwF+p_
zy*)J!0Pw-KbIB7XCPg^`08+DBlHxrF|CWD=r_AuVkzSlUKK!9+C)1j&e?A=Z(fQVQ
zX1G26kI&zpHR0ngZcG>}d@Vlu=>wONqny$k2iAxC?Wz53O-S<g^e^6=F+ZcSG$A;2
zUF_pKemFj;g-dOc-k7=s05JWF4f(p-)8pRHYA8w>_-19q^w9&3hX<}_R^?xsx;<{x
z(7JM{<|Kk4gE`VtGtyF8&R5#DF7}$f%zx-AfPc1A3II4zappknc}s_WMd)nOMIM29
z$Bp`Hxy^QGpGL*P-Pz{=hOUX5PIYS6Ju<9Njlaa!YbS9VX<BYp!k9>CrU3w~#s~ly
ztU&<)i1!Nqmk&C^pD`kYBRo*He|ezNt|PC%EK(G-JZQ%4Cg6R^ZYs)GSFMbg2>{sf
z<-Qt^j_mrpfHt?!*PWjK+lnH6S@*e?o{Mb&fFf-%;Gm`35*K)<_sz`fuV=TFEcbqK
z?IR0j|F}N4qiBKj`PZhr3II6Vc<w;u>G{$ZRwpkG{pMjtLk+6nV8<6Pf1KC!BW}ez
zG5YOk87ByViRtJJBO?kB{pH7AnSAoy_~1tXPyE%=m6Dn7y)n^$^OrXaUmgVjq?Pq;
zI`h+y+isp<Z9Lig?p%k#*B|a_d~cQaKeeF$1gSad)It^^S`(uKK006U_H&|5SGrJ<
zCau^oA<^dghAEq`e7E(RAK#uiDZQ#IPG;U&-MT))Z)fq(uT6M%>(>|GoH2i0?BkQq
z@5${iM;P^Tmxl+naLU1DrIOCm<KE}Y?5rE_#`{K|edMFPB^UP=UtAF|d3D?@0Kl}X
zZ*mqU#wKvxqeCYVy{~Bq0N7u6;z;L(BcWTydi)`k+J{><*}dq!ujF*3Fes<H3Kfx2
zl7MqhZvB7koo8GVSr>=TB%y<XB3MAc3J6FqA<4wH_TGDU?P3FIVF?`(?7jD1vFn;i
z54{%!QS2R&PLg>)BrhdYUDtKpJU>4qH)m#UM$MUX?>YbTRX2y55ifj}re>nMS#%1Q
z;$P(vg>Q2Ck5U9LvK^7mRC^b455<*UB|jTVN2uh-F^BCXdX-Yld3A2teuWUQc?6G>
zc04?r@FmAV%lyQ!@L4xj2p-0{nmR5qpG7uzNi0f@Iv>4y=*sef5|mO;xs9KnoLHW}
z!fFBl#Jx$Mao5MyxbN=<qY3JSS$Eb-imQ*0j3Jvl3-aRk*E&B*001BWNkl<ZJUu0P
zo-|*3+`92AcRxNBb7!aJYm-ZVoR*zu;@PmovJ67ihehp1#)(UKX<V|g>1z7I372-S
zwxWWj5jQtS@FM5J@NxVv>e7#|BCu3XCo{hV(*Qty(DsVE@_s`DS7hGXR{Nxn3E!ix
zElX_wO<-}=AbE|t83!GFkJ?u;w{aLNsDu5k-ie$rG~}}HRNDs+l1c5WsaCxa6%sok
ziDuKC|E|=lzwLyJJDiAy!gmkX_Z#DCXf`Q!KS8COK=@);*_l3Q*czuHTT@TDbhLIc
zw8FUTJs+;~vf_>p4o$4g-}&V7@;(z++DrxjBY(P@iS7!^2_EDbjZg3Yq2YeV2q*oo
z*!h#O@xnH3TYbw{T~f84Mc>`8-cxT`&xtFnrnY=!1EOvosOu5Sv)(q<wyB0_{<#?8
zdAv$YY_E-1O8~&l$kNTkN>W@d{ao&DZm0B)KNU(xsN}~Xe3mRJu979Bw350maD~lO
zSEIf&uPj4UiRHPU&v`T{!!2V=+{x{aF55%bGt;BCCLZ7U_`KEoPUn~GioU&jU(qFd
zQtuPvx5_Mg?QmDo*VxxLlx*${0F!smEqkjeDtdZuoEJ)=Zce+&O;1#7Q@pg>gt+QY
z+_Z!XvwQ(y+|g*aF5M~%K1Ic45Y$V(h76aA^*~hvuc$;+HKb)a)Lt6wj3R_Y^qpi5
z06~Y|07(4jb_RfN){*(XVEo6RVgw{HNGk{Ze#LLLLCD3=ccNTEFF&GLX#r6a#Fc`#
z`Q%O=`Gp0PUS^02k)4=Cv+5*x^OF7Wy^3z>Iv2XLhQau=+trLU$sIepn7VA@T)i-3
zJ-KV|nyXAYxH4Jg=~4Fp{-fj_`4`vpo3q?vA^>dWAK#XJ!NYC(3d<%%uD2x~T;b4o
z)c93w5gv{H^MHm$`xTZ`Y|4zOb}hH3Z%EY512lbQSX@mL<wb%95AMMdoZt?@-Ccsa
z1Q{T>1()FN?(Pm5+}%C6yR-9tyZdL5;dzGc+g)|)l$>63%OP4Obxpa8pQ+QsdCiB2
z>9bt1mDD8xsP7J`o0f3GDyJvAfJWas18MngaQAERWk8jrrN;VC#Y2R55d;#NIxd^@
zr84bracx36p-V_<C1;6p;(vM<QYwj$ZHq6i<6JvJ{uPGdxZ+8lSvKvDVGA1$pP!1m
z%WDhV-dwRo`WNsQG9FW)iMsIfF}i2g=P!K3rFb+`p3O4naA2xDS>Nz@I%f%8aN{o7
zFM5U&a(=m;gyCI3?}P$~=jC0GS6`2`3(sP2=c1MIkNMl-&}K4gw}KYR4W~4uqkaXa
zk6mS$lpGzMcUi!VsiQS;BJjM7`^dus26jUR<yMsJG2p8FI3HaCP8qVCHVmzF%D`D1
zRbE!t3;b(PKoq|So7zjE3o?I}6R**UL08@ES+@t(B_z$=0$OPJH$!n&`?aIh7Ej;{
z-(A1>xYrzN0xoq${HFw2uC_I&zq<{U0TKfb{c7#}f_4QS_Q$E#h*?Fg1h*dm$gJyp
zkuu3s_ULyU(FRxKwKmIzl{5qlZq~2U6>S*@w)18^QX0m`YIi;|4(_`xr)hR)bA(HM
zQUke1UIlF}d2#agP3q=<0f3W2;7w+IKEF=rvs<%l#i++Qx8damiyD<+Y}Q{4+7X&J
ztdMmRH=486w+sLLVx!vYi^5TkwWX%(sTMs2M!fjrKuspS8GG*qR6T-*-Tk8S{gXv{
zF15rf|D!JoWUH92(=@hS!Zq$8;Py<^JttAW4Ate}rK)6U(l(0ghdEcYQ4$NgOe|#&
z93t9vYq@%SG7nsacB0$ORY#H9iB(g`)9al$iFV8|Tb`plnz&BW#AO=2I<%Vn`f`FX
zm9!noPXucp{*}LN&EQGJ{pMp^g5=@ynN|u%frpNKl<1Xi_t)7xt%kml^>GqoLg$By
zcOn@2n$`L`q$4XuCkNS!p;^thtjXErn+3az1w$)Yz?VWp)l7kz$NgX52@7?$neTEj
zJn2}<qmF{89x_mLd+3>dy=oo^8vNChDMmqY9&V&DM%c1LSx_{@ra=S5=Bv&*b=y-1
zW$4~UYUuHZPO5J3IAHjbku*iO;wOXVlFow&8e%k(Tu&!WPwlTCTSBc0TN&ZJicxpj
z>$NDoDo}<zg#4q=<$aVDtLvB(v*jJ_s*=^(F0V2JuRJZa8XVf>H|`SFp1G<>JM!sw
z^qSV!nD*ABzKpfK#L6gAIK;uqQC)qRoXZYRs{x6<!NU$@C3SXbr#Dk=MI6}PT~FWJ
zFs`iCHiYI$d($F~h-h;>RXWdISaUsyyuZ^uUW%@*W))t?rjhK=7T%NVFx?Bt%W28C
z)ic&?#}H4S`bH|SDv{ABRqs4TK1@WP#8lEeJrBzdPAIHD?$R>Rc{>E>=&K~kao5oP
z`!|Elp`x)U8%GS5!#+75an90h;~0s;J#%9y_kOix;2{BwFpW9axj}a6G~i)!>dWQ+
z6`F}C{oqy=C<B$xdsF5Bc$fr0fa_Q|xc^&5%R+MAy1@e=v@x2{m^P=~K||_*G$Gn(
z2tfhNjL~N1;TDhqGx~24ElGbhXHkJ<UO|?`VHr3j&PQaNu0Z+uH#*M86(M3%5A0<(
zEx3I{wD%7k#T_&LsJp8x{3esJUaqbTyStqd^(bGdQ%};jZ{s_GO|x0+zk3u5I0{z;
zY-G>|vu7O|xJ<dri&??{u*U7+eH-Fqw$Z>l3bxv|tlieDqZdxWQW?utc@gC;2Q7~}
zN8^US!EQrER~04Z=-9ojIoDvC5iLBNF@eTjqZh0D<!`^ty}}QZpxH)mHR5G;mo#d;
z&dk<X;3G*?pA#4O_-Pp7eJ9F$8@<{R3)}m^(|T1#t|u+K!kIO_t!gm`K_v~To8)br
zmPgLJg0f*uLn|J!r{xPP1uCQ-B^Yy^ErI(#639h@Ry)0P?pj^X*C7Ii3?$0>`jvTk
z6fu&Y`m6NXIE?;=q&7h$zt`8-zvn2@CbTv;2L=W%LUhT-FBKrc@>?pzUfWA?rBMFT
zy*$X{FIlOXf*NZU0v0ntt!%Gr?PoCUg;h5FHgyL#iSbUA8Bav#`^RQBC_p;wTj6u?
z%*{HF<t@bChqlf%7Gy-w4eJX%RrDi6cb8c59%Tk6rEx@dn4|m}O^qQTyZ5It)o128
zlb(HLHJ7MJ`qeoIpPbj)vaq-WpnD%faXxPaZNW&0p3*P3Ap%@lOj@pX9twEOl$-M4
ztWja>*mLoFqWZnJHQTt96+58vH&weiy@SEoFN!wCu~q;wMgy7?_k-I3G=LnQm-i!v
z|E9y>Qs&Tv0_XfgNP%-I9q&Fx;>D5=VnW6ZM!3&*lf~ce5Af%wS)9AkWle8*kT0yW
z>z{x{=5EKoiS%z}_o{S%9(y7Gq`9E#9`Zoes=r2fhqwZ~FT*2WFaH<{);`|T#IE3Y
zE7wR_Ns8MabFPL{{!3qp`lT4EAdv~CRiZxLn%60+1k}_Kk0I*|C8W~`eUtB|Z}YQt
zN}P99j_KN*k#WUk0!&oHj}_oh@`~7zE3JA|AR8CxcDzPRdmP9$y0@L+?wYo<`WKhW
z4x`h?a@gi(J9hkMEsd?s1#&PPT~6nQ`+QjT#xrD!W}v!PR@xGR^9u^3C}WrE%+t~q
z;x<d3IVdRlhK8iX#7xK2xw)c91w0q0rj#f#mzKQ1wJxlx7%}ILnOz}{(H9yNL0*(k
zZ{#S~cTu(;RrM*`RyWuab}#LpBKqz!S3;ORb&jtldf^+_s3%8XmR_q0{LAI+@8Q!e
z^pMkn19For5keK;F7nDXtAj$qCB(oJOyieOz9BLajRG%D4X@Rp0P4D(htR*#gy-pe
zyp9YI^RT_0GnUfCS03yhnF0fBX&6)3t#$I*ev{7m`K?ymZtX`sr~BXj)5_LVZ{&R_
z-+qJhs})1?B*)7u1u|h@Az0>YXRn@L`S8<7hXbR)#NlYixl&p5mlh3!PdL@69{^d!
zz*a9Y!u2i~oOk4m@&LpzzhXb0GJ{ZT`bIJXkRX89{4n3KCIVN{yv12Sam2X6KZn<T
zH&3df#3>=KF8mM~czjF^-5p}P-_qhBuoLWYCj#Xgmq_WRwaIP52Z-u&*HC3OEt_>e
z`Rz#9Us8Z3JD6?tW@ey(#Z*tYBuNc!`42$E$a<m|3*uK*1QaL(ox9%*xp8IbMHSUV
zKUnelc!wwCA#I>m1-HBZ_86Q~?BfUPc-d?}HvP?tPgKhy!qUIZZDuDgj13|~m>v%K
zd4IMh0|CQdzA&@1+YXE4ScHjwHa9m1(2;)I+1Ulap|m>fkGrOvc5KgcK)vdJv{9KK
z{8G7#`&s<wsPhPVz%Li_HV*GOKmVi@75m_1l4K5Q_m*CXn528>tK2jj;*P@}rQgwk
zRjmE}^n3Z?se+G%&Bt&8Dk9NmJr15b9jxLyxZ=9J)bC&3tOmNJ(r;jwbmXo0XxR1d
zQZr(5+Dy24sl@IYPq#s%r@RhC`@7hK;@=sI;E6kb7w{u@CaXAAWMfU3FhMs}L%W)f
z=+|x2IS~1DZ#Nz3zX*~1%-Z4_$Mo)XNC!_CQ^iAmSj_^5(HVp~!c{`rEFZE#_nL^0
znon^(qsX;+-{m(@Be5ZWG(NnLdA4NM<9IgH8$^S)+_Kbd&QryVJ8&79UPj!9^V4bC
zgw(-FnKQJqfvdyf?9wi{-+rW{n3=@eOhN*!DYJ;iR*GB2m2Z3W4z=$2j*r(+X8EwH
z4FeRiMSSXF5V4dwrK3C{n!fTlw*NQ*4Rm<i+eQBC{f!J!kuFfSWaVgWZO!0yt>m4q
zF_zHNTkB#2^Q^v>Uk1Fh@t~NBKKzh)ptY7cqSAMXr5JLP>%vE}QtQRVkCS(60X5XX
z8&`dmNfVq))`KdmfXkj;*8G!{hLhn;ScO?tLn>R-7%kOIg70zCO9ZzxiwSV7^FRWY
z+WudkTGEWDX{a$HxgFdy^nPr#H~~WDs~<O7SUDqzJ_0!l-@cmhq^EO+gau7llx_Ci
zmw0_tqM?JF`Wyd^_$cR8Uf^T$C$IMt0>I$xX;gC>2hi-jzwxPbQG~+jikF{9TD{>i
zu;qljOK(a)XLR<8knlSK+p!`b8|Jb&4?jGzhBf^BG;?I!O}Z{NyeDWwIx!LZIYNYc
zDLPn!q_feD@@RT+nv;e<)QTbcE9ZI_dWM^M<g5KLd=$K|1AM@?^bdOL^G*H=Zl(Iv
z$&1+#vZN>cUY3^~ow#u_Q4_7`8jyxG#l+cSricETE@=|kox$GvfYeos5qrU9Dp-8W
z?625{VEJ-^-1kEYU4M^exhi+1c9+e2jg&_!OE1xb-QC$vujj8Sh3UMmXa7c$%*@PK
z&Buv&U2OCSSy}6nn0|Enyz5Iyzys3K(l@uaAQ0$Bm-nllSy==^!b_h`J81EXk@JEr
zmc%#Q8ZON|j$Tf!3U2Hw=7nzi<z#-p^!mR%0o*}8qhZ_n2_5V=1m@K)Y&85ep-zK{
zU42`8j5g2D)01`krWA%6_Gq`ru^p%aq_~dkFar+ksw6G7+ta2@$sRk&67Qs_XC4D#
z9#lRZdMw&c6os|yKaM1NF|kMVUuq63Prxwp-=cOjhk1zx0;0?fOYBW|N>zW*zhX!2
zh)_&aJ0Up`p)EU^EEZzbDscb$z2%zr(X)?<l=UKo1ROWuuarKLk+)~R{lnJ5eQI?_
z&a0mL(7EZ=Sd_FDyPsm*hSO}?BQs-i=Wn20FtyD{$0yLfK{&3}V1L?klUWAm8c+NF
zp;X+2TmMB`dMGCTWNS!uX{ofFT%-`$7q>uer@i?2_}OGJadGJGgQ>hM0k5Z{xw4@+
z8W`WCq=oy`(@3UN!3TxB8Ab8HcQI<BE9ozEKab~|&S^SOX0$`Dk9tSs%pDdxk*)3#
zmJoXxxbZl7=lasm_??u-+?-z`Bbz4N7e8JRuoDBhJC&E$tm=3wibxG9*AlD$9H;BJ
zzCvfEu(rdYC_cnzTwOHH>ClnbkZ$_~mB0V4v4R4aUDxyDPAwXVL&ftbC#r_&Q{V-@
z?KQyw^qrqT)6l-%7iCa{;!r?%nnIB?Jb=>`A^$d|kjLPUcqQDxdX())<=s1yHTm@_
zK5%nJ;iWJcTIj;BEj^g3iK2g)5^S0kl-}Iy^ZM^;86RMt<xRG*_;k!tG<EGX9ouhn
zeXmz*1v&Eodacv-Jk2V~3{Go33jy}OLw@5a?b>!?PuXp?K+$6Nw<#w#WI1ORMjb<$
z=AbcuW0rCX`BQpDTCci;`1*GDhUbU`FB<QEdJrm<t4^dt;~DRcCARV@mXV^9L1=fM
zN+NxA-CjtriNs}<GRNjmv5vy(U+`pY0yeQAO+^I4%=Glr-Kh*2x~G@dKs4z_febEV
zQX52Nltv-*<?Z>r&GkGn1p*!-2|4HGx-YM<pLe1KLqxYB&SdV2G^3hdIxl}K8-g60
z&;=%luo}|$j?VHS3ZNlXlPFvN3hl$%hL{Fjif3C%YV|nq91aimY!a<`vCzui*h!*@
zY4ChLV;1C)bXdf{SB)TM?ziHzf8OsI^Z0&fNGrIa$4J8;ZnY8)IzJnm6fX@AddRxL
zH%7MNNgv(sjQf}JsfXt3rSKksM?D0$fK~k?Jg~QJ9wF8bpyQ1dwYi86t!clr`!LfB
ze_fM92AE^;Krux>jYIzx2f#sWocF;S;^PEA?>{QuvcLA)OaOvFuQ1#4qkL(TB0kQ@
z)}BDZWA6na-u+bEqFP;AtDW;p1-rb6)p|eWdc@PUC%6yysH3f%kjt{+)L`l1Kr%Ys
z#k9;OsKS9n<^JbZn(o$!&Cvc;!%Y>IeE1geMywkgFrQu5IYtZ(FtK(%emW2j^+@^v
zVBL8XyUfQVYRJ%00c4M=r~s0_r&Q6_#?QB`V0E6}mzS5hGL4B8R`b<n2lfClF)?*@
zb%>3M2oHC1c82wZAb7}KGchx3w48wx{xgv!sH3S##OF3Scl$hB{Dn9t)(0gow|$3h
zqqY9Hb>53|uAc;OYq3n*w)+{oT~+>(I&H43i=>SgU5Q*jeM552N{<VFiQ;pUI|}J8
z>n|c8P_K2!=lXDY+p^uC=FF@R#Gpk)l5s@h&Va>4ca?FXf1kH$%<auO1_j8t2Q0t;
zQ1sX!?El_ZSV`E-!f((4QptK#seYI^Gyz9NYdYdfmMOyP?Y$B8Lp!+)%cNF7PWxaA
zTl-DqMmuDp!qBh2A@@VpaYp*Y9scicT+_Kss$>vOfCZ6rUU}eiX@0TbM3oC(YvnsE
zfUtyJ$9>vb8rm5=c5&NhrK2pW&s+aGL_CxvjrPoP99)n7jTXI+m&EHm#C_r}HWx_)
zi*Th@o`E(530VbQ?KAK*?t^tOqgB81pRC>aj+RPXykI?7!sms&TaUm<$Aih7U)OuK
zi`C@x^z<||19Nj~Dk|3yV+I5F5%7J!Kc7ftKORY9@)X!ue&T%*ROb0k^$wk@nZ$W%
zthWr(lOZ8@@&l?veQdFwhqaFm8qO#PNqVK^^6x+vT>2B#6dt=#BALz$1Wb7Dd&(zQ
zOJBfxJ>PDuI8>9iwvj~jR?O>l8B;R!MeF8Kcv63p!KP4@`+;$$Eh~ZU)w{r&-ue<m
z*r0W!3;gNXqIZPkVgis-&o&)Y)%OgLNq{iC{?o+y=xSU9Pg<@^!&*R1^9gy(uO=^g
z%eyrwgNq;vUm1IeSsjLtZ9n->wkxdZ%ySs!`;sx(aEnj^o;g{e?A*7LD>~UUYOUex
zlH*r0^UUT0gOtiy)8dR5P|}YK`OBlc{11%R=gSw_>%UU9^KFQcDBVYuIonXYDYoL+
zaw|u0)v0ty@J_YaY}Gki7Pz5+3N!vTr)WPggwjBQ84GQfZaOgPQODpO>OV9=_oz6g
zlk0EWsyvno+->Rw0g3hH!v*1y4|*wW33c`Ltyf^&(u}mUr7pLI>#~RNC}u&yE{SN8
zz95t~@7JgJuPTs$#%ZTNGDjqM9uIO|j2|wxj0d7R+%C6&WS#yCBRxeJD5is433b+0
z*I&?|l<1!-siMhT%OW3}mr9iG$16yA<~k&-R~mn3@*!h}PRKq+Q*fRS4JNNGs555Y
zoIwGG3uof157)yt7?Ey0G9^N)m-wbb^20exBg7<5Bi#OebsMT!37wg9B{87W6pzeJ
zQ#2U$_dDAkj{|*1MU$3cuhq#qwfJS9#K!%j+Ap*8m_|_qV#bFUTZ!q>phT)npcwD)
zRjO>*Ze|NY;2mn{%y;Gz^6p43Gr8u=e4IS$0W!D8!3rmZhj;fw+VHnbid|43%h#GT
zO>>QvC{39v8b-*SI4blQSU|~aD4hri9eCLu$tus0EunpBuAGZ8`grcPyOfdIm{In_
zON-M}n6<31xA&92OM6&O<AtT;_aPB~o*KUMnI{$*N-^wlICVQS7nW6u>1kSQ5!;9n
z_0wDi_n0Vj3}s%Fz(C0nZ~{|jdRp7uQZ`1%(vP5du3iZHkiq3(wAt;at{&F34N)A2
zAYq8Y_~)2n$itwbq5^}#ASbJQ<&vnVsK&;-G*0`sCz}cNSBnoXQl(%N_=G4$DGD1*
z{pbk(hJM59g~fit`o_$VXWjKYe^4a{+e#;dA$Syji1g4%8qZl8_Nfh)I9p|QM4!to
z>h()6Pa>zO(dh}R`7NDAHJ8%1XnB5l<ysv60Wb*7QiSJ+P`e5y^i?S0Fim_Ynp9Ps
z#chc9aRFej7_q?7HGBN<f7`{H+dA}z#Kwjl!O@#_(Uv&NY}PGud7aE|8yG#o)5nB~
z&_a~qXb9V(tx!S_4T~rg5<+!@^D+y!S=Gx*BnaaAytPz2LDog<B=dd6s0~v(gOwHx
z_atdpjFq+c4a*LziS=|-Co|U13h%V8Ar4DYl7=?{c}Ht26^_Zuubs~9zud2bFTU+;
zhda4xU55UPR^_o^JZ3R0=&LWJ|2+XA&Q3S?hQ++0w098bXlb26p#6!gF5>~z-_fwp
zP${zd5C!q|4v*WL8&x$mLLNR55s@0rm#x0wE&-ha3e_u-Eq+<Z_I~wzH)$BlMp4n0
zjI$iOD%^g|5^&-yS=cAW0*isoLw<BM<DW1QB6hjc-P}BCP9(7FSL3sJUo&=L6*A*_
zmijJtAb~2AT>Dm2dNr-Wsl0`WosXj6&%U5(sw=EyQWa;ny&k-oSL9PW6vEM;QJ^;{
z!n5ynE=2q$PI-1z@_<PhsWO~QE%TnKP=x>WUGX4+zJ0rnKF%WKU0~x-q-5{5k%YqT
zeaI`mYki4hdtC3WY$40V#@4}zC6rTx_hSWTEG8X8h3>I{e$Tg;*)xkfOEuQlYgT_<
zUL6~$HcSex<9yS-+>Nr^Gjx-(LjDyBSd)T^+)7JU1Kq|{OC7DU$oFp*x&*|`214%c
z?&|7^o!%YW%MfQvBIy0{aJe&6q;S5`^&S9^_9@>S2??ncbj)GU?dx%W_IkTS3$Y}m
zftyQxU+zq|+MpLu&8&wg2F(&T?qAwp{6jp@{!V1AAs`jw@9y#Ax0qI$`_$fR{#wLv
z*`j?1uYg=Sl&qY}oN|(!RwMI8`0h8>n|=2b?Mr(GoPdE>vw0nkkIVP7J~>i-*I(i%
zIGtJFk)WGQ;mQvJs1l&i6+LdVUlm?)zj!YRk3_Gn=@T{w>ks9o5-NHeJAFfj^RT^6
zW1lux?rOcuF&~$x6(fYZmzb5@TCjI}<@nhbLQNR!36oYm^GU`d3Dt3I!s4!^VyQ-y
zzv3uK%&u_$P7O{!&fETIvH5<<twB^-UG6OvRZjY7I-Vk(!&ci6Lb;42bYLUELgvRq
z7zQ4%r~1rH5@3_76T&q>qAHaVRh)1!GIWSVW;Gp-hftHc%|C@zRIq^I;o<&hQlI1b
z3Y8*xxs>VU{y$^c&VkZzF0d0M;xub}h16WChi-DI8gZvr9R>qn+fP*FM+BK)Ql`sX
zY@OT|&E(z1%lDC%9E(57Yg5k^{<Z~Aj&Qqy@W)D7_4S17SQ1d+vIg^Rr*fBE2)OK5
zIs)j9mW^|ZPGnKuf5AnjAOG+#=QLc4={{KXW$$2lGbRHS52YHONgC7FK>>S}s{OI<
z!e}^2D54Fi*@}KSei9a_^Xn8xuXA;ADiWsxyZqkuX@2X2w!B{E<7BQJA9-DIKn|Bg
zUp5RQF<%gY?FD<zh=libF?~Uq$tmag6CtOUFw}`}xl2VHG`h~m>lzRADla)EuOTfY
zs5=A=tBD}*x&umK5mVC*DF{e`Z?Kb|nySkEDq&$~mzkEPa}V#c(diYA%f!LVj3?mP
zTv^E&+!q=ie!S9jULcb+Iy!2?F_Orz(&A*^WVaTCMk-H+UiqUdGbxGFd^{a;c0Uig
zPL2rBzD<>O)k%u|XJ9WDOjdi)BL;Hr&);1GeZPISTSaX1oU>juIA^(alz^nImWE0e
z_%+x-*&k*9__of)IU#raiIOSvqM3gmlJ^=Ir@c-q#e*Aa{rJt;?wk68PD7k!g4b=*
zV@h|Rn9!tnhScb(J^lzvb)YnQmxx}Z$?b1V$FG3@GCSi3bmx$OyVLJ=Rr{ZU#q<lc
z@jRkcb&vP3KeeWTKKM#TjE#+#$V$o1S|77JFS--xnKAQC@@6X5WOA7B^WXu@jOME~
zcnOTe^Q|aaf)@0i5KF3}bT3~Fnz^qg)rq-oHT1=EaEDjY&;u)4v)*&nL~754Z{Hf@
z(y7gBOC1xF1C*4MqN1V~k1w&Yn7q7gJpu3#eq3Emt)X(P!Fr+5ej_t6ks2r5*2V^h
zL7UBTI{$q8gYY3F{P(iK{9C&NYkdNjS6@|}v~6Y{^n-_n_G>GjeW*vYc-Y22vqyzq
zCVi@dL;i)6_WxfCAT8*1K{VTCHwq7|4k$nkKq8W~E*#!}QwAG({}uwQ#J@A;!zh8x
zBU=3bWrHQo&(v4-kyf3l4QzK#kCS-?z9lwTza0q*CKrDKP4$Xq`DRD*lrT35n$mOj
zV2%Ljv%&!_RlYTfZ{6cY*CONIEp2-G`{?!OB)q3{Yqqz_>5HL<0Ua*P^YoV_^PDHN
zXd#s6TVdpSZYQ^r920SS@-}(IE?X}=9`IR9P5`j;b6c%cB$`BXpQGD+j}HiGb~d7L
zi8Qj?$u&OU_wsh`wY4)tYH2fFs|>CnhuGbYx$l<0K)1)+X3(PgW}d72x{y~RvCc5R
z#JI{9nIZu?+fJi%#i5B&g>8fc;v*m7!TyfIR#awoOOyR_rRJp+I>yZPhkarSwOiYr
zLPdH)1;+h7K`rk~vxfvi>I{^!x@mjZSHtO=JbyV2{<X?e?T4hXA#Z$lcCYjArBddP
zv1XH*;jj!|Sv6rX$JtZ^UPbrJ6<GmT&JPS$8{@OZUVW^_4h3}sjkb_|B&7G7oo&9`
zN~MZVCcu!5RE6rEmE1X$sj<Yx^u0Nxg9XiUx&PzVf1I7we1|lQ7K`Wr%<L>2mP`UJ
z=P*`fXh5+DCzjWo*wkuDfVHc#91r2s7(vgF*O=GMyhlFP`6Z#<o3(Vbd&l0_4)+$2
z#rw_DH3TC_%Sh+K^7%I=wuP3Igd#2tehkS!P!$kX39vB{uc^Ky`nI)H<T^Ek7Q&Ni
zP2@x8`AmEC2EM?0_VZPAZ)zM&H9GzBraJ7CoS$2jLgr1*P*v)!W-~3Nq?TPKjLT`9
zCWR`(uUqJ~g_C-FM$J&^%=%bm{`ciuzI30@1@<#02OE(pgl*B&v}u%HU?g0+XA!XH
zx6PiYr>3LgN?9W0Mr;;6VgEx*_h!xC^US2|jz4Mnt^wxz?NF<~id34kL*mFW<r=%)
zt9Nm!+kVsXet!E&f<;MyS7yz}E~z!ZZ{->$(be98+E0lTdY*k-z=u}T|66MsHDHiS
zJ1dp|_J}CP%NwU<ha1)V5J6?8sr(h^KB7jGM95gGYU%LDi}^^CB_vGwGqdE)YJ)v5
zDZ+%fWEpMuVf16iPr(z~^ZwSas>k|UuA+qA)+Q776okn9?r!|p3BQ8?bZ{4`_v7dj
zR9^?&$gL!2=$Xy-n&!^S3eRwL<UOP4Iu`{4!#xp;8aUf__g3X>&r9Prm%S?o0=|4j
zKDVQHj)pNY6w|)cd(ZOiH}VgzB~+dX_IQWtkBDz1eE6#Xv6>iLKJg)G8vG=yp8DGD
znX(%!)=+b;mm3+A#zhn)7mpMAzfgW|Fgpuryh2(pKX#-?fQugA8Gj5ujTv9pVfHc<
z8r9-gDC~=)WwGnBaImvm1uuUsOsT=5RiYubfM8RjHuA!L$1HOzQIkuOnYA{4FLIXC
z@36pL<M-JDhNFCVpfE$VX7?Mwd|HkQ`Mw?l`fzdWo-K_7Fjy`KsOca0Q};+sJS)pH
z_cp1>5P{@49SlbVI$xeQC*t`_7nW^K_A8Os>YQCySFEA<o_Wj8C`?0LtcY4=bS!eE
z@dHrnz<F8LMEKq=+|a;jmxm0P<eeq_ns|KFnivUNK*KxccKa+WV!N}3e8OdD>SEZG
zxn`_<h7Mxm4*h(uA1M)5s3#{YC%Y<JPNRK$UriW{j+kyT)!2T_vN{t&P(m#p@%#rQ
zuyfZh)29Ea%i(xla$I9|r5?Ayo-gXDt6y+)ZkpzULaWO+JBxm~J-P^|xDUUpvPRz8
z%RTSg4-#VRih|&2AJZg#C5eQ+cS+&@mTj@cLmmsp`V6$ZG$yz=c3MWMCqHv(r#DBy
zPoS>Q7O!v-Ay;hiYxH+x){-@6&!VAdln(TXZKU(RY$>9BtL~XK$~7(Ai7yxp*5l7c
z{?M~yC)P#x_OLR=aF$d@x^z;%sgm+s8h*zne}M;;G!5}sERoMHP1`pb$@c%cNnD-*
zfL?nVC?QakkY<5!UEL+Y0Rmu{WcMq&VlHcEPv9@u$SSK!vSr!r{JZn?+AYjLn}zGH
z;K-WW^+#bHuh-2X>ox5!TUGphw<4u_w->ab!2#{s4mx`&V=sC6999U3Unib-&5Y<&
z6zeojg&Uk!5*_2yC?(1N#oWv~AVQ=o8ejq1tR%&9J+N59nU^kXG!~XXA=XOqCWNBn
z7yT_Xs~!`ty3lcBs2v!$UPaG;tx}`$l;?Vbiy^>4qzd6IHnRTI@tx(}uZy(K5Lx*s
za&cFc?1g!RvBQ#%6lxt$+Z^*pu(~?p%X~#j^h>LRFHczLU_bg`nw#Nsi2O2B-Tc8>
znqr+;rdXW#*o$5E<|8O3nCm2dLQ@;kz2?4kYw&|(tT69<S6@z#?u2&2Bc2xs9H<qE
z%D8_T(*iF>q-h+KGG1oToEP$1Z9x5zTv%F}PR{^*@3}TQbVjVF2+#HYutUN5M&3_I
ztnn93i*5APZnQ#$Me|mO7A7&wgv6AThwA6YEn9ESVeUuGSN3}e>W><_JsazClw=T;
zR1h%9h+372Pf}jiiNZ2q>$eV8v<1}pMe0N^JDXnaOaCrw*6{{8gv8p5|L5eDt5ryU
zgUvjm&qlm%pb-8N_?-k9ghpeBt@}ssPnIv!y7gpJR9Vi$&UWfYk~y6d&bGpWtRFQV
zHhzD162+m0WjAl7^ZSi>P;7*)r{@|%m0%G10}uIMQ&h_-PVU-_kKO5O&vtFI0=tm*
zDQ}C$V2TM@@q@h0w^hXDT8fv(L7zG0!{8)Cjq|6mtV8w?`e#V>ko(^b!H$85yZo7E
zG$)DE)iXO2XInjrGFiDEDVYeVX2vJYFOWz`hOndZ$Icn^$zY@E8d|gFcaCFgH1V;)
zpCeslNg0Z%GB$brBVmG^K03$ydAsHYMK==mD@;^uxgU!l7`zjPeE%VRwMoGE1U(mt
zu`*wavqgPK-iNUMetpfhVdz_cI#}65^_%+a%rO$r4c^aHAASDdU_|8VkNo}qd$r11
z$stj1+X^?Do>bJHJ(}b`$p&YVP-=YyKSHQF42y7{Cn}282pkzn0Z$qiw3a^~5T;yp
z&;MZgd|rO~goTn?kvnYtKpb=PN|$A6{P_&=yTT91g*svtTaRXr1*7u%Oj!@wpNVG#
zg0mob;Ts~Z!Mb-L0HMp#Z+ax%XsY&;$Ly<<VbNWg4nftiV9gWQV`3}JKX<BpN2v)l
zhQ|VOMz)MX<J4VUou0$m@Aa{8eQw8;ubk?z7wne~+G;U>ZTwVBq0if8>KXEWe7-xT
zZY}jlLSto_WIxO{Hd-_x(7dS0FUmrAURY4)tep|az7ww#=cY~Fo~sM`O3lm1;K}RZ
z98l<$`&lJV`%zIvMJ&LFg8t21Wyd|Wm|i}$B((iG5CSv8(}Moo$h8$i14pYESl9-k
z;9_GBh+WS|NjS%aUCm-|<+#ebwG6(*3P5wZuOR-rM}w-}IA%Y-SyZ*o5GD|v)G0xH
z3=WAu6IZo%0<xW1ad3Bo2G(f^oO6;vP=Kon)==7lf73a_>2h1C^+_^&+I#s=6WLF>
zrAO?}f3KVdG<11jM049Loyd7xbV#d|Sc$={On<4An&j=}+e9W+_bJ0xJ%+F?)?{tx
zQPVq8`9KM$ZkNYQ)OvET(JD;*`}SkapFpo<B^`;oG6fE8)JaPTFX8CICJ={-jr+H5
zEBo8$7yBNMC%)ayEkeIB(AYl#T3A4OqH=5za>1sa?uZCHrL^CcJS5S0)EsE4$a~C5
z1Dbp7mp48;T_5*gN*`7>bl6vOAxhFIEl^|qVCfN=t#G0E)AA1~cYWyHb>E%CK`SJv
zvs_1P@R1(4$S}ZnXF$$3%9`THNeYA{IPXKm=j;3ItA%LSm~$I5a%>82X7=O&bjOE3
zRud#S!Km)2#HiC&%0*FIN#nmFiH_~82ps+q&Gp-Pb>*N;AOgJ$Xq@XjLnAUYjn)(l
zCEj4J^%s6ff)N>cMhcE+dU}}sAYv~P$`_(cw-}?trgDXL6(<@fE%A`$oAyq5B|wM;
zZXpC+rEr8!>o~A~1elee&o5=(f|1&5J^Pr$zJK#VIhmEnNs99;mOh<|S{`UlQJZZ2
znB1NyU-ZoM$a5L9hq$UlR4rQ*?@tv!sTUf#{7z_y2zJ)^bzf{R35~Rz^u5kDm<I&L
z%*>7|M9K=%9lRs9hXTlPx4FOmTJQ6?T*vTtA-TjqKI*bSqPfR!aHYUTki&2}v)Rp9
zS-^)f*{Sr)Ax~v<d}s&{X&&y7K<in-%@pYm`O&e)T!<l-T<lRKmX&qosEjVBroqqZ
zD#MG*&w8IJcSo~j8rE2lPIgo(6-K+}&I9f11WzZWL<N@bOi5LYCjmK>rN$&)SjNV6
zq5z6EL)!|su|_8L{BU0uwBHTmqZEfWQ17R9sz+*GaI3zqjkSB{aUQ*MSuTYHsV^ox
z<0)*~m7nvPBaL-lZe$bS9<cUDna$BI5x6Y3W$V?rx{jIFw6L?^qV&WH&e?XM0`zv@
zaxMLq7j#HW?8b7Ja7G9wIi=TTV}p$5-<6M^zJI8Gpp|{_ulfE)-@AH^NqdD~cEk=z
z9$n4)G)i66KntOF;THnvo_u}wK}MY)dC4hmq*G-N$WFw005`Nc5`yOFJ&R-h)x$KJ
zu9#=Cmu0bY7A(pvK{4Gnp~?9h0s%XI+n;&;t2eM)&jYKY`47WMLPEN?qpPyd<#`I}
z?sG}SdHwF)+MLb;Kr^1U<95pt|1D$#e;#jjPef4QTL6GQIn-z6*V?~p!(tbTqKY(<
zf=R8(T<GjlLPC<Qr9k%t=A5qln54DC{h>^2)8rLo3#BPvEWn-$ZY%%Q+xln)eF&=E
z!RnxiDsX1CEWO6yJb&CQI6e#rX2XJXX7h4$o<IcN6B^e)K(duFl=P2FYh!t7oW^Gp
zru2&O9AHd=yr?iE%Te3M2<$HH&VvR2P+BM^5xsvCC}E+j9+@!Tjp(gR-suk{QGtgE
z4m5!Tc!X`vf)-wUcPTv2lc2WF=J#X=@@EB)=%QzN(jIwfWPT^&0_Apz`pG?gsIxp>
z>4|j!-F?^BN@3<=@tROv!NqpP&uHDm426?lSoJC*E6dvu4hAq<ln^_w!vK2f*dXOn
zZVjIRT^_B_jii>8C1_ujl}v!lJyY7IOnOog1BVg{ikro8M`KK7C|cq__kI176k9r6
zaGJ;_jgzq5J87eRN;SOy_6I?)yce;v<ZhR*c%7BJU?^C|%pBNp1&=%VrM-W=IH+O{
zxx7}Y-L~hXeu-#(8~H0{ZE#8He7~HW08W}5sz5SiQNkt@oz=370Bb<(cK+Ra(>W9X
znl?X^HKT7R^D#hmTHx=$iXme_79dh^Y7{!<nSSDEdBb<1So26`=Vi%w*M|lO;Z|zn
zrhDx}nKQf1`|&nP@&K}zN=e;^L3{5JUYBnih-ad!Txh<E<u(h8%3nLW3Y;^N@R`2I
zQZy=2So{f8Q2sD64Y9~=xf7g;G_;TKN)QOwMR0QC%65!;GP}?t5qD-oFrWMCyEJe{
zs`QBqyuF@19^^9t`|kB+7T24>Psto+o_(p9{6Q89AcIBR#N3dQyCa11tzJ}>rQ8&7
zKjZZZyq8?q^cs*V!~v=e|A;JtbqpaRQ^!+I=HBVl75kXd6%UQj9d6ljbI!P(+jmuJ
z_On?anTgB}?nhc0tzB-b%KYZhiaPF=U}fhUjsKx49s{Wl<olV^<-8Aa)-4eqA@ZC&
zFAVQbTJ5;b_l!XIwpUJDQ@Oy?53+-9Yv3Yl!>tC&=~%0OSgMCcg+;h_gN<-@EHmR4
zr;qua3hOxa18EC^H{FW4qo8QQ0sknZyvh=-<(Gm;l-|vcR)apW;A$CH2z<DE_NvtI
zDawiXxxUkjlIMM$!d3`AG$d*)K7rw+5L3O9zp5GZI9e@z;cKuXMj)_SEvJ0jVau&d
zd;npzq_KnhrL@&coFlvNdLE(~11?4MIsXTmeGutO$R0G2BxyZqoC{`Fb(o`={wj|s
zLC6DJ<;&wV!^?0;#*=dT$HzoPXy3tMTILv7P>G&2c)Lva1r=m%@<<@#7S2NeOYDw{
zuq{|5BLag@Zteu-YebF8pC#;6cTJr4;QEOm4YU2eenK>LW7N=aVW)Ro@PZ^5S`~)z
zl0*#N_rE1hfS(wWAA_szNe#(!iWuFa2|Ep$Bh%jTs){XCE7*|QhNWb3xp~?ekB5h3
z3%J{2Bah0y{9Me<9mq$uML43}qH!&AIahpu)LZT=sY}1e7;Xz{Z>RgUTX7Zt2MIGa
zDI7GfSi39}i=CXd*S;n5wuFdlytj-c(9l}OwBG(k`hcB$Kyfsk?nvPTPYB?RSl|hM
zpyI4$A@cl&&BS=~gYVm}ET+>6OV?u``e!J~Qtuh7I^$lue3&Q?v?j>0BMcSRxqlcZ
z`p4U$E~m4H+LgYF1Yq1h8txm1KDACy*cX7oopt7|R%J8kM+~{*>pV1159x6k(v#DF
z+F$DphjlF-zAiN<c^o&Qnd@GX9hM;@V@lc1(ISPdJr9C@{}oFBHm#IbN<Y8-{&HrD
zxipQ9aNAmje7%jX1}*s$AZt+J53vJHTH0!eQTbr}mmhKJk@pC+s7Gm|zjC&dkw~+#
zofvl;X?2a;VtFo;k1FtlBa%2xRgvfmoKRYT>t%6JE3P}z(36q6h9&kEuA4EnTaD&P
zVNs8?>i@QTCE}vXb7bTvQ_yK#0c<w0uN=NUNeK#|^1tq%G7uJbe1sx<aY15?kreDG
zJw`poba})P)=+r5WDu5Nb$f@36_z+hG=?n7(|kg?diS3>vi>dx+gxu|di*1pt}I}%
zzrj?{n3HkR<%Duj!R2&WW8U=pRf~TX6=j18Ru=<R!vfj8Bj8(#`$O_{7BQ6)o1Y!%
zZnjb81)(kA>-_Rqb>|5WFDnyNg=k|4TaVK-mO=wkDSz|cW9?fiq&pG++mVR?L@e~N
z#vYG}KeA8T|G)w&aFY7_>}nSS<8Pll1H+TruhPVXGj!<C0}4EaZFSZw`!LI@A3pbQ
zyL$vD7Y9<gVQeZfMZ;jJXICC&L%MRAg)xo_AKZFYwP1mWf-!y<Kxnci3D^{@Ycbi}
z3~2Jr{`~q7a<7gIs=3Cu#&!%N_B=>^-~KAFLj+f~7G}}dg3U(bb{;yIudv>i(ILUZ
z>BNCgk1C<64j%Iw^ol2KvrA}`inA=++D9$4>e?2R?g3-&-*pt<RmM*IYmeaaZbYcU
zQ6XM~{Gxr7E4LA;CX%4vH138C!AjJKumMulo~Xl?LY2R}??-NH%lLHfFXguMzrL2X
zpN{$;A9wJ^rWehJ0jnzNrt+o3Dt`q^zxrW&)JU^OY~@Q$tFOHOkSnUxA!%ynAmn@(
zD7sG>)|-u-P;~M5`3=>Jmd>dtK=tCGvvyhHdGd-Q9^Ggf3&L_1bg3<~@NkFTPAUts
zK)=ZBT=GiP`dVw4*$V%SwEN`Q%p3B6)VcsAz7CA<{m-(TQIV4y&y5rcFLCw~kMWTS
zv@Un-smbi*v~Xl(FSD<3zfqQMHeor%LX<6lZYD{Jqhcr4ZDIeokIolXh-4QgQzbYG
zxx4#+C7$xYej<nygsA`JwQvl~JA;puQ*Et}4@@C8O1f@A;@PU9A1|CqIHO*tQRV8k
z`XL(dl|MrSM%SXD$iI2p?^a=AnL3eJ0=^p`XR=|S-yg#|vizg@5Cjr7Is1q~N54a-
z(NXv}LS1q+rlGpc>p_!eD(sM0)m`~w3)%acMrrJ(x6<HKxZOGhc3rVa=byB=KA$_;
ztHZd72z)oGP>&`%QR2@uU-chKCOe7}9&9nd)9P0R5qp#QI{(c6!T{i-l?MCxm%9Iz
zy#OxDBK~GNy2^5=uXN6qiqq1`9@2PSBc$xf9$7HC!<vhdA7m!|C~<<O^cei_3?mxq
zUd_G)#ggOJLitX&q(4h1;MZl<nB<<<Ytzs;1;^{d&1S;o?7xXRF9&CK9`c$B4PK5E
zm+|Xs$u=A@cq?skR%Mpr^HTl3zaXEQ`~!Ji8VnJ7fmD2`va`d&Zsk+{xml46A3>L6
zuT^5w4Qsov)!xxm=+#MKdaC-Lk0di0XWBjSlEqVSrHQ+Bn4Jq<E>bgEs^}1X!UeLm
zni`$aWa!Ne{e9WPu2`fykrK20&(!VPK4B&1RT40ee6d#RS=I3U<NUHuTS`(l(=}NR
z@>dXmlWN%*6*!6CZ_XzGF~b0|e<E6!e(OSH20M*Cf^<h=f%b>r8|fPa9q15@vS)w-
zocv{bYa7nC<yB)KqO!lTjB@!jlDTdE=zU%2RQC-7g}uE!)@aEDgO-LNrnmw^Ku{hw
zfgp*l23Hv0<Yy0+IV9K*p`ygtDF*~EKjhlrEL#>kqDQ9uq$?V-;!$F&&|Tgc1F^E$
zA)d7N2fn=c8~QtcJV_86ymcyQ;{5mp@XdH)IZ&k5f9&zeLAKghK4IFs)1B2K1-(sW
zlq9ghV(t3ZL(4E4(?dQGs?Ig9QaysIVM)1%hSa#7>k|k@_lR?e{=pfQ_c8PwPegv6
zaFV$@oaC7)1Kph}X}OGeE?305a?r?0GNVl@eB=5DHn|l6xrF>ZsmXwp0SuI|s_M_s
zKr7Ro^${Ybs=ri5u5o9d!k064zV3H~+Rpt-xwPZAD%c4`6BD8g5loC*E`#xP;&sx0
z$#QoV0mv-KU_olYAI}mC=WpR-W{eG~*C_XLL-$4%565@9Z#-#|3jg<(*;5`!l33X<
zK7F}hnwG_aqe7}~{^cwko!X?S%YC$}n~Yb_6b)AB@Uh?nV2Qm@fw#H{Kxn=l5z91>
z5ofg6>!cj>$(P)FhT;1-F2GojtQx30C_+5uMRSKLkbv%(zR%f~bxui0F90)TBXK<Q
zor8>qBF(Bm(|cG-O1z$}Whn)gLC)nnUrAoizoo7^tUxx2Un4OVCto<lL=TT44X+$l
zplC3cO>Ab6wMH8Ijn)gj;datTeS(dKwzzWT@8WCji1_0fp9<^}UL+wwU1+R$_ckRN
zL*-#*c78(jgP5~phdZL|1tKVJqrdxrQnBfyChZRil!#XBYP*nLe1FsqXi>0FlmKLT
z<M95p-zkBp=dt27Frq-FaNTs?l8d4EDV4K>gesdCP4aKuLHLqISEKXIotJD|8azTi
zfXR5EAkXg3?T{w5;_IBU(l|BW9Z7B>hUWv9QV~NzG`GI`cc<#4MDLs%=A65dwPd0W
z%SdfB5j*i*k1A~~b}5HnW7er1;lXS7HjX8`@Ol4bqUEY*)>&Qk3+@Re4<GVV96hKY
zsdr9fXueO^--R2MrDsJmBB21Rz3j?8dX9U}3ElVKcWiXGe&JCpiKut)#2<XK103G2
z(*vSIUd%>RctjX?RT!Kt6HfzNGO3(vVM;Ww_@Wl)$ag1AMVsnw<O<)z9^DS%OMjD(
z6=u2-hL4fsJ8$Fg!2t5}BBj5gQTpI#Jqdn2qUYv>X@o)nN*Yi=uDq?Y49Drt^5yf$
z?bk=c|5-dJ;o$AXuS~+)r|-`~?Kjv*)5|>WRDyz|Yv)i(hA)ig#=of&vhS7wbms#U
zvXFP8U)q+FB!-iI@ojAqd3PE93VcvN*I{7~&GqH5f}-AbSIGMI@9Kw-{!xDQyC~;s
z?40+A)Y1h@&UxH-U^?k9Ybcf+4ZSQU4_vvOB%Hi3OjQ6-nun#Y&-5sk^E-!3aHyiq
zYYjubR_M+@zYGqrGrJW~yQ-@xFI_?F+(w-n_`k(I$kohuf`rhuZdC_o8As8c`E8su
zr6u`6-3K&ezeuasmEJh6TzvNp_M(^~Os~e)x*0AJl!9wki6G5itN=npK_bu{5&B`y
z1@i82VD?TGRMN1Cg}=flKzPpHDrqw=8VXXIt?`~%!<tEkF#hWXNomGppy)xCSoU-Y
zLi1FmQ#34~wEc`VV#Fn&vKVSp+%jT8M@TYfi0jCxcB&~X=p++FoGR{e(q*8sh()j>
zgUkxjocBss@n|{!v<Dv1|8t`XWzh24UX{@pdk$%(qJ0D#I;fyW>TAa0HHat<*pHT2
z9(+is$4nHGb+!K1@rC&WcG`u=xC9O`a5z^o|Aq0vi4GUQqx+gn=Gy)F<SmD#IFFCb
zq~=$8uy%Iox!?#yt(k&QgLJ&KS>FDJHkk|&WX(vuBR~s$4t*{Ls=f@2NCUomyCE9G
zu29EkxEv-kk^Hnl+T%g<>68%h&lM|G!DqM4Ywo$IqkN8r57_MJsu*OSr==miRgDcb
z3)Q;?S5UsQ^4Ngt&2DU?4E;V&qjip2L+ttQ|5nptKqDy5=3JA{_cDU~zA^B2i)C~v
zR;+^Tm?ZtCrP(gw?D{xN=`>+JTS)+#AHbCH6B0e0g(5qcga=CAS5bw7^`XCCWX)j6
zc!K5KktvDaTduOIv-`9ZA4#STg-`WAc`~D(a{4ac29&pn4W^8CAHYBzCvE;CeKq4?
zM8_iWKtqQ`fS|@e-{R7mI2FhxPz%>%De9NKp*G(c6LHA8f+U?DA4>osn><vYSyWmv
zscG}#Ctg?S`C>9J?@(f8EYn<V&k<Szftj|H>7h=wo>c~0si2ygPq9t1fc9&SvNko8
zFSuj>4}<ReQ-|6#!G9c;AR6zr++-ux%|=k23X+9-hK0J`PY3R?J&B}dNa$^N_NAY$
z4rU%A0N}I$-yeGiDa?$40U}KIfNs7E)Nl`XpJ)nznG;?S7W@C#0{nnMQRzRQ7k*a0
zJo;R3uQRJh!pG92|J}I)JvMQpe!QnBvzBBvZ{~TfJQa@AjKcO~fNNGBcS@eTI$45&
zzYg1RCLrYG&`mc208C8cdPJ$IG@Sebox3am#1$!(6D@^0h!V>!$nyh2S0zLRjaIjr
zkVrs>He*%cZ*Ev71EH73U8&&zi|)`gl`+UDXDiiWbLiJa=!LOCpD1Yii|e#0;9fo#
z%NOOTf-iYSyy*2mtm!QU<(fiMu)^?JJIO**oI&L<6sN$K$5(08!7|k}*ZQjQACZ7p
zd*QJ~`lrtzJJAm=TZb<vhN-1RmP&c|Kf_~UKZsxSp+y8$RoEIp=({zUWWxLDVEIC=
z2DM}~oGicMhOIq*s8~ix8FXkU)!C&`OEL@<TldF^3Wj~$_QCLWCsc9_sDV)1`o+-C
z{!!GD`OT_Gm?b(zXGu6uUK6|pyTNtYFA_AbXA5qN|3USH7b<^L0eDL){aX^yF$^}7
zViTlOJrB~UzP&qBvX<6_81eO^X2l{czD%(Y@f?(I%Q2*0KM@ZGNYwN%i2t@n_|4T6
zC}A+p@mwN181(p~{yg!jbLT)|tbkF^zWBW}O^eh&kpn#aU0Yec!Sb7x>Q$A<e;;eX
zY>1gVg`+h0cYFHPjFS<yL=@3!Ujq0p$1AdT=1TS!!b2uB2@A}ELs}w{fe7q|9G%IS
z`}$6+3QN8vzV?@w>Tp~{ZEZ+UG~eH>>t9)UGlHwNQdky_^9sJEdt6e4us(tz<UYD4
zYi)Apf`H^vy@1|D7!w=3OzAI*G5GkG<?06`p%7=z{GJC1o)%&N)@~d=SGXIgMX+zX
zGkcr|KyTIp04Nf>(KQ7q-<m~OAQ@heWp54%_(1HrBdD;>hZ*ie;LMB+s>{{dE;iP1
zSzg)9`|1Yfon1pjhkk1T3U2(4u3DY4mt5chJ3GdzY@w$|R(+}hO`Xjjo!P43f0wO4
zF+Zrnw|oO=w1lk6<R_J}KT%#!@2IvNG=u7N>;$&b?2}?iyVIxlFazFEQLX<$Dik0K
ztN0+}8TO~%(#xk_lOz0x6b)x>bnz}PCZ2cFx;=38y_k1!^$iJuC!$~(@C7I3$fqV>
zd`Qgg*L-=`4u8!8a9MGN|1}1ncJ#?O3Kb9=JCFk1f!rrHupz1CytvSOxRW;Z5C?AR
za7D*;7_Ep)2yF7XgQeuYt2+Bp7T(!G`tJ(3HDSI3y6(oWyJpm*6Ee%6c^KW}q(Ed&
zGlBVyM<GZU0A+z1!snPob!q9+oLa}%1F_XlozlGQv6%z_!u7V)6J!i&^N$FTG<6V%
z`c>1n>yhaB1Fpijx&IwZHi=0A5?-B;b3ZIl3&|M8GCXE%;;}KhxcpXzp~wt=>kfSk
zr~5EuK3l;Wo+e(jID2|S7tnIgjoyHN4H>f78X3@<oHJf=$~rJKIzT6FiOK;<t6*&-
zET^uHvgzxi*8CruzA-$quIaj?i6^#gn;qMncw$YGiH(VE+qRvFZF^$d{`!8t>;2jN
z=UnIPy{l@kT5DARBNJ7E)huEYYXo;g!ml0rD#+dh1Toou$B{&W&dKycn?Ip`kXR{d
znu2uVG^LGlx*uinzjjC&%j1)!M=%)y|2DK}T0W-#tB4Y*U$lPO8_d%XoHakgL{8-=
z@Qp4^LvWeTZSv+ZUZi$J;6$v0V&IeH&~A_BMu_G$bGRd(vigomA>e!BR&u5rqkp2R
z4Z#akS!o3Pm-M%Mkwh=Xk{>JTJv5XV+EsYmh=Aub5hERSEV823wI0BKh(iuBvlEd8
zA90}z`*?{{yAcK(CY7PRBg7Ilg`BSnvoa3jiyW0JI6&?h#o1=y1xjKQ;Rjdaj+>~z
z%eHu9hmkId1vUU6HTVg?A$*IXyl7N{VHCDn+7NXm=AO$*nm9V?DK~RLS`{0Q_yB#+
z7R}wFSd_q66w{TE4BHlh2#A%h>R#qjzl~w;Y8|zm@I|9qGx`4wb07@|4!%5|)UnAf
zQpU6|7-miAWp(TQWZ!dWJHu(d7Mp*VAb_|u;@ysl`PAcY`_7*XG;sd?@ZujTI767=
z(nt%DN^e#!x6qhJAb%WFFZAW*;pvIW;V4LOWnvPN%X+>D^fglPaLkt7OKp+gblTzQ
zH0X5tjg9A(W_xhbQc`{}u*ln$)BH@FNT@35pEQ4(-#+dKFVpy*wg}QcF1nti@cU|u
z*fC)Gtp@j{_(u#cR`*vRdj7=;>t1o1h=UR0$dy?YQc%QqO7<-v@bkhstx0*x+L|NP
z>-WOnLy&z*eADc<k$w06Jw*E<U!V;0H4k$oc*f$)MR<t>_{*G^s1870JUuCgQUzX5
zM0!EOn8^4HeC41IspB?Fhd~k$ia_`+uA97D81OF?=CP2Vm^BUtoVYz(Q@Do(mbghZ
zgfB<j5y2<KyZ`w#>H21<<EKCV@Jn}OW~2w902%j%ix?T^+3PbTJ1FicROmI3=w#-6
zsIAY0lF-OMWR>#{QzYI0H#f|<TB17j7$X=uRF&1qjBT#EeV3lT4UJsr@Gl!K-R@eG
zzbSDSxTh;&@%!wavX;G@?i<Uf`(uQK$K`4pe^X4c_TbQ3GFPV%k50?kQ)xbevTP^a
z9)>JG_cC}K$*!g(NdtXTGq*zH4vELC={%Gm0g3v5T#K(mlcV9l0e=e9i59tIQsR2x
z1K{AqPQ0o?Dk3o)uWBSvkCB6LiMuk0Xf=-L<;WXuJ_lBn5UosH==7SHYqZ}4U~+=&
zQ%Ep+#PJ<J5uJbK_Y1h0C8LaD%;j-i>z9!C3mQ)Tn%5cn<eHiTkZi19QBwos<d}3+
zTA^~XXw_lAC=I||a7WB21`twlZs!(vC_QC&3gjQu`UwtKTCFX6LQ}5~EzUGNC#V^+
z0v*`Q$-DO6!dwj#h0SuiOuX;Gf6kOSg?ek0n}#w+Z^%iY7UX7P&OeYmcY2-M!obd@
z|0Vuf_#-jC@8J@Eb&G0j)Np?K&Ehfn+fBqJzSO%<#M!)7dd5l<A5%3q1fcJ{i$l@s
z$d@-;?X+*5qi$j4{jLSRJM%*mSQGao`BlR3k+J8mcbg&c-`biJ$MWw;@^rpp0`!}(
z-M3*(9^PRT5>hm-Dz!M~J4a<%`1Y<X3})!Id{n3>XmvbUQ2@3>kKlgJK*B-oRWOi7
zykX!8zO8%fHZ$R#b1BYt>n{IIvfTqokd;gN3D7&E#8>mP;d`7dm^^JxTui3V0Yetg
zqftd6SCj+^`z>dn<pF<B4-jYll%eOgfDcW2WXv)uDKeH0682tw9!Gx5Vn1L8*_2up
zTx&AM0a+>=V0F_MGxYZ~%elg=yHY@eycE#uH@8P(SAk60`Q~(?cmt^Qa>HI8#{|H*
z^P64NULIBKW<u*4Tu~S}#kknn{_2kN#RolmPQ<JI)!gtEqPhfva2Fm14v<)^ZxG+)
zu$03GHSn1VMU94>C^a$|untkCFIZo+=M(uJ@S}?ZXM|Uf2@=V;rwAvmTrBpL1KL;o
z`2N7Sy-P~7@$q>Y?}{9Z`2pi$y!+MYBt@Bl)tZdxzjI{C6Nm%FPozo8f@YWo1`sg^
z11$G{icX)|2@%U3-9>sDT@m~#^_zCakZO7#N%>5!XjudtYfReMhU1W`OOq$Vqs<4E
zA=wgPkKb8#X3&l?YWdQn%~_{>kNoGs-gU)5Gm#=ltNZutv0Par6A^$CP4riDe57Nh
zguO6GvU84i=fB_))rl2aC}Wr&y{xtQo|!NyMoa^BTh<#eI|2kJ%~K$5gKjT*uU2;Z
zIse&}Blj7+w3aZpz;r=025(Dh5c#aX6bx^E;H(~3eF^^}kk9J|@B@vD7_R}2(h-Sy
zLQg(kU|e2@aCi^UsH9`4x&T?qJ_*faa!~jwSNd98ZgyTeK?hN?^N`wi-U3~O>?$s`
zOWLpgn)%2~quP!#uo5nY`SA0z6?q`;{dZ$rT<EgW8hD^>L<px|qgd*zu3HUio@(xd
z0q5;J<+>Ey9T&WB0;T|L(TI3g&%akFsml_ZgiP5|U;Lf(swoD&6<^)LaqDtQ&)7z?
z9fY!3l5*|jj39QZ>>Ud@z$>p!X_p;xhia>=Qfk51_Dx$<CmLv980}w45|h24MD;{R
zHIfHrLe}FdefRrZ9QYNLA+5TUNsX~7`{n#3maS==M!t)BbNw%BnaS?;f!E4PJT4Pz
z<JbagysEFEKL1x@KTLyj&bG};#VeIeG7J7>3w$(11?!0h07lP1m1qaGlu>yi93Khr
zWqa^;Kd)%F)oJN=v9lAGwJEmPC831=FwWF-zTUzlDA?WJzP7d1ZM|H5cQ|?X;N7;F
zuSPpLF>&wVUEo=x+cpPMhq~rGf@0*5p9dKcyqGQv;g*;T!=K7PqS-_FxAAXtv_AV^
zOvn#NV7lAG_mS*q{0LCBuLTw0_T|hGWO7~bg=T|pO#JtET<ev5bSMYOqv}cVA>u*}
z@CPgOr=uwc6u%Uyhv<3kHlQc3co$|=63Gj+>d1MdEi2<&;}NptFpPF?n!JJOJea>u
z2o4tK4C;wu>x_qS9rziv>I>6aCbIaR*6n(lYHR=6Z;X%Ak&*4)pUhJ!WIpeN5J^Pg
znpz}eXIC$ufkb2%CogL+)&(tJY~-u0a`(`^t)%aYWMhn1EMLge(}+k9P%4UL<!xE`
z2u*!p#E)*QB+)uI59XbI%Y{KwjF^;%Bxco#r>o(0zB>HBCZ0F|wYO)*{j*#CLMmf1
zR-1u(<@=J|ldiKPZ^5Az!~Hw}p@C)PF?K^<z~(n37Ey~|*#^c~csrYLGlB-b4DgNW
z8;_KDcCh&Ze2k}~M^Nlp_MUf1AD-|`WOCY#uA!t=PQp3TLrNk5A>=|HI*^}B=$@O9
z(BH`nu8VVA5&pfsy|?=lRb}P4jEu9>Q#ioe<3$Fmsf@7jpNNR@w^W-a|DmwJEv^<l
zaXZ{75sN}F!yz(d7oI+5FqNK0-+&f>=7+dzTM7|l_(0M?%jl372E6w<BEv~xnm$YU
zMWC=8ehQM~t4^_D>E~;Ulj(jyt%uHHd0R5*z0SY@NQ0rzyh3Sy3lK%U0S53DF{_S_
z2aVZ)8RH#s`z>SsmAEsRb#ipcjt=^B%!d$Ew=*vh8=pi+9pW-2&np;nW1H|4c2yXV
z&c^%UR6S2=<e-~U-1G4~4J0E!Uu|fy+x`wnpp<X_y(8l8&g0*iQj`ITGw*lAyA9Vf
zNLSWRB^gB$f`p;14*Z>AnFwM=dCa1{cljig$pS}Tq1w!L0|>hw+@V)MVry%+KQ&oL
zRX|VM(Oi&Pb7$km2DZlm!v84PDaPUKUXzN<Gd58v8}oE#z%Y+nJv?m&?B^7f!PlZK
zkT#trkbu{Tnvt=(qC#|bd1`@(-|gS!<yL_tQh%7SlvHR`)Z|Q_=ybM#j*80e=_#+n
z{>bOY+m~>SFV26da2mz26p)uzg}r&+4tX<uJwu7xQwq62UW19mdRvFmzy!_w9T+G|
zo>GZ@)bJ?BNs>^Lx)D(BJ_c{O0*hRHbnPX8P$RD8`u1zH&15CE)TMcS9x_pbi|KY=
z0+o7Fc0JAo#c)R9LF-X+Zz!cCs+Bdwc3grvaE|MysH6sDqxADQCdUrG?iG6Z&88T+
z{zs)om9~J#eQ8`*bMw;1#>Vh4m4JX=#bSC|nq`xAJh_1lo7qI_W`}D=YHH`(FCZ!j
zJMTEQC67k5E0kZVfXdG%EuO6d#r3_s=8Be&ZY$g6p+{s~63u^x@?QkF>em5ev5VJa
z6JQ`l%Zr;R2OMc$uoNv+WWdZ>AkKccy`c5?ZQ<19mgbmmfSs=t#25h&;a4$Z<i4n7
zTj}vJtfw;?Ch0B8scvpd`@n*?3J4r>CH*9<$mT2p*4kP2ebY3<$1E_ROws}^mX8Ml
zm7Igw${&8DZ0`~Z_5`;+Ieo)X+Er!^8PBpT92`)9C<zDv$UH^0Vv#z$`bXV=l0}dt
z(WuT1q*{`U#y4b51D%>Tyy847-M{+*KS9ZZVRFneuA;@@+iy#SJ$1(pxWcEGI0D>N
z19f3i{iqNhbYF!p0!UO0VEGAoK6u(xu0P;f1PUr2-H;N3`eSUAP)vn|a32N$GoE!;
z4e7U%vkw!{e`niu*{K9Ffo`@4r9Qh%e%>Exjt+gic`ST~+I-C-61ZAa)=&DoXV{R>
z2i?<3?ipKu@cM^bop5|`!(fxLjx}q?qFh#8+#~3D+ZxF9YpjPaI{$^;{rstXc3_}T
zF-OpNC=!SHr(f?}jR8<F2V@Fz^zrtjn95AT&HX${_!)*BbiF-&gs1S^n^&cr*H%)p
zdfK{-E6}nH@b~Vm-wR)!RL)1Jtl~P9@?G56cZ`CrUPIw4fh<tn@s+b4Ii8)r+%g5)
z$0P(8Udb$Uk_|7W__7ha9>$Fb0vA?4d|t>fAOSvN{Vi}L%R7eb0ODP`=M6xhY7{gG
zfXMv?2o;D!D#S#3i2RU_u4PDmc+&OdKrzfP(D{4TWuH-4ct6%CUEhZw6njT@DB*m~
zdQT%4J6p-kME={OBm2%X(v79@TzIV7(|m8d-r|uwWQg+23g>YGXR4r24;*iR>Ggv@
z+Ls2TR0ElN*qSspHtIH*O}5(aO@Y!w4T{Jf&W<m*y=~pGK1ts`4BK6xJ*;j{bZ4xe
z6kaU9#^C4g@2U9NF?@u(H8s@Qg6%Oon4}~SJ1e1Ankr-Erv11_f|o2`<}#`glEL&u
zuWOcYBt3Mr>`?NEMIOyYq&+Wex{j^r)F0vYU&ex*r1~Kt-S6t=asqcZ$PGs?W0p08
z<25gWIH}ZqjrxKUmKW1$ezUFB3&9yD8wyi?hI7O2iTUp-?hRY#GMQO72TzVavhe*+
zF8q~-O<ao3m6ysCv6OHpm(HM7w8SGh&A<|6OPi?1L`XLR`qrTu7fRkkEe>%={D}$p
zTqZ_GElo<O;lyWKo?>%yK&rC0Y2ep8$e81bTj#Rt@@l2uKz!lk@xMa-6AOj1DB>!G
zkznmk-S~W#F13m+E|zwTrVE8Fc|8vU00Rj=s;U||6u$bgH>PDwGkB*d&hnUwV5kED
zC|c%J8CXep@!z(+?QqijRCk213mb4C-MJZ~@y(9P4yEhsk1BE(WQ2_8^-&Wg?ONO}
z*POInsf=FL>vU)*0}PzU*JPqBT~z3~72;X#^g35*KUMf2nKLC)gx*~;;jN+>G9yP~
zUi5`M-n%t?As+c`Wc!4y_qyAv`PzHTT}t)@t-2_gVifD3vk^@8>3x*AVq;sKHR*Zq
z&oK~B?DW5J`ci|!H~#nGxw-nn!os-CfAnbB*lr;CI2x6L)74g&<IzyH=;GocXv|e!
zUY>(HnwIt_>duM$(W0mCz{{4~|EkH!AgK{_tls)hdG3Y5Y&ku_$}mSPLo1f)FQgXs
z405v+0FvXd=z5n8r8F-8@xdV#ia|)or#qvn=tp1=I}X_u49XKaQVUtU8n``wpNn{^
zQ#MljVeIu|HWM(-`5Tg}@G52?z3t10#Z5mPWC6qH{Q<5mn?2RoBE#G$4uEr;w?*9L
z;(g@hHT+Z$$tOu*?A3kXwDtXYlLvTq#!dzO3&HNJ<6x~<FAcaiyHR%W`kq2|mO&E;
za)yc_0&0}0VF!0vO^=VCf$|h+KY)UTjin_INc<|``N-a`Ntpn0a8bzQw*UJ4xZ+-~
zU7%Ef@6z1=T;5{GZD7T<WOS1{qEtr)q^k)7+|;3#y<BZ3cb<U+rUwY0>!AOyiHA;Y
z{8O$_c;j+y>WhSQuXmf2p>$FgJI-!?^MNA4xX>HE5=X3za`U&RrWgU$zjt+_%m{w%
zZT5}NhC$SHF_pC5_E%=R(bRO~x&8*{+60>F?{|Kd@sX`4^_ztvdhB0ntpUU5rE%_i
zj2IK03gr*|HT2tW$G7L#JHw<YU3yTaP@^AQ(FFF^b;F~AS8uRh6Oho*XHM-pEw&u>
zpkN3M=<MwLL9d|(LYy1Sa|Aq>N+&_$X)wU>O>&wQ{Qu(qKsZef8GQz5O9!$SrL{N_
zbf3jAR;7>o-ryn`!jba?Rz3#>g)ZahUl&B}E{nhvk^^8&oB_2Sk`#c-^eHgE)T{Ap
zC2K)K*s**JV?E&-uy2TdBFG#+5oENC1RtOw3&P^#3j}cE(QwqRZx>E>&m+NxTk<I@
z+qyTho~kM5bFwcx_BU2mumWW6RD%t)1hu;vJFBJxMpKTiCAxSiw1jU%Ga_8fvl21L
zkzReqEJopC61;~fYd9l*FQ}JBI~ecu3|#N@gS_x~;pNlWVF92-9+#5x)CV$2=;yFr
zB8D+)#l^#W1C>`b-LK{K^>Z_R`K6#;fDiP^96$Ju$609#?DZUI<*+I&3KK{}qV|4?
zH7hcSSWT&QxLucV9Xj`{cW~H)s}|G6Ahdnyvqk|x+VlFf&Pu*|lf=fqOWiw<llc^?
zPE6s;82B^G{jr1!=eL*cpvE)WbiN3$`*Su`vTTrP#`=?kaP5zZ<{h|q%6%BP-{e46
zQwS0R9+&pl{b&o%?n|fOYdsa;)i#{#H8+>pWW=YqbUgtqm8wOIzdUa&90wD-Rq)k#
z>)+?wNP(y6ffRFMb~Vi^iL@V}yBF~(;Uy~e)}ujo%tcJIgn)p6ql1I~N1s8P!$CTS
zHOS}#B=KGX-68Jpo&1T>;Rc7I@UR$lEi4>C#R15@sKsirT(d?W6cb3}s09VLrl+q!
zmS4dpg;!EiMzS^IX#O>wmh5nOaY%pDKU&;{FK&oa4%wq$6sGP>Zwu15yrWii{6bcC
zNzCl@N%yq@=t%tlA!0`6>hC(={!}It8B)dyq8Dq`WEx2nE}+rKD4FDHT>1fK*mX6X
zrw2>yZ1Kq%3PQPQfOAAja*32(?H0v`4Acq{1w5&<6PD(0ict<{<ep9`b0=h*UI-s{
z{7qbG9;v0BL_6nLVvf?KlVP5zuk%=Vee18_f0r`eK=$=R6URG@e|8&NnLTq>JMF(b
zZak9?;Yk1>FG*1Sy=iZ64>FZ$X>3G5LIRx)7m&nQ-zFh76_h_E%G9(qHL;M9XBy0>
zK~^a&*uIK^DzTm0+jEL{(r_Km#k16bUzP)HNXyx+p}!{zGJmBYTJM%<ozF(-PP@4M
zFjkyu0_savtx2p|U0(xTZ{Jmo6b}LZpfnn?6UowXRhhX31qfZ>CEb}F3)8RB*Xttl
zS*)DFvNL$dBH7pGkNmu3W4|rI#tic37C0tEfjw1s<TrNN(&1@9V>o`ad-FDq*&G(t
zD{Yq>s231fMjJpBB&3uZixr^JVclm-%*$J#wO4@ipH<={9hHr+y%Nk>rYi4hVHQr#
zrB5HmGr=~^xE`p^97l=PFW+F*w-~tGaO|yoED5$np%`xlxu_1g2d2%GxPMP05P0kt
zL?oLWpbnG}#9Yei4%c3dn7aZCcj)3f4!=!~A+l|4{FL#hzJk@#n}R>@Y`n5w++4~^
zAaUX(Q9OKYHsB0=IxT7fQiaD~ZvFUL`!l&7CJ+balyDHR`Pq1o-XG)kY3BCV8sjQ7
za1AR$gj5*O4_wJjsy}8)vmXwMbu%K=j?9+{90wL=5NSBnjX_9&&`Nj&K5U<tKlNjD
zK{h?GEwa|#PXz&qf2<on&(JG-dyPne5$}y>%tZB6M%s{Mx`S+nS>*TLSbS8lAOYrs
z7XSI#>Sq_&PtZrWgw`zKy@zSId#=6@@8mXaUry=G{Jt$9m{U0w_8UI^R8UH@Xe+^!
zw~X;^D<vg8vyh!B2pJ|Hq94)DGC7J3Lag-zs{jdz{vQU%QvVr_Z0KOr1N1V!yR~RZ
z5&vA$OAMcLq{&LgI>$3r^mLADy_8v7>rY9JIq4|88s8jW>DN@gTl)Kx>0*8Z6|8Sz
zH`RMtBNDEU?5l9dFhLuphWvyQbwP;4kJv5Lo@Zqa*?~ZbLvI-Cv;o|*8+bAoGECUP
z6ia#6cCmae5c6BE-3cCjqubvveg_X(A!)SS8oAJFG&e65R@8|Lg5<2VH}6iw1N`ql
z$1^g%=c&gFD1ZT>KJpj+(fv#lDEoLHXp&{VQ}W$Q;2h5+H2lU#;=Dl++Hf6<F<nW9
z^n1IX>d)s5;!IENWWO8tX4A@cx%PlN0r`xV63JO+$_|daktsd4VANYsj-p_JvT4xF
zh=K8@I893e+H!$C|J$0XKQ%P-!ibM0KMiUz)~?~F?Ar@_!`F)HllxXOKM|kV0#^&?
z(+8PyB+qZ8C$3&m{kv9@-5iv#Cc2XL&o3QBLaT|UrT;!d?4X|(AV7hfUmV-ndU}D8
z$c$D_VF$`3p1-^Z{V631WJIz#Wm?el!}Az=BC^?OL8-o-wYrmhtSgKBYb%Haeg^{s
zonq{fzdbsg89cFSUvX}pAzRLJ-Tb>NJ754f3Db19`uPT?B6=|iM7ux}T=Z5--Lt0h
zulL^%9P40%z+<hmY4afN8w8HM*%1Da&_*!W`G-l!lI40RUtk||Y!J=Or>UYVqM=5Q
z!~W0i<hNzd2<63i@NEY3_dQ0uAw5r(fxeQ8&`kib+_<-=)%<}d-mP^7#rA!wC!wL%
zEqKNXlO9hU8USYA%H4-))8tx7=kG-5051OuJ|L2Ir4MHJ{{1&XZno4?b*9;>x7FH3
zmror~090=~O}ciVpuI6}eu%YPE)%?Y^jDDw27wnr$RV-kqI2L)W$Us!%@m)Rk1rE|
zxMtf-QFN31Y`??UnM_xhDhhZ*<mxVYc?}u*{+hWXq~Sa#8H#yV4L$rMA6|}D>-)9U
ziX+%>kQGx&?5=rxV?xVR8No2u@_$@_#qp88moCcYeKwZcn7`PP&rDQn4P<~3+KMVO
zhU2%*UU^qB>li}o9UgkTA&ydFK<HhLH>PKLsI1jgR7*4B4@a?PGha~|@;^c|rC=n}
zT8{fW6`1^?uu`H9Or*;41IwJNcc(TSHQgAY5gEVC3STO>ZX;tg0Di>65bS6G;=;5#
zpjjnPW_UVnU9;hP=~Nwb4HF(}^W}Zh162%!#S)>wpSmRYjt5=eQ#UN1zf=6ZL1D6B
zKmR_-Cg3Peeb;Y#Xff`$tIFCoe?MVbE}S9E!f%z%Qhn9iq3I9Jm^#NzshwbNbgoUC
z7QQmADbEFchv&97<Am<Kb^B<EN}jPdyC4MImkR6_36Nd9s*35sG|G4L{)38HTSjGq
z4J_xYTd?A|#JWo(aHi6`IUgoP`z5_loi$+R=%cmbkxKd4K|z0@7DoQWt*NNKtbV(h
zFYC`rjJ+;^pOpH)&l(Jx$kh*vgL^Y5dR%u&NY;3wKj474(r<E-1Dm1~+VFcOi5d*<
zDgi<an`KR(s|6MF*ONDvox}#42_?7YPwu^c?)n6^zV^BW)XN$mJVNHG5{{=`Outwc
zDQOqV`(b7&owpJ&*vu8L*wF#O*_mlW^xUX~cuPZeCGXeOk*Y8RFLiH2nolC8P|~74
zsS`KW1WRL2lQt@3M0iA_OQoRJS^?;_S?JEFQ;;Z8&wQjYhA0?LF6?0b{`itDXD0i4
zjUQ@KM}%phb=z73)IR<qjD7v@O~*P9M?|x8a0q|O7cQW}#%L;d2(%iVT~!=%FkV>i
zdxKy&0EMuoNTHEf=Fi26Yemcv<t5R93AEY60?L&+lFh=^9+@$9tdNI<eN!(_P2FaP
z8fFFF<MW{)(UK|nlQxFSzUanrM}N=h@3^fu6M~QdABxk{CxV9BZ@r?5Q*tV1L{X7Z
z_Xq?o9ul~Be}D%(Y!)W1ssRy8#SI;*v(RNy3bk#^jS6IusLwHf&z43o32#7Gj%{{a
z&{7v%gTH4K_@DXkuA49CA*N)EEPqDRUtEBo$K%%u%QMCyh`;e$pR<>o=hJ5J^OsyK
zI(F9m5vBoa5aEM_ir@f4jlnh5RY0v#B%41g0D!~{0ZA55XVA4=>dz1$^p1^GgmR-U
z#D-<6`KMb%O)9_GPs{UPx0QCrQldnV3TSkdX=t(j@3*1iv!f%)M@T=&(>B(p)y~*#
z>!)9<37#JMYCWsM5MV!N|BZTH<seueeU-zJB1|}YlQ(3Y2v4g6AGSf7vJm{NPlyc}
z^CRyI=Ib9%lM)#0w<*k^>aV5F={c8~H!NN2hk{OLSZod7UHZ|@kU`KP85I|6w@{+{
z)kW5wzn5(#&hUfP%${k$3zsof<rjtNg(b+#@e;FgweD)NBN@>uhMB=AhU%uXiY6C<
zDwMw`80IwzO(2kFF?d-_1tU&vaYE5bD#>!+_ggQ$#+8>GxnTIJb4KNB*7n`_3XzFg
z5M*A;c=nRjoGs($fU|5p|J<zQYH3~>rgP`Ne^8q}D-NJcm8iPRbqVR`J#815+CF*y
z9+cOQvWzM55}0+|bP@z7!+NlXnk@b%i65p*bb<p1(3!frZd-BA^pe)77&dgtdhB4#
z!Qi=6ETNrLB=B;mn-5N|_WZeDFbJxJJ_8RDs2I;tm7B~1s`ptYyQ2;k#4})C*7||q
zfAbaHB7j#44R$s>?!7}gVg-0birHH72CtH=FW|PrDQP0^!dak*6q&wS*%1#CPZh;1
z6MEu&(2iMAQy9*O>}-x5i1OuOR`*3Z0FcczDpy_602-05T3rw9fPcctVlv)rK(hk1
zG>K1Ibgd|2b(p<0YDFrVCOyx4tch@G$20%*@=;!g!O9w~EgJwEMb35#a6Gz#rib0M
zj#<B%?d&$Q7ED=Rm`_E)SfjY)TP555<6>GFtSJqZhYha1v2gtE*6hd%x#^?f`B38&
znLp13qKyj`A#b?8$T7l8LSq=F0setqq!*dXwYvWCw$!Z0M4-LP`_j{=QslcRb2bX@
z%Xnpv6G20xerQj!h1uR!yfZLMkGJ(JpO7h{A++I2HizG!!FoEL1S0vnZD{7E+gXda
zfWEBRGvyiMfHLnzz3|5L68@nFF9X2>A|OyYEvM?^<h7h73Y^)4zO~*fm5XVnYPfGZ
zCFXkPWv#1Kj9icmHK!``92QXFT2z%jTWj3xVZK<N_7#cx2(B!cbH*53`l2icK$fEM
zA-~O|T1-t9nDz_1?WFaX82>A3GvHbSmZji&1JFY>Q;}RmpR4334RbC{)1!@-II(af
z{T9MX?`oo#a3FIS=pEKnzk2r%m7hsaz)Z2WXga%c@9owXKfotWgzm2#j%2~I4;^n}
z{&ZE3POpOy8+Th-&em#{+ws2!RrDx~k(=yuR`yDHv@#3v(YejC;p0bqc|<a4)zTUb
ziPq=Idm{9mg^f}TvMao4Yh!J<f%EB@PRoJrm%|Lq?2x#a5X7VDP}aFi-HvEU@elX2
zuaL7<lCdItA@9bD`S|V}8A8mbt@@O+ixU&e?*N5nPGv@$Klz0eiV+LE-tJ`$1qJuY
z_B9U~57Rj}?_bx%A?sxf)9W|@iGN`6`MAoqC@rFRN1Rp2kRKjT)3c1pj5h0`S1H`9
zsbGIc2no@+bctTlrbiTYsRnd^H_x>-S~E;kI@k_6SoV{|mkSvj%`N%In%$A<B7Bg+
zOb*^0p#FYX()J;5cu~xyu(xl<3>^ok1&PzAxRlCvEUPIIFLpGFLdBQ&kq#7Xf@Js6
zt8rlL9V@Cax@&)^Pg+Q|>1LMa@GA?}jf#F~aYxX%lu;#l*eF*?T4Wg6RN0ZJtHqOe
zC+3v8|2nP4GAAdeg=20HKk=)2$Y~LE*?-$rMWg?AKE<n5?z=TjN{(3XuLC9jgkyhj
zvxuN@`Nyv+!gf$sUE0Z+dGMm5N!W2cor4hw4p_JK>1p48BZYKsbePkm;c`u@YZ|U(
z5@>I1sI_~MG}(_?algU}7t^`z!6EeC&J6yKPa@`e8(rbiEI?-2KV71vn!v|pd+WbV
zvnK&sm|gu%qNF6gRqY;T2R={47#PfAQw5+eMBY4>^HJQxL&hNM!T|f&;_A%do#}YE
z6zke%SD4^BpVaO6z>DeZ1wrdpHGj@yj$Iq}W-p;1Z`!kvf%5KL^W?}huFqb~=>ea8
z|5bs<iy*zKLTDR*xu!Y)%34ts6yTanSHlkLmMjzOpE?GlUyKqI9=by6&h9Uu%b~a6
zau!h-Y@t=a8mtL#iVHOWUC`rn*W`3}z^YbOMlUm+df)~)C0tBPFQK<a>d$?9oQ9fv
zs<)N~S7?e9v2)CW;osXjs7RQs{8uHMwE>CYjNMRqf@^$8=5Eh|6WfALH|v*d8CA8y
zA;p?ZWEIy*E=_sOjOGb1ByX{iyP_O&aGHn0g63`|LNGyJBPEqK!ioZZn{<k(I!1r=
z>`>q6X|~2sGQ|4t&wVfRaYsE0vu06--@CQlsmf>tR!9cw{kq$hZ-*Q)VPwjVWYL=S
z)Ma>quAhC3R%ay*&~FdSr`yA$)tSi(7R!ampd=jy0EDWj?w-<8JUNP`okYAL%>lhZ
z3g6r(mYJb#3d7Q+*f5&}p~lbimmsfdlCw!H(159?Ce6bMmPYiWLpam9qJm-Ut?C|n
z3{zlt^KY2W6|xVr$iiIRL{%r79VO8W=M>ar9~4qK29&KTJ;4pKM>o#t<)K<t87Y<P
zQUIxR6f{d1IR@bZ_u{Rjzfk_JB*%n2ae<!-g!*JmJ=TD-P#LTig~esH_J+;Fql!-<
zgAy-)ru={<*uC5HxFUHh%`*z6FLU2lOPmJy3x26b;1(E?IlS0OFcyF~Hkl-qfbcOS
zq&Tn>8=KSm(G)xZvGCgnYhn?mDNsnBUP+Zg<`4|AKu6=J2B(@g)cm0KlWxEqM`~F7
z-0ZOhjhVu{23UVI?1Q?`kE6hFIT!12!+iLkZqnoMO3qR4lE3`-j@KH~(Iy;KKd2Ob
z<C`k=-X!-wnh@^nJ##k*#}OJvnNcVt<ChC&C^>7Eh=HeN&v$jd7LbWbD`+Q%<WNh0
zmZNZ(<LQezyXpM#1l{Zjm=rB`P#oU~z5WM1N3GtkBQ69s>};Imcp_RQ@;OD^KY@@k
z#t$o})G!RD!kd;zZa%iPhC2gX+0^*<lju+^{Ki-;SOA{yhx2?*&lD1(-t9q3{=&ki
zxngjJ)_c8MS>DZSgl6)+bt%S!3OqcBwNzhSlMVyOVFW@Zeh#fk*HK;GzOP?*G62)O
zy<dKM^0P8O{`kCAMjV$Xm4+$=wX*Hp=$7%UFn!2j$Q1!nLRGNJxHFkIzlry;mEdMH
zuidi%hJM}OVrszwBGr(AU;sC2iIJoVF8%k9_woE4vCeM*2pL2Gx>kRTh0)hF1G2ri
zU#?#o+AS(^QeY>{(Km>2)SE%SQrOumFF{4OClX*~SK&R4dPamcAMtBRYEU@6G+UUJ
z?8%8EgxmVwbi6uTdjrS3Mpaesk0mQ!$vj$;2di+?DiwiJE+p2X1=<;_)#gMA;R^Yh
zrt3V#hn)R_n{?_N93vvP&>r*5pJrZK^}`TH8wy3jW`dIK7XW~L`2LTNuvpGsG`(T4
zzrkcW(WF>fwo5*xPw2}e@`O0xe&keDU)>mTT+sFUQR$r<-)5F+4LTXM=EO47;-17p
zA`(D}>h0sP2Lu%E^bi^5XJTzUAKiUL?)$i$cXz=$d7J2@NJ$<Iei%>&ue`r8WnAeZ
zwm7x&+btTL&eyV6ZZr@8#LCLNk??=8{`}i#y9xS{QABEMo&&`%2nfA8y5DTryDhYw
z)!zbLn8(EA=-aYwmJO1-XZjvA=V?qQ=a>q_c@$d-K|>@*8&&Cw9{>ar<e0bMYv2IF
zpJ)v=UI+UcV*dX_wg=y-hkMRmI^n@BF@SUNu?dOY_#?c5hn*gpi{&`U6|T#>dFaRE
zep|`NLl9<RlHA0(y=3@!_&qd;MGQNV&KA_d;+EGl#hQVjsVc$DdNf_&LW41nWT;61
z4;fXl(D-L=BxXlq^~7dKB~D-;A^<|gkop)5Ahrt;Xjo^~1E{+NC<UD6J%5q~j{cM6
zMv;DDe<WJ~dDNHXYsH!f#D>$V9?1+$$h^eb?yBT@42e9*u-Vl!HsSs-!-p<X%yQ)2
zBiT%!<FDqllvQTe@a_&bEr72>!Zm(e6nl}Asmgd-Mb|pne6BYkDl$)&2P<7T2^atn
zE5ymg%bD`le;2zzw8d!TJDIukq&iuefK7(TKodmiaFl&w@(gORwADi=yFzMVn+L5a
zbimVp;O|aPX4S2Z&ZTa(;G53GR253If-<46&EO*@r+!bMmX<BItAp|t7zuiRt;@#m
zOUSCI56sypca%-6-#{q8D%h5#9PZZI<=CJc_AHKKY0d~SF|T(K#uO~vb}gyOx0~al
zumtzKybRmz6}OMmcd4!TKLLd?@Dxz)rxWJ~swF+;K{?gDV-F6yFRt3YG%ss?(?K{%
ze#&*w)i>azZTh9mXj&{oX;La+#6sXoxcv8ae4wF;q1+Szr8WM*ojMOmsN7d|w#sW}
zg=J+5w_3tpIcghN;20FL9Puc4ZlGl`x>k=>Fo@-7AA^{6{f_=_v7OrG4#4&!MB4pl
zXan<NOo|Al0tIl3<smeBO15MdNqzL11cNo23yv+>H5BAGfH(A@A+(@#SEFn<2%I|w
zD_5orPY27dkxa!NQ)8Q;Rj0r&o>VQ)($~?L26+!^i`%r%@y1uxRAv$K??@f&*jEjY
zv)P)b9#mN4(3>$-U=&jqSjt){@p904^(CKevk|N+D+r!6cBs2E%K-mT>x!XdiF;aw
zj5F#9@H~!*nOQIC=MbO}^!M;SI2Rv45ZRamo7VlA%sW5!r0(XLN2kaaFebvV`PX}j
z=yq`2(f%XTkt`AL`K8-q+vwPEyW;oO26>0XH-$rOel@fH)FJP&Yjv=-@9Eu1Zl2BF
zLX=p&z;bBixO^?n05Y8lGz#u)-Hx(>32DU3E|ul;c3&`??bY<yc6vOFO{6K?+Gf~(
zwco5IwfX!Rmxw{xp1$a?Ue8zbWO(gV>>+zY{<a4i1_`)+N$*0J=Car^$72-Z$t`ua
zCM9tmd={L&(5Vq{Oi@dWaELPv;13!-=oFF!{Dr78cEPO7Jb?rFbH@{Xl8C~>Y9$d@
zf4h$XGewiGwF(|TwVOwFp(?+`G#V;t9DKiaaVw?BMc@w=CRYddN0m<M1GOk}sVNA5
z1wgNM9wQ>vlB-yU1<qk5C!u9fzX}(s!=b_bF%%C)LkZ?#Y7Ag*(4d}%gdFVGbNl?>
zw=W{28U)=2UOf15v1}lXw&e{86U?e^;tVyZ5|ql9>%<|lXh=ytR=EiD8M&_=#^w!Q
zP{Jrepu$sHtf&vK1lkizH)?2G%`fJEvP^`%p9;;g;Of<=l3+v6FDI0%Fhq&w%LGYN
zHKc>jV5qM-HB_|95?*i1oRkG1AswulMK|Fs<J@Fqvr)A=&rl!!4iv_-_kmkqJXac6
zQVO9gKN*9I2N3shNF}0UX?ifFX<%wPa4pn-oacg}O!=-efw+SHAXbqVK+JOV_7rs?
zu<K;W-CJw0sEs8~fgt@?+s;Is+hhZb=Q7l!&S;gu^G7|b0T-)n+~$_s!%>jH8^b@J
zc8<?O5O|2`M8pg%#{zKE6Ghe^mk4IP7_D<w({oj`>m=#5yIF_=^B2^refte#o_%b$
zv$h%WK7(ilJXe<+x}OaVoIGQoIvF#3dO%N9#2Qu<#f}6!ikU{*V|;yww^z{LhM;1K
z#wYbrV(?L7lu;-ZxRH+u!lKE7L$XpVlXL6FH>3ndZ!*ecL#g=&`JqJN73S6@R872V
z?N=#kaY$F9rIhX!cp*)`FnCV4>s}moD?($6+vj4yvMQc>kASob5Qi(&@|)98xPb<M
z*@qDA2$Ls+`-As`=cR!Irh5$2BA|JCuq)p7_xygslyHa`L-?c2k!Qz1{VaA%J-V$~
z>&aAcKp|W~CM0Wra=Xw%v9hHaqc2==hLML}!<EqsVmZUkw#}^;*7^}x<=nZ85~UY2
z=X9zPzqy6~N4q%9Kc5<5UfpzNQWxFHGr=l<pph)VP`1F*S_v;g#xltn20pKVy}i3V
zcE~nL1%m@YC%8UZE9ZS6*<4F?iqM?XO(Ui3ZLWu}T99+eR@d2TQ}Mh348I3r<ElAx
z+aA3OeTnlrXfN{JP$czEHs=T|V`#(C2X*98U2`67F@|*0%iQA$vBj4`wki%O`oA6V
zlT())#M9Qav#eEj$%>WURaeA%#4luUZ!ev$ZDIF;*D-0KDY6n?-U8HuHo)Qf(b1lF
z|0DsZU7rLweJJsigSYf=rc>VKa{WJu?R65?@<*+0n~%w-xv{>}qTSaaxx7p6-0qye
zO$G(zv2*~YZMWlH-}Oyj;B(ceeZ<?74rr9}&TSOpvai7c1NM(BP`~L9GY33b7s$DV
zzc7LMV|MOOp5IJ|B1#puVY>sa-NPlE4|8}(i&$uvknTi`k2^U{?Eari*ghw{u7_{6
zd|*ZT9DKB9+oB@b5QV69_ebuSV8^hQx8>pmLYhI)Ed}ULD5_YbFDL+9PimYM7Z5Y3
zZvSN!a17?oF!Os*YMKzfW=Gf-AT+{8lZ9%i%|Ns>eP<01=u6}`l*zufrRi%H`SB}o
zh<v}yZ|>%=OQ4*H^?{T!bzlA;{f<Ug^P2$Z`g$s%IKOyoNeEmDD;ZICQ+7O6Tpii+
z``244b{%-!28FmPla+a#@A&PfEbILe6^5s`;SBwg=%#YKdh+HL%$RE1C32gVr5b}K
z7Kw1l#kzy`X0+C6?eSI(kCE-3;Q~9*WPCw*YPH7p!&Cph(B3M6<5$F=S@ZmM>plu-
zI*3`jENj;+PsQiJAFq4DmzP3pKrP|9*nk9i|F!b$+`p_Wj9@^s%$P~*9TcKyE7F44
z|5%4SI%1mS?oTE~FYxV%GfA57)8Q6EiP@RC-rYNWVeWYXqwQ<tw`JUH?#<gJ5h3!B
ze)5{p<kW=W4e@5~Pul$VXNJp5GMAKD$Mvyz3rdBS<5_I$sy=C09KUT>une*{$mNg?
zQc=ldrdLs^GSARDofcNWfEQpYjy?nUpyS_T9MZQU*9B^zWk;`SNv1j^%VXC)I>C{k
zmDyHB^TakCzAdan3qoY!9Ag03`8V$E-1P0liDix)@g4)i2G&wHdE9Do2rtD(h;~sf
zmhh_qN@%+Xxeb1mpg<l}Hhs;kNm>SIRJ=jv5<(Gb%q`o4>L6z4EUFk5#Sbilg1KGm
zW?Y_6$C?onHipPQpKGFm5;7;FrbU){(Q8*-<DDtb-;^s-OoTzCz)<f5Fa;JHxZavz
z@ylgqg{7wZ>%)&(LC(*duVCxJW6PW@usbFW&7INZ6krejlAqV46DnCsEdSO1qnt=B
z!{z6~;fdd%p|-^+Zc$l*eocunzMNjU$r=lF6y}0<JAtfnDT}?B`eI{xAY6upqfK33
zUqW~9j;FhQyfD;!_Bb}duOVKA)P2Fvj`IRf*6$(fo<#c`?~O#C{l~h?A!zGSpY0zj
zSvQj1blezHPfF_b1-wvGQSbe<!1#^GD6D9<4V~$TQ?%LkFn|UbgWvyHr_9v(_r06&
z3CZHkXSEDBW5Ee;Z9ct!Xva+x%sz^$IraH_;UhvVF1`WQ3sahrfzwyK$Afd%>y32l
zXp9q&XJ~!4Eo^&6UW*@TS#OgE-RS?Ae8VXg*O>2II&P~I;3n@~^llh)d~ZIcp!7T?
zc$+tIpDMWN4&Fm~;{Au$9aOL!$okhIBiQCSKN)ow(3VZMw^J=(%j-=GfMnLhX2S$F
zWBaKBP@RBpz*~X#7}T2wf5>p6F-S4#fh3sSoSS}v8)i?Tg-xpWaLI3#sWaai7yT@d
z+qEWKMU?Xhim3ldx})BD`jO_=42x!g6)_RbriD%;A1$Mfwz>VLGL#WCS_@yFg=5B@
zo)50{3DsV^d(Q+Dq6Xpg0~5Fap&GQK6bNEJ(m;M#B}~G7C~DNrEgwtY%Zj^=-w$iS
z5h=>>@a5IXYBbDj-^N5No6Qon1DL7XIl^;ky-f)wGZom1lqicCycLX3lw?(HC<fV8
z^V@L~T+qkF*qsq(&a}*Mf6mYli1({`g!eLosVjGd1>rUw0;HFc=1~&!*_;r96;ws@
zH1HQcaN!kSHIoxga{`2+_8j)`Usn+ahZG!$a+H!;cb;mhI_u&vjfeRZQA?zvsTGQ?
z*d%Aag)}0rdw!XCS+3P7a`xZ|lE}o{2auAt;haTZm_xh7nv_Vozn+fKVLiOi_SFes
zzX)N2nz<oj@d>t}Ssue9a3=v1Rl9e$WB$yJN6c@J@IWFIO)uB+i#-%Z!Mp38=HKs}
z53j{^z^SN9V9z))0NI@KJ1<57Ls=)YjiZQn?^I-jV{1RN5-~!f;N6S=pZS&&-A%8L
zXSroYdb<#UQJ^(^xY={m3VEVIb{F&5p!anU;%>(YTV}^?U%}gllaaFP*87Me=Z4hk
zb4Q{|Vn|)3n_;JO4?6wD^2^i}RIZ!H+x5sIpQ^^>ufC&Q0+L;fz)Bb-j()N=03hxM
zG)ypb9hgvR^)as(646mr<}qTft|K!TGJ;_XX6Plc947z}1>S{<bRjlCm5;9@qd5tG
z9LlUTbK*v_m8%L4D5~xa=xoix^%7pzLnd>=jO7IoV;}}`yY+Shgw#{+{0(HSsYa)<
zj`m>^5?HLQ7ZwtcBUtbp7ZSzG781+jw}$YkdB>E<VEl8f5{2V&tD0*O*h(678F0*G
z7F83c)aoy!<vC=GEsyCD%P7?`*o!F!nU&8T5HKb4N-Tci1qPQ_5Y11lfotiOkx%|`
zq0Y)%q_!+)%?hGZlF2F#2LCSmRJk<)>#6=<h+t095G;JkQ|t!Kqr;Nib{!#{_jq?Z
zlD-XrEnt#2;;#L^<7t94-vbH|zYah4j^w>2LCx*!^^P88p_t!DlxOPj?FcghHHWX?
zJ}$nNK%IyG7!Q9|vz@#nu0>MCJEWEs@(wTDgs%!i*Hx=+F|x^$PG9t(3lOY2_8WPx
zPTsQ%4t;rPKUW3ZwUVo4w5XW$SzK>)cvqcXhVAC<I<Ir%wi04w*7B==PCcHnAraNz
zT^2ELMYB#MA$SgnC2TpiD{N49v@(3o{o0;ZO1Hh*qcc(8H0hYe{GJX6sOxA+7xVmu
zVUV%6u9uogT2-8{cYf#=B%8y=`APZBW->o}wy<9PJT61GrdfAeNT#O9%95_+GfT%r
zEIv3kY1i<(+lV#IMqt?@%iDlZi#AUlThWMtr@nZh;Ni<kH8zo$Wp-G7cG#sLhM5NO
zFSMCul~<3zUdSp`B~-%<2R*HE38y`e6$n4>7Nx{ASy~M0VL2x*JZb^|e3*=RW&{b*
zv>zsX(6&^rh9cmATuMrz0$4OuW^4Gr$beYP6k-@CYMC;0-7AGe!o1ULRc*ceLzbd>
zVs>;>73>fRnllv4ta8oV(D1GB$yyO~nxb6g^yd|2+^9$8Agv$PVtOGC7Sst60UnTf
zE6KcFgjL>=xpET|`UP&4qTIjq?2D4H^a}F804g=~7*=bK4gXTlXs=ZN8nT?wD$tn_
zb4bThPunESYaJxT(i!ow25ZY@5wc)>8bF08lNC!$ta#k4qeVKB*!XWWY<^$R6FE6v
z_};&TK$>`1f*{BmV`j&>=_!{Qm7x4Ch>{$-{eN5l&NTwBb*#R(e>Z`M|4A~QbIdl8
zJh7*$n5`QaTz!@V%Cy;kHWugpx~csVIGIi6Gq>P0%kbqBU@HF#Hs)K+u3C6eJbJ>%
zxH$M)tWt*wR<K<6+@dl@j0(xhW>83(zG8FNcs|AwIG5pPCv$s`Xt~`@ycv~srVSqc
z-~>6OJlX6{ulw-zIT#iw0q0#ySxZ>^de;9IRA4>gVD$aQPU(cpD^S&go`fT6qI$YN
zboBh&$q-hLELXu$KBJLAy5!QZ30}|@;Ayj_=xSZV<XOJVdlC*$V=6$ns2OXK*M^4Q
zz~*x>(V~9m&L<ZCjhX{R6TC1TYvNF{+i47=SbYFrN|gCE{N_J=0B~IQgIaD3dWN0|
zPi_QNNfs+`D%w^Oj?E#^(ml0{D%Ke$0b>zYiOsS8kOtVNnW%~os*#u+rrjtZe{3R;
z(PyMgOHrgk|6%pB(NjmJKmu7NF$six+UXAV_m94MRHtA8l*pxN&;fq6I3~`BT*Q7V
z3yvQKI*`LjCQo0sD4?qcN8VY*sRbs2jIwMCSDrm`r2Ofb^IC~aG@Yo9wq%PbXex<!
z7a_-9YSVl?TvmJZC`*NLdi+C@Q`R>_mQ$KYVN&X>O7m62Q(Cx!IC7DGZftnfIpnPT
z^r1S*9P?9aqEqc4W(3+Fnj(Z1f~XdUIT|GM{EL^-{HRNUBJrexc>>A8#W-re?Z!UI
z!V~rgBwqZdsg0Ba9di|vR11hjEPckRD;;4u+CXy-r{M5!fnNc*?lp~@J&i$<^y!V4
z|I^;F6En2pX)3qAoGMa>;Fw*oGPN714W}$xEfK9w-daj7Q6D+uyq4&NvBjf0DK^9T
zGNwDbWnAx1dG^FUtSO<DlumtmUK)^}am=qhagFR;-#M!O>t&B2X|kt~9h!#l^G1sH
zO>wMbY$ElQ&d+PPXnCsJV0hemvkzbYT|;GK*<1|bhs*<O>W)iIn)V`#5i<uf-fh;J
zR(*2pdb+NDKDaN8m8(j3;OIkuSOcC8iga^y&g`BVl6Yb|CA4g_XEyg3rn+_pq;1GQ
zY^WKs@{c1tZb1#c4jn#o(1<SK5WqSf(tzK9kO5*T1u+8uz3F#O5e+!@Gpq=HQfV^c
z0hoD2WL#n)8kJ|gc03nBM40)UDxO5}*LDm8*Q1wIFhAxB`o|xg+&!m<>G~C17qJ>V
z#J|2zZzriFG7@07J|+sOD23JHz@R}uLJ<p>{PSp6epn2Y3k`w%7iU<gg0eW3jkU7D
zdmf+3zPk5IB~N0KXSY!-J%9oLkd|?X2NN&gdr=+Jo=BvbR4htkW0u7{mX@g);uc~n
zII&J*M^k%iBrJ+k^A@OJz}w3;i9#&`Yru%AT#n^UG%hG;py?8kJfU6)EUuDNl94Sr
zQKM~7E0U-xPSCEcRnbtdl_oGcC{#^8dB7cOBsf$#Wuj9!XcS2;UVzD{k>pW;?IFk?
zsXpM&<ph(9oU0akw6-28yGi(!KPg;<BNm;4QM}PK$<{g)ib~<+so>VJ+^CyKzRt)K
zXQqui;E;2`MLqVGbvuIRUh`j3Gd!*_T15Rcwe!8^0?k&jyYXR)Mn-Y!idQbnpxbT4
zKnk^0-pyhB0*#$+N_R^sQuHDeSk|d2*s{Ljo)ek05v5p!b=mFd0OF9$cZGoc-Kr$p
z#>!d{&{TB5=Y+QlrP)YwbKBlirPs(ZcMm};h&dnWq@GN4jymq-+N;gk>hBn{nLUOY
z<)FC*2TeyegX^diROHw!`07*~x@hw?b6t{-@-NUdYA@kPBowaFwoJlor<(S=D5P_T
zONA;@Cd0H{b8wRGQ51@a<3RdtfcMiSUo8fCLYvsrk6G7mPUVzekPBT3iqIAU5ZH-t
zk(}5bOSGz1*-kH>DmzFhJzU_Og5<pCt^+P~Za@2K5RQVT-AD#Y9h{mP$_lTH88xRN
z$p>=Y%g!%OhLM*nOEPihF|&j!#NDYy!G#k#&G~;cT~mBrZ?xP|!^XC4+iYyxjcwa(
zj5cYUhK+3}jcwc3J^y=u_h~<z{dU&=zL~XV&7_mCr=Fh5Y6uLFg$V0cRI8Fw<7j3{
z(Kf)uglX3(eG&Z*^a%ShVF1i7h(!y;><GV<VZM^)@Ezwbh`S+@+x(!;Zd7*+wwQ>%
zfg!g^{jDNj=JwL+ElGzMe3X2`iv4Fo9ctbcFN?M-+E~oA$y|wgutwN*>g2vb2Mx>n
zT?}I)+4w+mNLu}!E!D0V3`p+%i#yjZSzShc?>#rDUE&#^9GInBUVd}`R|7vjOhNzm
z9GmucDBSLwS@Z=#_{o`>Oo*hBLj027YE%w<9mh_GJ{AgEepMzFpDgkOa_xc(q}`!*
zB8Xg>HQS>iYymL>_PU~H5SzXS1>(o<*ViCDK~(y2DyQN26~TuEo{YWsTFM)88X3@z
z`#m^|le{SAVsHNKvo@}s>_5~rC6<#!%`k4py=?n@AKEF|QggXv)W0oZ)R%9P*q5AP
z2pBDPxU5E*p7eeT!M{i(de`vGu$aiYVDr^Dq6VHiulhY&hFrt;H|}#4rangg_5FUr
zp}Du_xc*`2k;U9JMGrjvdioa>5%GhfHR=Mb1S%GZ8?FEQP<cS9dg?UJ#e=kyNTR%v
z65qzgnyNQ}u9WlLypAMYabs}S@w9wNW7=Y>G@&3ukFELs{H+)SGQ0=ruZ+`u+*i~1
zPL;5Kl{Dth(bexj;GwAni~<%6Wa$s4pRS~}z+E{88ZHQs&>#gG2OHfj5m5w(I{Uj)
zDQT?fZQ=o;$B&D-3dk0F*Vn_P8sCjI1T7B9C;bBJl!X(ieH!;<1OgF@D%|#`lvQ2+
zEf!L`{*?BUfXc@rRfsuse~^@ur+8GMNd^~yP0hl>7qxaX(-&AAlJeyeC}^Mqe&X|L
zSI0kGK>^Bj^mT<@+iG&D^o81-sU^r1vN-W+W*u2G$DpMNS3X3GZ|P=KGw0mY1OrPj
zR_ekk*w7-viuFH_F?j0~1{#N`3Bqcrqs1}2zNM<L*;!}sr1Z?y(bLSkM5|c4;f9JI
zyS7d?f@r$vNggReTKuFWb#nRW>@2<2fgQDaQkH!<Gl5n@K-noOy2d|Rb+PHMv@if)
zm2HdBZJ`L%A|H`Kn~k4!6KR@2oWf#!-K)+YQ>s*Qc~=~?m4kid&4rlFjrtK#Rtr3U
zsM^N^W~cQqr}h{$+abmNvZ<(%TF>x78~kg<xq<qVrf3>G7~4IZCa(1tii|-P_jC1|
zJhm6r%9;LhFIk#goEK=O+8e-AH?$01%UoW_RK4sxFV_gCV9Z&p8}>Q0;T689p7Z*V
zTX#}*lAKMhn`YOd+p$98m;wZ$&m0kmdX&;U<{ajwgjz(ye~JD2WtIdC9L!lXX}*m?
zHZ4ZaYz*YnSk1}y7~(5Wm6#&de0cO|EmUv$hr{R6L+JA`*J~{1;3H@?z;k&5BVdYU
zT!zQ@d9-1mKE2w`_hvgUeZqA6G(G<@MwPL8bJfvp_5MVT;nZjl_3zO`j6Fo)J%b`Y
z)+*$9C;RTn7#kyW;1Htiic$l}T!8)QaGIjFvVV4m&yfnAPg1G)I{M7yp|s(j-V$@G
zVQ$J+D2j(tm4}4OU80xcS#d#rh7>8c`36MW$LJt~PdCk2o@%FWSY+nvYWPMq?tUS`
zFq@0{2fr|Wq)M&X!NZHdr}Mc-D4Hax$~;GNM=ivwg@zlUln%evcC^H-|9d?@;fY~p
z7c$`g*!$WQ0Mg|}Mt(KQ)z~|5a5yEshV7?=h=##4l|ZEr=LnM`Gr}XEL>dO4tfj2I
zcA_^<WEK|_jVyTD%hG4qd|KeDrNt<v8L+OW;)9;QSPx3<Hu%%}XL~-I5C|;Zu7dvF
z$Pss8juP{t1_+~m0WjH%#4$+ln2km1xlL(+xyHrsIJCv!FcQ6ks9J@Tzk**%9l1sI
z++lmT3t(&`loXi7g3-8)l^I)5(jYY)e~#%P>(>djjIqfd5kdp805Xm-`8YPA146kA
zzZyz1j@#64sq*HXK5pFGYDZXo9%w_3vfzZqKLOq*s&Dvzk<$XETFS4bZ(Xdivmz5s
zKZje%g?uPtYLR4#0o%0}Yn#2yF%`yE+S3^q!&h_J8UonYGF72uL1k_2Wp1atk7A)}
zdU}K00LkmWicCf9143bc-SSCgKa1`*uV`lYC_+CcTDqPUAMFBQVHl&w=qI(XZ3OPR
z96H}`nXIwbhJslD>fG1k4qL(T*2#22t2eUbqJg2iMgQmF&8Fevq^jV4q=!Pn6MrZD
z)5fib4XkS4W?!%C!Q5;vB!2lwKd%+2nCF6I3Ueg&YQJ~~im1G9|JS-bcxM6GZ)vFl
zE6>9V(^R45hWG*3^Da!@?VnLYi1zUhS@<^JTJc1UG2PQf$ME--iwJg<$?6tkA80Nx
zq5>s6hn~(4_1quvs<r&^*J8rVNfhy!NwHBROWE0KO_U!9O0dAY9|kecZh%1HkMi6I
z@hk3!=cEg|shc#W7wPA!lgSS0`HPoXKDT#>z?>cKfb(gv-xXTvVHlX<KWXekdm~3B
zZ6b2muuw$wP+`V+I72%K31MYMc-_l-oslsjnYWqgVIk!lgG#&0>A5Y@P{{GOI1`-2
zw+?;?RoPcap<3fE6`8$wjeiNWIsB+0H+53BFqoKZ9qi2gD&>)8!Bpb(?R=8gF22OP
z9RisZQU0ptcqERB7ByT#U=Ek_2jnO?%Lo$~Fdz6G0I*qtbB>rvX(J<{vU&$6nyuYE
zb4q2@?wL)&nZFFc3t#ms|3)DbRE_;Q#_GmS1PSeQm2p)J>sQR)j`Y<5$zJbXO=4uU
zjqCkGaW>y+B9#?!eDf~k5X@+xaiD5Bnw$@dQs2pGumpXl^=g0Yf!y6taCfJojxl$<
zaO#$E?I9N_c(+0acd`A^nU0VtGq>LRxk;9_<bl7-T@H2|-H_&SzAM<xe1dNZer!au
zB%O(g`fi-|Gd4A<q3y#ppl|HqI!bq{mAu_=^YD<r(#z#`u#>A)D(dX$bD%6;ZSSDk
z>-^VEyNVBW>q}}v4w+!P!zr9wl7RgW2D<0UHi3;>tKFXPwbVC`OMbWACWlt{kEo>_
zn{uX&iUz4K|Dc@G4K=;x`#N6`8%<aHF-a;yb-B?a32W`SUl*vp5H>OJPUCiZU#rW$
zKl`-%a1kw&1{%RBberU`Lf}j7%t0ZFv2r3pa$k!_v{%5TbA3S!IoB#QBE+ZHP1WpV
zudZu+ejj8ZryD-U`c)hKhQYDkL5%JG`fWC)JWE#-6AO+^gOjPl*1%#p2M17^Uz0;c
zyY#QFZ8bF<xUogaMUGv3xFa3)G}8JeFC5J{jy!{ItfiICjKPl&&i5r0=#4ZwDUt>k
zCuw|bP9wlN<u1S)-)F&7R^w+Yu~!UX#y2kxr~X0`xSYY-1K9NA#E@)BWO{L&yY<$|
zV(ozm%iH|P0(UNtCkGiyQUt?N8PP<cN+K@6q}8IiYjwL0%7upQ_0;9VG5%FExyytJ
z%@Sn+D<ENJphx4|GLnhql2U8BVwz0^29Q9jK)@ZOk~$S;e^8;`EWv7jo;YJm;<oew
z3mK!-g@bz~Y+7^TXxWV?mk`ta%JViwKyZZ01Ji5ByW?nCr}ZmVHJ#5FfN-_rx@=oY
zU8vN5n7h@=Z-9-6GdYW(L32*;bmU%${ZMeXxuy2C#eM&u`Uuf+&s~RG*LM+9Uw);m
zAMZ0QpNB4=_^NNS8K}K9A3Sree>uYw7Kk?1nSGfXcdw2XMip~4JemtXj_h$STdQB7
zQ0fC}Pf8Yoeys-FT-U7-S-j^7t$j|S0ZJL{UDiLf$L>P2zG&vV@1Lk^$|-m@pGHMI
zI!ItM#=I_n-PeQ=UiCcfW59D!y)luBo43q6lJDBzB2$#guNlg9*^jBFc_F6!h{}r~
zs?x2nc#WX#)0}AYz4vec4;*Ucw9j5DXrbpIl<*$MPhAw;*qYE__(jRZpcRd2ntwL+
zC^X%K1C-Jihy}xb+hKP>5FZ~jn1~AIFxyaaJ#M(2@~L^=KOvAG@72=O8t%z5A;hK2
zO<}{y*Iu8G^JOdlzG<l44&F_|sJFiH67vR<An9q(&q%kwWIk4<u%)1|)*_OkdLBn`
zEu7gqz<r%NI~KLi^(^)KOVs9i<|ON+<@iM-6w0Lci!rW_LR}33xiVorK(fWDLCsA$
z9c46rfs|^&V2eoDk2{!Uh7?|w023htOY3M%n4q-0{VS1kXiPqwA{GW!4hTeRy!DNV
z$|n6*`B6Gg<h6aM%jCPQLKDB>HlNNwSGKC%QQqEeula{lm4xt{Tdygn2_h*#oDq~t
zE(dF=Oi3mEP>LadKf9BZCRY=BR^w=*cY_9875^MIPC*G)--*rg=2v2Jv$e(9g2XwR
z!RbrCz%3JEtq_w>vA{R*HaKy!i>Ua_dMnKmufzs#y76<pf3{u(?_OD4Y|m<ze=t2;
zI;4Di3$`Y5g1+>*@3Cx14;vuNdK7l^nJw-SN@HO9&|=&0`FNx6J=zd*SimA*Q+wLY
zzL|Vx4M?Kt<W(VhJJ)>c56bqx9qFMVc_Wfv-(IK4g#SGF>$AB;I}zK}b>d~u-Sk#{
zd;Srn+vT@yDQ|H5fJw35)p)$T)QO@QkL3gbsn>SZj(5ZOB@lXZb*b#q0msG?<uH2g
z)}FfSrS?Kz5ka7b!G9o!jxpPfH0*jhKJI&TyPH+L(|CJ#z;VRB<859<9;{$EyVtdm
z_g(Yt(m*xPt=gAhckUy1>!MvJ2L070)vLZVOHRxuE=gneBsv=}!ky#3sl|ogmfYm)
z>IZ+daj6ARgW#S@8V#vr`q}JAfj9k>5I`=o|HTLc=sr2@wJ2KVxgSERi9&|a;Po+h
zzlP|)1Q({zhCkofUY!!`YHT~L5)u?kdCOppB?S<#E0!o$MR3Mpk|7t!=^?lv-RgVi
za>@t2N0^+(l6FdgXk;#=xYo2H@B@B)F-R1wTIj+R+a>{QQYT(z0Lc02W&)Dk$1DYQ
z<FLW2q+v%ubbB5r_ZHmw0;P7<MT9G^l`=BP?%I51@hBoH!SoqhjlkG;F<A@jv@mzD
zL`Dscn=vU^Q&^hls{x)Yy^|_d;}E?e<vwKsVUv`OiOjyeCaN?2Pjs_PiEzm2D3(DO
z4__B*C_xs{FW*hrG|Hw~j#dfpi)T|=1=tbPYJ9NlbU#blpzAzzP<}e0Qr$^a*-R?7
zHCA=JnBOKTl!bW1nw*_Q$yU*8y>I86>`uz-zU1!}7kc*lw*4GAYoR<X$&ZbBem{Wb
zLTuN~({vS^Tpp+|9<>Yblj%IntA2_SYg&K!uZD7VVpLX_|2DoOarmq{2%L`2KMOr&
z-!5Kwe)MFO)XFl-<S(*rOo}eVNu)!bLi>9iPXIM#9;<`#L)!f<?$7%V*IR@Ri}6O;
zXcn4GoiD%f1>Icx>VL_@h#mc8YYVtO-ee%K;Yw4aV>HnFaJ>xY`sY2lb!5{+H|8+k
zz9Y0zzJk@II})X;k3bquV4_1>ERIa%MoKz!sHGhGj{BoUU^4jiD}z{*nCQrrR^z0J
zZzUtK;%ua@ie;%nBw5r78mA>BfUi0=kG1!TdF2>u)$YDo^>Xd6wChD2s9z^wHte5r
z)c!C3dFBV+g_oV|`Y-)&-lBb5f+G=O6WEJSo&XF5Ic*K8SF<qtR8vi(osaQo@8AX|
z2VdTkJ`70#Sd7+Wv&=hccBJuF`0Nm%z;uUHYe3quLP%6kE7U}qbWYZDoWy>#m(vZ6
z#=t_E^BCqEuGCtA!Kf$#P#S?fBo7%&9jObBEd^;N^d(#7dJdL1Iiar96hD5{Nn9o^
zDn1TuESrW0g%Ty6T%4nybR63mor^oX21;G+;#<!&v1oDO2|s%3I0>B>OOjcSC_QR-
zKV4>@`{+iIhBW?7Bjw)r*2!**K0b!uTcP_aRwZF*YA1!3@%rxOA17ZO)^9a-Oi@&C
zC&hn33_^_M>tKE+{dslCZ$2`bRBmJ1$zxDF+a6OLOD}ABj*5}R@@M|j+Th=p)Wt53
z-^_Ts$`!D?3;t|e?s3_2yRT`r61&>v_RabwmgzkpV~40G6<Oi>ljxMsP-pSl+3|JT
z(9k8OHsG$&#s7ngN&EI8O}Enz2dK1Jp)ESX<82H(fmXOk{|`D9Lg(kC_6biY-87+b
zp8L3}ASMVny%~Pq8|E+7U$jKU>15evsX4*YVB)N!v>9ET$fkepfTW;Dv%gEc7wGIs
zRO9I*2KpV5aEMepWcBLyj8@6v;5_hJ)6tNWElQI@C~ro#Auw-fzek%%LG9!?iLTEf
z>`E;3!oQ{GeLkGCFUz;H4uVq~8{+{rl2B-o$mA&7SJFc;QMYIW#&MWMOuH;YCrCkk
zM|XSS9|Dq^T}|95L0|P8LrC;FpfhR%Vm+m;AL@#KP2Q{pzlibeiAN1#$MA-+rD?w_
z`*6?HboKD_U$3wFs|Ebj{<ff%N;d+D(%*|Xm=k7uLMH7<V*sLUE~VLUjEP(Hqp^Ow
zCkO+XHDM!nJTJe|VD*eJ$ojfjDdCn#pn)7>2oiE6Ois<+TC{C(2^dIXWK8I6nrp~V
z<i^DHVK^6L;$vYLWSldAj20Yh9Bdw9Ap?!aganq1%T2y8E4v;Uuat|2L<VHjlIw9b
z5>=a{!P6&!MgheKZ}oBgX!^d~Hb>6tlz8kicNK_Th0w6>eRh&Q$s_22bweE=aww7h
zKJKC}vH%S|;vwk0SoqpVp8MkfLE<mY4AhE53mZsYh8Zxvbm8}YEfv1Wn9+E*lDSE%
zoAFrd(Zt1R+*IPNX(>jnF+Zcz39>KS<WbkMSZ*)lo(aHJ73CffN?Eyh7{MxX>9TT5
zmRV?T!C_XJc}H3hnD}bx_6%jHgrdmbR8gkS^S9A`tP}pz+xhAjK{nAwo4SH}b&glh
z(4OO8XIpb+>)D{ze$>a9X{ks@z}PHnkodLJ+0Op^FP7eiA&+)+KP@yC85A9SXK>p$
zVCu?u*JoSyCH>s1^U&XrR1914fprR>2en^qXz=G(LJrnwC<uFI&0<<+$#JJ%eCBur
z(t_!&Dq#^x6o6hmjWf=jLo%LNKi!qGK$!>eI%6UjQ(5APIE59hR<!0@8Kc&c%5Do<
zUy^?rJKyE{;)b5KQgerY8~=KRd2>{BtYDkfLUQn&IaJvgd@|O&JEscQ#=q7Uj=F4b
z^B|TU&U@rgWDS-Coqh^fM$c3kL3CTf+k+vpey>;*3}c+^_b>C1X;B>ZrdxAieXj*-
zP~zQ$^{L_~quk115mv*vwIGY;v?LB&6YxOc47ms6e(nP4Yh$|MP>Ao~BC%jtfUrJx
z5X}8j65$xW+i&iy8u9s^q{^tJKmwlct6$`p(ztua(IL6jjh>j(Qi{ft_UrmzRCKw;
zens{NYrHsCv5*Yj@R7ccH`eAzvxTP(dB;vu@L^G;pIiJ13Te#x6+q8!F_!n$8T>un
z=kl@gszN3-VnRxmYoF3jZ|}nU;8)!HrIq#y9Myh{3*po6?e*uCY>%#Y`+=LHfsyNd
z_yhT<&Bf6FZm0b5kn`$I!`C_iW~Wu{bnd=ix?L_k=^cH0PFtHLk@<U|T3F<=)p^f7
zeZcp#8B!8>(nHi}A=l4ydbZkMvcuYF{Fv}TlU<ua1nvAykT0Ls^Yf$PZEp^8#S<c5
z)9vPc@8GiryRl9K$bmSb?aZXNuuhYLUs%0JZN;+5rYj=$u(VW4jEMvowO|p)FG~hh
z6Ka1@@PI_4IwaHlV6_n#<mH%d<K7yed;44SP!BGN{r87~NCm69?B!JHSSj0r$lznI
zg-GiJ?ZtgV?b-QOvc@*A-|O6{8Y<`@8q_L7oh`)qnU#FnAlFe=QdZWaoqzfr*NVzt
z!kxvK%_bFA6yD-s08t{k9zH0>r*U1iv9zYOjMqs$2W`8`bs3iDq4^KFvOO%OlW-uX
zK4V7SBBv6QSCkQG-pcJ}jEM$pg<`9N(M2K~BW0@;R6ZvmQ?DITUxy-tg@>4jG6QIX
z+)~75T%wT1;M1m!XeMiWAGR`zh4CaN@9`W5PZnqlU}VvhFV~Kyt{ac)e8YneJk$zN
zaj=9=sE4G>Aq4O!Oqr&bzZLiF&V7lE!+2-Df1`<JIipv(@y-0r)i7b)&#v@@O(l5T
z_lu>0&!+Kg`JdrGfi|uoQSXR)GA4#kUvClRhaonTiq#Xw$}X&motJ0JO*QY4O}ijf
z-+S_p)m9K*A^UXhqk=98y$WD|Y=3|>BA=3Lemu9+O3zLDXJ@H@V?I^_)_vAcg4{Lv
zwVC9x9q(4b)$lvcy78UlSlSQ&kA|sOfjaZYmjP${-$QR+%O`8c62R5lQh2&39#ljv
zq1>)oE_9#%ullQduH08Tz|($b8+6ZPL%2JqT@A7^=N<v@mt2R|6fw@7%l<~M*HF0z
z18NwU_>fuD2^Wojxy^X`F{r{<#{2c;oyqv%#QQjv3JOvQ;3udj!-EOXCU*G>EDb&w
z0Ik=_FXma8D+C&EMhUBV^f*AYrf*?O^}MhFEsL?su9jRJgebNn<Ipd+F+#)2J#gXM
z+TzjkA8jLy9*rAws|CfVmB=>zkP?!t4V2v1(&hQ9BAs%&_V`?BrF3RYFQ;??@ADiU
z?1c8d&DId$VAyYT{4k;DR3sp4EM)K=NG@&wTP%&um@bOlyC0o$EI)0LbME&<qC~7R
z*Fp)Jcw!Ay8cPhbh2wHe9GLC{sZCBxF$f_u&XM;r7{{~FlbQZ&ar`)W=xNm_yH`jZ
zGdLUjU5>?~i!DMzgUoBvrdpF0DB2NAEq#ML64H%Ac5Y$ucWce7X>H{S%>&NU(x~V%
zwBrA@00JlwXrh!sh5Ywd(ZLcJ)fsr?To0Y;F4V@BdYBwTnR}w&No!HQJ}}2er4k2l
zvls7c^-XPdba##4qxmjB5X4EPJ?I^E9Nmo5DP+m-CLQ#G0DJS{{?`Q1K3L=LqtX8Q
zZ&<zt4R=`rZI^%iFCS*7Xfu;OipG7SKY5Eo9iyuWQU**eyv|{F=HcG!tFzrk%hfA7
zhr{qz@>gnJtxtYnMX<unrfvKMIZIkyICSitSL~aaw=|NsaovLY(YZNq(x>5#+ZHzC
z2E*wa-XG^cjcN1sU~$Zy>oTqrV`hNgWlUjL>o%9}qagL`unQSpX}rw1Yl(?zY|Kx2
ze9R*!3%)Q4%e)V@DQ^k1$Y9K<-wGa(5yD8><`^Bix-Pp&_5p0Z`8JK^-{Q%bla%RU
zrkzmuC(FX`*n>eIZ!dbNu(+5zI=*Zy;^<Z~)vi1wgbgSnaHk*#Sq4+OCz2R|A=sY#
zs*s2>4)OZu?XIBUEO{lqbz!<OS)z!KQYV#t0G2lzEAd?EN4AKWv%WK!BjH)BSG~16
zxu(-97P)>HGkBoguCC6P>;`t&F__TEd+lVrRW$dH%7U!M))q3JlDy}MB^FiLqHGWT
zQc4q!Fjg@jFiRS&8<7<dhLrGO7zqI*_WkE5Uy>yDMO|4XND{ptA;{befoE(sy5giU
zyYQ?$T6aQON|tn$j;^iXo=#Ttf&(`(*w2N!csR<DZ@h(q8*MJk9BbySo6Ogf$z$So
z(7VPB>PaY1(!aQs+k{T9L*p`%KjJ@9%4#6foY;Y~A(xW-gU(UHZw#|9bcG8)Id0kY
z6)9?!70}2{^<d-)E93u}{b(JTdeb!I{S0q?I7weF6h5A`T8-WduB<KM(>`Qe@DFmI
zo=Oj>S+03lk7&eYvZXQnd@bR+P{3)Xe5G1s`be!SpekFgf88kesFm$%*vY1-XYINp
zGL8OZ{ol%B;vit)Xj{E_I!?cWw`s%8esM3)+;E%FZP{K^axD`;?y#Q6$d0%5YxZM{
zODTBm)12yZt?e+HFIU%n<r3g%UCwhnz|ZXBXS^Jo4VZ53ve*1O@PkoE;E6frnukml
zvu1xW;1v__tn)cfTYyfEQ5%4;?RR|+6Xot@p0T!6*mL*dv+X+VjXf=z{#P*=ZY_hE
zM&cODhrpr=Nnrls8Y3;tZYv(-Nt2|^4$~u8_2gt5ih@*x3l0_u{-Y;8XqR{$DM#cA
zTXhWvFi|7o7uKW6FbT&Gr>S91(F1@wB&IpIshX;m;s+H0{RUHMcle1ZSdd+w@)mwJ
zn0?&Rtu+g)y#3XHj{WspGPGfvM^`|TWoLL4F=KFIBz|qsb?>r764`-yi~}-)v#Q|E
zrmg2`9<)K{VOx4Y#l4n5y~sjOl;bD=NS<R&Fa;7N>yBKhOv=nK7=VI|*+hli6iQ$c
z>9QsIfWi<36BFS>|H+S|`Y$;OV=Eai6AfG@GCK!ZM18M66f>a~0UMGH3fu_M2nxqk
zR0S*}ah=*X2L-$eM@=cTIT8|C<$B5BaMQ&=YmbR>lb@kXIEC6{(C!m_8387q*~rXk
z6f75`<NLYc1yh!x_x0H++~E)V^{$JS>$q>_<1F$*&5jSlb%(z#CqPl2NR4^?=#|UL
zZB9d`uQLhs?wB2~{wZlGHRstLm<pfcE*C3#A&(jzG0Y#oAvH8KNGBiw>05u#c9W60
z>ut@U|0vaFn%jh;w9HEQgB`t*fuW;}?Ikz(P&U@5^r8iF4K*(llULZz{+uk)=~}5m
zdY?~0`ef(JVHj01R6cLx^>I%`R6LctBx9z}`VTKI(DEMFr3|BsfY1$czb$$5P~RQo
zZ{06VB#x<mT>ELY_Knmn?1{@yCp~Q#Oldn&JCfV5%tK566!_f2Ai>py;E)^@zx-hD
z$3{4__=b;y8Xua7hN1v!w^8Mi{s<j}#nf|g=~twNL&F9jLw=Jz13$@S<)v`RiAZ?U
z-jWH-+ynn)Xz0yr{h3<G{3@&Gwf$ae(^b1d=mJ+Sy8<zhtwXfNuwq7}j!HAQhTA~F
zq`V#+c7CIuj=@Arm!qrFRe}2tR_L<RuItf)?mOx-%fFvfiKXd|Vn?&bdo;uaFhMZx
z*%z)nE+zvHk97Lh{n;|zJI?rSy|E|KvXp=k6t^<6B@ml!ijQ(7M|FTbn;c~%I+KX8
zCk`$g2t<N!0mZ?YMzPnnWu>(p-{PtAwAJE<AmQnTLj({VxAP=%q~^lNxxNH$8S`O6
z;!?%A=`hY`R$yLoYou!wH_woN0i}%ABJ543LP&92&EY#;Xy3^FUECnBYi~bFTiCsy
zlDFmGT0dS|;=Fzg!7|kMG~J-1yRk&q<J_%l|BL3AikrZ0c(<bdJ>2G3%ikXaBW_ax
z2jf0MV=$Ng?>}CqMZ}Lwyo2Un;}_3(H0Ir~$Cvh`CAOp7F}wKR$HEfiuk%ShxB@Ko
z2fMOsH~qgU--9}X4hnvk2B0?TPj;UX&CfefF|i|goFTvFDx0nzKORysE;rxSE?nof
zS)~iu>erv$T%VvQrtM5FG(HGeAn0iB>7lJ*bY9;X0^Pf>3l856@X}9Nq0eOx427N)
zw$g4dfk3PfBs;#k_!BMCSU2dDLliJ-mdxe8$tNeLm%pooD=!X3W3-4FZXXD!U!y|t
zwQr2+Xvtx<0!hH7CACB|0#PvM!~h6@yZET09(>nodAzQ%&@IR4liozWX4q*}0JN2@
ze7zTOGs!)j&5WTDF8R+V!0Yok+kj;VpBV=@lG*zs)UN3?%4Lq^?R*L09;ryHy#|-w
zoneHsL7>2>RD!gR(>E#F5_t4fyTUQ15;IR;&_DYy{pDmZ5_CWP0cKHQv0%`chceO7
zrUl!mOU4l$UB+pKY2)x4ZV%J4$mHUNUd2sUlR!AfttvB_XNOs}-+Wpr;XF^`Jkhbp
zxPX|iKPt8q-Z(gx#UkEi8wU9ICJpm%x0YbPR$0)H0r8$!w&aI9)X8J^{RTq$)0J>V
z7>i>{1uVCJm6?=;Z7M95TY*U_<;fIzlConF$`t#KLXR*C+AwDzn6n(rJ?l>K8j2X-
z`IGOWZ)*Bnvr@j~XDHz}t#SpT$y3LbQbm*4y{)xdUrk0uYO7<1FM;iU-@dLcwjQ=I
zDzv=)B1o{iSZx$FtP>w|h`NY#i|h1VFCHN(sH>}+5WI_-6$Cj;_>{ipjdo!UQLJCT
z6ZuIr3Jz>ayj64h4JhKjzL(g#%EN94xRiS|{N)z2+3*>`fnB@a9XtDo+L^1IqGfsM
zQMdbg>fSYK>hAQiquc3r9pI0H<YwRIJ}p(CLd5qlN2Z@$D@j={*&4781|$%9-K8Mz
zv<g+r&^tK@+$HW&4H*(_-qd3`mtcT(r>xr$Z9WUX!JSJTMGGyTrtF+~en*9M3d2_Z
zMI2N(Y1X=WCGzFEZg1!ya95#ckXuntxP?Y5mMmCJsIDLoqaT|XHX+^^B$4R;Fx1Wa
z)iD{7e%>F78z2fJ#rvoI%y}R}x3yxojvOF{OJ1|e)8Y5TKCja?XG+rl=>-YYB%<M&
z$g0ZXKF&cRu4q=acGOl3{$O-F1$lQiZ%Q-HjI-EFK_y(bYfA*#xA_%V*H&L8Q&fO;
z<C{adfQ+In4bOM)9}gxOF%bVEEr186iLXGP0^R8pC^)c`W<+_eV5WWJ_{M|ODQdr;
z6m9eU$sF}Ja#&4Mi4?88i+2sggQ$lQuW&#cC-IA^Sk<<d74tKtLNVWHi2?hoX@N#m
z#r0X3G~o>2g7nwJe_FseOL1!$VL}kGun}Z80{lsjaIGmBB6H^^3goG^>%zb2?c4>y
znJlh9SIKMH4rR|W-@^!bPckSMX6Cg3)37(Sww(eTB7De&i%PErFXw~}ma9Q6r|Twn
zom|by)~oWCboMw`OmcrE`h!UZB!1op4KMraMpZ#-YMuGDW{cN~F8<4#oxcfpb2&Sw
zga2Jw^U5BjXvpQ4msLW4+l-%(6SAIH{@(0Eg>7W!Q$#;H1iS==V?}C8VDDRJQn;jP
z`+-CtcS!d0jaAO3%h59!8%Ugm_TM{^>C8%&>=1PDVjAgh^Q_u#pE~aq@9iu3-KHX#
z9EfbRa19{=kMsBK3xP`!k#-w?QkEeB%|@hb_rwy$k^|;h-(eOo7}h>gOb8A_=po^Z
zHNKQ#d)rtRWMQ*V82n4r<1rRXVKV@rgX@N*WM++w_lOR~w^licj0L(896?dxl`P@>
zb0!%l87ISt@DU^~sT0wds9Q0+(dor$8HIBB6apK*hD~#ol&C#ms%EjQ!4f}LH3WKp
z1oxoih$$-^Pi%lPOl#|PWP5XZT-G1=%~R*x<~-SoIwV7~#Lc+CA;l$qS+#><`6x>f
zGDzvV17U$~$WnKcGL1yVJYtL8f^E*(A97|y-`5Ry^JT#Tsik9vG62g!8b@eSG2eor
z>ta%dpe0UH+8JM?co#D2(uDrOP%0F1C}fG?APlrdu%AYiKbK0k@Pk6@&Vq*%x%cca
zM9D9-Zf+gcKh}P|BKhc$b4ACK1S!>|(;VZ@JGr9EpGE7}o`qMyJJ|AUByx4Y0Gw|2
zzTe-R?61egc=XxgF@GNz2%ZNka_+uwzu54iMpWrKPJSKp2Q}j^gzVe8?wN{Qu&O5C
zHJ*1Ak2m=S79;+*c_Rs$Pf<xYxqW1ErTcxlP%gT1Hen0gN33R(MQC+XM`r7?T59K|
zX?N}r&2H6@&6!1H@azD>*U2|nFND6^PY~iF#SHI(dKhaq3X)av=M9>FbnaiK+nVM#
z%3cz2Pyyyy8f}-2?3Bkc#LfHkLXTr77(h+|;Tt|)(15BRCx8qKCMg`m*A2$<B}c?c
zuhhx2GTo=d)B=o@s4`j_2FPG2jRv-!e(v2mbtNcv;^9My1N4k-EI$<WX6kY$vBw#7
z^zzcxE#g`29W_xmIy+c-dlg?dxQLb>+LGI&v3!Vx;lAnoqP2GnmXqxk7fA`m#WQiw
zaDmRCsRTTVP#L0(;O1oM(P$VG*OsE3<cN8DwdIEGLt$YknZJ~i*h5&7y7njO!9Ysm
z*7f3>D(x}@*kp2wl-}S62#^p3fdt!YsCDT^;1+=p!mg1L5zWXysZ7gBAK6X5wD6Ev
z6z+sio>=9ls1Uzessc5IfL?R4Djhwk7`_d*47F#!F@B4MG<N^wE7hAe`z=ClDKhV%
zrP%dv$Y61NXe182ZITTCGzX2TomRiNftXRok@i9Cnx?b$e<`&-I;;E+{(8`>JVMP^
z=UgW${_HN>{cC?L{olyTKDOfXJG`ZyZwhSc1GLz8`x^t!JL6xoHhLNFvBnhWGCQ`2
zO!8IV(osEz4nW<TT@U?_|C=_+Dh2#4<njFJZm2uE^nsWDwpHBQRf2Ol<mqqQw;*5>
z6%5`sA&a@0O17_x@qw-7!Co77q9vXgZpTL|$y=E}-sSe9)dM2w8?c+N-k0ka=&`W4
z$L@$95e+65$8u$7EBPM>6A&I65tnrZTe5u{>}C?i&Dmb6SDpII9!2D2jIbyKMmpe>
zxV@0vzz=03EhAV0n;MG(6$(P4TP_+wNZ_3>=lB^N;10Pebri)1D7`Z<FseM!2`~U9
z12vYFzHGjV8!UAokPgS=>pb~*5g=^-5ADjc3p*=uZ8mDJ7n{2{QY8qxN!}>@pD#5p
zNrA}kep6bq9!Mp#Fi26V&irl?KB_8o)f&nt(STY4OfPNoS`<V8^k7(@&n<L2_iJ!*
znno!ycGRiQiv%;8*^P~3rKA2!jsT8Hkv=HtX`6bUu;5jU1~{6Sq$%I+dNp0d%-Q|v
zq%#kr_d)5U=IyU<*g+^cnikqT&J<a*7FX=Ou<ozz#y+e=atVJqkvkc>aE&UrDqZI1
zI!sG{y-3Js8sp6n5fK=UijE42M*;UJrf;dWBN=phxr+XL8hgMw?5{0-B56G_Ti6Oq
z$Z@f~HaMZ2216{jh0cwW$kwIgCAwIv(=)v3Z{k!?usO1B*+N>}Q1X{BH`SH8`R8^k
zxC7(=IH{}K|HOb{xvBTCKE>5?;x`oVIKGM@d-#45VgBg_k+&lh@_A6wxkII}_DJ&;
z;y)VAH1x90R0BF9xqkRsKtwai&VH;M4sp8HVm{I@!_|Cvh-zxC?LZQYgzY%*VfkFB
zW}N5J@qtmXcE93{$9%Kj{2;n?yVv|Y(EMCM@PL<v3GV%JVdGM_mke8~lcv7$PiH?r
ziU7J96zAH{6Dl2;ft=P2nV7I5hFISn8QH9j4dBC*e<gtvi)cQO=y(k~lXRD}Vnip{
z2AH*-$5UcOL|O0#o*@AxD6qi&G|G3;RpcD7WF_uMX3UJhJ&HyWQsr?1VZ<RsDPogC
zy{uy9AV>&f7vVr=*4`~ei1E-q<btg@Xn@;gh>ea;1FXC1BP$(oE!!RgOt?uK3Gha(
z+Em`pQ`o6fuyq*ybeQ7&*LTnsgNAen0s0*pxNQe5<Bnoc`YNscENa6AZVu9jYEBI=
zTGEG!u^|)cE~nZlJQSX*I<q!yg?uD4McvSk4|8C_q@&0b)ErX+&@_bFK08C7=c3?D
zhokak^{vsVoo#ChN&BeJo)ebtRP}w%2W4Q%?XxCsRNK;9>lzLv3E>E8EY5UG`;!Xm
z-3QbU?--X(bql28mo1Qw>+hd?!m<@sS9n1trOxkEyma$trK|ty%mds5O4)4V6MyVu
z5V=DJbloR4taI#--Pq?CUi0|;N_mOU_b0^pyjN6UFwD44VBMnmu>bG>|72>p{4=!B
z$p2^j#;I@Qae_%&CzYt{CrG`w*Y;I_VKS8C`NgI6(jOCVqn*k>^I`9!;YDr)+x2Aw
zas8@e^$;@sk^@&|^d2i-U`rl71AaUMEhMk2pOLoZy-etR^{*GTHKVehw0vO(F&P}M
z2l^nGuu33HB$T*Sq?Bl4qR0zx&JzL%nMcz%Q!tAphcko80RRI00R5gDJYpd14gxn?
z2Js*mFrFBxO-&m4o6Mx<nlLRzMN&96zTgO1sOv2KbKylGv?oP@0xOv&6dGHrcOOEI
zm~#|u1{R_}^QRX6a>N~ZEJo!}KEJ*AG)jC@MqygNq^D~JQRs_<4VOo@Tj%m!plUUR
zF)3L&aZljzRzGACN-;9tZZar_0-Ad|Byluyn3*Oz7_45RRekQZs*K7+0Eg?W^hU1l
z)BogD`<slaB?gExHJ8=X`ZM}{c8vZGQ|XH@=dmmm|3U}X=abt_LUoG{rM&lTFrMVB
z6kDK|1>6I7AsN=R+YZ3`ito%?02M@5nax@9XD+7{<{p+peKZM<l}dyCyjtMM{ukp-
z?l4Cic-*?T?i%WRJPF>|t{n<n<Q-2HNDl{(#yBQFDrAimCzTEM)825bc*9Z_6GH+?
zn_;pRPvh<GB?rkw<g&u=edE!vrD*3&mv-`lzU^fl{&M|U$8?}zxr@Ke@!Myo#(z4#
zPhSurnIkv@Iry*zcwJxwxO~Xa($VQoKzs|o4Dui<p=tG^cD(gqOgJafRad(k?kUlc
zbjOt<<*I7+E^xkD<a!5rzTa5y(%3Uo^=tI+Z@3<uba{P_RQA{joR-4lg-q&^d6acs
z)nQZ+IT)a&lPS^`?DcYg&jw>zvXFn&MmDQ5tEBpM4a)S4QYRqTJpRqlttQEei3$@D
zloyDPh7BQS)Siw<!s01CK1x>jiUWj(OI#Gdjl}2+iq|Z;)qHnmNx?l<=ms2h2AR0l
zKmDCKpEuT41!S-R9lj<aWnA3ViXB!N6HHM0HIO&n;Mi}*KH-UkhTUQ@)(8RfYZ!S*
z8pH~m_FxK#w_!BFlh-q7|2<`Fk0qfUD3gYq^<cx2lJx{;udxc>lGwu{4#&gLlaP{F
z!1n}7gNjC6QX@kaHw%FX3b-LrW{1F6CNDDz8<?h5z2AMJXFdM*jduqjR5+fbCNzVg
zCNwgbQW0zdutZeC`a-gUIUF2fE^I4G4ciZQ%cC&;xTERd`<nL=%ekpHf@>LMzseRP
z4SRD<YnoJYWc4k3Z=mqJn1%6e%ymR|JP<kB_RF(ZX9c0JrJr8XV_j?oqrz)9xQ+XQ
zV7trg#$3o!g)W-o{Ml`sse+5==hv|Sjhqh=t9d_lCM-)vn#|1i0eO$;YK;HJ#*4wP
z*&AB78$^k6IYCj$l@cHTilLaVne~4Cg)4t5<X%xG>LsK>5nOV5y|2PKy`nxfJY>Q-
z3v-pI^>{8{suldTy{+}Hg8fxgad%uvHR4|=hqf)%(e8lQA>7MH1|`AD$WsL`LLg7T
zwJS~3ko!ScM5iZj8<zu-YP4~YnH+<M(g?gyiU&H8-HarMny(eE4sH!hu6rAX4gh@X
z6uzB>vLl|G54;fc7=r;VF|>_u#~wpDxE|m-tZn#!`y(ip=m&}UMO3J0Iq^gUcL-3(
z`BP137eQy!5%YI-&LJH~pUHF1&HdEJ1I(OpG&1<7Eo!<<6nI^9DLBxLt)&cxj|?>i
zkdlQ$7E3$->J9_|LtM^2QRXc<NT27rSXMgvf<oWx*c*9=kB^~S2b+`9XhxgsB2^&K
zwcm~fM+%p~q7FU;SzO?kZwBc=jO0UoziluxaqM`FQ5rFABWW*7C{^52xKVL8de}>*
zX&}yyH!BIPvm#j|7#|@bQ|GvV|1b)6i{&?WwcpUU0i2g<VIRqxe?OmU+LohWWuQ0+
zd6ZEIP<|@Y#MhJ_`SBs7KBXVe$@dO%$E8E{98&1HO~=|)`5u}S?2Oe_HB#m5JX19y
zFLZVp+Z<`r$e1?%mDBf~A9sPDNedWfK56x+TEEwMpI(>J?0VY1<}>teB<=diPIfAb
zbA|p%-@e%S)I{|z1}k{CtB9xoIx472`PS4o7vtRaFEsPW4LX<w3+XL0-8`@2^ZmXh
z&RZ(CwUx~adiK?!xiy_Wu>URWi0k;n=Y<8oRD0n>k%vAtc|OBinjP*QQLXFcS4!qP
zi<5sy=8iDe4J)Ch9s5~*T>;`F4Fawney8rVh4I%f)@V>D*}kt-n{Q$h4p=r}bO+UI
zd|K;h<qBD1=v<D_+#yHA5W)Cg>ocV99L?awyBh(tZuDb8nAo85Ao5)7Sg6pmAry!;
zL2(!W`1qI1jg|w(&HUuAyyl7kg!q*<+`s>zpkojlzy3kQVFPSsXk2Cq(X<3o%iS?c
zK+6edfb)pvOUlWW2J`b?@=@0WBTJx%U>wwiS0XRI!vLVsE$px4=Z~2X3xfZy1LH&Y
zOLkNtkC|8T;2=6!#XILsIomH!8=CUvh07&0<6oA;dLe9;zhz=zYKXfcF1}bK*><qY
z(qziV7#_915?3syz)}X%{6@f<{6(QAmfP1Lb^m1wp%*6ujdbahIGQKKw!ssT@!_{B
zNS0h<L>cgzJG#6%|A+%>h|xaRV4xI2H=~HY$jRI!;};Q+(OU7U1a!|!u9LeixkD<K
zRPfZiS-$)Ta}la@>HPJ5eW8Z|{<)5`K4y^ar`4Kd`q1aoOF=@mp_@(LyBkxZ$fmr6
zkWTJrU&=0rkNc+XyC(Ux?wBIoM3#s1o5$)$WXE+Ezt21t*Dg)x|BYxkY&QI&`h7x;
z-wU291BSnH{k2O&{Snue*UgLbDf`J_X|O-KK(zWuJsrtoJ3*wc#NBkXQgGTz`t`?;
zA6lY74gH_rR!%%XJ4Wl}RG|&N7_+P#62`=18veRHra@)9kULirVC*Od^Yxm&!qr52
z{5EY;k#WjUZQ8%)<XSVpXAr5Y)}iL5S#?)t(1|UP0F``?nsKgP*NjoT91kGI{W1#x
zS5%~dXdsy?BqcE_@-?iHE&%XtSX_|r$@cvcsd`S@5s7NI^>DbC;Yy;Fb|ORU#<9XR
zf(!mh1}&o4%};p;2?<!Bd+X+oqrw8VVsf!TOi)9jqKe%XkY*Se44{gH(L{qCii9VI
z%aXg<ZR|!BC2szj9E~rA3~OR6!eJH$m0QVi!bh?!8K{e*<#bjYzsuoGx{z|!n_5?I
zxv{XKpUc<OURM82u@^ulI1m@nFKoa<U$13Sd3?+Bxg)2?p1Z8%^*BDSHwp7bwLYng
z&Xx^eK3y1$r)7xZU-nfTlGfMxwUaA@4NV4FxL*0FZ#sBvub4JoKsq*@&AnGjGh;AA
z+v4Q?S%?4UYGgNIuNX5FDJvoWwO6JBB+m5PYIya=#Ghkhr}`2vUy00I<(wkW_;!)}
zO!Qq~Q=_Z#S^M|*`}cKo*&7EvPYtJ+sJ}1e2ZOJxcr{~gvddhu7XC`|=b-xVT+Fu#
zaO*+x_Zr-^3Su1)iutdH5kQU9`RM3nZ(VgMK5Y2j`LeDuR7j9;grjrT?BsPLAyt$m
z=FOJ$>vX!CLGy#svpY`;Udn>K!+FnufzZbSIkX2ZW?MlwG;@k6huToP?#8H8@}7*A
z1k4Ch+#$OU8o#V*53i(hRDlLMa7}^^NkNS$r&M|UD6H$_^)J87W1+9>s^^rM3h$BA
z@V*4_&uOdw*hqyJJTN{4lue8e;YaC2MWQX0i~t1EWEgMB0o~F_j}zpQTF6Wmfz;q4
z#&y(Iwy6-pW@=XUO1?`ArIm##-z~!jg8S=+OKS?jQI@bO@8$YxmA7T7%83*ySqZ%t
zvmObSVPH-qEzsGSL?L4Xx8#&CmRZ06NnvSRQdYTWQa}mE7^gHA5JaAyOh=fKaZr)0
zgMLQB$Pu`0ES@}puvi~a%5tTiPLVlOlGnqefSW;O2AUty@$cDNij#&RsReDN#3lc3
z8N{%M{l6Aq2!|^_;L$@>qjg-l@dU5J;(@`C7{mU1dsl#Q$sWb=P<mdryS|9Vah25=
z>O0xGtIetnm)f6Gh4qRFl|KNqg!aW)?jl!-*WcSg2R(i6-H@%R(b3WST&6~!mzr{%
zp;)Y`t_tdXh=|LJCIem7*9*InJg3ughg|%(9aOD(L2@m0<;RhvXo@Jq;rK2E7?KUo
z-8d;iuis^5G{`WZ=&T&)Q5vpI-`ix0d`&GD%os0z!oj7XLBoLed$uWlmm4=?WUVg$
z_uDC<08rLYYHI303>N712@DJj!w13q0Z^BeWk4!Jt$)nY5Ehs^>$?2WtuutaAqR^R
ziSH7g6`P;$FD0hBFVWKUkm&6}>*ap9?&MO6ywxx68aY)L9c#Rx^t$ocxob!paq&&&
zOARCpNf|XJau12IE-5>`1@%5qV`SmwsCCAx<)$!F?Sl2^E!&2VS!dm50qDld?Q)^`
zsidwfF;HIQLfc!olXUnY;6s4{?oRMWAxD;-C>b3RfP_c**{oPfY1wVNB^Qf8=8}`%
zYEQ&BI2NN(<@eGA;r(vCX)wQRxGN(%7h-CBRcyQ+Ibx>^)b#qYRwS}<&z#Zcs@8fG
zU?M-w!UEE~b-g*Xk!;<lpy&4tZEygch!Y}*I<kBiCMTnh007v!F^DK>v(Se}Jn;+2
zdV~RP#3hs<b#%OgpQz*{v}8lbJ%zDP(pxa_kGzjLH&T^bLZJ&y_X`Kb>G6MY6LMbR
z0RH6;cO;v5{06LJDA{%>4}rV3MM6J3KqsDyzcZk(%5jVXqvG>M(#_+<V23h^3{l~q
zSE`*sgHxF0GF8_zhl4<)@uRG(P665uSJl(7!O?p4=XRdQ2EA_0QQD6BzN{iX>Bq-F
z(}nMThhgq#2h$PMhx;m{v6KepxDby@E%il=-cy6g{mDF%;M32kL){i<a|HzjDXAg8
z%l2LF$=w7Y|Lw5+%!9e5B`q~I*J%l?iF~2YzTLwd7X=LsOaK7^A;*2iT3=t^GRJ9f
zrbzbn<;4J0RNLFz*$$mv6ImRFZ-V(DucMluc}Q>h#O=pE`S>}Y#gonpexD<MfgiSZ
zx@cUA2Xf-^JoSao@O}fk`Wg}<UPxs`*Yk_#6}jjVf(LT==JopKQqXj6V=@!HwSm&(
z!gWYe@oZD{<-<E>TUPWS0}~T47WbUT^KGax4aN*@|G{L#fF$*M@$VZ;@2?QM^PrUF
zQDF>mn598jXs5psOrw>|eFZIrqbcESO?<NTqdwz0-OL+fsxHzqdf<SXq$pJ*gcIQ;
zj@)2CeB95oeh?rfE&LDCcC~+ev^UqO(`iad4*b47{5A-Zei-sNHZkQkC)cu&+<EpB
zNb57AK!pv3o=KubXepQ+zg}v#&PuP@ejf^@!<j{!{@raWqGkpeW(PCH4h}k*`X#+w
zW3$1wCsIq}=R8fMB(@Sw#Y2s*R(FIL?*gWMGa5f$?yEP^n$%XMbpNu`xLwZVCUN?u
z1yi$1@(d++n~6MqHhLU_IjLKIcIUfX=H{Afh0`a7h6=-woQ(nXMms9$E9G|U<p*v}
z^BSi!rSl&KyO@uDWg35~7Z!?iII<>&>BkXX6|_*36Csnkg#(Qj+TK2zLy=iYAWc#C
zp5G)8A9H+2U=1%i4*4x{@Qi4EY@81d+Fd4}dReCId~X}<h+v5!ba1(;(HWWA*=|wK
zbNU8M@^n6n{<Ph0)K4-+3+c(vt#snSp!gcR*Ws{h5886##SM;+kAKDEv|`7tt!;0A
zI~4l#GBh;Q)m`lk>uECb-Hqe2Z#!=Ug(CJ34M7WRl~+`~fbx(Rs|~wM2H<Loy1G8o
zyWWbHZ9mTHrx-i#W@O^of)eq%_@^0#5>L;GFTI&z0$%7F<`1$?4p&d$Ee1}KRhtP9
zAr>pM%r<2=d|^CA@-wsPGX2(6)>9sJj$;BUd^lV)X}1u_+tMv1_dl-Rgb1262RLo`
z)HlwYZPR~@ky(ob_Sk(4*lx_rc(nD6pL+2BiYES>3P~Lu$_6sm4zbXT2+^&LCNU6n
zW`qLRA#y^KulR@1q6y2&2Azb*BsVs`K3?bkSZi16@RYnBRDR=@6O*GT{%2KyfJgIE
z_h*XqAX82L;m_>H^<V_hy^lVFhA^?7mOzm3SZYiA6*gObL`<p`vOV~zeXb=1i)xa)
zE$Gl#5Zxf}H4wBM$eA^ZhCqU=GHvxGumjF#0@22b9>WpdqyZN&GGo?Rk&jiphLBWv
zW9*slL%N3%6-LevV2qkswHc45{$5+jtX_z>G!WiDO-R*6^}DiQfL>YUkmi4y`^ttm
zf~DQTA%Q@UKyY_Skl-vD+}$O(Tae%y+$Fe&;O-8=Jy>uFiv)LFxRdjq5BI&l;O@8C
z>6z}S?yl;pdb*$E2~h83db`W@qckWgqvsV>cNcfCLk(gRClz=CmY7VQjtrElzKu`4
zh`8$M*2tk0LBsy?cDVL~=Fl$FqA_c-VjIPixt)rLr>5E3N~Tj#*lT*lFjM_)ceE~2
zU4B~ngL&H3UuKD2Lpj-ztgV)-t)I>7w5t|k?fkChG#$EN*PuGOxZBOaTsqsyaCmyW
zn8YOJ5&n2U5MAT<`~)%ruKPY5v2{J3|Gqu~iLnjZZ!=vc7D4(m(}6SsWD35bd0!aP
z$(f9aMMhbfZ5yA*f}`;vypMvybRgpDuOu`+A<ZZCG?%Y-UIkbiFLvngf3lpN{5DMb
zcHQT4Mz-qb)duB~QJ9t)aVMX;(0}$R)4)7ARiMRPukheA4JfqFso*F*hy8w4bGB?3
z>t_J-FbJ)w7{n$NW0(_v17D8m@#?W7Q%?dpGq5eS_^nbf*3u*gw$kKxtuEndL?Fr9
z$Y;a-rEwkoJe?A!u@6-XmyVJvu~S80=r7Fqs1=r@E1l5$kf6NAsg|S#OndJA#Q_>i
zt4R?G>InKiv|XH^yj%s+^G%vcUarw?EK%tBI954CT2)wyQZp(>yj#~eA7w1x-s;1%
zz@<<Hc{P8dUOL&b;_V;m-bD@&dZbipFAU=61%|>Fs*+X{%UR+5r+L|dxKwM@>p5bL
zMf+jtS+aw=801Kva5TWW^{C3bLnDjQ#yK^FISyXJ8<uJD?R#Glc^*60UB`US<>_OW
zosTLh(`3v@r~N!e!6@}W?fmcT<y-R(>tbdh$_<lR@+XkDCQ`*YR_NR@wL)Got*cnA
zl+E`6@@bg`qXNh^?A#`R`C4P+;DGFQ2hJ_@)`zp^dwY9QQc^rOD=yr&zp?5+f%KRl
z9VDKn-q|o+j_c>oEPBnS={A)u+X?X_eHkC@_`s47*yYS9Yn!d!AUH@KU{9T$ox@Qa
z@6knF`LwNV4kutqqMgtThb~XoBhyx`gEHa{l6oDh^;PQw%dJ%*+RSYw<+)zcM)%v}
zx~eO8jBT5Qe!@k%?S^0Ycuut=$LDX%g2+)j5dzF?zpRNKQHz~vfv`Zae5qA8*;)8f
z`!-KZ8<LEeJOLCTky0Q6`FiTRtN<p8+qsi$NrB|S5%OnhK=|3$c#1*%XEZTYC%h>x
zRT*<=yD5(_r!jm#fbz31ak?o8=!QG15$^>m$fKe>z;2`~cc<>~AkU@<&`>UzG4@B!
zMo`SzAljyp5lu=W$6Al;z6*)+fc5AT1Ew^4+}>9{=7HH*j{KfQp%XF$XaY5z>FlAE
z%XWE1)aO$MI1A`7-IBaf!tod#msyo?6*2vm$4=_IO>b=OPArI2VZ-ZT70Cj#vOx;_
zJKRpK{CcxeRa1=4k!qfFv;r9G-qJhjp|_sx?56Q69SdEYaZWSm5YvylaKfJr%`~=e
z`MYW-M(~^3brjQIs=j!o(RQHD@0l_gE@ko1(l&9QQ&YARYtG8%w`9+1=g@Yt@>0Xl
z`!+eYDDNu#GgSQTmuDo;)_xbdr(NUPIl`Ag?a7&L+s>YHa&i_HyUo`i?`w5+HFPv}
zVPS!6l?e+qI5ZR)9xi)#u(3*~;cv30fpUpjR#uj7qb)BuAa*ANxA^xj?nK4Js3<9~
zPu3x6PPCmKbD!50o|ps~LZ6+UrlSdhEhEaW)aSqdozq;q%-lzC3GwL<*%i8&TXt=x
zocc3@A^mRq%?|w=#y6#7ct!0@xueXptYg_@)skOLOeSk@D(@|(f<}oxes|wtA@hrz
zshw0=G_qc_xU*Ls9=)+c1T?FZ^z;Nikd!fYo+Kx~39ckvcG~dAA{7%YKm{(P%a^lK
zPPNs#F;)79_yt74jhwB)6vf>x)dD>mpV3&0l@={u8H$hQ)2F@A6YO=YBF97mwZX<~
zQ7+uc7j?gAqM{C$sfLytUSE_%A&RXlOq_(ea|^k7PQWCP`rSKV99Qss)S;AL1HV}W
z#EW{YNc9kEqjJ^9f*Ut|b|s=`DJ_W_eY85<Vn_03mC7ak-%Chp=LmCr{W~!fzTQ8>
zPWe%2H1INPyiiJ@cvW+dk+Z&IfVf4C(%w67Y6_U@!ly^ZeP2I`R3CK;w?V&jf*d!U
zji497dGfc#9gElJ&!FayH^a@wPpwE@Z4}U$Pfv9vEIwAFHt|dr>X);(*ALz(JbZlh
zj@mtTFWDxer35vqlofri^ExK2tSmcE4s%FI0=lJ+yT}c5upg7Z4e9NAZzoqpYG$&a
zA9?KU<cLn&iAt%csMy#XG`opl(MRaino7&cj!t*{Jvf+|nPG_da@vE!)^=D6u4~KY
zzAWgwAFZ@pr0Cjv{)zr%PyD=OQw4jv>FPReJy`QP=^$f|k@CFS!FdYwBe?l$LADwu
z5~fgV(djA42kD(&wO!Z7L=4WZoT^t^8@#)I^}N5L3wv1M-7HCD7Gn%GVKQ{H8)Jz<
zmX#<&0t~v2M_)}0+y(Et>4{Ev-yu14VI9nW@84e$e5@tVHz+l}$fhGcrh^&>@A~Hl
zT)-XRtRVC%#dhB#YF5Qzm!bG4d4}eZk^*`iqHYmzfOFtDIc(+3Qi|H@pf(sC*NlY&
z-d|ke>1?jROZ%W)e1xA`V?9(mQgUnbBqU5r#(B?*aT3mJFXmm!v?tLE-7F1lRKTA-
zVu{9Ss1KC}4p0gO?S+<oq3{onjNe^}ssmGE4<1d4sb6urFij9bWH6vVxV}yl?e56J
zb+6L>Frkk?PKP@Y>ES?!2MQ?bqm=5K$8q5N1N50`Xo6|`6hw@WLPAqQRDDyi*mK~3
zF5TQhTq*=ORLq}{?hE0RcXzar;VSGAJPbvJJ_@W{%n<FN@k~{61B1|=+cu}<`D7VN
znn2->>Bk#FL#m2Gj^t4eb!|2cKYGMl$eYK>Bddj|1CtWxy*kWT+e&(`M_ALSCxpZO
zSP+TnSl4M{ub9;5!e_af*yE}Bb@NWgN0-%rua%SUnKAi~xfH2_<31IwBIYcCJlp#2
zs|_G`>@+VM;CQ;xGdnw5Sy_30ex8|m#(f4T>Fe9QBPaw9&H3EG!)0#$C#siR9O835
zfh@zyuy|{C7O^$*G*CP7mr;?UC>KG&u#sJ&jeNAp>o(hP&3DDA)3M`r`r5+mH7CUe
zZ#Tv<YT+cK?f!dNEqnVI@q9{LjQZfyO!D~w;*~y@$m!3X<KCDD$M~QrZy}~9R8v;_
z7773?2sPM5UO!@@z9j)0>^6q&UVjkrFTOyLV2ovyneS9Yr@xYU@wuM~pjdsi$7*uZ
z_4dW?2qq=P&EHjJEhfjH*;*EHS}+Vi_(1Nl@^hCiYyDw|xgd4o7Y2U_k4|cQZq=%t
zPt|t#5RIG`bH%I@Hgt$HxaKYIyK_pVU3WAe5<TOTp4HLfiC?e+Zx(=)tlmk;IJ|c1
z&-R7t)dF6nulGY0;TOA7ZB81b>=2rB_;ujqvvXFu^*S*5gPuGN_0E9qd3n1Hj+`qW
z00=`z=m~AP-T*_gj4}(ja_0_R-tKo7h64Dt%!Sz%1#^tg?~*C>-ImXZ>iT}c<@PSd
z5#bdk<k;!1x?IOH`D8uc-x=1|rF>%=$zD5GZ&}c8CVy|(A>8DeW<R{id%x3KF>j}T
z50$<z^h|6o&B-o7+N^1RIBr`2;~pTPdXC3dxKmDPNr`rgbJ5@*ZICv1Pv93r6vrE6
ziu63&akJ#U@dWzCm*1PHr=2OftFT$yZ)zdLO@AQE*>-3=h_BL-kBlR!>yu8)r!+Uw
zP}Oo{)q~-UJtz8MhxuFc6d8K*KP_EPpx+$-3R7i#L*DFG;Z)+Jz`YfOm%#C)zZE2Z
z`8LgV>jqT?X|XFA$-h(Z>$A;@@?}Lcqu;DW%%EEQcH213Lgo!VASKJQwP;JH+v+=+
z=oPF2?3I4%+ffoq-EcuO=}GU97Z5}H%VQlN#~sV6BCfiHGa6y;VhWD|Fk;MA4-%3p
ze(nDS-@T^e=AbQH7iHX$JF9eTV1OrvafMowh7ODoGGiga0~jbWa7M10wAnbOn@P8i
z7jDqO$h3IC#&wBtnWe1WkM!oK!m@6JssuVs*Ju$|vBnr_&gjNhI6ZbH-IO|?oN~f!
zlf*TTJ|E1i?nK(_Ea#?mFFdz#<jIXsO?GiTtpfEpFIXts_eogX^o)-@VeO2#=;qMv
ztiL&&|2Vi>05Qx7^%_UvZjdY(q*Qp(u@U%kzCxF~u>(wcwqHzK+<6=N-a(yI9Rr;P
zlnq+U&KKNNnjtTo&j^B1%Sqb&cm1AzWrWn!T`>%2)=B0h*bZe__O3}^KJIXz@I9n3
zxY`~zabGS|Q>fYGmV5qIkVRvmgG=4m-weH}O`U8}rNvKDPU1}BJO*hy7b&qV6}fN9
z_8=8D-U8m$Q<luWcPFu92BM>VQoot=QR#Z~Myx5dQPDg;(kA`lf1x))^;B$HOgNGK
z+`UJ}L^$^R`&P>pJ{jx#GPEutnu4&jXfQup(#1f8R6%&9OG)(Ji`@P-AgqYFX$9~2
z(;1bL#;5Ie$m0co7;p;%W;ZdCKgPtX8gLIK1Dt5hh@>C0z2Sv5+9yu11r%8MMNXW~
zeerX$a@{$#RAxgW2nYdUj5omVzn|M3r+5E!7J<ukJu!>1Z2Fh|+g@j*7NUvJt4bMZ
z#DZ^380gO86PL4R=UTiJac{G^v>;k><)2nXeZ5(M?S5oWG24<x1c2l_t^?dl{34j~
zV!z4UH;b`#0XrRchqI8o&ARvSbl=q&=d3?#YA!UpIn~O6djZtd=b9C-E-$@rH@{ls
z__$gBy}hYLKtQl=03rWX<>j{Z)3zTB!4Q&4$t4&Y8Xg_ZIOma6eH`H%X1g#w^CsNx
ze}_y#Xl!SNAX?7P$I#MS+c5X*ce!DsT56^m55G)K?d2^@F+o>W<Gsw1j@58hPL7Pl
z&cF`-cakn~skXMuvryTj_x04l=r^Y-(S;XXVpcV+?P@_c<R{0Qs~z6<5dq3^<-zep
zZLMw>;PD{4$+458xqyFsLaq%pvKQi+RjH+`?>=!plh1mUbS@zLR^ljmNt6>;BB<Fk
zZr49PpxFr#;Bh|(x{-wmC8YB~DEGkzKrU#&c1+ttU*aibXGyF-XTOM}LaQ9VNh(r4
z{-HTTbv*B9(Pc0tJC`TVO_#iau1^z}ph6RKsnnPN@Z+c!RtH-g^OP_fe*>N=?Ex=*
zYk~%Z5pjfrM)?WO;MyltAR@)aQZiAURN^a*6#d)RJk8EeSuXCT@czu{CBMzej-91u
z<?O1&u>4h|&FZLYEv1d(M$?mbSMh(>PvEBGh?GHX{m50bKL5$jfQJPH(%=XRHMq}~
z!)`|B0*-3$HU;nq9g%<Pc26(m0Y(S5yZ6XfZwJ$i%qngC4uc$i40&Qc$`mU`rQL4i
zluAUtIa=#jKDheDDcI<<+-Mgb9*%G5edhQ4u<oSaZcwFD(YYB)WZ-i(=af^sd=wHA
z!oBJ`v;K6=T?1VP4->uoCHu+5<b&<+ca?5qXwf*hpm#o#W@9bu?z-l;|9aG(^~<)%
z7Y$csZ_&*_ME&#F+PJ%uWkWxUL888+>^+l)ZnQP~uBPRjisA97kt=?L{fP2U6;rp?
z>obO*AzbxeHT#ubqj3UL*rJvjkAYggF1G;0+kf}5*F-z7Ep@@1;7x*P8hUHb{b5;b
z``Pn{@IQyf6$eca3j3PED4up1EpLv&Az@00$!7KM<Cns7bOFt3U%cKDor<`^3$BbJ
z2rG*?X;)YsaUJ|I1GiyL*3yNx-s-Y?VgVzBV<-ICD+5bZIB%b^6lJBwDG`87&A3q2
z0vvug;qoNffxmX=iYcYBx6q9nGMI_GY0;MwTmVsl91&HlU4eB2+Zj8e^kxY`tesMU
zaVN7IEh$OKc?8m}ihjn&n;qnj?}4dUVwsDIGl1AGY)QHBE<i*f_bn?B9H?e>?Px*H
z!N+D%siB8|HYTaa^oEhfI@HCb$qZ({)urJjIW9X##^<&m{ipXlKh?<>jhh+q6*_Ep
zzL@ST7M?kpMX_@Eu^XC-+dl~JUu1UjDMu@e@-iT@?n=6j?%1aE(0e<C?di+<RcL)&
zcx+~j??uMC_xUj0zbwJsE?LdHjf$qVR*=*&_A135I+BcmfiXTlK0PfttI@HOZX<NN
z5d_AVH~yAYA^R(WZaEmtlaZ0p>GJi_(_2Xz<b8uK%Be4Cw<b;<)nHfF(4y>!fltFS
zXJLxu=Dwexiq7jfcmlDC(a`;@7-EuLZlVZMkQRBzBuSy3;Dzd}E~c-vhb-ax-A~^{
z>ORP%etZKbeB~C&9#OhxuRJ&dOf|2UM&(<(>qv570|_=y)up#jPE@mv8CeuXEcz*|
z)xT6~g-eKzN$wneZ8plNQJb<Jxu9i|;r@-!<*O%YC&z%aBRd`TjfKejwVL<8?q6=K
zX`FP2tRB~mQlY_Z33Wf{d(WG6IQZXOo&#~oxn#fl&B<Cru6XXImlx00e;~gE+W&ay
zbcomL=~t_jjB5*=cftCy*oG*7v>HhIR0;ZM^sq~GP7a4-Ldsf+=TJs;3g>F+bv6R9
zP|;7dT^a&JSg9D-SNA7nna^)(l2@U>Q11tzgMQ&&oU+Lk<!yN*%Leaf8E<)y9-|;T
zun%n3`S7m*BReZX7|E!bfpV)|s!ulx?$xe~YpcWssn0G%(SEH`Hpb_)wl};fgF9KH
z%CoJf`CQ<WPT0oUr&(GQNV#{{@HCvTFg6l^xt_ukQgz9>)b4q~yPKI97gy~IyPsal
zZgV^Ob#Uc%eYn`^)23x|1orFS!^3(V$-qJTCVV`+ESCx1=lg{&N=iyV7%O<e!0YIG
z*<s<}iiU;;SEA!)&5L`*F-W5f2969$DypDtAND_Tj-W}mB&=>c;Y`-t!@(y!kKskR
zA6A6qQ_YD}te=lJ`L*na?vBiBTQfa-4|6@{@>h3t8BJ{EayvpFhz?2AQwSfjkjh-s
z60^dzR#lbfR9PeA=Xsb)9~kA4<`NIJ=8ZHys!n`p{H=xliT%9va1O`a`|L>a$>UGo
z*5LY~w@Ojolm0b$CXEcKLMDj-P}qL}V-;z?L-3F44;6A^-_6_S=u;pC=xMS(6#pnJ
z6n`xb=dU6b>-*Snp*>H>9LcC+y|=Wgq4V(=753Yb{!QER0ZUbtAyK1LLh1bcVa;%X
zB@kz0sT-}$^%c&)x?cszEehU6vf{Z){pQD-7laREaH!j%AvsgcEpMp*KA0Dkc>l0S
z#6h=&=lmiYc3q+A?)`C?z|MQ%NY=L^S{4P6Z4k@B^B#$6DB3SM=>$V5@3(CrUFRu-
zkjFyTNnaT}9fC53h*&Pu80MO$`a?W;p}up8!45!Gp6yiVliQ*6WB!C3Cgkxnoy(@T
zuTQg5FD)ra&Ct++JuUR>*M&-buXP_PS%t*JL|t9o!KZG&gNi2mj;r}^-@d(MYgek!
z&}B{mou$jm%Sp(y_hxShXcqcuQuXqc=#N`=NsClGFQqlB3<UqhTb%Fu@#yxw-f6F~
z1&#T3lZ)eco|m1FK5QhK_{0|(GeHCj6{UY!n4S8dT<(uvjs`yaVgQqT^KhfeGTQr%
zw7M2A0o*ZpX1!*$(_7~s^zZQv>3tNjD?A!tpC+Iv{=%tD4)f=MKZ&2$@&a$mhs6sz
z)+oWns{7JE^~(A*kO{fVJe<yJYdpdREI%&;-E;j;LjOFQ!I<rUV$e(w0^O?|38r_W
z=zW5EPr(vH)=T4dKJ%j&WZyOjlzrUy>6WuA*Dcihr$D#XRi?N*pm|Auqx;YHBkN|s
z_H*Hnmv9?ZN1B|kenY1@^UzqR;P4e?(I$f?hmrKWk4;D>(JJ+sfo)bW*qWzseZS%b
zbgvm90ot4_zK;(sCxXXCPae#3ulV$y##-ICWi5EGKYT9d%NOXCda|?O+J>%|@qaxa
zB7bp}c+knAx!`-z<u}ig-f}>xFtjtCVdx3P``WkZ$~R}-pi$OwF~JXZC-0Z;X%SQa
z#DCZ<R5mQyvZgX|a9n^3>o(9ODpFwp1TMxnZr1pxAsIDd^6w^ozC)e1GO{{mSD!sd
z{YlWEnig(hw`hL!Tg)_q<@wH|uWVA`y6{T9F~*#hFH>cNCv}&!Z!?g*NZw3h^qj=&
zFXMeWJ(B9YzTw)8FhRsk_3?c+<oP-lWXA9;H@5L2u1FZcbZh_lgT5Cy*g}){?kI2i
zDjPe7iGGeW`dMrlroPNv^LF-wq1CPT(rO=5KD`ya#H(?}J=U8+yy1_f4i88G);jG+
z+fi75xmOb5mlbJQIhrk$kst9WLJL*I&!(T%66@-Ncy#m{Kje@A;4&GWo4tvHU!)7_
zg~LDge4L62_zw>A5|%Hb@wJ2^1Cj+HFR>&z)te?Y)@_RM)HJ-~OJ>ml-pJ3+7%Z{o
z#L;iovBV2UO!zrWr=zH&SRGi90BIhU$U+2`0sz3ZmlhXM`_8~X;|LE7aml?%Y%`y4
zOMDznXMc#X29IU<ql+D#UtZSfXk~9b+0N+O<fDmDp@B<le$KkCAEJr;3VmNi(idC5
zc_-k!JI>y!^qXISE<;`#LJ(FKa_kd~iP4(E->C8j+k0(vPpf`ppXtNyS!XA9+pG$}
zarnRwD)<C3^yUI^f6^eeX5yq$`+!v@EHZ)yLGQ|GjSjBcOV{xCB{b!NRev~GX>Qf6
zC6vK|4MU$E`WPrKah8ciuz@NcN~D)j_4_4IVZThJ-W8?A3<rn+8?T=6<3h1}*uok{
z2C#YJLQty8ArFR4Z=*lHXP1?c!JT%siuUYZ?BB|qToNpbup|UPsXwBNnJo_y#h>;k
zY>F_-_3<xz#7)1zU|A!Hh~?IXAaNQ~!vjjr5%^)d049(Wg_^nX7adhVY8IO@3NGb_
z1Xl|`HB}1{2oRZA7=+Tjf%C75HPdhZo&B2Yyt=-=6Bj6q#|EnBbm4^GRy8v~8=VZ*
ztn?WG+#-~mDw~Ri_pjMyi-KMytF`LvVOh1*g(u9|c4=Z++J7_SjBih!VI4Vlzg~A)
zdyc~B>I>rJ#!41FMRJucwpU>1n=!)5=Ll>u#y?qkA0h+B{P&~Da9W~NWGbS$ik8#q
z8N`xmd+&xrB2&(Tj=eOZ*c|+r=a*FU2MRyv;U$Ca@D;DxMG>I1YUf9La4ObvL!uZu
zZjtR}F)r97<l2mY`CRH%>&IU_&KXFM2(Z{^a0aVPe5W9fQutH2Z4yGb<rXnxjHu0n
z1i+Cw3Y*Gc(Z2w^5d?rKb}XJ#KHe_bA?YbNVb9_qjbCXl_2sd*C_Gh(AP%QrVofM!
z3YVsMt-|a0{2L_fJu+ZGhXNG%;dWU0T)$ae73n&Sn5f--x{#wPS=c>bU{Kd_NDgLC
zpbyugS0`kF1Ki?}{9Pq>dcHsadi*jOIof`K5NeedoN)d&$(p+Z(B%2wha|~z&1yCD
zW1SVE*eobO+^9BLMYKHTrKhvn@X{@_{gh@>!p))kiK+|(u%hmmd6WorFRjSoM$mQL
z_SSwrK+rVsT-UZBX^L$5{%QOm2k-e18)lM5VfU!2s%p2M&do&H+0Y&Ll*pKWjYG@d
zb&Z=dePb6Vb3hQhcS-Qjepy+5K`Yd3U9Et6%AI}!MBLtZUYOLal2n>}s%dihCP+Xp
z!^A8DF~RVdGiaku^1WLw*2d2v(FA}HD?UTEmw?DRRSZPGjpkvBR@_d=%d6X9(f$bd
z${EFs!Gim;6iJWj;1Mu#oe_#nq{CLJYfHL7D?2~N(FOl|wX20^H@{LyR<!3bZlpfm
zQ@S8ym@qg}%hdvG>|a`^;@&=J0k;pGH{rqg+t>m4fIrcW^CwAjQBQZT7YPm5By-6K
zx@hu<=@gvCnD-56yuijfe<nAbDp3vw5Fi90p`Dq4Y_1Y9%gZOJFofpRRD=2Kj^~9g
zR-NjNJ*x4~M=AGqm<BFFz&E1Sh4x30vq>-p+5VKL>-U}&UY@JNW{sKZSJ+p3sVq6f
zbVj{_m7EQ}h<&N+I&%I`k3YN*W@7Arl8es_aO4P*rQp?=&D=0e8fs6g{;_0Av^1?x
zFvmm&y6gJXla#mDPdbFQN-OJkQWpeCD%5NG+SSIxWYHEyUKyF5g!NPy0H;?qp`t-H
zZO<b^%d{?vE8F!fk$joWT>6dAHa<Pt2ZA^FOo!1a({7%eR2ap~9}=0ZO_^4!`x8b*
zkDI?tXVG0OJ0*qZSj4DLt7}i|r<IKGXpGm@3eF`@-0R7ISzAfGTeCk3#ZUwz@}Xm6
z4-<l^CnpOQQIpDv1raKfo`*pgJAcg!Do+DOUtG$XXJmMd%`IbC)kv<x$6S^kahr=1
z-yG7+^QjgUH`C)GR=sDtZyqdA1wgebGKTR$3d@xtIA;AofVeIqRyq*pndv!Mz%0Ma
z!qO(PaVfiVc1-c<sjyL(FP!mOeYug()CI3Tp|L5oqt2vos9)AluxNo0hN7)ajR2S(
zeSo&dTiHU7ilQPCtf;pJbtkO&^Ef`VjvTMt9t=U*Mf>2s((!4+0rmg1-Dl_WNN~=I
zlK^2=mjF47sMl&O1Wwp0tAQSN8l79wsrD#L*bn#@l_n(sI3vyOUufd7X_Ml`W#qnN
zO9uzPN=`bW=XkRxunO0!lt9lw`~m{rwKfIfiYC0Nyu71ht$Kd7p47y4Qq^w<Fh%r$
z?%qJoF_UO9Jm`1hq>W^RSvR(HMo!hD_$6`<8z_3)e^BSf!?%*hYY5IC=ZX$}wC!}C
zyl?1PHzG;(agS^n5uujrITZJCJ5_grD211Z>#6dXLG9+>R0iI>98J1w2_NjjEaTO>
z``FKfp%?Ao2LMSgp-HZVTIhgO0nL*L9DVN)94bwx9wHzk`ZytMpl5LRwA5{sYvk0a
zWx_v2X7p9-EG6a$6A)f&*8_&qKL3oEOh~|{)k6kcgUiXEF7c1*IUCat(#v(5X6knQ
zd<LP#56)9ow1UO^ppxifkP>7D^SdTv(W`(_Z4x0nPSjF(c1Bv+UyMZ&-@Ejv-Lg)D
z2PlNTCHR%<`4ez*ULzQEUvI0g^XlZf?%`Es=hpX<XuVa#tKNl4hTT!S=*IFN@niII
zOr?kQsdh~*?spS>Wds1c7%?D4l{S*~K|jV|g`uhNCv~)G3~3_BKvi7%{72$O&T*~O
z2ikCK{ZYEh<VzlT5j_<r5daT^1BSwhr0*jH@$S%cCPpKVBsCAq_bSJ-a0+V!ItoTq
zly%5{?eCQ{Xk~t?sF|U_&P6Lo2}eO?R%H05cU60%DZsmUGOLz0$|NO)N~5Wj-js5@
zRAJa^I{J}_L~u~en&|@pkZWmBFT{~d=15pO;2`Eut4Z`y!B3|^^<%5a<M+3a56>wy
zlH4X(`8d~ml6X6<3ZE2ehc(cGX|a(`-0Z*X@6-%x>9mo;mb<R3A~Dj211(NbgxDHB
zsHsrAc<B59<R-B{RPMyGWz&DARcfiq7y02;v`ynvnT>f0Y*;oRfT?QSO>nFdsJ>=Y
zjW?Jxn^a^Z)K{W#gr^9!h;_Imuv4J`ex7LYr9H^nRLDOHWAmQJeVE$K+5XUv<5hD1
zOpkQ5_hWuy(iFuTP^xyMRtD)5LAxGR<!e#GhyXCkQ9Q+yT}G{WXE2Qd{;$;G{EJ%N
z0DDT%4hyn1&pAD1g^*xy-qd8PeAOi)6fUJyDQYQSiA%%)9;cL)O#&%6`b?RqO6m1~
z!NYz97qBhsbzqq0?VKaK$daK7#Fsrgt7i-GdT_B_&IE~seMeD+zB<Juc&X^&yYVMS
zC%`;R4GrGHeg&<(t8ljFtmt9z7~5zSjGD4~Ki&lnDe>_Q#AQ&Sx7}`1_~?|rJ50~5
zT*kC;sKKXJY^-0_nos{_(dAKN<di+FWy{E5Oi69RPeS=Nx(OWUcfD~D$JR1E)nah8
z!SR;cpHSk(rL;l2wKm};#P9tWJsrE5-?gUU>-d$^pbzt5&k^Ya11lmwNyUDsOgDSH
z4Ym`(I3fFf+B)D5ssx%qmEtG}W$2xHtS+Xv@)TM5Rs5l<sj=yG#IGV&d;x>rcOe&l
zJX2+J;;mS#7-Y08hXexr=yrCpC7(N=@-kR)ANvL~QB|j<O_gaH@4q@=oTr+V62prU
z)dk^#hhV58*^FU0qr^@SgC6@AtqT$UJTr1fn)!&WeA}MohbauY=c25Z?<p#wT7*s5
zMG*;1KzD6}d}{sPqy-8ahmQ`3HRY7F_v+X`sa-tpDSet6qcUf#MS%rVW@a#Hl_L40
z?>p;=@bfXA?^r}$=v?gXMhOxCFH)`Hx>d~l?hl$YpRZrpM2qPKOO`<aqY^i)(0nR2
z+DP>rUE!~>E3Mk4B(6V*fxUOUz+pSIK-%D0)v&#6k_qdP7_vRhf_X0c5p*ai6W>f^
z{P<hn&|r2*dIrhnIyqub))4X@oJ71iE;ulQoNGXutwD8|%V1f08qiI6p+@IAfbHer
z1UEq|SOj`XQJ<`MPlxIp2wpm)Ys(^@bjNB=><nJ_?r5F}JlrJm)`CHTC?)_^$F}vb
zd)~0ikBx*8A3l?nEA^(%gr9p4M<5_Si8$_^4aD=HGtvP7z}}P{-xLg(K3<8t*~@1^
zmB+`1#i)7@_|pt|dw?2Frot1puI36KUy8_TRB4MGG0*l2Hd>mKwNeLW#4uXuT*Q8a
zCm-4PPTc2J6um$UP?3f+x;(}JJRJO$#Q7md1uvi18QQ3WzaycG1}g~JxcuS3D@tkA
z@%if<U>1<?u>kJqc6Rn$aQqKS>JL6!7W~7+eJyO<_QY}eyzj<hB^MJojlszK)I%;_
zyhv5m`1WG=+abw7uj!}8Ls!FzVN*Ms0I`P=RrZpW#!wXoIN{XhLdPf5mq>CickVUB
zmaqYO1_p`<B~YK_-9r=gfrzR75RtH{F*Cd6mYrnoNX>E}9S%^HM#C!sx0IplyDxkO
zLt5*wTZ;^TN@03Y4)O1gzB6BBUcUgu$OI7pT1m70wLH4c>c2Ay0PwRY2A<7B@5b;O
zKNK$$l8vX?u2nutT`Ioe6X<@@*98gK+TSad$zSz}m?UsSOv{M^)B5Sj3%=&FyYMF{
z0UYKfQJzi^$L>FsEAJeRv@ezhL!%@BqgitiBLd(j1et6~S-Qj`*;dCvz<E4};wa2B
zVZKp6CG^eOfzXy-a`JrW&K4fiN8K<{G+^o7u%UhPb#Nyu-~p!M!{mA}uMzy4EA>ue
z%jJpn9V{wKaZYS7v{e<kTt1_8=V25UQUFF$bBMg<$NnW>=x$N`6R@-q0Rnat3@a*C
z`tb%qT1lKCN;Di5lNua}F)?myj8U<mY$qt!2_Z&EFd9<8?t|>}mz%TE!6YrBFx%Hy
zB^!1O^DH?VQi&agSl+?Y1R&fT4-KGc4C)X0`zQNV7BBUkm*Ux51hbm|7zYjzPM;B=
z6r2F~cejRYc3?i+Kh~#nRr%No95A~`;9x}z^#a{-9~5(l@mz&v4-9O)+{26Nn}2&W
zCx5!@$wsN-^Q+$sf3~OK<Zv_VkV@qw(|Vrn`<sBT2pxSmOS9o09}lA9-6H}3G5cC$
z?Kp>t^d|X_c7y<MfDH6-8;wD>%u0u+ZD*h8t2E)d)i#lQe}5x;bijZG8-woI!n2UR
zitTK`2KNq%VJSNB+;*L~mE6T#^8wGs;%$SA0u-9146X$wNo6Cb8O5yS;`#`$Gl)M6
zO9TExv!HO5iE4dS*qC4QDTCVUBYn;M>pN`V1rWviD|hf)X{a3ZA?ofz_%ws@3uz~p
z6iX$?OnR5YchOHsPgA`@>*T;Aw3WOKUFhC#F0>p80Lmq8-xoelNe-gQyUW?%FbGlU
zzTR$f183I+`S)`L)o2ud$|N<^OQM<Z8hQ`7Mo9x3co}e^eN7aZLc{?T!4%t*8!#o~
z>9;T~3lyjZXB8@i>z7Ol5guPYKopgNv%tv8Ef`C*I9xc!Z!8uw2#X?k%BnZ}_1oas
zkFP~h$1TB3C`GV2Cs-qvD96&<Gw(NG33TcW{(pb$)%X2-BWHmz7G*G2`t(HDZr#7)
zl&nLY3B{zy6r!kkGuvZ7n1lZJ+q^j=z=tofZaKE5L863zrGg<;*)rL$@dL0#QL|Y8
zTkHRn<9w}f1Iprm$|0}62CEV+Ci&0hTa5p-I4bl66>M!5ZF4Ru*u1Dvi6-zeZ|2p1
z@BXLuEZWEYP5=O7gP;tS{_hXS+n2`*uIjx1+xwDj){;}D#C5IR6GZUn`}n{xPq-T5
zi%BR^Ej~`Gf)%SegEu-(dtZWp^p6GaX=sY_@{BKb#+gSu!Jyc`U^M1F_yk>Sx=$%W
z*gF2UG4sEc%6~GiTeRdfH#fKcT`f{D9Tp9RLLtw0lOVi(X=&*Vs~%5-fhy5maNIXC
zo^CXpSBO?WB?~~&Mhjlessg85k!&&Mc)&IkD)@NX2UZ5Ay;P6?HI3?D*Q5{V=<4FV
zkWf~hZoUThT#y0j85zYZHr605!arGZMuSN<em=hR{DJ3p_zr(s+uHtnw>bvv^6&3+
zCX1EmW9%`}&_F!RIt2Qkwjla^a{s$Y@~`<0!H5}XZ_Cfbz2xn-tx*0eSCKF*(HY$-
zb;m({Lhdy18PBDELoClqE>8&^1A}Ds*trD|E>e+iS(yEp9rF(CBul~!K`%E&Ma)5`
zKT9_!>zII(lhgnD5@%;;t&~*|YTJB$()COVfT*kQ|M?PGc(6~cY-Ya8195S2Q)_EN
zOU)qs&hujDwJ0AS-_I1Ls`lC+KlXyZ$UAT60RNH88tIok3IG)ovkMd$7%cYbLBbDX
zJDso8=l?R60FoK5-pPGmFparG>&{;W<#c4X)_w;<{G51*6^d0WG;A7{K%}q>n0_ii
zp{Ap2YHW;o2=H4mNE9${{qNY{G=2MTZV>+O0r^ifmLLE3^!WGv|L>Ig|K~B7pHZg5
U*VgS40Ra3-ODKp}iW&v}A0Pa4wg3PC

literal 0
HcmV?d00001

diff --git a/demo/documented/stokes-taylor-hood/python/demo_stokes-taylorhood.py b/demo/documented/stokes-taylor-hood/python/demo_stokes-taylorhood.py
new file mode 100644
index 0000000..e52dffe
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/python/demo_stokes-taylorhood.py
@@ -0,0 +1,92 @@
+"""This demo solves the Stokes equations, using quadratic elements for
+the velocity and first degree elements for the pressure (Taylor-Hood
+elements). The sub domains for the different boundary conditions
+used in this simulation are computed by the demo program in
+src/demo/mesh/subdomains."""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008-2009.
+#
+# First added:  2007-11-16
+# Last changed: 2009-11-26
+# Begin demo
+
+from dolfin import *
+
+# Load mesh and subdomains
+mesh = Mesh("../dolfin_fine.xml.gz")
+sub_domains = MeshFunction("size_t", mesh, "../dolfin_fine_subdomains.xml.gz")
+
+plot(mesh)
+plot(sub_domains)
+
+# Define function spaces
+V = VectorFunctionSpace(mesh, "CG", 2)
+Q = FunctionSpace(mesh, "CG", 1)
+W = V * Q
+
+# No-slip boundary condition for velocity 
+# x1 = 0, x1 = 1 and around the dolphin
+noslip = Constant((0, 0))
+bc0 = DirichletBC(W.sub(0), noslip, sub_domains, 0)
+
+# Inflow boundary condition for velocity
+# x0 = 1
+inflow = Expression(("-sin(x[1]*pi)", "0.0"))
+bc1 = DirichletBC(W.sub(0), inflow, sub_domains, 1)
+
+# Boundary condition for pressure at outflow
+# x0 = 0
+zero = Constant(0)
+bc2 = DirichletBC(W.sub(1), zero, sub_domains, 2)
+
+# Collect boundary conditions
+bcs = [bc0, bc1, bc2]
+
+# Define variational problem
+(u, p) = TrialFunctions(W)
+(v, q) = TestFunctions(W)
+f = Constant((0, 0))
+a = (inner(grad(u), grad(v)) - div(v)*p + q*div(u))*dx
+L = inner(f, v)*dx
+
+# Compute solution
+w = Function(W)
+solve(a == L, w, bcs)
+
+# Split the mixed solution using deepcopy
+# (needed for further computation on coefficient vector)
+(u, p) = w.split(True)
+
+print "Norm of velocity coefficient vector: %.15g" % u.vector().norm("l2")
+print "Norm of pressure coefficient vector: %.15g" % p.vector().norm("l2")
+
+# # Split the mixed solution using a shallow copy
+(u, p) = w.split()
+
+# Save solution in VTK format
+ufile_pvd = File("velocity.pvd")
+ufile_pvd << u
+pfile_pvd = File("pressure.pvd")
+pfile_pvd << p
+
+# Plot solution
+plot(u)
+plot(p)
+interactive()
diff --git a/demo/documented/stokes-taylor-hood/python/documentation.rst b/demo/documented/stokes-taylor-hood/python/documentation.rst
new file mode 100644
index 0000000..49f13f6
--- /dev/null
+++ b/demo/documented/stokes-taylor-hood/python/documentation.rst
@@ -0,0 +1,162 @@
+.. Documentation for the DOLFIN Stokes problem with Taylor-Hood elements demo
+
+.. _demo_pde_stokes-taylor-hood_python_documentation:
+
+Stokes equations with Taylor-Hood elements
+==========================================
+
+This demo is implemented in a single Python file,
+:download:`demo_stokes-taylorhood.py`, which contains both the
+variational form and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+	from dolfin import *
+
+In this example, different boundary conditions are prescribed on
+different parts of the boundaries. This information must be made
+available to the solver. One way of doing this, is to tag the
+different sub-regions with different (integer) labels. DOLFIN provides
+a class :py:class:`MeshFunction <dolfin.cpp.mesh.MeshFunction>` which
+is useful for these types of operations: instances of this class
+represent functions over mesh entities (such as over cells or over
+facets). Mesh and mesh functions can be read from file in the
+following way:
+
+.. code-block:: python
+
+	# Load mesh and subdomains
+	mesh = Mesh("dolfin_fine.xml.gz")
+	sub_domains = MeshFunction("size_t", mesh, "dolfin_fine_subdomains.xml.gz")
+
+Next, we define a :py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` composed of a
+:py:class:`VectorFunctionSpace
+<dolfin.functions.functionspace.VectorFunctionSpace>` of continuous
+piecewise quadratics and a :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>` of continuous piecewise
+linears. (This mixed finite element space is known as the Taylor–Hood
+elements and is a stable, standard element pair for the Stokes
+equations.)
+
+.. code-block:: python
+
+	# Define function spaces
+	V = VectorFunctionSpace(mesh, "CG", 2)
+	Q = FunctionSpace(mesh, "CG", 1)
+	W = V * Q
+
+Now that we have our mixed function space and marked subdomains
+defining the boundaries, we define boundary conditions:
+
+.. code-block:: python
+
+	# No-slip boundary condition for velocity
+	# x1 = 0, x1 = 1 and around dolphin
+	noslip = Constant((0, 0))
+	bc0 = DirichletBC(W.sub(0), noslip, sub_domains, 0)
+
+	# Inflow boundary condition for velocity
+	# x0 = 1
+	inflow = Expression(("-sin(x[1]*pi)", "0.0"))
+	bc1 = DirichletBC(W.sub(0), inflow, sub_domains, 1)
+
+	# Boundary condition for pressure at outflow
+	# x0 = 0
+	zero = Constant(0)
+	bc2 = DirichletBC(W.sub(1), zero, sub_domains, 2)
+
+	# Collect boundary conditions
+	bcs = [bc0, bc1, bc2]
+
+Here, we have given four arguments in the call to
+:py:class:`DirichletBC <dolfin.cpp.fem.DirichletBC>`. The first
+specifies the :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>`. Since we have a
+:py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>`, we write
+``W.sub(0)`` for the function space ``V``, and ``W.sub(1)`` for
+``Q``. The second argument specifies the value on the Dirichlet
+boundary. The two last ones specifies the marking of the subdomains;
+``sub_domains`` contains the subdomain markers and the number given as
+the last argument is the subdomain index.
+
+The bilinear and linear forms corresponding to the weak mixed
+formulation of the Stokes equations are defined as follows:
+
+.. code-block:: python
+
+	# Define variational problem
+	(u, p) = TrialFunctions(W)
+	(v, q) = TestFunctions(W)
+	f = Constant((0, 0))
+	a = (inner(grad(u), grad(v)) - div(v)*p + q*div(u))*dx
+	L = inner(f, v)*dx
+
+To compute the solution we use the bilinear and linear forms, and the
+boundary condition, but we also need to create a :py:class:`Function
+<dolfin.cpp.function.Function>` to store the solution(s). The (full)
+solution will be stored in w, which we initialize using the
+:py:class:`MixedFunctionSpace
+<dolfin.functions.functionspace.MixedFunctionSpace>` ``W``. The actual
+computation is performed by calling solve with the arguments ``a``,
+``L``, ``w`` and ``bcs``. The separate components ``u`` and ``p`` of
+the solution can be extracted by calling the :py:meth:`split
+<dolfin.functions.function.Function.split>` function. Here we use an
+optional argument True in the split function to specify that we want a
+deep copy. If no argument is given we will get a shallow copy. We want
+a deep copy for further computations on the coefficient vectors.
+
+.. code-block:: python
+
+	# Compute solution
+	w = Function(W)
+	solve(a == L, w, bcs)
+
+	# Split the mixed solution using deepcopy
+	# (needed for further computation on coefficient vector)
+	(u, p) = w.split(True)
+
+We may be interested in the :math:`L^2` norms of u and p, they can be
+calculated and printed by writing
+
+.. code-block:: python
+
+	print "Norm of velocity coefficient vector: %.15g" % u.vector().norm("l2")
+	print "Norm of pressure coefficient vector: %.15g" % p.vector().norm("l2")
+
+One can also split functions using shallow copies (which is enough
+when we just plotting the result) by writing
+
+.. code-block:: python
+
+	# Split the mixed solution using a shallow copy
+	(u, p) = w.split()
+
+Finally, we can store to file and plot the solutions.
+
+.. code-block:: python
+
+	# Save solution in VTK format
+	ufile_pvd = File("velocity.pvd")
+	ufile_pvd << u
+	pfile_pvd = File("pressure.pvd")
+	pfile_pvd << p
+
+	# Plot solution
+	plot(u)
+	plot(p)
+	interactive()
+
+Complete code
+-------------
+
+.. literalinclude:: demo_stokes-taylorhood.py
+	:start-after: # Begin demo
diff --git a/demo/documented/subdomains-poisson/common.txt b/demo/documented/subdomains-poisson/common.txt
new file mode 100644
index 0000000..a242e5e
--- /dev/null
+++ b/demo/documented/subdomains-poisson/common.txt
@@ -0,0 +1,53 @@
+
+The main purpose of this demo is to demonstrate how to create and
+integrate variational forms over distinct regions of a domain and/or
+its boundaries.
+
+Equation and problem definition
+-------------------------------
+
+For illustration purposes, we consider a weighted Poisson equation over
+a unit square: :math:`\Omega = [0,1] \times [0,1]` with mixed boundary
+conditions: find :math:`u` satisfying
+
+.. math::
+   - \mathrm{div} (a \nabla u) &= 1.0 \quad {\rm in} \ \Omega, \\
+                  u &= 5.0 \quad {\rm on} \ \Gamma_{T}, \\
+                  u &= 0.0 \quad {\rm on} \ \Gamma_{B}, \\
+                  \nabla u \cdot n &= - 10.0 \, e^{-(y - 0.5)^2} \quad {\rm on} \ \Gamma_{L}. \\
+                  \nabla u \cdot n &= 1.0 \quad {\rm on} \ \Gamma_{R}, \\
+
+where :math:`\Gamma_{T}`, :math:`\Gamma_{B}`, :math:`\Gamma_{L}`,
+:math:`\Gamma_{R}` denote the top, bottom, left and right sides of the
+unit square, respectively. The coefficient :math:`a` may vary over the
+domain: here, we let :math:`a = a_1 = 0.01` for :math:`(x, y) \in
+\Omega_1 = [0.5, 0.7] \times [0.2, 1.0]` and :math:`a = a_0 = 1.0` in
+:math:`\Omega_0 = \Omega \backslash \Omega_1`. We can think of
+:math:`\Omega_1` as an obstacle with differing material properties
+from the rest of the domain.
+
+
+Variational form
+-------------------------------
+
+We can write the above boundary value problem in the standard linear
+variational form: find :math:`u \in V` such that
+
+.. math::
+
+   a(u, v) = L(v) \quad \forall \ v \in \hat{V},
+
+where :math:`V` and :math:`\hat{V}` are suitable function spaces
+incorporating the Dirichlet boundary conditions on :math:`\Gamma_{T}`
+and :math:`\Gamma_{B}`, and
+
+.. math::
+
+   a(u, v) &= \int_{\Omega_0} a_0 \nabla u \cdot \nabla v \, {\rm d} x
+            + \int_{\Omega_1} a_1 \nabla u \cdot \nabla v \, {\rm d} x, \\
+   L(v)      &=  \int_{\Gamma_{L}} g_L v \, {\rm d} s
+            + \int_{\Gamma_{R}} g_R v \, {\rm d} s
+            + \int_{\Omega} f \, v \, {\rm d} x.
+
+where :math:`f = 1.0`, :math:`g_L = - 10.0 e^{-(y - 0.5)^2}` and
+:math:`g_R = 1.0`.
diff --git a/demo/documented/subdomains-poisson/cpp/README b/demo/documented/subdomains-poisson/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/documented/subdomains-poisson/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/documented/subdomains-poisson/cpp/documentation.rst b/demo/documented/subdomains-poisson/cpp/documentation.rst
new file mode 100644
index 0000000..6ba9b3d
--- /dev/null
+++ b/demo/documented/subdomains-poisson/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the DOLFIN iterative Stokes demo
+
+.. _demo_pde_subdomains_poisson_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/subdomains-poisson/python/demo_subdomains-poisson.py b/demo/documented/subdomains-poisson/python/demo_subdomains-poisson.py
new file mode 100644
index 0000000..06a67ac
--- /dev/null
+++ b/demo/documented/subdomains-poisson/python/demo_subdomains-poisson.py
@@ -0,0 +1,117 @@
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-11-09
+# Last changed: 2012-08-06
+
+# Begin demo
+
+from dolfin import *
+
+# Create classes for defining parts of the boundaries and the interior
+# of the domain
+class Left(SubDomain):
+    def inside(self, x, on_boundary):
+        return near(x[0], 0.0)
+
+class Right(SubDomain):
+    def inside(self, x, on_boundary):
+        return near(x[0], 1.0)
+
+class Bottom(SubDomain):
+    def inside(self, x, on_boundary):
+        return near(x[1], 0.0)
+
+class Top(SubDomain):
+    def inside(self, x, on_boundary):
+        return near(x[1], 1.0)
+
+class Obstacle(SubDomain):
+    def inside(self, x, on_boundary):
+        return (between(x[1], (0.5, 0.7)) and between(x[0], (0.2, 1.0)))
+
+# Initialize sub-domain instances
+left = Left()
+top = Top()
+right = Right()
+bottom = Bottom()
+obstacle = Obstacle()
+
+# Define mesh
+mesh = UnitSquareMesh(64, 64)
+
+# Initialize mesh function for interior domains
+domains = CellFunction("size_t", mesh)
+domains.set_all(0)
+obstacle.mark(domains, 1)
+
+# Initialize mesh function for boundary domains
+boundaries = FacetFunction("size_t", mesh)
+boundaries.set_all(0)
+left.mark(boundaries, 1)
+top.mark(boundaries, 2)
+right.mark(boundaries, 3)
+bottom.mark(boundaries, 4)
+
+# Define input data
+a0 = Constant(1.0)
+a1 = Constant(0.01)
+g_L = Expression("- 10*exp(- pow(x[1] - 0.5, 2))")
+g_R = Constant("1.0")
+f = Constant(1.0)
+
+# Define function space and basis functions
+V = FunctionSpace(mesh, "CG", 2)
+u = TrialFunction(V)
+v = TestFunction(V)
+
+# Define Dirichlet boundary conditions at top and bottom boundaries
+bcs = [DirichletBC(V, 5.0, boundaries, 2),
+       DirichletBC(V, 0.0, boundaries, 4)]
+
+# Define new measures associated with the interior domains and
+# exterior boundaries
+dx = Measure("dx")[domains]
+ds = Measure("ds")[boundaries]
+
+# Define variational form
+F = (inner(a0*grad(u), grad(v))*dx(0) + inner(a1*grad(u), grad(v))*dx(1)
+     - g_L*v*ds(1) - g_R*v*ds(3)
+     - f*v*dx(0) - f*v*dx(1))
+
+# Separate left and right hand sides of equation
+a, L = lhs(F), rhs(F)
+
+# Solve problem
+u = Function(V)
+solve(a == L, u, bcs)
+
+# Evaluate integral of normal gradient over top boundary
+n = FacetNormal(mesh)
+m1 = dot(grad(u), n)*ds(2)
+v1 = assemble(m1)
+print "\int grad(u) * n ds(2) = ", v1
+
+# Evaluate integral of u over the obstacle
+m2 = u*dx(1)
+v2 = assemble(m2)
+print "\int u dx(1) = ", v2
+
+# Plot solution and gradient
+plot(u, title="u")
+plot(grad(u), title="Projected grad(u)")
+interactive()
diff --git a/demo/documented/subdomains-poisson/python/documentation.rst b/demo/documented/subdomains-poisson/python/documentation.rst
new file mode 100644
index 0000000..f429b6d
--- /dev/null
+++ b/demo/documented/subdomains-poisson/python/documentation.rst
@@ -0,0 +1,240 @@
+.. Documentation for the DOLFIN iterative Stokes demo.
+
+.. _demo_pde_subdomains_poisson_documentation:
+
+Poisson equation with multiple subdomains
+=========================================
+
+This demo is implemented in a single Python file,
+:download:`demo_subdomains-poisson.py`, which contains both the
+variational forms and the solver. We suggest that you familiarize
+yourself with the :ref:`Poisson demo
+<demo_pde_poisson_python_documentation>` before studying this example,
+as some of the more standard steps will be described in less detail.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+This description goes through the implementation (in
+:download:`demo_subdomains-poisson.py`) of a solver for the above
+described equation.
+
+In this example, different boundary conditions are prescribed on
+different parts of the boundaries, and different parts of the interior
+have different material properties. This information must be made
+available to the solver.  One way of doing this, is to tag the
+different subregions with different (integer) labels, and later
+integrate over the specified regions. DOLFIN provides a class
+:py:class:`MeshFunction <dolfin.cpp.MeshFunction>` which is useful for
+these types of operations: instances of this class represent functions
+over mesh entities (such as over cells or over facets). Mesh functions
+can be read from file or, if explicit formulae for the domains are
+known, they can be constructed by way of instances of the
+:py:class:`SubDomain <dolfin.cpp.SubDomain>` class. The latter is the
+case here, so we begin by defining the left, right, top and bottom
+boundaries, and the interior obstacle domain using the
+:py:class:`SubDomain <dolfin.cpp.SubDomain>` class and creating
+instances of these classes.
+
+.. code-block:: python
+
+    from dolfin import *
+
+    # Create classes for defining parts of the boundaries and the interior
+    # of the domain
+    class Left(SubDomain):
+        def inside(self, x, on_boundary):
+            return near(x[0], 0.0)
+
+    class Right(SubDomain):
+        def inside(self, x, on_boundary):
+            return near(x[0], 1.0)
+
+    class Bottom(SubDomain):
+        def inside(self, x, on_boundary):
+            return near(x[1], 0.0)
+
+    class Top(SubDomain):
+        def inside(self, x, on_boundary):
+            return near(x[1], 1.0)
+
+    class Obstacle(SubDomain):
+        def inside(self, x, on_boundary):
+            return (between(x[1], (0.5, 0.7)) and between(x[0], (0.2, 1.0)))
+
+    # Initialize sub-domain instances
+    left = Left()
+    top = Top()
+    right = Right()
+    bottom = Bottom()
+    obstacle = Obstacle()
+
+Note that the DOLFIN functions :py:func:`near <dolfin.cpp.near>` and
+:py:func:`between <dolfin.cpp.between>` provide robust ways of testing
+whether a coordinate is (to within machine precision) close to a given
+numerical value and in a range of values, respectively.
+
+We next define a mesh of the domain:
+
+.. code-block:: python
+
+    mesh = UnitSquareMesh(64, 64)
+
+The above subdomains are defined with the sole purpose of populating
+mesh functions. (For more complicated geometries, the mesh functions
+would typically be provided by other means.) The classes
+:py:class:`CellFunction <dolfin.cpp.CellFunction>` and
+:py:class:`FacetFunction <dolfin.cpp.FacetFunction>` are specialized
+versions of the more general :py:class:`MeshFunction
+<dolfin.cpp.MeshFunction>`. :py:class:`CellFunction
+<dolfin.cpp.CellFunction>` represents a function with a value for each
+cell of a mesh, while :py:class:`FacetFunction
+<dolfin.cpp.FacetFunction>` represents a function with a value for
+each facet. We define a :py:class:`CellFunction
+<dolfin.cpp.CellFunction>` to indicate which cells that correspond to
+the different interior subregions :math:`\Omega_0` and
+:math:`\Omega_1`. Those in the interior rectangle will be tagged by
+`1`, while the remainder is tagged by `0`. We can set all the values
+of a :py:class:`MeshFunction <dolfin.cpp.MeshFunction>` to a given
+value using the :py:func:`set_all
+<dolfin.cpp.MeshFunctionInt.set_all>` method.  So, in order to
+accomplish what we want, we can set all values to `0` first, and then
+we can use the ``obstacle`` instance to mark the cells identified as
+inside the obstacle region by `1` (thus overwriting the previous
+value):
+
+.. code-block:: python
+
+    # Initialize mesh function for interior domains
+    domains = CellFunction("size_t", mesh)
+    domains.set_all(0)
+    obstacle.mark(domains, 1)
+
+
+We can do the same for the boundaries using a :py:class:`FacetFunction
+<dolfin.cpp.FacetFunction>`. We first tag all the edges by ``0``, then
+the edges on the left by ``1``, on the top by ``2``, on the right by
+``3`` and on the bottom by ``4``:
+
+.. code-block:: python
+
+    # Initialize mesh function for boundary domains
+    boundaries = FacetFunction("size_t", mesh)
+    boundaries.set_all(0)
+    left.mark(boundaries, 1)
+    top.mark(boundaries, 2)
+    right.mark(boundaries, 3)
+    bottom.mark(boundaries, 4)
+
+Now that the geometry is defined and labeled, we can move on to
+defining the input source functions:
+
+.. code-block:: python
+
+    # Define input data
+    a0 = Constant(1.0)
+    a1 = Constant(0.01)
+    g_L = Expression("- 10*exp(- pow(x[1] - 0.5, 2))")
+    g_R = Constant("1.0")
+    f = Constant(1.0)
+
+Here, ``a0`` and ``a1`` represent the values of the coefficient
+:math:`a` in the two regions of the domain, ``g_L`` and ``g_R``
+represent the values of the Neumann boundary condition on the left and
+right boundaries respectively, and ``f`` represents the body source.
+
+We may now move on to define the variational equation. As usual, we
+start by defining a finite element function space and basis functions
+on this space:
+
+.. code-block:: python
+
+    # Define function space and basis functions
+    V = FunctionSpace(mesh, "CG", 2)
+    u = TrialFunction(V)
+    v = TestFunction(V)
+
+With this function space, we can define the essential (Dirichlet)
+boundary conditions on the top and bottom boundaries. These boundaries
+correspond to the facets tagged by ``2`` and ``4``, respectively, in
+the ``boundaries`` facet function:
+
+.. code-block:: python
+
+    # Define Dirichlet boundary conditions at top and bottom boundaries
+    bcs = [DirichletBC(V, 5.0, boundaries, 2),
+           DirichletBC(V, 0.0, boundaries, 4)]
+
+DOLFIN predefines the "measures" ``dx``, ``ds`` and ``dS``
+representing integration over cells, exterior facets (that is, facets
+on the boundary) and interior facets, respectively. These measures can
+take an additional integer argument.  In fact, ``dx`` defaults to
+``dx(0)``, ``ds`` defaults to ``ds(0)``, and ``dS`` defaults to
+``dS(0)``. Integration over subregions can be specified by measures
+with different integer labels as arguments. However, we also need to
+map the geometry information stored in the mesh functions to these
+measures. The easiest way of accomplishing this is to define new
+measures with the mesh functions as additional input:
+
+.. code-block:: python
+
+    # Define new measures associated with the interior domains and
+    # exterior boundaries
+    dx = Measure("dx")[domains]
+    ds = Measure("ds")[boundaries]
+
+We can now define the variational forms corresponding to the
+variational problem above using these measures and the tags for the
+different subregions. For simplicity, we define the full form first,
+and then extract the left- and right-hand sides using the UFL
+functions :py:func:`lhs` and :py:func:`rhs` afterwards. We can then
+:py:func:`solve <dolfin.fem.solving.solve>` as usual:
+
+.. code-block:: python
+
+    # Define variational form
+    F = (inner(a0*grad(u), grad(v))*dx(0) + inner(a1*grad(u), grad(v))*dx(1)
+         - g_L*v*ds(1) - g_R*v*ds(3)
+         - f*v*dx(0) - f*v*dx(1))
+
+    # Separate left and right hand sides of equation
+    a, L = lhs(F), rhs(F)
+
+    # Solve problem
+    u = Function(V)
+    solve(a == L, u, bcs)
+
+Now, we can also evaluate various integrals of the solution or derived
+quantities of the solution over different regions, here are some
+examples:
+
+.. code-block:: python
+
+    # Evaluate integral of normal gradient over top boundary
+    n = FacetNormal(mesh)
+    m1 = dot(grad(u), n)*ds(2)
+    v1 = assemble(m1)
+    print "\int grad(u) * n ds(2) = ", v1
+
+    # Evaluate integral of u over the obstacle
+    m2 = u*dx(1)
+    v2 = assemble(m2)
+    print "\int u dx(1) = ", v2
+
+We also plot the solution and its gradient:
+
+.. code-block:: python
+
+    # Plot solution and gradient
+    plot(u, title="u")
+    plot(grad(u), title="Projected grad(u)")
+    interactive()
+
+
+Complete code
+-------------
+
+.. literalinclude:: demo_subdomains-poisson.py
+   :start-after: # Begin demo
diff --git a/demo/documented/subdomains/common.txt b/demo/documented/subdomains/common.txt
new file mode 100644
index 0000000..91ab07b
--- /dev/null
+++ b/demo/documented/subdomains/common.txt
@@ -0,0 +1,29 @@
+
+This demo illustrates:
+
+* How to mark subdomains of a mesh
+* How to store subdomain markers as a mesh function to DOLFIN XML files and VTK files
+
+Problem definition
+------------------
+
+In this demo, we focus on how to mark subdomains, so we do not have
+any equations to solve. The mesh we will work on is a unit square
+where the shape of a dolphin is removed from the middle of the square.
+This mesh and the subdomain markers produced by this demo program are
+the ones used for the Stokes demo programs.  We will mark the
+boundaries so that the boundary to the right (:math:`x = 1`) is
+inflow, the boundary to the left (:math:`x = 0`) is outflow, and the
+top, bottom and the interior boundary around the dolphin will be
+noslip. We thus have
+
+.. math::
+	\partial \Omega &= \Gamma_{\mathrm{inflow}} \cup \Gamma_{\mathrm{outflow}} \cup \Gamma_{\mathrm{noslip}}, \\
+	\Gamma_{\mathrm{inflow}} &= (1, y), \\
+	\Gamma_{\mathrm{outflow}} &= (0, y), \\
+	\Gamma_{\mathrm{noslip}} &= \partial \Omega \backslash (\Gamma_{\mathrm{inflow}} \cup \Gamma_{\mathrm{outflow}}). \\
+
+The mesh with marked boundaries looks as follows:
+
+.. image:: ../plot_subdomains.png
+	:scale: 75%
diff --git a/demo/documented/subdomains/cpp/CMakeLists.txt b/demo/documented/subdomains/cpp/CMakeLists.txt
new file mode 100644
index 0000000..75cedbf
--- /dev/null
+++ b/demo/documented/subdomains/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_subdomains)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/documented/subdomains/cpp/documentation.rst b/demo/documented/subdomains/cpp/documentation.rst
new file mode 100644
index 0000000..79780f7
--- /dev/null
+++ b/demo/documented/subdomains/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for subdomains demo from DOLFIN.
+
+.. _demo_pde_subdomains_python_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/subdomains/cpp/main.cpp b/demo/documented/subdomains/cpp/main.cpp
new file mode 100644
index 0000000..1a523b2
--- /dev/null
+++ b/demo/documented/subdomains/cpp/main.cpp
@@ -0,0 +1,101 @@
+// Copyright (C) 2007-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-04-24
+// Last changed: 2011-01-25
+//
+// This demo program demonstrates how to mark sub domains
+// of a mesh and store the sub domain markers as a mesh
+// function to a DOLFIN XML file.
+//
+// The sub domain markers produced by this demo program
+// are the ones used for the Stokes demo programs.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  set_log_level(1);
+
+  // Sub domain for no-slip (everything except inflow and outflow)
+  class Noslip : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return on_boundary;
+    }
+  };
+
+  // Sub domain for inflow (right)
+  class Inflow : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] > 1.0 - DOLFIN_EPS && on_boundary;
+    }
+  };
+
+  // Sub domain for outflow (left)
+  class Outflow : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] < DOLFIN_EPS && on_boundary;
+    }
+  };
+
+  // Read mesh
+  Mesh mesh("../dolfin_fine.xml.gz");
+
+  // Create mesh functions over the cell facets
+  MeshFunction<std::size_t> sub_domains(mesh, mesh.topology().dim() - 1);
+  MeshFunction<double> sub_domains_double(mesh, mesh.topology().dim() - 1);
+  MeshFunction<bool> sub_domains_bool(mesh, mesh.topology().dim() - 1);
+
+  // Mark all facets as sub domain 3
+  sub_domains = 3;
+
+  // Mark no-slip facets as sub domain 0, 0.0
+  Noslip noslip;
+  noslip.mark(sub_domains, 0);
+  noslip.mark(sub_domains_double, 0.0);
+
+  // Mark inflow as sub domain 1, 0.1
+  Inflow inflow;
+  inflow.mark(sub_domains, 1);
+  inflow.mark(sub_domains_double, 0.1);
+
+  // Mark outflow as sub domain 2, 0.2
+  Outflow outflow;
+  outflow.mark(sub_domains, 2);
+  outflow.mark(sub_domains_double, 2);
+
+  // Save sub domains to file
+  File file("subdomains.xml");
+  file << sub_domains;
+
+  // Save sub domains to file
+  // FIXME: Not implemented
+  //File file_bool("subdomains_bool.xml");
+  //file_bool << sub_domains_bool;
+
+  // Save sub domains to file
+  File file_double("subdomains_double.xml");
+  file_double << sub_domains_double;
+}
diff --git a/demo/documented/subdomains/dolfin_fine.xml.gz b/demo/documented/subdomains/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/documented/subdomains/plot_subdomains.png b/demo/documented/subdomains/plot_subdomains.png
new file mode 100644
index 0000000000000000000000000000000000000000..18aea822b3a6ea13c36918abbae8b379978510e0
GIT binary patch
literal 27143
zcmeF2Ra_iF)2~T_1}DMYU4jKC1ZQz~3GNQTg9LY3+=4H@XmChyf-f2zLRc)g!x`T1
zd+*QXxj0wDkJ+8+?XIq>{y$Yws>-sMuSs4bARu7M%SovtAiUH?KzNae`V#ohgHF^0
z0s<9+yp)9I=bXcUfH5Pjw8yq}1Wrm@wYw1HU$waCyd|{tctmwb`qHI|V*)4UL@%Q=
z?QqnQjcd7yF$xD1o#DFmHfB~r@gYT6Bq)=(ypmMB8ft~j@{;|LlfzV&$kLP3)80qN
z3Cnp$?Om5byQ^33;wo8xRs-gY{SE`h+w&f(+>bh|omxP^h!9j+u(ILLe;}B$yr4k@
zuF=SmIKYL8gz6)3DX{s1`T_yr%eVi3^Z(&V7^o~2LNHC9B#G1a8q}}$TrtapLCJ)|
z#m?W3)5jCzZl4c!)Q=x|`9X>h7+z8Jsn>a3*|eXLHM!r^&wTT00absY_Z+0La*e2#
ztR>$Xm(U@f-<5D)sn^Dg&;z|5YdhVN)x{(yeGgA$dP|4&$6y|sHC`8<ryfz%$Z!5?
zjKm|DyRKQdcKOh2{?GVl%XI_fUo4?*R*(n%%|ocPZ{=glr$n&^T&$yNRt8dUqNqtq
zA*Z<>ZhL|jvZKkpsV_SnP4+yYFB_16vAKLfZLgmtYaz3PZ*YdJWM)coP0Q!F=BhTV
zLf_51F)i;@<#s6}bnQ%%--0n~WCp9c-s6}FBH)5UB&8O9p)q$$^CN4hOsXrL;7Y95
zrB9^BtFRW!ZEL3&{5YuE58p+^X(1DG?vH3@qg^H83qc)yafC~Nc0rNtyG7?FN&k6<
zp27fL-S!o{DnT|G1pnoo-Fc=dy<hu*FNQZfa;L6ul*Yz3v!4^ew&K>oUs~Q7T-i#`
zwfusHjp&z~376haTfWn=7)rZ-f{IKF4OUVs#!s$9<}*}UC>oB{)-lrqY`-u*>buS^
zQSg;+tZ&KTenA2aXoA#%1=Jxq6vhd3C_LgJkFTuCy!{=a&)#?xCuli6OJxw)sL-VS
z9p;+mrDJ~fi_IC#8WdTjH)+5=`l2?v)$$+2i(QR`9Yr;)zexLVYLU;t&LJ{!oP5QW
zPa)F=pJ=8?n`^AQNN>hfzS3^wUlkg1zY{-R)VjQbHr>Cef@u52viY+wI((|gAHw=+
zt661Y^{i|YB|@%XRUY}tDfuz>FcxC$`VDobx{zAWC&g7r?C(K!LE(?olHGblQq_k^
z4b1gyFb%S+6r-R5j4!C@$n6gV9V;}>)8%3T#TIkx%tW%~NlJ%W@W$)3SV8TT8JP%l
z=E2E|fS&{UKK!_XmVC_xa;Lc64m84fZAE3{D8%U}jmJ0{od~!DQ3HJ+v-B+9B+wbG
zKvOdhC<?vudDNThbY)2zWT3+fnR`@%D{l5aF&^Gtr0Q8H<dEQD&-mlv`+Ay_IxZ^A
z7{tgruIpvv2s*o!^w*{Oqv~K94G?RxX<=HYDqrwe!+7*mZ*;xluSExC!6mR2fiJSy
z3v8MPOSw6N!D@V6Ar8!Yz4)r&8P;#r!Fnh-X7Z>E=>;WQK|SQ1_{pBLpA^K^pa^79
ziSadVW#<LzpI=v2vEY08>m-GX3go~*WyHkq<a#6!y+uTaTxpwr=Mi_=HxjK|XDECW
z!IYNk<LnZYC05guEm2XhVSbn=64iD`uGXZbf15F&N>1<Sqeu8hJC2c0+r3RBwZ^*G
zlt@HauQ*vKq}B4bfL|f^PiquuUAzxr^o0bD7Cci_h6`-rscw*<RN615rp(nstGXC^
zEyeH3O@6tz>cvkhTJaTS_Tp~XuC@01vx+y}VtH@&oFhlp(aq9eC?G1-3B7M!q>_bI
zSeEr{Yl7>^h-cY0Ak<o%WH9?*_BhEgpr=_kT|6G5VoRQ({vT`+TKz~?s4fY0BD}2z
zDXY{m?a>&iO9Hl{eC}<CW#Cesy%a4fJwot9gL!@Mf}y6Lr(G3-+@|3W8uGjulhsL#
zLKB9ubfElqH%nr~2|}hikuRt*Qgn_b(tRVzmYJHQg2XI`VySE?SdbBts8%fP8K*4k
z61-$~_?(1W^$!$>JvQ~m$uHY>wxtqm`%e8iJFk(!<7&6VUMN<=AHqs#%0U^H{BHz@
zoOT103b4xT(5L^(;_E7s$n?1=e4SpE$V!LR$qUO?=y^p<#co&GL@>Q39b~vNJ5UX~
zuEy;RL3$;n%T+~#|CKV+T|wOw6geGA#%fa=&&0!-T`^*zti^v=;-<br<JdfkXbC^S
zqT)N7u&RFfWotx`a1oVRCgSv9!h+zytKECWbH2@U-|JxEWNE(Z@}Oa&>*i0kirCGz
zL#^L&r}x%CT!P5y5ISdvOCK7ep-V5)yh+f*W`B(R;@HbCsH5Q)Q2o6g`CGPhz2tbL
ztyuNSp*br1vN$&nafjWmx5Q`A)bigdx^IXLODcAm4wn%yJ<Kfr9xN&fBezf$ADUY+
zbY1sz2A&sD1}rbHdi~;?7dac_@m}@WZRvhE%)j4eEX(!En%QsLuQBKje8>@W2eTVA
zyKM9wF1G|d?3;9-jSIhbT=KZtNgs5ydR2No&-rCI<c3FaMW~y`qDd-njOn!K<KyIF
zez<oa_wemaaRG`rMG&((qc+C)Z`e@iiWXxpQI+utWll6o%GY~*_KR{@GN#NA#T(+%
zPQNP(zk~W?|6Sq1!9hRvtF<6;TqBPuY2{iJO8>;jae=Mam3D8PIPv=pY*|@ZlM9H>
z!zN)j>e3k22V8L6xpwBQf5gl?zOzw7+yI&2X>E3+a%EW<<>E{78Gr8a$a4?m5nn0;
zPK6fb{#Jq<{l=n$<%fLs;Z-3_1<|=q@Z07iRQ2w4aQ!bFhqbPUl62#?1L!E0@IlYu
z#_CDDcMh;92F(txzMewlG`GKZ#ojxwc0f+XcqV{}6Zg4*>8!bpvgbb>Skv-{${g!N
zF}z&TL&gQazDegi2J30+?C*tBnUvD<Q(-g>WS4}+UskHK@r`~}K>1`Sx5S;C>$3G8
z$*-0jYHeN-h+JDFGah&kwzk6|6C#3`n;%}njTdIntaDrkSZh1f>#1-L7aMlxyB{y?
zjn7ER=Erk|Wo2Z>1$W8j0;i-2ai`+Rg+urofPhc4VNH;aTWvvormWftQ*vkdQL!zB
z98}3amR)kGNna@QZG4JG$FpE4uBIw}B3a3T%37i-F(*#0+5ERy-&awooC!tS&kJS|
zC2ZHrYmb+Z%9^DX=QS-Iqn-1mCj0rne{GiPBl52O{$yJJ&l~$x-_I9!+Q{j1B|8;!
zn`;yVo+RO6pi?EcmaL<@g+t!bA`X1}g|(g0Um1fdUBmG?hbZG;HLRtEZ4@p?0F(O3
zmHRIjFoY%h+5mV(nX%7K8mv<1>B8ix$-Kk+cr_^rcQNpweh_b}E8y;bUYR_3Jt6$7
z846x7Es$%gIJIr|C5{!xqbmYeb<RvpdrepSXKPJQR}m8qRHnzj8Eg$6u=BFoxv{j@
z0%5ka&)Oa`(Ac3A<zWfz6{oD;jC+e+%xbLNtzLEA!fH88y6%%f9Igij?3SzpB*5|(
z_|00Z(P|F9!X-dvWEEUwKm4@UP!(h^wI`J&ZK@@vQTPXBQ1PkKi*EvoODtLjDvZ_v
z#X>W3Gli%H!4gpi`6KJPQn&K12l566$Pt&tmN^%9xe3!tD?a<SVdD2c#5*qL45I#8
zi{CA_uU^!M-!+K)tp}rQlZ$<LDWyxKYdj7Ku8K<=+_%VyosQmpXw2nhQ7~zk&cqKd
z!7VW$4tF+HqGqMspW`RZfU!s1s`bAzzjRB5+bkK|&ncH1j(C5YQs!aPtuvh|RocxD
zdi?c%&3`T6O3!Mg28vbn?h_9>0u39QR+p(3Ew_g;`@4<5)UXUZNL_4z-uj>hF&9WS
zS}P8mDXnIAKUM%%(7tG?%`QQ)p7dZfjWV)s^+;oq1@gi+BAO`(p|y*N0Q*Vy+WnvO
z?)#l##{A#y&N^m`P)qkeV>cVvK{lRb#Kb-){e+fxAkI!HsX;P##YrnK1mK5OiHt_O
zdGdtN+t0q;BAQoMh8MB~mToNIK(872Ou%vryw!ZEX#;X*+M*=P`gj*gQae0B4S3sA
z$Sxr*klaP`wBP$ueFfW9zdk%x{`*^$@Vu7xCU;A~(u#SN!|VhNJvXBmj{rmV_rL%5
z16yS|Kj2c2MhGy2|5(<?FOi7Ou<BSrMD0aYj*6S8F<c=nU(b<P?W1Pi{1ROGe_<o;
zcK2{<EpLThme5$PXcep2>n+n4v(-N8PZx>Jl@jXLAsEOh<lcWwr@l!?PzGKHT&)a7
z{$mus8Fmgl%eEW^>yf9k>78z;sH_G(J#=CtX@3URI?`sN@2f=iiz!h%7s`tQ<CAN%
z)zkH|Zr)?>Mw72`qYQgsHy=h)Qc``H3_HGx=xHClUhm}g<SMy^y>2tT&L+AF9zp_t
zaQ!Sy&Km*Nec5Y56#s!kAiMpIc*-XU<-_x!2sN%H0qcgdagkAayDFzL6d74r&d&2`
z&VW6T$^9l_<$%cpTqo!zJ;(>x{{aW)l$9jU_uVH%TYTH?U@SCkf3oZYAJ6i2;#5R0
zX0!P0^{cgyZGHla7hNY;PHL_7pcw&)w<BERp}(coook>`G#NrI(fkBXt|tri7$KM+
z8L9}v%{W)Ph>NBB^{45Q7#ff`ogc(+iEsjv8~HoXE5(-EPv#O;`a<mKX5x6EehctF
zx2Ngd{zu<;#h&iZo-UoAF858IZh?#QjI0c0!1+|Ju(!6ePL;0fR^0m<y#}k{Wctx`
zPLn#*-e$*T3jcq-YY#`>_VYEl;z5D`V`wbJ@h8I-+#nOFX_SUo%{KMIqJb)}+9hI7
zLB99$I=HqULsoOT7H=R)0!ftt<WG;KgWN7M9xqdV|H=P4)KB#w%c1XuhP02vlY+H7
zmf7HQ_Q$~K`%b*@(RCkT7nhJwo5Lbh#eegSv)}UaeLS$)&ZbL1?;RHEfKRp`cljOt
z{{FlTo92z%{cle7`5O?ZJ{H8+rJ&W+SnsW={9HU5XG+}`An2g~qiH@ZkWrtWrua}D
z%K0JpfUSkl^SdhFzuGWl(yvx8YfysP%_W@jfV^jT21Ay@XM0fWvc3_A<>Y!RVRQhW
zRl7>JzR#PY-Zu6r``j-Ke)s{$toPshKIH-V?}gmjzi5W%U5|biAWt07o9L?z*RyST
z%)xoJ{%9cOH*~1eLaE{0QbuA8-ymOG1K71#;@F8-&{8)^BVLTr0Exd$7Ie$7{LhRj
zRQsXf^Jer<`F$)c)u7dLNiEt&GKI_JhVuAZwxQeP`UAVhP%^EuJ#3aF0*49)G^E3w
z5d*WKdEANhzCOVF;Hg(#FL4~&s4*aA!1fjdWJhH{Zz0eLw~RlQO~!U<>(FTM31aqF
zdh1XTTnk~(Ior?Bcie3`Av=?=6B=hyg<5<qMMKeFkW%#}o7U&fdZj5<C+jOj==ltW
zr#xzy#~^RgEA4?F^1afh=Wg>O{Zz}UgmmV6Hw#C!z=`+L+M$|1K+Ck#5N)I0;HKkx
zj-`S#WJ5W7$$=h(jC;Q@79i!OR_E0qem7+IwzZo+ZV??Orlr=TV6A<h>=BiEU+LDc
z#b3FcLzCBr3dgZ)Kd;Er^JR?_ABDR8wd(Z8=yS1K%S!FY7E|Vd&oh1*0FJR?k;)1N
z5aYN9o)9xJm?nLKeu*;cXD!;1sB*rsMm4Xiuc>rgb9jo2bKffX;kI@kbQJyXsu&{1
zp&+TwVWsefKW<O&*o;2A?8yk{W?t;S`C$G9HJEI=O6rA=ED4Vm|J$MLSdiwDd7dT4
zv@w0L$6LMaF=!EfxF?h6CnUDRhr^g1Yn+{QX>etZ@tm6;X^7do9Ou1bkuQ3f{{8y$
zrg{ROd10>)AIn6tEG4HS>1u>4<>Y2?P90Tii!CM|(?9BsB#pGDh>(wfSufTR=k{t5
z%9Iy6s;bdaydP5^B)hPj5Cp$A-?7`D*cWA5mQCr*ypZg>R;!kOEDL`jtxH7nnpPA}
zcmz+ToUs6-G}$m?G9}(s?Uf59+yDcG&=O}HSx6SMk7sesS-+f*Xo$sUTg**UTGZI1
zqEInvN=M$RQfa6QUPQ$)^NB3OuK-QAY=eawips+ve;EEmYw>9%Q}wze`>FfoPwV=6
zYSNw+w0-(9Tvr`+r#Spcb<5lLM)ijVBfdxSjuqo<q};`;8V9?6gfU}a9s_3;)MJgH
z^0F5nI0{FC>E2f|Pk*9~k)l@`IW3^4(Ua9mA3~iO(u!kxXgO3-wcyKv|DK0F`lxwk
zW5gbe7J;);-)K&-!7Kz^r~w0i`$!pN_(6^W!lrQ@#bEH;Tuokn*E)#cdur^SKdq2@
z$&Zomv!dMm5!-AuI+?5Lfp(@+(e4DH(E{>yRJ2gGat79|^??{T7g=lF=P#%rY1I$2
zcs^_s`gZ}^VX4y6vOyLVAyPD6M5&#L!Gekvz73yKn+#&A?4;}^s^p40XN%NzZtR_i
zb<3COg`?X7fD`<M$Cy9Jl%}4NvK*z9P;+PFZF`Q#55!;ye~x1DNV<cYbrqGTyinrp
zN8iK~;jqEd0%$IzFc(eXHr-5sB)3;6wHhZ;z+{|b1Z_E(Pr;X$=%19q%LXi}z7Sky
z-gj1Z1=v*&pPNDW*(yKmyk%_FJ(6XVEx2<0tJ|V6vT`|X%R=MmbKfhkDSi>s+|BXL
zubJf_fX)}csXKmSh`P|T`|M!4tKNc1JYs9hn{&#3G7rWHA2eb;6p`_bL}^mwc!4?~
zkntA9nMQnzTYgLQ{FO?=$6=bd2J$U|1++s%vEVY}R|Jb5KT(((P7p;0two1!5qJnx
z!*(PT!0XK`!?+HthYppQShSAE6H+R^sV88e9F{(oRZGr=4l?PX0WCkl8nPB{w<hN{
z&mr(@a#wTm*YH9Kk318KL_!&^jMk+Xk6?}*se|`o8)C!2o<?LPMmmenDz)E1XMIu^
z|8b*doXkN#tf@ajR7F^<Ruwi2)yuEi9K;%)pY2vsTW)BZj5Z+`_1tv$q~4(KP#Avr
z20j@j*g5@C>}3B<$#Yti<rrr9%}j(2DHBd7+_n=<u5=@SX^{NQV`oSp4K#b3{iXvW
z)>eXMr<@*VSb$SmmR~|PKq%1w6E42zI`t<^l&zPMm}ArnR|qls1#t35jQRMMwi$ws
zbe;pt^YT^*vgJB$8j*zN;wICH$86B0mun7=X*TVuX2pipm$qS@DpsU&7M|J&e=phf
zPVbeax<b^GYE?DHj}PE7<+79qM4NC_!eljD50UbaSP7*M;JHRS8}*9vWVs!>w6_5d
z+m#%kFZ#*6m;=#qv0our??CeP)7c^`vD}u4+z99rwl->h7H>y0)I5Khsg6=a)}<t1
z5@FPm3Bqu3a3kxaq}){d2_zTyM%j*u8mNZBQtA&}$k5Mn@tc|?4=;=0KdJd+gf*TZ
z+|AkxI*oXb73rfCVcosz*hs{w#3}3DR%Qa=CI+mr*MQa#R*SFRfZXoDy6=f4W}WZl
zabIcSut(ISz`Xbs<Bto|&-CwsW*Q}uGOKJuv+hD|hGyTn*{nP{Lh}{S;V``4Za4fE
z$FD55wHKgM-@#v=Ll==9aiTm<_g@SAlW7OMMejR4Ayx+&yxIIg7)NUH=ZkXjZ$jvo
zAEQA{wZ)Fy%E50`mW<qp3}6E2Bf%lRsXPtXn|2*W7iRq@k~c!mkqOxFsrsOW+8dfY
z)6<P6W-$&uJJd2g+UlS~`rL;3*b>cK*8-Aqw-ny+l=GhL7)xSY>#Di3W{Zhh^Yyya
ztr1G)uaMaYeD&>*NazF@IA)7OuWKFZIaXKf6tR=QcXYpsPa4z<M<l@v_83}<!g-bs
zi~5uoXDN`E8oNmX)oM`0^&A1drJ<t{N)FO8PRzxN^#ne-@*dOAJ3}uXF(Lp>tQXZT
z-oYCkm!nZY(zAak^d_mc<WmaUCav7Ju~<w-a}7%xbQM^;g$OgPW#hpoCA!bk?0t2!
z+4!-1-*Vi-@`gprB>J)6V&j-ql+({cIOwK%7w^0;KT>Gz<dTqr&fQXn>`kaHi<)Xc
zQjPI#=6VK7xI(uHxAM}{&G`J}bZBYlFai^A1-y&G<QDiG^MZn0sA+X_uH|mlu&+%W
zE}|9ghcM~B+idS?F#YV16*)8|DZiMlX<qR9cLh&09d&*RZ{wV2dpmX)#i7^WZw@Sc
z`G;L1P@eXU`e}~zKdgNaiF;%m@wF8mR;4t@E8BI%T3;8dVmpONGoNRBKge%WG&tda
zWTwUHuGWXen;4j%ugBumB$TkpNv*61a#%nr&4Vy2RHBoG^|rySbdI<2b839$bodcB
z#azEW<~mewmcd4u=@J9Xu1SSmHZ062#Z<8s`8R_$u&^tfW{jI!RmuBU@bH+`<j28J
zDW>+Jgv99K1z?&7-%=I>%Q4$+xMGR_c?+Rk3=etGm4=SEUL~$9-RaQIE{cl{(!Y}B
zXXo*HDR&onsn0-l9~8*#_R|EWF4(dPfq?j|)Y$}T5m#2E#?u`uI_R0><R#~%Wk%^}
zx0Ht^_afm@@&CY0HY{*>8FF;ufs$mg&Wa>HmLjG}z4q&WKRQYZX7Y3r5T<h$a3?sD
zJDXZEWE@pQTke9^nrH!KMci8RC-~7BZSj_G`YlRcu6(CnB2Tgr3n>8}y7A6<L2-&?
z;|k@YmLrSK;)cIwx`Jock`YDO8+9Q9((xrtJqi9IN7Lq4(RFkdSJ$GtO?=&d2#AO9
zg1R0}BkuKv?5IiOnc16)5~@ld<(fi_^?B2Z`04ocT)A|78ZPSNo5He-9&GgRoGM;9
z;%0YIiv-A_D}jS|Au8jGyZ8(OQY;)Zv!S_ks4c5;UUFV0D_^smsRIFIDdk5+aUU7U
zUq6e1`cw<>YkP%OrD<J02?i4)S)or!KS@SJU)aV_YG#TNDu}~NzO|h)()*QM&h4o#
zhm!Upr@!Y)0q6ksI7PS92Gch@WZWQlfpUxj5iXKX9VlI2s;%Va+D5@vz2%(($Xzt)
zac+2>rM?1V@ESH<dg7=grB<I}oUXi39I^r%)om`jLmTALt&;<y{ns)3lV8xPt>NMn
zthdCu<TTS~UHDw+imy?bJ9u#y_2&<pb8li)ODGvG%Jc1aIwHqzxGCr*93U@?ephG`
zzY{QtDb7_3DQ^lW<f^X-))T?}kDCdZa(Fc^qPZgf@004iH1zwJF9D_89xYNLT^>;@
zlZC%?6u+&^!@-ajzVf!GMt2hrRs9#O&l0+R<Y}|CHN~0zx?R6xaf<B_2y$K@^oxEp
zg(uO!Vko?SNxQhGc(Fcv74o*k*YvyYX-RP=7nUn^HuqUYa=zud0~H%uo^SKHQwKu1
zofK$SP^38ii06}3hdya8FJ1l*&CuTWAw3R2v~rNsOI)!@Vdd2PIcm6Q%<_Qa3UL{d
z^irWYj?cV8P0LtBAFY;-KB#Vj;El=ikMcZ?S6G}FM7pTh8TRjWT!?D25|>rVB`%Iq
zFai2lNa09`l@@p9BUq?~H?epkQnKPwZn99{ftRVycbSC#Y1Gp9TcU3jbLLo<rh$l(
zxwIU~DEH$y+)CCCr9Z`P&*Q2^LF#^%cZ(veMKeC(x^TPW3pzR=sA~$uY7tw+!HxnI
zlA%=D1;YGmb*_2~&>p!Ek?EpN!u`{RgLjtpjaR9*PqT7~#KI#~dm1C$O`O?TnwOB5
z4KE`nEx_;)Q@@a^H^jzuwGF6nd?GaDj5r{vh*+oe=MUDFt%jE@t&q&CRLwEj$tNOu
zLy+mp_j_V&STu{NY4HiF&z5|s<>P;b==T5MrTC6-TDg1vi^gWSywNVT_d3GDWZ$FA
zYL01-TJFa%5(W50=}Q8i>zDCT3egtwTK9sT3u<ZD#i9)!44bN;({G^aIh*s!7FJui
z{YW5Zbc`P#|6u(Iw+^n*MWyst4zWc5W89eTvzi{Y9t|h-F3Ate`sz)vzB9tJ5Kmut
z<n-PkIk_XPZ^T!RBejq_w@iU!FBlPRI3sgcxlt&K=Ha9-8W%f2bWi9L%UKT!m##x>
z8vA$(Yof9&gR2%qo8+Al!8BO3Js_$lip9~D=49jNaI-Ks7s$y=|N0`z4S@y`LqIU(
z!1~>ESNzLFWL(d0$z(-{@_tpEq#)YtBcgt3v*_ZOo8J4ma-yXm10_{U4~CFz*p+%-
zq$X}|omQxR?@$9<0>okW&H)Ea732AYM<42-#gnZEZ9iZmR6pAI>fo9n=s{O>Fb)km
zrMX-G8`h)$MvH;_)E!>3*l&SebL6>=B^meI)#)NRRc47GB9;|w6xQn->h5@Tm;?CW
zH}O&$Z@vCo3(y(##V@R9JG4YFZNQ>^jB{~&NND7Uo34_x{=66;f%rwaTeNEw3q5v6
z#@m%1f<*R;CVRE-T%sdb!|ugkdDy?mj(Vm6b=N3jwvRv2o2RLAo7&7mEZFb>np%j5
z(T^8gbTd1<HJXZS@EKe*Y^pSE^W}CiHPf;p!1VLlWGS=&Lq#hh{{C0=@vQpFk*)}#
znTD4!v~TvMxm5Q8PL=h~S|3wwfPnBrU%uO<PR7YC3WRuK5Gg63^}ie?pop>w+5c9p
z29N)K#VtR^3ZhdsQ#Ja~jHRc`H#T5b<-2dwUa$@lMd@Y0B0&5Q_JNWnlRmk@qUL0#
zCdH1O!=tfkiB(-Ud%exZKJ_+mYEqv-D^L4fne5JE=-zRas=2jDSG8IvQe5Rfs4I8*
z-7CELYJIsnL|1<g)0h8FD_s(BG8htxdp}7r+6y$57S2x2zMbGMI*@*-`k~&fuarwf
zhLg3oMTkWXUGRr!h}JdOvL}gbL50yEmGmg&5-LZQTi2RK6@gH{cD>%OoE`uAcEz7=
zY6A}KpScVgV~)%1UKv1PE<ouV<Q?;QqJDs;(|U5^I(L=lcl7;wGbTbLuHqHol`JY9
z(<G|x@{q*$EOG@#rghZJ?&jJU^0Qnf@9Lzyt6=2&))K_>NKMi9XcGJ;e=^lV+`XoG
zj-1g+-b%CcK(*TKGLg>S#9D;AZ`1}}RC;%8kqdhr=ze$G$$#9-f4mBMx)Qzm-2ezl
z`?cMHD?(?q^}WW+EzXpbl---rtjd4@*C^~KJo5~rlf(m=GjiCy=n8fDlY6SZSPt{X
z&G<-!uvp+W{gK^cCA;-76~E?O;(@ELLGhczib@K#EGZew<Y1cLj?`pnp>@LrJsZ$@
z#Xo)fHSJEj<GE{3k5`<n>mkOYwEznezey3l8M78UlMOnTJr2BTN7-xg+}EaQ+XyFB
z7TigV${$I6A*IV=_pmtHXyX$jCn;|}n~w<V81@(1QT-#qt)%a!_~5O-vcjisrVtnq
zMyOW9yjyWFu34}&?ypd;&MmtA79R%LQ{6VTXpuVVAe)%&rj9h(<w-#Y1lq-CP4fFK
zypmOn_S;s1cp#u+Gv@oB4#bga(ZpW)0&qY^Mn?I01*4y?f?O65eQJ<!%#zCQP$t4Y
za>ZZ*c8tMM^y#2aAqJXgBUd@cq-TOc>-u+?kgtxdcu4y_3j8rN?cE|p$oHl&T66|o
zK6*zlZ3GtN`O+ql2``S{&5oqFxd1w=dQfuqodN9R-xlT5=N@B&7AK>Q&nFuZlwuu;
zWwal{b_$8nwIglB;Jb7c>}>i<YtZCUmOFKj?E#N>cO&GY0xbcFT#(6;?L;<YKr`7K
zJa<$G=Sb7u)`a3}QD~Xy$eG79m@cg(^j?Wne*c%Mp?p&obX(RiA(q{AywZMkvzsse
zc)f+P$0sJ%<+$7oB=}W^-%n-5Z>IobRTh6Z2dLd~IH{AsQR`N?SUU4F496G>5k=(7
z*EIEff1o&hqo#Lmj`lN*C;TQ>u~~IkH}OEfrtQg8-sJMz?+VwE!tvOg<PToU8-onq
zAgq#i5fX92e&7GaIs0#+i2Zx9_?Yl?olx6xIwDPI#4A_JnD=?}s{83-uG&CF_^=U^
zl)vNgqIRvr=d4WpVGr0nTLx>lbIJ6eaQ?W8|8VEqvvDhVMiT*8Ljh%zvYZ!kD$8WF
zl#uhhpNvd;sQPjRvfJxDdl17&l&%L}m`Q+T)xjAUKY=9s$9b`l+Z-RmckvixLjm)k
zfXyjcO2?MvLCT<erS~hqU>@$SIE_25M_6kOJAFNCcYeE11RVRV-OaUhT|68IJpqGE
z5WQS58x-SvPU1~DP_y(>X)AM+q%vWM+SRamrm9-1><#}k3|hg_FSjYJ+ae$&2v2ez
z{a|HM9nn2%gX(DAT%_ZnUnjHwa0xki5`@M{FXmGj@iWZ?#Man^gf-83qo?Dihi(a9
zcKyb`z$`E~<cJ470wZkny@1D&zK@TK!z4N!jo30HHcj3*9%R)W?wg=Z;;xYN<lbvY
zgiwd<DY8dE%=sRM5V2RMEn;^e>v}{G@I`vbX$7(*GEA@7^4&L{HDp=XP=k9_!E}Sl
zy(_2-Kf|Y6>;y2(>ppbO-vG4p?mEjokDA=LZ2Q-T9%VBMW`ET$lnWeKv9<N9NJ2@^
zhH6AA@iX4vETKi6MC7E8pger5t0CL=oYJ(k(o4ME%Ul#j1oJB>UyNpGMpzX;%_fjI
z&N)u@s14xixZ;m`No&)aBX1T)P_zM_F+pH660nRX0e~{299-O=O#p;xWjDut9AH6K
zb32~3e&o2K59c#KqWwpny%rm->Mz4ZQ=J-aFb2bgsVfFLU$$gPigJw2`ZuN-$MFKY
zmFZ0fJbSI)jbewe#W$(dS;$vR1WF?Wwx*bLv{z9k%1Vwo8{0Y?Yfler&mw<9eEh2S
zTEIzdfU7UL=d4<#cJ=L$tQY`lTk4Dx#2*E4a|3VpB%}O=fRmAkh0jQY7R-TBW!D-I
z)JIuJ8IhrjawDaoSoQ%flcXG4Jf~lItvGc#@$N^46piSayDI1Rm@HDF9W<?fwFwZ$
z2GL*BmZn?sv?Yfuzt0$M1$-w5z)OHV=?@s4FaVXpr}qI0C3bhv(0vl;{M%zj>DkxM
zNVcqak>Xl*kMf43WB&lM<}9kpl8j93GQ}*CpVXek5V1<H0VasjFKn#KNgYBh`k32~
zBs|d6S}nPozp+fzSFB@>a8)B-evf8ks<I!--$*FVOp$D<J4K*IG$kvx3C~D}@^&&}
zTxh=vh+7fww4(vmcD`4ZA9%eHvDG<OrS}|JMmgFKDgo&8`@4Ho`SRgv;N4+1za#LS
z2H*xXDq}qLKl7wE{!U}x2oHjgEYD@Es}bXn<_@OMW!bM&&tti>XfML5UipCE0gt#X
zW8<?C(y$-w`RJLrBe*L9Nmr<Yo8HvYzoRv>8F1ftE<C^v{1-|~OA8R1?uX0el3qr!
zlc?1gS;_zpAnY{xvKzIX&lxy(0;Gw6!?4wDXXLy4t{A}T02r^=XfvhLb(*$#?#Tlv
zB)Ez%lEa|F=dDUyW|pGmTpk8z35r}Re<stU!Lh@-CVZyf(a~5~xSg`)kui@*LmD@n
zUF8liLMW<YM!rvP-Zf_qe+8odM3l`$o~Zp?l^P}sjl<kNK%DfU7Q+A|?7mw$?mC|a
zIs1$nh+R~u#Kpyt`)nuu$m}^sh^#Y3<RKyU?K`1@CGeHg#^$)uTv&UtMwOY<^S=sk
zQH>kf;KHjc6!Ner5#m@B8ZP^BfaaM~yfK`@gx?*;qOMha5IY`D^m^i#E(aMYDSBW=
z?Nu0P#aPM%AnO1qTywxPM3~v8*l0w3nep=H)dlWix|dle4Sj2)^F;z5M6wZ^K)Hk@
z<qa_giW82EuE<w53?Zw-$K&nPrY=n?AwQ&>=AxB=)WDD_$O+1OUb`GyqNEh9(FHV>
zB>>%V86ZgO(jiwky{pSIZl(g?ddDk7XhXpw8_@NFHQFK;HAX-Ev7aO*9OpdHAGZ!~
z8HyUz#rRBn@7~mJMv*0hEet_)+NE<};rntyu3r|>pAXd2Fsko8^YO61b{KY!ERKpX
zeu1KMr70W!*(7fqN$4Br$Rq2HXReaplG|AbV?gyrsFBNXAl!|HPa_E<{%$tti>wL+
z($&9G=o+jH1qz6{VgP4_)+>IDEbN`x&t?wAHvmV?6wRvC6kDD}eyT(o@DE>pT!a3-
z4D7zbp@rb7g1sz*Q!&}oKVnAZl1H@p(+`eE(snK4EV9S{n1iXA(CSM$>B)d<c`iUL
z!EM0FD#UA7kcL*R^xq8PXqmR!_+}ldi9YQ}2JHy9k8mWJh)ZbQl(z~6S)<=%RKUbo
zQdF|hP@<Guzq+gKUUjPF^2*pSR6wgKJ(bfBGrpC#kzeM=68j6!e{S~rB4saW*pPBB
zJAhY+R#+Mo2RFQDe7})Anyz<2MSEUxMHQ~`HcbtU_r~@|^hdJHA$TwWOx{sxfZ0k*
zn|X?9pjHA|J#;wFo|w^gH_Nld>Q})LdsR_S)pHaTfI}kW0+^GjG|^~K;#_r2Xj!8n
zdrdWe9gsn7i+_(w=WKLt#+~-!e7rIyLe33AJh++GT)I4_12A;2ksQ!?1!B3s$|iSR
zVznX}*K_1}!3*TITmnH)Nrrl?`N*MB^A$9qb|I$UwhIU>ysM-wkQWEP#*SqO(Dpt!
zyivVSD4a90+@3r7nQX%*=fgW>aey;Z5Ida%3AIysP|WNcXU~>jkbW_PLDhGfh_8q%
zy<^eC>w0%n?pETZ6PM{e_pz99t~bavu@@W)6tdnE`sj$T*oMp5nn|YAcR0*}gUM*V
zb;JIVF(w^qB9+lqhS+LzX9x&4LYR9)Qc!=>B9>zP*!(!Mg4JkP0psb8p%WL(nN@j1
zjZ#^+(<%j&wA#<MD=n<7_?^oL$akuBUuzGGkuNa^atFvSF@xUI@8QfvCGM}I%kn9E
zZn|=eX-kCC?Xr<Sp94!iF&WC~=Xp9XwFF^<AsBoNj#(mY(+G>EP*uSXzb<;;$QBEj
zQIHKYnVs0E3JB4$r**RI>xB^nm(<!PkpYDk&uo-mX(-jsvSdhijtTRn)l-?Ilz<zg
zP=t>bJ<nq8<db`2X_Zi6&!R=8-JucGze=d(uM(7y*3BAy#{p~hddDpoX%tv$2dQnO
zMR^T^6S9gy<Ds8~siE3o<m0T8siChul@K$)>cc9EGyWj`O#Q5i*V9vxfLbriQu&e9
z9QC!KAo-{w<}!1M6^NuKY-8uB_z9eHDT_hFMzO)Y6+FKf_g%y;t*%^rL&!(tq7+`-
zxHXxd6h-Zqok-UJp;4h1kEyBRroE^w1aeqXPg$D9@}nB*v}5HQsJX>Vse0B{2RO*|
z5~xuTDb_xV3%ynRHE&y^28()=_a<B+E*E_EE*u%K#r5~2y!VO$NW(#PakC0*cKE4s
zw)OF))Ox~1BSshy#jz~hlVF-<+L#rX8rc_g5E9^B1(4niioFa<sMXhhtWIVF4F>8t
z$k|l$h`n4Of>1Vj*uvzh?I6X9_>k0Mvf+x}JISH%<!wB<Nm`y%uEaxaA@p|D`d^)q
z$Go0J{}J`1*J&`F3(9xR-08*dVHxzlw)>?-IDO0WY#U5FU3ZM>0+z+DT_y3tWRWow
zo0C(wy}L;=OK6%BGj1D|GvR}>bEO>S?~>hH2@D1FdVrWc-K$<L)tpH0IQuPAL8sFz
zGYKV(#e3<EXXs>*UFq#biEoXrrHX=ujOkt~F?)Sc7aST!g65>%S;44QUBE3sNYq}V
zS*j8-o}5YI4u)f057w%rzI-k>g(_Rfvb~>=58@M)vG`^pZ{CYT+aI+wb%h#x8)RQ6
z8~o-}+6jK3$)PB$uBcXWN%xt_@oEutQDKa)xYXS4&%x~f6|SPOLVa_-xEA1DCY|~K
zrZVLRVmaO>QoaD;oF_<z`&9P4DRO;2>Xtt<^snIYl-bfW4$DT#=yE8ee&IK)OSy#C
z(PJdzZK;{8y|$!)Rv5C&=TuAyWMRnPMj6{fI)CC<T;$L0xydQeBC~>+E?B-FXCf+D
zkm2NLeBIEmKuCdPL(fxfnu5q|De^=~HL?;JLZfr;t%yD{MLrI8Z+wld6?On^Y_oX6
z!NQ0z$!7v;!uuv;(R10m^9za8&8PpW#>L@=VkCDSH8Rw22-UmT6;8{L2>9eX1k(4G
z;#bY69SYtbX=^5T=y~sds#{v58M@ZeiGP__)%mvW>WSgOjQG%?O9D8Qy&$|?ugjG*
z$FC|<Zz_Kwpdak%pt2~tha#>2?I3b(FO5%T?p;7OSYG}g<^?Aqz0TK?npxKwnf(0n
zr(3f!t$5{uH1K7bFw6duc8iDhm}&1R@YC^{TI(VrAE??LD&FeJ%D+lRUruoib!nZX
zluT<<WscDz-ew~_bB2+UM-AU|8Oi+&)vQDXL(|{1{GFT*vendXcgFaS3agI0@iFsj
zsG%Hkrl4fQEE`X4TSYo~l$D)P<44Hw?90+y@g(Tb_UfhikEC_AvUT~Nugq83Zc2`<
zpur`y$QSu=iLPo-pH~fU0fEy@i(I}^sUoY#4J6+d<q^eYNs_VCaphYIlg5thTX|>z
zX{kx6r0C|n##*$%oHiwLmd}cE2%VOZZ=7CWWU=@A8KQ%d=8nQZ&Z+V!`VkYzw5VrP
zmui+!-j8ch)Q*POdb^!fjV17C<6b`KJHP&pwP%oaW0927bWJkqYEP_dNE5|VxmW#<
ztW6<7At|dm*Xn{^6#-C#$fs%E_iH9*4L}n>icRJ$8Z0_IO1PJkW$5%zC3L-!O4At{
zQuGp^(^%&+@@!&kbu|h2ZlfC<#jA@5{Ky~5Aj52gR?ESQfOx-XqfMxAR?(K8zN6rl
z^4Tuu*E+YA$-6PKa}R2@meH;WDFw6q61pg%o7|)t`YpCsd_+&hcZ{QiL2g;xbko;b
zC0flqR4!(PKnn0Wvyeue^Q&TSplk%2rGxgkI;MXiSCPv<Vf*s-Wm5rr71LoUt&)ml
zQBRu1_@;&@_D|YtLLGnq>W8=8s=RD-Au&C^Zd@<0#YN<*aFGK!B?ipyDC1?$LWeJ*
z(8H=8YFmL)QGumbwA2G+bPFImVb}-quZXz<TH2IN+ktd=Fdw9}aSZ{oD9#lQWT1Qn
zhpu`kKEtv^z+1@AAFgtw%~|@{Vw>lm8F7@PiFI2%7S|`F=C`)AXd#Uw;b10BO!Zyc
z^m9#aF$TCjqu=q44nsBiSgm7n>rz8{PLI>Azy_#g6v$Y)coTi$1O~qp^q#~_^kH1$
zXqSw)QP;$M%u;;mue!abK%)@flutDw5ZV$6u%Y~xY1%NPemgw8GZCDW6-)+d`(+H@
zd)ruaJ$(qMum9QlT*EuoakH!3|K2}Bu>RTS`Qke84@pG9S2tdG+OWrKP<j4M;j_9?
zF~*-8woDstOzN*aZOKU`i%B*pv`rtX0g+!#Mgq@M2cCx^u{UrKdj97c+lpRcx_tJX
zlod^lOipHgF6y`A-F#nqjT^t^s&M(Gnm%gj*Z=ajd0;;6Pu7LAaad@1w4q`F53-xd
z4XqkomXXc`!NK+3Pybz&A%zx-oJ}pGr&oW-S-;lL_ixuWUK%_w&^$G(L%p%V#6`UF
zA`l7ocxnj;w^tVRgx_yfs=dm;qCmZan=T`J*j@tq{`H;ZbRKtkKW{~>%|M8oq4t%A
z#x5IsoWALM+&ip#M&*ip2e!w`p3k$jG3w%=;TTzZ7B^0WZZ8tDj|y7o{SL(lXaG5_
zb2H(82m3`BPk^Rv$Zjt9Rh^m=7m_C+Y9aZN#A^Q=zUIf0M;80F_@9Bg0~Ibp$m&l?
zt#8RW&RZ-^d!bWsFW1|c4-qoU79xm)M-M|qSd4nh{v){7MlUt?o%@E_{OmkhZQ>|=
ze}O6neBDUpQ{Zu;Yw}+mzG@g}CaIU{FI{ZSa!gGrTYHmI=4a@3T+PQY`uubz>sI3b
zh)aN-kEErGQPu{v`!r6y*HIKOrxa(QEzZV6wf#%_5e9f&JP)J_s>=APmF^VA{pIn=
zxr<V_Y=!dTckfh18cnKEMqZ4HopekRsCar|iO~zBzAW{%kGN4WA!G9=zgH%p3Ozb{
zwPrG-pYF%R@L*ze4+JvP`7{p>$9sj(zMU5w&5gqJ^Wm|oNN1}1n<!S~1pxf|{i&?Q
zAKo_Nl|;|UiiW&HtAW<4w}860`wmOguxPb>zc6K?7^dk(Q2d9sH`O6hKbvdu6Pgk}
zJV2_6{2BYuY~1(Wy}wk)PA$qeb%HF{tkNsEthYS4lySwL@BdC+lcJ-ZTtttaB4P!X
zYG&o_D~nT>1<ZI2TlDU;`<;ZMGveME--K3R1*1yo(m;dY<43JWMj!URzaWG-!wgg-
zmXb#8ioQwi2$J~7f={%u-TW+8M$)d(OO$p@xXFki<GX!BSlEWTbkC3>8I@&Lfu?C%
zHW8h?x0j*_M-K|>4=8Za{re!sRg#dVZy__lD9mmiQ@+5&Om{re1#c?Mg0-DS{o8-D
z^S@Bn?%2ISUh3%Ymf_#VGQp{~PP)*8^n~(w{%{V=h7z?js*)j%7&xTULc5ur*3o+I
z9fe<o=Lsb$!Wy6cYaqh~`0ad+!C91e_oU<{8WMNoOCFcsrNdLN3$9+~7ZG8I+J25i
zUyRbIEP&c%l9b8CMS0wLJ#A^in-!~R%Artg!R;@iZ#Tls*H~vlLjRpaB_}$yHIzfK
zqaOUcP~j6Ex!U>fM++6R(%$S_nF-}y&wddoMs09f5;P#Ya55>&{}j-lDeW7lm#+Gc
z8~g^*O1Kn>^i>MVzQn8Wp%m0{oN<aA*X*h?y^Y~J`Pux^JD;}`@mTS%>=*pvQ&*5Y
z?EV~dG>|La_US~!$$vtOI^EcuZ4n+VF<!IbsRHPKkwkcTqm`rTAbaO+P=ThQJ_`=q
zMeg}v)E3q_9iWI!e!`arjjb5*)z-M+#J5U}9s=qyx_UW!98iGGUcN__ojmLJ(e^6-
zy4;gLoGruP549E=8{w-TJuf&cUaN3_dcEH`G9oy0&hkU=tB1^ho%HN$Nhmjv`xo%)
za}gQAApVdETHf+f{eBKSv~*83gWFNdl@%jR*$8Cq%G5*n;l}xFIiEUSJL_6_ob-M1
zSr6IJmtgt9t^ip@PgE(Yk6(^^XS}*Wc9h+?e?OaJX}KvyfTR)Lw4$K&=k}R>oWo`+
zL*3yYUAnSxoDMK(h8Iv=#90df1?1i<fC|<*UzX!G0?6fghfwQ@ysda)Cx8E(rZu3P
zm(axD_1Lpzx$|n(@4eIS>mk|%0EM6f_@fVr(9q@KVxH4jWU-s%9S|M~uvv2}THJ}?
zEJJM*%-0@FKTN+TM@F`p&yw^z^I(Q`C8%?`4wNgumaVMI%wt#!|B3&1?QQBEPuZ!S
zl3Do728#G~FCa=ML^`!@gqx-V-6aVL2_~-n_+@#%c1w9(okwl^bG0Vo*5f%qaWuPO
ztIOTxAyDBvf8234u9VGh6nL}q13f7ESu#|{qS=&JvK*0sR3s5aDk59jzVFn_@S@A^
z54Lhq)@$a4yly&AEwNT*Uox04c4r<zAfjn+v`x6`JPzn2bfx*-=4n6i2&n36m=wN$
z3orKP^IZpsuYl<S^lIP#^yAQ{8=e+o2mC#B4!XO)IYYtn*9UeS3v@H~07Hvf{l?>7
zBZ%WnBW*1FfJr#j#iAwd<sR2MVZHock(&@Bon+W7X<TuxYg2m|o%v|%Nxz8s$%1)8
zTx@KP|LHJTqHKox+eE;TJ3czzRHk*_&9F+~DZH|_YX@u~cDFczMf77eJ%McUhw5{F
z=?O~Z<suwW&v3TF+zyj1w%$;VQKcd$3dm<x>{a*+O-#(2Jjc-9O-j@COJu2**fBi(
z){H_v&f&1q=6SN&50sy`TGqMmjwdB0xsMA*G?@S$Hd2k|gYi*u&UnCtVk~yMN5H~M
z&}rY_(|9ux&k9QpFLN~YeElKSEVP81Ut-3)mzXc<H&-wlWXso@%siOdfV#D{wcPAz
z0Mu8Hq_GA8{YB5cDd#gP;=qDEuQ6b0HP#J4!S&SC)DNt!eCR&fPwPA%D`;pQ7f{LY
zvD&RX8kLaymG=9}5~^wg31}a~Ly?TolpI>rJ40X1BU@eB=^+)*G%tDVn-+Yn>-mk~
zDeE)uII)wTZvfD6+~Tz2yJTDDxKOuo0nn*Gzp??)pt9yVNDhF87BHLMM=8InBXVNm
zqyRwd*QI&xU$H<DHT$pH<M`gl8=Y+a>mp5=#?;8bhlfqci`vzKz6l;aY47(*7k(HH
zy)e><0|oaX6|ljK+IAtZ&qG{m>>}*ZdmbO|2sw@YchYofj62)r-GI9Eu4n7o2Pntm
zRd>+-T(xMkeN$?h8fmuKnz4U8PKK1n(%HGmr|9jMWiRJK{ilQ71m*ZrNd3E`Oa3Sc
z;*gJ|F(qP!%n6+|bQZ(pfH%`|ka8=3^Yl?w9!_et3Q2D{^L_`ax0(8u|9D<j<@$Jk
z^M1u+1`ewP_O1XwgEQ)cJ}|E#?)&}2oXS~s&G2m~Rl_j2VRoTPIApd~WZ_9__Q<P3
zn%u7X6*(3ffwkPD`P;PWq+5FLrg#=kXKsPCTX}t3&XX%t0EvF2S%O-EjvZSn@8uzJ
zJS5jOQ+<i6e&%s@GOC48TZ8)%^%YUi=IDMV4W$?d0=vvcMoe!F`$pq09|HGHb5kK-
zZ<)D7?G=S(Y&bo$v3`!^osj3vh{gN^h(Hj~Y2XWVU~Cu8cOH34odZ_$W@>0?D2B6(
z$<f$%kDf;8Plh>zz}PULMTs;XQd-5h7e+_tPZI{pvy||z3Gk)Bxg6zFY_n*jz4qgq
z^ot69_zL_pe@if{9&91i1XeCK#Kt=G{Ml0P-M7|d#0Bg!HCgf|I~Zgl=<)1S^|*Zz
zfMgytLVzvh`yC11kULC>-Lc{3dQ8i|q1>Z;Q8J}&2KyL#Wg2p5XU1aC50%k5zLI;f
zF)J4pL{Sf7xAXQhj8xd0EFd6d{*ITE{grNHY0O%ENBdyW#Z&?l(6P@Kt@9tAX<2Eu
zlkY{PNiId(Ve@jN&E9m0losPg;(u!a8ZCyCpDE_!-SKgNOI_b9Y>^LA=!6_(BFPUk
z02*TI3z_;r$UjQuc!&aL^V`qE)But%)(4%=41-@j-c?ARL}6V<|89P?b%R32w#C>)
zS0KUSpBQg&;``%m&Acu*r$L+mLUylg0mN;e%SCHWK-34?a^81>om%{s9a|ii8uzLi
z#-AJCB5hz0Eh!J6N$~!DSG-o}xgiSpmTi-MXHml|)iBE<Fh@>fK;!HSyFUu}#_dlL
zXcZ>0BV(1Y-&i8pQM)#7s(Iv1UdpF`@<mv3x!|Y6D#mDZyx-irCm||hLL#?+i-f(8
zs#ZDvFXa8z`CmZK!sY;}vtfhPFMu3^IZe7udqV)+DSEvg`mD;&)ffreciE&Cpa#cs
zcyLEHBxoP+7cY){C)D*RH!de;ArHYE+@{h<oU?fIf&5nByx~Hx9OmGoxhmYq0n*#_
za$sp}GC4`RB1HcIw6<O3Ki%Y81Ekp-c=)n&_d_IY{Pk>^*aZO71RgG@vYoqb?f@k2
zvzyxjbZ~g?&xxK6(LQ%@Jkt!XcG0g%*yO5VUu2YRak={p#HvJviI-h=of6FtetV6K
zNWJUL+q8|N_}ul@^zWS+1HM}sO$F%4wCc2p{&m1F!tbjK4?~%?=+zVa<=v{E|5yJ%
zC$G`1|I{CiFBz%$gLP($f;zJ9v+jEbf6&~~n>6}8xnf3novuvtS}QHtJG(e$ay+7X
z%2mQ&i6<XYEZ<a_f|h6xmlAUZ6-uF<Bp%u>)T)F)l}Il{-9eV@yD*bHleE-WQlbsG
z-hAK)cf@dSvRI=`iG+3KRq)W%QM1hO%-5(AW)zrT@OVv3Z0;LkY;1%1Gz}OEAptT_
zZ0~Z-JY-DQ3@1?HkF1u!IxV5*8C`X4R6~<;G5cy9m&zm?0U@(sQNoX(8<)9A>=Q40
ztU))_CHhyVDF637=!?<Uvz(7`#=D-6J4&kojoi6UkzwLCzQQS;N0HVv8TnaJwO34-
zs?@ihJc@%F>H`NhCIN|$`J#8H-#!`X^6?pz+cc-VvitNjDyw`d&WFL&*N3Bc^~xz)
zqZ8<Xg?WKPH(xiw^SVsE3%Bi&EqY{B^K#9uF6D%gY=g5J`*lEX;r+u-Xrn~{6+v$|
z`s*DBMq}zrR%IO(-W;2th5s??Bu#JoG{78itHtSgJP~dmQ~NP(OUPCe;hSp6{>O_=
zGjw}fVdghl4I?tz<j5$OlJr0c1QGIfU*s2er_Q?j9XdAc4UbReikb1#N2e07b$SUJ
zH2#pAjlM<>qfX1X*{7be|5M$0M>X~I>mE^10V$$%P>>=JkX}VvfKa3d5<q&9fYMQV
z6X~7Mn{+}i0qLNCbOb^NMT$TuN>x$t48QliXWg^TS$Ca(?_Zlml9kzec4p6fpXd2Z
z3$pBPlZ3rIe95(U`xoxWR8+t!XyU0?Df}e4m-i}Flg6;kb`i=(w6buZ3!yaHGQj?g
z0YfBpOZ{qCOHQ2>>a6;N%}1J}eC3=Nrc6qc1wn}Ka?*qK&UhecnNF`NdGc2Y*E>Y|
zR`J9;CluGe>N!!@HH|VuYnGkARB$a+l+I+r<HKJhFi+71CI(JCEej`QHfT<4vc?q5
zk>&4=oZ)RyTXz%N{z!*vgtR;=`91`*8-CGQds-6eepM0o!ed}5!sx^?Dl8@>R2zE_
zcopTSXrdj1N`>y}Hjc$c)-lz!KGK-|Wm1|lG%-G>gQcY|K-J=S<{n?~dAlT-zc%!o
zTtqWuOqAu++E2|eu>n`axvN2S4AjO&yBv7JhS^5KW4eEk3yi4P8j?4|h;`OE4g?bJ
zrD@ye{**TWDISk_wbMv#kE^md97qT`7jLXlY>(sDAH!%odT^q|2nzn8A3R~hT8;Xn
z<f;-To6&@~E>l|U$4e^NzS^;!QxlOd>L*73IAP*0dtKsMpDSfU8#B+9K}7Kf`W;bT
z@+WvRL7S(at&@B_6IS>!qYlFS6PI^W?iz|)w=%Stkzq*H8$TtZN2I=JyufL$8yIF2
z2xJVl_=wlH>83EZt_Meu;fEe!Un>WXS!W~_HRFsKPS)zom4ZT~@C~I)yNP*jCo9V{
zuRLEc4o%qQUP(Fg*C`i^e`0N5WxktD^KIzFc}FUlmS??6+}WZG%wl5BhY^{iQ}b4h
z#hB+C%<9TUg*Gy(u8y&;w{DsYoqzi_!H`{=xcc#a{FT;H!p-I8y;yqn@eqzY=|&?_
zG0L#4n#iY9QHdjw*k;ujzfv^82Af@~p7SkpnoC+SG!dEy<%Oe9L`da@>tsn2bhFnn
zB-MkDpY0mk>iXcd>arInLm<oxqg>%cK5>D7LZWCc@4<WbSD>KZse;-`f7C53KZ}<s
zX6B#`!8P7;i@v$<!9nB8<XiU%v|oj?wtk7B4X;}n+qc?1n<U#SG-`HB4H--?_A<a-
zZ{D~<twY6JOtK@-W9wmR5TVOr8LF~PblF(0IcGxA+Z2;B$Z1?2zci;)u6|M-IGsV<
z6)$jpprgl32yz0DEA&+~w8iaNdvhi!Qtk+C8)@vUk}^+fRsZm}b}s1aq2Tu=a<?6A
zW`iX-w8Ki-bX9HSKZG=-ifRm%06Rd+HIud0tySo=vFkt{WxFCGA+FB!xNq235@sZH
z&>O@dH(A>MRXxSnjoW8){iAAr7mM#`f&VmXEg_PeG||$ijMK%ao((-L6Y1JF$qQ{K
z#*L)6NI;<?Y7Qmc8^S>Ypa{p_Q^ayzm$h{kQENnm9%gcVEIk;lELJHs5kypQGbCei
z;R(J0v{X+nNW-YMpiXTVHni~uLTa?GHc-c2MWd{Vw<$1%d8kvl-rc@0un-hxL!xMX
zuX_GPkK)yYj@`XCM|k#X7RZPp^W(FhC-w?WAd2D1^d|rT^5$djn7o-dD_QDkv0W!@
zJE837jW1`Ra0O;@h1@WG<XEiGh{`;*l%pQH<NH{vsL1h{)Y;5*hv5V1D+2n_oxW@A
zfA!u60s{$^jX}_QS;G>K)1c+8d%~Yt54lCz4z0ZM{JqteFuPX;Z_((p=NVZ!a!NBX
z3`yzFm7?rg;(w)f{~kv1y)Dqz8^evg-4TLG8;MjLxR7{N-bB<u!O#)mX*lqd%yDMN
zdNyxR!z*E+2i7&MnaeHf@fM?$-5-yrnFxry!X88X$B}WMH<rA9lzE}M^i?VkOe}t_
z#_?h7S2qdWcCp!T*Fk0-fu}EyJ@U>SUSEHj2UZ@WuLt?-ob`D{O9zxZ*o2dZU1$_b
z6iZzv>t5)j66t;2Ueepy&-Hqs&0%YA&Wx^cPjfG~^)g^gzEVa~jJoF8k(Ry&<L>5A
zk+Mrk$nss-bEVi?u@(>LK4TJK1dAy~h-klKzLAkX@!VtKbUMS!x=#~-{|RM$bKIL5
zeMl~ttK=U|$A-ypwf@>95Yzj!A~;!l>LU*l<FHwZLJOq_t;u4grRz1+j4F`W(sI6q
zY<2ScpdP%EP`m@;8<`N?E6V}sO=Ay(p+s_<jFc-~#mcx;MZNm-Unf5`HrhfQUo3xq
zj*pFSlGQ28xB5(Ar4D6yR%)Rxt7|1lfj5<RjcB98iMrDuUqAb0!B88C+;h@@&FQk=
zZ&Rx+>F(*@RcQWay@2yqE(0-33OA#NFwEG8P6mBfcTQq)D;lvMhSPObaZ-ARkT*ir
zuFI}1f7Hr2<I~w@(v1@e<=Rl153YydJQ`;W)kHY?`3AMj5Xp{Zs$MN;q(VN;QZqc)
z=QU}04#EhA`9V*UHSWh<djtxTs8r^$*Ape~{ieonp$M31)W##UKZa}%CWjVHUrsU-
zV2;|)N=8PDmKQ|N1`{UqKDexY)~{N7y>1IJm}W1p8hLPfeXpr-P=9=f;!+yOV9{LX
zy`iKlmm!r-UG9T+mgbYeBK_+3`&-hFs_RJa-E?(Y9_WaUnbk$qh17-?R27ojYQs}o
zc472_<+U*5i6hFxT)dJblKa`*^c&01?y7U}1oHV>r?0<e;sPoa2x%yil}RrTJ-vxl
zQ|zE$h)|!_38_`KYl-wqVzL_d%~*H1P73ePA3~$Lj{@*oALeu*mp!hrb#S5zL`8&a
z-UdZHv8_lHWDMmaJ#-3XZ>^_k{!+uwQa*m_CgFU|tVQNaSL*Z2NwIg|OPZv8ois}3
zesA7mtMt^SJlx1q(vahF%Gp_s&7Vi_YkjjrhrdC#gqu?ula{%}{8YKv4W?EUB;|7x
z=ZwwDRT)V4l9+g~d8Xz(^H1>Z4-NmRWV83Es!zn_it}Ohd3kv4i&dsfQKx%HsaKHZ
z*(pL<MN<&&_rW@I!Cu<%Y$+A)X13}n(PTk&o!%9@SB1~HagPH%x=Tr)%jak}Z>t$I
zDQ)h|63-1^swV~7h4!|S>EqB2WTOI_Mb|BUzEsLChKEDF)>7w*R6N;h8|Sh}{aoa`
z!`0e(W+ewA4Y4P`7@5Urzj7TH?@8j2rKb;=XI8B2%ZTlF_0x_j*j%38EE=~2&r~&q
zCABB>Iv(f_c+?ZJ5pp>3Xm|>xV^oO+e9z*Yf~dm}S;sOKHXTL{vvLw;1y7Bzc-1yS
z<A9S+tro{)3<vtMAg2{{qA}Mq;ZjMA{dZTdIi{kfpPX9E3fN1WEPsC-=p_Box&b05
z0;N9Ax3~HhQ%TF*4EU{fsm{2>zv(hbNGYPikCY4!2jZ<UHYCxfGlM$n&_THraWOwp
z9(B^wc*0R5nNBAXZu+7C5BWb|U=@7FV;M30eD$=f^fRp50NSI(_B(Yf79*+Y$$HPC
zNR#dTz{y}`GG{aaP983X4G+VXG8a)_S2pKK9eM*t6`nt=>VW-CorqT&4OctJH<{W&
z8COrC-$4BaA8X-N*7-z#;^aK7qu!f{Qm6itme5C-Y}RBeg^empV{5HVD%;)*`HQJb
zvGm(8pvemD=;P2M$S#^pTbq1#`@RYq9aYQzsx(o*=63C|s71!I0)ZwZ9OaSfmK;`L
zuJ3aFVxrWoounW}3PUFCTJEQ4)M0`x{1Ja}xfzuvkgKjZitDC2p-<RZjzdKXm^KEq
z*L7%aA6E15sdf!_dM7}8l3Ko)SK+ebTbL6@C%L6JX1K({sDf03JSLwfUW}RDzF*uM
z$dwvr6ThcvNxs5AuAEnuO;pfl&_hC>>7dP8a;9_<xGK%*I4Im4%y7>9gbpt!QS1ML
zKffCsucsZSoF7A(saEyq8(}>&2+>nnvo&IL{qc6qpAt$ifk_#1Hqxpr>=<lfA5fI!
zCubnUH0WDiiS4kDbkc(<YzlbSvwLm*Vl<=NRjrM4H-hG?`0FmKW(_yD5H5EHUo;U#
zLwbU_8__L9%A-`aiy*h@$s>_3{<KC3HJ$b}Uq?<G+T25v(H#!3vI`^i;tT4V66cG?
zZqazyXqg?)HyhzbBBfHYlCk@2KZ29}&dP6H2ok!ilTgnlQ;(yj-5ZH8f#3SJx+n13
zGV*kp0vcOIepbQp)k(f>-VNP$Tg}2`eP#?)o!HI#jpm09TS=<zwksTYEv(uRk8kKM
zIrrC2++|KDz38ii8qaQ|&=BXflKZJ3CiG4)Wmm|mxNmBcy;NZ;19EuU=ePo4QEhPy
z7J6w`succVA_EnVH-QPX_hKh9sRMZ~Rc^l$NlBEiqbj=dAz=ElK=;qi_Lm6aG+(HQ
zSqLg^e#uaHg!r*urW&1Y8LTdO4mpvj6wh<1|J3;5FU$#YK%IC$-hk8N=WxEVou?})
zn^urkt!pu!a4@2#3)V_(J&ZDQkoSH>@hYYo!3zZcM9K$03+?lt7xmBh(x|AN>zS#<
z7Vm1Z87Q$2t=5f?9q>GZAsR{!Ufr%_XMuB+3zka3V@vtT?T@JEKDbAhJkhtwB3^YA
zwT5BbJm`yTP>Ky8VUII_T%fyH%|jy6uF=|3>#ZX_HOwSheMI@{_EO{$CN0<|TzY>h
zPod7qyAo<N-WcrHe6LuCx7N?z*D%CG3f)xd>(K1G(J)2_iZ22-B=BnENsZQiWj6eU
z`QiB(vw+Wq0P2Bdo-5N+s$nm(<;C`)J$S8#TumF>BTIzzl0;Woxapa1=SOOaf!q4F
zh348^uTDwzfnf6yw~BrfgODS9MhIcO)%9k>{D&uPr;5b&uB-T<GC4lW0(M0kpI+{1
zJ83W6ij!zad67WwAKXgLE$75tI_~02da^2*D7iw2<A>5aYWbE`xGfbLz1Y$mhvpho
zR92nRES?e<P={#sjztVVI<tE)-jaO%BK$fOl2OTyP&OATLN!=3(U;Y`3=1KDa|oqG
zsjBy&d2P2;6oS|Olp$T!$TOr0&)4=o3U8NpV1paPsPR$DEF8S>IVjzq_6)@!yt}o^
zG+Qd|eF|_Ze<{hVh-KyTn_*r$ST39~O4Kh_8ero20Sg-*4#O~{f2`Ff59yV2RK^hQ
zVb%Y-{!V;iES80jd7RX9n=Q2$zwik0>iZ8VYZD)Gi*hx=8#nKRJWKGKz2JLAtjgD8
zYah^`vHF&M8Ol!np2iCoEENjB@*pvDu_%V2O~hG0&-yXF0F@aH4Y~yyD`$Pl*qGy&
z0lW$?GO6sPxel#(Q%{Q?D@NZyI7bGKQ4vmFPGEoTQMkr$SlMxF8Ad}F(o2~lvyGn6
zFmP10Nk?V4_f(jVsC8kUVBlh+lC<hJm^PSL`anPOrI5deGKvnPH7EYedS80dQO*{f
zn?4-6^c=`2-<ICGtlk4aFW|ktU`GKNrTcistn=l*W%&^B%?AaXZv+@nRGPMXpPe4J
z&-k3|NCIzs--i$BBNs(Fz{3$|@oTvRy|#98PF@I0%wg=8PxqSBk<8b>4yi1spPavf
zAQB(6aZ~A*nD5sK(j?>A7Lc*~Mb=lgr@z)H$2@-E$cKHf1j(;E#dzy42@KrM40`*&
z&{j~XKiW2AfEdH$@TdCkX*Dq4dH_BNeCT9%0kFBM->#6@W_3IhICTd#*_VZ=Vgt5#
zZVf){fDVM~HX>!X81|WORY{e2qHq6hSiB2new@Vg@d|{_BZ4WVt}jtIQ7;_&T+*76
zv@T-M6&4(EPdj4n&Wk?RoE}9AnFjx}Q(*x6>iE5vDeh!iy`P}M(!7?a{^;lpMf=&V
zQ?6`4#|{>_fYH2$b$zw9weKlp{{VY`g;C@4B{it{qVs$1k}RQ~@e)S4S48j2a%|k7
z0&xhV9+LMi`3w@0PmUFXH?p3>Md`^Tu<mPyl+3%ev}g~hX0r)xuF<q%9Yf5fKG%9y
zwYvr1n+g&Y5RltP=-u=AkvHo8HE(i@a(v^_kLJj*@Xh~;{N?Ze8!)oYfc@O((_xNy
z$9@ca)hbR#Oi0M}V1P^O<L2L{jZK&%^$ien?yn2gGZ>`FUb~M$9n~l1x@B|MY$5Uo
z8FV-eL~ZF`x2WlI*1gQqnI)w`NvVjf<NCfRg`K1sJB0Q0r#&7_eK)OY$kqE=J!Vc*
zlf|RZw{o_a*K==C5_}infYqEt@wbGB1K1qZ(ILg(?-amk?Nr@)e%jyy6p1L>2NxD<
zF7Kl<V6A%y70JDKW7R%C1x2Q7loEYLw*4_qv7rM-@@{ZuCmy?#lC?|s+2gLE;(=wM
z%*0coo$8tbe3sjjN=55x+uDM-^uEwm&s_#)W|^Iu_Xr=Yd>LT*r{cQEgq$94r-B+U
zC~ae0e0_a^PDDxrxd=7I0T7*x&q)^W-*12<%?;3Vi!L8-xEyf<wUr%uzb1I_QVdd?
zui%%G7+2G&V+m)g1Xkjb^+=tsM$p4dw3=fu#*-|u#m3RAMpJLTNGNH6+)j7+4OT6-
zE2hcr!RqBpW6@^0v#l?__4kK6%AU+xMLhl7;YY=F!QrcV(kkXS8!z_1laRcVC6mWX
zn83*Paqr=bby8+=%}ZCOnm1KNq-C)ptj1!3j6$2A<Jc|x7L7O_seBOVaKWTn*WV3M
z({X7upKNHUQHPzl`VPh>9y9I?v(Xy2N{0Xj<diPI5>`j4Y2oZ5O7&H|v-uPXrTG2h
zn;D1@p$$!&K{~{AsCgsj0z~$s(#dc8qUKy_+;lSgylcGV^1ns<=LX;R(MduRT{ax>
zmt{HwrX5f9w!*GV))b)7T7AWdSw!VMDuvKQbUnOat+C>vZdpruty($cE6$>kEKj$?
zi8A>B$)6<|>FoRvl+yv1N~`00=z|)PjeMmj|I^7_q19i98=pZ|q1>?g6ByNIXJ-Qy
zU+f2Yo7W{g=H*$l&H6<qHO6Ve&AWcznmPv$W#I_%uaM9yO)enb3A<%62&p(`jZstm
z?yh}ctCi%Pd_&E0`>s7Yh)?t|#nW936=L#TSdGfFb@0lR^6gv@EHgdKm@xs0u>5a8
zLyQk^bet0c9RN-^^o@&r85@OJ`HfPdf&QmAW12r28co3Gc^P$46)8;2^cd8=a_@mG
z2`L1JhuKMy?Q~CNyTZJ>m{9|!BSnXZ^yaXl^@k+SJAW8*OroQs+dxjG?gIA5mTwg+
z+4l`Zsp38Z7-PVpc!1l{xL>aI%ky6w-@s@D<kF21Cx7AXgO-{0*zg>1-*&6ya)QNW
zM876-q!Ck&`&4a#35AH(Tw`!%Ex1vR;Vfby9p*ApCzKl3{Y!`;iF4%3d~KJFlq4ZF
zex?<Ni9zmX+hpiNl|5x0wLP2?`gYVeTA<Qr&i{!d%ku000@Ndp{3K1Ofp6z80)D(u
zVRGpK=`NjVf1Hj=r4bf?@6NA&zNW=@<T9Y~P<N15q<C~H0)o=|5)&T>3N=}WRDCgi
z49b<W?DfiTKeE!vlKvhLG?k5ZYvXubcTYDqt76i6KyBzvy`bf&-{W-R2e<1ZcZ%hY
z?Vq(x^ra63L;s5~<zD@t!j${z-lz88LuTg(W`BCkvR<x4?0f_PERfH$3s`0R{C2B2
z(-Z*2O2VGE?uxM)wYYBu7EtTF_?*zuy#^$7F<hPTQriRSJNF1|A&je5Q$nO_F}RAz
z$DB5zwL(3HS}8PqLgtYwF^?0~j-?nqt$_%orU@VE=d96>()*iH^Abn*XL+*On0L7~
z;}ZgCdY$Lnou+Ohq8H>oOm(0apa+6r%OnbGP-!&f&<v6rxuDyC2rjYvJM@9C#kWuG
zGf!S*<Gn^QM1j))s9{4Fz`v7@z=r=8e)+jM2?l@_ouVAut-R?+QX{Jgg(gv?1GC@s
z@(4AE%lhLh#<yRqd7j5?>JRm?_4fy>@86PD!9yqbg<f8T_@ikZYJGZK`*_}gRM_In
z)fk|rAwjI<V10-dfcSux1vr=AFZ3o5G%2q>^*tI_d9k;c?zvcRH&)s7$@@zvEx%C%
z?6}Q+YXUryk24&qkZ+y8fCnMS$@~WFIwyeC1Bf}ZUxS9;*pJH>?N#Xd8iy}M>jlHR
zaat*)A)j!|l^PrR8`huf=A&*<X{92AqraC6=W}H0a}9s8e86k;7g7VSbI;_k<49BU
zjE090>xI*4SS|V<j(`O0QjNuXpsrv196$&sC*b_o3?PexGsrdtH$m#(jezqozY>NE
z1q};Ed_ac;(a_I+TScj#4pM+$OD~s!kx}}fUy)<Pwm^#)_^_|4Pw$&(8<G;cRlOR#
zA59DytYweQHPsu{9AR2Y&yFIKpi^XsSm#=SdVeo~kI`Nqv<Qck!T;(TuXR9~1%<eI
zF}SJd^^0qIfi)A{l=+gl^8U{G_b|W-t=JGAdkBIvf4&A57+*NFF<+h%&Q+aYDIs-J
z>k3>u;fm;mx)7tHp<9pSb+dgO;SW;srabMybd&>c7QgI{@M$whC(q__a!n1tu{JDT
z#}{srBAiYd1Xx`(5suBOSPLTFbmdACQvu=ALC%$!cM*{C{47s&%pXGALhtk?af!=B
zFIdi@b(d5;VaO+YcRLI!qVOswMd#|`{i$-7K<z%vJV$Lydjyw4V&PPOy?0Pr*Gqzd
zLwDKoN*?AtsPgWP23sqM8RLmB7Zq6lpdOJBQqP4Kj1A&-rY(umO$qSIe69CX&8}8!
z<q=$%DV93_7==P_BFns~))XfCA9$qQjvaoJYrH<*2PtJMT6npJLB85T=KpBsk*M;9
z#eUL|E#gf&wa#SmkX_4y*cHSpXPRoJBw2Pi-1@gcB440Lkh{QVSn%qQ=$xOoK%4nG
zPk#J_{3;J?`S*$f0~OU2<f(>MjM|zbbrN4Gc@te)rJS;+TBV;cyMKTzJ6}-5RR9;@
zybYo+V!Px6g!nOX`4v@}(&oOoRm0uxAXMlrS__O?ye|6KQs>t_wF&rc_U%I}bC$HE
zpQ=ZaLhtgpX_eWU)QSxra1pBuQn<n|*E0Zb_}wI|n{>(E(%teXQFmcRhfR^!I8Nhb
zY+7c+vr7)i=~AWY!F^P7yK(EumnskWWe`DB`}KFW__uG+*q80h5{!7d3WEYf;3crC
zr$9ANl;kd-%r%uI);ZBs;|6Y8;)5g$tz$JReljgDDxzN8W^jHv^C0MSl1w*L$^fr6
z|1)t$s>iYLZ$+UVX|r|isnKqNUd8iOh}A!lc^*Ve)&8A;43|1ce+zVRaBl*_&o;n!
zTbXbOFPy%3kK?1!ptSLNxiPW(D{O$KpY@|JF$4tHF&BFTgh*gK;%N)Vjvm3qse`-N
z^M4Og{iA76hQHG)mZurUry1Q7TD==AO(2SE$$w?($Ql}@I1x+W8oY1idCSgo5J?l)
zkaXf6_izwrXYf&7c8fCE7@kK5FlMJ(o5y$c;FXIr(WFH!sQ7+s`KkO%C4z~Hyc-GW
zy3siUuszK+1O1q65xu{$n&=9q3WSvRIPzq<=%1QGcf7ccFIt=4_<+Nv?3%1nPl{;i
z>Y$30!^EaD;#j1y4co|&66=yx6NKTn|4clgvJ{2zohG9)LX+O4$5DMmQxkw2i?s7y
zabyingJ|f%zP^nT9er{$iqnQJq1@i^SscY0?M+_BTs(x!RjWXgJ%2PCQxOXLu~X>l
z1R+*;Kb^E*)%|<k6-k+<y>k(l#4KBr7!(vRaT{r(Tv+WjCi8x#^Xc1eCmARlZ9B0W
z3>a3G6)|aME7f}qxRq2nPs0tgl|dv($HS;?sZ140NmYSu<o?(1@u!)OfsBNrw(NUJ
z)rWMmfhKhN*EMhRS8;~8Z?ivDA*d~IIaXYOz}oLKI?(@Ax#zeWy%O(|Qj+c#kV(i7
z0qfs)lpB{nNU*gb4$wmPWz;+gkE6_a7-k0bZ@MlH7MwfRUBP#0?O_OqFn3f-A&nI|
z4z`ptN8DMDRrz}C6T3n~L4M{YYQNjL)zE!&2%DG1;4Kw}oBYEMnG!MxPn83+tZz51
z>9Dbb%U4Cdt3*3$&k7OuT7G}pMoGw@1#$oJw_86<?g|@()Wd$b`s!)fXV*Pm)=u`c
z7_|(frnNa$&vw;TMvr>lM4!==`@SCq5*l2_DO!;oc_+dRXSguRQbj{v@zCEd{}z+j
z)FpzX@RqGWOQnZWX@zVP?3>Q_b>MyEzQu7}w2Ch8QXZAVZHV#yy^%b0z8~S%5WB4`
zMS1&$u4ZgBfiop2=zN@JnJEAGlScETL%;IiiT1!RZc*k2?@Z<vgO^AOkLFG`S-6=2
z3lo|tLM_IbGSl&4$fV~(;(#(n$LE1UK!diZX;7~;mQGNNT`<4SPnv#K?rEFC&_it^
z7JZF$n&G|=&HW!eR=%74k|Q}Cwy(PR2?FT3UpQgs#LB0`|8Z}^YTPN?_Vwfq@US6f
zD%TO)+H1iB<r$7*Z56qWLLRP7osb)B2_EVWTFX!g_n%zi3JW1lqgj?%?`sOq2m2%!
zXcWrC+idYy;yJUAv_rDktgi87=GowrsFatwFrM5MmFBp`Y#|!nNTJnhaf9tdQ4iI>
z$k(^{<IKTB1UlX|99ijtB}jWhKt-sy!q``FE012K1A4^PyV;Gu-KqFhKe61VOr31H
zgH^q18WDSHQFY%L6>J*<^Bg#O&(OZN6-WtTxxnbzQ4LLCE=`!P88zRSfb$K#oQ^_>
z(M)&eo7KD(zg8w*!<1i6;?YaL5G)}^5D!-9`u#rYip{zDsV4PhsJAAwj)0qvQ6eJ`
zRx3)$i}=R3lA`F|+X8LK3rK(bROu2OOUv&PqN`t4sg?3;c?O?%g$%?N!S1BQ6sUxJ
z>6MWVA1jh?+-+zJkm*6z)HSVC^p<t-zV2VSVkpEYS6R+W$0AS;b_@wG9W7}MUi*?M
znSv!o(`79Xr(;(qRX?M;o7L7wI|rwhTdAjXN4?`mpecc?GjW%XrI^+tiAaDT`VdjZ
zt^mXODo;FR+W(HSY4|caKc^+KOpz<8yQG&YmXV#&-QN4dc%Oi+=&Sjw<#)PZ_$I?X
zpF+S6mAHQN3R2~w-~W93C}Vs<+jc3f2A+$_+fNsLn>Jy=4kLARS>dXkJ|%NK!)09C
zbe^dB3r{-JQY>HS<y&F<_-5R5qj|GRwv^(&ZwQKnnb=QxxLBZn@QqWt?RR@0RIpo_
zgJjROh|)=hB5dozZZy3B9l2SJU7`xp-??zdD<D5g9^>!p{zG3yaBdU$(YA|!-+pv-
z*RH1`EH)y|qv>sD+Q9$WW@Yl#HJ7-5?YJ_z@;(~uxgr;|xhLz3QM?=c&xR}{SO4pV
zEXypc;7tNbbh$K^jz(9&?kofZdPI~L|I`+ddj$@1<6xcxj^>eoD+7)M0_)(814pIH
z&}-mu>jsEPf@ATu)yWm{_&5Kr9bT3#=)pV9Q6GEX3xPknmNz|HL1Aj_V#Ya=`J#tP
zrR~cNr?-GT0<gMbFRN{H?3j#}p1;6Yfp-&RtX7}ntN)vi7kGauPQHEaw4W><deG?`
zZ#weu!#D%;qKb_B3kQpTcAT;0zp&y0>u>h|WW@!h!M{6pvYCM0TMs@w^G<|S0e^9Z
z!Zf^wRqXj;EZ*T*r`ejI@T&Hc`M&lHubhZ~u1O$$Gyns~0^coI%2k}@NAa`e1Hy{P
z-qi4+#+8c;ZBA?j3IiAL7YgZUu0vD7Ltx0YUo21GNWXS*k-NzHKDGM*&bsyQ+7B%1
zP+&`T_`hBqRxU5{Wzc$7u>d|n4~os8QUC51Va6xBdd?`TCD7tAiGQ7?06>(O`tB>u
zoda7Q)wtjXrpdR4!ehcz7rXC(#!_oN+y`ra#yfZHcK_3o7~>;)_>lUa9eL8a5n%ZM
z?5E#4|N2j#cU`8S9Df%|%J>8I)l1ouM|Ok)d_UQ10J-=LJt`J&--_VMDP;)wHDuNS
zy6q{}s1xi4;LUeYhV%z(TO9uO(L+G}26so=+}r&=#)zk*S&|oQ7uo#?tv~yB{<?f4
z{sh)0yqS8MlA+wWu<Gy;2tkKCBe-yVs~4v3*Ebl!O8ubo@9$1vF_r<;fQv3zA4)YO
z2GvA7VALbujh&Fp54-<!1p@PdRROf||I;0Y`u<*hp)V6p8BA{vPJ%#HNfTP7U>^J*
D6r&Lu

literal 0
HcmV?d00001

diff --git a/demo/documented/subdomains/python/demo_subdomains.py b/demo/documented/subdomains/python/demo_subdomains.py
new file mode 100644
index 0000000..8b3c2f8
--- /dev/null
+++ b/demo/documented/subdomains/python/demo_subdomains.py
@@ -0,0 +1,96 @@
+"""This demo program demonstrates how to mark sub domains of a mesh
+and store the sub domain markers as a mesh function to a DOLFIN XML
+file.
+
+The sub domain markers produced by this demo program are the ones used
+for the Stokes demo programs.
+"""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+#
+# First added:  2007-11-15
+# Last changed: 2011-01-25
+# Begin demo
+
+from dolfin import *
+
+set_log_level(1)
+
+# Sub domain for no-slip (mark whole boundary, inflow and outflow will overwrite)
+class Noslip(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary
+
+# Sub domain for inflow (right)
+class Inflow(SubDomain):
+    def inside(self, x, on_boundary):
+        return x[0] > 1.0 - DOLFIN_EPS and on_boundary
+
+# Sub domain for outflow (left)
+class Outflow(SubDomain):
+    def inside(self, x, on_boundary):
+        return x[0] < DOLFIN_EPS and on_boundary
+
+# Read mesh
+mesh = Mesh("../dolfin_fine.xml.gz")
+
+# Create mesh functions over the cell facets
+sub_domains = MeshFunction("size_t", mesh, mesh.topology().dim() - 1)
+sub_domains_bool = MeshFunction("bool", mesh, mesh.topology().dim() - 1)
+sub_domains_double = MeshFunction("double", mesh, mesh.topology().dim() - 1)
+
+# Mark all facets as sub domain 3
+sub_domains.set_all(3)
+sub_domains_bool.set_all(False)
+sub_domains_double.set_all(0.3)
+
+# Mark no-slip facets as sub domain 0, 0.0
+noslip = Noslip()
+noslip.mark(sub_domains, 0)
+noslip.mark(sub_domains_double, 0.0)
+
+# Mark inflow as sub domain 1, 01
+inflow = Inflow()
+inflow.mark(sub_domains, 1)
+inflow.mark(sub_domains_double, 0.1)
+
+# Mark outflow as sub domain 2, 0.2, True
+outflow = Outflow()
+outflow.mark(sub_domains, 2)
+outflow.mark(sub_domains_double, 0.2)
+outflow.mark(sub_domains_bool, True)
+
+# Save sub domains to file
+file = File("subdomains.xml")
+file << sub_domains
+
+# FIXME: Not implemented
+#file_bool = File("subdomains_bool.xml")
+#file_bool << sub_domains_bool
+
+file_double = File("subdomains_double.xml")
+file_double << sub_domains_double
+
+# Save sub domains to VTK files
+file = File("subdomains.pvd")
+file << sub_domains
+
+file = File("subdomains_double.pvd")
+file << sub_domains_double
diff --git a/demo/documented/subdomains/python/documentation.rst b/demo/documented/subdomains/python/documentation.rst
new file mode 100644
index 0000000..5793d43
--- /dev/null
+++ b/demo/documented/subdomains/python/documentation.rst
@@ -0,0 +1,165 @@
+.. Documentation for subdomains demo from DOLFIN.
+
+.. _demo_pde_subdomains_python_documentation:
+
+Marking subdomains of a mesh
+============================
+
+This demo is implemented in a single Python file,
+:download:`demo_subdomains.py`.
+
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+    from dolfin import *
+
+It may be useful to get information about what is going on behind the
+scenes when the program is running. In DOLFIN, we can control which
+messages routed through the logging system will be printed. By
+calling the function :py:class:`set_log_level()
+<dolfin.cpp.common.set_log_level>` we specify the log level. An
+optional integer argument may be given to specify the level, the
+default level is 20. Only messages on a level higher than or equal to
+the current log level will be printed. To get as much information as
+possible we will set the log level to 1:
+
+.. code-block:: python
+
+	set_log_level(1)
+
+Before we can mark the boundaries, we must specify the boundary
+conditions.  We do this by defining three classes, one for each
+boundary condition. We start by defining the whole boundary as a
+noslip boundary, and then overwrite the parts of the boundary that is
+inflow and outflow.
+
+.. code-block:: python
+
+	# Sub domain for no-slip (mark whole boundary, inflow and outflow will overwrite)
+	class Noslip(SubDomain):
+	    def inside(self, x, on_boundary):
+	        return on_boundary
+
+	# Sub domain for inflow (right)
+	class Inflow(SubDomain):
+	    def inside(self, x, on_boundary):
+	        return x[0] > 1.0 - DOLFIN_EPS and on_boundary
+
+	# Sub domain for outflow (left)
+	class Outflow(SubDomain):
+	    def inside(self, x, on_boundary):
+	        return x[0] < DOLFIN_EPS and on_boundary
+
+Then, we import the mesh:
+
+.. code-block:: python
+
+	# Read mesh
+	mesh = Mesh("dolfin-2.xml.gz")
+
+We create a :py:class:`MeshFunction <dolfin.cpp.MeshFunction>` to
+store the numbering of the subdomains.  When creating a MeshFunction
+an argument specifying the type of the MeshFunction must be given.
+Allowed types are ‘int’, ‘size_t’, ‘double’ and ‘bool’. To illustrate
+the difference of these we will use both ‘size_t’, ‘double’ and
+‘bool’:
+
+.. code-block:: python
+
+	# Create mesh functions over the cell facets
+	sub_domains = MeshFunction("size_t", mesh, mesh.topology().dim() - 1)
+	sub_domains_bool = MeshFunction("bool", mesh, mesh.topology().dim() - 1)
+	sub_domains_double = MeshFunction("double", mesh, mesh.topology().dim() - 1)
+
+The second and third arguments are optional. The second argument
+specifies our mesh, while the third argument gives the topological
+dimension of the :py:class:`MeshFunction <dolfin.cpp.MeshFunction>`,
+which is the topological dimension of our mesh minus 1.
+
+We are now ready to mark the mesh. We will create four subdomains of
+the mesh; one subdomain for each boundary condition and a fourth
+subdomain for the interior. First, we mark all facets in the mesh as
+part of subdomain 3. Since we want to illustrate the possible types
+of mesh functions, this is done in three different ways. The first
+type, the :py:class:`MeshFunction <dolfin.cpp.MeshFunctionSizet>`,
+takes an integer argument and all facets will be given this index.
+The second type, the :py:class:`MeshFunction
+<dolfin.cpp.MeshFunctionBool>`, takes a boolean as argument and all
+facets will be marked by this boolean.  The third type , the
+:py:class:`MeshFunction <dolfin.cpp.MeshFunctionDouble>`, takes a
+floating point number as argument and this number will be the index of
+all the facets.
+
+.. code-block:: python
+
+	# Mark all facets as sub domain 3
+	sub_domains.set_all(3)
+	sub_domains_bool.set_all(False)
+	sub_domains_double.set_all(0.3)
+
+When all facets are marked, we mark only the boundary facets.  We give
+the noslip boundary the index 0.  To mark the facets of the noslip
+boundary, we first make an instance of the class ``Noslip``, and then
+mark these facets with the correct value (either an integer, boolean
+or double).
+
+.. code-block:: python
+
+	# Mark no-slip facets as sub domain 0, 0.0
+	noslip = Noslip()
+	noslip.mark(sub_domains, 0)
+	noslip.mark(sub_domains_double, 0.0)
+
+The same must be done for the inflow and outflow boundaries.  The
+inflow is marked as subdomain 1 and the outflow is marked as subdomain
+2:
+
+.. code-block:: python
+
+	# Mark inflow as sub domain 1, 01
+	inflow = Inflow()
+	inflow.mark(sub_domains, 1)
+	inflow.mark(sub_domains_double, 0.1)
+
+	# Mark outflow as sub domain 2, 0.2, True
+	outflow = Outflow()
+	outflow.mark(sub_domains, 2)
+	outflow.mark(sub_domains_double, 0.2)
+	outflow.mark(sub_domains_bool, True)
+
+Finally, to be able to use these subdomains together with the mesh in
+other programs, we save the subdomains to file, both as XML and VTK
+files:
+
+.. code-block:: python
+
+	# Save sub domains to file
+	file = File("subdomains.xml")
+	file << sub_domains
+
+	# FIXME: Not implemented
+	#file_bool = File("subdomains_bool.xml")
+	#file_bool << sub_domains_bool
+
+	file_double = File("subdomains_double.xml")
+	file_double << sub_domains_double
+
+	# Save sub domains to VTK files
+	file = File("subdomains.pvd")
+	file << sub_domains
+
+	file = File("subdomains_double.pvd")
+	file << sub_domains_double
+
+Complete code
+-------------
+
+.. literalinclude:: demo_subdomains.py
+   :start-after: # Begin demo
diff --git a/demo/documented/tensor-weighted-poisson/common.txt b/demo/documented/tensor-weighted-poisson/common.txt
new file mode 100644
index 0000000..7612685
--- /dev/null
+++ b/demo/documented/tensor-weighted-poisson/common.txt
@@ -0,0 +1,70 @@
+
+This demo illustrates how to
+
+* Import data from file
+* Use complex user-defined JIT-compiled expressions
+
+The solution :math:`u` will look like this
+
+.. image:: ../tensorweighted-poisson_u.png
+    :scale: 75 %
+
+Equation and problem definition
+-------------------------------
+
+The Poisson equation is the canonical elliptic partial differential
+equation. For a domain :math:`\Omega \subset \mathbb{R}^n` with
+boundary :math:`\partial \Omega = \Gamma_{D} \cup \Gamma_{N}`, the
+Poisson equation with variational conductivity :math:`C` and
+particular boundary conditions reads:
+
+.. math::
+
+	- \nabla \cdot (C \nabla u) &= f \quad {\rm in} \ \Omega, \\
+             u &= 0 \quad {\rm on} \ \Gamma_{D}, \\
+             \frac{\partial u}{\partial n} &= 0 \quad {\rm on} \ \Gamma_{N}. \\
+
+Here, :math:`f` is input data and :math:`n` denotes the outward
+directed boundary normal. The variational form of the Poisson equation
+reads: find :math:`u \in V` such that
+
+.. math::
+
+	a(u, v) = L(v) \quad \forall \ v \in V,
+
+where :math:`V` is a suitable function space and
+
+.. math::
+
+	a(u, v) &= \int_{\Omega} C \nabla u \cdot \nabla v \, {\rm d} x, \\
+	L(v)    &= \int_{\Omega} f v \, {\rm d} x.
+
+The expression :math:`a(u, v)` is the bilinear form and :math:`L(v)`
+is the linear form. It is assumed that all functions in :math:`V`
+satisfy the Dirichlet boundary conditions (:math:`u = 0 \ {\rm on}
+\Gamma_{D}`).
+
+In this demo, we shall consider the following definitions of the domain, the boundaries and the input function:
+
+* :math:`\Omega = [0,1] \times [0,1]` (a unit square)
+* :math:`\Gamma_{D} = \{(0, y) \cup (1, y) \subset \partial \Omega\}` (Dirichlet boundary)
+* :math:`\Gamma_{N} = \{(x, 0) \cup (x, 1) \subset \partial \Omega\}` (Neumann boundary)
+* :math:`f = 10\exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)` (source term).
+
+The conductivity  is a symmetric :math:`2 \times 2` matrix which varies throughout the domain. In the left part of the domain the conductivity is
+
+.. math::
+
+	C = \begin{bmatrix}
+			1 & 0.3 \\
+			0.3 & 2
+		\end{bmatrix}
+
+and in the right part it is
+
+.. math::
+
+	C = \begin{bmatrix}
+			3 & 0.5 \\
+			0.5 & 4
+		\end{bmatrix}.
diff --git a/demo/documented/tensor-weighted-poisson/cpp/README b/demo/documented/tensor-weighted-poisson/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/documented/tensor-weighted-poisson/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/documented/tensor-weighted-poisson/cpp/documentation.rst b/demo/documented/tensor-weighted-poisson/cpp/documentation.rst
new file mode 100644
index 0000000..afa10a5
--- /dev/null
+++ b/demo/documented/tensor-weighted-poisson/cpp/documentation.rst
@@ -0,0 +1,6 @@
+.. Documentation for the tensor weighted Poisson demo from DOLFIN.
+
+.. _demo_pde_tensor-weighted-poisson_python_documentation:
+
+There is as yet no documentation for the C++ version of this demo.
+Please consider contributing the missing documentation.
diff --git a/demo/documented/tensor-weighted-poisson/python/demo_tensorweighted-poisson.py b/demo/documented/tensor-weighted-poisson/python/demo_tensorweighted-poisson.py
new file mode 100644
index 0000000..f7e39cd
--- /dev/null
+++ b/demo/documented/tensor-weighted-poisson/python/demo_tensorweighted-poisson.py
@@ -0,0 +1,120 @@
+"""This demo program solves Poisson's equation
+
+    - div C grad u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+    f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+
+and boundary conditions given by
+
+    u(x, y) = 0  for x = 0 or x = 1
+du/dn(x, y) = 0  for y = 0 or y = 1
+
+The conductivity C is a symmetric 2 x 2 matrix which
+varies throughout the domain. In the left part of the
+domain, the conductivity is
+
+    C = ((1, 0.3), (0.3, 2))
+
+and in the right part it is
+
+    C = ((3, 0.5), (0.5, 4))
+
+The data files where these values are stored are generated
+by the program generate_data.py
+
+This demo is dedicated to BF and Marius... ;-)
+"""
+
+# Copyright (C) 2009-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-12-16
+# Last changed: 2011-06-28
+# Begin demo
+
+from dolfin import *
+
+# Read mesh from file and create function space
+mesh = Mesh("mesh.xml.gz")
+V = FunctionSpace(mesh, "Lagrange", 1)
+
+# Define Dirichlet boundary (x = 0 or x = 1)
+def boundary(x):
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, boundary)
+
+# Code for C++ evaluation of conductivity
+conductivity_code = """
+
+class Conductivity : public Expression
+{
+public:
+
+  // Create expression with 3 components
+  Conductivity() : Expression(3) {}
+
+  // Function for evaluating expression on each cell
+  void eval(Array<double>& values, const Array<double>& x, const ufc::cell& cell) const
+  {
+    const uint D = cell.topological_dimension;
+    const uint cell_index = cell.index;
+    values[0] = (*c00)[cell_index];
+    values[1] = (*c01)[cell_index];
+    values[2] = (*c11)[cell_index];
+  }
+
+  // The data stored in mesh functions
+  std::shared_ptr<MeshFunction<double> > c00;
+  std::shared_ptr<MeshFunction<double> > c01;
+  std::shared_ptr<MeshFunction<double> > c11;
+
+};
+"""
+
+# Define conductivity expression and matrix
+c00 = MeshFunction("double", mesh, "c00.xml.gz")
+c01 = MeshFunction("double", mesh, "c01.xml.gz")
+c11 = MeshFunction("double", mesh, "c11.xml.gz")
+
+c = Expression(cppcode=conductivity_code)
+c.c00 = c00
+c.c01 = c01
+c.c11 = c11
+C = as_matrix(((c[0], c[1]), (c[1], c[2])))
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+a = inner(C*grad(u), grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Save solution in VTK format
+file = File("poisson.pvd")
+file << u
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/documented/tensor-weighted-poisson/python/documentation.rst b/demo/documented/tensor-weighted-poisson/python/documentation.rst
new file mode 100644
index 0000000..80e0e59
--- /dev/null
+++ b/demo/documented/tensor-weighted-poisson/python/documentation.rst
@@ -0,0 +1,302 @@
+.. Documentation for the tensor weighted Poisson demo from DOLFIN.
+
+.. _demo_pde_tensor-weighted-poisson_python_documentation:
+
+Tensor-weighted Poisson
+=======================
+
+This demo is implemented in two files; one file,
+:download:`generate_data.py` , for generating data, and one file,
+:download:`demo_tensorweighted-poisson.py` , which contains both the
+vaiational form and the solver.
+
+.. include:: ../common.txt
+
+Implementation
+--------------
+
+Implementation of generate_data.py
+^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+	from dolfin import *
+
+Then, we define a mesh of the domain. We use the built-in mesh,
+provided by the class :py:class:`UnitSquareMesh
+<dolfin.cpp.mesh.UnitSquareMesh>`. In order to create a mesh
+consisting of :math:`32 \times 32` squares with each square divided
+into two triangles, we do as follows:
+
+.. code-block:: python
+
+	# Create mesh
+	mesh = UnitSquareMesh(32, 32)
+
+Now, we create mesh functions to store the values of the conductivity
+matrix as it varies over the domain.  Since the matrix is symmetric,
+we only create mesh functions for the upper triangular part of the
+matrix. In :py:class:`MeshFunction <dolfin.cpp.mesh.MeshFunction>`
+the first argument specifies the type of the mesh function, here we
+use "double".  Other types allowed are "int", "size_t" and "bool".
+The two following arguments are optional; the first gives the mesh the
+:py:class:`MeshFunction <dolfin.cpp.mesh.MeshFunction>` is defined on,
+and the second the topological dimension of the mesh function.
+
+.. code-block:: python
+
+	# Create mesh functions for c00, c01, c11
+	c00 = MeshFunction("double", mesh, 2)
+	c01 = MeshFunction("double", mesh, 2)
+	c11 = MeshFunction("double", mesh, 2)
+
+To set the values of the mesh functions, we go through all the cells
+in the mesh and check whether the midpoint value of the cell in the
+:math:`x`-direction is less than 0.5 or not (in practice this means
+that we are checking which half of the unit square the cell is
+in). Then we set the correct values of the mesh functions, depending
+on which half we are in.
+
+.. code-block:: python
+
+	# Iterate over mesh and set values
+	for cell in cells(mesh):
+	    if cell.midpoint().x() < 0.5:
+			c00[cell] = 1.0
+			c01[cell] = 0.3
+			c11[cell] = 2.0
+	    else:
+			c00[cell] = 3.0
+			c01[cell] = 0.5
+			c11[cell] = 4.0
+
+Create files to store data and save to file:
+
+.. code-block:: python
+
+	# Store to file
+	mesh_file = File("mesh.xml.gz")
+	c00_file = File("c00.xml.gz")
+	c01_file = File("c01.xml.gz")
+	c11_file = File("c11.xml.gz")
+
+	mesh_file << mesh
+	c00_file << c00
+	c01_file << c01
+	c11_file << c11
+
+Plot the mesh functions using the ``plot`` function:
+
+.. code-block:: python
+
+	# Plot mesh functions
+	plot(c00, title="C00")
+	plot(c01, title="C01")
+	plot(c11, title="C11")
+
+	interactive()
+
+Implementation of tensor-weighted-poisson.py
+^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+
+This description goes through the implementation (in
+:download:`demo_tensorweighted-poisson.py` ) of a solver for the above
+described Poisson equation step-by-step.
+
+
+First, the :py:mod:`dolfin` module is imported:
+
+.. code-block:: python
+
+	from dolfin import *
+
+We proceed by defining a mesh of the domain and a finite element
+function space :math:`V` relative to this mesh. We read the mesh file
+generated by :download:`generate_data.py` and create the function
+space in the following way:
+
+.. code-block:: python
+
+	# Read mesh from file and create function space
+	mesh = Mesh("mesh.xml.gz")
+	V = FunctionSpace(mesh, "Lagrange", 1)
+
+The second argument to :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>` is the finite element family,
+while the third argument specifies the polynomial degree.  Thus, in
+this case, our space ``V`` consists of first-order, continuous
+Lagrange finite element functions (or in order words, continuous
+piecewise linear polynomials).
+
+Next, we want to consider the Dirichlet boundary condition.  A simple
+Python function, returning a boolean, can be used to define the
+subdomain for the Dirichlet boundary condition (:math:`\Gamma_D`).
+The function should return True for those points inside the subdomain
+and False for the points outside.  In our case, we want to say that
+the points :math:`(x, y)` such that :math:`x = 0` or :math:`x = 1` are
+inside on the inside of :math:`\Gamma_D`.  (Note that because of
+rounding-off errors, it is often wise to instead specify :math:`x <
+\epsilon` or :math:`x > 1 - \epsilon` where :math:`\epsilon` is a
+small number (such as machine precision).)
+
+.. code-block:: python
+
+	# Define Dirichlet boundary (x = 0 or x = 1)
+	def boundary(x):
+	    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+
+Now, the Dirichlet boundary condition can be created using the class
+:py:class:`DirichletBC <dolfin.cpp.fem.DirichletBC>`.  A
+:py:class:`DirichletBC <dolfin.cpp.fem.DirichletBC>` takes three
+arguments: the function space the boundary condition applies to, the
+value of the boundary condition, and the part of the boundary on which
+the condition applies.  In our example, the function space is
+:math:`V`. The value of the boundary condition :math:`(0.0)` can be
+represented using a :py:class:`Constant
+<dolfin.functions.constant.Constant>` and the Dirichlet boundary is
+defined immediately above. The definition of the Dirichlet boundary
+condition then looks as follows:
+
+.. code-block:: python
+
+	# Define boundary condition
+	u0 = Constant(0.0)
+	bc = DirichletBC(V, u0, boundary)
+
+Before we define the conductivity matrix, we create a string
+containing C++ code for evaluation of the conductivity. Later we will
+use this string when we create an :py:class:`Expression
+<dolfin.cpp.function.Expression>` containing the entries of the
+matrix.
+
+.. code-block:: python
+
+	# Code for C++ evaluation of conductivity
+	conductivity_code = """
+
+	class Conductivity : public Expression
+	{
+	public:
+
+	  // Create expression with 3 components
+	  Conductivity() : Expression(3) {}
+
+	  // Function for evaluating expression on each cell
+	  void eval(Array<double>& values, const Array<double>& x, const ufc::cell& cell) const
+	  {
+	    const uint D = cell.topological_dimension;
+	    const uint cell_index = cell.index;
+	    values[0] = (*c00)[cell_index];
+	    values[1] = (*c01)[cell_index];
+	    values[2] = (*c11)[cell_index];
+	  }
+
+	  // The data stored in mesh functions
+	  std::shared_ptr<MeshFunction<double> > c00;
+	  std::shared_ptr<MeshFunction<double> > c01;
+	  std::shared_ptr<MeshFunction<double> > c11;
+
+	};
+	"""
+
+We define the conductivity matrix by first creating mesh functions
+from the files we stored in :download:`generate_data.py`.  Here, the
+third argument in :py:class:`MeshFunction
+<dolfin.cpp.mesh.MeshFunction>` is the path to the data files.  Then,
+we define an expression for the entries in the matrix where we give
+the C++ code as an argument for optimalization. Finally, we use the
+UFL function ``as_matrix`` to create the matrix consisting of the
+expressions.
+
+.. code-block:: python
+
+	# Define conductivity expression and matrix
+	c00 = MeshFunction("double", mesh, "c00.xml.gz")
+	c01 = MeshFunction("double", mesh, "c01.xml.gz")
+	c11 = MeshFunction("double", mesh, "c11.xml.gz")
+
+	c = Expression(cppcode=conductivity_code)
+	c.c00 = c00
+	c.c01 = c01
+	c.c11 = c11
+	C = as_matrix(((c[0], c[1]), (c[1], c[2])))
+
+Next, we want to express the variational problem. First, we need to
+specify the trial function :math:`u` and the test function :math:`v`,
+both living in the function space :math:`V`.  We do this by defining a
+:py:func:`TrialFunction <dolfin.functions.function.TrialFunction>` and
+a :py:func:`TestFunction <dolfin.functions.function.TestFunction>` on
+the previously defined :py:class:`FunctionSpace
+<dolfin.cpp.function.FunctionSpace>` :math:`V`.
+
+Further, the source :math:`f` is involved in the variational form, and
+hence it must be must specified.  Since :math:`f` is given by a simple
+mathematical formula, it can easily be declared using the
+:py:class:`Expression <dolfin.cpp.function.Expression>` class.  Note
+that the string defining :math:`f` uses C++ syntax since, for
+efficiency, DOLFIN will generate and compile C++ code for these
+expressions at run-time.
+
+With these ingredients, we can write down the bilinear form :math:`a`
+and the linear form :math:`L` (using UFL operators).  In summary, this
+reads:
+
+.. code-block:: python
+
+	# Define variational problem
+	u = TrialFunction(V)
+	v = TestFunction(V)
+	f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+	a = inner(C*grad(u), grad(v))*dx
+	L = f*v*dx
+
+Now, we have specified the bilinear and linear forms and can consider
+the solution of the variational problem.  First, we need to define a
+:py:class:`Function <dolfin.cpp.function.Function>` ``u`` to
+represent the solution. (Upon initialization, it is simply set to the
+zero function.) A :py:class:`Function <dolfin.cpp.function.Function>`
+represents a function living in a finite element function space.
+Next, we can call the :py:meth:`solve
+<dolfin.cpp.fem.GenericAdaptiveVariationalSolver.solve>` function with
+the arguments ``a == L``, ``u`` and ``bc`` as follows:
+
+.. code-block:: python
+
+	# Compute solution
+	u = Function(V)
+	solve(a == L, u, bc)
+
+The function ``u`` will be modified during the call to solve. The
+default settings for solving a variational problem have been used.
+However, the solution process can be controlled in much more detail if
+desired.
+
+A :py:class:`Function <dolfin.cpp.function.Function>` can be
+manipulated in various ways, in particular, it can be plotted and
+saved to file. Here, we output the solution to a VTK file (using the
+suffix .pvd) for later visualization and also plot it using the
+:py:meth:`plot <dolfin.cpp.io.VTKPlotter.plot>` command:
+
+.. code-block:: python
+
+	# Save solution in VTK format
+	file = File("poisson.pvd")
+	file << u
+
+	# Plot solution
+	plot(u, interactive=True)
+
+Complete code
+-------------
+
+demo_tensorweighted-poisson.py:
+
+.. literalinclude:: demo_tensorweighted-poisson.py
+   :start-after: # Begin demo
+
+generate_data.py:
+
+.. literalinclude:: generate_data.py
+   :start-after: # Begin demo
diff --git a/demo/documented/tensor-weighted-poisson/python/generate_data.py b/demo/documented/tensor-weighted-poisson/python/generate_data.py
new file mode 100644
index 0000000..0aca54e
--- /dev/null
+++ b/demo/documented/tensor-weighted-poisson/python/generate_data.py
@@ -0,0 +1,62 @@
+"""This program is used to generate the coefficients c00, c01 and c11
+used in the demo."""
+
+# Copyright (C) 2007-2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-12-16
+# Last changed: 2009-12-16
+# Begin demo
+
+from dolfin import *
+
+# Create mesh
+mesh = UnitSquareMesh(32, 32)
+
+# Create mesh functions for c00, c01, c11
+c00 = MeshFunction("double", mesh, 2)
+c01 = MeshFunction("double", mesh, 2)
+c11 = MeshFunction("double", mesh, 2)
+
+# Iterate over mesh and set values
+for cell in cells(mesh):
+    if cell.midpoint().x() < 0.5:
+        c00[cell] = 1.0
+        c01[cell] = 0.3
+        c11[cell] = 2.0
+    else:
+        c00[cell] = 3.0
+        c01[cell] = 0.5
+        c11[cell] = 4.0
+
+# Store to file
+mesh_file = File("mesh.xml.gz")
+c00_file = File("c00.xml.gz")
+c01_file = File("c01.xml.gz")
+c11_file = File("c11.xml.gz")
+
+mesh_file << mesh
+c00_file << c00
+c01_file << c01
+c11_file << c11
+
+# Plot mesh functions
+plot(c00, title="C00")
+plot(c01, title="C01")
+plot(c11, title="C11")
+
+interactive()
diff --git a/demo/documented/tensor-weighted-poisson/tensorweighted-poisson_u.png b/demo/documented/tensor-weighted-poisson/tensorweighted-poisson_u.png
new file mode 100644
index 0000000000000000000000000000000000000000..b5a8d889e6786fcd565424fd196f2b0013400ed2
GIT binary patch
literal 59610
zcmeEtRa9I-*Jb1G?ykYz-QAKvaEIXTPU8;2-609?PGcdsTW}BVPEY6i|Cw2{=6#;#
zq3^out}E5McI`Un)UId^HF-2-Vq^dSfTpM*qXhs!>jD5!Nr=#pD{r5prvLy-fTE0~
zj(6^9cR-zmmkXUYm(zk@ZRcJ4FulDeh!YkoqHh@sH3fzQbsROs0S$ATmoT)>3#`lD
zDM7fltxJP|Uezx>HVhM?7YC3IpBP6sy5JawCjBun4UH6VYezL0iOJQ{ucfRIg+W!d
zaIrAa7-Vs9@&5M?Cg6MLM<1Q5j=zgP{hZdB*R`{Ju1k|-iZmE;k-sC0&LI3d0fM4s
zuuT75`$Q}o4wNd=(6z<I!bb*5nU-nF=>EIoo814u;s4|C|B??Ce2yK*<)3?>7u18E
z=N?X1Zc4<TOKJno>@M1N6JGom*xzQ^6?Y`<Z~D(}_rjAzW=8(QWrXM)$b)~}rt&7N
z*nMYW^Y5D~)}05?C?5L|`1ts0+IC__#NV$r4}lqmo-3;S>+Uxb{NQ^h@I5+p+mwUY
zQC@y7BQ*<z^V)>9z6;;^`1v8XCl&-gANTAn>N^GWqZnO|TZ`T7#IpBHWdt278~gs&
z&Tj}qJa@~%aH(J*i9tjGN^R@FjdD*4?7~34>vNd5#15X06uZ67=zXo}JlE<@d|tYe
z@h(`yO^$4vOGT?#-u^e-iniA_-|r2*);%T#4^MRiAxBbC-`kwc*8`gR33;;$2K+{x
z0KmTy>Ydbf*0Ki34Y*$sP8UCSNrZ78A@h37i}cEQzcgJtrZ}fw@PWMwI!}RR{jYz6
zmp_|3bts%(`}1eBHARtwSeLM9edWB(|2gh;zBWN%RQuQ_cC%b>esXg1cK!1wD`0>_
z1bgjv?{J`5yGFE{7i8%5=|6&yTkWj(o4@BOo@~sp<7vxx?E(VAjoRHzcR-@_f24&e
zx^YtI<g{_BXD8-^Crj`1-|tf*H{*+E@0X4@$;-#lvj6=ejfIS^Jvssd=l*0G`BhMf
ze4>&2j4XS=v2srI(TOqmdCjT!ZF}|L?awh&xNADoe|o5O-E*z|Fu$|8`K}?O`*c)2
z@cM4aIB1kE!~aBov*T~|_x#&Zh9@Cv*SEVR@uyLBvG@JXFF)1~`7Wl^E*MVL$rrp;
zj4emlS?X0FK;(iRizuFp1|l&oHhaNg6t7#5wm_Qy<4_#@<mA6gQt&v)Am+N}FW}{i
zU8nJ1Vkux+=Ox~OwGD1jmeJ(}K{|)=2aj54;XfcDBAXApt@~f%sYcl5S)5p?Rq`K+
zb@{&}cHtj!ikv|vBn;1p|5&6=T=06j83rhQ>%Pqnf`!x3Pzb&rl{PM^VlRcl)ct|U
zPs7x1AQ1|`(=L7k3z=pNoZkf*E*<cZ6B++KpNf?ca2z}7Q1A>Qkfhpcm<l4IF9q$T
z7IY_<7lP8#gXD|QTndm$1cauTR1|?sDmLv&#BnyTZh~+J^8(~ur-)Idat4>3LqOmN
z{l6FDgsBJZ3t@&E1nwS67z7RwC=`wE8$VO$)h{1SgtbTC7gAHkC%wZ*Ny^L@aA}rN
z<pXPJsC)E{p@TI-Bxw!HWeS<CV4<#(E<v&AQ2*<-@}!?%cbnfI=8W4DFg3*99+q5i
zwS*>dGF@S1WEG$!u(aSPJzet!4p~`mc}+Q*DrCZ?7>5+71`A^})1#8=d)V*9r?Zwr
z^9g}~w##DaDW7|s{FhS-LCuQ#%gpdRSQd9|QmLZLWzaX{PWZlW#&6@_!0xO}pI_&i
zNulW1G!;UkDh0af4nx$e(u+uPI~bX1Wfewym85_N`q}BiXGpSflfb_Qi}=h*$<%0K
zobs?5Q2_WOo&kOM{$g&L^fv^)f|pYQ(cg!Sm&@?h41xCAkS@PWa$Zo4gfh6BS~7Tp
z{GO(koMBaeQHp5Ez%ug$<BlRKhpTByAr2Pc#2{yeBlKNhYC!2<S_3E*{z@T!+0ldJ
zTEz*))tt>>40p7pqsB%07SCvd35O&gjLe7$1s_tO0@v3+mMC&T!1gpKZ~S;va45B%
zEdB4(ea?3iIe-n9qjet0_ahBQp+UfmVks-rpX*o>OnPoGLljZW3IY#`oiv!(@XRL8
z#Bro_P`)p<09-sc=?OEl>>{c{TyF7Vd~Im@;<%Ke!G5yOEaMhc7cx6}wCF~jH}5bx
z1i9ci`IjyN<V3=M?06Y2qKQN&Tj_fKwJpu>q}DWonJ-X9*QlW*&_Y@L_5nA>Edf>#
zJ1e&|1Xh$@TS8P1nHkTllyIKAl$_<95ubirc1OoRo@R#~R;4hw=qHQ?IbLSeG|kZQ
zuWnsNGhJqU@?}_;{tJ8pd~*1-W6vVzYqOhl>5JEKVI+I<6<T0^7_Rz9zB4+BQAT#`
zG)#dLnL#-39CADZOgY`90fO9$WW<ltjAn#sG*tAL0_p%Qx;D(8MmEJtzHd&mznXOZ
zmQqd_?n#A7=-A#?x@%2v+;Jta`Hu64qp+{~Pc{aXhI0cW6Rv1E*4ZGMN^ig6dt|uu
zjubti&ld*ik*Mhs3HAfQR^S%Ur8T|{e^%b8@$Rr6uQ2p=mjrz^y33M>BPt1*kV?Ub
zb|_dURZis40I__U-UkbI5Yl80s$$f@dta(8dA9T+sc0>;F0UY>FOm(3ZVwa!1~R(d
z_JvV(b$<n3@1y~2J@;ghy*)?(STszF4URF({L5VEa!Ps4{wO)Wi7DB1>=JDK8B~ls
z-9D27Ne(X83hdG-C{nB}74;<F9vua~_&E6QRKjpXXqVJswe+)=1u9hVpMS{hWpioP
zSBfdkvobtY_Qt>3YJjpp=BN;%!yDSJrSN_5xLEGGOA^mDBa<AnMW(qr=FG30CYe$V
zzfHK|`I?1YM1JK%pTY`Io{2_C24q?cVpdB?Bm`$_ASE7)=$6)f4g{rsqb9D>EUCo&
zsh6bTYnsF%6O0&@S_}<8_sMQN+e{ekou8)9GqjZTTHN)rf#wB+v}fxz=<ZjL0T4tJ
zMGXQW_lNa*1)Y;cItjy;HgLNIrGDa?&&CO8Pr%_Jw828A#%1^^!bp`K;-o*gD^5#5
zJ;00?hf7#!Q7HzTVMr#y#JVeF9poxDy2PQvHQEbf{$Xn&(K2ttgX{TG`g5+3o^NbX
z>&DCEJRT1KGsJc{Ogl7fWQK-Kr0yx#`ptP?0R@9NHvTUS3of}2Y0ueor}zUpW`B@`
zcCa@V8%%qZHl;xP-qCk!JoS=^#F`G+E+S|cjs_GOGR?9Z`${at)!6EyL%uRmEi7Uk
z+Zu-=#6t2A<`lRpd^EhOY)J)ayqLWqi@~(;mO_plspvONB!WqW)E61Y3{3$8v78#K
zJpA7`lP{MHV%HZjC@2+dkg=Dj_pc#-Vh`xOFfwA;>p;;}IH_uAN@nx8Tx(iBLvm*9
znLM0`k*E~aFzj4;L=&~jQY0?aSdog)@L?N_fO#9@eQEPOWw={8iI17l%#wt%aWTKX
zMyyvxdl$_bTBZG57u#TmV^aL4lIy$KJ*K4S+wl?4iYfFP8=F1W)?h3-uC+fST`p7Z
zEF^dmS*!~K2Y-6m)zWh6sO<cn<$TL!PztS`P93F`=SF4VyQ0fs!&B0oHqIevp_F9C
zECvmL-xhG8>T0P>HpIJKv{T)nE~G#mKxdT_dx*W-=wI|De9#{=J5>6OIiTA}<)Ig^
z1?5)43xoTW!_YCW?^d6BpBsU_w+u2swFw|>9YIIm^gI$R0H+SL8g{FABPll4Md%o(
z3?B6tmkMzW^x-2!oS-OPg;#f$x2F#se|V<W`ZUXx%GK98MP`ucSrkPO;W#(fFk`G9
zFHH~<8NzH9%=j%inzux%u;~XJcCpG+98iw_LzEHmtp*n{`N#ELo`r^@JVm?{HtN})
zYUJxJ%hojK@=MCP%z`7Df0)2KKb}Nx+&y_2xvf!69jIp5$Ok>8mlEp7pywQ0*;xmt
z23u^BDc}SfP^N^Y?S<fTSiM@?&k|D7h<MF88Z7fNh8qpfKgr2#i#dGdD9g^&>aJS1
zA#cU1t2~~mptm%f)*}9zTh1j&qlP!Qr3@9ImRjgDZIKZWqcC^p9;pN`+>Y6G*|&{7
ziA&D-Td!Qh`*Qj9`2aGiSG&%pd0QRe;mnjgTVhN;WQ1%fG}%;0mMg@oZe|T}Vl9KH
z*H)HUCq_He+*|#l!QZ<J47IqBsa1Y2m-j_ZcsAi!Wdz_7L&28$l)w#P5)&oW$$dVS
zG}i!hho+Sh5d5T*mE|S<^J@~MuT55>DH-qif>{f{Fy@l+T`qC94f7vwVjvjh`u=NC
zr<m8(fkR~WAFkwF2CBo$G2hFAS}Nh)Yy%38CKgJ0>2ws?{$xF>aHlUKl7HiI^**9f
zRgA>YAW_n5%4{0TgbJr+Zm8DMmjk*Yr}g*TiZnl>YM2W+cB(|+%091J_#e;>WYQ<^
zEA0<H;4YNG9;Xr9vH2ykCo?p%;|p~NV5-{xb)AF2q$Uap(bVYd0|Rb$PBxl-)~p1K
zP`pZ-HC)ViR%gw!c81<9^9x{MNs-15Gm)o~bmhEc4uljbSr<j@lmN&3*qU0myI$Q-
zoE!bI$>}7hY^9hSasq^&-0+O{Dt=l{8+Dfl_^tW2=8S1riPhFJl2Xx_88HIi&J~j6
z3a9}Srnnmwo5MJ2>HKrYaOvjf3Tzn=Mg?=A|5tcefxPjw;^h$dc6qSGA7FsR)n(h<
zitFGlZp>`_<p=f3Zlu8y`#SvepGG($cB{%ctm3{koFq2Rd_5lSOa#O2fip7#Y#|c_
zG#Dme{U7Bh%U3uMr&}Fv5iEw~RXqms5a5cEOK?gb<K<rRrYf>t&2!pLAVUtrQf{F7
z5*>|~ScEcu5=1rxD)aVKQux=jEfe0%R*lDZ0r!(_=~nWd#||&$vH7RofT8M=zF%oA
zvpM(GS!~F+zNU^1-?58NJZ(Pv$Y}_q;C~?u`YB-s>+iaOTlV~&6-F8(qw5bnz=Wo8
zS1O$tt=majXC6kyOG7(Ta-DD9%(YP2w)jVtyLz(?e;T0{BHap;0+L5yS%q|G;k5j_
zr{Vp!Ot$If`H&P?l8T9+bz5b79ugI8(+(}P8r(1}^;qAWM9OB0p7tdK58h?VVIWI8
z&0-m~*|-+dvA;tJKNDti!D4d70F(7#`>>1xq;K&KzBlwI35Y3v&;XQ5O57lIPWsfK
zJ6uS2^io!GNT8kil8qNiRk!79i>ljk+>J8?lw%)thlqXq?COMApcUgi7wEnin^ct@
z9aB;uu{2iaGp)k#iS}>W+}iluvd0RH36eE(1u{g*8OUmS_OreG54s~AMOl9GvOiOI
zWaGlpPP~FXRN<hh9am|E%dw@;roABpo`(VDLJ_f}A6W0t5lmFQ=NzVmQ5r>I@WUvm
zb?pZjOMxn56No9MHNhp($d#qhNIJWf{*7Nj_NP<14vV7emii>N2v1B%cNR=C8Pa{W
ze5M&JXxiHRH1UqeJPRsb@a2i-Lbckg&2qeW=LkPm8IXbGpDCWk!5$NSwLSa9SFffh
zu-Y-4dcnl9LSi}C70OTQBupv=)3y`mPQ5}<N#@H*XMeJltwq#-zYk%H%tUC?y1cMa
zGdp195PC?gPTSmDDGVlucjn2q7JYZ3FN<q(>A}=msQ8GO#`#(|c1v8Tw>ED(dJE4&
z*2<e&Ce`P!W#;*bP@6aG6U*t>8ZuWfF2STueck1oCfXfPYO6Y@_AN2zLfHMpda&X<
z%&+gZf4q!U2;5clhK_&;jDj0{-e1R~R0>%oSA92$VViys42S+=jIsP!dsR@&(T9NP
zyPPq}#n}k0{O6CQ@lDl65zx`%0KZHwk*slMIyHq@zJ#i=DEg6<&iC<v``aHNiPS_p
z;i5|s2TgBTeRtmOmvq#eyErw&dx=W(wOX|3=~m%yZ%C&{$q?nG58eTRM&lp>4ASsN
ze&d(>?_ic<i3!rJ`9=h9#C>?i6zMBZoNS~mQPf#GvXG<jBRr0HFzT$qLI)ZWrke{1
z*yrnv-Pd$kehYK6Jw9!*cAC|3#BsT(ocT8AG%1GOns%cI|6YI%N3!IxQWhh|ms{rS
z7-9qZf$|`v&gMNSDi#d690@t0^6>q~%__D`$(FsM))yDgu5V%`%K{T~Pj(aEDm7Js
zspOCu6er??)AQ+C&2!^-r=Cw~)Z~`V)_0R!SSu-6bI68lX&jCA$x-`y%QTpJlAk-9
z-hCxoMp+#&wTVBPo@1>x?{xxWUE77J?J|q&90j}CgP@|E<Djm&JP4qrd9JzrJAm{?
zF*r&2gQb$Z@d{{00`4t59(XnhMVDgW>2^7D1l(dwJk6LGRL)%jRT}9iwXoBi-6~o0
zh%xyRXGDu%);PRog7dOmrhgTb1+)dSAazOs&d1#k8{n1?;6HE_nOsp5SF5&^pc=I~
zB#W}?rIPkRPS?_QCA(ro>@uttd(KqwsTJ=)6hSu;$TeIV{Cjjpr@;zdz#3^72!;K2
zeVZIss&sn>Tv1-m)l7vmv?&3Y*RYLqFrtARhr0&Twg@HE<B57F*e8xL3#&0gcX&#j
zkul+d6Ak||X_#GyPr>F7a{c_!i&mZ)0~~)obBCS@$R^iFcP_8{(6Z>Md?C{DFDh8|
zKG_F9CDwZPBFah+V1-atOhZo`3ex=acByr!zdXrBoYljrXG&hYC-`m~w>@!}YD_`^
z4{r8OKH{N1HG+W>lyRx=W-eu}FKJR78x9=RR2UEcI+<2zr_D%=q#VIXLdk)nZM86c
zW=a`%6(SVRd8<%^h6F1ts-ByIFW|X%$l-*=^BhnxH~*;4Fm&AT^5p~m`C}5Cwy&^K
zHv+r379;@}jfRl6B=SSgeS53XeUP!woV9F9tw2^XR2Jg5PkvuRQ(r$z@y1O4)tgT7
zNIr9~k77+xF;ES&;8i#LdPxybVcrVd-;(=7Lr+&+KVM9KY)~oM9WCz#uk=pvS^;Ad
z*HmOV<9d4tSMmTA!!hQriGS;ElVED58^Dd~hI`N*K<~mrKl`+FOFc^#I?I;>(x*1t
zs|BLj{&Ja3VYOaC7=UpU${zydf6jaTW6vON@EeH02W8~^&P@)=sMPR&gs{V#$9d?p
zI5=JXE#pJ4CmD~Z)VAn85j!VOfpCCw`i+BRND5IG>O3*QvxQ`$6)kqDvJtnlx|-Un
zyl3v(eOf2_&v+1Au|aq(Z%P%Unc55N=NOmmo%4iqGFqrb3DE~2$|EMLaGZRZuUtPG
zkL$@rBv+9me~ArEuP7}ZyK>0x&f&ui8&9Rly%hBk;tf&_70;+r?cBSlU})tb&R#qn
zf8{jG6}Lsrz3Qo@Bp?@fh2$CvkX(ZS?_Ye+BKD?k{D_h9KJ?A_CD%r`ZgBa*(<d&l
zy^x=)1krs|%kFnVe!;4^UL}`ZTxGVDw)>Ej#oB-l%lNZ#?@HiqjVIB7yu+%~J^COj
z@&%Vom0_vZ{ZTi*6v|uF1D(vlB2Gz)WWC(rw~?>KQcjiAr4rQLi?B%wEuc<%vpy|a
z{_dq|yKtr$NKph*<KSD!UDz)AYAszo6OgPpbJ|eQfeMuw#l_t?QZV9O5`CEGH3~^j
zKs%sN^Uf|glthQunIP~O*!dES)r=WISykhq5LY-7r3chMC=sh$YroR9so}9DJ!TSw
zc7Ia1xeuR-+kq|T<P!TDGdHZ=Wll7u*I=RX`P{Gqk&$JQlBdM-@4{?^@BxXM?N(C4
zmz=S^zeK?rik#IszKO6hBK~21dp0M$w>AAe?P9scATL}OrA{6u{XOQZMKdG@*Mc@o
zBjLD^ZXy(BU!yqf%kCK9lU}`pzD5E!5PhFT+k1RxBIv;weAEl>RSS{$ZiSTP$$3z6
zVNlIw7((K&@H}7XDS}urioa$V!TmRslNMwWd-_Ado;w?CZ_Sl1x0bL7V@#KtfC-T1
zUp3;|wB}igN=W{mTRc22H`}08>ELV<B`a$P{ns_8=4T)?zOS4XH}!qdjg->ub?i%D
z@D9=E@Lv_enrE9P{bXH7cT(SK+BF*3Y$TR~G45pto%bPGz>0fs?&RdnQn|k5-qybS
zJ;m}5Gf0Rd35jz|hxd)!-zS1zHvh541~!!?bCwXAme*dUGuCAoXmpsWm=#K<vm66d
z^j?+>DGH@hV400mr7y>oh$uz%O43VWg3aOsb`2h$8wyCP*F+TA7_*$__OGoaBR<kH
zyEb8kQnK3Jfyz&#`H+iZraND|3QATcyn`z_V%@9fczLCIt8&PH{i+rBJKMBmOWPMR
zJ1N0b;9;Uxi-Mmhu}uOAFo^3MJI*l>swV^3M4Sl+;d=EAbOo;dNuqt*>xI+fK;qj%
z1$aA_kVQ9Gs^$1tYMMRM-r>}q#?BlWT5@Jxs;`{;?2hZalgZ``KfjdcL}37!Et!s^
zJzFTXmYu6WXWq74#B#R!!uBVw91o=vUf#E%9)&=Al-n0M!=P=0uKZQdiBWM>iR$gw
z(M<lP?KuDX^dOhsZ?|_3WOvtl1y1ekxgXKfT}_dE9xEepn?GoLzej7p&NG(I0?5pg
zYQ2c$wtjE`@KwniDSAkEXuc+8f#KP^jxOEu4MABSBl8}yP5<=;h{FH27JO+=aUJ_L
z20q8K<?w+88rMRIN83X!SxTS$qVb07?@SsGoVkHD(xVz$X}lU45exlKCFLgSSfCuT
z1pr?%sZVX9dg-$6EH8drm@jKy<zyerssxBJ93@lsc`1ETfhVX5whG0nxKT_BR4QHg
z)F<;=9jwlIi=!Gc)#6o~b+o3w9jDPSvq2`GY@TLdoJyRvL5~L=os7%8ZOJ_0D7QsZ
zz#_)3-gMCJwv9ShVD%(zPxIZ?cuM#Jd*kW%%d00I`M`31fj2!1q=$42?)TYyj~tvr
zzLdV3xrcFpFro?7^hJ`eu`q(Re45*Yl-(k;s3YT`a~3Scy+BJ`(s8AT%8s_FIpN6y
zJOw{+p>)C%p;1ep-ac(nqqUHs!DqVqV@2QR0jZ*{IP7yUU7~HfFuab&Lx3}l$whV?
zh3pUYvA85Rr;oNxP1{D<mX)SdyOE6j>f5F`{a-j-@)gi%h;(^gq=oPelv1re@q*NB
zk%^O;@ZCqU=9AU#q{=LecXg^Q0(DXc8O3%F-#~N)k4GpJe_QJ`yb=Gg&fCCqAf6!L
zu_R;DTly9jHVcumw9P7IF`kEkP)P{@ojBS=F@m{tI%>;0JbZw>ULJ~01fR)#%yn>f
z`m2}{K(VoQx5SS@jAe%Z^U4wX>zXFZ{3l=g^$;9c7-W3_wBwWA&5_0Ie4X$CW~xF9
zU2wSWtrhG*3bgbG{AYIfiOd9IA5AXoPR$XwgwW7~n@m8VPrj!GtY)_2S~mvzxjl-I
zSD50CVrn!>K)b5qQXLf@*Y%KOiY8L7PK*6VX_uD}1%;cfeSSzH=4|$F!b=jkz}Rqk
zisvufm(ph;RKl<-@G;VCBs`F$nkXNR2zLK$u72tR_B-NELc8uy;$aag#$L(_-}M+Y
z5o=#cE&GjIYoV~n7~SMxjR_C;dk~}jDh^q+;Z~$#sGqN2O<U2I^n=jCMFV>%DV;tB
z+_B78ZFQ>DQEi(!M}Y0YOwk~vU&yQkZ#E%gH5LlI-q0`lXdo8*feuKK>2KAnjeA!1
zIg=<mN^#qA`lF&wj4dNjN;vG*M9BOcux5Q~y#<2F`BxZ_fF$AM9O$pD;ETRUG5W6>
zSS{7*rBs=R$h%t1zsen~WqRN5On1;ZNEqt;uT&5RM*tB&=GnKos?0&(-IMt&Cu;34
zSK6zfJr48+g9oUZsrn}8Kcr0P*B$w@P!s-=^|EO9JG^xX2mCQ>D5SKY+wR2Q^-etv
z`<tSQbRZ%Dy}?yvlvx7mS|?X(EWerIljU^$nVMYH82^_n%sKV4AzNVLB9E)A!7ZI#
z$_yFrijQy#Y0x|7Q3Dq7GvDd8DZ2|5q>B1&$bcb^`hR)>>Z>7@1y=vRv0&$|upqA$
zv>@@7VA&GVuqP2#{w4*}uQZ9V9mD&AVL#r@2v?f&p;uDA2AWz5=zH;deusgM+eT{{
z3{63voq@|G0xLeG3IC#u+=Au<wahlFRLqleG@CjjUZ_WVW3{OE(j<qdyeHLRYao>w
zECb>7e7ciH&uA^(sj8et2hZBWuH=jS0zJe0B|lOXIZ6(U67$YwN-W~;+R(t-pXKXG
zp0;UpCFBGYsJWBdA=8d<tL`!-NylW2Jl&g+E4EfbN^UqnNPPG<G<6ZQS<!QgH{+7M
zeMsPx%%Nn9b1d>SI!dtSmJ;==&gHOllrm)hs~Kv$hXPlalf%kJI~}VjtvxfoRs3`n
z`uIVwEFWDH4-;a@q(qSe49&2ES)6j<k=lR_P9H7X-2j82r)j}~kkL-uqF6|!MUTJ>
zR@kU5{+-U?5rZ@8XVT9R&+ll(+kt54lySJ|QaD@)ay%t10@{l<9|AwI2>VQz&KSKc
z%*4YaJKAf<CA;DPu2L%-27``|cYC?h|17OC#M)Zt6`=tjQM$8~hKz2T)9XvGz+-vu
zYj|auUztppiG{FeM>3({+9u`Y_X@ejKWQ!~h&C4Y=xQNSgAqHZLfESfh3&}GDS=!<
zsxqHLr|4sX=VO7fQT;kmStM=<@*uE~SKJ_9g&2B<MR_9+s?g)krO6FBk|v{6DRzB<
z6=V4*BCGXjSEkh_pA|yKnAOK4R%~K%yh2S^hciSSb0xXmawTG>QjA%=x}l);QWIC7
zd#(H+2lq4t;R&Ww9qufq_<j{4F)4VjBTu-h%nE;PUgo(!g92X4ol~3g07?Y*50G*Q
z>=v!F&xhQ>$GyXz=g_5IuxilN=(x;1qH55I{6zr@aTIwNsy}A*lp{*2-yxf`TGZ{)
zU>a6BlF1<9C-a`b4;NJ*s1@0wWWTt{-D8Gn4f(M$(k3SB53}M7_@jksNx~tRcGgag
z$T?<_@se}vX~c&)1FVI*m4M8o;mkVDfT6gxVb)#EUCsf{)MS{-J<1+9lJM&HFC=MU
z%ao+^W<}5NstZo_8EsFXkYf7xAK6jITVtvSIApS@W<3d&y>FVd8Doe<R3*O%F?jJ0
zu<ahGA{<TsXc{|WdwKss8`-q@qJ{{m*tdgKb1?2vI*Z$m%X5t0{(csJJ67Lpw4O?Q
zKT7PmZ?5g$O%NvktsHoM7^vnsz@5+eCim36`O>}nx$S<{j^aqu0qxpm!&8*xI-ph>
z_-z<v63h-+PZgI${aOr9CcF05w%pw7VCoh0#n_A{t)*e``c+vIr_Qhh3g?PMRt1QO
zg9IJ+c{mfb0^if39$I3crP&c#J-(XZMnuKHSwv2Etk4RkxOKIiO%5s~o-h&X*On7~
z3Y%m14><#k7|IvfPspMfHp7>Uv95+`lU>o&t#F@<%71>b(Ps@6kE6Fq=ZL_^%0|+e
z2*=GP29{XW0%yZp{3BshY=3Lo`q-hUnktdlAfxjDHy<j7O*4Re!N}TLrqCoiJ>sRI
zQn8y<%gKDsy>NW-coP0QH0;dV<8OoiToLE(hm%%~1l>on>VB(pj&0i!82(!@BqSuC
z4P1tHDZq~i4=G^?7#qGPKi`xU{vj#)@W)O3bsOU)g`oFw$QXjP@k7Vb-S_S-ICg=T
z(?*JE&A0VDKZ@Z-mx9Mu>pyO<Ac$<RJ-&f&kAuJk?2)rs<9ZI!=wZ<9D)GD6qi7{6
zw7=#2ba#63^D-IX(lt@M>P*B)I^;iwmZzX_Gklkt#s#Quf65ou!z?A_Oj#qZ@hlsR
zGiu+u7lk#UNoww+FSa#cWTwh;Ir|k#%3YR~WTS9f9t7A(-$={DE@2oX(p1RwQJ0=B
z0`7i+|HQQ~yUV1R{b*d$n1}h5K6qGKo1HFOn;<e8nuLkXWjo2sO43^=PBL(-k8@=*
zjjyk17euSjd+};5#pY(paI-ycnX+0W41SP5Tnnt;{RnZ792^|{Gn>q*i?3(=fgr{1
z-H($0G;VF=e>H@$q|DZN+F&jIvO@88Bp>vC7_^b`Iu`WAZu|%$=y^MH3X1CdR}^=D
z+_QFietR%}s+tNwi$6=Ra%95KmFmVvPZ)D4(x$24Ww^F;|8<Xfq@Zb^1<lGhEe!qk
zT&=@da7TbTGVb$C))v%?5Zh<7Lsf_aOj<kU-IdJmZ(#~n4<T&Tnny;Ro9Bs<xG}B3
z@-TuOu`)&`y5>b>g9UuE@#N3UvE}FIZPK0A6MahL7#5L3dB)Z1${Apkn*b`I;G@2$
ziZSZMzTh0*$+Y334{JA~zJy-dNTVR^Qt2BoI{2jQOh;krXr&N)Z7c_pNl1u1SO@Om
zPz21BT;_?FNnXcsPeOb-V$K^rhj(M*w?!D;uaL;{q^48HYq6JnP#N&L!~VVlv2=ie
z?Ed`)-8YlM|J)-G>&@f0+CQ>KFTtKJT$rZOmdH4P;HjGTH}PI%;!j_;aZ~SE09qH@
zK7IBDM=0US;@^+9)5qkyfz<eojm5VLeTouZJ-(|ysm5osJ2dA)W&7cxt4^0d$XLHn
z4ZKlA)=yci_z~ge`y(f{5ihDTY;b}Zt?YD3VE{zb1i!HW_zzl#q*j1J)s^acbogaN
zXYBrt7&n7(y5^fwJ3721$*wEfcFbvff)HqZ?6u)&iv(|#6Ad>M2g>Uj<oZncencxI
zz~6M638KysL{uhihgrIW?(E^_A2Yre1!%51wa|PD#9IJVzw@S?Xmvw}B_j8g%<WBh
zL2teIuN_YQFKe4U5R@PWp<J@DDaa9GmkGSd+4TRjOa3rzeEqG~f4}zqZ|%m@q!%Cb
z%j=;y##WVjz+Y+cYKQf1#|N9@s5$_k;B`Ft5Ih{IMG$j}j(QeYP$$Ks{1`O)wOxwm
zx8SC#8w0VVCmGgJ`eVbRF^f^075?wGQ*{UIw?>87nNRg@XR>bCH-#K}8mTrsFDPhD
z=J5gLTtxz{69SHsu(5s&)H)$-5(D<+Rhr?A23;S-V|V$I^t7?VBxvbrpL|Sfl$@jy
zktIB#BEBdjtqk4{qgy-SNs&|$6~f<yU|Z2MlQMLmXg6hQP-smkmhEJ#tEEL81)8P?
zH7F`d^9!#(Of_8aHqC<uMNs48Bex~M+!bIxmgcRr-SL2(mNiG1Ez5TDNgl61E+bbz
z?kSC~TUxu%AWo$BZ^lpGTJ}0lYG5um9(o==2i<*kYTr+<5ZPy954?(<5(mFFH#Z}6
z#GYMHnfUN%%C!A$yUo@Q1P4TlKds~xt$-<^<!HRPas}?(Kgb9y*XWZqX!Z$C23Y&v
z{3b_T8nt8~XkiFIShwUB{q>qGtKOdT{Y=A{R?v-5q~It!o|YJz##ToQ!PTH#0wA{*
zfoR!(b%c8#BbC=Jmz4W6`lbeFV|jvC$Ib~3*Sl7@t4QpeYP~fNB|}QO@li2U1a4--
zdM7Na5c6uakWkcz^rwH+211zyzpOu3wVA2nmb<9QlXh~`p4`bAY^atW_v|ANCGOY}
zW^mtZsT>mfT*R&lsx7wDje)DALqXT+qne@jjFsS|KZUoasaU~<?s<5V-Tp~P&z}C~
z^WqBxq9usF`#q=$j!y-gy8&vt?^kaiATb2)F!Wpk*}INaot|@gpK>7cfup^>NK}bX
zJtMV&ZP%50ZNRQytxIE*6=#<CONlmzV5Ke5^m8A#XD%@*vB2ArxES&{94gtE`%2Dl
zXM2p2M6pP<B=Q=}s4Slv=mmThE_5B*A+AF7zRdJLv^Qc3aPIKbZPO%}qN;!U=j$Sp
zn;iO%S;=IX>KrmP1BRV$*5x?%3+raGjC5|GDGLXaXf?*;<|O!Hl=5w6P%(?NSqKZT
zi(tm{OdG&`WJ__$RXWTQDze?}&ctP<e{X^VG;m?1J5uDDhz#$EaHz!{ZF{YQt*jU%
z(CKlp>VL76c<tZ+WZaUgz~%kIUs@F)spS_Q?N$%&J8&y790K7)Jaiq3jwF!z-F-J+
zXMa5|ct1WnJ8SK^`}uNz26L$`ey830I@aqCnOw;QoK3**ZwyBY6e2N*pK&wD-=A;5
ziHVY^G3(I%JUWw69OpdRnPq?)OAR`<SQTprezY4~*sKU?5|Q8<?1dzwwaX%)njhDd
z8J}ax0yK?%GH$PTAe(l{PbMkrI=^`H@6cBDn7AgHA;Ux6GXxiBFU*q}nG>AYe7;&K
zYa@t#f3E%Lxkfmgs6M!7Zp;_fVF?~1?h>9vNev<(c8(C41r;L49it(mrjY#wNTy~Q
z*kJDvN#_Q-HDkb$Qz8rD>wHx9au8^is|c7(A90VNF=Sm8qd<yu$*bfvP;{^#0v&9s
z;zUKIP>z>FY(qk-s6Ad80ry$Kn1bF<$&d`(IK%lM+{DlC1v1mUj2YcGP&_4<6~5xt
zdJlatx{3)L?Fo2c>o_X@+;ja6BMs4x!wC|$&Q7dtJl34By^a6WbTxm!HTvz-;%{jM
zTamIo7)wSq3>;JBLF37I;`(l6NZo{judjOQ_i8+Y9H^Hxrd2F{^264UCfpkfZDX5_
zmLPB@{%@gi86J^w0`34yLbj2Bwz@nuh}O~Vg>ZFy>Q8mfAif0ZjYZq}v^^@DeU(OE
zcl)+Jui6EbYpLER8dzd+)i1Uh{(p@d#co8SpWW$B0zXdsOb1AqS}~vBFUGkRvmGlc
zZQ9%vMq~9pxeXPsuGu6`WU6Lvo4n7DwsBlH5|7S~rmPW@ZFtq!g>!Eb)EEhRo-RK>
z`}X?V*`f4tpkiFn1wCa1`TR4f9yq-pya{GPyr)^Me_Y4TS~uT=J?oou6z(*Kqs2o(
zCDHs{Hz?ryptr%YNT)<Iy~Uv&Gtwn6>gn{MRO&FH7nI7jVaB>W!F}80nL-x%gEtfP
z9=5vcHO-y8J5#wuG_wb%pf;!w*}(y*ns@<gt24wAW+hO`X7{I@g^>m~cZ!3ea!>-b
zFs{jAwR?{fJtDsSG|SW~m*{XW+m+IKxIc>Znh-&1z0?6^8NP)R6NVE8evE_@2fdWo
z8bl;OV~vf1U_y!D3_vIf-2jNM_erv>%L?)$#b8|K`4XEIW%9E{c`t<`HF(LI0o%wn
zH<@TU<T8#@`<L$$U9E-Vv1eSRqx!qCX5HofILgh%v7TR?OKK-@KOocyJq`2s)SEx?
z_dcltI{D@|!5K;ZWBMD{jp8qj{~W|Gyqgdud*4%kFKzsi=y%?Z&^J6h941hW6H5*H
z*k2auSRi`V+q0c#4BKH(t1o3A{Ys6Mb%oa`Ht(9VUi*k^cDhK!H{_#yyW|i#HUsby
zi@LSy`9XL2Wpxf?$<8lWp8Sbrw-#W_MqFdNy`J@Y7;yZ1Pl~Q}l+`tM0JIVt=EC9l
z!_<7ZzpZ>4&H~EOMdbGtx#RlikZ2m5dw8t~jdhf;TUiQ>AOY+Qc9`iwG94q$LLrSu
zDT@H6T6!P}Dr8kB_neaD4}8|2)mit6&2lD{wCo-`X4IU}CN7QMumo^~yPyKw;5?yk
zZnK87e#++T^+DTWl~#r=yHTJB0rhOf*%)*`kidcbbv_y4C8*CF$2!kramBhIU<mIs
z#BY4J@VUU}AnRw=TYvYScER)f_CRDJ1_I=y!U$qYrg&K%@niw7^}ek!h+RcjKs?d^
zjo*kETlX^w_#mj~bn}%x!;-Ha1(uV^m>N@sXzV&KopK^F9;NYt^^-9&g8tbD{FyO5
z9Co%;3knt`zli=Jm3o`!GO7$2vW9OkqAo&G28g@y#|M)Im=XwHBd7=3gLGdc=>`Q5
z4+;~=2V5wv<4n}#e@xX`C!BS*wMFiV?sZQ)pwb)!ua8|3R{X+n8F6y!M@>rZC=}R^
zCynDa{b5BKr!*d%#Z9`ULoi&igE3>Ef}rA9IlGd}CwE(?zV0JY6}EO2S1n4=(YxNZ
zcUPjlwOrg?Cy(f-#inU49~e+dc(tje(Y7bUEd0bCIL&fgn}YQ~QCaAWRQ;R+u`P$9
zunD+YJV!g<9?ir;G^>m~z*ZRqsY})NzTK};Oe+Jr_F0{Lc5n(Hq5XL-g6qG)&23V!
z)@Q=*nbrSk%s6oU#OQ&f_lg9=hJXR-x84C~0{`m>$;M>@N#Xj%dD(|F<E2?P!Ti5x
z=7?l7*25q%tMS+^MrA6{^??7U^n$Zo%i-hf*m}dzk7%ULKo+Tf#%-aqGw6~!pujeB
zxdR+GOST^0pb9E;@)z8axIt>-NmCuK8y-eR8jDiw7TL8)Hjy#RIrSowKf~)@Ltx?R
zBt4rr!1yAkvGn(_rjER|hWK4A+@BMU<0c#XR7p_q(IWIE)e(~Zi?X_>QEf|c?QQgo
zh~dOTAV;}ZG1-Bzw6FA5UvYn7vT@`0*zr)ow|+w+nRThVG$*l%(OhfXikq;rQaRB?
zKNc&oQLopVDn-kQ?o5sxQ{iTcNB>>c1=<skhWhPd#o*X^*5WoL>SbqlV#)5el3MV(
zcT(H?o}$e5wAk9?vGDP;=&_>uwTH~!^GR*cb!ve>*w}S9p8tJ0@okv`d_@6%t_43|
z33p!&lN5ko4>uux{N8)J-uqGp(c>G)704`IAa<fR_54d-j4Nm2{E&?_s7K%gOGJ2N
z`?K|?SfDA^wmE)=k;h2y`?n7r1#8+X@La!jDzbE)eV6?zc#Z5&1uQyP@`*V~r$T!&
zIB)EQb(63$M$$vaoWtXBKdQ{@ke~?3W0QW<DQnx!CKw;|mw_3duav4U6~#apg$mA!
zBUFH^r<Aistt8QbSuW=yU&SAG0EL3HLx&Yz47ScYi;&5r*c4l>Xzou3R(;=3RaX@F
z4o#bI;cdqauWkH!2q~qfsn+H32%#!Trs0?(c5`XLf|6ROg}%BU%;m%3Ln^bfqcx8W
z5TPRELIOuJ`ASP>;gvt17k0a3p)))*7u}ewEu{Ey(R*B%@KURg%r+g0y$>t)p<)u`
zgX6F#Zy|dwgzqml!An7JOY#Y%f+s&3^C4LFUd224LukGHX<0J-;gIehp*O(q51a0D
zs+%8DeO}I5d!Htp-nS6Mz4v}4|LcvQQDviR{oXtMZp;HQukC-ecj~s=-%jU2FYy^h
z0VA{@kD@gQ9arB5a~0RO)K;?YQtB)E_Mvdi4+qyZ*XwA6#xn*R4PW`)XG{supQURJ
zW#Ps|FjY!sTy6~tB7+Hk7AS@T(V|d`GF@`A1?BKuV_~X-4@pK!$WY)z1_wegcXy29
z){>iWv@Dt8t!a8**5|P;ue~#&Vw%x@co`g3tAGn8M4JPeWSeq%mM%?%ErR?lL`E=O
zV-!(Hfyj0;nc;^xLgmhN>mtT0I8;DF1w}Sg5-sx*(PoRmEzs6b5iq#>!bT{Kd@2Ds
zM|N*1w~d5dYxd`h-)ho12w3YUCpam>=L|_(o7EvsNpNECbwukX;gxa}n|>JV8snvo
z`R{ppEa;~uCh4Vd4qiTs`svo06}`jZx!{Rxmr5^f=T($`_wZ;|RebumFJ^L@GdR=F
zD}Zdeut5b7?%9j~dQ{pMCanRBIB2u+4I~XXE;F${oLD7q1fcd7Wgj9ZL_7&0Yw%G%
z7um8O$m$MN{14R}6Un!u8M`i=TrlR_ddR<Xk}P(=$?&8U9M#;YMaI@`C-mSu{lQG;
zWbT-0S1TG~wuxs9B#zh7V*{gXP0&?4Kk)LFWydE;@=o*>!B=zsf!!HY_FVCkFARpi
zD{k<@hq$tC_Zou8@tr<}b3sdYw8`>8FA50|-uUecbP{=9NS3o(3PQYza=2Jxo^{}#
z;LC{C0Jz!Z$r<f0Q=w{fx1(3>djbb`-C?RqyU4SI>YEChX2Qxx9-N_hQ=TWyZ%RKH
zg`2R?mVtyX-**2NK;dx|D_ZIF!+jK$N5*r$MK-QfYb(SYz{CNYXgFgMh=&>p^Zc0N
zNFXH8WVhcoIpGrVqv*LYWRa^>H?!7S6(vOVd+3lAn4YYc!Yy%$qf)Ax@{o7HI+TJ!
zs*JLfA4B9cmQ97r!-2xW;z=at)OFsb6$T;VT=8+i@UET;N=5Jui-`rHfU^rl1>h1j
zs8D-IBWlLTgEfx$>~ry-orprbRz|##ku&AgyWP`HHiwMNdEds8Fw_&cBV!RMV3viD
znz&`d6X6Vehg$D@?<m;2uXE<qZ;-^8DMgz=9ro>OqM=fJytZ7%ov4C0P@)rR&p`Wd
zXX}|Zfnk)4*4><#&HJaMV#7+?+;e4|{Nb`>bG4*j&KwwU0GoL-mZJwa)9>);G5!3_
z!F`Q|gz&@eC~_%;G&#jKazAR#p;%h7^Xom*2UAAQ1`Oq0>^Wt<14j}@&HD1=If|?Z
z7lR{+0JDFr)%2T4ofdhya0x}JmB%Pzm|4xFu!`#Qx{v1wKn!YkQ21ekxilpcMul65
zWVk#W@3V2|EUB*w7|8OQr9plmp}yg|y-(3{K{2(0Sv9JL_viG)9(JQ?uH)sG=YEDQ
z@V{!6I>-jG$huyC-2`r@sQbHDl-E0d?T6SRFt8BB-_H2E_Wxm{@A9-M`uCc)YVYDa
z9WFkTT_7P7U#`3n1y<DCe$RSqdVK5^?$?P+if*iIhI?=vjnsij#uujG@rxlanetpH
zXki}6Kppp}{<e;T5~Ib7o=rqnZ3bu$uGVjskaNX4!;wZeY>@r%&G!M$s?UB4b&GEi
z0rmIU+2SP{6@0%6Cn7B2;#Iskt5?>L)b8TCu6EW$a9VT+261q^i7AIrkt)MztI1O=
zC|L3sn#kCu5J~RA7+5(C8xfTbN93z`XoG2B6}~FL8^(mo!41wUb&!B7WR^1tf0iUU
z3hBrJSqfCXOA^UhOWv4>#T)agF43|a05ba;N6tH}5l4v7Do6z<twlNCjK(fV#$3uT
z>k6YTafjc<pDW&+o|p$MqM;LCe7^a7=)*BMOE7lFns38JY1wZO!H_8LvPo|VCuj5Z
za26!pOK^5}oxX>OH8T~q=kq8R-_c50stmUIqM4v-xw9bo6%$6*BvvuFQtV8E5WN^6
zf(d&F0}s_ox%Wq!X0{f50|k@xiCM!e0G_OV8Ke>heyso|ju=v0hP_<IUkt<PBUohP
zdTox*sim%<R&#!@T#1^p;(&%ZzM4zQ(i&<pg)Nb!mMPr|hO@;T8&xg&phhRwvL^*?
z7HlJDoMu7$T!~%~yVw4iyW{y25OY-lFT33`Q9fOV!h*`tGNazvGbM&-pq4M64vkrL
z2lRSk@j=1QagM1W;$_ws`?gKR?|qI4{R#vVS#a}%86Te<I|fl*k@WS}>-`RVt4Dc4
zXP~75uo1$+C=yACDL6Qb^q3nGP^A_0Sm-wy@fOq%ZIVa1yEc8DplmEtpMf4Z-lRj|
zJH$KNkj;=qt6B254G*g?M<>^JXIjv)f3$#eG}rj00M}N?a%52sOA!7+)^MRAo{C8$
zp0xW#%+cCDnA_e#5>p$h`{y*qSMxrM^CA8o5*Ea8YOSb}&3%kl4CrW26s6ZYoJQV*
zix|GWWM?x+hF{&{wuG<qT)SQ_E?5;ht`C-VgmY`6vT;0`3p!L;eX5GGgD^o0h#ID9
zR@yR0_9R9t<Sd{YWO}ht<y40SLhgJt)jgbDrii3*O5eYuKaf$NaFEjTd&uYbWy_t!
z0GB?8hS$-FU3G1jxI;USo9Br_5STbgyIzG~z(?ORjIPKE;e5z@J@#`8<znUSU4_GS
zXyl(QF1`FcG|W81oxenl2bCM~{AxhKPqkdjeqzDG8w@1AyQ=x~ma3`w+rjT7wBiMp
zkY<P(I<H@j!iPL^2<Ss8fO_nPhRC5%Drya5fJ+n1S}3MXrkjHWXf0{hDz?M;s!P#U
ze=Zu3gteycB8Qhs^V`5>)hL(mkpDd8))(rv*6hS6-$m{Q1w%51ViQ$&kXB!=CY6%o
zvwhA~&)qh<&u>`mSx%y4GXBB<@ytaLvhPXf#b@q>=FpP7gQbX@Vb&jZKS*PJu~34_
zln5s_7Q8~<VVneB;lE~D5UVGf7ld0Snf(5>7cui_F-(@c>6n!;{-_3bf<2krp{o;L
z=L~kaycT}weX`34d|vY@15E!afrFhTSfd{Va%yQNfBBk{RV752p^}WcySmTlY8U_a
zOJByEuf7yp3{cfAQ~j=5>mFf~%)4OM;j<tXR)3ogOQ~cx>CtB|c7$>*c=$X?Lj^&t
zmH~NH*f5C$!aqt8&fAsPVI~3R%^Z~=E_vhumAd+fc5hpBvt`1<n4f3M2L^RwBlb}$
z$Ey)>D1j%HgL`X?re^iP5-+z4BiloR2!)#oT!X&cdH5tAoJV&Q6P}o*(~ciorB8+l
z=veY0s8B$eIN0>#`EvNV=3FDsJF1?Y6hp5;{EKqRs`NbY&m!r<`tZp#F-wh!n+j?@
z7M`m%4KwwPFls8&iTs$hP3pj=R_c+UvNioX1jvHE2re#GKD2=MQ{D^svRqmGjm%^m
zu@;=?F9PS<A*FI;4($4%`ggV&gYP|6kws{|gFc4oJ=Qz9Gcv5Fb>G!Q1ozOq$mQ6}
z^y}9_KU}$%^(aglS;jE_*05MqgfPV_ZVT|U%uIDAMxFVuPg00S+gtt-cTh@k`dIXn
zLx)GEqD&mGma{Z&<`Ete!7G>y+Ni&Hj#vElH(1FHVGrp7c8^2>ZC>g<SNIr6i}3dG
zlv2ijN!2B+bqTl3i0-zrN=?eoapducfbg6}kAuD)&cif^3Q26h1AG+O%2kiA$Z_S_
z+{oNeS(^!Eq_*y2N@^aTXy8)JH1CYL`m?8BH5)}5F<H7*lm4d{K*}X1@uey^-d=PC
zmVd<bc{3Q`{J-}-dAw!=K@aj++lujF8Jq233`eoYW8p9(;uFDgXN_Z43sz+!q&B(8
zTpo5JGAjqnIm|11Ob>mPmd)LG)lA!Ee0F*S?T&7*;<@n$S-C`EjE#Y;vIn|g$%urU
z_@D0tRsE6%UT1$bnrfnn>UhaG<;_TtQDF|aorM`Swznza`}0M2=s&cWxW#8-<e~+5
zBoRvg-sRlcK>GpZwVBiCSuf)a2z*3s-(PF<3RlQcL;=WO^sfd#k+LBXS&`F9S}!+7
zu!fCm5#aFU7H%y=r=ytbgiAqj#?@ped&<*}tRyO$QZdrS5fb@kB$IC<#W^o9h0MHM
z-Ryc~RrC?wi2ydtpa5354nBZEugNFW6^xyN<Y?xb3Z!k~59|_3HXrpnMd?w1xRa-p
zQU_jCV=$Ni0`g_ZcD=wh*HR!t3^gc~;03%@jsm{4>QyI#Yq{mouTE7iYrCHsG<`$i
zZutAt=nJbN7tifU=9HS#m&`V{QJu?FF)X37=9J4X<TyJMrf17YXE8v-y39y%OG#-m
z;;&l9s%sxt7m6@7;E!0!N)0DJ;x$5rJ^v=`s$<Y7LeHGS3~;<PqYBSty03{PqZw&?
zj3i#X<MOMc$D%yfAIN)9Ib53yJj3yRwQW1AIe5*ZlLk8M-p)ycOmg}_A$HZ82rDIO
z(t6zMlGO2HC)qcaYEjNSEKL#tLc<Uh&z?$8M&g)07Ro)Zj@39?o+D{#u=s73*viFe
z#LC#bUUEp7u;nHn9XuHG8nM7mdl*d1IR)BRX+mX<F0)Dgg)(y^U;QZ1_-bDFLiZ7r
zrH%e@?kp*U#Yiop=yKU0%>Ejd6Ouk7Wb}EqM^w^d?5PBGzC7aS^iyoXOg>g4>O5?N
z0a;p?iWTbOnFIi>L8e@h<f5UoasEB{xJs-oRz)u*qeY>~+-r%ESq3iF|D<OUQS-No
zdm+FboN-$C*{mhKIP+}r0NrEsh`MH!9NpK~Z4>?g8>3q?^gKxFG|T)#WUe%sVz@`}
zT#%1W_7Fzm)NsTf5Zt~)^02quM~Dmucpx9>=`IYBBEa<F;MHEvRHBUC6a?rL0TeC$
ziSwgKd3<&K4MZe?!S?ne%Mmuh$+P%URB?}q`5@fU^MN$q=c%8M-)N-x!!_;RfLIGd
zw6%o;_6YU2+4VgtjAExWfx?)ay&FhcL$0&({+C3K_i!OyOVxR*@?Ri^XqchsiXBjm
z_j%*w5jorxT{0tNA564GMM7b0R6->CRQ4AXoYh8c3A(wIvh%2W9cy6o|Dfp{gCp&_
zw%xI9+qTV#ZD(TJwv&l%PMl1VNhY>!V`5In{Q7>sdaAnmXV=wh?`!RIFC2^0+Q@ow
z&?Zu8Q$jzx=U-YKQfXRGqKz&iAtZR>Z>A)1nOO0Y60}=IO2*K2!ogbkROV3NF-N^q
zxLuW3ls7N0dS0Mjyz)OC)NuMO-}`%{OT*mf2BIT{rg|OqDJ-k{!zquv-yy%HA>Sb0
z8ojX3)os)n5udigR&sZzl&B8pr{<KZ^~hE%dz9Ky?~fCl5uerv$^c=l&lr4(u{kvx
z7Gid>!2*Y_9xYmh-hadD(@G#WVC%T!lO3Q<6__#2MyFog-yhL`mhpIZB{{-X{QZzP
z@Y_KJ`h74^x!(TMFL*-8^iR48DsDsoDFq{gXMrz@J)Esp$&7V1)Y%wfw-9DG+>CF?
zDMm*_p-1=j6le{5jNO7!d&fxu3U^y+k(iGP<5Wx%&^UKBM3+oCrUwfc_qElwJ+7C#
zD5NDVTe@mQqN-zaszlZZ{1LSdCT-M*<ZXMlY6QQ9M|Xsp=0<qc!Kc!#E{C)I$d~kA
zW5j~97>I+Q15HR~wxVep*~%MUSZ1!nxfiD>w*sCP9{&6_fia;@KDId5l>knZug-52
z(Y8bN72O$eA~=XYb(vNo%1I;6NGP;TQ2W~ONNt5cLCMKPMU#=q^55@w^A&sLoaO@k
z+}y`G&%^m93+6^5wu_Yy{nvZc$+z46PNpyB)m2|WeSnuD&bSc+9}?x#%0_}GR{n@t
z7UUXmvVvPFa1I(v<qVtY-g+|RL2VpHQ$LDZ^iH+$ojls-jNE^Tw%S^ZB&N*C`Q~gX
zLe&vw!K>nP5wly*Hdw0?haxX@9{X8TpIo#8@gMZkgZT$pF|tb}U|Ai_9r{N2p~a(J
z1Y#oqmK;?RIqd;{FK+Qe2MR75k<PizgK*4FR#*K7WRbtXymngr>#2mnz`qU@-hp2K
z1TDTfHAQsY^!If4=(dqif!o)b+JPPQ3Fk+Amp<lg>jP&Mqm{*?#>LwF?XR#uMVmD|
zHjFySsIa8Tar^@>UXs%xIfE!lm+$-3yJm?d{KqNN)GrzlM_dKga0MB18kQy-HE87)
zb@Id~;l5{6YT{Rhp|STI`3w;bF8YD(aE>!-GHVG1*s%y0WKf1Etq+@I+uOeVyRK9?
z4NJjWEl0r{hZP`v3QT#;lx`e1&bNfTl9ibm6%QRU2MilEosav6dHrss{`&G`MO57<
zPeho!jEGe1hINA<eOxFL>Q>Ape7sC}aP{ncNs&mJK_)`1Yt|$y2Aa-^HXAc<u6YmH
z6&ZW5VXnCYQp+5NB`+*&lND0s%|i$(n$rVjhZ9ngfRMOoP|#cFQ1v|x{90Ee$4Vo0
z76gY0a~6VSsQG9gn%nRz;v09P6Oq;RAl_S}6NFV><OAQzu}-16vrIb~vd)i2N<Q&u
z)6;<$L6fJvN#58nH7uV}9y8=HM2ICPj#I{K6pm9w_R<+rj#I!L6~uRwt+OxW0^x}8
zZzzH-@D}f{x4J*@c9;{o@0ZD4HdfeDIB(WdD6T|eJ}dPE4#i;$ymq2c0?)_ljT;8W
z!<e=IS#Nm?MS{*ke4O_gj9^`yK)g!SvEp^KcDp82byD23xy0@)$>mJIn}a*%p8nV+
zE%lGM?>6lLkA%Ocs#grF4a}St>#gIlAldJKNdR<-Fi#b}qcW>SQDCkn(noT+5G6P$
z%M``F<V>wn|7g70OM1ayS+P(MPcX)g%syxpTGJVA^@A)8&O+gJV|lDMKeJ)MMt0eD
zbaJcbH762jL{atwSJEG}x!?^Dx_%Bo1(~lYGTTy~91x!0ZoGNu<ho-Ii!I5Fw%Ttd
z<C4-NDDe=(QUXtF&8Iw@)+ybpe>yA<JSZGXqf0O|&48xxi0ep|8e$}Y?^>T(0TsZK
zvEtZv^-krhUw3qWyNApk9uOpo#?Xda82AwTPh6b{U&NnChq}w$A*$26(m@)$YQ~rU
zFeQ)b8-ZuqyZFUn*k#y3OH<4){_WW=tUl|Pgxx=_>01xEa!<;tu4K>B?hM4M!h5rQ
zQX&>lG>R&>n9Q)YF^sY)ax)VH(O}cQ5n^5aL0+Z5axB=6wfn6BSr+rbXe8i${*fF{
z2UFd;2=P1|L_;Hl9K#^>g!=9^0)70unncinF6-`XbF<^^G*On?$2S8E$c{5(iQCLW
z4lRx*K6A1tQ;+vg+F*?ei8CLjM0$;-unJ9x;?Xy|yr$UF<m4#RHb>gESp%F?;X)Z<
z^Mg`}h47m4cMSeK%hX@P12bQEL2n-{1caxA8nlATjy<me=UXWduA`d2s;;VS5`p?h
z%U>+&g6N9^Wwo1blQNbwG(#ckPNY)b%;~tU6R8h=L8WdCG9j^6-O7+N*H|o4)()s|
zQ^=D4kYvtDQ`4u`j3CgW#i>pfLmjS%SV#Stbs*u|kFx2xA5B<;ab<SD{kiKVP-S#q
z)38iW;JVHSJsJOL(x81GN`B;(<B-EoW3cD`MVBY;YoqT}><v3!B*XqlK(5dq+sAhk
zFQ`-7wjDE2gTce#1DC?0TiLUXTxztcGY>C=^kz$~_BJt#r%+foyzxoKYiaCRxM<-c
zRcNZAb(>;En32B~o*i@D3M6rQVg*v!JLw?V(g*xYN(g?V9jh~!z~gpDvb~0;8bXlW
z@_S~kC4WB2E_DDQI&S;802409Wy7Jay9`3{YYt9WAk#$`vDW8+Bj$P2?)%Jto5Is=
z-5%(V-$~X^USUrX#>wHUI9t!ae1I$l?3~Y?7_tSFX22(acX*4_1j=4a85GXl+<k?K
zS_)Je4N*A<&y+7Ce+0OJ0e~KO$KZW!l~2OVRj~;HDUd{?XMjjB0)lygl+D7O{xiQO
ztAI>bOOC8uB;EiBtIPf!kEz$MpWn}BP&~v;Np80Sl)dOX7fV9L$j5BZ$o!EH8s&3T
zDq~IjO&osTlQ_6fD2tiem9Gh5#~WCaz`oWghdk;oUIxwS&~(w^)?sF|B;?t4*<_vf
z`$<#9=9L&SsSp(2@Fp#;a`$}yeKY{EO8CCS)D_ePPlJzeTI#d;fJ;v<2<6;=Be=g8
zcWvORe}>i@ukRcgO_aH}Uj&0s0cg~YV$Y=IQ<~_imt2L)0sSJmIZcX%1O7m?;lBu-
zgC_ggEc7Bp>Wv*0B^3DX(IW<NW^&v)F?VQ$()qPi9E20Mln}rO6oC_j&Mt+-Ze^C&
z%1Wabvrh7+;jblNG6cxIP_r?H8eXDV<%5jkrdWbrJKMCD!@b-4(0#EcFe(&R9zBOq
zrXL3jf7mh+Y-Nu0<T!}g;xi^`0j*w3mq-k8q9{PmOp>pj$ix~O4~}ssz>zW>9TDO2
zJ9pHl!j1DTB(8BxU}U-?_k?SjDxYE+w=_dK3-yQAHFz+5mZHYc{f6Cc1@pm!KuR19
zYD;$L{#Kg+G<NL5RZrKAmcZ{(3*pyU?f;@I0nZpDFJ7|&k0_-oyvU%P1pc3@j3&7o
z`#JnIyVEtS=b8UEboVKVZ*>DyE{MTQQ>mONiSd_AZEr5$5heoH?58q6I$5!CsHh;9
zS~z5i=pWt`QB7<V<`|v=a#H0#M{r!3qHer-Y2gr|6=dyN;DW8m3uHJ0!*FeOH+-YJ
zC|?%uZdX@jtWA@ezalfernzp~xq9vbzL=^fPQhGj8%&dbx+m`gOJb~Y${bX{DfJs0
z28%J-r$WZhLyhqpUxZapO=#<FbwS~@?ip~=l?mAEw%%8|7P!Bxzw(?oQ>S6~9)(dC
z;qZoL;v)cMre2-Zfv~<gbKA&WLYSv8e3zIsZ;d!B1b8~K2ks;7g3&&)FW^)aaBp;4
z(%Gbd_orR%+lIi;zq($@+0h^2i$Y3I-nU@F&QRJULuWAp9oL@r7!{E#&aUOY(?cr5
z@A5pc9I&#R?865*6lRawjn%F9bkn`XDe&=4!{Nxia|yjw{4W?;hf^yQ)Z=EX!&hp%
zl^8>|j9ZdhgF>=z#Z9+!F4V(lLih+tR}mX%us4aGA2F*veLpnf)bbdobq(Qv=mT1&
z(+^qv`>uYP%0mL3>B5mAnW9$uXrLIm{k-pWf_Y11jdW_``=Qf07YTDoG!U*g5woYm
zFalJ!OESlc+g>}Lhh+!-2f(ITn_<B#wL1jB(4nR=B#MbpjQY>MZMFUR=7Qphq^<1I
zNiqnXv8?1-u$}hzSTPjl(c2_x^-JK-`O=5uI}lKR33hM~Sy{PuHCIu*s06e~A|i%$
z*@v^q9dXBd5UseYikzdxb**wRYxJ7;g1)Y5PEi<KT@v4Gujj-%io~Fc<?I|5Cn|mt
zOjc+&Hb2A0ADzr+aqQ;e5qb1d7Jk6Nas1n~y}y#qa&ofZ#tXi`JztN9ia%hDUTo(2
z^A=0Ayk3VocS&)y2&}}nF?HjwJY074mFr2$y*f+_Wb%t5Mgf-!>uicUW;~^BQ=O-U
z`O3}J&kQAE0I%Ucdi6O^atDeZy0oUbY=!92>}aNjRL-tY4&b8B=FMr5KegGWA=pav
zJ#g1=Zu`>3AYt|}F}B8$0n{$<e$Vj4Yv#6D_&pzFA|d-bumJBzzC0F}!%4J|{o&ZX
z8P85Eicx<ZkGL!nP`6wNOmzbVx-kRcL@|^jL|}<2X1H<`ld}mHGAS$1&9GSO!2$MW
zS!X)6n4suTJfkEV{IL|fZTa)0=SOufuh~9BUH;EMd4=+``>^3&ihh@MTyNG;jT?4a
z$n60gQSP^-+q8BK4HBeCcO05?it#46oq&!?cnA*vFZhN?o(U3KL4h)G{sSlnS!HC$
za+3~gbSQ8P<!P44(6&m?<%3xpRiHzZ4UY;dlRW$WkyzWhRsCQ`%r>%iy^8so3JcEA
z(rq8zqky&;Lz(kMMRV?54FfT?h?MPG+3xOLU2c>_Z-DpXi##!Yw2$XMuQ|y%%Ia2g
zvV_>lqL;8w9s}>Z^i3$jl^8G+SzZNbLOKZ;QE6w>GMc(*DkwULWp*KbIA0~zdvVSP
z!Y!-NL@%hXR$<tqNhv}iP?g1kC*(j^g`wZUFEOi}(c9wZMBiBlCIL}QL3!KZF!$12
z2Sd4pd>s-$xb&g5&9M%{U<?9GLYM*Bg^DrE&0k&k+NCMFY2ZpF+s-^=2PJ^-;+uS^
z)<#^U2|&2b#KG2cnBi78@^Z~bNWhFG3uW3RS5KJA;Fx+VoIS-9`<|)415%}*pmQjU
zl3BcIp-PIF0bhSQz4yqKh_N#<^+F8{1Di3XELiBGB;bMmYPZ^DOZ@>XvGKO|pG(D9
z2Ni)7rv9Iy;BJTn_qPXEHQrkm#rOizWNaYq_aSli1t~-)HIccjdbzX5nwlo(Kl4Sx
zpEF5>O}A^d0^s|Gi^P8S=jKiURf6mpiAffg%}E+62t<VSmFE|^)@O_3n2XlhdG7u|
zajFX!qFKs$iBVfN(n?HwFjjP@Q1PGfMqu0Yi@K0xjKg|l5kK3AEa2f--py*q5tVuZ
zweOdc1h3{iPtV^T58Z=#yF<6(fD_!8IUTOCAH?*K{TVK2fpp{$;L1<d7#gh8)=0TK
zeCJ}p%*lx|Xc)7?+Rr{a8;!8XL?qhuYgc5U(#DmFS=0&wQvwR98>>E}KC?bi+gM5h
zBuEMZ3Ic7}4zo5W+3S{Vc<k!bZFtRLYpdA>!4BXwmh5d)J;%B$)Xrw_R5Xof(-}XQ
z$i<;QLm&p*;5v9FPC{A~lDs^-^b(`hxT+F4#&fD=LheEKiB#TFyxPF{x;yR?xnPx&
zVnRT{>{Th7!)-4073(yuh^vA_)hbf~lMBCU8Pe_xgQl&?CvxV&rtd?>igU-91Xy7q
zVI51EDukDj{#aNOhSNi%O2!1!Hsq=y0}p2UdzA7Nph;&b=suQ+x?7%p0#zipUOg79
z1Lga)HwyY^W@o=+sx-Ukk4F|UV3!vFn8PZXY|7rwFuv(tqFKk<eLtbwA`RnSBLJ9+
zMX?{qlXVF1aViHBboK8DpXHbx?Y$=mGdPE}DIR@|ZKf=O`txw!OOR~E7y==}NlLMz
zf{CG&9i=<q0CYRssG-(U=1=qpWmXMZmAM)uz2~lUs2P3s=0*llO`y+0Fr}Yulp~{=
z6i%E#yqc5{aRhO^vS-3ZxXDxeCP9QcI-1yK1tO#nR)`}6{V58>i{%SL0MNWJ=wEej
z$72Z3_G8k`no-T8ztgUFd1eO@-v0K||KEGv_(GPl`NM76loOcZb%p%VVy#LHVIv)P
zT`>XYk=7GME@24hI}g#mPT5xJ=ho=`NYhPa)CIWItFwc2q~GJhw=Lx)VT+C*RPDA{
zdeY}{422%Di0T@OOuQoO6XTj_1dx@8gBA46tFDsrygFPhtaCdpJfJCNz&EpIkDu&w
znsyCCL%Hv+P*6lr0E+K!7ubyPrtO1)NsH=vd1mb=XIPhyS(eeFIohVJT^=!3bbulv
z@Ab8m!ye?cCSbZZ`aTzYN9i~f*`oq`r3H9IyMxGZjC;qXvr2cIyR)6aln1kk!;F}c
z_SF*0!c>efHlShmd6I%fklRj%^v`5YR}wN8(=WL+WJMTe<S00MU*AFj-vP2R<T=-d
zw`LfTng;vw8I-AHA8NV`aM9|Hi<2TUJ+btSWpgAniswc{TTIw{u|RV$MfyhOdhm83
zi{sAt;!yB_h*k(pPIX)?YYb)LJ=EZQSbl@6rz}r{<;jhW<;E9&`n_-lkhs)+T8Z12
zBgoCW<UzF-!0C4!X%`N63c^JxIOtawbdFsVQdV|u9_1|Nx_&f*6%Ro)&N@cekq3;?
z)nHH<Ljpu|lf89ubahMviL!8Xtd*&QDTv=?_q&@A2AHB{cQdAC&;=G1E$ucZ!7+zf
z(qMGF$K5O4h5&*j`IyS{2V#2A;GYx5LFX(<BLn7xAVJc3oFPtQgkHhBU0bFnN-J8=
z2#roEznd*g1~JuKFLmcd=-xO-Ztwed%fKy#h`cft7WyD#W|REyqH#+fNB_4q^fF+l
zY{}Jj8m`ti89VN&$|ctTxYNb>HVK*jbX-c=!B0r`T)yN$-D6UW2Zu_$Hz8i6`1`l{
z5$(<Iy<zB>3K)+ZN{?$-TXWA$D8tK{n<xjr^<$a#_>_eK-0^X?U6Z?badov!-}Xfl
zAmzrzVC6VXrL{0ahuuxaqvx3Rkf?b8EEKe%n2x7Ksl8#=1F*}u4Y|9{@_ky&5N9%B
z;_#!A<Fe-rf}b<HLT39-L=NFz#$As?K^-sGR>8?4zwTq?X4MFH5ui7w97}zJYqne3
zBx4<ZO;k8CYTRRmqSHER(5t9u({eud>73_6Y+&eUjI+*$NBxDDKeQLPJpahS(mIXR
zx{44jRZxvxMUO}c)&oCj!)YYgH%DpL2*%JWJ+I2%w*qg|t<3I>q_D+@f>T<XO{@1L
zr{oV4fh$Um+>VFVt1}_VSgV^hmEJ)ahN#@r6}3r`PUqztK5Mb0+fum)Vx2JP$<xe$
zEiWdXSV;{ej5^t#^A~i8cuhhLcG}jGl;dT~V3+83^3tY%uUZ2?k35lrlfnOCBU(gk
zVoF+4^P}d{k)1pD&O*Wko0eig$C?HAY~*Aw)O2hGlxIpIi)vymfN@xM*?v7z5Aspy
z_JrAdnV0sqXDRU+`88kiZ~pntNqzh|nKv_W{>xJ&d=pB4pIWSuTl}Z!AS}!?tl&?q
z=4x~ye^u1qTb$p*N!4q?R8DP|5;ELdpXNt@HaEzTS&dB0-1`HeXA}xDZ5A}vAIUL(
z(Kg#L<}0&Ztq-D<*_n|Y<Gn4WbgS2)`k$8DXIWk<hr)7`YR<_TFgYl+!*vO5*b`TV
zgobH>548(kqVfXJ0nb}?oSKPI)n%LtU3ZAUaoV-xgeQ$QG58BVQnF;nZ4D%qX@Lo7
zrZP1_>!HeFLNSMm&YRQcWDHhaU8w;gnV6AVBCZr&A!qW-I2f%#`S^(ReX<jC*fQAl
zw~{8-`k<j|aM;mo`Rk3QZpN$hWZmO2*qe#RHT{O2_cd)XMN~+Y7*j-Vma?-gQA=&w
zd}I)qqmYo|bf4Z@U*5ZhS{j=sU;JS~$%YbxC<_|;O_yQ+vpn{9ggSMjFIa`_kmYZQ
zQgeON@|>bQ1<zNiu;7}AZ=4Do>q|c-pKa*p`zwG2<TXV7j8j&i_UubuE^BQbu+R-n
zs2UwCV7%dA`1zcyhta-O|6U)4&}0tV(MR}6!FGuuCbS@E@4yurau1?YVberR)eZ1R
z*^JbA*quX};I@q<hf$Jcd@jj4jKX)q(8-d4F(1hR*9@1ZL-|!_9pVAB^A0)mr{cPk
z!Lfj~)eg_EpN*rPV$H}oy;b71(5a?IQ(N^4oegxQbGM=bbvm#DHUj@53d1sD?mkD&
zL%YjYo%{*+exbZ4vD}6UwE6u3ok51{^$AO*_+Nw_t!ZajrDw|rbt;3G)~ZaF5z-w2
zjK@#4c&Km1E_nmY{~Dz8^2H8icdjbMQZQZKU}<3cxG?h3hBOUTsCXBLSD$NtULh^Q
z&CkiBAw&6Ux8O9B86fhg^oR_%q7>pF^N_*}kN7BOLw|7$XrJZ7TQfS#WLGEX(UztT
z7_2iZ7J+t;;Pd;f23SF_he_|$9Yn=C3^Des)m;#fm<Gi)hi}@NgBs<tR3Yop9X~VV
z95CIFC85|pO06kL`!7@ji_56c6o->OvXNbjyN$||>bJFppAE~F9yZIoo^c-!mal0l
z+jqYAXTJ;cmeRwikFCV`+j@I!85f}WY`o()v<T1riWD(yhX`T{^S8<_GTHvt>Ur9n
z1;vQ@Gqs|ho$ZjNIX9=o`}goG!1+rtSij<ZEWt_qu9AqR6!5Fq%RMm7EP?n4Wl0AE
z{R2;4Fsl&vtBML=Jtuc(>0GJ+i)1srInS)rE2(Nybx_pLE8JRpQv|DqC?6oJnaw&Z
zOG+?(Y<1ZPAqwG{(Q*usgcW`A6Kt<&y|iBtl2>;24JD0GP!Tk4Voc6=f(pgRDN?ki
zSvu*4#u!slnS-<0gTF#9r-S8xK08LY-y%Ku;rd4aUIpJTsew{Ls13e*f5_H-8r)O^
zqQpJUD9X6I)oBO^Umz`c4*`MDpb=1~rIwWvKPB5Qu5tAb7z)#xMDi_~1aSK-5TsoA
z665rIA<*XJND#4fZO{d@a<*rwhoVCqo!NNNQsX6ujS9vw=6lu7#n9>-L%?SsbPa=K
z3dyvBPu*wjz$>@=CLK^{2&0=;(ZnF|LR{Uj4k^CKho#DErb#<Dw(ifgg<cIv+vu0h
zUc?^i5nt9$hRcI4PJp8q-S-zqiABW$7l=7#n4IDcLo#d(4SWA(c5au9w<rv2Y{)4_
z(5g!CG|n5*S^i`9l|H(NOL=OWdWyr7Lu;7Re8+UdWkZZQX%{emEM~>v!YOa+G2WCi
zQv7D!+=smzJ7dc|5SE_3wX<8~PQ?Y=N?^=enAQN}BNGPRT<ckUEy<*yYNP`e&V0lX
zhi0tModF@mM4L4jHsJV?-hU|a+?DyhmUvZeZ<m<~bUWiC47qi5NO55rK;cv%%>@gB
zQ&l12y+ae|`d=-;p1H*h-C#CU*ip8Ve1?wr8nCA9Om)57=>h8!lMw@Hz|L}0Qyr89
zGxzFIf-7w7{l*FAN}ih^Bj68iYTau4;7MEbl!CI=9E!!~ep+Imr8EbZrH+`T3gl+H
zB6T}*Msq81IhD&!Lt=+O$}3`1C#YdQKR<;dYZY{WF2o!Q=LSwd{COp<$ez|z^b*m<
zV%X9jwK#hgxI!-8)=4@mtTGHt7SHzY6y%znGbEOPElc=5(NyeNBCY<s!R3FT2FKa!
zn5<05_{~E(@AwJwhYbchGu0!;>@E9vYuR_89dPZdWbwF_p)_zEvIrDoh@dHaoooPh
zf!s|qQOGT`<7$ETRmhCypAicP!Lb)IY#WIIh2tgSu{5P*jpb=#|NLV{R-{1u9xOg<
zk`Zwk^($wxg+Djxr}%U><m%dSvGuXAP|@<qrhn9S36Q)jDss`yZEkk<b<+ZP-~5tx
zu;3@+&xZWmCGZ)>iEl@?>G+UltT6IhRbDAW^NPXqxg{G1Og}CkMJ0}}(%`ITkV$-_
z`B|-0_**a^_Zc}vT{ecphz7A}=RIRW38+Nb!KO0^<tEeoq(p<YBfjfqN8gHJnuMt>
z3CVVIt5dI&L2Sw`s5YYwgm>?`VKpHuMB<2mpp=Xe9juE%<ez-JD;-h3A0x)ZO}Byn
zY2CP7D+37C=(W8d?kmMfcLhXk9P3amTU&wvt~ZlSHSq<7YaMH|B9p&vZ7@HQxsm5R
zHWgD3#wF@FuY+ylax+eY(Tq3%kPa+4+gVKjU<OvJ&^)vZE;>0W$3|kTSfj7lP@BZ2
zz}E$2j*L1aojW5Zxi!c99Dy$alRHA;nVFld6so@ObVs=g)Ema-)93ep5N2mOuVC2J
zdxi%Or2v9*GRHA*IDni7;+VcuAm_JZ37fKDbxaT2nYsl3xXR@Ug|zji1Pr=+Qus})
zNPX|XEAL1+*R>*|>fBCwob?^(cV@tjR0wDFKR~bR-?4=(3Yor#O5s3YQjfE~$bk79
zPrLc^P}7J0<}Vr}Kj3yDQaK0LtYp6id>nSp3>_!pPe=6M%<0ewMCc({q#7FO_}9Rm
zzLz+tRVVRFu!tv*j1~c2@+>7D?kI5O0|l>ET~jg4Ypxbg&h{6v>f^xOF<nMJefO#v
zZz8Du$t<0!(>WU$8*E194Z5E-zI%VBteFUd!{N)byf5c5yUlm}YTMB-Rm>6>DL9?Z
zorj~}AkB7sZo_n`Mp-3p=OnxzNnmioz26UjR=&-LVAvb(xlJ28p&O73>a!D#qg0Bm
zL|vlVi#bf`TyQfS4;f8osD)T18pYc*Ib<tyXyJV~gwR<QQxHYpyHPuK)uq^*WO_n6
z6TA?+Wada_w0#x2srDYlRCfRs|G>(uwEqU=_U5=ef7S#1-}8GbXWwsjYj@9@0`fh3
zh#}6Cu69>IH%5AuOP`S|*Vdm8sd^TzwuS07Z|oI65#+4c9t$tDfoaIsgKPS#il(ZM
z77}xWoLH^k3V4l9Tdn#7ICHiL5B0IPa*#w$_<VnxB6+R-Z2c~%iQZckI&^ZpuZjkg
zXz4J%TjKD)aFm+N^)RdSw~|Pzw7aViXhch6nU!#x;1kZT?B?ebv-!JCgm_j)U}jXd
z*Xy7Q09Q8BuX!Dr4h>Pq;$JuiXe?W^^Ty%WT{b3F7#9a%o^tR^On37J`BG-3&@*Hu
zrIi7WR|v}~n!?*hHk(-&$Olv%FMhh3)W$w(WbXCZzprrx8!VIMnLFmCAaXAv)Wrlp
z!+M{bo^6OXx0ez{y;s{Wl>c~gTsF|2CJfp^Z$^ML)o|qTa}kA(3Ud|&S~$uudDS@b
zz8O>46%?)M;%MbAXx2hpTRJ+aei@}AEDy_EJ@pVD-6@=_1^~%{WnJ;H3|$U(V}?-D
z5P|Eq1^*9yGTuhj8JYxb|M>DGa|S(>VdI=)upze+n-FSB>hD?9X_NFeOQ%aS*+1Ww
z^B22PaRrw|rT?w07c-xK(uexo=+P2bgyN2IDW%*9)P27byz0rwmL{k9N9x7{mfIWP
z#cp&P`X`(Jxp=!?>!;VfxY-fer)i7pZ2nu<<zGa*`gy>m{E*raALRaIob(>Ks(+CE
z=e*1Drwz!HTx@Rc;M?RvY`H76B)YaA(T->1H6(AFH4(W6Z+WU9efJJ@i!*89z%z|C
zWns*dLJNry-}NDNgxdsAI4hf<3|do%QkObSx;xrd&{c=iiJ*=p(x2+Kk>1WyPP74^
zy?9_2zL8P8o6;~k=-^Bs8#cPKiqG`J4$6$^6t#>Tqh<xNbz$s!nwa+OOQ1N_bD27w
z>F}rC`mAr_<+0`?-%KE>g*sTWzt2HS@YbPh7u4i<Da04k=h915=X7@d81ROchG!r`
zT%dy;V??_{x26vX(rsBCpscw$W#uG)HX{)b`-7=Ja_007je|fDFQ!{7*m3wkKq6wc
z|1p=yJ<!!7<@}-jL38Da)}j0T-fczZJBj7JqF^{*LWGGw*Tv45MM=4QNDel3@jasA
z@^|G*U&W@8<KkZ%Z3i}sm_G@i_z)8Sl9C<|VE)<*idu3-FZ-Cm%?;Mn3DvGN_KlM3
zBeLnpo%YFe-$K^$){Dt6=crLllk^ubULtC0rq2~sHM`7gPtEv-z=FeRTVJNzJ`J!I
zk6;a#Pc@vGa5gp&;Hk0EQH0`y0<q<iJbApZU^6tIDm6kg^b$u}tHY;sa9~2Nt<8gB
ze)i|K=>>@msS|~l5e6X!uK3&hX#ykCS>8bj8kAcKH-lVdFh7BC3cZS<Kv@c32h;M5
zrFV4WA}Gs-qv+}RDTKwL;7EUOTcZ7mDmzO>(snB9murKQ4AfLq_0Sw{QMi3gQ2ui@
z|8?DT^Yz5?2;*zNTa?e@MH~rIz(&?+1|%X*qVh!_(!4}&6Q#<0ORuFzL1A1gNa_L)
z%z_$=Oc71}Z4JqMbrN#Z$&$IJvTr1Ool+wET<HR)cISbFgix>m)I6vWrsWSF{tkMq
z>*>>T#(l0p02F_JOr8YY@L2QJXNfu_EcZ!7z7CY5B&GPRBu~f^wPh`MKD5OpUEYW`
zMMT@+ftDO>L(fDh9A8MPm04I(m^=wvgwT?zR7aBIS<!v~!?$sDYA!Wg7AZ0nC3qGa
zdx~OIaUv)(aaKNqiX-IR`3&Rf;-whvG9L!HGp&U()xkK9?Xq^ozR1AF0Vtc+stznJ
zU^%k94R1<f;Y_M>z`HTfO|UJ<aPz&y_;t4Y#2IqHuUP8uD`l9acHF!_6}YUb28=rx
z)RlPs{h5jY&qc0zAT#_0sY(qiChm%fAMS6<c;3#6oT$`VcM|hY=Tx>Bg)WTM`9hCi
zPD~9IzuRJ+D5N~(*zO8Jh3x+EAvJ_lTrCL(H7Wr!`a}-#^(KKbmtSMA`IE(9$(Q1T
zg88vVoe94(v)O4N^~}^nlF@;m;Eix;yaLLw_rRrK=j<qU9g?moa}~@Wn<FQ4fy9%)
zYTw&%abotf5&b9$EL=(QqEkr8=fT_gtkHq&vc1ApIq8-V=ArTvD<nAtQL74KD@@qX
z&unZ?v~B6Xp;vGy`lgct_U}mEMU1zcfNR&Wpj3cgnFD)$e;S#3S2M#x-`IOhm-sKJ
zx&y}Ieq^Ff6KJWZddeUorO&;Tf3i`TV_b*kt}Coxed3#hMz7myt~3HJwj6xYHHmi=
zX#twBd|eVY-qR{r#}pJ8XtCBwy}A#Yo_#~->|r*}{YtKFe1k?~>-(%OXc)hmaFVh#
zML8I_JKby;3>v9)%y#r+$hA0%>pWjg#7PewRbxDcFkNc_v}9eecgQS}-0V(Es(wB2
znQ<Rb<6?=To|p)z_Q}#ViHUhIGsD6FD^)44q)f*my#tKBVF`Ey4=mB-A}*z`z8FjI
z#iJQNLw+SE2tUs`1gl|}p@D>uoLnS;Gtk_a_uqhD$F`5l<5~~hG<*H_`(Z=m9fT-b
zoM^F{j%k_|ez0s6meVx8f^(e*Y~{2H0wSdwMM-H9e>0UQ_{bXM4oY<igj!=G1k)r`
zT|fk9j*A+RV*hWtPTw|rTlq6AN<P(Jm7h5l>6j_ER10PZq3ie|T*h<GLrpsk9PXxZ
zjP{o+Vi1>*%g#!d@70%RipIWgYMa;qu9xPbQ<q>V(tCNv2t(FFXJ4aCsu4uKaKP*g
z8%lX5QE>`*^I&JkA}l=ZghJkCD&d%n3VyEH)%863Aa!F3kxsHe)4IZ8;T4&TK1JZb
zE^P~r_?Ym~C@vaZcqz7a4BCC|&C4Are(1K!bd>&f2^L<4EICu0Ptx`n&goAI4`eeF
z9qPk|6^F^4wEtoWeV|wZO6JFB;?;1wM>o*_a;C7qDWGM8`Y=cO0L$d!F?*UWUwcRX
z4Rv5HD}N%y=sdiEG@IP^MNfvSX3MrFRl;oe6mwbnLXnJY7bm{ev5N~y{yX;NL!&R6
z(gAX%Z&93@rFQp1SnH_FH@$oDLub_TO63bl9C1cMR69jliX*}A3+bGR9mxBf*jR2w
zN*cvVoOB*_7qG`EkzLT3%^2GC>}Pv>K0}>mSIB{;d0f0l(R75qEx=;Wff6HjtP8yr
z-hwWDcm&9dr;#l=o?u6D>yAu&*^2(G$ZmG#G2;;jb~Q|SqYr{uhWDwnLwp`K=${ON
zET|&KC^g!3VGo@b#P196cMo@i4+Nv}9J}wH3Y`J=yHjn`9hM2iq~3Gf6o>d#nH6Q<
zLnK=1<!n@<Y^`g$xh8VrYs=)GN|wq1CCT$vxf8Z3Fc(ph5GRDe%iFeV<fe4aRdJyO
zX8PM<C4M)jL8jCa#S-QwWaLJy6tt~Pi(ohGhL{^2a#@HRq0Y#d@w5^SwATD4zYu<x
z-gwHEYJFiZ5-;vp>BVOEVYFa6B8G>V6apx7porH1kxKC8)|G7ZW|5)>0GRCaF&j=L
zQ`xY6tsc1u3#jw&W($3|kQ)w^atkgqTx;mUY?00cR(McqiUDL(^8QQ%_67l(Dlqj<
zee7wPZ`sL!LjQ9N;~N=odoL?cI!$Q#zmx{_Q7d56M2{PW?K?|VHD9mU4mP#9NP*%A
zfBK#q_AE}lt`gipsE(3o|7|rMvf+AuYU?$y?~oz%nlEO+gv(zB0&V*{tfxf3ENAL^
zD_hdh#$Z4iRrF3jN>*c}2Wt~6oBiK0-WGW6&IDBTHH0uU<}J#KZ?IF@iv@ff969*d
zM!!21sm`C0q~RAsPv13z5tmWmGwNl}o5EnA*=PqkI*3@8#gGrmZ^t<c975Q;?I--8
zMYByZW=b-0ieku&({%W6)7GbsMuy$9h-ED2!^&|xbefa24!o0FTGL8!13C8vF;@LR
zzQX$*Cg`gzC}q^stCa$EM;(+cYnYz@W2&q(B<B{VsZ$=z76MU_nPVGjydc>RmMx(}
zOe7aorrYH#Bf~8P*9psyF*!W6z-v7(^^G&BXO6OVghfE8J$oTme(4z=id2#VTb3w3
zd7oYGC%*M?)<9U=1#CH~mjRW;nT^~TeP&a4B(p*EaGt8wsYZa@sO`^Sjxx%Im}eyS
zeRnf1<Y{+Z%Kk_TG3<_{KXx-{(_EHsrozi{Gi30r6C4h^SbDS(2hJe|uuZp>4B=JP
z4O=TY&YGT-!UX9I;Pv2z{#-(mymvTvfZ2a`$N+fd?IO#5?XJS?m@9Gtg$%xqhV2OL
zqQj{Z;iupKHCYEP=I*%r`o0qF-VuoaIYfZ}VTyJ;##!D6SZ>ANo<~Ij-~2kJTh8<U
zt2XEo6FQ|zx?*-p>b+<Ig$kC*Z|;Bm>y3}w1`}$oW$mr6w}=5JY7QkT!OS(1l~R|5
z5wM7;O?H&0L-_u8$$Z9)p|S4HW4|nq-=dt!A>X0=S*C*7%}T$#?r35~>e7iuEBlS}
zr)=hml$NQ2EY7`+v|YDqu6r>zo3T=oT$ZIgh~E;!4@X%e$!XH7-J;1YbwLlxAu4JX
zl~~uf4KfyqcdC&QfnU-@9k_ev(aenyZ{M_MPOH>*3sw@E07z$MoEZ+u%O(nV^>1fq
zO=w$9hc81t#Vv^my-RrIbAaz|r$@2Th;Y|kpyCd380|ii-VNhCA(*ckGoM$@_4G+y
zcTIZ!V|n8_oHIj>a<50`jdHIu1o!lvYQqDGs|B2Md^gvUIOZkh(~|C&A^Hs{yP2e3
zTc88-$Iofw?UA46oTj<q2en&)id?^uS7RHEu`m;gMcD`qg1(;qh!a|YR%Nyu)SX>W
zakhOE_~aGz<n^^|{IMJbqPV4|ri#3zih$a=jesRQFZ(2)`ylK?Z@|~vt}&1QsKCzM
zIcPSY=cDtR)kERe?oH6Q>q&&xuh;w_cb8*Oit3jq@T@`j^LiHBFP@6H+A{Z5H)Xw!
z5LWE**_L*VOpC`~>Y^yb3`RSe%%HM%Z=$V;PCu&Fn&G#o7Wd$!5}(yY-cs_c$qy)4
z3q8JSPKcR^g>nz$DEZu9T<I(2b>xP)7z_Fr>}QzIH153am}$b({9IUyq(hYa^JI;x
zR`WiQRptfmQzdR;Rou_-y6y#}8M8mbYB<<_?E{sUzmXn%^7WIjas^>_JJq#A!Gif;
z8ME34mc~ib6#7UzF;QIP-l<Z}ttmyVTBBfI_PvB!6l>md!74Bcc18ReB_z`6$TQa^
zd>?_i%)h|ns?aQF`1SVQCjw0#>-p%0OM8A!TV?2OVO-tqpyG^m4;WjXXV|+1N99*z
zzh$BBw7+vowwtykY6}G4*Gi!691ejhHra2a<HZiV_u9FW8{-B3#|rw73HKQl^c<z#
zVDyXcKP=qNU82{2D2W$PL;W*oU1o0HXS}*E40}OTq4$ITR>K2wz})ZK#^KHD<+RAB
z?R+<9N%d4ODO3prf7SXZ#~K+SkY5UhR!`bamk>Pv%Y!0_jpM8+Ww`H;r5m<Y$m6d%
za)wG~2a5}I(XqBzcO}CLX7sU4Mit*w=DPNLd^%2S+HokU+<Th^YJRRm&%_8|_+BVK
z9CetGezAncQ>xSxlDpu#ZkyGEi}>jHjANPRwevr#ANzCrRf_h6B{iqn3ydG?h{#y&
zGxzr6Inm#=*J6OA5zNauJPA<qg~_SP0`Ln}#05e13;pu4rlO>Tw|##R10G)Vs`g!>
z>&hB8;hPIeS-`^2F<uACRJ3avZiblI7IaNQx|!(g%~QB*``>>&KFDE2q0}R9Xk(BO
zRebM8L|`B%HYq0PCGorGBKa5-FnZj5s;EAfKoPp%M+th)zwx)q|N0MMCGu!40%92k
zC?3sydI;o#SaTdGBJZ~#Yxftvj~Du*!BF{tw!9o*pfur@*q$nJ;Ddz+Z*`=h+md`*
z_Wc~~{DLDP!u<Kq6(eb;2Vs0zqC1D4Umoj?4_An6a9J$jSnlpVY<YYBks3Pr#-PF}
zGP@}Pxu7P}I#-$mF9|FOo~O5X_H?COVlce6D^h@K`AN#SfgOTNeZ~&~x5jh@`_Ny<
ziEupGnvLiPji?T@v7z~RXDI7U)76>Mfm}rxljyveo6wizf?MBz6y;>9Ri}mP^@&y3
zqRJ~>6l31W4GWas`rC9&*-^*w*>lGRE80KAOmzt{MqJmh+k2l`V2ljJaS!YpV95X0
z#m7lw!1;Ol2tR;Dn~oJOhIaVFN%&(};F=ex{B^Hv{I;=5>~oY7_L3y{Zw!R!ctZKQ
zMPYGF{g1Z;*m(vKc{;*+qFXv!u3*ETOyc70s=FLG>U|dFlUXV>;l3+z%}ZEM<#!w^
z9OsO)!a-V>YtKM~5AM71Zj*i}nbSzOt`R;$Bfd>c42_}xsJqKlNx97{^GU}4;`+r(
zq~HogF_vH8Xi2qlUz(B=?0yLR4Ug@tX?7s@RPpTzPa(HYY*N@(r4t>YX~17S;I9#A
z62g|dxF?0QIK_NhXtuSqM9Q?8E*h!Mw(3@kv?X5k@Of#gXg7pP@M=zPt&552<?!5!
zkd&L~kuW>VOd-|cdUQ@>-X)*l;!qpgC%-JG`pMdS)O450zNZAC$&n7Hf%IUQ`_>OM
z25>;fOB2h^dT{K2^D6;Uj@p~;0h{e$9ZP(FJ-J_wXhh)lBuHN8K+KoU#l=OQ?lVPY
z;g_TJ^>v5qePa);_JZABP_dcQA;^<XKZfG1x^iAHXFB8-5Qus}D&it2EDx1k!LNL1
zV4vDa|JrGa-q1{yA+O`I_}cDTs2$@eVje&xiwuoMF%2XPuCd86i&+`C8BDGBkupH(
zb=&XA4314-;?9#|Dk27&gdbB+5HZ=Bfobsz7z}HfWUeJC`aP=Z$vF=84o~nwZqyw`
zVrGoJDqWJe9|3{0E(nczC<gbn2lqqZ85Wp$qr|PW+cHG_CEPfy2d7bXuz+Op{b;-f
zI5SR<6lQR-89AL!ru2K#2NN;GDYv9)LG@-yc&)7gC^cSD=0-Pj{56vu?gwrb|5n^3
zHb;ojhRQj6gWkIsf#?X!&76}LlTXL?$#NDm(1rY59Uu%E#u~H-LDJy^JpK<&XZ-bG
z{1rm-9CA_^^y&F{OFnZx(*{ynxuBa_xq~_94H#yhXvaKGMYbfvm`^5a<Ag6%OSMZ^
zF%5#$kn3h-XNqQa|H3zNm_4777HHIM^V?Cio6%})yPz!X0{9X%!oVag@-bCZY$q9>
znryGR@5gh|bgj1N`i8C4MNOh{%*d7uh!o%C_4S%Z>_53{hkh?CtlI<FLy=2&OvQ`B
zN{GCkMAwi%0z1e%=~sl!Xngy`VR+?N*4I=d`X*eybD2wUEyEI$$YwG6Yn0=%gmn`(
zgN+?2WZav`<|y%u-ZFAK3jr^r;7dr=XL{{FYT}HZ%eW^~2t8oS_*$z@Dsq>(J00_|
zoIgfruA4wtjHiIzr~jyiXCOY)jUR|)3;KxMVTjztDElA$1Yud#m4!Sim9MD&ixOIG
zQsJ#ea+M(uXFn!4d&m#7o3K|Ew4XZ$i@^tIV|yhB!b3p`NQaxLipj&UWXD(3R70?o
zYue&oghQ!TU0;~Kk8cxkiC;3MsmRlQP<IrxfeXYkZ-lmjjUf0P@^u8;Rj+X3n$AlJ
zRTwqW&is-j#P%y2FSC@fe~ayCMD^>6>w=NW-+>Yzl^s$4;Tuhf{?6Zb1^`zVB80P`
z9}^wiAGOp<%sedFSPB)${%4uCP?BVYyy3mw=Go<47ny+iclgL#B=R4gcH7H2CA)e*
zX>tSMeQ26*wrCAOh5ou}%%9oz&v60}<xtzZz3u;KK>yJnVTip+PXurKAb1?Np8wN4
z0^V9Ih62>vJyx6MNu8^%-+9_B<!pBA_5B21Usw9^xG0Oy|9Wap<qoTpGNd7jF=U8i
zbf5AyUUgurS)G5g_F;FP>9o4S7odSS7bIwleq07};*_--Y+8n$Z+yGj(YJ-Ex&+8h
zc5M?ad@G8p5A-6OO26b3uZ08~p3*d>G6!2uTxqQ7%Ce>;X(GLY#e>=Rh;DuRXtN_P
zPJQ&C5JZlp>XVz+D2boi$Pjjz1yXU^NC4CUNcZ6}5w_PHa!OiRUM7hs6rxIV4=PZa
zyai{z;|$~&s~im7^5FP34N@KGWRz7WjLHz3mONAXDNY6(o_MqCHw+Y1?KEdvD&2GS
zK-r*{%i&fTJLMVe#STZL`kLy$&F`FMs-Li~75Ob@91t&ux7ugNi^l%%Fkh20K~F)$
zlbcf?|5obs-#$iOEgt`@Ftc6tL@U;I|EE#9df&QOf?g(fol&R*caF(sW^V)$K{W;4
zTlFG$Bony8m#h#Ekv)fMG#iaaVDpF2L|bK8(}e4P!yqEtxsYl$-xprovY-Rzm<hZu
zvVE5TlA`lUCM|k7C{c%q5|{}kXND5$7?INFSt-9QM`Wbyv(uwMyg;2ahN)aj)&T_x
z{0d3;em<9-rYZvP>DAV_w<6D7K?#U}UlMAv%(0qH;J~x7f`!EeDfioV!T{C*ozdIx
zm?axkr4^c%-UfBXF$%PYvz1wMl$OU6tYk}6gG~RZ@EA~X!BPedqWXc10aH@_9Pd&N
z-e|wSEf!N7A5r=^>;6*fW20On9%i<XP(#pE{Dw{FHK<H}o9;E@GP0%o`FZp8Y0~3k
zX@sxxg~apn-&AO!U7*kze(Dtn#0KT;>iQ4q>9&FYC%QS%)t|XL0rZw;f@1lvDhi#A
z)s_eocTQO`(6q>0w5xE%3RH0jjvlI2%ZJOS6fE!s`#3F4uv$ELzSx-w-K@7<Yui-A
zwJBh@auLHnrL@|Xq!z_6(O9n&ODQ_*N%qX}(Q^4bUBPC${Gz1Ke?`Y-ZM#tavFyP8
zWAmMXO4~H1KbX5L6rc7~OF}{P5S}qs^Eds1n)Uda@6x-o3a4tT`4z-Fd#VA<6l_l0
zV2Y0tQ@|r@k;Mu>Jg<*aVcA)qn)e#=(1ZU8?{{zV^|gLhd-J?QXKbQD%H%CfcERv=
zoK|G=6!t%s6Sn;y%viFAb7L-|d_YcYv#JVE_~_p;Nx&U<V9svqV~uwA`Eo<x!+#Qt
zaO&$nre73EAaB_EmuBuC5Q6F*bfUhz^#<YM{eua*g=z5HzNk0qegzrwf5*Wj)4A$W
zED(OFzn*_t-VGxXrWm;)`<PVQW{Z`7VlOA1G{-qdgI!fowJz)&m(PqISu7FF!g{^&
z6`DG|<QRW(vdxlG9y1=+rBF0kd_NMQb9|0Hm5=6d%30Rs1XN6ZhCfu#p_-5{c%vgQ
z5IV+HW#pY9?Rbr5fo8;wtzNuGNE7Uw0oPifw8(fIoSD^F&reP}B}JRziZ9t%Q_5A>
zCbF#YnFCLg)$+eu07NrQP<x(#6DI=6RQ`*CBorJb=KWJBDw6LBu|{qz#(0;}SXLA#
zye$+5wwjJA$A|{4SIK1yv1=BVxd?7>PMMoYvGU#>$tw#B4R-99-wv?AZnZw(6IeK#
z4bo~`2?RWWM>2uo`=@U}kuRX}=f6xRw^W(`6dmXbL`&4xe!l4aym;#U`T!YR#82SA
zySeY*R&&d2zdxWDFdA{lvB=H4gI_0Ji63$k070%y6>U1+t{_a2zoT*e9{%h|?O&qa
zYgS^lpOWgNr0vTx<0K-E(zbe1o04u8-!kLP)RM*Zg4X1(V;`%b=4KyDE_pU{JS#m0
z<MmB@JQ>Z}NdLtZMwr~$?Bg+((gH8{_9w}e1G)}2WfSeQk!UhdmGnJ&Vu6`^J8-kw
zuqiZ_+FC2yyb-E(Bo;M5DygU4iZGf3XA3m(wuI%|5~la#PhMlD`%sGC_-p%kt4n3u
zgs8zpf__FqS?p1;vB-~!e-ZT-YW{YZ8a5WF%fQAe#(CCT-BPmKVs8B#Yh*d)s?)2q
zJ<`_41y);cocS!Rqy$4#;U$!(kN>gDmQmFHo-yyRpnAOe!+qL6>C7yQMlbbX1S^}+
zHwIYUIgHzl1!k^*qsfOY^mu9~{F;(EtMd#(1)fbi1p-0Z@BfhW`$$gD|BaXbkFxmn
zob>fv8T4A&5cF~3K=h*!gbv@ijpW%nrVaw~1OXr0dq1+R3Vi-M=3iHPKNkx>?;Acg
z8iZa?OG#eFWGZYr^M$r%banlXW_KT&w;2Fmt6%S%I99|Vw>wTzc&oNxza`|S_<P_5
ziPte|)^~qR&F8of80hvw8x&jYaKVVTD%4jLxGRD~<yu)Vj4x}oX$rnQ=D^8XoSRk4
zK)h@`{#5Ax6%s0*Z<#J(Kp3+E$<L*b>TAhmU8;n>oUo+oY|F2ROAD(I=~JT<R#>G3
zjFj!81&(x9)Uama&5GeeIn)UlYVUNG>)NrVM$`Y!J2dXWj*~`0a!1ABm9Lc8PX3lY
z8R}6y06@pWTy?9ptI!Nn4z2+`l035GRe^<r(4Z8lM*0IH#4REe)7u8PVE{6{T0L?y
z?Mnw!Qd>Ra_%g0fyARv2p1qQWb-alJQlEsz<^ovwRvBeCsg1p4ph+-Qk1+P<TT<ZB
z70XA`=H`F6S(-xsf9-)6?ZRI#v%Tjak~@gE{TbK$9QU7RagBf={gbcQ10t1wEwFqn
zIK7WJ`Gel7ulk$U`u_mHB2R82+8+iz`@}u_@GGB{A|JawFJ4Cxn_nN@U!%j>Admi}
zPZlARKu8(2E<5l`e5rH_gQ7fDPi2mdB7xNMTveWdo&lOjBi5XleX@;e&vE31{Gm$n
zQMED*I$SkuKrIP$4|i|<vzf{sy$2Y0-_WRVw4fz~m8#@ZRf!15X;nle66KwBhQ{MG
zZI99n{{aF!%v!Uns1#u{j<$+|gDa$NTlRe<GWtx6M6YNYYRA3aVs}^R*UuD;HrGiO
z?l3FC^VC#-IaD4qAK^)IB}Byj-BODg=!sN8)GQFWF^1V&C)TPz!F6wxzZI{ynp+lA
z)nvr0rhk)TpxtM{>AUzz1tqi>#|T9WPwuIzFH$`3ti<v|+(j-EQ2m2}myVGZ*9|h(
zf&JQ`@>aYNa&p71GdSXyJa-E%_~7;JYY~(;sLTWrRG-?l!BL4F!k+>W<W0k;w0pD8
zUk==c!eH%qgttx+!OI+VT1!vm<|bbMA5CW!6=xHqVO$1>!6CT21p>hacXxLfBtWp>
zHn_X|xI=LF;I6?nxLX1QXD7R7?>L96uco`Ys``DOUgV%pppN~vgue#1eqrH?TSV5f
z_dKlOst*T~pGV5vM#)LL%=_^!h~l4gRLt7bOGJM+>Ga8~p|SkHvI1fG9Wr!SZX<6X
zXTpFHP9QWBQN*CLYv|Hq3fsId;2uIvJ%y2Y6WxPpNONJ?sm=y@EYL5^ylmpIAvu>?
zB3csg?o4(Vz$Oy@1RM9ulLLmBrTp7e@qTVCz8;%z^W2_;`9T3m@{nNrD%>KD^};fn
zF^{$ooq9v6S6}QIlktz#QX)beLjDa)bJ5ug`~$6J1Q+BWYR?}ohbzWz(6PDST#fL}
z8eGufTiu1*3yXV(1T|AOz4P!P@q2=w#0X6LXjUm>PZ5esB<Zs1yIY2SNn$m<pE0Id
zLLuk5+ZfAIN^T8TWFn1v{~sr00Mc`0R}uLvL4LWRB7>zhh0=~o%BfML)aqg(jkzeX
zVcw6l>5@>1U*jd66tVJYL>rWaY^i>eDvc(g^Althl6?Q!!QU@gwap0p`T9<&dp#f~
z9-C|2C+A86j|Pj)mXiynVKew^6@^>$OS;GS&6Q62gZIyvz8N~H)1Z(~8>Ysqb4cr$
zBCN_>Cmb5}jy|(&>PQ4>yv4|b{X|BGbueBp;cvepAlr41y7vc9hTfQ-B1tzZ#$op>
zMLII!i3zQbU_}=HVS<=*g~frm)j-UPd<X;9bQ#R1pJla|-GJW(C2GVPp;jyjKqBeX
za&V0>26#8?!z}ypf<^A4xMW`)gEhu!^M+{CFo1OqeJ(j1+lWa#%zFc!N~fH8q4GR<
ztqmmg>cKciqFoud`8iyZDp!)uoNYCN?`iP7iH%D9$|VFfbWD|0!THrxdg;zp+bAk%
zR(*?6bI#*)fOhg9j4)*OXxAi6GR|Ji{Ky&-N$lLd4SJF~O*&2w85J_lEkbvMe9pZ~
z{=j2SJVRUyEFhR7`ZKjLPUNQU--193$8f1jp4IO%S9X~G8<P@r1@f~RpUUaQLxXW7
zzg*Sz5*$1cMbj#eY}<JE8^=w6-crbJX~vBUdVVrM>!$jv0O;$~o)!kvSQ<$^FBeel
zbNXT5T}fx9$V~{V^>;I)Vg!-|b@1<AU=xUAv-~>*a|tDiIk^-KUO0k!QTa$FQI(XD
zzJx?XEe<!D)=w}PeeoK#Ts^y3Cn6-v`9jx+b7&_NmkYP<r4U-~5JWr2N8zDpBhx=l
zL_Gg-GP|4RNWQ+Kgb4O5Md6)?CiXAFou(>`WI=@JB^PLt8rObumSxZet7VM`Ed?KQ
zm{P4~yov{DF$N}Dx#j2g@~uKvI&rRIFzk`yieal!Vpx3;Qy}|VErfQR8UyI7Usnt@
z=!dXD$&=(L#r2GZ+`l8%W&1FYx8y6nO>1d1-(b!kjoEDZK1Ij({=sr~s6B^XT0fUa
z2?JoH?h%mONhy?6CoyZi@PH3pD6abXEckPYxz8}~u6(FIJJ$zjP7K=BoavY^XwQWm
z#vS!IhYT2@sNuq0px+^3&GAo7Ml?%XNu%ZACAIqv<`+(r5_=>lP5oM`IY?{OKOO-p
z5+ShuG=j5~UqQ&|O3}j5F`b)R+f*%b#+_-n<4myb5K5`;Od@TAZGmcn`t_idW%+?1
zXMf3Pc=@zq4yB{&Y(lM+6hnR&F%0#Q!XifwK!&8laQIgaA?*~LU0oHi8Dta%6d(t`
zGCVGY*lh~@{E)vfTF~G$%kD*CXxpq%b1dNOvJsW70)5h_OvIhEcg~{I;@<>L4QgA|
zF`G}|Zya+RZrY-A@G?&75|csDCI(=xrC$>pZ4Xn-bXhZ#&BNodgDfW19_IVsC&@)U
zKy!}y21GdIh>b@IBgCP5F@8&Nn6=tm^6I>L!VOz;JItR=>cG+)LX_1scP)!wNU*(n
z+9;-EYjO~jKSNrRL91D)eI*t~?O<SYAX=!Nd?EaQquNH+m4aEU^lF@G`pjx~;~%ne
z`M`<i@TU!)I`Ca+jJ9jAbUv?r1%apHxDP;kHRcy0m!{Upa37{$={-DmTI2`5^{~@m
zdsaL1k1t7k^ovT&7gfhZ|8XOS9N+?sU1{@Tdu2v4b-aYuP_BwRE+Ut=eE-_)9i7tn
zzE836cjvt(RgFp8y+1Oip-JL*5Gc!CTrw79=`mGbO98c29yL*U7x@4+*^V~8T_T`m
z*@26(whC(+pjJtgM@fVSAA?Hkfm;Xwu&Py_Hbk=dGpw;HYAmdB7j@;u61C23O1v=B
zM_YCHE`z=dPiLl~8cZ+B9N~n0Wc0Z#Y|(pCq^U=|5Cz6>-l_Sp6UiJ=&Mvh4K1qo*
zlMB<8`pJPlP5BKOarvuhR5f?pR{#Ca1p;V>r8BecHT%Y<n~>QyFfnXG>{MSh-#<El
znwH9UxSkSQ(XXlNmBICGiFMr>-t;iBgp`mCww3tn;+9Cm2q(1jm!@}GkMg*&JBq%#
zi^3gu6#1i0P3O0fOxu2+3pQrW|Cf2sWCD&vMekqJY2UkM)_=ndxtdISSVC71OX^vP
zZEo`spyH=%HOzoJB9dvx97uwtgA&?3&cO>3eO-u&v+|G4CsM4p))3;vM!MixH`B$|
z;Km4Ep&|B^oF+ET3YujN7Ad3ER|skfiPldnN)V$FuJFm6-(&Gkv(az!*jJpXy=eMf
zcbnuQxtCt$s)zHP_kp4!?eKydcuvU>laJy+zl7M04Dh&}-Wss7PN9tYt(Cb<pL{U%
z%(<e9XQd_+4(ef(8@);2FO4U*x0B=Gls4u4pjYpvfZWQL6pZMk(SXmE@=YP5lIav6
zCA5iBcBg?bPxN0KGSF(ahdIjIDsG_jW<Rz_><QoqE!BG0pi0!vN4pP5YUm}*<p%8X
zY)#`C`ad|Xxo_v;)!f>~5aI|}7J}9%VAR+u#Nh4+-w7msIp?8PFN$s;SXd$q(evBk
z=sdS*UNy|C*SKj*EiilrLxqC6Lg_;acX0xqF3)-R4RtVs#{XGqU;FkwMmg<lW~&o@
zm<y7Qmir_o{><_WmrUhK@@O!<aP!52skjnR3L)1L%uhPYTQP3xcnGJV#_8HZAw8F>
zgh^0LATLWSSHKvXo87eXa{k49U)pmJ=^{pc7Y0qultY}$+9?eC6FQ?n-p}uDBI3L=
zCKL7Sef|HJE-ot?Ab%C1702shp{w6pN2BP#wJ+)m&&VIgydQ~vq{!H|2B}G1T8QM7
zM=YAX85m@R7{SMV!ARD-ax{r3`q=fId@cf`ww$Bl)KaO;ySI#N(ZuEv!QY~+FtD=N
z?0JC;tMy>I^teAf>``~v1LY?)S=fvpJOj2|JmQ*!m}y*b;BolwhgXFjXrmtqt(nkQ
z8_V8M@168ES{RRY_g&E7(clR;Ez96>ctzeO(E!xw0}dQ3nF0jbVv0Sww7V&kulDL<
zlyA}xzhDDl)v9|~LAtQ;J4lZbL(>mjG1b)j2MJbjdGfy(;KIKh3g)}~A%v;feptXk
zGYPt|rRlo*_iICS$1}jaJUw0*Y~9V`9i;xI($ETcxQmDnyoboSTxlPe3)4OgYK|*=
zhRUrM=sn|_FT=*>SOc3-8(+%dj8YR7GvCrN-Pf8GGTP1~Fq4l3>pk(g(eN}@in4L5
zR_*U7mbhg1_pdF25)evO$skG5ASPA2rlekFB$ORas!vL=vNfAAjyLGGi4n7<eyFZ$
zZArnlv!$Dkc~t*NFF7cmABl<S=NzL6K<_3Q0~rd9;L!$jk9~2D;T^|+lGTR<1()dA
zZA8ZgGA^~@eHbsJVy-mlopH%6ixi%$`@C86MM#yO3s6^z%2^!<z)=7@?c~l5f(WI|
zZAhCArP-Kz)6BUo!{m$Sa26Y;l_-l$;Gi+OUH{-WHK&_V&B37yc(D2>SHH?i?9UE(
ziLuw5+-`YVo`)^xXw9{Qyg!}%viY@-iGn=J02R^lQ6*v_zN>z=Rpe+6yw6xg)GYTI
zZ{rWCsk40w9ab(;<uh%dIid7U;RG($jBj<r#URjWM^%=V#b7h*5_*Q$7j(ngv}uUB
zcFhK94Y3=qG;S-W0j=xmIUqIZC3f`z-+vD=hNkXP0uwUN*k=41J@7y|LWMX=?n;ke
z6mKy-)*ZP)9SF>QscxL0;z^n2v&lci>Xcf@iWr0Wl5Q^$f{Y#2bk2`~3<>d=Q*jZM
z@}!dJqJ%E5$(4`ug7b{zs}4*%Jv_TC#kLinIB!J3I_g~LkNLlo!afQu5mzw$W{Yfe
zWo_cpGcDeQj#~!e-=^PP2SN6J?SDAkQlzg&{uQp#?94FkG|6diay-G*u4U+bc<=+0
zLFW1Tw1n>5a}ND&LkYskkB*K}m2_kx-~&c^{kacL+yjC{H@JK`>h<LJ(_5(W%!SBw
z;T^Sm?nGg|ii=X+<s4084W@cruF2B(YRgi3ZfZRI9=SPYMv0|;O^D!nLa;Vc4K9oD
zZXwGOB(1VD{yUeZm<MjYmRCX6vZ7ZZJpf5ua-#Nw(n{wLFqryHoy-^JBQb}<uk6>a
zwm4+tHpG|@l_*-tCCaY}T$#0I{t(jl42N1>1U<c9!-S=mzAwU)2Wfy)Y_*^%L3fBD
zgJ<q(`S6f8iTV$^bk|S+j$iG6$z+APEjJMp>CHm>3T%EDBzeHXIPaaps4Hv*N1uZN
z_|?)KO+UcsC`u+T%x9C-|5-9UR7FdgE+>NHc3kLoYdfu@ET+u_oj<|ut2Ba{XD<=|
zgw<UbfrmK8q(*KY)}Mmv$h7NBrY<waHn;ycbP05guXqt^cF=x?UzHnqM&zj(n(KM_
z$GO+*|EY+><S7US=99NUe)N5Lh_+skbXLOc?-6{kLw8zejBz}-Ams%PD&W<I;dNA_
zS=sHZw^PNikIA@6_Sk$Da5bxZTTVRqu_(0(Ya?bPmIAz9cfhaZn{eFg`v5@Db_?C^
zFK8}hQR=oqeE)qlRo3ek(-3gbBs3!ze-YO-vh_4O6)y~r?h^(c!z_Ura$o}}VF66G
zbpsjB&k^s5mPGJ^sWs~#7Ba}PR%Kw(mo;>R=nf@UjIr>d+14To(JxXeK@bnI1)(QQ
zh?^1HUinTCiZ^p2Nb4fs1BDVU!cFV&04!MqDPJVSr;<*k!!`{uK(=SpE3&d){Ln2}
zPi-j`YIX`|Z7X5&vh<hldaT2SrE3mLO%<O!g?J*#oc<?=G=4|mS8;Lj02$Vtw5?68
zUnm_aQNTSSKqvkcQLR*Y2p#N6pnUI&*FacsB@9&>S=#BfMHnCANz%#eg(H;`=C&?E
zI9XJJSWf*ME<_y!yc;>umbfu&sxSX9gPJw#&YVbPnh&>^ogA&zyz(_qPwVySjx-O>
z`2v31?*VDUM(H`{$O4*PRI)oKVct5)mT-V0q5BYbCKx>54$_zJq^1{)v9|iHDjxau
zx(HKc)P9!3g|UmXW-4M*gb@;ynzLF`3lDLtC{tZTq?I0G9n4S6yGWpnPj#L+(Ipc6
zoZ^;nYHo;~J~}X9>DtAPajDoZqvx-pd)63|ns+q@6=+R5LYfOYfik}gSj31%^XX@v
z+~%+gC~fWy^wl`|)Ol4DK6E)pcy8*lIXYt-=cBL!Pf3j0F@xb}Lyn`_vtmI;$VB^N
zM=Xs-LS0fX;0R9sfx3ynsY&kwc9Q)*rTHMU8~>~j%`U&nNZ-gfL?%0UL8)JfN@e)C
zR*9QuWMxo+$e%VKSE<Xo<+MzwV`!$Iq5kR&G)Ug-Memm)`~)>NBgN|@9^q>r<ET4-
zX$q)Gslh{b7nAC-W1Lb;uwpw}#^A6d)v(u2|NA|53_ZFReui78>I@V)vtVeLOMH)y
z$&Ywh$l}87J}09OFGK(~RE+>nOJ(uWzs`(Q<GLP8BW@Dir$Hvn?LZ3u^`v=+XYr+;
zhTF$yfTSryd3rZei5;=HYw#6zSV?y{;F#TpyseeX#F33CA^jT${01e0`tHh`{=<b+
zhD52KHD!>qQlwHrj-fIEJD|K6E%<y39P>i~&zUxQ^gm|J?^aIp@a}HU;x$(xK{(Y9
z!NVXaB+A3_a-A}|hPtQ{Uua#rJ|+4zfAQ`be^Fu!T^j-a3_=DeRiWMEX6))gG2CSS
zTyc)dXwuVJ(E{oIT*x(C*{Hfk+v<vjjniJzjHNj$WSHbkL+|E|!9{lIxtM%Np;a^`
zLPN5WOP)MsII&f(pT5>@v`yOfuZvYQfBiJj(a#zUf1g62l(*EUc0OD8b;#U9a=>*g
zu-~~{Jd1X$BBK%7t}@ScIjQjnsvHqUGo4$#rl?%lwKPF5i$MThV)EXwZ*3BtIQ3}z
zGp!;CC==%etcN#17`h_rc@1mTpLKRfE5Be?xDAxWXfX3xQUXMu#QN%0XwDZKGK6~f
z0eh{9&JmT^SdtuGa+KsYFQx*5(_L`?kVM;u#m*6Wgfeed3r4XXoOVo|LkL6nvEr9-
z?+T`k_~<LnVgUZFf<!BNVcEo=ZX?7I+JEOn)F*G**ES;;xMuE$CEEfeTt6Lo$3+ET
zSJ2j4TM3C`?MAR!cGxh1ok$p<6F;&e8(p2JFy}8M&GJ#}b>2q-=8@J&B^vpjHRNZ2
zsFI``o8rC9dXA31X`%+nV&9}ua}(Atkn|*Uy+zWI=Omf_d&uwFdY&?Sm+N|<G@S;z
z@~yf<CH;XEsjUlqP-fDUg-#66>7h_)nzAlxh@Szg<5TR9i3vHg-SV)V)+8yRSXti7
z0KKa*sHY{a6{@%C`CoV7l;```&_!5zDXgkgJ@v`8L=y`&5}}QK@x~%?7i^8TIZZbH
z7Il|QHS9uy<FW<zVq(Oh#pMqLra9O*?CsfdHF~}Uo_56^`H{?%g0^pk-JY;!e1XE~
zo%R{c9l=qT;yXKStGpE$flISh^fmzF<dQ0O5@ADxbCzHs_`uX_a>)voCV|wHL+uKr
zkw!RK`2XlnGb>@i0={9>k-k7;!}ti`t;4QaCo4A-8##y=YpzxP(8h*8mnqQEaSM<@
zpJ40}^y4}!vXxobqd#<<Q*!_)6=qs+*J~EU^Zj?G8ObdWwZfx+dl`MQ)h-~9FE{>)
z#drYl8fR$PEAHz@lhIC+DbE)`?*S(-s{iHzq=Xh{yq7v7nRk!LLVf@lX|I4*bEf^F
zJb^&<$T3A367{qxIdh$#m9VlhzHMas?WS&}5DxiOxoX3V{!(O6j3ziI*ASx}w6Cwg
z#v2PstX{|aB29mZ{-1Lt;nPt^L!OPd6L`mi)NVnKX6dVKW`(+9h}>`Ku#dTU7J7B}
z(bgbFHN|-LSiz&JK8WO%E}`Uph(eKd*Z%n$M?xZmU95v7rU^&@w%wn&KYXhpsG+#E
zstU#=)sNPpz8$1$q@X8>9i}!tBwLZC-w?rJ<$NPB*fb4C=mK3Kc4*6UA3V~Fv(h%#
zjosjP<a~XcDMBgW8l{p6ifX&Dx=n$Pk{I@V9WMJK;>Sy{mHBVj(+!0ci8_VfAbp{V
zb>daOQcPAUzCsV=g#D18;}9E6#Nv=)-Z#XFaf(7lh7<a>xYUPqjZUJ4Xsg%KpBxAB
zwlS$-X^s{ex`k^B`euLBA*KWWx!(M5WH7V(ndW!2w6C}Rb1q@_M%9X}XwzRH)lRg8
zvC{^Bst%$Pd+t*7@T19ZHxxZ-g15%C1u9Wv_w8rJLo>?l$%G^Fg@G4}hdL7UN!sd`
zU6>-X;zTH|+_n((3RqO4oxjp>c(fnaH3O1oMeD@}u@y9!?gk|h$-_}+mqb}rbm?X{
z)(L<dk_5&;*}eJj0dRLHJiT{$y3-0h%&!~Iw;i+>MQDEf*S2m$bqvO_V|_<0Mh3fi
zGCyEZWBIZbgB0OE)*cTuOv57JX1UW!r$$cEd+VB<z&v7SHW#?_p>k+2v+rk}koE|0
zPkcW{Ym)i2ZT#7Ml8N5_vE~pcF)Ch})xR!{>EyQ4u=_%=gimsp>V2Y@Y~oZwJE`8r
ztbNd6Djcq1@U!Y9VHL~BlvVC;g0u`R_3X@N>6s6$bcdHle1qK=6JnB4d{HSu%3UZu
z5qk<flBaV)QkpUlgfuX2oZ{nY>`DI%b(vz&F!+7II`OLRhYjMi`0udO$)In2;`}m^
zc%%=WFs-8})%DIkgRt+U@8r+VP~Px5+N&n?^P!!|=Z}W`f9KF0C!kO3lEDoG2Adgx
z%h?B|(i!R>1G_Pxp8?R9-MJ>5N(!|qb?E8m!ZPqu5G5Jd>nU9?vt?LuU6U&q?Z~gi
z^#919!1sxKK^&obVcU#qz%&&3t>o7u+jj*?Nr6l0N<tFfQg%UsLN+6U@2EkEF6(K9
zRt*^#fJ(ch#2U&lR!j%L?bl=Q10h_XV>wL8d>?2RYl|dJWfo*l+TbNiIC2lcbago4
z8Q`=2Z}frGnDeofAb<O~(4dmP%Nn!J5#FD0ajxM=U}g%@k&1Kr6IA~&4NG(s%gI0j
zdjM5p`2Vg@F>&p^++3PD{6C9%j#V7S7oRhUAMb?Q4bKbn0bF}$eB-}hoNjfrxSbR2
z_%tO%Jfp;2qPTjA7Fi|CYPc#vQz;uwid?f$9iTvAYIXP&uld4|ay+FsRv85|Y8CaD
zrE$!h75sVBL0_DS2FLqPC$p%+PwQLV69hYJb2@Yx?#%t3!?lJa7sW8MKTNff5;HcY
zaYCbHv2uCGDQI)3n~Q3r)a2`C0qc-?890)^O!e5RbVq9R{pTJ7)z)g4<$VT*s*Bj?
zlVfyq^${V)eh7(I(rBqqf(1Zo-8;k^PA9;^CCLc2B{i`Ejl~<wfRgndw*=PvU(1a}
z^5KC~;#}5xDnAYvF9-AcKZ`2=*_b~Moi$}w3|x)Gg$p2eQi}rjID}vSw!ydg@4dtR
zD>U6#tGkfbS*RK(b3{WdI``Oi8L^4Y0xO*kkcmV%P&@>VL5!Jtd!M;>RdK36iaN;_
z9ARz(4~1zV-ItY8Q~iuu8C>|AxX#fshUh&45vDqFpB5&AoU|3GGhC~jjp}pbL1AI+
zqzqZOeDxlzM|HM<15>Z*qr$Cjzj=dg^V9UNtgUXJbkJ-hNe$@%7;)Gr9VK<9X1;te
zHv;|m-B^C=L}6b${$C3a<nJ`5C66uTAZsR<gge8Ja^Ure*OZSfAe}0w8+|<~6vCi&
z!>LSrJ6UXhkl;~jiQ6;K8^UoK1{|MNXl2!CEo-8S6TkWhRXWXJeElzfFSLF06Z~&s
zU$`5>f~R4OAd4O7A$#EPZ|9h5w2Q34^a5*&#Y|&19EmPQbsS_XJPJ>%)bZzb-NwHQ
zn9PGI^Z~+xb-}BMf6Q!)RVOxsPvr%{+HNH^=V)&DCB@W&Zgbpap7)S5(9FELg1V*-
zNn6=u0}=vrsx~VV=eg-Rf~>g~`;jg|Ot+OM3oa~fyPQB*1ZkG^eqJHVQ*aLv-gr3@
zq3j}C{&Dwg&*%YCNo8s`33=}!jkZmdaRJUv*a|Edlo^sf!d(*kP0%_#yL?ZZI9P3b
zob*$DWftK(rcI`LV-KMCn*b#ZFxprj4zD%g<ATm07=NPmlo6YR1NmXdamx@B7j49a
zBH&1d<F(?$y24!C{Bb?3G62en*{dZWM&632=45?hk`jzqzgj6S{=TXZEBL7(8;6<T
z?hwZe9xj}K#8*=b!tS4S%Wy0&?OfnWOTPHt+wF<fQq?n!(0eBo{7V3(?%N7V_H`W_
zwrPSJ-7Sn9Io^C<;3g(f7;zaxP~YeAQWuAy5I-tft_nA;j*SbT5q>2D&j}`<Rx(Mp
zi`8d4bFCpvE*IuFi|`gXt8onkJh5Ml)aV^H?@KTBA9|breuASd_Nl!zGBIL5x@?>g
z@wxii)caaJ(rPJNdry2Fp<8<iq4Y1tPgUjR)RnK8grIqni)lva1nSWgHm3wLCoaR~
z7ZT)KnE$d>va3*HRvkLf14X(L00b+}_dPtM4_7Y~BC@pjxFl6w=rT1JqxWPiD!)@u
z@;O;R&B9t8Ry-%#R2qT!q3u26t+B2nx@!6x@k;Xj!EMYxOR^JoeygF&;#{SjM`XD?
zW8YMmIn4FQc&IaqNCk#*qY@OhiW7YJ1JqG}_7`8iRc-o8o5@aVK^~p|v3p~|>=~xe
z;f@EX^gex)Fey(=l=^r~a)k?1Mjqy?Gx2QodD}lt<L|iF|E5bq{*%ejm7Eoc^73;f
zi4JH9*!e)ljj;?@&{O)`+_XoR5Koe-lwex%o8uYNLYr0MHz|2|eBni1g*s!6MO`6h
z8}<2*j5unJf|k`OCx<_BFgxoiGj;dpH7%CK9c{r875YPV<pGJ*D#AZ;#qU5F{-2cv
zMuVM-2+H`<9V@@{32g)kU9b3>g(4Eeq$V<Dc|2<GjFQVC3-bdsrAAc`Mp6w9XS6nc
z$n!d7&iVj$Nbz&k!|XDLw;JgWU$m5FlaTzRS`kUJ`mSb4%ucb{p?u)=FJSrUMXLTd
zM8|UlZ&&Q@5f2Ku*vQbSwIHH17oTreTw*JC%}1Bd8{4K8AtNk@e{4=gXmRL))PSG|
zm0Y5o$|czvBbzDDsZ<Jj?f^DplD2Ba*>y^3upQ|6C)x6oRuL#D3o%6-@Rg!^f&Q;I
z9~0pPz2*lkxclP#jC!q7C&exKzK_$bbeILbbh?#VIZiC##ezj2QeH;zMaV2tOg$b0
z%;^z{LD;+v0-rGua6WuIY<MKbQhr0R{}tBY0$utIwFRwCOlcXUs`-r4*`tI$yP}y<
zzRg52;5)F|6-$0TKl8a=dL~xTAr<CK;2e!l7;hms4?fJk`1mue!sp(I1Wa_^RZzv7
z0D=V#;!|#`v+euphtxHZRvzwsQDI$KoD&qyOTS;8fBh~yWy!3epHDIww!Uium(GAv
zm_W7K)0VKV;qOBhWq;2Cu&|q~iUNHhaCq#ej;gal&J4ctP?NIlsPnM3ld@_MxAAkK
z(sh(YEMfv3@H8H!t))3R{A7E|6deWIqP450x@NRn?@zV#0Gj;^N)_Z{BE*{uvnBY$
z1+9g_?H%#A1M{&fUpU93JSr~7ycv&B`L%X>*T%&wW@&9s7?l0g1Yo4VoB`^7%%S4Q
z1_|71>u}gjlrGN~6Fd4-{I=dWL9N(&vw6F9Q~7Aw=cKlS*QIZ@{Yw<uf6<A#oSf_a
zOhXWWvk|Hbxl=1QTgY$L%gedz@9oNDaIC)0AM3s9{LbWORA6S&Wv{?e-qj`4QWxG@
zbbs_6{tH*tWzduO?MBIyXoVp02_3me%^Ck$A<dBT48Bx9znefTbw8e$@p#3UdKVm5
zL_jaWka~)6RRl8^0X|SiLDvL{U(Ehi#Ap2z3GQSm&+?Z<ydj(LA&ekPF-mm6AH|H=
zz)7YHS+VWscw)uv)bm~=M^p@eZ{8D>u7=UnX#Pb4PqSMezK@+5D((h6?YZXi?q)2y
zwD?Zx=ow_ZVsN3@=hmyLE%Q@k)FUEP#c1J9o9f6?wk3vI=-HFWcQ4|FRi1fP2fm!Q
z#l9D{4z@STz*2Vrk+)(r!5B3_i`F?TN5P3gIv#D$rT$9!PpQ@W@xDo{qv5;WD(u&}
zJqF#LpRV!uJ|p;@4-~bT_gt)qtYP<&wEdD;e=k2@Y;7mxg1Q0D&qpdAH_X4lIvfF%
zgl={`DW@6o`h=#UDDg^|xQ+M|qg5H$I+WlNE^zmhp(;xZ9N&|^5IwQ_3?+3;n>My8
zG4-@2yH*WiiTnai%(!MHwvLWABfgy!dOD5^zMhWcPB2<Wy_Yu_SocK7Zg_;IP>qGd
zC3s>XMvT+tGizIToT^=d+uDc$(;O`1Xk~FT)M8(wnm+*`;qvUxFL%cdj#^3%?2FNN
zoa~lu=2|BzEv<8704)0BtN5g$K+LpwSfymr%ojX<QodWl4+=hP^{AX1AZ0>Y1&q%O
zzf~lgw+^)YwQfnm^TGEa%#W>X)p6;fNPNb;aZc~Vwcy$;#{YHviVDAVimLdDnFy+0
zPw=CcF2BH3&-;3))3R5$8hL@|VOW1wWwI4l5&?y>LAD_1vGh+Fo9&f<`F+YY#6G&H
zhPcMA|57V#pqQo+)A06F$>fZY^G2x7u3J{Zfy>ykT@hqt{uaX<2R4s{w6sK-Hie~m
zo)>3xDjr~nc1v35RGgJJ>Su#Tv^H6XTTMgqXhU>`W?1h@s8&Yq!9tP~o{Ld8WR)09
z=q|jvO-mt8rbyCK>|Gy#saOy?1bI!Nv=&hO7c`uuX%XRLtu4m19|_u0Ml|D;80fMr
zL!3pnYT`aIZ+klshU+gHngkY>cyl57g^SZobRpXxuNV&>&(n&w`OFxa31bk=$(qSS
zdzs(7U}y(r+2(9Xa{42W{c>%u5G}L-3X~9@OxDkaveb&`W^_CkA67U%dUXHJDBC8V
z2=S+&V(nfw5KyD%Q8VOG1QZTVQdi;_mmGI4sr&8ft=;L(+KvTS!bq`F$3l3>qRjQ%
z4~ZP~q^o@sk<HQ|izy(Zc9R{!k67w^y-`~Rwtf{cA1uxD&t@-@!RlX<TcexyFWNj0
zS`6tqqj03_h|8Ch?;68j1&poqp3Y*e9G{i8RIA+7rgSn{><!R-dAe&AzT8ThDBi2b
zu%VD-aGV?M#eA&Benln-abgKCHuW(*VtvzAzhyNo9*|AOdkIe<q}@{nl%)kL(u%@!
zZLYkT-KnU(#|`98S?=segh}H`OkNr`pH;puz3H9yF3r~{IizdKIqDi}4wTnxV0R-=
zLfXJDKYv4{qa1iqQG>X-#<G&G_dsjhqqAOiiHV_%QUkt%y$NhWy1dkM#Ghe<>=D(h
zQl^8wN}Q`F#n>1ZUl&znS=*Vb0^IcG#zkm-<>wEMsn`Pp<HYAxiFUuz%9!HVBnw!!
z)9wN;iH>IwLwk!V(9Ki#>a$fv(V?%uEXHNBVI8iOs$K-^O8O99{-Bjx?bARAlux|=
z?yk{v)-e=ZbZnnrC}WwO^hy`2+EViUmLX9-GRJ!(Y0(fP3;n*hu;g{0Om*(RJa$uh
z+l-W$F*=mB-w_wdb+aWabxhS@%zFM}&JR<efcu|6HVmj4Hn(x8Oc>X1R_qnSa5KI=
zFD3V7blXqeS2HLHk45sw(e@8wuea7L9D2W|>z!{qwIMwm&=^jpFwwjx*5?#U7w`2D
z0uTHVm9AQ=;d$s&wV(Rs(~1e5YRU(>Q<a5osyYO~{)xB0*$fyFfFHi5Dg;!N|57un
zZlTr8q0nNHpX(S0k!V+?R%GBY!AK{<p$7))^EJzg)t(2njl*@rok7}1?^=R~eAfTd
zZd)u+1)@xfF@3&2>tJ0xE>9U+s{fNG-NL7*i!DNVw)>Tx3|{6gxDY-6^m=zm$(F)B
z8u8wm@m8D-HasEP-Xv=@pbmjaJh}HqL5i}OGvN<29Vb0P>h-J&K=9AlYgQ6tADIjv
z2rN}CuN;Wi>|e(o`#jbkDS=7H(=#~ZGD#>%ey<U7Z?)R;NXt2O`Pma1uCo6YOCTL6
zNPp;Y=u1sKjw+3Ggy$6Oj(e>;*>z8hI}LwWQL9As_ngG&^y$_sQVwlhiM%7m0k3%H
zJBUX2zggQ=l@%ToDHgA}@a}>KLGv3rcZGVIh?U3X_?&8^zs8M5iZ92+>Ph`>suJ-e
z^f|_11f^4J;4zm$f#NiaHrgQtHuZS;qb`o!iME4yC-QlY^TpcpV3PF1n&pcT6S<EM
z(6gfbHNSD9dG+g=2a%*^IA3AQYD=p)=VS5*p~ZQV{53G7xRJY3)rLLQT!}&aah|uH
zEgdj7%6Px-YZK%Da>=G$>xDD*tD=rOX6zR?&Q5pfCVW%2beZriKheWtrGJZ~h}C_v
zJ&eP4!|mf2HL6HXE=1_6+32x4s1bc-cy5))B}bnVggG`ULqhA;)$BLD_sU0njxU*A
zK&b^wl@F^)z4tk7XH(NUGsLZ9FY|`A*9O6`i;)@6RY;KFsY>38BO8jbPgS~SsEtro
zPq!vGwax2@3Fu@<AS-!IP68+*BcqH<4d@EX``e|1j5X$_>+6~R65zrBugUBaqsQ(%
zv_1qK?faRkB!UMEX-M3ZZa*w={X{{Z?@7^ilc4t^9csbKjlFncJwB^g_$pXdSGxep
zcHoD7>IW@E?(-;}i%VU}qe^0Fs*1z9&wfDtYox(+#7}uGR=$lp$XM>F=Vb?;h4cZc
z12VcbNX&~%g=mCYET9Xec-5o>=Ewb%oIhF^bThfxmO7t``oK{Blp$j$Bv^;_*`r)(
z+N0D3i{jPKj>bXkQ$L8~#0|&ECy?Y+4Q&~DW3$k5$>=-DBQC{oAQD2DzgEawE&58d
zgGhKXew4FvEqKjR-x(6SSnVoHW`0EXf|=xK3>?|I-PO;Wb@BOVDEtaQ-Ng>Gmsj}I
zE^(pAgrsj*&!4I(4SbVE*B2)u<vJl4%EFwSOie-i_Fw?TRY|&)hdtfE%Q2n?VKHsN
z0e*wAc*Qzzc;isxS+X&|!f9yE*SSqrAnuf$@Ou$SFlEMk(2^q&9uWQ1i5Ni^c^~=l
zjm*3p|6qlQcgSJ=_9LhDl`lu&MYc+2OX8p}4RmdgvuU89oj=?Gfb1d3nOFuyNf7Vw
z&8mE+tWnoBcs+59zbkWpd{ZL;I%uYuWRj`ResFjNj6ysL!K$PHcPum*5-tN2&9;O{
zmPSk_pfq_sC%8iX$@V95Gz6-<YI6MG5jIJl{Su0Um&o5gmLeWFKFZgWXJmt5bm~C$
zUYm1|11HGGiEX*hfDgHsPYv-f55zH3W;Q7<nc0i_6=!GJ?R38tv{vzinMriU)DHgE
z^Xv2U?^Kj+k`>a?k2^C7c}SmzL1evtRFd*indsBaxtP3fd$R&4G_p+R=VRiSLY232
zX*2Hhn1$Gh<7H;Le2tDj*ZXc)h1e15{C=+AKX+I~4$aDBNM@{XC<52;2RW{8o-SBd
zxG6mR&LctdXLD7Npc%prMud!5lBt8Cv4%A(r(&sM(*vReJhrYmg9)SZI!%bH!mSHk
zK6he+KI~jXDm9E4PeAp5KvQ#Tpa9zV>Re_w7m9Vks-Shtbp;q<&T%qGZcQ(Z6#hrp
zt?Rp>qAg-sBAnSbb_!iHSLs{53q`2p7vrHKE>pUm8DBnGKXuIphA<_Uz|oR`7w^RQ
z>-!`lVD=M-w4C<y*~w3m9@atbD}Gy{-=+vvQ7Jsdi5MQ8#BILlcO|A?<D5|-$BWj@
z-2B@eDlVe+k3HmyjT9zmrt3pr@}MSin1pHW$f1}E106V&_w!i9J*gl4ssvt1kV;f@
z<5_0gw$|A(tRZ{(Y{u{R%m?kNB5Pl5Sxj4`ecD&>KJyA%1N%o!w9KaP8M%W#7zSeE
zOF~ous?9+KKQ0z;*NlbRnBX1myj7}ea6D}C8KT9Gb=hzIF)M%?%0Z&&HE5Y?N8ZLf
z;^eSH*0by3I4jYkQdB5f8<r{ldb!na9&cL+(0Ao<v10qFBOS<S>@@R~aFhq#;sV=;
z6=6qq)mQTuPZ+oDVR$$-9^{eKh!iZ4v^dr7?*>i2D4q4>Qv$S1))Jd(iYW)JR9YMb
z@D=mA{jArAHOlfJgN2f~X1j}ZeiQYbJw3=`S0bVSNhkyk;(Lu;`NAs33{uh}@3t<j
z(@Nkb+>K+YpdjX|Dzk-^d!|g}1ug-&nO0$ojl$BFt9VI*AV<t%jF2DhhS8b{+yx-L
zsOFTgxl<`U?_ZH(kU>8-`8<LV`;OpWIyc5YGqwbq&cL7Z%DLC-5U(8Y(HKsX`bFf&
zwCgjNVIij?^<7RMc{_~rn!3am+Ob&xzJGJj^rA&+zY9J>P*VkV^7RAVs2@=2)Pe~X
zR0YJUD4Vq-wUaCuG%Y(KKYjT=3!r0bpt8P+aCf?Mvp8;;ol$f;YpYOH#e1kvTSj@D
z$0&0&2v}>${Mq7o+{sNBM+R+rjWHU9bS^r;Gn}94h>WqLBKSI2RzgbO0X&w<j*0~L
zG=*Dwx}jECjQfdhej$BYl@iY!p@_-`h!vWinrLabl#2yVP}E&>Tsv@=+PvOWleoCQ
z9_U=nZK4ySX*rG!OQS?AoxtbMLu8Imqq(j-JDqWg`%(CUjU-_wm?SYdp?GZ4<5HM_
z#4=5TvT<4sPO)nBXt4A`lY2>8HYgV*_c?`b_x9o|5Sdo+fc9L5SYC<VZqcE9C8)XK
z)^o^WF!#~EZ%#H@*&=AYI6^ZzJD40nQGgq-S>p>^WG=8tv5A3*?;Q<heW~})y!+Kk
z%NsfLPmAA-c*vo=o64*nx6h3Fl5#Zwdh>ney}O$&Z3;;$J=G>1af>G`l67A#HIyV&
z{CV+FeZQZQW|0_>gfP&Ov;7>4!`zNPjO=bUOd@(i_#jBmfC(UvC{bQd+KJ68LEOm-
zPhTqQ83jY3C|;!c;e<iO6!F&ENf2f-2dA_*O7o4kP(89F9|t@_4LH+vZ?ESvL-d+P
zw9=?)xuH_}=uOHK#~kq}8cW_%C$?@XnLkEFK5i{oMNhsV`;b{r<m;2UHJ0$Y7|=Xh
zg(8Y&{cIGe-uRsnwSO3*ZDnygl?FB1+4}US*Z3USICTJjw76gW=eiIXf;eMUuV_A3
zWWvn@8;_>XC)oU54jZD)%2ORY?2TZ7XosGrZO*J&71qCC;)rmm2oyBYzJ#HVY04UA
z9~1`y_&i8H(Oxt!x0Q$WuQ1Nq*r#mm@DzY)ghTWR>bYklv1yZSyk}-z!#g4gn5t9V
zZ2jWJy-VoQ*0X6*IS17j&5K)_aL8a6k2{Q3xTpZ|g!1H$)t7CKPxDI)Ghd%PrD@X4
z2(z<dcrDlKI-|t&l4az*eTFW`z+$OltWILXW^1zI>Rp!JTwT&uRy^5eD<f8|U)uHy
zc~nn$dh5vZ6_#^FURCiF;N(Ihm&J~YuA^<+3T0%lI@P7X=h6L<=9wp%{e^L6L4*d*
zTFo@(29UK%*!^mZ;@GhMQguU#)S&+6LRp*&%>@0!27)xO-wdXQCgt9f_Ytk-0t}2+
zTas7Jy=1H!L}mk<{mGkM=<pOr;CFfpA?%h05hxBJ5@9{2csTeT_C%tkBcrbChR%*O
z>@x#qo-1koxs-m;n#alqsm=@3x`r>Lie}rW)M=4%;*sO;cV`wxJ{n075@hRFc@$E6
zLQ~WmMYQC?%nd#@qO61FQt2y_hzO2vS9+!!fBsy-@6AU~uUy^Gr4b~d;MK;`1A=Dh
zY64otNa3rC`#AhIBnz$yEDD3A897~zdxNEg+l0ww*^v!O>neFQTG`mmn;dV|xky}=
zU8*%%XNM7LL^kWJQuaAn@PgbOYUNl~Z`4#UA}^~1!};%%nxw&^q#$^7kkw@dC8C%k
zhER?lB8gOinyE^{SgMHTV4Vzi_4)kYB??YF{Dn_WPHSW$>VZO~_*@7~M}+JE<W>}K
zgvoA>u#3b1xx(LPjv@J5V%H_&z(%!(mf?{B&yrQ$IxU|y_E5?EziP83M|r61y)WDE
zykhA+e<vgN<XHXw<tb8nK)0_ZdmEQHtxguBxqcIx*u={iKpZ&y-K^KQ=}WhEG(Jey
zp?TY$;y4*RmyoHrlWe2LS;M$12{yu>EQhE{0p)F|GuqE!Zt|%Th%y$uzMmW2V=E0?
zNun?X$O*V~rgYlUqvm-B;{rS2gJU=A%+?1w_Eb%AnHpg%FfKlk15P-_Xeygi$Bx|?
zzWPU210@z_C-@VFjy)w&-WTiWA=?|6N`DFRNp|z=%bTs(jZ{e<@l|bVUA;pdrw5He
z!W$yZ>zP~LZ=HP)w|AmGCyzE)N27Ru{v{$ZE~2z}<rzYKY=Ci_lN>`?w=UnFeqCfg
z5t@|l3R*04syueHwtFV(6*c4y*J_cMqOuuxm|~^0=_;7zt4>A2$KiBp9J!jHqwg}o
zLb5C(soG218R&QzNC=uWU#pQ#z7T#cCNmPCNgwsmx+bcrezGxE7L{XHH9lc2C#4SK
zJv1O|PWMN<BKw=3&4{iPbxy$#lbubaP}q~~1Nj)U)kEi+%^AV(!`d!r-yki5EM#rh
zO9^m)ueR#Xf)j>EaV}7p{zeFHe_s0w-?rc7i535`J|<Bz!^>!;$Nj*P^1EKl)0Y|d
zv4b_bXv6fFcV0okS%^b>$CA*o9jHm$J0?S@5~5b^U#J_3m)1oh9%cWlqySfF@jEV0
z;w_T4eK2Ea9E(EQoV2=FNQowGV|li@^=0L;`lm}GM#vY{;7r$4>nZ8gyH2~oEvAJZ
z4(l1pwoz`M0wH1*qvAznXeB2_++w+^=e-#)vk`5|@ot6O@tM+U+lgrMk~0gax)~c=
zCFF1t=V+C5hQ#Fr=OtSo8G0<uL}Q~<LvY}VDLKCgd-4%^1{}k~uz&h1{Jc6f=qdxP
zBkp#$a;h$0V|%ZRBEmZAhNM>MXP^9h0zPVtBAUB?#Cu|{OA;{+(C%PT&7>;>0>D4A
zR0`!Mci+u#bRXxeec_k^ID`x1__}7*q2=0=%q`$~4cYP^DDIPkiY1S7_pU)6^lOl=
z!X<fAW=a)B*sQyz1+Y)7(PX9%URE16PUQrL&zEnJZ_K}@>53Geq}E&E6z@E4f{BJT
zx%cC^=J_OE8p+@N8Qpd@bt~tI65CDg=YiaTAQGXRjfUmm{*0Ay8SD(_F`w!7Gk6LF
z+p|wqe;W-VB?tOFx#{D8lb8RQ|JRrMCwaS6s`PVQyVzKs5-kd{=w~lgwB_K+BHDh}
zUHyF(YjbwPNTE#EOS&SUHl?*m?=dYhc1By6n?-Y~l^L61<Oqn(Oe23QZ+EAEP_bE^
zf5d&-L!bsVbh$qr22s*I#);wuvQ|QMi&cc-)vtw!50j}m6eB2|vnMW&5o<f%9bNE!
zMKqi1A$6SmYYwhBqM3Ok?AEvW7rl&3wdPEu5FLJfbiLuaP{ZA-$%Ufr-??8Y9`}Xg
zeNS^KUdy(hMX%m&m%dKxiLgE_XsB#L#l8Pr&Hu<^PbXyoFMAZ*-9CRwea93yx^L}!
z@9mFreJ-Ik+W1<%#zVZkhrz9GpFO}oC#@~q_R~@;rd#dl#@wGro;wG{jWK%M=aD#;
zyjc;zNghqhMDn|xXi0EJgqk;6By-eT!gp=v@<Pqu2PK7Wuc9on6tknb<nF}*+6{~4
zZcT9c?5q{M=6>K}`+0zBMJV93yzYAu);>R1Y=*RAaR6MZsvRQUSpR)~jM$)S*Ha_h
zv95h+aZC{>enxA$(i;`I8kSf{M4?jk^nmzInmY+;1+(;lU>fXD19$=l92VbaG2y~p
z5t6l;wNT$QgLV^=32q)nr~l4q?OKXFw*`8}bVMDva=%?wW)QYJUEbE|nz(oixp*76
z(pT+k-n_l_*Kzpt{JF;J2!Gk>+utmS-x#8}H_#wDuGE<gMd9lhxi3B*<-K=b`CaXV
zQ-~a9SbXp~uh&q{6gfQMGx<Fa4Jq_r&sDuoRapMlAqK5ZeutShAH0tX@*X1d9{w3*
z`FkIy8WO8&d!GIwlZ-q!@mqZ#57P6T`%#gbbVObD(lIB#tzzB3O=~5iC8OXW2O62I
zH||xwTMyFzJyFz_HQPK`%#2S#tolhsd{J=wEwL1r3Yq%+_NH8&5)>2KEhu>yjU^3o
z4Pr{&VOEp5C$K{BLuDdQ!^du+*Hop`Byl0;icp~K$9I0yxD1bBNTGYm2Tm!&U6)hi
z8-QYzjlPsOQDf_#<4u)`;f8<6DkYM{AN55Q&^aMJ2AK)nM$S@bX8xU6Ai^mPj2w?@
z5T#ylqgTPE^69mRce5}Rlf3s|VQ2O+>UsSBNA%mHyTP=`m8ySxyzYkgS@rhIAwPxR
z?VLrtuy)!%c2v5F|6{3A_6OhVz7U_W+L!U#m($v}(|;TThmAHh?UhEGnc-McXt++H
zND{HM|6GQNb&S6q9ErX^^0(<gYabdcp&DOv)1~l{|JMR6=Uv+Mu^;pgM@vYp;6d<*
z+MQ)Xe@aqidz^;~rCv+t$O-RASqZ2z{I^^*fd9Ez8hWqrMbi!;$?qdhg<!l8wSkhG
zr3vOdBQ_P$IZGhzlq`%3F)aPFTO}-)T#<~9m0R+4R#VvDPK`op%W_8GM{dCFE%j>u
zQt#ZkHH?)IdPG8`5V?x(h%Fi{o(&A1d><f7In;Sd23>5@iR4i((J{J2M$MMC64Iw3
zwR6bBvEp`!XfQ1p@JH{6B97x82Via7?s_nQCF(nbuQPaH^0G@<+xzwe-L`4mlL6hi
z>EBIy-_9Fn{2zA0_W-@`&%N*MGk%v)3--rAVV`?4&kYwWk%wPX{M#=`f5BYXW&{(o
znCSo8{G8@>anH>HgabcD_RBwJ`JysOw67Q-Vkpt0RV$VTqg51m_D1Hmt7?T{iy<j3
zh@Zqh#KDQw^+5Z>Nj(gj!^+0<=99vPlnq%HL{=<jKcN5L(F-n5trjVoc@iwP^t-nk
z)%#IJN%!y4Tc@5N5oxG#X8$hUn7$%&`4j^}-Ft5LO^Zd$ok#;N-#j)1{W2>R9cp$e
zl^t-VZ8pWJU49k+Zwkuf|7^6Ot`sG@X%lw9q%(32o_|<e^BqRadm!X@5cw1Q+H>-I
zINtxZ2pW^=$w~CInaRnnm){c{UDy4Q47pzU9N*3iwx9NsRiN9Dg6zBVlAew5<9_n*
z2chjp%s@W-Qkh~b+gh*7@@0|fff(qVET~}HaQj%L)=2-?N)_RvLbeFmO04U?C@LdK
zcqShI_eN}O6OC%bVAwPqJk?&-Bt5KoNvfZx&DanYoRE^W#t3~p5T&*19V}3PMQ?SO
zW2GdENboNskx)pxhrY}yyX!05tVbc4VGx&nUw9*B3gSV*7K^Q$rV4bFZxo#vh6^;H
zKI&23G>QKl2y(BXzBakyA=ATq%||nyJ~u4Ex5_BC<l}_tuVS3fy#s>LsC;VkxT)=~
z(*vVbdSMhjFCQpA=G<((Qb@qT<oey~!6c<cW0$T%<3o$nbEvQd&E#(bqAvqc_!1ru
zP!`^VR#lU^vKtgVE_|C9@4NqxY53{rzpr<TI@^AKH)Wu^H0TmP9-4t<D6<$tiM8*V
z<32q}?D`3-9s4ewOIM3?vTBN;q7g$<nkM6c2$#CnBhk{KEd9X%=@RojtXRZ#+*&t$
zX13hTkm(#9s$+3^@)G+y_5>H?v>J_m8U=pdq6?7HSzw=L6*{Iz9>?<RCHCQ2>xJx(
z#?@t|`X|kL+W;2}`4)*2w-l#Z6+cyW`B0qaQLogH4o~mVkCc_GKgHg1=jG=JAs1;-
z0seTF?~RJ_!x#3)Z-F0QEq`yHL3~%^1i_<pAXyC_liEjIYQe*dg7t}LjvlXnp9oDy
zzmNXWvEUz;T6^68ZhD$H_aSb-UU~++E(g5+L$!HcthrBejgSo*v#~<E59F8v#?Xdb
zV>ln-JLMq%SnF7{;bGL^KPD!?HTd`nT)s2noMxazg@f?JYa3&Td`vC)_jE);sK^|b
z0uSjBV|fb}Zistb4#CB8T)71`>AFsk8V4B6@T2B#vKf$^Jo!x5eO^vS1jx*?L<{1^
zYqMBXzdtP9>=Lt%(m{)j7^zfn|A@%1UaVgF7c^>*MisY3?rbo^?LFbiSYtIJF?pdd
z=N~?hDwVC=dmUH({<Q09{Gh+xIT&nqwbgwU@cz8~U9a)$k+NO`6b{zj-oE`*y`4lo
z{||KXFhH?YXEyMUMEZQ$`9<9G-ZVinLx9L(yTf&P`Mtu3+-^<YKbBsDE|*@?1lXZV
z6a_LNN(#UQRu?;nZ`qoZYnOtoB?b&th2Zj&)R+n&U+f{sqCz(l1XQ+t;?dFaR;9<h
zX|0z6EeGGiCUP`iPF1dn<@z5ixs*Qfd|;vNl!M+rOp<dt;l`UX2|YqJnFMe-Ah4u+
zTx>mkE*Vbzz+0;>BOVIPE}#j4A);No{EdaPHWO7A(>=pV(qarw)9@t@O|<7Apz9%r
zP-$D%eC}6Cy0JGD$oc;AXXbr1?=>^Ji`1!YCydl7qUs;l)BjfxvQy9FAv}FQ*<`i=
zh^va7C&ESTa1?FlogE;tFs+ACGpR`FjW|_zJ`^zPMx{gjKfPULSX5EBrX{4i1V$Q^
z9*~k4x;rI?8io=PDd`*m3F#iXyO9P_q+3!!LOMt3d-$H`-hbcUJAY=LIdjfF`^?&F
zt-aoNzq{de$~j9Y?%=*^Q>bjq(-Q+j?pbv8rZ?D>%Dnocx)&y&teA@gJ=zA8jU7Q!
z!#S5zo01%3IlH1%ALIsz6#6T5VbFn*CP75J$OY>#l?Jh|;8fpOGlzNatBZZm#B|ve
z`i?YVxgO@%EST{M<kkgki->t{r_MF?CV1qj^I4MeaDJ`ztOA<!yAwX3!@s-bF}b?m
zZzdZB><<O-K3{8bV+xvto#R;6JB;V>RJX1_q#4z(I@mn|Fr610|2&LyK#9;x#w{V#
zhg^wYSbP!A0_~c}s}G{lp@>ko*7swPq2qzA$NjU0<4&s2e{PMKP4v^&F4!-H*fy4j
zUsGCT|K+*M7ercssuzWrjZWbo%DiJM<{Q6Sqc*~HAy1w8PF~FiNFxx9mCBsSQ44Tu
zPTg7@n`fjY$(*QSIyeq50gMTsxm+jOiT%xoH$SK0@U$xV{vjc}bQ6j!++`IzU73H!
zo2&9&)YLWYQRxp|b(MT}c|;;#u9*{f=fh`13ix>fv|{i~_g(74$Nz}sjtGsvzo@X3
zIvWA!?II(eT-^X!0w55&op|PP11R_i1=)OjvBivnTh|?D2)l<t0q{&k0BIWeC}}QC
z*(_>Kp2`AaoWi%9*t~~rra9iMxT!?D@~l$Ev{olAx=OnTyD5)K)JT5T-o?pqPsr6q
z6@yyjV4sAj{Ici|4yp4h_w0+jPd2hnCDV%S791VmWTPmiOp1mDTA68|Dn|a#62CPu
zJV!h~`pIXY;z*niyyTU^bvF7cJ-+VFmOAYdH8HoHOz2^;6?1p1-B-ljf02AQ+qu`o
z-$EiWhnNCy@Hn!L7i{7PQ(oTv+ZbZ>$`Wm08c+kg{SQWocen&Oo^vMdqasdo?;q4y
zhK;%e7y6iPCz-N+w$g`yL{)Zw7N{`uyT`{T(%u%-QAFU$6ZqA8Jh@V*^)BMT;!v>m
zG(2NdjBJX+%+L_p(aCVBrMag}BX=w`C@6yRaeaZ0*t~Wb;m{ZTEhj)!RccdhvsJEk
z!<Bbg{y5{uUfSLQ-0*-)jRv%=?!DHP{mQ4~V|qVhcn$Mum3Ac~Arpy!@azzyhml<~
zG!N`p@R;vuO$ZcC@=1N3WYe#iru)5F%YSzVaks0HU9~5TO^?nlR6k26=~lOGWdPzo
zfLh-obr%rhi2+%<rg@7!%<jXs?VN|%%SHEZKs4;A#bpV#9?hp&&m5HgpVyLGx0LHI
zVEo?!dA29;z&_t~no24=q!08y6{}`x9Wf@+eA4>e)Wh6qP6*yU=aFK4X64i+B;PUF
zM-ojNI2(l!Pa3OKlBl!zlnN;jNm8YWW{Q1gJvF<)sC4mag4Do+A$fKHfm6$dOC?mw
z$RhR;hgdhQn)|8ynBiZMw+389yQPddggDNE*5$d(zpGW=RM()0+b-YlZsjrXjuML(
zVo(LTfRS&mb%$Pqi0uWY>U3eOT}}(HciWfd*IIwg*mn600))j5>;4G;Yt%zGDvW9Z
z))5>JDpb^#?@#F0{(br3u(x0h@&&#%tg*QDwK#p4&h5=rT|WrST_1G^CSuog9Ezho
zNNC!nzG?<ML#Au{A0UIg8}sTqljuH^0H!Lpr>Wh%gi$pPHCRLD7u%7y4A?h;mUPXR
z0D^XcGs!T2lh|oV?^+OMrO3@nVLr$1oxqNWzb&)xuhJ~c7RvhPDvCKpI$atvQ>8)J
zIvZn#APN5-g)Cm8+=-zZ^^ILX#K#Q!Q58&j`3=}A79<eNS|$Zm!{2CeaKqTO+v0EP
z*!69sKFsx@@xz^`6BuUvSexNvAx$<j&58%h=6=IRu=a?qEbQqBud!um5AvYGp76fI
zm5!s1qpk-PQLUG^=O@50`C*s35_o?rP$A0PXB7Bt?e1W$Ywy+3;+o$JJITMx9)O5#
z_vM2M+QSJx+u6W|?(@sQdmYJ^$Y0fmptpX~u3(Lgu3xq-v8$Fv;0FO_5gLrASW4pC
zp7v71QdIhI27nz#t1IxD$v~l0PP<tMUrrklFCgeKsf(u=TvW&Wp%RZYs+_L3&<HO=
zos;5@9B!)@md{9l!6%5=Is?bhn4P9a)bUM3E1Lwm+Z~SFEH<>|1nJl4P=;s_sWMX!
zcq|q<>bPdS@LX{bV!{SoetZAviYhNLFAiv=d~$%kPk2b==y;=5+ey{zfK!FA*y6q^
zWTryL^o@?gLEp6H+&y!Cp{Y)>S)8dStb4gp)v?qdovLw48-O@+(|AZ*zus6#fE1T_
zg1C*R_H592H9UXiOhu~0I!k6VF_PN=p<WpiAKm*J1HpQ1j}>eE_3EpRetZMWAAgG1
zrNyv;g$F@gkB;r}crL<HTI&x3(ZxxuZvmrizbl~Ed=;2ynGAtW0`BHSQJ}+Pwz?t=
z7xVJP=Y?E!7cpk1iXfv6dK-jCI$!YJ4+e*~X#NfUEM`-%8qYN$a)Z4Cnr04=B)k0q
zDTIZh$pbUW$>6Vuhp5nVTbJvn^;D1aj24Gw-Yu7ZE-!^Dhv~!2WA$ykSpFQKN0kW{
z)Gy1a8`9Kf%aO;eCc8ajT&5p~K&~C+z@q80j~>ey2M&wdw{P~vjb({%x{4=wKUJPS
z7|`uORq+V4de<Z5yf>K9{t4ssShBFuFhHyuX_``DejQsyh1Alg>3SK2#r*J@Z<Gpc
z(-H)vmGDNM+;sF7>xwW^BnV8wy{E6dhDHf`$=O0aAwc-MjRIpg4KKd66kpa_t-e~4
zX>M$bw|`3eD*$oUKRYOVJgI?SVnifwU?plRby6aK)_OAj-H^lx>>>NgYxuE{wC}HH
zduu5-sbbDQ!`&<Z9u)(|a)qMM6TM7x1s-v$$(}CG$2Zi2Oy#etL~>Nj`}K=C@7~LW
zKPzK3w>#%L%e)DP@h*^3{-~Hca2VhX9KI%t3;IYa4wD0=Pt6m1X?h%50}Eiel6=z4
z_v<<mK6x#MMg<KUOt}XL<t>GxwuIgiNAqsK16_)k;{BbMU6W?(Yyaes=6>eqrgo>s
zOAeH)iO`!}(x+IQ2AQ56Q&+ZBWhhQZibt}*WSvx!TJy$5>%)sNNUP>&tN>uI&A4)6
zn{GG>4@6s3_z?)9hP~m;^fN=)yXH2X_auD6A#GmpExjc?URqfDh+bF@tbyDbWyAf;
z83)_gHj9n;hZaFczj`M8mpe=(Xqv)`<?VF3c4`VjCme-WCE>GGeCBHA_2$$P>H}~>
z+;JyV?e(*cAzigxa>k#>bMVe_qCMc9D#o}4?J3$b!KwnYk=)N=>?9m>I=w~&LItI5
zbh3teB6zK!%3Vx;`|Qy|vN8E~K%3D)NQIOnE<I00<)!yiPyYo9r1pCw5h`=%4)&yE
z@Zha)PdFLo6M~9}Pq*-Vl44*Fji%v1`qhb4<^(a$*P??Yo;g5)SWI|=CHxjj+dLd-
z_Ol`Vca5RGpazBMx5ri@`8i7G<&#JzuZo1pHHOq60&bb)vPFL1H+ag=(DA%`8sLLv
zGnMf3DRvS>+J!h>;;+WpEbz11?=yFLi%FH7LZq{G!W0-J^we?fi&6^F{fRFINIdq6
zaZBjYv~g>6nYq!YKF;TS{`E!VTOcA_vE^8}@z^ikm~Q7n=XGUooKphz9la9DrjW%1
z#uL{5o%4<)wA6H!YykAb`$I7<y+$)xnxWt>seY5FO$~uv({G$S`Je;b-~PRZO8v{|
z;K6*IJnX;&E!PHwIPIG~T1b&nDau1<2VpR$w<K`Q@VG+L^9hz@>H^7KUK7Xoa_d!d
zlS(iGD+ri-vp_P<U-G6PCqO^RM>^jn^_hYjf}}EG<hy05M2|0WQ@9FMUX*Hu4;?o`
z_qkZB+wGH8x__3RaXU|8JH8p;mK3v;TdyNaOva}|an{;n_>(0kNTW*{+Bij5)f*7~
zST5qkH#vIl?Y#ZH<L2fZ>9XR+0-DQd{Po4d)yz-#)Dko)50tm#t?x%Kc6176uUg*3
zAvt;1V`z2lSajiR{D$oKkdXb`n4WBD6bXpXSR0ftUP2O|uAz?hp;X>&T$FODF9oal
zr|n6rtCL(L4%h@UH|K}VUWOZ6p$6lUL^|gT_K3|pEevkOP+U@-UA^2hzFJfvVRsru
zn)3c5po%4rV8`c(wlnW+6t)hOM83f`ITm0gD6z%&H0+1Odt@+FPJncy{$=i0KC;cj
z@`=Of&EPEToxmZ3d$5p~*5fK2v_3+IVotje2X9lDq?g5SYbxySs%Wb$P=}*=F&IyR
zY1(o6T_O|`@t7;6eERvSHG$y^|82E8pxY0)zQ|~AIf~{fS}1V=c$_?X50Pg}zo7P<
zFgeRN^nJ;_jDJxTwcLxQp^!v6iVCnIAJuR>rfNz~GnNr(OO=eENga8P^rM^D=$7-D
zU3lgDM}9(2)U2^O$t(~Dj$OVuNF&nRrfd<~513G4E2>JU+k4E#NlP7Hoz;S#U~MYb
z7}{!tgEAF!$3@*FtJJN&LEF7xAh0!67{OZlk=WP2IapHBz~>mZ@jW`pcUNyGmP6Q(
zh;I_9fcz1<<bI(j%pZ(zbev}Lh|QEIiqV$`8H^oit%oz@g2%hZ`F58_>#F+I+w}-O
z^V64szY^CpsDOq!-dsV}Cqh?Gz1^N*Pbli{9D&muhn?A>^v`?2{@>X3<71Fk|0WRN
zOce+11?La0{6T#<dIM{M+WeI&%U`I5i3Q#(vvBK_OsC?re-Zko&qd2?N34zBSVm#1
z$MqiXJ=v$(oH^BH9KF0B9VQ-Zj*R7}j@UhWni(d3QzNn4%gr*mJ|OpavE9Ub2kAA}
zL#?qi^EBk-0CK3dEg;Xdbxi~JaQ>qzSVPE4K)t+ImrDS#S-^=!uhJV<zR5cMLHW9S
zFsOJQiHpSnzQA<|>SZJkMwI5!w)JM<7Rh}1+c}#6-?RLBoIpJaQ>mm3dgA~x#dpSU
z`cz=(3}K^45|n8?{Cy!>-Q{_p;`r#3n4rM_dIjIKRr8~dPIb*XiIFbl+MHQ<gZaA#
zU*=4Zl)~Yo7=-FUcIe;QA8!y}$#V;P!HTLhV{4;aosBCQjTBkD6}7|C=im8umd3v-
zv9+Im<QFa*<tc0^{5^XPqpk_fH@%Fo<rvqIM*vubdX+iWX?K7CT)|UXK#kKl5or14
zpH_P|7AbmQhSju++C)Y*HW`F1BMr^l)B0sFK)ABC_-Y`&;1dmG6>lheV^Wfek~;3S
z>QMWU3d^(h1ce!2+E&H`Z5E-P*<mw(tnkayCa!R~4CpE$nz7#$&|;h2tMVSmx;8Tq
zBaHc*+E&Y-hdzm^qIez5sbxwZRR7V$O{s1{QMdLZ$77ahYwR*SS*m&Mn%AT+wb;po
zTw%(F>||tL=Z&CncOB|V!SC@bEG9fRVHfnE3FLf$oIRmjHf+XIzeBzB*0Bp7(!^19
zp9^$zMdbyxXo8sSLl~!GNZVMHp#a#+2i7oI9WycrO9cll&Pp&qJ?J+PMW*_KzrnIk
zRoj!Jc<}kBwmwWqSXY(_82pot{~Q;aB;!65lye`AqdjDL&K1LHUXrNSXz#|49R*ua
z*>kfvn=I@ZAj6yonCB_aQG2aaKJLu;T-9idYsc{X+M)OM+k#y9KiCQ`a8Z)Vn;N5b
zqvU}z|Gqx%Z6i~p0`z=oVvTpRSaSyoeKa<_*=~j{u(=yu2}xAbH1li2o(6dW9oq2`
z<-lf7VTWtxD)YWNXPj66X2Ky88h+ac!w&lvu0w&c1({u=i3vhUb0?Vbdz&Z|G!sHi
zBTY-+^}+Xxa>}vG5OTB&SnH}kx!a`v;0e_0OS`=jVE0W&pJVByx`)u0+HMN$6A3|t
zIBGh5Mo0IwEWBE!3n8F~Kw63W(J5^r+&bYyzH%^&?IJ6)nVAA7j{-$F4P5q|JkrAQ
z!=j~TY4SIYMFK<yt*APMX*iLYPjpfuiuGwFU{Hq4+Ihq^L7Y|x6SZG!IB@5)>+e#|
z+*ARNw1o~h<o>8ziRz1J<*MiU;ZI29iou_QKi6V+sw1aa&~hOxVfw)qqDbnGA4W|$
zLD-N|^r*eecMUJqewkV~q&q_?J~!!HRR6w>kxhQ1)HUHqGQn-U@e(8GqQv~|_e;^y
ztVD`5<0n7y{0e;@fYoE@b&8Fb|B7?#qf5D>K6|j#g_aG4KVJV9k?*m<7lpDAKolo5
zLT(|Ba!`hjb(miro*BM%RVkAs!47?H{iG(wq}~<Zph7`{xz$kSS#zdwl7@*I7Mdvj
ztH9w!vo*hs5iTd<Bc()TUhWv`oCvBebB?;khrIlC!fZ4eZ2fENhwDI;vmLZ?nr3Xy
zOOYauN&~CerLPjQ;@%kIG#(-GrreIrOg&j5g{1T#4ra8{|1%EXe*L3QrS3RcEC#g1
z`*PZq(ADQC_8tHkB~17e(gJxUDLGQWrr*@}IO3|pQg~yY;sxh$p5v?Yk%u=o{uK=2
z9LbK5|F#F^m-W<UQMQn^Y4{V0o=H-!sNFF<XgK$pbIFW3LQw>J!E@1tGhEh|vK}Mu
zFp(%L*Jo*Q?Kbs3z(P6}0usP3!zGVoY!HmgC*JEh>o)UIBM;Z%13S{BU~2SeBzU>7
zD$s~q%T3HaksO5ig@8ObTKklY2T1m`sdtHjBowJ{buN@W4<QwFWY@aR-q#A<*L?T>
z^;V#|T4jYavHcy<`S10{yf%bnRdLeXa;Lk)_AiUSN%G}74s4mmFNNg?EC@B~Hrn^X
zde}c`xGd0wkC2<a8}<mE+hE41!+dL3_17_ie}*h%PUtJWR_Bh*-u*>Hi=}s~Rsg8(
zYi~5OQtLw|Mua<h@l5q=PM4Ga`DnC)6X&SAf)VWZwyX|}d~HVBw?zHVM6{gtcR>8*
zLN!I5RpEJI*J@!!*=AGoNX7hPFZIEQjdncIp#WK0O{CIoZq1b!y_N=G&r}40!Wn7A
zQJga`O;^WqkCfQ`SoE|Qbon4$ow(27bi)q3&*==9%e!sdz%|5^gu&C=V>Ysyibqww
zroa2hh+Mu;?)plGES3iVw;p)s=61PZ+Y5pIhjp!$cJb|^lM27afmYj!k7Is^p90=I
zOkG2IP;|?hkN^5Rqwny<r>M?Gr~#GpO^F$gVy8tFrv7o7&a-{Qad}#waB}O(48h&^
zNB0Lq;P<uxWA8u--nU;TV9*?X=jxVqQngK=ulftsgJespTe2<&skW;*Plz^yCm&;W
zUQJQWCdDwfSX^^&{6q#D`ct;V8Y`#pMD-5xDw_D)TQQ!2^R-RcU>lCq%XNPuqP04#
zEHphp?uAG*@0v;dFvMkl=W~3Y!2DWjf`i#;!QyX9@IcV{y#TU4T)qTHQ@)ea>?Z~P
ziNl)-xeS;~R1ADDcmGO@I8y3$xmke(c;)z5q&tBZ$l<8_#YU~~(s7_do(~S>JY}c}
zVZLh{g`{#^PTA8^u+GPaQkbn1MDy0<srC<17BxIdR#m8b<btPHmZv$-o2(kCtCF%b
ztWQ&*YRglw*r49U=rc|F9S-3o5X}x)%{Hs){>Qk@ch057N+qIr6yPJhR(*Y!$xdw#
z6BeieOoxAIbk2JICtxjKCsWKaCK`=uJ|?|q4X2K7hdZ}VK#_Ut2u0)PwGq<zc(G(r
zZSZi%8jA=ie7J{DT3YQTqtoH%^LC9R$)ne~BM^|gGEfLfGlDTGthr0r;*(}<CQmkQ
zBTdG86m=h$E7DTVp{N6J1^sKAo(Q^Ev5xUceRPfu*o~fJCt3`XQ^9GrRw;Z%%S$Bo
zZ-8w+V10^seEgd_YYJMcCb7{N2Y{uVefZgGpEWH`fG41RG#c)1C8aK3PQvOTChu21
z&l_c^z41bU|APZT6u^2i+_5L+wj+T!%%l!Sx7TE9TAm>eUbb9v%ro3Iq$%^V{0_Ss
z5F7|lVEMcg#yY~uNHT1!?{9|&CY77}&7TMo4~a;5OvVB$%3*(oDS_I^HyC7n8)X$A
zY9F@ow&OC!BhYau5}fOPD4E^+&~+fdq`9fPn@77(rVxdhG+^zCSpHBzN^cV7K68S3
z><;RgS(0zh5F6LVx=e9t@)LuLsa(TdWOt~$&-IwDerx&f9OpIzS84?wqA?l}8zH-w
zQFtbU&@|y#jLm!K@>CeJQ@n_<8jR1%PNr=XT!@pGe_$$)Tqvb9E}UsT+F;l3AQN(t
zI?K|!JAc%i<ump^yBPxIf|3e92d3OqX#P5|;9<q!yAmEbp~FUl8D@&$3Qm5e@Vrv-
z5eSQzK#5$lUPVlHRGW;`dJBfm+{ZhuR{<9#&+mKQ=e9zie^@-i5O&c3AA0xq6$!P0
zXo@y7{6qY{&yF62eg^IEIc-8OZv(q88~;gUthoU$YR)-A@JkbjsU_<oC;O$}W=g}F
zP;LoNf--}&t-L?9SH{hUK|fO<8a(eO-+9Xwd)&FXXhQ7bSra<u%gtEYfbv-ic{kc{
zG2_G|_0@N`EaJ}BELIHl^W~}A;lfq57vC{LjWva2_|L}W`;Mznu2Z*PB971>4{`Cj
zOKDDaL4C$bEyUM@KZDftnvgUE=`YR7BDqp(t+gO#X<5=D(xQ$zJ?GVZJ-BwaPkMHN
zhK8%50+H1}c<@wzSmX;3*z!E-?)<(klr;LokmoZIC}YNglx1AP@Y^k4rlkrZ5jvuD
zPPW;wyt_8f3llHPTOqSG57aM7TExH`1@H_<ijbT~=d%yRPWa#=nkDXi+O*MV!Cc#u
zD~%IVQ#$>Eu?&*yMvO!A=;2ns(-6A+j_R(PLt^uQe_D#5I`dv2rPz#}Ft4dPK|L11
zpUKdTgD<|RDPyT1a(PBt=ig^CDnVr9$XQT>9Sj;2GBe8c{M+rj#<ra$QscmypgbZ0
zj2Qw1l5>BBPIaeYN`~|be(3szk|v%>ZKd=_TKOaxz8ONr7>-cDdTwi9taZP9Eq#m3
z6~EzNPEh8Rd^kJiM|Q=#S4|}j)y2dyzpS+IJbJmbN9QV!o@i_n<`-!2eSy-7Y|Q1;
zPq~=4Z^dX?Hf$t%jHgA~Xt9!&)^ra4QY5p62G{xT4Ih{p9$rmL$(|)IK;6FNR5cgP
z!*GqsJKL=M?mLru;yY_83*f0Zgp5jmrswznZ4$fX=3)X@>B;{}YJUxZ{sK}DgQqWU
zHR;aE`lFM-;5H_Q&>5h_IZb)6qr2%a!Kjua!Ns|5+fl7M%fErFKssR@0mNcsZvc**
zG9Klzo+!p_=loq>r{_|1EUpXB7(Y<-WciCxsE)k*qS5F+eqk1P+1+7l5%&V<JzXJ4
zofm((<E(KGa`Xfl^5+@qwS2~%4V(T<x!eRj;V%>tMT54(Lu{VQn<ke3!1(#^v?*EV
zGv?m2Yav3%x)fsyU~##WM76KnmN*G|=~mYlRA$r{c%9+0lS?HPY<GZND;6P6abi`m
zm1MZWMX2wnFYCFaP!h1YX3;PanWOxfMe<@sj~?u7Tn8OA0Qg0Bm)n8BZUue-vm@@s
zR@wt>lccBlqBWIa08C8x_7u6Y>J*fl-AoMFlR^liku>s*GYWwN!OctLCG~y!E?UQf
zVe=;+9H($sb{OWG4`;gyyzd}3zgnH9`j<wI5REZ&>%7PWcsK=d(!Tq3L&J%{{s>zD
zb7HO0aXOS(+WR%%izt^T!hpdbBDy&D8%;ujK%-<f+Ou^egH<gO2HwLVyJah1$NgI{
zWi8rKE`jHlS$Rpu_*PrVJVw$t$Nfg;?h592gM0xeS9>*U9bRr+{WtSYU13o~Z!_Jn
zqJwdT02Kn>cxikz!J8Gqz`?3UGkAO`GGmLV)1gl=#D!oKnMC{drtiwOcObF%zmPm+
zKmTTK_9=W?p-3K$i)>rn)=_=|OAfEpL$3<7;8EiVRq3>SYk~FYU-Y6)u^ONFg^;L4
zqsze(_3jQCLjI#eu0K@|0H^UAKVT^s3!Q!~l45zOUvnQdj*5nqk-6j~eBiH(nt-rG
z>Btqq)}RrgoabG*d5%hX&#-#_jc8Ec&9B}40Pc`1^mp?|@!itiQ{aIv=1NUG{8Mpn
zADlF`y;n6x>fL!SzhJzLVaM>NUDe%e$~j0cT3U0J|5D&>Tx#G}arD+1CmCXZGz^%l
zQBgO$87Sa3Xf*tDpcx;i<lV`>aM?*5R7>wUPd6L8-d7s8Ona)rN~VOX3pBuZcso-b
zfVtn3)KYr|yI$}WB2+jUS7N%N{uY8LBINq{fD7Y%|9i0X$V!-waX^g-nyDlX{Ik(S
z4PGjKxmc1;<L)?5t*{Q!<|AE2r(^7!N3$gF#+sJww_2V{B&2yMuMD4!zkF%@yeV5R
zbItOM?NQz6Q%1n{2BQEUp!tu5v=+l$dpnQzI$r7VpkQw2?Xps!*V4_Q8>o(73_vNh
z#D0YVM(kXB13)t`4_h}rGu{PRydhbVoC2b(aSX658XryO=kVj#c$d!6NzFT@^*@_q
zIi#<;%};+Uji>*;)nKK<DN1sxZnJ;)4h8Jlg$n2EzB$DtmV6D6^Aibweg+Ug00V5B
zzf7EO8!ZZZo1((2yWe_>cx4$#I)jXfa^As;4K^Av$Dv@DZ*~#?6?gxAD|~ei0_{2h
z5HMGO+PBu_KMz1_yR#L!-s=b@09qTQw!8s$=W|E>aQH3`IUgX`ssy&n@$CA2;q1W$
zRF><M>-L=d-kD##A^~a{X&<3Xu(9mcveJ!3ha)j3)JHGA^XD971feS(UTa=!{+3r$
zsW|~xe>UP?-qnA9-f@3-JuZ2sZfPwOR<q4k)7Gae2e{S~=umQC!=BdP#srFipMl^4
z9i-xF*X6SYubj?<^%maqF?KS<Q_A$G>bw>syYX`Obws`$KAD|o`!Da-z^nwoQPB{f
zoVu>?+WeDBXSS5Q)yS&P+<vwi|EmOL)-BpUyq}C`79Q3})*K0#r3>U$F9zOp*Q|BD
z2)6<yh+%zYu!hzF^)LqucKLy&=B(q{dz%%xBYjYUvG_wqUT1TivaxL9hx+8e{?M9y
zG|(C}5<Gvl+?gwBgVIxL@Rb1kEi*9R5W{%A=62J))XdP~zxP@f21-!=><)|yG6V!_
z@)U^2z&ze~4yc5%0>)ntL>Ax&tSKT7ZU+LYs|1Wg88~7W3+N93M|hq7?^Fao@I$ii
gbbt~5|6Ssq$+dBq!*ngq77ci*C}={e<*Y*f2YaHAVE_OC

literal 0
HcmV?d00001

diff --git a/demo/documented/tensor-weighted-poisson/unitsquare_32_32.xml.gz b/demo/documented/tensor-weighted-poisson/unitsquare_32_32.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6acf2ce6fd3b2b47c90e0899e6ddbace3db4a863
GIT binary patch
literal 21613
zcmbSyc|4Tu_y3Gt#!~hzW8cY6sA0%1TSeKDEm_Czp$6H**pnq|Xt66IBx)=PNf8kv
zvSmpL@w@I(&r_e*_pjey<L#X5ocDdtb)WY+*9}hs6^!qzzA23KM!Jz_$1#Re-*Y?G
z^93GmBv37dM0|stacDR5W{5lV^{Y`%s998$vtlM+Tio-FQ<DMLP6kf*+ETvVIe%9q
zrDOY!SKi5y^_ia@Ha$N*8^#`n1$x^W*7GQC=t!QP2^#HOTMkH|8)<fq-CmT*_qx<{
zfx1Th{YL?g_x>|84p&rcC(2F+oQ)sJyHc@VK%H}(&E^uNOyd`7b3H4`bG@ZcXyz{b
zQ#CvMG4#aMS6k$z&SLsEhS;CFRjb5t6l92sDB4&)4o5hi3dBW9c2mTYzd<}CGYDsH
zPraIT-dY<$edxKNe)3rjcG9TY^ulvb*~=&`4SYjd4vpzD49WKQ*(cU09h#PXzTg&H
zynpYbq>Fsv$3z)fS|9RDVG5mt0`<%{$VUdAU%Xi9D3Khk^87Wja+<){DI>sn^B$XG
zpS!W?%^$b>4Ypgazdlw{kt%_AyURz<pCcxkpOzyg@(fm{e;4^8E?%B`CRfb#bj8ut
zlh@xg(~=%TkPc?-W-R|?rNN0ECbxZck8Hm5=fIqCcRK6ot|6V%-ThzkBL>P&cc;8P
z-E{^g61<OS4^`^Irb-Ez$S_gpJAVp~DAhHojXETz`Luu_py+yynO;AifkazA>UwIv
zN};`oSh`_hRD5Z>N$s`lLZ97BjGq69U2*rJadTf4yKL=qOY_qACz$6f#rDrB>dc<A
z7~pC)Y}hX)h{V=Bt+-y(b;f>a?@Vjs^uq{N&ae8c7jE20u(?M6^J1s18Imjl8EdPz
zGx@#kUAx4c!T9d`VdSxV^y?l85*!13k;b)n2Q5p&Pl0oeHCSeLcQb9~okQjLjU2-i
zZMd1Ei5`<xJym?m7ebr_g*RWM-YvX?x=hNWoy*<dEB3x{uwHh!#i=Hv$7^b6UMzaY
zwIu%X@kWPKjoO>e6c-Guby;7#uWAdsymR|Z?@LkXXR6Eo+QR#}Kw^oE(X|VgRwyrD
zx<&orrelioozX!qn_Pd1eMc7|gSMGTOT~?oee5qWPh*a#>Rn`u4HpTyb9DIGPw7mf
z>Y=l17e*Hu4Uf^ETl*-n-=W4h#?x&=Vsnd~_A!%zsNdy>-m#24qwCi`1-grOFNU~k
z@o1DPTs+LGuHP9>9n;9B!P|Pf11WWuDK=7a_h|>~qw(Ow-@HwW)wtw8(y^+SKl?7!
z_t8PiNBL$4r__i6XX}R!4vA0~gA;XC?xU>JR-?6T1J`A&zltCzg+f0%wD^DA5Ox3P
zplzl6u7g=3)W+Zg>%~K?3h^BpjQQS!^hR4F#s*8@<>t|GPfB5k4iuA(d01!Te&Xh7
z(I&^CYxGoRQh7mR<w6}2^KnRH?ZeJ5?hvL|uGEFrHP-}hI=DDqIcZ4maoFC(=6d!3
ztHzB({C)9>hdU}{JKX0DjaTNKXJb^FFKmVuk5RoYREj`|B^{Gf)S)U~psFiSjZn_e
zxye127ODE|&B>c}T|beDhXf3hX^%LVM1gR;8aMO>`nDhH=6>@^RNJ8)%W+6g3CL2p
z7awDmp2lL39%;<m(~YH@buf#@tjjt`D>0DBFlb%6)h4{(*?7O2C2Op;nGQRU7D5^I
z^(XIjKL>l9l+<AX#>ttx8vIzlp{G1Hh-n?+jeE%_?5-ypE50jEK!2U@EK)n(NS16E
z8g;LAJTOvqmZwvxar!6H&rkL#myHCUj<9NcaU^<bzO$Xv#(MgcP}}l@H%ae#6xEwn
z3XDc>;Egg3SB0*eg$au*#-=F<r=|%~d~$sGvnY+M^_kU=ACoebdy-*^IkWULk=9K&
zk*7!Q>z>YZuNGFM=l_;Tf@FAR;wQb*9^5do|9m%vy`J~;HK{{<l-nLlG09`913C&R
zKMr>{^}o4xGpyj=$x?W@#cMeYG4^)ko4%8pVwNc0H<r%2f^=MFMgp-~HS__d`xpBM
zD|a2{+|KRa{PJ-{s`AA-e#N|4J{E~7hWDJBvE=#W4jZUl+*IyD%hwY-hHvj`7%Wu#
z>kz8#VP5a9^0`}9*UGzl#<H_0AB$clg`*?FZipv(Y0=Pdct<U(YDSUsCv<#b^y!Eo
zm$>*38du$(#<vl|R+GjQeGz%6$feeKV&7quOy!}N&DehYQ)RXJ{YAa&WGCDDJ<4_x
zR%0XTdk?>qt2s<g-WU5Vqdhj_+c4j)Z^Fzohu%ik<D5y@E~b8YJ@$n&_0!lWjxU94
z$gv%rs(Dq{TuD>FwIo)a8=2yW6CCQxOKY@LdWhNU9(Q@T@j?KjeQWoQ_O~d%lshEH
zQsre&-D;KN??PTK$;KMx-uJz5a{t*l<)hcgl;cB=Se;bOZ@T7zS4&(4aPr&?sg5}G
zP@l9m&#9GRSU8L-!u}Ln>#iKyzA-1d!)w%E{hEy(efQ7Vz_&q(>$Z-hp>gx8+Cnc_
zW5w(oXF}s#ziRhaw5}AtqiphcBz<_Z6)(R_V!EE-{!04rnKpdI^4nmhJ-+up478T%
zF}FY2A$zW+Ebj|CkfR7K<OMsHWDKJ=usBOfhU`RGxaA>O@RBW7>pn#+*F#djP-}*u
z{j@J{6?l=1oFse-e8@U+k|PTINJdo><f~-fa8~|6cTyw+Ins|+c=ZU)#5I}44aVvi
z<_}+7bV(E#1Wo8INg5c0OkNF>Eg+2xj;@lq@tPFmSBWtEG%7)<+aDU%EJvxEGnYqN
zhKIB>mq*!$heS)5kPeb;VkH@R(T%{!S{@k$jI8BR*zk~miv<gLY^#~E@RL}!)$mxj
zYNhWH(hrO>Q<My(Cm3X=ULYydgdN)HkrbgwhxTMWM9}F@>`|InIM2x15zLEIuxCKY
z0`=2>o-^>Eq5P`#a^<5}ePbNl4ul|QAUz5~bO}*}f<>$-L=dVI%kqkkBGmX_$eP2p
zs(zT%7A7+V2OqheSg+F#_QU))vtq;Dux#bm!H1%Z3Hf2tH!v9!YVaZ9P(Z>*aTo4@
zOyzYbxMhT}(C9=dpb!?C;6q8q<R7B3;0X8_?L;y09IWg<jpycsQ;}*Q+~Z{iu3hR}
z?Z~-(sL?Tj%|tF1POgn8r*=T;9VT@Xk|`*Pg)3+vkXGQA!HlHm+v38PX^)>}C)Fik
zN167(Qo9jI5f_*qid00O<DKwa0Y$a+6_}nqfSf4VCOFwFEt1+BrX5GB+e(0aa-v&G
z6CZ#xmC_-zmtYYXN*tLQwuk^1h&<Zfx&#*pr!No*v%fu_#)C51gQdc#uExjURG(|G
zQAHrP1aEZix1GXL^}qknQ}#@6(Jmc@B?wR*J3$*UNqhUP6GJ(5BubB+%<YawHS6tj
z;D-*Ri5W%st&0pIB9SN~HZuJlq=_6Y2{X|Z)_n%pnl%c-{`0)dQ2vJ}f`sggEY<LJ
zje-&ciNb57i78lcj4C}{qu`S~RXxb-VFi2osVL?|^~;2#@4mg}em4?DH~!78W91!%
zJu>>@l!eB(Ns0DAp2Lo(&#b&UM?a07?WDClIfCsXqqU^(!Om(S*zDR`v2U)^Skl)5
z;~~p^CGz`%ChZ{uWD>&q?c4rj_l30DPav>JdzCf#NHVv*%v1PCB!|693VfuB)n4Hu
zKuq>3GVpJd(~2bbTf(uzdj<>)CY&%5H%%1EgN3S`91d@QBMXGc$cCM<Shg1MNrA=Q
z0!}&PByJkO2}V`k-L$WR=jMP@k!dg(Qj;+eZnNELtMF<oe!IEN=Xw^2+94qsCS$-7
zM3JbMWF!_$3<W}1m>@Y>IXem)L9`W=U||Z3RH!wUe{DZV;pg|mv63YLPqfL9)B-SV
z8Mv+x6Skln>w)13Cod3@f_1}4tEFXOdIfNicv_U~M;MtlC6ZbVro9H=Ay~uVeF+Sx
zBeAe}2Qr+YE=<FeM3;mSKh3{noCG6_V59g%Ch;TYdD<n5uao+PVXR%$NcIBQH|;~a
z!WRliMB<rIvKQfG+B8UNYY>q{_d`4ExtD|e&!b0jFMur`!G@}3l__vOLMj%|X2RHs
zP35B)MmV4}h&B_mPV6l`M1k^uw$M2EGI&sac^W#Pw0}hbF8}A#bJ}6bVJXQ221F#*
z!wI<~ojEobuD^ed)3f|Gc*rjJGLrUgk9WfCD$P5v2`~z-bm=LFb&?NRQd4~1a7rhd
zMz(tFoFL5>)s=P<x*le487ue~17`2T<=9ABa_dk%c$EQ@_u&F;<T_cXdLRa@6q@2Y
z23ArxvZaHS)QwcS?HVd1QbPPwVWK3h|8T{Em1NfA*RhWtA-#9$L-ZNm-C`hnSV9*5
zAUmS{Y&x>wlOTc4lMQsXRCgS!$@)*qc5bvhxVP^|Q5=%PK=!Tsr>F+%B?B1~a1|nh
z3kp(|XGdV;kB|*tM;4Tj!4>u+VBd78!470FF^j<75~V5^(Lfndk?89)n8=aA$-x3@
z4Oq9;|Jv#fk({rJX#bWSa9f)SNsWeS^OEckRGHyqT>$F9v^7X{qXn>GU=ws4L7Co!
zrB+ZQMU1Dm)o)DH&|W{rME>*+?E579k#6d}9^W4qRJ=dgw-_X?l6{NW{V-j5O`5P3
zPjZu06f0l|XNo$6%)SeYa3IHB7snRahlgS4tYAAu07_zuyx{`otSFNfSn4Xd3DYqw
zK@wrVD?~B!4ISanEK?v93l{`6F}o8R4>k;$OhE}Kl#y&ECSb!LDRB3}FaO;e#9bsU
zQxNvoo(eiT@2R;m5PwmG%E8_sDdqLGOVmGY)#IuL!Y^&?p?;Tmgp3IggWpKvcll@N
zhD5>Gp<qN<rofzpLLO#|`hK0pwYnbLPt7s_vxHADiXor+(ux*bAt9HC83QY|YjrxX
z9vOhK0V`j@(;S8Y88`_`D3*Re{Ue-1g1f*sf>a)+2z)7Ak2zv1sSyLPM%V-+i~Z9l
z7GUY2fvIa#JQoAqqmD6=YE%m&qW8pocLz@xUF8(#Ow6fSrlGcsOrx?a6J}Vo;W@Hv
z3(5mE5~T-+y9qI1r^S#cBN$x&5S57>7DoQ3t)K{$4mcSyn3bX66A#ruD-nwPAGHP+
zaT-J;p)xT;VQ*2Bm5clv)0YH({x%Bs+=*<do7)f;pGtx=l(46u=M8l4Jcb}U<}MhR
z^36^ngXTxD=IKi8B@t<u0S>OLPung#1^enmX-|Cu2KMatS*62p#4MFPwLVPeGKpnt
z0c>5CyqZiLTkHszU}SAKX>AX)(m+g!IKg_c6a!fbSiwd(mmr;e_B<>aLs?CxjxGKg
zzEgV|3tPL)aQ|M(!vJ=&kPhSk(4zdy4D&!?PP37n??Dd8AtH9FZ_84B1rk$=AW?sf
z3`#!98|X;}wLSGh$?bdMa()3PHR&W<+9DAVA??WWDDV*wSr8&iwE&MqW<tNcqhUhH
zPPU2FFrfh-h{ys8qOpJld}LE-a0&lsyicL==AOo?s{vU!50YUE1q<hS&9j=n1y`3E
zpbSNZwkKbt4>JCW<w4SKp;oaxuen$A-@#9!xL3mm;OZ+AT&uV60CKH{x5H1~QCi)U
z277@Fi6E1y79(A0lX2KlFuUq@G5K33Z4i76OL?6(NajBLHlsp87s=&z(g=!{oBh}?
zaqO!k>2P`~_SI>5iqL<KkY1pt{>JA}z=5RT3yx(g2gUddgNz9+18D~Mc!{JCLlTW*
zP>-XB&{{k4pV0_0oc~{UB=q0op#wUgNVan9e?}>XDHlQ#En9RrGWvmI+3UT8(Ff}{
zaC^!fACnK-91&3m)JtQ8{gVKPsrkeA&pd~vq9{z#WwDO3q*OiZDDdROr&8b$Zm^wN
zilpu^n?hO<Q7_a>CQ6HRl>(t*xZo^Z`HxJ>dg*^qM)RclJv=Di)8Qy>&|qltnwZgr
z-{L(iB9eeIas{mjzloeSXhn_`{J5@PP-0D@&}>++>B)G1CT}i})wo^6FT(C68qb{z
z_5up=K=16M{UJ4~qLUXfr_TpXz6grQoo6HfoigTQ8un#3#WCK9P(z5~_0l6kZ;0aK
zj5VYvm<a-A8YfOM6a3DTE2z<m<Mrx+Q5+v<3ydrT0S91YA&}J}>CrTpBMk-lSvBM;
zgOd2Jsfb)HDg2B1h}^y9h`wuU5ibr=v-WYhKD|%Pa)0+kO$0lm*i98&gcYO6%^%^6
zeVNCe_Jtn_T~Ok8sgFQ1Xbsv?UuzHWw~5-lNky#@f?qAHdUe^k*k`r!^x@n(#Qni7
zOn@t=0Cr396zn1=A1X-xFp2Ja7`)Rz6jr3D2J>O$#@5r)p+Y%1vDLJ+sBtX{qz5S}
zm6wta96weK>ol@}4JnGi);tVh9f|_L|1j{ULhYVBx=Jc7=riMSb9Tq$=A9q%$zKYk
z)qV=@(}k+PSe!XQ`x(DUk|lSo@k>*}mjr($$w1mN#QCtgc$co4=`O1F@^p=6%-IU7
zwW8QT7{4n&mkGyNv9m*#huKWo>l0lvGBa*v$e*RTVa#6t#D!T{iRYc3ufML3eqq$f
zFZc<iCA{Mz3w^r2=+}5$AmJOos;t#A?nt_(G)u6~N}H3g(WjIn8D`D=Now%CU9s1$
z%$P0qtz+k(pF*@F5!RwqjxRuWa7s+1L#BN)tniVHx#h6|ijE%_Ja4ERw`dCAB`cq=
z{$L?ri$24tYe411J(5#Pp=vRX;y{-#SAQ5*^o&_>M=tX+1zCC>;;KUXvzmk)c2m2r
zq>w*Yxb2CQ*36Fis_c|MS{TBKPcZq+t8QE>tlIgCVx5oaA4{)zb*~sU$gooVA^o3L
zy2CW(^;9B(mR>ziiqL(uCED$Q5u4BLPO5f}p<0>KRqrd!+Ac9Ph5vT)j0sZ2vA}2P
z7LA(TE;4)}DPk=gzxYHn@Kns!1j_b0Cgy8@x@sLdl$ZneAsZvC>UZLILRGIA<K4)s
zH?p24YHLtEJHNegQ?FqE`8SfGPZ4HVLAn~;KDsV;MEz5X(f4zQKFT4#@;MaQ_rLdh
zVM_H8^(6MD?9C0uiNl9J9ygKZ)8r(}xgK-~PA6~bqo7r-M<qrE{W^byN|D<15HD?P
z9hGaUcN$KIH=Xn)U-_91Bh6^dU6la|J_W-@J$xBMGWfOr`|CN^OEh=6T+eTm1p}8%
zO$2F=ZKpbi$hbgXF+&yUCf`a~c*nA-i%91jpuou?V!gO0s-<iqJ#9<N<oQ^bnUC9*
zWli3s@pFDD!)vS?3!FB6+^?#bp*P(5@Gz>|==-6l^*K~sEb-@%L$f{wR$6)myD|<s
zN{DADD%837nXS;JHp`3=i)l)k_Ox}4{s<*Jg@<;S@VtP7&3TitpDWm+d^iWIPDLSY
zY1SF^nUg8U3oRc7q)XkqbJsTIc#Wm`1%0o3nRhF7^X%{I{G-34;C*j_TlCbW%jTC=
zsclW(<dyH+TaBHu4}7}s9BjdF*7tnmA&Dv-rm>`hS=70>p{iZ#y0vu0F}^N$6erD6
zEuK2<P+*C%;=)ir$v<%AOJ)~^;?d5u9+K6pSOX#Ed|jWx)`myzwlL3Z3(J(_qvaJZ
z$-j|!zbw(zUT`daC$bd<(5sS;B&IskG20K6?J^>ye9ukm9xC4a{?XfAWao)-_$Ac&
zD}6iD%8D63^BdY__$S*op55dgKgJY!3}#cYD}UQ@ze`NKM$8UD+QNB6akm+9Hsg}{
z=x7XW;0uA1=UuC3xD1?JQWVGY(h(jCmPtt-PA;Txliv1+){oiWJI>P6zu?)ZDyC9D
zY0s^yn4Xt6>Ajm8)<CdNR#nW%s~+&?%BV1+gtymN1el$A=3`;|KvkCx1QE_3PI4JA
zTvm(aN{XtT3ar9#Wt4VNT6NVFN^H&C<I-`uvZI0baTlXGu`TxE#e$AF!%)hl3W=@d
zd*j?0%wv%Z_qg8oL`b)Ftetp#R1%H91cjNb!US5344k-*oO@@&61sP0C8=lIO;D4>
z&s{75pFdM>=%F2(lvG+9`^J|m<6OdF*|JL)tX5eqm5&;qb5qi^^uJNOeu<D|#uj~%
z4Qtz-lvCQe-*u|MO_-i=bn58|!#H=D&@<i)OI)XB2|@LCP4VP%FV0l^vSkpi*WZ2-
zZ{(cx+J3ImRBr}XKlvtJ(m83ze$M2*cfa1Q*TsE_Y?Y+ziO)_cQ0kQaOg-0^ts)hb
z*L+Ga^7T*>42slL?fbTz@HG6g3uTv(9M59jvvR|JLsegqhc|yHPpaJLiMjN;Uo2iw
z?!{)ck7a|9BI8yDZyTNE!w41QSm5kvWLzk2Xv)?9PagW&v-{4%Hcp+NHpA!T0vL?w
zH#lxP>J8R}hau?_xV2`UoiZ}1t(kw<d4hrR6m87Ja&<Yc{s?PKaFnuq07D*9)h#L2
z=6U#oCDKbzBEJ**I7%HK_`JJ+tUquyKlikedF@AK_cO7i1nFH_Hwy5K9Ya`GoXu4p
zy;jp2bSf^Q2Sz#nl)h_+GBtNLN~|YoGni|bVH6ul82?aF^xg83a=At=sb2p~gBT}n
z#@pnXBc+(ig?z&B{nPn$ZUsvyLCUyPOh%&aPcNnN!dlV{E=T?CGm8A1T@wWqy%e3g
z+ILGFoX|(a{omhwtI8nfAJW?sGW*b+ynmBUK&6cJfvX`)rr1==WVpcGdL{GA?vAtM
z!v&+^0xrQ5@f1!MACS1cb4T@^AsBF+lNY7=huMVG1yFrqa86!~CV|;R)dd^^Tx$u`
zuB)xKf;R*N6r`FzyZ1Kx&GKx4;ww4}%-xnS?bo%{7vK${iUn6&i|M582OA~A!j#H?
z){$o9-um#gDA+1w*K^gnZ7R#hS2YDm;b5<?x?cR^hj73SKRemIR@k9WXoQ8q9=VuG
zuY!csF`2B$#h*Oo1b3yH#?DR&%F$RTtJEc*l(=9nN9i%FL3i-Pi)mTLMIYR<E4W`T
zG9;wrYoa5UbX9TP>}CRCZoB@gOraWzrQGF#%-*8!e;n3P!PC`|X6MRS_e^6L)u`-n
z39l#!+FR_eOC_X~pXRKRzsXZXrpaX*SXpBtTt3p=J?ViGbZJiS(iZ-PF=2Ki6;qit
zW68>UH(PLin8E^Mn^oJm+IfQRuI@{FQI!`Uin?iX<boL|t~;9t*tW>3I$169#;}I{
zp&;ivqZ*T)NunF6tO}!)lMnpRhj{67vj+I)ohyy$XRe|GxGbu+$@i(0F7d~PGf+Hq
zj12busr2peB0G5z_GLPi<Vu`->W13+p8JP6d}a1fcixZ-sFarW-6|ZcKrSwjq~_kv
zl)VyrDk}nUpGFsBE9o@Clz5fd@sbTH^)*-}!x6^h=)5__tD<9&t)MeAeyFxyYD%C?
z3OFJYRd}x<FD;T7V-`ltoYjY>q7nEHkFjaFhk#Xx))S94tfW!yt{66R&LbKZ+@2Dm
zt&=lrzg;VT6oIG$8TAdaHx1G_Ws&a}f04-+QgTFndJA|~Wy&tzf)L9)fF6|gag=q_
zvf~bqM2_PYT}A6YT*ja&9Aj)yCsL(B#uG+R#u|{3ope*&X+#6Ub<g+MRU$b-Iijdc
zHz{8R61MY^c_0!zUsNL876QxE^_a|UGnSn4s2GGUQWbl)-$C19c<XaJnnED$CGzO{
z_Se#-Zl$3wbg5}{$Q~;XQFHe@EJtMv#2+xmVgfGoF!feM#kiaFI}0<+<~~dp{bo)>
zKU%=mZ;b2-9y7aRX)38k=voeXLb8UtT;X{tk&^wuT#$h_^_O!~!w2ChX1xPQf@w8C
z?4`RS``Toaw*r+_!_U(Bzj;}{hMeK$On){Ch`Qbf>#rSM#nCQ|RiV@z_3!1F&XkdY
zc$FJ;S}OM>ogQyoVS9s8$<0Hh*S!bHZ6wtkBQYSB$XtD?Va=2Czml2uzs{8HBDwOB
z7#iM*zVj@EP2uYCRUEyv@9x!6X?_=XQVoWV_FEsu_a(uON)bjLyU?yn#&YCg7p?28
z$tCq09Oo#H)@rEaPN2kNgcdIjH-go)Js+1S*5gW_o8GZ>KFHk+t|M&ZS-Fq@6ffuS
z9CRNl>W`jEya(|<F$Z|J`J{_JJb!T4Ji%RiVJb9xT5S>z#VX2`OOoyK{6&;jOGO>P
zkYA7-@cuaV7m?H}a&Fe#LHL*F3g+nQG4oA|#n0b_gYSpVMQNa?aN$qyR+RdTh`D<+
z3%HEW5HHb|-`>Xqkv$)^*2`-)e%&!r)BbE7tJ&MufR^cJKr3IzN}?6)gQ?poa>@=!
zii`FJ_I^I&*DeK9yL@Fh*S`1Fsw6yNl$zjGK$Rh@8Y=k#CymDhz)tTUHpr0Or~X<J
zA>ks7n=E#yNFV)pWi2{XBeRYXFKuQj<`l4XzJ=EgH@if(o@0S3?W40xP$JNbT%`=a
z9ED;%@MUsTS=7)Ho+~zUj;V^ZfLsGG5B0OTTlw^%IPbcD+y!C9r%ew`N&4)&C)*z&
zdq=4qF|rmtORLNW8DQ(tEwX3+!(`v+pOr#E@n+CUSrsdY&Y=VHB-y#wp&Su_jYAu$
zs!B33V{*h+E6KTEWGpM7BufN$h-lZ{YpXBt*|{)8=dtQLiBD9vy(FZKQ1mL~2m&w3
z`E0A>20QT7-1i1nYN5-QRLgw=NPwo5N~r24_i7~8F_sewq)XFjrG{PrL|U#yn0bA3
zy~4`zG1oBI)B1GB&GoGU(iUickSc)ZZEtwpER(ymf&0K10*oxVkn#H_y@1L=k`S)(
z@6rsfr5*#LTBwJ6GnNB<3j}N1p6QQQE=`a_O9ke>nX%B@?bLlaM1(Q%on_DMC|PV#
zL`on_fV248Ou?NYcqjfsOjfO&cw$!M<C}RX!LlCcQaqMgps*(06~sWC2GYoxCD^p*
zhl4DO<c_)As8rt&(S(?)#D+(<9sRS{9l(okNx_<3z5PV>plZeejSKDLe%Tq-G$pw&
zr}$LfmrBstHF#2rx^UtMTv@fsp>H_o%=#6P-N80J)2nB$9M@HOkImq+0V=U|_c18U
zv+ktp+uxVXSYoQqS4F1RvESze>IsE8qeP%D$@OU0Pl`4e?SEB44@Ip`<!?&w`gm_4
zdN(}1j#d|Q$H0oK)y?Z5qXaSIRc?q3?*SSAzsRuvNyg=XOm6U>5iPs3A3-7GL9w58
zr)c7RMI_S&DmvyNTwKMs5lY|4OA4;aUeKkdbcs;Kwb%VaCP0eV9@$hp&{X|!ttNl#
z{5;ADOF7@pwWYC3Z`Kd0vZ)fd>W~y@EkITiAkw0CG(uN}QzM1<N}xHo2YhIX5^&ek
zeg8&}MH8N#J6KqdG4pZp6+{A$gNwRQ4)j=k@r3TJBOVKGp8(p{QouMdx%XF^s(fpZ
zr|oV$f*p6)5B4Cp)U(I<>aaGq+IKmI+565tVsv(Z!#pN{#I)b@&V6Dair(2JSSqhv
zs7)@%Nk>`7$XTNK@-K73BZm{OP#<0fE0~}4*%JF@f4~)8m18~=V;JpTZQXBNknwEQ
z-`8yy*Nvmi>>Y&*pq;lKtN81z{&ZSG7$ajZvb`HxruItR<803Q)DAssTfB%&GEYd8
zfat9G%MdFh#ikV~auosTqAYe$?LDyrO0kz}&sRc>*}ZV0X1FvI8`f<7s(>(1A6un<
z)or4@sVs|_Lp2Z*fjl4r(~HhT5m35z*N<|&Zt=2Cw!>P(fhdrjS7EYK`nMKSGSFxL
zc84_MFY~L%q^8FIrrumqWteRtrW)Cw$q7sXQV6t;+iClgOF$V!6dQ#9Gd85d|6bLv
zYu-F|aLtg=KH!S4iZOk*umyIOC<AD`pO|sHH45ENc<Ek(Ex^#P7SJ#b#4OND!AU>5
zQ(~mO<3(sLgc^n5VE~g3p`F(nwkp1TE{H)KW9Sb+O2u@&oh}<Ii##gZeshr%-&?5l
zFWdppim#_*@1eqHUQ&csDL1}%RII1t)%i?p_;V;&rJ1R7LX{qUHnL-suCsrNO{~X#
zP2nRi4+F^U;N@-o7Y_6`WOjPEbqmOJtoK9G8eJ7l?QF?bAvFRiA9$dr&whST)W>31
zCq;f3Fq0NOlRi3q<*W!B#3R^(2*jX;!72vOI%mlPKbLzVbzN`on=yR6PkH-kuPC$A
zBfA$*n6#ANhg&yui}ienuR8g>e~Qcj867T}w|rmmb6d?$ZVQs`ppMs4e51^a-~x5D
zJ8r<tx$E3&bSNqbh#5i4O|))WJP3UP`2rH2qWW~JH6T1ZI8YAPqpf`||1wWCOor#>
zg1$7qD%NcEF#uekznd0!5XA#YP*u5Lkj-p&_<{xq`mVdF0gAFF0!*;Fv<;%8EE53~
zZbRd%_34uPvVp{9*|`Wwr?a8tUU<p_<DE=daY(yJF<`q22^&B`pK`9lRY1}3!e?X=
z%}3YaZy}-0giw+GQ-4V3h*vdi253VvOSC+MF1R}FwNC2Z@X59$X<iq10S$)8_H@tF
z{GSx}J3o+wT`Yi&J=5^}%(HbIaD@k>E4PD06Ou20oY-7_C0uvK3j-@AhyqsL8G=<=
zwIUEfz{nGsW<Fag5nnY$8w~CxC!R38X2t^DTD5}bqlky8uWfsZw&Je>A#BF#)3u~)
zuQA)ux#ilR1m}RROp8ATDhMq7ub>ozZ-IW&loMJG76DU^#s}PDC~;W}FFg=mcy{gv
zU<Z9$M@?pyNMu#!7JuglYw?8K_5bpdJ7W6(q+=^s_5@<^-3MAKrm_mTj$;nMTZ8O`
zs%tlLYiOUL5TxfY4hgm2!P^fhIE@%7*J{)){y3#-t`fjpYAyh(#{R0hD$Q8y{uxNR
z7G7xdj3SJqLq|SB@D}0+jak3cl(q2_Fdh9W%{0nc=3bCMF|z|{St9A59sUeC6HC5L
zdsFV?|9n9iuf+UY^QDkk{C_OOs1W7yVBK#z#BvWDH;DQ~lm`BHj`-tH%!Y1ADOkOw
zbVQDven6EEL=bRGGR~^q^0|@*<R}AzQcwyHS;zLWebPCM1*FhpzcnS(u%~kJ<6?}d
zT%!gk-S!4Z#OPw1%!xiVzI1Ci|BsJ0q7V16uRvhWf__k}ow!;v*=6lTT$D`aK$ZIw
zS}%+ADu+tSIkuaC?bGkGbzYyFr<Ul<I)DH@rl@}?-WiWA1RZ<s%xXjWHv7|aq-d4q
zaOD?}arby14*oxIqx_$O{@_Q&62Ko=H<TZt<Q!wFxSZHys+^(`Y(1m2!zyo*YHvJy
zD~qN;%q~$Z<i7qJf=d0LbEgWOU9#DWs%HrHW9fA?uF*@Yn<9T@UNl|U^1sPT8jT4c
z^+|g6ws?4L@z_D=X|9+mor<=qnO=NTsWN!iv#S5Fcp|@Pze^J-h(-^eKs^nOrBJ`g
zW3OQ1qE7lCx6QeSDW+-`!EQ1aLUtVeZI#*l4!A=ucx(|QSY@|F&B5)Ib3~a!%2@Y5
zFy{{|vS)48f2U&2PZ>?Y1SA{^_6H^_;-a^EberRJ%t5gKasSI~vx%t3?1A9BjSacH
zr17A4$m9KIEB<%38qi0IyZA#r3&cFVj?r~?3F<?DH)lz1UV9bBj|=K>uB7lzg6&Qw
z)n1naHkhO=0hqZ_vX0#6pmylIBVI{YMKzpt>RwLmtJTey<?Ngq49}3&f{X5L-usDR
z*VWKi>vm@W8a8h+yw5{Y)~BHHPp;~w`w<~G*{<JzR<!QLTP-o=HHx#Ct71;ywr(jO
z!T^;q@7BwZ{U`J#BS6dT`gCBLSW|dqftzusJc~)v&sJ~!GzytOiH(MkkSc-Z0BV-@
z9kom2UME-S4`EosoePDc9tyy-5`fYe8XH1k$^Z4vgce5t?{lr;8MzN2Zfq4(9h{ck
zKfuT|BmUeJq$E8hC=AAzHRi*Auwj;Ah9YL<g7GN1D)s?TA38@&YaxW}V?u$9aN`M~
zg=XJe2sb>ypU1E@nmKgK)a^UinTAvs$hO0!-kGSqgKBRR@cj%*rLW{KDWN55hfCBi
zDWOmSb4Oa8*@2W`B6mVb#She~CMkjwx{Jk-s99D4wV*sErs6N~(fq+yd?Vne3izEf
z$o|;~Q5S;*2^^{r<%)I)Yylx*&)@Jsu84vJ!~vv)<chrz3Vguu52f|2em)AnPjH9U
zYI~Aj$>sjd0bgtnW+=;U6>zMx6(7oc-)AJUIh7Q0>}mxl045HdxQMqp#6&276lrO1
zuZiv)#ynR<kjj9ULJ#e(I`4Oxkv*ogG$FMvi&oS8zVC6Fq*sHm1p797zZVU9`@5>3
z5pkicmUfvq3YF&x(8s9cJYB)P4N-#{>&KuI05k9oW@Oz2D(-YYu=r6p0n-C5UXY|r
zsUyYDwh)(o31CoB1uF0jatvvs<8zT~Y~l(Q0Rpj1%!yI4qX*mk?oZ`daFMOK+d+`c
zKPD7KBs4r*2u2<47{r0~u{xB09tTgUV=qBhzJL<O)3HN2!c-cF<cLO)KRpJL5^h<D
zX;bdoKRkc2DMC|d^*iI}nnd)j-pDnGM{6KRtJ1p@#+G;N+>r(6gLvm)<hHRCVXnrB
zrzsCK2^<*Q0eqwn(0LWggwBe!&q!z}u|bK?wUmh_@I11Wbwu4ABCp5v%NYTF5R`V7
z17b5r#EQQc>%4{@e@I{YrI0-;&(cNd>~aw71EBmC<#OCHB<c$V7%jl51@|8i-i>2#
zWhpyxc$c%l8VCv)BpQ@A8K1gfF+c^*(mi`SZJ}*Kn%+A~TaRG_p7~TGFenT(fpii1
zDvD&)(db6^frSbuxE=8nn|CKs>BSeJLTeQ5Zc??w8H?#Z<`n<ztq>Y=2C((?i<A5=
z-W@1JXZx)qCezDpH7(9mS6!>HaP`gz!H;b^Rtu~Czr^SGoON>T@W;gi34p)Eakm~V
z9eI86Kx_{5WAXD}im>VTmtKVYp<|1tZtC1b&9fm2mre!I`O{_?5UPI@ee%x_KR)NH
z-eVS1b?LXNO)i>d9uMU{kkf*GmAAzb{#(cYh*doNS0<5$e7gU%_qhIpvICLhjP>Pe
zO)~q7^M6aR&iFKtXxj(6;7?%?kBv*iHxi*2D2=I3Q8G3A4x*UT6NO0i_CQxyOGd40
z*SR;*H)J^3>KHA%gYTzni?`lYbZnmj%Aju?B6<ZfBiM2wYf4t_+0Zi{cybJQo;fkr
zSrBH1I$jsyRSIzCaenQLJLrzVQu?Xo()-MIU7&OCAEn+U@sxIYuqCDldgXp&dy=ay
z=?&BO-r?vQZ=bV2i|H`15^ojDid3BhH4HSZAc-d>h*_NqT1Y^^Nf{4>CnNW(*+_g<
z&kGF@@jd}hTr`WETY}Z{zIgmQBIGIHBKb!;WVh9$KZxQ8_y3|MJolpf$@nog@B+?O
zlvgnMC#!hOt@0B$5vvvI%59EQ-_h4f4Ue`S?ZZj$-e-Mxp?6;Sk!<h}j@r82C7tY#
z+2g&0<tzB7M`*^(oI_cZ<br>43|Tp7U+6&$eDW0fVuzN>v>eKm<@amM>!x{!ixC{D
z&*)Shec*F4O{tn!)j-0{AP!+Q7cEp}kEYACe3N;EU3Ml(=!-r2xPinKU>lvv6q3FO
zg?S5X9g<7Smn++ZZi?G|UNk!IjBl!F+Ph`x@_EP9Il5Nm<D~IVg_@^Fvg%9w5FVaa
z%-h_3GcAiUW##-DtBiiuden3(c!;JH4mQ>RBy+L#$i4Ua4xLNIzAic2PM4mC3T8ek
z)ryYxxdOqSP{EN$cA77z!0w3-7guPIP}z|lVZDqc$HP~27*%9aw4z7Mysqrm`na?T
zP>k#Hq3;ckkF~j5-;(a8R!Zp`I2#CzZ|@1{jH6iOhTXho>;lyFG0%+z<m4B;X4;Oq
ziFWfsex{L}lR^y{g!CL;=lL@+04V5V`iul*EqEFl*E}NbZ3wE&Q5<oZvq=sa-%@-!
z@gtSXk1-DM=A4mdXwKAnsGjlTIIU>6irz#o#_@dVZd0Wcyh+9w<h%JJHP@f98{x6p
zwB}K3C#bSSQJY<Owpg{*XxlXPwI^S8p(zAHM7w>6T!=utI~W4@P6dYMd==>q2k{2>
z$_Ib`RNvtr{w4E6s&UL$_Pb6bR@!UOd1GnfVR|&9`m$>jsbV40Mt(1vscqy1_`Uda
z&^tp~fh{=$r_iz+LKyjaFQPF_UI0xr4ib&JXxUAnBeWhwTb{hYB`>6CY2f9eD_?}_
zhj4vQ;<V6JLXW?BYD&{~Pvz*!`^gVB1Tx;btSdCBRm3~QT(#+`sYKg7pMxJXku>sK
zmd**_NIk5G8-DE%f?ON@`Wm;vsgzn=_*h}Eq0ODcP4~{ER#NoBpw`>H+Rx>@?AI7o
zIPN}(tNiKo+6*nb54dCqJl_7%d#5Zq7p{y;$iFq&kT&15SNRh!==hS1OHbZUU@+sS
z-A>9QoC3eMz)AQnyXvo(BNmTnXTi&n1eTVVqv@2&TJ#ZEJ(3@3f&UDOO1ZZQa6JC`
za*p>hZB312WtdAXhbZe)et>EvE1$>)E16YB2&d-W%JcAfAlt+tnnkqLOIAKGY~>Jr
zOGFKll@r-592Gj;sjl;G(#N|Rmb31kTBxDdlP~#J^t#7W)7ZmIDhdkI^}x>W{HPJW
z!l<WVRkx^c!uB`pf?)HL`TE)%oOw?Ay^ksN(eEZaD_<V0j?o$7a0qU0Qf#JHY0zsr
zny-s-d-y2lN*&RgW*T@~PX6}xjD@_f{q}xvTwrkE&F@TZ%jhGt6;I~B_Cb-?zh@27
z7dzv?{Mykj?NPYtxwl_qdpxNJzK%`7920q{!kcHlbBI-^Z2nQ4ubb{5Lvo42SEj#U
zeSER`*Y}+&3MH<wI!9=Kumt{S_^Ie)Oe@MUouY+qeQtBrqs=JS933AW#0R1s{oB51
z!<AQb+kI{r7r%o8?%iF3qTAg8#<Uedbb42G0os8O6s$gaWqLmSr=x0FG!yNb*734$
zPL<p?-_n+IIn3lc!MFBcVZIg$C3HDfXT6Nq=A6IZ=xIfjO$eLes)$z1g3%B|GJ%x+
z&7jlCQNnOe2`_XvZLC0~lZXSWBdYaYaqm@dbG>B0pociNEp)yImhCtVTN6(q$IO<3
zgpBtSm-Q55wev|n7*T!wfj(ilva6dJZENgTI6>eNs$ocWygct+M6)b3CmR<P#8)Su
zo;$DEtjCdN8LLw(@24^t6_7S==)ika&lS%i{CL1KBLA_TL?=HrZMF}zY`!9=Q&TN<
z0H^YwkuffRyWwS=RDDiCndcFjHC;_KOYZzv-?sziO6+s|RvaP9gP-RrCt|wsQ2JS|
zvfIr8^uID5n0f_Rro+FU;m|ks+iqIyy$R(gE$odmJ{cJ10nrwaCnPZDU0pdIvhWK&
zhm73n{!pAF9GE#MY7&tw;}0O|9!T(p_T5lU!>hSH&K)X=!`0{7b?Lm@Wn0Wo$_IKC
z_kNNJDr*&Boz8TOKK5kL$(Oao+zzvxTq0W%Q2I9CP)hjiPKrhJL#4;U`%5)>g!AuH
zdj=L0rE;3tUg#Zf<ED0+4}yXm%Oz-zr}mlrZ21)<mBz<F7On6%B=_<g9Vh=XoOR%w
zq4d~&B_eRa0K>bY`=R3Ytq=3HO*9`Wq${Et`7;V<p)}<fGa4TqF?2HITa=l0K33I?
zeGGC;7&CSQ>zw8{Pi4Kd8TJ8wXyadWK6yi{WYHUQP>iX(?NqQXmHpN;P8-F*r>dKR
z``2>~4t0TlSg9Jm>$4rQpYS9@xFE_O8!n-R;xR<$;ztHjRUZd8-RrNQ*CWD^@xhn9
zHvYz8x*XG}0OKcbF*-`pfp1hcc`wH@#zpsVPqd7mQ8yl95C+9L&~F2C?#uyrvNHc^
zwsOHgHCj2vb$%|%({|<V3E|7Jq)meZMC3LJIo2vzWc`)VWP-R5UjZc;<q&Hs&dF-#
zD~m4SHFmsGew3JkFpQJ$3>PS?oQ1;1=W-B}loP3@n4|w7L-d5S0m>ncaRXNY<lqRa
zt?Ite?<gO#RF6xI?XfFd;*1Svi++&4m1<rK=F_++>?1iCoYhTYjXqeY`@CvO|G<fj
z;>DK}MP<?T8>*@O1C_h;A-<31D|oG9g@@S3#7{o{FfJM5rpq!N=NJ7ggU7~eg+*OK
zfMyLfWd23<532xL^~CYbPo9J3=n(L@$(C%*59c&%pY|}bjnzp-sILuHC<P|ukCn85
z-OnB}Q)~`JYS0VjJ&M;po!BH^`6Of=0XYw`cZ@T?{h;0yk<L1u;un1^u&be2_zQA2
zDo7xYx6j7sL5P_~4|pz*qi;4(kCh2eBK_w%^@uUT{sA#wY^3~Rvr<&1C@S5_uNTe4
zlNaI}I0(u<>vYntj2ne8H~~W37j=nk`KiQ0)u;CDq8*&{DxSh%JI$@UDp|_c_tDo1
zUbJRQs@uFZkIkn~o}bOp(bt3cH!D0=9=`5>t96@0R-jWnF53P758iJ1E7a|)dUp%I
zYz{hku4JB2aMX=GXGS}_Juj;iXmF6IB6|C8*#C#KlG*LCPb)rSKW@zvSqcu~UQW!^
zZzv3wMI)%!^ot73-|A$!d~gqQ!{bIO1vqM(dUdjznl5Y)<AT>ywa|)z$*=o!9-OAl
zE}Kl*9##zeagciZ^d6f+Bqvok8^yy;2PF76E8&R=fm9x9@*C^jF78#66@iX>CN~GQ
z+s4m)8pdg$)lz?;A933J36p<8JxCMwV;tU(&u`CG;wut}s<7}b6S6a__@@AUX+p1f
z`u)V5BMfUp-f&T+$5+8NU*Ln(CPMA^N{beOjTmFdc5l(g?7OP$dW;kiS%OC}88B)b
z-0Zc9$}QnN+Pz!&KC#knMa&pHt2(mR=6#A6vzp_*Q=@|feiSw|L5?Zrta@m*6vA-L
zpIo}>A51_i<8vQ_r!0jKlleP62&;G1mD|&Aa&{#qMXoWN_y*qqX)xbb^G~*JX1_a}
zfA-@md+`WEA^wx8d4(@em1Q+wjqg^T#4jM8xch}PEjk$%0doB&wS%8$E3@R{03B6y
zOro)L;1k6(pz^hH7DT@c$WPDFRh@_$&FzlRuAwMahMR6czNDb)675vI6IVc3&I1R~
zn)i;*f5j+y15tolgy^&H&$NAWmCYXik+K9a*q$2?ir1@eV7#1H=ve%^cjDNkBRP}6
z#;th#$vCaA5NJajUCQ4<LEMS#Qh2Ws(Z3<b|A29wdB?+Qz@>Oj8Hee~ckbhP3Z31_
zjv*r3Gg7I#*7g!gkF*wJ;jP8+e1c=SK4+d%pp5D!?;LLufCY*DIn6iowsE1cpmT3f
zJnpqJZKc1?Yb+r5)vb8rlT`i#0iJ0vQ`FZF2K%!5i+9H;gKoVHT2^kBO78=j`UgaC
z76QWPMxtMxInOWH04+O!NS89(puf!`9)2IjyOxGy2tXma8U7D8BnEmXI^!IpZ6Qzc
zhpC~lq@#TUL#O6m+I)qmY008*L#&H_`8_0p3(%rm#AfNi<%MjX#y4@AB1n0w1+U@q
z!C!kwKc=NBz~-5Hhg-1$c^bzz75e{E)Z1(G5fTfUxH8*h;m0lG%=thM8dH4Hi<??m
zS<M}gAShuxUAq}=Y*!AQrUff?JzazUUC7x@>v7r-$b*`K0Id)2+Az(GY!whaVpL!Z
z%b#Dr?HdIo=z#}ee4tfraCWwGbr@Io;{gQKe?j@q#9Yp?KN#SG7Ji2OmqkUXel|`@
zIuHuP>nWgA|2qy?NQizY_&ANo)fjE9=Q-~Zw?crDpz|-sa>kW8H#G-)>~*x8(+A(-
ztrSrDYE`8A_BMEr0sg&A!`>iJFI4EKQYPz0HD3$)jZRW4SzHydE9V_)z<p!rojB#u
z3gk{`HabXfnK!dJaV(VB@zbv9kD(<3IU9c5f?9me=_m<|8)WV$sOvWI+UoriJL_3|
zHanEw>>N*OQ2BG6vX*g4j9c1cKi%m<mr%c+-U&XS8A_nA$AtU=IrWTRVjh|9^!$pW
z_LZ9_Zyoap8Z&++jT$>GbOnb&x1<7sHiZvmM<W4&jQSYMl|%pXNfZE=E<XI}3N)~I
z#-1BG>hLcN{F{;g|1biN)TO!9$YY4k0r89ules<COYm2R>sG(QPWN=g5t7GF4skrb
zRcvm%l1ZE*PM7$)Ne9lp{`B_O+%Uv({^g*kbYSoAF(SCBIdp9ImNK!`2eXmCqE6ZF
z>^KHY0%K!ftgwYffvo0P(E7Vy6&_M)$ZGB_d#UsutnXhGii>U;w>ja_I@({s>%Sm$
znf6J}f62iJ<EKEpxnSsk3e*+d39zj^Rep~Zw)a%Q&X)Xlj^Ne_1UvQuaaK6m%}OXH
zntu%voa;+TV524EhNJ<F5XHOv=L^jh+*K>{#P34sM~i3bh>5=rcuFSijJbJEy?jUE
z03Bv@8N2rGNPlZ5O($WopioAU=P>>d`m&|#9G%ILXSd>@p{Lj>naw`t=6AIzp&`Q&
zJ)W9fXi~h<YjeL?fO9%&JiD;?)Ld5cJ2d3jjYu>|?3WIFdeT3|J@!H>I|ur2X#O{R
z1m%dhw!k;a5Gb%eEOS)hc-uJn{;>9m9sX?g2*}FkDR}!|I(!8nXC^q(f&8@H1xFbk
zIXa6B&+lSbebNE96k$0(B61Pwj&2mpE)1?1{4p!FRVI~63$^RkE17>`-@AW7x#fjx
z%gHHn_!=ac=6r^`#~}DSYoR)<zNN`N%uB~m#CBJB<4T9Be~NW1=aClk$)+cRv$uVp
zf?w?H>58FOp+^12tU%smrbToT)X+P)3pX)5Dv|Xgjvh10-BFE#8HKN)E?wpXFa-*H
z84jfVH8p5scs=!;UDbb02?@j@V&M1C@C%;*+Zys~reOsm1#g*bJrQm|vjUhYh<y5H
zOIW6pe)I7ZZeR%f&1XaTU=TUra}t=80H5#Nzf%lrjsrE>Ar3%6Wm0A|H7VDw=XTR}
zg1O>C53d~ftEy##OIR8ca>NwnNhZoYepR%8Fc_CAw~e3Zf!25l@n#tsP!?1-g+SvB
zq?<VN96-ui{J=VN$KHGfeX~|7FLC8UKq?qmy9Z{Vb$4fpmcqBt4Lg&ZCeg{L7kvV{
zU1!3KYZ>SrCo3lXA$tEMeDE6b?aJeT!l<Gbi5Yy#q8)kj@%;mjq5E@goY=<K$_;-4
zP1Wc)b0E~mhZBsSWJ2Fryeibk13qJC+7xq|r;Ta5HPuoap)u@QKjb?y7AJtd{ma!+
zwT*w2edr@Zcj)`2;c*XUm_1wLkuPw%57%VG>{2=|V$;klQ+7uMXxB7S%@@5?AGd<8
z4k*x?_9^uCWKyMcptdp4s?d}{T>ksPO{fI~Dkm+=F?8h*-=f0r0e)e>Mw>{1vdqk4
zU#JJ;kfmMID=M@~>W7RAIAe4uI18%d%G-guMc%yVErCH?)`9QwlGhBk9pyVQfsGHZ
zF&;RB?oJ{w=E{x|ZyDWZ`A%VW+M03h%H_%Hx&N1U>L3uAk7Ij4RnXfqCqbqszcc;Z
z+SQ^{QRtmeKK^}n1!o@P$1$Czg(fly1n$Qno?s%o#;$USGY&M)BaV|h^-FCv$<E#;
z$R;eD&6_q>01^C(@ESkBP*rkNzj<C3RAq35@{sIUuN-}|_tKGrontytzAT{WAB&wn
z!W+m{;3x({dEKY^(LiQ`@UttX9xo5V9N7MGuI0$SXPX)_f0@<h)2wH<Ir`J_FS@>N
zS<Tjd*;&m_#<U=8#xVMg)Z@P130W{50QFiZ1b@=_2js01f75Tr=<9Znv<Gs&)-MU+
z5zi8phF+V0-E$^0I?+;r#bZC5a=_#P<aiC&J5e5RbrehkO^bri<(z8R=v6F>?hAu>
zz5jP9?V9wDSLN*E$H2cYc$X?08-lad?a$pXQ(f+<tGl=sJI9sb%PT|kMT&tLstS&)
zPz`kbr}*AWn^|xbYEZd8<mK1UbZ@*Ojlk>K?G-)!xMlFor^<H~^xdF-b7F!Z=Nixi
z#x(MeR?L8h;y<er;p?e$In54bCj{ty3{K#{xy0BwGw4Xm_5|e6RS<e3E<CrF)`yTJ
zW>Lx|@UGx9*i(rn4&(Lz_&oRw#c+=9;I#2raeD%p1lT#Uen$)j3V}%cm{_S87<D>K
z_vmzzV_A|9@k$QJ33d<M{4nq4dk$(rL2Z<kKkDUI+O%_#fG~qzFmII#T^5_$=Xu}T
zL%~f@voD}D#VI&q0~h%0tbt4sJ6~9O=uB!KB5Z8FrHO`15R_a;$7o_F8(Rn+3-uwQ
zpq`X3Gu1lw0(d__?0{=Bh_#pD<%Ap5*M1rPRhsFDZ7vZ)2Rg6%0y69t_k~)_S)sz7
zUHAhu<<fKD#D`Bw3RH5>-|j1o;NB4%;c1kf6!Z;65PNxukCLNWcHsc%m?wgw|KOmM
zUwUwAHBt<9$&khXf~oB1(a?wx2~q%I5s<6D0|lb^kJ9A$&%<uuUk*D_RPNm&dA8;I
z&vUnMF|b4LZjileBR1y7Vcl0_LD9NJ?7!#1;Sq7XkR*2dmVb^H&xvEhuRF=61KRfR
z(3`xj#L1)ZpuN|D=&TtE{s1RDauz&L3~lHD3``9DCbWM;b?8e-0Owy|Ou;=dzkTZu
zoRU{4_J_Bwv+HFj&8J^e%sJv<^eA<C_f#tT7;#;2IswgvcR2Vm%m1WfY7Pw;ONa-_
z#Bl?Rg6q6{DR!s&CCN3xdEq&;x7pnv_8r7Evl!mhQ;IxK9>7uV2^yd;1wsuH@d#=K
zKQy2`4mJG5V$7ME`#7^XxfqNf#AByG$IGs{P;&)JEI6U!j*Ip_7fNis4^XD+<J~!H
z$aN$@fCHSgfnh~O!O`QYYHDssDAe&C#8s`8msf(Cwu2L^BnjG=6Wm~UA)a(K@*AKx
zy#J!K+xRa9B>|O9wLc;qp{4yJkQVwi*F@{==Sr%(8u$2COfBmBUfZ~y5Yc)Q^&$C*
z<Kfi45gXT5(GnuO)P2utwQ??D`Tj0A)L=Xm!FK&&{j<GM$8E1AdQAiY$+9{SNycaF
zN6X|ObirpjR%xuJRbuHrP1Mcqvqg<Fi2?VMX|614@;cWtiy8+Pb1&|6e0ppWo9(V0
zf8~Sgi|x+p7AYo&qrKa=A|cpQ-3FjgukP~NqKyR)$JuvLnthJ!6<#g>EDkn*a7?ff
z=`_qtiC<f@v9RM{8GS0=a5T%Q1fv$l`X(#dCSX<n!E8;8hvN4qqe*s&mEmBqxLNL&
zv+CaEuiRkiL%yyIuZJ@a2GtKZpeNm5+&*=wfI)6Fp6OBRXcD^ErGR0>GV^`zj<c%q
zK?L>+^%GAMjwZH}f~%4>n+&3OTYRo9hC2|P7Zx*7X|hGzUUs)}!R#k2SG(UXG6})P
zTrCN|K4oTfhDC4U!qL#d%;N9Sdq>4<b>n-S_ml%UZmm#)H?EGKANzY$tZHwhl`XLZ
zT(osUn<21KHUt{`!9bekY6!by6|UvpR?B!)O|xS$ier+qf5|f^e0ouGspC`ztzHe;
z$ga=Tb*9M<sU@jei^&_|ME42c{?A>BRE`VA?&nTWv1|fto}q2_orT#>{$wzR_eIvL
zXRHJ^xh~4wCQmqG{VwW}SVD>4ovu(0iTKs-$IPSuFH{4o{HVhJ&uw`z-v=w&@D+Bi
z!Uo*V$e6E$6`lABd#}PB*v{0LZ-o`j_zL@{3J+jEgJZrJR`la5?4t@l!2QgQ`EFRz
zlCSWWQFA$gD2QQLOD~h(xc|oXHaVCLE<lij2ng&g!a0T|=i|N}MjFF@Rd@_5F35dD
zjC6(_Dm;cYN94XFMkd4Ysqh$fxg+;IF|rvBQ{gcToRa&h7zu{sh;Ti_?Bkl;x5X%9
zI9!FFVP+hZ`@$II3`eN&Gt3S*<-RjUCBu;_{0uYatlZbesAf1yg`Z&-T$cOh7zKu-
zMYzYX<hb0I$7o|Xt_qJ~#eKQ&kI~L>K!wM!=EU4r$mnD^KNTLsE?4HhMMgKnX(~L1
zfkSg&B%{G_9udCJu=8<i?z?1MV>n%fpJ8XZZ_fVrhJK9PxeY`?2m{cTI6lm{|Hd|1
zL12lYfR{P3u=rzV9N!jK!pymG&Od^2gK^{*SHkS$(m5}caS!7-TU-gV;NCg!m2ts1
z?h>ODmRvpO)iR)r16$k)JKR3!?K0quQ?|GhcDaDg3uYh~r*3g44BSEI9W!tkr)_a1
z%!O;{yk-W#IDLgpq!Q-JMReRWn}{;bZ;LBoZd^piWwVJm<BTn?gt>DO9rw*95{xsq
zxDw_c7twL$Y$Ato-_u{X6Bb-V$E~x8fN|f{A6PqK$whQrJe#O8?z8#}cft-A(Q)@|
zqRzN4>o431yIe%a^|Ofv<36sxa3>5@M1O>uF$%*#3<P_B#y;sTlELINi9-TTQuzN6
z(rAkXsdO>mVp&+tE$JI*S(-5nzh1$Su)gpRwY-Mf$}kjr0ZSyTHy)yv*N`-ZVc9D<
z64r%>sO2>z$}mKG1xLcV@({JWhGZ}d*IvPqu-<uyT3$n93`4h9FcLO+h+1AlvN8<g
zUcickU3iFkUPIa#hIFrBB+Ph-dR{}S48yxuFcRiGL_Mz|9SlRgS1=N`@(}gBhSV5_
zeXrn1*jRXodR{}iG7JG<z_{s;#zWNe8p2H<FdTdZN5Y2i5cRx<aMK424PU{Lu%SFe
zJ+C3$^Z~=fS8yb3U=HH9^BTfUA24J*;BCI`$8r8Yw)wrE&+D|!_wVs|eXi4Q0DLP`
IIE$YG0Cz0sFaQ7m

literal 0
HcmV?d00001

diff --git a/demo/documented/tensor-weighted-poisson/unitsquare_32_32_c00.xml.gz b/demo/documented/tensor-weighted-poisson/unitsquare_32_32_c00.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..a12b85500266b02d303377d0b24f3b1de23a8b60
GIT binary patch
literal 6551
zcmb_h2~-p379L0-fIuRPMJ*5!iHerMQ$!FG>c$>60V@iDC@v`aT&M&H0okmA7!+l<
zMNsR5NRfaV2#Zp%DosRC%Br-45}`2$SrXo4fUt#X-+AY9?jb*ux&Qs{cfb43p#Pl`
zU?8w}1z@=^Y>q}_Q8At2&cvs30P<k^c8iTF_D>s1&CKOBFJ+Xc+-$KA-xb=|&hMiA
z_~zdGUW4i$e{AkgQHgO*ja%FA=Uic8-{~*d@<+;Wc-Hgx8TT|YbVrs&BslH*ax<6i
zdb^jjsfni*^v%(cYopJ;!r<(V{4iMb?$*gaAGv7eBTaIbG%fab`{99!`&T7ap)VXN
z^6JkG-dk|NM@>67tQh0#VEa|;%gWG0XK=ShliaFTRPR$x-CY_+ed1Lb7X3umr~HjZ
z7XGX;+hX|zE4GE<1qZgpiVM5h7Dg8i`}=6({=#&o=`_`p8a-ZbT99zu={&gVo^W{e
z*pJ+Ffn|vtO35GHtf4d#DPFpKMc0k%kxz~2zTCLHfMmU_$DB~htgNiPS#25n-=7?O
zvHsBvYg|9qE*xIcw65Tw59j02G=0j^yXksveGN)@bR^Z!!OxaW3GmkPuZS$w-Y}FN
zy1}~5DJjJLVR~1qR^h<6F}2{`yF2ubIUNV>)C{x!Hr>a4565SkJxu?-bzOhnnGLN?
zr|6>4P`jT33}UH(V$@Y<ea!DkzrfkwE@GY9Z5P~PL(UQ5$u=V~LIh83ZK;ZnLV>&&
z^+(puj@8Gsp^u6MGtF-$@(SN?HL`@C_~n^_x4NZ#@w;y1t<x^@cvLmu;(pL=jQy<g
zE>?axeTVIE=z@T@sx(H&p~{^s$Vkf+z2u~(;5BZSn_$OwPME^BVLWZK%MIj7?um<q
z>ikBVa?78+5M`o5*Y+e2t2{Y$JP~cX>Q>(XMu-yUc4A}p@qFW91@d!DrC_e9`{<TN
z{Se-H(6{vU7v)0hW-r7@uVH^mxu*PcYSjt!Um0I`>EAl-2uGvfHVtgE><-_>DoQyD
zj;AXdJuB`-ZbH<bU~NJ?I{{cDLQW}v8T&v!Ue8t#`8{HhHLHiZ9cdBT^{YZI%{K0V
z22GtzrZW%{*QCZ98@v6l111Neh4=*_3Y)Eg-f)dxB=__IIG|dM56VZhQHuGjLy=fm
zHld7h(HPq+=Y~uPWxasq>)}7(ZzDXc>AiBE$l_2|Bdky_@&o=3f@F>Tv$9REj|Vxm
z;l><a$jR*u=6^tx$yewBLOdODmT6Kgwq*n?jhE9=^fy+>?`j`0xw2aG7!a}=P8A<r
z=9SY7d#q<6jNm(~l*!lYc?*G`5NXyOebhiCo{WACW4HN=Q?C0?#A>stu<Y?dh<bB;
z<&Gjxl36XV_RRyl>8|{b72WFR0Kg9wd*&MvxdjQkTNzWeP%n(!0bZ>4QOIH-%B=@@
z)L`WFB{CWFRK3RyjI-4*O2zRaRoN0t4JO!QFGVFUQl0y)HlYyHop=z4B%<S~mN!PP
zE8t6(;2EloPwr<kj(N=&O9EJ%ZMllr3zeX}+SJC#sHX-#Z98Q4w&(})v$q)-?CbXK
zDjd*JipsfZ9Zv~#y=ZVgvcKFiR#X;KVX5(3bj7Ui2!(#ZNXQwO*=#fV`DeK9H5rLh
zgY`cOXF2OZp+mjy3jjEaN4-CJo^r&t<C028?P1O@&)1G>&qQK^V<6EQXk5ESoubDL
zH09~Aj;9uEn5srmn3g6@@xj*S8&wg*!WG?#c3`p4ifQL4M^3ruIpZ15&y)K-E&B$%
z-279u9uzkdCo&NVb1<3$QdE|s%pfz$IV~1c^!@D-xvh7V0aFyLGS741U4`j}j<?t3
zGxqq^pqXt|dmuJkWFXFvA=dx~s)L7{g%_QIjh&uD7RlXp7rS24UUAh`emVhrq<D&i
zywnt{VmXi?I;VGvDMwD0ZuSdWSu`BnS(w8>Fs*xdHeg<)DC=u}1fynIsQqn1(qaa`
z<L!8@%K?CDJZj6SPUKqql{$EadgGJc)?MFD^bN(#PUOMQXX7pdx3yeWQB?-*4Q{&G
zTvlB@vz*J1>?xH^-DswDb4xUn+1>(Xl_v)%`lDletMtG5!}l<->{t=MECzS2gJATL
zrYt7SqT*aSK#3vB!#i4LJ7#!83j%T!Gb^Sj`QNqc02UTiW4qo<{EI!>VIRQQ7rJZc
z2(lP<q+#!Y&H^b6p9dCr)f8n1!2M!0M`;IJTl80jxX1&5ybZn4e~e^~BFcYE4QTG?
zvDS|A=4<7d(9OJRN*ZklMm=?K>uVr&KMI}O%X5D-RRi##?s}S1_9L&G=tdsR{GL|0
z`=jwp8JneQGd@m9*M$Cp;U@bc)NJCfBYa*GR4R~wipHbY)G8C}0U_`9oiN6L>>AIf
zj+06<U;k|w5-yiWA>gMITd6|XKN9j1utygSm(0XuYS%K569^}oqB7fY04z!!oHCh+
zbX&|i23RLY7=WtAqBsOo3Mo^sQm*IaD$AkvD&JWuCi~;KBtp6vYBpJ#c{s!jfocT+
zRoLC{3(q5AA6WO+u|CDPhL&is7?Nx#X3|_{tI_m`{X8jnzp7A3FnXaPJ=lwM3KaJF
z8fgNmf2JSIrj~I&#8P!^|9qP5y^wTM9be-3l1n+-S;%4_!$xMg90oFUMB>PFjAmaQ
zoNQK^<@k9u4GgA?gQr@J_30!8p*-s#?yZ@_y?HuiIzoRJa&TC}z3~asdyWz?H9;1M
zRiw)EDF(|r5X`QbWP<!wwlLB~bxY-yiyJrhR+z2?zF*t1Z|T8J;zO0%zcIde*Rp_2
zCI*}I@nV?F0Ycv7kI~XEODm2W>Lr9EAQK1)CJCuEj2eSAGAw9ob3A=)v3OZ`;sxL=
zRY&P1++=Z2g{e<eU`gZ?bGICt_t{ER#T)yFh7pDlE5zv72iJ6cHQF_jY7C(7E+j6m
z+J1JM4BL5j%0#)%HfjJC>?4n+E4U)pt0eV^tsA*?n!1(5eRtA3x7t8=5tnYu-C>WL
z*ykOCxfWzF%h*JH%vkcF+U-g(Kou6Kp={Vjx$E+)s|e`z=m`@e36?=@B27L0WOHt{
zk*@hFksX(y8jTFEOb{=?3^;Ub>2U90u=J@W)L`l(dd*zJz7o)!aIXX-M~0E07{I|K
z@F?02K4vsoVM~OZ4<lwrOktP(Lk;}|{RH2HPIh)YeXgCO&oynLaTST9|4OjKT$JoY
z5pQ}hWP3Nj0Ej}vqteVRSQSNI3=kKf|MWXI=55($7iT>ap2>2~1?i3yB*)Dn8e!}$
z2R9@LmcTGV8HN-MuUdmgae@QIH5w{Iavjee)h%gt@P0?HyMZecVARsr1+nRN)kbQX
z`Pmkt8ZO2ecYHX3L&%8e63AW(8m`OBmN@-QPs%z8Rdyer>z=l~w`D1K(uyZqZDWeO
zjE&d)1w7ZwFsOL5yp|R)g#E-VWdvR)%H?95a0iE-PB)X{AeX@D=Lk%|rx;23O)t{&
zO(_1?UAO@0$w1M&H{P2a=ijr80ML>ofE|aB7D3ZBe?^4cMA~i1|3<6;0IX`wrVpd!
z^cb5>f>USft7^D}4Dn1iFHkch@R_u*e#3UFx<O|tvV+Hmchu{?2EcQOs@3YTF>?!#
zx3I^t20xDcqikq-*%NTRYO^Z|xx~vPkuftNFXxVrH=r7;>hbZ!(%8mv&8+1UrMvmt
z(id?t=@F1)x7oe6vLj;-_8ZRT%3kL&+p>TqK%`DAHOF7vtcRyq0j-w1@-rX~Xy$|5
znsPE&2GxQs022!8H*B%06FL_$X)=qq*=Y<q!GRU3wvEA+5WUs>+6(IIKZ6God4S3A
zGIN=<;*d+isgleDq5XFOIM~Kd+CmR;#gPNWHHh<SJ3YmpC=iK5Fc(2?G6D$O{QMLM
zcBhNSPo&`c28*4k{5Ve~UDXaowzH=gsu9MS(j}O1QymJ))wmNnPZnlo<z=+=vvBDE
z_2?x0M{D(BR{5UG+8eJRWpw=i7NUk5vT^)~Eh&&o4DKG29J&~<yw$VGTLuhi5m3?B
ziQbYiLv42DA(#3yWo%sL(qNhdxvi2Os&N?_+F~5*0Tk`ybHxx9rkZt}y`Q46%n%SM
zS~JAb)6`uR%7Kym2<SBRLH|kI6qTjAHO^g###4WlN#)rg+Yd=p0etELGYZfaH*6=~
zmg{TTxoc=L&}a4H?7PlU_obO2ZgJ)SV5$mZoEvQKv-^v-H0RDr%b~>XYEa_LMRj@L
zFa+Cvl2|f2{*zHaMhOHXmZI^Dz{h?8U;RMDsMQwvM=Cj()Vi$NPNche_&$!8dH4<H
z55*xV!bEnPYespOKs&$CBK#58*xC2^@Hvjx=Pj9sQ`#;~N;fH!5_r!gK2o$p8BxoR
z1Lqdh>`*@cuqadTLDMfhT?{H6IP!F2iGjPud|$42!027HMk$RYb|Y!L%sSyS5;<@_
z@%kLpq(o}X14T7j0|3CcTqRw;yVj>@(#KYIir);xt>Wo|nEi8*CZG%&uForkTyaPS
zFH@?g2V!tVB6l3D8Mn=|{q897|B}XJKdh4o9b!EIpi$L9relxk_?v+EExRvlO?J73
zXkk9?^XAd?t0s<Zpi+ShozV1QOA+|`XZ*pjQ-$JhB^)%36uIx~PU`%-!_E8+Dl3SF
z<jhpU!GSN(6agTXs8cY2F;}xe!kQVzMfagLnmJFVSR|W%QXK>b_~a~?lBFL)ZUX@R
z?*hKNez8&mCBWtDlvREaBSp^Qq#M{*+~8(z6U<8V-SSfShRQtys8N-ys8qjIYuvnZ
z>9)k=DubA9D$(iUNA3d}59O-+Go=@<iMg!h>DFAEDPGptb{v3H(W?3h{v~g}(o#x>
zzxtY4k>v8t)zQ}dMx5~Oh@@?26O=R;8W}ily&8{QNHnP03NHN1;Foyp@~ZQbzlcTL
pTKeU1r{Juj!M*%n!!~u_>D{<rtGbI>GIC!LxG%U}M0qO*{1?vqPV@i(

literal 0
HcmV?d00001

diff --git a/demo/documented/tensor-weighted-poisson/unitsquare_32_32_c01.xml.gz b/demo/documented/tensor-weighted-poisson/unitsquare_32_32_c01.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..dd3654def5813a2391a736e8ac827ffc5f3f7fd2
GIT binary patch
literal 6570
zcmbtY3pkW%8~(;HBx)>$WKCn6*!?$DOgnZNH4dwsQVv-$PSG$nW<-TSG>%0ju@Y$z
zDP+nN(#Wa9swt--)zV_3ej(@iznR7<qqhC8$Msw@pKIRdeV*sO@Avs$l~@S?Ib>=D
zK(n735F<3<kuQVI@ed)u%3srrw*Dk(`mpilCLIykq(3T-<+4qmv0Gia`-1(*4Dvol
zcLhhOD3VQM@6Ei_9tZiSeyeMk1lOLVU7>aFgU*-OgqOJLSNj&J$1>%W(WZOS<IXbD
z!_Dp!{;Yrd=J3d=r#go<IOj}1?32<yI6k!P^1<|VC~ZdVrf!#8Ikx3Pgv$kiPPZEC
z9$FeS7#|raJ=XOkSh?Uv@*bO{2Ck=e<EF-B>@Bf2<;Ds~zi#6|*a)-;Qnk&^>sYdp
zx0mQyBa+v#vqnd~L{p58X(8h>E0@dEP&N6VW$<wlt~dqNyA7d|6YI_-_yD5e3Y06N
z<6V>~`HM!|ECYc<Auft^z2n2;8dWmCRjH1`k4jbm`(<x0PsS%Murv6@rph#mikDJS
z)Vaze?s{`Uf`X6;OUZ{!Dmg5-m0uaO<!E~Nb=6BubIhA;(EaBLK5<3t>5%Lp)w{^M
z+iW8xVnNGaU_X@Okp)Qa`St`q!N#AE)6K&x0L};#b<P&!G1>gxl2GT+_tz#*xE~L8
zKTck|+juxvFK^m1*eck1%5rL#Srd|wSX#H&?Z@KP_OS(q{I7|n3rrg`d9hZXF&UcO
zW*`G-!bP;q(AcRR`P9I=*ly4Fm3B9?{S-~lW(Fw6oXtF}SiHK}=A-3zxm}qxA2)#o
z)FTM00+SO>h`D3+&DH}VAN0Hec8UU0Ol;f^MYm|>>1xSsYq#9~^C@9RIi2sWODEF}
z>h><S`n`*+EwNOUKvIzU1-AWcRpWk5<MM!@43aJl0(KVR+1nz?Z7{i}DbiDcD6<dp
ziECQ>qd{9@wz5@Q;w5E#TOv*QU|V92a#-8rE6Us1B!V0a=Z-xM!}(z4#BpToX>qq;
zikOI<MB^2ERqQQ;>q<DDdwQvP(24UFc7mj<0|BDK5IWWyUrZVMpIVj$sqn{d9jes3
zp3ro*iA3lULu$gK!>Cd?55zWT;u>lTwhM;b3a<~NuD}H#?m`p4rH*2|#F1F|vT!OK
z7lr79S)r*6gQwDK#+#$2OEW|J$r0;25~2Yh3_%TQ6A9$j^uV#Ajlo3^%tD-4ozCa_
zvK>?{;9=n=a=2{7CNY`ssk;rTC6Ts`I@@;MFuIN?7L(aXB^gvNM>@eF5he<_>I<&>
z(htW6M0ld90TEG$eR7-m?m6-IU&~zA003OV<@{FebGvhSfapn!w};FsAqOMY`ND%D
z>XdNL5reQqH1)PYmo)P8j~){n?LI^@Ji)3R%*@>=*BzNvVc8{(xmA_qSBnAw1iU&5
z(;li#aM(;Kf7kVGbFxBl&DRHk_rv15Sv^h{M=f`&#0+k?3RUCnu;&eIM}smO03xt(
zrM~Z4LQ95vPl{i-cw}s#d5EyRQm3i!qLZqy3>x<;B!$E;Ot4Kls{_GzF|vl_EHw+c
z;b=knL;bK5r*%;xfJ7ML^|Gc)y8OFUvJetUw~V7bwI(QHz3;UzmP%02EFzp7k*kCQ
zL#ZF|ewg<9wpR{68GgCP8C9zN30?qzMZjXRrc3dZ$Ugubx&^xvjPqZZjBjHK=6pze
zU<4IS6}SQ`=R}cwIXfDlD>g*1`TpAOuu@5W+xf1}S}rICX<^l+9y9+}2_4SA-U5N(
ztRUf%O_T_ATX%B(CJNE<@~O%U7OD9kgP>yu&DX8v`sECD4dbVNH1vhe!%t(Ybn<mR
ziSUT6)_0r&x%W01AbyA5^xt4UUP%M{quC|x;Zye@`GIFc+`^U!mZ|l4-_xvyrus$j
zU2cwApL)#Un5^?zpYF3!6@4?i!(bVJm4X`V;dJg@B`2c#B4jGE%+ZN;<)2`B4h7>m
zYWZs&UbkRsS7Yc;v}g&vP5%k-E_J=Hd<xyuA)RntHy6SK1ns~(4QcUX*&+kAzE8?K
z2@Gw)wq3agmWs(^KOYI6Icja{F#$1I>5FpV(}YBdSl`V9go^?!D`sr_5!kaG;ujpy
zoI!uHN~7n_UD5(4jIy&r1Fk+3XemNJBEB=>D}zE5zTmFP-gQHol;DZ)|8`<s{cPF#
zVULL*JwZo~$uhTksvd(eT>1x?=g!&fTG9Xj+|{%l){tJdR+bWe=@0TCED3$`c37A6
zcfN=qXuXojbL{M+Y$AdT%~LYzz>cdYg~ViMAbWF6X8$YX2fz7h?ixse0f;C(B0ojH
zWWQxO31E<8AAR7HH4&{46d`bP8aKz7Tx+?RRD_~&mgz$;rN31_v=a&dOid}9(alN`
zc}b8rY}=oBWECo;{~`$P`GtC=wO|+#0Dx*)+Dz)^hu>u`>uKsQn*>E}b~AILEjYoz
zV~pPnE08U6hW|j)jeLL4ZWmC;-k#fFZt&7sbg0=WrM$2g6ok0jRr4MHl>F$@vt~*r
zWH&+{bv}QQ=vTW105qkTo{{>+GA-7McPfI<ykCs9+4C6pwL!Y1*W9iW9>#GYr2kb@
z=IE9>6Glr4>UD22`WK4%RcPZC2T}#UJu@7=t`rv#@tCLy>WhFSU}NUV<d+Y{3|`re
z>+s7q(7-(re`1fGvv+~t^c>pe#0zY>pkhlA{!{4`Y~VsG4{e^JAVaa<g`J^VTj+|w
zaZWdPCd&WQlG(jnsNzK-iXq@k%WLc15)7x%uyr!^a_>s&hu&D2eSlp$67hs+*(Pmz
z%fJh*Hl_ak%wL0%xVZ1P_iG0`2APAb!TW>mV?Jehu|iDA8ciDrH4g-3?FRs_5EZ^z
ztR6n%6z7dS2%Q|j=#S~6$t26IV|F19({>d<hN|bFjW#$XJ0;ipS<BCwt@UC<(}+7e
zQW#p~E!K7_y#YG`Ec_Vu!4vfIQQLrTDyYZhwpSgZ4HR%5G5Bs{6S=4`mh4!-aUme-
zD3`vEcA#&udGyV<kPs<w{zN&$0g6JddZftPPCE|erKsEelPc4zZWJCV;CMKqISl*e
zhYVs9xuh`dN_1;#ioJ10RF*YU<<EB~ULJp$^U{f_!SrRSFds4=2r(7)L*7tLI1}rQ
z+CI2p!XnxGotU^~ZOzs@O{ki-YP&QAg6wvSr0KD?$(G5YF@iq>g`#a-WQDZFMl|b4
zWjLgbnv}RA0SX)zo~mZ@?&_QMM~g&y=vz^h{u~S&RYQ-q=P*hO9e6G_ShmO)`N`so
z7cQg??Cdzl*i7Ev=be^vB%7@TzRCdLtISm1DB5P3@~bdNLhLYR0+kRf`}f|fx0*N}
z<wVdCT<9o|ytGTiWQKj8N8V<1Vp;S9GdCjAU-n#DT|4eIYLn1M!Lq@X(Z;+<6Mh$f
zJ1kpqvL&>bE3NkP9kM#o@R4d|GHajwFZl8IUO~wk_iuF9`lVsMu%wW{9jIb9ZvWA2
zHmJdX6jaMXeAw6Ln-MBydZnp1abBaB+NO{-7d{#>bL+%$(Fb`UL?Ljffd=QrleKZ7
z?i^?R^$2d1Wv4%fQBtV;(Sa#!Mr$qQK3lq0bYie<EBf(U?(J;06*!Gah*eoGKR<QK
z{-v|X&y%Z?Gsjwn_rEXwX^Q;W!Y|zZ!o2O%>e_HksBuqOurn+GxT7frT{YcKlj(5<
zCN>xj{CuPGkxqKCS&lbL{p*_{h)j^338Qn6e>n0QV`a;2^T5L)6Dv*4AN5}?p;<SP
z8rpGuw{VZ2Cg<`R<w5+^(aj#vqg!>f*r*XNj53dofCSXQTP@)l*TX~#`xm5e#|OWV
zvErXWWVwzNwHH2G8mUVajE$q4x$&KT`eAnU`tB8`066<o&tbT22QvAotoWD;KLPD@
z;Y3(!c^-pWbrO9(I(t@Le(#oD11&HB941?=2f0_tb<ZQk-BuzRGyEqwU*C{<Me}iK
zLV56Ant6#?j$>LN*cWMVlz?jOWRoWI;<xRA)@fAMwbq`vclBPzy({F;w?r8C*{EV4
zB;QSt8uZdrgE7JUff9(qD_nk;L*MVK0d3J&_xn&b^)FTzfUyZxtdm$8U0~*xX5LD(
zruRO*5v|(2!V{o?XH}-@*mm8>UYI6e-F-BJjmCdbqlC7Gk17v#HK>x>=^kb|_AIYj
z8cUV`LV-n4%NQ@56lGPd#SoO=#@~*${1p6o9TXY^6i^?efG70c(>@q?em>2p<kP%6
z8t_ho7TrC$gDH|J($b<=4u&ZUPG4%JrPHKGd#Ba$U8=b~OPzpmH_Is`y6|r^C<;+w
z1#71tgm6Y!5H(5zWAagdnx;@G|3YA%qVU_&N@IDmyy(4K*re35Xg<n#hYW}^o2fzL
z)skfr6tu72m_q34KVNmeYWf<vpUXrqz1Sk>4NDzFSv!t^*2-?rlmS5U7ZrtYAD+y;
zEJa~XUHYrN;$IM6SW9?Bc+3MCc+~`gj9PX0y|ImCnIx9(tvA*A^<A0I_>T=K=-t9Q
zFN$vQSeeJGmuOMepbz&<B<xro#oYrvsIQW2asO;Ld(br~nf>fjeOye&`NCD4VcrVX
zE5};E=<`0Wz*{C9c*`VJ?Oh(~?s-AxPEFH&i@!&{j+HaOqDL3>p4Lt;7U(&@Tud{;
zG%TX!eWjS|Vkf#0`r`NU$s<Ik{Y!&Yh(OOG3sgTgseyko&CVVvY#v+GM8Fvdk*oe4
zwx+Vkld@W~a>8+Vy8d|g*=`nZ%pG$bBaG3P*8k#8+(=qoh-|AbawfujsU3fXS~2^&
zYC9^+{v|I1d|j0<<9rpuW>gDQNI@F&gMbJl@D5~I2td(<vxcYRGsBDkB?k@tKiJJ*
zZnvPMa}=2)`)skmK}`dkVcLsiC?LM7k^@_7Xxtjh2C3H7*IM0En^)fG^F&+8_oGs4
z0~J+ja{lW+sZ$ZJ@|TTc0mF`5)aUZ--sRXm#y6s0vq!b2;W-)R4_$A^t^A8Mx{3Jg
z%pO}CM|*N7yLtzsoDE3bwUkqiepTisFDWAVO_gEN)O#7|cZ~Gz9}eXVbNy-NJJVAz
zT4a~L>Zj3pvep}Dk5VwMeQ|l4XFg1fqh**jBiiNb-QSjXT^tL1wR3o_|0?FIa{3Vl
O47l%<P6-`?0RICD<p^H@

literal 0
HcmV?d00001

diff --git a/demo/documented/tensor-weighted-poisson/unitsquare_32_32_c11.xml.gz b/demo/documented/tensor-weighted-poisson/unitsquare_32_32_c11.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..bf841bc6c5fd1cd30329fec02af9931762d9a849
GIT binary patch
literal 6548
zcmb_g30P9;8a@aLE{VBCQ!2SJrj|D8SY~KVrH)&rIh9jl+gRSLriMmP#070JQ!=gG
znoQd@GSSMtMQoZZa<VAYRw)q|LM4HFKoA$aHTT}<^ZC>RobP|%@BQBYKbRdt0Oow}
zl>oHhiO0@(2ff7hXg}No2!ISfwcKTamiL3E@_Ei`2I<*V$Ih|5qt`}tlGfyfm=xy(
zPn*7cTKudWqrHnFE?5iyR=@rtaks<;wXo<3uaB7f{!&I;XA83D$B4#P-Cjv4tAa4E
zD|QxzGHKjxy{<R2hb*tBu<u6|J-$3`sc-h;TSvEtY)ke^>8kRnXzA)$IahRYwk`YV
zocVj40+04S$|c&*s@S_8{_*0z72*}=+tb@=3HR+os%qZahE&zQ)t%G2Thkw1XB3{D
zcGo0)X8K*L@a*)v_Te+Bcby!s9LO7>?(#jnBP_(=^-0vz+vV2MtLJY!Wk{O&zELJD
z00DE<i_lDnc9*22>GwPisM%`JQp{hv+L+TGzUXq%YYvC=mh&Lo*&px!^XiZ>@$>2l
z!7MM_?fd%VU8fXY;b6~u<C~mWcXU$#m>LRE2BTPtzNajkCD2Y@znfZp9?yLJlE44^
zJ2!3EzCBv0!TY6m*X@ElH3TDYOgxFFGn|^89*mBg;cVZ&ohR|k=%3-N;-bv?uGV2F
zL?}9$!`~eyZty{;Y=eZ*Gx%jDrSRv-(rKj|e<3xoo8m6k1hviHWmK*eqJBj!m@NHw
z`?%1e^oH6X3wuLtc@1fBe>T~c$J-!2x*cu>z#Me|rwr>)bGb8TYFp%2|DI4#Om}!^
zf9ZGaE5;$}vRGyuw##TFf_BN{cQ+tdT^<1i$oU*-kkCDIF?{d?dZWpki}A#LM_H0@
zJ`oF^J5B*Sbf6yIUR#o|SChIiQ<7}#c1V`Y9J!~8yDO@IzxTC$s4<$!)%O2f*Id<o
zomX46uq7Dtdl5fJZ@;c#F7&|rTjfH}>zm90G8z$g{P-YD(iq?l*oV@zuapTdtG`(g
zkPCgcU{@}*V?p`FAKM&W7`gM^|9~61m2^OsBj-oeJTgd~gU<P3;fsu{y)CTxN;he$
z-1&<{5}e~f@R(5wUsrD1&4C2)r~xET`cexZ6r~a7>eekjlL21?O_)AFY^+QSA+JOp
zjmm!lEi`rc1YCfxa?Aff4nmeh<u^mGnC|}sT!M$Wp+Az>A_aobNLh+(D%KEfmnN<5
zC~7gb!D!$UPy&y0Lw80`7p%Bp!gANCanM_D<6<OXldcAyh=rD~o`vA!wJX%_m^uh*
zuJ%*$s~U^~1T{2xmRnONWE*l30eB95WO`H}?k&<0X~}Ep3Y$Hu7j^{0MOwQE`79{g
zbU;9kG#j1V=Gx!`U;q&B@F(*_D=P+-JY|mIk?uAYv=w}F4IN(P*3BhHB8i02ms(h^
z;lH_Of_2bp27#e*IzCNgO(J1cT$<tG(ohwjDx+g<@IFugRD{kGo3}`NfYuD$*m7>e
z-=bTIH`OMoB_nKkZ%}u2oTpE~0nK@i9vJIU%VAUJeDlI+{4!k$pVRl;vjl3~^<c}m
z9z(8&;tX*xVt=z^=R^CU=Cn4`p>dxnp~DFTS<*|>oITHDxphYaY$9+Z@pBD*T;f&G
zH?Hc+*8tG4xU8a0LpzqLWd;J+4X3uo>})R{%Y<BGQlaJg_+Pkt)QOVoGn!U8G>eLe
z0oze9bLY2M)y**yFzH~keAEB{>ev)GwBurY?=H0)`=X8z>5p+q)#>^-3tG<J(Ul_s
z;kcd1#~AQ8$Ehr$qVCA0?>`GHxJP_}WHJijd_4{?NvVKf9vZfFs#$1oJ{fmuN!1X4
z%dJ747N5xXx9*^FsF!C9(BsF8MT&&ikeq($+uFnWqqXNjQt-*6M^+cSI6Vabbm~hk
z_DXh~ss9Aov^1@mq)k$<bnD=HL?WXIB^ZNF28=MT_8$XMs`%GP?BlL14FIJPhq|Cm
z`eo&kTHwaMa~sz1{;K;tJU3#h*N38XY=-zeEZ}Ucw`O2@u)arz)`iUhwPVI%M)=3N
zO4ZWs<kqrHJGmluRly6;2p#mGj)Bv}O$#OKpa?QG1C${HMw(Zf=hKZb7%yLygSWVw
z3vC^rI=J!d#j-R&ea7LY9&;^(02DHM`Gtz!ZEMul&W4uTGw(M>67o%ci5D!<#;Z@%
zw33;T?vK7SO0wX3u_xN{d_J<po)z)>0HBA6yKMX!bB&BJsHvV=9}@}R*&Yd>WR%BF
z!Z?g0)`*On=K(5-0dqT1L&pmRR&S4l13(x`gLZK6I|3q_1MK~1m_vM7w{e_}{fB>*
z)+P5}(1aCp(L@DZOA4Hw8A+103KXEjPwfvQ5WfX#ltcz^d3!UlT6K>n>)RLRuaZGG
zlUX59@1V10;5%0JHH`qZv}U^c*E5$-hs%dTyg3eRiof-M0*KPIeXB&C6`Q^RVo?-w
zR?NXci;sMSt~=fD5kq1u)>2_*<D3oTP3emuQHs_~qM=F)S+4*+%CnQCEkx8g_?5Ge
z-@c%@c(y5DAVUKJP+%G5d`dL(Er<{~Lf+vu0~Rx4qn%=-Z<=4cZ$IACm2&>C{G*Z`
zGd#LFx82u8if<o8FWm>ww$S_}zk-%j72U>yk4u%&O)R)H#k-vd^|x-JY6>=gopQhp
zYnZ%H6s28@6c%6NEz{nXiV50NJt?CncHC%<*|#g7%CsljK>~t@W{lcFx`UO3eL=yh
z4g}+SCfz~a{*?kGgrT&`68`L2DM|5w==}>am*x4oCs_MRTUF(*)(tHzZ2|!oIk%IW
zNSZhD^Q^5#lw#52dFw}_C()beb<48K${06QMOf4=PY^xqM%v&bU}&&WCD!{H;4?tG
z{-SH@A!TW5Ik(MqC<7+JudI43dTe{(jxQc`4x|qp-*0J*lYTY@F=MK;xt)r*WUh=(
z%pKkBKr9(WIenvSC@rPV^4D&QMz5rty)Dx8Q$fACi7}_dGijMOc9l@EP9xmJFu;us
zs_ti(!PG!k=OrlcaOpzzME8gfB_2HT0Ul7a<b5A$|6?3g_tf5&f_iHcXHJP1$KRV2
zh9Y)o`|&rrkT<HCspY9vtBVmtO`^6P#Y#mm3iBd_jKbDPCJ8hHa}b0^T-Ks=Y<sF5
zs#m-1hW(=1M5EwW83Ud}o<rU`nc^Q3mQ9GDgo$w(v3{!cDRDy~mc~hq5ca))_F%<9
z69b4IY?j`W(prc(qcRq`9#{)sJ#_Ce&VOO2*I0VKhNfOl9#M$N6EliPG8!aIiOkW$
z&>)By*FMbgfCeOhpX2v;$A-E+NxpMLjI-GAmI54=;`@zrc$SOkHV5N}-7P%8^v{lY
z#WyI*Q+a7K)8APnOKofannKd|t0Q%lEWKdz96V`x=&)=)aI4p?#T|g}7ql4;nwTxf
zoq0d$3%68JxPXK4#fA&Ln31%4Yu5;A^2v_LD<pYc2VFW8l}yfF6g_C5o#+imucu`0
zGrQM|n|#eG3dk-=3;3UmdCWi6S;EkjB{}T=Bgb67g#fWQ^t<!#TUmBGuTB?R1R7iW
zkzVmJW7A|rjjcfC<-8$a2H9R!czp%4)u~MEs;(vt0HEMnRt`$&wWrO^9Gnf;zWirs
z=8NQXF$8|JN@@hplI1#<@_yf8F#sqEF2631<#1`(GZ!33{>SBysDbK>ea0V70>8&>
zujj5_1kA{*3exrnS2UV10pPZS4$P?Uo&XTCART`*7QU5f0Myd~rZTBgnY0(w!o2yS
z%>>LdwpSTGotvYwdHvzS;S*de4z+yt(A6pR+kwx&1+6jtGII(XpuTvP+?;|+YN@g%
z<Mi)b1RiwcC+(tM$-kDKv05A&agNser81{tXdH|z$t$D_{3h3DK~d{-{xBZ!q<#1N
zjbqr-B^{wawP-J`7c1=%xGrT<_Eu_FGSA8@#e)@OjZwa;a(-`f@LeMt=xHs|_Ok&D
zK)}6lso^S7l?nV;B`|)~_c<dCqRbvT&wa_f4|t<#H}0ySLEdyw#jUQ4e!t#IDv@XT
z6<#EjM)gxEbJl9$452BF56#v&7N{Myr~3B~TY_>}ze>WBJ0R~JUwN7e8d%E0e)>*!
znv(pq7_=riD)}ISwj$H+u#87uRVn2OCD%w@0etEL5uq-2Cpl}ao)X%6rLj>_=zjzv
zpS#u$DQ~3^AQ^`$54t7U>VGir1+Zn=BL?2i4D>k~2lRPHp>*sgpZE!DSAh@|_fyU=
zBJi<4KNIiX_quhu{<muYw+bJ@B3)7zjbnSN3QSy+vz2E`@y7&5Uh$2Jid~}baBTfH
z?iL<o24`1&-6b05bKh}=bz6TNa=n<i1lEc5c5yk5^>G%-hJAQY{$W#;z@)n$kHrU_
zjs-{`OI+^@CA2GR7xu(<lHCXJcBHHbo=+Lxn&nEJ#Js+WHN^(Va~6T6jsXDpE!Q<8
zN#ljn*|DM(n*C-;Sf6m-w_KBdPLiC;EzDr&XjwX2`8tAkSoTCL^;6rSG;W@7dX3nI
zCOq;M`G0|-n1`ZgQrVq@000@a_0Zt=6!j(Q-I&a+?>7zd?{HFGL{k;J<2Wl;Heh_`
z6c!jE1otGlr!${&q+kC)WgQA0FkoG+PK9*l&9)`!<SAx#@;j=qP*p{!QiG-Eh|~7m
zn-2gEI`z8}u~)+pQK*`#pVON6Nyq4`LC8ufeURlkvX_tCqgBdWIRuqJMz^f`%RN>+
zBVPXxA4nf7b6+pXE|K9!s`sllZQ*R3S!-3U*%g=67Tj%k3-%)}t<F4gnbsjgV;j3w
zs2BXXxpA3oQ&2Iy5XBoqZ7vm*q}MI(;v>%sjzG}}7;eDR@R}9=w0p8;gYgGZbi(7h
zH$3O>PITG!6YR`=e#lC8n2Iy6`yt@~!eFYk^uko!@`UMAw<`V+@cglq%bh!-`i@oh
fr>DMqZL=-tq2n2pG4J}zr%pg1;Xpp=4Fvc%9osIQ

literal 0
HcmV?d00001

diff --git a/demo/undocumented/adaptive-poisson/cpp/CMakeLists.txt b/demo/undocumented/adaptive-poisson/cpp/CMakeLists.txt
new file mode 100644
index 0000000..7343503
--- /dev/null
+++ b/demo/undocumented/adaptive-poisson/cpp/CMakeLists.txt
@@ -0,0 +1,39 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+project(demo_adaptive-poisson)
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Add special DOLFIN compiler flags
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${DOLFIN_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+
+
+# Target libraries
+NOT_SET
diff --git a/demo/undocumented/adaptive-poisson/cpp/README b/demo/undocumented/adaptive-poisson/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/undocumented/adaptive-poisson/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/adaptive-poisson/python/demo_adaptive-poisson.py b/demo/undocumented/adaptive-poisson/python/demo_adaptive-poisson.py
new file mode 100755
index 0000000..e2c7e7d
--- /dev/null
+++ b/demo/undocumented/adaptive-poisson/python/demo_adaptive-poisson.py
@@ -0,0 +1,104 @@
+"""This demo program solves Poisson's equation
+
+    - div grad u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+    f(x, y) = exp(-100(x^2 + y^2))
+
+and homogeneous Dirichlet boundary conditions.
+
+Note that we use a simplified error indicator, ignoring
+edge (jump) terms and the size of the interpolation constant.
+"""
+
+# Copyright (C) 2008 Rolv Erlend Bredesen
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2008-2011
+#
+# First added:  2008-04-03
+# Last changed: 2013-01-23
+
+from dolfin import *
+from numpy import array, sqrt
+from math import pow
+
+# This demo does not work without CGAL
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+TOL = 5e-4           # Error tolerance
+REFINE_RATIO = 0.50  # Refine 50 % of the cells in each iteration
+MAX_ITER = 20        # Maximal number of iterations
+
+# Create initial mesh
+mesh = UnitSquareMesh(4, 4)
+source_str = "exp(-100.0*(pow(x[0], 2) + pow(x[1], 2)))"
+source = eval("lambda x: " + source_str)
+
+# Adaptive algorithm
+for level in xrange(MAX_ITER):
+
+    # Define variational problem
+    V = FunctionSpace(mesh, "CG", 1)
+    v = TestFunction(V)
+    u = TrialFunction(V)
+    f = Expression(source_str)
+    a = dot(grad(v), grad(u))*dx
+    L = v*f*dx
+
+    # Define boundary condition
+    u0 = Constant(0.0)
+    bc = DirichletBC(V, u0, DomainBoundary())
+
+    # Compute solution
+    u = Function(V)
+    solve(a == L, u, bc)
+
+    # Compute error indicators
+    h = array([c.diameter() for c in cells(mesh)])
+    K = array([c.volume() for c in cells(mesh)])
+    R = array([abs(source([c.midpoint().x(), c.midpoint().y()])) for c in cells(mesh)])
+    gamma = h*R*sqrt(K)
+
+    # Compute error estimate
+    E = sum([g*g for g in gamma])
+    E = sqrt(MPI.sum(mesh.mpi_comm(), E))
+    print "Level %d: E = %g (TOL = %g)" % (level, E, TOL)
+
+    # Check convergence
+    if E < TOL:
+        info("Success, solution converged after %d iterations" % level)
+        break
+
+    # Mark cells for refinement
+    cell_markers = MeshFunction("bool", mesh, mesh.topology().dim())
+    gamma_0 = sorted(gamma, reverse=True)[int(len(gamma)*REFINE_RATIO)]
+    gamma_0 = MPI.max(mesh.mpi_comm(), gamma_0)
+    for c in cells(mesh):
+        cell_markers[c] = gamma[c.index()] > gamma_0
+
+    # Refine mesh
+    mesh = refine(mesh, cell_markers)
+
+    # Plot mesh
+    plot(mesh)
+
+# Hold plot
+interactive()
diff --git a/demo/undocumented/advection-diffusion/cpp/AdvectionDiffusion.h b/demo/undocumented/advection-diffusion/cpp/AdvectionDiffusion.h
new file mode 100644
index 0000000..34e97a7
--- /dev/null
+++ b/demo/undocumented/advection-diffusion/cpp/AdvectionDiffusion.h
@@ -0,0 +1,7538 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ADVECTIONDIFFUSION_H
+#define __ADVECTIONDIFFUSION_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class advectiondiffusion_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new advectiondiffusion_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class advectiondiffusion_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new advectiondiffusion_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class advectiondiffusion_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new advectiondiffusion_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class advectiondiffusion_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new advectiondiffusion_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class advectiondiffusion_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new advectiondiffusion_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class advectiondiffusion_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new advectiondiffusion_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class advectiondiffusion_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    44
+    // Number of operations (multiply-add pairs) for tensor contraction: 164
+    // Total number of operations (multiply-add pairs):                  211
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    const double G1_ = det;
+    const double G2_0_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G2_0_0_1 = det*w[0][0]*K[2]*(1.0);
+    const double G2_1_0_0 = det*w[0][1]*K[0]*(1.0);
+    const double G2_1_0_1 = det*w[0][1]*K[2]*(1.0);
+    const double G2_2_0_0 = det*w[0][2]*K[0]*(1.0);
+    const double G2_2_0_1 = det*w[0][2]*K[2]*(1.0);
+    const double G2_3_0_0 = det*w[0][3]*K[0]*(1.0);
+    const double G2_3_0_1 = det*w[0][3]*K[2]*(1.0);
+    const double G2_4_0_0 = det*w[0][4]*K[0]*(1.0);
+    const double G2_4_0_1 = det*w[0][4]*K[2]*(1.0);
+    const double G2_5_0_0 = det*w[0][5]*K[0]*(1.0);
+    const double G2_5_0_1 = det*w[0][5]*K[2]*(1.0);
+    const double G2_6_1_0 = det*w[0][6]*K[1]*(1.0);
+    const double G2_6_1_1 = det*w[0][6]*K[3]*(1.0);
+    const double G2_7_1_0 = det*w[0][7]*K[1]*(1.0);
+    const double G2_7_1_1 = det*w[0][7]*K[3]*(1.0);
+    const double G2_8_1_0 = det*w[0][8]*K[1]*(1.0);
+    const double G2_8_1_1 = det*w[0][8]*K[3]*(1.0);
+    const double G2_9_1_0 = det*w[0][9]*K[1]*(1.0);
+    const double G2_9_1_1 = det*w[0][9]*K[3]*(1.0);
+    const double G2_10_1_0 = det*w[0][10]*K[1]*(1.0);
+    const double G2_10_1_1 = det*w[0][10]*K[3]*(1.0);
+    const double G2_11_1_0 = det*w[0][11]*K[1]*(1.0);
+    const double G2_11_1_1 = det*w[0][11]*K[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 6.25e-05*G0_0_0 + 6.25e-05*G0_0_1 + 6.25e-05*G0_1_0 + 6.25e-05*G0_1_1 + 0.0833333333333333*G1_ - 0.000416666666666666*G2_0_0_0 - 0.000416666666666665*G2_0_0_1 + 0.000208333333333333*G2_1_0_0 + 0.000208333333333333*G2_1_0_1 + 0.000208333333333333*G2_2_0_0 + 0.000208333333333333*G2_2_0_1 - 0.000833333333333332*G2_3_0_0 - 0.000833333333333332*G2_3_0_1 - 0.00166666666666667*G2_4_0_0 - 0.00166666666666667*G2_4_0_1 - 0.00166666666666667*G2_5_0_0 - 0.00166666666666667*G2_5_0_1 - 0.000416666666666666*G2_6_1_0 - 0.000416666666666665*G2_6_1_1 + 0.000208333333333333*G2_7_1_0 + 0.000208333333333333*G2_7_1_1 + 0.000208333333333333*G2_8_1_0 + 0.000208333333333333*G2_8_1_1 - 0.000833333333333332*G2_9_1_0 - 0.000833333333333332*G2_9_1_1 - 0.00166666666666667*G2_10_1_0 - 0.00166666666666667*G2_10_1_1 - 0.00166666666666667*G2_11_1_0 - 0.00166666666666667*G2_11_1_1;
+    A[1] = -6.25e-05*G0_0_0 - 6.25e-05*G0_1_0 + 0.0416666666666667*G1_ + 0.000416666666666666*G2_0_0_0 - 0.000208333333333333*G2_1_0_0 - 0.000208333333333333*G2_2_0_0 + 0.000833333333333332*G2_3_0_0 + 0.00166666666666667*G2_4_0_0 + 0.00166666666666667*G2_5_0_0 + 0.000416666666666666*G2_6_1_0 - 0.000208333333333333*G2_7_1_0 - 0.000208333333333333*G2_8_1_0 + 0.000833333333333332*G2_9_1_0 + 0.00166666666666667*G2_10_1_0 + 0.00166666666666667*G2_11_1_0;
+    A[2] = -6.25e-05*G0_0_1 - 6.25e-05*G0_1_1 + 0.0416666666666667*G1_ + 0.000416666666666665*G2_0_0_1 - 0.000208333333333333*G2_1_0_1 - 0.000208333333333333*G2_2_0_1 + 0.000833333333333332*G2_3_0_1 + 0.00166666666666667*G2_4_0_1 + 0.00166666666666667*G2_5_0_1 + 0.000416666666666665*G2_6_1_1 - 0.000208333333333333*G2_7_1_1 - 0.000208333333333333*G2_8_1_1 + 0.000833333333333332*G2_9_1_1 + 0.00166666666666667*G2_10_1_1 + 0.00166666666666667*G2_11_1_1;
+    A[3] = -6.25e-05*G0_0_0 - 6.25e-05*G0_0_1 + 0.0416666666666667*G1_ + 0.000208333333333333*G2_0_0_0 + 0.000208333333333333*G2_0_0_1 - 0.000416666666666665*G2_1_0_0 - 0.000416666666666665*G2_1_0_1 + 0.000208333333333333*G2_2_0_0 + 0.000208333333333333*G2_2_0_1 - 0.00166666666666667*G2_3_0_0 - 0.00166666666666667*G2_3_0_1 - 0.000833333333333333*G2_4_0_0 - 0.000833333333333332*G2_4_0_1 - 0.00166666666666667*G2_5_0_0 - 0.00166666666666667*G2_5_0_1 + 0.000208333333333333*G2_6_1_0 + 0.000208333333333333*G2_6_1_1 - 0.000416666666666665*G2_7_1_0 - 0.000416666666666665*G2_7_1_1 + 0.000208333333333333*G2_8_1_0 + 0.000208333333333333*G2_8_1_1 - 0.00166666666666667*G2_9_1_0 - 0.00166666666666667*G2_9_1_1 - 0.000833333333333333*G2_10_1_0 - 0.000833333333333332*G2_10_1_1 - 0.00166666666666667*G2_11_1_0 - 0.00166666666666667*G2_11_1_1;
+    A[4] = 6.25e-05*G0_0_0 + 0.0833333333333333*G1_ - 0.000208333333333333*G2_0_0_0 + 0.000416666666666665*G2_1_0_0 - 0.000208333333333333*G2_2_0_0 + 0.00166666666666667*G2_3_0_0 + 0.000833333333333333*G2_4_0_0 + 0.00166666666666667*G2_5_0_0 - 0.000208333333333333*G2_6_1_0 + 0.000416666666666665*G2_7_1_0 - 0.000208333333333333*G2_8_1_0 + 0.00166666666666667*G2_9_1_0 + 0.000833333333333333*G2_10_1_0 + 0.00166666666666667*G2_11_1_0;
+    A[5] = 6.25e-05*G0_0_1 + 0.0416666666666667*G1_ - 0.000208333333333333*G2_0_0_1 + 0.000416666666666665*G2_1_0_1 - 0.000208333333333333*G2_2_0_1 + 0.00166666666666667*G2_3_0_1 + 0.000833333333333332*G2_4_0_1 + 0.00166666666666667*G2_5_0_1 - 0.000208333333333333*G2_6_1_1 + 0.000416666666666665*G2_7_1_1 - 0.000208333333333333*G2_8_1_1 + 0.00166666666666667*G2_9_1_1 + 0.000833333333333332*G2_10_1_1 + 0.00166666666666667*G2_11_1_1;
+    A[6] = -6.25e-05*G0_1_0 - 6.25e-05*G0_1_1 + 0.0416666666666667*G1_ + 0.000208333333333333*G2_0_0_0 + 0.000208333333333333*G2_0_0_1 + 0.000208333333333333*G2_1_0_0 + 0.000208333333333333*G2_1_0_1 - 0.000416666666666665*G2_2_0_0 - 0.000416666666666665*G2_2_0_1 - 0.00166666666666667*G2_3_0_0 - 0.00166666666666667*G2_3_0_1 - 0.00166666666666667*G2_4_0_0 - 0.00166666666666667*G2_4_0_1 - 0.000833333333333332*G2_5_0_0 - 0.000833333333333332*G2_5_0_1 + 0.000208333333333333*G2_6_1_0 + 0.000208333333333333*G2_6_1_1 + 0.000208333333333333*G2_7_1_0 + 0.000208333333333333*G2_7_1_1 - 0.000416666666666665*G2_8_1_0 - 0.000416666666666665*G2_8_1_1 - 0.00166666666666667*G2_9_1_0 - 0.00166666666666667*G2_9_1_1 - 0.00166666666666667*G2_10_1_0 - 0.00166666666666667*G2_10_1_1 - 0.000833333333333332*G2_11_1_0 - 0.000833333333333332*G2_11_1_1;
+    A[7] = 6.25e-05*G0_1_0 + 0.0416666666666667*G1_ - 0.000208333333333333*G2_0_0_0 - 0.000208333333333333*G2_1_0_0 + 0.000416666666666665*G2_2_0_0 + 0.00166666666666667*G2_3_0_0 + 0.00166666666666667*G2_4_0_0 + 0.000833333333333332*G2_5_0_0 - 0.000208333333333333*G2_6_1_0 - 0.000208333333333333*G2_7_1_0 + 0.000416666666666665*G2_8_1_0 + 0.00166666666666667*G2_9_1_0 + 0.00166666666666667*G2_10_1_0 + 0.000833333333333332*G2_11_1_0;
+    A[8] = 6.25e-05*G0_1_1 + 0.0833333333333333*G1_ - 0.000208333333333333*G2_0_0_1 - 0.000208333333333333*G2_1_0_1 + 0.000416666666666665*G2_2_0_1 + 0.00166666666666667*G2_3_0_1 + 0.00166666666666667*G2_4_0_1 + 0.000833333333333332*G2_5_0_1 - 0.000208333333333333*G2_6_1_1 - 0.000208333333333333*G2_7_1_1 + 0.000416666666666665*G2_8_1_1 + 0.00166666666666667*G2_9_1_1 + 0.00166666666666667*G2_10_1_1 + 0.000833333333333332*G2_11_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class advectiondiffusion_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    122
+    // Number of operations (multiply-add pairs) for tensor contraction: 176
+    // Total number of operations (multiply-add pairs):                  301
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0_0 = det*(w[0][0]*((K[0]*K[0] + K[1]*K[1])));
+    const double G0_0_0_1 = det*(w[0][0]*((K[0]*K[2] + K[1]*K[3])));
+    const double G0_0_1_0 = det*(w[0][1]*((K[0]*K[0] + K[1]*K[1])));
+    const double G0_0_2_1 = det*(w[0][2]*((K[0]*K[2] + K[1]*K[3])));
+    const double G0_1_0_0 = det*(w[0][0]*((K[2]*K[0] + K[3]*K[1])));
+    const double G0_1_0_1 = det*(w[0][0]*((K[2]*K[2] + K[3]*K[3])));
+    const double G0_1_1_0 = det*(w[0][1]*((K[2]*K[0] + K[3]*K[1])));
+    const double G0_1_2_1 = det*(w[0][2]*((K[2]*K[2] + K[3]*K[3])));
+    const double G1_0_0_0_0 = det*w[1][0]*w[0][0]*K[0]*(1.0);
+    const double G1_0_0_0_1 = det*w[1][0]*w[0][0]*K[2]*(1.0);
+    const double G1_0_0_1_0 = det*w[1][0]*w[0][1]*K[0]*(1.0);
+    const double G1_0_0_2_1 = det*w[1][0]*w[0][2]*K[2]*(1.0);
+    const double G1_1_0_0_0 = det*w[1][1]*w[0][0]*K[0]*(1.0);
+    const double G1_1_0_0_1 = det*w[1][1]*w[0][0]*K[2]*(1.0);
+    const double G1_1_0_1_0 = det*w[1][1]*w[0][1]*K[0]*(1.0);
+    const double G1_1_0_2_1 = det*w[1][1]*w[0][2]*K[2]*(1.0);
+    const double G1_2_0_0_0 = det*w[1][2]*w[0][0]*K[0]*(1.0);
+    const double G1_2_0_0_1 = det*w[1][2]*w[0][0]*K[2]*(1.0);
+    const double G1_2_0_1_0 = det*w[1][2]*w[0][1]*K[0]*(1.0);
+    const double G1_2_0_2_1 = det*w[1][2]*w[0][2]*K[2]*(1.0);
+    const double G1_3_0_0_0 = det*w[1][3]*w[0][0]*K[0]*(1.0);
+    const double G1_3_0_0_1 = det*w[1][3]*w[0][0]*K[2]*(1.0);
+    const double G1_3_0_1_0 = det*w[1][3]*w[0][1]*K[0]*(1.0);
+    const double G1_3_0_2_1 = det*w[1][3]*w[0][2]*K[2]*(1.0);
+    const double G1_4_0_0_0 = det*w[1][4]*w[0][0]*K[0]*(1.0);
+    const double G1_4_0_0_1 = det*w[1][4]*w[0][0]*K[2]*(1.0);
+    const double G1_4_0_1_0 = det*w[1][4]*w[0][1]*K[0]*(1.0);
+    const double G1_4_0_2_1 = det*w[1][4]*w[0][2]*K[2]*(1.0);
+    const double G1_5_0_0_0 = det*w[1][5]*w[0][0]*K[0]*(1.0);
+    const double G1_5_0_0_1 = det*w[1][5]*w[0][0]*K[2]*(1.0);
+    const double G1_5_0_1_0 = det*w[1][5]*w[0][1]*K[0]*(1.0);
+    const double G1_5_0_2_1 = det*w[1][5]*w[0][2]*K[2]*(1.0);
+    const double G1_6_1_0_0 = det*w[1][6]*w[0][0]*K[1]*(1.0);
+    const double G1_6_1_0_1 = det*w[1][6]*w[0][0]*K[3]*(1.0);
+    const double G1_6_1_1_0 = det*w[1][6]*w[0][1]*K[1]*(1.0);
+    const double G1_6_1_2_1 = det*w[1][6]*w[0][2]*K[3]*(1.0);
+    const double G1_7_1_0_0 = det*w[1][7]*w[0][0]*K[1]*(1.0);
+    const double G1_7_1_0_1 = det*w[1][7]*w[0][0]*K[3]*(1.0);
+    const double G1_7_1_1_0 = det*w[1][7]*w[0][1]*K[1]*(1.0);
+    const double G1_7_1_2_1 = det*w[1][7]*w[0][2]*K[3]*(1.0);
+    const double G1_8_1_0_0 = det*w[1][8]*w[0][0]*K[1]*(1.0);
+    const double G1_8_1_0_1 = det*w[1][8]*w[0][0]*K[3]*(1.0);
+    const double G1_8_1_1_0 = det*w[1][8]*w[0][1]*K[1]*(1.0);
+    const double G1_8_1_2_1 = det*w[1][8]*w[0][2]*K[3]*(1.0);
+    const double G1_9_1_0_0 = det*w[1][9]*w[0][0]*K[1]*(1.0);
+    const double G1_9_1_0_1 = det*w[1][9]*w[0][0]*K[3]*(1.0);
+    const double G1_9_1_1_0 = det*w[1][9]*w[0][1]*K[1]*(1.0);
+    const double G1_9_1_2_1 = det*w[1][9]*w[0][2]*K[3]*(1.0);
+    const double G1_10_1_0_0 = det*w[1][10]*w[0][0]*K[1]*(1.0);
+    const double G1_10_1_0_1 = det*w[1][10]*w[0][0]*K[3]*(1.0);
+    const double G1_10_1_1_0 = det*w[1][10]*w[0][1]*K[1]*(1.0);
+    const double G1_10_1_2_1 = det*w[1][10]*w[0][2]*K[3]*(1.0);
+    const double G1_11_1_0_0 = det*w[1][11]*w[0][0]*K[1]*(1.0);
+    const double G1_11_1_0_1 = det*w[1][11]*w[0][0]*K[3]*(1.0);
+    const double G1_11_1_1_0 = det*w[1][11]*w[0][1]*K[1]*(1.0);
+    const double G1_11_1_2_1 = det*w[1][11]*w[0][2]*K[3]*(1.0);
+    const double G2_0 = det*w[0][0]*(1.0);
+    const double G2_1 = det*w[0][1]*(1.0);
+    const double G2_2 = det*w[0][2]*(1.0);
+    const double G3_0 = det*w[2][0]*(1.0);
+    const double G3_1 = det*w[2][1]*(1.0);
+    const double G3_2 = det*w[2][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = -6.25e-05*G0_0_0_0 - 6.25e-05*G0_0_0_1 + 6.25e-05*G0_0_1_0 + 6.25e-05*G0_0_2_1 - 6.25e-05*G0_1_0_0 - 6.25e-05*G0_1_0_1 + 6.25e-05*G0_1_1_0 + 6.25e-05*G0_1_2_1 + 0.000416666666666666*G1_0_0_0_0 + 0.000416666666666665*G1_0_0_0_1 - 0.000416666666666666*G1_0_0_1_0 - 0.000416666666666665*G1_0_0_2_1 - 0.000208333333333333*G1_1_0_0_0 - 0.000208333333333333*G1_1_0_0_1 + 0.000208333333333333*G1_1_0_1_0 + 0.000208333333333333*G1_1_0_2_1 - 0.000208333333333333*G1_2_0_0_0 - 0.000208333333333333*G1_2_0_0_1 + 0.000208333333333333*G1_2_0_1_0 + 0.000208333333333333*G1_2_0_2_1 + 0.000833333333333332*G1_3_0_0_0 + 0.000833333333333332*G1_3_0_0_1 - 0.000833333333333332*G1_3_0_1_0 - 0.000833333333333332*G1_3_0_2_1 + 0.00166666666666667*G1_4_0_0_0 + 0.00166666666666667*G1_4_0_0_1 - 0.00166666666666667*G1_4_0_1_0 - 0.00166666666666667*G1_4_0_2_1 + 0.00166666666666667*G1_5_0_0_0 + 0.00166666666666667*G1_5_0_0_1 - 0.00166666666666667*G1_5_0_1_0 - 0.00166666666666667*G1_5_0_2_1 + 0.000416666666666666*G1_6_1_0_0 + 0.000416666666666665*G1_6_1_0_1 - 0.000416666666666666*G1_6_1_1_0 - 0.000416666666666665*G1_6_1_2_1 - 0.000208333333333333*G1_7_1_0_0 - 0.000208333333333333*G1_7_1_0_1 + 0.000208333333333333*G1_7_1_1_0 + 0.000208333333333333*G1_7_1_2_1 - 0.000208333333333333*G1_8_1_0_0 - 0.000208333333333333*G1_8_1_0_1 + 0.000208333333333333*G1_8_1_1_0 + 0.000208333333333333*G1_8_1_2_1 + 0.000833333333333332*G1_9_1_0_0 + 0.000833333333333332*G1_9_1_0_1 - 0.000833333333333332*G1_9_1_1_0 - 0.000833333333333332*G1_9_1_2_1 + 0.00166666666666667*G1_10_1_0_0 + 0.00166666666666667*G1_10_1_0_1 - 0.00166666666666667*G1_10_1_1_0 - 0.00166666666666667*G1_10_1_2_1 + 0.00166666666666667*G1_11_1_0_0 + 0.00166666666666667*G1_11_1_0_1 - 0.00166666666666667*G1_11_1_1_0 - 0.00166666666666667*G1_11_1_2_1 + 0.0833333333333333*G2_0 + 0.0416666666666667*G2_1 + 0.0416666666666667*G2_2 + 0.00416666666666666*G3_0 + 0.00208333333333333*G3_1 + 0.00208333333333333*G3_2;
+    A[1] = 6.25e-05*G0_0_0_0 + 6.25e-05*G0_0_0_1 - 6.25e-05*G0_0_1_0 - 6.25e-05*G0_0_2_1 - 0.000208333333333333*G1_0_0_0_0 - 0.000208333333333333*G1_0_0_0_1 + 0.000208333333333333*G1_0_0_1_0 + 0.000208333333333333*G1_0_0_2_1 + 0.000416666666666665*G1_1_0_0_0 + 0.000416666666666665*G1_1_0_0_1 - 0.000416666666666665*G1_1_0_1_0 - 0.000416666666666665*G1_1_0_2_1 - 0.000208333333333333*G1_2_0_0_0 - 0.000208333333333333*G1_2_0_0_1 + 0.000208333333333333*G1_2_0_1_0 + 0.000208333333333333*G1_2_0_2_1 + 0.00166666666666667*G1_3_0_0_0 + 0.00166666666666667*G1_3_0_0_1 - 0.00166666666666667*G1_3_0_1_0 - 0.00166666666666667*G1_3_0_2_1 + 0.000833333333333333*G1_4_0_0_0 + 0.000833333333333332*G1_4_0_0_1 - 0.000833333333333333*G1_4_0_1_0 - 0.000833333333333332*G1_4_0_2_1 + 0.00166666666666667*G1_5_0_0_0 + 0.00166666666666667*G1_5_0_0_1 - 0.00166666666666667*G1_5_0_1_0 - 0.00166666666666667*G1_5_0_2_1 - 0.000208333333333333*G1_6_1_0_0 - 0.000208333333333333*G1_6_1_0_1 + 0.000208333333333333*G1_6_1_1_0 + 0.000208333333333333*G1_6_1_2_1 + 0.000416666666666665*G1_7_1_0_0 + 0.000416666666666665*G1_7_1_0_1 - 0.000416666666666665*G1_7_1_1_0 - 0.000416666666666665*G1_7_1_2_1 - 0.000208333333333333*G1_8_1_0_0 - 0.000208333333333333*G1_8_1_0_1 + 0.000208333333333333*G1_8_1_1_0 + 0.000208333333333333*G1_8_1_2_1 + 0.00166666666666667*G1_9_1_0_0 + 0.00166666666666667*G1_9_1_0_1 - 0.00166666666666667*G1_9_1_1_0 - 0.00166666666666667*G1_9_1_2_1 + 0.000833333333333333*G1_10_1_0_0 + 0.000833333333333332*G1_10_1_0_1 - 0.000833333333333333*G1_10_1_1_0 - 0.000833333333333332*G1_10_1_2_1 + 0.00166666666666667*G1_11_1_0_0 + 0.00166666666666667*G1_11_1_0_1 - 0.00166666666666667*G1_11_1_1_0 - 0.00166666666666667*G1_11_1_2_1 + 0.0416666666666667*G2_0 + 0.0833333333333333*G2_1 + 0.0416666666666667*G2_2 + 0.00208333333333333*G3_0 + 0.00416666666666666*G3_1 + 0.00208333333333333*G3_2;
+    A[2] = 6.25e-05*G0_1_0_0 + 6.25e-05*G0_1_0_1 - 6.25e-05*G0_1_1_0 - 6.25e-05*G0_1_2_1 - 0.000208333333333333*G1_0_0_0_0 - 0.000208333333333333*G1_0_0_0_1 + 0.000208333333333333*G1_0_0_1_0 + 0.000208333333333333*G1_0_0_2_1 - 0.000208333333333333*G1_1_0_0_0 - 0.000208333333333333*G1_1_0_0_1 + 0.000208333333333333*G1_1_0_1_0 + 0.000208333333333333*G1_1_0_2_1 + 0.000416666666666665*G1_2_0_0_0 + 0.000416666666666665*G1_2_0_0_1 - 0.000416666666666665*G1_2_0_1_0 - 0.000416666666666665*G1_2_0_2_1 + 0.00166666666666667*G1_3_0_0_0 + 0.00166666666666667*G1_3_0_0_1 - 0.00166666666666667*G1_3_0_1_0 - 0.00166666666666667*G1_3_0_2_1 + 0.00166666666666667*G1_4_0_0_0 + 0.00166666666666667*G1_4_0_0_1 - 0.00166666666666667*G1_4_0_1_0 - 0.00166666666666667*G1_4_0_2_1 + 0.000833333333333332*G1_5_0_0_0 + 0.000833333333333332*G1_5_0_0_1 - 0.000833333333333332*G1_5_0_1_0 - 0.000833333333333332*G1_5_0_2_1 - 0.000208333333333333*G1_6_1_0_0 - 0.000208333333333333*G1_6_1_0_1 + 0.000208333333333333*G1_6_1_1_0 + 0.000208333333333333*G1_6_1_2_1 - 0.000208333333333333*G1_7_1_0_0 - 0.000208333333333333*G1_7_1_0_1 + 0.000208333333333333*G1_7_1_1_0 + 0.000208333333333333*G1_7_1_2_1 + 0.000416666666666665*G1_8_1_0_0 + 0.000416666666666665*G1_8_1_0_1 - 0.000416666666666665*G1_8_1_1_0 - 0.000416666666666665*G1_8_1_2_1 + 0.00166666666666667*G1_9_1_0_0 + 0.00166666666666667*G1_9_1_0_1 - 0.00166666666666667*G1_9_1_1_0 - 0.00166666666666667*G1_9_1_2_1 + 0.00166666666666667*G1_10_1_0_0 + 0.00166666666666667*G1_10_1_0_1 - 0.00166666666666667*G1_10_1_1_0 - 0.00166666666666667*G1_10_1_2_1 + 0.000833333333333332*G1_11_1_0_0 + 0.000833333333333332*G1_11_1_0_1 - 0.000833333333333332*G1_11_1_1_0 - 0.000833333333333332*G1_11_1_2_1 + 0.0416666666666667*G2_0 + 0.0416666666666667*G2_1 + 0.0833333333333333*G2_2 + 0.00208333333333333*G3_0 + 0.00208333333333333*G3_1 + 0.00416666666666666*G3_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class advectiondiffusion_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "846250aee5aebcb1fa657d35041deb65ebded9aa767a013a7db70abdfb5b32031146d63bd7bac8824e404f2da1df77164bc9f8459aa7b24b538684e85da5e06a";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new advectiondiffusion_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new advectiondiffusion_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new advectiondiffusion_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class advectiondiffusion_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "c0f06173bc8a97c8f7934da13c7a573ba36d330878e42f669ded910c15403077c323b8761811828dbda766e11b2167b47a59e2034d388cbe6f579ffee5612d6f";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new advectiondiffusion_finite_element_1();
+        break;
+      }
+    case 3:
+      {
+        return new advectiondiffusion_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new advectiondiffusion_dofmap_1();
+        break;
+      }
+    case 3:
+      {
+        return new advectiondiffusion_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new advectiondiffusion_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace AdvectionDiffusion
+{
+
+class CoefficientSpace_b: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_b(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_b(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_b(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_b(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_b(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_b(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_b()
+  {
+  }
+
+};
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_u0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_b Form_a_FunctionSpace_2;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), b(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& b):
+    dolfin::Form(2, 1), b(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->b = b;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> b):
+    dolfin::Form(2, 1), b(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->b = *b;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), b(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& b):
+    dolfin::Form(2, 1), b(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->b = b;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> b):
+    dolfin::Form(2, 1), b(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->b = *b;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "b")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "b";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_b;
+
+  // Coefficients
+  dolfin::CoefficientAssigner b;
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u0 Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_b Form_L_FunctionSpace_2;
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_3;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 3), u0(*this, 0), b(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& b, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 3), u0(*this, 0), b(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u0 = u0;
+    this->b = b;
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> b, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 3), u0(*this, 0), b(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u0 = *u0;
+    this->b = *b;
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 3), u0(*this, 0), b(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& b, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 3), u0(*this, 0), b(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->u0 = u0;
+    this->b = b;
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> b, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 3), u0(*this, 0), b(*this, 1), f(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->u0 = *u0;
+    this->b = *b;
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u0")
+      return 0;
+    else if (name == "b")
+      return 1;
+    else if (name == "f")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u0";
+    case 1:
+      return "b";
+    case 2:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_u0;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_b;
+  typedef Form_L_FunctionSpace_3 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u0;
+  dolfin::CoefficientAssigner b;
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/advection-diffusion/cpp/AdvectionDiffusion.ufl b/demo/undocumented/advection-diffusion/cpp/AdvectionDiffusion.ufl
new file mode 100644
index 0000000..200fd59
--- /dev/null
+++ b/demo/undocumented/advection-diffusion/cpp/AdvectionDiffusion.ufl
@@ -0,0 +1,40 @@
+# Copyright (C) 2006-2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2006-02-09
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# convection-diffusion using cG(1)cG(1).
+#
+# Compile this form with FFC: ffc -l dolfin AdvectionDiffusion.ufl
+
+scalar = FiniteElement("Lagrange", triangle, 1)
+vector = VectorElement("Lagrange", triangle, 2)
+
+u = TrialFunction(scalar)
+v  = TestFunction(scalar)
+u0 = Coefficient(scalar)
+b  = Coefficient(vector)
+f  = Coefficient(scalar)
+
+c = 0.005
+k = 0.05
+
+a = u*v*dx + 0.5*k*(dot(b, grad(u)*v)*dx + c*dot(grad(u), grad(v))*dx)
+L = u0*v*dx - 0.5*k*(dot(b, grad(u0)*v)*dx + c*dot( grad(u0), grad(v))*dx) \
+    + k*f*v*dx
diff --git a/demo/undocumented/advection-diffusion/cpp/CMakeLists.txt b/demo/undocumented/advection-diffusion/cpp/CMakeLists.txt
new file mode 100644
index 0000000..6fce944
--- /dev/null
+++ b/demo/undocumented/advection-diffusion/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_advection-diffusion)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/advection-diffusion/cpp/Velocity.h b/demo/undocumented/advection-diffusion/cpp/Velocity.h
new file mode 100644
index 0000000..c899ed7
--- /dev/null
+++ b/demo/undocumented/advection-diffusion/cpp/Velocity.h
@@ -0,0 +1,5113 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __VELOCITY_H
+#define __VELOCITY_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class velocity_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  velocity_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocity_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new velocity_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class velocity_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  velocity_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocity_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocity_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new velocity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new velocity_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class velocity_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  velocity_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocity_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new velocity_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class velocity_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  velocity_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocity_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocity_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new velocity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new velocity_dofmap_1();
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Velocity
+{
+
+class FunctionSpace: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  FunctionSpace(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~FunctionSpace()
+  {
+  }
+
+};
+
+}
+
+#endif
diff --git a/demo/undocumented/advection-diffusion/cpp/Velocity.ufl b/demo/undocumented/advection-diffusion/cpp/Velocity.ufl
new file mode 100644
index 0000000..65e1625
--- /dev/null
+++ b/demo/undocumented/advection-diffusion/cpp/Velocity.ufl
@@ -0,0 +1,25 @@
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-03-07
+# Last changed: 2009-05-15
+#
+# A continuous P2 vector element
+#
+# Compile this form with FFC: ffc -l dolfin Velocity.form
+
+element = VectorElement("Lagrange", triangle, 2)
diff --git a/demo/undocumented/advection-diffusion/cpp/compile.log b/demo/undocumented/advection-diffusion/cpp/compile.log
new file mode 100644
index 0000000..b7a36c2
--- /dev/null
+++ b/demo/undocumented/advection-diffusion/cpp/compile.log
@@ -0,0 +1,741 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling element Velocity
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+Compiler stage 1 finished in 0.000257015 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 2 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 2 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.013695 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  
+Compiler stage 3 finished in 0.000164032 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 2 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 2 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.283608 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000443935 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Velocity.h.
+  
+Compiler stage 5 finished in 0.00126791 seconds.
+
+FFC finished in 0.29988 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form AdvectionDiffusion
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 1
+  Coefficients:           '[w_1]'
+  Coefficient names:      '[b]'
+  Unique elements:        'CG1(?), Vector<2 x CG2(?)>'
+  Unique sub elements:    'CG1(?), Vector<2 x CG2(?)>, CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 3
+  Coefficients:           '[w_0, w_1, w_2]'
+  Coefficient names:      '[u0, b, f]'
+  Unique elements:        'CG1(?), Vector<2 x CG2(?)>'
+  Unique sub elements:    'CG1(?), Vector<2 x CG2(?)>, CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 3
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.040498 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.00105 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000932 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  432 entries computed in 0.00242 seconds
+  Shape of reference tensor: (3, 3, 12, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 3 dims = [12, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1], [2, 0, 0], [2, 0, 1], [2, 1, 0], [2, 1, 1], [3, 0, 0], [3, 0, 1], [3, 1, 0], [3, 1, 1], [4, 0, 0], [4, 0, 1], [4, 1, 0], [4, 1, 1], [5, 0, 0], [5, 0, 1], [5, 1, 0], [5, 1, 1], [6, 0, 0], [6, 0, 1], [6, 1, 0], [6, 1, 1], [7, 0, 0], [7, 0, 1], [7, 1, 0], [7, 1, 1], [8, 0, 0], [8, 0, 1], [8, 1, 0], [8, 1, 1], [9, 0, 0], [9, 0, 1], [9, 1, 0], [9, 1, 1], [10, 0, 0], [10, 0, 1], [10, 1, 0], [10, 1, 1], [11, 0, 0], [11, 0, 1], [11, 1, 0], [11, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [12, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1], [2, 0, 0], [2, 0, 1], [2, 1, 0], [2, 1, 1], [3, 0, 0], [3, 0, 1], [3, 1, 0], [3, 1, 1], [4, 0, 0], [4, 0, 1], [4, 1, 0], [4, 1, 1], [5, 0, 0], [5, 0, 1], [5, 1, 0], [5, 1, 1], [6, 0, 0], [6, 0, 1], [6, 1, 0], [6, 1, 1], [7, 0, 0], [7, 0, 1], [7, 1, 0], [7, 1, 1], [8, 0, 0], [8, 0, 1], [8, 1, 0], [8, 1, 1], [9, 0, 0], [9, 0, 1], [9, 1, 0], [9, 1, 1], [10, 0, 0], [10, 0, 1], [10, 1, 0], [10, 1, 1], [11, 0, 0], [11, 0, 1], [11, 1, 0], [11, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.001 seconds
+  Shape of reference tensor: (3, 2, 3, 2)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 3 dims = [2, 3, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [0, 2, 0], [0, 2, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1], [1, 2, 0], [1, 2, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [2, 3, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [0, 2, 0], [0, 2, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1], [1, 2, 0], [1, 2, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  432 entries computed in 0.00236 seconds
+  Shape of reference tensor: (3, 12, 2, 3, 2)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 4 dims = [12, 2, 3, 2] indices = [[0, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0], [0, 0, 1, 1], [0, 0, 2, 0], [0, 0, 2, 1], [0, 1, 0, 0], [0, 1, 0, 1], [0, 1, 1, 0], [0, 1, 1, 1], [0, 1, 2, 0], [0, 1, 2, 1], [1, 0, 0, 0], [1, 0, 0, 1], [1, 0, 1, 0], [1, 0, 1, 1], [1, 0, 2, 0], [1, 0, 2, 1], [1, 1, 0, 0], [1, 1, 0, 1], [1, 1, 1, 0], [1, 1, 1, 1], [1, 1, 2, 0], [1, 1, 2, 1], [2, 0, 0, 0], [2, 0, 0, 1], [2, 0, 1, 0], [2, 0, 1, 1], [2, 0, 2, 0], [2, 0, 2, 1], [2, 1, 0, 0], [2, 1, 0, 1], [2, 1, 1, 0], [2, 1, 1, 1], [2, 1, 2, 0], [2, 1, 2, 1], [3, 0, 0, 0], [3, 0, 0, 1], [3, 0, 1, 0], [3, 0, 1, 1], [3, 0, 2, 0], [3, 0, 2, 1], [3, 1, 0, 0], [3, 1, 0, 1], [3, 1, 1, 0], [3, 1, 1, 1], [3, 1, 2, 0], [3, 1, 2, 1], [4, 0, 0, 0], [4, 0, 0, 1], [4, 0, 1, 0], [4, 0, 1, 1], [4, 0, 2, 0], [4, 0, 2, 1], [4, 1, 0, 0], [4, 1, 0, 1], [4, 1, 1, 0], [4, 1, 1, 1], [4, 1, 2, 0], [4, 1, 2, 1], [5, 0, 0, 0], [5, 0, 0, 1], [5, 0, 1, 0], [5, 0, 1, 1], [5, 0, 2, 0], [5, 0, 2, 1], [5, 1, 0, 0], [5, 1, 0, 1], [5, 1, 1, 0], [5, 1, 1, 1], [5, 1, 2, 0], [5, 1, 2, 1], [6, 0, 0, 0], [6, 0, 0, 1], [6, 0, 1, 0], [6, 0, 1, 1], [6, 0, 2, 0], [6, 0, 2, 1], [6, 1, 0, 0], [6, 1, 0, 1], [6, 1, 1, 0], [6, 1, 1, 1], [6, 1, 2, 0], [6, 1, 2, 1], [7, 0, 0, 0], [7, 0, 0, 1], [7, 0, 1, 0], [7, 0, 1, 1], [7, 0, 2, 0], [7, 0, 2, 1], [7, 1, 0, 0], [7, 1, 0, 1], [7, 1, 1, 0], [7, 1, 1, 1], [7, 1, 2, 0], [7, 1, 2, 1], [8, 0, 0, 0], [8, 0, 0, 1], [8, 0, 1, 0], [8, 0, 1, 1], [8, 0, 2, 0], [8, 0, 2, 1], [8, 1, 0, 0], [8, 1, 0, 1], [8, 1, 1, 0], [8, 1, 1, 1], [8, 1, 2, 0], [8, 1, 2, 1], [9, 0, 0, 0], [9, 0, 0, 1], [9, 0, 1, 0], [9, 0, 1, 1], [9, 0, 2, 0], [9, 0, 2, 1], [9, 1, 0, 0], [9, 1, 0, 1], [9, 1, 1, 0], [9, 1, 1, 1], [9, 1, 2, 0], [9, 1, 2, 1], [10, 0, 0, 0], [10, 0, 0, 1], [10, 0, 1, 0], [10, 0, 1, 1], [10, 0, 2, 0], [10, 0, 2, 1], [10, 1, 0, 0], [10, 1, 0, 1], [10, 1, 1, 0], [10, 1, 1, 1], [10, 1, 2, 0], [10, 1, 2, 1], [11, 0, 0, 0], [11, 0, 0, 1], [11, 0, 1, 0], [11, 0, 1, 1], [11, 0, 2, 0], [11, 0, 2, 1], [11, 1, 0, 0], [11, 1, 0, 1], [11, 1, 1, 0], [11, 1, 1, 1], [11, 1, 2, 0], [11, 1, 2, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 4 dims = [12, 2, 3, 2] indices = [[0, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0], [0, 0, 1, 1], [0, 0, 2, 0], [0, 0, 2, 1], [0, 1, 0, 0], [0, 1, 0, 1], [0, 1, 1, 0], [0, 1, 1, 1], [0, 1, 2, 0], [0, 1, 2, 1], [1, 0, 0, 0], [1, 0, 0, 1], [1, 0, 1, 0], [1, 0, 1, 1], [1, 0, 2, 0], [1, 0, 2, 1], [1, 1, 0, 0], [1, 1, 0, 1], [1, 1, 1, 0], [1, 1, 1, 1], [1, 1, 2, 0], [1, 1, 2, 1], [2, 0, 0, 0], [2, 0, 0, 1], [2, 0, 1, 0], [2, 0, 1, 1], [2, 0, 2, 0], [2, 0, 2, 1], [2, 1, 0, 0], [2, 1, 0, 1], [2, 1, 1, 0], [2, 1, 1, 1], [2, 1, 2, 0], [2, 1, 2, 1], [3, 0, 0, 0], [3, 0, 0, 1], [3, 0, 1, 0], [3, 0, 1, 1], [3, 0, 2, 0], [3, 0, 2, 1], [3, 1, 0, 0], [3, 1, 0, 1], [3, 1, 1, 0], [3, 1, 1, 1], [3, 1, 2, 0], [3, 1, 2, 1], [4, 0, 0, 0], [4, 0, 0, 1], [4, 0, 1, 0], [4, 0, 1, 1], [4, 0, 2, 0], [4, 0, 2, 1], [4, 1, 0, 0], [4, 1, 0, 1], [4, 1, 1, 0], [4, 1, 1, 1], [4, 1, 2, 0], [4, 1, 2, 1], [5, 0, 0, 0], [5, 0, 0, 1], [5, 0, 1, 0], [5, 0, 1, 1], [5, 0, 2, 0], [5, 0, 2, 1], [5, 1, 0, 0], [5, 1, 0, 1], [5, 1, 1, 0], [5, 1, 1, 1], [5, 1, 2, 0], [5, 1, 2, 1], [6, 0, 0, 0], [6, 0, 0, 1], [6, 0, 1, 0], [6, 0, 1, 1], [6, 0, 2, 0], [6, 0, 2, 1], [6, 1, 0, 0], [6, 1, 0, 1], [6, 1, 1, 0], [6, 1, 1, 1], [6, 1, 2, 0], [6, 1, 2, 1], [7, 0, 0, 0], [7, 0, 0, 1], [7, 0, 1, 0], [7, 0, 1, 1], [7, 0, 2, 0], [7, 0, 2, 1], [7, 1, 0, 0], [7, 1, 0, 1], [7, 1, 1, 0], [7, 1, 1, 1], [7, 1, 2, 0], [7, 1, 2, 1], [8, 0, 0, 0], [8, 0, 0, 1], [8, 0, 1, 0], [8, 0, 1, 1], [8, 0, 2, 0], [8, 0, 2, 1], [8, 1, 0, 0], [8, 1, 0, 1], [8, 1, 1, 0], [8, 1, 1, 1], [8, 1, 2, 0], [8, 1, 2, 1], [9, 0, 0, 0], [9, 0, 0, 1], [9, 0, 1, 0], [9, 0, 1, 1], [9, 0, 2, 0], [9, 0, 2, 1], [9, 1, 0, 0], [9, 1, 0, 1], [9, 1, 1, 0], [9, 1, 1, 1], [9, 1, 2, 0], [9, 1, 2, 1], [10, 0, 0, 0], [10, 0, 0, 1], [10, 0, 1, 0], [10, 0, 1, 1], [10, 0, 2, 0], [10, 0, 2, 1], [10, 1, 0, 0], [10, 1, 0, 1], [10, 1, 1, 0], [10, 1, 1, 1], [10, 1, 2, 0], [10, 1, 2, 1], [11, 0, 0, 0], [11, 0, 0, 1], [11, 0, 1, 0], [11, 0, 1, 1], [11, 0, 2, 0], [11, 0, 2, 1], [11, 1, 0, 0], [11, 1, 0, 1], [11, 1, 1, 0], [11, 1, 1, 1], [11, 1, 2, 0], [11, 1, 2, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000781 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000768 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0268822 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.00028801 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.301311 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00113106 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./AdvectionDiffusion.h.
+  
+Compiler stage 5 finished in 0.00124693 seconds.
+
+FFC finished in 0.3718 seconds.
diff --git a/demo/undocumented/advection-diffusion/cpp/main.cpp b/demo/undocumented/advection-diffusion/cpp/main.cpp
new file mode 100644
index 0000000..c8b53e5
--- /dev/null
+++ b/demo/undocumented/advection-diffusion/cpp/main.cpp
@@ -0,0 +1,113 @@
+// Copyright (C) 2006-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-02-09
+// Last changed: 2013-03-21
+//
+// This demo solves the time-dependent advection-diffusion equation
+// by a least-squares stabilized cG(1)cG(1) method. The velocity field
+// used in the simulation is the output from the Stokes (Taylor-Hood)
+// demo.  The sub domains for the different boundary conditions are
+// computed by the demo program in src/demo/subdomains.
+
+#include <dolfin.h>
+#include "AdvectionDiffusion.h"
+#include "Velocity.h"
+#include <dolfin/io/XMLFile.h>
+
+using namespace dolfin;
+
+int main(int argc, char *argv[])
+{
+  // Read mesh
+  Mesh mesh("../dolfin_fine.xml.gz");
+
+  // Create velocity FunctionSpace
+  Velocity::FunctionSpace V_u(mesh);
+
+  // Create velocity function
+  Function velocity(V_u);
+  XMLFile file_u(mesh.mpi_comm(), "../dolfin_fine_velocity.xml.gz");
+  file_u >> velocity;
+
+  // Read sub domain markers
+  MeshFunction<std::size_t> sub_domains(mesh,
+                                        "../dolfin_fine_subdomains.xml.gz");
+
+  // Create function space
+  AdvectionDiffusion::FunctionSpace V(mesh);
+
+  // Source term and initial condition
+  Constant f(0.0);
+  Function u(V);
+
+  // Set up forms
+  AdvectionDiffusion::BilinearForm a(V, V);
+  a.b = velocity;
+  AdvectionDiffusion::LinearForm L(V);
+  L.u0 = u; L.b = velocity; L.f = f;
+
+  // Set up boundary condition
+  Constant g(1.0);
+  DirichletBC bc(V, g, sub_domains, 1);
+
+  // Solution
+  Function u1(V);
+
+  // Linear system
+  std::shared_ptr<Matrix> A(new Matrix);
+  Vector b;
+
+  // Assemble matrix
+  assemble(*A, a);
+  bc.apply(*A);
+
+  // LU solver
+  LUSolver lu(A);
+  lu.parameters["reuse_factorization"] = true;
+
+  // Parameters for time-stepping
+  const double T = 2.0;
+  const double k = 0.05;
+  double t = k;
+
+  // Output file
+  File file("results/temperature.pvd");
+
+  // Time-stepping
+  Progress p("Time-stepping");
+  while (t < T)
+  {
+    // Assemble vector and apply boundary conditions
+    assemble(b, L);
+    bc.apply(b);
+
+    // Solve the linear system (re-use the already factorized matrix A)
+    lu.solve(*u.vector(), b);
+
+    // Save solution in VTK format
+    file << std::pair<const Function*, double>(&u, t);
+
+    // Move to next interval
+    p = t / T;
+    t += k;
+  }
+
+  // Plot solution
+  plot(u);
+  interactive();
+}
diff --git a/demo/undocumented/advection-diffusion/dolfin_fine.xml.gz b/demo/undocumented/advection-diffusion/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/undocumented/advection-diffusion/dolfin_fine_subdomains.xml.gz b/demo/undocumented/advection-diffusion/dolfin_fine_subdomains.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..2a350b80234ffa631d882d23022732043901d2f6
GIT binary patch
literal 42459
zcmeG_dt8)d)@2!968vc`KPy2iG_UNMn-^|r@@-+JpQU0VBdx7=F}x)r$fT6ky5CZ`
z%9<C{F1G0knT07ZBDG5P6SeKr#pLoSk*hewBrwh}^PTgY=b3rmmv`Qof%$&x=Z=5C
z>&)|<=RD^*_j8_?&~;sIVgKy!pP&85k(ZNZUrNhbJ^Hr%V(aeE$M&tgzsp_cf0ucG
z=eI_@oK?L0`K6ZogGc=K=#sEE|33EFE?@p-cJkc6eQanAw_nJ${d~x7TdOypiLup|
z>zmKj#@Mdc8?1Hqh5~y_PE0F&Zcd4@pU<^li)l65YmFI}WPR)982c`Rd9(fc+8Fy!
z&Gzf%_Qo8$CCFgEthXLFSapV00C1?PwLYe`MrS`)Wj~|0n2h%8rped!_VspSjKyeg
z*rm6WR@rUg`s?3@+FA`3SfeJ_){tUoZ8~JImFsQhTzk{e82hz?s@4mk_DgkkOR~WN
z2<7G4uQV=dy>_|4-Wp^!AGKOyYElgLQrJwh-fD`m)#$C~lMNXF(bj0uw|rY=uPN8J
zUeMX=4E6xKO@A%La2~#`8hWvIWNNFuOqW-7{DpG^8}sXXr=D$EQPK2P<ja-`iCNhN
z-+n&%ViJ7Q@L5sr=PU0IIv4%U+PwM;``N&^BGVVdJcS=E$URnirpe^|*dY1XB0hdO
zZA{GX%76T6<!fUyqcX>(eKOy8(zL$m4<W(PF)!wrcC#nLOF5=e`fNdt=^Q>~eDVqm
zG|`6(b4=Zv*@uhZ!w2v&I%Y|ZDS|y2mYy+9gr}HUTXY96n?FeVkF4&wx`RXRtE~Qc
zS;nQkbval2L=8{(^vO0dCCae0{KrK#riqfL2>k4)x~btCul8M$acSGB3r7Gjz{jVC
z?Y*`=bL73RVFnw==6e4W!`3Jtc_R1HRgSgIbim@+5`QwpA53{DeP}@L@vXXps^8jA
z!#DGOKG0zP;1G~P`IH8Pn)h={T}@s2(kw>1;An%^)0({Phf}6hPkaclTEsW+oN6C)
z{(|*%)O$zYC=VA;x}oO}B~N8ow50syMELomd>8r^W&t7Rs&kt7T6d5mw8l8=NbvBQ
zdvgHCP(h3*oB3Qgg~mI?G0i(z&Ng8WxoZBv63Guwe2QDk<p44+MFWZtuSjV5>U7be
zFhC2Rt(&fz2>+VePRkG7k{CW(|Dk{rJhAy|2!J4lXnvLL-nbAbnCGCJ&H=tyfIPj@
zaRQdHirL6GmmLHPE{qE>;&};p_MaOq?At0kuuzrQ`=#1uA|W1s!IuuEFmf~;)9@7d
zP&j+>wG&dtrQ({RMavgit*2*aY|TA5XKl*S@~rc<!G%$_Zvsy=*jmDuud;6HyQSvt
zMqS;g@Utc6ul`w7lw0%b#(B#Yt_d#Fmu$XRex>?OW43*DPFe0hO8O)Yw0AbHkNGsy
zWG*)jH&k!Hk<l@$b94>U%@0S6E)9$uAA8T>yZ&=k-}nFUwRzx{;I4mp{E679gHKO=
z=g(j7e)sEHzgRY9#o)ZvgOiOt&W?NH<Hw(l-8p#bwA2mLQq#631%&Ns{CH2}fA?87
zrDAZe8SfnY{l#h9^A@i<9G8D|t1fJM<-YvPo-?~PwY1*3X~Ud=I#br8;ZvUN3dr_-
z{cK!*=EGO|{XBhj-!0|(^`=f`Fk;^5pz*JUoh|9p?YBJ>X<QSI+Y-><(Cf;gd0p}o
zwjb^VTP%<5e*}J8p9`o;k2QDdyAhxVN3;MYJ)a#~5@-)R5;*>kVP|W`mIjW0hyVT)
z0$$ehAbj6^$CZBX&s-gK_0B~b=VV0~zW%iE`J{mUCwpD_$<n9Su#&(N3qxLyn+PkX
zM|ar)z~`MEH~+KSBSss}mRyeb#j>6&V9Xf+mW^ZcGp8&dWEW1%KRT-O>0u=yDH(Ss
zr>1P(QHj{rjq7p%CYPr6yk|I!Z%DXn1pW?R)=>ZIM#F)A`o*_Khra%2TrV>Cjcxe*
zO1}qZ17&Kyc<34Yt-DfvsOoaRD@cUL4<&4`C$Ps35!i0wgz_<*x+P$TiN1ckh)^y7
z6yHwkx~yepKtz|Xa^|eH0O~u#0n0U40OPIwt&3MR($xMoPS)1%U$gO#ZtV?wi0E?n
zpXq?Q3}AG8_LpqyZ)eih?|+i8f9Od(`{$D?XV3fb2x1pF{vMoAx%suRFvPU3Z+i2m
zft`MZbg=as`5bHxDBl~GD39H77yKToe`mVw!M|E3J-d8(w<28h?6}AOc6-|Q=4m5;
zIA1>YqrVZ@(Fk_iy73YC`$Xp3S%k=HMC3}p33D0b9S;!lgEkTJlVI>nTeQX8_s*vL
zC4dh+fJoTQ)pxHL0XWsAG<1uCv2~`1<!@|5P}VP&{aA)8>Rw)pADGO>b%{F$0@(D7
zfV`9IVby3u<_sDWIDYbgvlmX}tr(F!^Xxe3XUz})%rU~LKu%l*cE-l!#sm>a{&}6L
zJeEL%q`;y_x9%9YgwO$zK{)05XpSHMASr<1qyP-m2ZWIA+3xZ)0pF$rrrq1VIkcpk
z2107{kW4mCCI*Pfu_|^RAp;`D2rS#cqPiJTn+k@q&!TK;eZ9t!2*y;)TomxAO+y%r
znn)SN)i)?6qZASw5wV-+?q!67GsFk6alQ(2uqyG>dedMNotYR_hlif_eV-L0q+BCE
zq&7=v;Sbv8yY;EZLFXa&o$DcGE$xkR+Sf#_AU@O&Uy%trU%NFkDn0r8?TpK9k<0Nj
z6qUkp$W3NzU?qK(5s=Jw2m&yQ092LSOC&Q^_aK2P7hlB$v001e{a8kjJ>b<gWDqoD
z@{<+u*yJDX@Orm07+eNXyG;IJSa-QxdPF=KI7A6Gz{&MrFj~nZPkT2GZ6I3}bo91w
zh?Fv+bH{tCf)D)riWmH=0z+(pX(YxLXvAG>HrZa#RJL6{>Z<kQfu@abFiqE<ZM8&P
zl0fYsW?WXwjn#dDe?yi9GWAZDAy8NbZV37o;$edu7FcX<HM{y2q(ztuqY_UBNS%Up
zrn-^{4a(+%tV*UcRi`yx`y{|=aM~p%S8O}NKxt3b-~guPQkZUV0i#^Hvbqd#zG*rD
z{CibG!ZyspG%NEt@LaTHuY=^0?U-paMn3dMqb#eXwnL^JG`A-cEjn4*sdzM5K@ulw
z9Z<I5=Y#^)rT&s3Gf3$B0HN=16Asj^TufSC<7OlMQHPjB*2=#n-e;#lfV`nsv_6DD
z%TAiHNr)Dkc&_A8nV8r%)P>Xw`Do`Jg-g<g<06>}?!d9qREU25SypHXyjw-pU`W+e
z`5IHqrLU@DBKKsOv}0JY?Hl3-g}(QmpKrJW0K<Tc8g=D9764>|D^8!VAZ>GbMYM2@
zV!VG4M*?n*jDEoA)^>6slLo@c2fU(0%mbcKSI0LjS{NHa)<Y663B9aPt#Zy+>=H$Q
z!Zs7rcV6fT^=N`g7HZ-4V59K6m`rsPEz}Jk_G#=2x;`i(AgyJro<*7v8)W$AA+@15
zI$)?v2CC?$c2E?JVS3wmxIGlT@zKJJk@0~J#vmBSm?=v4UUe(vMMC`(Dp7zs+bhIM
z>Ig=Y!zy?A&=t3=l<7_nR1_1gTs7g+in<k2h4HZ!T|Wq((J0Je5i|S5@l`t?Bu-Me
zmMiUf1jP=vgMKPMU*^}e8!c2LKOA~dCm}vlPo3Kx)yo*7?LH}!+D_j|Wv}h#Wu`)c
zeW=+wDC<02@(o(x6OC%)CE+K`UFygK#Rp88u;5$f`nOw^6Gq;|9;#}^j~3?p-NoKQ
z)!)q20zW7*W89Pvt4sg8b9hBvL4I|t#d?qJa9tgH>IYB3pWtT$;ORH)X(&9Uu%{95
zw2M8BhNm;^DH@&v_Th{P@H7gZW=-$4_~Fh$6+O3@S3Murf6UVjJBJPF`rW40!3$<S
z(WU&Z!uiMJ#;1MA1~xtnSnSK5vVG9<QyVwD-epqBy3hAKxO9HE#QiWe_UVT0J%07>
z>VO5uPFWA{%kKF;4I4ni=Dxs&?Rb(_SoAJi;m2=jg`Kp*;9s*9dVV};`N=iUOe)EI
z<jWT`=FEKJ*mpGS6B@RYhMoK?t+13<`1?zQ$Q)Xs$7Z&|v9otY&VTIKht=cmo%%>j
z{+<WFe3=lLN5h_=VINh{3TJ7BibohCZx_%CM`(o!uXGF9-+u{ibjRk<`02f-jv|U2
zqG8oEY-BPal13}k(h6@@(F%52q1R}ndI@gy&J#gHhji_~h2cBDhK2?1Vl@B#Xrjnh
zw8HSGO6<R}oS6k{pN4N{!14W)k2r>)COic+o3NPC>>>dgM1Y<f!vLK;PJre<#SZV8
zC4}l0LbaZ7I97)=dvq7jtk+ni*@UG;v-fD&psftmk1o*)Q)q>E#}duHqZRhi3SYj8
zG|NMpt=ft->lHyX`v(m>NyGLpBSZ>lg|BFZH?PtPDYU}rh|ZyBiXTrKSbd@5*6@n_
zZ1yAg1>^07^Go9r-!JOju(QXI)OVVmI=t?YJr`puB0L$eFZ*<5*X1WSHl3ge^nc*+
zKOvmY_q@M9r4w@a2MB)HkU{lZUqj(ws~(Sw18hKwrn0sCp!~G@zhH*^>>0pr=?M|l
zvG-0Nfj=4tGd7Gb+s!DR6qbifd}_^xLdKA82N1^wRh+K;LWP6d!TkR^P(Ac-n28!{
zLg_7D^V|sbG>M?MgG^{Zg}U*Ba;H!8vqvfUegNnD&7AL(1>Zk`iWvA_dw_)R*#x=f
zZpVQ#{<^tA<yAx&Dv!v_;_*rMs~N)DN-e7yumBD-a=zh3W8oPZR~q!Fni&nB-q>11
zmNsX%s>Kxxm43GojCAJb`%_+Fe4w>_@PaWDRdwCKy)^ezwDckSb)ThFzC?z-W&rag
zls>@Z1o8!huIP>089Zh2dnS1Ui#MVNk=eAn>BPC+!x-P16Qqv9sf<sujd>jUUd3<j
zaV%bcOzLBR|1(kH|D>?R4e@2o<Pk00ScpSV7KXD$M^CI|`1Y8bU?gez^x|yp8_{Ii
z?YLPL5z_z1-g_cj_J1KPjupiBr88-%`rsj{sogp4UPLU$S*E4c)fdt3TM{@%YKmHD
zMx_ka4wZOZk@F{})zPl_VOqY5ORVC|`Nb1+HN3Rifp5utxrOV|lWeo;Stpo+c7=xE
zAu)<Ejc^aQw|-n?3Q=XkhTEnvk~b7{+RNl=-RE04=7Oi#p-YhCJSArFWo5*{SdAE5
zAV)6jBhPfcisz0lE}c7ZW*gsDws!2S=p5G`a6tWx`mN3RL{QGUA;kuE&cFrcM9wSC
z3a%Dho{>##T|3|%h9rtGm%UQj<ADMavT3)HaMj6<rD@%UbW7}fx!lQjzotAa6t>-R
zVA<iLc}<To>VsxEZ+tL_O#`Ow&*dYUg$}LHg;l*&8g~Z-6Px=f#>AJcWd^4vVlRCI
z@|I$_l}%))&Nm!1>Ma^K)ciIJL$)v^z%wIkFmh&8#SPfkPoThI6z9xWdNIj}OmJ$-
zwX(otZSI3if>CiKkrY{n3}UKSXv&;4PI?FqnX=(W5VF@v;zWeshFt(?vi=tGAER^9
zQ92yXY~z=5Z>25UHwA2GJD1_>Qs-&}SB$j^V)*fMGqYUB4@;pz*EDnbstVoCVYy7@
zGc6P~RLx{Lb|@rE3o|+vP(j2v-l#DJS?HXZEsW~K)U{Bq3Ov$}$_T&a<HN+sjRW3n
zOK!BVk&KsBt!AuJx2Y-}G#t1_=$SwaDDK1`R$}Ho7fA||!eV%^Z6->@mpSBx(96$8
z*>g@MH9*Fd3%HO3t|7dMuv@0Z0fOjyk(6nJ0BI&<Hp;kmXOH@=g!OTzT!SjW(GgPR
zP^GfS-V>D3L~*;vIc}})1FbVrUqKuV<5`)u^@dP#ghTeDO5F}hn(tfcS-7&lYK$vX
z2ihl2S`D$$&X#Z#nVXaruTBh^-PX*(AWx8`BTm)A-i_!3lOwqn)kC@`zKs2tOok&a
zgOud-#;2K8$<NLe%+7Q><eqjh;p8A7DP>kVF*H*l?4IvaoEF-2TB`#)rK!jlv_auU
zcykyZbxW5x*Gx1Wb}o&1T5ia#z+d=T3<oDTho2<Z<)ykLo0_wNxd9bQqqh-F?u8tV
z*ty(+66!_O+d>(j<9A_#)K^fWty{FzCbjY6NMnE{kRFKO7l%SfA1>iYA<xPq0>z&V
zUd++YZcE&s6vloSgyIk5fq1xZrY3S(&<R<<shEe&;j%ze$ugm(O7~sZY-VeTb5gL9
z=Vlreq=`1>`6S`|%k>hAREQ)#5pp78yLTp#L?NdW6RhqzPbu^`GCrNPPZ+=0dmE{y
zE`7pS-~qwr<Q@<v8jza{1UEDN0h%2s%8Wy@Fb*R6Mi5w~sA2*^L_!fS*3vwl9|zm1
zmg}fS9>p1QfoJ-aZO}I&L?rQv2oVu|B0_X>J`o{0YoCaalsnXQx%!zYG`de1Yh^}Q
zo?&~@(+x@WtAp!JLuNMYgpc&qK74}ea{X2)63;hck@#dKRRNoL6)=VBjDP`_p<y8I
zeZG;ZfN8r}Nwk6rh&c7+8km^*$o>>8c)A`2M(=fZD?q^$;E%hvA_5DZ`@KX&zCy_U
z9k7G#J?dG(Q-ZI280usksJT^pXuZxj2lj>t)&+R56Ex=I+tP}!jnsmQ?2aPSZCb;C
z6WtR5sRdQ+la<&z;C3g-u&&P=sdWRgMS6nee$ek(F9l$U8B#--_o>=&kR?aJOyHLo
z9<1Y5A)Gruh3W%zdoEf+Ut@)9QfbbzGbB}I85fUK-sp)`^>#W{3BEI<eo$b(Jvat5
z#5V-3YFA2&m*}4b%kq4l`xcJ89k4joR^|L}h?~uwpVST9E21P7)u~xChV}rmoQUBJ
z5k9ys;d*`uzH_X2g~#*QP2F@e*6?HX|MCQ(lW4sx_yy&iSMbX{b6FTLi97eBxYu9F
z<6<@k;{^2qPDTAaO_*0km27pl6s%2w;Z{jvMV*ouw=O|s)w$5=Kq{(8YDqhc5VcV9
z!s+#c@;t$MqtPlU3~R+$JOgGXmY3IzOXGM|c}QvwHv-xND70j($|iUeYC?I}wt`ob
zYhRS{o-@@;>v~|R9cE3n*n%MxE0lt(td>l4QBzT~s(w(OTh1GeR%<q}(x<e=G>9vC
zR_?`Yz9@%@Vwal%PG6rUc*Lq&=@Sea{Gi;mkNL^YqEdC&LZ(YGO&O}x_wH)FaTy}W
z6=HxO+SYs_r|zqIIh5Xg$o3sB5fWw5bdv&5(A0Y|$B2lC=o1q}`pOHtrS3nnOtbgN
z2{i@AGR;hTdSw1p?KDS{6>B=oSn*|(LAlFXtK~&q=!${vM}F5JS1`Dvwy9r#m~{;C
znlSh)#RlrbgI=S*f=2;eO&|bT#WomN#Hqm>fRyz(_bohXPRKg!G0LOUZ_^dTyMuye
z0LMWm1-3qXM(j*|amrHQMp>6+;{MvVsPkOZL`A)pDyN>7rA3`p(at7-v0X`uzr3OW
zf!H}c^~+(;mS#UmW8V8TOEjtRHYjl>*sNybj-|rERFAb19j$A87RoG9Fgdvwa}->t
zfn+1e(6$2<(24#!QHqtfHaSTsNDbS*HjJ8>M6;LZ2NRtw>ZfsvAD#pxZ>p3pDaM_0
z1I}3%j?P$5Ra|Hl)sbur+{+)RcD(M9En%)|#&H?cv@PaJN@SjAG1oX2bUb{@OU_(9
zOPVr|e<#<gF62#~^*cV<Wm}$*6~V_mZjd$a1TRSaA9-?1^a-=*5ZQ+)<`6N>=tCwO
z3KnHWAVxZni|}OLA(+5#D=B|#_BbIZ-jG>T(o8jR<v!%u1nfz)Z}<~KUeH;PPAD{L
zsP=iUkGwcuwTNXU+hJf(K;*C#EwQR<RxBjsG%3u0DL-f&%F@**Q|M5~tH5hM<ppFA
z<}}e(L}MPCR*jk@yrN;iF&9N<XtH6=WiYOaq)mY1K3<P`Wdw|?AP`Fz11BdiBzF#D
zJ7nDov^sZMK&)t{TwpwDK66`5=G$<X7-e&*l>eFa1P2SMENcElc!i>uS!h7D!4kyM
z(|*Hft?i;|o&L#;?<!M+T&Q~K4n*q(?+;nKNG1D$E~M<>TsS_3U8&$CcE=@9-VDn6
zk(*fiy@SN+`*cApnKolOrK2hAmBoV>S~^38FX*M<^p+RxhwEmrYshhM4cV7ZGaH+_
z-}E)f8?{u8m0(trXZM-i7VkBS;n*PH<B~Vt>j78MbqQLt4v&^rt>qwc<bBvM;n7^>
zj+4T$TrA14Zebr_1nr`JOf#GVEY_;q&8v889@U<mPSkK_BD~SxU@oX)m}}qM5Beb3
zg(!!^yhQaflt+m^S>rV-JF1s+tJVGh_1_3o%}U;6&~Bo!)H|J_!a)`0#Jh4uhtH61
zElc=+&qXim$j}l)uC=%b&0T)rFbYq-Ar|;%vbz>eN#Yj-HLSWT??h&I(UjiYpx9l<
zyya?*y%-)OQy^6+A`wp_5U6aby7OATnR)>Sm4)|Qp{hT90xBsiS+4#?(HL*31*Cgf
zS?1+xNpehH5w00ZrD+kZcp(`W7Ew7{#?I==LTyR7`9ZZaEKrb*Czas!3~I8Z%9A|4
zPymv2_})mMpsxt8@jCm8ye=n0i-o-2OraPOE=4N~=eZL1gVLfECQdK&bmUrgy&cO0
z-?uwbl*OXXd)~NA(~LnKJ5eV%<vRdC)z%y7POTS0<&rZL$p}py3nGBk3#kaSx4xX8
z9V8(TVkiB-n<Ri1lK)1aN-dm->`e+}=(Jxbpr9+5HhL9B2*q8BnnwG4Y#){=ZzNFs
z0<rXNC2?%2yP`6veHV3UMqnoC{t~gvY^ltF!+3;L4wMV@MQ@NMSj_8yn*M}J;eiUB
zRFKswQn0e5<zCgd1;~U1l~1S#ISkFk$ldi#t=NYgMpuSqq3<q!g@D~Uc3v5#0yXwj
zySa5N*{N2wS;hgHE<BSZmD{tLlSHMbt#Z6E?kTt7uv`x~Og2feGahR)S!%cQBeTJ*
z-NJ3pucEBr+U+-Yu$NI1QEIj^c*I!oW#Qnd$l5JDyf+M8cZw^=ynIZh5?0%3_bp(X
zKJJUn)4K2L)cr`-+~>FH8)n~k_V?po=y4@OpY>m*j~c&D-gsrwqi?VOYTN6wTa}mx
z@Zq&WKPcxLXSCSqCMG+0Mwk?;lf2+Gl==3c|M?XIvv|QNl`x@mPkR7S5;HHJ)I2@N
z=l{z<)!Xy44b~a_Eg^b&k<{UTM|+{sXUX2jCJO<X&(QvohctHfgYv+Fu4}rsq0rt5
z>W2C~v*F_L%CPQ<`}6WH1{W7+!z+W&%xLVc)0M%!<jX_MZ{+38Ex`%aBWGCs_<CGM
z&1H69d1aWP;o63w%TK{HUCZ^jUlh)VY2oP%99>hzyQbmr%4J`bDB*sB>kGGFKE1g~
z3$L>CRfV$HhZmXs<nrK*o%g;wPA>i4mDnwq>$rGa8b^7BH5($i9Y_`J*Wxw;#a{7c
zq8(cV%F<*I230=H1o$x2?r<xwGd%NMgYgpIwLOpVyr)rShZK%JMhEwKVc|4tx)`$r
zN)m_ak&Q>;o=?~+DQq%eV_hP7<Cf^f7QrzNz*u-2qX5VP3%Q{7#o{GMsj^@Pl0=da
zn8mTa3xbyTE;JkCyMS?v?^xm~-?0Q8n=HCj4^$QTBn8i*zwg6DgoHO-q$|`5$nuPs
zPuPlI6t+uW?XLX>Yv6J10nT{%Mk@IEvGP^}VMgO7Jwaam)$i?#f3Twu`>P$ET_SE%
z^%Zqv>LKe`2~wt~{Gc?O-Tk!k+Dh_!!!eTg>av^0_`+S`x(k<`>K^<mvg-llD54+7
zi;mK)gTit2$ng3>d655-r2PG4cUNiz9!7^*8pzVCS3w+vvo5@R;oZ9#;Oz9F3Ep4A
zP{;yCFMd#N-yY+*ujZ$fJ6e^-6=S$xE_rjVj)$!L!sPTuQO=?pXGvjh29U+YP>3eT
zEU<#1J&NT0pfqwLDiNrk?Cz>_NnusM<g(&bGEdmhOK(Bvi}&b)%4KiIbu++OyrKzO
zWkGp-?jp3u;*}qi=dVuj)5;yKr~oTVTV{z~9<KAPB31tYyU7|~=4OC1l}!^oDW7RI
z_Oo1-AC%*-@AzreQD(p@Y)fajYio}`1b<LiQD^l@*_JA9_>y5A{N31&y++x2H#OLY
zuTX}LNngG8I2~Tr;Hx)S`^n|O89Q%Lcbr`I1PhiNrJ0>}7HLJ5*O}P4kqUIq5X4{i
z^(ecBIsBWn?n^aTnXli@B5iz`w6=%-`3+Q{b9Pnx>%Q)i9?rbnO<MPjXD@5EeIa=%
zuKH`9#bsPx-o@7|s$b`ou$L$AZ+4%sV3+*;pj-t1^18mCR-VL_O<B_$n+=w8xwfBj
zVyt#^sIBE(p22o0%WgSSWwYfS*Xvr%cAL%kUX}f-KEraYT;H0}+WQ|%FP^gn1l{t#
D$Qv7;

literal 0
HcmV?d00001

diff --git a/demo/undocumented/advection-diffusion/dolfin_fine_velocity.xml.gz b/demo/undocumented/advection-diffusion/dolfin_fine_velocity.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..9ad54aff3ebf0e7bf514fde3bfe610cc79cb8374
GIT binary patch
literal 375382
zcmV)MK)AmjiwFQA^h!|x1B{eGZi6roMfW*{<pY3c446ca90egTEfqBpkP!9srD>}!
zszHB;nbDK={bq{G<9$$fKh6CZN==c`m-C@$$D!+k+G=4weIH8wx-8dI9Ixvdbw2dX
ze4WNO-z?EMz3B5nsiM1uX4ybhTQ9Ym`ww4gW_J86Zw>9(sXny+QEH>ry&i7<`PKMg
zsD27$)89W^d-c~I|A){Hgir`e5Q`G5cnyal5)nZ*Lm{aMVTR+#BuIWl5l%udoJTGp
zV8U_74H!bQrnsa#mS#AG<xnYsDYB}t?IgO&77tc*H8nX55nW}Iz_ya8t2@G@N20L!
zA|hGY1P+#s{5mj$WY_T7VbNIU@Z~HDYjgN<Sl+INVTin4ZGvAVlPMM+V-}T7VeR?L
z*iXvqzzAXx1fpn5AuPu0zp*rs@BC}PQGDR~eaZXsJ3+JKXIrD$=#4a*^_SBqc9j;}
zEY=4K2HV@0gvDOEiyOhN+ZXnb2;!@PV*R_*hgh(ETH_)6w0^$AWOeHV$wrF}ijAI*
zVX=QW35)f4D=2n!>*V35c=^I2*!p=TDE2OWJ;M{$&-y9OY<i7Dj2(X*6uWc}&*97E
zOENqi^%@)rQvUD9Vh=lcDKVoP1Y#J5PIRbEIVT;6{Z{~f4us_Bv4B-2ua1)+4bN-f
zTyb_O7OTiR?BolAW>Z?+WQCs@7<~E7Yv2i}F393G%R-y{C4Ti<@7)fnG`S#om;JGT
zYglS|-b%}C;di7bHgH)pnlH#zEU_D-mQ9f5b+x<}4_j%0#a}o-v>x*oao3P)y%x6>
zV?K_{tgj)@>*Sqx@w1zEUcR-Lzj$q2sj?LRq0uCTjU!lj+vT&hJjGbzY@7~%$x?IS
z#Ufv(`=rbaP8f(`AlQ=R3&GoeV}ZOvV8o~aBl+g!)$V^O{wcZxvHoIN+s4m_u(<U`
zQ+g;xH<ZH?**n*)ZoNwzWLDD_X4cE>AhLc13KLuY(;%?X6E?`}+ZWQs+SbPb#pb~x
z-8jPzv^a)`tY4P92Cd*nWEWHWEUuSrFK-!tZ8mJl2NZRA%UrZHSzn&sDH8K7aVU1~
zB3T<Yv&}IN7qhsS7h7>Y(&Aw3l>e7{@DzUe{ZMK~IS_*&5Ixau1V!Zj7hBQ~YudmL
zJ;0O@P?+aGnZyR8LNxJ$RuD-@1I{jEJmx>Z51E*d&4Nf=y^N0>#My|8=QoCATtJu!
zCF6oh0(S9MiYXb7f=bNEte|2s$HY|<P}U1?0Pf=bv~O?LNSo@=?mO)sh7NND)#X!H
zmg<t>!+{K4wr%EZ_2cDmAT<|WSHSH3%GT!HwR_ja&$olKxv+^34^x%fkS_g|2`Qvl
zPOG3@AJ1jpk@~!-3gON;Tz-a2IBuka&mjpe<Y5&`;>sE-Y=s&o+$N%tJWRtU;u!6b
z7Gg<!JiL2iyhr0lsktRt2*N;gO9^@Je`AyTV;LN%#BZxbY_PiyeeYcW-|G9}0{Cp8
za!EIXV@!5#Q2oE}h4Jw~<pNFmemPS<@7v`}`LNHl@XYyekk;f<Ec<r3kiNlD(=+PB
z!9Vf>`vm*-=|cN-pi*|{+&RMxh|-M^@`RiB+U*LL-I)!8*|Q!l&$;>t4_4a?3;u+8
zIV(f9Np!}KaQ`qAYRyC{sG8#bd&FldWYEO4gd!3Ub4VMQMpjhXr=q{Yw1gsFsb&J<
ziwxG&@t(W;A5Tjt5{V!a<HbvfKEi!uh%fG#!V1Kcl9u7c(-nKl(19yTE+X^HZfWB%
z$}9H3<%1EQ8-x!I-Ky7kMQK?G_Rt(>=pKv*t}W|KLNj5JS*R1>{^IK&lJrNp86;N_
zf<W|2fFOAPi{(ug`9YJaaWy*%k#4%x`S(d|$5{<e5eh4O4gkl+h)V4ec1_cT6Ru@G
z_P}-_VYA_E35sy0`=G?9l((DL!3}2tTO}BSY!a5(H!t7cee18g(eLX-^n5-fHl~~k
zHZI~en3-85u|e4+>pgJTMc{5fWT3)DF*Pe`m`%**`?vnuFIESuUm??x^SF<F>n@Ho
zvf<7GDu;Ppuwm{$9R5M+dohp=cm|_`jKLI&^>FYZ`QHPi8uCn5QVj(mQlpMy<c0Jo
z?R_D^Y{M;)@;Kb1y?^kd)u1ObsQ_JExUqte_915%1Xm4wQi9EM$2~HQz)2qe%Dj)<
zrW`plk6<?HJ$*;DU5w?5tr$!op*alA_M!IA-S7Lr4SnK|iJoQ?E`mDuxoqqG(`l{j
zIg>Q&KvZQsL^}7`JoO^&hC#u&q5+pBVlYSShgcW?TXY15BLwMXdRlx#_QmsjT@8L{
zH8oT~j55~)B!1yGS3_S-*6I#*#`uGkJuWh~E-uj7A^z-~yPl_cy_3Hvx1t*hKoGVP
zpn&YZ*p>HjFW}`O3lM{pwkZDwt^zYqQ411t8Kco%{bE3TQK08)Cx5l?oRNV?8untK
zT0*OGB{>-v#>&Nd8(M3ym{XZAD<Rzsfakie$>tfP!YiesS$c+!WoB347@W8c-VC@)
zm94M{OubpG_y6V`9e231gFKUjNas|2e<Ttr$U8ZJO_hvx&#9FAhyVAz9csv9<Q6&&
zH-~HNsqpvjenQpStsFeU-l00aQv3H;)nI|E3eIftsg5`F7ra<c#5+8M3hoT7!Ken$
z32(Z*J_8$MSgTubc$=f(Q`B28H5ugBia-XOp{>YG$hDWlAPWU@P??}Vm_(F?@VZ9`
z@0(q8s=du~g7=}leIL^6)9)a1#hiR>m_ZprW@*QqyuW`4SDS|vgyj$+cd#$hblw%c
zaK#)*4hCc&FmxW<`p(*5Gf}GW27o!G6$C}jRl207_rUdyX$9}kYmJAR_uHEsxK2|d
zNqM95tZbT>MSq{M2{)mMex_hLm@?=!zaCfqetrF++zhT52tg>=lA?n4-&ls60_K1X
zus-C=A6EZIj!u)-iSk$)X;@TruDAVAZ^>w~LEb@NrnYt;*=0TijxN(UJ4C0tJUErF
zM*7f}`iYz{a8?s)9+)A$j$^I2Xpt7vOsNeZ?>iCOn$=hTHzv{}Gz~Bjl3Gg!o-o(k
zY!8utruuB3*f9eY+<BXh{B~^D<3`LQ4ft(X-Bsu|AXC#r<cN8L?g4%Pip17_dBS>g
zk|@89+r(~S^Vzv6dB{=^o3v-dr6MRb**N4&dk=dTwFliPZO<L@*((EY{T{H$PMW43
zd>oHTboOh>-RvRu3H8>ttS?FX2T1cD=&ipiZ)w>SGpugIr#Sm^vQobsB=LTQ<FvOZ
zs+NQ|A4X=xsYi~J7P4XDcZD_!=bX#t<>8fm6d(Yi2R>EMj9iRsgi{Y3_1ADhbiL*S
zEu;VCCD)(e$_N7VV5W270l<Z8_C4!A9VOnfFkk_q19SYDhh`@*&qFRO{uSF;3;K(C
zZCp0)drP<)IKv(~Vb{bDyNlGv@1?L0CD)SVPzVCABnpD}zu0tVGeH)S3s|ox=pQ6M
zUq0C~_yi(DeTGVm;zb$_r&)OpSOzMt#ROc+lBv-aDpy;8PzT^>lT%7tXyc31>=8TR
z^hThgY1sYFS>BOIbI!6H6*wR5g7TL|Km+krvsMPvPZ%>5lUcX0?-}*fyvU=<8gc^K
zVn-3-9*r93MP4`~1r!8ksy1>%cWU;0fK9L}_zxmnYPQfgxtN+p&zU|B5FZRXaIVOE
zX>>(ip)(^}z%>jGyh8zt^FAOpu4Uw57y|m^`o9D?yYaB(-MlD+A&4v!v9jrI{6ClF
z$>Zf1gAijzc8am~#uu;efPtphn4~jexEzBuVirqd7oW{325v>jD6-zA@wqu>nFr;a
zpQDQZ>(6hc@cL{Tx-G75z9uRQa=V8^-hYWPEh|nJ=(i0`sC0WZ$+CBfz7AKwL_m1-
zs%-VTMV7|HSJDEnhf;2!k1sDw`hNdA^Wh2zgCGo!hiAXHE7~YTK3f6y2Jbe>8!N1i
zMwz)kO3om;f)E6vS5g$w`(G@NzY6kGk=?8;OQC6+9{*lgey0YQ2JPnR#08=oA_}XH
zcyHV359Pxo`C`xe08*l3Ww1?vOnj=TJrk?K17i{`D_q<9^ro96xvx#%9cdB`D*&az
zAZ)6qbOQJN{`85gXym0XoBOUH^nLc0RMU6ti53<zxi44Im(FGTmUs&R5vv?qB$erP
zIf`5}Mj?Kqf#v9A)#c*6o-Df+{``<=U{S6T0s+lj@a->pLSe_T$^n<O(6qW|@twf(
z-5n*-z_OfF>6}W@pcPLZY<mwjyV8z+(YpdCnJdjo3$bRwJny~?cS|)IGfQKj_f(GV
zl|DWJyj@CP?Izg;i@R7zIcRiuZCB6WC~vb(<q)EGg;1bwo&opMo?UpY@a|jmuD~i!
zGx(G#gjnw4Y486`O0=#(d(MCb8>i7$O6J`PFV#gs#b*;#V=o?aT1vWt=)a?$IiOgc
zc0R8-`xci9BfQJDV#f}QN1ayzVp-38M~U0E0ygX+Lnm7&I`pPK|G>l#CD)QHK?uTb
z^a=$<?tihD%xZ*L$fCCv)pnZ?k?)mrKY^)Q<s24*Qi&clthSU~q1kVgN9@n<oxf#k
z*#0TFvJME9DVXF~(=tzaXH_Y)!k-R2MFs&+i*mNc!gn(PZ($!uW`>u+mP@Yk9hL6b
z3MyV$&lKd!z}<=tZMYMW%*;XY1w67zNG<H@ePZgogDXP3UqB8MYQ}1HH~g?Wxgvw`
z;b0Y{Z`qrFzZx{}+zJbx+(Ls+vdpb!!%q30vp|cK6Z60^!Qb(e_*|n!7^#^saMUYm
zbv9RO<gX#^!n0o-L9<`n!NxrY^BN%XJ*MH0LUA*Ayr{&;WTO}#?=TXnl@~i`hM`=b
z_9+e1csEs4Qa1s|y%GQMz40PJ-oy7Up-TGymSauPJ=sW!%8^AHV^>pf69}@Pbr+@S
z4yy-U<AvNI7G9({=JS)TEEeIkM$O4x(XAYj4ubE)>s7_~;i7kl#X&X=NAmjYWO141
z`_x30J3O{k*;YZpdQQn7?e|!SrX&mCDIjg=<S}1qSuy<jyZ<S<g5w5Y5Vn#H#>V?E
z7O9W6z~#;?z$FBOBt*Uhj`s?r3~M@f30^lK_CBvQ8d-b*v(Ul}HmQJ%`4hj#jXo9{
zWA$PL0u$}A>NerN2acNNrhSES-bFH2^+5W2;ON=}?gRuk=0dbon~p{*65DfB0zn2)
zfaM}?lti?#P|6!_8_)d5X_`mWZ3K>@rh$$v=aO*$`6z!2;x_USRZT#zg$f&v*KzL6
zrPg?L(Zk|^$5Q|e4aGh4(y<XWJvlK}8IrrLHeze^%m4nB3DAOS*c9E6kX_XN_kU;8
z=w9LN&Y%c#xZlpq>D}|E(YwNP4Ivw6@!qm6*2X}RWE@-6gwTw)%~d(bX#|cBPSAER
zK`8^U5oZOUF*l-h<&dQF!jEHadbMjde!95613f@jL!p5~N(OH4wj+(!mBY2q8oa?1
zmAw7&#(%P(WG<a!<12{rB(XpgZ~So4uc?mq;*Jh<xU;cxHTXU?<R-f~;H4fB;J}li
zPb0z6vU1cFOiU<?sa2Zr)FVEWol6n~AqYdSr1*pTUu=@zOw-xOb{5u@Hkimm|0Mi7
z=<vgV2!vyT=oZN4{$j8(EH`#Bk{uRd5K!zw1{dzw&oy%>K+0lDS0946?^&4Re5PrH
zuiy>>vpi*BuIv5Cd7}&Ld{93P`OTHcpZ7Pfj}NbcFg6Q1UdJkmaIHLKaB?rqVq>1O
zbq>4TS85+Gd~f-DWlaK)u%Gzs!Xz25!Xpr$Ye71sD^`ER*eu6O7wG+5WL|}H+*^k^
zBl0iifA7Le4_RRnta$*Y=P*(VEB7;zaTS=Or|S`a_Wv^0n{2rqHOHMJ8DIxxuCOWU
zr|@U<Jv;`%OFpbkI2t(?^Hx~4Pe%|u9V9DsEA*>SZBcm8B9kfzU}rz@fUi4BUf)MX
z237FgB8qvK*$CkYh3C7la(TBqB%?RGDR$Q?zujL&F*2wED<91_r4{SNS~9;MID;xk
z3rNlcjDiIgwMd15d)7aOs9Ojap1O(mT7?ZdgDQc*I)o?|0qL$SO!rCR1FDd354I)t
zxkSWU;oY6}qvQ;ZC<s9q+LFk!xcxWw6aNXgKm(5Bh=9B#DuU2^A$5pRR-)yFm(>@5
zXk=9gTO$^)#+?@=e;Qjqjamx4ZD^j6L7aoqv}}K_qLEeEXl}1)g^OBA90S$0MpVVb
zDW2q)m3x&B>_Os49xLmiTggXCjEaX`sSG~CBC2vYEynY1ijvKCkplMzj~ZbWp)tc^
z3PpugwL8|IerWVqS-uERif_str95umpv!$j;NfT%oy)Lxm2yw^8=N23pFAgxNDemN
zwZ2SMBdu~dc{~q@x<hL4D}Zr7d%S6cM^O|CLAN8PQiHp%n$twAkm(bu``v99>p44v
zEuTOzp|xc?!d3PsC+PmPUn8(`E|?&6!9a>G<c<xR@(ip{7S0;zx<BLro(^^#ffcMp
zNzL=TBx`fU)<4}yt1Me&5sf4;&Z8J6eSK0+Bd$VO)Qg9li1D!kR18Y1NUJ>mQJ5e=
zuxt?|_G3A^tz5kz-U#Ybr1%i{VA)7Qli)&6=kyuD9n7QcK5?ZHSNTzPEmsbNFsvnG
zgMt1VTWR)?jK~2ukVibmUrCH)zQ?EIG9nczSCFHMH(tdYbvxQmRK;yHI}q0QN#l)H
zp%)kl+^8*s92Grrp&=Kgl@2d6{I>W0gXI{7r16HUAh+>S5Su#I4{b^-<a|+D;aNEn
zG!)0&ODJ%#aOBseYl-RtmD+xS#F3J+u$d9O3SzG(38hp(8$;*tSy)~!fo4*U$jMvw
zwhmZA6f%;)RoX*|rYjG0ABV`?J^D4iAKoB)axvB6)1j^RJhw@^@JOQ|R+vOdL);Ea
zbl3ammC9H!D<1zBoAk_&=*I^VcyDLHtQd@t$kLt<E9zL=6=JerR#09}4oEvpF@8vw
z?0bev>^EWz@#di=2GtaX=F`HsMj$H`kur9V=*^?$G3LIP{SQH{aA?kg-sYlPAA5v?
z(``YFakIoen&<~I=F}Ybq51pK5aL#7W^`mdTGu8oz2FyuT3IvDBRI=9ILWycEcmjJ
zVDax4&N{evw0Y=(&4MYm(rZy?CI@e*5&Ic6<~^OeoBdICZAT1%AZ#T?K;3__CVsSs
z^g|Z#)Ki{GxM<f?DC9<Mv|lakJ9_AS?B#`7LCgYMPXOd5nKJdn-l2rrBz7|iaHCb$
zQ=Gmt$o;<Vh%_$5vUn4=;ho)blj(gd>aDp#z7;;Uz<upRAsAM;<5*xhfNtbAcp0u4
z%Or)-w!!_8;%~%?Z~o|+`V@sZrV*|}t?up}aU#nWsh;Or*zql|Io&C1hih&bl3$q5
z8{sOj(R=wgY;FeRsTuSxCae*#GD(sXI6fkRM$!T+3>1!ZAe<lRKVDi}I7=2Ad7sN0
z;VR@9AsLa04`TC=L+ynv$Dg-gC-le?`0x~Ljlw|Uh*%*A{YV~Qb=Hwr5;1u<LJ_h;
z7@-}$XJ?5s)c~Zh<(Tv-Y%u}jM%mrW!S}+#v8|xE1wjaali2Vyey8w^*M%fdM|w&;
zUTX<{UD)o9V51H{*WAc0PPLo$UZ2;9Sve%#Zfpdt`Nu64##Tqv3UPz@8xs#hC23Ud
z!m^PPWR%DwX%1nwB|SSUn4d3Z<wM!IB|8j*Fmy|P5bW-MV^?D4wgcn?Hqdb$2c!5%
z{twEd|7_7!%L11?!1X5=n3a#3B-3+;E_tb#jk)l6CWX4$6T~R#XrXNE9v)l4pOuSU
zlsqZca!weTjpgRU{q%!<3BNcuMx3yUUC)$~6>il)T|<FqnyY503nH*y+B~_U^O{OO
z7R;FM>llr-yhC#PWC9w|uJOAS`s<0V57?tCN(^mNRvQeQh|*mbk>ayf*23F(Xw<ko
z2#J%d+8A;OJHjkKX0usPPTAT&Zez^iJ#Opamj&8kU-A>4y7gQ<yrOfH(nMX}1T}Ne
zc)gAF@Cqa;^sa@i(qS5#*v4uLy(ahQV+NDYd`Zl!w<{i9K?{UucPB4RU;=cCiEE75
zAEQs}U^hKS_e4&i4nT<KR!AGM!kvMZb7lgf5mYS!T%qvfm!XT2oS6-2^qQVrp)ZlP
zyp6hy@utJP`pw4T;g$RFj-z2%0i(5|7OQ_f74b>#`rthl$`8%wn!6z$BfWwW!5FYf
zZ}825>-7!fORxM<c1Ae@gCG#S(MAQ--v44dWA<Z#AGko%SPByv9)F$KIrKg>;gZ~)
z=j>_y$-d^jD`bI`$8luOnAGRcR9!odePbv>dh+sU#%+XzcSl1Ge^)8n&PhqF{%ibq
zuFN0ghO5*llT^QS;nt|3-ncSxrb1&Ep3i=COz-ufD-Fh#!Bqi-m(tRml*(yjHS@p+
z8ls`%5ewufBni~W!xm=G51ZU%Nv_Sgyhs(Rmr!%V=L;oN2=p1;T^7!vKKQBLwepd@
zuUs0BSe<De_|y%LYC&VJeIeC^e$`AivegI)4}6es;;m&OMU0(d?P%l6`Gy{?s^6Py
zKg7=_yjuN@y>Eq<ipc>kl;txL`Rmk~jOu+Wo9poi4p@j{o0$Mw|9IZFLL>K~d6&%<
zjmEk9S||0C6(T>CeR<SQ=)m;XS>w{tgH{L@S;mTwLYkGUHA-`EuJE#kO@9KUlhL@|
zFV)Cd*|Zuz_c;r6JmS$gV^4jshq@lfL3nhgXf@Q22dylEP-VTf6lNI;+mP_yxq^Hq
zbA7**UCR{&AqZ<pM-=J5u}!=Idw>S!%})rB1iIr=xD@}1y7W~%aphk8YeZJa&|6b6
zYIWg<XaJa$Eidva7NT4pqc`%i23Z1%f{W5%9QHwyZ%N~hLuIFLGY8#Eu4&@r)kzTI
zxhrQ<A;%}?*fEKVzlK~;Jbi_>cw4EDGy7vRw>t0Q#0rdN2b;lSd<kqfQmJ1S1i*<>
zAL--SiN<QCal28HFv$z1wC}U5RhbRo>Ip38+M>32)0=ao%_>?~hRby*Q=ZrZAs$dA
z_a}H5>lY5=yF+7f4h3~c)b?3@{3?;Xg36AAc?up*bo6iZtO9q%P!urtBT%4nPG7D8
zfjoCb>E9<@;%l3RT~X3D8bc4yU0L{KdoC(>NF_{hV%BA^;>jzlZ{IdC90kq8;@Rk^
zc&inX69EzJJoVt8ywrFX*Sq4<*g&7%-t!la=&F8Q3yX(<*PnSN+Y_l7W{rdAi7OL;
z1f@AwX?*}33C!1ZgA#Zvh(PwXejwmWUh!mgZ%(mbE;i_vu<iR%b}mU4g&+*wl3vBn
z{x{Y+_N0X#;N%UdS6)RTNf_8@mZ-DN2X1b><!1bl4jxl|;u(49-`%_w7}r?Y2qrLN
zC4k+$#IN79m0qk-X%4(rmS@mCH1BS+m7`eJCu7W$a6(XUKcIfcT3ISJ@!KuOT-9QE
zoDb|Q#?S%t5=}|?kAGV}ao(Jj$=HEylvo8c=GQp?T5QERjG?Mk+5X$QiVkBdAK3dm
zXw@gc5$BnZkiYyTVz<YN&@U|JcG`m$N<z!m6?RirbZaO!zN*@9ZH7NQ@^SB%l_}tW
zN6s;k2(MS|q48nGF*dRDsb|z&@1dN32<r$d6^-~<h>cpbk=psVo-KxalB7IwW!yWI
z-4AQ*=$hYA?G6Pm7OlDMVISX@9)mRdY0FnET!W}R|72`8V+Fd3kdcbbrQEhW!7WcW
zvOkoSLvIs4|CWB4#L)fyk>3<IVWlkL1R(^51PVuY-;^KiA+j5lP^xyY&cWu(%^J8c
z4@>O)#r8Kal0Y9F$duZI`LuZxRyO_#s*q_X{7`l!Nf3h|@Jotf^#325Zs!DefYh9=
zDMJLL7gXMX(Ul*3s0FNCPb2D<;D29p2ah1k$FT*ha4Lwpp0dXHbRt$PPrcH<Et3+_
z%gmwDB{ofk9kv;dkD$-xO=(*v@Qw02Y#}QsVTF^%iQgwD5`yy`uR6>MN@KdUD!Mc-
zAJ7T;Ew-qYE!48<mx_PZL+GHeuw%jAk^EuENf@*3Jj7PTNs1vBD5kYYYwr;OQply^
zSg;&V;ABJpNAtme%FmNDRovX1hs4rJilzpj#x9f<PHu%h+CvBwpAUt~uNNZOR-0D_
zbc}15pdO7^$V*OZg@O-*m=)3~L&BT+L6BO&3iZ_cLLc4njh%<kT;5e)hx0)H3o|y<
zvV3{rR=SWuEM{d>JmK&{k4{>l&Fh*c<EsU&AQF(AQTtI|tvxPd3+Ir<tk79~;2fh?
zg?JYRVl49O+HVi<jDognl4~5a=4Kw<uEUwZGT7FhC}ed7PaK(A*ksFv#Y4!o(zix}
zDfQP13)`%>>6p+c8vUc}46YysK_J?aih$|Av1QynERX{<ke8<sfqZ5-chYHT<AV#s
zK@)KT0&8gZ#+F{WmgXJK9uf<&tYv+N=^{l?-#ZVjkjfo|x!l}La68TVzdZKT3duv5
zSAkiw<oO+~`>XK|f__$;LUY#E;bbIF>*5dWMOTQSCxuQEZPe)rV{W{$?{30HY(QUZ
z5fmVjmR<cwdu(M`2vX3LwipD#$K+^Ke{fKL&>Jr;r-#C7j&6;(xr1*45}}E{#j{47
zBy6m3FbA?wu6*zbizd#WMx%iA=!ykQ1Rg;{T~hJSjf6g!1HrQ%|EVltc@eYwqi+gN
z_IDmZT->f{Avr8BPS^Fl^YDsbc<0DkKM(C#gfy<{;1C4$TBvs%x=sfvY}Uh@S6u<s
z4v%2Hb4--Ac<KS!^DBUDERz=`EHW~EEsZq}g`Ubrb8PG@(v*tc&LVqAT1g?fB5+Th
zY5wEXVJY?i3p(@!0Y2z4Yxa4bjl<^&mJMrFJ9m~A?CUO?Y>n#g91s?Ou$UN^4`t_)
zWI+f5!7C{(qW8bpkZ&^qY-HaH!}bGMRO+7jMb8@9X%w(rJS+T=rsK%xy4?S(k%sI9
zLEq{p8!aGyr+&r%;Qd)aql85;Mf=X0&^o@-q3|BXMgfa&Eu?v#Qu}E?rRdRCV@<^B
zrVrS6pAXqQ_8zqy+nC{~V425bE8@ZpktqxF-Zyl#T^S@czxF}3QGDDQe=UI%{63<c
z`=CCT$~UmanHlvfa;e5b=RyP_H8_4>5>dZGo7jNy1fxt#>t}<CtI2!Cz@Ustnm1;Z
znaI1EP@{kaXdTLS^R!nan?N)w^ijS7o(%4pVNH<Z*LM|<MobX&LezK)-l#+rtp%~8
zanMo{0cPTq^>7<UnkD1tJ8>FeBj4)df4|0hIEhQ~ZG8O<tF>(CYwx@Sjmi}dS|?9!
z@<ToBT4ZW$jcC0Bio(_yCNOgHfE$^46t2*@>~le11}^2L*WumVMw4=7t>qE-1OvZ#
zO~?=P@9H^C;uW6*TJZe`&XesVZX@kD8C4=b7h4aC_P^VefBZ+;xnx-kf>3Zv2IFu4
z8*9pb6CeZF0G?yS02Y`3*P22gXvr1zG%lS1#oJ<c_$j3P7F>DJ?$=~iy-vf+fIjS}
zuoZq($(BxT0M#uLiu0rJ?Y!jCBWUsT^NObZK{Y3TQ&@CGgKabph1a$<eTz{clyKaN
zkSftg!6pp9!3DEcJ^GA8qC`PV;#3tqE%|-0)CxsRjiz2*@M{8E9)%qiT2arKw7qVK
z#}@K0T`XTTc48}hxhql0M5Y<!s#d|Hz1Rw>42)Ahgqmx7Kx28+PExZA(~|Tw(|R67
zrSjLjC0AxgzU)HM!nF~KyLr}sSajv32&91^jm$f~`L6;9V$qc@hzB(q=B{*CsMw@W
z#<b`P0-!X&@@j)j?haC`1<Q_I*&3wk!9!L&PFK@K-@Ik9o;{~p<(2#P5%?q_kE6}z
z+k(0}payi(kiHIms)fC9{<maks-%%|N5;hKVC{Svb~<?F(#(*ipIrXaT49%MhKKIj
zRXPH&i2Ulz+qFNw(@q~(3KXlqD*7K~XOILj2m-+`Ni?JR|Hqczy{wP}et=4uU=W*`
z|9|zWM_%CoA}?IfBr==`;|99w111Xm3Ti=MtMs~GY&z^fPFewA!O@wcKh6I>5-?T2
z*wik%LW1CeW{}=`X&$$O$a~qTHE|WWS?dvnFs#=%W?4X{{h*)+3d{e2mI1wbVq1VV
zd-pRL^81JrrM0m7rKxs?rFA3}5X47Fpk+<Ps~%Y4_1(-qAeiIF-xsyUdSY7uH^p=b
z{zLw!(@3Ix^<B=QKP9U6NNl6Bm7e+Ffy0Q9Z<-$U{>~L-!J`B94qYMn2GRt+VO(_8
z(*SQhsdtD)R27r&!ow=h`5(-IYNuGHL3l5D4d)+7OIIv);7z;sihpRhq5vXkt&uB?
zgTMjYG)yYcMF-W-K7r4{TI|I1Y`2CO$nsU0nf*TqtZ38;g8c2^P$<UaTlHSLc8*1K
z%RM<*4bPNh0Ddqtt{r4~+IW5?K30{fsvUKROjnqU<>G$`%(7=AmsJP7wWBPwMCcZB
zRsW&vT#_URK_Gf1OAAWxf3e{?n+7&;0lR_@HNpJY6__Va^&)#F3;vzZ^f#GZV`PJ(
z#uxiXJs8smzqmQyJ+iEzfx|tKWznyXjbrsmQeJd>^>w{iNN)13-6Mo_jP(9rH-S*k
zV;OUzYPy{R25AW&HY(vMWE<lnGL#UI<=~D6R9;aVJK<J7xFD?9=yXob;JsqY;Y52#
zw%L-1Hw{;JUET(Q8JXRwP~PA8!A}DjdKwGoF@qdz8{Sw5t$S?fFNuZ0w{=dou%U}@
zrYS%@;!y*Gg@{Mn(ccZ#UODTsJ|R+1VL>+!sF>eD(wpjAzy04}cLbnBghfD1=1bSN
zT<~47z7+cS4Vlfss`jIe8hfy*|1(bO|IdmpKkI3LSWjRP+;TY`tbtUGPa$;<od))b
zsDW2}cwPjH8P3nfU*|`h%W(01)r26E54F))S%OAr5N0#c&!H8HRE7E*x_S!BM${!T
z>Hpz)$I(J#KTC+Fggz(MKN1v^u8yZOXYmY{kI&@2Ld1%FhcJJXo!gB7AqYiVQW;VE
zZ)`bkvK!z>8kl6zs9f$N_-hra>>ryKE4=1}*xDx5e*tsy{wqSn`gNG-XQp_9ch$HC
z0~S(1K$@1F@RCTI1v60f1eS&x)Q(}co88>W4Rox+@is%7hl$d_dwrqv&Y0mWl;Z@W
zIOZ+ZP50e%M1l2c?_17uSgZ#|c?_-aN?Aq<HhwRM=djpujJL}~kfkFL77AcUaAAQm
zeUQA}l-!J~S8Cw|3%uu>Y}<3|NDA$Gm-DEnur%`E5AntuTmA&!oOjNYdKOFDSYZw#
zO{{O~8dX#KeUzi>hU$Xf`UgW_E}Jfn;0lYk0#E3}F88}>8_5|%c44>qs}K0Y7Vmbb
zD<fH>6_)RW#F&N_L~q1IjyRr$v&d6fP@1%^zbUSouD<=w=v7Z;5xinM$i-1Y3X;Ww
z7QQ?}neBfkm-hO%4E)<}?=|*BmdUu6<iI85p`ZMwe}BPwE(`awmHCc-cV<m9?t1_7
z4A?0uB(Zn+H#2#&7sBS%d$Ev*YL#dJI6st~!4U)@2n18Q)fF}W#E!muIrxACtgS5-
zfuRSchu#-f_~a=jqkfz{Ss#8LqE@E$ye`5{O$!!ueNM!0ogJr@$UIxxPEm^|r?kJ@
z^l!UXsPk9|6F(vBem<TsG=CfQ9V1_%8lpfJPslK-?#v=RVfHq^FBHf^&4wv2i2MOl
zm|wMv<<G(coO*0~*F_*(D6*Wg777+{Fn{9BCyeywFQGM5BI2<L+Jv#+LT^1U9I_>?
z^?`yMyB}Uz;c?gt{g5Ri3x0Ka6xnc^BZLILXMSaowY;7Nf`I-zj>M%4p--4BANoT~
zIl~CO73}j~CMIq|6e7`Eu5I*eVjm~3a<(lXGPLACO|c*w@fltSCa1u~?@sCq9R(_v
zbSOs_atGnEY_h%%6$xlYbW|?<jI-uqNN0xmVL<^OT8H^%1pvtW*xU_n>JC7JywcFN
zl5TO3TmG13I3#vD^XpC_A^v0$qqUp&SRpan+S<dmf=CTuxm`#kg)MPLzK0=>FJ)(P
z1W^bA(UjZ}%|Ef>S#v@D0TY;V{K(pL!$of?{tEMuypL0lY_W&2I#kW}<}7dgfJWqp
zIC=>Qp&19h#eyE`Ky*cU5Vd-2i}`#jB6acscO6>-yT=1oL_NG^?Xx8VeF)A!WcW3|
z0<Rw50%r&^@q9~ZD`I`}h${8?7E1*h+NS0%%#Vf{k?aTan3tFb9M<iiMI|uQ_J`U}
zJ-}t2t)!#eaHt$Zx2QZ^^YY7_u)Z-w-K|TF_0D*(=u1*)(n6Ff?6^k8jQnn-dU%W7
zvKef*&;_e$n9;VG?|W)><A!Rdwc;I??Gl%VCExbc>b1O}b0DrF=lxM&=hJ1q7+M5(
zPto3yhU_05org0!rgvz=3S!fpE@co;&0B>Bw*W2EP36E8d_^~x=Q~l4Zn0x_U_Jsl
zbct+$BmcX;?_%b5U;*%1N1UtumAt?3;1;1O85RN$U)@I;JRffPB1dBR6!gV1lOB=V
zBL6}>x}^^tilAqMmn6h&$#>24g14BRq1)UFONRj~vgP5#|F`#}?2K|42tgovr7EoG
z{V!IYP1*?kz@*>X%|>K^VdlGz%Q%2m5oKipF!hqsdXT`ylSbP@P~L+&$KJSj=U`+h
z_Hm}uf$v1Za&<nqo%|Nh6mu(mHC7o@f~t3+EYe%dASTf>ViKN!fYouLo%EJA6pEe5
zl9ooF>*9Vpxh*KO`p;p8Bf32B>!VI%u#?=<=iCBc{w1D2Qrsw0m!B-bM^?5qJqx2S
zCDUek{gqF43pytb5FH5YiGz)-$63FYPksxdc4~LD)LQJa_j=dN0=Wf4R_!}T_=mhD
zS<k5_y~WWRM6KbskRt*4GYgh_SHJ?p1>-HR{k*Vzko-#N?}CbA5?32MU3-WiE|Vy~
z^&zF53>SR#D5|G!zl@m;PFMZOfm;1)LYLiWx3`p7<?1+x9a_pWDr{h4!UCf80MtV>
zf+?bxelK`@8O7DlvIcG$cf1#PNPb%CU}(E|-LTbwU--lLlcqyv2G)c6q`9o^Wy$`*
zoWG{*?@QEATNG+R$QY)pELNiOz^HyC^iA2BB|!{=K=evRB<TGwHnj5-S*q{?U5O!X
zJQ_B|<r=Cx$+d>Bq1C-seZCk5E?e&(?pSDp;~ac$7LpTnX(+@XCj9~7B<9Z6H*sMs
z;29P6xNl(a<PJKlgPmev7j*YV3C0p0V)t59&t(XkGau}Ax*lidWNQICFXH$FU7Cg%
z(yDOJny6}+&f&5?#wY5cV(8)67m5x>^GEiJJ@^N8*{+;O$qD#p+<ZEN(t7etPSOQP
zCyiac^>*Eb2Mb?)ierOz>S<xy4q)Z;fJd);M$3u2po2QYSA7YZb9lH@>XXsQyAUy&
zW^mJqPFm36vz|8+({X5^jqKRo(Y^bt@cQ5PVO^T_la28DCzknuElwu7^~hwNOr}TM
zgiNKU4--|0Wh#`a)HOyvEKx~ICc~*rw4P-uZ#uXkp^?c*CPQ_NnZ6KRe4#vciR&_w
z#qN)iGd4m1hGF1JA&^+we=!OQ3V5HqfG#J$C0F@`eX4@!KK_1OPBO^uw+#c8XXA`=
z8N^rlHr8p38B7W3JuA<tLU{K;L`~S`TU|}`zH(!P_~uU$!kfDyBzNC|N=I%Eoj7<`
zE`sDb-yw18uECJ23CuiQgyatDRpye;Bg%X+<UL}(7xFQCH{RxhHj=vshm;ZAI~b7<
zw@5B>*_X<hGoyP48(>6tP||K9_t%&=C1zj)Fbu-5mw*<^{(o#27=;HS6udMHRN9O;
zt&4D9xVD%D;eC2vXyeqag$jpmp3r4-;4XC;#@DKJ8OHbKVwz@VY+>;?$jB;=0GH`|
zawJ%PsM}+(_v$hTaMr>X2Keb$Z2JW8!Wsnl-i0&Buii1+x$(Z#!^)A~qX%bjaj@1^
zIDSjN%sYnepdU9KoWF~=AcoSbV;2Lx-(pSNdt3h^gVQ&2Av64M;Awu!%)kgh7=(c<
zi4d>uznBAf&m{}=Z2CZg|6`b6|CRb$uH@_6wOq-sgXYv0jDkjf$5*!z-=O!lIN<yB
z*xY(6&~^!Juis;u;jKVjw!Y=dJ8XRe7c<PRpRCU?y5*xg9NQkhX%4e{`LlYom?59u
zd6sAqD1-R=`<ycjuPQiZ32p(tV&m(}D_)ibU&6V~=S98zUhrFk*f-pM2}o?g{jsKn
z-8*<A-t+n{@uTdFZXgC>7`jU*C|pU>{THj?kM?ZY3q%MaC*;-Ts6i&ZX@nu!Yluv+
z&Oxsy7_x;C1UJ5?e%gewbsYp1!EA=c5XyGxbHE~)?eE{eP#7|IC|zeTX*2Q{gSM^@
z-wJa!osSj9Y*~8VVajH-&IGa<H^?O7YwRsX6?(x>f+~z{AziO=&M<FR=~ScKL@{;Y
z#fYtb`o<LbxWR}5Q`fon5zKZORbaOqw-M`ow44sPuS?p{(A{&qJo#tzR?~p?_4y6s
z>alx{bFMY+Z1ch2_O?Yml%3HH#2^eqS0cbsy#HcHKcgzfUcgEl11XQtqpVvkw;XRo
zd#^tp58CXXbBOUX7RlUlj5AEnQ?wO$|2+1+_16d)maraiZa2QZ3w>6|&BnLv4c*A-
zj^T_!pIePDBP51CC)J=ZjLoPT6oyeB5K?Gt-4IYXbyL@zFuGwh5E7uOppjE?LsucB
z(1?YAmZhuI>xRw&KtSQ#x=QI?y*>t^gsbZ+gmD{*uC2R_M3b6F-V;EL2xA*6gtF*~
zCX7)3dPa>1qo|Spl%3I$1R)4SbGZlrMKu4!j-Ee6w=e<9!5IX1`}Hx(_0@gI%EmHc
zZ!n?w;?K#D)6HK!@MaUFq66%O4qxYV*wpXCR}{2%xN^a$Ou=?eC?nQ~O^H?|1h5R7
zG=V8aI(K_}*r=!_hj7!gFu-EmRV-GIx`|oMM(5!H#9-2u+Q<6+{EBMU?lU)dqDn~h
z-Z9lX^cA(NgA}kfUo!;o2{6F*ThJA?tlD5BMsPeAwV7;!>a+Qh%_YH~woh-!I<F)Y
zS`YcvABDbNi|#*bGS_SLCQxO-Mr5+KKIlNLKAfy_3B1V!8hqC~ku2kp{(W0t@1{>3
z0;~p2a9(p4d#YHM^+tIrgf6OJ#)3$f6LH$^TVUQ8o=t{-qhosWZiSxX7B*s_JrkG}
zysUJxgcy<fHPDLUR9ZlF!1&Opt;1+@I<am`j#w~-90jifpkpb;;~^FC6eA#FyjU4H
zF*^nNp&^T+RGJ^(pndoxGEEA^)5LUJaD;-vif(=qHs}r0RNCq9pR#jFau|ex=#}_N
zaQ};?yRt}0f*G;OPDO0%19rboFL`;|81fKJj7rag_&1-;R+KuCZmOGlKHW8TN6pt*
z%U)+TqfXEQNe_;V$F6W$@o-&??u2V}(Sf^nI0ebyJu6Hdf^LHzq<s|Zv18<iz*d;L
zl>}(zbBAFe0QvH-VYgMLN~PmC(qo`#l*sBh9k1M0JY5l5Md@l<TU7~{BLDr{wz||V
zLMj>^Ec?&O^{=qE_1eVydfU!{LPSG4kF|T)N8Vp9w}+|O2~gX>G&hhB^^0;%?B_23
zdp>>QehX5qbQ29%gx7G>cvt-AoB79cI>wi@hJeV}MT>wM0O$|1p(U#q`t5GkEEMs%
zdVqXAY)hTqwA1>WMhSFQsi8Zxm7naL+_X^rPp1FEG(v2v$9p_%a-7~2dy&n-o>bK`
zHEPuJft`m|R~o}k9*EMMst2#md}K#jK!YqaAQt?RjvHVZ`N)oP*(!%9jHrbu)DlIq
z`Ep?C>IH?CGz;u_v`IVA=Kq_2Ka`z`Z3Qt1L@P>U@JT`GzlF@K^rbb#5pKZpq6Nm+
zo7c#4rTP!4ytCAc$QqS7M_cY*6SF&w>##ygp+*PYB9}@avGkf3V-BV+7`UP3uBUKY
z;`Z%n#tv%2KCW0%P}NA-smLE2+SpUA(@nn5x*A;vTC5Kjp>R&gsE|qrBU(JyX_=aK
z3dZ?mOFpg6NAx4FH>ZOI85c~-g*{@Z)0^`3{32v$q;uD3Or-XpL!rdfyx8uXE~)6>
zIf-3>%FskRI8E5)6sjHt9NMw0+9Pu{Uj?Q^CKQ7GFmxe2v4=y`{G})R=cVn1(B66I
zXjAwFxFJ_~Bo?iXR=!>BKy-X}L((e&32jQ)M$r5bsqH}YLU~;tqG83HBk}pqp-<s(
z{fhVyfwYs!ZWTRq@)wTmeXW3s<ADV)+IDv9D{<BLFl9$XFZ8iPWkro3DmSd}^5?JS
znCK6WvO+GGhb9)h12q3k+}>dH_Dx4kuKFn%6?yUV<pZsDG3|Es2KN)zU&_t^2VxKe
zf?rarMgIS>+qKChLcN0zm_`K`tUGp;u`BV%eCnF)-*@jsd1rRQZN%pgx-E5D?1&G#
zct-#AZaC3aJii-miQ~l@oMT;)S@c4gS%;<6wD=$LYV6G+B86B1A_`e@JHBUpSL%;f
z7KsX2P2BJY07fJ>@zN-^Umnla=U2xXmt$)D>&k$l5poo?SAuA4{!Cn$si~_VdoMv%
zMWO^0SqqGO`f3w2g?*5MGX>!!NFBCHnen!?idE{o;(_{Ig|P==#Am}CR4Avq&@Pc&
zFz-E|m}V1OouC;=X%>T3U$}hX$#|gLdli7A3bipEz?x&mh4sn<N7!tsgclVu5L%;o
zc22w$ti?K*)5w;cH^D-dtN$PPI2oq50i`(*Acz#kjcXVt9`}-5vj2tDkQ$Kv=b|3G
zz|s>V@6bks$fQXw(FdNM``Sr9&d0sOgvc9(&?Y#pIXCbgZxmqU{nB}oF}+Y;M6kM)
z)G`}-zjdBvuJx<;VjzEG@I%?PAWIB_uq*jNl>1+7lXm9K1GYQm0**z+fNApg{8ky-
zN{ol6VS-?}C~^<#1fv#nmLPslnz^;X{wqjR^$a-(`FO``Qr?r4di(Vww-i3y^X1M4
znnewC9p9L0b|KYt@dscwLC)PaD6p3Ts)eKF*&MW2qpB=&uOxTTeku#)oAK=AAd$;W
zcT9qddlX_E9>Qp1XKey;(Y`%xu1b{sOBj}HD{i2J`7TMc&t90ad1ed3fF)!rxn*X{
zDI}Rl=n%W@@z||Sjp|bfvgdQmLCg70s|%wl@JJ?-g(>@&Fp`FFIxa^Fl{|7`D|=1{
z01r_b3TRn6M#3iV`3@M_9lygJOzWXdf8cbp75;T30m*wthyn`<%Ccs$Uo|TE%*&J0
zSOrDy+NgJ0mc#$brFz^MUL+DpUG)epauybGyqNRj$iW?;U+~iSEHEt_msX--!FK>S
zZ!Dv$_BtsUSpiRZ2FO&MY6K5Jn6fgptbnFwxao*lanobRVbY2E^kw7^W!IJjF$lu0
zq~fF8|6-eTe~P%B%>^813Iv)+e&2ahfzXM#6;wG4b2+z*0Dn;iGU&!sILaWg`$)7)
z6&m6w1HshI-wTWEe0R^<K;`6+f%HW$W8H?w2Mv#Pp=#L6Q#zr>Z^DmCMqt^!u-CJ+
zMu8=J+lwMxaATm!<#V1zWToY<N<HW=4@RpC=frK}l&Vd`?YQ68GDEJM+%|C%--*l%
zRiL*_L06$-MOjBDG;-<qMT@P3IA%grZX3rNITGLl>I=$b%6=2Fe-m~rnx;;^K)Kez
zF|;a?FgKm8quVp!4L~A$=q#biMsWwaUW{qeX;3>4UiCwmf#S+>-WS-*nDf(}M^TQB
z?IbNd(R2WZftE8*142cJTgS<7&_Rb=^j8kLBAi<{|6APoHvJ*Jk)d7qfKdlBYNcT>
zkc{4wiPmiYzfk&Gu0Io{(X)4O+qNG_UM1+F48$kf26uiv_bl0Qp%g!5ARo%E7|DSU
zhJ6VZjN$(uJBccY>`m0A@-VEi1yU?TMpGX^A+aiPiLTh_LI2D(NCTnEfN@lu!m>tX
z<QG@BVbq>a#Yd%$ZajcAJ!r~vorrX@U>yb+vjvU*fH3++q8b@6PFoFJ+{pHg%xu?U
zjZ62a=jRUw?p*L}OEF_ODJ$X+#?5WoOhQiWd5w$^@yCO!6+-q&+t@FEwj2gD7xf3N
zgeR&35F`C^v^x)@nvIi6L&%bJWUsV7yk6j*VxZBXtU%2<d(u)EziugYTgKJxb11{+
zNpP`3pWB*eBDVNJGxr*Mo@{WSe|DUnNrBL{XlF;3Xu0_IORvyH`O2;3GLl*ZBikP>
zJME89igR`4#+}erjIyyG0G>z{8m3(wb{YWgefmQ)AeAUY05E|9lgW&Np$FP|g%N?s
zq`5S(TA}kywvs=n`d-(3l5sc=Y{aNUordW*gKad<ROJ<C@V7E^V|ks4WgseVWczCr
zA>Q^8C>y&!8KJwnJtY1pyS5|-LJ)Q(K~cQ_#hSEV!a7|pz+kt$19|=QFnhzhxdz1p
zSAD6z0FK_Y_AuDy){P+*fsG;ANzJ|~1+Beygzc)L1~L`n(3srDR5Jgi3c=V<3tJu0
zc#SV9&fK~a_PHW@1kw0jbC9(SK0EOnk5-rfowq9*Nu3aWNJr&nDQa4wqzx#MHI#W2
zTXEb!N^oDRM4$6~MPqIFMa@DyXL^Ypui(!-vbGtDWkJHKoqLG-LiAPZ)AG2|Gm&3<
zr>mQ(|0{(b<bI#N(na2Zqg(oF#KE)Q+Y(;A(%ZRTt$)0)dKD9*7?QhAqCQcGNe*VT
zLgF7#CB&o?H@7=Y*t6(@(+Qvw4pt^&uM_a&c{nD8xlKTo5JYHPcvMtbZO1QWg$TJ<
z>0aek!NA0Z!i11P5^d|ll%|px1rW)A!PuT`$qTV)`v2`0r6oW}$csgc4l4KGf<;Ue
zdqH#{WJ8hStlI_ISnkH_`&(o3q3qg@EeJtaOQML-e`7b<zlF1RqyYvQ9zlahB9SPd
zG(@9eQ`+Q8^rzN|Mj}t{;;1LL0heC@!Wvp9HWz@{;=GkRy0=sA5gYxFj65VWgR?h^
zYB8ql$`cz6wJi^Z`190;a!<~6p_1JHWGXUFHc7y<p|Am{48PL*(<bkDlwesy?R4jO
zQl%buOp<^lz$!m<Sc^N*XPuQ94Yehay7<~)Wap7AT+01@yD5^W{&NsNh|mE`AKOSF
z^3TU-4edVpl8u{9ku(>hLBbP@$0{$l%Nu7*@nuLjJDejD%x86e<uqic_)_wTP}Km^
z9gY>HW$jos^CjU*2wS!7yDX!PhR&&L<K-?A{5e6=isy}{yODs?zI#9lU{Pq!)yjas
zVHY9rCHqY(8So7*VV7g%)&8g(4NK3&?LWG>+jR$^$v)-DOdF6_W@_bB*uC3E<2Bd5
zQ2JBwyVxO{Ln<HnBQ*2AbxK39zV8vq9|aCv_IO@ql{BpU#Ni)h*OtRT2m-IPJk;g>
z7wgP6X}S;-`Dyw^tW_9r27Y$g8qYZ~ouhPb&3T14yqM<l<WgE(*pe7_qMz7We%B@k
zB0h3Y01FR(%hyn~VLFv2=bEe+Ijf(gBg3@Lq9aA2Z!15bO{Dr!C7X@^(6X2fM~=N@
z<hg@2cs5v`@}`zt4t(WK)+^GdDuZ!tU`|Vy@L}&T56Aht?L->6U37XWaMFs!+$mnM
z16kMBZ~~lsjH0xa<;6J)joTUsXg|)O(G6TAH5K9E0+OP)=SXNhS>g7_ugnJzAU|ZI
z2q8M7I^;$iN%QXEM`a<6hFb`7YvN!>wx&z?3qSz1KuW)Waq|Jq>OgO8P{PHpA}1l=
zgo!^tN}sF-<3{`~832OEy*4LJf|-A|+{h9B$4NXzTwgcBo*Q6>m&D&Y@W?I0I=Fmz
zdm&9CJEBhRu^&4Tojo0`smoh4GmB=}P6i$k?n?_t!O#22ilnjjz)}eHb`f(AEn#Au
z%eqC<V0$VV$rIv)^bciMa0EdJ!dlW55c_ZJlAHSg>&(%B>!?70kmZDODO0VEA)FXD
zfz-_4(Z!Z)$vRgDQt8OqGF*<59M0BDX`xCdP-w=O&ZaCZ*hDE<v9q^qIQ08}FB-oa
z$1=&HL`4Bp;BGnJQ($nzq>{o29U~$b2Qrbrj&bH6^G?^bH8-IKKS1UYr!VppU<09P
zPVR75LUyBK|Lgf<Ch5BJy=p0)dk<!|CI>K(**<u;r=S||>@QNeCQG0QH*6GpiN3E}
zzO5YPM7AKKpb!k@v8BvRNvC`eStf>ut8C#=QuC#2-YFnNmWeNFEa-SBqb8%MGB%n|
zGxALQ80i$SHYWcslI#sHX=yg#Y``3)!<jD~2yHw%OUz^y*^C!HPwf)OX@G^uGC@K?
zlF)a{MAey6F&g+k>Wm<bm2Irku)gZWtxM;eJxYP{_KYp6O%<A~LNq(4apF0{{{UQ@
z!?eAO;Wn7tGxAFilGmDNP{NRUQblC66Nn<eggxs6M2!p%`~F4!4`pYT<1h@v&>Iz2
z<VC*!#Y$#=B5MMa$bXZ1)AmF^M?;vwtVj|h^cu-yro`f>Uw)gxjGQ2nMTBub3#PxI
zULl-FnK@x681JBOhz0tY4DLg)OY0z-=_Ll%TO*QHyF-;Pe!rqmD9TyZBr(4W(;Z_P
z`;?C{p{{C~H=zf?KH(McTzhE}z62`5)?x5SQj&;`{!f0ulnimEO~$5ir34U;o?V<1
zS88-wk%W3Oi_Pw&uA`dLAvl5=KZ%87m@E?h_o%_QD>b7`p9E94hy-Eq@CGZRp_ru%
zpG2E?$z`wutSU|lw;(g(N~>-LD-sAZ<DwCn=L`xNl+2#M1L6f}6u#wfm)3+S?7&Q(
zu-Wj2B-S-ZgPxG7QohaL3Cjf=K@uT^X<pm3gguzK6Zf&<&$8^XnO!U@)xtMtDU;;`
z4nbgfz@ukZ<B2N@Gni2nLQWJ6-B^6rE{T&VAjp>0O$LI|4$reu;K@(pF@?STWK-;e
zW#%wP*dWy6_yI_NJB%`yLf@+Y2}Mzo<Qd$4DZ7Fsh(Qqcr4_N*|9@-~dy2F(vJY?=
zR!e{oo|SkNM=0LJqnU2ZzX+BSk}XiNo3c^}2RW($3=3SIB!;6>n^LJ0ytzes=QKDk
z#@+?1RI-(*(tT+L4$`tn71+HIg<M2=D!vx=3^z)nS{^Jp*F<gh+s1cR|La<CHqWDZ
zp(tufQ?Xd`-rNHmJu8QMc;V!2hOU#kh1=oXUNW=N$r1u%EbQHb5v6$wfra{wDMy79
zOp~CKVeqBE<Q1D$mK<5#J-e^Y-IeBvy)d_JN>Jh6+3Ok8bkDkduS<14PgbQ9mdOEP
z;b!(HvdtAgZ*LHPp&NdK?A!y<i%*L+0J5XY?eLQ_HSNIOuXB}^GN{Cjkj+g4eMA<n
zJO9p^(o#6n^qV7)w*w|70$M-UNNv`1#l|30Zg4RG;C|YKF$%Q+Q!x~n+Squ-8+=&t
z;^kSfSOF;hA@iH8x!Z9Ie2*rD`=$gIcp<2f7t}(Tx&BmWGMds?029p^0+FZAy(m&3
zCz~=?@F7CryXb|O?N8aY;4l<|uq!=L1nz&aQI{+M_7b_kn_+%RTkEb^d^83e=@#64
zRQRlQKnKgD$bITFKwH?BarO0xg6uz0f(>?qm?TQe56%)s2+woy?M3{+TQ#C@1-3g!
z9*PG_xQ1q(ZsU5)Y55swBHoVVipD=XGb5T-<T-(i<^aaAZ9c9W4jzh8C=+rkWD%h7
zT_DD25Z08UQ2fZ72Bp#e)@l~qjUWb!t`(l3{2X{rV3;DmE$hs<2tO5~nc~?R`Qw7+
zMgRa&T7Qrl5W|B*yL7Cp5za*^426L5*J4>-n4+BjefsF_%h9s}=H3QccXEhZ?=|aa
z3_4m?_7ra+y!k`!?yySkG&Z{ESV0(q@N_8PXl_-;T03KoPjeux3Bv4RLMUa{b~;;V
zw5*tKo0xF)HDFg|pi_<515VuZJs?yNjFPpT-5GN}0dXf%9MB_)r_|Xx(=IGR5!46q
zyAEY!Ts?~W`sGN$@acQ(QFF*qoDZuZDALTD!}cnJdr*BwIZ!&)_}N!JlwI461ThF}
zDS<ruZ|v;7FXBC&+`wox%YXr6|Gwv&sDOv|5}dLNBybXR)lr%B+6Z3qHCp@VuF}9=
zRY!%HAJKLbs4zl)^D;JFQMoICjvq3>$B0D7Mqx}IqUxw1EP~(lB^9zY)eSOYqw1*e
zSObY@1L2~fKPqWq#Pj2jgR-5-&i&)QBh2q<?AhZn$pM-JFgRq&qBg0!fD?7K2W%7s
z?|Aq?bWGhE8TolU9*dXzL<-_i*k5`oL!mP&y@h9!)a(M{Xjjkdhe7j-`K%%kZ+jql
zpcrmZcnITSJ*toj|F**uV^n}tjl!=T=AUmPD=gqH2?dL6(>p|!q8T-%vRyV$*r_<a
zxGR^gcsrA{%5?!;Br#*<<PlxU6|A9=7M1I=d1}0Xbb}s$(r<@@WF9{qX8TUI0C`)f
z(uxLsB3?rsgvO@t1E<4BCb-i9=am5y0J-?&d9*ua{2s%I=gNOUUF~Sq_UhTk>m@mz
zw_MpTc&%q6>=spCuj*$tV~$qYFGv}*B&EJx9OZ<eA^+#mKa`zoZUiw1gRhh@lh^$(
zR=)gb1yrl`1xBlE0tSp7KK-Q1815E8)R9MpqJrFmMfwY#Q|O~Kf7oNMY7-}f=SY9?
z=e+#d8C8YX^*Qj*Dct5re;JHTAbPHL94Hm|EX<&7COI)gESXQ?@>g1+Ly%3inOqw2
z!$7#v|Gt03)s&PnlYHN1R~TsSh3s2_jBpx}|Kbs}JB(q8p;>7x3Y$I_$uAVG2>ZOS
zsdM{w38WfZA4H&!0J9>|rJt8=Ay#kf^wMZoz8l95kbXRKuwjZKZSFQG@jVh<=%$W-
zRf@eze`>cu2=7r?<+??Hu^f5sQ6xbXSw~CU7cvG$9B`m&<QWQlTRGdYQZ>+|^4n`Q
zM=MwCMB7=WiH_Xb6;#MSSvclMesP4w)Zxle{Uy!cNr@1IBlV>pe`{^ym3!Du&tFzf
zB2r&E0`7jahRKgrw}2@;lSq9T8xHY${U&>ceX8`hkozO`WiZ~leq9d&bXDO}Xe37J
z3v3rm<se7hkx9N8-_)r;l$~pi!!QVhujCj%@cl2ge2KbSpeq&izhxz<8HVx9Yh{l&
zWk5kKp-Gu7uUy%)@A<4WST`x;r}sRolnSk?!H9jS6%CxJW?QLWD3m%cd?De%K#Dw(
z57||<;1<$@@P#-m13`dJf+~^^bfI4e!k1<c3!m+YE;`fVtFq_7eBSNCwmln+O>(PU
z5OQ^I%d)w$s3?mOVx`IZtT3Nm{c;*QE+te#pk0zXQ2|t(V4X?CDK=9&^ocg{D;L<U
zpne$?7(wN~;DIA|T~LzrclFD4I}x6<Zqt*Nh)<c7$L#Dhacb@8b;#`<IqtA<>Yw9x
zygNT3mopupyKu)!yz~VFCB?|%^#12_`8x-#ta}Ayg!q@ZUT#q&%r(9*t>T3*L^j($
z5{TSzs|la77EC0?3ttw|D+~t4F&Hb^<+1WKLIJd1?2eTr;64q=`}bkfmw4d|musxs
zvy<7d;`xxWUD@*rp1ATj8mvoVEh)?f#H(IZwv|2w#XxxG(QRdA4T_9OBB)`n)AH-P
z{-wizD7&^CiD3|SqfrQtB=^7A;C}2D=t$)PsA>Z>!Pt+XPZ~-2kuVad+IrQO;>yx^
zYD#m5ft!o5=xi~5(Lnr+OUX+Jo2~FT*`uNiZ4^1aGhgU~t5huE;tIo7J#n4Df%(b8
zYT%TDJy9J68gy~KGhaL~^iMz&m$7PDmeUCwSNj|^@`m*d7W*jg12z0jILWqneZ!E_
zplx-s{>g0IXmQeP*<Nf6&bF9HjlzTF-FX?Y{loe+W|X=V1NbadsExG`j@%b8Qyc=E
ztB0@M@HL=#8#!`c9Bl!%V4GCN!vLn?F~oQ73qccpTnd0^{zH|&4=9bWA^X@HRU{4q
zTS@B1Uv-Au^D5y<0;2%CWE)dp>%8EYdny7AAI271H43oCjWW+{!G*$$E*qk1RgbCh
zQ@s;k9BnyLz8uNOw6;6iU>9-Zy+Csa+M|0zX;5CsjQ@P#IB<8kr37(&>>p9JEgFr;
z8F+%xJ#aU79t7eW2QHFc1j3_^XCZCBDuqiMVqeT5@dyxOVxilJis-^a*e_-0dc-gc
z!r+zSfM5GBR=)f*BzM&Uy*3Rt5<>d?*!x@{Si}jzZh3nNCKTL(>=e8#ZjkO^;kZ;^
ztYejjd=%d`qG<tJ8%|95J{5Y4Q|%IPf$7B#B)RY$Dzv9?XeP^+NjppC44|YYUUY#`
zwPe}S9{HrPzB?hnvp=H1$=P=xkU;xeGG`h6fno?bqAY5Dw^D4$n`JasGUF_Z7sOU8
z+b>%v3(t95PKaT2-%gTOe#?YOq@C)PIZ+i)9~k%e3;q{66;D7fS_z`e`^2WVn7u9m
zG@a@e1U~SFH^Ziv?n*GWvaD{2{$${%dp+E5@j_8P`Ai8Sai^2a9k<geL(YCH|6nRP
zXFdjn8sE4Qzt)9=A{n@#EDroJnCy&JoU2XXl+Aas5Q~D@0Yuox_u>P037thxbc^j7
zcL;PqD?u|`c+x2-h@dB^tiJop*=B-4tDX85!_H<yD1)g-O#=~XCAqn<FHFja!(8Mz
zmo2QdTmSS&T7UfTA7$raYcUAJ(3JxDK=)tl#XRXsII7evfLhu@LT#VlC{B+mz*EeJ
zwQz-{3T!Mt6x-qm&4(h~Rh0cXyFp`6QnDbwDnDT4+Z&XqrIKh=n51NZJ`IuPIT_h9
zRgX?1R!{vEp4@;Y=&f6k6TUA%sll;ay8M4i-q(2zBH<YV@=>n(WT?1yy8O7q$4<WV
zHnii&X|0@x#>mVok8^q_g1qz*48CZv&b07>1mROp-Z&hj6~onehIarb4y};OfEIrl
zi}aq(HOHM8I{g^U;V<&Rl9-0}NEr=;KQ-H*qlx4IrjSN4NL(NU(!=~@r*(clkdj^p
zCN7X6=XAo@pM~%&FGeGuUx^C@%Z1Ic9Faj<G<w$Q^_dIg<CwPK{9QQt|3EW(9r}*m
zj3aWE{0_IF_%1tK<9#Mr5X{O0dgKjVvRAxDqXi>ekYq_UL8C<6_W6&+O;}@Sr`SCt
z0%JlnH$bUum(E-VC8*|7Y757M*@<}VLmDgIqP<Vxq4mJY%8t^M#&|sg`J?RIvLpsU
zD7dAL7z6v?SW`})nGWcgumL|51$o?BEFHuGp^6Pv<TXfUB`L>($Bqyo-)Tm3I7T;;
zbc|MTtC1okyrllqA*~L;^$A62yLQkDB-Nz&7J@@fYg@sv16hd44sA^N3kmQfv#|sM
zY}b|$#PILyhSalfi>1K6U?Tx7G?U0oOaKsHP>YVrL7pL8yr^8vU(R1~`d7iXa2q38
z=un**BERM5nSR*gsGMR%=D|T~bL3IoA7o!pNaU!-DB%L0Jf%EV?5RRPrg!O1H)f;I
zE<df{4`_V5{ji`74=#^R1_m1}jbn@gq+M)F^lF7k6tUn2FF_@_<7gM<w^k|4S|obu
z$s0;5BYETmtE`ky18!)Jrk=jL)UUI2POm(25jWHaQ|*I{;cMhs(n9yQ1l&;b0N1^@
z2T2g0vyynFiQ%s7@@j6={<Dyo4`|Pp-foCSS{NNfa8jj7jFVc$_U>K~<zOA)V!=UQ
z|D)43>-MkamYMNoXdddQ`n#FYGM}w^Q+7qS7KI>eB|%iq{)@fV`z1URS%4S?p$hH8
zCR@9!=ve_vS&$l1{{+~f30&7lELjR+VL@n!?Qp1*2l*;Tdcg96-80-c1nrCO%WNN(
zhlscuKA<1}U#+uQi2V@%aGn<o-zAu5fjZsVl@ZsZvVnfOB>$TALtzcHk)=2blMdF-
z+(imM)Hhoa3z$94AnQAhF*)OiP6Q|_TOMsaE&6IX6q21J#ttmQ;2)XF;XRj|ghG-O
z^h*fA0C(N<vJ1{2k%$^a32xf8KHz9ggI&F1I*1I-L0L^y?m{0)IHsV6YN1;N=O`rp
zr)+~~q5&(NV@PNOb3o^=6RXa-vT!kkhLy%{G2JtCvJ32Vj1|8Qz^?V##_pe^AW#mO
zLYya|p{>fIj!el;y2Q#@ShYr>g-MF)j>28nkI5$f_ZPkjElLgTY`ly-=x~^fc4t90
z!-Ce(mbwz0A)y@!*V8{%!E}_?>l{YLw&-twI0nx3@%xXmb4_9x1cC6C6j18@FILw6
z0@_aY0!+q4!{c-JTkPtsw`45{(5Zh(sV4K(KTQ}uGo8nAiVK5Z_}@XK?OpjqB5Y}@
zyiOc%vUco0FwK?EADhUbq-;L)4KymP+sM+kta6x-_|Hh;d8KL9OvvFu49V6Dpf!!_
zMf5o=E3-r~q*v-wBfNH94+8PC45}QpqYhu(p%db*6%sqddgS{FQE@}RK6b-4pIw5A
zcwt$YWyfDhK4w!8mg$)~Q3GUF1*YGzzTmnK0IAxCAOJthtP12rA^ANFL+ExtUk3AS
zWMvk3r9x2#)0;KBwhoaE7iE_CQAY^}AOb2iU1*j#$uhkH2N;JQUMz}h_vSss2->V(
z5*ko^R+#ljzc95X5jkHH+Slq8CQFgLbf0x5Z7I?$7;G!Dtay(ijaVhb_AJ9IfR_|B
zNTm60?TM9$o6!~UQLyQ~66Osd*h~qQ(G@V1j>Zq{On1LNCdB5>=*ohsZ{&xu1LK(P
zrpV87<u_$#mK!k)!_X^@7s>JcFIF-rT1Z5J67wGfiDQWx`tke9f6BcPP9Io(Dok@f
z%vOYQJ_^zqPNP<BD#R&FMx*mEjH;XIw8hn=f?b&Z8B^+=-xPo!x4cpDt4RfYY+{=~
zA0~s#?A@vM&7y+Fk8`vbOrnrXq%@qFJ6ge`@_3k0jGr9H+u=OpieRB7n#b`u4j2Nh
zNCOJBqoc?eRGXJZw5wL2F!r>DV41jGqNeg<Pg;7Y*=Sj+apk=IIxdM;T7W{io$Ef8
z=1*V~)&%i|Qy|G}IcvGnI9V>RC??}oRHbi&U%y)b(OTqK(F^)Oa)>51(#LnTu`nr#
zFbq1bu|>=KbK19xU^#EF6{(KoUZymL&ZM;(S!U3D22F>@!m(7ZcaCIgK9+@+f(zzz
zd30R4G0un55G<T1pxC{R<43dUhw}<64RABZ{7JG>;>d=S);;&0lTY|wqTs|7;>_T)
z#W9Sa%z=o+C!_;U!veailLa*jA__H?x$#p!!T9f@`=ad3ju?hPDA<xDql5k%3#&gM
zo`eP%kBxP}W1mI#LYA#4ZvZcj2D)kfb~bu@8Nq&Nob&W!M^41;U%11CKhUdK)b8lO
z<*uqC<EU3b>@Qx#avlntklAcUISDd2q)?&V0Z83%hib}(*&d#_psy4!U^$yYb(_~G
zu_sI9QQ1$teucqDJA52k#B*e}(kz@ey?kXZ+pEy8z@P6~W?Lx-1WzK$7Jcn@<z6cr
zQ&qBA16*BD=<BpiWj`6~QOIVmU9mM&vHgUvWT%;A%38_h;7O!i!PVLaWR5p}!ClY}
zh!?J4W=*M<Arr2Z^AE7)>ofath4onQb$i7O=cUMnCG<oj{OvVBCB=;(zURVRr35ew
zR<OMxm!g1{_w7n<tYEjo;%67&K?5e`bLE~Iz$}fP2<JrwfRk>(l|F9(v-GPE(mt_!
z$Ys<~$!A}75t?Rn`>w(@MJ|{!h?lHPtg1lvz!}7q=nv<h*T?}%eVVPx%EaP+B;VRA
zk^MQ8V)Bvey4yx7s_yTz=^x6@C<$T^grQf`BB=Mj*b@GLc4l({r(>%kO<q1mmV&#+
zrPzS^LV;A);2}Jrs{|7v4P#swkr9v5+O-d{y0d`AuMuFisxJvJL)w`_P$yQ_ufRzL
z<gj>cgpkID?P30IW&H}2ZeG{<365;;c3eHiOh+c-!Wo0C=QGv|2JSUS@$;E)nGUG;
z=P`NaeBr+Qza?qLvjCHf)h8!fm7Tn_iIKCX;lN9F{i_yeEju5H8M!!yt_?K&E*w<t
zP<fOYIVWKbVDe9R;NT~&nMZ_tQ?stc2it=D5_DTfmlT>2BWr>C`{dpg>S1Yx-7@Bx
z%U#gloNxQ+F6!*fYl2><qr{`&Mk~`!MCUZ?6A|sInbD$NkWZMOMzB;mEs9wwxflha
z3`lS<W2^^4{=c?0^I7%|A+iQI+D>b25Y~Dv*+h!ehw0aN-{@xBo+t4yMzi!~BPdpZ
zUb@nVTt-+WG|OI~gIwXh2y#zfCB)mysuxkPIsKL+h(KI_@e)5r&X>UzZBYM~;Z*Nk
z9zSe;l$~o1!ypWUufzx;<^C62oc+Str1=7<0@~)`d={4G1|Vv5f#7R*;E>P%a|vgE
zA_r`DkI3ui>n{`XpU-^1fP2DX3oZu>H3+T~gmQ$$NXqPW;lq(3n055GptkZ`@PhK(
zfh87duBSB?g<Za-F2Exl{9OU&?os&`MjHLrxq#vTzp?U8m~6Q%#J4`l3K|^>;N@U8
zX+4Aynm&GOTmXy=fLmev(8U;ExB2JF<PP?r35LP27^{h_9-#y8lNu6M*BR608R>SP
zk(aRY{Q??nngU}63tS_{0ts%RP6kDJYy&P{pE6*_?<yyFN1-K<%YfX9McgKdOn7D+
z%x}#E7Id{$Ky7|ej<7O$qoBkF7R>Yd0(N=?5`!Bx;A_ro?Be-FCmIR2j#MytHP+aW
zBId4)?!2k&2Bm_Qn^7(_3oQhe^$A5lCl$;Cn+gX)xe^IJL1Bo<Nd;q>8K3ePnKO3(
z><dvSsbF?x5|}s-5NX>p3%{yc1p}Gfgg44T-zVOboox=pAP7XS)K;;2|BEfp{m}rs
zN#_EMv3`I&W=iEiD85>xU_1nx<GTw{{I9N%!g@{+3{;nY-dDx#1FzmFLROU^7<w|V
zftUJ0r`CEg=D%M~{zN-LF?v<$Z7h1=Cd@`saKT~3r{u<!r*_*3MN*3x3^R=Rg>kLS
zRi!$Gpdeu|4N?pio#Jr?AcTiYix><S$w4{r#Ne!8Fl{NTE~<5sxPs(esDPHcdkAWQ
z7QvY1Q`<b}rpdindzt`?S;S)IR&K@G#(y9pqdCKTUzoS#PDJs?5B_#i{;ur=!uyd$
zFoxW<(*Wex3EBt6e_B`>mTp19B15OZM}L;Gpx^>!5sl&T)(>~gyeLkTeIh(*TSQ~_
ziwWc-%+wEmDJA2MXpG0Wz4g($uju<OFu@WO(k-GfeTRugSFjOvTrZs1{*F1iL{Hr1
zJ2Y=!Ir&*iiW$)u95Q|4FW)5xlEmfIS5|ZMYQVUv(=D_y{~Xc1ugY6;CPL(RO&n^+
zBTDsn3=0E}T+D~EGsqGc1YzivYAvAmzt|8KGY_(v+`!igB8L1oGOjo1y5}qgPP*VZ
zXI&Tb01g75Lm=;B8pSVRyA6AnviHfd3!II`+=Ex?mke1<9;SK7Wro8z=Etp2L8oV3
z7L)6BI4R$a8$Gp;LKt4QE{iG0uDIZwl^%<*%YuHz2AZf)9$@jTaAGPf;r#2mnEZ3c
z@U&Ky#@P&S6pH;WjDa*8?^g$On#(+ArO@cYm<7iG_|m|kkv&IDAVphDTtimQ4=yRl
zNCZ`Qlr{GwFmkhi`R0g5=Se-GIO@t6LrM-fK4clnGpi<;{8|h^pKpZWdGGs88-iDW
z*4t3V+yXZ`z7gI8=g5L`oOET(LHs!ckwBX;TwZ_`S`1+tEdIW7L}Fa1FlcFA7jyFp
zu|eC-yz_@!`)v;>U!oVFxa?pAE&o%N`lN~xWNFq_F_94xt8)I`Og@Ms?2E37iOg{r
z`OAeD1&BJ9Li7z)Okvt96Xl-caX&#}VqFyz4ypG=GY0n0gva!Mr{*8Z&NVk;7zDyM
zs%(ds?|-o}Xnz#wu9gc}Q4(V?A2Yr(W&gE}>t={5(K(g2xs&gg=Wn5Y;g1S}Ky|k(
za@~Vdsz|wb)`C8xA>FrS72woK+LfsoLM7!X^K$@GYh#24<8_>=7!rYpIAL(ecVR1g
z24o=@!y*Nf4a1x3Wp(%482F`dree_ACJY1sl(iP;Yz_8crea<;>K;7w0V-S1sezIu
zXDY^^93)_|yt>pD^>rYX%9)C>nDio#(4G~Xb^*_m4EHAGYR}}r?{MfDv_o4bEtJ1d
z%>IG>5me)$UR}5Lq!V!^uj=`XZ3*zZeLETm2XV$>`0=QT+98xo+SQJp$)9Y6-jtBD
z^pJ#6!y1exF+bxle1a*2<MQ@1tGhLP|28D!FoG8B6X1J@^6(c%a&K2IenpH)y>Mh(
z+RiB&FvF5@n1kC-uY`_5`Kjhb1IYzh#iIQ#44#5H<(_Bg-~vW63<G-6z!XNipq5et
znIFk03}!h92Nec9&p&m^WM#=u4DU(Uym`8@Zf~l6d>6lzUD>U~FbHhP7h|XY#+LDZ
z0sEdZ4Omu0FvlF}<Q>V>)S^3${y!}nMDC$Pa%3h=5^*U2OBM2xljnM0FQX;LhS@-g
zX)otSK31S5p(mr1J2vxR_U_NBo|`b0L&U*cHPS^90FsidCZZ#pJfe?>Uzu9zMo4y<
zHwdd%L?Fzw{C&c8Y~UMJmR^F?FrrlvSHp+HYl<1av!?s=%HiGPMvy3n!Hr2(cN3U!
z=+P|2|2N7mZ~L0QXH5VI2M3qF=><zaMv0T%3)aB|`#<y(YYPuH3R*WWSqcqRxo`OK
zJb*7cak3*RA7ThVKScbCH<IS{K7GA++hqj&zIsEFdO7TID1=Fy^If*@TkxAi1i+9>
zKmk(RVk?gjg(4YA<%I?rMkp6ew~ND+0C7OHDQeXI@DEMd;$FUkkme)y#oJ!Ggdd{2
zYm2&+kVqRpkgDf7Xx%(93YJ+pIs&jC&pj}^24qiRPfcNdfe3wB6Qr9^vXNq=b%CaY
zTLNHv`Rxy>XNqCt#{%@<XYWJV8680kf<UyTs3_WhW5@HpkT??>aB_*KD?WDp$R2&c
zO1QF}E~*5f+e9;;(4#LEH*4JynN=n96C~b6^YMJ0Qi~n6?c0q=x%bS#?HHJp7n5-E
zl82xP=ZSHo6md?Ne*-(2(a1U>y_-MlZS#Bd8>_~rq{8dKzS?Q48?NjGsjt|Pr3rv!
zc<99z4Eqs8d$&TB;XJELW+wZ3XUA_42EFav@Ke_(pzh(J7h*@r6%vd?G?cYogL-f8
z*+VZhPlHgJDk9V&Y*2{`(eTg<3V>#iN;CY7cTpLk?4cJEE4_Eq7;Q_JXoQoPb#kaq
zUFf0qJlhQ?pjL_9&qFT@)@p1J&%}Ae9TVl2;h~p>nMhf>HWysu`kB~TJ@is$Au-wx
zW%61gN_Y+o54{vyeW%z5#G$KyiD$n)vG;<3_qVY-y;%C~iLWF38^3MKVJC;(Lv~bX
zmnQxt9(frs4cMgv;1!9UEr}V|5Ac&BC!s6?+4g*iI={UOkGw2_?5j$nWjh^e_3a|~
zN7=dLSPa5I@Jiul;QkjIS2P>jiu8Jy6^cjz+myRM$BnCxuzViGT4;<cUr!J+un4?x
zA?_=~Giy3e(;FY5R&5b?foVt7a!>=Urf)-l<SZ${(0JL=lYfv#&Hu$6LQb-hL#Cfh
zJ{|k<t*Gzn)hmQAE7d!>5Ez}=UZ)sO2>X3ff`Jc44390NhT==8qgn!9=H_C<aM-h_
z>ShV1tQLtEE)Xd*z<F4;d)<Q7vPI&>bB76hw_D>*yxMyUHNK<-(@~5>^a_@=|MbqE
zBhQ3lcm$4tkG&$)mG&3%)rh=w>?}~+@#7E1uh>}%+gwCm{4lvR{=K%OwMTDDBgf;f
z+e=RRWKVxC6D@d>TV`JP?R<`Rzx14zJnbmoFrI+NGjCk`=6tP(epxGDBPZqs$&Z8V
zwI{8ktd%Rc%G*vB?Fa8^keb?Xvy|925-*KPxW}1BB$o?ZiVmYi-o*o2+<Gq(kE6;O
z4FQI-$h&kjOpz$*Xm!r)1gN}mTz<an$Sg@BX0DvI_75liQFbO-48tG{y;3{`+xNd%
z^|Pv>ehu3$s2_0%gOJ`CwtY*zkppz_7^{aJkd;8T+YWb;Yas;awV;^UUx*GKudx?z
zphdz)FDp0U>8%7pz?_JY61n@K9nzmDHv2@QTvx);-<TJb@aRM8&Mpc#PmPe!$1^8j
zgen)riTb^bs9#hQ&T#rgw9W3$SE{g8;j6!dT?hG`Mp?pP2YizKg);K#YD}-8f*65f
zBzZn$o&TM2wCp5QnrzZIQvTUIkPUcg!X5kaJ8SQhXL<>tYPnxvp^j%BZrQCZeW1pI
z`Y|@eGtp?e-P^0_)j<JX0V%8^_nD}&cf5<iBn{;PNK$>e?FGu}WO>KCsK{<iN>F92
zs!~F4C-DRw-lbj>&Q4R911TORpozN2;a$q}1Sczi>;7@(L=bf>FvbpK9ph<AMa)EI
zYU@~F>S~B643?i`*Jva-Ol@a@nWpljA-hDO7Uohv{d}~%P5$5sQ~*_pqVOC5XPJw!
z&HXwgk^}JhC^LqPM7p)Mu^(9{Rhq0SYyR@Xhq5!uk{ASm;FUs*LGORDrJUUlo5{X#
z0mf%WRHVCptHFi*Ik$(uYx%9luf^pgI~;zUiHE>`2sI2yU1SVfy_xokpZyrx1lTb;
z^%sV1rUpKR@}~>ZXy9pa&~1CemdKfT7D5Y03>`9SFGAnVQqibzgmK{-UD!{=y{E?o
z!m?jk#U;WIk>28jLuKt=GFCktb+^K(_e~H(?Rmt_=W@>$&|jJGkArs6VDajXEM~dJ
zYTH@idC|oIrjs=$0F!}1Le~RQs|<RI6nWsRxhRP}$)|f^e|6hWp|rl<Kyy45L4CGD
zSlbc@Nq>NW{=BvAVGC<}Z+mGNaPaJWprFf1!wZ487eG|2*CNbEX41u1xM8~>k8oH(
z20H0)pBce>w#tzI0j&7@&BFz7gkxC8Cc^1IXu6EOP?&Tf92wpi2q%#LcguZog~&sI
zPe#Qvk^`EASCJp5RVdPU3k|TfaqK)jPe<X4oeFZFH-Pc+aRW+*cwYFUNy7^gl1OQI
z6vuVvuU7j**|}Uv41+*0myJLlOGx=Awv^{Gz-2lCJw4gj2#W46URn4;d;u>lBRRq<
z<&sAS^&YyvRSeLd;O|+nMS+)TuMHw1qPPbYftMzX6<MTQhG#yWX#4sI<(Hzp2_u7+
z6kae1+Rc|I!|K%?ZVP*kjdsSA`ULlV=wlR(?yDR}Ds!#}r%b>1LU$A~=022N-&kH>
zsFC@y2z=$pP_~>fmjOF*QRw*uO-#ClNj8g=i~lk(<2DEie~wkyOGw$GzzcN>+*?Sg
zZtcej%@K?GF7&B^Xc&azCt5%WAq1no%X-=MiOW27iyVS?E6*>F)?$;4%F@gA=Lnq2
zY3%HR3!~ip5^3+KKz=y{V$ve);&JV_1OyeJp{pF=6=t|B86DwN={Y9b+r9GDLphMh
zn$cpwLJ6()I;UfTJDxq+cg0gorrRI%g7fQfgmSe-+U4;JlgHq>NO+V^!%^0a-M;N_
zF^CRzvSGFN*@d%6z7G>XpnZgx3%h-!mE&~7TI1{it-ElW?SKE2UD2@wAqZ<pR0R8P
z>=EA=FgtT;;KtJhf`+8rl@UNLb6sS~8=?eC^sXN*uFOW~*S-PiN!&HBt9Sm;_kM1M
z6>2f`x1QetgnHU|Cee&#vJ2jRRnaj)XT8A<CuEH+lU?G>7DzuASJvK#RS9J;%XF6r
z>VUG2iuE)|>OM1>uFzffYi$H~If1ll61~)#KY^z)>s!Tv8`2k1MV={V*TpC9u(X8R
zz+GwdApy6f1%(Uq&ozr7My7O+e7vF)vGyG>H80a!=JpNspDlAlSoGw>{Bn*rVC2YY
z5P2J?R%t>++%mZ(K6<>@gXlWU^oR9+o?g*23pjw`L)gOp&nA|pf%xQ#&(VeF`vm(0
zW2r4cFzrZYx7gF+jzTI=K(&Q2AslDL=O~Kv@Uvkh87Em$g%cLDmf0=9LCEfyv6{D;
zcMCJzZ<*eLnUM(U<NNV_S_BRPf@gLMWHmrVoeDkQ*^iJYrJ3ELSM9)+LM9woo7_I3
z;$^4kDPg$5prR0|?p2RJ%C7AOVi1O{MCpOU{)=7Qui^-)UH~E5yd8T_XPqYU4sXe8
zruk8uaZGB9%nuKJ{5$rIT5_3@Z|eqrMT6IIbUU_%GO<s1?pbC>J=pL^5Nh456jp`;
z4)`Lf2^!xILaCHh1Ic1Cjt({pYm4OjE5Gn9+AB2FTk!(3sQ9q4^##GMG^*bWicleL
zdB8BHqu8M<oT{*lV_6hBUz-NmBNVtorj~eGc71)g?(x_iG`)i40%=tg#4BaK6N-1#
z3h_1T;rbt=OrM>Ixs$XIFqeh$qTAw*mV$1b$%$ZAGIa>{Q#xZ%!>mi3Mlg<J7TFC>
z9mLUshM`RX0i-mLER*Eijd=M2c7ee(4}qj)cK^FGW=+EWTji{9=95Cga#6I3Bm#MB
zZeUk>ZsTakB)AhqGt)_s7`WcrI5`Bo#f*_ei<zK9L%8#|3Mh>0?aZR7i*=O>{xX;=
z@WQ01pEiV)vDBXMsEqw7JJ;igK^O>ElpC<XmJ3S%Ekqyp$4KLuYy&#LhhD69d2nF)
zg>PBW+Pv<B!L-;ol_bLgRq?5v%J$#Gln_UsfRp0`WMM}1T=`~{Wxqc;$?D4HUmx9s
zahdA@FX8h5M2^w}b@aGaxmhZBmj}KCyT<eAV6^3qLLoV57p4NQ2fzfwWU2!=3=<+*
znwv(XV0phxZOJdjFT^=87EwhF1&&`&C=<9=X#|0X4993Cr*c89%^x_EuWg>VX9UAY
zHt&i%Rd_o+K}{Mu_LreV!W`wO$$<&BZC`g(cXNizT}RVPZ+ZyV!&?q-C^FuiF;8UN
zYft?YY|rG>EbM({$3X#PCNLK=Qs3bw@&6u6-S7_QHu4Bf?}FVF+#;R#ZcJFaTNy2O
z;a$Xcv`M6nXI%dQ!jM8Kmt;a7;XBv_tz*E-v>+i;$aSQkWaOD?1z|!53jmo^;Sv@A
zsNR$KW#gEa;&Gey54*1`-T{{bi3Q}2{Wz>(BU})g^F*{_vCbnx7fhDtQNQ05Ebr2n
z7mfp}(eX#wxgA*ygD|wE_=QFPjV-!gYxJcCGMNlG7{t-0ZcpCXNblx2l=ML$jQwNm
z$;k6_BBN0sPEsmDtQN69y;utvk<lQV6>4?8s{1+t^8G-9;Rc6SgF=pC)`3SWxGM7%
z@@E_yuLdQ+M!=vw_?L>q41;ul*+kEmyIO1TTZE$cJ|pU01qyKl-0$b|)6~lcj1mE}
zd46r$T(FR(@whl59Os=M)faCyoQFgR?$GGb;#H$mMicOt$wl^5mZ`xg#(ba;Ro)Hy
zFV(+lEbVq0x&X`<bX51n3I@(-Wk=~aRm^<k&eWK*-ARtr)j?-C4{pxuWK_fsLX|(s
zylHqC;Z>nr>XIv&@1i_(NVEDgyt}cQ^Yh+SZvMs@p<?Q7%&M`v_xe3a#BJUiS8XYc
z-`}f5p*sc}YIIE8x~B_c=M}5%8)U^=1zzyyCt7M4WDPW{p*%PQOoK9c=#!27YgR*(
zcGU!~F|&1KWXR#stcEH}e!Sm0?a#PEOgH!m_%B5HqwI{1AO=Aw*pi-zr2oc_^$&@2
zM*~a-6UDH+$NY>42P^g`l5KlFqq2gr4ZacF>8Tc9!qjefwZOSXjwqNHL>))8;j!0~
zdA>r&$PN$%3e0eIqR34IrY$K%j(zYpTAKjG&{av$<u&px9T7z_Zr}KU`=;-kQ+C%W
zR09!3F^W)B-cdTp0F)L6YAvED%P+6KPJn_;d>*+d2u+(rtv^r1RD@&SW}$6W0>>lJ
zKaOo-G*`<b_*(dJY!VJZc;dFbq<Ndq=Pew8Vo^<zHIs%^s`S4SaSa?se*Ag|MLZV*
zQ~J9ox<!rr38sL8ClX!-W2Q~Hazl&!iJy2K`SHet^h#zEtI+MTD7UhvzhVr;F@SIR
z?q`*3#P1HDXD_xG!lWgBDvnm}evwJB39~++;g~)A%Ld^ZIXVpCr_&MU+ddhoZ(TqS
zEHWwd!#j4$bX9dGpiv9^+u<;T6B3POtlFL|4O)=Qu}G!(8w>(Fw1JOg)UHx;MK0yR
z(@K@!QQOh*%yWTTGyPI_W>*ZtFc54Bd|;{n#<D}cWWh_+0O8rObuil91m0CP!2cMw
zA!$h03SX`*Vku*GCgQZzZosbX50S#xcitS=FI~r|R=Ljym-qsIZxKrY3sl<K?vcKc
z_<Qq0H5I9pd57x*Q#I{ln&n$(A*x0yr7M_VmIxy-My{wTB}AlBx}x5t?Hdj0-$XT7
zLB7NymBQ7DI1%F+)WiE3EPO1p2&J%be3n<$i4<uns4Ay>lU$h~0Nv3N?0L>?7DOK`
zVku}8AM}_9_T>o;dt8mTcaB_2!=Veu36(!b5`n7p{5HuIr&$i0%ZO3Rj2_qG^~sy)
zpYD7_MoxtmOJ}<x^lDLb#lF@UO=nz}Xzp@V?$9+iF<qy3){>O&DCnBnin%8Px*akX
z|F-l$UX{0v67LYN_beM$v-^GTh5Tjhf}4XuQk(|qVgF-7^7`Z${YaN@&(@2xouXes
zlE@;xq94-H>xVX<Ofgqcg;YG!EA&zO>B>EqO1~p}8(U#HqU4Ixgu>8j!WbvG+I|Jr
z4`tV~1ThH0ehD8a{Qr+_(mesYGv(A<$FVjB4M})&{Q0QmQGhZ7_lh>6;pAyi;6i^2
zMsFOFmnsrEoh>TLTbw_LF>T`VyvX%M6ztzI7tdQ-LDF^Qjso|ywKS6FEiVl=@3zI~
zt>3Q!o>APwK-|S-tH&~6SC`4gh8^WCK)m^!8r?6w&6oY!&^=g+7!n$V>J%jd)#@47
zn2xA;IhfsV&ypyM;tb9WO^SKSnH|{qm~VnYZRwB0sK$y;o-6cb00%%tMU7IS&DsFy
z=(&RG!I&i@ck-~f^gJ}Wfh~Hj(ANNSeCT31>;Jtw7uueDkDN3BFh?)-as{|Mn3R%+
z?g2#{laKA0z^u;Fh^lDR4Z|n6Eq%Ugxbf+Hzmzis_++ouVCLD6sOR@s=P73hs4omh
zTI?$<8>~y`&B^r$XhD;2ERAcmaFzE3l}qxS#w4Sv#F!7yiuFaL_TMol3hE%GsHx?!
zHMTe)%5IE#r#*$2@A7mVomEpmJF}rFj}r7#X$4|d^>-m1@I%>|;7AOEK=4aGAP)ck
z*is&8R+x=8d>|T;iOtbe{~L`sg!g-!X0W2mlgv~o@JlS}U~YeRqN1PcN-|Y<6`~RE
z!O?E7rMA#n6A`jiVi7G*KA!Uv!k?x7sudO<ECN>=yIt#6KRVW5>&%7kFCtfV?V#Hd
zNKXZf6+Ex)a2kTeii<0jSuO7bkHUka>4MknuzfC?`Qw!d&f|ll2(7~%QPA5kS5lf$
z*w3_nK>q}hn7_Qiq&&~|dnFnNg+(VD(w^Y9$u#i%$Ms(L)rSZTF}NqU9H6tWtk^Bs
zli0~&0bjBG)MP*meG%)&fE<;eVmicPME{+CesQ{mXha2!e~w<TP7+&M8mWg?K%7`q
zz)+K1ZL$`6kK7Zs0^r1=0>*Q&CGZtlz?M|{tb#e9jpG9JLm9t_2|_RF#I4}lYEcFw
z+tT5p!|H*N{HYW!lgMOYC<7=|hkDK-nc`fyS|gKXLSY+t%&;_;`q)w^w=FVRK=asE
z&&|=6zS`)0d~)26<v{BD*DBN8kdXgSb|y&>gCG>WQZ!E7|6<K^)ksp6zsrhBC5WJZ
z;13QVvPJD1obqn$)dt=G$<$uR=Lm&qbou66AihZ}o2?6ig_f*`eCEMJ3e}f{U7bpM
z8=)|m;>?CUJXNk_U1Xuvh)|fxpzXD&LRWkcd=-RbEJ9(hNyM|edD5+tkOOmELgdJg
z_5Pl_I*jKLvp5MB<x)aNin?*=3cGTjW~bz+O4=QZ(03?Aaj`<pDzzpkZ&<{_P?Eey
z0^rTvSn86BlF$(gvsFEP_g@umb}n{8=NzFhOn|Jx?G0ziL!&n(ayhQnI)9aWHOs;X
zLlAGY2!*LE?7M9J>6Qf-gv^LQ7_KkTMe>P?$1BT34Iy+CCqtvo<D$xi{Dgh@%&#Bg
zT>wz15$&M%VRAj1Pf!aF;!N!m-Y@o@uqk}{1*6b?G3WIrOxNw8_SJn3>^p_mpZme4
zR9JBBVD|y_xaY>%`ndY(t=~fTL-ZEyHF$XyE5ftG7YviFA9sHg_`VRBod1OCA7$s7
z!!QiO;43vR65sz~!`UxDmFf#j)wU8KpY1>8Aj~`O4lKe370H3co0BV-?_}7jWWG)5
zD~%p3V_*MLk|WsJWJ_?hL2_X6y6bKHYV7F8ET_F-g@s7FObQZCr>(%^-Afk#35*pY
z?Xnn-%(w|^Y*3zg35p;@+GSFUWqwZ3BefcX4M9YQm1#47gBcaP=c#AC;Qs(iYZh;a
z=T%r2oAf29Nf1dF8VPO2T9cTskw^j^jtIK=!SIi-7_7ks41fS`A%iZPJ{62k;rw65
zQXyLpmV`#$V0n$)-04{vm+&ah9Cw_YIvz$1@*Sye^uk>`BIvTuJWMWP5|@t$Wz8bo
zn<0WOXW>QycOS>SN)=(hvVybZ_{T$vauTl_z5Jb_4380XF|NoOe?qP-N-;7)dW#6U
z*y@cYcRr5YYxmq$Ji<*rBI!c2@!fBflkpfm9|F(bzK)&Lesl&mZY2*txzLls)+w?s
z-cX#z)Eg#dJ>!$x>+3VemynKsM3-6kdlK{hC_9rI24WZnwzP-swfb)?8vi8b!v=z2
z;X|}WWG;^3{O8$X0cYN;WN)0nWHDDXwn{Z>Vc6&cwGLtuMLj-_5Ua#XYJl8^si#vo
zF6H}UIKNyQ4cEw$lUd7!zlv-^!v`iR^Kzbi$+2L*ZEXqlaCS;#UU1f+KZz^IP#V~|
zw;S{F3>u$1?<?9E@@8SgH$+8V7AMBbKr?`xc+?K(b*~~X<ROt$dRE>Pkr$3;sL%`a
z*37Fg5C8GJIu~n92}gxqHu4#x7$)uiy!;w-39;MAQSd>4Jr>~&(vmYi^Vf{^sGKSI
zbH@mfAH!K1yFHXaoH0Leqs@Aa<VfkpydWYWfEX6Oq<8%~O@V0l;QK-TWEnz+gWlbS
zM5)LNt!tPUh6}c4s~S~Z1zvcVW!U`~$#3c68{fFnE)%!YE9>Vh>z){zo?=L<M!TfY
zBc&!+9<Zvc3+FIuw97aak)X@?w+rZaJ36r9E?8MCW<S`1x4526gU*bKyD;>S0+9Un
zA7xjPBQXpDzl4dg;r}0NDlN4H%t&y{$wFD|g46;>gn|er)AdMrk-ZNvhVOC?{R>fU
zO`MM`GG2VsaGWpxW`N|E@qS;>%M|%8atyEXB7Gw%bIH5U9brm*7vKy(TMuHdg(}DD
z4r-2k7w^-IF1C9IGUWkk-v^K>@m<7TO&;{_P`c$KupgkpL`n5d$WTKc55_||0(DYz
z8pXgP2qql3TGhyz2lqJ&j~r$&G-LY4_LTm$508B1IEvBN1z{^Z5sa#XzYJ<lPMnHd
zB_xVoD9m?b<$r6oG)h~L-GaXhfpeBX_A8F2FAF)KeqI|UCRG0h^y^*8h!ZX{m~C7j
z(fp0<LA`Mj!^ouerNLpo)v~8AC}fJ3FAQizejgt7j;gxgZynSeB}b4M`SOV4`Xk5*
z2f|?K`1$c8Xihf3_$n$5vB?8WKl;Fg0>OhG-|;GHo;<>vVz2GBq4t+~A@?!2RAPgr
zQv%9a*!8`Q7soJ#*!T49GC&T@ww>~|t3R5hw{`{};E(b0q3jHBBnDv^_$As<X#W4P
z_3WN>M{-?}4<OW%U=qjvu|#jM@~Jxv09fL(9fg%w${FM>A^c%jJjD$cvgb;7(M!b{
z;Bi5&!5~j8>ld<T5PX?$V!#3Y{7%>3-3nL9U$zTV-i8RA-j-%@rpqcH;tKL%T>pCN
z^pDy?(pV_$ckTL3a=cU6M~N#zIiH35dZoG`f}jvFa#6=#E*TD1zDH>LxzIS>L<TH-
z0?o%=$jyQ5qFpPl@kd0qJ+(N_Linv@7iI=@vtEdMSkLa%vvBAF*#%Z~L$F4l<Ty5V
z{PZm%)dh`De~Z@nKdk6|1r=Hjs}04#`%Iwg)0){~Gd!-mmS7YoHV_=r$r$OS=Cg1z
z0@dY)EePgnj4S3|gcbhZ2*n+0T_9$KOk$JzEaW*06Ax&VPoa$SCNCx1gaS$o?n7GA
zOu>Q+_~l#WxyO~)#=DSw>qwLsftUj2>;*i~gYh0`q7793?e~%TZQ-XquS^$IfY9;7
zeNJaORV#fKaMwz8;YM+{KJ>Mf?kuTY?hq(nl$}|M12GIluM{t`t@~eW^ztzv2?9m_
zO;C5+CApUWrC0Vd$G8-nfeg8FmA3E%Gu0*V7PbPsGWQz;QpY7%S=vgT7P3vE?FU1e
zUTEP^DFH;$>)=`!J2V&EeYaEobb+BxdW6phdwxuBmh{5#AroN6!XIKWeebe|qYMak
zX#y>Nb78v_JzHx6mF6dtUjh=qOPGYiyjtTY6e3e!usVlQGbeY^bq2G9j>^jCcZhKL
zJP6lh$5hdg2{q1qnE5&QQ9=lVwbLaa!mC`^F!9wa(uaw0?e31Q3}Gzk-UAXm$f<Zb
zjb{IT6(DL!`%aKHVJjp*cAd>#%EHNaiR6~Rc;ukK$gg<r2^hw5*g7)g#kBIC(Kt3r
zg>%&U#R~7Cp)l{5>j}GkX2NXT3S!Y~(`#25&9QK(o*eNUz2D{5D_~bAWBOAT&Wa<Z
zX>Lq%aZ0QUZ>16?iD<)F<|yH!pkH|jNUktp{HuB-+hG!H+KM6I+EX&t(H_Uf$&H#f
zfyVtUllr6VTyPkMK^S_aHvioJV&i4fHb9l;9Uy8e1~xc2oIIY5F@#fmjl-zD8H`<Z
zow0rluqGfNFMGM_+o6+q*fYJj(8BSe7h_Qd<B?3<<oL|U6oNWKud`r7)!AtBwdDRF
zHlfOS$;-vOx-!a`$hB8)i6}?=LdWjL<19aBUa+(j-s>eVHzR8UD3%@A!4<pq0z37B
z7o1t>eX~Hc%$b*Z37OpsUM}3Z8Mj|tgpKpbA(W!vOT--=zQ*pxyix;hDn%nW6OGmy
zMkE#htGA?D7sh5@?XnE@4D{;Le%XS!Zy{C24KD*|NG!A9EYoSB9rB}gLC8M1Ah*io
zx=SQ^Lx_qWsY@~?xrMlWHX>5GYhJ{HsMT=4J;xDl?DTxfdj{}m^`)ST0sW_q144oc
zwnRo`=`|V`8m+U{{127(<I%x8b{XT`j1bCqTK7p^LK^oH7GrG}fOj7&)_ldj3lJoD
z5>1X~u-olVa3>Foy_JXdWo^}3JKJrm@u_kU*^9Dk!C@E#p;r=6(feO)JeO<(x<oEu
zT1ye|ef-je6VroOFlQ8qR4EKkc1~c0Hp_!p(7%E}ypENUWY}{d8|+}BZXMl*wuAMD
znS}H+Zo64pg1}#gP3A&8_Z%Lp5YQ3H!VtHG^V)>oQ)Eg|B|GlGnq`n$<cLA*%KK5d
zNB2;c1__2?r?I7vF}7{VjBQb2L-eohTA_&kwJ(YXOd<CMuOedL1Xw1Ve|st$?*~N`
ze2N&BYJjRwXuf3r0Omj$zgfG7T`_r>%JJ-Dt3BH>m5wz+zX$0v1(Tv9A_HMg$RTK+
z3f$)#@-USKb6cy-q00$xj6@kKbgdK|itHzlVeOP6ROf@qW~+S05ez)HTGuimb29R^
zvsPA)*L7e|!A}RUp!M+7tFX3u?xXECXx<Q|f4B)Opc1Hs22L^3?+T#zSCQ-!dP;?r
z_kW+f`yZM-G=%{}x6Vf_>)N5502x$xbq`LlS_eZ0Aj96~F2Tr^3y<vO$bfMKzg7-A
zF(W-3)%Zo(l_W6?!mux4vxWbEtP+RLVAE;T-YHG+iY)!x^GQdB3Wd`#Od|U1nZH7?
z=KxPZ4#-OknB4QMnK{(n&qrhFU~{B*=4?fw!L2OD*oCFXZ_!)<&SxhY#i?xUo8y$y
zoY}bxHHDpM6yzbuCwbRb+sf^F{HAgm!c9QKA=|-@1R)74VS>Xs@hC`~sA`1zlAwl6
zN8|Rs=U_pEsFnS-fy2Bq-(oAm%7F}?bZpHXm9g7}22k-89!k1J4MBg16c`y|1xHzg
zXZ=&L*_9Y^0#P`kOZwi8k?)sCFSv#ih{BZ@`4~uDmHXc2%3q(c?yQrHX4Xk&nHoAv
z2*&}3Qk*Yk3<Axt|6E-tzS4srCfUO&n}kofz*5bGeb<m@k{FAPInF9(o(e1P0o+*I
zLc5PVAcQHwKC(1N5sbP9U3A-kpUQbIvpgUrJ&?0UIZ@McH0mJ+<5DD67j}Innsh=a
zXpzSvWaq%tm2x5I5Y5F45=ww<iMVuE^nKJH%C78If)IwaL<r&Nzp=I1FOq%Ia|0tZ
zTqg1Hk3qkp1k#^?kSU&<r|$D69CDtc7)a_EH=MAhUs)5XHI~d*uo4Y$3jpp0jTQ5b
zsf_yd;iR)J%i;hu0I&tnD<^7lUunx|wixsJw&%Yg5L7LhuTW(Qn03#Qs*VkTJZZ^%
zB`B#}M6}C#5j;#+zWma{4v80xzruz*yDCiuc=%FM$bDs^4eo$mbBkM7hWyf^agUuv
zmruK7)pAG+jB6X&0BIcNmf$H$>(Ekd6VB+DkV1greEQP!`Iji$1-SSUQo{Y<KBRVF
zv7?mZOcjhfQW_X@7?$xxeX5!N??M0d>6eo-*;=JSiWz37tZ1LY9KN&^Dy6VVHoITD
z{$`<?6G<J54T863j{#&;g5rD$uboJNe9mT1yQP5DihZvO6BsEEg;LXvyO91gg(K%v
z`5SLdlh!PONo3<<mh~JaZ0|@;fb3EY?CfdQ3)mNUMV2CofQ<<9nW4mPV`eNZWih8}
z3k_v}7je7J{q0(OC_AHEi$M^GZV5rr?tf#C>CX-DOgbAd)>J?^40&!dbGz3y-{L|f
zFI)-`hxguIE_17{4&W1}&5HyQr04`f`{&oL`^%dX{?to-JPtIL94G|E{ph1{h|{op
zVbPd%W^OBbfild`g0e(^ni9QGBhx1uZsIkLVRhzz@i9>pA6bY611VPoo4|^ooA-R#
z_4PmscX`4$N4z%RG`xY;%3K6LcW8#$;XQvzMC+M00bBYk6b<GJF4QL%v%k!n*p68J
zprQJ}^EM2Wc)DcT1f|b#Gnl_=m^amOKT2e1GH)V|7#pI}Fag#^6AVIt7w_b28S1;5
z0|2?4Q-l8N1YYuXvo<Lv!mVV)L>|+KWVQjx3&&7@`5^>{HTJaz$9#JBPU>hGjt8Kk
zqrOk9T!barh37JlMW>qK<IjhMZ+kukSw^4qk_kQ8$NK0prYe{9Q!ug8(E}4E5Ttd#
z2*gRB;;<&9LL`je_@nI1jvIzyAlecM9-{hhEO_!q0+7mh8_>|S0O8o<YJG#sn-ab2
z{fpI<q2EeGf%36?geX2UVXoFGOkEP#q#EeB#+VT@Nk&%)FIj||_;FXUHBg6aUKC~&
zi}!m%@UGVY6L<_YLQ5zn3rtL~8deWwfRI`vw8VM`TEde@>xVKxAidTIEdj^($T!|_
z`}c})2st}KODc8~OcrR}cRBXegoK!&B?IO7r@^znPs3*uny~vdz?7lKox%&XS%Vn=
zsHA2%2FDhDd#ngCn8$Vm`H!pY!?vaTVF^Y8%^Xt*!`tMVhee2xaHA-SCk94@yb)9g
znMkWFx$lJN@;(uoq~A5%#!U*lDA_ClPGH?bWAH-Ezi~U?)xN(ED+$tt^Bba&cJ+Fg
z$A0fY{9%ax9jZT`nb0H_;M8rUBak{QLQblubg#(Ev%HvlH`0X%$3=i2mF*KutzSLG
z|5C;4UBplvD7&rc!ALc|`(q5@#EBbT8v1SpVMus)c6jm+Wml9eF$lu0qyekm|6)tJ
z`|*UgJIw_g>L5@E$y1xJ6h7Rz_T=QY*(hkPC7hfdAz{ko7KsdMZ<(iKdsMiL?*K35
z!+)Sko_9HLqDtD}vhX02AEQmp#CXn29B20=6NB*38D143ew2Bs3q~W8buWs6gz*u_
zR>>L7w_tQ8fL_!DWBYY%|EEJCAc2s?el8MqgM6{(%`;WfP;NSD{lu>nNu&4<h=`sK
zj{bVr>48NKifH~(BPhRWvk6Ae<Q@!;L|flwV6D^y^dl1U3AKrQaf^)o;Z?B9Xo`oV
zp*MN1+MP3aEoFQR0hNb8aFg7!=|Z~>NI=S{`@+%O2)?gGRLc|-&#s7fPUS(K0e14r
zoJ!~l;{=y1knfUkL<(?Ym+C|bm#4zdH7OWCPSow)%EX{cC!e%?H+uo4To^VAi>oR5
z_=KCRF(PSNJZlm?7J&5>NHcK4O`^JtdTLG*&6Q1W6Q+SUu_jT=M@`we=nz(yJ!Jn`
zxxOenmm>&55QwIv;5YxomgfzaJ&*upIiohvbjQdyD1bf*df0geablgIS6V)zp|K{*
zFtq`0B)ro$e=hoOWY6%j7s~z)io3S#q>ZN)M67|~bvJ#a{`5l<>KUi98(wwqG`um9
z+_A?b?Zzr(qM}}QNS>DjwB0>2^Pv?O$D+Y)SzzyujoQb~m))v-LGLoz$w(K<2n+dv
zL}lKU&~D}%XAR^!83FrH-K$(1o?^nx_e4tt)5e`GfLkH3Z*C7ulGIX;E|6Gr*|spU
zFOgwF!b^N|zm%!ZLK{y!#ROaE^V&jZ-8g7>D%ZXzm{7fEtcI38{u@!z=vE?o4}{Su
zguIc_4~mc$8pSe#@}51c&#LzVoO5%#vgV+BxgMz(<CLA{a8{w-D4t-#c=A$1;&v2O
z^Yhv(Yu;hVh&xU<J=l@^MwO!-_$78WKm;f^gKzU0)I#V8J|_SM3lS(Asd+LBG%uO|
z!DlN->&Oh?b5cYY%zTcXUD@yVZ26C}YfFL{1YuXQB9GqxVoU57vdqW@7>A1G5t736
zvBvX2Pe>q7zxER7jXY?1Y&yiHyjaC+@AcV|Gq1HyD<OhP6idX0$&4s?ROmwRy|f&Y
zPwYQ<9$;Q!|6vk)=4uqH5mh3X%<)GkW|Wb=!y1`D#FhAe+U72>4GU9gy!LiH9V74k
zCW?TTd$F36j80<2k#=1LsTLO4nesGvbsB|oC?61*I?=u&DACOeG4krn5oq%IZNn4i
z*V(WolfPl33XV{dEiE(%%ex*eiA%$%ai`^|0teb|erOf+sOiGdrRB)`jHwWSl#K4C
z-npYR9RpGEDw8}y?vq4yY})AUMC{309)#khgm|8j@urO_!;HuiUbuG?g#=d1lJ)_2
z?naD4FwhTA=kTU*Dg)mJB5g)Gl%<e&g_wY+UNkRGT>0Wq02&LuUXZwgyX`_*sI(iQ
zm77b07(Db|D~}sbl$PUM51OX330HaW+4b(U5+gDNe2M-l^G2|ac_mm}o;X6kJiH+N
zs}oGvS*HF+*}3Ib48lNkO9V&^``=jSq*5#6AmQJBAZ``RV9z6=tE;xm`Dp2&{ptfl
z;d=1j*skoUmDsMRTIl$d4-e3*%)}VL7NwmETqBQmzQzqlOK*4W4N)e-2!sI0ls+=l
zXQF6${)%13p9Z$;MIS@xyeAAY>Jk8SjR9X+r=;IC1Z5>Kqo=P7c$Ru#;}4@RFg{xo
zT7c^5E4s)9BAf6i>e&GEXQIw|=ai=BS^Z^3^#At7U)4xpTu)}f`x;+c^fKh@wS&Ck
z?aKZP-hI5J3qk%5(nSW+E!jU*P(pt}`}QGTNLYebZ=Irb1&kUFJi1owD9n1hY41EM
zC{Tv3DWN6;$!sOg)Wn`W45c(f9eZMuY|Hd^JhesNo83%!o=zt%^jEKvS=x6&1?O%|
z^L4cdbj2*4L~qA)Tgp42MH6wOBf>Rz*>>V&@5wDS^V9qC67EA+UW5BOYb^4KgFM5;
zk3=knL^P0s8BJy`w@_QKCqfViZh3|sEWF+GGVpsX)(xw?@`T><4`t_q<1h>Y(JOgE
zW1Rb6th`3r6{eNK1&HO?n9nf7A#1pwjBKH}7e*r!iOjtQ7uEpl9~svY9vH0tXVy6a
z#PZ^)f&I3OYl&di(S2Z4Eu!U;_%%qRZPWW%(iP9r3!w2?^5C^PYu@w@h~Vgy#3!tr
zJ8S$x+h8phf}~Io)A1_YjKdq7k;^Y1*KmMhM(eH8J~k3;%fJ>Fy(6cR2(9Lq!?7Bs
zbL(M13Png8uD%|Q(>lM<H%<d)rySJGT-qJ7S?3q#TZsA!ITXMrm3qTn7kg|vU&AwA
zR8a+v+z-j<2PA*LENg6ym{@XHTvIhz_C~qEv?-2gOcxX=V}3y&>bZ+HW!Bk<yh*yb
ziWQo_8r>38)*JyMYInH2{K<lU+T9el;L-;AwVak(2`|*y<vgbV)<Hr*HPTBjj4IaH
z<hf7gz)={9a5!hT!m8Z>I#`Cj01TX(PT2o19rVW+rN)vo(>kt>-jPkNcV&7|XE!#%
zp9{J#22+OD(|q>;p6<qxF5m&`+4QFD400d{K_K`h1s(nW$Ch$WfRhZDJrXl3(n`}k
z@J*ZhG7|qC#Yqp%KTKtL*HhgyYbF&M@Y3VWZ>a&N4qn#rL1XYWuD|%H=rN8#e@ByZ
zZ)>fxWdHuM?X0)$W(CWVJ42*W<S==M+b~|I<H5c#?v2(e-^0(BKmD&Rh@@~f723T}
zx;+O5sPP<z7%i&Hwkznwi>JY~eYzVPjl6Y1{T0O(3D!So!6C1WVfjv^)Te?9Bsg!;
za9)gz*w6T~<k!GK54s`hXW*G9P))bi_Wdp_o&|H<;}DhN=Bo3{ANaat4@D8GAm!m$
z&kH%D5ZFsR9NihKhUi^nMr^A{2#JJNAjJ+V>WO(%F0rd{jCvN##DZ*~7OslvVzyE(
z0FG$>BWqY@w&%1OGjX+mkt8%BFij&_7JcZ1>qg~E`%(y_%kmP^!`9o$QAk41gRyM~
zui2o1Fvpx2(*<Q{@jMs`iadtyaG=anYy}3sXdH7mmWUR&Yc#{XIsv}K{ZV#CM-0Ot
z3|+}K4mkTSR$l&q=2{l;_1qW`2uUIhhOJ&kmIDO|_E3L&e!m_ZSukdgpD_wCa_UX|
zKRS_}446H(9i}IM%~=I_8VEL$U>u<++yQ)&J<^pKU?(8$gase(`r&W;x@Mu=T4QTe
zcH)BKzKjr?@>0G8jn1bLr+{8Lqo0Tjo!*sS(^)l=<ou(?RE^SWNd3u;Iwo2Fm|wy{
z%k>^>7i6^>1wmxQFwXY$Du?hnt%~1wt|D6h&~sdhrRvNW#Ts2eNxnY_&3GI_v){J;
zrTqPRa`N4}mzP_#uMNai`it8dpWOAXuPL2lEcw;*wwEIv8&VQSgF_;b_`<3x+xi1L
z8m%jGoyQh=FUtm2mYz4pc$B*G(7lm4BJTwWcz?o<D9K4*HVHb#eI&l<<!N*=Az|0K
zG@`aN%8JN)VdGQP)7_b9OqYOZo$H7R4@-Jwp&X=Yl{L}$3nTBvvDsLUW6GvMP-yuL
zzXVB+KSretfpYp~mpCkqaz#Isol%a&FbG4h)RZ)#_rKWs&3*wHX}CZYRU}|Ab}Tuu
zXb1dYd}D`BMnmq(BJaf))QOh?rV>=1%ym%kN>g{Ng(eLFdcsANs?*kqtQTj|$T4A1
zB|0*Pxl;-4L_EXuPo+JqsIo{p8}KQzUX<e8Cq4-%RTtaoe_N)XKOL{%iz^=~?*cT`
z5mI9|Zpi~k|Mt1{cydb)(u|!m&$Qfs3#1}(v1S3*oogLwFVhvjh=08-RFqDUbq*X^
zFIz|q6|||C-UZ;is}mVJwJ#>tqwvK2sonwBii|jNhf7Kk`>?S%4w2C)-XiIRE+TS)
zjw#)B5V>t^(^(|F><?WPF?-~tN{`t(6-%VOAXULe8CEu<>L>2ic=RLdh3d^%Ezvz*
zb>r>sh_+bby^KvUYcQJTQ}Rhe65A5-MU~6NxrL$*1eLebcge&T<tM#$i*~>$*z9fS
zcbTVas3IA;&NV)^1V8<buZNCxs8BTqfPx2l>JI6(^Z0wPoJ5XF07`-3!fCZRGQW)=
z{wTY)BM3qe){+lI>A$f{`~$q1rGWDsS0zYDUL!l#Nm_9uR`tVIl7}4EDm-wRt3cfP
zDl%0{US;(aDRA1Rxf0;KMpBKm0hwuM6wr~4xW=MLBt>=Y$JZ-B0&@jGmYf@jyA(Xg
z*<|IS^HdnNuqtg8D8{NSmtqRX#8Y92Hk2LSl$C3_Ev;8*6y^+H8-5Gyg|%Q;;bWZ(
z4}G2sa}3#Ur@r}hEXZKL@&!ZdyCG~(a!cqAr)tSYrx0T;b|2xg0K`R{6;ewd$NT%>
z5{!lJ;})Sa{y}$o&M&wyO0X5;Qz9jh8$iJA0f=gQg^@>Wbz-mVKsY@;8^G>e8F~gK
zdF1kPm8Oiv%j{PAon9)@SO}>g<sy)*Fcjp}yHGZlsPzIQ(@yJ$)ELRM*imrXm7w;r
z$UY_*Bbts{#b;D@h%d-v>z!*kHF23lZpqq(37=S0BiCJclCt~S+x7DAltV$D4MQ6V
z%UsN76QU_h+H1nllX4DP0nkZCGwxX5FDLPmFvKy34fhlW82*U=C_5M2h(Q>LUI~L2
z$o(%?zpT_<o3zqg0HGu%V>}-g?!v+ulioirV#@6;w9Z0%p$fAd%p&OzO<6QTxE~(v
zn-DJQR<dEE;u!=I2I|K_Do~}|3L-@>8%Pw}Mmy)NCS2Kh=EU?32REAID^AoC`o}>c
z)OO*-1n!t{|F2j3c!>O$$nocvOYG3zvF(Lv)_VAfx2Ak_Sr8xV8gp1wL-Txt!k%;L
z5bRdm<r;D0*ZKa0(k_IUn+)2KthWbzw@s+*LWtp-cpAf8+VAr?5}tA&8JurovmhW%
zuNZnO8%}l<478gQWM~h(O+iZL-(;BBF1;}pHa#lvL7*(m7riGmikVhC;Ti4gs@FYB
zAUk*_!UT%NJ3ipVMhAZmWP}s0L=Ua?M&_L?X>S#YZXy58GY`hldqIImba|f2!a&qZ
z>=5R>STGP*vv-|#2=`N7GKcOUrh70kKh^Mi?JT^$k$S-~iB=|p(t4#oz69B+k6d-P
zi8|o0AK~!UXA{;<WfxCnKw1s3kKgIn$M!?nwd6nyg3v2fd{w#s#fIl*0%%f_>1Gy<
zX`v##&vn7q=iu@V)XZE%?97&wEwq4lM|Vj_J6`%ASSiHA;3sh6_0Asp!ihec(6)hW
zV~<GY(ZVzK3NVBul6dq^olU+NLR^=u!SdItW7=4#ywAb<wa_1cN50TcheLN!{AF4H
z4c0<F2a6#Z&Ntir`=VdS;RO~V&Ldw2g*X|@9Fpt!^a8JU_M>-ffr~{=zjkP%Jq3O*
z5QNZ#Vk+dESm}AtSSw&BfG`Z~_RnIEf3&gkrdrVRLr{UC&s?Xx?3Oght1gTKfj|Nz
zGQG(wM7br3_9}q65D+jH$oAo&Py&fzu@2Wtedqx&bPp54-7P{|o{p}9GafwtW!jp%
zUG`-Le`#l(g-i@KLp10l8Gi1Tc6MDVq)RXwvND6*p1~e)?q)2htl7^as6R0+xj|X(
z1NpQt?uW<0fI>`Lr;+1b<WqKmUH}h-!5BKV^At~c>ZGQHLM<MwhT7J=CSdw)dV-l$
zBF~Qof0SKq4#gk{yOK_ZdjE^P);|ldC9fAS#t$r5TB?gWEpZ48%9*}R8F?juyV@~>
z8weuBH@OSrMrKR{j9L3s_gCfI3>P*qGGp)@;I>c}Zei^D;dlw!I~JKS(*YO}JgDBX
zt7~HKLeH#4Y7COt=D^Q%5N@^Ua0q`&7O63aoqz^DjGT?q2`5OcS#l#XQq!>#EJwY`
zI|vRhmfVP(mh<g2|I%;1L=K@>+oB>2yU73#u*P$|IJ3OZ`g7=+>H~{eit{_AXb1MC
z>|ja-krMM;mlp;|y*ydMTlj5HG?j9|ObUeT=b`u|bNBY5F)tj2NQde4r0VQ{-{ao>
zKVz!TS*H#NswjJBX?b3y`AzV7wn&D-_8GOb{3aoG*9bH(VQ5QQf#=d~z~;yB<~d_R
z)Qo%>x~d{40n8sPofHiwf#znJ5Q8N)*2@;ju;q_mIvX?1nW$(IH~XlD3|-K(vzfY(
zI>p8vv6Lm>`uCvRxk!jP-5P*$g9)bBfrS*}p~L(rJGUH(K^O>L2?j&({V%qz?8h#4
zB28ZaA><H0nyz0BR;06$aN*~$YP(3tTXrJutwyzd3xpqVgH3q0Zl@ZiW3Cnf9T830
zQ?d50oW`k0V>zDjI|-c?(|;jz*{_H&rAj@OFT>+Di&VuIhP<tMj0;ypQobxA7XWPU
zeU}D?2`Ng}z0iciyJ#{c|7y#xhp{tABnn(}cyVQXVag$&BlnG!8p2@QBS&#BaHZ9m
za7J-0AUbPnS=A*9_$fOLUp{E81`zxB-b$G#*lF8o_cAc*hSGw&u@}I#3tn9239bHV
z4l)~YY4xTaN~M0vUU;}lp9S-xHA+Xsg?KwvFFYuTpF{lgyAdMa&`DocPG}?KRh)<M
z<ksr^UO46}L6aKIp?h?QHCfegDZ!DLeY0I;sP{zfs@#q)_^DZvy)Xr*`7|~MlZ}GE
zUw0<OOWTY3-;pN9Pw&B-OlV!qBzj@ez(d8zX7|jn5dn}g|4ClhGm^3Eiaf2~ys`(t
zS{L^G_Z|LFc11@NgCJ}rMX|d7VlQbw-U;@uS-@)*HDE}dMWp;Luq?3WoC#P6L_80S
zm(G`Kq`s4;6?5c#Y+b^P?2H#5n2L)oUI2<MMYVAFd*HhmZ5pt>f#EQ8PEbu5`qjs;
zRza!G1H;8A?u9SAD4%>_xGW{o!qtb}OnWsJDOqP3A1p}U{(h&p;MBBAt36V$5B94j
z$esC4aiMAtS%@~N3e<A%`1d-N?;Mv_3xyDHCbzn>^NI^<V!pFn=vD5<QZlP@{lgc(
zj{Ax;g@n<AyAhc(RLC5|PUP*{1h+^JA}^H4MDm6Fhz}!KtHFx0Ug5f<5(_fY*~w`{
z1Sfg!rA*3x-|^*&LEHe4Eg=gl%A)Pt&W&<^^WxQUQ2u_}P`-}66I&{a^mk2jj&?9j
zw4w|hNS?G59wbT*K+jBDD@q(&XtKqv#`gBkrlX{JDr60ALGug?wHV*XsJ$Q9BFcOO
zx!t=A3;f3H^w1bA9QnK43jimpWR!bBlpMB<@N(^cip!6(bIYL^1fk%TP^7l|-`Him
zUqYM628b~}Ko4jB(lwetY`~XVdhWD73b%BSxsViMM}04;Qhwko6ebpQF227fJlM7#
zX7gijmrCrAds3p2R457gctPc!7it!?E{*?u#rU(Kv3ijK7tW{P`l5Wfc+%~A@xejk
zIT`oYoM?}HR9XnSXIq|q%#%@nM&1)p!56|1fzYmh%gbF;h&^KUGcdsE>_<R6@u{eC
z_-VKz>GI;&$S2yad4Q7s3>=C<1DM8M9N^QkBULZ>%9sYk=0dvSoTzfm{28TES$}sZ
zfBe8-wxA2(9mm}Z9$mJpV9;dBoU}mLzjZb(z(PJU0*@0H1Eb#;z*lbil7eE~b}5Wp
zo<pPFo?eH7gRm2p`Dg5a<P>}q?OF(@H`RZu#MWRS1>}`iVQqe&C6l0nbG+?p7!bY4
z(3ImU!z~Mcp%#EhLbb_r2dsj8`t@E39kehw72*vy{5ETu;asT$0usrucANB7+v+RM
zi*FQ0z1uO(hI0*vlhAaSl7{x9?A&e`2w@=DODZ@Z2Gf6I@sKYJk+K~i?f^e#*Fw;+
z(=c&!v`7;>*h9$;B^N}JwzDvB$B}P50}tnR{v5)B6A3dLzK=ea8D=@NPvwVBC=7KI
zZc~(_qnrbQicmt?Sr`W2#F}aCmzzHR5da=bER54T;Vi~8lfCC$$?kR#rZLhZ)(Z8G
zkm`tU9^n-3Bn*zA5X}?o*h?otDIg>eX40U-p0F`}`qX_1O>RprF}}1LYhcv41UFSM
zYBWn|D87{q1z#T*<H|<~ZhAtp7d6%?zS50OJN^F`?5RK+;RWsZcg4}|Fyj-pV&`D6
zrGk=TETHuxGZ*L#+cB6mfwFr<zaB3@{&>Q{P81A78>)@31@bL3Qa;_DD%u)IjdiU1
z={YKBAuLTrvPnZFBF913|5EK2E{&dqND<yeC<I?q{Nhnjg`hN1FtG^}FEp;tdJ#kj
zwWi+`jAF%WI|YNrCT@XN3;Mizf)2v_Ke7QDmD2ZOVZ5K6*Vl)#YdeA<1Ys@tVv+tE
zJK}x`+{~r{$MFFXL-Kvffdb=4VZq4?&yz0`{yXkX{T%8EZ@tBcRhWedGjtGy>E@6E
zErpH*tRMst5nh8Dwy#D9Z^uJLO8!KHtlSKkBN#l;46+yGVp<MsN{oG9IOz+Gp}Jvc
znW<sItVUp+^?@=0M1!`&xg?6(m=}+R!VL0<Zxy1wMZ3tsRFiHFOglo4K!%S)3(Yne
zgZcN^p(<mj?Sfq@5XMevT8tSxcyr28mp+Cpw)5d5;9=mwI9PEsi<sAoKQKa}Uv5>H
z4vi9X2z^j~k@=WUi<=zNAVuLDsL)brOB0NnjX*9pJqA(q0nh@w%SORfBtp|okZI6;
z_vE?Z@;s_`Sz)FfN-_Xj6B-N<fU;sIndQE3Bgn|p&ouaG&#YQzh=XlGn8Khit+0yn
z_f=5>V~T<n#IZew7(^r%xZW%KtrHnHxFf-p478IDsgcSIRSCFZGc7l?`aL?y8d7wE
z5i9cE$sc9sb|W|lL(z(M1R*x0py|Jb^<lnj6De*0MFjBcK3H0QaQqeCS}WyH7XJO0
z8yuAc?1_C+us>_uc=C<|0Ht8cAs#ma!;Dy?z<eXipkUJ}9yIf3IcpJj0-4Fwr>nrZ
zlW3YW_vm85Txv;t`>y2u!8B<+7IA4|>LS5O-M|6|Q9Wqpw%d4*!AMJ6a%sK_G!gZH
z83B$(LOi=gM>$v<w!+e}BJ2-dOjeI;OJ}YC#!(NLvHQ*7+9DSQ9GS=73Q%12h#6w;
zR9aQo@%H!&r7*hI7W64P;BU@{Wv{t*tBfnu17<9-QML0dTli>x`smk{13k$~ShZC3
z+L}4J;A~phkD%QvAi(WKwH@i}gB#52CwqAcfv$(5nOc^5P~a|zYN*H0Ak$=F1>F)#
z?R>urPltN^4ER}H+nWkE(Ze<TKJU~Z5(6v6PRO(K>*T|}W@SG{U{!%?07<fTb@#<%
z^mS=Z*kvDXW(b`KpN1a=4Knq(nz_1A=+pAYaAtnl>DQ(Gi~{x0iwUr$33^bdJ9Gp8
zQ+7r<5`-WWyppzxc>jwn<@_vSC(Q*&XLJ<d@#;OacdRe?$!ncDn@YQEy_wh_-a>Th
zs@viW#eJB_x6qjl;(HW}E_-KE+*aYz{z&+yiPzLHG(Y-J2`n}CgPueOM7*X3jIbp&
z_&M$e>G}fYdky^@Q$Qe&lmQZZI$f6W`#VFtsD_Ij(?0qu{Q_QV3EL6zq8dwUn7ey)
zca`e}+MM~VeaDcSypcf;JFcU-WhSt{6R|)*;ZJR-NTf_A{x4oq!{oWZBEm@eG;L^!
zUV?Z%4J2W^yc!i=?ydFVi(e!AE3snEgK;w8?WhsUluqR|j^Q9(vqRZhEn0;=i8_`X
z-Z8S^yedyN%F}UoB=VYrp#)(I()1`lexa|=mrUS;p`=J2DJJ)>;|q!IHL!D#u}sWf
z001N^;LR}Ho=6Y8gG`}NW4i(>d+fSp4h?T11Kh5%ZWM$<Wnv_RDDq!FQ)%2#zuN4b
zb69s|^2X*Jd^gR_PEZN%_=#t%c+m_4=N+(EshevaHpKX&><n@k3PB)xB~--k{V!I=
zE*ij}bhcfXpDHLgz9I6x26``Kw0Mqy-D|c>a1bZ+te8QxnSx?J^(j5?Nfd5LF9V1I
zYQc>f90$@eHuHbP=FIjz1m{q!H%}JDeVjnvm?m)OX~mw>3Mj`5(2@v0O&!zT&ub<R
zAKYMEk~0x0Q8Ob04rX!;4<4KA!bBv(MOQRq-9zxc#42m48#8Q*LLen@$X!oG6RgE7
z>Kzf!(%`@C`|B?>e$)|S+0AI<>B-Ymk*{blAj(xQgR-}%mq88N{YUTvZrU;-$ln(A
zGM+KKobLjM!sCNcCXm<wXVP|W+#Np0`fy#&iiAYOvWJqW95?bYTA9O65c_N<YK5ny
z!|Pkev+ExS%j+k{JBtZP66oK(7p2{mu=_f0?8`_4dKvA}sjW^Qv1=!-jNx_<n>O%J
zrF*^!r%j7enP&P`BjJ_%7WwO=--fpIz5)&=ik`XxJYR<<>h1)NIad_j*Bp9|1>dv@
znt&y4%<!sP^+VaYT?r6^FtjB{d1(KQE%6U<&u$u+4+jzDlEeufWlVSJ{TRC#%fyV{
zXA_Hj1naejDJFAY%hZhBv(Vy372)BJcX?uT(=s(9kP3+<nb18Q9X(itzLynl1~X)l
z^sf1lb=By@gr4WWs6*YL$Qc`bKSGZvmNGUINeYDE5Ol^{bT9>f_El2Ddq2*qc`eTR
z=}i<IMNS68bVFdR5z*HNdl-)t^TMrR?pvS>0bgtX+fDb^@8*(JpeqEKJ(NjRoSQKG
zv*N3ycfJ|M9daJp8`FutN&#tB6ira40V~;~*%!0OnWOmzd=4Td`PdB%pVVp;kS0n+
zw3=@J!&fi-36(_4AdP$$IS$gpOZRNqUzsbccW_jokRW($Y+pXiMkyNF--*2)Wf)A)
zA9M%Nq_zywED()wtB-7C)tOca#@aGO14Rc#x5hB?FuFY!5gfaSXs`GtCaHZdn;kSD
z)E6x?G%()6gFmF@aEw>OkxjJoGDHK$U>+EoVzNY<_U?a&VSXq(w_FE85Dah0O9yoS
z8#{cyG=Otb(syD~Wzhe2Dtmy!PGIBN%QiKNgcPn(=yje!gB2OZ#soy_%ps(e*H%xU
zLD+h{*^oOt*+6p?#Ixf0Gd9^hM5pqbIrgUl1bOnzJZid)^yv9yqR1>beu$^e*bqu&
z2ks|2M*?eRfypMGIKzG0y4)r(%m$fD-zdzZo;YI{Z>x$ij*`!vd}b=2?m(L%U<Bm=
zW}<6cu$lq`SiIAW-By|vZIE&RBQKGeg@YJqGuH8KWNe4FrM+EzPzxYJu$!TWqCGv%
zO#R|WS?Q-c3JfQz6*)53ky*#Rvg}M|6TnH^B{I^ZgjB%OU^j#E=CQqkN*-W#|FG(p
z(i$9R)+XHrcRaf@&(_lPSok9~7|tj(Ilcj)kRvl5N5S$^TM*#enOTZRdky{R)Vvn<
z!>Q0^vHb<bS{Fm2Q7G*X<N~#UW}scZ-q-)dD!djBqKeKO2G%rl2vQ+QK!e+i&AY1~
zqvM4l{9@o;*?56hx*qFKyB|r6BxK!I{YTju-B=95K(HkOA%^}NyB&V=Fyw?Aun<a&
z4eQzS$PR?@aABp^LTzoUI~>6sShdr5V^9fOnrW|^Pez}=BF_SvLBLK!{m<+7M#CF;
zEwoudgY1G_r|%B$qSX(t2O?+J6{$Tejal=4FNNNDBW{=TIzym3=5TTCZfiXj_^4<3
z3>gr|FvZ4V^$ex_8QS%T4Lu*Xu=Rc1eSen7HhcWx1N_d^=I0GCwp>qOr=8ggIaGDF
zP8h5GgxvAD=D9dkCwoH#w+ba~lSo@2^n731V3@+U#rk;%!3vyNo=0=x+o~e9+FOkN
zOB?xGvol(%%FSu$h|JPjiUs!B`7Cu6GKKlj1UzM#&<f0**esjDN~d!MDDw|{sAZc2
z|F>h&6lk%`mML~#pF&DWfza;70wk}}KAuy%1H4B<J2uokEaE#r+Hx(ALxGzK%Z?1i
z%#bp)+9lpD@+vh8C{@kTXb{M$lx9RkJwaJ=o<&0Y^Kjha(Iz65+wge;v48Y4too0#
zbHT9~1fl4b>_epPe`CWj^D-mYq-?;L)*o;=myQ^cK<GMJu0751zQ|{RMdP33v+M=*
zHzG($ib7q)0*uCYB*iW~5ny~D_DwHLTw=c{;EOiR?q(LV38j-S&}c}-n$iO?<OXPx
z_GDqZ2O5pdo3+im2}p1P-4u|>CZYAosJD2;PMnbs?8=<O#i#`Qf(@u1@{p|{ny?*3
z18wi72T|ZSXE%oe<i>VUjUw&@SU*e_ustok!fmjFXv8n63ws3IlSX=<7CK2SXlgiC
zF=B@{s8{-jt>6@B|3oz{wU|_<DB%GOecD$qc0(g~?iE&9(9ifgXe?Cdh1CCWfJ$L&
z1pN%01a!s?ODcMc$D4^i4n7_~trVDu)<Z@{+e(ij?QEIlSUHD#hy%e2_ddD)vQy8o
zvFmZ<;Cem%Sw+<p?WknrtrgrNO#_0>Z|P+TNWJ%?2i{mA4%}rk)QR!(U=d4l0skw8
zzZrPH@_cJ}U}A_{aPp0Z!;s3*->vsU*|{c341z%TN=Ag%`(JEncYmy4s=@`BOln4X
zbbtKacuGcE6U@ocY)*^{hDd01`)>WOZGcz*68QC@!+po~a<q-Ij+hy&B?Y?!G_1TP
zkKFdUJt7Ly{96hx9-P{losv&KpJ}=DA}iaaR^eR-B;w+VPXC0#E?6FAHB^4rfeWk#
z3SW)HnK?3xpg{UWV9j_%wL7nTC0)LFwqFA$95=-xWD1(d4Psk3L@fLtJ#!|ol?Hsu
z^7M<3{WW%I%}`$2JnOPak?zI(T!|gjq}cmfxXyOvcB52|>{CI*d9V3F!cn+re_D=R
zxC+f;=bzXIWloo~gI=(D;grxcl|gEuE_yF}E+u3Xidj45q;nTn+!>`&bAZCE40ei1
z7u!gbZ<*y5SV6E0oMKWc6Neb{g)DF^EWpNp@eJ3wb~0=IrtCc<pYD-gpSYhYbdv8q
zwWCNi^&x(->7OGXt9XgddB7DuG!S39frZm9=x12N`}b&Gb&n^N+@oNI2Lk_a89LU^
z@h^xw$&kVy%C78)p%4VN<cZjSW7#!70W~8jfMH%xLHGERv>gGL1t=z0?Rg&oYl+l`
zQ$HNskc1e-^2A5GCajK>tSC6Nr9va&1Jy0id06yJL(|`>y2(e7U551iOE}~Vy`;&~
z5IQm*4)4I9r;goA>TIR3q83l6_<HC)2QE%u5?!g_kLyTyzPK7*16$xs&15?y&21Um
zZ~J|uNwUZpBuh1sDVPEJI2^43xy@mrGrHC^Mhcu#y07eW=<5fubS4yW!*)cBr{9{3
zM7mM6Jc@}4ZlM?IZaR~5Bww@qmdhn(D?X*OO7w*vbPa8nU*}m(A=W{Qm4j4Vpo5tn
zyhfj+#6Gg7jbX2mTM}o_q!f>(n=)<Z<dAfrHF6G3gG_R2!wf#9?gbqXHX9Z?!>m)I
zWo}xq+VR2xxrTOZ3XJyzh%{bT9<+KT@Z4sBGu%7!Y?TKgJqh;Efz!(3X4XuI!tNDa
z^%3eHC~FIw$((<9kF>;t<i#268ra^1HsZi$!|w}j`wje|>|Bo+2tgp+k|HYf-&k0G
z1;m-70p?<2c-+TsF0A+r90<0fTZLusqhEF1@j__v$P98Ij6v|8sd3V`6%4|~6Eh0s
zC<eZuR@%>mjIM+xk50m7)3OTpJ?R$c7zJYqX|5b?gk?G__jz#gqBq?jdq!q2NMV^}
z3V57t<@p8HO65xo7ER|AmV)TBGVGQ*s+@GROJhs1m@6&J2Q^vOScTyJCiY=1_Z&^E
zPQRz{dA0it9VRprn>8@SR16;yg0d1@!?G7C-qg1N)r%OK3yr<}aWmH(`uiMSdUU4%
zyD?EEfe%lbs=^ae)D&zAaWMPz`}WN(+>Qvzz~2GbDD@>Rv8Es`oJUB3)<)Q0oPt_T
zrqEQN)g-t#S)bj{&q1(G@#UGHfqeqR!WamDIK@u7jkc(88as5DmP0I8!LNCZFR;S%
zk$wIHtziE_YeHQ(vHK}q3~xryM>QN6m9@p=3kC5C>=79&%hzD*V4<$x64j(an<*ZW
z>F_^<UOmGb{72cD-9QY&K(wVbN0{{A*!pFEHg+Q61}sD%_?RQxycUi|i|l&OVIXKw
z%s=Q4wStqNf@Kq(VRRt-yZ~ieXr$NBK^J&+a#4Sxnq|Y1Q3)K7Y8Mbh$RExKV^pD<
zS3t;obc)uq7eOaGk|!U9sfq$f#xJ-I`gDHueCgR)xpJlzolrbvg9~%EGvDyaj)d97
zG4OBjpPm0F%<}xIz?0QoVP;&0tPGCnMm^|x7Sf|TK<1eK9Z{?WPtY^L-U<{w-Qh8~
z7B?E^bRqIa7mjof%7;)^3|~x7&L1Abf*XbI(3oS|VkGPPFfa}uI~||b(D$~?yar4D
zgNEXjm1M0zEL3!A!ZjOX5z@sdKw6l#=?@rl89*)2O@2)%V?X&s7j&K!Jemx-q|O-G
zgl(qnK&M_~2dLWky@g&-^s!R?)Au<|3KmW50d|hv&$K{yo;$(cmYvWsc-Lc2iq%T)
zn-?gp3X(Go<30+kWzgdDvJ2X&3Wymh0OUCq+|#IDHno#Ye<?e&9EL#{3SKEJ26O+5
z)kD<}Y%0YUKvhcO?fK2`U?-SCj0%AVQci@-Gtf$$?Y5fgwkI5moxK(DFfBnFRBt%5
zTB|7Vl}7BPz(~0AsngI@pzv$KsT1+L6xY<|?~m3CYtZ82WWyxnr>U&TX=r-EE@(%A
z@m$D`ttX<F)6iH2U~x+nG|Ch2$alZ*_1TUp3ey<tyw3Leyo~J=_s_{_3hp1BL8N}!
zvBz#?!X8GQhz2OESZz<W@kH;EHs8+`RNVWBNlvfbf<X&@aV^uZavGY7;KyE;NA{@9
zbqq2YnG?`(+3eG#>}>bgz>`cgclw#Skz*6X{WYThfL-d$^EgXI3%mj_5(9yLk<2H&
zNY$a52A^+sMO7~*KX!EDN}uu>EClWEV;Ff0UI|8#p7NRPZ;GcJ%Ck$lm#Gy`@eK7G
z%sab!TH>T^B;+l6N@q&h>wnmV4hb2^Qxe^)Q#Vt{P-U*lD)Eh_m(Y2t12);Wf54mV
zJZO2N3IBWW*{!Ki1r^)PjR1_Tj}K*Mm%}g&!r&{lB|pvmFE+ku(j*h4@U%BJ(<%XG
z>`G`gY--FrZf=2h_dZu%4%wwJyeHXq>tT4cIiD?yy3`34$2*+T9!wha32q{{B=Sth
zqnjW-3nKf2=0^i66nF@23dM8WqA=qv8wD-|iP<;O8FvA<rDNd&ZZYVEN)G{@y<Ptd
zg+u|kP_q}sCJW5dj~NT9FHZrubbY8`zh7#e(MJWh_ChvfN2#+X&b@}bP82n_LN?y)
zVOasVEXf;1s`t|aotH5FwR7BJzl22#M%!)J4aZMOQRlGLdugDL#oziI;DMsv&Qqbr
zOI$BZ73h+p8A~gqLfo(~#PTmcZ@sIVw_FFkkcp;oCto%O<I=xKW*#`rM9<!=UO+83
z71HDr*Og|vJv|DTMW?Vctn#RML4}fh6d;Rv1cOFAtOjyW2XWIZEOkP+uSO1PD36lM
z=6N2(OzA>}bwN0XjzjtR`;8yU&M@0T5Cp<o!lab_Z|w2){uJs>HsFad1z})*EWLu_
zL2QxFMOJnXs!0cjpD4&LzdjIe5{B2H%tvk5FKm?5KNnq^{Eh^fa!*E>F|kMAkT6}M
z5FD02*ej%%?!h2Q#dup;0*7mC#-urw)IMtG@tt4^G+JERed{G;&MST0u^wRwKtdoW
z$m{qP`oo64twEL~frq{FtKy%0+zq>s7qyT5f!lbPtc&IQ;h=@NE(Pfu4+NW@yu!u-
zJ=><61jj|A8g)?G#3qk|lCZqSOqSX`2i5mXCIgESXlS?}q^SR57dp*tB7KuU<9+6s
z835A={;J>SV~0`#jhKwoRu!I#BVKIho0n+B6Q?)Bl&14GDeou1=xd%w!tmh44)r&d
zs(8@V>#R()Z+Uq&C?M^q=tq;f^Iu}3Q@0-}+Jl{PgL-xvoEtS&MG>`sFTFzK!A|-2
zzGpp4r)n!mt_~$AO&}7^+(F&RJqeV=iSEiry!c1iwdFt%g0L%%;EVfTY^lj+V_7qD
z0X{ktEm+#EG7TNQ2`y@V3PBqdzhX<kL3x06V5I_UEM}v=*F9pv9MbR3+VB+AgDZSb
z0I`!u2pzCqUS%1dUPOQ&ahUrMY{Kh$`F_kl845iC#I6K$?qJnBD%eT=iRHZKktUpy
zi{Un$edfR@p}ki=VIdUy0CCl5-u7YxJO%;Yb4w#x3Ix!zVO_63zg44e-I>6GUf<Na
ze@p|xd!kaJ%mfx>Dp>F)WKGs>I&Uf;v7mXsAl?lDb$)k*2*3msbkzwg5lo%F4x~$6
zR6as6xXbPxs)GmWFukdKgo1~RrbrgV#tozyVTSW0;5f&^CwL@98$p2zie~;7Sc}pV
zNsvpjX7RHI5@^3KmUUowa!im*@?|NdVf%P3X(}(2NP=3DCySTuSj1LuzD9iXkp#6Q
zOBN)yJldr$>0y}bOM+UGAxkl&gJMh$31T?kB|$BfJ(7x_?;x1SM3eWrM=U;+om&#b
zAP5Anlz{lS|HYQ}FR)g^1*}~v=qSw)gr(AD53%jXsAqDXCsGK;QCdntS_Zy^T>$?B
z-3~fgT1r7$2EgQ|)~xiLjemTJ6oh4<OPJ${b+9csjcm+Q(3KG`*<F+UHrh$shjov!
zcxKxkouz}Um<h#_f}{*w2_{xXXV^9Qd=qV1kd%Qc>1;TD0ttxFl?FpdK~z4O5)oG=
zI9Z!tYBkllq#!GwK#4FYaWVl8?0J0g`Z>lT@Xk#@6`T6qaE&j&_!x?ieReSo&$#7d
zMUsxpg0QsXqlpwmq(u)-Dkczb7#R2Wbx(ghFe5H(T=M#s2n^aXC0r1Z0UBw_OGy{K
zy6wL3_mz*a2qJQJYF-T=#}%sxQjm}qd~h*tV$K<ll=-+Uh)9ba=AK<`b)HQ6dSCV!
zhi97ML~(B%472?8Vc}ySf`Dw+r!m2ZJC>%NPAv$?;I-l(!x%WNEVlQRrUYw2RR*gS
z@RO#rYJn>1kFqm5f*1sWXiHHdf&LpimOqzs60QK}!X)~TWij5}r9qXtxjc+`i}6Lm
zOHfMEA`PZg@_2ZV01Uhu?`s~zu)8~~_+1OxmD}^a>M;U)E1f$=7sffC*;_T<Z-ii1
zFvmWDDu!k=^`BV*jX3DO@KB8TxsYFZkr_(^C6%qGEzZqbVeRLv!;uC@>bZ>F;7Da*
z<S>jGc326|a#Jl0jC`n&9o%%oo){!~72iQ=U?d4d;9nF70_hRD2utm~fsv#TnR2I<
zEA%1$;SV1}K^G)hx52mwcyN>oximPEG$S(`5#mz_5JBhPhn0_^SbX1L5HG?$eqF_!
zOBx)>ni0wJ!i`o0H@<w421l}FL}fU<C{w8?<swQNB>B)0w<6P0%v6jWea!;w(qKta
zl0Zut=dwC1)~clSdo*k}v`s-_&X>e^$v*;`23^{*(k%^^B;Ck(P#~ETzPqqZ<j=Ul
zlE$R~H_I8`5M+<{b>q2zl$}wM!!QU#ujB+_<NIH1k#|30h-X6&;Av^nK8PgV&qWlF
zF#r~R{c<idBUnoTCM}FeR??o*6fGL}RZD>-EeuFjuhN&9^h$s51(>uEL;i=qVKgV|
zp4YudfhKoF34J01R3&2Q%qln(U@~Y*=yvhG%^V@Tk(pmkK2>8Ln>G}%afat^M!e}1
z<(p|wR(=%7F~~~%*I@Yf1X>xjEx+XdXCFWOQT&JkF+QXuYh2p75=M;j>XwE8C=laA
zOR_LuS5Dqs(wbXR_Cf&}A5xM(iIQ;U#7xDP#Z@RUV^ETKGt3<t?1%@I9~S)xg=&P@
zg==u9ASZA`TTY@VkYrpN#D~#F&l?vgCmjhslccmg0_9fTwnLV4@y3_MV{$rpH-JyS
zB2<lGL@)jceC9}LVPBAp+kruQ6UV(AK!HLjWV_@*q^5=sevRBo2LvtD0=v(${iY;%
zx6SCs2sqF}G4>l!I8HVvc7LS?2wJE`;7G>s&_s6`(@9dJjb13m_@V4vZy<(27`#%G
zlGpx=9bfNP9ifH=xWiHcp~jZ$5-D8-xLIc6q}1=&Aspem&3YpFjl)lYWYmC8*M9ko
z^W<ZV6C3Agio^+~YUnz8yK69bPyS$(dy!&h1EIw3=k_m_{favii3{I&4iDKMr7VPi
zwlgpjXvpbW<woKJ`f2&QfPF;{!4PR7w)bv?9sM`&Z4zxO0Y}%-fOlYi7c{&S_QJUm
zXo&DLUd`yMPJh3fokR}N&`~7U*Mc>Gj?B`~?MlF*jO2#CJIl-7r`LnP5gJt&y73n>
zE?_?DZqL?sox>qqlFJ)a)HfdIkzS_SY_xI?hmuLIN6KnoJ$)26L?i4bTS+9Y-?EMB
z=r^NX%pi5^vL^CwN;9)HAIU{V$KP?oy!D~hC+dZDJHo9dV30l%8wo5>=46Fzi+m?w
z5dX<%LBX3Fbnn(ye%hS?LMD=Yb;pQppaR=ZB1dQ_k7Pi~Vfa+0SM)cz{zuul-arh4
zFnFb=2^`sfvE$31(>aP-7N8Z%!+>KGrhp{X;>QyseDZW}usu|l)Cx$l>s^<JdM>xo
z1C+BhXsv)Hg-Mbnu;u6S^npaXP28-2C51_{ICn_LWyytK(~HQ*bO=eAzDry7X0a-}
z=g7xw2%7X<$)FXqN$*{C*a~Q}OJ8zu3PlU-(Yuc~p^y2H`wrJo3&$8Mwrb7_AW-=w
z=$$T8Dc<+&-pN)#hALn(Z+w|i-C7d@eQj?AWGDm^T<;tc7L;1=jRR~2Y$ya13j7(J
zy)v;yjOWP5bm-t4J=u=cR8Iu==AVz*(BS~&2jCmL=&e4o0yG@whi(NJC?X}ntLDXj
ziI4f_ie?2EC=w;ipo5`&N6*uAUw8opibe@qx9}4XrE9j0MZ5q5g;N5@2vNujQOvP*
zBfNkDMWEy&&$$?|EVHSXlNT_cvP{~Ae=H(LjN+c-o>Cz!6Izs*H04fn%Y^Ht=LKMB
ze+`tD`(Q4m$?nKl{sMm~JEJ6rK^TT!DJHQ3_rKU$=}&E!$?5{0si%+!NY<yYz=fXg
zFV~_0mb#c(p9LULq3633=f}>8u<^g}mZ=2+4a;1TY2z}`WKFShGuS~uLoY*PEx5vf
zYY>Ir%WhkdSKj^jQaF(5wmGiW3V{o~zQ9En7W1C$Gms+H6`-&vOyUSSji>$N@yIrF
ztU!gRp14>Q({2`?^`RO95~4oIJ$rHN66R*(Kk;bWUYzyOHyDMcPFfky?m!lp@JnlQ
zyjR)&^t94Acy{p0mN;BrVIi;|w!w7}Zu^Rc<cUIDZ0f=f0W}29+p9<*AYD<B;8<52
ziGxlVKhuC80?}m^NnkkVl+e6Gnki)koV!a10kuO1b5Y^|i?;a*G?x`5R077=c7XYU
zbG?_{wjsw4ET(Lp9K&tQa<5|n1d_`F66W+qZ%&TvT3zc60q(MX<oRk%DhCGhSQ{q^
zY**wXv{N#{(#?4Z-r|J?w)@tP{84rVNf3h|>`QA=ga7~75_@VKrsV_d4z)EvNbb!m
zu=L}sDR7@=83k+y6?~<EUPO$@QFd#^g95gLGLZ=xxiEHdcxs27K>^)FePeheUDtKe
zv7L@>Yhv4;Xkr_aNhY>!OzdQ0+jcUsZQIG)_w(cXe(qDdu0CDWU3Jc0d#&Zp3nL6Z
z-r7VmYL})PTts!Nl9=ar5G0J=3MOSYMRoK}2;D%F%acqLj-uUT?uhTfT>k2L%t5N>
zt=bCHd$z`N{ka>PMP*8pY-wa)>obLiTrdMDR>KQ7dP3bZyZo4c7X@FWjSqVLTEs51
zJ=1Lv0bgw8t&1rw-SO1^9Qg^p=-xIT0tmt&MgNyagWJ^6el`gTe*lo0r6J!;%QOBC
z7l3W2sFE`(p6?HP&HStBlu~3T^_Fh3ZqsY1Zuynq2e{WEOBT-P<UBEAJ^x&29yt-x
z;6rf*2Z=eNCwvHsE9PwO37pxbwyPW|e@Uq63cD)_%B;h0)~+BgR-qWp@$+XLP&M_^
zH5!~lqR`|D?j%Hc&LwUe#opX2d%^fHE>XBkzNon}wSWhapmwU>1cG4s<Yv27hDACc
z$(cBi!02!*SZ;<QoyJ)xfPtlM-1)MF`JTcuLH%YD3Kteh-GnVC+$B`3II39?^8Sv*
z{AlC{gH95}kVe_B^X;R)AJOSOWDO*dIl4uGF3Z)Cld%rMfJm0Yi{>L{XOV-!i-JsY
zhuW~wiWihnE*~AGBc4m_@Mb~L3!;|U9Xo}5h!6_DG?9@+r_&fqGXn|zi>~8DZ-nrT
zrQf&qr2bEH;p#2XLWh>;U2Pa}f==o#P~V*GSIb-Vj5oe5$G8rvXpx@%x}l?mqtRIg
zOa9HQ)ahm!RPzm79EFI}QugHm5$^1uY{423_5}N*C^^b06nxGDxjmTF<7cjAWKv##
z1ww&2qyIn(Ol^vmt06kp?ATP#pRd+2o=f|UT8V*raH%}Zj>^?PHWytriOb{x&S||`
zxhT?tS4Ycy{Gy4{&BIRXXUyGIOL2n=7+W33AMBrEfeaj<0U=af&u_Wjs;*Q#$o(v+
z?+HkD`(Hww3<sz!xV`;0$N`m>R@#%N%*5BbHgbDZZUG;&v+eLo0+@6xBPsO)G0q}&
zm3=1Vz&f$9fiNKwv-gsdz2(H$Z|{l>!mfLw(#}=6g9BpdU+WZOUO%ANxrX3h&nF0L
z1F&u2AGav<Wi8^Ata4~dYh4*~YXff49i;Jphj!w8G|P!yJ*C7tR2iIcwGbPJ^0m@O
z7%+q}--HOeX3p~m4-w`{9(v9Ve=1v3<N*s9>7++q<k4cFpo$++7dO&0bTb~(B?^G*
zX{%ydlzSC;8F!Efc~9H=Ge*`Z>DK`o?Cj=S$-M0(QykkNb&6G#&`dE&Hrr4xi?O@2
z2&(eh<h5}a3~-6ZQVMOrhUGc<zUD?nH&22E0Z;jk+@Wm6IH-TqHCVib;~a?a*5_7`
zdBs#dWV!od-+djPm$BIP+P*2@YQpL}qW*R3BpGRYtu<Z<$6x_ha5|Oo>;S6kEP>dl
z>G_%9HSkv<Ao52(Lx>2fE2WFyPf#<;$?#@STQb76SA*qD+&iL|ycA8dVxH>lAL&q#
z&m;m4<7sqF-BF(d^{MgKUN#$AI%%etk-<vo0h*N4$BT{iQufHd<&n}Q4*Q5|zjv~4
zkVksmzkb9=qm{^XfV~HNj!>#Lf=P3SdhS6VYDf<$ejeRTQ`qKsp=8J?%^}3GU5oL$
zOh~x#jI&-h90T&_OA{FqP4J=DLm}WVq}Dm%d#)l$|9wjFRIzB_AI;TP8okZ_`f&=i
z{xk{0`iqe!Qik{s@My(+QR4w{TYtBsA?$-a9_i7hP&(hppM?pv-Hag|B)CnX#f_R&
zW$SFv<IM-Yf2#}ReRfg$lx=p3En6n8QMkDYWvsKMpciif?6XIQz^ywDn>Aakq|{-N
zY%y^H9Q*!RpR+~7BY%?Ivl733?>54KU=X`nnSnc$06MPNONvFX5IXa?mh2sF(HMS1
zc#2C}Az$&OffC5(j?C^dLM0V(wLFGWUvR6<7W1u{&H#BYIN=2OA1C+7gn_sPr&2}V
zS+yd4-;AK<LSP8ZKOI7yNzvju*R|Rkb`rdlc~6I9!wLzK;9#zj2CZ8x%G>I)1<DN^
zWM<Ou2;KG9qpw3bYiu)^#R8@>Z(zj(*5h+m=ziYM8;Pw}$kY->+QAcRM0L4qQh?c|
z#4P^^%eB4?T%v3+`N3s7bf3|WF`eCv0r+N$43pfi@3s@>%|<}o@IKJ`@m-PRkB7G}
zp{pJR+S-2817VUdZ8cR{(7@KyxE}w?q)|XoM`qzqb`hRe5D-j`jm}Wy#IG)sIdC!&
zFJ2ku`1lg#z5Z_rG9DDO#dz4_`x-g7;+dsF7F$Ka<oL0bU>KSE>Gegv+3#Y=7uT-%
z$_S^|163e0^;iDt8A!Z~oLF9aKi-NoO*I{11tuvVS}HiEvlH&*jB)-nmI1ed2`+HG
zcS9?OgFmY`B);-a_>CVbFZU<~=r!*~yX4X<q{D=jFZ7~m5BMM5>0bn_{#UeK-II=%
zLoPTBVX_}<eBaD)diC7|K4H_gIt0t5b)wFja5Im0EOb)jD_NcL9PW3`(D6ti8HjNx
z|9FKJg!P}cfy#9P@O!b)yYLmLJ-BU?l?Tp=$!5WMC@SM>#``|C!+DLd@v9UoW*sqo
z6pj*1-ws6+nw#JLthjU{_wT<t4>hp9fnjc_@Xnf~Z5^6#TCJve+dgGn7XS{<X#Zv<
zXl$eg8tePZxT`E7y0mR591}cQGlUNcVyv~d0KrdmRp%GOcz+QGPq)h|K=r01Dw&;|
z%pb{X{GNPP`A%dz{Ua0@+@=yv^Mh$YBqcMQw7@=rm9jMQxR}1lp(|gOO|i_=bjE~f
zWP5$pM6G%4$A@n7s3Gn3d@t_)VZxy_QXH_oY(opw@W>aL?KELBUWEDJB%-li)iR3J
z99Z`_-KFf(j2LBi^Wyhz0Fk+|Y_l@?_cFCt4Nqul4lQg*zjS87xydc&qv(9S3J0WU
z*QRPr6!HNq7w@Y1L(l<6J!6az=iR+TvCnO6FtXm|VG%C|1c2`6?)MSPuv9NQ?9Uq>
z(Sl`rk{vr`JtBo8wXXMvDL6bFo<%>hTRburw7Bm@Cp@AMV%-+a&c@Io;oPrH_Gwg=
zJqg~^{<x;?K?Fu0{zW3P3aL5c=<L3laYw%p5i#`M(ul@cvh0ly=&~T#Sbmiz=iNQr
zYP@N2$=6j-vc7o#RzM6R9M(57QFKS{W+c56bwGQpqujgR`JnwViq7W16<I@EY@kdw
z)rMenL`ku^sSPPbo$Wsq{jtVDM!{k5vaAc|4a_8i<(LWut#;aa9+*?&e#cAASp{Zt
z=#bYS4nkAS>%A-+FtWaE9E52_s8O6u2U4ZeBr=eq|5k#v^O4r8nC|*QJ7OS3lM}8~
zS#cq7!CRvs_P#r_7N>apRme`jG%jm+I}5jfqZ6WzK9q$5S+1<Ik_1PoeSqg1*ZNs-
z4j%)e8*9mt(b<E3=(|eX=7r#k67i*RhM!Tlsker_&S86qRt$gk)bKj|F>G*tfy?qv
z#c?`ufD32!cn|q(U-i14qB4sq?encH_sIpk81g)XmP{G1nC!WEu90RUaQ}pqbh@BG
zIFzfG2yi)pBH&@zqJxiPO$x!`s~b7<hg{m@odcNPFOX)kX_efge1f`<YAnHdrj$M8
zYsoG}_xE-D-9#F|i1gA&xY@RBV1>$6EY%UVXXzIhC|>50`o5#-bVwlh{gYd`e%O#c
zayz{5bv%uszZVp+yU!vJ^F1CFNASB{{L9KM_Bf=^ih}Unw<eQ!FG3)5Q?LmNzFd5s
z=)AbAg>5^3YLqjfov3P#Wf#!ZaV8n}jy*~<qVOmIk24GC=m-~&`z&Q`Gc(a^XlAw8
zyf*#@0pn1Y7>4`CTW|sB(@n4;1cDvhPFr}+6u?@VpWPVpe7w+aPECH5NX4ZkEr^J>
zg0WuhqGfKzMR8tvJ;m11OB;ezDGcbKRKC7y(SD<wFM0K7`~XoZ%@?e&DNzp<iNFJg
zwo~}_4kitvy>z4JI~R-dtD&JRFrmkCgmV>zhIuJTiY=lm%8lrIV1DZ1b>h5ozocKX
z?kaby;0kLOGSP#x{w|gt$Rj$*c@3ayT+WB=J4bno6iyUSsjqt0t;v<7o{W{CoY|kk
zm<>5J6nT7nfc)UQblP3J{D&qaNm7qJjggEu1xwNDEWRr?Sieg^+#~pMDgsB6-XLKN
zG=PX0Q`VmSGfC%9p4cKyJRZ8LLWx~g2n*UsE24w*ScKCKJ=bI9H{kd){7wiHtzelN
zM$Ug@KvZT0Xk1dn!=j~1nL~<gIyGxvdFe!pqdBeT?6MgbNlDm9MD--`i9srGqWN!V
z61%vhaRF2XS;V8j;$(gle&g25{c@BkI`D^kPfL<`^<&Wr9h(SquG<Hb1RH_z2}5&Z
zy%8Jo8^l92v2Re>r;>a*O1}ZsWD*Eqjc_~)Foz65MqiPGbj$sitEMZouO^Tq9>Ya*
z@vgJ2tD>>rr>Wthm7|^*&`4o%zXgSZ+3kLZQo$oU9=YF#b7{E*!K(wMq=Ey`c${m{
zRtntK#7y3V@9EJ82dGnNhlAyh>e8@IZik^H>FZa;a53kM<B9=cD%0<%e)1Di6?`db
zKeZ_bjIN^)CEiM=p|Lt$!r$p2F$$okN3NS~a1}vJDS6|}2vq5)w#(tg{|@*{TdkoA
zv2?l;xE4)s>k(OpBYJF;dgXx~wp9p4e6<VD-%e9MGNFDG4?Ul_*g5swUa@eJk7MP)
z5$FA7;WXJfm;7yOSq8Cd14bykH^<3Y@TBqN>=oJ9P(u?ET1<%=*0oDmn-;<;W965)
zAqz)wFb<%4V(EVQakTv%vO?51nj{Cra)C;V$WAX1t)XjJKcWwi%Tt|doIv-J`T%l2
zH>8l(VB)cf)oA*Kus0M{ox`>T(sm_f&BphDY*K$jFrohg`P_L3g&s$9^l(#1QjB*g
z?7Mw=w1N4^5R46{xN3rH_#fkmVic9Rr4G?P-(O-IVudx4R(mInxVhw3qUa6?92#3u
z3v%d_T;&S6Uw2@IVTC22cDv7I4d0P;ZBM2MlLC#Jab36`6B1?DQs&8+QRz_+NT~R6
zZxa40+^n~Rc}+-i&sr{h_+?-Bd0Oe;d25H#z>*$^rB%mb?Ij{M>G*5;g9czTg(UI_
zWaNpsE5Ry+QJ&8fVYF@%y;ZvxYYO5bgnKT1z$vk_L{lbllt6Rtenmy$?^wpdpVN3X
z?;PeBnB;o4I_)lIY;uopjDw4g)))hZ@fD;~G3^q8oOW(IJ+4njl}^IHb%5qGXk0P&
zg7clQX5~{_sapAlQ71kxQy=Yh2H!~4740<%B~u~}Y849GDonI!oB+uh-$lva)qhZX
zKjZYeSaJ?*(xVS>35YZddW4H^d(8V)G-5C=ii872-q*J^{*^lU94)==yE*v(<e${V
zB|yGil$USdi(Hf7rwy(_B&0I*q2x<aF!I{NSBC0!7(4!X@uItL+i>$3YN0e^?Z3M&
zB?%w}khR1RtzQ;^im)h%(U|BBVEFfuES|6Puu5)*mW6Sdo!7D^--MjXT@^qHlf~>8
zS`s>9CF|wOZJho*Z=F8my38E25`{uO>)VzsKhCZ;uU{YjWNM_i$Ml1(WS64d{ev8k
z{}m6{UmhYNAe<vhLpH&Df5}E3G#4!C3R^XJDEUxj@bK2c1WuC}1q-=C4V^leSbLtZ
z2wRPC@q~cZw=7D|TDUVc6kouPb6HA3+P5l7PA{H20=wUgy5;-+3m_Qdi;UrqMgCFn
zgD=M(AwRtFNt|2T($x2t{EgcmfBCSHSR9G%LFuoaV?HKn70Z0TEoKeSmp_*jqk@#*
zV3)A{W{eTX`cH`8YUN&bGGrK7n=nZYj)wsb88(z7Ro~m-+6c>qq|irt%(e5^F}vY&
zc<o);)m{@+l|<Bov%MSnj9kbU`i3lE2~NCAl^Zbg!Ke^6ghUyLRN59pTG1sQsS!|{
zHwy?T5c4$c`MJqHTZhhq_+bJ@Is?Q*B56s!D1X$F8cmqQg!~XK059wl2rux}E8Npf
zM|GVA3y3Tt%f-UGoYDO*=(;z(D^c3gbs|>tgt~#a^sj0Mb}@J;El#E8*9+iq4wt9{
zgwzQ>N0Cde3nIpl-6ph%)G%@U5z=w8Ly2f%Oj3RYz|IFt-bwlL#yn%T*Rsq#Mvj%(
z4<w<YGIvnC|1QUORe70@K8A5pxuoaggz#Wy_CW>s<Yf>KShKGu-;7q8%^OiJ1KW5+
zD@YSet2lT^F_`_kW{zROAqb^|gQxHlwk$*sC6uK5r8|LP?_y-f9i?99lF!g<*WH!?
z@5hN1j&7Hr>&O^X@!)DppY@;2Rs%uj_!%GYhhns_5!YKRzWzbyeEsHhBHc5sc3-Iu
z|Nc~x@9_83pTB{~j^W6lvY0Hq))|O%I`F|Svb7JWD8M2cqL9RvI^Gi;-c;p<SJAbH
zTYlo5b<C#cbT1uX+o!u_#Xsa|wwzMtDLsPZ5m)T#N=7j@NEu~+jr_OByi4R<+r;;W
zU8!4_P2fyo-Gr)b4f(nQt~BaTQ3e4u>Xt0>PD|2KkpE<o>ch0ez6sN!>o7vGrJR}U
zm=u#vpS~EOUQoYkc5v?14t3v|9EpsD;2g|%;hPHelrOxxcSP^8A)%jSaK1={mla3`
z8kD!VS!({*esDCc|0G7@ZCqsgc3mVsRr+AWvNjOmeD=)j=n3&xuOFx?Sng2_OkV~5
zsE-}y6^E}62y|7lCvxw2=Jh|YzT4=l)`wH{qf2WU9A7it1^nS0jzXg6Zg>c?3+DL?
zyRGj~dOR;UgWYc0*V31n67~;WDl#sRCS!a8E)?#^3OUjmNuTr-;hQ8Fr4gGEz54*o
zCyM1qoJGe9kV==Tg8M=$(S15+@OOWZ5{`n_i?S;v$e51hTuvAh;_FL`(tao}P^ptO
zDghneW~GzZEaZMH5A3;xQISHy&>1@(M~^_({q}~di%5FAc2Hl=l{OEyonpgD2q;Gk
zj*H)2JO<Dx@vL25puDA4ZmLrB=wb3z1`r)phu_1wrG$%~Q*~qA-q+6dM|rLTHLe*j
zGF03C?yzhy4hwAk7bohkFpB15!hPS<q=>f#pJuBq3vg>>(U2stK$gn|&v74v;aWaY
zlu;4NHdM;p8K1cQOO|x<!vWjMBD@FDEgKFW7m6D7!W@H(PtbU$#J&P-#V=|U0&W(o
zo9Z9iwl-BXzP;*PTEn$#?IjwVkh6&=iPGj`Qo+yqEe!N*qdq*0)33L>p=a*QD|$w^
zknjP|2!1{F`CI);ufD#c1?gH<N{e~Bz9_Xo@qFkGI2pZ;_01tVGuI>xC%k2T>F2K*
zKdJCXyA5Ss25(4{y?1((@Z{TmCG6OLe$Jo{*=$QPu6Rj~7g%k=%OXiKSqQrf_l%!Q
z6i?og6QvbjyG%YwSu1EDG*JA<zuGpC_F}~?lr+&S7&}!hxYf!L*%=>%wYytgy0gGo
z5TFAACl8KFQ!jj%Z1<D#{(|})^$%nia7GlP>QVMB#SQGAp`0q18#p6-dT{pl+o@R+
z(l;Xp;SN8I^qGiKH2WoK<2yz-KRIwlwo%XC-!i_^4qnXOh%@B55>)?G?=Q$HT*w(6
z$_RR-gd^o?ShKD0M}D0)zlrVJWQWEuU`!F{a{Z-W3T;`^J(dfSP%N4_O(-}-M?0=+
z=z>fdSD}zwyf#7-^o#XdOub$-xyXwA=Dzue{*nT3r%YxLGWAe!A*bu50N+EN3q{Sw
zQPkZ^r*e8id;1N4VO<A}oW%@X8|HnO6%-F)mO3UTge<%-zqI#&B?E|mCW55^hN8qn
z)K@1*eN*pXyd;nt)Fqwzg6+sEPmW|+|9CzND?zo_Gh&5t<j|SfyWM4jRRD&vDb)J-
zO#$?|taV6w0A)BF=LFp$Q?Yd^s}<1(IX^o8{}`qT4A3GZZIlxFppI~{Bby+bWCjxT
zLNZrOB@3Wk|DYxu?vY8d0)q9jtfOlU>6ap_9efnM&wfFk@4iQL5*`scLwZMWk-~yw
zfn|5+j>~=einSpw#PVN1nZ;!!Qc4eEZ!r!TvS??ozae&bwzD1o<%9zoc7k!c8(B_B
zZV)31K&-Qp#YFHNTd5VwUvJerD76l>v;5QV&Tx+-<BsmIUUDN=rY6U5nyB%dF(Fdn
z>oZmsT(a^8a8>|%J7L%Qros>rsGJR&kQwwut(gm&Mh*_lT&jBwegYe+CRian=je?Y
zztKr(yYo4mb%gK}&8iWV{-S_y&bt08p>x1%2|4Q~d|73T;cxexJBu#?_)3_2f09Co
z)VnpKLZ0V19;j%Rc=Nt&*L=df@H?}%eHjF9NFm~a4W?C2CB!~fCi0x#VFC%XY!=v-
z;(T32lT3EO7X^nyFZN2ByQoafoa1*K;SG*Oo_?-H;8EecSM!;H&=GqsOi-=f&Pu||
z7PPgU`UGDR$0M=Egu%67>LaiqR$3+R@FBGaM_^Iv_5;)WC6UQLiug>H^J>a#1qF+P
zDT|k7K42uATKk?9z#3AueYdte5Tg51&UPrVy=N`Xqlq0<VYt*-s1bo_%lb=746F{9
zeAvxtcuQH8WoU*(xsEiBql5Z7N2xI%bAoL?QJoW{s>B2j6=usi2s~%|6)G3&iqjzo
zQSm``?!@Rd_x_FK9$7pU5iY9X1pX2i4^z&uR_rB1YSv;{LGyZQrd~fB(~E7MT@}xs
zulzyeb5dj5mz>ywXy5O!iGEHQ>-{jkSrgpYLlQok*bQSZy}eq<gb8edYYg0O{O}cy
zUV2C!>J8~339~Ek2P^xDKy}3mIn*7}Lju(tosJir8_95#ldia6mE_X|v7D7?Vqo`L
zcnlpBAMyhQR-|QkZyhUHm}_eBokmY;c40oMk3Nnqib8w&$ne57q<oNlcT;^2xDwEZ
z-f*18>b6y;F+Ae`3olx$V1gE&RG*|S&`dq&%KNoJLB9@n$}oAy#h@*=FXa1-52+|3
zwrXbVh-R>iT~ZuNLJ|lanu|!@^N894BvI=_m7fTi*LO`ue`lP=(`Up6c_5|<Za%7&
z-Axt?4i};L-&kTSG`U7oG8lC3a2-ah4hUJXY@(*%0H)zLk70_n%JwJ9QeXFR$2A??
z2sn7Lf~m2grIY+i{&xbiHxW94;aL2XJN4(`_v?`Edyz*9Gqf`y+zOq(+XZ~0Oc_;Z
zHl0Z$Yut8C1GkAWvdr$gnB!ztF;mQYp?MRHq58PZ-@vJ3gjwA<FqK$smF!3S2NIf8
zf)qQ|{|&GvkmU`t6&h<?v)f=|3WH9G3Y=$4>RIqP&MP8;&nK!k&LXf*Bq>ucV1WB?
zj`m}-a1dE`G2s(vY<ePC;wTei%Y4R|*k|&t7W_a8uK5BD>C4Xa6|U*)FoPPb_j48c
zIvNua(*=s62U)GI*Ol(x&gMU9#OHc<)SS1`S!|C&V^cKYMyQban%24HH=jUyW&?@6
zC|y7EnX!oROJ51xslgy>Q=L#(RQFV*jD_$aa=&S>zBTx42tKnz`1408&XRG6g^H~T
zQO?^RAPrCQ*nqywu{JLCks%JGd9?3A8*+E&B$u4P6Ji|vUCFO1_TbW{>|d2}kuq7*
z_scilm(1l$@aZF~;=e68zl={)X;(oXl@V!6B9G6bi1gf?0~RH>56B;Hz#_dRczY4`
zbp2jg7eE<WmmC8ybUUII7!&a<Q->1gqAjiow(@DtAgs%lgc46JV*nD;$Tklz$ZiF;
ztT9iCV@q+u$m##_VWxHlcQGT29L$0g3gz?ZYa^D}tTL$b>)-K*9{Aq;=8Wl{5#9Px
zX7O4flF+L0O_09Da-<|Q#6NY#uRP{yip<Xx3IploGb_(9HBa6k+?YD=dvH%>WjJGt
z8O@v~Ktp(587yk2-o6H_f-Py3ewlu|Og5IFXwC_A2_xn8!!ta$O$lt%6@Cn{Rc<He
zg?8M6ya9iLya7o(iXxyMK7nhv-4P9=igjBGDX;;E9m5@ce#{O$yxNQlV^mt??F2DU
z5uFHS*rK9#3<wQ~)0SCS1pCOYM9^NXm=plU{`yQPA9+e=lH>yjPq?A~2L6~uFTSL-
zB(CxTjX^OAD+2vfOJKk1dZ^wc>3)dzM1b?`a_u35M>UB(#xt%@g}R7_Klg+voprlT
zu7#WVIRn!gSs}WhF|z=;fA)^{Xh0b2GHeNNZa4n~+&$tnpN8xANmwo_&Dj(n6DT3H
zA=u7wfVauoU24HosmG!vb;y8P*=yIUXV3;;*U-8phiglR^Qf&4_PWfa2yEe6>{|2>
zPD1{adCh|?1t)m<PRVZYL;oa4m4fx?*Xv`6!s1gU9YwH`liXSs&bvdOj$@g6J3P;h
z+WNmod=_L!)O?LGe9&p}i-w${7R;*bQtOYy7DAJ88OZCX<5|5)hute8BOLV=P*c&w
zii?}3sy1rie|NO!0o1tj01|BH&2Dv5fLcGOO=>n8j1;smLe~`r`S#*mA#gMQ17kIH
zQ3>Jta~L?2c&~oP&us2KiKK)y%MsCq6%+I9JwoT9Z|`O;O;IgB;evbEHhRY7u5<Sd
zAC2PhU?-rLk~LXd+8)O`tf*-#RE<cjrJH*-bfj5V{1V<xvt=dfD%YKOcasgRj2=>s
zCo@G%rgXp#GfQPjv}YAjdW5Uk*g6JZ!osvF7Yp&3u5jdW60{hS7vJT*@4M6T@n}r`
z`ao(%3J3WzkwP!S=O#FLYg(q+Nn^HvZ6PfV`Om1gYuG<KgdLpZ79l+O_B)Rd6aOsO
zmd69~Km-qz%vscDIw2_`Yp;A8Fr<T;UBwY@=MU<lq_EcQ;D4-?a+?FBb~Cl9{Gvi0
z55b7^oj^QMx|!Mzp$`=gM{wimA$;kaE;sXx@S2pg<qX@kmb64iAuLk1Px~pY-um1G
z4TTfM-+f^@>0GcKMUiq)l5r(O!U+4!>KW!W8B!D~cDpr4q{cd>%;i?F95n`HNEd-*
zVZJJ=(RwzBi~+SJQ)wH6+LATVeP=*c9kI;iBD?hI3l%hC5_6(+ol=j3in@u^_qzR(
z^~1IlGe^aPWYNr6=Z(hQEUda1RfHyLCbZHuPgXbhb1uYdEa0MCLd21i{O*lhvB)+Z
zQj{J1Atl{2PlXvGlna8&P781przgw~%xHi<^pjgqaml>jK}-xXIndr%38%b4z+X(@
z1&Yt0{f3pzkfb75R<e)G)a`cMwE0+vEjJvh$o~%u9B%d-;I|BkH=g)2-8qGq*pQ@m
zJanEG&dL&Jf5Mf2Y06%%t%6(7aq;x6^{*}_{t#VBoRVs|MAQckV4m90c3hUoBei5z
zxWyA=NT2Y&>e|@zsGfviasLwE1uSPzMF8>*%oCFlM!wk`aXo#zK<ILp4I?%KIw$F=
z6;qbIwA2JP_LDQ(Q(7dFm+F_+dJqzBayb^UbFI%A_^&b}+K0`9g4o1s*ja;=$PO|G
z6nkT&@r-BvbqFOaO{Ww21yYo}uwuQ+=OlP1ERYR&6`V;waYFBdL2R7RSQQQEZUk){
zM~mVgd;&cS4G>O2uZj!hW=KRCWCC+0%stBbF*zdAU4?BEIu2;6lg;Pe8l;>2ZS(+X
zM<f1fiGC66?^Qo_G1<^UGpF~mV2}S^hPE(MEveSPi6~{%Z<fz(o5fW$QsD;cihCfW
z>d;!QwnWA6i1(5~YA2Wpw_b{igiXekZleZB+wXW5kh6MbE}04dpWHCw*ZVRQ*b*yH
zF5Rm9c8ToCaKE_STu26Jb8tBg-aKpIWO&i$U+!;%UU2=k`0rTpt+J#$c?vY1<Q|f`
zUTl7l62JWIee3K!otHnf{zC_~hDu?VQoNZJ*ltc>-Ejrlxl5wTN4^gzTw!yU>lMuw
zZQ}(P#K?V}Z8PY0nz)&*N-UdDi9V1YIKoyBbV{CpLOjunz45}b(}pW_H}_4zzj@`i
z5ewVgf4D+Un*K`RGg@yn{SR?t%M3OR(!IQpe<<U#sVH(dd=Dk4Rp6&c!{)IMA{L$@
zGoK-B=-^w_Flr~jv8Qo6K9)N>2`}GE{!<@-HX?a05;nvD`8;{7Vn7#GsXvVP=bG9r
z@|7eXA;9FTi?aMy7QkQf7r~gdwcFtrCzN;{mf+9$)Ou;bckYJz@vUD{MdlHUUJa=$
z>=IHH%vZI`odC@3t}o;^Gnz@05wl}N$K$6?PHvvS55=Pjl*BfHn1_1YZ)|DgvgWB|
z9}Q?JyWf}aCeS9$f$yu|9@C3QmZLK9{}<m{mr0LEZ3a1O1oGskgsxmUP{SCyN#A~7
z$D2oMynl%t7H?dE2TI{n=kyY)jB{P6d_+G->ipQ#!%u>C7pLtB#$8KIPPbg$xWhR{
z%Ssnn=!v2!YGff@RAGcrTx@jr#9L(_Y-Cv$ZhyrkwLe>3VaK8RqsOFK06u($rMg{R
zq{Np1_<?7UJLgP#;ORb&3vhC6-EOSrN_~Np*vx3o%tLu|Puj?hrQy*LC!_Z6XhtpX
zUJgY93s1<SoFWt}?2IIO00dV+`-_iG0~V>f@HCC;Oe8q$QZGSIri&1et#}^2o<8z<
z_j2@0IRv^k*!R5egkiA`a!NOw@!jf`=d%x32nnbmeGaS+<GPL4k9~fRHP@8{00&l<
zDkJx=S*b>_!oT5&=)!JSo2B;lqzW;tT{Tpq($@#g@5joN^~Mc^#~%&%jU-!FF_#CT
z7?^`E6;2o!ugY*t&UQ9EQ>n&HNt>9I0n#LpseQ9swcZw#$R|`krAeN#*{ErGd0M+R
zirRjOj=*&m)t8xv9Me=Cz0UnxDoNq{4Xqe2GjP)np}`PO27oli#qh)#yEJC)Ac7;b
zAQOb+pwN!ejups0qfiw$^mv##m5lsN)`M~&P1DLeHP~)bv1?H9g)?pxz=1{%Xulgn
zKOth-N&YA;i9(b$UN8nZl*k$}EmEcTICE|_1lH4`U4sX=Ix06Tof@auITrd;k_nQq
z01r_Z_ULyqLfop7VPE_Z+ufEfle6!K7v@Cl$o3)F&P6d9B81wWc>7=b`<j1_ltz9v
zo#?qjX&g&Nef2z)fGm|k<VBFB^3Mnmi`3}qieyR}LS9kI|Jlv6o1k|pxS~@Bf`Pqb
zc#|tnY23&kmcIYJTxG*WX0;OVD0bm>37>@WajJt?UwS;o!Y9?v!X!$}WgCKIvnw||
zAl|P*=Ixa?Q+GYF{cR=_LOAI{=+j4orjenTPjdfA3uPjuLXl2cV!p2oztDG;N)mOC
zP}eY`G}v@_D=t@_&qs&HNh@y#eihs34}6JOw{UY*`Ao?H>?$@@n(a$7?4;VIDnbW3
z(!Ug#95i<eRz$n^Hdt@nIBGCnNF|Pg4Ux~VX9O*@jb7L;_K<KGgw?<6KY%r4crRji
zcHSjiz54Cz!GiXCPYeJGW1`+aOZ$96cvvlDZ3WTPKFOPpZoBq;zn7qD!l0dj4A#6P
zRQg&{*;X`h5*#$T@4FBZZLK#;V?NWWhLIK6xX0Px2Eh?r)$D4zg~CAXi!&-3ZyY+v
zQXPF7y^nKuc)~*SJ&DP1Ap2&UwuUDr7<qZ{lMqE=pY(NXUA@8-DzyJ~_$r*G=+E5E
zFZhF-54GN3`+%sb+vJ`qmfAlEfdK<yjWY<M${Wc>^(O*Gg1U?&QOn++Q0_+4tw}|j
zUc=BuBy7eanXsd{B4k00V>j2h7T__$%p*~!y6dVcg616N;L$av`wF$1C(2~*hYRv$
znyC1-*aYZN*t$^OHFO_ikI3j&Rz?#DsJ^Z-AQT-28&XQX@4AGboPGX4WDQBG0U?2$
zs+U-0(g?$@$px9mKx=c?Nql_$wx7s%5~ZuALt?KZn40-JA7xRq)1%RT*N+qc-iN(*
zi$1=*OuUD)vYu*>iPAT%879_n%r;Ft)7Oc;4KET?#?sU@$SpDONI2E|um`J&>Rbb3
z^vr1lm)q^2@|cS~&7t2lme+#SJkQadfwiII5%=`n%w!6IZ=`B0q#X`KmoW@O#ZWF7
zYSF})?ufV$xI!l{115w}TA$o`KAv^K`5_`|Ma<7HvQl?Y514b?p)des`(6XXV=uSs
zdOz9gfxA_f2jc~dYU?VD&js_BqVtG&5O%+us;p4}>i<M5$M_`~VMnVQ49j{`t5+U^
zen7xbJ7~J_9+#<OtkS0*7vK|Fg3{JC8M?eA;WS*o+!&)1%ONS)%1j}zqx>;hOHU|s
z!DP1;rcDX{ePM&(JABG_FrNKe%-1HecIYS(>QmUjqV*ZaLT<_mof>DefvNWE<SZ;{
zm1v5XAWa0<x+oU!wW)Hsx$Pce#k594i}8^J4A5J%YQBGbE9eJ8!;6X7%B>>!guW7+
z2wXSzJF9t8kaZvew1y3RQn1iL8Kl<tb$SOt+F#}vOd<SCBd18>eOinZ#+kRfryv0Y
z0#b9NK5U3OwJW-qDGNZ5k3EeF9qS8+-#k^{;=iB=1i>wQvpZbpsC)<%r|R)MpMa&6
zZw`TDT`GkN7>mr;NjUI=2$hbdv_zwGe`<XEO9mKzj7YY6yZYXf-nvNS-$QzfbyxeB
zk$nzAa%{k{LU#u#kq=%ri;1p7(rsWFh7>8iw#jo2=Bxgry#=B7vUUG?O6Y+9hp8!e
z8AxZvBd{=H;ZssP*;dei9|@bxHLYq6G3&5|-i*X(k5z3H4;_zfPU+Ny+=u}rPjssP
zjc871yXdfl+>Au8C`xvfUWFx5a{(B+``svpXG~1%%qDR27k?IEvREeh?Q}v<(T#9k
z#jT00+c52-l1NNs!Q=^!1QT2A1B9b=)2#?xti?lUB*t55dis47DM^8fDQmk)iaO3v
zkic{{^ZomT++m);l&2_wU!*v0KT2?9v|8rj9__8&WORSs;}X6o7P0|xqn@8bJWc;7
z!%ikP$uj}5L5<%gnG!U;o7UDM-*bP=fAv{{5ES3;jZKwR0keF+RWdR2CPvjUG|bZ`
zfq_mzhgj8VZfeIrE>9SOY`Q(#@kC-M9JnERkT;&_XNv)>5mK&*-lHnyQ@9o?qkNL!
zZW2EcW8fr}r{#F#=ku5TORz^&G~+Fc@#A&2LUD3v<t}CIC@EY&GA$Q;N@(1U*p0`V
zJ7F3pt7Upi`HJe;+RdqBZ)+s^k7jfxApzRVIe8iM*pngQi2hgXyG+<wFnorX76(YE
zyc;@be9DIoT!9G{L(h>-`E04ONUA8M@Sqzk|9qVNt#KD0z#idIh4^iS>91m$7_O^s
z#d|tZwLtfIVGRX;PO~khaO%-$kDJN1d1u+e%m7<bfOdp6W`VHsKL44mjF=j2T2ZOR
zXwM>XN6htaoA+HW9rzTgQ!BQpVm|I|Rxb*HVO=mOdN1S#L|X(eYnyaq8Ynpoz1}Yo
zqhyB=+vmXIG=!RQgg!_9H0M=?FbSQQR<L${r;vhSnRLYD$2Of8cKlC7WGcdzerrC#
z45tG??p*`!s++Z75<z@+brLA7NdJl_H1Ou#ENvyj0@JGzWt(tuoOR}a{W$?8e5B3J
z4I%*AW-aKxnK@vBWl>LRm8Gq-F9+cjhNDQTUbCxAr^nlQlM*2R9lA@129(|<;Zoor
zrYN0V&JMR~J+TA3;P@q`#@dB{+qqj{ZX4&0J61ogOtIe?^4>|UU=gYy2Gk^r*X({q
z3iJ`*b_9ZtxhE~=lD3L*UGFNS)>d!e8Mlbyb|t<;<NMvL&ws;7OWeitNIW#~g<#Dt
z$H;tanD|!ld-5`Oy@q2Yo{?OUu~||7d1h3r!N{tPTzlw`oH8USI;2ac>b?{whpL&O
zUxnb^o%g8bAN&w1JSbyJJgtE&DiP&y1g8TmuD|`un{5@I0n3FkLOjKiRQWiG56f#(
zAScoUATHOrJjbmGBJ+!ZugRq!yirb>Rx>P4Z|jRNxV$r|vq`TC-cShztm0nUCjEeS
z6}OKEs)adXkCxK}1$i%0EN1iojyAVu7Sr7G)pqqxe11H3U^sze-MaNmL@YwQ!AkD9
zw;6a8ec`2`Kx@*Ov<f+8h|^*>ELnrF49~PnVQD;iU^rag_Mq?=U2w~^?!X7ioVlZ%
zn0C_Q+eDCV6?(tb00gk*MW=WtE?<Sne08zcc3ITxRZw$%X=Jcy#O5ulkrJ|e&`WOc
zzsbC(A^k>rRdKcBLhUE9Ejk1b{s8jvJxN#=)__G=iXq}mSj6I$;F@7_s4^s&w4}I^
z(O*uKQKSwd;L(C)jjdsUh?7j}iwdo-BIJXd59G%AqpeA!l^rkD?NZ@QWyC5Hx#18^
zB=&BPcLItHT|kl1X3}1x+v=`buY1YNSWV&7(1YKihxgC!y}(-d{xZ5tcuPcA@@`fA
zYYB#+x}1=Af7KY+q7|V2b@0%8Z!`<R@3@6-)7IQh<9KlPuZb+6Awrq@pAj6W1FW+Q
zKyF2Zpd!Dg9AdRfoP4dq*9aEyN2(8VbIc>ccnQ11tJLNSNFYd!WTu@xr^|4^t0f`A
zUoI>x^~V6zC}!jUF!dYx@YEfd%6Ra>Uih#EnFCm$mrm$G7G42~t#SM#*;q1Xbp6v~
zt+Eqlkb><G^nQrndWm-xVPnAu1zf)(ov(C_dBgIE?Fs{`!Uri?*A;0*gIyI%o|8d`
zjgbz`5WR!4a5d^K`fg|OZ;<AZwZs*`m^i1C69VeOCyzin4-~AJ0U##=ADDqR1BM1Z
z0@b>a6xlojaN>sQcm%@gjg;Csl1(Cpt&ZA>u-fV+vKc{3WWIS!2vdxQ0Gu@pvTxIi
zITb(7wBZ~T=H-lemk;{Ft_B>0VgamKzyYmCzcj{J=99u=eyuK#{;dF4(b;Oq_MKc0
z2JrmwMKk5Z$_&x7c%H;Y0nl-igYASmc?GgsXP+9chmh3%unXg~!epHTB4Q{U>b4Oh
zlB7Ac4C`b%6jz6?YhxT$<Kn_-nOQ-vHUF@wNTc(2Tlr=q-Bpn|O+Y4w-MAbi^L5|x
zUzG>X8qbGd-_V-e@_%;b{u@T}@^H$E^KwQEOk;(pFZG`7S5OUL2jZPLlIJZ_c(yM|
zTFC8YHsE979;{J}n_N3(WeJc1A4la}UYK;zaGUa=CisqvD6k`OAgjC-5d>^%OS!;u
z=c}>N_Rm(fx8^8U?sSMuj0aVm>x^JtIIod}#|MOgh`J6)bQDCqAvAmYCw0GH`TFp4
z=@Vil)Vf(>-bX@b`yg%@NS3{i<zALCCjsRDv^QKK8X=CoAxRT#7*Lx!;^Gu3xe;Q6
zL8xrJCa~jbj6i5ENP6+d-mR~>CWB&KaRS2_5rie+dyX&cdh7LF4DgehuQ#lx|H`6|
z;XZ_f*Mnu1p8Kn%o2ZK8$q!eJaTkQ6C=jM?l~G1eei=BjX8TO&_;)iU;0E3Fs0JE?
z<`;v_OzuF(A6G)+<Rg+>Cj4wPF#}n{Olb6wmKzi*<x-1*B%KCrI6t!dO|lzKBNyXr
zH1<kqeGy%=A^~cr=2k6vo)XbnGxOK%0yGC_5Y8V~$WlOz$uAm%0XtuB1Zhh<#@mhT
zHtl3ajaq8aA7@f2M9*b+6x*HJ6P}F}2u$4FiO!=VoKA(KM!&PgQTWz=4Y1d1v>edm
z^T!mxFK+bF<nT~N=mf2M6dQsO$1<G3c|jt!5WN&}`A2;?v9T=S|7xwh?nN-{NzGl7
zk$^)|5tW9gx+r80!{@(+_pk5)g%D47$_ME7q=&66v66hBm#_}ajZD=V1RxZGam5I<
zo&F)~2I={QU#{dSWc~K97ysH65z;^Cz8<J_?f$`U_7A^`FWP`qNW24m2pI)I<SIJk
za*D1@)GG|~4X1x%8R159rRlF%yv7Jhyd_B>&X5Q5c@^j)Y`Tyy59`AI#;ZVScXgPR
zuLc6dDV~Ry>HIhS)Y+mk%F;yx!XUqJ`hRhXo%=2k^}Af;UN;f<HlzARNM7d}q9&xu
zg8y^pL99l=qBq2s(p6VG02IDy^sl?smpRruMPoyFdXS2OrUgy;Xfjh?3rRfLui4{#
z>UCQEf<1Lp>LG*I0Z3DWE2|V`k=gqst!E2{L{oX#LO4TtCFXbGrR}f^f<{7w5&l7e
z%7$uNcFU7Amm6@>0;JVQY)K{fPSif855vBtlx4@(-x5<Wwr2mFi_HgCg+ibe&O<96
zcH9gbQn#<7Ph<PJQl*)PGB*sw0kninn&vm$AveO?!6FW*qqmk2(r7*s9tS_8KG5Nm
zTh${eRkT`4@|AYjg$!q}Ly6ffzgXYzm)>i>NUXGO%OVCS|B}NJB7E$w9d=5PL7hxw
z>funoz=~NPw|q9pX$rsKFCIDJCO}_?dqRD{nNSZU3=O)SgaPUD(&7*W7=2d`9qu%|
zb8b_j{3~UM*V#$TQPM<p79_VEavac;R#lRB$v0GixE19U6%<-?K{6|k7VgTx)E6X|
z7Frr==%~X$@$Pt1h4xFj<$p0tzC)Y0I$m~2pl6?;xB%o_@aK0w`TI&bP@ibj&`%6h
zA?jK<1uQPAd~{^8Q&OBqg+x&;J@A9zh1Ba8Wt85DbBy2F^!H!piyP%)$wgq?3`2VO
z3aL`zS6<903t}wAtEIQg*sDg>*%|S%v)5%n9e5z^V-NeVWrH{ec4&`cwQ=H3@veR=
z-U|*=ju);LD$0aecC%zDo6%h!QQ*m*oHSOIrJa2^m95~s2}|xDbvXIGacW-FrJ%`B
z55ytSC{|!4%sIRLqM<0I2O{*gfvJb1G(S8wgW$XvOVYLwRxB%DpM&&MP;aOQtogkW
z{x2?4VU+x>;49D{<U-mH6*7SK#3O7!XL)uLxU0_yr-l9I80Y`_`=D7%96t)I5L*aP
zc5cJOh`mjOZO6i7ut@CXR<+Vq`HmM|00~?00KP4@m{_0^7cmPR_;1-x8wut10Fyy_
z&@%8O*E&e?*u@HyF;0--k0DWP)z5-C^R^)xLqP^S!))_yf3C4B(KLLhu}}$!2{Fzx
zHm9N|>a7#Z9%Ag!zGuaw-EP|^`=U_5Q$I2U;<xBg^<0TH$p}gCHzODdt2|)=%w?Nm
zpVd1Xj(ljBofQF_t9*{6qUvg}j~YwA-Wcjmc9oz#I)PrmLw`Ovbk{P<2}>oZotMtb
zH@uru2_Pn`GG#&a{X4w%Wg3*2g$2Y0S+>YNWDVGRjWb>p%a-W7O94fqiONj)>}Q_`
z=z&cQ?=s$S6rjjo+<QGn>$gso+B;I<_Xf&Fd}?fX`q`U|K&3Mi4nrG0mV^8?ezLgd
zJ_nWOR+G^775eB!x6CNO#f&XXMg=2aj9>d7jg<fz<khHOR>8pg)UAd4rY4Tj>Q`%8
zM6$=fxf&sGHJKf|qs74jBItg+<^0}5R^ARHu{Puvm@BOHjO`nL;)td-6i5BW(q;5|
z{5qO_8#|wkNkbNfmv))1*qM_MitYZg;NedeP#Tao`w8}8I0A5RpAJ@aQt6e~VS;nw
zUFqeb&&fyo&f;@U#7lK6P-vQZr9qNH^4Cx@1NYv-xQP}Xz5|_s4ktbKsq;C%d~3vs
zDJcTmUL?4upGn-mDTUY%s6|=B?d|91qgU~0pv&kLH5f2T7#9vakiW3rF`-Gh3H<r@
z3@hQWR>nD)ZGIOlU+ueWftc6k<d;kyd?Sk=YL=m$E0tb$q?wX`*eUSqMsmCKNC`g!
zy+K$=M7<kPl;vYwS;-~ERktTEmpRRv99*o-0B^C%)hkLOauCdWre`xNRgd;Jwjs^&
z__jkD5K_OtwAor)M9VOb<gdZ;QuQI!gp`2OdWC0{1i$;XdU6^`m!I606L?U7?@go^
zEno8wI8mGs*9JUMoZV0SwX~0xR4{ZaFw#Rbh?wcn(>SBK!SAUj3q8ZhX<Z$>jzx=d
zo-T8J34XaGS_WQFX$pX$3VZuwbVSUF#Z=X>=IxD^4!(zU;ao$`?iS?VPR!@3%G&v4
z=<gU4i@+MDlWNlRyT!=(SoUn8E)nY+fW(?qeWa6;67x(VJYTJT({9^XjSGFIVGhYm
zV#n>=+_uCtl;%pu1e`z4u?$4;DxbBAwZGYT;&vh^!Kaj(C`yx4g6Sd!jvtNz{fB(e
zJq0S0Bm2>w7$TRSI4j$-^vV?JxRrW<LV%&~iTH|Z>TH4cjs5Z5Pw}Vmz@r1#H#4Ha
zHgd%{8L)H_7OL}&=1`~F46j<qOvtZy=D>m33S?9RtW`qn*-XDgFe!a|1wUy&zffRy
zI_qGVP+p@V_59lTZ=(>xf}09fvtMfB=(l#rK31n}DXF@B264KRFD-aG+j9pUi#xC>
z(hTKrU~q@aKz+StS$l1ZwvXGb4w$&(I}7(0Raa;k^gt5K&V&N#`%fT#_6p=Ip7|_D
zTt=b|>)>vS-u*;_7^?=JMM5m)4lF_Q^?gH`wHmE)EckPrh)b_qW(AUYY|Kw}Lf;_v
ztBL>Hz8SGMR*ttoWre*uN67@aSfSe<u;ZXditf|&Tie8eJLy&F%~L+g-uTc08^%=G
z$dYX-Ga$%lQv{)s5I&!uHpqrcC{f|59#I62q4p$oILNSJUyjlCM%_t9)L8=~zIx^Q
zl6mB&)H2lDT;2HyoD_DPlS^oJ>O-RzOK?%#oj*+C@vn_-qi;n5KEil%nCJK)l~-Ot
z$he;)fOkLtiyY{4Sv{7PmKteSdP}jZ&tBV#VvHbuH_o}tiQ!b8zHEi^D5n->ksd12
z*`CVaP6o?%OsM~q6!Du7@-Z-7g$S+>r?Xm{8%oF<mw6)4kb3%}W~P6Mp<{q@Qd}3m
z-PhedG&uXSEZ&Qb+^;9nSdDx7LilqZCFKID`dCMBS1i^`u;YCYxsPP@Zx)^HnP7!0
zc@8qOZ&}kJef4aY#lU!DHw{rY2)ssuB!z|gp(>*JA9(F7gkVF46eqwxskS{yf7|{M
z{1f8Py5NbeZ?qP@)p3&fITx04XQQr-iHz8Jhbq=wZ%sk|RI`6dV78yEyE!lGsci$N
zZ07q-gGnc~ht~1agM;$nwi9uSC`y~6oaoXw-wzDB1Hz{PtV-ra3dpoT5?0EAaqbxx
z^WuH7`;&43$ncnsR=R56j<%`DnG&;Ks1#8;^4!LKf(lu36VjraJn-nT&xFJ>9`22!
zAcRenAS2j^m99u_bkzA_VK~Z-bKJ56VNG`Nd%;IQO3*+eSp2Z#L7r5aO4u{COc?*o
zuarj`4up^d$wDe?nGt>`SiSb)@ge?{?_>;Oa-v5(Y^u%Pid=~o67LebvQ$Bv>5=!i
zhxdDgz;ITzc4w1@%6jh#ZP8^O26QRv<OZq~Xt+u`9rRU2fdItiN9ejr+B3R)R?=O|
zD`gm|HG5a|(+VB*-6{WgBL2j44pj~_xH&CQ`jk_AQ$eMwGJfOuFzIV5$$yL4Q4mfV
z@FO9t`oqE2vRkr6V-%W34&z?}#F5p)#+vY&8PR$riHDacy6takBbpd|3hxxUmelFA
zD0JJBDd{eDIn!NT9UBg_r3AlrH6)X=@OZTP9bc}qD9^0i_QS4V*SP^{drzsy8&DaR
zw1g-G7doF~_h%BiKByMW!xLrp+RLhFE>dksQBCP@R6;Q1W}<Z1vs<9lZ7Rc}btk<V
zV%tv2pG&-}AA1G)59K4-j9>d86i<OtMau?Rn*KGsI+|y-)Ia|_y5$l<oDLb*#4>Iz
z`rEuZy5;W(BX|bhvRHbbWrGuxylVV90!fn=)0ddDPUw2XWXP4QpE%<bzgXafRDR7r
zpguPdf*gC4p$WnkVZJBL=vO6dx2YlblN|Sjn&DAbE*};o^t4^RI*nsf&y<=~D@2zo
zDsS*$Lt~9J3m8QgU68_^D55JbWhpQnYBXfC$XUmdKh<KWKPh3=PnyfnSVu9nBvpm>
zEPZg(bKHw-S=uW7m5fzQhCFh)iW}c9x%sd71ln@fBtxn=ehtc=D+PN{BRCRWg@XfF
zIVXf84{Y?oJlKyl$>V#1&{08p<NCH+y6BLJHMIkGq{AjbI^IJj>OCfSE_@kA55Iu1
zYDyv1p^AUA5PrxIx;~GOpoBOWsEApI*@~8w+R+v#3+VN@<Ee^$aY1fyVZwcAd)0Zn
zNXsJ`;YNmIH{?iloj?_q4F4ZZ*BD({6KrE!H_nZdiESGbPi))C#I~JG>||zQ+nm_8
zZR_3dz4d-ppYA%Rf1K6TReSHUqp%Dy;U#q5Oo}E}1M~7q9mf6^z$*|{L{m<SMd-2B
zeZB}$I*0v3cY&PdwFb>l_Ahw|Le1s=kYVe;`{OVna6XRPT0}QKL^C|G_w3_$9oTU_
z)FuZ;9(Y!}>U<Yw1TCo3-xv(K!m-q1Fu{U{@m$=jvF4}Vh=2eS;HdB>Jmzh%wlO&(
zz|h2S#4tscrEvcy;%lCy1&jbvEUY2eC(>@;wlxc=8xR{vDmFxXeeu>;dOZp~ZE2BZ
zJjLwl28^}fwDScp21xR)VL=LTDOT`btwTe3GW)s=ql%g5ttNg6<20Bpz6S4P@!|N=
z@GY5!i=ZJm$RIt`f>4)&S9uU8NcI8l5iC;tsHj|U{DSX4Auic&uK@Wh*CrKrrZkA_
z==+SVB!F@j+yS&CWCdZ|<~mLNH|RP<PnilnO?3H6b1FT{?jCm*rbrzw(c5eHw~h`b
zz%t`LCEogR0yy$NTOzAKU9k2X{ejpbyqME8+Ot(A#|?cJHllFtd2yI&)g45o=3vES
zLz=)X9^1$CFWqpr*<I=xM})Mavlfi~1!Y+G**<EgA{-wiG69SAL<Ow}50q4#7VF`H
zKt35AQUS7Ruh~%9J9&<s*MIJ+DY#8X2YwaN>VN6J>(}Q5ZNK?xS7UvySo$+&w>d5d
zK*WErR{jas)3oxZC$zA@Smu$Q!WgP7(=)sQB#CgTyhlFY2}Mr)sIpMeJit~lLgE@D
zdr;Caj<FO-79Fg&7|NE1LXQU_j7pSVme}sk@u;dbG4ii**-(qmtN`jOHdI5FvLksP
zeaURd4Y}?{sh!pkkthRiERz*>IN!d`CAl#tM^jl_^~P0i&%gN6cR|9`a-d>G;BguT
ziy-KZcar>qVXU_fR={i>%>Kbf%t$Ss{fD$1j>rk>)MCO$f23&)9{Z@u1in)8Lbg3<
z%YD1qn^BDl@guxbv|san4MlxcFA9qocC|L9+Z!XS8Qh5yzo_!rx>}y;E+%;H0SN38
z@24T}+d%pi)k1VPa>$s@^fhv$-jLs6a36A@C%(vuPrCJ&^8go4G%cQxz1o*_&L$Tw
zx^U@*Bqd%{R{tGhht5EqET^4E;|d?AmgxDs91AQS;)n?2MILw4>pTL>d|Y~QfqP~x
z6K`&f@*dfae^;1b8eZDMvBnq7R+kR>!grNHg2a+59zbd2O@Psj2NIjVp(!hB!BAZA
zLrZqc$ILX5jkDag-s$EGFws|v6c8jfk2qP12JV2xwra7e>E{WO!iL`Wp@1b5P!#c*
zjW90lu7&2*bhs_Ahdh8ED`ltJ`o2%Syv}xVPQy*o;Hx*v;1Uz+H=KfF=&V@)Cwp<T
zEHT7=$F)%tmRI@b3`p(Sj6f*L6+9vtv>+wsk{NKfJH>O$ZWPBq6yRfSQg%DNX967E
z=(GtL>66o8t$P|<;wxcRlh7F6VnhOxJP}98a^X}M$q<n*?yRa#!4$=HcVZgk{*_@%
zvou4Lm=(P_{INRu%uL0B_@k}#ZNU2u#mi2LVo#!2fgV`e)QiQGza-)au199<Z5C04
z8CQ%yKBKXg8Cz%@8!1bg=Gi~w0nJz=lhKy0nB=*0Qv-@uowzS99L6DG2x)Oe)EOz%
zdcgMl0uZ(}LI(Y@k@~6^V)<iknjg^b^Z9H@WTbI2%@9@Ny`LVJ2QdKsMxm8+zr8Hd
zPMDAm(eK$9W7o(-b3yeZv3+Z_(=8;H@H~03_$ddUnPjmLEPO_AG`Av{=;j}9@y`<B
zaD9egeQ8I0tw(-ho>NL_?t3phdMm!)_QtSfddk9L$cGFWHPHpso#nYc?^r#|4RIpQ
zmSwAjJ+ZS@(TPGD{aGHysBP!o<UzFI(Z7Ym^yy9fGdm0MJE_0^Yh((#-!0FQ27#FU
zp_D@4yD{v-<`GGQ=l#rkZGU`DCF|mPhY<Qdz=eAB3MBRl7@=uSLUPbfL}@bS1-T3@
zn&N6*${rz+$p&_#+lKYUX?KLfs5b%d1<Vh*?7|jNipD_)YfWO8GMue|S+E>h!N?s7
zsr@hD`^#rBIIoFMQYF%Uw(wfE>%5&fem>g}b)=uKjFD&%US?SryKouR*EIYmaYw@T
zl-^+?$Y1e@Fh2CZ0wce-7*FM=`Dp3*n`itEeO$G}Z-28v{u2p<-;*y$kET@qOzVUE
zg;Hy+d~g>I7AgFi`0p{XSk<=M9RnW@Hoh#RtE4lM$b|zUrC0^)e&J;;U{nC>R;9zN
z`~A4B-1}U-!#7_LiN2gkWL2F?64GJlx)?e1B<R$DKgK~<P4JQI70?Gl4syqTKPJ^k
zjo<K4rN=~K!6Hp)|Cd?Dj&`i@q$qN<Up*9i_F=O<Ae~f;;_X+pgPbM(gARyX{4ACT
zq6fk7fI88E6m*1wR^JTH@7f?&#b>Kx3#?)B%q=q>vCrwWPSENFPFF2~gQj_=r)7uw
zn5cX0g^V`;*%Z44VPE2M?vc)r)R*^P<Qyv~1BnqnFMi1EAU%pfYdfdV3q=M>Ey#%r
zS5UKPM>QWu%M0`xn9S%`mgCYF`3qwQor$uFz{A3Talbh8Q|bN7)Lm0#_Mg<?9D&2e
zDLzPoW4$8=GcBqp5v2(ZVm^1~CG^^mQxaDcu20CVi&9?Qi}@CiQyZfL`0W@%@z-b5
z!A3%2iTm~8MPy%cFLG|}@-5)4WDGEFNDnmh!9FT-`t{(gNog_E{DKDaIy*P%Q(Of3
zbhF0%e96NtFR!sSX-)(Qbk4?T>)nS}q}KgR?WmHUF%rvu4XrVQkym5O)(oHPqM`?~
z@cDR8&q0Se*cNjxi14Y>ky;}_JdDQ_8S5W!pb3<JM(K%`qdgc8{$7>zU;W>RhdG(+
z*v?FQrFza31BF^)CK9<Axn#$&1htAH1H~su784YoAwgARA?-MQMZ1N6&bK6H6B}Z;
zLZunHH`NWdSW?925PrMhV+`~R8F&hsswP?{yz)Y4u+gZv`zXZU3`ts^GmEjW45DD5
zNFn*V^Zj_8%Qa@&Xn}mWieEJ7T@&CbTLb$m`fRP_%<Rs7(uWPnRC3nJ^p{j5_f;CT
zbdMf42DqHb=24ZkffMu5M)r$&#$>ql1?h3w+R{(O15neUaL63&_jaG2MuHHGfAI^~
zu>QBs_!wYvBQY`6qaMnj*3r8|06j`VPN}>^YH3HoGiu}&pB9^2$qj9v?}yRW&(-<C
zC|VzChfTZ0f>VhJbx-*)Iq=2Jf&DQ>_MIMwZV8y?4vy{Ib+%3j6K_0sM9f7tf#1|0
z-P;FkgZQOH{~d6{EKG{u?(02S#@`ac(~=NIb_x}+R0o(kz#j}-&lfeq;IhN%X|;Ru
z2JuS<37y{Xf18R)7@xTaI%#Nx8?EDWgw!F%Cq3zRnGGqVjlF!rCOExYhNFE0C}d%(
ztaw~&Tg$!}@Cc^l$T<%Hk;JQ^4(A-dq9x)hLUvOcvu=Yj``C6#8|N(!=uSp;DfwV-
z7VwqJtDy+Ia^xTb7e{0A6Qka;4aJz;j3y@{ZDLUhQOCOMLYG?ebBF6o92I}W2*?H$
zq_?qC<XJ|YH-6J5{z=(0EvI)LF~n|VgTEE8nWGAUw6;KLfOLLQX4Kx<#~}qzZ=0^c
z*!2yEg;ru?xEw=%d41qK$P)%<Ip#Tr!Aurd0BB`S>_`@AI6|mHp$wRo)BVO1D*M$R
zoWk$72ZiYsiMWxb3+{#lpC=UL4S`VY$-*m`G*5~j7rwKv5roh=Ub5m8*nga97sH*_
zKqnHae`w5=P}j<svb8$-T625m?lDyyNq1VhT@x1C%|zFIDcS9d!V*?=GA$};8U=-|
z&zi0fkM9mM_9@EpcE7REtDc+QYFE%JGY%cMDX9nl?fzT3s#6WQY_PRj#W_u{y`K_N
zsa<_xW_cFtS?3g8uf6^gtF*O1@e>l<A<BIx#`&QelXN<rB+Mge4B_S1D#d@~T`nY$
zD7EhI8}ia8g9_d+8QB2K0Q^wQ5sOf=y*7PI_b_MpuzI1KIk<2H!~Gvja3Aouz4Uez
z)Bx<7k-z#lVN!QK)TGnE1*QM9S&<+Rl+BvxzkYy6iyF@MzSs{!Otp{Se=}5ulRpK>
zT85d&vN)&fL9^ceNnfyfGoFGaFq2jbG!Qk!2!%-PIrW^^fcAj5lHuaE;b_Io;1a5M
zd%W)0me5TD)6Qvk&}|lG61gPX<j5wn{ad|0qXKTAqLTEH$;11X%!*qK+ULeOJ=8GT
z@x;?;JL9P^fJy(d4y{#_p-ID}>X(qxpZ`|hl54^A)GxIhzzbk+502@<z*={6c6HKB
z?t+&<bU?L68wLD`euFY>dJmL?_PB8dobUR*J^LEU-xzHybzaA&2`H8vXQ;>0e<*{4
z*o@FyI*?8sz~SVaG6ZA>rk}NPzlcbYT%D}16zRGz!qVH<%N+VCSoODByQ?6uJX^;$
z<_Q2#Gm2n#K0%6tpZ=h1xFkp=BZy(}c>|;%@O%W3tyln#Rj`~;bFNFyRUK0L+iqLf
zX51x605~@T@!*_QQU`;#)e7Y)oV{(9UzTc8%%W|3gLw{K8<ZZ4`mZMtPVOD2KKmK{
z0E&r-z{#33JIV4#Qa*kJcE>jC9Q9{|)H0g=G}MA{#kLu%aB;=y2Xnhml+RcgcE|Bg
zgO!;5go3Lh)qNdK(DQ4FAd^gD>`0Vd1`&>g1BHAl&3NKyN$<f{k05KH`t@vv9E2z>
zSxJ~K#VP}xhtY$B(P&xf_0Q0Y?v|w^w+GbH(#L63wWyY&Bp~WY=I3X~RnIdtxt_sy
zjD7H0XTZ44z1=1AUSs~iUHWlr+TVbT?qD{5>qy+bw0zVNol9pLn;+iqi{JszjQqVs
z3C)WV{Y`uM3SWH)y`N~$X_3wIp+^hFKXql?Nk|Iy>y^IG2X0)Tx7`!}B*FkfuE5M_
z)pE~E{zCsGNe+Y>5^j1q(R%UPz2Zf9y*-Jn{#^sBxP~l=H{8yf-8S6_`XBy38Hlb7
z(g8!B(jrY|TzQC+{mO{g?|&m5;7!=@hN*lBlRaEvBJ=-d#KKA+9^Npwm2vfBUy;_h
z*Q~3H>19P8*C{tz96BseJROl7?<5eK6S45LGlIX1jHJ_-JAfLE)|-{c2n!bmLyyt5
zSx0C5L4Q5~m7^hmIpNs(23xAq-8M{*vCT5j5O@JL_%mY_i|T`_G)5f}4AP34h8XSn
z-1w7i0%-=KTexs+uo>mWA>YEfP;cO)!+!_<o{K$?HDh#lj5mj%A%HRA*y+Y3q)hyN
z(7p8iAaw>&n{d2t0t;=c&dw|)7^eps!;TTtZ!I|4*UQ{SEB1|0p>V=X<#vBedCT;|
zXX1$`n~*bI0L|Mt)5phP!bSnXdY}VSmUvyuH(e-{=a!}%-PimXH(zz7_y=2ctg;e$
z?)!6F6k^K^Ki6%&0D?84x((b<le?aqoHINvMC*Y%>I;i^bcIXL@;n@7NYKlDAl<O<
z?d11zw2rh|4v!y-PZ0R*RONsgA0TFF96bmUn~^l~{7<O1<U@N$n-X4$JkCpvKSvnp
zSZkjw_zJo;c*8Ef{<A%E?v#bWjBTBIWZ}fkSgr=~-XKxV6VAo1ty%LAy$qqwa;dh4
z?YlJlCZ-n6+wQDcx4t&ryD8g@k40@rdI*EZ;C-_pdKGGIHP4MW4tt#=B*(T))hF6p
zX0ppkKkHD+pkFsZr>8cAdcH-i+=n)%PmR-M+(>m^V)ct-SMYNx27a;TJ)aG{ZlIUw
ztmu?;rZ&UG2kG@i7APq=1e=cciqXCh-qVcYdccU=P_S$J?;L|QQOW5vg?hShh|ih(
zn^C1gKEge{J9wIAX=I$4Y`(vU0fjWQ*K3=hL)aLLxP0VPr8b0G{%P*=Dp<oW8G72a
z)=N?l+t<Rk(Q36<CeHR!!}I0PhI8`laS8^u-7rhSj{02DMLS3}|Fmk2uV($<KWh{I
z<7g;3;i=4YyI5miX&u{+fo{fvCf!j)spq;%72BBR@RsIJ7icETBh$%!TPR{CnNJ$N
zA_5Sv4xtH4%rP6JaXlnNEvz33qcl)=Lr&}g5^vQN-wypqqo-CH;wt%6#Mh>SV9G+r
zGHS&0@SmvTs6+P_QV_h$G`IT1eVABRazgh&zo|hyLwFunaY9B0I01~nzoD%igp#V{
zwG`}<U9xV*js%N(y8O-q<#H3vWB3!tG+lyUY%5#CqM}>I9PMQEj(?<WYV{`zlb^Ff
zCGD)NO8iYO<sgJ-?_*p}snZ1K3;nrB{AWix-)eO1gH@_tY1{`r9W^n2C8CDfeIa5X
zkVyAqb()!WI;0(_bxGj5(*Cb3*B_b1BC;vB0?btesLQ^@&oz)u*=*e;Y|FC^t3Dyw
zFD^`ex$D5$HL6Ga@>vGyKPVvR^!(%$8~>}4<VVxkrP%)56&I$>ci7%@3;?Rxd_O)8
z1TWilq*n0HB|lxEgU>m96bSrZ09`gSl1lmS^Du=*r1_Cvc%Mm-Ii^HkI)7VtfdARv
ziciKqqZ}rn?Pg|KO<<I!A-(?vv3<>X(Ed~AOp;x{^sn7{AYrC(2A?e`O3_CA$-7tJ
zyo&7ow9>`R)A73PJp2!u-9n2AK^pttiRY2r56zuz?Fdw~F|V0=-(hV+n9&%*{O;5_
z`(=3U5w9JR+|CY`Yx-i02(wPt7*$dvV|3bEC9boOF(H+Pn0)c(4^o4qL$Q+z?6mtr
zBEjPzZkdgmSCD2DUdQnX>XIciv)!0Sd6s*hf>7@My$cgDFN1NqvT#J&m9qywsVv0G
zN>sCXXg;J<3?PR*xZyHz<`up<H#8e^WsNVf%9D54R&V2}1hj$nM@twPQ&`M=k25Ve
z9<*VP6B?Mco>yC`-+T1Mgb^kk%nw*7aIQ#rPKj8|>1G|kc1h<20L=W`Nmjie-w<M}
ziQcrzF-+UurB;t_+>I#OcAwiXqA&g*3hg^kO*J$%5cB9X<O+*@a^-R&ZRPKrXaMrS
z{I1N<XQ<i+fRDh;caxR1OSz2(yhY=nam!*p-iGSz@HQ*DipmF&(7W`1Lhsw@^1`to
zF!Jmry!4;_OvqH$DCr@qI9|;cCJ$d)Hoyq{EtD{S8<tMcHu2Ed08KvT0AEMLMmG#u
zDQ9){dKO&`=73Iz=7UvZVx^D|jgEahXbA?rKK`u?K85ASlF0g0FI*HGVHtfO>v~eX
zU*IsXcTWNUXd7xc5+G1`fQS|87)DGw*2x>gLG%euc|fFxi6mx9%dG5ZtT1gisX9Pl
zhS4g3jH>0gM|Q-#U8xH&MyvMM;=UNovn?fmqD2J4+`IxJ&~tRMGVUwr{Cn@56*@o7
z3~3#}?Fd4CCoYY8N|fn;^<5n{Rby_}Po=jy>CagqdINuQ;S0x7W!@K8Ckjc4bp&b;
zYZ%4k6npCj7ct{+9wNaq7JEENN>?P0<Q2_yMzw-FpR;!?_o(h`c^vJKI~=h;U)Xkd
zE>86E!5(lN%e-$64KDP7CL3JCb76r2oC~#=Q%YNJuq4SVL~dztydgzx{EqIdl{+EK
zH`{||7&yFMpc$kV{>%0CI^n_u9>@MMgz*Rc3#^ycKjgoKf(Qn^P<;Iz-KoLPce?`(
zSE;Qr#0FM7M-yZe5kjGaJ&np6g<Rg=*v9Dhd4+^`k1F#7_oH{8NKlh%rPb-ffs?9M
z$ynPc5xeO;9(-LdD7KEOGzgBc;x}WrG|x}fidS5jva$yd>)>0v08iy_M-u(rN<OzK
zIM7XyU5!kik8m_)J@F~oFNQ05iEuD-Z||FJ30-Ly>6JZh!fIVg;oH!YimLkTtcQ~b
zrm*4%hz?TAVct!#bac~|!tTO+wuhY~4!u#HUrG5F>OekVlo9v80dy{H)89D{|GD7%
z?6CoOr6g0bO2&oa7^8oE>9J$)9>ZFYCz=$5YKo&HRhAo_6*-V_8A*~7CZ2&!PJ7GJ
zyk+FZbXN4Z_4IO{O8#yLw7(PJ^VSM{041!a@GUZtH%Skoiy%(Gl_BaU=vOnv3ClO<
zr$n=GIhc3(GA%rK6_8tH+CjDibDuHAn}YwzMD-%X8F=_nbR0_-7Ylzj80z9j{9smH
z{R9Z0Y;>G<uT9<d6)O;T1wg}G0sF=5r$%EJbM~Vuu|{|i?`Z7><0&&zxT~qBX+8sb
zMfPtYn1ED1sB~kH;A-|(u66B^P}U6;bpFPR>~Q;l^^ys%=+8nE;y5A7#1{W!JZLzW
z|0DDgMKv|+Qf-PN6=VlhqC;U5)k2&uD{g^;*s^YBs=;S+sZgUBs5C@kRF#Bh_7V8H
zW>{>cOG?mT*#$mACo#gyWq#tEi+Ie2PjIrl-!OVCd7GOHoeoP&gOtm<3)^houujO>
z!ass(C}@6aPT<Sp#|J7fx$HP}a|Ae@-G_UA43cOvdnQ=)G_<bG@U!9e6Ap-N+c5gT
z-|rm+)H(ug9Zr^Mmib5645zukCy3ySavN~Wdk;l&p-s5v97IAsIM!(J0&#4K_qCV_
z@Tl!^``z4K$`~|jKt6l3|HXA4E9=?vH8UV`qGpP?T0NM6*O5Y9fS~D2DERG&R85r~
zs9IyLAvou_SlrBNE|!1s1{wuYn%yHn4Y>X{|0>K*IV|CLt9b5l38>STfk^46X<Bvt
zdiyH8gepuZ<z|26LKKe+A_^8qiD8QGl>`4H=VH1k)f*>5h6p2ApXYh~c&Oxq{gQ&b
z(MF<VdFF?|XwmvZPh8N9yw31g;1MFKN_$E1@D)3Tn4-?GO_B50{r4F-*4qq3VU{|>
zR}~5E_7v2YR(udW5k06c9}W6quOx*W&|_@cyWJ|u%N)E&;xJVN1|UZqqO0@$HLNOS
z9Ed|tA>I#-M7Ep!_yyB70m*16k;8J`KBCO@)}#w9Xilcz`+UT-Q{%?jir^y~+DLPG
zyZ|_fgdH6aumz{m?syTmg%xG<>kz_F7LH8(x_vM<uvX}3J`6Gtj%<1$D`1bH<MS2x
z{#2)X9f!vE?<_7zBV?JX`ix`wi94mh!%9JG0peQ&@FudgL9wC>t5S6tf~=uta=Ow1
zt=YqKv_9WZgcN59Z{tsO-jL5vdoS$gjELp4ZJyH9(H)iywu=c1)F@EJ^mxb^4JL>|
zq=sbL-{ffLEJmacSrb0UH1I*8;(UYA+H3Q3jN&`GHZGNYkO=AKMWG!${M$YjZ*Z`+
z95aonE&WsV45TW;ODBt>J|-H%i^We`RI{q9%dGd59KdVmTKBHwNtUp}h`GIp02+Jb
zM7Yb9?^2?nLIhW{<F4Hn(_75SAqgN%Fr^D6Vr%O=zLhNnOj#Ynqa<}X<}L$c>bvGz
zY!z^f*j!6g$16N~6kXMVeaFegKf@H>?gW|9pt6{KzUqev?n3y#=GyB|9Gz}LZe%jx
zY77E%U=G@q175<RReDpX)YIuz!L1uRe_t;#ewaW@^?{aOxepQYO1?*kI;o;0sPHat
zIo4`4&{ca)KjuZE#{+*J;t`H$XTeU<S5hTF%tcv)$=ZIDs0L)~ak5JWQ0s~6Dfo9v
zNf)4DZUpL0h4(GhUPED%nVg=R%71i~QFkGQ;*>FlQlYxKL!zT2cAv>HC>YdP&p#IT
zh@%3+;nPBKe%33jri}v8$`7V(e5ABMVUwg3NJ1XV_5@0~`fDg|f&}BJ7@SJXSlqM2
z7oM<@fm_tYW|h=u|1BTlUteJpbiE_^#4L&b)%`ehN~qmx8VhWc<m8ddev>M=nUV5Z
zAJk@_Q=JZLStG<qUtx_IP5;px-OF(J0of%B`ivX^0t^k;j%YnWUtExijJ^{@X?#*M
zk9)GN7jCS<!6B|n4T${+wzK-n2xOo~(C#3FGM+46mu>cd&JC5|iH`E`6ou4ErfBY|
zt0^}NB>IDd#JP~I&9HCylhs>y_npL+OF5o4Vxg32JFZ|YJ?gC_T^~$KbM4P}wJ^)<
zLk}Jn05=ZKcij%S`-8*q_$I?dvja8IciWv&D$VzMTeTD)6dXWI_7%pC!M<j^z)TEw
zWbB8mFJ)0VwVRNc&2pAZ{uA1LE1agV|5=U$D@~)@R}Ddu$6dw0z8p>>k6u3dV|xxU
z#u$g<kr+Sp1xv=sf)sO&;}Af?JD*0^EQrtnAFYyhSb|{ZDkL+<I+l0a?R*U?TW|A%
z%GPv|t7TuG0G+eCeMm+;0JDQafuYq`HDQ%Op1CjK9G|XvG-4PgoEi><yhu|isrX?$
zRQwX-c{tN!gnvd7E~o81jeT5DGPIY^m}<9&6>$tY`I0F#9U>G5pd7M?n|f48{=MP8
zc>~Ui@of5BtK3HRayEcr*|aBFYtfu?)K?Qf<BG=;%a)ZnC{&EVOIAbLi+Q${4m4p-
z3*UtUz2NXbqdWB+x(vxfQqCl{9^QNa!>;L0ZJ9BEThZD|uURQq7gebB;7-|bM>xT4
zrr%W+Y5yxj!b|yjC*Y_t8>zjeFviTQPEDdW95Q!_j126GtO#3<cx+=O2o)BhIyCeu
z&x&x*^6MZKF@f<~d;ZHi;&{AjHmg0L8^k9Um5Z6h2qSLBZ`tk#pRz&cNYa3=)Accz
zWQC?f@z5VjQ3*XAcM~2~+<JH8dN-VzUY^3bd#Ux~nS#DQ@MJ(s4_2N$oDr72s0<>4
z<p)X8CO8;Gr$V<V*X#*jvtan9@#x+SLDJ6p`t?NDxv-!ELqKdI{MbBDFXfKVJ?7qi
zcA(re$LV-Sx@?P*UXND0Z@RdEzA&XB;h#Y%ky_t)!PC5^-EJp`)a#@)$y+M<kUxBa
z3e-x3rxXmu_W5Q5&8oZgau9<BWyPT((+rqT>Q-b%ZIoWssxy5%uzZj`FH95%X2)k-
zdEVO@?yt2A3~&7`;q`_=zY0ztdqn0esoCh&>3m!YUw9=LGV<?D#HVpxJ#nA4W9}$4
z%>em$+Zcbv+XrMD^ch#p)|$AezRT~O^h_N=9f~O`BO1EBw*IKx#JGme?D09~CRtS0
z%8$#Id-cP8RFB$8N)2ex%E>Y=fs;^B5_DzH8-QU6rZd;Nc_kHjnO2=K9>X&scR@+o
znj2ZN=GJnncE@PYvdFQF>^_7#5YwxQ9ygO~gB+qm|5gS6FZ@+E{o%$O{+p;^JBehM
zx=AbGcVuV(VlKzq%zj?J&+)IbAU&(?9H?fELLFw1f3_7fj;dl=gONNN_K7R;qT@Qf
zX+pK<F?Z)$$(yI<8?hC<eQBg%;cK~@A>6yKc;th*Ad^wu!w5+lQlhexSB-Wcc2R36
z=Gu@m-+kNT(vZY~iBMhZ0TD$a28+;IHXt?rBZ4f&$FlTje{9~5T|YlU`o7)p!;@Pq
zb2Bv_>KQ^poSo%|>uY;QC%x2_uo|tBxH#rUFB8HwyzQK=j0AK{#DEU~BW&Jnd=3E8
zv>%49Esvz!(8YlVO6C!N6kh(uoVnUf{%j0ozb(7eZw6vp@J9X8N71-EpA!@`0Vt6r
zoimD`^kRsyxmy83<2xg&CLaX0Vh#Yw7k_9hr;q(es|wwq-z1{GBsNUQDM~qMO-ANn
zvo}%%nn<G*cQ@2yN*Wrynm1;kUw+v#!QuM7uJ*j)ia~>CChHL|3i3Kh+=>_`LCA=!
zG$F=YTk<`>I)0RfKhorjQ<$|IE}o3B{Mnb?*Z8As7#UH*S97BsseC}0+hZ@AhmSGA
zR9;x>AwaBhdk2F2%13IJwnEAnegzkQbk0HJ;ZHDSJHIS{fm)4>p@aa>)5V)Wf%PzP
zZMcSGPNGg3?9gD{00!ol`z-pyfBK1$*T3gEZQ>*f#!k4y8MmiN9_8BMTznoi-BA!{
zBCFe85}hvz)P-}DCqm;$J3WoYhlx+#>H$g?YAz=gTzkwDW1bxqFT`$Se_EB8tD<=y
zK}5KeL{@|@iU?~)!dY}p?zpvD0fZ_F%a?DJg6E`7+_c_|xuT5hPES_wYwy#{C)}=>
zFB#Fx4;^>a(S}&&zH}{$qy)8BZZ`(dGE9CELI3H<?v|}u_KV0SDlNFumR-t88jX^N
z911s7lY$E!gS5Re8LB*g@p6WPEtVe}0}A2^xW$f}T<c^Q@H-rv64jKMsYI|`3ZnBE
zK5-<x?MN01w$&kIVikWUp6E@r8QH#y)8Ix4W89lQan0IrW2e45kRkYyMWji7Hr*L3
zZ!zgt{y3N3CY~0-c+1qWY|ymZl574izd-ITh@U@W8{mk}*G~e?hfcwXR6-Sz5sL8n
zdYhCR>iWL4OJb&xqALQ|r!YSmh5sPj`Gqa(LE<awOAZ)0uPM(bWwA^qZ=~w_DyobQ
zQH3WY2}^T9)2Fq5jAaf5F?9bMs8)?m$niPRbfwgls5xs_dQJ5sGiI{Z&jW*3Mdvml
zCr@{+uQ;s#THwm_D{SGzy$mtj;2<bp!l|J|NBxONu6ou&l{ufUv<Q960-QXLkaUk;
zTIu|^H8M=SZ^ECwplp=#LM;^?e<=MN)k8pp&HK~F`V3rB@7a+)O`P&DgQcVWAj06c
zDnW|!EA}%Bg~DMdRYYT2Ul>`NF!_!SgkrqbUuC1m9Zg$gH7|+^x$R??wtB0Tzh#9m
zl4D_X$Ew1F0%5_I6P5z=tw^*<G$ZcL<NZgHm>Y($J!~Hkuefo(49@h4bxWp+b0fui
z!X*7OkD2nx!H^7xGSM{`lu?~r&N1LN#91yuRiiA!(AO-ujy-bRuJRC!jS7p<_bj*$
zbm&{!tSe`hM+v|E9;P&CvM^w%mRDG&#&rMGLzc<W80RHkv-Bz?C_4&tnwx~0^ab3)
zzovuez-j-{foI8ncYY1(&u)+y<xm6ii6nt!6kptCP=^~VKkx?Q27G)iij{<u&LZU5
z7R3sw-1a?NstFIFTbd_FEMF(GaxuiwS-fFLp+Tw8(PQng;5nW2S(t7ol8nvI2RIaE
zZROza+P8ReIP6l)qQRx#Yt^QH>N3n876EyK(D_OVr`fI4GX^_tvDl^1jtwaO-IeTT
zMkwnm5sK{koqRW`ig8;~nRGMsI*Sfa)ccV0Zacxd4L^Y(zC#O>$J+(l>pk2VN<7&x
z@P_OE<aE8Uw1PT8#)Gy)^H~0eO-VVH)+yV=bAUY{f>vralyx${`cd#BBq#{hhc+@O
zev);&1OEYQ9U2<7rP{p`Sr0}xo7&It=Ucbth4tp<cSK1=b4>{mE66T(+heUh$W8R`
zb78HsI1QZJa>J4#kxN(yF2ji{m2|n!G!x`y3u2p%$5GTJMG*NS(GP3(zcHAPvdmX7
z(-_O`z(hjsR3LKz<V(OJ65LHsC{nPs1tG*-e$qR(q<hdEkCFu`NcdjXdX^GI_&O*t
z5dDvwO=OJOW449SrZin)jfd(((5IdY(Y5gbyyqk;kRbeoHnr<p6FW?NvD2X8#mX88
zn+9m4KGu8kMs!Xz8PAQEkW#UAm`P2_6r3yBVvfR>EZfpU9ytH**+?*UI^_Vbfrw!3
z>6(?w?->RSAee8~c#G~CzsUXt8%+r9rhKF5?`Gi6Z2kqi2nuHl{a|zs&U&#{P`_iH
z{t2j8Qk!zEa4AcNC-F8E%zHoGAVu<_sO=fAqDsfV0mHGxsWU`EFnzqdYS~SWcMr5E
z_#rT-MQdi_$9gm`vTjGE&Ptsnl7QAh*#6a#kHC&tx%w**BJTuS;rAWzoD=;_Vs{&@
zU&@q!G2ZW*6PqngU}(@X(tPsvyIP=G0k!Uy7^(^K{ivVkw*-2u1vXB`*Y~i(-lV$-
z1RBK3(_evXEQdG!-Zx17pg6w(m={<cytHAX=tv~7SxVl=LtTyT@5R(%L@d5(x+k~N
zN-2jH#Ox~ffw2neFnh=?6ddDb2ALw!jKNOv_`QIq_Y0!<bh|;X3abe$LqF@J`_;As
zLNMJSMDLIkUleE#D>x0qKWS=w!*<JxDpC(YfNEQKO{B0~wH<5ZpjIIqqhyf~6|thQ
z{DYXxrWDmpEp;JWCxSi14%!4Mx)|^3(vBa2L-O{p1$v)jbZ{C1o?i$eI{lmeT13aV
zL`w8dA?)L3jc|(#BSJ)#Vwh=ABoXi@>sXe5G(>K63|_EnpofmdT?r2c9k-@tN_1@j
zT|qr8(IXdnbLF<7QKDFXbnL6h2NrD1!96r03eF<6oHYld;C=fvhC*t!A-j=p5@aJd
z?~gC+t!6T&#q&f_mp@FZzuo8IbkZgogH}SM5Rf6JE!TYxKQSHV5zH}(W!M#^*ig7k
zs5~FZnChK|SJ<eAoxEOfO&elI#%#q!HZ_3T;I5qNIZHl(I+kBaJ4*i&2i*L-#J^>T
zdSJyWlR=p)uZPKG{&nlc>?^WIa#bNs-xL1!xTNqx;`pKL&N%uXhJPdJ0@n45z$Q+>
zBQ(Ry2ogm)NEqemGv~bb;<W(k7}37?DTB+43|~JzmwAtEETu?S!Oy_qw}oXUoWIjK
z-fB2Ts0-x|d_iu0U}a-O45hk_xQ&O5hiEyh<?`A`jgbwHNrT*Gf;f8zO;b~wQV4w=
z2hM49GD*=)yxrko_XIqXN4qKodaRS>Nq;sV!K~f5A34i0OeucKb|b4UHW{(hbZ>AJ
z#Kt;oQ72JeP*1rR8%zH0`DD$3{X(Z(0Q5DNVE3<x(5-x?;7XeceOFx=W_Sy@hwT^z
z_W>$LDE%-NzV7PI`DC_;Th3QO8lU#RlL)jsNCm{%wHh8u>)J+!Peze5nvs@-2KjZn
z_SLni2g-Y@7?WtHwRoAtRI6_Ff5_K={O58x=D`v=5aaXvlN@#8f8Q`6FNc%0VzyE(
z@l3IUTtJ*zn=<t-kNd4^%!k_uxgb0fsa+4N4USQ=RbIwJtQ^)H_Y#i4vhou@!+***
zDzwbZkuDD?zSv1d?0?v5Sa)4=9#aQ|5}|1;`G>atH56uJAU>Ih%uGxld~<V|rz>8I
z<g!<jYnM&Ux@<#!`whTEhgWT#KgqVYv?jT1_N_2JrrT@1_m-4>EY>g(p<qS|#>US<
z5m%VpQ9**Pn5@fBbs4gCk%ZF$&W!w)m4NA6S@p7pouA>l47vXHcguzZqr#MKHQ1$K
z1617ts93UJPT!xN*UkXdtwZYjW{hM6pVxV(8F(c1-xS|8Xhe#H!ypYT<qnZl)roLC
zF!3K)gb7^vCp(9S4?F|83Y3ZWeEUtnenw=ct+RTA2AB}>*tHyETc^&`?sP%Rxnba@
zFJfhcs0qmY<q<-S=Z6djchLiTIf+^cX_QFWqfC6x5}pw4AM6?`IhcMbZ9R%wFA_Kx
z7`+tJr9>%{1lPf<5m0Ybj<!?*M$qsNSbSs{x5b=2?NSI{Ao@j$c*9s+6>m*(YeV@G
zHEiN`aUsPZ3da#~ZL>|uZ>?dAI3<S~_-r&2Jg76s06-M{5|%<&{~AU<iXyC+|LDQY
zNPQrxHarwDNP6yJI+Z06Bvqg+5pa#yE#pBn-(+WKV&RNz*k7)8245NMlMusjG?LN1
zJgpNQ-pXj?o-mczTcZA(0BF_}i#p|N7k$BuCI0zm`{St~h;he2X>EL7?GV!2%@klH
zDEkc92gjQPNhv_U%<RxG>=+~ro4f{PCXlD{pxBCvb_1t|mZSHsan4V6`PKyaUn)8H
z3F|S!=_;maVApIF;qV$-6Z3^=rm~J7bC<I)ZJ6SRlyE~cG3^ccoxGE#Sw@0c3|m6-
zaf-)T3>&F!k#04SkObQ?Q;s>1dItK&Fj;h;lDDMrJ`k+muJ@Npm!0Q7JEX|Tt;IJ5
zNlg+gjMBbBlyHzPE5r4CM2CQ=ee){6Z4R5>1$({V@q+nbRF|G>s^`TsG1CkF*A^?3
zp=}%|(2(lLk{Q9>C&gu^E!3=7Qg*_hq{C!|u|lk?nXwQECeM9)dCW7=>ED7ArHnr5
z>!P8=5u&n1nl(SBplm{uv=su0N3<R&!SxBd%H;?4g3gV{Yd1NQUE2WM#(R!<uTXqS
zJ(#`#r-;{j(r4$1e{me|xGA;F$KXwIN>=g3D!T(T*lZZ)eFix+h!U37ZPCoOm<@3<
zH1$u?0c#|ssaF=uR5W5nXc@8VgaRzq>28W<paF8Dc@0edzS<4nGd2P<4aq*BS~#2G
zJ3)Ku6^VkM?;(Fw<aiX)Ika)ps_OUt9bqkbs-(wCxNC1rzEi_~W}a!@pSPGf9+xWP
z)r;ZD23wNEL*kIcAbF?4Zt<3f7~%dDVOU}+vMW(X@X!UX8N4Q_f7+}bGh#epOcMd!
z*|us@cvxc8A&v;{oPTmt=9tlxU<Rj^XQ1Qa?Dh02@jk)5;!@v*FKi3#eBv<zBt7p5
zlQSkbBQO9gqfyUn9gry^EHq;GFha?tvSwbU8L-FKN^Oq~P(`OSc62=hXnPtkg8{i~
z_cGiQieIj`XHR2hmXMz8oEP>-Amlx{ozSo-u@#Q2g<o3~Iw!^518UTZvO7#GP7pKb
zv`|Yp`{a7`CVWrF`F=cLWP%^K+bJNiE;zGy!jbUMivC0nh)Tmn!saU4MfbL)<iU=3
z0foRJ!c4dC#_w2fN0R$fKjWGjR+JjFwja&e7?dvDifPT;98r&<4h7R~vC1Do%RM7^
zEa)Vwb(lOCl}98oAbqPH#-;AO&U0-zwMhxA;%0Z!HA;Up&b=;2ff}sP3>&x`#fJKF
z9(n!#)^nR0Mk}xt5=g*){Kpd-$M6N@PiWAnyXSL0qY3+kj(}k_aJt-a;CVOuZ*2|O
zm`1~ZhbKGf)X(nrSNN_&&+d7px&cSJ8||6q_?wu%$wY5bXRLj2x}I&10XUsDL<DJX
zN;xE<Y+veA*ZdC6c#th2CqJyaa=p1afmN+*gO%{#7RqD7{bzs>0`DqeI0=u|Cl=#|
z-Pc74rIqQatOzR+nLx2W0?!MIAB3J?PSv7}WHaeSsHEeH^yY1AlKa(MacQ{UsqSt)
zB!N|Qj@?m-locNynP!#)209H5TK%95?f(O2Q`JvCm>xYpv6V1oo{D>|VR0?g*8@aa
zeR~tWYIRLrb*6Kdh%E~MUIDj-!BJ0FBKsSFC31vDvtV$Zv;vFO73hi`c$OBqz31WY
zdM`9lhzK{UVtAI){eCMR*oARru!+rd$98(Sua?at@*h(FBt?Mw0;FM^&(2<<P^@fJ
zOmG8#sRw9EYhwxAk4sIHY(>cRg9DJPb8?3G9(Bm;O%cg%@S#lUx7oMl(ZBRpitVw~
zb~&U+_-TsPj9_z5NQ6s)nAI4~q{$SuSFeZe7TN<42{!{7Yu{cJH2yszaqfQrZ#jwl
z2p$jo*;_FMF2}#<MnJC|LW0{ujxOwlqY;@2lJAgpd=US4@|xAP;%@_rH_iK>#3YC<
z-_${v&c)=PAp57dvR9YEYQPl+ZFC~y_L!;(%u$^H>SCyjYyl9xx>sk^nQok%N`53>
z7b{-_ID{Kw6$`Guw{gd%5ul%oYXY7B4xPthIp=y0px9l&G&#PkID?T*2davw?30)s
zrGX9$h+aCaMMzgrFT~1f=<}3TFo{I&nEvVaKSN0A4^)@k&@?3_Q`NxE4u&vrs`4xs
zZ__4JCj+`2y@Cs7W~|T<4+Z2BU`Ge-At7O{AGG>xh`e7_NkV-d9LjQ@#bC!+|Em}H
zK@~V2TSesg3}?o$pHM?`&>zGRT*UPyWAq*h&CGZl$4mSGmi`7Z(<XC+L)#<<unmrF
zW5a6tv>vX#iyR(x=)(3->LDMvyUarW)z^~nX{aNQl1?;Qv_%e0!=APJfu5EJ>pZgV
z!*jq6flm|o+_)e86>f8Wo%wReFr_(%p>!_Or%YgA)g}a60o0xW#-k|vQel2b5HyS`
zrG1snjcTF`BMqrTV67=nL<O>}RM#RMbWcl|iR@7~1JXn`t9QAiNOg#bELWJ-nOl$v
z<%CuV8151_CuxGv;svAdi@*>=IkrPU;$-Mur~FEmqZ|{j3Ruivt{y||y{27cS4oR1
z36W|K)R^1N;n82gKj-KU-itLraGQEUI8ihN{oi`Mpzh{0Um+}shzW5Qw`dhVqkT$!
zF$c8<s2WPF9!M`AqNk!2`8efGF3Ch9nGz{_0Za9ek}!+`8EuK@Ap`OlSdIdGhRlHt
zd#%3~&;NeB9EMbJ^BJ1|VmA2w`Czy9jP}BLG;s2L?dV?@_SPcQ9!MsPU3W<1W(nif
zhDI=CgNBqYI~JoWDtf7Z?S>;xQdEPRphTTOo(f4-j=n?&g1%~39f(5&y?7#J&f&Ws
zQUUV5&9O=w^gS7VfGN&p7ytA;u;AD*Q|TJ5T4irt+A^aa7AAaYh@6^p8s}#ll)CN$
z_I9_`mr`J86EWi;r3m&CXu>OV$u#%^&<pG<7F19=I=0HpuZnt}#rFP2*-N)n4?pzi
z%}%Co()k!(vs8<li&(u5j>=bU>yIMGEP|zB@teI^;h#(XmnBkC`1De>`z9lhg&Hf&
zLG@l=)WE->&A{?SG+aN-*CgOm2I5=Qq>9z(@_FF*kqXj>WGGc#JrX4PSTng9swQ?J
z0Z@O5v;UZ=A$)BS@jqT2&fhyg*YHSoVa~ljkSJn3ci!CC<F`^c*{y7ov3q2<H_;bV
zA>Ze``^(3vFEpWOlID8Zsk~5#>1}2%{87*-+?EW{!@U0eF&^n^hJ+^i8)S5pkawR7
zA@HUQ02-)6_g8Klo6uU8Hmew*KKr7Ao>S1_tM;x-&HdQl<65(EH2fQ_6J)s{#0@)=
z-u4t8W(@Y0lT>0bAW)G<_4LX0n{3cmzq43(z^<&Nibx|*7dmq7eaBQN>nbvx7g?U_
zr{*O|#N5vqDKNypfr<R;hehivC*N+-V^1Rin~=$iR#hfaVvv^XQXT4f)rM=SpZNvg
z?AZu*_HHO|1178b5%8MfXF8DNdG9*>UU_qjlE>hCj^8DrGZWKg&5vKMWowCRke5t#
zXQ<kH@V%0J3D21Nat%GA4a}EE2X2_n7|oxKVfg!hjMJRynhWxLE84Q4D&PuKWbO!M
zq9@qPDi9~a#A=1}f$BTew+t>?p3eKXKg0$5tl}=&iW1C>)}aCc{u87}*F0B!#GSf}
z2o%?@<KElhyS1zstc0EZ%fk4N@2)&VlU;oO-}=~4h&wlIL6%@)adcR??k{gGA6z)=
zbB~KCesX+#XS2&e)JfX0;j<mQyrsX1{#BCpq7W`(;F9Sw7n<>5JG#Go@DKxj^7_VA
zmbv-mp{9-kxQE%eJMsko2-u2U-4(FDh)T6W2DJRL=f@(#PjfMQG*i<5^w|JY?2EV5
zoJ?IwM^$3R-kJLXEMQoQNmh+_89oxMH@0RUoqm6qVNRs0XL1!su<s+#Uw2ELK}$R<
z4Jz34R&=)0{d@TK-v|5L6!M`HF%O^1P{Oja@3$o~`GkwI{PCUOIlHr=XqE5chI$TZ
zdj3Sy1de4B$S@`|;SMh6mvQ<klr*s6%h+!&vyuE@34z>S2+Os!oa302n-=1HmX9be
z2>)J$zW=GpMEqRrBbls(h3U?2d-59J;h}lSDRm4a-J6RJ^k*FSw<w&aipqGdJ>D9#
z?pQ;I$&_B!-ulOb58=Oq8^rVauVZlr)cBWBlhqSe;g7@J#6l&b0GW6kgMZdw%L07*
zqPDz_snd}z{Odp&u`!t{p|<{7vAz*{wd;lawsuouCW(ZjT_wW^f6GTZLUvlk$-NN@
zSJ_ip>=Enhb%89s&oB{IYA`qKy%B4)4ZSITj2n#*s;J!I3gz~7H0N)4p8VOMJ+mfo
zs=>4tG}SGHUI-0Fk?Pf`q<Pi{>i^tW5~yO626Bihf^OT@R}S`zi3HFHwCZ*SzX{ge
zwk8<Ih9r`nz;9~1y22J$F_IXoB7alIIEXdMzQd4g)UQ#dscy5fEEZS%h!+bsz9fJc
zLh|7HHJClJ0AEDf#0eEMXdl#5j;EOQFlQN2dG5Z$4{I5V#Q4w|=OSjW^$E$aU#en_
znPv66e_cr@ZBdX}I~oErb=ay3v=|hv?j1f2ph`dguxcfZ<a|ObCk@DG2EUSPuNKf>
z`9ZEE+^T@Z5Ppt)*kW;oNFqkR1%h-#9j6g<-77tIA?<EX-GETC_B3H4ppK%OfggbO
zY(KpqvQTKtgQk>#T5Q+{{5D1bWi-!2xxuEDI+&rz#!<0#0u0zIGm*A>aZ{;mm8oj-
z0+Xt<Yky&RFLiG}lZqR(r>J0!oMU>H6_#+VuA#?G>3PvJTuxxH$%z<+HuGf&Z=2U7
zBBnXNJ^rhl0BbY`{$U%+37cGc<u%i<Y3sf@xfBN2qfmuk*#BHyM<{l#v!<CfraVQ!
zQO>sOzF`(cNEU)O-XF_p-&(ndj7D^KhJ>`*Z(TRMf8wn&(i7|wQ6m&y=;R{RV;gB=
zwdX-><zJ@&%mQoRx9$lEi6=)QqefKq@7a*g^h_&e_i1mjkqmyODUNq)--dJ&85|}G
z_doIfuu82>>oSk6?+RgW^ZJMAN@I3YJ3fjt=M&*0(SNn(XW>>sBhfM<w@-)fw}krB
zTr7k%>|D5e3*O50Aq60@^|vS~n(#Enl0ue2(Q{@IUovtFTRZkCyS#D#xCLl1*-##b
z-hAsW+N1kL%LKxF(2oXz6m2wS-48$_60<K>+ioGc0l;(Ud9t(fqFgthYwc8GGhX<R
zR?Sg4A|eW6zVp?hn_gMq_#mx*W|Q_RW-kSyVtd3}D^Al5;rJeloB>yyDi@xARVabW
zHlxDVR6Sc22{|=B51ofdWk_I85p;!w@rf+hxLG?3IRmvBWB|DpfD0TCK<C~|{rxMq
zo|q{|vjH=~sa89ECI8x{33u<arSiM*kVG~lo({FF%nlki&_W}Km654ct`+X?m(kr9
zvF=dAUmdBwLvrd&`oH$*2to!>Xut3Vr{V9LHQk~)=~kPGin)U?Z#*e8>C5cFzw#S3
zN%jsYdX~PRK6D1QSb)jr!@AbttuLwh{?R|0$9dei$dnT91&D9jrCr6;H(28XJ$%gv
z?dh1Y7X{=9$lbypt&g&kM_-8GFwb&JKKyMTB)y%SdMma1zkpSD()+fsZ<dJE<eZ^K
zQ7w~fiS?BpK@IX^Hj58ZgY8Eu@hXI8syf%9vzQ-&x)PTLi3VHSp!hXtPYF(RhT-L4
z<-?(ZFv}HU9^QU?ar%$pl~khB0FXnQp!FqKJNv05caT+=nR)^J4~sV7HmtvJNrFcg
zg7NTEF3aq;bu9wfZ&O&iRuAlQHdqa(r>_SOwPQ)5Hs{2?7lkM&{4wVymC4~ghO}^F
zH&p|vYiOwRgCarE=24xgj_q}o?6I|Y(dRW#^Kbe`c)w+X*i_!!JfK;BzR$iN<;{_~
zM*}}d1L8#!am@o`lEJIQQlg2ICeWuMbga-1?#}D+Z9hY3GwqIQHpGbce8o+c{3))y
zMtX5#O`6VqIdb4c1OreA>;q5YN>aD|+Ykyx;V~!A@6j)k!<CdfIICY%HWcbas&7TP
zSafu@W67i=1<v5Ly@B?3=5E2U0bpn4EjCtfvMz8rvQ+q@x2(kK(Ca^Kclf;+dx?(t
z-fIDMEoBPdfM~z)tR@=(V`Rl!PM-cPF@zeR7k<#;V|)Eg=0?IA=1CKY@5^l$Md@Z*
zZ1_mL_1K*LsKoY#-^FYgoeV?z^C8hs)g2ntMhI9ziA@B8j;{?6Y<GNE1q3Uy2unL3
z=eXa&n{?Q%^Zj+n*m5gI=jrU8v=`hZ2RvYC1jr=b8gnMn253E-2o#wkfm3Ozbd^3q
zKCLT#AD89zhRVPy(U;aFp2y(kd*!JBOQc5zE*2nG#agd1IhZ0!CDzbjp!r6%Fm^Eh
z^hA_GmtkW6ZJ76RY#ona45b8+VR}vni*2!EU#Y18hy}Pt-isdK%62Qe7**tv`R5Kz
zPTqEmUTIdRk~SeK%_O~O?m7OM<65i3if#wPDjFDbs%Un?F<dnR+ksGu=>TBi>@%vG
z5f~ckd+jj>48CmmIf3Izeg_Dr`}qtVo??BYxtf5s%vg_ud18a*QKBLEX0ifpi2I9C
zKDptuM&V>sxeEngXynYdi<EE<e=6C$i{cXd?uqZT8$hz9-$ukS&*#Rt4M8JsFNH<0
z(k@W`Es;q!dJ0;JdrLQ)1A(*Re|S2}sJNOYTEoELPH=a(;1=B73GS`|26uN!aECw$
z?(S~E-QC@tJMVYby+6BW&RIR2#p$l9UHj?#%_KbxRL1?w{B+x*f2ucGUSIJ!U-t>t
z?*Gs2X`>`j9}8T!8?6(HcExOgu+}bvLSm0^{%8@SD=u##85_UmpfTE(bfp79Dvev8
z=ju@ye#cy@uwS@TYh{FIXyY}7EP}r~=!grOpD(*rg>-bT(ZxJEmvJ+;u*Kpm<bBy9
z!-C&?*lQVv<=pa4PsDkzlPiGVT3B;H7gQ=!Lr3m-;emV2fa&@!?q2J}oYy!on*tH?
z4|O#)f5)uCA{~na+D}g0y$@uZXM;ug+Bz+3zzGTa%4L0Ij^4mH84>c&DF!oP%0(Zc
zjP8oRCFQb&_iu)<L(YXsxVs8}!tc5+qq7z(K&xk`Tp~43(L-&$z>CP%qSBErbE^D!
zCNf5W+0!8fbzY`ryRcOVyhNbQqJ;FFbO86Hhc&I1a;cIeO=1=w#+AJbUoQaYKiN5l
z9Z%k6Ve0+i(Bt-MQYE>|&WW+5z^x%tLr8&P()EonHc{BcU|(W;y>5#7K4Tj8yA)vD
zb2J+J%M~@dJ7F`_7hHJOLpm0_C#}Am2d7Vj)8OHIIdI`l2JA(5B}?fH4L-#d-8Kl9
zCm|}Q$7H~e#Ov=Rt|g@9Ur*)SyrRi#Lmd?Cg(BViAwJhXW7(3~R<8*SL=%QAR|c!E
z_p3w6edEf!<l^=0KX;60k{EM=nSc#>(|izzTIXo0Wr)iUyU;2vjOLtT8r7}N!Q*g$
z`smzC{5jm_o>+|koI2r3KQ<O0m2{>9g;3Z&Ks}2nos)IakVaO<IrT57G6U}sw~$n*
z-3F^4|H^^_MpE*vPzmCM2fqFN6JR&<#Q{l9X9;!=svyu2+v#UuS-l~<k%eE@C9+Rl
zK&G@M@DCJoqz&>I{;%YAy|=M^Vj@IZ!!H`7M#!VG2Fx5m$7NFzTi@9UZPhmlItRM^
z<O4Lnp1_0Rf~VSWlAxK7%7z+3@|PaeQGvD)YqF9#ASkTPHX?&PQ(q1=<|u=ZF`3ec
zoU#qqOYjw|IA3Re;YsjBok?icj4aFxH<x&&SJ6c&V|pw|*_&~qIZ&PLc`f5`aa%0%
zc^rVzA4kJMXdw-h2vP6cp#E3D0{0R`Uv(u6+_n@)Z<uay?K+0+Zz}etod>9pRpX(0
zqfzv+WSWCQi=G=!e35Z{FJ?2GoDMn?9BZ&(v7}`$p6n&g*9E!Cj!SRIX>Qo?o#zWC
z2kJRioe%qI@$2{i=*8P4%{2L~1E#klaQBxF4%-6l;A#tVHuKz)7GAfO=&JHwp}(P)
zBF>E&&Ku~|6-WE7q*iM7ZL7|)78MPOKod7@mSi-?t;0zjJ{aRBh?sl%vWcvY8=<(0
zL|JSjjtJ_<UI)Qpt(*Sxs@++4A+ITlwx}7LyV;qZ)?--7-${bJQ)FvYRyR#a!?rl{
zh+Z+P1a!AB7(BSq;3Btur(fUSSgD2=ps<Ag&04yxI}t()F`zsQ8zl@v_RoyW!p1K@
zsv*;gM#gH5F_pA7HZ8~2N#eRfFd3P6N)GIv9wIVqAln4g`+yFMVV#7;dq0B_u6}$a
zJ%Ks-!TKP^>XX?qOB@bgVakAWW*~+RvQ?ZyWAetDF0n5D6x{@Kid5pj0XDcR_=MIM
zoN;pW<1*s!K|~Yd*0xd6kdye`j8t`I4U^*ic9mm$$$3ME$pr7s75YIRb!ccl@JC)e
zYAo2QgYEF~EL^Tk?x*)!e~Y9D@gbRkT;nm$e-nG-EgyUbT$iF5G=v7b#O&9RFZiN|
zZ>`y9)F5h{;i7*fo>MKZxCV0-RjOO2)S7y1-(1=gJtQVXmrTh`rkx3dbFZ)*n*h`}
zQ&eAdn`w2jY8p(%J8_19AQ?$XlmsELf_u>MCTaIY<JW__`vzs6$BXCaXIr~Ure0ow
zw8QaFbfL{v4{^K9l7{)vIkG0|z%NynR*<tVUdN)l<ODKGTJL$m#r-QpkqXR4dS*>q
z=~TUsV(RW#JH+gXjqMW*A6ldm?i-;aK)y5Ua{c8CBx2Lt)lU#4vNwI_$SoYyjA`k&
zWN;rAr3$<ht5fgL8&1L#*2Av|X?wgV)Zl{k@qEEute=STJQ!8wbo9e<yvHL&!++Gp
zKgk{YVW8%t&B*Lu+9f{z>$rmev%8j(o)C_^YN|iroh9*&zEYk5C-%7r{{7QC!4%>#
zZKLp#kP~&h&`jl37)HT#EELteDMDw0A2=>&ModEH%px~Wi_4?R=gFQgVzyy7>NNP|
znhZH`)l7XB4&DP%mrOmuU?$Ce*S~5uLS@zGS)DvcN6U^o5p7!_H%+zcEXz+q%Wj(v
zwa47tz(s6wLx21gxqf6)yV@wPOMwJi&OPZp+UMX>qZNr-zFdI)x{7$Ih*99u)B=%G
zYbIdB;5ghK<ufkfUXM=y8vBaun2qBc--3IAn}0pFx7T^G_dE<gf9%2B$WaZGmv}yh
zvROlEc6haD)1oHlSR3yAogRL@1yld&nS?ZXL60}KMVfXp`)EcpwUI*>;`UrCQK@Aq
zoq4N>RF1sG09kurbNG*)M_qKJ7<s{0i)0LpY~`GZv)aM=B{K4XZ~XA{h{+*$t`<1^
zK@i$2uty?Jg{74Bf7sg~PD8ov5hVRemFVH0kI$H|A_r|q1gC5kOrB}^oAkns(IOn^
z22qDUxIw%Xa|jfhF!v-H{e!0L<8KJQ^1~}DtWGe^{TcbpJj5a2sKvRheQg`Z-N%~m
zM*UkMM7cYo{Y58%)ILE*!GaM!@=}COf1qaB90t%h6~@0aY$>mA2ofQ$9U;G5mQ~-w
z>jmT|UhTMtAB^ejn{)BAlUo4^@$py^8u^NQa3zlLQ2``BYZO+$YW((7VBh=h(!<a_
zCGBCY_uC4A!iRfLWX+U*M<k+;aRT@P(<#(PjETPLN87nctLfp{n6s!08F<q8THSk%
zTI%{Kxj_Mh#$RSZflhIBL&|xRePaa6>M~PDyK}|%&*`~T*^&To4ff6PDoZ10&>J*=
zdE_AHBmhXQ&Q->Z3wvX9FDw^y{~FU@o)HESkSR+e4~$eH+*H<q`%K|1JiJTEZDrIz
zWt@3^zOT}lz7nSy21LIhjtg4HaI1r9P?L+<8w%wS@|a887=<!QvUrxq$Ddf~0$NKh
zYN;#XauPCWA~{$cz<11SjV95l0P6xB{?itqttUmHg3H*<G`BABH3;0o=EIbY#k_*h
zKXhJ~B<m4X4v|?Ke|=RG$`Bylt&ViW$(VRGl=oi{%nhlu)Xn<qb28|MHx(i>L}nsu
z6q@)s35HF3JR*w9rS>vWkC1+&!3mnkG`xabwGaANS05+7ZpzXQL$qLOXRrF;ljOTu
z#KMu<)Cn;esA}eoRny=$_<0+8bhClu4KUZZ@s@6k4fa@JR!`;bTEY%xZ03X%n~T?4
z4?Vj%z+qE>X8-L{T|)_a5q0ytm4n5I{e6n;;&LWw0BX2-K_SzQ;b#V-)b|b2E0upD
z$A1V3tTetMf34Tl)4Q!L^W2L5vhAJ0scTELZCiKn_ofSvH#Oas+``C-LWaTMwzJtn
z$gFLOb1&kH`30NWv&U!Hq<Q^C5PI&cp8~GMjKKE|dT$~GS_I867pW0=a{}LUFg4=O
z^2ac*kt|3xo|lmQF-8*#0Db3;gDF#o0(u+tujbX7XzEB`n>u%%y>nQUeuWP4I;^Ur
z?<#)Nf&)zn82N!yPY(ZUhHOuYiU)%pb!{Fk1KGe^1}x2ri7tn&U;Y=QMXxdeK+C08
ztbmchkey)*%Z5P7gI|fjAvsAMS?9$(tRUxUxjhvadTm^_rKNRT9;C=!aj!}-S$N7>
zJCGAt&H{z{z;2@i2B-CkPGW}uwvo-qHk1Bi+W*L&VYo<*3jXjMk?0x@{h1%!iJ~AO
zq#Xam@)&KW{Yulc_NDj^jsZR33jg_6>_KbW>DT@ueF6dZcm^wj8BW`PbnW%P?ip?K
z0Vs={$g0E&q)>iN*I0&t`5odk%N<)Y1~F@wE;hlbG*Q(=CH5m$mRnoNT+-O+5XP!#
z^w+O3C;hToLisM=6~w>AEnV+7`JfKeW1ps@lUPowrF8og?3aQ)--LEWT{(yNcU5?k
zartOYYSE*hf8@7+tg%v|AKX1pycG1UdKIkMgI*fXdCYMzCcF%f4pIK?ahv;60&+Xo
zbqw<yYUI@^qbswS4(>(!zTb`kqQ~#AW}s~Qb-!5?e}vbv^ZnNmX(gvJW%U_LH2EsJ
zi^S1wE{%et2Z}s%e@DpkqbD9sIWHVofDXI8!>Js`DykNNQW5>n#FG1Jj2+?m#hlMQ
zPfWpxXZdcQ4Z4Bc-naVRIv;F`8KaMx%ZA}MPufBZrt1w}P}y%c{}||Kn_zbZ^n2nX
zx$rWi;<gIeBJ-j>r=YCgyZw1jYoJQAv-KrM^&Ja8?D^Fw;9OeHRJ&Uym&Y?1l;7fT
zIpZtx_fTFEFyx7iWI0P%BEBM}iuxRu4^P-sXOtk2JR&h}NAmd#I_{Pc7m8UQR|Ul1
zdh$JwGjLY`G3+m*mzQROR~d;L#ed_$JjNJLevMCxDI##x0lp&`fSWT;M@ExnTG_ny
z?R8;Q6Bu+J^w=FOGO)%^r$E}$_`P-PbKTkPneA`}dgsOtcYt~!4>1eK_fvY$_M6Y+
zqi7D!7v0bwI#7v@hT)cda}&Z#rL=huxK%b_|6Hz^JX)g)DuhOI{0Q%VA*noN0@o`Z
z48xnT!h2u_bIcDW@V?zjwIB4KAkF#BW;=ZthPoJ^Xq44OG)IKtoJ!0)&nP2fLMP9F
zY~9Lu;NZ91d)&kafgIx6X<29>=sJ$)VV26AkeT7CunOB^i2AyOFW5SD_|GkNJ!>zV
z83_lT%s)8-D<D2*J*#%>>+_OIGSBiP;?Zm>iViN(PxXInDQZLhUIm(@UqujS-}E?i
z4AmkE8e;T~zOt~%w*~Mrv(0(iK1<kn{CS#B;R(Q68qj(aoz!=7!vDbgaWqj2XnQ&_
zc$o!VB$!YX-U1$<m<$>=8b?_v@uOJ%tvaJBgqaO$Q<47-7e8q@c6~c+h4@zSOyv!k
zCLede$zP}c{FS+RaZK*6Hc)28!COEYk0JrQx({D-mY4=Q6m&CCX;H9>$46IbYM4sO
zRNk#d*%9!{dBFGtG!ePJ`o;!KGSA>bAm9mF?p1PDGJUxonLa8rYGLVl1-`nM8jnM$
zJl`W8?Uwejq;}HGWL(V-Fk<rqO?}{Za9}>JoK(MZdJ#XMEd6(!P3k9w16KVqQg8np
zNSRphf!M9o3#g5eoRaG55-K!+4>RQ_Sd3m~llU3D)P|?hg-$kFFu#}VW`63%boD0j
zu1RUy*caK0aU(i$izwhfE&SfjU&?hdW*g)24a@1HVEfGWO%>Yt!%7JRH4T_DY)3h;
zVd?aP49X8>Cn^KpbXr*j!PbTEfKVc?r1F~zA68Ya@ar(6?P`2g6mgbbcZygwD<E6z
zYdx0ylsG(?5*{Uj=d}-2v9$J|8zaCqX9cN*UZZ)DONGUGc5!h;J0Eye+}H0)t|UZA
zeKKq35m1rGkfl*HUq$x>a6<385skkrBA&Pp=sF*?(5?xV2W$)kqR^vs>Q7Fmx!W>p
zlPue)i7X7fnndYJ3j|#!QtdTz<&}LrkbDrh^J9KsTPS!XIPg2Jyv;<b=Z(ujbk}>2
ztOf-83CL9;{PMiU$DPVWeTfXUHkf>U5#YA!d4QvN2&`ET$V)u=3$X0;gpU~j8ngB&
zD_0dQPxYqxVhT(OG=@Mz8;~IOkc>`HErYq61-hyP{;!)$g}xM|3&}EJza%iA?NNjn
z4HxZJx4<aiLB}62#=h07jv!>1upfC;mOn%zy-yW+dhfd@LyO}JQ~X%H?}N?*4s)P$
zq8_Jri%f!`P#OGqcQp{U<rpJOL$gVH`XUX}97UMoKKxbRW-sQkP@ew2VgQ9tA{4Xx
zg7-67%I`v3-$wY|nN)dLhr;urVTm<gM8A`}9Ew_b#*^^|hJ`10GCpM897MNNK<mxP
zUacAzu|!kV$WOp7)tVg1gU16b83rfc3NGWPN^TktP6^Hw8ITbOOIQKlIxQ&MjjKqz
z3+w*%RK^fquL}1PR3eK~WNM<c`<ED|P}Nv0!c0qZE?l;Zrg$8rZk6{<8@^Z(j&Lt^
z<Ej=s=QMXm8BPSi{^OS7*C%rxxcrNlfti~~M6Po~NO=46zvVvx?XY%Ojqe-laWgUB
zK-$-cu!EWkkqCXN?@vmSy#zTz&3_K+&ax^Jw>vSA+_j(O4pILxz%j}GXCXltC4vTL
zAhWhu`q;H(`X;vWTdzCK#(cosX*(-K7;?ALPoSThkaAB<ir|=qZn(nAKYiivjZUV0
ziQR8nqqTX<IY6V&*mS#{ps+YXx!XNfL$uUF3mJJm-0Rn?)tGq{;)!ZMW2qxli7a49
zo0&?N@B`Jc{2)WFGq9sbn8dEKH`WfSc`Pe|9%2nkpEb?!*xR}7<4%o2p+)$6Y8>_D
zou^Iv;L~;LX&2%zHwm0^8*aCh-s9>_bzj_PxA%)+Y~xi^u>;CoU(3K+W+L}4{Xwxu
zM8mQ6AmBu60V0ec-K7d~(V5>>0glztj7sq7VMn-q@Qo0$W;JPS0sMg|kw^W(pjVTR
z7{k;QmICXZ=6lH!k7Tds3qH{Liy$lICY=Ffr@ub0u6kbDsXOTuOwjk=U*8ZC5A_lx
zrB*36t<er)Z~s|se&0%CXf@i>Gd9%`y36v#eZ1H07eW(gb>#IyVUAC#XHp)=5@aRT
zD_6q^Qc-)h?}8xEy6S%W&-Xo21UGEMN`i*6`<<oH`6EgBZzqIk$vIE(`&)QBflVmI
zSMU5qw0h_CqFu)wz-(wLdCAnKu&Bka8H#1J$Zz8>r2fo*MBrjoy`i}bID%lJI{n4q
z^Am|!Jt(2w)3)8FP)|E^BtZGw=T~)C);1M#4!K)ta``<FGr&Zr@yRw+L1<gOS|}J#
z+(?K0T){R$oRF!hB!6LR(v>~*3abjDOkq%T%8dIQCfERoK~_Pi{Ov{W3+jsS4{ay!
zdcHO{%wdNSVq6X`C>0aoChNz4=>Lt=AZ}g-&PaGk$TVMplnLuef~+F1Qd*b@-0H76
z@PY|Utet;v<t0iuljdIgMytFh{Co4{iO<YZS#OgD$&Xe{ia=l;!*)kdOGPewKI~V-
z!Nb$)w2Az&eHVYVh%VXkm;fc(AjsTls!(sZqC_G#STuA-g26PHs7>fr-SV~1z#k<l
zT0+cr&0@5%@<GdoTj0OXcsE~ggi(+jb&s8dW2pbN4<$^Gx=^{#@~x1$Wdel=xJ1Fw
zVDuL($LurJw30WQ=Qk;71oH+z{rBv@5H~5DI`5^pkk^uORl1x)yr84)%J<}T=Gro=
zv!zGEr{dgIO-Bh*pCIt<W+dV^=dn1A606#>FmxW6@WZ~GV$#5&({A7Ts+SlaEI_^m
zg8uP($={5L?VV=0Pyl8nZ<S`0-c)krbwn)n*wJ=LF0SbAh7L83Jn5NfV{KtfsJUj>
zoy5NiAS{T1eW1Rg%szXt0gO6PyIeY}^EfMQcdH?TU44D?XP>@2w;r5*<HFBaMR>uX
zN9C=>67S*s$r@3y9XZ{+I8}&c47_&uM=PJ%)dP*CDV!(OD8)R-W}69x#BDXOKk%TK
zht=Q4sm2=1Z@lSm$Psy%zOOkfk<+&y)e?ve$b9h4)fVZ}Wru<a<3cApI(U_s;KVs8
z9PiG%<4D-W`pjkl)6<5bk<Q(z0nfVw;ok9jC2?ON*{@a)ikBu+oHky-$HVCHZli4^
zKp$sG76Y?7Yops%2R07qp0Kv_&v4>CxOhhk`=7<NR;hFa_;HM#k(5O01#nnl-SIl&
z@aBYo9?pspXt=s6n*c~{Qt#1C7r79?*AI5jY{yU?QhKBI{=1LBF~Cy)5A;VKkl~N6
zTRM3S#Cuau5qltvYdiw362%v$c;rZs%Asx`<a!|hrm31t0Po?z%x)q2RY$lGnB?K6
zSQOaw$1d!$^UIV~;M}%*nUnO*geSVDk}(xNQ?SS@Yohm{Hh1E8Y4K`d(X@#Q_INI^
z(*hZy3fP^scc6E#%D)B9dtCHp725F8OAs1EfZt9Va<Y8nUE1lqTV%oCZp4I$;VPZe
zlcZr9sVs2>e-V564;I?LjE?xQrk-;21Hm`1eRH5>9rY!}wzeC99AE6f8~y3-pUkHT
zpsjKjgDKO#H9&Qt#GkF;M7@0IrFIIZx_>3<5rKJcgH^uj*JAM`g0@NQ2~Jk8aivgu
z5y36EU2g2}Ue@Gh-mo_Yn#@@Llqi?U2yft4_x(LngZ-cq;xg{BGGTj(uqz23vki?M
z7{K}eB8ovf^%qCRwhuBs3LxR3Gd?S0e8oD@ubAxS?bfE^1hO7+Op4`oCYU;Iqywnu
z7DEPK&w_nE#`t1g`F)mWrupEN5+eGg$n_X4jS<J-sE@8i39{P8kaTo}{q%*(%8)T|
zGjy>NiOxncH)fak6^>D41U!z&n8(ZS<O&-N02x2mv$sDK-ClF`=WcP^72kaaSRq#V
z8jsKN!vs3%d;+A$F_yl2oFj@CX!$czFz!U4$thcI&$HAeOI_;EX+J_c9538BJ3h(f
z!VF!xr{Rl8qPaOTk#y9QOx}6fqF@>Yk;t;8knZ=^8Fjnpdm#0g){0>01|>(EBVhat
z$ZthgP?FgQ-T%ogfKYsLa%F8-ipGBZH`i#tSI)@hCtB4k&7~ZR;rDM|eNA1HwJ?i1
zh7M=Soej`TIG4TK=gA~h8hbN`v9G*|wjS_Eb1Ev|4zw1Eso#5Vod5Y67nF8s1lOje
zH*Fn=i*8}DCUIGb!?Bdbfa@$YREg+}q`3d;)AAUA6+BWJ#s1)gc?9?$q#}eV>Y{5&
z&c{%=<0p_OUNZte>D1NgZd1IlK&eF;Pw~cItD8UsK8(>Caz{$>1)HZG&Q~_VvS&C&
zvio9CvBu(3V#}1T9h+<68Diy!ZPS~}7pIs%-A-_@hqfng9ohyP!9c=YI@b41ptBv>
zJS{R;MUZx-jT41#`TO1ccZyIZ2ufr>MzxS8pFMB0mTQfvI*rMIeAA^9A}saKB>Zm<
zki?!J(aPpNaBc&{rtrQjqPd+0tYS8_e|Z864c*Y&BD`fo|8xmtITnd-6}0=xIzzhM
zPklbj3vwdIj6!fH#;0GsPx8$5(*Xl!pH;3AJtk%il>?}C$fKv9s+Dws>3ZiqZ`j>O
zWLS<jl57<%q(94YAo}n;$PX*TyD%($u*`nUV;ZGFel;No)FSZw2NYQB>+9Q6OT7Zd
zKJtUmpVMOZ^(RRv3miQg?poE9Yv;HBZ3eQz9pXC`_`cx)`#E=@F*XZBe)(`LX6*u)
z5%yB8weM|p@5bQI-@s=m$}kZyxMhU40Q{cXe-5W)-v=lTY3sTAz6#zPI(Fu4c-7Sc
zH(K2vN3?B#d*$M{a=HDZRj~W!EQcun8zWYQPzPu%G08Y$1=L|wuo&<sA3+!ldl@Fb
zgae#3@A!h*#381cHyRJ<wIC*B>pP`)m5r3EVT(R<6NM}(Iw99gmt;WcrFdPoz^!ue
z)3Kd6Jc}GhH5-;&J!OgMmx8@pMk=`@i0uOs3V+|8u@^9wB_<xHIo$=d9HK7S%9pI!
z>8ba0Z|KhFUMpZ(mZQrlq$8lTN6u;_%MqAWQGN=X;h+dQ!JEvFT%*7d*NPIg`G60{
z>Hg+E_IVL>pu-LDRu;cM7AP4jtITU<z8%}nvu|#Ey1Ol9II0|bBmXn>Fab$AJr<`r
zr9b_)Bhd%^_PE!-V`Jb3T*vyy5}me=Trv_WugKmASkYv@MTF2|nd#)iFQ0xM8qTdl
zM_(#?2AO+7EU|E-1M4fmSPU4XU`!0233*L-hCF+!3`5YN>?64SZciF)aeXJNQ_%a)
z!sTPZ)tw+cV{4)o74h^jpPhU#jOJpUXCEnscoa?rN6S*U`QTlx=S7hxe2*J_G+xqo
z2onXfoDzhOp<eE>d^ZJ#J;II^ald_oBa(VQHk>wn@W6N3N8W^>Xf-b+WQ=f0+LeT|
zm+OR-RMycS^sXnLjNTswTiL*b(h9ypw4p2*k0Rhh=pdlsB2P?3z_Kahs6@RXLofm1
zkS+iUXGkkpEu`}hQ%O7+18LG`SEcvk0&Ms)*&Y}`3Kwd)_Nf=*@f5#iHvS#!pweRc
zUyR&e`8FY3&M+dU?1~KC_MaDq+eD#a&b>n(my=E{k@L<`AkxMXzNz{j4dznS{)Vhy
zCx)m)6S(Y7rsgxgwc8y`6T^bhx$Wh_%w=R^K)ySR`zlS2!@&>be-*s0zkH8ZVyvf-
z7K`>igOM1<0*LWbY`4OC_9df7O&Mc*MfwtZ^s0T*@HujTf3$qAYdleNW^(Kh#IQ~?
zw*UC5>n{ZM^{pHrg_HR6Tf=AE-z3%CMJQlaoLV@>o^A_t?vI%Qql%wY@KI@EpBb<c
zh1oj}X{4sx9fV)y!9I}<o=NUi_n~Q#$~*21Yq1ZqV$g(B+tx)+;Md&=&+cB1!s>Ne
ziNS3q?tefyW{0f9VhAxVDq`{^J9wwRIW%x}&(pLRsJ`SajwAaaSH9emU~M09yOk!N
zC1#`OWHo?b+|8`qZ#`5HNpZq~iK|ninnp((gb0$L*h=ynd|xwX2sze+vVL)%^CKki
zF_S6x;9sn8AC@p|H-$>en~J&>#wSD*x<cn5Nq%~}h=z0~mVTm}Qm}^aBMJq-LR|jE
ztI3S9RZUS7zi4T@6cBo3eRx%f8HA6jm@?5s{^*u9=F+dGMn-DYMddaH0Yn*4pxCcH
z1JC0m^ce>*(ZK7$J%Sp_a1GL6)=Cs|??W+O$nS|ozAAk8;KnElOYRkZ<r(h?I&>1?
zlew}SkTtGH*i~HNpLD31R-F28JVA=SM=SVdr<J(w08Yg+^CE$DnH{QdX(6wM<$fFL
zjlm)A`rom3*b}ZZ{r9I}yYNYH+YEdM!#mm_8nGNh@t(Bu3lt%9(m;oR1<iIW7_J=i
z45I|!1(p4CtC*>tAbTB4j&lJ|hc6y280D<(R9yO7I8G|OC2d5}ct<pOMfckK&s+rB
zh~;|6=%Hb4kp`C0Fmc{ifyoRT@a*GTzTf8`^G+T<y&(Bs_p<R4mBJlg5DX#qWm$Wc
zUewGHaoi4suQiPJqquv}%*%Bk0Da?J?*KY2QS77~#a8&hhh1L&$>^Z4Yi!(ku_FtE
z%*D~CF%8oFQ8-$=HDU2N^jBnfcBS|r;hS%1V;eAxe&YM&OgX!G4<Koat)gfI<pt^j
zpDgta6d5?Pp2DSAUw^7xNyq_)9t4-n)gw*k%Exg=cm!I5YYSX`k1DoHy7ipG(Y6}6
zKxs-=?g-FQ>xR!yT4g^8QCd8Luu^35@O!D&c5K$J9U?a6Z7cXi{-(HFsrYTiBR*$j
zna2vu7QxiY^bH{t2AV{$T3Id$TucR4?V(PC#pA;nSgcrTc3##5VF=jqKA()?r!uu=
zraKR{v_xm9eVxpqlVVJpf6P@F-}&%Nyb$vY;eVu!wLP&-H+BuP^Z-t^+6lu_FxPBW
z^^lRYSHKmeD(N%XTBry^O`#vHKKL(g3)}&piKKlK0}T$o_%HUeo|H&sMuFxt7!eo@
z1HFJWtss_}<%HyO%iY<ec-g>lh8~<_P*I94{7aG2*W~?%1RAhO!X9G#J`tvoOqksU
z;7+TZb#UU2G=nze<IKVzamsMHCtco;$YOa(Fx3D&yq-y0mPT6WU5)R&ufIl+NlP6h
zmDb^#CqDxuCukNXFr0T&`;;hw0F(7wNr!sF$?Y7Hk7s?7L-M!Q1+f%3GwGzU`4<RH
zGt9@!L*dSw7H6SsYtB%WsIq%P8O#U}`q#Z_pr=X?E?PR*VY)$VxK@mqq^B);7(wRq
zv=&Njh;`X&S=Fa(Y)Gpqq9j{m;6ep-9c6~{N*~GkgXV;U1Ctp{594vk4L-ij>PlnI
zzZY<(ye$wnB;QDG%sBYf(N6H0omzDbLNqWSeyH8_NYu_Ljp{Efu%FPVZII8j8gQYB
zQbu`yx)pd|B>~U=85WwPq&~z!e;{Vf^e_LI9j7<0BsM?y^cCg&?`7+lu@)SE0T;~N
z?8OHbt4HgvGlXv4$dxp%n0n-BN`*ZOhAjswdQ&T>S<a0Qk`47a;93Qtc3Nk>v2)B1
zp3FTRNOy*CAq<N!Z($|a%!IeZ^6s`|G5p|@IZUtkZV&5h8vO`_0uGBr-&Z2IJT0bK
zWrTL!$QfJ|L@bWFqlCNJEW=b*xO!inIcO-y6whUX(7f&-@zq_Wd@w;+`diG)0~uoi
z9kt``d)RsDa|XSW!+;lI<E^+E>Mh59Z9JlJSg5#@&8~AijYj;%+&84RMh9#Rku-8#
zA1lM!Ss%n6IrYA+-cbMgdN~(w91|Qc;xTs7OkIS{O#VI)z^_$6I@nZx8Je5>Ajv{C
z*`mxG8I*=B;NIKz_*&tcd3(AdA%f%sBgC~m^>XA7j`c?VV{>YKRfg{T9MF{YkLpP8
z!EsUz4?^1EMQ!rl4w}W-rM6>EEiTfu`5uY0)WXBW_U1lZMI&E293s>B<*2243Rmlq
z*>W*kg_>&9mTt?%IG?Q&;cOD)S*1hsmcAD8nP>h_$hw7Zi)%<uqX~kMfw%w?CRus*
z-x00elrO{Wa2~ie755dp`zZf1@mCQ?A_8!CMPJg@BcI#>_o94?=X7800+!_Uv+HJ#
zXdyz;ec7@x^aLT-ftB)wg~DG3kE7X|{y_i2MmrN!AO`+s)oIQwvw({kCNKJahIR@p
z08gaz(?&hGuX<8Vnn2RVaG4nC0wU_R9DMbl{S*f1gqp&#LIyd$ks}`g{^I^&KM0)V
z|GB059C>sO%wbiujEU>X0GYUI6BfqxzE(CT3v%#I{vq##e|tHfn1$Ol*^%@51?6bi
z@2emNF{_j}=2DiM<k*KL+zaQLHqWa7hw+E##;%DjAO!u1^_>^bd~c}r$Nhxk@)PF(
zc)u`j0ekXaNh&dNxq;0ahnj^3phrqR;S})06TUy8CIOXegy4QE;y7~UP2s-uBCdQ_
zCHl%TnzBB)isHo?xCg%gIyS45Y#UlIC+#|39$D#6M_ai<Ya9*>++SgT`+lx=%kH4V
zoX>On7l<N2IvxA>_`?e6$B%Noet+9rdK_GHkV<R+4ljGdy96xk*QfSpc9FiUC33tl
zyDbS-A7N+-vUpr%cavy4+?P@@?5AE`%|V<Z24Qj{aKt*e=uuGd)N$MrLcweR=WoT%
zlRnYUXzhWiyVuJaOhmQgvR2#Q>WgohMJ$J7r3`PT9Q2m_-)bUS*COX<v6+?{Ricv9
z@hgY0msw-Fg91H}tg>fHFFRb}hokgOLFm}I)|_P}8*-@ugcl(QqkUXz4}WBIj#)Vc
zlFvy8NQ()6Ay9rj^%84i8z)*|-JJi^C7bXP=)3G5Dq}X-9UtL#W%2#Qhi)DB2*oA_
zA<1crzI~ycQJ)+`;zs&alo)WtM$*RcjyNo2u9aX5Hd?6+p&$nvNQkWmCP{yElC`sZ
zIsXECZf&)S*mj6vkJgtv1spsIWozz~{2Az;aD(WO5qr!jT|Ku|(f=;JA*xuntyK8l
z#VNqrV=VRz&?k)*!8iTMRxZQV6F25e=QN1EK{i!J>X*qSS>BXZ=jvgOBtPyX;gD@R
z%_pZ8$mOLEmU*K#8dsavS;U)O6Y(iXp=N0Ibbeniieye_u2#Lo64QlsTqE4b;aDg_
z{gU=Kb%@mHb+xG=C?4t#$REq!{BS~Ufb1Q*9pgrd!()av%u0_bKuX;sdXba}h(tob
zlh(mnWvbup;a3IrF)MeFCI+(qXnH0{p?gYm>M*i&mUFW2oo!KpVNgxoH*r5Y3rE7o
zD~Vv72ALT-tnXyU8{^;_qK&Xtbj%ZyAPzsDcnm43?dY1W5|{!-M?Q$$es4)J^#~SE
z@?voTN_%&KJh2|oA7y4tFikT3QZh{1lF_Nd-3W!jT4l*6@rD7j5y37QMw=N#(wT=A
zR{G%Q;3@`w4w_!1{{`2!m#72c*rbwzb}gz7`BjU|ol&xr9MC`}lEVld6jwSsDIcu$
zgG0y?o=&6_8AuL^M5J2uTaIWr>OKR&W+O$ZnQ#k?!jB%dqj~m;#WJHpL9XnWH2)j!
z7k1sn)Zs;qp^KhI+EN|nuI0&^RXF_sE*0uNNra%UlumLwYqwL2Vlk!De@WdC)(|^c
z;02Qa&5>X6&@5YdAd}q`vV726Ash?j2Wd@ur20G^7=ja31GrUagT19Tbu_q?@6zq0
zAveVHk!TE#%;*9)vTl9!5ER!<9SQ}G?Vr?6ROT@nwX08vUDO=?@vZ*&Gi`~ch$38B
z{2bFRESk4utz6g?HB4P^6qP>QvW9)0?<c2-_vIfhNxvTW{X)@VyxPaNIRJ24IWvpM
zJr)Oi+hQOiQ0-Pw;n-EArpWeJ)fZ^-1Fn71V9&xG(y2`|-<J+y?k=Xy%&)Q+^Q#@m
zF!YA^S&v&%ia3>jXb8ApscquiY}{2^ZXpr@OET-Jf&nZ3remBWZBI*qFc+*g0CGYB
z6&TYC)*W@&ZQ?pd6MzY`sYrAjw}3<g(XoSDkO^}Rofv6p!!pajChkksl^gE@jZb5Q
z{Is*#P{`xY)b6w~?Tsr)=voHV?80Il`B$6AnYj=er7sXd2dn%SJg=pc<aN1T_z{x_
z3Z!}=)8LYGr^9c)eR^q{IRn0#B$2Wz+nLm-$a7*S7ASYn6%71Y^HWAf5Fo_iB0K;V
z?ZjI$WJiXHiNS_|syFS)LPb3_;_K$G_sku3ORHUAB#9ujAAD)cODlf#7ibL?=w|J|
zY{zBuauU`9N~Op<1wJcMirO8dQqw3AUz5YonZo_Q(14~b)ux*&8>ux6B{jrfT1n#`
z#6cGU?$xvem(XpslnY||cvPfKj!`WFRK-3G%TSgGnP7UNt!@OUPhSU9(t9JLAh{Jj
z?~XG3Dsm@3{bdw?ybfYql7`We&~N#ASl-th`KU6jO6`mGY(?_s@7=_7=C$-^NEG=h
zd(l2Q|NkmQ5&z3_l>VnzPO*HH`X$aR3|9olH||lq9)SB`-w5eRZs$_E?4O2ywKA+U
z9Aa(O|EBmD4msh(20`Eok`}y+Fkedt3GKEX_7l`760zKE{Ah-Ns}378RX0NWnWFmj
zDBH($>E6>kcl!CelndqfZ@W-F;WH-5kmFFs22s`A*~)ltuJe}m9lM;FWv~6Ox!ge=
zKF~`Y=D-zJ1t(Gv1ofo1>C#xM9T(%&@ZZf&&(6DL<Z#Fq1yEvd<^|1=5o4+_N2&EU
z42G^k<&>l~ZBSp$1%9oG3NS=8W5AW2$m&}R#_V45jOb#?Z__GS$SB7eRr%lgrp^)Q
zFB7(p6reu!Cyo%A6Q6v(J*m8^5lJXr<zgF31G!qmKA?7|xx~7wU^}cZncyoQ@<XgO
z3n`c+f|Zaw1$WKT7`zxbXdwZv@>k*~RW5&f-oK5t<|bvpVkJSl&+8Xm+jfF?iWo!a
zn7*<By9?DYDc_KZ0TgCQd~d-5z$7BL|AYjFNEV+2h(qyfqSp)6kfTPD1lFzo>`xEu
zVN+!GWg1u1cbsIIG?=%D9CH?lAD);`87QAjJ0!GsGic3~B77JL);|mIMt$1novWSX
zsw3ft=eTWqi@xePvkO6*iHhq9URu;-T4ctA5$qr)NCBceSCAJbAJEAaHlVtac<z`8
za@_h}SE2A3l&uQ|<%QWMTWe5}%R<a8<DOU2&q9)#9g;ZCO)X*FqqCLW#$DFo2ORI)
z367%G@rIpNj@=#1L~nEjF9#j68huRDhtGQW{Y2As1@B?}z7E`4jWN?mO9K);PZU^C
zL&^K>ZYO8&H@g>wavg02dIus#!Jr7~&5+I_Q+6x*IWgOSvc-tVUsDH~N*#Y^kggFR
znu%bRows!P1n$G|^YRR>JURq#9R4l3dRTLn0dcSE5k!I@nGv%gylej&lWI&X*I1MX
zY0z}%SZ-W_RuCZiPd@4>aueP)mt#!MO0lRhoEebPq~VYM`vn|SXQQ=Ly1j)3wutXw
z50xYe7-L+oB1&6UaLO-vEw_S@?*Z5zW7$J)mGj{kejye%xV^Ncd6%ll{X3`GfzcJ&
zqS7!?EF*P&%1gA^GX>KCvO(%w`@Bu=!uuk~<yPN@Z7@1tsD%t!Fr}MA9*S$mi_|~Y
zK6zzGVhnaJI%4KYo~t%7uLtLm?(eerko*w{WkZ9`=jBkw2=gL6i+LQXrhy?ez5<PO
zFaz3VGNP<H(akZK^}?jBC2h!MnmHucOC5ovjqHJY4J{ZVu0;Y_Rp+jT3<EEUc+2LC
z^g(=)kQ9``1#@+OrdqcJ?!@Mx9F*b3PMa|ba^(RB^i646lLwR$c%tXJ`r4ZVnfE75
z9jPtp`1_dGtu6t^xv>u!LRC7A2$bnXP)SSVU^hr_&&+3LpgoYlootTP*sm(`e4?pd
zb$>TwAU>+@Zo}t~Y5)G%6F#yGbqIdzl@t=ILxx^U{xGzPSfr&D+orJ$A<O(Xka&W9
zA~M#Xpzgz*O)ek#2ElMU3E0UO+=m?&#6(654_1nQzhFSKkcQ%g74+<_&G&(%iI}<#
zq0@K0hF#63*M1)iK<}dW#Yd0d;1K!7Fgq$89OJC^!b56rJ!=oN$L}+I2L?EZ_A}?S
z8{ft=S7-gTYJ;U=_64VU_zTScPF*MzSDY2!ISczJpUXNTy*#>|L&B$4w@1@B3Jdf7
z_NkeBgl?Zol{POu%~Y~yln#2ifR)F{aKAo^-Op4xhxfFPtGASJq|bHO(N;Z?+vJ<5
zIO4!RZ@_FBFXZ-NF3=RyT3dc9<!*>y)L%?S+n*n*8EZ9FgePl@F?URSnDb|Bkgo1e
zVy%s~bYxU7JZ@q*Kt_8v#n=X4o}!kB&W5KO($#vf>-3Z@5d`l8UzvyBjSo)+zFIA~
z-*T3zv;iZFNSbGPK#jZ3nJ6J)eD~^AL0)=!K#cqDK>}}@fVq<?gfi>wB#_`0-wO9V
zp=r*_o+aO0OKDC0hyoGr0db{h{mX}9C{DJM2<PoMh#z$<NB5lP;{CrJ0scQ=x%Kb)
zVsOvI{&O9eWrm0rrfHT}!nf)NP>s#O+-+^_2j~tyaFU_}7qMiT<1Ch~>2-|!v`||D
z50qQY)s5$Ta7(b#Hs@!TmlzOnif6hL-%&*ZAN2*(6;4ZF6k5;Ey>%uIZFvMTVXEZ@
z1(dmS8a)uoZ%)X#?L{R>H<O%JAp?P`p2!$Vpp2oFd5?g>J)h3dJ}8H?4t>6)TItir
z)1<1qxjy?XHelVu*W*dNPME$;u{|eZ@47SPU^gKF$hs|8RC@ScSxnRO`2r%mRjsbi
z%WW3Z!<T_x(!^3*1g%T=6Ljo|4Neo=Zjl)wh_(-6hdbS;d%s`92ArgPAw_O`?VT``
zN!G%>M(}e<dbw@0&rvFZond~f;sH%;&jjJtCV?0FRO*GGi0`0a>U*G3T8(dXM2O87
z4Q-IRHdLxw?-K$WJZWaUQbaKcf+~gS^NAZNX4ts5O6vQP{OaR(M7tY&4|_%uRQ~l@
zS!=mz0@xdHOI;E)8=PnlgG4MkIAY6ZXFx0KwMbd`a((+t>Sw&~Thd3v0c3?deV=R6
z$c#P@w#N;|7MJOAr99I}b#h@OD=ox6)s?-+c0B<N|D#WtW@n6VjEweAr9weL&n_Xt
zo3W)oY0$mMAqI`iSE}`gOP}r{d$CsDg<G{0LiJQ};Q$ST_T__rtD<FEW;uQYFSv=M
z3fr5R2ifoTM(N|-L4yP$8K5HGMpZ5D*IV;FQ(+5_%3^yex}4}7S{ZQ!ddL2`9c4`7
z_w&^(s}KOHA>cIZqaA#<GN^sfIR~H^wyzG>Gt1u?cZrhw8h!<`9jtTJ8kw)Wbe$#T
zFV`~<vpF``WFlR-(evphAu$=94y@XzNEA3rH8IUQ?2lwIOS3sP<trr<ozKYyqO58d
zK<ct=I0VOUQX~ELWfW{fuMVidxolM7m+~+fdTw9I9zPD6y0#z))F0M>=)aaPjX>P;
zYVpN%I4Xb4>u^6&WVqVj2btrQ5c1EGyp4P(QwwDIug8=W9;{;uGW>ys_4!#-<RVrh
z8|R&`>OdYL7N5G3rw~@a<-dNTP3ousaWEfkzgI?MJhsYz<Bj0sZNbve0~km;w|X+0
z*uqo_*lKW`lK7sG8Pb!1RqhIat}?Kjg|@@ghzr$!!G3vYvCGP2qu$|2JHP)DOoMjY
zDr1jdJ3YFUT%c0Ml3z8p?Tc1nR;6LrM6oK#Vn81M_`dYiQfC4ZlX`x{czK!Yl&%=I
zr$#OxXdh}}rz*K>T@~K8Ry#g4t|#aqi!5&*v8S)K53nqoBZF+B5Yb&!aF}J)5G5XF
zyQHi-dNu#$Rr4=(ctDkcb@M7-{<j`W(>C|7{+e=1-5wEYksn%BjXjU86mj)?s$RSV
zb@0F1ygHC~t!4Y1{8*1EoXAt-*YULN4y#o=j<b5OYyta~2F_4UshK##Fn1X_;0VL?
zMI~fZMR@t6yq8z06+WfSYXsRoMUxe7keQkm6JyxzK8ip+Q8R#5P|wOBODVeqvwbhD
zG&o=2nHBO!iW&9`IAqupM*Gix@!W{vKLv-2CQsUMBToMm`tui!#V$5-hxUG}fMa|C
zO~F7?Ea^o~fP*%8r2@6Hlq<+Mw2PcKYaRg?A0wBeX{LI3-}op-p`eIPOZb(r$36`M
z0o$#TCI2X!ri)iRERq`S0)OaJEDT1I<JIbnjJ{fN7ssPSa;tRbc|948(x?76itY;#
z!WX53i=syE1YClzMrOB@1mrx4{>*tB6wM_kw{IWzU-CQdMdPsM!CG46B)4z&Sx{-P
zv=zRPCs87z!8=&&pPITJ{&gRMAb#9RW*^2+0@7X(`*i*S%yC_J;yO^26#0?&?`9+W
z`6$jk6Zd<t;0{e`dpZ-PDZwC2w!U`)RF;grZl3I-0{RL2qIe<VvOy9H*3t|ox!vH^
z6XS#Egd-kqes@YGx=Ei=^hJMPx?u<Z{Rmkj{G11^&RI2JT>?WM5l<~-salY{U!`g!
zk$ak8mL}Zpj4S$^6`j#!y2=+UkAH6AOXDp6-=hY;qXiryJRC^DX{8ee6u>D`3f$4A
zR1nF?AaZEKS3ZL<G6%}>PhsqB#eK7R*#6G835uU-c-iN1Tm(@n%Ae#&wDqkJbzk76
zfLKcvul_yK)&3>4C|?097MM0gyRi3s@Ugg~RnrSDAUdevJD<NvaE<x-8#%1{n^^y-
z`j827to$<`R`FxaJ<@Q&{0S?Z*fD>=b9>t%l3dRM0zCzKLr*CmdCR8FkQ5bv>Cp$_
zJ>&lQYoE<KBS9cXmiE}1p_#(odUi|)pwF92(`XCU&|Jan0)1f859V(nO#8)Tl2NGb
zb;J(U)N5EnlofK+3<lE?%wKxDwa-jJm_%>#Q(sBRn6b{$vnD7j!e`FI+fVd`zO~7h
zI2iBFBqPVNzE$;iyeKy8)I70HrO-R|ReAX?k66tbq6C(}O&ujdtEfn0k-7!mij8b;
z%zdjkugLreeS&4xT#+Kn0zwpr*=J$(3*Xc{A&UZ16po?@9yT3<!VTUwmthjHiiwgH
z4$#wehNvDh3if|+eF*7c;@y`lQigU-dtM~UjDis-)f8P8#h%{Ewd^JO#=TGpjo6;J
z-{*vl|BbKDQW8ZF=8kw3&kcsxf@-a1TE63|CRI7|!gD?CTT7umhuZp$F^h0gv82pn
zCrA~w6OwfdO>MCU`TJJF>xzuv0}M0rDWb9?1De1B!K_p`57S@1v>uaMr={!1bx-&V
zCws+_U&AorW*X9{d+atrG<uns?4fNM37`86+@N@dqu!|%9fOfXA!~F{9yRW8!?WuX
zSN?(@8#W#I<I1a%1m3;4teZK!-^<XS%??%sv>4@2Xy)zi^*6ly7|?sI`SuHpVtFYB
zQ=Io(U6{bxu*RBmi`C_mp&@!yczK!=s%7h9m?oyiw8jP&h1><_pTE2|!u*|OswSJ+
zeO)7>#TZH%M4hWDuMU-E(Gtp@Xn&CjTL8c9593Ah$*<jh@aNIOT|(40*ZJHH+@%BK
zaO*!3iVa0VXy^sv>jT-dXyhvV%MB(cS<Ee6p+w*S(<#^@iU0Ar)=*0#Il9po)RaAL
zjb8BMJ%~}Hwf(#65jRGk2TpZ`P5#94Bb`80>mC&g_O~YN%HR)A!2q%@DR51^*nIAJ
z4~ott2qgnkNY_C@IK#WxuXe1W(umg-o$?Qv)bt5MOb^S|MoB1c=XoMvgnZ9Y<o=Q{
zfk-`BRdaY@LYTyF<b2oQiMCIG|Epn9!i2OcNY@0hl)jDeZuyFHRD~UCP5>_U+2T)l
zlRN!Z8xx((_BtqTGS7<XSs@PL%0W(6)emE*RuTg2x%eyWzX=`!c0HM=O30Ltjb{;H
ze<M|1Y#>UpFy^(@`@q%w;cuPYvL$!_^iKPu==IgdXk@O!DvtVmJ>v~mZnjbN2#EsO
z>l450v-HdhG$?xIHYTnmVFPmjTf}r^A0-P`_X;+F-Ajht-S6%W8s8dkWLHg>-Gj0g
zg-1Qq2H8L#`<f=0HJ@J-L^qV<j>V3FiZ3cr4sJbJ$%k^`d?jF%jlbi+_*&bMWK!rr
ztt4zA@P<$|IxrTHF>KP<KNZpaMdK4C|7BbJ;ZOJM2w7xrx2dgHkr{?FGavf8_rJug
zKaIrA*yvuAKgz%4E^yB-s=?YJBe2wJ{TM1Iq2_?Uu)RIP*9aO6*-vV0WFV6cdR-A{
zg$c#^L2Nnqv!@mZ_Wypv1gLIXm?p~~Q6dZeMo^Tx2!otci^`*$l2_yosg1Ooevp4w
zkE}PFkBg*o0)|aKQ)E!7z9G`49-F9XgrWp4-p}ATu_Y>m40K9cTAJt-G?FAbT?2W;
z^=$$%4hF<f<;WH~$3LBX{hyA;Bo}Vm+JDI&KovqVtTwt^HTlAWI-uv#>dTRv`?(Kd
z5P2c=<r#j&c`8*;sXYY-(+{E)brd;C4e<Sx1m8grISiFv?iWoXJ@b(_eWtd}nPLY)
zwI6Gn)<IM~W%k6n><Fp;OJtQ&?^~z+X%;Z5epCRTop7_(!Zk{fa`5M~&D4Y3=$Fs+
zKgBRi@#8B*ip5wa<b&c_mADW70G`2lj9MyiLqs!`^xS_Pbbt3Oubi13x_1-I?DFY8
z*6*hx1DBO#-HjDcJ#CK9D+_01?J@&0j5FQ^Y@|@H7P-db3zB<2i}f4YObqAj{+scz
zJ0iGny;}22NF6X081@p6kNp}Bo&RX$mMPu~`L+TR@o!aZw|CKz_4gBH!vixhmy=Sg
z_Up*7tv);AWq~nNa9R{xHbtHhw)rH~L&NeF-M5z=f+AymLmw8{0y=!V6L+_k`|PM3
z9S?#yp5cn!Rl69ylE>bFBG@zA=m&hb8FKZPN^V-tx;rky>*9#QwNRGdrRm+pupu_l
z2lzThzo&UWSTU@wB}uF@ttv&_l<OZbKU#4p{@w*B+fVBS|2^I28;be;%`}|@wd7%w
zFtcFmFKKZDhps-fELgM=Oa27BFhFCsYBPV>W_-9gI=z&6zrde1C$^RRp-3Z4?6Xd(
zV+&yvSX_C+9b%Fm+SG%qTC5(36*S}aI2YHH4;P9!T-7nHEi3D&>FJpT`pLr_)t=lO
z!Pxw90uCWkO#gdBG38tR1&i>N-`QHG(xwPVi(ep3JWKjJDwnc}L5j2#$Wn~c)Cw<r
z*Z4dCIMx?rUbc_NYVDbB?yreR(v6%^tTo1V8iu(!+fxs&X1B&f3>wTU7Y*wb+rvCq
zkmE1Xd*P=@pIfy=H}9?-@Ie9)iU`Nmmv6r`eX;trifjd!@)ae?l9*JoJ&~>R>8X_D
zxV4Mp&rH)vpwmC<*SR7_9guV4R?9;=5rTx9^RnNL@-kWRV5U#TZ6mnn;H*j74Q;4;
zmnx`ic7rJcbBrZmiA;j$V;@#pt1?1FqDV=Q-wHFfMncatEp5aAbCP^g$p43=bBvCx
z>$Y%gR*a5q+eybxcWm3XZL?$BPRF)wqhssV``w>spItSoYK+=vVXkLZix<W8BurYI
zW>ExK3{apk(oKCesRFdbb5;;x6|>5{?Adbr#iXD#ns^%U0C^nXUFX$#q|T)grhX_x
zt+rLtyN`X<RZ2fC>uWP1AeifSoG;fxh0tadDuX(SL9GUies7PfhXrxE{MAZyapxqn
zw>hlujSuavzO$nA$UF(6@tqj;`3`Eg6IA*90yjgs1m+R+69NCtLqwu3ZUe!*6W(Mm
zTnUIb!ko%NO87beyz=l9WOTQYZ;@rY0ZKQqL^+(E(>V$HDxB)S;S{~bInE^@TvLh~
zYe+I|0TiS|!+|9vJ+_d2TCULLQ4}CYMdqSKoPv`yvx3XeifHL9H0$9zcrD&cx~bG@
zCkklsEO6`L<oaTQr%5*8pSq}B-35Q-T7jCQsBFfS&9n|Zv^thMYbf3|S$rIu+A0;f
zyz$Y7e2#P3=iD#hc*0KDT`X!2OoZ)D#vW}I4qJH;!3^;z5yP_}f-5*xcF=c<Ktv@&
zi|2f_0;@bSq1;K9C{>T!%z0=+&d|7;vIQ4K)o#QNEG!8|U>H4}4$EPF33tak`@F(Q
z9q>XjR8sL=Bgr`PPguH_KSLa+`z%W(>xq0LW~-3#&DjcP`j=DwWDJe^9K>uEHir)P
z_Oi~d2*(t&97y+QT|U|%L-Nl^V##)9Z^seN0jOpo25kQL9~_%nav)uHo-vFCb&sWz
z4@*-s|Cw|h5upSDGYCU?=W9P^4=Y3KG>W4U1=+gP03=pTe>c|7V=z6pFY-DsFUMoJ
zQ+cx<POUz^ZiK1HB{BF_d9y#%XvR>Z=H&R|+a*RmveDOf@-zjGf(-_cH^o+k=HO`q
zr=wXW&pjA7D;4^M>9IU<JgpYzToK)$7$bp&1^~E7n63T$h{9_BK1^7=C-4L4OHfl=
z8D{Q?Zkchynd5(G)Sv`EU3W|KC==YMGb}iiRJW;26>U=@7Fb<DgXvS1xNy$8X)a@0
zn+jJqqMO3zOZAb~uPo^e&NK{c+uFqUTIthQoopzb&1i|bGAssK1RDq1-m_cTxM91e
zMkjfFi~xXLHe9pj!rl#MS)*UBK?laz+8u)uN>w0)Hj_bmLGJ;72PN$iz(yM_qNQv5
z3vBRF{Qh;QgC4y8LjMbA(Hi*v*l=i!F7#)D<>hBt%2}AZD-#^HT|%wHYmE)}mO-FZ
zmH#a!C>|9OR`8k{Nj{}&ue)I4R9J)4m;=!L<}{_hlo==j*q2~~Ul0#UTT>6`a)$g{
z^9GL@s-aB*1#mzjCBEk~0v}L6rowheH6LaNu*`^ZJb57fa7T8V?A(w$JE$;m64(<Y
z_7#TYIrwB#fMG#i)At@yDc-1ut}Wp#j;nmS7c&?qchQvK^muj_VYd-h+I%t`l9jJm
z%<3;4zV}C*?grB@*Pen>%qRPm1Z{nJt7B?m^N{<#_3aWT^E6pbH;Sk;>#2{SMn;^@
zr^CwY3*(B5$e?anhX>ov)|%ggB0k|GCZsMcLgUe7s!2Ej?LCdOT6*^T?7;RV!#8&c
z9k57kN7Ic=E+t7Gw;Zpi?>BHFD*gU$<1BSb7PpLYxn-h$k+Dm!BuHtTNNIJ`g#AS8
zee>}RksL{8oM>jX96TS32&T(4l$bSNia1BVqXkQ?`&5N1Hi;oMnh{fN;7t2Oe>Yzb
zh22bMJHV&2K$GlG-%WpUr?wZIw>F;-f>OaC9#T~7q4L&d>Zi~c`VVDM`WbQqRXP(G
zxW-=!0UryrYlXs2-%&n)vT_a5X*NwviY3v--X16BiSgd(>xth+T&Xg;Goi`lZo>K*
z@aOW<q*>SYp<PBeu`>$ZGEO&dq2!KH&&#Y9eA=L{iu@d6QHIkS{9L;GiZFHQ1#CJ`
z>Hd!Cz<x`+#I~Hdb&2<IjKzyh7>^lkxuC>pbwV{;;%V=D=5{yyv!WAe9PXvb%*E$l
zh?#LgiBMpo151|}XnIcB3^}*ARjCUN1e|9b2DQDfrPVaH%gy0h?sf7A4aF#FzOZ8p
z`|iCP-=nJ;!WZ-0Z8%FT*?S`u4P%c|EEiXZ{*`;a&E(H~$w{)?MkDJwpS4Tc_r^08
z@eKBDmO+~5dDtj=u|ExANLsM6^8b_3f^@>Mbz=22L05?8?T*>y;@d)9X9-d{z!W;2
zV{vr;VXdOSq#Z41ExK(bpjA@2EtU|7H0~#KS{QSbq-B;fVFRbCgjHbWz4obS=}9rb
zj@0j<5DMZo0)>6=oOPMzfD*5m?#YwE)kw$qbnKV&C9&3=u80uSn{sDS1#Cs%)A2De
z=fMX9d&rM`-x4Rxa?ee;H~zXlL{R-C*?(35r2-s7*HW`R>~mDGZ{r@!4(ES<fkO(j
zHJkei-YzWvVjA6~$b4n?hywzJe)zD5*QSVUh=OE9Gh<>Gfmretiht8*>iOgN(-$h$
zG3aLszgH8E+T{s1D7*Feid{#kJI=C={HhDn*j|`|PdBx;+UV`JDO)x_joOv~U3O=g
zB7LjS8!QzrYjrq2%@XF|LB!nh#y=T$&Mfq|<X}N$E|d!Pwb8Q^Lfr-Xx^d17p{J14
z>@c^6V=FK67vjqrey}8%vcfZX`t&AJ79#p1+gP<AvCGSZW`fj{Ilx<hQNkXqe*boZ
zNezOhP<#e#)9oUV6rqc$P=jRIu%i#(*XtrZj3?bCroET^D`y+^rx?$GSK=`blLTe*
z;F!WcHIoX${ov91m&geAC|47@RKFoIIxzjbnPYc+V~y)+b0=TNAY;mO!vL9X=AHRp
zh(yW^1Kvj~>^=mXkaIQhg8~OEPqu~-#XFj}`b7$ceO+D;cE9VK9+X903r-)krJFuf
z!}Wo2amZK#GBaz1YIcj-UJ;Bz39{JPdHzAL6G`?vHrA*B{7cT+O3cm5?usbeuEx#j
z{N<J`WHEkei`psjXYrc00w3r5xV=q&Potu|EOr2K_;?i;AB*#of=@gD&NIOjdVl$;
z$KtspH5U<s?C00$twDjQu}gy>vag|5uV1#UX;>YQWmWCb%mJSfi!zEWuTQ3+o|a$A
ze$F{l=)~B~=NHScy9<}bN!wvf{?2NG_%U{dglhB6KxW@UQo?$B{n<+jJ&0oC^6^5_
z!m-qdtj3WoCP<lvc@niEdPQWdgG?K&H-5dBsOpr$fh$I9MF>SMdLE^j$^G4xfYU+M
z(j<@{N_!e@orzRhlcU?$SPy|jG+kAjpU>1CH9-|x+O`!e5c}#tfYrv5@N)7@acS|I
z-4LpJ$GG{2sZR$Qe>Y1*Eh)L#{Q9hFSh~VxV;D$6iH;=#CJ^gD-KTjpkcD#a3Vj~U
zR(F7%jL0zYXgc^5^(sGhFu|ERY)TJ{yYIqIv{HK~5H{1RnYolm#pwZ$$7a;Lp6FmR
zw{907r{^FSiJ)8LmQp{|p-+h&%URzS6u8$O(;rY3M&2hJ7=h@MS-Uldz_e9X*hGdc
zSy#^t)_+|<wGg~ACCL=5Zy1z_ze3t6pD-|r_~0=0Mb@M8TMtK9g6I7l@rhcXt5@71
z+Nx>l_OccJ976O43=jND1=aW?jqh$th|sMF+DTU1?Xtud+u5u2{2(+KYKZ!??%huj
zhB2!tWtTwLz$o9$I+~kqcqgXE4#_Cc%RK^-JKNa&)=bLUD5#jckH2etSRS6o-M~<R
zk=8!Y3n7BvY&BeMI}EQpZ_7W|b@0NP>j0VI;#6=u#!!h|SV%l(6$bN4p+u>>XF#B)
zGsGBV=3=4tV{H|)f=rrA*G5zZj~%k=dVGDLB9VxT)V$9juP<6MGvxD}pdwM9>)`Vf
zIIc(r?D~Z2O4T>#0F|uwn~cdd{qS6vSNgs2ZOthqL`WCGt$MpZY#+gnC$9vlH-8ZX
zGeEI`3d=J1PnVc2%wgcaMIT-Ph7Q3_-IwJ8O!`MX2d0`<HhcaW?ptuSX=b&=m`M+X
zJhs`NLq@;Z7~2<LNufy#u1^K}==GNEsB$u#CnHVJVt+$$*Xe>#&vYp%30?FvnHy)G
zZ9YN9-fiN2AVWI&^QBw-KxC-IiXoZl4#1jWrG8U;OD#4@{X!U}=v=*RlCZPi>N68!
zxXC@)2BD&Mqn+>cIR@ShzpkDqvi-3!SE9+tMg01eWYePLGe!!>+Ek(fD7xZnW1H#j
z>yB}tc<35_hw>mpW|*Sg*iCD-KF&~u4Q8jSW&7IcaEvSBSq(&R-oC<ruj^WVscYy{
z{fUi{d_;o@(%WVGT-U(=S$q3wrkpLn-uhrxHKJO604cn!`kR#%-cNj;RoUgz8M%oa
z1KnAGzLrB^(#f7DN}g+C)3#Km>F9Ad%mY(?1QO7_6BshSP5)kaIq3)-L7{Rleqk?R
z1s+n01XIwuWZt0Y34^8{=+MA&ZBqmbh8jqk(IIThnpz2u!)D5Ft|xy3{|RJx`)Y_v
zd3-k$j9BLFzMOZl{+_cLJ2}E1iM7LoZ(pbHYrmJ(bfeGNoYb=HabqBAku5*W@_EZ*
zS>2k;^Kf_Ao83jbmY01zDoCevG$M?|QV_6*k;@UEBwUKxt(5n@y`78SPd}|=FL>rR
zQ&PAj!Sxc6NMFt{1|-~Mc|$Y43s2?YU30!wa#H?fI&;aYkLXN1A+&h-(v~Rv8|A@Y
zbhGK*<_RA7$zQ}1v6bS&6&(hE_9H~Gyr6A@cQeMAR!?{kUmx9XNZc!AE%6w-aV%AO
z6Szo?uHGx8ZQ%N-B|}1Yt@6>xZP()>{SKKl?bT&d!&k}*dLtp2z|9_pP`LhLQQvYa
zVcf5WHM>v8XD40yi2IE|sAm9WK{d@ACk6sLtqHySlaAvmn#79PGAUuES!YTIt8bOA
zFG3+BJQL0%$xi;vvsmF9kgYdf0}>X166_--tnm3gvYbe_Mr?Wq+Tail8Tq-ci{1hS
zQqo9jP6}IeqT7^#IgQX2N<vEIL=O767=t56BE?0sOfXs>NjCeZgCdstMUmVN!@{dX
z-k;w^4qs?{3=&A2JC8Xk6x`(b7UkE$&s_3EY)beE&{x=sE=;VGJ`-ACTxG<T%j@RE
zf^JW?)^v4Tt6v@2%)d%f*j(WFF@}rrmah4NxrVu(>2EwW(U!m}qNIY}EBtQ(g2Kvo
zGkiT9@YFSRl5@5Y=Iopu`?n7+XVf~`XGW1NU=069n4McvjegZS>O&42=s5n5QU`q#
zT~Gmw$Kks<(ra+;wxtN7^5nb&cl*X1f0Nkg0TVDxS04mpMryT|I06sCu@FOWEHa^K
zaCOx{(u`gOd6|k`3T%Xlp|mPngk0Yy(tUMWE2V?v#A#eEUeJ7e)G%k+VD?>J$S@gu
zYXJ7Rk^|S*HAv+Ro0{^qHKETw^p6*R3KMNPZrf)!u%Dlb4&#EnKzRU_j0pCB(AQyX
zVDL(xQcK?F;TXV2DGwu}@_CQ55g7^bIKVEj@%`5Dbm7&xvb=(bb#$}32TJz(8PZi=
zt>b4;u?*vC!)ld)(NIFweaq>p9MnZ*K>0_rL1Z4im^0`Q1Q8H9X+#Fy8PEFjcFNp*
z<HQ)DB;Big431hQc_%tbgE;cS2c`5msu;N8b&Bb*5d1LCzO<21=C7?JT^>uf`zu~{
z_aB|t3b0U}s3>$F9HKX<)#KNehYOWj{g?o7keAzpy2{_Zb+nfDnK?5Ej;CRDJzJ>^
z#<I_br^|Sj?1BuRl9Q0Xh)OPW%c2(Okv71-qu0PBLDOrfdh7dc_5&(PpGlQgF-DKi
z;nfFbh;(^lCW)x)ux5`V0ofBD{f1n_A3_vW!WgT^ktF!vthqTE1fw7tpv}D;YUq1;
z|1vtK+*L4z;jEp0BF4V1RPX3193;vG@6*&xEnzwREU{(k8Gxa&2*+GK)+FNeMGCv|
z;Q8h*`__JO;U)P*cYMzOucGn4&Zt^sJj8#*jcq~n%6>??3Fv}o{<dFhkC*(mhj<#k
z2V4#aMfS`E%Gzjnrw(K1cy58^yIRvT`>*9IrPL3_Rb|OzHa)1<W%D+2oB$NPiAeB`
zU!pcX7YscX_9Ns`c8Z8ymq|FSX_Y*BRm?;ll$k*VVqt#ojnC}~>n~u!-OhK<S>!(~
zihM2JxbR;gQ{tG5ypRHvqU_ftZ5nRG3I7a}XpTULKPgq6i(4kSaJIE6{dSgS`dwZL
z3XulsTxfno`X#Ylnc`a!0K9f7Tumz<nS0Dc$14GaOrz`Yh^CqUp|#bXF{2=t3q@vS
z`+$5o!0@njTRkrnD6_nABRB>9w+CNh#s>*c%zn%<Yp))ZnbOUlXsEfd?<%#b1r@ym
zY7Ktiv|=S@B(tieJug7)4zHCVUUJA`1H?@xbz|^zHAFFdBOT+IW?tV7_?G%vY>Hf;
zQ*`B7eirX-FLz_u#1Kd;i1L)nAKO>r+sTleixTLSL{W<!LeQhIi2niPY$0HTsn!$6
zss7VaIsjqgtCHY@OiY3M?a&K}slG}S$jzK`q-TA^*Dgt93I<|t8zONh<9Ia15UacU
z!kj`ORkvk3L=H$eD&W)hWq7u;bX0@uppgl;hOg)F$es0sI<>tXvBE20J@z8XKvjUM
zgQdtH)y@B13XMV)4rCP8V|A)2oQixVvpnL;oO}H;??sD>PR0?RYbUE_G_AG0!Bw7>
zI%?#q@l(<MUhi)2LtarwB^|{9#j76_$d-X9+f7WHQz7HP>&Fw7NLbXh-uXySL#lsl
zfa8f_tz!9Ot>@EFX5_psN|51)hFur71@khfr*lIyiYuDO{NNO}GYnI;K~4+^9J6HI
zsC@9hq5|b=GfoS3N-|U&$1UK01G}*uV}Q+YtP|I$emnJ{ode(eZ{bSKfR{nCWm$ej
z6V$Tx@aLsg2C3MPuXM|G$<77YZ6Q0~j)CTrXyNaTsJ)HMPklr~{!OB<Sn`XFOgq9l
zI?c$@ZhKhDQ3gWUnc6p?sqEH&J?bWM7sa*znnLd)%n4AVAro+?K)m#iRfjt1{Hmqi
zVp<PaAGvTsq<0XgXHS1S)05y_5Gy0_P4hyqY;lOD`$wj}rQy(4;_XDN(Wr|%z;h;i
zoDQ9f>pNcilQyZADA;O@oQ7zFLt61$%_BngX%~mdRL7IjxGXf5Ie!RHL#K!F+jyR-
zUcku%)>|eNYdJo`Y9R%wat8owj5cWNt|Rwps+4M*6)>*x-?hF<>l_Z*0~SU^Xg@?f
zp03Kk5S^;RjZ!`U(H7Q_v#Y2C6~x2|V&)Xp8Wl!V4{g6YGRdyTBp!PcTv1l0w|DO+
z`z1G=BnlY!USF;JgTd-QvzxSs^%WBGI>=}-ykl~9SL><?<%y&z>wqMRKAbSM#ZkWw
z<<vWZZ1)Jv$qNgy7Z3>*ssP^rCURliu$2WEy$QOd<;h7LZe{U;_IuAvxN{SWe|cD6
zFQaHMPVUTzTj$y@Lyw`kPieg?#xKgF;R8q|<-jwEN&-j(FHlp)k@&Aiz4BfU9|Ob+
zV4LE~P*r$RG_t_q9s|nQxY!$dEfp|NeWfnJToHcZ%0lew%ZVAd`C%;v#<#oEAYLhb
zWKjeO$eF%EHapzP;y!e(_P*q8vyI5@s?_i&nKJ#xMpWf*@W0Mfi-$<V5mTI#H5Jup
zWif1n^%-wEnOk)sUFTpju$F>bpb_FzC|p~NyS;#}cLghjw>;Q~v{{_R?8ZrTwpU2V
znjHytxB0Tj$J2Ism%WOpw-q5o+oyb`L#*&QIqjIxV)I2Wnlyp(@YSph^|><hrt;&=
zkAuB!E!YBi;%FKj*Hm;o2P3-g%3P~Eoo^<TEpf|NDE$ikj2aq1V+P-(OZ;{LP5il0
zMm~Cj-O-YDk?XmlcL_!T-=dV;mlFOgHiE=Qy$Y#_X;WAwP`+n{iD0hm4a^js_BYt$
z*6F4^7p2K@Dls9Z$X~<_rj|PDG`PK3B<Re6ox2#38l*UvH74r^iU(#=TDH2I8|$h+
zYwc>vh1=LC!0{`||3GECX}_vQzrKxlbF#vJ?=^99nka^Gu|4C!KEB7;9z_DCGcGNg
zK{#5s^uTGOc?~{}QZv8dU>vpbiNKSOS;>P^be@BG74_pc;3@$neTs<!%x2^!PLMF|
z)paxpJdpsR<<uLqg?c-OhW-!|1A1ZDF?MiQbfUu+FY6mlgde8suwiCrf3XBot_ZSP
z=`0zzx_|MSDJd)R(lWhcNz_@TdA`B&(1J|U>)U2?<V(A^Q|6=i`r^F5;XaeE`C;eO
zuS&}0oC$+E*n&EWzFX)U=g9J(!7{-`J4MCg*-ckNEe8C%pBQa@4Nt~%gA6C=k*a)L
zR*+Km&(_M@l!RU|fYZ*>knt>v0XyCVJ1#NsEIgvlF?r0Q8|z=G?rqmt&nzY^I?T-t
z{8&VSoNxCSC7t7m!gPNNdNkR+h=yoIjIm#nNWSAc`J<!A+h-MYa9ZqjmVCKJp^U=&
zZ_ZoH3gr6U=JHrCw5Mml-yd9cv23vSJ)X}+`212gOAuJ!00*kb=IAv76rcar?>!g+
zsO5~oWe;A2y0Rw@ZVItcxbl`Jt%`VPmwxBB>+T*cSD}w1;<sNq;;lnY+9Kq=#3c3R
z?$DL9vQa>irwL2Eu5tQ(MgUV(25lnH^Yi!5d{FK*9ZS{&Z=3-!Y6$HR(-z=DN<~F0
zu8aObZqxIimHsq&mh_M~?#1lvktg#!;%qya3bm#)ABQqs%Ql`%kT}EGFUvN8<?;mc
zEGZWa%bQX5cIiDjyWwin0yG-&Lq3oBLz)n6OzEtd2-a~8>-Wf<<^4fvylb77E0QL*
zP-DFqb9c7m=RB?Y)#p?;apRd^w?ad(D<_33yl|h~MCA@#iD58sWEAqX`{W$~yekQs
zVF}Pb6@$neFt&mbH``+ejf>vc+Nu{~wd$r*IfjiDRL$s|iI_cyrWWC2e+L!U@a{sz
zQQvSMFcZ4BqH(C7WRh{M@+!8q1^jZ)f3vBZW|y+x7kcKBcP|);s!9(yIZHClEq__w
zm;z1ITFSqT`z*Yaw#J4rSe2Flz+L`Tx2cdO7fNvkfiE68;vR_|9Ndy>xW2VlX|tfb
zA}^Y@Ioiovi$4>LC{<7pO`8MU+UI`pwi-cOEVBoD#SGC@f~rpocokL-3!AeM=h+U?
zOHaAD>?+$VlJu^qKP;UDbW?eCTAa9Z-AiVBV6+NTlr5B6e0WE`!h7@HkN>rB9`93V
zgDWqs1k{epYMU03lXvPANpP3dn2QK*slp*)w6$k%Ns_0g4cFD4xbh#wOCgEr(h|B&
zBX*G?+15<YNsrJa->4**;%!=rNNx?bTh0z=%d0$)9UZEY?5@<k{515KWt)eO)1%-x
z6!W0)jY+4DwpNfP<_{BORT7E7J7OE>S)mr@XHVt06hkDpO<zDqJ&A?2{SaRNi57T%
zd}!PDt(GjU%E;3+RA<NRP=!x~XEhNZQhkYlB}Y|}WpsqCOFkNVdQXso3)(Y0AhjiV
z79Qc~ri;9kL9w_#CAF1zesIxYPFi0(0{jYJx?`LsX34bw`z!oLy}0x<iW|r>Cb1;h
zNs5Q9_AIymrxx{LbQ{I%axQ(43Q^w;xr!(br)-^5@q^dpIhM>>zISUiA?lXy-L+ZT
zV9qR2sHHW$Q)#k~I#Zyn%Gxn8o(I$|DA$7;EG~5{rgVEy;HU^P7q8+G8m_u-pA()k
z-%ZmT@A;y5Sg78usrp)9<fbV+FYv6wd7;V8>4Fy4(hGhNFO7Hl#D|X5$0<8TOdjlZ
z*kUyDM<N%IQA7^PuLSp?5F{V%r=TU|tY@<Pa*;wLG8L^$Yz9OaQAf1*^d!z-<&buK
zTF;OpZ!TA4={NLm3J$yhobP!h$(^es*$@aAXq2*I2wWcr3{TXQpk4#dpW_f1KX1$$
zM<~i}==JUV@iDJN^_q?HcEkis#7d=TaQzp52#?GRU1M?Pm;5@;$3Y`W!3{RuJE6I|
zB~)<wHRNjf@3sozjD*u6ZpIFGkLvDBH_x*6`t1_%CR+-M6pP7e?oKSW1@uNYAlSW8
z;Erp9-4j>xB?SUrDY#KWh)}xc)$BXIhcZtp93;uk*qK`-i61MsT?-iH7qC?f+32~i
zo}d7;=4uKvsEgtG&O}iLTXJ5oK3dJCCsd5Y<zO=i^{E3D;IoqpPRY83Ycu0QE4P4`
zCqhr#Se@+U<m2rZ)k^$v8=(vB3qxgVoS5+mP8SIz9Bd&ImmkhI7(FR;mIt7l5KYrd
zXimf4YhlOqAz}WAr2oGF)vhBLtwbHk7*M;h7fJk_-5k4Y4-;DxmV>lgzwQ%zz+o;i
z5WCgaD+P9UdCtx4oUbaazYv%G#D*Y*t1v2@Wq@6BhU3!Sgi1n2<XjWAkGKLL4A1jq
zLc$?XBvn%wnVakT0R`iE<<b?>Q={qKLe>PRcEDdC(dYF59kSQaF6F|4B3j^t76g6*
zD~2eKj$fVMd&;SD26|wL+Z|l;`8h}gOLmqW0>GEA&EVa$eHn}BXVEbR*h!swaDgSj
zQL1fI@BX&Q2Vc#jpLAfuCTAs@qV5jqsea21OTt#3T6qEr%900xg0eZ<5Pv10%=>OW
zH*!4z{?b`8242Gz&%x`y)k6;3Zli4AOiv;+lym!H-U+PRE41$)6e7~AMS2*&iGwP@
z?WL^G<3rg&c7Uvtt1Cyy&hIhZ;y^Ze)2KA|(c=NZ^BsMFE~TB|?Dugkkw*!ZOTYJq
zFBuon-vEOL4HyBF7NW)A@0O6Fa`+3N<KAXnyr`W+a1XsSyi(;MX?(S{kHJeNEV3<L
z2v>o(#&yUL4dW-yLk&eCN*L%*Gq1hRHVU)Z&Oiv_STw!EUSC2cZC(5)2n85!6=NoM
z;p}4^c+#jWW?>AG>11EC7cQdR7e`>P-c|hx>r%Vkf8@rbZyX@LhWWrnc8eMPGv{LQ
zr&HF=Sc_5|xL*|+a$+Xe**=>=qK$A2sjJ(WaajsAok2ur^-p-=yej&5aG!c-W>L!3
zDXL-AfTnZ2BcCa>?%+pPoDi;kdQ@f1_4dv`yQx3^xg*#a4Yj$H2&&izQ^>Z;DDF}<
z(jWn&F~0AuuiH3epq%W22|;8o;*W9GY-T{mH(cC7E(L^|0Vw(w4|~7_F%(i#49hL3
zLQ598XtTv>HMYTLfduCFD}=QfOAr;Lb2Ah;QnQN!I-jduDSL~csNKwPv*r43fwE4R
zPf|T!kx=cjes4fV$VhaAf)o_j|6gaYX(GR*`QA&Hv|@@yP;rrJTwm9_m$-H3nh|@t
z?9QU?S}aNCC$jtufUi~qkG)+)k;j%?e4=}hkKg^9e^xA8M7WCw0FOnVo%Lkdt=g2z
zi^sPrP771`w+V)?2@VlfVBseR&JEEf@M`3<O*5B-7`AHEuJN()22vw{_PZ)?{A>vS
zurdd|Pdux3M(=J~OE_saDhPY)Bd-o$CXq!O6s1~?b9y|J=@C)2Lw$aa8l|8)th+47
z$lRCOnX1999X{OrNB#uWB`>sQv<%r<KRWgtE**EC6<?4gIGHAxp|sI8TSO}U!9h?1
zd!Zq+ksUj%Jq<>e*mxNoEw5d>Xn=5aUxFyJcUM@=oeJ28ByhuPPwIDajxZpI3Fc>Q
zG6d@X96a#I#}F<%3~6vdU-`Z^A_;x_L`NlJxCALf5J*lPhJ&04T3`1-U$$6VTECDc
zY$v}IU@B&eZh5Hf%h;(LhlPHPb7iS<RUcW~eg5e9me%mpp3QyhF0+CovqX%<7szrE
zu7cY(Ks|=1vP6V0)4yignTHyv%xvtwmr6ctt4+z582*VF;u0WH4VohQjiv#AAP{DP
zVE65mUey7C?_D~2;Nos-ZFhZ;_D{j%{1%}NdFQ0WUbR=L5`qGR$g-}3Lp9TsdbjMc
za^x1q!%OI9;ZzXwAXhn0{6Z~up?lc~l3qQlMY<E--0Ty08oQm+)-$*|Yo#+7lRG@4
zzdPZuo#w?kmbmrAc9ufml58@!PtzK?pTrUk-eOy1r$Lu3PG^9SLs~ZVBy-UlnRz`D
zD`4!BIWFj5KC^jIL5ej&%^~uev$7Z{WWMqB5JSo~^@wr)xAB$up}ymZ4KsL5S+-z|
z?HFj-tHb=i9J-*u_B$rzVg-s^0ykZB@=h_-z~H+?;GQ{SlZkHfB0bELGoPzE)?k35
zTWTk6Br9KSHeoAP-)IQSIjjH;aC7D-lgu2eU)W@iDr53$n87)kzf?m+Pos^dkqhx^
z9+d&BWbUF>Jbn_y5rDEP-3^Kq<GS6-aYQuFduDUlJrwNP*yGOO7=*UI`Z>|$1CWh~
zWib<MlPoB5cd$ByqHLOLU$2<kMHca{3S(g<cB^7!h}ql~t3OWT5~V!NKwJ{IqH@{6
z!O8JgX(8Sbh|1X(uMTs22_CKIG09p2wVaH1GC1cP-AnkGFpL;4^b)k}$6w^ppBM=9
zau%6Y@AQJg=)_~L)hDN!!R)l1MdjxU@++rPvUT2p4~~_;6#3cP<@((NxEp;l934fJ
zf3ecp1`NOBO-Y;ZnCkhdp&3q`|FYcuPO;59HVra#a0&|EZ{W$m9R;^0_6iT)*Cf{i
z7V-YWv<7P3p?U*jA~&9A+Okq(@L$rXvj|gGyz$dNO2o5DXUDJP!qh4or$Ng>r|TZi
z2S`~*a2EK^7dY0>K`d4~c)c1vr5oI*C|{284n`0kB@|X#spF2XrPdLn%RzVR9*?Up
zjA<J_MYqmlfZ~mhQESlNI&LmG5ys67kQDQ#467tH5EkoLg~DGmjDIt!1?I)iFo>Sk
z(-c&MW)=A;GIy5c;EN7w>BM<ecN2qPGCRZSK;D;o8nAU)_atc+FB18#Wpke#gcq3Z
zVreY9M5{0t0v`DO5Y}Ky7RZB(O2GRZdB3YHpJGbp6?#xEALVpX4B0lsph4gLS?P6l
z|1)YOB)xvDAmfj3HNcL}k|U*?Uzsg$`nTTuf&JP275!#gBWj>3dua{KTP>?5rw)OK
z%yeQ|way-qNZqD`1r3qip~oae>uC7Sf<GJNIOmEQd=kSzWV)-~#}Sp%U&%bz5$%fj
z^o@NQ`laUhfzfU}tN9biWKaVMBC;lDRD9N}lKK{V7z5+8ItowpXIsj~{PORrOz%@b
z5Q6NaZ)_ds`ZWG%BON9!ujTe1hP76?&8CP~ojRp#P?r%WmSzwqkbk!jI{bZHjDkqj
z5t)*Q>exq--H}gr$5jF<rzVHDC^|cuoj_p?lp1fzm)sw{?-+Dv>S77ghX<;Rb#Hla
zftskxEw3r6I`0kQR$y@*Ci#z6WZGhFGZ?jpu&Eo<j_ir|wh&)~aewDP6+OgY4UFiS
zrgwgi_WD7%m|6UNUq_%@?<z+g0tIKgraR8&tn>d<R+3dY)vL7ek0#(roYHyRi3j-<
z)Igbip2hkR;!P6W+;(WruN>4wc?!!6@4D?*qrrE*QN{tf^jcaP_>QjHc-Ear3dvSD
z#QoUa?Esdbr~r{c1!`2uxpA0(Q+W+83l$jcwO>eN4^vO>s{dD64G+uYbvCn@EBnPD
z=f((q{h#HvKakc!O3Zlkz|znu4A6fjpPt&?;OcKZtM6980nj5+4HEHo56mBZtaCo5
zSRYQEKlafLR5<cb$Kqfhk{%;%`mCzPBS1LPSl6PypFD2!(?A22Jq!+8+4woK+Ur{%
zEunqKHZ7b^Q8HnZmKF|`4po49<PTV4d|r~*kW~A5*O?qtk!KwicF`zb2D|-1vk$#6
zE($U@7QpRz44Ydv>5fs3Kg^5;EF9fciJK6{j|k(kEuH#)9^nT&1FQsmr!g<6UgV*)
zLE{x79f`|~U>M@F?oXlPL2I#oY%vyb{$|)0<rn$|{(hMIX<Qgg{a&k0VP$}R@ePU5
zywQ5Jc!8?q6hofi9v0$He~13>oD5p<>N5w|Udte@Chx!g2f=zz@j^R;ah=8rsIbAp
z4KLp314;p15rlSQPwecjGmV(u%zo~5biK?8l8iz8FY24-P6w|tyJ)BBqeW><H8Sg)
zHdA^rtBg14|8>V!fXG6fF}bpXFDx%-MnOBm#b|gor9yPNqp<FFHAqHTN$jVB>FIKk
zItku8<TfFc!@qEuL)Xh(pkD<#8Z|8F2;{__TEAhugr(+%yf~P0j0=5qeTh%6g2^B`
zB_yjvc*dY3n0@Lg?=wC7=1_&D_T51yRb2O0wjnxiZlH<B`poCg&Pk1wAL+5lM3Rsh
zbFOoawCs|oMN}@ATqS-)B!)WiUcN&?ABx1o@&H=8lcH3x$yc~N2;pH}W)rBks6Mfo
zsrUtUh!~$qQ3hmeuyq`#SQDh`72%$uW^b5#1zqx6wl#b+$@qWj+DcN1uJ_qWSoMQN
z9qsT_r!yLoG9(0Ikg#p{cxmUG+2kZ%JHHp{hlZE71V@LGnnL*;%t)N9V|p|<BR5NV
z1vP5=prksd9u-sDXmINtORk3WW(AYGZfNFUy_?-Yd9=U%@y&i9FmmwxcVboo+l9gs
zv>wb)H&7lfnD#PZ4<xch{pXS^rgaw-4xE*Z_8QX_?*>->s~Cuo;`Am0{H3ImG|wR}
z5GG068@)Hh_dQD3c>nNmrBGZ@K#`QO%ruHR9U&POwUp~h`pcBD(OYn|dUZgX8;xhd
z(g6ISD`ExxBzKjU+kf}+S)kuiLC3C}#sr+oW}@vjd~)b2{s!^zJ&n0N=r2F%@|*?f
zM3nNcnqdPF{iBwW_x}_r_4XKqcWY574MeAuQ#@0B&MDbiu1JCa0wDv@CgJ@7Xvso(
z@2M`(zy-&obwC$CfxNJ{1^@&W<vAIO3>1;4qBPg{F%ulm)|&8d1bzQdXoBmS4>cQ=
zOfnMDbJIPqwq?3Q&Sw#x&_7qBkB8rv3Mi8S=>8HUuhp1=JXDQ;BKHjW;=!>C2`TV#
ztAz+^IYziaZdFoq^goPzcNb2bx3b%XEcHJK<*&ess?M(NeCVM8;KTK8MqppoyW$~I
zzb-gogY8rc+hjx@Ym)_du{g7Es3QE9s0e|jW?&~6SZdbP!SMW!N->*vj#?en`y0Og
z8yerVr_U?PXEPk`OzH5-((8wg&4NK;{^mlEA4>r5!_4pW*)_aacf<EqBtB2by?YRv
zG>AYCMTO%DMl0Gy%(*?J*a(PV4||20B(9CK??q*MyWi^l9~D>D;TvnMLq$l>&X(5n
zv-TFSLp^)x6o+Sg*7;<9$lMWKIw*GY5h0=a0i{;1N%2c~v4(-Ui80Hu%DPj!Y1xC@
z43BnUn{DtUf=dA9AjUqqOrf8#&W4nt8Ov_c`D||@(@F_k(^9|jZLa4hoIiD*bwyef
zzT)NkxqPrj++yyl#J*YBCdeseBp)J-a(>B-I-~Q>Il$ERUCJ0P+5$=3qJrQi!9sk6
z<iT%;cgRp_V2OzH^5kb2TI9ypgQyA>Tk?%l3)2V6;ERchrDzg-^%oIQHAFXj7;N%}
zc7i6*T=nX~0>8_Np1h_!0bnlsYg7+B%1?!5Aqhc$Aa-It2E;v7Ty3Qgf{B2Z#EPW<
zJ{d9By^F+T#~`Vs(}qS?(J;q-8dYvf8PsQ+BO1jf+Wjz|x8#o$T4i?koY|QySAX9b
z7{KRy$(fS~KNDozlz;w+`WzQZzHSr*)aNXij<iob6)p2eZbAr5ca8L7ZOq+%$maip
zZhj(5bZv%0MT;hK&ElsC6Wh4iN5fyXCLVx)l?b|03v4LS^=9$xd#zkwVd5(2f%BE#
zj8GsbQh>`CPX*n942;S-r8rXfD}yq-cqVI&wtzlhATKg*tF;M0XVY<^z;J-Y%*rV|
z(-%(P%{!xE?bA^qieaj8IUx?qkJG4qd_GUY4|<vBu|VOOyHXX4+_er7m>=$X&Pl@!
z6__q`3Wkm|0}qIO`=M>p3}Gy%CK72sH(1S4`R0lC%r*a2yd@OLq8Co8jwc*K)={QX
zppKXGPjPd}ak^(=y#KUxGsi5!yft(0yzZxO3O%UE!nqEIhc|p?iy;gnu-l;VO>-v-
z1hyz4{MXsSfL--7N@Ew~G|#pMmnAqa=wEwhkszU{Ld54fnMx*OyZtK!IRaO<8|6*z
zs2%cK_Y(k=y+#qJ@{(=~7H8>_fV&J>cC}9vE80+mRq_Rnn<j3tN`OY&$Px}bk>6c(
z#ubSpf}OK;TY0l4!M-Zops^hc_YBkt+pQe0pq=OLQkKc&s(t$!SaI|O`@WOl_yrC+
zbqrMG8~A;aLHwKYv@Nxw;`*HvjK792g|^AYn_TT2Xk^OIi7pmvVg8z1a(m$^WIuU%
z#siVYQpF))QzQWC`vVoZ9Gshmjqu4Fqm=MMffRxVT&akc?x%!kX)z-_L;y}>v}n0d
zv%e56NRbVC=5BO`X?2j>>8U@0w(HfMdLWdk=O{aGenzI&=$tIfMHgJAesnwe2HCD&
ziKDx;2<c<F(GW-#&TSHp|F;P%HB7>ybGqS8byZ!|pBRd)Ihiu8n%~rb0#}77sH824
zhyUs_!13??S=wd{y#LzkZH=t7nx*X^gw?q5FE8R)=ryLEq81K;zRa`<@To&#sLqV{
zN=O&?D!gvpb;xVmVtyYig%L+>NCLLRSpTebPpT;;cm75d+gUvUEE`|SqeR4deTk=V
z4NWjbF8*0ZO}!D<wZ~i26M1u`!cda^924lqU<UOLnOmJl6Iz!aXMsicSH_m3?~;Qq
z9Txj%`TR+7vvA&qR+Z{LyfId37-XR90VWTJ=NbunLq&!R|ARkRhHJz$<@G2CxL`d>
zO;K0Cl&Dg}Di4WCzYJeUT}LET=ojL%96o{CpAyseMDefygd%M~Kw+5j!G+nAG(1Pq
zgbfh_nh^19(5QZmlA-Va8{-bY>Q}lmsTYQH7$}iOlT;d=MYBJgIID`bBJ^N^#4@%H
z;%5dug)p|ZcA4jrj<FoaY)u54h8=To)R~@W;*y>!gwmjM7yj)Vngp!4ByTbyfX(5#
zkO?CKtB~Vwq;eou4Osg48mLzFe7d?!ZGGB((m@~@JA=NONp5K49|>N@yvM48W-V;y
zw&XYR$6=Wup!zJ|ZD6n_#PzRgROZa(=)fB?uD#h!4g`905&~fRgV4jx!zT*_JN)|x
zwF>MYAZw^PRrf4t-c&LziRw#M1|K6wsvclAha*Rl_XrfL064404XvngKWh?x%3-O|
zSrmI>^*pPr9!T;!l~f$cTLQ!$$TqAdjw`CZkOndC07{q`d}3Y<*KW@blv#4#3^@i8
zO4G8j2CwYfp64ODQm#JR2A{V|R9I#_nPE7c{J=jFX&vEWESqc72q=V2b+t61Fc8Tm
zuCP#Geg6DUjM}(UJtPeW0XhW`<zuex>pS`1%y+x}{<Fi0LbI9P_?D{>>0={wq3mjG
zoO!luhxUOJhlO=12MEw2st|1>o=qs`6biZkVH3DXdqn!bSsQ<#rXGN^7ykjDgqn)O
zBfWsJO4T!lm;$c7tRYnV(UtE(P3shT@3^r6=+nU6hn`pG^}o%vi>em7d&NDNyQ%e!
zxHC$ZRfMLW9`(i}wl*ddWy<a!if(Fw$m)v)(52jcDS-=#>St1duwImfbIg_z&#*6O
z*~vxf!B$TprRkliSt)LvzAAE5H$^JQ5B1hGZFdT@8TR^_O%Ot`(^;i(k2pogOkWV3
zHL$*b@q7}Q-b6({hS5auib~w-ZezJI00=o(EUX<4cd9U~+PfIE4BE_JrZkIFuCYc^
zfC++J7aG<corS-wKVC7fFm=u@Ykn6+FQMzQx%w22Rg`8WgH!b2@aGRfA4QK%s$r`D
zAlu6?5I=Cc4SC9b5s>i8ST}boh7gmg&o7LWVH9`)AwiXIRG4C};w&lrx<t@AbNvZH
zW5G0gcE%CdmkV(L`$tjafa)`kljEBG)SgUT!5)b>^?};+T0}sJt=<`e-G`cYfDD8L
z1x^n(A2=JiabIgJfn^@uOuqEob(L#|DkZi@p=#ZBW>bpEkIm|-BdwS*=o&>AI%yh`
zJRP`U!B}D!)lyA@hC3{$6Kh&W#h+b*2AZBN#^Q_@ETOc4A3O%}Pf9x%=DH#G4W~QV
zepW7dmp|ep-M>dE(-aHn+l3TO+24t_FlQZKE(;@9aQ9*Q-a&c%ElQ)^hfdztWTel7
zdTVnX?%P$<j!@_u5i#;+_|~!2;{}Mk&kTjbO*skJxqvlI<YLds9|6){aft??C*%h$
zN=sPt@L|O1o{YLPdVrodf6APKqJr?sDev<siKOp>c+X&G6IPEClsIBg7k=Ot1$LSQ
zI+L}y7(W}pfgn(!FGTHKWKQLlp0wCW888W{9_FAW?6@YftuykMy*E1|rAU!zZ*Ty>
zl;fEe>WB_JzUE+y5}gIHwxNFax<JKw92USLB|hYuC8vz0`7DH=VxXC$W;6c^I2&^B
zY6PCzu4F(t`CRfOvH6{X_0l$Dz~nDVp$r@$wTm&GF!vEIhDrKI&&>Lr8-!uVX@G5F
z0{P%@mT}R-3mae=YeOON6JFKND2HymBD#^8l6k<aKoo?dkKt7cbUGN(I`DbzPh-NA
zW)g!6=xQ((mH}Eja~Fvb6VBc;q%m57YEi<Nfj&I`gzSlEBLuwNhI5-57uza47wcvq
zNKoL=#xZnJTN20W$m>U`zi;j5qmf;q3xzsNS<XP{=U|RQk5G7jn+`|cscl7km{U2-
zKk7?*+0a#&0F;mkq8#U(nYhj2LRUBL)c0<2T-ALg_#*0P8Bi^KLE-}0ih93!!sY&p
ztRhB;7qkMTqMIFuouI>>`i3p|RE`2!xN@({a}&*vGWB#JvwldU#G3oZ041n?e%6J-
z4lICuJ}eo9SmfB&5ew*4a2b5QS#KhFk_N{}0uoceWH1a9&R3-8tk#9+>&=MLY8p`U
zgpf!F1r)`S8;Jk`$kwOUC5n^Cm6uc#W&Q%0&q`r(#~LsbtxgE`?VOkkkTck~<i{2}
zOozjcPxUl2$_pDxVK#1pj3j&!NMbn=XMv(oHvk^1=dfejmA_z5OE=RwKXG8mbUUt<
z?bt3~4BdHgFax&1AM@HOts{^W;9#g?-~hhsT%E8G|B9j&;fg47s3;Cjo7|y5&d*xc
zJ>f9$XQTYZ;F!o`dK3R4g>ziYY#sKuCxb~zkyZ`T<4Old8TK9iqhs&ZGD%RK&#$?`
zwlX$f;au1_YbzD?P^40Db4N$1JPWLiN=%H}Zc3(8dP^|3Dh4s1FQYcFa<=m266Ndq
zi@hx`5l+mXd3<{-)wIXJcu@#qHeW``JvF#M%1sQQICQ7JNpen2%BwtET%FHqs%~%w
zF0egKac6E)^4sv$$nQsjrApcmDoY0diqP5zqggP%wY$=Pj49Bz@g}7)V*>i5<o5|+
zUVTUvT2r}N57Kr%3NN)AfImGDSLO%P{2jxdLf~9TApvD~9yJ(l=yBn<;UHJulzx%2
zA|cj_AsuLBOlS#^B8ozYvT1eeR8>a0Ju!J-yOEhejUfADA^seTHlwV?-SzTL7g0vP
z2YO%!MNzAaM7a2w!CcTJreDP^e`n&2+be)>x?gT|Hs=lxIw|x;*f}W-@Ft?`NK_(@
zdog+en{vI)Cwmc6cP8(dHo(cmAc+h`b}FPO;1`6drvM^lHb>8ky~M*#3Djkrw^Pf7
zqh+_G2<)lDdP(M<MwaOVzWVk93JW!hS2*^L=Eu7%-s$TS#6*y>bzvUV7|p#x)B(SU
z#UNo5_)mS5N6K0b_Q?alMU0bv!7ZHSifg~*$CAV1q7;+_Z;vnKYG#Zp91w$oizFw{
za_n+jk^S&Y78TMo3?CHv&g*<3dQXuL1y-=cg!)S<HwmM@7h4-0SA!`*#KY|YNG7;m
z3mCH!&pHdWpb;8zR#FvJZ9q#^nJ$G1_hd3)#;=4KLIfk$Y79dS9O=zEyU1USfE;9o
zmq2HLE=>*e9F_&__3T+(hY+9pavDHFBudalaJYK8T!DSpP4dD4S{0?D=>?#-UJcPk
z6iO8Itcw$g=-4vCccZWLj<FU-+GAr!(mU@F0;%SK+xK60UP4FRFu@Z86`Di}av)O^
z{u-yKgX$at5?i#H>tieq-6#iNz6{^E>iZ@rq82pJ`YO{(BEYc*SxZugCVRbUZtHzk
zUrgWF&LIU!cyO~wTdb_H;c0K;yZ+)QqR&cfW4W;Qv=Qn4v~NxmC@P7oC19*){OfV}
z+BDK|xY`Kv`!1coA2|2_DU?5zc&P|aN2WJQ`T~ucMPCoLwi@F^=q8+^w@a!jMCdVz
z(FZW{x#Llk%Gg#51bZ7bstHGwhQ!plgEgr=m66L8?>>$^1+q$`7Ce~iG#Fq^jN@Sb
z{I&)%4MWY7ww#4`4c|r~OMABgg1hO@s`M$i0v@`u1jPI?AnUPX>2HK?|2b;?zZ-;9
zp%_qLHZD_2h<!N<+L2UW=0EWdna9EDsaU~KDauXTs^wEWevoo8Xz^Ymb7}7eB^j$q
zBd9v9EtoGT*mA+QHcnjyWg+5z>t5o9ez4I)C={uTI#ID(iBas1ZJC=9y|N__D;uRm
zX@)w#q@1N*yXjYFw(zxUfm!nE=cKwry>c@50SJ!++eD%jT*3I|y_u(&LY|w|6*q;k
zU<(nOm5i7~a&S*91A3Bp(%+481=ZC+FqZt<LO&`B;^`;6t?2=N3>oCkO;1F&crxPB
z!aoKqwLEol0jPeE=eEQTPnG-w#{IAdHcMaay=6iGY5sE@3d8h34$r=r2c(`3N|C9*
zNUM+`G3Uk%W=&|jTaNCY5t{9bv#GBgrCnNqu#bd~EMz=od??|+nwaJN-J<r+D8N9=
znGS5*H#>846v5`b_7qr_qPFUojtIn@3;ORblctLV3%@a!SAIN5pv?=N=eQtX-yI%g
zN6OEmK5+1)YW&iI`BZd;;sOBk|Bu9)yqoX1A6GVxoTHgn$g&jC;DI)egJQTm{e{+O
zibONZJVdm%ejFRicqeZ}<5n%px3T{EZFuyRUq6&}3BQ=hq%^om-+Om)Ue48uCy8!&
zdKkbl$<HnBmd_Gm1Jnud=#<6MdLP_dmO;Ua*pp&~RhYY#3JNH!elR5r|Js3=1~)8&
z03TK3!0AQ$l@G5cw3m%aT=AP_87Cf6%(0iL7zUboR4WY)A`tXY0d<_Apsj+K)OF^k
zmpGCC2eoKD6nU9Y4NgX*-~Ddfbv9#QRA3|VTw~Av6#N<{D3oL8r}<7L>(*Nm@{<)L
zf}&FqbCRJB>e1=no5QQ{A9#jnn_X5XQ>f(eyni;GX7P3p!T*6ZRD1`FUXAgY6$C}t
zVIodD(o)bv@Q*b5$Ojwxhr_(A(zp*v?>g~qoCx{xwHVATDq$N__02eRPHMua#!^<m
zqNJ(==${T|KM7&O^pD(2GR3ecP@EC0tG6vTfHkkv@&8Qy=q(C_-|Vd0dl=DY48aFQ
z(NTee9@e?bS4vb=S>OR+<4Tr_q@BAnN^v3yv2=*H-Sebd6ZBZgJm<_*g0Kc4f_#pN
zl>$7*+<|$`FF~Wh;xJ|K%0G1Csefrnp5u|A^_5xv&0A8^(e#)#RC^!PN?=*ladb$k
zDd3^<bcuBMxlLc+k=L!Hvmp0#r)o|u$;Obf$@?RU0EJ^Pu@7mYj+`!mlYyZ;1b!&d
z*58yW6lUD7Q*_=9o-}tty^j-BOHxO+JSqChwc!etj!+ZnMmeur=Lt*m5B`aoj4KQ#
zu~6JtcovJd_I;<bXGn~I=}ppZR}rC-X~*lSaXs#b#}M)R7dF=P4QnMx>YNV4WKC*!
zMP}(<!albW&%n1U4v~~9c*WtLlU?S8p3*O&*8G;g*0<#5wmzP>Xg;7N$P?EI*7Z@J
zu<K<W!-Ro7xep~AH8CagFM*#4lpn(BGg#XbQNiIqhDu{VVB<^QnHRnc(Vawd3a+y6
z`Ge%^KY=)Jac-0#BJ{3#OiKfxYQrS+61o6Z*B=|#N0nee&>2&_gMZMV^6$T=IoR$A
z7uUA%dAPTBQiWcJN`@x~zFiteL`B^!$<ycq8mo})8c&)gJjL*~Kh#a_o_S9Oe3KSa
zP<DIr724S*Cdj7??&?O{EC4)w@2j8})z|Zd|KsQy10!j+Xl&c&#<p$S+$0-soQ-YU
zwr$(CZCh`?_p_#JYPzSobndz5xEa!#n*DP!EbrLGr{50wK*Haqe7F<E6*|O1$E^sA
z^cFTP?+Qt0u>#+eDHVeE%57VFX1<m5g$JFI9F{o+)thWiNrAOvH>3>cunF3x5T*2}
zpVKkIlsyw$3C5=?khM9=t<Zg%i*0T{1~to+Wx!+!5F%l8b#d1I5aK>QURkv@eFqL&
zgYJ|ImP0z6nF0fb9PTOIT=P3T=Hl%SqQ1UB&U^#wngwLIQ-yHG?7#G<B9s@Px}`+B
z!^9|S29S+_4vmi=LB>~n46m4FUXe6F;dBffG&q>yskMIz8Z;nNM8im{8N{-wLm(jv
z#P(VTyzv`zEX{5NQ6%0^!F(M7V$@_(|JNcj3!?)lc@O+$%T)(xkp=2`qp-5P!CaAh
zyc$hQe^zA#2%}ORNihb<$&T+Bd|-UhKRUpO{Lp0ZC^Iq<S*n}SF&06CRT45oBn@J9
z1t5F*wYjwH`0yOZQ^cx*Y_7SRU>_sdG_XC%oh}qg%|cM~Bj4s$v0umDChtPiM$x&^
zMg>?u%3};YSRd0V^^S+|pKeDE?}Lpn(vZ{j2**G;TmB8If*wsl^oymq)$7O2$)&C<
z?3fXU2KX-d^ze{Vw;TnT`D&UsSfResPt!&&cI96M5WQ`R@khJ6c@h4bjxJ--@XMHm
zMtdg1<QD#wQo-V>mwX|atCib&%guZ%?-QhPY&J>iC!D>nY!6dvTB)wau;EH3IQpPd
zZl6y|(7=1%;vE47)?^W}CR5j6fU7-QY`Eq?>W~SkkTm|m*`V<#=I@RE(Fn_T06t?N
z<9xex1|gQgC5v}QSN=E}fa_&s3CUtB{6qNkA1L;R2|!lD?<!SG{LgatU2SkX5ndL@
z1iRPBe)i9TpvGYP_<$eYx@bDot^QrVTgP0m8q`YB7h`j2*zGkNL*z$Hcpg|b(HyCx
z1qs!}aU2(wN7LF)|EZCnd|>C4Nsx->XJ~+2C!|9-g%wVXr&gmw@D}gDiRG_sXOdI*
ztq7q7c9nk_A5zD8Ve<nQ`pNPDF^Z@4Co;_?(Yrlo22^xfy$$tP_+UakX%bDl{uICW
z5;d9D_Dv=pL(2Ro+d<<Y&bG`%Y{G+>-WrLj3=^_$+3|+RNE#qYHvj=Slxu&;0^Xr!
zkzv+u=aP-Fb9t%1Ijos=@>^Pp^}Q3QSV!BibI9?wzy1n67xnUKv1d_$Cg(T^w4Qu|
zPCpXtFW(ZwrG^%Gg^+FIKR++N{kuS$#ZNU_f~JLWdTQwDbWi1VDZ;fTNBj7c_}wJJ
zKmVdRYg&3=R2k3v|2FK?7KZ4=5+O5q8Tk%|rb9k3HTeL0f0*0#)?YUsZT~Vx;{+`k
zUkf<Qsi)ztCjv8~3#$(YU^!toC!(2g5LheVpjZP#jhDqKv=?N4^TTVEXXJ7584OS1
zibxR*1dV~w$-R^h3+hP>)@wejX0eNy2Q9C)beB}nL)&G<<r7ly=kbEb8>EP1LH+kN
zcP_S}WYv-1e+}JKZ@>LXCP!J#4Y~Z}o09@M*J{)zK8MqiLtJWTwr{Y1L6e*5#U+IM
z&~pJR9GCYYyeLl72i-L7B2p-tmJAT-mcB(RC)L<YFSf~mh`DgX75O^-`&YKU!a9$+
z(9)Gn4|@a@#|<$Zw;iB0tA|3=^kCG@W+gOcxBt5MFq;CFdFh0ekIECDxXKhpawqdC
zp&+?n&MB1G<cgSzriWt4_I1!RRzjoN(|cahh22xVIb%j1L2#tjF#eY60^(05Xw8kn
zP8nMJ5zxid>W-8GP4ss%wa5?>l2GQEyZ$TMbU&3z@<!VPF^^sTkq`J)5B-2L&{2ke
zTa76gtz=g|4f0hq%OH~WrU<~G6bcA$rjoHwCjmb=0T3zar2s1dzzFEm7vRZ`o83Vq
zzvqIXmnsAtWE+z8dkAZY25c;XwVvMLfvb7Ld}_hi-lg4~8qC)S<zSC2l+j%uZb1D-
zZnr8xzVBcD)s|B_<uIeQ#NIY03;DsBY8KaJK}IXzD3(mq{f1QqS5EHgB&sIk$T>o{
zMB48<c=`gn#Vz8;Gf$p*%&Jhh{SC6D5Ad2}E?WEF68bhl)<du|*m~J<ef;ZJ%uChU
zE1oVVefi+Q6G3|?5@ARu7KakWc+&PVJb`8E_(JjtzegD@-b{?Y{i_oZ>%f+B#YlPR
zAQngZl4m29I>cuoCMv(AW>W+{_D6>HdorTPatcc9J5XyUgI7lo_xH1$s>dO--u*`O
z!8+_(V3l<x2O5p2<5|<FFB9gT6ly0>ZLp?YHPXyLmV&>&tIOR6x}iqp8Ajvf(EbwV
z<^ARkb-@%`KLZbAlrvOHH1g-5(zy^zba4bAnSW((^8H{Qr5p7`ElV&=pM=ndwcTde
za{*IQf+=81+M|&J`vjZ_f@iFmC5!v7t7s>P;Jb@IO7Dt%=jl4V9XCN;1qm8w9KPtm
z6K(r6)5ctDZt{GmY08rRtAIu0*&=7C&*^F!N(N2@FN=A4;QjO}(m@>OJlKLZEAOvF
zuE3W7gFR4A266Opu|wWx+y_g)!M?F=Y0lS$)=U2ig^m82db!!4@=RA%dt=W~mwsRU
z8?Ko2qorxbSh2rr&?L9)<q^N9%=8MRJzJX5pM1vOspD!YdI<Iu-GWhoz<mLyy0;k|
z@*`!)K;fVG0fk+~>&=Ew<ij-P?L}W?n~vs8;KWRZRHl*C3mv$<o4v`kWi2qJXYNh|
zcvyGkmkU`OUV!zf@PM5{5kYG~&}WsAH4-*cu@WDM4Y@>q(B~H-OYt9K4S`gqV@u2Z
z&$h1^i&d17m+BzXs%H+WNA>~X7lX9&x5n3t=>a;?KHLjC+~mm*CpsXZTJ-$DO~<Zn
zLeiDYe_VhZgHv!mIyx%TP+t1gx|8L<nQ#ATcH;&M5qXeTK&%0v{Q4Oi0WdPue?Y?n
zlC+^_WmO}VTN7|zbVnDD8!VUrw|Dsdeqx9UHJpVT-4e4JR^##zA@@wW%DEH?sS-Bn
z)LI{lSrsDov0BQz^ZEM@P^>~D3nyma@=s{3@l1M6P;d}W2uo@qw6htOXO+xe@ych!
zr98HCn3#`r^z;<^Q879La)M<lcHT`P`z6H2diU$GX`9}#5M0h0fy3t#hAhIFDnCji
z@Hhl!RimSsQ`e$|OL$Ib*ieWE7?32XI5#x=`!4w)>zG#h_^85gY-s`SYZ7Ho&<gWT
z|H#ex^?-eC-eEV;9+%<Ce!@umQd?6V;r5+v!I~_l0$OV$)$3X6v0uUqxIio|)x<iU
z;My{4S@UWAgz!#jM#55iwt^U92t5{(9-!JT{gdwbP;CTvq?0~o?^gylk4=85y+g$#
z4wWGFoxoZ=Cda`QHr?JMAmQ&rxNO7IX<RotK)tJ!qO<#1W4QLMf6e7JvrqjRXy<?I
zCL`)uWRtPLjBb;xmUaRAqL>*URqh(y-ZdjX)zC2kiJl?udh^@7fhyg9X?k>TOW=#)
z<xI5!U-$kKRMDv?C5N<z>WNWn-M~7tu$D6qd0HNie+12WJ@y~}xf{A5S{g)qPsK_a
z{1I4#|2aM>vyr+-7n~%R4>}&IA0*`RoEK3A!ttasW_h-*6h0mm7x}d-Yq}^)`$NRW
zn0P~}ruZvY_Hgmiyi1YwCA=qISOXZEq{LkKL`VN%gW>Gk@m7bEqyQo*X89$-<k*4I
zqYQ{CP9eZGXr*n3bvQ{LS+zHnipFG=wt6~sDZ_<lLN_Q#MKwvwO~2tT(ak@_)ET&Y
zS!CQ^R+on2nv*?#k)|?(fL%g=Yg3<lUFKmiG!f<&or^8;8AYLhmo}N!N)4+=Odeh(
z43`_?TayJ?4?UL2(aL(uduK#SfB9p~L|urXKulh4BmmKm(w0qHTnJn)0)vYU%N{P^
zX-3*I3ri(7+agYxWw3UQXQwsRSoZ!Mmiha?(*XwHbg&hl-_-sSHN_`K;Z7wt{xfI^
zMRH3Y@>9T3%m5~Ejuj|Krx;F-guL{}YPCA@#|Zn+!9<^3cgvj_S}_CbyLCl5Vb9yr
z;y3fWUAn>_ccw=t-C;1Id=F|l@Cx`bLCibuPEtSn(m$lDDMeN(_~eaB3L`T17?Tke
zuX0t+OA#vS(aaZMzx&wR;VLR&<QBG1YI|qt?v}FYSu~p~QrFcymWV*50AHA}^60?1
zxK1PidgSC|=+k1XDOc*>z^sbRNMtUBM9Bny$jA9A;a6jt?vs>xTq1R7><O270bk2h
zu7|ouCit?tu-OgMXp*gfNIi>OdXePZ*<}91$HcCoQrI*~<l0X(F_VcV=wUCV$^sE}
z1h}Kl>|lqRe)OOhG>_4j-@Tog#fa}?v|65SQ9^KU`b2Busg_B4FfIXFP2Szd&_w?3
z{cs<@702j@F6IJOc>CyTy+TmncVxC*3$FNL<P~8jQO(gxlj700M4PuWX|4te3~a7G
zI3NN-m9WKDa>mL|W_|$35iUU29;Ugll;(M7mFask&)SjI5H3z{cBHeV$N-eNE6%}8
z5|<|%-mHDv**}g*-_c}4%w>WH&cxwmZy_BjbY|E%>aD+BNCrN(Y;WEU_%0py;y9em
zSzZ5vJ*3qn>-EZ`e-cNXkr->3u^X(V?7b&hu@mMuu;;E%bkderPi5Fo8(ueRR}8#d
zx!7-_K!sZ>(dZ3aJ*NUFB6D9DACy(7JCIBSL-RS3J8$gGd5Tix{U?sc!(A1?wxZAN
zJOM~5G-XFK#}8Kd<bc&YF(OP^2m#4{2h5$j2Fm+~OcT+Olg?S+@hbB)TN)Z9o(g?^
zj%l6>K|G?D6f%TC>6hCXyd7U_piSt_Oy{2KnP}N=5{C<KC4y0UjVArMo*rc?{Cu>M
zp>B_okJg6W*YMIm@?3aF-`_~wLNgZ`_ymL6s2$Ipl*KcqS5hzdNq_!pL5+iKw_dq^
zhN4#dTl?L4g&!Ak8vf57)2QS&dMp@<aOZxphS6epT}QdnI9V*xect6}G!-ClusV;P
z^SHBW_9fy#!P;vI0udTAG+<!``M%9X3rGw}^Ue}SEU0^3wbrsdE4tuVsByh|Vn@|l
z*oNY~f<=$yr_jWhM?fK|*F}q39+QRNOdXB7;*47Mos+KrumVreg;or9W1pJ863&Ik
zmDTP}^=_a0D^()D%+$nP`GN@1h606fcaF=mza&lRLZ<W2AV~!zo><?r05u32rWSqx
zUSC3?6G4DlxAFzkBJ_Be31lH`(yh|;T}hN)akohH00KHb2(J;R0u93F1%vlES8QH1
z`Yu1iSO{3lFHJwnG!j}m*ljIpDOr`sbfkJtH<iLMa%F3FMT=)ez0t{)3<`UnjRV8>
z6G*8-2<S(Tuq(|_E);TEHUciS74}uecO71?$A3M-ewDNkbrF{{zC$1#Iy}e?8e!v=
zyAnwg^@2bePENq9by^M|z0w8OOa|$~j3*8P0bHK#2ikI?oYEF#1#_e3grAjjysAj;
zIy2otu4)p@LAVnn#A~KUSmk$-Rc#CYf)9X#9P%Hiq+{jfdkr9#94IhIC)5KAmtshS
zq}@n)4stSxe9CTA0-xtDhp`jMQy%Phfh}<E+3v|~t|V^t@-sW~a<6iM(WEqBg?*D`
zu;wr2W60o2=Rypfh81=>sbXrWOUwQ}b9XI(u8Z7n<5<PTc5F7-uKk+#C(rVg*eBbp
zjM{1VC9i|{bP$$ts`E358xfJl(^;wH@rLqDr>D>^l#1>{r}zM;KhH{>rNrJqAsCS*
zYm<=MkEO;nr_0_@3`}0@m!ZJ`g&_gb?Y0gdKMn3IAsz&h-bQgq7hbZpI+Je_);jI}
z0&UNhXQ#w_RSYd1nUb&95SSV>8#a7o$${Sf1@bY_yw4?50!<ta5Xx!d$gi*w4wjiF
zk4MU<%60)|Fd|{xF3fv%SmvJ7b$YpGi!>UF4Y!t4j0GEBwcxNveT{vcRp7Ga9+<TQ
z$L`?q>R~WqHsR+8RM-_=xo^yvcCz>lW=lWnOy4Eyc?T$003BG?S1$O+q*^fGUWxl8
zX00Lr$0bxz=AHdS)yejuQfVUVRg44?UN|+HV7NVMLf7O*)?aSw&9`3m)aqO!@Q4+4
zyQ{_ZbP!r<ovg#~I*{>S5w@M3$|VKg))sdgV{<58Y5Fq%MMup)n*)`Q+lYkNmZxl!
zyd3oj)QJ-QJ-;Sm8yM+|-@6SK`)-vLs`sItFNYhjTPh0zu|kgA&U<LiUi@pfH(%|&
z*@3OkftbMYZ+Qk>#qBZ_6}|9Wj`mB$a8_U$b7_NXEG5}0%OI)kr7^P}Xyiur?2`cC
zx+hR(`I*Ok=fS&v09k(i$R_Q1@82~~nN`WB_F^#SV7JMs`o`h__7HcT)8UYO0r>s3
z&M6!arTDLHY^yJyUK;|JhB9UcEe|>)$AsNOi=*^J|M(c=Aj_SdhdESk0}~uZbIo=7
z-vWJ~5{^Id|B$8Y^tzI!JQB1)|3n7P^9$L04zP>o$oz(m9+AX)*RGg~gjcQU^(GCN
z3|#*H)!d$*j#-ze?Y~8V^I-K!)sbup&|Y#O*HL{0uxA68ZtJou%~R^}Y><Q<{mfIy
zX=V4uLtG*Y8%Dv6;H|0~O3`u0mglgy7<yN-_|<dp+Lcou`jHGH!@;%S-^n+j?!TKi
zMe*<Cbc0)o%7t<+ZUgRpXCOrAi2V42#CR%17HeWxeKB!xlXYVgiAGwq${QoYT+{}4
z7-m=C9nQ|wk@?01xr65J(OzA+X*Z6k?9}^-&FM5EsGWtt186tI<FSnm_n+$Pv%X;}
z*hwNp1B8_LZ>u6@u7k)o9N~`%iaYH%20aYyYkYPbT5p?Ithr?f&-f<ei`E2LAvg&5
zm0Gv%EYSKZi`F8y550ib<1*nrK)S2jHr@{uWgL=ouwU|#OggGkq!Ai~eAB#wtFbZ3
z1WPwOsDrzfAn=Yct}KUEvQp*ki~QWe=j7Z;D1y%XTcO-xDgDVwwKYXZtU>fbYm*H@
zJFHAukl^k55W-;J@fN>czd^hZw$tTo)IeN_wZCrvtp9KV-hL$nP{7-7w|E-u57@Yx
zeQF~o9Dx)zsSAd1yzE$GE{s|+tTE2iU#0<u>}F$x<zTxY4|!=?gTQ7P_!3wcXh&*s
zzLv$LFin7OQ3W&#<gQjY9`f-Lj=B)Nfw2MRMw;~kT<lAYafujF$sE`bXtc2iC@=9y
zU%kP|E5=9rrmKRd9Fk~l#P3SDeJ~*4%>X-1iE5c!5ug(*qYl4??9XH1A8FJ_Bu+}o
z?ggi`KTZ`8bpQMb{EzjiDie|3-|NY&`by*rWAu0zxKEo(qf+quc*`he3EU!nXA}O+
zKH6tmZ<|j0f)zk_Lh8S#-BnER50-O8i#00uK=fRh-dwAuDNt6Gm$^b;GoU6Sat6aY
zZ>!tR;pr9_dC4jA?;^7oQF~P+ZQ~K09=xG^wbOp6h-qP|Pt-Q9d;8CZi5?}gHqR%6
zb8!fd|Er}413O4!?ewdiV&=reWetF4g=}wG*SBzFAHhrGF`?YWv;V}|__vHLbD`p9
zl>;daG7TJ3>xZyjH<44%B5jNXmbaS}Np=3kpw9kPX2`t<5-A6aoD<Q;RJa##HHdIP
z#2&lemUKB8%+oIApG%x=%mR$vSZ$`YR1w0j>7PgJg*fT?=r-gbf!>^dC7ONZ^E{kQ
zm5o0bydiOvhCMKBT$b9a9f~?zir)atIZrj5cNBFsqSoQ?lCowC6O!1xLoAPi>xVka
z$TdGrozM&&llvHTRpQJO8b#N!C_gphTlLz68ul(Bq_Vy0uDeHIgHGiAm5g`X$K*f(
zg<XGO6}z9h<j1_QN%H+WEV1$$opDIE>H@?AOG%Z~FFjU|*@W$<bMMZjJhg5h9Y`)T
z<C-;9VhUESX;F)G$%IT2wSK{hww!W|Anw*HJLW>ZP}aGwg(wvrhoW;O+@UHAV}?G9
z8eY8gstjJ-gvZGkr4{;ZX<C+>Ni7e=p}@9dr>tM57I(1hcO^^#Tmx$Im%sN=5GBeP
z65=FiCy!F$il=vNcis14@Bkt~lS!QBR}<0>f#D(m#(h<E5g$Vi1Oyl2$2s@^BiQDM
zLa5Y3<~G|a3Y}68Fv(w4i%RFp)HAjQlWRgT^KRIzr-^+CWEhp1ZDI*{m|07_G%^f%
zCquJMOau(l`-#K~=&?p9a?Y6`9l8l}08)TVKCL5FBC@1afc6u5(3^bVb3XIrjd6n$
z<CoZmE`&@eT<n|=_b|zXjVi5{XDH)yi9-_t{7d+f$I+ZKa+4g%n(ay;nzqe;+gVc-
zK&+gB*$6$pAsLjtWXzNyLnIZ0*$FKcMOa<@rk<R)wGs-?&Ls)$=8<nw+Bee$lbg8T
z#uo6}<i_j8JoR<Y@}9z(v<(`LnP|&Nm5B>+u?}?4&aEOA(nE3{T)@Qdg(ztUhWdt3
z@b4g65Tp2gY_$f7%l?sdm!M((ROH-r<;+iV+sB`bN*SOMQtr|s+M`Ic^JGDXN;$Bt
zp&}Un>m2^TDD-yvd5$!OA=HVzmu=O2&6F`HPLM2ABNT*MxqV#^`RUEU<Q<JqpRk-s
zeelBV#7yw|`(=*C(?VNaP|4_9(Z!Yv1JEOz$~3R*0P*Pi-z4Wz*1lNtbfqEO?j91^
z#*pO$n&U?tVG_C@d)wI~Ml#TwEs;sk2$!hQ#H2o0#D^)XDVe9gYRfF_=57S#c~*0p
zfVPA*{NOj$0!x-Pdxf_&@N;=if7R`!_pdj7u6=XnB?3HWppiMA;rB<P$yC}~U3Y-n
z1FCT{g45EUR2NvJT@rO+XYrkuRvVeW)+-66cY6K~%=7~6*mjg>vpcz4+UwG_eJ^vT
zDSjC(^?#u0(_PsU;`Nf1HiSw0d*!1II>jH7-?PnBOJaPi)rT%UnV-DY-w*@K`*WvI
zZSbpdiuEa6gk)0+vM8RQkV7d{`N~OL-sJvV+&tu_|4V9Y&@yu)v7G*@y~fdO5m5h?
zO^1$##xM-IX6?(9Td@qWoBT8=crJR>cuN4KhexoSE<@pzYCaE;i?Qy=gQG`>be+uN
zN_s|le{QHT&438VTfONkl;-Pf1uq3{kGJ7IVXCWXk1;2F`)*&8AR>;o9^jnqokuf&
z=#H~q^b-K=TBQJ~F8MmlU?gjRE?Mvil@B`inMg%oU<mPX$s*@Kr2P|Lf6Fx5cQr9z
zqW60YK29N%BdlX)J#nrV+v0dVcU!cWuK!=vcw{F0v9Ec3)LUbpAfz_ZV>v=)AKq+`
zHA_D?6K>3^9VkTVe-)18MEeG)nQ?Z{rXUv#5lRnb=VQej!D(lBT)qO~nSICIt6yBQ
z4h~Kj5X}^MKmOu^H%?*T%9H=KMuT#|I_#^u>k7NYAp+9lWRFbmwk*J%^r$Q@1qPW7
zG6_IS8>gBpn>em{{wmjOcpUca5Cg+--x4vAViSY+sdu#Y#!Sh5^J&?9Vq>@dtG?}~
zIrF+!C?Gg|++bUX`O;79JvC^i9MpcE6vCkil+MMD%oToC_--1S4S4twy_wCG<6VcV
zd=q2!qRRg&6mjlJ^}9>(vz~@la)aAFUi?Yk*A=J5Zv$TxE2G@1b!?Ai5%lU_6d-j>
zd|8+;NzkWaPtX`0+=on*tDD-kC|e0K4%m;q6LeU#y9Rm(2w*u90Spw~$R+0b0Aw)g
z7uX?F&fa+Vg4c7a>%5wucK4o`u#<>+vKp|cTsFU@iDP5Xp<A@boD8|tf@@2EFU%Wb
zlO<bz7iE$qz5Kv`8VF(5e~~3yH&8^@e)T~~ss5?yuIu}p=UAD}W2?8B11q7gch8wW
zg!Tz+UW`1DIsGGCyu&FBrK4r}GtF})bGotnaE`0T$pB4F)bdd285Wdlm#?Z*f9sSx
z=g!9vzzW<Ov9fI+qL>rHKHA664fjtjWCWG?g6nprySM0ol;YO)u0G?Aw%epqW6I;Y
zaA3COZZFFEl@0+-T~rj5&{!_^X`X}7*p}1M|4&0#4rW|B(Z$e&{qU|c=-G-z1H=Na
z(6Y=<uGd5zV>t~Sc~4OHu}4M()tk)<WaP_v%WO-a8@fCsNm~DdMbXeIHh0~>s3~;3
zsPrO`=%!4_e8xvQ;_VR#2hJ{eq?;vIh&<GZmDN@%JR>AFS^3XC>&q}*9@YSvEmzs?
z?-OF(S+E9%13*ahND|3k(MhH`fB&0<J@Y*+H&v4ROu@KZTCfxGgjmgQp>GLWWx^xO
z(`#J+3GGqQY`vKi1<wx^eNMy?Vpn&A3acJrBk1HpMpZOsv`-A2Z0bF@;lx25wbSFy
z7mvrJ^a*M?=4oC+RR;xq?!du<Z+G|33l2Wq#=o9He|&gdWfwiFf-25%30l9)jW*gD
z(mFB7ouH>=b_H_&`Op5%bm)XS7riK(P(_N|i1@9wg~bmkJr*suQp+(r<CUysZD$o9
zqunf6gf1@>B#FKjROmRRnM*ZyT=B_cU|sOx;Y|H0jOin5-)M3f?obqsw3w*WyUyW;
z`r|M5W@KD@{>k}V`KgrI7KRy8``lGQ@5`<F(VNd(6s`3FJK7EOYU-4GOw(d8d>wXl
z+$Ii-Fi@YEaMTlI?l=Vw^o;5)N0fk7E>Kr+x!dBQ0=qzYsW^i_6_8Mx|CK9Np(xl~
zMtj)`EoYY&2P^eQ2-cOYg!GE0@0-srN=_#BIn4Vn68Y~Fk7j+20r>+Ov7`X+hn_+Z
z_Rk*^nYI+*v%;~>V?l0Fu)Olu-PlA7_o%a$k^bQx9VSWKLhI;KT&H1Q8LWYTf?jXS
zfW#?x_rxr^UW=s~u^|nP>+{f7ceref7%|Cq%(jZYoMWiAJ{ZXt=HB7Mwq4s;HqGhG
zL~9~XzHeuTA|P|ifRjmNdr(2T?}rZ4d<oBw_BbPwbqJJs#htsxSJhoro7ya{d>h6~
z%F38~LQL4xMj@%=LQ|HZ9eU|tR|{f}0(fcW-{cv5j26%50cGdiN(JUI((F#<ybpgv
zBo3y079e)CP-Y<-3WC@Y46!kjR06JPNt<kD-?juj-?rLe4Ri*aXq7p7Q~FomP8{?z
zV{gg?#pjcli6Z#=&uH~OOtrUVM=Tmg3>fqkY>AA+V=WnT$$@PcdG8aV>i99T?lBi?
z46@QoOHzDO;Iz+Q_Ws=Fko(&(_6-NO79c!qBEi_$N01xa)D};G;k&$y6!rsbFm1RB
z3T9ZRDj>SauVohOy1#?g0ZfhNHUJij1i)e&TYsYX<ac6lX#oOEg?%K12rMz@G@1Md
zQY?VHJD854c4$fB--||~OiwZL|M*}Hx|$+y`TYc#OZ|8J^fh&sLmS?1@)$U!S4O2X
z-M4Kmz}DP~cG;k6LVXz$=Dn=?h#g#5PEI><!#)+41UfYOa5Xa7$_yk)dKav-R==FY
z$Qs%<{GWj1`|iG(V8+Pv{~%F3dPa+hYgXt7!<H4<5r=*cz}xiuubx~T2wR1%;=EdQ
zNvJYn$Bz<d8-;0_k@5l(`r-L;WftwKYDFrM^$zl;*!vrVmQaEfXeyEZh_1k03Jo)O
zyoef%z`zdT%&`gUHCTiL;gS=VD%(raD&Q_8OMrT%N$p?se-T>REDo%Hh%UC_&Jyu4
zeW8cOEe}@|{pm-!DPq%sJ{Wu~5pfY4nvNhe^Djv`#DXmod&ai1BVbx!u=s&R4MDs9
z32kxU;0PX@d}J0^qpAG$XK+K2jiV<A4LOrv0nP`1U)<?{eT6h|n?mRAYmhbMRbnlT
z{J#{0M`<O?6u>fJaZhe6*9v5oMiucz#CqlMJ&nIS=@SnR_sbI+2B&%fzC+D|Vr0ZG
z<%Gc?(tu;A58GpWO(16<5>#qtAln{ts;sYKuK<U|vYsdZ!j1xif3v@cVLD`iYMzYm
z)%f$BucQO0!d&xNkyrfIF)g=!Z&>0k+Bj;NVq!PrY$Lh#PAMJ7xw(Zb+*h#9Pc)n?
z`p)i|2^O?;Jz9)X(JAyHb|#ZOJ4n}L_aAC6r^{9p@A74~71C3`(Big?afRzvRMv|=
z+cr&8=GDq?5V4SjE#7n-OXCqEZBfaih_j1wS43!xfe$y4kliW);Czux2wN%gubK4U
z(BECz_TBsDZI)pDsYXmQ@CYU#_93kx2(oAk$q>E_KTkW4HcK7X#abW#wybME(R96_
zT?hc>waaX2iX<Qpds7tb_zXgDn0GEFk)Lr%-?ZN2IvTsvZmOkgILYkYtwPGpo9fQJ
zSG6yuRUG><UPRgcC+;oyKOC=scr_<n01;OAobsPLho6Y38FC#l-EnZq0xHEH32|01
z0E-^aum6t&N9ig_zkD~30xocNPbkxbZ*=gA_PqC!OqZY-rVf_M@fX$Ky5`?`Ee1C2
zOQ>(6>zBYkdUmmbQ&|oipePAUb&D>m7j>Z4|I!>d@awotsgbjsO*1!VJK(679a@D)
z4OK%9)^Y;3tDYh|<^q?EKnZQMo>p{x4;UJ-<nifwN)?>ji=FqO7(a`!9_-S=u7XtN
zMY>@o8iD!@BK^?7Na?h=GY}^HzsVk55PySG6WMd0oacIfdar)McW(6!(SVlB&MOM)
zU(W;87=-%;4R~?6Lo6z->zoK~l`p^IrlqsyE_?A&`^`IsY!zbu)X$Pol|5ZJJ~Jq4
znJ-Qa{k`xD(1EZy#k&!-VR}~LZq7BSUSryhUQd|asOhFv#%^KLGs}j`ob>}?9I!P+
zj@Mu3WP>wXX+qeX7yl67$c)j&&y5;rlL0++EDPq3^d91BjI=H7?}_W7{FGa3BWD7*
zuRF;^h5LQkRpR+*Cr$>!Gs>3h7roSJZ1b@fP6=%ngHFooe}g-;i5^eQbCWval4-5i
zp~J2_u2tG$C9rXF1YhziDWeS@p|o*$&)r4iRzkhO4|@l}BGoe4eX>_&)$PPvbW(q=
z-X#+_qn5$;1phlcG(oF1JJ^byEe$WY{B7FEM<>{uOmIXaqvcf~W6qZgZrLWf4gV6f
z3?<qTnH%{bcQ#U8VDYLQm(l$KS(bhB&`hMAGTPDRP=Te%V$A0nJXlmj*b$A_iq02K
zCpNOge%218ALlCa$)$_Z+}gt&uTtX+C<n-HaqO#hMqK~(LaU{zw@r*Zoluv>#9aI?
zel(fErDZpLkzt05JNiV1T{WAl>S5?$Hxi{dxl;nFmTcRjarG-dF7Z)V))P{qk8?Ef
zrhS`0O)xVyoaWP4OpFK;z}%}%a1G__AitUMFVv+~RKkbFEg`_N9YgPfnXN~)B`RSy
z&#@u<mey8GoRMrj`-Sz+9(+}6{N4Vo>|!ecptGXMm5F7{0dQCO8_ZC(cpx(-J}P^{
zli3^U#vKOjB#}{-RSz?fB#;7KzFqNmi5ua7b?){{jmsbv$UAS04=QXZr>4sd+#r*W
zq+u}a5O?<N+lRIYKKZ(xQ}iudLyIOE^XaTxMWT_4k<HN0kEtHj_++>n*h4oj|0Tvp
z;apy-NL_ILV-twTCk`!0qk9?AfrZ%-r&oPs23AQ+$rDr6GLSq2zWrcqBTqWg)vO!R
zaAzON@{tWql-vYEqF?1w4F-xZiZLyDX#*y1M31*JL_^?3KsH86Oh+$T5yYKKH}YPx
zqfmv7Lwr2Msf~x&T1do-3|0l|&zDnRxu`keUzRHWee!2Ou}c8|MViL%qrwtB5u_2^
z^wsz2&QPm+xZ1A`MjH6sk7Kg>($=qt!}aJ<Z5DbKgBLvmfBBoL6f1@nKPW<}|HEm#
z_IPysF@*nyBTvD=8L6qxymy@7g9IvD$5I;{86>Knoy6YfiN-5F^WD4n<v&{>!T+xd
z6;w%pb;12RkChseC<-0YD05D-lNj2)gl>}!#S)$-6v={YJ913XK`A6smUsw;1Z*9V
z?G92er7w5svf8eaNH{knC$S)(gkhay?N;Y>r6#(Rv$IrOUdldW(KG}NshF^})xPC{
zcBaCG<`fsu*zTqbe%K~acwJ8SyNwXS{#2pR+*z%)S3Zvua5tHg(hGXa#R4DdN9R6<
zqM(17j)csZz07SvjZfG|^LU(7fNO-{Gkz<+>6o%$N`ND2gmGBnp2T*GB8?<&DHzK6
z@zck*uK<n55S^eeplDb-W35&@*_Ke-)Sn&E;6;ndTj%b1FzU=EP?^i08)w1dQ;`SO
z3LpDE#oFTk?kk=j^#d46Xb_Dx<C4ahvu1c#Dw@@|3l?Tl%>ppDj*2$5wLXmhRtGK*
zIq9GPf6m4y5vi;$u2)Rs;Zg=V8k7@WO{nFs56kewf%G*G%xkBRCA0)!wj(80|An!1
zG+(BB8^#+fg@+k&D5-1IrZ4Iae=<KIr01e=;kzF~oqYnA0!|hFUZ+Z&*jO~*xHoo2
zJ@JT<+i&*zEj>Yo<Bi_2LZK2UT|KTY#`)P5@HL3yV`CR?-CEuFS@2M!?x=wWwtkbq
zk@Yn~d6Avw(D<WUP_IfV=*>>b6)WJbRBIL!XMNTJq3A_xHW;8`(~Q!HWcl8j%HapP
z$16gs-;9cfZ1^Zy$72rEf(7@a<>KPUvm^sD-vlkWc80P|Ve@8u&_+&`W=(=ZLA{A1
zEZlH@;OfX8{u)C5y@?@jb9B)%14OS0g~rOg^kyx4qkX|Z+TUUDpF?!J$@LrdrU?+m
z0j^1h<q075)(|RxEeB~e3|9`mtT4z>BeB`xwQK_km5d?-8&iY3@deFSS+OvC*S%$V
zSoEm{$B#LJFhmMX{HPqH$;#4Txe<rk*+m$w1+t^_swv-sz$KaFW%p=&{fJK4rvUCu
z7n50En7p@Cb?*^=l4&Q&^neyP(KBoeb>~9pYqJ0lb<YNetB_mV4*+e_LizuemFd;+
z2ltPyIX}cub}g_xLRfBbEBL@H0)unK4D`H+!Dn%?P4{s@T>aF$UO;`K1x>`xB9=6&
zXcSGu&47ElA)gasYnoVX?Z}+?HPBlzw3YCSGOjPgF8!SlwSYL{PYA#H;D93dZbrGy
z!0W-&b(w;UmqU7a^M(aFtP(ysW6L5~Twcr)=%&9_U4J;aRxQ~LO<cT<2i6&;M+jHI
zMhw_ho@W(2i>2E>u)?srcPF&hzw<Vz)xN(NGHpwJUQoKIjUm@f?2{uftRl7}9<bXc
z`=Td9>?DW~NgAQ*3{Y7X(Gkn$`mbJ^3@usujI<TdWFjwCxaOsEVf7Zr7Jd0rpYit|
zxRxMyC;bWa;O27axqOdeb}Fs1wur8}-$02y!TkJ9J9+-tLTFN3e@I_nQRF5sY%~wl
z^DAxC6HA4vQTYI6APX4K@Q1r%AJkV>fD`rcI~&P`%YC_s|9;|Ww7$)QE~)I{ZgSEc
z#Wgi%MAc$cnJ=9a&m{UV+>4WF)*V1o`oHN(@m5+54G<X8G5-O}NQ8|YUWR#1eZk;q
zm4@c)lB>Gw4SGlWuqks@^k=Y6``mpxJQMEN1Q!g-cEqKZglIn*TUsn4qf#V$4BVU*
zG8>0ti#<tl7lJ{9h7ZRTFR-{^5~=&W9S$BIXv@cC<(5bFI+G@T;0jEf*C#iw@E1<-
zOr0T6`)x(lSMqeMRfy;?X$zv9_vL83UeIG!#c=?xjy5ta6<so;4oI$6#U6BV_hztK
zAN|q$t+eN-j1J0{F>jD{MWuWDNM`p9qZM*T*9fSlh2PZR{TDbz0G|<Wc=oulE;4BN
zgsoQ4?1}hc11j02_oeQ?$?7}<%tKivu~r#8{~)6jnI|<Oe$CtX_@j~h8YnYt4eMv}
z=Zn9TImQO?Kly#f{Ap`Fu$<65;2f+4T9khhS<doc2O(i?l@FI>EoyqquFWRUVi7SW
z3n^ff3eo;N#UXCJ@%?TwBrl5TDJ6!(bKX(lYNMVds|<1wn;GHlct!&=+4$#yZh^Ag
z?;VJCUF4+mANn`;|Clw3(j6dXJ>cL?l3rfxtB4^)Fwc4|{EpdI^S&B_{$-*-P6-Mc
z0sDxwh4On_2YcMNVka>#AbE*$uBHTm&-)IRUky8XDJI{*XMg(u^Z5`4&#LKh;od_S
z|Bl2eNNt)3zWud$8};|LD=h|MC|SHy7ZsX(NxETgE#$s=oK$aV8^q(LPNU3L4pBla
z<e~Z4b7oi(axCKaw8YGJ7eOt)gNi035O+5-3#)<`*}evRmKcgV6V-sPT(%#P(1;<=
zesQdLwIA>T+rH<hydv%@Lfc)c=Gre!oT9DHM6d#~Mn2(|C50|u-XzM)h)dDTGCyrl
z{|)x?#<JI?hhwr+c<Yd@-t6gOnHkqz&eRZa3QnlXV285nyI%N?YIHA59w|of)L{v=
z<43s36N{h13?Y|(g)?u;pe^26XBgm<`{%^e_7=!jbIT3BC9LWbLTj5GvL3NO$WQY&
zK{GKjrIiTAgp4GzO;xbnTB#Vyr7>ZVwp7>tEU<ChS*>5zvGzfm;ps#lG4(8M@kD_}
z7SeKcP=L(a&odd5Qh=%zA&{MB{EtB5v70kaOjja*J$mW~DKyxx5?7OMs3cU`Usc=L
z_8?>~Ra5}W@q<_Px-y&)BCOoNi9UNl2=5GoUEC0@)N4N}M@Bp<y;4XP)%t!@g+$=)
zw$A-26~a22HJFh4kTRexU4+1d*p<^{x5}e}I(d%fooxfHtoyVc(IOp^9A?#n;pYp>
zlp%K2zcl#D!Z*)EeH<W_f4_X~yN%^J;k5;+|FY@`VB}_1aH5x+Z$&*3E#5nkex!i`
z4nm#AgW|Xuol|Uo`8LgnAgVd>Xh7*eSp>^0NG^u&FXY;r2H}TkU@OM@Ca*aT{BGM}
zcK#{SG{3@RfvfK9bujlLYd9bMkw^ftg>r<S+3UPHYEbnm50o=Ro&_-!xKttV>pCl!
zCqnq=gsiMu$<NQ*57egD<aXdb`zto?<)<15Sg*-rBHao%O^zS~X9tRL_UO?L=Ys9l
zlghkfPjFX%$?mm2I4Z5z`YAvHVstaTHWM&DuAu%y$LY$#kUs3JxxDGZS>}Nfh<}m1
z+}R!ehCdJ3P4PYHfbr7(=Y7~W+pW;KyFlvZ?N3<^%L+L#%|vb`^aF;@DTJnhI8E(x
z&c-N>`u;PncX{CYF@lc<Q@KfWzPX*7NS?ZX4$RH?1xdsL76Q_e7-!F+!Qi(LyU_^x
z5da{nVZNuvc8_N&QddP==C*O6;5nfSJoeI71e{(d_hht=Fg!zX(HNisAydzJn)&-x
z?_b#pBCiGa-PAP$uI`*{^+C>pY*4_vsro9)&CV<xI3_*;fu9JSnqscwK|{3DcdJ;V
zb(m|A8C?8DeNBuWavr~*^@EM>pI^O!hPLYPP?U#ERoKySJ6}KY7?>?FE14j;jLKFL
z{P@>FG%IPpv1H<StU1<Bo`tjM2)NllHPcXU_gSn6*_Z*klvep6hfeF<9Y!=5SXB^h
z@{6K+;xXuby=RwtGP9Fpn)~Ij8$HY-^sKk{;5RMM%}pMX2)!kk16aD~*)5lC-#icA
ziCISVgG5jPHHGQ`*HHi)^Q#Va)%^%0O`fLALijt##eMH;V4)y!8-Zsru+L3f3gH0<
zX9dFfaxkvf6T0HMF&=MJ>deV*Bw9G1$3en^oQvm1|3^DXNEc<t$^WU6=y#3@2fLg$
z7h9@++p>%xVo626CEu^+MM-&qHC?-0y;ku)6%x^tXqrntZ7EIXlB7dM5+7z^@w+CK
zdzl-!uUBL{OjCbL?7wOM1{S(|p}%X>GsURZg1S^_%m-8A3=wHY=Rj`U;$Y^2Ne9_l
z;u$;TF}aH_qOc#J9`D@7aZgKfe3uTOmNV)WG?s~Z^#E?5rca!Do~`qZkVD)ohl=!J
zUfD|r7S4YvY8oZru6`4R1jyTGXZe!KTJ@fd-5tWUj3C*7cz9Uof+wLC5I7<KJ{_5{
zpixR?*?BR`aA68@%`)Vp8SQI|43{ImmRa5_+sRR;#pG7whSc5MpSu}x&a&^Krx}|o
ziVP267g^`!b?$#{ucRumdpbm@Caor^jtzWpew(GH!vXjsPyRn=y`4Nn(CuSK^Y5pK
zY>Kt7bQxSakKnyfCNYzN!yC;%=f<|XVG;}7JskdpH!6FTDjVUl&Y%xY3U6s<gJBVY
zpxL?TxsO%@rgj4di53wbYEB^?utQms_gh*pgV`sF+Y=1&C;OZ-;<ry<!6Qg*#Ht{>
z?OX@NUAH6aP_q*<1|;$-JNZ3On@I51+3GfTbf_qdJI?cxH$5!Nx#X*z+nHa1+wdh$
zUw(q8AF7HUUt)_Sc#yw-<rkpVu5CQ{qosx{x4fwq-#VRl;nA43L4P^Fk`O_9>g4bd
zIH5Zg9#JXc*d+AaJ<M6-?5-#0IS{lfrUF_(gQw^>gdI-Ql^>z9Hogqc79<)1X3&%#
z1gV<Ke}{khd3%rDgJo_&-{yK;K@fk!?Np3v@zkf;&YqC)TeUDz$@jqFUaPMkLNM@(
zS*{Nq>Z3r$;qMj>T|7KcqFOY;Rdo3H>LWu3Yd@AdooU+6+)4Zu9?8u=8iL1=cs}J4
zZp-r?pEgSzg7*Unc_*>9b|ekhRk_J%4gtayE^i)$6jXB3%rnJ#>j9H*T*=WAb9sun
zwv2>29?wuKv}lLh!EthP=l%Y*mCNA1YsMvT43oi?=~M}*9Wdom5v-Y%2<vvuPB8gv
z$25i-rh8614ugJ-liE8N-W5(ePO973ZXyL#3Fb1>#=vMF#Rc)z=eule%j7H7!o1C5
zka#AdTNK9}RcBrpg}K9xlD&PoajdE&OM^9NImzB$R$I3&2<2qk8=KI*XlMx-XB@Ax
zFh2GD*<(11{^fHdKfy>Ec8e(_Pm70a7=?fil2x_QxDkm|3d*)o5%REz^I{nr^{~ZZ
zF3Du51Jc)7Ui65xvlaL7!1-Hu0xKh-JBT5|<ZN|telXE*H?*2xd@IBr&0op(Re!s&
zLaMz(iw6o$j2=02S&QaN!@Wa0uW0&>YR9@U2kx}yUrdjGXe*GI*Bx)8A($fBM*NhD
zT=GM};rCDmi-d&D5dbRb{gf|Jdx(c2NQ7ehDYY_i$NFP@#&C2OQ~#F_1>h24FQX(R
z^%I3}a6N+0Z(ayIOa&5b_A=u{0xdhpVOOv*JCqPf-w}tk(*V`%r(TtG*SY}B3UW34
zXvslx2Y)+V?i~x!XiGPY65xm7ZZ|0Mr(mp?Y*YF;FkYhHsZw4k%lM%~NvkG01q-e*
z6u>TIFCX!Fn3u|C^Ohu$mPn2ACh4)#D}wX1gCm?_TrM7^BAu@=z*@sICILQORK6rc
z^V1rJ>00_vzVv|4T3W@R9HTUogC}d0E@3oLu+xt{qgSE(E=JTP4cmSb)6%G0f2nb2
z$1CAV6eE?(9&C&s*$1LgAJ94`J`=mQ8t=CVCL6m-NNpbFG9ExWcQ)R0vn)+}d-LA&
zGhZxn3iJR)LHBWrXhH9bJI>&pHgp|LPMekW>4K1M7}au@aQe8d?k{gMw2O4^gD|M$
zkvhA8J8D53JGIQ*1zlvAcG*M=<uHj2N-_x5#W#g&zRe~Uzm53d660R4!M6XqZOuiN
zysYkeYTC!w+%w>SLG~Xmek&6up7md_NXHYo?w9UMuXZ3<pi%JO1;R@MxSY(+eXDdX
z;7F`r&|O#h@??S~zr<V%0HbfWX9w1Qu)YYde7GC=*{mYg_ZJQ?c{1IRA{z!)N)pKP
zD=kie3Z>&kczNA8RA7kNwUP4=ekOMu2>x7@FPBJ7470>qhIH7HSXC*`Yd+Q<T&Ryr
zWonxIVf-GFEyiD>o|A~`uljh!)#dPVp|*FMQDXKy=+A#lUNGJ0Y6~aah2IfmLWJyf
zDAW>8B2x4eIxkPxlK_9q0ukMY$09IPV~-~Ag0Vs6LUmPm*J}jbNGW;fUt58V&FZ>Q
zmo>fNx}A(xLV;u`xdThFZDKDc)qb_0wc&x598)KlGXK<P1<k$yKL*D?0{Q}n2P~XC
z)!0QMN2_B6zD(2~kP3VV?UhL6MXp+Y^lE$QsQEFW?qg(jxzVP;@9>Y~xjcfE#dq&I
zQ_P$vZczQ-lv=T`Mh$2fH8{s$AVjme?-UzkxtVP%^U9jc_SADsJ<X^eU^p1`Td95j
z)MYs!;tF!aKgvSc0LP`hVWMuN{91q14?-#y6Gi`$Pn2}7XBW1x&}soD3$x;Aj$x|P
zgj4-B*hWv>d%umv4>5@F=N9Edq$)zb?p$*i#dp(^!x~478lnwA879J#Pt<QQ2q5bR
z6W(Vz?3ohyYv7@_S&bWxwMIDG(9$kLN@~>J>i*?F*09zWM|6A{sN58uFz-9o-PnK2
z&++gMhNdyJbzV?2{D5M#=JIAq(b?Scj)&(6rdoD0&ylnJm8m$iBmpA<=TcPgB<CfY
z`%euHsUTTOG3iz&jTi?yuqGVXm`F*ZUL()<%Wc%#MW(+Re<{~(FH$sU;<q9*WvVwy
zF&!}}FU5)tCEq}7sthWWZqo)EqI1nkY_TE@WwI|=tXfuQ;vxfS)$<w&&Gz==Swq7H
zTjz)9UpZu*$KP`&9D5C7B5H*QndoH@Iwwhc1tZslhs+T1b24W!&0&8@k}z5v%0-hN
z5I}!-U?eDmxK_Bdm?Lj0Zs`}sW-1FL>ghxe62WySLxU~?oEO(GN2)_qt&V||#AJ-I
z1fu7IyjPNW;(XlJdy$qb$WyzBB7;=^a6+w#J~_b2518O#3>MkjM#cYg-e1Y06<T<k
z3_3Lp)Oi*Gvf|;Rn%-UA1$Us%)Giog%5wBEnM|k%_wPiLuR^Xrc%-=8lHdG2(y=oj
z5t#NYQ_2M{=Wc90qE9`lzSo&fKY>pEBWG!w&_fCPuE1GS4C&b@+ZxOd27udJF?Pgp
zq7<F<>cHF+h;<Zw`YqWm@p*P6juk5?OYZ$+QTFOZZEvePuP+QBt_`+?6<}DdckYwv
zO$dyCL|K%Pc=JCf@WzdL&?G43jw;3#YG%3Eh>KTGi3QqbxOJ5CBDf1EIID1!di*Kh
zWVDrm*|-aWKW+d)&w;?mj{^W=e`LSI0gmPXAy2Xur?-ZAm}4(4m(Wu4+WeWjb`=jU
zWF*9U=j0;RTf2trRb3E+0jR()C%Z3Z(_^7kucQBdm)0X(gqG8`w9?+CAdLwDJ9m$0
zcH#o61W5f&uBOp1`Wa3>n4!-PV-<|d=fyME6+zTR5)`HxDB4Nme+!XV%-yyyf{kpD
zrQZXnOf{I!)#gbrFX!FRbg1pLsHpPmvsU|CU(dE)^S_}46rBsP#p-JJ0gh*Q;Ja#!
zS)tklst?QhbV(Sa+k{(-!C`&MPq{cy=T}EWKVUsQTtmsLRyipMgUnNW5NMbg7;eVq
zYM5-){I^1z+V^)089&(agLH^xN@-9;6SG&GI|Lc^&|BI`K};sm(mFVN#mBar(W1V0
zrRl~JzX8eTgKlq7(fV0#<$UGEj8l=m5Zn}B<F{ix>-lD+-~@}~T>$^ZTgx22LI`_J
zF|#`VlCYOrvSRBc5i9N;u5e#$985McWAePl3fRALKD))3(r~6>!rz)GsGaN6J+C@E
zBW&-yi&mV|m%sr?ZIR#eF&X6a2^ePM0qh-wR1!TL#Q?W-<$=Zp+U|UC+8SE~y1PS9
zs3<<SfNcAMA*BP+!R1HGB?2K(g@1W8;@>np8axsS3}z?sWB_)-9F66h5I}!mk1Io*
zRk*n;mvoR>C_$FcBLm`iz3DvuMBQAVkja-KS%mZtL0Rm?_@XVqy@Q8=HUxrWXdWFH
z`;4FjAEouV4h<)><~}!iPQJpM-X5s9G6pSKWb+6;NV7N_pcruBsJT=c{7+{9B_t(T
z1O*hUwN3IU9e0XD8fbqe4@lOALRs71K`nPg_rt>~<OzyZSfDWd5#^*AlQsat?`Qto
zFHGXdW7Ptf5xruyI11jwiZEVFjK)y|;1<F7*eIL+-S=mO5Iv)vBWk{x+}AT%YT%%l
zcIc_Db}Z|!pV29GMh3NO^x^?((t6A63f&yX1E|f>3ZE@Hz%?FWQcJ-he83_BJ#&cj
z^iv%{R$E~WEd>0@5(;f}%tfHo6V6*N(emt+mrUbuH~o9es0-A>VvUuPG%7GnwyG#X
z;1iT!;BP}zzR3T0`sV03n?K%UW2dogr?G7(jh(cy8rw-@+qO2gZQDs>+r9h#?mhR<
zne)u-oU^;n%zQsePtvFLd!@W$j7^bEOxZg54qZ@uGUjs;uy=3S#*RB5#z4l<xH}*V
zW3=pOiMGH<jx=8;vngW&A}?=z16}hZbR!BR|GREqDJg^G*lCE8;9V#tFjgs03l5%O
z{>-SXa@#wXTdO0#8dHnVjU$_y7PEBQ!@c#S<wjOcG5bH9HT;HTr1J=LSfZ!V^k;0O
zH&+|D&v9BO8nrS+#pq_+zA2wf3!=zpV#y}%l&hw!BUI0wE<pr;7{{}NeSpCqP}jT<
zzn%$W5+iitOXznNLZbI|fbz|>4rr#N$1zhMRS7fP;YVSkhPbWPW3l>qQAq7}54d#G
z%AXL_>A@inn#1Lb{DXV7z}R`6d)n1@9g?`VAO)Fr_oL_fv@Q4g<7Mpt#A-l{Au2q*
znR8yRhHUK=z!{`z)mwk>J)5eqgU-0VgAnDXwlI6U*n{EneK`H;r!mcz9Pz`kb`DbI
z7Y?r(D+2dmqBFD4jhokt;uI1k`1V5^;s*YbSHp?Ww~vWZOv!?2^^3;Sbx}DI(x*Tw
za?VtCo4!W}p~?nGG!xv{MLlOsNI0&x_cK$`jA|C7p>r6np(k#EwJtL;skSqzHB3S|
z)WEtFVP)XIVWQh}(yJ`?UhXS>FgTeL;d~E(Hq>k@6Yi0ILm!Q*C5f<5-QLzy@v-13
zs3WZZ0X1gsds6_p5w7^KmmYG1*gs;$s*<w{ebCQh1?EGkpwA<JG|&<8dYJZ#A?vxW
z>=ftb+Y4bF@8qwk4)%a=#GR_4Rvh(MM4cmlHCy0;D2aHERYU^_Atm0%&-$i*+b#rJ
zMz;hLGuzj6rLiwHBu0aOvdUMWd2i}wKUBY`b<@M*NQC3*1ArF)cn&Q0=HWZvdGIBO
zqEp>siZ8<R#mN3SS~2O3@;)K%s$QWMtUAoBl7<Xos#}FZga!&B6Tc_p5;1@}%Gnz!
z;YcPV);mL{%k|(-DIG1{J4`&4R=enQnSTq-FpSV(^1i(9nVl8yq>2K<^zbr$%6eBY
zp5tM37(fbXk!{_4><NcB&^}EHY6hsm=Zc-(V4U+iZUQoz7sS2^n)rz5xvx^r$bu`N
zq?Wb4+CVe@Y-K-s5{0+Gd$h#i6X#nK^|ky${`k*%QujaSNlF!VP&{Vr!FwB7Ivf%=
zZeShBMR$k36H+EJb*QmwXk<>uYks(q=kz>HW0b}Pvj;;hG*NZ9(b<b79^N`jolYFn
z++29rN=yJJ8*|`Ukl>}Qg+g%0jtbtrMZiUGUc%=f*5ZCfnDk|5kUYc99Rj1$tiTc^
zjmx<5KWDjx{?qT`KCcZ_q6wOz^UKCL5O`w=y+m-zXUX|*SUiUuP4-rM%;r5hKY0ch
zpB4FlGH(K*q#0qwintYmCyFvEv#U|wMSd;eo+gN9lvKaSvYd9h->0Y)@hcP{NHmOo
zlnoXLCQ{w`^WsXdadvc|$7Fo#rBXNqxWHn5`RmUjRpyZkd7yFfn9Dz_`_bv@2Cu%K
zQOr;Bs19uRuUfBG(QfIb-Ra|cV3i{NlF1`6@t=jo=yl_i{>f5`2=&=9)E$BoFuA*@
zgf25_DW*_lk)naNngG^fU9il3Y?UP8^HZ(b*{*O?aULD+E~}FDU!^=L!ffkFOQB)U
zo6XjLo;6bcIThH_N|KiR8;&_%3Gk#wVu?}F=&!f_UAf+MX#N;z@q+?9ZXYZ`af>60
z(naM)4gjhVP%OxF6?(i6UB2VGxp9koZ>sV(2wu$1dA8^h=teec`O@}0H{g7yNf361
zd!C)XLv^WO-U>(@-H>=z=84_aVA@t6&q}2LKkY+;PyLaj@Ssh-Y#R^BWM$NhME*T(
z`%d2KeWJG`@f(H}4ocP2;AvSBqZPQ!Zp!fr`&(r#C{r1~Dj}P~XyV>ld0R{+0fCzU
zP&x}|G1qI0FJ?`nVUW5_9pE-H-C$kU-bsA)+x?*`MjxQb-!ojn#OJQXjop}E8oey;
zi5$rBaLBS}$ICx+oV_d#jt*(fVkqvEROQU*+i6KA1T&SPi)ckp_+{7Oi{<%@+hv7R
ze@!<f45gOT44XarmE)v#f=aVQE3oN_=H6kpqqr!Tq-cbnGJlj=7S8?&*+kPQ{H^U1
z5B?vnTgTz-I<acNQbj7fki9R?2eHV1xSk9M*TdLSl`7l?5i|+z*+|Oa@$<^APSo3C
z{h9_W42NAAG(sil^N}X|hvWjk$_qPthe}Cp1!H3yzyJZZ<XHu&bhO&GXQ|`0`qo*U
zdN|W41M9j8>IT9AsL&E=^JWa3LoPi&w4cjOp@XU&7;D;Y4hySCzUH@pLH7zIPh$Q&
zuMO?WF)meqoSEiR$Vd{{0UUG6;3{pfbR#`e;TSx`bvLCb{2FaAT%<!TiOvyxZbfTg
z9R|xVn=R9!y0Yzs-m;lvSQ2Qu0wlCm3Fzp{6-R1j%>U+VY;!ZXPt(A$uP!<VAiI}L
z)w#Twj#nURQ=Yc_L*`hTDh$N_Tz$NmjGc#~&?3!1YLUId){XJ4k)WM~;$M)=yWyA2
zv{^Ym=)$NY5f|mq-z~7Mw1`RU0p2KLk>yjx^Sen2PF25N{BJh4usf>rNmp9#nq1kQ
zuVo^F-~TYDSHk|GBQ(gtYt{AZS`8#eYSx<>?v?K<Sob_#rrRePT^MQ-_~-rz1r^8{
zU;;s+M@_4Bs3VYVhk>6w^kQ%~7%LNol}fT`kAL7`Tc5y6yj(_q&*m)c0~8j;_|zbU
zunbv{-Nuyaa-VPwJs-TW3!5O4$njL&xe>`2mK7dW)YL?`89o<WIRbVXg)WVADQV4#
zja6~)$Z422zS7E89Y!~w<Br@_<vCWGc(+0!GV2Lkn6)iQRgJC@+AHT&Y#}yh*rMX8
z4&0_vfSN9uPDlhhp6w%jd?}Nj5!xDO3?#Y$LKPb6eyS+36ye`O7STtfsZ_+qS{J_u
z>_Ww4x*0RBPiFQt8!VtNecVrkA?CcDSfj747F((!WGJ){>t2S10K~*p<w}O4MMj_k
z*<}ge6`c+pige6W@Zvu?ih4T>vgayxp`7PBC~Z|W{qa7E1iO-4vBvW@#z&w>PW6UK
zrnJ?(ux>WP_x1a**5GCA!WiaqmdQ-TK`EE&>@(hPR0%rl(AB{QzXhQ!HH2&FdDA|C
zb~UnD2PEjXi_fd3FxC{utn~Rx)=!12-n4uT_|PV(Va<mS#1A`K?(}~lGR5T}Xzqp)
zLyeE{bt(!t1*pcq_r2Iq8{LqsEh=)oTB;>A9c7O8C=ROGlzqRj1Qlyy&5M+_A^&+$
zjaad8+CtD_;h#QZ&Ov$-8z^hA*ngY&5=(`AeDLxJ)8C*Z3}J`l-}xRSUkdl}RKc;q
z#FhowB(~zIJGS(EhuT48li61F{Su=zFz>g+YWR9@gYCL02ds5PUFvTrMX=V=^*RRQ
zkuK7kxZ+y+Lb#;IpZJo^vSX}_|Kz~vGK962nt`$A?jdQiYw;20OOWGFt|u?MbDfrM
z+fmvI!d2$$N!zoSMp)|C-Ca~SOOeZ3bX!#e1qTa3gGF%ej~N_LYs~Lm(ACy4yGp6T
znlp{xQjkfmwMs%WT#2Os`T|R#U$>#Q+-WXQ_h1UU)<Rb#*NCSl3j9}*nkSI$MB?}%
z%@Hlk-CzP16IOsW<btW-V*N{(QKEBrv$qU?Y@TKe6-h}dko~Rg@|-Nd;IJ<58`V?_
zFH!2vzkH#jY~A_+5=5~UaRQP}5G#%Mp^$%avvuLi3MY{ybNtQ^pJ&3RJ<)PlwbEdJ
ztGd1pql_Or8A)=noW%IpaJd~}kpZgJI&Q6qi+e<3net#a+~|lfHuDmKodGJ%N@eNh
z>{MR#;uhn0dSgh?Zqr-9beZrD1N)boB6e99*ObMIiH2BYH?p#+p7;F|V=pkMEYzWp
zTY||<;F~qFtN%|Jb)?lYE;+BXJUu^%dEZfRG6tt}K}#r|LWJLopWKzmaeH|cr>kU`
zls=nQEJGKBPnP5pbk6A3TkPEQ>6Nkfo-j1OpQ=>M;?#9$-i;=Kw!Pr%I)@zckhLLR
zBYaI<ts}zB9HcNpk|lHojxG!~3{YCuaVyR?M>MolqtREF|CHpwr|}j!cGS-!byChp
z-9}4GP1C`Ps~XrpPXJw9u?8K0V2*R^x|>P5J;y5pd9SlQ6JpJ-2*uN)8fO$X@R>g3
zI$3=kR%hoA%Kn70mFGCfRwIqo*$^qWc6g@0vF{gr*l#%TZQ`8|q~^WEOn(30?~>N&
z2grqf+`0#q4GG(bH;EylLypr*leX98a8>yz&D$+3A|srIE+pNIVr`WG@#cfrVbRVN
zR^I|L-n4;a1<Z>p>e~DD2d#79w`zr2Mf&F-u`Wi}1mr@0$yIIYhWqe6acAtG&+J8o
zFr|xDg{vOeTn=tpeXVX7o%0dI6Q+!W{eTxvb^JWJIot0NX_HfSJzVm#-Evwsgo4AO
zk>ULKQdIW3Vrfb*0uTBpBYMx(!i}cwMkgDNk@2FD=_0r;;KT@Q$7V2u;j;Nd;t@z*
zT{;aLh_%<=^s0=`fuleXt}6a!?iZjZpU+<%u=7zMtN3t(G1`=BFQONeWtVsi(i4=g
z^6qw(do@KJQ`q7!U8E4v$uu959)Vs15gDfDYRe9)qh*6-w*}XiB`EP|#LVFdz&T7i
zi|<6MW}H`~ZNtKn=5?!9J?BeY9DrLQCfcwS5;s5f@#U?hXch`GoB;nL#n#m#-j@i7
zSgs?C8rl3VhJ8&6YsgOhM(pcN)6q;3CIXTN!!3_|GB*#_LY>OD3744CnoJ!KueA9f
zgxF#fNBRE7Qi=1LSnq?`-X<Wlc#`H1RYCQNJYK#aXT>z=ccIUCf5bf8-f!cGgfT~s
z|3IWnw}$Vxyxq(wKCpCF_^W;|4K2X<Q3bn+_xAe+*`I%u63#jQ0Ll)Dje`neca|2V
zwb?(=PKUoGRHGf`)0gi$$_~f^|7Nyk%wNnGUd^U7!&$yH8`6B3&e2S+!)z;+zJ;Dn
z*2r?|VHVwN+G*s3gIPsR+bueBKZuucFsth`FAjH!{~&iudSev>9c1IB8}E_2{j3pz
z1-lz{bD;k!MjZ6BSQ8wN6w*17l3t!oslG#H_Se9@RhqsDRKbJgrG5|CGuQ4Fj5OwY
zt*uU#p0x_<uK_iyCj;ji&0nrN@>IY;N4$U^LF9-HNW-po6hSypx9os&=!aJFzl+<X
zSBvu)Z%uih78S0W-~A;hznKB5LrS;%@;4Qkxg|Ro!N0a|NEpBJ+%NiUh+7Vh3FGZ%
zLHjq&A5m23K+Ob9$SXhK%AQZMi3zhX;@o=w#ntoWjr0`cu?c<a^7ZYIb-4MH&|vbV
z*K?^lOVZ0XD)Ih1;VCWsgy?K>B4Tb0pBX&jJ7FY`k?7x@JJnF&ooM@}$y2gtA}f<D
zBl1Kum*@avkE~(Oe=>dnpTyk=&#A?RErs?CLlobk8Vcu;rC{NF>c&gt2hoj|GtI71
z{quwQwQ}l!(}fNIp3y<Up96HHd&$%`vxY{65n(@vJ3@oUHF9cb<+8Q&H9Z~p1Zv)!
zv2&^|3A9-&v}S%_{&u8<>|7tsK$uB^|H+#o&dQKoR+Jfpl*+$67A8JIgsu2vKDrVJ
zXG<3PDU~)zwq<2f>Z7^NB&zaan|!CYQd+zd(Rge{mD<SJ-4s(jlb@;>X8RY2w}Hs-
zII2`9Dd0#UJ8Jv4F9WCuBk_71D&V^Z*H+E1#m3Tm)+_n6PivLGh=x=PV+~z1H_^OH
zhEB(j^#b8uRq|t8MLSgF)&qTMM~&l2e3|S&KfpM#|NH>ym%d?w%1|?_J>OVqE3f3m
zekdO!Y1pss?T^yIO=ETVA(i1L4#`SQXYP%zz;ZpmOuys88@b<xp}R`~_Cp%#_96++
zzy2`t%$#NkyYDgBob=}3r5MTD7W?9U;Gw%@SDerOLPV^z4s@gihb<(U3Pk8iht75l
z5?~g&72V{ukqcIqrcZ7Vfj}c*_7<YaPuys9k0P?@ir;kyB3Qd4XUL*ecb|Vu%&zoo
z&-_7IT8&+&V=gs9gp0x6{|H@Es=4`<d?Uf~j7Hn*vBEGNh5gvL8Ba1F?xVw>xJsjp
zopT6S<|KH-vs}qU@|*GYrG%9>DczRfG>R(^A$9u(SKIwuu5p2fU#<6=sKLkC<8`wV
zE<Q_;xLT~KUE$d-my>BlhJ7*2p-&GEt-mWVE6+>th81^&w=kLCs7gqY6ZBl2Gs@<r
zRwfG(-%qJXyqVW1W7N5d$(aJ>Nt@DTV|w<8@kG|QUeIP&{2-j0eKg0YbHZx<4pQFP
z;XoVHw98S0K|ntlRtY{7_M_4ofaO!@@f`^grMS+qdoQ}P{PXUc)`uZk0^0D(n9pj@
z^&ZQ`!;NYbx7py82$xgSk6!wzJQ?!%drv``YSo&<s#|(r1`vdhko?0KsR!nCVcq#5
zmNgobJb_1-aOWtDpsuVxHXe;#-qr0Gij7S-jHQt>HRMGcJvmwcz?v3pNM80=CD2SQ
zk8>byikO<%P2+WeLx0;zd$ix+a`faE7k^qzS-4_uL%agkm41t;Jf*aw1`IrI)6ysV
zi>tXNC@4(qgaLC5+EmG5x??YSzeQfzC0kEA<B>}Xzk!k!N=~$zvb24(?U#MlucvGC
z%LBSh+_^kE2yXrF)Y>PIbA<lUF9m>)x1EC>@}T33Kj;IEr|(DQ<NdkSTwRgW6duGi
z(DJder6@_Jld|>IjJkV6IOSyvu2X!y!+qT=M)RdTsfZ6=reJAkem&QzoD)`C5{Jxo
zZMgKpP9}6j-lSM6XIHh<yt=mGDJzdp*Y4?|{}pj08(4UH{f|)&x@cqA(gudl`<YJM
zT8pru;~C*72>%syJP}Qfc>%?4JTFR+k)HeDBh-$;8JZ@M5B$;Be(c)E)Da$BdFjjZ
zU?Yx*pL23QVyOF|*tf1T5t;92p8Jv`60U}#%bBzxz9`3I%B#+{JNmB~?1ImK!Ad?N
z=xcZmKvzQRhL(D}x=aaJ<mV5<XmwAx;gG%>CCfo7V}7E1I1dzW#P<}8AcZbD_Jq|h
zTUHquzAD~az1ofg^4gf@mq{Ywqu6dYDiaa?=zXPp*a#HQLMj%6G8U<GhCx;i;G%{z
zKX@f`0W!&Oc8B;*@qR^ru^Mcf@~+hQd{@q!3NOwtI9tdu7a>(@6{XKAPt;r#u*<85
zop=g@D#5UDLQ~;%$P@|l{D#YiUnrcO2n#f>Sm*H{{m#GXnTlm$YvNJDy^f~+BP+By
zRt#a2O=h2i@EWJ*mvie>J+*$>q91JLxm;E%B1gYvTwx&5kradw<>jh4<LvYUvGRT4
zg-rs;UI@p#*y_Uzgcuz-{h3d%Kc`#B*8xX2nZ40>*!>ly*u^(0TQ+?N$5Ev}mu1|p
zW%Q93d?KHtEOz%xTPR8EF3>2S_8Y1nWD1AHC%c^x^J<F!C5#9mpUnjHjR3v~iw+r1
zHw8oNFXxS2))#Mq+u@Oy=FlU%#{i-(kYT4jwy!V}I=qJI+ZPRZr8XQ=W{z005<20p
zok5NZ+1KQ_y0He!D(|gk9(jt!PaMd@_tT;vg@uVLU(CU#Po~<W*^#k(OW2#T)*+M(
zckl;UVXr{TS4Mh`(at09f|f7JywAB6kl%od`pdLik1kwOI)9<$$$rLX2K4Le6aYSd
zXSvCIadm8v;!y^>7zPi6(%FU=hr{Ka4m(tPy&DmriU!W(da!P0j<hZAP+c4xrSO-9
zv3SDR(rJyq-+tB}_!N~93XH_Gn{)^Mc*cLwtvX+$Zkkyoq7TfAsy==bqNH%-HCuM@
z2pYMr*YWO<_3raU3g_xO$<#HZHi7U$#2O3vECnS*aQwe-q8gOoOO#tl_Ey5s{)?a#
zub1MZfqIIo`lh~d5?A%4aH?De>>yH?jXL|lEcm9sCLy#-4Kb&;4!Z+XpQKls>WUAF
ziY87*!{hHd;aExK9_f0d+TowqaW!|ztHHuf6Rv7cGu@TlKC($#3q$5{62+iaDmI>9
zbpF+cu&1`UU^Y4<Rg@is{&h|J%>><(+XD{?3a$aIF3tKtZu7tso6C5y5LU5<lbuse
z(LWEXdSO?!d++zN{+nKRkCMgS{Almb@2w6$eN6mx;lAZ!(M6Y0IJ4dKpS`T^YABFg
zh?bmo(riQ+r#?*~l2T#>-s$0KcgLD;S-7n|mL@5~j;mRwsp})bT;5&3><rGr3E%#}
ztIQAXF4du1@B{I27c`iWIhy-WsPZhZF+9L!PavAO7dMM12l}N?kOu7W-<$~q;-UTW
z*2g}F9$wrD(C5WG=oG-K)49UL<oqv#uatA7f`~Gb2D;}ia(zuM1{p8I*|o6O{8;7Q
z<A(f2K>&qr!q9)I1sJ82XCSf-&os7G1t?~gjt>6efY&B6ff?nl#=x^MVi6f3P1^ID
zco6zBF+XleGz=yQB~D-j2_BAOtR|ho!ZK1}Eu?_*Hxacj4qE~7rYAd0^FV^Kuw2|<
zSDcFqIlfjNlsMk?4ulDjX(Whe*ImXnkO4|_&z2E?mUt@m+FUSStv?Iy6NP@BAedSd
zs<ovXLDP8(0qurz@sW0|y29UIhvssU4&m}!3A`DT^YF)Y8U=hlFGQ#khZR<5W-jAL
zzeqk15v!DPcNv|@#w13gSVcubR(1;Iy)UUARwOV<*|^(Zi5`mhEe5Vrtpjb!pjg#P
z#VSd`BlzBoxu_ja3gi#|#P%Hs+YD?&e5%5A=aZR*G8N)-Hq7#&h)&5WBRBP$$!34e
zLBWq;af$FOc9c<>7;N8~4%-<`6v7SXZ>u*Wp|8U0V=$s@ytg+|_>MSY-$6E%+b-Gs
ziJ=!UU)=vXEQP+7A;t9o+otW~`Qhw`*1x;_A48V61}8YcNUj$b@skUy`W~H>ABbm^
z_G}}w+r<ag;Zb+4De6+zbAl+CcRm~zKk+Jd@&|2Qcx%ZkV>eY7w^s)wWM5SCuz^mE
zm^iv$N;yJw;mzkx8Zo<208*RAr6DrC{Mu`g?UE2O4%a2gmCSU?&S@8)+bGBlqn2t2
zQzO}dJ5Oygd<H!LzQ3BDZcwN5A%XVS8O0ZnO)zD}QCwT2WZff3?8Ju4DBQ6;MXcG%
z9Y*;Owce0>b^HWV9GV?&@+=#M{I?AkKeueFg*!WIcqE7W&&*W4trjzNP@?pvdu<Xb
zyOmw2ZAEZuYK)6UY;Oo!fux6Bi9;2(GV=FaR~!e=eS~Tl^E&K;N`ty0k+R}oJyoJi
z;J@g!V*tID*nBHmK<VAAyu`jzz0o=6JCUrk=pR~?snxteDD)%c1NhMzw6>zVQN*ND
z^)u?%_S_6x(S6$3$<-W~;OTm&>aL`n6yJ>|DKqYtU1*=FFYAmh#w?34>&Ww?M07U5
zGGr;|SFXn0pL!?0K#<9eg&b?%+!wxX%sUVv1J}}@HRC4idCz1gA5m{r{rQx%3&@fR
zS*jvwq4fB={jWl2eS;nDF^i6zJV_G6f0l!Gh<E3h;ptpt*@%qS;X6*z`nwX!BQ~E(
zZ{Y0$n{kJ5KaRGBK_i89`u9K;huYOR&UZZ4gpCWC{n`ka8LhM45F#tHYM-?@NJ_O%
zUZhd))tqtMahc6jsB=s^rn=_fWP{q~!xBhC)u8VR0pMY20O4#$G_4(g*AK2YCg;w{
zDO<K+s<5;(WA=x6_wrR-!OY4VNKI9NuoA#<BX0bTVN$9~F2}ca=u>B#MC~?#*E3#P
zIN3r^lIY7T1-Y$O3H@3h^rQT<e0EXrI8l*9+ie14xhkF$G419KX78;knJqAWw4;2y
z&78BeP@|L2z}_qB{2f72l#(_QZQXy|J8|#YZ2<|p#uZWv@@qGCVyPVG%j}O!=D+bj
zT=s~htrE#pZLN6PW!9=XsFyFVnMx*vhc3nd6GxdmxkifzmQ_)O>43yl)luU8Gf>3g
zAq!$ZNFQv34|wj;^3eX#&yBY25)y~N3UU96B7ojtCpAeZ@VonVjCx!;jDHGBP{83k
zy&I<0ADIA<y-0I|B^|PZks1w-KreVWw|b?b%V@*e+ebhy<*d7v=z*mR*E1DePRnj8
z7(U^1j@O5YAcWOk^>?#_pAGG+rxV3+P~|+5NXTa_s=?w*F(V68ySZ#`FiX$v00Q_M
z6zLH-pNh*QJRdlVkPWsNFOfcUTO0GmDh^JB$_^(V_xcWw_zJ6iLyQ0y3eAAz0**9`
z_zr!A`~y1Hg4zM8AD7~(NtfCXIfZpw;bvuhRp<(;u3QUEc`|<(ltD?IHe_l`Kha6x
z@pCNnEKN5N-ygBB9x_TI{=Tw#<Xe}v1ycR&Enz~6$Eb~HSSVCb)R7Ubus(y^u}10d
z(%)IkBOq5nb~$?z<$mM+J&6`<Ybgq4bM|B`b{t-}6}p@m(4#Rt4eVQVv2~0RD1v#d
z-J8w*dlEymQE9Tqw;T&Ltv?a@-$sE3inj@E`3au_inrOj=MP{<$2Y>GZF?|;z2s9*
zbI|{(t3$PIYI(8(ahqKsP;Z0j$DJ;NhS1%#56&5+SnHyPM1o1Fq)*dMWMuk0+|VOD
zWXZ3sjxjnxX6$qC#@yJ8-synWq1?tlTtX{XiZ2Pa;Pc%P1JP_K$YwPrz(NO>v1P!4
zEBYg4ghUg<Xo#wqBlGOHA4b?5S>Ho{eVDqVsk~>x01bvX+?y>rSxNFb0**$47-QD(
zWj4;DS$mV#!v2Qy<|5Qry?YuGd#J+wNQ^NBOEh3ii+@tmOp~F$3I`0pk01PB$NaF}
zTzEImKIBT@K0Xx8k2(4ZSwPYG#s_bDEIfwktt?009rU{Gr->nOnpb%j2b2w|dP1}d
zyv3CdJpqhpb^e%Yv_zl%3J#tV4E600?EHZQxg|4VT}!k%{6+a-O@smsJv$rVX|un^
z4*&3LP76o9<@E-dE8B4LECeF_A2y7as{;Z$(gB-mKC(rx|IQ3X^HNYxVLZ>>e>Xdj
zrwYybd<Bi^zi7r0p>OEvfH2a5cgMETZcDG$YH{wbMPH)@spuaG4y$~3C9M0b<e!TP
zi@069dv$KRNR?nu3YC{e#qhp8!2_;!_#p;4V9?2aC}%^1j*Z-_3PJaEX+ir{o0c(f
zeq9H4<5o2fs+IyF_P)78qsX1KDQDWhdUz4e!;T_PDl49`6!CwSe#g>RoqdvLkctf2
z5*9OI&6CLbmA`qO_*t!ra2V0&9}9=JJGkFeb`Tx-L%wgAwrK^<FD+bD^3$mB!R7JK
zyTO6PjRNVJ)8gx#l};i#0?hU}C6I~fOe!kTI!TDp0Wo(xWl*Dq`vGZ{7q47sb)u+e
ztov-RaCa0ILynn+KBpd?bTZ!_=fu(FCde{J#>nTJuTN`xjG&KOCoB~Y@>n=(^MJjT
zxr7&3XVBS$bRGpTiIMLOngJ->uVT!QirvR$%Y6~8UXUW~xV<9ViS@A-{?cS>U*SP1
zhu%vbO;x%p9{hTiTkq7D4B8z|QWpPcJof<ixW^s>*lF=ekaVCriSg5ZqyEghEGD?<
z989v|{THdzG&_(8ep+v|1A>JYx}L4cBT&ds2;m4+C`EEoPJJbD_)O{fOlh4rzb6<e
zO*lskAjG5V4>K~V1!hs?crkpH7-NS)y*44y1tn21;YId}SQ{j&G=0vSeKJf^^i5(#
z_ReJ>ijWhu{scvn1pCU4I=ZsoBjC>07(o`<%gmMz89Ssc05C>=dqLu<ChRIj4(u`r
zT&L+Sd>J}H?PPPSGeZBlWlp5-+8U{D@rF^%DxbJ5I!UVFgo;+#&+Ltjw1{^obE@4!
z**){TI)hZuVt9e(W<+bymn*x~4CJTw1VncAm0PGLNAv2`@t}=73hgR*pda5tFmgap
zm@h<#o!8>6n#crFY%(sE^a_<6f?0b=Xvzl8ZZK|^7>P%9VF+HV&u9G-3G~>AG(Ek)
zDbS4`8Q(bD$L0}<xx{jSkS??pPqcZyVk3tGShu9%D@KMU$2I3=LV7HMLP{RR)|&py
zuIx?0&?*GQ9n`#vjzzQgvP6Ajd4ECQa1))(k3Un)(+<hPoD)ApLYr>sly$LQm{&{+
zr{re>(yl5iSH-92s}E}<%TZi*>~8iOG6UYCAjvHQ`y!^0Dx6UhhO#4JSJ=+qb&)fP
zF^*W2N55x5OmPG0jZbQ;1dfhKcebOt{Y@>9;OEh_C#bleAG$Fvp#vQo#izHwYrQ-t
zvJmCxdpO*nVdsu)%tl3*w#5s)Jme8P+tb~+XBsoW1QaYj^FbXmh@4Ao@dqV$>PDE+
z6jajw&R-tc@U8KYXd8#Z;gE~-+`Hv0^3psLqi4K`;icB<x>@H~AKL&*IHrB>W=TGN
z*;Dc_n;kKDqmj$@6<Css;D$=AcM^$WwCAPhC%F_rxo1U-9C!A3?~LLL0;qZYFLdle
zfT<u}5WvreuD&`{lFgE~LID*_k5L47I21@Ko9Ua?pQAORe=&0pG`1PP<MR5|r^CWY
zSvGK!qwIvNOMxjXXT=Pvw;sX<f&@jh`GJbZxvMvCp{pQ~JPf?bA@e=eoq6+t>^CHN
z@4?P>b+&AEgbU+HQO@Au8)4e(6kdaXU2FVFv-)0loMa^NtnJ`0S*hT)s@L7@g$(B&
zi@Q4wghgZg%x}@D99hb@`*yEk*y|5eX5_G^Oxq@b9aixAM$hZ3cH-0A8qa}1JwYZY
z&svGRseVRq^f(xtnZ2PR&_5I_fb(fLE2wcGL-6QmqFMN=3AQmnC5WV6NFeTTazw%_
z|Dm8@<HiOdj!W{dS`9*%C&aq@)~)@*TkK|0Z-_6RF(+ZlT$V{?7eTTs`WrprH?swx
zF)F9-_QzpTj3`$$4Sq9^(BQdoMb?{C0G~}}0+KKQ_b3s@?)lGbNKI*`Zuv~}jCg<B
zDL8l;R3K=9NF**c6&rd!gw2OKMlb7j@FDX%?*q{KtWZqOU9b(>!dL-A@A%>@j$2~b
zG_6?1oRi=OpEt{Jb5wu+_rM;Bqq#Ak;EG6sl0A2+-}p3?=6{MVT{<6wCeY68kl~RI
z%L#fVm0*f@=KfoScf$9U{N{7_D>m9yhTcJ}n5Bi)z)t1wz%farv8}1lueS=TgJ`0R
zv$UW8PBMC0L-rf3*5d+Ke|(TKTifpo{+fWV7ny_>Fb8kqck8KBP7fqbaw9;G@sFNx
zRZ9l2{eTa*NaFvPgh?uKhQ|oYhbO_m7X$8nmgEa^Rx<r4A+bBazh2JmBND;gUxHs$
zsK&w1`~2ddItVwlXgCwK)gk3{n#SknY@2vNu?3+_lyWFB#kMa26E4C&&*Iv<!4<V8
zk)a6W_dvE%<A84!m<CS2*U5tS@geB*7f&!pGb0K(%Zf<(#s)MZbjyms^&kY(MnVpb
zX8+#TVYhdJ)$~>COnM1~bM_u;7}-}yeRbP8l-cU#>GU0`($|OX9C0bt%3~K!b!H+|
zDL=AsChtjKe>OgQrnosVKg9MSjMqByUfi5VvS^IwBdB`@6EuR`E!;~<U*v!mTf<uy
zsuTxvBtt6a4t#>L@TTEw`40<%H5j8AJOoLCdEcQ-lJ)#$ac?DN9G<2OA_E#B_%Knc
zimppBk}}WwGN#W9w}$`zHK$7T7ll!H)Kh?2xN;7zAL@Agsezs17rXSptX9Uju?IZW
zKDpF<7ZqG;u^e;U@IO)6)u);^YLK4H$01hGF4Z?4xD$^iM7&rwaU*MorMyB=Rkl4t
z_r_}TU8Cx~*5z(wzp-Nhs03;6iPr??FpAW`Cn)$7e15%m2?#FgE&D>MqN-PzTiID)
z=YcT*JpnVA6v=1lcoUeJuA={dbK8*Rv@~=}<Q$FoB5kod--_Ej&^%Kaa?0|9F3lMu
zH)Rtrn8P?Yz&KWVMD6&%uS=-|TF40*w%4QcSs9bel?*%)WEGG?IS1@SVY78RR{BR7
zlHT~`2Am~PjcB<g=W`X|zbia4ASqlked*a_UvjO`>aXhX%LbtkvlkP#UZvE?g**zy
zvAa*@<?qGQvAV?ta;red1${Lj4KDaJg{B5hDhbGu4=l^!M-l%zP8kq}6`f;T`evW~
zpNq;roOH?VOw@xPAip!B10Co|8q_1n!Flg7_pNK4&ZwQS<YM78d=wNK`4N^@b_??{
z`L5nne3fD72+Y8SfjUwP^ZcDVRmj!erbi9S@RZ$;wm*V1av%dGl;~>`$Cc6dO;@z_
zZBeP)J-g5eW+G<GTEUsb9I{U67vQ4MC*BD-g_i(4{+)&5Uu<qY6#iU08v}aOBaA){
zUxe$t;W9{r=BFx6l1W+<Yo;m_UOlGmzZVP-=TcGT!24UH$tgHY4-^4}$`~~@A_1Rg
z8TXE>M9fzAh*i9}>$oGPw;-DmgWY}5VAP3^@6dRw#xy+P#|s!ue^v{y#cGx0M3}sg
znLutqK#n+}rpENrkCrYvEG=Iv73j^G7Pp@btZ7PgngL9uSigElzSpoEp|54i1u&MH
zsZ5AGLnY&Vx4>${UM9%r*v?|4=f6J^fm<%?HD7?xIrzu9<7Ho*%68m+B06l1vK?ZG
z#GI!hKP?4#eHr0-R{^<W{#WnbO2F)!{*Tw>M-`TxgcMhjT)Fx#-E_Sri3b>thJhkQ
zeQiT1!+zzEKhTTx$Q>x=iwlH@XWE#wSyoavggflW{5uYUVLvhu#Kg7B{uH>;S3z|p
zTrzQf{q?7u{39r!#H=$*zlMeQS796T4wF`gaf6(|TFAxpaJ3iiQN(YmRnz*<JQQp=
z20rHEY1Es++b(V`6fi*|H2S$UH>Fh|8&aTz_6LF$Wh5j%@k1)Yw<kfZj99K>;#^+%
zd}twI>Qv8!nI)Y#5$(ejy@m~Oq&mfmgSsd98w^~|m(>@Z{D#(J(mE*wPs&KdOhqQ7
zB(*dQ%l@UnixCrzBtH&$F!dBxwF+H-%J^0%4#Z-r^)O@mGr`BaLBcs0o>7(kS$4-%
zj9x`ihR|4tsBz?i1F7IQ-DgX}YdDpOBqh=UkB&nGF2=Ah8@VvDUn*-qd16n&<KR_^
zBRez9LT3_t%y*oMcm5nR`Rh|G=f#Shu`P>yXN(D)9+9j&aPy{$wMAPtlYxFOzS#Uv
z=19_BY#qFO0aC}0dFPkV{ikyj>Gjn!AbA_riHT~S6JQmxzOS1N*<Nte9*>NqZLiKR
zv5()0$@yFVfQu}->`w3lIUXT=+J@Ghv<>m-!Bxkcxk@r;$w2|`H_nTz*XK19a{Tv_
zqdB5>kWuMOeKqMF;8_Y+ec@Z^A&~j&@%P7>DA80|2GQ$V=$C08oRYP^v`4daPIC+^
z0gB5UkNr?1Hve;y2nXSwD7XQc)LP4|eJQW0)lrY3QlrEi?bn;ZGzP5P_#KD)%hu@H
zdZAgfy=mX1l6F_<N>&UeHu+lXU`vr^o~R}GvUmtZ6($Mcr2fP_f;>(28Asx8B6+iB
zr=4K{rfj#ob?5;)j?W1P%DT0Ikti+59Ngn`2IlyB<vE#24}hz2uo6}{X9=)tH2;u0
zS+O^$E9qocDw>tzqe=4!fGb9<Y$JO$9gqz%QrHpg$v#7@%<s<JzeNlQRyz@GHee`R
zBxA4d>j@Ve+q=M=e+;SyDNQ#Ma6lmk?Zr5l=U-gQUhA<Mv*~r<R0j~Gn<K>Rg{R_N
zs4lhd5mC)Kd6;Vv)#=1}PPC}RUS77U())(_9<8)^ZbsBqHfYlOgg3hx(}P&Q1uu`y
zu+ay}oOUz5-+Y+FX`Kzb6;g*unAM03O1%b>J`F&B>{HE`dmM|apIsEdcj5iU-Iy&s
z|DJ`{0}p<-5WeTiJqy>Kz_WzMzdE6C$?~421jxnmfLi`>W)Nksd{hbI-}eQ7hpD!t
z`Ec`H!;cim4Hm4q=j}1-%nK?#tVO2Tyn_5Tu3?1aSM_2hYRLLYohEx^#1RJtBW7k{
z>;tm@7e6!NAa<(caaKX3EWV?7xOL`cvmam&sjOyly$_`xl|9PisE|%a2cM#OF6=FB
z00OM>{GgW_ek4(G^8OPLQ3rjx3R`8eq_buVrJXUENNq1(Fy4~$S@uv71EeBqvQ5a6
zkw(5aq^>fG3Bln5q{>*<4<vEtp8<1e3*`9NyvAY{^fl0r@wL0dwrtzi=t`#`t1Su<
z)IgR8*-sH05Jo+gnH{EHpP{XSQ4K4buz0gcR)ANCSxV!U@?g~-cXd>b2XYCEO48<V
z9OG;h?c$qR5^j^<0G#VBlVbVH3dSydK#dFc;}&XKLA-@uX0Mo%?zt7-g5NGAm>+5M
z(s__nu$o(*+jz8PKMmfBiXw?~)JZ<y`t1e6lEA(2xFx{=X>5;L%8Bp^pvK<a=}GeW
z!z9X|e)bzQG5aMt>-W-ophn)Ew-F|A6GG6xi(7eg$RF+h$QBHQ&&$Bf8ax%%iMHWD
zy5gZEW9Qrm->aT+vV3FNM@&PaYaKcO433YeW(ET1$6R&{RoR;E9ou1wY1pKG-Ww;-
zMmm9aEd^;UPLR;MVXPmXZ%Bw7)WMu(;M>|fIH})L*qcEqYoRQ1z-E?poS=MP8_ROC
z^1?suEqigOjBH<e{6$ez4aR*Q&@TC>2CK>QcTj3^w$}DAukuQ3-v@^vMb=}7uN1v|
z*I7F9%O0~ce*?2+h{YdHl_4_zfm%@hN((vY$Q03BB<Yy=U&YlgkgtP%7Y7D)(x=f?
zd9nd;DbLuww##QbEBoI0rTex~<25?`3q^F{Ii_gI0!lE`)ms6(mp{%KsrE@MV<$u)
z)?r>52LHMguQXA^c%`GL;3eCBBHDop1ZSiEZM0s=>yF*Oi*({vE+JS_GG4$+R)euC
zAq+KiM6Ls<C<=_y8qoak@Uq>8JKkvS<y8Y)^?$vYHp2s(JCrqoq862KM{4l@;LjO>
zna7xi;>`rK4l99ap;C0unLT|q0g4sC^~k-)x?H2K#QILgsAu2@*)DG~@G<=b`?TOY
zU9BGBAz3fMG9SUh**|(^sF?L=Jjm}@UXr<qvtAwuL~E7PK{IZLzXYQ!C5|VN7byz@
zT93N=j&6Ij5z;<p=67m_2=yQ!(JHdcPwqIzaMj9)`C5m~nTRERBZFzA1+{|)G@5l)
zzDpVAxVYj-AT&}!IYg7zwi=KE(I(u41N4i)YVylTMLYlA-??eMX{LbKWU2ohTf+=w
z3W1ORv0gRE(<&UmvCCjrbN>~)&7M}v<mOY(V*K&<hH<b;t?dJmt?;FovM%;Hsa7Sd
zrrabE%7tEpI0!l+!KJ4u;S&U1^)xa>{~_}*_btpZ89L>+H=7j#@>jGBQ+%TzwrN~p
zAr39&h)F#t+<6^IGVu#DCu&^1WJ|=j(Za_9Y~m<S5$%}*lHQu1Hi9-b8%F;iIAPMo
zVWAk1vAP_a^HQg1W8t#<6foWWzHHHV=2UqayyG#yq!9^!PaE}|rWhw0u=`}|F&wRY
zNk;!5yFBBN)(wgqN^Bm2C+%aJuhCaaE7hVX8%s$hW}SuejBn3f)oLENGy=4u5NZbM
z7ZIAPRh<pB62(<9oDUsy?xh!BO?GMG#-?R1c@HUyag)IL#=90NRAa~;+=f+r1Ed*Y
zTaK)OF_?e#jXDrukX}P}NGo=l-MrJXlfF6%%CDh6kn!B&A<1*vw47wD^AGaQ?eG@T
zFl^w2vVj;i4jzG>MTC}WER2EQ|IB+^`#DX6&aep#tpA;1Wzc%J{|#p(`l72Cj*+O1
z%l;5-%k>Mo7A!7VQ~0^{B<80_KcdU1T&SnkLo*w49r|MyV6A2(*;e8ke~9zE5QJVb
zx>nI*=oswpq&c$Pt7=XuT?)0F9P5BTPGw~^kRgfPTLR!2muj6F`A1Mdvo?h_a^(GT
zK1Ne<%gHMwH~5z1im*sS+{alPEyK@fRk4O(itFAYkRbEJyqoOzD3nxS8x6ffjkowZ
zf7CBve*oH<FNg(yq#|%2VeTE3+uAHjjlHUu<G?vr)cM_1Wz)Gw5n#W<kJqf7BwO1j
za{g(MCyrpl)bfx>OtBCGgYX?sZC6yak>U*cT`Ilc$vnpxvrJF0--bZ*b@@s<Iszg&
zCwM!%x5#)wg)1R5HE?CKlM8<A7vy@HmNQG>8d_+7q&jxZzi(FP(PU-;N*BoL+!Sgj
z{Sp~@oN<v^0cid82sHWu<VSE;2a`b<^xS<7`!o+%t?mWltcs#ya$wDh?zZ%(vsqu)
za%-5B+K7R5^ySt5Aj$yM*9C-gi5|&-mV$_k1G%cQA-ja<{T-_>#R=fR(!nJ&`#xFa
z_wT+1($v5Y`NCMF=0_HdqnG64G=wN@9~->O{X>smQ9(biV0|KaURE7?>#OufZWN7u
z0=fyE5DM4hw%}IFPiJtZ{B{B9Z?5>BVBb*&9N87s5+U{T)SMC!-&&a8`jr2g{|RBb
zDfiIFD21p~u^<7aKsW~6+k|@D5mdo-<D1<<J-2gY$)~yM2TfrhEP^hw0n!Rx7r(+E
zL(y)tcN}VOL&u88$J8GZ|5Cd6(kBG!D2f$MY4}ZtrzNMv?bO--{v(;m^MuYr?MeU6
z$VQ2I;^)${jAC!|c1S4UOPLzjtdP1wdFE=}hwW`vPnsN9qmU{TusT%59pV)87vah!
zdFyq+{-?{9t^B=_n2&h(ZPs<Q2$@(2%tXKKRTjwf={nOo?$7@H<&n>!veHwj04Rk+
zeBhkh#Lh-tl4lWl7Ao-Rlf(J1nQ5rXK8LD-gWBt-ifauQ;s6P%!5A~_wjc2BQR$a_
zaa}L1EUb~!W^u2v_Z&{U)0uq>PZAc^5ks0-{z&x=WZh>x!(F5QR?tq~U8;OC^TgK|
zTrS{YEzxAEZixP(ktxAjj9z%AckT&soJER~O<=j-AQS2}V`__8Du2vV_->%{TITX_
z#r^%dxMM9N5atz0UrVq-xX$?E?y;eu8W-1<+2{|j+vrdG@dMeF?IGVqPwgSbuDQ-n
z2)O-YshltH*nY8V5~u-T;t{avW;eaq=e9A=NOWZ}Rd4jY=S2+!FI%k1d`Lij0c=#D
z6QB!z_8=>+;k5q^MSPz^2-9`&f?^exH+M9Ij`}lxP>NIlDgr6xCqgmQW`2p@AS)w-
zqc%#!z;-BO8eh&!%|<we))%;;q;1u`fU^D3cwlYZD`4bEgj}9Gfs26m`5yY+-bk0=
zO(FKQ=0vJCnct1H8aij{t`I8(5x?|T%Umi}R<%v=6pelEpdnj`<h8X6V^!XoOoQb{
zCB`$yf!NyG78ppd<xW|Rb@~;VTx$<Y^$UC*^@s0O%v_?aZ~5QE27&S6?@$vH!sL0f
z0{?IXJxy)qT7*^e2t`on%@CkGGd<IyB{oY%Z#U(c6Gni&q6^lAzhHx~9hXSM3u^;~
z`YnGfmllTD{S}Vt1RyE25UNy(i_DwX%XL$7cmyz&5LqnXm6_jB=h@GkC?O{FC;QlL
zMy;)_feyRI{LMVYy|@cNOIZ=MSMir}D$`0G_#)OvBYarolZkbtI*q`p6o93?z^YjU
z2~!yN>KQL+h1t$1P5EFAp1-vy*~S<Sgs=@DP@41A1+eK5U&O!C1wGeur6Nz7n2ej&
zeW>lV0^&=EY#=&3z=<qS8ZNgS{%hL~IJjy{hD+v--jCeO;TlLms8cPYK0RG}Mg7xj
zRply*-cp*(!%CKKxuzOMNIipY7U^74C0Jk7a1mcF$KbYX53se<BC)xB;Y1iocd~kS
z{>j;@aL|^ut4v+KLuj<2x?6m@Y4(A&m}2QyFjLMeZ1z!nq31vjZA{`>jLLGp`OoCB
zP?bK4{8F!16d8{tedb&dS1Q3|(m3wS;f;2?3Q9kNdU<Lpj~zDEd3gE05tquDU*HIl
z`i}75PqKuF99WqC>5e`@i@2Z(mM6WTdZ<~&#?0+jXy&D=$0z;Mm6#%}1(;GJo4PhM
z>|&@@MQASin9QE)IjhR2T(FI?-QfZnPSzginqxl@@A4?zbwOHG`1J2=-b`2ut;GWW
ztsNfi-=FLWly)N(P@ie$^9sTkG?=B#|5zi{5pFW1xwMquBE*qN9xBKIomY*SlH+h*
zafg+n9zsw<N!L}Gp*vFELopr0kKSr8F87z3%SwhTrK|@OL5of{HX_V_`A$Q{10J7<
zi~<`@Jd)DEeA$Xy<7M`XUaCf;3f2HGQxsI)_6D}ZnLoj`=Fq`E6Q-s}81NRxP7Nq^
z<wZ6R`CgAanIcVBp-scGXUGE^$K0M2oHMm;hAKAQKXM4au~?Pvh}#x@YUMx8_@Nyc
z{`zmszoS3(_w7KEU=UeA{NS_)__$}9D<9_ou?)*Pya%0yhhNnh<LJ3vJU}5Vs;aHL
zukn+<>nC`ahx;%Ei*d3<#J5`GzH_Cjv~>Z7SYWN&;l1^N3@dQN>|?Rg_cw%x3x$2{
zHYuEs@HZuG4kM_NfocNuDYTO4WVrLaEQnXn-|>KQPW56b5n*2x!qF9?0JXfhr6_eq
z^mdRI`u+x~s7ud^afCh6J;JL4H*y)thsm<JuAh%$5iC+(;G+b{GlsY$)z77FC~DZ_
z$*>VtE?~#;gBFJCHyrBX;(&e0pVI75b<#Y&rz~uevT~SR7EJ{kLLngFOqo`C_uK5@
zqmM2OKOBw=aTm<0WyKd)Ro#lpT}|~-YHQ1R)%G%mA|Ur8AXH8%zLpwz$=&PuxPECu
z5Ly8)ne7S0Pgif!kFB`3YfJ^LRm)cl3^mUagL_Eu4KeO<v2u%LBsGw!_(-4I06=8g
z&Mn<UTe6Acv8>ibWCUITvxm`+IFauTN96<m@o&m6Nq-G#hy_-cmL2<|XSLzJo8$)_
zLLMFEZ)9SiL*25`6;HQDK+^$}p0KD=Pak*?r^(xm{1zGwLm0wR$L5W3(ukwrR#Uu@
zv4~z7spxo4jY(o>;C7;|C270707R+6_8g}bwvs$ZjOSmU6GVPV4Cvt#!|GP|Jx4~6
zEHfFIh}gWLUfaT?h{xmRP7Aoy8bbZeAu<r?suDCXrQysWHu%gNZlrk%_z8tP-QPZg
z@jg~`a+nXyV_rOQ4C+s+Ra=Z(9WO36{3?VZng(i;u@RvAoKI;QKn3K3I`a59fXggr
zV>S#lh}A=>lIt(?8^Y`|EV@w9`5r{be?!vF_@|92Wpg;;(Zufg33$>YHi>4hwYxEh
z>_Z?Bq<Hx<h`88(<H^YNaE?Y`XD5jz9LR7Se=c>g5b!}xAs~nUh>q`#e=rc~u*eAx
zlCXrZl5tO#YJg4;nJ3lxt<XpJeYPj#Ct_6~{476`xyd6n+Z|#%#Y6r7+AuGJ=Vxm&
zt-Akw4na(&@&5~t{-{d%w720_y!#$FMelbnLG^=i)r;w0sIQJs2ja+ji-eO7c>myn
zSdIC<A)l$qr_L}*f#n>8DFwHH%XfmPq(2cZf4iRiO`;)7N`=S>x`##q!4XU6PciA9
zS}Wmfk5Ydcv=l2vtK@t8YR{|e$%F(Ydhq3dTxpo+04ltHE`f_`rTu+bs;M-VuVNvi
z;S1~54mhZTluyy+juib;fnEzoz%M`&RB!7h?4iO%sSV#Z<cfM|oH4}ApzJZ$r-kvS
z1<)%Gs+W*wac?Md_iRxq(Zp^Y&zTq49FeI{8J~DXtqyc4(rLfm#b-gA&AAfIl2~Hp
z3@@0+TM%pZBHM_e)S#Ef?V3&d<H-GmCZETtS(DPC%N(5>Ll8O<1KC>IfpJ`+C0%bj
zthFiwo6X(mMmpVON8U!z-WtwF!S~xDvLV3Q-CLjL<aL}-({+Dw`xp0P4G5iF=6;%k
zBT*jmd2Zoc7cFF}RO@f*msj?p%eiQAZCQ01%+JpKRJiHcddUYd1qi}KXmsXkK5+iz
z=Uw)M{N*N2_h(FpjtdHG`+YTl?e?zn_E1ipRsj8MCPM>w%nUUh>Ap24UB9z^e}NxD
zPi>A&t#8^WGNiZ?WsI=@lYn|%-q1}N5a0$j*z>E8Dmi#mG5b-0(qb;}Z<^xw&#I@V
z&D?MXY8Tgo<5sR@f83hc&;j2IoBdGNNqmFt(O}DDq7%_RCOF1C&nu+=L)1A3SMt2!
zKDO<g*xJ~(vEjxxHnwfswr$(CHXCbW-t+xc-FyF;s_s5BXKHF{y8C_K=krif4)u?P
z>~`-w7C+Ut<$9`uAU%6U1$}@)X{qnIe%ybJK?w^bszRbFWso~ZzwPfPC-H2tb|zGX
zB3`*2eOwftSskNI4dZUtKgVyQOlpJ4r3DWw5%Xm^shGdt2@bLQQpqEPN?5LcxAo=K
z%Tg3jEkoCoW-o6LIt9O~v?me57VKZ*x{8ZrmFG%`5@2Vfaas0xmS?YH#)=t_2TQVx
z2Il~}Up^J7F;<o=Y}Cf&j94^L5n{;;l++{(NxtC!d2}(A;qbbWH|!HcK%M$1R&QX#
zQx_;M`%TuK!U5BAH6}EXz;6=jO_}&<668JoPa%W?UYd#sO@v3-!0>mXl)Ax`<AK80
zcYQ6RwNqkzYBzg<#`(|kPqI$kkkb=tR=S@}*0_2p@q^dAg+L>)<P6uqq)&3mILoS1
z!7G4l+Jq-qj&JWACBs?}7pEP>?H^uu5-{Gt=vS%v^o8)>oTdT+3i5}Zxtoh8gzn+#
z44N(^BAvoYNvjx|)3sNiQ>?)X8lS#sY-K?#Xy7JiLPjER@|EYOEc+?KIIxusI2@S%
z*o7xAJT`ylHfgWxGdRs~Pgbwq%>g<1f#y0|*%pN`_-rr%&+-^J`6vk^KQ*R(gum{;
z-$tm$E2Iewm;G(&blBLFm~#MSPYz|sU=3>_h60=6LCo5xOFv(w$SN?g&UQaBMq2U7
zVoe~>v5V(#stzNw;$eVB%R>S$2)v)Rwe1t=AA+on6y?p>X(E@)l;`-Rogus=zoN-c
zcTz<J8+uDDHi3L5S)jjlfJWp%%)9>OLhoyMek%XZf3jK;5XpKVTFP=cQMQ~yWJk4t
zNGCxIzQHaPFBFO3@gQ~#WP*UBAquN|=<oaO;SEL>FO-hKIu+&%1fd&=`uLVSl_)Op
z*?ugqq0@^^6l_iAGyDOwRou-VeCqH#7Va>Av--Q5o%&M|d?ErSZ`e8JnH+z)EdEF@
z0C5P*Orqs#CE-%`>WN4qEQZ7zvY(~VA=b4IydjFnb&6~k|0xInsX|CxuP{i)(54KW
zu9>Z$h}6Km-O38=ZCke%)5=54+P~5RJv$Xu^l7juth}IE3YV$+=RGU14jTyi6m+J$
z%xeMhTSxFT<uB!|Yl2T8WD5N}cdbFXWU~<2_;Mu@KLY^Xq+ZKqVR=_4M7!;Z4dE(g
zfd8H0$^P!?Ft_w`Z`@BL=r90YM0VE@-v_<(Qlw9Bj$k#lRR>bLFlq-d+=%=~7Dx(V
zs`{etDkO;fPw6Hu2CUo8{c~hWs<RIkj6zu5`UjcsMj2n`zA!dq)?;5RRzf})6kIiC
zyz(=48$E&Hblr6vGRa+tRAVhBs)xk+jk=l~&KkvsA_G?5;*-#=3su7vT$_~+>A*T5
z1;-#+FTkA7;S+>lD|&A&$zEmOqaTqxWP*N)`;}F1-D)jcxI`UG0E!a=O~WxL(ZIC%
zeF_rUm(R&v$yX;LQnSit(-;)%V8QnG3d)y3vaN5i(S9)52jHrkEg9JUMbP?dmA{+L
zrmY^Pf*Tw$O-y=pf#I%R8$gJH1H<!u=7{<h>mw5DP+Iv$-RIYTe1e3iz*Yo(Ar@ea
zL##qbYi6Uc8DaJS$SH3|@0e6#g-7l*j5N39qEh+Efs8$;*F7`?9Ny1Pmdaium;u`@
z)B%D1r6mys;oC({)d5lJ;4T=*OY6ldNR_!g!DuPA?%Bzj+q2|sM@%*87@HKY#zdb`
zG_o`##<d_k(cJN$W6%(={IPeL5@qyTkYl=7`gbDZFIO>4Q=CYa?@JqgS!QU@dw;Od
zGP#%J_!5wj;xn`kxnJ`JR1;<gTaMQ{tIh#JHbIvq9hKSq&$CpYC)E)pj4|g_o(%R;
z?sNu%tTK8>i_~)Qo-8dH(6N8fK<5d(!{O-M{ROxq|0ICL5L?6FCrTGckw8Ttz5aT`
zkxF148821>M+tzKdR#}2l@Y2N$<4C_l{5d63Wkgn_KwzNlhW?zJ&bE6e~KknhVY#B
z!({MZME4VehY|Zg9V#$&M5wRDaNus}f#))c-%nKz<B+>C`gf@Szb<i^5N;9%n%o?3
zF3{NX2=g;rI`Afv^1!Z92$=yS>DJuO!luO}qGk8b@WWF_3OBJvt%^~xxo=+jZm(1(
zc(en!-JTVjt1ad@<TM$F^aElA8%}DGX0IZ>J)wvw=M9<2mXjjbm`ho4H6+f*itRv8
zCN&e^ToVKa<Glo^d@n*0ClF~R_Mdt!wU&t)SXRXSiq1xc$dyq}zkl7>wFSG6^EFem
zu~S4;6WtMc=S$u{d?$;eFrUGIeC0znxscG0HpVP`BM1q{JlW*ibblAuuGQJ>{lG47
z^`~vC1wtk!&i9Yha;zO1npW&V^CX=u0%ibt{p^A?4ASSLR{?5w!CV!2zn!;3+w~67
z`1tC_<~e9rZBaq*wtGYsxzN&rv;i+d_v9Jqtc6->qJQy9KuFpz&|6<>XHJ(Ua+C>H
zIU;ey+E9s9BI~FCIka$chG=7Agz+I`3%wfe4;y<GGm5}MT-%g|P*8UA0KD0NlKDRJ
zn49$_0ZuyNKJ8Tr5r+Ha$kgg)`Cmy8W?bM{_prPh4iXndcV<*5qP>jzq?L8(aR?OE
zCMSPZ_DStDNDHgb)3J}^n=ZVG&8B7+%RaRuC`OQQ=@EHN@M!K5Pc3-LQbM&_#O1o?
z`CIwP1JKW3lMGNwZP2fu?peS7qa^(&LeTkf*RbwqyykK(8JO;fZxF4F{Q$DW5sdyN
zoKlR=yA|iQ!F|<hWopx3?m<`pKu0bn&spDyowv+D1-bZM9ki7H2?>$o@Bt(1f_V}Y
z6W?23{3qe=D$pfvCj=3w&lKzPjKT6pabf_0Rn%rav7%^y2>>{pFe;^gPRYPGZ&~xO
z_GV#>C2xDj&{?{+NZ}3y!@~hH;6mYnSmh9wy>d?+9p^65fw?}06e!D6-o>e-l}2P5
z^?yx)1=%{{zqh|*1pXmN^0hqGK|vTcBfkbZ_?>d08KW0YGal1Rc9~g+wYuqlk4nkp
zu264q#MsgX<}sB&cS%fg8AO<E%Wby8o0qz=-k->5MmtHMlA+aN<s+kbLx!awkWdMG
z--+`>XZZQ=GdZUjF9}hX2cB8fKl(xk4&9EV2sxm5D`Q}ZR;T<Gwxij!3XHoQlL1nO
zFC6;;2tjUV5IE>y?@a0uU#BBn+ztM5D0)z@OMU(c(G1!K@oUL2fYAZm18MP!-5bLP
z-WK&S4q(UXmq{U;vDTkPM=_a(PZq+(02Igbg+T{2X$kjCx`Hho3wVf*KPAU(FjFQP
zJf+6kD4EfNd{30F34kf`R^o^7F+48>Nd=zb2Vd(3{Vwui+hhdpSIP8s{)M)4gm_B|
zV_9Q#lHT1$*R~*6zifJ!J}0Dg%{k$`{Fbi|Za~QV+Q46E2skK~RCs3=iEV-Ccj5i`
zHmxxyXVd^6^BW%?8I#PEGVj=C$RC80PC%xdiE}zkpx-!^ixW)9zqwB%b%NP=y?dxq
z%0k8*!oYRITGWfnt3t+>xnpi2^Dw}ZWN#_HCz(R~yS)WI-nqBJ7_R9J2qEU+*cD*l
z-~tnC@~0e6;*J#Olf*6aRy=GI3L3hthxd&U7NNKZ-j~<&xx#L8op=sP4z5L(PB(49
z-j~jP297SY=Gi#d^{THgkYPa%CGuZZWxL~h#3(6F?AK&3$RB0}z2VZk1X#1tsk9P^
z5wpK&T&X6>;4+9V8bhjJMosm_18b<eKsSNbgCaD9tP+Zu=y2h^n@}I^M;4M@T2QBZ
ze?6Azs@-L%<bC6ZMMn3i(O;0d8EBl+Bp_#_FazO+AHi#+tAlh|y*L!>SoV9`B==Rl
z9)g^|pbJMJSP?Y#sX-^5JG7Ucm-0U<q-_$6S%-WC`ZXHr+Sp{67p$e3RXMcn`6+d3
zZ^DH(<fRL9+&$f*_}$4$P6o2>E^phlpJ_lxoVoLXM=cJc61bKo%MjEmeIsNDH1idh
z>XT(NDe~kg?9C@3kOf50zyXvGnD-a5R!jKpPytG@9BE!gG0a79Se4Xq2#cnym^3J2
z7FUcQm1Bxq8vLeUa!Xb^6D}G?%rYVvzFDxuXuEs32`9N*@pGnvI9XSLbEPq1{O}3$
zJBr(zN1y*IzAq7vD)}!&f2|0=x$(<?02+!V)Pzf%5Rk55d_S}v@P~dBl6m$LRp#Nx
zBX5Isrhb$I>OR+<WPMhHy`$GDOXrASYTNHbI0_8uLb>zhlwab7AfrrH<g&b53;Go|
zVBFMW%h_P9-+zznKIVu7L%qL^+>~h_+L^HAL7dyt4&eQLjU%Vc!A%U-8)w1JQP}|y
z%+Ftk1t2H65eXn%l~}E(=?ib}#KfSpNw+YGjK$0!ID?e+k_`F`F*mKLfBUV}Tp!>a
z*-Ne?ZAr9l<)#mx83mr}@iwqqA;X{B=FtEG3F4Fsufv-MtHgRP=|d3F#BqbrfW+u$
z30#Wp53A)&khBUNMJfhTyjlTr#hPubc!mV=LmY(!gw~Q$I5kjMbfLph%vYZefrNjq
zl~#zWA(eZBmR`nDAJiAD4^Rd*m7gK7V>jz%Nrr>Uy!X!>(Yb>fALvLgH5D1KVON?z
zzWb7OBM^syftE7>vdQ-dk|fnninv+$d^HN!g7xep0_2Ps37d0DGKu61d^bvLFncen
zAR!4toQRUl&2Lz5Pw@#4F~~0Hw=uX*|K15YFuyAiW07W@D|ut)qny-)c=Y!-*~t)p
z?JkrI6c;TH%z$i(KqY3|ptFCN%^@JRUAp98%}G_^i0co|^kG2{cH-0&LcDPyY8mhW
zZ~{>PKdne83WF`i>JqUvCPn||@~hICrDg{GygVVl?_aS}%XpUSMJ<~wwm2DZDF>6j
zGWFwLtD<Em`H1U>qMr4|<!I#hyLqbpo2L0yT$>VCy@)=8)QVQ@D^}XVD!Qwv?iztw
ze3s_*KM;La%b&+WHIo5Yic?^uuk{?G-TY4;iUxrQi)>Qf9;=Zt@{aBetrI9<P5ce%
zYPgPJMYVJ<=FJ`n5bJO4zfi$!lIo-aYWs`oVVSE;Rb%KtTlym6nM^gDO@v_vwN<cC
z-|R2L1v$fe6QDH5Mqtne1>20+w9eUac6jvY^)+&u<0kGTOD7KVOwHfnPP>#vpcV;S
z_5Fu4{HRKJ^g+F^^k|m?t;FMuojjpU)Bk4L^8K*>WAWD6c2F&xNYsOp$IOF`CaVJ<
zh{KO268$qY?`Qz7<p_IdjXkW0(gL33l+j2<`%51(xh*}@&@8G<iD)iB#?xJq)<RS1
z-Eqq2re8K|8U{)vzng}-d```CIS>a*{0TbqOUP6#0w#0j!zk0f)Og2+zbK=Kn`t((
zH@(*m=B8Uej7XAgThbe57#@#k**7>25)s*|Ym+w7>B&3jXXDuHAlNhLq1kl}I+@*H
zSX?v1nS*2&Jqtkhp~8uwM=vehIRK-ASm+0vIm=<9>bNQjLV@j5Oi)K8^wQ9s_xM4n
zdmmqg{o)sSH0snoP1{hHsW3}0DfV!Ydf{VloJb)d$1ogzV@R6lFn=({jFwimB77kc
zMu`-PoX76d|D(~BP|+rS;d^C&6u47ipp1f&7EaaHq-9WakTEKGN^Q~RKC{3r!HVij
zhhpIHlZ%L^Cm*ERct$x)vT6tX7Tp{jsf2^LSH4M<NF;{TLx`B<%yr%Dp_MP@rGPhL
za`#k4er9{dI4kE1&y8YK<9k)UlPEY8A4HAAlA3fIwIo-yQU}z<hhqf%&4`*Bx!`yE
z)R)`)=v0meENr7_osT}f0-47yQsnjc@f?cw;|cpR3N(<V2oX}KZa1u3#1KN|BtEP@
zx-HjBOnjCqrIhd61EUs@Kj1eUNC7=~@)ZS=Sq$Eoq#YyxWr0-<<YOG)Hn7j&@zSwz
zrB8=G`ln9vI{2Rs=<Ql_m*9h5qUR@32RbNZWUw|5J11U0qcjI_2SpI0anSS}gi%0u
zWsrUpDS;OCB6gx8@)$rNHoE=0!`Mds7ArFLb}@3Hs60~#yv7T-eL9*bXKZJP_Ga|*
zkbgw%Jd+EWzHBJD5avHG->wjTJqiMgHjkJQL>35Rj6VL$c!wtCg{C(PpK~@US?R5X
zS*II?7yV5QK{kIg=0a_<2Sb10vC#|o)C}rSXNq8bCp=Jx2oSMwzPH}V)tH005$hfl
z^Wvq#3y0FE7qOs3p<cB6nNRQStvR|-7%CO$PpW73gS!C|+u~7Heg8rX@5q$Wm3Aus
zqS7^to+z=G<<s5jS<ystU5TM*!58kwDa5x}?T@5;XlkQWb<4EaPsc|&2eIQy78)@S
z2O}Gdv-`#SqvwKICul)<f<2>GnC=8A0loq;&@XLwTs9$a$1Ay8>ES4aWxJxmo-yMn
zOu4GJcgr028CW`;D|6iO0=o4F{7he`aH>>{udpBek$C|I&n~1@XKfWhKWV^pGE`i9
zSw2pYh|w6XE|Pq9s~6Vmy2TWZOle~7q!_|<WrCmsyYkRq1F%cfh}v&|^+&e0!fu*_
zv5@M;5Bfs$Jj?v{fJEF+fC+c=jL-&at?ovl8v;GH@6Zg?BmI<^M(>2$T!^`u3J{r!
z%Nt8`9AaXe6a-Q{AX#7r=jkxjfVK4NC>lYFy=J`dd)-!usW1No70l8Mj)pCbs==zc
z%26~iW?Yl0kK!YE5e?~#F_I)KtX+%zlc~d%?D7RL_|eFkS6Wq?Wq&ukbQsogeX|$T
zWc*qzJc*2~9Xh$x_J*WzpvxSf07>AyK_d;(KDk6i>BgLa!emQ<&Qxj7;h(LirUL$A
zf<oCE2F$0Q|58tLJ$k<XQZu4yKm0dJsqE@!rLlzwc$5A}>IQc)rb~|QNE2nS)pfDV
zc4_O%MMn)+4GJ^1&+lsBamUC}Jyoh3x1eN*iAGOAB<sn5AYu|JqD3`c{?qih?B_=y
zvt!_1A+8~q!j4!H1cFBeWw_FujlqE1-7Z0{UU7c5Y$`~*#Z#S-U!iXxlMe`^n;-7m
zUBHW32{es#{|Prn9!RGJN7JwuiaEZje<v!tU?0L~Gscf;@~6y^>#SG=|BG!Gn87GB
zKiTA+)47rH&CK@>c9d+4olAxjO*atNouZ#rN8)_IHT?fJN02%)!_ZHA>!zQgcM2B%
zj%cXCM^5RfSJ*!!yBN6b*7i9m;fC~fjoc{PTh#g(y5bF1BK8mdF!=DvMu{KQrZKtJ
zZ4GsiOm2f>t7r7Om+rzYOWz%)$^@<Sf<yDcl`kQp3rn}%!^=ywht@9yibw>KsqlRT
zcO1LQ8x*%(T?--P?uRGKU#e8ZYv>{Uti%n-qB4rW?kdj^LzUEq;C~s{K_iGcTw&Z6
zzr-`F=;<iR?SGwrc#L|<9X2SIOW4dnAjFtJ4~{)Nqq^6mB~NjN&%ZxA$)wh>JICHd
zo=DuxY=Z7$3izh}on_H7E`^0?l?S>?&j$RE-AotB_=Eq01AWdq%PN~Ad}PNii_gvJ
zt^7+Q?Jqm|@%vdeUu+m$3GcaS^!E>*`+!n*VKh{x0Lvuv>PhOol`lMfxwR}yrT~^C
zi=Q?J;nH)rHHj|(fzM<!^Bh7~+i=?`p_6Qb<nht~;U|$SrT+IgA>llO<nX_FYI?k^
zd=4{>{4|LFd70Y*fC<-iG!qg^U{pZvdTL*)9TWpKSbxeUkb#sb%Huhx+Q3X)Zl*4&
zM6hquJIEVLsXq`tQw-ksIOoM`4-|7k&WCvTp<GPXU-meJMZLbf*WA|C1xV#FIjcMR
z8^Y3b3tSX<CE>W-JTG`4Xw+1B=nse*K#7~xzr*52lzb}H$3L)ivEnO7a?VC^Fbv|j
zCmh+W?HOO09L(iB6`)}CZ)sDgOK#nfw+<mgT6dk2xM*oCuPLIa9-FcZVj)vVnX6Sc
zl?b|Rrml@x)Sd+;`d)hF<d=-Y8^gKUg}y?aST9sHL&S>d;SLeXW3UoLfr&OH^oNhL
zs!gBA^!u2#$q_!oqyjstOfwy(Kvp6mOyU>GrHJpXGSU`BFN*h=AD#{=gb(92rVN}k
zBfzp#P{R??Ul2T6<jQse4BZ1_be`1sg_nWjw*-wOqoBd-fnnRQg`w&#(Jq?IO_k_k
z=YV3WbUf_}S}t!ko_mKWYvyC0*_#z$6wDbIlo?c40XkFaUnca%={0zofyRoklcpPp
zR{nq(L=sydIyXW_zE;H$Gz(#1JAHhS7=u^ZEl!P-%yQM!C8>N=N@=EiI{KWB>PTk~
z=mFQHGtTHQ0|itfV5@I?gZwzNO&2N)=&wtpNg7S9$F2!WO>?x(Qk)wsd!}YM_=&#d
zpuw1)L<WGYjR_N(!5DU1<abI~hrY(~$bDl8U;xK|Bt$=@QzCP{%WU;J$e4)ppJ)bQ
zHmn>;lmGW8X=A^Ji?!!1Vpo+Ro9*v99xgZkH@a&^zj?r$uVF5qMsLhlSmaD^BPED&
zO;$Dgz=Y6QJYS($e^-}?Rnmqms4=*f%zffu8^)8z1fPYgnNLR7&OO?GXDnbz*dtX=
zfD~=T_l0`j#Yd3vkN|QkVBfPt0ijNyw*+99(Wx=M6Bk91MwX^=V1Zi4HDHPH(Y^QX
zJ$!T=ephrEnMeU8yq*#nx&O)ZlsMasjNvv(<bT#`AtZWF{DG~9S?NEc0i91f+hm7v
zu$iRWr38CgSJDC(*S<AgaOER4GQ`AkrUNM)*BepdP_AMjJjtCAERj3fYo=Ze)-cpK
zogc;NS^mWE^q2!d{_h}2VTpj!>(|^>D?n_~<(b~sbbwnf<m85LLKBiCQQ(FQ-ZFb@
zZ*PNU^K2HLFX<q$djl-m{t`n}A^!qLbw#Jqti=B^Atz8xh?3r$b<$7=t@D3v1=tXh
z7_>`iEJtCQ68mioM=GjMm*1R<Xf+@`_?(c|;M5CvIX}jL9+Hn0M=9KpSJ`3HNe^50
z1$D#=oWI3Xc*|cz`s4pb>-xV+DJbu{-pMRiuog=PV%)MOs#1DE7X^@96&}-n7W?Nf
z*pBTA3qA0Q7PqAYGv@y)u9|*EOY0Z$3og!&7r`gope+?LOT~~ocU54h4m_5LOQf@s
z5cIgWi6{Tt@J@SL<Gl1AYqaA(?VL^{euK+5KKxi5Ikox(RJjJ94%E%QBFvgfL-6`b
zp}xZ%#png(Kp+ZB>v6sIE`x)JA8=wQQLI$2tDLm64zh?1ev5Sfn3VMaLsQ9Ty+)Ww
zP?ATDGeo7y5vTj`q(0CnP|N_DD5^fiX9E&Yt69)^Xb)NFITDv9Q_U)Ti-9EX9LqQZ
z<>lGPel3gNRV^V3%Z$Kw&aRj)Dmm<_D;dc=DSY5aXK@&%#D#OoC1*h#>|K|1)-y&I
zLRVww<(X8nII`gxvA5AAHhvzS36HWqUohm6YJfC*XN<=Cg*DDwy5(N{CKb>|V&_QR
zO-=m24t>m;TD4tfRG*m4p5XFmcbF;JtT2$GpHqv^a}>($e7=wdtQa65VQ84O!K2ac
zACcmsBZyH(?f1f`VlKE<H$^)IIBZ*e@8&(X_}m3xWKkZ-7>#atEFh<roC%81_SH`$
z7Hb9*(M+=|_5zfhueKZJR2gf(|JdA^@{#-^BkB(PB{Yz9c;;FIq5Jqf52RdbB|?zE
zh}p9pBx*W+M<H51jODAviG8DE>86e+-st<ioWIsT7f~O87Ui1TicFMxB`ZRU`)k-R
za~pVf9(`4hApI*KZDS6?GHrePl!o7%Fv{yvaJ@E>{_=;i7MXxD1>(@O2WS|g9^YWg
zVdST>&T8UDTw!TW2$p;{wRqNorI04mlI0`^>ztxTsfE|7lC-Z^U*10SSS*#rFT1#<
z+E@1ZlZKD%UARpNm1zASa3Mz}2VXu8w-RozO3NoeGK(x9Nn!!($j_2A=b?ew*30r#
z@5R(^E@EP^H3T2Fsuh9+1lI&$-szdJsr=}vSxpEqkYEz<kUs1M+~9k~V5LiA`6>#+
z{u@idCkWnIaP$VP%t*^7*fFi+pFa_GvLe@WWQtiJH8=0DDKX6Vv()eo%z`@+N-Mz>
zsZ0#(*(=g}%r)sH>t&gvfvZ`UFzk3GTId8Msm7q)3|}8XKCviqn@K9BbFKJB+3}73
z=W;dAj?@&_)-CJ$^SCp8pnapH5s==;iAOUZ;P4$~tHDNW45)emgF(d*w9x3=aLK3?
z^3zD$>h+=T-93k(kyI`UY`R8FaDV~1XyZ;0bEZwI!YT@d9%i`X>q@nj5v%^8I!&O0
zFVOV`yV}ZqEjAqa1M^!2m4x+ac<4S8fgFSf*s)v+7`RiS=i#JE4A)RD4s61Dds|h$
zv0vPRh?Gb;b#gWTjc^oIP~swGPA<eo`<o@)7G7gyWUDG9k5Ov52H;{hC^GcD>e#*Y
zZ^=<^5Oef!-j!u<1FQK)3Sftk!B{VpL%IzUc<pS{;}LQDv+RpHmU-o`oTB9tom9St
z8Wk1eHmtuI!H%-cl>_-aU8GuCY}}It0w>Rve#r$HsQv=IeFtNwQS=YXD@^izx;Mq0
zL_iI7r4BR0)!&&h7m{v|4w-m$HL7H^(nCHIuZ^Z2tryEV<;z3+KTFPpKLKer_jeEo
z;=m54#6yHII|&L7je{O2HRVgEz|PVtFZR6%dB&vu>Qn3kC-3ajzzrgU*IvaFAoM}n
zX#{{ERu??V1cWJ;C(Wew(^&r@6yL}P<*e%)BRpQU_k|Cjkm~l0xnQz(i_gov3~6Nh
zQUBFwldN;a-k(zbCird?AJaTh)D#D{A>|;;&j@cAA46LWiKNkPgbYr$K6IZ|K)j~O
zZ&xr)%Dh~U*{C=3dgj8WCd)yQnB&6ugYBoeG)q2k<<>1mDP3SwPM!DUbULQxCeh+w
z_=38>EjG8$G44#6^5=+JU0@v_JA9NVUU7M{6n!)dY)10g<BbiFWFgujHk$!9fYYWG
z8vyOtJ81~WL=I@uWz2+k_C<cd)m~w~?jMz~6B(l7Q>64kVZ|>OcgSO{!ifJ@D{Rq!
zGG7{s8Y+xEBoKt0^FS2Oy_}_h*Xx?gO+Fv{YcLTRFOfE`0cG=|?xdSz82mg;-6NXB
zg8sw%M4v6J2e>PUVaqXBZ@cAWFQ)0mNx1}l7OhH|CtbgQKtIOx{G!A$5M0i>PXc&q
zQV;*ey!U7^M{XxRmqhv~xI{<->a~E#vNHVtD2f!9c?^eHCtwO=+Cq4}-ui#v;-#Zj
zPZu%BhHC=5?E>Bdio@>=h~fB4=`r$W7~%!vFGIS+%W$#4PF`s?5y2Y4Bi06Y^{tb7
zPLMy*N3&Y&-#?d!-AmX#PoY1=nCKqn!H^*$4t@+t=PxWz9X)Up^g#k((1u3rugTTi
z7f{*i|JhM03CCxLQ#TevN?9z!QH3)Y2;Y)-DYc_ztnzU<?wj>!y?0VgWQF_X((n@!
zRl=W)W2KXg?}`yf*p7N!Owg<IwZ}VY;JMvu$L)t*Yxy*etnbnL?%bIWOj+DZF0ssF
z5e{e@WcDwnO$>C-#*1&|D%(WHyCp>}9N*>7pk%;SjT?Y5L$0!N^$UJDyseM&b90K1
zce`>zY=MnIJdFnj)2k|n8E|7W*ajE}nrMqbAohSvNb+m_)#*>~SNS($y?7$|8urG?
zYh@Y02KK(_qcsRg@roWmE)6B`_s<yfn*q`U_KVH{7`<;Ji!eliDJ7rCm;8z#tjYUF
zdievk{8x31KcOcMKszN)%<o%SAgFH~-2hdKDe*F+ojaRfS#nE*@~YHy$^b66KRle3
z+Nj0CSr!UhqgW^rxP=N|>aGvoHk`g)*j?4voAZs1(C7impj5W>n7I@bw(%7nNii$0
zgovkZzie92Uyxr{dH@P0#fE~#>}nS#ywwm=qN}%C1zRLvDwAnTs0I{5c!%{2*fX2`
z4a2*`xXbOV2^(qF;0zTmN+$rK6WpsCOWmj<C^U5Md@Zwip}7=*<!RjqBx#<DwbjZ<
zyg?fU=;HjL9nY_+8l~zU-JX^sH2HbP=5~&G1&E`G_QuUMY_Vf6;^Gm%gq#X&bmCua
zLFv=OK~-~$UZ3`wS}4o(u*soVeP5EBj4z;eLs96FjcD`mkCo|AVKXwI*6x#nSvQZT
zV-8+R0-44&>(0-(6#z6bL>G|^!jzvvF6&8TP2IiOUl_lcQfStzU_r4LrQe;NR5k5n
zG6-+ssEk&%Q(`~7hi-;rfy<>+DFYyyok2XJ9Jv4DyOEvmng<y&a1NlK@>8a<Yw6UE
zWy?x&IPJ+L)k9-R;5xRdtGY$OLm6{l3*Pfpv~BW=zzd)EBY-|!s)n8WbidxmNS^*K
z*u%0{60s}B^b@4Pzw|}oF?Kp9r7{uLKJyJ?+9*vmWD%vIE%Xt=E#?lvCjS_w^`Uio
zs+F8We>rj`PWfsy7S$}1g#Md!wH0ywfXgF#Azd9GsfNTNEi^xyXNcdRUBCvBAydPW
zmcxJ0HfPG4=#=X86sdkm)n|VbNjA?HUP7PC&X(y4QV?7&{Tm@uzqF;WH`p$bK!G(t
z_z@W~G6RHw>Ov)6zxf!O?Sg+>bdwX7nBVJx0YPsA-CEj!oH08_Ul2Yld2%`oi&BPm
z^aA^6t(>d)m+Ufb(dir=ZCE`y$QW!dUzGE0KbJWU=Q6zc5$BxSd9-1)li^DTf-XB0
z1t=G<8`O))LH(`bJ7P>*)7h5c^){|Wij8$svG1o*j=r2e_`T>x1|cj;pb%Thoe<mi
zaO&SLdZLy@5L0d`)_JyTOw!XFOL49A{Nnm91CS9uw@@Gd<dEKtWIU$Oy0rt`9jy4v
z5d?so>)A)s*@er?u5Z{_h}>QB&N>3L&{~ouPbJ6+!C?E7Oap_ykb_vNkCaRpwbm_8
z4H7qB>hokSy$PNb+0})rSL<~yYQLjm360vn#6)G+$*eAWh<w+D7(*MvoqF|C0HGW-
z$dtWkBZ}@u;G}*aMI-bQX#4$EJj$~STu<%Ojho^1cPVhi|NNwdAQe$izgTn?M*(mp
z(GwrN&p;SpL2U@T9AL|LA#qtKH(w`OFl(yu<Z=Pg=NlWHhXbQv01_E`GJ112nS#<2
zsg{{9|K{f@5DH<>H7-;~JavUwcEz=NNx|hunQt`1rNM)u$oi`7D){^sm}^vy@;L6E
zua_=xMTX6f!p<~gg<27l*cEGY-jRbgYSE7@=1)^GFT7o01U@p(D|2uBX|&RCgbCz4
zW)QGkbJgEfA=e2b{8MO1&mUtC$foAb;Qx6&rK&;feBpQDexuAtgAY^F?IXqYSwGc;
z5Onw-iE@#{aG#XJ@`ZTj%<QwmsIXXBbGuIH$?0qKGzfWcItt|^_Pn*8XDNCW#7I%B
zS<-f4dd7irg03iSb$at|kysH+VO~bjn1EFl=$VtfAUOVI(PDC~G`1>~dBDLt6r@Dm
zuAj;qbX<vu?=rM_`$e{IkYRGbxwQ849Xor%u_`8Mz!Y`9@JfuU?F!iseKxwEL1a;s
z+x;nxOG=QV&@br98d6K-6=_5nthzwYT{Odi@Una~W)sO$OI9sf&rOv|gpn3eOlrA{
ze>5GUNpx)Wd6-j2m{Du_a^%{!XpCbNFIN6XDb2;dHi|vhAv!zCLXbp!IGhUmm;^uo
zt};{m0q5?7IBHJI!|4hvR=6Eb<|E9Y7B;=<=D<HR%$&3>z`B$6KhGUOwtoZ8r0HHQ
zF>Fpt2)k4wTGHd_XeNk{Mp-QrHjZK)1*l_g96mcJOb|@PX-c-zw*|o0fG6*!=SA7o
zl@lb88AT6vIPkhJ{rOcL4pujx1oPc%o95R=YV<c|MTiW^0F=?3nD3pvoOM;Ca!n4-
zF87eAjXxV=vP|-<FwGb%)sI?WxS4KXPF<~WXmUwW&R+3qV*{h~y)TEuUoT3PYO%1a
zz_PweABCZj?AIq_L^BsW4NHakk#|cJRb_#LOnpH5*!I44YKi~wnC_gMz0cLaJ~CWI
z+t={cG75d6UZG!Zb24>0btMU0jF3hLZGt^N0yNvOuFHlpUW1dF=U)^>u_a*y7gc+R
z9oZLbbUCsUL++eDd_3||&Bw@pgAgR)9%@Ki&}I{V{ua@&^pV2|U*<rUM~~{Q3+0Yv
zpd;2w9zSUK2r1)Sy?Fy#gU-Y{AL9u+ux~vHw}V#Vt0@+*hQ)?{OZ;&>Zb%U8P>{1H
zJe*n@NR&0K&=Ozd$>m9y;3tAs$;I|B@dVqIC(7968Ai5qW_k+(0XPHbmi~&1Ji8OP
zZ+Wbb@!`Iy@UqzQE+v)Y@`zZ0EhkLwv7FaTND2VA5MlpwfM1L>0P<g^?tGOkRXBw3
z#PtZx^yJ0{W>#LVx}|@lJ{~h@4>%JPsq7*_#B=n%r81TNnQ<oAuIGS(1<Ukg&8SD9
z%YO8(F7!}3EW(eziwLV83>b!6@w7h%5sl%av4_hh!7Jbjx<;q4Uf<jD!RmvYMTt?$
zuE=3vd+yKj7{`5ut0ut<;3`ja4UkR>t2OUVz41^cgOgmJ(Fw)C*pe`xWI#!@Q2Uwa
zRpa~Vn0FogmmNz}l&zAM#*<@82f~`D@v(ap%sN~GW;U>Dl-Ek}%ytr07;cyd?~W56
zA&%$P_dN4ujG92QT3N%qkWYehvS+v%qn9T!H4p)7a5wc#mQfk5)*P9L)_IF*tCK@I
zM%&<VKD?s<_tyOnBF{(tzo>(?q}U!(wlwq^b*!W~awP!#LU?Nj-{#ei0XnyR*NdpL
zw%@S^Sy2Nxnrgnt*|L6io$;MSn)uhrTIgJ7D~ZjT`MdLBg^3=HJgA@vEGFc+8slK7
zmf(!@?raY77C-`onIurPg<&&s+As4R6XN0<9ZXpWIx0%=n?LojC{4(|TyiD)uQO(r
zg9y62ixgN-fhiBidd;A?q)b<5jWR%ZT&b?RKtk+MTRHuguve?>VMW;)X}D0Vfnas*
z#c73`-{@<<iUx=cr|~F9ASW;A@%-zgipFWn(4s-{;>B7;-W;~e;L14oi)oio%S!&X
z)UCjBlpP};Y<0S*Y(4!;Q?Gvn3`dS$=Rsk?Q8#KIq<lNXohW~!nS%w099mPZB8oYh
z36js0-LS7rlLag>!=}Y<p8xMt9XGP-PL~(jl5Yj-ueL6i(W^@t)0ltQFq08GS5pU;
zyFUYhby^ClPoQe0hU;JrM7Kuo`AbvPNpdoFJ%+06;4a>=nrdRrSP!NjW=UpHF)sk$
zn2A58{J^Io#@7jy8+6~Iv2<v%Re2k`UBZei)nqd>0fL0$iqm$w2UJnjDlDMEzj`8<
z(5BHIJ@Mn4Kp^q0UC^3s-=x|H6<>Lcyj%OBNiX`RByIPAo`A08%s?q=DjTiEcTCOL
zPMo;21fIc<;c>FCsXWW6LQ(|IcnYHO3%9sl$OoliFwSMs$XQhd441D4@IdOusLlN=
zdhfr~9==Sa_Oo_bp$;S1DU`fd{NKv~4?|#_AqwU>6uOYd+{wSu#!=}VRR4m~I3Uy1
z!2Y)9i6_<EFCDa|i{E^JlKeCBu(IYt7JsVRe{r{Ual0G<uuH(#`d7qSf|@MbsrX2a
zGPKnit*2v#gp`x#8V(AYf@7K0PLpjXlO3n>9(8c>TCa=$6+m0W(LFM>7ww-I)m&pu
zX7S-d!LfQE8vtx;9-Bcq8m>HL&PtV~;Q;T(sVK1b3NL_;8(ZHLg4}4Bl=Gk1^m|Z;
zP-XN%SHgey>$J2=X(Z;`SbJT-N*I3J$dEPRk5}D5duc(-R9e^DIzFQ*qf=S)M=|qR
z5^!qQKcgwel19U&cyH<tAyNcscYjlP9`JVmw@k0>Ovt3UAJIZu@|gZN|5?`A1#Clq
zjMKN<u`6csW!@R_WG#7wAx^Ll&8|Pt&Nsnnh>~@oKtu5Yja-O&Pts3!{OP<58|?H?
z1jOQ2Mhzq#-c%;Ob=@nk8!Fi48-f7#?KWo-&0nq~-JCwg_usdFU81Mgc#V-!W5O2U
zkVv_<HPyFob3h*a`V|MvvG%lu{#CaZj4-~VFOAzp+7%n18~5JG$tyr{H4`*zav3Q)
zI5iCInLSF_Qq}k=C1I10`Ws{I%(vJF@^Cj^JrqWwPOH;L*`c^o8=u}y=(dT#T!C?!
zZOj<C6}E(Q=3S$V2-5f)+w61Ig2?`HQld%0uGXc8w<lPWo5*!!!yA#?4WZ?9Ejz%P
z_Aw^?0q=leV+<T_Ux^&d`}6AZEV6VYl9Ls}IoqIq^c!h)UtD<~>{{Y_%U=N3TxFW%
zuQ+@;{+1Z{G$m9R>5%$DflI;iOl8(P#WH6MOptBQKMPRjrgNaoYQ3?2VMls;G_R<y
z*F}A2e%wQWyqx{L*(hcVa(<>0ANoLa@u*zTBF{%`*KaHrNO<i41waH?$bS6?c-`Gq
zk}C!k2|x88$}hF0B{i1KWs>Sd!gqlp+KF*1QZ&wqe8n*eEAmQ5>W)eE7-IY}0+*q9
z=u+!)C$HbrYEO2whxppI@aCk=1qzwhAV=GH-D0sZccbhmVG9N)V4Oi|6(Aj|M)<zi
zb@V%*XU~JPee0}n)%(dDd{Ahp(XJR<0)E3H@hgOesgy||%5;amCkOTB;DV05Oba!h
zAkhaJ1HTH;r@)YW;-L(U5oV$~Abc)2RK2iT*_T~b1f9(hA%){>k^~1>;U*$8*d#YH
z+lWaPoWQl71irm@r>oZT_Yuoba(}=-q1Xb3RqPs586t%wz(Sj;hBV@A8({QH)O+7>
zg`EQLz9Oe;eTq<oaEOi1(Ht|IkkL@^6LmjI&uc*cbi25=@uINjbCP#G$>UB#7o-Pb
z3;+ueqGWbyCB%)#QK{GCPf(b_c_fUqILF&b{$;6#+4+Elbbx_wa64#sow5Qg{U+@7
z^uZS|*JV_0@1lq=KF^(BR)J*~f20rwff$ZrA$eesqh%{DM<{;$S!#j0nVjaNgB<P9
zwvfxq(S%^Mp-L=F50(dw@=!i)MeIAaj5*MR3Pz%yA%P{fX{New&_2<0Ttp#CV>L6;
zA9LWs24J-mkNpqY%UeO@=Ep?}2QnKJE+?5(KTfbf-QKMX{?4K0rNp0xEz+8sr1CvI
zOEPxcEJ-AsLhZ+&<ZszkWBVZ-zl5IVoy3UA_Wz7Cuq2@PF%<!+C$0_P_%7KYyOhO>
zY4qGMXT3C3QK;Uj@+eurGk!u@p}p(X4QxyAU-><0-;!3()g-NE2|~V$E7Bj{zPK3w
zp0!#R_|&|;q`=E0&Y1~wWokS?84elpb?BiK4h&q|fbl9wE9tvYxMkrUPz_Am7&njG
za!T?$b;0v&i+5>+vAgG6Q68Ghc=y{Ei^!qikS|H_`toUt`(-Mb+D})Y;O?MSfLPqY
ziT~UfrWsfp%o7m7ZCOz158vHFxrO#YCfBQUISh#SvG;Gae$k_f0w7+V9`ya+WQ`IG
zK#`YD9-0trDA~!wbheiA&lDM``pdpcFijMmMP39}?oZQ*>RLWM2{A=-iY~Pm+`IA)
zbId6+NTPjLH)oe01eZ;EBqT@C4OWReeL*eBSPe~(Y~Rb2Q;5vKgvu|MG#J<~{QC3)
z+YC>AFI$||q^pU_m0VK(w(mJ{R6&JpTF`dgh(E`!&JvVmzLxq=`Lx=bqBrMg+ia7u
z@eaH(EjRCHDu4AXM#p?Ux2IV%=n}O7+r-QKC0va2+WL!u8xFbQO5?)}<Z#>-7{0b1
zm%ENXjK(fRul$~_-cl+u<}s6Pxy9~1k?~%r5}2LiYo4n^P^dKRDH!iKdB70j_Id@v
zR++P@IOJfQv;$oZh|nu4JkWYl@InbR)wrvF)Od(7k&o?&h+C1L_Oi?mgF|245`PNB
zYd<FH4|8$|(pyo3)_|~mhF-)A==RuSe2NHs3XBM$fyq(GilTFTVo#*+jI0r+aavej
zTo19Mf=7WMG&&7EeS0Xx;VRe8#G?N8-2bOgqZJwa$9VnR5NbqM0XZ^BPII?oCNwFY
zKYSF6qhs7j#Cm<f=>AT2XZ`ruxF5)9pA`5nufTB<0x~YWyeO<%qm}quDlY1JoZy~l
z+_|^mqgk{TPX#RV5+va&@6V@lINLu(dU|Fjw&)eM7ws6k=6s9=`ws~c6G&K^c}Ro$
zZVbsq8uLQP#26@88Z9u$f!LbcwLMMW4~hd+s9=HI3$J5s%TQ@J0{l<hstxnaCDP}j
zsd04re~=|YA<BsU4vJWcL5Xx2$DH4tC^~Gk?n~x2$<5Xi^5jhYI&9;T?20)aZRdJ2
zh^IzQ^N`+AR@34c^i-K%PtIo42^cR7cn?Lv!@rP}<g4FDT?eA9_)<=1J$ASkAgmY=
ztz|*O3kAVB^a-Jg41d49ac)pDb?>J>Y&Huon%WAWA}id?nhyLtE3rIchYhb!N(jhx
za~qJ|_@m~@E_-8ed9qc{8Jg!R6}-tNXRnZMYFfq!SsSirZXG=(>gI3Eypn0>B#^AT
zh1w5*(W!vL+V*Rp{6xP~z}n}F<g<}7=!`E`w?WjPWx?oFF7CLI+FpKGAi=9>jX?bA
zIQ?cTx!nf#9cC+{@_`(I^>RR&x~(aY%kxX(d^gDuvqsS4-{0#i5v#}f{PU_DqyWrc
z6UQy3LS=?T*5rY~c<qsQbi#S9U}qta0W?Mfws4;Kf9cM1u9oEU3PfFo^NcC;NzZN*
zxJu%6g3gzh9Bq?pkWf4DU(M-m_158<aLF-#CghpB<SoE|ptc6u=n-V_MkZCM!s?1x
zy<zOojYF*wl<4Xm=zYl1ngnDHs>dVh-=MnO!U6sJ8sRJ0=eNSsRX*bVJ0a3m;g&I4
z7q|KuIbm0PcNfhCTd;VhFwKmA(b)8b&i944<aNfkfcM0xS_ZK4pcy_*);?=(Y2+go
z41KbnKPOH&Fr7iJ!s`ccfSaXk)$DLnk(c$>L4OT*y{Kj$iPH9Mw6pj)heOnukaE55
zg?lr;!zVliimtNLkO+W>e43V<l-AMCNN!~O5kd)6x|ON93IvuSDb0E#L`MAbryRvf
zlkCwyEfG5BQk3AIVRlJFECx{(&3%->yjCC4u4R*aOa)UyZ1BWq<m>wZ?OMJ2P!-U8
z^}COVsKE(ZZ_&C7-e=lV^E8qOkafa{>2j=lx<t^Rg8w;k7Qbk#Gw`yRLH69Dj8!q?
zk3T^PojL#2nFD5ks0G4F*rfebqn7WA{=!8NHD9W(Tj>&2)U>tGQvy;iT0LLtf_KL(
zG9a;B_2b!81FK(N0UYgo$>UkUO^X=1SSvO~$p}r1IyTm8m5dn>ML@9p-fZ#SiN6;t
zfE1n*^jD)&{r7RrM$Hf4=#&05q(5d^Mj%OlstZUgsmIxLI`R(!0*{(acuju;Qgu&o
zt<HJmF9$}KT5&LHl!nDDY<sKhF!-F6oe3T#{F(=-=ke%0{$8Y+4FxCz!bEJ$%F&_%
z*vj}JPbpCKFwHahylu40Q8+0S^H2zxqLkhFh^^97C-UHEje<BWojds%d2E4#jbD9l
zZJ|KKWf6Jkf2<%HS{5MUlCEyaH{XQP3zW*Z#-HB)TNXZnh1HJK(MsbOAgQLmS~Wy9
zoIc$iad|)ZS|O^FBc3NCr1qlu<7YdyW&<L#*T|v>_4r~|_`r*koP>`p!AK}fnpNs9
zpy`-9%#7P)%hnP!cVEk!_0GP72Slk8<-LTqADz$I{_qzL%;<}&)AMJBls}bw>h3UO
z9(YE?5+426scN}t<9+B8YLndj?B(_tLsq}(ZFN^fRPym#e;N4N_|+b@11?{c-J#h<
zpER7(An-q*A2rKAnQtvej1gVB-_OesCknGBP~?VQjwFnfvQbDdOjc%wiOrdR5{@jk
z{4NDv(LqN~{m3oaof!n>=?V&UAJz^&6x9le{b=o^W*w<uy*}hCl#uCEB{U<lQrVxX
zonje7jhj!Vk2>j!MhrmJUP4pBk&`eV&=l08{p?8hgOX2XAyg0aV@sF34~%0#LxZLp
zRcKY*MUQzl6NK}2<R|SUmV4-DbYO#)BS-Kl+QubtmXKdXff%?=WrMf;#^>eB6)fP&
zv+=i-3E1yx*P(VV&%bs@j=4;l?`k>_=5pQ3GVSsz2T0$>Whucb#SI=zVVV%%(Rd(>
z-YASi40bGgQoa*jMK%ii`%2ZnK7tR@P&u~RuWIxo=^PFkVcXyCqoTJA%Wm><S?^(%
zD?zW(Q5Ce=ugao6L*w({s_vCr%E2I&OKxssWjtydvg#MkM+AS1Zvy1U;EG_#ytF3u
zMUaL1n6tjy2Y<n`ToQQ?igiBY;IE3OW*J;*AN3`dLm2B*LDRIHOYZ5Tmevi_$dW5&
zWMkT=f~cd{g(Ba2UZPDbO>MA+Bq5X|U1S=BX9E(e(wYosp-hl%wEa?t5&$MuVLO@(
zxKJuJE|x7h5WA+aBfM}fM};`y%YQP-$JfvAI946`r@O<7nxOtYK-6iOmR_ti%zLDi
zzVXBLbkX`Go=DEG**(`Q+5*cAWHN(oE^ovZ(3IPGgv%24iLLWYO8~#Lf}$7)Cl%`Y
zGzWn>(v28kj#Qi%FQk6wVQ>BA_AxpFgVTTn%lKCJ*J-DZq>u$ej)DTOa~m4Hp+|iT
zKePvoHa|Z|AfX6VW7ycHCK2RUSdsFd1!7TPJ8Uz$R}&}j%<*xl9DQSmZezZxB}q!r
z9CtdHZeRKsxz3oifAu!UqX-SRWG${>???DrgD}1mP1hW>m_fG{I-9%)A^sG}e5`He
zrijDnd;~$^r}(-upw6Z@2u(-Y0Z=0E;P{H9J1(Fo{+N?!fNsSa-}ni7+iO_6UexL;
zT@U-GfulwV7%mTinj;D0+cTWoL?|9DfBCgH{?>fzrh+CWZVRPSC9JllvF;KdK@TfX
zaJ<4g>_I;h`wkkJvX6F-ZKC>hisVRrBG!AMbG%03oI>;UxKwLMmtEZ`P#h;F;PcBi
zGVyQA7haY2H`=r9Fp-Y&J5CAjbU$zNXS;U<-&F%UBEJqq9^i5IjpFtqos(BQ%k_cc
z^&}o>LUTIoVG~1`=!LjRl)1cgU?)9K`=^1Ox<k}7>w`Ts<E!j)JC*?oh{vC*0fIA%
zzegFT1eMK;1NetoP!D}S*rm&9$0lnm;mZ3MPmPcz%o0%qVpDXMyq(X28J}x=ZrG^=
zzUi7u4fkOpU;_%DO|Br{ItA6i4`UlrkLYSd+R7@K-iN@NBs3BE!krUc-=IEyEwo@G
z_O=`LbNIN%rqG*r^C=(-aqn<GJSoVG^{wUAdR)tP&sn3$Vp3?sYRV!iMWc1@l(!`r
zeZSLmb!lN4N+6N(MZiCg1a*3b__N7}lhq4V(y_C%v@ZuT3HtjWUUt|;(L80~TiFF_
zFvQ3|VxQ3ul#Zm9+dFT+yJJY={hMRtOKD-bOCX2v20btzTLxtWY{G+!7uE3)J;y3a
zCI9dj_W|}?9T9Q&#6Ju0FC!M+;Dx1Oh#7{(X1X~T(jDby?w}Z8PaTlntTawAZu%x?
zIpc#b7f9nyf_P^LOjzCCfKOqy3fs^67!74Xr@?lkO2PZDReQ%+3~?zz=jD)WjuM|X
zBJ7@i8c_MpumM!Q+e(KVP5>Q+BA(%kSxv!Xjam3I(^*L{DmDA)KU}Ahlri9)`oh_0
zij4mCG9iM<t1E9cUCdV${@&Nfet6cRN&LACej35AZHM8q__3=5XtcokUiml?)K|3+
zN?TD<CT*~=XcZ1bdhVsOvGVsdS)kuA;SFTNv*(GLw>EGwTBr}_c1;PQO*pK^x5&|A
z%kICHcKTF($xN2*laM-Y=4Z=13ObY!4e!dfw7@{sVmmJv6YV3J^Juu(bP<&aA1_q4
z0{uX%<d!*5cdZU};U|q6<(%eJ<V#ZB;INmn4aZ0zs=wo+(yUU!vmDXlL=!eyh#%a4
z40FHC$n?>AVGtnS5fAtgbD>ui-&+Tqj1okTLUsg9beJz{Nd@pMg`DI&Z8PPysWY*<
z?DAcX=iPzS>@?*UbC>O-x0QK*QYVY#&mO<wD`EMTXUGb~6*AJWQGB?%=jc!kV{G)L
z{{uupyS~*BJwlKTCXVx-oJW|8sQx~jK;qCqy%Se2Lx_K)*mVi1f0UhDuEQV<M7I<O
zHn9JVT_5g8Wnv_}fl=kQ@j&Krfc7L+Su9jiBd-6?n)TQTd*a-aYgVn_gII309_S7B
zaU@%ahS7FAGryH}5IwLH-pASY5Dl5+03g}aAkC*H%#X8esy5yN;QekiVg@5gJXU?6
z4NdR_&2l%!U9a3gA3t^9ZpU;$1&J<v^bY#8XWCX&BUs4`rrs4n@PSS&1FxsS@@NM;
zoB@qXmvRGr8i?1^42)Y3{tYsdKNKfn)|_5VLtUHj{!KdZz`^e$LEXKYMvXKX^B+jb
z4JY^#6U)G>X+(6nrW;16peZDTK2F-lf7`Ytn{@@mza@A+CH9PL@!#VeMv(?Jo4wyb
zA7`yzxm1YmRpWj%Fnxd%3(Tu)NGu%6=6y)K2!0<uF=_9En&i&g83`i%ej|@+qEvnQ
z92=7JWVPiHWTU}9F|l?xfz1j>6J9j@q@+LG#A4LqJ1~uX&?|wIGT?g&*XmSPp;#)?
zV>{6qMJ;-Rdm6GA*We1)S{^#1Fwp29W#^K^Fbo3GD<veh;r<sZFI|C&6c+8$il`Ns
zGM{{OLk(+@Tmun{jT{_xwc`EXP{Z0BaUtg;FMlS>M0v5*xgmzNIpcb3(FvCh+s*!@
zp@g*=R*0<C1rtj=9d=5WG=#7g*){k1m}mR-@DaG!j7viZYmr?;*0i96^{b(U3!5~A
zuol@h-eZ{{sq)lweL48894iHU0|c;1b0l!@Puv&`BD2QFbjRcb@8PRr_UY)?VqD4Y
z&VN7RE630R1T@sO7Kt?{dSjpQhELMm>HVP_?RzDd$j<skN>4Dzx1(R{5e@iBKYr-g
z{^r;RrG`k=Qb3d;wmtB(P_~GByJ{rMTjbR+MxUgo;BtiV#Q1Xd>!nVMM4!Mg^tk}J
z1-Na9Yb^ytVP1By%vi7^i;6V5Y$Dcx#t+af=%QH3HPoaQi8T|Nvw!>><wEh)jZPbh
zHS^)dBB>M=Ex=YoO=_BiPsr{tD49Zf)>e>)n$$Ew#6L-v(NvB->7YEiD#(wrGfH9@
z1cB(4f|@G#zgT(pqa|WTE<hZk$m%XTL;KxGhdX>Et@J2kNlpows`>^tf^kekayR<d
z$op^L?L0sHp=hnklg^FX*IJ_|^soBxhq3~U-d8tvaDo1{Bt)v}Th~}VZ7k;5jHs<_
zl9Eu8swdY}J7UYcg)~H~!Q0=R0EnJk!|jp{7G1#46~{Ml;(XDE9M~50d}%0MY5>F&
zmh$S!H3A1=l-_8PwqE!qJmvL4t+@<t4*Z+3vtDO8ad3HJ4aecM&Bb%C^^?HcsqlM{
z@{v9QhBs=^p06Y%wd#pA0$UExBI(!a&r=en@9JqaVw-H-uWInQF)K%7j(?!wEA8s^
zZg~d-4=Tt2S)9v&3GKn5SeoNqzqQfVY^RyP4jW#0f?GXv;gdB^0`Dio*QK`Y_=klO
z5+3Wa2ha7z1m6pu!a(~`IxzSlDp|E(;b;b9l*|}C8pM#Z%nyv{2I5>zET2Y<zwZ?^
zQtaI@x1A%wB0ksr65B(<fyoGAn@EH<|A>Cyl$~3$#2^SncXTUa6y5*EE+_Ldh^dhc
zbft_u?S>7uuL%|TSK}$ps{8v4`}I#Q#2O^w1r05I?mI%)#F2dQYOWKY_itQ=e47&<
zEQx{ac*S9<axNeS+{e7mIw?!xYJDDm;|a73whwxixUiTM8|ku1FV028VEd-%Wi=qW
zdrOPTjQg47T<r_?(iKH83%iZg0-I#+T=5IGAJ{gZO*|c%nbkqDMRhLu1>2Fk(V%uF
zKdPEdY>qn<Ns424ThXmLFR9NSjSX}rmWYdg3?LZOidX%p0)7L(9<{jW$0v77o(Ecm
z4K1Z-!jxyz*bgksizc+%<%`*^W}=j=BTf6GI5D#<BQ6pZ%|w@PK27;!nd8k_Gvhj#
zjAs15EbUR~7vqM!TQ~PZGk#S3iqgthd4V|6HuAD9^!p9*Dht*!HA|iE&n%MP!0-3N
zcV<wASc+ueOoEHUT|_f3+p}pdXf)58;cSdEiM~%WKD+vCbW%_f#@p<{8a3lotFy-1
z8s#xmzr|YqDZ2t3h(QqcC8wzP|BoFdms~`=tREnYxC&a@JnS`vt?u<w(P`DK)zCj$
z)!)F^6b36OnB3dxSf_UsbDgWqAa(G98hF#2KA}}sZ^^D^usWDQL7$<(=*Rto67u6@
z&^ow536#lQYaSF2c@z4c%KfUeySpkJeyn0htO4s}5IZnxe0-t81H*Pp!pTzxv7;H3
zf)5INiYB199Ura?WbdRJ+ale{>Tcy}>$*-PQ3kblRt+Sg#GnMsuFNpKDpR#fkTeCE
z6GFY1HcKAFl{pe5SSF%7!sYP*UY*CUGU&RqY8oC?tp{_9wv`ZNRftU(STzNbU%1-*
zPNW>M8Q_*c03T?ST;boU?PN_D?3VDFU*U{2Am}8?*l|?`3MI&zJ`OSsJ3M0=y*EEb
z?ETsXuOkCS6)<Z!|4Ig9gI$zZA_v4LpxCV?`Q;gm-N`j;SRxy&fDFc4(%UQstAbXI
z^-N&aST3udJ#S)PmwTtzto~p=3=c-y&tCdA<^7@TT5=_ZLD-cN$fw-@Vh{5c6_jX#
zG;1`X1t;LzdE^lbUXLZ<G3_Vgo=T;`dV0-Z^FLd9cqMtRBA@dSN)lxQ(vE^=PiElv
z-oJ<)yi8$5!rEOM1Z9(qRA3?K*Fc<WYnw8so#b#L6<C;I!M}0+m`h=JB%-}(>|;*6
zSCqCAvk=(R#G{hBsX&gGvC+dCq2?ja&5|rFrE(1kZcz==$a>PmbV`58_)IE*=J_@Z
zW;LV5PN?A~8Lxm&P_r?^5ZlIUKjE9m=bTLcUGKn93YK}q*+NY!aOU-FIyM@zu<e11
zWs>a*oUOQF-0<Xs(Qf;W#-##go^_*l5q+s?!c13j?e1TnE60B>HK3BbFnwouv3@JQ
z0+pV3L;8MbEkgXe_ucMdA9LcVH<;34yN!YQc)kl=seo{>kwOa@%y40~t$eI_ZWR>v
z^qX#+bHc0rugv*7^6^Oq`pqKynrY2VuRP8hxq_2{eFG*)Bkh7XQGF-HY3%cJd@J&g
zva3y^7>0mXBJz3vi#_Z8Y0#OvfXTF2LUxTaRBKi(ywMdLiI+U7?e{O@L~FF<2E}tH
zTm(|oDi^9?<x@lIi=p>p9=GhJK{AaXl#-`zLKX13H*OfSMKDogG|JK4D&Vr+i^Tz5
zCq_q2JJL)FRlw!3abu{6cb2rlMG9iG#CQb*9y>Q?T+6_}{LLP6GMB4dO6~4Wt{#nU
z4{kl<xhweMl%pmTb<~-`w$fHh(o!W=JMpNADNr;0o~}QWJ{f=iD9f)LYIp+#`d&S5
z-wRc;wG)pLs2i`1J`IdNF*|W3TRZhA(4#?JUE`?H{$%>~qd4&>u<;DR;9h+td1NSD
z!Ghz_aT|Bv0O>=r&>~!cgX4<UVGsM8_6dp!I}-T{SJLWnLW^1rV-PN)VZ;d?jc_F&
zp6+FnjeU3`787<{;Yv!pH*&O&fLPQKlkK8N3nky*%ft8`q02T@Wns9WD4ZCtB;0dr
zEwa|GXoNwCH^U~ga3$TITWS%?S5w<}+z_B$c=+OvvNPOa7zBavD|ukGzW<Ajvso6v
zCL{ZQF|Hm^>Bm>SVv1{psm$iU{OpkIJxl4co1>6;!-H?E7AEFJI>*FY5`GXbSS~#J
z#!ituO*-SbZ_fL&D&lbzD#&T(HK^@SZZ1-374bM9oSdjlY}2;zkM#SF`}2AAzTZ7`
z*@&9Mx=~s872nnmixqp`+tNd*5UGd<1kP+kacm^}j&dp660NAa0}A$e%h=@Y9QdVI
zg#Gbk_aAx4!<MXfZueHXD&paKq>=f~5p|YuNtQ0y3PSsi6|FQ`20A1*+)?@U5e!ru
zY;uV5wa;N9mddOwIz-M64s)CwPJd;{xk|-O5aOm)+hC6dQ=v6ZN2lT^zM-dWb~-rK
zae@zbR@aK5_?Dg>BkVVBHkHo<hFZ1aDHw4^J+a8sqJ$|QJ|9u7n2K-fu@GTp&{JSF
z&B_%=@rWF7vM8_n&9&|WeMeO)dlG6+OM*BbhDguV{?mR-KH)JrxEBWhMUs+7R{pu*
zhq7}$Vi<&B@Jb;zf$YCn{qfJ3UaJK-j$ru_A^kp)tdfIP98XH$xGRla7bG+V3Ga<;
zH{egT2ls(K>$8UA;$P1@Q+sF&8S61JeV)_(R#0}6%7JPJpPE5J(H=AF%B~Z)CmJ_=
zW_k3&yXm@V1-~=5hlh`7rVU#}i1(kRzwdfv?lVj&)a={oBP#H{xlN7bOc@Oo|I81C
ztSO~truK{|1tX(@Cd03K97<x?baIvr2*mhn##K3-h>{kvP)?sWUYAJLGFGX{(v_r;
zm2#rJY>e-sf{3WEvwCv{v@^x0FG>hp8`xCUx7l2Q?ac7Ojh8onFs|)=5BpXCFcW<6
zg_*ck;AlM#5$Ov4Wqwbjcf@iG1@PPIi6{V-={@oBP#;6*4L$IB16{$9joou$QE3!Z
zbNy&2Yb)`-3+7x=m5fOEGrF8Z_vcDfZsZ=U<vd_D@=YIyGSh{5TieM!Z3gTI4!A-0
zujj2qd?xoi%-QfkMe@h%pH}Na#D6F|gCvMS5D0!rRMh<cW1+o)rYc<bU|9x;VVfE8
zaF5Dh%*F!SzR>FPXXWn`>Cu-37`SgK@XPC0GquE{Jqu=>uaIh$WL)kfnyDoo?Lq9n
zqiep9T3P3l)J!e$XwQ1K7BSPU*p{D7Jk8XS;6X*yO@^cF9#!SC?@TobqB&Sl3EI0)
znPVNJ&rLJcB&g;TP~)u;!zag?@tUb7p6$WL58A};4us0tzsrn!N%W!Go_mT0C=(;+
zzB3sgq;qH%3-BkGh*Kl0W#+O(LtdgpfNGPy8|vk}M<(Yz-D9DRkO>?M0%B**XJ)m;
z^F8oil+oR(zO|?`16AVro=GQZEbiSEtKt4<?e8;L!Rq4yLPTa`UMy@{X6i|TgwC`d
zP)M;T@8y!0Bf-gt=X(%}9kA(bi@jf-Wu{gIn<}uIx&7=cRO-LAzxVCk0Ms^X$v0N-
zy`C&f%gk6wpnE3&8g;;WEV?f-n5lz-?m-iJY)hDecDnpo`}<6MUNY|k&9cf%*_Gu=
z48pK0VZzq?Uu<lo(NiFOntaSJsv0IZ)JrQpxP;B<py2sEeP3woGUz+ujZQK`D2yYr
zk&tKbM;zP2wKF~TNUdsX%7;r1WpWL<{yP~}5suiZ%6B|PGvhM&W#QLCo}pEh``1>P
z>{CG+q-Eqv@bsQ80Pz%#3r(>G_rZ`+EMXo*SdmOkw0cRI?*^NZEWy)z*k9SstESf8
zZ3fSsX;epWm3m2orubU#_L`CYz!QA*d0rS$w7Ax8rGaJCKkx*fRfd$!ie-Ifknms`
zF%3MyhcJ-CFsG2Zwt4LH%i6EEnBHPX+B5D!){z@!1@IxG(}8FFbj~*%D+M5Ci^lkj
zOb4Fvvt-W2og*8czJh&{k-NZiew2X6V+<ma_YuIgjM@d>WoL6*6k6WP_zRo=cjebg
zdXpVCS7{@}5h3a+SD3bCbTsfTJA72seN993Q-j@|(YoNsuObN287#AsQg35_%V=HT
z`9884FcXDx=nM@indv5;?(?v%@`&v6oRL`Pekb1wd?-7&8;D^L2)1P4?8N;ycFg@@
zh%PjMqR21o-JMsp@1r)lTh1ijw-(BiyK^v!Vjno&bUD-8_-ki@dRhB%3`Vuj1)LMZ
zk{{QQQ0DLMtb$SOGri|SFf)9T+$)<xt>bo)sP$P&1RX&xpjNFIC!LjQA9iQxN)Yl0
zi%YYzV|9^zfW|+#4G6~sr|_=!<0y$DA7ZtLy)~S9Gc(<-V|I~4<3j`@xFYe!cxAa}
z$Lk_7duRCgP<Zjsh2~X^?vC9>V)_mt9gAMacQY~q^8fCvurYvVvYLQp0iPnpe%7(1
zXw>)ctbl5t%iU1`U#w#r(UWZD8#A<}34~<lRj_01&;xC?@Su5b=Ce{{zN`KGPhupU
zBGp1}4=H*U|9f`6``j%7{-QP+6?wxtwh@iuo*#Tly^j)Nl`>h=-Xj^Q9p@$ZNFK{k
zhNu;4s*Wc`V>l0y(PV`ENGevmV01hwdLXa-q_&}Jk`H2)I<8~y&_mrbxTW{GuilXm
zRhq9L{<tu{l$}`)!ypVquLO>v<o*}yy!4|oixf-!9z||&49pVI>%?5|h6tz=9o<*a
zfoDV*7AZa&J-PWCKdR}q!LAwXsD6f9-e?^KFNNhj^o-=dBFD#En>4I<`8C@-ccx!O
zhL1hACOmrMJ%59ITs@K9BUCs;y<n5u)`Kd~s1U49yGsO7L({i)!be|WA3I8&w9nUL
zf!#F4YBROWRi05eSe;`&3UP`yo~Vzd6M9DAV3FISU7uFHW-EQ?xhK9C>`X(6+@4?h
zDE>M)-K?|y7W-K5$nJr3gEt^Yj#yHTH`vE_(56^c0%|MsAfx!ECYe5H)3v2aUASX`
z?0j!(GBVE{Cs|aG1VJKl^Unr5(_v!{)^Jq?V@l*l`UbtiKL3|-U2<}#ua1iCyYS5|
z_PHig)`xb*2#Nb+Yq!=UBlxh{zDHHTUAf#Kuc6VN5l+}--*X$8QW(0b(SGa=^s(O8
zq$bg_)X3Qer>1??`g%r^VUgvd9iZk-{lgF_>n2;)Gl~rR(|o>^UE6WMAPidxj0mv*
zVwGq=YE16p1$-O<1dbkmoW5FQ+^@DNpH$%zel7mGR6NfIJJq3dMHnj0D-JvZJ?(HN
zkics$V$YZZUn;+k+WQg^Em!Lb&@BBj9~s#393PoR^||ebYQvYp@9WQFC2^wa9mV3$
zCC3XH1&Miz&(hx#QQ#E1`x`KQ)Xw19LGkIbDAt31Y!`?)?hGz?ijT|$i3xnYRz-`%
z+ge87VV>f%_!*(g>yDhYZ?#{)C7iLAZK9TpF}bv3lNTA~i2Y~yDDgr)JNc$OH)<R*
z;tqp1xa*~f119hKPj%mC!#lq6Hqrz$y!c!iV6a4E+C01G;nN8^Y!z9$0vu$-DCW66
z;6BITGeJfnx8;$MqL}CQ$O)1YG6%6{l-v5qoT-Ox&uH5PP`AsQR16t0iuHqW$L*q4
zOp&`)G{i?njbcYA)~Ir*Aq1<Z85<kO=uzzC_S8q23EVYRHVxs}&InTM@a<9fqH?>J
znrqRl5E(&=b+;k+A07}GW{J88Y<k}hW!H8DK?uTHauG%QZ|sQo1+p`n20Vvbc_!iW
z!7)6#%R@7|9bJr@v7`(WMMi+7KbV_AVaG#zK@C@iC?X@k(x0^elvYS(UXp^^84oq0
z_^ao8o~U}M;2-rY?#%d+v7<ST*f%tSTQ4FQ!$6U^7V9*82I|Sxo{zVF^{Z(!79?24
zw6j6DaDEH}Mbc_4I4DTrVg|p8TX)7FvAMGz^o!4GQLnJ?x5#i?B;t7lL)8s@mj6Jp
znnyd6t<EGmIUrBtr=K2U;aC}Ni$p*VP+5lw>ZOzv9eQObC=vlZ9uQVLqkZ)0`nR*+
z|IFCmf!2ESF#8<Al)H@VlQDRBl;E@3@P}!7GcJ_jw@A|K0iFzMg3$B5D;kD_B9<Di
zNEMJ)cAM9(it^-FL#ItyiebWbQ(!h^#h1+l8cQz{Q*ysDy2S-*Tp4zYSklj$o?~~c
zG=u{EeQzbkh?3wuidFAhJ!z0u==CVWoRJ9U+3P=9-Dc9)eKHek>_^$T<uDL}P;^Tp
zI*R+>SUrA~N0YJvGjS9I?!&s)o$8Kzjv{G%FH}e~vYbQDA{Q|9yaFNNU{^>pvK;7D
z9@Y1H*R`xXsL*D_B6&8p1ShCMMcj!#z^Kq>#3Fh2mA`JlDI(WrR5&xD?mjB>ChCKA
zGETA~l_+9?Jg3$WXf1e#lOtnPtq@zpB6%JRg!PowOenhc023OcQc^o84|he89_jO(
zpm+o;tQk>XMIu$r6r1K^Y>&K^Na9?x1_Cd8v@2E?cBI0Z5ewuY?9EB<<<Xw#Q>1JE
z-tBFfE$1gH9SodJ<5+T37&)?CQ%5io?)$m3q4;QcD^KFxygw>%Zp?}`ajYK|wvRX<
z4}(3qTv_A?lKrj(K?~%$Mf-#kw&3O@-(3lU7RqxqfKac5$efL8D{LRJP#z?V`n{2=
zGLvpYh3z8_%EL?cBymi%pc7@QS0drJUe7-Z{k-57xr1WIW<aw@u^LZvC7^C6{(&@4
zyO^W7;#1)){h{n^a2N(bD10T`r?TGvV&iL;Y=}$B1qj(JAikf+ABrMwXZoK7sT4Vl
zopN-qP?8jJI|le;0y&s?u;#;Dp(JU=?Of~-Pi*FV2z!?I_#1l>mJ|#>na_S-W593Z
zqw<R^+8=QE{LbNZy0IkBeYZk)QpD}BTb(CZJ*?k1g{eYGQd_)Tb+13ifxcbNx>q8{
z#yHH=Hi{~ub}90xM2=si`Rz-i4WwMAc87abf=6#x99p~zdh0!#vP){OaBma=J1Aaz
zi{TCbb!^=IdWCzV2-v}m+)uS%BX5pl?z$E3jUr%2ozcdJ9Fz}tlSsvgNQ=i7w&8wN
zx9&H{WJ}m9tR5{6Ti&w#Bp{9scP(dKA@*pM<MD|S%|^qId*rk$wd4n{)1CzSTkaw_
zhxv%rb;C4R*_5|e2tr!GIcRV|p}%-@%<RryAqXjgb6#xl*{9k>&nxe5DyBw?;2ey0
zPU<L@57%a)RUscKf^z^3^Fn|7HC&s0g%vi4`hauZlwARi1R)6fl7gu7|BoGYlgok3
zW%~i+pd(dU`n#3`_i7)wJ)rvC@n(+G<f(<6AmCT(vObD^Vobb8T1x{p)N^8+MeDS3
z?Dv>NTP*>Z$f55vEe;MQ1;oZXr%Ep-0P0o2n{i}PNfi#qyV%!{^{0U9jM7Ub)HpiW
zny>*Hc)>1ay_iTxoN9jd1A4V_%<qcdhDltBmm_%ba3BdwCYY4mGiNea;^p*t%&Zs4
zBD2_jOyWwc9PvE@F_wY%TvZGhM<z|(cRq!g)gVOZ1v!k7sA=lHgHo*H$=wY7lJEbW
zk*I0p<xIe)+3;|I&YE{j7$KQz>L>vJ3h=@{6g2&2?Dxft%4J9Y&+ZOZ2a-+^6JgeJ
zr;RfFjDlp(ugewlhf%=kA9harW}w$uj^qzw;0VKv9W4;<3k)Nr(@4cR^<3X|NZo7S
zpU>p3NW@X}g++BrZLgyI!06~S5^?-i)zRI^QMFV=97c|&k%)sr$y}%3we|l8{-Nv&
zk{|{_*q2r)TK@mBO`N?TbhdneajZnBA^CTVuR{QR)8TN`?B=?QRd;|oa&dT*qoYP4
z$qHv=d6qKx^U4nabUL~5InaDdQTm(U&u9BSbcE?;0z^XpwU!jn(YazGA%}B1_crO0
zh3NTi>`dwDLC7K1O1R~G&MZp!&bXUebbzINiqUg&Y*D5Zx`Wgfvhw1w_TOLNydNF3
zv%>-Xb~Xn%CKtQ&V$~g#ib^|tpr-1#;#OQ_xTNIi%ynsG<dE1#T{lv!M)6y#GkT?V
zj6}+QvqQpDZ@Q??I-^%=M_vjgMfnQ5NG3|5J1Cf(w2TZqdh6;e7-5~kD~(D!gE7Zc
zN9FpNdDWeCk2*Wp1OO{;97jtm{wDGx1V)t|Alx+i+8NUFlh3ww#<?`A?3mz2@GYLn
z(T-FIm$9GM9T{>+y2V*@;V*$z#O{DpWaT&t-Lc;t*_~$97wh=y=nVZM(gpi5T{whs
zrNABdJ1n%8(U^rs3cD}JAM!l{ekr?x9DqR(_N57;@c)mEdIL3)4-mo}6)ffB$jBkA
zy~ev5cD#S>&GtPYaYh*+%%~#Qrs~adCAE$;)`7;rO4~r4UHM8XgJK*xIUg3xLSL1<
zp3!gElksaz5-n$<jkt7!9nj_>-j&=Mi8+ps&@Nn4I_SW(7u$EgBQXaYw27&J4*tQL
z-&ep%Dm&0yBqC^B%|jPMD${cui8&qDc*X6Zbx`5y#r8cWBMEad*4IG9_3NiZRRNr+
zvm@*6b)tmA0-p`cq%z^gk)7lA2pe}Dcx-e%e9H=)MRtxslSQC}gZ}>BXpqW;8*BP8
z;j&wYdfYgy-IdB18b^B08nm(@K!$dx&!jSi#)+YWo0>sKN<XMhKiR$qB|So_|2B$l
zou``lV)=SZG;g;9<cQbW4)uGRK`QfYtceHEuxQMhGBxEF%XhCwWDv5u?I)X-0?#4V
z6|jul95RU15NP-2HO_vxTLml=J7;u=fg!u%2)_A!kBKFn{mzi#HTx;Mwj_o@5O^h{
zfad-eD@(t4I1?^FnT;tL_c0NeIr1{;%;J!$#fk)hzXhKY%0b)QQO_;U&oP^Q(Vlgc
zPkIVeI^)vwa~KYIu%+AD_|8UBW$o+J43Sz7ZtV$ILwe#)(U9EH&n-{SnXrfCqeBhJ
zyHdQCovGvLInxrO4i1~<D)XuKbrE`c4(n0j1#wO{eu&7;aCfGTx7uM?l_FYjAE-mq
zcMa}n^Ooo9AOPq<Lh|m13vpgq`;JM-OgF{z#J71#Yzgkj{%Az|)}co;Bn2Nz>OAhK
z{%8dA)}<wfMbfN%&gqEr$a8fFx9T!s2?l0m-cNPpc{D;Wv#x8he?Rl`KVNFowYJ~C
z>X<|ZmA&fpeye@QB+yt1Hq}$6i6RS3RtJ-?f87glVq0LYmD97z+V{S_(nH4^Bi&Ma
zUWI<0JCa2j!N~*W4-ZTw^arHCggVbMu*>0NCT0`KXMF4XiixM|2oj}r>%GlDWfyoi
z1|@mA4y<ya9@g#^6)rIO*Zxs<X1NW+Fc7^`Ws;6`|BIE+1%gsy(ad)ML#88%%Pb$R
zdvmtK5M*TnOCIap#=Mn<*NqvLhae1u{GriQ4uxy!6|qAHePvB)cis&5Y(Az?{P~91
z$=sFBab!SZ9qhtTXq>*eXW{Sr!XW{L;w~4wrn2s;eMQR~p57Jqc(NbQUdqC22R5rR
zbilGoBW*k5t<XfhqIevVFXB#_p)79-c@uz~UQs+~#xV)b<Q{+6^NLqEs9sS#&X=Tt
zx9ssxIM=OQYMaDPUN`wF6MTt(^4!1UQ9H0dI9#r>`D(lkLZNedMesac%AC3k-bYiP
zDV$5M@;c~0-;Yua&RpHPl>@fQ>)<YpBjV*uUz-$Dp+$O?*I|-lfLilNnRaT{heC_=
zDz7tuBII_*%*DQ}iHUN)Rvgcmk@+hWuPmV&L}V!LT)x40G7<ykA`l!vH)k7GVMqFg
z<6(M<KjvfJ$SC0aA1dcyh4MhW^t^f&F73Yr|K875Sd3ngJisFf?64Vjc254|8GciC
zEy)gpFzia0$PL{8VwKXxi!pf<ue$T3fB_qQV&vHGIV9VxZ{~1Yelhn7(-0BI!`)TA
z>Bb-1A%49=HpH<w_DtSxM81^1cgEUyg=~mLWCyYfo`R4{0wFQfyh1j_g5%+mc7cPK
zKV0YiXn9mBdrFkqIR;CT3kf&5%jU?HtdGc^Zo-aU=cSB2H*;CZORUZyO**S$p!Xz+
z=oN=9L>Db%ji!E#h<krx@Bc=AJT0S#mUW&t49o5Nn7f^%LXkvt(Gsw3NOMi5BfHbG
z!jJ?O&a&%Od&;oBjf{Wu3PTcDnmwX6sr|qr^Ru~SRv404pgkhSD0j}TwoFRN3Pln(
zU{8A!==mF?N&01Vq1r=cjT`w|uMi?}L-DjXfgZmyYUmh52W6EmnBvR;6|b-#;p>}6
zAH4ROl)L?9?8lYsYsMKT-nc)0bOC-9`*}<dX0EG*Hamr8wUI6z71Abdn4KR#@f2f6
zrbl2wkZS?2G%jwaoh$g@NHifnnqHYU!S!FhlwDi0#UKdVQms+T{x^0B_vfH=rrAKp
zu_z#Ud|vs6+VQrCYRSAkz1t|xvy!RChNfd;y~7J-^#|WR{{B1j=;LXFN^Ty6lw~e@
zJB4wIxz(tgzOnW6uC#TW!J=fsAM_4CeR-au#|3R<iDkF*qEqrp#_!PCiX_=i5-O@u
zs>0_)2JldMm!9RcS&7%h_T}TRah?%8p~po@@ZpzhaXuB+B{o?duWF21(zkJNQ)Kel
zlyzqn58va_7QM|lP&kjLLg>WYnOTzp5PtZ>t?h_$h0uu%;(07gfxW3FlNQCgl?yS$
zc<f)RkzPHX$qV3zLh3|D@z5KuPnMFS5i4+9Dhj6)Yjb<$j$agk>322HS2&&6tg<Xv
z(D4Asitp%V6iz2r&oV~l$I`dO<D}efr3hYGdM;cJ7iaI4irY}wqR0@QMZ0HTHg5AU
zyv{mR;dEky@L1F*=B+fb=;s@Q!s$eY@C1~JwyYq!sThGMq)u!Q9$wwJ>?Yc^pJG?z
zjf?q5*}3I741-W~OR)<v-v7qRNk2MZDh(U3tSG$9ebi^i6$o?8UTfi9zKXij;bKaJ
z@L*e_Ud~>_{MyAnzr&XlOMFR>mm6Hu_NK7t3Ok%ei3lEKWeotq&5ojYMeA@HB_epx
ztayY&^;N&fcc_Pw%(8rvW^a8zo~*?f(%~LTQrNMl0#AzCGA;hWPTLkyJm6e$OXor7
z(f>Qn?qt|xmNh0m7X$4p)Kv99XaD{tku*8k_97KNrkw%bN!_-Sv?tng#?XG0gbtxm
zcA{zBklzRwtNi7(LkyG%-Z2OSz;rK9vsaNwI>bOp;2liKChgRuIv4luB)|yX(Fu4F
zJ2HhNa|UFGUndd0<2^lEe`CPewNva~JG3~7=p8mpo=H4&)9;)jbmiGU19B(VkB|Bi
zI4QIn&wF>0YeetxmoOar#Nbuo6j;;_>rNti2QtX^ff)PSbrrK^hju3kz2hA>`vdRS
z)|b%vJ-HF>n$SA~)f$g$0diDD<?fvQCo12RommpZAP7XSq)}Y%f3e}^4>48K7oaR-
z5U>{tOzeZ&WX|7P_Hr<VUuGo`wF&|%h%rBmv{T@!1dcC~zT)bwI?o8r(!o}^WmXPG
z2;vHO6^u4-kT=Eb%p!P)1i0W4c&_R#%OILUU9$+@nI8Os*F*T*L}oW--SLLR)V|_B
zIKVSq_M|K8KI|ls5B0*5fyufMAQV!ZMexo>UeRlLuc7e%&b_L_in9pbS(6>#@C2Fl
zTw)7J%IYBvS)m1Y2v20#9D6FUqX3qdPcVC4zWBOS+zKnsB6f%JZ=#OG;YM8GpV*&g
zFk*Kw=`G0KdD+u1Rt~0c?kr+=Iy%Ar%K-I%?}mS3f3G|Km%OET53<(A`#k;gLt))n
zJ+vXM(fHLDHlM%cP?&KRu{)kh{Ic<l8s4v7EUbn?V6%Esn*H>(_vyF6-Ab{QJouDT
zRuw00TvqC3x0Os4kvm=j?g1QsdWrnx*}zaZW_IZBpqpHfpYTL@aW5DO4a^So4wGoS
z-0^dmhh*!IvTMs>AOwL|@&&s0zgQXj(eP-~*#nS`5d@vbjm=b(;jeif7z6^QGR~71
zn<*txd<SrLY>)PVDt-bpxjup_r1cI~{?;{0#c-C^nqdve2p+G%hTADQfE8^;N;0$|
z8Nr1ISSG!$;{D{FTNwh5jBxb|4JA7(yM2X_k}@<I@z9;V1@_r!UG=HT6vH+V58Q#@
zg3Vug<T@}H|IH-j46<}6PT&tbwjDFGLK(7&%ph!T?Y0df2Y6`B7;$A7Au@ya@}-Yk
z2ir%_ftjR?>O0oB&bRLUSk+H6c^TAq*4-hy*`z)Tb7W;`72;7lXaMn^jaGB_OrBJR
zSRo#@vs&Ahk}xn3=z#nc`)lvuF*^%yPMDw$CivV3ma)ICiAU`~X$x#5ILgfe<EjiL
zL;`BZ4$6hAb!dpqogy=3%A<DhvI>yGfJjB6kSjy15Rckf{XR!+y%$MEkz$Ay;!!(I
zLFR)^ZwE&qBmI?OKgf#aAJ&XO!u8-;<P?AY14Zzn?A($V20<vgrA7;p{co%se>y16
z$OfpBMqas(J@`^BnOPM%R7BGgG?P|H3bJ@);co4(pI2eEmUKN89)Uzn9-l%Ws~Vtu
zZjar>KEEq*(et4Z#1yK*U`t|Gl6REk!A%^a803oj_q~aH{4W=DPeX3dvy`#?lDktM
zpU8sl!B@$XE5MMyv)Mm#rRK;gs_er8I85Z4$4%t(nImzscNiwqBL01o38%t*ki{Tt
z+NU88<G&*Nw5k>6gG4<ZYI|qQ@oB*l3wN!s6C^rhc_ZaV*U!|#OD=nboFEa_1MN^~
ziUlk8{S%H>NCXm5JxFQ#m~DPf$+gM3EBQ5odKxQZAnl_Wb_RA6`*<azBo7`7h#o(K
zjpJ6{EA#}3fF5=Yen%VH94%{kdS&&c%Lhu>105%g2Ro~6?yFEAB*J;TjtyKoC`8}H
z-C8U31c`W_fgawJ{PkYV8$!K_eSRhp;5xhqV#;n0CRtnLN&<{v9-S581^>}VC2|w{
z{QgBQv;8PLmn4fp5Q=U|4G8XkW9><gP*U}%%o!L0NbZL{x7&E3C7NVOr36MW4<HKG
zB^^QXWy$wm8R!o%&w~DCU^MniyO+kZLa0zX#3a#*owx)D!U<QFR45f1!92T={F_AY
zUi&&YU9l_mH7fF8{UHxlf!xlL3zSrTTtr14>kr<E!u-&)t%g(v?+E8veUg8+pDw2D
zKJQ9jh;W|W*@Xom<{wDoT@|)M1yMVGiqObd?b_;z{Q0a<LG*z0_-gwt0?J(Sj9(&u
zzsY0I)6r9NdYX+a11o(Yf_e6B(w+T)V!da{iB$SR1oO~%7a6kCWiWqVu`7My0P|q-
z^;*0(1ZtBksZ{R>=3y_71_d&3&#+%2f1kD-zS+!{t2G<K<bB1i)NVgivb<xbyT8ZY
z6U4);P(jp>@fF#RHAxY(o0*=*{>*Ma*01|(Y+NX{F>Bq0szL@)|0aXX3K>MB{0?s9
zJGKK8(C7BInH4UGM*NN_<|4ECcy)`D(~Z^ikFqm6Vi<&hXiLV11^RC+dd`<XOri!f
zHir;mj~}tUrofnQqu(YE1ZJ=*GTC&l_39kui$*P*gtIbSh33&aHzJ^2R<C`@^Y=fo
zkLztNQs)=qB=#@(3<b4Wh6d5*(rm>$4Gps?6yN@eeg1AOrvO<R?f3hE<i5quWYa}^
z2Pz<#&H`Q_+Jc#E>d`xO*yR*Z@c?`n-19ONi008dbPwStiL<c<J14_{kjL-T=WPMn
zHIF9X4n<XlrJ!qpx$?vh)%`V8-0Qv!NkLwL=dmosyF23TL(!NdvY<SKr`1=j-EQty
ztp=XO$`By5_+?EiO`x#xR%XZhzQ8jK2ze9_#47eY9!{1~f&s6Y*jhYZZlG8dvBv<#
z6UIJIW?!Ihy-@X$YNHo@)y!lL$4)AUzR@`sW^?=cZkZuDI}n6{j^F4JJ5U4>#2FM$
zBj}T77$EY9onotu2ak@MU$4Q~CX%%lxt#%a6VErKAg-Vq%g{^YAv+(+&MXIl5Co!E
zns!0F|HX#qA4n(71&l#uv#KypijuHh6*{b{-xh!0d3c6x0<zMRrf5r^%BmcvmseH`
z1z;u`q7cbxYQ-oL5;PjaXTF*xC3hiHVXuhC>{xkjJ0HzT4X_h;AtSqD63?7O%wH!T
z_(aMi_ExAd@&wUHD+$)Zp`Llm$>NnD7UpI_NZ=<N)2tivD;55Vgt=L~P5OP7TQUw=
zzpVXw!#!@NEjvt#(ld|tUbzxwJZcBsB!>CXV3?~X7O6xTueq~eAuSy!s!UBv#|kq>
zyylL1E7@k|DZq4oW8WLExY+>Sp=+zKjuj2l#1&R}AmXt*&+%Wjd3X;aX)0Fe8WL1@
zrh=OQVnc<Ryq$_i3937Qav@UDj31Y|D})URz#SwqEN7tgrI$#oROlMwVLJ#i(c^;i
zwX?ss3SC1yYzH(@Lq*fF_$kTvL}iYX^ng1zk4;H78Q?s>to-V`yF=3Tb{Yaqc*s;-
zrNS|h?y+<V!)e1Emmcz-KV@fjBvA-L(UhLeVw-<r!+G;1VpWp>Ww{{eU2dW8^RZdk
zA&o%$Yc@`~8t-sdT;^_Jq|c-{!OL_NWA0?A9kKILFu5Ix&ed?l?j)!ku`}`L1&Icy
zQT&(4*Zq<Fvs92~iAo2}q?7gP9pZ}bc%4`CbHp)>10QR7PIf2pX%ZH|+EifAJ1#QC
z#_nXk9kWB5H{#U9(D8mK`sxmM#S>^}M)UiPEP|-a_!Pa^dOE9VNwWrxcG@Q6qxJ~h
zNv#R86Xl=2;?~$=KGmdjns!a5%RJK=x3G`GMaw(P8{ZK-JVjwV0$O=WaVK=xF|NrV
zB-Rqy(pOVm3&?qg9^(nJ1Fmo>Fid_7e~EmZZcA@FphVXg5oL-OOWDb=mVP~=nm6nR
z(EKfaJyz$bVF&F*o4S<Ajuu4i6#n!MsmGIz))Fjr<b|Tj{1!{u$=}IF>)**O8l3qV
z1zDp*yzykC1(}gb9IbY2*3WTw(yXQ0)tqlg5uAOC-t5MX`J?O#av%sn*q6jnkpF*d
zDSJXRkz~%qFbX0qJ==~-1QT@j2`CdNs+(o0@K<;n#)F%sT8JTGJVU1=FBJj{Z^L*9
z1U_11WsW)IdozCB;1RfE8xYNk1?CX743v@zJBA~4htv|~vNGu#|JV6syAlU^Q$rsZ
z!JudZ>*3WzD)LSop*tjiaCZ#ga$d!g?Q0;6&>dVb8$mz@M85pyDivN2N9fM@ETgF%
zPX?j%WV;fqB6tT#_U<ee%*)OI1gS_zaRl!`F?pclIXy?bt^4lpcrr<Sc9=Oui4Ph~
zQXwSqCa47_h$Ufl;nJj0BNbUHmQ9ZtOgO>NQrnJ)`2|uTJ8?wspo3wB)bKN8b(H3n
zS0Z?X@1UWD_No<4Q)Qlx{i?WSY$}V6^6!XScK<p2&PslW0G<w>67;DSaPKKURM=D;
z;X77a;wCZWTeFY;V)^cnm@iuw`vJ{EZT3cmq{R`s)70`jwAV2Y3g3J&eqXk3S}zS)
zBNxy+sKrTz0p>45Kg!O<HeeV8qAU3e_Wp~Nmr7MJu@n|S4gyT@9rwSB-8_=FiN8nx
zX8U?>kKQ4y*CR>=eXaH#qa<^udH9ZXQewXgs11=qu?}YFW#ZvGgD3L6?9_m1=NHR&
zmv}z2ncOV5-H>2oY-jEq58i3gD{6v>@7DE_>lxabc<>I-A<a5L0G%2a7-)vICLX(^
zT)?0PI+Ut-=uBz#Qd+EMe^iX1-_&S1Q~K7iRC%-DhlQr*>-Lf}na3QD<f&BZZD(#z
z&YzYulr`DMxW~MqsE%9hT5ZM%$#B2K19_NFS;qq|99=Yt0?nG?f61YvRo1k=elXg#
z+B&3svVP4;59eVV!#Zfj7_+>Lr8PqW6OZR1*MX*?)`4H5T->Ym`_Yf7kAT(a139-5
zWSBG~-6O|39z>3<0|fmwBwEf?R}bf5zeNWfr@#Bo+ZWq+hxn_~Lc>by7;uE<{9^g$
z4=o2n%l;SYMDDkh9^)@jxwRbomz!GuYG2ZsYrceE;%`CyDxPMy`bPh8GC%oC`5(&8
zC5d4W1jAQ~G>W<Z#meWV17as^yI>qc0)_wa3q2~w_I!}*gFF;w$@m>_k+l-}4vwk}
z2C$D`ptANR_W44B=!bnqtRsPx*pqdiR!D1l1&phe8g^#`lZ}=n_N=6ze;o&&OQ>8=
zN!slSX-&NpkKM;$I)E{OY}Vsip{%JF;$f+eS1^jYi#EB%E)*Q~upXIof4Es%kC2!;
zrLm7W5@0<y>KN9wc5BmQk1Ul_2f`#kW$XhXIkh*D&u8`{o-V9&;8fhNPJGO}0Oo1v
z2}ozdg@WJyGFAwD>J@mbQ3cv$*MG~{Tuih=-_xMK11kos=fe2!do!(&?6gHwJG*Sb
z=u|SuXd3(c7`>@ohbUy#ytgID{k(~New3b?g-Wr2hrSTTO75gm3_Owt94e-vmM!)_
zVJ5LF<sf)x33?s?1ev8}u`8eK;GG3(>OoI)VLFrSE{tC^V0pUzw7}L@&DxF|&<f2?
zC5(0^eKx>fVXCpW+kd%mU&^i|2Z9g;e#t?w+W&uSC~pFtG`BgCNyh-CwWQ)9ZPM2T
zM|-61QH7nRO-Bodo6AG4!(<E^ar-K+&^uZ<1REapxz4%pQ0Qs-aSI($8E!6*ZpvkR
z3WL8=;ZCcPu(CR`(YXh`2Y<!3(@~TmP<hUH+>3OzU0A}Sqbb8p<`HFFE#;VwrvzUr
zzc#8FZd{EzdLC{gI4k~kr&G<q9ylKyM%%XnBIxRTkr30PLf!Qln5k~30fyKtKGu4-
zI8SoOl{@WkhS$l-@EgWg{OnlSq~e_(HA7s8%F%lX?Xh;&8JET1&q#<1q1Pf=CS$C8
z`Z`KA%<u@JwwROR-$X4%OQ54A!_DULMop5&@$q6L+?Ud?XD^U>$nhV%XCPsyy4~r>
z%Mj^2pyvtW@_Z%9gUmX6YasIosGy=J3~l|3ji)1BLm=~z?C>1G=fJ683ZWA}gh1vI
zal|wZPwi1#UrN6o?wiabw%PU=Y)qt(=U7K_2Mx)ujy(R9T}iG5AqYH^+E94^i#^Jp
zzYsK$Z7)a%2T*J91FDT_&^(ltV)F%&Wk2+S76)Cv(Ox3oQ@xi+`XmXhyKTs+L{<oQ
zkO&yyJ%IOr-Upt{)lgx@LBgt}Y9t>jnzU|s34P6p#5D;zZG6;Z(}T?}DvUcwU{CVi
z^3OjNmLpe+LXh8~4+i*B+37@=vt8laVTbW}F33LgSu$tK6<7<vJ?to+PS`V>5>-$1
zVUwyb`4B)nN=AscuIv$DZ?W%_WUrFza(KDbg4@&~c%>>tQ!Tz&`@U++gfy$R9D`r~
ze8=(dgRa9Qvp(N`{5qODjHk8M=`l8aMDry~g(HaIr!~c>vP}C?!NG*|82p}*V0Q<u
zM*3+jcwo**r6>dtPoLD+*Up#P1L6=B0wMy4hf;%-)1-4i-U2HeLF^D7Kf0?e3As*-
z>J+(B6m|fQEcOj80Cfopqyk*w-XW;(_|8YG#l<=vPm%ALo&oPcpJcF6BMT{)gnxG2
zkFqPskr)PHUkXjSCjbA~+L@77fpk@lb3swc00G;)I(C5X@T@H7FHJnvFL`JD@#F!(
zGX#elrarOFpLV$LO3DcU9xdTiYm`o646*r<Q{l%U0C@Or?_VAzgLivp{P|i!{i+qr
zJUi2wCw)Csn0G+nYcWfL*WURao-@l@qe8s{0$hM~yu_uL;5BZ^u2SLNVaM?3w{+9i
z#+NxP=}#YxKW2si<GB|-)6G80TR9L`xP91RJQ}jl!_`cO3Y2%oA5ZQ<0i?IJ3Ri{Z
z!Br}`!GkiE(f9Zv8MrP#1eFSH5Icy6F9mwGmeNb9DeL>7!WzU5;z9FU;E!7ZZPx+d
zSs@L=!@7_)*Vj^Q2E)9p3l-8JeB*63X<yN(s@R+!DvUwwD4s6SOLawg=`-UmD~v&S
zz`HV-u<Ge;jX!hru5bpi!+83H;>gex;5zjODx5*=K%S*0;`){*q-3&O`LECLs$?b}
z5=4RcA^EZ^|HpvivHOF!76txKF5_R*F}D6vb}qRN!ypvhQXD&g_rI}n(m@60Nsmr4
zLze4+A@}nOoqI~)4G*J6xeGs7?GW%Z`)MiX<ib!(Mp1D(1U!up9<<Gdt@+H?bLh;h
z)|u)?1kY>T&5RLP=emk@ck)QY?|5ZLI&Gs~ij2*9PC9vHXZs#cA<G~BEA;oZL&4Le
z$b;0NY{mxr)cw#7|4t)-XJL&ic$ayP!${^ovHz-(79l*?bG?qrUb0s8A+f{1vk2nR
z>r2{)c;Zd*`A_af7jIFINBDT?7b+w|eBX=McW2!Z>Pk&m+;o_&74w)5{mvqeXL23!
z#p8Ie&U;#i#b!y22Z=iIR$<|0bneH~iJX7~10#j&WozxC^Xt&eEMj=fyH#C#B4Hxq
zJlWcbY)P#cm^GGM1FFJNBs(NCizpuSgVc}R<LRkV0o4x4%o2*n4>PVna^cHYjHfyl
zOg55k9UyCgY64>K$RyUGuvx_M;41BJouH*L%h;VvlC*iybf9-)KZ?kmcRgWwfJMr_
z%|4W!ZL)<h2t&7IKj@A7-`L~$>rv{AY=G$~1gc5sVqH)I5>+&2id-H@6w4g@*yl#4
zOtCBFzB%(OIJ*#lhrv{{6uVOJZR5Ej82U{#n$0o;L>0-C+NPnrxIFnB#V?BaE%tkQ
zZ)N$oLOBRp)1A2v$JnopGO~FP46)Xi-eBocriz$Kk;~Jm(oV~{uEUWF-@X)yJjhJ$
zNkuNqxDRzxLBL4l5e9i|JZ+Eq_;BtD0>)KZj!aPIF@{>o0H}(NN|DBMKbHi|Bl@!l
zCmp+@cT%MBw8j;cO$X3|Q-)LoN!t8)uxjh9=95GBIy{jIMs0pP9Tm~^Dav1H`xN;-
z{h}L>gDJPu#ZHzrzC?bl#s3r@mZ=Vu%))-Aof4!1t7GesYvBK3-rapx%kWf@BWY|F
zSxAxWnN)1$)T@AMB=F!DE*AZ<RN~Shtt;>p89d#*Me?{8TIT$XTNOQ$HWm**#eFoj
zp9AYbTdRs9Ns-6XP$PAJCKG#&JpXCa4gFDeEw~kgAn;0lSe?E9#mdk$FNjS$7a$uH
zWOY7&#6HA7C_uC0GGkph1W>H5kWoCI4~`Ag_$Gb4L{=J9M)CN71`3VRdvn~fJp?%v
zWEju#IRQo)!Zs>r4GPf-8O8JPR<e!dCD~W2tEjZT4B_ExQzuf-_jN}FdO=|!!47$W
zL3=_Y%#{?inh~W(*&#3Bvo=%GZT>Uz?_Ztkkq_<^i(R0S)g`vl{W5@Oac&~-iNc!~
z#|J398yxmo?AkoOC^fa~9#OjAA;lBZq|uGfJ|x#qWTp4nc|3aOc=sM_ps-h<uvhS$
zE|Z`I)f*a>mH7{azk-b3v1a}gIVk={6XUu=6#fb_d}l|YzeeJNU7R4HuuSmGbBDm&
zGCbeyqSy|FvVn}>`L@Fit>O{tv?aDu>lwd8JQEGK!`*ZD`s1OHHgF(#f*3fb^?38V
ztff+s8No9{E@SX!vH8$&iLKORM(|L%nBDJPF;QLetyJX?fai;{Gs<BYgkk8F+Cr&&
z|BKD9(xin@Y5CnpgkVkyv7Ijyp<%@162U0iw1{27W#sSB7VMX6Y9FOby^PC>K0(v`
zEE-Ce>r>n__6060`UH(2m_#^sAs+QbZB>0#<O%vE@Hlj%-_#$cg<LXK=JaU9am*LZ
zpoijhw!GpB*hg$d?r{9E4(WS(WmQG<pvc_0httQ!`z<Wg#Y;d%^Pn+J13{zVuhlr<
zO{7|^q8(7A?ri?WVX?@8$C%Hsg7b;H<BaDb9nJOgWRyZzU_Kk~I3z}+JZGO7EESN?
zzB?#iaKXE86xaWRe*I5Rq@8`hWg3uy&UWkzBo@R2iliM>y53`EkUB%9W2}e=6d5~s
z9N`+aJqBmF5xI>0zUql^&Nz2p@Ys^R<z-j0-o)5B+DTJixMr^!2&zaE6d5}P%gME#
zu5Vj7gsGxTP$cZQcoga*vNj|B+CQ=1_xqj(TRDS3SMJo1sqw3dGC`59W3>D0fPCJ`
zTiL}+6=8xRVTS=j2ZYYUb?Wjg`-ieK%7GXJf#{XmwZ-B77h9fxh?^`IFow23@j27k
zcOL72N}$-{vFTAG(n;GH*8$$1%UXBXb$CY_*U6;q81fU<i@SSxR30Yfo!bN2RCksQ
zkiF4l8@zmtb*CgKsVrmpjQYMIuy6`VrzB|RsdGF>+Hc1De%N)VCS+bGnpI|K2yy#5
zLMY+x5dPA3HwzV30}&wNB_tgTUpukG^NZ>p32@Y!(1Gx^0Xv3{08^cb9F%J2?m+n3
zkR6L(rfWf>SXh3_F}petzBb(*!{;@=cJ2wHx1fI(|M^*FX6MG!<QmaCEQyG+awoZZ
zYFn2Ox9N_y)$UReI+(oNat9w3VFIIJqF5I0B)`n+JOlj~*sagOgkBwzU76HjI)Xd~
z+`&mUR~?dFn|IdW<~RaD?k9^4b#MUNKqS9&&#ca%gn=|*I{cinh<Db`tj_aBL+A`(
z=JEfr!-IQfb)peLLD(^@m``QRk88g_*Um(%-$K|z7usGGv((=}_?NOXxPll2p<qi9
zqLKa^TgIEf9%z8aO9Dn1KF9XG97OcsfO`DStFubm|NXuRx`mhu-D;aibf=qShc&mG
z*I}vEq5qDCS8<c<0NZx+I`29&(P*7Lm9*{dP}LSxcNBpVg!(-0tGZ=}s<tPJVEKQs
zoTfE&L-xCoPwXakm`!KMlRYfMzr`oN%&%iS3PvK<;;D*suq9UjzXl;-H?w0DEoBq)
z?!OdIypyeNX2)1xj+)J)bWwCtzuob>sJKoVS<fic$xGXRBlCuK$S2I~>KbI)WVw@L
zM-Xu}rAfvZ>Z`MO+Sc*<3$z;>CWn9GXkBL89hBVyva@9)Rmx&&#D3G6)<M}V?9%d6
za#K8FY)vI^7~36|-NG&{B``frb5|P0LEoX-Ehz9HHtHEm$9fU!Oi8wbvzvs*<XJR%
zc9@A4KM@_|+-`8^1+!$99tD)0MRH2pf5Y-t-~lN#zdsF_4@m*vf!R$0C@>ejPDSu?
zR-bn#!`|Eu10;S<{wO<}T!}##249H=0{H$HdogcOk)+aOH>+q=%1`KLdoWFAr?o4K
z;7#t(n@&#*fzIBNDPIB3;oNtq5$c0+qz^+ZL+uK3j+@=-40Re**lm4A@&=*+IKXFV
z+2C&b?_?q+dEOP|9L|7;A5IygMQ{8>l)fuiI2^vSDFtq1NrZyZ{!8u8<@*MBCRMeB
z(s-5BX58c}$T@C+NA2i&l5p%e+Y^z=t^~fIyZhJYVDi*Hkd{v#cx4%MPCQMSRZRfN
zI;oa$*1JNr!&&iAohr{<$~~#IWIQYDmAB$iYh10@ZZhX<Vf~h_ELYBpXYn#~Dd#0+
zU~$K+fbAI0Vn7+Hcap{=DD8FyYlk!Ap}Ukde|EgJZC6)3Bv-h0+$4_-o{nkA2pi5g
z?NQ;{;Yc2)H;(`Op(j}Hqe8XAaXi8s2+_lN&De9NwLce>;XRhE{}Z}XT9Y{vy*?_`
zJY2FCJ%$NRk?_>1@o1G+{~pcd=KZ1{**xkY(HISzR{wr7?t>+*c~20D{dn)f{wO=Q
zT#G>vicZP5GXIHPR&R0=K@<7x4{0dkqszU2p(CBvcxw%v&-m4f^RtK?zG$Qy8mdR1
zQGi>ttK~Bi>4e>Af9TlcOlh`yN=T#)?nDp7UaE*9gEZ$uJ|cZ^Cwj6DNQyict@GL6
zVqYuJDDogmtLv1kb6V>2CGxfUjICB>v>=iXr%^qKBoQcIjIkD7s^J2m%eOV<CG`Eh
zr%`|_4ND1F&eeR8L}msf$n)=%lxwLSw=v(nBf!5HK^~MjvhD&$`!>cep|3?^ZMEP>
zGm?xWO=n_u41LY^Fc5)$L)70A#<NQfDTz!wMv*6LBl+$a3?PO468fH!Y9v@$YK{-*
z*4h@I@5rPxj146;Bhq0-XU*yfQi)uHkX?~yv;<zq351rR|Mw!1I|VY#1~ajg)y*pa
ztUoiA$ejY&$sT@&t~>!$CtRaXc%*ypXip#C{qBw_!3R^l#J*R`HZD0ZE&B2-zx#o`
zmdK3-+2Ni7+k<mJlXPfRm-`BTl$~1+10f6puf#%u`2H7bX8%a2)La0qRy<-DJ3mG~
zS#;X|`GMn0(xvxpmQ=RElkUN%HC;kA3j2{?cU18!D8M~1zueX@n?02d6-$9mwr7yI
zvlo8^)-zA-3iz*+?OCppo=G=bubVF}L{-p#1-QqBJjsTXn6xv`8*GKo*9rH$y(J!2
zJujE-^5K>BzJp!Mcm*&VKkE{Pt_nr35XQ4<K<PEbXVRVBa@k!0>2=aQ^n`UKJiL%#
z!Oy&#R9Jdh%Ku<v6%CJ8KGG^My{yNh*w7*E%|y8z#l50iEhN2ig)BgQBH}X9rwXdC
zlkp*WxqH>UiHdnHVx)rV>tuY|qMP;8d1}Opa{2Je!Vj&ruw39#qPfw!c(PS#3Ly(w
zS%_DcXj7!%>c7E%)@=dwfv4&OeNR^_E`HJqs@M!<NnLt%ym^7aiIY!=QMt$qsE=*q
z@|x_Q*)FjIs+brQXdhQn*wtNJ`WDdJW$?<57-%0r%IEbgeH!<K<DbFvZ~0PoCbkj8
zAQWwB@J;`Xh36<z@FAH37LAY>1OCTf@TH-hTV%mC(pr`F7W{fz7LzTg)98SY`2_K8
zI3<k`F!Ueb=X(is|H{Qr3vup@0;W|#*$-XhPS9nj<mnuw47(W3hjS5`;XTSnamTO{
zl1j~b&?wRfOGG`&2c!wy_tC9mOY#!=^40VQE^@{V0%%B0GWLADUu5!mgimQ&3-d?i
zhTK(zG{8QQ&m(*a(uvl-Hk4vcy=#Dd^6O0FJPX0?qR3;z<zWgb63MpT^Q1{%fb7$I
zI~2VDwMD+gRSVNx*7Ut6%ljeUITCwu3>ip8+c~kJK~MQEk=VX_g*s<{boLH?v(Gz5
zzGvI>wgfdYpr1h0cmA;k7%m_s9U^3!9b1VOmZOJeCqQvQ(Z>xU4GW8g0!W)X$1Qe`
z#P+-`K*6{yLU1034QYVnV!uucUeHG1#sier@e;UR1ADmv9OgNI9lq^WSWBcxd0-E(
z**!C2rz&HIX=#lVDG%%+8QG@EQh^X`yQv?_&L~HM5Co!E8fl^B{uf)GUyC@&Z~<bv
zr35Xi9@h>?Woi#M0!VA3at7tDuDb&y<8Ww>9{7Xv=^k0S#O?seI6RseM8Qdgn%KR(
z%6Y@G0blye&0K=K7ly(0+1a&&QIZ5e;&Y()h)&j9?{u{TBmY@FW49jBH%0fZ@9n)p
zJ18RAb`n()4cOztq%uKVJ0OxdJ+VV#XS|AelxY3X9SAu*wW6fvdQoP?zs-`nc9LB(
zCmk=6fn3Xi3R^z5b#h%2D}7A#Z4IgaaZzz`>!kW2#$zzEmS94#W*sGR>!i9I3|L4e
zaaPT(I9ktj>!kWY=`nQtTw)W-=fbG>h7LdT=y{xofka2YkfDp;*8LSlGNorkvS1&L
zf|A~9H0$6<ru0M^57&KetDRXA$2vgr94W~`04)X<UtMztM-E3VQNl*Qj#BDRk-z`N
zd_W2VVQW8&GmBeecOWWrd2~dn%3D4S->SCvZXJ-yOr9so%3;s;3!WF*H~(oa;*YX(
z$&nxiVd$0eAq9Q^i;Z22kpi^TzCaeK#2E4l{@0Gwdg~BY`9zGdiyL-Dq7ugg8+_j3
zkPpk-O+nNZk-9k^vpwIc{ABy-=0dt6Qa8y1C(LQ-gJXyhD65ZhMWk+!2jLNi(&(YW
zx)PTwm;DBLm@<*Y3LL^ujAp-;)aFKc;Dp&LmQxx|QzLOjNG!ElMmBcX1nEKc>(xfN
zA|(mqfi+|M(FhJUs!WM1_dPK@*al=CtdJo7B7gE<7XQB6WrWY%Gh*S0@22@>yZG05
zlOY~+WKL`X%nV{Siz`x<CTk&(EgU}x_d<|=YRS(Ptx6ovc>nw1%L~U))(9VpTBXri
zPK<)%f#8f|TfIG@s8vFFASKT1`f%UNNeM-(Zjgs9Z}36i^o-nb{g|PMRbqJ{D4Wa*
zJL8!*HZv5pN-WPLxw0O3SmRA9ODmF+SRN!!W_;v>(60I(9EzeOmWMr|_=w;Kd(tr)
zq4<-V<=LE7z^*);27T&gD{6J4JWMA4C_A@fi9r~KwgiR*+<#-&ho4;xJ9E{5CxM{&
zA*8xUsjod3WjvqCkx$NA?B7I)+8FVlS=Cg!#XFU!(kE_?UXgtiem;>EEZLbnv3K#T
zhAIy|q;o}F!IC$1T_0w^7556i*mAmXxuBNhtVM-mjXRD;+x7Sry8=^h=A$!Xi%&3W
zsf)v^y8={6p@$h3$@hcj7!!*lxB^s3qlY;~9cXJza_{pSbfxx7Dm@Us;ujyQ12^^3
zB5(x-lTJ_M+*poLm$=0%TsBn6+Ok#;(`8yGShSoBzFX*@Swz<Ad6*d1#lG(246VR-
zvez0>4l}P<#mdD>%3T5QB-VqTY2%W1ByRJJtYGX;=fUI`X;TC->*eOKyMnPhou`9V
z+_j36Q@j5!_V1k>$&Un1YKv8|afo2JD;T?Td5|_}%V~Ap`n`PGt~_-*l?XF<qr9y6
z6r@wxOHlwkad}8F;gvKiC?~dj2c?&yz-%V-7*xzitzb&oJVGldo5?&Yjpg5C7@B>r
z${%HCnCw6Z!r&`G#Z~WrvBziMAHkg|7hpQpjS)lgU%Y~{GlWqJ?sy#nAY-J;6%-6g
zp6y6YuJ`!L_<pJVx>16X2hua1ZR(`-*Lo^mfvTY7!4Y`jN5!4Kr<pkusX$dw@-#BL
z{J5OF14!bUCQ?DGpyX-h#~B7pL|NpgfP3-xH4iDV<drh-H}_W*yJ03$!NL`Vb{uCs
zXZe~x$r8gvDv%YFJboGr>F~~xvBk}Qs8(PlD0$2ed*6?XOT=ZD7X<Z8&4qgj-Pqm9
zL$7uzUIDBXye56Y+vfM5+@Lnm3SgbKJ&YHaUslGzE$Q;BD{yt{dWhh_z#I(UGrp;I
z1+Z3df5jbyc?(-jSN<}!f+?r2$H@sIIOf6olfX(Vc(P)82n#w0u9vJjyw`qXntIB5
zoFDV(Hx`bh^QX%FwelH7>HKvfknZOEcw9cn0tl)cPnP;LzhUmT_`dSqo0Y<6?j3o3
zBo#BEn7BhhL{InbB$->g+?8N3xoqlp5&a)!*LH+348vCPBTdr%7sK)g5WCzV2JrRT
z$d4dPPqE8r3AILzGPxqNUOlf8JbFw~b&!unYDZ_XKGMja$i_rIp=g-OqVu+$6}Wvy
zf<=!)c97MezMS$}FyFp9Vh9pF;CQy(F*Uhl3AVmUIfNk5BY05_-55h8KqG6n4wK-}
z<5yh6@2O*gx4ia4gJ}#LPd*P=F*lO-#ujLUjWKxC%0mYUdt-$I9_<fro57@(>mF!e
zTn<a*rYt+e8AKLFkEEJs%m{{CiT>11bPQS;J<u|d3A>DL!aKwntQS6y#m9>gex^x#
z!;CXn*RmXvlK(LK)^w3;u^Frvp&o~iZJZ65GOgQt`f~>CR(e)!t)hcUT_^c3_|MvF
zRe1mkbO!&{y}Ezl5NA@!Db)iVrz;-aux&P4CUGW{6o;*8xM^IVo5YmR3%fI!q|kbx
zxP%3t0c6Kfc{t!qHu>W9B(431sTBS<-eW>7uH`C*$E;Rn%51>nmB*P`U5;u9LuA%B
zx#vaMx#ds@gFtjkLZQ|DZ|s7(A4(aM*}&0|q4Y5=f0gG`CYoOS6_vh;I^$#(Eo;g%
zpMbDAJgw5#UK|*^vApd)G5e4!Pw716xX;!Yx3Rq4Jx6xZ^iZSaDc5YWld&7isC%$8
z8!lLGoNOK(I~Y%}lm~lah3bB{w^-S$c#jE_oo|1S#h4O#lS>fmL&9Wdb@;3!ZB$V$
zZFFUg@dQihxOJQOVrI2+TGhpb$;^kxr(8LS&o)^&A!vPogaMuK5)4DR;O{H~^YG+U
zjC7R&g9L(9neaT^HU-q36=KXl7^UK42t!f)Lpu}*tC`WVeQ0@7pc6;A+nm85EN3Pw
z9LiY-6K98N_HN%3bD)^D9mX&y<@}@U4sIBRVIT;$lt>hh?!U2o^UxaD1_*(iqXhWj
zyTixC^q^<8!w!Qk)#v7UnKEI9DqjaZC#pZld5;-a^LoC0W8ylzop-4NEiSZ8;2S|7
zlZ!^r>-y_zE`*|w+K7#!OC1MAyK$lC{u<BCo=r}}ocEaaggt*u-h-TbnLg*`wNa`=
z=vm!gd3kV*D#Qyq+uVd<&?a6%&}BRaJ(pRl!=9a=Vb6aLyC0=yU<5D-0<o0@+Y0+H
z)&&}_S>O*bz~lKt2YJ3tdDZ6e{+K)$;v8-0DdagrT^M&~H7)9}KQuCfeZJMXkmtu#
zdk@>7Nlyp2RU^Y@;|fz=%{;4knC3L5r6>2Sgt$A0+Ee-rnN~MnJa|lHH1C5;%+p+x
zflecYNFNmsFNFK+#{mlsj^mUO;uj7jgG?J^mkWt56%F&8D$6xgsuDt;`#*&*WoB>#
zFbu-Lm5Qm_u>WHH^m|CRfR(_-aY&_>0By=#Nb@nNE`>N>MuqL!Rfqk#$LO#>n`uId
zr*)(1gETvtC2dR@AvR}oEhkK~QK`iV%^6LW5w_7;tXW-NS$I};=JY(uHp21wRV{m$
z1*x4K&f(^yhV!$TKc|ss17b7LCeEi3X!H0=GtZZ4RwK@1+_{nF$1R7$vvF1a7ra%k
z&hqs7g+9v8AO}DY27+IbLN)&XW5#%%mHEI1NGaVN6ZeF;IUDO<fecR7R+$Wzu>{3n
z@HAO?F&TV+&S8WWyIi%g6xNxFPIORh><Xc}(FtbI3EjLPb3lv-*DxKC@n9Y1j&%q)
zR84mX?1owqyFn!rXo`7HnGb#`%Dxbm^r>XHqDu`foknPL(o6`el}`A6L+J$KZLS#e
z!CFd(0iha#m=8{sOawmoJBmM)oyiS=Fbo7+!p`CJUm3>(!edvO23A3g96JNbFGmB7
zmZN<N!$<Q>4zg1l!buE98bR35dYtbjIl4fz=Q1N9DP&d<k{t7S9qC%N9t?C0S?0iw
z@T>)45JQ;85GHx=Mi3UtF&zitSsTJ$WFItwu%jHKR0uy>5H5m`_Jc7IJ{o7#M=diH
z5`2sxB;qr*APls98ACXNj6B8=PL$L4-wejlu70<kn?}A{i(fEF!M?lQld?0*kr)P{
z;EkfN8GQeX4KFSAIG`B`^*?fZUqaP4Fg_!X+}hl^SG47ILYNGk^9k|79cZ4+f}oCW
z<+V{o_^ToSHMoP}R05cf>Sf(zaP7i#(tZ1ez)F=XbBTO1+}_!?`G+5(OJw1B*IqGb
zJh_Yf304mf-6KE~Y(<ty=yz`44*R4&tw+MxO1&nb3tr7c0&YOdHr!1BOff3<-`o3`
zJUGkwe0ixZWmsPnde|mw&`A%L%F53T1RT16|4ZX<v5Z2WgN^~OTCx^e%^IT3ChM0}
zP`<&q_T=3Nx6EsnQIl1`AqA8p%N}}0J)@1Pqonas_ArBv+;gF5NCBU`lgs&Hn*GDT
z`pB99EV`*u$VQRhBTqcrE}n1DU3)9?C^Vmwa!#9B4>06Hs@1AvlFuL|sn!Va9dLRj
ze~p#FldA}!*V@OQJj|^@hk)vLmA@yEi#T{eJp!l-24b}QI`YYpT+V0O3vNXPz(K-{
zIx7Rn?n&%ob_#*j7sl=F9<|{7|7S!$lwCm*10e|eQAY(?{Qt+AcoH~q>5*YvC0I$4
zWBZ%;^mE5B7QVywqARdkwJ#BChi)_*XI+D|Q*~@+=aEbju@;3zDTVi4dmYQmy*iO+
zQr`h&0SjoXdiloXdAJjM1p=uL^&zG-UZSW{{*tFN?k$m5JLsZ3gvvWcYD@t#o2|^V
zrPFrW(hJAB*_0J#ZRej%3B+0sRpH`x0S%|8sGMmlazx3o)ULk-A4m(dYikF-%_)_w
z-GPOa)U}ec?pDt4nWVRlA?^8{DjI9v+S$(q?uTAsh`QNAwW@lZs|ApeNJ}SGp<>#)
zZEvPUpH`dmzGMGrhl9m1rDRJntd<VYL=LU6(Z!xt6cQBIvNOE38WL&Z6m6i@29Odh
zWv0-cR@Tv$6d*;tL8tY&78MTZOvOtQ$u|Qw;ukd^jaUx7XDjO{IdLU|u;qXQQhQZt
zRcraOX#lO}c<&gyG}vEfj8G&T!$Xd;0k`O)T9DB@lOhro@)3+O!a^|>T!6|~Y#o=V
zkB|NdYm95ma!NaLJ^qxPOOga32t;qxq5QP&f3YEZF;l>7@&blop(K>PtZg=Csjcip
z3sA!kIJ6cWpvkl))v8d%J;$t(QVMUIZYhUaj0!Hqlgv~JS$!gxciGOI(3Of0l7|`G
zi=euv%kExOGOS>Had-2S3X!?|IbAi0Q=hOjYVs(>`44ld^-oAsHNpFL|3`CJ;LG4r
z8Pg`pA12Q>CVoZ+ikM82&%XW)+0Hz))AyZ#57gs=6|;ggHfBvt`h7_t;{)iP?>VZV
zJ&jz;H1YI(Zvgz=T;W{ME7Mht`RA%$r0Is$DEbND1BLYN3KMhQWT{IW5deVP#JeV?
zMlQ8t7F-+C4VWhAu&<-8FsK*O3l#3ota3HembUsfs07~V_ZpcD;rg9o45nEfpiBiu
zGadahT6b;{!Csu`4r=VW2?fe7<bto`GV-hmQ{H;36Jh(k@a!~0Z^JRRS6s~CvAPyB
zpi&O(k=HORV$xPLzRLmlIdhjUw9|X|QO9&Nn(swl$n&T__UE<myBV4982Urm*&Q(q
zgD`la_WW0y4AlKss6<~3JZXVkj@SlaqA!sh$aP>B%g7zgYh);s#xuI#x8YzY=yAFY
zXVY<f0O`@GcZ0f=@BLv4U{m2K!dZEEa=$0c1fd=ad1keu$)#|g^l182_C*xyKH0oT
zsce$*JzYp~?y*upK&+R(x^hHaV;IjH0f15_eStXcHovdT7Eu=ViMx>_1l%&a)Bda6
z=qNuK&wE${3Y1Q_YY<+HY*liBa_>3s@r}20tjQrnHaHdTx*jPUkwt+m2$ex+JKh=P
z&Dfh#*+jd0oG2WRz|l$dT#BYCjf>4_c;CrGKv@15jf%OD*4_#28pnkb-7;{Z7W1jD
zt&ez@xalA`hW8CCBx^0{rEj5#@*U}gutyp}mT+uIf@ZV(#(pyYKyJ?Y$vQ(y1s3<B
zqij$ztYzNk%yqTY4ZkN%Ae|ZH&pBogGKI=<l%a@eK`i1x8uZv@Hm_}VsZ5O~_XH22
z(!=UAC$^UjBVDN711fZ?WxBPE^Ax(E<Xq|I(qf&8ya2gq&8I9%XT|@}{ZV!WM-Idw
ztR-x-UekYLCv6@Hu#Zy;U^0#kLJ;Zyp>tUbTAuhOaRY$e?%uVf*y%CGr^CI0QE97W
zZD&BbAg92x4gAaDL+radEf0yl&+_&Zqb79PWbk)W3cV!WCX3snoF9IuAWmY^>-19j
z)>+zqQYUZ(&wIXDI8SA>aTQ_v#h&2MMH~sXAGMO5B6Fxz`d@UR1=5KMoYtk3^R!(v
zC_V_7ijs&6;=O~GBL6<dX%vOuT>qf>{EHu!5;-r}u)9UAr87r#scY>t?xGm|5tBqZ
z1)^+B#ZVUbS0n<Jo|HgLlLEEYUyFo5e*f8z-*7zkK%7~6HIxcv8tRs6BESqyLyW@#
zB)@hTl8l>|B^y>3<PEwyj??*dWuwk5b2p@@(Vo)&^UPH@5KRf3xf}WporffI-s<Ku
zs3cR*iuT;Lp$af*jAPwdUg5GlZ{47hp(H+%&eL9;tZylFHkY8Eav<gfSTkymtF(%4
zrB%H7`cSse2iUggvmNPMe_!GsWmj?p0SLlcas?0iZ)_9y1$;IQI1VC5$dD)f$(9HO
z>QkJCxvScf!tnBu{vyvt1A3pVO!OR}cwgRT4@<)mYd;mKXbQ2C?|l-6ddNyM#10P2
zZ}&X~aPmaEp%gFjAvZYtu|{}MSo@w?Hz-YE;=sMBUDzf&OEX6q?jMvhgx3+Vx9>KD
z`3YA3fBMREqn8v1X%)9Q$T7)566ppBk%^0ds#mdtJER+@@^l!ANb)}hmt}Wa)|ReZ
zfEzMxNC}+7xI(;9K!)^=k@>QytcmLd2bO(uB*neLx8ahW%ROEw`1YEeJ)lI8!nh$S
zd2FI7xB>Gt-&Vjq&ui=nE^`V7N8zY6n(DDD0|>8-8#c~}BgCH2)AYHQDQ6cn_2cjq
zs?khBwyo%sjxJ~_y2cGdO+OSFYf4%Qq0!3{`$gad)xx2sXmmfh(p#1kY1CfCuVlev
zqhWC&`Cu7vEcA_GlrJR{soh(_;=FFKUwBMz_9r!~0t-s2DeLQ<%6W*WY$g#=8V~aq
z6Tg&QOOgd42)ogg@=>|}#fG?QWEPVPbk*~L0TRi7zdfJugNKa5BE<b2<}>uA>64Ig
zy@o)3ZOP0WO}j^ZT)S65>;tmqQds4vnZHmUg!B*?lV-)5KWLq%Wei5AU{!jP-TBV=
zKx>N4`<*ThW{zXJDg!1XAQ8tyb}?@vIEKwMtw1S&NP)-sIcN~xLTXTHQ}j0jA*gE$
zkO4!vegjg65|8d$PM$X2IN9sXAdHI2z8f!4{w0VBT+;S6eR&&5=GHFq8@&cEp)LtR
zuMkd{HI!E5H=alUYAw%qX*Y*kjF82?OERE9&#;J<3Eiq3Wgfy<72g;f9$+?-cSy|r
z%G4M*|L)NEQ3xa#IM<BjZiA-OhacIEW8#EjVYQxs@h7k<y14*=#eEB|=6#gKT>sy#
z8`s7TG9Je^%|F<qL7hdEw-jP0+n@oWZgvqW6&GIMP%&Yj*Pq(7S<O+cc~RULXy>e!
z470b@s%jO60W_~@h#X1i$nx%N^Ok-}rJtAd+XL>jF@Gt$avX+X81|#Wv31!0|5(XP
zmDPo7fTV?D-DHTU;qwM-OAWtQ|BG-UItfg&n{}i_&I-ACsb?_sI(Us;;NFk)=%}qT
zg?NG!im}Z*e?p0#UNRt>7K*J8ii>AcLzgm?S7HWf0>NjZ1?{D-N$tL$iiscVSit3p
z%e^_3iY+SEhFZ(a_`J^7d7n9H6chz}N<BG>3L`!|v%zH**RDt#ROF9m!kUX{vc7Ou
z+$8Sh{vco=;C;C|K|tAMTSeNST+CQ6L=ADR&+NCdh_VZ6gZ}Cu`=zs|7@cgSS-a#x
zG|D*;N%v-=y%+G(>BuT@i@&@mkP4$`XIYwL>Z&}5cs~i#W)rtgpHfRx*{Hg_ygQ6D
zH=j2=Iiwz|!fcTL$l2Sk(5Ri$`$DBMC^(x*oivmN=w<i%Lwiv^b72K%!@Vtj>s8at
zd#N)OOo{z|Hs!OJx3^OSc{7ge8;qcwyR1Zg>V+fy8>P}Zq0kjFmsN}n+>AgNJ17}P
zXJaVG?n~Jj<VXyIK=4a;3^x4#V@u7RfD_W3N0AbPp{rrb%Myk-B(5KJ4A-8)oq$sE
zvKM2~z>AX@3Cmk99AOUfim0!cnb?X-_q2QRW}jU?g~*-}q$4OrmD!iljdVH7W(;Gi
z{C7<Od0Jc3Ci4r#Qhx?vm9_65b;Z^yflktvl^f|#I*Y1M+2&}?S~-#vGh?$@fdJ>W
zXi1(HmL@|^#H94Xm=fXqqCD2t3!BXK5X%CFdz8i-hq-k0^!VtX^HJO^Lv)%P*G{){
zjWi4^rr{`)-QL;+Df3ke<xw8bj18D8&VFv}k!-rYI*B0}u>lp(e}?!6y|wyq^7R$O
z1{eH(ikSpH!`fv3$u%J}Hj2&TMpOpL{n`#|*Ga<lOuYGm!aDGa(h{zZG@ZoQFefoW
zcDz9f#LDR1(Gw@!jYV(Vs;`{aL5FXYVG?13mLGS6cy$q3=^oU(>8QQtB`e}TcwaoU
z$CEej^hf~pGEZaQ<ET&qbX0469my?uj17D!BS2W^t<uOK=LGywb}h*ggdprjQwojf
z{Vz62uO2vymkU^y9}JMh{|{Z%!t*e#ef=(;y9H{>q@%EG_#1YfjjbItW9T_oDx%&P
zRV;iK%^eoNSj>HQv6Z@2G$R|*UzTImcny#cbT)!1a>D2|8(KagT)(3IA4W%8ns=eQ
z5jWxC+6WYB*Csy7xaCpw&2Iid&hIR5_A-K!>&K`K3wHKw0r%SYwT-ULI?Dk`-f^0u
zFiv-*C#~{sO4G5O5E6$kd-PYBf6;7hf=y2x4PXI)hrDIk%0gFu%^3WJ8b~i`yKsOJ
zyw}{6OFo;8#z8;@NT6ys=DaGKDUDriH0EMcpT!TO?(|v|g*z6NW<#Se#E;jp>Re`K
zk}+6RYa4!HPVU$s(`Gy!Be;T4qf%`6CQ>nhV2y0xss~9_{-_+AbvAp$xd0e3>z)qy
zk<MSKo%*ZRdp&c^p9_vDI3Z@cjudpcA+NIze77{=Cda^d!EP3^BfG6(meL~%D>WP2
zbfY7yFmb4_TEbEqsqy!7lh2p3bIEoXgkk8Gz#ky{-`JD#P6ybTXw+FwN)7mPrIKbs
z`p;?rhhHbKT)MdmUc(tJf|`QG@iEU)7~iaL&3yl|6PF@muVStCD4<kY+#2d*&W=64
z&X~PnC}q`odD#rSFgE%?hC?r_CS?t2v5QdAY2bp8rg+CAYU(5%*M+U2KMIN%RQ>oN
zKa8NBBQ43PoD`nRCOBKbI9Tg+PU#J0p=%s>0D+*_GABNy$;!?tgbm4iLkeOjIDFTE
zh7^H?ufe;zQx-&p*S79IqddB(hiULbeLtm(Pva(*Vk(yfuo;W=dJqNN)Ux-%zVhrS
z@BN(3Nj5^|S<RhoOG{FSH~vRlAT?Wo&(XlhAuUPSl`GDssPNSy%_hY?(jiy?8-#XH
z6zP<4ZtGJ~W#e3YO|q>J`HxmxyVz4Hc+;=a(NLD*>Lmy`JC_hrHFM!L?8G6-M%6)O
z$!ds(q8rQG-G=67*pkB$(q2z(r8AUa_iW0@FKwFn(om=hlcn0=;%jh%&xJfE7kTrZ
zG5jV<f0SKI7Q`S3yV1M~#n1gOHi?@l(#2%kg^yQJj3n{Dk+XW(Y)eB)Fd3sX%-yA+
zvtn_wGmM<05EB2Rnj0wFb>i9h*al<>o-UyESBDgJ!i{u@nLSutdZoFURMZpG#!0$2
zy6quRY}S)VlY&l_5%mQioh6atk8<JZO4B5w7DneIM1UPN>Zvd)B2s0<?vL!_S%LKU
zs&g<Y>a64+jg9klt?;*tNoiz1+Qg_^Z8bW-S;=YX@SfQ=+pKROpJUlP8$BTbjyP<l
zw)+v!2=_L8JA+ml1d$0h`@;f~Y=F{tLFdY9Npu^U5)T~4umZ6wd6hd$BPYHM#-k>b
zav-9OS`MWtOne)_F}o%o2p#n3IlIJC+V#8)Y3<8y%#2RCeVs%J+a=BoPQ3I;cix!2
zn6KYbd3nC?^Wi1xKwbdDJYF6C?RZMw^@IOC0X<Lx7C`NFdS|*~=oS5_h*;j#$I`!~
zR|?sZcD(1aK%d}MCzbGgp2ueq!(UQXXKx!!p?xVkqZ|f85QyHWaZwQOf3Y(5r$Cct
zl74SD)+(bj52(>$7v5Jx<<vVTy%_7!oMQuQzJDb6=cKggcR!&QLK2}B<JZD>R9=`-
z?_6>iX0ZrH)g<r{G-e+I)6nd=i8U0kNR&!2a@MmwW#ap~^M2?9$ZF`@DZW~$i@Gk^
zQckT6DR_Hs?xhyJ%(P3E8&oZJ(OY6*kJoaVD#S9^CLR`2%UnVQw0tGi1y*+o@8jG<
zPY9M1k8fvWXHcV@PEdUU9UuRdGu&6RA5mkG{Wb;y`vnC9Y}nz()M$9|Qm@#z5RO13
zuSG_bn$IUYR|XvXp*~fASb3-xkD8D+xVSxf^IK?P(9St2-I?t+FdaGAwegYVou<$1
zEZK1Lfc}453oH<Xx&mOVUg|SXJwK2{FeacoRlRax!g!huHw!V)Sf^ormaaZ!F#c9e
zhMUi!?DhM)JS~VJl=>`&n;8XZtfQBDQA2IiKAV9yvTu_bu<773X%|wHn$(`jFt;Z>
zhS=t|o}d2r)^EzL;6`8=gsnuH0?q!5osD!l5$@v!qAE=S7~8a^TVjgp>LFXwN-%e0
zDatM%y9~^cekDQ*((2Kj`=rj_S)E!!>N987Qo}m9oQf#cyOj<7<Zz_P<3Bd>*i^Wj
ze)h#M#B;J30m>0?RJ6+B=%b<#u=eM4^?9nXeRC-!82R|+{}iQeNc>K^cHhEjsq@$U
zY=Yjk!OQvm*;@R5vtpd-ooVCLzT?$E>4_^dG$bLRrJZTB+1QB}`BF`c7{NuE_vMXg
zL&v8AkjcZ^(_zpRR5SX}sExvcmi!im2Yb$!QQ~-5FAqyENY@e^k4dXmy0_7(HVi1X
zi{kYlOPj1nWv`=CZRor}jS*4P0o1sXF~!BRS*XBEM;F6nc1gS3y%t|eKFJOz1UFrS
zj<j^I4GB3S5u;Rf+34h)Puh&U{ALyn(kKT)X^?k4v`mTNVZA)WRiTf=p<I99R+-Xg
z_X068NmhI8<sJRUPET06jgYF@ZPdaV@64GgjlxWe&a}aKUP%O*UPV4KvHe5Yxm_^~
zgD`ZZ8avqDf3b4&2joW!<WTB|z(SG|GKzcK57CT3Olx4E(#m}0!u8@Jbz>3m;urN1
ziaFi7L5h22Kbbg5F|r7>zU!Z;fL<>iQjT!Tj>;t<HA8>()Kg~ZJrQjThbJCZe~5Q~
z9D34GoryLyO*gg+5p^6-t+-VlguUq51kl3-Vc_j&qnV?bl<b?MzO=2tkWoN)Hm3rc
zJgeDYcnEW4VZX6I<c^eA7f);(v-`RU#!?xlUNDSPD<3YK(cn`%;y&i50kWYqY}{tX
z)fjXE%V?`~@lz=s#VUgzz1BRAl7n?jrhNJ-x+>@33uFw1_TjuM?MBN@8`>0<<pu}I
zYOeQ`!p^j}1JiOljI7yJGq0kn>cu$<lbvJ!&IC2%#%WT}xB7p@5_#WjpO?wrH;wY1
z=rdJ}M#7^Ix`X62l%vc-dM4T+sCsCB><cNYD+WtJTkgzG1}zt~x7{tI9;Kh)*+L45
z`$fEz(x-J$r7QhU*_qu&48uUQmsBA0vfY1U;c$TjB==_;5CpAOJp4E_9HcVhLNi!O
zgm=^T47eSGvOyh#9y`RUPiESaykuI{p}k@>1H>14`#(?fM|3jJQwMBrXisL~fm0up
zF4mh$MH!u@8EAh)v`Ws|Or2AiNJDH61miKjuV6)WZJN0s-9W04F9Ydd;?tm2sn0KA
z!!SdkJZ71thI_2ngIT!Y;LoF|`md^UWmybUuU;c;4mJ#pnX-v{WlJYh=iEPJ$df_D
z0A9swU+xC8vJY#_1LLSnf@>IU;owZOI;`8AW`<jHdB7;{vzKOKmko6{460<+c`Gzl
zbtin(4Vj|gXy4qq^%vaHVx^Q?d)b^`m0=6O+4IGlggNiQ*<||kmSB!RZDmJ-EN_@c
zwOdIQ{eh{%tfVb=(LvemMq_OpNqfff>m%N^!Y(sj7+u!}54Jm$ek8VyWiW$j(F~;w
zHl&#%K(j+*e?OuQy8R`+D7p)gS8b{Wi&LlEdpLq$?Gdk;sg<}xY2)XYvNOuE5C&oB
zmb6mn+yBOf>zBaKWCK0gDh&`4VeKgL-N@+Qfdql=A>S=E_`Ps#oU}UeN5V43kA{(~
zg!T&6W@og9kH$@o=+EdpC|_Np+F-gyf6-8(ox}V~8oKvFwYe~uOw6|uVEVNtGwr7g
zwt6AkaB=~7dV)-*SK^L@LA)f5nTuv#jd5c})=|?6WirkE`y;NmJ9FnXmiVSS#x3dk
zDomRTuU-V8Hg>YJ3};Gb${W)rvr!yscLpVkm?rT@dhAwCg{@{lk&O4V*_y8+E#5|m
z$zK*Gg<)N@>0|rxua(QsxRBezs5{&zt4WGXg>AzO%tjdtuxEn>PNz*-x~7W+Cj=Q@
zzqd1eq?Ajb=-Xgo{Os2x(;gpXGKFsM(Z+{=0G@?R`T?}}lK3U9Z7m%DI>DFnGZ~i|
zWR)*3>ZBA-UGS#Jk;ZJYl9yM38-|T|>|j%dTG)|Ju>FVBKG+GwM*JDWkhjuc^h&ug
z20h@GAVPe_JVa@uKM?hgvU542AOwM6O0FN&{1bb$H=y2O60odYQIw$vb2MI@E(hb9
z83ni%q=qHH4Pq%8U<mzf)dEqO^NIZ!xYfYBcm(hK9;5_#Fp$C)$Y<)?D9o^RD)CJj
zIRg55Ux#r&aXy)qFCuNF!9fcAu>V3oS&XhO+>P=DMj1K?-)Q0jZwWZ3LU#QwCVi0@
zh}hQHBS`p+zv=)Z4V^0efS&Q-@c;SELSxulS|Z7D7!A%a$ULj?smGMI(}=f$+IJ6~
z<#$?M)+U|e5pF|*fUUzTS$*YExhoy<7Bn{<XdfgYqdBUKJfw<7)Z73@#Nl)-|JYWf
zty8KE1h&n<LKS)80w$La+pT@*SkEAv!H4>IPGgnpcoeCZ1-#97;q}?WdI3%TihGC>
zFF|qR*<JIjsZkmL`BN<Dv{~<@BEI<e^i9KaHZGGcw^4F~6DfXcXFV5=oH0o^mm9;d
z`K6_^UpHX?IXPWQC1bY)<?rpuOMF4noLAl_l#x?o)B$hS$E$IaXgUA1UO&pt<cMJy
zgrY6U)&lOovG6>(0KWVNG>L@}h`)R<ohKRmVyc&@s8Qc)q~4`0okgb1+zi8OnEY+5
zt(3i%5I3(EAA|qMK(TraX&=%aroz-nfpK0iF6Xtd<qsvBT1MSK;hAgQ7)V7i(hF)S
zK=PfqAQ~Yh>g#-fl$BE566R*Sr2UN-A9`<%zke?&K(cAghP4C4B>qmbT35ybc4ZaR
zhne;(uI*qoYTc_qkSzH}%?<w`a??1>7HhAsg-4dQLH+|Od9+0^Rhqe-OW$K=jXFwo
zP^c5h_=f49N_Z3lsl|W`zhOK*_voN3<(L=D&Gg7tu_&)te<#2^!BtMoRrD8eRg4gH
zh+VyLKGH@eZT^kL^>&zqaliDlsAQ)Cxj_QYFy6sm_i3t4l39plg&XYc=HE@QRSA#M
zz*s@tjC0M1jtx<&BUh9n(h}YVcL;YTijk^UyKbLbTDiEJ#wI!v9T9xi5o&%(-=i=U
z&&`v~LALtp*cAosWm(*2MsIYu6j98Loc*KhTyhwOK_Ggi*f=4%|HaDlq7@LSnjXLl
z0u<x<)LVwqK?>jo*X20|t4Lm+Tjoh4NCw>SSOgPcV4iZm#9BJq^Bfs{Df;w8K)#bR
z#xbOj+*$wsn&w+-+n@fZJ*3ZA)WKtt!dVB8=gL)ylo3|dZrSA&34<tnj2+ISsR+4L
z=9XU+k<S1nzc%c5_B)Jp_RI<$4)E7uvAo>74&`qktJ*}Ek2^ZW0Qt}v+IUJSXBWbv
zK`du$bN|fGzDqqNt1WL&r?EPX{Nvu(_CZp5Bp@nuKY(=xtgf3298)?vJt-m@6k~#I
z3z3cqSIV$JZKBsjBCm}j{>f#2?=MOjT9KF9-k87`H<qe3YK5-uD^I9qGeUv0XZ#we
z{8m=Jp5$yI6btpt?dx><n-r=N>{UG#Bjrv55Qr*8{g6r_R=f>+733YB=Oy=^sgz5`
z+idSZzu2DwJZ}@(t*~soAZ{>NyI8wD1H$E~0#id03HOx+rf`x5wE~T-kxRy3LG}-2
zXLckp3<A-VJQh00Ke6R$Yd(Pa=>$|R+ej_wBQKp>H)zM!#gW5TtMo@&x#pab{1s>q
z9AZD(;X~T6Ei0xBg8@S*giC$z!726LoNWS(T{+eV+m0V*no3n>!VS)h@!S-SU7=|6
zyj0L?iIRF4P2qoWV+Z=zlz?Bcw^=wbkk5L#LY2RwtXqSJ38@OuM+=z9nL3eImM)o!
zhI^1*4++@Zt=^U2Z)S&Lq*K==oGIXF)0kJ85bPW%WpVZz-m^5GM+*ddCH3r{wV}F>
z<9s&bw0(QRom4hy*6(rYcrTnpZeGVRODf2eDisH0Aouk!A7Gx;BNCMNkyEASKMk7s
z#@J2sAgx;*7zxx~cm@P08GR2qN+*9O)=k_9&egca?lJu1omU~f>a1ZzwP(0!`rIvT
zQ#l_K?S?OC6N1!n9N%lFR$;U6%(}rkXQTaa-^@0uhEeMA71GU1Ca?!cBlfx3K}pY?
zd>0Rt+!<G0E@8XlYYDn%hZ_uS30|OSVc)LPA7y8NTQLa3&?~hN2;Bc-%VX023Yj$d
z0#(%lF^*%W7PRs`JQYSvbL^S)S~*b*ovOHNxM#4sCmNHukOoS#I*z4$kfgbZI!IGH
z$_rFRRdh-K`?9#{G-0~!ez?>E_@uMcZ>Wkb>@=o%-d(KIo8;T?NpxdT5gFBsD-H7w
zH@1<mWU{$ocBiugG2eO%w3&*FiC;c9zsXN=i-9MzipZw4K+-Vr9B~;y&PmlOQAZN#
z<O!lOzGFrT4-0TrPC;TqlFv<Cl49{e^TCb3MQhkx3BmQt=?0+?d{&_MR$f}M$nurr
z-QXj~Ku<h(DT(;VD38v2(GSmwu<of*C9cQ;J-ggAS~2?+#KuTMks3DXFJ8mM3+p$O
z^4t6TE09Qfc)m0`S|pkhvCl^xU^J!S?^%08h`~Y_!-#ctVOi2vzoa+DhU~ay5m{c5
zlSbua@eQBB<2UYeZrAjnrsz#P>u+olH*h4n<9i-`V2E;F=VYl)AY1nyXKFj1x%UeE
zcLe{3vNO7}7zBZ6OA17>|HhVKzkv5M4R8_@6=9rPVpsjm&R$()eV|~BeTH&zz18z3
zRwj!TH9jxOsy;SIxzzgCG&qV@G>VHjP1`^+$7@l8QhiYq6^w1h(kpf}=&9CBQQ<@i
z94Fj_#Qaye23DIIlUuL;#>|Q2T`hLA2`~SsYRfBo<d;ieB<_)1${?a}!%_UFo@Lh`
z<@ePyY&p!uCa)qKLDUCqmFe+;<54DX$y9;bN^86WyvUf1&UBKz0j2<mfoB$ofDWo&
z=Y%omByWT%6cvCkRb14tp^1J><PKik28>+%>epn5A+{{)JJx$s@RmTr5b2Wi9*2HH
zjdqpc2;i;Y&Oq%m@23g%k5m~B;+_jEgM;Ae!={0X-9+M8_E0rb^wP&;b91Il#sh)z
z&8p=3al3yrr!cQd9EsmLCwU^Je<eDLiCs&ol1l&Bde^lno8Q9Z@ZRii9!@py9Dpd(
z9=cmKP|vN^xeeA_FmOPtv=<PS(QtU>Oks_J$0oSuF(~hkvTMtc7zSZi3IQ_Y{uf)^
zm1YHWKYW2IN+?fbcN<|i!=qwxc2=YyS4&ITt|JsMd>bK68eGtd%OX#PcB?L?+Y*)g
z2B?z*ZA6Q-ZJ+i*nMaxZV|Pffd>($a&;E^Zsg?L<*@ob_#ILUO;874^+BmTrW%zT`
z%K#Vu(<S{jY8l_Oo8lV?m-DUic<YT?g0Z_@YsW{<Ci6Y>sqCvkow>%vtYPv6LH&qf
zlFm%hsH?Un!3)kTP+~~dG&3|VDl|4M4qAK`Cw<>aI|&_Q8Aj74Di{ae37EbE7-@Rv
zyGMe}c)kk9!N?mDS&t@?>kIi3b?~TEn-LJGKM3vjjo69#EgJ>Sx$^i_kbfcedLP#_
zchVp^;8x309lgXe32+!2tn@b<ia9Vr%qXr;%?swsH8}dmfnR{!yLsO#qyEXteY4@F
z!L^);R7}*Jx>Mh-dsI-|f;0?Pd)5TO%4SNi=qgi+3H`?)O#~R!Omrw8s7)4C0Ipid
zw(oh{FZ*Yx^h4Q|Bry!aurGzhVE+HHTJE7EoF3E%Fd0gWt!VkP_+`Gap}{#B6`ojH
zp|Wjh*YEtd13#??2*0&T9PAR+#mNe1rHv!pJkPdMJR1}<0q3x(_!lRJJbd$R6?u6S
zR+tk#CoZxcCCU-L+G}5F3LVzT3<r9dWQCm=flu*>8`=;_?3|h0U?deE`{_1*qHAfR
zNy#yhm=M451xN0U?$RAhaZ{kcMkPV~HukyHRYgeZWQEfkJnaDFOvJOlq?}8qg8^0$
z&7w~2I3cU1x|jm6`o+uX@KZ!~M~Wg^old1*o2_t~ub6k?ta}hfRgfa(vF+h>hKb6Q
zu8Q`e_*aZQob#qeoaiW~<3V=cShY!03}u`-ImlOznK$|z(0J_y3Q!OX=HyJsF%c!R
z5N1_YR(S7DHaKx~E&1c!Ec&UJhn6;*NUP|uVK$FMYw!F1P@}B7u1P(w0myO^Z!Q5W
z(ngb#1BC;+Ok`T^YBDKx!sLU~PfRs&pX1Zx7zMf*(r9Y@CdLamx1p@I4`t_eB{2-b
z(3avy4DP?N<<5Qq`B4Rvlfgk)LV8EL%aQIak{l=geN-F|xj!v3#ud4{pL`5woXdwL
zU{t&<j6k~BI#sT^CsEGi13Deyv?y`~eIz-~faSf0{D0bNF)7khH{aB#4U#a<Z;iYX
zC`S=o_{m5$I_}RKZlHJn^468G%_-C){M|l*oi3?aeSK0w!9|sGqfpQnVdOZwN!(Sm
z0Df9;glq#zZtFIJQgN4Ejwn15SO{Uc?He*pn!~IJRt;|YVwFFAb(yVFgH{|H2g$P+
zSNoT2jK;=Fu-$4*aZGrd4Hp~`8|YIwQ@0u&P78o=p98m@3a^zJ&+-5XLS6B?**KWp
z({pLXZAG*CteB?bLl{3YnmT7~<xrLos_2V&COL^cZ{LBESWUOoApfI}@v_`4p>hxD
znLW1}Gb2xvZH6|FD(5`g;Sk9Sh>QU&@Y%<_p~$N|JL2FybRDpYnYMKvR>EajnzLZR
zm^j{e*B{FCc|N})f0SJb4#O}A`%<ok<o_QV?xd~+ER7FXTbe*1wqe+2BqN%)g0Wl$
z!*jg>Kq}cR>(_X*E(D?pNLL;4C$&Q?J*R?pfzUc@<X>4coYi%(b8Z<27Wx*wyUuX$
zsdtovor6b-dckx@Q?YnTY-)GgQB-&|5KX}tt+rQjt(KiCOf5YJVxk2J*Cl;=O=9W-
zZ@D>Iec>Y_>Xo9`*6pgt%w>2VCaMF1cdftX(4gI%Z<pq=O!Tt^9h{i*?Ntg2N%8KD
znPa()9YBE*)Wj^_KI(6@$&+j{fyx-<fH*TD=cp}el(&_7zdGnSS~yPd0frU|#SdE6
zdu`@izCChIN8m_TAQWhFps1z7frJ6I=xV`n7X3kyh>qiIit|6peo<)L@<bXR4pb>n
zl>InPqsttUN;ptwKs|#p=-=uygTwc8zfwSSKg+xD{7`acM-asz3~MPs&i)&F4XoHv
z1D=d63}5-LgE+^}FX~wcd7ei-=rs;qAry%8eMTl4gG^$9M6Yp-4g#G@W;TUrCO(>q
zp2{FZT0IAWR_-9pxs^^wv%xUApoft`nxC1i<aQn=@~oy-P5UI${FKX!m%Ayk<ZHuh
zo#b0Xg?<~CRqRM}nq%x0!n{>n6})qdOtL@6P*{xfR&!B^vs&)8K1$5M27(v{VJr1j
z$ldL~*iYa{ULdN73$$#_N}%Drn=#xqq9X7j(2wdGm)&{HoUl3fn%0}&LZV5*Fw$oX
ziD9Hub)qmss?ev)ATtM{o}+e#RI7l`y9jMeC<t}O=u?LJF)!w?8`MUkBGiddsK~VH
ztK|m$)Yw^(=xgk?Tsn?P`La!q`U~jNJJi#u?9(bYW+~AI#94^`%*uv)^lR?w5Yd0i
z&fo@M5Qc%fbb<!8IPAYz)d4QjEr7rriJd-r{eO-&3k`D)w<Bg+-Pj%urj*WbF!MS#
zCqvaXHZuJfor6fL8lB>yf_bUo5?w~+48ic28WaXv1?TXTqm<BWrIiZ`^Q@A580RuL
zhoj*(rL~#o+w}OZ!A=>Xdkvw*DAb6wnkY2`{gzs2nA<6&n~k&*ng@4kH=GR>KWF$L
zVhYD$&#}zIIK{S}8{tREx!nK=!!U5AG<|0O#Xv~>VT)V9g2W1uujNC>_&G_xO6SmQ
z-z<|vZzN<KjfPOUt%H1hG%Q?5MlaHVdaq5L0ApnsTnJ`RhM|Q6B$F8i7k>WCO$(X4
z<1`{9UA@tZ>9k{_$B~u>l<$_&L;7^0BOQHEb&R1&*P9vAq{<o=RuUP5S4er9*`i6;
zH7k7XJp9+0X08?y(r)gkK;|$9(vf!V$j=5BjztXp;=+qkGq?d5gkj)HBm~s`C+oXX
zebOxuMT!k3$Ir!M`e}gQ%NQdA!%_+YV0e}}fEpGZsv-E$q56TyVXWG)=THKo-JPie
z0Ngk}Bg5Jzab#pz>RtwBIK~)&49Dm&6T@nwpM7BKZ|cB*JL3ythN>UHD<=5@GCW3y
zfDFgzFcU+SR)H5@BSXN2*Ni>W!n$Vc1BqjqI$6$-ssn6AjXlfx^U{4OJC`I0LJ$gG
zNmM@G|6;?d9iTJAvNuLmwF(jXGXEUsJ)K(}>-(^<^K~LH-+u$H%L@R%KtR9Td@HIN
z+MRmF;cB%po1L?ePe52c-)7g&mcY?@xS^g~6QIfLBB5538-lrDQEg){c5pArDjKcb
zYFiR7-^=tkpTpk3@Xhz{wKa5Pt-%=sL<rb~1z671njR4)gPimHGNaxi6>JK%`ejZe
z88AqEbOo_CPY!8Kju_1afRsL4$N&(ru;Dv<q-3^}?oYWf;DM+quhaR|znpN&>}*u;
z6HcPeMjnE<pww;TTYRD69KJ%sFQwR?Lnlg%DRgy!x#}^>eh1>#>xTq9Xw%;DL2e^J
zbl5+3wD)66CP=~*vwantEU9Rv+yDO_JaW_qZp5<K@>eMCrdz-A9ylX^L0eT3vq?)T
zmbbHrC6d(OSMv1$JNB?s1FW|K_k3<02|NhfJJew{)h3<qkwUj#NO{AVi<-AC2Ci0D
zr}KxhD@w8$1YuXAXp7wcVw-gK2dTT03ph@d1l}`Ab;F~DKP6m~PAgq7m&(33i&235
zb1`BBm&Cmh>Qum|I^qLxCRlpV3opNPeoC!Z%`NTl@TJ%5i#ocwd?;`nHC>bmkNH}_
zn>97>7loYn9JRkdbpuA2MLw+~pGl`!G`9e~J1*K-(Q?0ijaypzk2y)<&#JIBX2tWs
zP#JTKULIe+xg7Uc6}Co80ieXhMV>EEw<o;HzI{tE05BT~W&Dby{$2XK?HbR-(2N^3
z!Z=rN@l480dj4zKrCxiLVEd6islrTV*7ov!q!W|g)t{G%s<Whv#d=w8-FtkS@^Bj~
zSCi0{mj{M5CWU4*#dN8YT$SC>q6YKpZzfk-&yZCvYgTeIF6!W)c+6S`l`;!t4G5(J
z24@!!_hy>v(r}cU&C4^Gf?%Myg$Apq*emyUbF&A-1dwv!9BG5zBS;jM*wwO+vp#4E
zIb)x@T$;Obld#h$aQskqMY$4$AnZz_f_ndpy>>s|W?<Z;7cfKwib{);IYxY?JHAR{
z%F0QSaP#4fq&K82FE%Ui`2Ifr+8ta2`t0PfxjF5<H^-AJ@#Rtw+Bs>SoQlxnBijr}
z?72ViAs{qs&&Z?LC@D1&c7U#Rc3QC8TA5T|;f}J25_Ed$50nQ%OYHUNlt^L3@QCIw
z1Le||j7(0snEY_wKB_l`5U(kFa-XZ|iixg#<+@w*jH})cnjpAllgy{|E8dl*6T_#U
zy_dm7lsQI{%s3$=?<ay!YOMqrK6$^ndv(8L`7_*r{)0cRkjM^lds#b#G+~z2KG8E1
zHQ`*1US+F<?@---%n2)y+!70Y5AqnHL8fe|7q-y8U9mBRR+|>23z<%(R;0ANy7HuI
zHZ$`Y{B@}0jRNYHd8A(#zi&&fZcH<%`Z&;$Ii9BS2gxi8?gITY=PX_wMAbr2@{J``
zL7S5tQj@n!<5X@>#q6Yk?GvZiS@6(j{6oz@%FYHiq7VeaCu*aB4?R%te}yupNmp1m
znF|ot^~sMg-~TyTjP2y|piD9xxBE1$s?4&Oh2L8f-p&qR_g1oh^Q{&I4dZF`EI-tt
zkQ815spaEASx`ViEc*7$!asE749bvEL+W=s=`jFvDWYKAAc1LB(}uZoB$X+V3adlt
z#~}xux}+GxA37bFe7Z|=XQ1PnVAe?l7fd0MGqx8qZ+|tTEq{>1`i4|Raw1iLn0dSF
z+Os<c&Cz|i^p!Dy!c<LrQjKq0hzGAs*3fEMxy+1hJ#$On3XZM|>TX3rirJ6k$0D7G
z9}-Sj^bgLFwuG^Lya$BoHhm#no2Wn*UqkK3%ZK(rNq>lec5eVW^q;Rv0c64(^+YLI
zOE*U(QttYRFzID~)r;3}5IF$zQB3ICnswomx!d%tnneC?0}YlD4#!_wI9tppvUEGa
zV-dlFxdSeu`5XR3V@#hUhj3>NG;>24qE>zV7E1k6c5c}bgdh;zk|-d(|BVgh*8puY
zY`|k2w0TtOzAhauB@#>z60|+1z=b^<DRjb{V}kjhK;G(wn`cs)9``!ixo<krRbaul
z?VxgD@u+10*jij#s*L+O-?p1e{C;?<Ao!}&to62a4mR-qRDe`4m?irul%K34u%f^I
z@4Qo6MK^eV%^<w@u+@R9kpFt_C@e@K0T=zrQxN*QTp`-4)2F8>Ie|g+1}Xc&c)dza
zI$~auRLL38ZGJ`6%dJKA4tGARL31*MAvZaVTmoq=H$S;`*a`6ml98uFn_=Q#ds44J
zg8RP1XaF+Pqn05L=z_%Tbec(`<Lw4@UNJ7@<z=(}zw&*{ar_2q<u>qXZLJqTXlKu1
z`o@nRrFua>6xNAl<yKS&x}SkEf|40IL8)kGM~6Yd5S|AlNgGy-C!x!iyff(|jj&Cd
zs{VS;176~6+df-woCcuS0J9BalL^$p56Z7=Xhczp9EOg8kF_@avf=x}QTp{vRuI?7
zKP4!ea%kMo;zQY$<VXyJupf<5)B^ec$HrD)nxc{!tEC(f>agSBgXrvmWKE!0So6WT
zZ>7{)$py)#L8c-0j~-=Bt&~|AjDp}Fq;N9wbAK)~{wexd=g4mmH7%@SA$eInyWcM*
zAtp2m{+vlLJf{?198js2eQyP!GknFbF(JGF870wMBN&e8ej|iVQgz#o-s=hgyZOr(
zdP<<rz!M{b%SBKm9*3G+N>2WE&_z)(&r?uUbGJuAbBD4O$ErjIfB8<NDU*o}RkAMb
zvic&@$^L;TewLd&%1H*nJCKco{KBJU%I>sz@+eqmL*wjg_5-a#m-bna2!{ro)bLzE
zKHO4Yb|ngY-y!&EjT|*M18$!?HMJ=ah87vmjC?j&v<~FTC>f%;5^f_8R_?(@D_Hix
z<I4u(h=+VuJ0&(kqlgaX8p6s+@hPo46X*oRJM1pF>snVtwT`94g;+WN;OE?{BTd&y
zd+*BZF*2l?=jJ*1aI%K(l-DM`#E%>PQg%hj6@(z{N{Fj2_rF*ZKRN~aI?V+f$8~`~
zOuoIS@N=V%UnfuibPp2cDb~p1?epeK6qmFd3U9|DUA?T`?&}JlZjy4?C#(LfQXe`C
zw^KLU-?`)9Ncx_Yg!G4?!cl7WB++i0*5^jICYn}u(up+p{Hd^jSdZI9U3rTOt?RFG
zl)Dh=uVW2}Fz*0JF{+P~Z|No^hiC+zL4&}#&$WT8TUKCsoSdK*H5$h~X=`1YrCr}j
zLzzgkXCm$4L{{aMDGQf@oUNCpVJLZsVurQ;moooxvo;nU<_`hQqJLc*jGMA}DJsd+
zn&EV$xs=;Fx)222+$|d>@WoBgf&{UjW06|F$5u8z%i45dKIHk5#@QUAwzPH`G2lb8
zONxz8K(fYi_|*~q^P#NFK?II@P-ODS#M9VXLs>ZG!Hb~n;?Z|`i_VIMkh^7w7i@6S
z6vR=4HCx7|yhQcSQWFYU*sTl_=(|lCBcc(d``aS`rC;Nfn6i*jH_<7vZg*(=f2H_E
z*|{W141+NAN-_8oA8GD?fswqKiWo1n>E5|WQZ_O?fNRTGFOGMFvK<RbC9B;|x0Glh
zF9o8UF+Ik<Px*|t@M@0XR-^m-GF{V~r2gq%gHvbq1uUoDHQG0y_cD;uIYSfwk$Phe
z2cZuEQyvB-I)1R3HRv&$Wwh5j?rxw=(1WVxet_c6w-@~4bu3iovg3$krm#b~)Uol?
z>53BZDBcUF6gYhG(RNV){V_60Ay5iV$jy4tc^uMEQq(b8GU?+~mvF=<6xYg9tS~Hp
z6#2cD?Z#YY;#glx0dPmuMttsj#GY0jC<HQ~f`ZEt7DBC%K|M3Va209)3^i)j`?y9~
zy7ke7!pu_v^1^9Oc;%8_asokdZ_x2?>)87`TR5_qYah~qq;NgKjoU#8wvyx>+T3%U
zd~kVu=e{38t*{Lt#5Tu?Gl^Fr{czS+1{0RkTXH&0EdUsf$IP_)ZQf1%ZmfrJcVDE^
z$NuYG^z%#EwH-+egRqt`#wPB+v6Hg1A1f}mM*|sxL&QTe@4)ILOjEVt5pgT;HgcU8
z_xs!HKb!rDX~Es4I51R5gK87~B3g;gOp%uEytjZll^dfnB3nKY*(yqV<fzPhgZcV@
zp8agMvMt%jw#ZEmxN=)hW2EL$X9YmG!Nq{{y2ke>KiV9ns$&U_vM5PTt2*9}_}oLW
z&gPXjD=%}MBGc?#!|E;+6(fyup$yGEkzUoK?8v4)LfA&bE@Yc1vq%V9WskG9+#-PI
z8!yAnympN;ZnT!!vY;}~;3{>vgYDVklFm@cBLxHEY@iFG{pI)XI<053|G0InW8ou5
zv(py!CD$<k<;ccHVuGM6YTDVsy7d`teiAr>lert}zsPMm<&m;fP_!f&eZG(nyB4(_
zzpg2aATzSwH``WGNaWF(Ub&D|5V_1M@I}lsz4YW)=XWeuqrhMe7!eV4c~)p`Ia}e+
zSj%xWv$3oxFw%0j1RCs({X^N6BuNayurCqt0{{QmNSRa1o$9zMXNrIq*;w{rns@D?
zFs_A$U7R0;npLn+<-w=7{bJY8YYY557i*8100K6sWn;6GK!`&3VY81rS#`Fit2!Vq
z1bf1qaZY*+gk%*TcDj1Z_*BQm0fhK)i41G1s&|woR3QPpV1yBkAY#vY)*U<=!fQ3=
z?KW_}+p3e&uUM^(7etCH02)15+-u?3%+_T}nuYW`*gp6^2+J4inyu?hiBkA72UU-W
z@UI4domPEQTB!`jIj4~oz%uoMWIE5*GlYeQOWcr@v)R?cUU1MJSC;w}0O>1ixWl8F
z4v=3Rc=SBNqSM!W&J=DdDc}E;=W9g%-r)0}FC}PiCJW(j*R=hD!uGtfiInByh;A~%
zfaR)UcZ|Ojv)l#8>^<Va`KOgy-HF&Tie7VI{7CjO+SMX;jDLO-7Vc_fBiwP)VC$K5
zBt)M1d>jCq#T4R+!iBIFXiDkw5D*Y}E5B*MW!pc4lRwI?D9ND^gxzRIL=o?Qu}$9W
zM}@jA7hvogD*=-58v4FkV^==xeY3{f1=#mEQDTQOZ%kZQ!yR)^Q{GYW)9s$iJek`Z
zn8Lir4o*d&-aQm~dro8L+nK0ZGPxV2G1Ez7Y4m`aw20VCJPW<Fgtbl{3;%9n$Qn*0
zXPS;($rr&<rER*=;k*w6G^+fxRQBE%dQ>*R_a6OI2&<-`Y#ZxubpOG&^7`XX`;>>%
z<aiSRBbp|glee;~duRy*Hl>>xIXv`|ON8ADV%z8Jj^0=#TMr~9v(!S=(&+A=-5?bw
zupZn}CIKs;A3iRdDM@u!I$|JcE^^I<gF9Y}RMd>pg*dIixOhVl9Dy@OzSLvbE4WFL
z9R#dxG<3_ME04qWQ|7=-Nv|m<-64rSDo^n~Xq$K%0QDMBgt&bX_I6-xCufri1mFhL
zrru{(A{1_&zHTM?>58<wr^phMnA$5kTRq4sj~$q?kBn=vW-{a`EW7G@P*qf(35F{t
zIKPx#TdqVQ2;0%gU==<4-`H*a5}8RZ8z4q`TMBZf(@U3p#yWwl>3`_bmXLX=z_8M7
zoPiE6y3$Hl;h2drQ4$=6@I*f*1opf6Q4@G|eM*XPMmgwrm!(`+{ywt9w9*Tn*2kRN
z#Cx-x);Ikha(};H7zAQ=q4a8q%=2!5ScM@1=faf7h6u8S|70G3yOOE!*1!T>+G!b#
zm(&UhPPIm#r4#?&Oj!BAg9TfIEJ4f=_6=rim7iExu(fHzCW^YN^)Hl46*vU~N`*mH
zQ`<|pu<0$Ic~;IGjIHgo!ba~y?M&R7Tk$+6NaYdK${eoJFb%o%3dtePRV|P3hcA6)
zXHo^vSnkTt63*o<&+xg#(oH{4QyWQgDIm2lbjRv-i1V6pd1m(6%ChK&bHU4_A+s^n
zl7JLC6&vOi$syX=q&r)#sak4Y%C0J0-3VY6>;X@xEkT{LTjzY0ZX*)U3VZIX8C4>E
z@^w@|N4U@`G{Uv}+-<Y<<iWeru_NQUC>caE1is@RWoMY<PzVCy8*NrWg!^A?XZ+Cy
z>C2W2n8rR3aOP7!*jHNr;&rD!sLiCv+eIs&&aCxSC#Mij=M~O}gXxg2rgrND`OHos
zAzQ<ZHR38Xz>k9W$FwA=>RhzzvMHndqIBoh3UWzDA1iMk=p*-}uOhzKjpyH-CM^<l
zNBg8#W8Lbm-5FMiq#=uN<R84GprN}Ws5--K$q*LA+F^h#L*lFw6zzbTCF@(J2f0~F
z7UQsT&`JmYDp}qlD70eW<8T}#H8*KzRw@^O1yM-P9#x^}U9DX3?M{_=savRsaHObp
z=F>Gf_12E8M%PfIzz)5v&6=D#QLcIJ!tiF57{5r{bv7a$oQ3E`u0{KBW|HJi&F^p)
z&uh<%Q%~;WcIqw5iy_)tILSCsg^gqTLd9TJq@=sG*Y9}rpX0oydYnYGh*cRqEdrNl
zb`ep3!k5gBe5PJsbZ*=wAz4t1>7ItN*WWVlmqwtI`4W$180i%VmyKwt%zo(*VMS9X
zh@%#J&0~?T;1pfMzf*!g%Ff`(f)E6vDUHI2=AYQ|oXZFHLIRd$p+eJihm|v_`iK{T
z1LWG~8D)T@1By$KXknNN;h(h;3oU4j%}(ScQ=oOlCg{1(BeNFtjb5ZgQ=nl-XyU&g
zqpHST=Qoe0K=kevkyQBzH!)!!oh|<siHxSA>UzW;JT6M$b<*k}%>rDG@`mExv-0R#
z2eXu*%raCj2)e-*N7?c0v^^y<UT_bQJBsATt<_v*cRupu2js_$u&oV`klL4&USynT
zL1AdPzxMU_N}|`H07)dg49qg%|7^8gbI8$wv?Wqr{C*p{PHbB=v&1^O5E2P5ax)vm
z682#@C#N;16M2#Ef-};KWH%7lQ{U2#6oIT%DZ*$ZAh#8rTkS}QNu;`<JLro({)Kq*
zTRnYtCxeVcm&sTvGq23wFa5`8rnT+ZnAqs|>5HLQLHT8L-n&S0nU^M_NDnf=R#KYX
z+H?F54cN+yEjgEyUdor&W13hls3rRC<Q@W%=AiBzND^s5{{)=WOAP*iTx0xEb|pCw
zgD~t%qyYl||Jc~vOr}zE9*L<~vO0E2HP}P^VFa7>9GHIMjHTY6UAcVW%2#n}6G+Js
zPJ4V%1b$yw9AYChmQ_M>72g3(rS<3`JV~tO5kSykuU9J8lr}=#Ar@P0o-yt}kFb|a
zbm$vI5Q8UA#koVKd3)MkiNO@{LS3r4!#Py3GF90ub;Uy6p_8F%kn(+u%;)oz$`h&`
zL<ycoD5CSHp5bwo+o94y$d}24#>y!}vb5J;xzNh&0%wX-+<iB~=Ixea8I`uYE3?aD
z-)iF=afmCkw~fjOfh#BmQJ&31&~pl?iMgX>r&Ue}J{<YhKJp2zf1uxcUsoH2ovNT?
zSu`d?=_OX~w4h-a<x-kvQzXOg%6DZ--j~XCb#{ml`;Y0%KIEM5J0UfiKnk?UtI6&K
zZu331+A1zZurbVy7ehV*y>2rarAnIsV@SfXkH`htyGND?sZ@Rh7h}d5f3_^l9_t?t
z?|ogJv7LtGo~->OY{=HAg0OJmcY$-IyT$*(VEiaMgB%G$5Q<(26w3Dg7aKl{=>Xl6
z`MX+?iV+2b|7-#*oeIxun+!l%7-&B0akW0p#DLFt>ydHLB|Wlx^fix*(7Ba9O-1Mk
zL?lry^$&{AOoi>XybuC9aX`Of!6$!~GJIQp<<M!`DE&-vv&D!@Se18C*(rYMU<~Qt
z=Me|9RcV(Egvx_S(G4lR5fw1}Z<D4`ErPb&mD6-HOk$p_t?`9U{Bi^{0uHIUj?<1&
zbTz5B;89@Z6ml`>67D@d%$;J=`qfh0EbhUukHBWAOH)hI`mp61`a)w9>edur=<fJ1
z*83DZYCpi@VXJtr4GOij{}8WcKm}H*Lkic6jS(RzLb_QwVN6$Tm&m4|@#c~Gq>9{_
zC1<>(O1os|{IP72#LVG%Gc?9@<yVFq0NfXOo4tp!e|N)WmZQ-tJ##BSfJN^=eDAyA
zHWC=eg<}fF<72)jFNQpBl|H1vZ#W>yG65OBsAaC6=g?zAVLR@s*JPS+rj(Q;BtMj0
zTapAJ2)mLfDBk~KOWZGDrfPBl%CfO}g(S)L2?#wDi)!%7`p4idB+c%@mZ@@|eCqCE
zx72GXLyAZ@_Ob99^z6E-&qrp<uf_}Wi^>D<KN@)~z%>^knvI&7Uj)2ck(cfGjHiVZ
zXYA%-VU(}BA<ttA<KNnBv`L*g4Jn{75!Y=|P`EYfG|Fz`8#L5bk<XlKkkxHvCKCnc
zSEYtEs1ufVXHYDb2i#Y+uBxnzm*uepc#<Neg@eVnYqC_EI(A7v&m-v@!-rK?>BHc_
zw6MTjEQZ1;27~`Xg_*gCNs2NH46qgeh-{CP**lpEvmT+D1V$bs*%j>6&5A=c23nvQ
zGJ`a3J|%BE;Mr{mA|_~O(9FCFWy@<fYAUaYNu%yLLuPEpnIrK88`74p_{jY3SD8v+
ziQ3TXQrDJ_pG93qCi<LDVGT$Qv(>SUl;xzE;$X@I-V<&34-5fJWL=&+M}p_45dzO_
zS-ua-?{2a@CS*0SgR$%C>HMjl`lIaJau|j|Ab2Im#;^Ndtc<08U{a}j0aT^ICa~;$
z;|8fr^|NS9uP;1No)>2v1<7rfP{t57ZYG&*XJ@6S^bcO7B6cOX_>QGYDqy-YHn3;|
zQ;#R-LSSYLYMws~fq#d#*wIE#(Agy4AWRebUFnuv^ngJx4<zHj3G;R!y({H+Ut3Fc
zc?wmkm?tZ>Ofev~XaYlL9&$OIx{SG%&b*+OVS<jm`T#OnEx&tG<ghuxEOU-J%pXQg
zo;6B_2cb+Wtzp52#`w)Ib4!uqWY8x2Vt!;|O;JmJ8bgU)FAEUHO=kjxl;f}1KVOdM
z6Z7C&0`jHfL6}o<NslCs>8YkYg@Em?dEWraHi=y(F}q9z`Ai5=)ut2Gq}Z`GUCplm
z1H{R7o@82G!6aFL85KUMytH9+-P11FuT`mpj5MPOgne)9bJpzy-W6nk^{D0ckK@%a
z<eNKp0=raA2bPha(WCjrg|)$EP5fpk45bHcfo6n`o8HNx9lSK_6d8v_m=O{<uMZ3W
z#JD^CvwSGKf+Gk*5Z02MAliRpNBjZ1Gn*@bhqpqIkT9o_nn4N72Yydfvu6BaRMVZj
zj0DsWg$Lm^r0*tZgNbaJa|l{UBqhVT%_oic_sH4t!NCdv2P%p{mn}6$ZA^<IOdPIR
z07tnF*-aDk3@Y}{JX(m&z-{$zM6@9Sqf4Z#D$pzT&sRW<0}_~>{oznvqx&dn34-VX
zuI}2c+A_ey^ELDdeU7o>S4%A;`>bAGM{ydy<6hWZ&#y^|Nuxz2M(~uou8bwR<t6|^
zz1qDS98u$fA_;?L8)Or~DjoDYYPO)hgk1bw55U|d_XifO(nISo*Tc&o0^%wY<MZEe
zKMyk$VS?u!ilqWa#(8JE4+b<0`Ch$vYr-%XOKI_K_-H+rZKlWCg{dY`ws#SOl~6NA
zVG#7L8liwkGvH`+%==es)uuvM(ZU7H2&d*1f!cvE&N-S%GI)fy2?5;5qYrS@n6!~d
zGJ(qD-wU7+eb%bff=RtSXVDnIqJW7o0@Xid=XS+F2m;ZT&_#j%8w=wfvU^UZ0h0J2
zsKea-@>(iPwc*#(pus^k4=Q8W)0#el8t1DN%`KS45f*pzi(%YjwTfimgDCq!Y2I4t
zw@@49aw^o*E|y~vvptCg(@d}NY0Tuz53htH9RA?q8n9LF5`sk~pz0NqMYzh5@!(~q
z3CEm4NNAPC2#~>!t5CSjSpyv`M%ScO7c<~Dn{#&B1Lh0rhpC6+^C5y^JZRjEhc%((
z4SfbWe;V9Ulv)v1^?sh&7Y6L8Wp~@X)P=x>I?B9&OJ<*0VVUj*e_$ftcG!6~_0!?K
z^DNS)jUl<Mn{=f4_dg&im(1=jXhz1+Y~7?Ih<o8_I5HLI=(PGfsBeC|r8&50D^B;E
z+LVTu+D!Di2_NXY&{>Mc(%uuh#hBQQzmluv*q-nFh%WKvf>*n=+%krIudoBoVb?!6
zA>XmfA@Go@T^vv^>3{(p)NER%jz0nV(_FAH?m8i(LYFh(kFs;gVHgI1=#^q)NPPc`
zbzXM{MGBin-5@LBXEUBb9Mu+@EF2$2`H(IDJ_*zSt_L#oH2>&Jf6yFwwSDl(C>YV4
zbc+Wi&I-ouxOS31;+Dj|wQ^!csj#M#&dWaakF=2ow7#`79*jWpy{Jxm<l_uUxu2R_
zrQQG3reGCfT%Bbn2E(Df#O6w@3^NzXn@sPlJ8|`bXi+@_JQSW!sJ3@jooc0XbzeDT
z&;QlfLjBRv)9?hA(Mtwz$S~n~v;!#TGA-v$wUPr}Pys3s`V$}24Bkzro#9~ctsgZH
zQ4DunB#R`eDT7!{Da2qp`l1^4Zaamf-}-(IP)3=1k0Pzt;q~(@l%&iWs>3Qd<XNxr
z-uaT#vJ1i|0vMW&bfH3D9S$&`Srl-`8XG9E9;+yRMaOgs%Jrvqc@#ZV`O4JP(S7%X
zrCC#U;c?mO*sN$?L`SXO=c`oNyjosyhM-Z*fmowNG_2@ybmqODuro7e+?<GA+!wP-
zecl<$x@BcRWofY6^JcJ8yO3o2N7)%AF%W_<^h(PLqW8a86F)=klnXG9D+mkb{kAO)
z!xbme5uBV=^wB#*=P}d`5kP`4M^bHaZhfcNnUaVhZkWV8BQC{}CoeA^yp>W85z{7B
z$_~JMn@%gw4v!!Nti&dWkzLQnp|z>dF+AlKKv){c$ef_@GA!TO=sPLUTZNY>%)sX;
zsYOjDlAkI(vvrKOPIc}?rm>6=&8ijDDFFnaL{`Fqc8}a|9h~{<A$QxNFoQi>SS}ne
zZAJCIj_Es+dUnL$!>>BNZmoS3pIRrOU`ON4C>KO0-Bc*j3Z%!>2tfd=@*w_p3Le2C
zA%VqZyqU%3QD^i&7JfIb%?S7`H|iNoDT)AbN3|_{>0c$pb+a8DREwIu_0GgrWp!j%
zlrN(q)y#huezh$Or2}-dL)yibXI*zEuFH4~f1se&Nmg1c=ZkE6>ubt<j8XKQ0z0Vb
zahq1AXvefF*(0p8*M>v>l*gG<4)}+%bHR-m27&06>=3}Y|HaC<RV%=0I~PD`7sq_Y
zk3US8V;LDC^nj7QMe#lUwaDPzb^#tjuK}G5I&EF`C6wD%HgtsDh(G&O^LI^wQ+}6o
zISfyNmtqU#36x<%{h6y-kD?n04$zoHYa5S>!P+>T3kWcYn+jD#cbvJv%Pu9%39%a%
z_^&B`NJJUW?RBNZ6s5c@S?3-#-m>>pRS-XAw+!V4bX)9Aa<uAO#0_JTEXz}hi3X;d
zM3(Wh1?IbF%!IQ2GNWJ$)2xPx&)NW0?paZkdWX3x)f=&l`2~^~9Yw_@-fnM3R;Wn~
zb7L7V4ush9!!%4E=J!Y<ZAc#?E5PgXIBcyk$LL_xvrJpBjk*~R!0VmQ#*_$22m=(x
zf-p1!ZO+4cT4JcJ2^xb}2gr{>yPy3ExtN#u>IJn8t2VZhzqOl>KEGQ|&={~8WPgRl
zyCzMTos^oeF}DDgzn2k3Y#b=R%wSs+IR-)_5TR}a_0>U|U!Tnn%FZa)fe?hETWUoV
z_P?>m@#huEB*O+sV+Xw`ocl6zN<t7;@l{XQ2VT9_TjFIWn&J2`7XZl>phBH$@7w_-
zqa=!_LmY7|JgQLaxOS^0l;H|RfXAF;AyuCXT6LLyGrxnzO~!M4Rm%z)o%Bx7n88$l
z;e$z=?0m7x&v73Mz^}ICpyi>6O#>($-ui*sT_js8^o6MKvC&d?lDX_aErFc7Uj`Yc
zf{j9aWtBeGX+~4KM<Q%FPKhRKRCCnUxo>$&5IPvQ_j4YSXvvMv_LfL7Ap``_XOzSn
zPo8pIca}PVVnWD4f5PWAB(aoAy92M%go;s_P$KE}o4mis3oifjZ%&MRv*Y^Yv@9-v
zMbCeZ{Co64`<J<7#a6Gic3Q3X&}^wBV^iOF6gJc9Unrf{X7y`0DKc=z4uW$|1(3}S
znO`qj3_R`ak>7*U<VE1;<;cUjerBJsy!~o@^^=yE^9!05Rb(8fv?c6&m~XXiW$zA|
z5rQ021-!n)ulf)EN7=b1F%W_<_)0!7;{7jHVt=u8XPOH*TZ<1QeEDMNg;WQvJrvW8
znI%1WYO%a4s|62RCDs^0>3jTuRY9<(jGS8{;;fE^9a);&n13Mo-^ZOPh2Y~^Z}jsZ
zOu4}Rr!sQ(RXWFfJ1Ib|%2%OiOp$$+KpTOJJDt5Mg>AVqa^j`M&Bv}OHut=87AnL$
zBsB~LQ|=KKF%@2$EllYhLKegDb?fpC*eEzr*NGH!sXwrfD^>Sy^fs%l7Q*W-vbPfP
z@N`XSJZPV{PesIu?5*UnEwDn{h*%$geDCW_^z3W4$(4w_6+o+%owb#bXLcWB6)yfj
z3LEQ9d`aJ&)}J3{*k|2vUe&iq3FhRr6qgO>yZgD#>|O~YN-!s{C1ZJ=l)ej>sE~Xq
zmb3VUU@5lvgT45z(%ZWf%=r)`mTuFhZ`+ST#8h%iWbMlUUAw>4h&`WjdIhzGtbMWA
zI`^iNhw-veZv9GcC$jV<rXg}4ij3Akb-RbO*Ja_$<sq7XD7yk1hG7u)QV4`3|35a|
zNt*yonjfgDmVgPy4lrY2zx3S}CZ=cRqHPJd7+p4O!lldmJ2M&f%6c(-)W*TP0@tB2
zpeGa9h4&(05C{B6DIeXbSr}&tFSHkpk^(}mDsDMi5^=^5!)H-2-0&~NA{Z1uyRi=S
z=yV`glq+l?M(RV+tr9Ye3GH+o4T}dRj*4r&p*@UbzGo5)%1dOt0s4zKnU~3&^vr-!
zc+&t)`v$MD;R8k&!!_N=IKG7F^=QSrC#NiC{^hF4EHXf;`L!tuslg@_LVb^PFFJPs
z{{?8H*rJg?3?qNPbG9IaO?I3T0|Q`oZ5k#yW%5gua3~@H?SRzU?VOk+u31srL6yVc
z*uW_4=4aHSPZm9h@PJ<3#m#)>KT?<}vth7NJTQv(^Pb%2ITe#QG8ZO#x2tPIA8~zw
z^XF4ASj?olRxD^PMl82h$fzu8WlJ~0VLZ1I!=#(FG1_`w<YUgG8$F;#f0~LR<6i4U
zJO)Jg_;2IH+t+Q(^+%KSqU_v`AO=Aw+ENS=N&k&4$Nks^lNo7%aWoNu`}hkSn=>6&
zz__Lti>y|@6=Hy1$$zkUd1bimqSlZrmeK*n|4(H2g|9&2uT`SERpvArAu{+>c=hJH
z58f}Q?h5}xBRs}ei}=ITB~$BbN~s)SLdW=Spby;q5N8cw8-kASvE##(Tq2WJYft7N
zqjdKta12cDo5r!>v#~s=`&p?kl6VX<lnhJ<KyuqMTYq16GM`5_%<BLEq30^(q@#3{
zab|%LuX+t?)c8C5@g7*?!0muq1jJO=srL_QzqQlR^2{iTZV)WT$PKFslTxE@jQ`&X
z*Om!ZHm8)*LpSQi++G9;jqYx;D){|fR6C)Aa7;tk-<NHSP32+8TRA>$iOJ1;5H`1v
z6;o)d%;{C5uSECIgQ^kx<F$WK(LT^99V7nQ=qD6HET&heMdjt6urb%6Q#jhw;e$bO
zuN`9aJHvA7kokG67=T+!iw=!axJ2R=mdDkHwsA#vN&{NPlgi+|r_k9lpx(adkPl^N
zU@Jig0@0T6P>}u`JH|`?50XuG8Xy~^3*zwRZQN=)h~bSekX@oTGZ%HEsN5L1q~ow;
z-6)^?WqMFcaXBmnMBfl>8vwZ?%~Oaug<hrEz!j}IG0~FMf0O1KGoNG?9V1yFgu>&*
z^RFq=(G^TpS_Cs_bbzG*M}_Eqc*Y23tO#awU;q(DR^gvME;yOjSu27Wz!IlS-FPc&
zYr)_etf*!53<6*n6dn_OPK&|cSW(NsZBQ}hB*5m|t8adeTxf=C=dx#ohYOL-cClwD
z3s%%Ju&Y*R4HWsx`_5omY(*_I1;tn9gTrXkS3d90kw;~r#{N|@<B(on`13qRzSP>e
z&Uvm~A(Z$2>Kn|y+n2q>kW7dU;JU1CO=Aqs(5lH&mPnam!P3mTVKlzLV#H;(FMElA
zSVXes7-#bPh7RgvV%v2k$|Qh}`aTauZTB%r{8G{6zaLJkHvF{lo8vLHN%qxG2e3!r
zllreP`1@w&FI_=03YhZrOfd$h&Mt~$4r53SJ-(EkK@!6t2t}_HMT6e|V&&Nt&`iU0
z?>IIJDF6MrZ7l?v-`!u?mOc;d3PgHmNR%*wKFpSgt*hh++gpI%4ff~piN*1(zi^j(
zp0(SJ6A`)aa-sGoX4qb-^4uQggwlB70J_(e{HH3P^mbIkInOgYeiKNJ;x&539`@c2
zwY}jDs)ZMk<e^-euM3B0CD85g9De<{WUHJTfic5PN8^S~Y1d7!lBF+h2mJrU{)cuV
zxJJ1drLa*nFlNSevVYr%REIyH5UVn_OH7frPug>=I<&(&YDcu9kXF}2b5R@8ySxwQ
zvFA29sSNGCu(z!=IvoN*l)JP-I8^Vpq_V)X4CqcvdZY;4l{#EKR|fJY{;+mRH_7eA
zy^?&WYolqXf2=672@iR-8qedpP-qF!aj3y{W2{6r(yKIOw-E<vE<XzY9I>PVrdMyg
zMCOl5T!fbSm~>Qd#OiIAxG%;CXkkX#b62pm%Fr$FFZIimrjc6`Ew@*qiU!}MVM(6t
z68s~37K!U$E5;9HXLM^Z2*c2o8Uh&hU+l&GOVTSnFHoTh0)%5becDS7+`KV2UYFRq
z1-PQxgcX-<!T}F>BK=q_YfHZ)-42;XPu7?o+ttfxC@dQiOG5x74oIMSXU@J>jx;%t
z11}k)GA_e9tvy+|qH{;eTynzbPs|H!r@F6Zaw${_tTbtud`A5Tm6{(O+e(cdIsY>b
zq00unv{vUYTmk4Y63#|fX{z$5Ew6oJn6g`?z$GIcG3}fcC8GM6<4EJp7sJa4j#nMz
zd<t)#6^cR+qeM>Fb9T(<OQ^eRGZh*U8KH?9w9V<`3O)_>I;zzEOwc$phXyf6Mu4_X
z%6XJkm;su_1x|f>Yyh{P?_9CjL;+|v$^45K2zZ)1KNKHVWQ1lBoAFqShnLZh5Jus|
z3r}qtD&UCXMd{~>y?hzUI}1FuX=Z#cN;K6yA6T~^Y0ODkxJT4dI&k<K(KY@NmGOJb
zWi67-IV2O!PH*Btu`ELNkBOW2T+Vi6Tx%=YA?33m+s809n7xR&0>r%bAL;IYlwI2q
z!ypV>iGabd|6-N$XPe$d3*=H#ux#}B_TZIA={Px9S19Ey<H4@PJ$j<hOf2)J@Xcr&
z|LJ7<|LC0}bD1jBn4xqjwXWDXcqY-ju8a=UzzBeX!jut>M;grofW(f7?gDLG0D{uO
zS-Qh#a2wO9I$ef7WHtYPa8Eo8CaVD8p$1fU(5WrQNbz5O@Y2}mzRDL={?itELpm9u
zi5tWQc6MdMDmdCgZ@4+^wuVyZc;#YuHWZnYTTt3NFAnMEgkOV$IveYoGQac4rQtox
zXsB5PWO<#HiA3bl;9x#<;{fPb%nvC$ML9Ymlg1dVFj)|(JiP?CDK$JYX|TxTWu9l!
z`s|X$t{ffn2@1*AAaF6?kAOGtLPcKZvj_e6qSRuO+UI)~g{0ya<T-(9H;!nGhCWtY
zvXxpGDKx`)8$uaBDq?YfJJK7^ln>rt@45!4f045&tU(V9n#OH{_Ipza!Q$n4WUS!3
zn7-6_*)*BT3(PQjq3*hpvgtEQorulR6#XbW7u*P95QbhU-*M*t7b~VxD<CVaFMw9r
zNdm<99geS~wc>oQB-6=QhNHfAaBL2rw3V|`MJa(NHECEAbqh)%%&hC7TmVmeuOKC9
z(?r9n<^GiSEM@Qn(Pd^G7aNiE;T_W=EqbNc;R(NSx^94$@S}FErquEXQW_%o2vniR
z{5jPyL7{OVC}~L9oL0Y4(l+V<*p%wpprj$Xji$N7&XJvo3()>Sq~SeFH{e5~JC~i1
zRwCjE?O2|+dmgJRcF{8TEk%wvLMv1(^KjJREUzq3>@E;JXO`84?npr{dwEk{im)3&
zM#J$vrbwW5*~OPZx?~f7X*!U-(+{nHouH^ufYc+ko7;y?*7;Xk{{>dQWW=fvJn$!d
z`TBbS3M-OvAi;TUKU&;n`#NuuE2#MMBFC9~OxHIaf19mMQmLsFNlaXgP9lX>-WOjO
zNGWvWFga<??pM;pPOS?2D}8mbD)iL+^k3iVQ^knNMHneegYtO?yAn6oz6yQ+)jyP7
z+l|052wN#M55oS7ot>YP%jHxSh$7nXG&Yac^$L{D!7LXp+TNtnUTPZ%=ZuXQ)BxG@
zY@277R0&lg!DJ6f+(>=FJ%#6kF8%$+GO{QC^EjI9&u`81-+k}rN<~O1Z>o0U6?e<o
zXn5tND0arknL{C}n4FYlnwZi*r%Z?V=eQC+sNFp5i{ks;9s=n`(cR*#+;{>Kd1;Wm
z71Dj?AC1h+Gb6&h!kXa1K4XRqV>3*-?JV4~OHFQJpCJ|4Ks@0iq@CkKv*2nCh0RRV
zC>HDz&W#^36)L?_s3>e^kpFVRA+bcx{jX8chj8Ve!KwUo@T54|Mxrw<WsAx`bGBme
z1pSFc(AD~|D0;W`iwJ6+bf44NXlV-4SIO22VWYHi3nD*Pn(BE)Y1&`>Gh`r$P3Mdl
zkb2y`vgG87pXrU;zMPyP3y*{}_R9X^ZmI-B$}N%;k@aD{dp;GCyRGs}4>ebfDGm4F
z62yI0Zmh{DF_SO_f-ASRQy{Dzt?8&EAKmcKy;Bk*dAvWsRX>!S3l0Mz2t=<0e&PNX
zD`S%;fZLV}7_+MgIKKHZbhxHCz%<Ll0K4BgFqM9xZ_Zd|fG2_H1dkSc*RAqAus;kT
z*=0<(k0w!psI9U#c0$M>mM|h}R<X@Wt}9+V!)z6sZES&*G^GZW^IOOh5YYy-B8c}+
z4}E(@Rwdqx$qFiq&z3S095xehS}S*_;t@1>Z@y;J4s+X_n{x#;BHoHgaKDcCmf%84
z3Q1ZK&x;q%01kFYkh+w1n)a+fBqT~_0A1mYg}tLOkXF<N!m%g>$Yo6%8f1_JET+<@
zUS8AD&|I>DLM|q{v*P_H!G)<??QJQq9Qe)1y3EoC2@Wu}1&^77B2kZMXsrzF#WQGb
zL%A%+b~KA;Dls~kFueh|V_`v~soQ^lj_0AhhE4FK4pPBpId#s%m`fqgNoYDxPzMQI
z=lPem>Uq+R2L%y;BJUvJVp7&o3QW!O*w(OhJLdsAU&w`2nX_+>;u@K(4A605$X!)i
z&m%9Nq{EPwtZ=2ypQGhP*%>8C41z%PN>PZC`(JE$`Iuc`QWY*>StbHDboamduJr-q
zJ)}Q<V1~986Y=64+QAzwSup`_Lta<JMO7|&VU+!RB*~+9^SFnSgt}gtpxK?auO%lY
zGOcmT1%c=KV|Qd#E$Yw!u(4k(a_k&04*PlGM7=-po`duYOKat>;kM3CB9cMarFiV>
zui|u!js%xUY~LGB?TbmgQD~#HBXwqy#DYC?&_MM9byTmepXc$sbZ8vjf}9@m@Wb`n
zQ|1EB*;zU?4td$$GAYE<U9))yFEt5R4azpGI90SzEIOvvCZRg@u)&Bl?i|M|e)XL^
zuAw@;PDq!^><iw`m%iBY<0)&J>%K*g0BZKYpQBKUcc-+`WLb~r7it6x6^{z>S|@x&
zHJam=K=LR()a%nxc_E#Kq$TSnsKAKBBfs@GQ}wNzq_yqHIRt(5w}#$X#^1S_4be)w
zVUlKghCvi?sscflYkqY?s)pVnb8IJ87@lHgIq1$E*TBKwi$Nv-q1T0Yaz<<3LMk81
zt}RDk5CmSSRz<k~#dgO1S)kcuF3^|?A~=uVFQ-&I*9$nVkI?wIpeh-&^RR{zvy+51
z1jzgV2P=!-|9HY2rIhSUY#NT_pv8()0=AWHWtQp1n(2)f=NvXICQgh-5>h@~l8%-r
z#5X#HGdo9ADS$<J=9%jn{}S|Bo!CxD8)oIIu@I%}@=rf5{`*LAc8U~_le4`C&Ayu~
zmcrKazp$AK?NL4xnJ-2TYmCeMh(=*0C0qyw%SraqHu0hQYc#1iY^PF_vf2znma6y^
z-XR^n#)8saW`xYu2qxUu0~N0}4+<a1vk}v~%&>!;Jkal_^EN~J8zt#*b+dUb;#O16
zd!<FE7Lau5$0)6fHf>eTzO>*}<2a`a0x(g9XA^<PQLh|82_VA>3B@)y<+VN>{)TdY
zGjH_RAn<jg;*T~yQeINriV-i7sLv$9!K|WOr}BvBMQjEw1F5F0ARFgf?O8*bd7Z-P
zrD`6k@Fqv2ja!fMjEAiFq3jHjECxX!dL@a9aQ}-9?XKm|qA!q2r8E)pcuiGQ!eO((
zg(EDduMma6406o?yqVa7jxgKx_K1~<v0&BAOaQ;0XMUfzh#cu*&?w=kk6xAVYkZB8
zIZC2mkY~nl$ea#9$uTqV{yCO9+UIG8+U1kSihzTrnP#NgolG+W!#cUI>F-$Gefw3a
zH0ek+1ML_{lPUl$Ub9_D*Co-+XSMIV3hWKnYXkbX)Y;)!ri1Z={E!%*Jz?8oE6<r3
z8EDa}5FAK~%O5qL@`)uz29wwTF6-bK{stXxsTIXRP3wS<srxp-m#u>qifuXAF|#mo
zwJvmGr^{NVOPA(eXq~>`0z<}6c4hmPUUZDfY?~Jcgnn-9w!>4q>wgcQQn!|{nA*#=
zjVH)#^oIQFf1ricz+6lfj$u_oTb?&qC6sBzcw{n|&qPP0_61}^jfPZS^RG-MP&ZY1
za}XlbUdYlHgsB)%$lC$i49EmqC8-$BgQ=Kx7w{cdwKjnvsVe^{I~N>=K^TT!sZbcn
z{Vz6~O52jG+I)csF<3sh&*q8igvx#mbS0F=czHr1%S>5yYWX(mYN1*}{u^0HEp;YQ
z6hma}ur0=&90V6FkHWIEgq0y@bZj^@MG+;hnqre{9+KZdoc!+C+#c2APS_BSvKX46
z5FBN;L7sUuxits>hmPrw<v3!~EWCO<nDR}EN2bhVpGIudy1KQp(L)IxC8BL>`1oKl
z9z{oB(ryHeXeU@_Qp#TWI$w9$ZsX3xeRS+^C$4_=92wWpl_e)X>~UGUb{>){UqtXj
z3BD49iBK*q8%OU=+<x6d=_j=G*Mt(rC&ycp4^(B@P1$X~ogOL{wEn4u$%E2EiPNG&
zcpm&p8TpPBwREhM*Hn+PmlJ0dd4Ie5tuL@yg+}Quy1t--zxWzN3Rx+tY)G*ax{1Wk
zg-h%wn%^R9P%c9t#_%D_Xpqr6g-rfC?){46r@1V%aDC~l&WTI*8*=Gzgx9@GM32sa
zu4=gz>q>t1W>3nl<%(ethOLws2x$MsYSBxPn}Zf;n?7Tk==WB=;TZhjemzaY$<x4L
z29y6Fn-j$u_ttLeRG*GHK0;2|WKe5<1CukWM%{rj5n|a(RR)Pki|=a69J?Kl3xq;<
zS*T==jxT+vG+5`OPi`5(wOktVX-2E2Fb=o|iB+OuFT+-XgnSfG&~eYe52-~Pw-XPI
zIL{O&^Kr5c*k%;SwGu-S$Ey?i^OD8bsfb-=jz8A3zYi^Et_o4*BGZ&He`E~xYRK*+
zZKA!Ra*hxOLQA<Ck=gC&z7ZWQP6vmAc)M`Z%H<1-j#K@XM!g)_A(~{B<%N~X-(2Mf
z<F@};|2ti_4gKM?QJ~vwE}^}u+8tYBh{p>-2=qPVvxm*%!n>U4Ih-ah{N-6_!M;nZ
zxn8M;RVz!HP0o#64>x_{ss6Cxfca<=rQ7G~i+bIMB60QPvX070RLNy|(w~eMOiJ_h
zj^Y%G@KmnszO-_RFGKq{;2+A)?Z#pl1fne^<`L+>v1Qnw1vXM>09`rPHiqF$##v>m
zO{Wr@k$?%jSg?bJ75BZ#%9~CFcuIhCVU56Wn(Ui%(?{`2d|{T%vJEDPlW}gV+=5%r
zTo^|fDAO*zf<mjnT5l;uhckN;d<`!4=G9h2DzO9ObcHMd^s{?ptGc@Uxlwszc|q1^
zBy&@vZ5z`(FG>|4_Y(MphUs)vw9O=q7o|$v2AFlp`4OK3ZMG3<djY<P#5)NC6F0P$
zvy{2Pu6hH$#5MCod{{M3D{j+GYAB_709wCD<irof(_?<Y&Fw3te1hTV=VV|A<^6-n
z%zNa*#YSON(`*1*)9IYLDN_~V%dID?x=^m1o-WX}`p*@|B+6mX-vO?vL9<n=P+%`7
z()r66!Z{+f4=eE=_wW8=g5Om<$Q8b~|M-h7mbhqGNMZX0i|^Qe(|qpP;FP^+SWuD%
z(gfu?n|{l-krQ|^Ov0d2I<R64vEy=OmCzK#3yCqvZ*f$JD1G?7?{T?-Ddp%7WoMJc
zFbD$SD@jy@`(Lb#tB#o0l5Vnc;Y<0E@tf@&zWsqtieJTs$(1K}_=s2Z!C?PqCq-!$
zTXI+BTf5s_O_5{4E<K%EDpPJ(Mq)eYfD!Vsc6M97?#TOQGX-=GP_y7K5HIU&+pTiB
z)>+1atCL;hH)OjTopGar^l;X(j7>gxaM0hS=af>h%kU)!UoO%sp!bo$b9*5bVZAf$
zrK31{qV-y^5KKu$E93@e-phz`6tXJJMEa1wDB<r*vt?53HJs0313a^WQz}uKl`P_$
z)e<pv_UEk5TWQEdS{7j8wk4*SURa&BDrXYpnFM!vzyy#X6ZHPN?)z4JCqmtGAf3>`
zVdk4$o+?EF$yl^Oa1$ke+ns*K6jXw#aVZ*Q9*z#;`*6vp>J=om8?y&T$1@-SSm_F^
zt<uU=ibmgte$dd;YBGP((%CZUSSDn|h6{4=$zG`;tcZr4XfLy43ILi;TWX2%c-@Wn
zmB0UhQQ>xo0Hc{x$?oi>n87lZ1{R)s#3VokqS!shyubUl4`tVqEI|muuH-1vaQ}-<
z!e$=wx=NP4vAQfj35MkF*hh~$i-8)kcFHD^Qv}y~CbOfbk1`}5jNGJ4<>@|X)|!)C
zqM?)+n~=`c?14R>zNN(q{R|NVt)K}lHoC6ji#<C@te%WtfWk1(;K)>wO#dgyr*qeO
zQkAWca$r)!JGaJhbWT0bs!p0vQDF~=`qVD^*)i|&l$XS(Z=h-0U;vZWu6mIY`abkd
zr;|Ro$oY(d{ZtgiCandc>2!)y+S#9hYq6lb*6VkQO=6TY)*fIr*2n%_nI^vfb0UXK
z%`=)I=wz<0T|_RtkDTe@23H0H7lwUQeBk$73q&*7(}NRXId21bp}6xrnm(g5axx*r
zH#;(^+>>2zfd;!+BdJ>=+ld&@U8F3G`wGe$N!fxe2A&1z?_;m3<(rMSwKcM|MZ>0(
zO~9t75u7x3_8KEsX5!FiyqKz#ILy`rXZOz;a0YlomRQZnYyI(a1UNrY#H4Jy){+|4
zK<2|HY;H7!C49yvsl9eXJ0p8GMv4dyp8KOf=pP*YQg#J448tJorG-Ee{(o$CHE9FX
zsXTzHC<OzK{UC0Xd!gq$Cty>7YYMHQkvkDM6u`?RgNDM3ShuYBw4t+#(1G<b=0u}u
zCS!l8>i^>2e{v{)hJ?BJ4ui_DH7g$<ozPJVo5Sr*sU%UA+7HgoZH`(mRB)YWj)@(|
z*|npP&Ot|umVNzzT$o>sxMITUov)69^yDi6`g4i3q|TJ=v`!?8y(kU9@E__vRwvxv
z`NN~$%Zuy(Nogz2+lCjc>z(_T1YcMOIl!amG)j0bgsWAqlHv=%5j#(0CZlOtarpDj
zc_)Sp+HWeKq0pM|N^g|bJ;}aFd@xT5BPx(vx!j$Mnh7$?*yaPHYbgRYJ0(2vV_e81
z6{c!xz?T)OdFwoqBIx13^vpx^34P$Tb|3h+DDv?cO_KodKo7r=wy89ouZOM<@CcL{
z68sO45=EeqO<r|m)w<PTV>nDd&T}YX#R76#Ct*j&qy@N$ZbkWaZtVwv^giy$PgR`i
zCgTEPWoFe_fg`jek6w9Gb}l#!gdh;TlCD3z|HaDNZPEa-SuS7=U4_A62304<u-lO6
zn3TDhnlsWxml4Il1v>Nxe6-Bh(OhQiOMy0wph|Umy$Hy8*ETa!<zXGNJA$TREGU(9
zEulugJO%Z%VB3P*>(y6FYUyP=2VZ|s{U>*cc(!D4mQi~tkK8Y47Ok=9sgkNAJ(WhQ
zQydj3*4ywG^)5ZJ>+W>W<{Y{rD1gU{pkkDYh!=esPxY(lXit3ZUYH*qL*lqJ3dE7<
zf<iy>g7-p3Eps3pmj?Nfb-VTwmuPL>RwgFhNpvyg3?_ekpFBISq+;T7BYrIv9V6Q6
zp|iddGZwnGZJ#RASPJXr)@xhi6a7Rohtm2dp$jdy!9$0|A48JK=#Ei?g}ug<Y3hnC
zQP}pCS=*`;E(VC{kWKn;FRXoz3tQ<I-k9N`$q+$L(Wl-k13HG4rC=t0-cIGe`I3LG
z-{&pcSqT^^l}c4K`G#iiu9?j1lwkCyG<OZ*#db-&S!<CD+#Oa8t>EfhX};ac%ll8L
zKa`zO4uvoX1g}JEDfRvrd!7CPnkN@f(`W$Mo&9?x0h!&ARGO}yBc-lYIuLKjg@cBK
zVh#GJJb;y+*}{Ij36>NkwKji=t<s99-|90WSOYLDQ?C!np6|~bW3KVQ3UGrvk&9d9
zGn^r9eiyApw>Ox)GC;glO3Vy8(}nTJ1VZiTJ?nO6rS1kqOxx{KN71!x*_SNb_ou!>
zY}_~uXW)`?IDd2&zhBsUbcNsQW300?nwc<M8NIx|2GXJKwt5#9^1+gUTPm-#m)8t*
zB+ZCR!>y4zJ}sTJ|AWJR3;YAW79K*0N-eOL*8nQpLpggFGt+$5l?KGiYj!OJxsP8G
zX;AVY71%Zit$en@5HtMp#Jb<9j?c;(!^>-spzTpZ4({hklr5!ecOPyb1cRZV7|AlH
zrG<l6*I>$-2lUD;6Y18yGS~SuB^cj`1#}nMJJDQP<(2kXN*$Ru(a!r0a3&K;q0&?b
zP|Pu=>4gt}CSXVDx;}8;aFD?Q5!&e=WoM8BF$lxJFBMoI{QqO?skDbQs<giKgw(1D
zPU6`A_`1D+j3f;TnVx+&Wsg%COkv%#I~%#Mfge~k^)d)n<U8%4ED|H=ugXO)je$qi
zTlqL?Bi{80ofHvya<K*~Qo{Oswra!IoZ=@DX>?aNmi;yw=lUm#L{)d{@5H2`E4>#&
zV8}8=t6qvuz-8+sw&9yV3f%6Ji%+)>POBAzVK0i?3XPa$a&fv77nw-|?TVJwEuplE
zII&asyz9YO?bZilW~fvUrb0Dd;IJSSg`M+VPgWzmnDwHr&E`<a3g<Y%n;0_!nVcuU
zxzIr^xPCajsYIB$`Te)25fG?otDfQ9M2Rp%^|V;;+6ug=Lxkm&If*aRF??jxp<^r7
z|8fF-Klw2)L`idEvA{UFc10ajpA}*7efcO~2z|rqE0Sf)$(&gdX6ib^Y82OksN<{c
z+@M(y2CnN?cH?F6fGJtX0ruG_X<k@|ureI839dYwU4~`gXxF1Dio-4Y4^2<;6At`R
zcDA<`gdh;@<y8QRsQowg7=K-4H`!^x5ThU;&iScG5oW90bclEkqF6j|SPDvOGQE41
zt5@iVtz%#?uKSm=<-65aNfdvx;OrqO;j74CGc`KRxFm02M;UasJ$zqvA=J|8Iy$8C
zIxs$%_tDbxC4T+J(&;)nenXBp36R99^9(A?Xn<y67#B#yK@u(O_Xo3$*^zbe$Xk=x
z6fhW`>RrlMo$H}-3pKpRIOy>CL7Dc|X3Ydoa0Q^1ZV$cnZH&dL7hcT#VAR1Ql`3q(
zTo}zY7(hPGR)^1j_#eY$XsQ>vtj|c%;+?eORF{*tjaoVd#&8|B3_*8zO?Wn;N&|t-
z6wIM9Y2Z_Jy$Nxhx+)o%G@%N%1?9PIR)=aAWAVK7#vG&QATss&frt6NZVri&Ni8(j
z7Zfc^yVsb)pXwbF8<d6Yp!mw`V>8Kw=J6TSw_?HOaSuTvFT&Hz(a6&?<8YA26nr+3
z(rufa@f?Yk6e%k>iXD@xP;e@dh1luV|NbdEm+XdN7zSQRUsJmO#mZ4PCD{#L_Ksd+
z(X==K{sOAQ9wt7#2^sZ~wUpZ<#w9g~e1s;3ZDHMlN=XWFNxoHJ*+2=K)u5Akr8R$P
zV2Xohf6Xt0+1%y{MoY7&yd=9^o1D0YtUC8gXDWSOfM*Dh@{R^|f)S&h`KKoR);E}Z
zA7c1WIh|AOSWVEHc#9k4zPMOoXmHPe!=Eb^rWtVVMfGoBrTbLAcJwJNI`Z7e3cmR=
zlv<e%ZiW5qDJh9GWNcTk>R6c+QBL6dOaxm)fV7RQUMn_;%F%64IZ5rQ2%uKKRc#Gy
zD>w8^0NZ_nEMURPp<n3_jDx`sa2K{}Sue->rYtxH=|0yPqFq6E>nyWLcSa1-Jv^<>
zZ*0`4Clg!Q-79H*kMBaVOvxQBn!S0HRYzuK8<`|tH0A>l%Uk|ZTBV50_@(_B%Pf-)
z@2jOl>6IcegLGx=>tzF1u=2X1ywOHnhB#sWE~-DpDbHp;1-t8smcgwA7RNt>CNdxI
zmn;8Jb}mU0gdh;Tl8X4b|HUS=rZzzL#N@I!9R{U*G<p27=mdm1ST5>9_NF=hJ^Ozp
zp_wTfa<UpP+{RPQ6os@R1?x#GvpFm3?tY)qqeV=5n&M5PR>pWyd~Fbd?NyO}rf_-H
zy(JO>QievU8EjLaaYJ!V9_6I$ePe4ur$B%GgM0qf8Xm=@9D~LOUfcAj#eXd2Bf6zl
zz(a*2N(@e^Elnq`R2NYybBW5qnHlU;wp)fvx^hnw0W_QpO&Tgb<-Uaiubjk)pW*Et
zxu2+(k=RsWnR0ay05sSat?>Z4{Z4_;YgT+|0MJY(=npKW?^c-|S8}EaL1SdaE-Y>i
ztH|i4gqFadnTJ{9Jwzq%+9f(nu|}MuG#O?6A$BZQT03W@%9=x`FQ49s{&vF0a>25d
z2p$+T9Qk|r2zy}a7waB#f5{lJ&v!NA9T8*uT2@D49mPRMnapV1c!=S4kbl&f^+P#?
zQ6__*9VQtIA@M^u(%sU&i^@?p3K=2jPVrZ%X_e=N9%V8}rHPZai`4gxd_R<(OOnGd
z2t=<GtPj%tFE%`81&S(Wn*~ML#Qd7>A3om=?}&r&W^*}v&KnTK)owz_JfriQc*&7J
zNLmSvh>wA<5KZ}RZEO3Y>#CJjD8ggtH&H*b<W0eJ>~KoE5KUJV9dS1{TNX6uMRjFK
zEfFF!m={<=v6Nx~-Cj-b?xsiNtN!=~nA<myzlZK&r83Y&h-iK20)>e<^m<|V?sFtW
zv`&+=H*|E7eaHj)%KA{EmQq^;<Kr3J`om*FBc+!ZZhq-2n0Bm5nZ7d}h*r+(Bp_uN
z9J6vlxayHFIZI2XLproaA%4g&UY;EjUacgT2%mui3ij~HL2B3YlUMS(MV(O6%Cg+0
z<7v4W`c%de5k1qz#Vb|XBRew%%+l~6VrO(BpgSkZ-j>3T4P2=eis%{G&8VU+?#9TP
zg}XEvTp9}+a~ZHJXV%9Mz0zQ<mBM)=2yJe|^m%N_M(Hu{7;}TwET>0K*d#B!zM76;
z8fb}}s?`25l+yXDRGQKJgK7RKyS5yOVGwqugggrOzu4OQu@cbHtS^A7v?Um9^XIt5
z?QRQ~_+?4c9$KnN6Pae6=lse{==W^5ABPk<IU_o*tIbSG1#~lMU9QwKiA+Q3Fsd)Q
zHf`^kS?QD$CZx3#2`RuU&1pOo>g7znGm|}^OF0w$@x56`D;I3Coxz6y^m!Lad}CCz
zj&Lb(o)``;edWIcu)jy2Hc5vOr2yj!C>r5Xc-4q5iuTkpi3TZd(l>$W<auGUDZ_Oe
zr6MH<1$o2SiG4bSW+|cV^Ii`nOy<iVN3cWu&>s^Sq3sEn3N6`2(GXssR^;PLjN&g9
zc_^_@)q^@9CKn2hHx7UTU#%`vng`jKjs`ne;x^jzP-54{s1p`Xnh}wbQ!_?Lv5QSU
z5LM8l2qoi<-4w~LpkvFd83Le1!+E?&l(?;<d$xdKtq^C}JwaJO?o;hwnldT0!kghp
zlM;_jXZU_kDLQ*AycxW~6`T{&>eT-g`tws~$prq$;N%{q?0#M9{AKX=L)n>JF%W|=
zv?UvFasQ2lpIicD4r+imkFhbEq-Z-#?Kh#>-z&O|l{RiEn+6sZXMitxSVo=PcBLFU
zO7p~eg7m`FG!fkJ*Sm@?Zs~xWXStOwo#1B~PwCfZqQearA)8q6qm_R@73`}eW|<EC
z{dKEo^UjL=R|e;nm}Nfon8Cc}C3e-HyUG;8BC`xd*#)jeuK9=C&y+|XiDk@#0;Iys
z3_Nuys0M*Y-A%{2yx#{l;N};Ok=-GEa~#XRI;|0R#5uh{JQM;xvy^aNPX*i`2!&Pv
zqO!MbfmR0OC_*I{A;`KRe-)g#h0PfHwLo216`BP_)D+C5S-gpBQ1DHEVlSk(Rkv9=
z&`F)?d`63F66xsBl?X3I%aLv(s5sc8&OB9@t4+zY<@|#EXV?$!`h#v<l268?zMPVA
z|7^qLI4lL?ku`JOeG8bc*GSfCRd5yCiQ#u_R6RU@^}x0YvbDD+IUp&<ul1(v46-Z+
zK_GY~B@*)Qf3cxl{23&(=nLc}8bP70MgkL=DjqNdr&Y}w(j=7%i*18qmdcGr?-*_+
z@?4c`nCB!cWj^`xzfk5c+g*5W^<Uz&lNpsBFhZu6fmUX5RkOkC+V~5ui>%deK1)w7
z1x^qTRFQq_+*(qaL&2lifsD!6kQ=`V6mJ4@IuFu{z`+jprHI>cl`-l=-GX+7vfch8
zf@z+B%DS#@OEdC_bbq!t;A+B=DSdn#2+fS=j;;OlPP&{!+PGE03-lcvpJ@=Sj<}y=
zN=u|tDNr0c3NG|TS0`yGtNIYU3_L98w4);&FW$aFaoQ>$X60B%z{dIja%sb@bj{4|
zf8St5GiX)fvhNlk_z&9P_VWEoB(55lotEy+?;=li(+XF939r39cY|t-;aQxZl1I6o
zY!wJYmoxJZcgi-9vrXDm$`h3cgR0W+&7XWS3N_KlQqIhk2xA!RxjkVN(OWc@f<_U#
z0C^tZEmpoc%#U_SH<T0ESL*UZ*}2{z5W_Hdr6xVvyZsj<-~Drggv<a@DKt;p=?y|F
zVkoeMeYC;mp8=?&72n$`IF^br1#<8os4LKI`v1ZD_ESx>X`9~+NL3ecaKtxL!7T%Z
z5RSM^v)%E`-L3nOhgZo2lx_Hb<=IxR{=+)81U{OXteCEp5J*6b_CI!z;<;2yd%*+0
zk*Gqswuu!w&w5FHmu%#GKrv5<+vhmQyO2jUGth+Ol98P6@p?LS(jGDqVnkie8IP1#
zuN<92E5wE9zu4&uR=>B09!Etr_dx_)Z*%v<5Tx<QhU4V+!F;It>0z@uvezvLTHPDP
zx1g~b2=Mb>s-8TP*$As=p)xS6<*6`OpYrhMlx$lLRq-tYgvWJLpT&!QZCB!8UsEwI
z1Nph6L9`yE^IL`Pz%o-oE(y#Gjv5S^)9{*>;kJR79Fe@dqD=m1wm6xhfLzcxK&GS4
ze9ybR@^nru5SIkN#z=(eLUae>Y%VX;N(YQr0P!jtpo!XS;g6^OQg%j35`-WOy^?6#
z>isXaJii86t2!637)NP>A&D!ukWcq8pgGV68UK^@l(I2!Tq<&#h}%tiTPKT6Ds=<J
z#X24)442~$^(o-{!m$stu~gYKC9rHZ(UJbaaX92Ym`^bvX>cXdC09fa>S49y7jb&b
zr88Pr68E|(_6PM4j&YR!c&XqZz|(4e5T44EYdx%%D&9gbW^MRt_7B^AUpY2CQ6_Bo
zius<GnrOk@lzYDF(FxwP5lHk|#=R(nrMhA>1`~Dch2}zHqvrQ<<#0!<B}2Xv?M9N6
zrOJtesl<J4#=J%8YplpH!*0tQ#v)xjQq`zrxxjES^eAkA0=GGJO3hNMaz&DvA*I{7
zzhh;{Cb15Fos~}Hr!dM|iSkSa{P&OQ<KNUQ8}y@{{o&`gV5Q_0C*6TDF+6o#RI|pd
z@}}N`n-XWh5s=q(oyhyQ!0(&VB5K2&0{QwEfvJ{fKcr20?pz!x#(R_VRl<n{<{xF(
zal<eS16LA@RrX&jJRu*E7T{aJP#lZ(3iR$R{vx<7_|TQn$lMXrdI1#=Mut)LNEP*9
zAm!Fh3^gn<;a{V&Wis-YrHoLLCGd)Dy1z#t#11Pj3Msu{lk1%2Vbmq;v`PYVbj$|%
z;U1}`m<i})j;JRv794<O-r$4qGMi>FUMAPQ9rfcqbpX+sY<LGmf~zF!e3-Bzi9p){
zZjWdkw|}lm-e!Qomar)x#}9|CN%Z`qv_-1SF3(PTr09*KmxHr(d>hdblq9ay8_zYQ
z1A*pSN;|S-J~(xg<(|om84#K#UoyB`qTFr3t<*%`m3ekXtUM7W1qzO`lR`#PFkf8q
zLK+L~x@g5A?A41GlIUP=vtDl;L!+=0p91!qV}$?(O7)lBC=+fq4Kmk=@(2<<ee+J|
zml4PP;3q!_l}D80Yr!wr>uqLY`GHeu5Ss>0utDG3>!TSz4Lg7;(EPwC9lYmW1VcMx
z0%Cf-Z2vLIkFs++k{AYoU`m$IGylYn_Rki`-rGq)Wy=VG8JgdgvBdO*dT5hAmFtk3
zSA`sFNsw|Qx=>g%ci|jKRLWAmn58LzICf~EmmNO`+Eje6#dwjL51aw;cEgSYsw#zY
zvzVKqjdwHHD3tnf8%s{jV(G4Uj_PI#c;SO}|9Bl`I}$3QGa+JZi1<L?&qR1AHk?E&
zegn}L*<oWtFg_|lN=J!B(F((e3Phj6^y~64du&L?y`!1Xqqu7y(?7+ve{vbGyAtUw
zXz$_NEx6%XL8$z=v^4H$(AVqsx9-Hd{J-$~1IH2q#|06{qAT>F@S&_6Pb2d1NeJ(r
zr2F-nTUnLOco&RGul_}!Qk8X5>w%vv&rug+Q+t+Jm8zhXEg@NGZyZRt?&R=nu2L?K
zL}c;R(C^#2C8-Yzm8JxNEma3RZHG8LQ6#jdTAd;+vVMr7-J%);NZRh>3@4Nw?<vHj
zO#-Sp!O+7LH$^XL5zXS~*DVErZY`I^h5sl!gJg+85QttW5k+(Vi+x_Q8DvuPdoxQb
zWd;LC_hUzt<Zb5|fnFN%FLv6rewFO?PzEb453U@K<s4jU4*F8lG=<}4d2odU1K=wK
zS*+gwwf6gS`)iNqRN8zt@(rCobm#?k)K_V*OOKeN5GzosnF}SXm1$_Dn{0VdrHzSU
zC(d|-#Y=okN2h0sSi5N?jt+Jl`}F6jt(=F%8Z^u}G5{`A*q2G)=52JvFfWaqc94%(
zWt(E?VHsWo9kt!?ipVBvBgm9{MceR27*KVbXb*sg73Hktw7wb2BObs4|8V@A_SY!g
z8(B7H!BdA)kBY1pC~a3_aibS41TpP)$e49#)1-uXqZfH!m;o7-*R$k>eM#Gqc(*v8
zUGcL{?xc$3Un)}5;0lTrbcqNP;`M&{&MJq~{ES5mQ75|pD6HGqWr>OlmCesU^ji^f
zO_F=yR^>WE>X1xJFl3Abq85(qz#h@}&wYMhIeX_qMwm27B5J<0UKDc$OU5i1oA@7P
z=aK_448qVWrTLQkUu<}hMk7iqjdxvDRg!`M$94#YExBjzyoHLKK#T50n?4ca;enz+
zLifrbutonOI3JyR*w~1rIBil22%HtnBjM7a2<>a0{m!K~2mc~M9cb4N$;?orDFf#g
z87sbT4x|m0vXaFWnp9^8%F0!a$-r=c-G5%*-}5ZBBqLwN!zZ$|FfFavUu*IH#euIv
zN-q@MWv+Z*bxMDCpsQfGfMXi+b#-Sua;39waokYw5Lq5M=FxLn$(Caj>9gN)Xi>y}
z+Kr)7k-~#}>!@+$47HU@?#=G?;H0P;#!zIfe|%8iUwx|vx!jKRQm6krleC=FWe8F%
zV|R2%4BJ^p=vgjHITJyNWk3(|!spypeCVB3#T%jpDHi6i;{<(wnh*RGQ{X_*VwuHr
zZMBLIZ@&@{wJoi54?v@Odh+1ZkuJI(jB*up6y;bJ!t7ULz0=9-QX4UnRUB<mR(iIE
z9&1^IUHKKGAd3gL0mI(vQIg5^wkb97whv`zl*2#>0?{kEE~wo9Vx6%c?MOCRzMB}s
zT0n$(|K=cvox>b6mS+dL?$Vi-07(BiIrU9pGJj#{r*%!+R}lXA{$dx|5F_&VTcv;6
zq<w`A$kb~fDv6^rekK})T8}Bx$a%r^;fCxPUNyIJRrai!)qJYGiFs#LCRJmi(k*NU
z(TJ#m4MJV14jh%nHdApH_<c6`jkZ=8C*WUf`Pmxd+;TUT8aD(WW#w^KmR6b(ry^nO
zIr_p+?Tta6mp+tPcEy<aVsJeB)K2lz!PD8<4ZOnN+$Ng|U(lH!_pG8U4S|Z3t3lHC
zBnk9P5UjGcHoGuju^R_j#yU6cm9nU*EKB2i9V}vtl)taq(Sf@vycL)Vvmh)XuHcq3
zJ51hN>LY4VGKqvlT&^aAjL-gql>HX2_zw|g!J#807qJ!_zOI}gM9JDi5`;l*X)0(m
zKbaPzB4lKOG;&J+6B^<ZnL=Xt;6mV)Z>S&#BnYv`0T5;QcAU&naeJ!XVnj;@by4}u
zxH874koKBtx7?c>jQc$6N>{qbDxvv9*|{YN41z%LN<Kj2{V%q(`?E-_4HvMi7zJ_Y
z`FH5*>y5yl(HBh^9pAplee8Bv=II7`kAXQ_h~+gyHW$xs(N!>Pw2a^Odkg95tf^@q
zaS>9ivcAny$q>w+mYKC4mU$Mwgl5Xh4gcicXG%Zf-Hit9FR^GaERx07rgwkv``A7<
zLR^)Bl)UXS?}smPAKJgqFX~|pVjxBJu#lNbirlp^nPyV)+L&f{WZec>sM(@nb7ot2
z9|s5T<@1+m*dxR)^Nc568PhkgRIt~Xv<lV_L*HlZF}cfrF*xiKGqe|GV9A_DP8%b5
z8DWi$tBi!>xo4UJ#A#z>@y1JBfu#^zpK3;2F8yyDw7hGs-4$$k?}|ME85p*7XWw84
zCyv_|tkkx5xO6_LIXn9XOP@FW-;TPchQp%gme6^MHJxO2vR!2YxU?kd5#j|g1t?Q{
zAYq_#sxMNq%q?6_Sq#R3I_NgG(O=Z2nX;XDX-vT)0i(6;MjBzfn$hIT!E}KSK6s%m
zw58ATL)n=nK?s9D^h!e{Cf@&I!{e_-tK<SPr6IEPGVXKE&bRa%Fq^Y(XJldP<OEhD
z*4f&*gd_?8w4x^_CF_$K;rq%GksBr2C<PKfT~OJp)t(Tc7eq})I(^f9J?aUx&Xw&F
zl5yuzXkEBEpVbMVGhlI-klc&9CEi0is(jn@>(Wzv{^)xovj&&)D*BU7w%?aFWqzK?
z=0h0afyXpDNMD~~sxnZT8n~CmBkp3*9iW7Z=F2!RhEDR4?Hc80r_bvGoEeyKMDB&E
zb!@(5>1M5$AuUrZT9SW)Y+NBQ%+?1~!IycZ+XsX2`H0`|<aUCiu?<TMa1}tgRc$jm
z1+y3%G2aBNoz+&6Z0?MzT|hLp!Jm5M3d8U%sFBjyvS4T|{s>^Hz%fLO7aT)xWsSk8
zHY3omxA+~^G09q0mKqxYnuV(v36odM?=?EVa#4SY9MW>Iw*edY12w-BhN}JoJ%FC3
zL4^Ai%X4e#zqshX#KFVoI+DFj8D6T+&nd#6vNJk@7zBZ6OK23a|Hi`dw?St@1CGZ<
z1zq08$lPh$;i4gi*L6LZz?aA}L%C@J&zw+|LU%q7+jJ!!R2iBdE-GOkJ_B3#=YPD<
zn$b&e{uAKI75BZVkFk<^kcdWBz~p;)E?9m>Y$dGGVE#*s{y;Nd98+hChgG)IFa8BW
z34vhFcC*8psbn8afDu$&OJJ;`DD{&WWCdtFm;r-3SESY+lx5$(m7_)NebTfTH+UB4
zN!&v;e|eR)$TFG-FiHdXW+nsbp`|F3h{m@%z>FXnlqXNPa!ElNn&w3pK4U++6xr$i
zVS9KVnHWq8I5NoLp81~cOA7;&ga-1}Iag4rkgca=slve@jD7KRap3|%{S<GRb6zTM
zNk#L(qt{D0h4xPN59Z4~7@U*Nwj{Vtvwux1SEW657^~RerYj!gP;~zZ@qJ)6fbYl}
z1H824`A62d4^0_q57icAeJEV@@MTo;8CKNv4J$XeR{9UvJ6Bn~k{Z~DK?sbbHnXt2
zPU1UyA9^Xfl4OfP5O^h(LAn3Mes^|4Qtz|Pg0d(Pj6M8Zc4TxdJtrv|jJ#Ck{>~YC
z3%)F&n<7Q`58Z&v(a}-i)5tQ{l&<lI(?WhlCI59cV0=q}N-Iu!Fg!9W#A%U@B-EL|
z14z-(Y{<dGbMUWE%;F5!tH4O|*NA%59?3wh3PaHm#@DzhPBD#bm5iIQb~Qq7ZHgPy
z=7tV4sA8ui&*x>UbOw#v+=#eF7ZQ)j<T;v^_xEn4B$ALF)p}@r>lnVu^GbB~ppEp5
zzxf6*#CRh@C-8sd<U96Vgmi}{HxCyKbn%xvt*lP)`<Llilayp^^6mb1R(JHd>;}~+
z4Rs%pcS6Jqe0O(l%r+9S9$zpjp}*`|pzfVNKz5^Qs91@uw|H4TQfl&a<|VsPH47^x
zBzVwkvLgRqSN$D2b1X1?*je<Mv=_dYw^Ds~#Rw(F1D$tfPCfRXbpqc7iB7)w(qMF%
zk}4t9S#yHbAQ3)^=R)t=E-y9HDfXG(Fi<A`N7=O<F${ySl?pM&-hZ)5?iY~s!UCK_
z4CWz(&_CgA<RpI)-a2_ALW2<+oGStxPCM63pmR$Sw1z|F2u6Qo-m5IKlomUjMRplu
z%YBiE+Yp~!yDDXMWJjnQ93S&U+9Pgftp{}m`Ye*m99n2+zAuY3#<@r5t&0+@(xwum
z$5tA>YlhhP>^usRCZ7mIBaa3<Yz0rEEoK>u2pjkhjxPI9mT$EF$qvo8MTia0tv@;#
zI>TIz>?lMNX)oIhTwCs&&8U**j?S4Q>XeMV>$8!O4pQCO8+|+<J3f)nGag|2LF9RM
zvl*~s?umTnbh-vni*mQoK*rV4N!$=`*T+degTMjiUP+V8I<nI{Iaz9uIZasw$nj+d
zOJ@;bBgjk@A8rdtQ)MjQtw>5E=FRadSwZCnHF=}zXTcHh21m^x&Cb54lHXa&_g!gA
z{3aoqvp-M}@vB2eW08(#tdo#BDMVpSH&?GETjQb*c6T=H1|CG@jpS!_q%HAW72qVX
zI>eU#Z~y6+vU9Ov7=(f7N{xg0?7vw3qDql%qQ(oLs09P&?%v;_TS!2#9UbHRKy{O;
zEtQc&@ES-sn<7d8X?sH!eIB_-il)_TTQM@O4As05R90e0qtVMfX_I@f%CnHJG^=Nb
z9JbB2AF}Kah{a*PAfi5x9oT{PV~>SayI=VN=_pdMcWad1*aTt6J%N+mHRBHSsub)X
zyg|cBK)l#Jl0I;1WK@{M8ihCbUK$drer(!Xv(hC|FT6QFs5|XM(mOBmiKnQQ`>EI6
zz~-~R5cWnND_gOT%FBi}jnG4!6QCyKlY{T1^w~~!W4A}eQ?jrWZfdJm%9PXH5I@1Y
zJj9=+skBxgvFcPeGD(Qy#Mfj)tvW01DD|ov+hG>O$v*p!-yCQjl{Mp3H$qAfB&$ms
zv+283L|N)oH^Ole=ifR&-EU@I<y!4jH-g3$3k=z6$vaWn)1&HU@dPm%PQ~?tKJxs%
z&Lez+?E=F}z)>oB6+M=E#SNKt_<|=LW7+)1rEl(@m?B@w&LxLo5C)=GN&xe@|HV3w
zMJwY*ikI0$C;?-`^US=q;a2G-F2Ky%_P~v@FkDzM3IDkpfA#${3;V!r#^hUq0;<w@
zWe)oMW_P`)QC+0z2D2Ru95W+!v<=O?9K_9S!ul^ZXF`U<Z3>#ofU`yOIbQQ<kt8lI
z&EYnvgku@jw4+>6qHAPW3Of{Qwsa(_Ml@H(Uzmz>2X0d#+a{{Oz)e9KBIA5#-fd|r
zT=Z*iQ(X@$q)R<DLmY3@=;mV3bdjvc^`{QAJZ_`y8N)XObrz+6J5R1t|Iufs3e2zx
z1tr2331}Os+2?qhxuD;aSr1LXm~`BwXHIU0Pfm?C(~cFOVrqRe>c=lKjy^@~JCyq(
z2Wz35aAo*=^S}+a=g6NC`}!SOo{Y?g9lVXvynbQBsY1YllzPqdliT6B)RoC_pTxBi
z1*5$&#CRUK9p%wjcps>YhLH)c&IHzRRE%{sC3)H#Rc_4a1$(DT=;13ytU(m_>a5!w
z;t%MWnuGI@>r_oMaKOX?Axh1Jzxko;T#pzAVHmtp06Uod7pufSW7?}0$mK!+Kjcq8
zpS=p3*J!woTskWK5P6-l<s+AH2*;sJay_vx;c}TNr(hga999iEz=@C~E)q`#QRs10
zaaf9*gkVv>e6hGtf~Xir!PdDkv6!8DUHhZ3_5HQ&?5mT`k9?67q<P*9OA0D8)28A7
zdpHQ`qd-YRF%I-B$7wi8u+Lcx=KR!U8I?_W0B&Y%3%(6v_ff`(L#pFsISxm?a1pbX
zJfAvT7hQVo+~OdRpQLP3T5lzNMQ7kykArgr&!o-5v{}Ek^6zCej<bi<*&C#lSvmjQ
zlpsFaFWDjhBWCP{EaV);3(d1S$LOKOPtq1L=~B#hsRxm@IfIw`WEyP@jmz9#Q&a$1
znqy22kWR+753ESDS6an4W7yVMq~`>Ec&Y)5f)etCxak%Mq)35SG_<?SJ}5nz?8rnJ
zIKpp3For<;h@*zoq*@1A1K)whggu^i4l=rej(aoVhFW~&=KLR#K*lA@6Jp^v8#G~&
z+J~}h%YhgKfmaey(EDF(XPWE>Qj>B4Vyw!e^T3O`A5xFLkiaVhbBq2=Y8*CDF9tP~
zeq8rGwjLboiSLNk7bh=4*`y*{Xl+F8S~|Sar3G8=XTr5g+<Eum&`O*`^1HDd6(*7)
zS<2Z;hasBM)8O)P8fp|Y$REr~+Zt*6N=G513J)r=p8C0pEw&x#8(d=wg(5E7MN6&u
zV_o|>_<_H9=9^5d>@he@PG_y~g4%(<A>))D#)DvKOCZ5j0o$3JcsP`#=yNG<CRu}F
zmk!DSzu6nRvIyd%FqVHImfV*eW~f5y0MaYk{_bz@QRM~(WgGt6A3|+C)aW#iO%t5u
zmDo}4jU#ZuA)(yhl5A+&E1^A3XmP%&P>zB%YrR#7_a@;=nmdgbXemEPAv>v@x=Z^J
z6~L(y$srEXx4-;x=oL<#^{a(irJ1!JsEXQ9)RJA)RI(!Lsu+4(4~ft53^_4-oV3gg
z<8EVCVr!&s+9p_?!&#jl)_mWM|GoQBb|y&@gD?>MlCgz=|9`BNj=l)d6H_PO2nUNc
zMCJE#l4uCN$MRXJJJY0z&e`C6Ek5N(-1csUlnuPK*T7Mx{d7<)JhaO%X_MtXRF7jg
zkas|JY*mqtsr+`n!HB$s^7n(9%c|vXQ+|473pXOoM5HgA!Bc$IqonknL~XeG9m6KE
zX?zb;t!%xdYQr+!bWfOB{|D6d_o(R*5+%{a?$2xT%iFo85E6Z-J@p>*K+O?_<ijIY
zWp`|}r+JSzeI=hi&a@J5Y`iDfKHv>vYrwF(cfA2+<O~sw!yV?-BK_g!@2ZaKmX<Qd
zr4jQso=~hXef5F10*mn-_7qmB^RAFm{(&TQDRKs$VNY#zv`MKa@vi)^lFD(ktTBZu
zx4$K&2ue#NvxL;!t!=ci23>Q8p9xn`pbv^4*m`T)i1UIxfDc060xMER{>eCOO_Aht
z%lC(Haw6?pNJY;>6RSd}^rT*MHF&MW`>zOYRoIej#*TqPC$2}P7=ilLOC{!SCASY{
zXK=+Z48qV|IsvhRV)kFG$TvfB&;ovau0u>D^y|`3rNnTqeozaxP6o%E%8nGMsIm0l
z;X%AqPdQSe(oir^JJ^z6Oh~J&&ITyz4gB-^DK(ab_B8SkfDs?Ly%zoUG8LjG3hs%c
zIW*hm2CTSx=Gst_(NKs_40z()+4h0H#A=O@w&j#1NK2w>z;qz*NiFZc{QIvvd^9YK
zar-1Mx`GtPRKAqsaMA1!*~W&6WYp$IG-=`E)tA?zb@5uB&oCX+Ep1af$m?_!&3voU
zx04Uy3%*6_CQd6&-b87&b&`%(6U3Bo0l=!dNw|{lF+y}`pj7;EK9L(%vUY+L)_OU5
ziVzMI{XQm#y=l8;)6yBgN)!N4#-W(lMJ6f5gAP!TniUk8(6h5*P?g2-$2*L`q{WMX
zpGT5x!DnNSdnGX?@D(V7!?_?0_PJSizR$a$>`IwJF@0xg$_`*|lI->L#Z9?57GsUm
z|ITCwmhW-*ZBhKIKqX>O6WWj)rv1n7PuaEQKn#MwD=8}I{V%o*`_TY)vmBtLNwLZ}
zkGSm=N=s&aGyZo?H=VP3R&Q2Tz61sT)D7M8rw=_OhF|g9@0BTLglwHFkfOG!&)dSU
z05*YL)8YJ~W5$NP{e`_bTBQvGy+)sABm)kDAA7>tsNz4y;)g}SNBnZf^yr>Ztcnc}
ziys%40qt`l+HvRX!BuKP3HLV;6534nNEm)bz`s|HuKY)23A{kg?1?Q)C6HIVzZ4@!
zz+A6&!0mq#7hg;7;0112$bogM>`UfZ<ua8$ug09|pkD$F{L<S*rP}1*Tl)@ov`v3j
zE2{%qX*%${8bY$iF|Hm)(bRqw2+q@Ly6!i~>0D;ooeeIjV)(|MRs$j0APcY4(@6xZ
zE80yCyc&?p#d5EiIYBqISN1Tf&ii8{3%s3qfx@ZQ*j~;*hVEccdg#~WT)Bd-cv21Q
zKIcNd!k&~QZmq%uVo#~*@Xg1ii=Njw(c()JUog1YxW-wlLp`GB?i}3E-j?ErvNKA8
z7zAPHmBiYj_rKUC?iXNZnhP*pU0RU%atxkqGMtbw^iG{_kHxNYN(T%HdP4}(q&Dwv
z+Xt<V<&+jDL2s~u1c{=*v9%6LlCA(LpD3-dK`*xljkXb!TN@~;+KKj2Mo0y6673*6
zz%ox%wld-u`$KNN(Z}uJ=_;+pjM96Ss(39?u{bM4txIZ;D6L^}Lyac6fCLifT@*6i
zleUIg&N_iS!&$){$5GvTY)e<P+a&)J)dKJ2<pT#nD(jJTL+m>>)dT^Jc0k>%ro@h)
z#>?+*n~tQf^X98}C31p;FZ95O(Ej|sgWN%h{i?2!5X9aJZE7PvX<dP$VU=;^P@d5f
zd(x0_cyXgGwGY4j{h5=I_oO-OWg7{Vp_WUT>UdPvU<qhVh{PaMWPK@<UL#waU+lIS
ze}*meJG?uUv9L$CDAdr*jD63Ri(QT<l{>s{VXD}v!x(L#T<5jeL&57x>@Za{-Yi0O
zKw8*gKrnA<NusEYrf|lRbkOJ{KK75YYsq3D1YuWF{Gj*0SQEQw5jVMjZ=RzFAtYzJ
zO<8+HW*6QrL}nr_W#l5j6!gjK)mEfJQRh$q>ZA3;ntuB&E$-1tW+Mnu%n+~a=*gyK
zOG{sUMH2A_+u~HbZ+S*t>2`U&5S&f37Nlddo?+zN+Exq;+)DhN)FO6HWEUiSkF%mQ
zJv?gLV0A_+gq2NBT`dnZWGSoL?LJ`}Rl#|9A4d^8rGzYtP5(|dE0WaNsU|TVfQa<z
z;ev8f2PFYTJNH3Fa%5@Jw#O^lS=>=U%#0XXuB8<lT(@{f5mJ!e*jmR><e{LWK#Cq|
zI2@=ZOO5)<v)OGLr)VL$U1-keH0NvV+#nNPxngo9ABjwy!dhd}7{)uPIQg(B!Mt5C
zD;uYH^N(R>AwelqtChpjE}#`(PfC@eW||2fHpQ{T11E=$Ijoizv#XMNH%oCn^}xuX
zUik5{S<S{Ck0Ypr+d#-UK22<pu~7Y*tp+}XR3HR84kdbRGL7mq&3t^caw!8J=MW6A
zA)BJe51SSHA6EHLb~Z^CgCG#T(UbuRdjE?J&1$-cHL`h2%km}sn2+xN|3q?Ig!nHW
zJxpf!sMm?D-h)l1ka_G)ZF#7Tl%&}qeVkw%Q%G7pGpW1r@kOP>{yMQZQ`4Rgk`gGv
zt1VIIRU{S%nH`ET8s+!=C^lOkJ$wpV{5)&LPb8W$+-e<|&;O!0KY%4H%C*-puJSRt
zGdf)_!8y>^kH9B+EwXQ{a?V>OTPYpb^BX<306&+TEuWWu$(a;zW1Kbo=bsA2Nh^4e
zz>Ud9X}mF%0lB?$Y1?66osFgT#*kaYC9rmd!C&4wkIhc4fZ-6G)_{G)jZ^D!X*QOM
z^N43z4C54$jQzq?@4WIuv2-|^1dl2TPBC(G(&we=Erj3?d|W)ON$Wk%Xq|_0R006I
z(-=y%+^WiK;08`QH&Z4UV6@p!9q5;il$sNtGa*$0aVAaY%a5$p3DQL97^>fiYR^&_
zq%Pg5QHjyf<j-*(8d1sR#=!8rFujM-ZA7n~0^h!>L4b4w+T7UTZD4{2N_#qfDLbPa
z06`drUI|bb-2Y;>_*KBfUVs<_V{F~)AxvKmC?y1Ub5l)3#|yksbE$u_gU{a~up6=x
z2y7zmsHem3sMgYY4$}l<(aR=Q_m*y*6mgciu#;=2yd~piS<OkE)<X#A=0g5PjV_)p
zcf^6e?d&<h+^`$pUt^Iz_5{qTtP101vK={j)i_R(|GD#hFD=u;9f64V_h18k&q#}-
zmI?8cV)9i<Ul@pZc^k|wEm=#8MvlxD>LL>3$Nk5j?{i_5;o$fMISGS91gl{}b%^qz
z5}b>oXjW*_G$cCsLOM}HML5_ScqFrXNsIXPqa7Jb#L~~8SqUzhK_iK=vj&_k9Sgd@
zv3=BN)`8@1r*k^TP{lW_sN%kw1vs*+x2aRB*0iu~a9-$H+h3YSI~*7%NmsTF#~))}
z>;!xr3gp#!!>ItLAS#VXQ%kIYZYx{AL>vC(6CqGHWT$NxqKCud36<X<@YP&0^1Oz%
z4<iNDIgl#9d6j&O)$HQcKR@K~)emLolEW|z0?{kQp9K5<7c0;0W{e{hby*3eDi#nA
z^L~+)?}q!9H_e0fskq>qssn<TYD?$ieT{#3^&E2VNrjdH5kz14+GAlGxihgcc4VfA
zsfyMU4aCxw9eigpsW(JA&TIiAX1QZML6e?Jyp5z$CM5diN2b-o7HY=W+*EqgFA@e|
zT4CBh{EL~oxQTCU4FRl@JtrZ-l@XiRMwo)p3TNDZd<o|zV?1aozv<R+mx2<;wL`2j
znR2e;8}`9H@wj`qcctXfGx$BO+AtbW$5F=3=ouBvHFedkx*M-rH?KD_{%O&uX=d1@
zrm7pDF0g!O_YAa?GhiyV5;WM9>Ff)k>^T&#jLV)WY^vYOXy1?-_qZ}TGsXs{tf}RI
zN7DzABI3(SikV}|ngY5$r$_Laz#HNJq$Y2%hq9&?@W`XG*KP5lA+s?$RC+^8j2#14
z(=~31cr{KO^&z%46_>{WRMqeTjgY#YdFrOFN6i}?jGFl7kbN`r&@wO<U^zY{fm5kl
z)%{R*t~U&XFbrO)JPw@w7i&KLg<Pd(0aS4moY=9C%&AqDj`54jm^|4J{-F6GP-Q#T
zl~8J4c{v7I#D27Yw&VBGQ3Z#g3v?@);4cq)udJ*~#DRx5vqFyHGm<R*TLPu%ko7@Y
zyfK%s7n*e!h!;gU4i>+DiHHfJote2^q0bc6I9%1X;4noOBSVGKmfUI_2fsK9wSl#M
z{)`n{M@5etssQ;#y&1+yUj3CyS214dLkfycE$Zic&f9pgq&rcJmpaqtv>_>H(9b7~
zQ{lALE^V9%d4<uKL_0tJ*p%NtJo5a88~*I}Fn2Q2F|k!TC6VdhByM42%_x}i8`dkf
zkqSmP!$H}^wa;J3Hd8vAsX+cI2ywdBnMgVVeJew#%JhwTY@{B4`iWnu!;y4F?aJ-f
zV<s`(dp)$nca9XXN{3cKeRJH%y$tua%VCaQKH*bYdd6W@FF5>s81`HV^i_x>1=$UO
zSXgAAuIIju7c2H73W^)5ep(d+gN1u1Mnw>(BewZcc5X=)gCG#yQZ%5r|BVgD`N&00
zRoDPU-3N`(bU%v>G2|JBLt;IC#w`>27Z!1Xf+dJS7Pz)?R5SPzO{FSoH(Ee)&RBL>
z%&>~>US>D<q+)ty6B*m&CZnKck!0iVW>ggvs&zdXw)CEf9cMS=GQ1)bM^HV)PSw(=
zeAA|VAzFBdvu{H<E2*@D^4rCo@qp9x&!!CP{mhQlqUg;O0CL#k07+rZe@OW~bnH+$
z78OWRb{!@xHTNY(`wUMN{V8mqcU<A#E|aw_H(3C=BdvCm_U#|@9y_{&8-D3<6AIoA
zdkwJ+xX3cR!S={gH=cXrgKNZl;N`Wbh)SbJti5fUMay_3Sk$~hw69HdeeZ$mUQ<hE
zM_>{OsQ}D16*T;PR1YG1xx`nSH%N6l#H-&>`Qowl9$FXvVw1ai_GsXHudowAYDPiQ
zRxuo}Pc+@0Jx=O}!Ds5H(w7r=TGff@Jf|Psv&S|qgJpquQ>N3oS97SRb#Ep!n*x*g
zc+{&^@5|WQLB9O0+kcdu>yf}92!vbm5fJ-t>{#yp2xczZ0OJq|i1_WB>DNWeNrnSR
zd4{~I>iPnKem8t@;oQ~1nSnNn7QqWf`p!;Wsj(L>bTP)=F2ka;6Bh+0`8A_QqK3Q(
zc-eLC#;A2CF^!ISUw1YpC2s+5Oz|gD-gpj$mQcgBQvG!^P%)D;CZTt+e#J@!&goz1
zC+{myEDj75L)W{9O7W%Op?scL91t-8o@oOgRL?XI<?@|WtQ)ALc)|yg$i?MM#3xdY
z7nXi5?U-5^nhUBvCsVv8P!480vAeZ-;+duEvMJLUT(yQk+4_O<RM{w0`yxSdb{uY^
zzpuVqYHx%Yd$okgc_cuBUiL&s@qbL%yWu3IVM`Wv4${r#c+)7`XH<fdG4Swu<40)q
zSSF0Olg5q2(^{aQ(C(@Y9VWwTlG6Z*u7@P0Y5j~$Z!W=c#xo%z?q!uHn5xXf{R0yn
zXMk60apML-&Rs*2iS|Ut8O_tM+eWhpH=O;$!vEa;L)p3ASPa5Iw50??F#R{SKKZ)X
zMA~TpAp&M_=5ZK1oymc8Z~{&ORGs#qH1WO7+7}WQxcxnjX9a5t^}=_4&KnpNr8Tfn
zzYq6<V!Y#f^pstWW`mzVC>CnxS!&|Wlo}q3g46jJl*39oQ$|i|stHL8Yb86zs$EKa
zqW`dSuA*I$W|^%UC;nFfm7;_cb5oOco2N5~87A*Mw4cv`L~6=8@g#0s_A1~87!XCN
z|7YsoqqooHHO0Qscki2vl01;rL0aym;VBj7lqtpUbBa%VHoVaeFH)s#;VB-R+!rI%
zAaKE~{2nDo({}?L*n2R}TaU%El7)3%@9(kGp(C#frmo$+ntUqn=$(Ya9f-p)@U&(2
z*JIMaNnkvY8yO)7vw0<!DY8pn#Um~N2RSy}ChH)LmS(<+cG1CR_YCm+9Ek0TqQY19
ziEFV(76hHibyfalnj#hQmAW}Mksa-dvVY=h4aIuclMPP1G~VbHw#!R}{ay4w%FgY^
zp%4b56>W6E5O6{1zlHT-f7TeJxB=@b;boXPbM?C3zudcv=`zMTUK90mkc~^K_`jK1
zUnqiSvyFW;p5Er?Co)Mg1j^}gI1kBvD8#u!lNRTFW=-)x91OtHI)i3;;l?*U`g`ro
zUW}L&{;t@`=_KLJz+3g%r|3iS9u!`H)n%6@5_FxZUiRJnFT9A;S*eHXmy#*IA;wp8
z#||O-?s0eTnbNZD?pC*Ary475FWme|OZ2_^_~>x_J>+e}UVpxluHL`fJwl2SMT?H6
zYLP?w^vslgZzl<B!4`A@S6@9?az^GCaWfOo8i6`QWz3kRd#-)|a5pt&c}38>K<)~c
zbk>HXeiU^NH%n3vK?vt(7~6@JP@P7HcTPK<*a%sU@$gKYvE{3i=(Mu>4Af90Cq}Vc
z2DGS7p(9uYi4{Y5*5iex)XV^JxSSO!%o`%)-~+xog`H7{%OL@+6OLw0`XLV)++e1(
z+bqG74&G&lEhUkpS2C17b+8=da%zhc@msAOm=L#r@t3kIIRY32fh{G79Q`*I)*p&9
zp#feZ*B)i$bc_U}_Hm9m7Y*{UTVQF0P6R8E*bN|wsE6{)=kXpml}NB^BWI#}m=lYf
zqbce1Q%=tYosR$74NDQJ9!N(()U!m+Ac`LZ+j5-mtsu~J9v^MU0EKqHPFwyKr&@5Q
ze|5@m@)$&7^h1yNF0uMQ<gk0}yvUg#W-1gjM*-2P2}}3bGg~a<$`rGR=(6e6<BRI_
zI@zF#A)ll!tdEEun;h$GTRaQnKy(u55ws1!)*O|FI$czj#=&|LH*yCiR11HHjyRiV
zxDMmEIic_zHB7k>W$&bXhU*aME^xC4gk%;+CTSe@eC*suN2&^F(_HbEI+ZK~b_nuJ
z(LGKw(t|QhoeijuOn!{_tV&BOaw%N=aY(zz-W=lq28sz@h0Vqvp~!pWxigmpD3uuc
z>?uTBd$A>zc3fzI^D~wA%=OM6l>j@?zJqTb_{XG0Nzhj4R3o8b$ZPxla$&bJsFgB_
zglw;kkFs+~Vi*L$@RedD818?u^0kXr&`wx%*I}Fl4dDOqjtLi#m9_Aa*tQKVvmgg5
z=>Ue6`{c}bsl3BU7N>by@I&fd^Xy$p)tSuBjUDC0=AQyTNcwr?1gY#r3G5EIMQS=&
z_kxmA>1QTo9O`#ZJwK`;E%j$Ow0-EA-GMZTAF1%qGFC!LgMeRcoYZ3!PR{_z8Slv%
z*XRB{JT!5oD`JQ?J5;p`=E<N?Z-6f{!JxE1BIo#`3q9Th30w3=l>+sezl3l}#S`$7
z{`H>yOLW|>dbX`<<S>1gZ#-37q_I_EpW*gZ7_5wrcS|;))`|q81z-*!YT??$yZdjT
zzi^2CvV&z6PL19vj)A1*;tsR4O9CthQz_4QkaD2)7Z{OJ@G!vfiXVmW51uGJ@VnHF
z22>8>C-^IRGXT~oS9(&)lpuLbsb>^vUb4%A99HpGv;fQLrYFv0>gP09A?Fh$)HZm8
z<uo)3>HWRyxU)r$N-1~%<}g)-1azP~em{7d{+}0RXOJX82m-+`X{)XL|6@yf6YQ9+
zh&g-cK@>@<K2|;s#!C3nLnv>(HTIg)w6Q}Zr{K^BW3U0h5#QpZjd`f#;J*Pj<HauT
zw(|m9NFU@B=xEy^40L~y^s>9G5`ZU{1F+@?f>)0NvFS^fURipc1py{Ocyd#K^$U-z
zJR=6%Dr3gab1c1YPqDdC)1=ToPfJweY5ihHR&ql^$t8iysf@vUj@^=S&*l1L(&9C!
z&tPZYJ)QU^<u>P`gm>U_yc+ca$^Xnc{h)t;lXBk+2Z+_MuY0$^Cp!HpN|akqU~-W1
z-Ie1o22Jfh^w#&<!H{F%yw2f(Ny{Zk2{Ts~M04h<69s5Qruw?kThd1f(~sDy^w%%j
z!!Ia3*Bwm?!60<}c<nfSLo!}j6QbP|Em#Yv4ubDbLH6FZQEVENUCQM<z&bcF!r4#s
z5pj^uPufaCiL{Paz5Zk94e!o+>E<g>I_rrDMFj=Io~`&M%E7284q8BX(3VCcj9ycx
z)s#3z;ic=3vNOA37zV-cO1=`q{)?5*eW@W<!ve^%NI3i->Oee&GhZwr5M1q2U&KBi
z+)+OUEWO4mZNT)6mp(GZ&7*jbfkS%)T#S0P@OEn|wj+L6F`h6eFxj-h??Jgfm5dH6
zAnf`(%y8shLO;<<Dq9>_U|5E<foiS*3qkb0Xe1l<nR%^H=N2Fs0b9#itXY=(RqW%r
zwK|Z4{j<>4>=nmepDQEPzG>Sp+zS0-5~Icva9LNX<U2zvOb)IATy|PxSR<$;wV=`+
zCt#C_efxIPh+xJX%!se*2IE1bzO!t$Nwda%orTV%_vU7`#t|!Por~7`j&O4h?Rb)`
z0`H|z6<@_uWGq$j?Uf)^jG}N2jMNmsMjgt02?667AlR9Pb;0{(*eDLW0~iBvIpfrn
zICZxK1ob<5{GNLe0%f9yHlBXoJr&$RcSOMLD4%Kx2+UGbp&jDYK647D-40~Qhgz(e
z;Jb4N{xO1=wB@#Sa6Sbe{@Z$tyyNQ1%{!LG9=w`;#j5^<X47<teO$hNC_A?#hCvXD
z?x^D{KK8${dQ3kelv*~x%q1pKgnPb)iDsC+eQr_eu+k~@n@>vgh?l$8d_lTO2~uLw
z=GZRr!>l}e#P6m#{Gb2|u&_!<k_Vd{+IP#G`P!Af06+A}wVIECZRL-4oc4lBw753?
zt`X^G%H&Fi;N##jb*-}oT|cs`Dtq!#tml<o;`i1YhTbu@s5JPfbAEP7-w`<JW=LTG
z2xm)OlX#>zxnUl0<oWr+A+o7n%;L(2*mMGuy&^NP^AHq<e8q|@BSUV2D2rc<6EbR*
zhKP=gBt^dgsEEHkHHuh|k?n*$eR0lVOzi?g6<6yyUoBRJ9<cCe7eBIjYV6CH=`$#J
zi2FmixWWKg%*4^U0aYc(>dJ<k_6Gz%_dD}w6X1f#Y5(TQhdA(Y@kg<WI@JjJ%BZ<=
z(yZ0cT>5uIxX45T_Ggel(-F67OW%>Gh53wL=^GAz0b)(vZ_3W-h+z<hp(_E#3GBaE
z{qj}p(BcKS;DaD6Ar)Dp8F@c325(jnKprH-?n~j4r3x+3>tQ9i!;}C|XQCeB8ZM6+
ziyfBuPpkhc%v3#mvjyo(f23#jBMxh9rYh3?*oqv_J{<x(USKltQC>D4_T)_qmRv8-
z{Zdugv-c?kDYt)AGj+g(3+dIt=OHtHAMggsLAEdo1_bk9>>tygzBg&NH`+EARwj{`
zO##bAIfG2334{|C$ZuH*iJJ5kSyo#JN|b@vg&;UurI2O!*^8|bRZ?KCw4V&UFNbfa
z*f}~dDZZ^5r9{<W23z*NSD~cl?{=FM?wGckFLc2NU-)DG?v#U^A_}}=E?*-blfjqX
z&xXz*-g;OEj~3r>qyT1jJFt?u!0!#q+!q_G6vA8`ZK^hW3n~H$1h#(Y48qj)095QP
z?6NmHRCTC!3SsIRO>D?*VtZ5{3zvg|x7E;<pNH{6`g-3(MgHfbf7Rkc*_GHp41=(h
zt~5N|f3d@<PCY<r%K}J23OK>oDQ<k!LD|Qk=(W>evND-!flkhY2EWq;izI;*q1ubs
z>wIt`h=}cjydIepg^~{9OpF<9!@$83K4zTZ+}47doSjaOxs-nD9c?cnuX7O*=zfY>
z3{dt9y|@EGIYLl7Jm&o4*2@O-Chj^FlFh+sTKZso#1*!*AZTL9K=H(jg=cz708~%K
zMmmyojZ9)Y`I}ns)A%OzO-9m09xHGRCgRkvDGjiNK_g4X-w)6rB9uK4<Z`{E4g~!t
z$vlU-IliQy3P^P`jN9zAXnG92K7Cv>oKOgp3Gq%?2dN$WDe>AtL(BUUzJ_?{bKIM3
z#Cr!yF4h*I*7d1UFD>M$5qZK^3<5RY{x0dZU*Hbz)Y$hN6nfhe!6ef7Iqo_a8s~Ti
zF%*ojQRj8jvRVkWaA%^yfED1cRY(*<m$Vcj>cCE2!cJ<z&gc^bXebKxcJ+Qz2}bk+
zcYY~5vm}RM5QtvMMl1KfSa`}$fN_nf%C|};S{l)G|BM~jp&gomq8|2@F7sV~m5&e9
zP^92^Bf}_G(jhD*%o*4&9b%{@yVLMcoA1Vc4v0_scsd>!m$Hs`-gy<w8C;_5hQ_~0
zjwIpuf86JIc$&-IaUi6d+ESB!y_xcJI6TLNY-C;bn*(!`%w(-ZBeX5qAJ+_VcEEiq
zsYwZRdUgwhN};#y1UjYdQo@{(+ybRij<%BBB_m=usld+t_}U^Rkhz20#bKJ*${kDF
zAIqTxGlLw>fRLc<44j+dL0rL^L5^lYjj;{AAXBPD_NSDfW{{&9uwiZD^H4(W>&3L6
z1LFBBf-{z#&PvXgwWg#3H9dQ!uai5?#h%X2uu?*rUWR7jDov}wVckfq!%GQh1{E6o
zuKR75^gSs;rUG0AXll@gS_Zp$HEXg*Zoz0J@ToHr6L{{!D64BM#<mjnblepShQ%5^
z%8e;;bcd}3!`TMgiLazkN@8}UGHe?7L)jT6M-YNQ^hzQ+>isVko~e8YH50jjwe+|G
z+H`+Hu@0e#fg}B_6$SBmvF;lXQjSr<$pgBzdnkU7U}$g;gcLbV2MUuG1yi;XX>Xab
zQw|R(t6GrwZ8)+?)Pd5Pg5n&8;GF9WjF)W#<u|fs(0G4E*Hr9o@?muJ%(k~ySz&)^
zDtLd>se`*QOUw{|;}Ov^;d=sSVUSi~wnCo0S^EPM&)=NZk=gGZ19yZ#)zOwhW%*&J
zZC~?1^_QT`tckKy#M8yNpk1gukqE=b%v7EtjxE+!!Ay0cueIV<&Xk@aUW!e~Bv7W9
zp$cWbJ{e40+s8aQ&AT1<((Gt%|F8W4idSMokhwD-FSICEi@&21vS2gBaiZkeD3WnA
zptvLmOH(VCeTZe;Ed7DW>qEPaRQR5-iLDk?g9)c4Y`B>Te|h3X-?AhI>=Vh~nkhlW
z5n8Ml=~_{$l{viFqGk$EsZMIG?=JY)Qn2~|_FoJ?lwCm*#2^U!l9VX+{~ue@*^97l
z<pazVs|HNMNjd_<#m_pw_edzZ`^b+*dY96naTQ5H8PoWhW(Se?=?HsonqS(!hMh94
z+#5ivWF&08Nm?C$x`!N_xazHxk!|sZR{DO66bbhBI{BoOMrJjC<@>`^A7w5!`(xYc
zwWXW{|C50&VG|{ssX?t^oNwsJg)M;SS%M1E)b(9`(7wf?8|)gKMR2``-haHVElym6
z=36{==yP@yd!LZl;-q`EV=b=T$df@)!JC2GB5Z2OS3@m$5Bw)1VYAV`e@vl6yJ~9M
zqXa=0e;B$LHatZnF!4SLZl8=rrhq}=ZC9S0S@nn#^jyqg{Lf>hr$YK^ljLQH67UQp
z7e6m3c$%C%`c*M3u`9q6;nEx3E55r^+ovigq4ybqM3-|~hZ}c}YAPa70-gxEp=Ssc
z`+Iz;%?vhFfaf~TiHeOzb%I^lD-0#jx#zh2i1VTBjB*$VK_GgiRRQ(>7b|0vCLOxX
zPWo?BTi}T!^Y6=3gEKPf4Ccy#UPiHhGX*g3r@@#6lPqX~0U7Y*B;sD=8zvDZ30g*`
z%k%TYlepU7nL?PxLnjtIt6{s9S-wA6`hHKGPI(REsq*NXweQD_JChi*C|WL%8m@G<
z*Q&2TCP`WnBM=K~9N~V+5E5g4t6I=mX&B~<0nH`LONhymmIRA=&ItJ*?2O#50451q
zt}OrUEup>u0lXhB5vH?_IujYjM+NRVF-)pISp9xeNZAq%jn08&Y|eUp1v+U8OfHMd
zE$BHQm@Hc&A*bIWr%T95^IjUP+&f|qab3j2u0UsSowNMBr9EqxOy?4Gl9(lf5$z!B
zo+llKH<yr;q%4^#@J4$#3}5DVw+e0sdru&>^=V--Y9?|CIK$aiAPZld0I4rdB-|tm
zrjF~=y(a{4QJ*Hdf}G^Ql*jUo%g(h%o3)kvS^7oU8Kp4@!Z7$sh_vASFSZ1qmTrFL
z0=l84e<e-dEr^buU_Zk>So_C}*|4ZnW-v8`Gz-bG&4v*)`t~{4DPAwA8`?Ja3!Z+K
zt|W^(XYsY~jicA;F0OL8u$WVPUK*YL2kpO+tk|z5`8youRE-NKwFGO<;OFscy}9_q
znn*f4!36^;oP7>`mhv(jV4ND0sELzi++)n+#f2Y!wQ4+RB!L}}vf6r35EemxOJCRt
zbppb$By*^<MmYHREql3zTZu<Gkqe75B`kUr)yoy^CvQ9##yz51yg17t7B9Hh;#dzh
z--pgf4+kFC|5iSW6vfAd&COQ_kTXzNYrnYm|35FWH)z~B`|ecjb%#y|7ngRWpV&k>
z_zZ<cHTp`67FFj$oC76tMA=bf>}jE*I=Ika1VIw~xRa{%NQV{GzvV*3+312o-O^DU
z2GW8>oy3&u+&=b5E>Ts*X#u3DU$(n9itd9aQBmH&bO2JsFL-z;I6st~+Y!Sc3<O)U
zc^uGxW6}C6NMRf`pfR$+2S~RMN80qW-UFW#;;dUbpf&7+P1Mw}{4JMK0&=-lhu&B`
zP4f4!c~eF}?v*b$?wSDCuZQ>=%|}z|@c%)YQ*X$+13*KVjwuPb<Cm~$zicjIG0icf
zUqmtra<gr@xa$MmaYGG=+Egh4xpS9jGUc$`(($V^Q7Qcxd|SBY2ISebMti5*ozvlt
zL#ZRN9Wt>)rI<3>v3%FR{1N9q#@RJ!zws(YQLizZ|AG@Tv0O*^pp<&R>hZp#JVryd
zq(zH9jm#q+4>>hb@1i?}MvJ<p6x~@hQe)qn7;Fv|cqA2*uV{m$nHl?D)(Ks^a_)qg
z>TKcLoT+>qv7VZ#;XBxMW20Ls80I$G?=zGTd&O0;uqkT5i}<1S`5yQ@cvr(>+6iOO
zX3BaYsmdR*j|th(NOY)GTmYA;G{q~!ab@zc*N`neKr!2i;%^o_5nSXCWmj}$K?uTH
zS`m%*-`El7euUe5FAX>Y<4Ryd@*yF9yK>Pcih7BiZq&u-`jPUHwE-Jt)6P~I-4!#3
z3Qft#>)!=5Dg2~0zoU<JQ0j8qEaW#dDgIQqK)p*Nhaj5$Y653U`03{Y0^`wy=Am$V
zk>-H{^(@g>2oN}#rVCdg-a-L-mgp;SGPS1pQ!LIe3Q!QRo>^9lATo^tv^Y}F<Xdzp
zA9=n>WI3O{y5)5wbSWKaz&WSWw0F#ts&YSENyqD+9$bojCLP<wVK>FABKAUVgG=Gx
zHE!|&p6q5H0>*NOhZ26)8ao^0RLZ2~v{!3kDJMJ8H!S+iPBzk_PeXp^6;yW9S$M+&
zPEqpokE^E4?d+zraD5Ma-gdmgbw3Ld0=#uv4kRCbKD)TfrGO{^@aD3ND0e;TM?Bdi
z!sY%R5+=N<EW_Q{TP=)zJSx68`aK_Mj7e*G5|!Gp-<IP#TS0~I5-s=#0sc^SZdVM$
zAPilpjbG~ii<Rqs^Z-p#7T`G8js=#bA8~xG23vYzK=z_7`p*b2zCIXnPR=8`{oM10
zz!gN;y!jtirLbTnz){+BB}nMSSq{sC+E~-d?IUyORtXUX;>yI59xZJ<^Hx)~<0vG=
z%d<Q;HTHo(W&2t$UBtaeM+=CkbNR}vNP~lkEUgkE>^<&{m*(hOs4n}<ssadmG?RZ!
zXifY@QX^g^h<Hw9Q3(!q#~7nNz^7q?-11VWfWa;o7}qv&B?A-mKJ3MZJLB7fH#W8k
zEGoh&e+>9M6@kAppljGX*}kCWNIr@cAn5IkteC-ksq16aeINHc8^Oz{?Y1X#2h}H4
z`zj&9Kwp8{w2cmJ<WbN=6&N^9TPP~Qz~MTQNE@#$gf#G%OG}}I0uxgOzTkeF0jWZY
zc3-OCz!3@3mg$MsrX3n{q+Y5@I54QN7;-qUB}Ymw4Y~pXg9^(QDeC))jGfad+4nH;
zP1(8SNDRV2@J6E$f*<$4*tq>QHp?n~0i>V^3S+8&hOQnKT!cEF{|B@o7q5-Xpqezn
zts?<o8Oqj(gYOt<6s*;#B6K~-L_|AI3ik%{M$uZ0D#BI)?*^_nAUtj$Xbh}X3(H&!
zh3o+xiTz<+r1<S@VKEBUs)Z%xw9ky+%$|PQFoxCS`25ExFl)XQL7gtPi90J(+YC}*
zR*fsrY+SLBBfCQKxp?<hGGzACk}^M<mmuhdg;~OVS28<AXSx|T<Fs|BZQc|$pf{r*
zr=`hPkoSTpOT15rwW3eCGkm7iI|iT2$W0W{Mmpb&{m-n_%khEN?Pxm4Zs9j0pJ$}q
z#UaCYib8>~r{Oq5ZF<B?rzlOeCY&yTA2p6J`LKPw82bG2C8idRA4v>cD5SJ%oimW8
zC8YL=^>zw6@5kB|sZLRvU1em?7hwaXK-vFaiqU$!(1eZey3t=1xVEYBo#C_|E`(JW
znMkqW$G)+(-#G<uU&^j1i(wFiUCAk0xc|kLxSt8ymK`9k53PnZBtexjrPtge!ddSZ
z(C3<X!#};y;)=97GcCiX3CoZ-uS!9GsMRiEvOUer^cnl6C_Y(;Iq^C>Xt4SI0{UDO
zPdXWcj*Cmwu&y3D!wfY<DBwJ*{0u~eT&#AA8>)p=G0M4g6h_#VSK!B*m{0z)DTpc*
z4UQh9&6eSw=3mT8FTGB^CQj=x%WEm_X*Fd3jKQW)u|H*mK~T$3#D9UxGtA9H`XL2=
zqG0N4rNG-_Hg{_2da&om59eK{7OIDi#4=RT&X-_{Dq3*86}0`8Ny8)pVU<#3an+wN
zN1Y`{|EO(ex}D*Qs{(}?P2h0Yw>XNt{r?vDSdq5o261S4aI8)1&;9QW_UDNG@d`F+
z^eeokwjz3*CwO9WsX@3JN8x42adZp9sx9_SQQ9i1?b8;S;RwZxQ@1Is=ciuZKyZG_
zi1^Qc*JzEg#lCs!?()z9PsJ{CJ%&7je<?c`B!)o{h~B6p5I@}iVr6YR9i^sl0Vdge
zToHJGp5<D^GP!_e5d_^9ek1ffmJ6xUH(M?ffC-RFy8?l4BpK&n^^&^%b=5=HJm6Yp
z=*;VTN?J*{I@zjN7=wB%NK#FErBLj%0$U*q=x*1`EOsPOM<n=Bm9>&ZrC}FaFo*l9
z?lhfB&4?lk@6HStkiXT8kvVh<M81(^*##=2pND}nqscXk#6ByspXxQj&^NUo6nQKn
zm6nmDxdtkw4+oG#v2QMXccWusry2d6t^HUDdgjXAkcc52z{H8tMR!ji`ppA9W4%fy
z%O||%Jwb7sBSZylxt`rx5++V~9SVp_V6|nID<F}f&}RXd&jO5;0N<}}JTP|?ObUAk
z29g*)Cp9Nj#T7Uc7mB8Cx2~CQ6!T*MFu=n<FzK37VB7GSHAKatbOk?NJ>R2b6xcp8
z+aip2)rQ$cXFn-LW)VIwb`dnold>~9LKuc&=tdl_nxxr(F{Hvru?bf#;45un<iysy
z1e%#+rGZ^m>KY-;`o}@D0I9w^sMlh|y9OCQxagK_L#$tbbDD?56pAw$?wXx1=%#Qm
zEJ(I10;NC_Q0;B?vNS9b3$pJDKO5InmxLIF1>vw#fO2WB-Wq5@v}&vo7C;3^JB~?l
za!bp}TBo!3qOU*Y$etk7KD}v<o*TMuXGgf<&xW%^+PB|IoYpf<=VBt+--*2Z`B%G@
z_L$6&@2RJG&f@>b=ngOim%f$bK|v`l;S(nbZ;qS6*KZ|RuE=v#=herd*^3g|QBr#%
zR_?6+b!8-odP7ko7TpAYz(N+v1gTYJd-5^m;LT+#z-(E%jv`w(tAs@_L9$)xtk~Md
zzX^Gx@0H(c0Zfo>SJWD}u`E<7?z0q~4#Wh>cSUVtl<C?ao%x|YxFyJP<BFPZKDJ;~
zl{KYVBCTaSy7Wocq`an;bLiU&?M2xcWl;!%Ky*u~DYmh<{>SAHDUWP`iljyyW{A8h
zj?u@gT!O*IgUFkV_>$8y!|V<FPF*o0F6I<y>$g9ByN&!g;FZ4oKr&7y%~M*~5ETus
zThT{i$F!u}O<MP3b~F_1*uR^**HP^6l!%w-VcT!Aw`hgO*clMlzkhovKa=JeEK^_D
zkc!GJ4n^^`r6AlwVX0G!*+^rZCRae(8B>!szHw&C#H4w~ikUtrz_i(yw{@Fp*sXFa
z$cmcFWRsWNX3*dwxWd^9BTNuWtJH(Yn}n=tn!4+Tx-b!bnn$<2$;bjUdx7SUsvYVg
z64yiq3l0ei)(^gua><|vI}d_y^0Fzp6dv@17SwD__XEyJ9AhdOCzIwagqVL|)E?7y
z%n9Tm^!M}2rs7ilxkXZ?m&tre)#|8B+=uUC230PSDsW&?w14!&UgP0>N!gdQMNtK-
z6;Vu4b@kqHin62(Ozd?3_owWPawG;}7<!`>#HAtkzu025A4Afv#uq>+Ef5mp_o1Mg
zH>n;xpw`sus#6k8KhHSIA!ChccEv;4OM;rf)B6NgE<j=`-(`O{_IpT9WB1$Je%Cfg
z8=s@D6eacaQ&kq78>h2J=nv-WT>_h6o+K~!CvM`9*OfX0g}Q__K~lDW{&3XeG`Idx
ze^$UINXnK@QJKY{Y@yZOe3#HBn0Vhkq&)Le$ATa1bfs-~3zh~SF1!lM1QjDRj1M>>
zU~C7KGep9fU?!HHb7Pu31&yek^4m#B6C^bYH;xq*daqKVU8k-joJr5JE`E(Dmd-t@
zjldUU{}Yzva)fQCN5|XnS!)3j-vmj|61JHs7je$MqF#O%B?~?EEPZ`n-=@)o?ba0|
zVNMY54F!p6g40{2jd9Vxn)!f{bC%J!3fBZl&T?(`4~;Qz>!TJ^CD;jKyhlLFI+K?Q
zi(_QFt_9;GA5jX|1mW*9l#<Io-O4XzSAfJY2*SQ3Ek*tR$41=kcEI$O4{(*%5;P>A
zsSVI4ypY-h35g1cC<~K2NvHHB(}H2u2~b<#KLI#3Qdb&2f3t<P?EZ1cLYbIo+apfO
zu|!+qO6yxP+8Y`u8`kt1lYxC<qufcfg##35?Af}Lxa8Y)9wYCUpGYZ+!9xRU<gzzq
zB?j-z@<T)C%_6*r{Gr$B;~#+!`8e#YPAz|=vIt5k-u?r*{c2!8nB^y772j;$hZ}rm
zXLWrM%A7={?K8ljMok2ihFMGRjV9WyUKQzt@gvblK=CJ2_%7+V!9uBjfJtTGu(>9c
zfmo*o;6;c0<0X>CnS?PP(Zn`+ruP!Jtp@1Vbu#5XqLLMAL5INHJJiD~z@RKiG}28R
z%02Lw1?XBfPC2$PNr{S>qhS~UstXWsEZ+p>N1_L&31vv4Q9K2#a@evMYD2lIWeiC)
zX{X?rz>y&Y@GlJ5&3)__Wmk~HFbu+eG%dj--Tyx}++G$~s`}Jh)S@B`G4_Mczu}ok
z_9IAIDb9*;bl&&Iqe3^uegsJ_r4Q?v9Dq~D%WG1Y6oEY~l<Y>3cqRc{adPqoiSCtZ
zq<D^?@2i(&F@mIz^6^u#_8hTHs}n8BWCW`|N+dpgOu5(1ZO|G31sSgTD0Jg(v>oRl
zxfiRBCYg+2l}Mp+z@<Cyg!PYJdmj?ZTLf$tj7xE!!3)HExPlceE!Is+m<Q4ixG)`m
ziiHFqZGY)4S&bl3O`_3{jBxT0Bh=msU{t(Dkf|mC#mMcW!a_7XqqHNE0}1RV?Ih4>
zN8Swb*;;fqEjpV~dj`dC1gk;{7Xd*6x{=aj{@~<&0I<i5lD7!(n`0E<9?>$AKKn-b
zO%=GfFiILXt>4}_yYn$0oO|=-OLCo>1e|bFaeow<wWj!g;FnJFy2O7Ek5uS()X}`;
z{sAn->`U1hB}oi|K=ew{pwatZZ2Ha56tZUJ0+vNIwt)TqA87x*y3ZhBk3@19liQex
z&!9fcxuIO6YNe9Mrs(kmzkrfLeV8o-Ey(sdBN{J(X80MT@E>O0h=?9-9@2N{uraBU
z!GBour`rInrW@tJA0-Oh6#m27KJAgBeVA({DY~0i&2viPK4bmKWN07e`bbLuz9p5y
z#rZS}k`(O2To;KZs(pr&jdhruM?>$U;R<Zusw;i<T5;E3pDZKx7Go43yVP5`PR;u{
z82Ke2`vWaS_AqCG!Y<R~z*1@>$GTC5>tU{igp{DfDU=MTH9^v(xE|&@NJxpb3DStS
zeEn$B`*<t>9~~F^t(D4ERmwVOoDA5*Jiw=1n7`7tUHdO}|2FVTK>Vc*#BiB#J|)`k
zlacrFSfB+}r>6Euxd&e}?vIS->usq(NJZcYQ>a254Ez$0eGg@d4PxEDf72lcn6xVf
zIDW;omXUkj9ObH@CNQ6;#6R77_)vC6SrmdG5ZzKJ1@3=iG5#UhaW=r~nJC&YcN6*N
z|Bt0@4=R#2RYuQA;O%%MC5fOr*91;32H|#@3`_xNk|W0&57VR==bCg>0hk<7B#wf2
zl)Sh^kFD?Mk$*;`FTUjX>KyOYdi+F*&A>u5i%LWQiIQ1kBCE$i=${eE2RR4qJSwiJ
zfvUKcVuh%!r#M5xT=SccSE{NoxDd7do=2fU)D|?zbsMZ}W50j;#|00?2GOh_!4w;C
zv5A=_)ml~<Hi%~Z2<+qyTyl8I_jVL|KPG!Pk5DKO^_DAlut2(x>BhAtGQ$E<Pvs?2
z*rZ=DvU%#A6vYBj-(QhX+z<6Tzaei8t3pGMx0kM42K=E}Bhq?gCg$sakosdmpsGp#
z$t<dx^u=evu$2SD>iQuSVn`pF#UNr4w!>Tp-)(CLJ;nOatOc3fz&K+x2i)}NvG+rg
zwIHwzjquRUUXRxU_%{LMrR<E3AO=Aw*b=Bn?7y+&<qt?Q_Zr}4$VI{6?px?lzSKmY
zH1CB>ssZsa@JB*sjtt2kFbEUYjejD)r=x&Qz}{BSJ)wu#{n&)@jjRef8FxY!rnI8O
z?pGNo3&~33A_J)R3ld8(L{DFRnM&|uUW5{ZtTZozfAEAGC|ZoG<E@l(g{+fMvJu;H
z70}g22YxA|3NgutCYZB~)j~a*x!LgJO36a(V^)MRgP0Va!Uc>_q}8KT?Nt+_1~Ew+
z8@{#yqh{XTVM+^PX>cT-K3d~=2jtp~OG8OPOe|wDQQ~N9a#2T}-UKjC5R+YnvB30f
zQ($!0ACW)Okvh3K2H**}RTv9IUl}M(h)HwJIb;Yn<0o3=!Q`XNk$`!N0TB1SyQ@<v
zONdpt$&syk9H+zcVE~*Gg;<^~84Cj-(R<w&4_joS3^dJ~9`IN<ecB%h1C%GkG;ezV
z-y<JUT%WF-P)ZeIT77dkdy8HUu+{b)OVRbC?2L{e20<X&QWP=Te`Ck<>%{0t1B@Yt
zthnr+6Egqw7!OE;ZZs|@pPSf+jO-gJA*&E|A|@CEYK8dG6%g;6R1vQb^)5Xel~F<+
zJ;8ht`SASR(RecRZxm82q1P=DfrdJ3n%F-DYr{4Im-RX|Vnd>nq)Ec_#lC5)bJE^)
z5qF=EJatp7LfaAFj%Fx|-Yoc#45x8v0HAexG=+}M%Jz=<kf`_Rc{z_U<J!@TTwmiG
zN{K_Am6N$Z-_K85?Lbq=j6`QP3jWm$L^GQ!@=@<vBr7x1>p|bxGSVxkc}+?SC1pPr
z7qTPK>;xDL9MN5~;yi>Aee4MEoFz|C&LC)FG*HS#;QgW}CQ3H^@^-XI3uCm)nj@wm
zD*xXfV>pWYEG|G-arZAw_MFO)Lx@UoYDxyNTH~(0`rR6_2T?~q$uI|P0~io0Fe-0i
z9~NERz(PW|i@`xfa$req1jLCqs4FQAQSmG*ujSK)<44)q-2e=NKzJpUKiz+^a=syL
zBMXp*XgLwT`~K|1VjTDdyq6q}({OmjgF{a22@E6*FVzO|P2lf!#&Og2ZSL-cb91?G
zB7Y_$jHdW@17dM@{Ec-c%4@H<a7g5xpgI${Td?(Q8TV0g=8!m`VvO6A)eJ_9!l`Fi
zvgVM}t;b6q);1A@c<!22oH>Lgk>eIDurW<BnDip{Pg2eqOj-WP7|zYtL9-;fA{B+K
z<3LPHCh&!MqgO;%WTFt5$uN9YkO28A^iM)oj1414L-%`u88mNVf2Jf%tqj*E%})^U
zmg_H_<%+3@1Re^Y-_5oOHnC=2Tgg&H!W4^3{eAAi<O08R5lfCD5`idQyu8Hf@Lki9
zmb4=)k}Kj+hKDuu=sfsf${8t1t~kkpH#Z${XZ4jmUQ$w0VS$GNgp{XR{m)G;DW!_h
zhy)hO=-~WIQ-$cai?~0@2*w8;Y$`7`wo{#RQ4)8uPHvgvl{D0|yqpOu&Lg5NV+iMb
zC_AGhi9ryEUMZ-kbN`DiFCSZlL`yC}F-$ZKbh=w-?t|-Gxd^^5%0g~|0cc0PN{1Ox
zuQK14#j{)3Q&)!WMG)`~p)<&DVYjeTl-Iu0Ktr1skq=3?g@S^5Fq>9;8GJ~CWb8q7
zp|>FIYrV1^ny2fBFmcK=L=Oy?ltYL*hKnd$#dp{>YM5$g3_{egTNo?WHU}ngqefy`
z${|Giq7OFsbdh#mm_Y}8kn!<QFO`A{iPB$8`^V@-`$g=1t-bY+L1}DVVV)X9jlF!v
zYD2wx3W8Mw^U5;0L9RmY>+NYSEbI!kMwhvK+;=HB=6rt;=I4-1dsbA!U6;XPPB+DJ
z;xi*!4H}u4atew$-IVgEH2@taJ;Ql%YMwILP$!!rqVj@{W=~+?PGk%=)JdiYv<W*X
zO|+J$U&KAs!m(Xm`547o$zY9LBR4tki!qn|L`5OYS}vZFUkIH+VF$8H%C<unZ4^5c
z^=ECYz53vFJ~v4oe*gcm`=jiNau^Ch*p(Cn@%|SZHCeI;&qcnMkOdXXv$S737v1wr
z1f4fd8?6GnlIxGaUV;@Sh2)z#r?&*YqFjpk@qnibJKAVjErlwE8xnkfI`lg5PD5a}
zC+i9-d2WbBO<Epvv3Ip&3F%Gf^Kx2bJ}87uy&pHPO6hr?DxMo+$LUup`D;j!McK0)
zV|7d}1Axw(;KvjMpC6jQ<7>9D*)VzODroDhi$W!@4p{+hg30b17n4X^8tW$bIRoL~
z3HYLLVD%Nm>kr51704CnFAg}p<%XuiG;o~yMeILmi53U2XAsPWLznd?^f@WNw;p>D
zZMz5oe@p(?6*TwY!?5?1-8Rp2!uIVZ@}GP>#v7nctI*MBM_eyOr~(r;sHfn0bQ0d8
zhr#`)r7c(hiW;1MHbvL_)}}NSKifs{V^%bH|2Q}jjFK!zxc!CRMI{RlZQ(|AWQ5P%
zrm_WgV{EOYWt_{0mNF3TzOm(SyrUXArgA>v7Xa}?*|lX$41%yNDJbgxH+GYLUBJ#M
z8(=!AMV`q&>tVo}!vp(phfN<H=k)eg1%pVG$$<(Em^P&F%RZR?0n1MEahs!%3~)7H
zE2{*`2}Hn1VR7*KlVC;5g*egPnO3Bv0%F~_CU6mM+nvhsaH9E0RKi5-fs377cwEaE
zB>YZ}=v4lGAcj`%NV0}O7dmsma!Qc+%FAf1JdoiH`Hszu$thtHW@2!$0&_e&IkQuh
zUn)u=7RXmtgKy^iD)K))8XGoJ5(=>}CW9a2<_EPF5GtgGjg-Vgth+350t=G8J^Usu
zo9-1%+;Hf?eX^-wwT!w0=Y!>UMBI=}-xH2>u+WO*s9y}fq7mp=$nAl!V6jkj+1`<g
zn25czu}Dcc#KKezQfhXi`;>``d!(<VO9=t5wxx~gg7&Z=omBmkiY$pa9Uw+?Orsh+
z-nPpr))FM<YZ;wYI<A0>T-lM5B8iFXMku9!jQqf=mJE*y8m<|!NvT6Yr*q~d<iA+{
zqwL&{C<Z|w+EPT_NdJvpmOmgj6B=+b7zKIkd9y~~FyG3CMaryk5J|s$^nYsvsTK?1
z&M}`#LFyr;^;9}=5`^{`l4MlK$hq`klt)@*5`_Mk>AQCyUUax;wMQ%Z%!DAYay(q0
z16iI!I?xkjJkU00Xdw&-30e8o4{N_zB)tkb<u~muyP4RXUzYxFk#H0@7j-Tog<<MG
zc0$n^6QRnP@0*f7sIWI_VNozo#20R78WDF<MYyB|ML`g7nN$?KsCx>kr`50SM4~I4
zMIpD3G<Um~p8k(kY`WrMv>$qKu7mK<Q;&HoG+mNqK&j77y)%2YmDICzfGAigP2)+x
zF{$6j{+#t;?H8LQ{n}|)lO0CV0-!a2*+QZqHqNkA!{MjPTn+NDzI1>nh)pvVjc(Sx
z8AHx2q9ZLF3KB|4Y3j3vf*ogf*~k_T1+i^r$mP{M2T|sk59!cQ5PN1gt<GYeYnj#h
ztF!<qh!`PvJV&?dd=`)1!lNKDgzWytkFqn$k{ASm;FS^;bnbt#rQH1iGFiC*<0B)Y
zwq2kaF6$Y#>sSn4=}UuXh9?=I3IzE~Do_>jh&s&-92<mvxM_dpIEws|YIjB0ZTbm%
zPd??tS1dJr;-+FpR$%pX{vP?}VOM%SZ~oG)y}3K$qybtrRge;MM8#{^_WMHwO4D`*
z<7n6~DG9c?Ygoa<TNDqxnFn6!`+{-?vn&<``w{NI^Smi_enC3JJ_fjUxAAYa+)41S
zS&6nVgQGXx7+^N##<Bt@(P#@}bJ1#|d~8`6auE0>CBdHp9+_g$|FAbGVM)~KW*XiO
z%G2O|$sPk&`aYGY8nI2C-hUQ;|Hgeug}=1t8IQ=cB&!|;{+<c{h=LXv6d7t*N${6e
zfsv>NyWBMvLJ<gJ8T;Hy#1Qow8r#cY(8P90v_JfxE1lW&OXG&%0c>u`RKAs9Av&Ws
zll2N#vM&Yxk`F^l01=(uulm9V3`^1_8o{!y!Vb~tPEj`i!m_b==qrhG`WX8Dq3jH<
zAO=Aw*wTuM(tl&i<c7vPX@CP81(xrhb4JcvixeY7qa_SGUl=cnv}JB?U6MhBX!L}^
zVY?ToVfcsIRp^f|A{@SEn4;i@-3zaz=1uH#N}`tqVjLfEd9m5sK67RGAUeX~6D$+i
zNU~+FdKLPdlBk;T8Zry_hR<AmmnTUI8KMz0guq><G#@ic**%9PLk!WVr156jBUZnV
zM#s}_T!j8eNhpI%xISp{K)%w7UBy19WbsGi{mrw+up!%@LK%pN&Xw%k1tD1Dx_hbL
zDX@sHA{rl!=za_Elb1igQ)CfcL^K1if_N3Tftq=n7BgfKT~su%RexM1#dsRB|Cp&3
zasdu`H{vrAd`gP>zSU3BM${txi?yd8*77KgUk+xbgS0R*K916;Rx$4GH-XO?u@!^q
zpGQaZZ?(*u$met{%f;XLJt{802yG|ZNrpb6wy3(jN%NyVs`QFe)=lh>l=O4WO?8gJ
zPo^P}7=!0^>OWkpU4P2XC`Vur1fo}hs>R;_V#{+sHfZh21*XZQBFMl1ok<*npvL3e
z=r)w$9rF@6Qm=(UQPar5yy|=|hEQL^Mk*zZhD3$#p=wtr#n!3WD`Q4tQBhO+?P&sg
z)|>rJV}Ai}`LHOb@!(8~PSe&PrJrEy7JHhgp!32oMN<m#1w7+VVltJ6o_bW#vA^wE
zU)WRjBqo!qiej8A4BwP?2EC^wT#94Qg~vLTu`y>x)(jtU%$}?EYE^N|t7{88Wldr-
zIjXQQo*DpE>3xE{r=w5Cu0%MYQW9GQ8X30|i=rC8rV0j0jRtOi4uJP`XuJshY~#l2
ze+EW*&k^>PkV$BB8DpK|$DJ?C$cg;aqRNJW6R-6BfY)DT<iEflbj0~z@<vlntI_<e
z@0%$r6N@4nPpTP^;rZLo%?s5vLrB~L)rETtPj^piPJllM37ZZn=<owD%n+V?jUP2d
z$mG2~mcdeMcnFa-qP7en;Vc$3OthYz4!vK(UM4a9q3qmpC<Z|wx}_GiWB0$YJH!1#
zY9bpT4XGlpIk@A5n<Q6E^iFj%b7(A)O%MibOsJ!$YxP9h?fJ6{&r(DY8m3B9<Y||;
zu_McSheR0~Fla%t2MoN=q3OLp;<l4dI@2~UsovMxW(9GAC_-b(xOfiDOF|zXjgmiN
zPmyW)D}AZ1ZN7G5dGC(MrWNy6uO6+SJPZ=)?wb{lVA+sl>a1Z&rgYst&de;iB+6^w
zUTspIIHZkrW_<6J1x;(+g}ZrukJ0n&R0V~CwvcK6oi5XSA#d=M;+AkIXiE+C(he6~
z>1(!mW_;_F2uT`J>S1VCiq6oUew7Mq1#$RBjct{mrlxz|TnjJ3RuIQ;7;E^3zs1y(
zZtc1XWhMR!R%nu*?u<AS!~P=Q(RSs@+O{jeR)VddVc}-!s0{wm&-D=kO0X3~g&Jd)
zXsUh>WsCXJtH4$eHEK+KKDd%OdWIlc3ATc$Qo{svysCISs$%7|uEbwK)TwE{pDX<l
zM}DO)h8pWX%C04ep%8>!Nk#nJ|6)zpA@z-Hx+~+vhen0u84|BkgN2T7wrjKLT4H5g
z%7bNkof@<9#eu-|-$WuLDW2L7&8X5Bc-au^+KsU@JhgjCZgz_BzHpi}MmQp+Tv(<z
zSE9LVCA+SZj`2lbV&5TgO;MBr!Yoqni*oW|CNo6Uc`He)Y-^|W>*9*{68Qs=?FU^N
zb?>pk;A9uEPSI378WWK<Y$3r%QcDX^XK1R{!w7q`eH^(o0Evc5vXnE+)OL0Y$mR@g
zrBTFw8Tbb#a=f%sV*+g03Z3FqX2_}@{u9i9v81Vi-K4x(rmwldxr<JJQf08p^Cj{f
z4)?~d?3thwb+vUWpphY}UZ!UC$*xc&4UUfOA?^nlt}>i<R=~M{ci4r<OXxcq-UFr!
zC4;dQNM(s<TvRg@b@(eBD_H3Zzbp-p<4!Tu;p^Y%0<*D*AmgpQUS5J<LGiUVIN4#F
znFVxg=%2gEjAP66#Wwh_3NXRyiVr+)>nX>UA7y8B<S+;W(O&NVZY*IWC@B56kX_$T
zgmA`60SsY`w1BkF?Tpj5K5*I{w3qJkXxd+vB-%#Jj$;`&3}e+QqAI)=x8;oy!PLb6
zIWsNaY?T-;ZcC%SvQCl!8l;?4pACM$B(Yz^aH69pD)BhE0<MB^af|I5oi%Wjl=K34
zH1hq51m_xr5@+kWsL=X9uSZF-1~!u-o7;gy64bC*&$F%w)=+hWz(?h$yqBZ3m^>Ky
z%X)n3Rl0FpW~uDD+33C!=EZ&K*U-yexv@CBZ~B`moEKl<Ou|xm2s7jwJvNnwCD4m6
zd?xykvWuYi%fR{B;P<QIp(B1OJA6-Chi-CNh5h2ezJ|mQ{08<rAJFrpONuoZ*g)bS
zJF2snT9OzkabG;bn&?Z#f);EWlMKSr3iriF%#f4SdxJ<0r1vvl$(7JA9{Ek!hB%<&
zyJ=!=(_dGDzxYQX&iv!$0>0{F@KF=`<n^0QOcnTx-$R_V#Ch@6y@psmvOd}csgX^b
zE~(U|^alT(H(Ah6G~a1`rqDEg-jtnDlEfegM6aYVS>XN`Tb_Ty%vAaUQ<f7Eq3I`V
zLb(<*tI61rHzNKs@#2?%Y|E*<$up9l+Q4(*p}5eNt>ly5EETEJa>LyD;ON0aN+{#|
z6u-oPu~TMq<)H|gCBDU8?Pw?r7&~<~j09bI#ZGWhnUA%kS0ce!k=kr!8f%`|B9G?y
zA<<wgilZr>A1DX_r}m?w&|oZ1H1EQudo#aSc`H>*I2enw$@oWkeLFK^&i!iHKenW>
zF0PFFdnnQaXYKZ(C<$bgQ~2Z)AitBf#a?|nNFu`6slXXbG*PVv!}EOTt4Tx{FRnH?
zJ@9@3dv7i1DM%PEmNxjK(Ob$ta`*1y#czMz6F<REa78AjM{}*NHdMGRK2~Y0am}n}
zI)+U>=1JTZAEyE?9~e&t6uKFdZCi>Uv0S`b+^md)jC<{A_7Boj1?J+_;U=$v2|sfW
z>YBB3oWyhSYH>q7m8LY_g5&NA014>gqqH1j-N-GFkhWzD37`K{b_Q7%gCG#RQY0B|
z?|-qO+=($?mf7&~I#B_Ey7trEQjiq|<P%rWorQ9F*iy@qq{uK<G!vf&^VK{UA3%bY
z6m2QSie~B)W!9w07=#GpZ{7A<N|ih268=2&fdubsX3<0$O`bS#8Q`~#BJStF@P{C=
zIvgBIE4ARNzc?dG2{Ip!{`_=bfX)BomDOY!=8EP598wFF9(j*#Jv2Wu{h>)%e!%&F
zR`w1(V9_MQT~XOD!4zjjGxUkuqDxdJG^^Li8}7ea7-&;`>tyU76C|FOEMW$|BC|-=
zEWW$h)BS_$$n=LIk^I!4rW)uZ(m`j|_o{>j4Yne1QWU(tT#{tSF0ufy7p*YEogt02
zoU*c%EOq`-Zn{u!XqyE2{lxZOln^G?G5$hi5X#Gye+C^RTj<)p5Jh{a`v`Vq`$Lof
zM5NEUgF&v1#@2WaWFRlP;|*h#yW2Q7G~XXs-oJLJx^V~0#Ws)x1KCr482_j2+;SL(
zK_GY~zcBdz7wc}MwhF|NQPp2$ktV?|%)DRBd)H0jOk~5$3y~>D3?)rQ@?wE`L%vW~
z!M7eoe#yyjcxS<)i4DNhutdO6%JO0XdeaF9)}m8;eYop0)mZlcV%m`>QSKK<;UxA;
zR$PI~w{D$ABd-2c%dfHbNpX9}vZ|_J3q}xlYzNMmUhLkCgDn9yc(|ri_RQEGl5)M+
zaAj-P&Z$7G-gtD_PJ(Z<GOA|<F3QDGI9RZ^wv6n>hM(V{d>3m*#`R&yB4v9q$G_n#
z6E!6XA#04I(EE%Gmu`Z4uK&Bs-v|E-ovHquGpZBsM|a)jn`mJ_ol?G-cSg}_vKn^l
zcp%C=3%<{ZXQNIYb)lLd+VtU&A!B{9;o+!M>yUEa7fr?Cmy)u+*d2p|MOVeAHjZXX
zwX^8k#JIj3PE{%AF6QN-3t7*IU(9vpu<KYTn(3%MEt~|bRMjbaL}N-JW8$I2CVYOd
z<dzu#YZ-%#eVcGTl$}A21tADTucYt=y#K|9n#J!-p_69a2{E)ND#d&H9cOwr9sQuU
zRYbG25Hhj2G&N7X8W6gh6bVNQDiez?adI9nyrW=dpIUEs$TG1g6f@1q9Rc?&>f!Z`
zss)#c#cldg1gtJ7!<JdgueY`wL$L_@i{v(*A3l#d@N2u1zA`#0e<ZSp9D6$a(6L~*
zGFanK%q0&Zm;AHCUEkQgI)%tl&;cNUb>!VvWPKehP8bI#a1n-<*}1+Rq`)mOP8i4M
zLi|iaot&;J8*HI*!Z<$XfJhcfD7=5yv3HVKD$W^Dtd2lFwG{-YH^%>QjPq>y)ippG
zHpBFd?Ymou_MJ<L=1vc-x*Yl#cQ`pgWGTRF0hrZ1b6Z6nNsE;ePCOfMwghV44b|T}
z<5#aZ)dWD^mlFjSf@>Cscd}S&j57sCZD{Owt!iu0bHeq$1-BAb|9i(Xb8sKr?&x^R
z1HYC#`KsTw{w*R-xKY96M(wEK28s#w2g^T{UD2@wAqZ<}5ftpdu_NBcJLIh+4KOaN
zOvI2Jzdg=Sfp$ZWGUl@!I;IN86|WuB*ipr72=2Ll<b(kd^dk5nDRYb7K<gnineETQ
z^ced!Es=hMy01{~^b2VtmYkIeEZz7w1X+BBDi;{tsWrzX10J(Y&i}zxbU@U!O}h;K
zo|WG>$By}8g=%d_Z(wKNaK(Pdf)377?jaD@FanT7p15SlWA@u+_00_%K_2G8=RZ5J
zgi|d@aDYKNbeTQP%xK|?7mryW!}+Qmf!VU>-m5W}e0a<v7jB5dYIw-%!elq0-?I_U
zBShSn@u3J_m!7oj3OJ48H@aTAeM_riur}|!5;P689D-e{f;{S1|B-%S1v>^#4(t*-
zY?{;$yYfZc!-6AIT&a0=as&ojan7Zw0_&o`RKxs(Ky;b9WyfVMIonvYmumV<`gVq(
zla#k!3DiY*sU?vn&1)gtt42;q1=B?~j^8ajCp=+fVxwOKJ|raSGs+UMU!rJJZkBvV
zM^tD0P<CcX4#OZ2y;3Z+_5Cjv-pm)mPMHf3N{R$By%?$r5XQYp-!~<_(9Y?A;b;#=
zY#_m?j(Hm^jhG@5=ki>~oLx-H`pU6Y$vYaHGX7s0{<sCZ^(yq^M(Pm5xgf>;aaY^E
z)|<%B3vv!Q{MBhoo96FYsl-%_XmrAG<ToBhR$h45fLib(_>VO?9*Ce2g$JkqZo)=e
z$%sY~g~KhvsLgk@wG*Uj6(1T!mnjB4^MlV4RBn3__{VY_TH>7c&P?`N_9o@$#RzgZ
z^rwAzBLYxlrH?jNaiLKV!|_+W-y(cLo#5kAIWPIrD9GX10D;Jx%a2VadRobqMnMn9
zJg8=)pGPGxRj`UFje;5uaz<@h1G0J}Y;7e|8U-~RY?TCe6cWU|S&v>xdWNK7d|^cG
z)gT}6UP?I-jJ<dCzn!1@&4=1lVoJ_2ibhki^>0fC!1laOE50#`Hd7nEE8Hp6Uv7>{
zr6*IgnVK6@ma&k0&HD9L@{LiD!GXE9p@MuM6U=-J@4CG&W!HjZK?uUGq~Ztef3a=d
z<n2RtCUOBnnn4SL?PKKcD(t^)=%ndZivkFea*eSju78>PYhGhJIK^6-DLlI4)n)Mk
zH;yJ8dXd{?Tx0BTo#JRsX+@)|<09@08qVm3qh0Rr0u`xuDZilM$`Bt0_d<ASjrI@F
z8K&n1aFCVJAyT%ey2Ye5g@=3R&(&O1cc*k$sdu3t@o=tFe7Y^%Kv%kmhQJyA=sc&2
ztu-kx0kk_6GS)@tXE>bc6y^QsX~0R@oc$*7GZ^AZg-@`QKb^;HXT}+)7?XbZ^>HU|
zf*Q;bCg_r~iZO9D2sQ&QO;u#UWgE_<lu?ZN#Tzh<CQKTa;fVW<lCg?0IhsWJ%Ay-@
zO6#SVc8WU6K}uy&)D(0^OSwz?1rqn37)WpNU&X<6?iWkOD8{-Mg`<TAT73=*b;XoZ
z)X~Y`R4(bFS>XubPnhfzIK%F`FT#d99F@JOJ$)1RC1LkagD=6+VO7~`DI<cB8M#^a
zg;+WoW~$xR^8MNUP<Cy(7K9*dODgza{~J5hlbf3!ACa&5Ba`Y3MWOu*9pR12-=SIa
zbmCQ(KQ=2EVvfq$&~Z?-QH?Tp^h@Y79_;%j(4Rv-tg=*D5$72r&6|u9G0!JOARMR<
zaW7a9CB+?Kmj*ft55N2p`iRAk#Z>nnzhWu@!=jrdj1Wg|teHZgUb}fMTQ-*K5;C1J
zR=mM59fU`{+$fs$CGr^%*6|0A8J>I146abi{)jL~?zGXAAW()fT>jh5Z-Fmxu*DRr
zdd0C4lug=8<TD&3cY|R!#~RufXj56xh%iT%yKzpSwRSP|q{&0v3m7D<p-#_z5e3II
zxjwz}1r4I4PQg<3vckz@+U@8Fb0o2wg5oN-Qf42?G6E<eM;jxp8w?Z<IQvd(=Jpo)
zh)1J)#Fj>>xqrveWHDTqh@*`)N{GW#6|Qq;o2V@oh7xkLvBt%r7^s+ner!%9B0e<6
z)>7DS7$=ktvC*f<mzU;*IM3?gAm{0;z63rm;`c-RP<BSS4#OZ2yiyB^ZSH@u$M{K=
zFivEC`(Z^irGS^&AMRZIlN)59_i}4*SaG1S#aapliua4~{BLOo2fsY>Dg>ul7B=>v
zuBKU7#U#cS1r0YaOsu?p<Ml}0a>*se7I!Jd8eRTx-)%D=EZM|Z5Yfm~uX=&nz2<G{
z_fo0y0_4WC{_wQH3LyHq{8E>yydbLiHkz%@b}zQ$XGcFrBTP%LPoHbgU=!Qs=t`Xz
zbT%Ne*(URXto5UFU!oEI5^*eqQe-F;PtJV~#cF<v{Xz!}_sObqt+>KiUl_%nLz~_L
z$=~CW^K_}oi#AhSndwxh=t$aOEg8dDRM)^Dm`-fd-7<ZLl^QQ9Yt&2W;jafg!_Dfc
zmP}!6L^vucl}lL207`yx@^d&M`fcJyyx4<RXIZ0Cv5Bz=x?xCjDf2;?aGUH=s`Mh|
zMuCCMJz`I!vdPq?QZGVouEshlIOqXMJ%^-H>qW@Td|GMfZW&(Xkd%tO2)SW1_3J%o
zL;PXy5B*2k86{f`f-rPTwH7V=-`LA(zl6DcvH_<PQK69JKR|r7w}DU$|LPeU$defr
zpBVQR_wg0f#OXbUU&$xNJ%}+{dp)akVW&EyWE0~-@#fOw<xM+?q+w4>SF*@pEu{xs
zXOW*;DE{VNK*=b^J#_T1hjM`1dm~xMaF>$Fb;gDoRJSU09lKl4Ygf|Ab;gD+Go(MX
z0(5Y;mi_=`RS?(dAGG5Yd{?9Z^^#eP2e})?Bbqd)(vbmYBHr5o073u01-}?O!k7)a
zH>i$u3$%Mi-QQlZjCp_2F9u8Jm?(U8L6Wt&d&M)xj^H|lr=hA*Rnbh>L!3`BepPS@
zgbWkj{PEOoUY6Y$d&N3Ns|URe<&~Z1L02Lb$j+C40272#i9+ObX?vX+bgQ5ehHapR
z+rt8E$5W|pEdGH?BurrkH?dV7cDJ1m{{Ur~5H}*xrooGBJ)QeefyCE|QN;I96Ca(-
z*fy5_4an+1HF3E`DfOgRKT{@Hv5%pVww}#F$6T)to!%p7CtD6Of0UgKuEZb+gs)UZ
z{JH<dmam(<7s}Si0d`_=tANAIANE5`+=?0|!x;^4KWgiYg^YoVYx*s#p30?-L_#C<
z%q-iPh4;c!55wDHm)jBYX3?&a96aPPemT*Ch+oZ2ZKQANEW3f}H`h2EDG7TQ!*x#_
zkjOYwt)S{v4sbWIaMp})9~d*?X|2T$Xu^EOe!Se+0IY|GndZ$F(gWo8MLXUN);Wug
zEoxtAXPrR5ZlL4cAjW-n{JP!2{l}_HA|8%+qt}4mYIT1tv&6P-#*4+E{e*^Pt4JN7
zB3{SQqBrqysVjpS<*Q+jRaE#`5>_mFc_AE%RAG|mcI9nH(3^;K-w$9OVG2*wq?q*t
z`#mIHjS9Ia&Qz#^Ys8(*B!J$2%I<PIl$vGiNDS)%@FpPM3=SQFVP!k!og-Etno9n}
zt5eZXRHV2uJd9ig&18O_fCB}tqq~P)PmijYqN&7B9x9E)a^gw*1yhzY?Dv@XXUAG0
z7BGhkl_O*en#ud*q3e&p(M|8<kMa-vq3jHn7z9EX`b)KJ5dZ(j%JYU)N3K2WbeLsH
zAd=gI9|CguSOa#N?=>U1zN^+W!hBXTG7f{&p!%fm(B|oypuTEFg?Ky37*hGO_Z%;d
zeh5j0s`>gw)<{%`-teSGn6IjEFgiaxYhyyP*!rKIAik=@LCvV0e$;|;94}734@c4A
zd?T;5*g+?ZF#5B)PvWuav;%5~!%Kp)o-Pw0S(G?TXW(~&e>F&^5sWM{oG**XVFFl=
zzB~9n5~`^}xm}rVr>Ax6Fld4!s|sg>V6dV(wq`458sW%w0jQRjBOk$l4)i;BjKWci
zV$zFH1eyqMAKLf?p<Z{~Bz-}&wtP7bXsuD?Bao^~Rm2&Ow+`>YF0}R$O4U|}=@eT#
zH~jrsDsDc3sj8mEA%!LP#hV=E(u<=XLQ)2gEEPY8v1&_X%|{^hBE;Ea$K@swyE1zk
z0PzV(tx6nPx%pds$fSrK=@F2u3vZ}3Xo^^q5Nb=1%qKuHpWYv3XLM^Z2*c2oD4_}L
zzu2?$@uUQLMHWDa7IJ7EJ4~ArFwZ4_m>jb%hW_ys<L?f-O?kLH-jYL~p_WiGTHVm7
z5v7ZcU(a)B3D*irMynf8^=O{i_%hFVUy>3@Mxz@NHSK`easD2JlUgE4jUC0qJ(t`b
zZydII1tfzc=K&<3I8Gc>EI9k5OC%W;IgVtF=Kjt0s2kA|NJfVndNd3Lxw~0Iu8ms3
z$mDKAtrqhQ*`7OOOWhMKabz;LSv)`njbA7AMD1$u?<Gkdje`k5EWy)wOV2Q=6`0KK
zHcQ<pgimubs}(K5WK!mc5`0l|ruKOd!fFX8lQIWujhFkS4H756Z=4EJTKuGnqCWW_
z+^D3NwsS)XD=jtpbH7iJA1Yeg<=tALzZgN~+i~?SIIj3Y_KTr^Ogr8ky{X-;be3Nu
zZ^r(9mYM_jP}iB>rhV(iw+aE8r61J|+$W^sb@=>gCH{*d9brBVP7z#~T&3M_#{OQA
zuqlOR<#d>!0O-Ho{84r#I1s`h@JlUih5r9zJL6`vQml~=5JR*baE?pu4F2;R9lRUF
zQc?(srM@b?Z;5$c05jF`O=1|shac&sn!<qQrT%B|?N95uqD##nK=V5P$!v1U+UIH9
zQ(u&RXowF?HEwX2$7Oo=&s0<B(i3&)*4u{&@xxsGt(s=ArDy5Tj2h!3z^jm~^P=!W
zI~G9|(9YmVj%zI1?%mhkx5K+qwMwIjCLC2u^f7LlftKC_2WJSHU4>hQPHMKisJ(BB
zcfl!mVxmi<dEI}n@K}1=leuKz=)sLJ5HW_n8dva|0he<P-w-OzxF84E?g5i%3SN3M
z9N;Hhx+r`wApT~@r73{v?QqEAqM>BP%XnBgqcQ-~Gj+PqmsT6MelnuqUsL$f^K_`2
z2h^dNZi}Q%O@YfLm`a&Ehl`TDZ%!cL{>^~PC78;DE;jttOLbUOS!oJhE=(QFH(VWc
zdJIpCl;KSL%c#XEj?ZI68F*dB4GS_6|MJzOUX+8z4g8>v6}NtzLiPbLAIi?fMq&^K
zqAdj+g6Y4p^CQyT8dwfDFtQv1{?071T`ozw{_dlfxxEw-e|ZZypBoscH^9i(u4&~U
zp!@;@nj>$xYnO&k_shceFYd+@Zn4AeJBBa{@j_l)d@bY)_bb9rKuw3d0G*G~?0}#Q
z9F4AGq;PU0XQW;GFCRc}Jfa?(Lq`;aFp!)ee|Ly4>ePbxQYU_D_xutBBxdYV_C=jX
z7&S$)oMH3nKa5Ds7`89!(6TDo5<PV7%8}XMUE-;5ERA_ICvpxB_ynCJ9&t=K3J*0c
zF{RKj9qfp>j6pjpoN5MNs7KlNTu=i=v}Jf)UA?HW8b-ya{56q&fhFRNVe6RXZcWs;
zYC6E(_+sdHTuk^VsvF~@6_ArLShsRaVMr~W5lGfga5wh45LIiITVPm3E@@^+ifGAD
zSaE|K!q$Y{nH9l}1$H2cOl}+p@e$(oMz$vl_J)X-jA8qo<5JKpW@DAmea3zwX3IeQ
zWx+@ny;3`PN6;Iy{kUrFW0RdU%2NN2ChQMo=aR%Q2*c1T@eTO?7posx8HY6PvI|c~
z6h;PFdMkcjO4~Fx?wt~94lY9d@i8Kp*tW6gCyU~ty-aBz3cny?+s3@?E7M96bg!i|
z#PX~jhmmxpi9^Zuz#Yir5#f1Okwfkp>BZc^Ga37-_8F3Tj4!S;MC`T@sw?9Mmlc3A
zACBe-wc8S?F8#0Zrbg4R%+XVh5WU+XsCpl_R<{!jTGFTDXH1MH4&@=yKWK(X2Hnp)
zi4Z(vgp)2kGcZSjGNtZSG7=(qR)NzBuNovF$?U@`5G6$MtOSR2LWU=se&5|RvqT7<
z)!$Tn`<3Nog}mHpxPME({Ai=V>Ey}dR)EE@e}0t+39|~EHT8twRa^GR<wNE3Dq00j
zBh3`IYdqZjjiH1{*cLs-6c}S1jRf2WuMCM0u|0W;M-yVoxmIz*juN6`&1J%ocbE_l
z^*a52tRYOg^{mvTBwb#&%o8FJs%NA)Fw><!!Q0~cQuhUqdoTVdyA~UZVGy=bz9j6w
z*x5Nf-2tyvSO7&Nr3Q@oXkn5t3CqHIcua{jh4c&+2aupKGA*vrX_1t#8K5^T8*Y>}
z=3<{@#WlcPQ#fy0I$R|Kos*esw0&dv(Hql|Q~C5@xRQwTML1hC2-4DUDuM^T6{O7o
zz9SZxG=(7j@~Od@yS5Od7RME0=*z%7zkZ5amW~{zOm4Y}UP(bczkaGI>7SeDuYW1$
ztL^9OG%^5!93Poi!&UZgku?MLtTYb86Pf5F%}Er4(G<|L;y7GAEqk_7!+NEzDcon2
zaZc{9WSum;!AN`34DJ)F)rh!6p)M8@x?I?Oc7@T!;d9$^R2A8VxjOQ*H{7zRHh6`|
zpmF>fXB9@tKt8u^iqd6=HH7HLVZnW2`^6`A@>qF;>{^nTq`d^=8E7Wcb<_|+C{2Pd
ze$5@7k}AF#b)51m_Q7rj(gcYeo>5Z3Pr@=dPA8Gg%n^9;HQG@!*w2x15CA)Q|Kt<(
zQ<uCj{^A$MSw-qk{a0kB{PX-DoBpBf3X&iOLD-j2S%v?9Y>79ZI&$nK(^8eFkX+D@
zfmyz06`S^s%hB1De-XJt|AN!hLMCefg>75Qzq3RDz1ft_pe?3kt2bmz^bPzR5~m7a
zk1|Dn2siV`&#W*&??7ead()CRV4(5>e2K`>g6bRS{Pn@M*mjItpw?2CNXm*#70S1Q
zpEzobNpU5wo3%b*Um_3;#i2#L_GXE6$qV#3Ccc%*b_0;~w^=w<Qa~!4&)ZKy3I?|U
zm?=2)To2Iacu25f6o}pR2JwQXB$SrC3g?s1{coA8?>4G7P|l(+;FnhqcH$uLTfYR8
zbL25tB7G8?|Dno511Zv|)yjjgLi>CL4%+!p^Gz^j;h#QXU!oFcrtQ;VT-+z6I#{L>
z_w!{qgub;&0zs^)@u-%m!u=$giQ5n~mPR|_e?+@P(nMn~Ixc0VE!a_1fLn#2xdNQA
z8}L}L08+NI=T@R;>ZKfQfEcJ{L?gqg{E%DeL{9&dT~U(7APBosr4;r47u&@5W!QG)
z0%-?}1`Ek9Ts1kQ8mQHSV_+G(Li~2298h3mCshFZ&I176O1y8E%5n0thcYN*jTnp*
z?Dvp7lI#35el|%-bJ1Ic^G!)c1mt4AthU{p>8(WhqydK}FQC_S7Z1B~MeVIb`J@Gh
zbK^KE@eCYldBDJ1h4o1X4(0xB-3Cnlxj({w4U36b&dsi&hq3AWLztsdVSOfIITx!P
z3f_0Op97+z7kHnkSPpiR5%?H6>N48_@<&iqDTh)`lLZ3rkj~!wBPwcLJeFS`4`Mt<
zPlkd^3k3$%%^rnQkP1?W;y!@>2ug@Z=f%!j79ef*6p^UBbr<Ae^jME&T=P%fN9naC
zGkM8MQ6+4$OL6Z6{Cz1UHNlGMK>;F5WeSBZkU?vbmu}|Ek%K+imY1@^1x<u<ZkpE&
zRAd9JEo<$0#Z?91nwQ<ZW3TOO5x&!6j!IBoU5mY9q5`1(LWcx)V&6b1ja=D2ia*M(
z?TBF*gsp@z#%BM;ihS1}(e%OsTtW<yc}UO3pB+Geb!XDJBO*4pmk$@6_jf9wWg<lw
zf@wyhChKVVgz##fi4CH6xf&hyP(;fo6osH>8q4PJ43$+J-cVFY+x&mT#TOYQk6vAf
zu#Tom{tb!u7*Pnp;p6D`mfX})RY~I%hq#X21r$A}Zns!NRwZq78!}U=1Y|BuYBR_>
zx++VRtE~ZMn5A>fA@RoavrniGd2q@dJ-4~*(ycY5Rj{|gJx(y}<!@K?PE)?H{l_QH
zYXAx{%d>&0Ms>Khyh2qTC?LiqkrUyeV{2%)q-83!Zrs^5krc!XVw9?bw&0}(L;6gD
z`5nPkrxh1#2LMi?VvO81;SH^4u%Y-1<Ihh{BRhHeW?n=N1e{h?F*j{NK$_YS=$E@(
zA!4&tOXu1Ffi$&)Wn}P+*v1Z!)>4nQVBn-u&o}^q3!+Lt^!iLYKyXrgf?)5Qaf_OM
zUReI~*mSq_Ox3_9i7_*i*U<kO|4?==$q|Dv6g*L;3=+Qs<^ETQnk+I%<CL|TrOJbi
zXyEDT+3R!wORL$|jV1779B~E8fS~vzSp2OP6$iAF@R2h#C9Wo!YhX%b2ci3e$oHeI
z=hQ?jhP46r%ww)6p>M}pUA0yDm31+Lq=!tHp(`icvG2pSsI%blSfk&!))ZYi<xa;N
zW%VslSQ2xUWB|xXcLu_b+B!CHeFZJ6N(z9qx#0F!xQN3*yTor>QUG)s>2OrsY*)%p
z7?2G6oHjZ%ZKCoK`->8^J1QyiIlEceQozZY5sFRtpk!4^k&n9iM@pdz<ur6Wiz!Mn
z<a65S&{|{b1#k(NIv&Noe{iSZ+1_;%ttdyk-t$`}Lno(z$JR1xmTWX^qh`-uAB4Vt
zm0rMOxr9O>T3H*Ng(G@N9euTPhq)_d=Rosj@GSAlQ!?b^^*ctf4RPe8$<Vw$eB&wf
zd6V$8SG9~yV{Ggb=J%KP*icD<&!OSDc9%!XC2DlSg6TtNsHZuRdA+zvw7D<y&zbVS
z$e+jKhq5cmbr=R=H=0Bs3Ecl;53`>~Xs7T!33a3ihB|hH&KncnRs-`u2#P^Np{!*G
z^ZX<7$R|FzvO##%{1<x4cMJ9`I^S_`y0;&OI|N|0?)(<;SqEo8bTRB}1eUjF<PPe|
zK3AynUT?tiL4A10cx(K1(0Tk{u)={4lx3@5b+|SD%ECInj1H&>3Vh3<eNoRA?jW|T
zt>ZZ%(3UYqA${2NEy#BGUHLIJZ0~8|##Ad?2Us1BS7>#FziL{8uR{NLY&$Fu9S)ib
zS}eJW{JM~d#Y4C)<={ty)ORkTbkN$)1Un7(?+WL+x`xuiYKg)_80ISOYC}(F-2{Hm
zMfPDGrciE!MACSe7fT1LW%`c8680`(!j1}x)Or#6M?UgB5KK*GIMrZYdK39QA&GWQ
zUSmK9gyX?1neO1U>~&?hBdZ(0m8qW9(wa~0#Bnu$-Mj?}-!8ri{GJQTboRB`U<wI|
z`1;Hp^rzYW5kqdwq@c%D>7p$kkCCjd1{6{zWCOivr*zu=QFca26oMcW-I79)?tf#C
z)7K-ikqs~oks#tdYtu`AMA+4JG@9KWU#Jr1j&TLyAtOpZ-b(Xk$oY>Avmf3#mKQ4}
zP=}2FKhC<H>Ykm~%^yscRuxW%3=5XM{PH3J(Qtc<vQm9FuE(O`+n`m~_1ZDK_QnJC
z=+(=8b1+HVIT9*mV<cKJM@d)T4~_jr_WdX^IwUf!c>l>ihdkwJeaG_BA#qX%75w{(
z#%NjOMOO;O8KeN*zwoQkwnc(gH!Od+BWM9Mh5$Tk-<qhpwdfCjL=kdCBPTCneZR0g
z*-;^XNF37vx6K!vw8vkre@f^NdC26T-Oux8Set1CvPAxn2h9pVLPx!7dTM=1fR!pV
zj_9aw`2G#y1ac<IAyTSB<A@FiLmI!@kXW`o+bfr7(8yuWGhU&2Z6`fXw^i68+TtTf
z9@uk<cQP`Pg0I9D(IAl{!p;Pm-7{9oR3);Awg^B*#2U>A&V)S&Uj;3qEkZiHa`vL`
zN7)%AF${uG@JcEqn)_d@tY3X4>4Xb7sfmgdb|KVFLh12h=s)wJmJZ4R0N?Gza*hc~
zauI7v=K%WwZZPgxDeqA+i&)bvDlF8veN%HV^9E89i<qdZI{nRb)Wk2z4H6}*h>5x?
zHl#t*CbeuW`#HQK6)_Q4b?PqS^N7F(Vt9Uml~~le+z2Byja!w0eP3g|8TfHFgpcFU
z*Lnoev5$_M4w{Nl#DtIIn-f04ryVo1O1$I~F{#aQ(xoWyuEqxSZs_Ov5M|Zw-l9km
zvsC)*j>>FE&!Z2Pwy!g;-oJ1MFX=u^_&9NtqJnlKt2xrgd{!R#d;R$?^1%ppPKx=~
zi;@4lzV8(XW`Mt-E{sz1dNc6jTnHZr@k9gHZzKk97GNQEG__Tc)rfPYH)I?+<|yen
zOmtQBQ&H5oWoGN<h+UP3mZ%gwaKD^5Y2Fm5mXsVelu&hSWXlm(*qMnwUXpT{*s46@
zf1pe;*SS%tBIGa;Rrz^sA0?E2KXX}6Ny+h{?Cf$agh3#@B?bDo|BYR~lk;#XM^h5x
zBQdBgLx&j+K2<cmE;!v&VZEP)eon^RG$B#!hH}$ZzhxJ|wu&o<Zp52T2dPhHD6b!K
z4puVd(8#>;eX65hYXi^s{DoAEGc?j}?Dn0O-q#rOo+p7{9$GeSPwXLlnI5Z+{E?Kb
zGgL!g#u#n%5)Y@3mdlQcbA|?$oEt50z^CE}CI@j}(h;=cV5-r*L7dO#(IdZP<Nx32
z>&9Y^%`sNvaA@CXD~22z1acY_&o!sE<yX)DOQ{G85;<)`PiyFIifNMdv63B!Mxu>y
z5(Lagq}uXvQ^k%$BhdzCI}IjdG_D=QeNIQD*$BHW0MVc`+ezfdY-}_eFOqycbx^xF
z8p*|D#fw8XmJM^Nj<)+mM(-X6kzW#Gn-hY3=1lw!#WTOfQk@s{al8;~$i@4$G!f=2
zW*i#$HF8ZENaQH~d3F%@B^v=7;=<WQeB%;J0Ip=hq0y#lV6W@=&4IGEAFPRr2ZsiJ
zjpJlv01>$5pI?4|-^hQIol%m-AP5AnWP)P6|HYQ}56QmDTp*RAL{Nw6Z{bMt8l1+~
z<zsV#PS^Y{@i%N7Y1l^8!$=kyy_cU>8px528+rR~S3@T{>n1Jrk6BnVb{*{3<QzV|
z+|elP4a>eb6!jbbYs}YP9>^s2hGkU^uc=o=gv<KqZE6XSTD_57<D$hz6X|ZSe9N*{
z=o^+LHBKbrWCe{Rw$>snl;|6lMK#O_;nu*Eairv@-~JJjtg2beJVn05GJK+%*N-b*
zr2lK&*d^A6B{!UQZC+mF$!c>|@O+n88<y>G@E+;70B^GWxsnyuhWWw1VN@mdjmhZm
zOJJq8(KGxe&TcnEplA<fWxaHXwP9I0g9wTTQ-5$1s1;VBZCF;$aECG%M&hvB$EQ#K
z2+4uJY0pNYJ)jio1g*r|Fh6)3>=vk4w+^zZ?G@gJc}~FIw<|oLm%F`atR&us9aO4D
z^KT2sa-P9o#<C>lhRws#7_l68SKE!bhDGTivk%T6WoL8*F$e<DmJArt{u?`<f2fy{
zD}eEK5+%v9k7y5&_I^6($>N(LZfNw;@IFX6F1@uTA^2w5AClB{reu;|8HXz~kz=i%
zX(Vk)sq)shVPqwD%;c)}hbnDZxvSEZu&0@Dc~kqpDi)JZmD%&rt&_aIR?c*j!A?_1
zJoW9>7cFzz^QQENATb-q@0*t`cG$}R(zvPpSCANwGYH7R+V(<;?3>#(!`#r|sVOdT
zt)z$eV|sha*7v2*7#d79&vcn~Fut-m+cIPfjfR@~x|seqI-kp*i@G1{4ewB&0Z<40
zu(iW1ZH8W<!D8c;@giXKld?_Lq|g-_95#g8u~t7hp~S5sXYdl*<2~qCnP`FTWT0#9
zqV$K(J*YuCODD8;&H%34QU(E`AqYqP*Ti>ICK!udRsOH^l7$0}YT`Va9lZM~1cU~M
zjf`nxB0)v?HoC1k(?SJ@4f%>Np2eTghuCIuNMRr}f~fpapSgC?idX6&NT$gdb?b$v
z9o9Q|J6s@J=^tfhbObO6!qAmOW2O5qR>B|B_GAIBhgwC$%kO7Lvqo*sIHiW7W#dhh
z+#p7j*mPTm%jL&5K~_FgR@@-Qrm-PA3iQ;5IA-S{^iN7OmIrL#?ru~=Q__AC`#UAk
z07v;&Lga>(qdD1y!wn(>hy1T0PI}gsG~^|h2}A%6;kf=F#YdQzLqf@90&Tm$v8sU1
zJyc7{%P_7=LgIRy<aAxME2DHQfA%V+B$_qe-A0dIjTlYWN#yT@#N|lZuJ&m=f^?*B
z)=E0!TGT;K$^=;~$d@-IiwQ*bO{ZYY-I2)s%kMBH*9k=Q4ezrqf_#U~l>YMXyDKS)
z@>4tfT9pL9n@keXigg1b_l6zREHoyZ$$Sv_JJS(*V~fRA-}FKg$#q@HxB(mUMwG2N
zv$11`ZD=XDR5G%G8!0NdZ4}8%)3ew=Nx=@nZEU_}=cb*d^5iaALm=vHEZ??8UUK<n
zmgaWF8Uj&qGaM13+#hM;a1!|^C7}i5q3qm}BnUwucqK)A-Tz`s`iE>!$OViE+G&fn
zsMI|O?*-v9LMxgAL#Q*|6zj^_*`_B+S}Qk|L^E6n^;{}zdYO_Vt6{}3qZAfG<@!G^
z&H~Jl2X`F`l8|QV({D^o?vC}L%@J+pDRzTiOezdydLqp202?nWe?CJWe8W91u7?RH
zW5sEu47)*n@J-_rg_1?Z6kZhADR_hW;2WZPCU^yaJ1u@tNbwug=iamv8BigF?iTKm
zGVliVnKuF}M9-||E@8Mdg>F!9ykV%w&T_#8GXIHo*(q5jzHPKNwA1<vQx5SdW>i^o
zU89l~imR?qd+|N3{9TY%{Wu%(Q9_7ajhGBg@gUUOZe+}3oMH%ch24=6Wj^J`ek_v4
z<VQ7iwjLJ#QH-l)l#W-M8Z(ytwDxy3`gK=O4h4sZkzV4fIwQ$^!i}5^1_2Kwvh-o$
z9|gHIYLP{vYz4j%d(jjVLOq$v-qG6x6BM`2ZNaredIkxh4oqbS>=JU8?A)ERtovfL
ze-I)5C_4ir2SN}CehC#&|NpVf?4{}s$>x?1P#YqM3ez{X1DZ;vqZB}98qz6qa|WYT
zfDjtcRN{g&UE}1V^Q+G#VkI7gY8*}Myo(b~V2!uH=l`~E|49v3sYpxiIE*r1OX^gx
z3JXFt^uSR^Qi!0#I>{%0D}f+XBfyx1AY?4;U~8u_P%BX&H1^)0_T9?d#L4=UMXZ8>
z(9nECO)@^qPd>!%o)<`|+>2-`r*OW^%OP!Le~gkpc0{hh!^ljCmzJN^tU`d$h^87B
zxnfNtuxmcDeD4p7W5VR8@Hjx-|M|r5tv8~u&E^#x<&g<7&c`mR5Fyk;AaX}^B7E2t
z_#s?MwO&xQX?tyALMJ=yBz<zF)U(+CW=^G&VV5vt{^U}v7dmfHP7h+Ik)FoyWa3xD
z_r92iDhx6QHW;>7w^X27g#@90+io7%`SRlrI%?n2*;>vkgl=aer<I@&>QPgwQ>zof
zj5UndZg~w?s=L^C!zWd8f3b`S>D3(6r2_9ztr@KU*ZNUy_Cqi2McKLKKoEjJ@JgeC
zkNaP2E%#$1tP{BaF^oE>P1h;-IV<~%;xZVdYoI!om`0!vQg<QvT-W&R)KZ#Wgndbd
z8t+0pXk}LEPpW_R{0Q?wcGb;8R{|!Q*#GiEk}qPv4BVJ5)@Q6r1MjWmx6lyxL3Ya;
zv{|6r*h-5RzG;N}AiHBt=4}ppTfsPbTm(L6WY^r}`SG~0U<M+%xf%31A<evG%qj+f
zM#s?1HP~we`yg#^%z#~lw4}_GNWBRBl92tj23FfZLRHeQk@7Y2IUV~MaRA5~nafAO
z)-KhN>aLkrMUcqYO7-MAU^IkdkX>h!=FZnBH|Xs3OjC`(7{pMh#yr6-ms0d(wYkGq
z2*)6XLNzLlAV?)^cb1<TVlhZF9;ozWe|zAChE|u8NFCO#g}*FT`?KKZ#qWNh8$Cm!
zVzFRNq0644Uk&`66+@z$(;NGQymVm0Eu2W9XDC$jf2;H8JRWS|`@i2!sMa$WDyBD<
ziv{YEZyweg*29OgGeB|}gkj*907Jq5|JZrcncmsHX5tUH83%||8R<`PM-`1NTPw&h
zf&9n96|m>VZV+BB^9TdxM9KCCm2dj7J;}JfVL-nr|4@Na%)^Y{Hb|m^F3|Q!d$I!k
zPP{FJWjOqW`<8iul#pL=w&~+cI4;t_-nk(q;HN>(;P?=35eTj>>A5S|PraVOQns$(
zrqNU%mA+|77#6p!h@}CSv1Ym!xhla7GtAyFL95HYI+q>qgTglt?Z1)2SOrR}Xiw);
zDUxBv3@SUJjPm2RBEPmApVAfFr-3gT0mEVuTT9#u6B#QdGRzP_MRgDZz7@6*k3OpY
zy(@n727en;qjenw!SpT*=x>GL8*8_`g$=deNNc+k$*}zR4fZ97=0n~b@;s^Czt(np
zQX09pmm%kAJ834X63MXq_zhrHvEDko%*>iffeg!!-+<8$j!>vEBmcWRq|_3(D?5%q
zI?xK_m92_aCF^0e09|zwIM6ZBd5s5!ZyMr#Pa8dE`s<7hG5MkF+L9m!LD-cF8m#xf
z*b?_k7<c6YOefP;ggpLNKEn~(R&V3yB7fPm$MW}%3LZQE#!neaFe$|6BvCF(pAm@^
zoFSA-a>F*X-Bdmz5-2!+gn7rHO7TXTVpM`7u=8*H;1Z6DxSQ9!-$p4p0)c-sy{0kr
zq8o!N)6%4r907@{VrFHL&hk}J?v+Ock$tQ~0hoAsqdL5|49Q!mZ6Q((Y%SRV(F^{n
z_7AxCn<NKverX?Ap`Q7cS_+TAPQek5Fdki=6=u0dtE5LDq)-XXBT3R^*tNbFmCulb
z3@Y(k6f?yby3`tON*@6U2~<MQl;*uWcLtWxuEbJ6_c3cX+B{Bug~HmIW=5r03g~VS
z-o-CX{^JJ41=$Y>rC17RFz@$YD#PdaT|WA@{OD4FC7AbfE<lH6o@7rp*g+|u0wINJ
z+0QDqPNcC-xvPE#W&~=44Y~;X3qG<BG%5)d2%H@H8~Tr?(;8dzT%eWuz}*Z-yR^O}
zaokVK@5la7c5X=$gCG>$(hwfn``_4j{1Z*LY=E*zQn?`9^D`x@7Y=A@1%uXU8SnSr
z75IfGFPui3t$AmRcQ>Z;68yrG8_sm@#7qUVr)^izOY93z04l@pL~(=mrl)*YgkZu?
zapR^ceJ*7mG<^wt;fX(G=!k#~88RVpH^JYt5(x|tA6%iasj|aeTm^pN2|(5Lk(nCW
zj3Rjq&rA3VPXwwyy=&TpEXv_BL`#xTlYjqEDbM6S<5abO_7zdMdgDlpSEN6E{+CrR
z0>5WuHOCR2VKDy_>>T9C71g$S<BX#3GeWYD*jbyCi_l*Vtx0@S#k0^h>XKa$mY^4I
zD{p*M3Ve%f2SXRy&Rr3kmNt(SyHI#bF@9%u75ht0mX$}C6c|DVcX75?+FH_@*4Ca0
ztGjI^8xzjG`(FWSxb+lTWxOY#I{x+zE-wK!+}2hP9wIn`F-aabhkj3pr%n%}%@KW6
zf6Q*?)<cD<;j2x~bmxPJ!s^aJ3|62T|CF6e4#Xe~L$B0Q4C(zZHhJs<Wkgo9i$)eS
z&IcQr=m>UIw{b!kz%S=7<*Ol0ORP-v4GV?R=j~W!Ts5Tm*<)>YWzc*xlCy)*e*l>V
zl*8{2)nWg_mgQild^MzyB!#MF2Xg;i?Lw8Y){w$|q@~7S%XndQz3bmj5lmT(&5Kxk
z6j_PUN#s2s@jBw<dGq`SS(LS>mT}imo0+R<P1R2C>sk0n%3eclS{HC4(nvw*QtK@C
z7LqpkYp_JfXa`?rThDfeT}Im}c}e3*eb|j)jQbpf{sT$KkzO;=d-UvEo~O5y$a_E(
z<%hjOc+gWqm2*8J8D80<uraICovN(ZN1jQUZm5MNR-A?%4QH#WrJe-dqY>$<Jhjl&
z=x?>J0b<5=LveS9_s1y0LK%z_q#eZGBQi<mV5VEq8?dolavcTVq7npi%E&V~r}V-9
z7ECgnHR$CO?&I*Wxb9v)(qoFU2DzNukZY};570%|S?E0;HSAF1a%L}^B~xSmN7=b0
zI}n0EbW8KFmAn6qg=4;e%&lPqq{=BttIcT&cjRgS<y;dlg`dB4>|u%XMdg21BN@uQ
zJMkzqxM`?uuccK3B?pHT3TLaFI{%|i>V^U)$NPuja^3=J{?H07r5Y$XH<UhKeKNpZ
zE!1A!lByPYj*|$<Yrq&Rd%Tmlp-jjzh9t;obA@)iD*e11k&v?wO1@uihBfQau@$-@
zi`c5ceWF1v5fjK+xpzW06gW8$-OtS-^TMmnm#P)Iq2Sno<TyYWEWo?Pf6$8Dkj>=b
zgfBb!fvcj-)k)ourC}>J%O5FiXGx<{D|ADaZ~$wYj0Tsi6@aQ%?uL?S=fva&FY>~c
zR%>@;YEGjvsJP4ZP0cM<D;`79u|veI|K}d}w&d2f*U86FbnK8xDaaYuCgi><{rnxH
zV`uQ>>oOJe(NS5VY9(YSS#|(YuCI4p#pTwC$WU_ZEMCJ6ZSBgb3J|rVWMbt|agzV*
zM}oQD)qY%%4`pX?1wjbH(3TW5j{P^bgc~xmPqqLLaUBt3est{!26+g)Z|_!*<o{o#
znA}H#96K#`w6h&jU#{Lt6pp!%+sO88C3jBU5PmcCmm-LU9R}D=0*j?F)I6(QC?yg7
zI;!vrgrPI@#nC@2wIoiz4h9&|VH>*@J9#2kNfJG%Lu0@Sc8^8LiaZrX!mE#`*^(iD
z$%*h+BmWU3K7Cy5w-d#^^u<$HqI@6_spuVHXoT$1TMk5>70?F)lZp|m`{{(aQs_L1
zyQD{8;=pP?TkSmmOAgPRCC~@j;WGDT9AT!W$I89;3g`p<GwOJjpdN_k9DhtBy!#?D
ziVfhK!9NuUBr56B8ZW7A<C^Khq=E}U;82NrIG;S-e$b0?|ELkphqEtRa6};RnP#eZ
zORx~cR2<s{y>SZV>(BJrufRfZaHt4kC$h(bs;)-<qsNNre}h?co!`#nk}JVN&=2FP
z$L&DqNA&30G>uvjWPdM?yME@6vUACmAOxZ4mP+xV?tf#=F>iuc6`AyqR7e`Hct8Jz
zHVTe)bJ|}+RK)P;%_qJ$V6(v?mtYi<_K;J?*^oe?y7}Ocbj9X)@yjB@NCkwbcfzsD
zPhV)?P{0$`nW=yf^+q`4&|~B_8o%+-%jAP--7Mk^r`us&?JfkJd0dqKXo&8dbaaR$
z?bU-#K`I|aJ@2N#ARQ>eU_M05m5B&Z&%0SV3phhfAUej+)>KRU<9?agZ$dJ&8TfZo
z`L!Xkaa7CVIkB03YG_9Wf=W0AZS>hm_^>98mx)wNh<egZd7!D*g+b$<K9v)qo^pfH
zgq`OMfZ7h|C6g1Po^jK7E9=O?Y(i_hDE!e5?@C23o}qoi`-Ywm4M{;zmqAtfRBTj+
zFrY%=3;=ZrR0M6v^0_Lb^qaaL%^1Eg8svdd?L073Q{f}(jBrr@Lm)+C+YW;%lRcu&
z1_#&F0q{bB82H?&;1O+GBq|zXLTzne%T3|eUU&x_EQX|^FXI_o!v?mOA7y8B1R)3m
z(U#E20{u63dHltAj%k2%G9ux!yRTA=h$i+LY(3`I3+1^}i9@0&upxS1i1i?W&U`a2
zaYz&uHds{s+9?<dEg8})91=x!4JkFqg4D@j%G1;mheRO*r*-}{_G8vtCx7Z}TPtx$
z6y-ICSHo}-oT!fSX<Olt=(?L5y~Xv9lbwAeb9aeCqNuLfHjp)O8YAfb^w9qc5>jy5
z8XNmUrsCDCCu>;+LZX<1GYJ5jlGf1}0N976UrJ(e(`bW7ko%8JZ0jWeiF%ZX<69s}
z3txy|ZS#(-bg4Z`-q_}I?ezJ@nA|?B{ZbU&{1s#^_*Y~H*yLMcg%YBkA~}W~4BfqP
zNALAv?Ux6?&Go&<Atc!dlug}a2@;|xvLVBbAZ-}mXM5N?m3}gcY|g>)=r1_qvlLxW
zf`lkaZ2WM9CpLf%&6x*&B}j;LYgCDHU_0^)4`0AaI~n0r2N#$NyQ;q=ITHPG>6enk
zY;hyz31arpy6nr!xgbBv&cKFY7zBbV;kppK|6=_|s#HT0nFUZp;(+bv{u@~fIzzCr
ziw$W#;_X<FSc2s6?i!zla-xFgWb+{QLq^iZQLxTYfk_!CY?YS5i6xm0mJHSM1It|q
zUC$M`V{u|hW<$@0w+8mZ2+6q)V&A7EJ5x=*M)E`zPrvGEY{%-vc1#YfjHvHIRd`Vm
zQ`H0B>H>FCPJDz533mx8^T~tXzt5eOL-(HHNOdS!wCYPbRw|aPsi-Daag+;o^<Lj+
zs}tOLIpSoL3?YouI3@Q!34WiIeQ|PDaPpAB>Eu&|v>ihgOUxW1Tt?78WUN2;mfmXF
z5;I3Qix^7Ukp1V-osKObbH<D@Y}9%*$>ol?WvF6_n1foWJZy;3(p86hT8=7~h&ge$
zd(Fk_P{B$aLlsN79I{UrJ3`|H&q?Hmj3i!;zBu|wKuoaz>(Xf*D<)nJwop{6P5cE>
zldY7Vj;V@y8bGFXG&;cx-4FZN>mc?+TG9maq6r;6ur##S<0SZfR({vzhq80Kkr)P{
zXiI)zWBPAwIr$n)W;HZ`BIIDe7Y_Yrh{>bxA$_H5t&$5~0-R2QG7sFs_9DP3VO4gZ
zRdt!V*^i*ejFYP?>6*n3&%=luql2%_gB2z8$quM0hNuM62aNl)nX|+_*%oU`VjrW@
zexHdXXH-%(iv^`JyRx2HJ3sDe%I=ghHM>Tr`WCl(8V|ECp|6yy*}5Qz)1DJ|yy(r1
zm<q3DTj=qC+A;PVvubbUJFG-(*-?9g!bCQgx+&U?Uq1UEmjqp^`(gvgJ@bIkyAMf)
z*Rn0hQhDni2y|I2oon|JtwmcP0C>^l*}VGk0BM%uM+w!U?ek}p?*3rTn2iohWZtF=
z$)C2*ztR0GofaK4aOvs41ZvTsx?vd>%Rd)0lNpP%N~jhMvKv^z8=M6yxR=IJh18-!
zbu-;ABvCWZCQmLsN~jhMs+-B{oo6<xM`g+{hQE6wZm#l3>efwAds(KQtO^81TLc_a
zD-3BKt3g_3T~>($qwQLM{8Srb0;O|@=imIr_#b6wltVEH0>LYZwPNpovA6U7keZYW
zkOtcd=<b}eV$uHiLC1aJD5=il%JTdQ3&t(l9}jgc7Z?EUB)w=@N-!9==*yv^Pw)4G
z&`AY}eF=Te$%e-<eMvx{fB@u~K!pb5(J4noJ03Yqj_wy&^<Cn@cr?oy*njHBhoiuo
z_e6;Y<Iyaq>!Z|i-iF{Q4FD@R7>`CdsAK-Fj#^KZ!1<xQl#qA=veY<&I3l)<Z?Vq_
zdA30Vs#k{xs}C@(W1&{{?UK%F0}H6Tuca;QOXPDxHlG|vO#9y-7fR1GWGF#ld^5^v
z>VrEP7OIqHEk}PUNx60qJKZUc)7YNBsN73z81EZEu9;!5H!0ShG43zH&xwgAlX@);
zqYqV5>Ob~<cvj#r-lOs#j1_uGt}tf{_*sI(c#n6+ZML;wV(DGa*1Yer&nXG}CB~FP
zMFbimbr8Eoa8|%G-Xla#)hZK)j^(eXGv-+W&v;;0HM9`jxV_79LMql~2|VN5l^y;h
z<A33s@ul5)F)P*UkFqmJmKX$q=#@-F)carT^IUyoV##(E)D#kJu<iaw*(n!s4jJ&@
zAp}1N`Jlc&!c1FJUNgOVdVugilDRViv@<SU2C&xVFWPBv+OV?#mCL=K(UjXvcO;!M
zteIwd!z{XV-S3q(WjE8SCkTv+f!dhs!BdYFm%*&wvq}vR@ED27DhjtZp${pUo--kf
zzuUNJpHHlk6k_#kowqFU#f}l<8%iXDRy|qAc4p<b^}wfH#Qjc&Z1){y`Q1HS`5LN>
zR>Ybyo#|3T^tp^4aC&3%brb#Y=l7EltrJ^F{I+L_8Bd|gO%+ETOj~tHby^9<EiVHs
zJ#D89S|x^;s35#@5&4jlO#@k5fzW`4ob4<j-x=^HzL7-r3WtCfODt&@kq`fRZYH^y
z8zBE~+sQh_ZlZrKW%GR`<%g<meYr;nRg!^zZ95pP#e2{~=-A0gy$JoCleT@DqT~V@
zIqPhO-o*aSh#Rv~)<F1*U$chpLo<#vy=@<*<pZvwvJCPAoIQV(ok0@BAP5A%WMTs5
z{~uf0%hnESN-B2_L}8GDDFMIV%{UF6ZDvM%s#qt}6>KJ~oyNA`0Mqkb>W?&=m4stl
zcsr3A$nxD=q@Qu^8DIZR=|nP1LoYHac(AeBu7I;!F6KSgcQLQ@pz*R{dhHVvn!q(8
z4E6v%aZs3*+p@lNipkZal#GknCWTQ~*jq(E#!YVK5g(0Z4&%66{+lJpW|}k~LhTa(
z%S<~>R+6W2Q!R3IS1-C1H_f3GW-9_UE;3i_bQlLbgw7Js?35B{6ADj54wPNoHmgd{
zQKbaiMCgjPGDNH>hr?w@HeP{l!s3ZP$#i|3ady$3Tee@^B1{1fbUy~q4)&Frdo{iE
zNh0x(FC!J-jZI|f_0=jOHLfI{sah63>C8g<xn+Fql|<s{lxu8<=_3Q?l17aSi3cGC
z!mP8P60&$Y<`rBhES}bn=Q;xl@oqes-5bVV+#+j{kr}3nAmldNvb}bTh<YH4)}htX
zI#Y=CtNQYx>`HPVhC$eu+AKi+|FN-q8`C97J)?+1Fs;E~K9SrcJLr=9i$2<p<(ET;
zETfH}5)9iPg4$%ff((Vj!?kG$ZIlNta=r<Z5_}UD4_h|WWk5p`Ye#NQDw;AbES`hx
z9qwa6w~6Q6GX5Nd!sNMzAue5b&hzK#Tq|kIxR80y5$FiLPsBHndGdNiUB-pV!{vrZ
z64uUWZNu=3PyQ2gk|&N>LHo>YkLe3gMf}Bu$1^!?&zS&fLX0%GW+n9(|L5@>{O5uI
zKX9LPQjK>G{_-v*JKLiARcGB??)l^u1Q(K>okV7C&+qNXqI6agY4If-JAS7JBByjx
zxPsb>MvE^Y*m0)H*>F<#b8c9EIdoIb;ao9rbT*4AZz=$2^|UAjUA-Bn*s?CQm6TL`
zNm6oYY+vZh8!y~F<Ig^kf(d7%Kyc|2buDhJS0IqcV6oP7uF9yC(Qo?AlB9|+shS+^
z2D&obv!~gP>1VG9phe^jTqwbvc7Ah#e*vH$W#@w1Knw!WD|!7L-~VFeIZ|6gB83ZB
zE5e2W*7L5jou2L12wLf}Ka;2LFAn|~5Z#_S$Fm)W#$gKUk3#o*bV8u$w$v%LE$l{F
zcbOiaU!43g)GEGMYM4C1A=J`jys7g$^W4o%3Kw@_>8GrTs8Rl;h$<?6Hhbnvnq;?C
zhZY9y8Ssh92!mzI6fSlY?&ZanErmW&nSOTAUN*JNmO~GoVUy^FVKF-pT;;~;JLrfM
znM4kU^)jzq1sHo*ydXPMWD<Fc9V)T4nVTuX3^7S)6g{qBZam_M#-aqp$IfUJIny0z
zm&bpJr18$tGX*BmQ~lUL>~Yzl*A_CcWg_BgCYd)6#Txw<Ud<GkM2?7MN{~q>%5d&C
zYv>f2M2?EZAOb>cpRgFc_{nfd<d|4|0HFh2nBaHf8{bng@%3^5Yq5Axdt&3A;*!WQ
zv1tFeQ@*(3>kl58h+LaY94Q*K)s1U@6c8ySiR!g8fsnB}9}unD<Ik8;RjU7YnPc`J
z%FZo|K^O$0TdH~D{x?=``qPm%Cv1QdV^omKOl$m=nRWe!c$N$qI}#JhhtkKN#gE&d
z*{dH!-fTye(D2<Ddw6kaucJk8_T!r@=*B@G_$hmCdxbx;8Ltx)xCh+HQ?=VqhJV~+
zV>e}WVgmO-fegC3i^~j{{zy5Un6N$76B6VCFf#nXNso-ti3!;Qo$ue64&VKYkV)B`
zn2<e7B4?t+Q@slA@r{~F0tM_TjX@N@60)>X<6X>TfK?RBF=Dz0r9)>x={|_OS#%M7
zLd2|SxH9z}(U6Q0iB)0J>7{!O38ghdZJlx<F(G`)KsSP6u-o?|0zMh55UVOj$B^wB
z{<`ca?q<oNM&|_>t;)%8$kk5*|G#~z!Gln=e*wBRWCfpRF5?kmD#C+aHvltYjaPgI
zQx+knB0TIcKqIhI8Apr$zaPr=_!(Sk33TIQ;7p#UT+c-B8;xN<%vKKKZWgTa0^}MK
zPunHq68AZihqZ^Jj=#=~22PKjOXI}9<4xJQ9Xk-hFtjC}#`NFV<#0a|<LnM@z_X(S
zqcO7dRoU9oCE^VxhR!+p?HdUtcxXE!bqF%qj^aoqJs=Sp)~x<~QOEx<G3IsUs`Lva
z<21KefFSgj;?oW!6yu>r&%>@s=}Ow<Y|VAj2n}oB=dhzEhUx155gk_w1$d}Y@-$q9
zGqiVdUOdtv8fF}Ldc)_N((sWVUmc-g#(<{-1aGMWtF+<>UMRjpjgDu1G@dQJaTd#u
zyCp=!td0k5XC8ZHZK9%Z2R*{Wtca(wpEU^oNrW%?KXr(RSs717(O$Ep)$gkleS{J`
z)Jk~RH5_a#r`n58DU(Qqhgt#8VqsHP^W*x`k*-R=0CM<Ywbk`XWsF;=-qn7DM9j6w
zDkCmRfIUvEBOx9t*}8pKBHelD$leM@LKz+^HcLm=-NJl1FZP)3N<X7v2C4<?N%p3M
zInznUA_*QU=gT7&Y`_i9dQtfWj>8D6CRVsNfnXd|Z;C$yV%8;_Vv?-7`(OLC)IZA3
zD92(DgrZxr+9KWm#)e}uAGfqGvH{YdRY17s-*hF46tvYqJfI=o#rc%m!%GYgHyK+-
z7lTJ$q?1zjYzg4uCMn`cmCzt^MN*s3(+a=Cr`(DJVk6?4_)|vDr^i*Q6$;d90pfY)
z@pH}OZ<+q|$5fim5@V(Vzguc1u7E*&Dq*gJ>V@TJph5GtD@CZnw1NeKNZ7#~H@1%*
z+u#0>ERo5`!TKS)|FVje09CP8%@0z1U^iDgwk-c}$W(g5ebc(xc@*3<{p}CsTCF0U
z!D{Oxi6vPD3*v&cicQzn?1wFhi4D8o-VmtONuLsW_QX=-<rlBSkb<>ZwJ^jMQE{{v
zKbK-ip;}RCb2?=s!FZX(w-U9(wH*i97)QaZU5s02+m#qnyK%;W=E2<<N1LhkQKELZ
zKQhH|2#P>)Ky|ac@hWlN6KVzLCN|9kOLOK8Qi}5)nmTcDk@CkS5b5aNXa877eOMf5
zx=(A!mR?y4)+%%j_dm+c=m=sE1fng)7!~?&?0DW6a^|D~CWA>}aoP3Pij0<ry*P03
zMs&9BDaQ?2s5mTW8PY&=4MyA1gYUDVD~YwByNg>T7w8elWNbIYE9@YA@SudKj3w(q
z;Fp|K|K(UgzoCNKvDUaHnQ_MuU4+bGeydeR!O1CRJJpxz0vdtngGJ1*0Kosq`*ZY=
z5tCbO4elLUJL{K|amNr(!(mZ$s#zkS6crqM$}mGb4`-4#uuH{wA}nU4{4&Jp>)aO>
z(N;6BT86|yYQ`=@FF!{GW-uaS;j10Q-6lhwxQ-<l+v&+1s;!>{F5AEkFAAd102o1u
zFCJja<f6L%h6zhY6{C*39>jggg}cZ==#WX7B2zPt9{D93zBXFt1pkSWD`Rb)G9DRv
zEgBx>dJM%pI5V~%?_5viV;S7opF>9(I*D3mvG)n_lN%(Btx<hw6<X|`GCmpV`8HN)
zam2$<U8J{z!25)FzKvm*LeYg`@<V;Sr))CR(`^d1cHSN#tQcoEfb9=u*LDO!2*O%Y
z*%i}&V@Ldp+}%h6j?4N87?SINDBXtX%f4{~W3MkwizTBBDB))79|pi~R9Txh1OJYP
zzG;9O`o@fIkiU^GmjaqZKY{9OixpIguxDOv$<P8ywxN_*>_THlH&S0-#m@o<(Z-!6
zU#2pViuz2{fs&^MR8%L>M+b@SaSe|*=NsND^M)EHM$S*O0;)7vF144eC!nf2hOG*`
z275T$lMq?SdIE>6&NM3Y57L?<IxEM!0QaEgSB)}5oqkMQfS&s|OZF2`RUK9%-CtUX
zkRX%)rB&vwdvZ(KQB;v%fUBYZO#9U*`L&fo8VTw7Xs!4-KqxnKmLYG2##NCVT#fu^
z(qcUqabPFW2n1~Q+zkAC^~q~L1^D<67b#iiv0CwOfY5EWDEN4Gx8|}h`@DpntewU7
zL5gJL*Kzfx?NY%wLbvG=+D#aZWu57>6$1na*M=#}jB7U_`$~n7l0^Z8X|vTHoK|bg
zEdkVuKLLbj)1MDz=Z<7C2m`?@@v|Sg|HXFN8wo)bN*xdYmIREZRgZN*gi0*a;zmxT
zai_GYc--_!57@hn8L33>wKkK-eSG0frAPQjGFjY7Z3xT*uKec^7v+#CfPi@y9j-ho
zVz&vlGKz>Z`~X`_bYA#vIFJ6Hob6)h^CAu}Jsn@`zD}RKJ3lugA17pZ(?=Ma1vSs8
zSZ;=dmEjVY$6hr&&iMMn9xE!FQd9!-+^f!vD1gqd8^P|zKF^6WVx`9kVXL+WQ0R64
zWtar!9CQE_KLu_$4eIe)B}F7KXP~3sWa#YN0KC>3Z}n0<0&@mBTE>dQq3UUx149VO
z&<M=wZ8~LR`waJL*=R&FzyNcK8|>;z*QV1t&W(^W1q?8!xZ$|Wo7Afq4z#h}41Jtw
zr?^oDfO7s88ooBdgbXggoZ^OejHfD0^Q^IHtV`hn%qeafC{@+e7&^3OcSE1&!$0$@
z;8k(JWu&T7R2A#snc8FV&B3@=(GU-oNPBrxX8yJq=X`WwSmb~XMhPwy!F2zRvNKAu
z7zBafl{6*+?tihR{d$D0ROSMfWt0qpJ+IS#J}_PjJIGxp9zA__N#9)lOwA7i-h>}Z
z+kT3`d9>UZ_of)7I4M96Pm;o^(40jF0UXom``t&IwxUETF=tUGwz;iu05L(%zBYvV
z!_Y6&KI+)MS<VBOyR%oPB=&xkzMBjnZo9fj%SM0pp`iEU{{1&X-ZvtXN1mSh)5tFi
za+RSMm8rnP;~M>jMFQ_fX}e*2oH_G}Z+o<MLxsB^rRyeB{FK+YFFBT^b9@>4Wj%^k
zHOy`(3b5v@Ukgd({iu{29BRjDBTo!~|8`~+^nO%I&YD-|pa*7?;odPe5`8}^BnL&7
z2R*}7N;c~PO2Y3)MdZK}&b7`D$`h{+!BqJBQ3*M@79_gVk1~PoLRbRuM+M{nJzs`t
z$cTCO=qEAwqvCP6B?qj4upid;pQ6qx8;8fsAm1>K_M`V4O8ot(bR4X@Qe@+ac;5f8
z_9Xm%R6Gu>6Z|mz*tN?Z{uF`sOUL=6?A($h2tgotC0`A4|BJ2Z{0y?wAr~+V+eR!Q
zi<r%;_Cu|z_2_;mDfqs5IF3M5m;Q8t%BXQ`r&6@(ZCb0eId*r+_GAuAlF86q84f<D
zP<?2D7#uq{L%%GEOIqnrpj@7|T#IE28AQHK_tr=c*1Ai>J%7R*Rf>;q(_J1xV6Ec-
z`bOz?HRYF&cp!1swpg2PZ2nkKwla8pJ9s$bSx3yQ@)3*lV&s?g@Fh50XP!o7u^RHi
zyczuWiX4>3HCf}m4k_`UKRuIFe!E*;jPrYr&dUljp%wj`phnhm1Psk^>g^!k6zrmD
zl1IRReKRfwf0_0nqSm@O(@pezSkw$k-kh0L<w}kmN&JsY9Ziws%~#sMF@eC{v0slI
zN6oO_&6nDY1{WKu<tQV{hMK~^o3FL$EASJQ1<ZL1-D8>|w3{!rAq?Rj3ur`61f8b%
z?B;<tePso3DKM;)h=tV*pM8C`asaf-?r7Sw<S21P?sJ+?uJz53ur1=(eLFw7$NJ7^
z|D)_&k{|{_AbKVIqW8bp@Z2F2OBdO8QJrW+pgTbO^+?@}cDTe?d=$*o7lHOJ;_LjS
za%CtKcWMgjvAq!DjgfQ1Tf<T@OYisU&R^g|$o@}=x%#MOsez2hMt_Of_l4V8fG)iy
z%-%0>4<Y+{q6Le?s3lz5TMSuWLLP2Nd#v*jA~Yjj{OXHxx<R|HH{}{!*uRBA@GIy~
zKDLIN<-<@rDl|#{Y<uH@kgeawGB^T8H&j!(0RHA<Yqt?zU;`h6>#Lv-gm`_MVY!C=
z3s6yR<N{&A%oj%dHR?=8L@Q(glVVJ}z&?<&Ss|0{<9B9{rg{VY%}IB|19{!dW`ycB
zG??gvBs(%>PMkug9i1d+tayS2?O)^rA6`;Jds=qCGfR;>=x;t;iE$|HZ}y!`OqS!R
z>_O|@HVW5<%ErfhC_-F+mg9@iI|IpHRm~EiBy{?tncm}u{h-E9k<}aG)!q_LWJseh
zzj%Rth`j7x1`L@<<F?Ea=y`?y`8J)(O(OFg^gdYNKg!N1*+LkEp<5ED(!2kSJx+h#
zP}GqPFitBrsUg{&4!q&TP6Sb^3*cMQrtz=yeXIMj99b3a_Tx$@XnJsFtJ~NCPnwV_
zehhJXMe77Bmm-sQX`v^bS%Ob!oy!%p!|ElzOA9>d<^ZQM$DE22#;g__E*<=|$!-GX
z2t6NEY|NU+=pCDMoK|)>%y>Jd!=5kyRQhpEEdSWRuu=zZn6Z^!_p$@ea-NmZj|kL!
zCAHTRp@q;aPiml`B6@-FI=^`ZI}pt>eGHyt%D4Mc-R&@4S_sWDdn6JH!F53RQOD$6
zS`f{AyQIaYZOFOy;a8r!1JP{eJKE*{FmN@Q$IbcM0%?|7^5la}LMj8g$CrnGUXXF*
z%D&ivudwBtqrHRBMrudYml*bvL?Kn;b6fg(L9+1;5ymG&JV6q!Aid*D?dK)Qamdjw
zSV>}da_-%z9ekD~IItzV80roLDCHlwYYU$x4G!@;csx2uiAQa7ZQ--5!BIm4fo}!V
zu6yA(aP~*p6&+Cwg0Pho1a$w!9^nsZ-<1V8j%zhwNJ`wa+YgV+tzbdWsV^EvEpV0@
zIJ{Sw0N|eCdZ5y5RU>a}_<1J^tu`nzmZUqFPsTN|An!-#nXn(M(-3MwzHDCwpC%47
zO+8|tBEOa+n^(<v8E~)%Aw{i7fjWp!@(9Pj52Os!!3XEu$IyQYvaW)}r1hKuA-_*)
z|0zjc*H{Cu#E|?J=7+pHfKo06DnIDFGw?fLZmt6tY5~ej!NGfmC<mLFo?>?}-z9sq
z9DzVFWlb8@8_=i)`6OGdV(UicjCE8g;?qVQT$WUC5PE?|z%vFIHEr#ros@4Jc_`TZ
zc<J#bzP4c0!hD)};#g58Jo8}WatH1JzQn%?uO_UQ5J6R;mZOFEG*iXB^IEVyhN0ZY
z(C^jA`@~zpyzyTLJ41zdZPWpL*{q5=+#g_f?q7)2d!_~WvQ-sJ80$GU^Z#+zeuG+&
zPxrmPZQe9HdN;TNmb^QVFH>;V3LhLuiVgcwc1Af6gCG#S(kfco`(JG5^$%$qN%os;
zsN#sjOddJ(UV?m)gEM|GWd<4~Gr1Z)M}AF6P`_y^93A%ugV2|uh*cn86u)uC*bys+
z{-4ufCCC@_Z&akQ2I;rw(6pVv@7V}UalglbL8}OHr;2J7$QPt<=-@cuM%S(*J(5}p
z@CD@?ZI;R9h_MX@_u5YA_iV(seuQ}iL9mn`mi=MfDwuCErfP^6A@{4ze#~nl@<&D@
zPQ@-kwS)E7ANoU90cMLU)j*$Co0H!h`66Q_WVX0cxpwm4*@xTt^-JwwD?zisy}6qK
zx7m;nNNXu46=W8eH`rq9#Jz3>x4c41u<Tr|;#4;dmLG#!{UO^GU>3+X2;T^Ubfh28
zE6ZHDl^SM|eKXqupmcaFuy)tWzg2))q~ECMot+6g<VR71*a-cR@7Tm?!l?dhsGA}r
zGj?LXrz9SZaQ=0|=%R$=P)>IRn?(T}{n<%hRkh?)k<ClH1kM5@hY2cuzCO&+s#ybn
zz^6ZDXOP7p3<A+BNrDpYf3eQQMN3G1vh0TXc#V#9_>=2~e>t2Hi!;a;YO<$&0_!FD
z6zn+obaD*Bp+4cGX=2t(@+nwyc;jF=1$VU|8Ah&Mkxw2Dq|KFfE=?+*y!qK%l23j`
zPooNxI_OR%0YTr?{@)Udgn6_CHz|^xG9SsbBA`4N0k}uS@E=Z8v!~XyB%lKRMqCFu
zuUt848_}Q@2_=DlGwB2}<KGX@d;%*l=5GkxSLuus?_q5^tK9ml$`2R)dmgza3F${C
zxBJMtuK<JRAUurvaL7+6zQ(WIw4<VPWP#wgN@plTTO)t00)j``xYH<;<HJ;*o_89p
zfP%mGCw{t2G<lm(#$z*7&|d1rx?+r%Q5m>!di~#A^g}=52!|RKFJMffvCVX-z?r{f
z;op!Y#@rRIAm*q5tB~d|SqwStpmf*9<gg49w+d+<wPi__W#XBf2lbife@+UhdDM>H
zI2t&FF!&4SWn-<Xu;x)b8US#{o6s|(J{jn*ivRCQWNzT(;0MSU4Ea!YE=dl9FciF!
ziID~Ozu3I?EHXl47g}YfP)dM@KCLSc^Yj95UZ!JU)qrl&V$3GWfz=8XUbZ6#$DsDy
zZU1^WrIW-fi;iJcqZ^nXvwvnPM6593!O<=WgR4nOGUk0;|6Gk;a>tAzM12|6v69(G
zj!qVs@KU<5B!}D=EXARhoNd^Bc1I}4;VEN{#ECwv?-+jcMJ&dVnr1@E><pF6)E+PJ
z;AJ|f)Io6aJPe7zeb6>czxX4jIHZ9`r&5}fV?I_3*mjw=m_2EXVA1KsXx$ydFN==b
zkSELm-+KCy-Wpa?WS@1sI6Yqn7uY#kT69H`{bk>5*m+rE#4$FCJlk-I#+EmoRrJ@n
zjI{x|H}BDRd4#50Nq<Gy%}sPAf(0*j%kZN&BJIZR=#@?nsYmy`=86J~yqlpvfSgS2
zZ|`Hv@{2e63NLl~t^03d(;5k~icE^-Hed+g9Zcr&X8OBZNy@~68$;L8(KF!Z&J?S$
zijw)(+x$>=ZbuM<AQWvWy8>$ejV;Ih5|WHGz&MNv5AWlT5`qATT9%;ze-QZP(EBR}
zzB7pK$waI&e=n6zqXlBW0$f4sMRL*BN;j~BZQ9k0uiM+*kBmH5XsI9A(KcV$ZWI$A
z4}HkbcdyhB?4mc`Eh3_hR3J2toa;(MAkj8l;JaNuaHH0iFLtHAN?4w<`3CZ^Y@t6h
z?U=MwVRx%3wYeB}y-iy(5FxfzDy#%5F?*|qET|$!dlLHP*Z~1IE;v-48w5wsVn5%L
z5fn$4rT2h{+HcNXDYF51<NpyvmU(EEJ`MsuCnO+mCTK4lo5cTqb`tq99U7FwX`@HS
z+0nkE-6W(^)O81mUp{ssapk{mUP_XsXtz>b*MJgl2)<x+;Ei?5PHNps#a(3=SrcPJ
zhPZI{v+7nU?z$~*&_``Bo-hZ=t&Ww7yKXe9zD5iP1<F>apM-wS$37(rcxdJq=;pa6
zu}a?%z&C0f)-SjC5OWgvB_CmNqmU|=BXPf3W!aCiGdhA81fgI{i5i~v-`KIaFC>`>
z4LCPm)D>YV5lPhF@NrD>>OfbahySrcBvF6k%YE?b>dS`4Q=f)@pOUD*p}4aTx<B3t
zIC;&Kc*kNsoKw8$BuTTHwA3rGW1A)QZ>qcqzGY9NDoSo2JBDo95|JRT370+0bp@qt
z>#@=3ZeZm0G|R<3Rzj(meA8g7(a1^#O!EFzLa89YK~&aA5+9e2nK9lfBo!J@A#pyb
zFkbkV+J|x9rz7;8@*5vj70b6MtzDxaD}`1Ri>UmY9(Qpu;-xH8lvUVIo2L<vk)P+f
z)k}GzOXL?@Po2|u(?QLuAC7xZD^+~l#058nk>A~Wr_A%p4tuG>l+k<BQR#M?R$^Gl
zZ;L81rM4m}?i@TZ`sMT?6HX<j+!AmO!kc#~LFZV=5Ty!L>OFX)5=3fKYfR1N2e{KU
zCHVH~SH90dXgJkD0|M#`DRfRSQH3Id>Bi}iN|-fBCr-u#l>jp2+H|LmA7$r~!!QT~
z(JO`T!2K^)zo;8b65&;M2$2GV8Qut+C$}$~GF3=Bu3=NH{(ZA7M|F!Elp^ABHQR93
zO7|PrUPPwhLDL`Ov7Qzy9#P@!pD3qx()Rn1tfU*vB$N{gm)oBQDWV=7>4uxcG4Q=n
zY}u<U3JFNZy0K$og^g!BI1bwFbgqcXbEun<GXXc9teDChxP!LeJMQA9xNph2;RJ*9
zx|5E-f6VDBs^FZ<04MYC9A6QoH=X^>w#0(?eK5Z%B=c7I4G>dPtCtdw6HXd_9}8Dc
zz3#9d3W)Qeo}h?+bU9Nt(c$%Q!8+~#Jr0`w7>{*3B)`N~R4_PwXZTAY{kY<9Y?hO3
zUh36)-artF$j9jpifXnB@l)=ose`6JI_<*W)bgwlHb+y>`)CJ*UiSE#)Y`2haRtw`
z3!8}2%Z`6TwXBf{ooy4ob`nX1+urkPxPcN#sE{e^q74+S0JfdSp^IK1cPnu!YERQ9
zLT&GPG2Cz)10Ko7sgADCPX8!717wFm5Qtt$Q)|inFZTD@>HH$rkqhh?Vj?8)_8=av
zJ-iH8<p%QVUSv55X!{$g{LK;X90z!`6~<i;lsED49C4r+;GT3QFIWm0WIOHlp0KH1
z*Z82XGr{8Dqy)2_-Z?KVZDVK;fL;6omw~q9wC%Oaa5FU1Sr*RS46|Lzu3n_#AFZOb
zTp`ejwD0=rwkZcXn=5y9q0Tx=+`?bLE8@4;+P|;8O|NI&Fg@7~>x<Yckig1I+W*g2
z1zt;k4N~!m?j{~R4F2Kopn^8g7&1tC3H!A4R-siH@Wt73L2*hz<uOU~+JKtz8(>DD
zooR0tK8+9SC1Jz4q_o9Xs|5O;#Ki|&)fSZz26)eMB>nqFPVQ2;j(2T8W74<Yac5_e
zyvsG%sNyghL?6BDT{o9S38=huCmL#n#l>L4f5Exa-7MHOfRo5zK{i~Ep-Il#mRYlF
z0Jq_l#s&c;92pWBq&&EOw`{WOM^(LFmFC5a*DMth=MRo&{Of{tqlEVp>p#lQC`n=v
z1fo~cQKNnTi!INOokB9HZ~>Acq<ji?{|C;%oimoQDqeez34!9;KQSLEw)5svT%bc_
zno0gJindZ*cWT_Uf>S9SMO3pwrj;SPL*nML7q(3iijQ4WVSQDK?Yzj%e({P5SKFQE
zu*fJycV6bEU}`Qbiny0iV*^bYzH5i2hP}9P<GfH%pRrDqB0N8NgIYbSG3wj%ZeCU?
z#`AVlb6c3$Be<JZVx?pd&l^s0dueS)H7l9=BJM*zmbc0^Sir)nY)gYzp?_z?{gTTH
zWZ=VFN4q&}Qik!I*_8c`y?+oavMvA3;jB{B*AFVCKIl0!Bp=swWys9W-JoyN7P}ct
zL1TYJ8O-rsQv>Z^=GJTJy~W*@Qj~Md-7tBIfRjcwT!^r$4CeT$8xEROK1lOi{kvv8
zMSl2@$1y6B9YQdCZX=yn!GGuEKvr2oxU52MtjNz(T4hM*7`xfxv4a-rXhD=VBhPM;
zoxBE`wAe;o-B=r4r0^vlSm%$jGdi{y1c7KvsEI=VjXh5Okn0<1fN?N{1z|VYexv@I
zpqId+3YlSD7(SnRpSuxVwApD(3i5_G#*Y^n=Wh64!!~LP-%ZOgSwTB*)PEaIp|$o{
zN3Jr*WC`trksBF~u0L<XjAZN1_Sq#dCOzZA<;M=-O3FMc6}YpBPBCQH46#Rhb}p`;
zhX3(Lj7PY>g<VK-z@1UNN(t-4p_?%lk3G#ge3fmtTmd?9<^~;_4ofcznAsmCl(Pv=
z3Az+!@Yl=Lk<ZQuTsL0)540mtSVOm|@1`pdCotXk|J2K;sYV+$x7k%nASaOBJglU#
zo$SHB#&cu%?2QnIP@Xvqap3o5vFwft#tB+e5J-LkF*a3Erg$z)|KpEPJWkK#FPu?}
zi5}U1*IFX5?{m`%=lx}V8ho$GkBh7zsJZEBh-#;Z<dM{7K6t6W71?eCHmZk7RWA$t
zQtyl(y%One{Oe$)qA}=64QVObE8s6mPRVGC#0!=E^a3G!yz)BQ*GBAbtfaO1N7>nA
zTL^<NcuPuaN%z08M|h)%-Xjx-46r|G3t#9|dDN#yv?%!|r8g|Fb8=Ec`|a8mf(|9$
z1bainii2L{n?2CuQ{*2R5qL4TFur<m999QRv=IEJ<eL*ll5@-)y20H8cO<2|zQyDP
zM(EUQ?k{nF<N_KvZ^&sVK`zp#(C@j}iu*>4j#!;z+RQTOIzm;dZ(;|h;X@o~*tK!)
zFOlD~0qt5OM0b$tcRn=rpvB%dHJZ96`?Tr5eHxFa;~u-CQ=w<a7_y#ooc9(Ft4B+x
zLUn4=9_g%n#MkSp*V3uVyP=)+{O>a7k*5C24t(Dr8{`rC5^!FjMS7}uM+?7ia4k4Y
zKf{#^Q|%2zi@$GLg)<`GYauVn-RtJt;qM!6t~YBMfq|iiS$*ywLcga(YjAR0dp@Sn
zd!&q$v!z(ogDPZuZs=f5)ltgV&_Vl~LT{YA?uv;`Ai=5{twr`Xh2GGyE)Tq{eHvAx
zwYdJKK2+q3?es#P>nitWcqIG(QFdlI5`-`ey%J!SaQ}<7%}0+yx<-{cKvc3IgeA|9
zk=^3B#O{z=c016XH<AAlWV)YbiNN)M2}&)@ab%}zR!6)kT@W-`r|2qWtT@{<C96Z;
zsKtEXG|F@FEy1eYQnmrjF>jQbj-w71&T~F{6Z=ULIOq+NwdwsAXQbLTc9c6&ucBPI
z)Gl7MSU?mTab#!8RTTeFoDq!)V42D`yovlQh^tk_x~0Tigl3QM5zANxz*BEzjm)eK
z@o7hoBV?xJ7#DC!uQz0dv7?8srOXIW{2sE)4Abgqy{;jtu8bVsuvn)d+#*%=M$f>S
zvy>SDiob#6;NaS|j=h>tFK=Q$3*u(uu>ckKdg1TF@f$c%u%ec$_rb9BX4h1f#95xH
zSaH9>5wb$5Ra@;J10++j;=<lcos4&N!%a21-=TL#k&AgVnXwziXgcNkk*{}3l70a(
zEA}z{m1!m7eB3EbhNmu9CRE+{$}cY@k&GPyoDmi4SN^FrRZk_N)hvVdhclu&gaUpa
z%FgIWf)E6vDGA7m`6qU?_XW&MNdnd^tI{gGhJJeJ`mz?<Unm|QhbID6v{6ZY$FmmN
zUt(>}MC+wbYh9Ce?l86v+FxR24qy<vUAuc;Tn}2Ih4z<NnKP%0Yy}up{%7{h*slR$
zPEaJ;c$G$T)~J^)9k{<l6Dr?I&ufRr8A#Tvp+7>BEE*3~XAz<7tmfSo++QO4#^<#Q
zc>m~uiLLd!XD1{Hn98^W<-=cIRlT?1{=$iv%BsVcjSp_WdN$>j?2ArR3PK(n&<LEr
zT{gdtaezc4Di?dMNMQ#AZ@7nzq$T@Okq!g<jlO07J(ipJtm7LXsYK`CW#%$Kw1`Xj
zkF|^gB$eo(TfvhoZW&ZaZiasSBO@2b6E5s3&}Gc|SlY1-5Sg*213esT!wtu7#{CFI
zP^tqq?Ks#mU>0?mw}e>);t)<61~?wb9%XKHlv%{#oLs(tuFX({do%DyG!oQ*O}2xZ
zKtWqw;vMl6aX7dr8wPVw>>ySn{i2=zD7yk2hCvYcB@w9j|BsDx$rhw-<O8H(Ob<Nn
z?qhF?IHpTpUA*_gWPhB*e*6_>XRTrY;HULmtgtj}sR;XX^q+$H4=qm#EZk+aO)E+J
z^QMVoAmp?raB08{zMlkt&Wdc>l9=t|*oI7P&%rCeZzJbm%h6kPnvl`&`L(Si^3NMR
z=Yl;5uU#Lk{4_ZU{+yLSVD+xX+udpM9X;<iO-1CNB{q=S2JXhoza6ZUaS-|?B{Mds
zx-^IgTU#^Vy<9?n8n^x%FucR3?$w!R{1pQM)@ZjegrR?coHHH7eNIQ9<`BfVp>K^j
zWp;+Ql63%Y)SM0pAJ`IJX8q>xUIBiQnbT<~+=~cJSQdY=l6?RNIh^)w56JH`2RXgv
z0x1E%poc?Zvkz3pzs!DNE0|A5oY^iHs<n_}`8A?sNx+en<L9a3IlU|1BIqU?70{>K
zh9hjECxQ0}y`6ljmOx*0qH0qNmN%gE^3a<Sslc=7L`AEkcFd-Dvl<71U%onu#(gL|
zw<L){5Q=U|B?|6;W5daO^bpFP&<mg}+Q&8ChvU>cT+O$SYh-{XC4d&_InCQWZ%175
zDZW=KT|sD(pM&ug-_L9!w7NII7sbEyWS*pERth1I$j50U$24vMNDM}P|Ei=A$kIsq
zbWor$EX)XU&PP@W@CE-H2F@L(k>iBh=^k&2pS!Z3qHaWaqIjSuiHlW&2qe;RgalG)
zK4wDJ`>WFDo<us1+z#afn?f6sS4t_0Kq4E5tlNR>Br|5uJnjnG(->Tgb)y=l%Z_aF
zUVW9o-opq-Af8+oR&lDYDxVt?NdSW&3?(mWkDe-5fL@^DK&0=!H~Y{3&1cG{l|l~W
zVS&@howncPj*rpY*V5;1gykrWM^`?sj70`@>PH3UJuPum;Sh}tk4>`-z)E2UV)2c`
zXEmu3H<vPPBBiVYiIzAM$}Wm-UoJECqk{7SA%_zX(#YT`bL9(qDd#`}A%`G8<W{~=
z_Uipj;d3wko`w^x3##DdH(gEh?jMx*L)jJJNDzXsFQGV!|Nq#vUN%|8*~kZoV@4@h
zS|9iO5aQNo0Mo!wz|$=V4qM9JKs^zspcq$9tCDma|K|+Eb0i%0*E#T6nX_Wt3<5Lv
zq(NRFXKJbYb)b2sJOb3_wq)A5(gscrq}`N7fNuO7+7watn`46Ikh3xnZ2C71pgW;p
z2nrVzURR;tcVt!{dver{eviPVb{G47OVrB-q8cY)S`y<up70DL+k|jR9jn>Y|H=R5
zBJ__f@lBgaXRp!L?6Hi9nle@a>XmRP&Nxw8bfj?;tGiN?r8NC@ZfUWMYRdwnlZ+E~
zC8O%EUJXYolK`DvJ4*8dQ|3v5n@tXf&uWDpskpC4G(WeLjX?7>91b&c@*PWFs{i2^
z&lm}`ZywG?oF9wyq?<xh4Kl59_gVOS&8*N%GqU?l^KGT+L2O&4)cu=d-3a}IAF5GN
z`bOn0_WOoBo5~?M3!?&|%aEwcZ5i)?CVdNz1Fnp}Wd09Fyrq`D2{f`t-HhZ^Go<xT
zWA=}-D>#B61Ys?S3(EH2*d=^!guR=k0ftf0fRKExTgP=z#`z%?RXuF$UB6t-T05Eo
zkqsx}lM`mL%BnQLf}SKej6#lp`SyELEk$0~{_S>>p5nx~h#^bgb3Hu1*7*k1)Py4!
zG9=dTsVnsG>)O#j(32o%z+GU!U`Jpbt00n=NP(s{9KePcYayuQgIUj^cRWw=i5pcm
zi~Gt(3wdGs&vvHpqyo?lOtSGF;({qnX6CJB$>9mdFV=xcJN(e;(@|JZ$>ABZu*Sb0
zFOogp(pOMP`6IjHC{W8ha*Q0E9eo8oJ90w9!Zw9L1NPKUu$IDtCbk?Rs<nM>R$NrI
zx-K2pXEF`|2*ZQ(loUmnFO2_jJ<<NJjYm0Rl;KpNNlOnwPvV>vJO+#0N6|x*6UvSn
zf}X@VI6I^_CjTiBY&qjCEd-q@K5->-_7o7-oa`&bdIzv%VJf`HY*lic@~cWjcuTTC
z5BeNK4opg@&=*;?ceNucpa*%51(S=%!~qUVT@YISP<BQ)5Q8ubovFnMbpORJ=Dti$
zr+NW|pp+yy&#xyfZdD{yv%Xp%Hl-4MJ*-eg+^T{P>x1n%W8GIflunc)W>whMGFJt)
zG4sW!e^z3s2UcZeG-_n`On=XGp#M-&PE^W715&!oV7wan&!j`O>30O%F6ubmJ<@cL
z|4>#=u$Qp@dKbxCKMvuvCOxGdb@L&;COsG3sM~rtfy2-vxLco+&RUi3^n1pN8-$j_
zUhfeZizeu^tKKa#KLnREZkApuMZ=Q~oxB_>KcM!-Y$M{nR+`p9oXdjp0|!lY(BpM(
zvGmiwyT@9Mp~~Q(yt`73i#4fZWQWNQ)#6lAmNaZx)FMaEZ7e1~REtBX53PEc?Pd2O
zSr(HYhd<R!lD3lG?Ymd$9NUR+4tuKHRX>Wt*hbm*(Sr0tIXQK&6RaJvQ7HYYbvXJ^
zdny7%@Wj{5c=jh#3#AV=sH$6`;+mw(Fndh<l30ZpMdg6yXVNt5+~7yt<k0jHT5A1J
zb_PihgCG$6k};t1{~ueMJs~C~*F8`v&FVmg=Cb<E0FTu+fA$njUz{Ch2A!Ef=jUb^
zmo;=o*!a;@*q!Qw`mpI#;~?_KL#rPkHIR{%{N}lO^w1yM=&nYyQcbZ#V@^m2G8lbv
zZk*cquv9_!mCbCRCk4?Lbr?CZ#^e9&q1MkrzpsY77_XUeDfz(Y8oG!w0DW;j9C<1w
zL8T#LCX{glQ>w{Baz<y8ppAs@7&}fvzpjS!;ow_P$}U(vpD4&O41IAf9FG5{G=uTs
zd$WZpLFQ~YdQH7_)9ph&XT;+)Bgh;j2T(>GjG~}3DdwO(CCHp9M~!Gs>l1fZ6l5ua
zzBo^gFs@A0U}hqlD<C7uoFPXm4erc{zopd8L#HI!!pAWnHp~+maasw%Gl+Xx@HliC
z0~{zfzFG~*Z3=QP3m*sTKXpEmjj8+2g1>I%!p8wfWDUIiHkxu+m5h4wmK>_KjBIB(
z4)w(FqNGsw(!EiYR}Y(@_9DTB62b02%FZnbVh{v^S5ib1?tihR{Uhp@T!5r}fjaj5
z`|Ho)Y7wT+3lK*5K)H$j=fA(#A2|J(X9elg23u~TpS$yk<|nOH-{#;=wb@E%xbzyd
zIWmo}pwW`XR#-`jCa+J-khS6hBa`N}vSBhXc@4Up&gg~&XdJQJMLzdq5a#&E>*(l_
zJ(>@4xe0x2kLXs#=?c^j&opAIxG#f~*C@^5xdK*y)w88;emYZ)1Z@r#Fd4xIG^D|+
z$bVWoIB{TT1F58VG5l^8kyJJEMqpLPA`aJ+(Kjz!GQ4+<`kXmUP;Y@`YwL7LRU=WN
zGuJ&Va-TtwR&PR|+ruJQ#d!bE{b}3q7BVb(wTP`Mkd)@TDjDm}E`@v70LT$iZpFO@
z`}HL^W@?d0$0^hAgqMO-db|$m3^`pR9fxzh=}zr?|1tC;@OgCD=i(7RFsmSPeF@(P
z9aG$N4SXC>+kh>+BSG)1lQDx$SBpRnj1drWQBpo_5$B|+=^Dj3ULgD^JEI&6VGxRL
zskESF{~H@mXFguR=Sbo=X)qd~mviyPkp-Gg3XclcTz6%Tvg8AwQ`ea2Mc{`c2LJ#?
z`&fV+>-pllL^ikGr3x+LDU(N$r>D1AC=;v&^*G?9$@VT~Up{ta&SI_a1h1)>=yjQx
zgQY&qM=2$HtvVp8AgH<is>i%JxK?taLD=CeR6!y#Pm8v$rIZBN@#)<e65-!_(~DK0
z>=uMNj#sTA1XUToq^y5qKO8&|kI%+x6@F3z9p+W=?=LfWIbt++RhhzN$B{xGm7I8#
z5MJLql>H72C2jGRkna{`I+M){y!u%0o9DaWUvm;<I$Q@{fA7UmSIJ#u1^I44rQ=+6
z&-OP5ZLeZK9DJYaEIu(NCfBDEEBFfW-Q=@kJ?N2GAzzk@d0VxFe76mg!z>3F*0Kz{
z+1V-q-)-aMC@qarH#F{;@-NUU`Pha!(%}m>XdP~Oo>)S%+s4VEEpV0%kaI|y>Uago
zZsL37(d}T$MbhJ;KO_H8cCJYbgCG#TQiM?9{ue82f4QU?xq#!)8hNbW9&B2!9l;Bq
zag_kZD|q2Xo@275t9e2I2#03#K@b})Y`SgcRlvb46nkC-UhUkY#Z9+ei*o}jJ)oJ%
z54Ju;S~>xtxnmZL7$=Lv%&Kl%S`neSBfuwF>jDs4@jKCiryDVHvY5OxU2x2L=d5dY
zvM562=yaH$!ZYIXv!!1`;-vSUibBuel69A%W^@4OCafjTvjXDhovEviy75k1#5O6;
z!l2AC^BODiyXfG@jR-jb;VmQ)c;gWtzICI6@iyh|YTjCsKPTP>RP)nlfxL}8tb8u}
z@ijvp<Kf_RZgldnf|$xtHbEK(*vi4$FB_*f9zYES=rCwG559Y&#oadjut~0FwT?P+
zjT6dWrIRu!c>`pmeW~sP1B9csU!vk{9qj06D|*7UXA~{|w(Zm$5Gbx2bWQ+hAHIW~
zykUpt;8l8lTcN#}upSr(OaG4vL33pMl+KcAd|aiM5$BBTFJ)(#D=`QH;VZQ&0{6ez
zoAD)^0J}~3-Gnq$E9&qKW5>D4ULBfk6E<MAvD{mXY)Q}@sw7a}W3#HmvN4pm5ZSWQ
z#Rr0uIf!bQ&cr1pozi4UY=ps-q?sSBSGA~gyoIrrq|&*L4>>Q`DO;+sI|W2k=^Ud#
z$|?7)6F=~h?ao4+L^{GjvJQOfo^Jv_jF5P~vv_7ir|p}JkvEZlW;!Z#kZ9xSB1Q<W
zQ0oHU!9hzhv$DNU_w#8x(y~SM77tpYnH4rPi@KeKdG43j_wFq6k(fg$sLs<tf(_+*
z75X9Hu^p1e(uZ=3C-qp$J7{HzURKkE1q2~kSQ@NOnpXJ`-K?hZ0us4Ew(qfX<WB7n
z&8!ywO<V1FA${p5^cDbFA~i=;iQ_i>N(PFxs|>%+;vS(nnE5&=sG*Uw)}o}v5|*7r
zb0m9nTQ<qwuHUh<{O)+*>WYuZ@uw{6Uxj{n?I@Zvf>$=#0spQWA##WID?4de2g!g&
za`Rn54_`z79wK|CBYCc3a|qRmpO^ll?2M8u1Ysa}B|#(P{ukRc?`uR^a)A^T1%?oM
zR*}EcVfv)HVAw&af3TaMKXwLEY`09t(AreEaFcI+_5$$~rP$QbDrR|z`3AG&Cy94r
zf2X9&g<*s{LTyv;pPd*y!zs4g)#s+1R(Tr{nYreKq>2Jf4wCriRPJn0I<__F?|d{V
z?!=nnHtr)ac%4IMlt`1>PR#B?zdDXZbtmp($g(veuFn>06HC;~kv&5ZHto?dK3!;p
z`2BwNApZtld_uj4jEJ$C()nF5Y~PCgose5W_>C9U__ae^ofDFgA<~{h(-Oz8h&+%^
zTcH;z5qM6aufEgWaryC5{i`X7qx2kVMRCjnf`_J@Bu)lUZ2frb=#cQ7bGx4tN7GY$
zV(UeRJ+?-}*}2bmdY%FlTUV47#!cLd9e($xf39Z`#nu(v!DPG}%~tIyJAoHNRyQl0
zbNjH2=54?vf-@*#Q!}edBP-5Dw7_3;eIW%CHf87#55OMoVP}2WWVVFaA7y8h12G5!
z(JNULl>1+789p`v(nc;o8rmw#W9A=wN0+wg;;lzlkyp}=N-+mU=UHf4VF@`HTDpk)
zkqnI<ZI&HaY*?*uYPHu=DCU6Z5ZM72BfM~d&v85A#2oP)7|-BH0Aj9MDrrlam;<3h
z&RiV#4ici9!0)M;u}8BV4YL{&EMCb*r_c-5RY2bvn*grJ=_2e$Dnf1gKxTvi(a7Me
z#I7C1V2+|W&mzGcwqi29Ec`9KVAj;+km2*o=o#2!=as)B>dTsJ0PM|;z2J@@6*tqC
zt}koy0f1?mZQ)j&Qd#(0vc8hA9NS_i^fSTUt<r+kj;yalEN7vVriEETt<T&k#3V8~
z5Kmrv!sC2f!t3w7TKR~lM6k6F04RYrLfNl6!oCub9Jn>xH|_J8Li-}{M?z9_!%?53
zwnJj%pp>Q^U0=yW&asaJHW9uy)!Vn0uCGKQ2edo7jRR^(aufLdHJ<d;xS(~xU|{cB
zg6~d75|3jWxAScSgUz+3`N#fIc6K)agCG!INf0UQzgRinkhGBnj5+^MxsNMFaz0Kd
zvJi8`Z7%i^x@q}SlAMeK?jnn!($?Icj%VAANKA7sj>6nRNTM{jQtH-cEkWkd?FeV^
zl!|5flthjeLs&B~CuSqTY|CKfj#-zDcO+R^l2C$Z;dn&pAiik&N0R)l5#ikf>Z9*@
za@Fl0Nsb&jn4vh9j-aGcDPZ6og0LQ}99aAY>}YY>V6Qir7D8ALSdQWhBhn3#q<a3g
z7{Z!yIRvWc&dwQQ)oM-NVF+tx<!lhzeD(wsm8+(|H96{6;i!pighBeL7E^Cggq4%6
zBSMB4&YhI#QU;PcdL&ba;Mo_97}>R^?V{x$Ig+VEFo3a>fEiH{aNeQ_E2mNbZW8ey
zo~`GSBJ=F1k-b&1!a)feASBpDyFXgwPezZyQ<&ulUj%h(bmG38kP~OjiaYrLKK8Nt
z_S@q8YA#wOhI~&XKRF&juDbm_hB+x`!FFdtG-1~)MMb?s`_-M3^HO#OI2MB-5WP~Z
zfO`LnEzeDU7Wvzh3m9Wt!8-HikK9bv-wUkdHu{&hy43syMh@2IwM#EVhg^Fryk859
z9C+KrI&w8-<9;#j!%7DZ0GA|O9?f+($%>W=O4uSHXYu^F5%taK(p<bso!KG8L2)Y!
ztCD|~v*qelX`l`r4o-}AL!Hr`X|rC8{V?&vgnZ$N?OxNor(E}|iU0p7qY}r@Uz<|T
zZ+tvJsjaLqf9+7>3_>W-t&&P4`SMFjjgCYZIcC!aw7+p8J3sac^4BC(M!ZVDS%yC6
ztdP@ElM{3}2&p(SX@_K(%wem<61J$r@%MuerGW?Z(v;G)Dkx!-P#hZs!?r^o)b1DK
zJ}gJftkT(Zwe2pLxpgW*giRuo+&3tG<C9mP3VH<~Y;pj}iHh{8DSorO%BA)u<W+TU
z%~gGm>oCI7u3BLVTga>GzUxh!Nc8*s@)?$}zZMxe{AyW%OkuG}nscQK(HOA0ok<uI
z2Nc>D13#>@oSQXfX-F44-0?h;e%w|+l$~1=Lm>!5x8#e6``=iJe?Z%j4LEnW=md<1
zr?2*%oOQv__V+FXMe`OfDFyGo;V>c&P9S7u<XBgPf&`E1om@yPf}J7b<cO4dL=xsY
z_TA{oA+Nq`&g+U=@b;UzITHYUJ<i9xIoKt+fEKMz&Cct^i!~ijpZ$B&c>j$Z(}HgM
zU2XlH-2@fPFTDMRMq`!D+1S__!hK4ZUw8)&2VH6-LfEn#$l)&O5bwabb~U=4SbJzz
z*cHStyak7lK}s^ZWq3)y9+v(S68JU|?>bm_ock8#ysZ5@Bs*eOXa|<-AhPm5?#c>3
z7zq8<N%KEhk#nl#Hc<&5j6lt?!;kIHW0}~;m%W3M&I#BY7Q8I0*=;!)r+zAEVgzaq
zXFSkQV1+^-D~qTSnHYhZBRUUr^9re!bEO0(hR5bCzMwW`sT}(_zpPzRJbsWBgN)7@
zphHCQu<)Oc_V<sLcOW6FndV7Wp9+!~o|n^Y%PgK%oMg4K5$u&n{Gseza3lypAbKUg
zAosu6RP}7KgW5(eK#YwoNb&fy?N239tE|!_z7(zF!Y#ri7M<HU*oVU029adFvwc|j
z%(6n}p`ChFKHAxp@z+o36*&Z6u#_hS#}fJbayLZS#4@HdlC$>UejJwaBv2Q&-*?4J
zauQspK3Z5KgzskAhdrrNcGLJLVXyi|uNr|LixcJKma*dgC75g)6hrW1aiW}D@MDE>
z4&(mU<sS{d?}kTp;4pGzjInci?G?5NR#}`NCpD^qRS`ST#W$xW6b3p`PU^M5KhlHu
z({{7y!-o83k_{(D$x7g``m}M6NDSyiIXK=`;d-59+P=9ULm{9O=5Qk((f}umj*aO^
zl;(6fwZQF=?vXaY7l9kghebQJD)|D1#RJ3+x}w=E!ao-C@;FxUNC{_hlU9*_h<_}e
zn?pbcF^nU1%j<MX3-OP|rYD_&IH8q7BE`Jd5%{r~d(kP>ANI^~zip97gviHYP8`SL
z4ChS4xizhoFb%~{UYwKbU{@9HF1E)0Dn37yol$bcFbG4hWQeK4{V!JJ>5oFTvs}Q#
zIK&XFJpHXb=$)YI96O`|rr)A}X%BlcF2Z_TJaQIQ%T{Krw=J1;W>AHWAHmXQ#icW9
zJFF*AWvD<WjA-n2xzYFi*-lQl$544r91Ds#2(Gj)I~#$Ip#q)y9H?`H*sSn=u{6OG
zV?B5PoS*p(`a|VQ&@l>HwQ_rt8)+N3$<*B6to=DbZvE|!MqJwu58u0%e!?imO0DKj
zKapU8aNvuDKL>3~Tadt2^_<z^`{ivMv>-4sA*abe5?aa%869;2jKWqM@*rQICb26#
z+EctIK`T&>cFooE61?wCzBS?q!_<R(vt(5(M!kh~;(Lxr!VpppsRc<fL>hGl{kYD_
zhWu#ri#kQBL87Zje6j97`vJ|o<o65Bu`2VPc{hOw!_@t_HiCdKjuEd8gU%5{7^W|x
zQ?*5MdQ@KbJIxV77y`<nSJ;8KUKb~!%~d2P1Yrm(XW=H44AtLI+|n;J2LRz;%FZa)
zVh{wPTdHWq?tf#C<GVjV+Q<e-gN6<`%n;jwROF5stQy>t^rBwT4^~gcu{&W6wQMQq
znNeg(J6Js*r(46j)^^DmdKmis5WP{(UN{-Jr-4<|-K&5EN5_FY^!(2$K<ue{tX|58
zU#EiTgB`TYt%e`VM@2bUommyk-DX&fWfo|liD_Gs4pwJZMb}~tzpOEKH+mBJ^%T4R
zE9$eku+Ws4+{C(9kq%bpR@Lz1wU`Jgw>}TzzGoxwaZuLZ!V6+)&VTZXD6#e^T4kjJ
zM%CP>DF>lHKHHB{S$Tb^)N9;&82kMg?<oJ&+Ru8dWm0oRmsq_#&MkPtOy<fB(UX(V
zA1Mh79m2~01&711YQB9X;N)33yiIQhp&>lW#>f@m<QX}jQ*3$-Uy97Ey0c2qX<V@z
z?RJK$R#j&nv6NJgH4t);e!}$pRtC%|*A?UxgmLs~)*2yNIy*v5^C0#|N`fZ<WAV9I
z1zXTL#!2w^oQ$AY%C^pZq5IT4g!-fG42&2CK`6SC8Y6Z8#mXbSwrFf+0WL>K1cCR>
zc!bz2Uco9|Oilnwh26d>x<k-r@o=2X4jZ+CrpGeD21CGRse_`UuoqU4KEJ3cqwz>~
zR!5Rt0r4S-{ZNSQ*#6-X-{R1(vDy#~djUt^GrshSN95?4jx1Jw@n@$GGeU$GPsk~@
zEJ82o!SeBj;U5p}@yAGLsHfqS-|?y<)MoJmIxu)a_Z_x8IH!LhYO@S@oK)ddB1XnM
z=#J&JLtODFj9WA<r_oWniM~ko=M=26x<^ZCZi&))Gt3quHj5Ln$|#a+@Rg%O_1-hR
z_Q!Y5s-Xc$6Z}N^Xji`tM^e9Y=xzuCtNIQb)o<Uhynf_1XdiQb$TqsED<Kd#T92fE
zZIC|Z&!j;^Z_NO5b;J1jMK&)FpfM+mQqmGUZ|?g-v}W<+IVJ$274N0{Hr>8QSk2;x
zbF?h&*;0qIbH>dP7|H<scuvy)v`t@WLPgVi$Mo7G;~sMFCXt<>rp;0KCk1>`b_Gcg
zgCOinAZvC1|FKP+y@1fs4`kX@CDj-_^awlq6T?LMx(%94_bUnL%{jdHNS~$9Th!+n
zc1_7QRxxRvCac~PYs5_$^cW%3QE9g2As(cO9RSyacwY`sb+wOF_CG#(<eCm|%3&Av
zhJh!~8rmKiOYM#J8zGWISzjQzsd%<LfE@dUkdIH567Ih6t}k?h9D>)J_z6jK^JL!y
zEK?&zztMl8l@%{qvaNxxsHV+9orAyd67G0VX)AkzFd}vn^96cMj5~vbrsOFk%^ddK
z%CO2!p7j_$qC>Er$ltMUXV5h%uA!B3BeyX(L3uKEgj^Eh`dKLx2Qb;q3@hN=kZ-i5
z>t@APe%yc=42x{p0KC$c!Ir~xRenSKkv(U~H61=>Rn{K~)0Ad^TJjZd)MX6I!E4yc
z=$uI-(;WMSlE=qDeI}+Qtzjs}n`ylOuUYYx66lRRX&E)rEP3)9l{v!>556O6L$}V<
z!87a^R)S&fN7=RHP!NK!D=FXz_rKVq?m&H!^(4fgBjsa@P&OAk5g*Dt7wcEISWBD_
z!}E6q6X+sn_%`bm6l*bHf_oMsg#={=Ijp>dGc6I6kJTR=Aju*<9hVB!G)|`lT>rG*
zC`f;?eBaMFtK&J2pw7c0ygQ@<1>>BKN1FzwVnvNqP7$qy1*5_h@Q!_kR+jRoc?SGq
z{JxW+7lNN15^J7Z(xI^H#w%zr4D2{QA-^64(RkY7aF^hqr819$Dh&J0)nAZoyF&1-
zabU-<*TrrNqR}BVUQAz?tt}CgL!E2l1uAvf84lcfuPmHW>B}MgdJ+i{=0ou5y|nb0
zT0%zg^H6VdV5IPE>DObZEyYc>50nxLqSTXLsN$DIPi_#-b7bZCe9nVgsN|LyH<56o
zgaX5zpG@C<5`RsI_1HvP)l;gzUn&)Xa!tcK%!XmhhKF_ZX#3B?6Gu6;7D0c`4NP|X
zW)?t@Msgj&*gY;Wl#hGc15b%bTqD1Z$kKd8Yh*&Nz(4*dJEJ6sK@f&ssji}U|BG$n
zUn+Lw0*phYL`z>Tf*-S@gdGZ6C<(k`p)l(RR&JTB=t*<hpm2Q_<<)N@f8<2Znb0P-
ztkJQ44;n;@f$lQL!z-C*%@m-7AV_+!4|^sl{S|x?mhYT#Mccm%{*jlVh3~{npf=a<
zYFp@$S+}-LepW;mqKfYOgmoPIW7$(@ANZlQEtaSCei{7uIF+$Ok2_A8*q~`m^cGJ@
zELX@5na&dmi;a21y~dHxIZ?*WkKiHx;zVcd5|zEDa-yZl8_fbiLE`YHfieVlSN|)H
zX7NAtLJu>K+S*K|M49C{RZ(*l(vpAmGWa<qQkb<F?Ft)>Wk%hqG6RTro$TSPHQKN*
z+MNZvJ4J|ho$bNFyD-(HeAfN=kV3?}j`q-JhZo-qLDYgBm|?`b4)@>%J}4o6l*=u+
zHb{Zo{pEu77!hFw`e&Imm%Tq^VDA3%!9up(CfPF`DYu)@=cg&mod?nZqHuXF;s90K
zh=czrJA*8SK@bXFDOEwd|HaC5huAz>bW3@}C=&i~9hTVqx)!pKX}%dO#6xMnsvzC1
z$3yeiUg7cfpI^RDtEHFX5>HJA6Pq&AQJ89RSTCj2u+IoqLCtI)8+w!uo>wx%ZV{{^
ze&19efGbm~&!%784z*ciy8>d6S<~y_b|rNi5uc3Te0qi3ePj3kgB+nUyVP?k;9c6}
znOBzoMk8`}nwg?2Q2OW(6}Jl3-2!;0!M9jU5*3ODH-=xF-n1c~PK+^(3_EWom5ePm
z`2c)|s}Ej4^trSB@*HF99TI)!WKhY|LpoSuyW804trIC_Ta>NR?X^O7x3QIFTbp!d
zGEjKfjpdhsY;1x4Kyv`IqR<?&-<7Otn}X$+h!4s}#;VMI_-I$cu-i5V%eN0d(a=Rq
zBn<gVQX;Wi?DTnloLqEZAQ#g8vI1i_+4>56#rwKO6-@tKj!FreZW2yQMk-ST_B7G|
zA-y~mY`RH2Dm`(Sbo7CwOx)wM>FD*BvU9tF7zCkUOX35y|HhWd*NP@b8el!FM!4Xx
z*j7i8w;Pz=DwTGq3`F4RV{P`agpeGHz$djEyC3^+tZRmT*AQ%KmAf^6_+xEPr>_?k
zP&6Ip+ER-RI7HL>1RD+ylMyX3P6rVpL}nklT$HfW0XnGEwk2p0c=}j6eZ+o-3MQwe
z_bbC6D_-iCIxF*XEgc3rb7lGUPt^aTXqOjfQBc79&h3{JVW$uMKZ~trUQpItC~hAv
zn-D#HsIImV1}w7DV&{C9)=DVaaSWb{Y^(^HXeWp0FM?(t4#HzOFt|Q)`DZ|4xiS9X
zmg(9!h;;0mn$SG-%J!>U9E3+Iqq~^aM^3z%jzm)q!9zA#%&ty-D4_Gk_`6RWgU6Q4
zQ_8FegQ9X}{M{+V0e&pjW+(FK>J&Xh5bdKoXdNR!2s0tX$RUIcLE49F`B945lb4Uo
zgp$KH52;|T=cm|h(P90}{>-7-tw&-u*YabhCtF;fnQ|j1X+4B$AOA$2A7y8B1ThFg
z!Iq*CgZ(#lZ|@H^8EJrVh$4{ZLIXvSR%u&RY2tol`Q0fawjlcTR|@kB(yw(ZW<c#e
z(RiTHg3VzBlB&IRC#GQP9#lWPKhy0)$CMAce#{I^-95gqbml@kxp6(R`?2P^;WO&>
z$AL2W+&6(d!#wvW{89R2Ale~h5zN=CGle~Ow<&0uobGUd89&(1*8bs|*pOxFbZ=B@
zs!iH@elqxT_i1(=m^p32Qdijb-tvc6VnY__Pc<#N-Nkm_Gu5e@q(22R<4q&47I*~f
z(le>ym^B74A9#*?w_?wk@pr$BsVU2267C{~oRrdzjKBINKzc5N7QpdQ7TW7rQ}GOA
z-6u+q&W}AnbpcoOGut0t2`3be=Z&n8@hOk5dX$z*5~Bb};Z^~d;hUWy<s0oq2IB5<
zmX=a2ehk3%dz35gVtFc&iwdCL22WwMWmHoz4s0==N#&vf2-#dWWUY2v-TbX@sbp)?
z04bv|<w&aA2wWT0RR-riCKV9QP_go(?A(qh20<X&QV@J>|BYSN`z4x;G{9s~6wGpv
z`HF=@$(iE0Bj|vL6y%e1Aq{f0y@*Qz-4TUAY;>6K_kKE-!w-TC(H%htq+*_8i67>E
z9OKgXhhr@0x|mWt#N$G&T-kniOI;<d6as;oa}sy=D9Qli@dT{_gOgGqFRCaVu^Zzb
zURkvU+#yOx|G!gTu8hCCWvrl<#y0xd*Uh%zy#&p0;}HgJktXfAOXd9WhW!OD#g2!B
z!3DzCw>G7KM5%AvB|~|K#1QrU(&ktPKhSNzFH)d)ND$Df7jf3-ifY59_17g8jkUQD
z>eGn;tcTkuLz0Jt5cS&AczO-~wL0W<Ra1^xGu^_rUBBe08|x>PdkR&Lb?g=csc?Ru
z7r)w1fn*uK^eCC|Tvsdgi}Kvr{&34!#U7J%Y|`1Ke#jTArM$B0^}I6TG;5At8M=pm
zBB4Wx1a(SY3up0CgMb^`?><=-K}wPu$ur$uKdwIe-6LfKHTypCV(3TN8RSq5f<W|2
zR@CbKFZOxnZ%}Ha>6#j>ILJ6ucmqxmJR-F}EF&m2(dU&}1;;<_#`t0AWr-}EW0d7w
z*R{*;vTfV8tuEWPZQHi3uBtBEw$WwV`p*4)@6WT7k(`laWbe#1*EQQqgrOJUeZ_NB
znTXp2?vo;lZss&Uv3;s>w07oFHf&qw<R!0!2dixJ7oiH8mk0p_i#8RT^0~yi7y<}8
z4kb^tER|L)JS6u~IwC>yGa-K^pf5>#m@>R6wD}Q&q!pV+#rbgiocx!O$2M&>FGX?4
zNOFb<3_jQJc_Pox#@k?vRW+ir1+>LtV$sLD@ZZ2$FHv(|OIs0oM(!gBd75rY^V=ZH
zmUdPXM{@{qjf&|<k(jk3+g;jmdt8(76WHxpvTnMLsEj_Fkog)JG`i0I^z(|*7wTob
zct$G}XzpW^%~2Y;D0LCs-;9TZT9i;p+;eftlOGH_!h-X2!N?YrRCxu(86X%Z9MJos
zB1l2=74}8>5@GU<IPra=BFO)ia0$cde-^E}8+~pgHPXz_bJWo7!lF1bi6S&Eh3bw)
zn)^*Cte*bs)cN0=hz3gl6HwMK)Qzp6s?1_D&a^<x`!Z2!iP-yE-VeaEKO**?0SyK?
zd5!gko=`3o`{V9g_q!YOghc}UU1bTWVYb?gGL=`?m!gPc{9QE&adJwv(tbbER<_kR
zp?n!T<yei$J8$vTCd_MVk~tz__j)ZWdXK2TW3||=cd;b0*L{1t>xyyn4`>pp?pLql
zQ$9aV&=bTHzPheJEeF|WegR*la@e-^D;jYw22kFwBOLk5bbc5T!S!;F)|H4H#Dy2E
zEv)`&#umD}uvur*5?MztIYPEz<p57ZjML9`#IW@l=9Fh=R)99mou-pCQn_V7JC@lk
z6-?}MUV#OMXsuTW2iY`;NzL9n>E{tnz<avW5DgZ&vz%5X9`kn%DJUnIz}Jg*gIEA8
zX-=r*A9ft%|2378IV3&Nzk6y$c`t{4SGhHebMDe<dw_k_!y`W)>LfTP#Jptp5i~F8
zm~@#rKJ9b*VSMmXJeViruV?q+7As}E)c#k$!2tkY=28A^2u9omdi~HW#n-d7FVBDz
zqjE9E5wP%TCx+qhh`vq|Mm?N0h=}P^zWsdg@Uix0`ecAYwT*}c=hvfPq%Z^d9EA6Q
z7t0q7rI-HAmuNx;-NO+IL1|@5C(wzlx>S`_j>Hik;)ECX4OxonDfMlA1pp>TkoG58
z|Bc08A$3%}%A;krJBli?9;V;NV@~!L?UChLyfwMvF25=ba2?!v)afWWw*J!GaMJB^
z9BnGvP5%eSt0KA`Nr_LlQ83=)O|O&afJIEK{kL}V0g?DOoiq$RiztUCxj3e~Me&Y;
zXT>4B2mDh9UI{bz=4ozmGbK8`RIv%}ql3OV7Mf0hlNc6t2PKo}?1b5#gh0IsI!-!i
z6td{hUh>GI{_Cr!;|Ns~nW1P*Q_*W4KAmSTjGoE_)GZj&Q|Lh)R{e3-iCw7)m`4+Q
z6bTEd-J|y7?|P7nRAvw#GkE-C9P3KYuyVuR8d|U7z1725pgpry3WRU-@$uow)m|p!
zLqjzAyXQ-QOmqd{P=yrH8IlV92M*5s(kNO_guo0J73_}B#Y?U*!X7ooO~VQ-`>Fef
zus1$W!_B*uiz#{sr=8N1BoyF{ZmCYoFw=PpupUQ6^inh^b|P^weX!c3q6;IEq4~c+
zA`)d8%QiS3hY2)tqNuriZs#Z4+yo?WUsih#)KmWJ6wu@R`zOpg!1hiffl#LD^?L{=
z_cW(vkc6*E83D7@y)gtWD)TS^V%(XN@#Iat@^KdoEeOVMGoMQKUu%V5>GMUecM=(i
zV6+ieeM<-02N@apeJ6uL)R-eIj4>};TVv2^Ph<-&c2bu(!2G>+E`QpVk|BAXkQhbj
z6ZVplWiRHZAUPX{pu>OeyX{7o0t!>~K`uoWp#(+;4i`Q02kmvXXmO2O(f3DrSRC%*
z!TfQeYVmD>1eYF7sk*3*;DJm|40D%MC|K}_LpI@`O5EG8uA(UWBnKgLR5g`oUufO>
zX)LOUf7zt|48yAdBGYKog$#rxXmUQuhqtaycx8KtDZzI;O}i=!{D3G6<RL;R(fW|0
z|M5o5Bv`4|O~o_;a*8_&d<kQP?5FI2XfmHTAoE^sAf*1fvcZ@@lVpg{PS(GjG_7W9
zGDAvz=!V|5x094~qL)=9le-(Q*-H`{8gRA<aAEbGZ1S>CPjhy7*!s%Q_)$p@EfRYC
zmYk3q<c?QzBp6o3%X2-Q@6uV@_${nAuVg6jAQ+(JK$pc0-mBC!%{Ne$$v<I`8b|p0
z@Tyrc5#3TDpoI?61sDPER$kU$%S=x~b<ZKtD{Jw7`~80I-U^(@fl&8|P&Oq6)jJ=+
z)*1879MFTkU1H$R%7VCW`Fvn$iJBe;F2paSWB9cEH?sbpvw~+}*8^QnvqE$9AE{UF
z>7vpnhoz$3)=vel?Gjp<9n^w>KK|;ICcLQ&LNPdt1oW9oN7LGbuR|+YxfQH5D&I?J
z^%aW8Y>L}+^Vc@L47>vYE&JCy2}_USJ~w4*Rb5e>gt>>_5Tc)!nBGe5%tyb$fT_H_
z19cz<96XA(D(|U-0v`X%v(N-g(=IXv$N)$rJFYoD{X7pEyI^TdJVchAPv1Y+?3ll~
zQP#~N4a|^~$l>z8)ErTla%GE^12xuRWB6<Oln0foZ;Dx|$zoEs`{-@uCsAwrJh<Cp
zE0jSr*WqpGz*W9$`=fX4&{AP0Cfp1X6Xyi-Km#9JF-TRV6;Jy?qq_L*=y3VJcG{z<
z(Fjwd1dYn*oFeuWA6-veD^d~^&48KmQ5qr5h+`_QwM&CSm|>xMIboiEF*FA+^{Sa{
z=^`VX#?x$EM+R=4b<%KBHU^x!{_6fG-Ie|k*bV(PYp&h;x4g=P6}N0-|5jB|+6YJp
zIX;|d#=GP<KLU+W>8$*ME{50*fSns4`}F(p28WT#-B4G?DhR_~;A<4-9gAu)gjT_n
zdm!s|Ka8%B;Da|c*BR_?;S8)R`qNcN_Q4)*NJKwNNKD`|0p_`pRqsj!g92p!*$<Dt
z5Ba$<uM<ut5qcCwJnHH9<&DfeqQGmd6*09Bo&PPJ7q|u=lwcQ1Pf7yb!&Lm#J^*h%
z9!U5fz8T^ZfK45AW)a!Mmh#eNs;~_d^8^wIDdnGQoL&hE^)6cQ3++LW_0FP@D*7jm
zFuIwDUZ^%)ZI)`qEZl9>rDm6aAcSQ%Tbw-EB53&Bd+iyiNMMd`;?KW%uOa%PU;KdN
zE?{Pk8uH{KL}H%_Q{Q`v_Uwk8tEre3Z$GB0B}d+4AR!s=4BPa?PCI86{$UXKh;u3;
zxfM%xpHP##)xPpOodo%x$_!(~y?oX*Hd(z}H8B$R5xBrFS*1MjKl}Aq!IBYj%RgTg
zn3@==Cdpjh5g3<HnN<oe^s2CII3H@=!2GfYKXywYG?=I`Ox`^>kNkvJi5mA+U8U=8
zX=Iw}k|8CYp$PAsJe#p#NmM5|hrWVc9Te-R%It4GulJLB2xwJVEPqRG8EZuox9c~V
zgnx1xB%Dv0aL+nSVHw^^LQeBhp4T*Raz9O;`AXBtkck7PyR$7DDK)EGro_gBa0~sX
zx8rU#-uEDhn=PHT1V4oQsQ{e{;f9D%dgBGB`vA{{W%;u)@g*|`AvLWwiXb1db{G_~
z9xg9yQGo|(BMq@!ZJ)egen#Z;;Cpua3xbkwpM`DihzAN-l6s<jb0NQhPXGCe0nx^K
za;>_OxlAO9Uts+ne9LR#p-l}XZYan!`oghJJCD$i!p=z2h!VLXZmVjXcm*Zr*r*TM
zC;$FJBks@jR4!9_uC1k>lHvsDKtwmkSi>X62)#ykNf9cPXskC#nPu~S+aJ?m8fA${
zLDVz!DXW@+)tweuV*y&7oe59@6#MJTVf8?Jg3^V6Q|q=@hBrLN9Z2CR8m*I2h!_Ya
z_<dX8gf#&bw6J&HC5V`N^Gn<7gmt@IOT9$yUVH=b?9?jN{Ory!PpNn)$gz56-RNY)
zK4G~eT_jRrU}9LuwDsjz8OaaJ({LSx*zSNm1Zmv|$u!->U(Cy(YFXnUibDy~yP<v>
z&kIKCqyzMMi_+Kg+3N7_ndgQEBu#Kf$DgF?+>3K<lkA!2`(cI_$oT;H4%QwwAZ6!K
znwT1(<E1wKP=Ig8>I7g4>sCzR_#7eRhr&gE(j<SKEf@^L|NS$3Rh~kM4e6xKhh}04
zGzOj5|3!W)Bg~u8E#FytM<yQZ>3*6X(y|u=_-+h-B4yB>K-XcxI`b1(eDzR>!PlTz
z&R%1X!rGsP>(<g<IhjcB&u{+cNo*WrrH;CP%x_UoDa3_AjZa~81UzRR+V8@%P0o^v
zcEeDM*N6M{?XvOvbTkL-pMs$pqmCJHPBg-wq=Fn+B+m$xl){zNz6DVP@`{wg99Zzf
z*^nN*>wdwuXJ48S<O1hH!OzAz!&{AkPjD)Hj(+{P>mQ##XSspu;QKh=%-)Y#TwVy2
zq?Fs-vd*6AUn*hl^oQv_Feb!XrBzygZi-F+Z{XO_LsL5zRJDsvUIoO19yQGe6`6nr
zrS;l8&a=W<zI2!YnX#YBiT#4?JHwaAqX@ES54csYV8W>Vng7N}fPk0K-zEba&59N1
z%l!$Q?DbH%9~@4ZoEIcQ>*rY?lVGBbEIbG?L|3YG0&q9@&f$-+q|D^t4$6%z>k}CU
zpYaWr-rnJq0;*PkRmV@0t+&Da!F>AhOcQBI174whoocgp;_(nrg%tt(c0FPJrY5E3
zt4mZPi(s@w9K}@B39D>`PmbX@6E{KSa$ZRp2y@T0S?2IsUoJd2EvHGDTN!}Za%SoP
zT}n#96Yxa!zB}Ym6u)nptK8zwZqjPNY&Ms6^7aT(HM7CQr*Q=LZ2@EJS){<Q-HJ9f
z!T)ZshQ)cP$**eDI!TUT(Fq66DX;7>*6c$m3-jK%*2-qB*pq}xc+Z-z$FD|G<|4G1
zys4cSD3S;01oCUW^<=W?&kIeOh<u;(0l<R0;0g|M_9TJn6z&73g}j{6CkRBrU`-s-
zY*tz!8Z@BJpIIb)qrU`bZg*O3_H!<gHM-KAp9n+u_h5yBV=b4|^Df;Hg3JkVeefcF
zlY5nD&Oqvc=!;*yxtok25h35Es}xoc2RC++V5WK;<D%M>VxIhE#QFeC)A&M&L5%HW
z1oO*)jNqOx3MUQ;(3!XiWJc1+X5I_=HRfcazxK<NK3-PpIwtH}@qjQA1%#CGD(2TK
z)wjTKWA$>jsMNlTI_l6}`B;K5ejs)90uSh)mwf>@(|mDD$y?b|NAz5UTZXBCL6yC5
z3)}$H77^_P*3_Wza+)>DdI`tOEaR;d@Y24*W-x7DeJvQHh?-UJD>zn{JcH~a6aWPY
z&K77S6(l_F#`sJlb_f4gf}?`TZ@~T}pIuE>4raf+Tm4d-Cj<v&uETe0s6o1%AxKd7
z0SO7iR8b9Ox~Ql<wXMHSoumUr%HKdS%;hwR&!bf7s+dn5a@x_W*wMS)?7bHCW&C$B
z%3oMcz0kpI9r&O-0I`w(y7m;nn=~9vOCLHi6(<Z7%3q92zj>G~%_k5Fwq`@53l%6{
z2RR3|z>Ptq=k^3uZXZxTg;-&G@<S^a=X>hj$NFYf?!!m*pw#P+XW^0OC4uKW-Rx?$
zM4vGamY*MQqW%A?EC5>A0LTT_p}TJk?Yxg=6lO9ELUd}&0$cd*A`v#oI|zP}t)=k1
zCQop`^L9pvRn{RXZrhr}1aD}+stpC7Xz_bt@Qztmi_c{Wm60uM9jl!raSuzW*a4bT
z=d79a121u{G5)p8GxvPi!XqLvFA3#M@vX&@usyU_D%t|U+|}1UAH5WcS=k?r)<;e%
zkQ+p)YH}&kt{{X|$fbF%F9IwF?bb_VUQ~R=^2L5A^TXgYybV8rfQ7@uX&99w#MAbC
z$10Ftp^!@?!<RcGIfPHCxtGYysKkhaCUC#>%_WlcyVDEyF)$+LMZ)HuZy!H@7ZfH1
zu3Rq*pX%HG_s7zqa3WTJMQ<$p8NDQx=mdie{na9s4V!c%n8ekn8yGqO9`!0(gw<)W
zentZ<ybm1u7pijKQ6Hm;UBdc%A7TGU6UZAU5lY<c-t*cB9J;Cnf&0%(tM^k4`aT(H
z#XtU?veA=>l{_T0?hsG_<)ZDsVh)rZRncoZAd`H?PfAjnzE7)ST`AnG8EARL(EE4C
zizsG&5f)zioiFu~-Q`m!^&dzosYpR{kfP1C-{~8P-(D@ibbKTWIiO?cJE*#AwQ6&g
z6^|*B&g6vm0ja=hUW<c!^(tpj0_~PjrwPOTJhvW?G4jqa1X(-*RDoAJq#9IwWJ|aQ
z;nhLJ1(g_J0mW-KmRRt&b)Xf9@z}G(BYBCIldc!R?3_G!BqGrk3TG|Tur5kkoPV>9
zBG}`@zOs<kYXpbcWsA|!+(WQA^^s#9iLy~nn-JRMO2%!6H_=K-i-AoaK<?@U4INox
zHIE#&2)Nd5nkUtChdV_ZV{=9F@>9~JCY}|f&f=!8FWbmoNN-0gmNQ|Hl-0j_)A)t0
z&89x$LPYCzCITp<sv4M2?}<85Dp<SqrOuq#W=6gekyrgYlmeH_#y!0(1oVxNRb61O
z4Tw3FGiKo{N!y900D>4NgQ7NQZ}t}$(D+^ypNMqZDLgr|?T_S_l3VNlr?4dz)IR_B
z+zYS+ugm=fveXhNW9|ujqNF}a#waNmxvUq$h0)&h0$Ppb82;h)Z~)=UW?lw#XSgXf
z^)Zi*Vs~)|*Knc;M!9~tgsBG{sBPb5VF(+=z`of0!=>pPA-WlwBFiok48!5w<0$=s
z8^W4$p+sY6FUnCMQX-7izCsfo9-B=PYEK|HXGU9UM|%<P?l~xDQ2w_my&;LVz<Eot
zTO5QJOWiWvL-F+vV!mY+ZJz?a=fRPWT$J8b`Snq2F(%m#eRvf;STbd)YZ$A2hhOu}
zt_W1Rq3_Eh5v8^hnVq%eT0|3jU~6g-4P)U`)dmdBkFm|f>YN+BPdiTYE72#Km49Oq
z*Po!2=6r%Dz-9m_tWDEinGCumT~k?o2e{>cwse!(+5T|!O`aNN?8Be2`R0-ROosI@
zkxHO{vdunEW&-kGmR~A#f8lv)m?_u%JHAZWPyNbl%$=?|WvBrIHmS-%Zw)gWKZ72>
zKTjwh;R#hJ5ZtqE8*M{2{M4%fF?j#y3I4q#3`pBKdNSsq1Xv*vMbIE~W_*Ix4d#S_
zoI(Vy<;HTU08=}y&j_~N81flo@4e|R6<P-JnSh>tf(rLxt9TnnA_4!AQ7RRvlA5Ga
zW~jp=G7yZK{=gXiUALbhOg5md=I@0&>Lq4q5=Ev{WV=h9bVMz5AR$PRkh<?+-kWR%
ztpOgIf6T`R5fqo~dfIaiQxkR1-;>*Y#Psc2{;)%Zp*8TE1ZLa~?dHsKS#h^hZ}>Yu
z5s7X{UV?YAc=Pe0`9`qXptaz}8A^vY4+z|2cX!xNQkr#7<og%pn#06okh;P0oaz2Z
z^G~FTR8h%F4Oq1}?$2vC$?X@I(m@E5HQHsfhj(F?;c+>B<Dm0Po|Rf4QgmB-M$~A2
zE_u;-_S{c0a;5;3(Z=>F$xqfVqFUBc%`t%`%KppO?`qb>#wHj^%~JtAX@{HzSc0)3
z8LnU72^nJ7qw(+v3sFyJvUc7yzk-fI%)8?X=b7Mnn!oqU6TbmT<#w21LO|`xKmsrN
zH9GG~N<4|0Kw?AeHwU5&SF?jRL!+pdCa$Rx6QEJu0#0bsI5z(r7uVxN1*}O?<yyu$
z5DzuC4&lT{zMxA8fMG7L`FQA78Ud^&An+N42PRyB;?0v|W`+Tl83n;F9a--F<~xkg
z#MtGA(zOe04FQbO2&pS1{IYT0_uCTzEDM34C&z5w?FzZ|S0t>@4v4k*cBbH*ij>6j
z#667ICCT^#BA;8ZiMj{UP`6ddkIdhV9InE0_^z>K%ogspiKdDnte9Sn?Cd%tr~$gh
z&GGqysypl8_SwsZNkk3SmrsrTf3pYPK^kMzbA%f%2=2<84qVjSv~5@@sUSMVPvZy5
z446=RJk~{3u%J4{&k?$D{n%ht7xm5~4>59wkQgH{hD)&*Y1~NPHA(ihl6ZmrWInp>
zg0A5L0cS(N1f+i-ym2+6^fSCe)q+1<p9Om;`CZ1ikI$Y%<wzq?RX^dNA7MB>RWR$g
zUjdj3bdZ6FVMW?mRI>oD*K>jett!jc{U|FKiB7@G)>;0KZ7K1Gt5V18FN#oCjMei&
z+o|E|3%PS`lkYLbZPRx|%YXS${mJV`qLrly*Ua7K9dY1M`EGEu#Sr8@a4x#MZzoN;
zt1iKogY&m9d^F$Yr^D)yec<lhLSDaSc&JJ`Jzf!#<+7l1veD6JC8=k>8-GuX$PQ)t
zR`6DTnQMJQCzrw?MnqmC-%%;6y5HRrbj+lL=;$z+AH^6v91?746b#$?*OT1KSWBx+
z(?LFfTyUIfHTl}QQsO_cbV&2<c!Dqz3HCVV`#{3VNNb;^1w+Rc)~M%=pezsG3!I4a
z<yN~P*NSswI>{KEjTdZ-Z40;@c_A$tI<t7O-llYIko2Va4@|7qUst`fkqzpl*M5YP
zrN+n&!|u+S$|&Euu6OviTaaYew6d#fJt^@O2e{b8${55I0{{MCvSNHpfl}VJRdl#E
zrukDWwS-Pa_1#f%qhBrnsm@|48IGC`=ilw46`+@rtNEXN2VS2N0K4;JBvO7X5koZ&
zT!9+ZF4*h8-VOQXF@d&C;b!D{f!uw38nSc>S*5M1TSM2%_OL2c*gAk^sY8>Fwo60x
z*r6xn6JKliR}#e_Io@VhdsF2&MA1UhSyc?*ipyIj?4mAt1|xt}IE=sl8^j|K&Rdrv
zv%Y*A)E83#x=6~^<b80PiPkgL?m1u~%^ZImap5V7$#R;)jYitLBaY;NK!D#|-UZ5+
z5*C$-*M&fHcP2#<B*Xx?R9&n+KqniFOhkHB5jZ4jQBZ8dKszqomE9S#q!6k?2^zi%
za(=Y~#G6!1W>o{s#oLZ$SD~O;b@ha2d~U&&9;ApkDNI%$F7%N_-p2oxY%YM?9pAO#
zq5RL|)cX#D^EK@)chrr|_Q@BSxWovJbHqDtOSv_&eA0U69YUMN+R&5Im&F)P_<P%N
z8yu5v@Hs}C-JZBtV5WnK*UyR2Lo`yco+qKH;zi=smBWP3tIgvU@2}^_th(jsr2ew%
zsc?m;zX16T3y%pgNU?zoynFE*2iDu4(yRpdcz_Y<u@PaLp&AF6R8D!%#WhYpV|b0%
zkfga{=1NXYdCMhrxl_#p?jj*x;Bp(CZxM!Tk|E5DXKTNd67_R(&%ddOR>4`x`fIZ#
zF(34R`jv~}+tYdDWyP>qx^ya-VfImr`LiXS6^jH<Co6b_UCdnlZbZ1D<F?R9gfxIb
z8fLaG`X-%F)RtCgDt@39eAY!<4}nyNn=L!E1~pqxjQ?b)IuNWa&TLWo$f#F0l;3=a
zMS_+d?=qwp{gp)~Y_3iZ)<lB8FE-q*KonFFW*+bx%q3D9w_B0rqcGp7<$@UU-+QpU
zwH6vg&q7jv%S937yGF(9ySzuPP++;1Vmv5vnfC{W4`Us}0l*tWqbEFRjV9eKp9-n#
z9|lriTSE%{Dv#2OgasTe#;odUJNYLebYxduu&q~;dMEq#q{Z73QF{Q01Wi52PT-3E
zo#`eIcF0Vo9%zo~dc8UC?0^>y3YgAFVTVu4(+}VPPWqpg%^H+7^~KQ2`%+DknFOn-
z0!M9e@+5UgK&7<aZ^VP;zTPEIn)*s-Dq3foNT+a$-3V)N)CgXGyQdo}^t0=gP3Jt{
zh*O~*33)>e7bL;K$Q7?SiCi7a`|7Rscp8HyfIb3;R7R#*$r>S2Z);rhR3WVQq->Lu
zYVkmiZ*WPC`EvW4@*7j4P(Qh-qX2$ty#i@ejBwneR6tcz@n`6*PlXh%$5ORMG~0a{
zOsom#{()?`BdJ=7hAo^L`n;Lt3_)ITvpfZ6V&^yFQaXO`zJeE7n}eDa+;2ow3HX4g
zH4Zb`u<<d?e}^BS;4M1y3DGM5+BvTGX=?X_!9y(dSVi1vr`#wA?zN%QZV<2)RoSf2
zT2c77yWj_V%gp#Sy&8Wluyb5^*Q#!agaY4zvHleWa=f5>TP}sSJ0IiXZ|E_8zGHue
zjE9Nb6~hFZwiHGV7w4EI{&}T%s%-w1JxRTlzI>v2`x0}iVh%?Jh-u(%yx2*`i@pNH
z)J`T+0%X&)rTf1>vA>30m_awh{oa!?yEk~F20!A~G?HV}N{HzuSl~0u5TgmUSGbR=
ztDn^OmK$y)hp1Sc`;c+Gk48AkOcRuMnv;lh_`_0(#<a-_UlPI<M^R2F4)kZ8)^rd_
z-2e*&>#zexza~+SH_VmHRKhf&-_zW?%=O<!pG^#E5q;byCjr070!xEQkeuLRc_T`#
zTb){#sIKL$^}WF|;|&*uxC?T5<Ugm$k+`#ZY@!cDniDosk+;_xT5>JGG5|aL@o5$`
zfElIOAHFx;Ud+UQB*g~yWm#==)sI`$Q$i<cbcvCxf~>WRY<M*c6~4DibSS3{>XvB@
zQT%ieCQAB83TD4C=_p+uX7K4CO>{5B37z#K@Kr7Ftr_p(AWu1T8n}o?-uP*n?wN)d
zL(t4EU@e_M+iSy{D$v;-h1P#(%uN@hGhgWkLt#9Pv6!CPX;X_^&KnkbknK8$kT>No
zu(-eeP!l86la`8LQ;b~rW&AF)arnDZO5zyzHi+N=V2Ou~8zzJjYcm1<1DK@`9Fs6A
zTN8gFid-NtoZy=u-(6--I&4v^X(#DEj#*l#!RCT_5gdzPgB8FE1i}U*Xl^QyitepG
z&jHGtBZ!19U*}y^Qle0w=j(!~#P6aY3i9hJ3c~&+raMgQp-6^CNN(w|Nu(fS>L-X{
zs#Yxli^Cm`&uNGR`ne(+`~6y>VdmYm_C2PjE=LW5f7eehYK_5lc#_CKcGXA0g+GE;
zKr^v7gK|Q?CC9rool@uqIt>bGd%gpZxO=#070c%42N%C9aOCSkZeNev1=pJ%QxVGi
z1-@(08<C3+vIjww@Kf%NHL~fiq>zOUvW-DZb+YW=?4dh1rS{^9c(P0dbjo-%_2nyb
z>=uX;g=QZTWl%W;kK_O?LDWcHU0i&K<Y0qufmvr^It)Y|U8SDf8@e@50@xVVn7-zX
zyUkbc<sT;(?rJO7u*(<B1SB?|GVuA~!?drZI#f7zO?X@}YpGpL)%pS+lQn;`@J9UP
z#uZ@xn;8zd;er7YDsa5<$v4Iai(cqJy>zM^2PH8PMDT8o`bS>4&~-UWM(9%)Xj*uv
zgUMfaD(_Omevws%vfg$RKzN-yeWIu%c=CRy^X!esl9ZFp?Pv_naMRAeo<So)s|rb0
zpGXNbx=QpXJaiH#dZLEVp=GR+%cNyTDJV%ZMPii*dpMf=3iNxtXL!l)Vu2Qt!QVAj
zOsyU_4HUc+wa~1-AgjsMFYp(5-|(Z0@0$`F@V8&l`#;-AVSXigLmY~XGIFixfjd&p
zh-Q9-p*n0LR~7YWb$;CNZ&2b{W~Q~m9>)haI|B`aNb7|<9^sD=%#~9-P;McH`M}dn
zvW@L^Q%o=D{&;?)$*L;1%`#f|l;{oUet3p60CKT;?s`IYsr|D{crSdsRcra#XnBR7
zOC!<pK>c8GPOaOwg1z<Nf_wd-#3+=BrtzJPvLlWHm*V=rVq>tTF_$wG>`793D6yo)
z{bFNLzfyMH_BE>$27B6;(^E_WiIPmx)0E(crkk|?WQ@ZIAxtPeOPLrOK*)udTo0Jj
zN(az|(JwELrH8BK%|kv%fnv9JAs8=qZSFN!+Z=+fpd0JJpY3RL$LP+wnybhvB<R=n
z#5&*0qkpsBNyB`}XMAEN;fb0<Bk<n3nwu<wZZZa{^<=l6&CddzO>b-B`%r9iuTI*k
z@pSJUP3@3W#h#x*W<#06CM*5**2&MJ@J;u>HO>yO%}0B|4b<5`jFS9lEw@1O;?%7L
zZYFjt@nj*n6g9BZByLKB4b;uP_dL7iyq|^iwZOvElF|wVls?3D3`l*&UDbRxtsK`<
zzj`>cGG>9Mt7r#ngN@XmKa7CX{9i6JLJOPzXk0Fobw~em!ahOiTALiscR$K_DayQt
z>hIzf&b6Tv@%J!jAjSvexkf$5wJrQ1y(&zN{ZlSB*TTYaJ-2q0_5~Z#JvUT#N!?V1
z&Y+ujDIF8rP7<yGv3?@ASy(!$@{XN3?lj?K_Ak23B09CM<{}Vp1W`d}#m-#xdxGVs
z^fJbY@_&8IAs|oR7~XjNddf9ndId}xj`LSF)tA0}slC&<fm{}l{yECL&g(gRp@-}v
zPZAvCXf;xD+tRajw9g}|WRk^*iq9Sn%#zM`J@^+^C>RNWQU%bhRj7cr!P;_^el{C|
zeG=t9&RVLnzaA>H6V-oS?hen{&TnJ99(wXxc@adNjBpp4HwdbmOie(jgMPsqk$U+l
zpWDj3Dw}m*K9a*4qdrQDcfW<yKmA_C7E^TK4uVyvY@^$kx%%4=6MZ8Ex}G^uHn|3O
z@#}PbsC}aB$z}*}?6rJpx2xsG7uB+h$CBsKDi1lH6wFe2?g_r5ipPsAn<awd47nH<
zVZZR)q(nQM$CIA%(*}1wuU;^3Tj>tZa|IGmC$WPkx7gx|8<_>(#biyAv9+9lAo}q!
z_WWBmSXQz73r<k*=v-ynym#ZL8rzWogGwij4__&tA@zL;SX@c*^WY7v>0^|hKF!E&
zaYVk^$PUzf-S0Sn8S*3zU_k;z16K<D0=VKAj$zp}{{p2F^DBnuo!AzdqDJ(M?<J-I
zBsFNI`dV{~165L1nHmuu;dl&&lm3@Ki!fvA<%4TCQg=al><!>YLWyOu?|h>181*NO
z&hYevS4F+f#^I{Oj~;hU_<1|kb9ZW^2E0*UiK*jl=zN)Ur0V;*)ph1KPzSo?Oz}o}
zDmI<6Q!{CCLH>tba&iYre@sw=f4hCbAz^mP8sX>B*4JR-2Gr?d3?jzrlC#bJs%~&(
z$)<a8?M^){oS6ITCscbBWK&XNw^9Rju8aF_UV&`mjw#t$+<t>Ke`$kV{rmM`xy$yw
z*sFrrrH`PMRjl9ZK&0z?Sd#11LZF7U6>fu|1-kuukjSNrQz#yd+-0`NH`O*<6zrN_
zevSm=91M2Dk!(4+kAUDxpC%cEe;}XYCXR&2s*96LVPy9Yl>2h)!R4`0iK?>`{w8JV
zp<&9?T+TP-w`7ETSs-`&l3Mq3ai9Hq1<H;&lpd2W81AXW4q#~{14ub4+)D!s9{IAj
zIjwx_mk_VI=1BcV9_1u2aw?i?X38Ap@wS9X1olVVo|vH7F!6d20u&}0KP+{->amO&
z*)nxX%fc2&@7g+=R3xU2d7b8r%t>~5xsi*kB;pQziPuI?r>u87zUE@t5#r2FX!0Pm
z!9O%Y@lUHOo7~+N9i?Y`xw+~ikD{wRwgpyBCpc03m@%Ag>-kgsnA~3cs<AAjdrsEB
z?2ahgcQLHAPO-9Cl2n3<Fv#AZogsd69%f&kM)A5W%othd_Oebhd|rH#Lg~HX;10b_
z-OG5$c!Cm%M+QAW``_9n1eJW3oJw~J))HklqwPjhs~P1T`@Rp5kt?O*!K}@r|7m=V
ztTAJEi2e4iJ@4lM{WBL?qYj->FQ%lv;pKLg0&|Q9Y!p6190G`EyP_nYd%wUvG9Ga$
zOM>RzafM>t`tMg`tDq)GBYx(zelnZQxk<LcsJ4QueSeb}GW54X4#!z8=mGp%To{-u
zu1&X-xQbVRXu&uRa31xmJ0V&81qj)<3MTGZ?m#DU)ojFX%<#TrD+Dy|wCrJY`4HbH
z3IuHU)4w!?Oa}QseX!qd+%3M~F(|M~aH{w~A7lH6w1Z#UVWYO;qitmU&|%Q*7dW+{
z@)<sgwc+~925z_Hu;FGO+5)SCi0s?lJ*hmMj=gGi&Lf7M*F;8eEMPF~DaOjvK7=<j
zz1C~%-6wAUU6H;OkRpynL9Xc5S%?=p+_@F`q@~$~g*y!AA`zj|?YJGNh6%3)+ouJ2
zR^YO<d+>DnDxL^2RDu!fug=ZM8g5@*zG`OhJAecn<MCs1V>WbNp=)T%rTmS;C$#m+
zpiP<Ds9hsTl{TwT9S^xJ0lHZU;I~(D*JFeq?ZFMZwKJccomn)s8ib+pqEOdRB$mgq
zntZ5e#oc)OZc@DUSah55;ib^#&j9h%6JY_7$4Lb0mp+9FF86)iQ2uZ8)D#|+Z@f~>
z<G!T|a$TSg(58^O+tDeU)(=X?cRGL$>_!MyXu(hqk`FTi_(BekpNb%DX6?IffYw8s
z`5J<+^M2*E1_jTvnnmW)Gt2OPzF8YFsB<EF`Gw}vHN~iEX=xO?nIpMXG5Wvll{OmY
zoYSC0=_O(^meAz-!6G~G^Pq5=$`dri^cg;HPwXg7<jXHf6otLzWEno01H#zXzXBAK
zCp(a{_2e^VPxs&z(R5A87Ft2d(ov3C80|Ky18wI>cge6QD44;jVGY65<+91)ieT9F
z4o`=hb;k$X0-IeolPO@$rG_FQ%qb=GjTCKrU%Wq5j20%>pASs7BhMj6x2}uWs5QKx
z1qoE&oJ6YacJ26~zYc~;gjUW`(IuzCd*0DHi<($LOx&~2C+|C!_9^d9k8Iu=iS4Sh
zsSR*<iLNE)dyfxo-VM>Gzd7IzzbV4#i$O}#n~%bC<_75Z`c6zKQo_FPHUcFW8&=#7
z$itg;`)TgaFJCRy^c~fVzJniv^Gv!(8(5J=FfEY1qh#7iPskEWFK*-j8if$te;NfE
z+GTH}@q@bs^8%1D?tFQm?@uy)3nM!H=Z7057VTHY{^6nK0C@^l^%E-{RVG`oZ)9eE
z#@F5c@{xYSiJv&E<(R@Xmz;z0lZ;L$^cTO=HeqT;l3P|buaY(o93M&8H;q3dW)=PD
zTP78K`y=`D=o%R>(Y;KA2y1w?iF&{OYEc;JaOA*^8gq>Nb~lX{^XW$+k=)0iNwG|q
zntpY-s5EpD&@)vZK23@>ki)1keQ5-1&$hfD3Z*;7&NzJWtVNOF3zbKJYgN*hU}=xt
zw&+hrc0%<+1DC|ia@6eG^4{(VIgnq);7w1p`{!6K?gCYDC&)i@+K$I3%d-cWgN5w9
z8x|BqfkAh@SCicMg~cpcDhAkft1dh`4Dq_s(Jef4GSD@G#5+)vI@K*#oqgNf)+FM~
zcty03#qB1`x^iD9cs|^uAixOv(4Q;IkiKFag?W~L^vr%bOK<eX#O<~%*>eOB_xY76
zeQ;1rli<^V`cxRWpZ}RrFBzeP=jq76m7aSWM;&)0lop|J446yMgVLRQgFcvZ2k}a>
zNu&jCX-bFs?eox}TlAfCbEa>;sUHt6WCsX&k^ZiaPL09mfK>|KW}iHvs0r@(z16uU
zAOrP!x&@8iZl%^MS>6x}n3L4z?Rg=ECn1^getn1k4%}_4f$OLx`pO96;K|Keu%WRI
zZWsmNvg3c&to%b2cYTPk8bs&z<NRF+>ZG9+cazwmupZ6#a;Y+QagEfq{)*w6kk7bY
zbs_j+yx%p_75WhmM{%SN`Y(OllGDWIkS)!I5@g83#`_I^tXIny#x~Qa%W8PsHIL+?
zoJ~AYzsA>?VA-ayTBwQOB)<->pOv;)?5F^xPqEew&aMl`ODo@>vcto7_eeB$!ISmV
zBsM>E4#s9!xTE=^y-C!0?^J=*MmNxBQM0qH?xD4Jnu0RM6cyo(;wK$#UbU)8JGg77
z2p7ZvkWs#;YuzxV1Nv=ZR7=OGqUFiA-{dm4uG%ibHPo@3oG<^ihuHjwbV-9F)wu%P
zg*yaNdtp#GV>sF-T9apD7&p`fy1NhvJ{kpH>z5bU(b6N2%Zk@+AgJ>dneWrr4+YOs
zO~$-eUbI;{P0x&#namO?MuZc$KrmB*I={xR_)Q_}A(SINw~zFwh6Z2vPk3dLJj-YF
zSZzx8nW?!2#x_A@r@n*I3*)K^4z#^LBrJA;M2B3j951p^#PTOmmkW=bn}PVGv}z{$
zX-qN1VkPG;Bed5a@3!|yR_~8b(Xw0fjBV}LGIK^8Zg)(JZBY+)L=o**lhxTr5hs2I
zgsFEW;6$Y32h;nR`JoM>n-A7*h@yx<$Qpt0{t%s9;;xX|uSC*7OwId8iy^bkJ%I9b
z5~&psEd-D3@<|st-YX)OFb1e^bS{ge6WWuCgy|Ns0F=ByJ^rMzhnUS=+E}}o7vd*2
zDb6+&bu2+_Z=QP@WMqY>QzMzhVQ#Olgz*-$K!hQqUTs$rw%0SvpHgPKNFveolhnbS
zS-(}8pIN|~)a^f8{Ct|M;?g&ccH9S<l{mHmvncoxzx@1cq~n~H_I9Y9u*19VBC@4F
zF8`Pth11d?d$|oO2q~#i9Xz24fn6t*N%2!|G-`VY>C|$6FqrY_%qI-)`|%Yiv0>dm
zLLb?*OM}Ea#n!V_66rl^`2KQNgKlIrf6(xC2!Ru_*>5N{ru@cOWV1AxQ_1|KTrLnZ
zqrbpbYES}K<gcE!oMMCp_Q4FaV_9R~Sl>Bml^*QXRzOBtSk!D6bnL{Sb<N}n%z{^H
zbYQw;3-w0+ho%EWga|o5*X4h^vu9X{LF!l}BmP35D#mRky_36@ob$vaEEixnGzj<a
z`971sN~j&fylW7o1NW#~uxC#bRL;PYm=Mf77>BE8UX*>oLEBWLfH%=F3%F*;*FSV6
z^t5uvB*euAlYa$ceR{#hQ`%g>AxRH<?9(Bhrc|qSLw_ft32<TQ_+>Dl>C6sDr$tP)
zrd^t^CNVb5KJ8DN@o5W7Z)!~#87dZ{{Y$bP?bK%yn5ZKhH$)8Uw&3A3NaU^f`5BPT
zi6Y8;-3TrR9ZC~Qvm4m8xAr(Qq3^7s&so}t8tn|3B@F08Px6Y_IZ;><#GvTk5%t%|
zzFjyYPq5Q%Rjmfd9+qAth+)zXj)?(w?6gG~uStnd;*UT7#D!HPuyb#9z2}wNXahM^
z!5rCI!wm%+JPl`{!a*BznAZuEqiu(JU_Cp^mb&jIaR(%*2WpCVV<2L${eIZ*SOksT
zKxmX1O%=?QgDRupeB`Knj9WpHAv@q?bVE=eow4;od-XGKYps%=Yfcn7jXQhDv*2a~
z4@q%tE5e<d>yN+5p9cqIgY$U9#pGJLkT~GxvJ&4%Y@kNAWVXn##%D<MSDI25-bXGW
zN8(aWLIk4uU9Qf>&(%!sL6g-wc|DJEVtedNA@Jn%48nPY3QrsAa=g1?z8Z-8mrD>=
z$J=!dGHlf^nfEG2nH0{<B1En(pV?Pasm^S`W)gCa<&YI?(AG}-mts8FL5w3{ov`Bh
z;<<i4kJ<i|BFYlN;V~blrj}*G1^V?r3IMuBh6Mj(PEm1Iy!2{Va43n&tW*|}n-CLZ
zj}E`DGhH;43q~$Ae@h6lZwD^n61hyuB6u;mxCygNzHy6_;+Q#qUp;r86+^1&Dz2<{
z6uHLnAecilNJMNgR|o0A>Ebp#TRaV!vjz|*)qIGi*neJvpkS~K10TgPo|D7Fq>_Z#
zH^LB3qhtsk4l}|eTwM)+9-UnkF(lMO<ygdm|KXa6Jme7v6|G=rtGRFt_nGh%5QbK;
z9(iEB=5m^UeZ6{Lf=bbjfr9EiSC>TK$4+n^y()|;$);s@T)^%!qy%rFJ5eJBnN8D#
zel$A0FCaHwen*1|i@IjG81=S7-`AX^{qbaS@l;fiD`SF*D})#7T(#VjfLdgh@zaCL
zMJSfq8*KL|%n_<JU8qXzqU8fiNfSE+H5CY^)po#B>{2BZPD!%^!GG3kTG0Ww#>@%R
zg`%SSLcb%%l98)MNB3S3gv06Nf0W^bQ~==m$^Prtzm);T82AxjZz)HLHB~=KKw%3u
zRLZ{gW>|x}1opxnfKvSM*@Tea$cP)xQ(1PNfF={!D{O*V$^#kCh-GnEdamDeH9o!d
zXCcI6tKbSNVY&x&IBtUTMdpc@EU%HbFjcgzp^t#7<fKLzgKs<GL1hd#F{hz~LZPDZ
zz;kKaL~yuM!bLXou>?yViucO~z6OBR1`0KDW=}buh~(id`uoa?t<YTLR|6g?@xqtY
zep@8(w<az(^N1Wd)>-s|Sn&RiPTLH1Sg|7;rwSKT`(`OQ?EQkYdvslGx@_jrTlVa!
ztV;tfVYlcN$g$q#{@g~swyeg#5L;bCVQ|6*(U!)t6vqi=iN_=a5}sZg^d>P{9X>Y}
zB2UywDZy5~I+{Ov@(RfN2BbiWng^~dOoI;4+5F-4anzO6XDgg}7#usL6IoKZZ?Tpc
z%>3=Egl5;iWc+lf;PsZucvx+)#RNdGpS{lh0CEvLK$jM6I|RiA#K6-pe(UtJn}U`w
zp@E09xIe-LW7zIS?7`-m!lfBN){o>F-4<Qdkw}jK=L7$V4Ef;#9Um^6Ddg)wmC09I
zg0p0DIzHUE{3{7&jFPqPDNek`bU*1d#dn4lN1zxkoc!mB?)5?cpF|GTHgS0nz4$)k
zY@g%)9AE6ALx(@?$qE7%8~A7_%1MHnko!Ox2Hd;K<*1nBM$RPCHgmGA6!(_YC8GIh
zyTe9K=R4l=`88S8pk=nvVNvgvf{LsTC!Kuxxwm5|-Piu@K-T`h0U5`>Yg~!vac5q*
zp3=4USCoSkg~U7zL;p33-pb!@4S$Bp^WjV|<lRJOhh!9C-ivaMi&=)WE;aH7gx8|>
zq$SK{%J2BIi24RR9jDo{Y^@8UHR_RMHdGKbM2}+U@ar|+$e-^Tg;EUv2!Db-G`X0h
z#}<aFmoqf#^MBbsl*ZXR4i}!+7@wZDJt<udn9kL&g|G`u%<Mq{LJ)$e{?@@}_!~)l
zpzz5cXF$4AjK%SZ_$rb^x1NDYdlmap4({KWS6bUNb8)Rwn~?`2^a=;>z)7iXrXWvN
z8V{R#d#`r3nWkO8%P}?5)9!Ua?6~}%k;U5W@(Wx)yEh>0da;#{fjj@*TY8b`Q;8_~
zb!c(Hn-$b;<+7CE9H*I+1HyjoM)va(j!ef^CzB<@)F9gF$syvid|E-29my%R=4!IO
z6+s|P;&>1TtX+fjZ;nI1Q)Nv(HV(V19HG8tx7=t+Unbe|aF;hv>%@G}9Yne2x&<LM
z(>`KHPlw=8=tW#*g+48)$BK2Sz32YAT-|<HnZ2wJ?&WuJVVO&xTJEg(EEHNB&fCv$
z;$Y7b>F)@^ojV)|q)OiPmR58kmhiDclCr)=Y(}2LjyFX;CL~)b9x9I-h+^5{`z3?l
zj_Vt_@|m7e@?VU9q9bJScFMgM%jnqGZC>mJ8v$3DQUY+5i`1>OZ6E*V(!%M_sDx!q
zjw=I-9`(QdYHbvY7J_NF!-CdFTdG<w#Ubfem>xg@t7V<lqz38X<fiIMLR~wOmnu<-
zF2VIVKzLLS2J>uKq^eMfuE15Kw!Y{yiIn-Edq0}Jsbg&iP9aqkS!Gd<sw2g26_8uf
zDikI`_tQa;rn{4zrgxY77r$}rNc9*w=c6TGPNfenXayXhLTK|rWVWd}&B`45&+@=+
zk<=4csJH7eJX${9)1Y>oLr!TldsNKGVk6=loHPqbPD_Z2O$90o9g*YdBP?CIJ{<-S
zEUh&kVqkB{fck3%YoF=nZ)>7t3i=eCYo-*FI`87FhP+K#iLkN1rTJ}cKmX6=gXxE8
zR9%JQZ7VArF`iA1wc`hTxqQ`JaAzs)I|U22F}{Wu^65g+pQDE;U!%F28qDdL%(4V}
z+q6^ldjb!F0<Z1r713D%aRJ{9z(uA5q&<ZcX%j~w0pe|rHNNIS<*97~G$>~s81(Px
zs7LBnq{2>8N!5kV2MeOp+9}L2UCtV+sA4%^Ss#9gYa0}1*ocK1n`#ktxCaxT#b1Nn
zZXn50gdboIm3?ovo)Bz$N#E+I3q3VM+-SG;frcE+YZB8cXis1yMbesJ6Yh?(W`H1S
z=j5`$E`sk+{ih$bctU7u5rwlvFCK`MfLP@+4bHA&AN}o@ONP6825%@X^Kqpfb-6qg
z#6?2mobRb$3|LdKmqb;JMN{(iIHXE)FU{281@NcL(ok_<+-VupABXr#@hbn8qP>eI
z2Yi_dA+M)B$2zug3=qWO$2c`=scFIs!ipk@|D`tnQF#oscg-XPYx#zsEk?GblN~+{
z6ElwI?Vb`VBl8l8R$;O+v{K<|VLxDesX+VRz%PMKKA{VYt{zP`vLKO8;(@uzmrYPF
zYdny!OGRn0a5u5R$MXpS-jWQ6*}mCoK+q)_z<tPgDKiZc^5bvw4=YwRt>}Hhc&Usw
zj%h}qhjIMxRoXotM{AXXz{HVT@uADaA>(0#c9fzern#AnXxK12Gm_@$;}c)1)Bq<_
zcKQ}<-vA*(E0&)$nIY>;yL1rWSiDf$q}d}ACGm)#I%hD%E_4Tj%%?R<t{@T<_Xd<~
zzIW)lUCoKw%o@VTsd=!#+OHiA_#*#w)Ufb)DdylA)A@qy&~KM+y8V=H!&4WPO0DYw
zE<tCq7qO<B7{G{OcF7c+v6b`D9&g8?4HcV}KiUTuu<d11WhBLK!DbBoaPVNqYvfFh
zK=@q&S?(`A3s%W(tF`K}czuCMLlEfS!%PbN9MRyx$!2VDUeMNyW~E*!(_ID`FAYcJ
zL(6o1WA2rTH1(B+bIEuxqJ;?yHnPdCGHGIjs&m=K$q*2fnwbr79lwjdEYd(~ZPg%Q
zsMaavP*_!|*e)=ZFq|z$V3^>wGV}`o&ccLY#{X7+WJ;HScL>d{9PCC{!)cn9KCy7P
zz-*iP`k1lSAN?4hoXMMd1BBEe#vG2-41SMSBVOn)|8*&tL4C5*a;mp4n2sJ#wA;cY
zREW5>3)En}(K?kK8ZaR;GB}5IP)TyOl?Braw6XjqxZ|tMr35!!KZhE7>B#$XsDk}h
zlS6km4i3RWz5Y+Cd-DQTHi!%Onv0L*F^<Weziw$6eiLD;tc;ecnQVO{7x1c0y1nCW
zWMg^6nj@c?Uf$r#{os~=3Qy4{@{-<AW$iYYUPW|qwEyV=uTUkK${&w~0~6gVe<~gR
zAOwcen4wVmndw1ntxh-5Pz?=$FHRzaz1&$p&6ep=Hr}S7GImWBkn(XcsihdJ8@Nu~
zr(^gf4=S9oPxq{*rdzm1U8_`lv34JRMfrTP0{70-WDeUc=ttt0SGfGe6vo%9iig0l
zXof5$MN6f>A8fh<$0s1DD&_lKIBF?MI*e&%q67Ntxbp#ECrqLRU<x|OioqNJ`0tH;
zDxd8~h>8>?p)3B+IG^uJsRQJ2tYslnhh;HzGPtxE7AA<j_9zLCvthjt<hM@>*Ly(k
zZwoS+MnCxYhTv~Z+FXT}49E-x(BIv?+w9%~!?6#4*Hte)8*o|*SLdlOmSKbA9zrod
zB@r4<(QbZr*jW;#W31Lq$rKsloDuaPR~ilPi{zzS=J9ZStUr2LJH&f@-113b=PEgH
zE$;+dH9us_riL;=vQ$zG13IB%*q+H=J?l1|*MBN#9)}{ZWXP;^0+FW9$-S9kc-khh
z68^3Km9nb_uEwu;dbevK69&HGoiqwit)aYtv(-@NYGUN&nXSSsXq_jeDr3NwvgOaI
z`bDel1_{rumahiYD*z!7KXJIRjISwZfCtc9jNvF}ZMED3<bVit1j%*9kOvZuKZ{b3
zqCSo@!9jC?-wB7)KG(uR=-{5Fox>|KPzqQgN9V>yNQqG&ro&y1|1UihkQiqrSnx9v
z_e4Q~4S=LD51IU48znHs2_*|H5R_WEG&|&x52t2aKrRMZ0*2M~$HXGfKKH><`4gZC
zE}jwhyqCQf-ZjOu0J0eo*S0Qw!p4LZxjYz_qHKh1Ce-grzq0m&X=B`S?(~t+UsAcT
zFQjshg<~w93f~stM@&qWotid3yM`HD3!~T(vf;T)iBf7}zu))zUUlfHCQD;!9mmpP
zJ|D~4gCdJjAxF>?`PCgof(e0&D6qTHeo*O#_Q^wsyYC+_A(kts=l_JmLlU}DECxG$
z4`yNb^s{grS~fH%j0f_K9(uMhcl)P=ESO#;`XD0mZ<PJf{{t~W&c6ICyBVTR87!F2
z?K4%V0r1%2tlc0AC_~$_xqGGpbmWI{IA>VoCi3S>u>g&EV7itD4q(x?Qo<<1*|GyP
zhEhx|3ym_Pw+xe|7$c81dyNcK%MR2SO7XL-Ov2}nXeikVc#Z2V&lNiBN7=d9Fbso0
zbfYT9pXT;otemS>Ef5qIK$c?%+uS|Ak(cSL#iG@2zc$u$+zEZT=WrxRuY~1-Rm14-
zQunTI;*$^V-j+NnR4yDz&MQ&5&<<}%>x*Q^b^3}%g~)}LT<J>4ELe?8pY*U&J;Eb)
z@Jd@@W+4H;j1tufR?Px-j-`7|M;lzfCn}>f!p|W~bYD?Y+k(|pNi{Iw7aq@bx%0J#
zs>FK(PiDnb8JcD>W(lUV!-E7yg>!|LR2fPrD*OvsHZrXd{Jcni3shPa7!?xCOBm?-
zTN%s?y+o&MKgOK!JyYW7my_U7FS7ffQ_$1B`lCY4f^=8kq{|<4y*l?^7&@7hVG3E;
z)l-(Hd%&F<6(Sd8I^zaa3wpBF^Gv%FIvKdxdDP$Ngz#$n43z$(0?fj%lBGX{4FPn$
zklaSXUZj7kps0|^Sym}o3OqMV-tXP#{1_x(l$}8m!ypU;zZ7Ca(EmSHi(YCVOm*m$
z$)q91k-Yj@Tq%`y+Ido`T-+<onD4;xYF{SiUBP2vvaZB4z+`R4FyFqmZW0^|GsuP0
zajh{`w%^ZHH*XB3cpf+|F7c}{8CQl5Nn21WZTAc)wbKrYxrD2NWq=Y>*6Z-@lmP^r
z7guOiu=Ih_qBO=9Lp0f5%Epc$(W+p`7jC_?apIuWPA^t?Rmj;%cf4MPVq%nr|6Ke1
z!gG9*4dXXsoax5f98Dgn+<7)?QY__n%TC|-h79crYzwn@g#y*!w2^ve8`F&h+=9=a
zO`?|4k;G8Ox+Imm0>wghuUv5iiXTX!<Xq*dJW5b3_#~tkvPYZ&WX{%Ty)R19J3w7r
z0!zX3egreGeC$c0>DIlj)J{J%a1uibiQ-adcIaQbTVDs_B&HOmTqMS3Q0R|8$~V?4
z1uBK?UWv2L^=;)Ug}|4!Ka`zW62u?~M6YCAQ0{-R>CT@FvFr<^Qj{zryuP<c+gC*<
zd27VE@zo&lX(dsQFfs<8C8p@1T64Sm_Tk6FI=gl1tie6Jq>F<J49mwM2Tmzb2T;o}
zgtqq)*r{omIEIp{$Dyc{AXmPt96dZ_oC79#Z>_6Oe_9|CS!yfBCCq|rV#}Vp6zY{n
zAPco*5g-eDf5no4H;H=XLE;E^eH4T+4<cN(WZ_1kRk<B{DN9Pt`+N!_4=$mU+IxwT
ziG`KSY==dJB{hxBLi8<@9B4|6{2Nlqzy}sfmxxxrD-`uYl{i9FNPbT2C^e(^fs^{+
zgrY7(*@v<?c>qyhR=&@hRBq0)53zck?dr?lCYb>Yh}iII2%(4{iDYh9NK<}bvvdjk
z<blmXJ}AoJ*>Qh^BP8ZkQgA@CaGA2bJ486UC7I-qpidqYi8^(f2Nkg>A((6-T!5f{
zl$}c!#UKbnw^Xga?0;jAIC(`ar`Z4lPHh0=<r%&CPKn=KPjj>PUi2s&DD>#qNi*xd
zyt-@PBLQAhk=S&|fFkC>>Y*Z$nlP?~r@)Q6!$hn<s``IyMaoAo{~waxj>Th1t5i+M
zY2^JfNdZ2=Ls{nPY${>3s<9sqfdXm52u352dSDM>srD1#(~44PR^OptMIu1KGg$1$
zLI83h)ULEcov-kp5Sd6Ib-Ug~LXELTmv`2gr=fic{+@zmb?sdnX=q#vZ2y)+f)yo4
zFo2YpQSc5D8g(;={v%IyOrL_k=3w!U(AHkrm)$IA4h5G2lEUI2$<|2si)4K|Uk+D5
zkmMY`DdWy$a#J&(LmX~I6iyZ3dosSEvlDmIh;7xv^(lCe^tN~st$FCzY^6Ay-SeU-
zJfg!V>Fvr}Ap(r?>7H*mkRud&6@slo&p<!Q&L}y85Coz(N--)f-v46h&etNYo4x?m
z<>&wkkFPozw``dc(mlStlDXi|s)3z=!V0sCKU2U|Vei!-Kb#`V{%x%1usA$43RtQz
zOP3$34Q6)i(npZ{)Xp=792I6e*~od7GuvFO)+)+f07r#gASy>g7nxglxL83-3}?gf
zEcX*GV4`6Aby4|9DkIma!|mGS1R;-6(Pu7DqF{SnR5nFrMx(Gb1P&2D0OpQWV;3}D
z%0rHZE*kSKKHPb4?1&2_Ne6JS3%n*6?-!YZn_?mR_IKhqatQnzUTbzZK0{iCcTYu<
z9%&hD++(I+ZM(7tGc!Jhvpb7W*xBnQn2P0X7#<ENG{>O-E962KpiD3wmk%eol{^55
zGvsD84k&d_sIA*eaVnW`!g7n?n=+y<M0eKzWBc=t%Y+l`0z`{srz{`GJs~-<1Ucc@
zXm(Tdw%WA1ClnW!_$ChrwX)91eknVb9EL#{h+ZlFLhgUDde}K2)RDUA$|3~k88R9B
z!5l3ZpQno4KDtrZF1W0&aB)gMij7?*B30VLN55{OKDr@C7%+B?2s-S+HbY?@C;m_5
z%b-8)Uq{rw>Pd57a-wZ%3xi7im_SdoG@t9`q{VI}62cHpFN70{aMm)=Ym_*r8?^zd
zC){2w2*WtLFiwnFy4JF-9=!S1?l*>c#$hTcep>sy27ZU;OA9tPyNnQqofmOP2*pn8
zaPtQOel!Z7cBqwv0%z~>Q&+8tqlJ6|=Tv(RFyyqBV5sqy5)SA4BL76bOi4>Gt-H1q
zizp(89F_!w<?eG*v0s_5S7KTHJxob5^X<=O3SL9bC1v%4O-~4e{g2a$rddY);6`$2
z3muHdP=(OTil&MRZ%LPP39sR<cM=zbFf~Q<HBlVs4!rA`^NrjBGi3J57ELG;Hwg&#
z=EH_s%+)MLkFkH0UE2-BFbG>I=N^>ozu4LNIEjW<Wq~Nl!zRR-_bYp*KRI4wMr$&Y
z!lqy~bci?$LPCbHN)?kbP*lttI%JvJ{KzH_dbi3rdDF%kTJOvx5E)Y0NGJSR0_T0s
z9S+WYeuzKr;7WX<McGjq=$w!&5m8tv^qi7U%_3Msi}Q1rpH++aU0+Dr&|>Bt&d&xX
z#GfgfOm3xob&6Bc3Ino4M1SIPRy95uJ{9Pr!`2T9k#eAi<-LZL#C&CuRi#s;H4Pm~
z&Hg6pP_K|hzMhUf#b@a7UbZ(ewe8i|Go&WpaS7hpyX<e`N+Pe;mSk1fyNTZ~`BgM>
zfPst?L{uO^pxSs39a7Dj5k5|NtV2aO)2s+T(P66x$%vu#-1T(xJc5_P#~?aKjO~x8
z9{hfRFF)EU3}y(*k%@R`v3(t4z4)0NzR*?Gl4H)Z0HhWnCN~qTw$7o-e2=Y0+>Q<*
z`a_DP<E<1U2}u~N$r0)ZLZ|(i^+(y29ZL*@u$Dr=2mLp;$R9h8BY8^$jN@PgHc0>3
ze*ApjNCLTlsW=<+s5d9K;0|m%nIDiq*^z)`HX6c;b+>?fg;^XhYAg7%CfLuC?GAFk
z@R$s4A*pX8Aw)GR^v%am>K8lEK~mpDLY5wjf`)%W3i&tNFAMiXCV0<+puAxT(azzL
zJ4m|X#M`Z)`&P>ZxM&j{+`+%lSb}!L!4MQO|HwB@+^Q+P;E&bWa)j%lh^)nZKX<V8
zFOLb*BC;$OBI5H*BPG)vc=E(113ZQ|#+}eGSQJy-fhR|7f@!!laYb#J*qxoE6Z1W(
z$yh?*{bmpc{ABp~FGe{aTd8IIpwrozPhm(W;zv0kbBlclBh44MsNAF#siPbai{*6!
zbvwLZW+#zOsNUgFLX~`8cpROY#wAMAFFPL2Bw4<=48<%by^?6dkQNL?DIfx2Ffm?p
z)42PP4hp<<rj&-B*QgE#FEFKTz4p;uDt=oB1ipPKAIi??2x1U~f-Q++qWw2^toL&$
zmkA9p4l$xn+4tQw-)NHs@w=bz)56FPqjsl2!~mE-ywjWKFQ}OU;E^T*ArYqvtO`r8
z{%cAL^+=Oy%P8&Tz>3E8Hu(RXcro;{OkcJbD*&7mi{CX<xjfOt4n9`T1qS%gUV>?o
zDqV9p5qki`;9h5)0nVgkD%W({%v=|Mh*e<Qf?;P4g;HGm4(@99F)wHq<4ks<CW^zE
zNP}kuIG5My!PQ@eHDs~3ohfG2bP=|j1vN;?$PBz~&Y2ao-0JJGb5aZD;LJq#*h{*t
zF_9?%K~;hRHdBf5@{CP!cs*9fFi1MHo?!M^><4+Km((aXc?P@R(s><o>(Oc36YL+1
ztT*+YRsh>{3@l@U^ma-8EE}Ssa?4uvUVse^@|&oJBAZTHd7H@UVU;$}I1>0D777;|
zXP3qf)%GA--$eeO6M49i$dHA;{@~6J9tFCWK3dRd+Y?+NKxDt6>0+R-|B}_M_$su>
zhq5b6vLFOuH=26N(t7`k4e{#<OxNTBG*zucw&YLSnc*v<b9`a#=g`<R=8f_E?baFP
zXVy12?6Y80Rb<yjE5Qd8wpU&?4pa^JbA2M8Z}M<spyZx^nGcRG2CKq*X`Xk+MEf-V
z;&JMZk~R1Xo6au7$Afb74JBCb*25kzaj$1%o`I62@)Kbd!5;G~sujE$Mjq6tUXC3F
zNm<WF5q9E%3S~}dswmE2QlUm!dNM6TA5;Hh`o(d-$ACb<Xb`OS!b@e&VAQ;3&K727
z!G7(wy)5mSQvfyZ4k4Cl7DT^6!2GFWQ4BXv7*FW86nHzZa*Mh|!4YTBFX{fAHP*3F
zI)|W2b4-|K-jM4eF5E&;#!6(#V>O;L*ea<&v(S5tUm5@-jo%Dx-Gedy0b`YdajuRg
zI)z!^gE2n>LRI8Iij|wXZeq>=mRQ#827^A5FGy(?(+tXp=f&iBIXg5o0@7#mGIuH!
zy0}%wjz~2%a&+{_VCR>zGrF}P1c7KvtEg!IjlDT}U#NGpG(e1s12_!Pat6PGuu83q
zG44~zGKuFG!!Ju-kvUa?UO3Wr5k9%w{&`1&s!DtQ$0ut?S~=QZ`^Z3UP*nM+<C*ru
z5lDDGnSNPx%nXO#d?@$mQBb!z-6jLLo1hA01H?Hgdek;gG#@F*-SkupGSxKRSg%$-
zTK~N<!7Z81X+mJ9cC#)eYR{l>8?kDy$4IFUpNFK)^Na15ZHZy4Qba}7#>je|>sZH$
zdIpNy)+DQYVik3tHf^-awxj^Ft!-GDqD|^6I!(J2ZajmRkyZ0JJvMH{vvh}DR-UP+
zmcXp3%(duz1M?DIfZj838F)2xP}2IX7qOLfNyR*si$+?F@d5Mbt}uS=Rw?rg7H@Nd
zrm`=J3c878sE6qcWcH1^-B+RcS+H5oI&emvN2ViW!rMj01MO1b(8V`1c--T^K29&^
z*TXc%r5NHF$m|g^JBo)kaL+UN_7r3WiVb9Qel9y<_<UdVA7y8B1ThE#(U#OGEd4ij
zZ03G2#0d>BIbv8m;PK(JiCh*x)5<9ozv@9AyLgsXG&8o>3>J#P)qIRt*=JMfTj{a8
zhFcoR3$}Z@Iq4YFk|Ikia)6aImjF)AXG0HK5#-o#L$W$2hQ(uvyZoE&gICtJ<8<n{
z!<5T@=9Q8hi)`Urxagbjv~d*c5n@r%;{&@THFS8)ppV?M<5?^3!8Vb+JXEw-HcY#x
ztgYX4$d#ZE7AoqfEee5=3F8Oa(*{j)OjHCc!dosAa&J|d8`km7_WPmJt<jCJ4(r?v
zIUl5nh0@=v8nI-urZMI%LP0WrSHw{dgBB>=OgC@~b(bYN($)X9naz4dXmwLV;mRwp
z!cU|};)9ab#_d6k`5&v7Truo9jy+#rMQh{spl;lMHO)`myk^o}iPFvYfOA<DG7dUo
zT1tR7KzsvxZL-22Dp|pS=#m<G|Hasd?!$d4gWTYSjJ)aQf0Ug;vcoV4L$4IuKh(Pa
z#me(v5!{T~b;WqnU{DZJ=`n;+23agNx-KwXid^XfW*B6A$c`K5Lb2*MPeQ*OIzmKm
z;=H%;I&BSQtsJ~ksgqNXp>&1zJ@nv_l%Q`_3SOkvFu{hC2DeMQv{t1|%}Dp|ixrAB
zj7<-oJ`AZ+re>sjd*L(Iocss!<oVo{GNm|9)Wo<2<7F~3zu&4{_lkSHi?E1b+FEov
zi~Tz_BjE<^%+cGhzR*?*UAg`hDj*7t@NoYijgp`zv0siImY!&5&<bQ)F#6`Ntla%U
z0|uM+L5u4zcAIt*_~p=XwbudG4TG39_#GNo<+4^RhYmcwgBB%s85^hjq@sn=6wUO2
zL8vlcjFq(E0jdOuqJz*SygsIbatJ+aC#L9ytFS*rVzk6(4N*vQ=#trbs-TvB#XSs9
zd+*u@-)}nd(r3}z&*-6SIzas3H3-rA+GLPb^jG@BSctWTr604_i$?xNX%*d+{*aFG
zNAiyehJ*h*&zCmAzm#3k5rr@a+vr^z3&s5xd!%1t(US!@u2KXVlGjs@y`mBmcPzl`
zx#cXaFsYzLJe*K$#s8eAcaX<O&IBd5BOs1sAj3-_Pl}qTR%nU21(9FILuJY;xSLrb
z!=)AO7Tke2WToWRJiqGPYZa|9uHYs~#P)y_3qr=3UFH|#&u1Q>I3!;3HjG<%1Q8|Q
zQ!0*Qdulher4Di0emS*b`WX+98hQ?k$U@V-obqalC>&~;Ct)!wUdBNxnR*8Uni>i6
z#qx{W8sG4^`p7pM?<pnm+A3a$F=}5(K=YPYXM&H=5=jcKz#RE`GJ>&-=9bWGM<T(Z
z6{-~6G>f>axTsc}mund(pqBVjfH=nCHl*ijPfsEnm_aL?Cctfob1uPB3Tm`0IrUa@
zJ5;cg8J*k#Cmf?E$*DqW0z`f_Ro=}(Jf9@^=+yR$;{g`Hr)2WSC`U!f)vWNP0D(Y*
z`!&-J$|p+SyKOBos30J9!0220oif;A?Qv51(Oj@Pf6C77IA9P4f-Mor63~BRVaZPb
z*@GI;Fc@<@j=lM4h#U5T$2!p76i`KWIt{cBcI=8BFB*aw3Hwi{86wlgK^vI+(3zm&
z8If6VH9EH0ZA@0gO~ZlLo6_$ea<%F3(u8CK79;0Z%&3>j9!So_jd96LZz_K@d0Vy8
zYWx?iTdNZEbw<y04~Hhw+A5adGHsRZru;|a59{h!$uhnEtuuo`n9;S(uEQ2b7$=HF
z-_PAb1_dJee#hY{6o{-GoALQ(F3(&7ANCwikw9b(J$eiRh}22IxAT(6GcXWYLyv~8
z5D>%8y_=ntGZM2V9*qIP4F{*AJW#Nk((gU8`Ey|7AYumCF?hM*86Jpi{v0jfnS}e@
z>4$1J#ox!t=Fj=zH~=<rufYM2XOJE8Z2w_p{-|RyWdx-513MR1|LFAP@Kw0$fbe3^
zP~j4EOGarH*iBK)N?m7?$H^q{6vacHGq;_f7vNh`w0Y3-jF5dqAcci~DLbPih(QpB
zUP(bw?|-pP{43hd<^rwLssW6T_kkua4gz?39Vq~_*K?4Ha`pN#NTt+gPo51|9xDhz
zAILs6|Lf`RpCEOG#xKI+po`b%<;Hm^^bbqcn`R3Ng(=J+tX={!8`6jAxl?jsPRg4t
zOinM0PZ7anz`@&yn+fFoagi5^H)8!m10}eKJ()I6?~yOsGFz$VDpqv*NwgtY7#dnu
z-)N1?ual(vNwnc?MtaNpvvb->EeVNQVwq@D!pFuqmxk!k&NHh}*d><QAn_O)8}lI5
z>m<*H0tK;1w0rOPpGeEeTsiY*2?}D7LQ+TEfk=tBPX@2Mo+DQjJV9<MIk&U%@PG)p
zbHi6~9(F)()?%O2AUy5TgEAE4hQ&yMP4&&FW-G^fndmMR4P)l&HOrky8R;ClY_AH?
z!y*+^5uvx;?TEIJ_Rpi=2mUnTu<vJh&@AOFo?X7VB)qAQ5+?dU5IssC(BL?ptq5;|
z-`MaUWoMRTF$hA@9d#*Dg8ScCbNqQ7<fWPom{bNCyqt?QXF~xcttU5L324Ds3DL1%
zQ0dpM<QzX;{N<U4aJgt{ZDgyb*h!9E!I4PN=V0VYpLqf*?>+g>E5Rb@bG&Z9cc8Eh
zg#FLbFHa?mKhp41_AK&=k(_o^xFmANT-EnNBYyfmaE{n&1sozT>KrYhJj9}JAhkf_
z(BxtUJ9!3`&D%o2-0BO43^?7iQ#Y<9#)m}7&NYFYY=4RInalhvUI`5rJ*xeeyYN77
z$Y4(#Q@Z;1Z_lDtE<_ID1oEEiOt31b53zIn*lQ2)V*XBNlGs;}84`#%4Y9sK=N{Mz
zC+c9WkS!!IaWD~<Me3!DbIp<5eW~dABi`vhO32x=`rRwf4CwRazkiYejpJ|C5R!YM
z*ez)aQ~(<C6!7?OgqR$NtWB>g&%j)PT*!K<D@UmadCGNw7GR<(-7EB!?W(1^<f+)%
znJhy)O+A`f(x0rLIOJ*D)S9iP>!$VTKaPy3mH4IX+>#guK`6STj`C9Xzp--jRg`9A
z0}NqQ48pm&^_ReGdh%+%IQ&S#u#25A4y(X8XculG_>LMK^cDEd_)FMh>kia^n_wDu
zL32XSZBt=%(65>kfBbjQ@K7TjUcb-wY*%V2%LQDHf_=BRJ+R5+q^$rtIG}Pw2tjeD
z$<oSYh0nnOmgA>uN6VZ0J#kdgjp@JZkXziK{CI6B((%fcp;Y{iJ>}037ouU4&j)vv
zlG~x5j-XUykQVgdBpbiN)ZjqLA>fYIzy$jFBvB%4@YbtigMf_mFX8mPutM12tyKq)
zOH<HAD@a50#`a6B;}ZyK=8!xQ$h2s(L`KE&IOYL%mEXMuVz+%IwhLK|`!;WdYBmsJ
zN-fJhT1jl&quQZoUcU`?<RCG*GW~a<#73Qt<~G0V`0oxX=SfUfB_>-XcH;jD%0_;9
zNYuxy!rS0YLTd1M0J#`+K+NUF_)A!}Imp4Hw)$v84{W4WkQ*Gjci25uXlp9k=aY?@
zgDbw2ozaoQAPhuXBCI3M{Wo@c$xn8WJyr_P#274umbX`-O(AeX!oVgRT7S`UirE^F
z-(%UVcZ8)@?jk6u_UYZBR>+t-nn32*+S6Pa&q80X9AoN;*O#j%3lh#viXrLrvSdgd
z1oMFv>xouse~+D1W}=-57HQ#5%!ySYP-)>dWTKrcD^E-&1dwLiV|G{@GQAGYD<Cm4
z`g=#XmVs|xp`}Q&SSFkGxwTOgWzkBLCf7MumXhqZ@jV|!vgr^)WO5y@mS@5G5npjv
zW1rQXJZ5N}SAO*VBuJxp06hzRGa|Ma4_uXUxJfpn5HNLM8#1{LP053nGA2L;2sAo4
z44GOd)7J6AMg`)K*0a#p^Uv+3R^SKx?Z_3&ywlc^F?G1FlldG_MLxiOqcu7l47prq
z0&kp=$skuuK{kmFsX}HzHTeML?;LaPoU7=7BqYOJQL~HQYW{J}CxLH9+7=@yVh%<|
zRQvZ1LPEyV$@(t85oo8`<iwM}H`C5Yt9pN-8V83_>z}eS%3&A=Vd#~Tn3CrH7aQ)r
zJd&ws`$iL83zQc-MXppAp>-&};uZs5^kYC8N-NqCP`fFfQ>58Mj7ojXG|p7i9iXUA
zC!uaJ*tx;;yZBj}Hx$%)7D4t%@LKnGp^tw$rF7`?$DV9FJ!(ED>lIN7{AlQ4UeO_t
z$fHR3=Ke0#0D*MAWAx}2ty4bD<Q3@%2%$qk2eOY1#47rmz<(~Iw5LWxb$Xo*uCO=h
zsMHpb&H;hMNHQHLT7MPzoM(k~3`B%UQZDX+bE+%C3s6I<F=M`s(Qb7*?QC8L-xaDH
z3h-EbqMDPYyl3wAN-__)pw*U}F$b~oWd7w9jR#!Ppc0{Y0I|3kcRSR(m+~Q}BBR#w
zdo_wIwU@Ea3DI+ri{|Z%PTs&q+Quu|6i{=jXqlpKGQNIlb4N<uqm&diW$Y_{xN&7L
zvT)8m^f@O#%Z_+{Q1qR+4Q9S?Dg|9R9+L2vu~h{fC3hFIG%~vMsYb3j`Y~#}wjB9f
z)IXG+3l0Mz2nDaCfWP}+td422L2a{KfS7I-(8s(>VAnG8G9!tS0l?(tBnh>Q)w^?u
zg1jaB=JR4T!oW~3;K?&_4IY)4`nwfo5lDr4`3^(;i%!7m<<dllAQf7-S!Mdggmk!`
zu4^?!tx#uBwTS&?hQPXTX5Y)YBSk~)+e`yyvXmpr-RO7|`_IDNo-}TrD%74LBIn5+
zsT#a+$B^w{xQ?-#>6^&E7wuI$#sqHf>sJTZaHg_I-QZ<A2E<}1_bQVlmpvIO9lUHu
znbhNnx_2<7XP+KHSZH&Pky&}e=Qbymhb;9(j^yB0ya~I_5)HGeg+4p~+#{5Py^B?b
z0f9?qUJ$$U_a31v>?J!=71Na=r9t()tUQv1y<kUX4lZarjkhs-6Zy}w$99dK+dN!n
zF)v>)k1cp4Q+fpt_N=3pH5N1u2;nvI?@!scv5#gLEaJ*Azo?!^Y=ju1eS><8nivo=
zWoYr-^AW6vI@nIKg@2)+g6%JtZ5g@<eWW`d%FZB5Vh{wPSBiq5_rF+E_GYRjnXt%~
z$1^GfDxZCNcH<5GyoD#(;FWOsBi%8_WIzS{1+vkzHeA7P$d7UdMMcb->T7tL>y7FA
z9X_40!+>;mfD~8OQLcbJgm62k{>Eh@d+3?2ccvfQrs|GP#P$wCZMV#JCGL<|CxQW(
z!$^(eQ@9;M60dMEgkU=Z^v(sr9x}m`3Y?n0-`ynM86c2Ax!mK_v{T>i72t-DbSG{S
zh&#gdIF;?J!=$F~UnDDcTz!ven{jk-pXgz{5*S#vGcl&X;v?HZl3mG~ltKf`cI?`1
z75vQ^o6wS%SqTj++Cg)(D`-AF5>CJDjqL}=DT~#(S_QnrjcYuU2(R!qg!DRS7RKIl
zflA80BCY>z-#V^L+rbYl&>uv~Y1t%9ukbdMSvzt;onoRmKI1HJq_!U%?>v42+!y4x
zs@J(stl~8ld*GIv58%MX-WYyxnI$`M3u3|!PX1WQa(KmQZhyp=2*l<<ccpL9OKuZB
zplww{taGeN`@0|?%FgVFVGxFbEdhQU?!U2Uoi8Dhu?h&o5Of*6)pzBU*|f7rvzIP#
zM$nQD+NYTzZ^+Yip5Rz`Vh0(2AN=c`IuS40ns_RJ3g&8C3z^`|kT>MVTur9HAge|k
zUJh<5Mc$B~b49idgkA{Ob?~nl@`ilV4uO4Kh$oo!6ic0%p<~E5?O2E$4e3CyG&j6i
z`S*Y6TXrl61H?gW4f;PUePuS?{mPdWW@4~0^GKsnrtlc5E`9BVNxdW`TEIlxtHpnx
zi7PBcJ4Sz=+MzBU?zb|h;u2Wdk1HfftI=k#$_#izu44!By4eh9{*#+ZVK?M4JN5bO
z&sYnHiShPjVvWb_*bTYOY{V<kDDgpLrqCN|8%u!HpjsMbWe&9ec-onO({_m#)o`KN
z0~qSzc4s77+J|Dne7V~F6vhW)>CA99v<<}~p(j?ZjwXM+Tl~+~w<cGsDy>K}%PEX+
ziH4a8YR!M}p|cP*tdOYd;J#Bq%>#FA$qI9gE{(C`?4TK793RTg=m=sEgn})pK#cu2
zc5MDo&yg#Db4&t=u<y9=5f|<!9P_Wp-Xd#K)iQT;8ilbuGv;R<{S#g5^*uxSP>HGn
z;}e{8=gq$K8_S1fM@<3G8ia{Ez}2heOsI^&ohA_V=<uR9{JF9G|J9!QciJbFA;9BW
zxmxsLJL1jAcba5U!H@C_t)*w!AsQ(=?*B?-BD)sbm3MoJ9HJ5jL72C59}AX~X_>XK
zkwJ&3M24#s%5|tCqK+kZ#t#p3p3Q1VW+(~OQ#R>Ih8?0hsntQb7>#DCvg_dPDV~VN
zo*o?#$x#hL-MDUyXCiX!>On$@n1JNvYnQeU3!enC7+|r&oF?i=s{_waKy>2obdU8N
zr$WoxqZ?0{Is|IyCP1wky=PiwY!fmw2oQ~(J%;7h5U79k%JBbpJhb*yK);pYFT}{#
zz0L&Uh~D|Cf}WX}|G^H|*E8S?)e&vij_fn{=BQW6jqU$CV&TK|Lyo*d!QQ#ode-Wl
zBtr3zvU5w4AOwNnmDEMi`(JEHzXqi{nhOv;J_gV-%YyrTImZ@UR46wk=;t%c4(SJ3
z86?2AX(B1#3or%k5U1|})&Wa?Tb<p<YZ+dLczw^>WL~%wYXvWl!_Y5N>4=e5({o_Q
zX6%7sT^##)K)knWw{*#UEoi-K<75~k(!IB<Vq=YG7t-ixiKMczqx96WEAEC=s|M!d
zn!%Td$Mjf>&2t_lnQ1@`*A%@(yu4=?5<Rua<P~<2Pr)At#i@HZVcRCD+>Ev;p=HP@
zau{P(lrolb@H7o<gfs&fk;4~@OZfr@T1h;?hR>wR6Vk(hy(Qtn)4hHAeSdl;q5a5w
z%9lVdlXoH_=^?>IP#R0HG%`u-K=SB*v1{{YJ*!RM`V{<SQ6G5oHR_)=lva7qaX$#r
z3{6DF@|7{<sme8c3q`77@aI84m^{`1_og_6A~?DF;0&rn4j>N+273U({dczD!!u$N
z`4RV&Pm!L7z^m)*m)rknLzA_7Fn9aA|0z4SB#S{1h;Au~sMq~(Z2F|;V?fHeY=E*%
zgvQ6|Z>PY&$r`9swZBSCSsgDSP%OfC>;XzIwK_2a+gEjkfnx3|PwSG@cYD3JUhd)+
zx>8-7Ggf1Bu6H!w(-X(ESpk$-1n=AnXwbk_Na7}2h?OKg1K-@RrsD-O!*9tsb_q{n
zk;fxV#_=Ba^Jj9_T!NEW#PJv$9(wrpF33H(R_G)aX*`|laEo!XYqzsM)98npY2Kim
zT>;6cYrRHoTkJ~payNQlOQ_Ne%;v`@=^`sc5&O6%lANu+ee^%OF2}fs=?Gw~=l(rx
z=IZ43AuA*i3kV)sNS@(n6)CMG6H+3Hn0L>*ZdiVEVzI0~IO!xSAQ21r9myxjN(0jd
zlsplC72Jn;{?3C3_qrrZCP^lVUCFiHKuf_#*FUHVyx7}Kf>*NbI+V#?($*_ru~y?j
ztu!?H_fBpfRWKa3EPg(Yf>qO07I@4tzKMPqyyx%ml3;X%<%L0cGROZEh9An#D2IU%
z1fo~M)d9W##mclzQ;{~yPe19#tnPsDW)B{?Sg<C%B6j7<Vf6EGMd|Eb7MG^?r&R)h
zA4sk!D@cy<-OO_*(4Xgw{vY5aEoe4}l@-n^cn<`pEEYfs3-ZXKi6fy^I2n+AdfBFH
z5$Y(;0iVxZp=4lh-60}_Dc$R9a3}E3^~TQIq5NB(5=>etX6mxS$Utz&YHTz#)e9`k
z9a^Nq$bbahdb#YQh28Ze!Y9vNDHK5h*Odc({s(k;SV_~URX7=txD)#lR*4#6pqkuL
zRG<@(s9qb3m9%D8Og+~HmDpi#(%)PaG+ps5#}e^c!Z;w<WObT((vyrB)8u_AoUUkr
z>#A?dh$+ML3~iOrf$Qq|83+6N@Z>$Q^|lho0Rg_ldIQzv;3Tgl<P58@91!R`;zx=H
z_UxUIpX*NO-<zmK3j$WZI6BygfU@LenWcpZdsML4!s073{3ltL%2B?z^N@<{f|*5E
z;U)k1v8+HH@agAyP<95m5`!QRz0y`h?ENpcJd@3j$ZyI8%!Vxt=rHp;+)?dPpO5jI
zn{SSOh{~R#?Dj1aAoKZ5PXTkQC`M>I(9>IckNFY@Na!&Y)d+1NLven9M#YqwIEPwA
z-$4Vhhn022Bvqjg*_)&P|IQ<?=V}N^`V^#i(4F~jl^c2uydKJj_{{1F3Q-}6c?B#2
zuZP?J#Y(!pJoc=1RfHt8g^m`SM1yc?*V%Y;_Cs6(iuMK3J_nkxC7*oh6}SjiTHa91
z)uOYVoGgl2Mf5>;YR`w&IqaR<#NzH053`c$gG#uI?blK{o$9G{Ec#kS_d$1ZkGB?c
zs@FwBMqwmPS4sOpCD<2uxx!Nrouodpn3v!}VwMh{sU|)?bY#it6}SklT2M2m|7{)Z
z-kz0!yA+tv>k7Rbix|9(-0yz+Ltw&#$#PT0L+NH+^eiwH`3jXiONTTeDiEAMiHCue
z^ea>XkPcolmMItxt7l+J5*E5E_dwt9i5!FMdB&uIqJK=EFJ)(!oG}PO(H(V+LcslR
ztRDK%5^d&V13Wk}{CGL{N4zodwVAZw2Lzv$2o{=*w!*4)B???~`aVA>@hkLUv(;jY
zcvb#5@IoItoOUJq|JC_iUxQK(C=iv4ANajifkCKjrgw<dg~=PU@x$%+QUxG+F4Tg3
zzba|aB%)iQs}LbHJ8glH7uKv%5W?)<zn4me&Q@EH3E7;0ve3ppSa2;JN}kiU@PRiF
zGtFZobqilf(30OX!;@EHF-@bb+k#gTbe8<E-nE(`{NC`7IQ<eUNmL(6)Yb*X$#4}e
zzkH|H(Ep#gKJ@DrQaM4n<_GGNl_(3E9l1K@${x$bz{0oCmHe6QxcW`|Nr!$JL>2!e
z_RFE9MK9Kl*rmI;p<Cn%U_rCwhb`_~Sj;#~v1ci-=>v1OdQORldOhGQt%7dQEcjU!
z?dmUA4dEyPJ`4TweI&xxfB@r2hAnK0x7d~Rkn}!d#B9~0nrMfqZ3(WR8Rj!PUTSxg
z`*J$%O5(XQqkz|A<oB~15Cs3G?Amf52tnA5Hoj22|HYR2B?B`_FF=ez5NJ!V%_N5T
zzCS%R^l<_A_!58l+CZ;dP$r1oNJdCOynGL6E(KHW1@)|Cn#O1y$n@v}Fnj?6sJ+M8
zD5G;APP@k{r*8g$9*y}#(udg06k7b+El8%IVlC#fn(-hRp#ynH_q5ThrnX<y)EPlI
zj23}BrF%e$vhas3O<6U(sRCsA_czV=ERJ@NMB~p)8KDEY;XOaN9kyr==$9o@GO6j0
zV>{Bb<-&c|aAC{i4wjh^?chEKr(kYvt_{iB9ZfS~ba^yE!{h-Jh88GA$_NF>dSpVY
zdAmJkkXTD{WU2w?kUoI@&w-i)Q~&s2l#vOLbtglRDo>B2f`XgfG!<0u6<fcCWr<^<
z3xP&d$XLpV1c<t=A=sBJMJrkX2`OF~Ccikvo^Bpzap@>9)dV4(ntl&`POt~Cr?w!H
zDG08~J7*%c!}bj9^6BSuilq?AWivt5VS6lhmoYKQ(2-T^sp<C{`BQcV*$#ss6y1`s
zg1G;UeQpN72PHkB^Dr<J)Lh;RaL?_6MK{2VXtbBHAM?*NSk}PlPOl>q^S9(pR=UB)
z_bjCNlmS`w!^U@m^#4F*m|twW(_xnA!`TstNRFL#8vMtqtWCQE4^!Xiprv?<xmjhJ
zUsl_vK_P~`wWkW7Y3%1z33w0C4P_J%41DlNm5Ne;1jU})eoMVVO=QfI{#%j?kX^E;
zaq9|MYNm%bj#ab*Bq;XWr<d+sQaQb!te};o0wjPwbQ>>)o`uSMOR^-Teik{OjtcfN
zW;Z{5p4nY#XA$uM{0FqfX#t-5dK3G{lGuhsOzduPqxPR9f1OH4Tf1NE^zuC#8j&V%
zB0ny-28*qJ<5a3hk!RKrR*@pmjrUp0>o#xkR^wc6LO(9Iw(aD|0PgU9?0Kl?Xt`B{
z2()eU&U~5kUFN)GBo261Q3}wA{B(gRy#}|Smi3*IP=H40r!z^(;0%87<MS%?bDBhP
z5WxM}`@oNENm8j+Wlh2@E2iEZsgq0pC_AGh3PBKxZb{M5_P?>m=?|edG1E8G6cOsZ
z981Tfcvr>*=ppy%(BQj06uV?z--7>nDt?#MVp@^muYjaCY1%5I0`x#_t($p3mVy&r
zaZHtprC+_=XR!Y}6@S27vB*};@!G}9j~laot+j&DnFz^u#lNoofZz3YTi?UH>2Pwp
zEADbVbv~BT_6J7!4nkvx!=W_#`-d5%K0-Ihk?sH%7Q42RdtDEykJS_=C84mIBU|!R
z?Ca`iTg_Hza7wTR*y4C5X;`VW-H+5_W9>03GIDk&_g$&9Zg@{)Z+LA6y>Qs4Un0N1
zPDk4!v#lBqTX8Q?xACK|)ItZ_B1bF%CmB9Oz6Abr(_SLWp$c&Ic3p|KK9BvHfa1L)
z!`2KJI4=Y<@ikVw>*|18gZC&40E1P*xU;=W?sAn=IIsY{HJ}_!vJDTVVlP)Y0C-c7
z4LxHrk~Me51Fnv_H6F<=P|EB~f0rEK>X2KEZhSECG=&M3a#wuXdJ?xf#NToEyU(Oy
zdqV#xyOJCTLJ;^RK}7oh9~;VK4v5{6%N&Vul%=iZ`j3p59s-%#=k4a9$EmZg@U%68
zdX^xxt>4)O9}ahAYS3M?$6y`<EyN*`_oPzMBAy4<qIe4OnN@p&mRW^Htr5&4K7x41
z44wdd-)<s*Y{zCt30B$z#Hu%xDg9OW+1k@o>6OYG2(Jb`FS=4^B7}$GckZ{vCt{h0
zV_m5Q5x&C=moQk^Pv`_3PF|@TM6n)bNP7}yC_jUA75eoyMyVcZctV|>X;^xAvI<FC
zH|MRTKgVDaN~UgFiJ`3<d<PQJV*%7b&&x1Ut8lbcq8Vj}d>aW6e8~^WD$Hk<?J1=5
z02K%f<-@0`3O8A!I?n(Kn|#g7H{vGn$5!hm65x4MAl2`e5#Nqe^h&mt4Nxa-`NKf;
z3nK4&6Z~W87LzK(QM`qM42$q#Un&VZiu8a-jnef%nPKQ%?DyLq5j!G(5<58fho(VF
z<3~j7K;qAnAP9>@2QL@9r-T0}JG<P7K^O>M2{!Qn_rF;ErIlKPw_0l-_RWe=f*CwN
z)P8L<+fEJ_nUW9%KdSxDs)S?fiwnlvo4c?;Jond%SX&!oXLRx+z7?lRt{p0JYFP}$
zGn%Bgg&U%7wkDOH6F56qzY2a0C~(f?MXBhX6`gt<8fZ;qnvLIyflIPy1>z2l0eqJJ
zaznpv=Y4lY^(>1_SH{>5-TjEwSF+v}$+Hy6t|GY!36otJDznOPL0byf=*=OY*&JP2
z?MiouIb4n{&0p(lT$AbRN2T9?l`)445eEi;a7B}Z`Mmb~CE4PeJF^gnePp#IwJV)R
zf#eE#b`g|#>B+}C*QC-L6q71fTTeh^U#FYctca?mm{i#uSzpA^kRO&jb7^-Cc0HJJ
zIlAOB!z_`X&5~MMn_Ula3k!zq4RJn$?iIDRMhwT(!{DSiEcc|(TZQ7J&9SHTpR_gy
zgY(z;`p-<Z^5h!}9bG(H;)dPv-IGnWbn!KIu_ZFD1-HWgPaI{X5kutl__1n!QFca0
z5Q88PZAml|?7y+&<$ezJGSYzKm_#(Yyrt24R1%9e4>VKNqOWIk(xEPr4lg?z_+>>j
z>ds%eh2ShHXOn(eka(8GH$+-*g%Q_QH>zbi=5<Qr8Xe`e$&>H5`K_DjYuCu|Y31pF
zuBeshXh&oJU-3xr@jCfzufUXO;#>-SrfXg!z^6kx_QK|uihIrcwp7c!MtTo6KEFu~
zj1N#3)@PZi#uf!jz*M(ivxJuRjR#Cq<=C$2((OlN|8V-(>a$KfQ!`^67s&KRxEM&m
zdNlIOv?oo(KTD|!>|K3JS!;c!(O)NrkB~HAf>+g6ZndSF{B<(;5Tf15m_&iDYq*+a
z+Wd9m_jq|2K63XXmTt9eO;zQ<?-A4|PHn(YH^>RgKm;`Udpe?g@f*FM)13|d|5b?w
zAND`5nuh(e$mRvVQ%e$=li*5WKLfwA&D|jbC(uaq5%WFeNtJz=OlM=iOgw&?zz~IB
zgJ@D488<@@&}i{#s8DzBqxg-=ezlPgW#^K_KnMcSE2$%(_rF-Wt!zLh6*k!<MU0;T
z47~n+z5)+WU*yB2p0X~~nH-5AcxwB{PVv?0^C%m`OOPItIJOd+Kx2`Q(kF{hhY#=F
z>sdh)m<Rhz^19$T7oXt?*JoA81lEG4!9F~nc80wZ+fT)|cbkk`SQEngnM=87mAC{J
z%6yJ?7PC+Mp0585`*ks`Ma}0;9b$aL==Yx_6()fNvJWq-o<q811l^NKk&1CIZNSaf
z<`7=Y>TOvomV*X6{F-5G7_w-RYMPd2d-*tm+%#hPFmAn1rB#N#gJqT;H)70_psfTV
zut4)63=t1N6|CXfNqApD5tx_dLfnlAWm26GNB&;OU9lW{C}*PpyNn5UpPZXYKfDE+
z4|7&V^<=$uP12H5KfHx1AJ&*4HrWUO@S=a&eqT-TqT||6s?VzFk!+PpN4#|}`K)j@
z47PAEC9B^rwZxl8`QSN)oB`=;la<k#R;6p*JjrKZKG@EL%{V1#Z@X-NC_AI%3PKPF
zUTIe}=>0Di+T;hN@-i2&s4ZOtnVt`Uuk5Q~aYE>vBG<fefKyS#dnWk+{(RggR=ZEt
zgq%`tI7mJWtujyLdy1ndVHG{RA0(gHJCS_igSf>df86cD*`?6)`CQv#wowi?E4&1!
zqPF(~<%7U-&nRucV<E4ZLkj)y1HwU``sddb`dC^?ZJFZ}7vzOYTvVJ^9egRVWs1)W
z-oRR1!nY>vT3ShL2f+ts+B=X2Me)5xaeSoQmWF+v1)veG;nr@?`xRCJ1b80y;qeQA
zA6S#G`&X!BHakp!8eX{l0ZHIR$)jlD-3}8VSgr{5?6Lb>OKNz}lRhsUaHh7v0~Fpx
zQ<1~F9VKRK!+b;$`y*ZXyz(DmXD>@a^-ZqtW8Fb3Strl>u;U<i#eH){&2y(qNe%CL
z+^2KJ<Vg+t#<v)aP~`BQ2Y$L?ywW$yK8|Lw0i~>Chu;YAfX2E}c^BzY(b{`P_5d29
z3yw^*JUIVt<b6|iW=Rl(AP~Kh8zT3=*!avB>ZHO2D9RA_ZXVg$%hts!46f_kR1e|$
zwfQ0DRF(M-PWOg>j^O&$Z~VY&P`K`b>`N2EB=jKu0uW%J3ZdrAsV>Q&g@R<09cV;<
ztxgkR)_BN{M9FRK2Vg*Z7))3RvQNTa6!(M73K4}QO2B&Q4@T$?)DiWRrZeeYlhc`Q
zUIvXJx&w7IJ%y#%vF<)Ycl%B4|4$+g*#%^AIv6OuN0p16L_)A+zks|Zj|uv+eDhP0
zAS|vKOYcsT0L!(!|LzvyI#9Rllj+yltYv4gAT72pqF<i6xoVqt=umV$h1#iiBm~O_
z>Pn#V8Xfyl&MtvP_zqP1wgd_X95YOlgZt+y`M+h0FDs|Np8pFYsotwy)Q-eS*%o8D
zB;D5ZQq?ZsGSn87oh1ZzYmV^BXy=<mqGb1pYp&b?DjYW$`DTKlVAg#THg~42>_T+W
z(*Pr}Y&*%tZdF}OFPVGT_C@xK+78i0)ii3EP7v>%ew3Zj5rrTO1X~gWkM!TzV|`zN
z=$Hl=CL)25+Y6RSCgZqfAE0V;Z>4_&G-lmy!j_^n$hZ5<J+6so#Zek%h))xLiHd(9
z!H@8Mk;3U^|CpI%<{Ewq^kV}}S~yJx-!hXFygiq0Gfx_+J2@wa$Vi3TsYmRh<k;{K
zh>Y(ogKN-Y&Q;l=Zsh^m?LAXk2G<}5?<s#}btg1^^9!{MO+gObLzxk>6YTR#L9j~(
zR3`7$HTMyk5$UpOf$64YU<&eHT_F9gG4mK#s2WT=bv4tfvOKYk>i@jZcg2KdcnXp)
z!h(SpPZuY;u`eS(FK%h69e0$cz^RVYzD@fjD$Co*1)rVXZye&bp)>hxvFZ{vDTC86
zkKX}H-BLgWElyo%JdhJpM79yFl~lSMi>hmG-wlL)vl?`@SccXh-|B+`f7}qWURC$M
zCzH{9qfeolL9(Pkb=a4YUjnieU%_o-tv3+5?PF(hj_>k0zy>1UoR`g$6U6yA_>ZzP
zN|G1^f#{V6Cjq(t#g>=-m_kV^T!6AnqygLRcmIjzsw#4<3~Z#`irn1+w9N83xD=N2
z-?mn(Y|;X>O!J{ljWZdoCBUHX7XI)tQ(H+dJh73Iab2Wsu{&s)IX?JxEAxlxQoIlF
zj#h(Zi!Nvcc)MUitfy_XD({FXm@mZG=ookp^wEJz<~}#^j+}xmu3dt$Q6O7%#y{7_
z$H@1eav}N9R2p*9fe=<y-yN+6^W|WohsdB&g`F?<qy;>lsIgx}76K`+d6E<h?;ww-
zDi&fk%38|QMBfCyKbD?I>sVq3EHF8i;ug1#eZL`T0xOW#qoNvDKVP)O9RZ8E7<XX?
z9`Vr)cceM@!=s(x`NGmJegYT%G??c{-vqzi@|h_<C`il$Rne&2ssTqwU}9#DPn2vz
z7X0!!p>QiKV?Qi>flP%<fbAxFgQNJxXJ_U4YzFdZB&(ALM^-qMdP~7#E<7J{tdnaG
z41~AP-dXo5ey4$LN2D>POS_GpKZ!y7QFca25JWH#y%LEb?tiiE_9wAQE|5_S3EJxz
z+|{y^oa0(PJ_fg!$d?{*LLZ73KEjPYWQjPIDbR#f?>ajbdlP;Xd(3+H$up!0bKYH)
z<dCGyD$6jeamS{ai#l_HAM8Ar-<Z)kO?$XGni-UZIl<4MLj~qOmCmFQ_Ltz7raN;W
zN<ft^sM5IR#!=Nw(?4e<Lv__`^e^b~^i(y~aAyr9sKW^rAXRD{yuoG$X<^R2ODF>s
z)VI8p9fv9|1D-JF-qn=)SmCiA#qn>!FCF8&f#@bzP*N<=Q9CRznLOwGyC~}|G^doR
zC*s0P!7Xf;{fMsDx}~E+?B!6&W$+fZtA1!XFp&5Ol;l3&USeMw?u4=(9ga*SoJQYU
z!~ZXh8{Y@ptGY0~1wC^*$I6g7Om>7pC#Xr6AFUqFIyIF*H@Xk4y&HbyMPpuo%@913
zLN~k*Pu%8MDH{b5-+8~pzV!EQJ3_!K`lDm+@cCz4%`<=w+ZjI<)$=+O=QF1;Gam>V
zKg!Mk$6^o!qE~8_+VTDuTb`RumP(Uy0rT@KC@{YHr>~1hXZ#+xed9a5oo*F^hI*J}
zPNus9?-*L9`@vZuXs8FCvv2AK)(``-LwiV;7#iwfY;tf?F0(P-Y4j~>Dg+JnFf{>U
zee=GFEpADgsxU4TH9tt!FZ@eI04Z6!lDwnpryGM;-z6x+diE(xxjU+UV7>XxN=vFe
zzApa$F&`>f=q;=2<h|sc11lT~Ma<6ue)a0ZuM#||N=mm1h(Zzc<GcEvOk#gY@kwLP
zDord|bZlP_o^URt4Vn<qXN7YiYY#j4b9xEI)y*$i$<W72N!B8#QUHu`M}zE~e9;O;
zLqYzt-Z^v-@d&QGeB1JO1$3c@Q5O&whP`k>&pX-Y71V{IQ<s<bp!|IKw&dpLm$lym
zG&*%5FUN9~J61;No+XfmqE#2AIBrx2M~x*1a)qR!pa7z|+`Pc@NP@ZkW#RX~B<O!U
zQPHd&3+{|##ul6v*oA@sXvysdF1qMDTGBYYtn|bGV)KWxGf1u=1cB(4MpV@MUo71w
z8-Xmk>aVFO{URW|{*8aI6r(#EC6@23i(VW5cQ2ndAYR12_&c_Y8ALL!TyJk15Xq~9
z&Fk<k*wNzjOzFelvuRiUcX6`k&h_RsS1!*N`}6UU(8!`kBEhiv<V9C5p%?r^{lDHx
zUjLj5Y`yq)DTSCp(j74&L!w(OThua6frY}<*z;wLP&s3cPTD4C%9Cm37JBGE6r*-h
z2`L(M^^~G*1@N#R`VW?a@`4D*nJrgkRhJ4{9-dQhNa1Mh>gcrsg?1Ev#P*08fmP(o
zHj!kto^i=Xfjn#vtY>3`I6~Zm|9o#n7^<)swudGJ?k4hkoPQ2}SJoB3>!FF3-GD56
zw00F;vT?<Id610mENB}wIzJzlTz~=|*dESkM}YfLqJtHR>aEG8`23ajq6cW~Ph&^I
z#c5^pivJ27Ld}p5I8~j@S6*_(w*(dtYvdEr%f}JtQ4}d$DpCX*5DCNtV8HXPlN7Cv
zGQz(j2?!aHQGbghmf=O^Mj7JYe_cX9l$~3S#2^d=uLOjLegBKCi=WjrM2auKM5Dxj
z-PQd+PbKfD5Pmbu0c&{%gf|fhRa{^P_TA)Od|LXwDz4wJvy(-O<Jz#R5sPOidlNSx
zP}{kabnkATp26&GNz)d`oA`k^z#yTzJbCIQy0mG_<lv!y8ZXUB^?C}mHxUX|LUbmb
z+YO&w{+LX`HA$nLgKjz7^f*J|Jj2?XH3cGgVcgng?vJH2)z(A+8A0a0k5K9EuO4^M
zQBO5+28cJ&3001<UU&Pjm&^8+V&YAtLT&picZ`FHlfA5-DYjw>RN}4@Wh>TzOuQ*Q
zGhDohClCVIsNmSK^yTx@+V5YG>Gp|-V_(mlan-%}-FYhG-ozFN`vfmUmGK>+#5oE;
zhUzz$@n>xLbt@kl{BRV4`DOX{$9EZkHVlH|sEaAxx=n90^u396XuBn?I)D|UdYx}g
zhLAT^4sCpqd|BAMqX=Xec5^xB;tIyZwi41+PM+FRq3$N)p%U8#y3)qLuRoU!DFw;z
z(eEE+=a%F!2m`?@0p{Vk|HW3#{zOJeSr<^b2ti0_raia^3pu+<Bbqq(OXf`1!@UcI
zSS=Js?exZ1N+5r``Jn<7eNjp8QH5aOB%_bN^&pzy-aKe^Ek&}I6pmhw16Ek%1;duR
z|9lm>evSNDh|*4kxXu(j?|kPbOyoH^3YdkyXjw36I~lKf6Z*$zdo&+U6ce`Pm;u>I
z8STA_L-QfQ6&Qln?$LttWTk$`&o<G;>#}|NfFrtsCQ(LsuQJ{2K28C);+%%P2BDP+
z?c|&EZ3n(mWz-h!5v5k-_FUBq>(77A;%SJgjH+Lb|J5f9SG!@M?CL>IRwk*bI{D_p
zU3oxVZ;1bn)y}B;<;;QFUH5c)8JC@a^Ihogt6jZ*vu$t0UM>9`zE{eq`sLVPb?%{N
zcoikoNMv;P@?%1vFk~0;+Bf<uh}|=>y?m4E*#0_KN01sMgpA5u&KGEpsag#&wt;JK
zo6V@T<)~lq#4I7tZ8ubccc6@(T7E!i6W*yeyB$vt+rmG}&LxRq7=)o$@;~AJ7c0+Q
zVMtn5*)bm5Q6LEE8#@D0mL3GNn>-B*(Gs{}hq0gENJ|f5K7t8I<dyHag5VhdY*wos
z6B!C0eRw2kB{TRe#`udXUGX-Z4Y>**IfEnZ@J|?8xL)|Nz^E4&I`g(SD{`O(ebt;2
zx=|bd1b#V1V=9dcORen5ZW#JSXK=)jf-0pp1Ql8lceEcF7%`ln))#)KxISRi5`@m6
zh+zaZ&9JrJo@DZK{1y25TX4{UFw+4=%9?!ympX$_h7i=5xL^iKD;x1*`*G;!8)7&?
z2<B<&LN%tx={g&&WX5mh@cUA*t_u}tD(z_98SLwa3N)%*+wDv1$!Oh~U&&&HfapE$
zRx)N7)xVG#<U2S)nw>E)te{<nmr##mzZ|8lBDdT_K|*w1;%|3mvRC@~KUUEi#k`v=
z-c=tOJcF#35>ytS0bIwou#W2t#=&29#d?3CKY(sWg-7N#JTu-amJx(+$68DCRn1tX
z`#bn!0QW=Lxg}W)f<Saj(fDHj8yk-Eh2X8Q0V;)tmvr}G+oZ@U^fZwEIr=uWn+dI!
z1_-*{XV;Z2zzp*~lQC_9)TpoP3F4LFFgda5`ysY=tP_t>E8A|5xF0eDG8M}K#3-?A
zAGzmro+2DJg^cY(hHs(xiavl=uR)!YfoqDD{;Ffb+EJliDB^EOCPcMUh;MBHZ0(!6
z*EfxA-y^Hl{nDiSZYl;i1ZR*XGl)v*hlF&0K@w;i$wT8e+xH82$bPAp+6MWd1~UEa
z&cHRLpCq%i2U_jCFwI6^o(WRj&RjRNq65F3u+s!zp4mhbtNg_%8)0{3xMm6BNd~Yf
zmJ6tCGDtW_G-i2y*4Xxs^Bh*CaH3-ZMbdhLOP;}Nidg`n?;lljLxUxtd^7#S-xjgS
zi(*5yqm|*}U<Ohthw4}7fvz)|LX}y*n7;ekF8*vHFkW#4*01H$dj_p3cJXJ^DawBv
z0&e~NV*BoGBmBj9uJpF{Zjlz7fmc$6w;==4K=Mb~nH@<Kf>1Q2=LV90V#9e~gVJ41
z0v2T{pxkANH{SjrSz>qCm9itzTBv!V(l<@5o?Xe(hiec5;*4O!hajKa{Z54eY7!|X
zIz4|Ij0)PpB<j*%M$iEo4^Va$Kiae3cy^rhDsk__RZ)P1Gs8^tNU2yx-!I;J7z7WL
zFf{2+D&$fNu3wF3WaCR78o^Hse~wyD5CP9gl%k~Xo#c`V`_qCD&=`~Pih%K#u6HJ>
zkTXrAt^4a>U`UE-_E@cuCoSjz;pW-;LfLpHSeAV0FWVhPAc)0y)Sk|*wWM{ZFego8
zjr5ca!*+ohOwM+NH)$Gcq?a0RM&8NfJ#WgF{<0(Ci>EO`0Kejog*AU%`(q|KRe&Jy
zA{n!%%yXKG!C+xa4rI?pTn-O3{B5!tJWAE(fcAKANi(Hg(Jhnb4!u%wBDe<{Qk#!r
z8rD~KEh~i~qI*1fa~q9fxq4D`MyW7Fe2=#~eAO9M{%(vbtVY}aZ>3*Gd8x*@Sk8F|
z{n8HqD7&^K2|^HdC4511|BEeQKXy^O3oel9Qjsu*kcQ>}ZAG?E(lAckFHu<<46aYm
zuEP?*%?u`C?BN+Zm99pOsvaL3kI|djrLEhVRPOF5>A`$mB2PC~qVahEE1iuR^*l>E
zbVAaEK{a#O?{`%c^DI2DG^6r!;s;XDuX`DlJjUbITLr+?_=K+Hg(%~Ji7zBncu$ql
zGRPkv9RiYJ><K0{JlHP>u#$74hKI@Ll1=zj!{}*bus=33yoSJHz>0W+NMoKyq>>h*
z`%g16f;MtvuJgtLOO2iy^g9@wx?lqd!SuP(m3$DiJ8+j2H~V6^pk2PXAevO#ynoQY
zY^2qAN&hwQ->~zkMu~Q75k}W1BF74+=ZqPxVE-eo8KAdKQ=(0bKAwfw$Y!Skj((RL
zNlWWHw=Nxlk<Ej@>TckLZce2j*YPpvGWvwI?h?*nf2>P%;Id-@YZ6TH<4XZq=oD27
zf*lkykkF!-W?32FkJbK*z#q!4APHg+gnbDWr2PM5OSn<&jvV&NIM_8PAqo9u-$~kd
zDMGjDkdfJ0b*2XxW{G`!c|jQXF824rv&fHM@w~)lSki`+MM3k%l&Ddb_*rN%O~2rY
z<IFmod7VK~qnE&sC|qFhj^xG2Q)6>y-C2Jt4m_CZ;(AcZ$;Pau(cqW5{er{MCRnW;
zlD#{jCHq3i(CLTWgf!?);6Is8*GH2FKbT7KI-o$u65S{<b|yI(q7(Vx|6Vh#opfX$
zcZ<#}X2KsjEm~U%$*NledL$Opc%W9-;2rGBbREC@%SK;0WH{(9_V>bH9$pxTf&sk)
zPsn-|)Rhi0CdLk9MjTHJ7=oHyPpRF(n?%`R2S{|Y6l#G}?m~Zmfr+yN*$_`PfusvI
zT}{dE;7wxfcnt&YoS4^6jLx;*#Qw9H>7{iKUC?zNuy0_ihskc?SyuD$z10yTt}Lu_
zirxXVmzqx~#e11;W7$J`6Z%h9vRtKSg`oz+TI;^u0?NeQfjlx?At?A)xyb%ec1A}K
zgCG!XDFTA_-`KJKf#fDMz}%U@5`C<Q+)>E@?!e}e;j+d0%r9ZzSArwcIu{zW<Fd!}
zDf0VLaME=&4R8kaj4Ad(wWGb9=bVX|%=LQ!@ES$7cl0-5I}_(LMiXS$EIv!MBfy+2
zof%Mu;Zple1x2DAHA_xD-c))&;$0do)?!mzTXGh$onzSffFYF4PtkE}N6sR&ql9E6
zOxk#pIf@F{lC#L|;O<gSCcx~Q$NCid^%a-6pTju52Zd?=MCT1=Xh$dmx`UZ)^}Yd(
zv5b8`OX~<_M0fVt^22G+xz*wh-O)11R_ngnIFZ~_3Xs@?cN9Ug**dTTIj_pL^;{}!
zodTQi9c<+=gSv(t;1#)3tP;EfNZ$VnuCOsH($b{$3P#&l^1f$dJ`>gtSL99+lw=x<
zZ)-Em?|C`7^WA3WS4aOI7z3^25)aF?f|asPg^m6_m_K@8V8~~b=Wf-kQ(+^!BQP^^
zX&FEqi0?x6XN31h*|i-(5Q4Cle6G-cV@LS8iLyJ=0Jr0u31Uow+RT@8HYbJVk9tmK
zSQ#)O_a4M&E*$tU{)z6IBm*Yo-BaC#0Ovk<JOy_Mk{a@mY^Tc{t$L~oJjG9rmkdzN
zP2%c?J+P1|TBFMk$pF>v+M}4+*=H9-I2c{Fo9Z9ChqvbAucVFD*5UF14MF0&NxB1(
zKkk+%9`9?kBpDEVI4lT^0A<jU;C*LY`h7ii$DW36dv^6?-l+4D3=pzo58`d5!`1~e
z(%>RNGFZiaJp-9c)wQ*5uXX;zGg!rLJ;U>SYQZB<IR5sV+V4A)&3X*G?MT+)jba^2
z(6LEs=)VPdb#RXX3Y<#==8+7@l7OcgE~?LaRQgGml4>(azJrt&43ppuElsW}zb*%f
zcM9V0hTraqJD8kUk|Bo0WH~UuM2bN1AL%!>-<O1Qy!0`c!YC7_alw#EGps}M9XRM1
zwpz#2blsNz`0PQ3yv37|q0^Q21hq4)^Ox`ZD7&H~ia`*zl4y&t|6-5uzChY53vgbm
zL?9-vo9nhDc0Ym5XaVusYQ{wV4$E!X1zPzq96V2?cJORR2U^{*u7}WtRF%B8S}~Eo
zb6MJ6mP6-d7(a`z-GQ^6uCU5hfuJ9V;c~I=4xT0c&cu718&YnD7o!+kXa{l<eP?=4
z0@k)VWEIt4$7ESY;_rZ(3;)Qup`&wz?!Z~{@Y*mq8t!;mH0rejW|Elac6+c24W`hr
zN~ABbpHGfNG4(&c!CMe~{>Kj5NK#VAJ6#kEV#NZTrHFPicO>tq*HAZf@mZ~0xWB}H
z*&-1p?WjZ40)lxJg;850XGy0LR%{HV5=?PZXc`?*h}<2*2nXF)OR`+FsA#k%07;0)
zb~eGQ7@XyGS{zLp9bC|7zCao1Wtl6oIIZ3g>^bFY6^rbkfQGT8U7MCGkb?cf-$K7E
zI~+l$4&#NBA~6+zu7d)Js{`jubfMwT!e0WvEPAIG`2$4_krxdIoKtud{iE#Mk}L*6
zAiAXxACdiUY&h2Zpu`(C&_xl9icR;=sNEH^F_d-TPBXoOx9wc6%=V({+m>}$p#WU&
z-P<z8e*JZbXY9ZM8dFTts?W|N?Gw1Xf{VW|6=9U(LH}h}4l(e=<|W>%tJ2)*ockc$
z)Nj~_toQ-u3V{v{{La95uy~$K;NH~${wc<-$W=*Hh9iUB7HqnJ=*&XU3*sKBr1ZmI
zZ=~vCk-fT6zJ{Vmqjmpun#sV@%V|h?=<G)GC=%pXQ<3Ys&U>3Q@S;_=mbN6uxK%uB
z$9{K6c6ZKBciU&vBr(OU;#oVwGZ6NqwU!<<bVBU+!tkseVUa_V#eATAgMQ7ol*M@g
z&ne!>7*7kfvBZeDf%}zM9%y>VjRu+_A@U(5j<_?XC4wD6?AEb6fZUQ8J~wE0akLGr
zA}!j-wC5RLpbugDSuBA+a{arkeGB{WDaTUY1?DMQV>+Vpu9=+p$z{7pTUlGg4>!mF
zJF)%BB=7uDc5XQqgdh;z(iNrA{cmhIeht2&Nq-YUt2`{L{sG548Tj5Qf@<|@>%1hf
zh}}v3x=?60xRP9~?x!RcmADdOA`In!A7s6Ej_?0wRN{i0P^=?hC><8YUoxb`?h#ee
z3}!&V8s1nw#6(B8{QyMyu(k<zzc#&(NTl2muEqTnWUf;e0eMO55=CaQtf@yl>y6<<
zJVNKFT2MUTZF^O_bNUdFHc)4yuO!L_k~XjHmn@%06-(`e{G@x!i|4LO>wC}hfN}l#
z;q6PrxU`xFe@R}l{J^`@yc)LbTi&B%^PGQad;dE}5D(3y6%N7A(v|6bOa=^(`^#4m
zwyL$YY4^xWeUb+*bi|38bz)w|#O=oTAuQoy(sz48>KH&mp4umQsUUL5myl(DA7e|H
zlon1ul@K{RUj6_s6;y4Y6KGd%AAV*mV+)#7-uG$cMfzMs$V+_^0X%Rn8VjVrq&Cx^
zEN$<DGD3I&O`)p<`@G#bzK=?gagM9JZ1T0;{wTYmBMU+h){+9E_TShM?+bBnE)6iw
z?pqR`Br&T8X9$Yv<=hN!9JnAL^ZhZIF~$>7-7fv;@mdXng`9JFRA=~)jZ0q<gTpq6
zzE+ucgdsmEg)8`;O#~1_(j)yph5vYw`JWzx-BC1k>u{faJPwAOTpK)XA@&HgCwN5t
z{V^zSmwed(I^df=bd{WK>B1o9xKi2SjJ?d4W1V(9`UwS?X^96!6G636*AR1Fp0_f1
znIgCp!9;@invQ$@`oSv&mnnfu;fLzGPk&@Jd{q8^Ajwpq?UR}zxCb7EJ}3i}*>@*C
zaX7d@@(P_or6$Ut+3;N3Wu5$Z^{ul4yi#zMleYvCNk0?!R;#5Mz)7|{K^<VSdOQW1
z%*QCA6yRLTJ3+dU8aAN%DJuwF8A$N^`Xf$m*h|BO?c>-?&-Q+aS<b!`Y)hBb%1qNv
zt~(uLc7W_Ls%!NvGJQ2W?zD+~ofZTT3ZGJ#X{*_B$9@-~&%#Zyi|n5^0zZ_U+YQAa
z3`18UkQVO#i(Q}o1!zSUh$_^)9eZmyBt{jh!;5u<mwP`k{QlET+FBK%Uc|4c+1DYX
zXTs^EtY!3kKs~MtKIjwEAD=xYke-6K(j(d^Dp}Xy<e9)106Ud=E;p~xq>Ysi!aNiA
zBHd1JK*H4=DCm{NSv(V&0$j&9IY*VRG&%T++%``Ys{yT}v;u;T-E5URu4qg1OlS&l
z9VD34GjR`sfVQtas;7$89&ebH7FE6bO=IKr(D?hSOvhR57Vt?1J)41=XM$=#>?kxT
zV8e0LVRH2o%O7tNlH=tM(?o;DY`dED)D~`1)Vldoo-wz|sJfYSdnO+&oI3z#satQ5
z^J~%SnVc}8b~^gM!+w>5xZh{S-``~fFrB)9t8i%2nx1FVl4aNmYy|H#nuAVaFUC6i
z$o9vF2lrH%WntS9>tf5ddQc{*jo_VBt`{_yLx16}Do(K@SU~Q`xIHUjHk5U2#`Gy}
z1e-Lq<n~^nh+q%3xl*tUIfDHuJA)*KK@b3bNgx{e|HsNEC)8=nq1V)diYV+ZO08~#
z^&cxp-;>MlPk$NsVj*C1Hx56hyS`AR0!NUUv>-GdSu>60f1MKH3c*0UrQ%4k$qPTK
zA1;o2DOK=9J*NkjhhgLihn_nrp%KKh(U}VWSe^K@O}0}+1&kn`gJ!?DB>_bnNz~y6
zvzMa%V$ho4U<MZIm@W6-CL<Lzf-L^5*a9!M!$}R&=_#~AN07yyMXk_7%65%EIlSQZ
zQs7Jg9&Rz={tgPf?!yyTg}or2;gL`-B4jw;r5&{*6^?;qeb$Y%!yI3Vk3&7QR9FL=
z?OBgc(1a@!o<sK}zE>iTCV>_#5lRz;R>U}p@A0^T8qj3WqUe{iES=40DEB4>slW!b
z<vN0aMn<@Bq;N?0oN81OA8nab$2}wa61@4j&6EmkK-;1u=r=e}jg+O2L&Plc05n5+
zT4b(f9F=7k5=eywpc%;%i48NmKeW#A&xgMZd1fxJG^d8eUYW}BWvdK1^@GH|7rS=+
z#&|mvK9pTsvc(_>+Y+W~b^jZ?iTycLdPg=uosJ@49tWYn7hSx!I%~_iz;#S1HRuB~
z)Ot7rErA^_<Hf@RkNs)5XZkc0-(W%(1YEatr}>es=E+d@;bA>2blMbQXv%IVI_fR8
z@ak!CrYv=fg}9>!GGYL5pq@2!y=+tsz(xen%J_yexa%%ut0Vq+t4nKnuX-{{18}e&
zwIFTWD(vspqQ~-#7yyc&zMABpu_UMMDkqWuIXAD~66#HdlwvEB>;9COA?yQg=p(6K
zK|DLNUkl(G8NxoCgBFviI&Qh^6!A`uLVs@)C&=>@Q>($@2X@t*k`V)dhxF9h<tO&w
zQpdJOGD-mOfF9)!7V}~_O4!+sVt?<F7o<lxIFZP?Lt3!x%$)$QF(Ao$y;@G0&jn3<
z#)(`+araN4*IIjQh<i{LXCw>&k49&D<;7rQp(%nneM-Ur9@eA8Cuml$Vq@>B4ke>v
z0FUcw#?#IeWs=e5O?edi`;T8Q1xc1t_rjNmk~{+_-;a*LA7y8d>@W<%&@06<aq#^w
z_Idd$O4<p_ZfGVG8xTTz@#wjHW!1!^us5cRL+^tBc=nmE6h&Jc6|!qveJh>RkZC<k
z5wEC>>2TJlr>Bz`GNp&{dtBXOg<y~KP2}&NU{>XsP^V#PEWq^#?7O4Apbs-GXQU%Q
z0%Pf-)~_A)1$~%lF>06w>>dAbJpeKt^YI9k^Cffa0e~K-XjNZajgA6?EDuT8(b94;
z-YK<UM}0w-vn7rg2nzY~r%Tp5NRpB&&o~f=Mv!)6h**zgM|?p^mFKugPC`fgbUaS<
zCiai#PADupx{#b`SI;MStt0Iq%R3_X1qHOR#;yZVZ?z1W(Gx${buYjkMTvEEG#zBA
zpFIBMpmr1}^9hsoR#q_2-X?Gz7>;0hdKKZi(J>s4;Q2&G`-F)ZE)q+%IO%9n=!4M1
zb|0csJC4t+n{pk)@ra$8N~|_mMiJnbeAmLeBXprNC(6s<NFTSs$*i?WOXos~&_lfq
zWztXt)~w%lBb)tEc1F1pgCG>$l7bc8|HdAtA1^~?CS?P}m{ve9=gOy`=S`p=YYhJ%
z11D<&Wa26<X~s(M2?+?E=0&hK2MQ#@s~t<)$O?TzqJ)RX?4gQO1K?;<Kb7zk5@kHi
z4-fC%J;mTOu8GuZ?b61?2@#v{G7xJpYkLN-&@Ch?c@Q3XZ!;K)xb#)z@0${ZJc6tH
zVqg6HI2EZCwuM9r5A4-tsBKK)MC>=Qzwh>Z$X!7_Hg5xA*!SehtAe+XAn3WBOg#Ax
zJSA-G^8~3dC?sfllwOjm!3zdZHb*k3ASfi5XpPSOj&BO7Y-S%|De(pb&oyw2?{lc<
z8cXICDsT%42p%u8SEJCx=_Ik|>Ls*=1WgaB1o0noa#5E(eC|@}jTj!?5Jwd!RYA*n
zl&lqShC~bx`YHJ0xAj-zx0}ZPvG5>x?YC<lvRAVNa@{Lf4tcm}sR4fT{4iVAq3%-Z
zwdWhiUX0@C&~YX8a0SdEc15pNqybo@izm0_uA~Cy5StN#a<!>U1q-%||B?PEJJ)0l
zA{dBniD1Zj?*8|1bNu>*QIidHDaOR(=)P)S#<F`0%z<04D7)32x|WE4hB&TAo9(Z$
zrR}z*EITiL6u*q;x^(5>tH9^OJJsDtO+xk@GM3qy(u~dkNmufF_WC0ce-8O2d%g%=
z+UXXn&m`gO*Ej7z56z4evX$e>+4PAqSFPi4?S9mLAHNmk$=HeDML|a9C*k)lS=X=N
z6E+7Y=8$&8P9o+X;us#Xg{(qm0%RW2^JG(xRA2}3q{#;f%oD$pbeN8jLOGoC0B$o@
z62$r>b6A(Zs9(lYoqQX%VpCvMGJ`+LzmDo^#*-+KY=YaUPs{tSBvLJ%6;H+N%t~e9
zoTrV$m_|z48l(m905;j7HMH%fO-J$fPFEM_W4p;BSUY25d=QTmHHY-@CR=zA@$hcA
zoMuv_tU0E~zQ$_Z-Z4qh{_MfN67s<iNA<u6H{u9}Er06a0!<=L7^2;0J>f_y*c@<=
z`$hZG^x+72R`?BXq?`{i=ktdB@1L@3%YhgKfmf;w*zWx=wv5SsOmG{y05Oz`$~=x&
zF327#0cSDN^V2B>RAV>V1uk`k%_hMkc<x(Q5#rhg{+kjgtS6J4U5>h}n7$coTSu+}
z3hVJ8Dkz%;?pdbs))K3LV0wZaKLpnFwy=7wqb31S=pjlYuiS$g#w6|3R7WSYSWhB<
z(`73CEafvl3H_1}@t(Z+^|EQ+c{lbrTlPzZsL2+m@VR^EQE+VFG1k$*fI@m`kxRb4
zn=c~XN$8i92x(+q8IZS;n_YPmyU}<cpdMR8csgPe|BAEF|FbQio`@Nq*FTc9!);R~
zPiNVJA0R?)Jv%-zy#6$wPGCh3WOV=p951Wf+T=T$2^fkWpa&aY!j{_C=AzS49>7q9
z9c9}{dd%bfRorE)BMyL}qRYWYf*=>(sg_zwq(idDxK&w=Ct>1@Npzkkkza~W6ke(S
zLyw@`rp6}Ioo#h|)X>s6cQ=}vZ}8F9;iyBvJjBmaO6;K@vDeD$Y)(HY&zG_@%5fNk
zf#{V|j|s{BFSdSJ^~0D}wbXA^5ikbLym?0j9~2K_ntW_-BON2Tl9C5QX;f+h0O_W>
z$*omDa<<k(M?Iq8T@NLpPIae%q-ZT9x^bLGF}$O1t;?fRKvJ$2DRev(^O!MJ$qv@?
zr^^;^2ucJ*d%PXT;ahf0$DuA;9(hg&6GL)swA}SM&^mr^*@7ED?*!KcKV>C5Y{&jG
zEvZ{Ypc`vXXy^Uf)a;I#Tq#-$hm(y#e4*_^nXF^@Rtnb|sMJo65_QGJvWiEoW6D-i
z@xZpe#kGmVPu~pPsZmM7<F7{-?1+!F;V*25{@mv%;Ra&6pA!yx^uoK7repY)M&>WT
z5yy3FbG!aJPu)sf9@6OUF$GwF2#d1iJ9cs<G7nK^cl=`3qnwo5+Od->VR@h|3tsyL
zm15Jbb`0fGIw1eONw9Y9NeuaA=+7&}S7O$|WtGiNeq8zA9Z$KEg6Dv|z^A?E^g3>*
z_GKOqP0oCwkaVt0bwWCxZ~4-$J`faQcsUvB$bXcbOR@tY2t~KliXYtn#vaEvNFgTG
z%rdgNh@vR>+{~=@G#-p0>0nf=@qi<TX`NA&%i*cjny?B1tIZWZJCpgmq1FR+X0ypg
z-xv*jGx(2~_&w4J4jzOj#5VgK*G)#4Egs49D44)$+l-x6@U@L`$>hJIg-5j_6kcFi
zdyDwx+EN8-KOi8G3qXgB{-JArhR!5F*TZ8Q0TSVYDJ*o;a8k>No5gkTbh<7}<v|;h
z=}SN~6%g+VJ1s+D1EV}PUnXHDy*egOTe`1Eh7CK{<wTNFHj8WOv2Wcod!i_x8l#<&
z9*b+~sgKnjv!IwM(LSnXw87%qd1$hs0ZU*P#qy(<R5ZMCI#Q?YrZTK(x?GNAWXIwg
zdA6@PU%r%=iugBXB)l??M-bF4qgXD1K7Y9g&8Tc;9F7E7Fcti+>NZn;HTd_CAEsI`
zD|@Th0)eKEMMzJjZx83ek8ap3>=u}7STf1m<9TfT|Lc6})1L8e=pRAxyQQKZoRl~m
ztYWKB{jLxGqwGv_7zSY|dZmOPFuDK5>c`IDO7Xf<8oBiV{zLZgu{8!nhv6^#A6?n2
zmqz1Fr^j2QPgBFkKrgc+IaF5o$J&H?Fk|w=YWLJsv*XxTp&x5RoZYej>z;+e|2+vx
zrGQ(+*|9`~Q*hyekW}zqx+1XMFyzLY-CH~)s3Rs7^06%DCPF%c&Cn9%N)Aya^092&
zQ34SJ^m#8y5S?4fl9jrmT#tNEHiT;1G*+O;4_aY2E8=?Kf4=itK-2b~LME-kK~}`|
zFsiM)6INqya=%uhAuHl~9`rohTzJ@PwB*GrO(?>8JpKcDT#zwpC*rP^sL0w-J-W@$
z+z>*&o@aQL3Kv-s)I(zSrKBU4sOKeHg)yw?v4!(2YHOZAYsxyKQmN#d!xnBF2GO2R
zo^Q|oAMv^Q#2R-T-mbw-C#U)fuUFA#%WEwBSVP@~<LvzM?EiIT#^jvnvW_LMac8^A
z3Tapo=ktIY=-wsJavW#&RC+|j_&jJodq@Dn`?n+^`8ehOC_A_0hG7tjZV3w<%lqG0
z?{PYlL86_o0X}R52;IkT@I2Sz=`eM*SFKUCEfS^GfHJ@*@QNN7BTSxP_TU{xvfm3r
zeLVI-$BSIqL8YTZ8}_8u!+J2>(IUlwpa|Wm;YqAVwfn>`!r3IxV!-Nfdp)c5+-$3^
zAh|KBD86>54&JdaJPs_CH0Hlit6S_&9n83%Q|BD&1^@H&T>FXKse&2O!(Iv`(t#y+
zp-??KEK|>b9yIeX4OVI^d*(Nh|2{TJrpKNccDf(_#;$DJhz^C-7o8p;Jd?$hX-p}Q
zARV4**n&^TRa8-tp{gE8u1=wf1n7aCeJR0>NxTpo86661Bs>q^Edvyb@y<|OVmlPm
zNPr#?#ip);fB3$_o1J&A$of13^-y)+xZ|8&)Tj=9HEhAAyN)}SysnY6_>V2?@UYh+
zcds^s-H*Xp-{;H@fi<!Tmp`3Svmj3-g~`R}a7@D%NxRANN9h;T!0%%JliaCMLI6;|
zL1hTN>LPffyhirm(vjp|uSxcYvNJo97=(dnN?2+P&Ofo$^Lz=InpFZ6g)yi_AFn~-
z|Hl6QHFF3T9FsXaVScg4o9%7FiXK!sgo{jDG{aK?)ckX8{2u)KnrC)T+zEKB1=z>W
zR(|+DM`h~i_q@p`h@CPBM`*j^-YU9HWqJ?EAN>=9<f9#~hmw?2nc>sph!sJVgICwX
zn{GvHsm$;Rv~Uwhq}QGF@L*CAEGkEF5rP~b3I^CbmV*^tp_V8vLgt)+=%~SUct$Ge
z3YB<1PO<jHoT+C|;I*PE)MDD>f}Yf3bC165z>1_$iRbe&j2}AHff@Ez+vBCx@a&di
zjT4E=ZEWUWR?#YIG3<$15A<i3Cdpy@dQ^^BTPj#Yt#nNS4f~<#Q&RmYg>X^$80K@1
z-R6c^E0RB1HkzERcL;2gMBT&AyGxT!lmeVJ0$K)ICo*uaAS#MKSth^+wwV{%&APUP
zZ!4v6Yl+~35QkN(1M%)X(b_74KP^^00V<<z;1SRunjY4>a<Y21(87J?!gQ+PQoj!E
zA6?rYW#@KeK?nlTl-7&*$Um{=So?7iXI2vEvMdx7y89N|Rj>^fmQ~mM%SilukQ8OE
zx)~qa?}Di<5^gKwXaLV#+TTMyH$X3|bXHpw!?WQ*)bWUrfStLaz1fy<?hq%lGUt%A
zB*m7i-fT+>x@WowZR2x^{k$d9VPlnD44VRK9I!LFrEcQ`R!%l*>|t-QPe9IO0B^KK
zq#++$?JiY`p7KZR=N;LMwg&y>(a{m3Y(4BrCckV}TecHIFLbGVi5?D0rlnXnt1ZkN
zrp0#S^R>y{(qA^lYi3zkTA@&9V?OBwp2=W-z^AmObwh&ee~QHaW4|oif4d6yeXwS@
znqnYkGMFFkQPei*Ea1OdCDhoGq2N_N+ry9yJmg_DHb!9)JCkKLeV!#jI^f*nr8~p_
zxnu}(Rk!@ekOB&S*l7R62GkM!ImUH+N;am(i@nE`{@*3~W2mS<pA7{TJg#}(^b>j}
zk!jsnDDaZ;#q1jHtPJ_?m$GY1Vi*L0S4sqw-2Y<Twf!hcGT{Q$v4)54L!<B3k3{5+
z`UdCTq)EvwTBGq6C0Ho`N?6sE5W%HH?o*3{WXFdy-7lN9;mOJ?^(O*-i0($opSB1*
z<F8^r>`JuWYIC@utD)O?7y5Qj7NCz#oB}#}>&Pto<(E|GgSr5H_~1V9-J?&l%#B(q
z1VUYKK75TFUz4okvVFdm5`|FzaXzmi-S2RK^<cIbWbhJ-l&ES*g)pc=qh}J#+`k&3
zgluf}y~66#AkxEpYE(yI%SN@D{wDUro{Ye7L7qOEWBxsO*RbckN+k;_Js1sm)!MvI
z{oXf$9~K?ESNsx%FAP(AHqulmgBm1y#1Fa=G*ouYRH@U@_a`|@^zga`rO{E^2-e@%
zU7;gtwB90+na2cCuPfm#NXf!kNA$tNABZ!J<^fxh<c<o}QKLl9sf`w{=mW+2UL7k`
zM_mPahS058`KaLgnkyA%k>{b#E;?2|QH%siDkV2zjW8ZNY1HDhv*@~T&OVe~*^$LC
z2x}=Z7?b`RTPgd+k)5Rh#*@eWB=Ku}QUxN6M|lj609fj$c*T6Rw!eci!gvra8^g`3
z4*q_ZVti6z5{idul|Sae9FMN2^sN&*rN)z6ynBxEnsi?3;MUP>!l%?I)kF3&6$JSw
zh&6CbnUEeeD)k`H_u<t`%<#PHRlmt33kIPcl<`}5TaK7U`Iq5uFNsP$X!*`oHaT#X
zyDlwdLV8rUcniT`oO+vX=8cz3IFIUS(c{E0+eX=GpFK%b9#*Yl2+CUw{oSQiaYZJq
zMD<8-Mqxh)4q?PM<F$<X)uhgYVUIeH)H7Ju)r=n#&ZB019wXdnAso-?&Jnf7|9JXJ
zw<i$QBn*=V->iBjluAwVJk*Gy1U<^pZFTJ+qXst0^Y9WDUcE>v$G30ZJxPNR#DlhV
z`$e%1xTjTySZn*cs67ezDz6UT-Vc&(vx1$lDmCGFE-KuZ61hPRT6M!oj!n8eiyKFB
zsNWkaU2sm4?2~Y>js$Du5)%E|`FJw^L)jS}IShkPuqCjJCHLRhvA!=r@t6h}jY1-L
z;jyn*Zj#{Yhv4T&KK6{<R4E;IrAZx3Ck+wSMp>aVItELVG?*@Pnzz^fz$v^R{Sy4;
zRz?yB$inO4`K?W|bnKg!h+ETJ5k0(WTWqtdN#5~TTG-KZpsCZKdYT{ggFHKN;{w<P
z5me^=0BuTO>jVycrT_FTcHC1a?^3%(rZq`h?YvEcu8t-+&Rs{+F;`mH&m-zV6>JOt
z#jRcbbu?+y^k}kk${_u)=AhJ?9do6nNuE>SBQQSYg_Ufo`xcni;wTS(Ja7x3u`aFW
zUY&EtujB)$^Nt%eaBTFtmUYwO7!Q*fURX`QhR0bG{O%k(?&$FgT4;3-s;LhDkB+_4
zG_gdyOz=06uH>3u0>9kHOd=zu99Y`a51VJcW8O4P7A`g-0R{Kx7?pH<3I1~Q^jt!l
zS^p}^ee1{QKl3}Hw*aXzpLziwEa~0xhFYBA@sfU^(=)tM6R?G(wLi+vEy;lpgrZv#
z5!>GX#)jj3Atn{RQ?V%22K7E7hzALiwpf>HD~DVuHa%YVD7P|x-0}AN`Dx%US&k@l
z|2yu}L$)kw-s=@EtM#Y>3!8s>p11AW`eo!VVaE#};5FME)%)6Zc?+p<O|74pI+&Ue
z!)Q#>$dy9Y507=!=zT*jEL$%0TdmMFtslGb-7P(DTli+=cS@`9eC!1BAex{sX4HRs
ze;WJaWNN(c5rL>V6d1Z6d2&`NwJaKLnIUe~(7~9S1(3$B6r6zLX%iV@j`D(<gk9o(
zOGz2W6Am~p)HVQ1X2`f!xTY3ex0+!6<Z+L_i3K?=B{HZ*<E<t>n|-fuR7lb~tZ+f?
z@ZA!hP+X?`>oMEy!gQ7jnyy3P6azk37f9({vQnu!0pHWQp%Dc2vGYKD3A|DsBEV-X
zh-@;w)kFz5cRm%mrbUR4KL0dUWVU5p3PgpjX%XSW>pK7f*b9DYxWrvLlSJ#Swqy}8
zE-~InWP2j5kU=e4Z*dNJ+B^OzyS5{UK@ixIf}r-_*s<IfhGe7xhKc7Pun(BPF;+eE
zCiq9{5_Rw4oMXR0Yj*6hoZin;%QFrWS%>Tjq&{F3_{_ahg@OrJ8w<jos6?1$?wiOT
zX-7Qz8goFiPy0-lj1{V>M2rudhOKbIx!jMFZ(_e6X9W2Wyo7pFi0vo%y9$q0BEknW
z<cR@?lSYzpa*4+((SnQBH&VVaNk@bgs;NW^E}oz|Th(_1+<g=IBkhA%$^Ob!NU8Va
z>Qq>)a=3EwpBo0<OwC{wv()g&Q8t@>WH9a(_}%1DTOrAc9EH=K$&hMYU@H<OsZ%NS
zSU4H`OAMGGew7UIDjZyq9oZafK@kl0j6;*qmD;8OT0j%Hp*A3+-1#Q(`v=j`W1?rZ
ze^|Tn^XV|h6=ts}MSM5jnhhVxpN0J<_WRWd0zNdbwIrwa^3G1NQZNJ3hpdyr-pJ?n
zlz<^hwzm?XKA1nNb8q2}&Ua~l9Hbt6duBA=kVG60Q|cdO=aL&R2m{e8g#=@`|HbOZ
zss^j-D0>z}FvgzG`zd;7%kDi5Oqc`jHSd0*up&veY~9mZ!=AJc{1%JNp3;UKi9heo
z{>JMmF7@{&Rw;64^J7G^0?;O{%@LJb(R!5h&UTphEU5Kyx58N{N8K(x*be_5Cawsw
z@l}Q>Qq;4GqS`!{vmb%lh#(>66dJ{H@jtfasAnGpc{Z2hWBuHddMR?)Jcr5R(PYHZ
z_-1Kee^rr#n`bST<JBI;GKE|5N>)VM=AJ`ek%AK#kD9PwzF?oCt2UpR`8eW`GMXCQ
z=6@Fc<5&L1OQL|0CpHYadeQKhQnxU(e%8VjI|`M6O?=p{v#+SZEwO%#2xI>sTp&3s
zmR3MBk$zye(7#_hQ@haCNOEn<&OLGH;|t`B%P`(+1&LLWYg@MNiT5kogZ*w`!d5J<
zz)!aBp%)S0ur)_pGjv~93IZJ&U4sb0cu+aEF;9W`Qh==;8C@MGf1JDG+G_1S^a=ze
z?$7fY)5`!(I+3lotCFJnhq7x+Vju)zS6T!??tih8?MDZt?Q#KT$5kVbB!6S4r!2<s
z@G?XPR*v^(hfX~`GoIrHCF8fVK>_&QDvBlL9*%74Rz<`yS*IBqx0u><^X0nmND074
zM{p2RvD}^edmH?@-R%aPCIN8kS@0k0vgMhsB0Az|8dM3+;2m`EoM+DXG@20m1%viH
z_ANsA++Df!O@0e(MERyjV>_hq>6VM)@T?{@1Yz;!=Qi)$<5|VWmckYst@=3%2P$rn
z!e^H883tiQ*1K?J#gsvZ7p_^x$6^o4g4G5Y6|PI%A#ZE8<yz3tw0J8AXc9=CPhx-F
z<eGiCR^+gOm>7hN>%3q(w8-IlZO}<*?K0-)Vr@<_GwzVXHP8NBLTFVjGzl3tw*Dme
zk58Z5s3jWIqUgFwH6ziXo@>_gK?*eB!hsnKSw)`W-uk7sX#g9;lz>4>@S={|^0L({
z!zZW|x3aLS7V9D%-n?#eK-Y*15lZMhKd|$O+`vzzY&4775~E`fxG!;-#*^T&CNIj)
zHrHYh1fpBAh}iCbV~=C<ejxUyY=AUM`I4D=vmX1-u@o(7YA?!`be~$myW7U-qsneL
z`cwp$Jk8e<D&00lAKtCp*ZUHMfO;z*d#`+Z+y$~{QVx0d_CNrYZEMB$1~zFAdrThF
zJucqgZ2vfxI2F3kQh_W8s>JJHd{jO>{+~k#<{dId=$8-PQb|PnLeN~T1Y!4vT1CDX
ze-AC&LeS{8h%Xxqeuq=34B|{SX%cUi86OTsF(dWNT0xIn*a-3}6lDnTRNm@0(`34m
zh9pWu!|B6c1cnWAhx?21_XC$W6nZ?M*t1~ip6=w}E0r`9>3y0P76R$=q5<ABzgB?h
zCS%XdH&jXu1c>I14=n-HZIkh$RpB|=%YRgfa-FCZ?6?JrACL-{->Rn~cm8>@U5Vuq
zlPB8Wey8q&ex12z)(QyQqKX$dg~p3|V=8ob$kz&(*?P>MHV{Bz^KGz7dpMN}m7m4^
zAUZ6xPbMm^Q!-_=R-n=r7lazbflIYn=IXcR7vuj?>yNT?OJW!Vq3D)sBsb~)H&%{c
zMQA5%fN>l_(EBK&$NLk34m-6#2#~S!(mTccTkGdZpg+spbPIqp_yk1e6vQFxkfpVu
zfnLk8&u0g;WQXOKYwJ*&wF83uxOxAE=`mAyaq>D9aBgIiA%M9Pn6(N)FYEAwH8-nv
z@7C65$9?&!8JVAH9Tu-FW~5!qkbEHLfF)|W)H+07MNAOI1WqiL7HEm(uR`mPd9~^O
zyliQ|(fk+&fyLT8&mW4oAiwB6s!tI<|D45KXdODQY(vxXz>L1DPi}?XxwYuLim0Fi
z9WjpF8*{AcFm|e7gamnSb*~RMI3mNIME<kvDEc#W^X`e!&*5b}Wq*e$tOyChS3#)f
z+@w*p->sq;F+oToqr!@mi>{(`>(G!DAwdSdc$vz<57Cpzzi-Q6=>-UIg2nJw!n~-T
zDR!sWMoTY-9#YdU2}ln)bf?q?K+ris6_b@TImJNLVmK=xf)1QP4`^n5qh!jrbqLN1
zfS~!I?2K|G2tg=#CGAGg`(JD+_hW-No8bb+m~KJf)oXY{i}(|n+xoku|JiozY=Wg&
z4~#E5*Xc+q+G&lZUc+E8Fo!`{N()yaLmUK}9^l11;ZY`W?Q$TMxG*ATopFO@lb6Fy
z%W_@&^IvnYejZFFx_=_u#XhfH2?_`4#~(Tq9HVSO*d@CvDW~;7{rK|QaG`B*=H5$U
zU(rsh9#aPsZ*u5rp1!U;(jX;6S`9-%12ahls)&Lu7nh|Xp4KoE1cG6r@0^_!?y~L5
z-5uyZ)E_#0B`jXs<raKPmv?~wAX8YjCiZnUJk+OPS&>ew#_majk4I67{?e15A{FJd
z2L6xlcXfo*_{xn;?2wAGSp)xvgBY*!X6F~mQMjUP)`0&JHf!`C!FkFz3xEDA<1mm?
z(cDlZK|_?kzly3^qm`H9c(S&{f`-!NL@HfPjr5-_mtj!U_YSNveSj6ov_}4qCznQ*
zN&x}cdM-P!+_DD(2qcB)#}k((yHri3RDrO=ydD0H{Mw+m{+Go5P<BR15`!QRy^>B4
z&HXR7Jm+JE;BIYSz)GbQM7kfJ)s+~Vq(IKgO#G6I7CYelva}KflNJb9J(JBSqR_k5
zuU4X9k^+s<;7Ufih@9+)@=~%k`(un(d#fTlbhU$|#uRh2=P_Q^-|D%G*TDm#(G&-=
zugA$;QC&tli#uB@)>2da$G#rJ59q-3ZP)OE&N9U!>>2+P8-qDMn{hqL22pIbp4mU>
z{2*xieSv$e=|=IxdSd@XBI{_MH@Ua1R?p0ku7XJcgns?9&6AB2bLfyLj#y6uAmS=R
zsv2mkgPO}EOROgi&};GFL&q3(UR_y<Pe}k2r59>&qs&>S7K37l^@RP2aK}_Ft_)CK
zYd%oyu%1SD*~=m}MZG#9t&GE0OYtdFe_E8+JvO0}5oW0s6uYWt;ZNU%3B!MRiK$yp
ziA}fXm4Rr`pPye{p+8st{lH|&&juKP;RjfGh#^wxo)kaK4(~8h=Zs@sHCCp0U_I%5
zB1q3oc8w&4vZd_3f4NkDC_9rJhG7tjUdea}@%=AWKiUm8je^uQvXE0S{NWc`9o$FQ
z;!s+|^znjI*Gy<fEa|wHtu_{FR|{r<SElz<Z`!5Ex=e`JsPdoPLWZHL&a{h(4mvsI
ztG*W`J2TMLP2~sMin)5rAq*IUbob1;Hw`ZNDl~#<3DDGG?1y~20gtS<4;!<JaOzPW
zGrU?Yn`e8$mvi-KgVDdd3H@;BdvoHRz)!)QL_7Wrsa74n2h;P0f(gKKIWwK81?u2E
z)&uKYAAAR6`X=!IY>4|DjibMsr)EL}K{oEpp`Dn>ssQjBZd+~DccCAS?e#=TL;nQ$
zc(|>-GSD~`Zv|Ze%dH<5MWP!rGdXePv76QL`X3ocG6&DF3?)^?uRvx2yrSSVwFJ$G
zmQ+$al|-<~fLzl$rtN3&OtslCJrh&kff_kZxh=>_rrvCjp4rfSR6rnh#mAfA|I<>-
zF13QgUA2e%89GyN>gG&>7x~q?n)}*$#WnLn(CXbS&5s-f*$-vcc5E>S0(-d?7*sI*
zH+FYD9}Y?~p#jG60iyfpQ?luZohdltDVRbxPJ#rfFK`~76e-o5)(_EvLX~9Px!0q@
zikzu8PUwfwCemg3r@V;ruYq5N?2UqykVEXTa<A9m6**IDyi=D7MfVBgy;{_XWoVry
zo2@0L7&A=GjPoNQ!|F7z@bhytLN2Kk1CI7|CbMq(KBClLq%<v>$QHbdWVnmA8FdlA
zLxUrwo?PGp)-nV@tFoC+mPwK7^OhOB5N9ZWw&8b3J|7r)$1U@gla|&p96;M7e$b(6
zrw%n`WwF!kOYr9;<uN@~u>~u-rbf}>pjKwMdR8|%JZi^|OHqtV{}lOU*xqo~C?<Ce
zvKL37QxFG#OeY@DLv%NtPso|1(#O$YXGn&&;d!uH=tG85!4tJ77<ndLd4-=s6C%n}
zD$XYk(E0h9Ap+V4=Rw{UqCFMsNv_2B68w2VJ)8#@hv^<VaM`45+L6UGEJO1yUi7h5
z%n6R@ob~o4_VZ@(CSGh8>U{d5#E%4<<^KDp?AnqT20`GJstsc9f3fb;FNAcu7hoI`
zQE(r^!gF64jSf}d_Gq^KEu}jPJAXwjHlO@Sl_&*E;V=3D<w2iL6)61OIDwj(i9%uY
zL*0kNoDtv>8h+HnO(6n$M)FMRF_Ib)epuH(k)P9j0C{G(X%ZyuYc@bQg$3wY-3NU-
zZr+<VRdZSWkV^f|-dz{1If&$0BdmFAvXwe`ICpXGkA`G$O3HamUAR&Q?NG&|m(=%}
zg-vm@a-|Mt_b#kFX55tL5BZ?7F%>?VpXxqFophX;cH^$xJWwi(G0*BgNHYN@<{SN#
z*ExhKtSdj<yI#Bkp|7Nyjg`R4jz65caI>d>(#C;2?h4*(V?Xc9B<;f|LP`%BA8pGV
z-4wo+CuJW}6T(kw@Go3Vrloc`iTki0iGLeC>z*~TQb`hw=e?*);^DIODvaDV@Q)>5
z*(Nt=khpiV*>2LI6sbejhoFC>UOa#9CbUwc5`<?2=Zru%Z1OUBHGyCCq3qg{7zRP$
zmDB{6-v46VwLe8^C*%N3CP4(<2Lp$bSE*ZfaZY7}b$;kdZHnNX1rBIaCnap7POS#3
zaFh_hJM0#OW^%QGua?kdtVB^lwC|EYuVmYA!Gl`z-j%8s;5*#Ybvnu&mLn@hk|33f
zCqw{GpUX5;vKS5HtkzbcKLOY74lCbk{Y{a5j+WRe{3JvrpLNC~Q5^aF^fPj$@&y$i
zv63_%a1375t>bf7$VouN3UJv#K2rRne2zZeD%>PQ6(1q21qBqlNAqxh68lefdo+0)
zOO}O`{k$(bI^sO|?;MO1rBnu0wAGIEZ1GfhPw=*}`<7XQmZq-XlUFa@68VOCWu~!b
zkcCno35vohyeIhXJlpO|u521cK9}=b@JgZG^n3&du_?46`(sD4@+*~g)AP|8!4f-Y
zlWB_NvsB9Arsu=mojY4+vW(>;jwiwY{L#5t32;l3UX|oy@p>5jXR1d*AFd)Te^%Su
zB+PasV})o1_ig%<W3FEq=*gjvm5dnS-)r<u*_Gu=5Q4xPz2Ji2{V(>aI++jD?#Ka#
zbO?etwfs?8rW+3tMO6-$*bIlu7C$f2w#cr+q+`wRZ85{)vgqgazz|8P9*+g)-WD?q
zE{n206~9I?4jMztfz6>Q{+2~mA1pbYu#HL+^-V=dGwdykupXsb3o(5pYf~`(Cicf?
z#}^+gme_R$k@RYN4Q4ud)bl~*DYd)`-;&FetJv@L9lg9B%~)>Xg<R($d%iP$d@cvG
zb4)Zk9f=(#P=;V-0o_Bu8|rRSpS$b{Npx@z&>j-mdUbCVM@J8fcFjCEdc^h^)d!US
z%%hRpA@<CC_M+uX|2w*e6CkrcA8UpK<+5lw)60;cL&ta<H<3Rw68V(qP&BZajUK&Q
zZ_O~EJlJ<htEHifpg5@hyUUs!W4|66mlaBYnJ|cmtL<Pqp&5pi2W*cJOsfs&=DA$R
zUF?s1F9s!8;Yrw}zw10G@@s~_<+7-Qpld(mRor|U#==$b_na?2Uf3_SBRA3sBbtZA
zBqoEGRXJ9v`63wSMxN|1)IVisc0?fzLeZAYD(Szm$H|XFz&FwWW@1>PcX@)3OmGYI
z;h)iV$dSiM?+H9Jfep$B;|4qg3W*<WNQN9M7UeTHc4%pv)O`uiG9yE<5{vQ~D53YQ
zC4&}IP^|9MIkA?s2s)#0tyLEKx?gyvITTB)giE9?Vren#{)lACw}tp1YfY<_dI5#-
z)hffU5{vNBYg$FQcs9L$uAo?D2v&07d+tu+G+jERpD&T$-=lT$LNuEetkcg5B4-M$
z1^4ivE<4M){kijzAwY=*_bj+Ly2Y(%Tl0DkVd(dSJdC_pGUy&n^iupw%oIOs<3;bS
zdi(^M(iI($o?7;_(n||a81{%*o-99fXP8w|9WWgikq%+l8M2KGu}Z8`kKTm&qBNOL
z7^v!(*nf`pVHLzs+zNmFZpTX;8Pb*<C?AH0iL{VrBLlsEmznB!pnQOWXvqB?xzykb
zVNVUmR;Q=826|)b3eUg?Vq|z*VvW4Cu?u3WnxJh4TE$`Pz3?Ap=awWf2tv^<83kqb
zzp>%?C(@~~0V-{Z&PDDcF97vG3coJF{|0kg+pbPB@4Ze%7G@#Gi(Qn1SEN4<>{s$a
zwFJL|b<b#XJ;-xxn;6}PUJ;&IaPHyq0eU*GwvCU)fA`P`2?%o&Wqg|V{=eF@qHD90
z=Y#aZ{45;8a*>~$cnN?9o=@MNW#0IhMJAE4T2ake;Q4g)(-R*IdP%<(|9#?ez}Ouq
zPJ#_w_@qB8vN@9z$YT004LS}x!M`u1Urt<3myPM;Hd{6Pkdw!*e0~nY9+Yuy3vY3d
zT3-skJao8>U2s`;DtxoFF)QCT2?mtvu<aq_=)u|k{yWst;2>edgt*ZsxmAN7aDA35
zqCY!{K9Igeo*iB6X!&NVYf1KJdSzga)z&sc)@&(QQT~|*lUTH&h7%=A>6^u`74e^G
zFbOeoD!b#+p^W#J!L3%5bQTyt80axX$UwxB7>a8tPSVamFZTcQL6`x%XC@<CMXG0k
z^V1!WcZ`K8+>`s1SFzqdW#@LoFbqP`mEt%7y#He5_zy#*vH*%&o0sn+1&>C1Uf&QE
zrgzpie|9I8N5Id7L9D#F%(WjLQtVE)jes8n(infP!A7F!Z9B{~i<lpuA7l+PuN~ao
zoVPmkF^dvD)0+ufsCfAytah^<2AM?-pSf437)zk<rvJtMuAGO258Km$8>1hSVs`70
z$V}#;ih;5qVu1e9`IK~0ibR^%<<-t_jn7z1Q{WB{%jEDrz{^m!q`l5!Guxp`+2Q6j
z9xl#+_EDM1y&a~M$)R)SN!!CuPT^I&c<bFdB2nm0lot)OaO55NvpbpO@bf|(WIjys
zsGQ``okSAdyu5_~m*}@#?u<I?@Qq9pxl72{z;LGh6Z!jx);n4NKU)xj%ngS&UB(XQ
z$fAYUjr9XnOaQSKeQbwxWC!er0z*L<fGUgDUR#aN;opT$>4p&cjQmzVN+&}_=#K|n
zwDu?}lv`@G*1s7RK*$~7UW}B756Hz6V}~+j5&HvJ_($2bB}oi|z$+yx*xvtQLtFDP
zAe#*rpe#cHl74JcWUgQBk$g^U70MI>_J^RQL2LWguC0M{Mz7RC@8flCl{<oeER4<I
z$=FjNO#xo7nL9CRW_E&Qvo2pDO#xo7d2W3jI?A0ky;3qaLqPrzu+IOClv3g2>Ihyb
zg#q|u#Y6}5WJ}(qN3X!p5THNQ8dLhmD!~AW2%wZ`Q$WP7(`E+CiXx59j@Xq_j_6Bk
z2{^5Bu3IRnzTO0XICv0n?i2}{_au%+&)Ah>julPrscoWENF16Va#30VuehkS93hvC
z^w;!SD!sx(e=eI*IM{0+n3-L#l=xl<o?gT;(DQ&>)uwoN^uNETll4)mIWGR0u^x?+
zsU{UN8JwY))!4yI?3Cp|R<tUu!pZvV4rc>PYqwQ_@h<ekjr=yyK|XA|_F_V^KlT;A
z7o4!q;06`jyQY6pAODAbNR!|0DVBq4-v(t>PMVrjsAO>1A0Y;S+htlu4@qvMvR7UX
z|I?WrcG(Jh$J!g{L)o<*F${ySm4Y9*?7vtg|FjsIh6Oku2`^hh(IthlX_pt;<A?^g
zbPSX8k>Q&|f7i@`$ru@(<zcoj-K&r7UOBXT(!|iZkfgTI`iO={#juM;Lc+CEeT=lM
z<o}oz(=HmRVu-1Dp`4ALT(p%`<jg^T&^!n#+<x%3SG25^L%Uey$~z&V=t_3!%?j(y
z+(I9+TRBRhWm_;Dvvq~@W^SR+=!Ekl6xpm<OY%n{qncakGxkyv@;rq^#w5loP-l}<
z@sg_7h<piJKw4qanRsLYyudB>sEI8>^J|4mXX23sXrIV=ld*KHCx&mF;R#-RLmrcw
zi1A)mD?~bTC?DSc3&lzszU=kT^v$8wuN&jd5BK0t?i+e$`)7oEkk5<zJ&cfoP05mA
zyOK-;%!ke<gPYv6<lL2fdcb@r`-2IG3g6n|46hYBogFZr-F-B4WLwcXSgvHfV~vk)
zjt6H|syrm#t~A-!j!qS61pgsphA8;NC;!swo3d*=Vi*QtD}_g}z5ilG{^%7$b729F
zqp`p)l0tBadW%FDaxj)%h38)x`yq2Zp6Iv7y!aGioI`gYJ6dxw6lS(R6i$!6iTsds
zRA?s0Sr{eQUfoZjJIx^O`FIKTg9GEX@I#FM#_o{yR@n5B{Z}iL%<T4qnU7?Ls<*<P
z55rFxdx$m$cJIcU(Ep1q(GeP21T=V|Ps+Qr|07^r^bs$L`mJ5z7e%v3yweq;nh*RM
z7wqfdxs*Q=YBhzZ<%5f(k7W?1n|$SpbZ|Sa_y{~Y=Ix~hA61KLcX0cZ@!7%{7uFO_
zt6#E%+i}0gd)dNOb;2&HaO<!RNpGDxJ`Sq1MKQc#-bLOWY?XPCFeaYTAUDQRq}{<k
z31^bQ`x9K2XlnlaIv5oUxuAPBw-E?7c=P+5wYYgpqXjfvAbo&`p)zUaLt2MDxAb^#
z-5y`?L4w|0rjA&L;kNW>l8zugND(~v?)<Ms8T+9sdZ><pN$BXUr10v<W$ECQ9$p5*
zHuOW;xm`;LgHW_3qlAQdZvQ=8cD@FKE@^-@69EmJ$HB4>gKYa0{N<;|fvcZ6rhx+w
zkIR#B%ft#h&m>6SF~L1gVCt6i?h1d-WJaH*zAV)+<7!tDy3(m6h&5wVVapK?vh{v-
zs<6<khr&c9((gPJ4yN9F3Re15u;PNKfH9^rZte0d^z%#j2I;Y-Tip(JM1E5}_T#Q}
z!HDQ-Oa2BI8Xf&?Um`!Jc2w}8lOTqQY`>2EK~_3!gz}syuTNcE22JD<wd5gY{ifB-
zMoy+*qvqT}30mRLSv2D^G%l6V91xH%fnUx#6y((w98>y_2<Lm?=hFyE&E7-MmmX;J
zUC9f$Ld>&>;(@dT1AhYRvgEs=!kx2-;t_VKf_)fHMM)beapx?ecmQ~GyqLY*TLQ__
z3U$sRjE5aIaQ$(~U>lU=U!`s9Z8zyDZ4?a*(UE{2w8Cz)2<H)F4-P9zu@BroA1VYl
z(}=HIYDvfuczMp`232CXS&;H!ZY0c}{U2Duvs^y3fB%%7Q4Yi)2t=>csztf~#g^Co
z64_+u0*$eVEzBGKUiaGX1(yBxvQD2Tljt^2Y98ucSP%gyud4K=;BCI^dA@U)8<mZ?
zhQ}=4r2=^POafTC%kh_Ocpoh*VqCc!b~_(<U*nR;h_M&W;ieFDp8R||T97L~?q5Kv
zs8S6n*UmJC9Z>P*(fW8@#E+*d**1;jA{6f@;&Aa(WyQWI>2@E<)!qRFH|}xc^!zmi
zr1O0qSEE7e=-~`cl48RZkiqAUj*#yl86t_>(P}Y;r1P24k%$p?`l_mp5=ZANk(LzF
zDZt*#`*E=;5S_17g2jIab=kch|L4KKH#+(FFvFCQaFN2}rY<@n3Zdso%`@=De;6!_
z-1CfUC4H}aB0CcO#t(6yqgc0;!gnoCznP?H5!sC~zGsqE5Ix_8JRR(08cG{FmBne7
z5_ppG-~mrBjfQ@kRe&oAJS%w`({$pv;|KAaf*4aUI?q}jlmc<wFTO?(P}F`?ZXe3d
zB}sx11fo~+S6JNtV#9M*BGn<gUS%7WqDYb%Kzkw&WeYTdYR7jo7<VSXIwDUY&EcV*
zVNV#%=h!n*R(;pVzhfhNtG;q#XF{PmvYl`<R34D=LX%)(QsK}!bQ!#@bconCHB+MX
zk_n0G=yp%Rofzp``_WI$oe=#y0_;{@a2#=_8mPXlmi*%o%CvXsuIOWfUwpMO2#&=z
z>xrI;jk~4~-YH|E_&BHigX$gnkMHVeu@#-LzN)fNde5W(z6Yz>Oz*VVZh38g&}M7+
zv;^Rq0e7rB3k5PeN|>!hS@V4h7T~Uwi8g4Vio5gz59peKc02X84@srU);fiwGsejM
zD=qN8J$gQ5L&#b@66kow@bwek^>+<R_-9`h=sn;%%6)$q;QL0k;K&_xF#Fnr+jGK>
z4fLI8fOrP78QN>$U?cbKV?b|3O`#Gibfeo!4_>qGyT^duUTWXcaBZ^9S+vOw@b`Sw
zoqA^x#Zr_;p`!%_bs3puvQvKS;$zF4Tw?V%oY)_S#UEwodILcS0^yc?<M!X!@%iV1
zvKuMj2=R=wz%b*7Hlof=t8qbErFSiA&w_mPP}-J#r@zKT0Ac6h{f{G(wlNFJ1%9W#
zf>74aq$Lu#+huM{>JwJS;+P}4p+C-Jt2mdSSJE@r*D5=Q9RY{DNmSCY&b4XQbC#RP
zA2-`>TrRo!jNf}l=Iyx({(dHw_(Ri1KPS-S=udavs0gN&ZRL_VZb9X2P1y2H?Dtc#
z+@B6Xg3j|)&}j}EN+Nh^sXx8JC1A3i;ES9^R>16y;B~i{rsJO2GITTrhD6Y~Y-X2<
zem=&Lr8=s;ZtRc5H}a3@HAEAXzW&Lo91_7w%l<)V7`_3^ziZrk6Z_+;Sh4{QGg`z|
z!PCO|w2}x`ZgyUcO@rB3<c8)fH?cnwf2`OPa}MllwAw!-M_{;GH)zB_J0r10Wt}&n
z->*qEV40EP8I=Y0o}Jf9B4BA$e)Ky^27Ye|E$uVu2%H&-pPH7D{G|Ik$8c_T1knEM
zpC4uCk_0gb0?{i)@k8!^vEex@!KA{>o=Qb+0yf?MQ*$wjy4b=@ct$MABpt{8DRvg;
zEZE-}9v<FxDl>Tc4^o7S%35Lf#^9OE;M9E(=q|HOSu}$~Z%;GmEv^}a(;#z34An?@
zZq4AUckwb<WsXkZ0rltsGc<#NPTdE;a5(lB*-HHRE%-B*cpI--n`Pr7lnhto+n=L9
zZkFb5P;4<3$8-AQa$3*~#x^G*Yqf}#m;?R9cn7W-9Ngr6pmD(^<R8XUhGu|j)AqsQ
zdo`BO`03?K;FlLYoCd4??1AmjU|fG##taNPZ6C-p`19Vit~-wQCHTt@+;2|q#!Q~2
zcj}SD=b&a#)_Hg_R|5+O+0l7@i~ao0cV!<MGi8k-FmipUwKW6bPT0pnTIrx@Ar!;w
zn2R+7vyKH+v4LMD$;3|b@Z_m4a4+nGGdccxRb&n4hwyg>#k=p(4tnBTcJ%-Je~6v|
z^6p2XFWVDX;6abl7(0XG&dZBbuPRc1l$~3W!!QU0uY{cl#QiU}wDu#5M7GQYR4LgR
zFpnNkYF9Ni<}D!~TZNV}QM&Kbumdi_zPFToY$aN_L5y3D<%v+dG~SW&;row=EvMMA
zYEc>YR=S*rgD45HvVn5}4o*jX$vcrkw`R&scl|{ZXw}AwhuTV-HP6wm1%(NWaQyZS
z4ju4LI7$Xz%i(@Zy<ONwKMw8$jD-1FO+M%mEI$<F5A}|sr^%p5Qh>6K2z4w*KRNiH
zyVf0Zic18@BTU_kC)v^S%=r;MeXyNURu8?H$oGz(>&6rzERVO?xS(Pl-4m0J;AWpM
zfnS9+V|)q`@tz$0{hw*MbrM+xxMYj$lLEzY<t801w+s}CL?~j#ivk>Mn=@@O>8N=|
z{?M3V2qr!ZN&Zi@HED_YHXI~SnIVf{W<LA`Lz#5c*7oj+zkM<9ClFODZl<NTf5AVG
zPWt+n%$OfxxgBGoJ5nJ`ROfMeN4jkbn4wycAQ}!MHw>5Jk~`vRTfh`XU?TEd3JFC&
z@A402SC(xt2*S1`4h8nVu}6IOLvc8=fwYI#CYBhk@Rus9$F~Jzr6JqcqF1#jp*{Yw
z_HNWy>Y3x31->cd^{?;|h8WX+UVtw5>HG#rsD+uIxKct3X?=_lzL7GobCXTnr(Bo+
zL@@^);e^2vlwN=?HE^;u^^tOdtWJB8H+^DG5q=pAK<NeOa--}uaLJX?mSb+qAylRa
zQHfWm)S7*Z6%#tkCI*=)!Y0n`10O3It7;dK++Lv1OWE0daI&Ef#4&+qMX68V$CB$r
zgB3d{d-FbmJxn)6iIAX9B-l(bnOM)Im;43zQj#(Uw^z(NF!kGel#5*2gP%)My#uOX
zQf#i6kU^ViAxsf^)eHYoi2u}W84;5yu&E)TVUxnb6d}MdsOJUf^0eI2gRI5r9|Vx#
zp9np{pUW^y(9b?;Ff`aUP|zY<(E~h9-o9h6G2F&TU=jW{C62H(P4PVV=UfFRYGBBs
zpONH`vTMnqAOvAolKMgJf3Zj1p*}OLW=9B-6b5L6@saU7%5woE@}{;B$#=h4ez?6a
zr}s`uEB|_HdoIGMXvXhI%}lK3=>`9gnas0Yk(n|6O1_zjK`cJWYM_mmP$c!#PqyW+
z?X4YbB+oGp!$5-lGrpDy!QB5H4vMeyXU(|ib*NY>ED;EyS}8|3NqsH#lkLA@k+S!i
zj#FMqQ&CaRS+XKgABa3kPL!0JQB`Ceoh->z55{@4rI3u50r&`ZFs-Ej?-$lLMW)b@
zsK3>Dp)TZhfLxkBNGc{hZnd!w@j~2Ry1$QeOI(3WP&ORwG&#IWv(h-WKb|yd#`*&X
zQBy&PnYSi9Tpl*hJ-wtgTE<O#xS7FIi3>O^soL<Kmm){NnPeF>#Vg5r%1Laa8`75<
z8N;pILYYC%xNAe@Js#C8IgEB`%#p&*xNPH3-y5;DTT+^gi{n4a&h3hU5CozvMZm}Q
z-&h!b5|KkP4Y<1`cmZJ?lvPeQdqGtZ=UGVgMlwz}g&}jeSId7*NOpN}Jlf~J-E!%|
zER~l{$_9aNZdgnb`;OCB(r`V6i6123&D#F<j)@da!a<?9e>B*j#O%yB2x3SZNroy6
z_O)_73d1UKQel@j1#_jEMQF-!_`9j*pM{F|{KlCrPd-sJ9ypXv%09|qSP!*F&;B88
z13wtoDd1F!!Fs67J;*o2L+YIs-2VV&FsX;yBOZkbUL0iLx}1NOE^NI{(G@gtK%Cp%
z&hEEn@T&#al)`W5l-UA!9{gg61d|x|=BNyRL#IrG^wz$^RFIBeOEc88Si|&mVtM3b
z-FdXKxKA0}S><sQeu6sAPQh`9$Kx5`(Bw54`UG_xd3G4t-OxQdfSbzf>sHh-mC6e(
zHmQk!`Wh2Mg)Je(uYvYAWmk{{F$luGR0Yxg|6`kYTERMU*el~wOQ1mFth*EvIXW_3
z_~Es>xxg8KP)|NCf?SHL{(ZFF!%NkLPUngOS{&n%HovLFyhl=y<mO>e0kpx*Gt!~L
z>oK}%29l!ERp%(M4r-QiDf-6x!8NX%#}*9<K$&)r*hAF}Q2BWnJXJ2y4i08KyU3v_
zwDJQnh0%x<=~ELU+(*s8l^=*PvWg<1dP(O`ovs_}hoie*1I1~yytBn;fy<_A2DAP-
za&8PAPPu;DEaTzca}&OmQm<@(zBKkMYRCBds6s2*9Ib3FMg|OR6;iG*QUTJDpdRTr
zhQA%+bggh&ArTmVl*o!PP%}tt2Po83eY#3nu_`GXI5#rJMHgh?dL_SkX15y&R}&Q}
zH<l01U3GJix>hpasB&2BxikLlk?!?GfZlyJ)dxkZ0|aO$JFqZ-Mye#F<icH<U7$;q
zr*_CfHC3K=uf~diqsrYCE|SJ`{wTYGB#1!}_NA(z`2UY>(mfU2&gRmi(_z#AhQyRK
z=1FQnhHo6u81(r#2m~)v@`FTa;S4s4wQXZkWa#kcu3&7|yTLtVl&1)!2&jU}v33Oo
z6QiY*W*!FQ#^$al<qAr@u~}RKq?P<vjYovSz_$=?O&nb+&=Q>mHHFPheJF&XD9|id
z&@NF~kfYKiq-~_<u@BdVO9+^VEELHjlP3a~b?b+)C^(f^EV$}|rnHoP-7)`J`uC4V
z%bTtPaz`WeWF7iYE;VTruLU`y8$b70bPb9Ef=T6u1Nj6k3b^&=|1A9y6w7|@o#y2?
z5#ySNpeV>#crJVpr;!&0U`cnbaZw=VjpyPLn#4+0X#+*_pkN{=+UuCqatUIdRF_5%
z@r&Z~c1^EKEBNxHximg);c6O#t?@&H(xu8d%i3_{Jg8@Z>T{g%MM1Cq(*AU*)=UaE
z^ep7NG>Vhf>d8|SH`<fd^0h4dP<94M5Q88P{1Tu>{r|_7$sTqEV`WacQ5J;}lbNPY
zd_;n3H<vHN+|YT@lTrK&4XBzb1x7PPhcULxWDe97RC7CtFf3C>*$vC=45C7p*;9bp
zdUaI{XNSr<7uZD|RCE0V+Cabpk!g5xb_-|Dsa4{lfIZ+3s#k^PH!?-QFbVyrfMtCv
z{XO#=4H3hsu*j#mn)kTPvp#M(*nAWGuyk7;Rt1Lgq4L#V=HM5z^3abKQxtM9V{Qa}
z46MTBv=NyXy-5pG%q#kf21+sH^68$*uqjN!Ww3(0);i|&Y=ADEqEndkpa(Ggsf5D}
z&zI4k^D=^d#@`&UK>39T*6bX8GI^O{pJN1}_ZMwmS@**LB<x?`@+Q!80#t*sR>6QS
zu<T=2ZAt)xi?Dxv%bP%lWrj@#L2?7H&ie`3)EEPYFkM?s98s_a_?-&Yw0xta=n$p>
za;nhef*y#IFk_nb(Vr9Z+j}3%&gce$5CozvtthhBe`Ck+bs#Y}4VVpCWR&p{t3SHl
z*xwMCZuQ9o#>yZ74~AD)!Bv5rk4KH7Pe?JjV5%3;uRAzG=et*92o!QNxlp_bk*AEG
z_8P5tRUFj4^DCLEcXPQIRpBJvxuCJ2p!mS#+F903sSwNpkMp88;NbJ!xQPH$J>^p3
zY*P^^d4|!$n4RpRZLOvWV4Dg-$}^3HhlEq4(>@HsLoz=`u?0_sao96?pC$=2Dl93>
zeA5Ij-{tI@Z^Ifgqhv)jx%iGV(KgbU8GNkGh>BU%Ca8P^SA`4ZxrsQXDsCPZ3S%NO
zC*HticVJf0@oQqh2#7p03b$liU2uOe{`wegXAHzdGB)N}Xe44%t$titHCA{AV<O4)
z;`I)UTmyz`oP7rdVIs-%f&vF_@Ys=x|15m@ArkKJaq$PMCEi&a=pUodB~oxPekS&>
z-FVlq{hZoFnyJvgo|i9WXLOuF2m;}Xk~tAX3rhbjg!Sd3@;liEoEuLCl>K&k2(|)w
zCn&jR17@efv#xPZBOU56)PYjsIFlGEimZlF1x_Z8bTjhJMCtCGs#5imb9O55Yu&|g
zQQ62;{44N`$LLJt*Y(xU)vzFRZp2Jy$8c6;Yk+y6KKDor&8PiTGR0J+{mY0c-#Sb6
z3U1DT<lyJ)fU-KnS`oc8cv4^$SuCNR$cdrvk26D_msRx+%|s_%_uT}C6sy3iWQtsd
zsv>qN?mBY;DYh%uVc!L_0-O#bk-sqn6|wD^5B7=AG;pZU1s*opKA2_~vGs}*KICH>
z)*(D4#{|P?5xb<Fqfnn|>qDv)9~$Q}%DkkA8C2P8o5f74unmfR9J8Es2QU~JvCB52
zkS?+sJ#`o+flATd-o<xdCb%svEj99NkHQcj^-}#m1AqQ$ZRHcjqB7{lnwNx%pO5`<
zHV%@DIa&|3;QBvZ5=`veyIMfqEm4tIX}^@6+Yv({2t->_qCEO<EUbTW(UAt2J0yze
zau%0v$+9R_PmVPYwT=unSQB1m$)c`QJ-#iwQcKG51<!zV;WZ8KdvVh8R=_jFmlr%M
zHI7ltLcqW&sC$^4&i-wcS{cPGFt;KQ^*f}FiLtv>Xft#ZvskH3lE_Z-1`#Scc*a_S
zLYE4-hUC)DS*c|1R!x05HlT3A!abh&w8FokUAMBRNnro*0y)1#KCjwcwbG^QnsxK@
zDlj<q6#Sf#8Q}iD&-{jg?ASh<Q>~D7Xvea^Gh2Y#5a<>;`R-C--gPYCn0Un`_3hYb
zd_q?$rvzX&j(yg=jLe?AZEK0xL&2p<;o&SlPYYxPkHL?>rM4gvg((l313wr_PcmL9
z*Fnb8z>etyVvsfN@)G-;mPlv8ObWX6HW@=@Z=Zfi%x*b~+e2L8U>^5FpwJ2(h%RuJ
zG|(jlbC*;o@CV*^@f>TE{!iH%<yZ`YP;^TwT5<myo1P}~@xYqi4H#lYsKB{j7JuJ>
zA6Mj!(2V*IVxv~FzbH}P=V1$^s2|ZR=owtxqs>TyO8!(z(D!w)QwsVK#6r~s&9diB
zx8&IlS5QJN3NH<cqR#~c<k!Be{eH@RQ7jY|u1UfT&~MGnF;nu1pu2>SZDSziHr+Rk
zJFd`$+B$iflmvvf6(#{k?@Ymsm9qc^F4O{vg=`W@t~(jvc{d+mg)P*gxRUXwSoj++
z_fJ{ftgeK;6(@?gA37aJGdDW8Lb_=|Sc#!E-a#rw%$YY_xPL8lt)Rtakoy*#^_da+
zE)i?2yl0*+!D*~y{usc^VT|DH+NNE>(^#>Cp+hn>ObRu_FPN;L7S=bX>{9HEZ<qBB
z@K=L6-{~2fUsgYSui$_9UG;}<Yds(0saSppb9G8P96jw(*?1Hsvhtn(6J!1;JG&cz
zK@bS9R5^e5U#wi;L~FbS3^4+y!pEJFha4xNXAl@G-+jOpHZPy0FM>e<&mf(gYDh-T
zXrr&g11?56YHp*M6b=k#!V0pny$0a$#?4HTuFzYM4!KO?sUYxFh6g`Rl%pD<*Dk?T
z;i(|igPA6o*<wR*t!xML@c-E2^9q&)DT+p-+c_+?m%(?`MKCEe6{NuPtE5~sPOwP1
zw0yJnf3&igyogR9IG5EOx2FGZx~2I97s`ZIIg0JE%?VcW&5T`PQ9a@00~st$S(BN<
zU4db)IAkenV-$D4dp2&ZgmKG(;|9{hzuiVD8^e|GYvtfDQuv(<Qb_({A1!m)=&;Qm
zC;`}lkaUS&n@3E)a5g>~w42orw)aRQcSlF59sF5ae?Pmz1wklE`KAR>_c5<-3d6g?
z^8o%o=eor207BOf2|k$!{N^dDT&+EC@Jrd5Bry!aK=4b3!GQn&v8cHu2trv`A5<<D
ziDl^djh+2NE9mtPDZlMbks@>uO=d>J9-!Bb9ZTuj^<AhAOemI%ZD(zlWm5~SYxCog
zLNLiv(3IZRE;w}|ncT#VlmQ(op+ZS{_AW}rawbZ3+n9q4T>mnXl;tc^P?%v>fxb;|
zA|HnHd~W&lhnsL7DHUzbpcUG3I4ue!AvJZBF1uP1ftsis7Mmfci5z_e1)r@2@3AV*
zy8#v{OHPdfnxWcPjCsCvn`7w1j~D+u0zX1%aF9#azKc}6S&Nbyw&}=}*fZX5BL5$9
zvsY2(N~u=lEh8zVSHb_ciSv_h@TGaHgPLs@JyKsCoTb6AcnXHkjeFMmCitOU=Ba2)
zQcEgDP*KY!heik|a$ZG4Nt5v%@2eiXhv+7n(JWcR2G=^3Rl#QVMCc}(!7TVNr)0f&
z<KVq4W+LzrIVKB~tYN8*0$bO5avs5h$U#|fPG#ELtW>LhW_~C;gCvMS5D0!Lh#>y|
zW6R{Uh^FL_t7Q?xXoQ}_;2!~(70wHYmcK|;`Q@u)tAIUNJ_NCs1W`f<5JF2YY68EH
zX|paWf+(><41S$h&WOUWyv^+;NtC4*4<u919Rvog-c9@*6<vP6sILcH`Lm(Wb~AcK
z6O|TzE^xmvu=0=5HYdXp--DML7N2@o7>6*@V9I?JxCiUnk^bJ{fnH}Vl_gq<?7<7D
zMNnwb0NnHW^DaSEWHPc^sCPKuzOZ4+>fTE-x%d&mTM8nHG8xwcldI9sFEbQQs{qvN
zIZD8l-^8S%lEIG1kDX}RgsCnr!taLu2+9o8h8ycpV2wC$gnQ|58@-4~afR<|aKd;!
zH$_;5eZqm-;*my88BD9%?CoaYb37um1)ihiTR+kPJFlyu&jE?&#m0b7coLbf&uh}K
z3a^F7$A3~O9hpb?01dr=(}iFRKREX%DM1DO!XvgV_(rllhUZDVM=POV_^-(2`B8Q*
zNf3h|5WUe<r2XLiFE+HZ8NsB&CQB=247LcbKZS|y(MD~;H1w;H@8@IN8T;=n$I4J;
z0d9!W84e7_!zDz^)NR0<3)w$LU0{oM03|NmjDpe4XnMe;uAOQ5<uneQ5gq#fuK~O>
zV}-u$+lZ}Xn!=`Fvl#++RdSbBhsEIrv85!3L$b`3vZ6-sxHN)cHG^b<L$a7aC+4aP
zVHs^4rX_Xlr>;#_$f_w~(b;12At%^Ug2qu==pcGkq3?O8b7q{FjHFRVi(m_fEpkOg
zAW~_HE(6^KYPTJh2sdK<XB;{sXXZu>lzGt{yYe|tAwQ!ET=ffq%1zkgIfRIr5ScPu
z6*y#zGJOeI0fkr4?ako#>tuRI+iSJx+KEvMdDvl>$zWUH-G~OMc0Bx>sAm32-i&^~
zSRUMnG)0AhtAQy@9;zu|7Q@P+fHFgc!A@=|3*N?$*lL9RA4h(e0pH0-M_*H5l~nIn
zZ~ZVQbN8vDN4QL3i*bppN<9H*zLZ@{vI8LqyirOVRObE{OSf6PhcKzI$d<AQ@)?`%
zCzq&GCc<ceB8h-ge#c6_*H`Ff)XNf)wGz%=6i(-}i~eH!(ckJ3F`aY|td=C?lXw$H
z<=7sJy>(Y^cp6SgHV{+WkAJ0ld`u^Lh3-abmDo2`sAkk-W5{faAM;b2*{jZ+rDJ=|
zhR+y>$(&e;rdeWLm7{+F$CRjSw3*uq;tD<$*OVM%!Ln73=+=$ciQd#Q=}4X}xq+1#
zT)z;uSc$Pl|6^lbU2usp$df&6CBapwtLmUK(zn1UdOM?>YmBW5U5$#@hu$g><e{BW
z3f)TdHR^?k`b}ltMImJ5&nTX274{lEh+7((Lfkhp2csvuR?KcoN+B`BVi57{7vB<B
zvYcrZP8;=j8VWfhRPL>g8SGYSi5%T1E;c3$Zg01dg-NBD$g#|BeFz&EOv&r|&GvJo
zcp4XO!IA`Xm#{G{w!0M`7d?P9gd1E+jw5M_^q-ZeU9=x6VU#Q$<TRaB3H!@=Z_3Uj
z$zl+Op;t;kVYvUrTB0}K#!2B-cCM5Q@PK&!GXCxs)0`Qa!%%hJYn*Bzkjt=LP+UUV
z7_TnXxvh&=8(7ao6vunva%o-H!T<WD6Vo3qH+!>Q>*7q1iK$NB{@<A}<FqwU5z07A
zXX~?>&K%)xpb;}iCVEwUSk}3LCaBMpQ+~In;9!i54-;P@U-vbhp^?ChGg^d2X@Ty-
z%B$}yd}KPCs7~a@px!1okq{ia=}dsI=od(^&U3djI53gi%dL?L4_0NP2k#n9rAP1;
z2;7~iz~JaFMU%w4g8iste~g$xw4i>Ji79Xjs@a4BP-~KgXxH-!dRZB63Y^HM6=91W
zxiP~2jTAWrUS$J4Pb%sla6cXzfA@+BlI<1}e(K6u;DKPTWCF02*+`1;bX^2r>yZjh
zY`=TOQD0c-H`%^}#zcms0=U`HtPi`S6vC60z#*yFYgIRuC&%R4VNt}|KR8e`lonXk
z4Q&^!By+B*zDKsrkN;72u1O4oAP~M$CmKL<|BH3k{wYc_;Q~y@l*cN3MB^blqK4ol
zkf`x?FS(KQl2rWPf%IY5yf?_uadvLw*+Ww$t4p}PQN<5uzbU^&LjCdzv_&Egh7?Y!
z99W)B`{Rx6hXap(3E9ZLDn-z4Eh!niB>FVuN0fl5D`i$|mZ+QxZAO-bNCcR{?N8o@
zj17I|6+nzE+mJeOt;T}*obO5Pjq&>fUm9;n+2{tLg8*=~L_SscFrv#_Kg@HS4qBTR
zio5?*$SV?%F+?aEcYisDAd;tu3Nl3kFb1_5DYgogb{$z-D?w9a*@JWq_FvA0BpeV;
ztXEQx#+mxLbb@r+PAb-Bxso437Y@f+&DgVnKsYv+uP{O+LS#;u#d*Ma?2zk?;d^(F
zOOYrG{5S4?B)i_d0t^vbne>h*=*lG_JsYF1;6h~Wz7dvGjZ+z<o4ql8|L=Q1$9M@v
zA}cyZW~e6dxxvj7xn4n$h^>zs<o)p*Qut<GQqo}CY9w{G>M<rAU&^lR2%->#wWKQ^
z^xxPL{{(bi8ekk1ISfhZ@rOehiV_)jH8Q10Lu7bycT8Fi^SusMnP8iFnjMo2#(BXb
zv&IH&Bs)NrT@NOi+|qRmrt`E4U5y_=6zwPRA}B*aBC|b~NmW_X%a2)^f=&c_ozj!-
zWWv!y^GGRz4mlt+&B`dN0?l_YeO{79GNI?d(BOByqtT;vmPBS-Db5Z#P&DSOYQY~`
zlR882QHroboZ1nzChO=r(S#Uy5u$x2YOeA)IjY0xX<@8ZwH(Tdk+E^5i6byUIPk*Y
zZ%`Z1<5I``V*7r2>*ZxsL|=Ypek(74gb{#?*ep_p5JbG3k;SrJ8>nmTrX>=MN>PG{
z1J9s2w*b}!Nki5T&CTEU=EQgR3Ru3qkXBzO2gu|j>lM$aoMCxyYqAGgEqU*oZZ|HJ
zNgDL!ZC}x+f6C4+$$=1rqC1+BR($M#W5em>BZ!>}8=%xuLA{>)inRGT@E(AtaO258
zB;E|Vq;1+5zWLjM1qId3y{f+if1YGJ8fM)zzr~-;UJtv3r0S7RHq0NdR&oOytg!B}
z-I;1+L&flRGN=?_!5&~>D??mq>-i7GG0>O(yEO*N$5Q+ST*c0`;bw1T;4RJD8Nr-s
zycu_p#*x=?jQyqIPN$8RIa?=xcj`EdZX)lim&J6R`-dIW<Z8c!eVobaG%@@cw`5c}
z-Ajqr5-S67(c+b(m_N^17qG5+Sb&;pwo{IBu*aUUT3OK!86<^_(G3{`B%eDh2B(*}
zEA`BfxXTp0b7y%OAD1}wMkcVkO6gE-yIN5!a@aCPYNTDkX}Q$aVzn}0w!;oRGfj5Y
zCU@YtQK4IC^Dy&fs?nbdkr`o$sW0u(pkk#sGAd<P6&JPL(+b&3MyQK292xcIM(BtY
zjT*k4S5&?oV?Pgwcy*c`KLI{BWXl?@?N$aYqu%aF1Y8N$c6=h!5c$10|0z48BZxr|
zh_-YQQRu(1+w~76PH2G1pb-Rl`^|EX?>DAXZ-?3d8LrwZG#HJj8J2q&1skW7C2B#b
z?TfoZ&tXiXv&C^j$!S?CUp+%JW8glBNPsnLzmu4jn!fDqP}LM&m1KggSFz$WUI||j
zJj02|)&vLCKqyGcASLjOM(~VKm0;>z;vmvLnSS+2iy10OuZp`0j=*7wthHCDGrCb{
zj3d6tLW~Rdv)}peR6@-rgM@RN3u=R9@C1#W8o#)_Z(>_4_Y%Cq7x_t)Y@_6L4aI8w
zI|%O7s>!6byaLS8wvFK<fo@K{Ov;5EmMihBZ3tgny4mzX;@XFPv3&7I?9n4%csNBT
zM&v=V2`gcz#dmDBnt+4-ttY|bc?E8x;iU|xv>uM-ig678ljZjf7$3^u9*!tBIYvMh
z#OV^LT);FEX}UUV6xiZUYTB8)R+u~*Ws=r=2&O)Z1#wC_dkNE{@u^HF+iOhxI0(eE
ze>DE?72OCHP0iS4>@!g{^gE{KPuUqHQ4E4G^h#Pq+xuVa=ea}uj;y+494ZDBlG(No
z%h3WkH2s?8@5b`MC*8x^t5VOPn&TYbEIR_nzIg`ZVg53WnWuhZ`QYu(Z}1_so(Fk%
z-`p@n_<yV(Zg5HndVQY^BSK6F!L`SPQ@b+$*98+r4aL90CmC~srEcOd0={(;rB>~s
z5J&8)@$#|$y$JZ$dT?+EXzRp?NE2hz8ig+k$Q8yzBtTaE7zNa=4M}RFQs3N?MM!|m
zb;nfbYgKp98Dn`DcM+_0%`wRL2nUrmHQpuG1R=zwW1f%(GVDV0C>p3j^wlL1u=RvA
zr7H#IEtkP~dpBSks_~}gnA8gdgE>(`KF=nDk8tUjO<EIVz(tr+^RrBEe-XMH^Sv>d
z5w(s4n6`MkvV3sKtTln4ZG!nNKPxTL-uT~*;>DDdLL!o)Ll3>fzGm+cq8{^FN-Fk|
z%2T1E&q6W1wR~8%SBuwQ>={O3E*e&MN6^so)8v<GmqH9i%J~N4N7)%=0SJOX@JcD6
zasP|u_=i$YE<im~5L;)7ohexxp2nc}UK6M<Cy~D=$pWV_D0XNPL2Qi2oJIc}?zU`H
z<>Fv&x)Vlw_Y4q7TXlUBW`B*lU?lb+bf$teaVHo;ZAUys@(w;_s_L|5RZ4;N*nnXM
z<~o*P>S$XCZoD`qD%wTsN#vh-;w9dID-0PNwi!WNdiT_r_*?m-MH<aC)MtaX7Ub?s
zxm=8wXlJHF%Xr8YmH7<#M!kAwq+Ak7K~>YYn=O_B$fy_3=u_q9^ukaj*uM2iF=Vv6
zYKaeNM|k|;Wqcon{`{66Pcumzg{yvDQS9$q%M3(D|HL#Yh>Ut8CVo<)OC1Zb_JC7q
z8HkK}A10aJ*%cR<A_3LbQnVNKPE7a1>FU_zjeM%RTr0zRQKzn%7RCi1Qqfr^`bq4c
z8RsE2kQ9(Emx3%T81GcO*li;~UUcVmEXO@`rt&%)CipKEunxbCt?hZ~lr8g8c6LVq
zf-nqT3B>ZV|6=CTrviF*0gkI+(>5f}(i5FqShyjAkWup7v=ky5E!K~ZixSFLliw0P
zWrEczXTS=Z!yL(1o@*m?*Q(%>L5nH&XXW?vHd!!X!>Rn8Yt#R^{95`wBGps;QSt_(
z3Vv)7ctniF9KlAAqX{`4CEqmYO{_zu-R#JeQC_8E$ed$Wlt#2(%+qcPLl0eSS~e)|
zEjJ}1^<qw<hRHz({&rlhZPV_INU_*(kMw!=dID0l>0`BR9T9yKbN)=XY&xh3!`-y`
zm=T>28xEj0^x5#=ImbF-tD!&XtW1NA3Bz>N(gi=hb=#4@>99$-0-vycn}boBuBaxY
zLSn-=bkI!^vPqfCdFFq6{|Jre0$>_cGEa8<8uLgV7@i7%)BIpofSSc-&mpFW*Q$Yx
zEZB=yhKiZT;c8kvkYj4{rK9T7o^=Ed#oMg3KWo26yQawy8}OS`<82&0hRv;Sk*$BE
z$B@QJO=WiZ<;^c9a&Y06O!Fv+T$G*b4Fe$zgID5p3GBaEZGKcDq}90tAVh&Ahx7UE
zEJrvlxKlgNVX@Y2-eNF`bYj83>0t><Ur!9p2AO+TFJ<n*^rA7i<IbkUC3`TjC9V3|
zd&mwa><J<jS%6)ut{_nCkmeu__BslZ>xq<a-dLa|QBbUe2S?_?Ye%u9rc)RwcA7k)
zS{z8O9T9k&1Ftt@|K2L~><F&2Ppr9jT5%<kGgnG6t5>5FxtLDTTuIO{OQEY+?a{5s
zDFtXo9C{MZ6vT?v(460le!Gs+1_@Ondh{+W`Ux7QNdv3Bff!J(!>Qm~te$SZtj^0u
z=6GxM&B%WyeM-dfqsi8wJi?P)O(Mfs^oOdbOWCSlc5iSZrBTo@R)4cjmxOAuXa?1h
zPLj&%oB5iZMkVeBSq?_tFOLJEv1DJ%6jqA`S<ZG99gaKjVfWqr|0(gT{rP(1Q(E8v
zlcF#3Fsj$eb1$wEx7vB=P#4iq+?jk>@@S&4Q|v3h`A~KSNfv`35WSKHM7;mShPGyt
zmi&^+o=QvvB=jSBelLX)BGX`=<8pn_W89LdOsfJ*F=Ep+jQX}I4}QM`|E@RIzdZyE
zeS+|LC>pw3Y-GQ?_wSW?cijMp(Hz*d-A<b1(-mTh(I6;^Bc22Df{H~y$#bg$Ix#s!
z8&gqeiBvkG;hBzAcp>&~yxCh>!&P90(UXkoTqR(L5u^q{tp$N*d^26`%J%mQC3sXM
z9pR454AWga*^w2OFC+m50A}EAj!0LNa8;p(n9L(PK<z@|v8Ue||FP!IS(AWefvoSW
z16RNvCR|Mgmljp+DI@#W<D~<WvM4yb3nX@N0kM1Tp-P0&_XgGefQTp-r)rTa)87kD
z4LK6=Tpb+azW${(WW5r0Xl9gP@=AEEU1jY_bA*?UOUjzYfdg0TXhimez_BXu5L41L
zBI7`DIFfjuEeV<>dWb307tuQHfJ0b3!??ToA8SK8eYC_zq#k{vE>7c>NUEH#ZY8v~
zKgzD?3Stn1t<<Ve*nhE0yq}8NCkybXRU#5X&*E!2vHh_w9@m8p(!dOozssUJkx@QT
zx#B(0x+p*&PVPsx_pV2>4j`0#Ucsg*RM(zDOh#EnB{mw@n}SEkzSQiVUC-cXkg_3S
zV1qxbWg&l91jmd3iiROlRQ7Gih1u^x!Q(~ZkdZ-AiOt8IvePIP+Uktcp28yu<GNXB
z7esgbPx7p1&ohuD5lU+xYVW;8Xi;A9C*^uj3pd`0*cHk?jm0g%Q-C*;ci8A)#0~-6
zm0IUlpNx)+2Ko-*nZ0B<NhCkp{J@(LNKySz*zgnp=|~Ddh+^3Z*A-)9!)Uu+86_0e
zk;+>7hd)#RHIMn~+Vp;7ggH{w1uXKv3&p`A8`Jw0ks#*beGoO(>Ykay{~D-zv?dyj
zBZ;ksW6sC<Gvgnwzn^%dQPI5h2u^CNOtv$qGt7|^K)>7sd!!6Ho$|HmkDvKIha!L)
z1XePsS<*jpd%q;ZBq>CVQX4!sr^4I9?;mAnb_78P0@0L45s&;6Tb_S-Y)Jx?#UPDN
z+Z{nOXCx)Iy>VZwvum}t(D#%$u1-PK+CUhTm$u!aUt-@=;`XKR>!w3U<GlYJN-%=L
zP6;R39N)!;2DQ_hZWxJcZX~pOef3RQbwgjW-ChF!Nr->t(E$PlcQKzlWIKZF%|E}=
zER*nn$=k7+M6kDcy*GhC!3(>5`l)KMBk<KWE8+sdM9|O8hu9JH@`h7M2hcl;jes@~
z9&!=_w1vDwE%27pwv8V2vT?tRtb9FbBHDqe#$Yyi34P!43!O*t@gCjKn9J!sD-nf_
zy3l!M+qQ2x)x^q6<Uh++$HRhEt<!W?cAY)ss3WU(dQ}5q0?dgRAarlADTFzW&x5|i
zhs=-Fwsv`nd@sQ6l?j9+Un^pp=TO`cm5}PZrYH;Rs#7gH)lD<jLPr|6WAbGCfcQdK
zJCT&fOW=E^J&(usOktXUP?t7rj|h2G$Kpx+Wv*OnSld>434B`ekFsmckuU^dSMmWO
z_rKUucYbVFoyY}<A<RHOO8bfYw?o3tMqv{feG<;qd!94>fJAg~FgD>Tt+@NsLv^Hp
z9+7wyLn~Iy4tb%+XWy&ZS;+$!3@8B#7JGeUni!FHur@?Wnsi)ozJ>mh5Hdftu8x7b
z_hzj>MZTwld~TrE6PT=E<zR<#I3qw}MBae`lq}2iSq_xCbLi`{jkr5C{z+pLnIKO<
zLS&EanP)flr-9!{ADAlZsYEg-WJa<&zZ#H%F5zo1bdQ};2{B^wU~8c`GLLe{!mhrA
z{*rBGx;k`~y<u$aJO0fmkQj4#0<_zb4>nxb_#q=Tm2I}Yfxrn0+$2Eccnp5e$s~$y
zjApn=cGbD#_Ka|f5r3zOl-U#rHQ=5c9-U~rMg*P!kAi#7wT>F68p!}XBmNHb2IIfg
zCLHU08_Y7&CPr3Nk>$P?3o)2QN0+@DWE4V-yr_!fe9QwPK%ckE{-L31DkJo1XU1GM
z%KBL60m_Oz1;3VG{r8iEm@LSs0m~Mw`JwELav%mlAbO=1u-N-wY<d0Jplq{TfEYvp
zWoB06SH~+0SpdY|5tefxlv2dW)$+<h7XV}wZt~N->S{XVBfc=~P_rV67FWtRi)<#|
zT6h)-k5UymS`dMwy1P4>QnElQ7<^u}BVbhiG5kABk``4oGI52tKHu9~<lqjmi6<p0
z)PsRuqU$uTqd1nWJeh>3G`3Kvc_Ov}h5WVb7nfMZ=NjslW`<5&Q9E=9Sv-&S3{Y7&
zTgH3CHtS#8esM~wT<LiwdbArAg`z?2kfyjKPzYlo2c@x8ID*>ri@!6uj+;dAjhlq2
zTbOi6O+1hJQ1C>cKrVlMF~qNye=l0|-=xs!!7mLt{B|TelqS9o_(b$kwmzIDv&d)K
z%EHTp54kMro!C!3%Qw*$XNo5oDq--~AYU8jwa>YR?M{|gOG=iC{J_Cq#XPFuww6=U
zgDa{u01w@d=ge=mI|YQMmz{^3VAw!9dlxCJO}}_MzqpDGritc_?C18OwepgDC_9%N
z2tp8uUTIMAbN`DC&sm{Nr`h&`7&ToWMb-1Fy-2Hp*x;2!81Ie_GK0ZhS4Z*6>$^^v
zeMY;T!eH-7Wi@4;1z@1=>o>sHOes7(v!@!a%a-A^RfoWkL3q#XX%z<8X0Fh+2x4b|
z*b{pi>;&zoLTp{m@+S7fjvqtJc8BpVE5b9uz3`0W$?&Wm3<N9kQMAlz@MO|bXn9KS
z*v&?2mf<H$tL|n<Mp9**jGpb{AjspQl+)hCez=Fe8=`CCCxb=lrv*QijPA+sj2_w)
zGE3Lqt#G(EJcDbV%_Ep>+P6;6Y{{F*|2ISrv$*Z3s{CpK!V31(nPnF*fm#X;&~6!u
zPJI*k{|(gYUEC}A!&0dFB`BjZ$|S>EQYlFfG&><fUUw4FQo!Sdcgm0Vz8YSz*Z(^s
zdNRD~4!#mBoF)h_Y{5yUD$CQ7s$1@3>4{=aYSr6)ni*Jg+B;V5h%&MONiaOi3^q9S
zjv!it1>M~9072+?(D0?~+>#&$K_GagJXFm6FSa!MH7nVY3s9CZ3e?c^4K3Oo*yFTF
zu}8;WdHI$Vc!&vir{7`yHBiRzd$yg>?_W~1JigHs4fCA0=b1f;UAehM%hO|=%5QCE
zgY8`3%3kU>ik1fmqMb~sdZ9KGtwRYWV&eyf6?yldk@R?ivZR9*n24#CXM)2vfSg{s
ztwi=b_Mc7BIZB#S^NEo>hyd4C@b_I&6UPP$2J1h6)_PA4c;!JG>ft#0?bW<LY8P`>
z$*z>@G}A;jjG(%oL+Cqmy}v6!5wj(aZH>yIwM4B};fa{KSox|OZqHz)*4wq0dZqSb
zt?DTn`bC<K*H+}$Bcei{>p0^@z_GQhYpy(IBICiqHaH#k_k27%q5o`$w0h`~`gx`a
zaU4mtP@=7vFnAc|@L%SRUeA@(eihh?34sUgTNsL9@ctahuU;zsOr0AKK$6Ujc@5w8
zmi@jZg5dGkfyD)*k=?A7r+tcK03a~MFhZ^5SXV|xY)bdl^BV)-VpIxo5q&5-lPn2B
z5QttWoe=MTvF5u&$?9ZNON&SPB$y)pJ^9@k%}1I^t_RVIFo1NMoxvmOmnv(wyaxJY
z#GQh#n4xf)Iu2H_j`$`q*l=J_d5{z&aU(pe81>437$||L>2i67AZF^p7}@EMcSFb0
zYQH@$Dd6BadHSr7?~bjgzJlsNhJI#xMjmv22<{79QiB;_NdbrD+3Bc9qjKCzBp^ZQ
zEn&D9#zL`bAms~fi3SY@NyYYcu$!wTAog-AwPOuDo{8;V7^@GE2wWiaxjvozeo?$C
zmLVt>W|i5BC+Ngy_-Ce@=PC5N7%VolX1{^AQ^>*3^Ax+_G`O}>!t>4SA1*m&UJLK8
zU2m}E6&NzaHglbd0|vV{qedHdQ$$kOVXdRVz$3-faot>2_fwUK@cJC9m4+%6Rc2(i
zNBMH}tGD$z#m7<jY6xOOMjL!f%^2?2Lu%da3>Lw9lOW9&O_|=jV6~9-t<EB`2367w
z&5e4wtXeH;rPmJ?jl3WHN7=a@Q4E4mu%(DE(tl%@&HX}2MjBuoVg&TC9PAYJvK|2(
z2G!bPvDEu))gLZ#B7*0h(elh;HOSZ#?+iUhy{yMRqM&x|Tqj+@Hknt-CtgB8<1p-V
z3pnsK<jDBDPdvfS@&-|64z%*<D>mbaBtre<EMcA+!`jNz!M0hJjAcJKt2ay4V2A@I
z-@jzdSoS|97*HMkZd~zdkZWcLH0rfI7cUA8aJZ_SD8Wye;>766<r(Ja4iXe?T<}_y
z!Nh1;=15k`*a7_UuTMHL{=UV_(niUhOo6V>n|zROroc4n^*vUdF=WIR58W;(0y9_|
z_4=NU@|x#iVbDk**P0`>a343}s?*C$qc-rHedU?Bx!`&jWK!XAS(-9NaA7|)wXv>K
zv<e+4cH*iX=`zoj{_Yqj^s%45cBX|2okc-AM+VoUPUlld7*ON%{}uI-=?|y4e72w=
z2fayozdIxokiE#~w!PQQ-*&VxGinz*&QwhHA|F`pXn7l>&4Z_|`5Kacl$}eG#UKbp
zw-kaOvj2@WCp|&{96{s0c`2D@Kv|@ekJm$LJ8aD%9dPCK@JM1Ny7~%u$fC*z3<=_Q
zL0k1)dw0-EK{*P2T8EXyj4z}oiT197BC@FT0h=&Q-g$*`&BQ5{8v%=AAI~(EJJAlt
za<sFB|NfmC=D*S;?1T0X)RBG9S13dlgg(B@wX-$7l;vgRk?9Yggnilgi^@2(e+lto
zxspu;nU8oFZZBh3Xssu{*3zQGwxm&i-{S&8x|iJ*YLe-U-hfZd)7TfDBqydn79C|i
zOkhTMXD{esF9a)CBZ~wd!KR{9AEbtfw<}>j@_PVRPM(zCqu>3+@NbVqi4VwbPp*Vu
zteFD7!Zfld@$saG32uILd&KOAwm%lW%<y?^HbgC6d1jLA5--Wx!XRk=4IUT|7sq}A
zRs#GoUQ2Mw^h%BQns#LR!zWQqpd5S%wG=HxQaxCyq+cXHWUt+$oO;HllE`o>EGAp1
zJzZ#l`vK<R*s{A~E9DSK1pX*Hqilyk5QuK6MiJQm#yVr)$3sa@*Z`*`Dnl|}{zs=q
zhKT)ZBF;DACDM~g_;figzV^jxM3bEA!3yWeqSFUQ;Z)}_E~}B%H?i;2A{!xu2vy{o
zw**9wwOFArncQM0^FR;T9nq`W@yF?{=P0vtNmqDF7HmCuX6S{nTiWXW&J(+YTe1z!
zvjB9$(K_h6Gc{77E!k%5LHj|)4LO1m$xZ(z_`^?+dvVbFg@kZ$SC`Mr==aYv+^<9_
z;8d-yB!DGtUj-Cp!Q9h-5Iy=FIiNMkcu6`0cMlOd#@R0v^CJ<(6#|vTp<2Ql5@P(^
zfHwPG=!c&jhZfl4M4HjwnC+g@i;a1Zv*se*TU&nHY>`()&)mpaL#2~>L-U<_q6I5-
zD+?AMG<>|i?!0R_t~2G80w3%>9AJsg4Ef+Uhn^fNr2-$^JuK@Sqt}Vevojl&@;iOM
zCE*tm%?U@U`(tbsR+Pn=S}Zc+JgEp-`<ybcm1t3>ZR2&jcZZr9j-Dh0|5A2tNf3h|
z5WG?}W`X-(Z0YPrO3<xv0V<^id<;Fm;FTICfoaF%;&t;x<<wv6a)@3jJ`zm~&h911
zYrBuVW;?8P^gjbL;>Xi}3LVMDh28P1@Y{cX()zGvAb+3MxO&Vx&306(n*>t&1$<rZ
z`^R*p*(wYpo!z#$Uh`}_Zl|p5{<Mz$XT&4Ic_=%n*5%`S<t)By6-JWEOtiZoFM*`e
zr}^v&TuHMUpp%0&av;p%<v%ZzN|Mzr%x)cMzuq*qaRG+*SwmB5`A4iI?3vDk`i27_
zZOOQ}FIGh*u}=D)-f_4;y-XT{tQ@*REYeBdgJIRJ5JXF`Xjy6{Vv%ZKg5ZRR(DTT*
zqU*@}iIln1>H_!Rr(&-&`46d(kTiI0p<y<BtNnngi_n!^J<ED11Ra627XzF~7ei7>
zcNShkd{GM~_kJ#w-rfb@kGBQvD~LQA7YtmUWd>TSu!YoOiS(hyyzoX5_+ezciN0Tk
z7HTAZ2+|<$1N8hXW_AB$`K9dKk{t$N7`i1MxdrWiW7nto=tR&o-hd|K7z{?1cJNjs
z>%j{V^bn1Y?bruAvtP?~U*qcD;GVGK*6{@UCN5_51G_>8rk7l%HetyW1exw@6kkO;
z!Vg}7Gu1#Q`Kp0v(tN$+-JU?-M8x#d<9c&6x<~zdSA2y2Em347AEqPXM<Vg{S2y$b
zHKPioa#JKz8bB&;>O<?V;q%U#-0UREe5Sb>h&EXq<7vf|wJT6FT0Oc_dJ2wJJr1lW
zdg7DQpMc-Q#n=NAac7z(LuH|Y)Qnt@%yKL4zER$zJVa1XP+0OVBYdM`jw4atW6`{#
zCbT-&nDh*^twkn5Cn}2l6dN<>BLgizP`*co@f>VX6xN!M5vWnM<7$+Hxb0zJ+G)CO
zQYEvq>Pqdwb&FwB1S?K46~lgIzT8&lJeaQRo%fK@H>ol*;AXi6Zb8j})BLh+XS7&k
z#2)NX#>57ooTU5T(BD_4@p>w)(a1l{BX%Ujn$cs?mDcl5*|{A_5Q0!NmyN&&isYZz
zdi<F}?XD&P$8u~$yqwEox2#%A!&6wk4E?fC_Q#M)cNi>O4xaM_jzCi^yE4z9nlZmk
zUZKuuN2n&|h&^yIu>vv3-Is#*b?E06DVsAT#eiIC?8Teylndnu*~B(MPr?~WFl2-{
zq?a;MEuqQ#mym@?N8Q+z_x(#mj1W$&c;Q{*S~8=!P{>ThE-N32w;tb<r0QyZS-7!&
zi7OGDhk0pF!dw8mQNfZzFDXR`=wYSr-n28r7c%?7CF1Bc$`PoCIfhRn9U?^*^mix|
z&n*)PxEsW0PM$|EMQwkscqH8J3?E*N3g$F}b@?>*^FH_59(0H^VSy{HGH!!M!mXF~
zaP97c?t8lE(zmf+Chohtmi?&CGoQwq^Ph}BH_S79WNFkp__bf!^E&YJ_IAP^ywECm
zpk~X$=qzPMfE(tuJ?JM%nES}>7Rn_Q%AK|cB;~xK>HNic3gt_tAA)(9)Ay|NVcoi=
z%+KdCcI1$7@}5dx_1q((luFy*KV@f>#4rc~(JK`NmHS_;tY6(qGI9aNAuxc!w-<(A
zJmS1r7Q=AE<P)KtT;plwD%}a;6SHaq#nA-x;G>PG07zU3K#6ssWspO63?^rYRBDd$
z1}vJY@!8vOr;<=^`q|g|n~$I%;wcTD8)&z)B2*wDPJ2CL)B0OvI?!>+4;L*>4z$=4
zHlc6<fx>7|EQ#w<on$#KC;^N5mZeQv%?g0Tm9kOs=d2IOsM1oQgSb*ETI6=$Ov}ia
zd1v~?8~kWwf;-u<ge_3wJfp8teHq%L`}Yc7aN-gnxr^0O^|e0^L4)*GOlUejP45o=
z>=jnvf_yf5SjZ`9J9_U5GsRhdE6&>i%Zw=80WLSTUwlH-W%vWNVB(&mB@e}N<Ig_f
z1s{MRhpniUb`Y4P!g_Jz?bnG-wLYOB*pmpX@L1fKn!ex<hcssNuBSgLSQ9sfrhBx+
z;1NU}Tl3EJ%XcJZkC{j`4QN|i0`is$cf@I}2j4LAF<Mt(lGdGR9Q#Yz86-gngFx_0
z8%;p||FNZWL(r1T9w{qk6TqS8A@&F+LO5FQ3dFDYnUB^Eb;N?KXPdvCdU?<*SvuE&
zUmp65+j?E(I@l2xf}zm?nphzAU};7JiG<-d@*vdc;6W?^d$1m)9f;NNtQzzk%!UOq
z594Nscp5d}o)(!-2Uuazcnc9duBl#IGO3;FgAV(_B$kleUY?4eZ#r^ctwVmWDCZeU
z-*xGBSjo14b?oQe7X>}1;Cc7kAI*Jl=l@Ix{9rdykKx|QI6vK_FM(g4I+A)O=GqWA
z=ge*07Ei)7S{MkHmx^8Zv9c<9bZ`<DQ9Wqt_}R0u>s#oT1qlV@MJ{X@NKY+hLF?Gh
zOCrHiPMC!7D!?;gzYJ2{+W}Qrblp0J7kHj5FtsF7EqCX{zA1Qc4)U^BlrHJ47QAz^
zM%%65R;Zm|N$~{GT-dar4|Y@WEIIi61h9vi?AxP1zt2eR0mK5YjA3sr&esn2!6LQ?
zal7vod<U#J1EsYjq3f!D%FZU)VHkwLS2Fc4_rKWFm$zt%-A>qM!DJi<ge@ffk@z0z
z4{GQr?7J{iaH8whh2!a)7QzgNVwMqR@D=VvdKD^x+AUmJcdA!LIKkJ5k)i3DsxZ32
zhkLn{yn){|d(cS{B)-sP-v>A>BXHosc&l81N6T@YRE?KEiv44s_+1xwVKfDP0GMna
zGb2LapXOUn0)1cKNaT5`D`S9%mc5nTGtDxB1|DfV48F~Ob2BZ$p%~0mp@}4(O0#Rk
z9~?;?mN!!kJl=i4tQjOc;l3s?wr%N*UV?k%xT*kDJwpi%JhB0ujG%!Bk)DEIM#sNO
zNPG72B=V2-zDY4RC3`L?VMMpxqg>%L`P$<MB~nWr&hMa99=>KKs|M>WD>&alXR7n9
zxbP1AJf&I*##=_CwAz|{%6{73o(UcNL?G1(Q?51oIGw{MCdjP>g&t-}yW*>@Y`cER
zG4QusV&%r=;S6-CBcs*R?moP>WnMc_ULB7gJw;CY;JamsDQqhx`W8$>kpjv4aUz|^
z(0`O&(Xj*}2x|$rRiyvMUUK(^@OFj*)^S{oAR&1_HY$>GNX{5x2rc04Y4-J?4_hVk
zc&I9(Uohd_-mUgC89QsEJ0eMTsTzaICSxD8G^@y^G7!jr4Ofm+@}WL73|g91GLMH|
z9Hf=7>bp<fBt98AUzGTm4|8PrSMwk}6Bx-19_oW4x(O0$RT>uXnczq!@F-a}3s*rP
zvMj1r8WR}F{2gVl`!SYNc4d>q2u5yI9;`L(N`uMur*_<FOkhN_xle4$Kpw!~Zrs#0
zCNQFY3H#CYJSdGIb*U!@J<IV>Z{Q$xM1Zy*H>rVYOiubG$Ae6X*^?9JY<Z1!CjE^n
zmmbfejyon!cDpxDP5tQq?vza5p)H#S?Q-ZB)09<Wf>LH#18M!Nm9e{#)7968Nspt7
z<>2+hoy{L=BDJO*69BZ!M+DGEXFwJ@8}FcY?3cfpt()27#4;pqgcZ$lPvF(^TPw>5
ziy{MvrmBfZJM_!6{qk0!shYEybjxYxJpu1O%FZB*VGsnOR|3?i_rF+Y><ZB~EW5FJ
z31ReQ_~Q*b*q1PB27LvapMLm^kQvNWv5jL#SQGYSMtop<we+<Dy=AAM1S_Lmc?u(9
zJ1m|NouZ!MJLwq1ff9dl;2)V}WXCyn2%jQ?i=II86vO>C$!LSO?9gktpw|%S5w*c2
zqYXZG%NQ>~7=nK7r2iMb*N6|@GWzuB=w!H0dw0=4isbQFZQ@~U5Xv0N&m^O0&aH#r
zZMpW0v0HL@h$VGHJRF@SBRUL;evO^PB%_tiuVaL$8I#RQsdc_t_<qqoaEpWir8D4R
zK*SS7*d(K5-mudr4*sN^l`$k<bw+FI#(Je|j)|)T#+QD0(KCWj@2C&U40)<-*d6N?
zO^%bZeKHy{z9X6b@BBGySQ4kC6@=RLP|2A#TDNhmFE0)Mz}(VkPc+T+(H*;k^AY+6
z=Osrw5Kt^L=&7<rYju8Zo4E1VXCEepOfy~D`*fCF8(T{3$yWS9c)>N(rrV~9{4j)C
zLDAHDc$_$0eJH!4B!@x}cBKUo_5K%I;vYym%>{gp#Q-)W#M*_Xvq0;Ic^CB7n**mn
zFVl2@+}9oh^AydzkP3r(nW%&GZe|fCk!YS5BNYnvGEFDiUBPT>RI055vI^B5%-l!f
zzmy&I^#QSeclU<@)gr`$3CVS5Y{&LSkwckDO!+HHJh54U;c9$BtSRIB)juCh9chm0
z4DP4{W}ViAB9jy{V+S3^wSa+^UsFU0lM=kp%<m{tw309woz0;zIPQ;P9bUXZs<!iD
z3IpSwujU4;6#~Zh8_kIvCQv*JqHj!igPS)X{PqH^GAW`6@x-r)S*If)B6t&o%Ak0W
z;fe5r96(e}3!`E0v8XT+?p_`Srk}Y5^2_Ue(p6=0glAdws3ao5qk-SY8v9aJrY_Fh
zodMx38+yTf&fnJl5-Vi{M6NaHh^ym`Ww9!gBQkqOV9=y)(ZoaE>$kN(Z#>g?pqdJQ
zGxQ@Hb;WvCXMlW_%qfQPuN~cR?6TQ;!NPyat{{hj5Cnc{1+DV`k9CG7O+>m~E<F;%
z)&XP~?rrZ4k!3KsNVIG4{(&k|!NMTK!_A^j6kVKfoXNQ>U^qkMH0tys0qXF(_9v!q
zKIYb<<ifN8Ky;BTl>}5OP`k5uP@fnoKOuqV%67MlR^Twucv$Bkmlzb2L~3z@ik33w
zAjI?P6h?-1Lw1<7{6s5YyY1a#d)x`S_+@^ZxTRH2zFOGiz~uzOyPv$rXa#9^bsiFU
z1}jwK;A--Yq@{P075D?)WxsrNizHC1rH7N9$TOVmKiGr+2#_AeD={Jvc@WyVE1iyy
z%=>@KH$DmKl1RfD(rk#o$e!n}goqU`=QO!ElHGjdGx@8OlKmjlV^oUwDW8sf<(!HW
zt;C2GdnCA=lYE}b<ss)2<G;PWEA=oLAFO}44c#)(szjij-qT32V}}IAo5~~0zdddt
za3bs=heJk7c2Dv-E78qD$>~Z?iv|8jTHB(fc7XLbW6P&+;9=v=!1l=a*DG(zt^`S9
z5CncH%@NK2Ken_}Tf0Oi6+YlNC;_#PZE(*Xb6CaAsZ?RU-%e<!EN6WlHu}7trvK6D
zMYFG+(wX5s=7jLY@x-p>O)GE4eu#MX#<TTU%EKmc`o(fyt%zqh0kt+&`3L5V{&|Z^
zgTxDDg&s5BPsCP~buYVbl@5>h!*TjAzi!k|ogcflq91SYc!8|hBRrsBuE&8tYqrOc
zzb+;+$_In;(Zqj6TW<5+v>#%U3n%x;<Y|ITl-*NJ8a!U$xE0Qe{J}Zm7j#2#NQcM^
zWW63I{wDSab6+=6F6r=ifsFFu#apC3eGwvsP((yK5y^Q;8NtC<o}m@;q#XMpCaI$x
z!iQ0EvLlN|l{<}I0ywg_uF@<kDvuv~3)G<U0!WZ_4ruIU7Xq)CbEnSZrqmNn3GsYF
zdnJ?otymh2Ti~YD<Mcj>Qh!F{79W*jEzj1}Z!TP}l%2!HCTNaVV}IS?NG~WCCrgJp
z+M5<P2MxL~fUL$GhvW!`lL}v0FiV5c3;cq8eki-PBM3qe*3yaKqyNS(@$Ls@cccNv
zab1EKlE2;n4mS#X{*_B=_Xs^Rp*OvOHR{M|2@SM|B{LUWij(TW@2(%V!f7lJaMC3+
z7F&vw>S0bqvJ&LjaXxWd286}Y2@tPpT~?d4r~O>Te%=r-(X$L9I_>8hReFxl83^|B
zJbW9)DM9goY%)*XqA>Q$UVEAkA2rDAYaF!?if_x{q}W!M$WQKq7PUdc+A@eEzJ#Ut
z0;(Qlz!rA$ECULj=A(u3YFM?herPw5U$%Q}4xR=$pdXygW6n=312~@IBXt?jmu|?g
z!)_u!AMH(*htwomG~uqJwOoaM+z-$2sQ}+XL)`{Yh@QPIgJhoJL#I$SeQ-ge?N)$f
zmO`@X+ddp~CZmslbLjGjWx%GYk4#sAK3k>SZg7pao?5nTG_yGXIef7L+yoomQ(x1|
z4zNU<)LZXj(ZVw@>4-kc-o|8qt%>M)x-%f@MR~~V!SN89x(E7UVd$6r*qoh>T5BAv
zY}C^CS?WvK6(BJTg0L@Drr`enu_bP|4Y8hlfb*&~AW2|!&7fJmmu@Ws-7nMgdO8xP
zGMtIJ#BxS6$mMN#DEj1>OG0_jlZvKlM`ywV<Pf3?@^=dA<4MyDYB`n<%}J2s748=M
zTt}fd%XS>Q%JTd@t@OES#%rp+n^-=D15|LG_B#BR7tu3t`|rbZ5@@r`*;PQ;Gz55?
zL~zv%Y<oTru6pE3g`?#=0A;ar8FX!v90YKU1EE*Dtksjq_h-V>c?es=VNMh#EtEZ?
z83>%&JWQcE0Din8o<!a(dwN-wuETTDYK!@<X7JB*d62y*t06w}F91q2AmaUY%J@Z)
z@bW!19=!~RIKLexy0qG$VDhRbaW`Mt@mo=3(ZS3*HTjFCn5NLl+wGA2jAE8UtA7pT
zZ)D3LlV|Smb11tItv+L`z%qEEv$-;92NaMRPPN4enPQoXe`4-DP+b`%Aa=1a7FV9R
zKPT=^MgBtF0Fr3=%$0pncCJ|vf*=&$lJpSW|Hg*T`B5Ux#0EH>vMcC){H^`GNUHl4
ztBv^9ns*r1uO9n(jZA(!TuN|#M}|>5m)1ZtU|n6#r0s=Yo}pqQ9=z=gTF<N<)(x}1
zJ@qX*@v58w)S0tG(gVj5I70MjkI@vQI>R0NUto4(X)6)wKvSn<-gBoPoW|{igyRLI
zG=tYJK?|eSLv4y9TYC#Sy^J(k9AyU@6Z+zfT$VE+OJu~+;u5rQR@g}>Jgn;r;$=5Y
zVYeskK-=k@LfIsDzODZFJsodH8zO5%t1-5e^(r|d?H0$|`9?LMz#h9q09Y9Xw&>ic
zDr8ZdGVlYW>sg9tP~1^>sy6r%c#B(SFK<f!_@XYAz^3U^_HquZrr@S6qrw(P+(DmZ
zLxHUsYXVBZO3lcyWhU-mhu4M(tTU3XaqnUA=e5{eD#32^E%qvddK7G(8I`xVXf10_
za7OL0c)7S<-%AG1XY$TQ{7^-GY@5*9O=M)=GBbDZ1H{Y$(!_P}aj*QL?Anqb20_@B
zD)=b(zt|H0Qt3`}0jGmnK=KfdAvtR`Tpt@NFXg!VdF_>-E!%3LRoH^L^PcAxD*sv5
z-U0Fo8;9I>Y7Lq~9&fC?18iOv-Ov+(--w^NC!{xhmfp#11O6h+C5E58HHn+vf>f2W
zP;Gf|VTiG+!d_vfw;;(6-y-Vp1lpEB{$=U+hy-bVz+2ZGFC$SfI6@jkgp>SYHhn!)
z0W2j}6%ZvQ#6vW4%?07oOo{!pJ+zQg0>O0pz`I!<kI{V<#!L0u?;&9-^OfB~ma#xX
zdNIFKlmJ@L)N!GYzJNXlG3?vYe?r1{5^vXi&v!Ey_X0Gps0=jH;K{ZjFC~KQ+d24H
zS;#YXF}5}9hAY#$`GCu85fkN+#~7l6LD)pQy{CEAIho3bGejp_O1Rzw^c%gX8x%IZ
zF-8ZV^DL(@p}t$;NNN(D-Wa1}P?VqB{sPF{;+!b62z!`ntudfa2Y25FyPKoPRLJ`F
zu+`cs0EVh$Q+>{I>H}N<N7=O=XApwGijvXA*A<lhTL|mq#|L8OXn=D(1<`$cMxU-X
z?!3usRBD%YoE<WZdK4><1<hEX=03D-@R23Mr-w!9Y-<<YmV6(jUF)mZ_n&ECI%O-a
z_RYg)zjiD`$&mG7kUDe&(}Fg(?bQr~f5X`KUs=r?<RnUmJjy|5ko9ih|ICUr)nbcT
z=&rix-x>@ZnQ3X)8-GcW|4}WHReL7B(>H?eYY9dvnNeDux}seTy``6K$8wU7B}3AO
zmEi%sKn9c6BkLS=rqX=M@W}U{YS1nT?J4;AIzZ-<Vbi19MzRpGSy{r0?!-}#Lva}W
zzNEd87HQ4el4#^k=fYr7X9|wR=uo;qTa7_s8*M{Q;HG3a_HZ^@YY^G5vrbCFkYL(V
zY1`Ro4Q<`I-}M_*aS2jjCUILAEo^n(M+^O?t^3Fs0zaIE7L5%^w$<|qHC>O3BuNqY
zVJ);oXMA=Zs}`81o>#%InFUTtQpWZ^1|d6`2*PIy1C}?6<P!sdg<Z4EIq8|~3THxz
z_Dk8d9Z3wru$I8G3H0CCS-Gzh-kWs;43mH`Mvpv%>1@p|-n{9G=r{xz<eh{;%7Z*n
ziYv~YTZWE|-yq$d!7w*I#Sq%hH$#73E|45`&ztsd()%;YAKJlPK%GYi_?Q8T9&Hz&
zr31TgU5tk=uagN<5h&)~!9|459r;%i7N5j{bK5>(wn}km79|M@+uuM+RLijgyAZ+F
zCQWoOi!*PQMHSRh#T#UoZZ@qPuWcUX#9HX1BV9LP@bDrBK5!(m?<+{J9QyM&cS&uI
z!9)nM+t<3<OX!H=&HrxEw~a@0hsCF)qAu#_*3E@}ZdvN*m{i@bbqi(C5w4p<Tgj6S
zsuY8cLb;BPxZGTf2qsx|+l^irm#r~6>Th$|pVWe6nIAK<8r{V)+R=ZTaC@@E<w+V$
zj64*au5U*FXC*$Gwwz<edJ{VLJ@XE3xrVCKt(Oi8Z;^3>Vn<$XE~n^2j(e7JdBh#^
z8Sl^1L6#Vr>B@kx0X7b2A?Zg)1#TgUu|JfZTdu?)2!^-Rf<WE>#tvVf4(d#XWS)ts
z4j26|_p6)y-m3UC|1J9GEv?8Of(GUml85GrEhlzJ;9`q9Gla^VVL<Q7!S_QuRBfr?
zA0F3Gum$OH#rP@omv6GD5j<J;{Em_T{@rI?TSRTKwScN-BW;l*sq4P(PD)%fe7MQa
z&N+W@LbrjaL!}m5i|3<At0FBEcDh2)RySw$vX<fo!+e5&Ii2uM!u5JxJ03^KBbOcs
z*34gGe_nX8-9pZi2Nb_v5Bj}&c8JtcY_|*rlL^!vA-0_ue+>O)+5aa{dvY9SY@RR-
z=04qah}2SmKsGfCeIV4AwR0YJvekSRERX^toB)ABz*+7)*{Kl4c`Ls?0E3{FxDRTu
z+95hiaoz&r77lZPXS_qh++hog7fd=1%kX)PG`q`HXot@$UVZSg*Bp*?%H@09PTr2f
z*_s1{&Xw(b$l>`;JLFQS5FlRe5VgDWAe^MOwZs3EiU5*4)94rhxEKdzMD0*Or5JA+
z=ptbg)n6ZjHS`~4XOsjn2*S`SX;6yyzt|G@3vqYK1)PpkDcHQE0%;-yZ&3zCIhU8$
zX)Om>Nd<L8l>Shvq(Y8kupP{`ufjSa3V+7e)j%2BtTx}Q{JVx6xm)IM_Qoi=_@!i5
zI7&P*mr}Qp0pmonP*y5HB7)?HEFSk6yt0*73;*7ZsQ1~vmh|nWPXsbEC>0(N7WD-_
zLv7Yn{ltvR(v>P=F_V&En#Ak9^^?nKtN?=uaa-L78?SgwT`-z3qykmp1z{ta5O+Ga
z(jju(x||BthamN#IK<3+)SjRxcz#DJH6)0A2Bi!1ke12Znak3Z8WJ6P_>*zYzJGi*
zN$0$Rfg!r{_;;3_Fns{%$(KKk6%q`GIgigd&zQay%0QaS{auCDLiFb09d+}4X@n?|
z=P@lE_H|sydjCt~#zw{FC16x43>VfBD&kW%{rjowyJU4r1+~Hvy~TeKy2~Gfir=mM
zXIBo41dzp}qrK-ljS38fH6tIagIy^fem$3)Sbe3Q`A~L-xe|mR48D?zqvQQA_W1nq
zHYl5HFF=f8fUzz84<05~|K5iWBopZFZjp*Sss+jqi`^G{%C>=I0&@@PM=wx*z|9|;
zq~A+Pd=X4hUbVQDr&Z7+yy=Qpt1L%^5@@BI#zzl~^KBjT{ucY|omiy&piK9f*hi^3
zs3=!kP$W_oDL<$O@oA@D)|thAmDtBeiPQ8zn2nWblHE&*9T`7Rr(te^0*vIs71fbN
z!cSu<ePzM@!;8RuZpDPLS|t3~rY4d<=qQp5S5!?F7xNU}K>L6P3dpdMlQ$)JTsZK6
z7U2o-7S_7lH*QMo73FkvA`~_oRKG(D#mZ`Q#6!i(#uX2qA!&*@$Z9<SqrJ+z<I?6y
zliasbQUc+JrAvLi54P<e?&l}4^2yg|7mIA4L$6kFZSTLt{`z`pHLweOdRUb3F|jth
zy=YBQ@K~V#c!v1@0wcGd&=Rmn(eGGf|1bp(UI9B>Y!f<%B7w1byt>Y<(+0PI|9#h3
zMFC@n5tnzg`A6B=<uDAwF!)Lo^Hc7BvE}1oQc5~4ubUL16ik!aPE~8LL9f8=Gz|XZ
zX*zEn3^Q+olx-mqz)413BS-$BPu#eK$7&-OsHTkmMUMF+6jIYNVpsxJpP@5o;&?xG
z8<;Ri99>gTpk>r4@&mZ+7Mu1X70KkD57wOlllstjF~f8Zv9qjWTK`Y*_dCto^OOPa
zq~Jfb3y5G7X7q-t4~pzPaF)gJ#&EWtfRz!~$P<5rE`hQJ7v(EDn;E?Fv>(GLq;>Sb
zwt3*0l?-6j<+|t)|Lm!9L-e3;mr=q<#f7#lvO#4be*Gu#`#y0VJy^|IIefDNOEAAq
zDH)8sM^DGHZB;7)Eip6bqGxn4a#Of$$yV>sr?zC59&|WTLKr<vddP)36Qb;OIcP*=
z^eXaPADj=CmBgzfr#nUNN(olvnLYzq<SdQ1e7*u4$1<ZTkth1#A9nRU&{HUl&)69Z
z_dFlg&Aa`@{KpY|i%(6Ll&ATO?X+vzhBF&DvMZx2k*E0#ZI;69_6H_L-}CdK><p3^
z3PBiprK%u$|BIE-6^I>~?z+f#tm3aelYiRxhI`Nl;#&(=m$e!vXJ@5w$>C$U0NaDk
z-T)vMCE}H(%^Ub20t~*1I$XG&-CbE40^>s#lF$$eJX6@La_?hA%7>Qi$8xtU`s7`r
zayes=d!0qvCc|tNm3*IDG*r2sG04H}4JM?Z*gz+p!j&pZ!IGKa@Ylz(8@frOD}~VW
zJvc-KfCqP#iPV8ZyHcw{LKkpNm^kWS+exxZs(qh10q)_c9}9Le2k%3>QU?RrBl^um
z(t_D%oX8WE;sZx;^`SP|U=6SpbVygqAiF~nxHRg+cy&S=T|1;JwIta3^aTzaJKyKd
zI#n(s3=Vs-^815^Q<!W%N~x#agcPI~XdSUYZGKX|555&V@1-NUM8K}~q^m0hkay75
zHy-$+O)XXQqI_?5F!$NIl*vcCN#MY~lYw0+tuxq&fcAz1IRf3KZGI8I|CZj}$0BIv
zngDr$Iewm+{-x~PvLpmyAi5?^5ZTzQe{%CzhW3~Zq&YNF0qXHGF`|rK@Dnh(%SN_t
zR2}Vy39Ba>6HYlez#b!Tv2>c=kx!U9{7hIk6UPja7iy!qt^G3NPeLrDFIIYbj@zn3
z@8FJ5d-#CZyQ3!zY%8GC5oVYWd&qC{7%tDy$q}|MwO`iB11&EsW#Y7b4$^RI@eb;!
z#}DD5<jTelex+CXm)gGv{_yxY(J%5AxM&OOao#(k4|{n0kZK&mi-ltO1D}fjUWe-O
zL&Po@KgZ0MhfVPgtf|8f*Cq!RR#=A~yV@OOQ<l$I+!PEyog;l+;vIxgj!&iw%)m7i
zAEOc+y`%LoCHcfA5?>Du;Uw_+OXZh8QYd%pa*X=#bfuj2+v#XXOjtgKKpah`@gi9M
z#E#0tgye(bB`^m`?P*1tvMv03HiY7X`}IYzrQd{lZf2u(JFR{`2*=k=P9DLE^&syZ
zX^N?x4;+^`I>jy+h*?p%qf0Th^TF>aX?#9>Z0<_EBTLB(=f8i-&M3=a5QL&zN(yS&
z|HjIt^D!trr)+=^Vo;Iy?tiutj<ddhLRUKicWU30#g}*ZY9n<85Lu+UQ=PJ>4-EPs
zR`VLAXLn6of)q)%K7h9aw>dm5MdVK1%QHSPcL+FQ;^ig9%I;LYJmTY5f4maM<vEwa
z3r0Iy6tQg4%(SQf>i(Zrs8H<)Q6yXXtPn&2XtcY!n01sQl01FnbBLN30+gaTr7c>Z
z*v_qdKpzNrMLZ#nPuWqSh;8N}3#n!Jf%>|)A}g&HY{qZ-vGV5S&o{9TDs=r6{cC;A
z04_$H2jx}QSX$KAjub^~bExFj=EpbsUqx?CThKtU418v2aPTzB*mSX48WmQPw-4Yp
z{O?|DE{A)(ws3)ZZL@dSz=YxtYrW%K+)=n_9`eBnVS2WWY0A4=gR>J`GFLJr;+)mE
zDf|}u>xa~hy#=ZXj$+6cPL;K`Xn~r?eBcWVW>;-#<p!u7k&9lN|DBCFyu^a=okdcf
zPUzf!odKb^)?CluBl(-Mb4y|v1fl4b61{4&|BaPnKRPH)%LW+77!<gVAAuis+trlg
zK-BT-tuXA`*&@ntT;vfx_8;0IL>McO(o}}wBJaD^rwVPg>Uxww+Ds`sJUKxh9wSg>
z+Z><;Uopd;kwf>?xfR2XSi=W%|JySJ8aaGVnQZL~^MMg&)(nA0-gN7n&3R<4Cm42%
zoXM-FzbBFJvg#KS6llc#63*~vboK=uEKGiYX^j$8k{JSxJi2Ep1za$<$_MTB37knG
z&T|XEBYGz{LNgoaSQ+k&ysFPY725JD)Z6<A-V7Oni@c<d1q623?R0PmgRhvWtW`V?
zmM)`JI84rJfaOz$K%=tw8$e?~1oU{DIQ@?NJ&P>Bo&tNi(~Z7y^$OOV$s-G}$KLT=
zKKBV+Isn;*!5?<q%|k4s+JX@~vTcbrJd>rIoKHcjo$(7m-lO~%`eE7bifrdQI#h`o
zJa;nWA1#=k3z>QPUATAGy`;>rf8?cnS{K-|qv^uYeeZLBqyM}pJEI(lK^TT!X=qJ>
z`(JEr`ZEa`Y5iRZAw)w0_DeZ-1o`l{>95H^UuH3HCj>@}&-J=u*OtT;%w{+SAf(n?
z8}_26<%{X%DsGS*4-md}J^vZ#_dlMHJ<`6b{UWzrmx|}y&rVQH#2zuY<?mxHCjLdS
zz*bbfQ={02nTTHEhCtBg%pI>1qKt<@x-rF8VW8~$P?NzjD<SH5xYkq57@oc?rHZoM
z>STqe<I(#TYmO-*>d{*WjtdHj)x$W=ESqJ=6!lK9!E;rduo^mWT|?J%owWhf8vYpA
z34D>&vt<+ab}VvLKE*b10$)V+@SG9-Pv{k?8PEOgxPE{{Pw!G-v<Z<6i^JD({UC~X
znxv8fsOxU3og+J8F9>+_EOBiY$6_8;P1*^13DI*sdOKW8i!$zNwVhCvAUzD!Q#RqD
zY@}#5537d}l8UE2YQ*@A_s-}X+%f$isd%J<X);xQ_`?@3S(fPs8POx6DAc=7n1_B)
zUEsKW@TKF~llr6V%(5d0K`6Q<Qv&M#Hx{n>X&gGm1~_%FM8r4z7wBH}G)!524|~Bz
zy#EhSwtQlyDn%_GmAS$3f!4C!zB0rii9$R~J)sGLPw~CDm(r9QlB`NRUh4+x$*>d;
zM$nSsCCR46Qvkr|gRV`Hcfr4`WZZ`x2=qK1Cd~Dam`q8H(49i3_wWGz@G!fp!XAU)
zv%a8rJmvluTlY4#njY|UErUdrpvUury;Z@ysM>B_A{n}tSY(Fy#h^|{!p=E1-h}>=
zl86oP7H1-swa9U#lVO92MQlJ}mTjP!c>Fok)RxM&F4le?7nrN}f%_06!v&KCwxh_U
zb0NUdr5+BN3>!>r;ZY9yD1<V-a-Sv*DK{sv<&0#~1*HrXL2a*M-xD6q)V+^DA=fXG
z-L`F+A+bq|2m!pC(3F@DLVH3o6gFuK^1M&WSn-AxU4!k~n_-zr#OzqrF}#7|$VI&A
zRqXphM#zqTIE+|M#tQGGzY2a`$rfdrv57$UVhWxfF4Z3dxnIi8Ey-dK1fp9q-j0&}
zZ)`aCkKjyAZ@{t=6oh{K<Ez}iR}As7c3J)LR%TrdIHiG2cHgCwAz%Jm@gO9<G*;f#
z(Pfk6u<cY0xGo%0v3H4#kLZ8SNd#4j2Q$eVv7F~X=8;2HQ`FI;P#wk;VXTfNv}~YM
zKsp1J#4H7;=H6>|nvfh4oZ{tMK<gs%@MR@+&}2KV{l~@&F$?g|CdJHqWS!Pw=3(`8
ziWm=S4j8ON)_?oczqgZKDoTgQ%Y}uM_uji}0LWqQDPD;&(+Y%O&AhJGAp{*FoC;KD
zf<McmOiTxRliVSysls%gyrL<{Za{$TFFHgrRpTvYf;aIFDXTB++)l-I3#x187L=m%
zk+8dUfgGZj3Pxw(qKmCHD)rZacP)#Hr7FWSI4$`sz}`@Z3-#5V%dhJ2e6@>_T7qmc
z4{ncg2w5ubTUm*H+fTgD;~CeX7wizSRP46~gA#lqt_8oT$F_6apNgGBmTfX<;}N_L
z2hu7gpI4Gx`}(2m+>$5;K^VFvMdM@t8@rzVq25l}K!%}KC{4mZ+s#qA*nlb`^{N|5
zCqtxR`?95Zl$<N_OWbp#JL3RqxH*r01|7Jgls57l_M-IdS?rDeg#9;cCC3QBXtkmj
zC}K;|Jg_YixB2qU@O@N7xtFP&A__I7-LVdr9Ai?heu=t-GUESyjMZFbOn%s}n{>%{
zjRdaUNDXJhjDR$^GjK(q+rA8R;`C*#WNdkU0)NShE0n9*Da}@{)o$Be715~4v2;ue
z+GMaWU@O`e=$Ejk$3`>p{8U*t)^WeyvH#T_<!w);EJ35e)8=+h1qy?*_mQl4@-}q{
zi~W-ANN+5^cZ+G1JvOH6kgOJ^9pEDpw`*S;M21z38TKQK9$&Cu@?HHxE4GVstE@hy
z^~=MYk-+^TuBYf2-@QGJTgGQ7<GUgY@0P*f5;x3qBA|#+O`fmAT-D&v@quk8+guT$
zn!FiL!IL}ldX|)C`G)<H7GE(9s>gFyM)DfcA7xjTWHAT=ucS!3-2Y-jJ0Guzm<ku@
zvWN*1dwBuBZWhnmvChMsduGDe`KlkIHZmGGI6IzNwrd@UOtq{pxG#$qPxGKZZ&_1n
z#Q~gYmo9#bn}cT(nxOQ#z5w5!q08PPosR506;wUa7?G0f!Dnyn(3)+`#wq(eWFjNk
zgHPTPY5Ru;{c(Cb3zBKVo~ScNXM3j&#|RYv$Y|amu1(4qw1{DPk_Kr6A@s{*d?Zxb
zYFQQ?6i6P>nNH@scle)=gb99D%kQ7+4>{9oocB(lB0~yqW@kk}^9Zr;yYCUUWn)6O
zD(kiZ&<H)#Y<$=j*FAYArtm*dMk1xwgD386qX}Mx_fFm3w}roy#l@@7W;5SExE{A3
z$Or+^d>8?_0Ss2Kf&^+TWTb#-?&L~&4Qa_X_SGPa04c#9JYz>EV{jJpQC2_ek!dlW
zt)ui=7HzQCy|nrT`MyCsUx)7XVk3@yNlFWHL1XZ1LG%$wK#F-`m??PqcCP$W7yF~^
zN^&HILEx9XP+tE3v7tQb1BOIF>Pugc<v2J%Ex*_nu!DaeUG`r~n_nWoEW2N{49!vN
zIH<{JZjOo!g%K97qu;!u1w6DU+sxbhOYE12Y2gBV-8o@nTd;Upk~sMDu8fNbbDFxn
z45Eqs2X}^l2@BfMg;5|?cu?93(o{og;dUU|>SU>^drtIK6g_hfiy4QIh)_=faRwUx
zgl8^Gn1RToI9Op5c2);h2?IZ$6N}fO|2ZXK_8AI9tIk}+R(6N@1JJLRs`DbjX0O!3
zyJh-oxkrQ-al|bs5;DwDT!vcfxKWl#*Ira_1&R!J6qlpc8b|a}j#5GMDjZ?(=M#P*
zdGx<bx&u*cw0TSkGTc;H{T=%2Y<&Us+T1gEo*DKiuq;_ui!#mYoAR;!Tj-ZPv6dl=
z4B*XTQmWtW%*A8<v`CxckJ-DIpsSIgU&6w7z{YN)Iya)}0x~2?T+%yoxZ;C@vre;a
z_tIxrlCTJ#Lh%F5-Yfvu^sV$1NfP54i~Lb`uDKF}AQaw`wMFdyH+K1&N$#Mene%%R
zVy23K=h1LPcAfwxFI{_dCC6s%9V~jI*?DB}=09=bHT28EN4B|UwibUmDp2SPZ`ZLx
zleDC~gA6FV<tV@(R{FIe;7nmNT88j+H$+UM3}^baOZA#UXtXT86QA-^-qWg8v6WQi
z+3L>lUW4pDxbpTbuFww6Q-cY3AhIC+10obfY$c_5Uo=&sgW`!lekrbFg?MP$TkCpE
zGI$~O``!a9`D6j`&``F9askMgV$n)E@nq%`oBJ4`@nJglVv8sTJ|lWCn529iOkb~~
zh^?H-jOd9B)$Tqf8hzs|<~@>cmt{mxT#~bS2e#q$nUn?`o)0B$$&4==Ta8zMedS6r
znOPC*q-H)bkZZ?T9ZG4wF&DYI*w!PCJz|L%Wo$WCAx+vM!1JMfJu|jK4&5Z$q|L=+
z-Ei89%8j&i6{bF>@FwjW-1AGImv!bFG7<_SS1|7J33n+rQ&^Jrt-JF}AeQ+@*|{A-
z41!R!C47LU|HhV+Kat%X8elR;0r5V*L^|qWNA?AJ9w4llq@xNcQV;ZwH>ZH49yE<E
zFWfZlkKKEsca$gV2AX78LJZ1-e_fGaq$PbnV}ahppU1NBmAVqFv`~LW!VHx1p4lU?
zmL?ei#UsP7V}^`R_X}|P@s-*YU_7sY!1ir|dW9w9^9o&5gWe9aR?Gq*H1?e|+FE*M
z4uU&=f8?JE=D00;;H$7vHR$cgtA4N`7z0;M%43C&ssYR6tG)3|S=6$b9@0vgd3IEs
zZX0DV)S*Ya)l{^?^wcL9sGE0{4ewn)Q{$dDmYAL<5{-8J{2MUww(tVHs#t}QX+d}g
z9S(hQJ)XYDJ(#vu`t;M5z#dOxvoo^K49&E{^)v|;a=)_8HgF7s0(<S33gOe_aE4uL
za^3cRp5uDYcq@EQ6Fr=(QP36dV&{HmNmppCgtk*PV`FrT>Euc_xK#q5h#pk;(Y0T#
zXT3;;>}dz0$G=ptc=9~!Yn?5}zm)Q!>|CxO20<uV6ABpnZ)~{P5y_m;0E<Kr;eAr*
zWD~M*#1QP$=gpG-68g2$dIt0$=Qw3W$AZ-N5xG&RJo{>a=0Wqsn2t)3GaZ_zOS(4|
zs{lq`3umzPCGvZ!OWukgNX`;|$JxG$^4j5edKTWnC{nOk9g#Is48A(#OwZCgtSZz8
zCiTUzu0ziBWU4jsbc+jqVx_)|2BpKEbV=EW0>?H0(zh|y8M;$JB;)HQkJGrv$Bf{`
z2eH->N$EHcF^h`IepOH6zjgSBo)A2SD2GPoU_CNUg9B^v4?Q7xOa<oz-oR0!PQ~*&
z_G=YMARc<y_>bWJ<DASQcBif;91k=cVzS|8Fu%Tp{_{!F?Z_?)m3D@hqZqk%sEwYW
zJcbm98gCLv5ycnjRMw}J7Jw<cJMX>bY0qaJilC1N6n%PJW4BqU0((6QV232=3C<He
zF$^W-A<%6u`tA-%(8qpkSyptHFk{#+9L1!=wDW}LiHLsf1tCJQ`#Q>YhaTq%(4*_-
z)aty{ew3X7Zp0uA1iy3vv%vp9Rwk9MGA3300qb-L*pS^>?isH)rJomN^(0roV+QYh
zJ=25cA!EFg%hIX^s1z-7LLZ3RYsPt}YMwRS2eYbvNrtg>W-Hm0Jf*BLhu$#90l?ET
z203{x&+6-~a_++l77J$<yHoOf0LqPvgsbrf2>KSzSj<%2TGToOlf-FYgGP;qv5dn^
zo07*0ciXE^8V1<-5Hlt-ZBm|s=pX(mDS+3z+RqKaOL?qdl35e+2dBm1`Z;4_lb7;T
zBzx<OaCf*~-&FqRXKx=STj|L01wj3Z+{Kph$Z1Q^QWvl!gb3>GpeD<h<g_Jd^+FuO
z#9TW2AxWa8TynCFtXyHGsgct~*h6S$8JC>AnrEHVH7+1^Mml?_oY|+$9VI7Wzle+n
zH&ur>JhM-kPn<+)BapkA2N?9R^z&QjlsqJaGi2U~;sda`W!!gau1x~>Ww`8pT2uz6
ztaoaDa=pKdqjqiU?+zoNGR8YO5YM$50h&F-A{=z$3I?_x%FgYEp%8|lD{*-k*nhFc
z`6G!cc>#oIflFfh{2e%uKqy1FEM$<{SWH?uUPBg-J;^?&@Xe0Y2Y}*VLy+(Auh)6C
zZ_*}Lz80XE%<$@WSii8Nk7eCkP$Zz3%n)OEY{WCW-IbH#{9@k9DH39MY(!g^&FtCL
ziQ7(tD+ftP;n@xwu`fNER!{C5Lh(J}WoUh8&3#zw;zgMkT-ohG#KSf%+vCfAP{wnn
zTLFr92zWWLL{T|v@|K-iDBd9;=w3bLgBe+O7tAFn4jjBOJd?O{2g<XoHi~&Gdou*_
zP~AzLJC&o^TMET@f>**b7&k~yqK7u+w*nOB2@rBzM_=|y;!M86dI!aNf`HGm>3Y}N
z9)qJW*h4Xh;KgSxC*FWun%g#t^;Wj!8^kl|&cBQUr2?)M^Hw(I8^kl)bg2}WsPVO8
zy%nDYcF?1fx7ZKA;MoRA6IZMjc-dKNP$_mgPg>hM`Nr&0$vD8XI#GG{6!{Lr4pKR$
z9z3nekFs;IVHgI1=t>E3u)Y6c<+W1P3r-alKoxS&;N0h1T>hCnjWQp{?Bmu}U8$f|
zSI#RIAh^KoJqG1`3M*O;m;5Ynk<AhzZ{MHP{nHN-H}e?SvD6?iKJ(MOqP1|b=Gg{n
znNO%w^rS6XT|q%L=Yd@k0|XA-SZhA3eSZMeod<)!7;B-ept4G(D*&tX9p1O!Tp2PO
zA-|^D6@b+UtrH&Bh#`?Ev;{3>S^NH&s5_6v%E!mxMnr+F`dvY9HRpjANt&t!5blX|
z?Ip>AkA9(~#sGoHw*Ne${V#prk)ii+YdE6>KutSV5Lmf$E)1U$yES(tbJeyjkfij5
zQaySm@dW*y8@KUBn!8fD(8Qz1pqa1_6M54UZda5LE-6|@N)(?&V*U0-_Lo<b3a+#s
zYj&Raar^YPT6HQ?1)rCD5(ie^1~8?_R^MJx6u5GF;yO431aXLpLzsVc1zeTT6RR2C
z@(8vL92xCN?fbu^@_Awo#N(2%wb(|oAj~Uj1y?o?D*Xe0)EOJYi?VY|k{AS`=$4ET
z3H#sJaC$yw1Ugl0fU=AT#QR9(r!w+O)<k*NjR33nDz+&NDJMHb2n|pk6C7x$z{@1T
zgm#CjpaI8Y)Ntkz=Ix!~A7${byP~Iu7QQqS&=d*``6lTw6?6m{$weo=JUAyXU#~4s
zCq3nPP;JLm2Nz1Yc5w!+vv3Jpg3{qfl55RO11)2}?Dr0YFy72?sChWzIW;>R3ms>%
z!~sLl6!LEE&NR8*;aKQ_=J9BLu+1AxaP+C8>JTh+obInYf7)Y4`pja@o!1LJu{`*!
znSZZ2@oy~ly3=>-q0Zy^xE|j8Zk&AcsvBiNuV8Bj$XR%_MnNwpPKOqv0nCFh{XM8;
z{}7{pk);zk6iWFx!1_RGm6UE7`{g@^fzsPQzqlVk+$!s#*TKJk$kVcC`04O=$D3Li
z#ow<Ep+!$T4?a{t=y7TAa+K4iQx>iuw`|a|)h9C)fQvtC9Y%|uqC7)*h4+RED&;Kv
z4t9%mqBH)4RUe0;Q3~o=d5HR@hWt==wOI^<AnZ!jRa5VOu_f$Rirp(0;BCwyU_M@c
z^zKd}k_Vl7_G2TM5?*12zz{v`(xNe5Bb;z@Mn+{}0)zC3p~<0?e|ioLQcg&PszM1t
zf2M@Y5+wwN;1T##V(Prlc`!CR(F!31ro|(R(WTpPg@3^2`&Y`T<9C`wDA)+I%i#dI
zSuIxB5OCWp?Q^u(5oF+!s!|SKsi^LorFX-t2l<QB(-@nqluD{QXEmNTY5m|lM}B;t
z6(R)OH%opK(x7GO_=FJ1o7jIowl7@88T`?ug>=m&wL*h{EAmL_N5tBwPspIXSs_8d
z1$l<%ynuMMrOj))dMgwN+>Ep?W+Fy0*<u_cznE1R5O5zYp27k444=Sitj!Uxa1`K1
zT89|Ba$*(`Sc0<sP4GWw<#t7aQ?SHh4!u*hm(d@qp+kC@W_i1}7;|`;<)l~2p+kDu
zx_1um>?TA%$;{wcAwa+pJ&dZ6QtFSwzGmF(tWY3u-u)&INk)XgL!#AhBR~I|U&_wy
z2x1U~qAjUG(f%7-j{8L<nb3e^j3VHD+#o%`y%ufxQZ_vL+vtyf^M>iEJgzpYC<X3W
zP={pL8!FGn1mQq0)AR;f8$za5)6mHX_C+Rai+}s*7~<Hv_G_M<zmbaB;(>Ka>VOB;
z`g{HzgJ)v4gYRH8w53e#B2y{r%gE2ucIcgAv19A2+jY}nt&LBEKmJIM-?7>epLnX8
z>pFD}M}{1u4#3l<)ptThKfo;qK`(RDH~>$>gKsTVc(5V-HuTGiIAH->4yhC~%eF`f
zfJYg6jCMz6UWgVTO+<DrC$w{9I4tT>JQYEqW?3YsvIm{*42MN;Zd$lNDh4lhC}$1Q
z22FKGJdCFyY>hQKG9uBVdxj*V9>vrDqRUp8v)-qs{m8In)Pr~+O&9u5wqGpYI~$@I
znv6On9!dp7WRZzRbv{^=OoSbtG>MK4IN)vXb{w7zB}5Mdk1dFOHwQ<eS!cqD*WsDK
zYdU`JmhsenrVAP3hI$zuwM<*)w9IevFn+tzf0UhDuEZb+hPPzLBC`LD4WDz86O?I&
z$G(t;R#Esb9=pQZ&>+L(x4w0T7eR~q3|v|80l&lCdWxUsJ=t?6H;@WtLq}|~3NsEM
z4F879k8!^*^=P2Q^K~tin2azvN|sI<)OY+Wc0;U33}7Crv7^E=(ICC^LIu=htwtU5
zm%!iCp&OnKr%*%Aa82@0jiynduxQZUK@DEftrlMLN(N08o{8$lnDi5re@H~iO%fbn
zg=nG?w$ms6x}GYbduG4Ie)vl^KW5OV6GMgRKVh<LD%;;~sRgvwWMSU^yhOI(mHjUY
z@HEO#SGp~B-C2XULT1q@z|)qWrPp;+QgeC}j0&MeqXG|(>i~{m3WAP40p}qY-an{S
za9FxY@L)BAXrOtaOp0)YEu&F@rvVRSh5+M4>|}wZ!5>~c!UeoW%H0v#^ShKK!7Ceh
zgz$9QjIZfe9-36iVX#7%(TL#b5Kiuoqr#oF151P%jSwDsyA6SgWipdY6Rejq9--(c
z?KNQZ6a3Vflzgv!Q+8#!7K0#kOOAm1-`L}Le;z}dlJuK2s3>}dhtO6^5(V+{c!d&0
z(=_x;PX2G2P{dl}=RQPPk5*y%uoLMSXj{3%oNn#l07DfP4m*XOTd#(0ZCX<MiJA^n
zA>#0HcIkKzI(U1ZBXMh>3KNGNjAy_W18-S8qg(`4$TDm}JQF$=@U6t{L665{u5en|
z3-g?TBcYZsJ*~93YjTCx!cLe6HbbHX=>P_o*uiqi^@)#JmV-KQhT6I9s4mVG$_yW|
z))?sIm$sLn_q7<hQUs47H8)6SFyI-~#z{u9QUj$~Tpc*ktkYW;C9rk;DR_SjZjB1A
zo8uv!D|%LG$)6XBpjZ%3pSsqUe!zhVB?;e^*wd5xaNW3YAf)*v@=Lz0Nx=dLn0{Cl
z$p&+m^6hw(*Jx*HTirHju`5KUN>ZHgGQ0+5L*kI(%qCxgzvRWeiqKWrBmmJzvgWz+
z<Mt{RJ0&f`J1!h<<4loCY;zTRft|Ql2U$rX;46*&oRi-ED7&^KhCvW`r36&){uk@6
zAMKzt6An;@At?~uN3>?*J&2MT<~BxB@WOcTD9nTRno5kbQ9|&iFZT^yp;mds@*rcS
zcg^I{`ba4DY4C@lY<hN1P@qyPh9<g6^t+P!ej`FwCE6igb5nm4`XTWil@*C=S__+z
z*mmYEmAs>^4;~|(9E=pd*5Ac`NZdBx)rKt*UnMtUAEUlPIP-|-X>BY6MwFuuO?r5R
zapn=uLl6?xEifXeivBM4|B^&B4}OggEG*hwXU9x}SB8(op~)f>HZG18<1BZjg9kJZ
zQF|;2Z-yzxnq*yRvJw~B&Wjfks3&bL&W*4_W^-wqg#%gT!<J1+_L@}sp!7J8_2StN
zrX|08&UsuSv$<?`v9k{>Cp`ZaKaXgvLS}P`|4K|7nt_rSkg*4?LJ9K?;&Uw}xP_7C
zKHHP%m1ZToz9cmR>3P{PPW?OpvXaY>N8hbmRoTK-jL@|t^-9CqoVV_!|AWm48(i`@
zON+Qh`qt>Yg#J)=CN>g-FcfWx2}ex-jqQJtRwIKm!VOr27;NAlAcH&iKcA!EuZifD
zdI~mBTq~=y>OqocIBn*YdM0`gnvL?9)&;{(ZL?0Q=Q0eH)T40MX6-2Q`-BY7OvGnr
zAh!9{+xte&?A}hPNBzUiTSilF)@rnFQfG(i<?K*#XDXEA(TOKR!?P9GqZ~msp*%b6
z-fCu;a<<xTsUDO879BiMFzyUs!4})CqDi8^M`bJsovAt-tjEUSRu-ZAqsZ^sx59cb
zvM50HRgKHeLAf(*Hd|0VfKEPB)e^8Y2CLilnxV8=^Ia^*scXQ`Vg2k0p5e4v^IhyL
z`f!7G(XYUgJB<A!Q5-BC93M{u122&l#Lg5nhxOsD6xSiO$FuE;Qd70eA$>IH3KCuI
zw*eGB8uWV-dZ>>|Jcha*+s-R66}~epKkMEnR!g$t+BtC+-j`*D=4TG+(_7~uK&RJ=
zBS#QAvv+szAA-N0R*g~{=BAy5e*cpW>7$ldNBHMZ*=y94{Kx*I?AneX20>s;iYTQ2
z#*X#AQ0^w%fN|6y!aiQ^WG?$aIZz;H5>EzjQSO;DH^V&5)d5q2AW$T+v#9klJU^c&
z7B->@S}+YX>S|q>0DdU;=-8z;jp*CpKQZ16{%1p<Q*CV{?9Jjkj~9#1#PIC91+CL1
z_=NkKMe&{?%y~llKvf&j71B3QdAX8UhA-zC>;p^TINYNvdTNE*q%oX1Kkz;gH6nZ1
zovGG~7bZhL^Q_nt+0O!AL~u&_GmF8Qh?N09YCF-4967eKV9^-EK=bUoHQ<d5uu@E1
zh8FXtVpbOIQGtXJEP%Cjov()e8M2liX#}KcL?abyg*$>V1T<gS(%H8RV&4Ytt6FcW
zPMvMHrY+w+J2+^I+<!eoZ}TkL)4uH9xG&=$@?KoY486?{_>X{wJ3!};oBbY{308Jg
zWCy&UkhMY4xJdAos-a}>tqxu(YF0o#-qlBj+~&!73m4C`Hp?1k`I<CCKXY5zpc`#3
zG#a}+g~?et_V)ySC_9^E31JWjUum5D!Tm4x`tvQOh-k^eZ5O36K+@f$;4x>eb$S~s
z<bMy6OY>0Cq}fLNal?(glhwH*zAnL0DrYz5k8%%|Q46OAtbr2v$|k;1e~!l7$By97
zUqatUZu<xzSlak>VdOYpVc)LsZS)p3zUntu_|1}I*@{@tBJZceQ=H80#bM%#T**9<
z^`l~$3E)FJp?cw@5HAV!EYg0^NGU~d%JJ!QX6TjtV4DRcGa#M#F-}=YqgfHunXMiD
z+f`p+fcnj>1yl5gH)C-`8Ju`KJ1)F(lh`XcB0BhdTrY-E4C5RHlI-La#hz{SAG~Zw
z`?f<RMY~wPtcqUGf`Jd)lr~8fZhGr}90_?YMZf<+J(jf#?hm7=CN#0-mn>9~1DdyZ
z?hEIa212!5e}#O%Ry?LotsQlndbnjvx`>Ke&wRhl<RnsmrnSrtI>mknJRSt`MX@b4
z<hrlIe)yL0+GIh#m^d?!-*xT}x{`i8mb61{53_p_X=JBY^G*KwqwGp<AP8YtFIxc+
zj=2BEHs-S;WJi<N{33*goOb*(e!fi02@5yY2!+gR3FbW+1|z&E7pYBPR*sGOyVKef
zixI^=Pp;dCRmqL3sx-)&Geko;AP}WegzI?;)Vr@`W-On<lk(`@N^nw*SJ3&$aQJZI
zfV$=Ws|^cooPPH=mLINr_&kW(XI(8Dl6v2WW==gF&QiFNcMl-61i8x8)WKcoB%*5+
zu1SIgp`c@v;qjrU$951FUI@61^pRGEY=;78eD6T!E-YEs&c2lrqe6ABbG6pSVCT>Z
z=1bIWWr%#J=hI~4gR+)vrbg`Am0|Lso^f+$o)+=P28Yi#rXMcl2%F|o*lV&%$f8gU
z=nt{=`q#Rfp@{T`&0w7z9Rxp%WbS3S6j2Fu7h<oPzB2uA^0OhN=4N-L!Y16UU9mD8
zM4Uh%`&aht-il@_-~|6l#)~^BP_t88;YJ=dHIy%}mEj=5L4jni#DaZ@JP2%O{P>~O
zHQ8jg2m~!EH9B_2*|z%mQg&@g4ul}^O2z@P?|-qS{h1(StGED38SS9-<7;HF&h6ft
zPRFg4ojI(dK}7WR*(yr^B+gQH_K2{K1QEg3hh#CDpg5HK;V*j5jtCJUsOv<@=p)Ls
zxKXeeIwC~OODt`ZV5q)LP(3bpBz?G&x+d+-H~&kO57@;Q@0`gismps!>P(a$vXXmb
zS^77|-ZUUko#_igzW*|0c6dkChZzI(I9mUlbf=RllS+3Ee4qd+CFI^GA1Y*#j8>NZ
zy(obKL>>0S;S4Qvo}!cONcs>cKz?!MrJM7O_2w?Ug*!+R=s$$*k9Q6*?<D9ppVztr
zC4v7#*ArWZW6hCgUXPBJ4}tz86sm#4&Pkh#+zhsqd<X;}9Tb^R59b%3ugH<Nb_b>c
z1&C?b>RazTpK3OOFH8Tk`*t)KT@w^G8y$Fx{=1{&!^HstgtZ+^jJ(H$B^@0fWZaL|
z!<4{1IMOWkNe2Tj4$$#W+w|m`d*z?9gHaO529W1$5Mk0{w&$>pWDOF?21eLs!m-02
z-uII~%FgY`VHkv>E!mR5(0^mg@s9_iWJ3c?h6oJOeLSH%ePq3;Ur6c=Zcm+C_8Pm>
zO0rc~jNF)1$6sk~UQ4pmNU}}Wgi5g-q8-mN^%LAOc=Bx1rN}N0#U4bERC*Vsb=Yve
zUNwouFH%f#zBgut)*-`rmimE>AkhJ@TZ;86kvr9%;XmN*Ee?sYLCtCkWF5kqXQ7|i
zft^=7fm2okcPc&0{9Guh4*}vPrkhN6N<D#pfZYOE(mC$ovZlII>IwV9`int2MniJc
zH+pOFraY<q0H?&2G}>Q`X~&PTKYk-62~^@`xe!diA9roC-Dy$Ds0#?xfkw70Zl}vY
zvJL$uB`*oQ8Ea}xf2d47z>Oz%r~AD?KgWVYF>s0-H~qCn?{vU~`a$n9W*&837|%^o
zI-D%epr2SE=fo&IPIfV?unuF&6XfSyasrc$Q;8z<<~MgbR08~r$b?=xG<H;#`iO2F
z;*lqPAF?a>=)~yiGJgsD`S2yM&%iTJl$jF8zuHF5f9`hvC_8r~iD3|kUTG}J7To`0
z%TtD6gU%*WP1zU_^yfM|SI7xuGx9jPj?ISK6uOju8Mkg`Q6J-q5MkIoY$dZMtj~it
zA^Iwiqnj<1DU2phP#=`O$63r1C-q<@KP8yYgP<I~8b@fqGz$us$&<bhm4!+JjeB;h
zXH&RLzO&ZWH#X4k2#_@z>mpO=MxOP3z9R{7*qE$vY6B&CXL-i>M3&fbaYo^Xxqpp5
zh0Ej_<+G`Z*o31^;`OH2p8fw9nFW48udexm7>-}%T`D9g-<Pi})F`&)(X4ifRberC
z2KhWcvbEb0dus%oP2w?mw&psR(sv&Z>>^-g3em`uF&A?Op7Xnq67FI|nsg;&F3RFW
z8EYXETmQ6@`;sXak_|h0F#Kw<6st!oxzF;T6?$Rxe87<3w|R+5_PZ2)j&=(MJ;)$8
zorprK@ynA7A9_5}e?IC!(G=o~U$~xmY^N4hH$+M;z6$TfFIdlkHOGbeV<I}LpsOjw
z7q<&_H{b$2<C}k!UCE8WFbHgkIL3kg8(Sv%EXPVa4WKCEvOR~qf+{^Y(@CtzZC#Lq
zeqK=Qx`&mOA$oWQ_1sWBcoYeU>$;xc4AaB2s1IcK6$-`CO=JKg8AJ8(tmzZA9>4tP
zce~Su8N-+Gtmq?(>+ExF!5f+Prvzj85?-9SqWSFy<QK<v#_+qD!Ys~Qk(97mi=$Ii
zy$-RN(#)DZ3K94iV*rpH8H$JDGkCV<+ABH~c9NJmXSgOdhS1>InhP(W7sNW_{G<b>
z#~40?XK${T;DA9E`4?;E|6>0&(14gKmH`5b13j^Md&f^2L6%sO&AH$_yd8*Ai@)8{
zn_x;Tk>UarhsYS1H`d_Y^{|X!N-W7>9)WSHqK&^?{}%Z$k#~_&(SxZ5dzv)}G#SAO
zh~NbY3uN$z(bx?tU<4uHGfn*catHx&bZ$76Y5!<vLKh&9VLdU}=p3-Ohx~IYxeJm9
zsM^@oAY(e&n;1hlfHY#NONi6~W_zpcL0G{E$^k5lvz(!<I4!`X@WDfNkNrd06(v~=
zg0L$U6{`2Y*e3oVzMbX*P6urOO~RvmxE;?RY%TZDaTFsZ;)0%m%}kz~@*>B-Bsh3+
zB$<ks0W0@>U4oDVJ4@%l({jEADFc=sd3F&w`}iMm&gZ4c@g{}(oC<{O*~y<k+PSQ)
zplc%VbkdjUq|&H#^>0i66YZpd#t!mQl-&1WQR`z@pxb7SHgIImu=G`)g{CXGZK<E+
zncnsd96<bB;^E3RCh`vb+ffcr>cqxHcrjf`3W>a9^ru?%Y#Dr4xGb%tglyvz-u+>u
z$-D*%mR#maQb_Ebj;4t|ZuI@7Q-1wyB`F*(J|kB5J-m%QL*2<xaJ3!Acgt++s(DB7
zT#D{c(61erJQT~4%gD>dFAM+vAG3##H8$DCvIl3d21EhBle#l_7ucz@9F(<IXbq{n
zOxzuO_&aG*HE;~uW%}?830$**&!W^9d&%5DZD&D~P|!88cMMg7p^)M`pIhldLcza&
zq(~ZOZ!tuBFI)K)0RJdEw;PK=7>KsS!(iyYvGqy548E(l0Tdw^n=qVtM(zh}wFtoy
zl}8IvdpR>Q<s-UCH>h}3WZH7sH~(|Zj8GjJT^qKG?HV%vAS&Dwo>8hJqstl+NOw4+
zVR8r4lF=%k(FHK6Y&(p+(ct&kn$aq6;d!EJE93)tXs(~e{%7y(;}Ea#)dwql23G)@
z(ZP%3gMp$F5;=NM)3jzj{N(rmi?y1=g|I}kk`cp$<YV7Du)sF4bskhT%?OG|`M|)L
z#Tssb$KQep&uEJG@nDgpFYX*K%MC(ano$++<AGc_VBd*pb>OyHnh_Q6<e~D&(+Ao)
zDtI@uG@~ir$kQ+lK<%=H-bBBQ{JW?*j8Efs9O#qq_v`xgpc$$16dyQ!gIRu4AoR=7
zzdzd9cra+Zya3`dqy4@zd(u;UtRTQ1s$&*%8t!eA5m;yB0h&^*3oN7?NA0nu4)DW+
zLPT&MDZS>to>r}uk!~N?)jD9UN#_I2=N74zQP*)isDw$^|0p|yBnv_ihF+=r(<<Em
zV#Dh{8<eS<T!4jzF+dC#uW(-VCbj~An}^RbnA-BV;w$Glf-4BP@9UyE9?xrj6<rbU
z3IvXARLO@;hUT{+racnH6$q?io{a4lN!PO8Nxs~i_)zX;(ehBm!!gI}_kDngE8tp}
zb$zYC4C|51^W#Zy1zM|nPpruTOQ&%>qe~J60;_pXUYCX4G;At)Tb!{KEUD%_#=s&X
z&xz09NA`ts-{;sin}D|-98EL>#kiylsjuW<X$t#$(B(JtmQcW?s(A)qw3fXShV#yZ
zf+SVTlhhJjvC)CJKmQB;H*VK`T|71PG;Tza)|`ieQEPi8ANJ7k!})I3LwZO}wN25J
zq#=ui*KN@|En_I~w>IYi>?g5f7+L&z!yQ7wzbffLz=*H>LwEO-Nrr+^n`h6$26e7U
z8+|qeFcg%kdY%MoJdcxVJ7&DI$w39Cs&S8HA^9<uetqcwH^;5O)T+&%tZYz&@g<}Y
z9sWlCq3jBhAO=C$m#S5S|9@<gp0<D;IqWrKT|_`gPEAn#5ZHJ~co9zZprU72#RWRb
z9*Vi)8bg5D@C7SCSDcjN>$w}XPgx!i#Ho=eB?aGm6ZOQfYp`*Gk1g#^z$;$RX>}pY
zVfPd=`6i4B#|ilU-&D^Id-JF4%+Ma2x^wjXzPQ)QM>mr*_Bte)4za7^XLY`+-izmQ
zc4ovQZc4=w>i@y)R9405w5K6m0&v9%y1pKE>A|!)VapO&NV4s!_(9j#BM4tPk~9!I
z^wAUWiX(J=Jrk)PX_olNCCG{U3HaU!9a|5XfcTU!MXViSZ%xptb&(^1>S}OR!_wnZ
zapA7B2Nw=j$GLin$F&pakA=HZtm51tVFf&e4w7xD+z;kB2gnphrXKRS!gRvzW3A%H
zon#l|Sa!jhQtMab4E@7g#4nz;(nT73O2LN$N)Er@`1NLxnTRDATrG-DizTbCTtwy{
zOW-7DA25!Ge=(lZR(j<z&kaKT5vH&<B`KWR-;l(QvNKAKAOxY{l~$Bd?tih+?oSXm
zSuQ|XjyR}~e*ccWMgJ~}Hx#DIQ;%ihsuj8<q(z}m2Xi^KBi-`NAXVg6=r?#@G5%Ir
zP!9CX$lnbODYjN(NBgdc0o$|hd;8^e$_gC^+z7^3Ohdi_A=-Ce{Vw*$mC~Zv2QdqM
zq1*7Xugk}rm4P2}AK1-^Sm~yjdEBcKI%?HBW-?Ik{1=+EeOBmb@W_FwMd|u%z%p+|
z`D)1u9St7a4qGF^UY_%bzVb2I3QY$fxuUBudIA6eG$yARkxITtk<Xa$SMUYfV!6CT
zq>}FkuV-zJ_25p~SK+ceC6$DazFn<DUZR}!jF(G2E|r9D2k1_{qMZ$3oQ!;TYEnt~
z!?vsIKquTDxKVmpf|Z<%upWpEs6^h@EJH67UdhTx>p|4FCNg2(buSN%CY8i&5km=n
z#{ZerKuDp!3;uZ@Y<9q%gj1nTz`U2{2J4l)mjkEu;8gr@27+t-x<s#Jesu5hfTIgk
zEi}Wo<JI3%{vXP&<OpIAhP4#HT>Uq;68nj5!r%rp9uj<jkSw^~pp=TNop!D~B-`Y}
zh}i_qv`pxHBS6h7gzcCvGh#LYY|*l%7?@=RP5#fbi9C|GvN;mU%f=Ahx=8Kg4*akz
zrnRkfb!DaCTi5QNkj)ZFi&np<<o>X$<<0W;XN=@U!vaE{q$x6z3)!aQ2KulprmN*Z
zUPnXA|FY*iV}JfF<*|xMO|b0!?<MK5BkBB20J;G>1ZfQ02PSZ#<6@gMR`*{nQW*^C
zhr|wSlS#WVK8egX;NRa)Y4)^4J<hcFVLf|gu~{NjM``x7|AieUO^o1Uw^c?c?54EV
zO3sxe(^Lm7IvsYTo+-^9T2w7f0?e-4a~g@%8|B(n6EAi<I+RZN2mc`@Qf$i90!fY3
z0z}VKlso9}#TF$-u-+RE5(r3qbjXn+CQ2NHg_o`s6a5s8SsZkv5Gc8xJV_})g~5!x
zV-?KE)0Cv-dQe!fhwyh(ZKL^1o-OoYsg*Yn8Xc+65@BgS%FgK6Vh{wPEs3Ir{u_HN
z`66&<-Zo$y;~?T5*6JING1QA_ZlSe8mi>g+U0rG>jwY`zoP+4CdtVt*Jz5y#MUqpO
zzHO9W9Br>=Ihg2_Bt9T<X4KZ;d(}KRC{rAir1J4;!)g|_9#1!<SrH~WC6N!b<T^dW
z5j;qju*dKyk`z9{!#}WMfH`~F9t<%exls>lurT~P{wsH7XpG@HB*}YVY6~j<KEAIT
zF`qH)g(Q6s9M3oG8_x!%^S_~gZ;x!!1;b(7+6`d9t#8oAz!$PVQUb7C8;q>UZE{G4
zzmP2NK{HJFHYwV6&pK-+gj9bn4cRodp*BY&14&30_jqEnBZpjbM;WG!%|wwiGH5kC
zj`-|7oQ$S_f-#hYWO)xBEs;}tB63mZE(sJvNyy2^<MHffjfsZI^?Jt;5^_?ux}a{f
zaPw9)C@is$AsOU+8l^*25$l3))Z>7m0pxs;XP>hFzv$`IJ+vO`-k9}0em&nIBtR)p
zEAP?|{zuul;6@C>K=ev=2w>m;V)dhyRt`kkxquZB7%<G|6-`DZs3%CxY!|s7v3Yo~
zP^1htDnZ>H$$h}<YjzqH1x-ff+$HkUjqsjphm_+`v<x=Ovg8S~;lJ1MD7?O@{QfU%
zGFNWs%L2FEkO}rFsNhs#_#|=@zOcy5<B(DxibBE)zX#1u?g-qT!Q|ZvD;QPjJ;S{t
z@a-sN{oaUzp{OJ5LGPI>ia6RuTfHNRqF=D5Sx=rvX6yVyIL+HwD-r{HhH`NmhZ5x{
zKl}E>m?$tcD=|HoB9I&JIEaQrkr-HY>xoIv3#E+{#CN6N7fmtjxv&_@bvO`$`{7Wc
zs29wuo!y0+1G&Xm0m@rx1x1Qu4-DpP*0X&7GqHFSR#tlP>oF)AV_wr%2+CphNf$a^
z{p@HR*Cw36dYT~$Tf?4NT)|lc-Vooulj1^=Mp*Ui;o1x(e4cgaB)7^6NO{pZW4*NK
zlN|@6eYh1FfRzj`9O3?@IsS<O{}fgbs#1EgHT|XR+>RUwVIY_i2$o0wiFtbch0tAD
z31AAtN`f8@5>{31`a8?*K)f>=fO-NwT7!Yo9`ypsu6sc;A1DX(V6C{uoJc~o#qR@|
zkpNT&^r$v~n}8L9!JhZ2%!mN$cCFFBT2`JVMhV^}GN^vtE>3clp@5@uxUO<vSguq`
zau{%t%HmYZ)A)`Uhl~)QI+*8Cv4`G%Dw53>ElTFZpY3`S+sTR*$OdgxgUW2Bu81AV
zqf|=8Lf20y4%b^Vw=+V6>Oh_bafcJn28#`@H8NTQa~@nx>69{BjO5L3&^9GCuoL7d
z@cLTsfyZ{h2WON9c5*!B)pa!G5A-inQg~0?GJ_v=rM31de`xi!0w2|#kp$QY@&FAf
znoWCILHlj&e-`{X)!^D^omQEA76VEsqX{qv@@SV(vSIiBj2-R5o|?I1dD^Rb-rT^B
z^4rY+OeO4W+*4`t(s8YXE)9ZmM$KT(feV(uVL8<yzJt;sBWN&Z!G#k$^$2%6PYV*|
zjH1C#q{kSMibT0#`%rd8w-Uo3Y@&N2E}_XlZ~qkz=jSdEoyr0zA}Ybu*r#r`ve1BC
zxrdKhSAX3)$Q(K(r84nGi&A%7Zl^CM{R;IEeO6As6YWSl?2Cfy$onupnX`2Ay{BEC
zT=co{GOl?*tx{Q;KnsKcZ{g^d={R#*v}^ln{U3!6Yyt1UDO+<>+bF7-eT`5bg$^Xx
z#uX2eg&af3)l%$At!;rT(5Nucmfx;Q8rrK=Rs(=&`)u3^H+B5ouhU(YN*03gvqK+B
zHFr{v(NAZu6fK0_)*BYi@a&?Wop7j<!dJ=`uFyJra^xOM0c&KpV3o=O0uW8|{F%Ec
z*-Y`~h=k6uf8_o1g|<H|A-yq_YQOsbI;5pi6tUCpIFO){utR?b0H-Uh)U8P9p?&S}
zb9X8~rKD6i{78OWbbP-#a3tBu#GXX|k@EPJdToK{hP(5YV^`|dF6qM}JE<uFBDvg_
zt5hiP*ff0zW=+(gE&tA2zRU^(9-AYVW6t$Y-bnPx`~E5w0z5WPE*csR&;*uzxX)1K
zP1zac2n>Qy@JfhK-TPl`9kWS;*kri?AFY7G@OVvEqDqg|Aeedxmmxj*O@)2e!1lDi
zmM&~?8+!Q~mFKJmwrB4;cwi^RMpo4Ou>E<k1KiW7CA*+r-+bibQHg+2%7<RngPb+D
zEV*Q!3RJIA$w!&LQuv$Z^5oxGiBM6;hkC?>P@e+9cUrC>^%_NdKwp{qWy)%{)CV-F
zAoUtWe3Sx>v!HDJ*!hGtsUY<lC4Bn20Ip2ts4@-BmMh^SfITezF{J9)QIU}llL}6+
z0qp53!>nsPil3~h%_pxy(`!I`;MHu;6ApcauwTQK_z}P!)XhP@V8iDvnpQ}9wbK)w
zl_u=+lkDRaj9x8vENy*;3HiG#9LaLU5B;e4ps>G58Svkf0V<5U`cd#<9&9<wmQKm#
z@4NBuc<Oq-p1Af*G_iYL)@xD$=+%!IOZami>vG15@p&;`ado$&5XR!+mDK5zSUTJl
z2wkIoPiKAaq<x9X^vDVQe~|buWoMLwFbsm>cQ0edI#?6qRm`F>Sz@*qy}$f5CJw5R
z3-HhtI^g5yZF}>>IsmXJeJ`oD1`_>a`}@ngS;YnR9Q{zFegkwD{h>rci9viIqz9q>
z5xZr@n~nq%qu!&x3xYBj2HQOIlv9MhCIk4ub&5tSb<3eE4cn1;!ksCY!XqIdrB874
zydxonO+Kml0r<nZ&z;lguVI8_ChqN!Z!JKm%R*js^cOJ#GZVXXlCS_sAo`iJ3t187
znAl7|L&Bjp=nJ|sjkh?09TS^^j~a&-rG8S#AQ$l;HG&?~2kS$S^6yZTVGPPjD;19L
z!L-%$!I)AmFKi+EyApBFjhGK6I&!YAsRz=?6(W2vi7EJCMM?*hqX?(Q;}#)=NnER>
vfb#)_ms+v*7sq?pUmwf)KCjE^GTo=+?y$eCx9hwdch3O;rS(y9*@YeeFK0EH

literal 0
HcmV?d00001

diff --git a/demo/undocumented/advection-diffusion/python/demo_advection-diffusion.py b/demo/undocumented/advection-diffusion/python/demo_advection-diffusion.py
new file mode 100644
index 0000000..e818afc
--- /dev/null
+++ b/demo/undocumented/advection-diffusion/python/demo_advection-diffusion.py
@@ -0,0 +1,127 @@
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008
+# Modified by Johan Hake, 2008
+# Modified by Garth N. Wells, 2009
+#
+# First added:  2007-11-14
+# Last changed: 2009-10-06
+#
+# This demo solves the time-dependent convection-diffusion equation by
+# a SUPG stabilized method. The velocity field used
+# in the simulation is the output from the Stokes (Taylor-Hood) demo.
+# The sub domains for the different boundary conditions are computed
+# by the demo program in src/demo/subdomains.
+#
+# FIXME: Add shock capturing term and then revert back to the Stokes
+#        velocity
+
+from dolfin import *
+
+def boundary_value(n):
+    if n < 10:
+        return float(n)/10.0
+    else:
+        return 1.0
+
+# Load mesh and subdomains
+mesh = Mesh("../dolfin_fine.xml.gz")
+sub_domains = MeshFunction("size_t", mesh, "../dolfin_fine_subdomains.xml.gz");
+h = CellSize(mesh)
+
+# Create FunctionSpaces
+Q = FunctionSpace(mesh, "CG", 1)
+V = VectorFunctionSpace(mesh, "CG", 2)
+
+# Create velocity Function from file
+velocity = Function(V);
+File("../dolfin_fine_velocity.xml.gz") >> velocity
+
+# Initialise source function and previous solution function
+f  = Constant(0.0)
+u0 = Function(Q)
+
+# Parameters
+T = 5.0
+dt = 0.1
+t = dt
+c = 0.00005
+
+# Test and trial functions
+u, v = TrialFunction(Q), TestFunction(Q)
+
+# Mid-point solution
+u_mid = 0.5*(u0 + u)
+
+# Residual
+r = u-u0 + dt*(dot(velocity, grad(u_mid)) - c*div(grad(u_mid)) - f)
+
+# Galerkin variational problem
+F = v*(u-u0)*dx + dt*(v*dot(velocity, grad(u_mid))*dx + c*dot(grad(v), grad(u_mid))*dx)
+
+# Add SUPG stabilisation terms
+vnorm = sqrt(dot(velocity, velocity))
+F += h/(2.0*vnorm)*dot(velocity, grad(v))*r*dx
+
+# Create bilinear and linear forms
+a = lhs(F)
+L = rhs(F)
+
+# Set up boundary condition
+g = Constant( boundary_value(0) )
+bc = DirichletBC(Q, g, sub_domains, 1)
+
+# Assemble matrix
+A = assemble(a)
+bc.apply(A)
+
+# Create linear solver and factorize matrix
+solver = LUSolver(A)
+solver.parameters["reuse_factorization"] = True
+
+# Output file
+out_file = File("results/temperature.pvd")
+
+# Set intial condition
+u = u0
+
+# Time-stepping
+while t < T:
+
+    # Assemble vector and apply boundary conditions
+    b = assemble(L)
+    bc.apply(b)
+
+    # Solve the linear system (re-use the already factorized matrix A)
+    solver.solve(u.vector(), b)
+
+    # Copy solution from previous interval
+    u0 = u
+
+    # Plot solution
+    plot(u)
+
+    # Save the solution to file
+    out_file << (u, t)
+
+    # Move to next interval and adjust boundary condition
+    t += dt
+    g.assign( boundary_value( int(t/dt) ) )
+
+# Hold plot
+#interactive()
diff --git a/demo/undocumented/ale/cpp/CMakeLists.txt b/demo/undocumented/ale/cpp/CMakeLists.txt
new file mode 100644
index 0000000..6313b93
--- /dev/null
+++ b/demo/undocumented/ale/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_ale)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/ale/cpp/main.cpp b/demo/undocumented/ale/cpp/main.cpp
new file mode 100644
index 0000000..fc8c2f8
--- /dev/null
+++ b/demo/undocumented/ale/cpp/main.cpp
@@ -0,0 +1,60 @@
+// Copyright (C) 2008-2009 Solveig Bruvoll and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-05-02
+// Last changed: 2012-07-05
+//
+// This demo demonstrates how to move the vertex coordinates
+// of a boundary mesh and then updating the interior vertex
+// coordinates of the original mesh by suitably interpolating
+// the vertex coordinates (useful for implementation of ALE
+// methods).
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  // Create mesh
+  UnitSquareMesh mesh(20, 20);
+
+  // Create boundary mesh
+  BoundaryMesh boundary(mesh, "exterior");
+
+  // Move vertices in boundary
+  MeshGeometry& geometry = boundary.geometry();
+  for (VertexIterator v(boundary); !v.end(); ++v)
+  {
+    double* x = geometry.x(v->index());
+    x[0] *= 3.0;
+    x[1] += 0.1*sin(5.0*x[0]);
+  }
+
+  // Move mesh
+  mesh.move(boundary);
+
+  // Plot mesh
+  plot(mesh);
+  interactive();
+
+  // Write mesh to file
+  File file("mesh_deformed.pvd");
+  file << mesh;
+
+  return 0;
+}
diff --git a/demo/undocumented/ale/python/demo_ale.py b/demo/undocumented/ale/python/demo_ale.py
new file mode 100644
index 0000000..4464d30
--- /dev/null
+++ b/demo/undocumented/ale/python/demo_ale.py
@@ -0,0 +1,46 @@
+"""This demo demonstrates how to move the vertex coordinates of a
+boundary mesh and then updating the interior vertex coordinates of the
+original mesh by suitably interpolating the vertex coordinates (useful
+for implementation of ALE methods)."""
+
+# Copyright (C) 2008 Solveig Bruvoll and Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-05-02
+# Last changed: 2008-12-12
+
+from dolfin import *
+
+# Create mesh
+mesh = UnitSquareMesh(20, 20)
+
+# Create boundary mesh
+boundary = BoundaryMesh(mesh, "exterior")
+
+# Move vertices in boundary
+for x in boundary.coordinates():
+    x[0] *= 3.0
+    x[1] += 0.1*sin(5.0*x[0])
+
+# Move mesh
+mesh.move(boundary)
+
+# Plot mesh
+plot(mesh, interactive=True)
+
+# Write mesh to file
+File("deformed_mesh.pvd") << mesh
diff --git a/demo/undocumented/auto-adaptive-navier-stokes/channel_with_flap.xml.gz b/demo/undocumented/auto-adaptive-navier-stokes/channel_with_flap.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..43f7f3b4070ea64e6e075ae9803ee1be618dcfd5
GIT binary patch
literal 10417
zcmaJ_cOaGj_s`zf&gSA~MOMj8gquCGC1h_`T%l~TLR=$TAzKJt*?U~F%E+GA9toML
z-*feu-{0^1`|F<bex36=>;0VPfg_6e68nLw_9eWKL^YRZB2-~V(9mVSEdSj|`N~a_
zNj$xINK(Y}OD}T^giDF|tI&O2#3#cyxzELCIlg|;^sToz@GHzyoy~R4UN`0#K>hgf
zWG-p%$++_&d@j?Mij1wx^heRMO`1#n^~_Z$w01sSbUoai`H}9^apH>Rx^G;}Up$7F
zRve)eKd)v;@hWVVqegxW1q-pMH@UrGJRb};N^hr_uC3qA_BeWQjiPJ+n^(RtAAQkX
z(TuL?JwJuC)jE8;*22_YrWIl<P_9KZ0q{$bYZFbsLi{H9eta~Uq6HFBwt&ePHV1yc
z(PfCYgO^S41fX_7a=o>RdTs-x&q8#&qsL!r4KglAo$&ehkQ4G35F{FNWCETmfe5l(
zGIE^(8ZDR5$Dwi?p+UamPj4crq&gI>kOD5QZltE-iz_qMjJX+3iqj40xX%*BZ96pL
zi(ZLt*u<XLd(M`&ftN=D5vC8G$@MzmEU(Pi?j`RcRDu}8EY@D~a7-nfnK@s6VF4+8
zA8?y5vXDFrvEos8)I=t?+;B1;&?Q4mYWG;N3?@pYH!y%66}lYUJHb>7QUDibWX5f3
z(FOOOSYsaQWCW<gQ+Z$8NG0OQEoU%zu=R#!A$Fqbga>7{p!+#xFe74t)&6czKFZ)W
zBdj9@{>v(H1Y0p+<_XZ#6ARecVQ%RGsti-@$mS0#$Hss)`_!*%fh7uo2?NwY*XqRa
z>(&FQ?1xOjL%FrWLpk)qL&7iIgZ5VZl_;HE2tbo)+|28K1a<bG#7>vm2PnW{7GT0L
z>z>%t@~zL@!9Bd)@c{<|S_FP#SLNpVRELC}s1L01g9ki5xVGBPetKwRRp~S!I+^($
z;$uhOBV#00`N$x8E7^m~r}CEd>Z`y8F+Th912fOO%}S}pq{d;330}XKe#06Q!qSP-
z>ls^uj2Oo@i7n?8Yi^#Y$Q}u+%Iy?q7|&FEkAzJnoN4QoXo7RUb-MV(p?bAk0{oM8
z`t=D3jcV<LO#NqD!(4~mhHT6@#Q3sQPNYvx%cJFHBae^YZaY?*YE+l>c;1*O<Cz+@
zu1|9|Oqdx3fBjqgmq~qzoQ&yq@XRRW!t!6()TsGj8PCKYB>#c{x2FFcXWOy){J2t=
zI|AoYgvE_zy!GaaH%5aQHMN1iQ2H9%#bJA;j*ca1lg0Vf#YO)X4N)v#YKo=p4R5^E
z*MRHm8jp?`+yI>Z6yJ9j=U4ux(*>2MKJ4kgO#k79Dq-#|`P=KTWHMG;s@j5)Fc>@@
zbrp%9kaPN|FAmQ|#8c*YtD@(;vNX-PglDR_r`oa7XB0eFIvFxk!ZUH9{{zB`gi?pa
zDuCIa$NnY2Kw_9m>b*$$>U9hzcu^slN{;+KE~vx?9kq$F0&DTtIc!CFTk1kKUq^I2
z^O7p>Ig<Er04KGhI(w=@HuYcP`pv^VbCW8?QHhPZY7;LX^vV=n*}4U|?|)yInuT8q
zljjR7J7~f=G!ulsqdO}2fV?*MAPu7_({Y&BpyIqd`f%j)*0Tp`6eFLVbCPVyP;|z4
zsOwVNYE>nppCJsBwxXX5d;pEo(Lq8>w(2=<nh>3cb*VHU(-K^-e}JRmLN~M}htvO%
zZb&e!)e(>2dOBa$ggj2?KoD+PCLoTI+9Tcs+ES9*C#mUGrQ{S-&<#1~1lp1j(A5)?
z+Is?`VLbytBhvZGKsMnAu6WcP5mXTF&xvF=DWxFBh-|QT-b482PX=*3D>*|gzJNG-
zx|E-H&awh+@d)UoSV--w0e&KYik;wkEs)qWdur#g^7aedG(SKK!i_YgAh<rIEn5X7
zCl!mEW&&gdfQ<lX(vZ@LQGjO!TDl+V)I7LmMr!zRU2VZ}&L=MTA7<0{Q##S|7iQ$T
zH4k<y05duD1;<}^xI@d4Ulp24LdX5+hA^SHY0GUBf)WEjALx8;0);B!^n-u~-NorI
zdlQ%_%;DvDNtV1r<Xzs!X6#+B2t0P>JbOt7v=YeAWHhbwt--bePUq!(lw(Di{+~&|
z3FKh_>igZsYHW#!$VNu@VmMGq3~m}5@Wb@Gb{2x`J^+qQ#Cx|_m3dzd^^f8K9z(jJ
zq{XxK*R{0Y#f?76B%Dlg(iE`q80!sM$F8KZYTr%}_qIbwqr^YF@!+|aIAE=?s=mS-
z(un8#Niso*)NW5Y^q2{n%t~kh4r4Ep{G}|-u=;3Sohn9;_iD%iJK1e>iD({fR5}-}
zM>^O3n+ZC@!Y_12MWb{Rg~N0cMW67QC^y6v_PTHs_S$e16dlDBcs4{8R+OUn%e2Dz
zD|MdnS850FSL*r{!5N7>lDSR-JQeo7Zbe3qJcv{uF^cSq?W(IiauWQsx9_w$cE3=+
z*{tPgxr?T(TeWom9iG4Npt#AswaxNNG{Gd=#I5)#NOiP)1SAB7R9EJqqb;TqBY7%B
zM;l4fA95{3Ro;}WKV${UYI{k3J@<eD@0En&w7+}y9v%;g)MsVs8cZ#0IYLs!O=<67
z!J%zGyqETA{9X)3_tHIj86vIP98H~>IA7-Z2||u=aQn7kws0;bx1Fn%9Jzc&THDeU
z)n70CwtJ!EM0atT%o7%_e{D7o&}#6@kFdY#O>eIOjwHqqD%|D0sR#aBHUZ!J>s&Kv
z06&LV6d{W6xaTpA+xVq!9}-FRwR|`Cu;(E`B*|TBOH5lrU7Q-h-i6(Q$_#oLHxqkK
zlF;ApLgLYc+`-R@xa%Ue=e#_NTZ)rN7bj?;bGLd9qmPZLjNwtR=Dn#8zL(`C4!+6H
zB~`nA;s4x3H$<xTX_MA0K&DtWw?5L_Nbmp;O=p2QHTB3eDaUod)ee~}Rit(ql%hw|
zMsP)6cz9l9%<ZMyv4c7F<(vb&S!&a{4x6VrxIGht&B@y@9jgwUJAFPg>m$<T#8ac(
z<xEjeK8HQcz9E~f7}7>@gR9Qf%GCZIl9}3L#*jOwvH2@mCW#KW{6ZKrwP}spwGfhG
zziiiR#VoR$^L&Wl5n?`*LTdZ=ezH=WU}l_9vKzRjHTM}NX>%227jiC}Gh90i9l$T5
zE;KDr%*qU2l~2j4Gulwxz2fVU>q5<3v_VyWEAUYC6f|xs5U1$RG0ZgfE41Ij^ZSBW
z+fj!ewKMhpI$EMlTGUbQl->4=HoLelPyXS`9<*<biuIei)^`84d&-Q3`7KLwtueBW
zZ%}nld*~wZC>g#ls7lJSmMxA}Pnc@mU9x^St()3Cc*D@*gmvIBl{iL+SK?0ev;}FK
z7CGMh)zZz`SGB)7b4yOB<HqrPiQOq6!IwoDbv8w&Q}H6H@D6?)&Av%Gv>5kWC)Sr#
zisbHCJ(E5e5iZf8N95kWmAatk*?(*N)(QE^{G*bc^1+-+pRo#ki+o81!R^i`Mg;nd
z{Gg;-6jOVdorz%4E;IiC^^l8+aG_NZd5Y-ep&@@0;c6>2BeTJliqQNdOdWA|b)`&w
z(2``ud;Tx{P(mBO@?UI*eNIlMWh{>c6TfFuvf7c_+m$VO2)^`?CudD}uy-pf@p9(h
zv}ckW8y-0{aa$NS7)!nGY9f?mu-41eo%ObTt9hxRw)$|5l&@Rfs9?UutvN7hT~(r6
z$EbU?rJ^!SV&nLG)lhnzc%2+0q2-$Dv3%O5>{c^wBpnfXygT0Q?|3)YtFAoUV~Chz
zlsQXST`Sc<dB4g7u|!(jQzeS=P&E7y_B!XjH%<Gi#@pSq`^*C4`&*ujbnUMyK&(+O
zjD=XjPfGa1q)}{=b%J`RRsDr`WsHZ9J?9Pd6m{pqUQgc-iD7$L(p9m#CNQ&aix@9u
z)LOb95%WDgmW|%$);k(DDFLG;13d)2SWjVyG~0L-Pk_`;<Ze4x$)|J4raKm9hDmQu
zj(sv#4fMqHdM%C=-f><Di(u|vZ!Ah5^!Z}(!7{>NaXfKFmw?T47{6Y}GQ#eKm0sP0
z(}oqcF*?`*b9bRh@dk18Tdz(kLjdvj_4C)4bmj|Vyb+_V^3rpB`|{Sk=bV)t74rSY
z{eJ!(lH`#=NoVbiOgBETgaO|vWx0klKEFC6-)BE4xm1b+I?2Y}&%Lwryf+cmG#ASe
zb`t6L>OKXCS>p>~`Qw7pp(63pl*1Zcf#ETl^2aP??~27A>AdZh)=pjf#%Nd&Ks2sz
zzA?LKexG;a#!9%$JbjXf<qjCMQ^2<L))%x7`?5<qMY^@>o&nQS&2BaeA(t{xKi_bR
z=;eDkd-7=jWx4UDn^U05^E7Lp6epc^3mv9LbXCXLZx@fd)LfY|B#OSYQ)X=_KUPDe
zw2v?(fxcws)$A>M?+N^NZ?JRYlhPwOB?kXPvV5}1z;}l<sD<IHWT6G;!PIO+kOcRU
zcn)3yR4{**ggMXZTj|%cUMWuqmbQXYGn$Jzo&_rr412>{)CUUTuOB9*n9xUm!kg=P
zD(XlG1%--`H|mH&0=$1kdDsklL)vj(jZ4PuiEx}kk2mRCKRnZcGwJO={-6v+R}AB#
z?h%Y_f~*k-e)(0+mJXUidO>?WM93cP01t-y?wOUWg402#oEiQ<zC_M1W#um7SR+O<
zM$b8XZfi+-7`l9+C%#f(f}>}`#t7=QW|zHEFoWAcNG-zlwh8ZLMgUjV;)X1g&(HhP
zOV+ZOY`K^cyx3>oy@<r1NYMO!4->ZQjn6nzo`n`sf4rBqaqb;wHR^`s_qkbP)|d6*
zt1Ca%ly1s!YZn_DV_wIwCW+Q-VoAIz6Q~YKDhV3U-|23B=#>?(>q2x3wC5|uCzsip
zhj~vHJkHq84Dy@{QXN=|$yx%JuV=kI#xddO>R%?zp$ZEUl5XQ23b692jBAL8;c#E$
z34e~~TEg?r6ve39ikg$<SuNyOmcmgKP^LEv+(P*ZkU6Ve>(Ul!=B47Q`JUed-d+nN
zZ33SM;BY~u^_a%}AGQ#hi7Zic^sOh-9ittTh(dM=Y9I5-LJD+QcYC{IK#~h%PyO4~
zIHYh^e)>?)37j+aXzw<y-BU@)(DOqca+l|Wli3K+7-xFo>U74Et0`v`)`%EVd}Da@
z4SGyi-le#VZ$+~2I?;h#P4hozWg+486r}i5apd<G$q=PWa`uZ7@&v)9YJ_*c5!6ob
z19&49fM<}`0C=r#V8b4Z0F`sN7(xJju8AWC)g=ht)=|t4Hu**ePN>oYk89dsw2{W_
zL_Zm!R@}g|7EzjeTS#Fxpn^`O4SM+=MWFk>gDl@52jQLh4*;=&V}JlUy8y>%pbXdI
z?C6oUoQpIC8nFWeaVnC&imoldafiC=1)0M%KJDNlzB#m*fJ!NGTdR|E76>qFORXQ4
z^np@aMyB?7&@)(Ld_`jXDGSnYa`ZY@-7m&%mB?u0#6z4r$R>%G$i6!-a770m-NrK-
z03d@bEQF{upGT?`Q4v=YP_T-D4GRdZp?qZi=tCi15EHUp7jFe|8JF|5@|3`JSG18O
z|0B6dKf8J4obZa8i?Jgi2-?~#>@AX9rH3CJ7GUPfpaoL`gHl}t34)!=nItjzHx|kJ
zmfw~T<5T=%y+vB+mKh{ycR2`b3<q50UQ7huQ5=|;uw*2*6jG^*usNE$&)z!Jx+wC2
zfa=I7;K@jX`%u9AD1NYIjnUW2Adbp%Cqe|YfCRtOv&t1sh#Da7;5751C5}9?T|f#a
zG43#-mv3u;`7URK!Xyg6_sN<K7y+sxpvv??-!iRz%qDm*tF<Lb7VfO&GYG)ifHS|{
z0+Pbf34akuLUkUaU9lp_S}C`k7Sv!Y4?eDnlmp=NA+4WIilY63tb1osKi_)3vOIQ}
zZ#L@#C%dNse1cfMvp(5tt1h^5qNodhAAoOg7)U+OND|ZTQ)x$diXgrwL`8Qt(8f9U
zw&fxlK9sDM`faSYGuju&532X-GI8WfY(9}i>B3;++t}LIj3lj}SvK-KleB(tj|{(a
z3|o6AdVqH~InKSd6nGPwtNG^!2=JYMK*Cx?E9J(FTUr=Y!$mvG&2;DP%xmKZPu3N<
zp>aB02FR2V16))i5;8AfAifp9hqCeR^g&tG2M(+V*^2Rf-1v-oV*DbGS4ISM?efwQ
zu>4ad06xXS%XUL7DVU+3Ced;zLn06~tD#@^;go-*td{Ym8=$A(ybs0k5?F6#Q4?<@
zC%U4eP6YZ}AmPmRKy>CpAi7PgEbHE6l&n_sLI@E2t2h$F3j7;q`xSFItCox{xCe^G
z*h2yAHGr7_7(5G$H368Mkt=el1P`kz&G!eh;&OHumu8>ZDqLF?z4Poq%s20jSzm>t
zT6PS~zhyN_Iz^#YLmzzLZtRAptZ^b-$@{e;KsBjTxP;_zJ-Rc06Zi~o7a?zNd6^R#
zvwhC6sixj?={=z&gi<1wRt;y9;}-+)MC;fm!Te>j2wZsV3T5Br4NYf*6)CL|F2G|)
zmnKEuF@u+yQH0x?B=1g1AnNmb3+UJ*c!R+PfLS%Ldq_2Q6sX=>A&FXhB5L%&$D!BD
z6scGZDc@r5Vi~nurGn=p*zfl|e@%*iXUza~g4112gfI>14Q9!FH?QYv4OrqE-rNj#
zzM94t{sZ?D?z5iSJNMrE1hqECovw^Htl*156CwD?1pE8NRYZ&XcY{5PM8bkS(x5@=
z19~c!^_dYx=9#vd*yQ5Jb@(i=-k%x3L+6<c{LsScHA!m7?kqfX=d{|D=R%>2M*Tv7
ze)HH46AgzDS~8A*o>=srJHP1}XN$8a>xYv-O&S*BADGF?PR^;a$fxH!NRUg;+@cBM
z@Q;Js`$<>F_FFA~frPlx6?>wIa>;wmr7-DpZOZYycO)8F0bDk|$|Sx+yRi7TvR?yv
z{zhvQffTd9q%z>CLZg&jybZP)x)h&rCmGA)4UqO`DGzMMLt^CfKFalG;cQ_>y056P
zh8DB!;qX5re3zh`tQIdxsxO7X(;=iV=PhsnJT-pDXO?X$dI_Mgmk)`KP8r5QC)a8r
z&&BmnFd6XoVIazKJY+x%)hoAAfCGWXs>Nr{NeUAcy(UCroB@`wVia4hKaljZB%J61
zt45H{og2qCTjcSq_?C>vdH5Le{a>-m7@oY+mrrFG7+SOQ#C~Oz>|lshKAQzf!hn?C
z9F-8+XqhAc$qv%uEJaO&P6*4x!2!gQ7j2MP#un>|cwC3=0}9skyFle@*amMSA0fr~
zo<(62vGt95ODQv54}`2PVOxRHBm!zjVgxU`qz?ir2lv#P#Bce^`$I46?CP<UZp@5W
z4oQqRQ1=_H1>_$sdxZ590M`CR_zhQV=Yf~P?*?lA3sk*GM$)?FoV<hc3&$UpJK^9S
zqrVU;2sBwGUc5{t6h=7RJfB=4UTp!6uozeMJm}&*6HZbUG$CdW%oJdE1A#xD2&v?x
zWXk}Xt(bdl8JYbcp3k<B5;T#ufe!+uj*P|Mefh}j09RjW=p&~u3ZmVoMFea~5Bx^f
zHbXU<PI3=m2kI*!qm&2ZA(2cQ^GJ%~81To`D=Kv2Bdwe)dNZ=DVhbf#o?C|9x`=^B
z%>IS3$tCTZ#@`i%u>p&Il-e5F{1?O_Cmg;z`WxH(c%zIZ0><-qct8A;-5*tuKS(!#
z#HpGd#24=8y*A1^CH97X#bU?UfE(Osgsloq=PowS(VJA^>eEgtIgCvppu!)Fxp%DW
zoZDro+TW$l1}D^?GpJEV5S#F^2OcZd1kbkz$R_Qx13CD@f&8S^kjojIDs=5%x;R-z
zs_=~l*#3k@X$}y|aLVK#i^D-M8P@%&AW7>sLx!rz1*awCOnLF8C9*)6j4rmbFJKbK
z`<>+8(2(*ZpkIzlK);f*l3~Y=DmlG|U9)(4LO@fPv4vxUj)FQkX|bj4X}`A%EWUz9
z3?Tn<1AnZA{lUp6^jE*IZVn{a0LiedZv-uzEQy}Lr@-%K!dds0?R$ZAiOqzt69P&}
z{4;z?wgk|W_xMJdl-Mf)DDy`|8I)FDuDHO4)_R-=e8N@zvXt(@VF@98a`Uwem#Dd^
zW-Nr$uCOpnopGVn5nZ4Zj}+I_gYiU*SeOn(KoHH5j_43-p0^*F;vnA{kZU3u=&wOz
z0B{_6s#|8B_U`9Z_PDzsvv03J!_S=26^f9!cEfj^W+^<Fa5<;DG*Djxmc391d4GP?
z-w>7!>(j`VPqK-)IQK1RKbSB2eeUKN?$B13L9K$>rRTk+PCK?7t;`i(F1bd<gIV6X
zICe%ew1qTeNOL{^*`GpjB7c9^=)2)5Hm%dQGo0$^j}zSSXgfU)2@KgcaZf^C+)i2I
zQvQGli?c`0!X-h(WdyeoZr6l^ub?r436Kg$GNB2Q=_`ep6v%UZWBWnP`D=1lx*;lW
zC*?~#alMEf$6Zn{kg0zlcwV?(Bmz(#70c1fPR(FdE%As8d9wkmitMrY<}sd<*^sOe
z?ko2g%(mzIS?o6EK8k>C@14f2Q}R<g*Rv{yr|61f(pwm^SqAaKb@c?u(~5M^Nig3<
zY{8~QDd7kjJ%oBZrgZn~D#53qH`x3-4g0+160_p1;vwaUgAMciay)kG@g0j-ZJYm)
zG1?vg=PMd(L>ELwuqhaHLixjH8sq|wkYkJ-yRK@P@{?t%Q5GWj)TE`}?Nsc$+8IR&
zXSo7)CfXDyZP?N0U^`wI=4+AiPB@(FIct;UYm)X5KPVk`C{jG+w1>-D*imnJwe8NY
zf6TrZ&|ru~TN7&}_HtD5VCUux$f8k>Xa?+@B@}3&D1{psvf&U9Xgb&PjL974z0h^w
z);Z}y;&hGmU`-+#_mivm<IzPz#n>yfh2<@%Zb=o<7*B@9-PME#rTi^=wH=rrV6)IQ
z?hv;~yT~(Rl4~ra90&&bBiNlEqMn5OG%X_JXF3yZrl-GR`)#<x=+xQ4h;J&yIt=0F
zLUwoJA^Fu^oOrXG=r<=y@f{;$z<QR#b3>oSK}1nEKuo)!)&~Rr5EXU!3m9Po47q&!
zZw~~!3XQJu5)$Vtl{GXL^1P_j4ISu3xQO&hhD82Wh$}O$snB7K$VQlhQLJ9T(>ci;
zZjv=d^>(=i*ug+R3@$3nTqt~`n%VRZRdK!**c=9;B`K5atcdR=4+3N6=iEOLydw5z
zK6V#<CRhM??tY)YApLJj8nDQKaEwi_0>XdTjKpXNMp`mP99FU&i)DQYuwhZ*U?pY{
zNzHlY&*@Iy$O?yKvzyVwJkhK$VI>xo!fwM(B%4_G(8o`TG#lUaMXkg8L=O<}<3hZB
z^~onV-N~%blgjeaO#)$CNNAYRz~5GV2#I*D*z!nDDeD-Eq^iF>$g475Kt`5IEYYA;
zV@BB6pB@cXYs<cWM%;_ZPTmJ{k+H?*A{F*<-~&K_!iN0H=nb6%oJI|RWEud5pFo`Q
zY9J1VtzFQLo8-G=31cN}R`eo)e*;$!jt0?edDqDav>9hr(S!nxL<KnYNi@SHgrD`&
zSVYTa@qKu_x!W61L*)v$4i;AD%_16UH<mGR_$wm@?>T8LzdoBpQa*(QK~eN@bO^B~
z`s1e}A#ResqEdSp&s|sfhng>yXi{{IKZU7B%me#LAQmE0P@O}OO4Um86spgzVy+2S
zU=iaCrgVgr?J48BJ6@ecl2B)83G@EL@;l=Hfh6KOGA1J>tmW}JM#4<sT+c6ZAzcVL
z`q<je6AuKpfIZ~QpbAM>w$y}&QalZHZBuH~fQS}Uw}myxOD+T<@32j;wPj3_vh0yo
zgx;&?@tn!}iYU|V=RGPY7%!O8JNSNu{o|LNQxmUFrG~uYT3@}Xj%<@o=WA|Hq#C3B
z5+<F@a@YNAt)>bpB|juvK?6ErXY>I-qedS|4xc1UUjHV1KPG#ptLFCP`C0EH`EADM
z@{IU_YpH=$-+wZkjSlKq+n%wJa@a35N9%?qKJBeF`tn{GzHzIF0v?u>dzNb;Lv9-1
zl&j;P2#@99*T_z5hR+$lyUun$7G>{ntLCB8x6h9Q{l>WR`K{p$3CPgu6x1w(ZMKj-
z+$$j~w7L+LshM+mvTe*$n#9;%YI@7xv1USh<cZK^K7$K<)3{w@6?8LGYTEgWQ;kE^
zRJEz_w2tv~wLhn;8r*HFdXwzK$mI|4`lc>k4d8hDv`q-b=5kbjO#QH1;!=kQIiA-E
zeQ?L#&nQ2B&#j3}0*L)WzR<KYjKO8Ht>4q_ABx1|g?#u-m&D^u&-bNM<6#eHVyZn@
zriMzUK2^KCiEXT7gKtVyXNMc+R=ZYFNY^-!-JBX~(J-!=2qVOjNnCdwzU)$+9h6?}
z5e2v3#Tlx0si4SnsW{V^v1C!5$q7iW>vR$Gh?+6lxLlt(&tQH;Rg>zrOCj=M1l|wd
zthTN2FczP!EB$$WvwEf4W9sNUWIUT1Pn51>D9K>eT5PAeqJ@_B=3e|Sx<_*}F6UqU
zyy{U?=RKM?y6EwfoJ^$sb!H@{d%k>bkvVw~V|?~&&EtWeSZn<J*@j22H=>oMZ#cfk
zJfENTgSs(~k+wW1XQTjWkJ`H)sUiE15S~bWh?w?0PH03V>GRuk`pR|LZ{>r@U(&}L
z)s#XITBe*up=YY{MD&+m4ZvLlYx4xiR4As6Xs8O`BL!PZuf+Q48KY_0kCJZpxw-YY
zv)o|Vi%=X59hTNJUTKZ$C3|{#@i4xdzgXB>d9@~e`Bp&J);OUo_>$$gdeXebuO9nh
zHt}3{E|L6#sMZv%You0WPguLcww0qf9%d$`XO~xJcr1$YFh`+N=mdGJaLWs$d#V@3
zc)B9{QaS`AmR<?H5#N!f`;3q;A%3BfV|ktDapdO|Uw%!ioLuD>DlarOe8!%SrA+fZ
zw6c61@j~T^rNqE2%mG@fG2M0ddK^naSBH!GE={8-liH824*q+Toq`<gqQD1eH-^)V
zb?~Q`1JvQJU^hPVC)Na|4)=z7%?FyA)Wf233VPiTdN(#&{kxut`ZDs{*rJFn%{81t
zI*#TTLo|`@Tn4YBzpgsnEZ8ZT6mzhNt=GLKykNA~YkgbIJT=iyMKEDsFwQ3a)s-ss
zv8n`PRiC60v8RKYM7ze{uYE{7L0%UxqJ)cgvx$C4JVQ!6n+_kjjFHL3fR8xggte3o
z;%GnRbh#baYd*B!T034XrJpAFC_5G(BlGz5b-imD_kY+;k|Q`i-$VYUI-teK3~kzf
zyr8TGC{YB{C+=*ultn`GW3PoZcG^c*Whcc@1lW_gfG12SE0#+ZVB%ou7cB>KOzSjk
zCw2_?nIDy{Cb@9{uXaCmIQ5YzN@2SD$91~jLL#dh$Cm-rq)VUBl1zTTy_Yy#ak~3G
z6Z}zrb;Map{G0Rs_e^da!?y2RC*;hgy9W*?7k)&1tz6dJkP#Y~7Td9!j6RecwgtG;
zKk?X2M%TnTh)*u7r@I|BPJfv|sK(U9R_XRSL$4@dX$#<^CNeu#*i(M!qD($Uat3jY
z<46>XVpGvYbokwtitbOs3hF&TwpY4`4R)%QKcd+tWyuLdso?8kJa>S<{dI-{m1&#$
zwt8m2IN7Ae1C1A420C<w2<XLKpy@|)JMHU>m6f+mO%0OPWqzN)R6z(1o#&D}GPX%T
zpZz3v?)(;jhVK9r^(D)_Vlx26Uk-JYSUcpIAaFYPTL_=>8|%~Ase1gn$M0}6yCrWk
zgB0zTv?Go+;5jm?8^p+{9i>j&t;-|;es+l0d1vZabJHDOyClSGzZ5^dkL><vzcE^h
z+ClFpoJU53{8*Q#P2ImpKEPNmS%L|JrENY3zy}{1p!ck7-%S0w^?~&$PStu^Ng&RR
zqv&pzUoH*w?9nXspmXYu)wEJt{GX>xShJr1d?EbPp6Mt%;q5jN;sk5z3_}{noUL_v
z{@WrBAnV>HcBxjsBDTZ*5?vFk$F(G*^E~=Y`3m9#NsmzX1@osk%x~nDJ?qh@B0z~@
z?)H0JEV;uy(_It$m}AN&?~L&XV4HgTm}5!i;n4|ktrsmJE;u4vDD#u+>z^#*lJN_&
zC$<UFLro@5A0Kl756#)U;?*nR!^WNi#X`eC&w-H`m;Qk~y!v}AKW-S;=1qq`=9q??
zvQc3jr(N>SfWiNtQ$u3!g&vp7%_mr=0(V!h3*k5Ce{}+Gf}PUpX+fF08g`^lruA2V
zvHdZ`p8spoul);lr}lt5`UXrMqD{5a*rzI%hmi~hV}54h&}NQDZ|^<&URR!Sewy}W
z@;@(F*>djh0(jlA7YwMn9*Vtx$J{a5LQ+pTkFsHx5gfPf0m2(v>}^b8E$$Us{=H;g
zM)dR)PwVW!uorbjGt>T$R{np*g==Q@mmxhO6^--%d*`r^gV|B-3*C@=a?Rg_PW{pX
emLh&OHVY+h+xX3LOf`SGw9mSsYN3R4>3;zF?2?55

literal 0
HcmV?d00001

diff --git a/demo/undocumented/auto-adaptive-navier-stokes/cpp/AdaptiveNavierStokes.h b/demo/undocumented/auto-adaptive-navier-stokes/cpp/AdaptiveNavierStokes.h
new file mode 100644
index 0000000..54306c4
--- /dev/null
+++ b/demo/undocumented/auto-adaptive-navier-stokes/cpp/AdaptiveNavierStokes.h
@@ -0,0 +1,55496 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  True
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ADAPTIVENAVIERSTOKES_H
+#define __ADAPTIVENAVIERSTOKES_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Bubble', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+    
+    // Declare helper variables
+    double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+    double tmp1 = (1.0 - Y)/2.0;
+    double tmp2 = tmp1*tmp1;
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    basisvalues[1] = tmp0;
+    basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+    basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+    basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+    basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+    basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+    basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+    basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+    basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+    basisvalues[0] *= std::sqrt(0.5);
+    basisvalues[2] *= std::sqrt(1.0);
+    basisvalues[5] *= std::sqrt(1.5);
+    basisvalues[9] *= std::sqrt(2.0);
+    basisvalues[1] *= std::sqrt(3.0);
+    basisvalues[4] *= std::sqrt(4.5);
+    basisvalues[8] *= std::sqrt(6.0);
+    basisvalues[3] *= std::sqrt(7.5);
+    basisvalues[7] *= std::sqrt(10.0);
+    basisvalues[6] *= std::sqrt(14.0);
+    
+    // Table(s) of coefficients
+    static const double coefficients0[10] = \
+    {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    
+    // Array of basisvalues
+    double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+    
+    // Declare helper variables
+    double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+    double tmp1 = (1.0 - Y)/2.0;
+    double tmp2 = tmp1*tmp1;
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    basisvalues[1] = tmp0;
+    basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+    basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+    basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+    basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+    basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+    basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+    basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+    basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+    basisvalues[0] *= std::sqrt(0.5);
+    basisvalues[2] *= std::sqrt(1.0);
+    basisvalues[5] *= std::sqrt(1.5);
+    basisvalues[9] *= std::sqrt(2.0);
+    basisvalues[1] *= std::sqrt(3.0);
+    basisvalues[4] *= std::sqrt(4.5);
+    basisvalues[8] *= std::sqrt(6.0);
+    basisvalues[3] *= std::sqrt(7.5);
+    basisvalues[7] *= std::sqrt(10.0);
+    basisvalues[6] *= std::sqrt(14.0);
+    
+    // Table(s) of coefficients
+    static const double coefficients0[10] = \
+    {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+    
+    // Tables of derivatives of the polynomial base (transpose).
+    static const double dmats0[10][10] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double dmats1[10][10] = \
+    {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+    {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+    {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+    {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+    
+    // Compute reference derivatives.
+    // Declare array of derivatives on FIAT element.
+    double derivatives[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      derivatives[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Declare derivative matrix (of polynomial basis).
+    double dmats[10][10] = \
+    {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+    
+    // Declare (auxiliary) derivative matrix (of polynomial basis).
+    double dmats_old[10][10] = \
+    {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+    
+    // Loop possible derivatives.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      // Resetting dmats values to compute next derivative.
+      for (unsigned int t = 0; t < 10; t++)
+      {
+        for (unsigned int u = 0; u < 10; u++)
+        {
+          dmats[t][u] = 0.0;
+          if (t == u)
+          {
+          dmats[t][u] = 1.0;
+          }
+          
+        } // end loop over 'u'
+      } // end loop over 't'
+      
+      // Looping derivative order to generate dmats.
+      for (unsigned int s = 0; s < n; s++)
+      {
+        // Updating dmats_old with new values and resetting dmats.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats_old[t][u] = dmats[t][u];
+            dmats[t][u] = 0.0;
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Update dmats using an inner product.
+        if (combinations[r][s] == 0)
+        {
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            for (unsigned int tu = 0; tu < 10; tu++)
+            {
+              dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+            } // end loop over 'tu'
+          } // end loop over 'u'
+        } // end loop over 't'
+        }
+        
+        if (combinations[r][s] == 1)
+        {
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            for (unsigned int tu = 0; tu < 10; tu++)
+            {
+              dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+            } // end loop over 'tu'
+          } // end loop over 'u'
+        } // end loop over 't'
+        }
+        
+      } // end loop over 's'
+      for (unsigned int s = 0; s < 10; s++)
+      {
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+        } // end loop over 't'
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // Transform derivatives back to physical element
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r] += transform[r][s]*derivatives[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = 0;
+    vertex_values[1] = 0;
+    vertex_values[2] = 0;
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None), **{'value_shape': (2,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_4: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_4() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_4()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_4();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_5: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_5() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_5()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(MixedElement(FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None), **{'value_shape': (2,) }), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[12];
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 13:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 14:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[12] = vals[2];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[13] = vals[2];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[4] = dof_values[7];
+    vertex_values[7] = dof_values[8];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[12];
+    vertex_values[5] = dof_values[13];
+    vertex_values[8] = dof_values[14];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_4();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_5();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_6: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_6() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_6()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_6();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_7: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_7() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_7()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), **{'value_shape': (2,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 20;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 20; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 20; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[16];
+    for (unsigned int r = 0; r < 16; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 20; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 13:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[12] = vals[1];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[13] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[1];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[15] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[16] = vals[1];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[17] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[18] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[19] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[10];
+    vertex_values[3] = dof_values[11];
+    vertex_values[5] = dof_values[12];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_6();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_6();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_7();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_8: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_8() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_8()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_8();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_9: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_9() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_9()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(MixedElement(FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), **{'value_shape': (2,) }), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 26;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 26; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 15:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 16:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 17:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 18:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 19:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 20:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 21:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 22:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 23:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 24:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 25:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 26; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[24];
+    for (unsigned int r = 0; r < 24; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 26; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 13:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 14:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 15:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 16:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 17:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 18:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 19:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 20:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 21:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 22:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 23:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 24:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 25:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[12] = vals[1];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[13] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[1];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[15] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[16] = vals[1];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[17] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[18] = vals[1];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[19] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[20] = vals[2];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[21] = vals[2];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[22] = vals[2];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[23] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[24] = vals[2];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[25] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[10];
+    vertex_values[4] = dof_values[11];
+    vertex_values[7] = dof_values[12];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[20];
+    vertex_values[5] = dof_values[21];
+    vertex_values[8] = dof_values[22];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_7();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_8();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_9();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_10: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_10() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_10()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_10();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_11: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_11() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_11()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_8();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_8();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_11();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_12: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_12() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_12()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_12();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class adaptivenavierstokes_finite_element_13: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_finite_element_13() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_finite_element_13()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[12];
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 12:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 13:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 14:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[12] = vals[2];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[13] = vals[2];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[14] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[4] = dof_values[7];
+    vertex_values[7] = dof_values[8];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[12];
+    vertex_values[5] = dof_values[13];
+    vertex_values[8] = dof_values[14];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_11();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_12();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new adaptivenavierstokes_finite_element_13();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[2][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Bubble', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[2][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 6*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 6;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 6*c.entity_indices[2][0];
+    dofs[1] = 6*c.entity_indices[2][0] + 1;
+    dofs[2] = 6*c.entity_indices[2][0] + 2;
+    dofs[3] = 6*c.entity_indices[2][0] + 3;
+    dofs[4] = 6*c.entity_indices[2][0] + 4;
+    dofs[5] = 6*c.entity_indices[2][0] + 5;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 3;
+      dofs[4] = 4;
+      dofs[5] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None), **{'value_shape': (2,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 12*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 12;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + 6*c.entity_indices[2][0];
+    dofs[1] = offset + 6*c.entity_indices[2][0] + 1;
+    dofs[2] = offset + 6*c.entity_indices[2][0] + 2;
+    dofs[3] = offset + 6*c.entity_indices[2][0] + 3;
+    dofs[4] = offset + 6*c.entity_indices[2][0] + 4;
+    dofs[5] = offset + 6*c.entity_indices[2][0] + 5;
+    offset += 6*num_global_entities[2];
+    dofs[6] = offset + 6*c.entity_indices[2][0];
+    dofs[7] = offset + 6*c.entity_indices[2][0] + 1;
+    dofs[8] = offset + 6*c.entity_indices[2][0] + 2;
+    dofs[9] = offset + 6*c.entity_indices[2][0] + 3;
+    dofs[10] = offset + 6*c.entity_indices[2][0] + 4;
+    dofs[11] = offset + 6*c.entity_indices[2][0] + 5;
+    offset += 6*num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 3;
+      dofs[4] = 4;
+      dofs[5] = 5;
+      dofs[6] = 6;
+      dofs[7] = 7;
+      dofs[8] = 8;
+      dofs[9] = 9;
+      dofs[10] = 10;
+      dofs[11] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_4: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_4() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_4()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 3*c.entity_indices[2][0];
+    dofs[1] = 3*c.entity_indices[2][0] + 1;
+    dofs[2] = 3*c.entity_indices[2][0] + 2;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_4();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_5: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_5() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_5()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(MixedElement(FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 2, None), **{'value_shape': (2,) }), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 15*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 15;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + 6*c.entity_indices[2][0];
+    dofs[1] = offset + 6*c.entity_indices[2][0] + 1;
+    dofs[2] = offset + 6*c.entity_indices[2][0] + 2;
+    dofs[3] = offset + 6*c.entity_indices[2][0] + 3;
+    dofs[4] = offset + 6*c.entity_indices[2][0] + 4;
+    dofs[5] = offset + 6*c.entity_indices[2][0] + 5;
+    offset += 6*num_global_entities[2];
+    dofs[6] = offset + 6*c.entity_indices[2][0];
+    dofs[7] = offset + 6*c.entity_indices[2][0] + 1;
+    dofs[8] = offset + 6*c.entity_indices[2][0] + 2;
+    dofs[9] = offset + 6*c.entity_indices[2][0] + 3;
+    dofs[10] = offset + 6*c.entity_indices[2][0] + 4;
+    dofs[11] = offset + 6*c.entity_indices[2][0] + 5;
+    offset += 6*num_global_entities[2];
+    dofs[12] = offset + 3*c.entity_indices[2][0];
+    dofs[13] = offset + 3*c.entity_indices[2][0] + 1;
+    dofs[14] = offset + 3*c.entity_indices[2][0] + 2;
+    offset += 3*num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 3;
+      dofs[4] = 4;
+      dofs[5] = 5;
+      dofs[6] = 6;
+      dofs[7] = 7;
+      dofs[8] = 8;
+      dofs[9] = 9;
+      dofs[10] = 10;
+      dofs[11] = 11;
+      dofs[12] = 12;
+      dofs[13] = 13;
+      dofs[14] = 14;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[12][0] = vertex_coordinates[0];
+    dof_coordinates[12][1] = vertex_coordinates[1];
+    dof_coordinates[13][0] = vertex_coordinates[2];
+    dof_coordinates[13][1] = vertex_coordinates[3];
+    dof_coordinates[14][0] = vertex_coordinates[4];
+    dof_coordinates[14][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_4();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_5();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_6: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_6() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_6()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + 2*num_global_entities[1] + num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_6();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_7: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_7() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_7()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), **{'value_shape': (2,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 4*num_global_entities[1] + 2*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 20;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 8;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 4;
+        break;
+      }
+    case 2:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+    dofs[10] = offset + c.entity_indices[0][0];
+    dofs[11] = offset + c.entity_indices[0][1];
+    dofs[12] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[13] = offset + 2*c.entity_indices[1][0];
+    dofs[14] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[15] = offset + 2*c.entity_indices[1][1];
+    dofs[16] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[17] = offset + 2*c.entity_indices[1][2];
+    dofs[18] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[19] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 11;
+      dofs[5] = 12;
+      dofs[6] = 13;
+      dofs[7] = 14;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 10;
+      dofs[5] = 12;
+      dofs[6] = 15;
+      dofs[7] = 16;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+      dofs[4] = 10;
+      dofs[5] = 11;
+      dofs[6] = 17;
+      dofs[7] = 18;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 10;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 11;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 12;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+        dofs[2] = 13;
+        dofs[3] = 14;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+        dofs[2] = 15;
+        dofs[3] = 16;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+        dofs[2] = 17;
+        dofs[3] = 18;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+      dofs[1] = 19;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[0];
+    dof_coordinates[10][1] = vertex_coordinates[1];
+    dof_coordinates[11][0] = vertex_coordinates[2];
+    dof_coordinates[11][1] = vertex_coordinates[3];
+    dof_coordinates[12][0] = vertex_coordinates[4];
+    dof_coordinates[12][1] = vertex_coordinates[5];
+    dof_coordinates[13][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[13][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[14][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[14][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[15][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[15][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[16][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[16][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[17][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[17][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[18][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[18][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[19][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[19][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_6();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_6();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_7();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_8: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_8() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_8()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_8();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_9: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_9() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_9()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(MixedElement(FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None), **{'value_shape': (2,) }), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0] + 5*num_global_entities[1] + 2*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 26;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 11;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 5;
+        break;
+      }
+    case 2:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+    dofs[10] = offset + c.entity_indices[0][0];
+    dofs[11] = offset + c.entity_indices[0][1];
+    dofs[12] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[13] = offset + 2*c.entity_indices[1][0];
+    dofs[14] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[15] = offset + 2*c.entity_indices[1][1];
+    dofs[16] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[17] = offset + 2*c.entity_indices[1][2];
+    dofs[18] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[19] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+    dofs[20] = offset + c.entity_indices[0][0];
+    dofs[21] = offset + c.entity_indices[0][1];
+    dofs[22] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[23] = offset + c.entity_indices[1][0];
+    dofs[24] = offset + c.entity_indices[1][1];
+    dofs[25] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 11;
+      dofs[5] = 12;
+      dofs[6] = 13;
+      dofs[7] = 14;
+      dofs[8] = 21;
+      dofs[9] = 22;
+      dofs[10] = 23;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 10;
+      dofs[5] = 12;
+      dofs[6] = 15;
+      dofs[7] = 16;
+      dofs[8] = 20;
+      dofs[9] = 22;
+      dofs[10] = 24;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+      dofs[4] = 10;
+      dofs[5] = 11;
+      dofs[6] = 17;
+      dofs[7] = 18;
+      dofs[8] = 20;
+      dofs[9] = 21;
+      dofs[10] = 25;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 10;
+        dofs[2] = 20;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 11;
+        dofs[2] = 21;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 12;
+        dofs[2] = 22;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+        dofs[2] = 13;
+        dofs[3] = 14;
+        dofs[4] = 23;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+        dofs[2] = 15;
+        dofs[3] = 16;
+        dofs[4] = 24;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+        dofs[2] = 17;
+        dofs[3] = 18;
+        dofs[4] = 25;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+      dofs[1] = 19;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[0];
+    dof_coordinates[10][1] = vertex_coordinates[1];
+    dof_coordinates[11][0] = vertex_coordinates[2];
+    dof_coordinates[11][1] = vertex_coordinates[3];
+    dof_coordinates[12][0] = vertex_coordinates[4];
+    dof_coordinates[12][1] = vertex_coordinates[5];
+    dof_coordinates[13][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[13][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[14][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[14][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[15][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[15][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[16][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[16][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[17][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[17][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[18][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[18][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[19][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[19][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[20][0] = vertex_coordinates[0];
+    dof_coordinates[20][1] = vertex_coordinates[1];
+    dof_coordinates[21][0] = vertex_coordinates[2];
+    dof_coordinates[21][1] = vertex_coordinates[3];
+    dof_coordinates[22][0] = vertex_coordinates[4];
+    dof_coordinates[22][1] = vertex_coordinates[5];
+    dof_coordinates[23][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[23][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[24][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[24][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[25][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[25][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_7();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_8();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_9();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_10: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_10() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_10()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_10();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_11: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_11() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_11()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_8();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_8();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_11();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_12: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_12() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_12()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_12();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class adaptivenavierstokes_dofmap_13: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_dofmap_13() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_dofmap_13()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for MixedElement(VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None), FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None), **{'value_shape': (3,) })";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 8;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[12] = offset + c.entity_indices[0][0];
+    dofs[13] = offset + c.entity_indices[0][1];
+    dofs[14] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+      dofs[6] = 13;
+      dofs[7] = 14;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+      dofs[6] = 12;
+      dofs[7] = 14;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+      dofs[6] = 12;
+      dofs[7] = 13;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+        dofs[2] = 12;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+        dofs[2] = 13;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+        dofs[2] = 14;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[12][0] = vertex_coordinates[0];
+    dof_coordinates[12][1] = vertex_coordinates[1];
+    dof_coordinates[13][0] = vertex_coordinates[2];
+    dof_coordinates[13][1] = vertex_coordinates[3];
+    dof_coordinates[14][0] = vertex_coordinates[4];
+    dof_coordinates[14][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_11();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_12();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new adaptivenavierstokes_dofmap_13();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivenavierstokes_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    172
+    // Number of operations (multiply-add pairs) for tensor contraction: 2992
+    // Total number of operations (multiply-add pairs):                  3167
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G0_0_1 = det*w[0][0]*K[2]*(1.0);
+    const double G0_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G0_2_1 = det*w[0][2]*K[2]*(1.0);
+    const double G0_3_0 = det*w[0][3]*K[0]*(1.0);
+    const double G0_3_1 = det*w[0][3]*K[2]*(1.0);
+    const double G0_4_0 = det*w[0][4]*K[0]*(1.0);
+    const double G0_4_1 = det*w[0][4]*K[2]*(1.0);
+    const double G0_5_0 = det*w[0][5]*K[0]*(1.0);
+    const double G0_5_1 = det*w[0][5]*K[2]*(1.0);
+    const double G1_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G1_0_1 = det*w[0][0]*K[2]*(1.0);
+    const double G1_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G1_1_1 = det*w[0][1]*K[2]*(1.0);
+    const double G1_2_0 = det*w[0][2]*K[0]*(1.0);
+    const double G1_2_1 = det*w[0][2]*K[2]*(1.0);
+    const double G1_3_0 = det*w[0][3]*K[0]*(1.0);
+    const double G1_3_1 = det*w[0][3]*K[2]*(1.0);
+    const double G1_4_0 = det*w[0][4]*K[0]*(1.0);
+    const double G1_4_1 = det*w[0][4]*K[2]*(1.0);
+    const double G1_5_0 = det*w[0][5]*K[0]*(1.0);
+    const double G1_5_1 = det*w[0][5]*K[2]*(1.0);
+    const double G2_0_0 = det*w[0][0]*K[1]*(1.0);
+    const double G2_0_1 = det*w[0][0]*K[3]*(1.0);
+    const double G2_1_0 = det*w[0][1]*K[1]*(1.0);
+    const double G2_2_1 = det*w[0][2]*K[3]*(1.0);
+    const double G2_3_0 = det*w[0][3]*K[1]*(1.0);
+    const double G2_3_1 = det*w[0][3]*K[3]*(1.0);
+    const double G2_4_0 = det*w[0][4]*K[1]*(1.0);
+    const double G2_4_1 = det*w[0][4]*K[3]*(1.0);
+    const double G2_5_0 = det*w[0][5]*K[1]*(1.0);
+    const double G2_5_1 = det*w[0][5]*K[3]*(1.0);
+    const double G3_6_0 = det*w[0][6]*K[1]*(1.0);
+    const double G3_6_1 = det*w[0][6]*K[3]*(1.0);
+    const double G3_7_0 = det*w[0][7]*K[1]*(1.0);
+    const double G3_7_1 = det*w[0][7]*K[3]*(1.0);
+    const double G3_8_0 = det*w[0][8]*K[1]*(1.0);
+    const double G3_8_1 = det*w[0][8]*K[3]*(1.0);
+    const double G3_9_0 = det*w[0][9]*K[1]*(1.0);
+    const double G3_9_1 = det*w[0][9]*K[3]*(1.0);
+    const double G3_10_0 = det*w[0][10]*K[1]*(1.0);
+    const double G3_10_1 = det*w[0][10]*K[3]*(1.0);
+    const double G3_11_0 = det*w[0][11]*K[1]*(1.0);
+    const double G3_11_1 = det*w[0][11]*K[3]*(1.0);
+    const double G4_6_0 = det*w[0][6]*K[0]*(1.0);
+    const double G4_6_1 = det*w[0][6]*K[2]*(1.0);
+    const double G4_7_0 = det*w[0][7]*K[0]*(1.0);
+    const double G4_8_1 = det*w[0][8]*K[2]*(1.0);
+    const double G4_9_0 = det*w[0][9]*K[0]*(1.0);
+    const double G4_9_1 = det*w[0][9]*K[2]*(1.0);
+    const double G4_10_0 = det*w[0][10]*K[0]*(1.0);
+    const double G4_10_1 = det*w[0][10]*K[2]*(1.0);
+    const double G4_11_0 = det*w[0][11]*K[0]*(1.0);
+    const double G4_11_1 = det*w[0][11]*K[2]*(1.0);
+    const double G5_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G5_0_1 = det*w[0][0]*K[2]*(1.0);
+    const double G5_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G5_1_1 = det*w[0][1]*K[2]*(1.0);
+    const double G5_2_0 = det*w[0][2]*K[0]*(1.0);
+    const double G5_2_1 = det*w[0][2]*K[2]*(1.0);
+    const double G5_3_0 = det*w[0][3]*K[0]*(1.0);
+    const double G5_3_1 = det*w[0][3]*K[2]*(1.0);
+    const double G5_4_0 = det*w[0][4]*K[0]*(1.0);
+    const double G5_4_1 = det*w[0][4]*K[2]*(1.0);
+    const double G5_5_0 = det*w[0][5]*K[0]*(1.0);
+    const double G5_5_1 = det*w[0][5]*K[2]*(1.0);
+    const double G6_6_0 = det*w[0][6]*K[1]*(1.0);
+    const double G6_6_1 = det*w[0][6]*K[3]*(1.0);
+    const double G6_7_0 = det*w[0][7]*K[1]*(1.0);
+    const double G6_8_1 = det*w[0][8]*K[3]*(1.0);
+    const double G6_9_0 = det*w[0][9]*K[1]*(1.0);
+    const double G6_9_1 = det*w[0][9]*K[3]*(1.0);
+    const double G6_10_0 = det*w[0][10]*K[1]*(1.0);
+    const double G6_10_1 = det*w[0][10]*K[3]*(1.0);
+    const double G6_11_0 = det*w[0][11]*K[1]*(1.0);
+    const double G6_11_1 = det*w[0][11]*K[3]*(1.0);
+    const double G7_6_0 = det*w[0][6]*K[1]*(1.0);
+    const double G7_6_1 = det*w[0][6]*K[3]*(1.0);
+    const double G7_7_0 = det*w[0][7]*K[1]*(1.0);
+    const double G7_7_1 = det*w[0][7]*K[3]*(1.0);
+    const double G7_8_0 = det*w[0][8]*K[1]*(1.0);
+    const double G7_8_1 = det*w[0][8]*K[3]*(1.0);
+    const double G7_9_0 = det*w[0][9]*K[1]*(1.0);
+    const double G7_9_1 = det*w[0][9]*K[3]*(1.0);
+    const double G7_10_0 = det*w[0][10]*K[1]*(1.0);
+    const double G7_10_1 = det*w[0][10]*K[3]*(1.0);
+    const double G7_11_0 = det*w[0][11]*K[1]*(1.0);
+    const double G7_11_1 = det*w[0][11]*K[3]*(1.0);
+    const double G8_0 = det*K[0]*(1.0);
+    const double G8_1 = det*K[2]*(1.0);
+    const double G9_0 = det*K[1]*(1.0);
+    const double G9_1 = det*K[3]*(1.0);
+    const double G10_0_0_0 = det*w[1][0]*K[0]*K[0]*(1.0);
+    const double G10_0_0_1 = det*w[1][0]*K[0]*K[2]*(1.0);
+    const double G10_0_1_0 = det*w[1][0]*K[2]*K[0]*(1.0);
+    const double G10_0_1_1 = det*w[1][0]*K[2]*K[2]*(1.0);
+    const double G11_0_0_0 = det*w[1][0]*K[0]*K[0]*(1.0);
+    const double G11_0_0_1 = det*w[1][0]*K[0]*K[2]*(1.0);
+    const double G11_0_1_0 = det*w[1][0]*K[2]*K[0]*(1.0);
+    const double G11_0_1_1 = det*w[1][0]*K[2]*K[2]*(1.0);
+    const double G12_0_0_0 = det*w[1][0]*K[1]*K[1]*(1.0);
+    const double G12_0_0_1 = det*w[1][0]*K[1]*K[3]*(1.0);
+    const double G12_0_1_0 = det*w[1][0]*K[3]*K[1]*(1.0);
+    const double G12_0_1_1 = det*w[1][0]*K[3]*K[3]*(1.0);
+    const double G13_0_0_0 = det*w[1][0]*K[1]*K[1]*(1.0);
+    const double G13_0_0_1 = det*w[1][0]*K[1]*K[3]*(1.0);
+    const double G13_0_1_0 = det*w[1][0]*K[3]*K[1]*(1.0);
+    const double G13_0_1_1 = det*w[1][0]*K[3]*K[3]*(1.0);
+    const double G14_0 = det*K[0]*(1.0);
+    const double G14_1 = det*K[2]*(1.0);
+    const double G15_0 = det*K[1]*(1.0);
+    const double G15_1 = det*K[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = -0.030952380952381*G0_0_0 - 0.030952380952381*G0_0_1 - 0.00714285714285715*G0_1_0 - 0.00714285714285715*G0_2_1 + 0.00952380952380951*G0_3_0 + 0.00952380952380951*G0_3_1 - 0.00952380952380951*G0_4_0 + 0.0380952380952381*G0_4_1 + 0.0380952380952381*G0_5_0 - 0.00952380952380952*G0_5_1 - 0.030952380952381*G1_0_0 - 0.030952380952381*G1_0_1 + 0.00357142857142857*G1_1_0 + 0.00357142857142857*G1_1_1 + 0.00357142857142857*G1_2_0 + 0.00357142857142857*G1_2_1 - 0.00476190476190477*G1_3_0 - 0.00476190476190477*G1_3_1 - 0.0190476190476191*G1_4_0 - 0.0190476190476191*G1_4_1 - 0.0190476190476191*G1_5_0 - 0.0190476190476191*G1_5_1 - 0.030952380952381*G3_6_0 - 0.030952380952381*G3_6_1 + 0.00357142857142857*G3_7_0 + 0.00357142857142857*G3_7_1 + 0.00357142857142857*G3_8_0 + 0.00357142857142857*G3_8_1 - 0.00476190476190477*G3_9_0 - 0.00476190476190477*G3_9_1 - 0.0190476190476191*G3_10_0 - 0.0190476190476191*G3_10_1 - 0.0190476190476191*G3_11_0 - 0.0190476190476191*G3_11_1 + 0.5*G10_0_0_0 + 0.5*G10_0_0_1 + 0.5*G10_0_1_0 + 0.5*G10_0_1_1 + 0.5*G12_0_0_0 + 0.5*G12_0_0_1 + 0.5*G12_0_1_0 + 0.5*G12_0_1_1;
+    A[1] = 0.00357142857142857*G0_0_0 + 0.00357142857142857*G0_0_1 - 0.00357142857142857*G0_1_0 + 0.00436507936507936*G0_2_1 + 0.00158730158730159*G0_3_0 - 0.00634920634920634*G0_3_1 - 0.00158730158730159*G0_4_0 - 0.00793650793650793*G0_4_1 + 0.00634920634920635*G0_5_1 + 0.00357142857142857*G1_0_0 + 0.00357142857142857*G1_0_1 + 0.00714285714285713*G1_1_0 + 0.00714285714285714*G1_1_1 - 0.00436507936507936*G1_2_0 - 0.00436507936507936*G1_2_1 + 0.00634920634920634*G1_3_0 + 0.00634920634920634*G1_3_1 + 0.00793650793650793*G1_4_0 + 0.00793650793650793*G1_4_1 + 0.0126984126984127*G1_5_0 + 0.0126984126984127*G1_5_1 + 0.00357142857142857*G3_6_0 + 0.00357142857142857*G3_6_1 + 0.00714285714285713*G3_7_0 + 0.00714285714285714*G3_7_1 - 0.00436507936507936*G3_8_0 - 0.00436507936507936*G3_8_1 + 0.00634920634920634*G3_9_0 + 0.00634920634920634*G3_9_1 + 0.00793650793650793*G3_10_0 + 0.00793650793650793*G3_10_1 + 0.0126984126984127*G3_11_0 + 0.0126984126984127*G3_11_1 + 0.166666666666667*G10_0_0_0 + 0.166666666666667*G10_0_1_0 + 0.166666666666667*G12_0_0_0 + 0.166666666666667*G12_0_1_0;
+    A[2] = 0.00357142857142857*G0_0_0 + 0.00357142857142857*G0_0_1 + 0.00436507936507936*G0_1_0 - 0.00357142857142857*G0_2_1 - 0.00634920634920634*G0_3_0 + 0.00158730158730159*G0_3_1 + 0.00634920634920634*G0_4_0 - 0.00793650793650793*G0_5_0 - 0.00158730158730159*G0_5_1 + 0.00357142857142857*G1_0_0 + 0.00357142857142857*G1_0_1 - 0.00436507936507936*G1_1_0 - 0.00436507936507936*G1_1_1 + 0.00714285714285714*G1_2_0 + 0.00714285714285713*G1_2_1 + 0.00634920634920635*G1_3_0 + 0.00634920634920634*G1_3_1 + 0.0126984126984127*G1_4_0 + 0.0126984126984127*G1_4_1 + 0.00793650793650793*G1_5_0 + 0.00793650793650793*G1_5_1 + 0.00357142857142857*G3_6_0 + 0.00357142857142857*G3_6_1 - 0.00436507936507936*G3_7_0 - 0.00436507936507936*G3_7_1 + 0.00714285714285714*G3_8_0 + 0.00714285714285713*G3_8_1 + 0.00634920634920635*G3_9_0 + 0.00634920634920634*G3_9_1 + 0.0126984126984127*G3_10_0 + 0.0126984126984127*G3_10_1 + 0.00793650793650793*G3_11_0 + 0.00793650793650793*G3_11_1 + 0.166666666666667*G10_0_0_1 + 0.166666666666667*G10_0_1_1 + 0.166666666666667*G12_0_0_1 + 0.166666666666667*G12_0_1_1;
+    A[3] = -0.00476190476190476*G0_0_0 - 0.00476190476190477*G0_0_1 - 0.00793650793650793*G0_1_0 - 0.00793650793650793*G0_2_1 - 0.019047619047619*G0_3_0 - 0.019047619047619*G0_3_1 + 0.019047619047619*G0_4_0 + 0.0126984126984127*G0_4_1 + 0.0126984126984127*G0_5_0 + 0.019047619047619*G0_5_1 - 0.00476190476190476*G1_0_0 - 0.00476190476190477*G1_0_1 + 0.00634920634920634*G1_1_0 + 0.00634920634920634*G1_1_1 + 0.00634920634920635*G1_2_0 + 0.00634920634920634*G1_2_1 + 0.0380952380952381*G1_3_0 + 0.0380952380952381*G1_3_1 - 0.00634920634920633*G1_4_0 - 0.00634920634920632*G1_4_1 - 0.00634920634920633*G1_5_0 - 0.00634920634920632*G1_5_1 - 0.00476190476190476*G3_6_0 - 0.00476190476190477*G3_6_1 + 0.00634920634920634*G3_7_0 + 0.00634920634920634*G3_7_1 + 0.00634920634920635*G3_8_0 + 0.00634920634920634*G3_8_1 + 0.0380952380952381*G3_9_0 + 0.0380952380952381*G3_9_1 - 0.00634920634920633*G3_10_0 - 0.00634920634920632*G3_10_1 - 0.00634920634920633*G3_11_0 - 0.00634920634920632*G3_11_1;
+    A[4] = -0.0190476190476191*G0_0_0 - 0.0190476190476191*G0_0_1 - 0.00634920634920636*G0_1_0 - 0.0126984126984127*G0_2_1 - 0.0126984126984127*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.0126984126984127*G0_4_0 + 0.0317460317460318*G0_4_1 + 0.0253968253968254*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.0190476190476191*G1_0_0 - 0.0190476190476191*G1_0_1 + 0.00793650793650793*G1_1_0 + 0.00793650793650793*G1_1_1 + 0.0126984126984127*G1_2_0 + 0.0126984126984127*G1_2_1 - 0.00634920634920633*G1_3_0 - 0.00634920634920632*G1_3_1 - 0.0634920634920635*G1_4_0 - 0.0634920634920635*G1_4_1 - 0.0317460317460317*G1_5_0 - 0.0317460317460317*G1_5_1 - 0.0190476190476191*G3_6_0 - 0.0190476190476191*G3_6_1 + 0.00793650793650793*G3_7_0 + 0.00793650793650793*G3_7_1 + 0.0126984126984127*G3_8_0 + 0.0126984126984127*G3_8_1 - 0.00634920634920633*G3_9_0 - 0.00634920634920632*G3_9_1 - 0.0634920634920635*G3_10_0 - 0.0634920634920635*G3_10_1 - 0.0317460317460317*G3_11_0 - 0.0317460317460317*G3_11_1 - 0.666666666666667*G10_0_0_1 - 0.666666666666666*G10_0_1_1 - 0.666666666666667*G12_0_0_1 - 0.666666666666666*G12_0_1_1;
+    A[5] = -0.0190476190476191*G0_0_0 - 0.0190476190476191*G0_0_1 - 0.0126984126984127*G0_1_0 - 0.00634920634920635*G0_2_1 - 0.00634920634920635*G0_3_0 - 0.0126984126984127*G0_3_1 + 0.00634920634920635*G0_4_0 + 0.0253968253968254*G0_4_1 + 0.0317460317460318*G0_5_0 + 0.0126984126984127*G0_5_1 - 0.0190476190476191*G1_0_0 - 0.0190476190476191*G1_0_1 + 0.0126984126984127*G1_1_0 + 0.0126984126984127*G1_1_1 + 0.00793650793650793*G1_2_0 + 0.00793650793650793*G1_2_1 - 0.00634920634920633*G1_3_0 - 0.00634920634920632*G1_3_1 - 0.0317460317460317*G1_4_0 - 0.0317460317460317*G1_4_1 - 0.0634920634920635*G1_5_0 - 0.0634920634920635*G1_5_1 - 0.0190476190476191*G3_6_0 - 0.0190476190476191*G3_6_1 + 0.0126984126984127*G3_7_0 + 0.0126984126984127*G3_7_1 + 0.00793650793650793*G3_8_0 + 0.00793650793650793*G3_8_1 - 0.00634920634920633*G3_9_0 - 0.00634920634920632*G3_9_1 - 0.0317460317460317*G3_10_0 - 0.0317460317460317*G3_10_1 - 0.0634920634920635*G3_11_0 - 0.0634920634920635*G3_11_1 - 0.666666666666667*G10_0_0_0 - 0.666666666666667*G10_0_1_0 - 0.666666666666667*G12_0_0_0 - 0.666666666666667*G12_0_1_0;
+    A[6] = -0.030952380952381*G4_6_0 - 0.030952380952381*G4_6_1 - 0.00714285714285715*G4_7_0 - 0.00714285714285715*G4_8_1 + 0.00952380952380951*G4_9_0 + 0.00952380952380951*G4_9_1 - 0.00952380952380951*G4_10_0 + 0.0380952380952381*G4_10_1 + 0.0380952380952381*G4_11_0 - 0.00952380952380952*G4_11_1;
+    A[7] = 0.00357142857142857*G4_6_0 + 0.00357142857142857*G4_6_1 - 0.00357142857142857*G4_7_0 + 0.00436507936507936*G4_8_1 + 0.00158730158730159*G4_9_0 - 0.00634920634920634*G4_9_1 - 0.00158730158730159*G4_10_0 - 0.00793650793650793*G4_10_1 + 0.00634920634920635*G4_11_1;
+    A[8] = 0.00357142857142857*G4_6_0 + 0.00357142857142857*G4_6_1 + 0.00436507936507936*G4_7_0 - 0.00357142857142857*G4_8_1 - 0.00634920634920634*G4_9_0 + 0.00158730158730159*G4_9_1 + 0.00634920634920634*G4_10_0 - 0.00793650793650793*G4_11_0 - 0.00158730158730159*G4_11_1;
+    A[9] = -0.00476190476190476*G4_6_0 - 0.00476190476190477*G4_6_1 - 0.00793650793650793*G4_7_0 - 0.00793650793650793*G4_8_1 - 0.019047619047619*G4_9_0 - 0.019047619047619*G4_9_1 + 0.019047619047619*G4_10_0 + 0.0126984126984127*G4_10_1 + 0.0126984126984127*G4_11_0 + 0.019047619047619*G4_11_1;
+    A[10] = -0.0190476190476191*G4_6_0 - 0.0190476190476191*G4_6_1 - 0.00634920634920636*G4_7_0 - 0.0126984126984127*G4_8_1 - 0.0126984126984127*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.0126984126984127*G4_10_0 + 0.0317460317460318*G4_10_1 + 0.0253968253968254*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[11] = -0.0190476190476191*G4_6_0 - 0.0190476190476191*G4_6_1 - 0.0126984126984127*G4_7_0 - 0.00634920634920635*G4_8_1 - 0.00634920634920635*G4_9_0 - 0.0126984126984127*G4_9_1 + 0.00634920634920635*G4_10_0 + 0.0253968253968254*G4_10_1 + 0.0317460317460318*G4_11_0 + 0.0126984126984127*G4_11_1;
+    A[12] = -0.166666666666667*G8_0 - 0.166666666666667*G8_1;
+    A[13] = 0.0;
+    A[14] = 0.0;
+    A[15] = 0.00357142857142857*G0_0_0 + 0.00357142857142857*G0_0_1 - 0.00357142857142857*G0_1_0 + 0.00436507936507936*G0_2_1 + 0.00158730158730159*G0_3_0 - 0.00634920634920634*G0_3_1 - 0.00158730158730159*G0_4_0 - 0.00793650793650793*G0_4_1 + 0.00634920634920635*G0_5_1 - 0.00714285714285715*G1_0_0 - 0.00357142857142857*G1_1_0 + 0.00436507936507936*G1_2_0 - 0.00793650793650793*G1_3_0 - 0.00634920634920636*G1_4_0 - 0.0126984126984127*G1_5_0 - 0.00714285714285715*G3_6_0 - 0.00357142857142857*G3_7_0 + 0.00436507936507936*G3_8_0 - 0.00793650793650793*G3_9_0 - 0.00634920634920636*G3_10_0 - 0.0126984126984127*G3_11_0 + 0.166666666666667*G10_0_0_0 + 0.166666666666667*G10_0_0_1 + 0.166666666666667*G12_0_0_0 + 0.166666666666667*G12_0_0_1;
+    A[16] = 0.00714285714285713*G0_0_0 + 0.00714285714285714*G0_0_1 + 0.0309523809523809*G0_1_0 - 0.00714285714285713*G0_2_1 + 0.0095238095238095*G0_3_0 + 0.0476190476190476*G0_3_1 - 0.0095238095238095*G0_4_0 - 0.0380952380952381*G0_5_0 - 0.0476190476190476*G0_5_1 - 0.00357142857142857*G1_0_0 + 0.0309523809523809*G1_1_0 - 0.00357142857142856*G1_2_0 + 0.019047619047619*G1_3_0 + 0.00476190476190476*G1_4_0 + 0.019047619047619*G1_5_0 - 0.00357142857142857*G3_6_0 + 0.0309523809523809*G3_7_0 - 0.00357142857142856*G3_8_0 + 0.019047619047619*G3_9_0 + 0.00476190476190476*G3_10_0 + 0.019047619047619*G3_11_0 + 0.5*G10_0_0_0 + 0.5*G12_0_0_0;
+    A[17] = -0.00436507936507936*G0_0_0 - 0.00436507936507936*G0_0_1 - 0.00357142857142857*G0_1_0 - 0.00357142857142857*G0_2_1 - 0.00634920634920634*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.00634920634920634*G0_4_0 + 0.00793650793650792*G0_4_1 + 0.00793650793650793*G0_5_0 + 0.00634920634920634*G0_5_1 + 0.00436507936507936*G1_0_0 - 0.00357142857142857*G1_1_0 - 0.00714285714285714*G1_2_0 - 0.0126984126984127*G1_3_0 - 0.00634920634920635*G1_4_0 - 0.00793650793650793*G1_5_0 + 0.00436507936507936*G3_6_0 - 0.00357142857142857*G3_7_0 - 0.00714285714285714*G3_8_0 - 0.0126984126984127*G3_9_0 - 0.00634920634920635*G3_10_0 - 0.00793650793650793*G3_11_0 - 0.166666666666667*G10_0_0_1 - 0.166666666666667*G12_0_0_1;
+    A[18] = 0.00634920634920634*G0_0_0 + 0.00634920634920634*G0_0_1 + 0.019047619047619*G0_1_0 - 0.0126984126984127*G0_2_1 - 0.0126984126984127*G0_3_0 + 0.019047619047619*G0_3_1 + 0.0126984126984127*G0_4_0 + 0.00634920634920636*G0_4_1 - 0.0253968253968254*G0_5_0 - 0.019047619047619*G0_5_1 - 0.00793650793650793*G1_0_0 + 0.019047619047619*G1_1_0 - 0.0126984126984127*G1_2_0 + 0.0634920634920634*G1_3_0 + 0.00634920634920634*G1_4_0 + 0.0317460317460317*G1_5_0 - 0.00793650793650793*G3_6_0 + 0.019047619047619*G3_7_0 - 0.0126984126984127*G3_8_0 + 0.0634920634920634*G3_9_0 + 0.00634920634920634*G3_10_0 + 0.0317460317460317*G3_11_0 + 0.666666666666666*G10_0_0_1 + 0.666666666666666*G12_0_0_1;
+    A[19] = 0.00793650793650793*G0_0_0 + 0.00793650793650793*G0_0_1 + 0.00476190476190476*G0_1_0 - 0.00793650793650794*G0_2_1 - 0.019047619047619*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.019047619047619*G0_4_0 - 0.0126984126984127*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.00634920634920636*G1_0_0 + 0.00476190476190476*G1_1_0 - 0.00634920634920635*G1_2_0 + 0.00634920634920634*G1_3_0 - 0.0380952380952381*G1_4_0 + 0.00634920634920634*G1_5_0 - 0.00634920634920636*G3_6_0 + 0.00476190476190476*G3_7_0 - 0.00634920634920635*G3_8_0 + 0.00634920634920634*G3_9_0 - 0.0380952380952381*G3_10_0 + 0.00634920634920634*G3_11_0;
+    A[20] = 0.0126984126984127*G0_0_0 + 0.0126984126984127*G0_0_1 + 0.019047619047619*G0_1_0 - 0.00634920634920636*G0_2_1 - 0.00634920634920635*G0_3_0 + 0.019047619047619*G0_3_1 + 0.00634920634920635*G0_4_0 - 0.00634920634920633*G0_4_1 - 0.0317460317460317*G0_5_0 - 0.0190476190476191*G0_5_1 - 0.0126984126984127*G1_0_0 + 0.019047619047619*G1_1_0 - 0.00793650793650793*G1_2_0 + 0.0317460317460317*G1_3_0 + 0.00634920634920634*G1_4_0 + 0.0634920634920635*G1_5_0 - 0.0126984126984127*G3_6_0 + 0.019047619047619*G3_7_0 - 0.00793650793650793*G3_8_0 + 0.0317460317460317*G3_9_0 + 0.00634920634920634*G3_10_0 + 0.0634920634920635*G3_11_0 - 0.666666666666667*G10_0_0_0 - 0.666666666666666*G10_0_0_1 - 0.666666666666667*G12_0_0_0 - 0.666666666666666*G12_0_0_1;
+    A[21] = 0.00357142857142857*G4_6_0 + 0.00357142857142857*G4_6_1 - 0.00357142857142857*G4_7_0 + 0.00436507936507936*G4_8_1 + 0.00158730158730159*G4_9_0 - 0.00634920634920634*G4_9_1 - 0.00158730158730159*G4_10_0 - 0.00793650793650793*G4_10_1 + 0.00634920634920635*G4_11_1;
+    A[22] = 0.00714285714285713*G4_6_0 + 0.00714285714285714*G4_6_1 + 0.0309523809523809*G4_7_0 - 0.00714285714285713*G4_8_1 + 0.0095238095238095*G4_9_0 + 0.0476190476190476*G4_9_1 - 0.0095238095238095*G4_10_0 - 0.0380952380952381*G4_11_0 - 0.0476190476190476*G4_11_1;
+    A[23] = -0.00436507936507936*G4_6_0 - 0.00436507936507936*G4_6_1 - 0.00357142857142857*G4_7_0 - 0.00357142857142857*G4_8_1 - 0.00634920634920634*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.00634920634920634*G4_10_0 + 0.00793650793650792*G4_10_1 + 0.00793650793650793*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[24] = 0.00634920634920634*G4_6_0 + 0.00634920634920634*G4_6_1 + 0.019047619047619*G4_7_0 - 0.0126984126984127*G4_8_1 - 0.0126984126984127*G4_9_0 + 0.019047619047619*G4_9_1 + 0.0126984126984127*G4_10_0 + 0.00634920634920636*G4_10_1 - 0.0253968253968254*G4_11_0 - 0.019047619047619*G4_11_1;
+    A[25] = 0.00793650793650793*G4_6_0 + 0.00793650793650793*G4_6_1 + 0.00476190476190476*G4_7_0 - 0.00793650793650794*G4_8_1 - 0.019047619047619*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.019047619047619*G4_10_0 - 0.0126984126984127*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[26] = 0.0126984126984127*G4_6_0 + 0.0126984126984127*G4_6_1 + 0.019047619047619*G4_7_0 - 0.00634920634920636*G4_8_1 - 0.00634920634920635*G4_9_0 + 0.019047619047619*G4_9_1 + 0.00634920634920635*G4_10_0 - 0.00634920634920633*G4_10_1 - 0.0317460317460317*G4_11_0 - 0.0190476190476191*G4_11_1;
+    A[27] = 0.0;
+    A[28] = 0.166666666666667*G8_0;
+    A[29] = 0.0;
+    A[30] = 0.00357142857142857*G0_0_0 + 0.00357142857142857*G0_0_1 + 0.00436507936507936*G0_1_0 - 0.00357142857142857*G0_2_1 - 0.00634920634920634*G0_3_0 + 0.00158730158730159*G0_3_1 + 0.00634920634920634*G0_4_0 - 0.00793650793650793*G0_5_0 - 0.00158730158730159*G0_5_1 - 0.00714285714285715*G1_0_1 + 0.00436507936507936*G1_1_1 - 0.00357142857142857*G1_2_1 - 0.00793650793650793*G1_3_1 - 0.0126984126984127*G1_4_1 - 0.00634920634920635*G1_5_1 - 0.00714285714285715*G3_6_1 + 0.00436507936507936*G3_7_1 - 0.00357142857142857*G3_8_1 - 0.00793650793650793*G3_9_1 - 0.0126984126984127*G3_10_1 - 0.00634920634920635*G3_11_1 + 0.166666666666667*G10_0_1_0 + 0.166666666666667*G10_0_1_1 + 0.166666666666667*G12_0_1_0 + 0.166666666666667*G12_0_1_1;
+    A[31] = -0.00436507936507936*G0_0_0 - 0.00436507936507936*G0_0_1 - 0.00357142857142856*G0_1_0 - 0.00357142857142857*G0_2_1 - 0.00634920634920633*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.00634920634920633*G0_4_0 + 0.00793650793650792*G0_4_1 + 0.00793650793650793*G0_5_0 + 0.00634920634920634*G0_5_1 + 0.00436507936507936*G1_0_1 - 0.00714285714285713*G1_1_1 - 0.00357142857142857*G1_2_1 - 0.0126984126984127*G1_3_1 - 0.00793650793650794*G1_4_1 - 0.00634920634920636*G1_5_1 + 0.00436507936507936*G3_6_1 - 0.00714285714285713*G3_7_1 - 0.00357142857142857*G3_8_1 - 0.0126984126984127*G3_9_1 - 0.00793650793650794*G3_10_1 - 0.00634920634920636*G3_11_1 - 0.166666666666667*G10_0_1_0 - 0.166666666666667*G12_0_1_0;
+    A[32] = 0.00714285714285714*G0_0_0 + 0.00714285714285713*G0_0_1 - 0.00714285714285714*G0_1_0 + 0.0309523809523809*G0_2_1 + 0.0476190476190475*G0_3_0 + 0.0095238095238095*G0_3_1 - 0.0476190476190475*G0_4_0 - 0.038095238095238*G0_4_1 - 0.00952380952380951*G0_5_1 - 0.00357142857142857*G1_0_1 - 0.00357142857142857*G1_1_1 + 0.0309523809523809*G1_2_1 + 0.019047619047619*G1_3_1 + 0.019047619047619*G1_4_1 + 0.00476190476190476*G1_5_1 - 0.00357142857142857*G3_6_1 - 0.00357142857142857*G3_7_1 + 0.0309523809523809*G3_8_1 + 0.019047619047619*G3_9_1 + 0.019047619047619*G3_10_1 + 0.00476190476190476*G3_11_1 + 0.5*G10_0_1_1 + 0.5*G12_0_1_1;
+    A[33] = 0.00634920634920635*G0_0_0 + 0.00634920634920634*G0_0_1 - 0.0126984126984127*G0_1_0 + 0.019047619047619*G0_2_1 + 0.019047619047619*G0_3_0 - 0.0126984126984127*G0_3_1 - 0.019047619047619*G0_4_0 - 0.0253968253968254*G0_4_1 + 0.00634920634920634*G0_5_0 + 0.0126984126984127*G0_5_1 - 0.00793650793650793*G1_0_1 - 0.0126984126984127*G1_1_1 + 0.019047619047619*G1_2_1 + 0.0634920634920634*G1_3_1 + 0.0317460317460317*G1_4_1 + 0.00634920634920636*G1_5_1 - 0.00793650793650793*G3_6_1 - 0.0126984126984127*G3_7_1 + 0.019047619047619*G3_8_1 + 0.0634920634920634*G3_9_1 + 0.0317460317460317*G3_10_1 + 0.00634920634920636*G3_11_1 + 0.666666666666666*G10_0_1_0 + 0.666666666666666*G12_0_1_0;
+    A[34] = 0.0126984126984127*G0_0_0 + 0.0126984126984127*G0_0_1 - 0.00634920634920635*G0_1_0 + 0.019047619047619*G0_2_1 + 0.019047619047619*G0_3_0 - 0.00634920634920634*G0_3_1 - 0.019047619047619*G0_4_0 - 0.0317460317460317*G0_4_1 - 0.00634920634920635*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.0126984126984127*G1_0_1 - 0.00793650793650794*G1_1_1 + 0.019047619047619*G1_2_1 + 0.0317460317460317*G1_3_1 + 0.0634920634920635*G1_4_1 + 0.00634920634920636*G1_5_1 - 0.0126984126984127*G3_6_1 - 0.00793650793650794*G3_7_1 + 0.019047619047619*G3_8_1 + 0.0317460317460317*G3_9_1 + 0.0634920634920635*G3_10_1 + 0.00634920634920636*G3_11_1 - 0.666666666666666*G10_0_1_0 - 0.666666666666666*G10_0_1_1 - 0.666666666666666*G12_0_1_0 - 0.666666666666666*G12_0_1_1;
+    A[35] = 0.00793650793650793*G0_0_0 + 0.00793650793650793*G0_0_1 - 0.00793650793650793*G0_1_0 + 0.00476190476190476*G0_2_1 - 0.00634920634920633*G0_3_0 - 0.019047619047619*G0_3_1 + 0.00634920634920633*G0_4_0 - 0.0126984126984127*G0_4_1 + 0.019047619047619*G0_5_1 - 0.00634920634920635*G1_0_1 - 0.00634920634920636*G1_1_1 + 0.00476190476190476*G1_2_1 + 0.00634920634920636*G1_3_1 + 0.00634920634920636*G1_4_1 - 0.0380952380952381*G1_5_1 - 0.00634920634920635*G3_6_1 - 0.00634920634920636*G3_7_1 + 0.00476190476190476*G3_8_1 + 0.00634920634920636*G3_9_1 + 0.00634920634920636*G3_10_1 - 0.0380952380952381*G3_11_1;
+    A[36] = 0.00357142857142857*G4_6_0 + 0.00357142857142857*G4_6_1 + 0.00436507936507936*G4_7_0 - 0.00357142857142857*G4_8_1 - 0.00634920634920634*G4_9_0 + 0.00158730158730159*G4_9_1 + 0.00634920634920634*G4_10_0 - 0.00793650793650793*G4_11_0 - 0.00158730158730159*G4_11_1;
+    A[37] = -0.00436507936507936*G4_6_0 - 0.00436507936507936*G4_6_1 - 0.00357142857142856*G4_7_0 - 0.00357142857142857*G4_8_1 - 0.00634920634920633*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.00634920634920633*G4_10_0 + 0.00793650793650792*G4_10_1 + 0.00793650793650793*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[38] = 0.00714285714285714*G4_6_0 + 0.00714285714285713*G4_6_1 - 0.00714285714285714*G4_7_0 + 0.0309523809523809*G4_8_1 + 0.0476190476190475*G4_9_0 + 0.0095238095238095*G4_9_1 - 0.0476190476190475*G4_10_0 - 0.038095238095238*G4_10_1 - 0.00952380952380951*G4_11_1;
+    A[39] = 0.00634920634920635*G4_6_0 + 0.00634920634920634*G4_6_1 - 0.0126984126984127*G4_7_0 + 0.019047619047619*G4_8_1 + 0.019047619047619*G4_9_0 - 0.0126984126984127*G4_9_1 - 0.019047619047619*G4_10_0 - 0.0253968253968254*G4_10_1 + 0.00634920634920634*G4_11_0 + 0.0126984126984127*G4_11_1;
+    A[40] = 0.0126984126984127*G4_6_0 + 0.0126984126984127*G4_6_1 - 0.00634920634920635*G4_7_0 + 0.019047619047619*G4_8_1 + 0.019047619047619*G4_9_0 - 0.00634920634920634*G4_9_1 - 0.019047619047619*G4_10_0 - 0.0317460317460317*G4_10_1 - 0.00634920634920635*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[41] = 0.00793650793650793*G4_6_0 + 0.00793650793650793*G4_6_1 - 0.00793650793650793*G4_7_0 + 0.00476190476190476*G4_8_1 - 0.00634920634920633*G4_9_0 - 0.019047619047619*G4_9_1 + 0.00634920634920633*G4_10_0 - 0.0126984126984127*G4_10_1 + 0.019047619047619*G4_11_1;
+    A[42] = 0.0;
+    A[43] = 0.0;
+    A[44] = 0.166666666666667*G8_1;
+    A[45] = -0.00476190476190477*G0_0_0 - 0.00476190476190477*G0_0_1 - 0.00793650793650793*G0_1_0 - 0.00793650793650793*G0_2_1 - 0.019047619047619*G0_3_0 - 0.019047619047619*G0_3_1 + 0.019047619047619*G0_4_0 + 0.0126984126984127*G0_4_1 + 0.0126984126984127*G0_5_0 + 0.019047619047619*G0_5_1 + 0.00952380952380951*G1_0_0 + 0.00952380952380951*G1_0_1 + 0.00158730158730159*G1_1_0 - 0.00634920634920634*G1_1_1 - 0.00634920634920634*G1_2_0 + 0.00158730158730159*G1_2_1 - 0.019047619047619*G1_3_0 - 0.019047619047619*G1_3_1 - 0.0126984126984127*G1_4_0 - 0.00634920634920634*G1_4_1 - 0.00634920634920635*G1_5_0 - 0.0126984126984127*G1_5_1 + 0.00952380952380951*G3_6_0 + 0.00952380952380951*G3_6_1 + 0.00158730158730159*G3_7_0 - 0.00634920634920634*G3_7_1 - 0.00634920634920634*G3_8_0 + 0.00158730158730159*G3_8_1 - 0.019047619047619*G3_9_0 - 0.019047619047619*G3_9_1 - 0.0126984126984127*G3_10_0 - 0.00634920634920634*G3_10_1 - 0.00634920634920635*G3_11_0 - 0.0126984126984127*G3_11_1;
+    A[46] = 0.00634920634920634*G0_0_0 + 0.00634920634920634*G0_0_1 + 0.019047619047619*G0_1_0 - 0.0126984126984127*G0_2_1 - 0.0126984126984127*G0_3_0 + 0.019047619047619*G0_3_1 + 0.0126984126984127*G0_4_0 + 0.00634920634920636*G0_4_1 - 0.0253968253968254*G0_5_0 - 0.019047619047619*G0_5_1 + 0.00158730158730159*G1_0_0 - 0.00634920634920634*G1_0_1 + 0.0095238095238095*G1_1_0 + 0.0476190476190476*G1_1_1 - 0.00634920634920633*G1_2_0 - 0.00634920634920634*G1_2_1 - 0.0126984126984127*G1_3_0 + 0.019047619047619*G1_3_1 - 0.019047619047619*G1_4_0 - 0.00634920634920634*G1_4_1 - 0.00634920634920635*G1_5_0 + 0.019047619047619*G1_5_1 + 0.00158730158730159*G3_6_0 - 0.00634920634920634*G3_6_1 + 0.0095238095238095*G3_7_0 + 0.0476190476190476*G3_7_1 - 0.00634920634920633*G3_8_0 - 0.00634920634920634*G3_8_1 - 0.0126984126984127*G3_9_0 + 0.019047619047619*G3_9_1 - 0.019047619047619*G3_10_0 - 0.00634920634920634*G3_10_1 - 0.00634920634920635*G3_11_0 + 0.019047619047619*G3_11_1 + 0.666666666666666*G10_0_1_0 + 0.666666666666666*G12_0_1_0;
+    A[47] = 0.00634920634920635*G0_0_0 + 0.00634920634920634*G0_0_1 - 0.0126984126984127*G0_1_0 + 0.019047619047619*G0_2_1 + 0.019047619047619*G0_3_0 - 0.0126984126984127*G0_3_1 - 0.019047619047619*G0_4_0 - 0.0253968253968254*G0_4_1 + 0.00634920634920634*G0_5_0 + 0.0126984126984127*G0_5_1 - 0.00634920634920634*G1_0_0 + 0.00158730158730159*G1_0_1 - 0.00634920634920634*G1_1_0 - 0.00634920634920634*G1_1_1 + 0.0476190476190475*G1_2_0 + 0.0095238095238095*G1_2_1 + 0.019047619047619*G1_3_0 - 0.0126984126984127*G1_3_1 + 0.019047619047619*G1_4_0 - 0.00634920634920634*G1_4_1 - 0.00634920634920633*G1_5_0 - 0.019047619047619*G1_5_1 - 0.00634920634920634*G3_6_0 + 0.00158730158730159*G3_6_1 - 0.00634920634920634*G3_7_0 - 0.00634920634920634*G3_7_1 + 0.0476190476190475*G3_8_0 + 0.0095238095238095*G3_8_1 + 0.019047619047619*G3_9_0 - 0.0126984126984127*G3_9_1 + 0.019047619047619*G3_10_0 - 0.00634920634920634*G3_10_1 - 0.00634920634920633*G3_11_0 - 0.019047619047619*G3_11_1 + 0.666666666666666*G10_0_0_1 + 0.666666666666666*G12_0_0_1;
+    A[48] = 0.0380952380952381*G0_0_0 + 0.0380952380952381*G0_0_1 + 0.0634920634920634*G0_1_0 + 0.0634920634920634*G0_2_1 + 0.152380952380952*G0_3_0 + 0.152380952380952*G0_3_1 - 0.152380952380952*G0_4_0 - 0.101587301587301*G0_4_1 - 0.101587301587302*G0_5_0 - 0.152380952380952*G0_5_1 - 0.019047619047619*G1_0_0 - 0.019047619047619*G1_0_1 - 0.0126984126984127*G1_1_0 + 0.019047619047619*G1_1_1 + 0.019047619047619*G1_2_0 - 0.0126984126984127*G1_2_1 + 0.152380952380952*G1_3_0 + 0.152380952380952*G1_3_1 + 0.0761904761904761*G1_4_0 + 0.0507936507936507*G1_4_1 + 0.0507936507936508*G1_5_0 + 0.0761904761904761*G1_5_1 - 0.019047619047619*G3_6_0 - 0.019047619047619*G3_6_1 - 0.0126984126984127*G3_7_0 + 0.019047619047619*G3_7_1 + 0.019047619047619*G3_8_0 - 0.0126984126984127*G3_8_1 + 0.152380952380952*G3_9_0 + 0.152380952380952*G3_9_1 + 0.0761904761904761*G3_10_0 + 0.0507936507936507*G3_10_1 + 0.0507936507936508*G3_11_0 + 0.0761904761904761*G3_11_1 + 1.33333333333333*G10_0_0_0 + 0.666666666666665*G10_0_0_1 + 0.666666666666665*G10_0_1_0 + 1.33333333333333*G10_0_1_1 + 1.33333333333333*G12_0_0_0 + 0.666666666666665*G12_0_0_1 + 0.666666666666665*G12_0_1_0 + 1.33333333333333*G12_0_1_1;
+    A[49] = -0.00634920634920633*G0_0_0 - 0.00634920634920632*G0_0_1 + 0.00634920634920634*G0_1_0 + 0.0317460317460317*G0_2_1 + 0.0761904761904761*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.0761904761904761*G0_4_0 - 0.0253968253968254*G0_4_1 - 0.0507936507936508*G0_5_1 - 0.0126984126984127*G1_0_0 - 0.00634920634920634*G1_0_1 - 0.019047619047619*G1_1_0 - 0.00634920634920634*G1_1_1 + 0.019047619047619*G1_2_0 - 0.00634920634920634*G1_2_1 + 0.0761904761904761*G1_3_0 + 0.0507936507936507*G1_3_1 + 0.152380952380952*G1_4_0 + 0.0507936507936507*G1_4_1 + 0.0507936507936508*G1_5_0 + 0.0507936507936507*G1_5_1 - 0.0126984126984127*G3_6_0 - 0.00634920634920634*G3_6_1 - 0.019047619047619*G3_7_0 - 0.00634920634920634*G3_7_1 + 0.019047619047619*G3_8_0 - 0.00634920634920634*G3_8_1 + 0.0761904761904761*G3_9_0 + 0.0507936507936507*G3_9_1 + 0.152380952380952*G3_10_0 + 0.0507936507936507*G3_10_1 + 0.0507936507936508*G3_11_0 + 0.0507936507936507*G3_11_1 - 1.33333333333333*G10_0_0_0 - 0.666666666666666*G10_0_0_1 - 0.666666666666665*G10_0_1_0 - 1.33333333333333*G12_0_0_0 - 0.666666666666666*G12_0_0_1 - 0.666666666666665*G12_0_1_0;
+    A[50] = -0.00634920634920633*G0_0_0 - 0.00634920634920632*G0_0_1 + 0.0317460317460317*G0_1_0 + 0.00634920634920636*G0_2_1 + 0.0507936507936508*G0_3_0 + 0.0761904761904761*G0_3_1 - 0.0507936507936508*G0_4_0 - 0.0253968253968254*G0_5_0 - 0.0761904761904762*G0_5_1 - 0.00634920634920635*G1_0_0 - 0.0126984126984127*G1_0_1 - 0.00634920634920635*G1_1_0 + 0.019047619047619*G1_1_1 - 0.00634920634920633*G1_2_0 - 0.019047619047619*G1_2_1 + 0.0507936507936508*G1_3_0 + 0.0761904761904761*G1_3_1 + 0.0507936507936507*G1_4_0 + 0.0507936507936507*G1_4_1 + 0.0507936507936507*G1_5_0 + 0.152380952380952*G1_5_1 - 0.00634920634920635*G3_6_0 - 0.0126984126984127*G3_6_1 - 0.00634920634920635*G3_7_0 + 0.019047619047619*G3_7_1 - 0.00634920634920633*G3_8_0 - 0.019047619047619*G3_8_1 + 0.0507936507936508*G3_9_0 + 0.0761904761904761*G3_9_1 + 0.0507936507936507*G3_10_0 + 0.0507936507936507*G3_10_1 + 0.0507936507936507*G3_11_0 + 0.152380952380952*G3_11_1 - 0.666666666666665*G10_0_0_1 - 0.666666666666667*G10_0_1_0 - 1.33333333333333*G10_0_1_1 - 0.666666666666665*G12_0_0_1 - 0.666666666666667*G12_0_1_0 - 1.33333333333333*G12_0_1_1;
+    A[51] = -0.00476190476190477*G4_6_0 - 0.00476190476190477*G4_6_1 - 0.00793650793650793*G4_7_0 - 0.00793650793650793*G4_8_1 - 0.019047619047619*G4_9_0 - 0.019047619047619*G4_9_1 + 0.019047619047619*G4_10_0 + 0.0126984126984127*G4_10_1 + 0.0126984126984127*G4_11_0 + 0.019047619047619*G4_11_1;
+    A[52] = 0.00634920634920634*G4_6_0 + 0.00634920634920634*G4_6_1 + 0.019047619047619*G4_7_0 - 0.0126984126984127*G4_8_1 - 0.0126984126984127*G4_9_0 + 0.019047619047619*G4_9_1 + 0.0126984126984127*G4_10_0 + 0.00634920634920636*G4_10_1 - 0.0253968253968254*G4_11_0 - 0.019047619047619*G4_11_1;
+    A[53] = 0.00634920634920635*G4_6_0 + 0.00634920634920634*G4_6_1 - 0.0126984126984127*G4_7_0 + 0.019047619047619*G4_8_1 + 0.019047619047619*G4_9_0 - 0.0126984126984127*G4_9_1 - 0.019047619047619*G4_10_0 - 0.0253968253968254*G4_10_1 + 0.00634920634920634*G4_11_0 + 0.0126984126984127*G4_11_1;
+    A[54] = 0.0380952380952381*G4_6_0 + 0.0380952380952381*G4_6_1 + 0.0634920634920634*G4_7_0 + 0.0634920634920634*G4_8_1 + 0.152380952380952*G4_9_0 + 0.152380952380952*G4_9_1 - 0.152380952380952*G4_10_0 - 0.101587301587301*G4_10_1 - 0.101587301587302*G4_11_0 - 0.152380952380952*G4_11_1;
+    A[55] = -0.00634920634920633*G4_6_0 - 0.00634920634920632*G4_6_1 + 0.00634920634920634*G4_7_0 + 0.0317460317460317*G4_8_1 + 0.0761904761904761*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.0761904761904761*G4_10_0 - 0.0253968253968254*G4_10_1 - 0.0507936507936508*G4_11_1;
+    A[56] = -0.00634920634920633*G4_6_0 - 0.00634920634920632*G4_6_1 + 0.0317460317460317*G4_7_0 + 0.00634920634920636*G4_8_1 + 0.0507936507936508*G4_9_0 + 0.0761904761904761*G4_9_1 - 0.0507936507936508*G4_10_0 - 0.0253968253968254*G4_11_0 - 0.0761904761904762*G4_11_1;
+    A[57] = 0.166666666666667*G8_0 + 0.166666666666667*G8_1;
+    A[58] = 0.166666666666667*G8_0 + 0.333333333333333*G8_1;
+    A[59] = 0.333333333333333*G8_0 + 0.166666666666666*G8_1;
+    A[60] = -0.0190476190476191*G0_0_0 - 0.0190476190476191*G0_0_1 - 0.00634920634920636*G0_1_0 - 0.0126984126984127*G0_2_1 - 0.0126984126984127*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.0126984126984127*G0_4_0 + 0.0317460317460318*G0_4_1 + 0.0253968253968254*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.00952380952380951*G1_0_0 + 0.0380952380952381*G1_0_1 - 0.00158730158730159*G1_1_0 - 0.00793650793650793*G1_1_1 + 0.00634920634920634*G1_2_0 + 0.019047619047619*G1_3_0 + 0.0126984126984127*G1_3_1 + 0.0126984126984127*G1_4_0 + 0.0317460317460318*G1_4_1 + 0.00634920634920635*G1_5_0 + 0.0253968253968254*G1_5_1 - 0.00952380952380951*G3_6_0 + 0.0380952380952381*G3_6_1 - 0.00158730158730159*G3_7_0 - 0.00793650793650793*G3_7_1 + 0.00634920634920634*G3_8_0 + 0.019047619047619*G3_9_0 + 0.0126984126984127*G3_9_1 + 0.0126984126984127*G3_10_0 + 0.0317460317460318*G3_10_1 + 0.00634920634920635*G3_11_0 + 0.0253968253968254*G3_11_1 - 0.666666666666667*G10_0_1_0 - 0.666666666666666*G10_0_1_1 - 0.666666666666667*G12_0_1_0 - 0.666666666666666*G12_0_1_1;
+    A[61] = 0.00793650793650793*G0_0_0 + 0.00793650793650793*G0_0_1 + 0.00476190476190476*G0_1_0 - 0.00793650793650794*G0_2_1 - 0.019047619047619*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.019047619047619*G0_4_0 - 0.0126984126984127*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.00158730158730159*G1_0_0 - 0.00793650793650793*G1_0_1 - 0.0095238095238095*G1_1_0 + 0.00634920634920633*G1_2_0 + 0.00793650793650792*G1_2_1 + 0.0126984126984127*G1_3_0 + 0.00634920634920636*G1_3_1 + 0.019047619047619*G1_4_0 + 0.00634920634920635*G1_5_0 - 0.00634920634920633*G1_5_1 - 0.00158730158730159*G3_6_0 - 0.00793650793650793*G3_6_1 - 0.0095238095238095*G3_7_0 + 0.00634920634920633*G3_8_0 + 0.00793650793650792*G3_8_1 + 0.0126984126984127*G3_9_0 + 0.00634920634920636*G3_9_1 + 0.019047619047619*G3_10_0 + 0.00634920634920635*G3_11_0 - 0.00634920634920633*G3_11_1;
+    A[62] = 0.0126984126984127*G0_0_0 + 0.0126984126984127*G0_0_1 - 0.00634920634920635*G0_1_0 + 0.019047619047619*G0_2_1 + 0.019047619047619*G0_3_0 - 0.00634920634920634*G0_3_1 - 0.019047619047619*G0_4_0 - 0.0317460317460317*G0_4_1 - 0.00634920634920635*G0_5_0 + 0.00634920634920634*G0_5_1 + 0.00634920634920634*G1_0_0 + 0.00634920634920634*G1_1_0 + 0.00793650793650792*G1_1_1 - 0.0476190476190475*G1_2_0 - 0.038095238095238*G1_2_1 - 0.019047619047619*G1_3_0 - 0.0253968253968254*G1_3_1 - 0.019047619047619*G1_4_0 - 0.0317460317460317*G1_4_1 + 0.00634920634920633*G1_5_0 - 0.0126984126984127*G1_5_1 + 0.00634920634920634*G3_6_0 + 0.00634920634920634*G3_7_0 + 0.00793650793650792*G3_7_1 - 0.0476190476190475*G3_8_0 - 0.038095238095238*G3_8_1 - 0.019047619047619*G3_9_0 - 0.0253968253968254*G3_9_1 - 0.019047619047619*G3_10_0 - 0.0317460317460317*G3_10_1 + 0.00634920634920633*G3_11_0 - 0.0126984126984127*G3_11_1 - 0.666666666666666*G10_0_0_1 - 0.666666666666666*G10_0_1_1 - 0.666666666666666*G12_0_0_1 - 0.666666666666666*G12_0_1_1;
+    A[63] = -0.00634920634920633*G0_0_0 - 0.00634920634920632*G0_0_1 + 0.00634920634920634*G0_1_0 + 0.0317460317460317*G0_2_1 + 0.0761904761904761*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.0761904761904761*G0_4_0 - 0.0253968253968254*G0_4_1 - 0.0507936507936508*G0_5_1 + 0.019047619047619*G1_0_0 + 0.0126984126984127*G1_0_1 + 0.0126984126984127*G1_1_0 + 0.00634920634920636*G1_1_1 - 0.019047619047619*G1_2_0 - 0.0253968253968254*G1_2_1 - 0.152380952380952*G1_3_0 - 0.101587301587301*G1_3_1 - 0.0761904761904761*G1_4_0 - 0.0253968253968254*G1_4_1 - 0.0507936507936508*G1_5_0 + 0.019047619047619*G3_6_0 + 0.0126984126984127*G3_6_1 + 0.0126984126984127*G3_7_0 + 0.00634920634920636*G3_7_1 - 0.019047619047619*G3_8_0 - 0.0253968253968254*G3_8_1 - 0.152380952380952*G3_9_0 - 0.101587301587301*G3_9_1 - 0.0761904761904761*G3_10_0 - 0.0253968253968254*G3_10_1 - 0.0507936507936508*G3_11_0 - 1.33333333333333*G10_0_0_0 - 0.666666666666665*G10_0_0_1 - 0.666666666666666*G10_0_1_0 - 1.33333333333333*G12_0_0_0 - 0.666666666666665*G12_0_0_1 - 0.666666666666666*G12_0_1_0;
+    A[64] = -0.0634920634920635*G0_0_0 - 0.0634920634920635*G0_0_1 - 0.0380952380952381*G0_1_0 + 0.0634920634920635*G0_2_1 + 0.152380952380952*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.152380952380952*G0_4_0 + 0.101587301587302*G0_5_0 - 0.0507936507936507*G0_5_1 + 0.0126984126984127*G1_0_0 + 0.0317460317460318*G1_0_1 + 0.019047619047619*G1_1_0 - 0.019047619047619*G1_2_0 - 0.0317460317460317*G1_2_1 - 0.0761904761904761*G1_3_0 - 0.0253968253968254*G1_3_1 - 0.152380952380952*G1_4_0 - 0.0507936507936508*G1_5_0 + 0.0253968253968254*G1_5_1 + 0.0126984126984127*G3_6_0 + 0.0317460317460318*G3_6_1 + 0.019047619047619*G3_7_0 - 0.019047619047619*G3_8_0 - 0.0317460317460317*G3_8_1 - 0.0761904761904761*G3_9_0 - 0.0253968253968254*G3_9_1 - 0.152380952380952*G3_10_0 - 0.0507936507936508*G3_11_0 + 0.0253968253968254*G3_11_1 + 1.33333333333333*G10_0_0_0 + 0.666666666666666*G10_0_0_1 + 0.666666666666666*G10_0_1_0 + 1.33333333333333*G10_0_1_1 + 1.33333333333333*G12_0_0_0 + 0.666666666666666*G12_0_0_1 + 0.666666666666666*G12_0_1_0 + 1.33333333333333*G12_0_1_1;
+    A[65] = -0.0317460317460317*G0_0_0 - 0.0317460317460317*G0_0_1 + 0.00634920634920634*G0_1_0 + 0.00634920634920636*G0_2_1 + 0.0507936507936507*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.0507936507936507*G0_4_0 + 0.0253968253968254*G0_4_1 + 0.0253968253968254*G0_5_0 - 0.0507936507936508*G0_5_1 + 0.00634920634920635*G1_0_0 + 0.0253968253968254*G1_0_1 + 0.00634920634920635*G1_1_0 - 0.00634920634920633*G1_1_1 + 0.00634920634920633*G1_2_0 - 0.0126984126984127*G1_2_1 - 0.0507936507936508*G1_3_0 - 0.0507936507936507*G1_4_0 + 0.0253968253968254*G1_4_1 - 0.0507936507936507*G1_5_0 + 0.101587301587302*G1_5_1 + 0.00634920634920635*G3_6_0 + 0.0253968253968254*G3_6_1 + 0.00634920634920635*G3_7_0 - 0.00634920634920633*G3_7_1 + 0.00634920634920633*G3_8_0 - 0.0126984126984127*G3_8_1 - 0.0507936507936508*G3_9_0 - 0.0507936507936507*G3_10_0 + 0.0253968253968254*G3_10_1 - 0.0507936507936507*G3_11_0 + 0.101587301587302*G3_11_1 + 0.666666666666665*G10_0_0_1 + 0.666666666666667*G10_0_1_0 + 0.666666666666665*G12_0_0_1 + 0.666666666666667*G12_0_1_0;
+    A[66] = -0.0190476190476191*G4_6_0 - 0.0190476190476191*G4_6_1 - 0.00634920634920636*G4_7_0 - 0.0126984126984127*G4_8_1 - 0.0126984126984127*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.0126984126984127*G4_10_0 + 0.0317460317460318*G4_10_1 + 0.0253968253968254*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[67] = 0.00793650793650793*G4_6_0 + 0.00793650793650793*G4_6_1 + 0.00476190476190476*G4_7_0 - 0.00793650793650794*G4_8_1 - 0.019047619047619*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.019047619047619*G4_10_0 - 0.0126984126984127*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[68] = 0.0126984126984127*G4_6_0 + 0.0126984126984127*G4_6_1 - 0.00634920634920635*G4_7_0 + 0.019047619047619*G4_8_1 + 0.019047619047619*G4_9_0 - 0.00634920634920634*G4_9_1 - 0.019047619047619*G4_10_0 - 0.0317460317460317*G4_10_1 - 0.00634920634920635*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[69] = -0.00634920634920633*G4_6_0 - 0.00634920634920632*G4_6_1 + 0.00634920634920634*G4_7_0 + 0.0317460317460317*G4_8_1 + 0.0761904761904761*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.0761904761904761*G4_10_0 - 0.0253968253968254*G4_10_1 - 0.0507936507936508*G4_11_1;
+    A[70] = -0.0634920634920635*G4_6_0 - 0.0634920634920635*G4_6_1 - 0.0380952380952381*G4_7_0 + 0.0634920634920635*G4_8_1 + 0.152380952380952*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.152380952380952*G4_10_0 + 0.101587301587302*G4_11_0 - 0.0507936507936507*G4_11_1;
+    A[71] = -0.0317460317460317*G4_6_0 - 0.0317460317460317*G4_6_1 + 0.00634920634920634*G4_7_0 + 0.00634920634920636*G4_8_1 + 0.0507936507936507*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.0507936507936507*G4_10_0 + 0.0253968253968254*G4_10_1 + 0.0253968253968254*G4_11_0 - 0.0507936507936508*G4_11_1;
+    A[72] = -0.166666666666667*G8_0 + 0.166666666666667*G8_1;
+    A[73] = -0.166666666666667*G8_0;
+    A[74] = -0.333333333333333*G8_0 - 0.166666666666667*G8_1;
+    A[75] = -0.0190476190476191*G0_0_0 - 0.0190476190476191*G0_0_1 - 0.0126984126984127*G0_1_0 - 0.00634920634920635*G0_2_1 - 0.00634920634920635*G0_3_0 - 0.0126984126984127*G0_3_1 + 0.00634920634920635*G0_4_0 + 0.0253968253968254*G0_4_1 + 0.0317460317460318*G0_5_0 + 0.0126984126984127*G0_5_1 + 0.0380952380952381*G1_0_0 - 0.00952380952380952*G1_0_1 + 0.00634920634920635*G1_1_1 - 0.00793650793650793*G1_2_0 - 0.00158730158730159*G1_2_1 + 0.0126984126984127*G1_3_0 + 0.019047619047619*G1_3_1 + 0.0253968253968254*G1_4_0 + 0.00634920634920634*G1_4_1 + 0.0317460317460318*G1_5_0 + 0.0126984126984127*G1_5_1 + 0.0380952380952381*G3_6_0 - 0.00952380952380952*G3_6_1 + 0.00634920634920635*G3_7_1 - 0.00793650793650793*G3_8_0 - 0.00158730158730159*G3_8_1 + 0.0126984126984127*G3_9_0 + 0.019047619047619*G3_9_1 + 0.0253968253968254*G3_10_0 + 0.00634920634920634*G3_10_1 + 0.0317460317460318*G3_11_0 + 0.0126984126984127*G3_11_1 - 0.666666666666667*G10_0_0_0 - 0.666666666666667*G10_0_0_1 - 0.666666666666667*G12_0_0_0 - 0.666666666666667*G12_0_0_1;
+    A[76] = 0.0126984126984127*G0_0_0 + 0.0126984126984127*G0_0_1 + 0.019047619047619*G0_1_0 - 0.00634920634920636*G0_2_1 - 0.00634920634920635*G0_3_0 + 0.019047619047619*G0_3_1 + 0.00634920634920635*G0_4_0 - 0.00634920634920633*G0_4_1 - 0.0317460317460317*G0_5_0 - 0.0190476190476191*G0_5_1 + 0.00634920634920635*G1_0_1 - 0.0380952380952381*G1_1_0 - 0.0476190476190476*G1_1_1 + 0.00793650793650793*G1_2_0 + 0.00634920634920634*G1_2_1 - 0.0253968253968254*G1_3_0 - 0.019047619047619*G1_3_1 - 0.0126984126984127*G1_4_0 + 0.00634920634920634*G1_4_1 - 0.0317460317460317*G1_5_0 - 0.0190476190476191*G1_5_1 + 0.00634920634920635*G3_6_1 - 0.0380952380952381*G3_7_0 - 0.0476190476190476*G3_7_1 + 0.00793650793650793*G3_8_0 + 0.00634920634920634*G3_8_1 - 0.0253968253968254*G3_9_0 - 0.019047619047619*G3_9_1 - 0.0126984126984127*G3_10_0 + 0.00634920634920634*G3_10_1 - 0.0317460317460317*G3_11_0 - 0.0190476190476191*G3_11_1 - 0.666666666666667*G10_0_0_0 - 0.666666666666667*G10_0_1_0 - 0.666666666666667*G12_0_0_0 - 0.666666666666667*G12_0_1_0;
+    A[77] = 0.00793650793650793*G0_0_0 + 0.00793650793650793*G0_0_1 - 0.00793650793650793*G0_1_0 + 0.00476190476190476*G0_2_1 - 0.00634920634920633*G0_3_0 - 0.019047619047619*G0_3_1 + 0.00634920634920633*G0_4_0 - 0.0126984126984127*G0_4_1 + 0.019047619047619*G0_5_1 - 0.00793650793650793*G1_0_0 - 0.00158730158730159*G1_0_1 + 0.00793650793650793*G1_1_0 + 0.00634920634920634*G1_1_1 - 0.00952380952380951*G1_2_1 + 0.00634920634920634*G1_3_0 + 0.0126984126984127*G1_3_1 - 0.00634920634920635*G1_4_0 + 0.00634920634920634*G1_4_1 + 0.019047619047619*G1_5_1 - 0.00793650793650793*G3_6_0 - 0.00158730158730159*G3_6_1 + 0.00793650793650793*G3_7_0 + 0.00634920634920634*G3_7_1 - 0.00952380952380951*G3_8_1 + 0.00634920634920634*G3_9_0 + 0.0126984126984127*G3_9_1 - 0.00634920634920635*G3_10_0 + 0.00634920634920634*G3_10_1 + 0.019047619047619*G3_11_1;
+    A[78] = -0.00634920634920633*G0_0_0 - 0.00634920634920632*G0_0_1 + 0.0317460317460317*G0_1_0 + 0.00634920634920636*G0_2_1 + 0.0507936507936508*G0_3_0 + 0.0761904761904761*G0_3_1 - 0.0507936507936508*G0_4_0 - 0.0253968253968254*G0_5_0 - 0.0761904761904762*G0_5_1 + 0.0126984126984127*G1_0_0 + 0.019047619047619*G1_0_1 - 0.0253968253968254*G1_1_0 - 0.019047619047619*G1_1_1 + 0.00634920634920634*G1_2_0 + 0.0126984126984127*G1_2_1 - 0.101587301587302*G1_3_0 - 0.152380952380952*G1_3_1 - 0.0507936507936508*G1_4_1 - 0.0253968253968254*G1_5_0 - 0.0761904761904762*G1_5_1 + 0.0126984126984127*G3_6_0 + 0.019047619047619*G3_6_1 - 0.0253968253968254*G3_7_0 - 0.019047619047619*G3_7_1 + 0.00634920634920634*G3_8_0 + 0.0126984126984127*G3_8_1 - 0.101587301587302*G3_9_0 - 0.152380952380952*G3_9_1 - 0.0507936507936508*G3_10_1 - 0.0253968253968254*G3_11_0 - 0.0761904761904762*G3_11_1 - 0.666666666666667*G10_0_0_1 - 0.666666666666666*G10_0_1_0 - 1.33333333333333*G10_0_1_1 - 0.666666666666667*G12_0_0_1 - 0.666666666666666*G12_0_1_0 - 1.33333333333333*G12_0_1_1;
+    A[79] = -0.0317460317460317*G0_0_0 - 0.0317460317460317*G0_0_1 + 0.00634920634920634*G0_1_0 + 0.00634920634920636*G0_2_1 + 0.0507936507936508*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.0507936507936508*G0_4_0 + 0.0253968253968254*G0_4_1 + 0.0253968253968254*G0_5_0 - 0.0507936507936508*G0_5_1 + 0.0253968253968254*G1_0_0 + 0.00634920634920634*G1_0_1 - 0.0126984126984127*G1_1_0 + 0.00634920634920634*G1_1_1 - 0.00634920634920635*G1_2_0 + 0.00634920634920634*G1_2_1 - 0.0507936507936508*G1_3_1 + 0.101587301587302*G1_4_0 - 0.0507936507936507*G1_4_1 + 0.0253968253968254*G1_5_0 - 0.0507936507936508*G1_5_1 + 0.0253968253968254*G3_6_0 + 0.00634920634920634*G3_6_1 - 0.0126984126984127*G3_7_0 + 0.00634920634920634*G3_7_1 - 0.00634920634920635*G3_8_0 + 0.00634920634920634*G3_8_1 - 0.0507936507936508*G3_9_1 + 0.101587301587302*G3_10_0 - 0.0507936507936507*G3_10_1 + 0.0253968253968254*G3_11_0 - 0.0507936507936508*G3_11_1 + 0.666666666666667*G10_0_0_1 + 0.666666666666666*G10_0_1_0 + 0.666666666666667*G12_0_0_1 + 0.666666666666666*G12_0_1_0;
+    A[80] = -0.0634920634920635*G0_0_0 - 0.0634920634920635*G0_0_1 + 0.0634920634920635*G0_1_0 - 0.0380952380952381*G0_2_1 + 0.0507936507936507*G0_3_0 + 0.152380952380952*G0_3_1 - 0.0507936507936507*G0_4_0 + 0.101587301587302*G0_4_1 - 0.152380952380952*G0_5_1 + 0.0317460317460318*G1_0_0 + 0.0126984126984127*G1_0_1 - 0.0317460317460317*G1_1_0 - 0.0190476190476191*G1_1_1 + 0.019047619047619*G1_2_1 - 0.0253968253968254*G1_3_0 - 0.0761904761904762*G1_3_1 + 0.0253968253968254*G1_4_0 - 0.0507936507936508*G1_4_1 - 0.152380952380952*G1_5_1 + 0.0317460317460318*G3_6_0 + 0.0126984126984127*G3_6_1 - 0.0317460317460317*G3_7_0 - 0.0190476190476191*G3_7_1 + 0.019047619047619*G3_8_1 - 0.0253968253968254*G3_9_0 - 0.0761904761904762*G3_9_1 + 0.0253968253968254*G3_10_0 - 0.0507936507936508*G3_10_1 - 0.152380952380952*G3_11_1 + 1.33333333333333*G10_0_0_0 + 0.666666666666667*G10_0_0_1 + 0.666666666666667*G10_0_1_0 + 1.33333333333333*G10_0_1_1 + 1.33333333333333*G12_0_0_0 + 0.666666666666667*G12_0_0_1 + 0.666666666666667*G12_0_1_0 + 1.33333333333333*G12_0_1_1;
+    A[81] = -0.0190476190476191*G4_6_0 - 0.0190476190476191*G4_6_1 - 0.0126984126984127*G4_7_0 - 0.00634920634920635*G4_8_1 - 0.00634920634920635*G4_9_0 - 0.0126984126984127*G4_9_1 + 0.00634920634920635*G4_10_0 + 0.0253968253968254*G4_10_1 + 0.0317460317460318*G4_11_0 + 0.0126984126984127*G4_11_1;
+    A[82] = 0.0126984126984127*G4_6_0 + 0.0126984126984127*G4_6_1 + 0.019047619047619*G4_7_0 - 0.00634920634920636*G4_8_1 - 0.00634920634920635*G4_9_0 + 0.019047619047619*G4_9_1 + 0.00634920634920635*G4_10_0 - 0.00634920634920633*G4_10_1 - 0.0317460317460317*G4_11_0 - 0.0190476190476191*G4_11_1;
+    A[83] = 0.00793650793650793*G4_6_0 + 0.00793650793650793*G4_6_1 - 0.00793650793650793*G4_7_0 + 0.00476190476190476*G4_8_1 - 0.00634920634920633*G4_9_0 - 0.019047619047619*G4_9_1 + 0.00634920634920633*G4_10_0 - 0.0126984126984127*G4_10_1 + 0.019047619047619*G4_11_1;
+    A[84] = -0.00634920634920633*G4_6_0 - 0.00634920634920632*G4_6_1 + 0.0317460317460317*G4_7_0 + 0.00634920634920636*G4_8_1 + 0.0507936507936508*G4_9_0 + 0.0761904761904761*G4_9_1 - 0.0507936507936508*G4_10_0 - 0.0253968253968254*G4_11_0 - 0.0761904761904762*G4_11_1;
+    A[85] = -0.0317460317460317*G4_6_0 - 0.0317460317460317*G4_6_1 + 0.00634920634920634*G4_7_0 + 0.00634920634920636*G4_8_1 + 0.0507936507936508*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.0507936507936508*G4_10_0 + 0.0253968253968254*G4_10_1 + 0.0253968253968254*G4_11_0 - 0.0507936507936508*G4_11_1;
+    A[86] = -0.0634920634920635*G4_6_0 - 0.0634920634920635*G4_6_1 + 0.0634920634920635*G4_7_0 - 0.0380952380952381*G4_8_1 + 0.0507936507936507*G4_9_0 + 0.152380952380952*G4_9_1 - 0.0507936507936507*G4_10_0 + 0.101587301587302*G4_10_1 - 0.152380952380952*G4_11_1;
+    A[87] = 0.166666666666667*G8_0 - 0.166666666666667*G8_1;
+    A[88] = -0.166666666666667*G8_0 - 0.333333333333333*G8_1;
+    A[89] = -0.166666666666667*G8_1;
+    A[90] = -0.030952380952381*G2_0_0 - 0.030952380952381*G2_0_1 - 0.00714285714285715*G2_1_0 - 0.00714285714285715*G2_2_1 + 0.00952380952380951*G2_3_0 + 0.00952380952380951*G2_3_1 - 0.00952380952380951*G2_4_0 + 0.0380952380952381*G2_4_1 + 0.0380952380952381*G2_5_0 - 0.00952380952380952*G2_5_1;
+    A[91] = 0.00357142857142857*G2_0_0 + 0.00357142857142857*G2_0_1 - 0.00357142857142857*G2_1_0 + 0.00436507936507936*G2_2_1 + 0.00158730158730159*G2_3_0 - 0.00634920634920634*G2_3_1 - 0.00158730158730159*G2_4_0 - 0.00793650793650793*G2_4_1 + 0.00634920634920635*G2_5_1;
+    A[92] = 0.00357142857142857*G2_0_0 + 0.00357142857142857*G2_0_1 + 0.00436507936507936*G2_1_0 - 0.00357142857142857*G2_2_1 - 0.00634920634920634*G2_3_0 + 0.00158730158730159*G2_3_1 + 0.00634920634920634*G2_4_0 - 0.00793650793650793*G2_5_0 - 0.00158730158730159*G2_5_1;
+    A[93] = -0.00476190476190476*G2_0_0 - 0.00476190476190477*G2_0_1 - 0.00793650793650793*G2_1_0 - 0.00793650793650793*G2_2_1 - 0.019047619047619*G2_3_0 - 0.019047619047619*G2_3_1 + 0.019047619047619*G2_4_0 + 0.0126984126984127*G2_4_1 + 0.0126984126984127*G2_5_0 + 0.019047619047619*G2_5_1;
+    A[94] = -0.0190476190476191*G2_0_0 - 0.0190476190476191*G2_0_1 - 0.00634920634920636*G2_1_0 - 0.0126984126984127*G2_2_1 - 0.0126984126984127*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.0126984126984127*G2_4_0 + 0.0317460317460318*G2_4_1 + 0.0253968253968254*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[95] = -0.0190476190476191*G2_0_0 - 0.0190476190476191*G2_0_1 - 0.0126984126984127*G2_1_0 - 0.00634920634920635*G2_2_1 - 0.00634920634920635*G2_3_0 - 0.0126984126984127*G2_3_1 + 0.00634920634920635*G2_4_0 + 0.0253968253968254*G2_4_1 + 0.0317460317460318*G2_5_0 + 0.0126984126984127*G2_5_1;
+    A[96] = -0.030952380952381*G5_0_0 - 0.030952380952381*G5_0_1 + 0.00357142857142857*G5_1_0 + 0.00357142857142857*G5_1_1 + 0.00357142857142857*G5_2_0 + 0.00357142857142857*G5_2_1 - 0.00476190476190477*G5_3_0 - 0.00476190476190477*G5_3_1 - 0.0190476190476191*G5_4_0 - 0.0190476190476191*G5_4_1 - 0.0190476190476191*G5_5_0 - 0.0190476190476191*G5_5_1 - 0.030952380952381*G6_6_0 - 0.030952380952381*G6_6_1 - 0.00714285714285715*G6_7_0 - 0.00714285714285715*G6_8_1 + 0.00952380952380951*G6_9_0 + 0.00952380952380951*G6_9_1 - 0.00952380952380951*G6_10_0 + 0.0380952380952381*G6_10_1 + 0.0380952380952381*G6_11_0 - 0.00952380952380952*G6_11_1 - 0.030952380952381*G7_6_0 - 0.030952380952381*G7_6_1 + 0.00357142857142857*G7_7_0 + 0.00357142857142857*G7_7_1 + 0.00357142857142857*G7_8_0 + 0.00357142857142857*G7_8_1 - 0.00476190476190477*G7_9_0 - 0.00476190476190477*G7_9_1 - 0.0190476190476191*G7_10_0 - 0.0190476190476191*G7_10_1 - 0.0190476190476191*G7_11_0 - 0.0190476190476191*G7_11_1 + 0.5*G11_0_0_0 + 0.5*G11_0_0_1 + 0.5*G11_0_1_0 + 0.5*G11_0_1_1 + 0.5*G13_0_0_0 + 0.5*G13_0_0_1 + 0.5*G13_0_1_0 + 0.5*G13_0_1_1;
+    A[97] = 0.00357142857142857*G5_0_0 + 0.00357142857142857*G5_0_1 + 0.00714285714285713*G5_1_0 + 0.00714285714285714*G5_1_1 - 0.00436507936507936*G5_2_0 - 0.00436507936507936*G5_2_1 + 0.00634920634920634*G5_3_0 + 0.00634920634920634*G5_3_1 + 0.00793650793650793*G5_4_0 + 0.00793650793650793*G5_4_1 + 0.0126984126984127*G5_5_0 + 0.0126984126984127*G5_5_1 + 0.00357142857142857*G6_6_0 + 0.00357142857142857*G6_6_1 - 0.00357142857142857*G6_7_0 + 0.00436507936507936*G6_8_1 + 0.00158730158730159*G6_9_0 - 0.00634920634920634*G6_9_1 - 0.00158730158730159*G6_10_0 - 0.00793650793650793*G6_10_1 + 0.00634920634920635*G6_11_1 + 0.00357142857142857*G7_6_0 + 0.00357142857142857*G7_6_1 + 0.00714285714285713*G7_7_0 + 0.00714285714285714*G7_7_1 - 0.00436507936507936*G7_8_0 - 0.00436507936507936*G7_8_1 + 0.00634920634920634*G7_9_0 + 0.00634920634920634*G7_9_1 + 0.00793650793650793*G7_10_0 + 0.00793650793650793*G7_10_1 + 0.0126984126984127*G7_11_0 + 0.0126984126984127*G7_11_1 + 0.166666666666667*G11_0_0_0 + 0.166666666666667*G11_0_1_0 + 0.166666666666667*G13_0_0_0 + 0.166666666666667*G13_0_1_0;
+    A[98] = 0.00357142857142857*G5_0_0 + 0.00357142857142857*G5_0_1 - 0.00436507936507936*G5_1_0 - 0.00436507936507936*G5_1_1 + 0.00714285714285714*G5_2_0 + 0.00714285714285713*G5_2_1 + 0.00634920634920635*G5_3_0 + 0.00634920634920634*G5_3_1 + 0.0126984126984127*G5_4_0 + 0.0126984126984127*G5_4_1 + 0.00793650793650793*G5_5_0 + 0.00793650793650793*G5_5_1 + 0.00357142857142857*G6_6_0 + 0.00357142857142857*G6_6_1 + 0.00436507936507936*G6_7_0 - 0.00357142857142857*G6_8_1 - 0.00634920634920634*G6_9_0 + 0.00158730158730159*G6_9_1 + 0.00634920634920634*G6_10_0 - 0.00793650793650793*G6_11_0 - 0.00158730158730159*G6_11_1 + 0.00357142857142857*G7_6_0 + 0.00357142857142857*G7_6_1 - 0.00436507936507936*G7_7_0 - 0.00436507936507936*G7_7_1 + 0.00714285714285714*G7_8_0 + 0.00714285714285713*G7_8_1 + 0.00634920634920635*G7_9_0 + 0.00634920634920634*G7_9_1 + 0.0126984126984127*G7_10_0 + 0.0126984126984127*G7_10_1 + 0.00793650793650793*G7_11_0 + 0.00793650793650793*G7_11_1 + 0.166666666666667*G11_0_0_1 + 0.166666666666667*G11_0_1_1 + 0.166666666666667*G13_0_0_1 + 0.166666666666667*G13_0_1_1;
+    A[99] = -0.00476190476190476*G5_0_0 - 0.00476190476190477*G5_0_1 + 0.00634920634920634*G5_1_0 + 0.00634920634920634*G5_1_1 + 0.00634920634920635*G5_2_0 + 0.00634920634920634*G5_2_1 + 0.0380952380952381*G5_3_0 + 0.0380952380952381*G5_3_1 - 0.00634920634920633*G5_4_0 - 0.00634920634920632*G5_4_1 - 0.00634920634920633*G5_5_0 - 0.00634920634920632*G5_5_1 - 0.00476190476190476*G6_6_0 - 0.00476190476190477*G6_6_1 - 0.00793650793650793*G6_7_0 - 0.00793650793650793*G6_8_1 - 0.019047619047619*G6_9_0 - 0.019047619047619*G6_9_1 + 0.019047619047619*G6_10_0 + 0.0126984126984127*G6_10_1 + 0.0126984126984127*G6_11_0 + 0.019047619047619*G6_11_1 - 0.00476190476190476*G7_6_0 - 0.00476190476190477*G7_6_1 + 0.00634920634920634*G7_7_0 + 0.00634920634920634*G7_7_1 + 0.00634920634920635*G7_8_0 + 0.00634920634920634*G7_8_1 + 0.0380952380952381*G7_9_0 + 0.0380952380952381*G7_9_1 - 0.00634920634920633*G7_10_0 - 0.00634920634920632*G7_10_1 - 0.00634920634920633*G7_11_0 - 0.00634920634920632*G7_11_1;
+    A[100] = -0.0190476190476191*G5_0_0 - 0.0190476190476191*G5_0_1 + 0.00793650793650793*G5_1_0 + 0.00793650793650793*G5_1_1 + 0.0126984126984127*G5_2_0 + 0.0126984126984127*G5_2_1 - 0.00634920634920633*G5_3_0 - 0.00634920634920632*G5_3_1 - 0.0634920634920635*G5_4_0 - 0.0634920634920635*G5_4_1 - 0.0317460317460317*G5_5_0 - 0.0317460317460317*G5_5_1 - 0.0190476190476191*G6_6_0 - 0.0190476190476191*G6_6_1 - 0.00634920634920636*G6_7_0 - 0.0126984126984127*G6_8_1 - 0.0126984126984127*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.0126984126984127*G6_10_0 + 0.0317460317460318*G6_10_1 + 0.0253968253968254*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.0190476190476191*G7_6_0 - 0.0190476190476191*G7_6_1 + 0.00793650793650793*G7_7_0 + 0.00793650793650793*G7_7_1 + 0.0126984126984127*G7_8_0 + 0.0126984126984127*G7_8_1 - 0.00634920634920633*G7_9_0 - 0.00634920634920632*G7_9_1 - 0.0634920634920635*G7_10_0 - 0.0634920634920635*G7_10_1 - 0.0317460317460317*G7_11_0 - 0.0317460317460317*G7_11_1 - 0.666666666666667*G11_0_0_1 - 0.666666666666666*G11_0_1_1 - 0.666666666666667*G13_0_0_1 - 0.666666666666666*G13_0_1_1;
+    A[101] = -0.0190476190476191*G5_0_0 - 0.0190476190476191*G5_0_1 + 0.0126984126984127*G5_1_0 + 0.0126984126984127*G5_1_1 + 0.00793650793650793*G5_2_0 + 0.00793650793650793*G5_2_1 - 0.00634920634920633*G5_3_0 - 0.00634920634920632*G5_3_1 - 0.0317460317460317*G5_4_0 - 0.0317460317460317*G5_4_1 - 0.0634920634920635*G5_5_0 - 0.0634920634920635*G5_5_1 - 0.0190476190476191*G6_6_0 - 0.0190476190476191*G6_6_1 - 0.0126984126984127*G6_7_0 - 0.00634920634920635*G6_8_1 - 0.00634920634920635*G6_9_0 - 0.0126984126984127*G6_9_1 + 0.00634920634920635*G6_10_0 + 0.0253968253968254*G6_10_1 + 0.0317460317460318*G6_11_0 + 0.0126984126984127*G6_11_1 - 0.0190476190476191*G7_6_0 - 0.0190476190476191*G7_6_1 + 0.0126984126984127*G7_7_0 + 0.0126984126984127*G7_7_1 + 0.00793650793650793*G7_8_0 + 0.00793650793650793*G7_8_1 - 0.00634920634920633*G7_9_0 - 0.00634920634920632*G7_9_1 - 0.0317460317460317*G7_10_0 - 0.0317460317460317*G7_10_1 - 0.0634920634920635*G7_11_0 - 0.0634920634920635*G7_11_1 - 0.666666666666667*G11_0_0_0 - 0.666666666666667*G11_0_1_0 - 0.666666666666667*G13_0_0_0 - 0.666666666666667*G13_0_1_0;
+    A[102] = -0.166666666666667*G9_0 - 0.166666666666667*G9_1;
+    A[103] = 0.0;
+    A[104] = 0.0;
+    A[105] = 0.00357142857142857*G2_0_0 + 0.00357142857142857*G2_0_1 - 0.00357142857142857*G2_1_0 + 0.00436507936507936*G2_2_1 + 0.00158730158730159*G2_3_0 - 0.00634920634920634*G2_3_1 - 0.00158730158730159*G2_4_0 - 0.00793650793650793*G2_4_1 + 0.00634920634920635*G2_5_1;
+    A[106] = 0.00714285714285713*G2_0_0 + 0.00714285714285714*G2_0_1 + 0.0309523809523809*G2_1_0 - 0.00714285714285713*G2_2_1 + 0.0095238095238095*G2_3_0 + 0.0476190476190476*G2_3_1 - 0.0095238095238095*G2_4_0 - 0.0380952380952381*G2_5_0 - 0.0476190476190476*G2_5_1;
+    A[107] = -0.00436507936507936*G2_0_0 - 0.00436507936507936*G2_0_1 - 0.00357142857142857*G2_1_0 - 0.00357142857142857*G2_2_1 - 0.00634920634920634*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.00634920634920634*G2_4_0 + 0.00793650793650792*G2_4_1 + 0.00793650793650793*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[108] = 0.00634920634920634*G2_0_0 + 0.00634920634920634*G2_0_1 + 0.019047619047619*G2_1_0 - 0.0126984126984127*G2_2_1 - 0.0126984126984127*G2_3_0 + 0.019047619047619*G2_3_1 + 0.0126984126984127*G2_4_0 + 0.00634920634920636*G2_4_1 - 0.0253968253968254*G2_5_0 - 0.019047619047619*G2_5_1;
+    A[109] = 0.00793650793650793*G2_0_0 + 0.00793650793650793*G2_0_1 + 0.00476190476190476*G2_1_0 - 0.00793650793650794*G2_2_1 - 0.019047619047619*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.019047619047619*G2_4_0 - 0.0126984126984127*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[110] = 0.0126984126984127*G2_0_0 + 0.0126984126984127*G2_0_1 + 0.019047619047619*G2_1_0 - 0.00634920634920636*G2_2_1 - 0.00634920634920635*G2_3_0 + 0.019047619047619*G2_3_1 + 0.00634920634920635*G2_4_0 - 0.00634920634920633*G2_4_1 - 0.0317460317460317*G2_5_0 - 0.0190476190476191*G2_5_1;
+    A[111] = -0.00714285714285715*G5_0_0 - 0.00357142857142857*G5_1_0 + 0.00436507936507936*G5_2_0 - 0.00793650793650793*G5_3_0 - 0.00634920634920636*G5_4_0 - 0.0126984126984127*G5_5_0 + 0.00357142857142857*G6_6_0 + 0.00357142857142857*G6_6_1 - 0.00357142857142857*G6_7_0 + 0.00436507936507936*G6_8_1 + 0.00158730158730159*G6_9_0 - 0.00634920634920634*G6_9_1 - 0.00158730158730159*G6_10_0 - 0.00793650793650793*G6_10_1 + 0.00634920634920635*G6_11_1 - 0.00714285714285715*G7_6_0 - 0.00357142857142857*G7_7_0 + 0.00436507936507936*G7_8_0 - 0.00793650793650793*G7_9_0 - 0.00634920634920636*G7_10_0 - 0.0126984126984127*G7_11_0 + 0.166666666666667*G11_0_0_0 + 0.166666666666667*G11_0_0_1 + 0.166666666666667*G13_0_0_0 + 0.166666666666667*G13_0_0_1;
+    A[112] = -0.00357142857142857*G5_0_0 + 0.0309523809523809*G5_1_0 - 0.00357142857142856*G5_2_0 + 0.019047619047619*G5_3_0 + 0.00476190476190476*G5_4_0 + 0.019047619047619*G5_5_0 + 0.00714285714285713*G6_6_0 + 0.00714285714285714*G6_6_1 + 0.0309523809523809*G6_7_0 - 0.00714285714285713*G6_8_1 + 0.0095238095238095*G6_9_0 + 0.0476190476190476*G6_9_1 - 0.0095238095238095*G6_10_0 - 0.0380952380952381*G6_11_0 - 0.0476190476190476*G6_11_1 - 0.00357142857142857*G7_6_0 + 0.0309523809523809*G7_7_0 - 0.00357142857142856*G7_8_0 + 0.019047619047619*G7_9_0 + 0.00476190476190476*G7_10_0 + 0.019047619047619*G7_11_0 + 0.5*G11_0_0_0 + 0.5*G13_0_0_0;
+    A[113] = 0.00436507936507936*G5_0_0 - 0.00357142857142857*G5_1_0 - 0.00714285714285714*G5_2_0 - 0.0126984126984127*G5_3_0 - 0.00634920634920635*G5_4_0 - 0.00793650793650793*G5_5_0 - 0.00436507936507936*G6_6_0 - 0.00436507936507936*G6_6_1 - 0.00357142857142857*G6_7_0 - 0.00357142857142857*G6_8_1 - 0.00634920634920634*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.00634920634920634*G6_10_0 + 0.00793650793650792*G6_10_1 + 0.00793650793650793*G6_11_0 + 0.00634920634920634*G6_11_1 + 0.00436507936507936*G7_6_0 - 0.00357142857142857*G7_7_0 - 0.00714285714285714*G7_8_0 - 0.0126984126984127*G7_9_0 - 0.00634920634920635*G7_10_0 - 0.00793650793650793*G7_11_0 - 0.166666666666667*G11_0_0_1 - 0.166666666666667*G13_0_0_1;
+    A[114] = -0.00793650793650793*G5_0_0 + 0.019047619047619*G5_1_0 - 0.0126984126984127*G5_2_0 + 0.0634920634920634*G5_3_0 + 0.00634920634920634*G5_4_0 + 0.0317460317460317*G5_5_0 + 0.00634920634920634*G6_6_0 + 0.00634920634920634*G6_6_1 + 0.019047619047619*G6_7_0 - 0.0126984126984127*G6_8_1 - 0.0126984126984127*G6_9_0 + 0.019047619047619*G6_9_1 + 0.0126984126984127*G6_10_0 + 0.00634920634920636*G6_10_1 - 0.0253968253968254*G6_11_0 - 0.019047619047619*G6_11_1 - 0.00793650793650793*G7_6_0 + 0.019047619047619*G7_7_0 - 0.0126984126984127*G7_8_0 + 0.0634920634920634*G7_9_0 + 0.00634920634920634*G7_10_0 + 0.0317460317460317*G7_11_0 + 0.666666666666666*G11_0_0_1 + 0.666666666666666*G13_0_0_1;
+    A[115] = -0.00634920634920636*G5_0_0 + 0.00476190476190476*G5_1_0 - 0.00634920634920635*G5_2_0 + 0.00634920634920634*G5_3_0 - 0.0380952380952381*G5_4_0 + 0.00634920634920634*G5_5_0 + 0.00793650793650793*G6_6_0 + 0.00793650793650793*G6_6_1 + 0.00476190476190476*G6_7_0 - 0.00793650793650794*G6_8_1 - 0.019047619047619*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.019047619047619*G6_10_0 - 0.0126984126984127*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.00634920634920636*G7_6_0 + 0.00476190476190476*G7_7_0 - 0.00634920634920635*G7_8_0 + 0.00634920634920634*G7_9_0 - 0.0380952380952381*G7_10_0 + 0.00634920634920634*G7_11_0;
+    A[116] = -0.0126984126984127*G5_0_0 + 0.019047619047619*G5_1_0 - 0.00793650793650793*G5_2_0 + 0.0317460317460317*G5_3_0 + 0.00634920634920634*G5_4_0 + 0.0634920634920635*G5_5_0 + 0.0126984126984127*G6_6_0 + 0.0126984126984127*G6_6_1 + 0.019047619047619*G6_7_0 - 0.00634920634920636*G6_8_1 - 0.00634920634920635*G6_9_0 + 0.019047619047619*G6_9_1 + 0.00634920634920635*G6_10_0 - 0.00634920634920633*G6_10_1 - 0.0317460317460317*G6_11_0 - 0.0190476190476191*G6_11_1 - 0.0126984126984127*G7_6_0 + 0.019047619047619*G7_7_0 - 0.00793650793650793*G7_8_0 + 0.0317460317460317*G7_9_0 + 0.00634920634920634*G7_10_0 + 0.0634920634920635*G7_11_0 - 0.666666666666667*G11_0_0_0 - 0.666666666666666*G11_0_0_1 - 0.666666666666667*G13_0_0_0 - 0.666666666666666*G13_0_0_1;
+    A[117] = 0.0;
+    A[118] = 0.166666666666667*G9_0;
+    A[119] = 0.0;
+    A[120] = 0.00357142857142857*G2_0_0 + 0.00357142857142857*G2_0_1 + 0.00436507936507936*G2_1_0 - 0.00357142857142857*G2_2_1 - 0.00634920634920634*G2_3_0 + 0.00158730158730159*G2_3_1 + 0.00634920634920634*G2_4_0 - 0.00793650793650793*G2_5_0 - 0.00158730158730159*G2_5_1;
+    A[121] = -0.00436507936507936*G2_0_0 - 0.00436507936507936*G2_0_1 - 0.00357142857142856*G2_1_0 - 0.00357142857142857*G2_2_1 - 0.00634920634920633*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.00634920634920633*G2_4_0 + 0.00793650793650792*G2_4_1 + 0.00793650793650793*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[122] = 0.00714285714285714*G2_0_0 + 0.00714285714285713*G2_0_1 - 0.00714285714285714*G2_1_0 + 0.0309523809523809*G2_2_1 + 0.0476190476190475*G2_3_0 + 0.0095238095238095*G2_3_1 - 0.0476190476190475*G2_4_0 - 0.038095238095238*G2_4_1 - 0.00952380952380951*G2_5_1;
+    A[123] = 0.00634920634920635*G2_0_0 + 0.00634920634920634*G2_0_1 - 0.0126984126984127*G2_1_0 + 0.019047619047619*G2_2_1 + 0.019047619047619*G2_3_0 - 0.0126984126984127*G2_3_1 - 0.019047619047619*G2_4_0 - 0.0253968253968254*G2_4_1 + 0.00634920634920634*G2_5_0 + 0.0126984126984127*G2_5_1;
+    A[124] = 0.0126984126984127*G2_0_0 + 0.0126984126984127*G2_0_1 - 0.00634920634920635*G2_1_0 + 0.019047619047619*G2_2_1 + 0.019047619047619*G2_3_0 - 0.00634920634920634*G2_3_1 - 0.019047619047619*G2_4_0 - 0.0317460317460317*G2_4_1 - 0.00634920634920635*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[125] = 0.00793650793650793*G2_0_0 + 0.00793650793650793*G2_0_1 - 0.00793650793650793*G2_1_0 + 0.00476190476190476*G2_2_1 - 0.00634920634920633*G2_3_0 - 0.019047619047619*G2_3_1 + 0.00634920634920633*G2_4_0 - 0.0126984126984127*G2_4_1 + 0.019047619047619*G2_5_1;
+    A[126] = -0.00714285714285715*G5_0_1 + 0.00436507936507936*G5_1_1 - 0.00357142857142857*G5_2_1 - 0.00793650793650793*G5_3_1 - 0.0126984126984127*G5_4_1 - 0.00634920634920635*G5_5_1 + 0.00357142857142857*G6_6_0 + 0.00357142857142857*G6_6_1 + 0.00436507936507936*G6_7_0 - 0.00357142857142857*G6_8_1 - 0.00634920634920634*G6_9_0 + 0.00158730158730159*G6_9_1 + 0.00634920634920634*G6_10_0 - 0.00793650793650793*G6_11_0 - 0.00158730158730159*G6_11_1 - 0.00714285714285715*G7_6_1 + 0.00436507936507936*G7_7_1 - 0.00357142857142857*G7_8_1 - 0.00793650793650793*G7_9_1 - 0.0126984126984127*G7_10_1 - 0.00634920634920635*G7_11_1 + 0.166666666666667*G11_0_1_0 + 0.166666666666667*G11_0_1_1 + 0.166666666666667*G13_0_1_0 + 0.166666666666667*G13_0_1_1;
+    A[127] = 0.00436507936507936*G5_0_1 - 0.00714285714285713*G5_1_1 - 0.00357142857142857*G5_2_1 - 0.0126984126984127*G5_3_1 - 0.00793650793650794*G5_4_1 - 0.00634920634920636*G5_5_1 - 0.00436507936507936*G6_6_0 - 0.00436507936507936*G6_6_1 - 0.00357142857142856*G6_7_0 - 0.00357142857142857*G6_8_1 - 0.00634920634920633*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.00634920634920633*G6_10_0 + 0.00793650793650792*G6_10_1 + 0.00793650793650793*G6_11_0 + 0.00634920634920634*G6_11_1 + 0.00436507936507936*G7_6_1 - 0.00714285714285713*G7_7_1 - 0.00357142857142857*G7_8_1 - 0.0126984126984127*G7_9_1 - 0.00793650793650794*G7_10_1 - 0.00634920634920636*G7_11_1 - 0.166666666666667*G11_0_1_0 - 0.166666666666667*G13_0_1_0;
+    A[128] = -0.00357142857142857*G5_0_1 - 0.00357142857142857*G5_1_1 + 0.0309523809523809*G5_2_1 + 0.019047619047619*G5_3_1 + 0.019047619047619*G5_4_1 + 0.00476190476190476*G5_5_1 + 0.00714285714285714*G6_6_0 + 0.00714285714285713*G6_6_1 - 0.00714285714285714*G6_7_0 + 0.0309523809523809*G6_8_1 + 0.0476190476190475*G6_9_0 + 0.0095238095238095*G6_9_1 - 0.0476190476190475*G6_10_0 - 0.038095238095238*G6_10_1 - 0.00952380952380951*G6_11_1 - 0.00357142857142857*G7_6_1 - 0.00357142857142857*G7_7_1 + 0.0309523809523809*G7_8_1 + 0.019047619047619*G7_9_1 + 0.019047619047619*G7_10_1 + 0.00476190476190476*G7_11_1 + 0.5*G11_0_1_1 + 0.5*G13_0_1_1;
+    A[129] = -0.00793650793650793*G5_0_1 - 0.0126984126984127*G5_1_1 + 0.019047619047619*G5_2_1 + 0.0634920634920634*G5_3_1 + 0.0317460317460317*G5_4_1 + 0.00634920634920636*G5_5_1 + 0.00634920634920635*G6_6_0 + 0.00634920634920634*G6_6_1 - 0.0126984126984127*G6_7_0 + 0.019047619047619*G6_8_1 + 0.019047619047619*G6_9_0 - 0.0126984126984127*G6_9_1 - 0.019047619047619*G6_10_0 - 0.0253968253968254*G6_10_1 + 0.00634920634920634*G6_11_0 + 0.0126984126984127*G6_11_1 - 0.00793650793650793*G7_6_1 - 0.0126984126984127*G7_7_1 + 0.019047619047619*G7_8_1 + 0.0634920634920634*G7_9_1 + 0.0317460317460317*G7_10_1 + 0.00634920634920636*G7_11_1 + 0.666666666666666*G11_0_1_0 + 0.666666666666666*G13_0_1_0;
+    A[130] = -0.0126984126984127*G5_0_1 - 0.00793650793650794*G5_1_1 + 0.019047619047619*G5_2_1 + 0.0317460317460317*G5_3_1 + 0.0634920634920635*G5_4_1 + 0.00634920634920636*G5_5_1 + 0.0126984126984127*G6_6_0 + 0.0126984126984127*G6_6_1 - 0.00634920634920635*G6_7_0 + 0.019047619047619*G6_8_1 + 0.019047619047619*G6_9_0 - 0.00634920634920634*G6_9_1 - 0.019047619047619*G6_10_0 - 0.0317460317460317*G6_10_1 - 0.00634920634920635*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.0126984126984127*G7_6_1 - 0.00793650793650794*G7_7_1 + 0.019047619047619*G7_8_1 + 0.0317460317460317*G7_9_1 + 0.0634920634920635*G7_10_1 + 0.00634920634920636*G7_11_1 - 0.666666666666666*G11_0_1_0 - 0.666666666666666*G11_0_1_1 - 0.666666666666666*G13_0_1_0 - 0.666666666666666*G13_0_1_1;
+    A[131] = -0.00634920634920635*G5_0_1 - 0.00634920634920636*G5_1_1 + 0.00476190476190476*G5_2_1 + 0.00634920634920636*G5_3_1 + 0.00634920634920636*G5_4_1 - 0.0380952380952381*G5_5_1 + 0.00793650793650793*G6_6_0 + 0.00793650793650793*G6_6_1 - 0.00793650793650793*G6_7_0 + 0.00476190476190476*G6_8_1 - 0.00634920634920633*G6_9_0 - 0.019047619047619*G6_9_1 + 0.00634920634920633*G6_10_0 - 0.0126984126984127*G6_10_1 + 0.019047619047619*G6_11_1 - 0.00634920634920635*G7_6_1 - 0.00634920634920636*G7_7_1 + 0.00476190476190476*G7_8_1 + 0.00634920634920636*G7_9_1 + 0.00634920634920636*G7_10_1 - 0.0380952380952381*G7_11_1;
+    A[132] = 0.0;
+    A[133] = 0.0;
+    A[134] = 0.166666666666667*G9_1;
+    A[135] = -0.00476190476190477*G2_0_0 - 0.00476190476190477*G2_0_1 - 0.00793650793650793*G2_1_0 - 0.00793650793650793*G2_2_1 - 0.019047619047619*G2_3_0 - 0.019047619047619*G2_3_1 + 0.019047619047619*G2_4_0 + 0.0126984126984127*G2_4_1 + 0.0126984126984127*G2_5_0 + 0.019047619047619*G2_5_1;
+    A[136] = 0.00634920634920634*G2_0_0 + 0.00634920634920634*G2_0_1 + 0.019047619047619*G2_1_0 - 0.0126984126984127*G2_2_1 - 0.0126984126984127*G2_3_0 + 0.019047619047619*G2_3_1 + 0.0126984126984127*G2_4_0 + 0.00634920634920636*G2_4_1 - 0.0253968253968254*G2_5_0 - 0.019047619047619*G2_5_1;
+    A[137] = 0.00634920634920635*G2_0_0 + 0.00634920634920634*G2_0_1 - 0.0126984126984127*G2_1_0 + 0.019047619047619*G2_2_1 + 0.019047619047619*G2_3_0 - 0.0126984126984127*G2_3_1 - 0.019047619047619*G2_4_0 - 0.0253968253968254*G2_4_1 + 0.00634920634920634*G2_5_0 + 0.0126984126984127*G2_5_1;
+    A[138] = 0.0380952380952381*G2_0_0 + 0.0380952380952381*G2_0_1 + 0.0634920634920634*G2_1_0 + 0.0634920634920634*G2_2_1 + 0.152380952380952*G2_3_0 + 0.152380952380952*G2_3_1 - 0.152380952380952*G2_4_0 - 0.101587301587301*G2_4_1 - 0.101587301587302*G2_5_0 - 0.152380952380952*G2_5_1;
+    A[139] = -0.00634920634920633*G2_0_0 - 0.00634920634920632*G2_0_1 + 0.00634920634920634*G2_1_0 + 0.0317460317460317*G2_2_1 + 0.0761904761904761*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.0761904761904761*G2_4_0 - 0.0253968253968254*G2_4_1 - 0.0507936507936508*G2_5_1;
+    A[140] = -0.00634920634920633*G2_0_0 - 0.00634920634920632*G2_0_1 + 0.0317460317460317*G2_1_0 + 0.00634920634920636*G2_2_1 + 0.0507936507936508*G2_3_0 + 0.0761904761904761*G2_3_1 - 0.0507936507936508*G2_4_0 - 0.0253968253968254*G2_5_0 - 0.0761904761904762*G2_5_1;
+    A[141] = 0.00952380952380951*G5_0_0 + 0.00952380952380951*G5_0_1 + 0.00158730158730159*G5_1_0 - 0.00634920634920634*G5_1_1 - 0.00634920634920634*G5_2_0 + 0.00158730158730159*G5_2_1 - 0.019047619047619*G5_3_0 - 0.019047619047619*G5_3_1 - 0.0126984126984127*G5_4_0 - 0.00634920634920634*G5_4_1 - 0.00634920634920635*G5_5_0 - 0.0126984126984127*G5_5_1 - 0.00476190476190477*G6_6_0 - 0.00476190476190477*G6_6_1 - 0.00793650793650793*G6_7_0 - 0.00793650793650793*G6_8_1 - 0.019047619047619*G6_9_0 - 0.019047619047619*G6_9_1 + 0.019047619047619*G6_10_0 + 0.0126984126984127*G6_10_1 + 0.0126984126984127*G6_11_0 + 0.019047619047619*G6_11_1 + 0.00952380952380951*G7_6_0 + 0.00952380952380951*G7_6_1 + 0.00158730158730159*G7_7_0 - 0.00634920634920634*G7_7_1 - 0.00634920634920634*G7_8_0 + 0.00158730158730159*G7_8_1 - 0.019047619047619*G7_9_0 - 0.019047619047619*G7_9_1 - 0.0126984126984127*G7_10_0 - 0.00634920634920634*G7_10_1 - 0.00634920634920635*G7_11_0 - 0.0126984126984127*G7_11_1;
+    A[142] = 0.00158730158730159*G5_0_0 - 0.00634920634920634*G5_0_1 + 0.0095238095238095*G5_1_0 + 0.0476190476190476*G5_1_1 - 0.00634920634920633*G5_2_0 - 0.00634920634920634*G5_2_1 - 0.0126984126984127*G5_3_0 + 0.019047619047619*G5_3_1 - 0.019047619047619*G5_4_0 - 0.00634920634920634*G5_4_1 - 0.00634920634920635*G5_5_0 + 0.019047619047619*G5_5_1 + 0.00634920634920634*G6_6_0 + 0.00634920634920634*G6_6_1 + 0.019047619047619*G6_7_0 - 0.0126984126984127*G6_8_1 - 0.0126984126984127*G6_9_0 + 0.019047619047619*G6_9_1 + 0.0126984126984127*G6_10_0 + 0.00634920634920636*G6_10_1 - 0.0253968253968254*G6_11_0 - 0.019047619047619*G6_11_1 + 0.00158730158730159*G7_6_0 - 0.00634920634920634*G7_6_1 + 0.0095238095238095*G7_7_0 + 0.0476190476190476*G7_7_1 - 0.00634920634920633*G7_8_0 - 0.00634920634920634*G7_8_1 - 0.0126984126984127*G7_9_0 + 0.019047619047619*G7_9_1 - 0.019047619047619*G7_10_0 - 0.00634920634920634*G7_10_1 - 0.00634920634920635*G7_11_0 + 0.019047619047619*G7_11_1 + 0.666666666666666*G11_0_1_0 + 0.666666666666666*G13_0_1_0;
+    A[143] = -0.00634920634920634*G5_0_0 + 0.00158730158730159*G5_0_1 - 0.00634920634920634*G5_1_0 - 0.00634920634920634*G5_1_1 + 0.0476190476190475*G5_2_0 + 0.0095238095238095*G5_2_1 + 0.019047619047619*G5_3_0 - 0.0126984126984127*G5_3_1 + 0.019047619047619*G5_4_0 - 0.00634920634920634*G5_4_1 - 0.00634920634920633*G5_5_0 - 0.019047619047619*G5_5_1 + 0.00634920634920635*G6_6_0 + 0.00634920634920634*G6_6_1 - 0.0126984126984127*G6_7_0 + 0.019047619047619*G6_8_1 + 0.019047619047619*G6_9_0 - 0.0126984126984127*G6_9_1 - 0.019047619047619*G6_10_0 - 0.0253968253968254*G6_10_1 + 0.00634920634920634*G6_11_0 + 0.0126984126984127*G6_11_1 - 0.00634920634920634*G7_6_0 + 0.00158730158730159*G7_6_1 - 0.00634920634920634*G7_7_0 - 0.00634920634920634*G7_7_1 + 0.0476190476190475*G7_8_0 + 0.0095238095238095*G7_8_1 + 0.019047619047619*G7_9_0 - 0.0126984126984127*G7_9_1 + 0.019047619047619*G7_10_0 - 0.00634920634920634*G7_10_1 - 0.00634920634920633*G7_11_0 - 0.019047619047619*G7_11_1 + 0.666666666666666*G11_0_0_1 + 0.666666666666666*G13_0_0_1;
+    A[144] = -0.019047619047619*G5_0_0 - 0.019047619047619*G5_0_1 - 0.0126984126984127*G5_1_0 + 0.019047619047619*G5_1_1 + 0.019047619047619*G5_2_0 - 0.0126984126984127*G5_2_1 + 0.152380952380952*G5_3_0 + 0.152380952380952*G5_3_1 + 0.0761904761904761*G5_4_0 + 0.0507936507936507*G5_4_1 + 0.0507936507936508*G5_5_0 + 0.0761904761904761*G5_5_1 + 0.0380952380952381*G6_6_0 + 0.0380952380952381*G6_6_1 + 0.0634920634920634*G6_7_0 + 0.0634920634920634*G6_8_1 + 0.152380952380952*G6_9_0 + 0.152380952380952*G6_9_1 - 0.152380952380952*G6_10_0 - 0.101587301587301*G6_10_1 - 0.101587301587302*G6_11_0 - 0.152380952380952*G6_11_1 - 0.019047619047619*G7_6_0 - 0.019047619047619*G7_6_1 - 0.0126984126984127*G7_7_0 + 0.019047619047619*G7_7_1 + 0.019047619047619*G7_8_0 - 0.0126984126984127*G7_8_1 + 0.152380952380952*G7_9_0 + 0.152380952380952*G7_9_1 + 0.0761904761904761*G7_10_0 + 0.0507936507936507*G7_10_1 + 0.0507936507936508*G7_11_0 + 0.0761904761904761*G7_11_1 + 1.33333333333333*G11_0_0_0 + 0.666666666666665*G11_0_0_1 + 0.666666666666665*G11_0_1_0 + 1.33333333333333*G11_0_1_1 + 1.33333333333333*G13_0_0_0 + 0.666666666666665*G13_0_0_1 + 0.666666666666665*G13_0_1_0 + 1.33333333333333*G13_0_1_1;
+    A[145] = -0.0126984126984127*G5_0_0 - 0.00634920634920634*G5_0_1 - 0.019047619047619*G5_1_0 - 0.00634920634920634*G5_1_1 + 0.019047619047619*G5_2_0 - 0.00634920634920634*G5_2_1 + 0.0761904761904761*G5_3_0 + 0.0507936507936507*G5_3_1 + 0.152380952380952*G5_4_0 + 0.0507936507936507*G5_4_1 + 0.0507936507936508*G5_5_0 + 0.0507936507936507*G5_5_1 - 0.00634920634920633*G6_6_0 - 0.00634920634920632*G6_6_1 + 0.00634920634920634*G6_7_0 + 0.0317460317460317*G6_8_1 + 0.0761904761904761*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.0761904761904761*G6_10_0 - 0.0253968253968254*G6_10_1 - 0.0507936507936508*G6_11_1 - 0.0126984126984127*G7_6_0 - 0.00634920634920634*G7_6_1 - 0.019047619047619*G7_7_0 - 0.00634920634920634*G7_7_1 + 0.019047619047619*G7_8_0 - 0.00634920634920634*G7_8_1 + 0.0761904761904761*G7_9_0 + 0.0507936507936507*G7_9_1 + 0.152380952380952*G7_10_0 + 0.0507936507936507*G7_10_1 + 0.0507936507936508*G7_11_0 + 0.0507936507936507*G7_11_1 - 1.33333333333333*G11_0_0_0 - 0.666666666666666*G11_0_0_1 - 0.666666666666665*G11_0_1_0 - 1.33333333333333*G13_0_0_0 - 0.666666666666666*G13_0_0_1 - 0.666666666666665*G13_0_1_0;
+    A[146] = -0.00634920634920635*G5_0_0 - 0.0126984126984127*G5_0_1 - 0.00634920634920635*G5_1_0 + 0.019047619047619*G5_1_1 - 0.00634920634920633*G5_2_0 - 0.019047619047619*G5_2_1 + 0.0507936507936508*G5_3_0 + 0.0761904761904761*G5_3_1 + 0.0507936507936507*G5_4_0 + 0.0507936507936507*G5_4_1 + 0.0507936507936507*G5_5_0 + 0.152380952380952*G5_5_1 - 0.00634920634920633*G6_6_0 - 0.00634920634920632*G6_6_1 + 0.0317460317460317*G6_7_0 + 0.00634920634920636*G6_8_1 + 0.0507936507936508*G6_9_0 + 0.0761904761904761*G6_9_1 - 0.0507936507936508*G6_10_0 - 0.0253968253968254*G6_11_0 - 0.0761904761904762*G6_11_1 - 0.00634920634920635*G7_6_0 - 0.0126984126984127*G7_6_1 - 0.00634920634920635*G7_7_0 + 0.019047619047619*G7_7_1 - 0.00634920634920633*G7_8_0 - 0.019047619047619*G7_8_1 + 0.0507936507936508*G7_9_0 + 0.0761904761904761*G7_9_1 + 0.0507936507936507*G7_10_0 + 0.0507936507936507*G7_10_1 + 0.0507936507936507*G7_11_0 + 0.152380952380952*G7_11_1 - 0.666666666666665*G11_0_0_1 - 0.666666666666667*G11_0_1_0 - 1.33333333333333*G11_0_1_1 - 0.666666666666665*G13_0_0_1 - 0.666666666666667*G13_0_1_0 - 1.33333333333333*G13_0_1_1;
+    A[147] = 0.166666666666667*G9_0 + 0.166666666666667*G9_1;
+    A[148] = 0.166666666666667*G9_0 + 0.333333333333333*G9_1;
+    A[149] = 0.333333333333333*G9_0 + 0.166666666666666*G9_1;
+    A[150] = -0.0190476190476191*G2_0_0 - 0.0190476190476191*G2_0_1 - 0.00634920634920636*G2_1_0 - 0.0126984126984127*G2_2_1 - 0.0126984126984127*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.0126984126984127*G2_4_0 + 0.0317460317460318*G2_4_1 + 0.0253968253968254*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[151] = 0.00793650793650793*G2_0_0 + 0.00793650793650793*G2_0_1 + 0.00476190476190476*G2_1_0 - 0.00793650793650794*G2_2_1 - 0.019047619047619*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.019047619047619*G2_4_0 - 0.0126984126984127*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[152] = 0.0126984126984127*G2_0_0 + 0.0126984126984127*G2_0_1 - 0.00634920634920635*G2_1_0 + 0.019047619047619*G2_2_1 + 0.019047619047619*G2_3_0 - 0.00634920634920634*G2_3_1 - 0.019047619047619*G2_4_0 - 0.0317460317460317*G2_4_1 - 0.00634920634920635*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[153] = -0.00634920634920633*G2_0_0 - 0.00634920634920632*G2_0_1 + 0.00634920634920634*G2_1_0 + 0.0317460317460317*G2_2_1 + 0.0761904761904761*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.0761904761904761*G2_4_0 - 0.0253968253968254*G2_4_1 - 0.0507936507936508*G2_5_1;
+    A[154] = -0.0634920634920635*G2_0_0 - 0.0634920634920635*G2_0_1 - 0.0380952380952381*G2_1_0 + 0.0634920634920635*G2_2_1 + 0.152380952380952*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.152380952380952*G2_4_0 + 0.101587301587302*G2_5_0 - 0.0507936507936507*G2_5_1;
+    A[155] = -0.0317460317460317*G2_0_0 - 0.0317460317460317*G2_0_1 + 0.00634920634920634*G2_1_0 + 0.00634920634920636*G2_2_1 + 0.0507936507936507*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.0507936507936507*G2_4_0 + 0.0253968253968254*G2_4_1 + 0.0253968253968254*G2_5_0 - 0.0507936507936508*G2_5_1;
+    A[156] = -0.00952380952380951*G5_0_0 + 0.0380952380952381*G5_0_1 - 0.00158730158730159*G5_1_0 - 0.00793650793650793*G5_1_1 + 0.00634920634920634*G5_2_0 + 0.019047619047619*G5_3_0 + 0.0126984126984127*G5_3_1 + 0.0126984126984127*G5_4_0 + 0.0317460317460318*G5_4_1 + 0.00634920634920635*G5_5_0 + 0.0253968253968254*G5_5_1 - 0.0190476190476191*G6_6_0 - 0.0190476190476191*G6_6_1 - 0.00634920634920636*G6_7_0 - 0.0126984126984127*G6_8_1 - 0.0126984126984127*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.0126984126984127*G6_10_0 + 0.0317460317460318*G6_10_1 + 0.0253968253968254*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.00952380952380951*G7_6_0 + 0.0380952380952381*G7_6_1 - 0.00158730158730159*G7_7_0 - 0.00793650793650793*G7_7_1 + 0.00634920634920634*G7_8_0 + 0.019047619047619*G7_9_0 + 0.0126984126984127*G7_9_1 + 0.0126984126984127*G7_10_0 + 0.0317460317460318*G7_10_1 + 0.00634920634920635*G7_11_0 + 0.0253968253968254*G7_11_1 - 0.666666666666667*G11_0_1_0 - 0.666666666666666*G11_0_1_1 - 0.666666666666667*G13_0_1_0 - 0.666666666666666*G13_0_1_1;
+    A[157] = -0.00158730158730159*G5_0_0 - 0.00793650793650793*G5_0_1 - 0.0095238095238095*G5_1_0 + 0.00634920634920633*G5_2_0 + 0.00793650793650792*G5_2_1 + 0.0126984126984127*G5_3_0 + 0.00634920634920636*G5_3_1 + 0.019047619047619*G5_4_0 + 0.00634920634920635*G5_5_0 - 0.00634920634920633*G5_5_1 + 0.00793650793650793*G6_6_0 + 0.00793650793650793*G6_6_1 + 0.00476190476190476*G6_7_0 - 0.00793650793650794*G6_8_1 - 0.019047619047619*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.019047619047619*G6_10_0 - 0.0126984126984127*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.00158730158730159*G7_6_0 - 0.00793650793650793*G7_6_1 - 0.0095238095238095*G7_7_0 + 0.00634920634920633*G7_8_0 + 0.00793650793650792*G7_8_1 + 0.0126984126984127*G7_9_0 + 0.00634920634920636*G7_9_1 + 0.019047619047619*G7_10_0 + 0.00634920634920635*G7_11_0 - 0.00634920634920633*G7_11_1;
+    A[158] = 0.00634920634920634*G5_0_0 + 0.00634920634920634*G5_1_0 + 0.00793650793650792*G5_1_1 - 0.0476190476190475*G5_2_0 - 0.038095238095238*G5_2_1 - 0.019047619047619*G5_3_0 - 0.0253968253968254*G5_3_1 - 0.019047619047619*G5_4_0 - 0.0317460317460317*G5_4_1 + 0.00634920634920633*G5_5_0 - 0.0126984126984127*G5_5_1 + 0.0126984126984127*G6_6_0 + 0.0126984126984127*G6_6_1 - 0.00634920634920635*G6_7_0 + 0.019047619047619*G6_8_1 + 0.019047619047619*G6_9_0 - 0.00634920634920634*G6_9_1 - 0.019047619047619*G6_10_0 - 0.0317460317460317*G6_10_1 - 0.00634920634920635*G6_11_0 + 0.00634920634920634*G6_11_1 + 0.00634920634920634*G7_6_0 + 0.00634920634920634*G7_7_0 + 0.00793650793650792*G7_7_1 - 0.0476190476190475*G7_8_0 - 0.038095238095238*G7_8_1 - 0.019047619047619*G7_9_0 - 0.0253968253968254*G7_9_1 - 0.019047619047619*G7_10_0 - 0.0317460317460317*G7_10_1 + 0.00634920634920633*G7_11_0 - 0.0126984126984127*G7_11_1 - 0.666666666666666*G11_0_0_1 - 0.666666666666666*G11_0_1_1 - 0.666666666666666*G13_0_0_1 - 0.666666666666666*G13_0_1_1;
+    A[159] = 0.019047619047619*G5_0_0 + 0.0126984126984127*G5_0_1 + 0.0126984126984127*G5_1_0 + 0.00634920634920636*G5_1_1 - 0.019047619047619*G5_2_0 - 0.0253968253968254*G5_2_1 - 0.152380952380952*G5_3_0 - 0.101587301587301*G5_3_1 - 0.0761904761904761*G5_4_0 - 0.0253968253968254*G5_4_1 - 0.0507936507936508*G5_5_0 - 0.00634920634920633*G6_6_0 - 0.00634920634920632*G6_6_1 + 0.00634920634920634*G6_7_0 + 0.0317460317460317*G6_8_1 + 0.0761904761904761*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.0761904761904761*G6_10_0 - 0.0253968253968254*G6_10_1 - 0.0507936507936508*G6_11_1 + 0.019047619047619*G7_6_0 + 0.0126984126984127*G7_6_1 + 0.0126984126984127*G7_7_0 + 0.00634920634920636*G7_7_1 - 0.019047619047619*G7_8_0 - 0.0253968253968254*G7_8_1 - 0.152380952380952*G7_9_0 - 0.101587301587301*G7_9_1 - 0.0761904761904761*G7_10_0 - 0.0253968253968254*G7_10_1 - 0.0507936507936508*G7_11_0 - 1.33333333333333*G11_0_0_0 - 0.666666666666665*G11_0_0_1 - 0.666666666666666*G11_0_1_0 - 1.33333333333333*G13_0_0_0 - 0.666666666666665*G13_0_0_1 - 0.666666666666666*G13_0_1_0;
+    A[160] = 0.0126984126984127*G5_0_0 + 0.0317460317460318*G5_0_1 + 0.019047619047619*G5_1_0 - 0.019047619047619*G5_2_0 - 0.0317460317460317*G5_2_1 - 0.0761904761904761*G5_3_0 - 0.0253968253968254*G5_3_1 - 0.152380952380952*G5_4_0 - 0.0507936507936508*G5_5_0 + 0.0253968253968254*G5_5_1 - 0.0634920634920635*G6_6_0 - 0.0634920634920635*G6_6_1 - 0.0380952380952381*G6_7_0 + 0.0634920634920635*G6_8_1 + 0.152380952380952*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.152380952380952*G6_10_0 + 0.101587301587302*G6_11_0 - 0.0507936507936507*G6_11_1 + 0.0126984126984127*G7_6_0 + 0.0317460317460318*G7_6_1 + 0.019047619047619*G7_7_0 - 0.019047619047619*G7_8_0 - 0.0317460317460317*G7_8_1 - 0.0761904761904761*G7_9_0 - 0.0253968253968254*G7_9_1 - 0.152380952380952*G7_10_0 - 0.0507936507936508*G7_11_0 + 0.0253968253968254*G7_11_1 + 1.33333333333333*G11_0_0_0 + 0.666666666666666*G11_0_0_1 + 0.666666666666666*G11_0_1_0 + 1.33333333333333*G11_0_1_1 + 1.33333333333333*G13_0_0_0 + 0.666666666666666*G13_0_0_1 + 0.666666666666666*G13_0_1_0 + 1.33333333333333*G13_0_1_1;
+    A[161] = 0.00634920634920635*G5_0_0 + 0.0253968253968254*G5_0_1 + 0.00634920634920635*G5_1_0 - 0.00634920634920633*G5_1_1 + 0.00634920634920633*G5_2_0 - 0.0126984126984127*G5_2_1 - 0.0507936507936508*G5_3_0 - 0.0507936507936507*G5_4_0 + 0.0253968253968254*G5_4_1 - 0.0507936507936507*G5_5_0 + 0.101587301587302*G5_5_1 - 0.0317460317460317*G6_6_0 - 0.0317460317460317*G6_6_1 + 0.00634920634920634*G6_7_0 + 0.00634920634920636*G6_8_1 + 0.0507936507936507*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.0507936507936507*G6_10_0 + 0.0253968253968254*G6_10_1 + 0.0253968253968254*G6_11_0 - 0.0507936507936508*G6_11_1 + 0.00634920634920635*G7_6_0 + 0.0253968253968254*G7_6_1 + 0.00634920634920635*G7_7_0 - 0.00634920634920633*G7_7_1 + 0.00634920634920633*G7_8_0 - 0.0126984126984127*G7_8_1 - 0.0507936507936508*G7_9_0 - 0.0507936507936507*G7_10_0 + 0.0253968253968254*G7_10_1 - 0.0507936507936507*G7_11_0 + 0.101587301587302*G7_11_1 + 0.666666666666665*G11_0_0_1 + 0.666666666666667*G11_0_1_0 + 0.666666666666665*G13_0_0_1 + 0.666666666666667*G13_0_1_0;
+    A[162] = -0.166666666666667*G9_0 + 0.166666666666667*G9_1;
+    A[163] = -0.166666666666667*G9_0;
+    A[164] = -0.333333333333333*G9_0 - 0.166666666666667*G9_1;
+    A[165] = -0.0190476190476191*G2_0_0 - 0.0190476190476191*G2_0_1 - 0.0126984126984127*G2_1_0 - 0.00634920634920635*G2_2_1 - 0.00634920634920635*G2_3_0 - 0.0126984126984127*G2_3_1 + 0.00634920634920635*G2_4_0 + 0.0253968253968254*G2_4_1 + 0.0317460317460318*G2_5_0 + 0.0126984126984127*G2_5_1;
+    A[166] = 0.0126984126984127*G2_0_0 + 0.0126984126984127*G2_0_1 + 0.019047619047619*G2_1_0 - 0.00634920634920636*G2_2_1 - 0.00634920634920635*G2_3_0 + 0.019047619047619*G2_3_1 + 0.00634920634920635*G2_4_0 - 0.00634920634920633*G2_4_1 - 0.0317460317460317*G2_5_0 - 0.0190476190476191*G2_5_1;
+    A[167] = 0.00793650793650793*G2_0_0 + 0.00793650793650793*G2_0_1 - 0.00793650793650793*G2_1_0 + 0.00476190476190476*G2_2_1 - 0.00634920634920633*G2_3_0 - 0.019047619047619*G2_3_1 + 0.00634920634920633*G2_4_0 - 0.0126984126984127*G2_4_1 + 0.019047619047619*G2_5_1;
+    A[168] = -0.00634920634920633*G2_0_0 - 0.00634920634920632*G2_0_1 + 0.0317460317460317*G2_1_0 + 0.00634920634920636*G2_2_1 + 0.0507936507936508*G2_3_0 + 0.0761904761904761*G2_3_1 - 0.0507936507936508*G2_4_0 - 0.0253968253968254*G2_5_0 - 0.0761904761904762*G2_5_1;
+    A[169] = -0.0317460317460317*G2_0_0 - 0.0317460317460317*G2_0_1 + 0.00634920634920634*G2_1_0 + 0.00634920634920636*G2_2_1 + 0.0507936507936508*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.0507936507936508*G2_4_0 + 0.0253968253968254*G2_4_1 + 0.0253968253968254*G2_5_0 - 0.0507936507936508*G2_5_1;
+    A[170] = -0.0634920634920635*G2_0_0 - 0.0634920634920635*G2_0_1 + 0.0634920634920635*G2_1_0 - 0.0380952380952381*G2_2_1 + 0.0507936507936507*G2_3_0 + 0.152380952380952*G2_3_1 - 0.0507936507936507*G2_4_0 + 0.101587301587302*G2_4_1 - 0.152380952380952*G2_5_1;
+    A[171] = 0.0380952380952381*G5_0_0 - 0.00952380952380952*G5_0_1 + 0.00634920634920635*G5_1_1 - 0.00793650793650793*G5_2_0 - 0.00158730158730159*G5_2_1 + 0.0126984126984127*G5_3_0 + 0.019047619047619*G5_3_1 + 0.0253968253968254*G5_4_0 + 0.00634920634920634*G5_4_1 + 0.0317460317460318*G5_5_0 + 0.0126984126984127*G5_5_1 - 0.0190476190476191*G6_6_0 - 0.0190476190476191*G6_6_1 - 0.0126984126984127*G6_7_0 - 0.00634920634920635*G6_8_1 - 0.00634920634920635*G6_9_0 - 0.0126984126984127*G6_9_1 + 0.00634920634920635*G6_10_0 + 0.0253968253968254*G6_10_1 + 0.0317460317460318*G6_11_0 + 0.0126984126984127*G6_11_1 + 0.0380952380952381*G7_6_0 - 0.00952380952380952*G7_6_1 + 0.00634920634920635*G7_7_1 - 0.00793650793650793*G7_8_0 - 0.00158730158730159*G7_8_1 + 0.0126984126984127*G7_9_0 + 0.019047619047619*G7_9_1 + 0.0253968253968254*G7_10_0 + 0.00634920634920634*G7_10_1 + 0.0317460317460318*G7_11_0 + 0.0126984126984127*G7_11_1 - 0.666666666666667*G11_0_0_0 - 0.666666666666667*G11_0_0_1 - 0.666666666666667*G13_0_0_0 - 0.666666666666667*G13_0_0_1;
+    A[172] = 0.00634920634920635*G5_0_1 - 0.0380952380952381*G5_1_0 - 0.0476190476190476*G5_1_1 + 0.00793650793650793*G5_2_0 + 0.00634920634920634*G5_2_1 - 0.0253968253968254*G5_3_0 - 0.019047619047619*G5_3_1 - 0.0126984126984127*G5_4_0 + 0.00634920634920634*G5_4_1 - 0.0317460317460317*G5_5_0 - 0.0190476190476191*G5_5_1 + 0.0126984126984127*G6_6_0 + 0.0126984126984127*G6_6_1 + 0.019047619047619*G6_7_0 - 0.00634920634920636*G6_8_1 - 0.00634920634920635*G6_9_0 + 0.019047619047619*G6_9_1 + 0.00634920634920635*G6_10_0 - 0.00634920634920633*G6_10_1 - 0.0317460317460317*G6_11_0 - 0.0190476190476191*G6_11_1 + 0.00634920634920635*G7_6_1 - 0.0380952380952381*G7_7_0 - 0.0476190476190476*G7_7_1 + 0.00793650793650793*G7_8_0 + 0.00634920634920634*G7_8_1 - 0.0253968253968254*G7_9_0 - 0.019047619047619*G7_9_1 - 0.0126984126984127*G7_10_0 + 0.00634920634920634*G7_10_1 - 0.0317460317460317*G7_11_0 - 0.0190476190476191*G7_11_1 - 0.666666666666667*G11_0_0_0 - 0.666666666666667*G11_0_1_0 - 0.666666666666667*G13_0_0_0 - 0.666666666666667*G13_0_1_0;
+    A[173] = -0.00793650793650793*G5_0_0 - 0.00158730158730159*G5_0_1 + 0.00793650793650793*G5_1_0 + 0.00634920634920634*G5_1_1 - 0.00952380952380951*G5_2_1 + 0.00634920634920634*G5_3_0 + 0.0126984126984127*G5_3_1 - 0.00634920634920635*G5_4_0 + 0.00634920634920634*G5_4_1 + 0.019047619047619*G5_5_1 + 0.00793650793650793*G6_6_0 + 0.00793650793650793*G6_6_1 - 0.00793650793650793*G6_7_0 + 0.00476190476190476*G6_8_1 - 0.00634920634920633*G6_9_0 - 0.019047619047619*G6_9_1 + 0.00634920634920633*G6_10_0 - 0.0126984126984127*G6_10_1 + 0.019047619047619*G6_11_1 - 0.00793650793650793*G7_6_0 - 0.00158730158730159*G7_6_1 + 0.00793650793650793*G7_7_0 + 0.00634920634920634*G7_7_1 - 0.00952380952380951*G7_8_1 + 0.00634920634920634*G7_9_0 + 0.0126984126984127*G7_9_1 - 0.00634920634920635*G7_10_0 + 0.00634920634920634*G7_10_1 + 0.019047619047619*G7_11_1;
+    A[174] = 0.0126984126984127*G5_0_0 + 0.019047619047619*G5_0_1 - 0.0253968253968254*G5_1_0 - 0.019047619047619*G5_1_1 + 0.00634920634920634*G5_2_0 + 0.0126984126984127*G5_2_1 - 0.101587301587302*G5_3_0 - 0.152380952380952*G5_3_1 - 0.0507936507936508*G5_4_1 - 0.0253968253968254*G5_5_0 - 0.0761904761904762*G5_5_1 - 0.00634920634920633*G6_6_0 - 0.00634920634920632*G6_6_1 + 0.0317460317460317*G6_7_0 + 0.00634920634920636*G6_8_1 + 0.0507936507936508*G6_9_0 + 0.0761904761904761*G6_9_1 - 0.0507936507936508*G6_10_0 - 0.0253968253968254*G6_11_0 - 0.0761904761904762*G6_11_1 + 0.0126984126984127*G7_6_0 + 0.019047619047619*G7_6_1 - 0.0253968253968254*G7_7_0 - 0.019047619047619*G7_7_1 + 0.00634920634920634*G7_8_0 + 0.0126984126984127*G7_8_1 - 0.101587301587302*G7_9_0 - 0.152380952380952*G7_9_1 - 0.0507936507936508*G7_10_1 - 0.0253968253968254*G7_11_0 - 0.0761904761904762*G7_11_1 - 0.666666666666667*G11_0_0_1 - 0.666666666666666*G11_0_1_0 - 1.33333333333333*G11_0_1_1 - 0.666666666666667*G13_0_0_1 - 0.666666666666666*G13_0_1_0 - 1.33333333333333*G13_0_1_1;
+    A[175] = 0.0253968253968254*G5_0_0 + 0.00634920634920634*G5_0_1 - 0.0126984126984127*G5_1_0 + 0.00634920634920634*G5_1_1 - 0.00634920634920635*G5_2_0 + 0.00634920634920634*G5_2_1 - 0.0507936507936508*G5_3_1 + 0.101587301587302*G5_4_0 - 0.0507936507936507*G5_4_1 + 0.0253968253968254*G5_5_0 - 0.0507936507936508*G5_5_1 - 0.0317460317460317*G6_6_0 - 0.0317460317460317*G6_6_1 + 0.00634920634920634*G6_7_0 + 0.00634920634920636*G6_8_1 + 0.0507936507936508*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.0507936507936508*G6_10_0 + 0.0253968253968254*G6_10_1 + 0.0253968253968254*G6_11_0 - 0.0507936507936508*G6_11_1 + 0.0253968253968254*G7_6_0 + 0.00634920634920634*G7_6_1 - 0.0126984126984127*G7_7_0 + 0.00634920634920634*G7_7_1 - 0.00634920634920635*G7_8_0 + 0.00634920634920634*G7_8_1 - 0.0507936507936508*G7_9_1 + 0.101587301587302*G7_10_0 - 0.0507936507936507*G7_10_1 + 0.0253968253968254*G7_11_0 - 0.0507936507936508*G7_11_1 + 0.666666666666667*G11_0_0_1 + 0.666666666666666*G11_0_1_0 + 0.666666666666667*G13_0_0_1 + 0.666666666666666*G13_0_1_0;
+    A[176] = 0.0317460317460318*G5_0_0 + 0.0126984126984127*G5_0_1 - 0.0317460317460317*G5_1_0 - 0.0190476190476191*G5_1_1 + 0.019047619047619*G5_2_1 - 0.0253968253968254*G5_3_0 - 0.0761904761904762*G5_3_1 + 0.0253968253968254*G5_4_0 - 0.0507936507936508*G5_4_1 - 0.152380952380952*G5_5_1 - 0.0634920634920635*G6_6_0 - 0.0634920634920635*G6_6_1 + 0.0634920634920635*G6_7_0 - 0.0380952380952381*G6_8_1 + 0.0507936507936507*G6_9_0 + 0.152380952380952*G6_9_1 - 0.0507936507936507*G6_10_0 + 0.101587301587302*G6_10_1 - 0.152380952380952*G6_11_1 + 0.0317460317460318*G7_6_0 + 0.0126984126984127*G7_6_1 - 0.0317460317460317*G7_7_0 - 0.0190476190476191*G7_7_1 + 0.019047619047619*G7_8_1 - 0.0253968253968254*G7_9_0 - 0.0761904761904762*G7_9_1 + 0.0253968253968254*G7_10_0 - 0.0507936507936508*G7_10_1 - 0.152380952380952*G7_11_1 + 1.33333333333333*G11_0_0_0 + 0.666666666666667*G11_0_0_1 + 0.666666666666667*G11_0_1_0 + 1.33333333333333*G11_0_1_1 + 1.33333333333333*G13_0_0_0 + 0.666666666666667*G13_0_0_1 + 0.666666666666667*G13_0_1_0 + 1.33333333333333*G13_0_1_1;
+    A[177] = 0.166666666666667*G9_0 - 0.166666666666667*G9_1;
+    A[178] = -0.166666666666667*G9_0 - 0.333333333333333*G9_1;
+    A[179] = -0.166666666666667*G9_1;
+    A[180] = 0.166666666666667*G14_0 + 0.166666666666667*G14_1;
+    A[181] = 0.0;
+    A[182] = 0.0;
+    A[183] = -0.166666666666667*G14_0 - 0.166666666666667*G14_1;
+    A[184] = 0.166666666666667*G14_0 - 0.166666666666667*G14_1;
+    A[185] = -0.166666666666667*G14_0 + 0.166666666666667*G14_1;
+    A[186] = 0.166666666666667*G15_0 + 0.166666666666667*G15_1;
+    A[187] = 0.0;
+    A[188] = 0.0;
+    A[189] = -0.166666666666667*G15_0 - 0.166666666666667*G15_1;
+    A[190] = 0.166666666666667*G15_0 - 0.166666666666667*G15_1;
+    A[191] = -0.166666666666667*G15_0 + 0.166666666666667*G15_1;
+    A[192] = 0.0;
+    A[193] = 0.0;
+    A[194] = 0.0;
+    A[195] = 0.0;
+    A[196] = -0.166666666666667*G14_0;
+    A[197] = 0.0;
+    A[198] = -0.166666666666667*G14_0 - 0.333333333333333*G14_1;
+    A[199] = 0.166666666666667*G14_0;
+    A[200] = 0.166666666666667*G14_0 + 0.333333333333333*G14_1;
+    A[201] = 0.0;
+    A[202] = -0.166666666666667*G15_0;
+    A[203] = 0.0;
+    A[204] = -0.166666666666667*G15_0 - 0.333333333333333*G15_1;
+    A[205] = 0.166666666666667*G15_0;
+    A[206] = 0.166666666666667*G15_0 + 0.333333333333333*G15_1;
+    A[207] = 0.0;
+    A[208] = 0.0;
+    A[209] = 0.0;
+    A[210] = 0.0;
+    A[211] = 0.0;
+    A[212] = -0.166666666666667*G14_1;
+    A[213] = -0.333333333333333*G14_0 - 0.166666666666666*G14_1;
+    A[214] = 0.333333333333333*G14_0 + 0.166666666666667*G14_1;
+    A[215] = 0.166666666666667*G14_1;
+    A[216] = 0.0;
+    A[217] = 0.0;
+    A[218] = -0.166666666666667*G15_1;
+    A[219] = -0.333333333333333*G15_0 - 0.166666666666666*G15_1;
+    A[220] = 0.333333333333333*G15_0 + 0.166666666666667*G15_1;
+    A[221] = 0.166666666666667*G15_1;
+    A[222] = 0.0;
+    A[223] = 0.0;
+    A[224] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivenavierstokes_exterior_facet_integral_1_0: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_exterior_facet_integral_1_0() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_exterior_facet_integral_1_0()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 4
+    // Total number of operations (multiply-add pairs):                  14
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.166666666666666*G0_;
+      A[2] = 0.166666666666667*G0_;
+      A[3] = 0.666666666666666*G0_;
+      A[4] = 0.0;
+      A[5] = 0.0;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = 0.0;
+      A[9] = 0.0;
+      A[10] = 0.0;
+      A[11] = 0.0;
+      A[12] = 0.0;
+      A[13] = 0.0;
+      A[14] = 0.0;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.166666666666667*G0_;
+      A[1] = 0.0;
+      A[2] = 0.166666666666667*G0_;
+      A[3] = 0.0;
+      A[4] = 0.666666666666666*G0_;
+      A[5] = 0.0;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = 0.0;
+      A[9] = 0.0;
+      A[10] = 0.0;
+      A[11] = 0.0;
+      A[12] = 0.0;
+      A[13] = 0.0;
+      A[14] = 0.0;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.166666666666667*G0_;
+      A[1] = 0.166666666666667*G0_;
+      A[2] = 0.0;
+      A[3] = 0.0;
+      A[4] = 0.0;
+      A[5] = 0.666666666666666*G0_;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = 0.0;
+      A[9] = 0.0;
+      A[10] = 0.0;
+      A[11] = 0.0;
+      A[12] = 0.0;
+      A[13] = 0.0;
+      A[14] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivenavierstokes_cell_integral_2_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_cell_integral_2_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_cell_integral_2_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W12[12] = {0.0254224531851035, 0.0254224531851035, 0.0254224531851035, 0.0583931378631895, 0.0583931378631895, 0.0583931378631895, 0.041425537809187, 0.041425537809187, 0.041425537809187, 0.041425537809187, 0.041425537809187, 0.041425537809187};
+    // Quadrature points on the UFC reference element: (0.873821971016996, 0.063089014491502), (0.063089014491502, 0.873821971016996), (0.063089014491502, 0.063089014491502), (0.501426509658179, 0.24928674517091), (0.24928674517091, 0.501426509658179), (0.24928674517091, 0.24928674517091), (0.636502499121399, 0.310352451033785), (0.636502499121399, 0.053145049844816), (0.310352451033785, 0.636502499121399), (0.310352451033785, 0.053145049844816), (0.053145049844816, 0.636502499121399), (0.053145049844816, 0.310352451033785)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[12][3] = \
+    {{0.0630890144915021, 0.873821971016996, 0.063089014491502},
+    {0.0630890144915021, 0.0630890144915021, 0.873821971016996},
+    {0.873821971016996, 0.0630890144915021, 0.063089014491502},
+    {0.249286745170911, 0.501426509658179, 0.24928674517091},
+    {0.249286745170911, 0.24928674517091, 0.501426509658179},
+    {0.50142650965818, 0.24928674517091, 0.24928674517091},
+    {0.053145049844816, 0.636502499121399, 0.310352451033785},
+    {0.310352451033785, 0.636502499121399, 0.053145049844816},
+    {0.0531450498448161, 0.310352451033785, 0.636502499121399},
+    {0.636502499121399, 0.310352451033785, 0.053145049844816},
+    {0.310352451033785, 0.0531450498448161, 0.636502499121399},
+    {0.636502499121399, 0.053145049844816, 0.310352451033785}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[3] = {12, 13, 14};
+    
+    static const double FE1_C0[12][6] = \
+    {{-0.0551285669924841, 0.653307703047059, -0.0551285669924841, 0.220514267969936, 0.0159208949980358, 0.220514267969936},
+    {-0.055128566992484, -0.055128566992484, 0.65330770304706, 0.220514267969936, 0.220514267969936, 0.0159208949980358},
+    {0.65330770304706, -0.0551285669924841, -0.0551285669924841, 0.0159208949980358, 0.220514267969936, 0.220514267969936},
+    {-0.124998982535098, 0.00143057951778876, -0.124998982535098, 0.499995930140389, 0.248575525271626, 0.499995930140391},
+    {-0.124998982535098, -0.124998982535098, 0.00143057951778887, 0.499995930140389, 0.499995930140391, 0.248575525271626},
+    {0.00143057951778986, -0.124998982535098, -0.124998982535098, 0.248575525271625, 0.49999593014039, 0.49999593014039},
+    {-0.0474962571988001, 0.173768363654174, -0.117715163308429, 0.790160442765823, 0.0659747859186054, 0.135307828168627},
+    {-0.117715163308429, 0.173768363654174, -0.0474962571988, 0.135307828168627, 0.0659747859186052, 0.790160442765823},
+    {-0.0474962571988, -0.117715163308429, 0.173768363654174, 0.790160442765823, 0.135307828168627, 0.0659747859186053},
+    {0.173768363654174, -0.117715163308429, -0.0474962571988, 0.0659747859186052, 0.135307828168627, 0.790160442765823},
+    {-0.117715163308429, -0.0474962571988, 0.173768363654174, 0.135307828168627, 0.790160442765823, 0.0659747859186053},
+    {0.173768363654174, -0.0474962571988001, -0.117715163308429, 0.0659747859186054, 0.790160442765823, 0.135307828168627}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc21[6] = {20, 21, 22, 23, 24, 25};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[6] = {0, 1, 2, 3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[6] = {6, 7, 8, 9, 10, 11};
+    
+    static const double FE1_C0_D01[12][5] = \
+    {{0.747643942033993, -0.747643942033992, 3.49528788406798, 0.0, -3.49528788406798},
+    {0.747643942033992, 2.49528788406798, 0.252356057966007, -3.24293182610197, -0.252356057966008},
+    {-2.49528788406798, -0.747643942033992, 0.252356057966008, 3.24293182610197, -0.252356057966008},
+    {0.00285301931635651, -0.00285301931635973, 2.00570603863272, 0.0, -2.00570603863272},
+    {0.00285301931635637, 1.00570603863272, 0.997146980683639, -1.00855905794907, -0.997146980683639},
+    {-1.00570603863272, -0.00285301931635984, 0.997146980683639, 1.00855905794908, -0.997146980683639},
+    {0.787419800620737, 0.24140980413514, 2.54600999648559, -1.02882960475588, -2.5460099964856},
+    {-0.241409804135139, -0.787419800620735, 2.5460099964856, 1.02882960475588, -2.5460099964856},
+    {0.787419800620736, 1.5460099964856, 1.24140980413514, -2.33342979710633, -1.24140980413514},
+    {-1.5460099964856, -0.787419800620735, 1.24140980413514, 2.33342979710633, -1.24140980413514},
+    {-0.24140980413514, 1.5460099964856, 0.212580199379263, -1.30460019235046, -0.212580199379263},
+    {-1.5460099964856, 0.24140980413514, 0.212580199379263, 1.30460019235046, -0.212580199379263}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[5] = {0, 2, 3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[5] = {6, 8, 9, 10, 11};
+    
+    static const double FE1_C0_D10[12][5] = \
+    {{0.747643942033992, 2.49528788406798, 0.252356057966007, -0.252356057966007, -3.24293182610198},
+    {0.747643942033993, -0.747643942033992, 3.49528788406798, -3.49528788406798, 0.0},
+    {-2.49528788406798, -0.747643942033992, 0.252356057966007, -0.252356057966007, 3.24293182610198},
+    {0.00285301931635634, 1.00570603863272, 0.997146980683639, -0.997146980683639, -1.00855905794907},
+    {0.00285301931635651, -0.00285301931636039, 2.00570603863272, -2.00570603863272, 0.0},
+    {-1.00570603863272, -0.00285301931636026, 0.997146980683639, -0.997146980683639, 1.00855905794908},
+    {0.787419800620737, 1.5460099964856, 1.24140980413514, -1.24140980413514, -2.33342979710633},
+    {-0.24140980413514, 1.5460099964856, 0.212580199379263, -0.212580199379263, -1.30460019235046},
+    {0.787419800620737, 0.24140980413514, 2.54600999648559, -2.54600999648559, -1.02882960475588},
+    {-1.5460099964856, 0.24140980413514, 0.212580199379263, -0.212580199379263, 1.30460019235046},
+    {-0.24140980413514, -0.787419800620737, 2.54600999648559, -2.54600999648559, 1.02882960475588},
+    {-1.5460099964856, -0.787419800620737, 1.24140980413514, -1.24140980413514, 2.33342979710633}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[5] = {6, 7, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[5] = {0, 1, 3, 4, 5};
+    
+    static const double FE2_C0[12][10] = \
+    {{0.0463079953908665, 0.440268993398561, 0.0463079953908666, 0.402250914961474, -0.201125457480737, -0.0145210435563255, -0.0145210435563258, -0.201125457480737, 0.402250914961474, 0.0939061879708835},
+    {0.0463079953908666, 0.0463079953908666, 0.440268993398561, -0.201125457480737, 0.402250914961474, -0.201125457480737, 0.402250914961474, -0.0145210435563257, -0.0145210435563255, 0.0939061879708831},
+    {0.440268993398561, 0.0463079953908666, 0.0463079953908666, -0.0145210435563257, -0.0145210435563258, 0.402250914961474, -0.201125457480737, 0.402250914961474, -0.201125457480737, 0.0939061879708837},
+    {0.0393516858174583, -0.0626737220523998, 0.0393516858174587, 0.283654926157929, -0.141827463078965, -0.0705102461991971, -0.0705102461991981, -0.141827463078964, 0.28365492615793, 0.841335916657949},
+    {0.0393516858174583, 0.0393516858174588, -0.0626737220523998, -0.141827463078965, 0.283654926157929, -0.141827463078964, 0.28365492615793, -0.0705102461991973, -0.070510246199198, 0.841335916657949},
+    {-0.0626737220524, 0.0393516858174588, 0.0393516858174587, -0.0705102461991977, -0.0705102461991979, 0.283654926157931, -0.141827463078965, 0.283654926157931, -0.141827463078965, 0.841335916657947},
+    {0.041110728466435, -0.0261932265993555, 0.0114358260653798, 0.808488952668146, -0.0612852214487413, -0.0623880968176902, -0.00511703591602521, -0.127951879895303, 0.138446419692862, 0.283453533784293},
+    {0.0114358260653798, -0.0261932265993554, 0.041110728466435, 0.138446419692862, -0.127951879895303, -0.00511703591602502, -0.0623880968176904, -0.0612852214487413, 0.808488952668146, 0.283453533784293},
+    {0.041110728466435, 0.0114358260653799, -0.0261932265993555, -0.0612852214487411, 0.808488952668146, -0.127951879895303, 0.138446419692862, -0.0623880968176904, -0.00511703591602494, 0.283453533784293},
+    {-0.0261932265993555, 0.0114358260653798, 0.041110728466435, -0.00511703591602513, -0.0623880968176903, 0.138446419692862, -0.127951879895303, 0.808488952668146, -0.0612852214487411, 0.283453533784293},
+    {0.0114358260653798, 0.0411107284664351, -0.0261932265993555, -0.127951879895303, 0.138446419692862, -0.0612852214487413, 0.808488952668146, -0.00511703591602512, -0.0623880968176902, 0.283453533784293},
+    {-0.0261932265993556, 0.0411107284664352, 0.0114358260653798, -0.0623880968176903, -0.00511703591602509, 0.808488952668146, -0.0612852214487412, 0.138446419692862, -0.127951879895303, 0.283453533784293}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc18[10] = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc15[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
+    
+    static const double FE2_C0_D01[12][9] = \
+    {{-0.485931890194852, 0.485931890194852, 6.37592643035589, -2.44372756077941, -0.0537330206183706, 0.0537330206183702, 2.44372756077941, -6.37592643035589, 0.0},
+    {-0.485931890194854, 3.44372756077941, -0.230167544593387, 1.20457074358531, 2.21356001618603, -5.17135568677059, 0.176434523975019, 0.230167544593388, -1.38100526756033},
+    {-3.44372756077941, 0.485931890194852, -0.230167544593386, -0.176434523975019, 5.17135568677058, -2.21356001618602, -1.20457074358531, 0.230167544593385, 1.38100526756033},
+    {0.404638308746458, -0.404638308746456, 1.13786605847598, 1.11855323498582, -0.838942397791738, 0.838942397791737, -1.11855323498583, -1.13786605847598, 1.14908083048704e-14},
+    {0.404638308746458, -0.118553234985829, -0.282847955477361, 2.25318217517853, -1.40140119046319, 1.11531611670257, -0.55609444231438, 0.282847955477361, -1.69708773286415},
+    {0.118553234985824, -0.404638308746456, -0.282847955477361, 0.556094442314373, -1.11531611670255, 1.40140119046319, -2.25318217517854, 0.282847955477361, 1.69708773286417},
+    {-0.559823901757263, -0.492870367157913, 2.60506707768882, 2.46932174262301, 0.750232850760382, 0.302461418154794, 1.95093340590807, -2.60506707768882, -4.42025514853108},
+    {0.492870367157913, 0.559823901757264, 2.60506707768882, -1.95093340590807, -0.302461418154794, -0.750232850760383, -2.46932174262301, -2.60506707768882, 4.42025514853108},
+    {-0.559823901757263, 0.740805831642527, -0.0962843375058833, 3.93699695901727, 1.749910031967, -1.93089196185226, 0.951256224701446, 0.0962843375058839, -4.88825318371872},
+    {-0.740805831642527, 0.559823901757263, -0.0962843375058788, -0.95125622470145, 1.93089196185226, -1.749910031967, -3.93699695901727, 0.0962843375058796, 4.88825318371872},
+    {0.492870367157913, 0.740805831642527, -0.201023373941063, 0.674175115836557, -2.56560608012889, 1.33192988132845, -0.206177080648913, 0.201023373941064, -0.467998035187646},
+    {-0.740805831642527, -0.492870367157913, -0.201023373941065, 0.206177080648914, -1.33192988132845, 2.56560608012889, -0.674175115836559, 0.201023373941066, 0.467998035187645}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[9] = {10, 12, 13, 14, 15, 16, 17, 18, 19};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[9] = {0, 2, 3, 4, 5, 6, 7, 8, 9};
+    
+    static const double FE2_C0_D10[12][9] = \
+    {{-0.485931890194853, 3.44372756077941, 1.20457074358531, -0.23016754459339, 0.176434523975015, 0.230167544593389, 2.21356001618602, -5.17135568677058, -1.38100526756033},
+    {-0.485931890194854, 0.485931890194854, -2.44372756077941, 6.3759264303559, 2.44372756077941, -6.3759264303559, -0.0537330206183693, 0.0537330206183686, 0.0},
+    {-3.44372756077941, 0.485931890194853, -0.176434523975017, -0.23016754459339, -1.20457074358531, 0.23016754459339, 5.17135568677058, -2.21356001618602, 1.38100526756033},
+    {0.404638308746458, -0.118553234985829, 2.25318217517853, -0.282847955477361, -0.556094442314378, 0.282847955477361, -1.40140119046319, 1.11531611670256, -1.69708773286415},
+    {0.404638308746458, -0.404638308746456, 1.11855323498582, 1.13786605847598, -1.11855323498584, -1.13786605847598, -0.838942397791738, 0.838942397791735, 1.51461450489301e-14},
+    {0.118553234985824, -0.404638308746456, 0.556094442314373, -0.282847955477361, -2.25318217517854, 0.282847955477361, -1.11531611670255, 1.40140119046318, 1.69708773286417},
+    {-0.559823901757263, 0.740805831642527, 3.93699695901727, -0.0962843375058792, 0.951256224701449, 0.0962843375058786, 1.749910031967, -1.93089196185226, -4.88825318371872},
+    {0.492870367157913, 0.740805831642526, 0.674175115836557, -0.201023373941065, -0.206177080648913, 0.201023373941065, -2.56560608012889, 1.33192988132845, -0.467998035187644},
+    {-0.559823901757263, -0.492870367157914, 2.46932174262301, 2.60506707768882, 1.95093340590806, -2.60506707768882, 0.750232850760383, 0.302461418154794, -4.42025514853107},
+    {-0.740805831642527, -0.492870367157914, 0.206177080648913, -0.201023373941065, -0.674175115836558, 0.201023373941065, -1.33192988132845, 2.56560608012889, 0.467998035187645},
+    {0.492870367157913, 0.559823901757263, -1.95093340590806, 2.60506707768882, -2.46932174262301, -2.60506707768882, -0.302461418154794, -0.750232850760383, 4.42025514853107},
+    {-0.740805831642527, 0.559823901757263, -0.951256224701447, -0.0962843375058807, -3.93699695901727, 0.0962843375058803, 1.93089196185226, -1.749910031967, 4.88825318371872}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc20[9] = {10, 11, 13, 14, 15, 16, 17, 18, 19};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[9] = {0, 1, 3, 4, 5, 6, 7, 8, 9};
+    
+    // Reset values in the element tensor.
+    A[0] = 0.0;
+    // Number of operations to compute geometry constants: 23.
+    double G[11];
+    G[0] =  - det*w[2][0]*(K[0]*K[2] + K[1]*K[3]);
+    G[1] =  - K[0]*det;
+    G[2] =  - K[1]*det;
+    G[3] =  - det*w[2][0]*(K[0]*K[0] + K[1]*K[1]);
+    G[4] =  - det*w[2][0]*(K[2]*K[2] + K[3]*K[3]);
+    G[5] =  - K[2]*det;
+    G[6] =  - K[3]*det;
+    G[7] = K[2]*det;
+    G[8] = K[1]*det;
+    G[9] = K[3]*det;
+    G[10] = K[0]*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 3024
+    for (unsigned int ip = 0; ip < 12; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      double F9 = 0.0;
+      double F10 = 0.0;
+      double F11 = 0.0;
+      double F12 = 0.0;
+      double F13 = 0.0;
+      
+      // Total number of operations to compute function values = 72
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        F9 += FE2_C0_D10[ip][r]*w[3][nzc17[r]];
+        F10 += FE2_C0_D01[ip][r]*w[3][nzc16[r]];
+        F11 += FE2_C0_D10[ip][r]*w[3][nzc20[r]];
+        F12 += FE2_C0_D01[ip][r]*w[3][nzc19[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 40
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        F4 += FE2_C0[ip][r]*w[3][nzc15[r]];
+        F7 += FE2_C0[ip][r]*w[3][nzc18[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F13 += FE0_C0[ip][r]*w[0][nzc12[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 40
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F0 += FE1_C0_D10[ip][r]*w[0][nzc8[r]];
+        F1 += FE1_C0_D01[ip][r]*w[0][nzc7[r]];
+        F5 += FE1_C0_D10[ip][r]*w[0][nzc11[r]];
+        F6 += FE1_C0_D01[ip][r]*w[0][nzc10[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 36
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F2 += FE1_C0[ip][r]*w[0][nzc6[r]];
+        F3 += FE1_C0[ip][r]*w[0][nzc9[r]];
+        F8 += FE1_C0[ip][r]*w[3][nzc21[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 57
+      double I[1];
+      // Number of operations: 57
+      I[0] = W12[ip]*(F0*(F10*G[0] + F3*F4*G[2] + F9*G[3] + G[1]*(F8 + F2*F4)) + F1*(F10*G[4] + F3*F4*G[6] + F9*G[0] + G[5]*(F8 + F2*F4)) + F13*(F10*G[7] + F11*G[8] + F12*G[9] + F9*G[10]) + F5*(F11*G[3] + F12*G[0] + F2*F7*G[1] + G[2]*(F8 + F3*F7)) + F6*(F11*G[0] + F12*G[4] + F2*F7*G[5] + G[6]*(F8 + F3*F7)));
+      
+      
+      // Number of operations for primary indices: 1
+      // Number of operations to compute entry: 1
+      A[0] += I[0];
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivenavierstokes_exterior_facet_integral_2_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_exterior_facet_integral_2_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_exterior_facet_integral_2_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates[2*facet] - vertex_coordinates[2*v0]) - dx0*(vertex_coordinates[2*facet + 1] - vertex_coordinates[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n0 = direction ? dx1 / det : -dx1 / det;
+    const double n1 = direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.277777777777778, 0.444444444444444, 0.277777777777778};
+    // Quadrature points on the UFC reference element: (0.112701665379258), (0.5), (0.887298334620742)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[3][2] = \
+    {{0.887298334620742, 0.112701665379258},
+    {0.5, 0.5},
+    {0.112701665379258, 0.887298334620742}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    static const double FE2_f0_C0[3][4] = \
+    {{0.488014084041408, 0.061985915958592, 0.747852751738001, -0.297852751738001},
+    {-0.0625, -0.0625, 0.5625, 0.5625},
+    {0.0619859159585921, 0.488014084041408, -0.297852751738001, 0.747852751738001}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[4] = {11, 12, 13, 14};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[4] = {1, 2, 3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc20[4] = {10, 11, 17, 18};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[4] = {0, 1, 7, 8};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[4] = {0, 2, 5, 6};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[4] = {10, 12, 15, 16};
+    
+    // Reset values in the element tensor.
+    A[0] = 0.0;
+    // Number of operations to compute geometry constants: 2.
+    double G[2];
+    G[0] =  - det*n0;
+    G[1] =  - det*n1;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 78
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 78
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        double F2 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc0[r]];
+        } // end loop over 'r'
+        
+        // Total number of operations to compute function values = 16
+        for (unsigned int r = 0; r < 4; r++)
+        {
+          F1 += FE2_f0_C0[ip][r]*w[3][nzc13[r]];
+          F2 += FE2_f0_C0[ip][r]*w[3][nzc14[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 5
+        double I[1];
+        // Number of operations: 5
+        I[0] = F0*W3[ip]*(F1*G[0] + F2*G[1]);
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 78
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 78
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        double F2 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc1[r]];
+        } // end loop over 'r'
+        
+        // Total number of operations to compute function values = 16
+        for (unsigned int r = 0; r < 4; r++)
+        {
+          F1 += FE2_f0_C0[ip][r]*w[3][nzc16[r]];
+          F2 += FE2_f0_C0[ip][r]*w[3][nzc17[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 5
+        double I[1];
+        // Number of operations: 5
+        I[0] = F0*W3[ip]*(F1*G[0] + F2*G[1]);
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 78
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 78
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        double F2 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc2[r]];
+        } // end loop over 'r'
+        
+        // Total number of operations to compute function values = 16
+        for (unsigned int r = 0; r < 4; r++)
+        {
+          F1 += FE2_f0_C0[ip][r]*w[3][nzc19[r]];
+          F2 += FE2_f0_C0[ip][r]*w[3][nzc20[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 5
+        double I[1];
+        // Number of operations: 5
+        I[0] = F0*W3[ip]*(F1*G[0] + F2*G[1]);
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivenavierstokes_cell_integral_3_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_cell_integral_3_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_cell_integral_3_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    1
+    // Number of operations (multiply-add pairs) for tensor contraction: 34
+    // Total number of operations (multiply-add pairs):                  38
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00357142857142857*G0_0;
+    A[1] = 0.0;
+    A[2] = 0.0;
+    A[3] = -0.00714285714285713*G0_0;
+    A[4] = -0.00357142857142856*G0_0;
+    A[5] = -0.00357142857142856*G0_0;
+    A[6] = 0.0;
+    A[7] = 0.0;
+    A[8] = 0.0;
+    A[9] = 0.0;
+    A[10] = 0.0;
+    A[11] = 0.0;
+    A[12] = 0.0;
+    A[13] = 0.0;
+    A[14] = 0.0;
+    A[15] = 0.0;
+    A[16] = 0.00357142857142857*G0_0;
+    A[17] = 0.0;
+    A[18] = -0.00357142857142857*G0_0;
+    A[19] = -0.00714285714285713*G0_0;
+    A[20] = -0.00357142857142857*G0_0;
+    A[21] = 0.0;
+    A[22] = 0.0;
+    A[23] = 0.0;
+    A[24] = 0.0;
+    A[25] = 0.0;
+    A[26] = 0.0;
+    A[27] = 0.0;
+    A[28] = 0.0;
+    A[29] = 0.0;
+    A[30] = 0.0;
+    A[31] = 0.0;
+    A[32] = 0.00357142857142856*G0_0;
+    A[33] = -0.00357142857142857*G0_0;
+    A[34] = -0.00357142857142857*G0_0;
+    A[35] = -0.00714285714285714*G0_0;
+    A[36] = 0.0;
+    A[37] = 0.0;
+    A[38] = 0.0;
+    A[39] = 0.0;
+    A[40] = 0.0;
+    A[41] = 0.0;
+    A[42] = 0.0;
+    A[43] = 0.0;
+    A[44] = 0.0;
+    A[45] = -0.00714285714285713*G0_0;
+    A[46] = -0.00357142857142857*G0_0;
+    A[47] = -0.00357142857142857*G0_0;
+    A[48] = 0.0428571428571428*G0_0;
+    A[49] = 0.0285714285714285*G0_0;
+    A[50] = 0.0285714285714285*G0_0;
+    A[51] = 0.0;
+    A[52] = 0.0;
+    A[53] = 0.0;
+    A[54] = 0.0;
+    A[55] = 0.0;
+    A[56] = 0.0;
+    A[57] = 0.0;
+    A[58] = 0.0;
+    A[59] = 0.0;
+    A[60] = -0.00357142857142856*G0_0;
+    A[61] = -0.00714285714285713*G0_0;
+    A[62] = -0.00357142857142856*G0_0;
+    A[63] = 0.0285714285714285*G0_0;
+    A[64] = 0.0428571428571428*G0_0;
+    A[65] = 0.0285714285714285*G0_0;
+    A[66] = 0.0;
+    A[67] = 0.0;
+    A[68] = 0.0;
+    A[69] = 0.0;
+    A[70] = 0.0;
+    A[71] = 0.0;
+    A[72] = 0.0;
+    A[73] = 0.0;
+    A[74] = 0.0;
+    A[75] = -0.00357142857142856*G0_0;
+    A[76] = -0.00357142857142857*G0_0;
+    A[77] = -0.00714285714285713*G0_0;
+    A[78] = 0.0285714285714285*G0_0;
+    A[79] = 0.0285714285714285*G0_0;
+    A[80] = 0.0428571428571428*G0_0;
+    A[81] = 0.0;
+    A[82] = 0.0;
+    A[83] = 0.0;
+    A[84] = 0.0;
+    A[85] = 0.0;
+    A[86] = 0.0;
+    A[87] = 0.0;
+    A[88] = 0.0;
+    A[89] = 0.0;
+    A[90] = 0.0;
+    A[91] = 0.0;
+    A[92] = 0.0;
+    A[93] = 0.0;
+    A[94] = 0.0;
+    A[95] = 0.0;
+    A[96] = 0.00357142857142857*G0_0;
+    A[97] = 0.0;
+    A[98] = 0.0;
+    A[99] = -0.00714285714285713*G0_0;
+    A[100] = -0.00357142857142856*G0_0;
+    A[101] = -0.00357142857142856*G0_0;
+    A[102] = 0.0;
+    A[103] = 0.0;
+    A[104] = 0.0;
+    A[105] = 0.0;
+    A[106] = 0.0;
+    A[107] = 0.0;
+    A[108] = 0.0;
+    A[109] = 0.0;
+    A[110] = 0.0;
+    A[111] = 0.0;
+    A[112] = 0.00357142857142857*G0_0;
+    A[113] = 0.0;
+    A[114] = -0.00357142857142857*G0_0;
+    A[115] = -0.00714285714285713*G0_0;
+    A[116] = -0.00357142857142857*G0_0;
+    A[117] = 0.0;
+    A[118] = 0.0;
+    A[119] = 0.0;
+    A[120] = 0.0;
+    A[121] = 0.0;
+    A[122] = 0.0;
+    A[123] = 0.0;
+    A[124] = 0.0;
+    A[125] = 0.0;
+    A[126] = 0.0;
+    A[127] = 0.0;
+    A[128] = 0.00357142857142856*G0_0;
+    A[129] = -0.00357142857142857*G0_0;
+    A[130] = -0.00357142857142857*G0_0;
+    A[131] = -0.00714285714285714*G0_0;
+    A[132] = 0.0;
+    A[133] = 0.0;
+    A[134] = 0.0;
+    A[135] = 0.0;
+    A[136] = 0.0;
+    A[137] = 0.0;
+    A[138] = 0.0;
+    A[139] = 0.0;
+    A[140] = 0.0;
+    A[141] = -0.00714285714285713*G0_0;
+    A[142] = -0.00357142857142857*G0_0;
+    A[143] = -0.00357142857142857*G0_0;
+    A[144] = 0.0428571428571428*G0_0;
+    A[145] = 0.0285714285714285*G0_0;
+    A[146] = 0.0285714285714285*G0_0;
+    A[147] = 0.0;
+    A[148] = 0.0;
+    A[149] = 0.0;
+    A[150] = 0.0;
+    A[151] = 0.0;
+    A[152] = 0.0;
+    A[153] = 0.0;
+    A[154] = 0.0;
+    A[155] = 0.0;
+    A[156] = -0.00357142857142856*G0_0;
+    A[157] = -0.00714285714285713*G0_0;
+    A[158] = -0.00357142857142856*G0_0;
+    A[159] = 0.0285714285714285*G0_0;
+    A[160] = 0.0428571428571428*G0_0;
+    A[161] = 0.0285714285714285*G0_0;
+    A[162] = 0.0;
+    A[163] = 0.0;
+    A[164] = 0.0;
+    A[165] = 0.0;
+    A[166] = 0.0;
+    A[167] = 0.0;
+    A[168] = 0.0;
+    A[169] = 0.0;
+    A[170] = 0.0;
+    A[171] = -0.00357142857142856*G0_0;
+    A[172] = -0.00357142857142857*G0_0;
+    A[173] = -0.00714285714285713*G0_0;
+    A[174] = 0.0285714285714285*G0_0;
+    A[175] = 0.0285714285714285*G0_0;
+    A[176] = 0.0428571428571428*G0_0;
+    A[177] = 0.0;
+    A[178] = 0.0;
+    A[179] = 0.0;
+    A[180] = 0.0;
+    A[181] = 0.0;
+    A[182] = 0.0;
+    A[183] = 0.0;
+    A[184] = 0.0;
+    A[185] = 0.0;
+    A[186] = 0.0;
+    A[187] = 0.0;
+    A[188] = 0.0;
+    A[189] = 0.0;
+    A[190] = 0.0;
+    A[191] = 0.0;
+    A[192] = 0.0321428571428571*G0_0;
+    A[193] = 0.0214285714285714*G0_0;
+    A[194] = 0.0214285714285714*G0_0;
+    A[195] = 0.0;
+    A[196] = 0.0;
+    A[197] = 0.0;
+    A[198] = 0.0;
+    A[199] = 0.0;
+    A[200] = 0.0;
+    A[201] = 0.0;
+    A[202] = 0.0;
+    A[203] = 0.0;
+    A[204] = 0.0;
+    A[205] = 0.0;
+    A[206] = 0.0;
+    A[207] = 0.0214285714285714*G0_0;
+    A[208] = 0.0321428571428571*G0_0;
+    A[209] = 0.0214285714285714*G0_0;
+    A[210] = 0.0;
+    A[211] = 0.0;
+    A[212] = 0.0;
+    A[213] = 0.0;
+    A[214] = 0.0;
+    A[215] = 0.0;
+    A[216] = 0.0;
+    A[217] = 0.0;
+    A[218] = 0.0;
+    A[219] = 0.0;
+    A[220] = 0.0;
+    A[221] = 0.0;
+    A[222] = 0.0214285714285714*G0_0;
+    A[223] = 0.0214285714285714*G0_0;
+    A[224] = 0.0321428571428571*G0_0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivenavierstokes_cell_integral_4_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_cell_integral_4_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_cell_integral_4_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W25[25] = {0.0114650803515925, 0.0198040831320473, 0.0173415064313656, 0.0087554991821638, 0.00186555216687783, 0.0231612219294983, 0.0400072873861603, 0.0350325045033716, 0.0176874521104834, 0.0037687016953276, 0.0275289856644697, 0.0475518970579538, 0.0416389652151948, 0.021022967487322, 0.00447940679728133, 0.0231612219294983, 0.0400072873861603, 0.0350325045033716, 0.0176874521104834, 0.0037687016953276, 0.0114650803515925, 0.0198040831320473, 0.0173415064313656, 0.0087554991821638, 0.00186555216687783};
+    // Quadrature points on the UFC reference element: (0.0450425935698037, 0.0398098570514687), (0.0376212523451112, 0.198013417873608), (0.0263646449444709, 0.437974810247386), (0.0142857943955714, 0.695464273353636), (0.00462228846504642, 0.901464914201174), (0.221578609552379, 0.0398098570514687), (0.185070710267389, 0.198013417873608), (0.129695936782254, 0.437974810247386), (0.0702762920082817, 0.695464273353636), (0.022738483063764, 0.901464914201174), (0.480095071474266, 0.0398098570514687), (0.400993291063196, 0.198013417873608), (0.281012594876307, 0.437974810247386), (0.152267863323182, 0.695464273353636), (0.0492675428994132, 0.901464914201174), (0.738611533396152, 0.0398098570514687), (0.616915871859002, 0.198013417873608), (0.43232925297036, 0.437974810247386), (0.234259434638082, 0.695464273353636), (0.0757966027350624, 0.901464914201174), (0.915147549378728, 0.0398098570514687), (0.764365329781281, 0.198013417873608), (0.535660544808143, 0.437974810247386), (0.290249932250792, 0.695464273353636), (0.09391279733378, 0.901464914201174)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[25][1] = \
+    {{0.0443066477812843},
+    {0.153742030524499},
+    {0.167003080840912},
+    {0.0778601276421668},
+    {0.0105656060730507},
+    {0.175913147778989},
+    {0.610410534080673},
+    {0.663061619658879},
+    {0.309132394931335},
+    {0.0419492133929458},
+    {0.247747270005307},
+    {0.859671635180817},
+    {0.933822788062264},
+    {0.435366587895191},
+    {0.0590791718992464},
+    {0.175913147778989},
+    {0.610410534080673},
+    {0.663061619658879},
+    {0.309132394931336},
+    {0.0419492133929458},
+    {0.0443066477812842},
+    {0.153742030524499},
+    {0.167003080840912},
+    {0.0778601276421677},
+    {0.0105656060730508}};
+    
+    static const double FE0_D01[25][1] = \
+    {{1.06454195761932},
+    {0.575285441238399},
+    {0.0695371421115221},
+    {-0.156297836604569},
+    {-0.100783948537443},
+    {4.18066660252782},
+    {2.09321751667939},
+    {-0.0197695576719489},
+    {-0.875117679872582},
+    {-0.506910012747091},
+    {5.70722656015913},
+    {2.19762631898684},
+    {-1.19092570485194},
+    {-2.23320663144433},
+    {-1.13361310483317},
+    {3.62492541922149},
+    {-0.215583167171879},
+    {-3.59850532693656},
+    {-3.95431694241714},
+    {-1.79832091177048},
+    {0.129295602035074},
+    {-3.31015168346013},
+    {-5.95304978565769},
+    {-5.33822419894345},
+    {-2.27407499327841}};
+    
+    static const double FE0_D10[25][1] = \
+    {{0.93524635558425},
+    {3.88543712469853},
+    {6.02258692776922},
+    {5.18192636233889},
+    {2.17329104474096},
+    {0.555741183306335},
+    {2.30880068385127},
+    {3.57873576926462},
+    {3.07919926254456},
+    {1.29141089902339},
+    {0.0},
+    {0.0},
+    {0.0},
+    {0.0},
+    {0.0},
+    {-0.555741183306332},
+    {-2.30880068385127},
+    {-3.57873576926461},
+    {-3.07919926254455},
+    {-1.29141089902339},
+    {-0.935246355584244},
+    {-3.88543712469853},
+    {-6.02258692776921},
+    {-5.18192636233888},
+    {-2.17329104474096}};
+    
+    static const double FE1_C0[25][3] = \
+    {{0.915147549378728, 0.0450425935698037, 0.0398098570514687},
+    {0.764365329781281, 0.0376212523451112, 0.198013417873608},
+    {0.535660544808143, 0.026364644944471, 0.437974810247386},
+    {0.290249932250793, 0.0142857943955714, 0.695464273353636},
+    {0.0939127973337801, 0.00462228846504648, 0.901464914201173},
+    {0.738611533396152, 0.221578609552379, 0.0398098570514687},
+    {0.616915871859002, 0.185070710267389, 0.198013417873608},
+    {0.43232925297036, 0.129695936782254, 0.437974810247386},
+    {0.234259434638082, 0.0702762920082818, 0.695464273353636},
+    {0.0757966027350624, 0.0227384830637641, 0.901464914201173},
+    {0.480095071474266, 0.480095071474266, 0.0398098570514687},
+    {0.400993291063196, 0.400993291063196, 0.198013417873608},
+    {0.281012594876307, 0.281012594876307, 0.437974810247386},
+    {0.152267863323182, 0.152267863323182, 0.695464273353636},
+    {0.0492675428994133, 0.0492675428994133, 0.901464914201173},
+    {0.221578609552379, 0.738611533396152, 0.0398098570514687},
+    {0.185070710267389, 0.616915871859002, 0.198013417873608},
+    {0.129695936782254, 0.43232925297036, 0.437974810247386},
+    {0.0702762920082818, 0.234259434638082, 0.695464273353636},
+    {0.0227384830637641, 0.0757966027350624, 0.901464914201173},
+    {0.0450425935698037, 0.915147549378728, 0.0398098570514687},
+    {0.0376212523451112, 0.764365329781281, 0.198013417873608},
+    {0.026364644944471, 0.535660544808143, 0.437974810247386},
+    {0.0142857943955715, 0.290249932250793, 0.695464273353636},
+    {0.00462228846504648, 0.0939127973337801, 0.901464914201173}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[3] = {12, 13, 14};
+    
+    static const double FE2_C0[25][6] = \
+    {{0.759842524889054, -0.0409849230988147, -0.036640207614552, 0.00717255684496523, 0.145727572487076, 0.164882476492272},
+    {0.404143384962011, -0.0347905350890822, -0.119594790557632, 0.0297980510461639, 0.605418365816316, 0.115025523822223},
+    {0.0382038937201701, -0.0249744559383748, -0.0543309414249183, 0.0461882014671775, 0.938423301877431, 0.0564900002985142},
+    {-0.121759885907613, -0.0138776265525463, 0.271876837668966, 0.0397410384743819, 0.807433832894958, 0.0165858034218534},
+    {-0.0762735703276687, -0.00457955736373819, 0.723813068870285, 0.0166673234982246, 0.338636367163553, 0.00173636815934466},
+    {0.352482461135478, -0.123384449130048, -0.036640207614552, 0.0352840510877737, 0.117616078244268, 0.65464206627708},
+    {0.144254514044104, -0.116568374669637, -0.119594790557632, 0.146585935553368, 0.488630481309112, 0.456692234320685},
+    {-0.0585120870225411, -0.0960538647466012, -0.0543309414249183, 0.227214213208259, 0.75739729013635, 0.224285389849452},
+    {-0.124504469204174, -0.0603987775714151, 0.271876837668966, 0.19549860142211, 0.65167626994723, 0.0658515377372834},
+    {-0.0643063527627087, -0.0217044058396818, 0.723813068870285, 0.0819917787365634, 0.273311911925214, 0.00689399907032823},
+    {-0.0191125161665052, -0.0191125161665052, -0.036640207614552, 0.0764500646660207, 0.0764500646660207, 0.921965110615521},
+    {-0.07940205210781, -0.07940205210781, -0.119594790557632, 0.31760820843124, 0.31760820843124, 0.643182477910772},
+    {-0.123076437918076, -0.123076437918076, -0.0543309414249183, 0.492305751672304, 0.492305751672304, 0.315872313916462},
+    {-0.105896858921167, -0.105896858921168, 0.271876837668966, 0.42358743568467, 0.42358743568467, 0.0927420088040289},
+    {-0.0444129613327222, -0.0444129613327222, 0.723813068870285, 0.177651845330889, 0.177651845330889, 0.00970916313338205},
+    {-0.123384449130048, 0.352482461135478, -0.036640207614552, 0.117616078244268, 0.0352840510877737, 0.65464206627708},
+    {-0.116568374669637, 0.144254514044104, -0.119594790557632, 0.488630481309112, 0.146585935553368, 0.456692234320686},
+    {-0.0960538647466012, -0.0585120870225412, -0.0543309414249183, 0.75739729013635, 0.227214213208259, 0.224285389849452},
+    {-0.0603987775714152, -0.124504469204174, 0.271876837668966, 0.651676269947229, 0.19549860142211, 0.0658515377372834},
+    {-0.0217044058396818, -0.0643063527627086, 0.723813068870285, 0.273311911925214, 0.0819917787365634, 0.00689399907032823},
+    {-0.0409849230988147, 0.759842524889054, -0.036640207614552, 0.145727572487076, 0.00717255684496515, 0.164882476492272},
+    {-0.0347905350890822, 0.404143384962011, -0.119594790557632, 0.605418365816316, 0.0297980510461639, 0.115025523822223},
+    {-0.0249744559383749, 0.0382038937201699, -0.0543309414249183, 0.938423301877431, 0.0461882014671776, 0.0564900002985143},
+    {-0.0138776265525464, -0.121759885907613, 0.271876837668966, 0.807433832894958, 0.0397410384743823, 0.0165858034218535},
+    {-0.00457955736373816, -0.0762735703276687, 0.723813068870285, 0.338636367163553, 0.0166673234982245, 0.00173636815934466}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[6] = {6, 7, 8, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[6] = {0, 1, 2, 3, 4, 5};
+    
+    static const double FE2_C0_D01[25][5] = \
+    {{-2.66059019751491, -0.840760571794125, 0.180170374279214, 3.50135076930903, -0.180170374279214},
+    {-2.05746131912512, -0.207946328505567, 0.150485009380444, 2.26540764763069, -0.150485009380444},
+    {-1.14264217923257, 0.751899240989544, 0.105458579777883, 0.390742938243027, -0.105458579777883},
+    {-0.16099972900317, 1.78185709341454, 0.0571431775822844, -1.62085736441137, -0.0571431775822845},
+    {0.62434881066488, 2.60585965680469, 0.0184891538601843, -3.23020846746957, -0.0184891538601851},
+    {-1.95444613358461, -0.840760571794125, 0.886314438209516, 2.79520670537873, -0.886314438209517},
+    {-1.46766348743601, -0.207946328505567, 0.740282841069557, 1.67560981594158, -0.740282841069557},
+    {-0.729317011881439, 0.751899240989545, 0.518783747129015, -0.0225822291081059, -0.518783747129016},
+    {0.0629622614476711, 1.78185709341454, 0.281105168033126, -1.84481935486221, -0.281105168033126},
+    {0.696813589059751, 2.60585965680469, 0.0909539322550552, -3.30267324586444, -0.0909539322550557},
+    {-0.920380285897062, -0.840760571794124, 1.92038028589706, 1.76114085769119, -1.92038028589706},
+    {-0.603973164252783, -0.207946328505567, 1.60397316425278, 0.81191949275835, -1.60397316425278},
+    {-0.124050379505227, 0.751899240989545, 1.12405037950523, -0.627848861484317, -1.12405037950523},
+    {0.390928546707272, 1.78185709341454, 0.609071453292727, -2.17278564012182, -0.609071453292727},
+    {0.802929828402347, 2.60585965680469, 0.197070171597652, -3.40878948520704, -0.197070171597652},
+    {0.113685561790484, -0.840760571794124, 2.95444613358461, 0.727075010003642, -2.95444613358461},
+    {0.259717158930443, -0.207946328505567, 2.46766348743601, -0.051770830424875, -2.46766348743601},
+    {0.481216252870984, 0.751899240989545, 1.72931701188144, -1.23311549386053, -1.72931701188144},
+    {0.718894831966873, 1.78185709341454, 0.937037738552328, -2.50075192538142, -0.937037738552328},
+    {0.909046067744944, 2.60585965680469, 0.303186410940248, -3.51490572454964, -0.303186410940249},
+    {0.819829625720786, -0.840760571794125, 3.66059019751491, 0.0209309460733402, -3.66059019751491},
+    {0.849514990619556, -0.207946328505567, 3.05746131912512, -0.641568662113988, -3.05746131912512},
+    {0.894541420222117, 0.751899240989544, 2.14264217923257, -1.64644066121166, -2.14264217923257},
+    {0.942856822417715, 1.78185709341454, 1.16099972900317, -2.72471391583226, -1.16099972900317},
+    {0.981510846139814, 2.60585965680469, 0.375651189335119, -3.58737050294451, -0.37565118933512}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[5] = {6, 8, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE2_C0_D10[25][5] = \
+    {{-2.66059019751491, -0.819829625720786, 0.159239428205873, -0.159239428205873, 3.4804198232357},
+    {-2.05746131912512, -0.849514990619556, 0.792053671494432, -0.792053671494432, 2.90697630974468},
+    {-1.14264217923257, -0.894541420222117, 1.75189924098954, -1.75189924098954, 2.03718359945469},
+    {-0.16099972900317, -0.942856822417715, 2.78185709341454, -2.78185709341454, 1.10385655142088},
+    {0.624348810664881, -0.981510846139815, 3.60585965680469, -3.60585965680469, 0.357162035474933},
+    {-1.95444613358461, -0.113685561790483, 0.159239428205874, -0.159239428205874, 2.06813169537509},
+    {-1.46766348743601, -0.259717158930443, 0.792053671494432, -0.792053671494432, 1.72738064636645},
+    {-0.729317011881439, -0.481216252870984, 1.75189924098954, -1.75189924098954, 1.21053326475242},
+    {0.0629622614476715, -0.718894831966874, 2.78185709341454, -2.78185709341454, 0.655932570519202},
+    {0.696813589059751, -0.909046067744945, 3.60585965680469, -3.60585965680469, 0.212232478685192},
+    {-0.920380285897062, 0.920380285897063, 0.159239428205874, -0.159239428205874, 0.0},
+    {-0.603973164252783, 0.603973164252784, 0.792053671494432, -0.792053671494432, 0.0},
+    {-0.124050379505227, 0.124050379505227, 1.75189924098954, -1.75189924098954, 0.0},
+    {0.390928546707273, -0.390928546707273, 2.78185709341454, -2.78185709341454, 0.0},
+    {0.802929828402348, -0.802929828402348, 3.60585965680469, -3.60585965680469, 0.0},
+    {0.113685561790483, 1.95444613358461, 0.159239428205874, -0.159239428205874, -2.06813169537509},
+    {0.259717158930443, 1.46766348743601, 0.792053671494432, -0.792053671494432, -1.72738064636645},
+    {0.481216252870984, 0.729317011881438, 1.75189924098954, -1.75189924098954, -1.21053326475242},
+    {0.718894831966874, -0.0629622614476716, 2.78185709341454, -2.78185709341454, -0.655932570519203},
+    {0.909046067744945, -0.696813589059751, 3.60585965680469, -3.60585965680469, -0.212232478685195},
+    {0.819829625720785, 2.66059019751491, 0.159239428205873, -0.159239428205873, -3.48041982323569},
+    {0.849514990619556, 2.05746131912512, 0.792053671494432, -0.792053671494432, -2.90697630974468},
+    {0.894541420222117, 1.14264217923257, 1.75189924098954, -1.75189924098954, -2.03718359945469},
+    {0.942856822417715, 0.16099972900317, 2.78185709341454, -2.78185709341454, -1.10385655142089},
+    {0.981510846139816, -0.62434881066488, 3.60585965680469, -3.60585965680469, -0.357162035474936}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[5] = {6, 7, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[5] = {0, 1, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 23.
+    double G[11];
+    G[0] =  - K[0]*det;
+    G[1] =  - K[2]*det;
+    G[2] =  - K[1]*det;
+    G[3] =  - K[3]*det;
+    G[4] =  - det*w[2][0]*(K[0]*K[2] + K[1]*K[3]);
+    G[5] =  - det*w[2][0]*(K[2]*K[2] + K[3]*K[3]);
+    G[6] = K[3]*det;
+    G[7] =  - det*w[2][0]*(K[0]*K[0] + K[1]*K[1]);
+    G[8] = K[1]*det;
+    G[9] = K[2]*det;
+    G[10] = K[0]*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 5825
+    for (unsigned int ip = 0; ip < 25; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      double F9 = 0.0;
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        F4 += FE0[ip][0]*w[3][0];
+        F7 += FE0_D10[ip][0]*w[3][0];
+        F8 += FE0_D01[ip][0]*w[3][0];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F9 += FE1_C0[ip][r]*w[0][nzc12[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 40
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F0 += FE2_C0_D10[ip][r]*w[0][nzc8[r]];
+        F1 += FE2_C0_D01[ip][r]*w[0][nzc7[r]];
+        F5 += FE2_C0_D10[ip][r]*w[0][nzc11[r]];
+        F6 += FE2_C0_D01[ip][r]*w[0][nzc10[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 24
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F2 += FE2_C0[ip][r]*w[0][nzc6[r]];
+        F3 += FE2_C0[ip][r]*w[0][nzc9[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 87
+      double I[7];
+      // Number of operations: 9
+      I[0] = F4*W25[ip]*(F0*G[0] + F1*G[1] + F5*G[2] + F6*G[3]);
+      
+      // Number of operations: 7
+      I[1] = F4*W25[ip]*(F5*G[4] + F6*G[5] + F9*G[6]);
+      
+      // Number of operations: 7
+      I[2] = F4*W25[ip]*(F5*G[7] + F6*G[4] + F9*G[8]);
+      
+      // Number of operations: 7
+      I[3] = F4*W25[ip]*(F0*G[4] + F1*G[5] + F9*G[9]);
+      
+      // Number of operations: 7
+      I[4] = F4*W25[ip]*(F0*G[7] + F1*G[4] + F9*G[10]);
+      
+      // Number of operations: 25
+      I[5] = W25[ip]*(F4*(F2*(F0*G[0] + F1*G[1]) + F3*(F0*G[2] + F1*G[3])) + F7*(F0*G[7] + F1*G[4] + F9*G[10]) + F8*(F0*G[4] + F1*G[5] + F9*G[9]));
+      
+      // Number of operations: 25
+      I[6] = W25[ip]*(F5*(F4*(F2*G[0] + F3*G[2]) + F7*G[7] + F8*G[4]) + F6*(F4*(F2*G[1] + F3*G[3]) + F7*G[4] + F8*G[5]) + F9*(F7*G[8] + F8*G[6]));
+      
+      
+      // Number of operations for primary indices: 6
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc12[j]] += FE1_C0[ip][j]*I[0];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 40
+      for (unsigned int j = 0; j < 5; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc10[j]] += FE2_C0_D01[ip][j]*I[1];
+        // Number of operations to compute entry: 2
+        A[nzc11[j]] += FE2_C0_D10[ip][j]*I[2];
+        // Number of operations to compute entry: 2
+        A[nzc7[j]] += FE2_C0_D01[ip][j]*I[3];
+        // Number of operations to compute entry: 2
+        A[nzc8[j]] += FE2_C0_D10[ip][j]*I[4];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 24
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc6[j]] += FE2_C0[ip][j]*I[5];
+        // Number of operations to compute entry: 2
+        A[nzc9[j]] += FE2_C0[ip][j]*I[6];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivenavierstokes_exterior_facet_integral_4_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_exterior_facet_integral_4_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_exterior_facet_integral_4_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    
+    
+    // Compute facet normals from the facet scale factor constants
+    
+    // Facet area
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    // Values of basis functions at quadrature points.
+    static const double FE1_f0[4][2] = \
+    {{0.930568155797026, 0.0694318442029737},
+    {0.669990521792428, 0.330009478207572},
+    {0.330009478207572, 0.669990521792428},
+    {0.0694318442029738, 0.930568155797026}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 16
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 16
+      for (unsigned int ip = 0; ip < 4; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE1_f0[ip][r]*w[1][nzc0[r]];
+        } // end loop over 'r'
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 16
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 16
+      for (unsigned int ip = 0; ip < 4; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE1_f0[ip][r]*w[1][nzc1[r]];
+        } // end loop over 'r'
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 16
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 16
+      for (unsigned int ip = 0; ip < 4; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE1_f0[ip][r]*w[1][nzc2[r]];
+        } // end loop over 'r'
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivenavierstokes_exterior_facet_integral_5_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_exterior_facet_integral_5_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_exterior_facet_integral_5_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    6
+    // Number of operations (multiply-add pairs) for tensor contraction: 165
+    // Total number of operations (multiply-add pairs):                  181
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.0;
+      A[2] = 0.0;
+      A[3] = 0.0;
+      A[4] = 0.0;
+      A[5] = 0.0;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = 0.0;
+      A[9] = 0.0;
+      A[10] = 0.0;
+      A[11] = 0.0;
+      A[12] = 0.0;
+      A[13] = 0.0;
+      A[14] = 0.0;
+      A[15] = 0.0;
+      A[16] = 0.0928571428571428*G0_1 - 0.00714285714285713*G0_2 + 0.0476190476190476*G0_3;
+      A[17] = -0.00714285714285713*G0_1 - 0.00714285714285714*G0_2 - 0.019047619047619*G0_3;
+      A[18] = 0.0476190476190476*G0_1 - 0.019047619047619*G0_2 + 0.038095238095238*G0_3;
+      A[19] = 0.0;
+      A[20] = 0.0;
+      A[21] = 0.0;
+      A[22] = 0.0;
+      A[23] = 0.0;
+      A[24] = 0.0;
+      A[25] = 0.0;
+      A[26] = 0.0;
+      A[27] = 0.0;
+      A[28] = 0.0;
+      A[29] = 0.0;
+      A[30] = 0.0;
+      A[31] = -0.00714285714285713*G0_1 - 0.00714285714285714*G0_2 - 0.019047619047619*G0_3;
+      A[32] = -0.00714285714285714*G0_1 + 0.0928571428571428*G0_2 + 0.0476190476190476*G0_3;
+      A[33] = -0.019047619047619*G0_1 + 0.0476190476190476*G0_2 + 0.0380952380952381*G0_3;
+      A[34] = 0.0;
+      A[35] = 0.0;
+      A[36] = 0.0;
+      A[37] = 0.0;
+      A[38] = 0.0;
+      A[39] = 0.0;
+      A[40] = 0.0;
+      A[41] = 0.0;
+      A[42] = 0.0;
+      A[43] = 0.0;
+      A[44] = 0.0;
+      A[45] = 0.0;
+      A[46] = 0.0476190476190476*G0_1 - 0.019047619047619*G0_2 + 0.038095238095238*G0_3;
+      A[47] = -0.019047619047619*G0_1 + 0.0476190476190476*G0_2 + 0.0380952380952381*G0_3;
+      A[48] = 0.038095238095238*G0_1 + 0.0380952380952381*G0_2 + 0.457142857142857*G0_3;
+      A[49] = 0.0;
+      A[50] = 0.0;
+      A[51] = 0.0;
+      A[52] = 0.0;
+      A[53] = 0.0;
+      A[54] = 0.0;
+      A[55] = 0.0;
+      A[56] = 0.0;
+      A[57] = 0.0;
+      A[58] = 0.0;
+      A[59] = 0.0;
+      A[60] = 0.0;
+      A[61] = 0.0;
+      A[62] = 0.0;
+      A[63] = 0.0;
+      A[64] = 0.0;
+      A[65] = 0.0;
+      A[66] = 0.0;
+      A[67] = 0.0;
+      A[68] = 0.0;
+      A[69] = 0.0;
+      A[70] = 0.0;
+      A[71] = 0.0;
+      A[72] = 0.0;
+      A[73] = 0.0;
+      A[74] = 0.0;
+      A[75] = 0.0;
+      A[76] = 0.0;
+      A[77] = 0.0;
+      A[78] = 0.0;
+      A[79] = 0.0;
+      A[80] = 0.0;
+      A[81] = 0.0;
+      A[82] = 0.0;
+      A[83] = 0.0;
+      A[84] = 0.0;
+      A[85] = 0.0;
+      A[86] = 0.0;
+      A[87] = 0.0;
+      A[88] = 0.0;
+      A[89] = 0.0;
+      A[90] = 0.0;
+      A[91] = 0.0;
+      A[92] = 0.0;
+      A[93] = 0.0;
+      A[94] = 0.0;
+      A[95] = 0.0;
+      A[96] = 0.0;
+      A[97] = 0.0;
+      A[98] = 0.0;
+      A[99] = 0.0;
+      A[100] = 0.0;
+      A[101] = 0.0;
+      A[102] = 0.0;
+      A[103] = 0.0;
+      A[104] = 0.0;
+      A[105] = 0.0;
+      A[106] = 0.0;
+      A[107] = 0.0;
+      A[108] = 0.0;
+      A[109] = 0.0;
+      A[110] = 0.0;
+      A[111] = 0.0;
+      A[112] = 0.0928571428571428*G0_1 - 0.00714285714285713*G0_2 + 0.0476190476190476*G0_3;
+      A[113] = -0.00714285714285713*G0_1 - 0.00714285714285714*G0_2 - 0.019047619047619*G0_3;
+      A[114] = 0.0476190476190476*G0_1 - 0.019047619047619*G0_2 + 0.038095238095238*G0_3;
+      A[115] = 0.0;
+      A[116] = 0.0;
+      A[117] = 0.0;
+      A[118] = 0.0;
+      A[119] = 0.0;
+      A[120] = 0.0;
+      A[121] = 0.0;
+      A[122] = 0.0;
+      A[123] = 0.0;
+      A[124] = 0.0;
+      A[125] = 0.0;
+      A[126] = 0.0;
+      A[127] = -0.00714285714285713*G0_1 - 0.00714285714285714*G0_2 - 0.019047619047619*G0_3;
+      A[128] = -0.00714285714285714*G0_1 + 0.0928571428571428*G0_2 + 0.0476190476190476*G0_3;
+      A[129] = -0.019047619047619*G0_1 + 0.0476190476190476*G0_2 + 0.0380952380952381*G0_3;
+      A[130] = 0.0;
+      A[131] = 0.0;
+      A[132] = 0.0;
+      A[133] = 0.0;
+      A[134] = 0.0;
+      A[135] = 0.0;
+      A[136] = 0.0;
+      A[137] = 0.0;
+      A[138] = 0.0;
+      A[139] = 0.0;
+      A[140] = 0.0;
+      A[141] = 0.0;
+      A[142] = 0.0476190476190476*G0_1 - 0.019047619047619*G0_2 + 0.038095238095238*G0_3;
+      A[143] = -0.019047619047619*G0_1 + 0.0476190476190476*G0_2 + 0.0380952380952381*G0_3;
+      A[144] = 0.038095238095238*G0_1 + 0.0380952380952381*G0_2 + 0.457142857142857*G0_3;
+      A[145] = 0.0;
+      A[146] = 0.0;
+      A[147] = 0.0;
+      A[148] = 0.0;
+      A[149] = 0.0;
+      A[150] = 0.0;
+      A[151] = 0.0;
+      A[152] = 0.0;
+      A[153] = 0.0;
+      A[154] = 0.0;
+      A[155] = 0.0;
+      A[156] = 0.0;
+      A[157] = 0.0;
+      A[158] = 0.0;
+      A[159] = 0.0;
+      A[160] = 0.0;
+      A[161] = 0.0;
+      A[162] = 0.0;
+      A[163] = 0.0;
+      A[164] = 0.0;
+      A[165] = 0.0;
+      A[166] = 0.0;
+      A[167] = 0.0;
+      A[168] = 0.0;
+      A[169] = 0.0;
+      A[170] = 0.0;
+      A[171] = 0.0;
+      A[172] = 0.0;
+      A[173] = 0.0;
+      A[174] = 0.0;
+      A[175] = 0.0;
+      A[176] = 0.0;
+      A[177] = 0.0;
+      A[178] = 0.0;
+      A[179] = 0.0;
+      A[180] = 0.0;
+      A[181] = 0.0;
+      A[182] = 0.0;
+      A[183] = 0.0;
+      A[184] = 0.0;
+      A[185] = 0.0;
+      A[186] = 0.0;
+      A[187] = 0.0;
+      A[188] = 0.0;
+      A[189] = 0.0;
+      A[190] = 0.0;
+      A[191] = 0.0;
+      A[192] = 0.0;
+      A[193] = 0.0;
+      A[194] = 0.0;
+      A[195] = 0.0;
+      A[196] = 0.0;
+      A[197] = 0.0;
+      A[198] = 0.0;
+      A[199] = 0.0;
+      A[200] = 0.0;
+      A[201] = 0.0;
+      A[202] = 0.0;
+      A[203] = 0.0;
+      A[204] = 0.0;
+      A[205] = 0.0;
+      A[206] = 0.0;
+      A[207] = 0.0;
+      A[208] = 0.15*G0_1 - 0.0166666666666666*G0_2 + 0.2*G0_3;
+      A[209] = 0.0166666666666666*G0_1 + 0.0166666666666667*G0_2 + 0.133333333333333*G0_3;
+      A[210] = 0.0;
+      A[211] = 0.0;
+      A[212] = 0.0;
+      A[213] = 0.0;
+      A[214] = 0.0;
+      A[215] = 0.0;
+      A[216] = 0.0;
+      A[217] = 0.0;
+      A[218] = 0.0;
+      A[219] = 0.0;
+      A[220] = 0.0;
+      A[221] = 0.0;
+      A[222] = 0.0;
+      A[223] = 0.0166666666666666*G0_1 + 0.0166666666666667*G0_2 + 0.133333333333333*G0_3;
+      A[224] = -0.0166666666666666*G0_1 + 0.15*G0_2 + 0.2*G0_3;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.0928571428571428*G0_0 - 0.00714285714285714*G0_2 + 0.0476190476190476*G0_4;
+      A[1] = 0.0;
+      A[2] = -0.00714285714285714*G0_0 - 0.00714285714285713*G0_2 - 0.019047619047619*G0_4;
+      A[3] = 0.0;
+      A[4] = 0.0476190476190476*G0_0 - 0.019047619047619*G0_2 + 0.0380952380952381*G0_4;
+      A[5] = 0.0;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = 0.0;
+      A[9] = 0.0;
+      A[10] = 0.0;
+      A[11] = 0.0;
+      A[12] = 0.0;
+      A[13] = 0.0;
+      A[14] = 0.0;
+      A[15] = 0.0;
+      A[16] = 0.0;
+      A[17] = 0.0;
+      A[18] = 0.0;
+      A[19] = 0.0;
+      A[20] = 0.0;
+      A[21] = 0.0;
+      A[22] = 0.0;
+      A[23] = 0.0;
+      A[24] = 0.0;
+      A[25] = 0.0;
+      A[26] = 0.0;
+      A[27] = 0.0;
+      A[28] = 0.0;
+      A[29] = 0.0;
+      A[30] = -0.00714285714285714*G0_0 - 0.00714285714285713*G0_2 - 0.019047619047619*G0_4;
+      A[31] = 0.0;
+      A[32] = -0.00714285714285713*G0_0 + 0.0928571428571428*G0_2 + 0.0476190476190476*G0_4;
+      A[33] = 0.0;
+      A[34] = -0.019047619047619*G0_0 + 0.0476190476190476*G0_2 + 0.0380952380952381*G0_4;
+      A[35] = 0.0;
+      A[36] = 0.0;
+      A[37] = 0.0;
+      A[38] = 0.0;
+      A[39] = 0.0;
+      A[40] = 0.0;
+      A[41] = 0.0;
+      A[42] = 0.0;
+      A[43] = 0.0;
+      A[44] = 0.0;
+      A[45] = 0.0;
+      A[46] = 0.0;
+      A[47] = 0.0;
+      A[48] = 0.0;
+      A[49] = 0.0;
+      A[50] = 0.0;
+      A[51] = 0.0;
+      A[52] = 0.0;
+      A[53] = 0.0;
+      A[54] = 0.0;
+      A[55] = 0.0;
+      A[56] = 0.0;
+      A[57] = 0.0;
+      A[58] = 0.0;
+      A[59] = 0.0;
+      A[60] = 0.0476190476190476*G0_0 - 0.019047619047619*G0_2 + 0.0380952380952381*G0_4;
+      A[61] = 0.0;
+      A[62] = -0.019047619047619*G0_0 + 0.0476190476190476*G0_2 + 0.0380952380952381*G0_4;
+      A[63] = 0.0;
+      A[64] = 0.0380952380952381*G0_0 + 0.0380952380952381*G0_2 + 0.457142857142857*G0_4;
+      A[65] = 0.0;
+      A[66] = 0.0;
+      A[67] = 0.0;
+      A[68] = 0.0;
+      A[69] = 0.0;
+      A[70] = 0.0;
+      A[71] = 0.0;
+      A[72] = 0.0;
+      A[73] = 0.0;
+      A[74] = 0.0;
+      A[75] = 0.0;
+      A[76] = 0.0;
+      A[77] = 0.0;
+      A[78] = 0.0;
+      A[79] = 0.0;
+      A[80] = 0.0;
+      A[81] = 0.0;
+      A[82] = 0.0;
+      A[83] = 0.0;
+      A[84] = 0.0;
+      A[85] = 0.0;
+      A[86] = 0.0;
+      A[87] = 0.0;
+      A[88] = 0.0;
+      A[89] = 0.0;
+      A[90] = 0.0;
+      A[91] = 0.0;
+      A[92] = 0.0;
+      A[93] = 0.0;
+      A[94] = 0.0;
+      A[95] = 0.0;
+      A[96] = 0.0928571428571428*G0_0 - 0.00714285714285714*G0_2 + 0.0476190476190476*G0_4;
+      A[97] = 0.0;
+      A[98] = -0.00714285714285714*G0_0 - 0.00714285714285713*G0_2 - 0.019047619047619*G0_4;
+      A[99] = 0.0;
+      A[100] = 0.0476190476190476*G0_0 - 0.019047619047619*G0_2 + 0.0380952380952381*G0_4;
+      A[101] = 0.0;
+      A[102] = 0.0;
+      A[103] = 0.0;
+      A[104] = 0.0;
+      A[105] = 0.0;
+      A[106] = 0.0;
+      A[107] = 0.0;
+      A[108] = 0.0;
+      A[109] = 0.0;
+      A[110] = 0.0;
+      A[111] = 0.0;
+      A[112] = 0.0;
+      A[113] = 0.0;
+      A[114] = 0.0;
+      A[115] = 0.0;
+      A[116] = 0.0;
+      A[117] = 0.0;
+      A[118] = 0.0;
+      A[119] = 0.0;
+      A[120] = 0.0;
+      A[121] = 0.0;
+      A[122] = 0.0;
+      A[123] = 0.0;
+      A[124] = 0.0;
+      A[125] = 0.0;
+      A[126] = -0.00714285714285714*G0_0 - 0.00714285714285713*G0_2 - 0.019047619047619*G0_4;
+      A[127] = 0.0;
+      A[128] = -0.00714285714285713*G0_0 + 0.0928571428571428*G0_2 + 0.0476190476190476*G0_4;
+      A[129] = 0.0;
+      A[130] = -0.019047619047619*G0_0 + 0.0476190476190476*G0_2 + 0.0380952380952381*G0_4;
+      A[131] = 0.0;
+      A[132] = 0.0;
+      A[133] = 0.0;
+      A[134] = 0.0;
+      A[135] = 0.0;
+      A[136] = 0.0;
+      A[137] = 0.0;
+      A[138] = 0.0;
+      A[139] = 0.0;
+      A[140] = 0.0;
+      A[141] = 0.0;
+      A[142] = 0.0;
+      A[143] = 0.0;
+      A[144] = 0.0;
+      A[145] = 0.0;
+      A[146] = 0.0;
+      A[147] = 0.0;
+      A[148] = 0.0;
+      A[149] = 0.0;
+      A[150] = 0.0;
+      A[151] = 0.0;
+      A[152] = 0.0;
+      A[153] = 0.0;
+      A[154] = 0.0;
+      A[155] = 0.0;
+      A[156] = 0.0476190476190476*G0_0 - 0.019047619047619*G0_2 + 0.0380952380952381*G0_4;
+      A[157] = 0.0;
+      A[158] = -0.019047619047619*G0_0 + 0.0476190476190476*G0_2 + 0.0380952380952381*G0_4;
+      A[159] = 0.0;
+      A[160] = 0.0380952380952381*G0_0 + 0.0380952380952381*G0_2 + 0.457142857142857*G0_4;
+      A[161] = 0.0;
+      A[162] = 0.0;
+      A[163] = 0.0;
+      A[164] = 0.0;
+      A[165] = 0.0;
+      A[166] = 0.0;
+      A[167] = 0.0;
+      A[168] = 0.0;
+      A[169] = 0.0;
+      A[170] = 0.0;
+      A[171] = 0.0;
+      A[172] = 0.0;
+      A[173] = 0.0;
+      A[174] = 0.0;
+      A[175] = 0.0;
+      A[176] = 0.0;
+      A[177] = 0.0;
+      A[178] = 0.0;
+      A[179] = 0.0;
+      A[180] = 0.0;
+      A[181] = 0.0;
+      A[182] = 0.0;
+      A[183] = 0.0;
+      A[184] = 0.0;
+      A[185] = 0.0;
+      A[186] = 0.0;
+      A[187] = 0.0;
+      A[188] = 0.0;
+      A[189] = 0.0;
+      A[190] = 0.0;
+      A[191] = 0.0;
+      A[192] = 0.15*G0_0 - 0.0166666666666666*G0_2 + 0.2*G0_4;
+      A[193] = 0.0;
+      A[194] = 0.0166666666666667*G0_0 + 0.0166666666666667*G0_2 + 0.133333333333333*G0_4;
+      A[195] = 0.0;
+      A[196] = 0.0;
+      A[197] = 0.0;
+      A[198] = 0.0;
+      A[199] = 0.0;
+      A[200] = 0.0;
+      A[201] = 0.0;
+      A[202] = 0.0;
+      A[203] = 0.0;
+      A[204] = 0.0;
+      A[205] = 0.0;
+      A[206] = 0.0;
+      A[207] = 0.0;
+      A[208] = 0.0;
+      A[209] = 0.0;
+      A[210] = 0.0;
+      A[211] = 0.0;
+      A[212] = 0.0;
+      A[213] = 0.0;
+      A[214] = 0.0;
+      A[215] = 0.0;
+      A[216] = 0.0;
+      A[217] = 0.0;
+      A[218] = 0.0;
+      A[219] = 0.0;
+      A[220] = 0.0;
+      A[221] = 0.0;
+      A[222] = 0.0166666666666667*G0_0 + 0.0166666666666667*G0_2 + 0.133333333333333*G0_4;
+      A[223] = 0.0;
+      A[224] = -0.0166666666666666*G0_0 + 0.15*G0_2 + 0.2*G0_4;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.0928571428571428*G0_0 - 0.00714285714285714*G0_1 + 0.0476190476190476*G0_5;
+      A[1] = -0.00714285714285714*G0_0 - 0.00714285714285714*G0_1 - 0.019047619047619*G0_5;
+      A[2] = 0.0;
+      A[3] = 0.0;
+      A[4] = 0.0;
+      A[5] = 0.0476190476190476*G0_0 - 0.019047619047619*G0_1 + 0.0380952380952381*G0_5;
+      A[6] = 0.0;
+      A[7] = 0.0;
+      A[8] = 0.0;
+      A[9] = 0.0;
+      A[10] = 0.0;
+      A[11] = 0.0;
+      A[12] = 0.0;
+      A[13] = 0.0;
+      A[14] = 0.0;
+      A[15] = -0.00714285714285714*G0_0 - 0.00714285714285714*G0_1 - 0.019047619047619*G0_5;
+      A[16] = -0.00714285714285714*G0_0 + 0.0928571428571428*G0_1 + 0.0476190476190476*G0_5;
+      A[17] = 0.0;
+      A[18] = 0.0;
+      A[19] = 0.0;
+      A[20] = -0.019047619047619*G0_0 + 0.0476190476190476*G0_1 + 0.0380952380952381*G0_5;
+      A[21] = 0.0;
+      A[22] = 0.0;
+      A[23] = 0.0;
+      A[24] = 0.0;
+      A[25] = 0.0;
+      A[26] = 0.0;
+      A[27] = 0.0;
+      A[28] = 0.0;
+      A[29] = 0.0;
+      A[30] = 0.0;
+      A[31] = 0.0;
+      A[32] = 0.0;
+      A[33] = 0.0;
+      A[34] = 0.0;
+      A[35] = 0.0;
+      A[36] = 0.0;
+      A[37] = 0.0;
+      A[38] = 0.0;
+      A[39] = 0.0;
+      A[40] = 0.0;
+      A[41] = 0.0;
+      A[42] = 0.0;
+      A[43] = 0.0;
+      A[44] = 0.0;
+      A[45] = 0.0;
+      A[46] = 0.0;
+      A[47] = 0.0;
+      A[48] = 0.0;
+      A[49] = 0.0;
+      A[50] = 0.0;
+      A[51] = 0.0;
+      A[52] = 0.0;
+      A[53] = 0.0;
+      A[54] = 0.0;
+      A[55] = 0.0;
+      A[56] = 0.0;
+      A[57] = 0.0;
+      A[58] = 0.0;
+      A[59] = 0.0;
+      A[60] = 0.0;
+      A[61] = 0.0;
+      A[62] = 0.0;
+      A[63] = 0.0;
+      A[64] = 0.0;
+      A[65] = 0.0;
+      A[66] = 0.0;
+      A[67] = 0.0;
+      A[68] = 0.0;
+      A[69] = 0.0;
+      A[70] = 0.0;
+      A[71] = 0.0;
+      A[72] = 0.0;
+      A[73] = 0.0;
+      A[74] = 0.0;
+      A[75] = 0.0476190476190476*G0_0 - 0.019047619047619*G0_1 + 0.0380952380952381*G0_5;
+      A[76] = -0.019047619047619*G0_0 + 0.0476190476190476*G0_1 + 0.0380952380952381*G0_5;
+      A[77] = 0.0;
+      A[78] = 0.0;
+      A[79] = 0.0;
+      A[80] = 0.0380952380952381*G0_0 + 0.0380952380952381*G0_1 + 0.457142857142857*G0_5;
+      A[81] = 0.0;
+      A[82] = 0.0;
+      A[83] = 0.0;
+      A[84] = 0.0;
+      A[85] = 0.0;
+      A[86] = 0.0;
+      A[87] = 0.0;
+      A[88] = 0.0;
+      A[89] = 0.0;
+      A[90] = 0.0;
+      A[91] = 0.0;
+      A[92] = 0.0;
+      A[93] = 0.0;
+      A[94] = 0.0;
+      A[95] = 0.0;
+      A[96] = 0.0928571428571428*G0_0 - 0.00714285714285714*G0_1 + 0.0476190476190476*G0_5;
+      A[97] = -0.00714285714285714*G0_0 - 0.00714285714285714*G0_1 - 0.019047619047619*G0_5;
+      A[98] = 0.0;
+      A[99] = 0.0;
+      A[100] = 0.0;
+      A[101] = 0.0476190476190476*G0_0 - 0.019047619047619*G0_1 + 0.0380952380952381*G0_5;
+      A[102] = 0.0;
+      A[103] = 0.0;
+      A[104] = 0.0;
+      A[105] = 0.0;
+      A[106] = 0.0;
+      A[107] = 0.0;
+      A[108] = 0.0;
+      A[109] = 0.0;
+      A[110] = 0.0;
+      A[111] = -0.00714285714285714*G0_0 - 0.00714285714285714*G0_1 - 0.019047619047619*G0_5;
+      A[112] = -0.00714285714285714*G0_0 + 0.0928571428571428*G0_1 + 0.0476190476190476*G0_5;
+      A[113] = 0.0;
+      A[114] = 0.0;
+      A[115] = 0.0;
+      A[116] = -0.019047619047619*G0_0 + 0.0476190476190476*G0_1 + 0.0380952380952381*G0_5;
+      A[117] = 0.0;
+      A[118] = 0.0;
+      A[119] = 0.0;
+      A[120] = 0.0;
+      A[121] = 0.0;
+      A[122] = 0.0;
+      A[123] = 0.0;
+      A[124] = 0.0;
+      A[125] = 0.0;
+      A[126] = 0.0;
+      A[127] = 0.0;
+      A[128] = 0.0;
+      A[129] = 0.0;
+      A[130] = 0.0;
+      A[131] = 0.0;
+      A[132] = 0.0;
+      A[133] = 0.0;
+      A[134] = 0.0;
+      A[135] = 0.0;
+      A[136] = 0.0;
+      A[137] = 0.0;
+      A[138] = 0.0;
+      A[139] = 0.0;
+      A[140] = 0.0;
+      A[141] = 0.0;
+      A[142] = 0.0;
+      A[143] = 0.0;
+      A[144] = 0.0;
+      A[145] = 0.0;
+      A[146] = 0.0;
+      A[147] = 0.0;
+      A[148] = 0.0;
+      A[149] = 0.0;
+      A[150] = 0.0;
+      A[151] = 0.0;
+      A[152] = 0.0;
+      A[153] = 0.0;
+      A[154] = 0.0;
+      A[155] = 0.0;
+      A[156] = 0.0;
+      A[157] = 0.0;
+      A[158] = 0.0;
+      A[159] = 0.0;
+      A[160] = 0.0;
+      A[161] = 0.0;
+      A[162] = 0.0;
+      A[163] = 0.0;
+      A[164] = 0.0;
+      A[165] = 0.0;
+      A[166] = 0.0;
+      A[167] = 0.0;
+      A[168] = 0.0;
+      A[169] = 0.0;
+      A[170] = 0.0;
+      A[171] = 0.0476190476190476*G0_0 - 0.019047619047619*G0_1 + 0.0380952380952381*G0_5;
+      A[172] = -0.019047619047619*G0_0 + 0.0476190476190476*G0_1 + 0.0380952380952381*G0_5;
+      A[173] = 0.0;
+      A[174] = 0.0;
+      A[175] = 0.0;
+      A[176] = 0.0380952380952381*G0_0 + 0.0380952380952381*G0_1 + 0.457142857142857*G0_5;
+      A[177] = 0.0;
+      A[178] = 0.0;
+      A[179] = 0.0;
+      A[180] = 0.0;
+      A[181] = 0.0;
+      A[182] = 0.0;
+      A[183] = 0.0;
+      A[184] = 0.0;
+      A[185] = 0.0;
+      A[186] = 0.0;
+      A[187] = 0.0;
+      A[188] = 0.0;
+      A[189] = 0.0;
+      A[190] = 0.0;
+      A[191] = 0.0;
+      A[192] = 0.15*G0_0 - 0.0166666666666667*G0_1 + 0.2*G0_5;
+      A[193] = 0.0166666666666667*G0_0 + 0.0166666666666667*G0_1 + 0.133333333333333*G0_5;
+      A[194] = 0.0;
+      A[195] = 0.0;
+      A[196] = 0.0;
+      A[197] = 0.0;
+      A[198] = 0.0;
+      A[199] = 0.0;
+      A[200] = 0.0;
+      A[201] = 0.0;
+      A[202] = 0.0;
+      A[203] = 0.0;
+      A[204] = 0.0;
+      A[205] = 0.0;
+      A[206] = 0.0;
+      A[207] = 0.0166666666666666*G0_0 + 0.0166666666666667*G0_1 + 0.133333333333333*G0_5;
+      A[208] = -0.0166666666666667*G0_0 + 0.15*G0_1 + 0.2*G0_5;
+      A[209] = 0.0;
+      A[210] = 0.0;
+      A[211] = 0.0;
+      A[212] = 0.0;
+      A[213] = 0.0;
+      A[214] = 0.0;
+      A[215] = 0.0;
+      A[216] = 0.0;
+      A[217] = 0.0;
+      A[218] = 0.0;
+      A[219] = 0.0;
+      A[220] = 0.0;
+      A[221] = 0.0;
+      A[222] = 0.0;
+      A[223] = 0.0;
+      A[224] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// interior facet tensor corresponding to the local contribution to
+/// a form from the integral over an interior facet.
+
+class adaptivenavierstokes_interior_facet_integral_5_otherwise: public ufc::interior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_interior_facet_integral_5_otherwise() : ufc::interior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_interior_facet_integral_5_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local interior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates_0,
+                               const double*  vertex_coordinates_1,
+                               std::size_t facet_0,
+                               std::size_t facet_1,
+                               int cell_orientation_0,
+                               int cell_orientation_1) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      12
+    // Number of operations (multiply-add pairs) for geometry tensor:    12
+    // Number of operations (multiply-add pairs) for tensor contraction: 990
+    // Total number of operations (multiply-add pairs):                  1014
+    
+    // Compute Jacobian
+    double J_0[4];
+    compute_jacobian_triangle_2d(J_0, vertex_coordinates_0);
+    
+    // Compute Jacobian inverse and determinant
+    double K_0[4];
+    double detJ_0;
+    compute_jacobian_inverse_triangle_2d(K_0, detJ_0, J_0);
+    
+    // Compute Jacobian
+    double J_1[4];
+    compute_jacobian_triangle_2d(J_1, vertex_coordinates_1);
+    
+    // Compute Jacobian inverse and determinant
+    double K_1[4];
+    double detJ_1;
+    compute_jacobian_inverse_triangle_2d(K_1, detJ_1, J_1);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet_0][0];
+    const unsigned int v1 = edge_vertices[facet_0][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates_0[2*v1 + 0] - vertex_coordinates_0[2*v0 + 0];
+    const double dx1 = vertex_coordinates_0[2*v1 + 1] - vertex_coordinates_0[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    
+    // Compute geometry tensor
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    const double G0_10 = det*w[0][10]*(1.0);
+    const double G0_11 = det*w[0][11]*(1.0);
+    const double G1_0 = det*w[0][0]*(1.0);
+    const double G1_1 = det*w[0][1]*(1.0);
+    const double G1_2 = det*w[0][2]*(1.0);
+    const double G1_3 = det*w[0][3]*(1.0);
+    const double G1_4 = det*w[0][4]*(1.0);
+    const double G1_5 = det*w[0][5]*(1.0);
+    
+    // Compute element tensor
+    switch (facet_0)
+    {
+    case 0:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.0;
+        A[1] = 0.0;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0928571428571428*G1_1 - 0.00714285714285713*G1_2 + 0.0476190476190476*G1_3;
+        A[32] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[33] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[34] = 0.0;
+        A[35] = 0.0;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = 0.0;
+        A[61] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[62] = -0.00714285714285714*G1_1 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_3;
+        A[63] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[64] = 0.0;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[92] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[93] = 0.038095238095238*G1_1 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_3;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0;
+        A[121] = 0.0;
+        A[122] = 0.0;
+        A[123] = 0.0;
+        A[124] = 0.0;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0;
+        A[151] = 0.0;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0;
+        A[187] = 0.0;
+        A[188] = 0.0;
+        A[189] = 0.0;
+        A[190] = 0.0;
+        A[191] = 0.0;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = 0.0;
+        A[217] = 0.0928571428571428*G1_1 - 0.00714285714285713*G1_2 + 0.0476190476190476*G1_3;
+        A[218] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[219] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[220] = 0.0;
+        A[221] = 0.0;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = 0.0;
+        A[247] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[248] = -0.00714285714285714*G1_1 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_3;
+        A[249] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[250] = 0.0;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[278] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[279] = 0.038095238095238*G1_1 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_3;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0;
+        A[307] = 0.0;
+        A[308] = 0.0;
+        A[309] = 0.0;
+        A[310] = 0.0;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0;
+        A[337] = 0.0;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.0;
+        A[373] = 0.0;
+        A[374] = 0.0;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0;
+        A[403] = 0.15*G1_1 - 0.0166666666666666*G1_2 + 0.2*G1_3;
+        A[404] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0;
+        A[433] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[434] = -0.0166666666666666*G1_1 + 0.15*G1_2 + 0.2*G1_3;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0;
+        A[466] = 0.0;
+        A[467] = 0.0;
+        A[468] = 0.0;
+        A[469] = 0.0;
+        A[470] = 0.0;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = 0.0;
+        A[496] = 0.0928571428571428*G0_7 - 0.00714285714285713*G0_8 + 0.0476190476190476*G0_9;
+        A[497] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[498] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[499] = 0.0;
+        A[500] = 0.0;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = 0.0;
+        A[526] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[527] = -0.00714285714285714*G0_7 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_9;
+        A[528] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[529] = 0.0;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[557] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[558] = 0.038095238095238*G0_7 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_9;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0;
+        A[586] = 0.0;
+        A[587] = 0.0;
+        A[588] = 0.0;
+        A[589] = 0.0;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0;
+        A[616] = 0.0;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0;
+        A[652] = 0.0;
+        A[653] = 0.0;
+        A[654] = 0.0;
+        A[655] = 0.0;
+        A[656] = 0.0;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = 0.0;
+        A[682] = 0.0928571428571428*G0_7 - 0.00714285714285713*G0_8 + 0.0476190476190476*G0_9;
+        A[683] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[684] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[685] = 0.0;
+        A[686] = 0.0;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = 0.0;
+        A[712] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[713] = -0.00714285714285714*G0_7 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_9;
+        A[714] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[715] = 0.0;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[743] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[744] = 0.038095238095238*G0_7 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_9;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0;
+        A[772] = 0.0;
+        A[773] = 0.0;
+        A[774] = 0.0;
+        A[775] = 0.0;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0;
+        A[802] = 0.0;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.0;
+        A[838] = 0.0;
+        A[839] = 0.0;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0;
+        A[868] = 0.15*G0_7 - 0.0166666666666666*G0_8 + 0.2*G0_9;
+        A[869] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0;
+        A[898] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[899] = -0.0166666666666666*G0_7 + 0.15*G0_8 + 0.2*G0_9;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.0;
+        A[1] = 0.0;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0928571428571428*G1_1 - 0.00714285714285713*G1_2 + 0.0476190476190476*G1_3;
+        A[32] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[33] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[34] = 0.0;
+        A[35] = 0.0;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = 0.0;
+        A[61] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[62] = -0.00714285714285714*G1_1 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_3;
+        A[63] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[64] = 0.0;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[92] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[93] = 0.038095238095238*G1_1 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_3;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0;
+        A[121] = 0.0;
+        A[122] = 0.0;
+        A[123] = 0.0;
+        A[124] = 0.0;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0;
+        A[151] = 0.0;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0;
+        A[187] = 0.0;
+        A[188] = 0.0;
+        A[189] = 0.0;
+        A[190] = 0.0;
+        A[191] = 0.0;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = 0.0;
+        A[217] = 0.0928571428571428*G1_1 - 0.00714285714285713*G1_2 + 0.0476190476190476*G1_3;
+        A[218] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[219] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[220] = 0.0;
+        A[221] = 0.0;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = 0.0;
+        A[247] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[248] = -0.00714285714285714*G1_1 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_3;
+        A[249] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[250] = 0.0;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[278] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[279] = 0.038095238095238*G1_1 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_3;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0;
+        A[307] = 0.0;
+        A[308] = 0.0;
+        A[309] = 0.0;
+        A[310] = 0.0;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0;
+        A[337] = 0.0;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.0;
+        A[373] = 0.0;
+        A[374] = 0.0;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0;
+        A[403] = 0.15*G1_1 - 0.0166666666666666*G1_2 + 0.2*G1_3;
+        A[404] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0;
+        A[433] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[434] = -0.0166666666666666*G1_1 + 0.15*G1_2 + 0.2*G1_3;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_8 + 0.0476190476190476*G0_10;
+        A[466] = 0.0;
+        A[467] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[468] = 0.0;
+        A[469] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[470] = 0.0;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = 0.0;
+        A[496] = 0.0;
+        A[497] = 0.0;
+        A[498] = 0.0;
+        A[499] = 0.0;
+        A[500] = 0.0;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[526] = 0.0;
+        A[527] = -0.00714285714285713*G0_6 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_10;
+        A[528] = 0.0;
+        A[529] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0;
+        A[557] = 0.0;
+        A[558] = 0.0;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[586] = 0.0;
+        A[587] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[588] = 0.0;
+        A[589] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_10;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0;
+        A[616] = 0.0;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_8 + 0.0476190476190476*G0_10;
+        A[652] = 0.0;
+        A[653] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[654] = 0.0;
+        A[655] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[656] = 0.0;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = 0.0;
+        A[682] = 0.0;
+        A[683] = 0.0;
+        A[684] = 0.0;
+        A[685] = 0.0;
+        A[686] = 0.0;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[712] = 0.0;
+        A[713] = -0.00714285714285713*G0_6 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_10;
+        A[714] = 0.0;
+        A[715] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0;
+        A[743] = 0.0;
+        A[744] = 0.0;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[772] = 0.0;
+        A[773] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[774] = 0.0;
+        A[775] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_10;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0;
+        A[802] = 0.0;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.15*G0_6 - 0.0166666666666666*G0_8 + 0.2*G0_10;
+        A[838] = 0.0;
+        A[839] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0;
+        A[868] = 0.0;
+        A[869] = 0.0;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[898] = 0.0;
+        A[899] = -0.0166666666666666*G0_6 + 0.15*G0_8 + 0.2*G0_10;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.0;
+        A[1] = 0.0;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0928571428571428*G1_1 - 0.00714285714285713*G1_2 + 0.0476190476190476*G1_3;
+        A[32] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[33] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[34] = 0.0;
+        A[35] = 0.0;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = 0.0;
+        A[61] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[62] = -0.00714285714285714*G1_1 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_3;
+        A[63] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[64] = 0.0;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[92] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[93] = 0.038095238095238*G1_1 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_3;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0;
+        A[121] = 0.0;
+        A[122] = 0.0;
+        A[123] = 0.0;
+        A[124] = 0.0;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0;
+        A[151] = 0.0;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0;
+        A[187] = 0.0;
+        A[188] = 0.0;
+        A[189] = 0.0;
+        A[190] = 0.0;
+        A[191] = 0.0;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = 0.0;
+        A[217] = 0.0928571428571428*G1_1 - 0.00714285714285713*G1_2 + 0.0476190476190476*G1_3;
+        A[218] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[219] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[220] = 0.0;
+        A[221] = 0.0;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = 0.0;
+        A[247] = -0.00714285714285713*G1_1 - 0.00714285714285714*G1_2 - 0.019047619047619*G1_3;
+        A[248] = -0.00714285714285714*G1_1 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_3;
+        A[249] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[250] = 0.0;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0476190476190476*G1_1 - 0.019047619047619*G1_2 + 0.038095238095238*G1_3;
+        A[278] = -0.019047619047619*G1_1 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_3;
+        A[279] = 0.038095238095238*G1_1 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_3;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0;
+        A[307] = 0.0;
+        A[308] = 0.0;
+        A[309] = 0.0;
+        A[310] = 0.0;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0;
+        A[337] = 0.0;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.0;
+        A[373] = 0.0;
+        A[374] = 0.0;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0;
+        A[403] = 0.15*G1_1 - 0.0166666666666666*G1_2 + 0.2*G1_3;
+        A[404] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0;
+        A[433] = 0.0166666666666666*G1_1 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_3;
+        A[434] = -0.0166666666666666*G1_1 + 0.15*G1_2 + 0.2*G1_3;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_7 + 0.0476190476190476*G0_11;
+        A[466] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[467] = 0.0;
+        A[468] = 0.0;
+        A[469] = 0.0;
+        A[470] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[496] = -0.00714285714285714*G0_6 + 0.0928571428571428*G0_7 + 0.0476190476190476*G0_11;
+        A[497] = 0.0;
+        A[498] = 0.0;
+        A[499] = 0.0;
+        A[500] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = 0.0;
+        A[526] = 0.0;
+        A[527] = 0.0;
+        A[528] = 0.0;
+        A[529] = 0.0;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0;
+        A[557] = 0.0;
+        A[558] = 0.0;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0;
+        A[586] = 0.0;
+        A[587] = 0.0;
+        A[588] = 0.0;
+        A[589] = 0.0;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[616] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_7 + 0.457142857142857*G0_11;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_7 + 0.0476190476190476*G0_11;
+        A[652] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[653] = 0.0;
+        A[654] = 0.0;
+        A[655] = 0.0;
+        A[656] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[682] = -0.00714285714285714*G0_6 + 0.0928571428571428*G0_7 + 0.0476190476190476*G0_11;
+        A[683] = 0.0;
+        A[684] = 0.0;
+        A[685] = 0.0;
+        A[686] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = 0.0;
+        A[712] = 0.0;
+        A[713] = 0.0;
+        A[714] = 0.0;
+        A[715] = 0.0;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0;
+        A[743] = 0.0;
+        A[744] = 0.0;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0;
+        A[772] = 0.0;
+        A[773] = 0.0;
+        A[774] = 0.0;
+        A[775] = 0.0;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[802] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_7 + 0.457142857142857*G0_11;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.15*G0_6 - 0.0166666666666667*G0_7 + 0.2*G0_11;
+        A[838] = 0.0166666666666666*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[839] = 0.0;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[868] = -0.0166666666666667*G0_6 + 0.15*G0_7 + 0.2*G0_11;
+        A[869] = 0.0;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0;
+        A[898] = 0.0;
+        A[899] = 0.0;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_2 + 0.0476190476190476*G1_4;
+        A[1] = 0.0;
+        A[2] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[3] = 0.0;
+        A[4] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = 0.0;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[61] = 0.0;
+        A[62] = -0.00714285714285713*G1_0 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_4;
+        A[63] = 0.0;
+        A[64] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0;
+        A[92] = 0.0;
+        A[93] = 0.0;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[121] = 0.0;
+        A[122] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[123] = 0.0;
+        A[124] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_4;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0;
+        A[151] = 0.0;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_2 + 0.0476190476190476*G1_4;
+        A[187] = 0.0;
+        A[188] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[189] = 0.0;
+        A[190] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[191] = 0.0;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = 0.0;
+        A[217] = 0.0;
+        A[218] = 0.0;
+        A[219] = 0.0;
+        A[220] = 0.0;
+        A[221] = 0.0;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[247] = 0.0;
+        A[248] = -0.00714285714285713*G1_0 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_4;
+        A[249] = 0.0;
+        A[250] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0;
+        A[278] = 0.0;
+        A[279] = 0.0;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[307] = 0.0;
+        A[308] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[309] = 0.0;
+        A[310] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_4;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0;
+        A[337] = 0.0;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.15*G1_0 - 0.0166666666666666*G1_2 + 0.2*G1_4;
+        A[373] = 0.0;
+        A[374] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0;
+        A[403] = 0.0;
+        A[404] = 0.0;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[433] = 0.0;
+        A[434] = -0.0166666666666666*G1_0 + 0.15*G1_2 + 0.2*G1_4;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0;
+        A[466] = 0.0;
+        A[467] = 0.0;
+        A[468] = 0.0;
+        A[469] = 0.0;
+        A[470] = 0.0;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = 0.0;
+        A[496] = 0.0928571428571428*G0_7 - 0.00714285714285713*G0_8 + 0.0476190476190476*G0_9;
+        A[497] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[498] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[499] = 0.0;
+        A[500] = 0.0;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = 0.0;
+        A[526] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[527] = -0.00714285714285714*G0_7 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_9;
+        A[528] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[529] = 0.0;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[557] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[558] = 0.038095238095238*G0_7 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_9;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0;
+        A[586] = 0.0;
+        A[587] = 0.0;
+        A[588] = 0.0;
+        A[589] = 0.0;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0;
+        A[616] = 0.0;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0;
+        A[652] = 0.0;
+        A[653] = 0.0;
+        A[654] = 0.0;
+        A[655] = 0.0;
+        A[656] = 0.0;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = 0.0;
+        A[682] = 0.0928571428571428*G0_7 - 0.00714285714285713*G0_8 + 0.0476190476190476*G0_9;
+        A[683] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[684] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[685] = 0.0;
+        A[686] = 0.0;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = 0.0;
+        A[712] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[713] = -0.00714285714285714*G0_7 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_9;
+        A[714] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[715] = 0.0;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[743] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[744] = 0.038095238095238*G0_7 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_9;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0;
+        A[772] = 0.0;
+        A[773] = 0.0;
+        A[774] = 0.0;
+        A[775] = 0.0;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0;
+        A[802] = 0.0;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.0;
+        A[838] = 0.0;
+        A[839] = 0.0;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0;
+        A[868] = 0.15*G0_7 - 0.0166666666666666*G0_8 + 0.2*G0_9;
+        A[869] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0;
+        A[898] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[899] = -0.0166666666666666*G0_7 + 0.15*G0_8 + 0.2*G0_9;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_2 + 0.0476190476190476*G1_4;
+        A[1] = 0.0;
+        A[2] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[3] = 0.0;
+        A[4] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = 0.0;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[61] = 0.0;
+        A[62] = -0.00714285714285713*G1_0 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_4;
+        A[63] = 0.0;
+        A[64] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0;
+        A[92] = 0.0;
+        A[93] = 0.0;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[121] = 0.0;
+        A[122] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[123] = 0.0;
+        A[124] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_4;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0;
+        A[151] = 0.0;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_2 + 0.0476190476190476*G1_4;
+        A[187] = 0.0;
+        A[188] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[189] = 0.0;
+        A[190] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[191] = 0.0;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = 0.0;
+        A[217] = 0.0;
+        A[218] = 0.0;
+        A[219] = 0.0;
+        A[220] = 0.0;
+        A[221] = 0.0;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[247] = 0.0;
+        A[248] = -0.00714285714285713*G1_0 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_4;
+        A[249] = 0.0;
+        A[250] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0;
+        A[278] = 0.0;
+        A[279] = 0.0;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[307] = 0.0;
+        A[308] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[309] = 0.0;
+        A[310] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_4;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0;
+        A[337] = 0.0;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.15*G1_0 - 0.0166666666666666*G1_2 + 0.2*G1_4;
+        A[373] = 0.0;
+        A[374] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0;
+        A[403] = 0.0;
+        A[404] = 0.0;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[433] = 0.0;
+        A[434] = -0.0166666666666666*G1_0 + 0.15*G1_2 + 0.2*G1_4;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_8 + 0.0476190476190476*G0_10;
+        A[466] = 0.0;
+        A[467] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[468] = 0.0;
+        A[469] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[470] = 0.0;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = 0.0;
+        A[496] = 0.0;
+        A[497] = 0.0;
+        A[498] = 0.0;
+        A[499] = 0.0;
+        A[500] = 0.0;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[526] = 0.0;
+        A[527] = -0.00714285714285713*G0_6 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_10;
+        A[528] = 0.0;
+        A[529] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0;
+        A[557] = 0.0;
+        A[558] = 0.0;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[586] = 0.0;
+        A[587] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[588] = 0.0;
+        A[589] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_10;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0;
+        A[616] = 0.0;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_8 + 0.0476190476190476*G0_10;
+        A[652] = 0.0;
+        A[653] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[654] = 0.0;
+        A[655] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[656] = 0.0;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = 0.0;
+        A[682] = 0.0;
+        A[683] = 0.0;
+        A[684] = 0.0;
+        A[685] = 0.0;
+        A[686] = 0.0;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[712] = 0.0;
+        A[713] = -0.00714285714285713*G0_6 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_10;
+        A[714] = 0.0;
+        A[715] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0;
+        A[743] = 0.0;
+        A[744] = 0.0;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[772] = 0.0;
+        A[773] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[774] = 0.0;
+        A[775] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_10;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0;
+        A[802] = 0.0;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.15*G0_6 - 0.0166666666666666*G0_8 + 0.2*G0_10;
+        A[838] = 0.0;
+        A[839] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0;
+        A[868] = 0.0;
+        A[869] = 0.0;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[898] = 0.0;
+        A[899] = -0.0166666666666666*G0_6 + 0.15*G0_8 + 0.2*G0_10;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_2 + 0.0476190476190476*G1_4;
+        A[1] = 0.0;
+        A[2] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[3] = 0.0;
+        A[4] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[5] = 0.0;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = 0.0;
+        A[31] = 0.0;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = 0.0;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[61] = 0.0;
+        A[62] = -0.00714285714285713*G1_0 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_4;
+        A[63] = 0.0;
+        A[64] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0;
+        A[92] = 0.0;
+        A[93] = 0.0;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[121] = 0.0;
+        A[122] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[123] = 0.0;
+        A[124] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_4;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0;
+        A[151] = 0.0;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_2 + 0.0476190476190476*G1_4;
+        A[187] = 0.0;
+        A[188] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[189] = 0.0;
+        A[190] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[191] = 0.0;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = 0.0;
+        A[217] = 0.0;
+        A[218] = 0.0;
+        A[219] = 0.0;
+        A[220] = 0.0;
+        A[221] = 0.0;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = -0.00714285714285714*G1_0 - 0.00714285714285713*G1_2 - 0.019047619047619*G1_4;
+        A[247] = 0.0;
+        A[248] = -0.00714285714285713*G1_0 + 0.0928571428571428*G1_2 + 0.0476190476190476*G1_4;
+        A[249] = 0.0;
+        A[250] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0;
+        A[278] = 0.0;
+        A[279] = 0.0;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_2 + 0.0380952380952381*G1_4;
+        A[307] = 0.0;
+        A[308] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_2 + 0.0380952380952381*G1_4;
+        A[309] = 0.0;
+        A[310] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_2 + 0.457142857142857*G1_4;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0;
+        A[337] = 0.0;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.15*G1_0 - 0.0166666666666666*G1_2 + 0.2*G1_4;
+        A[373] = 0.0;
+        A[374] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0;
+        A[403] = 0.0;
+        A[404] = 0.0;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_2 + 0.133333333333333*G1_4;
+        A[433] = 0.0;
+        A[434] = -0.0166666666666666*G1_0 + 0.15*G1_2 + 0.2*G1_4;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_7 + 0.0476190476190476*G0_11;
+        A[466] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[467] = 0.0;
+        A[468] = 0.0;
+        A[469] = 0.0;
+        A[470] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[496] = -0.00714285714285714*G0_6 + 0.0928571428571428*G0_7 + 0.0476190476190476*G0_11;
+        A[497] = 0.0;
+        A[498] = 0.0;
+        A[499] = 0.0;
+        A[500] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = 0.0;
+        A[526] = 0.0;
+        A[527] = 0.0;
+        A[528] = 0.0;
+        A[529] = 0.0;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0;
+        A[557] = 0.0;
+        A[558] = 0.0;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0;
+        A[586] = 0.0;
+        A[587] = 0.0;
+        A[588] = 0.0;
+        A[589] = 0.0;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[616] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_7 + 0.457142857142857*G0_11;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_7 + 0.0476190476190476*G0_11;
+        A[652] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[653] = 0.0;
+        A[654] = 0.0;
+        A[655] = 0.0;
+        A[656] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[682] = -0.00714285714285714*G0_6 + 0.0928571428571428*G0_7 + 0.0476190476190476*G0_11;
+        A[683] = 0.0;
+        A[684] = 0.0;
+        A[685] = 0.0;
+        A[686] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = 0.0;
+        A[712] = 0.0;
+        A[713] = 0.0;
+        A[714] = 0.0;
+        A[715] = 0.0;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0;
+        A[743] = 0.0;
+        A[744] = 0.0;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0;
+        A[772] = 0.0;
+        A[773] = 0.0;
+        A[774] = 0.0;
+        A[775] = 0.0;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[802] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_7 + 0.457142857142857*G0_11;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.15*G0_6 - 0.0166666666666667*G0_7 + 0.2*G0_11;
+        A[838] = 0.0166666666666666*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[839] = 0.0;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[868] = -0.0166666666666667*G0_6 + 0.15*G0_7 + 0.2*G0_11;
+        A[869] = 0.0;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0;
+        A[898] = 0.0;
+        A[899] = 0.0;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_1 + 0.0476190476190476*G1_5;
+        A[1] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[31] = -0.00714285714285714*G1_0 + 0.0928571428571428*G1_1 + 0.0476190476190476*G1_5;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = 0.0;
+        A[61] = 0.0;
+        A[62] = 0.0;
+        A[63] = 0.0;
+        A[64] = 0.0;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0;
+        A[92] = 0.0;
+        A[93] = 0.0;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0;
+        A[121] = 0.0;
+        A[122] = 0.0;
+        A[123] = 0.0;
+        A[124] = 0.0;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[151] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_1 + 0.457142857142857*G1_5;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_1 + 0.0476190476190476*G1_5;
+        A[187] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[188] = 0.0;
+        A[189] = 0.0;
+        A[190] = 0.0;
+        A[191] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[217] = -0.00714285714285714*G1_0 + 0.0928571428571428*G1_1 + 0.0476190476190476*G1_5;
+        A[218] = 0.0;
+        A[219] = 0.0;
+        A[220] = 0.0;
+        A[221] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = 0.0;
+        A[247] = 0.0;
+        A[248] = 0.0;
+        A[249] = 0.0;
+        A[250] = 0.0;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0;
+        A[278] = 0.0;
+        A[279] = 0.0;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0;
+        A[307] = 0.0;
+        A[308] = 0.0;
+        A[309] = 0.0;
+        A[310] = 0.0;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[337] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_1 + 0.457142857142857*G1_5;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.15*G1_0 - 0.0166666666666667*G1_1 + 0.2*G1_5;
+        A[373] = 0.0166666666666666*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[374] = 0.0;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[403] = -0.0166666666666667*G1_0 + 0.15*G1_1 + 0.2*G1_5;
+        A[404] = 0.0;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0;
+        A[433] = 0.0;
+        A[434] = 0.0;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0;
+        A[466] = 0.0;
+        A[467] = 0.0;
+        A[468] = 0.0;
+        A[469] = 0.0;
+        A[470] = 0.0;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = 0.0;
+        A[496] = 0.0928571428571428*G0_7 - 0.00714285714285713*G0_8 + 0.0476190476190476*G0_9;
+        A[497] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[498] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[499] = 0.0;
+        A[500] = 0.0;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = 0.0;
+        A[526] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[527] = -0.00714285714285714*G0_7 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_9;
+        A[528] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[529] = 0.0;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[557] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[558] = 0.038095238095238*G0_7 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_9;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0;
+        A[586] = 0.0;
+        A[587] = 0.0;
+        A[588] = 0.0;
+        A[589] = 0.0;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0;
+        A[616] = 0.0;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0;
+        A[652] = 0.0;
+        A[653] = 0.0;
+        A[654] = 0.0;
+        A[655] = 0.0;
+        A[656] = 0.0;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = 0.0;
+        A[682] = 0.0928571428571428*G0_7 - 0.00714285714285713*G0_8 + 0.0476190476190476*G0_9;
+        A[683] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[684] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[685] = 0.0;
+        A[686] = 0.0;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = 0.0;
+        A[712] = -0.00714285714285713*G0_7 - 0.00714285714285714*G0_8 - 0.019047619047619*G0_9;
+        A[713] = -0.00714285714285714*G0_7 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_9;
+        A[714] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[715] = 0.0;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0476190476190476*G0_7 - 0.019047619047619*G0_8 + 0.038095238095238*G0_9;
+        A[743] = -0.019047619047619*G0_7 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_9;
+        A[744] = 0.038095238095238*G0_7 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_9;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0;
+        A[772] = 0.0;
+        A[773] = 0.0;
+        A[774] = 0.0;
+        A[775] = 0.0;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0;
+        A[802] = 0.0;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.0;
+        A[838] = 0.0;
+        A[839] = 0.0;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0;
+        A[868] = 0.15*G0_7 - 0.0166666666666666*G0_8 + 0.2*G0_9;
+        A[869] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0;
+        A[898] = 0.0166666666666666*G0_7 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_9;
+        A[899] = -0.0166666666666666*G0_7 + 0.15*G0_8 + 0.2*G0_9;
+          break;
+        }
+      case 1:
+        {
+          A[0] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_1 + 0.0476190476190476*G1_5;
+        A[1] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[31] = -0.00714285714285714*G1_0 + 0.0928571428571428*G1_1 + 0.0476190476190476*G1_5;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = 0.0;
+        A[61] = 0.0;
+        A[62] = 0.0;
+        A[63] = 0.0;
+        A[64] = 0.0;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0;
+        A[92] = 0.0;
+        A[93] = 0.0;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0;
+        A[121] = 0.0;
+        A[122] = 0.0;
+        A[123] = 0.0;
+        A[124] = 0.0;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[151] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_1 + 0.457142857142857*G1_5;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_1 + 0.0476190476190476*G1_5;
+        A[187] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[188] = 0.0;
+        A[189] = 0.0;
+        A[190] = 0.0;
+        A[191] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[217] = -0.00714285714285714*G1_0 + 0.0928571428571428*G1_1 + 0.0476190476190476*G1_5;
+        A[218] = 0.0;
+        A[219] = 0.0;
+        A[220] = 0.0;
+        A[221] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = 0.0;
+        A[247] = 0.0;
+        A[248] = 0.0;
+        A[249] = 0.0;
+        A[250] = 0.0;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0;
+        A[278] = 0.0;
+        A[279] = 0.0;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0;
+        A[307] = 0.0;
+        A[308] = 0.0;
+        A[309] = 0.0;
+        A[310] = 0.0;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[337] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_1 + 0.457142857142857*G1_5;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.15*G1_0 - 0.0166666666666667*G1_1 + 0.2*G1_5;
+        A[373] = 0.0166666666666666*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[374] = 0.0;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[403] = -0.0166666666666667*G1_0 + 0.15*G1_1 + 0.2*G1_5;
+        A[404] = 0.0;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0;
+        A[433] = 0.0;
+        A[434] = 0.0;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_8 + 0.0476190476190476*G0_10;
+        A[466] = 0.0;
+        A[467] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[468] = 0.0;
+        A[469] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[470] = 0.0;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = 0.0;
+        A[496] = 0.0;
+        A[497] = 0.0;
+        A[498] = 0.0;
+        A[499] = 0.0;
+        A[500] = 0.0;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[526] = 0.0;
+        A[527] = -0.00714285714285713*G0_6 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_10;
+        A[528] = 0.0;
+        A[529] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0;
+        A[557] = 0.0;
+        A[558] = 0.0;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[586] = 0.0;
+        A[587] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[588] = 0.0;
+        A[589] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_10;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0;
+        A[616] = 0.0;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_8 + 0.0476190476190476*G0_10;
+        A[652] = 0.0;
+        A[653] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[654] = 0.0;
+        A[655] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[656] = 0.0;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = 0.0;
+        A[682] = 0.0;
+        A[683] = 0.0;
+        A[684] = 0.0;
+        A[685] = 0.0;
+        A[686] = 0.0;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = -0.00714285714285714*G0_6 - 0.00714285714285713*G0_8 - 0.019047619047619*G0_10;
+        A[712] = 0.0;
+        A[713] = -0.00714285714285713*G0_6 + 0.0928571428571428*G0_8 + 0.0476190476190476*G0_10;
+        A[714] = 0.0;
+        A[715] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0;
+        A[743] = 0.0;
+        A[744] = 0.0;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_8 + 0.0380952380952381*G0_10;
+        A[772] = 0.0;
+        A[773] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_8 + 0.0380952380952381*G0_10;
+        A[774] = 0.0;
+        A[775] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_8 + 0.457142857142857*G0_10;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0;
+        A[802] = 0.0;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.15*G0_6 - 0.0166666666666666*G0_8 + 0.2*G0_10;
+        A[838] = 0.0;
+        A[839] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0;
+        A[868] = 0.0;
+        A[869] = 0.0;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_8 + 0.133333333333333*G0_10;
+        A[898] = 0.0;
+        A[899] = -0.0166666666666666*G0_6 + 0.15*G0_8 + 0.2*G0_10;
+          break;
+        }
+      case 2:
+        {
+          A[0] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_1 + 0.0476190476190476*G1_5;
+        A[1] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[2] = 0.0;
+        A[3] = 0.0;
+        A[4] = 0.0;
+        A[5] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[6] = 0.0;
+        A[7] = 0.0;
+        A[8] = 0.0;
+        A[9] = 0.0;
+        A[10] = 0.0;
+        A[11] = 0.0;
+        A[12] = 0.0;
+        A[13] = 0.0;
+        A[14] = 0.0;
+        A[15] = 0.0;
+        A[16] = 0.0;
+        A[17] = 0.0;
+        A[18] = 0.0;
+        A[19] = 0.0;
+        A[20] = 0.0;
+        A[21] = 0.0;
+        A[22] = 0.0;
+        A[23] = 0.0;
+        A[24] = 0.0;
+        A[25] = 0.0;
+        A[26] = 0.0;
+        A[27] = 0.0;
+        A[28] = 0.0;
+        A[29] = 0.0;
+        A[30] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[31] = -0.00714285714285714*G1_0 + 0.0928571428571428*G1_1 + 0.0476190476190476*G1_5;
+        A[32] = 0.0;
+        A[33] = 0.0;
+        A[34] = 0.0;
+        A[35] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[36] = 0.0;
+        A[37] = 0.0;
+        A[38] = 0.0;
+        A[39] = 0.0;
+        A[40] = 0.0;
+        A[41] = 0.0;
+        A[42] = 0.0;
+        A[43] = 0.0;
+        A[44] = 0.0;
+        A[45] = 0.0;
+        A[46] = 0.0;
+        A[47] = 0.0;
+        A[48] = 0.0;
+        A[49] = 0.0;
+        A[50] = 0.0;
+        A[51] = 0.0;
+        A[52] = 0.0;
+        A[53] = 0.0;
+        A[54] = 0.0;
+        A[55] = 0.0;
+        A[56] = 0.0;
+        A[57] = 0.0;
+        A[58] = 0.0;
+        A[59] = 0.0;
+        A[60] = 0.0;
+        A[61] = 0.0;
+        A[62] = 0.0;
+        A[63] = 0.0;
+        A[64] = 0.0;
+        A[65] = 0.0;
+        A[66] = 0.0;
+        A[67] = 0.0;
+        A[68] = 0.0;
+        A[69] = 0.0;
+        A[70] = 0.0;
+        A[71] = 0.0;
+        A[72] = 0.0;
+        A[73] = 0.0;
+        A[74] = 0.0;
+        A[75] = 0.0;
+        A[76] = 0.0;
+        A[77] = 0.0;
+        A[78] = 0.0;
+        A[79] = 0.0;
+        A[80] = 0.0;
+        A[81] = 0.0;
+        A[82] = 0.0;
+        A[83] = 0.0;
+        A[84] = 0.0;
+        A[85] = 0.0;
+        A[86] = 0.0;
+        A[87] = 0.0;
+        A[88] = 0.0;
+        A[89] = 0.0;
+        A[90] = 0.0;
+        A[91] = 0.0;
+        A[92] = 0.0;
+        A[93] = 0.0;
+        A[94] = 0.0;
+        A[95] = 0.0;
+        A[96] = 0.0;
+        A[97] = 0.0;
+        A[98] = 0.0;
+        A[99] = 0.0;
+        A[100] = 0.0;
+        A[101] = 0.0;
+        A[102] = 0.0;
+        A[103] = 0.0;
+        A[104] = 0.0;
+        A[105] = 0.0;
+        A[106] = 0.0;
+        A[107] = 0.0;
+        A[108] = 0.0;
+        A[109] = 0.0;
+        A[110] = 0.0;
+        A[111] = 0.0;
+        A[112] = 0.0;
+        A[113] = 0.0;
+        A[114] = 0.0;
+        A[115] = 0.0;
+        A[116] = 0.0;
+        A[117] = 0.0;
+        A[118] = 0.0;
+        A[119] = 0.0;
+        A[120] = 0.0;
+        A[121] = 0.0;
+        A[122] = 0.0;
+        A[123] = 0.0;
+        A[124] = 0.0;
+        A[125] = 0.0;
+        A[126] = 0.0;
+        A[127] = 0.0;
+        A[128] = 0.0;
+        A[129] = 0.0;
+        A[130] = 0.0;
+        A[131] = 0.0;
+        A[132] = 0.0;
+        A[133] = 0.0;
+        A[134] = 0.0;
+        A[135] = 0.0;
+        A[136] = 0.0;
+        A[137] = 0.0;
+        A[138] = 0.0;
+        A[139] = 0.0;
+        A[140] = 0.0;
+        A[141] = 0.0;
+        A[142] = 0.0;
+        A[143] = 0.0;
+        A[144] = 0.0;
+        A[145] = 0.0;
+        A[146] = 0.0;
+        A[147] = 0.0;
+        A[148] = 0.0;
+        A[149] = 0.0;
+        A[150] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[151] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[152] = 0.0;
+        A[153] = 0.0;
+        A[154] = 0.0;
+        A[155] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_1 + 0.457142857142857*G1_5;
+        A[156] = 0.0;
+        A[157] = 0.0;
+        A[158] = 0.0;
+        A[159] = 0.0;
+        A[160] = 0.0;
+        A[161] = 0.0;
+        A[162] = 0.0;
+        A[163] = 0.0;
+        A[164] = 0.0;
+        A[165] = 0.0;
+        A[166] = 0.0;
+        A[167] = 0.0;
+        A[168] = 0.0;
+        A[169] = 0.0;
+        A[170] = 0.0;
+        A[171] = 0.0;
+        A[172] = 0.0;
+        A[173] = 0.0;
+        A[174] = 0.0;
+        A[175] = 0.0;
+        A[176] = 0.0;
+        A[177] = 0.0;
+        A[178] = 0.0;
+        A[179] = 0.0;
+        A[180] = 0.0;
+        A[181] = 0.0;
+        A[182] = 0.0;
+        A[183] = 0.0;
+        A[184] = 0.0;
+        A[185] = 0.0;
+        A[186] = 0.0928571428571428*G1_0 - 0.00714285714285714*G1_1 + 0.0476190476190476*G1_5;
+        A[187] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[188] = 0.0;
+        A[189] = 0.0;
+        A[190] = 0.0;
+        A[191] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[192] = 0.0;
+        A[193] = 0.0;
+        A[194] = 0.0;
+        A[195] = 0.0;
+        A[196] = 0.0;
+        A[197] = 0.0;
+        A[198] = 0.0;
+        A[199] = 0.0;
+        A[200] = 0.0;
+        A[201] = 0.0;
+        A[202] = 0.0;
+        A[203] = 0.0;
+        A[204] = 0.0;
+        A[205] = 0.0;
+        A[206] = 0.0;
+        A[207] = 0.0;
+        A[208] = 0.0;
+        A[209] = 0.0;
+        A[210] = 0.0;
+        A[211] = 0.0;
+        A[212] = 0.0;
+        A[213] = 0.0;
+        A[214] = 0.0;
+        A[215] = 0.0;
+        A[216] = -0.00714285714285714*G1_0 - 0.00714285714285714*G1_1 - 0.019047619047619*G1_5;
+        A[217] = -0.00714285714285714*G1_0 + 0.0928571428571428*G1_1 + 0.0476190476190476*G1_5;
+        A[218] = 0.0;
+        A[219] = 0.0;
+        A[220] = 0.0;
+        A[221] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[222] = 0.0;
+        A[223] = 0.0;
+        A[224] = 0.0;
+        A[225] = 0.0;
+        A[226] = 0.0;
+        A[227] = 0.0;
+        A[228] = 0.0;
+        A[229] = 0.0;
+        A[230] = 0.0;
+        A[231] = 0.0;
+        A[232] = 0.0;
+        A[233] = 0.0;
+        A[234] = 0.0;
+        A[235] = 0.0;
+        A[236] = 0.0;
+        A[237] = 0.0;
+        A[238] = 0.0;
+        A[239] = 0.0;
+        A[240] = 0.0;
+        A[241] = 0.0;
+        A[242] = 0.0;
+        A[243] = 0.0;
+        A[244] = 0.0;
+        A[245] = 0.0;
+        A[246] = 0.0;
+        A[247] = 0.0;
+        A[248] = 0.0;
+        A[249] = 0.0;
+        A[250] = 0.0;
+        A[251] = 0.0;
+        A[252] = 0.0;
+        A[253] = 0.0;
+        A[254] = 0.0;
+        A[255] = 0.0;
+        A[256] = 0.0;
+        A[257] = 0.0;
+        A[258] = 0.0;
+        A[259] = 0.0;
+        A[260] = 0.0;
+        A[261] = 0.0;
+        A[262] = 0.0;
+        A[263] = 0.0;
+        A[264] = 0.0;
+        A[265] = 0.0;
+        A[266] = 0.0;
+        A[267] = 0.0;
+        A[268] = 0.0;
+        A[269] = 0.0;
+        A[270] = 0.0;
+        A[271] = 0.0;
+        A[272] = 0.0;
+        A[273] = 0.0;
+        A[274] = 0.0;
+        A[275] = 0.0;
+        A[276] = 0.0;
+        A[277] = 0.0;
+        A[278] = 0.0;
+        A[279] = 0.0;
+        A[280] = 0.0;
+        A[281] = 0.0;
+        A[282] = 0.0;
+        A[283] = 0.0;
+        A[284] = 0.0;
+        A[285] = 0.0;
+        A[286] = 0.0;
+        A[287] = 0.0;
+        A[288] = 0.0;
+        A[289] = 0.0;
+        A[290] = 0.0;
+        A[291] = 0.0;
+        A[292] = 0.0;
+        A[293] = 0.0;
+        A[294] = 0.0;
+        A[295] = 0.0;
+        A[296] = 0.0;
+        A[297] = 0.0;
+        A[298] = 0.0;
+        A[299] = 0.0;
+        A[300] = 0.0;
+        A[301] = 0.0;
+        A[302] = 0.0;
+        A[303] = 0.0;
+        A[304] = 0.0;
+        A[305] = 0.0;
+        A[306] = 0.0;
+        A[307] = 0.0;
+        A[308] = 0.0;
+        A[309] = 0.0;
+        A[310] = 0.0;
+        A[311] = 0.0;
+        A[312] = 0.0;
+        A[313] = 0.0;
+        A[314] = 0.0;
+        A[315] = 0.0;
+        A[316] = 0.0;
+        A[317] = 0.0;
+        A[318] = 0.0;
+        A[319] = 0.0;
+        A[320] = 0.0;
+        A[321] = 0.0;
+        A[322] = 0.0;
+        A[323] = 0.0;
+        A[324] = 0.0;
+        A[325] = 0.0;
+        A[326] = 0.0;
+        A[327] = 0.0;
+        A[328] = 0.0;
+        A[329] = 0.0;
+        A[330] = 0.0;
+        A[331] = 0.0;
+        A[332] = 0.0;
+        A[333] = 0.0;
+        A[334] = 0.0;
+        A[335] = 0.0;
+        A[336] = 0.0476190476190476*G1_0 - 0.019047619047619*G1_1 + 0.0380952380952381*G1_5;
+        A[337] = -0.019047619047619*G1_0 + 0.0476190476190476*G1_1 + 0.0380952380952381*G1_5;
+        A[338] = 0.0;
+        A[339] = 0.0;
+        A[340] = 0.0;
+        A[341] = 0.0380952380952381*G1_0 + 0.0380952380952381*G1_1 + 0.457142857142857*G1_5;
+        A[342] = 0.0;
+        A[343] = 0.0;
+        A[344] = 0.0;
+        A[345] = 0.0;
+        A[346] = 0.0;
+        A[347] = 0.0;
+        A[348] = 0.0;
+        A[349] = 0.0;
+        A[350] = 0.0;
+        A[351] = 0.0;
+        A[352] = 0.0;
+        A[353] = 0.0;
+        A[354] = 0.0;
+        A[355] = 0.0;
+        A[356] = 0.0;
+        A[357] = 0.0;
+        A[358] = 0.0;
+        A[359] = 0.0;
+        A[360] = 0.0;
+        A[361] = 0.0;
+        A[362] = 0.0;
+        A[363] = 0.0;
+        A[364] = 0.0;
+        A[365] = 0.0;
+        A[366] = 0.0;
+        A[367] = 0.0;
+        A[368] = 0.0;
+        A[369] = 0.0;
+        A[370] = 0.0;
+        A[371] = 0.0;
+        A[372] = 0.15*G1_0 - 0.0166666666666667*G1_1 + 0.2*G1_5;
+        A[373] = 0.0166666666666666*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[374] = 0.0;
+        A[375] = 0.0;
+        A[376] = 0.0;
+        A[377] = 0.0;
+        A[378] = 0.0;
+        A[379] = 0.0;
+        A[380] = 0.0;
+        A[381] = 0.0;
+        A[382] = 0.0;
+        A[383] = 0.0;
+        A[384] = 0.0;
+        A[385] = 0.0;
+        A[386] = 0.0;
+        A[387] = 0.0;
+        A[388] = 0.0;
+        A[389] = 0.0;
+        A[390] = 0.0;
+        A[391] = 0.0;
+        A[392] = 0.0;
+        A[393] = 0.0;
+        A[394] = 0.0;
+        A[395] = 0.0;
+        A[396] = 0.0;
+        A[397] = 0.0;
+        A[398] = 0.0;
+        A[399] = 0.0;
+        A[400] = 0.0;
+        A[401] = 0.0;
+        A[402] = 0.0166666666666667*G1_0 + 0.0166666666666667*G1_1 + 0.133333333333333*G1_5;
+        A[403] = -0.0166666666666667*G1_0 + 0.15*G1_1 + 0.2*G1_5;
+        A[404] = 0.0;
+        A[405] = 0.0;
+        A[406] = 0.0;
+        A[407] = 0.0;
+        A[408] = 0.0;
+        A[409] = 0.0;
+        A[410] = 0.0;
+        A[411] = 0.0;
+        A[412] = 0.0;
+        A[413] = 0.0;
+        A[414] = 0.0;
+        A[415] = 0.0;
+        A[416] = 0.0;
+        A[417] = 0.0;
+        A[418] = 0.0;
+        A[419] = 0.0;
+        A[420] = 0.0;
+        A[421] = 0.0;
+        A[422] = 0.0;
+        A[423] = 0.0;
+        A[424] = 0.0;
+        A[425] = 0.0;
+        A[426] = 0.0;
+        A[427] = 0.0;
+        A[428] = 0.0;
+        A[429] = 0.0;
+        A[430] = 0.0;
+        A[431] = 0.0;
+        A[432] = 0.0;
+        A[433] = 0.0;
+        A[434] = 0.0;
+        A[435] = 0.0;
+        A[436] = 0.0;
+        A[437] = 0.0;
+        A[438] = 0.0;
+        A[439] = 0.0;
+        A[440] = 0.0;
+        A[441] = 0.0;
+        A[442] = 0.0;
+        A[443] = 0.0;
+        A[444] = 0.0;
+        A[445] = 0.0;
+        A[446] = 0.0;
+        A[447] = 0.0;
+        A[448] = 0.0;
+        A[449] = 0.0;
+        A[450] = 0.0;
+        A[451] = 0.0;
+        A[452] = 0.0;
+        A[453] = 0.0;
+        A[454] = 0.0;
+        A[455] = 0.0;
+        A[456] = 0.0;
+        A[457] = 0.0;
+        A[458] = 0.0;
+        A[459] = 0.0;
+        A[460] = 0.0;
+        A[461] = 0.0;
+        A[462] = 0.0;
+        A[463] = 0.0;
+        A[464] = 0.0;
+        A[465] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_7 + 0.0476190476190476*G0_11;
+        A[466] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[467] = 0.0;
+        A[468] = 0.0;
+        A[469] = 0.0;
+        A[470] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[471] = 0.0;
+        A[472] = 0.0;
+        A[473] = 0.0;
+        A[474] = 0.0;
+        A[475] = 0.0;
+        A[476] = 0.0;
+        A[477] = 0.0;
+        A[478] = 0.0;
+        A[479] = 0.0;
+        A[480] = 0.0;
+        A[481] = 0.0;
+        A[482] = 0.0;
+        A[483] = 0.0;
+        A[484] = 0.0;
+        A[485] = 0.0;
+        A[486] = 0.0;
+        A[487] = 0.0;
+        A[488] = 0.0;
+        A[489] = 0.0;
+        A[490] = 0.0;
+        A[491] = 0.0;
+        A[492] = 0.0;
+        A[493] = 0.0;
+        A[494] = 0.0;
+        A[495] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[496] = -0.00714285714285714*G0_6 + 0.0928571428571428*G0_7 + 0.0476190476190476*G0_11;
+        A[497] = 0.0;
+        A[498] = 0.0;
+        A[499] = 0.0;
+        A[500] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[501] = 0.0;
+        A[502] = 0.0;
+        A[503] = 0.0;
+        A[504] = 0.0;
+        A[505] = 0.0;
+        A[506] = 0.0;
+        A[507] = 0.0;
+        A[508] = 0.0;
+        A[509] = 0.0;
+        A[510] = 0.0;
+        A[511] = 0.0;
+        A[512] = 0.0;
+        A[513] = 0.0;
+        A[514] = 0.0;
+        A[515] = 0.0;
+        A[516] = 0.0;
+        A[517] = 0.0;
+        A[518] = 0.0;
+        A[519] = 0.0;
+        A[520] = 0.0;
+        A[521] = 0.0;
+        A[522] = 0.0;
+        A[523] = 0.0;
+        A[524] = 0.0;
+        A[525] = 0.0;
+        A[526] = 0.0;
+        A[527] = 0.0;
+        A[528] = 0.0;
+        A[529] = 0.0;
+        A[530] = 0.0;
+        A[531] = 0.0;
+        A[532] = 0.0;
+        A[533] = 0.0;
+        A[534] = 0.0;
+        A[535] = 0.0;
+        A[536] = 0.0;
+        A[537] = 0.0;
+        A[538] = 0.0;
+        A[539] = 0.0;
+        A[540] = 0.0;
+        A[541] = 0.0;
+        A[542] = 0.0;
+        A[543] = 0.0;
+        A[544] = 0.0;
+        A[545] = 0.0;
+        A[546] = 0.0;
+        A[547] = 0.0;
+        A[548] = 0.0;
+        A[549] = 0.0;
+        A[550] = 0.0;
+        A[551] = 0.0;
+        A[552] = 0.0;
+        A[553] = 0.0;
+        A[554] = 0.0;
+        A[555] = 0.0;
+        A[556] = 0.0;
+        A[557] = 0.0;
+        A[558] = 0.0;
+        A[559] = 0.0;
+        A[560] = 0.0;
+        A[561] = 0.0;
+        A[562] = 0.0;
+        A[563] = 0.0;
+        A[564] = 0.0;
+        A[565] = 0.0;
+        A[566] = 0.0;
+        A[567] = 0.0;
+        A[568] = 0.0;
+        A[569] = 0.0;
+        A[570] = 0.0;
+        A[571] = 0.0;
+        A[572] = 0.0;
+        A[573] = 0.0;
+        A[574] = 0.0;
+        A[575] = 0.0;
+        A[576] = 0.0;
+        A[577] = 0.0;
+        A[578] = 0.0;
+        A[579] = 0.0;
+        A[580] = 0.0;
+        A[581] = 0.0;
+        A[582] = 0.0;
+        A[583] = 0.0;
+        A[584] = 0.0;
+        A[585] = 0.0;
+        A[586] = 0.0;
+        A[587] = 0.0;
+        A[588] = 0.0;
+        A[589] = 0.0;
+        A[590] = 0.0;
+        A[591] = 0.0;
+        A[592] = 0.0;
+        A[593] = 0.0;
+        A[594] = 0.0;
+        A[595] = 0.0;
+        A[596] = 0.0;
+        A[597] = 0.0;
+        A[598] = 0.0;
+        A[599] = 0.0;
+        A[600] = 0.0;
+        A[601] = 0.0;
+        A[602] = 0.0;
+        A[603] = 0.0;
+        A[604] = 0.0;
+        A[605] = 0.0;
+        A[606] = 0.0;
+        A[607] = 0.0;
+        A[608] = 0.0;
+        A[609] = 0.0;
+        A[610] = 0.0;
+        A[611] = 0.0;
+        A[612] = 0.0;
+        A[613] = 0.0;
+        A[614] = 0.0;
+        A[615] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[616] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[617] = 0.0;
+        A[618] = 0.0;
+        A[619] = 0.0;
+        A[620] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_7 + 0.457142857142857*G0_11;
+        A[621] = 0.0;
+        A[622] = 0.0;
+        A[623] = 0.0;
+        A[624] = 0.0;
+        A[625] = 0.0;
+        A[626] = 0.0;
+        A[627] = 0.0;
+        A[628] = 0.0;
+        A[629] = 0.0;
+        A[630] = 0.0;
+        A[631] = 0.0;
+        A[632] = 0.0;
+        A[633] = 0.0;
+        A[634] = 0.0;
+        A[635] = 0.0;
+        A[636] = 0.0;
+        A[637] = 0.0;
+        A[638] = 0.0;
+        A[639] = 0.0;
+        A[640] = 0.0;
+        A[641] = 0.0;
+        A[642] = 0.0;
+        A[643] = 0.0;
+        A[644] = 0.0;
+        A[645] = 0.0;
+        A[646] = 0.0;
+        A[647] = 0.0;
+        A[648] = 0.0;
+        A[649] = 0.0;
+        A[650] = 0.0;
+        A[651] = 0.0928571428571428*G0_6 - 0.00714285714285714*G0_7 + 0.0476190476190476*G0_11;
+        A[652] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[653] = 0.0;
+        A[654] = 0.0;
+        A[655] = 0.0;
+        A[656] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[657] = 0.0;
+        A[658] = 0.0;
+        A[659] = 0.0;
+        A[660] = 0.0;
+        A[661] = 0.0;
+        A[662] = 0.0;
+        A[663] = 0.0;
+        A[664] = 0.0;
+        A[665] = 0.0;
+        A[666] = 0.0;
+        A[667] = 0.0;
+        A[668] = 0.0;
+        A[669] = 0.0;
+        A[670] = 0.0;
+        A[671] = 0.0;
+        A[672] = 0.0;
+        A[673] = 0.0;
+        A[674] = 0.0;
+        A[675] = 0.0;
+        A[676] = 0.0;
+        A[677] = 0.0;
+        A[678] = 0.0;
+        A[679] = 0.0;
+        A[680] = 0.0;
+        A[681] = -0.00714285714285714*G0_6 - 0.00714285714285714*G0_7 - 0.019047619047619*G0_11;
+        A[682] = -0.00714285714285714*G0_6 + 0.0928571428571428*G0_7 + 0.0476190476190476*G0_11;
+        A[683] = 0.0;
+        A[684] = 0.0;
+        A[685] = 0.0;
+        A[686] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[687] = 0.0;
+        A[688] = 0.0;
+        A[689] = 0.0;
+        A[690] = 0.0;
+        A[691] = 0.0;
+        A[692] = 0.0;
+        A[693] = 0.0;
+        A[694] = 0.0;
+        A[695] = 0.0;
+        A[696] = 0.0;
+        A[697] = 0.0;
+        A[698] = 0.0;
+        A[699] = 0.0;
+        A[700] = 0.0;
+        A[701] = 0.0;
+        A[702] = 0.0;
+        A[703] = 0.0;
+        A[704] = 0.0;
+        A[705] = 0.0;
+        A[706] = 0.0;
+        A[707] = 0.0;
+        A[708] = 0.0;
+        A[709] = 0.0;
+        A[710] = 0.0;
+        A[711] = 0.0;
+        A[712] = 0.0;
+        A[713] = 0.0;
+        A[714] = 0.0;
+        A[715] = 0.0;
+        A[716] = 0.0;
+        A[717] = 0.0;
+        A[718] = 0.0;
+        A[719] = 0.0;
+        A[720] = 0.0;
+        A[721] = 0.0;
+        A[722] = 0.0;
+        A[723] = 0.0;
+        A[724] = 0.0;
+        A[725] = 0.0;
+        A[726] = 0.0;
+        A[727] = 0.0;
+        A[728] = 0.0;
+        A[729] = 0.0;
+        A[730] = 0.0;
+        A[731] = 0.0;
+        A[732] = 0.0;
+        A[733] = 0.0;
+        A[734] = 0.0;
+        A[735] = 0.0;
+        A[736] = 0.0;
+        A[737] = 0.0;
+        A[738] = 0.0;
+        A[739] = 0.0;
+        A[740] = 0.0;
+        A[741] = 0.0;
+        A[742] = 0.0;
+        A[743] = 0.0;
+        A[744] = 0.0;
+        A[745] = 0.0;
+        A[746] = 0.0;
+        A[747] = 0.0;
+        A[748] = 0.0;
+        A[749] = 0.0;
+        A[750] = 0.0;
+        A[751] = 0.0;
+        A[752] = 0.0;
+        A[753] = 0.0;
+        A[754] = 0.0;
+        A[755] = 0.0;
+        A[756] = 0.0;
+        A[757] = 0.0;
+        A[758] = 0.0;
+        A[759] = 0.0;
+        A[760] = 0.0;
+        A[761] = 0.0;
+        A[762] = 0.0;
+        A[763] = 0.0;
+        A[764] = 0.0;
+        A[765] = 0.0;
+        A[766] = 0.0;
+        A[767] = 0.0;
+        A[768] = 0.0;
+        A[769] = 0.0;
+        A[770] = 0.0;
+        A[771] = 0.0;
+        A[772] = 0.0;
+        A[773] = 0.0;
+        A[774] = 0.0;
+        A[775] = 0.0;
+        A[776] = 0.0;
+        A[777] = 0.0;
+        A[778] = 0.0;
+        A[779] = 0.0;
+        A[780] = 0.0;
+        A[781] = 0.0;
+        A[782] = 0.0;
+        A[783] = 0.0;
+        A[784] = 0.0;
+        A[785] = 0.0;
+        A[786] = 0.0;
+        A[787] = 0.0;
+        A[788] = 0.0;
+        A[789] = 0.0;
+        A[790] = 0.0;
+        A[791] = 0.0;
+        A[792] = 0.0;
+        A[793] = 0.0;
+        A[794] = 0.0;
+        A[795] = 0.0;
+        A[796] = 0.0;
+        A[797] = 0.0;
+        A[798] = 0.0;
+        A[799] = 0.0;
+        A[800] = 0.0;
+        A[801] = 0.0476190476190476*G0_6 - 0.019047619047619*G0_7 + 0.0380952380952381*G0_11;
+        A[802] = -0.019047619047619*G0_6 + 0.0476190476190476*G0_7 + 0.0380952380952381*G0_11;
+        A[803] = 0.0;
+        A[804] = 0.0;
+        A[805] = 0.0;
+        A[806] = 0.0380952380952381*G0_6 + 0.0380952380952381*G0_7 + 0.457142857142857*G0_11;
+        A[807] = 0.0;
+        A[808] = 0.0;
+        A[809] = 0.0;
+        A[810] = 0.0;
+        A[811] = 0.0;
+        A[812] = 0.0;
+        A[813] = 0.0;
+        A[814] = 0.0;
+        A[815] = 0.0;
+        A[816] = 0.0;
+        A[817] = 0.0;
+        A[818] = 0.0;
+        A[819] = 0.0;
+        A[820] = 0.0;
+        A[821] = 0.0;
+        A[822] = 0.0;
+        A[823] = 0.0;
+        A[824] = 0.0;
+        A[825] = 0.0;
+        A[826] = 0.0;
+        A[827] = 0.0;
+        A[828] = 0.0;
+        A[829] = 0.0;
+        A[830] = 0.0;
+        A[831] = 0.0;
+        A[832] = 0.0;
+        A[833] = 0.0;
+        A[834] = 0.0;
+        A[835] = 0.0;
+        A[836] = 0.0;
+        A[837] = 0.15*G0_6 - 0.0166666666666667*G0_7 + 0.2*G0_11;
+        A[838] = 0.0166666666666666*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[839] = 0.0;
+        A[840] = 0.0;
+        A[841] = 0.0;
+        A[842] = 0.0;
+        A[843] = 0.0;
+        A[844] = 0.0;
+        A[845] = 0.0;
+        A[846] = 0.0;
+        A[847] = 0.0;
+        A[848] = 0.0;
+        A[849] = 0.0;
+        A[850] = 0.0;
+        A[851] = 0.0;
+        A[852] = 0.0;
+        A[853] = 0.0;
+        A[854] = 0.0;
+        A[855] = 0.0;
+        A[856] = 0.0;
+        A[857] = 0.0;
+        A[858] = 0.0;
+        A[859] = 0.0;
+        A[860] = 0.0;
+        A[861] = 0.0;
+        A[862] = 0.0;
+        A[863] = 0.0;
+        A[864] = 0.0;
+        A[865] = 0.0;
+        A[866] = 0.0;
+        A[867] = 0.0166666666666667*G0_6 + 0.0166666666666667*G0_7 + 0.133333333333333*G0_11;
+        A[868] = -0.0166666666666667*G0_6 + 0.15*G0_7 + 0.2*G0_11;
+        A[869] = 0.0;
+        A[870] = 0.0;
+        A[871] = 0.0;
+        A[872] = 0.0;
+        A[873] = 0.0;
+        A[874] = 0.0;
+        A[875] = 0.0;
+        A[876] = 0.0;
+        A[877] = 0.0;
+        A[878] = 0.0;
+        A[879] = 0.0;
+        A[880] = 0.0;
+        A[881] = 0.0;
+        A[882] = 0.0;
+        A[883] = 0.0;
+        A[884] = 0.0;
+        A[885] = 0.0;
+        A[886] = 0.0;
+        A[887] = 0.0;
+        A[888] = 0.0;
+        A[889] = 0.0;
+        A[890] = 0.0;
+        A[891] = 0.0;
+        A[892] = 0.0;
+        A[893] = 0.0;
+        A[894] = 0.0;
+        A[895] = 0.0;
+        A[896] = 0.0;
+        A[897] = 0.0;
+        A[898] = 0.0;
+        A[899] = 0.0;
+          break;
+        }
+      }
+      
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivenavierstokes_cell_integral_6_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_cell_integral_6_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_cell_integral_6_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W16[16] = {0.0235683681933823, 0.0353880678980859, 0.0225840492823699, 0.00542322591052525, 0.0441850885223617, 0.0663442161070497, 0.0423397245217463, 0.0101672595644788, 0.0441850885223617, 0.0663442161070497, 0.0423397245217463, 0.0101672595644788, 0.0235683681933823, 0.0353880678980859, 0.0225840492823699, 0.00542322591052525};
+    // Quadrature points on the UFC reference element: (0.0654669945550145, 0.0571041961145177), (0.0502101232113698, 0.276843013638124), (0.028912084224389, 0.583590432368917), (0.00970378512694614, 0.860240135656219), (0.311164552244357, 0.0571041961145177), (0.238648659731443, 0.276843013638124), (0.137419104134574, 0.583590432368917), (0.0461220799064521, 0.860240135656219), (0.631731251641125, 0.0571041961145177), (0.484508326630433, 0.276843013638124), (0.278990463496509, 0.583590432368917), (0.0936377844373285, 0.860240135656219), (0.877428809330468, 0.0571041961145177), (0.672946863150506, 0.276843013638124), (0.387497483406694, 0.583590432368917), (0.130056079216834, 0.860240135656219)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[16][6] = \
+    {{0.662333821555697, -0.0568951398028818, -0.0505824176867471, 0.0149537603843903, 0.200419467218139, 0.229770508331402},
+    {0.232768098097707, -0.0451680102655678, -0.123558905237647, 0.0556012872999084, 0.745202550451633, 0.135154979653967},
+    {-0.0871888841136516, -0.0272402669959926, 0.0975651531361618, 0.0674912629327908, 0.904559295532719, 0.0448134395079725},
+    {-0.0962269117343233, -0.0095154582353662, 0.619786046331442, 0.0333903417359317, 0.447517836913622, 0.00504814498869295},
+    {0.166437496959, -0.117517795097495, -0.0505824176867471, 0.0710752064609913, 0.144298021141538, 0.786289488222712},
+    {-0.0150116894819879, -0.124742294148215, -0.123558905237647, 0.264272856643007, 0.536530981108534, 0.462509051116308},
+    {-0.123319106052515, -0.0996510837722764, 0.0975651531361618, 0.320785897590582, 0.651264660874928, 0.15335447822312},
+    {-0.0761017150886652, -0.0418675873966577, 0.619786046331442, 0.158704257101893, 0.322203921547661, 0.0172750775043263},
+    {-0.117517795097495, 0.166437496959, -0.0505824176867471, 0.144298021141538, 0.0710752064609913, 0.786289488222712},
+    {-0.124742294148215, -0.0150116894819881, -0.123558905237647, 0.536530981108534, 0.264272856643007, 0.462509051116308},
+    {-0.0996510837722763, -0.123319106052515, 0.0975651531361618, 0.651264660874928, 0.320785897590582, 0.15335447822312},
+    {-0.0418675873966577, -0.0761017150886653, 0.619786046331442, 0.322203921547661, 0.158704257101893, 0.0172750775043263},
+    {-0.0568951398028819, 0.662333821555697, -0.0505824176867471, 0.200419467218139, 0.0149537603843903, 0.229770508331402},
+    {-0.0451680102655678, 0.232768098097706, -0.123558905237647, 0.745202550451633, 0.0556012872999085, 0.135154979653967},
+    {-0.0272402669959926, -0.0871888841136518, 0.0975651531361618, 0.904559295532719, 0.0674912629327909, 0.0448134395079725},
+    {-0.00951545823536613, -0.0962269117343234, 0.619786046331442, 0.447517836913623, 0.0333903417359314, 0.0050481449886929}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[6] = {6, 7, 8, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[6] = {0, 1, 2, 3, 4, 5};
+    
+    static const double FE0_D01[16][5] = \
+    {{-2.50971523732187, -0.771583215541929, 0.261867978220058, 3.2812984528638, -0.261867978220057},
+    {-1.69178745260203, 0.107372054552495, 0.200840492845478, 1.58441539804953, -0.200840492845478},
+    {-0.549989933626777, 1.33436172947567, 0.115648336897555, -0.78437179584889, -0.115648336897555},
+    {0.479775683132663, 2.44096054262488, 0.0388151405077832, -2.92073622575754, -0.038815140507784},
+    {-1.5269250065645, -0.771583215541929, 1.24465820897743, 2.29850822210643, -1.24465820897743},
+    {-0.938033306521733, 0.107372054552495, 0.954594638925771, 0.830661251969238, -0.954594638925771},
+    {-0.115961853986035, 1.33436172947567, 0.549676416538296, -1.21839987548963, -0.549676416538296},
+    {0.625448862250686, 2.44096054262488, 0.184488319625807, -3.06640940487556, -0.184488319625808},
+    {-0.244658208977428, -0.771583215541929, 2.5269250065645, 1.01624142451936, -2.5269250065645},
+    {0.0454053610742289, 0.107372054552495, 1.93803330652173, -0.152777415626724, -1.93803330652173},
+    {0.450323583461703, 1.33436172947567, 1.11596185398603, -1.78468531293737, -1.11596185398603},
+    {0.815511680374192, 2.44096054262488, 0.374551137749312, -3.25647222299907, -0.374551137749314},
+    {0.738132021779943, -0.771583215541929, 3.50971523732187, 0.0334511937619875, -3.50971523732187},
+    {0.799159507154522, 0.107372054552495, 2.69178745260202, -0.906531561707016, -2.69178745260202},
+    {0.884351663102444, 1.33436172947567, 1.54998993362678, -2.21871339257811, -1.54998993362678},
+    {0.961184859492216, 2.44096054262488, 0.520224316867337, -3.40214540211709, -0.520224316867338}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[5] = {6, 8, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[5] = {0, 2, 3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE0_D10[16][5] = \
+    {{-2.50971523732187, -0.738132021779943, 0.228416784458069, -0.228416784458069, 3.24784725910181},
+    {-1.69178745260203, -0.799159507154522, 1.10737205455249, -1.10737205455249, 2.49094695975655},
+    {-0.549989933626777, -0.884351663102445, 2.33436172947567, -2.33436172947567, 1.43434159672922},
+    {0.479775683132663, -0.961184859492216, 3.44096054262487, -3.44096054262487, 0.481409176359552},
+    {-1.5269250065645, 0.244658208977429, 0.228416784458069, -0.228416784458069, 1.28226679758707},
+    {-0.938033306521733, -0.0454053610742286, 1.10737205455249, -1.10737205455249, 0.983438667595961},
+    {-0.115961853986035, -0.450323583461703, 2.33436172947567, -2.33436172947567, 0.566285437447738},
+    {0.625448862250687, -0.815511680374192, 3.44096054262487, -3.44096054262487, 0.190062818123505},
+    {-0.244658208977428, 1.5269250065645, 0.228416784458069, -0.228416784458069, -1.28226679758707},
+    {0.0454053610742286, 0.938033306521733, 1.10737205455249, -1.10737205455249, -0.983438667595962},
+    {0.450323583461703, 0.115961853986035, 2.33436172947567, -2.33436172947567, -0.566285437447738},
+    {0.815511680374193, -0.625448862250686, 3.44096054262487, -3.44096054262487, -0.190062818123507},
+    {0.738132021779942, 2.50971523732187, 0.228416784458069, -0.228416784458069, -3.24784725910181},
+    {0.799159507154521, 1.69178745260203, 1.10737205455249, -1.10737205455249, -2.49094695975655},
+    {0.884351663102445, 0.549989933626777, 2.33436172947567, -2.33436172947567, -1.43434159672922},
+    {0.961184859492217, -0.479775683132662, 3.44096054262487, -3.44096054262487, -0.481409176359555}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[5] = {0, 1, 3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[5] = {6, 7, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[5] = {0, 1, 3, 4, 5};
+    
+    static const double FE1_C0[16][3] = \
+    {{0.877428809330468, 0.0654669945550145, 0.0571041961145176},
+    {0.672946863150506, 0.0502101232113698, 0.276843013638124},
+    {0.387497483406694, 0.028912084224389, 0.583590432368917},
+    {0.130056079216834, 0.0097037851269462, 0.860240135656219},
+    {0.631731251641125, 0.311164552244357, 0.0571041961145176},
+    {0.484508326630433, 0.238648659731443, 0.276843013638124},
+    {0.278990463496509, 0.137419104134574, 0.583590432368917},
+    {0.0936377844373285, 0.0461220799064521, 0.860240135656219},
+    {0.311164552244357, 0.631731251641125, 0.0571041961145176},
+    {0.238648659731443, 0.484508326630433, 0.276843013638124},
+    {0.137419104134574, 0.278990463496509, 0.583590432368917},
+    {0.0461220799064521, 0.0936377844373286, 0.860240135656219},
+    {0.0654669945550145, 0.877428809330468, 0.0571041961145176},
+    {0.0502101232113698, 0.672946863150506, 0.276843013638124},
+    {0.028912084224389, 0.387497483406694, 0.583590432368917},
+    {0.00970378512694609, 0.130056079216835, 0.860240135656219}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[3] = {12, 13, 14};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 23.
+    double G[11];
+    G[0] =  - K[0]*det;
+    G[1] =  - K[2]*det;
+    G[2] =  - K[1]*det;
+    G[3] =  - K[3]*det;
+    G[4] = K[0]*det;
+    G[5] =  - det*w[2][0]*(K[0]*K[0] + K[1]*K[1]);
+    G[6] =  - det*w[2][0]*(K[0]*K[2] + K[1]*K[3]);
+    G[7] = K[3]*det;
+    G[8] =  - det*w[2][0]*(K[2]*K[2] + K[3]*K[3]);
+    G[9] = K[1]*det;
+    G[10] = K[2]*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 4720
+    for (unsigned int ip = 0; ip < 16; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      double F9 = 0.0;
+      double F10 = 0.0;
+      double F11 = 0.0;
+      double F12 = 0.0;
+      
+      // Total number of operations to compute function values = 12
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F3 += FE1_C0[ip][r]*w[3][nzc14[r]];
+        F12 += FE1_C0[ip][r]*w[0][nzc14[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 60
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F4 += FE0_D10[ip][r]*w[0][nzc10[r]];
+        F5 += FE0_D01[ip][r]*w[0][nzc9[r]];
+        F8 += FE0_D10[ip][r]*w[0][nzc13[r]];
+        F9 += FE0_D01[ip][r]*w[0][nzc12[r]];
+        F10 += FE0_D10[ip][r]*w[4][nzc1[r]];
+        F11 += FE0_D01[ip][r]*w[4][nzc0[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 60
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F0 += FE0[ip][r]*w[3][nzc8[r]];
+        F1 += FE0[ip][r]*w[4][r];
+        F2 += FE0[ip][r]*w[3][nzc11[r]];
+        F6 += FE0[ip][r]*w[0][nzc8[r]];
+        F7 += FE0[ip][r]*w[0][nzc11[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 93
+      double I[7];
+      // Number of operations: 11
+      I[0] = F1*W16[ip]*(F4*G[0] + F5*G[1] + F8*G[2] + F9*G[3] - F3*det);
+      
+      // Number of operations: 7
+      I[1] = F1*W16[ip]*(F12*G[4] + F4*G[5] + F5*G[6]);
+      
+      // Number of operations: 7
+      I[2] = F1*W16[ip]*(F12*G[7] + F8*G[6] + F9*G[8]);
+      
+      // Number of operations: 7
+      I[3] = F1*W16[ip]*(F12*G[9] + F8*G[5] + F9*G[6]);
+      
+      // Number of operations: 7
+      I[4] = F1*W16[ip]*(F12*G[10] + F4*G[6] + F5*G[8]);
+      
+      // Number of operations: 27
+      I[5] = W16[ip]*(F1*(F8*(F6*G[0] + F7*G[2]) + F9*(F6*G[1] + F7*G[3]) - F2*det) + F10*(F12*G[9] + F8*G[5] + F9*G[6]) + F11*(F12*G[7] + F8*G[6] + F9*G[8]));
+      
+      // Number of operations: 27
+      I[6] = W16[ip]*(F1*(F6*(F4*G[0] + F5*G[1]) + F7*(F4*G[2] + F5*G[3]) - F0*det) + F10*(F12*G[4] + F4*G[5] + F5*G[6]) + F11*(F12*G[10] + F4*G[6] + F5*G[8]));
+      
+      
+      // Number of operations for primary indices: 6
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc14[j]] += FE1_C0[ip][j]*I[0];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 40
+      for (unsigned int j = 0; j < 5; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc10[j]] += FE0_D10[ip][j]*I[1];
+        // Number of operations to compute entry: 2
+        A[nzc12[j]] += FE0_D01[ip][j]*I[2];
+        // Number of operations to compute entry: 2
+        A[nzc13[j]] += FE0_D10[ip][j]*I[3];
+        // Number of operations to compute entry: 2
+        A[nzc9[j]] += FE0_D01[ip][j]*I[4];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 24
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc11[j]] += FE0[ip][j]*I[5];
+        // Number of operations to compute entry: 2
+        A[nzc8[j]] += FE0[ip][j]*I[6];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivenavierstokes_exterior_facet_integral_6_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_exterior_facet_integral_6_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_exterior_facet_integral_6_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true, false, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates[2*facet] - vertex_coordinates[2*v0]) - dx0*(vertex_coordinates[2*facet + 1] - vertex_coordinates[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n0 = direction ? dx1 / det : -dx1 / det;
+    const double n1 = direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.277777777777778, 0.444444444444444, 0.277777777777778};
+    // Quadrature points on the UFC reference element: (0.112701665379258), (0.5), (0.887298334620742)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[3][2] = \
+    {{0.887298334620742, 0.112701665379258},
+    {0.5, 0.5},
+    {0.112701665379258, 0.887298334620742}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    static const double FE1_f0[3][3] = \
+    {{0.687298334620742, -0.0872983346207417, 0.4},
+    {0.0, 0.0, 1.0},
+    {-0.0872983346207416, 0.687298334620742, 0.4}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc20[3] = {6, 8, 10};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[3] = {0, 2, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[3] = {0, 1, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[3] = {0, 2, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[3] = {1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc22[3] = {0, 1, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc23[3] = {6, 7, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[3] = {1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[3] = {7, 8, 9};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 2.
+    double G[2];
+    G[0] =  - det*n0;
+    G[1] =  - det*n1;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 84
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 84
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc0[r]];
+        } // end loop over 'r'
+        
+        // Total number of operations to compute function values = 6
+        for (unsigned int r = 0; r < 3; r++)
+        {
+          F1 += FE1_f0[ip][r]*w[4][nzc3[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 6
+        double I[2];
+        // Number of operations: 3
+        I[0] = F0*F1*G[0]*W3[ip];
+        
+        // Number of operations: 3
+        I[1] = F0*F1*G[1]*W3[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc16[j]] += FE1_f0[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc17[j]] += FE1_f0[ip][j]*I[1];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 84
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 84
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc1[r]];
+        } // end loop over 'r'
+        
+        // Total number of operations to compute function values = 6
+        for (unsigned int r = 0; r < 3; r++)
+        {
+          F1 += FE1_f0[ip][r]*w[4][nzc4[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 6
+        double I[2];
+        // Number of operations: 3
+        I[0] = F0*F1*G[0]*W3[ip];
+        
+        // Number of operations: 3
+        I[1] = F0*F1*G[1]*W3[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc19[j]] += FE1_f0[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc20[j]] += FE1_f0[ip][j]*I[1];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 84
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 84
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc2[r]];
+        } // end loop over 'r'
+        
+        // Total number of operations to compute function values = 6
+        for (unsigned int r = 0; r < 3; r++)
+        {
+          F1 += FE1_f0[ip][r]*w[4][nzc5[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 6
+        double I[2];
+        // Number of operations: 3
+        I[0] = F0*F1*G[0]*W3[ip];
+        
+        // Number of operations: 3
+        I[1] = F0*F1*G[1]*W3[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc22[j]] += FE1_f0[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc23[j]] += FE1_f0[ip][j]*I[1];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivenavierstokes_cell_integral_7_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_cell_integral_7_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_cell_integral_7_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    292
+    // Number of operations (multiply-add pairs) for tensor contraction: 194
+    // Total number of operations (multiply-add pairs):                  489
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[1][0]*w[0][0]*(1.0);
+    const double G0_0_1 = det*w[1][0]*w[0][1]*(1.0);
+    const double G0_0_2 = det*w[1][0]*w[0][2]*(1.0);
+    const double G0_0_3 = det*w[1][0]*w[0][3]*(1.0);
+    const double G0_0_4 = det*w[1][0]*w[0][4]*(1.0);
+    const double G0_0_5 = det*w[1][0]*w[0][5]*(1.0);
+    const double G0_0_6 = det*w[1][0]*w[0][6]*(1.0);
+    const double G0_0_7 = det*w[1][0]*w[0][7]*(1.0);
+    const double G0_0_8 = det*w[1][0]*w[0][8]*(1.0);
+    const double G0_0_9 = det*w[1][0]*w[0][9]*(1.0);
+    const double G0_1_0 = det*w[1][1]*w[0][0]*(1.0);
+    const double G0_1_1 = det*w[1][1]*w[0][1]*(1.0);
+    const double G0_1_2 = det*w[1][1]*w[0][2]*(1.0);
+    const double G0_1_3 = det*w[1][1]*w[0][3]*(1.0);
+    const double G0_1_4 = det*w[1][1]*w[0][4]*(1.0);
+    const double G0_1_5 = det*w[1][1]*w[0][5]*(1.0);
+    const double G0_1_6 = det*w[1][1]*w[0][6]*(1.0);
+    const double G0_1_7 = det*w[1][1]*w[0][7]*(1.0);
+    const double G0_1_8 = det*w[1][1]*w[0][8]*(1.0);
+    const double G0_1_9 = det*w[1][1]*w[0][9]*(1.0);
+    const double G0_2_0 = det*w[1][2]*w[0][0]*(1.0);
+    const double G0_2_1 = det*w[1][2]*w[0][1]*(1.0);
+    const double G0_2_2 = det*w[1][2]*w[0][2]*(1.0);
+    const double G0_2_3 = det*w[1][2]*w[0][3]*(1.0);
+    const double G0_2_4 = det*w[1][2]*w[0][4]*(1.0);
+    const double G0_2_5 = det*w[1][2]*w[0][5]*(1.0);
+    const double G0_2_6 = det*w[1][2]*w[0][6]*(1.0);
+    const double G0_2_7 = det*w[1][2]*w[0][7]*(1.0);
+    const double G0_2_8 = det*w[1][2]*w[0][8]*(1.0);
+    const double G0_2_9 = det*w[1][2]*w[0][9]*(1.0);
+    const double G0_3_0 = det*w[1][3]*w[0][0]*(1.0);
+    const double G0_3_1 = det*w[1][3]*w[0][1]*(1.0);
+    const double G0_3_2 = det*w[1][3]*w[0][2]*(1.0);
+    const double G0_3_3 = det*w[1][3]*w[0][3]*(1.0);
+    const double G0_3_4 = det*w[1][3]*w[0][4]*(1.0);
+    const double G0_3_5 = det*w[1][3]*w[0][5]*(1.0);
+    const double G0_3_6 = det*w[1][3]*w[0][6]*(1.0);
+    const double G0_3_7 = det*w[1][3]*w[0][7]*(1.0);
+    const double G0_3_8 = det*w[1][3]*w[0][8]*(1.0);
+    const double G0_3_9 = det*w[1][3]*w[0][9]*(1.0);
+    const double G0_4_0 = det*w[1][4]*w[0][0]*(1.0);
+    const double G0_4_1 = det*w[1][4]*w[0][1]*(1.0);
+    const double G0_4_2 = det*w[1][4]*w[0][2]*(1.0);
+    const double G0_4_3 = det*w[1][4]*w[0][3]*(1.0);
+    const double G0_4_4 = det*w[1][4]*w[0][4]*(1.0);
+    const double G0_4_5 = det*w[1][4]*w[0][5]*(1.0);
+    const double G0_4_6 = det*w[1][4]*w[0][6]*(1.0);
+    const double G0_4_7 = det*w[1][4]*w[0][7]*(1.0);
+    const double G0_4_8 = det*w[1][4]*w[0][8]*(1.0);
+    const double G0_4_9 = det*w[1][4]*w[0][9]*(1.0);
+    const double G0_5_0 = det*w[1][5]*w[0][0]*(1.0);
+    const double G0_5_1 = det*w[1][5]*w[0][1]*(1.0);
+    const double G0_5_2 = det*w[1][5]*w[0][2]*(1.0);
+    const double G0_5_3 = det*w[1][5]*w[0][3]*(1.0);
+    const double G0_5_4 = det*w[1][5]*w[0][4]*(1.0);
+    const double G0_5_5 = det*w[1][5]*w[0][5]*(1.0);
+    const double G0_5_6 = det*w[1][5]*w[0][6]*(1.0);
+    const double G0_5_7 = det*w[1][5]*w[0][7]*(1.0);
+    const double G0_5_8 = det*w[1][5]*w[0][8]*(1.0);
+    const double G0_5_9 = det*w[1][5]*w[0][9]*(1.0);
+    const double G0_6_10 = det*w[1][6]*w[0][10]*(1.0);
+    const double G0_6_11 = det*w[1][6]*w[0][11]*(1.0);
+    const double G0_6_12 = det*w[1][6]*w[0][12]*(1.0);
+    const double G0_6_13 = det*w[1][6]*w[0][13]*(1.0);
+    const double G0_6_14 = det*w[1][6]*w[0][14]*(1.0);
+    const double G0_6_15 = det*w[1][6]*w[0][15]*(1.0);
+    const double G0_6_16 = det*w[1][6]*w[0][16]*(1.0);
+    const double G0_6_17 = det*w[1][6]*w[0][17]*(1.0);
+    const double G0_6_18 = det*w[1][6]*w[0][18]*(1.0);
+    const double G0_6_19 = det*w[1][6]*w[0][19]*(1.0);
+    const double G0_7_10 = det*w[1][7]*w[0][10]*(1.0);
+    const double G0_7_11 = det*w[1][7]*w[0][11]*(1.0);
+    const double G0_7_12 = det*w[1][7]*w[0][12]*(1.0);
+    const double G0_7_13 = det*w[1][7]*w[0][13]*(1.0);
+    const double G0_7_14 = det*w[1][7]*w[0][14]*(1.0);
+    const double G0_7_15 = det*w[1][7]*w[0][15]*(1.0);
+    const double G0_7_16 = det*w[1][7]*w[0][16]*(1.0);
+    const double G0_7_17 = det*w[1][7]*w[0][17]*(1.0);
+    const double G0_7_18 = det*w[1][7]*w[0][18]*(1.0);
+    const double G0_7_19 = det*w[1][7]*w[0][19]*(1.0);
+    const double G0_8_10 = det*w[1][8]*w[0][10]*(1.0);
+    const double G0_8_11 = det*w[1][8]*w[0][11]*(1.0);
+    const double G0_8_12 = det*w[1][8]*w[0][12]*(1.0);
+    const double G0_8_13 = det*w[1][8]*w[0][13]*(1.0);
+    const double G0_8_14 = det*w[1][8]*w[0][14]*(1.0);
+    const double G0_8_15 = det*w[1][8]*w[0][15]*(1.0);
+    const double G0_8_16 = det*w[1][8]*w[0][16]*(1.0);
+    const double G0_8_17 = det*w[1][8]*w[0][17]*(1.0);
+    const double G0_8_18 = det*w[1][8]*w[0][18]*(1.0);
+    const double G0_8_19 = det*w[1][8]*w[0][19]*(1.0);
+    const double G0_9_10 = det*w[1][9]*w[0][10]*(1.0);
+    const double G0_9_11 = det*w[1][9]*w[0][11]*(1.0);
+    const double G0_9_12 = det*w[1][9]*w[0][12]*(1.0);
+    const double G0_9_13 = det*w[1][9]*w[0][13]*(1.0);
+    const double G0_9_14 = det*w[1][9]*w[0][14]*(1.0);
+    const double G0_9_15 = det*w[1][9]*w[0][15]*(1.0);
+    const double G0_9_16 = det*w[1][9]*w[0][16]*(1.0);
+    const double G0_9_17 = det*w[1][9]*w[0][17]*(1.0);
+    const double G0_9_18 = det*w[1][9]*w[0][18]*(1.0);
+    const double G0_9_19 = det*w[1][9]*w[0][19]*(1.0);
+    const double G0_10_10 = det*w[1][10]*w[0][10]*(1.0);
+    const double G0_10_11 = det*w[1][10]*w[0][11]*(1.0);
+    const double G0_10_12 = det*w[1][10]*w[0][12]*(1.0);
+    const double G0_10_13 = det*w[1][10]*w[0][13]*(1.0);
+    const double G0_10_14 = det*w[1][10]*w[0][14]*(1.0);
+    const double G0_10_15 = det*w[1][10]*w[0][15]*(1.0);
+    const double G0_10_16 = det*w[1][10]*w[0][16]*(1.0);
+    const double G0_10_17 = det*w[1][10]*w[0][17]*(1.0);
+    const double G0_10_18 = det*w[1][10]*w[0][18]*(1.0);
+    const double G0_10_19 = det*w[1][10]*w[0][19]*(1.0);
+    const double G0_11_10 = det*w[1][11]*w[0][10]*(1.0);
+    const double G0_11_11 = det*w[1][11]*w[0][11]*(1.0);
+    const double G0_11_12 = det*w[1][11]*w[0][12]*(1.0);
+    const double G0_11_13 = det*w[1][11]*w[0][13]*(1.0);
+    const double G0_11_14 = det*w[1][11]*w[0][14]*(1.0);
+    const double G0_11_15 = det*w[1][11]*w[0][15]*(1.0);
+    const double G0_11_16 = det*w[1][11]*w[0][16]*(1.0);
+    const double G0_11_17 = det*w[1][11]*w[0][17]*(1.0);
+    const double G0_11_18 = det*w[1][11]*w[0][18]*(1.0);
+    const double G0_11_19 = det*w[1][11]*w[0][19]*(1.0);
+    const double G0_12_20 = det*w[1][12]*w[0][20]*(1.0);
+    const double G0_12_21 = det*w[1][12]*w[0][21]*(1.0);
+    const double G0_12_22 = det*w[1][12]*w[0][22]*(1.0);
+    const double G0_12_23 = det*w[1][12]*w[0][23]*(1.0);
+    const double G0_12_24 = det*w[1][12]*w[0][24]*(1.0);
+    const double G0_12_25 = det*w[1][12]*w[0][25]*(1.0);
+    const double G0_13_20 = det*w[1][13]*w[0][20]*(1.0);
+    const double G0_13_21 = det*w[1][13]*w[0][21]*(1.0);
+    const double G0_13_22 = det*w[1][13]*w[0][22]*(1.0);
+    const double G0_13_23 = det*w[1][13]*w[0][23]*(1.0);
+    const double G0_13_24 = det*w[1][13]*w[0][24]*(1.0);
+    const double G0_13_25 = det*w[1][13]*w[0][25]*(1.0);
+    const double G0_14_20 = det*w[1][14]*w[0][20]*(1.0);
+    const double G0_14_21 = det*w[1][14]*w[0][21]*(1.0);
+    const double G0_14_22 = det*w[1][14]*w[0][22]*(1.0);
+    const double G0_14_23 = det*w[1][14]*w[0][23]*(1.0);
+    const double G0_14_24 = det*w[1][14]*w[0][24]*(1.0);
+    const double G0_14_25 = det*w[1][14]*w[0][25]*(1.0);
+    const double G1_0_0 = det*w[1][0]*w[3][0]*(1.0);
+    const double G1_0_1 = det*w[1][0]*w[3][1]*(1.0);
+    const double G1_0_2 = det*w[1][0]*w[3][2]*(1.0);
+    const double G1_0_3 = det*w[1][0]*w[3][3]*(1.0);
+    const double G1_1_0 = det*w[1][1]*w[3][0]*(1.0);
+    const double G1_1_1 = det*w[1][1]*w[3][1]*(1.0);
+    const double G1_1_2 = det*w[1][1]*w[3][2]*(1.0);
+    const double G1_1_4 = det*w[1][1]*w[3][4]*(1.0);
+    const double G1_2_0 = det*w[1][2]*w[3][0]*(1.0);
+    const double G1_2_1 = det*w[1][2]*w[3][1]*(1.0);
+    const double G1_2_2 = det*w[1][2]*w[3][2]*(1.0);
+    const double G1_2_5 = det*w[1][2]*w[3][5]*(1.0);
+    const double G1_3_0 = det*w[1][3]*w[3][0]*(1.0);
+    const double G1_3_3 = det*w[1][3]*w[3][3]*(1.0);
+    const double G1_3_4 = det*w[1][3]*w[3][4]*(1.0);
+    const double G1_3_5 = det*w[1][3]*w[3][5]*(1.0);
+    const double G1_4_1 = det*w[1][4]*w[3][1]*(1.0);
+    const double G1_4_3 = det*w[1][4]*w[3][3]*(1.0);
+    const double G1_4_4 = det*w[1][4]*w[3][4]*(1.0);
+    const double G1_4_5 = det*w[1][4]*w[3][5]*(1.0);
+    const double G1_5_2 = det*w[1][5]*w[3][2]*(1.0);
+    const double G1_5_3 = det*w[1][5]*w[3][3]*(1.0);
+    const double G1_5_4 = det*w[1][5]*w[3][4]*(1.0);
+    const double G1_5_5 = det*w[1][5]*w[3][5]*(1.0);
+    const double G1_6_6 = det*w[1][6]*w[3][6]*(1.0);
+    const double G1_6_7 = det*w[1][6]*w[3][7]*(1.0);
+    const double G1_6_8 = det*w[1][6]*w[3][8]*(1.0);
+    const double G1_6_9 = det*w[1][6]*w[3][9]*(1.0);
+    const double G1_7_6 = det*w[1][7]*w[3][6]*(1.0);
+    const double G1_7_7 = det*w[1][7]*w[3][7]*(1.0);
+    const double G1_7_8 = det*w[1][7]*w[3][8]*(1.0);
+    const double G1_7_10 = det*w[1][7]*w[3][10]*(1.0);
+    const double G1_8_6 = det*w[1][8]*w[3][6]*(1.0);
+    const double G1_8_7 = det*w[1][8]*w[3][7]*(1.0);
+    const double G1_8_8 = det*w[1][8]*w[3][8]*(1.0);
+    const double G1_8_11 = det*w[1][8]*w[3][11]*(1.0);
+    const double G1_9_6 = det*w[1][9]*w[3][6]*(1.0);
+    const double G1_9_9 = det*w[1][9]*w[3][9]*(1.0);
+    const double G1_9_10 = det*w[1][9]*w[3][10]*(1.0);
+    const double G1_9_11 = det*w[1][9]*w[3][11]*(1.0);
+    const double G1_10_7 = det*w[1][10]*w[3][7]*(1.0);
+    const double G1_10_9 = det*w[1][10]*w[3][9]*(1.0);
+    const double G1_10_10 = det*w[1][10]*w[3][10]*(1.0);
+    const double G1_10_11 = det*w[1][10]*w[3][11]*(1.0);
+    const double G1_11_8 = det*w[1][11]*w[3][8]*(1.0);
+    const double G1_11_9 = det*w[1][11]*w[3][9]*(1.0);
+    const double G1_11_10 = det*w[1][11]*w[3][10]*(1.0);
+    const double G1_11_11 = det*w[1][11]*w[3][11]*(1.0);
+    const double G1_12_12 = det*w[1][12]*w[3][12]*(1.0);
+    const double G1_12_13 = det*w[1][12]*w[3][13]*(1.0);
+    const double G1_12_14 = det*w[1][12]*w[3][14]*(1.0);
+    const double G1_13_12 = det*w[1][13]*w[3][12]*(1.0);
+    const double G1_13_13 = det*w[1][13]*w[3][13]*(1.0);
+    const double G1_13_14 = det*w[1][13]*w[3][14]*(1.0);
+    const double G1_14_12 = det*w[1][14]*w[3][12]*(1.0);
+    const double G1_14_13 = det*w[1][14]*w[3][13]*(1.0);
+    const double G1_14_14 = det*w[1][14]*w[3][14]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00595238095238095*G0_0_0 + 0.000595238095238095*G0_0_1 + 0.000595238095238098*G0_0_2 - 0.00357142857142857*G0_0_3 - 0.00357142857142857*G0_0_4 + 0.0160714285714286*G0_0_5 - 0.0107142857142857*G0_0_6 + 0.0160714285714286*G0_0_7 - 0.0107142857142857*G0_0_8 - 0.0107142857142857*G0_0_9 + 0.000595238095238095*G0_1_0 + 0.00595238095238094*G0_1_1 + 0.000595238095238096*G0_1_2 + 0.0160714285714286*G0_1_3 - 0.0107142857142857*G0_1_4 - 0.00357142857142856*G0_1_5 - 0.00357142857142858*G0_1_6 - 0.0107142857142857*G0_1_7 + 0.0160714285714286*G0_1_8 - 0.0107142857142857*G0_1_9 + 0.000595238095238098*G0_2_0 + 0.000595238095238097*G0_2_1 + 0.00595238095238094*G0_2_2 - 0.0107142857142857*G0_2_3 + 0.0160714285714286*G0_2_4 - 0.0107142857142857*G0_2_5 + 0.0160714285714286*G0_2_6 - 0.00357142857142857*G0_2_7 - 0.00357142857142857*G0_2_8 - 0.0107142857142857*G0_2_9 + 0.00476190476190475*G0_3_0 + 0.00238095238095238*G0_3_1 + 0.00238095238095237*G0_3_2 + 0.0285714285714286*G0_3_3 + 0.0285714285714285*G0_3_4 - 0.00714285714285712*G0_3_5 + 0.0142857142857143*G0_3_6 - 0.00714285714285714*G0_3_7 + 0.0142857142857143*G0_3_8 + 0.0857142857142857*G0_3_9 + 0.00238095238095237*G0_4_0 + 0.00476190476190477*G0_4_1 + 0.00238095238095237*G0_4_2 - 0.00714285714285712*G0_4_3 + 0.0142857142857143*G0_4_4 + 0.0285714285714286*G0_4_5 + 0.0285714285714286*G0_4_6 + 0.0142857142857143*G0_4_7 - 0.00714285714285712*G0_4_8 + 0.0857142857142857*G0_4_9 + 0.00238095238095237*G0_5_0 + 0.00238095238095238*G0_5_1 + 0.00476190476190475*G0_5_2 + 0.0142857142857143*G0_5_3 - 0.00714285714285714*G0_5_4 + 0.0142857142857143*G0_5_5 - 0.00714285714285714*G0_5_6 + 0.0285714285714286*G0_5_7 + 0.0285714285714286*G0_5_8 + 0.0857142857142857*G0_5_9 + 0.00595238095238095*G0_6_10 + 0.000595238095238095*G0_6_11 + 0.000595238095238098*G0_6_12 - 0.00357142857142857*G0_6_13 - 0.00357142857142857*G0_6_14 + 0.0160714285714286*G0_6_15 - 0.0107142857142857*G0_6_16 + 0.0160714285714286*G0_6_17 - 0.0107142857142857*G0_6_18 - 0.0107142857142857*G0_6_19 + 0.000595238095238095*G0_7_10 + 0.00595238095238094*G0_7_11 + 0.000595238095238096*G0_7_12 + 0.0160714285714286*G0_7_13 - 0.0107142857142857*G0_7_14 - 0.00357142857142856*G0_7_15 - 0.00357142857142858*G0_7_16 - 0.0107142857142857*G0_7_17 + 0.0160714285714286*G0_7_18 - 0.0107142857142857*G0_7_19 + 0.000595238095238098*G0_8_10 + 0.000595238095238097*G0_8_11 + 0.00595238095238094*G0_8_12 - 0.0107142857142857*G0_8_13 + 0.0160714285714286*G0_8_14 - 0.0107142857142857*G0_8_15 + 0.0160714285714286*G0_8_16 - 0.00357142857142857*G0_8_17 - 0.00357142857142857*G0_8_18 - 0.0107142857142857*G0_8_19 + 0.00476190476190475*G0_9_10 + 0.00238095238095238*G0_9_11 + 0.00238095238095237*G0_9_12 + 0.0285714285714286*G0_9_13 + 0.0285714285714285*G0_9_14 - 0.00714285714285712*G0_9_15 + 0.0142857142857143*G0_9_16 - 0.00714285714285714*G0_9_17 + 0.0142857142857143*G0_9_18 + 0.0857142857142857*G0_9_19 + 0.00238095238095237*G0_10_10 + 0.00476190476190477*G0_10_11 + 0.00238095238095237*G0_10_12 - 0.00714285714285712*G0_10_13 + 0.0142857142857143*G0_10_14 + 0.0285714285714286*G0_10_15 + 0.0285714285714286*G0_10_16 + 0.0142857142857143*G0_10_17 - 0.00714285714285712*G0_10_18 + 0.0857142857142857*G0_10_19 + 0.00238095238095237*G0_11_10 + 0.00238095238095238*G0_11_11 + 0.00476190476190475*G0_11_12 + 0.0142857142857143*G0_11_13 - 0.00714285714285714*G0_11_14 + 0.0142857142857143*G0_11_15 - 0.00714285714285714*G0_11_16 + 0.0285714285714286*G0_11_17 + 0.0285714285714286*G0_11_18 + 0.0857142857142857*G0_11_19 + 0.0166666666666667*G0_12_20 - 0.00833333333333333*G0_12_21 - 0.00833333333333332*G0_12_22 + 0.0333333333333333*G0_12_23 + 0.0666666666666667*G0_12_24 + 0.0666666666666667*G0_12_25 - 0.00833333333333333*G0_13_20 + 0.0166666666666666*G0_13_21 - 0.00833333333333333*G0_13_22 + 0.0666666666666666*G0_13_23 + 0.0333333333333333*G0_13_24 + 0.0666666666666667*G0_13_25 - 0.00833333333333332*G0_14_20 - 0.00833333333333333*G0_14_21 + 0.0166666666666667*G0_14_22 + 0.0666666666666666*G0_14_23 + 0.0666666666666667*G0_14_24 + 0.0333333333333333*G0_14_25 - 0.0166666666666667*G1_0_0 + 0.00277777777777778*G1_0_1 + 0.00277777777777778*G1_0_2 + 0.0111111111111111*G1_0_3 + 0.00277777777777778*G1_1_0 - 0.0166666666666666*G1_1_1 + 0.00277777777777777*G1_1_2 + 0.0111111111111111*G1_1_4 + 0.00277777777777778*G1_2_0 + 0.00277777777777778*G1_2_1 - 0.0166666666666666*G1_2_2 + 0.0111111111111111*G1_2_5 + 0.0111111111111111*G1_3_0 - 0.0888888888888888*G1_3_3 - 0.0444444444444444*G1_3_4 - 0.0444444444444444*G1_3_5 + 0.0111111111111111*G1_4_1 - 0.0444444444444444*G1_4_3 - 0.0888888888888889*G1_4_4 - 0.0444444444444444*G1_4_5 + 0.0111111111111111*G1_5_2 - 0.0444444444444444*G1_5_3 - 0.0444444444444444*G1_5_4 - 0.0888888888888889*G1_5_5 - 0.0166666666666667*G1_6_6 + 0.00277777777777778*G1_6_7 + 0.00277777777777778*G1_6_8 + 0.0111111111111111*G1_6_9 + 0.00277777777777778*G1_7_6 - 0.0166666666666666*G1_7_7 + 0.00277777777777777*G1_7_8 + 0.0111111111111111*G1_7_10 + 0.00277777777777778*G1_8_6 + 0.00277777777777778*G1_8_7 - 0.0166666666666666*G1_8_8 + 0.0111111111111111*G1_8_11 + 0.0111111111111111*G1_9_6 - 0.0888888888888888*G1_9_9 - 0.0444444444444444*G1_9_10 - 0.0444444444444444*G1_9_11 + 0.0111111111111111*G1_10_7 - 0.0444444444444444*G1_10_9 - 0.0888888888888889*G1_10_10 - 0.0444444444444444*G1_10_11 + 0.0111111111111111*G1_11_8 - 0.0444444444444444*G1_11_9 - 0.0444444444444444*G1_11_10 - 0.0888888888888889*G1_11_11 - 0.0833333333333334*G1_12_12 - 0.0416666666666667*G1_12_13 - 0.0416666666666667*G1_12_14 - 0.0416666666666667*G1_13_12 - 0.0833333333333333*G1_13_13 - 0.0416666666666667*G1_13_14 - 0.0416666666666667*G1_14_12 - 0.0416666666666667*G1_14_13 - 0.0833333333333333*G1_14_14;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivenavierstokes_exterior_facet_integral_7_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_exterior_facet_integral_7_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_exterior_facet_integral_7_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    180
+    // Number of operations (multiply-add pairs) for tensor contraction: 136
+    // Total number of operations (multiply-add pairs):                  326
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[2][0]*w[0][0]*(1.0);
+    const double G0_0_5 = det*w[2][0]*w[0][5]*(1.0);
+    const double G0_0_6 = det*w[2][0]*w[0][6]*(1.0);
+    const double G0_0_7 = det*w[2][0]*w[0][7]*(1.0);
+    const double G0_0_8 = det*w[2][0]*w[0][8]*(1.0);
+    const double G0_1_1 = det*w[2][1]*w[0][1]*(1.0);
+    const double G0_1_3 = det*w[2][1]*w[0][3]*(1.0);
+    const double G0_1_4 = det*w[2][1]*w[0][4]*(1.0);
+    const double G0_1_7 = det*w[2][1]*w[0][7]*(1.0);
+    const double G0_1_8 = det*w[2][1]*w[0][8]*(1.0);
+    const double G0_2_2 = det*w[2][2]*w[0][2]*(1.0);
+    const double G0_2_3 = det*w[2][2]*w[0][3]*(1.0);
+    const double G0_2_4 = det*w[2][2]*w[0][4]*(1.0);
+    const double G0_2_5 = det*w[2][2]*w[0][5]*(1.0);
+    const double G0_2_6 = det*w[2][2]*w[0][6]*(1.0);
+    const double G0_3_1 = det*w[2][3]*w[0][1]*(1.0);
+    const double G0_3_2 = det*w[2][3]*w[0][2]*(1.0);
+    const double G0_3_3 = det*w[2][3]*w[0][3]*(1.0);
+    const double G0_3_4 = det*w[2][3]*w[0][4]*(1.0);
+    const double G0_4_0 = det*w[2][4]*w[0][0]*(1.0);
+    const double G0_4_2 = det*w[2][4]*w[0][2]*(1.0);
+    const double G0_4_5 = det*w[2][4]*w[0][5]*(1.0);
+    const double G0_4_6 = det*w[2][4]*w[0][6]*(1.0);
+    const double G0_5_0 = det*w[2][5]*w[0][0]*(1.0);
+    const double G0_5_1 = det*w[2][5]*w[0][1]*(1.0);
+    const double G0_5_7 = det*w[2][5]*w[0][7]*(1.0);
+    const double G0_5_8 = det*w[2][5]*w[0][8]*(1.0);
+    const double G0_6_10 = det*w[2][6]*w[0][10]*(1.0);
+    const double G0_6_15 = det*w[2][6]*w[0][15]*(1.0);
+    const double G0_6_16 = det*w[2][6]*w[0][16]*(1.0);
+    const double G0_6_17 = det*w[2][6]*w[0][17]*(1.0);
+    const double G0_6_18 = det*w[2][6]*w[0][18]*(1.0);
+    const double G0_7_11 = det*w[2][7]*w[0][11]*(1.0);
+    const double G0_7_13 = det*w[2][7]*w[0][13]*(1.0);
+    const double G0_7_14 = det*w[2][7]*w[0][14]*(1.0);
+    const double G0_7_17 = det*w[2][7]*w[0][17]*(1.0);
+    const double G0_7_18 = det*w[2][7]*w[0][18]*(1.0);
+    const double G0_8_12 = det*w[2][8]*w[0][12]*(1.0);
+    const double G0_8_13 = det*w[2][8]*w[0][13]*(1.0);
+    const double G0_8_14 = det*w[2][8]*w[0][14]*(1.0);
+    const double G0_8_15 = det*w[2][8]*w[0][15]*(1.0);
+    const double G0_8_16 = det*w[2][8]*w[0][16]*(1.0);
+    const double G0_9_11 = det*w[2][9]*w[0][11]*(1.0);
+    const double G0_9_12 = det*w[2][9]*w[0][12]*(1.0);
+    const double G0_9_13 = det*w[2][9]*w[0][13]*(1.0);
+    const double G0_9_14 = det*w[2][9]*w[0][14]*(1.0);
+    const double G0_10_10 = det*w[2][10]*w[0][10]*(1.0);
+    const double G0_10_12 = det*w[2][10]*w[0][12]*(1.0);
+    const double G0_10_15 = det*w[2][10]*w[0][15]*(1.0);
+    const double G0_10_16 = det*w[2][10]*w[0][16]*(1.0);
+    const double G0_11_10 = det*w[2][11]*w[0][10]*(1.0);
+    const double G0_11_11 = det*w[2][11]*w[0][11]*(1.0);
+    const double G0_11_17 = det*w[2][11]*w[0][17]*(1.0);
+    const double G0_11_18 = det*w[2][11]*w[0][18]*(1.0);
+    const double G0_12_20 = det*w[2][12]*w[0][20]*(1.0);
+    const double G0_12_24 = det*w[2][12]*w[0][24]*(1.0);
+    const double G0_12_25 = det*w[2][12]*w[0][25]*(1.0);
+    const double G0_13_21 = det*w[2][13]*w[0][21]*(1.0);
+    const double G0_13_23 = det*w[2][13]*w[0][23]*(1.0);
+    const double G0_13_25 = det*w[2][13]*w[0][25]*(1.0);
+    const double G0_14_22 = det*w[2][14]*w[0][22]*(1.0);
+    const double G0_14_23 = det*w[2][14]*w[0][23]*(1.0);
+    const double G0_14_24 = det*w[2][14]*w[0][24]*(1.0);
+    const double G1_0_0 = det*w[2][0]*w[3][0]*(1.0);
+    const double G1_0_1 = det*w[2][0]*w[3][1]*(1.0);
+    const double G1_0_2 = det*w[2][0]*w[3][2]*(1.0);
+    const double G1_0_4 = det*w[2][0]*w[3][4]*(1.0);
+    const double G1_0_5 = det*w[2][0]*w[3][5]*(1.0);
+    const double G1_1_0 = det*w[2][1]*w[3][0]*(1.0);
+    const double G1_1_1 = det*w[2][1]*w[3][1]*(1.0);
+    const double G1_1_2 = det*w[2][1]*w[3][2]*(1.0);
+    const double G1_1_3 = det*w[2][1]*w[3][3]*(1.0);
+    const double G1_1_5 = det*w[2][1]*w[3][5]*(1.0);
+    const double G1_2_0 = det*w[2][2]*w[3][0]*(1.0);
+    const double G1_2_1 = det*w[2][2]*w[3][1]*(1.0);
+    const double G1_2_2 = det*w[2][2]*w[3][2]*(1.0);
+    const double G1_2_3 = det*w[2][2]*w[3][3]*(1.0);
+    const double G1_2_4 = det*w[2][2]*w[3][4]*(1.0);
+    const double G1_3_1 = det*w[2][3]*w[3][1]*(1.0);
+    const double G1_3_2 = det*w[2][3]*w[3][2]*(1.0);
+    const double G1_3_3 = det*w[2][3]*w[3][3]*(1.0);
+    const double G1_4_0 = det*w[2][4]*w[3][0]*(1.0);
+    const double G1_4_2 = det*w[2][4]*w[3][2]*(1.0);
+    const double G1_4_4 = det*w[2][4]*w[3][4]*(1.0);
+    const double G1_5_0 = det*w[2][5]*w[3][0]*(1.0);
+    const double G1_5_1 = det*w[2][5]*w[3][1]*(1.0);
+    const double G1_5_5 = det*w[2][5]*w[3][5]*(1.0);
+    const double G1_6_6 = det*w[2][6]*w[3][6]*(1.0);
+    const double G1_6_7 = det*w[2][6]*w[3][7]*(1.0);
+    const double G1_6_8 = det*w[2][6]*w[3][8]*(1.0);
+    const double G1_6_10 = det*w[2][6]*w[3][10]*(1.0);
+    const double G1_6_11 = det*w[2][6]*w[3][11]*(1.0);
+    const double G1_7_6 = det*w[2][7]*w[3][6]*(1.0);
+    const double G1_7_7 = det*w[2][7]*w[3][7]*(1.0);
+    const double G1_7_8 = det*w[2][7]*w[3][8]*(1.0);
+    const double G1_7_9 = det*w[2][7]*w[3][9]*(1.0);
+    const double G1_7_11 = det*w[2][7]*w[3][11]*(1.0);
+    const double G1_8_6 = det*w[2][8]*w[3][6]*(1.0);
+    const double G1_8_7 = det*w[2][8]*w[3][7]*(1.0);
+    const double G1_8_8 = det*w[2][8]*w[3][8]*(1.0);
+    const double G1_8_9 = det*w[2][8]*w[3][9]*(1.0);
+    const double G1_8_10 = det*w[2][8]*w[3][10]*(1.0);
+    const double G1_9_7 = det*w[2][9]*w[3][7]*(1.0);
+    const double G1_9_8 = det*w[2][9]*w[3][8]*(1.0);
+    const double G1_9_9 = det*w[2][9]*w[3][9]*(1.0);
+    const double G1_10_6 = det*w[2][10]*w[3][6]*(1.0);
+    const double G1_10_8 = det*w[2][10]*w[3][8]*(1.0);
+    const double G1_10_10 = det*w[2][10]*w[3][10]*(1.0);
+    const double G1_11_6 = det*w[2][11]*w[3][6]*(1.0);
+    const double G1_11_7 = det*w[2][11]*w[3][7]*(1.0);
+    const double G1_11_11 = det*w[2][11]*w[3][11]*(1.0);
+    const double G1_12_12 = det*w[2][12]*w[3][12]*(1.0);
+    const double G1_12_13 = det*w[2][12]*w[3][13]*(1.0);
+    const double G1_12_14 = det*w[2][12]*w[3][14]*(1.0);
+    const double G1_13_12 = det*w[2][13]*w[3][12]*(1.0);
+    const double G1_13_13 = det*w[2][13]*w[3][13]*(1.0);
+    const double G1_13_14 = det*w[2][13]*w[3][14]*(1.0);
+    const double G1_14_12 = det*w[2][14]*w[3][12]*(1.0);
+    const double G1_14_13 = det*w[2][14]*w[3][13]*(1.0);
+    const double G1_14_14 = det*w[2][14]*w[3][14]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0916666666666666*G0_1_1 + 0.15*G0_1_3 - 0.075*G0_1_4 + 0.0916666666666666*G0_2_2 - 0.0749999999999999*G0_2_3 + 0.15*G0_2_4 + 0.0333333333333333*G0_3_1 + 0.0333333333333333*G0_3_2 + 0.3*G0_3_3 + 0.3*G0_3_4 + 0.0916666666666666*G0_7_11 + 0.15*G0_7_13 - 0.075*G0_7_14 + 0.0916666666666666*G0_8_12 - 0.0749999999999999*G0_8_13 + 0.15*G0_8_14 + 0.0333333333333333*G0_9_11 + 0.0333333333333333*G0_9_12 + 0.3*G0_9_13 + 0.3*G0_9_14 + 0.166666666666667*G0_13_21 + 0.333333333333333*G0_13_23 + 0.166666666666667*G0_14_22 + 0.333333333333333*G0_14_23 - 0.133333333333333*G1_1_1 + 0.0333333333333333*G1_1_2 - 0.0666666666666666*G1_1_3 + 0.0333333333333333*G1_2_1 - 0.133333333333333*G1_2_2 - 0.0666666666666666*G1_2_3 - 0.0666666666666666*G1_3_1 - 0.0666666666666666*G1_3_2 - 0.533333333333333*G1_3_3 - 0.133333333333333*G1_7_7 + 0.0333333333333333*G1_7_8 - 0.0666666666666666*G1_7_9 + 0.0333333333333333*G1_8_7 - 0.133333333333333*G1_8_8 - 0.0666666666666666*G1_8_9 - 0.0666666666666666*G1_9_7 - 0.0666666666666666*G1_9_8 - 0.533333333333333*G1_9_9 - 0.333333333333333*G1_13_13 - 0.166666666666667*G1_13_14 - 0.166666666666667*G1_14_13 - 0.333333333333333*G1_14_14;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.0916666666666666*G0_0_0 + 0.15*G0_0_5 - 0.0749999999999999*G0_0_6 + 0.0916666666666666*G0_2_2 - 0.0749999999999999*G0_2_5 + 0.15*G0_2_6 + 0.0333333333333333*G0_4_0 + 0.0333333333333333*G0_4_2 + 0.3*G0_4_5 + 0.3*G0_4_6 + 0.0916666666666666*G0_6_10 + 0.15*G0_6_15 - 0.0749999999999999*G0_6_16 + 0.0916666666666666*G0_8_12 - 0.0749999999999999*G0_8_15 + 0.15*G0_8_16 + 0.0333333333333333*G0_10_10 + 0.0333333333333333*G0_10_12 + 0.3*G0_10_15 + 0.3*G0_10_16 + 0.166666666666667*G0_12_20 + 0.333333333333333*G0_12_24 + 0.166666666666667*G0_14_22 + 0.333333333333333*G0_14_24 - 0.133333333333333*G1_0_0 + 0.0333333333333333*G1_0_2 - 0.0666666666666666*G1_0_4 + 0.0333333333333333*G1_2_0 - 0.133333333333333*G1_2_2 - 0.0666666666666666*G1_2_4 - 0.0666666666666666*G1_4_0 - 0.0666666666666666*G1_4_2 - 0.533333333333333*G1_4_4 - 0.133333333333333*G1_6_6 + 0.0333333333333333*G1_6_8 - 0.0666666666666666*G1_6_10 + 0.0333333333333333*G1_8_6 - 0.133333333333333*G1_8_8 - 0.0666666666666666*G1_8_10 - 0.0666666666666666*G1_10_6 - 0.0666666666666666*G1_10_8 - 0.533333333333333*G1_10_10 - 0.333333333333333*G1_12_12 - 0.166666666666667*G1_12_14 - 0.166666666666667*G1_14_12 - 0.333333333333333*G1_14_14;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.0916666666666666*G0_0_0 + 0.15*G0_0_7 - 0.0749999999999999*G0_0_8 + 0.0916666666666666*G0_1_1 - 0.075*G0_1_7 + 0.15*G0_1_8 + 0.0333333333333332*G0_5_0 + 0.0333333333333333*G0_5_1 + 0.3*G0_5_7 + 0.3*G0_5_8 + 0.0916666666666666*G0_6_10 + 0.15*G0_6_17 - 0.0749999999999999*G0_6_18 + 0.0916666666666666*G0_7_11 - 0.075*G0_7_17 + 0.15*G0_7_18 + 0.0333333333333332*G0_11_10 + 0.0333333333333333*G0_11_11 + 0.3*G0_11_17 + 0.3*G0_11_18 + 0.166666666666667*G0_12_20 + 0.333333333333333*G0_12_25 + 0.166666666666667*G0_13_21 + 0.333333333333333*G0_13_25 - 0.133333333333333*G1_0_0 + 0.0333333333333333*G1_0_1 - 0.0666666666666666*G1_0_5 + 0.0333333333333333*G1_1_0 - 0.133333333333333*G1_1_1 - 0.0666666666666666*G1_1_5 - 0.0666666666666666*G1_5_0 - 0.0666666666666666*G1_5_1 - 0.533333333333333*G1_5_5 - 0.133333333333333*G1_6_6 + 0.0333333333333333*G1_6_7 - 0.0666666666666666*G1_6_11 + 0.0333333333333333*G1_7_6 - 0.133333333333333*G1_7_7 - 0.0666666666666666*G1_7_11 - 0.0666666666666666*G1_11_6 - 0.0666666666666666*G1_11_7 - 0.533333333333333*G1_11_11 - 0.333333333333333*G1_12_12 - 0.166666666666667*G1_12_13 - 0.166666666666667*G1_13_12 - 0.333333333333333*G1_13_13;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// interior facet tensor corresponding to the local contribution to
+/// a form from the integral over an interior facet.
+
+class adaptivenavierstokes_interior_facet_integral_7_otherwise: public ufc::interior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_interior_facet_integral_7_otherwise() : ufc::interior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_interior_facet_integral_7_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local interior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates_0,
+                               const double*  vertex_coordinates_1,
+                               std::size_t facet_0,
+                               std::size_t facet_1,
+                               int cell_orientation_0,
+                               int cell_orientation_1) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      12
+    // Number of operations (multiply-add pairs) for geometry tensor:    720
+    // Number of operations (multiply-add pairs) for tensor contraction: 1647
+    // Total number of operations (multiply-add pairs):                  2379
+    
+    // Compute Jacobian
+    double J_0[4];
+    compute_jacobian_triangle_2d(J_0, vertex_coordinates_0);
+    
+    // Compute Jacobian inverse and determinant
+    double K_0[4];
+    double detJ_0;
+    compute_jacobian_inverse_triangle_2d(K_0, detJ_0, J_0);
+    
+    // Compute Jacobian
+    double J_1[4];
+    compute_jacobian_triangle_2d(J_1, vertex_coordinates_1);
+    
+    // Compute Jacobian inverse and determinant
+    double K_1[4];
+    double detJ_1;
+    compute_jacobian_inverse_triangle_2d(K_1, detJ_1, J_1);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet_0][0];
+    const unsigned int v1 = edge_vertices[facet_0][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates_0[2*v1 + 0] - vertex_coordinates_0[2*v0 + 0];
+    const double dx1 = vertex_coordinates_0[2*v1 + 1] - vertex_coordinates_0[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    
+    // Compute geometry tensor
+    const double G0_15_15 = det*w[2][15]*w[3][15]*(1.0);
+    const double G0_15_16 = det*w[2][15]*w[3][16]*(1.0);
+    const double G0_15_17 = det*w[2][15]*w[3][17]*(1.0);
+    const double G0_15_19 = det*w[2][15]*w[3][19]*(1.0);
+    const double G0_15_20 = det*w[2][15]*w[3][20]*(1.0);
+    const double G0_16_15 = det*w[2][16]*w[3][15]*(1.0);
+    const double G0_16_16 = det*w[2][16]*w[3][16]*(1.0);
+    const double G0_16_17 = det*w[2][16]*w[3][17]*(1.0);
+    const double G0_16_18 = det*w[2][16]*w[3][18]*(1.0);
+    const double G0_16_20 = det*w[2][16]*w[3][20]*(1.0);
+    const double G0_17_15 = det*w[2][17]*w[3][15]*(1.0);
+    const double G0_17_16 = det*w[2][17]*w[3][16]*(1.0);
+    const double G0_17_17 = det*w[2][17]*w[3][17]*(1.0);
+    const double G0_17_18 = det*w[2][17]*w[3][18]*(1.0);
+    const double G0_17_19 = det*w[2][17]*w[3][19]*(1.0);
+    const double G0_18_16 = det*w[2][18]*w[3][16]*(1.0);
+    const double G0_18_17 = det*w[2][18]*w[3][17]*(1.0);
+    const double G0_18_18 = det*w[2][18]*w[3][18]*(1.0);
+    const double G0_19_15 = det*w[2][19]*w[3][15]*(1.0);
+    const double G0_19_17 = det*w[2][19]*w[3][17]*(1.0);
+    const double G0_19_19 = det*w[2][19]*w[3][19]*(1.0);
+    const double G0_20_15 = det*w[2][20]*w[3][15]*(1.0);
+    const double G0_20_16 = det*w[2][20]*w[3][16]*(1.0);
+    const double G0_20_20 = det*w[2][20]*w[3][20]*(1.0);
+    const double G0_21_21 = det*w[2][21]*w[3][21]*(1.0);
+    const double G0_21_22 = det*w[2][21]*w[3][22]*(1.0);
+    const double G0_21_23 = det*w[2][21]*w[3][23]*(1.0);
+    const double G0_21_25 = det*w[2][21]*w[3][25]*(1.0);
+    const double G0_21_26 = det*w[2][21]*w[3][26]*(1.0);
+    const double G0_22_21 = det*w[2][22]*w[3][21]*(1.0);
+    const double G0_22_22 = det*w[2][22]*w[3][22]*(1.0);
+    const double G0_22_23 = det*w[2][22]*w[3][23]*(1.0);
+    const double G0_22_24 = det*w[2][22]*w[3][24]*(1.0);
+    const double G0_22_26 = det*w[2][22]*w[3][26]*(1.0);
+    const double G0_23_21 = det*w[2][23]*w[3][21]*(1.0);
+    const double G0_23_22 = det*w[2][23]*w[3][22]*(1.0);
+    const double G0_23_23 = det*w[2][23]*w[3][23]*(1.0);
+    const double G0_23_24 = det*w[2][23]*w[3][24]*(1.0);
+    const double G0_23_25 = det*w[2][23]*w[3][25]*(1.0);
+    const double G0_24_22 = det*w[2][24]*w[3][22]*(1.0);
+    const double G0_24_23 = det*w[2][24]*w[3][23]*(1.0);
+    const double G0_24_24 = det*w[2][24]*w[3][24]*(1.0);
+    const double G0_25_21 = det*w[2][25]*w[3][21]*(1.0);
+    const double G0_25_23 = det*w[2][25]*w[3][23]*(1.0);
+    const double G0_25_25 = det*w[2][25]*w[3][25]*(1.0);
+    const double G0_26_21 = det*w[2][26]*w[3][21]*(1.0);
+    const double G0_26_22 = det*w[2][26]*w[3][22]*(1.0);
+    const double G0_26_26 = det*w[2][26]*w[3][26]*(1.0);
+    const double G0_27_27 = det*w[2][27]*w[3][27]*(1.0);
+    const double G0_27_28 = det*w[2][27]*w[3][28]*(1.0);
+    const double G0_27_29 = det*w[2][27]*w[3][29]*(1.0);
+    const double G0_28_27 = det*w[2][28]*w[3][27]*(1.0);
+    const double G0_28_28 = det*w[2][28]*w[3][28]*(1.0);
+    const double G0_28_29 = det*w[2][28]*w[3][29]*(1.0);
+    const double G0_29_27 = det*w[2][29]*w[3][27]*(1.0);
+    const double G0_29_28 = det*w[2][29]*w[3][28]*(1.0);
+    const double G0_29_29 = det*w[2][29]*w[3][29]*(1.0);
+    const double G1_15_26 = det*w[2][15]*w[0][26]*(1.0);
+    const double G1_15_31 = det*w[2][15]*w[0][31]*(1.0);
+    const double G1_15_32 = det*w[2][15]*w[0][32]*(1.0);
+    const double G1_15_33 = det*w[2][15]*w[0][33]*(1.0);
+    const double G1_15_34 = det*w[2][15]*w[0][34]*(1.0);
+    const double G1_16_27 = det*w[2][16]*w[0][27]*(1.0);
+    const double G1_16_29 = det*w[2][16]*w[0][29]*(1.0);
+    const double G1_16_30 = det*w[2][16]*w[0][30]*(1.0);
+    const double G1_16_33 = det*w[2][16]*w[0][33]*(1.0);
+    const double G1_16_34 = det*w[2][16]*w[0][34]*(1.0);
+    const double G1_17_28 = det*w[2][17]*w[0][28]*(1.0);
+    const double G1_17_29 = det*w[2][17]*w[0][29]*(1.0);
+    const double G1_17_30 = det*w[2][17]*w[0][30]*(1.0);
+    const double G1_17_31 = det*w[2][17]*w[0][31]*(1.0);
+    const double G1_17_32 = det*w[2][17]*w[0][32]*(1.0);
+    const double G1_18_27 = det*w[2][18]*w[0][27]*(1.0);
+    const double G1_18_28 = det*w[2][18]*w[0][28]*(1.0);
+    const double G1_18_29 = det*w[2][18]*w[0][29]*(1.0);
+    const double G1_18_30 = det*w[2][18]*w[0][30]*(1.0);
+    const double G1_19_26 = det*w[2][19]*w[0][26]*(1.0);
+    const double G1_19_28 = det*w[2][19]*w[0][28]*(1.0);
+    const double G1_19_31 = det*w[2][19]*w[0][31]*(1.0);
+    const double G1_19_32 = det*w[2][19]*w[0][32]*(1.0);
+    const double G1_20_26 = det*w[2][20]*w[0][26]*(1.0);
+    const double G1_20_27 = det*w[2][20]*w[0][27]*(1.0);
+    const double G1_20_33 = det*w[2][20]*w[0][33]*(1.0);
+    const double G1_20_34 = det*w[2][20]*w[0][34]*(1.0);
+    const double G1_21_36 = det*w[2][21]*w[0][36]*(1.0);
+    const double G1_21_41 = det*w[2][21]*w[0][41]*(1.0);
+    const double G1_21_42 = det*w[2][21]*w[0][42]*(1.0);
+    const double G1_21_43 = det*w[2][21]*w[0][43]*(1.0);
+    const double G1_21_44 = det*w[2][21]*w[0][44]*(1.0);
+    const double G1_22_37 = det*w[2][22]*w[0][37]*(1.0);
+    const double G1_22_39 = det*w[2][22]*w[0][39]*(1.0);
+    const double G1_22_40 = det*w[2][22]*w[0][40]*(1.0);
+    const double G1_22_43 = det*w[2][22]*w[0][43]*(1.0);
+    const double G1_22_44 = det*w[2][22]*w[0][44]*(1.0);
+    const double G1_23_38 = det*w[2][23]*w[0][38]*(1.0);
+    const double G1_23_39 = det*w[2][23]*w[0][39]*(1.0);
+    const double G1_23_40 = det*w[2][23]*w[0][40]*(1.0);
+    const double G1_23_41 = det*w[2][23]*w[0][41]*(1.0);
+    const double G1_23_42 = det*w[2][23]*w[0][42]*(1.0);
+    const double G1_24_37 = det*w[2][24]*w[0][37]*(1.0);
+    const double G1_24_38 = det*w[2][24]*w[0][38]*(1.0);
+    const double G1_24_39 = det*w[2][24]*w[0][39]*(1.0);
+    const double G1_24_40 = det*w[2][24]*w[0][40]*(1.0);
+    const double G1_25_36 = det*w[2][25]*w[0][36]*(1.0);
+    const double G1_25_38 = det*w[2][25]*w[0][38]*(1.0);
+    const double G1_25_41 = det*w[2][25]*w[0][41]*(1.0);
+    const double G1_25_42 = det*w[2][25]*w[0][42]*(1.0);
+    const double G1_26_36 = det*w[2][26]*w[0][36]*(1.0);
+    const double G1_26_37 = det*w[2][26]*w[0][37]*(1.0);
+    const double G1_26_43 = det*w[2][26]*w[0][43]*(1.0);
+    const double G1_26_44 = det*w[2][26]*w[0][44]*(1.0);
+    const double G1_27_46 = det*w[2][27]*w[0][46]*(1.0);
+    const double G1_27_50 = det*w[2][27]*w[0][50]*(1.0);
+    const double G1_27_51 = det*w[2][27]*w[0][51]*(1.0);
+    const double G1_28_47 = det*w[2][28]*w[0][47]*(1.0);
+    const double G1_28_49 = det*w[2][28]*w[0][49]*(1.0);
+    const double G1_28_51 = det*w[2][28]*w[0][51]*(1.0);
+    const double G1_29_48 = det*w[2][29]*w[0][48]*(1.0);
+    const double G1_29_49 = det*w[2][29]*w[0][49]*(1.0);
+    const double G1_29_50 = det*w[2][29]*w[0][50]*(1.0);
+    const double G2_0_0 = det*w[2][0]*w[3][0]*(1.0);
+    const double G2_0_1 = det*w[2][0]*w[3][1]*(1.0);
+    const double G2_0_2 = det*w[2][0]*w[3][2]*(1.0);
+    const double G2_0_4 = det*w[2][0]*w[3][4]*(1.0);
+    const double G2_0_5 = det*w[2][0]*w[3][5]*(1.0);
+    const double G2_1_0 = det*w[2][1]*w[3][0]*(1.0);
+    const double G2_1_1 = det*w[2][1]*w[3][1]*(1.0);
+    const double G2_1_2 = det*w[2][1]*w[3][2]*(1.0);
+    const double G2_1_3 = det*w[2][1]*w[3][3]*(1.0);
+    const double G2_1_5 = det*w[2][1]*w[3][5]*(1.0);
+    const double G2_2_0 = det*w[2][2]*w[3][0]*(1.0);
+    const double G2_2_1 = det*w[2][2]*w[3][1]*(1.0);
+    const double G2_2_2 = det*w[2][2]*w[3][2]*(1.0);
+    const double G2_2_3 = det*w[2][2]*w[3][3]*(1.0);
+    const double G2_2_4 = det*w[2][2]*w[3][4]*(1.0);
+    const double G2_3_1 = det*w[2][3]*w[3][1]*(1.0);
+    const double G2_3_2 = det*w[2][3]*w[3][2]*(1.0);
+    const double G2_3_3 = det*w[2][3]*w[3][3]*(1.0);
+    const double G2_4_0 = det*w[2][4]*w[3][0]*(1.0);
+    const double G2_4_2 = det*w[2][4]*w[3][2]*(1.0);
+    const double G2_4_4 = det*w[2][4]*w[3][4]*(1.0);
+    const double G2_5_0 = det*w[2][5]*w[3][0]*(1.0);
+    const double G2_5_1 = det*w[2][5]*w[3][1]*(1.0);
+    const double G2_5_5 = det*w[2][5]*w[3][5]*(1.0);
+    const double G2_6_6 = det*w[2][6]*w[3][6]*(1.0);
+    const double G2_6_7 = det*w[2][6]*w[3][7]*(1.0);
+    const double G2_6_8 = det*w[2][6]*w[3][8]*(1.0);
+    const double G2_6_10 = det*w[2][6]*w[3][10]*(1.0);
+    const double G2_6_11 = det*w[2][6]*w[3][11]*(1.0);
+    const double G2_7_6 = det*w[2][7]*w[3][6]*(1.0);
+    const double G2_7_7 = det*w[2][7]*w[3][7]*(1.0);
+    const double G2_7_8 = det*w[2][7]*w[3][8]*(1.0);
+    const double G2_7_9 = det*w[2][7]*w[3][9]*(1.0);
+    const double G2_7_11 = det*w[2][7]*w[3][11]*(1.0);
+    const double G2_8_6 = det*w[2][8]*w[3][6]*(1.0);
+    const double G2_8_7 = det*w[2][8]*w[3][7]*(1.0);
+    const double G2_8_8 = det*w[2][8]*w[3][8]*(1.0);
+    const double G2_8_9 = det*w[2][8]*w[3][9]*(1.0);
+    const double G2_8_10 = det*w[2][8]*w[3][10]*(1.0);
+    const double G2_9_7 = det*w[2][9]*w[3][7]*(1.0);
+    const double G2_9_8 = det*w[2][9]*w[3][8]*(1.0);
+    const double G2_9_9 = det*w[2][9]*w[3][9]*(1.0);
+    const double G2_10_6 = det*w[2][10]*w[3][6]*(1.0);
+    const double G2_10_8 = det*w[2][10]*w[3][8]*(1.0);
+    const double G2_10_10 = det*w[2][10]*w[3][10]*(1.0);
+    const double G2_11_6 = det*w[2][11]*w[3][6]*(1.0);
+    const double G2_11_7 = det*w[2][11]*w[3][7]*(1.0);
+    const double G2_11_11 = det*w[2][11]*w[3][11]*(1.0);
+    const double G2_12_12 = det*w[2][12]*w[3][12]*(1.0);
+    const double G2_12_13 = det*w[2][12]*w[3][13]*(1.0);
+    const double G2_12_14 = det*w[2][12]*w[3][14]*(1.0);
+    const double G2_13_12 = det*w[2][13]*w[3][12]*(1.0);
+    const double G2_13_13 = det*w[2][13]*w[3][13]*(1.0);
+    const double G2_13_14 = det*w[2][13]*w[3][14]*(1.0);
+    const double G2_14_12 = det*w[2][14]*w[3][12]*(1.0);
+    const double G2_14_13 = det*w[2][14]*w[3][13]*(1.0);
+    const double G2_14_14 = det*w[2][14]*w[3][14]*(1.0);
+    const double G3_0_0 = det*w[2][0]*w[0][0]*(1.0);
+    const double G3_0_5 = det*w[2][0]*w[0][5]*(1.0);
+    const double G3_0_6 = det*w[2][0]*w[0][6]*(1.0);
+    const double G3_0_7 = det*w[2][0]*w[0][7]*(1.0);
+    const double G3_0_8 = det*w[2][0]*w[0][8]*(1.0);
+    const double G3_1_1 = det*w[2][1]*w[0][1]*(1.0);
+    const double G3_1_3 = det*w[2][1]*w[0][3]*(1.0);
+    const double G3_1_4 = det*w[2][1]*w[0][4]*(1.0);
+    const double G3_1_7 = det*w[2][1]*w[0][7]*(1.0);
+    const double G3_1_8 = det*w[2][1]*w[0][8]*(1.0);
+    const double G3_2_2 = det*w[2][2]*w[0][2]*(1.0);
+    const double G3_2_3 = det*w[2][2]*w[0][3]*(1.0);
+    const double G3_2_4 = det*w[2][2]*w[0][4]*(1.0);
+    const double G3_2_5 = det*w[2][2]*w[0][5]*(1.0);
+    const double G3_2_6 = det*w[2][2]*w[0][6]*(1.0);
+    const double G3_3_1 = det*w[2][3]*w[0][1]*(1.0);
+    const double G3_3_2 = det*w[2][3]*w[0][2]*(1.0);
+    const double G3_3_3 = det*w[2][3]*w[0][3]*(1.0);
+    const double G3_3_4 = det*w[2][3]*w[0][4]*(1.0);
+    const double G3_4_0 = det*w[2][4]*w[0][0]*(1.0);
+    const double G3_4_2 = det*w[2][4]*w[0][2]*(1.0);
+    const double G3_4_5 = det*w[2][4]*w[0][5]*(1.0);
+    const double G3_4_6 = det*w[2][4]*w[0][6]*(1.0);
+    const double G3_5_0 = det*w[2][5]*w[0][0]*(1.0);
+    const double G3_5_1 = det*w[2][5]*w[0][1]*(1.0);
+    const double G3_5_7 = det*w[2][5]*w[0][7]*(1.0);
+    const double G3_5_8 = det*w[2][5]*w[0][8]*(1.0);
+    const double G3_6_10 = det*w[2][6]*w[0][10]*(1.0);
+    const double G3_6_15 = det*w[2][6]*w[0][15]*(1.0);
+    const double G3_6_16 = det*w[2][6]*w[0][16]*(1.0);
+    const double G3_6_17 = det*w[2][6]*w[0][17]*(1.0);
+    const double G3_6_18 = det*w[2][6]*w[0][18]*(1.0);
+    const double G3_7_11 = det*w[2][7]*w[0][11]*(1.0);
+    const double G3_7_13 = det*w[2][7]*w[0][13]*(1.0);
+    const double G3_7_14 = det*w[2][7]*w[0][14]*(1.0);
+    const double G3_7_17 = det*w[2][7]*w[0][17]*(1.0);
+    const double G3_7_18 = det*w[2][7]*w[0][18]*(1.0);
+    const double G3_8_12 = det*w[2][8]*w[0][12]*(1.0);
+    const double G3_8_13 = det*w[2][8]*w[0][13]*(1.0);
+    const double G3_8_14 = det*w[2][8]*w[0][14]*(1.0);
+    const double G3_8_15 = det*w[2][8]*w[0][15]*(1.0);
+    const double G3_8_16 = det*w[2][8]*w[0][16]*(1.0);
+    const double G3_9_11 = det*w[2][9]*w[0][11]*(1.0);
+    const double G3_9_12 = det*w[2][9]*w[0][12]*(1.0);
+    const double G3_9_13 = det*w[2][9]*w[0][13]*(1.0);
+    const double G3_9_14 = det*w[2][9]*w[0][14]*(1.0);
+    const double G3_10_10 = det*w[2][10]*w[0][10]*(1.0);
+    const double G3_10_12 = det*w[2][10]*w[0][12]*(1.0);
+    const double G3_10_15 = det*w[2][10]*w[0][15]*(1.0);
+    const double G3_10_16 = det*w[2][10]*w[0][16]*(1.0);
+    const double G3_11_10 = det*w[2][11]*w[0][10]*(1.0);
+    const double G3_11_11 = det*w[2][11]*w[0][11]*(1.0);
+    const double G3_11_17 = det*w[2][11]*w[0][17]*(1.0);
+    const double G3_11_18 = det*w[2][11]*w[0][18]*(1.0);
+    const double G3_12_20 = det*w[2][12]*w[0][20]*(1.0);
+    const double G3_12_24 = det*w[2][12]*w[0][24]*(1.0);
+    const double G3_12_25 = det*w[2][12]*w[0][25]*(1.0);
+    const double G3_13_21 = det*w[2][13]*w[0][21]*(1.0);
+    const double G3_13_23 = det*w[2][13]*w[0][23]*(1.0);
+    const double G3_13_25 = det*w[2][13]*w[0][25]*(1.0);
+    const double G3_14_22 = det*w[2][14]*w[0][22]*(1.0);
+    const double G3_14_23 = det*w[2][14]*w[0][23]*(1.0);
+    const double G3_14_24 = det*w[2][14]*w[0][24]*(1.0);
+    const double G4_15_15 = det*w[2][15]*w[3][15]*(1.0);
+    const double G4_15_16 = det*w[2][15]*w[3][16]*(1.0);
+    const double G4_15_17 = det*w[2][15]*w[3][17]*(1.0);
+    const double G4_15_19 = det*w[2][15]*w[3][19]*(1.0);
+    const double G4_15_20 = det*w[2][15]*w[3][20]*(1.0);
+    const double G4_16_15 = det*w[2][16]*w[3][15]*(1.0);
+    const double G4_16_16 = det*w[2][16]*w[3][16]*(1.0);
+    const double G4_16_17 = det*w[2][16]*w[3][17]*(1.0);
+    const double G4_16_18 = det*w[2][16]*w[3][18]*(1.0);
+    const double G4_16_20 = det*w[2][16]*w[3][20]*(1.0);
+    const double G4_17_15 = det*w[2][17]*w[3][15]*(1.0);
+    const double G4_17_16 = det*w[2][17]*w[3][16]*(1.0);
+    const double G4_17_17 = det*w[2][17]*w[3][17]*(1.0);
+    const double G4_17_18 = det*w[2][17]*w[3][18]*(1.0);
+    const double G4_17_19 = det*w[2][17]*w[3][19]*(1.0);
+    const double G4_18_16 = det*w[2][18]*w[3][16]*(1.0);
+    const double G4_18_17 = det*w[2][18]*w[3][17]*(1.0);
+    const double G4_18_18 = det*w[2][18]*w[3][18]*(1.0);
+    const double G4_19_15 = det*w[2][19]*w[3][15]*(1.0);
+    const double G4_19_17 = det*w[2][19]*w[3][17]*(1.0);
+    const double G4_19_19 = det*w[2][19]*w[3][19]*(1.0);
+    const double G4_20_15 = det*w[2][20]*w[3][15]*(1.0);
+    const double G4_20_16 = det*w[2][20]*w[3][16]*(1.0);
+    const double G4_20_20 = det*w[2][20]*w[3][20]*(1.0);
+    const double G4_21_21 = det*w[2][21]*w[3][21]*(1.0);
+    const double G4_21_22 = det*w[2][21]*w[3][22]*(1.0);
+    const double G4_21_23 = det*w[2][21]*w[3][23]*(1.0);
+    const double G4_21_25 = det*w[2][21]*w[3][25]*(1.0);
+    const double G4_21_26 = det*w[2][21]*w[3][26]*(1.0);
+    const double G4_22_21 = det*w[2][22]*w[3][21]*(1.0);
+    const double G4_22_22 = det*w[2][22]*w[3][22]*(1.0);
+    const double G4_22_23 = det*w[2][22]*w[3][23]*(1.0);
+    const double G4_22_24 = det*w[2][22]*w[3][24]*(1.0);
+    const double G4_22_26 = det*w[2][22]*w[3][26]*(1.0);
+    const double G4_23_21 = det*w[2][23]*w[3][21]*(1.0);
+    const double G4_23_22 = det*w[2][23]*w[3][22]*(1.0);
+    const double G4_23_23 = det*w[2][23]*w[3][23]*(1.0);
+    const double G4_23_24 = det*w[2][23]*w[3][24]*(1.0);
+    const double G4_23_25 = det*w[2][23]*w[3][25]*(1.0);
+    const double G4_24_22 = det*w[2][24]*w[3][22]*(1.0);
+    const double G4_24_23 = det*w[2][24]*w[3][23]*(1.0);
+    const double G4_24_24 = det*w[2][24]*w[3][24]*(1.0);
+    const double G4_25_21 = det*w[2][25]*w[3][21]*(1.0);
+    const double G4_25_23 = det*w[2][25]*w[3][23]*(1.0);
+    const double G4_25_25 = det*w[2][25]*w[3][25]*(1.0);
+    const double G4_26_21 = det*w[2][26]*w[3][21]*(1.0);
+    const double G4_26_22 = det*w[2][26]*w[3][22]*(1.0);
+    const double G4_26_26 = det*w[2][26]*w[3][26]*(1.0);
+    const double G4_27_27 = det*w[2][27]*w[3][27]*(1.0);
+    const double G4_27_28 = det*w[2][27]*w[3][28]*(1.0);
+    const double G4_27_29 = det*w[2][27]*w[3][29]*(1.0);
+    const double G4_28_27 = det*w[2][28]*w[3][27]*(1.0);
+    const double G4_28_28 = det*w[2][28]*w[3][28]*(1.0);
+    const double G4_28_29 = det*w[2][28]*w[3][29]*(1.0);
+    const double G4_29_27 = det*w[2][29]*w[3][27]*(1.0);
+    const double G4_29_28 = det*w[2][29]*w[3][28]*(1.0);
+    const double G4_29_29 = det*w[2][29]*w[3][29]*(1.0);
+    const double G5_15_26 = det*w[2][15]*w[0][26]*(1.0);
+    const double G5_15_31 = det*w[2][15]*w[0][31]*(1.0);
+    const double G5_15_32 = det*w[2][15]*w[0][32]*(1.0);
+    const double G5_15_33 = det*w[2][15]*w[0][33]*(1.0);
+    const double G5_15_34 = det*w[2][15]*w[0][34]*(1.0);
+    const double G5_16_27 = det*w[2][16]*w[0][27]*(1.0);
+    const double G5_16_29 = det*w[2][16]*w[0][29]*(1.0);
+    const double G5_16_30 = det*w[2][16]*w[0][30]*(1.0);
+    const double G5_16_33 = det*w[2][16]*w[0][33]*(1.0);
+    const double G5_16_34 = det*w[2][16]*w[0][34]*(1.0);
+    const double G5_17_28 = det*w[2][17]*w[0][28]*(1.0);
+    const double G5_17_29 = det*w[2][17]*w[0][29]*(1.0);
+    const double G5_17_30 = det*w[2][17]*w[0][30]*(1.0);
+    const double G5_17_31 = det*w[2][17]*w[0][31]*(1.0);
+    const double G5_17_32 = det*w[2][17]*w[0][32]*(1.0);
+    const double G5_18_27 = det*w[2][18]*w[0][27]*(1.0);
+    const double G5_18_28 = det*w[2][18]*w[0][28]*(1.0);
+    const double G5_18_29 = det*w[2][18]*w[0][29]*(1.0);
+    const double G5_18_30 = det*w[2][18]*w[0][30]*(1.0);
+    const double G5_19_26 = det*w[2][19]*w[0][26]*(1.0);
+    const double G5_19_28 = det*w[2][19]*w[0][28]*(1.0);
+    const double G5_19_31 = det*w[2][19]*w[0][31]*(1.0);
+    const double G5_19_32 = det*w[2][19]*w[0][32]*(1.0);
+    const double G5_20_26 = det*w[2][20]*w[0][26]*(1.0);
+    const double G5_20_27 = det*w[2][20]*w[0][27]*(1.0);
+    const double G5_20_33 = det*w[2][20]*w[0][33]*(1.0);
+    const double G5_20_34 = det*w[2][20]*w[0][34]*(1.0);
+    const double G5_21_36 = det*w[2][21]*w[0][36]*(1.0);
+    const double G5_21_41 = det*w[2][21]*w[0][41]*(1.0);
+    const double G5_21_42 = det*w[2][21]*w[0][42]*(1.0);
+    const double G5_21_43 = det*w[2][21]*w[0][43]*(1.0);
+    const double G5_21_44 = det*w[2][21]*w[0][44]*(1.0);
+    const double G5_22_37 = det*w[2][22]*w[0][37]*(1.0);
+    const double G5_22_39 = det*w[2][22]*w[0][39]*(1.0);
+    const double G5_22_40 = det*w[2][22]*w[0][40]*(1.0);
+    const double G5_22_43 = det*w[2][22]*w[0][43]*(1.0);
+    const double G5_22_44 = det*w[2][22]*w[0][44]*(1.0);
+    const double G5_23_38 = det*w[2][23]*w[0][38]*(1.0);
+    const double G5_23_39 = det*w[2][23]*w[0][39]*(1.0);
+    const double G5_23_40 = det*w[2][23]*w[0][40]*(1.0);
+    const double G5_23_41 = det*w[2][23]*w[0][41]*(1.0);
+    const double G5_23_42 = det*w[2][23]*w[0][42]*(1.0);
+    const double G5_24_37 = det*w[2][24]*w[0][37]*(1.0);
+    const double G5_24_38 = det*w[2][24]*w[0][38]*(1.0);
+    const double G5_24_39 = det*w[2][24]*w[0][39]*(1.0);
+    const double G5_24_40 = det*w[2][24]*w[0][40]*(1.0);
+    const double G5_25_36 = det*w[2][25]*w[0][36]*(1.0);
+    const double G5_25_38 = det*w[2][25]*w[0][38]*(1.0);
+    const double G5_25_41 = det*w[2][25]*w[0][41]*(1.0);
+    const double G5_25_42 = det*w[2][25]*w[0][42]*(1.0);
+    const double G5_26_36 = det*w[2][26]*w[0][36]*(1.0);
+    const double G5_26_37 = det*w[2][26]*w[0][37]*(1.0);
+    const double G5_26_43 = det*w[2][26]*w[0][43]*(1.0);
+    const double G5_26_44 = det*w[2][26]*w[0][44]*(1.0);
+    const double G5_27_46 = det*w[2][27]*w[0][46]*(1.0);
+    const double G5_27_50 = det*w[2][27]*w[0][50]*(1.0);
+    const double G5_27_51 = det*w[2][27]*w[0][51]*(1.0);
+    const double G5_28_47 = det*w[2][28]*w[0][47]*(1.0);
+    const double G5_28_49 = det*w[2][28]*w[0][49]*(1.0);
+    const double G5_28_51 = det*w[2][28]*w[0][51]*(1.0);
+    const double G5_29_48 = det*w[2][29]*w[0][48]*(1.0);
+    const double G5_29_49 = det*w[2][29]*w[0][49]*(1.0);
+    const double G5_29_50 = det*w[2][29]*w[0][50]*(1.0);
+    const double G6_0_0 = det*w[2][0]*w[3][0]*(1.0);
+    const double G6_0_1 = det*w[2][0]*w[3][1]*(1.0);
+    const double G6_0_2 = det*w[2][0]*w[3][2]*(1.0);
+    const double G6_0_4 = det*w[2][0]*w[3][4]*(1.0);
+    const double G6_0_5 = det*w[2][0]*w[3][5]*(1.0);
+    const double G6_1_0 = det*w[2][1]*w[3][0]*(1.0);
+    const double G6_1_1 = det*w[2][1]*w[3][1]*(1.0);
+    const double G6_1_2 = det*w[2][1]*w[3][2]*(1.0);
+    const double G6_1_3 = det*w[2][1]*w[3][3]*(1.0);
+    const double G6_1_5 = det*w[2][1]*w[3][5]*(1.0);
+    const double G6_2_0 = det*w[2][2]*w[3][0]*(1.0);
+    const double G6_2_1 = det*w[2][2]*w[3][1]*(1.0);
+    const double G6_2_2 = det*w[2][2]*w[3][2]*(1.0);
+    const double G6_2_3 = det*w[2][2]*w[3][3]*(1.0);
+    const double G6_2_4 = det*w[2][2]*w[3][4]*(1.0);
+    const double G6_3_1 = det*w[2][3]*w[3][1]*(1.0);
+    const double G6_3_2 = det*w[2][3]*w[3][2]*(1.0);
+    const double G6_3_3 = det*w[2][3]*w[3][3]*(1.0);
+    const double G6_4_0 = det*w[2][4]*w[3][0]*(1.0);
+    const double G6_4_2 = det*w[2][4]*w[3][2]*(1.0);
+    const double G6_4_4 = det*w[2][4]*w[3][4]*(1.0);
+    const double G6_5_0 = det*w[2][5]*w[3][0]*(1.0);
+    const double G6_5_1 = det*w[2][5]*w[3][1]*(1.0);
+    const double G6_5_5 = det*w[2][5]*w[3][5]*(1.0);
+    const double G6_6_6 = det*w[2][6]*w[3][6]*(1.0);
+    const double G6_6_7 = det*w[2][6]*w[3][7]*(1.0);
+    const double G6_6_8 = det*w[2][6]*w[3][8]*(1.0);
+    const double G6_6_10 = det*w[2][6]*w[3][10]*(1.0);
+    const double G6_6_11 = det*w[2][6]*w[3][11]*(1.0);
+    const double G6_7_6 = det*w[2][7]*w[3][6]*(1.0);
+    const double G6_7_7 = det*w[2][7]*w[3][7]*(1.0);
+    const double G6_7_8 = det*w[2][7]*w[3][8]*(1.0);
+    const double G6_7_9 = det*w[2][7]*w[3][9]*(1.0);
+    const double G6_7_11 = det*w[2][7]*w[3][11]*(1.0);
+    const double G6_8_6 = det*w[2][8]*w[3][6]*(1.0);
+    const double G6_8_7 = det*w[2][8]*w[3][7]*(1.0);
+    const double G6_8_8 = det*w[2][8]*w[3][8]*(1.0);
+    const double G6_8_9 = det*w[2][8]*w[3][9]*(1.0);
+    const double G6_8_10 = det*w[2][8]*w[3][10]*(1.0);
+    const double G6_9_7 = det*w[2][9]*w[3][7]*(1.0);
+    const double G6_9_8 = det*w[2][9]*w[3][8]*(1.0);
+    const double G6_9_9 = det*w[2][9]*w[3][9]*(1.0);
+    const double G6_10_6 = det*w[2][10]*w[3][6]*(1.0);
+    const double G6_10_8 = det*w[2][10]*w[3][8]*(1.0);
+    const double G6_10_10 = det*w[2][10]*w[3][10]*(1.0);
+    const double G6_11_6 = det*w[2][11]*w[3][6]*(1.0);
+    const double G6_11_7 = det*w[2][11]*w[3][7]*(1.0);
+    const double G6_11_11 = det*w[2][11]*w[3][11]*(1.0);
+    const double G6_12_12 = det*w[2][12]*w[3][12]*(1.0);
+    const double G6_12_13 = det*w[2][12]*w[3][13]*(1.0);
+    const double G6_12_14 = det*w[2][12]*w[3][14]*(1.0);
+    const double G6_13_12 = det*w[2][13]*w[3][12]*(1.0);
+    const double G6_13_13 = det*w[2][13]*w[3][13]*(1.0);
+    const double G6_13_14 = det*w[2][13]*w[3][14]*(1.0);
+    const double G6_14_12 = det*w[2][14]*w[3][12]*(1.0);
+    const double G6_14_13 = det*w[2][14]*w[3][13]*(1.0);
+    const double G6_14_14 = det*w[2][14]*w[3][14]*(1.0);
+    const double G7_0_0 = det*w[2][0]*w[0][0]*(1.0);
+    const double G7_0_5 = det*w[2][0]*w[0][5]*(1.0);
+    const double G7_0_6 = det*w[2][0]*w[0][6]*(1.0);
+    const double G7_0_7 = det*w[2][0]*w[0][7]*(1.0);
+    const double G7_0_8 = det*w[2][0]*w[0][8]*(1.0);
+    const double G7_1_1 = det*w[2][1]*w[0][1]*(1.0);
+    const double G7_1_3 = det*w[2][1]*w[0][3]*(1.0);
+    const double G7_1_4 = det*w[2][1]*w[0][4]*(1.0);
+    const double G7_1_7 = det*w[2][1]*w[0][7]*(1.0);
+    const double G7_1_8 = det*w[2][1]*w[0][8]*(1.0);
+    const double G7_2_2 = det*w[2][2]*w[0][2]*(1.0);
+    const double G7_2_3 = det*w[2][2]*w[0][3]*(1.0);
+    const double G7_2_4 = det*w[2][2]*w[0][4]*(1.0);
+    const double G7_2_5 = det*w[2][2]*w[0][5]*(1.0);
+    const double G7_2_6 = det*w[2][2]*w[0][6]*(1.0);
+    const double G7_3_1 = det*w[2][3]*w[0][1]*(1.0);
+    const double G7_3_2 = det*w[2][3]*w[0][2]*(1.0);
+    const double G7_3_3 = det*w[2][3]*w[0][3]*(1.0);
+    const double G7_3_4 = det*w[2][3]*w[0][4]*(1.0);
+    const double G7_4_0 = det*w[2][4]*w[0][0]*(1.0);
+    const double G7_4_2 = det*w[2][4]*w[0][2]*(1.0);
+    const double G7_4_5 = det*w[2][4]*w[0][5]*(1.0);
+    const double G7_4_6 = det*w[2][4]*w[0][6]*(1.0);
+    const double G7_5_0 = det*w[2][5]*w[0][0]*(1.0);
+    const double G7_5_1 = det*w[2][5]*w[0][1]*(1.0);
+    const double G7_5_7 = det*w[2][5]*w[0][7]*(1.0);
+    const double G7_5_8 = det*w[2][5]*w[0][8]*(1.0);
+    const double G7_6_10 = det*w[2][6]*w[0][10]*(1.0);
+    const double G7_6_15 = det*w[2][6]*w[0][15]*(1.0);
+    const double G7_6_16 = det*w[2][6]*w[0][16]*(1.0);
+    const double G7_6_17 = det*w[2][6]*w[0][17]*(1.0);
+    const double G7_6_18 = det*w[2][6]*w[0][18]*(1.0);
+    const double G7_7_11 = det*w[2][7]*w[0][11]*(1.0);
+    const double G7_7_13 = det*w[2][7]*w[0][13]*(1.0);
+    const double G7_7_14 = det*w[2][7]*w[0][14]*(1.0);
+    const double G7_7_17 = det*w[2][7]*w[0][17]*(1.0);
+    const double G7_7_18 = det*w[2][7]*w[0][18]*(1.0);
+    const double G7_8_12 = det*w[2][8]*w[0][12]*(1.0);
+    const double G7_8_13 = det*w[2][8]*w[0][13]*(1.0);
+    const double G7_8_14 = det*w[2][8]*w[0][14]*(1.0);
+    const double G7_8_15 = det*w[2][8]*w[0][15]*(1.0);
+    const double G7_8_16 = det*w[2][8]*w[0][16]*(1.0);
+    const double G7_9_11 = det*w[2][9]*w[0][11]*(1.0);
+    const double G7_9_12 = det*w[2][9]*w[0][12]*(1.0);
+    const double G7_9_13 = det*w[2][9]*w[0][13]*(1.0);
+    const double G7_9_14 = det*w[2][9]*w[0][14]*(1.0);
+    const double G7_10_10 = det*w[2][10]*w[0][10]*(1.0);
+    const double G7_10_12 = det*w[2][10]*w[0][12]*(1.0);
+    const double G7_10_15 = det*w[2][10]*w[0][15]*(1.0);
+    const double G7_10_16 = det*w[2][10]*w[0][16]*(1.0);
+    const double G7_11_10 = det*w[2][11]*w[0][10]*(1.0);
+    const double G7_11_11 = det*w[2][11]*w[0][11]*(1.0);
+    const double G7_11_17 = det*w[2][11]*w[0][17]*(1.0);
+    const double G7_11_18 = det*w[2][11]*w[0][18]*(1.0);
+    const double G7_12_20 = det*w[2][12]*w[0][20]*(1.0);
+    const double G7_12_24 = det*w[2][12]*w[0][24]*(1.0);
+    const double G7_12_25 = det*w[2][12]*w[0][25]*(1.0);
+    const double G7_13_21 = det*w[2][13]*w[0][21]*(1.0);
+    const double G7_13_23 = det*w[2][13]*w[0][23]*(1.0);
+    const double G7_13_25 = det*w[2][13]*w[0][25]*(1.0);
+    const double G7_14_22 = det*w[2][14]*w[0][22]*(1.0);
+    const double G7_14_23 = det*w[2][14]*w[0][23]*(1.0);
+    const double G7_14_24 = det*w[2][14]*w[0][24]*(1.0);
+    
+    // Compute element tensor
+    switch (facet_0)
+    {
+    case 0:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = -0.0666666666666667*G4_16_16 + 0.0166666666666666*G4_16_17 - 0.0333333333333333*G4_16_18 + 0.0166666666666666*G4_17_16 - 0.0666666666666667*G4_17_17 - 0.0333333333333333*G4_17_18 - 0.0333333333333333*G4_18_16 - 0.0333333333333333*G4_18_17 - 0.266666666666666*G4_18_18 - 0.0666666666666667*G4_22_22 + 0.0166666666666666*G4_22_23 - 0.0333333333333333*G4_22_24 + 0.0166666666666666*G4_23_22 - 0.0666666666666667*G4_23_23 - 0.0333333333333333*G4_23_24 - 0.0333333333333333*G4_24_22 - 0.0333333333333333*G4_24_23 - 0.266666666666666*G4_24_24 - 0.166666666666667*G4_28_28 - 0.0833333333333333*G4_28_29 - 0.0833333333333333*G4_29_28 - 0.166666666666667*G4_29_29 + 0.0458333333333333*G5_16_27 + 0.075*G5_16_29 - 0.0375*G5_16_30 + 0.0458333333333333*G5_17_28 - 0.0375*G5_17_29 + 0.075*G5_17_30 + 0.0166666666666666*G5_18_27 + 0.0166666666666666*G5_18_28 + 0.15*G5_18_29 + 0.15*G5_18_30 + 0.0458333333333333*G5_22_37 + 0.075*G5_22_39 - 0.0375*G5_22_40 + 0.0458333333333333*G5_23_38 - 0.0375*G5_23_39 + 0.075*G5_23_40 + 0.0166666666666666*G5_24_37 + 0.0166666666666666*G5_24_38 + 0.15*G5_24_39 + 0.15*G5_24_40 + 0.0833333333333333*G5_28_47 + 0.166666666666667*G5_28_49 + 0.0833333333333333*G5_29_48 + 0.166666666666667*G5_29_49 - 0.0666666666666667*G6_1_1 + 0.0166666666666666*G6_1_2 - 0.0333333333333333*G6_1_3 + 0.0166666666666666*G6_2_1 - 0.0666666666666667*G6_2_2 - 0.0333333333333333*G6_2_3 - 0.0333333333333333*G6_3_1 - 0.0333333333333333*G6_3_2 - 0.266666666666666*G6_3_3 - 0.0666666666666667*G6_7_7 + 0.0166666666666666*G6_7_8 - 0.0333333333333333*G6_7_9 + 0.0166666666666666*G6_8_7 - 0.0666666666666667*G6_8_8 - 0.0333333333333333*G6_8_9 - 0.0333333333333333*G6_9_7 - 0.0333333333333333*G6_9_8 - 0.266666666666666*G6_9_9 - 0.166666666666667*G6_13_13 - 0.0833333333333333*G6_13_14 - 0.0833333333333333*G6_14_13 - 0.166666666666667*G6_14_14 + 0.0458333333333333*G7_1_1 + 0.075*G7_1_3 - 0.0375*G7_1_4 + 0.0458333333333333*G7_2_2 - 0.0375*G7_2_3 + 0.075*G7_2_4 + 0.0166666666666666*G7_3_1 + 0.0166666666666666*G7_3_2 + 0.15*G7_3_3 + 0.15*G7_3_4 + 0.0458333333333333*G7_7_11 + 0.075*G7_7_13 - 0.0375*G7_7_14 + 0.0458333333333333*G7_8_12 - 0.0375*G7_8_13 + 0.075*G7_8_14 + 0.0166666666666666*G7_9_11 + 0.0166666666666666*G7_9_12 + 0.15*G7_9_13 + 0.15*G7_9_14 + 0.0833333333333333*G7_13_21 + 0.166666666666667*G7_13_23 + 0.0833333333333333*G7_14_22 + 0.166666666666667*G7_14_23;
+        A[1] = -0.0666666666666667*G0_16_16 + 0.0166666666666666*G0_16_17 - 0.0333333333333333*G0_16_18 + 0.0166666666666666*G0_17_16 - 0.0666666666666667*G0_17_17 - 0.0333333333333333*G0_17_18 - 0.0333333333333333*G0_18_16 - 0.0333333333333333*G0_18_17 - 0.266666666666666*G0_18_18 - 0.0666666666666667*G0_22_22 + 0.0166666666666666*G0_22_23 - 0.0333333333333333*G0_22_24 + 0.0166666666666666*G0_23_22 - 0.0666666666666667*G0_23_23 - 0.0333333333333333*G0_23_24 - 0.0333333333333333*G0_24_22 - 0.0333333333333333*G0_24_23 - 0.266666666666666*G0_24_24 - 0.166666666666667*G0_28_28 - 0.0833333333333333*G0_28_29 - 0.0833333333333333*G0_29_28 - 0.166666666666667*G0_29_29 + 0.0458333333333333*G1_16_27 + 0.075*G1_16_29 - 0.0375*G1_16_30 + 0.0458333333333333*G1_17_28 - 0.0375*G1_17_29 + 0.075*G1_17_30 + 0.0166666666666666*G1_18_27 + 0.0166666666666666*G1_18_28 + 0.15*G1_18_29 + 0.15*G1_18_30 + 0.0458333333333333*G1_22_37 + 0.075*G1_22_39 - 0.0375*G1_22_40 + 0.0458333333333333*G1_23_38 - 0.0375*G1_23_39 + 0.075*G1_23_40 + 0.0166666666666666*G1_24_37 + 0.0166666666666666*G1_24_38 + 0.15*G1_24_39 + 0.15*G1_24_40 + 0.0833333333333333*G1_28_47 + 0.166666666666667*G1_28_49 + 0.0833333333333333*G1_29_48 + 0.166666666666667*G1_29_49 - 0.0666666666666667*G2_1_1 + 0.0166666666666666*G2_1_2 - 0.0333333333333333*G2_1_3 + 0.0166666666666666*G2_2_1 - 0.0666666666666667*G2_2_2 - 0.0333333333333333*G2_2_3 - 0.0333333333333333*G2_3_1 - 0.0333333333333333*G2_3_2 - 0.266666666666666*G2_3_3 - 0.0666666666666667*G2_7_7 + 0.0166666666666666*G2_7_8 - 0.0333333333333333*G2_7_9 + 0.0166666666666666*G2_8_7 - 0.0666666666666667*G2_8_8 - 0.0333333333333333*G2_8_9 - 0.0333333333333333*G2_9_7 - 0.0333333333333333*G2_9_8 - 0.266666666666666*G2_9_9 - 0.166666666666667*G2_13_13 - 0.0833333333333333*G2_13_14 - 0.0833333333333333*G2_14_13 - 0.166666666666667*G2_14_14 + 0.0458333333333333*G3_1_1 + 0.075*G3_1_3 - 0.0375*G3_1_4 + 0.0458333333333333*G3_2_2 - 0.0375*G3_2_3 + 0.075*G3_2_4 + 0.0166666666666666*G3_3_1 + 0.0166666666666666*G3_3_2 + 0.15*G3_3_3 + 0.15*G3_3_4 + 0.0458333333333333*G3_7_11 + 0.075*G3_7_13 - 0.0375*G3_7_14 + 0.0458333333333333*G3_8_12 - 0.0375*G3_8_13 + 0.075*G3_8_14 + 0.0166666666666666*G3_9_11 + 0.0166666666666666*G3_9_12 + 0.15*G3_9_13 + 0.15*G3_9_14 + 0.0833333333333333*G3_13_21 + 0.166666666666667*G3_13_23 + 0.0833333333333333*G3_14_22 + 0.166666666666667*G3_14_23;
+          break;
+        }
+      case 1:
+        {
+          A[0] = -0.0666666666666666*G4_15_15 + 0.0166666666666666*G4_15_17 - 0.0333333333333333*G4_15_19 + 0.0166666666666666*G4_17_15 - 0.0666666666666667*G4_17_17 - 0.0333333333333333*G4_17_19 - 0.0333333333333333*G4_19_15 - 0.0333333333333333*G4_19_17 - 0.266666666666666*G4_19_19 - 0.0666666666666666*G4_21_21 + 0.0166666666666666*G4_21_23 - 0.0333333333333333*G4_21_25 + 0.0166666666666666*G4_23_21 - 0.0666666666666667*G4_23_23 - 0.0333333333333333*G4_23_25 - 0.0333333333333333*G4_25_21 - 0.0333333333333333*G4_25_23 - 0.266666666666666*G4_25_25 - 0.166666666666667*G4_27_27 - 0.0833333333333333*G4_27_29 - 0.0833333333333333*G4_29_27 - 0.166666666666667*G4_29_29 + 0.0458333333333333*G5_15_26 + 0.075*G5_15_31 - 0.0375*G5_15_32 + 0.0458333333333333*G5_17_28 - 0.0375*G5_17_31 + 0.075*G5_17_32 + 0.0166666666666666*G5_19_26 + 0.0166666666666666*G5_19_28 + 0.15*G5_19_31 + 0.15*G5_19_32 + 0.0458333333333333*G5_21_36 + 0.075*G5_21_41 - 0.0375*G5_21_42 + 0.0458333333333333*G5_23_38 - 0.0375*G5_23_41 + 0.075*G5_23_42 + 0.0166666666666666*G5_25_36 + 0.0166666666666666*G5_25_38 + 0.15*G5_25_41 + 0.15*G5_25_42 + 0.0833333333333333*G5_27_46 + 0.166666666666667*G5_27_50 + 0.0833333333333333*G5_29_48 + 0.166666666666667*G5_29_50 - 0.0666666666666667*G6_1_1 + 0.0166666666666666*G6_1_2 - 0.0333333333333333*G6_1_3 + 0.0166666666666666*G6_2_1 - 0.0666666666666667*G6_2_2 - 0.0333333333333333*G6_2_3 - 0.0333333333333333*G6_3_1 - 0.0333333333333333*G6_3_2 - 0.266666666666666*G6_3_3 - 0.0666666666666667*G6_7_7 + 0.0166666666666666*G6_7_8 - 0.0333333333333333*G6_7_9 + 0.0166666666666666*G6_8_7 - 0.0666666666666667*G6_8_8 - 0.0333333333333333*G6_8_9 - 0.0333333333333333*G6_9_7 - 0.0333333333333333*G6_9_8 - 0.266666666666666*G6_9_9 - 0.166666666666667*G6_13_13 - 0.0833333333333333*G6_13_14 - 0.0833333333333333*G6_14_13 - 0.166666666666667*G6_14_14 + 0.0458333333333333*G7_1_1 + 0.075*G7_1_3 - 0.0375*G7_1_4 + 0.0458333333333333*G7_2_2 - 0.0375*G7_2_3 + 0.075*G7_2_4 + 0.0166666666666666*G7_3_1 + 0.0166666666666666*G7_3_2 + 0.15*G7_3_3 + 0.15*G7_3_4 + 0.0458333333333333*G7_7_11 + 0.075*G7_7_13 - 0.0375*G7_7_14 + 0.0458333333333333*G7_8_12 - 0.0375*G7_8_13 + 0.075*G7_8_14 + 0.0166666666666666*G7_9_11 + 0.0166666666666666*G7_9_12 + 0.15*G7_9_13 + 0.15*G7_9_14 + 0.0833333333333333*G7_13_21 + 0.166666666666667*G7_13_23 + 0.0833333333333333*G7_14_22 + 0.166666666666667*G7_14_23;
+        A[1] = -0.0666666666666666*G0_15_15 + 0.0166666666666666*G0_15_17 - 0.0333333333333333*G0_15_19 + 0.0166666666666666*G0_17_15 - 0.0666666666666667*G0_17_17 - 0.0333333333333333*G0_17_19 - 0.0333333333333333*G0_19_15 - 0.0333333333333333*G0_19_17 - 0.266666666666666*G0_19_19 - 0.0666666666666666*G0_21_21 + 0.0166666666666666*G0_21_23 - 0.0333333333333333*G0_21_25 + 0.0166666666666666*G0_23_21 - 0.0666666666666667*G0_23_23 - 0.0333333333333333*G0_23_25 - 0.0333333333333333*G0_25_21 - 0.0333333333333333*G0_25_23 - 0.266666666666666*G0_25_25 - 0.166666666666667*G0_27_27 - 0.0833333333333333*G0_27_29 - 0.0833333333333333*G0_29_27 - 0.166666666666667*G0_29_29 + 0.0458333333333333*G1_15_26 + 0.075*G1_15_31 - 0.0375*G1_15_32 + 0.0458333333333333*G1_17_28 - 0.0375*G1_17_31 + 0.075*G1_17_32 + 0.0166666666666666*G1_19_26 + 0.0166666666666666*G1_19_28 + 0.15*G1_19_31 + 0.15*G1_19_32 + 0.0458333333333333*G1_21_36 + 0.075*G1_21_41 - 0.0375*G1_21_42 + 0.0458333333333333*G1_23_38 - 0.0375*G1_23_41 + 0.075*G1_23_42 + 0.0166666666666666*G1_25_36 + 0.0166666666666666*G1_25_38 + 0.15*G1_25_41 + 0.15*G1_25_42 + 0.0833333333333333*G1_27_46 + 0.166666666666667*G1_27_50 + 0.0833333333333333*G1_29_48 + 0.166666666666667*G1_29_50 - 0.0666666666666667*G2_1_1 + 0.0166666666666666*G2_1_2 - 0.0333333333333333*G2_1_3 + 0.0166666666666666*G2_2_1 - 0.0666666666666667*G2_2_2 - 0.0333333333333333*G2_2_3 - 0.0333333333333333*G2_3_1 - 0.0333333333333333*G2_3_2 - 0.266666666666666*G2_3_3 - 0.0666666666666667*G2_7_7 + 0.0166666666666666*G2_7_8 - 0.0333333333333333*G2_7_9 + 0.0166666666666666*G2_8_7 - 0.0666666666666667*G2_8_8 - 0.0333333333333333*G2_8_9 - 0.0333333333333333*G2_9_7 - 0.0333333333333333*G2_9_8 - 0.266666666666666*G2_9_9 - 0.166666666666667*G2_13_13 - 0.0833333333333333*G2_13_14 - 0.0833333333333333*G2_14_13 - 0.166666666666667*G2_14_14 + 0.0458333333333333*G3_1_1 + 0.075*G3_1_3 - 0.0375*G3_1_4 + 0.0458333333333333*G3_2_2 - 0.0375*G3_2_3 + 0.075*G3_2_4 + 0.0166666666666666*G3_3_1 + 0.0166666666666666*G3_3_2 + 0.15*G3_3_3 + 0.15*G3_3_4 + 0.0458333333333333*G3_7_11 + 0.075*G3_7_13 - 0.0375*G3_7_14 + 0.0458333333333333*G3_8_12 - 0.0375*G3_8_13 + 0.075*G3_8_14 + 0.0166666666666666*G3_9_11 + 0.0166666666666666*G3_9_12 + 0.15*G3_9_13 + 0.15*G3_9_14 + 0.0833333333333333*G3_13_21 + 0.166666666666667*G3_13_23 + 0.0833333333333333*G3_14_22 + 0.166666666666667*G3_14_23;
+          break;
+        }
+      case 2:
+        {
+          A[0] = -0.0666666666666666*G4_15_15 + 0.0166666666666666*G4_15_16 - 0.0333333333333333*G4_15_20 + 0.0166666666666666*G4_16_15 - 0.0666666666666666*G4_16_16 - 0.0333333333333333*G4_16_20 - 0.0333333333333333*G4_20_15 - 0.0333333333333333*G4_20_16 - 0.266666666666667*G4_20_20 - 0.0666666666666666*G4_21_21 + 0.0166666666666666*G4_21_22 - 0.0333333333333333*G4_21_26 + 0.0166666666666666*G4_22_21 - 0.0666666666666666*G4_22_22 - 0.0333333333333333*G4_22_26 - 0.0333333333333333*G4_26_21 - 0.0333333333333333*G4_26_22 - 0.266666666666667*G4_26_26 - 0.166666666666667*G4_27_27 - 0.0833333333333333*G4_27_28 - 0.0833333333333333*G4_28_27 - 0.166666666666667*G4_28_28 + 0.0458333333333333*G5_15_26 + 0.0749999999999999*G5_15_33 - 0.0375*G5_15_34 + 0.0458333333333333*G5_16_27 - 0.0375*G5_16_33 + 0.075*G5_16_34 + 0.0166666666666666*G5_20_26 + 0.0166666666666666*G5_20_27 + 0.15*G5_20_33 + 0.15*G5_20_34 + 0.0458333333333333*G5_21_36 + 0.0749999999999999*G5_21_43 - 0.0375*G5_21_44 + 0.0458333333333333*G5_22_37 - 0.0375*G5_22_43 + 0.075*G5_22_44 + 0.0166666666666666*G5_26_36 + 0.0166666666666666*G5_26_37 + 0.15*G5_26_43 + 0.15*G5_26_44 + 0.0833333333333333*G5_27_46 + 0.166666666666667*G5_27_51 + 0.0833333333333333*G5_28_47 + 0.166666666666667*G5_28_51 - 0.0666666666666667*G6_1_1 + 0.0166666666666666*G6_1_2 - 0.0333333333333333*G6_1_3 + 0.0166666666666666*G6_2_1 - 0.0666666666666667*G6_2_2 - 0.0333333333333333*G6_2_3 - 0.0333333333333333*G6_3_1 - 0.0333333333333333*G6_3_2 - 0.266666666666666*G6_3_3 - 0.0666666666666667*G6_7_7 + 0.0166666666666666*G6_7_8 - 0.0333333333333333*G6_7_9 + 0.0166666666666666*G6_8_7 - 0.0666666666666667*G6_8_8 - 0.0333333333333333*G6_8_9 - 0.0333333333333333*G6_9_7 - 0.0333333333333333*G6_9_8 - 0.266666666666666*G6_9_9 - 0.166666666666667*G6_13_13 - 0.0833333333333333*G6_13_14 - 0.0833333333333333*G6_14_13 - 0.166666666666667*G6_14_14 + 0.0458333333333333*G7_1_1 + 0.075*G7_1_3 - 0.0375*G7_1_4 + 0.0458333333333333*G7_2_2 - 0.0375*G7_2_3 + 0.075*G7_2_4 + 0.0166666666666666*G7_3_1 + 0.0166666666666666*G7_3_2 + 0.15*G7_3_3 + 0.15*G7_3_4 + 0.0458333333333333*G7_7_11 + 0.075*G7_7_13 - 0.0375*G7_7_14 + 0.0458333333333333*G7_8_12 - 0.0375*G7_8_13 + 0.075*G7_8_14 + 0.0166666666666666*G7_9_11 + 0.0166666666666666*G7_9_12 + 0.15*G7_9_13 + 0.15*G7_9_14 + 0.0833333333333333*G7_13_21 + 0.166666666666667*G7_13_23 + 0.0833333333333333*G7_14_22 + 0.166666666666667*G7_14_23;
+        A[1] = -0.0666666666666666*G0_15_15 + 0.0166666666666666*G0_15_16 - 0.0333333333333333*G0_15_20 + 0.0166666666666666*G0_16_15 - 0.0666666666666666*G0_16_16 - 0.0333333333333333*G0_16_20 - 0.0333333333333333*G0_20_15 - 0.0333333333333333*G0_20_16 - 0.266666666666667*G0_20_20 - 0.0666666666666666*G0_21_21 + 0.0166666666666666*G0_21_22 - 0.0333333333333333*G0_21_26 + 0.0166666666666666*G0_22_21 - 0.0666666666666666*G0_22_22 - 0.0333333333333333*G0_22_26 - 0.0333333333333333*G0_26_21 - 0.0333333333333333*G0_26_22 - 0.266666666666667*G0_26_26 - 0.166666666666667*G0_27_27 - 0.0833333333333333*G0_27_28 - 0.0833333333333333*G0_28_27 - 0.166666666666667*G0_28_28 + 0.0458333333333333*G1_15_26 + 0.0749999999999999*G1_15_33 - 0.0375*G1_15_34 + 0.0458333333333333*G1_16_27 - 0.0375*G1_16_33 + 0.075*G1_16_34 + 0.0166666666666666*G1_20_26 + 0.0166666666666666*G1_20_27 + 0.15*G1_20_33 + 0.15*G1_20_34 + 0.0458333333333333*G1_21_36 + 0.0749999999999999*G1_21_43 - 0.0375*G1_21_44 + 0.0458333333333333*G1_22_37 - 0.0375*G1_22_43 + 0.075*G1_22_44 + 0.0166666666666666*G1_26_36 + 0.0166666666666666*G1_26_37 + 0.15*G1_26_43 + 0.15*G1_26_44 + 0.0833333333333333*G1_27_46 + 0.166666666666667*G1_27_51 + 0.0833333333333333*G1_28_47 + 0.166666666666667*G1_28_51 - 0.0666666666666667*G2_1_1 + 0.0166666666666666*G2_1_2 - 0.0333333333333333*G2_1_3 + 0.0166666666666666*G2_2_1 - 0.0666666666666667*G2_2_2 - 0.0333333333333333*G2_2_3 - 0.0333333333333333*G2_3_1 - 0.0333333333333333*G2_3_2 - 0.266666666666666*G2_3_3 - 0.0666666666666667*G2_7_7 + 0.0166666666666666*G2_7_8 - 0.0333333333333333*G2_7_9 + 0.0166666666666666*G2_8_7 - 0.0666666666666667*G2_8_8 - 0.0333333333333333*G2_8_9 - 0.0333333333333333*G2_9_7 - 0.0333333333333333*G2_9_8 - 0.266666666666666*G2_9_9 - 0.166666666666667*G2_13_13 - 0.0833333333333333*G2_13_14 - 0.0833333333333333*G2_14_13 - 0.166666666666667*G2_14_14 + 0.0458333333333333*G3_1_1 + 0.075*G3_1_3 - 0.0375*G3_1_4 + 0.0458333333333333*G3_2_2 - 0.0375*G3_2_3 + 0.075*G3_2_4 + 0.0166666666666666*G3_3_1 + 0.0166666666666666*G3_3_2 + 0.15*G3_3_3 + 0.15*G3_3_4 + 0.0458333333333333*G3_7_11 + 0.075*G3_7_13 - 0.0375*G3_7_14 + 0.0458333333333333*G3_8_12 - 0.0375*G3_8_13 + 0.075*G3_8_14 + 0.0166666666666666*G3_9_11 + 0.0166666666666666*G3_9_12 + 0.15*G3_9_13 + 0.15*G3_9_14 + 0.0833333333333333*G3_13_21 + 0.166666666666667*G3_13_23 + 0.0833333333333333*G3_14_22 + 0.166666666666667*G3_14_23;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = -0.0666666666666667*G4_16_16 + 0.0166666666666666*G4_16_17 - 0.0333333333333333*G4_16_18 + 0.0166666666666666*G4_17_16 - 0.0666666666666667*G4_17_17 - 0.0333333333333333*G4_17_18 - 0.0333333333333333*G4_18_16 - 0.0333333333333333*G4_18_17 - 0.266666666666666*G4_18_18 - 0.0666666666666667*G4_22_22 + 0.0166666666666666*G4_22_23 - 0.0333333333333333*G4_22_24 + 0.0166666666666666*G4_23_22 - 0.0666666666666667*G4_23_23 - 0.0333333333333333*G4_23_24 - 0.0333333333333333*G4_24_22 - 0.0333333333333333*G4_24_23 - 0.266666666666666*G4_24_24 - 0.166666666666667*G4_28_28 - 0.0833333333333333*G4_28_29 - 0.0833333333333333*G4_29_28 - 0.166666666666667*G4_29_29 + 0.0458333333333333*G5_16_27 + 0.075*G5_16_29 - 0.0375*G5_16_30 + 0.0458333333333333*G5_17_28 - 0.0375*G5_17_29 + 0.075*G5_17_30 + 0.0166666666666666*G5_18_27 + 0.0166666666666666*G5_18_28 + 0.15*G5_18_29 + 0.15*G5_18_30 + 0.0458333333333333*G5_22_37 + 0.075*G5_22_39 - 0.0375*G5_22_40 + 0.0458333333333333*G5_23_38 - 0.0375*G5_23_39 + 0.075*G5_23_40 + 0.0166666666666666*G5_24_37 + 0.0166666666666666*G5_24_38 + 0.15*G5_24_39 + 0.15*G5_24_40 + 0.0833333333333333*G5_28_47 + 0.166666666666667*G5_28_49 + 0.0833333333333333*G5_29_48 + 0.166666666666667*G5_29_49 - 0.0666666666666666*G6_0_0 + 0.0166666666666666*G6_0_2 - 0.0333333333333333*G6_0_4 + 0.0166666666666666*G6_2_0 - 0.0666666666666667*G6_2_2 - 0.0333333333333333*G6_2_4 - 0.0333333333333333*G6_4_0 - 0.0333333333333333*G6_4_2 - 0.266666666666666*G6_4_4 - 0.0666666666666666*G6_6_6 + 0.0166666666666666*G6_6_8 - 0.0333333333333333*G6_6_10 + 0.0166666666666666*G6_8_6 - 0.0666666666666667*G6_8_8 - 0.0333333333333333*G6_8_10 - 0.0333333333333333*G6_10_6 - 0.0333333333333333*G6_10_8 - 0.266666666666666*G6_10_10 - 0.166666666666667*G6_12_12 - 0.0833333333333333*G6_12_14 - 0.0833333333333333*G6_14_12 - 0.166666666666667*G6_14_14 + 0.0458333333333333*G7_0_0 + 0.075*G7_0_5 - 0.0375*G7_0_6 + 0.0458333333333333*G7_2_2 - 0.0375*G7_2_5 + 0.075*G7_2_6 + 0.0166666666666666*G7_4_0 + 0.0166666666666666*G7_4_2 + 0.15*G7_4_5 + 0.15*G7_4_6 + 0.0458333333333333*G7_6_10 + 0.075*G7_6_15 - 0.0375*G7_6_16 + 0.0458333333333333*G7_8_12 - 0.0375*G7_8_15 + 0.075*G7_8_16 + 0.0166666666666666*G7_10_10 + 0.0166666666666666*G7_10_12 + 0.15*G7_10_15 + 0.15*G7_10_16 + 0.0833333333333333*G7_12_20 + 0.166666666666667*G7_12_24 + 0.0833333333333333*G7_14_22 + 0.166666666666667*G7_14_24;
+        A[1] = -0.0666666666666667*G0_16_16 + 0.0166666666666666*G0_16_17 - 0.0333333333333333*G0_16_18 + 0.0166666666666666*G0_17_16 - 0.0666666666666667*G0_17_17 - 0.0333333333333333*G0_17_18 - 0.0333333333333333*G0_18_16 - 0.0333333333333333*G0_18_17 - 0.266666666666666*G0_18_18 - 0.0666666666666667*G0_22_22 + 0.0166666666666666*G0_22_23 - 0.0333333333333333*G0_22_24 + 0.0166666666666666*G0_23_22 - 0.0666666666666667*G0_23_23 - 0.0333333333333333*G0_23_24 - 0.0333333333333333*G0_24_22 - 0.0333333333333333*G0_24_23 - 0.266666666666666*G0_24_24 - 0.166666666666667*G0_28_28 - 0.0833333333333333*G0_28_29 - 0.0833333333333333*G0_29_28 - 0.166666666666667*G0_29_29 + 0.0458333333333333*G1_16_27 + 0.075*G1_16_29 - 0.0375*G1_16_30 + 0.0458333333333333*G1_17_28 - 0.0375*G1_17_29 + 0.075*G1_17_30 + 0.0166666666666666*G1_18_27 + 0.0166666666666666*G1_18_28 + 0.15*G1_18_29 + 0.15*G1_18_30 + 0.0458333333333333*G1_22_37 + 0.075*G1_22_39 - 0.0375*G1_22_40 + 0.0458333333333333*G1_23_38 - 0.0375*G1_23_39 + 0.075*G1_23_40 + 0.0166666666666666*G1_24_37 + 0.0166666666666666*G1_24_38 + 0.15*G1_24_39 + 0.15*G1_24_40 + 0.0833333333333333*G1_28_47 + 0.166666666666667*G1_28_49 + 0.0833333333333333*G1_29_48 + 0.166666666666667*G1_29_49 - 0.0666666666666666*G2_0_0 + 0.0166666666666666*G2_0_2 - 0.0333333333333333*G2_0_4 + 0.0166666666666666*G2_2_0 - 0.0666666666666667*G2_2_2 - 0.0333333333333333*G2_2_4 - 0.0333333333333333*G2_4_0 - 0.0333333333333333*G2_4_2 - 0.266666666666666*G2_4_4 - 0.0666666666666666*G2_6_6 + 0.0166666666666666*G2_6_8 - 0.0333333333333333*G2_6_10 + 0.0166666666666666*G2_8_6 - 0.0666666666666667*G2_8_8 - 0.0333333333333333*G2_8_10 - 0.0333333333333333*G2_10_6 - 0.0333333333333333*G2_10_8 - 0.266666666666666*G2_10_10 - 0.166666666666667*G2_12_12 - 0.0833333333333333*G2_12_14 - 0.0833333333333333*G2_14_12 - 0.166666666666667*G2_14_14 + 0.0458333333333333*G3_0_0 + 0.075*G3_0_5 - 0.0375*G3_0_6 + 0.0458333333333333*G3_2_2 - 0.0375*G3_2_5 + 0.075*G3_2_6 + 0.0166666666666666*G3_4_0 + 0.0166666666666666*G3_4_2 + 0.15*G3_4_5 + 0.15*G3_4_6 + 0.0458333333333333*G3_6_10 + 0.075*G3_6_15 - 0.0375*G3_6_16 + 0.0458333333333333*G3_8_12 - 0.0375*G3_8_15 + 0.075*G3_8_16 + 0.0166666666666666*G3_10_10 + 0.0166666666666666*G3_10_12 + 0.15*G3_10_15 + 0.15*G3_10_16 + 0.0833333333333333*G3_12_20 + 0.166666666666667*G3_12_24 + 0.0833333333333333*G3_14_22 + 0.166666666666667*G3_14_24;
+          break;
+        }
+      case 1:
+        {
+          A[0] = -0.0666666666666666*G4_15_15 + 0.0166666666666666*G4_15_17 - 0.0333333333333333*G4_15_19 + 0.0166666666666666*G4_17_15 - 0.0666666666666667*G4_17_17 - 0.0333333333333333*G4_17_19 - 0.0333333333333333*G4_19_15 - 0.0333333333333333*G4_19_17 - 0.266666666666666*G4_19_19 - 0.0666666666666666*G4_21_21 + 0.0166666666666666*G4_21_23 - 0.0333333333333333*G4_21_25 + 0.0166666666666666*G4_23_21 - 0.0666666666666667*G4_23_23 - 0.0333333333333333*G4_23_25 - 0.0333333333333333*G4_25_21 - 0.0333333333333333*G4_25_23 - 0.266666666666666*G4_25_25 - 0.166666666666667*G4_27_27 - 0.0833333333333333*G4_27_29 - 0.0833333333333333*G4_29_27 - 0.166666666666667*G4_29_29 + 0.0458333333333333*G5_15_26 + 0.075*G5_15_31 - 0.0375*G5_15_32 + 0.0458333333333333*G5_17_28 - 0.0375*G5_17_31 + 0.075*G5_17_32 + 0.0166666666666666*G5_19_26 + 0.0166666666666666*G5_19_28 + 0.15*G5_19_31 + 0.15*G5_19_32 + 0.0458333333333333*G5_21_36 + 0.075*G5_21_41 - 0.0375*G5_21_42 + 0.0458333333333333*G5_23_38 - 0.0375*G5_23_41 + 0.075*G5_23_42 + 0.0166666666666666*G5_25_36 + 0.0166666666666666*G5_25_38 + 0.15*G5_25_41 + 0.15*G5_25_42 + 0.0833333333333333*G5_27_46 + 0.166666666666667*G5_27_50 + 0.0833333333333333*G5_29_48 + 0.166666666666667*G5_29_50 - 0.0666666666666666*G6_0_0 + 0.0166666666666666*G6_0_2 - 0.0333333333333333*G6_0_4 + 0.0166666666666666*G6_2_0 - 0.0666666666666667*G6_2_2 - 0.0333333333333333*G6_2_4 - 0.0333333333333333*G6_4_0 - 0.0333333333333333*G6_4_2 - 0.266666666666666*G6_4_4 - 0.0666666666666666*G6_6_6 + 0.0166666666666666*G6_6_8 - 0.0333333333333333*G6_6_10 + 0.0166666666666666*G6_8_6 - 0.0666666666666667*G6_8_8 - 0.0333333333333333*G6_8_10 - 0.0333333333333333*G6_10_6 - 0.0333333333333333*G6_10_8 - 0.266666666666666*G6_10_10 - 0.166666666666667*G6_12_12 - 0.0833333333333333*G6_12_14 - 0.0833333333333333*G6_14_12 - 0.166666666666667*G6_14_14 + 0.0458333333333333*G7_0_0 + 0.075*G7_0_5 - 0.0375*G7_0_6 + 0.0458333333333333*G7_2_2 - 0.0375*G7_2_5 + 0.075*G7_2_6 + 0.0166666666666666*G7_4_0 + 0.0166666666666666*G7_4_2 + 0.15*G7_4_5 + 0.15*G7_4_6 + 0.0458333333333333*G7_6_10 + 0.075*G7_6_15 - 0.0375*G7_6_16 + 0.0458333333333333*G7_8_12 - 0.0375*G7_8_15 + 0.075*G7_8_16 + 0.0166666666666666*G7_10_10 + 0.0166666666666666*G7_10_12 + 0.15*G7_10_15 + 0.15*G7_10_16 + 0.0833333333333333*G7_12_20 + 0.166666666666667*G7_12_24 + 0.0833333333333333*G7_14_22 + 0.166666666666667*G7_14_24;
+        A[1] = -0.0666666666666666*G0_15_15 + 0.0166666666666666*G0_15_17 - 0.0333333333333333*G0_15_19 + 0.0166666666666666*G0_17_15 - 0.0666666666666667*G0_17_17 - 0.0333333333333333*G0_17_19 - 0.0333333333333333*G0_19_15 - 0.0333333333333333*G0_19_17 - 0.266666666666666*G0_19_19 - 0.0666666666666666*G0_21_21 + 0.0166666666666666*G0_21_23 - 0.0333333333333333*G0_21_25 + 0.0166666666666666*G0_23_21 - 0.0666666666666667*G0_23_23 - 0.0333333333333333*G0_23_25 - 0.0333333333333333*G0_25_21 - 0.0333333333333333*G0_25_23 - 0.266666666666666*G0_25_25 - 0.166666666666667*G0_27_27 - 0.0833333333333333*G0_27_29 - 0.0833333333333333*G0_29_27 - 0.166666666666667*G0_29_29 + 0.0458333333333333*G1_15_26 + 0.075*G1_15_31 - 0.0375*G1_15_32 + 0.0458333333333333*G1_17_28 - 0.0375*G1_17_31 + 0.075*G1_17_32 + 0.0166666666666666*G1_19_26 + 0.0166666666666666*G1_19_28 + 0.15*G1_19_31 + 0.15*G1_19_32 + 0.0458333333333333*G1_21_36 + 0.075*G1_21_41 - 0.0375*G1_21_42 + 0.0458333333333333*G1_23_38 - 0.0375*G1_23_41 + 0.075*G1_23_42 + 0.0166666666666666*G1_25_36 + 0.0166666666666666*G1_25_38 + 0.15*G1_25_41 + 0.15*G1_25_42 + 0.0833333333333333*G1_27_46 + 0.166666666666667*G1_27_50 + 0.0833333333333333*G1_29_48 + 0.166666666666667*G1_29_50 - 0.0666666666666666*G2_0_0 + 0.0166666666666666*G2_0_2 - 0.0333333333333333*G2_0_4 + 0.0166666666666666*G2_2_0 - 0.0666666666666667*G2_2_2 - 0.0333333333333333*G2_2_4 - 0.0333333333333333*G2_4_0 - 0.0333333333333333*G2_4_2 - 0.266666666666666*G2_4_4 - 0.0666666666666666*G2_6_6 + 0.0166666666666666*G2_6_8 - 0.0333333333333333*G2_6_10 + 0.0166666666666666*G2_8_6 - 0.0666666666666667*G2_8_8 - 0.0333333333333333*G2_8_10 - 0.0333333333333333*G2_10_6 - 0.0333333333333333*G2_10_8 - 0.266666666666666*G2_10_10 - 0.166666666666667*G2_12_12 - 0.0833333333333333*G2_12_14 - 0.0833333333333333*G2_14_12 - 0.166666666666667*G2_14_14 + 0.0458333333333333*G3_0_0 + 0.075*G3_0_5 - 0.0375*G3_0_6 + 0.0458333333333333*G3_2_2 - 0.0375*G3_2_5 + 0.075*G3_2_6 + 0.0166666666666666*G3_4_0 + 0.0166666666666666*G3_4_2 + 0.15*G3_4_5 + 0.15*G3_4_6 + 0.0458333333333333*G3_6_10 + 0.075*G3_6_15 - 0.0375*G3_6_16 + 0.0458333333333333*G3_8_12 - 0.0375*G3_8_15 + 0.075*G3_8_16 + 0.0166666666666666*G3_10_10 + 0.0166666666666666*G3_10_12 + 0.15*G3_10_15 + 0.15*G3_10_16 + 0.0833333333333333*G3_12_20 + 0.166666666666667*G3_12_24 + 0.0833333333333333*G3_14_22 + 0.166666666666667*G3_14_24;
+          break;
+        }
+      case 2:
+        {
+          A[0] = -0.0666666666666666*G4_15_15 + 0.0166666666666666*G4_15_16 - 0.0333333333333333*G4_15_20 + 0.0166666666666666*G4_16_15 - 0.0666666666666666*G4_16_16 - 0.0333333333333333*G4_16_20 - 0.0333333333333333*G4_20_15 - 0.0333333333333333*G4_20_16 - 0.266666666666667*G4_20_20 - 0.0666666666666666*G4_21_21 + 0.0166666666666666*G4_21_22 - 0.0333333333333333*G4_21_26 + 0.0166666666666666*G4_22_21 - 0.0666666666666666*G4_22_22 - 0.0333333333333333*G4_22_26 - 0.0333333333333333*G4_26_21 - 0.0333333333333333*G4_26_22 - 0.266666666666667*G4_26_26 - 0.166666666666667*G4_27_27 - 0.0833333333333333*G4_27_28 - 0.0833333333333333*G4_28_27 - 0.166666666666667*G4_28_28 + 0.0458333333333333*G5_15_26 + 0.0749999999999999*G5_15_33 - 0.0375*G5_15_34 + 0.0458333333333333*G5_16_27 - 0.0375*G5_16_33 + 0.075*G5_16_34 + 0.0166666666666666*G5_20_26 + 0.0166666666666666*G5_20_27 + 0.15*G5_20_33 + 0.15*G5_20_34 + 0.0458333333333333*G5_21_36 + 0.0749999999999999*G5_21_43 - 0.0375*G5_21_44 + 0.0458333333333333*G5_22_37 - 0.0375*G5_22_43 + 0.075*G5_22_44 + 0.0166666666666666*G5_26_36 + 0.0166666666666666*G5_26_37 + 0.15*G5_26_43 + 0.15*G5_26_44 + 0.0833333333333333*G5_27_46 + 0.166666666666667*G5_27_51 + 0.0833333333333333*G5_28_47 + 0.166666666666667*G5_28_51 - 0.0666666666666666*G6_0_0 + 0.0166666666666666*G6_0_2 - 0.0333333333333333*G6_0_4 + 0.0166666666666666*G6_2_0 - 0.0666666666666667*G6_2_2 - 0.0333333333333333*G6_2_4 - 0.0333333333333333*G6_4_0 - 0.0333333333333333*G6_4_2 - 0.266666666666666*G6_4_4 - 0.0666666666666666*G6_6_6 + 0.0166666666666666*G6_6_8 - 0.0333333333333333*G6_6_10 + 0.0166666666666666*G6_8_6 - 0.0666666666666667*G6_8_8 - 0.0333333333333333*G6_8_10 - 0.0333333333333333*G6_10_6 - 0.0333333333333333*G6_10_8 - 0.266666666666666*G6_10_10 - 0.166666666666667*G6_12_12 - 0.0833333333333333*G6_12_14 - 0.0833333333333333*G6_14_12 - 0.166666666666667*G6_14_14 + 0.0458333333333333*G7_0_0 + 0.075*G7_0_5 - 0.0375*G7_0_6 + 0.0458333333333333*G7_2_2 - 0.0375*G7_2_5 + 0.075*G7_2_6 + 0.0166666666666666*G7_4_0 + 0.0166666666666666*G7_4_2 + 0.15*G7_4_5 + 0.15*G7_4_6 + 0.0458333333333333*G7_6_10 + 0.075*G7_6_15 - 0.0375*G7_6_16 + 0.0458333333333333*G7_8_12 - 0.0375*G7_8_15 + 0.075*G7_8_16 + 0.0166666666666666*G7_10_10 + 0.0166666666666666*G7_10_12 + 0.15*G7_10_15 + 0.15*G7_10_16 + 0.0833333333333333*G7_12_20 + 0.166666666666667*G7_12_24 + 0.0833333333333333*G7_14_22 + 0.166666666666667*G7_14_24;
+        A[1] = -0.0666666666666666*G0_15_15 + 0.0166666666666666*G0_15_16 - 0.0333333333333333*G0_15_20 + 0.0166666666666666*G0_16_15 - 0.0666666666666666*G0_16_16 - 0.0333333333333333*G0_16_20 - 0.0333333333333333*G0_20_15 - 0.0333333333333333*G0_20_16 - 0.266666666666667*G0_20_20 - 0.0666666666666666*G0_21_21 + 0.0166666666666666*G0_21_22 - 0.0333333333333333*G0_21_26 + 0.0166666666666666*G0_22_21 - 0.0666666666666666*G0_22_22 - 0.0333333333333333*G0_22_26 - 0.0333333333333333*G0_26_21 - 0.0333333333333333*G0_26_22 - 0.266666666666667*G0_26_26 - 0.166666666666667*G0_27_27 - 0.0833333333333333*G0_27_28 - 0.0833333333333333*G0_28_27 - 0.166666666666667*G0_28_28 + 0.0458333333333333*G1_15_26 + 0.0749999999999999*G1_15_33 - 0.0375*G1_15_34 + 0.0458333333333333*G1_16_27 - 0.0375*G1_16_33 + 0.075*G1_16_34 + 0.0166666666666666*G1_20_26 + 0.0166666666666666*G1_20_27 + 0.15*G1_20_33 + 0.15*G1_20_34 + 0.0458333333333333*G1_21_36 + 0.0749999999999999*G1_21_43 - 0.0375*G1_21_44 + 0.0458333333333333*G1_22_37 - 0.0375*G1_22_43 + 0.075*G1_22_44 + 0.0166666666666666*G1_26_36 + 0.0166666666666666*G1_26_37 + 0.15*G1_26_43 + 0.15*G1_26_44 + 0.0833333333333333*G1_27_46 + 0.166666666666667*G1_27_51 + 0.0833333333333333*G1_28_47 + 0.166666666666667*G1_28_51 - 0.0666666666666666*G2_0_0 + 0.0166666666666666*G2_0_2 - 0.0333333333333333*G2_0_4 + 0.0166666666666666*G2_2_0 - 0.0666666666666667*G2_2_2 - 0.0333333333333333*G2_2_4 - 0.0333333333333333*G2_4_0 - 0.0333333333333333*G2_4_2 - 0.266666666666666*G2_4_4 - 0.0666666666666666*G2_6_6 + 0.0166666666666666*G2_6_8 - 0.0333333333333333*G2_6_10 + 0.0166666666666666*G2_8_6 - 0.0666666666666667*G2_8_8 - 0.0333333333333333*G2_8_10 - 0.0333333333333333*G2_10_6 - 0.0333333333333333*G2_10_8 - 0.266666666666666*G2_10_10 - 0.166666666666667*G2_12_12 - 0.0833333333333333*G2_12_14 - 0.0833333333333333*G2_14_12 - 0.166666666666667*G2_14_14 + 0.0458333333333333*G3_0_0 + 0.075*G3_0_5 - 0.0375*G3_0_6 + 0.0458333333333333*G3_2_2 - 0.0375*G3_2_5 + 0.075*G3_2_6 + 0.0166666666666666*G3_4_0 + 0.0166666666666666*G3_4_2 + 0.15*G3_4_5 + 0.15*G3_4_6 + 0.0458333333333333*G3_6_10 + 0.075*G3_6_15 - 0.0375*G3_6_16 + 0.0458333333333333*G3_8_12 - 0.0375*G3_8_15 + 0.075*G3_8_16 + 0.0166666666666666*G3_10_10 + 0.0166666666666666*G3_10_12 + 0.15*G3_10_15 + 0.15*G3_10_16 + 0.0833333333333333*G3_12_20 + 0.166666666666667*G3_12_24 + 0.0833333333333333*G3_14_22 + 0.166666666666667*G3_14_24;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          A[0] = -0.0666666666666667*G4_16_16 + 0.0166666666666666*G4_16_17 - 0.0333333333333333*G4_16_18 + 0.0166666666666666*G4_17_16 - 0.0666666666666667*G4_17_17 - 0.0333333333333333*G4_17_18 - 0.0333333333333333*G4_18_16 - 0.0333333333333333*G4_18_17 - 0.266666666666666*G4_18_18 - 0.0666666666666667*G4_22_22 + 0.0166666666666666*G4_22_23 - 0.0333333333333333*G4_22_24 + 0.0166666666666666*G4_23_22 - 0.0666666666666667*G4_23_23 - 0.0333333333333333*G4_23_24 - 0.0333333333333333*G4_24_22 - 0.0333333333333333*G4_24_23 - 0.266666666666666*G4_24_24 - 0.166666666666667*G4_28_28 - 0.0833333333333333*G4_28_29 - 0.0833333333333333*G4_29_28 - 0.166666666666667*G4_29_29 + 0.0458333333333333*G5_16_27 + 0.075*G5_16_29 - 0.0375*G5_16_30 + 0.0458333333333333*G5_17_28 - 0.0375*G5_17_29 + 0.075*G5_17_30 + 0.0166666666666666*G5_18_27 + 0.0166666666666666*G5_18_28 + 0.15*G5_18_29 + 0.15*G5_18_30 + 0.0458333333333333*G5_22_37 + 0.075*G5_22_39 - 0.0375*G5_22_40 + 0.0458333333333333*G5_23_38 - 0.0375*G5_23_39 + 0.075*G5_23_40 + 0.0166666666666666*G5_24_37 + 0.0166666666666666*G5_24_38 + 0.15*G5_24_39 + 0.15*G5_24_40 + 0.0833333333333333*G5_28_47 + 0.166666666666667*G5_28_49 + 0.0833333333333333*G5_29_48 + 0.166666666666667*G5_29_49 - 0.0666666666666666*G6_0_0 + 0.0166666666666666*G6_0_1 - 0.0333333333333333*G6_0_5 + 0.0166666666666666*G6_1_0 - 0.0666666666666666*G6_1_1 - 0.0333333333333333*G6_1_5 - 0.0333333333333333*G6_5_0 - 0.0333333333333333*G6_5_1 - 0.266666666666667*G6_5_5 - 0.0666666666666666*G6_6_6 + 0.0166666666666666*G6_6_7 - 0.0333333333333333*G6_6_11 + 0.0166666666666666*G6_7_6 - 0.0666666666666666*G6_7_7 - 0.0333333333333333*G6_7_11 - 0.0333333333333333*G6_11_6 - 0.0333333333333333*G6_11_7 - 0.266666666666667*G6_11_11 - 0.166666666666667*G6_12_12 - 0.0833333333333333*G6_12_13 - 0.0833333333333333*G6_13_12 - 0.166666666666667*G6_13_13 + 0.0458333333333333*G7_0_0 + 0.0749999999999999*G7_0_7 - 0.0375*G7_0_8 + 0.0458333333333333*G7_1_1 - 0.0375*G7_1_7 + 0.075*G7_1_8 + 0.0166666666666666*G7_5_0 + 0.0166666666666666*G7_5_1 + 0.15*G7_5_7 + 0.15*G7_5_8 + 0.0458333333333333*G7_6_10 + 0.0749999999999999*G7_6_17 - 0.0375*G7_6_18 + 0.0458333333333333*G7_7_11 - 0.0375*G7_7_17 + 0.075*G7_7_18 + 0.0166666666666666*G7_11_10 + 0.0166666666666666*G7_11_11 + 0.15*G7_11_17 + 0.15*G7_11_18 + 0.0833333333333333*G7_12_20 + 0.166666666666667*G7_12_25 + 0.0833333333333333*G7_13_21 + 0.166666666666667*G7_13_25;
+        A[1] = -0.0666666666666667*G0_16_16 + 0.0166666666666666*G0_16_17 - 0.0333333333333333*G0_16_18 + 0.0166666666666666*G0_17_16 - 0.0666666666666667*G0_17_17 - 0.0333333333333333*G0_17_18 - 0.0333333333333333*G0_18_16 - 0.0333333333333333*G0_18_17 - 0.266666666666666*G0_18_18 - 0.0666666666666667*G0_22_22 + 0.0166666666666666*G0_22_23 - 0.0333333333333333*G0_22_24 + 0.0166666666666666*G0_23_22 - 0.0666666666666667*G0_23_23 - 0.0333333333333333*G0_23_24 - 0.0333333333333333*G0_24_22 - 0.0333333333333333*G0_24_23 - 0.266666666666666*G0_24_24 - 0.166666666666667*G0_28_28 - 0.0833333333333333*G0_28_29 - 0.0833333333333333*G0_29_28 - 0.166666666666667*G0_29_29 + 0.0458333333333333*G1_16_27 + 0.075*G1_16_29 - 0.0375*G1_16_30 + 0.0458333333333333*G1_17_28 - 0.0375*G1_17_29 + 0.075*G1_17_30 + 0.0166666666666666*G1_18_27 + 0.0166666666666666*G1_18_28 + 0.15*G1_18_29 + 0.15*G1_18_30 + 0.0458333333333333*G1_22_37 + 0.075*G1_22_39 - 0.0375*G1_22_40 + 0.0458333333333333*G1_23_38 - 0.0375*G1_23_39 + 0.075*G1_23_40 + 0.0166666666666666*G1_24_37 + 0.0166666666666666*G1_24_38 + 0.15*G1_24_39 + 0.15*G1_24_40 + 0.0833333333333333*G1_28_47 + 0.166666666666667*G1_28_49 + 0.0833333333333333*G1_29_48 + 0.166666666666667*G1_29_49 - 0.0666666666666666*G2_0_0 + 0.0166666666666666*G2_0_1 - 0.0333333333333333*G2_0_5 + 0.0166666666666666*G2_1_0 - 0.0666666666666666*G2_1_1 - 0.0333333333333333*G2_1_5 - 0.0333333333333333*G2_5_0 - 0.0333333333333333*G2_5_1 - 0.266666666666667*G2_5_5 - 0.0666666666666666*G2_6_6 + 0.0166666666666666*G2_6_7 - 0.0333333333333333*G2_6_11 + 0.0166666666666666*G2_7_6 - 0.0666666666666666*G2_7_7 - 0.0333333333333333*G2_7_11 - 0.0333333333333333*G2_11_6 - 0.0333333333333333*G2_11_7 - 0.266666666666667*G2_11_11 - 0.166666666666667*G2_12_12 - 0.0833333333333333*G2_12_13 - 0.0833333333333333*G2_13_12 - 0.166666666666667*G2_13_13 + 0.0458333333333333*G3_0_0 + 0.0749999999999999*G3_0_7 - 0.0375*G3_0_8 + 0.0458333333333333*G3_1_1 - 0.0375*G3_1_7 + 0.075*G3_1_8 + 0.0166666666666666*G3_5_0 + 0.0166666666666666*G3_5_1 + 0.15*G3_5_7 + 0.15*G3_5_8 + 0.0458333333333333*G3_6_10 + 0.0749999999999999*G3_6_17 - 0.0375*G3_6_18 + 0.0458333333333333*G3_7_11 - 0.0375*G3_7_17 + 0.075*G3_7_18 + 0.0166666666666666*G3_11_10 + 0.0166666666666666*G3_11_11 + 0.15*G3_11_17 + 0.15*G3_11_18 + 0.0833333333333333*G3_12_20 + 0.166666666666667*G3_12_25 + 0.0833333333333333*G3_13_21 + 0.166666666666667*G3_13_25;
+          break;
+        }
+      case 1:
+        {
+          A[0] = -0.0666666666666666*G4_15_15 + 0.0166666666666666*G4_15_17 - 0.0333333333333333*G4_15_19 + 0.0166666666666666*G4_17_15 - 0.0666666666666667*G4_17_17 - 0.0333333333333333*G4_17_19 - 0.0333333333333333*G4_19_15 - 0.0333333333333333*G4_19_17 - 0.266666666666666*G4_19_19 - 0.0666666666666666*G4_21_21 + 0.0166666666666666*G4_21_23 - 0.0333333333333333*G4_21_25 + 0.0166666666666666*G4_23_21 - 0.0666666666666667*G4_23_23 - 0.0333333333333333*G4_23_25 - 0.0333333333333333*G4_25_21 - 0.0333333333333333*G4_25_23 - 0.266666666666666*G4_25_25 - 0.166666666666667*G4_27_27 - 0.0833333333333333*G4_27_29 - 0.0833333333333333*G4_29_27 - 0.166666666666667*G4_29_29 + 0.0458333333333333*G5_15_26 + 0.075*G5_15_31 - 0.0375*G5_15_32 + 0.0458333333333333*G5_17_28 - 0.0375*G5_17_31 + 0.075*G5_17_32 + 0.0166666666666666*G5_19_26 + 0.0166666666666666*G5_19_28 + 0.15*G5_19_31 + 0.15*G5_19_32 + 0.0458333333333333*G5_21_36 + 0.075*G5_21_41 - 0.0375*G5_21_42 + 0.0458333333333333*G5_23_38 - 0.0375*G5_23_41 + 0.075*G5_23_42 + 0.0166666666666666*G5_25_36 + 0.0166666666666666*G5_25_38 + 0.15*G5_25_41 + 0.15*G5_25_42 + 0.0833333333333333*G5_27_46 + 0.166666666666667*G5_27_50 + 0.0833333333333333*G5_29_48 + 0.166666666666667*G5_29_50 - 0.0666666666666666*G6_0_0 + 0.0166666666666666*G6_0_1 - 0.0333333333333333*G6_0_5 + 0.0166666666666666*G6_1_0 - 0.0666666666666666*G6_1_1 - 0.0333333333333333*G6_1_5 - 0.0333333333333333*G6_5_0 - 0.0333333333333333*G6_5_1 - 0.266666666666667*G6_5_5 - 0.0666666666666666*G6_6_6 + 0.0166666666666666*G6_6_7 - 0.0333333333333333*G6_6_11 + 0.0166666666666666*G6_7_6 - 0.0666666666666666*G6_7_7 - 0.0333333333333333*G6_7_11 - 0.0333333333333333*G6_11_6 - 0.0333333333333333*G6_11_7 - 0.266666666666667*G6_11_11 - 0.166666666666667*G6_12_12 - 0.0833333333333333*G6_12_13 - 0.0833333333333333*G6_13_12 - 0.166666666666667*G6_13_13 + 0.0458333333333333*G7_0_0 + 0.0749999999999999*G7_0_7 - 0.0375*G7_0_8 + 0.0458333333333333*G7_1_1 - 0.0375*G7_1_7 + 0.075*G7_1_8 + 0.0166666666666666*G7_5_0 + 0.0166666666666666*G7_5_1 + 0.15*G7_5_7 + 0.15*G7_5_8 + 0.0458333333333333*G7_6_10 + 0.0749999999999999*G7_6_17 - 0.0375*G7_6_18 + 0.0458333333333333*G7_7_11 - 0.0375*G7_7_17 + 0.075*G7_7_18 + 0.0166666666666666*G7_11_10 + 0.0166666666666666*G7_11_11 + 0.15*G7_11_17 + 0.15*G7_11_18 + 0.0833333333333333*G7_12_20 + 0.166666666666667*G7_12_25 + 0.0833333333333333*G7_13_21 + 0.166666666666667*G7_13_25;
+        A[1] = -0.0666666666666666*G0_15_15 + 0.0166666666666666*G0_15_17 - 0.0333333333333333*G0_15_19 + 0.0166666666666666*G0_17_15 - 0.0666666666666667*G0_17_17 - 0.0333333333333333*G0_17_19 - 0.0333333333333333*G0_19_15 - 0.0333333333333333*G0_19_17 - 0.266666666666666*G0_19_19 - 0.0666666666666666*G0_21_21 + 0.0166666666666666*G0_21_23 - 0.0333333333333333*G0_21_25 + 0.0166666666666666*G0_23_21 - 0.0666666666666667*G0_23_23 - 0.0333333333333333*G0_23_25 - 0.0333333333333333*G0_25_21 - 0.0333333333333333*G0_25_23 - 0.266666666666666*G0_25_25 - 0.166666666666667*G0_27_27 - 0.0833333333333333*G0_27_29 - 0.0833333333333333*G0_29_27 - 0.166666666666667*G0_29_29 + 0.0458333333333333*G1_15_26 + 0.075*G1_15_31 - 0.0375*G1_15_32 + 0.0458333333333333*G1_17_28 - 0.0375*G1_17_31 + 0.075*G1_17_32 + 0.0166666666666666*G1_19_26 + 0.0166666666666666*G1_19_28 + 0.15*G1_19_31 + 0.15*G1_19_32 + 0.0458333333333333*G1_21_36 + 0.075*G1_21_41 - 0.0375*G1_21_42 + 0.0458333333333333*G1_23_38 - 0.0375*G1_23_41 + 0.075*G1_23_42 + 0.0166666666666666*G1_25_36 + 0.0166666666666666*G1_25_38 + 0.15*G1_25_41 + 0.15*G1_25_42 + 0.0833333333333333*G1_27_46 + 0.166666666666667*G1_27_50 + 0.0833333333333333*G1_29_48 + 0.166666666666667*G1_29_50 - 0.0666666666666666*G2_0_0 + 0.0166666666666666*G2_0_1 - 0.0333333333333333*G2_0_5 + 0.0166666666666666*G2_1_0 - 0.0666666666666666*G2_1_1 - 0.0333333333333333*G2_1_5 - 0.0333333333333333*G2_5_0 - 0.0333333333333333*G2_5_1 - 0.266666666666667*G2_5_5 - 0.0666666666666666*G2_6_6 + 0.0166666666666666*G2_6_7 - 0.0333333333333333*G2_6_11 + 0.0166666666666666*G2_7_6 - 0.0666666666666666*G2_7_7 - 0.0333333333333333*G2_7_11 - 0.0333333333333333*G2_11_6 - 0.0333333333333333*G2_11_7 - 0.266666666666667*G2_11_11 - 0.166666666666667*G2_12_12 - 0.0833333333333333*G2_12_13 - 0.0833333333333333*G2_13_12 - 0.166666666666667*G2_13_13 + 0.0458333333333333*G3_0_0 + 0.0749999999999999*G3_0_7 - 0.0375*G3_0_8 + 0.0458333333333333*G3_1_1 - 0.0375*G3_1_7 + 0.075*G3_1_8 + 0.0166666666666666*G3_5_0 + 0.0166666666666666*G3_5_1 + 0.15*G3_5_7 + 0.15*G3_5_8 + 0.0458333333333333*G3_6_10 + 0.0749999999999999*G3_6_17 - 0.0375*G3_6_18 + 0.0458333333333333*G3_7_11 - 0.0375*G3_7_17 + 0.075*G3_7_18 + 0.0166666666666666*G3_11_10 + 0.0166666666666666*G3_11_11 + 0.15*G3_11_17 + 0.15*G3_11_18 + 0.0833333333333333*G3_12_20 + 0.166666666666667*G3_12_25 + 0.0833333333333333*G3_13_21 + 0.166666666666667*G3_13_25;
+          break;
+        }
+      case 2:
+        {
+          A[0] = -0.0666666666666666*G4_15_15 + 0.0166666666666666*G4_15_16 - 0.0333333333333333*G4_15_20 + 0.0166666666666666*G4_16_15 - 0.0666666666666666*G4_16_16 - 0.0333333333333333*G4_16_20 - 0.0333333333333333*G4_20_15 - 0.0333333333333333*G4_20_16 - 0.266666666666667*G4_20_20 - 0.0666666666666666*G4_21_21 + 0.0166666666666666*G4_21_22 - 0.0333333333333333*G4_21_26 + 0.0166666666666666*G4_22_21 - 0.0666666666666666*G4_22_22 - 0.0333333333333333*G4_22_26 - 0.0333333333333333*G4_26_21 - 0.0333333333333333*G4_26_22 - 0.266666666666667*G4_26_26 - 0.166666666666667*G4_27_27 - 0.0833333333333333*G4_27_28 - 0.0833333333333333*G4_28_27 - 0.166666666666667*G4_28_28 + 0.0458333333333333*G5_15_26 + 0.0749999999999999*G5_15_33 - 0.0375*G5_15_34 + 0.0458333333333333*G5_16_27 - 0.0375*G5_16_33 + 0.075*G5_16_34 + 0.0166666666666666*G5_20_26 + 0.0166666666666666*G5_20_27 + 0.15*G5_20_33 + 0.15*G5_20_34 + 0.0458333333333333*G5_21_36 + 0.0749999999999999*G5_21_43 - 0.0375*G5_21_44 + 0.0458333333333333*G5_22_37 - 0.0375*G5_22_43 + 0.075*G5_22_44 + 0.0166666666666666*G5_26_36 + 0.0166666666666666*G5_26_37 + 0.15*G5_26_43 + 0.15*G5_26_44 + 0.0833333333333333*G5_27_46 + 0.166666666666667*G5_27_51 + 0.0833333333333333*G5_28_47 + 0.166666666666667*G5_28_51 - 0.0666666666666666*G6_0_0 + 0.0166666666666666*G6_0_1 - 0.0333333333333333*G6_0_5 + 0.0166666666666666*G6_1_0 - 0.0666666666666666*G6_1_1 - 0.0333333333333333*G6_1_5 - 0.0333333333333333*G6_5_0 - 0.0333333333333333*G6_5_1 - 0.266666666666667*G6_5_5 - 0.0666666666666666*G6_6_6 + 0.0166666666666666*G6_6_7 - 0.0333333333333333*G6_6_11 + 0.0166666666666666*G6_7_6 - 0.0666666666666666*G6_7_7 - 0.0333333333333333*G6_7_11 - 0.0333333333333333*G6_11_6 - 0.0333333333333333*G6_11_7 - 0.266666666666667*G6_11_11 - 0.166666666666667*G6_12_12 - 0.0833333333333333*G6_12_13 - 0.0833333333333333*G6_13_12 - 0.166666666666667*G6_13_13 + 0.0458333333333333*G7_0_0 + 0.0749999999999999*G7_0_7 - 0.0375*G7_0_8 + 0.0458333333333333*G7_1_1 - 0.0375*G7_1_7 + 0.075*G7_1_8 + 0.0166666666666666*G7_5_0 + 0.0166666666666666*G7_5_1 + 0.15*G7_5_7 + 0.15*G7_5_8 + 0.0458333333333333*G7_6_10 + 0.0749999999999999*G7_6_17 - 0.0375*G7_6_18 + 0.0458333333333333*G7_7_11 - 0.0375*G7_7_17 + 0.075*G7_7_18 + 0.0166666666666666*G7_11_10 + 0.0166666666666666*G7_11_11 + 0.15*G7_11_17 + 0.15*G7_11_18 + 0.0833333333333333*G7_12_20 + 0.166666666666667*G7_12_25 + 0.0833333333333333*G7_13_21 + 0.166666666666667*G7_13_25;
+        A[1] = -0.0666666666666666*G0_15_15 + 0.0166666666666666*G0_15_16 - 0.0333333333333333*G0_15_20 + 0.0166666666666666*G0_16_15 - 0.0666666666666666*G0_16_16 - 0.0333333333333333*G0_16_20 - 0.0333333333333333*G0_20_15 - 0.0333333333333333*G0_20_16 - 0.266666666666667*G0_20_20 - 0.0666666666666666*G0_21_21 + 0.0166666666666666*G0_21_22 - 0.0333333333333333*G0_21_26 + 0.0166666666666666*G0_22_21 - 0.0666666666666666*G0_22_22 - 0.0333333333333333*G0_22_26 - 0.0333333333333333*G0_26_21 - 0.0333333333333333*G0_26_22 - 0.266666666666667*G0_26_26 - 0.166666666666667*G0_27_27 - 0.0833333333333333*G0_27_28 - 0.0833333333333333*G0_28_27 - 0.166666666666667*G0_28_28 + 0.0458333333333333*G1_15_26 + 0.0749999999999999*G1_15_33 - 0.0375*G1_15_34 + 0.0458333333333333*G1_16_27 - 0.0375*G1_16_33 + 0.075*G1_16_34 + 0.0166666666666666*G1_20_26 + 0.0166666666666666*G1_20_27 + 0.15*G1_20_33 + 0.15*G1_20_34 + 0.0458333333333333*G1_21_36 + 0.0749999999999999*G1_21_43 - 0.0375*G1_21_44 + 0.0458333333333333*G1_22_37 - 0.0375*G1_22_43 + 0.075*G1_22_44 + 0.0166666666666666*G1_26_36 + 0.0166666666666666*G1_26_37 + 0.15*G1_26_43 + 0.15*G1_26_44 + 0.0833333333333333*G1_27_46 + 0.166666666666667*G1_27_51 + 0.0833333333333333*G1_28_47 + 0.166666666666667*G1_28_51 - 0.0666666666666666*G2_0_0 + 0.0166666666666666*G2_0_1 - 0.0333333333333333*G2_0_5 + 0.0166666666666666*G2_1_0 - 0.0666666666666666*G2_1_1 - 0.0333333333333333*G2_1_5 - 0.0333333333333333*G2_5_0 - 0.0333333333333333*G2_5_1 - 0.266666666666667*G2_5_5 - 0.0666666666666666*G2_6_6 + 0.0166666666666666*G2_6_7 - 0.0333333333333333*G2_6_11 + 0.0166666666666666*G2_7_6 - 0.0666666666666666*G2_7_7 - 0.0333333333333333*G2_7_11 - 0.0333333333333333*G2_11_6 - 0.0333333333333333*G2_11_7 - 0.266666666666667*G2_11_11 - 0.166666666666667*G2_12_12 - 0.0833333333333333*G2_12_13 - 0.0833333333333333*G2_13_12 - 0.166666666666667*G2_13_13 + 0.0458333333333333*G3_0_0 + 0.0749999999999999*G3_0_7 - 0.0375*G3_0_8 + 0.0458333333333333*G3_1_1 - 0.0375*G3_1_7 + 0.075*G3_1_8 + 0.0166666666666666*G3_5_0 + 0.0166666666666666*G3_5_1 + 0.15*G3_5_7 + 0.15*G3_5_8 + 0.0458333333333333*G3_6_10 + 0.0749999999999999*G3_6_17 - 0.0375*G3_6_18 + 0.0458333333333333*G3_7_11 - 0.0375*G3_7_17 + 0.075*G3_7_18 + 0.0166666666666666*G3_11_10 + 0.0166666666666666*G3_11_11 + 0.15*G3_11_17 + 0.15*G3_11_18 + 0.0833333333333333*G3_12_20 + 0.166666666666667*G3_12_25 + 0.0833333333333333*G3_13_21 + 0.166666666666667*G3_13_25;
+          break;
+        }
+      }
+      
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivenavierstokes_cell_integral_8_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_cell_integral_8_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_cell_integral_8_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    172
+    // Number of operations (multiply-add pairs) for tensor contraction: 2992
+    // Total number of operations (multiply-add pairs):                  3167
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G0_0_1 = det*w[0][0]*K[2]*(1.0);
+    const double G0_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G0_2_1 = det*w[0][2]*K[2]*(1.0);
+    const double G0_3_0 = det*w[0][3]*K[0]*(1.0);
+    const double G0_3_1 = det*w[0][3]*K[2]*(1.0);
+    const double G0_4_0 = det*w[0][4]*K[0]*(1.0);
+    const double G0_4_1 = det*w[0][4]*K[2]*(1.0);
+    const double G0_5_0 = det*w[0][5]*K[0]*(1.0);
+    const double G0_5_1 = det*w[0][5]*K[2]*(1.0);
+    const double G1_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G1_0_1 = det*w[0][0]*K[2]*(1.0);
+    const double G1_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G1_1_1 = det*w[0][1]*K[2]*(1.0);
+    const double G1_2_0 = det*w[0][2]*K[0]*(1.0);
+    const double G1_2_1 = det*w[0][2]*K[2]*(1.0);
+    const double G1_3_0 = det*w[0][3]*K[0]*(1.0);
+    const double G1_3_1 = det*w[0][3]*K[2]*(1.0);
+    const double G1_4_0 = det*w[0][4]*K[0]*(1.0);
+    const double G1_4_1 = det*w[0][4]*K[2]*(1.0);
+    const double G1_5_0 = det*w[0][5]*K[0]*(1.0);
+    const double G1_5_1 = det*w[0][5]*K[2]*(1.0);
+    const double G2_0_0 = det*w[0][0]*K[1]*(1.0);
+    const double G2_0_1 = det*w[0][0]*K[3]*(1.0);
+    const double G2_1_0 = det*w[0][1]*K[1]*(1.0);
+    const double G2_2_1 = det*w[0][2]*K[3]*(1.0);
+    const double G2_3_0 = det*w[0][3]*K[1]*(1.0);
+    const double G2_3_1 = det*w[0][3]*K[3]*(1.0);
+    const double G2_4_0 = det*w[0][4]*K[1]*(1.0);
+    const double G2_4_1 = det*w[0][4]*K[3]*(1.0);
+    const double G2_5_0 = det*w[0][5]*K[1]*(1.0);
+    const double G2_5_1 = det*w[0][5]*K[3]*(1.0);
+    const double G3_6_0 = det*w[0][6]*K[1]*(1.0);
+    const double G3_6_1 = det*w[0][6]*K[3]*(1.0);
+    const double G3_7_0 = det*w[0][7]*K[1]*(1.0);
+    const double G3_7_1 = det*w[0][7]*K[3]*(1.0);
+    const double G3_8_0 = det*w[0][8]*K[1]*(1.0);
+    const double G3_8_1 = det*w[0][8]*K[3]*(1.0);
+    const double G3_9_0 = det*w[0][9]*K[1]*(1.0);
+    const double G3_9_1 = det*w[0][9]*K[3]*(1.0);
+    const double G3_10_0 = det*w[0][10]*K[1]*(1.0);
+    const double G3_10_1 = det*w[0][10]*K[3]*(1.0);
+    const double G3_11_0 = det*w[0][11]*K[1]*(1.0);
+    const double G3_11_1 = det*w[0][11]*K[3]*(1.0);
+    const double G4_6_0 = det*w[0][6]*K[0]*(1.0);
+    const double G4_6_1 = det*w[0][6]*K[2]*(1.0);
+    const double G4_7_0 = det*w[0][7]*K[0]*(1.0);
+    const double G4_8_1 = det*w[0][8]*K[2]*(1.0);
+    const double G4_9_0 = det*w[0][9]*K[0]*(1.0);
+    const double G4_9_1 = det*w[0][9]*K[2]*(1.0);
+    const double G4_10_0 = det*w[0][10]*K[0]*(1.0);
+    const double G4_10_1 = det*w[0][10]*K[2]*(1.0);
+    const double G4_11_0 = det*w[0][11]*K[0]*(1.0);
+    const double G4_11_1 = det*w[0][11]*K[2]*(1.0);
+    const double G5_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G5_0_1 = det*w[0][0]*K[2]*(1.0);
+    const double G5_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G5_1_1 = det*w[0][1]*K[2]*(1.0);
+    const double G5_2_0 = det*w[0][2]*K[0]*(1.0);
+    const double G5_2_1 = det*w[0][2]*K[2]*(1.0);
+    const double G5_3_0 = det*w[0][3]*K[0]*(1.0);
+    const double G5_3_1 = det*w[0][3]*K[2]*(1.0);
+    const double G5_4_0 = det*w[0][4]*K[0]*(1.0);
+    const double G5_4_1 = det*w[0][4]*K[2]*(1.0);
+    const double G5_5_0 = det*w[0][5]*K[0]*(1.0);
+    const double G5_5_1 = det*w[0][5]*K[2]*(1.0);
+    const double G6_6_0 = det*w[0][6]*K[1]*(1.0);
+    const double G6_6_1 = det*w[0][6]*K[3]*(1.0);
+    const double G6_7_0 = det*w[0][7]*K[1]*(1.0);
+    const double G6_8_1 = det*w[0][8]*K[3]*(1.0);
+    const double G6_9_0 = det*w[0][9]*K[1]*(1.0);
+    const double G6_9_1 = det*w[0][9]*K[3]*(1.0);
+    const double G6_10_0 = det*w[0][10]*K[1]*(1.0);
+    const double G6_10_1 = det*w[0][10]*K[3]*(1.0);
+    const double G6_11_0 = det*w[0][11]*K[1]*(1.0);
+    const double G6_11_1 = det*w[0][11]*K[3]*(1.0);
+    const double G7_6_0 = det*w[0][6]*K[1]*(1.0);
+    const double G7_6_1 = det*w[0][6]*K[3]*(1.0);
+    const double G7_7_0 = det*w[0][7]*K[1]*(1.0);
+    const double G7_7_1 = det*w[0][7]*K[3]*(1.0);
+    const double G7_8_0 = det*w[0][8]*K[1]*(1.0);
+    const double G7_8_1 = det*w[0][8]*K[3]*(1.0);
+    const double G7_9_0 = det*w[0][9]*K[1]*(1.0);
+    const double G7_9_1 = det*w[0][9]*K[3]*(1.0);
+    const double G7_10_0 = det*w[0][10]*K[1]*(1.0);
+    const double G7_10_1 = det*w[0][10]*K[3]*(1.0);
+    const double G7_11_0 = det*w[0][11]*K[1]*(1.0);
+    const double G7_11_1 = det*w[0][11]*K[3]*(1.0);
+    const double G8_0 = det*K[0]*(1.0);
+    const double G8_1 = det*K[2]*(1.0);
+    const double G9_0 = det*K[1]*(1.0);
+    const double G9_1 = det*K[3]*(1.0);
+    const double G10_0_0_0 = det*w[1][0]*K[0]*K[0]*(1.0);
+    const double G10_0_0_1 = det*w[1][0]*K[0]*K[2]*(1.0);
+    const double G10_0_1_0 = det*w[1][0]*K[2]*K[0]*(1.0);
+    const double G10_0_1_1 = det*w[1][0]*K[2]*K[2]*(1.0);
+    const double G11_0_0_0 = det*w[1][0]*K[0]*K[0]*(1.0);
+    const double G11_0_0_1 = det*w[1][0]*K[0]*K[2]*(1.0);
+    const double G11_0_1_0 = det*w[1][0]*K[2]*K[0]*(1.0);
+    const double G11_0_1_1 = det*w[1][0]*K[2]*K[2]*(1.0);
+    const double G12_0_0_0 = det*w[1][0]*K[1]*K[1]*(1.0);
+    const double G12_0_0_1 = det*w[1][0]*K[1]*K[3]*(1.0);
+    const double G12_0_1_0 = det*w[1][0]*K[3]*K[1]*(1.0);
+    const double G12_0_1_1 = det*w[1][0]*K[3]*K[3]*(1.0);
+    const double G13_0_0_0 = det*w[1][0]*K[1]*K[1]*(1.0);
+    const double G13_0_0_1 = det*w[1][0]*K[1]*K[3]*(1.0);
+    const double G13_0_1_0 = det*w[1][0]*K[3]*K[1]*(1.0);
+    const double G13_0_1_1 = det*w[1][0]*K[3]*K[3]*(1.0);
+    const double G14_0 = det*K[0]*(1.0);
+    const double G14_1 = det*K[2]*(1.0);
+    const double G15_0 = det*K[1]*(1.0);
+    const double G15_1 = det*K[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = -0.030952380952381*G0_0_0 - 0.030952380952381*G0_0_1 - 0.00714285714285715*G0_1_0 - 0.00714285714285715*G0_2_1 + 0.00952380952380951*G0_3_0 + 0.00952380952380951*G0_3_1 - 0.00952380952380951*G0_4_0 + 0.0380952380952381*G0_4_1 + 0.0380952380952381*G0_5_0 - 0.00952380952380952*G0_5_1 - 0.030952380952381*G1_0_0 - 0.030952380952381*G1_0_1 + 0.00357142857142857*G1_1_0 + 0.00357142857142857*G1_1_1 + 0.00357142857142857*G1_2_0 + 0.00357142857142857*G1_2_1 - 0.00476190476190477*G1_3_0 - 0.00476190476190477*G1_3_1 - 0.0190476190476191*G1_4_0 - 0.0190476190476191*G1_4_1 - 0.0190476190476191*G1_5_0 - 0.0190476190476191*G1_5_1 - 0.030952380952381*G3_6_0 - 0.030952380952381*G3_6_1 + 0.00357142857142857*G3_7_0 + 0.00357142857142857*G3_7_1 + 0.00357142857142857*G3_8_0 + 0.00357142857142857*G3_8_1 - 0.00476190476190477*G3_9_0 - 0.00476190476190477*G3_9_1 - 0.0190476190476191*G3_10_0 - 0.0190476190476191*G3_10_1 - 0.0190476190476191*G3_11_0 - 0.0190476190476191*G3_11_1 + 0.5*G10_0_0_0 + 0.5*G10_0_0_1 + 0.5*G10_0_1_0 + 0.5*G10_0_1_1 + 0.5*G12_0_0_0 + 0.5*G12_0_0_1 + 0.5*G12_0_1_0 + 0.5*G12_0_1_1;
+    A[1] = 0.00357142857142857*G0_0_0 + 0.00357142857142857*G0_0_1 - 0.00357142857142857*G0_1_0 + 0.00436507936507936*G0_2_1 + 0.00158730158730159*G0_3_0 - 0.00634920634920634*G0_3_1 - 0.00158730158730159*G0_4_0 - 0.00793650793650793*G0_4_1 + 0.00634920634920635*G0_5_1 - 0.00714285714285715*G1_0_0 - 0.00357142857142857*G1_1_0 + 0.00436507936507936*G1_2_0 - 0.00793650793650793*G1_3_0 - 0.00634920634920636*G1_4_0 - 0.0126984126984127*G1_5_0 - 0.00714285714285715*G3_6_0 - 0.00357142857142857*G3_7_0 + 0.00436507936507936*G3_8_0 - 0.00793650793650793*G3_9_0 - 0.00634920634920636*G3_10_0 - 0.0126984126984127*G3_11_0 + 0.166666666666667*G10_0_0_0 + 0.166666666666667*G10_0_1_0 + 0.166666666666667*G12_0_0_0 + 0.166666666666667*G12_0_1_0;
+    A[2] = 0.00357142857142857*G0_0_0 + 0.00357142857142857*G0_0_1 + 0.00436507936507936*G0_1_0 - 0.00357142857142857*G0_2_1 - 0.00634920634920634*G0_3_0 + 0.00158730158730159*G0_3_1 + 0.00634920634920634*G0_4_0 - 0.00793650793650793*G0_5_0 - 0.00158730158730159*G0_5_1 - 0.00714285714285715*G1_0_1 + 0.00436507936507936*G1_1_1 - 0.00357142857142857*G1_2_1 - 0.00793650793650793*G1_3_1 - 0.0126984126984127*G1_4_1 - 0.00634920634920635*G1_5_1 - 0.00714285714285715*G3_6_1 + 0.00436507936507936*G3_7_1 - 0.00357142857142857*G3_8_1 - 0.00793650793650793*G3_9_1 - 0.0126984126984127*G3_10_1 - 0.00634920634920635*G3_11_1 + 0.166666666666667*G10_0_0_1 + 0.166666666666667*G10_0_1_1 + 0.166666666666667*G12_0_0_1 + 0.166666666666667*G12_0_1_1;
+    A[3] = -0.00476190476190477*G0_0_0 - 0.00476190476190477*G0_0_1 - 0.00793650793650793*G0_1_0 - 0.00793650793650793*G0_2_1 - 0.019047619047619*G0_3_0 - 0.019047619047619*G0_3_1 + 0.019047619047619*G0_4_0 + 0.0126984126984127*G0_4_1 + 0.0126984126984127*G0_5_0 + 0.019047619047619*G0_5_1 + 0.00952380952380951*G1_0_0 + 0.00952380952380951*G1_0_1 + 0.00158730158730159*G1_1_0 - 0.00634920634920634*G1_1_1 - 0.00634920634920634*G1_2_0 + 0.00158730158730159*G1_2_1 - 0.019047619047619*G1_3_0 - 0.019047619047619*G1_3_1 - 0.0126984126984127*G1_4_0 - 0.00634920634920634*G1_4_1 - 0.00634920634920635*G1_5_0 - 0.0126984126984127*G1_5_1 + 0.00952380952380951*G3_6_0 + 0.00952380952380951*G3_6_1 + 0.00158730158730159*G3_7_0 - 0.00634920634920634*G3_7_1 - 0.00634920634920634*G3_8_0 + 0.00158730158730159*G3_8_1 - 0.019047619047619*G3_9_0 - 0.019047619047619*G3_9_1 - 0.0126984126984127*G3_10_0 - 0.00634920634920634*G3_10_1 - 0.00634920634920635*G3_11_0 - 0.0126984126984127*G3_11_1;
+    A[4] = -0.0190476190476191*G0_0_0 - 0.0190476190476191*G0_0_1 - 0.00634920634920636*G0_1_0 - 0.0126984126984127*G0_2_1 - 0.0126984126984127*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.0126984126984127*G0_4_0 + 0.0317460317460318*G0_4_1 + 0.0253968253968254*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.00952380952380951*G1_0_0 + 0.0380952380952381*G1_0_1 - 0.00158730158730159*G1_1_0 - 0.00793650793650793*G1_1_1 + 0.00634920634920634*G1_2_0 + 0.019047619047619*G1_3_0 + 0.0126984126984127*G1_3_1 + 0.0126984126984127*G1_4_0 + 0.0317460317460318*G1_4_1 + 0.00634920634920635*G1_5_0 + 0.0253968253968254*G1_5_1 - 0.00952380952380951*G3_6_0 + 0.0380952380952381*G3_6_1 - 0.00158730158730159*G3_7_0 - 0.00793650793650793*G3_7_1 + 0.00634920634920634*G3_8_0 + 0.019047619047619*G3_9_0 + 0.0126984126984127*G3_9_1 + 0.0126984126984127*G3_10_0 + 0.0317460317460318*G3_10_1 + 0.00634920634920635*G3_11_0 + 0.0253968253968254*G3_11_1 - 0.666666666666667*G10_0_0_1 - 0.666666666666666*G10_0_1_1 - 0.666666666666667*G12_0_0_1 - 0.666666666666666*G12_0_1_1;
+    A[5] = -0.0190476190476191*G0_0_0 - 0.0190476190476191*G0_0_1 - 0.0126984126984127*G0_1_0 - 0.00634920634920635*G0_2_1 - 0.00634920634920635*G0_3_0 - 0.0126984126984127*G0_3_1 + 0.00634920634920635*G0_4_0 + 0.0253968253968254*G0_4_1 + 0.0317460317460318*G0_5_0 + 0.0126984126984127*G0_5_1 + 0.0380952380952381*G1_0_0 - 0.00952380952380952*G1_0_1 + 0.00634920634920635*G1_1_1 - 0.00793650793650793*G1_2_0 - 0.00158730158730159*G1_2_1 + 0.0126984126984127*G1_3_0 + 0.019047619047619*G1_3_1 + 0.0253968253968254*G1_4_0 + 0.00634920634920634*G1_4_1 + 0.0317460317460318*G1_5_0 + 0.0126984126984127*G1_5_1 + 0.0380952380952381*G3_6_0 - 0.00952380952380952*G3_6_1 + 0.00634920634920635*G3_7_1 - 0.00793650793650793*G3_8_0 - 0.00158730158730159*G3_8_1 + 0.0126984126984127*G3_9_0 + 0.019047619047619*G3_9_1 + 0.0253968253968254*G3_10_0 + 0.00634920634920634*G3_10_1 + 0.0317460317460318*G3_11_0 + 0.0126984126984127*G3_11_1 - 0.666666666666667*G10_0_0_0 - 0.666666666666667*G10_0_1_0 - 0.666666666666667*G12_0_0_0 - 0.666666666666667*G12_0_1_0;
+    A[6] = -0.030952380952381*G2_0_0 - 0.030952380952381*G2_0_1 - 0.00714285714285715*G2_1_0 - 0.00714285714285715*G2_2_1 + 0.00952380952380951*G2_3_0 + 0.00952380952380951*G2_3_1 - 0.00952380952380951*G2_4_0 + 0.0380952380952381*G2_4_1 + 0.0380952380952381*G2_5_0 - 0.00952380952380952*G2_5_1;
+    A[7] = 0.00357142857142857*G2_0_0 + 0.00357142857142857*G2_0_1 - 0.00357142857142857*G2_1_0 + 0.00436507936507936*G2_2_1 + 0.00158730158730159*G2_3_0 - 0.00634920634920634*G2_3_1 - 0.00158730158730159*G2_4_0 - 0.00793650793650793*G2_4_1 + 0.00634920634920635*G2_5_1;
+    A[8] = 0.00357142857142857*G2_0_0 + 0.00357142857142857*G2_0_1 + 0.00436507936507936*G2_1_0 - 0.00357142857142857*G2_2_1 - 0.00634920634920634*G2_3_0 + 0.00158730158730159*G2_3_1 + 0.00634920634920634*G2_4_0 - 0.00793650793650793*G2_5_0 - 0.00158730158730159*G2_5_1;
+    A[9] = -0.00476190476190477*G2_0_0 - 0.00476190476190477*G2_0_1 - 0.00793650793650793*G2_1_0 - 0.00793650793650793*G2_2_1 - 0.019047619047619*G2_3_0 - 0.019047619047619*G2_3_1 + 0.019047619047619*G2_4_0 + 0.0126984126984127*G2_4_1 + 0.0126984126984127*G2_5_0 + 0.019047619047619*G2_5_1;
+    A[10] = -0.0190476190476191*G2_0_0 - 0.0190476190476191*G2_0_1 - 0.00634920634920636*G2_1_0 - 0.0126984126984127*G2_2_1 - 0.0126984126984127*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.0126984126984127*G2_4_0 + 0.0317460317460318*G2_4_1 + 0.0253968253968254*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[11] = -0.0190476190476191*G2_0_0 - 0.0190476190476191*G2_0_1 - 0.0126984126984127*G2_1_0 - 0.00634920634920635*G2_2_1 - 0.00634920634920635*G2_3_0 - 0.0126984126984127*G2_3_1 + 0.00634920634920635*G2_4_0 + 0.0253968253968254*G2_4_1 + 0.0317460317460318*G2_5_0 + 0.0126984126984127*G2_5_1;
+    A[12] = 0.166666666666667*G14_0 + 0.166666666666667*G14_1;
+    A[13] = 0.0;
+    A[14] = 0.0;
+    A[15] = 0.00357142857142857*G0_0_0 + 0.00357142857142857*G0_0_1 - 0.00357142857142857*G0_1_0 + 0.00436507936507936*G0_2_1 + 0.00158730158730159*G0_3_0 - 0.00634920634920634*G0_3_1 - 0.00158730158730159*G0_4_0 - 0.00793650793650793*G0_4_1 + 0.00634920634920635*G0_5_1 + 0.00357142857142857*G1_0_0 + 0.00357142857142857*G1_0_1 + 0.00714285714285713*G1_1_0 + 0.00714285714285714*G1_1_1 - 0.00436507936507936*G1_2_0 - 0.00436507936507936*G1_2_1 + 0.00634920634920634*G1_3_0 + 0.00634920634920634*G1_3_1 + 0.00793650793650793*G1_4_0 + 0.00793650793650793*G1_4_1 + 0.0126984126984127*G1_5_0 + 0.0126984126984127*G1_5_1 + 0.00357142857142857*G3_6_0 + 0.00357142857142857*G3_6_1 + 0.00714285714285713*G3_7_0 + 0.00714285714285714*G3_7_1 - 0.00436507936507936*G3_8_0 - 0.00436507936507936*G3_8_1 + 0.00634920634920634*G3_9_0 + 0.00634920634920634*G3_9_1 + 0.00793650793650793*G3_10_0 + 0.00793650793650793*G3_10_1 + 0.0126984126984127*G3_11_0 + 0.0126984126984127*G3_11_1 + 0.166666666666667*G10_0_0_0 + 0.166666666666667*G10_0_0_1 + 0.166666666666667*G12_0_0_0 + 0.166666666666667*G12_0_0_1;
+    A[16] = 0.00714285714285713*G0_0_0 + 0.00714285714285714*G0_0_1 + 0.0309523809523809*G0_1_0 - 0.00714285714285713*G0_2_1 + 0.0095238095238095*G0_3_0 + 0.0476190476190476*G0_3_1 - 0.0095238095238095*G0_4_0 - 0.0380952380952381*G0_5_0 - 0.0476190476190476*G0_5_1 - 0.00357142857142857*G1_0_0 + 0.0309523809523809*G1_1_0 - 0.00357142857142856*G1_2_0 + 0.019047619047619*G1_3_0 + 0.00476190476190476*G1_4_0 + 0.019047619047619*G1_5_0 - 0.00357142857142857*G3_6_0 + 0.0309523809523809*G3_7_0 - 0.00357142857142856*G3_8_0 + 0.019047619047619*G3_9_0 + 0.00476190476190476*G3_10_0 + 0.019047619047619*G3_11_0 + 0.5*G10_0_0_0 + 0.5*G12_0_0_0;
+    A[17] = -0.00436507936507936*G0_0_0 - 0.00436507936507936*G0_0_1 - 0.00357142857142856*G0_1_0 - 0.00357142857142857*G0_2_1 - 0.00634920634920633*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.00634920634920633*G0_4_0 + 0.00793650793650792*G0_4_1 + 0.00793650793650793*G0_5_0 + 0.00634920634920634*G0_5_1 + 0.00436507936507936*G1_0_1 - 0.00714285714285713*G1_1_1 - 0.00357142857142857*G1_2_1 - 0.0126984126984127*G1_3_1 - 0.00793650793650794*G1_4_1 - 0.00634920634920636*G1_5_1 + 0.00436507936507936*G3_6_1 - 0.00714285714285713*G3_7_1 - 0.00357142857142857*G3_8_1 - 0.0126984126984127*G3_9_1 - 0.00793650793650794*G3_10_1 - 0.00634920634920636*G3_11_1 - 0.166666666666667*G10_0_0_1 - 0.166666666666667*G12_0_0_1;
+    A[18] = 0.00634920634920634*G0_0_0 + 0.00634920634920634*G0_0_1 + 0.019047619047619*G0_1_0 - 0.0126984126984127*G0_2_1 - 0.0126984126984127*G0_3_0 + 0.019047619047619*G0_3_1 + 0.0126984126984127*G0_4_0 + 0.00634920634920636*G0_4_1 - 0.0253968253968254*G0_5_0 - 0.019047619047619*G0_5_1 + 0.00158730158730159*G1_0_0 - 0.00634920634920634*G1_0_1 + 0.0095238095238095*G1_1_0 + 0.0476190476190476*G1_1_1 - 0.00634920634920633*G1_2_0 - 0.00634920634920634*G1_2_1 - 0.0126984126984127*G1_3_0 + 0.019047619047619*G1_3_1 - 0.019047619047619*G1_4_0 - 0.00634920634920634*G1_4_1 - 0.00634920634920635*G1_5_0 + 0.019047619047619*G1_5_1 + 0.00158730158730159*G3_6_0 - 0.00634920634920634*G3_6_1 + 0.0095238095238095*G3_7_0 + 0.0476190476190476*G3_7_1 - 0.00634920634920633*G3_8_0 - 0.00634920634920634*G3_8_1 - 0.0126984126984127*G3_9_0 + 0.019047619047619*G3_9_1 - 0.019047619047619*G3_10_0 - 0.00634920634920634*G3_10_1 - 0.00634920634920635*G3_11_0 + 0.019047619047619*G3_11_1 + 0.666666666666666*G10_0_0_1 + 0.666666666666666*G12_0_0_1;
+    A[19] = 0.00793650793650793*G0_0_0 + 0.00793650793650793*G0_0_1 + 0.00476190476190476*G0_1_0 - 0.00793650793650794*G0_2_1 - 0.019047619047619*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.019047619047619*G0_4_0 - 0.0126984126984127*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.00158730158730159*G1_0_0 - 0.00793650793650793*G1_0_1 - 0.0095238095238095*G1_1_0 + 0.00634920634920633*G1_2_0 + 0.00793650793650792*G1_2_1 + 0.0126984126984127*G1_3_0 + 0.00634920634920636*G1_3_1 + 0.019047619047619*G1_4_0 + 0.00634920634920635*G1_5_0 - 0.00634920634920633*G1_5_1 - 0.00158730158730159*G3_6_0 - 0.00793650793650793*G3_6_1 - 0.0095238095238095*G3_7_0 + 0.00634920634920633*G3_8_0 + 0.00793650793650792*G3_8_1 + 0.0126984126984127*G3_9_0 + 0.00634920634920636*G3_9_1 + 0.019047619047619*G3_10_0 + 0.00634920634920635*G3_11_0 - 0.00634920634920633*G3_11_1;
+    A[20] = 0.0126984126984127*G0_0_0 + 0.0126984126984127*G0_0_1 + 0.019047619047619*G0_1_0 - 0.00634920634920636*G0_2_1 - 0.00634920634920635*G0_3_0 + 0.019047619047619*G0_3_1 + 0.00634920634920635*G0_4_0 - 0.00634920634920633*G0_4_1 - 0.0317460317460317*G0_5_0 - 0.0190476190476191*G0_5_1 + 0.00634920634920635*G1_0_1 - 0.0380952380952381*G1_1_0 - 0.0476190476190476*G1_1_1 + 0.00793650793650793*G1_2_0 + 0.00634920634920634*G1_2_1 - 0.0253968253968254*G1_3_0 - 0.019047619047619*G1_3_1 - 0.0126984126984127*G1_4_0 + 0.00634920634920634*G1_4_1 - 0.0317460317460317*G1_5_0 - 0.0190476190476191*G1_5_1 + 0.00634920634920635*G3_6_1 - 0.0380952380952381*G3_7_0 - 0.0476190476190476*G3_7_1 + 0.00793650793650793*G3_8_0 + 0.00634920634920634*G3_8_1 - 0.0253968253968254*G3_9_0 - 0.019047619047619*G3_9_1 - 0.0126984126984127*G3_10_0 + 0.00634920634920634*G3_10_1 - 0.0317460317460317*G3_11_0 - 0.0190476190476191*G3_11_1 - 0.666666666666667*G10_0_0_0 - 0.666666666666666*G10_0_0_1 - 0.666666666666667*G12_0_0_0 - 0.666666666666666*G12_0_0_1;
+    A[21] = 0.00357142857142857*G2_0_0 + 0.00357142857142857*G2_0_1 - 0.00357142857142857*G2_1_0 + 0.00436507936507936*G2_2_1 + 0.00158730158730159*G2_3_0 - 0.00634920634920634*G2_3_1 - 0.00158730158730159*G2_4_0 - 0.00793650793650793*G2_4_1 + 0.00634920634920635*G2_5_1;
+    A[22] = 0.00714285714285713*G2_0_0 + 0.00714285714285714*G2_0_1 + 0.0309523809523809*G2_1_0 - 0.00714285714285713*G2_2_1 + 0.0095238095238095*G2_3_0 + 0.0476190476190476*G2_3_1 - 0.0095238095238095*G2_4_0 - 0.0380952380952381*G2_5_0 - 0.0476190476190476*G2_5_1;
+    A[23] = -0.00436507936507936*G2_0_0 - 0.00436507936507936*G2_0_1 - 0.00357142857142856*G2_1_0 - 0.00357142857142857*G2_2_1 - 0.00634920634920633*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.00634920634920633*G2_4_0 + 0.00793650793650792*G2_4_1 + 0.00793650793650793*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[24] = 0.00634920634920634*G2_0_0 + 0.00634920634920634*G2_0_1 + 0.019047619047619*G2_1_0 - 0.0126984126984127*G2_2_1 - 0.0126984126984127*G2_3_0 + 0.019047619047619*G2_3_1 + 0.0126984126984127*G2_4_0 + 0.00634920634920636*G2_4_1 - 0.0253968253968254*G2_5_0 - 0.019047619047619*G2_5_1;
+    A[25] = 0.00793650793650793*G2_0_0 + 0.00793650793650793*G2_0_1 + 0.00476190476190476*G2_1_0 - 0.00793650793650794*G2_2_1 - 0.019047619047619*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.019047619047619*G2_4_0 - 0.0126984126984127*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[26] = 0.0126984126984127*G2_0_0 + 0.0126984126984127*G2_0_1 + 0.019047619047619*G2_1_0 - 0.00634920634920636*G2_2_1 - 0.00634920634920635*G2_3_0 + 0.019047619047619*G2_3_1 + 0.00634920634920635*G2_4_0 - 0.00634920634920633*G2_4_1 - 0.0317460317460317*G2_5_0 - 0.0190476190476191*G2_5_1;
+    A[27] = 0.0;
+    A[28] = -0.166666666666667*G14_0;
+    A[29] = 0.0;
+    A[30] = 0.00357142857142857*G0_0_0 + 0.00357142857142857*G0_0_1 + 0.00436507936507936*G0_1_0 - 0.00357142857142857*G0_2_1 - 0.00634920634920634*G0_3_0 + 0.00158730158730159*G0_3_1 + 0.00634920634920634*G0_4_0 - 0.00793650793650793*G0_5_0 - 0.00158730158730159*G0_5_1 + 0.00357142857142857*G1_0_0 + 0.00357142857142857*G1_0_1 - 0.00436507936507936*G1_1_0 - 0.00436507936507936*G1_1_1 + 0.00714285714285714*G1_2_0 + 0.00714285714285713*G1_2_1 + 0.00634920634920635*G1_3_0 + 0.00634920634920634*G1_3_1 + 0.0126984126984127*G1_4_0 + 0.0126984126984127*G1_4_1 + 0.00793650793650793*G1_5_0 + 0.00793650793650793*G1_5_1 + 0.00357142857142857*G3_6_0 + 0.00357142857142857*G3_6_1 - 0.00436507936507936*G3_7_0 - 0.00436507936507936*G3_7_1 + 0.00714285714285714*G3_8_0 + 0.00714285714285713*G3_8_1 + 0.00634920634920635*G3_9_0 + 0.00634920634920634*G3_9_1 + 0.0126984126984127*G3_10_0 + 0.0126984126984127*G3_10_1 + 0.00793650793650793*G3_11_0 + 0.00793650793650793*G3_11_1 + 0.166666666666667*G10_0_1_0 + 0.166666666666667*G10_0_1_1 + 0.166666666666667*G12_0_1_0 + 0.166666666666667*G12_0_1_1;
+    A[31] = -0.00436507936507936*G0_0_0 - 0.00436507936507936*G0_0_1 - 0.00357142857142857*G0_1_0 - 0.00357142857142857*G0_2_1 - 0.00634920634920634*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.00634920634920634*G0_4_0 + 0.00793650793650792*G0_4_1 + 0.00793650793650793*G0_5_0 + 0.00634920634920634*G0_5_1 + 0.00436507936507936*G1_0_0 - 0.00357142857142857*G1_1_0 - 0.00714285714285714*G1_2_0 - 0.0126984126984127*G1_3_0 - 0.00634920634920635*G1_4_0 - 0.00793650793650793*G1_5_0 + 0.00436507936507936*G3_6_0 - 0.00357142857142857*G3_7_0 - 0.00714285714285714*G3_8_0 - 0.0126984126984127*G3_9_0 - 0.00634920634920635*G3_10_0 - 0.00793650793650793*G3_11_0 - 0.166666666666667*G10_0_1_0 - 0.166666666666667*G12_0_1_0;
+    A[32] = 0.00714285714285714*G0_0_0 + 0.00714285714285713*G0_0_1 - 0.00714285714285714*G0_1_0 + 0.0309523809523809*G0_2_1 + 0.0476190476190475*G0_3_0 + 0.0095238095238095*G0_3_1 - 0.0476190476190475*G0_4_0 - 0.038095238095238*G0_4_1 - 0.00952380952380951*G0_5_1 - 0.00357142857142857*G1_0_1 - 0.00357142857142857*G1_1_1 + 0.0309523809523809*G1_2_1 + 0.019047619047619*G1_3_1 + 0.019047619047619*G1_4_1 + 0.00476190476190476*G1_5_1 - 0.00357142857142857*G3_6_1 - 0.00357142857142857*G3_7_1 + 0.0309523809523809*G3_8_1 + 0.019047619047619*G3_9_1 + 0.019047619047619*G3_10_1 + 0.00476190476190476*G3_11_1 + 0.5*G10_0_1_1 + 0.5*G12_0_1_1;
+    A[33] = 0.00634920634920635*G0_0_0 + 0.00634920634920634*G0_0_1 - 0.0126984126984127*G0_1_0 + 0.019047619047619*G0_2_1 + 0.019047619047619*G0_3_0 - 0.0126984126984127*G0_3_1 - 0.019047619047619*G0_4_0 - 0.0253968253968254*G0_4_1 + 0.00634920634920634*G0_5_0 + 0.0126984126984127*G0_5_1 - 0.00634920634920634*G1_0_0 + 0.00158730158730159*G1_0_1 - 0.00634920634920634*G1_1_0 - 0.00634920634920634*G1_1_1 + 0.0476190476190475*G1_2_0 + 0.0095238095238095*G1_2_1 + 0.019047619047619*G1_3_0 - 0.0126984126984127*G1_3_1 + 0.019047619047619*G1_4_0 - 0.00634920634920634*G1_4_1 - 0.00634920634920633*G1_5_0 - 0.019047619047619*G1_5_1 - 0.00634920634920634*G3_6_0 + 0.00158730158730159*G3_6_1 - 0.00634920634920634*G3_7_0 - 0.00634920634920634*G3_7_1 + 0.0476190476190475*G3_8_0 + 0.0095238095238095*G3_8_1 + 0.019047619047619*G3_9_0 - 0.0126984126984127*G3_9_1 + 0.019047619047619*G3_10_0 - 0.00634920634920634*G3_10_1 - 0.00634920634920633*G3_11_0 - 0.019047619047619*G3_11_1 + 0.666666666666666*G10_0_1_0 + 0.666666666666666*G12_0_1_0;
+    A[34] = 0.0126984126984127*G0_0_0 + 0.0126984126984127*G0_0_1 - 0.00634920634920635*G0_1_0 + 0.019047619047619*G0_2_1 + 0.019047619047619*G0_3_0 - 0.00634920634920634*G0_3_1 - 0.019047619047619*G0_4_0 - 0.0317460317460317*G0_4_1 - 0.00634920634920635*G0_5_0 + 0.00634920634920634*G0_5_1 + 0.00634920634920634*G1_0_0 + 0.00634920634920634*G1_1_0 + 0.00793650793650792*G1_1_1 - 0.0476190476190475*G1_2_0 - 0.038095238095238*G1_2_1 - 0.019047619047619*G1_3_0 - 0.0253968253968254*G1_3_1 - 0.019047619047619*G1_4_0 - 0.0317460317460317*G1_4_1 + 0.00634920634920633*G1_5_0 - 0.0126984126984127*G1_5_1 + 0.00634920634920634*G3_6_0 + 0.00634920634920634*G3_7_0 + 0.00793650793650792*G3_7_1 - 0.0476190476190475*G3_8_0 - 0.038095238095238*G3_8_1 - 0.019047619047619*G3_9_0 - 0.0253968253968254*G3_9_1 - 0.019047619047619*G3_10_0 - 0.0317460317460317*G3_10_1 + 0.00634920634920633*G3_11_0 - 0.0126984126984127*G3_11_1 - 0.666666666666666*G10_0_1_0 - 0.666666666666666*G10_0_1_1 - 0.666666666666666*G12_0_1_0 - 0.666666666666666*G12_0_1_1;
+    A[35] = 0.00793650793650793*G0_0_0 + 0.00793650793650793*G0_0_1 - 0.00793650793650793*G0_1_0 + 0.00476190476190476*G0_2_1 - 0.00634920634920633*G0_3_0 - 0.019047619047619*G0_3_1 + 0.00634920634920633*G0_4_0 - 0.0126984126984127*G0_4_1 + 0.019047619047619*G0_5_1 - 0.00793650793650793*G1_0_0 - 0.00158730158730159*G1_0_1 + 0.00793650793650793*G1_1_0 + 0.00634920634920634*G1_1_1 - 0.00952380952380951*G1_2_1 + 0.00634920634920634*G1_3_0 + 0.0126984126984127*G1_3_1 - 0.00634920634920635*G1_4_0 + 0.00634920634920634*G1_4_1 + 0.019047619047619*G1_5_1 - 0.00793650793650793*G3_6_0 - 0.00158730158730159*G3_6_1 + 0.00793650793650793*G3_7_0 + 0.00634920634920634*G3_7_1 - 0.00952380952380951*G3_8_1 + 0.00634920634920634*G3_9_0 + 0.0126984126984127*G3_9_1 - 0.00634920634920635*G3_10_0 + 0.00634920634920634*G3_10_1 + 0.019047619047619*G3_11_1;
+    A[36] = 0.00357142857142857*G2_0_0 + 0.00357142857142857*G2_0_1 + 0.00436507936507936*G2_1_0 - 0.00357142857142857*G2_2_1 - 0.00634920634920634*G2_3_0 + 0.00158730158730159*G2_3_1 + 0.00634920634920634*G2_4_0 - 0.00793650793650793*G2_5_0 - 0.00158730158730159*G2_5_1;
+    A[37] = -0.00436507936507936*G2_0_0 - 0.00436507936507936*G2_0_1 - 0.00357142857142857*G2_1_0 - 0.00357142857142857*G2_2_1 - 0.00634920634920634*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.00634920634920634*G2_4_0 + 0.00793650793650792*G2_4_1 + 0.00793650793650793*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[38] = 0.00714285714285714*G2_0_0 + 0.00714285714285713*G2_0_1 - 0.00714285714285714*G2_1_0 + 0.0309523809523809*G2_2_1 + 0.0476190476190475*G2_3_0 + 0.0095238095238095*G2_3_1 - 0.0476190476190475*G2_4_0 - 0.038095238095238*G2_4_1 - 0.00952380952380951*G2_5_1;
+    A[39] = 0.00634920634920635*G2_0_0 + 0.00634920634920634*G2_0_1 - 0.0126984126984127*G2_1_0 + 0.019047619047619*G2_2_1 + 0.019047619047619*G2_3_0 - 0.0126984126984127*G2_3_1 - 0.019047619047619*G2_4_0 - 0.0253968253968254*G2_4_1 + 0.00634920634920634*G2_5_0 + 0.0126984126984127*G2_5_1;
+    A[40] = 0.0126984126984127*G2_0_0 + 0.0126984126984127*G2_0_1 - 0.00634920634920635*G2_1_0 + 0.019047619047619*G2_2_1 + 0.019047619047619*G2_3_0 - 0.00634920634920634*G2_3_1 - 0.019047619047619*G2_4_0 - 0.0317460317460317*G2_4_1 - 0.00634920634920635*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[41] = 0.00793650793650793*G2_0_0 + 0.00793650793650793*G2_0_1 - 0.00793650793650793*G2_1_0 + 0.00476190476190476*G2_2_1 - 0.00634920634920633*G2_3_0 - 0.019047619047619*G2_3_1 + 0.00634920634920633*G2_4_0 - 0.0126984126984127*G2_4_1 + 0.019047619047619*G2_5_1;
+    A[42] = 0.0;
+    A[43] = 0.0;
+    A[44] = -0.166666666666667*G14_1;
+    A[45] = -0.00476190476190476*G0_0_0 - 0.00476190476190477*G0_0_1 - 0.00793650793650793*G0_1_0 - 0.00793650793650793*G0_2_1 - 0.019047619047619*G0_3_0 - 0.019047619047619*G0_3_1 + 0.019047619047619*G0_4_0 + 0.0126984126984127*G0_4_1 + 0.0126984126984127*G0_5_0 + 0.019047619047619*G0_5_1 - 0.00476190476190476*G1_0_0 - 0.00476190476190477*G1_0_1 + 0.00634920634920634*G1_1_0 + 0.00634920634920634*G1_1_1 + 0.00634920634920635*G1_2_0 + 0.00634920634920634*G1_2_1 + 0.0380952380952381*G1_3_0 + 0.0380952380952381*G1_3_1 - 0.00634920634920633*G1_4_0 - 0.00634920634920632*G1_4_1 - 0.00634920634920633*G1_5_0 - 0.00634920634920632*G1_5_1 - 0.00476190476190476*G3_6_0 - 0.00476190476190477*G3_6_1 + 0.00634920634920634*G3_7_0 + 0.00634920634920634*G3_7_1 + 0.00634920634920635*G3_8_0 + 0.00634920634920634*G3_8_1 + 0.0380952380952381*G3_9_0 + 0.0380952380952381*G3_9_1 - 0.00634920634920633*G3_10_0 - 0.00634920634920632*G3_10_1 - 0.00634920634920633*G3_11_0 - 0.00634920634920632*G3_11_1;
+    A[46] = 0.00634920634920634*G0_0_0 + 0.00634920634920634*G0_0_1 + 0.019047619047619*G0_1_0 - 0.0126984126984127*G0_2_1 - 0.0126984126984127*G0_3_0 + 0.019047619047619*G0_3_1 + 0.0126984126984127*G0_4_0 + 0.00634920634920636*G0_4_1 - 0.0253968253968254*G0_5_0 - 0.019047619047619*G0_5_1 - 0.00793650793650793*G1_0_0 + 0.019047619047619*G1_1_0 - 0.0126984126984127*G1_2_0 + 0.0634920634920634*G1_3_0 + 0.00634920634920634*G1_4_0 + 0.0317460317460317*G1_5_0 - 0.00793650793650793*G3_6_0 + 0.019047619047619*G3_7_0 - 0.0126984126984127*G3_8_0 + 0.0634920634920634*G3_9_0 + 0.00634920634920634*G3_10_0 + 0.0317460317460317*G3_11_0 + 0.666666666666666*G10_0_1_0 + 0.666666666666666*G12_0_1_0;
+    A[47] = 0.00634920634920635*G0_0_0 + 0.00634920634920634*G0_0_1 - 0.0126984126984127*G0_1_0 + 0.019047619047619*G0_2_1 + 0.019047619047619*G0_3_0 - 0.0126984126984127*G0_3_1 - 0.019047619047619*G0_4_0 - 0.0253968253968254*G0_4_1 + 0.00634920634920634*G0_5_0 + 0.0126984126984127*G0_5_1 - 0.00793650793650793*G1_0_1 - 0.0126984126984127*G1_1_1 + 0.019047619047619*G1_2_1 + 0.0634920634920634*G1_3_1 + 0.0317460317460317*G1_4_1 + 0.00634920634920636*G1_5_1 - 0.00793650793650793*G3_6_1 - 0.0126984126984127*G3_7_1 + 0.019047619047619*G3_8_1 + 0.0634920634920634*G3_9_1 + 0.0317460317460317*G3_10_1 + 0.00634920634920636*G3_11_1 + 0.666666666666666*G10_0_0_1 + 0.666666666666666*G12_0_0_1;
+    A[48] = 0.0380952380952381*G0_0_0 + 0.0380952380952381*G0_0_1 + 0.0634920634920634*G0_1_0 + 0.0634920634920634*G0_2_1 + 0.152380952380952*G0_3_0 + 0.152380952380952*G0_3_1 - 0.152380952380952*G0_4_0 - 0.101587301587301*G0_4_1 - 0.101587301587302*G0_5_0 - 0.152380952380952*G0_5_1 - 0.019047619047619*G1_0_0 - 0.019047619047619*G1_0_1 - 0.0126984126984127*G1_1_0 + 0.019047619047619*G1_1_1 + 0.019047619047619*G1_2_0 - 0.0126984126984127*G1_2_1 + 0.152380952380952*G1_3_0 + 0.152380952380952*G1_3_1 + 0.0761904761904761*G1_4_0 + 0.0507936507936507*G1_4_1 + 0.0507936507936508*G1_5_0 + 0.0761904761904761*G1_5_1 - 0.019047619047619*G3_6_0 - 0.019047619047619*G3_6_1 - 0.0126984126984127*G3_7_0 + 0.019047619047619*G3_7_1 + 0.019047619047619*G3_8_0 - 0.0126984126984127*G3_8_1 + 0.152380952380952*G3_9_0 + 0.152380952380952*G3_9_1 + 0.0761904761904761*G3_10_0 + 0.0507936507936507*G3_10_1 + 0.0507936507936508*G3_11_0 + 0.0761904761904761*G3_11_1 + 1.33333333333333*G10_0_0_0 + 0.666666666666665*G10_0_0_1 + 0.666666666666665*G10_0_1_0 + 1.33333333333333*G10_0_1_1 + 1.33333333333333*G12_0_0_0 + 0.666666666666665*G12_0_0_1 + 0.666666666666665*G12_0_1_0 + 1.33333333333333*G12_0_1_1;
+    A[49] = -0.00634920634920633*G0_0_0 - 0.00634920634920632*G0_0_1 + 0.00634920634920634*G0_1_0 + 0.0317460317460317*G0_2_1 + 0.0761904761904761*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.0761904761904761*G0_4_0 - 0.0253968253968254*G0_4_1 - 0.0507936507936508*G0_5_1 + 0.019047619047619*G1_0_0 + 0.0126984126984127*G1_0_1 + 0.0126984126984127*G1_1_0 + 0.00634920634920636*G1_1_1 - 0.019047619047619*G1_2_0 - 0.0253968253968254*G1_2_1 - 0.152380952380952*G1_3_0 - 0.101587301587301*G1_3_1 - 0.0761904761904761*G1_4_0 - 0.0253968253968254*G1_4_1 - 0.0507936507936508*G1_5_0 + 0.019047619047619*G3_6_0 + 0.0126984126984127*G3_6_1 + 0.0126984126984127*G3_7_0 + 0.00634920634920636*G3_7_1 - 0.019047619047619*G3_8_0 - 0.0253968253968254*G3_8_1 - 0.152380952380952*G3_9_0 - 0.101587301587301*G3_9_1 - 0.0761904761904761*G3_10_0 - 0.0253968253968254*G3_10_1 - 0.0507936507936508*G3_11_0 - 1.33333333333333*G10_0_0_0 - 0.666666666666666*G10_0_0_1 - 0.666666666666665*G10_0_1_0 - 1.33333333333333*G12_0_0_0 - 0.666666666666666*G12_0_0_1 - 0.666666666666665*G12_0_1_0;
+    A[50] = -0.00634920634920633*G0_0_0 - 0.00634920634920632*G0_0_1 + 0.0317460317460317*G0_1_0 + 0.00634920634920636*G0_2_1 + 0.0507936507936508*G0_3_0 + 0.0761904761904761*G0_3_1 - 0.0507936507936508*G0_4_0 - 0.0253968253968254*G0_5_0 - 0.0761904761904762*G0_5_1 + 0.0126984126984127*G1_0_0 + 0.019047619047619*G1_0_1 - 0.0253968253968254*G1_1_0 - 0.019047619047619*G1_1_1 + 0.00634920634920634*G1_2_0 + 0.0126984126984127*G1_2_1 - 0.101587301587302*G1_3_0 - 0.152380952380952*G1_3_1 - 0.0507936507936508*G1_4_1 - 0.0253968253968254*G1_5_0 - 0.0761904761904762*G1_5_1 + 0.0126984126984127*G3_6_0 + 0.019047619047619*G3_6_1 - 0.0253968253968254*G3_7_0 - 0.019047619047619*G3_7_1 + 0.00634920634920634*G3_8_0 + 0.0126984126984127*G3_8_1 - 0.101587301587302*G3_9_0 - 0.152380952380952*G3_9_1 - 0.0507936507936508*G3_10_1 - 0.0253968253968254*G3_11_0 - 0.0761904761904762*G3_11_1 - 0.666666666666665*G10_0_0_1 - 0.666666666666667*G10_0_1_0 - 1.33333333333333*G10_0_1_1 - 0.666666666666665*G12_0_0_1 - 0.666666666666667*G12_0_1_0 - 1.33333333333333*G12_0_1_1;
+    A[51] = -0.00476190476190476*G2_0_0 - 0.00476190476190477*G2_0_1 - 0.00793650793650793*G2_1_0 - 0.00793650793650793*G2_2_1 - 0.019047619047619*G2_3_0 - 0.019047619047619*G2_3_1 + 0.019047619047619*G2_4_0 + 0.0126984126984127*G2_4_1 + 0.0126984126984127*G2_5_0 + 0.019047619047619*G2_5_1;
+    A[52] = 0.00634920634920634*G2_0_0 + 0.00634920634920634*G2_0_1 + 0.019047619047619*G2_1_0 - 0.0126984126984127*G2_2_1 - 0.0126984126984127*G2_3_0 + 0.019047619047619*G2_3_1 + 0.0126984126984127*G2_4_0 + 0.00634920634920636*G2_4_1 - 0.0253968253968254*G2_5_0 - 0.019047619047619*G2_5_1;
+    A[53] = 0.00634920634920635*G2_0_0 + 0.00634920634920634*G2_0_1 - 0.0126984126984127*G2_1_0 + 0.019047619047619*G2_2_1 + 0.019047619047619*G2_3_0 - 0.0126984126984127*G2_3_1 - 0.019047619047619*G2_4_0 - 0.0253968253968254*G2_4_1 + 0.00634920634920634*G2_5_0 + 0.0126984126984127*G2_5_1;
+    A[54] = 0.0380952380952381*G2_0_0 + 0.0380952380952381*G2_0_1 + 0.0634920634920634*G2_1_0 + 0.0634920634920634*G2_2_1 + 0.152380952380952*G2_3_0 + 0.152380952380952*G2_3_1 - 0.152380952380952*G2_4_0 - 0.101587301587301*G2_4_1 - 0.101587301587302*G2_5_0 - 0.152380952380952*G2_5_1;
+    A[55] = -0.00634920634920633*G2_0_0 - 0.00634920634920632*G2_0_1 + 0.00634920634920634*G2_1_0 + 0.0317460317460317*G2_2_1 + 0.0761904761904761*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.0761904761904761*G2_4_0 - 0.0253968253968254*G2_4_1 - 0.0507936507936508*G2_5_1;
+    A[56] = -0.00634920634920633*G2_0_0 - 0.00634920634920632*G2_0_1 + 0.0317460317460317*G2_1_0 + 0.00634920634920636*G2_2_1 + 0.0507936507936508*G2_3_0 + 0.0761904761904761*G2_3_1 - 0.0507936507936508*G2_4_0 - 0.0253968253968254*G2_5_0 - 0.0761904761904762*G2_5_1;
+    A[57] = -0.166666666666667*G14_0 - 0.166666666666667*G14_1;
+    A[58] = -0.166666666666667*G14_0 - 0.333333333333333*G14_1;
+    A[59] = -0.333333333333333*G14_0 - 0.166666666666666*G14_1;
+    A[60] = -0.0190476190476191*G0_0_0 - 0.0190476190476191*G0_0_1 - 0.00634920634920636*G0_1_0 - 0.0126984126984127*G0_2_1 - 0.0126984126984127*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.0126984126984127*G0_4_0 + 0.0317460317460318*G0_4_1 + 0.0253968253968254*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.0190476190476191*G1_0_0 - 0.0190476190476191*G1_0_1 + 0.00793650793650793*G1_1_0 + 0.00793650793650793*G1_1_1 + 0.0126984126984127*G1_2_0 + 0.0126984126984127*G1_2_1 - 0.00634920634920633*G1_3_0 - 0.00634920634920632*G1_3_1 - 0.0634920634920635*G1_4_0 - 0.0634920634920635*G1_4_1 - 0.0317460317460317*G1_5_0 - 0.0317460317460317*G1_5_1 - 0.0190476190476191*G3_6_0 - 0.0190476190476191*G3_6_1 + 0.00793650793650793*G3_7_0 + 0.00793650793650793*G3_7_1 + 0.0126984126984127*G3_8_0 + 0.0126984126984127*G3_8_1 - 0.00634920634920633*G3_9_0 - 0.00634920634920632*G3_9_1 - 0.0634920634920635*G3_10_0 - 0.0634920634920635*G3_10_1 - 0.0317460317460317*G3_11_0 - 0.0317460317460317*G3_11_1 - 0.666666666666667*G10_0_1_0 - 0.666666666666666*G10_0_1_1 - 0.666666666666667*G12_0_1_0 - 0.666666666666666*G12_0_1_1;
+    A[61] = 0.00793650793650793*G0_0_0 + 0.00793650793650793*G0_0_1 + 0.00476190476190476*G0_1_0 - 0.00793650793650794*G0_2_1 - 0.019047619047619*G0_3_0 - 0.00634920634920634*G0_3_1 + 0.019047619047619*G0_4_0 - 0.0126984126984127*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.00634920634920636*G1_0_0 + 0.00476190476190476*G1_1_0 - 0.00634920634920635*G1_2_0 + 0.00634920634920634*G1_3_0 - 0.0380952380952381*G1_4_0 + 0.00634920634920634*G1_5_0 - 0.00634920634920636*G3_6_0 + 0.00476190476190476*G3_7_0 - 0.00634920634920635*G3_8_0 + 0.00634920634920634*G3_9_0 - 0.0380952380952381*G3_10_0 + 0.00634920634920634*G3_11_0;
+    A[62] = 0.0126984126984127*G0_0_0 + 0.0126984126984127*G0_0_1 - 0.00634920634920635*G0_1_0 + 0.019047619047619*G0_2_1 + 0.019047619047619*G0_3_0 - 0.00634920634920634*G0_3_1 - 0.019047619047619*G0_4_0 - 0.0317460317460317*G0_4_1 - 0.00634920634920635*G0_5_0 + 0.00634920634920634*G0_5_1 - 0.0126984126984127*G1_0_1 - 0.00793650793650794*G1_1_1 + 0.019047619047619*G1_2_1 + 0.0317460317460317*G1_3_1 + 0.0634920634920635*G1_4_1 + 0.00634920634920636*G1_5_1 - 0.0126984126984127*G3_6_1 - 0.00793650793650794*G3_7_1 + 0.019047619047619*G3_8_1 + 0.0317460317460317*G3_9_1 + 0.0634920634920635*G3_10_1 + 0.00634920634920636*G3_11_1 - 0.666666666666666*G10_0_0_1 - 0.666666666666666*G10_0_1_1 - 0.666666666666666*G12_0_0_1 - 0.666666666666666*G12_0_1_1;
+    A[63] = -0.00634920634920633*G0_0_0 - 0.00634920634920632*G0_0_1 + 0.00634920634920634*G0_1_0 + 0.0317460317460317*G0_2_1 + 0.0761904761904761*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.0761904761904761*G0_4_0 - 0.0253968253968254*G0_4_1 - 0.0507936507936508*G0_5_1 - 0.0126984126984127*G1_0_0 - 0.00634920634920634*G1_0_1 - 0.019047619047619*G1_1_0 - 0.00634920634920634*G1_1_1 + 0.019047619047619*G1_2_0 - 0.00634920634920634*G1_2_1 + 0.0761904761904761*G1_3_0 + 0.0507936507936507*G1_3_1 + 0.152380952380952*G1_4_0 + 0.0507936507936507*G1_4_1 + 0.0507936507936508*G1_5_0 + 0.0507936507936507*G1_5_1 - 0.0126984126984127*G3_6_0 - 0.00634920634920634*G3_6_1 - 0.019047619047619*G3_7_0 - 0.00634920634920634*G3_7_1 + 0.019047619047619*G3_8_0 - 0.00634920634920634*G3_8_1 + 0.0761904761904761*G3_9_0 + 0.0507936507936507*G3_9_1 + 0.152380952380952*G3_10_0 + 0.0507936507936507*G3_10_1 + 0.0507936507936508*G3_11_0 + 0.0507936507936507*G3_11_1 - 1.33333333333333*G10_0_0_0 - 0.666666666666665*G10_0_0_1 - 0.666666666666666*G10_0_1_0 - 1.33333333333333*G12_0_0_0 - 0.666666666666665*G12_0_0_1 - 0.666666666666666*G12_0_1_0;
+    A[64] = -0.0634920634920635*G0_0_0 - 0.0634920634920635*G0_0_1 - 0.0380952380952381*G0_1_0 + 0.0634920634920635*G0_2_1 + 0.152380952380952*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.152380952380952*G0_4_0 + 0.101587301587302*G0_5_0 - 0.0507936507936507*G0_5_1 + 0.0126984126984127*G1_0_0 + 0.0317460317460318*G1_0_1 + 0.019047619047619*G1_1_0 - 0.019047619047619*G1_2_0 - 0.0317460317460317*G1_2_1 - 0.0761904761904761*G1_3_0 - 0.0253968253968254*G1_3_1 - 0.152380952380952*G1_4_0 - 0.0507936507936508*G1_5_0 + 0.0253968253968254*G1_5_1 + 0.0126984126984127*G3_6_0 + 0.0317460317460318*G3_6_1 + 0.019047619047619*G3_7_0 - 0.019047619047619*G3_8_0 - 0.0317460317460317*G3_8_1 - 0.0761904761904761*G3_9_0 - 0.0253968253968254*G3_9_1 - 0.152380952380952*G3_10_0 - 0.0507936507936508*G3_11_0 + 0.0253968253968254*G3_11_1 + 1.33333333333333*G10_0_0_0 + 0.666666666666666*G10_0_0_1 + 0.666666666666666*G10_0_1_0 + 1.33333333333333*G10_0_1_1 + 1.33333333333333*G12_0_0_0 + 0.666666666666666*G12_0_0_1 + 0.666666666666666*G12_0_1_0 + 1.33333333333333*G12_0_1_1;
+    A[65] = -0.0317460317460317*G0_0_0 - 0.0317460317460317*G0_0_1 + 0.00634920634920634*G0_1_0 + 0.00634920634920636*G0_2_1 + 0.0507936507936508*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.0507936507936508*G0_4_0 + 0.0253968253968254*G0_4_1 + 0.0253968253968254*G0_5_0 - 0.0507936507936508*G0_5_1 + 0.0253968253968254*G1_0_0 + 0.00634920634920634*G1_0_1 - 0.0126984126984127*G1_1_0 + 0.00634920634920634*G1_1_1 - 0.00634920634920635*G1_2_0 + 0.00634920634920634*G1_2_1 - 0.0507936507936508*G1_3_1 + 0.101587301587302*G1_4_0 - 0.0507936507936507*G1_4_1 + 0.0253968253968254*G1_5_0 - 0.0507936507936508*G1_5_1 + 0.0253968253968254*G3_6_0 + 0.00634920634920634*G3_6_1 - 0.0126984126984127*G3_7_0 + 0.00634920634920634*G3_7_1 - 0.00634920634920635*G3_8_0 + 0.00634920634920634*G3_8_1 - 0.0507936507936508*G3_9_1 + 0.101587301587302*G3_10_0 - 0.0507936507936507*G3_10_1 + 0.0253968253968254*G3_11_0 - 0.0507936507936508*G3_11_1 + 0.666666666666665*G10_0_0_1 + 0.666666666666667*G10_0_1_0 + 0.666666666666665*G12_0_0_1 + 0.666666666666667*G12_0_1_0;
+    A[66] = -0.0190476190476191*G2_0_0 - 0.0190476190476191*G2_0_1 - 0.00634920634920636*G2_1_0 - 0.0126984126984127*G2_2_1 - 0.0126984126984127*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.0126984126984127*G2_4_0 + 0.0317460317460318*G2_4_1 + 0.0253968253968254*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[67] = 0.00793650793650793*G2_0_0 + 0.00793650793650793*G2_0_1 + 0.00476190476190476*G2_1_0 - 0.00793650793650794*G2_2_1 - 0.019047619047619*G2_3_0 - 0.00634920634920634*G2_3_1 + 0.019047619047619*G2_4_0 - 0.0126984126984127*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[68] = 0.0126984126984127*G2_0_0 + 0.0126984126984127*G2_0_1 - 0.00634920634920635*G2_1_0 + 0.019047619047619*G2_2_1 + 0.019047619047619*G2_3_0 - 0.00634920634920634*G2_3_1 - 0.019047619047619*G2_4_0 - 0.0317460317460317*G2_4_1 - 0.00634920634920635*G2_5_0 + 0.00634920634920634*G2_5_1;
+    A[69] = -0.00634920634920633*G2_0_0 - 0.00634920634920632*G2_0_1 + 0.00634920634920634*G2_1_0 + 0.0317460317460317*G2_2_1 + 0.0761904761904761*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.0761904761904761*G2_4_0 - 0.0253968253968254*G2_4_1 - 0.0507936507936508*G2_5_1;
+    A[70] = -0.0634920634920635*G2_0_0 - 0.0634920634920635*G2_0_1 - 0.0380952380952381*G2_1_0 + 0.0634920634920635*G2_2_1 + 0.152380952380952*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.152380952380952*G2_4_0 + 0.101587301587302*G2_5_0 - 0.0507936507936507*G2_5_1;
+    A[71] = -0.0317460317460317*G2_0_0 - 0.0317460317460317*G2_0_1 + 0.00634920634920634*G2_1_0 + 0.00634920634920636*G2_2_1 + 0.0507936507936508*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.0507936507936508*G2_4_0 + 0.0253968253968254*G2_4_1 + 0.0253968253968254*G2_5_0 - 0.0507936507936508*G2_5_1;
+    A[72] = 0.166666666666667*G14_0 - 0.166666666666667*G14_1;
+    A[73] = 0.166666666666667*G14_0;
+    A[74] = 0.333333333333333*G14_0 + 0.166666666666667*G14_1;
+    A[75] = -0.0190476190476191*G0_0_0 - 0.0190476190476191*G0_0_1 - 0.0126984126984127*G0_1_0 - 0.00634920634920635*G0_2_1 - 0.00634920634920635*G0_3_0 - 0.0126984126984127*G0_3_1 + 0.00634920634920635*G0_4_0 + 0.0253968253968254*G0_4_1 + 0.0317460317460318*G0_5_0 + 0.0126984126984127*G0_5_1 - 0.0190476190476191*G1_0_0 - 0.0190476190476191*G1_0_1 + 0.0126984126984127*G1_1_0 + 0.0126984126984127*G1_1_1 + 0.00793650793650793*G1_2_0 + 0.00793650793650793*G1_2_1 - 0.00634920634920633*G1_3_0 - 0.00634920634920632*G1_3_1 - 0.0317460317460317*G1_4_0 - 0.0317460317460317*G1_4_1 - 0.0634920634920635*G1_5_0 - 0.0634920634920635*G1_5_1 - 0.0190476190476191*G3_6_0 - 0.0190476190476191*G3_6_1 + 0.0126984126984127*G3_7_0 + 0.0126984126984127*G3_7_1 + 0.00793650793650793*G3_8_0 + 0.00793650793650793*G3_8_1 - 0.00634920634920633*G3_9_0 - 0.00634920634920632*G3_9_1 - 0.0317460317460317*G3_10_0 - 0.0317460317460317*G3_10_1 - 0.0634920634920635*G3_11_0 - 0.0634920634920635*G3_11_1 - 0.666666666666667*G10_0_0_0 - 0.666666666666667*G10_0_0_1 - 0.666666666666667*G12_0_0_0 - 0.666666666666667*G12_0_0_1;
+    A[76] = 0.0126984126984127*G0_0_0 + 0.0126984126984127*G0_0_1 + 0.019047619047619*G0_1_0 - 0.00634920634920636*G0_2_1 - 0.00634920634920635*G0_3_0 + 0.019047619047619*G0_3_1 + 0.00634920634920635*G0_4_0 - 0.00634920634920633*G0_4_1 - 0.0317460317460317*G0_5_0 - 0.0190476190476191*G0_5_1 - 0.0126984126984127*G1_0_0 + 0.019047619047619*G1_1_0 - 0.00793650793650793*G1_2_0 + 0.0317460317460317*G1_3_0 + 0.00634920634920634*G1_4_0 + 0.0634920634920635*G1_5_0 - 0.0126984126984127*G3_6_0 + 0.019047619047619*G3_7_0 - 0.00793650793650793*G3_8_0 + 0.0317460317460317*G3_9_0 + 0.00634920634920634*G3_10_0 + 0.0634920634920635*G3_11_0 - 0.666666666666667*G10_0_0_0 - 0.666666666666667*G10_0_1_0 - 0.666666666666667*G12_0_0_0 - 0.666666666666667*G12_0_1_0;
+    A[77] = 0.00793650793650793*G0_0_0 + 0.00793650793650793*G0_0_1 - 0.00793650793650793*G0_1_0 + 0.00476190476190476*G0_2_1 - 0.00634920634920633*G0_3_0 - 0.019047619047619*G0_3_1 + 0.00634920634920633*G0_4_0 - 0.0126984126984127*G0_4_1 + 0.019047619047619*G0_5_1 - 0.00634920634920635*G1_0_1 - 0.00634920634920636*G1_1_1 + 0.00476190476190476*G1_2_1 + 0.00634920634920636*G1_3_1 + 0.00634920634920636*G1_4_1 - 0.0380952380952381*G1_5_1 - 0.00634920634920635*G3_6_1 - 0.00634920634920636*G3_7_1 + 0.00476190476190476*G3_8_1 + 0.00634920634920636*G3_9_1 + 0.00634920634920636*G3_10_1 - 0.0380952380952381*G3_11_1;
+    A[78] = -0.00634920634920633*G0_0_0 - 0.00634920634920632*G0_0_1 + 0.0317460317460317*G0_1_0 + 0.00634920634920636*G0_2_1 + 0.0507936507936508*G0_3_0 + 0.0761904761904761*G0_3_1 - 0.0507936507936508*G0_4_0 - 0.0253968253968254*G0_5_0 - 0.0761904761904762*G0_5_1 - 0.00634920634920635*G1_0_0 - 0.0126984126984127*G1_0_1 - 0.00634920634920635*G1_1_0 + 0.019047619047619*G1_1_1 - 0.00634920634920633*G1_2_0 - 0.019047619047619*G1_2_1 + 0.0507936507936508*G1_3_0 + 0.0761904761904761*G1_3_1 + 0.0507936507936507*G1_4_0 + 0.0507936507936507*G1_4_1 + 0.0507936507936507*G1_5_0 + 0.152380952380952*G1_5_1 - 0.00634920634920635*G3_6_0 - 0.0126984126984127*G3_6_1 - 0.00634920634920635*G3_7_0 + 0.019047619047619*G3_7_1 - 0.00634920634920633*G3_8_0 - 0.019047619047619*G3_8_1 + 0.0507936507936508*G3_9_0 + 0.0761904761904761*G3_9_1 + 0.0507936507936507*G3_10_0 + 0.0507936507936507*G3_10_1 + 0.0507936507936507*G3_11_0 + 0.152380952380952*G3_11_1 - 0.666666666666667*G10_0_0_1 - 0.666666666666666*G10_0_1_0 - 1.33333333333333*G10_0_1_1 - 0.666666666666667*G12_0_0_1 - 0.666666666666666*G12_0_1_0 - 1.33333333333333*G12_0_1_1;
+    A[79] = -0.0317460317460317*G0_0_0 - 0.0317460317460317*G0_0_1 + 0.00634920634920634*G0_1_0 + 0.00634920634920636*G0_2_1 + 0.0507936507936507*G0_3_0 + 0.0507936507936507*G0_3_1 - 0.0507936507936507*G0_4_0 + 0.0253968253968254*G0_4_1 + 0.0253968253968254*G0_5_0 - 0.0507936507936508*G0_5_1 + 0.00634920634920635*G1_0_0 + 0.0253968253968254*G1_0_1 + 0.00634920634920635*G1_1_0 - 0.00634920634920633*G1_1_1 + 0.00634920634920633*G1_2_0 - 0.0126984126984127*G1_2_1 - 0.0507936507936508*G1_3_0 - 0.0507936507936507*G1_4_0 + 0.0253968253968254*G1_4_1 - 0.0507936507936507*G1_5_0 + 0.101587301587302*G1_5_1 + 0.00634920634920635*G3_6_0 + 0.0253968253968254*G3_6_1 + 0.00634920634920635*G3_7_0 - 0.00634920634920633*G3_7_1 + 0.00634920634920633*G3_8_0 - 0.0126984126984127*G3_8_1 - 0.0507936507936508*G3_9_0 - 0.0507936507936507*G3_10_0 + 0.0253968253968254*G3_10_1 - 0.0507936507936507*G3_11_0 + 0.101587301587302*G3_11_1 + 0.666666666666667*G10_0_0_1 + 0.666666666666666*G10_0_1_0 + 0.666666666666667*G12_0_0_1 + 0.666666666666666*G12_0_1_0;
+    A[80] = -0.0634920634920635*G0_0_0 - 0.0634920634920635*G0_0_1 + 0.0634920634920635*G0_1_0 - 0.0380952380952381*G0_2_1 + 0.0507936507936507*G0_3_0 + 0.152380952380952*G0_3_1 - 0.0507936507936507*G0_4_0 + 0.101587301587302*G0_4_1 - 0.152380952380952*G0_5_1 + 0.0317460317460318*G1_0_0 + 0.0126984126984127*G1_0_1 - 0.0317460317460317*G1_1_0 - 0.0190476190476191*G1_1_1 + 0.019047619047619*G1_2_1 - 0.0253968253968254*G1_3_0 - 0.0761904761904762*G1_3_1 + 0.0253968253968254*G1_4_0 - 0.0507936507936508*G1_4_1 - 0.152380952380952*G1_5_1 + 0.0317460317460318*G3_6_0 + 0.0126984126984127*G3_6_1 - 0.0317460317460317*G3_7_0 - 0.0190476190476191*G3_7_1 + 0.019047619047619*G3_8_1 - 0.0253968253968254*G3_9_0 - 0.0761904761904762*G3_9_1 + 0.0253968253968254*G3_10_0 - 0.0507936507936508*G3_10_1 - 0.152380952380952*G3_11_1 + 1.33333333333333*G10_0_0_0 + 0.666666666666667*G10_0_0_1 + 0.666666666666667*G10_0_1_0 + 1.33333333333333*G10_0_1_1 + 1.33333333333333*G12_0_0_0 + 0.666666666666667*G12_0_0_1 + 0.666666666666667*G12_0_1_0 + 1.33333333333333*G12_0_1_1;
+    A[81] = -0.0190476190476191*G2_0_0 - 0.0190476190476191*G2_0_1 - 0.0126984126984127*G2_1_0 - 0.00634920634920635*G2_2_1 - 0.00634920634920635*G2_3_0 - 0.0126984126984127*G2_3_1 + 0.00634920634920635*G2_4_0 + 0.0253968253968254*G2_4_1 + 0.0317460317460318*G2_5_0 + 0.0126984126984127*G2_5_1;
+    A[82] = 0.0126984126984127*G2_0_0 + 0.0126984126984127*G2_0_1 + 0.019047619047619*G2_1_0 - 0.00634920634920636*G2_2_1 - 0.00634920634920635*G2_3_0 + 0.019047619047619*G2_3_1 + 0.00634920634920635*G2_4_0 - 0.00634920634920633*G2_4_1 - 0.0317460317460317*G2_5_0 - 0.0190476190476191*G2_5_1;
+    A[83] = 0.00793650793650793*G2_0_0 + 0.00793650793650793*G2_0_1 - 0.00793650793650793*G2_1_0 + 0.00476190476190476*G2_2_1 - 0.00634920634920633*G2_3_0 - 0.019047619047619*G2_3_1 + 0.00634920634920633*G2_4_0 - 0.0126984126984127*G2_4_1 + 0.019047619047619*G2_5_1;
+    A[84] = -0.00634920634920633*G2_0_0 - 0.00634920634920632*G2_0_1 + 0.0317460317460317*G2_1_0 + 0.00634920634920636*G2_2_1 + 0.0507936507936508*G2_3_0 + 0.0761904761904761*G2_3_1 - 0.0507936507936508*G2_4_0 - 0.0253968253968254*G2_5_0 - 0.0761904761904762*G2_5_1;
+    A[85] = -0.0317460317460317*G2_0_0 - 0.0317460317460317*G2_0_1 + 0.00634920634920634*G2_1_0 + 0.00634920634920636*G2_2_1 + 0.0507936507936507*G2_3_0 + 0.0507936507936507*G2_3_1 - 0.0507936507936507*G2_4_0 + 0.0253968253968254*G2_4_1 + 0.0253968253968254*G2_5_0 - 0.0507936507936508*G2_5_1;
+    A[86] = -0.0634920634920635*G2_0_0 - 0.0634920634920635*G2_0_1 + 0.0634920634920635*G2_1_0 - 0.0380952380952381*G2_2_1 + 0.0507936507936507*G2_3_0 + 0.152380952380952*G2_3_1 - 0.0507936507936507*G2_4_0 + 0.101587301587302*G2_4_1 - 0.152380952380952*G2_5_1;
+    A[87] = -0.166666666666667*G14_0 + 0.166666666666667*G14_1;
+    A[88] = 0.166666666666667*G14_0 + 0.333333333333333*G14_1;
+    A[89] = 0.166666666666667*G14_1;
+    A[90] = -0.030952380952381*G4_6_0 - 0.030952380952381*G4_6_1 - 0.00714285714285715*G4_7_0 - 0.00714285714285715*G4_8_1 + 0.00952380952380951*G4_9_0 + 0.00952380952380951*G4_9_1 - 0.00952380952380951*G4_10_0 + 0.0380952380952381*G4_10_1 + 0.0380952380952381*G4_11_0 - 0.00952380952380952*G4_11_1;
+    A[91] = 0.00357142857142857*G4_6_0 + 0.00357142857142857*G4_6_1 - 0.00357142857142857*G4_7_0 + 0.00436507936507936*G4_8_1 + 0.00158730158730159*G4_9_0 - 0.00634920634920634*G4_9_1 - 0.00158730158730159*G4_10_0 - 0.00793650793650793*G4_10_1 + 0.00634920634920635*G4_11_1;
+    A[92] = 0.00357142857142857*G4_6_0 + 0.00357142857142857*G4_6_1 + 0.00436507936507936*G4_7_0 - 0.00357142857142857*G4_8_1 - 0.00634920634920634*G4_9_0 + 0.00158730158730159*G4_9_1 + 0.00634920634920634*G4_10_0 - 0.00793650793650793*G4_11_0 - 0.00158730158730159*G4_11_1;
+    A[93] = -0.00476190476190477*G4_6_0 - 0.00476190476190477*G4_6_1 - 0.00793650793650793*G4_7_0 - 0.00793650793650793*G4_8_1 - 0.019047619047619*G4_9_0 - 0.019047619047619*G4_9_1 + 0.019047619047619*G4_10_0 + 0.0126984126984127*G4_10_1 + 0.0126984126984127*G4_11_0 + 0.019047619047619*G4_11_1;
+    A[94] = -0.0190476190476191*G4_6_0 - 0.0190476190476191*G4_6_1 - 0.00634920634920636*G4_7_0 - 0.0126984126984127*G4_8_1 - 0.0126984126984127*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.0126984126984127*G4_10_0 + 0.0317460317460318*G4_10_1 + 0.0253968253968254*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[95] = -0.0190476190476191*G4_6_0 - 0.0190476190476191*G4_6_1 - 0.0126984126984127*G4_7_0 - 0.00634920634920635*G4_8_1 - 0.00634920634920635*G4_9_0 - 0.0126984126984127*G4_9_1 + 0.00634920634920635*G4_10_0 + 0.0253968253968254*G4_10_1 + 0.0317460317460318*G4_11_0 + 0.0126984126984127*G4_11_1;
+    A[96] = -0.030952380952381*G5_0_0 - 0.030952380952381*G5_0_1 + 0.00357142857142857*G5_1_0 + 0.00357142857142857*G5_1_1 + 0.00357142857142857*G5_2_0 + 0.00357142857142857*G5_2_1 - 0.00476190476190477*G5_3_0 - 0.00476190476190477*G5_3_1 - 0.0190476190476191*G5_4_0 - 0.0190476190476191*G5_4_1 - 0.0190476190476191*G5_5_0 - 0.0190476190476191*G5_5_1 - 0.030952380952381*G6_6_0 - 0.030952380952381*G6_6_1 - 0.00714285714285715*G6_7_0 - 0.00714285714285715*G6_8_1 + 0.00952380952380951*G6_9_0 + 0.00952380952380951*G6_9_1 - 0.00952380952380951*G6_10_0 + 0.0380952380952381*G6_10_1 + 0.0380952380952381*G6_11_0 - 0.00952380952380952*G6_11_1 - 0.030952380952381*G7_6_0 - 0.030952380952381*G7_6_1 + 0.00357142857142857*G7_7_0 + 0.00357142857142857*G7_7_1 + 0.00357142857142857*G7_8_0 + 0.00357142857142857*G7_8_1 - 0.00476190476190477*G7_9_0 - 0.00476190476190477*G7_9_1 - 0.0190476190476191*G7_10_0 - 0.0190476190476191*G7_10_1 - 0.0190476190476191*G7_11_0 - 0.0190476190476191*G7_11_1 + 0.5*G11_0_0_0 + 0.5*G11_0_0_1 + 0.5*G11_0_1_0 + 0.5*G11_0_1_1 + 0.5*G13_0_0_0 + 0.5*G13_0_0_1 + 0.5*G13_0_1_0 + 0.5*G13_0_1_1;
+    A[97] = -0.00714285714285715*G5_0_0 - 0.00357142857142857*G5_1_0 + 0.00436507936507936*G5_2_0 - 0.00793650793650793*G5_3_0 - 0.00634920634920636*G5_4_0 - 0.0126984126984127*G5_5_0 + 0.00357142857142857*G6_6_0 + 0.00357142857142857*G6_6_1 - 0.00357142857142857*G6_7_0 + 0.00436507936507936*G6_8_1 + 0.00158730158730159*G6_9_0 - 0.00634920634920634*G6_9_1 - 0.00158730158730159*G6_10_0 - 0.00793650793650793*G6_10_1 + 0.00634920634920635*G6_11_1 - 0.00714285714285715*G7_6_0 - 0.00357142857142857*G7_7_0 + 0.00436507936507936*G7_8_0 - 0.00793650793650793*G7_9_0 - 0.00634920634920636*G7_10_0 - 0.0126984126984127*G7_11_0 + 0.166666666666667*G11_0_0_0 + 0.166666666666667*G11_0_1_0 + 0.166666666666667*G13_0_0_0 + 0.166666666666667*G13_0_1_0;
+    A[98] = -0.00714285714285715*G5_0_1 + 0.00436507936507936*G5_1_1 - 0.00357142857142857*G5_2_1 - 0.00793650793650793*G5_3_1 - 0.0126984126984127*G5_4_1 - 0.00634920634920635*G5_5_1 + 0.00357142857142857*G6_6_0 + 0.00357142857142857*G6_6_1 + 0.00436507936507936*G6_7_0 - 0.00357142857142857*G6_8_1 - 0.00634920634920634*G6_9_0 + 0.00158730158730159*G6_9_1 + 0.00634920634920634*G6_10_0 - 0.00793650793650793*G6_11_0 - 0.00158730158730159*G6_11_1 - 0.00714285714285715*G7_6_1 + 0.00436507936507936*G7_7_1 - 0.00357142857142857*G7_8_1 - 0.00793650793650793*G7_9_1 - 0.0126984126984127*G7_10_1 - 0.00634920634920635*G7_11_1 + 0.166666666666667*G11_0_0_1 + 0.166666666666667*G11_0_1_1 + 0.166666666666667*G13_0_0_1 + 0.166666666666667*G13_0_1_1;
+    A[99] = 0.00952380952380951*G5_0_0 + 0.00952380952380951*G5_0_1 + 0.00158730158730159*G5_1_0 - 0.00634920634920634*G5_1_1 - 0.00634920634920634*G5_2_0 + 0.00158730158730159*G5_2_1 - 0.019047619047619*G5_3_0 - 0.019047619047619*G5_3_1 - 0.0126984126984127*G5_4_0 - 0.00634920634920634*G5_4_1 - 0.00634920634920635*G5_5_0 - 0.0126984126984127*G5_5_1 - 0.00476190476190477*G6_6_0 - 0.00476190476190477*G6_6_1 - 0.00793650793650793*G6_7_0 - 0.00793650793650793*G6_8_1 - 0.019047619047619*G6_9_0 - 0.019047619047619*G6_9_1 + 0.019047619047619*G6_10_0 + 0.0126984126984127*G6_10_1 + 0.0126984126984127*G6_11_0 + 0.019047619047619*G6_11_1 + 0.00952380952380951*G7_6_0 + 0.00952380952380951*G7_6_1 + 0.00158730158730159*G7_7_0 - 0.00634920634920634*G7_7_1 - 0.00634920634920634*G7_8_0 + 0.00158730158730159*G7_8_1 - 0.019047619047619*G7_9_0 - 0.019047619047619*G7_9_1 - 0.0126984126984127*G7_10_0 - 0.00634920634920634*G7_10_1 - 0.00634920634920635*G7_11_0 - 0.0126984126984127*G7_11_1;
+    A[100] = -0.00952380952380951*G5_0_0 + 0.0380952380952381*G5_0_1 - 0.00158730158730159*G5_1_0 - 0.00793650793650793*G5_1_1 + 0.00634920634920634*G5_2_0 + 0.019047619047619*G5_3_0 + 0.0126984126984127*G5_3_1 + 0.0126984126984127*G5_4_0 + 0.0317460317460318*G5_4_1 + 0.00634920634920635*G5_5_0 + 0.0253968253968254*G5_5_1 - 0.0190476190476191*G6_6_0 - 0.0190476190476191*G6_6_1 - 0.00634920634920636*G6_7_0 - 0.0126984126984127*G6_8_1 - 0.0126984126984127*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.0126984126984127*G6_10_0 + 0.0317460317460318*G6_10_1 + 0.0253968253968254*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.00952380952380951*G7_6_0 + 0.0380952380952381*G7_6_1 - 0.00158730158730159*G7_7_0 - 0.00793650793650793*G7_7_1 + 0.00634920634920634*G7_8_0 + 0.019047619047619*G7_9_0 + 0.0126984126984127*G7_9_1 + 0.0126984126984127*G7_10_0 + 0.0317460317460318*G7_10_1 + 0.00634920634920635*G7_11_0 + 0.0253968253968254*G7_11_1 - 0.666666666666667*G11_0_0_1 - 0.666666666666666*G11_0_1_1 - 0.666666666666667*G13_0_0_1 - 0.666666666666666*G13_0_1_1;
+    A[101] = 0.0380952380952381*G5_0_0 - 0.00952380952380952*G5_0_1 + 0.00634920634920635*G5_1_1 - 0.00793650793650793*G5_2_0 - 0.00158730158730159*G5_2_1 + 0.0126984126984127*G5_3_0 + 0.019047619047619*G5_3_1 + 0.0253968253968254*G5_4_0 + 0.00634920634920634*G5_4_1 + 0.0317460317460318*G5_5_0 + 0.0126984126984127*G5_5_1 - 0.0190476190476191*G6_6_0 - 0.0190476190476191*G6_6_1 - 0.0126984126984127*G6_7_0 - 0.00634920634920635*G6_8_1 - 0.00634920634920635*G6_9_0 - 0.0126984126984127*G6_9_1 + 0.00634920634920635*G6_10_0 + 0.0253968253968254*G6_10_1 + 0.0317460317460318*G6_11_0 + 0.0126984126984127*G6_11_1 + 0.0380952380952381*G7_6_0 - 0.00952380952380952*G7_6_1 + 0.00634920634920635*G7_7_1 - 0.00793650793650793*G7_8_0 - 0.00158730158730159*G7_8_1 + 0.0126984126984127*G7_9_0 + 0.019047619047619*G7_9_1 + 0.0253968253968254*G7_10_0 + 0.00634920634920634*G7_10_1 + 0.0317460317460318*G7_11_0 + 0.0126984126984127*G7_11_1 - 0.666666666666667*G11_0_0_0 - 0.666666666666667*G11_0_1_0 - 0.666666666666667*G13_0_0_0 - 0.666666666666667*G13_0_1_0;
+    A[102] = 0.166666666666667*G15_0 + 0.166666666666667*G15_1;
+    A[103] = 0.0;
+    A[104] = 0.0;
+    A[105] = 0.00357142857142857*G4_6_0 + 0.00357142857142857*G4_6_1 - 0.00357142857142857*G4_7_0 + 0.00436507936507936*G4_8_1 + 0.00158730158730159*G4_9_0 - 0.00634920634920634*G4_9_1 - 0.00158730158730159*G4_10_0 - 0.00793650793650793*G4_10_1 + 0.00634920634920635*G4_11_1;
+    A[106] = 0.00714285714285713*G4_6_0 + 0.00714285714285714*G4_6_1 + 0.0309523809523809*G4_7_0 - 0.00714285714285713*G4_8_1 + 0.0095238095238095*G4_9_0 + 0.0476190476190476*G4_9_1 - 0.0095238095238095*G4_10_0 - 0.0380952380952381*G4_11_0 - 0.0476190476190476*G4_11_1;
+    A[107] = -0.00436507936507936*G4_6_0 - 0.00436507936507936*G4_6_1 - 0.00357142857142856*G4_7_0 - 0.00357142857142857*G4_8_1 - 0.00634920634920633*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.00634920634920633*G4_10_0 + 0.00793650793650792*G4_10_1 + 0.00793650793650793*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[108] = 0.00634920634920634*G4_6_0 + 0.00634920634920634*G4_6_1 + 0.019047619047619*G4_7_0 - 0.0126984126984127*G4_8_1 - 0.0126984126984127*G4_9_0 + 0.019047619047619*G4_9_1 + 0.0126984126984127*G4_10_0 + 0.00634920634920636*G4_10_1 - 0.0253968253968254*G4_11_0 - 0.019047619047619*G4_11_1;
+    A[109] = 0.00793650793650793*G4_6_0 + 0.00793650793650793*G4_6_1 + 0.00476190476190476*G4_7_0 - 0.00793650793650794*G4_8_1 - 0.019047619047619*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.019047619047619*G4_10_0 - 0.0126984126984127*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[110] = 0.0126984126984127*G4_6_0 + 0.0126984126984127*G4_6_1 + 0.019047619047619*G4_7_0 - 0.00634920634920636*G4_8_1 - 0.00634920634920635*G4_9_0 + 0.019047619047619*G4_9_1 + 0.00634920634920635*G4_10_0 - 0.00634920634920633*G4_10_1 - 0.0317460317460317*G4_11_0 - 0.0190476190476191*G4_11_1;
+    A[111] = 0.00357142857142857*G5_0_0 + 0.00357142857142857*G5_0_1 + 0.00714285714285713*G5_1_0 + 0.00714285714285714*G5_1_1 - 0.00436507936507936*G5_2_0 - 0.00436507936507936*G5_2_1 + 0.00634920634920634*G5_3_0 + 0.00634920634920634*G5_3_1 + 0.00793650793650793*G5_4_0 + 0.00793650793650793*G5_4_1 + 0.0126984126984127*G5_5_0 + 0.0126984126984127*G5_5_1 + 0.00357142857142857*G6_6_0 + 0.00357142857142857*G6_6_1 - 0.00357142857142857*G6_7_0 + 0.00436507936507936*G6_8_1 + 0.00158730158730159*G6_9_0 - 0.00634920634920634*G6_9_1 - 0.00158730158730159*G6_10_0 - 0.00793650793650793*G6_10_1 + 0.00634920634920635*G6_11_1 + 0.00357142857142857*G7_6_0 + 0.00357142857142857*G7_6_1 + 0.00714285714285713*G7_7_0 + 0.00714285714285714*G7_7_1 - 0.00436507936507936*G7_8_0 - 0.00436507936507936*G7_8_1 + 0.00634920634920634*G7_9_0 + 0.00634920634920634*G7_9_1 + 0.00793650793650793*G7_10_0 + 0.00793650793650793*G7_10_1 + 0.0126984126984127*G7_11_0 + 0.0126984126984127*G7_11_1 + 0.166666666666667*G11_0_0_0 + 0.166666666666667*G11_0_0_1 + 0.166666666666667*G13_0_0_0 + 0.166666666666667*G13_0_0_1;
+    A[112] = -0.00357142857142857*G5_0_0 + 0.0309523809523809*G5_1_0 - 0.00357142857142856*G5_2_0 + 0.019047619047619*G5_3_0 + 0.00476190476190476*G5_4_0 + 0.019047619047619*G5_5_0 + 0.00714285714285713*G6_6_0 + 0.00714285714285714*G6_6_1 + 0.0309523809523809*G6_7_0 - 0.00714285714285713*G6_8_1 + 0.0095238095238095*G6_9_0 + 0.0476190476190476*G6_9_1 - 0.0095238095238095*G6_10_0 - 0.0380952380952381*G6_11_0 - 0.0476190476190476*G6_11_1 - 0.00357142857142857*G7_6_0 + 0.0309523809523809*G7_7_0 - 0.00357142857142856*G7_8_0 + 0.019047619047619*G7_9_0 + 0.00476190476190476*G7_10_0 + 0.019047619047619*G7_11_0 + 0.5*G11_0_0_0 + 0.5*G13_0_0_0;
+    A[113] = 0.00436507936507936*G5_0_1 - 0.00714285714285713*G5_1_1 - 0.00357142857142857*G5_2_1 - 0.0126984126984127*G5_3_1 - 0.00793650793650794*G5_4_1 - 0.00634920634920636*G5_5_1 - 0.00436507936507936*G6_6_0 - 0.00436507936507936*G6_6_1 - 0.00357142857142856*G6_7_0 - 0.00357142857142857*G6_8_1 - 0.00634920634920633*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.00634920634920633*G6_10_0 + 0.00793650793650792*G6_10_1 + 0.00793650793650793*G6_11_0 + 0.00634920634920634*G6_11_1 + 0.00436507936507936*G7_6_1 - 0.00714285714285713*G7_7_1 - 0.00357142857142857*G7_8_1 - 0.0126984126984127*G7_9_1 - 0.00793650793650794*G7_10_1 - 0.00634920634920636*G7_11_1 - 0.166666666666667*G11_0_0_1 - 0.166666666666667*G13_0_0_1;
+    A[114] = 0.00158730158730159*G5_0_0 - 0.00634920634920634*G5_0_1 + 0.0095238095238095*G5_1_0 + 0.0476190476190476*G5_1_1 - 0.00634920634920633*G5_2_0 - 0.00634920634920634*G5_2_1 - 0.0126984126984127*G5_3_0 + 0.019047619047619*G5_3_1 - 0.019047619047619*G5_4_0 - 0.00634920634920634*G5_4_1 - 0.00634920634920635*G5_5_0 + 0.019047619047619*G5_5_1 + 0.00634920634920634*G6_6_0 + 0.00634920634920634*G6_6_1 + 0.019047619047619*G6_7_0 - 0.0126984126984127*G6_8_1 - 0.0126984126984127*G6_9_0 + 0.019047619047619*G6_9_1 + 0.0126984126984127*G6_10_0 + 0.00634920634920636*G6_10_1 - 0.0253968253968254*G6_11_0 - 0.019047619047619*G6_11_1 + 0.00158730158730159*G7_6_0 - 0.00634920634920634*G7_6_1 + 0.0095238095238095*G7_7_0 + 0.0476190476190476*G7_7_1 - 0.00634920634920633*G7_8_0 - 0.00634920634920634*G7_8_1 - 0.0126984126984127*G7_9_0 + 0.019047619047619*G7_9_1 - 0.019047619047619*G7_10_0 - 0.00634920634920634*G7_10_1 - 0.00634920634920635*G7_11_0 + 0.019047619047619*G7_11_1 + 0.666666666666666*G11_0_0_1 + 0.666666666666666*G13_0_0_1;
+    A[115] = -0.00158730158730159*G5_0_0 - 0.00793650793650793*G5_0_1 - 0.0095238095238095*G5_1_0 + 0.00634920634920633*G5_2_0 + 0.00793650793650792*G5_2_1 + 0.0126984126984127*G5_3_0 + 0.00634920634920636*G5_3_1 + 0.019047619047619*G5_4_0 + 0.00634920634920635*G5_5_0 - 0.00634920634920633*G5_5_1 + 0.00793650793650793*G6_6_0 + 0.00793650793650793*G6_6_1 + 0.00476190476190476*G6_7_0 - 0.00793650793650794*G6_8_1 - 0.019047619047619*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.019047619047619*G6_10_0 - 0.0126984126984127*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.00158730158730159*G7_6_0 - 0.00793650793650793*G7_6_1 - 0.0095238095238095*G7_7_0 + 0.00634920634920633*G7_8_0 + 0.00793650793650792*G7_8_1 + 0.0126984126984127*G7_9_0 + 0.00634920634920636*G7_9_1 + 0.019047619047619*G7_10_0 + 0.00634920634920635*G7_11_0 - 0.00634920634920633*G7_11_1;
+    A[116] = 0.00634920634920635*G5_0_1 - 0.0380952380952381*G5_1_0 - 0.0476190476190476*G5_1_1 + 0.00793650793650793*G5_2_0 + 0.00634920634920634*G5_2_1 - 0.0253968253968254*G5_3_0 - 0.019047619047619*G5_3_1 - 0.0126984126984127*G5_4_0 + 0.00634920634920634*G5_4_1 - 0.0317460317460317*G5_5_0 - 0.0190476190476191*G5_5_1 + 0.0126984126984127*G6_6_0 + 0.0126984126984127*G6_6_1 + 0.019047619047619*G6_7_0 - 0.00634920634920636*G6_8_1 - 0.00634920634920635*G6_9_0 + 0.019047619047619*G6_9_1 + 0.00634920634920635*G6_10_0 - 0.00634920634920633*G6_10_1 - 0.0317460317460317*G6_11_0 - 0.0190476190476191*G6_11_1 + 0.00634920634920635*G7_6_1 - 0.0380952380952381*G7_7_0 - 0.0476190476190476*G7_7_1 + 0.00793650793650793*G7_8_0 + 0.00634920634920634*G7_8_1 - 0.0253968253968254*G7_9_0 - 0.019047619047619*G7_9_1 - 0.0126984126984127*G7_10_0 + 0.00634920634920634*G7_10_1 - 0.0317460317460317*G7_11_0 - 0.0190476190476191*G7_11_1 - 0.666666666666667*G11_0_0_0 - 0.666666666666666*G11_0_0_1 - 0.666666666666667*G13_0_0_0 - 0.666666666666666*G13_0_0_1;
+    A[117] = 0.0;
+    A[118] = -0.166666666666667*G15_0;
+    A[119] = 0.0;
+    A[120] = 0.00357142857142857*G4_6_0 + 0.00357142857142857*G4_6_1 + 0.00436507936507936*G4_7_0 - 0.00357142857142857*G4_8_1 - 0.00634920634920634*G4_9_0 + 0.00158730158730159*G4_9_1 + 0.00634920634920634*G4_10_0 - 0.00793650793650793*G4_11_0 - 0.00158730158730159*G4_11_1;
+    A[121] = -0.00436507936507936*G4_6_0 - 0.00436507936507936*G4_6_1 - 0.00357142857142857*G4_7_0 - 0.00357142857142857*G4_8_1 - 0.00634920634920634*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.00634920634920634*G4_10_0 + 0.00793650793650792*G4_10_1 + 0.00793650793650793*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[122] = 0.00714285714285714*G4_6_0 + 0.00714285714285713*G4_6_1 - 0.00714285714285714*G4_7_0 + 0.0309523809523809*G4_8_1 + 0.0476190476190475*G4_9_0 + 0.0095238095238095*G4_9_1 - 0.0476190476190475*G4_10_0 - 0.038095238095238*G4_10_1 - 0.00952380952380951*G4_11_1;
+    A[123] = 0.00634920634920635*G4_6_0 + 0.00634920634920634*G4_6_1 - 0.0126984126984127*G4_7_0 + 0.019047619047619*G4_8_1 + 0.019047619047619*G4_9_0 - 0.0126984126984127*G4_9_1 - 0.019047619047619*G4_10_0 - 0.0253968253968254*G4_10_1 + 0.00634920634920634*G4_11_0 + 0.0126984126984127*G4_11_1;
+    A[124] = 0.0126984126984127*G4_6_0 + 0.0126984126984127*G4_6_1 - 0.00634920634920635*G4_7_0 + 0.019047619047619*G4_8_1 + 0.019047619047619*G4_9_0 - 0.00634920634920634*G4_9_1 - 0.019047619047619*G4_10_0 - 0.0317460317460317*G4_10_1 - 0.00634920634920635*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[125] = 0.00793650793650793*G4_6_0 + 0.00793650793650793*G4_6_1 - 0.00793650793650793*G4_7_0 + 0.00476190476190476*G4_8_1 - 0.00634920634920633*G4_9_0 - 0.019047619047619*G4_9_1 + 0.00634920634920633*G4_10_0 - 0.0126984126984127*G4_10_1 + 0.019047619047619*G4_11_1;
+    A[126] = 0.00357142857142857*G5_0_0 + 0.00357142857142857*G5_0_1 - 0.00436507936507936*G5_1_0 - 0.00436507936507936*G5_1_1 + 0.00714285714285714*G5_2_0 + 0.00714285714285713*G5_2_1 + 0.00634920634920635*G5_3_0 + 0.00634920634920634*G5_3_1 + 0.0126984126984127*G5_4_0 + 0.0126984126984127*G5_4_1 + 0.00793650793650793*G5_5_0 + 0.00793650793650793*G5_5_1 + 0.00357142857142857*G6_6_0 + 0.00357142857142857*G6_6_1 + 0.00436507936507936*G6_7_0 - 0.00357142857142857*G6_8_1 - 0.00634920634920634*G6_9_0 + 0.00158730158730159*G6_9_1 + 0.00634920634920634*G6_10_0 - 0.00793650793650793*G6_11_0 - 0.00158730158730159*G6_11_1 + 0.00357142857142857*G7_6_0 + 0.00357142857142857*G7_6_1 - 0.00436507936507936*G7_7_0 - 0.00436507936507936*G7_7_1 + 0.00714285714285714*G7_8_0 + 0.00714285714285713*G7_8_1 + 0.00634920634920635*G7_9_0 + 0.00634920634920634*G7_9_1 + 0.0126984126984127*G7_10_0 + 0.0126984126984127*G7_10_1 + 0.00793650793650793*G7_11_0 + 0.00793650793650793*G7_11_1 + 0.166666666666667*G11_0_1_0 + 0.166666666666667*G11_0_1_1 + 0.166666666666667*G13_0_1_0 + 0.166666666666667*G13_0_1_1;
+    A[127] = 0.00436507936507936*G5_0_0 - 0.00357142857142857*G5_1_0 - 0.00714285714285714*G5_2_0 - 0.0126984126984127*G5_3_0 - 0.00634920634920635*G5_4_0 - 0.00793650793650793*G5_5_0 - 0.00436507936507936*G6_6_0 - 0.00436507936507936*G6_6_1 - 0.00357142857142857*G6_7_0 - 0.00357142857142857*G6_8_1 - 0.00634920634920634*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.00634920634920634*G6_10_0 + 0.00793650793650792*G6_10_1 + 0.00793650793650793*G6_11_0 + 0.00634920634920634*G6_11_1 + 0.00436507936507936*G7_6_0 - 0.00357142857142857*G7_7_0 - 0.00714285714285714*G7_8_0 - 0.0126984126984127*G7_9_0 - 0.00634920634920635*G7_10_0 - 0.00793650793650793*G7_11_0 - 0.166666666666667*G11_0_1_0 - 0.166666666666667*G13_0_1_0;
+    A[128] = -0.00357142857142857*G5_0_1 - 0.00357142857142857*G5_1_1 + 0.0309523809523809*G5_2_1 + 0.019047619047619*G5_3_1 + 0.019047619047619*G5_4_1 + 0.00476190476190476*G5_5_1 + 0.00714285714285714*G6_6_0 + 0.00714285714285713*G6_6_1 - 0.00714285714285714*G6_7_0 + 0.0309523809523809*G6_8_1 + 0.0476190476190475*G6_9_0 + 0.0095238095238095*G6_9_1 - 0.0476190476190475*G6_10_0 - 0.038095238095238*G6_10_1 - 0.00952380952380951*G6_11_1 - 0.00357142857142857*G7_6_1 - 0.00357142857142857*G7_7_1 + 0.0309523809523809*G7_8_1 + 0.019047619047619*G7_9_1 + 0.019047619047619*G7_10_1 + 0.00476190476190476*G7_11_1 + 0.5*G11_0_1_1 + 0.5*G13_0_1_1;
+    A[129] = -0.00634920634920634*G5_0_0 + 0.00158730158730159*G5_0_1 - 0.00634920634920634*G5_1_0 - 0.00634920634920634*G5_1_1 + 0.0476190476190475*G5_2_0 + 0.0095238095238095*G5_2_1 + 0.019047619047619*G5_3_0 - 0.0126984126984127*G5_3_1 + 0.019047619047619*G5_4_0 - 0.00634920634920634*G5_4_1 - 0.00634920634920633*G5_5_0 - 0.019047619047619*G5_5_1 + 0.00634920634920635*G6_6_0 + 0.00634920634920634*G6_6_1 - 0.0126984126984127*G6_7_0 + 0.019047619047619*G6_8_1 + 0.019047619047619*G6_9_0 - 0.0126984126984127*G6_9_1 - 0.019047619047619*G6_10_0 - 0.0253968253968254*G6_10_1 + 0.00634920634920634*G6_11_0 + 0.0126984126984127*G6_11_1 - 0.00634920634920634*G7_6_0 + 0.00158730158730159*G7_6_1 - 0.00634920634920634*G7_7_0 - 0.00634920634920634*G7_7_1 + 0.0476190476190475*G7_8_0 + 0.0095238095238095*G7_8_1 + 0.019047619047619*G7_9_0 - 0.0126984126984127*G7_9_1 + 0.019047619047619*G7_10_0 - 0.00634920634920634*G7_10_1 - 0.00634920634920633*G7_11_0 - 0.019047619047619*G7_11_1 + 0.666666666666666*G11_0_1_0 + 0.666666666666666*G13_0_1_0;
+    A[130] = 0.00634920634920634*G5_0_0 + 0.00634920634920634*G5_1_0 + 0.00793650793650792*G5_1_1 - 0.0476190476190475*G5_2_0 - 0.038095238095238*G5_2_1 - 0.019047619047619*G5_3_0 - 0.0253968253968254*G5_3_1 - 0.019047619047619*G5_4_0 - 0.0317460317460317*G5_4_1 + 0.00634920634920633*G5_5_0 - 0.0126984126984127*G5_5_1 + 0.0126984126984127*G6_6_0 + 0.0126984126984127*G6_6_1 - 0.00634920634920635*G6_7_0 + 0.019047619047619*G6_8_1 + 0.019047619047619*G6_9_0 - 0.00634920634920634*G6_9_1 - 0.019047619047619*G6_10_0 - 0.0317460317460317*G6_10_1 - 0.00634920634920635*G6_11_0 + 0.00634920634920634*G6_11_1 + 0.00634920634920634*G7_6_0 + 0.00634920634920634*G7_7_0 + 0.00793650793650792*G7_7_1 - 0.0476190476190475*G7_8_0 - 0.038095238095238*G7_8_1 - 0.019047619047619*G7_9_0 - 0.0253968253968254*G7_9_1 - 0.019047619047619*G7_10_0 - 0.0317460317460317*G7_10_1 + 0.00634920634920633*G7_11_0 - 0.0126984126984127*G7_11_1 - 0.666666666666666*G11_0_1_0 - 0.666666666666666*G11_0_1_1 - 0.666666666666666*G13_0_1_0 - 0.666666666666666*G13_0_1_1;
+    A[131] = -0.00793650793650793*G5_0_0 - 0.00158730158730159*G5_0_1 + 0.00793650793650793*G5_1_0 + 0.00634920634920634*G5_1_1 - 0.00952380952380951*G5_2_1 + 0.00634920634920634*G5_3_0 + 0.0126984126984127*G5_3_1 - 0.00634920634920635*G5_4_0 + 0.00634920634920634*G5_4_1 + 0.019047619047619*G5_5_1 + 0.00793650793650793*G6_6_0 + 0.00793650793650793*G6_6_1 - 0.00793650793650793*G6_7_0 + 0.00476190476190476*G6_8_1 - 0.00634920634920633*G6_9_0 - 0.019047619047619*G6_9_1 + 0.00634920634920633*G6_10_0 - 0.0126984126984127*G6_10_1 + 0.019047619047619*G6_11_1 - 0.00793650793650793*G7_6_0 - 0.00158730158730159*G7_6_1 + 0.00793650793650793*G7_7_0 + 0.00634920634920634*G7_7_1 - 0.00952380952380951*G7_8_1 + 0.00634920634920634*G7_9_0 + 0.0126984126984127*G7_9_1 - 0.00634920634920635*G7_10_0 + 0.00634920634920634*G7_10_1 + 0.019047619047619*G7_11_1;
+    A[132] = 0.0;
+    A[133] = 0.0;
+    A[134] = -0.166666666666667*G15_1;
+    A[135] = -0.00476190476190476*G4_6_0 - 0.00476190476190477*G4_6_1 - 0.00793650793650793*G4_7_0 - 0.00793650793650793*G4_8_1 - 0.019047619047619*G4_9_0 - 0.019047619047619*G4_9_1 + 0.019047619047619*G4_10_0 + 0.0126984126984127*G4_10_1 + 0.0126984126984127*G4_11_0 + 0.019047619047619*G4_11_1;
+    A[136] = 0.00634920634920634*G4_6_0 + 0.00634920634920634*G4_6_1 + 0.019047619047619*G4_7_0 - 0.0126984126984127*G4_8_1 - 0.0126984126984127*G4_9_0 + 0.019047619047619*G4_9_1 + 0.0126984126984127*G4_10_0 + 0.00634920634920636*G4_10_1 - 0.0253968253968254*G4_11_0 - 0.019047619047619*G4_11_1;
+    A[137] = 0.00634920634920635*G4_6_0 + 0.00634920634920634*G4_6_1 - 0.0126984126984127*G4_7_0 + 0.019047619047619*G4_8_1 + 0.019047619047619*G4_9_0 - 0.0126984126984127*G4_9_1 - 0.019047619047619*G4_10_0 - 0.0253968253968254*G4_10_1 + 0.00634920634920634*G4_11_0 + 0.0126984126984127*G4_11_1;
+    A[138] = 0.0380952380952381*G4_6_0 + 0.0380952380952381*G4_6_1 + 0.0634920634920634*G4_7_0 + 0.0634920634920634*G4_8_1 + 0.152380952380952*G4_9_0 + 0.152380952380952*G4_9_1 - 0.152380952380952*G4_10_0 - 0.101587301587301*G4_10_1 - 0.101587301587302*G4_11_0 - 0.152380952380952*G4_11_1;
+    A[139] = -0.00634920634920633*G4_6_0 - 0.00634920634920632*G4_6_1 + 0.00634920634920634*G4_7_0 + 0.0317460317460317*G4_8_1 + 0.0761904761904761*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.0761904761904761*G4_10_0 - 0.0253968253968254*G4_10_1 - 0.0507936507936508*G4_11_1;
+    A[140] = -0.00634920634920633*G4_6_0 - 0.00634920634920632*G4_6_1 + 0.0317460317460317*G4_7_0 + 0.00634920634920636*G4_8_1 + 0.0507936507936508*G4_9_0 + 0.0761904761904761*G4_9_1 - 0.0507936507936508*G4_10_0 - 0.0253968253968254*G4_11_0 - 0.0761904761904762*G4_11_1;
+    A[141] = -0.00476190476190476*G5_0_0 - 0.00476190476190477*G5_0_1 + 0.00634920634920634*G5_1_0 + 0.00634920634920634*G5_1_1 + 0.00634920634920635*G5_2_0 + 0.00634920634920634*G5_2_1 + 0.0380952380952381*G5_3_0 + 0.0380952380952381*G5_3_1 - 0.00634920634920633*G5_4_0 - 0.00634920634920632*G5_4_1 - 0.00634920634920633*G5_5_0 - 0.00634920634920632*G5_5_1 - 0.00476190476190476*G6_6_0 - 0.00476190476190477*G6_6_1 - 0.00793650793650793*G6_7_0 - 0.00793650793650793*G6_8_1 - 0.019047619047619*G6_9_0 - 0.019047619047619*G6_9_1 + 0.019047619047619*G6_10_0 + 0.0126984126984127*G6_10_1 + 0.0126984126984127*G6_11_0 + 0.019047619047619*G6_11_1 - 0.00476190476190476*G7_6_0 - 0.00476190476190477*G7_6_1 + 0.00634920634920634*G7_7_0 + 0.00634920634920634*G7_7_1 + 0.00634920634920635*G7_8_0 + 0.00634920634920634*G7_8_1 + 0.0380952380952381*G7_9_0 + 0.0380952380952381*G7_9_1 - 0.00634920634920633*G7_10_0 - 0.00634920634920632*G7_10_1 - 0.00634920634920633*G7_11_0 - 0.00634920634920632*G7_11_1;
+    A[142] = -0.00793650793650793*G5_0_0 + 0.019047619047619*G5_1_0 - 0.0126984126984127*G5_2_0 + 0.0634920634920634*G5_3_0 + 0.00634920634920634*G5_4_0 + 0.0317460317460317*G5_5_0 + 0.00634920634920634*G6_6_0 + 0.00634920634920634*G6_6_1 + 0.019047619047619*G6_7_0 - 0.0126984126984127*G6_8_1 - 0.0126984126984127*G6_9_0 + 0.019047619047619*G6_9_1 + 0.0126984126984127*G6_10_0 + 0.00634920634920636*G6_10_1 - 0.0253968253968254*G6_11_0 - 0.019047619047619*G6_11_1 - 0.00793650793650793*G7_6_0 + 0.019047619047619*G7_7_0 - 0.0126984126984127*G7_8_0 + 0.0634920634920634*G7_9_0 + 0.00634920634920634*G7_10_0 + 0.0317460317460317*G7_11_0 + 0.666666666666666*G11_0_1_0 + 0.666666666666666*G13_0_1_0;
+    A[143] = -0.00793650793650793*G5_0_1 - 0.0126984126984127*G5_1_1 + 0.019047619047619*G5_2_1 + 0.0634920634920634*G5_3_1 + 0.0317460317460317*G5_4_1 + 0.00634920634920636*G5_5_1 + 0.00634920634920635*G6_6_0 + 0.00634920634920634*G6_6_1 - 0.0126984126984127*G6_7_0 + 0.019047619047619*G6_8_1 + 0.019047619047619*G6_9_0 - 0.0126984126984127*G6_9_1 - 0.019047619047619*G6_10_0 - 0.0253968253968254*G6_10_1 + 0.00634920634920634*G6_11_0 + 0.0126984126984127*G6_11_1 - 0.00793650793650793*G7_6_1 - 0.0126984126984127*G7_7_1 + 0.019047619047619*G7_8_1 + 0.0634920634920634*G7_9_1 + 0.0317460317460317*G7_10_1 + 0.00634920634920636*G7_11_1 + 0.666666666666666*G11_0_0_1 + 0.666666666666666*G13_0_0_1;
+    A[144] = -0.019047619047619*G5_0_0 - 0.019047619047619*G5_0_1 - 0.0126984126984127*G5_1_0 + 0.019047619047619*G5_1_1 + 0.019047619047619*G5_2_0 - 0.0126984126984127*G5_2_1 + 0.152380952380952*G5_3_0 + 0.152380952380952*G5_3_1 + 0.0761904761904761*G5_4_0 + 0.0507936507936507*G5_4_1 + 0.0507936507936508*G5_5_0 + 0.0761904761904761*G5_5_1 + 0.0380952380952381*G6_6_0 + 0.0380952380952381*G6_6_1 + 0.0634920634920634*G6_7_0 + 0.0634920634920634*G6_8_1 + 0.152380952380952*G6_9_0 + 0.152380952380952*G6_9_1 - 0.152380952380952*G6_10_0 - 0.101587301587301*G6_10_1 - 0.101587301587302*G6_11_0 - 0.152380952380952*G6_11_1 - 0.019047619047619*G7_6_0 - 0.019047619047619*G7_6_1 - 0.0126984126984127*G7_7_0 + 0.019047619047619*G7_7_1 + 0.019047619047619*G7_8_0 - 0.0126984126984127*G7_8_1 + 0.152380952380952*G7_9_0 + 0.152380952380952*G7_9_1 + 0.0761904761904761*G7_10_0 + 0.0507936507936507*G7_10_1 + 0.0507936507936508*G7_11_0 + 0.0761904761904761*G7_11_1 + 1.33333333333333*G11_0_0_0 + 0.666666666666665*G11_0_0_1 + 0.666666666666665*G11_0_1_0 + 1.33333333333333*G11_0_1_1 + 1.33333333333333*G13_0_0_0 + 0.666666666666665*G13_0_0_1 + 0.666666666666665*G13_0_1_0 + 1.33333333333333*G13_0_1_1;
+    A[145] = 0.019047619047619*G5_0_0 + 0.0126984126984127*G5_0_1 + 0.0126984126984127*G5_1_0 + 0.00634920634920636*G5_1_1 - 0.019047619047619*G5_2_0 - 0.0253968253968254*G5_2_1 - 0.152380952380952*G5_3_0 - 0.101587301587301*G5_3_1 - 0.0761904761904761*G5_4_0 - 0.0253968253968254*G5_4_1 - 0.0507936507936508*G5_5_0 - 0.00634920634920633*G6_6_0 - 0.00634920634920632*G6_6_1 + 0.00634920634920634*G6_7_0 + 0.0317460317460317*G6_8_1 + 0.0761904761904761*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.0761904761904761*G6_10_0 - 0.0253968253968254*G6_10_1 - 0.0507936507936508*G6_11_1 + 0.019047619047619*G7_6_0 + 0.0126984126984127*G7_6_1 + 0.0126984126984127*G7_7_0 + 0.00634920634920636*G7_7_1 - 0.019047619047619*G7_8_0 - 0.0253968253968254*G7_8_1 - 0.152380952380952*G7_9_0 - 0.101587301587301*G7_9_1 - 0.0761904761904761*G7_10_0 - 0.0253968253968254*G7_10_1 - 0.0507936507936508*G7_11_0 - 1.33333333333333*G11_0_0_0 - 0.666666666666666*G11_0_0_1 - 0.666666666666665*G11_0_1_0 - 1.33333333333333*G13_0_0_0 - 0.666666666666666*G13_0_0_1 - 0.666666666666665*G13_0_1_0;
+    A[146] = 0.0126984126984127*G5_0_0 + 0.019047619047619*G5_0_1 - 0.0253968253968254*G5_1_0 - 0.019047619047619*G5_1_1 + 0.00634920634920634*G5_2_0 + 0.0126984126984127*G5_2_1 - 0.101587301587302*G5_3_0 - 0.152380952380952*G5_3_1 - 0.0507936507936508*G5_4_1 - 0.0253968253968254*G5_5_0 - 0.0761904761904762*G5_5_1 - 0.00634920634920633*G6_6_0 - 0.00634920634920632*G6_6_1 + 0.0317460317460317*G6_7_0 + 0.00634920634920636*G6_8_1 + 0.0507936507936508*G6_9_0 + 0.0761904761904761*G6_9_1 - 0.0507936507936508*G6_10_0 - 0.0253968253968254*G6_11_0 - 0.0761904761904762*G6_11_1 + 0.0126984126984127*G7_6_0 + 0.019047619047619*G7_6_1 - 0.0253968253968254*G7_7_0 - 0.019047619047619*G7_7_1 + 0.00634920634920634*G7_8_0 + 0.0126984126984127*G7_8_1 - 0.101587301587302*G7_9_0 - 0.152380952380952*G7_9_1 - 0.0507936507936508*G7_10_1 - 0.0253968253968254*G7_11_0 - 0.0761904761904762*G7_11_1 - 0.666666666666665*G11_0_0_1 - 0.666666666666667*G11_0_1_0 - 1.33333333333333*G11_0_1_1 - 0.666666666666665*G13_0_0_1 - 0.666666666666667*G13_0_1_0 - 1.33333333333333*G13_0_1_1;
+    A[147] = -0.166666666666667*G15_0 - 0.166666666666667*G15_1;
+    A[148] = -0.166666666666667*G15_0 - 0.333333333333333*G15_1;
+    A[149] = -0.333333333333333*G15_0 - 0.166666666666666*G15_1;
+    A[150] = -0.0190476190476191*G4_6_0 - 0.0190476190476191*G4_6_1 - 0.00634920634920636*G4_7_0 - 0.0126984126984127*G4_8_1 - 0.0126984126984127*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.0126984126984127*G4_10_0 + 0.0317460317460318*G4_10_1 + 0.0253968253968254*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[151] = 0.00793650793650793*G4_6_0 + 0.00793650793650793*G4_6_1 + 0.00476190476190476*G4_7_0 - 0.00793650793650794*G4_8_1 - 0.019047619047619*G4_9_0 - 0.00634920634920634*G4_9_1 + 0.019047619047619*G4_10_0 - 0.0126984126984127*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[152] = 0.0126984126984127*G4_6_0 + 0.0126984126984127*G4_6_1 - 0.00634920634920635*G4_7_0 + 0.019047619047619*G4_8_1 + 0.019047619047619*G4_9_0 - 0.00634920634920634*G4_9_1 - 0.019047619047619*G4_10_0 - 0.0317460317460317*G4_10_1 - 0.00634920634920635*G4_11_0 + 0.00634920634920634*G4_11_1;
+    A[153] = -0.00634920634920633*G4_6_0 - 0.00634920634920632*G4_6_1 + 0.00634920634920634*G4_7_0 + 0.0317460317460317*G4_8_1 + 0.0761904761904761*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.0761904761904761*G4_10_0 - 0.0253968253968254*G4_10_1 - 0.0507936507936508*G4_11_1;
+    A[154] = -0.0634920634920635*G4_6_0 - 0.0634920634920635*G4_6_1 - 0.0380952380952381*G4_7_0 + 0.0634920634920635*G4_8_1 + 0.152380952380952*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.152380952380952*G4_10_0 + 0.101587301587302*G4_11_0 - 0.0507936507936507*G4_11_1;
+    A[155] = -0.0317460317460317*G4_6_0 - 0.0317460317460317*G4_6_1 + 0.00634920634920634*G4_7_0 + 0.00634920634920636*G4_8_1 + 0.0507936507936508*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.0507936507936508*G4_10_0 + 0.0253968253968254*G4_10_1 + 0.0253968253968254*G4_11_0 - 0.0507936507936508*G4_11_1;
+    A[156] = -0.0190476190476191*G5_0_0 - 0.0190476190476191*G5_0_1 + 0.00793650793650793*G5_1_0 + 0.00793650793650793*G5_1_1 + 0.0126984126984127*G5_2_0 + 0.0126984126984127*G5_2_1 - 0.00634920634920633*G5_3_0 - 0.00634920634920632*G5_3_1 - 0.0634920634920635*G5_4_0 - 0.0634920634920635*G5_4_1 - 0.0317460317460317*G5_5_0 - 0.0317460317460317*G5_5_1 - 0.0190476190476191*G6_6_0 - 0.0190476190476191*G6_6_1 - 0.00634920634920636*G6_7_0 - 0.0126984126984127*G6_8_1 - 0.0126984126984127*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.0126984126984127*G6_10_0 + 0.0317460317460318*G6_10_1 + 0.0253968253968254*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.0190476190476191*G7_6_0 - 0.0190476190476191*G7_6_1 + 0.00793650793650793*G7_7_0 + 0.00793650793650793*G7_7_1 + 0.0126984126984127*G7_8_0 + 0.0126984126984127*G7_8_1 - 0.00634920634920633*G7_9_0 - 0.00634920634920632*G7_9_1 - 0.0634920634920635*G7_10_0 - 0.0634920634920635*G7_10_1 - 0.0317460317460317*G7_11_0 - 0.0317460317460317*G7_11_1 - 0.666666666666667*G11_0_1_0 - 0.666666666666666*G11_0_1_1 - 0.666666666666667*G13_0_1_0 - 0.666666666666666*G13_0_1_1;
+    A[157] = -0.00634920634920636*G5_0_0 + 0.00476190476190476*G5_1_0 - 0.00634920634920635*G5_2_0 + 0.00634920634920634*G5_3_0 - 0.0380952380952381*G5_4_0 + 0.00634920634920634*G5_5_0 + 0.00793650793650793*G6_6_0 + 0.00793650793650793*G6_6_1 + 0.00476190476190476*G6_7_0 - 0.00793650793650794*G6_8_1 - 0.019047619047619*G6_9_0 - 0.00634920634920634*G6_9_1 + 0.019047619047619*G6_10_0 - 0.0126984126984127*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.00634920634920636*G7_6_0 + 0.00476190476190476*G7_7_0 - 0.00634920634920635*G7_8_0 + 0.00634920634920634*G7_9_0 - 0.0380952380952381*G7_10_0 + 0.00634920634920634*G7_11_0;
+    A[158] = -0.0126984126984127*G5_0_1 - 0.00793650793650794*G5_1_1 + 0.019047619047619*G5_2_1 + 0.0317460317460317*G5_3_1 + 0.0634920634920635*G5_4_1 + 0.00634920634920636*G5_5_1 + 0.0126984126984127*G6_6_0 + 0.0126984126984127*G6_6_1 - 0.00634920634920635*G6_7_0 + 0.019047619047619*G6_8_1 + 0.019047619047619*G6_9_0 - 0.00634920634920634*G6_9_1 - 0.019047619047619*G6_10_0 - 0.0317460317460317*G6_10_1 - 0.00634920634920635*G6_11_0 + 0.00634920634920634*G6_11_1 - 0.0126984126984127*G7_6_1 - 0.00793650793650794*G7_7_1 + 0.019047619047619*G7_8_1 + 0.0317460317460317*G7_9_1 + 0.0634920634920635*G7_10_1 + 0.00634920634920636*G7_11_1 - 0.666666666666666*G11_0_0_1 - 0.666666666666666*G11_0_1_1 - 0.666666666666666*G13_0_0_1 - 0.666666666666666*G13_0_1_1;
+    A[159] = -0.0126984126984127*G5_0_0 - 0.00634920634920634*G5_0_1 - 0.019047619047619*G5_1_0 - 0.00634920634920634*G5_1_1 + 0.019047619047619*G5_2_0 - 0.00634920634920634*G5_2_1 + 0.0761904761904761*G5_3_0 + 0.0507936507936507*G5_3_1 + 0.152380952380952*G5_4_0 + 0.0507936507936507*G5_4_1 + 0.0507936507936508*G5_5_0 + 0.0507936507936507*G5_5_1 - 0.00634920634920633*G6_6_0 - 0.00634920634920632*G6_6_1 + 0.00634920634920634*G6_7_0 + 0.0317460317460317*G6_8_1 + 0.0761904761904761*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.0761904761904761*G6_10_0 - 0.0253968253968254*G6_10_1 - 0.0507936507936508*G6_11_1 - 0.0126984126984127*G7_6_0 - 0.00634920634920634*G7_6_1 - 0.019047619047619*G7_7_0 - 0.00634920634920634*G7_7_1 + 0.019047619047619*G7_8_0 - 0.00634920634920634*G7_8_1 + 0.0761904761904761*G7_9_0 + 0.0507936507936507*G7_9_1 + 0.152380952380952*G7_10_0 + 0.0507936507936507*G7_10_1 + 0.0507936507936508*G7_11_0 + 0.0507936507936507*G7_11_1 - 1.33333333333333*G11_0_0_0 - 0.666666666666665*G11_0_0_1 - 0.666666666666666*G11_0_1_0 - 1.33333333333333*G13_0_0_0 - 0.666666666666665*G13_0_0_1 - 0.666666666666666*G13_0_1_0;
+    A[160] = 0.0126984126984127*G5_0_0 + 0.0317460317460318*G5_0_1 + 0.019047619047619*G5_1_0 - 0.019047619047619*G5_2_0 - 0.0317460317460317*G5_2_1 - 0.0761904761904761*G5_3_0 - 0.0253968253968254*G5_3_1 - 0.152380952380952*G5_4_0 - 0.0507936507936508*G5_5_0 + 0.0253968253968254*G5_5_1 - 0.0634920634920635*G6_6_0 - 0.0634920634920635*G6_6_1 - 0.0380952380952381*G6_7_0 + 0.0634920634920635*G6_8_1 + 0.152380952380952*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.152380952380952*G6_10_0 + 0.101587301587302*G6_11_0 - 0.0507936507936507*G6_11_1 + 0.0126984126984127*G7_6_0 + 0.0317460317460318*G7_6_1 + 0.019047619047619*G7_7_0 - 0.019047619047619*G7_8_0 - 0.0317460317460317*G7_8_1 - 0.0761904761904761*G7_9_0 - 0.0253968253968254*G7_9_1 - 0.152380952380952*G7_10_0 - 0.0507936507936508*G7_11_0 + 0.0253968253968254*G7_11_1 + 1.33333333333333*G11_0_0_0 + 0.666666666666666*G11_0_0_1 + 0.666666666666666*G11_0_1_0 + 1.33333333333333*G11_0_1_1 + 1.33333333333333*G13_0_0_0 + 0.666666666666666*G13_0_0_1 + 0.666666666666666*G13_0_1_0 + 1.33333333333333*G13_0_1_1;
+    A[161] = 0.0253968253968254*G5_0_0 + 0.00634920634920634*G5_0_1 - 0.0126984126984127*G5_1_0 + 0.00634920634920634*G5_1_1 - 0.00634920634920635*G5_2_0 + 0.00634920634920634*G5_2_1 - 0.0507936507936508*G5_3_1 + 0.101587301587302*G5_4_0 - 0.0507936507936507*G5_4_1 + 0.0253968253968254*G5_5_0 - 0.0507936507936508*G5_5_1 - 0.0317460317460317*G6_6_0 - 0.0317460317460317*G6_6_1 + 0.00634920634920634*G6_7_0 + 0.00634920634920636*G6_8_1 + 0.0507936507936508*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.0507936507936508*G6_10_0 + 0.0253968253968254*G6_10_1 + 0.0253968253968254*G6_11_0 - 0.0507936507936508*G6_11_1 + 0.0253968253968254*G7_6_0 + 0.00634920634920634*G7_6_1 - 0.0126984126984127*G7_7_0 + 0.00634920634920634*G7_7_1 - 0.00634920634920635*G7_8_0 + 0.00634920634920634*G7_8_1 - 0.0507936507936508*G7_9_1 + 0.101587301587302*G7_10_0 - 0.0507936507936507*G7_10_1 + 0.0253968253968254*G7_11_0 - 0.0507936507936508*G7_11_1 + 0.666666666666665*G11_0_0_1 + 0.666666666666667*G11_0_1_0 + 0.666666666666665*G13_0_0_1 + 0.666666666666667*G13_0_1_0;
+    A[162] = 0.166666666666667*G15_0 - 0.166666666666667*G15_1;
+    A[163] = 0.166666666666667*G15_0;
+    A[164] = 0.333333333333333*G15_0 + 0.166666666666667*G15_1;
+    A[165] = -0.0190476190476191*G4_6_0 - 0.0190476190476191*G4_6_1 - 0.0126984126984127*G4_7_0 - 0.00634920634920635*G4_8_1 - 0.00634920634920635*G4_9_0 - 0.0126984126984127*G4_9_1 + 0.00634920634920635*G4_10_0 + 0.0253968253968254*G4_10_1 + 0.0317460317460318*G4_11_0 + 0.0126984126984127*G4_11_1;
+    A[166] = 0.0126984126984127*G4_6_0 + 0.0126984126984127*G4_6_1 + 0.019047619047619*G4_7_0 - 0.00634920634920636*G4_8_1 - 0.00634920634920635*G4_9_0 + 0.019047619047619*G4_9_1 + 0.00634920634920635*G4_10_0 - 0.00634920634920633*G4_10_1 - 0.0317460317460317*G4_11_0 - 0.0190476190476191*G4_11_1;
+    A[167] = 0.00793650793650793*G4_6_0 + 0.00793650793650793*G4_6_1 - 0.00793650793650793*G4_7_0 + 0.00476190476190476*G4_8_1 - 0.00634920634920633*G4_9_0 - 0.019047619047619*G4_9_1 + 0.00634920634920633*G4_10_0 - 0.0126984126984127*G4_10_1 + 0.019047619047619*G4_11_1;
+    A[168] = -0.00634920634920633*G4_6_0 - 0.00634920634920632*G4_6_1 + 0.0317460317460317*G4_7_0 + 0.00634920634920636*G4_8_1 + 0.0507936507936508*G4_9_0 + 0.0761904761904761*G4_9_1 - 0.0507936507936508*G4_10_0 - 0.0253968253968254*G4_11_0 - 0.0761904761904762*G4_11_1;
+    A[169] = -0.0317460317460317*G4_6_0 - 0.0317460317460317*G4_6_1 + 0.00634920634920634*G4_7_0 + 0.00634920634920636*G4_8_1 + 0.0507936507936507*G4_9_0 + 0.0507936507936507*G4_9_1 - 0.0507936507936507*G4_10_0 + 0.0253968253968254*G4_10_1 + 0.0253968253968254*G4_11_0 - 0.0507936507936508*G4_11_1;
+    A[170] = -0.0634920634920635*G4_6_0 - 0.0634920634920635*G4_6_1 + 0.0634920634920635*G4_7_0 - 0.0380952380952381*G4_8_1 + 0.0507936507936507*G4_9_0 + 0.152380952380952*G4_9_1 - 0.0507936507936507*G4_10_0 + 0.101587301587302*G4_10_1 - 0.152380952380952*G4_11_1;
+    A[171] = -0.0190476190476191*G5_0_0 - 0.0190476190476191*G5_0_1 + 0.0126984126984127*G5_1_0 + 0.0126984126984127*G5_1_1 + 0.00793650793650793*G5_2_0 + 0.00793650793650793*G5_2_1 - 0.00634920634920633*G5_3_0 - 0.00634920634920632*G5_3_1 - 0.0317460317460317*G5_4_0 - 0.0317460317460317*G5_4_1 - 0.0634920634920635*G5_5_0 - 0.0634920634920635*G5_5_1 - 0.0190476190476191*G6_6_0 - 0.0190476190476191*G6_6_1 - 0.0126984126984127*G6_7_0 - 0.00634920634920635*G6_8_1 - 0.00634920634920635*G6_9_0 - 0.0126984126984127*G6_9_1 + 0.00634920634920635*G6_10_0 + 0.0253968253968254*G6_10_1 + 0.0317460317460318*G6_11_0 + 0.0126984126984127*G6_11_1 - 0.0190476190476191*G7_6_0 - 0.0190476190476191*G7_6_1 + 0.0126984126984127*G7_7_0 + 0.0126984126984127*G7_7_1 + 0.00793650793650793*G7_8_0 + 0.00793650793650793*G7_8_1 - 0.00634920634920633*G7_9_0 - 0.00634920634920632*G7_9_1 - 0.0317460317460317*G7_10_0 - 0.0317460317460317*G7_10_1 - 0.0634920634920635*G7_11_0 - 0.0634920634920635*G7_11_1 - 0.666666666666667*G11_0_0_0 - 0.666666666666667*G11_0_0_1 - 0.666666666666667*G13_0_0_0 - 0.666666666666667*G13_0_0_1;
+    A[172] = -0.0126984126984127*G5_0_0 + 0.019047619047619*G5_1_0 - 0.00793650793650793*G5_2_0 + 0.0317460317460317*G5_3_0 + 0.00634920634920634*G5_4_0 + 0.0634920634920635*G5_5_0 + 0.0126984126984127*G6_6_0 + 0.0126984126984127*G6_6_1 + 0.019047619047619*G6_7_0 - 0.00634920634920636*G6_8_1 - 0.00634920634920635*G6_9_0 + 0.019047619047619*G6_9_1 + 0.00634920634920635*G6_10_0 - 0.00634920634920633*G6_10_1 - 0.0317460317460317*G6_11_0 - 0.0190476190476191*G6_11_1 - 0.0126984126984127*G7_6_0 + 0.019047619047619*G7_7_0 - 0.00793650793650793*G7_8_0 + 0.0317460317460317*G7_9_0 + 0.00634920634920634*G7_10_0 + 0.0634920634920635*G7_11_0 - 0.666666666666667*G11_0_0_0 - 0.666666666666667*G11_0_1_0 - 0.666666666666667*G13_0_0_0 - 0.666666666666667*G13_0_1_0;
+    A[173] = -0.00634920634920635*G5_0_1 - 0.00634920634920636*G5_1_1 + 0.00476190476190476*G5_2_1 + 0.00634920634920636*G5_3_1 + 0.00634920634920636*G5_4_1 - 0.0380952380952381*G5_5_1 + 0.00793650793650793*G6_6_0 + 0.00793650793650793*G6_6_1 - 0.00793650793650793*G6_7_0 + 0.00476190476190476*G6_8_1 - 0.00634920634920633*G6_9_0 - 0.019047619047619*G6_9_1 + 0.00634920634920633*G6_10_0 - 0.0126984126984127*G6_10_1 + 0.019047619047619*G6_11_1 - 0.00634920634920635*G7_6_1 - 0.00634920634920636*G7_7_1 + 0.00476190476190476*G7_8_1 + 0.00634920634920636*G7_9_1 + 0.00634920634920636*G7_10_1 - 0.0380952380952381*G7_11_1;
+    A[174] = -0.00634920634920635*G5_0_0 - 0.0126984126984127*G5_0_1 - 0.00634920634920635*G5_1_0 + 0.019047619047619*G5_1_1 - 0.00634920634920633*G5_2_0 - 0.019047619047619*G5_2_1 + 0.0507936507936508*G5_3_0 + 0.0761904761904761*G5_3_1 + 0.0507936507936507*G5_4_0 + 0.0507936507936507*G5_4_1 + 0.0507936507936507*G5_5_0 + 0.152380952380952*G5_5_1 - 0.00634920634920633*G6_6_0 - 0.00634920634920632*G6_6_1 + 0.0317460317460317*G6_7_0 + 0.00634920634920636*G6_8_1 + 0.0507936507936508*G6_9_0 + 0.0761904761904761*G6_9_1 - 0.0507936507936508*G6_10_0 - 0.0253968253968254*G6_11_0 - 0.0761904761904762*G6_11_1 - 0.00634920634920635*G7_6_0 - 0.0126984126984127*G7_6_1 - 0.00634920634920635*G7_7_0 + 0.019047619047619*G7_7_1 - 0.00634920634920633*G7_8_0 - 0.019047619047619*G7_8_1 + 0.0507936507936508*G7_9_0 + 0.0761904761904761*G7_9_1 + 0.0507936507936507*G7_10_0 + 0.0507936507936507*G7_10_1 + 0.0507936507936507*G7_11_0 + 0.152380952380952*G7_11_1 - 0.666666666666667*G11_0_0_1 - 0.666666666666666*G11_0_1_0 - 1.33333333333333*G11_0_1_1 - 0.666666666666667*G13_0_0_1 - 0.666666666666666*G13_0_1_0 - 1.33333333333333*G13_0_1_1;
+    A[175] = 0.00634920634920635*G5_0_0 + 0.0253968253968254*G5_0_1 + 0.00634920634920635*G5_1_0 - 0.00634920634920633*G5_1_1 + 0.00634920634920633*G5_2_0 - 0.0126984126984127*G5_2_1 - 0.0507936507936508*G5_3_0 - 0.0507936507936507*G5_4_0 + 0.0253968253968254*G5_4_1 - 0.0507936507936507*G5_5_0 + 0.101587301587302*G5_5_1 - 0.0317460317460317*G6_6_0 - 0.0317460317460317*G6_6_1 + 0.00634920634920634*G6_7_0 + 0.00634920634920636*G6_8_1 + 0.0507936507936507*G6_9_0 + 0.0507936507936507*G6_9_1 - 0.0507936507936507*G6_10_0 + 0.0253968253968254*G6_10_1 + 0.0253968253968254*G6_11_0 - 0.0507936507936508*G6_11_1 + 0.00634920634920635*G7_6_0 + 0.0253968253968254*G7_6_1 + 0.00634920634920635*G7_7_0 - 0.00634920634920633*G7_7_1 + 0.00634920634920633*G7_8_0 - 0.0126984126984127*G7_8_1 - 0.0507936507936508*G7_9_0 - 0.0507936507936507*G7_10_0 + 0.0253968253968254*G7_10_1 - 0.0507936507936507*G7_11_0 + 0.101587301587302*G7_11_1 + 0.666666666666667*G11_0_0_1 + 0.666666666666666*G11_0_1_0 + 0.666666666666667*G13_0_0_1 + 0.666666666666666*G13_0_1_0;
+    A[176] = 0.0317460317460318*G5_0_0 + 0.0126984126984127*G5_0_1 - 0.0317460317460317*G5_1_0 - 0.0190476190476191*G5_1_1 + 0.019047619047619*G5_2_1 - 0.0253968253968254*G5_3_0 - 0.0761904761904762*G5_3_1 + 0.0253968253968254*G5_4_0 - 0.0507936507936508*G5_4_1 - 0.152380952380952*G5_5_1 - 0.0634920634920635*G6_6_0 - 0.0634920634920635*G6_6_1 + 0.0634920634920635*G6_7_0 - 0.0380952380952381*G6_8_1 + 0.0507936507936507*G6_9_0 + 0.152380952380952*G6_9_1 - 0.0507936507936507*G6_10_0 + 0.101587301587302*G6_10_1 - 0.152380952380952*G6_11_1 + 0.0317460317460318*G7_6_0 + 0.0126984126984127*G7_6_1 - 0.0317460317460317*G7_7_0 - 0.0190476190476191*G7_7_1 + 0.019047619047619*G7_8_1 - 0.0253968253968254*G7_9_0 - 0.0761904761904762*G7_9_1 + 0.0253968253968254*G7_10_0 - 0.0507936507936508*G7_10_1 - 0.152380952380952*G7_11_1 + 1.33333333333333*G11_0_0_0 + 0.666666666666667*G11_0_0_1 + 0.666666666666667*G11_0_1_0 + 1.33333333333333*G11_0_1_1 + 1.33333333333333*G13_0_0_0 + 0.666666666666667*G13_0_0_1 + 0.666666666666667*G13_0_1_0 + 1.33333333333333*G13_0_1_1;
+    A[177] = -0.166666666666667*G15_0 + 0.166666666666667*G15_1;
+    A[178] = 0.166666666666667*G15_0 + 0.333333333333333*G15_1;
+    A[179] = 0.166666666666667*G15_1;
+    A[180] = -0.166666666666667*G8_0 - 0.166666666666667*G8_1;
+    A[181] = 0.0;
+    A[182] = 0.0;
+    A[183] = 0.166666666666667*G8_0 + 0.166666666666667*G8_1;
+    A[184] = -0.166666666666667*G8_0 + 0.166666666666667*G8_1;
+    A[185] = 0.166666666666667*G8_0 - 0.166666666666667*G8_1;
+    A[186] = -0.166666666666667*G9_0 - 0.166666666666667*G9_1;
+    A[187] = 0.0;
+    A[188] = 0.0;
+    A[189] = 0.166666666666667*G9_0 + 0.166666666666667*G9_1;
+    A[190] = -0.166666666666667*G9_0 + 0.166666666666667*G9_1;
+    A[191] = 0.166666666666667*G9_0 - 0.166666666666667*G9_1;
+    A[192] = 0.0;
+    A[193] = 0.0;
+    A[194] = 0.0;
+    A[195] = 0.0;
+    A[196] = 0.166666666666667*G8_0;
+    A[197] = 0.0;
+    A[198] = 0.166666666666667*G8_0 + 0.333333333333333*G8_1;
+    A[199] = -0.166666666666667*G8_0;
+    A[200] = -0.166666666666667*G8_0 - 0.333333333333333*G8_1;
+    A[201] = 0.0;
+    A[202] = 0.166666666666667*G9_0;
+    A[203] = 0.0;
+    A[204] = 0.166666666666667*G9_0 + 0.333333333333333*G9_1;
+    A[205] = -0.166666666666667*G9_0;
+    A[206] = -0.166666666666667*G9_0 - 0.333333333333333*G9_1;
+    A[207] = 0.0;
+    A[208] = 0.0;
+    A[209] = 0.0;
+    A[210] = 0.0;
+    A[211] = 0.0;
+    A[212] = 0.166666666666667*G8_1;
+    A[213] = 0.333333333333333*G8_0 + 0.166666666666666*G8_1;
+    A[214] = -0.333333333333333*G8_0 - 0.166666666666667*G8_1;
+    A[215] = -0.166666666666667*G8_1;
+    A[216] = 0.0;
+    A[217] = 0.0;
+    A[218] = 0.166666666666667*G9_1;
+    A[219] = 0.333333333333333*G9_0 + 0.166666666666666*G9_1;
+    A[220] = -0.333333333333333*G9_0 - 0.166666666666667*G9_1;
+    A[221] = -0.166666666666667*G9_1;
+    A[222] = 0.0;
+    A[223] = 0.0;
+    A[224] = 0.0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class adaptivenavierstokes_cell_integral_9_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_cell_integral_9_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_cell_integral_9_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W7[7] = {0.1125, 0.0629695902724136, 0.0629695902724136, 0.0629695902724136, 0.0661970763942531, 0.0661970763942531, 0.0661970763942531};
+    // Quadrature points on the UFC reference element: (0.333333333333333, 0.333333333333333), (0.797426985353087, 0.101286507323456), (0.101286507323456, 0.797426985353087), (0.101286507323456, 0.101286507323456), (0.0597158717897698, 0.470142064105115), (0.470142064105115, 0.0597158717897698), (0.470142064105115, 0.470142064105115)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[7][3] = \
+    {{0.333333333333333, 0.333333333333333, 0.333333333333333},
+    {0.101286507323456, 0.797426985353087, 0.101286507323456},
+    {0.101286507323457, 0.101286507323456, 0.797426985353087},
+    {0.797426985353087, 0.101286507323456, 0.101286507323456},
+    {0.470142064105115, 0.0597158717897698, 0.470142064105115},
+    {0.470142064105115, 0.470142064105115, 0.0597158717897697},
+    {0.0597158717897699, 0.470142064105115, 0.470142064105115}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[3] = {12, 13, 14};
+    
+    static const double FE1_C0[7][6] = \
+    {{-0.111111111111111, -0.111111111111111, -0.111111111111111, 0.444444444444444, 0.444444444444444, 0.444444444444444},
+    {-0.0807685941918872, 0.474352608585538, -0.0807685941918871, 0.323074376767549, 0.0410358262631383, 0.323074376767549},
+    {-0.0807685941918872, -0.0807685941918872, 0.474352608585538, 0.323074376767549, 0.323074376767549, 0.0410358262631383},
+    {0.474352608585539, -0.0807685941918871, -0.0807685941918871, 0.0410358262631383, 0.323074376767549, 0.323074376767549},
+    {-0.0280749432230786, -0.0525839011025453, -0.0280749432230788, 0.112299772892315, 0.884134241764073, 0.112299772892315},
+    {-0.0280749432230787, -0.0280749432230788, -0.0525839011025453, 0.112299772892315, 0.112299772892315, 0.884134241764073},
+    {-0.0525839011025454, -0.0280749432230789, -0.0280749432230788, 0.884134241764072, 0.112299772892315, 0.112299772892315}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[6] = {0, 1, 2, 3, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[6] = {6, 7, 8, 9, 10, 11};
+    
+    static const double FE1_C0_D01[7][5] = \
+    {{-0.333333333333333, 0.333333333333333, 1.33333333333333, 0.0, -1.33333333333333},
+    {0.594853970706175, -0.594853970706175, 3.18970794141235, 0.0, -3.18970794141235},
+    {0.594853970706174, 2.18970794141235, 0.405146029293824, -2.78456191211852, -0.405146029293825},
+    {-2.18970794141235, -0.594853970706175, 0.405146029293824, 2.78456191211852, -0.405146029293825},
+    {-0.880568256420461, 0.88056825642046, 0.238863487159078, 0.0, -0.238863487159078},
+    {-0.88056825642046, -0.76113651284092, 1.88056825642046, 1.64170476926138, -1.88056825642046},
+    {0.761136512840921, 0.88056825642046, 1.88056825642046, -1.64170476926138, -1.88056825642046}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[5] = {6, 8, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE1_C0_D10[7][5] = \
+    {{-0.333333333333333, 0.333333333333333, 1.33333333333333, -1.33333333333333, 0.0},
+    {0.594853970706174, 2.18970794141235, 0.405146029293824, -0.405146029293824, -2.78456191211852},
+    {0.594853970706175, -0.594853970706175, 3.18970794141235, -3.18970794141235, 0.0},
+    {-2.18970794141235, -0.594853970706175, 0.405146029293824, -0.405146029293824, 2.78456191211852},
+    {-0.880568256420461, -0.761136512840922, 1.88056825642046, -1.88056825642046, 1.64170476926138},
+    {-0.88056825642046, 0.880568256420461, 0.238863487159078, -0.238863487159078, 0.0},
+    {0.761136512840921, 0.88056825642046, 1.88056825642046, -1.88056825642046, -1.64170476926138}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[5] = {6, 7, 9, 10, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc8[5] = {0, 1, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 23.
+    double G[11];
+    G[0] = K[0]*det;
+    G[1] = K[2]*det;
+    G[2] = K[1]*det;
+    G[3] = K[3]*det;
+    G[4] = det*w[2][0]*(K[0]*K[2] + K[1]*K[3]);
+    G[5] = det*w[2][0]*(K[2]*K[2] + K[3]*K[3]);
+    G[6] =  - K[3]*det;
+    G[7] = det*w[2][0]*(K[0]*K[0] + K[1]*K[1]);
+    G[8] =  - K[1]*det;
+    G[9] =  - K[2]*det;
+    G[10] =  - K[0]*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 1344
+    for (unsigned int ip = 0; ip < 7; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      
+      // Total number of operations to compute function values = 6
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F6 += FE0_C0[ip][r]*w[0][nzc12[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 40
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F0 += FE1_C0_D10[ip][r]*w[0][nzc8[r]];
+        F1 += FE1_C0_D01[ip][r]*w[0][nzc7[r]];
+        F4 += FE1_C0_D10[ip][r]*w[0][nzc11[r]];
+        F5 += FE1_C0_D01[ip][r]*w[0][nzc10[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 24
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F2 += FE1_C0[ip][r]*w[0][nzc6[r]];
+        F3 += FE1_C0[ip][r]*w[0][nzc9[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 52
+      double I[7];
+      // Number of operations: 8
+      I[0] = W7[ip]*(F0*G[0] + F1*G[1] + F4*G[2] + F5*G[3]);
+      
+      // Number of operations: 6
+      I[1] = W7[ip]*(F4*G[4] + F5*G[5] + F6*G[6]);
+      
+      // Number of operations: 6
+      I[2] = W7[ip]*(F4*G[7] + F5*G[4] + F6*G[8]);
+      
+      // Number of operations: 6
+      I[3] = W7[ip]*(F0*G[4] + F1*G[5] + F6*G[9]);
+      
+      // Number of operations: 6
+      I[4] = W7[ip]*(F0*G[7] + F1*G[4] + F6*G[10]);
+      
+      // Number of operations: 10
+      I[5] = W7[ip]*(F2*(F0*G[0] + F1*G[1]) + F3*(F0*G[2] + F1*G[3]));
+      
+      // Number of operations: 10
+      I[6] = W7[ip]*(F4*(F2*G[0] + F3*G[2]) + F5*(F2*G[1] + F3*G[3]));
+      
+      
+      // Number of operations for primary indices: 6
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc12[j]] += FE0_C0[ip][j]*I[0];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 40
+      for (unsigned int j = 0; j < 5; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc10[j]] += FE1_C0_D01[ip][j]*I[1];
+        // Number of operations to compute entry: 2
+        A[nzc11[j]] += FE1_C0_D10[ip][j]*I[2];
+        // Number of operations to compute entry: 2
+        A[nzc7[j]] += FE1_C0_D01[ip][j]*I[3];
+        // Number of operations to compute entry: 2
+        A[nzc8[j]] += FE1_C0_D10[ip][j]*I[4];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 24
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc6[j]] += FE1_C0[ip][j]*I[5];
+        // Number of operations to compute entry: 2
+        A[nzc9[j]] += FE1_C0[ip][j]*I[6];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivenavierstokes_exterior_facet_integral_9_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_exterior_facet_integral_9_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_exterior_facet_integral_9_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates[2*facet] - vertex_coordinates[2*v0]) - dx0*(vertex_coordinates[2*facet + 1] - vertex_coordinates[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n0 = direction ? dx1 / det : -dx1 / det;
+    const double n1 = direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W2[2] = {0.5, 0.5};
+    // Quadrature points on the UFC reference element: (0.211324865405187), (0.788675134594813)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[2][2] = \
+    {{0.788675134594813, 0.211324865405187},
+    {0.211324865405187, 0.788675134594813}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    static const double FE2_f0_C0[2][3] = \
+    {{0.455341801261479, -0.122008467928146, 0.666666666666667},
+    {-0.122008467928146, 0.45534180126148, 0.666666666666667}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[3] = {7, 8, 9};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[3] = {1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc20[3] = {6, 7, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[3] = {0, 1, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[3] = {0, 2, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[3] = {6, 8, 10};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 2.
+    double G[2];
+    G[0] = det*n0;
+    G[1] = det*n1;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 40
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 40
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc0[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 4
+        double I[2];
+        // Number of operations: 2
+        I[0] = F0*G[0]*W2[ip];
+        
+        // Number of operations: 2
+        I[1] = F0*G[1]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc13[j]] += FE2_f0_C0[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc14[j]] += FE2_f0_C0[ip][j]*I[1];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 40
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 40
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc1[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 4
+        double I[2];
+        // Number of operations: 2
+        I[0] = F0*G[0]*W2[ip];
+        
+        // Number of operations: 2
+        I[1] = F0*G[1]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc16[j]] += FE2_f0_C0[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc17[j]] += FE2_f0_C0[ip][j]*I[1];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 40
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 40
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc2[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 4
+        double I[2];
+        // Number of operations: 2
+        I[0] = F0*G[0]*W2[ip];
+        
+        // Number of operations: 2
+        I[1] = F0*G[1]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc19[j]] += FE2_f0_C0[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc20[j]] += FE2_f0_C0[ip][j]*I[1];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class adaptivenavierstokes_exterior_facet_integral_10_0: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_exterior_facet_integral_10_0() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_exterior_facet_integral_10_0()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    6
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  23
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.166666666666666*G0_1 + 0.166666666666667*G0_2 + 0.666666666666666*G0_3;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.166666666666667*G0_0 + 0.166666666666667*G0_2 + 0.666666666666666*G0_4;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.166666666666667*G0_0 + 0.166666666666667*G0_1 + 0.666666666666666*G0_5;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "9f5ea297aed9baffd42b79c1d8849fe669858c13bb7688bb64ab5d6276df3d376d21a30e549f6e3ff1dcee3e057a8a9f4a400e31b3b2349de314701d8bd487a2";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_finite_element_10();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_dofmap_10();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivenavierstokes_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "1431fcd6d97da8fa48e6d1b82b62bffd65cb3efb7c993210e1961321fdbaec3f19d6505e6aa532ef963cb1f61cb7f9c7af8be5ed0b38250407f04d21b637b244";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 1;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_exterior_facet_integral_1_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_2: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_2() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "b85c0cd3595332dedb933bc3a10d8c51f24c9a502be803da9b661b53ce182b4ed337835a855cdd96a4c198bb1871343c720d6f8762f9835e26419ccbb66040f0";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 0;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 4;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_12();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_10();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_finite_element_9();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_12();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_10();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_dofmap_9();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivenavierstokes_cell_integral_2_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivenavierstokes_exterior_facet_integral_2_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_3: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_3() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "aac28481fc513a486483e1edec2768df3b10e571489785af2eb4374b51fc4dd911c25295b817561847127611069424e841d8eaaa499c7cd70bac4e4df7f9af61";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivenavierstokes_cell_integral_3_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_4: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_4() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_4()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "09b5760361d6e81604b048c19450be4febce6f205189587e6c46d0d41a48d12a76843dcd24bdd24515046fb2ae0f14c19ce79b774a20fac561c46c387ff1097c";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 4;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_12();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_finite_element_10();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivenavierstokes_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_12();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_dofmap_10();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivenavierstokes_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivenavierstokes_cell_integral_4_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivenavierstokes_exterior_facet_integral_4_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_5: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_5() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_5()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "0b649f0c08ed5629a1c24b96fd215ca1af83c2d38e52ae56808fc93671084c436235faa70e9f043f6e8bdff81d1227434c5508d6b8d8ab2f9553bdd946d4e1e9";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivenavierstokes_exterior_facet_integral_5_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return new adaptivenavierstokes_interior_facet_integral_5_otherwise();
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_6: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_6() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_6()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "6ab8db5005c4db9d874fc1203ac685516beab14929e0f5712afea0bcb8077e4f8d897bb973d3171bca0f367e9da6c7c42f272efe952184a8b3172867e858dc7e";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 5;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_12();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_finite_element_10();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 5:
+      {
+        return new adaptivenavierstokes_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_12();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_dofmap_10();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 5:
+      {
+        return new adaptivenavierstokes_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivenavierstokes_cell_integral_6_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivenavierstokes_exterior_facet_integral_6_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_7: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_7() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_7()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "a974673ba1ca23c88472c67f03256f0d7477aa2f57e702b5712aa38763c91a1be9515bda1a7b5e16c7d67ffdbc9c9b097965a8038b1702965e1600dca61101e7";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 4;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_9();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_finite_element_5();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_9();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_dofmap_5();
+        break;
+      }
+    case 4:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivenavierstokes_cell_integral_7_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivenavierstokes_exterior_facet_integral_7_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return new adaptivenavierstokes_interior_facet_integral_7_otherwise();
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_8: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_8() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_8()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "0c555154fd68b8d2e96486b0f764aa1fcaa806229d0c798f5e08c4e4ea228bec7df9ce43a1791cbb91bed4d2a35111efb5f41aaabaadfe13dad7d3235e84c6ae";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_finite_element_10();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_dofmap_10();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivenavierstokes_cell_integral_8_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_9: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_9() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_9()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "9690b1279fec0dfc8ec9a692f1510d4d88e76f1720371bf85f5d40068a0e5abd114b963a02c853170f51c468677b8452c8849a7a9bb4ac431a9f99a95d92d23d";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_finite_element_12();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_finite_element_10();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 1:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    case 2:
+      {
+        return new adaptivenavierstokes_dofmap_12();
+        break;
+      }
+    case 3:
+      {
+        return new adaptivenavierstokes_dofmap_10();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new adaptivenavierstokes_cell_integral_9_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new adaptivenavierstokes_exterior_facet_integral_9_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class adaptivenavierstokes_form_10: public ufc::form
+{
+public:
+
+  /// Constructor
+  adaptivenavierstokes_form_10() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~adaptivenavierstokes_form_10()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "ebf3d448ab8d2ad0c6b1c385a6ff187b82e7c45945fc89e730de8d133f937712c1a67202099b516a4903be27b033cd8bfa7a33704352979527f378d5840d96eb";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 0;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 1;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_finite_element_13();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_dofmap_13();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new adaptivenavierstokes_exterior_facet_integral_10_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace AdaptiveNavierStokes
+{
+
+class CoefficientSpace___cell_bubble: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_bubble(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_bubble(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_bubble(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_bubble(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___cell_bubble(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___cell_bubble(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___cell_bubble()
+  {
+  }
+
+};
+
+class CoefficientSpace___cell_cone: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_cone(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_cone(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_cone(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_cone(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___cell_cone(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___cell_cone(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___cell_cone()
+  {
+  }
+
+};
+
+class CoefficientSpace___cell_residual: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_residual(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_residual(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___cell_residual(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___cell_residual(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___cell_residual(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___cell_residual(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___cell_residual()
+  {
+  }
+
+};
+
+class CoefficientSpace___discrete_dual_solution: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___discrete_dual_solution(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___discrete_dual_solution(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___discrete_dual_solution(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___discrete_dual_solution(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___discrete_dual_solution(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___discrete_dual_solution(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___discrete_dual_solution()
+  {
+  }
+
+};
+
+class CoefficientSpace___facet_residual: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___facet_residual(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___facet_residual(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___facet_residual(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___facet_residual(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___facet_residual(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___facet_residual(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___facet_residual()
+  {
+  }
+
+};
+
+class CoefficientSpace___improved_dual: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___improved_dual(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_9()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_9()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___improved_dual(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_9()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_9()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace___improved_dual(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_9()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_9()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace___improved_dual(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_9()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_9()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace___improved_dual(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_9()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_9()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace___improved_dual(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_9()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_9()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace___improved_dual()
+  {
+  }
+
+};
+
+class CoefficientSpace_nu: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_nu(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_10()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_10()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_10()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_10()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_nu(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_10()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_10()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_10()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_10()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_nu(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_10()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_10()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_nu(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_10()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_10()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_nu()
+  {
+  }
+
+};
+
+class CoefficientSpace_p0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_12()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_12()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_12()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_12()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_12()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_12()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_12()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_12()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_p0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_12()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_12()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_p0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_12()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_12()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_p0()
+  {
+  }
+
+};
+
+class CoefficientSpace_w: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_w(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_w(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_w(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_w(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_w()
+  {
+  }
+
+};
+
+class Form_0_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_0_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_0_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_0_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_0_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_0_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_0_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_0_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_0_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_0_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_0_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_0_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_0_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_0_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_0_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_0_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_w Form_0_FunctionSpace_2;
+
+typedef CoefficientSpace_nu Form_0_FunctionSpace_3;
+
+class Form_0: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_0(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_0());
+  }
+
+  // Constructor
+  Form_0(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& nu):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->w = w;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_0());
+  }
+
+  // Constructor
+  Form_0(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->w = *w;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_0());
+  }
+
+  // Constructor
+  Form_0(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_0());
+  }
+
+  // Constructor
+  Form_0(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& nu):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->w = w;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_0());
+  }
+
+  // Constructor
+  Form_0(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->w = *w;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_0());
+  }
+
+  // Destructor
+  ~Form_0()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+    else if (name == "nu")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    case 1:
+      return "nu";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_0_FunctionSpace_0 TestSpace;
+  typedef Form_0_FunctionSpace_1 TrialSpace;
+  typedef Form_0_FunctionSpace_2 CoefficientSpace_w;
+  typedef Form_0_FunctionSpace_3 CoefficientSpace_nu;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+  dolfin::CoefficientAssigner nu;
+};
+
+class Form_1_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_1_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_1_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_1_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_1_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_1_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_1_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_1_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_1: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_1(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_1());
+  }
+
+  // Constructor
+  Form_1(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_1());
+  }
+
+  // Destructor
+  ~Form_1()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_1_FunctionSpace_0 TestSpace;
+
+  // Coefficients
+};
+
+typedef CoefficientSpace_w Form_2_FunctionSpace_0;
+
+typedef CoefficientSpace_p0 Form_2_FunctionSpace_1;
+
+typedef CoefficientSpace_nu Form_2_FunctionSpace_2;
+
+typedef CoefficientSpace___improved_dual Form_2_FunctionSpace_3;
+
+class Form_2: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_2(const dolfin::Mesh& mesh):
+    dolfin::Form(0, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_2());
+  }
+
+  // Constructor
+  Form_2(const dolfin::Mesh& mesh, const dolfin::GenericFunction& w, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& nu, const dolfin::GenericFunction& __improved_dual):
+    dolfin::Form(0, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->w = w;
+    this->p0 = p0;
+    this->nu = nu;
+    this->__improved_dual = __improved_dual;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_2());
+  }
+
+  // Constructor
+  Form_2(const dolfin::Mesh& mesh, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> nu, std::shared_ptr<const dolfin::GenericFunction> __improved_dual):
+    dolfin::Form(0, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->w = *w;
+    this->p0 = *p0;
+    this->nu = *nu;
+    this->__improved_dual = *__improved_dual;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_2());
+  }
+
+  // Constructor
+  Form_2(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::Form(0, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = mesh;
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_2());
+  }
+
+  // Constructor
+  Form_2(std::shared_ptr<const dolfin::Mesh> mesh, const dolfin::GenericFunction& w, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& nu, const dolfin::GenericFunction& __improved_dual):
+    dolfin::Form(0, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = mesh;
+    this->w = w;
+    this->p0 = p0;
+    this->nu = nu;
+    this->__improved_dual = __improved_dual;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_2());
+  }
+
+  // Constructor
+  Form_2(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> nu, std::shared_ptr<const dolfin::GenericFunction> __improved_dual):
+    dolfin::Form(0, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __improved_dual(*this, 3)
+  {
+    _mesh = mesh;
+    this->w = *w;
+    this->p0 = *p0;
+    this->nu = *nu;
+    this->__improved_dual = *__improved_dual;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_2());
+  }
+
+  // Destructor
+  ~Form_2()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+    else if (name == "p0")
+      return 1;
+    else if (name == "nu")
+      return 2;
+    else if (name == "__improved_dual")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    case 1:
+      return "p0";
+    case 2:
+      return "nu";
+    case 3:
+      return "__improved_dual";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_2_FunctionSpace_0 CoefficientSpace_w;
+  typedef Form_2_FunctionSpace_1 CoefficientSpace_p0;
+  typedef Form_2_FunctionSpace_2 CoefficientSpace_nu;
+  typedef Form_2_FunctionSpace_3 CoefficientSpace___improved_dual;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+  dolfin::CoefficientAssigner p0;
+  dolfin::CoefficientAssigner nu;
+  dolfin::CoefficientAssigner __improved_dual;
+};
+
+class Form_3_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_3_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_3_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_3_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_3_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_3_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_3_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_3_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_3_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_3_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_3_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_3_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_3_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_3_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_3_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_3_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace___cell_bubble Form_3_FunctionSpace_2;
+
+class Form_3: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_3(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_3());
+  }
+
+  // Constructor
+  Form_3(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& __cell_bubble):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->__cell_bubble = __cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_3());
+  }
+
+  // Constructor
+  Form_3(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> __cell_bubble):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->__cell_bubble = *__cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_3());
+  }
+
+  // Constructor
+  Form_3(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_3());
+  }
+
+  // Constructor
+  Form_3(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& __cell_bubble):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->__cell_bubble = __cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_3());
+  }
+
+  // Constructor
+  Form_3(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> __cell_bubble):
+    dolfin::Form(2, 1), __cell_bubble(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->__cell_bubble = *__cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_3());
+  }
+
+  // Destructor
+  ~Form_3()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "__cell_bubble")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "__cell_bubble";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_3_FunctionSpace_0 TestSpace;
+  typedef Form_3_FunctionSpace_1 TrialSpace;
+  typedef Form_3_FunctionSpace_2 CoefficientSpace___cell_bubble;
+
+  // Coefficients
+  dolfin::CoefficientAssigner __cell_bubble;
+};
+
+class Form_4_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_4_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_4_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_4_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_4_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_4_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_4_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_4_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_w Form_4_FunctionSpace_1;
+
+typedef CoefficientSpace_p0 Form_4_FunctionSpace_2;
+
+typedef CoefficientSpace_nu Form_4_FunctionSpace_3;
+
+typedef CoefficientSpace___cell_bubble Form_4_FunctionSpace_4;
+
+class Form_4: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_4(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_4());
+  }
+
+  // Constructor
+  Form_4(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& nu, const dolfin::GenericFunction& __cell_bubble):
+    dolfin::Form(1, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->w = w;
+    this->p0 = p0;
+    this->nu = nu;
+    this->__cell_bubble = __cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_4());
+  }
+
+  // Constructor
+  Form_4(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> nu, std::shared_ptr<const dolfin::GenericFunction> __cell_bubble):
+    dolfin::Form(1, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->w = *w;
+    this->p0 = *p0;
+    this->nu = *nu;
+    this->__cell_bubble = *__cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_4());
+  }
+
+  // Constructor
+  Form_4(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_4());
+  }
+
+  // Constructor
+  Form_4(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& nu, const dolfin::GenericFunction& __cell_bubble):
+    dolfin::Form(1, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->w = w;
+    this->p0 = p0;
+    this->nu = nu;
+    this->__cell_bubble = __cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_4());
+  }
+
+  // Constructor
+  Form_4(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> nu, std::shared_ptr<const dolfin::GenericFunction> __cell_bubble):
+    dolfin::Form(1, 4), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_bubble(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->w = *w;
+    this->p0 = *p0;
+    this->nu = *nu;
+    this->__cell_bubble = *__cell_bubble;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_4());
+  }
+
+  // Destructor
+  ~Form_4()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+    else if (name == "p0")
+      return 1;
+    else if (name == "nu")
+      return 2;
+    else if (name == "__cell_bubble")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    case 1:
+      return "p0";
+    case 2:
+      return "nu";
+    case 3:
+      return "__cell_bubble";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_4_FunctionSpace_0 TestSpace;
+  typedef Form_4_FunctionSpace_1 CoefficientSpace_w;
+  typedef Form_4_FunctionSpace_2 CoefficientSpace_p0;
+  typedef Form_4_FunctionSpace_3 CoefficientSpace_nu;
+  typedef Form_4_FunctionSpace_4 CoefficientSpace___cell_bubble;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+  dolfin::CoefficientAssigner p0;
+  dolfin::CoefficientAssigner nu;
+  dolfin::CoefficientAssigner __cell_bubble;
+};
+
+class Form_5_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_5_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_5_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_5_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_5_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_5_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_5_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_5_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_5_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_5_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_5_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_5_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_5_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_5_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_5_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_5_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace___cell_cone Form_5_FunctionSpace_2;
+
+class Form_5: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_5(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_5());
+  }
+
+  // Constructor
+  Form_5(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& __cell_cone):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->__cell_cone = __cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_5());
+  }
+
+  // Constructor
+  Form_5(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> __cell_cone):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->__cell_cone = *__cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_5());
+  }
+
+  // Constructor
+  Form_5(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_5());
+  }
+
+  // Constructor
+  Form_5(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& __cell_cone):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->__cell_cone = __cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_5());
+  }
+
+  // Constructor
+  Form_5(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> __cell_cone):
+    dolfin::Form(2, 1), __cell_cone(*this, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->__cell_cone = *__cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_5());
+  }
+
+  // Destructor
+  ~Form_5()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "__cell_cone")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "__cell_cone";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_5_FunctionSpace_0 TestSpace;
+  typedef Form_5_FunctionSpace_1 TrialSpace;
+  typedef Form_5_FunctionSpace_2 CoefficientSpace___cell_cone;
+
+  // Coefficients
+  dolfin::CoefficientAssigner __cell_cone;
+};
+
+class Form_6_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_6_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_6_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_6_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_6_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_6_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_6_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_5()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_5()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_6_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_w Form_6_FunctionSpace_1;
+
+typedef CoefficientSpace_p0 Form_6_FunctionSpace_2;
+
+typedef CoefficientSpace_nu Form_6_FunctionSpace_3;
+
+typedef CoefficientSpace___cell_residual Form_6_FunctionSpace_4;
+
+typedef CoefficientSpace___cell_cone Form_6_FunctionSpace_5;
+
+class Form_6: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_6(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 5), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_6());
+  }
+
+  // Constructor
+  Form_6(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& nu, const dolfin::GenericFunction& __cell_residual, const dolfin::GenericFunction& __cell_cone):
+    dolfin::Form(1, 5), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->w = w;
+    this->p0 = p0;
+    this->nu = nu;
+    this->__cell_residual = __cell_residual;
+    this->__cell_cone = __cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_6());
+  }
+
+  // Constructor
+  Form_6(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> nu, std::shared_ptr<const dolfin::GenericFunction> __cell_residual, std::shared_ptr<const dolfin::GenericFunction> __cell_cone):
+    dolfin::Form(1, 5), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->w = *w;
+    this->p0 = *p0;
+    this->nu = *nu;
+    this->__cell_residual = *__cell_residual;
+    this->__cell_cone = *__cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_6());
+  }
+
+  // Constructor
+  Form_6(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 5), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_6());
+  }
+
+  // Constructor
+  Form_6(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& nu, const dolfin::GenericFunction& __cell_residual, const dolfin::GenericFunction& __cell_cone):
+    dolfin::Form(1, 5), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->w = w;
+    this->p0 = p0;
+    this->nu = nu;
+    this->__cell_residual = __cell_residual;
+    this->__cell_cone = __cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_6());
+  }
+
+  // Constructor
+  Form_6(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> nu, std::shared_ptr<const dolfin::GenericFunction> __cell_residual, std::shared_ptr<const dolfin::GenericFunction> __cell_cone):
+    dolfin::Form(1, 5), w(*this, 0), p0(*this, 1), nu(*this, 2), __cell_residual(*this, 3), __cell_cone(*this, 4)
+  {
+    _function_spaces[0] = V0;
+
+    this->w = *w;
+    this->p0 = *p0;
+    this->nu = *nu;
+    this->__cell_residual = *__cell_residual;
+    this->__cell_cone = *__cell_cone;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_6());
+  }
+
+  // Destructor
+  ~Form_6()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+    else if (name == "p0")
+      return 1;
+    else if (name == "nu")
+      return 2;
+    else if (name == "__cell_residual")
+      return 3;
+    else if (name == "__cell_cone")
+      return 4;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    case 1:
+      return "p0";
+    case 2:
+      return "nu";
+    case 3:
+      return "__cell_residual";
+    case 4:
+      return "__cell_cone";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_6_FunctionSpace_0 TestSpace;
+  typedef Form_6_FunctionSpace_1 CoefficientSpace_w;
+  typedef Form_6_FunctionSpace_2 CoefficientSpace_p0;
+  typedef Form_6_FunctionSpace_3 CoefficientSpace_nu;
+  typedef Form_6_FunctionSpace_4 CoefficientSpace___cell_residual;
+  typedef Form_6_FunctionSpace_5 CoefficientSpace___cell_cone;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+  dolfin::CoefficientAssigner p0;
+  dolfin::CoefficientAssigner nu;
+  dolfin::CoefficientAssigner __cell_residual;
+  dolfin::CoefficientAssigner __cell_cone;
+};
+
+class Form_7_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_7_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_7_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_7_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_7_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_7_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_7_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_7_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace___improved_dual Form_7_FunctionSpace_1;
+
+typedef CoefficientSpace___cell_residual Form_7_FunctionSpace_2;
+
+typedef CoefficientSpace___facet_residual Form_7_FunctionSpace_3;
+
+typedef CoefficientSpace___discrete_dual_solution Form_7_FunctionSpace_4;
+
+class Form_7: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_7(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_7());
+  }
+
+  // Constructor
+  Form_7(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& __improved_dual, const dolfin::GenericFunction& __cell_residual, const dolfin::GenericFunction& __facet_residual, const dolfin::GenericFunction& __discrete_dual_solution):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->__improved_dual = __improved_dual;
+    this->__cell_residual = __cell_residual;
+    this->__facet_residual = __facet_residual;
+    this->__discrete_dual_solution = __discrete_dual_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_7());
+  }
+
+  // Constructor
+  Form_7(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> __improved_dual, std::shared_ptr<const dolfin::GenericFunction> __cell_residual, std::shared_ptr<const dolfin::GenericFunction> __facet_residual, std::shared_ptr<const dolfin::GenericFunction> __discrete_dual_solution):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->__improved_dual = *__improved_dual;
+    this->__cell_residual = *__cell_residual;
+    this->__facet_residual = *__facet_residual;
+    this->__discrete_dual_solution = *__discrete_dual_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_7());
+  }
+
+  // Constructor
+  Form_7(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_7());
+  }
+
+  // Constructor
+  Form_7(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& __improved_dual, const dolfin::GenericFunction& __cell_residual, const dolfin::GenericFunction& __facet_residual, const dolfin::GenericFunction& __discrete_dual_solution):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->__improved_dual = __improved_dual;
+    this->__cell_residual = __cell_residual;
+    this->__facet_residual = __facet_residual;
+    this->__discrete_dual_solution = __discrete_dual_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_7());
+  }
+
+  // Constructor
+  Form_7(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> __improved_dual, std::shared_ptr<const dolfin::GenericFunction> __cell_residual, std::shared_ptr<const dolfin::GenericFunction> __facet_residual, std::shared_ptr<const dolfin::GenericFunction> __discrete_dual_solution):
+    dolfin::Form(1, 4), __improved_dual(*this, 0), __cell_residual(*this, 1), __facet_residual(*this, 2), __discrete_dual_solution(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->__improved_dual = *__improved_dual;
+    this->__cell_residual = *__cell_residual;
+    this->__facet_residual = *__facet_residual;
+    this->__discrete_dual_solution = *__discrete_dual_solution;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_7());
+  }
+
+  // Destructor
+  ~Form_7()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "__improved_dual")
+      return 0;
+    else if (name == "__cell_residual")
+      return 1;
+    else if (name == "__facet_residual")
+      return 2;
+    else if (name == "__discrete_dual_solution")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "__improved_dual";
+    case 1:
+      return "__cell_residual";
+    case 2:
+      return "__facet_residual";
+    case 3:
+      return "__discrete_dual_solution";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_7_FunctionSpace_0 TestSpace;
+  typedef Form_7_FunctionSpace_1 CoefficientSpace___improved_dual;
+  typedef Form_7_FunctionSpace_2 CoefficientSpace___cell_residual;
+  typedef Form_7_FunctionSpace_3 CoefficientSpace___facet_residual;
+  typedef Form_7_FunctionSpace_4 CoefficientSpace___discrete_dual_solution;
+
+  // Coefficients
+  dolfin::CoefficientAssigner __improved_dual;
+  dolfin::CoefficientAssigner __cell_residual;
+  dolfin::CoefficientAssigner __facet_residual;
+  dolfin::CoefficientAssigner __discrete_dual_solution;
+};
+
+class Form_lhs_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_lhs_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_lhs_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_lhs_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_lhs_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_lhs_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_lhs_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_lhs_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_lhs_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_lhs_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_lhs_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_lhs_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_lhs_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_lhs_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_lhs_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_lhs_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_w Form_lhs_FunctionSpace_2;
+
+typedef CoefficientSpace_nu Form_lhs_FunctionSpace_3;
+
+class Form_lhs: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_lhs(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_8());
+  }
+
+  // Constructor
+  Form_lhs(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& nu):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->w = w;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_8());
+  }
+
+  // Constructor
+  Form_lhs(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->w = *w;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_8());
+  }
+
+  // Constructor
+  Form_lhs(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_8());
+  }
+
+  // Constructor
+  Form_lhs(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& nu):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->w = w;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_8());
+  }
+
+  // Constructor
+  Form_lhs(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(2, 2), w(*this, 0), nu(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->w = *w;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_8());
+  }
+
+  // Destructor
+  ~Form_lhs()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+    else if (name == "nu")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    case 1:
+      return "nu";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_lhs_FunctionSpace_0 TestSpace;
+  typedef Form_lhs_FunctionSpace_1 TrialSpace;
+  typedef Form_lhs_FunctionSpace_2 CoefficientSpace_w;
+  typedef Form_lhs_FunctionSpace_3 CoefficientSpace_nu;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+  dolfin::CoefficientAssigner nu;
+};
+
+class Form_rhs_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_rhs_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_rhs_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_rhs_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_rhs_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_rhs_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_rhs_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new adaptivenavierstokes_finite_element_13()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new adaptivenavierstokes_dofmap_13()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_rhs_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_w Form_rhs_FunctionSpace_1;
+
+typedef CoefficientSpace_p0 Form_rhs_FunctionSpace_2;
+
+typedef CoefficientSpace_nu Form_rhs_FunctionSpace_3;
+
+class Form_rhs: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_rhs(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 3), w(*this, 0), p0(*this, 1), nu(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_9());
+  }
+
+  // Constructor
+  Form_rhs(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& nu):
+    dolfin::Form(1, 3), w(*this, 0), p0(*this, 1), nu(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->w = w;
+    this->p0 = p0;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_9());
+  }
+
+  // Constructor
+  Form_rhs(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(1, 3), w(*this, 0), p0(*this, 1), nu(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->w = *w;
+    this->p0 = *p0;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_9());
+  }
+
+  // Constructor
+  Form_rhs(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 3), w(*this, 0), p0(*this, 1), nu(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_9());
+  }
+
+  // Constructor
+  Form_rhs(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& w, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& nu):
+    dolfin::Form(1, 3), w(*this, 0), p0(*this, 1), nu(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->w = w;
+    this->p0 = p0;
+    this->nu = nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_9());
+  }
+
+  // Constructor
+  Form_rhs(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> w, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> nu):
+    dolfin::Form(1, 3), w(*this, 0), p0(*this, 1), nu(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->w = *w;
+    this->p0 = *p0;
+    this->nu = *nu;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_9());
+  }
+
+  // Destructor
+  ~Form_rhs()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+    else if (name == "p0")
+      return 1;
+    else if (name == "nu")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    case 1:
+      return "p0";
+    case 2:
+      return "nu";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_rhs_FunctionSpace_0 TestSpace;
+  typedef Form_rhs_FunctionSpace_1 CoefficientSpace_w;
+  typedef Form_rhs_FunctionSpace_2 CoefficientSpace_p0;
+  typedef Form_rhs_FunctionSpace_3 CoefficientSpace_nu;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+  dolfin::CoefficientAssigner p0;
+  dolfin::CoefficientAssigner nu;
+};
+
+typedef CoefficientSpace_w Form_goal_FunctionSpace_0;
+
+class Form_goal: public dolfin::GoalFunctional
+{
+public:
+
+  // Constructor
+  Form_goal(const dolfin::Mesh& mesh):
+    dolfin::GoalFunctional(0, 1), w(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_10());
+  }
+
+  // Constructor
+  Form_goal(const dolfin::Mesh& mesh, const dolfin::GenericFunction& w):
+    dolfin::GoalFunctional(0, 1), w(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->w = w;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_10());
+  }
+
+  // Constructor
+  Form_goal(const dolfin::Mesh& mesh, std::shared_ptr<const dolfin::GenericFunction> w):
+    dolfin::GoalFunctional(0, 1), w(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->w = *w;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_10());
+  }
+
+  // Constructor
+  Form_goal(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::GoalFunctional(0, 1), w(*this, 0)
+  {
+    _mesh = mesh;
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_10());
+  }
+
+  // Constructor
+  Form_goal(std::shared_ptr<const dolfin::Mesh> mesh, const dolfin::GenericFunction& w):
+    dolfin::GoalFunctional(0, 1), w(*this, 0)
+  {
+    _mesh = mesh;
+    this->w = w;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_10());
+  }
+
+  // Constructor
+  Form_goal(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::GenericFunction> w):
+    dolfin::GoalFunctional(0, 1), w(*this, 0)
+  {
+    _mesh = mesh;
+    this->w = *w;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new adaptivenavierstokes_form_10());
+  }
+
+  // Destructor
+  ~Form_goal()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "w")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class GoalFunctional",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "w";
+    }
+
+    dolfin::dolfin_error("generated code for class GoalFunctional",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_goal_FunctionSpace_0 CoefficientSpace_w;
+
+  // Coefficients
+  dolfin::CoefficientAssigner w;
+
+  /// Initialize all error control forms, attach coefficients and
+  /// (re-)set error control
+  virtual void update_ec(const dolfin::Form& a, const dolfin::Form& L)
+  {
+    // This stuff is created here and shipped elsewhere
+    std::shared_ptr<dolfin::Form> a_star;           // Dual lhs
+    std::shared_ptr<dolfin::Form> L_star;           // Dual rhs
+    std::shared_ptr<dolfin::FunctionSpace> V_Ez_h;  // Extrapolation space
+    std::shared_ptr<dolfin::Function> Ez_h;         // Extrapolated dual
+    std::shared_ptr<dolfin::Form> residual;         // Residual (as functional)
+    std::shared_ptr<dolfin::FunctionSpace> V_R_T;   // Trial space for cell residual
+    std::shared_ptr<dolfin::Form> a_R_T;            // Cell residual lhs
+    std::shared_ptr<dolfin::Form> L_R_T;            // Cell residual rhs
+    std::shared_ptr<dolfin::FunctionSpace> V_b_T;   // Function space for cell bubble
+    std::shared_ptr<dolfin::Function> b_T;          // Cell bubble
+    std::shared_ptr<dolfin::FunctionSpace> V_R_dT;  // Trial space for facet residual
+    std::shared_ptr<dolfin::Form> a_R_dT;           // Facet residual lhs
+    std::shared_ptr<dolfin::Form> L_R_dT;           // Facet residual rhs
+    std::shared_ptr<dolfin::FunctionSpace> V_b_e;   // Function space for cell cone
+    std::shared_ptr<dolfin::Function> b_e;          // Cell cone
+    std::shared_ptr<dolfin::FunctionSpace> V_eta_T; // Function space for indicators
+    std::shared_ptr<dolfin::Form> eta_T;            // Indicator form
+
+    // Some handy views
+    const dolfin::FunctionSpace& Vhat(*(a.function_space(0))); // Primal test
+    const dolfin::FunctionSpace& V(*(a.function_space(1)));    // Primal trial
+    assert(V.mesh());
+    const dolfin::Mesh& mesh(*V.mesh());
+    std::string name;
+
+    // Initialize dual forms
+    a_star.reset(new Form_0(V, Vhat));
+    L_star.reset(new Form_1(V));
+
+    
+    // Attach coefficients from a to a_star
+    for (std::size_t i = 0; i < a.num_coefficients(); i++)
+    {
+      name = a.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether a_star has coefficient named 'name'
+      try {
+        a_star->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to a_star";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      a_star->set_coefficient(name, a.coefficient(i));
+    }
+    
+    // Attach subdomains from a to a_star
+    a_star->dx = a.cell_domains();
+    a_star->ds = a.exterior_facet_domains();
+    a_star->dS = a.interior_facet_domains();
+
+    
+    // Attach coefficients from (*this) to L_star
+    for (std::size_t i = 0; i < (*this).num_coefficients(); i++)
+    {
+      name = (*this).coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_star has coefficient named 'name'
+      try {
+        L_star->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_star";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_star->set_coefficient(name, (*this).coefficient(i));
+    }
+    
+    // Attach subdomains from (*this) to L_star
+    L_star->dx = (*this).cell_domains();
+    L_star->ds = (*this).exterior_facet_domains();
+    L_star->dS = (*this).interior_facet_domains();
+
+
+    // Initialize residual
+    residual.reset(new Form_2(mesh));
+    
+    // Attach coefficients from a to residual
+    for (std::size_t i = 0; i < a.num_coefficients(); i++)
+    {
+      name = a.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether residual has coefficient named 'name'
+      try {
+        residual->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to residual";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      residual->set_coefficient(name, a.coefficient(i));
+    }
+    
+
+    // Attach coefficients from L to residual
+    for (std::size_t i = 0; i < L.num_coefficients(); i++)
+    {
+      name = L.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether residual has coefficient named 'name'
+      try {
+        residual->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to residual";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      residual->set_coefficient(name, L.coefficient(i));
+    }
+    
+    // Attach subdomains from L to residual
+    residual->dx = L.cell_domains();
+    residual->ds = L.exterior_facet_domains();
+    residual->dS = L.interior_facet_domains();
+
+
+    // Initialize extrapolation space and (fake) extrapolation
+    V_Ez_h.reset(new CoefficientSpace___improved_dual(mesh));
+    Ez_h.reset(new dolfin::Function(V_Ez_h));
+    residual->set_coefficient("__improved_dual", Ez_h);
+
+    // Create bilinear and linear form for computing cell residual R_T
+    V_R_T.reset(new Form_4::TestSpace(mesh));
+    a_R_T.reset(new Form_3(V_R_T, V_R_T));
+    L_R_T.reset(new Form_4(V_R_T));
+
+    // Initialize bubble and attach to a_R_T and L_R_T
+    V_b_T.reset(new CoefficientSpace___cell_bubble(mesh));
+    b_T.reset(new dolfin::Function(V_b_T));
+    *b_T->vector() = 1.0;
+    
+    // Attach coefficients from a to L_R_T
+    for (std::size_t i = 0; i < a.num_coefficients(); i++)
+    {
+      name = a.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_R_T has coefficient named 'name'
+      try {
+        L_R_T->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_R_T";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_R_T->set_coefficient(name, a.coefficient(i));
+    }
+    
+
+    // Attach coefficients from L to L_R_T
+    for (std::size_t i = 0; i < L.num_coefficients(); i++)
+    {
+      name = L.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_R_T has coefficient named 'name'
+      try {
+        L_R_T->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_R_T";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_R_T->set_coefficient(name, L.coefficient(i));
+    }
+    
+    // Attach subdomains from L to L_R_T
+    L_R_T->dx = L.cell_domains();
+    L_R_T->ds = L.exterior_facet_domains();
+    L_R_T->dS = L.interior_facet_domains();
+
+
+    // Attach bubble function to _a_R_T and _L_R_T
+    a_R_T->set_coefficient("__cell_bubble", b_T);
+    L_R_T->set_coefficient("__cell_bubble", b_T);
+
+    // Create bilinear and linear form for computing facet residual R_dT
+    V_R_dT.reset(new Form_6::TestSpace(mesh));
+    a_R_dT.reset(new Form_5(V_R_dT, V_R_dT));
+    L_R_dT.reset(new Form_6(V_R_dT));
+    
+    // Attach coefficients from a to L_R_dT
+    for (std::size_t i = 0; i < a.num_coefficients(); i++)
+    {
+      name = a.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_R_dT has coefficient named 'name'
+      try {
+        L_R_dT->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_R_dT";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_R_dT->set_coefficient(name, a.coefficient(i));
+    }
+    
+
+    // Attach coefficients from L to L_R_dT
+    for (std::size_t i = 0; i < L.num_coefficients(); i++)
+    {
+      name = L.coefficient_name(i);
+      // Don't attach discrete primal solution here (not computed).
+      if (name == "__discrete_primal_solution")
+        continue;
+
+      // Test whether L_R_dT has coefficient named 'name'
+      try {
+        L_R_dT->coefficient_number(name);
+      } catch (...) {
+        std::cout << "Attaching coefficient named: " << name << " to L_R_dT";
+        std::cout << " failed! But this might be expected." << std::endl;
+        continue;
+      }
+      L_R_dT->set_coefficient(name, L.coefficient(i));
+    }
+    
+    // Attach subdomains from L to L_R_dT
+    L_R_dT->dx = L.cell_domains();
+    L_R_dT->ds = L.exterior_facet_domains();
+    L_R_dT->dS = L.interior_facet_domains();
+
+
+    // Initialize (fake) cone and attach to a_R_dT and L_R_dT
+    V_b_e.reset(new CoefficientSpace___cell_cone(mesh));
+    b_e.reset(new dolfin::Function(V_b_e));
+    a_R_dT->set_coefficient("__cell_cone", b_e);
+    L_R_dT->set_coefficient("__cell_cone", b_e);
+
+    // Create error indicator form
+    V_eta_T.reset(new Form_7::TestSpace(mesh));
+    eta_T.reset(new Form_7(V_eta_T));
+
+    // Update error control
+    _ec.reset(new dolfin::ErrorControl(a_star, L_star, residual,
+                                       a_R_T, L_R_T, a_R_dT, L_R_dT, eta_T,
+                                       false));
+
+  }
+
+};
+
+// Class typedefs
+typedef Form_lhs BilinearForm;
+typedef Form_rhs LinearForm;
+typedef Form_goal GoalFunctional;
+
+}
+
+#endif
diff --git a/demo/undocumented/auto-adaptive-navier-stokes/cpp/AdaptiveNavierStokes.ufl b/demo/undocumented/auto-adaptive-navier-stokes/cpp/AdaptiveNavierStokes.ufl
new file mode 100644
index 0000000..b201503
--- /dev/null
+++ b/demo/undocumented/auto-adaptive-navier-stokes/cpp/AdaptiveNavierStokes.ufl
@@ -0,0 +1,51 @@
+# Copyright (C) 2010 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-11-01
+# Last changed: 2011-06-29
+#
+# Compile with ffc -e -l dolfin AdaptiveNavierStokes.ufl
+
+cell = triangle
+V = VectorElement("CG", cell, 2)
+Q = FiniteElement("CG", cell, 1)
+W = V * Q
+
+w = Coefficient(W)
+(u, p) = (as_vector((w[0], w[1])), w[2])
+(v, q) = TestFunctions(W)
+
+# Prescribed pressure
+T = FiniteElement("CG", cell, 1)
+p0 = Coefficient(T)
+
+# Prescribed viscosity
+nu = Constant(cell)
+
+# Define FacetNormal
+n = FacetNormal(cell)
+
+# Define variational form
+L = (nu*inner(grad(u), grad(v)) - p*div(v) + div(u)*q
+     + inner(v, grad(u)*u))*dx() \
+     + p0*dot(v, n)*ds()
+
+# Define goal functional
+M = w[0]*ds(0)
+
+# NB: Label the unknown
+unknown = w
diff --git a/demo/undocumented/auto-adaptive-navier-stokes/cpp/CMakeLists.txt b/demo/undocumented/auto-adaptive-navier-stokes/cpp/CMakeLists.txt
new file mode 100644
index 0000000..7c8e1df
--- /dev/null
+++ b/demo/undocumented/auto-adaptive-navier-stokes/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_auto-adaptive-navier-stokes)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/auto-adaptive-navier-stokes/cpp/compile.log b/demo/undocumented/auto-adaptive-navier-stokes/cpp/compile.log
new file mode 100644
index 0000000..cdd300c
--- /dev/null
+++ b/demo/undocumented/auto-adaptive-navier-stokes/cpp/compile.log
@@ -0,0 +1,21902 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form AdaptiveNavierStokes
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, c_2]'
+  Coefficient names:      '[w, nu]'
+  Unique elements:        'Mixed<Vector<2 x CG2(?)>, CG1(?)>, R0(?)'
+  Unique sub elements:    'Mixed<Vector<2 x CG2(?)>, CG1(?)>, R0(?), Vector<2 x CG2(
+                          ?)>, CG1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 3
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  
+  Name:                                ''
+  Geometric dimension:                 2
+  Number of exterior_facet subdomains: 1
+  Rank:                                1
+  Arguments:                           '[v_0]'
+  Argument names:                      '[v0]'
+  Number of coefficients:              0
+  Coefficients:                        '[]'
+  Coefficient names:                   '[]'
+  Unique elements:                     'Mixed<Vector<2 x CG2(?)>, CG1(?)>'
+  Unique sub elements:                 'Mixed<Vector<2 x CG2(?)>, CG1(?)>, Vector<2 
+                                       x CG2(?)>, CG1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   0
+  Arguments:              '[]'
+  Argument names:         '[]'
+  Number of coefficients: 4
+  Coefficients:           '[w_0, w_1, c_2, w_3]'
+  Coefficient names:      '[w, p0, nu, __improved_dual]'
+  Unique elements:        'Mixed<Vector<2 x CG2(?)>, CG1(?)>, CG1(?), R0(?), Mixed<M
+                          ixed<CG3(?), CG3(?)>, CG2(?)>'
+  Unique sub elements:    'Mixed<Vector<2 x CG2(?)>, CG1(?)>, CG1(?), R0(?), Mixed<M
+                          ixed<CG3(?), CG3(?)>, CG2(?)>, Vector<2 x CG2(?)>, Mixed<C
+                          G3(?), CG3(?)>, CG2(?), CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 5
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 1
+  Coefficients:           '[w_4]'
+  Coefficient names:      '[__cell_bubble]'
+  Unique elements:        'Mixed<Mixed<DG2(?), DG2(?)>, DG1(?)>, B3(?)'
+  Unique sub elements:    'Mixed<Mixed<DG2(?), DG2(?)>, DG1(?)>, B3(?), Mixed<DG2(?)
+                          , DG2(?)>, DG1(?), DG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 7
+  quadrature_degree: auto --> 7
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 4
+  Coefficients:           '[w_0, w_1, c_2, w_4]'
+  Coefficient names:      '[w, p0, nu, __cell_bubble]'
+  Unique elements:        'Mixed<Mixed<DG2(?), DG2(?)>, DG1(?)>, Mixed<Vector<2 x CG
+                          2(?)>, CG1(?)>, CG1(?), R0(?), B3(?)'
+  Unique sub elements:    'Mixed<Mixed<DG2(?), DG2(?)>, DG1(?)>, Mixed<Vector<2 x CG
+                          2(?)>, CG1(?)>, CG1(?), R0(?), B3(?), Mixed<DG2(?), DG2(?)
+                          >, DG1(?), Vector<2 x CG2(?)>, DG2(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 5
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 8
+  quadrature_degree: auto --> 8
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 1
+  Coefficients:           '[w_6]'
+  Coefficient names:      '[__cell_cone]'
+  Unique elements:        'Mixed<Mixed<DG2(?), DG2(?)>, DG1(?)>, DG2(?)'
+  Unique sub elements:    'Mixed<Mixed<DG2(?), DG2(?)>, DG1(?)>, DG2(?), Mixed<DG2(?
+                          ), DG2(?)>, DG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 5
+  Coefficients:           '[w_0, w_1, c_2, w_5, w_6]'
+  Coefficient names:      '[w, p0, nu, __cell_residual, __cell_cone]'
+  Unique elements:        'Mixed<Mixed<DG2(?), DG2(?)>, DG1(?)>, Mixed<Vector<2 x CG
+                          2(?)>, CG1(?)>, CG1(?), R0(?), DG2(?)'
+  Unique sub elements:    'Mixed<Mixed<DG2(?), DG2(?)>, DG1(?)>, Mixed<Vector<2 x CG
+                          2(?)>, CG1(?)>, CG1(?), R0(?), DG2(?), Mixed<DG2(?), DG2(?
+                          )>, DG1(?), Vector<2 x CG2(?)>, CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 5
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 7
+  quadrature_degree: auto --> 7
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  
+  Name:                   ''
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 4
+  Coefficients:           '[w_3, w_5, w_7, w_8]'
+  Coefficient names:      '[__improved_dual, __cell_residual, __facet_residual, __di
+                          screte_dual_solution]'
+  Unique elements:        'DG0(?), Mixed<Mixed<CG3(?), CG3(?)>, CG2(?)>, Mixed<Mixed
+                          <DG2(?), DG2(?)>, DG1(?)>, Mixed<Vector<2 x CG2(?)>, CG1(?
+                          )>'
+  Unique sub elements:    'DG0(?), Mixed<Mixed<CG3(?), CG3(?)>, CG2(?)>, Mixed<Mixed
+                          <DG2(?), DG2(?)>, DG1(?)>, Mixed<Vector<2 x CG2(?)>, CG1(?
+                          )>, Mixed<CG3(?), CG3(?)>, CG2(?), Mixed<DG2(?), DG2(?)>, 
+                          DG1(?), Vector<2 x CG2(?)>, CG1(?), CG3(?), DG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  
+  Name:                   'lhs'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v0, v1]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, c_2]'
+  Coefficient names:      '[w, nu]'
+  Unique elements:        'Mixed<Vector<2 x CG2(?)>, CG1(?)>, R0(?)'
+  Unique sub elements:    'Mixed<Vector<2 x CG2(?)>, CG1(?)>, R0(?), Vector<2 x CG2(
+                          ?)>, CG1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 3
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  
+  Name:                   'rhs'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v0]'
+  Number of coefficients: 3
+  Coefficients:           '[w_0, w_1, c_2]'
+  Coefficient names:      '[w, p0, nu]'
+  Unique elements:        'Mixed<Vector<2 x CG2(?)>, CG1(?)>, CG1(?), R0(?)'
+  Unique sub elements:    'Mixed<Vector<2 x CG2(?)>, CG1(?)>, CG1(?), R0(?), Vector<
+                          2 x CG2(?)>, CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  
+  Name:                                'goal'
+  Geometric dimension:                 2
+  Number of exterior_facet subdomains: 1
+  Rank:                                0
+  Arguments:                           '[]'
+  Argument names:                      '[]'
+  Number of coefficients:              1
+  Coefficients:                        '[w_0]'
+  Coefficient names:                   '[w]'
+  Unique elements:                     'Mixed<Vector<2 x CG2(?)>, CG1(?)>'
+  Unique sub elements:                 'Mixed<Vector<2 x CG2(?)>, CG1(?)>, Vector<2 
+                                       x CG2(?)>, CG1(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.271112 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 14 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 14 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00409 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00406 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00356 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00341 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00351 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00357 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00343 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00341 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00298 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00395 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  900 entries computed in 0.00481 seconds
+  Shape of reference tensor: (15, 15, 1, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  900 entries computed in 0.00337 seconds
+  Shape of reference tensor: (15, 15, 1, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  900 entries computed in 0.00328 seconds
+  Shape of reference tensor: (15, 15, 1, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  900 entries computed in 0.00327 seconds
+  Shape of reference tensor: (15, 15, 1, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00308 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00296 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  15 entries computed in 0.00143 seconds
+  Shape of reference tensor: (15,)
+  Primary multi index:   rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  15 entries computed in 0.0013 seconds
+  Shape of reference tensor: (15,)
+  Primary multi index:   rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  15 entries computed in 0.0013 seconds
+  Shape of reference tensor: (15,)
+  Primary multi index:   rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {12: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object)}}}, MixedElement(*[MixedElement(*[FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 3, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 3, quad_scheme=None)], **{'value_shape': (2,) }), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[ -4.85931890e-01,  -4.85931890e-01,  -3.44372756e+00,
+             4.04638309e-01,   4.04638309e-01,   1.18553235e-01,
+            -5.59823902e-01,   4.92870367e-01,  -5.59823902e-01,
+            -7.40805832e-01,   4.92870367e-01,  -7.40805832e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  8.88178420e-16,  -5.55111512e-16,   3.33066907e-16,
+             2.18575158e-16,  -1.38777878e-17,   9.71445147e-17,
+             3.33066907e-16,  -1.66533454e-16,  -2.13370988e-16,
+            -2.77555756e-16,  -3.98986399e-17,   2.63677968e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.85931890e-01,   3.44372756e+00,   4.85931890e-01,
+            -4.04638309e-01,  -1.18553235e-01,  -4.04638309e-01,
+            -4.92870367e-01,   5.59823902e-01,   7.40805832e-01,
+             5.59823902e-01,   7.40805832e-01,  -4.92870367e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.37592643e+00,  -2.30167545e-01,  -2.30167545e-01,
+             1.13786606e+00,  -2.82847955e-01,  -2.82847955e-01,
+             2.60506708e+00,   2.60506708e+00,  -9.62843375e-02,
+            -9.62843375e-02,  -2.01023374e-01,  -2.01023374e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.44372756e+00,   1.20457074e+00,  -1.76434524e-01,
+             1.11855323e+00,   2.25318218e+00,   5.56094442e-01,
+             2.46932174e+00,  -1.95093341e+00,   3.93699696e+00,
+            -9.51256225e-01,   6.74175116e-01,   2.06177081e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -5.37330206e-02,   2.21356002e+00,   5.17135569e+00,
+            -8.38942398e-01,  -1.40140119e+00,  -1.11531612e+00,
+             7.50232851e-01,  -3.02461418e-01,   1.74991003e+00,
+             1.93089196e+00,  -2.56560608e+00,  -1.33192988e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  5.37330206e-02,  -5.17135569e+00,  -2.21356002e+00,
+             8.38942398e-01,   1.11531612e+00,   1.40140119e+00,
+             3.02461418e-01,  -7.50232851e-01,  -1.93089196e+00,
+            -1.74991003e+00,   1.33192988e+00,   2.56560608e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.44372756e+00,   1.76434524e-01,  -1.20457074e+00,
+            -1.11855323e+00,  -5.56094442e-01,  -2.25318218e+00,
+             1.95093341e+00,  -2.46932174e+00,   9.51256225e-01,
+            -3.93699696e+00,  -2.06177081e-01,  -6.74175116e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -6.37592643e+00,   2.30167545e-01,   2.30167545e-01,
+            -1.13786606e+00,   2.82847955e-01,   2.82847955e-01,
+            -2.60506708e+00,  -2.60506708e+00,   9.62843375e-02,
+             9.62843375e-02,   2.01023374e-01,   2.01023374e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.66453526e-15,  -1.38100527e+00,   1.38100527e+00,
+             1.14908083e-14,  -1.69708773e+00,   1.69708773e+00,
+            -4.42025515e+00,   4.42025515e+00,  -4.88825318e+00,
+             4.88825318e+00,  -4.67998035e-01,   4.67998035e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -4.85931890e-01,  -4.85931890e-01,  -3.44372756e+00,
+             4.04638309e-01,   4.04638309e-01,   1.18553235e-01,
+            -5.59823902e-01,   4.92870367e-01,  -5.59823902e-01,
+            -7.40805832e-01,   4.92870367e-01,  -7.40805832e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.88178420e-16,  -5.55111512e-16,   3.33066907e-16,
+             2.18575158e-16,  -1.38777878e-17,   9.71445147e-17,
+             3.33066907e-16,  -1.66533454e-16,  -2.13370988e-16,
+            -2.77555756e-16,  -3.98986399e-17,   2.63677968e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.85931890e-01,   3.44372756e+00,   4.85931890e-01,
+            -4.04638309e-01,  -1.18553235e-01,  -4.04638309e-01,
+            -4.92870367e-01,   5.59823902e-01,   7.40805832e-01,
+             5.59823902e-01,   7.40805832e-01,  -4.92870367e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.37592643e+00,  -2.30167545e-01,  -2.30167545e-01,
+             1.13786606e+00,  -2.82847955e-01,  -2.82847955e-01,
+             2.60506708e+00,   2.60506708e+00,  -9.62843375e-02,
+            -9.62843375e-02,  -2.01023374e-01,  -2.01023374e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.44372756e+00,   1.20457074e+00,  -1.76434524e-01,
+             1.11855323e+00,   2.25318218e+00,   5.56094442e-01,
+             2.46932174e+00,  -1.95093341e+00,   3.93699696e+00,
+            -9.51256225e-01,   6.74175116e-01,   2.06177081e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -5.37330206e-02,   2.21356002e+00,   5.17135569e+00,
+            -8.38942398e-01,  -1.40140119e+00,  -1.11531612e+00,
+             7.50232851e-01,  -3.02461418e-01,   1.74991003e+00,
+             1.93089196e+00,  -2.56560608e+00,  -1.33192988e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  5.37330206e-02,  -5.17135569e+00,  -2.21356002e+00,
+             8.38942398e-01,   1.11531612e+00,   1.40140119e+00,
+             3.02461418e-01,  -7.50232851e-01,  -1.93089196e+00,
+            -1.74991003e+00,   1.33192988e+00,   2.56560608e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.44372756e+00,   1.76434524e-01,  -1.20457074e+00,
+            -1.11855323e+00,  -5.56094442e-01,  -2.25318218e+00,
+             1.95093341e+00,  -2.46932174e+00,   9.51256225e-01,
+            -3.93699696e+00,  -2.06177081e-01,  -6.74175116e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -6.37592643e+00,   2.30167545e-01,   2.30167545e-01,
+            -1.13786606e+00,   2.82847955e-01,   2.82847955e-01,
+            -2.60506708e+00,  -2.60506708e+00,   9.62843375e-02,
+             9.62843375e-02,   2.01023374e-01,   2.01023374e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.66453526e-15,  -1.38100527e+00,   1.38100527e+00,
+             1.14908083e-14,  -1.69708773e+00,   1.69708773e+00,
+            -4.42025515e+00,   4.42025515e+00,  -4.88825318e+00,
+             4.88825318e+00,  -4.67998035e-01,   4.67998035e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  7.47643942e-01,   7.47643942e-01,  -2.49528788e+00,
+             2.85301932e-03,   2.85301932e-03,  -1.00570604e+00,
+             7.87419801e-01,  -2.41409804e-01,   7.87419801e-01,
+            -1.54601000e+00,  -2.41409804e-01,  -1.54601000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.44089210e-16,  -4.44089210e-16,  -1.66533454e-16,
+            -1.11022302e-16,  -5.55111512e-17,  -1.66533454e-16,
+             1.24900090e-16,  -1.11022302e-16,   0.00000000e+00,
+            -1.11022302e-16,   5.55111512e-17,   6.93889390e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -7.47643942e-01,   2.49528788e+00,  -7.47643942e-01,
+            -2.85301932e-03,   1.00570604e+00,  -2.85301932e-03,
+             2.41409804e-01,  -7.87419801e-01,   1.54601000e+00,
+            -7.87419801e-01,   1.54601000e+00,   2.41409804e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  3.49528788e+00,   2.52356058e-01,   2.52356058e-01,
+             2.00570604e+00,   9.97146981e-01,   9.97146981e-01,
+             2.54601000e+00,   2.54601000e+00,   1.24140980e+00,
+             1.24140980e+00,   2.12580199e-01,   2.12580199e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.22044605e-16,  -3.24293183e+00,   3.24293183e+00,
+             3.77475828e-15,  -1.00855906e+00,   1.00855906e+00,
+            -1.02882960e+00,   1.02882960e+00,  -2.33342980e+00,
+             2.33342980e+00,  -1.30460019e+00,   1.30460019e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.49528788e+00,  -2.52356058e-01,  -2.52356058e-01,
+            -2.00570604e+00,  -9.97146981e-01,  -9.97146981e-01,
+            -2.54601000e+00,  -2.54601000e+00,  -1.24140980e+00,
+            -1.24140980e+00,  -2.12580199e-01,  -2.12580199e-01]]]), (1, 0): array([[[ -4.85931890e-01,  -4.85931890e-01,  -3.44372756e+00,
+             4.04638309e-01,   4.04638309e-01,   1.18553235e-01,
+            -5.59823902e-01,   4.92870367e-01,  -5.59823902e-01,
+            -7.40805832e-01,   4.92870367e-01,  -7.40805832e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  3.44372756e+00,   4.85931890e-01,   4.85931890e-01,
+            -1.18553235e-01,  -4.04638309e-01,  -4.04638309e-01,
+             7.40805832e-01,   7.40805832e-01,  -4.92870367e-01,
+            -4.92870367e-01,   5.59823902e-01,   5.59823902e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.38645914e-17,   3.35148811e-16,  -9.23566062e-17,
+            -3.90397186e-17,  -3.69822127e-17,  -1.47889501e-16,
+             5.25620294e-17,  -1.38022087e-17,   2.00322990e-16,
+            -3.95456510e-17,  -8.98417888e-17,  -2.63346192e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.20457074e+00,  -2.44372756e+00,  -1.76434524e-01,
+             2.25318218e+00,   1.11855323e+00,   5.56094442e-01,
+             3.93699696e+00,   6.74175116e-01,   2.46932174e+00,
+             2.06177081e-01,  -1.95093341e+00,  -9.51256225e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.30167545e-01,   6.37592643e+00,  -2.30167545e-01,
+            -2.82847955e-01,   1.13786606e+00,  -2.82847955e-01,
+            -9.62843375e-02,  -2.01023374e-01,   2.60506708e+00,
+            -2.01023374e-01,   2.60506708e+00,  -9.62843375e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.76434524e-01,   2.44372756e+00,  -1.20457074e+00,
+            -5.56094442e-01,  -1.11855323e+00,  -2.25318218e+00,
+             9.51256225e-01,  -2.06177081e-01,   1.95093341e+00,
+            -6.74175116e-01,  -2.46932174e+00,  -3.93699696e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.30167545e-01,  -6.37592643e+00,   2.30167545e-01,
+             2.82847955e-01,  -1.13786606e+00,   2.82847955e-01,
+             9.62843375e-02,   2.01023374e-01,  -2.60506708e+00,
+             2.01023374e-01,  -2.60506708e+00,   9.62843375e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.21356002e+00,  -5.37330206e-02,   5.17135569e+00,
+            -1.40140119e+00,  -8.38942398e-01,  -1.11531612e+00,
+             1.74991003e+00,  -2.56560608e+00,   7.50232851e-01,
+            -1.33192988e+00,  -3.02461418e-01,   1.93089196e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -5.17135569e+00,   5.37330206e-02,  -2.21356002e+00,
+             1.11531612e+00,   8.38942398e-01,   1.40140119e+00,
+            -1.93089196e+00,   1.33192988e+00,   3.02461418e-01,
+             2.56560608e+00,  -7.50232851e-01,  -1.74991003e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.38100527e+00,  -6.43415175e-17,   1.38100527e+00,
+            -1.69708773e+00,   1.51461450e-14,   1.69708773e+00,
+            -4.88825318e+00,  -4.67998035e-01,  -4.42025515e+00,
+             4.67998035e-01,   4.42025515e+00,   4.88825318e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -4.85931890e-01,  -4.85931890e-01,  -3.44372756e+00,
+             4.04638309e-01,   4.04638309e-01,   1.18553235e-01,
+            -5.59823902e-01,   4.92870367e-01,  -5.59823902e-01,
+            -7.40805832e-01,   4.92870367e-01,  -7.40805832e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  3.44372756e+00,   4.85931890e-01,   4.85931890e-01,
+            -1.18553235e-01,  -4.04638309e-01,  -4.04638309e-01,
+             7.40805832e-01,   7.40805832e-01,  -4.92870367e-01,
+            -4.92870367e-01,   5.59823902e-01,   5.59823902e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.38645914e-17,   3.35148811e-16,  -9.23566062e-17,
+            -3.90397186e-17,  -3.69822127e-17,  -1.47889501e-16,
+             5.25620294e-17,  -1.38022087e-17,   2.00322990e-16,
+            -3.95456510e-17,  -8.98417888e-17,  -2.63346192e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.20457074e+00,  -2.44372756e+00,  -1.76434524e-01,
+             2.25318218e+00,   1.11855323e+00,   5.56094442e-01,
+             3.93699696e+00,   6.74175116e-01,   2.46932174e+00,
+             2.06177081e-01,  -1.95093341e+00,  -9.51256225e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.30167545e-01,   6.37592643e+00,  -2.30167545e-01,
+            -2.82847955e-01,   1.13786606e+00,  -2.82847955e-01,
+            -9.62843375e-02,  -2.01023374e-01,   2.60506708e+00,
+            -2.01023374e-01,   2.60506708e+00,  -9.62843375e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.76434524e-01,   2.44372756e+00,  -1.20457074e+00,
+            -5.56094442e-01,  -1.11855323e+00,  -2.25318218e+00,
+             9.51256225e-01,  -2.06177081e-01,   1.95093341e+00,
+            -6.74175116e-01,  -2.46932174e+00,  -3.93699696e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.30167545e-01,  -6.37592643e+00,   2.30167545e-01,
+             2.82847955e-01,  -1.13786606e+00,   2.82847955e-01,
+             9.62843375e-02,   2.01023374e-01,  -2.60506708e+00,
+             2.01023374e-01,  -2.60506708e+00,   9.62843375e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.21356002e+00,  -5.37330206e-02,   5.17135569e+00,
+            -1.40140119e+00,  -8.38942398e-01,  -1.11531612e+00,
+             1.74991003e+00,  -2.56560608e+00,   7.50232851e-01,
+            -1.33192988e+00,  -3.02461418e-01,   1.93089196e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -5.17135569e+00,   5.37330206e-02,  -2.21356002e+00,
+             1.11531612e+00,   8.38942398e-01,   1.40140119e+00,
+            -1.93089196e+00,   1.33192988e+00,   3.02461418e-01,
+             2.56560608e+00,  -7.50232851e-01,  -1.74991003e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.38100527e+00,  -6.43415175e-17,   1.38100527e+00,
+            -1.69708773e+00,   1.51461450e-14,   1.69708773e+00,
+            -4.88825318e+00,  -4.67998035e-01,  -4.42025515e+00,
+             4.67998035e-01,   4.42025515e+00,   4.88825318e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  7.47643942e-01,   7.47643942e-01,  -2.49528788e+00,
+             2.85301932e-03,   2.85301932e-03,  -1.00570604e+00,
+             7.87419801e-01,  -2.41409804e-01,   7.87419801e-01,
+            -1.54601000e+00,  -2.41409804e-01,  -1.54601000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.49528788e+00,  -7.47643942e-01,  -7.47643942e-01,
+             1.00570604e+00,  -2.85301932e-03,  -2.85301932e-03,
+             1.54601000e+00,   1.54601000e+00,   2.41409804e-01,
+             2.41409804e-01,  -7.87419801e-01,  -7.87419801e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.52356058e-01,   3.49528788e+00,   2.52356058e-01,
+             9.97146981e-01,   2.00570604e+00,   9.97146981e-01,
+             1.24140980e+00,   2.12580199e-01,   2.54601000e+00,
+             2.12580199e-01,   2.54601000e+00,   1.24140980e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.52356058e-01,  -3.49528788e+00,  -2.52356058e-01,
+            -9.97146981e-01,  -2.00570604e+00,  -9.97146981e-01,
+            -1.24140980e+00,  -2.12580199e-01,  -2.54601000e+00,
+            -2.12580199e-01,  -2.54601000e+00,  -1.24140980e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.24293183e+00,  -1.09888393e-15,   3.24293183e+00,
+            -1.00855906e+00,   3.57248574e-15,   1.00855906e+00,
+            -2.33342980e+00,  -1.30460019e+00,  -1.02882960e+00,
+             1.30460019e+00,   1.02882960e+00,   2.33342980e+00]]]), (0, 0): array([[[ 0.046308  ,  0.046308  ,  0.44026899,  0.03935169,  0.03935169,
+           -0.06267372,  0.04111073,  0.01143583,  0.04111073, -0.02619323,
+            0.01143583, -0.02619323],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.44026899,  0.046308  ,  0.046308  , -0.06267372,  0.03935169,
+            0.03935169, -0.02619323, -0.02619323,  0.01143583,  0.01143583,
+            0.04111073,  0.04111073],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.046308  ,  0.44026899,  0.046308  ,  0.03935169, -0.06267372,
+            0.03935169,  0.01143583,  0.04111073, -0.02619323,  0.04111073,
+           -0.02619323,  0.01143583],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.40225091, -0.20112546, -0.01452104,  0.28365493, -0.14182746,
+           -0.07051025,  0.80848895,  0.13844642, -0.06128522, -0.00511704,
+           -0.12795188, -0.0623881 ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.20112546,  0.40225091, -0.01452104, -0.14182746,  0.28365493,
+           -0.07051025, -0.06128522, -0.12795188,  0.80848895, -0.0623881 ,
+            0.13844642, -0.00511704],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.01452104, -0.20112546,  0.40225091, -0.07051025, -0.14182746,
+            0.28365493, -0.0623881 , -0.00511704, -0.12795188,  0.13844642,
+           -0.06128522,  0.80848895],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.01452104,  0.40225091, -0.20112546, -0.07051025,  0.28365493,
+           -0.14182746, -0.00511704, -0.0623881 ,  0.13844642, -0.12795188,
+            0.80848895, -0.06128522],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.20112546, -0.01452104,  0.40225091, -0.14182746, -0.07051025,
+            0.28365493, -0.12795188, -0.06128522, -0.0623881 ,  0.80848895,
+           -0.00511704,  0.13844642],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.40225091, -0.01452104, -0.20112546,  0.28365493, -0.07051025,
+           -0.14182746,  0.13844642,  0.80848895, -0.00511704, -0.06128522,
+           -0.0623881 , -0.12795188],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.09390619,  0.09390619,  0.09390619,  0.84133592,  0.84133592,
+            0.84133592,  0.28345353,  0.28345353,  0.28345353,  0.28345353,
+            0.28345353,  0.28345353],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.046308  ,  0.046308  ,  0.44026899,  0.03935169,  0.03935169,
+           -0.06267372,  0.04111073,  0.01143583,  0.04111073, -0.02619323,
+            0.01143583, -0.02619323],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.44026899,  0.046308  ,  0.046308  , -0.06267372,  0.03935169,
+            0.03935169, -0.02619323, -0.02619323,  0.01143583,  0.01143583,
+            0.04111073,  0.04111073],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.046308  ,  0.44026899,  0.046308  ,  0.03935169, -0.06267372,
+            0.03935169,  0.01143583,  0.04111073, -0.02619323,  0.04111073,
+           -0.02619323,  0.01143583],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.40225091, -0.20112546, -0.01452104,  0.28365493, -0.14182746,
+           -0.07051025,  0.80848895,  0.13844642, -0.06128522, -0.00511704,
+           -0.12795188, -0.0623881 ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.20112546,  0.40225091, -0.01452104, -0.14182746,  0.28365493,
+           -0.07051025, -0.06128522, -0.12795188,  0.80848895, -0.0623881 ,
+            0.13844642, -0.00511704],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.01452104, -0.20112546,  0.40225091, -0.07051025, -0.14182746,
+            0.28365493, -0.0623881 , -0.00511704, -0.12795188,  0.13844642,
+           -0.06128522,  0.80848895],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.01452104,  0.40225091, -0.20112546, -0.07051025,  0.28365493,
+           -0.14182746, -0.00511704, -0.0623881 ,  0.13844642, -0.12795188,
+            0.80848895, -0.06128522],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.20112546, -0.01452104,  0.40225091, -0.14182746, -0.07051025,
+            0.28365493, -0.12795188, -0.06128522, -0.0623881 ,  0.80848895,
+           -0.00511704,  0.13844642],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.40225091, -0.01452104, -0.20112546,  0.28365493, -0.07051025,
+           -0.14182746,  0.13844642,  0.80848895, -0.00511704, -0.06128522,
+           -0.0623881 , -0.12795188],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.09390619,  0.09390619,  0.09390619,  0.84133592,  0.84133592,
+            0.84133592,  0.28345353,  0.28345353,  0.28345353,  0.28345353,
+            0.28345353,  0.28345353],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.05512857, -0.05512857,  0.6533077 , -0.12499898, -0.12499898,
+            0.00143058, -0.04749626, -0.11771516, -0.04749626,  0.17376836,
+           -0.11771516,  0.17376836]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.6533077 , -0.05512857, -0.05512857,  0.00143058, -0.12499898,
+           -0.12499898,  0.17376836,  0.17376836, -0.11771516, -0.11771516,
+           -0.04749626, -0.04749626]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.05512857,  0.6533077 , -0.05512857, -0.12499898,  0.00143058,
+           -0.12499898, -0.11771516, -0.04749626,  0.17376836, -0.04749626,
+            0.17376836, -0.11771516]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.22051427,  0.22051427,  0.01592089,  0.49999593,  0.49999593,
+            0.24857553,  0.79016044,  0.13530783,  0.79016044,  0.06597479,
+            0.13530783,  0.06597479]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.01592089,  0.22051427,  0.22051427,  0.24857553,  0.49999593,
+            0.49999593,  0.06597479,  0.06597479,  0.13530783,  0.13530783,
+            0.79016044,  0.79016044]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.22051427,  0.01592089,  0.22051427,  0.49999593,  0.24857553,
+            0.49999593,  0.13530783,  0.79016044,  0.06597479,  0.79016044,
+            0.06597479,  0.13530783]]])}}}, MixedElement(*[VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[  7.47643942e-01,   7.47643942e-01,  -2.49528788e+00,
+             2.85301932e-03,   2.85301932e-03,  -1.00570604e+00,
+             7.87419801e-01,  -2.41409804e-01,   7.87419801e-01,
+            -1.54601000e+00,  -2.41409804e-01,  -1.54601000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.44089210e-16,  -4.44089210e-16,  -1.66533454e-16,
+            -1.11022302e-16,  -5.55111512e-17,  -1.66533454e-16,
+             1.24900090e-16,  -1.11022302e-16,   0.00000000e+00,
+            -1.11022302e-16,   5.55111512e-17,   6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -7.47643942e-01,   2.49528788e+00,  -7.47643942e-01,
+            -2.85301932e-03,   1.00570604e+00,  -2.85301932e-03,
+             2.41409804e-01,  -7.87419801e-01,   1.54601000e+00,
+            -7.87419801e-01,   1.54601000e+00,   2.41409804e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  3.49528788e+00,   2.52356058e-01,   2.52356058e-01,
+             2.00570604e+00,   9.97146981e-01,   9.97146981e-01,
+             2.54601000e+00,   2.54601000e+00,   1.24140980e+00,
+             1.24140980e+00,   2.12580199e-01,   2.12580199e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.22044605e-16,  -3.24293183e+00,   3.24293183e+00,
+             3.77475828e-15,  -1.00855906e+00,   1.00855906e+00,
+            -1.02882960e+00,   1.02882960e+00,  -2.33342980e+00,
+             2.33342980e+00,  -1.30460019e+00,   1.30460019e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.49528788e+00,  -2.52356058e-01,  -2.52356058e-01,
+            -2.00570604e+00,  -9.97146981e-01,  -9.97146981e-01,
+            -2.54601000e+00,  -2.54601000e+00,  -1.24140980e+00,
+            -1.24140980e+00,  -2.12580199e-01,  -2.12580199e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  7.47643942e-01,   7.47643942e-01,  -2.49528788e+00,
+             2.85301932e-03,   2.85301932e-03,  -1.00570604e+00,
+             7.87419801e-01,  -2.41409804e-01,   7.87419801e-01,
+            -1.54601000e+00,  -2.41409804e-01,  -1.54601000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.44089210e-16,  -4.44089210e-16,  -1.66533454e-16,
+            -1.11022302e-16,  -5.55111512e-17,  -1.66533454e-16,
+             1.24900090e-16,  -1.11022302e-16,   0.00000000e+00,
+            -1.11022302e-16,   5.55111512e-17,   6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -7.47643942e-01,   2.49528788e+00,  -7.47643942e-01,
+            -2.85301932e-03,   1.00570604e+00,  -2.85301932e-03,
+             2.41409804e-01,  -7.87419801e-01,   1.54601000e+00,
+            -7.87419801e-01,   1.54601000e+00,   2.41409804e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  3.49528788e+00,   2.52356058e-01,   2.52356058e-01,
+             2.00570604e+00,   9.97146981e-01,   9.97146981e-01,
+             2.54601000e+00,   2.54601000e+00,   1.24140980e+00,
+             1.24140980e+00,   2.12580199e-01,   2.12580199e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.22044605e-16,  -3.24293183e+00,   3.24293183e+00,
+             3.77475828e-15,  -1.00855906e+00,   1.00855906e+00,
+            -1.02882960e+00,   1.02882960e+00,  -2.33342980e+00,
+             2.33342980e+00,  -1.30460019e+00,   1.30460019e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.49528788e+00,  -2.52356058e-01,  -2.52356058e-01,
+            -2.00570604e+00,  -9.97146981e-01,  -9.97146981e-01,
+            -2.54601000e+00,  -2.54601000e+00,  -1.24140980e+00,
+            -1.24140980e+00,  -2.12580199e-01,  -2.12580199e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[  7.47643942e-01,   7.47643942e-01,  -2.49528788e+00,
+             2.85301932e-03,   2.85301932e-03,  -1.00570604e+00,
+             7.87419801e-01,  -2.41409804e-01,   7.87419801e-01,
+            -1.54601000e+00,  -2.41409804e-01,  -1.54601000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.49528788e+00,  -7.47643942e-01,  -7.47643942e-01,
+             1.00570604e+00,  -2.85301932e-03,  -2.85301932e-03,
+             1.54601000e+00,   1.54601000e+00,   2.41409804e-01,
+             2.41409804e-01,  -7.87419801e-01,  -7.87419801e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.52356058e-01,   3.49528788e+00,   2.52356058e-01,
+             9.97146981e-01,   2.00570604e+00,   9.97146981e-01,
+             1.24140980e+00,   2.12580199e-01,   2.54601000e+00,
+             2.12580199e-01,   2.54601000e+00,   1.24140980e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.52356058e-01,  -3.49528788e+00,  -2.52356058e-01,
+            -9.97146981e-01,  -2.00570604e+00,  -9.97146981e-01,
+            -1.24140980e+00,  -2.12580199e-01,  -2.54601000e+00,
+            -2.12580199e-01,  -2.54601000e+00,  -1.24140980e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.24293183e+00,  -1.09888393e-15,   3.24293183e+00,
+            -1.00855906e+00,   3.57248574e-15,   1.00855906e+00,
+            -2.33342980e+00,  -1.30460019e+00,  -1.02882960e+00,
+             1.30460019e+00,   1.02882960e+00,   2.33342980e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  7.47643942e-01,   7.47643942e-01,  -2.49528788e+00,
+             2.85301932e-03,   2.85301932e-03,  -1.00570604e+00,
+             7.87419801e-01,  -2.41409804e-01,   7.87419801e-01,
+            -1.54601000e+00,  -2.41409804e-01,  -1.54601000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.49528788e+00,  -7.47643942e-01,  -7.47643942e-01,
+             1.00570604e+00,  -2.85301932e-03,  -2.85301932e-03,
+             1.54601000e+00,   1.54601000e+00,   2.41409804e-01,
+             2.41409804e-01,  -7.87419801e-01,  -7.87419801e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.52356058e-01,   3.49528788e+00,   2.52356058e-01,
+             9.97146981e-01,   2.00570604e+00,   9.97146981e-01,
+             1.24140980e+00,   2.12580199e-01,   2.54601000e+00,
+             2.12580199e-01,   2.54601000e+00,   1.24140980e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.52356058e-01,  -3.49528788e+00,  -2.52356058e-01,
+            -9.97146981e-01,  -2.00570604e+00,  -9.97146981e-01,
+            -1.24140980e+00,  -2.12580199e-01,  -2.54601000e+00,
+            -2.12580199e-01,  -2.54601000e+00,  -1.24140980e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -3.24293183e+00,  -1.09888393e-15,   3.24293183e+00,
+            -1.00855906e+00,   3.57248574e-15,   1.00855906e+00,
+            -2.33342980e+00,  -1.30460019e+00,  -1.02882960e+00,
+             1.30460019e+00,   1.02882960e+00,   2.33342980e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]]), (0, 0): array([[[-0.05512857, -0.05512857,  0.6533077 , -0.12499898, -0.12499898,
+            0.00143058, -0.04749626, -0.11771516, -0.04749626,  0.17376836,
+           -0.11771516,  0.17376836],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.6533077 , -0.05512857, -0.05512857,  0.00143058, -0.12499898,
+           -0.12499898,  0.17376836,  0.17376836, -0.11771516, -0.11771516,
+           -0.04749626, -0.04749626],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.05512857,  0.6533077 , -0.05512857, -0.12499898,  0.00143058,
+           -0.12499898, -0.11771516, -0.04749626,  0.17376836, -0.04749626,
+            0.17376836, -0.11771516],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.22051427,  0.22051427,  0.01592089,  0.49999593,  0.49999593,
+            0.24857553,  0.79016044,  0.13530783,  0.79016044,  0.06597479,
+            0.13530783,  0.06597479],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.01592089,  0.22051427,  0.22051427,  0.24857553,  0.49999593,
+            0.49999593,  0.06597479,  0.06597479,  0.13530783,  0.13530783,
+            0.79016044,  0.79016044],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.22051427,  0.01592089,  0.22051427,  0.49999593,  0.24857553,
+            0.49999593,  0.13530783,  0.79016044,  0.06597479,  0.79016044,
+            0.06597479,  0.13530783],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.05512857, -0.05512857,  0.6533077 , -0.12499898, -0.12499898,
+            0.00143058, -0.04749626, -0.11771516, -0.04749626,  0.17376836,
+           -0.11771516,  0.17376836],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.6533077 , -0.05512857, -0.05512857,  0.00143058, -0.12499898,
+           -0.12499898,  0.17376836,  0.17376836, -0.11771516, -0.11771516,
+           -0.04749626, -0.04749626],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.05512857,  0.6533077 , -0.05512857, -0.12499898,  0.00143058,
+           -0.12499898, -0.11771516, -0.04749626,  0.17376836, -0.04749626,
+            0.17376836, -0.11771516],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.22051427,  0.22051427,  0.01592089,  0.49999593,  0.49999593,
+            0.24857553,  0.79016044,  0.13530783,  0.79016044,  0.06597479,
+            0.13530783,  0.06597479],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.01592089,  0.22051427,  0.22051427,  0.24857553,  0.49999593,
+            0.49999593,  0.06597479,  0.06597479,  0.13530783,  0.13530783,
+            0.79016044,  0.79016044],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.22051427,  0.01592089,  0.22051427,  0.49999593,  0.24857553,
+            0.49999593,  0.13530783,  0.79016044,  0.06597479,  0.79016044,
+            0.06597479,  0.13530783],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.06308901,  0.06308901,  0.87382197,  0.24928675,  0.24928675,
+            0.50142651,  0.05314505,  0.31035245,  0.05314505,  0.6365025 ,
+            0.31035245,  0.6365025 ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.87382197,  0.06308901,  0.06308901,  0.50142651,  0.24928675,
+            0.24928675,  0.6365025 ,  0.6365025 ,  0.31035245,  0.31035245,
+            0.05314505,  0.05314505]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.06308901,  0.87382197,  0.06308901,  0.24928675,  0.50142651,
+            0.24928675,  0.31035245,  0.05314505,  0.6365025 ,  0.05314505,
+            0.6365025 ,  0.31035245]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.06308901,  0.06308901,  0.87382197,  0.24928675,  0.24928675,
+            0.50142651,  0.05314505,  0.31035245,  0.05314505,  0.6365025 ,
+            0.31035245,  0.6365025 ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.87382197,  0.06308901,  0.06308901,  0.50142651,  0.24928675,
+            0.24928675,  0.6365025 ,  0.6365025 ,  0.31035245,  0.31035245,
+            0.05314505,  0.05314505],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.06308901,  0.87382197,  0.06308901,  0.24928675,  0.50142651,
+            0.24928675,  0.31035245,  0.05314505,  0.6365025 ,  0.05314505,
+            0.6365025 ,  0.31035245],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.06308901,  0.06308901,  0.87382197,  0.24928675,  0.24928675,
+            0.50142651,  0.05314505,  0.31035245,  0.05314505,  0.6365025 ,
+            0.31035245,  0.6365025 ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.87382197,  0.06308901,  0.06308901,  0.50142651,  0.24928675,
+            0.24928675,  0.6365025 ,  0.6365025 ,  0.31035245,  0.31035245,
+            0.05314505,  0.05314505]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.06308901,  0.87382197,  0.06308901,  0.24928675,  0.50142651,
+            0.24928675,  0.31035245,  0.05314505,  0.6365025 ,  0.05314505,
+            0.6365025 ,  0.31035245]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.85931890e-01,   8.88178420e-16,
+            4.85931890e-01,   6.37592643e+00,  -2.44372756e+00,
+           -5.37330206e-02,   5.37330206e-02,   2.44372756e+00,
+           -6.37592643e+00,   2.66453526e-15,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.85931890e-01,  -5.55111512e-16,
+            3.44372756e+00,  -2.30167545e-01,   1.20457074e+00,
+            2.21356002e+00,  -5.17135569e+00,   1.76434524e-01,
+            2.30167545e-01,  -1.38100527e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -3.44372756e+00,   3.33066907e-16,
+            4.85931890e-01,  -2.30167545e-01,  -1.76434524e-01,
+            5.17135569e+00,  -2.21356002e+00,  -1.20457074e+00,
+            2.30167545e-01,   1.38100527e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.04638309e-01,   2.18575158e-16,
+           -4.04638309e-01,   1.13786606e+00,   1.11855323e+00,
+           -8.38942398e-01,   8.38942398e-01,  -1.11855323e+00,
+           -1.13786606e+00,   1.14908083e-14,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.04638309e-01,  -1.38777878e-17,
+           -1.18553235e-01,  -2.82847955e-01,   2.25318218e+00,
+           -1.40140119e+00,   1.11531612e+00,  -5.56094442e-01,
+            2.82847955e-01,  -1.69708773e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.18553235e-01,   9.71445147e-17,
+           -4.04638309e-01,  -2.82847955e-01,   5.56094442e-01,
+           -1.11531612e+00,   1.40140119e+00,  -2.25318218e+00,
+            2.82847955e-01,   1.69708773e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -5.59823902e-01,   3.33066907e-16,
+           -4.92870367e-01,   2.60506708e+00,   2.46932174e+00,
+            7.50232851e-01,   3.02461418e-01,   1.95093341e+00,
+           -2.60506708e+00,  -4.42025515e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.92870367e-01,  -1.66533454e-16,
+            5.59823902e-01,   2.60506708e+00,  -1.95093341e+00,
+           -3.02461418e-01,  -7.50232851e-01,  -2.46932174e+00,
+           -2.60506708e+00,   4.42025515e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -5.59823902e-01,  -2.13370988e-16,
+            7.40805832e-01,  -9.62843375e-02,   3.93699696e+00,
+            1.74991003e+00,  -1.93089196e+00,   9.51256225e-01,
+            9.62843375e-02,  -4.88825318e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -7.40805832e-01,  -2.77555756e-16,
+            5.59823902e-01,  -9.62843375e-02,  -9.51256225e-01,
+            1.93089196e+00,  -1.74991003e+00,  -3.93699696e+00,
+            9.62843375e-02,   4.88825318e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.92870367e-01,  -3.98986399e-17,
+            7.40805832e-01,  -2.01023374e-01,   6.74175116e-01,
+           -2.56560608e+00,   1.33192988e+00,  -2.06177081e-01,
+            2.01023374e-01,  -4.67998035e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -7.40805832e-01,   2.63677968e-16,
+           -4.92870367e-01,  -2.01023374e-01,   2.06177081e-01,
+           -1.33192988e+00,   2.56560608e+00,  -6.74175116e-01,
+            2.01023374e-01,   4.67998035e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_C2_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.47643942e-01,
+            2.49528788e+00,   0.00000000e+00,   2.52356058e-01,
+           -2.52356058e-01,  -3.24293183e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.47643942e-01,
+           -7.47643942e-01,   0.00000000e+00,   3.49528788e+00,
+           -3.49528788e+00,  -1.09888393e-15],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.49528788e+00,
+           -7.47643942e-01,   0.00000000e+00,   2.52356058e-01,
+           -2.52356058e-01,   3.24293183e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   2.85301932e-03,
+            1.00570604e+00,   0.00000000e+00,   9.97146981e-01,
+           -9.97146981e-01,  -1.00855906e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   2.85301932e-03,
+           -2.85301932e-03,   0.00000000e+00,   2.00570604e+00,
+           -2.00570604e+00,   3.57248574e-15],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00570604e+00,
+           -2.85301932e-03,   0.00000000e+00,   9.97146981e-01,
+           -9.97146981e-01,   1.00855906e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.87419801e-01,
+            1.54601000e+00,   0.00000000e+00,   1.24140980e+00,
+           -1.24140980e+00,  -2.33342980e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.41409804e-01,
+            1.54601000e+00,   0.00000000e+00,   2.12580199e-01,
+           -2.12580199e-01,  -1.30460019e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.87419801e-01,
+            2.41409804e-01,   0.00000000e+00,   2.54601000e+00,
+           -2.54601000e+00,  -1.02882960e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.54601000e+00,
+            2.41409804e-01,   0.00000000e+00,   2.12580199e-01,
+           -2.12580199e-01,   1.30460019e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.41409804e-01,
+           -7.87419801e-01,   0.00000000e+00,   2.54601000e+00,
+           -2.54601000e+00,   1.02882960e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.54601000e+00,
+           -7.87419801e-01,   0.00000000e+00,   1.24140980e+00,
+           -1.24140980e+00,   2.33342980e+00]]), 'FE1_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.47643942e-01,   2.49528788e+00,   0.00000000e+00,
+            2.52356058e-01,  -2.52356058e-01,  -3.24293183e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.47643942e-01,  -7.47643942e-01,   0.00000000e+00,
+            3.49528788e+00,  -3.49528788e+00,  -1.09888393e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.49528788e+00,  -7.47643942e-01,   0.00000000e+00,
+            2.52356058e-01,  -2.52356058e-01,   3.24293183e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.85301932e-03,   1.00570604e+00,   0.00000000e+00,
+            9.97146981e-01,  -9.97146981e-01,  -1.00855906e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.85301932e-03,  -2.85301932e-03,   0.00000000e+00,
+            2.00570604e+00,  -2.00570604e+00,   3.57248574e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00570604e+00,  -2.85301932e-03,   0.00000000e+00,
+            9.97146981e-01,  -9.97146981e-01,   1.00855906e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.87419801e-01,   1.54601000e+00,   0.00000000e+00,
+            1.24140980e+00,  -1.24140980e+00,  -2.33342980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.41409804e-01,   1.54601000e+00,   0.00000000e+00,
+            2.12580199e-01,  -2.12580199e-01,  -1.30460019e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.87419801e-01,   2.41409804e-01,   0.00000000e+00,
+            2.54601000e+00,  -2.54601000e+00,  -1.02882960e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.54601000e+00,   2.41409804e-01,   0.00000000e+00,
+            2.12580199e-01,  -2.12580199e-01,   1.30460019e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.41409804e-01,  -7.87419801e-01,   0.00000000e+00,
+            2.54601000e+00,  -2.54601000e+00,   1.02882960e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.54601000e+00,  -7.87419801e-01,   0.00000000e+00,
+            1.24140980e+00,  -1.24140980e+00,   2.33342980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE2_C0_D01': array([[ -4.85931890e-01,   8.88178420e-16,   4.85931890e-01,
+            6.37592643e+00,  -2.44372756e+00,  -5.37330206e-02,
+            5.37330206e-02,   2.44372756e+00,  -6.37592643e+00,
+            2.66453526e-15,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -4.85931890e-01,  -5.55111512e-16,   3.44372756e+00,
+           -2.30167545e-01,   1.20457074e+00,   2.21356002e+00,
+           -5.17135569e+00,   1.76434524e-01,   2.30167545e-01,
+           -1.38100527e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -3.44372756e+00,   3.33066907e-16,   4.85931890e-01,
+           -2.30167545e-01,  -1.76434524e-01,   5.17135569e+00,
+           -2.21356002e+00,  -1.20457074e+00,   2.30167545e-01,
+            1.38100527e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.04638309e-01,   2.18575158e-16,  -4.04638309e-01,
+            1.13786606e+00,   1.11855323e+00,  -8.38942398e-01,
+            8.38942398e-01,  -1.11855323e+00,  -1.13786606e+00,
+            1.14908083e-14,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.04638309e-01,  -1.38777878e-17,  -1.18553235e-01,
+           -2.82847955e-01,   2.25318218e+00,  -1.40140119e+00,
+            1.11531612e+00,  -5.56094442e-01,   2.82847955e-01,
+           -1.69708773e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.18553235e-01,   9.71445147e-17,  -4.04638309e-01,
+           -2.82847955e-01,   5.56094442e-01,  -1.11531612e+00,
+            1.40140119e+00,  -2.25318218e+00,   2.82847955e-01,
+            1.69708773e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -5.59823902e-01,   3.33066907e-16,  -4.92870367e-01,
+            2.60506708e+00,   2.46932174e+00,   7.50232851e-01,
+            3.02461418e-01,   1.95093341e+00,  -2.60506708e+00,
+           -4.42025515e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.92870367e-01,  -1.66533454e-16,   5.59823902e-01,
+            2.60506708e+00,  -1.95093341e+00,  -3.02461418e-01,
+           -7.50232851e-01,  -2.46932174e+00,  -2.60506708e+00,
+            4.42025515e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -5.59823902e-01,  -2.13370988e-16,   7.40805832e-01,
+           -9.62843375e-02,   3.93699696e+00,   1.74991003e+00,
+           -1.93089196e+00,   9.51256225e-01,   9.62843375e-02,
+           -4.88825318e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -7.40805832e-01,  -2.77555756e-16,   5.59823902e-01,
+           -9.62843375e-02,  -9.51256225e-01,   1.93089196e+00,
+           -1.74991003e+00,  -3.93699696e+00,   9.62843375e-02,
+            4.88825318e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.92870367e-01,  -3.98986399e-17,   7.40805832e-01,
+           -2.01023374e-01,   6.74175116e-01,  -2.56560608e+00,
+            1.33192988e+00,  -2.06177081e-01,   2.01023374e-01,
+           -4.67998035e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -7.40805832e-01,   2.63677968e-16,  -4.92870367e-01,
+           -2.01023374e-01,   2.06177081e-01,  -1.33192988e+00,
+            2.56560608e+00,  -6.74175116e-01,   2.01023374e-01,
+            4.67998035e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.046308  ,  0.44026899,  0.046308  ,  0.40225091, -0.20112546,
+          -0.01452104, -0.01452104, -0.20112546,  0.40225091,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.046308  ,  0.046308  ,  0.44026899, -0.20112546,  0.40225091,
+          -0.20112546,  0.40225091, -0.01452104, -0.01452104,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.44026899,  0.046308  ,  0.046308  , -0.01452104, -0.01452104,
+           0.40225091, -0.20112546,  0.40225091, -0.20112546,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.03935169, -0.06267372,  0.03935169,  0.28365493, -0.14182746,
+          -0.07051025, -0.07051025, -0.14182746,  0.28365493,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.03935169,  0.03935169, -0.06267372, -0.14182746,  0.28365493,
+          -0.14182746,  0.28365493, -0.07051025, -0.07051025,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.06267372,  0.03935169,  0.03935169, -0.07051025, -0.07051025,
+           0.28365493, -0.14182746,  0.28365493, -0.14182746,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.04111073, -0.02619323,  0.01143583,  0.80848895, -0.06128522,
+          -0.0623881 , -0.00511704, -0.12795188,  0.13844642,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.01143583, -0.02619323,  0.04111073,  0.13844642, -0.12795188,
+          -0.00511704, -0.0623881 , -0.06128522,  0.80848895,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.04111073,  0.01143583, -0.02619323, -0.06128522,  0.80848895,
+          -0.12795188,  0.13844642, -0.0623881 , -0.00511704,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.02619323,  0.01143583,  0.04111073, -0.00511704, -0.0623881 ,
+           0.13844642, -0.12795188,  0.80848895, -0.06128522,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.01143583,  0.04111073, -0.02619323, -0.12795188,  0.13844642,
+          -0.06128522,  0.80848895, -0.00511704, -0.0623881 ,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.02619323,  0.04111073,  0.01143583, -0.0623881 , -0.00511704,
+           0.80848895, -0.06128522,  0.13844642, -0.12795188,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE2_C0': array([[ 0.046308  ,  0.44026899,  0.046308  ,  0.40225091, -0.20112546,
+          -0.01452104, -0.01452104, -0.20112546,  0.40225091,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.046308  ,  0.046308  ,  0.44026899, -0.20112546,  0.40225091,
+          -0.20112546,  0.40225091, -0.01452104, -0.01452104,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44026899,  0.046308  ,  0.046308  , -0.01452104, -0.01452104,
+           0.40225091, -0.20112546,  0.40225091, -0.20112546,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.03935169, -0.06267372,  0.03935169,  0.28365493, -0.14182746,
+          -0.07051025, -0.07051025, -0.14182746,  0.28365493,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.03935169,  0.03935169, -0.06267372, -0.14182746,  0.28365493,
+          -0.14182746,  0.28365493, -0.07051025, -0.07051025,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [-0.06267372,  0.03935169,  0.03935169, -0.07051025, -0.07051025,
+           0.28365493, -0.14182746,  0.28365493, -0.14182746,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04111073, -0.02619323,  0.01143583,  0.80848895, -0.06128522,
+          -0.0623881 , -0.00511704, -0.12795188,  0.13844642,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.01143583, -0.02619323,  0.04111073,  0.13844642, -0.12795188,
+          -0.00511704, -0.0623881 , -0.06128522,  0.80848895,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04111073,  0.01143583, -0.02619323, -0.06128522,  0.80848895,
+          -0.12795188,  0.13844642, -0.0623881 , -0.00511704,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [-0.02619323,  0.01143583,  0.04111073, -0.00511704, -0.0623881 ,
+           0.13844642, -0.12795188,  0.80848895, -0.06128522,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.01143583,  0.04111073, -0.02619323, -0.12795188,  0.13844642,
+          -0.06128522,  0.80848895, -0.00511704, -0.0623881 ,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [-0.02619323,  0.04111073,  0.01143583, -0.0623881 , -0.00511704,
+           0.80848895, -0.06128522,  0.13844642, -0.12795188,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.05512857,  0.6533077 , -0.05512857,  0.22051427,  0.01592089,
+           0.22051427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.05512857, -0.05512857,  0.6533077 ,  0.22051427,  0.22051427,
+           0.01592089],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.6533077 , -0.05512857, -0.05512857,  0.01592089,  0.22051427,
+           0.22051427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.12499898,  0.00143058, -0.12499898,  0.49999593,  0.24857553,
+           0.49999593],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.12499898, -0.12499898,  0.00143058,  0.49999593,  0.49999593,
+           0.24857553],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.00143058, -0.12499898, -0.12499898,  0.24857553,  0.49999593,
+           0.49999593],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.04749626,  0.17376836, -0.11771516,  0.79016044,  0.06597479,
+           0.13530783],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.11771516,  0.17376836, -0.04749626,  0.13530783,  0.06597479,
+           0.79016044],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.04749626, -0.11771516,  0.17376836,  0.79016044,  0.13530783,
+           0.06597479],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.17376836, -0.11771516, -0.04749626,  0.06597479,  0.13530783,
+           0.79016044],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.11771516, -0.04749626,  0.17376836,  0.13530783,  0.79016044,
+           0.06597479],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.17376836, -0.04749626, -0.11771516,  0.06597479,  0.79016044,
+           0.13530783]]), 'FE3': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C0_D01': array([[  7.47643942e-01,   4.44089210e-16,  -7.47643942e-01,
+            3.49528788e+00,   2.22044605e-16,  -3.49528788e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.47643942e-01,  -4.44089210e-16,   2.49528788e+00,
+            2.52356058e-01,  -3.24293183e+00,  -2.52356058e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.49528788e+00,  -1.66533454e-16,  -7.47643942e-01,
+            2.52356058e-01,   3.24293183e+00,  -2.52356058e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.85301932e-03,  -1.11022302e-16,  -2.85301932e-03,
+            2.00570604e+00,   3.77475828e-15,  -2.00570604e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.85301932e-03,  -5.55111512e-17,   1.00570604e+00,
+            9.97146981e-01,  -1.00855906e+00,  -9.97146981e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00570604e+00,  -1.66533454e-16,  -2.85301932e-03,
+            9.97146981e-01,   1.00855906e+00,  -9.97146981e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.87419801e-01,   1.24900090e-16,   2.41409804e-01,
+            2.54601000e+00,  -1.02882960e+00,  -2.54601000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.41409804e-01,  -1.11022302e-16,  -7.87419801e-01,
+            2.54601000e+00,   1.02882960e+00,  -2.54601000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.87419801e-01,   0.00000000e+00,   1.54601000e+00,
+            1.24140980e+00,  -2.33342980e+00,  -1.24140980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.54601000e+00,  -1.11022302e-16,  -7.87419801e-01,
+            1.24140980e+00,   2.33342980e+00,  -1.24140980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.41409804e-01,   5.55111512e-17,   1.54601000e+00,
+            2.12580199e-01,  -1.30460019e+00,  -2.12580199e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.54601000e+00,   6.93889390e-17,   2.41409804e-01,
+            2.12580199e-01,   1.30460019e+00,  -2.12580199e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.06308901,  0.87382197,
+           0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.06308901,  0.06308901,
+           0.87382197],
+         [ 0.        ,  0.        ,  0.        ,  0.87382197,  0.06308901,
+           0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.24928675,  0.50142651,
+           0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.24928675,  0.24928675,
+           0.50142651],
+         [ 0.        ,  0.        ,  0.        ,  0.50142651,  0.24928675,
+           0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.05314505,  0.6365025 ,
+           0.31035245],
+         [ 0.        ,  0.        ,  0.        ,  0.31035245,  0.6365025 ,
+           0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.05314505,  0.31035245,
+           0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.6365025 ,  0.31035245,
+           0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.31035245,  0.05314505,
+           0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.6365025 ,  0.05314505,
+           0.31035245]]), 'FE0_C0': array([[ 0.06308901,  0.87382197,  0.06308901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.06308901,  0.06308901,  0.87382197,  0.        ,  0.        ,
+           0.        ],
+         [ 0.87382197,  0.06308901,  0.06308901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.24928675,  0.50142651,  0.24928675,  0.        ,  0.        ,
+           0.        ],
+         [ 0.24928675,  0.24928675,  0.50142651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.50142651,  0.24928675,  0.24928675,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05314505,  0.6365025 ,  0.31035245,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31035245,  0.6365025 ,  0.05314505,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05314505,  0.31035245,  0.6365025 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.6365025 ,  0.31035245,  0.05314505,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31035245,  0.05314505,  0.6365025 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.6365025 ,  0.05314505,  0.31035245,  0.        ,  0.        ,
+           0.        ]]), 'FE2_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.85931890e-01,   3.44372756e+00,
+           -1.38645914e-17,   1.20457074e+00,  -2.30167545e-01,
+            1.76434524e-01,   2.30167545e-01,   2.21356002e+00,
+           -5.17135569e+00,  -1.38100527e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.85931890e-01,   4.85931890e-01,
+            3.35148811e-16,  -2.44372756e+00,   6.37592643e+00,
+            2.44372756e+00,  -6.37592643e+00,  -5.37330206e-02,
+            5.37330206e-02,  -6.43415175e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -3.44372756e+00,   4.85931890e-01,
+           -9.23566062e-17,  -1.76434524e-01,  -2.30167545e-01,
+           -1.20457074e+00,   2.30167545e-01,   5.17135569e+00,
+           -2.21356002e+00,   1.38100527e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.04638309e-01,  -1.18553235e-01,
+           -3.90397186e-17,   2.25318218e+00,  -2.82847955e-01,
+           -5.56094442e-01,   2.82847955e-01,  -1.40140119e+00,
+            1.11531612e+00,  -1.69708773e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.04638309e-01,  -4.04638309e-01,
+           -3.69822127e-17,   1.11855323e+00,   1.13786606e+00,
+           -1.11855323e+00,  -1.13786606e+00,  -8.38942398e-01,
+            8.38942398e-01,   1.51461450e-14,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.18553235e-01,  -4.04638309e-01,
+           -1.47889501e-16,   5.56094442e-01,  -2.82847955e-01,
+           -2.25318218e+00,   2.82847955e-01,  -1.11531612e+00,
+            1.40140119e+00,   1.69708773e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -5.59823902e-01,   7.40805832e-01,
+            5.25620294e-17,   3.93699696e+00,  -9.62843375e-02,
+            9.51256225e-01,   9.62843375e-02,   1.74991003e+00,
+           -1.93089196e+00,  -4.88825318e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.92870367e-01,   7.40805832e-01,
+           -1.38022087e-17,   6.74175116e-01,  -2.01023374e-01,
+           -2.06177081e-01,   2.01023374e-01,  -2.56560608e+00,
+            1.33192988e+00,  -4.67998035e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -5.59823902e-01,  -4.92870367e-01,
+            2.00322990e-16,   2.46932174e+00,   2.60506708e+00,
+            1.95093341e+00,  -2.60506708e+00,   7.50232851e-01,
+            3.02461418e-01,  -4.42025515e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -7.40805832e-01,  -4.92870367e-01,
+           -3.95456510e-17,   2.06177081e-01,  -2.01023374e-01,
+           -6.74175116e-01,   2.01023374e-01,  -1.33192988e+00,
+            2.56560608e+00,   4.67998035e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.92870367e-01,   5.59823902e-01,
+           -8.98417888e-17,  -1.95093341e+00,   2.60506708e+00,
+           -2.46932174e+00,  -2.60506708e+00,  -3.02461418e-01,
+           -7.50232851e-01,   4.42025515e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -7.40805832e-01,   5.59823902e-01,
+           -2.63346192e-16,  -9.51256225e-01,  -9.62843375e-02,
+           -3.93699696e+00,   9.62843375e-02,   1.93089196e+00,
+           -1.74991003e+00,   4.88825318e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.47643942e-01,   4.44089210e-16,  -7.47643942e-01,
+            3.49528788e+00,   2.22044605e-16,  -3.49528788e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.47643942e-01,  -4.44089210e-16,   2.49528788e+00,
+            2.52356058e-01,  -3.24293183e+00,  -2.52356058e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.49528788e+00,  -1.66533454e-16,  -7.47643942e-01,
+            2.52356058e-01,   3.24293183e+00,  -2.52356058e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.85301932e-03,  -1.11022302e-16,  -2.85301932e-03,
+            2.00570604e+00,   3.77475828e-15,  -2.00570604e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.85301932e-03,  -5.55111512e-17,   1.00570604e+00,
+            9.97146981e-01,  -1.00855906e+00,  -9.97146981e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00570604e+00,  -1.66533454e-16,  -2.85301932e-03,
+            9.97146981e-01,   1.00855906e+00,  -9.97146981e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.87419801e-01,   1.24900090e-16,   2.41409804e-01,
+            2.54601000e+00,  -1.02882960e+00,  -2.54601000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.41409804e-01,  -1.11022302e-16,  -7.87419801e-01,
+            2.54601000e+00,   1.02882960e+00,  -2.54601000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.87419801e-01,   0.00000000e+00,   1.54601000e+00,
+            1.24140980e+00,  -2.33342980e+00,  -1.24140980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.54601000e+00,  -1.11022302e-16,  -7.87419801e-01,
+            1.24140980e+00,   2.33342980e+00,  -1.24140980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.41409804e-01,   5.55111512e-17,   1.54601000e+00,
+            2.12580199e-01,  -1.30460019e+00,  -2.12580199e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.54601000e+00,   6.93889390e-17,   2.41409804e-01,
+            2.12580199e-01,   1.30460019e+00,  -2.12580199e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.47643942e-01,
+            4.44089210e-16,  -7.47643942e-01,   3.49528788e+00,
+            2.22044605e-16,  -3.49528788e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.47643942e-01,
+           -4.44089210e-16,   2.49528788e+00,   2.52356058e-01,
+           -3.24293183e+00,  -2.52356058e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.49528788e+00,
+           -1.66533454e-16,  -7.47643942e-01,   2.52356058e-01,
+            3.24293183e+00,  -2.52356058e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   2.85301932e-03,
+           -1.11022302e-16,  -2.85301932e-03,   2.00570604e+00,
+            3.77475828e-15,  -2.00570604e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   2.85301932e-03,
+           -5.55111512e-17,   1.00570604e+00,   9.97146981e-01,
+           -1.00855906e+00,  -9.97146981e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00570604e+00,
+           -1.66533454e-16,  -2.85301932e-03,   9.97146981e-01,
+            1.00855906e+00,  -9.97146981e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.87419801e-01,
+            1.24900090e-16,   2.41409804e-01,   2.54601000e+00,
+           -1.02882960e+00,  -2.54601000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.41409804e-01,
+           -1.11022302e-16,  -7.87419801e-01,   2.54601000e+00,
+            1.02882960e+00,  -2.54601000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.87419801e-01,
+            0.00000000e+00,   1.54601000e+00,   1.24140980e+00,
+           -2.33342980e+00,  -1.24140980e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.54601000e+00,
+           -1.11022302e-16,  -7.87419801e-01,   1.24140980e+00,
+            2.33342980e+00,  -1.24140980e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.41409804e-01,
+            5.55111512e-17,   1.54601000e+00,   2.12580199e-01,
+           -1.30460019e+00,  -2.12580199e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.54601000e+00,
+            6.93889390e-17,   2.41409804e-01,   2.12580199e-01,
+            1.30460019e+00,  -2.12580199e-01]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.]]), 'FE2_C0_D10': array([[ -4.85931890e-01,   3.44372756e+00,  -1.38645914e-17,
+            1.20457074e+00,  -2.30167545e-01,   1.76434524e-01,
+            2.30167545e-01,   2.21356002e+00,  -5.17135569e+00,
+           -1.38100527e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -4.85931890e-01,   4.85931890e-01,   3.35148811e-16,
+           -2.44372756e+00,   6.37592643e+00,   2.44372756e+00,
+           -6.37592643e+00,  -5.37330206e-02,   5.37330206e-02,
+           -6.43415175e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -3.44372756e+00,   4.85931890e-01,  -9.23566062e-17,
+           -1.76434524e-01,  -2.30167545e-01,  -1.20457074e+00,
+            2.30167545e-01,   5.17135569e+00,  -2.21356002e+00,
+            1.38100527e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.04638309e-01,  -1.18553235e-01,  -3.90397186e-17,
+            2.25318218e+00,  -2.82847955e-01,  -5.56094442e-01,
+            2.82847955e-01,  -1.40140119e+00,   1.11531612e+00,
+           -1.69708773e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.04638309e-01,  -4.04638309e-01,  -3.69822127e-17,
+            1.11855323e+00,   1.13786606e+00,  -1.11855323e+00,
+           -1.13786606e+00,  -8.38942398e-01,   8.38942398e-01,
+            1.51461450e-14,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.18553235e-01,  -4.04638309e-01,  -1.47889501e-16,
+            5.56094442e-01,  -2.82847955e-01,  -2.25318218e+00,
+            2.82847955e-01,  -1.11531612e+00,   1.40140119e+00,
+            1.69708773e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -5.59823902e-01,   7.40805832e-01,   5.25620294e-17,
+            3.93699696e+00,  -9.62843375e-02,   9.51256225e-01,
+            9.62843375e-02,   1.74991003e+00,  -1.93089196e+00,
+           -4.88825318e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.92870367e-01,   7.40805832e-01,  -1.38022087e-17,
+            6.74175116e-01,  -2.01023374e-01,  -2.06177081e-01,
+            2.01023374e-01,  -2.56560608e+00,   1.33192988e+00,
+           -4.67998035e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -5.59823902e-01,  -4.92870367e-01,   2.00322990e-16,
+            2.46932174e+00,   2.60506708e+00,   1.95093341e+00,
+           -2.60506708e+00,   7.50232851e-01,   3.02461418e-01,
+           -4.42025515e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -7.40805832e-01,  -4.92870367e-01,  -3.95456510e-17,
+            2.06177081e-01,  -2.01023374e-01,  -6.74175116e-01,
+            2.01023374e-01,  -1.33192988e+00,   2.56560608e+00,
+            4.67998035e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.92870367e-01,   5.59823902e-01,  -8.98417888e-17,
+           -1.95093341e+00,   2.60506708e+00,  -2.46932174e+00,
+           -2.60506708e+00,  -3.02461418e-01,  -7.50232851e-01,
+            4.42025515e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -7.40805832e-01,   5.59823902e-01,  -2.63346192e-16,
+           -9.51256225e-01,  -9.62843375e-02,  -3.93699696e+00,
+            9.62843375e-02,   1.93089196e+00,  -1.74991003e+00,
+            4.88825318e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[-0.05512857,  0.6533077 , -0.05512857,  0.22051427,  0.01592089,
+           0.22051427,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.05512857, -0.05512857,  0.6533077 ,  0.22051427,  0.22051427,
+           0.01592089,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.6533077 , -0.05512857, -0.05512857,  0.01592089,  0.22051427,
+           0.22051427,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12499898,  0.00143058, -0.12499898,  0.49999593,  0.24857553,
+           0.49999593,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12499898, -0.12499898,  0.00143058,  0.49999593,  0.49999593,
+           0.24857553,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.00143058, -0.12499898, -0.12499898,  0.24857553,  0.49999593,
+           0.49999593,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04749626,  0.17376836, -0.11771516,  0.79016044,  0.06597479,
+           0.13530783,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11771516,  0.17376836, -0.04749626,  0.13530783,  0.06597479,
+           0.79016044,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04749626, -0.11771516,  0.17376836,  0.79016044,  0.13530783,
+           0.06597479,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.17376836, -0.11771516, -0.04749626,  0.06597479,  0.13530783,
+           0.79016044,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11771516, -0.04749626,  0.17376836,  0.13530783,  0.79016044,
+           0.06597479,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.17376836, -0.04749626, -0.11771516,  0.06597479,  0.79016044,
+           0.13530783,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05512857,  0.6533077 , -0.05512857,  0.22051427,
+           0.01592089,  0.22051427,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05512857, -0.05512857,  0.6533077 ,  0.22051427,
+           0.22051427,  0.01592089,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.6533077 , -0.05512857, -0.05512857,  0.01592089,
+           0.22051427,  0.22051427,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12499898,  0.00143058, -0.12499898,  0.49999593,
+           0.24857553,  0.49999593,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12499898, -0.12499898,  0.00143058,  0.49999593,
+           0.49999593,  0.24857553,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.00143058, -0.12499898, -0.12499898,  0.24857553,
+           0.49999593,  0.49999593,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04749626,  0.17376836, -0.11771516,  0.79016044,
+           0.06597479,  0.13530783,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11771516,  0.17376836, -0.04749626,  0.13530783,
+           0.06597479,  0.79016044,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04749626, -0.11771516,  0.17376836,  0.79016044,
+           0.13530783,  0.06597479,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.17376836, -0.11771516, -0.04749626,  0.06597479,
+           0.13530783,  0.79016044,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11771516, -0.04749626,  0.17376836,  0.13530783,
+           0.79016044,  0.06597479,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.17376836, -0.04749626, -0.11771516,  0.06597479,
+           0.79016044,  0.13530783,  0.        ,  0.        ,  0.        ]]), 'FE1_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06308901,  0.87382197,  0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06308901,  0.06308901,  0.87382197],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.87382197,  0.06308901,  0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.24928675,  0.50142651,  0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.24928675,  0.24928675,  0.50142651],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.50142651,  0.24928675,  0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05314505,  0.6365025 ,  0.31035245],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.31035245,  0.6365025 ,  0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05314505,  0.31035245,  0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.6365025 ,  0.31035245,  0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.31035245,  0.05314505,  0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.6365025 ,  0.05314505,  0.31035245]]), 'FE1_C0_D10': array([[  7.47643942e-01,   2.49528788e+00,   0.00000000e+00,
+            2.52356058e-01,  -2.52356058e-01,  -3.24293183e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.47643942e-01,  -7.47643942e-01,   0.00000000e+00,
+            3.49528788e+00,  -3.49528788e+00,  -1.09888393e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.49528788e+00,  -7.47643942e-01,   0.00000000e+00,
+            2.52356058e-01,  -2.52356058e-01,   3.24293183e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.85301932e-03,   1.00570604e+00,   0.00000000e+00,
+            9.97146981e-01,  -9.97146981e-01,  -1.00855906e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.85301932e-03,  -2.85301932e-03,   0.00000000e+00,
+            2.00570604e+00,  -2.00570604e+00,   3.57248574e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00570604e+00,  -2.85301932e-03,   0.00000000e+00,
+            9.97146981e-01,  -9.97146981e-01,   1.00855906e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.87419801e-01,   1.54601000e+00,   0.00000000e+00,
+            1.24140980e+00,  -1.24140980e+00,  -2.33342980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.41409804e-01,   1.54601000e+00,   0.00000000e+00,
+            2.12580199e-01,  -2.12580199e-01,  -1.30460019e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.87419801e-01,   2.41409804e-01,   0.00000000e+00,
+            2.54601000e+00,  -2.54601000e+00,  -1.02882960e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.54601000e+00,   2.41409804e-01,   0.00000000e+00,
+            2.12580199e-01,  -2.12580199e-01,   1.30460019e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.41409804e-01,  -7.87419801e-01,   0.00000000e+00,
+            2.54601000e+00,  -2.54601000e+00,   1.02882960e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.54601000e+00,  -7.87419801e-01,   0.00000000e+00,
+            1.24140980e+00,  -1.24140980e+00,   2.33342980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.85931890e-01,   8.88178420e-16,
+            4.85931890e-01,   6.37592643e+00,  -2.44372756e+00,
+           -5.37330206e-02,   5.37330206e-02,   2.44372756e+00,
+           -6.37592643e+00,   2.66453526e-15,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.85931890e-01,  -5.55111512e-16,
+            3.44372756e+00,  -2.30167545e-01,   1.20457074e+00,
+            2.21356002e+00,  -5.17135569e+00,   1.76434524e-01,
+            2.30167545e-01,  -1.38100527e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -3.44372756e+00,   3.33066907e-16,
+            4.85931890e-01,  -2.30167545e-01,  -1.76434524e-01,
+            5.17135569e+00,  -2.21356002e+00,  -1.20457074e+00,
+            2.30167545e-01,   1.38100527e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.04638309e-01,   2.18575158e-16,
+           -4.04638309e-01,   1.13786606e+00,   1.11855323e+00,
+           -8.38942398e-01,   8.38942398e-01,  -1.11855323e+00,
+           -1.13786606e+00,   1.14908083e-14,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.04638309e-01,  -1.38777878e-17,
+           -1.18553235e-01,  -2.82847955e-01,   2.25318218e+00,
+           -1.40140119e+00,   1.11531612e+00,  -5.56094442e-01,
+            2.82847955e-01,  -1.69708773e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.18553235e-01,   9.71445147e-17,
+           -4.04638309e-01,  -2.82847955e-01,   5.56094442e-01,
+           -1.11531612e+00,   1.40140119e+00,  -2.25318218e+00,
+            2.82847955e-01,   1.69708773e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -5.59823902e-01,   3.33066907e-16,
+           -4.92870367e-01,   2.60506708e+00,   2.46932174e+00,
+            7.50232851e-01,   3.02461418e-01,   1.95093341e+00,
+           -2.60506708e+00,  -4.42025515e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.92870367e-01,  -1.66533454e-16,
+            5.59823902e-01,   2.60506708e+00,  -1.95093341e+00,
+           -3.02461418e-01,  -7.50232851e-01,  -2.46932174e+00,
+           -2.60506708e+00,   4.42025515e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -5.59823902e-01,  -2.13370988e-16,
+            7.40805832e-01,  -9.62843375e-02,   3.93699696e+00,
+            1.74991003e+00,  -1.93089196e+00,   9.51256225e-01,
+            9.62843375e-02,  -4.88825318e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -7.40805832e-01,  -2.77555756e-16,
+            5.59823902e-01,  -9.62843375e-02,  -9.51256225e-01,
+            1.93089196e+00,  -1.74991003e+00,  -3.93699696e+00,
+            9.62843375e-02,   4.88825318e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.92870367e-01,  -3.98986399e-17,
+            7.40805832e-01,  -2.01023374e-01,   6.74175116e-01,
+           -2.56560608e+00,   1.33192988e+00,  -2.06177081e-01,
+            2.01023374e-01,  -4.67998035e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -7.40805832e-01,   2.63677968e-16,
+           -4.92870367e-01,  -2.01023374e-01,   2.06177081e-01,
+           -1.33192988e+00,   2.56560608e+00,  -6.74175116e-01,
+            2.01023374e-01,   4.67998035e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_C2_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.47643942e-01,
+            2.49528788e+00,   0.00000000e+00,   2.52356058e-01,
+           -2.52356058e-01,  -3.24293183e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.47643942e-01,
+           -7.47643942e-01,   0.00000000e+00,   3.49528788e+00,
+           -3.49528788e+00,  -1.09888393e-15],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.49528788e+00,
+           -7.47643942e-01,   0.00000000e+00,   2.52356058e-01,
+           -2.52356058e-01,   3.24293183e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   2.85301932e-03,
+            1.00570604e+00,   0.00000000e+00,   9.97146981e-01,
+           -9.97146981e-01,  -1.00855906e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   2.85301932e-03,
+           -2.85301932e-03,   0.00000000e+00,   2.00570604e+00,
+           -2.00570604e+00,   3.57248574e-15],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00570604e+00,
+           -2.85301932e-03,   0.00000000e+00,   9.97146981e-01,
+           -9.97146981e-01,   1.00855906e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.87419801e-01,
+            1.54601000e+00,   0.00000000e+00,   1.24140980e+00,
+           -1.24140980e+00,  -2.33342980e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.41409804e-01,
+            1.54601000e+00,   0.00000000e+00,   2.12580199e-01,
+           -2.12580199e-01,  -1.30460019e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.87419801e-01,
+            2.41409804e-01,   0.00000000e+00,   2.54601000e+00,
+           -2.54601000e+00,  -1.02882960e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.54601000e+00,
+            2.41409804e-01,   0.00000000e+00,   2.12580199e-01,
+           -2.12580199e-01,   1.30460019e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.41409804e-01,
+           -7.87419801e-01,   0.00000000e+00,   2.54601000e+00,
+           -2.54601000e+00,   1.02882960e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.54601000e+00,
+           -7.87419801e-01,   0.00000000e+00,   1.24140980e+00,
+           -1.24140980e+00,   2.33342980e+00]]), 'FE1_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.47643942e-01,   2.49528788e+00,   0.00000000e+00,
+            2.52356058e-01,  -2.52356058e-01,  -3.24293183e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.47643942e-01,  -7.47643942e-01,   0.00000000e+00,
+            3.49528788e+00,  -3.49528788e+00,  -1.09888393e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.49528788e+00,  -7.47643942e-01,   0.00000000e+00,
+            2.52356058e-01,  -2.52356058e-01,   3.24293183e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.85301932e-03,   1.00570604e+00,   0.00000000e+00,
+            9.97146981e-01,  -9.97146981e-01,  -1.00855906e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.85301932e-03,  -2.85301932e-03,   0.00000000e+00,
+            2.00570604e+00,  -2.00570604e+00,   3.57248574e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00570604e+00,  -2.85301932e-03,   0.00000000e+00,
+            9.97146981e-01,  -9.97146981e-01,   1.00855906e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.87419801e-01,   1.54601000e+00,   0.00000000e+00,
+            1.24140980e+00,  -1.24140980e+00,  -2.33342980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.41409804e-01,   1.54601000e+00,   0.00000000e+00,
+            2.12580199e-01,  -2.12580199e-01,  -1.30460019e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.87419801e-01,   2.41409804e-01,   0.00000000e+00,
+            2.54601000e+00,  -2.54601000e+00,  -1.02882960e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.54601000e+00,   2.41409804e-01,   0.00000000e+00,
+            2.12580199e-01,  -2.12580199e-01,   1.30460019e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.41409804e-01,  -7.87419801e-01,   0.00000000e+00,
+            2.54601000e+00,  -2.54601000e+00,   1.02882960e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.54601000e+00,  -7.87419801e-01,   0.00000000e+00,
+            1.24140980e+00,  -1.24140980e+00,   2.33342980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE2_C0_D01': array([[ -4.85931890e-01,   8.88178420e-16,   4.85931890e-01,
+            6.37592643e+00,  -2.44372756e+00,  -5.37330206e-02,
+            5.37330206e-02,   2.44372756e+00,  -6.37592643e+00,
+            2.66453526e-15,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -4.85931890e-01,  -5.55111512e-16,   3.44372756e+00,
+           -2.30167545e-01,   1.20457074e+00,   2.21356002e+00,
+           -5.17135569e+00,   1.76434524e-01,   2.30167545e-01,
+           -1.38100527e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -3.44372756e+00,   3.33066907e-16,   4.85931890e-01,
+           -2.30167545e-01,  -1.76434524e-01,   5.17135569e+00,
+           -2.21356002e+00,  -1.20457074e+00,   2.30167545e-01,
+            1.38100527e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.04638309e-01,   2.18575158e-16,  -4.04638309e-01,
+            1.13786606e+00,   1.11855323e+00,  -8.38942398e-01,
+            8.38942398e-01,  -1.11855323e+00,  -1.13786606e+00,
+            1.14908083e-14,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.04638309e-01,  -1.38777878e-17,  -1.18553235e-01,
+           -2.82847955e-01,   2.25318218e+00,  -1.40140119e+00,
+            1.11531612e+00,  -5.56094442e-01,   2.82847955e-01,
+           -1.69708773e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.18553235e-01,   9.71445147e-17,  -4.04638309e-01,
+           -2.82847955e-01,   5.56094442e-01,  -1.11531612e+00,
+            1.40140119e+00,  -2.25318218e+00,   2.82847955e-01,
+            1.69708773e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -5.59823902e-01,   3.33066907e-16,  -4.92870367e-01,
+            2.60506708e+00,   2.46932174e+00,   7.50232851e-01,
+            3.02461418e-01,   1.95093341e+00,  -2.60506708e+00,
+           -4.42025515e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.92870367e-01,  -1.66533454e-16,   5.59823902e-01,
+            2.60506708e+00,  -1.95093341e+00,  -3.02461418e-01,
+           -7.50232851e-01,  -2.46932174e+00,  -2.60506708e+00,
+            4.42025515e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -5.59823902e-01,  -2.13370988e-16,   7.40805832e-01,
+           -9.62843375e-02,   3.93699696e+00,   1.74991003e+00,
+           -1.93089196e+00,   9.51256225e-01,   9.62843375e-02,
+           -4.88825318e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -7.40805832e-01,  -2.77555756e-16,   5.59823902e-01,
+           -9.62843375e-02,  -9.51256225e-01,   1.93089196e+00,
+           -1.74991003e+00,  -3.93699696e+00,   9.62843375e-02,
+            4.88825318e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.92870367e-01,  -3.98986399e-17,   7.40805832e-01,
+           -2.01023374e-01,   6.74175116e-01,  -2.56560608e+00,
+            1.33192988e+00,  -2.06177081e-01,   2.01023374e-01,
+           -4.67998035e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -7.40805832e-01,   2.63677968e-16,  -4.92870367e-01,
+           -2.01023374e-01,   2.06177081e-01,  -1.33192988e+00,
+            2.56560608e+00,  -6.74175116e-01,   2.01023374e-01,
+            4.67998035e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.046308  ,  0.44026899,  0.046308  ,  0.40225091, -0.20112546,
+          -0.01452104, -0.01452104, -0.20112546,  0.40225091,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.046308  ,  0.046308  ,  0.44026899, -0.20112546,  0.40225091,
+          -0.20112546,  0.40225091, -0.01452104, -0.01452104,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.44026899,  0.046308  ,  0.046308  , -0.01452104, -0.01452104,
+           0.40225091, -0.20112546,  0.40225091, -0.20112546,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.03935169, -0.06267372,  0.03935169,  0.28365493, -0.14182746,
+          -0.07051025, -0.07051025, -0.14182746,  0.28365493,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.03935169,  0.03935169, -0.06267372, -0.14182746,  0.28365493,
+          -0.14182746,  0.28365493, -0.07051025, -0.07051025,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.06267372,  0.03935169,  0.03935169, -0.07051025, -0.07051025,
+           0.28365493, -0.14182746,  0.28365493, -0.14182746,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.04111073, -0.02619323,  0.01143583,  0.80848895, -0.06128522,
+          -0.0623881 , -0.00511704, -0.12795188,  0.13844642,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.01143583, -0.02619323,  0.04111073,  0.13844642, -0.12795188,
+          -0.00511704, -0.0623881 , -0.06128522,  0.80848895,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.04111073,  0.01143583, -0.02619323, -0.06128522,  0.80848895,
+          -0.12795188,  0.13844642, -0.0623881 , -0.00511704,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.02619323,  0.01143583,  0.04111073, -0.00511704, -0.0623881 ,
+           0.13844642, -0.12795188,  0.80848895, -0.06128522,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.01143583,  0.04111073, -0.02619323, -0.12795188,  0.13844642,
+          -0.06128522,  0.80848895, -0.00511704, -0.0623881 ,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.02619323,  0.04111073,  0.01143583, -0.0623881 , -0.00511704,
+           0.80848895, -0.06128522,  0.13844642, -0.12795188,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE2_C0': array([[ 0.046308  ,  0.44026899,  0.046308  ,  0.40225091, -0.20112546,
+          -0.01452104, -0.01452104, -0.20112546,  0.40225091,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.046308  ,  0.046308  ,  0.44026899, -0.20112546,  0.40225091,
+          -0.20112546,  0.40225091, -0.01452104, -0.01452104,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44026899,  0.046308  ,  0.046308  , -0.01452104, -0.01452104,
+           0.40225091, -0.20112546,  0.40225091, -0.20112546,  0.09390619,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.03935169, -0.06267372,  0.03935169,  0.28365493, -0.14182746,
+          -0.07051025, -0.07051025, -0.14182746,  0.28365493,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.03935169,  0.03935169, -0.06267372, -0.14182746,  0.28365493,
+          -0.14182746,  0.28365493, -0.07051025, -0.07051025,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [-0.06267372,  0.03935169,  0.03935169, -0.07051025, -0.07051025,
+           0.28365493, -0.14182746,  0.28365493, -0.14182746,  0.84133592,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04111073, -0.02619323,  0.01143583,  0.80848895, -0.06128522,
+          -0.0623881 , -0.00511704, -0.12795188,  0.13844642,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.01143583, -0.02619323,  0.04111073,  0.13844642, -0.12795188,
+          -0.00511704, -0.0623881 , -0.06128522,  0.80848895,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04111073,  0.01143583, -0.02619323, -0.06128522,  0.80848895,
+          -0.12795188,  0.13844642, -0.0623881 , -0.00511704,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [-0.02619323,  0.01143583,  0.04111073, -0.00511704, -0.0623881 ,
+           0.13844642, -0.12795188,  0.80848895, -0.06128522,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.01143583,  0.04111073, -0.02619323, -0.12795188,  0.13844642,
+          -0.06128522,  0.80848895, -0.00511704, -0.0623881 ,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [-0.02619323,  0.04111073,  0.01143583, -0.0623881 , -0.00511704,
+           0.80848895, -0.06128522,  0.13844642, -0.12795188,  0.28345353,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.05512857,  0.6533077 , -0.05512857,  0.22051427,  0.01592089,
+           0.22051427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.05512857, -0.05512857,  0.6533077 ,  0.22051427,  0.22051427,
+           0.01592089],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.6533077 , -0.05512857, -0.05512857,  0.01592089,  0.22051427,
+           0.22051427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.12499898,  0.00143058, -0.12499898,  0.49999593,  0.24857553,
+           0.49999593],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.12499898, -0.12499898,  0.00143058,  0.49999593,  0.49999593,
+           0.24857553],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.00143058, -0.12499898, -0.12499898,  0.24857553,  0.49999593,
+           0.49999593],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.04749626,  0.17376836, -0.11771516,  0.79016044,  0.06597479,
+           0.13530783],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.11771516,  0.17376836, -0.04749626,  0.13530783,  0.06597479,
+           0.79016044],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.04749626, -0.11771516,  0.17376836,  0.79016044,  0.13530783,
+           0.06597479],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.17376836, -0.11771516, -0.04749626,  0.06597479,  0.13530783,
+           0.79016044],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+          -0.11771516, -0.04749626,  0.17376836,  0.13530783,  0.79016044,
+           0.06597479],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.17376836, -0.04749626, -0.11771516,  0.06597479,  0.79016044,
+           0.13530783]]), 'FE3': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C0_D01': array([[  7.47643942e-01,   4.44089210e-16,  -7.47643942e-01,
+            3.49528788e+00,   2.22044605e-16,  -3.49528788e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.47643942e-01,  -4.44089210e-16,   2.49528788e+00,
+            2.52356058e-01,  -3.24293183e+00,  -2.52356058e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.49528788e+00,  -1.66533454e-16,  -7.47643942e-01,
+            2.52356058e-01,   3.24293183e+00,  -2.52356058e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.85301932e-03,  -1.11022302e-16,  -2.85301932e-03,
+            2.00570604e+00,   3.77475828e-15,  -2.00570604e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.85301932e-03,  -5.55111512e-17,   1.00570604e+00,
+            9.97146981e-01,  -1.00855906e+00,  -9.97146981e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00570604e+00,  -1.66533454e-16,  -2.85301932e-03,
+            9.97146981e-01,   1.00855906e+00,  -9.97146981e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.87419801e-01,   1.24900090e-16,   2.41409804e-01,
+            2.54601000e+00,  -1.02882960e+00,  -2.54601000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.41409804e-01,  -1.11022302e-16,  -7.87419801e-01,
+            2.54601000e+00,   1.02882960e+00,  -2.54601000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.87419801e-01,   0.00000000e+00,   1.54601000e+00,
+            1.24140980e+00,  -2.33342980e+00,  -1.24140980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.54601000e+00,  -1.11022302e-16,  -7.87419801e-01,
+            1.24140980e+00,   2.33342980e+00,  -1.24140980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.41409804e-01,   5.55111512e-17,   1.54601000e+00,
+            2.12580199e-01,  -1.30460019e+00,  -2.12580199e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.54601000e+00,   6.93889390e-17,   2.41409804e-01,
+            2.12580199e-01,   1.30460019e+00,  -2.12580199e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.06308901,  0.87382197,
+           0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.06308901,  0.06308901,
+           0.87382197],
+         [ 0.        ,  0.        ,  0.        ,  0.87382197,  0.06308901,
+           0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.24928675,  0.50142651,
+           0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.24928675,  0.24928675,
+           0.50142651],
+         [ 0.        ,  0.        ,  0.        ,  0.50142651,  0.24928675,
+           0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.05314505,  0.6365025 ,
+           0.31035245],
+         [ 0.        ,  0.        ,  0.        ,  0.31035245,  0.6365025 ,
+           0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.05314505,  0.31035245,
+           0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.6365025 ,  0.31035245,
+           0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.31035245,  0.05314505,
+           0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.6365025 ,  0.05314505,
+           0.31035245]]), 'FE0_C0': array([[ 0.06308901,  0.87382197,  0.06308901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.06308901,  0.06308901,  0.87382197,  0.        ,  0.        ,
+           0.        ],
+         [ 0.87382197,  0.06308901,  0.06308901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.24928675,  0.50142651,  0.24928675,  0.        ,  0.        ,
+           0.        ],
+         [ 0.24928675,  0.24928675,  0.50142651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.50142651,  0.24928675,  0.24928675,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05314505,  0.6365025 ,  0.31035245,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31035245,  0.6365025 ,  0.05314505,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05314505,  0.31035245,  0.6365025 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.6365025 ,  0.31035245,  0.05314505,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31035245,  0.05314505,  0.6365025 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.6365025 ,  0.05314505,  0.31035245,  0.        ,  0.        ,
+           0.        ]]), 'FE2_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.85931890e-01,   3.44372756e+00,
+           -1.38645914e-17,   1.20457074e+00,  -2.30167545e-01,
+            1.76434524e-01,   2.30167545e-01,   2.21356002e+00,
+           -5.17135569e+00,  -1.38100527e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.85931890e-01,   4.85931890e-01,
+            3.35148811e-16,  -2.44372756e+00,   6.37592643e+00,
+            2.44372756e+00,  -6.37592643e+00,  -5.37330206e-02,
+            5.37330206e-02,  -6.43415175e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -3.44372756e+00,   4.85931890e-01,
+           -9.23566062e-17,  -1.76434524e-01,  -2.30167545e-01,
+           -1.20457074e+00,   2.30167545e-01,   5.17135569e+00,
+           -2.21356002e+00,   1.38100527e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.04638309e-01,  -1.18553235e-01,
+           -3.90397186e-17,   2.25318218e+00,  -2.82847955e-01,
+           -5.56094442e-01,   2.82847955e-01,  -1.40140119e+00,
+            1.11531612e+00,  -1.69708773e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.04638309e-01,  -4.04638309e-01,
+           -3.69822127e-17,   1.11855323e+00,   1.13786606e+00,
+           -1.11855323e+00,  -1.13786606e+00,  -8.38942398e-01,
+            8.38942398e-01,   1.51461450e-14,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   1.18553235e-01,  -4.04638309e-01,
+           -1.47889501e-16,   5.56094442e-01,  -2.82847955e-01,
+           -2.25318218e+00,   2.82847955e-01,  -1.11531612e+00,
+            1.40140119e+00,   1.69708773e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -5.59823902e-01,   7.40805832e-01,
+            5.25620294e-17,   3.93699696e+00,  -9.62843375e-02,
+            9.51256225e-01,   9.62843375e-02,   1.74991003e+00,
+           -1.93089196e+00,  -4.88825318e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.92870367e-01,   7.40805832e-01,
+           -1.38022087e-17,   6.74175116e-01,  -2.01023374e-01,
+           -2.06177081e-01,   2.01023374e-01,  -2.56560608e+00,
+            1.33192988e+00,  -4.67998035e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -5.59823902e-01,  -4.92870367e-01,
+            2.00322990e-16,   2.46932174e+00,   2.60506708e+00,
+            1.95093341e+00,  -2.60506708e+00,   7.50232851e-01,
+            3.02461418e-01,  -4.42025515e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -7.40805832e-01,  -4.92870367e-01,
+           -3.95456510e-17,   2.06177081e-01,  -2.01023374e-01,
+           -6.74175116e-01,   2.01023374e-01,  -1.33192988e+00,
+            2.56560608e+00,   4.67998035e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.92870367e-01,   5.59823902e-01,
+           -8.98417888e-17,  -1.95093341e+00,   2.60506708e+00,
+           -2.46932174e+00,  -2.60506708e+00,  -3.02461418e-01,
+           -7.50232851e-01,   4.42025515e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -7.40805832e-01,   5.59823902e-01,
+           -2.63346192e-16,  -9.51256225e-01,  -9.62843375e-02,
+           -3.93699696e+00,   9.62843375e-02,   1.93089196e+00,
+           -1.74991003e+00,   4.88825318e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.47643942e-01,   4.44089210e-16,  -7.47643942e-01,
+            3.49528788e+00,   2.22044605e-16,  -3.49528788e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.47643942e-01,  -4.44089210e-16,   2.49528788e+00,
+            2.52356058e-01,  -3.24293183e+00,  -2.52356058e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.49528788e+00,  -1.66533454e-16,  -7.47643942e-01,
+            2.52356058e-01,   3.24293183e+00,  -2.52356058e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.85301932e-03,  -1.11022302e-16,  -2.85301932e-03,
+            2.00570604e+00,   3.77475828e-15,  -2.00570604e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.85301932e-03,  -5.55111512e-17,   1.00570604e+00,
+            9.97146981e-01,  -1.00855906e+00,  -9.97146981e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00570604e+00,  -1.66533454e-16,  -2.85301932e-03,
+            9.97146981e-01,   1.00855906e+00,  -9.97146981e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.87419801e-01,   1.24900090e-16,   2.41409804e-01,
+            2.54601000e+00,  -1.02882960e+00,  -2.54601000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.41409804e-01,  -1.11022302e-16,  -7.87419801e-01,
+            2.54601000e+00,   1.02882960e+00,  -2.54601000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.87419801e-01,   0.00000000e+00,   1.54601000e+00,
+            1.24140980e+00,  -2.33342980e+00,  -1.24140980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.54601000e+00,  -1.11022302e-16,  -7.87419801e-01,
+            1.24140980e+00,   2.33342980e+00,  -1.24140980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.41409804e-01,   5.55111512e-17,   1.54601000e+00,
+            2.12580199e-01,  -1.30460019e+00,  -2.12580199e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.54601000e+00,   6.93889390e-17,   2.41409804e-01,
+            2.12580199e-01,   1.30460019e+00,  -2.12580199e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.47643942e-01,
+            4.44089210e-16,  -7.47643942e-01,   3.49528788e+00,
+            2.22044605e-16,  -3.49528788e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.47643942e-01,
+           -4.44089210e-16,   2.49528788e+00,   2.52356058e-01,
+           -3.24293183e+00,  -2.52356058e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.49528788e+00,
+           -1.66533454e-16,  -7.47643942e-01,   2.52356058e-01,
+            3.24293183e+00,  -2.52356058e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   2.85301932e-03,
+           -1.11022302e-16,  -2.85301932e-03,   2.00570604e+00,
+            3.77475828e-15,  -2.00570604e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   2.85301932e-03,
+           -5.55111512e-17,   1.00570604e+00,   9.97146981e-01,
+           -1.00855906e+00,  -9.97146981e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00570604e+00,
+           -1.66533454e-16,  -2.85301932e-03,   9.97146981e-01,
+            1.00855906e+00,  -9.97146981e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.87419801e-01,
+            1.24900090e-16,   2.41409804e-01,   2.54601000e+00,
+           -1.02882960e+00,  -2.54601000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.41409804e-01,
+           -1.11022302e-16,  -7.87419801e-01,   2.54601000e+00,
+            1.02882960e+00,  -2.54601000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   7.87419801e-01,
+            0.00000000e+00,   1.54601000e+00,   1.24140980e+00,
+           -2.33342980e+00,  -1.24140980e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.54601000e+00,
+           -1.11022302e-16,  -7.87419801e-01,   1.24140980e+00,
+            2.33342980e+00,  -1.24140980e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -2.41409804e-01,
+            5.55111512e-17,   1.54601000e+00,   2.12580199e-01,
+           -1.30460019e+00,  -2.12580199e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.54601000e+00,
+            6.93889390e-17,   2.41409804e-01,   2.12580199e-01,
+            1.30460019e+00,  -2.12580199e-01]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.]]), 'FE2_C0_D10': array([[ -4.85931890e-01,   3.44372756e+00,  -1.38645914e-17,
+            1.20457074e+00,  -2.30167545e-01,   1.76434524e-01,
+            2.30167545e-01,   2.21356002e+00,  -5.17135569e+00,
+           -1.38100527e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -4.85931890e-01,   4.85931890e-01,   3.35148811e-16,
+           -2.44372756e+00,   6.37592643e+00,   2.44372756e+00,
+           -6.37592643e+00,  -5.37330206e-02,   5.37330206e-02,
+           -6.43415175e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -3.44372756e+00,   4.85931890e-01,  -9.23566062e-17,
+           -1.76434524e-01,  -2.30167545e-01,  -1.20457074e+00,
+            2.30167545e-01,   5.17135569e+00,  -2.21356002e+00,
+            1.38100527e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.04638309e-01,  -1.18553235e-01,  -3.90397186e-17,
+            2.25318218e+00,  -2.82847955e-01,  -5.56094442e-01,
+            2.82847955e-01,  -1.40140119e+00,   1.11531612e+00,
+           -1.69708773e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.04638309e-01,  -4.04638309e-01,  -3.69822127e-17,
+            1.11855323e+00,   1.13786606e+00,  -1.11855323e+00,
+           -1.13786606e+00,  -8.38942398e-01,   8.38942398e-01,
+            1.51461450e-14,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  1.18553235e-01,  -4.04638309e-01,  -1.47889501e-16,
+            5.56094442e-01,  -2.82847955e-01,  -2.25318218e+00,
+            2.82847955e-01,  -1.11531612e+00,   1.40140119e+00,
+            1.69708773e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -5.59823902e-01,   7.40805832e-01,   5.25620294e-17,
+            3.93699696e+00,  -9.62843375e-02,   9.51256225e-01,
+            9.62843375e-02,   1.74991003e+00,  -1.93089196e+00,
+           -4.88825318e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.92870367e-01,   7.40805832e-01,  -1.38022087e-17,
+            6.74175116e-01,  -2.01023374e-01,  -2.06177081e-01,
+            2.01023374e-01,  -2.56560608e+00,   1.33192988e+00,
+           -4.67998035e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -5.59823902e-01,  -4.92870367e-01,   2.00322990e-16,
+            2.46932174e+00,   2.60506708e+00,   1.95093341e+00,
+           -2.60506708e+00,   7.50232851e-01,   3.02461418e-01,
+           -4.42025515e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -7.40805832e-01,  -4.92870367e-01,  -3.95456510e-17,
+            2.06177081e-01,  -2.01023374e-01,  -6.74175116e-01,
+            2.01023374e-01,  -1.33192988e+00,   2.56560608e+00,
+            4.67998035e-01,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  4.92870367e-01,   5.59823902e-01,  -8.98417888e-17,
+           -1.95093341e+00,   2.60506708e+00,  -2.46932174e+00,
+           -2.60506708e+00,  -3.02461418e-01,  -7.50232851e-01,
+            4.42025515e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -7.40805832e-01,   5.59823902e-01,  -2.63346192e-16,
+           -9.51256225e-01,  -9.62843375e-02,  -3.93699696e+00,
+            9.62843375e-02,   1.93089196e+00,  -1.74991003e+00,
+            4.88825318e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[-0.05512857,  0.6533077 , -0.05512857,  0.22051427,  0.01592089,
+           0.22051427,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.05512857, -0.05512857,  0.6533077 ,  0.22051427,  0.22051427,
+           0.01592089,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.6533077 , -0.05512857, -0.05512857,  0.01592089,  0.22051427,
+           0.22051427,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12499898,  0.00143058, -0.12499898,  0.49999593,  0.24857553,
+           0.49999593,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12499898, -0.12499898,  0.00143058,  0.49999593,  0.49999593,
+           0.24857553,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.00143058, -0.12499898, -0.12499898,  0.24857553,  0.49999593,
+           0.49999593,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04749626,  0.17376836, -0.11771516,  0.79016044,  0.06597479,
+           0.13530783,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11771516,  0.17376836, -0.04749626,  0.13530783,  0.06597479,
+           0.79016044,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04749626, -0.11771516,  0.17376836,  0.79016044,  0.13530783,
+           0.06597479,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.17376836, -0.11771516, -0.04749626,  0.06597479,  0.13530783,
+           0.79016044,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11771516, -0.04749626,  0.17376836,  0.13530783,  0.79016044,
+           0.06597479,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.17376836, -0.04749626, -0.11771516,  0.06597479,  0.79016044,
+           0.13530783,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05512857,  0.6533077 , -0.05512857,  0.22051427,
+           0.01592089,  0.22051427,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05512857, -0.05512857,  0.6533077 ,  0.22051427,
+           0.22051427,  0.01592089,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.6533077 , -0.05512857, -0.05512857,  0.01592089,
+           0.22051427,  0.22051427,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12499898,  0.00143058, -0.12499898,  0.49999593,
+           0.24857553,  0.49999593,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12499898, -0.12499898,  0.00143058,  0.49999593,
+           0.49999593,  0.24857553,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.00143058, -0.12499898, -0.12499898,  0.24857553,
+           0.49999593,  0.49999593,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04749626,  0.17376836, -0.11771516,  0.79016044,
+           0.06597479,  0.13530783,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11771516,  0.17376836, -0.04749626,  0.13530783,
+           0.06597479,  0.79016044,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04749626, -0.11771516,  0.17376836,  0.79016044,
+           0.13530783,  0.06597479,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.17376836, -0.11771516, -0.04749626,  0.06597479,
+           0.13530783,  0.79016044,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11771516, -0.04749626,  0.17376836,  0.13530783,
+           0.79016044,  0.06597479,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.17376836, -0.04749626, -0.11771516,  0.06597479,
+           0.79016044,  0.13530783,  0.        ,  0.        ,  0.        ]]), 'FE1_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06308901,  0.87382197,  0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06308901,  0.06308901,  0.87382197],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.87382197,  0.06308901,  0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.24928675,  0.50142651,  0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.24928675,  0.24928675,  0.50142651],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.50142651,  0.24928675,  0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05314505,  0.6365025 ,  0.31035245],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.31035245,  0.6365025 ,  0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05314505,  0.31035245,  0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.6365025 ,  0.31035245,  0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.31035245,  0.05314505,  0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.6365025 ,  0.05314505,  0.31035245]]), 'FE1_C0_D10': array([[  7.47643942e-01,   2.49528788e+00,   0.00000000e+00,
+            2.52356058e-01,  -2.52356058e-01,  -3.24293183e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.47643942e-01,  -7.47643942e-01,   0.00000000e+00,
+            3.49528788e+00,  -3.49528788e+00,  -1.09888393e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.49528788e+00,  -7.47643942e-01,   0.00000000e+00,
+            2.52356058e-01,  -2.52356058e-01,   3.24293183e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.85301932e-03,   1.00570604e+00,   0.00000000e+00,
+            9.97146981e-01,  -9.97146981e-01,  -1.00855906e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.85301932e-03,  -2.85301932e-03,   0.00000000e+00,
+            2.00570604e+00,  -2.00570604e+00,   3.57248574e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00570604e+00,  -2.85301932e-03,   0.00000000e+00,
+            9.97146981e-01,  -9.97146981e-01,   1.00855906e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.87419801e-01,   1.54601000e+00,   0.00000000e+00,
+            1.24140980e+00,  -1.24140980e+00,  -2.33342980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.41409804e-01,   1.54601000e+00,   0.00000000e+00,
+            2.12580199e-01,  -2.12580199e-01,  -1.30460019e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.87419801e-01,   2.41409804e-01,   0.00000000e+00,
+            2.54601000e+00,  -2.54601000e+00,  -1.02882960e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.54601000e+00,   2.41409804e-01,   0.00000000e+00,
+            2.12580199e-01,  -2.12580199e-01,   1.30460019e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.41409804e-01,  -7.87419801e-01,   0.00000000e+00,
+            2.54601000e+00,  -2.54601000e+00,   1.02882960e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.54601000e+00,  -7.87419801e-01,   0.00000000e+00,
+            1.24140980e+00,  -1.24140980e+00,   2.33342980e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE2_C1_D01': 'FE2_C1_D01', 'FE0_C1_D01': 'FE0_C1_D01', 'FE2_C2_D10': 'FE2_C2_D10', 'FE1_C1_D10': 'FE1_C1_D10', 'FE1_C2_D10': 'FE1_C2_D10', 'FE2_C0_D01': 'FE2_C0_D01', 'FE0_C0_D01': 'FE0_C0_D01', 'FE2_C1': 'FE2_C1', 'FE2_C0': 'FE2_C0', 'FE2_C2': 'FE2_C2', 'FE3': 'FE3', 'FE1_C0_D01': 'FE1_C0_D01', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0', 'FE2_C1_D10': 'FE2_C1_D10', 'FE1_C1_D01': 'FE1_C1_D01', 'FE0_C1_D10': 'FE0_C1_D10', 'FE2_C2_D01': 'FE2_C2_D01', 'FE0_C0_D10': 'FE0_C0_D10', 'FE1_C2_D01': 'FE1_C2_D01', 'FE2_C0_D10': 'FE2_C0_D10', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C2': 'FE1_C2', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE2_C0_D01': array([[ -4.85931890e-01,   4.85931890e-01,   6.37592643e+00,
+           -2.44372756e+00,  -5.37330206e-02,   5.37330206e-02,
+            2.44372756e+00,  -6.37592643e+00,   0.00000000e+00],
+         [ -4.85931890e-01,   3.44372756e+00,  -2.30167545e-01,
+            1.20457074e+00,   2.21356002e+00,  -5.17135569e+00,
+            1.76434524e-01,   2.30167545e-01,  -1.38100527e+00],
+         [ -3.44372756e+00,   4.85931890e-01,  -2.30167545e-01,
+           -1.76434524e-01,   5.17135569e+00,  -2.21356002e+00,
+           -1.20457074e+00,   2.30167545e-01,   1.38100527e+00],
+         [  4.04638309e-01,  -4.04638309e-01,   1.13786606e+00,
+            1.11855323e+00,  -8.38942398e-01,   8.38942398e-01,
+           -1.11855323e+00,  -1.13786606e+00,   1.14908083e-14],
+         [  4.04638309e-01,  -1.18553235e-01,  -2.82847955e-01,
+            2.25318218e+00,  -1.40140119e+00,   1.11531612e+00,
+           -5.56094442e-01,   2.82847955e-01,  -1.69708773e+00],
+         [  1.18553235e-01,  -4.04638309e-01,  -2.82847955e-01,
+            5.56094442e-01,  -1.11531612e+00,   1.40140119e+00,
+           -2.25318218e+00,   2.82847955e-01,   1.69708773e+00],
+         [ -5.59823902e-01,  -4.92870367e-01,   2.60506708e+00,
+            2.46932174e+00,   7.50232851e-01,   3.02461418e-01,
+            1.95093341e+00,  -2.60506708e+00,  -4.42025515e+00],
+         [  4.92870367e-01,   5.59823902e-01,   2.60506708e+00,
+           -1.95093341e+00,  -3.02461418e-01,  -7.50232851e-01,
+           -2.46932174e+00,  -2.60506708e+00,   4.42025515e+00],
+         [ -5.59823902e-01,   7.40805832e-01,  -9.62843375e-02,
+            3.93699696e+00,   1.74991003e+00,  -1.93089196e+00,
+            9.51256225e-01,   9.62843375e-02,  -4.88825318e+00],
+         [ -7.40805832e-01,   5.59823902e-01,  -9.62843375e-02,
+           -9.51256225e-01,   1.93089196e+00,  -1.74991003e+00,
+           -3.93699696e+00,   9.62843375e-02,   4.88825318e+00],
+         [  4.92870367e-01,   7.40805832e-01,  -2.01023374e-01,
+            6.74175116e-01,  -2.56560608e+00,   1.33192988e+00,
+           -2.06177081e-01,   2.01023374e-01,  -4.67998035e-01],
+         [ -7.40805832e-01,  -4.92870367e-01,  -2.01023374e-01,
+            2.06177081e-01,  -1.33192988e+00,   2.56560608e+00,
+           -6.74175116e-01,   2.01023374e-01,   4.67998035e-01]]), 'FE0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE2_C0': array([[ 0.046308  ,  0.44026899,  0.046308  ,  0.40225091, -0.20112546,
+          -0.01452104, -0.01452104, -0.20112546,  0.40225091,  0.09390619],
+         [ 0.046308  ,  0.046308  ,  0.44026899, -0.20112546,  0.40225091,
+          -0.20112546,  0.40225091, -0.01452104, -0.01452104,  0.09390619],
+         [ 0.44026899,  0.046308  ,  0.046308  , -0.01452104, -0.01452104,
+           0.40225091, -0.20112546,  0.40225091, -0.20112546,  0.09390619],
+         [ 0.03935169, -0.06267372,  0.03935169,  0.28365493, -0.14182746,
+          -0.07051025, -0.07051025, -0.14182746,  0.28365493,  0.84133592],
+         [ 0.03935169,  0.03935169, -0.06267372, -0.14182746,  0.28365493,
+          -0.14182746,  0.28365493, -0.07051025, -0.07051025,  0.84133592],
+         [-0.06267372,  0.03935169,  0.03935169, -0.07051025, -0.07051025,
+           0.28365493, -0.14182746,  0.28365493, -0.14182746,  0.84133592],
+         [ 0.04111073, -0.02619323,  0.01143583,  0.80848895, -0.06128522,
+          -0.0623881 , -0.00511704, -0.12795188,  0.13844642,  0.28345353],
+         [ 0.01143583, -0.02619323,  0.04111073,  0.13844642, -0.12795188,
+          -0.00511704, -0.0623881 , -0.06128522,  0.80848895,  0.28345353],
+         [ 0.04111073,  0.01143583, -0.02619323, -0.06128522,  0.80848895,
+          -0.12795188,  0.13844642, -0.0623881 , -0.00511704,  0.28345353],
+         [-0.02619323,  0.01143583,  0.04111073, -0.00511704, -0.0623881 ,
+           0.13844642, -0.12795188,  0.80848895, -0.06128522,  0.28345353],
+         [ 0.01143583,  0.04111073, -0.02619323, -0.12795188,  0.13844642,
+          -0.06128522,  0.80848895, -0.00511704, -0.0623881 ,  0.28345353],
+         [-0.02619323,  0.04111073,  0.01143583, -0.0623881 , -0.00511704,
+           0.80848895, -0.06128522,  0.13844642, -0.12795188,  0.28345353]]), 'FE3': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C0_D01': array([[  7.47643942e-01,  -7.47643942e-01,   3.49528788e+00,
+            0.00000000e+00,  -3.49528788e+00],
+         [  7.47643942e-01,   2.49528788e+00,   2.52356058e-01,
+           -3.24293183e+00,  -2.52356058e-01],
+         [ -2.49528788e+00,  -7.47643942e-01,   2.52356058e-01,
+            3.24293183e+00,  -2.52356058e-01],
+         [  2.85301932e-03,  -2.85301932e-03,   2.00570604e+00,
+            0.00000000e+00,  -2.00570604e+00],
+         [  2.85301932e-03,   1.00570604e+00,   9.97146981e-01,
+           -1.00855906e+00,  -9.97146981e-01],
+         [ -1.00570604e+00,  -2.85301932e-03,   9.97146981e-01,
+            1.00855906e+00,  -9.97146981e-01],
+         [  7.87419801e-01,   2.41409804e-01,   2.54601000e+00,
+           -1.02882960e+00,  -2.54601000e+00],
+         [ -2.41409804e-01,  -7.87419801e-01,   2.54601000e+00,
+            1.02882960e+00,  -2.54601000e+00],
+         [  7.87419801e-01,   1.54601000e+00,   1.24140980e+00,
+           -2.33342980e+00,  -1.24140980e+00],
+         [ -1.54601000e+00,  -7.87419801e-01,   1.24140980e+00,
+            2.33342980e+00,  -1.24140980e+00],
+         [ -2.41409804e-01,   1.54601000e+00,   2.12580199e-01,
+           -1.30460019e+00,  -2.12580199e-01],
+         [ -1.54601000e+00,   2.41409804e-01,   2.12580199e-01,
+            1.30460019e+00,  -2.12580199e-01]]), 'FE0_C0': array([[ 0.06308901,  0.87382197,  0.06308901],
+         [ 0.06308901,  0.06308901,  0.87382197],
+         [ 0.87382197,  0.06308901,  0.06308901],
+         [ 0.24928675,  0.50142651,  0.24928675],
+         [ 0.24928675,  0.24928675,  0.50142651],
+         [ 0.50142651,  0.24928675,  0.24928675],
+         [ 0.05314505,  0.6365025 ,  0.31035245],
+         [ 0.31035245,  0.6365025 ,  0.05314505],
+         [ 0.05314505,  0.31035245,  0.6365025 ],
+         [ 0.6365025 ,  0.31035245,  0.05314505],
+         [ 0.31035245,  0.05314505,  0.6365025 ],
+         [ 0.6365025 ,  0.05314505,  0.31035245]]), 'FE2_C0_D10': array([[ -4.85931890e-01,   3.44372756e+00,   1.20457074e+00,
+           -2.30167545e-01,   1.76434524e-01,   2.30167545e-01,
+            2.21356002e+00,  -5.17135569e+00,  -1.38100527e+00],
+         [ -4.85931890e-01,   4.85931890e-01,  -2.44372756e+00,
+            6.37592643e+00,   2.44372756e+00,  -6.37592643e+00,
+           -5.37330206e-02,   5.37330206e-02,   0.00000000e+00],
+         [ -3.44372756e+00,   4.85931890e-01,  -1.76434524e-01,
+           -2.30167545e-01,  -1.20457074e+00,   2.30167545e-01,
+            5.17135569e+00,  -2.21356002e+00,   1.38100527e+00],
+         [  4.04638309e-01,  -1.18553235e-01,   2.25318218e+00,
+           -2.82847955e-01,  -5.56094442e-01,   2.82847955e-01,
+           -1.40140119e+00,   1.11531612e+00,  -1.69708773e+00],
+         [  4.04638309e-01,  -4.04638309e-01,   1.11855323e+00,
+            1.13786606e+00,  -1.11855323e+00,  -1.13786606e+00,
+           -8.38942398e-01,   8.38942398e-01,   1.51461450e-14],
+         [  1.18553235e-01,  -4.04638309e-01,   5.56094442e-01,
+           -2.82847955e-01,  -2.25318218e+00,   2.82847955e-01,
+           -1.11531612e+00,   1.40140119e+00,   1.69708773e+00],
+         [ -5.59823902e-01,   7.40805832e-01,   3.93699696e+00,
+           -9.62843375e-02,   9.51256225e-01,   9.62843375e-02,
+            1.74991003e+00,  -1.93089196e+00,  -4.88825318e+00],
+         [  4.92870367e-01,   7.40805832e-01,   6.74175116e-01,
+           -2.01023374e-01,  -2.06177081e-01,   2.01023374e-01,
+           -2.56560608e+00,   1.33192988e+00,  -4.67998035e-01],
+         [ -5.59823902e-01,  -4.92870367e-01,   2.46932174e+00,
+            2.60506708e+00,   1.95093341e+00,  -2.60506708e+00,
+            7.50232851e-01,   3.02461418e-01,  -4.42025515e+00],
+         [ -7.40805832e-01,  -4.92870367e-01,   2.06177081e-01,
+           -2.01023374e-01,  -6.74175116e-01,   2.01023374e-01,
+           -1.33192988e+00,   2.56560608e+00,   4.67998035e-01],
+         [  4.92870367e-01,   5.59823902e-01,  -1.95093341e+00,
+            2.60506708e+00,  -2.46932174e+00,  -2.60506708e+00,
+           -3.02461418e-01,  -7.50232851e-01,   4.42025515e+00],
+         [ -7.40805832e-01,   5.59823902e-01,  -9.51256225e-01,
+           -9.62843375e-02,  -3.93699696e+00,   9.62843375e-02,
+            1.93089196e+00,  -1.74991003e+00,   4.88825318e+00]]), 'FE1_C0': array([[-0.05512857,  0.6533077 , -0.05512857,  0.22051427,  0.01592089,
+           0.22051427],
+         [-0.05512857, -0.05512857,  0.6533077 ,  0.22051427,  0.22051427,
+           0.01592089],
+         [ 0.6533077 , -0.05512857, -0.05512857,  0.01592089,  0.22051427,
+           0.22051427],
+         [-0.12499898,  0.00143058, -0.12499898,  0.49999593,  0.24857553,
+           0.49999593],
+         [-0.12499898, -0.12499898,  0.00143058,  0.49999593,  0.49999593,
+           0.24857553],
+         [ 0.00143058, -0.12499898, -0.12499898,  0.24857553,  0.49999593,
+           0.49999593],
+         [-0.04749626,  0.17376836, -0.11771516,  0.79016044,  0.06597479,
+           0.13530783],
+         [-0.11771516,  0.17376836, -0.04749626,  0.13530783,  0.06597479,
+           0.79016044],
+         [-0.04749626, -0.11771516,  0.17376836,  0.79016044,  0.13530783,
+           0.06597479],
+         [ 0.17376836, -0.11771516, -0.04749626,  0.06597479,  0.13530783,
+           0.79016044],
+         [-0.11771516, -0.04749626,  0.17376836,  0.13530783,  0.79016044,
+           0.06597479],
+         [ 0.17376836, -0.04749626, -0.11771516,  0.06597479,  0.79016044,
+           0.13530783]]), 'FE1_C0_D10': array([[  7.47643942e-01,   2.49528788e+00,   2.52356058e-01,
+           -2.52356058e-01,  -3.24293183e+00],
+         [  7.47643942e-01,  -7.47643942e-01,   3.49528788e+00,
+           -3.49528788e+00,   0.00000000e+00],
+         [ -2.49528788e+00,  -7.47643942e-01,   2.52356058e-01,
+           -2.52356058e-01,   3.24293183e+00],
+         [  2.85301932e-03,   1.00570604e+00,   9.97146981e-01,
+           -9.97146981e-01,  -1.00855906e+00],
+         [  2.85301932e-03,  -2.85301932e-03,   2.00570604e+00,
+           -2.00570604e+00,   0.00000000e+00],
+         [ -1.00570604e+00,  -2.85301932e-03,   9.97146981e-01,
+           -9.97146981e-01,   1.00855906e+00],
+         [  7.87419801e-01,   1.54601000e+00,   1.24140980e+00,
+           -1.24140980e+00,  -2.33342980e+00],
+         [ -2.41409804e-01,   1.54601000e+00,   2.12580199e-01,
+           -2.12580199e-01,  -1.30460019e+00],
+         [  7.87419801e-01,   2.41409804e-01,   2.54601000e+00,
+           -2.54601000e+00,  -1.02882960e+00],
+         [ -1.54601000e+00,   2.41409804e-01,   2.12580199e-01,
+           -2.12580199e-01,   1.30460019e+00],
+         [ -2.41409804e-01,  -7.87419801e-01,   2.54601000e+00,
+           -2.54601000e+00,   1.02882960e+00],
+         [ -1.54601000e+00,  -7.87419801e-01,   1.24140980e+00,
+           -1.24140980e+00,   2.33342980e+00]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE2_C1_D01': ('FE2_C0_D01', (19, [10, 12, 13, 14, 15, 16, 17, 18, 19]), False, False), 'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE2_C2_D10': ('FE1_C0_D10', (23, [20, 21, 23, 24, 25]), False, False), 'FE1_C1_D10': ('FE1_C0_D10', (11, [6, 7, 9, 10, 11]), False, False), 'FE1_C2_D10': ('FE0_C0_D01', (14, [12, 13]), False, False), 'FE2_C0_D01': ('FE2_C0_D01', (16, [0, 2, 3, 4, 5, 6, 7, 8, 9]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE2_C1': ('FE2_C0', (18, [10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), False, False), 'FE2_C0': ('FE2_C0', (15, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]), False, False), 'FE2_C2': ('FE1_C0', (21, [20, 21, 22, 23, 24, 25]), False, False), 'FE3': ('FE3', (), False, True), 'FE1_C0_D01': ('FE1_C0_D01', (7, [0, 2, 3, 4, 5]), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False), 'FE2_C1_D10': ('FE2_C0_D10', (20, [10, 11, 13, 14, 15, 16, 17, 18, 19]), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (10, [6, 8, 9, 10, 11]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE2_C2_D01': ('FE1_C0_D01', (22, [20, 22, 23, 24, 25]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE1_C2_D01': ('FE0_C0_D01', (13, [12, 14]), False, False), 'FE2_C0_D10': ('FE2_C0_D10', (17, [0, 1, 3, 4, 5, 6, 7, 8, 9]), False, False), 'FE1_C0': ('FE1_C0', (6, [0, 1, 2, 3, 4, 5]), False, False), 'FE1_C1': ('FE1_C0', (9, [6, 7, 8, 9, 10, 11]), False, False), 'FE1_C2': ('FE0_C0', (12, [12, 13, 14]), False, False), 'FE1_C0_D10': ('FE1_C0_D10', (8, [0, 1, 3, 4, 5]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 0): array([[2.7755575615628914e-17, 4.163336342344337e-17,
+          5.5511151231257827e-17],
+         [0.8872983346207417, 0.5, 0.11270166537925835],
+         [0.1127016653792583, 0.5, 0.8872983346207417]], dtype=object)}, 1: {(0, 0): array([[0.8872983346207417, 0.5, 0.11270166537925835],
+         [2.7755575615628914e-17, 4.163336342344337e-17,
+          5.5511151231257827e-17],
+         [0.1127016653792583, 0.5, 0.8872983346207417]], dtype=object)}, 2: {(0, 0): array([[0.88729833462074181, 0.5, 0.11270166537925827],
+         [0.11270166537925827, 0.5, 0.88729833462074181],
+         [0.0, 0.0, 0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 1: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 2: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.88729833,  0.5       ,  0.11270167],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.11270167,  0.5       ,  0.88729833],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.88729833,  0.5       ,  0.11270167]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.11270167,  0.5       ,  0.88729833]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]]])}}}, MixedElement(*[MixedElement(*[FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 3, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 3, quad_scheme=None)], **{'value_shape': (2,) }), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None)], **{'value_shape': (3,) }): {None: {0: {(0, 0): array([[[ -6.93889390e-17,  -6.24500451e-17,  -4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.88014084e-01,  -6.25000000e-02,   6.19859160e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.19859160e-02,  -6.25000000e-02,   4.88014084e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  7.47852752e-01,   5.62500000e-01,  -2.97852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.97852752e-01,   5.62500000e-01,   7.47852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.81025203e-16,   2.35922393e-16,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.24900090e-16,  -9.71445147e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  8.58688121e-17,   3.98986399e-17,  -1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.99493200e-17,   1.35308431e-16,   2.35922393e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.24500451e-17,   6.93889390e-18,  -2.77555756e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -6.93889390e-17,  -6.24500451e-17,  -4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.88014084e-01,  -6.25000000e-02,   6.19859160e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.19859160e-02,  -6.25000000e-02,   4.88014084e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  7.47852752e-01,   5.62500000e-01,  -2.97852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.97852752e-01,   5.62500000e-01,   7.47852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.81025203e-16,   2.35922393e-16,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.24900090e-16,  -9.71445147e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.58688121e-17,   3.98986399e-17,  -1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.99493200e-17,   1.35308431e-16,   2.35922393e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.24500451e-17,   6.93889390e-18,  -2.77555756e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12757026e-16,   4.16333634e-17,   4.16333634e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,  -9.71445147e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -4.85722573e-17,   1.38777878e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17]]])}, 1: {(0, 0): array([[[  4.88014084e-01,  -6.25000000e-02,   6.19859160e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.82145965e-17,   7.45931095e-17,   7.63278329e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.19859160e-02,  -6.25000000e-02,   4.88014084e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.73472348e-16,   1.31838984e-16,   1.94289029e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -4.16333634e-17,   5.55111512e-17,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  7.47852752e-01,   5.62500000e-01,  -2.97852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.97852752e-01,   5.62500000e-01,   7.47852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.29850861e-16,  -8.50014503e-17,  -2.08166817e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.81278603e-16,   1.70002901e-16,   1.94289029e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.93889390e-17,  -6.93889390e-18,  -2.49800181e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.88014084e-01,  -6.25000000e-02,   6.19859160e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.82145965e-17,   7.45931095e-17,   7.63278329e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.19859160e-02,  -6.25000000e-02,   4.88014084e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.73472348e-16,   1.31838984e-16,   1.94289029e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -4.16333634e-17,   5.55111512e-17,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  7.47852752e-01,   5.62500000e-01,  -2.97852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.97852752e-01,   5.62500000e-01,   7.47852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.29850861e-16,  -8.50014503e-17,  -2.08166817e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.81278603e-16,   1.70002901e-16,   1.94289029e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.93889390e-17,  -6.93889390e-18,  -2.49800181e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,   8.32667268e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  9.36750677e-17,   8.32667268e-17,   9.71445147e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.77555756e-17,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17]]])}, 2: {(0, 0): array([[[  4.88014084e-01,  -6.25000000e-02,   6.19859160e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.19859160e-02,  -6.25000000e-02,   4.88014084e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,  -2.77555756e-17,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   2.77555756e-17,   1.38777878e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.32667268e-17,   8.32667268e-17,   8.32667268e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   5.55111512e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  7.47852752e-01,   5.62500000e-01,  -2.97852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.97852752e-01,   5.62500000e-01,   7.47852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.11022302e-16,   2.77555756e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.88014084e-01,  -6.25000000e-02,   6.19859160e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.19859160e-02,  -6.25000000e-02,   4.88014084e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,  -2.77555756e-17,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   2.77555756e-17,   1.38777878e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.32667268e-17,   8.32667268e-17,   8.32667268e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   5.55111512e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  7.47852752e-01,   5.62500000e-01,  -2.97852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.97852752e-01,   5.62500000e-01,   7.47852752e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.11022302e-16,   2.77555756e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,   4.16333634e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   1.38777878e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_f0': array([[2.7755575615628914e-17, 0.8872983346207417, 0.1127016653792583],
+         [4.163336342344337e-17, 0.5, 0.5],
+         [5.5511151231257827e-17, 0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE0_f1': array([[0.8872983346207417, 2.7755575615628914e-17, 0.1127016653792583],
+         [0.5, 4.163336342344337e-17, 0.5],
+         [0.11270166537925835, 5.5511151231257827e-17, 0.8872983346207417]], dtype=object), 'FE0_f2': array([[0.88729833462074181, 0.11270166537925827, 0.0],
+         [0.5, 0.5, 0.0],
+         [0.11270166537925827, 0.88729833462074181, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.88014084e-01,   6.19859160e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.32667268e-17,   0.00000000e+00,   7.47852752e-01,
+           -2.97852752e-01,   1.11022302e-16,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -6.25000000e-02,  -6.25000000e-02,
+           -2.77555756e-17,   2.77555756e-17,   0.00000000e+00,
+            8.32667268e-17,   5.55111512e-17,   5.62500000e-01,
+            5.62500000e-01,   2.77555756e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.19859160e-02,   4.88014084e-01,
+            0.00000000e+00,   1.38777878e-16,   0.00000000e+00,
+            8.32667268e-17,   5.55111512e-17,  -2.97852752e-01,
+            7.47852752e-01,  -5.55111512e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE2_f0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.12757026e-16,
+            6.87298335e-01,  -8.72983346e-02,   4.00000000e-01,
+           -4.85722573e-17,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+           -9.71445147e-17,   8.32667268e-17,   1.00000000e+00,
+            1.38777878e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+           -8.72983346e-02,   6.87298335e-01,   4.00000000e-01,
+            5.55111512e-17,  -6.93889390e-17]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -6.93889390e-17,   4.88014084e-01,
+            6.19859160e-02,   7.47852752e-01,  -2.97852752e-01,
+            2.81025203e-16,  -1.24900090e-16,   8.58688121e-17,
+           -1.99493200e-17,   6.24500451e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -6.24500451e-17,  -6.25000000e-02,
+           -6.25000000e-02,   5.62500000e-01,   5.62500000e-01,
+            2.35922393e-16,  -9.71445147e-17,   3.98986399e-17,
+            1.35308431e-16,   6.93889390e-18,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.16333634e-17,   6.19859160e-02,
+            4.88014084e-01,  -2.97852752e-01,   7.47852752e-01,
+            5.55111512e-17,  -5.55111512e-17,  -1.11022302e-16,
+            2.35922393e-16,  -2.77555756e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE2_f0_C0': array([[ -6.93889390e-17,   4.88014084e-01,   6.19859160e-02,
+            7.47852752e-01,  -2.97852752e-01,   2.81025203e-16,
+           -1.24900090e-16,   8.58688121e-17,  -1.99493200e-17,
+            6.24500451e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -6.24500451e-17,  -6.25000000e-02,  -6.25000000e-02,
+            5.62500000e-01,   5.62500000e-01,   2.35922393e-16,
+           -9.71445147e-17,   3.98986399e-17,   1.35308431e-16,
+            6.93889390e-18,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -4.16333634e-17,   6.19859160e-02,   4.88014084e-01,
+           -2.97852752e-01,   7.47852752e-01,   5.55111512e-17,
+           -5.55111512e-17,  -1.11022302e-16,   2.35922393e-16,
+           -2.77555756e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_f2_C0': array([[  4.88014084e-01,   6.19859160e-02,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -8.32667268e-17,
+            0.00000000e+00,   7.47852752e-01,  -2.97852752e-01,
+            1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -6.25000000e-02,  -6.25000000e-02,  -2.77555756e-17,
+            2.77555756e-17,   0.00000000e+00,   8.32667268e-17,
+            5.55111512e-17,   5.62500000e-01,   5.62500000e-01,
+            2.77555756e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.19859160e-02,   4.88014084e-01,   0.00000000e+00,
+            1.38777878e-16,   0.00000000e+00,   8.32667268e-17,
+            5.55111512e-17,  -2.97852752e-01,   7.47852752e-01,
+           -5.55111512e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE2_f2_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.87298335e-01,
+           -8.72983346e-02,   0.00000000e+00,   0.00000000e+00,
+           -2.77555756e-17,   4.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+            1.38777878e-17,   0.00000000e+00,   0.00000000e+00,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -8.72983346e-02,
+            6.87298335e-01,   0.00000000e+00,   0.00000000e+00,
+           -5.55111512e-17,   4.00000000e-01]]), 'FE2_f1_C0': array([[  4.88014084e-01,   1.82145965e-17,   6.19859160e-02,
+            1.73472348e-16,  -4.16333634e-17,   7.47852752e-01,
+           -2.97852752e-01,  -2.29850861e-16,   1.81278603e-16,
+            6.93889390e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -6.25000000e-02,   7.45931095e-17,  -6.25000000e-02,
+            1.31838984e-16,   5.55111512e-17,   5.62500000e-01,
+            5.62500000e-01,  -8.50014503e-17,   1.70002901e-16,
+           -6.93889390e-18,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.19859160e-02,   7.63278329e-17,   4.88014084e-01,
+            1.94289029e-16,   0.00000000e+00,  -2.97852752e-01,
+            7.47852752e-01,  -2.08166817e-17,   1.94289029e-16,
+           -2.49800181e-16,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.88014084e-01,   1.82145965e-17,
+            6.19859160e-02,   1.73472348e-16,  -4.16333634e-17,
+            7.47852752e-01,  -2.97852752e-01,  -2.29850861e-16,
+            1.81278603e-16,   6.93889390e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -6.25000000e-02,   7.45931095e-17,
+           -6.25000000e-02,   1.31838984e-16,   5.55111512e-17,
+            5.62500000e-01,   5.62500000e-01,  -8.50014503e-17,
+            1.70002901e-16,  -6.93889390e-18,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.19859160e-02,   7.63278329e-17,
+            4.88014084e-01,   1.94289029e-16,   0.00000000e+00,
+           -2.97852752e-01,   7.47852752e-01,  -2.08166817e-17,
+            1.94289029e-16,  -2.49800181e-16,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.87298335e-01,
+            9.36750677e-17,  -8.72983346e-02,  -2.77555756e-17,
+            4.00000000e-01,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   8.32667268e-17,
+            8.32667268e-17,   8.32667268e-17,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -8.72983346e-02,
+            9.71445147e-17,   6.87298335e-01,   0.00000000e+00,
+            4.00000000e-01,  -6.93889390e-17]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE1_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[2.7755575615628914e-17, 0.8872983346207417, 0.1127016653792583],
+         [4.163336342344337e-17, 0.5, 0.5],
+         [5.5511151231257827e-17, 0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE0_f1': array([[0.8872983346207417, 2.7755575615628914e-17, 0.1127016653792583],
+         [0.5, 4.163336342344337e-17, 0.5],
+         [0.11270166537925835, 5.5511151231257827e-17, 0.8872983346207417]], dtype=object), 'FE0_f2': array([[0.88729833462074181, 0.11270166537925827, 0.0],
+         [0.5, 0.5, 0.0],
+         [0.11270166537925827, 0.88729833462074181, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.88014084e-01,   6.19859160e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.32667268e-17,   0.00000000e+00,   7.47852752e-01,
+           -2.97852752e-01,   1.11022302e-16,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -6.25000000e-02,  -6.25000000e-02,
+           -2.77555756e-17,   2.77555756e-17,   0.00000000e+00,
+            8.32667268e-17,   5.55111512e-17,   5.62500000e-01,
+            5.62500000e-01,   2.77555756e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.19859160e-02,   4.88014084e-01,
+            0.00000000e+00,   1.38777878e-16,   0.00000000e+00,
+            8.32667268e-17,   5.55111512e-17,  -2.97852752e-01,
+            7.47852752e-01,  -5.55111512e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE2_f0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   1.12757026e-16,
+            6.87298335e-01,  -8.72983346e-02,   4.00000000e-01,
+           -4.85722573e-17,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+           -9.71445147e-17,   8.32667268e-17,   1.00000000e+00,
+            1.38777878e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+           -8.72983346e-02,   6.87298335e-01,   4.00000000e-01,
+            5.55111512e-17,  -6.93889390e-17]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -6.93889390e-17,   4.88014084e-01,
+            6.19859160e-02,   7.47852752e-01,  -2.97852752e-01,
+            2.81025203e-16,  -1.24900090e-16,   8.58688121e-17,
+           -1.99493200e-17,   6.24500451e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -6.24500451e-17,  -6.25000000e-02,
+           -6.25000000e-02,   5.62500000e-01,   5.62500000e-01,
+            2.35922393e-16,  -9.71445147e-17,   3.98986399e-17,
+            1.35308431e-16,   6.93889390e-18,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -4.16333634e-17,   6.19859160e-02,
+            4.88014084e-01,  -2.97852752e-01,   7.47852752e-01,
+            5.55111512e-17,  -5.55111512e-17,  -1.11022302e-16,
+            2.35922393e-16,  -2.77555756e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE2_f0_C0': array([[ -6.93889390e-17,   4.88014084e-01,   6.19859160e-02,
+            7.47852752e-01,  -2.97852752e-01,   2.81025203e-16,
+           -1.24900090e-16,   8.58688121e-17,  -1.99493200e-17,
+            6.24500451e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -6.24500451e-17,  -6.25000000e-02,  -6.25000000e-02,
+            5.62500000e-01,   5.62500000e-01,   2.35922393e-16,
+           -9.71445147e-17,   3.98986399e-17,   1.35308431e-16,
+            6.93889390e-18,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -4.16333634e-17,   6.19859160e-02,   4.88014084e-01,
+           -2.97852752e-01,   7.47852752e-01,   5.55111512e-17,
+           -5.55111512e-17,  -1.11022302e-16,   2.35922393e-16,
+           -2.77555756e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f2_C0': array([[  4.88014084e-01,   6.19859160e-02,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -8.32667268e-17,
+            0.00000000e+00,   7.47852752e-01,  -2.97852752e-01,
+            1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -6.25000000e-02,  -6.25000000e-02,  -2.77555756e-17,
+            2.77555756e-17,   0.00000000e+00,   8.32667268e-17,
+            5.55111512e-17,   5.62500000e-01,   5.62500000e-01,
+            2.77555756e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.19859160e-02,   4.88014084e-01,   0.00000000e+00,
+            1.38777878e-16,   0.00000000e+00,   8.32667268e-17,
+            5.55111512e-17,  -2.97852752e-01,   7.47852752e-01,
+           -5.55111512e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE2_f2_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.87298335e-01,
+           -8.72983346e-02,   0.00000000e+00,   0.00000000e+00,
+           -2.77555756e-17,   4.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   4.16333634e-17,
+            1.38777878e-17,   0.00000000e+00,   0.00000000e+00,
+           -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -8.72983346e-02,
+            6.87298335e-01,   0.00000000e+00,   0.00000000e+00,
+           -5.55111512e-17,   4.00000000e-01]]), 'FE2_f1_C0': array([[  4.88014084e-01,   1.82145965e-17,   6.19859160e-02,
+            1.73472348e-16,  -4.16333634e-17,   7.47852752e-01,
+           -2.97852752e-01,  -2.29850861e-16,   1.81278603e-16,
+            6.93889390e-17,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [ -6.25000000e-02,   7.45931095e-17,  -6.25000000e-02,
+            1.31838984e-16,   5.55111512e-17,   5.62500000e-01,
+            5.62500000e-01,  -8.50014503e-17,   1.70002901e-16,
+           -6.93889390e-18,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  6.19859160e-02,   7.63278329e-17,   4.88014084e-01,
+            1.94289029e-16,   0.00000000e+00,  -2.97852752e-01,
+            7.47852752e-01,  -2.08166817e-17,   1.94289029e-16,
+           -2.49800181e-16,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   4.88014084e-01,   1.82145965e-17,
+            6.19859160e-02,   1.73472348e-16,  -4.16333634e-17,
+            7.47852752e-01,  -2.97852752e-01,  -2.29850861e-16,
+            1.81278603e-16,   6.93889390e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -6.25000000e-02,   7.45931095e-17,
+           -6.25000000e-02,   1.31838984e-16,   5.55111512e-17,
+            5.62500000e-01,   5.62500000e-01,  -8.50014503e-17,
+            1.70002901e-16,  -6.93889390e-18,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   6.19859160e-02,   7.63278329e-17,
+            4.88014084e-01,   1.94289029e-16,   0.00000000e+00,
+           -2.97852752e-01,   7.47852752e-01,  -2.08166817e-17,
+            1.94289029e-16,  -2.49800181e-16,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.87298335e-01,
+            9.36750677e-17,  -8.72983346e-02,  -2.77555756e-17,
+            4.00000000e-01,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   8.32667268e-17,
+            8.32667268e-17,   8.32667268e-17,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -8.72983346e-02,
+            9.71445147e-17,   6.87298335e-01,   0.00000000e+00,
+            4.00000000e-01,  -6.93889390e-17]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE1_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f2_C1': 'FE1_f2_C1', 'FE2_f0_C2': 'FE2_f0_C2', 'FE2_f0_C1': 'FE2_f0_C1', 'FE2_f0_C0': 'FE2_f0_C0', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE2_f2_C1': 'FE2_f2_C1', 'FE2_f2_C0': 'FE2_f2_C0', 'FE2_f2_C2': 'FE2_f2_C2', 'FE2_f1_C0': 'FE2_f1_C0', 'FE2_f1_C1': 'FE2_f1_C1', 'FE2_f1_C2': 'FE2_f1_C2', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C0': 'FE1_f1_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.8872983346207417, 0.1127016653792583],
+         [0.5, 0.5],
+         [0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE2_f0_C2': array([[ 0.68729833, -0.08729833,  0.4       ],
+         [ 0.        ,  0.        ,  1.        ],
+         [-0.08729833,  0.68729833,  0.4       ]]), 'FE2_f0_C0': array([[ 0.48801408,  0.06198592,  0.74785275, -0.29785275],
+         [-0.0625    , -0.0625    ,  0.5625    ,  0.5625    ],
+         [ 0.06198592,  0.48801408, -0.29785275,  0.74785275]]), 'FE1_f0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE1_f1_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (2, [0, 1]), False, False), 'FE1_f0_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f2_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f2_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f2_C0': ('FE0_f0', (11, [0, 1]), False, False), 'FE1_f2_C1': ('FE0_f0', (12, [3, 4]), False, False), 'FE2_f0_C2': ('FE2_f0_C2', (15, [21, 22, 23]), False, False), 'FE2_f0_C1': ('FE2_f0_C0', (14, [11, 12, 13, 14]), False, False), 'FE2_f0_C0': ('FE2_f0_C0', (13, [1, 2, 3, 4]), False, False), 'FE1_f2_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (1, [0, 2]), False, False), 'FE1_f0_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (3, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (6, [4, 5]), False, False), 'FE1_f2_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f0_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f1_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE2_f2_C1': ('FE2_f0_C0', (20, [10, 11, 17, 18]), False, False), 'FE2_f2_C0': ('FE2_f0_C0', (19, [0, 1, 7, 8]), False, False), 'FE2_f2_C2': ('FE2_f0_C2', (21, [20, 21, 25]), False, False), 'FE2_f1_C0': ('FE2_f0_C0', (16, [0, 2, 5, 6]), False, False), 'FE2_f1_C1': ('FE2_f0_C0', (17, [10, 12, 15, 16]), False, False), 'FE2_f1_C2': ('FE2_f0_C2', (18, [20, 22, 24]), False, False), 'FE1_f0_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f1_C1': ('FE0_f0', (10, [3, 5]), False, False), 'FE1_f1_C0': ('FE0_f0', (9, [0, 2]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00715 seconds
+  Shape of reference tensor: (15, 15, 1)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [1] indices = [[0]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [1] indices = [[0]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {25: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0,
+          1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 0.99999999999999989, 1.0, 1.0, 1.0,
+          1.0, 0.99999999999999989]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.91514755,  0.76436533,  0.53566054,  0.29024993,  0.0939128 ,
+            0.73861153,  0.61691587,  0.43232925,  0.23425943,  0.0757966 ,
+            0.48009507,  0.40099329,  0.28101259,  0.15226786,  0.04926754,
+            0.22157861,  0.18507071,  0.12969594,  0.07027629,  0.02273848,
+            0.04504259,  0.03762125,  0.02636464,  0.01428579,  0.00462229],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.04504259,  0.03762125,  0.02636464,  0.01428579,  0.00462229,
+            0.22157861,  0.18507071,  0.12969594,  0.07027629,  0.02273848,
+            0.48009507,  0.40099329,  0.28101259,  0.15226786,  0.04926754,
+            0.73861153,  0.61691587,  0.43232925,  0.23425943,  0.0757966 ,
+            0.91514755,  0.76436533,  0.53566054,  0.29024993,  0.0939128 ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491,
+            0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491,
+            0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491,
+            0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491,
+            0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+          [ 0.91514755,  0.76436533,  0.53566054,  0.29024993,  0.0939128 ,
+            0.73861153,  0.61691587,  0.43232925,  0.23425943,  0.0757966 ,
+            0.48009507,  0.40099329,  0.28101259,  0.15226786,  0.04926754,
+            0.22157861,  0.18507071,  0.12969594,  0.07027629,  0.02273848,
+            0.04504259,  0.03762125,  0.02636464,  0.01428579,  0.00462229]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+          [ 0.04504259,  0.03762125,  0.02636464,  0.01428579,  0.00462229,
+            0.22157861,  0.18507071,  0.12969594,  0.07027629,  0.02273848,
+            0.48009507,  0.40099329,  0.28101259,  0.15226786,  0.04926754,
+            0.73861153,  0.61691587,  0.43232925,  0.23425943,  0.0757966 ,
+            0.91514755,  0.76436533,  0.53566054,  0.29024993,  0.0939128 ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+          [ 0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491,
+            0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491,
+            0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491,
+            0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491,
+            0.03980986,  0.19801342,  0.43797481,  0.69546427,  0.90146491]]])}}}, MixedElement(*[VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[ -2.66059020e+00,  -2.05746132e+00,  -1.14264218e+00, ...,
+             8.94541420e-01,   9.42856822e-01,   9.81510846e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.88578059e-16,   5.55111512e-17,   1.59594560e-16, ...,
+             3.67761377e-16,  -2.77555756e-16,  -4.44089210e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.40760572e-01,  -2.07946329e-01,   7.51899241e-01, ...,
+             7.51899241e-01,   1.78185709e+00,   2.60585966e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         ..., 
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00, ...,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00, ...,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-2.6605902 , -2.05746132, -1.14264218, ...,  0.89454142,
+            0.94285682,  0.98151085],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.81982963, -0.84951499, -0.89454142, ...,  1.14264218,
+            0.16099973, -0.62434881],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         ..., 
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [-1.        , -1.        , -1.        , ..., -1.        ,
+           -1.        , -1.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 1.        ,  1.        ,  1.        , ...,  1.        ,
+            1.        ,  1.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]]]), (0, 0): array([[[ 0.75984252,  0.40414338,  0.03820389, ..., -0.02497446,
+           -0.01387763, -0.00457956],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.04098492, -0.03479054, -0.02497446, ...,  0.03820389,
+           -0.12175989, -0.07627357],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.03664021, -0.11959479, -0.05433094, ..., -0.05433094,
+            0.27187684,  0.72381307],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         ..., 
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.91514755,  0.76436533,  0.53566054, ...,  0.02636464,
+            0.01428579,  0.00462229]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.04504259,  0.03762125,  0.02636464, ...,  0.53566054,
+            0.29024993,  0.0939128 ]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.03980986,  0.19801342,  0.43797481, ...,  0.43797481,
+            0.69546427,  0.90146491]]])}}}, MixedElement(*[MixedElement(*[FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None)], **{'value_shape': (2,) }), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[ -2.66059020e+00,  -2.05746132e+00,  -1.14264218e+00, ...,
+             8.94541420e-01,   9.42856822e-01,   9.81510846e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -3.88578059e-16,   5.55111512e-17,   1.59594560e-16, ...,
+             3.67761377e-16,  -2.77555756e-16,  -4.44089210e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.40760572e-01,  -2.07946329e-01,   7.51899241e-01, ...,
+             7.51899241e-01,   1.78185709e+00,   2.60585966e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         ..., 
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00, ...,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00, ...,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00, ...,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-2.6605902 , -2.05746132, -1.14264218, ...,  0.89454142,
+            0.94285682,  0.98151085],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.81982963, -0.84951499, -0.89454142, ...,  1.14264218,
+            0.16099973, -0.62434881],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         ..., 
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [-1.        , -1.        , -1.        , ..., -1.        ,
+           -1.        , -1.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 1.        ,  1.        ,  1.        , ...,  1.        ,
+            1.        ,  1.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]]]), (0, 0): array([[[ 0.75984252,  0.40414338,  0.03820389, ..., -0.02497446,
+           -0.01387763, -0.00457956],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.04098492, -0.03479054, -0.02497446, ...,  0.03820389,
+           -0.12175989, -0.07627357],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.03664021, -0.11959479, -0.05433094, ..., -0.05433094,
+            0.27187684,  0.72381307],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ]],
+  
+         ..., 
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.91514755,  0.76436533,  0.53566054, ...,  0.02636464,
+            0.01428579,  0.00462229]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.04504259,  0.03762125,  0.02636464, ...,  0.53566054,
+            0.29024993,  0.0939128 ]],
+  
+         [[ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        , ...,  0.        ,
+            0.        ,  0.        ],
+          [ 0.03980986,  0.19801342,  0.43797481, ...,  0.43797481,
+            0.69546427,  0.90146491]]])}}}, FiniteElement('Bubble', Domain(Cell('triangle', 2), label=None, data=None), 3, quad_scheme=None): {None: {None: {(0, 1): array([[1.0645419576193222, 0.57528544123839909, 0.069537142111522066,
+          -0.15629783660456859, -0.1007839485374431, 4.1806666025278236,
+          2.0932175166793923, -0.019769557671948879, -0.87511767987258171,
+          -0.50691001274709091, 5.7072265601591292, 2.1976263189868388,
+          -1.1909257048519397, -2.2332066314443275, -1.1336131048331728,
+          3.624925419221487, -0.21558316717187903, -3.5985053269365639,
+          -3.9543169424171358, -1.7983209117704795, 0.12929560203507395,
+          -3.3101516834601297, -5.9530497856576918, -5.3382241989434531,
+          -2.2740749932784055]], dtype=object), (1, 0): array([[0.9352463555842504, 3.8854371246985302, 6.0225869277692157,
+          5.1819263623388867, 2.173291044740961, 0.55574118330633471,
+          2.30880068385127, 3.578735769264616, 3.0791992625445563,
+          1.2914108990233868, 7.1564590174502415e-17,
+          -1.2669846426651272e-15, 9.5039679816781888e-16,
+          2.5014148937354126e-15, -8.9597872259107286e-16,
+          -0.55574118330633249, -2.30880068385127, -3.5787357692646129,
+          -3.0791992625445492, -1.2914108990233886, -0.9352463555842444,
+          -3.8854371246985275, -6.0225869277692112, -5.1819263623388778,
+          -2.1732910447409628]], dtype=object), (0, 0): array([[0.044306647781284285, 0.15374203052449872, 0.16700308084091173,
+          0.077860127642166807, 0.010565606073050682, 0.17591314777898884,
+          0.61041053408067281, 0.66306161965887866, 0.30913239493133543,
+          0.041949213392945828, 0.24774727000530669, 0.85967163518081724,
+          0.93382278806226415, 0.43536658789519056, 0.059079171899246358,
+          0.17591314777898864, 0.6104105340806727, 0.663061619658879,
+          0.30913239493133565, 0.041949213392945828, 0.044306647781284229,
+          0.15374203052449861, 0.16700308084091206, 0.077860127642167667,
+          0.010565606073050793]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[0.9352463555842504],
+         [3.8854371246985302],
+         [6.0225869277692157],
+         [5.1819263623388867],
+         [2.173291044740961],
+         [0.55574118330633471],
+         [2.30880068385127],
+         [3.578735769264616],
+         [3.0791992625445563],
+         [1.2914108990233868],
+         [7.1564590174502415e-17],
+         [-1.2669846426651272e-15],
+         [9.5039679816781888e-16],
+         [2.5014148937354126e-15],
+         [-8.9597872259107286e-16],
+         [-0.55574118330633249],
+         [-2.30880068385127],
+         [-3.5787357692646129],
+         [-3.0791992625445492],
+         [-1.2914108990233886],
+         [-0.9352463555842444],
+         [-3.8854371246985275],
+         [-6.0225869277692112],
+         [-5.1819263623388778],
+         [-2.1732910447409628]], dtype=object), 'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.66059020e+00,  -3.88578059e-16,  -8.40760572e-01,
+            1.80170374e-01,   3.50135077e+00,  -1.80170374e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.05746132e+00,   5.55111512e-17,  -2.07946329e-01,
+            1.50485009e-01,   2.26540765e+00,  -1.50485009e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.14264218e+00,   1.59594560e-16,   7.51899241e-01,
+            1.05458580e-01,   3.90742938e-01,  -1.05458580e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.60999729e-01,  -1.11022302e-16,   1.78185709e+00,
+            5.71431776e-02,  -1.62085736e+00,  -5.71431776e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.24348811e-01,  -4.44089210e-16,   2.60585966e+00,
+            1.84891539e-02,  -3.23020847e+00,  -1.84891539e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.95444613e+00,  -3.88578059e-16,  -8.40760572e-01,
+            8.86314438e-01,   2.79520671e+00,  -8.86314438e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.46766349e+00,  -5.55111512e-17,  -2.07946329e-01,
+            7.40282841e-01,   1.67560982e+00,  -7.40282841e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.29317012e-01,   7.63278329e-17,   7.51899241e-01,
+            5.18783747e-01,  -2.25822291e-02,  -5.18783747e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.29622614e-02,  -1.66533454e-16,   1.78185709e+00,
+            2.81105168e-01,  -1.84481935e+00,  -2.81105168e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.96813589e-01,  -5.55111512e-16,   2.60585966e+00,
+            9.09539323e-02,  -3.30267325e+00,  -9.09539323e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.20380286e-01,  -2.77555756e-16,  -8.40760572e-01,
+            1.92038029e+00,   1.76114086e+00,  -1.92038029e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -6.03973164e-01,  -1.11022302e-16,  -2.07946329e-01,
+            1.60397316e+00,   8.11919493e-01,  -1.60397316e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.24050380e-01,  -1.38777878e-17,   7.51899241e-01,
+            1.12405038e+00,  -6.27848861e-01,  -1.12405038e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.90928547e-01,  -1.66533454e-16,   1.78185709e+00,
+            6.09071453e-01,  -2.17278564e+00,  -6.09071453e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.02929828e-01,  -5.55111512e-16,   2.60585966e+00,
+            1.97070172e-01,  -3.40878949e+00,  -1.97070172e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.13685562e-01,   0.00000000e+00,  -8.40760572e-01,
+            2.95444613e+00,   7.27075010e-01,  -2.95444613e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.59717159e-01,   5.55111512e-17,  -2.07946329e-01,
+            2.46766349e+00,  -5.17708304e-02,  -2.46766349e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.81216253e-01,   3.46944695e-17,   7.51899241e-01,
+            1.72931701e+00,  -1.23311549e+00,  -1.72931701e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.18894832e-01,  -2.77555756e-16,   1.78185709e+00,
+            9.37037739e-01,  -2.50075193e+00,  -9.37037739e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.09046068e-01,  -5.55111512e-16,   2.60585966e+00,
+            3.03186411e-01,  -3.51490572e+00,  -3.03186411e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.19829626e-01,   1.66533454e-16,  -8.40760572e-01,
+            3.66059020e+00,   2.09309461e-02,  -3.66059020e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.49514991e-01,   2.22044605e-16,  -2.07946329e-01,
+            3.05746132e+00,  -6.41568662e-01,  -3.05746132e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.94541420e-01,   3.67761377e-16,   7.51899241e-01,
+            2.14264218e+00,  -1.64644066e+00,  -2.14264218e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.42856822e-01,  -2.77555756e-16,   1.78185709e+00,
+            1.16099973e+00,  -2.72471392e+00,  -1.16099973e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.81510846e-01,  -4.44089210e-16,   2.60585966e+00,
+            3.75651189e-01,  -3.58737050e+00,  -3.75651189e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.66059020e+00,  -8.19829626e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.05746132e+00,  -8.49514991e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.14264218e+00,  -8.94541420e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.60999729e-01,  -9.42856822e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.24348811e-01,  -9.81510846e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.95444613e+00,  -1.13685562e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.46766349e+00,  -2.59717159e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.29317012e-01,  -4.81216253e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.29622614e-02,  -7.18894832e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.96813589e-01,  -9.09046068e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.20380286e-01,   9.20380286e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -1.15580710e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -6.03973164e-01,   6.03973164e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -8.13438773e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.24050380e-01,   1.24050380e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -4.06039638e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.90928547e-01,  -3.90928547e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.54839928e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.02929828e-01,  -8.02929828e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -1.18760780e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.13685562e-01,   1.95444613e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.59717159e-01,   1.46766349e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.81216253e-01,   7.29317012e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.18894832e-01,  -6.29622614e-02,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.09046068e-01,  -6.96813589e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.19829626e-01,   2.66059020e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.49514991e-01,   2.05746132e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.94541420e-01,   1.14264218e+00,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.42856822e-01,   1.60999729e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.81510846e-01,  -6.24348811e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.66059020e+00,  -8.19829626e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.05746132e+00,  -8.49514991e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.14264218e+00,  -8.94541420e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.60999729e-01,  -9.42856822e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.24348811e-01,  -9.81510846e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.95444613e+00,  -1.13685562e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.46766349e+00,  -2.59717159e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.29317012e-01,  -4.81216253e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.29622614e-02,  -7.18894832e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.96813589e-01,  -9.09046068e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.20380286e-01,   9.20380286e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -1.15580710e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -6.03973164e-01,   6.03973164e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -8.13438773e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.24050380e-01,   1.24050380e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -4.06039638e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.90928547e-01,  -3.90928547e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.54839928e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.02929828e-01,  -8.02929828e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -1.18760780e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.13685562e-01,   1.95444613e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.59717159e-01,   1.46766349e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.81216253e-01,   7.29317012e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.18894832e-01,  -6.29622614e-02,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.09046068e-01,  -6.96813589e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.19829626e-01,   2.66059020e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.49514991e-01,   2.05746132e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.94541420e-01,   1.14264218e+00,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.42856822e-01,   1.60999729e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.81510846e-01,  -6.24348811e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE3_C0_D10': array([[ -2.66059020e+00,  -8.19829626e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.05746132e+00,  -8.49514991e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.14264218e+00,  -8.94541420e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.60999729e-01,  -9.42856822e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.24348811e-01,  -9.81510846e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.95444613e+00,  -1.13685562e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.46766349e+00,  -2.59717159e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.29317012e-01,  -4.81216253e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.29622614e-02,  -7.18894832e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.96813589e-01,  -9.09046068e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.20380286e-01,   9.20380286e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -1.15580710e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -6.03973164e-01,   6.03973164e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -8.13438773e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.24050380e-01,   1.24050380e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -4.06039638e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.90928547e-01,  -3.90928547e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.54839928e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.02929828e-01,  -8.02929828e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -1.18760780e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.13685562e-01,   1.95444613e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.59717159e-01,   1.46766349e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.81216253e-01,   7.29317012e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.18894832e-01,  -6.29622614e-02,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.09046068e-01,  -6.96813589e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.19829626e-01,   2.66059020e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.49514991e-01,   2.05746132e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.94541420e-01,   1.14264218e+00,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.42856822e-01,   1.60999729e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.81510846e-01,  -6.24348811e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C0_D01': array([[ -2.66059020e+00,  -3.88578059e-16,  -8.40760572e-01,
+            1.80170374e-01,   3.50135077e+00,  -1.80170374e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.05746132e+00,   5.55111512e-17,  -2.07946329e-01,
+            1.50485009e-01,   2.26540765e+00,  -1.50485009e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.14264218e+00,   1.59594560e-16,   7.51899241e-01,
+            1.05458580e-01,   3.90742938e-01,  -1.05458580e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.60999729e-01,  -1.11022302e-16,   1.78185709e+00,
+            5.71431776e-02,  -1.62085736e+00,  -5.71431776e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.24348811e-01,  -4.44089210e-16,   2.60585966e+00,
+            1.84891539e-02,  -3.23020847e+00,  -1.84891539e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.95444613e+00,  -3.88578059e-16,  -8.40760572e-01,
+            8.86314438e-01,   2.79520671e+00,  -8.86314438e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.46766349e+00,  -5.55111512e-17,  -2.07946329e-01,
+            7.40282841e-01,   1.67560982e+00,  -7.40282841e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.29317012e-01,   7.63278329e-17,   7.51899241e-01,
+            5.18783747e-01,  -2.25822291e-02,  -5.18783747e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.29622614e-02,  -1.66533454e-16,   1.78185709e+00,
+            2.81105168e-01,  -1.84481935e+00,  -2.81105168e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.96813589e-01,  -5.55111512e-16,   2.60585966e+00,
+            9.09539323e-02,  -3.30267325e+00,  -9.09539323e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.20380286e-01,  -2.77555756e-16,  -8.40760572e-01,
+            1.92038029e+00,   1.76114086e+00,  -1.92038029e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -6.03973164e-01,  -1.11022302e-16,  -2.07946329e-01,
+            1.60397316e+00,   8.11919493e-01,  -1.60397316e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.24050380e-01,  -1.38777878e-17,   7.51899241e-01,
+            1.12405038e+00,  -6.27848861e-01,  -1.12405038e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.90928547e-01,  -1.66533454e-16,   1.78185709e+00,
+            6.09071453e-01,  -2.17278564e+00,  -6.09071453e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.02929828e-01,  -5.55111512e-16,   2.60585966e+00,
+            1.97070172e-01,  -3.40878949e+00,  -1.97070172e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.13685562e-01,   0.00000000e+00,  -8.40760572e-01,
+            2.95444613e+00,   7.27075010e-01,  -2.95444613e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.59717159e-01,   5.55111512e-17,  -2.07946329e-01,
+            2.46766349e+00,  -5.17708304e-02,  -2.46766349e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.81216253e-01,   3.46944695e-17,   7.51899241e-01,
+            1.72931701e+00,  -1.23311549e+00,  -1.72931701e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.18894832e-01,  -2.77555756e-16,   1.78185709e+00,
+            9.37037739e-01,  -2.50075193e+00,  -9.37037739e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.09046068e-01,  -5.55111512e-16,   2.60585966e+00,
+            3.03186411e-01,  -3.51490572e+00,  -3.03186411e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.19829626e-01,   1.66533454e-16,  -8.40760572e-01,
+            3.66059020e+00,   2.09309461e-02,  -3.66059020e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.49514991e-01,   2.22044605e-16,  -2.07946329e-01,
+            3.05746132e+00,  -6.41568662e-01,  -3.05746132e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.94541420e-01,   3.67761377e-16,   7.51899241e-01,
+            2.14264218e+00,  -1.64644066e+00,  -2.14264218e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.42856822e-01,  -2.77555756e-16,   1.78185709e+00,
+            1.16099973e+00,  -2.72471392e+00,  -1.16099973e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.81510846e-01,  -4.44089210e-16,   2.60585966e+00,
+            3.75651189e-01,  -3.58737050e+00,  -3.75651189e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.75984252, -0.04098492, -0.03664021,  0.00717256,
+           0.14572757,  0.16488248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.40414338, -0.03479054, -0.11959479,  0.02979805,
+           0.60541837,  0.11502552,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.03820389, -0.02497446, -0.05433094,  0.0461882 ,
+           0.9384233 ,  0.05649   ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12175989, -0.01387763,  0.27187684,  0.03974104,
+           0.80743383,  0.0165858 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07627357, -0.00457956,  0.72381307,  0.01666732,
+           0.33863637,  0.00173637,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.35248246, -0.12338445, -0.03664021,  0.03528405,
+           0.11761608,  0.65464207,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.14425451, -0.11656837, -0.11959479,  0.14658594,
+           0.48863048,  0.45669223,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05851209, -0.09605386, -0.05433094,  0.22721421,
+           0.75739729,  0.22428539,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12450447, -0.06039878,  0.27187684,  0.1954986 ,
+           0.65167627,  0.06585154,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.06430635, -0.02170441,  0.72381307,  0.08199178,
+           0.27331191,  0.006894  ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01911252, -0.01911252, -0.03664021,  0.07645006,
+           0.07645006,  0.92196511,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07940205, -0.07940205, -0.11959479,  0.31760821,
+           0.31760821,  0.64318248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12307644, -0.12307644, -0.05433094,  0.49230575,
+           0.49230575,  0.31587231,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.10589686, -0.10589686,  0.27187684,  0.42358744,
+           0.42358744,  0.09274201,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04441296, -0.04441296,  0.72381307,  0.17765185,
+           0.17765185,  0.00970916,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12338445,  0.35248246, -0.03664021,  0.11761608,
+           0.03528405,  0.65464207,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11656837,  0.14425451, -0.11959479,  0.48863048,
+           0.14658594,  0.45669223,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09605386, -0.05851209, -0.05433094,  0.75739729,
+           0.22721421,  0.22428539,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.06039878, -0.12450447,  0.27187684,  0.65167627,
+           0.1954986 ,  0.06585154,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02170441, -0.06430635,  0.72381307,  0.27331191,
+           0.08199178,  0.006894  ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04098492,  0.75984252, -0.03664021,  0.14572757,
+           0.00717256,  0.16488248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.03479054,  0.40414338, -0.11959479,  0.60541837,
+           0.02979805,  0.11502552,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02497446,  0.03820389, -0.05433094,  0.9384233 ,
+           0.0461882 ,  0.05649   ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01387763, -0.12175989,  0.27187684,  0.80743383,
+           0.03974104,  0.0165858 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.00457956, -0.07627357,  0.72381307,  0.33863637,
+           0.01666732,  0.00173637,  0.        ,  0.        ,  0.        ]]), 'FE2_C0': array([[ 0.75984252, -0.04098492, -0.03664021,  0.00717256,  0.14572757,
+           0.16488248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.40414338, -0.03479054, -0.11959479,  0.02979805,  0.60541837,
+           0.11502552,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.03820389, -0.02497446, -0.05433094,  0.0461882 ,  0.9384233 ,
+           0.05649   ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12175989, -0.01387763,  0.27187684,  0.03974104,  0.80743383,
+           0.0165858 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07627357, -0.00457956,  0.72381307,  0.01666732,  0.33863637,
+           0.00173637,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.35248246, -0.12338445, -0.03664021,  0.03528405,  0.11761608,
+           0.65464207,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.14425451, -0.11656837, -0.11959479,  0.14658594,  0.48863048,
+           0.45669223,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.05851209, -0.09605386, -0.05433094,  0.22721421,  0.75739729,
+           0.22428539,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12450447, -0.06039878,  0.27187684,  0.1954986 ,  0.65167627,
+           0.06585154,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.06430635, -0.02170441,  0.72381307,  0.08199178,  0.27331191,
+           0.006894  ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01911252, -0.01911252, -0.03664021,  0.07645006,  0.07645006,
+           0.92196511,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07940205, -0.07940205, -0.11959479,  0.31760821,  0.31760821,
+           0.64318248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12307644, -0.12307644, -0.05433094,  0.49230575,  0.49230575,
+           0.31587231,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.10589686, -0.10589686,  0.27187684,  0.42358744,  0.42358744,
+           0.09274201,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04441296, -0.04441296,  0.72381307,  0.17765185,  0.17765185,
+           0.00970916,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12338445,  0.35248246, -0.03664021,  0.11761608,  0.03528405,
+           0.65464207,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11656837,  0.14425451, -0.11959479,  0.48863048,  0.14658594,
+           0.45669223,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09605386, -0.05851209, -0.05433094,  0.75739729,  0.22721421,
+           0.22428539,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.06039878, -0.12450447,  0.27187684,  0.65167627,  0.1954986 ,
+           0.06585154,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02170441, -0.06430635,  0.72381307,  0.27331191,  0.08199178,
+           0.006894  ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04098492,  0.75984252, -0.03664021,  0.14572757,  0.00717256,
+           0.16488248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.03479054,  0.40414338, -0.11959479,  0.60541837,  0.02979805,
+           0.11502552,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02497446,  0.03820389, -0.05433094,  0.9384233 ,  0.0461882 ,
+           0.05649   ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01387763, -0.12175989,  0.27187684,  0.80743383,  0.03974104,
+           0.0165858 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.00457956, -0.07627357,  0.72381307,  0.33863637,  0.01666732,
+           0.00173637,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE4': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989]], dtype=object), 'FE2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.91514755,  0.04504259,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.76436533,  0.03762125,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.53566054,  0.02636464,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.29024993,  0.01428579,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.0939128 ,  0.00462229,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.73861153,  0.22157861,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.61691587,  0.18507071,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.43232925,  0.12969594,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.23425943,  0.07027629,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.0757966 ,  0.02273848,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.48009507,  0.48009507,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.40099329,  0.40099329,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.28101259,  0.28101259,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.15226786,  0.15226786,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04926754,  0.04926754,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.22157861,  0.73861153,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.18507071,  0.61691587,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.12969594,  0.43232925,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.07027629,  0.23425943,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02273848,  0.0757966 ,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04504259,  0.91514755,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.03762125,  0.76436533,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02636464,  0.53566054,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.01428579,  0.29024993,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.00462229,  0.0939128 ,  0.90146491]]), 'FE0': array([[0.044306647781284285],
+         [0.15374203052449872],
+         [0.16700308084091173],
+         [0.077860127642166807],
+         [0.010565606073050682],
+         [0.17591314777898884],
+         [0.61041053408067281],
+         [0.66306161965887866],
+         [0.30913239493133543],
+         [0.041949213392945828],
+         [0.24774727000530669],
+         [0.85967163518081724],
+         [0.93382278806226415],
+         [0.43536658789519056],
+         [0.059079171899246358],
+         [0.17591314777898864],
+         [0.6104105340806727],
+         [0.663061619658879],
+         [0.30913239493133565],
+         [0.041949213392945828],
+         [0.044306647781284229],
+         [0.15374203052449861],
+         [0.16700308084091206],
+         [0.077860127642167667],
+         [0.010565606073050793]], dtype=object), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_D01': array([[1.0645419576193222],
+         [0.57528544123839909],
+         [0.069537142111522066],
+         [-0.15629783660456859],
+         [-0.1007839485374431],
+         [4.1806666025278236],
+         [2.0932175166793923],
+         [-0.019769557671948879],
+         [-0.87511767987258171],
+         [-0.50691001274709091],
+         [5.7072265601591292],
+         [2.1976263189868388],
+         [-1.1909257048519397],
+         [-2.2332066314443275],
+         [-1.1336131048331728],
+         [3.624925419221487],
+         [-0.21558316717187903],
+         [-3.5985053269365639],
+         [-3.9543169424171358],
+         [-1.7983209117704795],
+         [0.12929560203507395],
+         [-3.3101516834601297],
+         [-5.9530497856576918],
+         [-5.3382241989434531],
+         [-2.2740749932784055]], dtype=object), 'FE3_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.66059020e+00,  -3.88578059e-16,  -8.40760572e-01,
+            1.80170374e-01,   3.50135077e+00,  -1.80170374e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.05746132e+00,   5.55111512e-17,  -2.07946329e-01,
+            1.50485009e-01,   2.26540765e+00,  -1.50485009e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.14264218e+00,   1.59594560e-16,   7.51899241e-01,
+            1.05458580e-01,   3.90742938e-01,  -1.05458580e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.60999729e-01,  -1.11022302e-16,   1.78185709e+00,
+            5.71431776e-02,  -1.62085736e+00,  -5.71431776e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.24348811e-01,  -4.44089210e-16,   2.60585966e+00,
+            1.84891539e-02,  -3.23020847e+00,  -1.84891539e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.95444613e+00,  -3.88578059e-16,  -8.40760572e-01,
+            8.86314438e-01,   2.79520671e+00,  -8.86314438e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.46766349e+00,  -5.55111512e-17,  -2.07946329e-01,
+            7.40282841e-01,   1.67560982e+00,  -7.40282841e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.29317012e-01,   7.63278329e-17,   7.51899241e-01,
+            5.18783747e-01,  -2.25822291e-02,  -5.18783747e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.29622614e-02,  -1.66533454e-16,   1.78185709e+00,
+            2.81105168e-01,  -1.84481935e+00,  -2.81105168e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.96813589e-01,  -5.55111512e-16,   2.60585966e+00,
+            9.09539323e-02,  -3.30267325e+00,  -9.09539323e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.20380286e-01,  -2.77555756e-16,  -8.40760572e-01,
+            1.92038029e+00,   1.76114086e+00,  -1.92038029e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -6.03973164e-01,  -1.11022302e-16,  -2.07946329e-01,
+            1.60397316e+00,   8.11919493e-01,  -1.60397316e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.24050380e-01,  -1.38777878e-17,   7.51899241e-01,
+            1.12405038e+00,  -6.27848861e-01,  -1.12405038e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.90928547e-01,  -1.66533454e-16,   1.78185709e+00,
+            6.09071453e-01,  -2.17278564e+00,  -6.09071453e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.02929828e-01,  -5.55111512e-16,   2.60585966e+00,
+            1.97070172e-01,  -3.40878949e+00,  -1.97070172e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.13685562e-01,   0.00000000e+00,  -8.40760572e-01,
+            2.95444613e+00,   7.27075010e-01,  -2.95444613e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.59717159e-01,   5.55111512e-17,  -2.07946329e-01,
+            2.46766349e+00,  -5.17708304e-02,  -2.46766349e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.81216253e-01,   3.46944695e-17,   7.51899241e-01,
+            1.72931701e+00,  -1.23311549e+00,  -1.72931701e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.18894832e-01,  -2.77555756e-16,   1.78185709e+00,
+            9.37037739e-01,  -2.50075193e+00,  -9.37037739e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.09046068e-01,  -5.55111512e-16,   2.60585966e+00,
+            3.03186411e-01,  -3.51490572e+00,  -3.03186411e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.19829626e-01,   1.66533454e-16,  -8.40760572e-01,
+            3.66059020e+00,   2.09309461e-02,  -3.66059020e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.49514991e-01,   2.22044605e-16,  -2.07946329e-01,
+            3.05746132e+00,  -6.41568662e-01,  -3.05746132e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.94541420e-01,   3.67761377e-16,   7.51899241e-01,
+            2.14264218e+00,  -1.64644066e+00,  -2.14264218e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.42856822e-01,  -2.77555756e-16,   1.78185709e+00,
+            1.16099973e+00,  -2.72471392e+00,  -1.16099973e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.81510846e-01,  -4.44089210e-16,   2.60585966e+00,
+            3.75651189e-01,  -3.58737050e+00,  -3.75651189e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE2_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE3_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE3_C0_D01': array([[ -2.66059020e+00,  -3.88578059e-16,  -8.40760572e-01,
+            1.80170374e-01,   3.50135077e+00,  -1.80170374e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.05746132e+00,   5.55111512e-17,  -2.07946329e-01,
+            1.50485009e-01,   2.26540765e+00,  -1.50485009e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.14264218e+00,   1.59594560e-16,   7.51899241e-01,
+            1.05458580e-01,   3.90742938e-01,  -1.05458580e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.60999729e-01,  -1.11022302e-16,   1.78185709e+00,
+            5.71431776e-02,  -1.62085736e+00,  -5.71431776e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.24348811e-01,  -4.44089210e-16,   2.60585966e+00,
+            1.84891539e-02,  -3.23020847e+00,  -1.84891539e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.95444613e+00,  -3.88578059e-16,  -8.40760572e-01,
+            8.86314438e-01,   2.79520671e+00,  -8.86314438e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.46766349e+00,  -5.55111512e-17,  -2.07946329e-01,
+            7.40282841e-01,   1.67560982e+00,  -7.40282841e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.29317012e-01,   7.63278329e-17,   7.51899241e-01,
+            5.18783747e-01,  -2.25822291e-02,  -5.18783747e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.29622614e-02,  -1.66533454e-16,   1.78185709e+00,
+            2.81105168e-01,  -1.84481935e+00,  -2.81105168e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.96813589e-01,  -5.55111512e-16,   2.60585966e+00,
+            9.09539323e-02,  -3.30267325e+00,  -9.09539323e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.20380286e-01,  -2.77555756e-16,  -8.40760572e-01,
+            1.92038029e+00,   1.76114086e+00,  -1.92038029e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -6.03973164e-01,  -1.11022302e-16,  -2.07946329e-01,
+            1.60397316e+00,   8.11919493e-01,  -1.60397316e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.24050380e-01,  -1.38777878e-17,   7.51899241e-01,
+            1.12405038e+00,  -6.27848861e-01,  -1.12405038e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.90928547e-01,  -1.66533454e-16,   1.78185709e+00,
+            6.09071453e-01,  -2.17278564e+00,  -6.09071453e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.02929828e-01,  -5.55111512e-16,   2.60585966e+00,
+            1.97070172e-01,  -3.40878949e+00,  -1.97070172e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.13685562e-01,   0.00000000e+00,  -8.40760572e-01,
+            2.95444613e+00,   7.27075010e-01,  -2.95444613e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.59717159e-01,   5.55111512e-17,  -2.07946329e-01,
+            2.46766349e+00,  -5.17708304e-02,  -2.46766349e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.81216253e-01,   3.46944695e-17,   7.51899241e-01,
+            1.72931701e+00,  -1.23311549e+00,  -1.72931701e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.18894832e-01,  -2.77555756e-16,   1.78185709e+00,
+            9.37037739e-01,  -2.50075193e+00,  -9.37037739e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.09046068e-01,  -5.55111512e-16,   2.60585966e+00,
+            3.03186411e-01,  -3.51490572e+00,  -3.03186411e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.19829626e-01,   1.66533454e-16,  -8.40760572e-01,
+            3.66059020e+00,   2.09309461e-02,  -3.66059020e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.49514991e-01,   2.22044605e-16,  -2.07946329e-01,
+            3.05746132e+00,  -6.41568662e-01,  -3.05746132e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.94541420e-01,   3.67761377e-16,   7.51899241e-01,
+            2.14264218e+00,  -1.64644066e+00,  -2.14264218e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.42856822e-01,  -2.77555756e-16,   1.78185709e+00,
+            1.16099973e+00,  -2.72471392e+00,  -1.16099973e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.81510846e-01,  -4.44089210e-16,   2.60585966e+00,
+            3.75651189e-01,  -3.58737050e+00,  -3.75651189e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C0_D10': array([[ -2.66059020e+00,  -8.19829626e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.05746132e+00,  -8.49514991e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.14264218e+00,  -8.94541420e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.60999729e-01,  -9.42856822e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.24348811e-01,  -9.81510846e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.95444613e+00,  -1.13685562e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.46766349e+00,  -2.59717159e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.29317012e-01,  -4.81216253e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.29622614e-02,  -7.18894832e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.96813589e-01,  -9.09046068e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.20380286e-01,   9.20380286e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -1.15580710e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -6.03973164e-01,   6.03973164e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -8.13438773e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.24050380e-01,   1.24050380e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -4.06039638e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.90928547e-01,  -3.90928547e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.54839928e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.02929828e-01,  -8.02929828e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -1.18760780e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.13685562e-01,   1.95444613e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.59717159e-01,   1.46766349e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.81216253e-01,   7.29317012e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.18894832e-01,  -6.29622614e-02,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.09046068e-01,  -6.96813589e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.19829626e-01,   2.66059020e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.49514991e-01,   2.05746132e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.94541420e-01,   1.14264218e+00,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.42856822e-01,   1.60999729e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.81510846e-01,  -6.24348811e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE3_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE1_C0': array([[ 0.91514755,  0.04504259,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.76436533,  0.03762125,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.53566054,  0.02636464,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.29024993,  0.01428579,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.0939128 ,  0.00462229,  0.90146491,  0.        ,  0.        ,
+           0.        ],
+         [ 0.73861153,  0.22157861,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.61691587,  0.18507071,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.43232925,  0.12969594,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.23425943,  0.07027629,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.0757966 ,  0.02273848,  0.90146491,  0.        ,  0.        ,
+           0.        ],
+         [ 0.48009507,  0.48009507,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.40099329,  0.40099329,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.28101259,  0.28101259,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.15226786,  0.15226786,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04926754,  0.04926754,  0.90146491,  0.        ,  0.        ,
+           0.        ],
+         [ 0.22157861,  0.73861153,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.18507071,  0.61691587,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.12969594,  0.43232925,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.07027629,  0.23425943,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.02273848,  0.0757966 ,  0.90146491,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04504259,  0.91514755,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.03762125,  0.76436533,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.02636464,  0.53566054,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.01428579,  0.29024993,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.00462229,  0.0939128 ,  0.90146491,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.91514755,  0.04504259,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.76436533,  0.03762125,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.53566054,  0.02636464,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.29024993,  0.01428579,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.0939128 ,  0.00462229,
+           0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.73861153,  0.22157861,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.61691587,  0.18507071,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.43232925,  0.12969594,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.23425943,  0.07027629,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.0757966 ,  0.02273848,
+           0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.48009507,  0.48009507,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.40099329,  0.40099329,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.28101259,  0.28101259,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.15226786,  0.15226786,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.04926754,  0.04926754,
+           0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.22157861,  0.73861153,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.18507071,  0.61691587,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.12969594,  0.43232925,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.07027629,  0.23425943,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.02273848,  0.0757966 ,
+           0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.04504259,  0.91514755,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.03762125,  0.76436533,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.02636464,  0.53566054,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.01428579,  0.29024993,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.00462229,  0.0939128 ,
+           0.90146491]]), 'FE3_C0': array([[ 0.75984252, -0.04098492, -0.03664021,  0.00717256,  0.14572757,
+           0.16488248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.40414338, -0.03479054, -0.11959479,  0.02979805,  0.60541837,
+           0.11502552,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.03820389, -0.02497446, -0.05433094,  0.0461882 ,  0.9384233 ,
+           0.05649   ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12175989, -0.01387763,  0.27187684,  0.03974104,  0.80743383,
+           0.0165858 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07627357, -0.00457956,  0.72381307,  0.01666732,  0.33863637,
+           0.00173637,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.35248246, -0.12338445, -0.03664021,  0.03528405,  0.11761608,
+           0.65464207,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.14425451, -0.11656837, -0.11959479,  0.14658594,  0.48863048,
+           0.45669223,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.05851209, -0.09605386, -0.05433094,  0.22721421,  0.75739729,
+           0.22428539,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12450447, -0.06039878,  0.27187684,  0.1954986 ,  0.65167627,
+           0.06585154,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.06430635, -0.02170441,  0.72381307,  0.08199178,  0.27331191,
+           0.006894  ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01911252, -0.01911252, -0.03664021,  0.07645006,  0.07645006,
+           0.92196511,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07940205, -0.07940205, -0.11959479,  0.31760821,  0.31760821,
+           0.64318248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12307644, -0.12307644, -0.05433094,  0.49230575,  0.49230575,
+           0.31587231,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.10589686, -0.10589686,  0.27187684,  0.42358744,  0.42358744,
+           0.09274201,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04441296, -0.04441296,  0.72381307,  0.17765185,  0.17765185,
+           0.00970916,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12338445,  0.35248246, -0.03664021,  0.11761608,  0.03528405,
+           0.65464207,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11656837,  0.14425451, -0.11959479,  0.48863048,  0.14658594,
+           0.45669223,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09605386, -0.05851209, -0.05433094,  0.75739729,  0.22721421,
+           0.22428539,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.06039878, -0.12450447,  0.27187684,  0.65167627,  0.1954986 ,
+           0.06585154,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02170441, -0.06430635,  0.72381307,  0.27331191,  0.08199178,
+           0.006894  ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04098492,  0.75984252, -0.03664021,  0.14572757,  0.00717256,
+           0.16488248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.03479054,  0.40414338, -0.11959479,  0.60541837,  0.02979805,
+           0.11502552,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02497446,  0.03820389, -0.05433094,  0.9384233 ,  0.0461882 ,
+           0.05649   ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01387763, -0.12175989,  0.27187684,  0.80743383,  0.03974104,
+           0.0165858 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.00457956, -0.07627357,  0.72381307,  0.33863637,  0.01666732,
+           0.00173637,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE3_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.75984252, -0.04098492, -0.03664021,  0.00717256,
+           0.14572757,  0.16488248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.40414338, -0.03479054, -0.11959479,  0.02979805,
+           0.60541837,  0.11502552,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.03820389, -0.02497446, -0.05433094,  0.0461882 ,
+           0.9384233 ,  0.05649   ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12175989, -0.01387763,  0.27187684,  0.03974104,
+           0.80743383,  0.0165858 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07627357, -0.00457956,  0.72381307,  0.01666732,
+           0.33863637,  0.00173637,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.35248246, -0.12338445, -0.03664021,  0.03528405,
+           0.11761608,  0.65464207,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.14425451, -0.11656837, -0.11959479,  0.14658594,
+           0.48863048,  0.45669223,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05851209, -0.09605386, -0.05433094,  0.22721421,
+           0.75739729,  0.22428539,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12450447, -0.06039878,  0.27187684,  0.1954986 ,
+           0.65167627,  0.06585154,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.06430635, -0.02170441,  0.72381307,  0.08199178,
+           0.27331191,  0.006894  ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01911252, -0.01911252, -0.03664021,  0.07645006,
+           0.07645006,  0.92196511,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07940205, -0.07940205, -0.11959479,  0.31760821,
+           0.31760821,  0.64318248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12307644, -0.12307644, -0.05433094,  0.49230575,
+           0.49230575,  0.31587231,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.10589686, -0.10589686,  0.27187684,  0.42358744,
+           0.42358744,  0.09274201,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04441296, -0.04441296,  0.72381307,  0.17765185,
+           0.17765185,  0.00970916,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12338445,  0.35248246, -0.03664021,  0.11761608,
+           0.03528405,  0.65464207,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11656837,  0.14425451, -0.11959479,  0.48863048,
+           0.14658594,  0.45669223,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09605386, -0.05851209, -0.05433094,  0.75739729,
+           0.22721421,  0.22428539,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.06039878, -0.12450447,  0.27187684,  0.65167627,
+           0.1954986 ,  0.06585154,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02170441, -0.06430635,  0.72381307,  0.27331191,
+           0.08199178,  0.006894  ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04098492,  0.75984252, -0.03664021,  0.14572757,
+           0.00717256,  0.16488248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.03479054,  0.40414338, -0.11959479,  0.60541837,
+           0.02979805,  0.11502552,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02497446,  0.03820389, -0.05433094,  0.9384233 ,
+           0.0461882 ,  0.05649   ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01387763, -0.12175989,  0.27187684,  0.80743383,
+           0.03974104,  0.0165858 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.00457956, -0.07627357,  0.72381307,  0.33863637,
+           0.01666732,  0.00173637,  0.        ,  0.        ,  0.        ]]), 'FE3_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.91514755,  0.04504259,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.76436533,  0.03762125,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.53566054,  0.02636464,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.29024993,  0.01428579,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.0939128 ,  0.00462229,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.73861153,  0.22157861,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.61691587,  0.18507071,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.43232925,  0.12969594,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.23425943,  0.07027629,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.0757966 ,  0.02273848,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.48009507,  0.48009507,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.40099329,  0.40099329,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.28101259,  0.28101259,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.15226786,  0.15226786,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04926754,  0.04926754,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.22157861,  0.73861153,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.18507071,  0.61691587,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.12969594,  0.43232925,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.07027629,  0.23425943,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02273848,  0.0757966 ,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04504259,  0.91514755,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.03762125,  0.76436533,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02636464,  0.53566054,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.01428579,  0.29024993,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.00462229,  0.0939128 ,  0.90146491]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE0_D10': array([[0.9352463555842504],
+         [3.8854371246985302],
+         [6.0225869277692157],
+         [5.1819263623388867],
+         [2.173291044740961],
+         [0.55574118330633471],
+         [2.30880068385127],
+         [3.578735769264616],
+         [3.0791992625445563],
+         [1.2914108990233868],
+         [7.1564590174502415e-17],
+         [-1.2669846426651272e-15],
+         [9.5039679816781888e-16],
+         [2.5014148937354126e-15],
+         [-8.9597872259107286e-16],
+         [-0.55574118330633249],
+         [-2.30880068385127],
+         [-3.5787357692646129],
+         [-3.0791992625445492],
+         [-1.2914108990233886],
+         [-0.9352463555842444],
+         [-3.8854371246985275],
+         [-6.0225869277692112],
+         [-5.1819263623388778],
+         [-2.1732910447409628]], dtype=object), 'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.66059020e+00,  -3.88578059e-16,  -8.40760572e-01,
+            1.80170374e-01,   3.50135077e+00,  -1.80170374e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.05746132e+00,   5.55111512e-17,  -2.07946329e-01,
+            1.50485009e-01,   2.26540765e+00,  -1.50485009e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.14264218e+00,   1.59594560e-16,   7.51899241e-01,
+            1.05458580e-01,   3.90742938e-01,  -1.05458580e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.60999729e-01,  -1.11022302e-16,   1.78185709e+00,
+            5.71431776e-02,  -1.62085736e+00,  -5.71431776e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.24348811e-01,  -4.44089210e-16,   2.60585966e+00,
+            1.84891539e-02,  -3.23020847e+00,  -1.84891539e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.95444613e+00,  -3.88578059e-16,  -8.40760572e-01,
+            8.86314438e-01,   2.79520671e+00,  -8.86314438e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.46766349e+00,  -5.55111512e-17,  -2.07946329e-01,
+            7.40282841e-01,   1.67560982e+00,  -7.40282841e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.29317012e-01,   7.63278329e-17,   7.51899241e-01,
+            5.18783747e-01,  -2.25822291e-02,  -5.18783747e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.29622614e-02,  -1.66533454e-16,   1.78185709e+00,
+            2.81105168e-01,  -1.84481935e+00,  -2.81105168e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.96813589e-01,  -5.55111512e-16,   2.60585966e+00,
+            9.09539323e-02,  -3.30267325e+00,  -9.09539323e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.20380286e-01,  -2.77555756e-16,  -8.40760572e-01,
+            1.92038029e+00,   1.76114086e+00,  -1.92038029e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -6.03973164e-01,  -1.11022302e-16,  -2.07946329e-01,
+            1.60397316e+00,   8.11919493e-01,  -1.60397316e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.24050380e-01,  -1.38777878e-17,   7.51899241e-01,
+            1.12405038e+00,  -6.27848861e-01,  -1.12405038e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.90928547e-01,  -1.66533454e-16,   1.78185709e+00,
+            6.09071453e-01,  -2.17278564e+00,  -6.09071453e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.02929828e-01,  -5.55111512e-16,   2.60585966e+00,
+            1.97070172e-01,  -3.40878949e+00,  -1.97070172e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.13685562e-01,   0.00000000e+00,  -8.40760572e-01,
+            2.95444613e+00,   7.27075010e-01,  -2.95444613e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.59717159e-01,   5.55111512e-17,  -2.07946329e-01,
+            2.46766349e+00,  -5.17708304e-02,  -2.46766349e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.81216253e-01,   3.46944695e-17,   7.51899241e-01,
+            1.72931701e+00,  -1.23311549e+00,  -1.72931701e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.18894832e-01,  -2.77555756e-16,   1.78185709e+00,
+            9.37037739e-01,  -2.50075193e+00,  -9.37037739e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.09046068e-01,  -5.55111512e-16,   2.60585966e+00,
+            3.03186411e-01,  -3.51490572e+00,  -3.03186411e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.19829626e-01,   1.66533454e-16,  -8.40760572e-01,
+            3.66059020e+00,   2.09309461e-02,  -3.66059020e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.49514991e-01,   2.22044605e-16,  -2.07946329e-01,
+            3.05746132e+00,  -6.41568662e-01,  -3.05746132e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.94541420e-01,   3.67761377e-16,   7.51899241e-01,
+            2.14264218e+00,  -1.64644066e+00,  -2.14264218e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.42856822e-01,  -2.77555756e-16,   1.78185709e+00,
+            1.16099973e+00,  -2.72471392e+00,  -1.16099973e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.81510846e-01,  -4.44089210e-16,   2.60585966e+00,
+            3.75651189e-01,  -3.58737050e+00,  -3.75651189e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.66059020e+00,  -8.19829626e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.05746132e+00,  -8.49514991e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.14264218e+00,  -8.94541420e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.60999729e-01,  -9.42856822e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.24348811e-01,  -9.81510846e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.95444613e+00,  -1.13685562e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.46766349e+00,  -2.59717159e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -7.29317012e-01,  -4.81216253e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.29622614e-02,  -7.18894832e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.96813589e-01,  -9.09046068e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.20380286e-01,   9.20380286e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -1.15580710e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -6.03973164e-01,   6.03973164e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -8.13438773e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.24050380e-01,   1.24050380e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -4.06039638e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.90928547e-01,  -3.90928547e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.54839928e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.02929828e-01,  -8.02929828e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -1.18760780e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.13685562e-01,   1.95444613e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.59717159e-01,   1.46766349e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.81216253e-01,   7.29317012e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.18894832e-01,  -6.29622614e-02,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.09046068e-01,  -6.96813589e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.19829626e-01,   2.66059020e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.49514991e-01,   2.05746132e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.94541420e-01,   1.14264218e+00,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.42856822e-01,   1.60999729e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.81510846e-01,  -6.24348811e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C0_D01': array([[ -2.66059020e+00,  -3.88578059e-16,  -8.40760572e-01,
+            1.80170374e-01,   3.50135077e+00,  -1.80170374e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.05746132e+00,   5.55111512e-17,  -2.07946329e-01,
+            1.50485009e-01,   2.26540765e+00,  -1.50485009e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.14264218e+00,   1.59594560e-16,   7.51899241e-01,
+            1.05458580e-01,   3.90742938e-01,  -1.05458580e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.60999729e-01,  -1.11022302e-16,   1.78185709e+00,
+            5.71431776e-02,  -1.62085736e+00,  -5.71431776e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.24348811e-01,  -4.44089210e-16,   2.60585966e+00,
+            1.84891539e-02,  -3.23020847e+00,  -1.84891539e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.95444613e+00,  -3.88578059e-16,  -8.40760572e-01,
+            8.86314438e-01,   2.79520671e+00,  -8.86314438e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.46766349e+00,  -5.55111512e-17,  -2.07946329e-01,
+            7.40282841e-01,   1.67560982e+00,  -7.40282841e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.29317012e-01,   7.63278329e-17,   7.51899241e-01,
+            5.18783747e-01,  -2.25822291e-02,  -5.18783747e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.29622614e-02,  -1.66533454e-16,   1.78185709e+00,
+            2.81105168e-01,  -1.84481935e+00,  -2.81105168e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.96813589e-01,  -5.55111512e-16,   2.60585966e+00,
+            9.09539323e-02,  -3.30267325e+00,  -9.09539323e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.20380286e-01,  -2.77555756e-16,  -8.40760572e-01,
+            1.92038029e+00,   1.76114086e+00,  -1.92038029e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -6.03973164e-01,  -1.11022302e-16,  -2.07946329e-01,
+            1.60397316e+00,   8.11919493e-01,  -1.60397316e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.24050380e-01,  -1.38777878e-17,   7.51899241e-01,
+            1.12405038e+00,  -6.27848861e-01,  -1.12405038e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.90928547e-01,  -1.66533454e-16,   1.78185709e+00,
+            6.09071453e-01,  -2.17278564e+00,  -6.09071453e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.02929828e-01,  -5.55111512e-16,   2.60585966e+00,
+            1.97070172e-01,  -3.40878949e+00,  -1.97070172e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.13685562e-01,   0.00000000e+00,  -8.40760572e-01,
+            2.95444613e+00,   7.27075010e-01,  -2.95444613e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.59717159e-01,   5.55111512e-17,  -2.07946329e-01,
+            2.46766349e+00,  -5.17708304e-02,  -2.46766349e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.81216253e-01,   3.46944695e-17,   7.51899241e-01,
+            1.72931701e+00,  -1.23311549e+00,  -1.72931701e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.18894832e-01,  -2.77555756e-16,   1.78185709e+00,
+            9.37037739e-01,  -2.50075193e+00,  -9.37037739e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.09046068e-01,  -5.55111512e-16,   2.60585966e+00,
+            3.03186411e-01,  -3.51490572e+00,  -3.03186411e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.19829626e-01,   1.66533454e-16,  -8.40760572e-01,
+            3.66059020e+00,   2.09309461e-02,  -3.66059020e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.49514991e-01,   2.22044605e-16,  -2.07946329e-01,
+            3.05746132e+00,  -6.41568662e-01,  -3.05746132e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.94541420e-01,   3.67761377e-16,   7.51899241e-01,
+            2.14264218e+00,  -1.64644066e+00,  -2.14264218e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.42856822e-01,  -2.77555756e-16,   1.78185709e+00,
+            1.16099973e+00,  -2.72471392e+00,  -1.16099973e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.81510846e-01,  -4.44089210e-16,   2.60585966e+00,
+            3.75651189e-01,  -3.58737050e+00,  -3.75651189e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.75984252, -0.04098492, -0.03664021,  0.00717256,
+           0.14572757,  0.16488248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.40414338, -0.03479054, -0.11959479,  0.02979805,
+           0.60541837,  0.11502552,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.03820389, -0.02497446, -0.05433094,  0.0461882 ,
+           0.9384233 ,  0.05649   ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12175989, -0.01387763,  0.27187684,  0.03974104,
+           0.80743383,  0.0165858 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07627357, -0.00457956,  0.72381307,  0.01666732,
+           0.33863637,  0.00173637,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.35248246, -0.12338445, -0.03664021,  0.03528405,
+           0.11761608,  0.65464207,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.14425451, -0.11656837, -0.11959479,  0.14658594,
+           0.48863048,  0.45669223,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05851209, -0.09605386, -0.05433094,  0.22721421,
+           0.75739729,  0.22428539,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12450447, -0.06039878,  0.27187684,  0.1954986 ,
+           0.65167627,  0.06585154,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.06430635, -0.02170441,  0.72381307,  0.08199178,
+           0.27331191,  0.006894  ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01911252, -0.01911252, -0.03664021,  0.07645006,
+           0.07645006,  0.92196511,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07940205, -0.07940205, -0.11959479,  0.31760821,
+           0.31760821,  0.64318248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12307644, -0.12307644, -0.05433094,  0.49230575,
+           0.49230575,  0.31587231,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.10589686, -0.10589686,  0.27187684,  0.42358744,
+           0.42358744,  0.09274201,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04441296, -0.04441296,  0.72381307,  0.17765185,
+           0.17765185,  0.00970916,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12338445,  0.35248246, -0.03664021,  0.11761608,
+           0.03528405,  0.65464207,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11656837,  0.14425451, -0.11959479,  0.48863048,
+           0.14658594,  0.45669223,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09605386, -0.05851209, -0.05433094,  0.75739729,
+           0.22721421,  0.22428539,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.06039878, -0.12450447,  0.27187684,  0.65167627,
+           0.1954986 ,  0.06585154,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02170441, -0.06430635,  0.72381307,  0.27331191,
+           0.08199178,  0.006894  ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04098492,  0.75984252, -0.03664021,  0.14572757,
+           0.00717256,  0.16488248,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.03479054,  0.40414338, -0.11959479,  0.60541837,
+           0.02979805,  0.11502552,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02497446,  0.03820389, -0.05433094,  0.9384233 ,
+           0.0461882 ,  0.05649   ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01387763, -0.12175989,  0.27187684,  0.80743383,
+           0.03974104,  0.0165858 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.00457956, -0.07627357,  0.72381307,  0.33863637,
+           0.01666732,  0.00173637,  0.        ,  0.        ,  0.        ]]), 'FE2_C0': array([[ 0.75984252, -0.04098492, -0.03664021,  0.00717256,  0.14572757,
+           0.16488248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.40414338, -0.03479054, -0.11959479,  0.02979805,  0.60541837,
+           0.11502552,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.03820389, -0.02497446, -0.05433094,  0.0461882 ,  0.9384233 ,
+           0.05649   ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12175989, -0.01387763,  0.27187684,  0.03974104,  0.80743383,
+           0.0165858 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07627357, -0.00457956,  0.72381307,  0.01666732,  0.33863637,
+           0.00173637,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.35248246, -0.12338445, -0.03664021,  0.03528405,  0.11761608,
+           0.65464207,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.14425451, -0.11656837, -0.11959479,  0.14658594,  0.48863048,
+           0.45669223,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.05851209, -0.09605386, -0.05433094,  0.22721421,  0.75739729,
+           0.22428539,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12450447, -0.06039878,  0.27187684,  0.1954986 ,  0.65167627,
+           0.06585154,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.06430635, -0.02170441,  0.72381307,  0.08199178,  0.27331191,
+           0.006894  ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01911252, -0.01911252, -0.03664021,  0.07645006,  0.07645006,
+           0.92196511,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07940205, -0.07940205, -0.11959479,  0.31760821,  0.31760821,
+           0.64318248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12307644, -0.12307644, -0.05433094,  0.49230575,  0.49230575,
+           0.31587231,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.10589686, -0.10589686,  0.27187684,  0.42358744,  0.42358744,
+           0.09274201,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04441296, -0.04441296,  0.72381307,  0.17765185,  0.17765185,
+           0.00970916,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12338445,  0.35248246, -0.03664021,  0.11761608,  0.03528405,
+           0.65464207,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11656837,  0.14425451, -0.11959479,  0.48863048,  0.14658594,
+           0.45669223,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09605386, -0.05851209, -0.05433094,  0.75739729,  0.22721421,
+           0.22428539,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.06039878, -0.12450447,  0.27187684,  0.65167627,  0.1954986 ,
+           0.06585154,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02170441, -0.06430635,  0.72381307,  0.27331191,  0.08199178,
+           0.006894  ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04098492,  0.75984252, -0.03664021,  0.14572757,  0.00717256,
+           0.16488248,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.03479054,  0.40414338, -0.11959479,  0.60541837,  0.02979805,
+           0.11502552,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02497446,  0.03820389, -0.05433094,  0.9384233 ,  0.0461882 ,
+           0.05649   ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01387763, -0.12175989,  0.27187684,  0.80743383,  0.03974104,
+           0.0165858 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.00457956, -0.07627357,  0.72381307,  0.33863637,  0.01666732,
+           0.00173637,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE4': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989]], dtype=object), 'FE2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.91514755,  0.04504259,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.76436533,  0.03762125,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.53566054,  0.02636464,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.29024993,  0.01428579,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.0939128 ,  0.00462229,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.73861153,  0.22157861,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.61691587,  0.18507071,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.43232925,  0.12969594,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.23425943,  0.07027629,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.0757966 ,  0.02273848,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.48009507,  0.48009507,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.40099329,  0.40099329,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.28101259,  0.28101259,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.15226786,  0.15226786,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04926754,  0.04926754,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.22157861,  0.73861153,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.18507071,  0.61691587,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.12969594,  0.43232925,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.07027629,  0.23425943,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02273848,  0.0757966 ,  0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04504259,  0.91514755,  0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.03762125,  0.76436533,  0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02636464,  0.53566054,  0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.01428579,  0.29024993,  0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.00462229,  0.0939128 ,  0.90146491]]), 'FE0': array([[0.044306647781284285],
+         [0.15374203052449872],
+         [0.16700308084091173],
+         [0.077860127642166807],
+         [0.010565606073050682],
+         [0.17591314777898884],
+         [0.61041053408067281],
+         [0.66306161965887866],
+         [0.30913239493133543],
+         [0.041949213392945828],
+         [0.24774727000530669],
+         [0.85967163518081724],
+         [0.93382278806226415],
+         [0.43536658789519056],
+         [0.059079171899246358],
+         [0.17591314777898864],
+         [0.6104105340806727],
+         [0.663061619658879],
+         [0.30913239493133565],
+         [0.041949213392945828],
+         [0.044306647781284229],
+         [0.15374203052449861],
+         [0.16700308084091206],
+         [0.077860127642167667],
+         [0.010565606073050793]], dtype=object), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_D01': array([[1.0645419576193222],
+         [0.57528544123839909],
+         [0.069537142111522066],
+         [-0.15629783660456859],
+         [-0.1007839485374431],
+         [4.1806666025278236],
+         [2.0932175166793923],
+         [-0.019769557671948879],
+         [-0.87511767987258171],
+         [-0.50691001274709091],
+         [5.7072265601591292],
+         [2.1976263189868388],
+         [-1.1909257048519397],
+         [-2.2332066314443275],
+         [-1.1336131048331728],
+         [3.624925419221487],
+         [-0.21558316717187903],
+         [-3.5985053269365639],
+         [-3.9543169424171358],
+         [-1.7983209117704795],
+         [0.12929560203507395],
+         [-3.3101516834601297],
+         [-5.9530497856576918],
+         [-5.3382241989434531],
+         [-2.2740749932784055]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE2_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE2_C0_D10': array([[ -2.66059020e+00,  -8.19829626e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.05746132e+00,  -8.49514991e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.14264218e+00,  -8.94541420e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.60999729e-01,  -9.42856822e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.24348811e-01,  -9.81510846e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.95444613e+00,  -1.13685562e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,   2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.46766349e+00,  -2.59717159e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,   1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -7.29317012e-01,  -4.81216253e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,   1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.29622614e-02,  -7.18894832e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,   6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.96813589e-01,  -9.09046068e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,   2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.20380286e-01,   9.20380286e-01,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -1.15580710e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -6.03973164e-01,   6.03973164e-01,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -8.13438773e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.24050380e-01,   1.24050380e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -4.06039638e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.90928547e-01,  -3.90928547e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.54839928e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.02929828e-01,  -8.02929828e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -1.18760780e-15,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.13685562e-01,   1.95444613e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -2.06813170e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.59717159e-01,   1.46766349e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -1.72738065e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.81216253e-01,   7.29317012e-01,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -1.21053326e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.18894832e-01,  -6.29622614e-02,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -6.55932571e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.09046068e-01,  -6.96813589e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -2.12232479e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.19829626e-01,   2.66059020e+00,   0.00000000e+00,
+            1.59239428e-01,  -1.59239428e-01,  -3.48041982e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.49514991e-01,   2.05746132e+00,   0.00000000e+00,
+            7.92053671e-01,  -7.92053671e-01,  -2.90697631e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.94541420e-01,   1.14264218e+00,   0.00000000e+00,
+            1.75189924e+00,  -1.75189924e+00,  -2.03718360e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.42856822e-01,   1.60999729e-01,   0.00000000e+00,
+            2.78185709e+00,  -2.78185709e+00,  -1.10385655e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.81510846e-01,  -6.24348811e-01,   0.00000000e+00,
+            3.60585966e+00,  -3.60585966e+00,  -3.57162035e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE1_C0': array([[ 0.91514755,  0.04504259,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.76436533,  0.03762125,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.53566054,  0.02636464,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.29024993,  0.01428579,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.0939128 ,  0.00462229,  0.90146491,  0.        ,  0.        ,
+           0.        ],
+         [ 0.73861153,  0.22157861,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.61691587,  0.18507071,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.43232925,  0.12969594,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.23425943,  0.07027629,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.0757966 ,  0.02273848,  0.90146491,  0.        ,  0.        ,
+           0.        ],
+         [ 0.48009507,  0.48009507,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.40099329,  0.40099329,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.28101259,  0.28101259,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.15226786,  0.15226786,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04926754,  0.04926754,  0.90146491,  0.        ,  0.        ,
+           0.        ],
+         [ 0.22157861,  0.73861153,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.18507071,  0.61691587,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.12969594,  0.43232925,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.07027629,  0.23425943,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.02273848,  0.0757966 ,  0.90146491,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04504259,  0.91514755,  0.03980986,  0.        ,  0.        ,
+           0.        ],
+         [ 0.03762125,  0.76436533,  0.19801342,  0.        ,  0.        ,
+           0.        ],
+         [ 0.02636464,  0.53566054,  0.43797481,  0.        ,  0.        ,
+           0.        ],
+         [ 0.01428579,  0.29024993,  0.69546427,  0.        ,  0.        ,
+           0.        ],
+         [ 0.00462229,  0.0939128 ,  0.90146491,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.91514755,  0.04504259,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.76436533,  0.03762125,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.53566054,  0.02636464,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.29024993,  0.01428579,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.0939128 ,  0.00462229,
+           0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.73861153,  0.22157861,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.61691587,  0.18507071,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.43232925,  0.12969594,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.23425943,  0.07027629,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.0757966 ,  0.02273848,
+           0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.48009507,  0.48009507,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.40099329,  0.40099329,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.28101259,  0.28101259,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.15226786,  0.15226786,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.04926754,  0.04926754,
+           0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.22157861,  0.73861153,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.18507071,  0.61691587,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.12969594,  0.43232925,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.07027629,  0.23425943,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.02273848,  0.0757966 ,
+           0.90146491],
+         [ 0.        ,  0.        ,  0.        ,  0.04504259,  0.91514755,
+           0.03980986],
+         [ 0.        ,  0.        ,  0.        ,  0.03762125,  0.76436533,
+           0.19801342],
+         [ 0.        ,  0.        ,  0.        ,  0.02636464,  0.53566054,
+           0.43797481],
+         [ 0.        ,  0.        ,  0.        ,  0.01428579,  0.29024993,
+           0.69546427],
+         [ 0.        ,  0.        ,  0.        ,  0.00462229,  0.0939128 ,
+           0.90146491]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {'FE2_C1_D01': ['FE3_C1_D01'], 'FE2_C1_D10': ['FE3_C1_D10'], 'FE2_C0_D01': ['FE3_C0_D01'], 'FE2_C2_D10': ['FE3_C2_D10'], 'FE2_C2_D01': ['FE3_C2_D01'], 'FE2_C1': ['FE3_C1'], 'FE2_C0': ['FE3_C0'], 'FE2_C2': ['FE3_C2'], 'FE2_C0_D10': ['FE3_C0_D10']}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE2_C1_D01': 'FE2_C1_D01', 'FE3_C1_D10': 'FE2_C1_D10', 'FE0_D01': 'FE0_D01', 'FE1_C1_D10': 'FE1_C1_D10', 'FE3_C0_D10': 'FE2_C0_D10', 'FE2_C0_D01': 'FE2_C0_D01', 'FE2_C1': 'FE2_C1', 'FE2_C0': 'FE2_C0', 'FE4': 'FE4', 'FE2_C2': 'FE2_C2', 'FE0': 'FE0', 'FE1_C0_D01': 'FE1_C0_D01', 'FE2_C1_D10': 'FE2_C1_D10', 'FE3_C1_D01': 'FE2_C1_D01', 'FE1_C1_D01': 'FE1_C1_D01', 'FE2_C2_D01': 'FE2_C2_D01', 'FE3_C2_D01': 'FE2_C2_D01', 'FE3_C0_D01': 'FE2_C0_D01', 'FE2_C0_D10': 'FE2_C0_D10', 'FE2_C2_D10': 'FE2_C2_D10', 'FE1_C0_D10': 'FE1_C0_D10', 'FE3_C2': 'FE2_C2', 'FE1_C1': 'FE1_C1', 'FE3_C0': 'FE2_C0', 'FE3_C1': 'FE2_C1', 'FE1_C0': 'FE1_C0', 'FE3_C2_D10': 'FE2_C2_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D10': array([[0.9352463555842504],
+         [3.8854371246985302],
+         [6.0225869277692157],
+         [5.1819263623388867],
+         [2.173291044740961],
+         [0.55574118330633471],
+         [2.30880068385127],
+         [3.578735769264616],
+         [3.0791992625445563],
+         [1.2914108990233868],
+         [0],
+         [0],
+         [0],
+         [0],
+         [0],
+         [-0.55574118330633249],
+         [-2.30880068385127],
+         [-3.5787357692646129],
+         [-3.0791992625445492],
+         [-1.2914108990233886],
+         [-0.9352463555842444],
+         [-3.8854371246985275],
+         [-6.0225869277692112],
+         [-5.1819263623388778],
+         [-2.1732910447409628]], dtype=object), 'FE2_C0_D01': array([[-2.6605902 , -0.84076057,  0.18017037,  3.50135077, -0.18017037],
+         [-2.05746132, -0.20794633,  0.15048501,  2.26540765, -0.15048501],
+         [-1.14264218,  0.75189924,  0.10545858,  0.39074294, -0.10545858],
+         [-0.16099973,  1.78185709,  0.05714318, -1.62085736, -0.05714318],
+         [ 0.62434881,  2.60585966,  0.01848915, -3.23020847, -0.01848915],
+         [-1.95444613, -0.84076057,  0.88631444,  2.79520671, -0.88631444],
+         [-1.46766349, -0.20794633,  0.74028284,  1.67560982, -0.74028284],
+         [-0.72931701,  0.75189924,  0.51878375, -0.02258223, -0.51878375],
+         [ 0.06296226,  1.78185709,  0.28110517, -1.84481935, -0.28110517],
+         [ 0.69681359,  2.60585966,  0.09095393, -3.30267325, -0.09095393],
+         [-0.92038029, -0.84076057,  1.92038029,  1.76114086, -1.92038029],
+         [-0.60397316, -0.20794633,  1.60397316,  0.81191949, -1.60397316],
+         [-0.12405038,  0.75189924,  1.12405038, -0.62784886, -1.12405038],
+         [ 0.39092855,  1.78185709,  0.60907145, -2.17278564, -0.60907145],
+         [ 0.80292983,  2.60585966,  0.19707017, -3.40878949, -0.19707017],
+         [ 0.11368556, -0.84076057,  2.95444613,  0.72707501, -2.95444613],
+         [ 0.25971716, -0.20794633,  2.46766349, -0.05177083, -2.46766349],
+         [ 0.48121625,  0.75189924,  1.72931701, -1.23311549, -1.72931701],
+         [ 0.71889483,  1.78185709,  0.93703774, -2.50075193, -0.93703774],
+         [ 0.90904607,  2.60585966,  0.30318641, -3.51490572, -0.30318641],
+         [ 0.81982963, -0.84076057,  3.6605902 ,  0.02093095, -3.6605902 ],
+         [ 0.84951499, -0.20794633,  3.05746132, -0.64156866, -3.05746132],
+         [ 0.89454142,  0.75189924,  2.14264218, -1.64644066, -2.14264218],
+         [ 0.94285682,  1.78185709,  1.16099973, -2.72471392, -1.16099973],
+         [ 0.98151085,  2.60585966,  0.37565119, -3.5873705 , -0.37565119]]), 'FE2_C0': array([[ 0.75984252, -0.04098492, -0.03664021,  0.00717256,  0.14572757,
+           0.16488248],
+         [ 0.40414338, -0.03479054, -0.11959479,  0.02979805,  0.60541837,
+           0.11502552],
+         [ 0.03820389, -0.02497446, -0.05433094,  0.0461882 ,  0.9384233 ,
+           0.05649   ],
+         [-0.12175989, -0.01387763,  0.27187684,  0.03974104,  0.80743383,
+           0.0165858 ],
+         [-0.07627357, -0.00457956,  0.72381307,  0.01666732,  0.33863637,
+           0.00173637],
+         [ 0.35248246, -0.12338445, -0.03664021,  0.03528405,  0.11761608,
+           0.65464207],
+         [ 0.14425451, -0.11656837, -0.11959479,  0.14658594,  0.48863048,
+           0.45669223],
+         [-0.05851209, -0.09605386, -0.05433094,  0.22721421,  0.75739729,
+           0.22428539],
+         [-0.12450447, -0.06039878,  0.27187684,  0.1954986 ,  0.65167627,
+           0.06585154],
+         [-0.06430635, -0.02170441,  0.72381307,  0.08199178,  0.27331191,
+           0.006894  ],
+         [-0.01911252, -0.01911252, -0.03664021,  0.07645006,  0.07645006,
+           0.92196511],
+         [-0.07940205, -0.07940205, -0.11959479,  0.31760821,  0.31760821,
+           0.64318248],
+         [-0.12307644, -0.12307644, -0.05433094,  0.49230575,  0.49230575,
+           0.31587231],
+         [-0.10589686, -0.10589686,  0.27187684,  0.42358744,  0.42358744,
+           0.09274201],
+         [-0.04441296, -0.04441296,  0.72381307,  0.17765185,  0.17765185,
+           0.00970916],
+         [-0.12338445,  0.35248246, -0.03664021,  0.11761608,  0.03528405,
+           0.65464207],
+         [-0.11656837,  0.14425451, -0.11959479,  0.48863048,  0.14658594,
+           0.45669223],
+         [-0.09605386, -0.05851209, -0.05433094,  0.75739729,  0.22721421,
+           0.22428539],
+         [-0.06039878, -0.12450447,  0.27187684,  0.65167627,  0.1954986 ,
+           0.06585154],
+         [-0.02170441, -0.06430635,  0.72381307,  0.27331191,  0.08199178,
+           0.006894  ],
+         [-0.04098492,  0.75984252, -0.03664021,  0.14572757,  0.00717256,
+           0.16488248],
+         [-0.03479054,  0.40414338, -0.11959479,  0.60541837,  0.02979805,
+           0.11502552],
+         [-0.02497446,  0.03820389, -0.05433094,  0.9384233 ,  0.0461882 ,
+           0.05649   ],
+         [-0.01387763, -0.12175989,  0.27187684,  0.80743383,  0.03974104,
+           0.0165858 ],
+         [-0.00457956, -0.07627357,  0.72381307,  0.33863637,  0.01666732,
+           0.00173637]]), 'FE4': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989]], dtype=object), 'FE0': array([[0.044306647781284285],
+         [0.15374203052449872],
+         [0.16700308084091173],
+         [0.077860127642166807],
+         [0.010565606073050682],
+         [0.17591314777898884],
+         [0.61041053408067281],
+         [0.66306161965887866],
+         [0.30913239493133543],
+         [0.041949213392945828],
+         [0.24774727000530669],
+         [0.85967163518081724],
+         [0.93382278806226415],
+         [0.43536658789519056],
+         [0.059079171899246358],
+         [0.17591314777898864],
+         [0.6104105340806727],
+         [0.663061619658879],
+         [0.30913239493133565],
+         [0.041949213392945828],
+         [0.044306647781284229],
+         [0.15374203052449861],
+         [0.16700308084091206],
+         [0.077860127642167667],
+         [0.010565606073050793]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE0_D01': array([[1.0645419576193222],
+         [0.57528544123839909],
+         [0.069537142111522066],
+         [-0.15629783660456859],
+         [-0.1007839485374431],
+         [4.1806666025278236],
+         [2.0932175166793923],
+         [-0.019769557671948879],
+         [-0.87511767987258171],
+         [-0.50691001274709091],
+         [5.7072265601591292],
+         [2.1976263189868388],
+         [-1.1909257048519397],
+         [-2.2332066314443275],
+         [-1.1336131048331728],
+         [3.624925419221487],
+         [-0.21558316717187903],
+         [-3.5985053269365639],
+         [-3.9543169424171358],
+         [-1.7983209117704795],
+         [0.12929560203507395],
+         [-3.3101516834601297],
+         [-5.9530497856576918],
+         [-5.3382241989434531],
+         [-2.2740749932784055]], dtype=object), 'FE2_C0_D10': array([[-2.6605902 , -0.81982963,  0.15923943, -0.15923943,  3.48041982],
+         [-2.05746132, -0.84951499,  0.79205367, -0.79205367,  2.90697631],
+         [-1.14264218, -0.89454142,  1.75189924, -1.75189924,  2.0371836 ],
+         [-0.16099973, -0.94285682,  2.78185709, -2.78185709,  1.10385655],
+         [ 0.62434881, -0.98151085,  3.60585966, -3.60585966,  0.35716204],
+         [-1.95444613, -0.11368556,  0.15923943, -0.15923943,  2.0681317 ],
+         [-1.46766349, -0.25971716,  0.79205367, -0.79205367,  1.72738065],
+         [-0.72931701, -0.48121625,  1.75189924, -1.75189924,  1.21053326],
+         [ 0.06296226, -0.71889483,  2.78185709, -2.78185709,  0.65593257],
+         [ 0.69681359, -0.90904607,  3.60585966, -3.60585966,  0.21223248],
+         [-0.92038029,  0.92038029,  0.15923943, -0.15923943,  0.        ],
+         [-0.60397316,  0.60397316,  0.79205367, -0.79205367,  0.        ],
+         [-0.12405038,  0.12405038,  1.75189924, -1.75189924,  0.        ],
+         [ 0.39092855, -0.39092855,  2.78185709, -2.78185709,  0.        ],
+         [ 0.80292983, -0.80292983,  3.60585966, -3.60585966,  0.        ],
+         [ 0.11368556,  1.95444613,  0.15923943, -0.15923943, -2.0681317 ],
+         [ 0.25971716,  1.46766349,  0.79205367, -0.79205367, -1.72738065],
+         [ 0.48121625,  0.72931701,  1.75189924, -1.75189924, -1.21053326],
+         [ 0.71889483, -0.06296226,  2.78185709, -2.78185709, -0.65593257],
+         [ 0.90904607, -0.69681359,  3.60585966, -3.60585966, -0.21223248],
+         [ 0.81982963,  2.6605902 ,  0.15923943, -0.15923943, -3.48041982],
+         [ 0.84951499,  2.05746132,  0.79205367, -0.79205367, -2.90697631],
+         [ 0.89454142,  1.14264218,  1.75189924, -1.75189924, -2.0371836 ],
+         [ 0.94285682,  0.16099973,  2.78185709, -2.78185709, -1.10385655],
+         [ 0.98151085, -0.62434881,  3.60585966, -3.60585966, -0.35716204]]), 'FE1_C0': array([[ 0.91514755,  0.04504259,  0.03980986],
+         [ 0.76436533,  0.03762125,  0.19801342],
+         [ 0.53566054,  0.02636464,  0.43797481],
+         [ 0.29024993,  0.01428579,  0.69546427],
+         [ 0.0939128 ,  0.00462229,  0.90146491],
+         [ 0.73861153,  0.22157861,  0.03980986],
+         [ 0.61691587,  0.18507071,  0.19801342],
+         [ 0.43232925,  0.12969594,  0.43797481],
+         [ 0.23425943,  0.07027629,  0.69546427],
+         [ 0.0757966 ,  0.02273848,  0.90146491],
+         [ 0.48009507,  0.48009507,  0.03980986],
+         [ 0.40099329,  0.40099329,  0.19801342],
+         [ 0.28101259,  0.28101259,  0.43797481],
+         [ 0.15226786,  0.15226786,  0.69546427],
+         [ 0.04926754,  0.04926754,  0.90146491],
+         [ 0.22157861,  0.73861153,  0.03980986],
+         [ 0.18507071,  0.61691587,  0.19801342],
+         [ 0.12969594,  0.43232925,  0.43797481],
+         [ 0.07027629,  0.23425943,  0.69546427],
+         [ 0.02273848,  0.0757966 ,  0.90146491],
+         [ 0.04504259,  0.91514755,  0.03980986],
+         [ 0.03762125,  0.76436533,  0.19801342],
+         [ 0.02636464,  0.53566054,  0.43797481],
+         [ 0.01428579,  0.29024993,  0.69546427],
+         [ 0.00462229,  0.0939128 ,  0.90146491]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D10', (), False, False), 'FE2_C1_D01': ('FE2_C0_D01', (10, [6, 8, 9, 10, 11]), False, False), 'FE3_C1_D10': ('FE2_C0_D10', (11, [6, 7, 9, 10, 11]), False, False), 'FE0_D01': ('FE0_D01', (), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (5, [3, 4]), False, False), 'FE3_C0_D10': ('FE2_C0_D10', (8, [0, 1, 3, 4, 5]), False, False), 'FE2_C0_D01': ('FE2_C0_D01', (7, [0, 2, 3, 4, 5]), False, False), 'FE2_C1': ('FE2_C0', (9, [6, 7, 8, 9, 10, 11]), False, False), 'FE2_C0': ('FE2_C0', (6, [0, 1, 2, 3, 4, 5]), False, False), 'FE4': ('FE4', (), False, True), 'FE2_C2': ('FE1_C0', (12, [12, 13, 14]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (1, [0, 2]), False, False), 'FE2_C1_D10': ('FE2_C0_D10', (11, [6, 7, 9, 10, 11]), False, False), 'FE3_C1_D01': ('FE2_C0_D01', (10, [6, 8, 9, 10, 11]), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (4, [3, 5]), False, False), 'FE2_C2_D01': ('FE1_C0_D01', (13, [12, 14]), False, False), 'FE3_C2_D01': ('FE1_C0_D01', (13, [12, 14]), False, False), 'FE3_C0_D01': ('FE2_C0_D01', (7, [0, 2, 3, 4, 5]), False, False), 'FE2_C0_D10': ('FE2_C0_D10', (8, [0, 1, 3, 4, 5]), False, False), 'FE2_C2_D10': ('FE1_C0_D01', (14, [12, 13]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (2, [0, 1]), False, False), 'FE3_C2': ('FE1_C0', (12, [12, 13, 14]), False, False), 'FE1_C1': ('FE1_C0', (3, [3, 4, 5]), False, False), 'FE3_C0': ('FE2_C0', (6, [0, 1, 2, 3, 4, 5]), False, False), 'FE3_C1': ('FE2_C0', (9, [6, 7, 8, 9, 10, 11]), False, False), 'FE1_C0': ('FE1_C0', (0, [0, 1, 2]), False, False), 'FE3_C2_D10': ('FE1_C0_D01', (14, [12, 13]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {4: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 0): array([[0.0, -1.8865117801247777e-17, 2.7755575615628914e-17,
+          5.5511151231257827e-17],
+         [0.93056815579702623, 0.66999052179242813, 0.33000947820757193,
+          0.069431844202973825],
+         [0.069431844202973714, 0.33000947820757182, 0.66999052179242791,
+          0.93056815579702623]], dtype=object)}, 1: {(0, 0): array([[0.93056815579702623, 0.66999052179242813, 0.33000947820757198,
+          0.069431844202973825],
+         [0.0, -1.8865117801247777e-17, 2.7755575615628914e-17,
+          5.5511151231257827e-17],
+         [0.069431844202973714, 0.33000947820757182, 0.66999052179242802,
+          0.93056815579702623]], dtype=object)}, 2: {(0, 0): array([[0.93056815579702634, 0.66999052179242813, 0.33000947820757187,
+          0.069431844202973741],
+         [0.069431844202973686, 0.33000947820757176, 0.66999052179242813,
+          0.93056815579702634],
+         [0.0, 0.0, 0.0, 0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]]]), (0, 0): array([[[  0.00000000e+00,  -1.88651178e-17,   2.77555756e-17,
+             5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  9.30568156e-01,   6.69990522e-01,   3.30009478e-01,
+             6.94318442e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  6.94318442e-02,   3.30009478e-01,   6.69990522e-01,
+             9.30568156e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,  -1.88651178e-17,   2.77555756e-17,
+             5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  9.30568156e-01,   6.69990522e-01,   3.30009478e-01,
+             6.94318442e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  6.94318442e-02,   3.30009478e-01,   6.69990522e-01,
+             9.30568156e-01]]])}, 1: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]]]), (0, 0): array([[[  9.30568156e-01,   6.69990522e-01,   3.30009478e-01,
+             6.94318442e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,  -1.88651178e-17,   2.77555756e-17,
+             5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  6.94318442e-02,   3.30009478e-01,   6.69990522e-01,
+             9.30568156e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  9.30568156e-01,   6.69990522e-01,   3.30009478e-01,
+             6.94318442e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,  -1.88651178e-17,   2.77555756e-17,
+             5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  6.94318442e-02,   3.30009478e-01,   6.69990522e-01,
+             9.30568156e-01]]])}, 2: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.93056816,  0.66999052,  0.33000948,  0.06943184],
+          [ 0.        ,  0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.06943184,  0.33000948,  0.66999052,  0.93056816],
+          [ 0.        ,  0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ],
+          [ 0.93056816,  0.66999052,  0.33000948,  0.06943184]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ],
+          [ 0.06943184,  0.33000948,  0.66999052,  0.93056816]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ]]])}}}, MixedElement(*[MixedElement(*[FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None)], **{'value_shape': (2,) }), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {0: {(0, 0): array([[[  5.55111512e-17,  -6.93889390e-18,   7.45931095e-17,
+             5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  8.01346029e-01,   2.27784077e-01,  -1.12196967e-01,
+            -5.97902822e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -5.97902822e-02,  -1.12196967e-01,   2.27784077e-01,
+             8.01346029e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  2.58444253e-01,   8.84412890e-01,   8.84412890e-01,
+             2.58444253e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -9.71445147e-17,  -2.77555756e-17,  -6.59194921e-17,
+            -1.66533454e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -2.77555756e-17,   3.46944695e-17,   1.90819582e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  5.55111512e-17,  -6.93889390e-18,   7.45931095e-17,
+             5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  8.01346029e-01,   2.27784077e-01,  -1.12196967e-01,
+            -5.97902822e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -5.97902822e-02,  -1.12196967e-01,   2.27784077e-01,
+             8.01346029e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  2.58444253e-01,   8.84412890e-01,   8.84412890e-01,
+             2.58444253e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -9.71445147e-17,  -2.77555756e-17,  -6.59194921e-17,
+            -1.66533454e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.77555756e-17,   3.46944695e-17,   1.90819582e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,  -1.88651178e-17,   2.77555756e-17,
+             5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  9.30568156e-01,   6.69990522e-01,   3.30009478e-01,
+             6.94318442e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  6.94318442e-02,   3.30009478e-01,   6.69990522e-01,
+             9.30568156e-01]]])}, 1: {(0, 0): array([[[  8.01346029e-01,   2.27784077e-01,  -1.12196967e-01,
+            -5.97902822e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.04083409e-16,   6.93889390e-18,   8.67361738e-17,
+             8.32667268e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -5.97902822e-02,  -1.12196967e-01,   2.27784077e-01,
+             8.01346029e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.38777878e-17,  -4.16333634e-17,  -2.77555756e-17,
+            -1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  2.58444253e-01,   8.84412890e-01,   8.84412890e-01,
+             2.58444253e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -2.77555756e-17,   3.46944695e-17,  -1.56125113e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  8.01346029e-01,   2.27784077e-01,  -1.12196967e-01,
+            -5.97902822e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.04083409e-16,   6.93889390e-18,   8.67361738e-17,
+             8.32667268e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -5.97902822e-02,  -1.12196967e-01,   2.27784077e-01,
+             8.01346029e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.38777878e-17,  -4.16333634e-17,  -2.77555756e-17,
+            -1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  2.58444253e-01,   8.84412890e-01,   8.84412890e-01,
+             2.58444253e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.77555756e-17,   3.46944695e-17,  -1.56125113e-17,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  9.30568156e-01,   6.69990522e-01,   3.30009478e-01,
+             6.94318442e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,  -1.88651178e-17,   2.77555756e-17,
+             5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  6.94318442e-02,   3.30009478e-01,   6.69990522e-01,
+             9.30568156e-01]]])}, 2: {(0, 0): array([[[  8.01346029e-01,   2.27784077e-01,  -1.12196967e-01,
+            -5.97902822e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -5.97902822e-02,  -1.12196967e-01,   2.27784077e-01,
+             8.01346029e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -5.55111512e-17,   0.00000000e+00,   0.00000000e+00,
+             5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  2.58444253e-01,   8.84412890e-01,   8.84412890e-01,
+             2.58444253e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  8.01346029e-01,   2.27784077e-01,  -1.12196967e-01,
+            -5.97902822e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -5.97902822e-02,  -1.12196967e-01,   2.27784077e-01,
+             8.01346029e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -5.55111512e-17,   0.00000000e+00,   0.00000000e+00,
+             5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17,
+            -1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  2.58444253e-01,   8.84412890e-01,   8.84412890e-01,
+             2.58444253e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  9.30568156e-01,   6.69990522e-01,   3.30009478e-01,
+             6.94318442e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  6.94318442e-02,   3.30009478e-01,   6.69990522e-01,
+             9.30568156e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]]])}}}, FiniteElement('Bubble', Domain(Cell('triangle', 2), label=None, data=None), 3, quad_scheme=None): {None: {0: {(0, 0): array([[-9.3675067702747583e-17, 1.5959455978986625e-16,
+          -1.6653345369377348e-16, -5.5511151231257827e-17]], dtype=object)}, 1: {(0, 0): array([[-1.214306433183765e-16, 1.0408340855860843e-16,
+          -3.6082248300317588e-16, -1.6653345369377348e-16]], dtype=object)}, 2: {(0, 0): array([[8.3266726846886741e-17, 8.3266726846886741e-17,
+          5.5511151231257827e-17, -2.7755575615628914e-17]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE2_f1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE2_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f0': array([[-9.3675067702747583e-17],
+         [1.5959455978986625e-16],
+         [-1.6653345369377348e-16],
+         [-5.5511151231257827e-17]], dtype=object), 'FE0_f1': array([[-1.214306433183765e-16],
+         [1.0408340855860843e-16],
+         [-3.6082248300317588e-16],
+         [-1.6653345369377348e-16]], dtype=object), 'FE0_f2': array([[8.3266726846886741e-17],
+         [8.3266726846886741e-17],
+         [5.5511151231257827e-17],
+         [-2.7755575615628914e-17]], dtype=object), 'FE2_f0_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE2_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.30568156e-01,   6.94318442e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.88651178e-17,   6.69990522e-01,   3.30009478e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   3.30009478e-01,   6.69990522e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   6.94318442e-02,   9.30568156e-01]]), 'FE2_f0_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.01346029e-01,   1.04083409e-16,  -5.97902822e-02,
+           -1.38777878e-17,   2.58444253e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.27784077e-01,   6.93889390e-18,  -1.12196967e-01,
+           -4.16333634e-17,   8.84412890e-01,   3.46944695e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.12196967e-01,   8.67361738e-17,   2.27784077e-01,
+           -2.77555756e-17,   8.84412890e-01,  -1.56125113e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -5.97902822e-02,   8.32667268e-17,   8.01346029e-01,
+           -1.11022302e-16,   2.58444253e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f1_C0': array([[  8.01346029e-01,   1.04083409e-16,  -5.97902822e-02,
+           -1.38777878e-17,   2.58444253e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.27784077e-01,   6.93889390e-18,  -1.12196967e-01,
+           -4.16333634e-17,   8.84412890e-01,   3.46944695e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.12196967e-01,   8.67361738e-17,   2.27784077e-01,
+           -2.77555756e-17,   8.84412890e-01,  -1.56125113e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -5.97902822e-02,   8.32667268e-17,   8.01346029e-01,
+           -1.11022302e-16,   2.58444253e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f0_C0': array([[  0.00000000e+00,   9.30568156e-01,   6.94318442e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.88651178e-17,   6.69990522e-01,   3.30009478e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.77555756e-17,   3.30009478e-01,   6.69990522e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   6.94318442e-02,   9.30568156e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE2_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f2': array([[0.93056815579702634, 0.069431844202973686, 0.0],
+         [0.66999052179242813, 0.33000947820757176, 0.0],
+         [0.33000947820757187, 0.66999052179242813, 0.0],
+         [0.069431844202973741, 0.93056815579702634, 0.0]], dtype=object), 'FE1_f1': array([[0.93056815579702623, 0.0, 0.069431844202973714],
+         [0.66999052179242813, -1.8865117801247777e-17, 0.33000947820757182],
+         [0.33000947820757198, 2.7755575615628914e-17, 0.66999052179242802],
+         [0.069431844202973825, 5.5511151231257827e-17, 0.93056815579702623]], dtype=object), 'FE1_f0': array([[0.0, 0.93056815579702623, 0.069431844202973714],
+         [-1.8865117801247777e-17, 0.66999052179242813, 0.33000947820757182],
+         [2.7755575615628914e-17, 0.33000947820757193, 0.66999052179242791],
+         [5.5511151231257827e-17, 0.069431844202973825, 0.93056815579702623]], dtype=object), 'FE3_f2_C0': array([[  8.01346029e-01,  -5.97902822e-02,   0.00000000e+00,
+           -5.55111512e-17,  -2.77555756e-17,   2.58444253e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.27784077e-01,  -1.12196967e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   8.84412890e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.12196967e-01,   2.27784077e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   8.84412890e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -5.97902822e-02,   8.01346029e-01,   0.00000000e+00,
+            5.55111512e-17,  -1.11022302e-16,   2.58444253e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f2_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.93056816,  0.06943184,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.66999052,  0.33000948,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.33000948,  0.66999052,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06943184,  0.93056816,  0.        ]]), 'FE2_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE3_f1_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.30568156e-01,   0.00000000e+00,   6.94318442e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.69990522e-01,  -1.88651178e-17,   3.30009478e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.30009478e-01,   2.77555756e-17,   6.69990522e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.94318442e-02,   5.55111512e-17,   9.30568156e-01]]), 'FE2_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.93056816,  0.06943184,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.66999052,  0.33000948,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.33000948,  0.66999052,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.06943184,  0.93056816,
+           0.        ]]), 'FE2_f2_C0': array([[ 0.93056816,  0.06943184,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.66999052,  0.33000948,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.33000948,  0.66999052,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.06943184,  0.93056816,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE2_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE3_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.01346029e-01,  -5.97902822e-02,   0.00000000e+00,
+           -5.55111512e-17,  -2.77555756e-17,   2.58444253e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.27784077e-01,  -1.12196967e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   8.84412890e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.12196967e-01,   2.27784077e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   8.84412890e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -5.97902822e-02,   8.01346029e-01,   0.00000000e+00,
+            5.55111512e-17,  -1.11022302e-16,   2.58444253e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C0': array([[  9.30568156e-01,   0.00000000e+00,   6.94318442e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.69990522e-01,  -1.88651178e-17,   3.30009478e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.30009478e-01,   2.77555756e-17,   6.69990522e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.94318442e-02,   5.55111512e-17,   9.30568156e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.30568156e-01,   0.00000000e+00,   6.94318442e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.69990522e-01,  -1.88651178e-17,   3.30009478e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.30009478e-01,   2.77555756e-17,   6.69990522e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.94318442e-02,   5.55111512e-17,   9.30568156e-01]]), 'FE3_f0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.30568156e-01,   6.94318442e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.88651178e-17,   6.69990522e-01,   3.30009478e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   3.30009478e-01,   6.69990522e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   6.94318442e-02,   9.30568156e-01]]), 'FE3_f0_C0': array([[  5.55111512e-17,   8.01346029e-01,  -5.97902822e-02,
+            2.58444253e-01,  -9.71445147e-17,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -6.93889390e-18,   2.27784077e-01,  -1.12196967e-01,
+            8.84412890e-01,  -2.77555756e-17,   3.46944695e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.45931095e-17,  -1.12196967e-01,   2.27784077e-01,
+            8.84412890e-01,  -6.59194921e-17,   1.90819582e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,  -5.97902822e-02,   8.01346029e-01,
+            2.58444253e-01,  -1.66533454e-16,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   8.01346029e-01,  -5.97902822e-02,
+            2.58444253e-01,  -9.71445147e-17,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -6.93889390e-18,   2.27784077e-01,  -1.12196967e-01,
+            8.84412890e-01,  -2.77555756e-17,   3.46944695e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.45931095e-17,  -1.12196967e-01,   2.27784077e-01,
+            8.84412890e-01,  -6.59194921e-17,   1.90819582e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,  -5.97902822e-02,   8.01346029e-01,
+            2.58444253e-01,  -1.66533454e-16,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[-9.3675067702747583e-17],
+         [1.5959455978986625e-16],
+         [-1.6653345369377348e-16],
+         [-5.5511151231257827e-17]], dtype=object), 'FE2_f0_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE2_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.30568156e-01,   6.94318442e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.88651178e-17,   6.69990522e-01,   3.30009478e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   3.30009478e-01,   6.69990522e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   6.94318442e-02,   9.30568156e-01]]), 'FE2_f0_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.01346029e-01,   1.04083409e-16,  -5.97902822e-02,
+           -1.38777878e-17,   2.58444253e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.27784077e-01,   6.93889390e-18,  -1.12196967e-01,
+           -4.16333634e-17,   8.84412890e-01,   3.46944695e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.12196967e-01,   8.67361738e-17,   2.27784077e-01,
+           -2.77555756e-17,   8.84412890e-01,  -1.56125113e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -5.97902822e-02,   8.32667268e-17,   8.01346029e-01,
+           -1.11022302e-16,   2.58444253e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f1_C0': array([[  8.01346029e-01,   1.04083409e-16,  -5.97902822e-02,
+           -1.38777878e-17,   2.58444253e-01,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.27784077e-01,   6.93889390e-18,  -1.12196967e-01,
+           -4.16333634e-17,   8.84412890e-01,   3.46944695e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.12196967e-01,   8.67361738e-17,   2.27784077e-01,
+           -2.77555756e-17,   8.84412890e-01,  -1.56125113e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -5.97902822e-02,   8.32667268e-17,   8.01346029e-01,
+           -1.11022302e-16,   2.58444253e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f0_C0': array([[  0.00000000e+00,   9.30568156e-01,   6.94318442e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.88651178e-17,   6.69990522e-01,   3.30009478e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.77555756e-17,   3.30009478e-01,   6.69990522e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   6.94318442e-02,   9.30568156e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f2': array([[0.93056815579702634, 0.069431844202973686, 0.0],
+         [0.66999052179242813, 0.33000947820757176, 0.0],
+         [0.33000947820757187, 0.66999052179242813, 0.0],
+         [0.069431844202973741, 0.93056815579702634, 0.0]], dtype=object), 'FE1_f1': array([[0.93056815579702623, 0.0, 0.069431844202973714],
+         [0.66999052179242813, -1.8865117801247777e-17, 0.33000947820757182],
+         [0.33000947820757198, 2.7755575615628914e-17, 0.66999052179242802],
+         [0.069431844202973825, 5.5511151231257827e-17, 0.93056815579702623]], dtype=object), 'FE1_f0': array([[0.0, 0.93056815579702623, 0.069431844202973714],
+         [-1.8865117801247777e-17, 0.66999052179242813, 0.33000947820757182],
+         [2.7755575615628914e-17, 0.33000947820757193, 0.66999052179242791],
+         [5.5511151231257827e-17, 0.069431844202973825, 0.93056815579702623]], dtype=object), 'FE3_f2_C0': array([[  8.01346029e-01,  -5.97902822e-02,   0.00000000e+00,
+           -5.55111512e-17,  -2.77555756e-17,   2.58444253e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.27784077e-01,  -1.12196967e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   8.84412890e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.12196967e-01,   2.27784077e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   8.84412890e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -5.97902822e-02,   8.01346029e-01,   0.00000000e+00,
+            5.55111512e-17,  -1.11022302e-16,   2.58444253e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.93056816,  0.06943184,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.66999052,  0.33000948,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.33000948,  0.66999052,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06943184,  0.93056816,  0.        ]]), 'FE2_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE3_f1_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.30568156e-01,   0.00000000e+00,   6.94318442e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.69990522e-01,  -1.88651178e-17,   3.30009478e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.30009478e-01,   2.77555756e-17,   6.69990522e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.94318442e-02,   5.55111512e-17,   9.30568156e-01]]), 'FE2_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.93056816,  0.06943184,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.66999052,  0.33000948,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.33000948,  0.66999052,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.06943184,  0.93056816,
+           0.        ]]), 'FE2_f2_C0': array([[ 0.93056816,  0.06943184,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.66999052,  0.33000948,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.33000948,  0.66999052,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.06943184,  0.93056816,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE3_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.01346029e-01,  -5.97902822e-02,   0.00000000e+00,
+           -5.55111512e-17,  -2.77555756e-17,   2.58444253e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.27784077e-01,  -1.12196967e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   8.84412890e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.12196967e-01,   2.27784077e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   8.84412890e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -5.97902822e-02,   8.01346029e-01,   0.00000000e+00,
+            5.55111512e-17,  -1.11022302e-16,   2.58444253e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C0': array([[  9.30568156e-01,   0.00000000e+00,   6.94318442e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.69990522e-01,  -1.88651178e-17,   3.30009478e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  3.30009478e-01,   2.77555756e-17,   6.69990522e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.94318442e-02,   5.55111512e-17,   9.30568156e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.30568156e-01,   0.00000000e+00,   6.94318442e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.69990522e-01,  -1.88651178e-17,   3.30009478e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            3.30009478e-01,   2.77555756e-17,   6.69990522e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.94318442e-02,   5.55111512e-17,   9.30568156e-01]]), 'FE3_f0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   9.30568156e-01,   6.94318442e-02],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.88651178e-17,   6.69990522e-01,   3.30009478e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   3.30009478e-01,   6.69990522e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   6.94318442e-02,   9.30568156e-01]]), 'FE3_f0_C0': array([[  5.55111512e-17,   8.01346029e-01,  -5.97902822e-02,
+            2.58444253e-01,  -9.71445147e-17,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -6.93889390e-18,   2.27784077e-01,  -1.12196967e-01,
+            8.84412890e-01,  -2.77555756e-17,   3.46944695e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.45931095e-17,  -1.12196967e-01,   2.27784077e-01,
+            8.84412890e-01,  -6.59194921e-17,   1.90819582e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,  -5.97902822e-02,   8.01346029e-01,
+            2.58444253e-01,  -1.66533454e-16,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   8.01346029e-01,  -5.97902822e-02,
+            2.58444253e-01,  -9.71445147e-17,  -2.77555756e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -6.93889390e-18,   2.27784077e-01,  -1.12196967e-01,
+            8.84412890e-01,  -2.77555756e-17,   3.46944695e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.45931095e-17,  -1.12196967e-01,   2.27784077e-01,
+            8.84412890e-01,  -6.59194921e-17,   1.90819582e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,  -5.97902822e-02,   8.01346029e-01,
+            2.58444253e-01,  -1.66533454e-16,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE2_f0_C0_D10': ['FE2_f1_C0_D10', 'FE2_f2_C0_D10'], 'FE2_f0_C1_D01': ['FE2_f1_C1_D01', 'FE2_f2_C1_D01'], 'FE2_f0_C0_D01': ['FE2_f1_C0_D01', 'FE2_f2_C0_D01'], 'FE0_f0': ['FE0_f1', 'FE0_f2'], 'FE2_f0_C1_D10': ['FE2_f1_C1_D10', 'FE2_f2_C1_D10']}
+  
+  inv_name_map: {'FE2_f1_C1_D01': 'FE2_f0_C1_D01', 'FE2_f2_C0_D10': 'FE2_f0_C0_D10', 'FE0_f0': 'FE0_f0', 'FE0_f1': 'FE0_f0', 'FE0_f2': 'FE0_f0', 'FE2_f0_C1_D01': 'FE2_f0_C1_D01', 'FE2_f2_C0': 'FE2_f2_C0', 'FE2_f0_C1': 'FE2_f0_C1', 'FE2_f0_C0_D01': 'FE2_f0_C0_D01', 'FE3_f1_C1': 'FE3_f1_C1', 'FE3_f1_C0': 'FE3_f1_C0', 'FE2_f0_C0': 'FE2_f0_C0', 'FE2_f2_C1_D01': 'FE2_f0_C1_D01', 'FE2_f1_C0_D10': 'FE2_f0_C0_D10', 'FE1_f2': 'FE1_f2', 'FE1_f1': 'FE1_f1', 'FE1_f0': 'FE1_f0', 'FE3_f2_C0': 'FE3_f2_C0', 'FE2_f2_C0_D01': 'FE2_f0_C0_D01', 'FE3_f2_C2': 'FE3_f2_C2', 'FE2_f0_C1_D10': 'FE2_f0_C1_D10', 'FE2_f1_C1_D10': 'FE2_f0_C1_D10', 'FE3_f1_C2': 'FE3_f1_C2', 'FE2_f2_C1': 'FE2_f2_C1', 'FE2_f0_C0_D10': 'FE2_f0_C0_D10', 'FE2_f2_C1_D10': 'FE2_f0_C1_D10', 'FE3_f2_C1': 'FE3_f2_C1', 'FE2_f1_C0_D01': 'FE2_f0_C0_D01', 'FE2_f1_C0': 'FE2_f1_C0', 'FE2_f1_C1': 'FE2_f1_C1', 'FE3_f0_C2': 'FE3_f0_C2', 'FE3_f0_C0': 'FE3_f0_C0', 'FE3_f0_C1': 'FE3_f0_C1'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0],
+         [0],
+         [0],
+         [0]], dtype=object), 'FE2_f0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE1_f0': array([[0.93056815579702623, 0.069431844202973714],
+         [0.66999052179242813, 0.33000947820757182],
+         [0.33000947820757193, 0.66999052179242791],
+         [0.069431844202973825, 0.93056815579702623]], dtype=object), 'FE3_f0_C0': array([[ 0.80134603, -0.05979028,  0.25844425],
+         [ 0.22778408, -0.11219697,  0.88441289],
+         [-0.11219697,  0.22778408,  0.88441289],
+         [-0.05979028,  0.80134603,  0.25844425]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE2_f1_C1_D01': ('FE2_f0_C0_D01', (7, [3, 5]), False, False), 'FE2_f2_C0_D10': ('FE2_f0_C0_D01', (5, [0, 1]), False, False), 'FE0_f0': ('FE0_f0', (), True, False), 'FE0_f1': ('FE0_f0', (), True, False), 'FE0_f2': ('FE0_f0', (), True, False), 'FE2_f0_C1_D01': ('FE2_f0_C0_D01', (7, [3, 5]), False, False), 'FE2_f2_C0': ('FE1_f0', (11, [0, 1]), False, False), 'FE2_f0_C1': ('FE1_f0', (6, [4, 5]), False, False), 'FE2_f0_C0_D01': ('FE2_f0_C0_D01', (4, [0, 2]), False, False), 'FE3_f1_C1': ('FE3_f0_C0', (17, [6, 8, 10]), False, False), 'FE3_f1_C0': ('FE3_f0_C0', (16, [0, 2, 4]), False, False), 'FE2_f0_C0': ('FE1_f0', (3, [1, 2]), False, False), 'FE2_f2_C1_D01': ('FE2_f0_C0_D01', (7, [3, 5]), False, False), 'FE2_f1_C0_D10': ('FE2_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f2': ('FE1_f0', (2, [0, 1]), False, False), 'FE1_f1': ('FE1_f0', (1, [0, 2]), False, False), 'FE1_f0': ('FE1_f0', (0, [1, 2]), False, False), 'FE3_f2_C0': ('FE3_f0_C0', (19, [0, 1, 5]), False, False), 'FE2_f2_C0_D01': ('FE2_f0_C0_D01', (4, [0, 2]), False, False), 'FE3_f2_C2': ('FE1_f0', (21, [12, 13]), False, False), 'FE2_f0_C1_D10': ('FE2_f0_C0_D01', (8, [3, 4]), False, False), 'FE2_f1_C1_D10': ('FE2_f0_C0_D01', (8, [3, 4]), False, False), 'FE3_f1_C2': ('FE1_f0', (18, [12, 14]), False, False), 'FE2_f2_C1': ('FE1_f0', (12, [3, 4]), False, False), 'FE2_f0_C0_D10': ('FE2_f0_C0_D01', (5, [0, 1]), False, False), 'FE2_f2_C1_D10': ('FE2_f0_C0_D01', (8, [3, 4]), False, False), 'FE3_f2_C1': ('FE3_f0_C0', (20, [6, 7, 11]), False, False), 'FE2_f1_C0_D01': ('FE2_f0_C0_D01', (4, [0, 2]), False, False), 'FE2_f1_C0': ('FE1_f0', (9, [0, 2]), False, False), 'FE2_f1_C1': ('FE1_f0', (10, [3, 5]), False, False), 'FE3_f0_C2': ('FE1_f0', (15, [13, 14]), False, False), 'FE3_f0_C0': ('FE3_f0_C0', (13, [1, 2, 3]), False, False), 'FE3_f0_C1': ('FE3_f0_C0', (14, [7, 8, 9]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00325 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00315 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.0031 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00465 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.0048 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00527 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.0045 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.0044 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.0047 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00459 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00455 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00455 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00847 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00678 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.0048 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00486 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00475 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00475 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00811 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00484 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  1350 entries computed in 0.00478 seconds
+  Shape of reference tensor: (15, 15, 6)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {16: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 1.0, 0.99999999999999989, 1.0, 1.0, 0.99999999999999989,
+          0.99999999999999989, 1.0, 1.0, 1.0, 0.99999999999999989, 1.0, 1.0,
+          0.99999999999999989, 0.99999999999999989, 1.0]], dtype=object)}}}, FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {None: {(0, 1): array([[-2.5097152373218705, -1.6917874526020253, -0.54998993362677662,
+          0.4797756831326625, -1.5269250065645008, -0.93803330652173278,
+          -0.11596185398603498, 0.6254488622506863, -0.2446582089774276,
+          0.04540536107422885, 0.45032358346170304, 0.81551168037419208,
+          0.7381320217799433, 0.79915950715452166, 0.8843516631024444,
+          0.9611848594922161],
+         [-1.6653345369377348e-16, 1.1102230246251565e-16,
+          2.7755575615628914e-17, -4.4408920985006262e-16,
+          -1.6653345369377348e-16, 0.0, -2.7755575615628914e-17,
+          -4.4408920985006262e-16, -2.2204460492503131e-16,
+          1.6653345369377348e-16, -8.3266726846886741e-17,
+          -4.4408920985006262e-16, 1.6653345369377348e-16,
+          1.9428902930940239e-16, 2.7755575615628914e-17,
+          -4.4408920985006262e-16],
+         [-0.77158321554192932, 0.10737205455249504, 1.3343617294756669,
+          2.4409605426248775, -0.77158321554192888, 0.10737205455249532,
+          1.3343617294756669, 2.4409605426248775, -0.77158321554192888,
+          0.10737205455249538, 1.3343617294756669, 2.4409605426248775,
+          -0.7715832155419291, 0.1073720545524951, 1.3343617294756669,
+          2.4409605426248775],
+         [0.2618679782200577, 0.20084049284547795, 0.11564833689755472,
+          0.03881514050778323, 1.2446582089774276, 0.95459463892577068,
+          0.54967641653829635, 0.18448831962580736, 2.5269250065645004,
+          1.9380333065217321, 1.1159618539860343, 0.37455113774931248,
+          3.5097152373218696, 2.6917874526020245, 1.5499899336267755,
+          0.52022431686733683],
+         [3.2812984528638003, 1.5844153980495301, -0.78437179584889039,
+          -2.9207362257575396, 2.2985082221064306, 0.83066125196923757,
+          -1.2183998754896317, -3.0664094048755635, 1.0162414245193578,
+          -0.15277741562672359, -1.7846853129373699, -3.2564722229990686,
+          0.033451193761987463, -0.90653156170701621, -2.2187133925781106,
+          -3.4021454021170929],
+         [-0.26186797822005725, -0.20084049284547775, -0.1156483368975546,
+          -0.038815140507784007, -1.2446582089774285, -0.95459463892577068,
+          -0.54967641653829646, -0.18448831962580781, -2.5269250065645021,
+          -1.9380333065217328, -1.1159618539860348, -0.37455113774931359,
+          -3.5097152373218719, -2.6917874526020249, -1.5499899336267764,
+          -0.52022431686733772]], dtype=object), (1, 0): array([[-2.5097152373218714, -1.6917874526020258, -0.54998993362677651,
+          0.47977568313266317, -1.5269250065645006, -0.93803330652173278,
+          -0.11596185398603487, 0.62544886225068697, -0.24465820897742774,
+          0.045405361074228601, 0.45032358346170309, 0.81551168037419286,
+          0.7381320217799423, 0.799159507154521, 0.88435166310244473,
+          0.96118485949221688],
+         [-0.73813202177994264, -0.79915950715452166, -0.88435166310244473,
+          -0.9611848594922161, 0.24465820897742863, -0.045405361074228628,
+          -0.45032358346170315, -0.8155116803741923, 1.5269250065645017,
+          0.93803330652173311, 0.11596185398603487, -0.62544886225068641,
+          2.5097152373218714, 1.6917874526020251, 0.54998993362677651,
+          -0.47977568313266239],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
+          0.0, 0.0, 0.0],
+         [0.22841678445806923, 1.1073720545524943, 2.334361729475666,
+          3.4409605426248748, 0.22841678445806934, 1.1073720545524943,
+          2.334361729475666, 3.4409605426248748, 0.22841678445806934,
+          1.1073720545524945, 2.334361729475666, 3.4409605426248748,
+          0.22841678445806923, 1.1073720545524943, 2.334361729475666,
+          3.4409605426248748],
+         [-0.22841678445806923, -1.1073720545524943, -2.334361729475666,
+          -3.4409605426248748, -0.22841678445806934, -1.1073720545524943,
+          -2.334361729475666, -3.4409605426248748, -0.22841678445806934,
+          -1.1073720545524945, -2.334361729475666, -3.4409605426248748,
+          -0.22841678445806923, -1.1073720545524943, -2.334361729475666,
+          -3.4409605426248748],
+         [3.2478472591018139, 2.4909469597565472, 1.4343415967292208,
+          0.48140917635955227, 1.2822667975870721, 0.98343866759596121,
+          0.56628543744773763, 0.19006281812350467, -1.2822667975870738,
+          -0.98343866759596188, -0.5662854374477384, -0.1900628181235072,
+          -3.2478472591018139, -2.4909469597565463, -1.4343415967292217,
+          -0.48140917635955516]], dtype=object), (0, 0): array([[0.6623338215556972, 0.23276809809770654, -0.08718888411365161,
+          -0.096226911734323323, 0.16643749695900031, -0.015011689481987923,
+          -0.12331910605251509, -0.076101715088665228, -0.11751779509749458,
+          -0.12474229414821481, -0.0996510837722763, -0.041867587396657691,
+          -0.056895139802881876, -0.045168010265567847,
+          -0.027240266995992635, -0.0095154582353661338],
+         [-0.056895139802881842, -0.04516801026556784, -0.027240266995992645,
+          -0.0095154582353662032, -0.11751779509749462, -0.12474229414821482,
+          -0.099651083772276355, -0.041867587396657691, 0.16643749695900029,
+          -0.015011689481988087, -0.12331910605251518, -0.076101715088665284,
+          0.6623338215556972, 0.23276809809770624, -0.087188884113651763,
+          -0.096226911734323434],
+         [-0.05058241768674708, -0.12355890523764695, 0.09756515313616182,
+          0.61978604633144241, -0.05058241768674708, -0.12355890523764693,
+          0.09756515313616182, 0.61978604633144241, -0.05058241768674708,
+          -0.12355890523764695, 0.09756515313616182, 0.61978604633144241,
+          -0.05058241768674708, -0.12355890523764693, 0.09756515313616182,
+          0.61978604633144241],
+         [0.014953760384390308, 0.055601287299908417, 0.067491262932790785,
+          0.033390341735931695, 0.07107520646099133, 0.26427285664300715,
+          0.32078589759058163, 0.15870425710189318, 0.14429802114153809,
+          0.53653098110853426, 0.65126466087492807, 0.32220392154766114,
+          0.20041946721813905, 0.74520255045163286, 0.90455929553271897,
+          0.44751783691362274],
+         [0.20041946721813891, 0.74520255045163297, 0.90455929553271897,
+          0.44751783691362235, 0.14429802114153806, 0.53653098110853414,
+          0.65126466087492807, 0.32220392154766098, 0.071075206460991261,
+          0.26427285664300726, 0.32078589759058174, 0.15870425710189295,
+          0.014953760384390294, 0.0556012872999085, 0.067491262932790869,
+          0.033390341735931361],
+         [0.22977050833140236, 0.13515497965396686, 0.044813439507972466,
+          0.0050481449886929514, 0.78628948822271205, 0.46250905111630813,
+          0.15335447822311959, 0.017275077504326344, 0.78628948822271205,
+          0.46250905111630836, 0.15335447822311959, 0.017275077504326344,
+          0.22977050833140236, 0.13515497965396692, 0.044813439507972466,
+          0.0050481449886928959]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   1.11022302e-16,
+             0.00000000e+00,   0.00000000e+00,   1.11022302e-16,
+             1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   1.11022302e-16,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   1.11022302e-16,
+             0.00000000e+00,   0.00000000e+00,   1.11022302e-16,
+             1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   1.11022302e-16,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.,
+           -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,
+            1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,
+            0.,  0.,  0.]]]), (0, 0): array([[[ 0.87742881,  0.67294686,  0.38749748,  0.13005608,  0.63173125,
+            0.48450833,  0.27899046,  0.09363778,  0.31116455,  0.23864866,
+            0.1374191 ,  0.04612208,  0.06546699,  0.05021012,  0.02891208,
+            0.00970379],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.06546699,  0.05021012,  0.02891208,  0.00970379,  0.31116455,
+            0.23864866,  0.1374191 ,  0.04612208,  0.63173125,  0.48450833,
+            0.27899046,  0.09363778,  0.87742881,  0.67294686,  0.38749748,
+            0.13005608],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.0571042 ,  0.27684301,  0.58359043,  0.86024014,  0.0571042 ,
+            0.27684301,  0.58359043,  0.86024014,  0.0571042 ,  0.27684301,
+            0.58359043,  0.86024014,  0.0571042 ,  0.27684301,  0.58359043,
+            0.86024014],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.87742881,  0.67294686,  0.38749748,  0.13005608,  0.63173125,
+            0.48450833,  0.27899046,  0.09363778,  0.31116455,  0.23864866,
+            0.1374191 ,  0.04612208,  0.06546699,  0.05021012,  0.02891208,
+            0.00970379]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.06546699,  0.05021012,  0.02891208,  0.00970379,  0.31116455,
+            0.23864866,  0.1374191 ,  0.04612208,  0.63173125,  0.48450833,
+            0.27899046,  0.09363778,  0.87742881,  0.67294686,  0.38749748,
+            0.13005608]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.0571042 ,  0.27684301,  0.58359043,  0.86024014,  0.0571042 ,
+            0.27684301,  0.58359043,  0.86024014,  0.0571042 ,  0.27684301,
+            0.58359043,  0.86024014,  0.0571042 ,  0.27684301,  0.58359043,
+            0.86024014]]])}}}, MixedElement(*[VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[ -2.50971524e+00,  -1.69178745e+00,  -5.49989934e-01,
+             4.79775683e-01,  -1.52692501e+00,  -9.38033307e-01,
+            -1.15961854e-01,   6.25448862e-01,  -2.44658209e-01,
+             4.54053611e-02,   4.50323583e-01,   8.15511680e-01,
+             7.38132022e-01,   7.99159507e-01,   8.84351663e-01,
+             9.61184859e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.66533454e-16,   1.11022302e-16,   2.77555756e-17,
+            -4.44089210e-16,  -1.66533454e-16,   0.00000000e+00,
+            -2.77555756e-17,  -4.44089210e-16,  -2.22044605e-16,
+             1.66533454e-16,  -8.32667268e-17,  -4.44089210e-16,
+             1.66533454e-16,   1.94289029e-16,   2.77555756e-17,
+            -4.44089210e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -7.71583216e-01,   1.07372055e-01,   1.33436173e+00,
+             2.44096054e+00,  -7.71583216e-01,   1.07372055e-01,
+             1.33436173e+00,   2.44096054e+00,  -7.71583216e-01,
+             1.07372055e-01,   1.33436173e+00,   2.44096054e+00,
+            -7.71583216e-01,   1.07372055e-01,   1.33436173e+00,
+             2.44096054e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  2.61867978e-01,   2.00840493e-01,   1.15648337e-01,
+             3.88151405e-02,   1.24465821e+00,   9.54594639e-01,
+             5.49676417e-01,   1.84488320e-01,   2.52692501e+00,
+             1.93803331e+00,   1.11596185e+00,   3.74551138e-01,
+             3.50971524e+00,   2.69178745e+00,   1.54998993e+00,
+             5.20224317e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  3.28129845e+00,   1.58441540e+00,  -7.84371796e-01,
+            -2.92073623e+00,   2.29850822e+00,   8.30661252e-01,
+            -1.21839988e+00,  -3.06640940e+00,   1.01624142e+00,
+            -1.52777416e-01,  -1.78468531e+00,  -3.25647222e+00,
+             3.34511938e-02,  -9.06531562e-01,  -2.21871339e+00,
+            -3.40214540e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -2.61867978e-01,  -2.00840493e-01,  -1.15648337e-01,
+            -3.88151405e-02,  -1.24465821e+00,  -9.54594639e-01,
+            -5.49676417e-01,  -1.84488320e-01,  -2.52692501e+00,
+            -1.93803331e+00,  -1.11596185e+00,  -3.74551138e-01,
+            -3.50971524e+00,  -2.69178745e+00,  -1.54998993e+00,
+            -5.20224317e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.50971524e+00,  -1.69178745e+00,  -5.49989934e-01,
+             4.79775683e-01,  -1.52692501e+00,  -9.38033307e-01,
+            -1.15961854e-01,   6.25448862e-01,  -2.44658209e-01,
+             4.54053611e-02,   4.50323583e-01,   8.15511680e-01,
+             7.38132022e-01,   7.99159507e-01,   8.84351663e-01,
+             9.61184859e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.66533454e-16,   1.11022302e-16,   2.77555756e-17,
+            -4.44089210e-16,  -1.66533454e-16,   0.00000000e+00,
+            -2.77555756e-17,  -4.44089210e-16,  -2.22044605e-16,
+             1.66533454e-16,  -8.32667268e-17,  -4.44089210e-16,
+             1.66533454e-16,   1.94289029e-16,   2.77555756e-17,
+            -4.44089210e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -7.71583216e-01,   1.07372055e-01,   1.33436173e+00,
+             2.44096054e+00,  -7.71583216e-01,   1.07372055e-01,
+             1.33436173e+00,   2.44096054e+00,  -7.71583216e-01,
+             1.07372055e-01,   1.33436173e+00,   2.44096054e+00,
+            -7.71583216e-01,   1.07372055e-01,   1.33436173e+00,
+             2.44096054e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  2.61867978e-01,   2.00840493e-01,   1.15648337e-01,
+             3.88151405e-02,   1.24465821e+00,   9.54594639e-01,
+             5.49676417e-01,   1.84488320e-01,   2.52692501e+00,
+             1.93803331e+00,   1.11596185e+00,   3.74551138e-01,
+             3.50971524e+00,   2.69178745e+00,   1.54998993e+00,
+             5.20224317e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  3.28129845e+00,   1.58441540e+00,  -7.84371796e-01,
+            -2.92073623e+00,   2.29850822e+00,   8.30661252e-01,
+            -1.21839988e+00,  -3.06640940e+00,   1.01624142e+00,
+            -1.52777416e-01,  -1.78468531e+00,  -3.25647222e+00,
+             3.34511938e-02,  -9.06531562e-01,  -2.21871339e+00,
+            -3.40214540e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.61867978e-01,  -2.00840493e-01,  -1.15648337e-01,
+            -3.88151405e-02,  -1.24465821e+00,  -9.54594639e-01,
+            -5.49676417e-01,  -1.84488320e-01,  -2.52692501e+00,
+            -1.93803331e+00,  -1.11596185e+00,  -3.74551138e-01,
+            -3.50971524e+00,  -2.69178745e+00,  -1.54998993e+00,
+            -5.20224317e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   1.11022302e-16,
+             0.00000000e+00,   0.00000000e+00,   1.11022302e-16,
+             1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   1.11022302e-16,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]]), (1, 0): array([[[-2.50971524, -1.69178745, -0.54998993,  0.47977568, -1.52692501,
+           -0.93803331, -0.11596185,  0.62544886, -0.24465821,  0.04540536,
+            0.45032358,  0.81551168,  0.73813202,  0.79915951,  0.88435166,
+            0.96118486],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.73813202, -0.79915951, -0.88435166, -0.96118486,  0.24465821,
+           -0.04540536, -0.45032358, -0.81551168,  1.52692501,  0.93803331,
+            0.11596185, -0.62544886,  2.50971524,  1.69178745,  0.54998993,
+           -0.47977568],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.22841678,  1.10737205,  2.33436173,  3.44096054,  0.22841678,
+            1.10737205,  2.33436173,  3.44096054,  0.22841678,  1.10737205,
+            2.33436173,  3.44096054,  0.22841678,  1.10737205,  2.33436173,
+            3.44096054],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.22841678, -1.10737205, -2.33436173, -3.44096054, -0.22841678,
+           -1.10737205, -2.33436173, -3.44096054, -0.22841678, -1.10737205,
+           -2.33436173, -3.44096054, -0.22841678, -1.10737205, -2.33436173,
+           -3.44096054],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 3.24784726,  2.49094696,  1.4343416 ,  0.48140918,  1.2822668 ,
+            0.98343867,  0.56628544,  0.19006282, -1.2822668 , -0.98343867,
+           -0.56628544, -0.19006282, -3.24784726, -2.49094696, -1.4343416 ,
+           -0.48140918],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-2.50971524, -1.69178745, -0.54998993,  0.47977568, -1.52692501,
+           -0.93803331, -0.11596185,  0.62544886, -0.24465821,  0.04540536,
+            0.45032358,  0.81551168,  0.73813202,  0.79915951,  0.88435166,
+            0.96118486],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.73813202, -0.79915951, -0.88435166, -0.96118486,  0.24465821,
+           -0.04540536, -0.45032358, -0.81551168,  1.52692501,  0.93803331,
+            0.11596185, -0.62544886,  2.50971524,  1.69178745,  0.54998993,
+           -0.47977568],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.22841678,  1.10737205,  2.33436173,  3.44096054,  0.22841678,
+            1.10737205,  2.33436173,  3.44096054,  0.22841678,  1.10737205,
+            2.33436173,  3.44096054,  0.22841678,  1.10737205,  2.33436173,
+            3.44096054],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.22841678, -1.10737205, -2.33436173, -3.44096054, -0.22841678,
+           -1.10737205, -2.33436173, -3.44096054, -0.22841678, -1.10737205,
+           -2.33436173, -3.44096054, -0.22841678, -1.10737205, -2.33436173,
+           -3.44096054],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 3.24784726,  2.49094696,  1.4343416 ,  0.48140918,  1.2822668 ,
+            0.98343867,  0.56628544,  0.19006282, -1.2822668 , -0.98343867,
+           -0.56628544, -0.19006282, -3.24784726, -2.49094696, -1.4343416 ,
+           -0.48140918],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-1.        , -1.        , -1.        , -1.        , -1.        ,
+           -1.        , -1.        , -1.        , -1.        , -1.        ,
+           -1.        , -1.        , -1.        , -1.        , -1.        ,
+           -1.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 1.        ,  1.        ,  1.        ,  1.        ,  1.        ,
+            1.        ,  1.        ,  1.        ,  1.        ,  1.        ,
+            1.        ,  1.        ,  1.        ,  1.        ,  1.        ,
+            1.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]]]), (0, 0): array([[[ 0.66233382,  0.2327681 , -0.08718888, -0.09622691,  0.1664375 ,
+           -0.01501169, -0.12331911, -0.07610172, -0.1175178 , -0.12474229,
+           -0.09965108, -0.04186759, -0.05689514, -0.04516801, -0.02724027,
+           -0.00951546],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.05689514, -0.04516801, -0.02724027, -0.00951546, -0.1175178 ,
+           -0.12474229, -0.09965108, -0.04186759,  0.1664375 , -0.01501169,
+           -0.12331911, -0.07610172,  0.66233382,  0.2327681 , -0.08718888,
+           -0.09622691],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.05058242, -0.12355891,  0.09756515,  0.61978605, -0.05058242,
+           -0.12355891,  0.09756515,  0.61978605, -0.05058242, -0.12355891,
+            0.09756515,  0.61978605, -0.05058242, -0.12355891,  0.09756515,
+            0.61978605],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.01495376,  0.05560129,  0.06749126,  0.03339034,  0.07107521,
+            0.26427286,  0.3207859 ,  0.15870426,  0.14429802,  0.53653098,
+            0.65126466,  0.32220392,  0.20041947,  0.74520255,  0.9045593 ,
+            0.44751784],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.20041947,  0.74520255,  0.9045593 ,  0.44751784,  0.14429802,
+            0.53653098,  0.65126466,  0.32220392,  0.07107521,  0.26427286,
+            0.3207859 ,  0.15870426,  0.01495376,  0.05560129,  0.06749126,
+            0.03339034],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.22977051,  0.13515498,  0.04481344,  0.00504814,  0.78628949,
+            0.46250905,  0.15335448,  0.01727508,  0.78628949,  0.46250905,
+            0.15335448,  0.01727508,  0.22977051,  0.13515498,  0.04481344,
+            0.00504814],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.66233382,  0.2327681 , -0.08718888, -0.09622691,  0.1664375 ,
+           -0.01501169, -0.12331911, -0.07610172, -0.1175178 , -0.12474229,
+           -0.09965108, -0.04186759, -0.05689514, -0.04516801, -0.02724027,
+           -0.00951546],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.05689514, -0.04516801, -0.02724027, -0.00951546, -0.1175178 ,
+           -0.12474229, -0.09965108, -0.04186759,  0.1664375 , -0.01501169,
+           -0.12331911, -0.07610172,  0.66233382,  0.2327681 , -0.08718888,
+           -0.09622691],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.05058242, -0.12355891,  0.09756515,  0.61978605, -0.05058242,
+           -0.12355891,  0.09756515,  0.61978605, -0.05058242, -0.12355891,
+            0.09756515,  0.61978605, -0.05058242, -0.12355891,  0.09756515,
+            0.61978605],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.01495376,  0.05560129,  0.06749126,  0.03339034,  0.07107521,
+            0.26427286,  0.3207859 ,  0.15870426,  0.14429802,  0.53653098,
+            0.65126466,  0.32220392,  0.20041947,  0.74520255,  0.9045593 ,
+            0.44751784],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.20041947,  0.74520255,  0.9045593 ,  0.44751784,  0.14429802,
+            0.53653098,  0.65126466,  0.32220392,  0.07107521,  0.26427286,
+            0.3207859 ,  0.15870426,  0.01495376,  0.05560129,  0.06749126,
+            0.03339034],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.22977051,  0.13515498,  0.04481344,  0.00504814,  0.78628949,
+            0.46250905,  0.15335448,  0.01727508,  0.78628949,  0.46250905,
+            0.15335448,  0.01727508,  0.22977051,  0.13515498,  0.04481344,
+            0.00504814],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.87742881,  0.67294686,  0.38749748,  0.13005608,  0.63173125,
+            0.48450833,  0.27899046,  0.09363778,  0.31116455,  0.23864866,
+            0.1374191 ,  0.04612208,  0.06546699,  0.05021012,  0.02891208,
+            0.00970379]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.06546699,  0.05021012,  0.02891208,  0.00970379,  0.31116455,
+            0.23864866,  0.1374191 ,  0.04612208,  0.63173125,  0.48450833,
+            0.27899046,  0.09363778,  0.87742881,  0.67294686,  0.38749748,
+            0.13005608]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.0571042 ,  0.27684301,  0.58359043,  0.86024014,  0.0571042 ,
+            0.27684301,  0.58359043,  0.86024014,  0.0571042 ,  0.27684301,
+            0.58359043,  0.86024014,  0.0571042 ,  0.27684301,  0.58359043,
+            0.86024014]]])}}}, MixedElement(*[MixedElement(*[FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None)], **{'value_shape': (2,) }), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[ -2.50971524e+00,  -1.69178745e+00,  -5.49989934e-01,
+             4.79775683e-01,  -1.52692501e+00,  -9.38033307e-01,
+            -1.15961854e-01,   6.25448862e-01,  -2.44658209e-01,
+             4.54053611e-02,   4.50323583e-01,   8.15511680e-01,
+             7.38132022e-01,   7.99159507e-01,   8.84351663e-01,
+             9.61184859e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.66533454e-16,   1.11022302e-16,   2.77555756e-17,
+            -4.44089210e-16,  -1.66533454e-16,   0.00000000e+00,
+            -2.77555756e-17,  -4.44089210e-16,  -2.22044605e-16,
+             1.66533454e-16,  -8.32667268e-17,  -4.44089210e-16,
+             1.66533454e-16,   1.94289029e-16,   2.77555756e-17,
+            -4.44089210e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -7.71583216e-01,   1.07372055e-01,   1.33436173e+00,
+             2.44096054e+00,  -7.71583216e-01,   1.07372055e-01,
+             1.33436173e+00,   2.44096054e+00,  -7.71583216e-01,
+             1.07372055e-01,   1.33436173e+00,   2.44096054e+00,
+            -7.71583216e-01,   1.07372055e-01,   1.33436173e+00,
+             2.44096054e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  2.61867978e-01,   2.00840493e-01,   1.15648337e-01,
+             3.88151405e-02,   1.24465821e+00,   9.54594639e-01,
+             5.49676417e-01,   1.84488320e-01,   2.52692501e+00,
+             1.93803331e+00,   1.11596185e+00,   3.74551138e-01,
+             3.50971524e+00,   2.69178745e+00,   1.54998993e+00,
+             5.20224317e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  3.28129845e+00,   1.58441540e+00,  -7.84371796e-01,
+            -2.92073623e+00,   2.29850822e+00,   8.30661252e-01,
+            -1.21839988e+00,  -3.06640940e+00,   1.01624142e+00,
+            -1.52777416e-01,  -1.78468531e+00,  -3.25647222e+00,
+             3.34511938e-02,  -9.06531562e-01,  -2.21871339e+00,
+            -3.40214540e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -2.61867978e-01,  -2.00840493e-01,  -1.15648337e-01,
+            -3.88151405e-02,  -1.24465821e+00,  -9.54594639e-01,
+            -5.49676417e-01,  -1.84488320e-01,  -2.52692501e+00,
+            -1.93803331e+00,  -1.11596185e+00,  -3.74551138e-01,
+            -3.50971524e+00,  -2.69178745e+00,  -1.54998993e+00,
+            -5.20224317e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.50971524e+00,  -1.69178745e+00,  -5.49989934e-01,
+             4.79775683e-01,  -1.52692501e+00,  -9.38033307e-01,
+            -1.15961854e-01,   6.25448862e-01,  -2.44658209e-01,
+             4.54053611e-02,   4.50323583e-01,   8.15511680e-01,
+             7.38132022e-01,   7.99159507e-01,   8.84351663e-01,
+             9.61184859e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.66533454e-16,   1.11022302e-16,   2.77555756e-17,
+            -4.44089210e-16,  -1.66533454e-16,   0.00000000e+00,
+            -2.77555756e-17,  -4.44089210e-16,  -2.22044605e-16,
+             1.66533454e-16,  -8.32667268e-17,  -4.44089210e-16,
+             1.66533454e-16,   1.94289029e-16,   2.77555756e-17,
+            -4.44089210e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -7.71583216e-01,   1.07372055e-01,   1.33436173e+00,
+             2.44096054e+00,  -7.71583216e-01,   1.07372055e-01,
+             1.33436173e+00,   2.44096054e+00,  -7.71583216e-01,
+             1.07372055e-01,   1.33436173e+00,   2.44096054e+00,
+            -7.71583216e-01,   1.07372055e-01,   1.33436173e+00,
+             2.44096054e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  2.61867978e-01,   2.00840493e-01,   1.15648337e-01,
+             3.88151405e-02,   1.24465821e+00,   9.54594639e-01,
+             5.49676417e-01,   1.84488320e-01,   2.52692501e+00,
+             1.93803331e+00,   1.11596185e+00,   3.74551138e-01,
+             3.50971524e+00,   2.69178745e+00,   1.54998993e+00,
+             5.20224317e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  3.28129845e+00,   1.58441540e+00,  -7.84371796e-01,
+            -2.92073623e+00,   2.29850822e+00,   8.30661252e-01,
+            -1.21839988e+00,  -3.06640940e+00,   1.01624142e+00,
+            -1.52777416e-01,  -1.78468531e+00,  -3.25647222e+00,
+             3.34511938e-02,  -9.06531562e-01,  -2.21871339e+00,
+            -3.40214540e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.61867978e-01,  -2.00840493e-01,  -1.15648337e-01,
+            -3.88151405e-02,  -1.24465821e+00,  -9.54594639e-01,
+            -5.49676417e-01,  -1.84488320e-01,  -2.52692501e+00,
+            -1.93803331e+00,  -1.11596185e+00,  -3.74551138e-01,
+            -3.50971524e+00,  -2.69178745e+00,  -1.54998993e+00,
+            -5.20224317e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   1.11022302e-16,
+             0.00000000e+00,   0.00000000e+00,   1.11022302e-16,
+             1.11022302e-16,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+             0.00000000e+00,   1.11022302e-16,   1.11022302e-16,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]]), (1, 0): array([[[-2.50971524, -1.69178745, -0.54998993,  0.47977568, -1.52692501,
+           -0.93803331, -0.11596185,  0.62544886, -0.24465821,  0.04540536,
+            0.45032358,  0.81551168,  0.73813202,  0.79915951,  0.88435166,
+            0.96118486],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.73813202, -0.79915951, -0.88435166, -0.96118486,  0.24465821,
+           -0.04540536, -0.45032358, -0.81551168,  1.52692501,  0.93803331,
+            0.11596185, -0.62544886,  2.50971524,  1.69178745,  0.54998993,
+           -0.47977568],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.22841678,  1.10737205,  2.33436173,  3.44096054,  0.22841678,
+            1.10737205,  2.33436173,  3.44096054,  0.22841678,  1.10737205,
+            2.33436173,  3.44096054,  0.22841678,  1.10737205,  2.33436173,
+            3.44096054],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.22841678, -1.10737205, -2.33436173, -3.44096054, -0.22841678,
+           -1.10737205, -2.33436173, -3.44096054, -0.22841678, -1.10737205,
+           -2.33436173, -3.44096054, -0.22841678, -1.10737205, -2.33436173,
+           -3.44096054],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 3.24784726,  2.49094696,  1.4343416 ,  0.48140918,  1.2822668 ,
+            0.98343867,  0.56628544,  0.19006282, -1.2822668 , -0.98343867,
+           -0.56628544, -0.19006282, -3.24784726, -2.49094696, -1.4343416 ,
+           -0.48140918],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-2.50971524, -1.69178745, -0.54998993,  0.47977568, -1.52692501,
+           -0.93803331, -0.11596185,  0.62544886, -0.24465821,  0.04540536,
+            0.45032358,  0.81551168,  0.73813202,  0.79915951,  0.88435166,
+            0.96118486],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.73813202, -0.79915951, -0.88435166, -0.96118486,  0.24465821,
+           -0.04540536, -0.45032358, -0.81551168,  1.52692501,  0.93803331,
+            0.11596185, -0.62544886,  2.50971524,  1.69178745,  0.54998993,
+           -0.47977568],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.22841678,  1.10737205,  2.33436173,  3.44096054,  0.22841678,
+            1.10737205,  2.33436173,  3.44096054,  0.22841678,  1.10737205,
+            2.33436173,  3.44096054,  0.22841678,  1.10737205,  2.33436173,
+            3.44096054],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.22841678, -1.10737205, -2.33436173, -3.44096054, -0.22841678,
+           -1.10737205, -2.33436173, -3.44096054, -0.22841678, -1.10737205,
+           -2.33436173, -3.44096054, -0.22841678, -1.10737205, -2.33436173,
+           -3.44096054],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 3.24784726,  2.49094696,  1.4343416 ,  0.48140918,  1.2822668 ,
+            0.98343867,  0.56628544,  0.19006282, -1.2822668 , -0.98343867,
+           -0.56628544, -0.19006282, -3.24784726, -2.49094696, -1.4343416 ,
+           -0.48140918],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-1.        , -1.        , -1.        , -1.        , -1.        ,
+           -1.        , -1.        , -1.        , -1.        , -1.        ,
+           -1.        , -1.        , -1.        , -1.        , -1.        ,
+           -1.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 1.        ,  1.        ,  1.        ,  1.        ,  1.        ,
+            1.        ,  1.        ,  1.        ,  1.        ,  1.        ,
+            1.        ,  1.        ,  1.        ,  1.        ,  1.        ,
+            1.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]]]), (0, 0): array([[[ 0.66233382,  0.2327681 , -0.08718888, -0.09622691,  0.1664375 ,
+           -0.01501169, -0.12331911, -0.07610172, -0.1175178 , -0.12474229,
+           -0.09965108, -0.04186759, -0.05689514, -0.04516801, -0.02724027,
+           -0.00951546],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.05689514, -0.04516801, -0.02724027, -0.00951546, -0.1175178 ,
+           -0.12474229, -0.09965108, -0.04186759,  0.1664375 , -0.01501169,
+           -0.12331911, -0.07610172,  0.66233382,  0.2327681 , -0.08718888,
+           -0.09622691],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[-0.05058242, -0.12355891,  0.09756515,  0.61978605, -0.05058242,
+           -0.12355891,  0.09756515,  0.61978605, -0.05058242, -0.12355891,
+            0.09756515,  0.61978605, -0.05058242, -0.12355891,  0.09756515,
+            0.61978605],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.01495376,  0.05560129,  0.06749126,  0.03339034,  0.07107521,
+            0.26427286,  0.3207859 ,  0.15870426,  0.14429802,  0.53653098,
+            0.65126466,  0.32220392,  0.20041947,  0.74520255,  0.9045593 ,
+            0.44751784],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.20041947,  0.74520255,  0.9045593 ,  0.44751784,  0.14429802,
+            0.53653098,  0.65126466,  0.32220392,  0.07107521,  0.26427286,
+            0.3207859 ,  0.15870426,  0.01495376,  0.05560129,  0.06749126,
+            0.03339034],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.22977051,  0.13515498,  0.04481344,  0.00504814,  0.78628949,
+            0.46250905,  0.15335448,  0.01727508,  0.78628949,  0.46250905,
+            0.15335448,  0.01727508,  0.22977051,  0.13515498,  0.04481344,
+            0.00504814],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.66233382,  0.2327681 , -0.08718888, -0.09622691,  0.1664375 ,
+           -0.01501169, -0.12331911, -0.07610172, -0.1175178 , -0.12474229,
+           -0.09965108, -0.04186759, -0.05689514, -0.04516801, -0.02724027,
+           -0.00951546],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.05689514, -0.04516801, -0.02724027, -0.00951546, -0.1175178 ,
+           -0.12474229, -0.09965108, -0.04186759,  0.1664375 , -0.01501169,
+           -0.12331911, -0.07610172,  0.66233382,  0.2327681 , -0.08718888,
+           -0.09622691],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [-0.05058242, -0.12355891,  0.09756515,  0.61978605, -0.05058242,
+           -0.12355891,  0.09756515,  0.61978605, -0.05058242, -0.12355891,
+            0.09756515,  0.61978605, -0.05058242, -0.12355891,  0.09756515,
+            0.61978605],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.01495376,  0.05560129,  0.06749126,  0.03339034,  0.07107521,
+            0.26427286,  0.3207859 ,  0.15870426,  0.14429802,  0.53653098,
+            0.65126466,  0.32220392,  0.20041947,  0.74520255,  0.9045593 ,
+            0.44751784],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.20041947,  0.74520255,  0.9045593 ,  0.44751784,  0.14429802,
+            0.53653098,  0.65126466,  0.32220392,  0.07107521,  0.26427286,
+            0.3207859 ,  0.15870426,  0.01495376,  0.05560129,  0.06749126,
+            0.03339034],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.22977051,  0.13515498,  0.04481344,  0.00504814,  0.78628949,
+            0.46250905,  0.15335448,  0.01727508,  0.78628949,  0.46250905,
+            0.15335448,  0.01727508,  0.22977051,  0.13515498,  0.04481344,
+            0.00504814],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.87742881,  0.67294686,  0.38749748,  0.13005608,  0.63173125,
+            0.48450833,  0.27899046,  0.09363778,  0.31116455,  0.23864866,
+            0.1374191 ,  0.04612208,  0.06546699,  0.05021012,  0.02891208,
+            0.00970379]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.06546699,  0.05021012,  0.02891208,  0.00970379,  0.31116455,
+            0.23864866,  0.1374191 ,  0.04612208,  0.63173125,  0.48450833,
+            0.27899046,  0.09363778,  0.87742881,  0.67294686,  0.38749748,
+            0.13005608]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.0571042 ,  0.27684301,  0.58359043,  0.86024014,  0.0571042 ,
+            0.27684301,  0.58359043,  0.86024014,  0.0571042 ,  0.27684301,
+            0.58359043,  0.86024014,  0.0571042 ,  0.27684301,  0.58359043,
+            0.86024014]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[-2.5097152373218714, -0.73813202177994264, 0.0,
+          0.22841678445806923, -0.22841678445806923, 3.2478472591018139],
+         [-1.6917874526020258, -0.79915950715452166, 0.0, 1.1073720545524943,
+          -1.1073720545524943, 2.4909469597565472],
+         [-0.54998993362677651, -0.88435166310244473, 0.0, 2.334361729475666,
+          -2.334361729475666, 1.4343415967292208],
+         [0.47977568313266317, -0.9611848594922161, 0.0, 3.4409605426248748,
+          -3.4409605426248748, 0.48140917635955227],
+         [-1.5269250065645006, 0.24465820897742863, 0.0, 0.22841678445806934,
+          -0.22841678445806934, 1.2822667975870721],
+         [-0.93803330652173278, -0.045405361074228628, 0.0,
+          1.1073720545524943, -1.1073720545524943, 0.98343866759596121],
+         [-0.11596185398603487, -0.45032358346170315, 0.0, 2.334361729475666,
+          -2.334361729475666, 0.56628543744773763],
+         [0.62544886225068697, -0.8155116803741923, 0.0, 3.4409605426248748,
+          -3.4409605426248748, 0.19006281812350467],
+         [-0.24465820897742774, 1.5269250065645017, 0.0, 0.22841678445806934,
+          -0.22841678445806934, -1.2822667975870738],
+         [0.045405361074228601, 0.93803330652173311, 0.0, 1.1073720545524945,
+          -1.1073720545524945, -0.98343866759596188],
+         [0.45032358346170309, 0.11596185398603487, 0.0, 2.334361729475666,
+          -2.334361729475666, -0.5662854374477384],
+         [0.81551168037419286, -0.62544886225068641, 0.0, 3.4409605426248748,
+          -3.4409605426248748, -0.1900628181235072],
+         [0.7381320217799423, 2.5097152373218714, 0.0, 0.22841678445806923,
+          -0.22841678445806923, -3.2478472591018139],
+         [0.799159507154521, 1.6917874526020251, 0.0, 1.1073720545524943,
+          -1.1073720545524943, -2.4909469597565463],
+         [0.88435166310244473, 0.54998993362677651, 0.0, 2.334361729475666,
+          -2.334361729475666, -1.4343415967292217],
+         [0.96118485949221688, -0.47977568313266239, 0.0, 3.4409605426248748,
+          -3.4409605426248748, -0.48140917635955516]], dtype=object), 'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.50971524e+00,  -1.66533454e-16,  -7.71583216e-01,
+            2.61867978e-01,   3.28129845e+00,  -2.61867978e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.69178745e+00,   1.11022302e-16,   1.07372055e-01,
+            2.00840493e-01,   1.58441540e+00,  -2.00840493e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -5.49989934e-01,   2.77555756e-17,   1.33436173e+00,
+            1.15648337e-01,  -7.84371796e-01,  -1.15648337e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.79775683e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.88151405e-02,  -2.92073623e+00,  -3.88151405e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.52692501e+00,  -1.66533454e-16,  -7.71583216e-01,
+            1.24465821e+00,   2.29850822e+00,  -1.24465821e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.38033307e-01,   0.00000000e+00,   1.07372055e-01,
+            9.54594639e-01,   8.30661252e-01,  -9.54594639e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.15961854e-01,  -2.77555756e-17,   1.33436173e+00,
+            5.49676417e-01,  -1.21839988e+00,  -5.49676417e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.25448862e-01,  -4.44089210e-16,   2.44096054e+00,
+            1.84488320e-01,  -3.06640940e+00,  -1.84488320e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.44658209e-01,  -2.22044605e-16,  -7.71583216e-01,
+            2.52692501e+00,   1.01624142e+00,  -2.52692501e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.54053611e-02,   1.66533454e-16,   1.07372055e-01,
+            1.93803331e+00,  -1.52777416e-01,  -1.93803331e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.50323583e-01,  -8.32667268e-17,   1.33436173e+00,
+            1.11596185e+00,  -1.78468531e+00,  -1.11596185e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.15511680e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.74551138e-01,  -3.25647222e+00,  -3.74551138e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.38132022e-01,   1.66533454e-16,  -7.71583216e-01,
+            3.50971524e+00,   3.34511938e-02,  -3.50971524e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.99159507e-01,   1.94289029e-16,   1.07372055e-01,
+            2.69178745e+00,  -9.06531562e-01,  -2.69178745e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.84351663e-01,   2.77555756e-17,   1.33436173e+00,
+            1.54998993e+00,  -2.21871339e+00,  -1.54998993e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.61184859e-01,  -4.44089210e-16,   2.44096054e+00,
+            5.20224317e-01,  -3.40214540e+00,  -5.20224317e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_C1_D10': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -2.50971524, -0.73813202,  0.        ,  0.22841678,
+          -0.22841678,  3.24784726,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -1.69178745, -0.79915951,  0.        ,  1.10737205,
+          -1.10737205,  2.49094696,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.54998993, -0.88435166,  0.        ,  2.33436173,
+          -2.33436173,  1.4343416 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.47977568, -0.96118486,  0.        ,  3.44096054,
+          -3.44096054,  0.48140918,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -1.52692501,  0.24465821,  0.        ,  0.22841678,
+          -0.22841678,  1.2822668 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.93803331, -0.04540536,  0.        ,  1.10737205,
+          -1.10737205,  0.98343867,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11596185, -0.45032358,  0.        ,  2.33436173,
+          -2.33436173,  0.56628544,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.62544886, -0.81551168,  0.        ,  3.44096054,
+          -3.44096054,  0.19006282,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.24465821,  1.52692501,  0.        ,  0.22841678,
+          -0.22841678, -1.2822668 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.04540536,  0.93803331,  0.        ,  1.10737205,
+          -1.10737205, -0.98343867,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.45032358,  0.11596185,  0.        ,  2.33436173,
+          -2.33436173, -0.56628544,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.81551168, -0.62544886,  0.        ,  3.44096054,
+          -3.44096054, -0.19006282,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.73813202,  2.50971524,  0.        ,  0.22841678,
+          -0.22841678, -3.24784726,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.79915951,  1.69178745,  0.        ,  1.10737205,
+          -1.10737205, -2.49094696,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.88435166,  0.54998993,  0.        ,  2.33436173,
+          -2.33436173, -1.4343416 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.96118486, -0.47977568,  0.        ,  3.44096054,
+          -3.44096054, -0.48140918,  0.        ,  0.        ,  0.        ]]), 'FE2_C1_D10': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -2.50971524, -0.73813202,  0.        ,  0.22841678,
+          -0.22841678,  3.24784726,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -1.69178745, -0.79915951,  0.        ,  1.10737205,
+          -1.10737205,  2.49094696,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.54998993, -0.88435166,  0.        ,  2.33436173,
+          -2.33436173,  1.4343416 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.47977568, -0.96118486,  0.        ,  3.44096054,
+          -3.44096054,  0.48140918,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -1.52692501,  0.24465821,  0.        ,  0.22841678,
+          -0.22841678,  1.2822668 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.93803331, -0.04540536,  0.        ,  1.10737205,
+          -1.10737205,  0.98343867,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11596185, -0.45032358,  0.        ,  2.33436173,
+          -2.33436173,  0.56628544,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.62544886, -0.81551168,  0.        ,  3.44096054,
+          -3.44096054,  0.19006282,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.24465821,  1.52692501,  0.        ,  0.22841678,
+          -0.22841678, -1.2822668 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.04540536,  0.93803331,  0.        ,  1.10737205,
+          -1.10737205, -0.98343867,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.45032358,  0.11596185,  0.        ,  2.33436173,
+          -2.33436173, -0.56628544,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.81551168, -0.62544886,  0.        ,  3.44096054,
+          -3.44096054, -0.19006282,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.73813202,  2.50971524,  0.        ,  0.22841678,
+          -0.22841678, -3.24784726,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.79915951,  1.69178745,  0.        ,  1.10737205,
+          -1.10737205, -2.49094696,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.88435166,  0.54998993,  0.        ,  2.33436173,
+          -2.33436173, -1.4343416 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.96118486, -0.47977568,  0.        ,  3.44096054,
+          -3.44096054, -0.48140918,  0.        ,  0.        ,  0.        ]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE3_C0_D10': array([[-2.50971524, -0.73813202,  0.        ,  0.22841678, -0.22841678,
+           3.24784726,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-1.69178745, -0.79915951,  0.        ,  1.10737205, -1.10737205,
+           2.49094696,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.54998993, -0.88435166,  0.        ,  2.33436173, -2.33436173,
+           1.4343416 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.47977568, -0.96118486,  0.        ,  3.44096054, -3.44096054,
+           0.48140918,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-1.52692501,  0.24465821,  0.        ,  0.22841678, -0.22841678,
+           1.2822668 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.93803331, -0.04540536,  0.        ,  1.10737205, -1.10737205,
+           0.98343867,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11596185, -0.45032358,  0.        ,  2.33436173, -2.33436173,
+           0.56628544,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.62544886, -0.81551168,  0.        ,  3.44096054, -3.44096054,
+           0.19006282,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.24465821,  1.52692501,  0.        ,  0.22841678, -0.22841678,
+          -1.2822668 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.04540536,  0.93803331,  0.        ,  1.10737205, -1.10737205,
+          -0.98343867,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.45032358,  0.11596185,  0.        ,  2.33436173, -2.33436173,
+          -0.56628544,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.81551168, -0.62544886,  0.        ,  3.44096054, -3.44096054,
+          -0.19006282,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.73813202,  2.50971524,  0.        ,  0.22841678, -0.22841678,
+          -3.24784726,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.79915951,  1.69178745,  0.        ,  1.10737205, -1.10737205,
+          -2.49094696,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.88435166,  0.54998993,  0.        ,  2.33436173, -2.33436173,
+          -1.4343416 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.96118486, -0.47977568,  0.        ,  3.44096054, -3.44096054,
+          -0.48140918,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE2_C0_D01': array([[ -2.50971524e+00,  -1.66533454e-16,  -7.71583216e-01,
+            2.61867978e-01,   3.28129845e+00,  -2.61867978e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.69178745e+00,   1.11022302e-16,   1.07372055e-01,
+            2.00840493e-01,   1.58441540e+00,  -2.00840493e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -5.49989934e-01,   2.77555756e-17,   1.33436173e+00,
+            1.15648337e-01,  -7.84371796e-01,  -1.15648337e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.79775683e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.88151405e-02,  -2.92073623e+00,  -3.88151405e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.52692501e+00,  -1.66533454e-16,  -7.71583216e-01,
+            1.24465821e+00,   2.29850822e+00,  -1.24465821e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.38033307e-01,   0.00000000e+00,   1.07372055e-01,
+            9.54594639e-01,   8.30661252e-01,  -9.54594639e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.15961854e-01,  -2.77555756e-17,   1.33436173e+00,
+            5.49676417e-01,  -1.21839988e+00,  -5.49676417e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.25448862e-01,  -4.44089210e-16,   2.44096054e+00,
+            1.84488320e-01,  -3.06640940e+00,  -1.84488320e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.44658209e-01,  -2.22044605e-16,  -7.71583216e-01,
+            2.52692501e+00,   1.01624142e+00,  -2.52692501e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.54053611e-02,   1.66533454e-16,   1.07372055e-01,
+            1.93803331e+00,  -1.52777416e-01,  -1.93803331e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.50323583e-01,  -8.32667268e-17,   1.33436173e+00,
+            1.11596185e+00,  -1.78468531e+00,  -1.11596185e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.15511680e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.74551138e-01,  -3.25647222e+00,  -3.74551138e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.38132022e-01,   1.66533454e-16,  -7.71583216e-01,
+            3.50971524e+00,   3.34511938e-02,  -3.50971524e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.99159507e-01,   1.94289029e-16,   1.07372055e-01,
+            2.69178745e+00,  -9.06531562e-01,  -2.69178745e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.84351663e-01,   2.77555756e-17,   1.33436173e+00,
+            1.54998993e+00,  -2.21871339e+00,  -1.54998993e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.61184859e-01,  -4.44089210e-16,   2.44096054e+00,
+            5.20224317e-01,  -3.40214540e+00,  -5.20224317e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.66233382, -0.05689514, -0.05058242,  0.01495376,
+           0.20041947,  0.22977051,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.2327681 , -0.04516801, -0.12355891,  0.05560129,
+           0.74520255,  0.13515498,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08718888, -0.02724027,  0.09756515,  0.06749126,
+           0.9045593 ,  0.04481344,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09622691, -0.00951546,  0.61978605,  0.03339034,
+           0.44751784,  0.00504814,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.1664375 , -0.1175178 , -0.05058242,  0.07107521,
+           0.14429802,  0.78628949,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01501169, -0.12474229, -0.12355891,  0.26427286,
+           0.53653098,  0.46250905,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12331911, -0.09965108,  0.09756515,  0.3207859 ,
+           0.65126466,  0.15335448,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07610172, -0.04186759,  0.61978605,  0.15870426,
+           0.32220392,  0.01727508,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.1175178 ,  0.1664375 , -0.05058242,  0.14429802,
+           0.07107521,  0.78628949,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12474229, -0.01501169, -0.12355891,  0.53653098,
+           0.26427286,  0.46250905,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09965108, -0.12331911,  0.09756515,  0.65126466,
+           0.3207859 ,  0.15335448,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04186759, -0.07610172,  0.61978605,  0.32220392,
+           0.15870426,  0.01727508,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05689514,  0.66233382, -0.05058242,  0.20041947,
+           0.01495376,  0.22977051,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04516801,  0.2327681 , -0.12355891,  0.74520255,
+           0.05560129,  0.13515498,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02724027, -0.08718888,  0.09756515,  0.9045593 ,
+           0.06749126,  0.04481344,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.00951546, -0.09622691,  0.61978605,  0.44751784,
+           0.03339034,  0.00504814,  0.        ,  0.        ,  0.        ]]), 'FE2_C0': array([[ 0.66233382, -0.05689514, -0.05058242,  0.01495376,  0.20041947,
+           0.22977051,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.2327681 , -0.04516801, -0.12355891,  0.05560129,  0.74520255,
+           0.13515498,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.08718888, -0.02724027,  0.09756515,  0.06749126,  0.9045593 ,
+           0.04481344,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09622691, -0.00951546,  0.61978605,  0.03339034,  0.44751784,
+           0.00504814,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.1664375 , -0.1175178 , -0.05058242,  0.07107521,  0.14429802,
+           0.78628949,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01501169, -0.12474229, -0.12355891,  0.26427286,  0.53653098,
+           0.46250905,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12331911, -0.09965108,  0.09756515,  0.3207859 ,  0.65126466,
+           0.15335448,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07610172, -0.04186759,  0.61978605,  0.15870426,  0.32220392,
+           0.01727508,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.1175178 ,  0.1664375 , -0.05058242,  0.14429802,  0.07107521,
+           0.78628949,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12474229, -0.01501169, -0.12355891,  0.53653098,  0.26427286,
+           0.46250905,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09965108, -0.12331911,  0.09756515,  0.65126466,  0.3207859 ,
+           0.15335448,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04186759, -0.07610172,  0.61978605,  0.32220392,  0.15870426,
+           0.01727508,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.05689514,  0.66233382, -0.05058242,  0.20041947,  0.01495376,
+           0.22977051,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04516801,  0.2327681 , -0.12355891,  0.74520255,  0.05560129,
+           0.13515498,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02724027, -0.08718888,  0.09756515,  0.9045593 ,  0.06749126,
+           0.04481344,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.00951546, -0.09622691,  0.61978605,  0.44751784,  0.03339034,
+           0.00504814,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE4': array([[1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [0.99999999999999989],
+         [1.0]], dtype=object), 'FE2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.87742881,  0.06546699,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.67294686,  0.05021012,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.38749748,  0.02891208,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.13005608,  0.00970379,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.63173125,  0.31116455,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.48450833,  0.23864866,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.27899046,  0.1374191 ,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.09363778,  0.04612208,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.31116455,  0.63173125,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.23864866,  0.48450833,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.1374191 ,  0.27899046,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04612208,  0.09363778,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06546699,  0.87742881,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05021012,  0.67294686,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02891208,  0.38749748,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.00970379,  0.13005608,  0.86024014]]), 'FE0': array([[0.6623338215556972, -0.056895139802881842, -0.05058241768674708,
+          0.014953760384390308, 0.20041946721813891, 0.22977050833140236],
+         [0.23276809809770654, -0.04516801026556784, -0.12355890523764695,
+          0.055601287299908417, 0.74520255045163297, 0.13515497965396686],
+         [-0.08718888411365161, -0.027240266995992645, 0.09756515313616182,
+          0.067491262932790785, 0.90455929553271897, 0.044813439507972466],
+         [-0.096226911734323323, -0.0095154582353662032, 0.61978604633144241,
+          0.033390341735931695, 0.44751783691362235, 0.0050481449886929514],
+         [0.16643749695900031, -0.11751779509749462, -0.05058241768674708,
+          0.07107520646099133, 0.14429802114153806, 0.78628948822271205],
+         [-0.015011689481987923, -0.12474229414821482, -0.12355890523764693,
+          0.26427285664300715, 0.53653098110853414, 0.46250905111630813],
+         [-0.12331910605251509, -0.099651083772276355, 0.09756515313616182,
+          0.32078589759058163, 0.65126466087492807, 0.15335447822311959],
+         [-0.076101715088665228, -0.041867587396657691, 0.61978604633144241,
+          0.15870425710189318, 0.32220392154766098, 0.017275077504326344],
+         [-0.11751779509749458, 0.16643749695900029, -0.05058241768674708,
+          0.14429802114153809, 0.071075206460991261, 0.78628948822271205],
+         [-0.12474229414821481, -0.015011689481988087, -0.12355890523764695,
+          0.53653098110853426, 0.26427285664300726, 0.46250905111630836],
+         [-0.0996510837722763, -0.12331910605251518, 0.09756515313616182,
+          0.65126466087492807, 0.32078589759058174, 0.15335447822311959],
+         [-0.041867587396657691, -0.076101715088665284, 0.61978604633144241,
+          0.32220392154766114, 0.15870425710189295, 0.017275077504326344],
+         [-0.056895139802881876, 0.6623338215556972, -0.05058241768674708,
+          0.20041946721813905, 0.014953760384390294, 0.22977050833140236],
+         [-0.045168010265567847, 0.23276809809770624, -0.12355890523764693,
+          0.74520255045163286, 0.0556012872999085, 0.13515497965396692],
+         [-0.027240266995992635, -0.087188884113651763, 0.09756515313616182,
+          0.90455929553271897, 0.067491262932790869, 0.044813439507972466],
+         [-0.0095154582353661338, -0.096226911734323434, 0.61978604633144241,
+          0.44751783691362274, 0.033390341735931361, 0.0050481449886928959]], dtype=object), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_D01': array([[-2.5097152373218705, -1.6653345369377348e-16, -0.77158321554192932,
+          0.2618679782200577, 3.2812984528638003, -0.26186797822005725],
+         [-1.6917874526020253, 1.1102230246251565e-16, 0.10737205455249504,
+          0.20084049284547795, 1.5844153980495301, -0.20084049284547775],
+         [-0.54998993362677662, 2.7755575615628914e-17, 1.3343617294756669,
+          0.11564833689755472, -0.78437179584889039, -0.1156483368975546],
+         [0.4797756831326625, -4.4408920985006262e-16, 2.4409605426248775,
+          0.03881514050778323, -2.9207362257575396, -0.038815140507784007],
+         [-1.5269250065645008, -1.6653345369377348e-16, -0.77158321554192888,
+          1.2446582089774276, 2.2985082221064306, -1.2446582089774285],
+         [-0.93803330652173278, 0.0, 0.10737205455249532,
+          0.95459463892577068, 0.83066125196923757, -0.95459463892577068],
+         [-0.11596185398603498, -2.7755575615628914e-17, 1.3343617294756669,
+          0.54967641653829635, -1.2183998754896317, -0.54967641653829646],
+         [0.6254488622506863, -4.4408920985006262e-16, 2.4409605426248775,
+          0.18448831962580736, -3.0664094048755635, -0.18448831962580781],
+         [-0.2446582089774276, -2.2204460492503131e-16, -0.77158321554192888,
+          2.5269250065645004, 1.0162414245193578, -2.5269250065645021],
+         [0.04540536107422885, 1.6653345369377348e-16, 0.10737205455249538,
+          1.9380333065217321, -0.15277741562672359, -1.9380333065217328],
+         [0.45032358346170304, -8.3266726846886741e-17, 1.3343617294756669,
+          1.1159618539860343, -1.7846853129373699, -1.1159618539860348],
+         [0.81551168037419208, -4.4408920985006262e-16, 2.4409605426248775,
+          0.37455113774931248, -3.2564722229990686, -0.37455113774931359],
+         [0.7381320217799433, 1.6653345369377348e-16, -0.7715832155419291,
+          3.5097152373218696, 0.033451193761987463, -3.5097152373218719],
+         [0.79915950715452166, 1.9428902930940239e-16, 0.1073720545524951,
+          2.6917874526020245, -0.90653156170701621, -2.6917874526020249],
+         [0.8843516631024444, 2.7755575615628914e-17, 1.3343617294756669,
+          1.5499899336267755, -2.2187133925781106, -1.5499899336267764],
+         [0.9611848594922161, -4.4408920985006262e-16, 2.4409605426248775,
+          0.52022431686733683, -3.4021454021170929, -0.52022431686733772]], dtype=object), 'FE3_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.50971524e+00,  -1.66533454e-16,  -7.71583216e-01,
+            2.61867978e-01,   3.28129845e+00,  -2.61867978e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.69178745e+00,   1.11022302e-16,   1.07372055e-01,
+            2.00840493e-01,   1.58441540e+00,  -2.00840493e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -5.49989934e-01,   2.77555756e-17,   1.33436173e+00,
+            1.15648337e-01,  -7.84371796e-01,  -1.15648337e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.79775683e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.88151405e-02,  -2.92073623e+00,  -3.88151405e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.52692501e+00,  -1.66533454e-16,  -7.71583216e-01,
+            1.24465821e+00,   2.29850822e+00,  -1.24465821e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.38033307e-01,   0.00000000e+00,   1.07372055e-01,
+            9.54594639e-01,   8.30661252e-01,  -9.54594639e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.15961854e-01,  -2.77555756e-17,   1.33436173e+00,
+            5.49676417e-01,  -1.21839988e+00,  -5.49676417e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.25448862e-01,  -4.44089210e-16,   2.44096054e+00,
+            1.84488320e-01,  -3.06640940e+00,  -1.84488320e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.44658209e-01,  -2.22044605e-16,  -7.71583216e-01,
+            2.52692501e+00,   1.01624142e+00,  -2.52692501e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.54053611e-02,   1.66533454e-16,   1.07372055e-01,
+            1.93803331e+00,  -1.52777416e-01,  -1.93803331e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.50323583e-01,  -8.32667268e-17,   1.33436173e+00,
+            1.11596185e+00,  -1.78468531e+00,  -1.11596185e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.15511680e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.74551138e-01,  -3.25647222e+00,  -3.74551138e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.38132022e-01,   1.66533454e-16,  -7.71583216e-01,
+            3.50971524e+00,   3.34511938e-02,  -3.50971524e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.99159507e-01,   1.94289029e-16,   1.07372055e-01,
+            2.69178745e+00,  -9.06531562e-01,  -2.69178745e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.84351663e-01,   2.77555756e-17,   1.33436173e+00,
+            1.54998993e+00,  -2.21871339e+00,  -1.54998993e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.61184859e-01,  -4.44089210e-16,   2.44096054e+00,
+            5.20224317e-01,  -3.40214540e+00,  -5.20224317e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE2_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE3_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE3_C0_D01': array([[ -2.50971524e+00,  -1.66533454e-16,  -7.71583216e-01,
+            2.61867978e-01,   3.28129845e+00,  -2.61867978e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.69178745e+00,   1.11022302e-16,   1.07372055e-01,
+            2.00840493e-01,   1.58441540e+00,  -2.00840493e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -5.49989934e-01,   2.77555756e-17,   1.33436173e+00,
+            1.15648337e-01,  -7.84371796e-01,  -1.15648337e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.79775683e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.88151405e-02,  -2.92073623e+00,  -3.88151405e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.52692501e+00,  -1.66533454e-16,  -7.71583216e-01,
+            1.24465821e+00,   2.29850822e+00,  -1.24465821e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.38033307e-01,   0.00000000e+00,   1.07372055e-01,
+            9.54594639e-01,   8.30661252e-01,  -9.54594639e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.15961854e-01,  -2.77555756e-17,   1.33436173e+00,
+            5.49676417e-01,  -1.21839988e+00,  -5.49676417e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.25448862e-01,  -4.44089210e-16,   2.44096054e+00,
+            1.84488320e-01,  -3.06640940e+00,  -1.84488320e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.44658209e-01,  -2.22044605e-16,  -7.71583216e-01,
+            2.52692501e+00,   1.01624142e+00,  -2.52692501e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.54053611e-02,   1.66533454e-16,   1.07372055e-01,
+            1.93803331e+00,  -1.52777416e-01,  -1.93803331e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.50323583e-01,  -8.32667268e-17,   1.33436173e+00,
+            1.11596185e+00,  -1.78468531e+00,  -1.11596185e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.15511680e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.74551138e-01,  -3.25647222e+00,  -3.74551138e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.38132022e-01,   1.66533454e-16,  -7.71583216e-01,
+            3.50971524e+00,   3.34511938e-02,  -3.50971524e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.99159507e-01,   1.94289029e-16,   1.07372055e-01,
+            2.69178745e+00,  -9.06531562e-01,  -2.69178745e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.84351663e-01,   2.77555756e-17,   1.33436173e+00,
+            1.54998993e+00,  -2.21871339e+00,  -1.54998993e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.61184859e-01,  -4.44089210e-16,   2.44096054e+00,
+            5.20224317e-01,  -3.40214540e+00,  -5.20224317e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C0_D10': array([[-2.50971524, -0.73813202,  0.        ,  0.22841678, -0.22841678,
+           3.24784726,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-1.69178745, -0.79915951,  0.        ,  1.10737205, -1.10737205,
+           2.49094696,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.54998993, -0.88435166,  0.        ,  2.33436173, -2.33436173,
+           1.4343416 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.47977568, -0.96118486,  0.        ,  3.44096054, -3.44096054,
+           0.48140918,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-1.52692501,  0.24465821,  0.        ,  0.22841678, -0.22841678,
+           1.2822668 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.93803331, -0.04540536,  0.        ,  1.10737205, -1.10737205,
+           0.98343867,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11596185, -0.45032358,  0.        ,  2.33436173, -2.33436173,
+           0.56628544,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.62544886, -0.81551168,  0.        ,  3.44096054, -3.44096054,
+           0.19006282,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.24465821,  1.52692501,  0.        ,  0.22841678, -0.22841678,
+          -1.2822668 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.04540536,  0.93803331,  0.        ,  1.10737205, -1.10737205,
+          -0.98343867,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.45032358,  0.11596185,  0.        ,  2.33436173, -2.33436173,
+          -0.56628544,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.81551168, -0.62544886,  0.        ,  3.44096054, -3.44096054,
+          -0.19006282,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.73813202,  2.50971524,  0.        ,  0.22841678, -0.22841678,
+          -3.24784726,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.79915951,  1.69178745,  0.        ,  1.10737205, -1.10737205,
+          -2.49094696,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.88435166,  0.54998993,  0.        ,  2.33436173, -2.33436173,
+          -1.4343416 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.96118486, -0.47977568,  0.        ,  3.44096054, -3.44096054,
+          -0.48140918,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE2_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE3_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE1_C0': array([[ 0.87742881,  0.06546699,  0.0571042 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.67294686,  0.05021012,  0.27684301,  0.        ,  0.        ,
+           0.        ],
+         [ 0.38749748,  0.02891208,  0.58359043,  0.        ,  0.        ,
+           0.        ],
+         [ 0.13005608,  0.00970379,  0.86024014,  0.        ,  0.        ,
+           0.        ],
+         [ 0.63173125,  0.31116455,  0.0571042 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.48450833,  0.23864866,  0.27684301,  0.        ,  0.        ,
+           0.        ],
+         [ 0.27899046,  0.1374191 ,  0.58359043,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09363778,  0.04612208,  0.86024014,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31116455,  0.63173125,  0.0571042 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.23864866,  0.48450833,  0.27684301,  0.        ,  0.        ,
+           0.        ],
+         [ 0.1374191 ,  0.27899046,  0.58359043,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04612208,  0.09363778,  0.86024014,  0.        ,  0.        ,
+           0.        ],
+         [ 0.06546699,  0.87742881,  0.0571042 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05021012,  0.67294686,  0.27684301,  0.        ,  0.        ,
+           0.        ],
+         [ 0.02891208,  0.38749748,  0.58359043,  0.        ,  0.        ,
+           0.        ],
+         [ 0.00970379,  0.13005608,  0.86024014,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.87742881,  0.06546699,
+           0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.67294686,  0.05021012,
+           0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.38749748,  0.02891208,
+           0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.13005608,  0.00970379,
+           0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.63173125,  0.31116455,
+           0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.48450833,  0.23864866,
+           0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.27899046,  0.1374191 ,
+           0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.09363778,  0.04612208,
+           0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.31116455,  0.63173125,
+           0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.23864866,  0.48450833,
+           0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.1374191 ,  0.27899046,
+           0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.04612208,  0.09363778,
+           0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.06546699,  0.87742881,
+           0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.05021012,  0.67294686,
+           0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.02891208,  0.38749748,
+           0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.00970379,  0.13005608,
+           0.86024014]]), 'FE3_C0': array([[ 0.66233382, -0.05689514, -0.05058242,  0.01495376,  0.20041947,
+           0.22977051,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.2327681 , -0.04516801, -0.12355891,  0.05560129,  0.74520255,
+           0.13515498,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.08718888, -0.02724027,  0.09756515,  0.06749126,  0.9045593 ,
+           0.04481344,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09622691, -0.00951546,  0.61978605,  0.03339034,  0.44751784,
+           0.00504814,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.1664375 , -0.1175178 , -0.05058242,  0.07107521,  0.14429802,
+           0.78628949,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01501169, -0.12474229, -0.12355891,  0.26427286,  0.53653098,
+           0.46250905,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12331911, -0.09965108,  0.09756515,  0.3207859 ,  0.65126466,
+           0.15335448,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07610172, -0.04186759,  0.61978605,  0.15870426,  0.32220392,
+           0.01727508,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.1175178 ,  0.1664375 , -0.05058242,  0.14429802,  0.07107521,
+           0.78628949,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12474229, -0.01501169, -0.12355891,  0.53653098,  0.26427286,
+           0.46250905,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09965108, -0.12331911,  0.09756515,  0.65126466,  0.3207859 ,
+           0.15335448,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04186759, -0.07610172,  0.61978605,  0.32220392,  0.15870426,
+           0.01727508,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.05689514,  0.66233382, -0.05058242,  0.20041947,  0.01495376,
+           0.22977051,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04516801,  0.2327681 , -0.12355891,  0.74520255,  0.05560129,
+           0.13515498,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02724027, -0.08718888,  0.09756515,  0.9045593 ,  0.06749126,
+           0.04481344,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.00951546, -0.09622691,  0.61978605,  0.44751784,  0.03339034,
+           0.00504814,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE3_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.66233382, -0.05689514, -0.05058242,  0.01495376,
+           0.20041947,  0.22977051,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.2327681 , -0.04516801, -0.12355891,  0.05560129,
+           0.74520255,  0.13515498,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08718888, -0.02724027,  0.09756515,  0.06749126,
+           0.9045593 ,  0.04481344,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09622691, -0.00951546,  0.61978605,  0.03339034,
+           0.44751784,  0.00504814,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.1664375 , -0.1175178 , -0.05058242,  0.07107521,
+           0.14429802,  0.78628949,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01501169, -0.12474229, -0.12355891,  0.26427286,
+           0.53653098,  0.46250905,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12331911, -0.09965108,  0.09756515,  0.3207859 ,
+           0.65126466,  0.15335448,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07610172, -0.04186759,  0.61978605,  0.15870426,
+           0.32220392,  0.01727508,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.1175178 ,  0.1664375 , -0.05058242,  0.14429802,
+           0.07107521,  0.78628949,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12474229, -0.01501169, -0.12355891,  0.53653098,
+           0.26427286,  0.46250905,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09965108, -0.12331911,  0.09756515,  0.65126466,
+           0.3207859 ,  0.15335448,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04186759, -0.07610172,  0.61978605,  0.32220392,
+           0.15870426,  0.01727508,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05689514,  0.66233382, -0.05058242,  0.20041947,
+           0.01495376,  0.22977051,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04516801,  0.2327681 , -0.12355891,  0.74520255,
+           0.05560129,  0.13515498,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02724027, -0.08718888,  0.09756515,  0.9045593 ,
+           0.06749126,  0.04481344,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.00951546, -0.09622691,  0.61978605,  0.44751784,
+           0.03339034,  0.00504814,  0.        ,  0.        ,  0.        ]]), 'FE3_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.87742881,  0.06546699,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.67294686,  0.05021012,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.38749748,  0.02891208,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.13005608,  0.00970379,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.63173125,  0.31116455,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.48450833,  0.23864866,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.27899046,  0.1374191 ,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.09363778,  0.04612208,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.31116455,  0.63173125,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.23864866,  0.48450833,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.1374191 ,  0.27899046,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04612208,  0.09363778,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06546699,  0.87742881,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05021012,  0.67294686,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02891208,  0.38749748,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.00970379,  0.13005608,  0.86024014]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE0_D10': array([[-2.5097152373218714, -0.73813202177994264, 0.0,
+          0.22841678445806923, -0.22841678445806923, 3.2478472591018139],
+         [-1.6917874526020258, -0.79915950715452166, 0.0, 1.1073720545524943,
+          -1.1073720545524943, 2.4909469597565472],
+         [-0.54998993362677651, -0.88435166310244473, 0.0, 2.334361729475666,
+          -2.334361729475666, 1.4343415967292208],
+         [0.47977568313266317, -0.9611848594922161, 0.0, 3.4409605426248748,
+          -3.4409605426248748, 0.48140917635955227],
+         [-1.5269250065645006, 0.24465820897742863, 0.0, 0.22841678445806934,
+          -0.22841678445806934, 1.2822667975870721],
+         [-0.93803330652173278, -0.045405361074228628, 0.0,
+          1.1073720545524943, -1.1073720545524943, 0.98343866759596121],
+         [-0.11596185398603487, -0.45032358346170315, 0.0, 2.334361729475666,
+          -2.334361729475666, 0.56628543744773763],
+         [0.62544886225068697, -0.8155116803741923, 0.0, 3.4409605426248748,
+          -3.4409605426248748, 0.19006281812350467],
+         [-0.24465820897742774, 1.5269250065645017, 0.0, 0.22841678445806934,
+          -0.22841678445806934, -1.2822667975870738],
+         [0.045405361074228601, 0.93803330652173311, 0.0, 1.1073720545524945,
+          -1.1073720545524945, -0.98343866759596188],
+         [0.45032358346170309, 0.11596185398603487, 0.0, 2.334361729475666,
+          -2.334361729475666, -0.5662854374477384],
+         [0.81551168037419286, -0.62544886225068641, 0.0, 3.4409605426248748,
+          -3.4409605426248748, -0.1900628181235072],
+         [0.7381320217799423, 2.5097152373218714, 0.0, 0.22841678445806923,
+          -0.22841678445806923, -3.2478472591018139],
+         [0.799159507154521, 1.6917874526020251, 0.0, 1.1073720545524943,
+          -1.1073720545524943, -2.4909469597565463],
+         [0.88435166310244473, 0.54998993362677651, 0.0, 2.334361729475666,
+          -2.334361729475666, -1.4343415967292217],
+         [0.96118485949221688, -0.47977568313266239, 0.0, 3.4409605426248748,
+          -3.4409605426248748, -0.48140917635955516]], dtype=object), 'FE2_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.50971524e+00,  -1.66533454e-16,  -7.71583216e-01,
+            2.61867978e-01,   3.28129845e+00,  -2.61867978e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.69178745e+00,   1.11022302e-16,   1.07372055e-01,
+            2.00840493e-01,   1.58441540e+00,  -2.00840493e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -5.49989934e-01,   2.77555756e-17,   1.33436173e+00,
+            1.15648337e-01,  -7.84371796e-01,  -1.15648337e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.79775683e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.88151405e-02,  -2.92073623e+00,  -3.88151405e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.52692501e+00,  -1.66533454e-16,  -7.71583216e-01,
+            1.24465821e+00,   2.29850822e+00,  -1.24465821e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -9.38033307e-01,   0.00000000e+00,   1.07372055e-01,
+            9.54594639e-01,   8.30661252e-01,  -9.54594639e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.15961854e-01,  -2.77555756e-17,   1.33436173e+00,
+            5.49676417e-01,  -1.21839988e+00,  -5.49676417e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.25448862e-01,  -4.44089210e-16,   2.44096054e+00,
+            1.84488320e-01,  -3.06640940e+00,  -1.84488320e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.44658209e-01,  -2.22044605e-16,  -7.71583216e-01,
+            2.52692501e+00,   1.01624142e+00,  -2.52692501e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.54053611e-02,   1.66533454e-16,   1.07372055e-01,
+            1.93803331e+00,  -1.52777416e-01,  -1.93803331e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.50323583e-01,  -8.32667268e-17,   1.33436173e+00,
+            1.11596185e+00,  -1.78468531e+00,  -1.11596185e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.15511680e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.74551138e-01,  -3.25647222e+00,  -3.74551138e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.38132022e-01,   1.66533454e-16,  -7.71583216e-01,
+            3.50971524e+00,   3.34511938e-02,  -3.50971524e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.99159507e-01,   1.94289029e-16,   1.07372055e-01,
+            2.69178745e+00,  -9.06531562e-01,  -2.69178745e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.84351663e-01,   2.77555756e-17,   1.33436173e+00,
+            1.54998993e+00,  -2.21871339e+00,  -1.54998993e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            9.61184859e-01,  -4.44089210e-16,   2.44096054e+00,
+            5.20224317e-01,  -3.40214540e+00,  -5.20224317e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1_D10': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -2.50971524, -0.73813202,  0.        ,  0.22841678,
+          -0.22841678,  3.24784726,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -1.69178745, -0.79915951,  0.        ,  1.10737205,
+          -1.10737205,  2.49094696,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.54998993, -0.88435166,  0.        ,  2.33436173,
+          -2.33436173,  1.4343416 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.47977568, -0.96118486,  0.        ,  3.44096054,
+          -3.44096054,  0.48140918,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -1.52692501,  0.24465821,  0.        ,  0.22841678,
+          -0.22841678,  1.2822668 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.93803331, -0.04540536,  0.        ,  1.10737205,
+          -1.10737205,  0.98343867,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11596185, -0.45032358,  0.        ,  2.33436173,
+          -2.33436173,  0.56628544,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.62544886, -0.81551168,  0.        ,  3.44096054,
+          -3.44096054,  0.19006282,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.24465821,  1.52692501,  0.        ,  0.22841678,
+          -0.22841678, -1.2822668 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.04540536,  0.93803331,  0.        ,  1.10737205,
+          -1.10737205, -0.98343867,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.45032358,  0.11596185,  0.        ,  2.33436173,
+          -2.33436173, -0.56628544,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.81551168, -0.62544886,  0.        ,  3.44096054,
+          -3.44096054, -0.19006282,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.73813202,  2.50971524,  0.        ,  0.22841678,
+          -0.22841678, -3.24784726,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.79915951,  1.69178745,  0.        ,  1.10737205,
+          -1.10737205, -2.49094696,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.88435166,  0.54998993,  0.        ,  2.33436173,
+          -2.33436173, -1.4343416 ,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.96118486, -0.47977568,  0.        ,  3.44096054,
+          -3.44096054, -0.48140918,  0.        ,  0.        ,  0.        ]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_C0_D01': array([[ -2.50971524e+00,  -1.66533454e-16,  -7.71583216e-01,
+            2.61867978e-01,   3.28129845e+00,  -2.61867978e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.69178745e+00,   1.11022302e-16,   1.07372055e-01,
+            2.00840493e-01,   1.58441540e+00,  -2.00840493e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -5.49989934e-01,   2.77555756e-17,   1.33436173e+00,
+            1.15648337e-01,  -7.84371796e-01,  -1.15648337e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.79775683e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.88151405e-02,  -2.92073623e+00,  -3.88151405e-02,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.52692501e+00,  -1.66533454e-16,  -7.71583216e-01,
+            1.24465821e+00,   2.29850822e+00,  -1.24465821e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -9.38033307e-01,   0.00000000e+00,   1.07372055e-01,
+            9.54594639e-01,   8.30661252e-01,  -9.54594639e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.15961854e-01,  -2.77555756e-17,   1.33436173e+00,
+            5.49676417e-01,  -1.21839988e+00,  -5.49676417e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  6.25448862e-01,  -4.44089210e-16,   2.44096054e+00,
+            1.84488320e-01,  -3.06640940e+00,  -1.84488320e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.44658209e-01,  -2.22044605e-16,  -7.71583216e-01,
+            2.52692501e+00,   1.01624142e+00,  -2.52692501e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.54053611e-02,   1.66533454e-16,   1.07372055e-01,
+            1.93803331e+00,  -1.52777416e-01,  -1.93803331e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.50323583e-01,  -8.32667268e-17,   1.33436173e+00,
+            1.11596185e+00,  -1.78468531e+00,  -1.11596185e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.15511680e-01,  -4.44089210e-16,   2.44096054e+00,
+            3.74551138e-01,  -3.25647222e+00,  -3.74551138e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.38132022e-01,   1.66533454e-16,  -7.71583216e-01,
+            3.50971524e+00,   3.34511938e-02,  -3.50971524e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.99159507e-01,   1.94289029e-16,   1.07372055e-01,
+            2.69178745e+00,  -9.06531562e-01,  -2.69178745e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.84351663e-01,   2.77555756e-17,   1.33436173e+00,
+            1.54998993e+00,  -2.21871339e+00,  -1.54998993e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  9.61184859e-01,  -4.44089210e-16,   2.44096054e+00,
+            5.20224317e-01,  -3.40214540e+00,  -5.20224317e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.66233382, -0.05689514, -0.05058242,  0.01495376,
+           0.20041947,  0.22977051,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.2327681 , -0.04516801, -0.12355891,  0.05560129,
+           0.74520255,  0.13515498,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08718888, -0.02724027,  0.09756515,  0.06749126,
+           0.9045593 ,  0.04481344,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09622691, -0.00951546,  0.61978605,  0.03339034,
+           0.44751784,  0.00504814,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.1664375 , -0.1175178 , -0.05058242,  0.07107521,
+           0.14429802,  0.78628949,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.01501169, -0.12474229, -0.12355891,  0.26427286,
+           0.53653098,  0.46250905,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12331911, -0.09965108,  0.09756515,  0.3207859 ,
+           0.65126466,  0.15335448,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.07610172, -0.04186759,  0.61978605,  0.15870426,
+           0.32220392,  0.01727508,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.1175178 ,  0.1664375 , -0.05058242,  0.14429802,
+           0.07107521,  0.78628949,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.12474229, -0.01501169, -0.12355891,  0.53653098,
+           0.26427286,  0.46250905,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.09965108, -0.12331911,  0.09756515,  0.65126466,
+           0.3207859 ,  0.15335448,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04186759, -0.07610172,  0.61978605,  0.32220392,
+           0.15870426,  0.01727508,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.05689514,  0.66233382, -0.05058242,  0.20041947,
+           0.01495376,  0.22977051,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.04516801,  0.2327681 , -0.12355891,  0.74520255,
+           0.05560129,  0.13515498,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02724027, -0.08718888,  0.09756515,  0.9045593 ,
+           0.06749126,  0.04481344,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.00951546, -0.09622691,  0.61978605,  0.44751784,
+           0.03339034,  0.00504814,  0.        ,  0.        ,  0.        ]]), 'FE2_C0': array([[ 0.66233382, -0.05689514, -0.05058242,  0.01495376,  0.20041947,
+           0.22977051,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.2327681 , -0.04516801, -0.12355891,  0.05560129,  0.74520255,
+           0.13515498,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.08718888, -0.02724027,  0.09756515,  0.06749126,  0.9045593 ,
+           0.04481344,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09622691, -0.00951546,  0.61978605,  0.03339034,  0.44751784,
+           0.00504814,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.1664375 , -0.1175178 , -0.05058242,  0.07107521,  0.14429802,
+           0.78628949,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.01501169, -0.12474229, -0.12355891,  0.26427286,  0.53653098,
+           0.46250905,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12331911, -0.09965108,  0.09756515,  0.3207859 ,  0.65126466,
+           0.15335448,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.07610172, -0.04186759,  0.61978605,  0.15870426,  0.32220392,
+           0.01727508,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.1175178 ,  0.1664375 , -0.05058242,  0.14429802,  0.07107521,
+           0.78628949,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.12474229, -0.01501169, -0.12355891,  0.53653098,  0.26427286,
+           0.46250905,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.09965108, -0.12331911,  0.09756515,  0.65126466,  0.3207859 ,
+           0.15335448,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04186759, -0.07610172,  0.61978605,  0.32220392,  0.15870426,
+           0.01727508,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.05689514,  0.66233382, -0.05058242,  0.20041947,  0.01495376,
+           0.22977051,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.04516801,  0.2327681 , -0.12355891,  0.74520255,  0.05560129,
+           0.13515498,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02724027, -0.08718888,  0.09756515,  0.9045593 ,  0.06749126,
+           0.04481344,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.00951546, -0.09622691,  0.61978605,  0.44751784,  0.03339034,
+           0.00504814,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE4': array([[1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [0.99999999999999989],
+         [1.0]], dtype=object), 'FE2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.87742881,  0.06546699,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.67294686,  0.05021012,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.38749748,  0.02891208,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.13005608,  0.00970379,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.63173125,  0.31116455,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.48450833,  0.23864866,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.27899046,  0.1374191 ,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.09363778,  0.04612208,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.31116455,  0.63173125,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.23864866,  0.48450833,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.1374191 ,  0.27899046,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.04612208,  0.09363778,  0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.06546699,  0.87742881,  0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05021012,  0.67294686,  0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.02891208,  0.38749748,  0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.00970379,  0.13005608,  0.86024014]]), 'FE0': array([[0.6623338215556972, -0.056895139802881842, -0.05058241768674708,
+          0.014953760384390308, 0.20041946721813891, 0.22977050833140236],
+         [0.23276809809770654, -0.04516801026556784, -0.12355890523764695,
+          0.055601287299908417, 0.74520255045163297, 0.13515497965396686],
+         [-0.08718888411365161, -0.027240266995992645, 0.09756515313616182,
+          0.067491262932790785, 0.90455929553271897, 0.044813439507972466],
+         [-0.096226911734323323, -0.0095154582353662032, 0.61978604633144241,
+          0.033390341735931695, 0.44751783691362235, 0.0050481449886929514],
+         [0.16643749695900031, -0.11751779509749462, -0.05058241768674708,
+          0.07107520646099133, 0.14429802114153806, 0.78628948822271205],
+         [-0.015011689481987923, -0.12474229414821482, -0.12355890523764693,
+          0.26427285664300715, 0.53653098110853414, 0.46250905111630813],
+         [-0.12331910605251509, -0.099651083772276355, 0.09756515313616182,
+          0.32078589759058163, 0.65126466087492807, 0.15335447822311959],
+         [-0.076101715088665228, -0.041867587396657691, 0.61978604633144241,
+          0.15870425710189318, 0.32220392154766098, 0.017275077504326344],
+         [-0.11751779509749458, 0.16643749695900029, -0.05058241768674708,
+          0.14429802114153809, 0.071075206460991261, 0.78628948822271205],
+         [-0.12474229414821481, -0.015011689481988087, -0.12355890523764695,
+          0.53653098110853426, 0.26427285664300726, 0.46250905111630836],
+         [-0.0996510837722763, -0.12331910605251518, 0.09756515313616182,
+          0.65126466087492807, 0.32078589759058174, 0.15335447822311959],
+         [-0.041867587396657691, -0.076101715088665284, 0.61978604633144241,
+          0.32220392154766114, 0.15870425710189295, 0.017275077504326344],
+         [-0.056895139802881876, 0.6623338215556972, -0.05058241768674708,
+          0.20041946721813905, 0.014953760384390294, 0.22977050833140236],
+         [-0.045168010265567847, 0.23276809809770624, -0.12355890523764693,
+          0.74520255045163286, 0.0556012872999085, 0.13515497965396692],
+         [-0.027240266995992635, -0.087188884113651763, 0.09756515313616182,
+          0.90455929553271897, 0.067491262932790869, 0.044813439507972466],
+         [-0.0095154582353661338, -0.096226911734323434, 0.61978604633144241,
+          0.44751783691362274, 0.033390341735931361, 0.0050481449886928959]], dtype=object), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_D01': array([[-2.5097152373218705, -1.6653345369377348e-16, -0.77158321554192932,
+          0.2618679782200577, 3.2812984528638003, -0.26186797822005725],
+         [-1.6917874526020253, 1.1102230246251565e-16, 0.10737205455249504,
+          0.20084049284547795, 1.5844153980495301, -0.20084049284547775],
+         [-0.54998993362677662, 2.7755575615628914e-17, 1.3343617294756669,
+          0.11564833689755472, -0.78437179584889039, -0.1156483368975546],
+         [0.4797756831326625, -4.4408920985006262e-16, 2.4409605426248775,
+          0.03881514050778323, -2.9207362257575396, -0.038815140507784007],
+         [-1.5269250065645008, -1.6653345369377348e-16, -0.77158321554192888,
+          1.2446582089774276, 2.2985082221064306, -1.2446582089774285],
+         [-0.93803330652173278, 0.0, 0.10737205455249532,
+          0.95459463892577068, 0.83066125196923757, -0.95459463892577068],
+         [-0.11596185398603498, -2.7755575615628914e-17, 1.3343617294756669,
+          0.54967641653829635, -1.2183998754896317, -0.54967641653829646],
+         [0.6254488622506863, -4.4408920985006262e-16, 2.4409605426248775,
+          0.18448831962580736, -3.0664094048755635, -0.18448831962580781],
+         [-0.2446582089774276, -2.2204460492503131e-16, -0.77158321554192888,
+          2.5269250065645004, 1.0162414245193578, -2.5269250065645021],
+         [0.04540536107422885, 1.6653345369377348e-16, 0.10737205455249538,
+          1.9380333065217321, -0.15277741562672359, -1.9380333065217328],
+         [0.45032358346170304, -8.3266726846886741e-17, 1.3343617294756669,
+          1.1159618539860343, -1.7846853129373699, -1.1159618539860348],
+         [0.81551168037419208, -4.4408920985006262e-16, 2.4409605426248775,
+          0.37455113774931248, -3.2564722229990686, -0.37455113774931359],
+         [0.7381320217799433, 1.6653345369377348e-16, -0.7715832155419291,
+          3.5097152373218696, 0.033451193761987463, -3.5097152373218719],
+         [0.79915950715452166, 1.9428902930940239e-16, 0.1073720545524951,
+          2.6917874526020245, -0.90653156170701621, -2.6917874526020249],
+         [0.8843516631024444, 2.7755575615628914e-17, 1.3343617294756669,
+          1.5499899336267755, -2.2187133925781106, -1.5499899336267764],
+         [0.9611848594922161, -4.4408920985006262e-16, 2.4409605426248775,
+          0.52022431686733683, -3.4021454021170929, -0.52022431686733772]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE2_C2_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00]]), 'FE2_C0_D10': array([[-2.50971524, -0.73813202,  0.        ,  0.22841678, -0.22841678,
+           3.24784726,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-1.69178745, -0.79915951,  0.        ,  1.10737205, -1.10737205,
+           2.49094696,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.54998993, -0.88435166,  0.        ,  2.33436173, -2.33436173,
+           1.4343416 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.47977568, -0.96118486,  0.        ,  3.44096054, -3.44096054,
+           0.48140918,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-1.52692501,  0.24465821,  0.        ,  0.22841678, -0.22841678,
+           1.2822668 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.93803331, -0.04540536,  0.        ,  1.10737205, -1.10737205,
+           0.98343867,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.11596185, -0.45032358,  0.        ,  2.33436173, -2.33436173,
+           0.56628544,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.62544886, -0.81551168,  0.        ,  3.44096054, -3.44096054,
+           0.19006282,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.24465821,  1.52692501,  0.        ,  0.22841678, -0.22841678,
+          -1.2822668 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.04540536,  0.93803331,  0.        ,  1.10737205, -1.10737205,
+          -0.98343867,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.45032358,  0.11596185,  0.        ,  2.33436173, -2.33436173,
+          -0.56628544,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.81551168, -0.62544886,  0.        ,  3.44096054, -3.44096054,
+          -0.19006282,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.73813202,  2.50971524,  0.        ,  0.22841678, -0.22841678,
+          -3.24784726,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.79915951,  1.69178745,  0.        ,  1.10737205, -1.10737205,
+          -2.49094696,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.88435166,  0.54998993,  0.        ,  2.33436173, -2.33436173,
+          -1.4343416 ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.96118486, -0.47977568,  0.        ,  3.44096054, -3.44096054,
+          -0.48140918,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE2_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE1_C0': array([[ 0.87742881,  0.06546699,  0.0571042 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.67294686,  0.05021012,  0.27684301,  0.        ,  0.        ,
+           0.        ],
+         [ 0.38749748,  0.02891208,  0.58359043,  0.        ,  0.        ,
+           0.        ],
+         [ 0.13005608,  0.00970379,  0.86024014,  0.        ,  0.        ,
+           0.        ],
+         [ 0.63173125,  0.31116455,  0.0571042 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.48450833,  0.23864866,  0.27684301,  0.        ,  0.        ,
+           0.        ],
+         [ 0.27899046,  0.1374191 ,  0.58359043,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09363778,  0.04612208,  0.86024014,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31116455,  0.63173125,  0.0571042 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.23864866,  0.48450833,  0.27684301,  0.        ,  0.        ,
+           0.        ],
+         [ 0.1374191 ,  0.27899046,  0.58359043,  0.        ,  0.        ,
+           0.        ],
+         [ 0.04612208,  0.09363778,  0.86024014,  0.        ,  0.        ,
+           0.        ],
+         [ 0.06546699,  0.87742881,  0.0571042 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05021012,  0.67294686,  0.27684301,  0.        ,  0.        ,
+           0.        ],
+         [ 0.02891208,  0.38749748,  0.58359043,  0.        ,  0.        ,
+           0.        ],
+         [ 0.00970379,  0.13005608,  0.86024014,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.87742881,  0.06546699,
+           0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.67294686,  0.05021012,
+           0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.38749748,  0.02891208,
+           0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.13005608,  0.00970379,
+           0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.63173125,  0.31116455,
+           0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.48450833,  0.23864866,
+           0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.27899046,  0.1374191 ,
+           0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.09363778,  0.04612208,
+           0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.31116455,  0.63173125,
+           0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.23864866,  0.48450833,
+           0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.1374191 ,  0.27899046,
+           0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.04612208,  0.09363778,
+           0.86024014],
+         [ 0.        ,  0.        ,  0.        ,  0.06546699,  0.87742881,
+           0.0571042 ],
+         [ 0.        ,  0.        ,  0.        ,  0.05021012,  0.67294686,
+           0.27684301],
+         [ 0.        ,  0.        ,  0.        ,  0.02891208,  0.38749748,
+           0.58359043],
+         [ 0.        ,  0.        ,  0.        ,  0.00970379,  0.13005608,
+           0.86024014]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {'FE2_C1_D01': ['FE3_C1_D01'], 'FE2_C1_D10': ['FE3_C1_D10'], 'FE2_C0_D01': ['FE3_C0_D01'], 'FE2_C2_D10': ['FE3_C2_D10'], 'FE2_C2_D01': ['FE3_C2_D01'], 'FE2_C1': ['FE3_C1'], 'FE2_C0': ['FE3_C0'], 'FE2_C2': ['FE3_C2'], 'FE2_C0_D10': ['FE3_C0_D10']}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE2_C1_D01': 'FE2_C1_D01', 'FE3_C1_D10': 'FE2_C1_D10', 'FE0_D01': 'FE0_D01', 'FE1_C1_D10': 'FE1_C1_D10', 'FE3_C0_D10': 'FE2_C0_D10', 'FE2_C0_D01': 'FE2_C0_D01', 'FE2_C1': 'FE2_C1', 'FE2_C0': 'FE2_C0', 'FE4': 'FE4', 'FE2_C2': 'FE2_C2', 'FE0': 'FE0', 'FE1_C0_D01': 'FE1_C0_D01', 'FE2_C1_D10': 'FE2_C1_D10', 'FE3_C1_D01': 'FE2_C1_D01', 'FE1_C1_D01': 'FE1_C1_D01', 'FE2_C2_D01': 'FE2_C2_D01', 'FE3_C2_D01': 'FE2_C2_D01', 'FE3_C0_D01': 'FE2_C0_D01', 'FE2_C0_D10': 'FE2_C0_D10', 'FE2_C2_D10': 'FE2_C2_D10', 'FE1_C0_D10': 'FE1_C0_D10', 'FE3_C2': 'FE2_C2', 'FE1_C1': 'FE1_C1', 'FE3_C0': 'FE2_C0', 'FE3_C1': 'FE2_C1', 'FE1_C0': 'FE1_C0', 'FE3_C2_D10': 'FE2_C2_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D10': array([[-2.5097152373218714, -0.73813202177994264, 0.22841678445806923,
+          -0.22841678445806923, 3.2478472591018139],
+         [-1.6917874526020258, -0.79915950715452166, 1.1073720545524943,
+          -1.1073720545524943, 2.4909469597565472],
+         [-0.54998993362677651, -0.88435166310244473, 2.334361729475666,
+          -2.334361729475666, 1.4343415967292208],
+         [0.47977568313266317, -0.9611848594922161, 3.4409605426248748,
+          -3.4409605426248748, 0.48140917635955227],
+         [-1.5269250065645006, 0.24465820897742863, 0.22841678445806934,
+          -0.22841678445806934, 1.2822667975870721],
+         [-0.93803330652173278, -0.045405361074228628, 1.1073720545524943,
+          -1.1073720545524943, 0.98343866759596121],
+         [-0.11596185398603487, -0.45032358346170315, 2.334361729475666,
+          -2.334361729475666, 0.56628543744773763],
+         [0.62544886225068697, -0.8155116803741923, 3.4409605426248748,
+          -3.4409605426248748, 0.19006281812350467],
+         [-0.24465820897742774, 1.5269250065645017, 0.22841678445806934,
+          -0.22841678445806934, -1.2822667975870738],
+         [0.045405361074228601, 0.93803330652173311, 1.1073720545524945,
+          -1.1073720545524945, -0.98343866759596188],
+         [0.45032358346170309, 0.11596185398603487, 2.334361729475666,
+          -2.334361729475666, -0.5662854374477384],
+         [0.81551168037419286, -0.62544886225068641, 3.4409605426248748,
+          -3.4409605426248748, -0.1900628181235072],
+         [0.7381320217799423, 2.5097152373218714, 0.22841678445806923,
+          -0.22841678445806923, -3.2478472591018139],
+         [0.799159507154521, 1.6917874526020251, 1.1073720545524943,
+          -1.1073720545524943, -2.4909469597565463],
+         [0.88435166310244473, 0.54998993362677651, 2.334361729475666,
+          -2.334361729475666, -1.4343415967292217],
+         [0.96118485949221688, -0.47977568313266239, 3.4409605426248748,
+          -3.4409605426248748, -0.48140917635955516]], dtype=object), 'FE4': array([[1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [1.0],
+         [1.0],
+         [0.99999999999999989],
+         [0.99999999999999989],
+         [1.0]], dtype=object), 'FE0': array([[0.6623338215556972, -0.056895139802881842, -0.05058241768674708,
+          0.014953760384390308, 0.20041946721813891, 0.22977050833140236],
+         [0.23276809809770654, -0.04516801026556784, -0.12355890523764695,
+          0.055601287299908417, 0.74520255045163297, 0.13515497965396686],
+         [-0.08718888411365161, -0.027240266995992645, 0.09756515313616182,
+          0.067491262932790785, 0.90455929553271897, 0.044813439507972466],
+         [-0.096226911734323323, -0.0095154582353662032, 0.61978604633144241,
+          0.033390341735931695, 0.44751783691362235, 0.0050481449886929514],
+         [0.16643749695900031, -0.11751779509749462, -0.05058241768674708,
+          0.07107520646099133, 0.14429802114153806, 0.78628948822271205],
+         [-0.015011689481987923, -0.12474229414821482, -0.12355890523764693,
+          0.26427285664300715, 0.53653098110853414, 0.46250905111630813],
+         [-0.12331910605251509, -0.099651083772276355, 0.09756515313616182,
+          0.32078589759058163, 0.65126466087492807, 0.15335447822311959],
+         [-0.076101715088665228, -0.041867587396657691, 0.61978604633144241,
+          0.15870425710189318, 0.32220392154766098, 0.017275077504326344],
+         [-0.11751779509749458, 0.16643749695900029, -0.05058241768674708,
+          0.14429802114153809, 0.071075206460991261, 0.78628948822271205],
+         [-0.12474229414821481, -0.015011689481988087, -0.12355890523764695,
+          0.53653098110853426, 0.26427285664300726, 0.46250905111630836],
+         [-0.0996510837722763, -0.12331910605251518, 0.09756515313616182,
+          0.65126466087492807, 0.32078589759058174, 0.15335447822311959],
+         [-0.041867587396657691, -0.076101715088665284, 0.61978604633144241,
+          0.32220392154766114, 0.15870425710189295, 0.017275077504326344],
+         [-0.056895139802881876, 0.6623338215556972, -0.05058241768674708,
+          0.20041946721813905, 0.014953760384390294, 0.22977050833140236],
+         [-0.045168010265567847, 0.23276809809770624, -0.12355890523764693,
+          0.74520255045163286, 0.0556012872999085, 0.13515497965396692],
+         [-0.027240266995992635, -0.087188884113651763, 0.09756515313616182,
+          0.90455929553271897, 0.067491262932790869, 0.044813439507972466],
+         [-0.0095154582353661338, -0.096226911734323434, 0.61978604633144241,
+          0.44751783691362274, 0.033390341735931361, 0.0050481449886928959]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE0_D01': array([[-2.5097152373218705, -0.77158321554192932, 0.2618679782200577,
+          3.2812984528638003, -0.26186797822005725],
+         [-1.6917874526020253, 0.10737205455249504, 0.20084049284547795,
+          1.5844153980495301, -0.20084049284547775],
+         [-0.54998993362677662, 1.3343617294756669, 0.11564833689755472,
+          -0.78437179584889039, -0.1156483368975546],
+         [0.4797756831326625, 2.4409605426248775, 0.03881514050778323,
+          -2.9207362257575396, -0.038815140507784007],
+         [-1.5269250065645008, -0.77158321554192888, 1.2446582089774276,
+          2.2985082221064306, -1.2446582089774285],
+         [-0.93803330652173278, 0.10737205455249532, 0.95459463892577068,
+          0.83066125196923757, -0.95459463892577068],
+         [-0.11596185398603498, 1.3343617294756669, 0.54967641653829635,
+          -1.2183998754896317, -0.54967641653829646],
+         [0.6254488622506863, 2.4409605426248775, 0.18448831962580736,
+          -3.0664094048755635, -0.18448831962580781],
+         [-0.2446582089774276, -0.77158321554192888, 2.5269250065645004,
+          1.0162414245193578, -2.5269250065645021],
+         [0.04540536107422885, 0.10737205455249538, 1.9380333065217321,
+          -0.15277741562672359, -1.9380333065217328],
+         [0.45032358346170304, 1.3343617294756669, 1.1159618539860343,
+          -1.7846853129373699, -1.1159618539860348],
+         [0.81551168037419208, 2.4409605426248775, 0.37455113774931248,
+          -3.2564722229990686, -0.37455113774931359],
+         [0.7381320217799433, -0.7715832155419291, 3.5097152373218696,
+          0.033451193761987463, -3.5097152373218719],
+         [0.79915950715452166, 0.1073720545524951, 2.6917874526020245,
+          -0.90653156170701621, -2.6917874526020249],
+         [0.8843516631024444, 1.3343617294756669, 1.5499899336267755,
+          -2.2187133925781106, -1.5499899336267764],
+         [0.9611848594922161, 2.4409605426248775, 0.52022431686733683,
+          -3.4021454021170929, -0.52022431686733772]], dtype=object), 'FE1_C0': array([[ 0.87742881,  0.06546699,  0.0571042 ],
+         [ 0.67294686,  0.05021012,  0.27684301],
+         [ 0.38749748,  0.02891208,  0.58359043],
+         [ 0.13005608,  0.00970379,  0.86024014],
+         [ 0.63173125,  0.31116455,  0.0571042 ],
+         [ 0.48450833,  0.23864866,  0.27684301],
+         [ 0.27899046,  0.1374191 ,  0.58359043],
+         [ 0.09363778,  0.04612208,  0.86024014],
+         [ 0.31116455,  0.63173125,  0.0571042 ],
+         [ 0.23864866,  0.48450833,  0.27684301],
+         [ 0.1374191 ,  0.27899046,  0.58359043],
+         [ 0.04612208,  0.09363778,  0.86024014],
+         [ 0.06546699,  0.87742881,  0.0571042 ],
+         [ 0.05021012,  0.67294686,  0.27684301],
+         [ 0.02891208,  0.38749748,  0.58359043],
+         [ 0.00970379,  0.13005608,  0.86024014]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D10', (1, [0, 1, 3, 4, 5]), False, False), 'FE2_C1_D01': ('FE0_D01', (12, [6, 8, 9, 10, 11]), False, False), 'FE3_C1_D10': ('FE0_D10', (13, [6, 7, 9, 10, 11]), False, False), 'FE0_D01': ('FE0_D01', (0, [0, 2, 3, 4, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (7, [3, 4]), False, False), 'FE3_C0_D10': ('FE0_D10', (10, [0, 1, 3, 4, 5]), False, False), 'FE2_C0_D01': ('FE0_D01', (9, [0, 2, 3, 4, 5]), False, False), 'FE2_C1': ('FE0', (11, [6, 7, 8, 9, 10, 11]), False, False), 'FE2_C0': ('FE0', (8, [0, 1, 2, 3, 4, 5]), False, False), 'FE4': ('FE4', (), False, True), 'FE2_C2': ('FE1_C0', (14, [12, 13, 14]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (3, [0, 2]), False, False), 'FE2_C1_D10': ('FE0_D10', (13, [6, 7, 9, 10, 11]), False, False), 'FE3_C1_D01': ('FE0_D01', (12, [6, 8, 9, 10, 11]), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (6, [3, 5]), False, False), 'FE2_C2_D01': ('FE1_C0_D01', (15, [12, 14]), False, False), 'FE3_C2_D01': ('FE1_C0_D01', (15, [12, 14]), False, False), 'FE3_C0_D01': ('FE0_D01', (9, [0, 2, 3, 4, 5]), False, False), 'FE2_C0_D10': ('FE0_D10', (10, [0, 1, 3, 4, 5]), False, False), 'FE2_C2_D10': ('FE1_C0_D01', (16, [12, 13]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (4, [0, 1]), False, False), 'FE3_C2': ('FE1_C0', (14, [12, 13, 14]), False, False), 'FE1_C1': ('FE1_C0', (5, [3, 4, 5]), False, False), 'FE3_C0': ('FE0', (8, [0, 1, 2, 3, 4, 5]), False, False), 'FE3_C1': ('FE0', (11, [6, 7, 8, 9, 10, 11]), False, False), 'FE1_C0': ('FE1_C0', (2, [0, 1, 2]), False, False), 'FE3_C2_D10': ('FE1_C0_D01', (16, [12, 13]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {0: {(0, 0): array([[1.1275702593849246e-16, 4.163336342344337e-17,
+          4.163336342344337e-17],
+         [0.68729833462074186, -9.7144514654701197e-17, -0.08729833462074163],
+         [-0.087298334620741658, 8.3266726846886741e-17, 0.68729833462074186],
+         [0.39999999999999991, 0.99999999999999978, 0.3999999999999998],
+         [-4.8572257327350599e-17, 1.3877787807814457e-17,
+          5.5511151231257827e-17],
+         [-1.231653667943533e-16, 0.0, -6.9388939039072284e-17]], dtype=object)}, 1: {(0, 0): array([[0.68729833462074175, 8.3266726846886741e-17, -0.087298334620741616],
+         [9.3675067702747583e-17, 8.3266726846886741e-17,
+          9.7144514654701197e-17],
+         [-0.087298334620741658, 8.3266726846886741e-17, 0.68729833462074186],
+         [-2.7755575615628914e-17, 0.0, 0.0],
+         [0.39999999999999974, 0.99999999999999978, 0.39999999999999974],
+         [-1.231653667943533e-16, 0.0, -6.9388939039072284e-17]], dtype=object)}, 2: {(0, 0): array([[0.68729833462074175, 4.163336342344337e-17, -0.087298334620741685],
+         [-0.08729833462074163, 1.3877787807814457e-17, 0.68729833462074175],
+         [0.0, 0.0, 0.0],
+         [0.0, 0.0, 0.0],
+         [-2.7755575615628914e-17, -5.5511151231257827e-17,
+          -5.5511151231257827e-17],
+         [0.39999999999999991, 1.0, 0.39999999999999991]], dtype=object)}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 0): array([[2.7755575615628914e-17, 4.163336342344337e-17,
+          5.5511151231257827e-17],
+         [0.8872983346207417, 0.5, 0.11270166537925835],
+         [0.1127016653792583, 0.5, 0.8872983346207417]], dtype=object)}, 1: {(0, 0): array([[0.8872983346207417, 0.5, 0.11270166537925835],
+         [2.7755575615628914e-17, 4.163336342344337e-17,
+          5.5511151231257827e-17],
+         [0.1127016653792583, 0.5, 0.8872983346207417]], dtype=object)}, 2: {(0, 0): array([[0.88729833462074181, 0.5, 0.11270166537925827],
+         [0.11270166537925827, 0.5, 0.88729833462074181],
+         [0.0, 0.0, 0.0]], dtype=object)}}}, MixedElement(*[MixedElement(*[FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None)], **{'value_shape': (2,) }), FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {0: {(0, 0): array([[[  1.12757026e-16,   4.16333634e-17,   4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.87298335e-01,  -9.71445147e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -4.85722573e-17,   1.38777878e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12757026e-16,   4.16333634e-17,   4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,  -9.71445147e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -4.85722573e-17,   1.38777878e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 1: {(0, 0): array([[[  6.87298335e-01,   8.32667268e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  9.36750677e-17,   8.32667268e-17,   9.71445147e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.77555756e-17,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,   8.32667268e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  9.36750677e-17,   8.32667268e-17,   9.71445147e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.77555756e-17,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 2: {(0, 0): array([[[  6.87298335e-01,   4.16333634e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   1.38777878e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,   4.16333634e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   1.38777878e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 1: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 2: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.88729833,  0.5       ,  0.11270167],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.11270167,  0.5       ,  0.88729833],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.88729833,  0.5       ,  0.11270167]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.11270167,  0.5       ,  0.88729833]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE2_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f0': array([[2.7755575615628914e-17, 0.8872983346207417, 0.1127016653792583],
+         [4.163336342344337e-17, 0.5, 0.5],
+         [5.5511151231257827e-17, 0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE0_f1': array([[0.8872983346207417, 2.7755575615628914e-17, 0.1127016653792583],
+         [0.5, 4.163336342344337e-17, 0.5],
+         [0.11270166537925835, 5.5511151231257827e-17, 0.8872983346207417]], dtype=object), 'FE0_f2': array([[0.88729833462074181, 0.11270166537925827, 0.0],
+         [0.5, 0.5, 0.0],
+         [0.11270166537925827, 0.88729833462074181, 0.0]], dtype=object), 'FE2_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE2_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE3_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f1_C0': array([[  6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f2': array([[0.68729833462074175, -0.08729833462074163, 0.0, 0.0,
+          -2.7755575615628914e-17, 0.39999999999999991],
+         [4.163336342344337e-17, 1.3877787807814457e-17, 0.0, 0.0,
+          -5.5511151231257827e-17, 1.0],
+         [-0.087298334620741685, 0.68729833462074175, 0.0, 0.0,
+          -5.5511151231257827e-17, 0.39999999999999991]], dtype=object), 'FE1_f1': array([[0.68729833462074175, 9.3675067702747583e-17, -0.087298334620741658,
+          -2.7755575615628914e-17, 0.39999999999999974,
+          -1.231653667943533e-16],
+         [8.3266726846886741e-17, 8.3266726846886741e-17,
+          8.3266726846886741e-17, 0.0, 0.99999999999999978, 0.0],
+         [-0.087298334620741616, 9.7144514654701197e-17, 0.68729833462074186,
+          0.0, 0.39999999999999974, -6.9388939039072284e-17]], dtype=object), 'FE1_f0': array([[1.1275702593849246e-16, 0.68729833462074186, -0.087298334620741658,
+          0.39999999999999991, -4.8572257327350599e-17,
+          -1.231653667943533e-16],
+         [4.163336342344337e-17, -9.7144514654701197e-17,
+          8.3266726846886741e-17, 0.99999999999999978,
+          1.3877787807814457e-17, 0.0],
+         [4.163336342344337e-17, -0.08729833462074163, 0.68729833462074186,
+          0.3999999999999998, 5.5511151231257827e-17, -6.9388939039072284e-17]], dtype=object), 'FE3_f2_C0': array([[  6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE3_f2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.88729833,  0.11270167,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.5       ,  0.5       ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.11270167,  0.88729833,  0.        ]]), 'FE2_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE3_f1_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE2_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE2_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE2_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE3_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE3_f0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE3_f0_C0': array([[  1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[2.7755575615628914e-17, 0.8872983346207417, 0.1127016653792583],
+         [4.163336342344337e-17, 0.5, 0.5],
+         [5.5511151231257827e-17, 0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE0_f1': array([[0.8872983346207417, 2.7755575615628914e-17, 0.1127016653792583],
+         [0.5, 4.163336342344337e-17, 0.5],
+         [0.11270166537925835, 5.5511151231257827e-17, 0.8872983346207417]], dtype=object), 'FE0_f2': array([[0.88729833462074181, 0.11270166537925827, 0.0],
+         [0.5, 0.5, 0.0],
+         [0.11270166537925827, 0.88729833462074181, 0.0]], dtype=object), 'FE2_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE2_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE3_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f1_C0': array([[  6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f2': array([[0.68729833462074175, -0.08729833462074163, 0.0, 0.0,
+          -2.7755575615628914e-17, 0.39999999999999991],
+         [4.163336342344337e-17, 1.3877787807814457e-17, 0.0, 0.0,
+          -5.5511151231257827e-17, 1.0],
+         [-0.087298334620741685, 0.68729833462074175, 0.0, 0.0,
+          -5.5511151231257827e-17, 0.39999999999999991]], dtype=object), 'FE1_f1': array([[0.68729833462074175, 9.3675067702747583e-17, -0.087298334620741658,
+          -2.7755575615628914e-17, 0.39999999999999974,
+          -1.231653667943533e-16],
+         [8.3266726846886741e-17, 8.3266726846886741e-17,
+          8.3266726846886741e-17, 0.0, 0.99999999999999978, 0.0],
+         [-0.087298334620741616, 9.7144514654701197e-17, 0.68729833462074186,
+          0.0, 0.39999999999999974, -6.9388939039072284e-17]], dtype=object), 'FE1_f0': array([[1.1275702593849246e-16, 0.68729833462074186, -0.087298334620741658,
+          0.39999999999999991, -4.8572257327350599e-17,
+          -1.231653667943533e-16],
+         [4.163336342344337e-17, -9.7144514654701197e-17,
+          8.3266726846886741e-17, 0.99999999999999978,
+          1.3877787807814457e-17, 0.0],
+         [4.163336342344337e-17, -0.08729833462074163, 0.68729833462074186,
+          0.3999999999999998, 5.5511151231257827e-17, -6.9388939039072284e-17]], dtype=object), 'FE3_f2_C0': array([[  6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.88729833,  0.11270167,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.5       ,  0.5       ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.11270167,  0.88729833,  0.        ]]), 'FE2_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE3_f1_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE2_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE2_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE3_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE3_f0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE3_f0_C0': array([[  1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE2_f0_C0_D10': ['FE2_f1_C0_D10', 'FE2_f2_C0_D10'], 'FE2_f0_C1_D01': ['FE2_f1_C1_D01', 'FE2_f2_C1_D01'], 'FE2_f0_C0_D01': ['FE2_f1_C0_D01', 'FE2_f2_C0_D01'], 'FE2_f0_C1_D10': ['FE2_f1_C1_D10', 'FE2_f2_C1_D10']}
+  
+  inv_name_map: {'FE2_f1_C1_D01': 'FE2_f0_C1_D01', 'FE2_f2_C0_D10': 'FE2_f0_C0_D10', 'FE0_f0': 'FE0_f0', 'FE0_f1': 'FE0_f1', 'FE0_f2': 'FE0_f2', 'FE2_f0_C1_D01': 'FE2_f0_C1_D01', 'FE2_f2_C0': 'FE2_f2_C0', 'FE2_f0_C1': 'FE2_f0_C1', 'FE2_f0_C0_D01': 'FE2_f0_C0_D01', 'FE3_f1_C1': 'FE3_f1_C1', 'FE3_f1_C0': 'FE3_f1_C0', 'FE2_f0_C0': 'FE2_f0_C0', 'FE2_f2_C1_D01': 'FE2_f0_C1_D01', 'FE2_f1_C0_D10': 'FE2_f0_C0_D10', 'FE1_f2': 'FE1_f2', 'FE1_f1': 'FE1_f1', 'FE1_f0': 'FE1_f0', 'FE3_f2_C0': 'FE3_f2_C0', 'FE2_f2_C0_D01': 'FE2_f0_C0_D01', 'FE3_f2_C2': 'FE3_f2_C2', 'FE2_f0_C1_D10': 'FE2_f0_C1_D10', 'FE2_f1_C1_D10': 'FE2_f0_C1_D10', 'FE3_f1_C2': 'FE3_f1_C2', 'FE2_f2_C1': 'FE2_f2_C1', 'FE2_f0_C0_D10': 'FE2_f0_C0_D10', 'FE2_f2_C1_D10': 'FE2_f0_C1_D10', 'FE3_f2_C1': 'FE3_f2_C1', 'FE2_f1_C0_D01': 'FE2_f0_C0_D01', 'FE2_f1_C0': 'FE2_f1_C0', 'FE2_f1_C1': 'FE2_f1_C1', 'FE3_f0_C2': 'FE3_f0_C2', 'FE3_f0_C0': 'FE3_f0_C0', 'FE3_f0_C1': 'FE3_f0_C1'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.8872983346207417, 0.1127016653792583],
+         [0.5, 0.5],
+         [0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE2_f0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE1_f0': array([[0.68729833462074186, -0.087298334620741658, 0.39999999999999991],
+         [0, 0, 0.99999999999999978],
+         [-0.08729833462074163, 0.68729833462074186, 0.3999999999999998]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE2_f1_C1_D01': ('FE2_f0_C0_D01', (10, [3, 5]), False, False), 'FE2_f2_C0_D10': ('FE2_f0_C0_D01', (8, [0, 1]), False, False), 'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE0_f1': ('FE0_f0', (1, [0, 2]), False, False), 'FE0_f2': ('FE0_f0', (2, [0, 1]), False, False), 'FE2_f0_C1_D01': ('FE2_f0_C0_D01', (10, [3, 5]), False, False), 'FE2_f2_C0': ('FE0_f0', (14, [0, 1]), False, False), 'FE2_f0_C1': ('FE0_f0', (9, [4, 5]), False, False), 'FE2_f0_C0_D01': ('FE2_f0_C0_D01', (7, [0, 2]), False, False), 'FE3_f1_C1': ('FE1_f0', (20, [6, 8, 10]), False, False), 'FE3_f1_C0': ('FE1_f0', (19, [0, 2, 4]), False, False), 'FE2_f0_C0': ('FE0_f0', (6, [1, 2]), False, False), 'FE2_f2_C1_D01': ('FE2_f0_C0_D01', (10, [3, 5]), False, False), 'FE2_f1_C0_D10': ('FE2_f0_C0_D01', (8, [0, 1]), False, False), 'FE1_f2': ('FE1_f0', (5, [0, 1, 5]), False, False), 'FE1_f1': ('FE1_f0', (4, [0, 2, 4]), False, False), 'FE1_f0': ('FE1_f0', (3, [1, 2, 3]), False, False), 'FE3_f2_C0': ('FE1_f0', (22, [0, 1, 5]), False, False), 'FE2_f2_C0_D01': ('FE2_f0_C0_D01', (7, [0, 2]), False, False), 'FE3_f2_C2': ('FE0_f0', (24, [12, 13]), False, False), 'FE2_f0_C1_D10': ('FE2_f0_C0_D01', (11, [3, 4]), False, False), 'FE2_f1_C1_D10': ('FE2_f0_C0_D01', (11, [3, 4]), False, False), 'FE3_f1_C2': ('FE0_f0', (21, [12, 14]), False, False), 'FE2_f2_C1': ('FE0_f0', (15, [3, 4]), False, False), 'FE2_f0_C0_D10': ('FE2_f0_C0_D01', (8, [0, 1]), False, False), 'FE2_f2_C1_D10': ('FE2_f0_C0_D01', (11, [3, 4]), False, False), 'FE3_f2_C1': ('FE1_f0', (23, [6, 7, 11]), False, False), 'FE2_f1_C0_D01': ('FE2_f0_C0_D01', (7, [0, 2]), False, False), 'FE2_f1_C0': ('FE0_f0', (12, [0, 2]), False, False), 'FE2_f1_C1': ('FE0_f0', (13, [3, 5]), False, False), 'FE3_f0_C2': ('FE0_f0', (18, [13, 14]), False, False), 'FE3_f0_C0': ('FE1_f0', (16, [1, 2, 3]), False, False), 'FE3_f0_C1': ('FE1_f0', (17, [7, 8, 9]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00538 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00377 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0043 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00349 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00404 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00329 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00452 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00345 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00551 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00733 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00578 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0128 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0104 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00784 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00598 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0077 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00605 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0129 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0111 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00997 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00633 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0109 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0111 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0197 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0165 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0119 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0102 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0109 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00884 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0123 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00715 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0097 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00881 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00951 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00661 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00926 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00677 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0157 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00621 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00821 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00584 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00815 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00559 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00777 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00534 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00701 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00585 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00742 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0053 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00672 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00523 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0078 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00608 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00858 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00721 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0175 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0149 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0112 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00831 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0145 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.013 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.012 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0072 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0107 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00666 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.0104 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00767 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.012 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00575 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00727 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0054 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00741 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0071 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00788 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00566 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00768 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.0065 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00714 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  225 entries computed in 0.00662 seconds
+  Shape of reference tensor: (1, 15, 15)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  390 entries computed in 0.00692 seconds
+  Shape of reference tensor: (1, 15, 26)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 2 dims = [15, 26] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 25], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [2, 20], [2, 21], [2, 22], [2, 23], [2, 24], [2, 25], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 16], [3, 17], [3, 18], [3, 19], [3, 20], [3, 21], [3, 22], [3, 23], [3, 24], [3, 25], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [4, 15], [4, 16], [4, 17], [4, 18], [4, 19], [4, 20], [4, 21], [4, 22], [4, 23], [4, 24], [4, 25], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [6, 15], [6, 16], [6, 17], [6, 18], [6, 19], [6, 20], [6, 21], [6, 22], [6, 23], [6, 24], [6, 25], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [7, 15], [7, 16], [7, 17], [7, 18], [7, 19], [7, 20], [7, 21], [7, 22], [7, 23], [7, 24], [7, 25], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [8, 15], [8, 16], [8, 17], [8, 18], [8, 19], [8, 20], [8, 21], [8, 22], [8, 23], [8, 24], [8, 25], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [9, 15], [9, 16], [9, 17], [9, 18], [9, 19], [9, 20], [9, 21], [9, 22], [9, 23], [9, 24], [9, 25], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [10, 15], [10, 16], [10, 17], [10, 18], [10, 19], [10, 20], [10, 21], [10, 22], [10, 23], [10, 24], [10, 25], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [11, 15], [11, 16], [11, 17], [11, 18], [11, 19], [11, 20], [11, 21], [11, 22], [11, 23], [11, 24], [11, 25], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [12, 17], [12, 18], [12, 19], [12, 20], [12, 21], [12, 22], [12, 23], [12, 24], [12, 25], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [13, 15], [13, 16], [13, 17], [13, 18], [13, 19], [13, 20], [13, 21], [13, 22], [13, 23], [13, 24], [13, 25], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14], [14, 15], [14, 16], [14, 17], [14, 18], [14, 19], [14, 20], [14, 21], [14, 22], [14, 23], [14, 24], [14, 25]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00506 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00385 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00366 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00368 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00422 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00358 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00352 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  6750 entries computed in 0.00363 seconds
+  Shape of reference tensor: (15, 15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [15, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1], [6, 0], [6, 1], [7, 0], [7, 1], [8, 0], [8, 1], [9, 0], [9, 1], [10, 0], [10, 1], [11, 0], [11, 1], [12, 0], [12, 1], [13, 0], [13, 1], [14, 0], [14, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.0037 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00405 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  900 entries computed in 0.00337 seconds
+  Shape of reference tensor: (15, 15, 1, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  900 entries computed in 0.00387 seconds
+  Shape of reference tensor: (15, 15, 1, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  900 entries computed in 0.00734 seconds
+  Shape of reference tensor: (15, 15, 1, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  900 entries computed in 0.0052 seconds
+  Shape of reference tensor: (15, 15, 1, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [1, 2, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00437 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  450 entries computed in 0.00494 seconds
+  Shape of reference tensor: (15, 15, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {7: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.33333333,  0.10128651,  0.10128651,  0.79742699,  0.47014206,
+            0.47014206,  0.05971587],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.33333333,  0.79742699,  0.10128651,  0.10128651,  0.05971587,
+            0.47014206,  0.47014206],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.33333333,  0.10128651,  0.79742699,  0.10128651,  0.47014206,
+            0.05971587,  0.47014206],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.10128651,  0.10128651,  0.79742699,  0.47014206,
+            0.47014206,  0.05971587]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.79742699,  0.10128651,  0.10128651,  0.05971587,
+            0.47014206,  0.47014206]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.10128651,  0.79742699,  0.10128651,  0.47014206,
+            0.05971587,  0.47014206]]])}}}, MixedElement(*[VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {None: {(0, 1): array([[[ -3.33333333e-01,   5.94853971e-01,   5.94853971e-01,
+            -2.18970794e+00,  -8.80568256e-01,  -8.80568256e-01,
+             7.61136513e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  8.32667268e-17,   2.22044605e-16,  -2.22044605e-16,
+             5.55111512e-17,   1.52655666e-16,  -2.77555756e-16,
+             9.71445147e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  3.33333333e-01,  -5.94853971e-01,   2.18970794e+00,
+            -5.94853971e-01,   8.80568256e-01,  -7.61136513e-01,
+             8.80568256e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.33333333e+00,   3.18970794e+00,   4.05146029e-01,
+             4.05146029e-01,   2.38863487e-01,   1.88056826e+00,
+             1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.66533454e-16,   4.44089210e-16,  -2.78456191e+00,
+             2.78456191e+00,   3.33066907e-16,   1.64170477e+00,
+            -1.64170477e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.33333333e+00,  -3.18970794e+00,  -4.05146029e-01,
+            -4.05146029e-01,  -2.38863487e-01,  -1.88056826e+00,
+            -1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -3.33333333e-01,   5.94853971e-01,   5.94853971e-01,
+            -2.18970794e+00,  -8.80568256e-01,  -8.80568256e-01,
+             7.61136513e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  8.32667268e-17,   2.22044605e-16,  -2.22044605e-16,
+             5.55111512e-17,   1.52655666e-16,  -2.77555756e-16,
+             9.71445147e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  3.33333333e-01,  -5.94853971e-01,   2.18970794e+00,
+            -5.94853971e-01,   8.80568256e-01,  -7.61136513e-01,
+             8.80568256e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.33333333e+00,   3.18970794e+00,   4.05146029e-01,
+             4.05146029e-01,   2.38863487e-01,   1.88056826e+00,
+             1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.66533454e-16,   4.44089210e-16,  -2.78456191e+00,
+             2.78456191e+00,   3.33066907e-16,   1.64170477e+00,
+            -1.64170477e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.33333333e+00,  -3.18970794e+00,  -4.05146029e-01,
+            -4.05146029e-01,  -2.38863487e-01,  -1.88056826e+00,
+            -1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]]]), (1, 0): array([[[ -3.33333333e-01,   5.94853971e-01,   5.94853971e-01,
+            -2.18970794e+00,  -8.80568256e-01,  -8.80568256e-01,
+             7.61136513e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  3.33333333e-01,   2.18970794e+00,  -5.94853971e-01,
+            -5.94853971e-01,  -7.61136513e-01,   8.80568256e-01,
+             8.80568256e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  1.33333333e+00,   4.05146029e-01,   3.18970794e+00,
+             4.05146029e-01,   1.88056826e+00,   2.38863487e-01,
+             1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -1.33333333e+00,  -4.05146029e-01,  -3.18970794e+00,
+            -4.05146029e-01,  -1.88056826e+00,  -2.38863487e-01,
+            -1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[ -2.15331488e-16,  -2.78456191e+00,  -4.37374128e-16,
+             2.78456191e+00,   1.64170477e+00,  -4.36972564e-16,
+            -1.64170477e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -3.33333333e-01,   5.94853971e-01,   5.94853971e-01,
+            -2.18970794e+00,  -8.80568256e-01,  -8.80568256e-01,
+             7.61136513e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  3.33333333e-01,   2.18970794e+00,  -5.94853971e-01,
+            -5.94853971e-01,  -7.61136513e-01,   8.80568256e-01,
+             8.80568256e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.33333333e+00,   4.05146029e-01,   3.18970794e+00,
+             4.05146029e-01,   1.88056826e+00,   2.38863487e-01,
+             1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.33333333e+00,  -4.05146029e-01,  -3.18970794e+00,
+            -4.05146029e-01,  -1.88056826e+00,  -2.38863487e-01,
+            -1.88056826e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -2.15331488e-16,  -2.78456191e+00,  -4.37374128e-16,
+             2.78456191e+00,   1.64170477e+00,  -4.36972564e-16,
+            -1.64170477e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00,
+            -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00,   1.00000000e+00,   1.00000000e+00,
+             1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+             0.00000000e+00]]]), (0, 0): array([[[-0.11111111, -0.08076859, -0.08076859,  0.47435261, -0.02807494,
+           -0.02807494, -0.0525839 ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.11111111,  0.47435261, -0.08076859, -0.08076859, -0.0525839 ,
+           -0.02807494, -0.02807494],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[-0.11111111, -0.08076859,  0.47435261, -0.08076859, -0.02807494,
+           -0.0525839 , -0.02807494],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.44444444,  0.32307438,  0.32307438,  0.04103583,  0.11229977,
+            0.11229977,  0.88413424],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.44444444,  0.04103583,  0.32307438,  0.32307438,  0.88413424,
+            0.11229977,  0.11229977],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.44444444,  0.32307438,  0.04103583,  0.32307438,  0.11229977,
+            0.88413424,  0.11229977],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.11111111, -0.08076859, -0.08076859,  0.47435261, -0.02807494,
+           -0.02807494, -0.0525839 ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.11111111,  0.47435261, -0.08076859, -0.08076859, -0.0525839 ,
+           -0.02807494, -0.02807494],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [-0.11111111, -0.08076859,  0.47435261, -0.08076859, -0.02807494,
+           -0.0525839 , -0.02807494],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.44444444,  0.32307438,  0.32307438,  0.04103583,  0.11229977,
+            0.11229977,  0.88413424],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.44444444,  0.04103583,  0.32307438,  0.32307438,  0.88413424,
+            0.11229977,  0.11229977],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.44444444,  0.32307438,  0.04103583,  0.32307438,  0.11229977,
+            0.88413424,  0.11229977],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.10128651,  0.10128651,  0.79742699,  0.47014206,
+            0.47014206,  0.05971587]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.79742699,  0.10128651,  0.10128651,  0.05971587,
+            0.47014206,  0.47014206]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.33333333,  0.10128651,  0.79742699,  0.10128651,  0.47014206,
+            0.05971587,  0.47014206]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[-0.11111111, -0.11111111, -0.11111111,  0.44444444,  0.44444444,
+           0.44444444,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.08076859,  0.47435261, -0.08076859,  0.32307438,  0.04103583,
+           0.32307438,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.08076859, -0.08076859,  0.47435261,  0.32307438,  0.32307438,
+           0.04103583,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.47435261, -0.08076859, -0.08076859,  0.04103583,  0.32307438,
+           0.32307438,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02807494, -0.0525839 , -0.02807494,  0.11229977,  0.88413424,
+           0.11229977,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02807494, -0.02807494, -0.0525839 ,  0.11229977,  0.11229977,
+           0.88413424,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.0525839 , -0.02807494, -0.02807494,  0.88413424,  0.11229977,
+           0.11229977,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11111111, -0.11111111, -0.11111111,  0.44444444,
+           0.44444444,  0.44444444,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08076859,  0.47435261, -0.08076859,  0.32307438,
+           0.04103583,  0.32307438,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08076859, -0.08076859,  0.47435261,  0.32307438,
+           0.32307438,  0.04103583,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.47435261, -0.08076859, -0.08076859,  0.04103583,
+           0.32307438,  0.32307438,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02807494, -0.0525839 , -0.02807494,  0.11229977,
+           0.88413424,  0.11229977,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02807494, -0.02807494, -0.0525839 ,  0.11229977,
+           0.11229977,  0.88413424,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.0525839 , -0.02807494, -0.02807494,  0.88413424,
+           0.11229977,  0.11229977,  0.        ,  0.        ,  0.        ]]), 'FE1_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.33333333,  0.33333333,  0.33333333],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.10128651,  0.79742699,  0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.10128651,  0.10128651,  0.79742699],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.79742699,  0.10128651,  0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.47014206,  0.05971587,  0.47014206],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.47014206,  0.47014206,  0.05971587],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05971587,  0.47014206,  0.47014206]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -3.33333333e-01,   3.33333333e-01,   0.00000000e+00,
+            1.33333333e+00,  -1.33333333e+00,  -2.15331488e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,   2.18970794e+00,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,  -2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,  -5.94853971e-01,   0.00000000e+00,
+            3.18970794e+00,  -3.18970794e+00,  -4.37374128e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.18970794e+00,  -5.94853971e-01,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,   2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,  -7.61136513e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,   1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,   8.80568256e-01,   0.00000000e+00,
+            2.38863487e-01,  -2.38863487e-01,  -4.36972564e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.61136513e-01,   8.80568256e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,  -1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.]]), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -3.33333333e-01,   8.32667268e-17,   3.33333333e-01,
+            1.33333333e+00,  -1.66533454e-16,  -1.33333333e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,   2.22044605e-16,  -5.94853971e-01,
+            3.18970794e+00,   4.44089210e-16,  -3.18970794e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,  -2.22044605e-16,   2.18970794e+00,
+            4.05146029e-01,  -2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.18970794e+00,   5.55111512e-17,  -5.94853971e-01,
+            4.05146029e-01,   2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,   1.52655666e-16,   8.80568256e-01,
+            2.38863487e-01,   3.33066907e-16,  -2.38863487e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,  -2.77555756e-16,  -7.61136513e-01,
+            1.88056826e+00,   1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.61136513e-01,   9.71445147e-17,   8.80568256e-01,
+            1.88056826e+00,  -1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D01': array([[ -3.33333333e-01,   8.32667268e-17,   3.33333333e-01,
+            1.33333333e+00,  -1.66533454e-16,  -1.33333333e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,   2.22044605e-16,  -5.94853971e-01,
+            3.18970794e+00,   4.44089210e-16,  -3.18970794e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,  -2.22044605e-16,   2.18970794e+00,
+            4.05146029e-01,  -2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.18970794e+00,   5.55111512e-17,  -5.94853971e-01,
+            4.05146029e-01,   2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,   1.52655666e-16,   8.80568256e-01,
+            2.38863487e-01,   3.33066907e-16,  -2.38863487e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,  -2.77555756e-16,  -7.61136513e-01,
+            1.88056826e+00,   1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.61136513e-01,   9.71445147e-17,   8.80568256e-01,
+            1.88056826e+00,  -1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[ -3.33333333e-01,   3.33333333e-01,   0.00000000e+00,
+            1.33333333e+00,  -1.33333333e+00,  -2.15331488e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,   2.18970794e+00,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,  -2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,  -5.94853971e-01,   0.00000000e+00,
+            3.18970794e+00,  -3.18970794e+00,  -4.37374128e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.18970794e+00,  -5.94853971e-01,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,   2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,  -7.61136513e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,   1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,   8.80568256e-01,   0.00000000e+00,
+            2.38863487e-01,  -2.38863487e-01,  -4.36972564e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.61136513e-01,   8.80568256e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,  -1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.79742699,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.10128651,
+           0.79742699],
+         [ 0.        ,  0.        ,  0.        ,  0.79742699,  0.10128651,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.05971587,
+           0.47014206],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.47014206,
+           0.05971587],
+         [ 0.        ,  0.        ,  0.        ,  0.05971587,  0.47014206,
+           0.47014206]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.79742699,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.10128651,  0.79742699,  0.        ,  0.        ,
+           0.        ],
+         [ 0.79742699,  0.10128651,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.05971587,  0.47014206,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.47014206,  0.05971587,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05971587,  0.47014206,  0.47014206,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[-0.11111111, -0.11111111, -0.11111111,  0.44444444,  0.44444444,
+           0.44444444,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.08076859,  0.47435261, -0.08076859,  0.32307438,  0.04103583,
+           0.32307438,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.08076859, -0.08076859,  0.47435261,  0.32307438,  0.32307438,
+           0.04103583,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [ 0.47435261, -0.08076859, -0.08076859,  0.04103583,  0.32307438,
+           0.32307438,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02807494, -0.0525839 , -0.02807494,  0.11229977,  0.88413424,
+           0.11229977,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.02807494, -0.02807494, -0.0525839 ,  0.11229977,  0.11229977,
+           0.88413424,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ],
+         [-0.0525839 , -0.02807494, -0.02807494,  0.88413424,  0.11229977,
+           0.11229977,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.11111111, -0.11111111, -0.11111111,  0.44444444,
+           0.44444444,  0.44444444,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08076859,  0.47435261, -0.08076859,  0.32307438,
+           0.04103583,  0.32307438,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.08076859, -0.08076859,  0.47435261,  0.32307438,
+           0.32307438,  0.04103583,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.47435261, -0.08076859, -0.08076859,  0.04103583,
+           0.32307438,  0.32307438,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02807494, -0.0525839 , -0.02807494,  0.11229977,
+           0.88413424,  0.11229977,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.02807494, -0.02807494, -0.0525839 ,  0.11229977,
+           0.11229977,  0.88413424,  0.        ,  0.        ,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        , -0.0525839 , -0.02807494, -0.02807494,  0.88413424,
+           0.11229977,  0.11229977,  0.        ,  0.        ,  0.        ]]), 'FE1_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.33333333,  0.33333333,  0.33333333],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.10128651,  0.79742699,  0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.10128651,  0.10128651,  0.79742699],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.79742699,  0.10128651,  0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.47014206,  0.05971587,  0.47014206],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.47014206,  0.47014206,  0.05971587],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.05971587,  0.47014206,  0.47014206]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -3.33333333e-01,   3.33333333e-01,   0.00000000e+00,
+            1.33333333e+00,  -1.33333333e+00,  -2.15331488e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,   2.18970794e+00,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,  -2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,  -5.94853971e-01,   0.00000000e+00,
+            3.18970794e+00,  -3.18970794e+00,  -4.37374128e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.18970794e+00,  -5.94853971e-01,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,   2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,  -7.61136513e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,   1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,   8.80568256e-01,   0.00000000e+00,
+            2.38863487e-01,  -2.38863487e-01,  -4.36972564e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.61136513e-01,   8.80568256e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,  -1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C2_D10': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C2_D01': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.],
+         [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,
+           0.,  1.]]), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -3.33333333e-01,   8.32667268e-17,   3.33333333e-01,
+            1.33333333e+00,  -1.66533454e-16,  -1.33333333e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,   2.22044605e-16,  -5.94853971e-01,
+            3.18970794e+00,   4.44089210e-16,  -3.18970794e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.94853971e-01,  -2.22044605e-16,   2.18970794e+00,
+            4.05146029e-01,  -2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.18970794e+00,   5.55111512e-17,  -5.94853971e-01,
+            4.05146029e-01,   2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,   1.52655666e-16,   8.80568256e-01,
+            2.38863487e-01,   3.33066907e-16,  -2.38863487e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.80568256e-01,  -2.77555756e-16,  -7.61136513e-01,
+            1.88056826e+00,   1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.61136513e-01,   9.71445147e-17,   8.80568256e-01,
+            1.88056826e+00,  -1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D01': array([[ -3.33333333e-01,   8.32667268e-17,   3.33333333e-01,
+            1.33333333e+00,  -1.66533454e-16,  -1.33333333e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,   2.22044605e-16,  -5.94853971e-01,
+            3.18970794e+00,   4.44089210e-16,  -3.18970794e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,  -2.22044605e-16,   2.18970794e+00,
+            4.05146029e-01,  -2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.18970794e+00,   5.55111512e-17,  -5.94853971e-01,
+            4.05146029e-01,   2.78456191e+00,  -4.05146029e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,   1.52655666e-16,   8.80568256e-01,
+            2.38863487e-01,   3.33066907e-16,  -2.38863487e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,  -2.77555756e-16,  -7.61136513e-01,
+            1.88056826e+00,   1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.61136513e-01,   9.71445147e-17,   8.80568256e-01,
+            1.88056826e+00,  -1.64170477e+00,  -1.88056826e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[ -3.33333333e-01,   3.33333333e-01,   0.00000000e+00,
+            1.33333333e+00,  -1.33333333e+00,  -2.15331488e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,   2.18970794e+00,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,  -2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.94853971e-01,  -5.94853971e-01,   0.00000000e+00,
+            3.18970794e+00,  -3.18970794e+00,  -4.37374128e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -2.18970794e+00,  -5.94853971e-01,   0.00000000e+00,
+            4.05146029e-01,  -4.05146029e-01,   2.78456191e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,  -7.61136513e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,   1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.80568256e-01,   8.80568256e-01,   0.00000000e+00,
+            2.38863487e-01,  -2.38863487e-01,  -4.36972564e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  7.61136513e-01,   8.80568256e-01,   0.00000000e+00,
+            1.88056826e+00,  -1.88056826e+00,  -1.64170477e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.79742699,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.10128651,  0.10128651,
+           0.79742699],
+         [ 0.        ,  0.        ,  0.        ,  0.79742699,  0.10128651,
+           0.10128651],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.05971587,
+           0.47014206],
+         [ 0.        ,  0.        ,  0.        ,  0.47014206,  0.47014206,
+           0.05971587],
+         [ 0.        ,  0.        ,  0.        ,  0.05971587,  0.47014206,
+           0.47014206]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.79742699,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10128651,  0.10128651,  0.79742699,  0.        ,  0.        ,
+           0.        ],
+         [ 0.79742699,  0.10128651,  0.10128651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.05971587,  0.47014206,  0.        ,  0.        ,
+           0.        ],
+         [ 0.47014206,  0.47014206,  0.05971587,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05971587,  0.47014206,  0.47014206,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C2': 'FE1_C2', 'FE0_C1_D10': 'FE0_C1_D10', 'FE1_C1_D10': 'FE1_C1_D10', 'FE1_C2_D10': 'FE1_C2_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE2': 'FE2', 'FE1_C2_D01': 'FE1_C2_D01', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[-0.11111111, -0.11111111, -0.11111111,  0.44444444,  0.44444444,
+           0.44444444],
+         [-0.08076859,  0.47435261, -0.08076859,  0.32307438,  0.04103583,
+           0.32307438],
+         [-0.08076859, -0.08076859,  0.47435261,  0.32307438,  0.32307438,
+           0.04103583],
+         [ 0.47435261, -0.08076859, -0.08076859,  0.04103583,  0.32307438,
+           0.32307438],
+         [-0.02807494, -0.0525839 , -0.02807494,  0.11229977,  0.88413424,
+           0.11229977],
+         [-0.02807494, -0.02807494, -0.0525839 ,  0.11229977,  0.11229977,
+           0.88413424],
+         [-0.0525839 , -0.02807494, -0.02807494,  0.88413424,  0.11229977,
+           0.11229977]]), 'FE0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE2': array([[1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_C0_D01': array([[-0.33333333,  0.33333333,  1.33333333,  0.        , -1.33333333],
+         [ 0.59485397, -0.59485397,  3.18970794,  0.        , -3.18970794],
+         [ 0.59485397,  2.18970794,  0.40514603, -2.78456191, -0.40514603],
+         [-2.18970794, -0.59485397,  0.40514603,  2.78456191, -0.40514603],
+         [-0.88056826,  0.88056826,  0.23886349,  0.        , -0.23886349],
+         [-0.88056826, -0.76113651,  1.88056826,  1.64170477, -1.88056826],
+         [ 0.76113651,  0.88056826,  1.88056826, -1.64170477, -1.88056826]]), 'FE1_C0_D10': array([[-0.33333333,  0.33333333,  1.33333333, -1.33333333,  0.        ],
+         [ 0.59485397,  2.18970794,  0.40514603, -0.40514603, -2.78456191],
+         [ 0.59485397, -0.59485397,  3.18970794, -3.18970794,  0.        ],
+         [-2.18970794, -0.59485397,  0.40514603, -0.40514603,  2.78456191],
+         [-0.88056826, -0.76113651,  1.88056826, -1.88056826,  1.64170477],
+         [-0.88056826,  0.88056826,  0.23886349, -0.23886349,  0.        ],
+         [ 0.76113651,  0.88056826,  1.88056826, -1.88056826, -1.64170477]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333],
+         [ 0.10128651,  0.79742699,  0.10128651],
+         [ 0.10128651,  0.10128651,  0.79742699],
+         [ 0.79742699,  0.10128651,  0.10128651],
+         [ 0.47014206,  0.05971587,  0.47014206],
+         [ 0.47014206,  0.47014206,  0.05971587],
+         [ 0.05971587,  0.47014206,  0.47014206]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE1_C0': ('FE1_C0', (6, [0, 1, 2, 3, 4, 5]), False, False), 'FE1_C1': ('FE1_C0', (9, [6, 7, 8, 9, 10, 11]), False, False), 'FE1_C2': ('FE0_C0', (12, [12, 13, 14]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE1_C1_D10': ('FE1_C0_D10', (11, [6, 7, 9, 10, 11]), False, False), 'FE1_C2_D10': ('FE0_C0_D01', (14, [12, 13]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE2': ('FE2', (), False, True), 'FE1_C2_D01': ('FE0_C0_D01', (13, [12, 14]), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (10, [6, 8, 9, 10, 11]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (7, [0, 2, 3, 4, 5]), False, False), 'FE1_C0_D10': ('FE1_C0_D10', (8, [0, 1, 3, 4, 5]), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {2: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 0): array([[-2.0816681711721685e-17, 5.5511151231257827e-17],
+         [0.78867513459481287, 0.21132486540518719],
+         [0.21132486540518713, 0.78867513459481287]], dtype=object)}, 1: {(0, 0): array([[0.78867513459481287, 0.21132486540518719],
+         [-2.0816681711721685e-17, 5.5511151231257827e-17],
+         [0.21132486540518713, 0.78867513459481287]], dtype=object)}, 2: {(0, 0): array([[0.78867513459481287, 0.21132486540518716],
+         [0.21132486540518716, 0.78867513459481287],
+         [0.0, 0.0]], dtype=object)}}}, MixedElement(*[VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None), FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None)], **{'value_shape': (3,) }): {None: {0: {(0, 0): array([[[  2.77555756e-17,   4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.55341801e-01,  -1.22008468e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.22008468e-01,   4.55341801e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.66666667e-01,   6.66666667e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.38777878e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.73472348e-17,  -4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  4.55341801e-01,  -1.22008468e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -1.22008468e-01,   4.55341801e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  6.66666667e-01,   6.66666667e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -1.38777878e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -1.73472348e-17,  -4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 1: {(0, 0): array([[[  4.55341801e-01,  -1.22008468e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.08166817e-17,   9.02056208e-17],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.22008468e-01,   4.55341801e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.38777878e-17,  -2.77555756e-17],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.66666667e-01,   6.66666667e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.73472348e-17,  -4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  4.55341801e-01,  -1.22008468e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.08166817e-17,   9.02056208e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -1.22008468e-01,   4.55341801e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -1.38777878e-17,  -2.77555756e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  6.66666667e-01,   6.66666667e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -1.73472348e-17,  -4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 2: {(0, 0): array([[[  4.55341801e-01,  -1.22008468e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.22008468e-01,   4.55341801e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   2.77555756e-17],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.66666667e-01,   6.66666667e-01],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  4.55341801e-01,  -1.22008468e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -1.22008468e-01,   4.55341801e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   2.77555756e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  6.66666667e-01,   6.66666667e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 1: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 2: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ 0.78867513,  0.21132487],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.21132487,  0.78867513],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.78867513,  0.21132487]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.21132487,  0.78867513]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_f0': array([[-2.0816681711721685e-17, 0.78867513459481287, 0.21132486540518713],
+         [5.5511151231257827e-17, 0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f1': array([[0.78867513459481287, -2.0816681711721685e-17, 0.21132486540518713],
+         [0.21132486540518719, 5.5511151231257827e-17, 0.78867513459481287]], dtype=object), 'FE0_f2': array([[0.78867513459481287, 0.21132486540518716, 0.0],
+         [0.21132486540518716, 0.78867513459481287, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.55341801e-01,  -1.22008468e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.22008468e-01,   4.55341801e-01,   0.00000000e+00,
+            2.77555756e-17,  -5.55111512e-17,   6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE2_f0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   4.55341801e-01,  -1.22008468e-01,
+            6.66666667e-01,  -1.38777878e-17,  -1.73472348e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -1.22008468e-01,   4.55341801e-01,
+            6.66666667e-01,  -5.55111512e-17,  -4.16333634e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f0_C0': array([[  2.77555756e-17,   4.55341801e-01,  -1.22008468e-01,
+            6.66666667e-01,  -1.38777878e-17,  -1.73472348e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -1.22008468e-01,   4.55341801e-01,
+            6.66666667e-01,  -5.55111512e-17,  -4.16333634e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_f2_C0': array([[  4.55341801e-01,  -1.22008468e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.22008468e-01,   4.55341801e-01,   0.00000000e+00,
+            2.77555756e-17,  -5.55111512e-17,   6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.78867513,  0.21132487,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.21132487,  0.78867513,  0.        ]]), 'FE2_f1_C0': array([[  4.55341801e-01,   2.08166817e-17,  -1.22008468e-01,
+           -1.38777878e-17,   6.66666667e-01,  -1.73472348e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.22008468e-01,   9.02056208e-17,   4.55341801e-01,
+           -2.77555756e-17,   6.66666667e-01,  -4.16333634e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.55341801e-01,   2.08166817e-17,  -1.22008468e-01,
+           -1.38777878e-17,   6.66666667e-01,  -1.73472348e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.22008468e-01,   9.02056208e-17,   4.55341801e-01,
+           -2.77555756e-17,   6.66666667e-01,  -4.16333634e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[-2.0816681711721685e-17, 0.78867513459481287, 0.21132486540518713],
+         [5.5511151231257827e-17, 0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f1': array([[0.78867513459481287, -2.0816681711721685e-17, 0.21132486540518713],
+         [0.21132486540518719, 5.5511151231257827e-17, 0.78867513459481287]], dtype=object), 'FE0_f2': array([[0.78867513459481287, 0.21132486540518716, 0.0],
+         [0.21132486540518716, 0.78867513459481287, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.55341801e-01,  -1.22008468e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.22008468e-01,   4.55341801e-01,   0.00000000e+00,
+            2.77555756e-17,  -5.55111512e-17,   6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE2_f0_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   4.55341801e-01,  -1.22008468e-01,
+            6.66666667e-01,  -1.38777878e-17,  -1.73472348e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -1.22008468e-01,   4.55341801e-01,
+            6.66666667e-01,  -5.55111512e-17,  -4.16333634e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f0_C0': array([[  2.77555756e-17,   4.55341801e-01,  -1.22008468e-01,
+            6.66666667e-01,  -1.38777878e-17,  -1.73472348e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -1.22008468e-01,   4.55341801e-01,
+            6.66666667e-01,  -5.55111512e-17,  -4.16333634e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f2_C0': array([[  4.55341801e-01,  -1.22008468e-01,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.22008468e-01,   4.55341801e-01,   0.00000000e+00,
+            2.77555756e-17,  -5.55111512e-17,   6.66666667e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f2_C2': array([[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.78867513,  0.21132487,  0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+           0.        ,  0.        ,  0.21132487,  0.78867513,  0.        ]]), 'FE2_f1_C0': array([[  4.55341801e-01,   2.08166817e-17,  -1.22008468e-01,
+           -1.38777878e-17,   6.66666667e-01,  -1.73472348e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.22008468e-01,   9.02056208e-17,   4.55341801e-01,
+           -2.77555756e-17,   6.66666667e-01,  -4.16333634e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.55341801e-01,   2.08166817e-17,  -1.22008468e-01,
+           -1.38777878e-17,   6.66666667e-01,  -1.73472348e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.22008468e-01,   9.02056208e-17,   4.55341801e-01,
+           -2.77555756e-17,   6.66666667e-01,  -4.16333634e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C2': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f2_C1': 'FE1_f2_C1', 'FE2_f0_C2': 'FE2_f0_C2', 'FE2_f0_C1': 'FE2_f0_C1', 'FE2_f0_C0': 'FE2_f0_C0', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE2_f2_C1': 'FE2_f2_C1', 'FE2_f2_C0': 'FE2_f2_C0', 'FE2_f2_C2': 'FE2_f2_C2', 'FE2_f1_C0': 'FE2_f1_C0', 'FE2_f1_C1': 'FE2_f1_C1', 'FE2_f1_C2': 'FE2_f1_C2', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C0': 'FE1_f1_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.78867513459481287, 0.21132486540518713],
+         [0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE2_f0_C0': array([[ 0.4553418 , -0.12200847,  0.66666667],
+         [-0.12200847,  0.4553418 ,  0.66666667]]), 'FE1_f0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE1_f1_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (2, [0, 1]), False, False), 'FE1_f0_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f2_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f2_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f2_C0': ('FE0_f0', (11, [0, 1]), False, False), 'FE1_f2_C1': ('FE0_f0', (12, [3, 4]), False, False), 'FE2_f0_C2': ('FE0_f0', (15, [13, 14]), False, False), 'FE2_f0_C1': ('FE2_f0_C0', (14, [7, 8, 9]), False, False), 'FE2_f0_C0': ('FE2_f0_C0', (13, [1, 2, 3]), False, False), 'FE1_f2_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (1, [0, 2]), False, False), 'FE1_f0_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (3, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (6, [4, 5]), False, False), 'FE1_f2_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f0_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f1_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE2_f2_C1': ('FE2_f0_C0', (20, [6, 7, 11]), False, False), 'FE2_f2_C0': ('FE2_f0_C0', (19, [0, 1, 5]), False, False), 'FE2_f2_C2': ('FE0_f0', (21, [12, 13]), False, False), 'FE2_f1_C0': ('FE2_f0_C0', (16, [0, 2, 4]), False, False), 'FE2_f1_C1': ('FE2_f0_C0', (17, [6, 8, 10]), False, False), 'FE2_f1_C2': ('FE0_f0', (18, [12, 14]), False, False), 'FE1_f0_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f1_C1': ('FE0_f0', (10, [3, 5]), False, False), 'FE1_f1_C0': ('FE0_f0', (9, [0, 2]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  15 entries computed in 0.00195 seconds
+  Shape of reference tensor: (15,)
+  Primary multi index:   rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  15 entries computed in 0.00188 seconds
+  Shape of reference tensor: (15,)
+  Primary multi index:   rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  15 entries computed in 0.00185 seconds
+  Shape of reference tensor: (15,)
+  Primary multi index:   rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [15] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 10.3426 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.048826 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 14 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 14 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Removing unused variable: n1
+  Removing unused variable: n0
+  Removing unused variable: direction
+  Removing unused variable: det
+  Removing unused variable: dx1
+  Removing unused variable: dx0
+  Removing unused variable: v1
+  Removing unused variable: v0
+  Removing unused variable: edge_vertices
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Generating code for forms
+  
+Compiler stage 4 finished in 3.10373 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00614905 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./AdaptiveNavierStokes.h.
+  
+Compiler stage 5 finished in 0.00775599 seconds.
+
+FFC finished in 13.7807 seconds.
diff --git a/demo/undocumented/auto-adaptive-navier-stokes/cpp/main.cpp b/demo/undocumented/auto-adaptive-navier-stokes/cpp/main.cpp
new file mode 100644
index 0000000..d9473b4
--- /dev/null
+++ b/demo/undocumented/auto-adaptive-navier-stokes/cpp/main.cpp
@@ -0,0 +1,130 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2010-08-19
+// Last changed: 2012-07-05
+
+#include <dolfin.h>
+#include "AdaptiveNavierStokes.h"
+
+using namespace dolfin;
+
+// No-slip boundary
+class Noslip : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return ((x[1] < DOLFIN_EPS || x[1] > 1.0 - DOLFIN_EPS) ||
+            (on_boundary && abs(x[0] - 1.5) < 0.1 + DOLFIN_EPS));
+  }
+};
+
+// Subdomain on which goal function should be defined
+class Outflow : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return x[0] > 4.0 - DOLFIN_EPS;
+  }
+};
+
+// Applied pressure (Neumann boundary condition)
+class Pressure : public Expression
+{
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = (4.0 - x[0])/4.0;
+  }
+};
+
+int main()
+{
+  parameters["allow_extrapolation"] = true;
+
+  // Create mesh and function space
+  Mesh mesh("../channel_with_flap.xml.gz");
+  AdaptiveNavierStokes::BilinearForm::TrialSpace W(mesh);
+
+  // Unknown
+  Function w(W);
+
+  // Define boundary condition
+  Constant u0(0.0, 0.0);
+  Noslip noslip;
+  MeshFunction<std::size_t> noslip_markers(mesh, mesh.topology().dim() - 1, 1);
+  noslip.mark(noslip_markers, 0);
+  SubSpace W0(W, 0);
+  DirichletBC bc(W0, u0, noslip_markers, 0);
+
+  // Create variational formulation and assign coefficients
+  Constant nu(0.02);
+  AdaptiveNavierStokes::LinearForm F(W);
+  Pressure p0;
+  F.p0 = p0;
+  F.nu = nu;
+  F.w = w;
+
+  // Initialize Jacobian dF
+  AdaptiveNavierStokes::BilinearForm dF(W, W);
+  dF.nu = nu;
+  dF.w = w;
+
+  // Define goal functional
+  AdaptiveNavierStokes::GoalFunctional M(mesh);
+  M.w = w;
+  Outflow outflow;
+  MeshFunction<std::size_t> outflow_markers(mesh, mesh.topology().dim()-1, 1);
+  outflow.mark(outflow_markers, 0);
+  M.ds = outflow_markers;
+
+  // Define error tolerance
+  double tol = 1.e-5;
+
+  // If no more control is wanted, do:
+  // solve(F == 0, w, bc, dF, tol, M);
+  // return 0;
+
+  // Define variational problem from the variational form F, specify
+  // the unknown Function w and the boundary condition bc
+  NonlinearVariationalProblem pde(F, w, bc, dF);
+
+  // Define solver
+  AdaptiveNonlinearVariationalSolver solver(pde, M);
+
+  // Set (precomputed) reference in adaptive solver to evaluate
+  // quality of error estimates and adaptive refinement
+  solver.parameters["reference"] = 0.40863917;
+
+  // Solve problem with goal-oriented error control to given tolerance
+  solver.solve(tol);
+
+  // Show solver summary
+  solver.summary();
+
+  // Show all timings
+  list_timings();
+
+  // Plot solutions
+  Function solution = w.leaf_node();
+  plot(solution[0], "Velocity on finest mesh");
+  plot(solution[1], "Pressure on finest mesh");
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/auto-adaptive-navier-stokes/python/demo_auto-adaptive-navier-stokes.py b/demo/undocumented/auto-adaptive-navier-stokes/python/demo_auto-adaptive-navier-stokes.py
new file mode 100644
index 0000000..c1c06d1
--- /dev/null
+++ b/demo/undocumented/auto-adaptive-navier-stokes/python/demo_auto-adaptive-navier-stokes.py
@@ -0,0 +1,115 @@
+# Copyright (C) 2010 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2010
+# Last changed: 2011-10-04
+
+from dolfin import *
+import time
+
+class Noslip(SubDomain):
+    def inside(self, x, on_boundary):
+        return (x[1] < DOLFIN_EPS or x[1] > 1.0 - DOLFIN_EPS) or \
+               (on_boundary and abs(x[0] - 1.5) < 0.1 + DOLFIN_EPS)
+
+class Outflow(SubDomain):
+    def inside(self, x, on_boundary):
+        return x[0] > 4.0 - DOLFIN_EPS
+
+# Use compiler optimizations
+parameters["form_compiler"]["cpp_optimize"] = True
+
+# Allow approximating values for points that may be generated outside
+# of domain (because of numerical inaccuracies)
+parameters["allow_extrapolation"] = True
+
+# Material parameters
+nu = Constant(0.02)
+
+# Mesh
+mesh = Mesh("../channel_with_flap.xml.gz")
+
+# Define function spaces (Taylor-Hood)
+V = VectorFunctionSpace(mesh, "CG", 2)
+Q = FunctionSpace(mesh, "CG", 1)
+W = V * Q
+
+# Define unknown and test function(s)
+(v, q) = TestFunctions(W)
+w = Function(W)
+(u, p) = (as_vector((w[0], w[1])), w[2])
+
+# Prescribed pressure
+p0 = Expression("(4.0 - x[0])/4.0")
+
+# Define variational forms
+n = FacetNormal(mesh)
+a = (nu*inner(grad(u), grad(v)) - div(v)*p + q*div(u))*dx()
+a = a + inner(grad(u)*u, v)*dx()
+L = - p0*dot(v, n)*ds()
+F = a - L
+
+# Define boundary conditions
+bc = DirichletBC(W.sub(0), Constant((0.0, 0.0)), Noslip())
+
+# Create boundary subdomains
+outflow = Outflow()
+outflow_markers = MeshFunction("size_t", mesh, mesh.topology().dim() - 1)
+outflow_markers.set_all(1)
+outflow.mark(outflow_markers, 0)
+
+# Define new measure with associated subdomains
+ds = Measure("ds")[outflow_markers]
+
+# Define goal
+M = u[0]*ds(0)
+
+# Define error tolerance (with respect to goal)
+tol = 1.e-05
+
+# If no more control is wanted, do:
+# solve(F == 0, w, bc, tol=tol, M=M)
+
+# Compute Jacobian form
+J = derivative(F, w)
+
+# Define variational problem
+pde = NonlinearVariationalProblem(F, w, bc, J)
+
+# Define solver
+solver = AdaptiveNonlinearVariationalSolver(pde, M)
+
+# Set reference value
+solver.parameters["reference"] = 0.40863917;
+
+# Solve to given tolerance
+solver.solve(tol)
+
+# Show solver summary
+solver.summary();
+
+# Show all timings
+list_timings()
+
+# Extract solutions on coarsest and finest mesh:
+(u0, p0) = w.root_node().split()
+(u1, p1) = w.leaf_node().split()
+plot(p0, title="Pressure on initial mesh")
+plot(p1, title="Pressure on final mesh")
+interactive()
diff --git a/demo/undocumented/block-matrix/cpp/CMakeLists.txt b/demo/undocumented/block-matrix/cpp/CMakeLists.txt
new file mode 100644
index 0000000..720145f
--- /dev/null
+++ b/demo/undocumented/block-matrix/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_block-matrix)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/block-matrix/cpp/StiffnessMatrix.h b/demo/undocumented/block-matrix/cpp/StiffnessMatrix.h
new file mode 100644
index 0000000..d283646
--- /dev/null
+++ b/demo/undocumented/block-matrix/cpp/StiffnessMatrix.h
@@ -0,0 +1,2121 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __STIFFNESSMATRIX_H
+#define __STIFFNESSMATRIX_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class stiffnessmatrix_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new stiffnessmatrix_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class stiffnessmatrix_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new stiffnessmatrix_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stiffnessmatrix_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class stiffnessmatrix_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W6[6] = {0.054975871827661, 0.054975871827661, 0.054975871827661, 0.111690794839005, 0.111690794839005, 0.111690794839005};
+    // Quadrature points on the UFC reference element: (0.816847572980459, 0.091576213509771), (0.091576213509771, 0.816847572980459), (0.091576213509771, 0.091576213509771), (0.10810301816807, 0.445948490915965), (0.445948490915965, 0.10810301816807), (0.445948490915965, 0.445948490915965)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[6][3] = \
+    {{0.09157621350977, 0.816847572980459, 0.091576213509771},
+    {0.0915762135097701, 0.0915762135097711, 0.816847572980459},
+    {0.816847572980458, 0.091576213509771, 0.091576213509771},
+    {0.445948490915965, 0.10810301816807, 0.445948490915965},
+    {0.445948490915965, 0.445948490915965, 0.10810301816807},
+    {0.10810301816807, 0.445948490915965, 0.445948490915965}};
+    
+    static const double FEA6_f0[6][3] = \
+    {{0.09157621350977, 0.816847572980459, 0.091576213509771},
+    {0.0915762135097701, 0.091576213509771, 0.816847572980459},
+    {0.816847572980458, 0.091576213509771, 0.091576213509771},
+    {0.445948490915965, 0.10810301816807, 0.445948490915965},
+    {0.445948490915965, 0.445948490915965, 0.10810301816807},
+    {0.10810301816807, 0.445948490915965, 0.445948490915965}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    
+    // Declare array to hold physical coordinate of quadrature point.
+    double X6[2];
+    // Number of operations to compute element tensor for following IP loop = 114
+    for (unsigned int ip = 0; ip < 6; ip++)
+    {
+      
+      // Compute physical coordinate of quadrature point, operations: 10.
+      X6[0] = FEA6_f0[ip][0]*vertex_coordinates[0] +                  FEA6_f0[ip][1]*vertex_coordinates[2] + FEA6_f0[ip][2]*vertex_coordinates[4];
+      X6[1] = FEA6_f0[ip][0]*vertex_coordinates[1] +                  FEA6_f0[ip][1]*vertex_coordinates[3] + FEA6_f0[ip][2]*vertex_coordinates[5];
+      
+      // Number of operations to compute ip constants: 3
+      double I[1];
+      // Number of operations: 3
+      I[0] = W6[ip]*det*std::sin(X6[0]);
+      
+      
+      // Number of operations for primary indices: 6
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[j] += FE0[ip][j]*I[0];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stiffnessmatrix_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stiffnessmatrix_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new stiffnessmatrix_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stiffnessmatrix_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new stiffnessmatrix_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stiffnessmatrix_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class stiffnessmatrix_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  stiffnessmatrix_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~stiffnessmatrix_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "56a4d96f30eed1418dd0bce6e6f2260bdc873ed65994e37c6b86cb669a9ea5e1b490f8e030c5c21578462a12ef579ef6603f936fd240b46f0923f1c3993bf793";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stiffnessmatrix_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new stiffnessmatrix_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new stiffnessmatrix_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace StiffnessMatrix
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stiffnessmatrix_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stiffnessmatrix_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new stiffnessmatrix_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new stiffnessmatrix_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stiffnessmatrix_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new stiffnessmatrix_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/block-matrix/cpp/StiffnessMatrix.ufl b/demo/undocumented/block-matrix/cpp/StiffnessMatrix.ufl
new file mode 100644
index 0000000..f2ca796
--- /dev/null
+++ b/demo/undocumented/block-matrix/cpp/StiffnessMatrix.ufl
@@ -0,0 +1,31 @@
+# Copyright (c) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005-06-05
+# Last changed: 2011-03-09
+#
+# The bilinear form for a stiffness matrix (Poisson).
+
+element = FiniteElement("Lagrange", triangle, 1)
+
+x = SpatialCoordinate(triangle)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+
+a = dot(grad(u), grad(v))*dx
+L = sin(x[0])*v*dx
diff --git a/demo/undocumented/block-matrix/cpp/compile.log b/demo/undocumented/block-matrix/cpp/compile.log
new file mode 100644
index 0000000..3126ba6
--- /dev/null
+++ b/demo/undocumented/block-matrix/cpp/compile.log
@@ -0,0 +1,356 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form StiffnessMatrix
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal SpatialCoordinate.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0186269 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000813 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {6: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {None: {(0, 0): array([[0.091576213509770035, 0.091576213509770077, 0.81684757298045807,
+          0.44594849091596506, 0.445948490915965, 0.10810301816807004],
+         [0.81684757298045907, 0.091576213509771076, 0.091576213509770979,
+          0.10810301816807004, 0.445948490915965, 0.44594849091596506],
+         [0.091576213509770993, 0.81684757298045896, 0.091576213509770993,
+          0.445948490915965, 0.10810301816807, 0.445948490915965]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[0.091576213509770035, 0.81684757298045907, 0.091576213509770993],
+         [0.091576213509770077, 0.091576213509771076, 0.81684757298045896],
+         [0.81684757298045807, 0.091576213509770979, 0.091576213509770993],
+         [0.44594849091596506, 0.10810301816807004, 0.445948490915965],
+         [0.445948490915965, 0.445948490915965, 0.10810301816807],
+         [0.10810301816807004, 0.44594849091596506, 0.445948490915965]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE1_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[0.091576213509770035, 0.81684757298045907, 0.091576213509770993],
+         [0.091576213509770077, 0.091576213509771076, 0.81684757298045896],
+         [0.81684757298045807, 0.091576213509770979, 0.091576213509770993],
+         [0.44594849091596506, 0.10810301816807004, 0.445948490915965],
+         [0.445948490915965, 0.445948490915965, 0.10810301816807],
+         [0.10810301816807004, 0.44594849091596506, 0.445948490915965]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0': array([[0.091576213509770035, 0.81684757298045907, 0.091576213509770993],
+         [0.091576213509770077, 0.091576213509771076, 0.81684757298045896],
+         [0.81684757298045807, 0.091576213509770979, 0.091576213509770993],
+         [0.44594849091596506, 0.10810301816807004, 0.445948490915965],
+         [0.445948490915965, 0.445948490915965, 0.10810301816807],
+         [0.10810301816807004, 0.44594849091596506, 0.445948490915965]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE1_C0': ('FE0', (0, [0, 1, 2]), False, False), 'FE1_C1': ('FE0', (3, [3, 4, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (5, [3, 4]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (4, [3, 5]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (2, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.064954 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.000379086 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.042393 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000421047 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./StiffnessMatrix.h.
+  
+Compiler stage 5 finished in 0.000554085 seconds.
+
+FFC finished in 0.127653 seconds.
diff --git a/demo/undocumented/block-matrix/cpp/main.cpp b/demo/undocumented/block-matrix/cpp/main.cpp
new file mode 100644
index 0000000..b216fb5
--- /dev/null
+++ b/demo/undocumented/block-matrix/cpp/main.cpp
@@ -0,0 +1,69 @@
+// Copyright (C) 2008 Kent-Andre Mardal
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008.
+// Modified by Garth N. Wells, 2010-2011.
+//
+// First added:  2008-12-12
+// Last changed: 2012-11-12
+//
+// This demo illustrates basic usage of block matrices and vectors.
+
+#include <dolfin.h>
+#include "StiffnessMatrix.h"
+
+using namespace dolfin;
+
+int main()
+{
+  // Create mesh
+  UnitSquareMesh mesh(32, 32);
+
+  // Create a simple stiffness matrix and vector
+  StiffnessMatrix::FunctionSpace V(mesh);
+
+  StiffnessMatrix::BilinearForm a(V, V);
+  std::shared_ptr<GenericMatrix> A(new Matrix);
+  assemble(*A, a);
+
+  StiffnessMatrix::LinearForm L(V);
+  std::shared_ptr<GenericVector> x(new Vector);
+  assemble(*x, L);
+
+  // Create a block matrix
+  BlockMatrix AA(2, 2);
+  AA.set_block(0, 0, A);
+  AA.set_block(1, 0, A);
+  AA.set_block(0, 1, A);
+  AA.set_block(1, 1, A);
+
+  // Create block vector
+  BlockVector xx(2);
+  xx.set_block(0, x);
+  xx.set_block(1, x);
+
+  // Create another block vector
+  std::shared_ptr<GenericVector> y(new Vector);
+  A->init_vector(*y, 0);
+  BlockVector yy(2);
+  yy.set_block(0, y);
+  yy.set_block(1, y);
+
+  // Multiply
+  AA.mult(xx, yy);
+  info("||Ax|| = %g", y->norm("l2"));
+}
diff --git a/demo/undocumented/block-matrix/python/demo_block-matrix.py b/demo/undocumented/block-matrix/python/demo_block-matrix.py
new file mode 100644
index 0000000..9fddb81
--- /dev/null
+++ b/demo/undocumented/block-matrix/python/demo_block-matrix.py
@@ -0,0 +1,59 @@
+"""This demo illustrates basic usage of block matrices and vectors."""
+
+# Copyright (C) 2008 Kent-Andre Mardal
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+#
+# First added:  2008-12-12
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create a simple stiffness matrix and vector
+mesh = UnitSquareMesh(32, 32)
+V = FunctionSpace(mesh, "CG", 1)
+u = TrialFunction(V)
+v = TestFunction(V)
+a = dot(grad(u), grad(v))*dx
+A = assemble(a)
+x0 = SpatialCoordinate(mesh)[0]
+L = sin(x0)*v*dx
+x = assemble(L)
+
+# Create a block matrix
+AA = BlockMatrix(2, 2)
+AA[0, 0] = A
+AA[1, 0] = A
+AA[0, 1] = A
+AA[1, 1] = A
+
+# Create a block vector (that is compatible with A in parallel)
+xx = BlockVector(2)
+xx[0] = x
+xx[1] = x
+
+# Create a another block vector (that is compatible with A in parallel)
+y = Vector()
+A.init_vector(y, 0)
+yy = BlockVector(2)
+yy[0] = y
+yy[1] = y
+
+# Multiply
+AA.mult(xx, yy)
+print "||Ax|| =", y.norm("l2")
diff --git a/demo/undocumented/built-in/cpp/CMakeLists.txt b/demo/undocumented/built-in/cpp/CMakeLists.txt
new file mode 100644
index 0000000..f239470
--- /dev/null
+++ b/demo/undocumented/built-in/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_built-in)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/built-in/cpp/main.cpp b/demo/undocumented/built-in/cpp/main.cpp
new file mode 100644
index 0000000..f2970b0
--- /dev/null
+++ b/demo/undocumented/built-in/cpp/main.cpp
@@ -0,0 +1,74 @@
+// Copyright (C) 2009 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-29
+// Last changed: 2013-11-11
+//
+// This demo illustrates the built-in mesh types.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  UnitIntervalMesh interval(20);
+  info("Plotting a UnitIntervalMesh");
+  plot(interval, "Unit interval");
+
+  UnitSquareMesh square_default(10, 10);
+  info("Plotting a UnitSquareMesh");
+  plot(square_default, "Unit square");
+
+  UnitSquareMesh square_left(10, 10, "left");
+  info("Plotting a UnitSquareMesh");
+  plot(square_left, "Unit square (left)");
+
+  UnitSquareMesh square_crossed(10, 10, "crossed");
+  info("Plotting a UnitSquareMesh");
+  plot(square_crossed, "Unit square (crossed)");
+
+  UnitSquareMesh square_right_left(10, 10, "right/left");
+  info("Plotting a UnitSquareMesh");
+  plot(square_right_left, "Unit square (right/left)");
+
+  RectangleMesh rectangle_default(0.0, 0.0, 10.0, 4.0, 10, 10);
+  info("Plotting a RectangleMesh");
+  plot(rectangle_default, "Rectangle");
+
+  RectangleMesh rectangle_right_left(-3.0, 2.0, 7.0, 6.0, 10, 10, "right/left");
+  info("Plotting a RectangleMesh");
+  plot(rectangle_right_left, "Rectangle (right/left)");
+
+#ifdef HAS_CGAL
+  CircleMesh circle_rotsumn(Point(0.0, 0.0), 1.0, 1.0/20);
+  info("Plotting a CircleMesh");
+  plot(circle_rotsumn, "Unit circle");
+#endif
+
+  UnitCubeMesh cube(10, 10, 10);
+  info("Plotting a UnitCubeMesh");
+  plot(cube, "Unit cube");
+
+  BoxMesh box(0.0, 0.0, 0.0, 10.0, 4.0, 2.0, 10, 10, 10);
+  info("Plotting a BoxMesh");
+  plot(box, "Box");
+
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/built-in/python/demo_built-in.py b/demo/undocumented/built-in/python/demo_built-in.py
new file mode 100644
index 0000000..d7a3d61
--- /dev/null
+++ b/demo/undocumented/built-in/python/demo_built-in.py
@@ -0,0 +1,69 @@
+"""This demo illustrates the built-in mesh types."""
+
+# Copyright (C) 2008 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+# Modified by Benjamin Kehlet 2012
+#
+# First added:  2008-07-11
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+mesh = UnitIntervalMesh(10)
+print "Plotting a UnitIntervalMesh"
+plot(mesh, title="Unit interval")
+
+mesh = UnitSquareMesh(10, 10)
+print "Plotting a UnitSquareMesh"
+plot(mesh, title="Unit square")
+
+mesh = UnitSquareMesh(10, 10, "left")
+print "Plotting a UnitSquareMesh"
+plot(mesh, title="Unit square (left)")
+
+mesh = UnitSquareMesh(10, 10, "crossed")
+print "Plotting a UnitSquareMesh"
+plot(mesh, title="Unit square (crossed)")
+
+mesh = UnitSquareMesh(10, 10, "right/left")
+print "Plotting a UnitSquareMesh"
+plot(mesh, title="Unit square (right/left)")
+
+mesh = RectangleMesh(0.0, 0.0, 10.0, 4.0, 10, 10)
+print "Plotting a RectangleMesh"
+plot(mesh, title="Rectangle")
+
+mesh = RectangleMesh(-3.0, 2.0, 7.0, 6.0, 10, 10, "right/left")
+print "Plotting a RectangleMesh"
+plot(mesh, title="Rectangle (right/left)")
+
+if has_cgal():
+    mesh = CircleMesh(Point(0.0, 0.0), 1.0, 1.0/20.0)
+    print "Plotting a CircleMesh"
+    plot(mesh, title="Unit circle")
+
+mesh = UnitCubeMesh(10, 10, 10)
+print "Plotting a UnitCubeMesh"
+plot(mesh, title="Unit cube")
+
+mesh = BoxMesh(0.0, 0.0, 0.0, 10.0, 4.0, 2.0, 10, 10, 10)
+print "Plotting a BoxMesh"
+plot(mesh, title="Box")
+
+interactive()
diff --git a/demo/undocumented/collision-detection/python/demo_collision-detection.py b/demo/undocumented/collision-detection/python/demo_collision-detection.py
new file mode 100644
index 0000000..c317478
--- /dev/null
+++ b/demo/undocumented/collision-detection/python/demo_collision-detection.py
@@ -0,0 +1,98 @@
+# Copyright (C) 2013 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-09-02
+# Last changed: 2014-01-07
+
+from dolfin import *
+
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+# Some parameters
+L = 10.0
+h = 0.1
+M = 64
+N = 32
+num_steps = 1000
+(x_B, y_B) = (0.75*L, 0.5*L)
+(x_C, y_C) = (0.33*L, 0.75*L)
+(dx_B, dy_B) = (2*h, h)
+(dx_C, dy_C) = (h, 2*h)
+
+# Create meshes: a box and two circles
+mesh_A = RectangleMesh(0, 0, L, L, M, M)
+mesh_B = CircleMesh(Point(0.0, 0.0), 1.0, 1.0/N)
+mesh_C = CircleMesh(Point(0.0, 0.0), 1.0, 1.0/N)
+
+# Displace circles to initial positions
+mesh_B.translate(Point(x_B, y_B))
+mesh_C.translate(Point(x_C, y_C))
+
+# Create mesh function for plotting
+f = CellFunction("uint", mesh_A)
+
+# Build bounding box trees for background mesh
+tree_A = BoundingBoxTree()
+tree_A.build(mesh_A)
+
+# Create bounding box trees for circles
+tree_B = BoundingBoxTree()
+tree_C = BoundingBoxTree()
+
+# Loop over time steps
+for n in range(num_steps):
+
+    # Make it bounce
+    x_B += dx_B; y_B += dy_B
+    x_C += dx_C; y_C += dy_C
+    if x_B > L - 1.0 or x_B < 1.0: dx_B = -dx_B
+    if y_B > L - 1.0 or y_B < 1.0: dy_B = -dy_B
+    if x_C > L - 1.0 or x_C < 1.0: dx_C = -dx_C
+    if y_C > L - 1.0 or y_C < 1.0: dy_C = -dy_C
+
+    # Translate circles
+    mesh_B.translate(Point(dx_B, dy_B))
+    mesh_C.translate(Point(dx_C, dy_C))
+
+    # Rebuild trees
+    tree_B.build(mesh_B)
+    tree_C.build(mesh_C)
+
+    # Compute collisions
+    entities_AB, entities_B = tree_A.compute_collisions(tree_B)
+    entities_AC, entities_C = tree_A.compute_collisions(tree_C)
+    entities_BC = set(entities_AB).intersection(set(entities_AC))
+
+    # Mark mesh function
+    f.set_all(0)
+    for i in entities_AB:
+        f.set_value(i, 1)
+    for i in entities_AC:
+        f.set_value(i, 2)
+    for i in entities_BC:
+        f.set_value(i, 3)
+
+    # Plot
+    p = plot(f, wireframe=(n > num_steps / 2))
+    #p.write_png("collision-detection-%.4d" % n)
+
+interactive()
+
+# Generate movie using
+# ffmpeg -r 25 -b 1800 -i collision-detection-%04d.png collision-detection.mp4
diff --git a/demo/undocumented/coloring/cpp/CMakeLists.txt b/demo/undocumented/coloring/cpp/CMakeLists.txt
new file mode 100644
index 0000000..cacc5c8
--- /dev/null
+++ b/demo/undocumented/coloring/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_coloring)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/coloring/cpp/main.cpp b/demo/undocumented/coloring/cpp/main.cpp
new file mode 100644
index 0000000..6a5692a
--- /dev/null
+++ b/demo/undocumented/coloring/cpp/main.cpp
@@ -0,0 +1,66 @@
+// Copyright (C) 2010-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010.
+//
+// First added:  2010-11-16
+// Last changed: 2012-11-12
+//
+// This demo colors a given mesh entities such that entities with the
+// same color are not neighbors. 'Neighbors' can be in the sense of shared
+// vertices, edges or facets, or a user-provided tuple defintion.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  // Create mesh
+  UnitCubeMesh mesh(24, 24, 24);
+
+  // Compute vertex-based coloring
+  mesh.color("vertex");
+  const MeshFunction<std::size_t> colors_vertex = MeshColoring::cell_colors(mesh, "vertex");
+  plot(colors_vertex, "Vertex-based cell coloring");
+
+  // Compute edge-based coloring
+  mesh.color("edge");
+  const CellFunction<std::size_t> colors_edge = MeshColoring::cell_colors(mesh, "edge");
+  plot(colors_edge, "Edge-based cell coloring");
+
+  // Compute facet-based coloring
+  mesh.color("facet");
+  const CellFunction<std::size_t> colors_facet = MeshColoring::cell_colors(mesh, "facet");
+  plot(colors_facet, "Facet-based cell coloring");
+
+  // Compute facet-based coloring with distance 2
+  std::vector<std::size_t> coloring_type;
+  coloring_type.push_back(mesh.topology().dim());
+  coloring_type.push_back(mesh.topology().dim() - 1);
+  coloring_type.push_back(mesh.topology().dim());
+  coloring_type.push_back(mesh.topology().dim() - 1);
+  coloring_type.push_back(mesh.topology().dim());
+  mesh.color(coloring_type);
+  const CellFunction<std::size_t> colors_vertex_2
+      = MeshColoring::cell_colors(mesh, coloring_type);
+  plot(colors_vertex_2, "Facet-based cell coloring with distance 2");
+
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/coloring/python/demo_coloring.py b/demo/undocumented/coloring/python/demo_coloring.py
new file mode 100644
index 0000000..c0668ad
--- /dev/null
+++ b/demo/undocumented/coloring/python/demo_coloring.py
@@ -0,0 +1,52 @@
+"""This demo colors a given mesh entities such that entities with the
+same color are not neighbors. 'Neighbors' can be in the sense of shared
+vertices, edges or facets, or a user-provided tuple defintion"""
+
+# Copyright (C) 2010-2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2010.
+#
+# First added:  2010-11-16
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh
+mesh = UnitCubeMesh(24, 24, 24)
+
+# Compute vertex-based coloring
+mesh.color("vertex");
+colors = MeshColoring.cell_colors(mesh, "vertex")
+plot(colors, title="Vertex-based cell coloring", interactive=True)
+
+# Compute edge-based coloring
+mesh.color("edge");
+colors = MeshColoring.cell_colors(mesh, "edge")
+plot(colors, title="Edge-based cell coloring", interactive=True)
+
+# Compute facet-based coloring
+mesh.color("facet");
+colors = MeshColoring.cell_colors(mesh, "facet")
+plot(colors, title="Facet-based cell coloring", interactive=True)
+
+# Compute facet-based coloring with distance 2
+dim = mesh.topology().dim()
+coloring_type = (dim, dim - 1, dim, dim - 1, dim)
+mesh.color(coloring_type);
+colors = MeshColoring.cell_colors(mesh, coloring_type)
+plot(colors, title="Facet-based cell coloring with distance 2", interactive=True)
diff --git a/demo/undocumented/compiled-extension-module/cpp/README b/demo/undocumented/compiled-extension-module/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/undocumented/compiled-extension-module/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/compiled-extension-module/python/Probe/Probe.cpp b/demo/undocumented/compiled-extension-module/python/Probe/Probe.cpp
new file mode 100644
index 0000000..8f58e0e
--- /dev/null
+++ b/demo/undocumented/compiled-extension-module/python/Probe/Probe.cpp
@@ -0,0 +1,138 @@
+// Copyright (C) 2013 Kent-Andre Mardal, Mikael Mortensen, Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-02
+
+#include <dolfin/common/Array.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/geometry/BoundingBoxTree.h>
+#include <dolfin/mesh/Cell.h>
+#include "Probe.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+Probe::Probe(const Array<double>& x, const FunctionSpace& V)
+  : _element(V.element())
+{
+  const Mesh& mesh = *V.mesh();
+  const std::size_t gdim = mesh.geometry().dim();
+
+  // Store position of probe
+  for (std::size_t i = 0; i < 3; i++)
+    _x[i] = (i < gdim ? x[i] : 0.0);
+
+  // Compute in tensor (one for scalar function, . . .)
+  value_size_loc = 1;
+  for (uint i = 0; i < _element->value_rank(); i++)
+    value_size_loc *= _element->value_dimension(i);
+
+  _probes.resize(value_size_loc);
+
+  // Find the cell that contains probe
+  const Point point(gdim, x.data());
+  std::shared_ptr<BoundingBoxTree> tree = mesh.bounding_box_tree();
+  const unsigned int id = tree->compute_first_entity_collision(point);
+
+  // If the cell is on this process, then create an instance
+  // of the Probe class. Otherwise raise a dolfin_error.
+  if (id != std::numeric_limits<unsigned int>::max())
+  {
+    // Create cell that contains point
+    dolfin_cell.reset(new Cell(mesh, id));
+    dolfin_cell->get_cell_data(ufc_cell);
+    dolfin_cell->get_vertex_coordinates(_vertex_coordinates);
+
+    // Create work vector for basis
+    std::vector<double> basis(value_size_loc);
+
+    _coefficients.resize(_element->space_dimension());
+
+    // Create work vector for basis
+    _basis_matrix.resize(value_size_loc);
+    for (std::size_t i = 0; i < value_size_loc; ++i)
+      _basis_matrix[i].resize(_element->space_dimension());
+
+    for (std::size_t i = 0; i < _element->space_dimension(); ++i)
+    {
+      _element->evaluate_basis(i, basis.data(), x.data(),
+                               _vertex_coordinates.data(),
+                               dolfin_cell->orientation());
+      for (std::size_t j = 0; j < value_size_loc; ++j)
+        _basis_matrix[j][i] = basis[j];
+    }
+  }
+  else
+    dolfin_error("Probe.cpp","set probe","Probe is not found on processor");
+}
+//----------------------------------------------------------------------------
+std::size_t Probe::value_size() const
+{
+  return value_size_loc;
+}
+//----------------------------------------------------------------------------
+std::size_t Probe::number_of_evaluations() const
+{
+  return _probes[0].size();
+}
+//----------------------------------------------------------------------------
+void Probe::eval(const Function& u)
+{
+  // Restrict function to cell
+  u.restrict(&_coefficients[0], *_element, *dolfin_cell,
+             _vertex_coordinates.data(), ufc_cell);
+
+  // Make room for one more evaluation
+  for (std::size_t j = 0; j < value_size_loc; j++)
+    _probes[j].push_back(0.0);
+
+  const std::size_t n = _probes[0].size() - 1;
+
+  // Compute linear combination
+  for (std::size_t i = 0; i < _element->space_dimension(); i++)
+  {
+    for (std::size_t j = 0; j < value_size_loc; j++)
+      _probes[j][n] += _coefficients[i]*_basis_matrix[j][i];
+  }
+}
+//----------------------------------------------------------------------------
+void Probe::erase(std::size_t i)
+{
+  for (std::size_t j = 0; j < value_size_loc; j++)
+    _probes[j].erase(_probes[j].begin()+i);
+}
+//----------------------------------------------------------------------------
+void Probe::clear()
+{
+  for (std::size_t j = 0; j < value_size_loc; j++)
+    _probes[j].clear();
+}
+//----------------------------------------------------------------------------
+std::vector<double> Probe::get_probe(std::size_t i) const
+{
+  return _probes[i];
+}
+//----------------------------------------------------------------------------
+std::vector<double> Probe::coordinates() const
+{
+  std::vector<double> x(3);
+  x.assign(_x, _x + 3);
+  return x;
+}
+//----------------------------------------------------------------------------
diff --git a/demo/undocumented/compiled-extension-module/python/Probe/Probe.h b/demo/undocumented/compiled-extension-module/python/Probe/Probe.h
new file mode 100644
index 0000000..fd36075
--- /dev/null
+++ b/demo/undocumented/compiled-extension-module/python/Probe/Probe.h
@@ -0,0 +1,85 @@
+// Copyright (C) 2013 Kent-Andre Mardal, Mikael Mortensen, Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-02
+
+#ifndef __PROBE_H
+#define __PROBE_H
+
+#include <vector>
+#include <ufc.h>
+#include <boost/scoped_ptr.hpp>
+
+namespace dolfin
+{
+
+  class Cell;
+  class FiniteElement;
+  class Function;
+  class FunctionSpace;
+  template<typename T> class Array;
+
+  class Probe
+  {
+
+  public:
+
+    /// Constructor
+    Probe(const Array<double>& x, const FunctionSpace& V);
+
+    void eval(const Function& u);
+
+    /// Return probe values for chosen value_size
+    std::vector<double> get_probe(std::size_t i) const;
+
+    std::size_t value_size() const;
+
+    std::size_t number_of_evaluations() const;
+
+    /// Return coordinates of probe
+    std::vector<double> coordinates() const;
+
+    /// Remove one instance of the probe
+    void erase(std::size_t i);
+
+    /// Reset probe by removing all values
+    void clear();
+
+  private:
+
+    std::vector<std::vector<double> > _basis_matrix;
+
+    std::vector<double> _coefficients;
+
+    double _x[3];
+
+    std::shared_ptr<const FiniteElement> _element;
+
+    boost::scoped_ptr<Cell> dolfin_cell;
+
+    ufc::cell ufc_cell;
+
+    std::vector<double> _vertex_coordinates;
+
+    std::size_t value_size_loc;
+
+    std::vector<std::vector<double> > _probes;
+
+  };
+}
+
+#endif
diff --git a/demo/undocumented/compiled-extension-module/python/demo_compiled-extension-module.py b/demo/undocumented/compiled-extension-module/python/demo_compiled-extension-module.py
new file mode 100644
index 0000000..c87ff8f
--- /dev/null
+++ b/demo/undocumented/compiled-extension-module/python/demo_compiled-extension-module.py
@@ -0,0 +1,42 @@
+"This demo program demonstrates how to include additional C++ code in DOLFIN."
+
+# Copyright (C) 2013 Kent-Andre Mardal, Mikael Mortensen, Johan Hake 
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-04-02
+
+from dolfin import *
+import numpy
+import os
+
+header_file = open("Probe/Probe.h")
+code = "\n".join(header_file.readlines()) 
+compiled_module = compile_extension_module(code=code, source_directory="Probe", \
+                                           sources=["Probe.cpp"], \
+                                           include_dirs=[".", os.path.abspath("Probe")])
+
+mesh = UnitCubeMesh(10, 10, 10)
+V = FunctionSpace(mesh, 'CG', 1)
+
+x = numpy.array((0.5, 0.5, 0.5))
+probe = compiled_module.Probe(x, V)
+
+# Just create some random data to be used for probing
+u0 = interpolate(Expression('x[0]'), V)
+probe.eval(u0)
+print "number of probes: ", probe.value_size()
+print "value at first probe: ", probe.get_probe(0)
diff --git a/demo/undocumented/conditional/cpp/CMakeLists.txt b/demo/undocumented/conditional/cpp/CMakeLists.txt
new file mode 100644
index 0000000..e03320c
--- /dev/null
+++ b/demo/undocumented/conditional/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_conditional)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/conditional/cpp/Conditional.h b/demo/undocumented/conditional/cpp/Conditional.h
new file mode 100644
index 0000000..7fcac2d
--- /dev/null
+++ b/demo/undocumented/conditional/cpp/Conditional.h
@@ -0,0 +1,2876 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __CONDITIONAL_H
+#define __CONDITIONAL_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class conditional_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  conditional_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~conditional_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new conditional_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class conditional_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  conditional_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~conditional_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new conditional_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class conditional_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  conditional_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~conditional_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 49
+    // Total number of operations (multiply-add pairs):                  60
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_1_0;
+    A[2] = 0.166666666666667*G0_0_1 + 0.166666666666667*G0_1_1;
+    A[3] = 0.0;
+    A[4] = -0.666666666666667*G0_0_1 - 0.666666666666667*G0_1_1;
+    A[5] = -0.666666666666667*G0_0_0 - 0.666666666666667*G0_1_0;
+    A[6] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1;
+    A[7] = 0.5*G0_0_0;
+    A[8] = -0.166666666666667*G0_0_1;
+    A[9] = 0.666666666666666*G0_0_1;
+    A[10] = 0.0;
+    A[11] = -0.666666666666667*G0_0_0 - 0.666666666666666*G0_0_1;
+    A[12] = 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1;
+    A[13] = -0.166666666666667*G0_1_0;
+    A[14] = 0.5*G0_1_1;
+    A[15] = 0.666666666666666*G0_1_0;
+    A[16] = -0.666666666666666*G0_1_0 - 0.666666666666666*G0_1_1;
+    A[17] = 0.0;
+    A[18] = 0.0;
+    A[19] = 0.666666666666666*G0_1_0;
+    A[20] = 0.666666666666666*G0_0_1;
+    A[21] = 1.33333333333333*G0_0_0 + 0.666666666666665*G0_0_1 + 0.666666666666665*G0_1_0 + 1.33333333333333*G0_1_1;
+    A[22] = -1.33333333333333*G0_0_0 - 0.666666666666666*G0_0_1 - 0.666666666666665*G0_1_0;
+    A[23] = -0.666666666666665*G0_0_1 - 0.666666666666667*G0_1_0 - 1.33333333333333*G0_1_1;
+    A[24] = -0.666666666666667*G0_1_0 - 0.666666666666667*G0_1_1;
+    A[25] = 0.0;
+    A[26] = -0.666666666666666*G0_0_1 - 0.666666666666666*G0_1_1;
+    A[27] = -1.33333333333333*G0_0_0 - 0.666666666666665*G0_0_1 - 0.666666666666666*G0_1_0;
+    A[28] = 1.33333333333333*G0_0_0 + 0.666666666666666*G0_0_1 + 0.666666666666666*G0_1_0 + 1.33333333333333*G0_1_1;
+    A[29] = 0.666666666666665*G0_0_1 + 0.666666666666667*G0_1_0;
+    A[30] = -0.666666666666667*G0_0_0 - 0.666666666666667*G0_0_1;
+    A[31] = -0.666666666666667*G0_0_0 - 0.666666666666666*G0_1_0;
+    A[32] = 0.0;
+    A[33] = -0.666666666666667*G0_0_1 - 0.666666666666665*G0_1_0 - 1.33333333333333*G0_1_1;
+    A[34] = 0.666666666666667*G0_0_1 + 0.666666666666665*G0_1_0;
+    A[35] = 1.33333333333333*G0_0_0 + 0.666666666666667*G0_0_1 + 0.666666666666667*G0_1_0 + 1.33333333333333*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class conditional_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  conditional_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~conditional_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.166666666666667, 0.166666666666667, 0.166666666666667};
+    // Quadrature points on the UFC reference element: (0.166666666666667, 0.166666666666667), (0.166666666666667, 0.666666666666667), (0.666666666666667, 0.166666666666667)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[3][6] = \
+    {{0.222222222222222, -0.111111111111111, -0.111111111111111, 0.111111111111111, 0.444444444444444, 0.444444444444444},
+    {-0.111111111111111, -0.111111111111111, 0.222222222222222, 0.444444444444444, 0.444444444444444, 0.111111111111111},
+    {-0.111111111111111, 0.222222222222222, -0.111111111111111, 0.444444444444444, 0.111111111111111, 0.444444444444444}};
+    
+    static const double FEA3_f0[3][3] = \
+    {{0.666666666666667, 0.166666666666667, 0.166666666666667},
+    {0.166666666666667, 0.166666666666667, 0.666666666666667},
+    {0.166666666666667, 0.666666666666667, 0.166666666666667}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    
+    // Declare array to hold physical coordinate of quadrature point.
+    double X3[2];
+    // Number of operations to compute element tensor for following IP loop = 144
+    for (unsigned int ip = 0; ip < 3; ip++)
+    {
+      
+      // Compute physical coordinate of quadrature point, operations: 10.
+      X3[0] = FEA3_f0[ip][0]*vertex_coordinates[0] +                  FEA3_f0[ip][1]*vertex_coordinates[2] + FEA3_f0[ip][2]*vertex_coordinates[4];
+      X3[1] = FEA3_f0[ip][0]*vertex_coordinates[1] +                  FEA3_f0[ip][1]*vertex_coordinates[3] + FEA3_f0[ip][2]*vertex_coordinates[5];
+      double C[7];
+      // Compute conditional, operations: 1.
+      C[0] = ((X3[0] >= 0.55)) ? -1.0 : 0.0;
+      // Compute conditional, operations: 1.
+      C[1] = ((X3[0] <= 0.95)) ? C[0] : 0.0;
+      // Compute conditional, operations: 1.
+      C[2] = ((X3[1] >= 0.05)) ? C[1] : 0.0;
+      // Compute conditional, operations: 1.
+      C[3] = ((X3[1] <= 0.45)) ? C[2] : 0.0;
+      // Compute conditional, operations: 3.
+      C[4] = (((0.5 + X3[1] - X3[0]) >= 0.0)) ? C[3] : 0.0;
+      // Compute conditional, operations: 8.
+      C[5] = ((((X3[0]-0.33)*(X3[0]-0.33) + (X3[1]-0.67)*(X3[1]-0.67)) <= 0.015)) ? -1.0 : 5.0;
+      // Compute conditional, operations: 8.
+      C[6] = ((((X3[0]-0.33)*(X3[0]-0.33) + (X3[1]-0.67)*(X3[1]-0.67)) <= 0.025)) ? C[5] : 0.0;
+      
+      // Number of operations to compute ip constants: 3
+      double I[1];
+      // Number of operations: 3
+      I[0] = W3[ip]*det*(C[4] + C[6]);
+      
+      
+      // Number of operations for primary indices: 12
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[j] += FE0[ip][j]*I[0];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class conditional_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  conditional_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~conditional_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "aae0a73595ace2836ec2cfac776b19ebe6bc264a8954a0a93986ca1a90118d4671958a14ba9141ef0d8adc0b7311a7d128634bedabdb1f15360fafef8ee30294";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new conditional_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new conditional_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new conditional_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new conditional_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new conditional_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class conditional_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  conditional_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~conditional_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "3453b5127284b4c30e749c06add915c9a3a259d8aa703bbe322077d7c1485356c4f834af56353aa279e23a82db3a7cca0b6a41aba22f2e65cf0c6bc1adfb1d90";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new conditional_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new conditional_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new conditional_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Conditional
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new conditional_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new conditional_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new conditional_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new conditional_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new conditional_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new conditional_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/conditional/cpp/Conditional.ufl b/demo/undocumented/conditional/cpp/Conditional.ufl
new file mode 100644
index 0000000..3991f0b
--- /dev/null
+++ b/demo/undocumented/conditional/cpp/Conditional.ufl
@@ -0,0 +1,44 @@
+# Copyright (C) 2010 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation where spatial coordinates are used to define the source
+# term. However, the source term is only active in a part of the domain and
+# a Conditional is used to handle this.
+#
+# Compile this form with FFC: ffc -l dolfin Conditional.ufl
+
+element = FiniteElement("Lagrange", triangle, 2)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+
+x = SpatialCoordinate(triangle)
+c0 = conditional(le( (x[0]-0.33)**2 + (x[1]-0.67)**2,  0.015), -1.0, 5.0)
+c = conditional( le( (x[0]-0.33)**2 + (x[1]-0.67)**2,  0.025), c0, 0.0 )
+
+t0 = conditional(ge( x[0],  0.55), -1.0, 0.0)
+t1 = conditional(le( x[0],  0.95), t0, 0.0)
+t2 = conditional(ge( x[1],  0.05), t1, 0.0)
+t3 = conditional(le( x[1],  0.45), t2, 0.0)
+t = conditional(ge( x[1] - x[0] - 0.05 + 0.55,  0.0), t3, 0.0)
+
+f = c + t
+
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx
+
diff --git a/demo/undocumented/conditional/cpp/compile.log b/demo/undocumented/conditional/cpp/compile.log
new file mode 100644
index 0000000..a3bf40f
--- /dev/null
+++ b/demo/undocumented/conditional/cpp/compile.log
@@ -0,0 +1,330 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Conditional
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal SpatialCoordinate.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0246789 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00134 seconds
+  Shape of reference tensor: (6, 6, 2, 2)
+  Primary multi index:   rank = 2 dims = [6, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {None: {(0, 0): array([[0.2222222222222224, -0.11111111111111106, -0.1111111111111111],
+         [-0.11111111111111109, -0.11111111111111105, 0.22222222222222213],
+         [-0.11111111111111106, 0.22222222222222224, -0.11111111111111105],
+         [0.11111111111111108, 0.44444444444444414, 0.44444444444444414],
+         [0.44444444444444425, 0.44444444444444448, 0.11111111111111113],
+         [0.44444444444444431, 0.11111111111111108, 0.44444444444444442]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[0.2222222222222224, -0.11111111111111109, -0.11111111111111106,
+          0.11111111111111108, 0.44444444444444425, 0.44444444444444431],
+         [-0.11111111111111106, -0.11111111111111105, 0.22222222222222224,
+          0.44444444444444414, 0.44444444444444448, 0.11111111111111108],
+         [-0.1111111111111111, 0.22222222222222213, -0.11111111111111105,
+          0.44444444444444414, 0.11111111111111113, 0.44444444444444442]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[0.2222222222222224, -0.11111111111111109, -0.11111111111111106,
+          0.11111111111111108, 0.44444444444444425, 0.44444444444444431],
+         [-0.11111111111111106, -0.11111111111111105, 0.22222222222222224,
+          0.44444444444444414, 0.44444444444444448, 0.11111111111111108],
+         [-0.1111111111111111, 0.22222222222222213, -0.11111111111111105,
+          0.44444444444444414, 0.11111111111111113, 0.44444444444444442]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667],
+         [ 0.16666667,  0.16666667,  0.66666667],
+         [ 0.16666667,  0.66666667,  0.16666667]]), 'FE0': array([[0.2222222222222224, -0.11111111111111109, -0.11111111111111106,
+          0.11111111111111108, 0.44444444444444425, 0.44444444444444431],
+         [-0.11111111111111106, -0.11111111111111105, 0.22222222222222224,
+          0.44444444444444414, 0.44444444444444448, 0.11111111111111108],
+         [-0.1111111111111111, 0.22222222222222213, -0.11111111111111105,
+          0.44444444444444414, 0.11111111111111113, 0.44444444444444442]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE1_C0': ('FE1_C0', (0, [0, 1, 2]), False, False), 'FE1_C1': ('FE1_C0', (3, [3, 4, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (5, [3, 4]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (4, [3, 5]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (2, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0405431 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.000471115 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0802341 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000437021 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Conditional.h.
+  
+Compiler stage 5 finished in 0.000648975 seconds.
+
+FFC finished in 0.147328 seconds.
diff --git a/demo/undocumented/conditional/cpp/main.cpp b/demo/undocumented/conditional/cpp/main.cpp
new file mode 100644
index 0000000..efd3715
--- /dev/null
+++ b/demo/undocumented/conditional/cpp/main.cpp
@@ -0,0 +1,76 @@
+// Copyright (C) 2010 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-07-23
+// Last changed: 2012-11-12
+//
+// This demo program solves Poisson's equation
+//
+//     - div grad u(x, y) = f(x, y)
+//
+// on the unit square with source f given by
+//
+//    f(x, y) =    -1.0 if (x - 0.33)^2 + (y - 0.67)^2 < 0.015
+//                  5.0 if 0.015 < (x - 0.33)^2 + (y - 0.67)^2 < 0.025
+//                 -1.0 if (x,y) in triangle( (0.55, 0.05), (0.95, 0.45), (0.55, 0.45) )
+//                  0.0 otherwise
+//
+// and homogeneous Dirichlet boundary conditions.
+
+#include <dolfin.h>
+#include "Conditional.h"
+
+using namespace dolfin;
+
+// Sub domain for Dirichlet boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return on_boundary;
+  }
+};
+
+int main()
+{
+  // Create mesh and function space
+  UnitSquareMesh mesh(64, 64);
+  Conditional::FunctionSpace V(mesh);
+
+  // Define boundary condition
+  Constant u0(0.0);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, u0, boundary);
+
+  // Define variational problem
+  Conditional::BilinearForm a(V, V);
+  Conditional::LinearForm L(V);
+
+  // Compute solution
+  Function u(V);
+  solve(a == L, u, bc);
+
+  // Save solution in VTK format
+  File file("conditional.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/conditional/python/demo_conditional.py b/demo/undocumented/conditional/python/demo_conditional.py
new file mode 100644
index 0000000..2e3b31d
--- /dev/null
+++ b/demo/undocumented/conditional/python/demo_conditional.py
@@ -0,0 +1,77 @@
+"""This demo program solves Poisson's equation
+
+    - div grad u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+    f(x, y) =    -1.0 if (x - 0.33)^2 + (y - 0.67)^2 < 0.015
+                  5.0 if 0.015 < (x - 0.33)^2 + (y - 0.67)^2 < 0.025
+                 -1.0 if (x,y) in triangle( (0.55, 0.05), (0.95, 0.45), (0.55, 0.45) )
+                  0.0 otherwise
+
+and homogeneous Dirichlet boundary conditions.
+"""
+
+# Copyright (C) 2010 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2010-07-23
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(64, 64)
+V = FunctionSpace(mesh, "CG", 2)
+
+# Define Dirichlet boundary (x = 0 or x = 1)
+def boundary(x):
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS or x[1] < DOLFIN_EPS or x[1] > 1.0 - DOLFIN_EPS
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+x = SpatialCoordinate(mesh)
+
+c0 = conditional(le( (x[0]-0.33)**2 + (x[1]-0.67)**2,  0.015), -1.0, 5.0)
+c = conditional( le( (x[0]-0.33)**2 + (x[1]-0.67)**2,  0.025), c0, 0.0 )
+
+t0 = conditional(ge( x[0],  0.55), -1.0, 0.0)
+t1 = conditional(le( x[0],  0.95), t0, 0.0)
+t2 = conditional(ge( x[1],  0.05), t1, 0.0)
+t3 = conditional(le( x[1],  0.45), t2, 0.0)
+t = conditional(ge( x[1] - x[0] - 0.05 + 0.55,  0.0), t3, 0.0)
+f = c + t
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Save solution in VTK format
+file = File("conditional.pvd")
+file << u
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/undocumented/contact-vi-snes/circle_yplane.geo b/demo/undocumented/contact-vi-snes/circle_yplane.geo
new file mode 100644
index 0000000..ac9370c
--- /dev/null
+++ b/demo/undocumented/contact-vi-snes/circle_yplane.geo
@@ -0,0 +1,15 @@
+// Gmsh input file for unit radius circle with mesh symmetry line on y-axis
+cl__1 = 0.05;
+Point(1) = {0, 1, 0, cl__1};
+Point(2) = {1, 0, 0, cl__1};
+Point(3) = {0, -1, 0, cl__1};
+Point(4) = {-1, 0, 0, cl__1};
+Point(6) = {0, 0, 0, cl__1};
+Circle(1) = {1, 6, 4};
+Circle(2) = {4, 6, 3};
+Circle(3) = {3, 6, 2};
+Circle(4) = {2, 6, 1};
+Line Loop(7) = {1, 2, 3, 4};
+Plane Surface(7) = {7};
+Line(8) = {1, 3};
+Line{8} In Surface {7};
\ No newline at end of file
diff --git a/demo/undocumented/contact-vi-snes/circle_yplane.xml.gz b/demo/undocumented/contact-vi-snes/circle_yplane.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..db34cd29662168c05877bf9c26c07a9caa946a27
GIT binary patch
literal 73289
zcmYJab9mg%_W;`1#-=fLW7}zrjcuoKW7{?xqm7NGX{^R<jHYR_vA41AzQ6B%?)`6`
zJ)W7*Idia738<(GFJYSR5UlLot(<Jk{9K(ZKH0GQIy=3qd)a6Kf!)bbd!a1UH^S-p
z!F_GGTP{!}9;!Kb-Bw3LL?*<@y`7bm>PAj4XkixR+Bpg$+;u_xqA^}DmzI{+6VBV{
z+w<((GtS#f<J+0p+pXCvgzD{Y-=^8?PUG9P+8adT^~~(`m&7aN?dk0y<jpSRLE`l;
z<nH2iDCC*r?K$KH29|vN^>*F(wsG(VO$mAEdpp~HJ$bvmczb!fr+V8xd3!wRdp;|E
zz3F@Hc)NakI+1wUSP6M>c{}2Gd+K|N3Ax94duV)n40#)pc)2Nld)R)xZwz@E?R(w`
zdD?h;;CMSKetXObxlajsnti*^;e3_8rpoB+?|XqUeQbQYYz%oayQYHjK@QBs{!;`>
z^?J+kcJ<%ljW$H`d6whutnc;l&HcLZm85Uy;<fheX0r12g`?y-^l_>9ZnW`@_-(dy
zaHH|@>fohLuqpTf<+ZwxC8%jZ&*y7)o@JG|-^GSm$al`BM?IJJgG{jNTE}MVGfPN#
zmW2LGtq=zzd-S=Z3yl$Lm;zs>rgSV*g;rhJ1!oqiNevTZ(FFPeMZvD4zXWyt20K(o
z1;^_U)lO2;_c03=dtCSpxVJ;*3Z9QiJQ^zX&mxF=H4lB0db-r5E{JP|0YPK)ciJXZ
zqZdsq+2*`{DLSuH%*70(b;iQMnhjiID-&0QlOf4TR97t7%l?yG-c(w#ze7RATJEyh
zvE9Sk8(g`1O~gtWHpG@`vSwvL2{e{#qp1+HF|#W22&65`(tTDInP459ae=2v<J0;W
z_F}f%+}$h9e;NZdDJI#$_L9Utmtp2-VDGT!2-@vhuQi8J$9ahu`PXzh1Pr!^bBGGW
zy1#`rU$^_&;J4qy+Nim~z#eF#C3)WB{g@J$`F!O<Lbr@Tdc6s2YMHqSv2P9n(CY%C
z=7X&4{iC*JQWJXp)FOf$Fq3i(VriCNbLbu87;|p;`3Q>1^=av|j8l2NxGK6;8K@!G
zRGGP<X9!5^u<uXLup(hlVDDXW?X4~*_!8WC3<<V(Z?x`|RpK{?n(3_FAAltUk@7=c
z^jm$h%x~p87~ekc*0TB{<x~CC6WWb{%P-dAH{=+_0E#li8o0NwEJ6d5yh|qx_9w2y
zF*FADKVG+wWMh(alstQ-Z$d`R6$iveBR5B`%ffjod&P`3J>A_YBW#fJQOrlK1P4x=
z4fbT%N5K+=Sl(0f?0u6)oTjMPvo`h7R!ueL&;|GF90Bv&n#uYf!M(G2;nOFAf5hk!
z_&KiT_F5^;xJp@a(Rd32TjV&&ioX1g5D8A2XUdH$(L`q>ZF=t`i>CQ>wU81lH-w4R
z^BhMog`6q-N_miDi;0-e<)Si8uE(#Ly|uM)1s|s|pv-wehSSeLxlC9x%qnq_0Z$$Z
z3jfUdHG6JaJijw35~*~_s_FTz|D)2sQThzw4=f=EVtHQ<Q&iZ!LUrF}@VV^gsq&qU
z-_^eqF1g^BOYlD|!Wq7akZpXC3vuGEiO5`kDdd?1%7-|)*C6n|LEW5MVMvNgaEA8}
z70pL5;=1E^Y_Emj#XT6#LJdOOKaW6jf-e&MelQ$U>Ees`3sm{TFagixOKXHjDJmaf
zf<w^tbI4(92d~iO;N%hKbeM7-!XHi~D&O;iAFVQsDbzonA7D;YD26z-)WYO?xZ6Qt
zJdgg9D|FEw2jlttpWK3l4P_XgaIa7~hrNqRC78~22)yoeArg8pHkK46S;a#1`K&L^
z<IUJ}$7=u9(%D{`6<e_9)@P?mRB~QdtqoA@UThbB?So<3*C8lvzDymgN5WVZd4=wW
ze5`T)2~%xe_ydN7$0fhbg8svWjUkF%-Q4p_0Su|eD>VCK-Sb^~g#>@+GMwRSC#`iW
zY(2gVw|>C7mRTJ9*@+@FC^=o_<tPV+pdS#Q(Z~AXg?mZ(-3iVr2a9^&R2%k$NwJ5u
zR`{b$nb*60swT7LlHkv_Ff!FN6|CbNdl*?@f3QKsqfNHgyX>N%+ey+zj*L2lrsvR?
z7UY{r@{@O`9^p<7>V3-1*!{-{{|D!R!EgTuNBsZbQ;pd1tLJb}HZZoZtz11oTw8?6
zGNA~KLOIRht1_e4LovVlAH4JbhZ|CaLjDK;sEc9_`5!!P2~I!ge`=X}y<08{J@}77
zg$|1O%l{Azmcn>P#LWBZBwx6zh2KG8<~qX6t;X&j{GW<iH3&^(vG)KN*+*>@*cTV9
z1G7;IX5;_62Wk|dL`Y9M|0%l&r~e{i4#qm3Ws$tOg&G;NsE3%s)!Y^5j2ebKLMPOI
zcNPO)4TB${HEO>fiaY)p20cRK)qY16<J7j_|2tSJ>Q0cL7}|DF3o$)Xq%A0B&vp4)
zDbaWhEd4jDcVOuE2t`-J_kSfM3}g{~@$+Jclg)8GxL7QF?QY5NIjj6|ZnSnZTPv*i
z{Yp&c#ncPNT=f;N?o+&Ki0Slrz?+ugRsH_IgRFvX90`!}wi4{;k#ULeC6$q*Sr)+u
z`KBLCf-inI^lzxT0yh;BjhlNtE!2Ii0xy0`^cPu34>s*EJpTW~<A3pM|3AET7~bL@
z)xdGZ;=co(yk|Q7E$zJ5ZmEnA#M*qRU&VU1*D2;+TDCCrmH*RaLOH}V>;Hsi!I*JB
zsFUEmm5sq{&;5^dG556_|NlsTvl%2oi~ZN!0o!$b5uZayYYOZ}&9B;58rIC{R|>lh
zS+6e4_lrMvPR#0A1)g=(-sTVqRnKzF!mL2zd21VSbu$(VU&7LF?yH-Oat%I)*~zy0
z97CBiHR8zXV!rmwos#fqd9>og37xc7>w@kw_ZCr)zqXLOcj{9&GAOk4)s4M)^nO@4
zLBl`eaAY?vpgy`mjJwV88n2#JOa12`jtHF$cLYGti%r#1&0lp;WA$bSOx18*LOw_8
zp9LOOt`H1=V~PQ~jUlbN6i^d@2Q$>Sn6?go!5H>BU`zg$^$TNK31|ID72Z=sZ615m
z2c%b^@`mD`-JpieMcJ*5c!p)0&Ej4@5;UN$KG39_;oxPm(&q(s`G?*9zN0#IIe9Jf
zJ%yfdg-a2<)poKrj|r`x2wl_VZPR14{KIHliIAC_azP*q3A^=A9}DK`Q%SE(z@+P=
z1bO@1=>i!#KLkjCTV9;`o}j{cvlq6C-}>rr$i7u}7lTHgznx3n9gG|LNr2-YoGFf;
z{Q`}D&!#(s7<od%@mOKV?R{)t$vGY&+q3B(L-NUuU*OMPSnY2+mT<3;)}IU(&RjCi
zg76TCj<=?94!;VP^Iw|LXsc(iSFTET$A-tpPo2_nEsys#nsZfRaDLT;AQ7PnI}AHQ
zx1M>&oq^mQ;lB(s^F<1`;Zjs@V#1{L$*1y-=l#EbN1!aN3C$wL<9JlBY4y^3(5tuF
z3RwJsc=xw*UQ6ayN_DNBx>Gz^`iUM%6<%%4;kpA=;A^6M4RefzqEP07Be;}3yyudr
z6ytKb1Nh+Xdf@Y6iFq3Sr`;a{r1x!mg?*gcWAXdy!wUEq3W=W+Pd{7_!(X$~k1N_R
zn10zv(I?_qfRKaca%5N1BdKmXAb-1ZhE<4_&~9ka{r76F<-h4_);B0skV3o+bK;F1
zqz2Sms#7`IWM1cMgAt6Z`?lxSk?tN)bwTouEnVRAmR0a0F!J%2(ts|@wZQmw&Co-F
zlT#s=oe-O|FR|(}xJR&)a-6w0KO<0ahK<qBo!?Mc@k)B+YLz^GrlI&Ev|@=AgSbU!
zx4~|}EO(2SZDp|l;)^~{b3Zda5$KS?;><{}*E9o|$d_+>w35sqSz>eEM^+U-M&f~v
z>4t>nXVaOo3ve8O>uZNquu0ZvbXu6SBTt$ICnW}#km|=qG^c9Y%-z-QJ(`X*wSl;o
z?$p9LCg&r@u4qe)oam*KA&0aV!I`xf`o}YD@xlqZyGWID+Rv1G^v>_w84c*_4HQk%
zd_~8wSX_GKLI#M$7nZ0n@?@l@*S0_ITw2WT_-5bF(XdV^_%JZs(=<XB*qD&xCV7B5
z2X_A13ejXBhfEBludBV!-^eX7g^1!h^EMFxcAg>`M!ddp;d`hUYw`hT3gnCyX3p2d
z8cTh?8SBzk1Dec}6z21L1VslfDWQCULUBlCb)G`GJPY()^j2w%zoZ4TtYeJ3$I23h
zOF%igNGI?<^B?xRvO}7MflBA@Uxj4?_FKojUho(_;{cx+yXA+NL*An4WPX=Q=ME)a
z+GnKFRr0M-iz_e&rJ;y&>sH-I3~w#Tq9s~u$eri|yQIZ)W!lrdC&&HIiy;NQ<FVw_
zU{CJII<RP5Qn8I>yJWBFeX7v38&KSJ6%Jofi5J(ojy1+G?QVmbD~%2^IFlrlESoVG
zn6^bG7)LYX*YIcc*M=+lK66-YUC2d&3B7yhm}O>;XiHRSL6WU2Gmy(pF}(KEw@|pr
zDxZP~n^%54YmWefGxzO9(cSUKCAx2hSn2MH=Wf57-&69PpwkQOEhv4Q-}4s~Kn>Wd
zqjUkQD#Uf{{dHQKo#nSiW16UE1It>jdZ2TNx-V0)<Qf0j@2GeES_J4EqO;4A&^*r%
z?ErCbOK&>SijGruol34fH0O9XcTvgKhIYmqDK8g9KBdpC{^4t9ZtPGRqqTPzJm?Jf
zZ~Df;anLNi&o(;p3`d&ButsX4`-Nq?m}+tduf4$zpJ*d-B3!Y^|7ycGTRWv(A}dk9
zlkCj)KD~;u5}8@y72&0z7}GQbAA|njOUJ<%S&RqKQ8ZIo`|ERSTb~c!aZL3~)VYI(
zkccqdgoCfif9!Xi=9QXE{$Uu`?-Yz+9}gS$p_|&+Ye?Z55L9f41}i?NQg3ACo6<s{
za*daaMtV(~db{iq%U0jlwhHa#vk3JYrcos=91|#oJkcIuZ(&jH+Fwpwh-a64=6=_n
zvqD1iKZfN;3#E7PI+SP=OStI7z^NE0&^6MwT@7<rr3w#!?kcjA@aPQj^^1>xfSKX|
zbHp2~Br`P3MDl-(c9XWPn=JZ&jxSq*y-%A#F)rL<+&gIWJMPt!29|To+WQA~6Fn1K
zbUS2`m-cgN`|8<*2A1xM?Mi8HZcy6s9#US#=3i1X`hp<@EGWxvmp_2X|H^;vPew}H
zMgYa!NppZk8^r>PF(u4?81!l756&!k-QgZCMqV~iGYa0`vR2a4DL+NCp?WzGnjDp@
zuV6v9-zoT%SuFiOjHhw;%r|sAP*B%xaV8uycZVOKzT6JUbQV6cw`=ixf__JMk~1_M
zG+B%xo71#$Q*M~+c5_YJ(}UwZ!IZsn{w1ZA1EoCL=hKkUkw#9EcA#J>>~pxH&$#`f
z+>{6%FUlZRIqyu+Q*7=wHj%{MW@qyL#-y5t!C+NC0rxq9wG{dtICF)czCUs8O*fKV
zY@Z>Ewgz!{m%?z6Byj+iT8z$*oKUjE?@|&kD132x|ALIwVJa^%<ELM?T!)e8vo})w
zeYjsS+Z9e8hu4fYSVz(}4AK8vj5a(<mHyl=wGhM)jvaW`$z@JC85qZamFF}M_0a4w
z*v;8Y$KMSY_wO%c>&Z@sj{T5KW!jKgo)pUa0bny<T2|>Rg^=;Kb6lq@^LZ+bFBJwh
z`MpE0##SL8Pbz_sv$~~~G}bR^ldeZ!r=yI`vPt&Zj$j?m_(3jXO?UOu##D5LNFC)y
zOCFro{CMjW422EP*iEhHw?EF64I5ATw7Rx%a4Z8Wmw-9a35VZ3zxO)RlPgKRaXtP9
zoe4Ig#mE47!)Y*@0>{I3U4)0FHOboc9I0|zYp-qPpMFszxe3x)r6GByp;YmmgfCx)
z5%*dT`Vl72?1-MY*zF~{vn#4o*LLU1GLa2h?SgN$K4n(z%=fUHU!yFKoQ;-^c$=P}
z8qDJFDd7){$0(c9mV$7`m`ajx@uA){+&G_Y<0KQl9`NCCx^kIu{xk3(=S7#}?B?pi
z%>(&UkV=5`({L3`ulz>M$EMuq4dEg7g55~$iX=hJN{3M6ALQTDiIj-x4zvvJ(}8bN
z-eIhG9C5F1og&sZ_)X^5ND(~<n1;vfg*+s`@|Q{xJ|uq?&*TBWeXD!Yv`O20P1C37
z8!vN<LxS4yF__LBW96;j&Vq~3m;9sZnArGsi2LWCSl{d!i)VcL%L7dMEzJT$ba~OL
zXLrZt@A5#8-r@jYH~w{qA^0XYQv&F{Vx1MLB?zF2lFGM@pqE%EFqY8$9$2b_A?rBk
zj_AL-FeabT=5`d71EAi)zvpd=1^`qoRP^UI|779qEd5v%Mx2p1$d;aTpEsaDpT&R3
zkEpbx%$r*JF4zCZ_zz^oCsS-@{t(PP01q_DKFG7fSG{!)`<cfX33~rZe7#e$0VFqk
zDIG}N?HfYa4cDnPB;Ys4hi<f5OJ<aa6%}V>c@_L|l&$nma(Cosc}N8zE;CKs{tS6a
zKx}ZJ7%gkhtj|e@gF*&Fd8*Fam11M+*yw#x?^}GGbymBqJ2PlK3jiHQ<pD^!P7ZqI
zPC~d+3Brc(d+_!$N!OAm(_@V7`iOlj2EL7gpCc@a*7dSHFp_ChT4dMgN7*b(-Jc_6
zSthAdkQ)A}iTa_Ak~8>b>U>b$KfdPPn^E-Dw#Y_^`!^k1QzMj&6k)yU?n_*6mfIMq
zbiM>eWVmP<-@>nLkIEY3SJ0*;=cPF$7u^1&(y51#{pZlqiajD5q$jxT(&muVq6B>P
zq113-*R@>5`z&H03b%}RK<rxDoNP7sVUXRB4}pPUT2|$LzNai7K8)C(IaP#@Wgzq`
zg^Vs|6ywb%8cWr=SBcQ&M9Vh!zsSkFOk5f|l<c9BEp-x@I4Vd+KP6%rqFKGJ3hhm@
zlOu1(zDK>G-JU6yVW#%Shfm1tW>*tQALS{5iZM*7PRLMt2&mi-otsaH-ep}yn(oeF
zF8XbJFh^PNG62w5&te>VneF!eqxKq^z46O6D!<jC`wD+t?2O(xU7*RpUri(9dFn+G
zd8jcx+*(p3YW+a$7<z=cK2s?-Yu#R@32Fr8)(QHul=1NvhGB12o#(z_kAGVg9dRg6
z>VwmqiS_r^uiE))0CS$v&vr;_-7lYz8%BK7c0FfW;K;CdsSGfXyzE+cfZiiZ^aquj
z?E<tz4ZZfnbx-Yg7Lq3b+wt;%mqlS?R#p6z<mVy&xK2Y*icGHF{F+a&kHp{#k#a+a
z>@UZ;pA<gHKkavrf^6|M#;-7zH<u$bHd_?{($QU`e$uL*!V#8mlk;|*y1aX+2X?P(
zTb!gdXok#-H+f=8hG)$H#cm|-?;c?~+FK{_*&g~c_!xTZGwFw`DFo47x#Xq_Q7Zr9
zrRWboV+MIDjZjrq%uffCBhtC&`mXg=*9U3C$6%T*eB@<~gt`@~o(NvY+@LBgma5t)
zQ7DFcXMzW&1M5g;&44F@$ZQjjDc*hW1#xP}J-$B%3fNTw3(*;y4!&g)L+x0@AT?i(
z0L~8@UX2)rSd*NUMCU(^_=FvnxCce{B3l^qvtC9TMM?3Pv(;m^AzXQS^?67ctX}m#
zMr{c*759gxlYny@1`T7zdR2*%t6%8W$*z1SEjQ4SRkK;V0Ob0AEe@Di##exE!EVQ<
zZj?{V@}h>Jnl0Vj`0w^Si}`C3N*fk?NI5&ZS4`<5_SdIT*W~ZwJv+Xj;xS{ELOwX{
zmqa2o#gwXk7~1laWfh0*Kc?sxF$OGBO!gG58bPl{nibj*mo-Ns@^x;M{-I0mK}XG&
z0!sGmICL|t^}|a}ydtCwR9K4PW?K2DETifNzo<N$J+>ScXgzVz*zMp~Rm2Y|qo!_U
zc>Q^Ygi(iSm`VS+Ve&RjMSqR!DdHgjcO9!+Dxy?L<&4>vV^cj|YvJs}cGsRl`F$=%
zv+&8blrLp})xLfFogNF+CpSNRC+aynFqT8YyNNv6Z-|g%C`83Wj9_~z*<z~ssfrY`
znq7VCUQ{~yrDTWJ7%@}Q_Vj&IwxwBbzHBX|KrcDvoG;iSXMB?Mta#~T0@9$pUTNJ0
zXRkP*b(nM1YeIPHQ(J-M-x2OaA6_-0&Uf<<6dcGKD33Y!#{LZy+%>x0Jza&*TApbP
z2HJdu2~Ji8x1g5Kh-5>Ynk@;4BldBtZa7KUeF?z@FhlXM#{glY-qF;2Wbg5RNJ9>f
z-!FvYvy<~#X~T{gI<QQv*EX~Koq%^KN1@=IMOE#!y}z*`_Ym$B(JI-Pvws6mO4=iS
zgl-_0(jpbHs?>`A%-m>I1he(DY^*pp@7&DSKKCjR;S<_4Iw&;j24D+26eR4k=|2bg
z-Qyn%^5sL`G5>ad|9B4VycUt8@S>Z~DImm0M&w=a#)zIE6z&9SWFj6~deojTm5s1F
zHmwQ>?YP!#orX5JHsPmjYm*B)0)%&H3(SFLBX#JDQ=4vZ?DT~`JV0N34<Xj622)kF
z*?6Egeyaj%<n6M@nX>kl<GmDBVV%GOMGHw@2fR|-SOCLSF}eNq<ZOA#mm&n4Ho3uf
zloBoMoz(>|oXT~AGEiI2DH_tARBk0f>KtHq#+$_#x6~I&oP^KRmsnyQQ}K$^sjTaZ
zePZcy;Y8c(Nczhc^Z?^{k`lV3-c}E54Za$>hA3G%pM#-@zcBySFJ*RpPK4#Gc3`J7
zw1P^@Ynh2ih!}lXGZrZc52nRvZ7Ssu3e0e*{Wt)8XArGQ+LkUJln?{+wmSm2rPN^j
z;$hiZT@ap2>~K75dSF9*tU;$92K|O}J;bQZ`)W)3&QNj|^J_(9Zi7sDVHy$8RU??t
zv+6KJO#auJ0LJP<N^9Bl%nCu<*oE$do#2o!pAZ*-8`ac+=w|?aNlrrl9$qiJ^11V=
z;2~SKe`pDa;eZZ(=lW>RSX_RR`QeagU#FA-CwT3!^I6XoD+(npY>vqfkIA~Q#AYDR
z2<C3Eu;dR)rIx=BmlvwyLi#lS)?eG7xW13JHf^Eq#F>1E%6Oln%)53qQ}WW}dQCgT
z$Vf5hwFOrt#t^3h8JrqtBpuRoz=~W~Xa1M)fOwVG^Qu1|*woX8L7s>-+n0X~b2z_s
zLmd@jUDukVyGX<PFo)3Bl5PSyy;y5XJIoz__mq_;ypSht*2=gwZ6Sb@(xjF>-dPAO
zN?m47oNZz-5zh>yJ!^6Mb?#qoXBU&(`E719QkksM%N?7R{^V$Kk02dQR!T8z!QDxQ
zi>TE-!6NZ$RBtYs$F|UEaBNK5L#Zz#VKqQ8{xP#N*7K+ff_}KdAUd=}nnVJR5lP@@
z1WW!U`fAEXVkb(*Le@qvai)KTm*CGkI8fo)$q%6(aH1!0f0&=jx90OM;5pc?Unrk1
zDgD=T48|lUbUtvM=<(+54^?4Ql%jA+!B-SSkJjM3|J9jbX$FD?(w0cmNn<w*J$rl)
z_{vQdPb;D<CDgiZCJ4$@@FY=hph5aMMr)@2c#kTtVuOdlJw8HCW$XcBvMpL>o)?fS
zwPQowKv&H0@7xMQ45Smzu@1`m*^X%F!Kuz^XCg{WqfSfOtVALn75UE-A6mv^R1sT_
z@P0<rff+@ahV(Yx$q)w47KQlKcSJk<*Zxp4SbuC2La&<yCKvq#{BTw(lr!y|*Jo}J
zmV-&B#XC(E!S@qHpz`Vp$bJ<-STUdW#FjtT={Jr|znT!Es9Rc7kD&fKbQ5Fn;~+*+
z>wGEvs|)fjF_!g;kYS)MT4s=Y2Hhj-L;2}$dSnu!a%;HLb;6M&EK-HjUxjYYBJJiL
zGo*ZW#4k&nqfwXT7<@2T$ld)j%zU{tg}TtE)#J{BDAWjwU=fHa_{lYZT>sO7P85Tf
zT~x!WT$im)11-a&i8{7@U47hHxVHj04p(7#U{|BlYJR;%Jo_E#tYULzbpz$^j85hW
zsNG?}6yEhMg9OzPap@8|yWHL}8{Ro`U@w~hpd5y&)TB2tr-n6M{5;?>Bw32Miz6g&
zo*1NccCwz#Gq87jG-2~{byymU9MX}nO+3zIEyPLs*kEGVyOG-p@-sS7FT3^CFz}0P
z+#XOC7)(K`FPC^DPx_&kdg0D4D}&+6PfuP!gm{k?Jauv{i<I|64`aXQ2Fqkl^ZVsu
zT+mMtXLt4~veZt&qh>Jbs?Gb68BQnC*&UKxTsA#4@s>3><hsev-mnB>J{L%I&iG5p
zaVedT3c=)8bm!xxhqx(dyjq^_`v;*z&}TG?U>$yes7baTe53XYvmU?p#&Y_xRIg18
zJg<KXws;PM@MX;{nWMchG0Hu7Az)UL^><Fjmh+DzW4(KaW|})5iIS6C3`PWUbd;<5
zoj2+RM+djY<0^0IaoH`i;7<;J&_B8r4MF59ITugyu@z+CCF_@Z{1p%POfwKv&d&lV
za~YO;*zGQ@%^ryX--8>Lm6IRwi}4qAs%c62)51>!6p2OTnh0}0-D5OWbA(korETCN
zwr*`o&qjS7PyZwtmj9`jY&1nAH+4eq>b>L-HZNcmdI>6yU5Ie;bB5>*2o76ZXh|DX
z>fkkxG~mQ$g(;ocmm*Tx{Hr`5t0T)u(u=>GH5-u65ce{$VgBgZdG!dc2{4(LI!W;U
zIXJ)$Ay0OTi*b=apFRYC`#pc1O}1YE);Hpm+!ZZSHr>U?SSD7vh^ODagimsdLlmOc
z1x-mq%Q~b)IRK_<hYaIn&R5;va=U+mh%q}8r@OEWqgqbL>%|4It<jex)e>mN5-yY}
zI7kM=5}*EAs_^$HWBjl#wYthxav~YBm`l1EIHV@YCI`4K_S_z8NQUi(I)!#;+8ad$
zt+*ncGmTj7IF?;5m3Vmy>l-?U({Kx&U#O;>6FF)U2haRr-m8UtGI>`br0ADe?5f4*
z6JGHOBCcCK9!eo%yMyW`5c+0+Ka`(UnL&+F@z^FQ<*FbV>x*iB^cxUC5>sY1WQ+DQ
z>_=BP_h?$%K>6`&+yW0c=J84BN3=?Hq%Yr(Q)!WGny>x);t{&w_R1DG@O2PJ|KS~a
z7npE}ItX=oZuNoX>pWG2uE+yU0l{Qka3e-8&tMo8i=o#+d-A_SQ;6(D%Pc;+>?&D@
zdHtxX=R{#rm`AMXYy|axcjBu%@xInYk*oV+Cv?u(tMLY-moz<N@SL$CrHRSTOr8Rt
za$FF%x44VoYt>^q_vsJ~rYn08`dnBLMU|H{dkiXnQ7aGALf>#ih$3SP_*7%^Z}#6y
zVw%TGtBd0D>X103i2XrWRRyc)?7(huPT*e|k>J``xZV6COT^zSa~j)N@%0gBQXOfR
z0U&|ta~50P#lfj^yf78R07}c)a`s`jzL%#QooSRugOgKd>9Jcqo$SmgmmTB?yc68&
zsxDJFWUoS^3s6T}!It=K^SUvrjXpSJC@s!_sb#6MS~8;E`=o}Cz5W?melp)v(YO#e
zP|&%DY}?DKINsj<ETYdnt|o$GO3+izmUl;A{@C1a5q^SXy!c4wf5o-@)m&Y<oix!x
zN*!IU{Qi&~-{K~K;&FEQa&+Pwbc=)XiPFJl1)^sYOT_-CDu4~^Tlk^jEK$&h{encI
z!HjtF?a7e6Kos>mhXG=p;S?g3S1VYyCcdo_?t;k@!Q~o6e{|(PWap@GBZ7E)fYAPn
zF5m@@x2=8RildnY{}d8@!Zy)|e8voL?$OVH6`qF+#c-jyM&D*Wjfnk%=<rW%ioH31
zwpB!)%|}1ADPb_)Uyw2?nw!Vx{JPi8z*Bv$lP%<Fktz>9g?pWnX-rS~V)`q!c=BA(
z3}oOqNX*Lq0?YTpw+Dqtcky$CtAw{pwo>+WDmV-p%H3IFNOLPOc$2`Gxh{$Cse%_u
zvV2XAl(p`T-G`{_VR=sKXL$h0r!ks6`tV6f5ua`Fe@Vv_2Y>T*cr<@42JcdjQq6{S
z&?FIVv_<8b%UC06U>w0I!)~*lOx}-``MF3X)z|0F$>7PBo_XuYfri(>UVDGfMvYGe
zs4LBg<Jn)dy%lfgs|)5G<3C11zsq<v5<3ezu|7@r`*r@AnZ;k~NuJL_yM7mI-&4py
z-YaKhcdD))Eo5_n$Yysl5XxqfE<wyIVOv~OQVr0I;Ikynny?_Y2r-PN0U37uOl*dh
zTR-*~@){H*xKu@99MR(VdN!s8%i}_urqHRGa!l!z(N3v2>Q~vV&yF;DgQa)hb*Z(_
zhJN+M%OQlAUX^iY?sZB_*f$C+l50lA&}i!(^aNF>2DIBT>CavuH5}x3bv02j^cyK!
z5@_pB2q((G-y~N|&0D!!RHoM4?vgZ}7bG$0@peyp@TzsvKmRd=$0;V}*mx%5Oi)p6
zSk~|sx*Jf?30h*+Kl0n@WHn?3JZ!++X~v{LY6|W^yIm5Kd9<<3mHD@z!RJ(HD{Ox-
z4A0!^VQHyB4!~wzSPVtZa7(0t+?V4s7Q>N3wX`J8U9?BWPwgWi^ZwK?>n|VY!aV?2
z)}T8>&V2C)i*g~GgyLKb=L|eFK*hVl1ZgeM9r`}}mo>(p4M7w{*{tqkI^*HMGvQe`
zW-(F_R;1Ykr<9U+Ka;T~P$b$VZEugJ2**%SMT}IB^F*Sv>>+p{njZod#n&P%{$&Sf
z2IIH<jm%y-mm_z>mg^lZ$x?r5p=UEz5$ID1S^_rPr7I{ho`Mwk&Sf}l((fg_zxR6!
zDbG}|$eFdrMepo+=N_XoRE|Gj!;Z=P(9LyRg9gQAqPABinY(Sz2XW#&{7|QF1xaOQ
zu*q(T)wuHQ6^*=eh5Lt@xi*_#M`;!YX3BgECC#7*BwX7uBcRaERS)B~%iz25BT~W4
zsHAjZ3=qY#P5*3(0#cGaON76gkWXFZA)YLW5Y&4)fnnTRBCT`B%v3s**}1<LW6|Hp
zr=Pt`l7*s(3p|KDASlz+n+-!^ZRBZSGfV;`mL8ize5H748<`JcHKe_pG@K-7*!&8;
z7-QJy(&Z$PF*V9ngjw^R`)0IuK8d2No13pUUGpa3&m5;mE6lLH#o-Fxog+H?W8*3Z
z!>$Q{cjc3{!mkS*sbcZ<7V9`(5ou%-lCLzccO}X}B7JU$cfted)|KAa|KjN%AP+)o
z)ulOs=phc+I?J8yF8!G5YjCo`07CcI?)1-v4u@<cUrKISo9$+bFV0W9y~n8I3EBv`
zIKAd;h!X$EmeYS5h`JQ1-9Gs+q-Yjch2PKt=^ED?I*VzL0B{6ywv>m&MUJ60)>(Nc
z2;kRpRm(3=s}m^@dKN)!D{o;j*!dl7V|o9*D=N3Sp19woZeYghsBFHxGV2@<QU6;K
zzt>ivSAAU`$Y+;Y_g&m;AA<ycao2;p>uCP)r?0<$-;+Ffjh#Ec<(IT>d$fpSA&Ybh
zHc}!?%fZu{pfm!kkxQs)`KfRA*krgX;G;k<2i<Au-}lIRmp-9B|C&c6Z~b%i+d#vu
z=A0Kw0P{UC^G9KSUW%csjYxD?@5`1@AfX5K>}-4K8jG3bz+ASF*<SqeiC=O?<u*&;
zo%Q^fkmd$$5{sEa#oWf?TvPF2v$+s#=X;5j)#h1O1C%jlk?`p59iQDgi}iF{R>XH=
zlTF%+6ytI7H3?J)TM$i9FPWyVp1G%sf(DW6Zyc;3L=BN1w(+Mr(kXsUr8kjSL~OPD
z^RWkWJP1881t0)8ozy=f8_%DOYb7!QW&Oe6Z+kM2I~ieA$yoyUHTt7$XK$&8qz&Ym
z8>?=Ygm+Q6_u;eJ_rqB+4G;BRU@1~*Y3zHkS8MPbAm(fA@*MGTr#=tLH3%820s^jc
z`V+13B1FEMZs-=GqgcO_w{T{_T~RSmx|kAit$&jf@e{<ddfezVA1Itd1E~&(isuaX
zi^qev?_zu*p*tUN$vq-vuwxErH}7oVvq(VBnf2iP2^#8sN1IO0MG&<9?t>Wrr*d>z
zIOO_*a(iR$0ar;qiQROfX%l_F{r=9N+%m#HtO<6E?3R3J9|@x6`NpF}7|5tfWD7T9
zgvCgikc*e}2tFyZs+kkOEA%E<J<Rt=QK&yw@jRt=8+GIlOUy+{7w)hpGP!@j>5*me
zwp&XfV&4wzkiSFs`HFdiL?6|)FU1GeR1N<3mbhboBt??5bg@)cswODVMUQ2C1S-1d
zsDeg9=UD$z4+rza|9mF$cu`(K<;)hQ%J@uofJW99I`4=PBd{ao^zf`5?AiEQTVe*F
zgJ_O!QaH}XUMV&YbW{=E^H8Ap!k(;iK$A)E6yHwX5F`k@lGI<Y%?f4mcQ)ANY6Q6y
zZ_X;LVJl%!Np*3Kj90nIEU+1?04Q=Gt_HJeBA<1)cX&)xsB4)}p8JVDK_m2!T|jTA
z&K){0T*LtLKgonQ;GdSwtxNx!Dp(hI;>Zl2`U%sG<WSDhDpt2%oc$M<+0l1J?#d%G
z%Q@We4UztSzj4S6PYrLtQ^B5!d(U|LT#%RU9Fihhq{8Km+C!kBr0VIJN6;5CFXi#3
zAPP8A=}rpZW@adBm;Y&89>FfY_VAt>d{=xY@9nuNCkWm28^2wdN6b|LFFTjHJKnv`
zr(#)_2U=a#L@?(T&!2DhoVPrn=GeZtjJ~)!9M>Lzlil)n>u||v2cd2xtR9tvCl#;8
z2MmINtx5?wS^}+#EG?DW$l-8&>LuRM>EaT5mtv$LAYwqD0q-W#fn8clUnqM5;hx+;
zo2y8|7YirqGHbtIBx`QT+1m4V{e~<R-|n%_2GQtkZ^%EyP}F%qNKu<ecqOnDQUm)h
zNM2D!^F@An^p}hfJBjrVmSQg?=Now}=QTOKtGWO#rzHyH=CTA6*)__^erU1rVJ{s2
z%x4jSJh|?0mmh}E8W@~yJ+q$PC!j0fPOliZ;e@MTc4YPLk5*0!>CA?T$Gm|NGHb^w
zz0IqYB-9lkCJ(JCPPEd@__9goe7tN#KoBzjh-{$#^j)d2K3)FqM>q|hzJgO3(F$0+
zZ#(`Nj4b!2|8dFA+vn-nxoz|d>g-scWDemm_>Xe@IMJbT^>~9~e;6uyar4ht<A^j^
zXgT^cI!;9)`mxnnp0Pz_j)Lw1%W&aSja<s9SE$AJc5)!4m^}CsGm0Wg$bmWS{LIsK
z%VSS;V|+Mnq5>DH*s2@S5ytNT3xy(4<nlk;UwOXYvSy&uh3L`cZS@c3&51rG^NXyd
z6WRQ9$F2~Xxo37QVI-mNo&u5|F&F%z(ZJd%(5iy<OY<J+y!!BF)XJL(1RD>mrS78z
zX^=e&REsb~sM4qqe<DTS10+;?Qt9<&3|9Z4HQI?8yGrT=JaIZyJ|@~DMnrLyx<|m#
zCo-iDZ5az@^#l>Kb#=$CvlTou%+Nt=0u|#Vz1s`G*FU8AKo)4Ue-?g6*Q4cuW+O_J
zV2=We1)~nw@%(bDiE$MLbABA0v{kI~UmC%4e;1~Zv%<D^{orhP!^mYmH0?0HjcGUq
zNPGAfKp{;bf~bv)tzT3diPvNKvk_Pc(CfGg;IpGKXw5{z*13SLmp%4K-RfDopd!x|
zbdj)5_Nb5ga*e%*J_HtQwo#!Z&#w(taZ-a#f{IE|(o4uKIdYqe%A4tpMJFbah(G0;
za)sodzB3Ta^~F=??X{53UyiiVl79TW*ZuCKbLt&Y8@h!4*hEQzxIEn*^P~~%CKq25
zl)1U|UsfU0w^`1ZI$Ra#eS)&4b+d)3W>Dl9qfSzU;u*P<>nX58AD+*j4^4L*Sg#aD
zWJtAz3+mYhTj7S4*$m|QDZ=?2{255ko6RrYA)t(}KTyn70Pu&kawmv6rTc|iw}smh
z(=&m&Bbgp3#hdm~*8RX+{l`c)LwA5*$FXS_xd{n2=s+QKuX;_S1VG5S!*f1RS6Dn@
z;z9mk57!{XWQn;hOjS8~6)U8gzCW4L{ay9xlptD_#JQ*ip~i^VW@yavA)$2tu8MC~
zwV`M~i4G->rNo_v!T7sguD1nqfxOxNh|pRkj#xA}@Z&=N`l>7XwJd^uK61w!DZA<3
zztR|cA<_}^#bs7oc2{@*kG?O`%lYhr-3>(uSh8AGLvybmJ$~I2k=Ni0%BEWn0=^g)
z7a_PKD4ZX<nh|&0)*<rlelXnK8}7~}E`o(<!f*H-QgMqmbR2Y!)IM1*(Y-F6=rcAU
zBh@>#vO}I2WIOMha%Z6Df4i?Uh_nQ3UaaD$7B+HvIg4wa=H)=0ubp{c1#ifk%z30<
zHn)hU&2r%Z0=xLi1=(6n9jFiaTds_VmY&HTR;zPJu(W7xflrEpZY}tQUyD-rhvXo&
zC)yY2ShwJ^8z*>%2-Ec+R@heq5M9^%=cq2yRgHpWH`d%)zqNPBY+V>SGH!+h*(BzK
z#}Lwtv#qmqR@dA9M9;eHz?mN6(Y(vp-*a&hc<=exuB-<_nT_Fv1buxAhpKhi7-DhJ
z<w*PzoeiZR=QfiVmf2&s-Khqm?GDITb-EpW(}Sf`9@wM8swao<bE0T>T)*+vJc25-
zB7mD#%g0C&8lqyP0ntko#%9(D8(l_omi0)jJopvZ#n6cn9(E>>1z=2abx!CL(J&q|
z7go70i=32M2`qT8vkjP-v&SS6MpIEP2vn&$M91t3t(TRK{v#u4LZ+&iA^&w2f#}zQ
zhTCEMkCaFP^iM^6!<9P2t~1xa|HF_#5*&dPyCK?Sc|g=Z$z(QdfE=Wa73+6ZWj_+}
zE(0g$19`pJS{YKtld}*5n_<s7T%kbnti`<pa%#*Z<G2Q972Ei6vF1KP)1Q4CQcxSX
zW#2gI+Zr}s&H0mj1c?TQ#M`Ho^Y&m18eLptT%>jznLOYD=U03E&(|9>Ij}|&fVUGl
zv3v~H91i~?5tFbOJ@Fo1HnLmA^LYKEp<-3EPvemOz9(f*_J96*r^)PGAY%F2&(0LS
zC)HdsrzEMW2@^g0Ae@uqfh&z?*uTgpr^Hl&64}@t%U8LL@l)YS*w31C6e#)n$QDH=
z$9OgPKE-<q-lq7>1VtqCIyWRKe03xbXl6P8ETCnM!N33=VYZ-<=N3rRh$ktcP|oJC
z?>G&-Ft0d##sX+pY}d+SxSa{KyM9-l-O(Qn%Sw{*n=44Z<uMh)Qle-J@QkB_O*`)A
zfgC90v&ARc4y!26+MvM*q;j_-b2R!;fkw@qRN+^JHMQ%d?vCAUSLR7<Cz3CS885K1
zB<*x6rQjEp+&)pX2_!Z}a?jvw8CV$A(>=7~b3Wv6*#Q<PvQ!L$hHU_MMqds>B{7-}
zX2XaYwhD|jdQx#&r6OZ`>vgl=+vB0P=l!YKHy8KCmgD#mrwak(VqIE=Ww4wZHyBg}
zjEp3v;Yc<#sXOo_d?_3Eya!3id5epeC~wtDPBNCSQgH6jzTQ0efcL<LQC^Bpu0_@3
zi5lTGJ?7cnqqUiRGtGz9KnS>>Ns-%lkEHIJF59#`_SdfgTtVt_p=|k_FQon}H7VEF
zkZ+Q!7iU~+-9zi6&BRYal4kgP|BzMiF^x|2cjj9Cuycw9(DJPk--SVgnp%ONrjb*%
zg7Mg&6G+oHW2PbcZR~o5h0Yy=?cTq?>EMf@e0VSYru%#dZA+rK{Kke9+yvL#c+e$M
zeGm#K{j#{h*IAO~k&<$KXiD}Y#35@*ovXBqq!$q@^ZKWo_mXhckQL`m01~P2Q@>Sb
zeA~p&j8G`2VJzOO7r?dX2lYJ~t=V<C^JboWS8~zTVaW%1!hmF0Sr8-F?0}8k?xs6g
zt7V2jj-eaDk7h&VTA&Na13Xk|!9U>Ix(-aUo*_Wai=?M1^F1DNSG6pPI+ZbaIs7Oj
zpu#FN%Ys74*BwS?Xpzk;0l=hAA0}@gy9ys1i&|lt5A2|)!XSxeFb?dP;HAp@l)ArU
z6|e#Kn}jEitd4*nk&}JdS_|1KTr#7lZXAj2Cp3fQm!8V&LX&=!#*ph6e@-aXK9>Ek
z55#gxiRl>DF6;lfD$-xJl}O6`Ukg=n>TK6lu8#9h({C#*-Fu`6*WFwY>{h&`3mTV-
z(Srt51FxFW^VL*yLtPHIVj<+8W=6xL{aI;*GI>;(3rZ+4T-D{}m;h&PJza#!qXzwn
z=5H~Q5hou+FKC%y-}S&x^;a@_Jh-9pUVBb|SWz$G+bu@X$$#ytxeq&RH=i(ap0SMi
zEYxFQrC%D8X`%N(BTRLK!Ae#B*UlkHCTBTcbb5@r856TP+;-zS#m63{WuRXZRegQB
zah<rDB5`U2K3Pk+2QRGb!+EfvIVoV5zFX{L41iUtvM)eeGbFntgI0G^@6)Zx$A=1O
zsnsYwEkz?>qiiw}+HBLF^P%G-TjCU%G3Ii$^e1NUtD$f|2fk>ZVO)Lh-ozeRPZH6n
z)~e+n*xO}ASi>Z(Tb~`Gz6oG6OU0hVKXO0+=`?wg%g?|epzG<y$6Hrep2c7!^Cv<x
z$=EU%@!-^8VRO{>O9<u`$Fj9e3W)-!bCOK?<0|T{!tKuXvPM`$oIlQJ^(Cy|Iq$DO
z2y0e|d%a3?)}swsw}0bG9F;_}PF8fq!iq;r?C8t2*C2HqBw+JNd}=%R5(U26eBUej
zW95|y^g1fJ16oh(F3&q720n~VF9+qEQO)+{J@y1kw@M3zkbM7R?&ex|z?>w69f{Mj
z87;4q0Ip(f<S$1}w&xeHP|O!nm5sPeod9ch?z@Dt=xnTW2txUL%E`X*%jqGjzxURl
zZN<R<;lmK4Bz}>~l=OQZ8M6$+cTr^b)nwDfc{x&AMwh0NXEFVoGX~x1Rd7#TF{Z)T
zNUgO7iBjeIFI*g8#@;(j1GP(o7F{!!V6uRxIXNUT6z^-NN|I)7-U7<VGN7Pu;i#QS
zz|&>9>rnf(#@97{Kjrya+*w~nzyF&jfC4@)?$(hE#BgK>j93)>c;0)qe-xDe)dc*z
zoE?F`5UaiLw>qP?PJaq_G}X}uPtAKdlJ3}?u_%1_WQ3BQ<OnIkRJ%({^rDT?1Xd=k
zyYzi501>m9wY_Dk_R3@j4Pbi4b{XAjnZaW#fBPmgH$G5tZV7LEG?9brY>eo)u!>xl
z6jlzXm3fL3tH>vOTidb$*#eP0IO9X5gbQ#`m<odi!|9Dm2pNQCJWm2+D`RW?V<2~9
zJ+nK9La9Hq9jFg!u-bzj%n3Pt)<-oU62IY=V2%kXVfr&)XW78qCHXXqNJOqk49$Af
z04pGFG|;$;hLecqH}FB{#T2S19r}lwH|pIFvOenmoeF#EuChMCtlDxP&nP}=Bxwz<
z$@yb2el%f;@nV1)K-tCXn8JBr{jY6r+4#QTZ}_F^Xi8}m$eZ4tx?Dm-k1`~P4xZGb
za&n|Q`M9bSz^mNmT5XQ5YkGYi-><NM<q673Fi2lg=^eIEk{s2h6FN$Y{9f9{SE_xA
z!WLkPQ<WSzjtCW7f2hD9m7Axq9fYaaV_Z3x70NnZLYL#oH7E`re3hE};7^{nBLCnp
zkN)GSZs;Bn!?m&NU4Eb<X|le%0?h^L)~28Wj`{@aT<1RzFVC;%M5gfS__}-W^Nc92
zDF4C-?MF6?{paBfd;DoEteeS|@r+$!M@->Jwz-Z4DV|q4RZIQ-Y2Ne3I@R_dup0Xu
zP^{>9HMT^_gNuQQc7)A(sxLL);YnE+A>9oJTi!SS4Iid1=KVMdj}ABw^a*e{L_l46
zrxzlav{8;|)i`gj7p?QuNn?GZCG9fDiMCz@B4!_jjYHfl<`613WXe#E=+`E)n8l{L
z(Fk=S%(Z!A5?Azou~y`B?d0WctZNMsWu-MFGn~c{0tb0E?l>m?NrTQa+&{1dqo*=>
zj-PTS9OCg7Q5e_2qRbC@_ncqi19O|_9lYo+Rb&Ib=bJc<$YNmTVXOE2@9-r=%9Eod
z1iE811k=Gx#R;hne+(?=t$SE0b&=U=O~hlgf)wRiRer|Gqp<u~5+Q{$(-fWO-UT<)
zS96SCYv5vnqc4hm-S=Ja?frp6*BgH_+^{PR+xJ1Tr+&&49{lJ^?obPvPgx}_79{^3
zZiuUNc<fvw^^aYURkN4;m|BrxkKrT&5AKOkNmu7Frb8L99j(Vh0Z*gGiC`0xXG<%=
zF<)>}7SCfZ&EU-H-ob-Wl7IHtUCy7OhaHS5_`muYm+7P;lv*Vlerez2ia;MCmZ&P&
zZqEV1?)^w@F=g(72&0`rTe6s8a>XQ59?o()qp@GHMf~lyIezbvZ?2R8M~l&0nXT@H
z=YHnu16>A+XJ4z++{Rr$t6j=Q9@(_XT6}r6$Mv-rlrDnRs4NExyuu%vOK5zBwts6p
zq-%Ij;_(1P_uTf+vyHGc<uH5GjsEPnrg5aT;zdta)hQr<O3Il481~Ljp;Gw>Y0acS
zU~`+|zXmb(%N1q*C=*7)g}+0vMQzPb@X+*XM8IN?<{V-fi^^$5bW#7^>?9*-VchRm
ze=8fgb?7<*YC63911NYQ5yru~dO%k1TOnfGkbW3NUzzkXlUF&8+7o@20(r&b=?>{u
z;HDCX4&ipYd+Y%HX$*MPY@cRbT3yA8I?@(l4<kf)_1Ved*h|sRBIb#^r*n*BK>=Lw
zZS)R@Sb6fz7I9$u0&<fBRZhMm<plDW`t(VIZ;c$^GI5Tg5ILI_T_YK9$rE|l+{5Lt
zqTP_vRwi<QyitQ_Q>B9*SIk|%x3Hdh6TgGVZ|MnC%>*s1-4qI_QQ|}dT&ijUh}z;i
z>km&n%58raf#CHJm4Z#uF1+2cVFRCm7A-_Sj()^^tu)fC!H(0E^|Mr#>%8}J8soCl
zausVJM~E&RKiFn#O-5MpjP;~-($_2=c9&hG<f#M01~Urt<yY#w$Ps<g^U%zF+O>y}
zmN@Q-6jhTy{7?|~+e}iY+H!mgpVVU{VPxLeBnxSvA&ZhIM5z8fuk8LxkCE_z+~9@K
zQ8r+4Os?_*HjmZWZIZDU;=q^gj36h}wK1q?F#pHVY?qs5b(bF%kv|~>YZBl_qvU)c
zBKd2HN%VMlA(sMN=s0Hg{-ANZ6i$<!-*-l4D17m?{`l^gYkzJ?|Cc0{EgN<?YY8Ec
zl0}G5dw7=PqOA2B=d;SE@BEvWbv#I(=(&2a{;pXWEk!3&C*=W2X08WW&q#5ucKk*%
zCDcbLr>;0#!99%PRok^C1AIK0cxsOhPhFt>@Ona4b6^7Eu@JcjInJmVt|7@g+CF!o
ztepU=h(Nuj`_Y-scDrOcbF^D&g?;I!?X!q%4f@cJv@0Hl^>Z<l|1kd+;6>V6=}`2|
z-54lEW;8y2rYft(5$gvgsG;#{@e{Pq*X>&{>d!B057{D7l-V28_F)VLlDMsWx|!hI
zJIob4mJd+xL=9)&h0UPlozXrt58n7TBf&<X(#{`EL8%_<pM3++%pWVIqd64au>l67
zbO9y<dzpro>=FAWy;Tdk%aIl{M$f3exSy4EWFEqcCFn^R7UL&75zBS!(WK)FMqN-N
zB=X(HQLrrBvoePcyeaea{N)95GfKWM4D_-Gqo=n^hQ>RARZkN(+G>2-kTPUDeUC|a
zSKEvO1?qS2*JFG!PgJpkL~M~F4JAF#LCUTGuYw8T<O1mB;lSlRJ<C8rMrcMX@IY<%
z!;h*Ddj7m+6PtTM^ogEoANw8}lYgp*vEny@+dO-_^8I-Yn+lw^|Hdy5$|fDp_gE?g
zMIkOKmXKO;F2Sm9sxcYmwL=2`;1fNb5bG^^3+pl{uSq{6G*Gi~Fv^-`>XOdlYbRLW
zRd8kga=_dG<TaPp59nJ-irOya!2$y7#|{U7tUPi?Kx6tV=zXTetoSgxnYNMO2&`Nu
zcrecpD4trwf5XviKHgXmE-8KL_1_pa_sBeQ-VU;rv`weQydb7z*l+9@4)^8AINj%h
z`d8S00t!xUXpNkXqj)R0CvWAzey&^S;=&&d#*RaIg)1?z8-HOid85#D0&B5$4FFtV
zwYg)faB9H}jQYG|(~VRVYOC;hgW8}pn(=yU7sxDPwJY9Vu|d6(ku(?SCG9OsE%Y1v
zv+1E{>F{h=JhPQhh4)~1+p>n(Z2Z8m^$q0neXt#eg_Z7x7r}e0iOc^7;6NY0CyFB?
zw%<+A<TR7qRQ6*}7x`PKuiBVg4_7Hn3Zz2j(L5nAl5{bn26sbacQsZsXk%BIH)+9S
zU0#6A+2n9U#EF~>vRx~}Ks<ul>G1LO;XK0YoJ}s#4_rf=M;ldG2t$t)VfcwA$TZHw
zpxznb6-bdAaw-WKZM|E-dWM7(_Ok9gENPBsNkb$Fx2$2%wR$w-;FL42VXy#p+&P?|
z+E6!&D-M%lUALw>VGOlQV0$|z+@GVV54{D;bbtTwlNQZ~b6@PHy4Qd)6S#3)8cE0E
zWefXPx%3db=9>u`?a{psFev_N2_Wn0Qh!4uZ66d7Ce57t;Wan;5-dkQEGA_uR7(cQ
zaTdk^0Ssrp*xk*MF9FRZzbRpgK+jA4O<rz?0hD(gjL`Aj-5k#n58WTux_q5lTd_9|
z#um#zEf|t;;bGOBo+TD+>g4q@B^u^hUTkmbOY#^a3~e-o3T8MtI?~dZRDfyQ@^Oz9
zjm@jR#DckEy6t|fXsO+xv5td2a>$KfiYi%?HT~|gYAWnk<!=)Gx$d=jE#p`)*Ycw0
zvS>HG>&?%&1nn{Mch8@^cW&=28A(7w0$Dql=kqn`8JCQ<-2h2YOn&9Lpr&akfq-`I
z=UTPq*(Z#8*cbwpF<Q=CIZ(zm%(j<{4`K6pa@xH12^%nvu~hcES+pB#il%<A?W;hI
zgJD!4A#0guiDV=oY*3v>IFZhioc0J`zk&I*czjs2bQ3Cg)`SCiWyq1yzH4?sL1R$w
zAwX4wh~=1^X<^ocCz{+UwkLCildJAH!fTK2HAByZIgzs1Vfj+*l0<_7>Min56Wox`
z!Pt*u(d1Zm%N;P`iocK{wV+zH3=Nm01zry7U~f|lk%f>y`Xm9N@8_+3El{d9(J&st
zTsS{gxOy?NrUjjkGkRMiCeLCcI2&@wZPyy~YY{`W`}qb4oR4GBFb8BAq-Wr|yylB#
z!aiXH<*@F7FJ!V3tNw+eBm9^gil#xkFiz04O<2HCT98vdRv&Ert)q)X?iu-I8G~lp
zagC}4)vBS7JiuK8Cd1A+LSndm0O2Hm53o`fS9hdVO;R+7@L<>m9ftAx`@msrNFMXC
z&gEk*D))*u(vk%(V0PuA3mP8oV6fdVxjEn5k=(06gGcD%@nPWPTEDmhqRs%VLk<x!
zq#hHIt;GlC4}sZ0Q<uB2uxgPrKr4FbhK&IT1;6km0}lC{WQv%Pbq=S!eNf{|z6<FC
zSS?#ybPcL+P=ykj7k3`KM)vkabOpc*0)m}vnj|6Ofn!_*BC0qyaH=nHW0WdnsPfNj
zH+lRjtzmK+rm_v1;~b3o5{s5oTnr8@9ArG_aN3Vk^AIRt)=&opYmP||gHnm{<Ts;X
z^SIpIrr)bY!ysRKPFgtlik`!Hg~Ql`m_H^Iv6^mjtddqo32^xOUmTQadJZU<t81gY
zL6ev4`uQY=_UK;abp<pL78no}6fD<*fP;=-Zh=rsz2Foc;j4f-Nv80ourkB9dO$-p
zUlMLGLGHZMqNVB42uV;t^L@vF)@WZP23^Rem&*_Oi1Q*<OY~?|G=Xxd2eV2hSdbVm
zo}VR2`*A9aIx(hR{x<{?<_>_!9S!*b0-+0=r<T}{W6{9S+dII*rF?M*(C;<7fZ|X^
zCDwPdyU{v;qV#Y!fgRZSlAM081`P?EnIEvgc^}W+z?$k_8*D>L7-Y$42e6fu4%hgC
zD7s-P+c~F@wTy!{3b~r`8YQ+$%N+nhp`e`wQ=KkG4K>xhMvMXs6_Wswc32au@-@N{
zw8qKb21DS_(bB_DS}@5`4bSxrt)AE4+M|2*UlA!2I6>%atFu%PdS?Q(E)Y(H3o=w?
zuR!zgX-7}KlbCjiOR_|>9{z@y0(uj3WqJ<4Tp4Ema6BqynQPQA)y1KI7kZF(eoSWd
z9I#-y*cqTJTDq7i-!i?BWM#mG4vuCp#EWK4wlN<!!V^Dd_Iw<m74<?|z+5hNO<FWC
zH0NkuzZ+!h=%<#LQNlTsc3?sjniP<8V|>&_gjdvu-hySn&d0H6DPJ&#MRObw*sxtH
z3F=Q%%Wq?ZCdT824lB=e@gkYy3^W&mBs%b)T=KUuqyvRT35KS7-3eS~+JTu~@Ua3j
z=*&z)OcF1c{aO6@uZuh2(Y>x<-kM7NSkYX&K_g!hQ0{_mCBvO7+T>JrM8`}ocydTq
za(*fo<x9{V2B}(;ZzR8SH57?*FH|=~QSu8f(5ByO36K!`j86HOZP4Y0_p+=W%s))$
z-3V>^y?*8_7I+w@WggXo=H+i8FSy2w$Xs==L7v0hvYf`uf^O(g<N-c~kkDx;;mHL%
zQ`LvwfeXQ8KG?$hy5<4hV@75K>+Ib{Jz)C1x`6RXV-Btn5{~3FNYI5sAPPK)&X2Q2
z`n`gaLAwpc$t7=RlM5OKP2!UxM{f1FAE#C2OWe>Hfyd}5(^~Jb^0|$W>ic>VD_8O*
z7R@caeG43BQeD8+=eMB|VdzjJye`e|_L7jm)<KpIQoDY$0h<0cMBQMrB*{T?vFImp
z${;2SNQp0e3>*Dk8)Q`IV3IxTopFKzaZ^CsNZi*(7yB{T^m{dESm#SmriDX2=N!(f
zasYI)+}fD=oNcWG!Rzn^kX#D`j?cx>O?9s;nw%GlUyy-=EzSAe-N={V5-Sm=#<)1$
z(z^Rtk6|*qToo5#P*cLhqR9uc+uMSLa<RP|=i^8OAO}}OVh9&j6P7sH(GotRLlpGP
zdCb-3e4L2}H?Soxv2gM~&m;3jeMu@UAv=?t5DrVlZh?sHorWng6vW5+$<|b0V$iw^
z)oyPK27SRf*z_-f!P&4P#hAlt^KO?CY;GiS%^8)><2TvqUt+*eK3%?>K}$E)b=AG1
z4F-+kunoz$1gyRUCg&CNY%p2iCZ6o7RkL8Bf2#=_w9+rm$?5kBAKvE1tXK?9U2NQ(
z{5_x^hNkgKhD5{Hi3ZJenk@DL)@RSh3E0%Vrs0SsSB_++w!PKMTb2NGH0}C)#bQs{
zYr-4?oE8`Z8qDSfTJbnfhS^BFphKtMEBwmk){gK;w>I<`fGAlaM%DOX^mMUErr)c}
zxx%Ww!}!<Ms01!cf&(UKRD~~e3SH|s5tCvtpAzb(=(4$R@Q=|vACOFzb7^RItm7E8
zir~avrUnjvXvbktcb;5Og7;Dl!!xCraXj%$!b`kH+^4eh&wDbvqvZgi)-2!7OH8@U
z5sPEyE}CNyK}a@yT+8o{UPukTh!_T#a#}iM;Pwx{EXdekY~C+^oAE-DXe+r9##P&G
zCuq<Yc2GCC*xT{_*4><Gk>tDdKGfLqzZU8V(%Uf+$Pd@VV?%}RIMiaI$(@;O_&ULm
zGR9-YM|YfQA#p3RM7YCYs!O(LZOD0%n!0-7Vbz_Ew3uK4ZCi`ipGE88JT&i9_c~1B
zp)NuBC@$^|tw6qjx-`_B@%*z<_iDg;YU{kki6+VE#k`KLx>paAMtBWFswtO1wR{Q8
zfMZP<%G2G2!$J4zIpF1Qjxj2Ac(Sj233~tGfg|@og8R%lntCCHBsrmcFqq4PwD@!3
zbn!t>YWS44^ZxGc>4jv`<o~%0b+K>~GMukT&zi6#Q^*7%NJI01)zHg1CZQkb4M~<S
z9J9LDk}xti$>Bkaqh7guH$lTujaHH#FEkjPey`vsVs8bG$2ly1uW?MpK{KW-$csk#
zKK))Xa~D>&7%VSgiHS=9hY{iu#Y@~(FIovZ{ay>k|H(T{!!E)!Hs!D32MntPFF(4U
z8;tkq_X?*A2e!OmIFl(F;lM@}MB-NY=QYRk`KCRvjw2|j7Nr2^>tsTO^aby#>|hs{
z;q!F<;eyt2ELgVH^&blwN^$4kEwCR47!v+h`D3B#UAR}Ysz~A?8()HSck$u0A7=rx
z(|CS-M>}Wed!XllEVv;q48vtL*dkSgwi4wl$W-&WpsNS<92m}H5!1=xhi7XYg68FW
zwvj31=FhYIK6S5{krDD3Ih}JcGp@%Nq5@kM*T-zO^NM$;@D*q^4to|%!(0^mNV+jl
zvZ3O4Ud!)6HS}`of?a|GUqorcEJ>6xhmZx1OczF;JyJuDD6$VAoXl3QJm4gbmeqqi
z_`*KDKe|_sj`8Frn*tRom)SZ;O#UG{L&2$s^Ky4r-RpuTJ8$(unsCt8T-@D}X9?8h
zUUnR$$?zDn`5WqdZTN}=%r-km)3c<E<_Gz5viSX?dmTz06vGp!SByA4M<ZV%8AW;w
z%{wGH=7RHZ+iXw;26+3Q?|`U$iL5&bTS37G*KBniqB*&|GaPB4X7lH6VExg(LPjMg
z@+gfq^i&uQuYO4sIV?&m+GN~$Wu-sD*A>h+J16rST0LhBdt^V3+$ljK6S-B>l2Kt$
z55_Pwd7XavavX!D*^lGl?j%18iS@!M01hN*2ERS{`*S$0<K&JRv16V0)=jk!*2@?X
z8#=<ubW!Z<iFF){=2KdJn}tKS?Kxbeq!BaF(Y6JivIiSb4yGB}!_iEC?itq~-Rl4Y
zF)qRPsN63#D%j5>r<1=69J-H7D?M>;Ux89{c&m8_pBek%s)WgMgv$4nJFcCdTuJBl
zO)v+s;o@Ux(bC0?w4T`8Crev$MM(uZ@)>7+)nr3E@P!5cfpW7bwYLwN2!~-7aLwwg
zezHRJEoo$tJua!h#r7s&f??pWI!f{<I$O;5Uws&6yAX#5_XQV}l`k=1D2}fFB?b-S
z49?NK-fumpDmNv#?7A4y!!j#loQH$?B!-HgUpZNg)ht>I%du?0VEB3grrfKSvwsYd
zfUkWE_Im3OmVw@uU?N>K|MX1i)u3V2&ocMH!cDKd6F6$sI@%HBe+&^xSbkiQgMY|Q
z;Q8+__FGo1+6aO@M&Q8hB`sbNsB)uu9cfO>=f2oIvnC846h&sF9wlYV1!aehh%plg
zgV`>Ao0fzznO<%&IW|yaw7u&C&0)$U3f^#rJV)z~a3IM_l*nAdI61>gUu<Vw?ZZw4
z9oIKAK>MS6{qYShdaL@gXzu3ZdUUT<{>0c|^oo(N@Bm(@R|G2XbwFR!MG*AJUVjWU
z_*Y>JgM-=A!o9);saGc-R>Jm+c(Ukx9J%SnP%_wNK~89I958LUNyILBFec%iqj5lv
z97+<PqO-#XpB5JYbpC{Zo_&}>oqMzN!nj0sn?wp=6XZ{|QdG$#<r2b3lrbYcomXjl
z(YQp83amW2;t*BEML#KMX#Fghn}dAd9E~}SoLLU(1q?p2jZ69$43cEW%My_^A(Z2e
zv|cpF5iq$=V81#FC<~_$BT{1+4n_=-JytaKqGw5#zdm|<GPKdzPKxzkP(ok=U5lVY
z&%2U)<yiu=TKO<?=M)&SXR}J+?=eOr3}W_Nt=TKj5(&P&9Lp}X*sVid{zAWpz{!ac
z;C6Gq0qQ(U4B8{XU>;!LV!3c9>UDY!gds&3&3n<<s-ahH3_g)4!J(t^{3xl$bAV_m
zy4AnL!r=})ha>mu>d+43U7;0v318)=g&d;xI$Sr-4-*=`3R;BvM;501sm)4J-S7cJ
z<G0*<7rhU?vLB}<^g&`gWyQ%ct#j)ax`IFhVLUFR1?Onmk0bF2Ce+9Ahn8xlC;=^w
zwg^xQ5}RE7HumF04B?R|xge0MMjkEys&vefhhZx8sOOn*(|#O)p_LAU7+g2zviOV0
zCmo}qJZ5a9^E%F>dxZ;~gH%6Y>WQ~)RG2>zoE%)B98jP*f03$tUC?BW+uGs+he+vs
zl}z1hfT>hN%bk3l+LkZ~rVbwcaq{L}xG1eq_iEAVI*w<8)nVv%4#t}BXn?N1dC=9a
zSwR<qA4Et<hjGK7qiIdpg25ihMtBwtH{dy1)pIhBK<7gXMk|XL{vQ=1CfXR9a4w?n
zkL-1TNs2h)xRe%89iSCZL1<Y)``^WHn=>sW5{~e~b6|a<jb0^Lbr4_l!8=_f0-ZB0
zKpi8jlF+<ZurbIW2Q=Ve)O#)$IgaXHv*f07amklK1Rh$kx>t;uLkn?0IB_v|y?4$N
z#!2B($gGg8Em}38RfsTP&zjHsgnMTl$6@M0L|aD&F}?^Dkij7g3Zn*nzTdjmaV%IV
zR%gDVq40Q)#<)Zd5V^oGa~(;qUzQ0nIt=X0@G$ik#B$fT#Gs{S?NSynxhgKWpiZrt
ztVCSSa4m<qYqGy>G_^zSfqSQoJ0PCHsaOr`zQUJ9@*K(G><)lAObW2BLu_6yz{tG@
zv>Ab2!n|8MCNO{D^mGYHKE_0yH=Ig5r{t?eYiS+2YvJ+*sQ~U@J92PP$SUzIjoHZN
zIxV2M8)jX=&+XiU7_-#bk^`q^Ip<*wB&YroD@d4((Z3jWEr<8{I7u{-vvw-`T7rcv
z5#AW8XQPFXT*a)phLLIKEIpbqwRk$w8Yt!^5;Ab*VqC1i<%bc1P#MFsQPHS<nIZrQ
z9;8<e|1zIna)MTr5wdWp*%Wob!}yLHJk_i<v_xV?8XU}9Ti|emSJ)Uyrtj<3%cN=z
zUVkICf@m!+9`PBvScGO7#KRSwcKN|w4c#)BsN$ou->z0kgItB&1ZA^}cj?*YhuBN*
zZ}?P57-?hlffrFdE%NTs5pjX%S&l{x3?>^1xm2*)u2B>it}#va%DE^H?HpQaw`hyl
z<Qv?@_!@y@*DyTk<z+(s1Tmb=RAJ*NUv*4tt`~YMfz!5O)POOw9<ypgwQU}N!;Cw~
zJ1d&WE)Fq2;}o30@`w78T(;k?el^rWU}}hdpnBfyCvc2YQicdZUX_b;G~gr3C<)v%
z<TkBbG_%7JQg4J7N*VUlJ``_9uYk1gXaN~c!Bv*i&BxQ)4k#21H6FTpw_HFd<zm{Y
zhjiz{23*iOOMu<w{;^64sN$2dX<r?L2P6fO`=GD)9PUxW4!?UhTuY%+>&>`m4LCG{
zV`7Np<mV=^aPoLke+)Z{5~<gOLGvz8IR6Fm6kddqIyVRoF5rR^8^pu-p^u-aj`f~!
zFkZenGsEopgYkGmtlTlL!1l#K*#^jhSLtr9gutFZi`Ld5B@5iexK0#NpZl(34o}0B
zIY~HNUoM~m5sVzE7(fBZ%_(;;aO@%O6%=qC#c=#j^D+zS(hgM;7-aYxIM#T)T;#Iy
z(lA#07;n-~u7ZyR(T>pJ(`tT-r&S&_EyC!pWC;2fL%9a#4-@V~O^<-@6pfR(N{B8>
z=qD#}L2cD!Ku9DdSc+Y)V7%7zr4n@%*MgSnQVLn%E+{_Ggir8L;V|yUP#(cGp;7&U
z^P60A4o$Go@?D?>jf?;n#=Rz=C;8>R1D>o|2mei1&xtVf3@h{8;B`5gky@)Yn_q`_
z>>-AP9q5HrRnQWtX9Jg<EkCY!;p%pcda8_=4y7Ik^M9@SeQ1Z!;YkGtc1#dDcg7bu
zo+=ZsNtT}HzO!)cYJj=GkyU}uPe3PeuCCQ$%LcuIC~gSm9R{jjz$vQ&R~mS~Vn%r`
ztEGDfbK5bD60hUj@)ix!&%TSW6@eHF+(KQf3E(8*(biQ1#ui<q2vZ<y;9^)B<rX}s
zpD*^EI>Ux9hhZ|Zo9mE3Em1W3b<odHQXOq{7jU#qGH5BUr;3F`&&CB@e1i7W2E&Gv
zIxQok^A{Q)!_Xm*vG6zFE@?($-~!xl?TujZrYz<NZ&rQ6D8(T-3X9Ds#GNIfgeOs<
zbLC>3j^MHGGvOknhlb9yXfdBx;{{E<lN?l!67V6_55**07{J|n#R7`3^FBAl5j2`7
zS-8c9>c@%~E*h@{Po3+NTt=aR;Fd@;r<sySMuH(KFol!LAo%mvLy1#qU2otZV=!^w
zf(JLwi?^v-S&7;)b_qonjQX=iJeY);OG1$lLP388r^O$O2CrvZw6k#SVl=$K=|uAa
zR~&ez%BMra+Fy;hAwwgXFm5EllKKLTBh4$ud&sE|2dKwJV#*s5id~qnjH~zR*G*jt
zMof-r5e`lg_R#G9^RohUix;{}fuk-3{t^;KLJ^o!T+Yl6BLlfHAe2h(+`3iZl&wXX
z2?mIv!A{7qwSJ7jk!(vM2eh-@@cMa@wK%(a!}wfTuGQ4iJnBsn3d+8#34?TRUS@xy
zXiV}<^22(=M516nU5hZ%AJK*6c;^LPQ0E#&8#q{KB>U|Q9wY%5QS_sll@})8CJH8e
zIchc%CdkqvxJ3+&fOGA|yHwfifWyQm%tet%d5u*Z+9m>~2Vr#kO=whRKM%&DB#6&o
zz!~ju1qYEp!U9dMr}LV!z_Fpnpw$?S;m`tyeD`7}Jj&TDp%JEHKo^qH9h>a8%Nb^?
zFfD|B@Z!vTl(RnuTpqH6p^&w<JRiK^P`xMucvDa-da88TbhkJR^1C-SAr14*kwvyK
z(fUG$FK9ef2HdEZBPUq}0Rs=3=r-ml-YgZewFO6*1V1R>p>$zr9B{bM%%C$szVO9u
zUX`syArONUU`HOB9kYWQ0Rojc=v*j0F5tYv)inBi(U2>D@T4=-R|csoaeK?q<KHlF
zDxe*3@*bhb4^{s3MPLL!F*z)uu1c<)n<`;05UGFwng)v8(NJX5*MMeLGzZ86h0^-s
zWvZpUMZ@V~v)2VK=8Jt^^;D5OWDL3Nuucoze!JpOa)M137=fEGv+`5{9CGrEN$0*U
zapu6o2#GL?>K8ZAqoVDy{L&Dbp*K(RVLJ+0(!DGJ7y?6CGdH}x+Q+VNixTI@iq|h%
zmjrL>XfYioz?N2$6FV;zQ+1)(52KjYE++GNH-)sQRAcB4g3TV6rnAxdBKr;VV0&^G
z<-$ivJIrOA<czq5(9lzCu#!<lgI?J|A9Rx>G}<c#G>J5n4D%|btzW|cX4Ht}I4w8K
zLsM^ihfgE1Si(Ga>uX%)^oHp@jJUDOZ%VI?=JtS-+a==~DvJU9g9l>@NcR1?>6hTC
zUIoG!51(YYUZbyzJf<RCcL{E`UKY&75#1<Qv3SA0%>~Xq<MdA9>htT+$|G+Qtqc-N
zJL{2)E(8$AAVMTCI=0z^oxT1z`Dz{(nV3!nzTMskvV<C3!7ww%m#delQ_oS=%46`~
z$CSjZOei3Hf~E<kK{v5O=h$;hCqhVsfz^`rFDnznmocmx^%~c1ZUoiTLKT3Ihkk$p
zd!EHmy!e97x-nuq-&_e@dyp*}YOVH0uy7^b#I>rbg#kpZ0dct;nlUd^Tp<1q5Y8l@
zpsT-tOIn;XXrZ^I-N(Y^i*{B_@zI?CBaP8NSkR5^7PhuS;yY4h2{ZFeg7*k(S2*NB
zCY`is&7B(o3mV;);Ac<}VRku<eOP{7fww}h5)wAaj@+@>6$i<4oeNy<Nxoc#7nb31
z;#cdVLoK=hpR*CQpQ5RE8^%|Z8Zb6V;-fTE68VedA$M{ap4|Do<p;e|<n`syXn=?5
zMz*fX!1LoBb~rKJ<dfccz3*U@1;Z5tMpio?zhXh!AeVt3ZLjAkf>&*=z(r(JaPspQ
zT)Eg14Ll_B;Bl%uUzy%%4amVxS*`>5jnUgtHIhxHgo~-CfT1oIbf$N#0U?BJ@<&Q+
zAX&$1Ow=*%1SV)njvk-RBQfu^vW%SEWByr!Te+W0C4PmWRcTEw-v*lJ0*!^`2`9(Y
zXNcG=WGfz=Y%f}pF=v)*rS`#)O6U%;z|uo9*d+P8VCG^xHv_})9o-0mgBi&Qjme8?
z;s>svW|_x8hMSeC+FE$C#Nic`i}S1BYlp8U*Z_&JV>s_y#8@Q#cm}U7Gqo4E*e)#U
zFox;*b(lC?eHkN8s&zw>xDUPm1>=T`xhsy)sMt4fsKPG87z|#<Jm?F&*#QKh6uQ7h
z+0*2AkXXRLu|h{C5z@^e=Gg*-NkXZFT%dSpYflcMT9g<3Fqpc5%hX{zRCq>)6Kk>6
zP;>|s41tp$9WkomoE7trxE63I{$L1U?@O{QXkeyLYs0*y5RWHY2-=($C|?DCEOLcr
zmuCF(*~vvOH{S4CzK~&i&vAhh4ae|eh+*MSf4+e0?0*OW(jy5UBmr7f0Rb8d=)MPq
zit64u-XpFZa2YiOTz91#eawRfp8#lGZ-REOPP6_CbATiPLvU0OPud$nq6zt$7z8gT
zway(rf>T~)qTvYXORQqy>P`0QRa=YR6~sijg4hQcU|wdBzeq;%F6kI(kc*d@*qDRX
z4OtLA<KrzvM}VjEuo9Is?nYDSgHHMay@-xs6g-_J7z0K`G(=~Z^p!5!h6RnIz6@N)
zL^%8FEMAKj8Vj%5+Wr+A`goCc1u)`PLXT)2K5X!TmE7d!+qH)rwrJjZ{Qp?tVz~Ns
zoc1LFc}7P*`lpi7MT5opyvuRww88it?t?hTeMyK_JO1t?s$4XF^3lAUCUV6l_ZU{5
z;%Q~sp>3sru9Xb4#g(jup;ztsW7c<ZhE3C1^gc+2Dt9@ATXA7)VcX?Ph0T8o7sEOQ
zPhC_T%uL`0iC$%Ee2~B3dN|ryAb5-y?5U5mQ4u(a86<&?m|MQusG!vdB@4OgYm7Is
zN}RJbBu|tuEK3|zYA=>GO2bVNsxCqGH#tJ&Yz>1}!fJqH;0hwn3%IKN2sug!24kHl
zXP7BDwJ(?z6%=Ltn6G*BE*sks;5Ud~3%O-dwc1+X;SPtPoJ7*$+%_IPXL?4XA3+Wd
z1V<jG=Vs$27-S;ylO(}^LeRr)p0sCK(A<zU$aZgWts|rcQ85N5)c)wAPvN|-%mT4y
zf-<JN60C7{`$B-2;1~=Gjh-*!+NAS(3>-RInprCrE%tnIMkn?G!Ri@2VhV8MH)9J0
zt`_vY!<-g_oiFxX(mo)I28w@qmj*6fj2IBOIb|c@Yz(qi<e*B+6kxPP2$V<Y)UHS|
zN^2v0Vo=DIWIyMXX$KryZDCl@(z)k?z_AYq_9ml?qhNN);z280u3|63H?QTJBRXjt
zkVV5Bl!f^=aQR|bE-GkDxMVfTX^Bo#4BED-c>^Pk%U%xEc5cHge=cJcSUpv_J!2ex
zUJLV$vm13u2%Lhua6<5^txaFZ0OSfnO$jnnn<HdsHZxp)Br@_h>15V{g7QbE*77jE
zK}mkiCYwY|H6}2O<)SmxXR6>vW(to{P_rT0C>m}O7&sG<j$Li@tSUIP0M!IrLugj~
zG7DAU26YwC4|_2RQsDAaP;;PvC4zudS5}}k2F!5s#l!|Vq2-LeK`UA<v~ZH9F1?c$
zuUw@hdGabjLb{gWGncD3%syr$AqbVLM*_o=E(DW4lUFfl#rfqnw{X>6XpMZP3JzXO
z4qmA+AZXo+{2)bxK>|odOtLzME2@ICXr)>fXN7CwqSWgjZS5Ei3d#@dehD&q8$1Nu
zN%9vN^Wjs!c$q~<_*gV}&DmdP;rdPIiZAq$tQca0k_*~Xx@|{r&~ibJH?(9IIx%0S
zktAwmt!8+F)Wv~h;6d?#*#`lVstdfC0paq)q=><ZdHeG)%zT*2V;bO%9Ml(PKn4wg
ziT!mJuHN(k`J%H*;bj76(<qlj_GV$iE7>7|0AYq{pBJ}z;jq#LZt3b>@G@FuF7Ud>
znZqDW{!s9z5Kb9l1!oto!=Y;b%vCrH+8=E#(AsG8hBTl>D{T@u*hZCrvCf!`c9D@h
z+S>BvgQPZ+@}rL<Sf_XNjG~q(LDQHFc#|uuwpQSv!Gt(iZUu=SmZ4__hJ+;}+y$+4
zaYR?GEW>wQF3~n7)1}3_OkglI8|-Q<{idE)Sy{Gl7zJkIOoJDYm0aLytO7R)OfQs}
z4@p%q`woWeey{);ezF%QbY-j}OQE-lu|&9K{Ic(WhiMYv+GUkq?7PYg2m=8Uc!vUY
zj9*DHIin?9@-Ve8=aZOFw|)*WizYe3H%@HAg`4IMU(Gyq*>JU?Pr&)O6lH2JC|bg{
zK#qc&?6q;AI^s*zAn}RV7WSN(6(ml9utR?0O`Q2?YcXdBMsJu2fL^<3!%R6qLCKe4
z^?hUf;~Oi>8L8cv%p#|8uw3-O!<4>}1<C)qIK|rZg2O<rh@n1CqF57W`mdocM|;p<
zI&UN$jb3mD4MnGgd9ZL7LsSG#Ye0BS7|r4eEI^x0UeSi#h71;#@E2XZzOe>`vEp*O
zG}zy?nwA<6ymvny)zG|Nbj10lY%QdcnA{sW1`j%$BEVW3^V?HG2gr>mppmVOL*nO0
zKSEpf9q?qk$-8XwBWt+uCh+Q38zp*x#1G~JaIr{JY!uK$EJ>>mU>BbQ?l5?G#I+Vp
zF1u7rACQ5=6#H@o=e71ahG<D#H;Tu-&I=C{qPoK#DNx>po9p$_)_y~42JOcRCppUv
zT%2*OO9A6xhIp`9IZlEDE5r$sN5d}U0#3EH5;-UMR3Oi5b@k{-m~t+upQH{LJ9=@d
zbXDwQ;IUjna(u}SvlXuN1uYP!?syof*Bd&sQ?PI0pd7T{&f>{gcCqjJWNV=_l3gxW
zD7q+@re#nq8Pl&KEYmKo*G{$;he{ttgqRMzj2(f+AF72YGsLU7w$lR}=@jl;6j+;E
zlvE%h5X8jlFzxpoE;u#8HfTfkYNKca7qJB|;QVvFrg8gJbV%nJAUyY-LmvW!?x=p9
z-#<aMwSYtSSr|OPI`&!c68JuhL4gm#g@Q3Sb#21D7`Y!Xu}Go^Q{c*9a7dFZ41*A}
z#2Dwdd2n=Xa_uu((IMgrWy$ZLacyu@MnQ}w*++Ps_S2sZ;g7DcSm`jNTo?r;>$spC
zbOER1ek@wemhoHR&?J2USD%%c5x8cg{E~rpGo&VeL8@Phym(19Q@U_M2x?oq!i8w=
zpC2opyn-7%dcn0Uxnc)F<uI0MxnH4M!~kK;zK%D+O7Ln1XW$@$w!y<hgIno^uU??G
zR(4&0zbOv=T6AX7Q?@{T9V6Jly0nWUI!tlx#Dj%voD)_o9PAP<Qj*{~siQ+z=Z8H(
zgUIf$MrDpR-%%ohms-Bi4hOHJItT}`R1DLvb3sdU0MQW|wY6|L$N}*KTE>hD0rHCi
z=VnNe&;xOCL{nO8(PpRcQ+u^=?Sich)3?@PPsxXYi&?8~8MRd<c!383dZ?eykJFu?
zzO@Dp3JV(=Su~$6bYj8l95IJ18S;?~vxmIQBt#3nWOnE?Q9JBIxWGYT7SE@&)C(tE
zN#VjjGXy<V5Ph{M0WI>^b<m0*;itT0Q04u?r#%E7Dh95>;MAVb2CtTj(X@!dm1&oV
zNM4l3geae*sarr?0wZEbd?6aRNVo!hYb{!grv2{63Wov57jWz@^mPyq9u+g#VlO;S
zfnP={F^#sdo42Xmg$52yTy|wzG}JXN(6k0r5!_)gVZtBWY@FE;qKqQ|&5ZdX5DTmU
z;moY)N``JQtdUql<);s`huqTnOg%8ARNW<vz(Q|6oaVdf_e)=4P;+s3aZSDZ30_oU
zg>Vgyv3?qgS+ow@=!*>K(bi%wmyQO32)%B#e5Py!@MY+mbZ~08pld@^y^2M{{H<l*
zS-9RW)=DI=0$mdf=wrsuYfB|t4z7s$6o`O+<1HSd5-S!CLl`Z?XwZDUS(%Zs3asZq
zW>k4+wbfvj3NB&TKlnQOBW{+8#wrudV?1cI`(VOBK766v3XxuL&=U^h0XQEn!^-{e
z=qN*d-s9D-qid6aE3U6|NhV%}P4UHz5Xq~QUeR|~Mw4ABwoKxNf113;DuLp~9A5eR
zDz9SDYHzkWxx(dibE-Vr+VTb4vW}5yvNf_D*Nh%wNh8q|j+w^sLa`qbE6Wy6?)arM
z)Z%rHS3bg{8@3!`;5y(p-*UB85>(MJ626y@FX9E-bi+1qDV3#uXYf#IxcPQGRoqAz
z9nx}HGK-~h2i=cpmxG?W5dVavr;0_3%S@SXaOLJkNE)j=S1TIFz|2`ehb&YK!3a=9
z;DWk9W2};(CaS&!jFz!Yz3^vDn70D;7)D^<<ahL~ZL!K9C*Ld#Q%if9Crmue=&Hfo
zzYA4Bn7*|JF5@%W+uY(|tic7IR~fcMMh(_RlDd|>%o~m<Vkh`&%KMaH^8zhUV?N<Z
zvvSZM3m!x}7yN1FJRmgkHE`Srk@7ORHsB~94oeQB#&15J&I7V&A+6(GEnM_hzb>m_
zvcZ}FL%1@!Y;7A*ge3z;62mSeT^Mc!)z&U>CEL-|KUO@PsTX*hg6bfLL`4^@N-}ke
zF}FJRKBkEFn>mSaO?ti^L=^aLP;Z2275fR=%`T@&A9kHr>~LmxVTy9gNyI17h(r)(
zg7dJ03^0%_4QcxgCst;AA@O>BZW#@035WFD-%tUnt<CUtg!~QDj#7_H&ob=Pu@7J!
z7j7!cp{N_SL4ym{!uT0DcjaOc3Qv^^Rb7GIaA>oRHNt3!wh|l^yX3a%qSPCTo+=X!
z?qP9>q77ViH?s>vnNA1|>VJm`c(RpEKAF&=HXQIIF^AdZ#UWN`gfP)+%&Wtsfs4go
z3<?QlD)!-0At`@}UABbjB9?$2i6)A8=={BDe+Y$&{fUPBb#=p@a1y0mOo$6*W<Y3D
zOyE_ZwKhAUf8pQ2MLLZsa`hstt;~QdTD246Ryd3Wx`6X6WFwl4l6O>xk*MY}hs6;3
z*D#AOh6`PEP;ITi`8I5D<)T6Oy3Qqmd4T*)U_6m;Cgy}n6<ou7*#?_-iT`q1Y<a;E
z$W<XbCC_x_2u@XS3z{v4{#fD4)tOnT*so{_g*it@hgh~$JNoEhP7hmgNSrR<RIzW-
zBtA&?*IBq6ZcdfTQw4HC3GAvY(FA89%ZZH>4xS(l;~?Wj?X~K$vcTC1tQHMpDM#zd
zDH;{~(3m3L3g{59O6C03@v|^l*GY7g>P6t!RI$IHv6Jbkn;W=RZnyyTt<7H*^8zEL
z=c1Y2Tjj7Hx~5dSgziYWF5om)v1p09h7a>#;hy<-r*M<4^|0WPgi`)*sA<tQ!HFS-
zaRbSbdQ)?1WNQsv&!*J7prH<YgQjlSn5OaxqG6%ZZ0lr(r;L0vgnp<OUZBwpd&0>H
zS--JH1`nL=1)lOMZg9{bGJMOf*ia>7U;-u+jd40RVP+$*GU3p4V7q!3JYR2mmP4a!
zQ@|O8KR6;zF#YWaYrWh_6;`u#O4d%`x|%jwwC?Nj>nz;Ww4<QfTDe1;#OA2rMKp1l
z&d>-0O^k?)=&6U%!v!3BmM2=O(RN!baPG=sGIX5>1aU}`dnQ)6N|<>-X=o6N!w>Tq
z40iM5<~$(6VIX{7s)Z8|<7RG%{m$8iaz>*eN1_8vy`P^>qFR`eNZ=sB1!^`I8iYPa
z7f!e~=hQq=^u((eq<w*>Q^t~)Tq;*M_DOuZIL~3cC+5xcSpAixJ#<bPvvARc<;<LT
zC80WefkzdbM3B&kcv<kRHzQcVFmfL&rY;4^H^YUbBRUnqt!Spw`(uTJ4gUq4r`i>>
zhfvV-Fwt8qj(rCi@R{0%LdgZ3x?wM9(JCxfxOAgeiPYBCiew|gH3PPYi*mRQ6&?=h
z;pcaO#u^Z+cWF!qhVI5XkN^*oVKf6~NF2{km8jZU_{*UaX#B|LiYak5$!vWeb96pU
zhUZ0@_-Jdtp~bXhBo;2Fi!(Ypx?zuqJ-~+qNxH3D$n6wI8$E0bFj3>?>!};Ih0Bz7
zf0E^i)?&IKI-*lIYzbXkNTaI=^P^@uS-xP@2?Z>CGcb(!9L>`W+rSm%I+l5`c<p9Z
zVtll<6(bkmz#fp0fUhy{5^8<9TIIaN?z`v@h$^jJ;IeG!h4C|ZvNtbyoapI<5a9_g
zD@6_(^m&*gGsq@Mvi-;Zt{1$1^wSAp!eRQt5{VhS)Y^qkEPA>&$tSB$J`QHx%eJ$;
ziu@%CZ0d$7%BQA&cD+Wgu1yxLG{1a13x`1v7jWzYk{5;68v*q(l*N;(W0E>7(=m0g
zU2tO2YafvOIk4hD_JfAZMaheTYr@J*NP;dhuIL%7^x=96muC5MEe99BB82RyDSNnK
zr;DW$G*+=_GiQ7h9R{x4R3~E~TbnVQy_GCmp_OjSckrYhmLRBV+~nplOtyByNlv?V
zs4aLmvz+3itwkvw_9_u$5(3Je=F{~QLI!gTQEI%|<&U)X#{xHuGwipUct!Tg)wk0O
zXc(R#vkTzW*9mcOmaVcQ5hvCQ?N1EMfGk{y>#1V!(6M)MMhBfT=DNfoa(s;W77{9$
zL&c-X3bzsltktWP!YN}GF87-3sbcYJzwkARVfFzPgzfO`gjCr^?Hxi`dCih-HFU}h
zsZKh>i|hk3a8P%fY<Z#$BfoHg<{3p7567Pr3kGDh<-U{rAYnjh$E?ze=KUCTdV7Gg
zv4iHp4{^6$nZplpw9sI>{LM~yw6*ms!X!8MR5SF0My?V^TO}IhBGeu?&OcFoYgaf-
ztg@$y!9)Ij^Xuk3AWTk^V>;pgl*Q{CW1bzHJ95nBDkX^=2Lwm-mgN)5VvTOe%`pzF
zpv?lTpTD63qMj;HQ4H&3D9T;3-wwlaWP_G5)uZ-y9vMZRDi8%=tSe?@$5z)ka}>^p
zHITy$vI{)UF2rzEOu!r0Of&wO7}*Be7~ZuRu8kKLP}13j7R@I!py$U5hdby3&OhG{
z-Bf*y0!nEa-i{gBP5$w4`)}^Xi6^SIc7>DgSnQ2p@nA@QfyarcJ;W}jFbdjE4y?(a
z!dkqIwb?PWE?iW&V$zAIM1v(rYG!)-3fFIZ{Gw`W<pOGGZEz^f$Tm+4OC`4t45{D=
zRMU;8e|*HXD_r$v0_%bXO~lQ&Q-2ls>S1!T1bwZ4vpz))3P%|J10i4JTZ#TE7B1Ue
z{$s(zF@DZ{$46TmzGNLhgN+F_soA1T{ensF*aL8yZT^B1Q*G@6Cn?G5pK0*!#-K!M
zYb6wc_jZ%?poLs4^U!icryMNlWHH@jKvP?5;Gk1n6#Ek|LG606GBYd7eR%bu<~fXo
z=i8LyyJ7qpcw<PLFC_FaYhl@<)wE94v~cCd&Lw6}?vNka>lkBRQ^;0fF<hG({vpN-
zxO0U?%yV+bge$Sw>~+C&>88y#PTyKgszsl03zAOOYAR~z+6fq~l+g%Y^Uak&<66Q+
z0StMzIW1@s9bTc$Sj81M+xsE1ur5*92*^o-10j%aYOk>{RxxNfg}m;&30JOe1f#8O
zh#OD|X(=}AR)fn4jv%mi#xZ>{_bX0ut%2({&|J`bz3DrOg;U0I&3>roNB`^c?V#*~
z{}5WqO1L>Ri%uD{XmR19S2$Ul7b~-ntwr-QT<IhF<x95{z%j!XEgvudyE3$lMcG<|
zRxrfIt`q|oy}NLgh=q!Mtj7d8OjfJhwYHh0O8D#1^MU$ZiWf(8QN=!HN~YZ9j0$}j
zd<;!j9DfssI=w_P7Z=df)^-RhP?(XQ=UlY)yE@wTF|aPlN#`!YOloTl8V0#6UA7j^
zl^ZVl(bf*%{+u(EY4XmZ9U3ZOZ3ojX2^mHr=L?BNtm=ks(R@qGzB6zbfqAjbD;4`7
z7>AP*n4`r53l3ii6Wy@gvpjNfMpu>W8#uUO*`d`2Ej>~6DVnO_&_`Qf`O!-$Ru>Ik
zAAZ&F1A*`VO@*sc1-HO;w|0gayy>lZghzjsAj=@3#kNWqWM^bUUf&S#$pwp%>lZ@h
zSk+#|qLplj{U0k_ym2y*l`1$K^)L`03ii}&3Y5nr3P~Iw>}vTU@N24qvuJX5E*a2-
zlXdygMW4bkR&fp5K6n{Rkk_0YOfs~D7=2mf%nUcD3bnNsEq1q@Dhu4r^oQ6Ot28($
z`6e-YinT1wlW1**%EEzEsTZT8V$)c~qV;9A(h7&t>;)Y4DsaAn%VI=<HAH)e<<y7g
zSB11GUkD~+Q@x5s^NU}!g^Os$xQN6WE6am}OA;7i0B|Vw*TF0up6L#RuDiKjn^u-B
zT4`=oVNbXuq2kT2Q(gu0PK#VY(5e(GHA?W+lZ+_CETqMLlOc5SDh4j%mDwtZ#Vc2$
zyUtUkcO=WTjM14b*y#_SDX{46kC05>!0D-C(OQj5r;LS@Uw3hcP2XDh7{lZku8)|R
zVSio2OjMXz7Bj~82u^vG1<ewSKUTQfZmOYOc@-4I;VO|a>N%Jo8dlPhfhF|6hvaV@
zNMa|i0`2wi#gSOqed`PzTtpeg<&rqf?Fdg5`waw@940W~!W0Y3XTrG|O?eopQEv2-
zor-+}7gCQapK0*mM}L9WH6?+uvFx}6>2q)k;Rl<oik`BBg?a83kREC6j|HxIZ)X=S
zc=)vE8zDKb994l`G=#`-BVAUe9F$`o*l4XP7wXfbzO@Tn#-!DSHJW(Y-FQ+Z$2rT0
zjUZ=*s4!dmvJBai?0|;pf63pN)g-5LmMvOpc81zFxPB4%CC3_27^5bJIt|&fwZl#k
z1dKyf4f@QRkEbOdi&i)n^mArfxOSr;NsqR6G`C{B!{EPrUt9{&hKgiaj!Tr)Z{B62
zF51AMKxu!S!Ate#R7p;q5YSbWDmDTJ&t+Sjgc$?oB8QG`a=|YqPa}j0CqE$=W7i)G
z9w?CW8zK40tJH=mmvRO-=u+m#>vBX7b3X?^*_JLCzvRiQ7_=6xD&QO3O`Mq?Z7s&j
zO27wez`?ggTP1O|*HVi7VWC5$eSwzrHn(uT<b@Nnc(ODvR;K6Vj+!yF8Pfx5E=${M
zK#34_iyk0OI?uO~pOZT#oSctoJu@eseBGP-&g-dC;M$Zi92Y|QW*cSv7*x<l^og;X
z7ic_HpvtT;XwH(LM<WNtcWqAgBxVxjKBKfFJXP#tz=@YLY{c%VT21@#uW3Q<UDrdp
zV7^nJVjoqe;XmMqk;Re$q2^prt3lggxQQO<TiYcKK?S77l0qm;_d|{#;n4X2oA!%+
zH+^djTuk5fnG;WL!>eDXQ^w?A29E<ZMVLe9#;F3Anl6hnV%BTF(Eg;rDPtBcq_ost
z4IYLD->jACvEN;B*nKeGjfM*daskQKhg1NgOTvYMF$H?;L+B>Ct9-d$y6Hnj)mZ{f
zc%0+3@%=(%o`O0|Vj5^^Lu`N-w-}I&0g!c!Nsy0yvr_0VxxiJ+Jgj)~uWr@~oe(N0
z9En^di^Xh-d1#ieJjNNyLEy*q^YaQ<it2=5(Q38zyA`h7bmk=0*7~m)i=3LsP6g5W
z)}rrd3=(X$R1BC-=j?EL#I*~Y9LFX(H)vS0>0&m0id4aUXzh+_FEs5l(ClAh6sp8V
z@Hgu>L(NiD6`VywfHvdI6)xWN9i^x>AoN8-Clydq3yV9bL=5PjE)bDm<lqGwYd{7L
zn*D`WF?g7=bc0u^kHO{A{c!NY-~z+e$~yIE1%eDc-n3h!M_jw0Mc>j=Ei`Z`-AsQ-
zkG8hLSg)YF4sOOd2b;W>D*q002M8Gb1#6TZY3+{%?wb?Bf)}p(Uelwk#cHphsPNMy
z`tfB7ChHfZfFPkIQ$|DMxllPh;@TBWqGrR^u5hv$E>4w4TPsObMd2r6AA}N%Edh1;
zdmu(}7zxDl<_ImZm&Cxqi^t{&1`pxG&C67W$tnp)gtG$TlvJ%nhul0dVEzP#%a)rQ
zA<<#d!nq}TUGTEYH)m#|3a*TDZYxQay8rYg2aWtN04c)>8{NeHqKh~sRl()Kv6nI`
zT{MpvajnlVtakA!FJHteX{zARXN#juZg|P6?7Y{EP6VjgF|r_D6lGGT3T~oF{<^MA
z3kN&K3poFrnW%$e?6QNiM9KEdbg%<L-~Mo7y@_g7Tf4#qmzO>ugV$ZZP!6Z*TZ_q9
zqnaI{a5BV-1oY?&^s+e17$9)55$IdHqOIPi2Cmkde!rAiS+1Czlpya3*bVboX<tQx
zS~QHtm@)D8;#kRAS+;1otWF3ET)LQ{mhy~MTn?DlhVclc8eLk2Jf_#tL0sTaeUT$%
z#wrrbV&a#i9B?36T<9?$1hiv-)%jK3BGV1K<oFpLHAWX&H7Gh)Itqma(QUs7qRVu{
zo^Tl?iv4v44;sIVm06Tmfff>4<qVsL&s3awA*6!N@C=c72p5`%R7k8On7G6eQ7i}+
z594MsdeC9S)u!J42#!6=b*Mnm|BaHTonV7PoA2-!m&>qS$f8r3J<Ag=LMd!-bBhPl
zy$d|efIxZ=+FmXMBsw-$ap*@vCo$T3Z}`Q+49LJ?3f>y4OuW`^L<nhWYh@G5F@|xd
z6_LW)8k*#&#Gs9emV|SiSfaMppdrIsx(g?q+!`Opty8$Ef*XfoLbeZK=(1KCn3iGD
zmT=Nttj$UpoPm=+((VL{Hg!QqXkPhDM96@|TsmukRgjT@l1DdVmc@B-Axz&|1BXGR
z3yWj$O1PP-nX1-+3dTIbW7VVS-DIzFyP_2d&K6J%-1z>a${LV?gF@JF(F-1i3tXrW
z)VCHcz!DV6WnDmg+m`J71&fdn;d`Gt2AN*Km1n6KG<cdXnsy5ZkE07XWozZLNIo2f
zkT+*<6&(?MD;=H1(7N96i<N9GG;krKfq!_hFTO@GWJoI^WNFRko0qA275J~qTa<eg
zT<MaVgIGjwzg)V#-$>e1qh3YeFoswDRJ4p(_EhjHLTD7D;-JPZ@H};5Q9@ezv-(J1
zmr%@w+A)a1V-%*l5KN|~4wJGTI&uN@l+Q6Wsx^|tpkrchNY34awM}CciM2e2jYEFq
zT(LyEWbGKl2c@!~Jv2vXj8zOA+PR`#nHEpdm5WoQu?8eBOui(%(9r*B44eU%#&A+h
z3hFmP<<ztWw4k|l9*}{{?#32AHG088b{Zn0zY23s%ht-t1;tiHKUv6ED^soDEL!(&
ziNq`%v;h}z{ekNkSeT-u`T<8)wJ#Iizz`yU9xoq#=3!{0;@TAt24-fdSh(7Ch{zF~
zW<UkkY9AAHB_%F1Bk5mq%H+`pn1(~!#V+r2A}ZlLthdbky9H13yc>B;r($1Tq~ucp
zW#wV*|JT`wia~sz|3anvCd}-r*q>-{b=K*>kLp`)h|hmj%mBaG2%R4Leh8&97DSUB
zZAB004`|L;{53FJ^kS)~$3Et%$r^W`F%NmsMWf5!!@3#G+P>Uu1ZF@<U?hAF=>5!=
z=|CfD1&<WR1c47-b_%B%kR)(H{^O7v<>_Pmx$izx?-~Zx4J+^qIMu75PFTy(N@3<t
zHlHq{L%KI~tw?Ct&bi_2s8=y?u6<K<7(B@kF6JX-=XIa^?qT#QYa*6v-PtfaSC-?j
zcJ{IlE|TT!R0U_zdbKVV-{A5U9Oo>{;pGrZVmbJ-d_4J>9t{L>h$$}=9ogxeWsBx=
zTlbxTlSBRH*X5_eg*g(a(WB5SN##5;Wfdi)&&Z?eFkQVsD_Y?qoW~HnI!Dw0Sn(tv
zJ3pecV+{ypP)Px@M7o%GGOu&UV^A+I@_&a<-1(`JotA(sTJPnX8b{&c&=p?5b&WGo
zbs0G^j9r?k^-A!7wUaOlMMAW21NVq)6Xqinn0dP~5Yjpm2plFCCMU;A1Os}`8s$e@
zi-Rg*Bz4A+rEHDUJ?4!|T8oe!Kk|al%<5aaz=5J#r`b+C3AHcE7THs;A_oi{({sUB
z^2@j*%s+{_qJbaMyK@VY>{YK~(aN`}ng$L{vFG<)_UbShGYa+S;74rRXPoK3&;Zm&
zmh9`*?Dp*GFiE(KJ|H`1+2T3K11`=?&z@yWTY$<3-6ApPCBKuStx6n^pAE~C3pnjr
zUeM~d?A5?w(&Yu5)_{CN9Oj)|qH<I%Ez9!7Iy(AMRzpkDIa**1$iT@`FG~%`;=y?Q
z0*|pu1Tlb-g0g6uHH@xfI4eBB5f;gzez7#ebV8VDwXU927ETuD#kULWE|kA_bTGRH
z^JRz1pwBkrJV{WOV5{8xJZ&$WaLr*zf;poN8f-!@&di{C704f8#1n?Af3n-IAxWvF
z<UCsDE@G8Hy^2Iz5E;mM*)TqLIWy(Q4u|TYhbR}ESPnc@&`Mjf<aqMta_Uw|1&L@v
zub<=&Fa$n7qJy3)7OfTQG`(j$oA3Mo|E?BA(Q1uSRIS>Z+Iz&_YS*5z_pDmAYs84X
zVpBqFYE+4uv163lgj$L1pU?O4``^m*MjltLoaZ%;^LQQS@oH%L0r~~Pyh`qA`8LyE
z!D*%X<5x_9p2cKxLgPp6`%iBUuaIT#T<g`5$Czh=Two^ID{B&?u;!LWcu1-MOYc7I
z9s3cJ=0|cn;)48l*5h7b87<NjAFhbq3~;F=jB|Ewosxfl-v7q%B!xl9>kSeVw}LY1
z|31$baEhZT@HUddMJ=HrHJU@zVp%3t=xyB0<Lj=MLk*Cg<!yqJ7CgXGwrS|23ZWug
z;GVI?x^>T|B(E82?UXUVCnO(P#bP;51!Y`pOtAM)gK*Cn#ktSV%+##%-vLiHT}2x_
z>@Mn}TieQ*>hR9#Ml@`%@A$15^;H=zhjWtSSOZcz=K4o`|6;f7a+whH{Y(hGcXWAi
zIpQK$L9cIGg=}Zqjs5(*d3N`E2KQutqBFrfAD>N<0IS7`2&>QZ2rccE6qA$WTQXA<
zR&iIe$@)Ad3Bny8d(FIMtMzNlDqzEI=PWwXTQd*(tg*utZ*kA@!uU<=B-Nu|f+I*Z
zIAz*h9@bz^HvRLUW~#-XNlfr#Y`{w0)*{yIOV&d@r($6*qZO{aKy%XT_UD7W>xOT$
zs%951N$tZJ)|XhEzbhtTGmZBEisA6l+C@9}^^MhG3)yl?#aYZkn(QP?iA@OZ<<7og
z3n^02xR#!6Kdj6g(q{(9IQ}$z!L$=QbSF&izL>9f^!m!>wm`uROK?lLb#y^uwHbC2
z$>(IU+5Dlm{r@p#tJqM-N3Bp6!x`)D8h>2bSD4*@JPA6Z#Aw;q;sBqrWXUdKyB?H3
zhp9eFx9E#o6MV5#+ZZn^pa@mw6<wG4WjUB*tVM3T>-C5{?jKn*v9KXPN4L&u<T>Bi
zAN%ru+BqINUU_Ymo}2})r@5B%g&=}aibEeCy8#j;iwu=}`kzx`Y^kzG<1l-DOMp;D
zrP2^R@m*An5qGq4sLT4n0ukpqQOHxNBSKE5XE@yW!-&nNy-x)bPT619wY~aFhS6wS
z_%6uv=cBP-ngPI&MAij0`(Et1B-2%^+wa$jEodJ)$w_QM8i_Y$x9bzJ<S=W-qP~*v
z@<of|4l&#OS|Gf$@u-t6-mT_=yvg?_UABx~lOz7!ZAVxECvNUbQeqgV2gBNB+!lXD
z>%hF)bagQSbawKTe3FLClzzTcO(gc?`ai$O?RZmMrkCRvxdmHh_IOOZHt=s|GGj|0
zhi4NC7zrY_+|pWn(lrfPuq7yu%dxfG>$X}Jw_@1KxAzTR^l*&Y3!{Q=vY}$GKE-Fm
z#T$xg+6K6kf3laGmN&JZ)R}8)^T2m9=<)EU67D<Au<zf^e&WH-WqjW~QW>b3AK5Sb
z;qVxqjh~~NGDUGlCdUx<Cak;&J%+$2XeYhet&jM+5>apko6aYZX<A=Yx*e<GGjk?_
zt`eR6TxO?~<Mr+1aIc706;>4$X1|jr`Tji%b+MxAm`RAhZEtFFoyxp*iym06CBiEF
zY3W8AJm(e7eAaUcQw!ADO5DW^f=rZq=Km8xBb^q~x~U}&#}X_nmX=sNxfUemi}DiZ
zBB#QIR3udQeN}wj(B{}gudFx3ck35nR{ayEeN*Jto0yO6DnZ)LE@S82*A36++6Mf^
z2X<cvoIK}|BqZx6r#E>9o2zk@O<TInnem7p(!*WhE4K<D>v}%jWC(wLV%`2ZsdIN^
zTqA}2@%)AuX0%9F%}*!83H+!yZH^E4=&!fASpW$k74vs@k!DpJJi&Ed7if5e=X<Lt
ze(cjcROYma$$(_C*+_J%_VpVv6*IaV4y9>x1#5HUXBHFXE8mkZP!BE(A4>a+I<9{O
z9KN?syw{DlPQUU-pU&^Uid8t1OFpY~p=`qof8+h=wP2j18-Ln(!B*54+(YXZ%$MKy
z4K_<u-}epCnRH(HEkW}>1tg7-JO1;C*`W#|Z{vk)hz#v5SK^4VmKYMyO!_e4H}g1+
zv^uln7QPl>yU~cKnTV^zMf8{v^1f1Y+A5j)x$FV!6F)C`B;lXWj~6C?WJEOtkK1yM
zAX<^F0t_V|w5%MSj<ea|aR;k@Y9@8uxX5MTX-5z|f~6U2erop=m(%c8u(4CU{PI^2
z=GWIuS)uuqf*7rjzBm4Js)(nbH^0Q;HcsgENTYj&XI5KOG1Zxb!4FMI`{(Br3G#;l
za<HXDwlpXLV&Or+Rr&f0@$Y25WO()*YO-2y^QqVALyv4JWnM%L!frF&L!;~M!;bZW
zf~WrB=nWy@RB@zw(?js=1)S1V?D4z)<QI~ZLqtETtk+8VZU&FUiSQ>rW2*}1T@-|j
z_&ceC>tHiP47E|6nqH2V7ppU43Dol>678>eU3||OUqQ!kN#e;Dzg-?Dz`b;UTmdk4
zmtxUf9VQ`I9sg_E^-n!kab`TKnp;zI+>R}cBc?X^kF$7Gs!MuWp1T#FM>>6__bnS4
zD}7`A0$XZRpg|dZxB)V1bR4@XPyVzn^TzzgPvc&W_od3`&erE`R!N(OF9r*6t{ImV
zI~4<)Th=DQ*brhpq__Pu9S{hLB)kp!RkVvoiZigGqR!ySo%iwVPb2qae9tHWzND4#
z;^vpwk0|T4!0Vc~yz$I$o74XY8xN7<{djMZLH1h(&iLU1``Z_}*cWE{!mfk}PYR4e
z?y-*<sWO4!#i9VG!s6wZ$V6K6B&;i0o%wove#WKE&zk#pkJ+)y_0YZ<eVkq#gzBZ@
z3lh2?+1xBUf=W-Lh<ekpf0pRYvqg=(_6^@~zPPq0r3=c+EYu`S{c15n@b6qd_SlUM
zw0&1@yQ;8Z^J;R|U1NVVO~WkN?h=y@scjKANrRu>!I-7T^B<<qh?Qn3*#HFlOSV&9
zA3OKB-r(_@{g`E~2J#L*ef|nA+7jgRiP}aES!`=_I?Cf_bb-~oY@M#%H3nZc%;mNT
zzc)RYdcnGAo6LJ_t}4Tv`IRBnW5W01oe)o|YhBhrYyT0~0Aq0X*cKIW;WX#=XUolP
z#ZZ?6qkc`9xUxSKf;ycK&b(%_Ms0)C-eKq$W|Jj}vXLwM{d1aaR1KPq*h~mh6V-ZJ
zs-ZpN-3nh713+QD*pNU(z)sbcV7Pzw73I*x1|ZD`YB*y<FX?VzVG`3Ckcb}6c;7m_
z&lySC%csVXN_T_DUE1?Wi#&m~2D3e{(@5%)^(0OO^&$~soP$f4zz>;@An$GaT*8hf
zrtV)Vmmm892nyrdYEo!w5&dJ0dT&*(%|*A`tiU6WBJ|Hm{gcmk!^~#xvfd<em9JRy
zNIsQ&va6mvK#MXkmDu<26LaFM*IKrCSZcb&z6lXNEAw9x6E3LbXwrolp!QKT6Glb_
zIP4iD916Q9sv|v}nCipHy-R3GYsNmwJVLf}dg>jE*A%AoOcTu5gPZY-_!jf5oAjSg
zj^?_hsbgsH)8v44vff7m!^|G^&+C8uI(`>#xMniL1*d9fMH(B%w>sy2RU>C6dNngZ
z47m88Lduo8KxpK4TQz!KH%3Q0pADbm<(tZ5$0gAv355|0TOP5PLa<uIXcct?L=juY
zm+NynH5VkfHcU1`UVc8KL9cy-Q};E5q7(#A`qEhGjv_S5bZ_18?TCJ}-q`uw=37jj
z^;frqyTH?e^+GmEY3kR(ozLepYsaFAOq!)oSZhaY_f&JpXC`~cQL7UD($sRH_lhqw
z0qMw!IU-}9z_J$UurH=P`F%B4@kB*13OxUBO*Txoi2EYtZJ!~wQ+IgagMZGFNq^E_
zLa3-fh0u6*b)ba^Pfoh{yF<{H!8?yiLtK$<Rr2hrzVotC!|sJZMP+}gw!T6Wh)qdO
zdki*_(3@{N(lkDGFKOlyMq6!0bwz$rClo*zWb3_tm(!?fWw*E<YQ_I*yRYGjR*sO$
zSM3u6C2F<;0dJCxOy5jf)A;aAxAR}%`)DXpG2T;LZ&e+Z6Sap(wE<);A;rvqNPt+E
zM?YYBHcbP-3FZ+g)|t{Pmv7F%8?li8XQ(3d%rmA?E%Pg;1ljeffE|w{oh<9w@SpX^
ztADU7KK0&Ay%()oA%}zK9Rt1n1pf_m*SuIP_Zn}CmN$y-KIXLO+%Ui<fn6WdEPy`;
zfxCoj2zO6O^9R+_G)wR9Hk7p2Od?z=lPNi)Sz_;}HKdnbseUGCi}Xa`uI52G-FYFx
zF=TDcKJZ~l<~}<G8*;gX1YW4u_^E>T3V8PR<NC%J)5a+_o}}~=dm?4gV@i^+o_Wjm
z{P(MD%FUpu6^s8R3CT&|d0Wo}0#;U@(}GCSUwh|zH`Et>%xAH<uBI~oYCy)zdTO6*
z<eS~>IJ-z=6@4J$t&P=92DS)cd@qQZ7s*iMFMzlYbU|DqKS!$S6e;}_Q;CF8_1xs#
zzt28Py%QYycRDtT7279MUZtS_`zQ2%o<~`5N${mo$H;MKbsDz1ijUKR8z-^lhhWSC
z1wNS|yhx8BN!DDX*DdIfH4&YlO)l121gMR2Z88{Hz)D~gJYxZeFYAllS9^Zr9zz&A
z)q%ixT*-vpxU=jM!4t9TipDM85kIrN9S1?Iz{9<;r%FM5_V>0O*U+h!vs8$Be1qVz
zoXdAvar<Dr_kF+48)`sRAiKyIHVT$r({<}!QGr}Bb@)D|43CzI{!!9ph1I)OPCE4$
zC&QLJx>1_3fXA^@>0_(@6b<Dx<ay362+DI@`Kw6lP(dYmgC@{_jgp&HUwOF+3Cu6B
z%RBB^>|J`Q=&hX7(?S+U{LAE3P&Kf%lIn)pUBJ4q)W@^$a;kN%WCYOB_KVZwE{5i)
z+9=|qeEq)uNq@D|*U{`}d4II8U%&P6?)2NoCV@<tvTocqgxZhXs+mI3oWTIqx23yN
zSgFkm=b3@e=mLs2zfDF!ax`kR_;O31FCdJXg>Joy(k!}xE;&RrKC=7ypQm4BUuHv-
zk79$ye;6q9e0b*Qj&1Gb(IMWt`4qR?g`3z4*q(Z7xKsF}fuXMou;KTNv`V=5Y(U+(
zMCzf@ut$c7dX~EFBetVN{!flQ>s%vjWb!GB%$DL&fmK-CV7&Y<_MxP|zGkjn`;O7y
z|7_WPt%!J>>fOU%qxVxvZ2hgkXA>_ziK=Y3$Hpwx3%f<)z2ViR)@wh=FBv!;wg-vo
z&4y)buIIL2u*(-k_qC^l=G;pNYO482&ZRDY7vX_AeRP@RHACEs5#b|ui9TE`@ML#<
zh$#=u?i~N9=(fs2gU4(%VkB16#Ohc;aYMn)m265x_au2o2WS8UKJ+Uv2Mnm)6Q5jf
zTzwTHCt`2<H>I&-J~(@zqW_q+Di7Khsd#p8UF{v(+_FWqvO=cEi18TnHO)JemptYm
z;qw>J=$4vZqUXq47D}Lj{ci+JLdszjQu%3#i6r%OO<M+V-jC5sE6SV@BEcbc3b*l@
z;AF?hEW{Y`xuc66hy2&&j!oLeSMEa|fxi`omhnHxy({jLb(sOa{_xD$yz;-uST;$@
z0CSsCD<fl?u<udIEcuBGjJ!`l*{v60@=Ei{W(Ul=N)!a4kSAPW`KiPe!S6k7kx#y_
zQF@p>hLce}QHe379%!d5c#I17`XX<C#0}<h{zNeRgV|_~J+3bjy86=u+x2FX9L5sJ
z9~Nm=F*hQy;r<^|hAO_?tH5Kn==C?n1i!As6n7619iRUjhIxmt#B0Qvt7p$gE!*YX
zSRdS;@T1-x>0zyt>-}1<sb6>TF&yA%X^}r2w$eyC*H7MaI*d2o#Let_KjO2vMVYGe
zr^@;dwMp=UbA0hjEw416b#m=UP4{2q2u8@cy=ec^vn8x&_vIH&r9@i~N;rgCw0or=
zfR&(DzGU&T9pX%IP$uP!f2iT5IJcRvs{R}m_JN=;ZCT^rY`0AAV;zFnFjI&BefO`%
zN{Nzhc7|F#V|Y67^GN+lNar&L&nxGqc&3iAo$H^}d%RBTU{uvL-wCgbCds%rYZUca
zA{{vI$D>k8yGC2_tS6cV<X#d1;pMppLe5sNSNMq0h2I|t>>1yZ$<N!qArx(nu-tr_
z>I(GZ>f{UP^QA|cad>9WhTId;cUn9F>nxg-1QHm1ksSbP#wik&V=Hbv#nf3u)tJV=
zOf-xR6?BC6WtEo5Q$q`;qlX$;sMX1c6^mSFJ`kD3iF7oB&-K}Mzsghc+5cx6SNK54
z+eS0TRB69<csi)}^M^s}dqSfwuYt?ivaWcAX2~yKI9`VdCOiT}Yp5j92ZKBq@ay8b
z;(s16j0sneYt|2}b-%bD=*3@JyWeYgxW0XOz<%6LJY17LT(>@47+vWx^W70Wm^`4@
z?$P1*qv6*(z5ABxhBM**Ui~r&H*4K<M)$$rK0*x7ynCc~F53Hdz*6(V6VVgi1O84w
zU1r@260Xf|lINWlB(kI?)~|or46HoXie9ng52us!eL}h?@O}UCLVoK^TVc!RmRLS8
zEGG|=yHhPid1;2&fp51%dO5=iXf&t;Y9X{{^S{!h49^>B!Qm8eDh)mhLiEI?>0D3n
z_<=W|P;J6{3{`-LPAi;WTsafol1b^r_buNnA{Ca(_9K;2vrAN^qwhb!kAi!jeVW66
zN$-07=Sc6;VdV0@c6?os_rBWgfu>OCWgY^bh<^EA$z1R#utvUDjBYSxMWS+a2sf1X
ztPd47@B6nP()#;Fp)WMJN_IYJ^xAB4$M0BB;(*0tMW%wUK&{h=x<smC6fZtu!n;$1
zy1?M&%Gn8&oBH?;&2wD~wi3KD7P`Np@VY;y3o+C<4YG|bGMz&8SXEwsT953YTtU;o
z+?7pdOYQSKbMbFlp>_LK0wnEYPRHjN)g3>&rP@MkrVb)C=%0mnw61PI-K?iB<_diy
z?T^R2bqa$moV_PHWRd9Y_H*EI3fBW?UQcipUpVsCX5t_n*=o{*QgrQ`h)gp(q^n&M
zW<(cBwVBqO7>lw=kdkODeDu6oTexU1nb^y3yNlj47U{9;J}%5MX(bX046WbA4l{B?
zvS!;`?{Z?|I^+&`o>3w-e=ge12b<DUUHf+_#U~hu`E-vrOvz4qv{7H?ufMe#j*iaK
z|AhH8i|>2P`U}4`d=~QJ@q~zEe=+@{#KMJafqPI)7H~7uca}F}Ujhj0)0ndx_*8w?
zyr?8%tVMH_fOf5HGOzeQG(2wy%G}h_n3qd9%PrpbILv0$PcZjnp(YR?KR9RisZ^sh
zk82w}X5L3e=p$)YuZ;Pno^(fD;P;cco&AB@#v^vf3XzW}%=tPvHjm~aS&mj6r^rh?
z<>+S8Sx^>Efrjc<8yQ01!WOTY_tTTKhI((uS9!n^d+fjtOeeC3w!7E|B)oFHg6dJ4
zx&h4RJ}7twcmxwrb{AIvjilysb6+nx`M!FcMD*(?s%9!6dtS;Ynd!LGHN_#Rpdtv=
z|IhdAO$xQ7=EYHr=fSq<SSb}($7Pq^?c7)-Seehnhi^C1RH3`nM*#h=7TkqDGoS=L
z+C6XN$}128Z)63U9wtx2p-SGBfyV!%F4K85)cO?dRXy=#YGTy~a|DQn+$Q$>Hq7&&
zhqh&z9nW_z{#^c{&}m@#g<Bmpi9U1-5)$RsW{!e6_#>XMpPt%1Z9$%K9e8&I2O1s1
zLW1Yirk+ey)bi~Ko4OlduQBb&X)ftWpPvfm#X&SMl;^^EBA`R=Lf94gw>2HXxOee}
z511?FZ_aP*K45X)&b11))}7+1oXOMjB%->Iy^Dh5%Jo2l{}~GyuQ_hje|2kh>|j~B
zR^{+lJnu9>_|8TFNceD<+-~bfS=9Z$8qfP3`?F|)>)A#TFg_)R)3QbIv?`FsI-r6`
znY2nX4L{fxQ^rl(oi7&1?3%WcF5$+Kd$O!$cf;2GH$q@9apwy=(tR&~Roj^F%$q7J
zi?Yl(qh7orLSr%P#qsdD(|L^VHNg!mHOU{W#8%8lvA;6{bo`sYtpm>c^km2~jIruM
z^CjC@Y{-6my8{7;8QWBJzP1?{7N~nArJ-#zt<Ua0!gidawpYL{5w=tSo+ID9pknZk
zrSA$pHI^+*Cz)^OUdm#e;4r=w-5*L{=jrv{4s80FUO28Ze{;XWPrmbF5ce2!Y?vcW
zjMubX)f9(5Hms5+#&5E(Zc0E8O3Tw}&`G|Y?Xvp`640a$BrzS{8R6p6oNGJbJh^tm
zbS8Fr{>3_My0yBi<oq4^>5?ZALg1&B_Go6Us`%7HdqMK5wwSb(e|HKXc2qc%CT}wm
zVfGpM02I2NI(QG=Xq6TON!nBA7@s2P5pX)Kn7l0Cz$)53LhI>)(T+nR4miE^-t32K
z!KrGb{xnDQEz`$B<w&WHgy&sN!#1wS9luZQHoY+!igYg*q_mp;G+N5T-{ITUck*um
z!<X3;-mrSsnFS*0TU8mA?~0<o-LxqLZdR^A$vo*ZnYfDqO#*AHVH)LW&^d{;)$>zj
z*9JW1^vL?6p^owUWj$fh-D{`XgToZb^7I{@npEpGL*uULk+ZVd$!7N&PK!NTx*&Se
z%*H;nqTyD0;BM%$wUpM;LsLhP3ix1g731GR22U+(r$dE?8|)lgJx}-&N{`q+*3q8-
zM7lnCBx^2i?*Fyt&2g*Oe+?O4yQ*vl_$OfvPlvmHWDxE>BZ0A{8d-?$9y#at^$9bd
z!a4Cnp_1RmmgM(O0k-AC_NW&^iJH_M;&mj=T&;&7Gq-E|U$=kPu0X0htXuC*bm)9c
zy-%Xqx(c2|OYG96I%UUvmEFt8`eDAe^}0=<?5Qcvc)A5zOC}fOw4@dxab?#a<X;X(
zo4jp!;%&XLBgh^KaLusN%yF$$>gO4G#b!^2ku^T=n#B$D`pt9{3CRttd3LJG|56~m
z)+3CE^JI-zV1#g|)jy7G%(jL}dr~IAl=BocZ?uz69pXN!XHm61h>#H|L6;Ox-6T{*
zuqXiOw^M<JFkNe^?r8MR;byLHtf(Y%^gb^?Q9v&d@@gb=@=R6i%rzFbRjU1`{;KiD
z(oSqlrSZpQvI&bEhd{x-(xenOOoi8k{ATe<Eg>2m8#g^6zg?Vy7wXd~4~nRdW|i<Z
z&?omxu@7y&+d?*eUIZbP0R($Vb?Sf>2kWH7Zx##5&Hw0hYRd9Qx(a5T=s#ii=xiXU
zC@v-1S9sux%1OMjm6zV)t`{FI7I!Nd?3o!}!Qwd^LVPv>8DfE-?}RE7ee#}IvR-}f
z4FaVns~*0Z<HoF4c}?rIm-R1gNn!0Gub~2zWczjr?5uZ-*+c{vP4XiE@q+N)oUJsF
zebjmw&j_)q+C=V8ktQ^9>65lakOfyylkWFAB|I`jx`H;B&Z66-jCD}jQ~j4fe@AWW
zpn~&4^@DVYqlXUamnW4En<j<I7@oKmV#$YTPX43vugO3E4+T0TtLvEz3Iwic)*LZq
z^-Qw`0=G0oHfLoHhFXg;`-BJg7eQq5Gr-F4-;dVnrx6*MEo>QU_v&^PRdz1=+r77{
zggJq6URxb2bi{fizs2>9xP3A@Spk~qbeqOA7<a=4sGMq=gU(v7adlW4osz8kTAO5T
zWE0{q`;@XlXlM63oIR(z8{xX@^SeeFzYhMr*}4t%FS*OT_o|8fxA&-+!ts*9g`s0h
z_qU>D^eoyDz0%|vg%I=~Z;9KX;-Xu@h9kq*j;@hy&#5d99IBqV!BTCs!@$UBHUC0a
z{H=<1(>5>6h@W<t3G}8qwI9YymXU`(d!{?Kh@K{y5k7ddmfbmoswr+WPQeWMh`RO0
zoK6>?s9LGECRIM39ZM1+L<|FEXg4r3wYw|Et%<;|YXZ;`5eMK6M%7wpqVU70O|YV5
zoD)cDxU{Pt!yZ-+DV_7^fT-B@T7YtrP5Sr1Z$WoK<#17f(W)SyEv{gS_ddy+8mc>`
zH@$Ax$*QUdAVIWDqxWy=2)8)ozn794eAA=U*Kzp}>ODJRHc=EK5ixZL2zw40`Dima
zO`C=$(#k4-$Wp$n=fYg%W88_Ec>yv~B(;zBmn9D7*^g<+ZFbo!r-np*8%4M9{nUcF
z{jkzQ_QQwjjD~$?g_T*D3-4y3=Gz{lR?@ChEoJT8#=d)_{nuqyf{1aL9VK>hbV?l|
z`9L*pJm!j>U}8=;*YL75#96oV$4N}D&dA<oL5o1%hgBjQ+4j9nuvDd8H5c$j2AKPT
z6^>GjdY+MorE!#E^z)2@?PPAfjc!t6EV1cA27_x5Ps=L)`V+Re)qo-neQq_2H<;b&
zm_)}^lFU<h;^;@5lww_jLjbqfS(;&H%h894JrpfBPe{yP@N`<@l|e38*14T-GDUR}
zLFpb@&7q~`x`<6p8qgL}%s|^7{M)It`F3l|(MdhpDCm4xY|YJatNitdp=2<xzdvSk
zv)uTlRXe|HO?yO_pxTFsM~VxvxSQp#$Cdn^UfuDjS%6PmZBxFj(Ko}@1iI^%-+MkN
zf->#>Oxtxf?$g;h>RJgH*MTRj-_rfk<>v8Qkx_Zg^$djo)+72E=E1C&Ic#nZ)q1oV
z$r=Z|q2c<v^coY78(Io`qzgc)_T>lxUt}le6Xr7G{c{VUr#w<bo24yti~l=zHZwyV
zO}TgBAoe7bz_)f*-A)|rgtlb>ONzNRm>gu%c(y3ph{M3HP=$?gOfFucit7pTkSi^<
zVC<tR4k$F3pI~n>v7A$T5yP6E;s!?VP1N#y0}mp`-+8$oy;xkT&w{Ac`nq+7ff6B?
z-h(_7=}0A;t&&Jx@&UM~Ya^Gz3s4-1s)0TVa%@`tj-8bDT*9&A-!+;&UR54nk_23T
z(bIkR&Um-hQrE>Am}{$)HtCu={T>2L|E(fGe7Y+8a-(Ofn{h>OSQJ;|?j{qH442b0
zLv?4;U^;RtIR$Z7R$bZ~f$j~JoIXBhdFAUr&~1sT@>-7)=RrFI=)~mBVp>usSc(nd
zFSM~_<Z?#Y?(CnlOk@&V0iS=TBN-hd!1wRDHLQrkpC(m-Y$|BauUvKQzB&lcNoE?v
zK4wZLmKFsOoV!{JX-SVpOLrT$a*ZfWPdW!o0Spf(o-|Fe-ybq@pdE0ygfqk{p)Y(n
zUMHR}Xzv$|Yt8^^)XUVt5<c0OTeP<>OP#S!`G1mbojRquQ?DZZ$J~kt*CZ<=p63?h
z)L0>tG~${IPa=knZs^ujl9~%2$^9us9s_EK4Tv>?W#NIX6J*ZNZ#5P4=aHSPzQiX-
zWw!XYn@0e1`7Vj71%hC8YByWD++>ch<M5Kbh1z|WAgDVeUR62#T3A{2=U4ae2zHu$
z6*gt1kQ*AoRP`BOwZ(z36?V$8%?`bb@0P7)CC1B%_5{Ebp0p`Ww;`#xG*mG_OstZM
z-K%wwYk+1%8J}IY-E<?<Fqx_Bu_DZvt*4FIrIdf#tV2rMF1J-dUtd-1B%?yu$sI@r
zO4pRwuF_Zv&Q)M8|2qT5wI@M(%Np-}D7R0|89@IYTZ=1ReNBBFzU^;a>5upK#!~d|
zLxB+uz`P7=ktkr4y5IAzJ)yZg?k^K0@TK#|zZg<yiOs;PX+P_mECXwkiOb$wO_jQ`
zW;{zlgGFa^#@T7;(_idIVOo0J`K+P?I6LUKI&vN3^$u{c)69oNxXSz@THRcEb^4DE
z+g=4Y-T}~45lT^6cCM#En=+1uqh6OaHyfb$U-TNpE0&ihHDxUo)k$!rWzM~<Y}C9u
zl^;<%Aei}>8hVpYt;5l&=dd2wOFgXaQmyOI65NXe0;4(a^iL~zvbxg{1zQl+`*Y@g
z?I7^hmDt!17}8{Kue#e)ziB=cR&wYwl}uIGf1FC7s!55?E&mtnigPEHE&A;P(zJH!
zdt}_>_Kxm^H?-nZ79Y6$j)?+O3uqIa%pU5NtjbKp(k|&An}jj?FpAI`u-@dfoYI_F
z+bC$%e|YJGU2iiwE1l$IBfF<Zxb~^7&y*J7^(ChW*QpEF)%T{024#`>bvP2_h~N{)
zvRM4?|HBby{TOgR2ioiEJE?j`G2}FU%uMQ#@ugj5JC4)y%Xgo?!nM6;wUQlpz*y3I
zebg;Bo)KyRc_vi8zFM=TzPN1%c)hQh`_9h}<$Y83%y(AT%cc|~)v5*8hKfw!kI|x4
zJIY=O<(`F1&RFr3tHE`kS|S4aGP2mffCY1IPUnsH&vA*LJI<aCK6vvZD;FmD;M5T~
zS()fA0!+dq3v>qlo~CJbw@EA$Y<XwjEp;PY4QM`{oIBkB<hmXx1Dy6N=N(RLHDDK|
zWfHy&XKFMtJzI(Cr!&#60zj(kOaV=}9u#N9?hgVD(}L>-8yY(hc&Wv*Y*n$P<js)=
z1~0RSNkfgJew(fqzyQYkwd(9O7oox7EajEZ(@M@c3<{N#QHZ{{!GR-}+;qdhEaYa=
zfxQ*s{NZQ-hvBOG?4v!_2ZzFD+bv8<p8}C%5)a{GW~i3BZai3aOh4-|*jo2(@9?S%
zAsNhHRX1MjAjn-W<$JH5<0fCO(@c)tu?cv0ldoOM*M9LPlf`Q$sp?7)uvj3sS($sJ
zX|Hk<HlxrkSknoJi|S?)(BT=|chhCD;u%qg>l*oyU#{KdFMSz?efihfo9-nL>a{d{
z7`~lYSy)(wZ;6cWOy{2|F!YQ_cDJL?e6NUdqM+R6H$r<7;3Cdv-%fQ|!d|H(j3SrO
zVY85b#GcfU8=wYD`6aQJ8002YzvP*3p^*R3Kc{e9cI6d^;zGWVrL|7mDyPqN#lTf?
zAJbMPbcoq||L0r|b87KiQ0Q1!1Ex2P<7=)SY7!Qruj?l^Nx}17yK#jTu7TgNQFVL1
zC0O(^NY_st2a`M#=SQcGBhNzLQ+LGTg+NH;XYEMUGK<vJntFDLV|41g5Vzno!D=zP
z(Wgwz72T_!Ps<3cVVnxs!?wFiLyuG5>LO+?4;l_{9;?LdIq8V!#$#Bu*9po%*NY=v
z(qA&b=%Fli|81!cTxAp$l;Al>%%eu#nXV6`zaL-~U-@UcL`KygU}~B1POwiWQi~#S
ztn84*i=PL!YuN>ah(O6@r}|Wk8jLr8ejtCFI<VJvk6I)0AcbD{@<~`HYs+s{Enve%
zBTT3mpsIP+9|~q3*x@=ZC~M%j;WtROfGJKW96J&NLUcXtk$&OK%oUP=fNQtzC(Npv
z4i^TsGvhaP>P&1R`Ljlix(&yzOBo8zV7x1Yu(g^z^A@B+@&3GeVOl$GdQVGjtW95#
z6L3S7KE3yYKYXr@2^FcXTCwN2l|6O*(D5d<I5pZvt~XR(RSR*y5FFYb%n;(t>7l;9
z=+3sDK8?`f_!?RuZyMWCcIY!xVpq5`DfPUhu30w+iX3*2{_RAq_Amq7Y?a$q5GPIM
z@u0rW3QbcNC)HH<fI~Av?KQ<yMs5*b!@|=wL`caV&U@C@Z1ejB1>V2`m{FKOCItP3
zaPF>yS*T8PIC?0;Gdwg6Y{<G<5(`PWxzVd~%KY7_%N2SsoSl(lKhhQ41VF~U%g{s+
zi2gnuI$|09|1qp<6mx&oKk98dI4&(3_-ZvDnZclCV)9~V5X7aC1<HgxcFGYjg3Wv~
zG`Su)4=nxWVrs$4!Iqy<S<2D?tSYO`Xr6DexZ=R9w&qaKQ9nIVK0^6Ho2KoXpBhji
zdu!6By))zLBYNm@tMUXT`IBzu=6a+#ST)ks|Ms*9{hNRT@RvHg29c{jggIDg9S`8I
z-Gd(^4@X-K{&aWr&I4ugB<Ck;b*p-8X`&pwrjsJxIq<p4|5n%S;QO$}8w32Bvm+xX
z*)I5${U+T-lW7L3D__(k$$>qCupas(_10TiLroLFX9#9hxb1g@Sqb;WqF1l9H7KP%
z&spH+7Ng9WRGwpR+d<|EBF!0^RtNF}31IM8btw}@1>yC8UexUfTsb}D^w0=7!Tfu(
z^rElC)n&D#*B0!req(~Za>pi=^UL>)%TOPEA2>is!e{FFQf&{Z;AkfXe+t3d`(Zu)
zC6{<UBI>a4&8cqraF(&(Xf_*2aI9bD<fv<5xqaG{K7|Ivb!{gTprki3=zUP$&aK67
z(q07bAG^P0pc(Vz?a=C4qnA-tuKAOI3b`SmF&=T$SaHs|h`^d}+=s>dK7jVYuCyWk
z_`UFNfs!dl4$Gh|hoGSeBy){|;8-!z{a(rL#YOEofOND8*gK-Cz$#f7I{moA_4SfE
z%TjuAe%%>T9IW3Q0}6E8L+wt~n)&2XxC?eItr4gyVhT<ESPr?^+Lhe-ytWN#Bjp6e
zLB2)poZVBDD1n1=)(*+xuK;>HXSu|xfz@SudIR?8E@0M}9<zoetuS;4*y~!bIz96~
zXeiKB8>~j-rTMpu3;50H51&J+i);J5qP<wa@4a1W(<9&1_K*g9AE0zddlf*5<6))c
zVSB5@kUxmMpoPT}rkh)9CP?7lz<kv-i?(GicW`-$bq@Mk?O_)fCpex-HG(iU$^TTb
z<gO;Yy~kO11l6-{E0=(hO{G4mOLOrJx5383BNObchL{~vq3PfJ7wDywov{p+2~NG^
zC?Kg5L@r44`+2W&g7#a<So`a>QpJoYO{Q?cta?+Li`q9n@2*PQeO9PjcZU8bi_d&W
zb*8Ton(GsMwJuW~>Qi|xP)abaxPbg_TVD9O&x5mnHHI0{A`k7ZwlY~m@Cu?PpL99f
zE?@+oNs8kb{bv9V)>RmBpcWc$ud<tnzujck2z6R9G(FWaoX*Ia14gjwQA)D;ZEGQ+
z$xV*j-eTOY22(lpw0SNch<RHJ?64^41;)!ZMKmq92l?bne+xEIH+Jxg-2JtXHfzkb
zBN`>8v-Dl-e0RRjSSoHQCbUFZs9A~I6;^#CuEyrzXQxm8=@;-(@%ybeAUp8(N2gBa
z1l@5RV~Eo*2o~J*e#>kbqln?>u6e(MCEt7glA1|LaMkZ-0P?|ZwkffD_NsN^n_O$M
z=vWXn&LP9dwK}W47|tPIZ<c07_(WKqv(9u*Ibv@ON?&PG84Y>o>&NaYnk~mA_zN<o
z8O=qY_hC-ErB>e%1Qe>&Cakj*(3HNCd<XSoe)E_k{-&(tn_od4E5h^u*C39b>nYz#
zcyS^jmw5AAh2-^U2s>Q-jGNEqAI!W>G0?$+#rs*on%_D_hi~PylOIhiFvi$%zF0{B
ziu~Xz@Vn%<H@LPoZ6(-$xMb#k*t8NHJlx+H1NH}1*{)d3MB5Noy~|adLur`r&htU7
z>TKqK`0hDaWr3x9ehTK)HrW`7Xb}A5&hstkndc>F=m41V;ZBU|i8n5)Vp*$~gqW-9
zio{f^{9B0q_yjUYjfR{=$kz1TU0W;lz1-<yRXsyfb(_C0k8NQ-A<esk_+TSU$+>s+
zEx7vCLWc`^d7<9ld413RIrEzLcX_^B21}K0>6Im$-uC|~(#!&v3_l>W8549_F1n)i
z_j91)stgxhKsvVOWIx1^^|=44MgITcmzn$fBmMiFal6FJ>rChOa4AGv;v>toCK|<d
z2dz{O`yD_?VEduRwhyge!C+SFO>J>Mf@43n3hAV;D7xGKQozf`-EJoOjbP~e4{gK0
z>hLPDQ(gi5^J6QE2YwZkQOWA-zeWS6BrGuwP;+)}7s=qkt_>YEt>@imKQW)ZDT$*U
zNT|c9o0K)t1C5j90*QMjWlRJ><9NA1f}ZyTlA?|cjoQdqX1J^tA(%51OEdCkPi+30
zEm%hAk=Ct6jRjeSAF$(^JNAtfB;LK6EP3Tq+({G6kG7FX(47Rtjg~C?A|1R`Wm%cI
ziS|xIPb*)YAD#sN*D4oT@}wCSZqyH?%%7e}pQ~7rUFi^ewN=Pkr_~wRA>{kMdGGxu
z-HvGIU2^lDwk{;s#_xs}^tpboA`O6SptUQaF%siLNJ$itfs<au9g&+(nG}-+-2+9#
zoNG)tROO&$#+9yXoxJ4C#m3W|`mkSIsUI_<xS=t!ngOQMoN&3Uy>TVo0Qy{ZVhxrm
zHpNbQRznqegpLBw*xleXztiqHaiiOg!>j4ZAXg#gXbc@owBY$0obr>c9trbd`3VMX
z>Q6_b2*tQvNL2`gz2BYV)BodF1HB<+l97-lQ{#qipqA6-%R+Z+>af=8#S;DILXE1f
zHOz9N*HnQ<m7q(=z>I#uPaooZw15l|vDhwa17Yml)5#Kj!Mfv$qmIMU?D3b5QUEQm
zBxKd{@NG#zkf}6Bh72_FYY+<fv;JH1wky+C7d$L-D%WOQspQtCwVY$mF<zV&Mbyft
z&P=P}Sy39gF6>sVsywlpV#~5|xaw*k6@(7c-r4w@Nms8gi$6pT-f*jV3wq~xL0j|6
z-;Ia|H1{S?1Rm$XbEsD?gpZ%>^=_HyPTy(lh05&yUJvss2Ui(+6XGsR4Q$9<2JI=T
zuYm!h84a#>YYWQ`s)434t!c?~2FQ#*DAPVu12J#{%!#4JUD3~AZ?}IV<KVYCtifP$
zSE(csRq4jzUMU?{BwFv+K-M7bR3uvG*Pzy*s;FnN%0|7YOKy<kSUoDP$Y@$!GM&lD
zZm<r8garEr6083KRsS>g?&<F8Vkg%)lS3zT$%J{UW#C^~V?Il}JTG-iyW4E6R%o7j
ztF*#$6X*aEa|~^DjkvhUsMN);Ysi%R9#%+ZK*GCOu+3CaS5)KmnL+Etc=FPIJ9~~}
zysr>Ju;>CnL9e!kZ+^5-lMamEIk9i}0v2eQuP%7Q+q8s=0&W<MC<;Vi()X8oOmwGy
z{{f|(cs>a2y{UVJ|Lf-JP61M_FBoSvjybzYRX1qg?U(<WeWTsL{@Of%@P#-1z5#Y;
zPDVz=ycD4>KlnZ%8B0&W^>3hj86?k<@?Y!UAbMk}wuQ^<ZA$?E{aX&c0yX2kyQ$n+
z9c{3cH0a&pbVR){)|}N6b#V+<Fw}EsB_lROyL_IVS*%lt1)(|^iRxMs;r1hUd1zH;
z!Q8o9^&41kdi|TcSzg6{r`#w5=3*Mr!7>4ug?_(phu8N^S(-XvU5BO-35CFJX-l1f
zQF-y+i;EeS{#+*+13GYzzLqRg*K2ZpvMK5Eu%<qY);{|+8z!B#HQbcBq{T|NaLN4@
zbFmQ9y73<RMuE+7nlX|*kYrb~#KNi?>U4+MO}$QM{uPij;nZ&4Bpv9Lm~|!5Zr(T}
z3%xQR|1X%Mr&`b_ySss!_RyVSzi6lSwMG?&%g-Rr@%k`etP(j_Qo&BDAud_?GQEeZ
z>~!)RaVE-lfV2rajympD9@Zx;Ht<J=r=(QD<+MD<k41kNF&9?|?_eZ$I95J<D4*af
z8Aj?Fmec-vQ$A3a)4Bz%=4_s)oFTh9xFgaP<p>sR;oQT#?(&+<Ir<vnA^oqMogiOm
zcC&3iD}o1PIJGqIknaK;Vd*Ye{0_`>LHC|j7}_f*+h`4ci!E@abOK4z3yhTr;i>8k
zqj6LzR7#5!+!JrVsLFoh#+5|x&zYA`bC^`jO!qaobsMm+eDFCpFHampO}y>!-2IlL
z`Z^a`C<~YOUbdK>aknI_!Qv8~nia73r{haWeBrdiCHO5nuw>_lQj@u<lU07?Ghcr%
zi>0}a=5f)O4pC8VAV+X@dhFbSS9~Wr0>M<$Vr&=R3F|Y_W9c~gVT)SZLDc|N6-DR}
zP(>d1HDD=CtnO64h8i+-dUvQ;!N&nH?N=yBSZYwMY}Gu0oNT%)OGFz-7JZj=p~=~G
zqUm#S4K^0R&a-riMr$x>354_f84qJ@qTAIpL{PBC9qa44i>7dSV^@iT&>Z~{YFzA@
zxz2=EnLZjN)TnZtxL*`KaUC@knlQl&lq4H4t*)I)jSL*CsB-<chMbUd@+lB3i=To4
zZ1niW4!S=PULo}=*=X`bll|lIVZXHX#K7vxvsJ4=Q$2T8<#e-RE(c`h3C-OHL78lC
zX9P^7dFq?|<0#PzVPLR4%?_29JtyiMEerVjc0e>gNy8iYuSkaywIc-CSv8DARwh6u
z`;5|#kQa144Mh;rBc~dQ9-bmd_`IavTxGoBP=@?4hBhpz+L2jZG%93meg55JCx~9u
z@?5`(?c1?e$=OKjkAGju-(?=E0B^X)*kZ2P7E_nd6;E><HQ(u!)VdM<)rfN>7Y)&+
z<;+L<m(j*rv|NaYl&4L0NC#bwNdhDV%Tt;s)oz58Wd&RQkL>E-_*{w~4&TG|$;57H
z{cOYS*oiclUGfL&VBi%9ry!`-cO16l>_=m~+a3flzZJ%2M~YuRir%B_)gY(tF1}#5
zstH)l6wc+JY6dVPL9OLu5OtpdOec5Aoysy6?O9!C6q^g<kRLj~^?kiJ$M|D&L>=es
z;eYRA3@OAij}Mm;@KyB4uyp=^MADH)S6tnXm707rbm7%H`i;kroqS>nBBQI}wy^z0
zC5K(nvC7lr)q(@KEOf_>h0rZGN@%Odq2!NG?%*AFF}?EJpTfO6ez}t=k$R>T2WZ3d
znK0{;zj?Qvb!^RYEU7mNdeJZx(iN_N@UQ#c;Cq}jnGpv$F|p!7ttJ=ikc<u5k7uv2
z>ZvOJ8kt4hgctU(QJVKBb_e1fJ(kquQ5U5Bv=*@1U`DMlVGJ=-yiow*P375%*?lv8
z*W?+*P_crGdcuaJHY=4Cl$4nbt8-QJs0(v=S<$dvaN>L+p8FwG2$N`}rvyGitwLS4
z>{=&tBaeQ0cMby20HyNHFl;Aa1PocuMlY#ME|Kf4mfu>q;Hb5(w}{Uy-8fYMuV^Aw
z%}CmI%;Luvbse?RSaeMGV*{66Hv=PFY)eH0;^vRS?o}9R#`@HPXu1>Wooq{Kvx27$
zXfS&?i;f}=hPzEkH&GF;f`BxY#)125CRz;}=)wrtZJv`$Y(Xu<5vQGWeQ&DIqD0~4
zaOhJl^X5~Mq_v+Y`2fOF(7vM?ksEzK2cu+e%*tW#;)7<j7!}L+V>^11scIXq>{=iS
zz*Ao4d!d2<rE90lkwgO@=WlLfxGu*jJMA$-#O5Xor3zpb>Z^xVgy%N;*_EY(Kh5tk
zey>aQXD(Zm<K4P-JLsOl>L)~fdAB!cabIkcntH7}xS{bJD9!%=#}$dMj=?_?UB%tn
zIs>0iVLokhbdF7fGP#puaex3AVN`vykEg_|jPqSnTsb3?j(>w&gJa!){r`tQ{)b!s
z4>=$|M9-&(O|9By8`V}~vW}+d9IxeJPo0~i{qgnav*&+V$B<?f96YG18GxCR>2&Y^
zLq*f^|DouUx8FKQk=#G)e>Xc+vGXDcOhp5X+`vi>Ndhlh(bDEsPFM?(pzp4<v0^z+
z`CKMdUzSMi4$^ZVoN+m5L+G+-uXZ##bm{LgLlt!1L=^vB_pK_wyxx-5uO?JZ(V*bj
z;Sa<FFd^SO$BEvNQN>qfi9)>73vv41SfAe=Y3*R-*P-5E#9!r>Qhn}|g9qKzT_Ix6
z9}T$Ic(|0@^*?)?Y?m%=-D#9jtoh~xC?LKZIJn4`X}@{^tuJdfaP&W&3F`DoqTC-v
z&OWi^$*NzM3k__gCf8Y?@LC<MnJxN?6K?ptb^oxQ)3-oi`h!sDLDMX#eB7x?7w+t~
z2(IT8O5(gZzY6KwoOvADh}b#9)tg{g;V>8h_mIX7>l|oS!Dr7y6%^)^7i~4zW?^d;
zh~`MoF9O>`NLEnkcA`m#>%|>NBN<GbBfG^J%F(|M*U{PvHjMqzq|wsZG^2M_uou&*
z(IOt`9NHQ^_QTCoZhy1Nca}o<aVL<t3Lye+Fr26dGJn^~yf&70g|Ey#5=V(`Ul#+A
z_xoj*`2O}Awiqtj*$S6t3ni&NFH%$LUafh@<R>Z}Kl@>Rlc4fUJ5A<9i^5=H4I^+6
ziHW~n7}Qce8bcNOqXpLKFN}ig#pdKV0sW6%m#VTMOxZ8lEDf=V`l||ob-OG!Ee$?T
z2fKztt(VxGHOo;gOJ*ouwS+IEGc7m$7i`eI!Vz4c>6R>xY#Pf))BgVW=2wGjRl4R4
zi658PxaFcQYraHF8n@nZE(Q~MI%CmWse?IcU?QvlxK+P3KfOVj6nTL+?QNgHX3hM`
zW)I_XxIs7Ko%~eOmwp}kN5`(yGjJP^IrS9^Gw~fN_M|=?0bf&h)cH4ibKYr$2gm7=
zs)0zyKvmxU&$enrPvmQ!<EHPH_~*x;hDJL%59bSXXJ=Y|H_}?wq#vpp=*{!*_(j!e
zH+d&A?C^<hZH^Ya-Jp^mxAB6HWJyXZusR8(d|HxnE1Wq<WRw=Q6GxHq5>|}FZIAFD
z71~Oat)(B&9k11q&1UH5w9f|P$j3QXx9xNKA6^l40K6MMkRXxOEuCbu5kfw{tb%X4
zOB95*mhxctx^ah0)j}*AZ5LUpwnmU81Wta~(=d126;L($T&9BY%bK{c^p{z?y&yxZ
zQqW3beP!GwP-WB6b=N}r>rmar&|&Kx5b!QAgYiZ4%dcB$&318{Qx1H-X~I>%#Zg=C
zx11IA1r<^n7FNL|B-MXK{|S-jZ=`b(v8FV|H?;5S7rMS?56qBL5<b-<Z0cTAx*0!v
zFMgF{;C2j~>OEWB*H1!he|IZA{H0|jah*P4wc;l$l}xCKRKAs_7OhP|LIDNk(vN=%
zZ~FX2`=mKs#OJPRyn(l&_Og^Ol5<OgM4x(%QjL^$ZGMGEI3ub5W$QJ0)!LUW!JbOQ
zluF?5bCOPW{6itqM8O8~)GR$Arc0WLrbJw!RxT-NA&p%5v3M|&qOh=JTlai@^7lz+
z>%{bbg&~qqhSsgOh4WuHY|}V`)=@jU5~6zn8He$!0XHMBv{VmkiF<O7a(ODHul|UO
zg}I%zvU2<^-CyOS8Cc2G&Is37V;C38b`R)%pD~FJGS`euZzYOid@f2JNy6$rpGmfq
zs==2bg8D@wsRzLqtqix?&qaI37EH~Jzba+D`!3=gm}cToJ(V85(Ah3wTqn@&;G0=v
z;YP>YvKVUUkb1ba%}}RN^HMVqsT6<8ggovYJwu}_SEq2I$lgx8;JDjT*LOzhJ=tW-
zJm7J7mn5VAMI&qFy6K(clM*u5rNg-_yKJiXhZ%@AY$jI%{_(a#D!PgJc2kFV=&`#W
zYM|bf=&N$=W@61Z%+if{Yjvw~tu3H{-#n<5uw*K_rAZ=s?#Im@Yw5)SLwifekMmXF
z)>kd%CMY-861Px&6RNap@0{3S^#c#aWm_@p@_nutT0C}chUq-tiV5wK%}55=>l^{N
zdS6%>G!+b_UF@@mweJlFc&B~d`5(O>EpVv1kH!=TpH}WO07m%N7CV<zD(h1b6W0nD
zFLSmn+Axau9a(Bk-)i&Z@WKC%)_Be37RGCiCT!F<(K^BvY>R_^CF{&@wdZo_q(JG4
z18P)qOTmO+uY7L}X_zM1PsS4YJ#;SX#8e6lIzChA=2^Fi++`?(xU(bOn!DOt?=qs5
zM@tHcta+p}p)ZBNyyT5pYt@?~sN|5zH4{rsMZ4a;#?8q4xoa<W-3m#fWTz&Xo3l7o
zl(83+<*}ukak7r>p~4cj6{XTdJ1?Ex;h>(UDPNE#BSz;etOQ5N^(eadEpfg5=!y^1
zu@2~|mIAZEca&9V(DG3FjMQ#7^#9m3&PB6foTpuYOQE@5_?OX6*0OPxhZmpLk4qY>
z60h}5>w<t2krD;wfyXPTimNeL9!7s)s5ByFI{6aU;P1a-J?rWXj0@n(BfheZGpsi=
z1M95uM+i2WzIUhtdZBgJKmDPrN8#n&&7vTY;Z^kD-r5AjxDn1X^Wsin;mxtA7J93`
zwD_s`sU$1BXW3UZ0Xk4JmVJr(`>z_ozWFBWq=_kmYT~xu`1NEf!ZPmU_c55JDg#B0
zh9@BUr@jAET`BChaPkcL7^G=lb)&bCPF^?<QhEY3H3>7*a=r7$dj~W%#o`c9s9i6J
z7?_`0XwiJasmJN{GSDUY)~9s6;gD6NxV+;o|L;ir&1)@}I=Aqh0K1=(75M@Qp{eUq
zP>NqrlQJvno05T076~!r@c&2DT?V!Bz5l~+3q{-FP@F<>2~MDRad(OrFHUfGch>;L
zp|})x2rk9l6Wk>@+<gAO@67!uugvc3>}Jkn_Bwm^eGxcmC3&kI@%qPSd39fkAFtP3
zY|S{D&`bbMEo55E(@HXTVTbl;`DR^-&*3_-E|l~fNiJM-R;<P;e=N2tlP%U%ueB-k
zKl(0T(bzl3G%C6BnrRo6wPT@93yzgOe_F1yzw(m8<*JIe2XPbr;TgZE?)#2?5mit;
zZ+FhQ84gn{Q{_HuGa1)MJ>Rby#?MY2U7U6bdggb`8<~sUPS0ceB~TGL9?zm9`ROzn
zqpINghv7NEBvn(iEn&_$9MV~>mmPHrwOWKU9lyW)KlV4-AYEo7eI?Nlc0SRFWe*ab
zNF;hu%4)TlClUR<+j{UNw_neDxpH5CR0=4r<=uMUpf~*>g_KB>&^B{}4ov7Ou%q^l
zf*+>pHq}mLnMkcpPi5;iO-*H~FSM9{_xidn_RTtFXWfS(leQF^Pq_hWoQevPm#yPD
zgIN|5hbvQAecu`x%jn3Fb=;Zm5E3DK@?javReX3xbXS|lZjY;fF*ew^91cDV`*HB;
zso|m5lYO&pS66i&ejz^;ba{*<ueZF+Gm9Q$JmoCtvb@{ogS|O{F&pKYqv~$j&7tTu
zE!*&tH5_1`eQW(Q(vvH4*G)o(tmvt0E>DK6P*g#4@``+6iFz=f?@N#c_v$P%eVw<4
zcYNCF^iOYlk!ACoznod{!GIud4cNZCs37GY&H95mzjxRPdCr%xXY$>GywvlGiQ~iP
z^Ynnd7tlDv>l2fE-H!2L<|mSY2M0t)?QKq@^h-B`@t?46oB;~D#2d<~Gnqiz7!f7P
zQ}O)G<o7x2TzhO8jnQ3ejOc>QxOaMWp6<QS^fa?yjaO@*VduH_{o`HcHj``L^7%t>
z8=zbRh)4AHRk*<7U1i_a9646R1ai4{^&Iir1f%I(sC$$~`2(KVBG15L-M;C}Uc<y6
zXo51GtRvv^h}^Ctex_Oqe~8BVn^(5cl3R*;trWKL^7f_Lw1oBqMELM2^+(RVoe+nf
zK(fA(H>`uBRXNRRE|o%~`E=A4x2WZs+Mx&qEJ%i19-R6n?X|-&RHR+oE!@x7f$3bC
zE7Q{#{nWRX>HH{pl~~uU>d3XU;3ZA2og{eJhd|wvn`X#!8r%KKGx5f)rV|2~{2R39
z=8uzV;D%GXuAQFt1?Ho@$uSH`_fO@BTUC_uGHYgHJB!j^Bbyyuej#aZdkju~+9Be$
zyA2Lif@fMSv~3cQ1*no*Y$Q89ol43HU10DJXa6Z^wG}eC$I4=2DxDT?YKtpyn#uN-
zIjB+A2dWJBm@gx3*Qcrm)SfLicE_YW(PRBG?3wemF<t9e6Bch$!L+elY4BYXM!<>b
zL~+6aJzRdHyB5%?l9zmXUP2l67V^NYIws%LB3d?I-09O0%kH)HO+$ip1nO5u3-Q>P
zrwAdL20klIlRq!jXZ2qGNc!la-dPsV(Prp8PqXD%XWOciJ+VP%JSg(X;;c3{HGqAM
z<I~Slix+eYLu}q6ItKAho_D^$>xsHHlE0kQjpV*1k65LXRTO_H0jG(V!sFjQM{-@W
zEt>E8%h-R!{Kl2>U@xSEQd#J)V7Mo^gdyWTed6)?z-MdG24RvT>K|d}p<(GmP|rhS
zUwUlDQs(|U&tqwd-HM<9Lcm#V_AfJbbUGscc>w~fJ+mGbU3k`iEP2cGp4<j=g=m@I
zc%(nSZdC1R^2xOj3B0RyD{xv@JarPKZG9mNs4@J#+E5#9E$PNPnshoh3ZC1)hP^3#
zZXM6m?c9H+!I<%#cTYUzSzU*U+?`kttI8l->*&Cg<zaH}GIxFg+t^9xF*C*D-tvHO
zU8Uh~D%tqg(``_Yp>_sc<3w&E0A!d}L?d(JcmS2v{XFPicO=DNbNXf<f!8jDbg1B%
znZjFXyftpU_>8-gNetG8e&;>xeL1pK{HzmOFPX(DI{c(x_{J-y;x~D}U_KhOO)KmE
z!ymL9gLZE<bh>f{(_|O8KqvVx&{qBHd|c&l1t1-RlNYoUpKb=&or|6b9rBu}5#TG@
zW=>H$@!T4hcDJiRME*XGzq93gy6nIXJu+n3yy;*bQ~0%2{`<RMwYQpPQVWpaJ?Xok
z<9tr6f&>e*xQDv5x-Z2Oq#T2(O=^p$^mt)WD+X$<BKxPMcwt{{^<Q~+TA(aMt9aKm
zZ}T43nJDoD7JzN*H{$td_$P|35cA%i)uDkGC)b9$kxe@-tYG;bMKkT%6#sHF&BdW5
zVXvfn8C%rv=YW4qo=VJ-Gd57})Nwm+J+aBjw(fpb^O<Wuolax~8cUo^Bd%6aXXGd`
zri8UrSs*fW?WPTjKHI;jmcB91I7t@pU9JKX4Fv+l@=h>R$D^UVB-mObPlT0BZVs18
zN;BU6U+7S?Z$pfC>{d^SVO^0Oo5Mx-wFKhGur6ZRzosz_zW@DuH3g_gpTkw9IVS5h
zW<LWu>(6zKKIFfzy-0x3A&@OVj_O4<^lQQW8E9G>Ew`ugxZX-=D~b-Og3q1=;^akk
zJa~lK6-($cy;sL`xYCYg1OgTm2;)x6oC_ULQ^zQ%SIR6b)k%rh-UXuA8Q4^Hi3ICf
z#1ne@wAC?A{3|>U)z$g21^|f2rpwsT99X}<a4vZ>e{wa>s|qj|dcPqf;TqH6!TYek
zCNL`{({;oc;eWEK`nK?K#DyjZ!|62pI7ivND|K!6H)2!HQ;st6mVtI9La_`{pykfk
z1NCT4!nEfYo84OFh7=N*iWOYs{4mKZI0ezk-;}H(Uo&gGm3q1XbB^%lJ}h&oya-5+
zIVkNtyF?HBPxE_ea7#SdJTNgMyJ0%+-g+a5seR(#50^3s?a=%oQP_nu!1(%_$<6(+
zlp^ji&Bj9Alae{PMR?vABG|Jbhw7LrdEKeo2;L&3lQ*@&pj(>WeE2LJ`CP0s?zn_-
z(t2DcwCa$}L1VvelT%0@@w{-KIjX2e)K<GQ9H71ySxu#7Z~EOV<Z^14NIH;_n4JTh
zDmV{BmOs#vAw8J;uA5!p2+m%g>97^(gR#t|g_97-0^JREqpw823~&w9o*cHtGc`q!
zj?~L9HHu2qZdkTx6<JMn9N-QGSjAf9$Gf@R{W0k_heRx;rdARCP|jV`-LCh(=3qco
z*p$^If{IIEN7po-X#5d1KvbIqdLG&qqV7ZnFfiae8>T%8S@x3)o_ajc4P?cg&l@bm
znWPGE&}bk36&ovZiWBATVV_*>FI>vS58J`mfaFxiiGNBs-L~&dz1`L=h^X9UUFyEc
zr%aF7<a4?iT^+kwHF?J~JA8me=@lK`XD7svi17xdTEIJY3#i(aoH`Yd*iM>Lr5JHn
zs}e<`JWr^fNol~(`vAb*DeI<_l5g{LF+oIjm^CHi11Gft09Q}>=nLZml&<L19H-9d
zWvUBv`ldJBqQ!Urby;7aV^H4;zfVrFWMMb2n9)f#!C%h;f(VI1HL12FBFYLSb_`zu
zYB=imugHRs5^GU6UW_4sMN}poa{ck%(Z6E*Zw@OT^4vysWz{}apWHjh#3AIwxLfNf
z0M5~Q&-T*>)?ioI-E_!g^{$J3mJbIKujA&|X>Ir{d^UOzD>=yp5uR}}A{@`bP)dh-
z#I>rKljpFJZirHK{p3ePo{TW@!N;v^H#Lic*Z%bh)VrIH$s|D1(mnr&kUy)N3`Au!
z=4~iVl+j9R+M1;kZj*M93vVs~vUjI{Ykzc96%BmfXxG3meK%op{P)9sLeca)-S6*c
z0-va5X_2$t(dt~TY6FJ+%la$M6k-94X(T{qz-Y-Xftm`!N(Dca{+8iE7q4iT8KEa*
zs1zYk5@nLnc-<Ly$nP=$iV}PapMN^p(!I7OWa~dshIQp!9rZ3AnysR9<|S+>`ZQcT
zc?L@qprgq<?WS#{X2!74)t`Kfk~6U7gLO^UxBUb_vpr&uJ;h(!2n!uckeO<V%((f@
zF#_z;<li#{%{H7pI}|9tSD=jbe(PDIsP@ha|79_%dj4Jv)`>nMl-|z>V7699Ju643
zhiXY!K9Ds?;oX8+M)(%>74b^n6(?oFu>iw+QW&@_-Wnjd24Otq87^V6U~Eb|D<A<;
zvH$l`_eX%Fkn~v}y{*>7=9$B-V+^$(lH2WWdp*5FT%m{ZSg+7&p?o+Eos&&5+6^Rz
zbrLaH<DApWy@pEe#QY#3BdZ?3Pi@-$kx;ZkX^Eh1Dk&f_#qD_*5M3EAYOm3nCwO}?
zKMO06{#t14<7@ZTv}+Mx7?!qfpdn3Y-;gw`mAQO6SAgsGGkJ7orvV*Ek9@-G85)w|
ztY}}zJCUGh$!n@;M@`+G=rfsKQ2aEMlZ2qi@Et7eu|)nf#E~^E8*@AYXgGZ3Hnrr1
zshv+Ia8d>1jGcMsrq46)A$*P4RD1N4IyD^E4VFFWb$2Y?((j!^aJBU_fex`aSUrDC
z&qJgT8$7NRed4kIQ4_u0dRD<C5-yV<_JHGJN$a5I`6QD8r&VhPSs%;#rS18$o6|XH
zpS&^&$sB<$I&jU0(W>1EHCqDw@I8PNm<cM<HxvqhrDvSGr)U9=72(p~^C<Y^h%;5c
z=#$NQDk%1qQhD8>Gor7lO((g3KSAb*zTI)J-^))TIZZ|g_u07Oy0mUwo3{KPFV-$C
zE!a1|4secovKc9S?IGl_u)f=R1}7oWlImGpo~-Ggxkk>&WV+s51SBJxi?qqRxRQ6$
zQg>^G+9j&4(S8iarxQ|yc$UIxw0}SHN1hfgWF{dNZ?h<-)&rnlVO_ixapu}f1P<8r
z_5#zu$tUU>nZ&pAZR)9~vPQ{LevYD_VcdXox;wiVl>C()Y9jUfOak?J-OA%KBI$iQ
z{a8JY<_3V}*TPPL;z8As_?vWZmHSL%sbV<8>0OW*Y7<KcH)+yM-rg%KSGhm_$AT-@
zj9$4Wq;37HgrsK$$23$;pOr}cgsF8csv@l}-^obo!p^!7xjMfW%FnV%eyXkN=5J~x
z3lYIn%n>#Rf>!dTW)4B>igN@5d1_`flDb@`-Ze}zU%Rxj?VSWx6m6wt{0@D*Kd25Q
zK79OkXV>p`mE%2RkCxbMK48YcJgvW*Nb^!rqF+d8=h_eLL?AC5Hjn-D$RnT?eR!O$
zq#)xrojBXHc4Bc<@WE}%`#UjtW2yj+X%`OZ+Wyuyyk($|EzL<IEl~8PwxEyqKW<Ck
z#3Y5YY_wpS19aS)zwE!uzS}!;@fI;fUM)vGAX+1M!O`oAR!*>FzR3s_qs5g#z%^-2
zJqlBx16wKzG<XiF0x?ysJ_KL?xpgRWq%6WGL_1VJhiMn%L`1yJnf%e|_&kkfYAM=t
zs{iKrn*i(b^vH<Ke8)6G-M98OT^EyX^)Kcj32o4vD^cZeFk$dT0(=S;j1+?FTbNqn
zr?62kUjSul@1vaYS9RWY2KGd{P$;7)Oh(Udq5zis#Q?Y$S@G1r2_hmnffjRv!_(*x
z$lLUD+Aa1DC0%fwbm$FlH#~St1-nhjA!Qdj)lT<~9$ml0X~Yr#SU)+7mr7L;(i20{
zIg!rsQCVuQ`Hp8T8#i6sel|}{2(|q<b!;Y}48QPRdhd1Rod!0)>i&@GIfRFk5k0%~
z3R-%*MVwKJXwGjaA>Y|%SXrE7rhnT$Bt?UxfX6GD(Dy`|ITWPYGA=>~@*OZ^-vpm_
zqi+<}QB30nUkdEpz0`&zqha9Y)?M6hwWYl>z6M8gTK^zLI{2_MKcMk6m@Zwe>BJe$
z?Lj{@q4a$YDt>cj>R-;k8@iZ@Y)e(t)IH`^ziDwgI)SyXb-L!iM6`7S&2&q9ZB7&K
z`eVrKD~Z0FwA>$2ufEcywYE_3Sl*m{cEj4$l-75tb=-uyr<f*)w{g9=TFd>69?kGi
zXU@bi$LxmV6a#GIf%U8ECtI3|1J_k#p>(lZ+_%4+TTc=T<jB1E-nbPVK5+5tb<I{K
z*#VCj1KpSW%J68{?H4qW>Mk~lD0_GE1@5w`BAu8JYi@o`bnF7@-#O38UFI!!8d3M;
z(EG1nT&KF0^N>DRlTsC@{s@o*65ITr#_4c}=oK66ZpLMT>L%jC7qh1ZWdbGnn1C>g
zWkJ%>R}(P-sV$cUQO9HgIj%`hm=!77h4iseNAF75g#bJ)Qyb*hP?Q2`qGNUW*9(jF
zxVWTyYSs5C%a*I-wMNT>kNC?0^Ht!<?W3#1S7PY`p7(o^o%Ti4XuZrWi=DUV=G46-
zM=!f=`Kf#2i)ZW)FTAIF)E>D+uL;Ow1O}hm%bkFP?NT&P5D1+ki`i{<KnFw)96{Kz
z+iu5(^LK-&*g5+CLC|?jEx-yq$F+C*Fv_KhtROU2-d<_f8p3CPZ((-q?7hq-6SQmb
z9onpUQ>7Vx#y=Lze{=Bslz@_>VQ-zX<QSIDe@o&E!LJYqO_L5Zhmj*(`<V(oGpnLx
zC&NF?Af!A!Hp=nfW+|xdKkVtp5G>`!wHA!Ddh*Wfh4u(~eIk{4aM_X*!sXs_+*4Y*
z!7(@OaVHZD%<kDWSrHu0roA}*aG_rb+ea7N=dWmldAIXuvXl(%?r$dDykD1N@ml&S
zHwp6*iAOI!vTjK^8A(Xjbu0L!tYz^+Nj~_smnt|+M)rZ=tw=TpTQO|~cVuTb1MxUv
znFzwxbHE?#TXVH61HKZ23r*8rdE~#AGWsD{X0@A+NSu<eV{aCY#WP-n41{~Q!&135
z@JX8Quo3X-o7Ry1QsUKJ2As4bU6t(`u+og%+hLYMOHdj5fk${@ezewMvwz>3+rDk3
zRwjhFtZuRU++kvh5IkuybrJ+mko`YqhrKf4<L=t|DCvdlxIEvAHJMC`fr|H^o?XN|
z>A4PFL6T_R^$Qa#16%U({;!=!=?l#S+OfTCLsp(<F3-X9`9i>ne%_L)&J{#Xl-)%j
zt@{0wyiyWQ)t|fFuN940zT&*+e=>YyraXwxHH(CX6%#5SL+;z>U1eG>h#7c6dMf<t
z2CUanM$=ymPSNqSRuo;c<D*XWzDGRlk8{Y(wrBsQqg5zXh5b7u_@bq(0M;%ZPM-&e
z)@~6dUy8F;$UV%RZxN<A-mq55J*=Ixul8`6W?b?c=(dhHq0fuijAMC&j#-@0&9~h-
zhhLuN3w3}GtND}9r=2X4CJAFvYRSiSIim5v#Zf7(MZpL9;b>LNm#dy2#be`#5;G4q
zyguGe@0XZlVnwjrpyPR=m}(NSB1!0=_k+r3hS!}zdYlal1U!-K+Y<&UnYQF!c%~3y
zUNoP{RITM;GJ29>(U>i9h|*w0-Rp9$Vo!n$Q4KJ&bK<wv)_=IBkm4%wDbkw+G=f)F
zh)+d7C-}Xx^o4B|$&;v)j#1$$)`EM100T`x<%0itzoyf-ms9%7VjLZxw|lP>dU5{b
z)!kxaI$lfg^wh8W$D`#@G+L7cRTGa?ctTnaYC04*eYLQivM3HG2Z2N#>vF5cU=M%X
zjHW6gjUe_()V;};q~*3_?;jeoN|FzI-RqlCjd}HM8MQ3!vj*Tl5mQ?h!!1`DzBPXs
zWFl2DwCc5=E=;ix8IPc8q-ubwRLFWxLe{fGP9koV5cRhw7+<lVuI#-dCnQopBUf0L
zk?H@atg=#fdnmnh5-7{i$K^7Acuei3B+75qr)q(O2{+2m3v&DP6;3C!5*ZzVy*2US
zL)EFfu9_!N9Ub-ahwiicJfVq``GkZm(9(-#dcjGnL1gXL<id-J-($cq8Qt(Nx5k}D
zgEC6mx$4@M?m_ZKA$_SRE1W|r$H!=j=)NYG&qC}2>nKyduodn(8DsB6bMP~Q5(USI
zI@|sgn;!Hg=d!3_?+QpONkx5=M@BE~b63R1rS6|TN|_<vH6368WScb>=mS0ZYUr44
znf$JWS6nAjL_PdMAS*5pTyiR29`WN_-Or&3xW$4lF8asn&A|n3TXjeN-jV525sIB$
z+}$1T<-bC>c6QIM4DYMGlVAoBy4Ow)0N0p=EyrzE#Kmc=;3QzMP?RSes;w*vR*5zj
zbH8<xvn4Ma3|}FVe9iUdlL?#Hg9N8DopxGn%S$qgqzzp>w@%T4acPd%4WeLZ-aX55
zDZUdwD&w%{^Y;luxXD)S-l%Mqmmp2xfP7`*u+1;a&99FN)qV_y?@D(81s^V~crmw&
zJ0SN+WsDKkM>^$z65O!F)a|2Lxahtzg#ribxW3IpkB_np|2cTDGjoTID%(u~x-RdS
zgo!b|l3sg7AgXwG#@e1mFYEi|3dofB0gX0&C$%i5mwjmYUlw)eiu2dr{ZL#Vj@x2>
z-6}r4?uWX1z66BVyZwVlL5cDhsPIPqAJm0`Fm;QwMWWqarZ{T@J9RRz2B<rYrn};U
z8g<XEJ&5S3?+LxKUP^hY^StQNGogV2Php0Cb?9crUY!O^HFn8K>-*h%4tx1BAN8_<
zKoV9jmrNp#qi1_s_DAfNbI{0t8zTCb0YmU(?N-4hyi?u6o}r+g^=^t-I~k#vNBmzc
zRMzU3I+B-)@l5`}6P9lBo17q$>phS!q9&~KPB~{T@Ql90hP+~3@L>83Q;@6kIR6T~
zn_OAHB%7eRpU_jyNml_+fT}GOj1ne<mn{FRn4&fvkCPKyMY2j>IxE%9-Wdm!$nBZU
zv#e$rC^>VLrnM_KAHh*23%PZ*k|bcY%kxc)TK0TdU)x~^*|C)--R`Q?|Ht6~SNWN-
z4>eE0`n!E{75?LdMi1!i{W*L7Qs34D1eCTFuY?Q8PqWENh64yx7Gt8OBjpX%iQ3{s
zTnoVZUTBQ&XS`q30*e}|{-|ASIEt1a$=l@EYbuPX*@U|^9;=4@`Fcwdbl<j`I-M!F
z`QiOu?v2aYGz}O_>b%qaLX}Vf4srpV9y%ls+m9n<=&d}o=&GZ&HMt`lT6v((B)tRJ
zW_QbcY(umx=;BI0JW9lP5FGmR)lDU%v`$g*NH$zu+Mc^r5hoCijY{|0ui#-H{7-)i
zgQ2(h{YPThldO`A#qHH^3l9F3oSrMxVk)W!N_~&HLrye+mm2ScccQ2|LtFK~jnWG5
z^OUmTU;+&y{{0#P$7Y#2TpL#}8O~E)twJrd<i21eAb=oLWmDhER5dXTZj|&#t?7>g
zBc2an4qrX}EN`ZLm*1b@pf&+zKEnT%&kjC}7=o>N2nJ^_oi%kMHF_2?hpi#GsA1P5
zloVF%4IhZ(j*-X6?R|G$%71$ph{3lZ&4`|fkUyiz@$rycmQN@8N8<=ApPWHwnL?kp
z?}R>@pKD(eoq_GMU#3C$Raru0Nm-HTcra$n@xvMehuqaRNH=K7T4p5ssNTJ|+xbn2
zMEu*~X!(c&gisQP9i#-}Ok8PXro^;ne`rXc0o_BxNo(X8DW*>@-Ac<jOKnJIZ%k~=
zb2jCVR^FrP+M==&l)1j{%$J|{q;+pz@R99C1-4Z?UnxOyGKc1M5s7DQ)5PNZU8N>K
zyvK&ab5cDCg3u_{v}yzJNUwF<z(-xjZ@g%JjhE{b@8Q{+i#&CP$vj5`brGL2YonRc
zI&6|Dn=!sD4+iWnn{93tx|lL4{KyRUU1G;aE|<F1V7OEAVV2-rf48Yq3Jt6;{XFRv
z8MuB)mFyK^tU~gbO<oFB1&?iQC^Q8N)Y+X!v#v;RvUiV18hluZW}I%>EEjHj-@V$z
z&P+1i5=X2BbSe6f?-QX)s(wr3jc4cas!ZJeAqp@4=7HOOnqUw+3b~>!TZeczLDtj9
z-MDxwn?~TRhlPxvRdb(fToBKe?2=4X+c#3q&FJd6?aGT2C(K~a?|Ax*L?kido7USs
zR^oxZSm^6ywWf~yOt(S-n-5$jBNf%>NdkGB=-2$Pczpr7Yr@})#dOnUH-Td-PnU!*
z?jz?*6TFO42(IJ*V%%<@97@lm0&h37`!i~Jk^ZiOo5+JU^V%C}>7ly&ztIPph68aO
zLR^^8H92jyY(k2W)tid#aSF}cJXq!49=l`C3?p}Uv%PQF6;WawxIkvAlxXaYOFgJ$
zsNUP?Debgh=MU>y%rEN05O;CK46YNGr)P;cIzfq8p4I;OFisRiMY9G*Krdd`y0>Tj
zBw4=e;8<Br;?;|F*t`N}WRjF?yYvfH5>fsqWVDrq%-@F=5%7$KQ(XUi9I*VN1FQ1s
z>!YvmUEYAdXf(IvoF|$*zfJQ{xI2!@p}WNBp84ypypdKbb&8_Q@w(W!h-vDZ=*+0v
zrx<#tuktZ|qMi2ka=BC%4v4t#LIPcz0!n(nlkv{-z1x--nb{<a1zVDi_7Y_1FFV1m
z9yZ82Ft1gz0aMR`f+UxTlRnJ}H5da9ru7DuCWu=peA3-s?1@4seay}Y0e2=ezG4Fy
zRE%MF9`FMGyzN(_aCw3dDX`2lEn48XSS;8e?#71S+Yp?&Pwz>Z3wrsR@t_n~$dr0S
zdF~Df!!=^y5<fYL-gqkRaS0KQ^+9VWO0;7?+3qo<l8$|x&=cH9kV(k^B8n{9Z8Uwq
zD?+UxG=24^v7AKUH;7%9pFXk%B>4+m16s$ic+u5axqfu(CqvW`k1*QiH^vC4poA!L
zKSyLc48n){4JK86<czkbtxcZTk+6w!0NfWNgR&+hR_*znH?eF=ZEBl1mWTp{LM~$G
zDrn4exId5L?*_4m?N;;NMG3Hz^Op1h%$jWe%APPSeB0{-gf!W3B^{M7e8apLI8Cu(
zTgMlU0X#W<w*<{&l<Dg#L~<`s3EKWofeN}8E6B@zjH)xQ43WfW2-hqsk@O<jaABQa
zgD7+}$&=P1J09yD;hup;hk$NoDflF}x0j%cQ6^^Kk7Bxad~T1GTa9S30Ek|wjTc_0
zx|7$Glw0_PfYynt*Z^&GP%7PeqId{0AIo_^$kXwy<L_;3JCa5o0u<CN;BueeU%X{R
zc92W>TPsGF@ZOWY@~_{n@y#C$U5$PuRCq+zk!CenR}y}I7;vG`|MOFqdww+cX`2rd
zfXDm>=$cv|5sNIbW}slaj^5k`_Y}uceL*dJ(d9$`Y$;KRfia!TkYJuilY*!kJ~woo
z(km>_gj#e_o_NTNTnO|98GpDNh7<<cyjG&3?JLP;vaz4<W~u}vpu7PdL4(CU$829F
zux6-41;5yY*_c-%3lZ$E&K1I^Vq4F9`N!zRF%!y!KHi;cYikvt9Ar;se9I@py66rM
zjdaAa6x@T<czmhMP9G7Xga%3>z5J`{qO0te4D!Mp{;6~CZ1adhcGS0;^!_2^j>7E>
z$5j*m%xWibqg#n2p78m~)mGA%6<5+EMCd6ibAue^t~ws!`(7>4_S<-j2T9fkmPlbT
zHV1D{j3H0`fu^FL5ob>WJHtm*+-o1c*DNtk4NE$;rFU=r)r_L@-Pm5})A_0NsCEnF
zKA$6iwhRRRBH90G9LP}gS)imp{u8%LiBZ%fmDn?8Gqc@*mi}W{{L3Wv%e8Iu>2UcL
z*4N^?f7T#%A%cQZ)vhd|*{VX%L|ybv>4qC0Kd98tVtJ>_*1z5n<77QmjAa32%f)*~
zUp}?eGVIlOqcPz=B&}4OF9^P82=taY!E%op-1k|ynlrP6e~!=ZUpUzt`<98>ylPXO
z`sASkdB~-E+ypFFW~D;>M7?n-J+5tYmB@p`^xJe0p>lqY6`BiyeqgM)&cA4$G>j3K
zdW?VWJ!lw*nQz}+LgoYgNOClB4QNvl$i7^N17kN1p$=VCV&m0ur(f{eXDav;nJ_ew
z2A~j6$nd}SA1Kqo;`}IsHbja%u+jJa$WkYE8f9(-Wk2Fb$Xe)GkB#t_b#)O5c>bxk
zX(>A_ZyF)BMDRp5-$L$A{%C+SIi1PpMj_Ta$P(in3poa&B?ED~4_i$>(z#@2Hrn~U
zclx(U0w0#^B|^Q*SQ$Lw6HHazBqv6)t3q{cNC!=kS-N1|E#OlP#GO`xg$KvS1hjA*
ztJFqilp!A0A|!fld#;9+7cj_UOd)R?af&C_k&a-&r0P{I3av&8iq!gjM?tYGdI;SP
z4%mLf5yF<eMHn8PsK_39j%$a6gZFq&-2NT1IUFVb4x}9#QHRGq&a|dbELn5@y`K=W
zynjUp_l^h29CNE#i4!rf3x3RCLt{xWkb{)QOi}-JlwAlc1<opG6u8tRiS>i<cyFWe
zL%vSD#qNUBr0%3?n0Qeg8vNL<|DZ&kdmbJ7uhv+YrX*HCZO?lx0!#C48>_NN+qsR>
zZLAgg7B!!($iIKN&$yt(y{2p7@1ggqee!wRa_;uuVRQ<_-JlTurd$Wy;*SkmaN(pM
zHUC8UHDaf~(bgE{cDePvX37~dc&<R^sW_i6&{Y?=Svtt#&kaYu_HW^b$(wjNjXS<7
zXzV-pIesoq1#p+&1ji1GZ!*GI!GvTt<rFKj)4j(@MxI6B_45gvz#vo(yEDygzDicT
z`I||?$rk-dgi7#R4AKy-mE>VkNW!OHrjy~5f{y%cLK(KJmzI=O>8G3l0a-Tqt7Rhp
zXzkt9ddha%<7(n<NObT}MxUlOHC?kYK?3Bj4k^oYULLp6=@!H~t8oVojNN=Jotc-4
z$NqW@SKMZvt0*hDF(t+N-5*Zncy|x*-3=CZvdm^o{rP?7Ee@OnD1+Q6olhBS!+mmz
zHMjqovbeuloG%2s+!uyfUA(ESk~LJgKRemHR^$K4y3_l&ytqW+gusQttNz!eXA-rS
z-X9c85Pdo0oJl8(IPWK16EtDmPPpt(uT7*z!grXEs@Ln!IW#W*QDZ*|kb}$*DAX8b
z&j3npVG|1Rqfw#}RaSPDFh@-~j{JnJLv4s6{I{q2+lbKeH^VeemBamXe+?+Nr}5WG
zrXa0&ggFhj4d}uk&9>gF0R9c$oscJN!eYm3xZiGC99-7K>s^1b5{QQK3Hx)7{W-lF
zI9#eTE=Dzx)U3f><O?Zna1oll<o%^Hy*KmLG*dC2PD%%hsddsVXPE^grqCxm!nO3P
zfpZG*$JL<<WLrhL<A4cNy*FP-hi)Q)2mwR7jm<&nSR!oZpbH8T0tmPvpYD^4wfg6H
zuJkmLYtJWaJcH~V(VUqm(^enUNPsofDlM1sYNdfaNV2pmWYGHchlgJowrKaIvw|?n
zYT;Ea4c@v|Lxx!SMrEP^ZOP1(&_7q`I(QzFd<jkbqlE@rTU8CzL$-DNo&S%8k$CEl
z+DQzej6sbRK=WWotVQO<F#m@pgS@S%GH+ZJTqGldR7>9};cCe*;)WD+fcotmh4o_K
z+kY{>eBL=*h{E5--*`lAI<&fX{)^%8Co^tZu~`G;f;5*hF|X;@4xhD5E#!mlanEsn
zuJE~w-q8sk5a@z2!?I_~g$@YD8G_P}F$L6Pe{^+4-eL;iP5iKbJf9Kyuuqw|PvEpt
z_ld0_Qm)8=r_awo_O_m?^?<-@#r)0rbj)D6!OcWioAbRe)tA%xCk{%xtdnV}!3S7(
zrl`^f0){A)`(QWl;O)-Bu<_bGwZvNWm)1LL%^EF~1fG=%+m2=RBmBLA&_#mL--EJP
zaTrySX(I8TA`?4z{)VfADYLO?e51p0{s7<G`Xx+j-Pue(#3o}EHX6+P0RAjr-2ek8
z%4CvA@`3Ze>m0Q^#fHwq9Y69B7hj{xC~WW)K&&dlc)FpD(E-4cNLEeoig{b6e}pTe
z!gv~76J6!p_P8#O)O*pdbz#zg=%UnWNHii4F$b?<ZdsnCMtcSz20hwqY}Jh*MbN1H
ze5Wy6Tk_``U4tdTv&>pcZT6m8<I~&LSP|QEV?60@=@?$y#|ruKHV{-n!&qbahUUi_
z(1F%K#1?!kU%w*$cN5!9a6i+&Inolra{f|!y>Ep45Z~Fa0=&q*c@fNYFw)BG)A&(a
zfwWIQ|L(V49xU4@k7cgp?PCk(`y_eat2l>?X<^tW%+DK`vnB1h6q1W@qUa2R==V^3
zo;}<_1J7Q=_a@QP?y<v(Ykfoh1CPxDmU<q&&fsFsll5TbkMp3O5|9sp#9xWeg)wA&
zc<A%NYhuI8N>4#ZLp?{iJYvuU^|k{!LK03+D8|Hsr0{d(HwqaYw#ApQzXNNC!-PN(
z0;xo~8$2XP7rDzY<Y%NU`|D}UzqL>MvXB=nZ|7FNLCzSExf^yxqY%?h5KZGAC1nRJ
zFNvDR-`4Q3E;#%ci8p(`WR$vB<6G6J@EXk#V7xnQU+au5z==olP17vzqufa;x0`Fs
zmS<>U;!l@}*Yu(Ea}GM8AF<{Laclh(zaKaFv!8@K5R#UC@HaiIT~0qL**<6m9o8(i
z^U&BE#agzO$vqI^0Ba=wuBwN4%l}?6mP@hILByqmkr~%|tyBI^OS(YR;`6@_!_HYt
z>*2+XcG|j&SKXrdaRS(*<T{=#t>l?>@D(AT2gR<Y8_XZfd`B877*qv&^uTNzEmeRy
zTQiyDZ)d2<<M^YCUw1VzMpSagHn*#GSOJ%u3G({eNe!OI<yAjIAKSxI0B?tP9X=<W
zMvO&N?@?V|q?o&0_j4-5@YlvNRUVE_1D&Dq-X=DBc9gIatY`CNwg}INM8|jbh9F5t
z`3`6G^o#oZHKo{Pbl=j^q+-%*8ih5jkSyH>NnQiHcd#sy--#pelHEi30+L*|Ahx<~
z8U+O=mbNsG4H~Hqfl>b@!v>}!`6MsTkUod2Bq2v84XE?h`NC{>3?!mlfj_C0Z=SG6
znqP#-Gos}44X6jTc0pAP^3!1%QQF^gE9_?NH}v+cHNE}IW^6hO-q(S?{-Ya{WNn=P
z)OTlMqx=24LQRg#IKMz4&yKyyQE?`RqT;@M*dsqV_#5%TwV7C@7^=riBv(`zi7Vg4
zJwwl1F=*4Yd(RK7;LmZ(m7x}Dgsa>L4$If9h>S}#S2V)54;VZ%YD^M-E6?P%C0flU
zi>wsL%AAF@iYyb{9|kQtdSOpPutk@JoUot#7EA=zONN0x^<xO*Xg*(s1@Wo`fT&ji
ze@K27A%6XgdKINaoDZBWdBFT>##6iY86wTd39@0lAl(Lib(hJ_p)7|O1tUp1>=lO<
z)%-B5uStG4i3C4X306qZ5W=SuBVMSIW$XJr+OqgLa!<{^&3$Fx%$%u5wfkJ&-GXC>
zhEM&52IzC91syv%s6-jk!VM~(<&cmXSNY06HqpcpmuQTh1F6!Zd0sdP2OlXZMUWl~
zc{D=MxVb4KX*0-t^zKzrW{U>5hLAN0h#I-{U4^l8K>w%DYW&6|oXw0C<h%g~qT6I1
zOBPRqSZV_Sx<+T02QVi6^0~y(H0vx?sWA^@Uk8!M4aOIZZqTr6HjA^-w&iKS_Q?0&
zsEi&dJuZ7dWPRGoy=Km3W~zAw5d$;0|5J+^F|Jsm%fBOp2WNUQ)$sDS1`2w7&kSjl
z>8G$QJxM8B&>qALJdeZY5cwV8W2LW{JschaPu(gzDFtgoI7JDz%2@am#<%6lcH5gG
zV-hcc(+3cJCcX}=S$6>0BwLH?`FZr8anJLxn8|jI)ae~^mU;8xRl-q=8;lV|cD+-S
zAv;HI*DbsoaigFA%v3wP)<qz}K70)qqc<&Y+$9~>fx_(ThbTkgD@c@$B%@B3pbS#1
zW>`s{aZSMBr5QZ|L*wfprj{;;iSEpa58hb0Wq+!a<7h>>^NBv%ZW?7IB)E`W`0cp&
zccpsj3lx`$7@tw|<i|dyLu_1bU(#ho40?0a+9I<<!>stgla7vRtne4D{k-ktfcP_G
z^dT7n(nb-6GnZYpmhS^>Qt#JJz|yXJz#cU;Q0sz*_yA#wOUcWz5eIT?T`6Td!`dGj
zTTDXL$MHz=FT7(h@E*FapGp4{cW)Xb-2BVk)8*Y7VZMtK)V8LriL+`GgYZt)7CfZ+
z5*ObI?N9e|UM`~`BAe1SJN&z5Qx(u+Hh4(;t>Zc-j)V)6V4#RcO!d{=QM>lA)W~=f
z#AB|2sI&N?*%ixyCs;ws0RHoYR7Qcb4rTQs?tCp5N@gd1lu{gZ!y<FCxRdQ0--_Hy
z*KD5Y`7924Cp=`3LZbE%nMES^d;$HvWI#gxIX)5nbEbNucwImYg0|+0IvC75R`r9%
zs-XqQ>zH9sBUf*8s0UuDHPB^HFdKNH3Akr11*Vg_F2{Xmm;+prjcTx#{$8#b_KZu&
z-!#S}An*auyk>djgT*!IB~HSQ8@`tKQ5iu$E!tWIpz#IFqN)2#RMT-A>s0(uKXz&H
zqIcl4EI?z=p@ek@kvO7@Hz>xRZHQFj-s>W=H52_ir_e<64r6s?L2}|B6v!vxZ>qyA
zH5NUY+*2CL3YH>$&%3k}Qq)2L{ZD4|o#<j~IT!^)-Hv(E`}2k5Vu_Bs<i_h;g<<L?
zFT9h(8NXR1Vq&VCX|=U*XO!c3XzSoMbUu~%>W<tasx0>Z5N2iymzX0+<im8)35^Sn
z(BaOxJ;ms?qWuQ;1~c0P{K)^}EG~rwY*QhnFg2$|jG66i*jXNtl|&?hu!8yS#=;Qf
z`7H(QE;-4!<^`cQ&~?B7{7Z9)0IT+9p!df^Iv;vLq@FP|+}3-~bGEJvM2VWRfglfE
z-on)e3H&#ozEzZX583Ka9exUZt!70tlM-mnLtk4_*ycvt9(~ve#k>>Cnyz*~)rxp+
z#ZG$wE;`D;E|(w@g}Uu87jRB6?tKp<0eE{R?YO`9Mu}HMZ`feq^?Ths&Ca%97juL3
z&f$5ZQuQ9{Qs(am9+<%+2CqQ5`14gETKWoqqXhC*Guf>2v>~Km3xYTU_cizzvGG14
z#q{Cq#@EBO-t?fe5$GZzL0LB315D15U#`es_(;O(E)s6f$n73>8h3)j{B)Z(y06=Q
zrXxHx*>@YG2OZsU90}R(VkMM6ru{!mWj*S@9{{0Sk~VABg#7=)ilv(H|1Ajd6z3Nd
zd~=}Mrm3p|#+!0a3LNzxK?~qZVqpwzK;Tr^U#4}c#P~R|`!$Z%e=y_U>&8>(gxcLJ
z!;M-|1>UUMU9Kp5up!r~xt^2hF~TOW*RrKCZEs`=`DEK|SSfg1we7yk{JkP!#6R~4
zO>(k-7UT$bYxuO~$WD3wc;XcbKaiZ*1C5m0tQM7iQjkizJZA`K9pS!lDCj`|H#@Ld
zzZs0D!?52O=4vv$Zd!J~N{ST5xo)zcNo<R_)$sHB!us=QY6x%hi*N_#XIAHZTylOv
z#!T?kr9h;Zuph}t;@qQcq}-bq5XGN$#gUIT2>)qbe8k%cp$hMz>|%8X9cErtWa6jQ
zfJFRo*>?GPhJ@aB{F}_%zG4VX;6#K{W+Z<dip{xJI=OhZ7UIlrkZG+#$LZFGYCl~=
ze)<<Z@Y~G41?>xUMjT#5@3wcTby7DP2VJTu20SCy4ts{oP@<OaTqr3fOiWOs>=2;@
zB=y3L-%Y&oDLQ{qGXFcqB)Yk=1Y}y~U=sfiZ(<&fa?c+a;GlC56Wdbtu_DL^B_4pM
zL+0zD#mH;hP%N9eL`v@~1g9*f4h`_cA|{TTw%KaVyIb{fD{mt7z|Y+Y9f-)xHOJbB
zh<ll>p6S@;I<|GEMvwpB7d@TFrBgiTpZ#IW*>eAlbALiATTk|Ma;ZUYw6Jpl2q-iN
zyw?=@DvMAYUS~4;!N@p8C-5^m?mO}4s8+ODo&&Nnl+xgS`cKRip+@_?5DVO|LHqA7
z-bYSnOCe5k{35&k!?b~w5(?1_tQtnr@~4fc3fTug6>dDNrF&@Td@OQ=rv{vQS~19R
z7A@Rb-Evz4&@+qw-CDt4g)FRUvce1VQ-bQbMMQloCZWVtTnjE9yd{bWAELiZ=kVW-
zj_GEBseWn9$lHc$k>O<yoWtpXCvX2gE~Vdu(R16fPbs_OomuEx%g;}c>r57hqc`v4
zXbdwWN8%7TY}2+S>BPLwSh_E1IXgSl1D7YJ$Mecm+jNf9ZzBn&hcC|gYcw}Sn2VB4
zm6yc?6_o6i0~zlNY3@N32N0*kJVVQf7!JMRm<`5AiK0DVZ{ZP2N9`|@rBIT@mRzzb
z{c<{7sG9qd(&J1dUT}8=tfQw<agIjrEA-hm*e+*9f@gC(Rh=Y2#2wK!CnfIEwp4Uo
zOO{i75JR+vS*JZd{u%d+P#Cab^ihK4s~na?=ECP)sI^r@+;U$(F1@*qBW7$O+!{9N
zdTtp!XlG5IvN|0xjV}?yYqcDauTevbFa$Dx@)%Cw$A68};=NGl4~;fT6cvtHOWilj
zUnuxIDNSipq1o^joc&LF=)FDI<_&Ee*yBkILA@zWUfIF200(tO-RrO1UIEsY5xoDk
zVwP~4LIJUPZZr6>*h1|){H264h2;$|sH|Bhch#yilG+SyUsEq#&lk}Wc~*`I79UtT
zbc&o>#>mkBif;20PVWnP%FUp~Uy6yHu%-`!@M$p%RzU3XsC7Vpxna`m5kGJ96(0Fv
z(wzUa#*;o1UP3IgJ}eqIRG=WXTH9su-aS)l$U^I}aN-P?j<%w3O||KRVh~j3X%%0u
z-doPlAq(Log5_S2CT>N~NCRu9X9O{!HMg6+#~Q}ZGnDO|Ap@^18}0iA`Mwul0e!cH
zm_)^~SO2qqg_89PZ0`dfypj0^MK0IDHHmw}XM!P%UgIQYs`CTg{fz-;m8o>Mb4X&b
zSLwLGa=Ld_|LC_Jny5V0v<u0T&`eQSRs41mv!l>T8|vs^ntIGg;Ptbz(>dlQCAox9
zW$l?E`I?q7$7F07gV#ccs|H+7<YHj`(5mhGIRTFF<Y7m*SM#YcT7s++qFzqA!$c;D
zB0!?l7b|AFmK~E#9`(+Q1zAp418J$W^vHO}p^KBEG4UfA&RzSv!Lfu}6^@&%cTlpB
zMjk9nkS4WTjM6K7%HBZ(5d)O1f(@5($;qqLXxi{XY^Fak;$tj{^7>Xb{HSsJhd+F$
z)Hr~4f=jlUF@PqI!i#Zt0bMXE#-z;Y>R?u_DSngLR8C>GT8rn2RvkVPp%NClDJ(D&
zPs74Uyd=L*H4<MW{F+fz46-omp2wv#IC{Qf9@FK`!RQ7Ga@RlW%~CyE82#g~-T0GT
zGtQ?-+3>F52QCFd)?2vou+fRL_fPq6>Jub&6^95`9tuOFY|GdTcE1-&EhfbE+)$Hw
zIMsX_)909T9fBeaLQ`(l*O*eInlq~#4+Ip~81a9T5aNQX93=H9VJ-qem+B`a=!CpO
z52Bxwh(!q)92{<fS?L-Dnf))M3AjZd4EVTU5{B>HzIcbIavi$(|2lp!p|Re%s0%+B
zNi?COHm?A)kB4PJnkJ0w_2y3m-1q1N4r_<ZT<b&LT<AFeqYamAoR=G2yl9Eh(KPl~
za)6_IMG^m?>DwUy&nBuD9+CmNln+*da0gmwRqzCwJWC^r_@-CWQC-g$3Sng+Im>qk
z8+I4l5yJx`-Qp60R<Rgm0v0IAKX}Q=?s!iSxVnqX8PbeE(J3?mXJY;F=HlVfdIHk>
zo`PHjWNmrMD5-A+q(}{1I{qQ}qW#950Gd6Gs{icv2C8T8tzxwFS`-MM1T2{q58e%6
ze{mJCsZ)jacT$U<;Jjg*8V_Fzh;w{LA+gk~U3W%tBavHFs#;F>L8DEP|48w!GN+f1
z_wAqcd*1RyoZt5q8z31spDKt2E&n)<Py75<Jwhzb+LV}Dbc@yosOR8WWeL}pz4G&D
z`UT1e)0x(f@(&mpwF0u|NfWWfj~<QbZp{78wJ}e&9Hd$S+m4Q!#{;f4d42u6V|qNP
zJL?Rbw!5XNLdqKPfEtjFV(#s|u_#^@tk3aB?rPqzD{XY^E{maYV5ESIpVu;k@JvUn
z^c{4WWqf0Y@-^IA_h@dsycKA5{)M2$TmL!h?rKqp>Y`y8aOwBotXS(4JBDBEau)Hm
zv<5i~`jB+mzcv&2-{0F=A26CtSiG1vfE+*VRaqW`Qx}@1Wp=djI@OjFA6B$5XUo2j
z(FOz%m>B*Gh*qSea}&WwVqO4Z2a0br)cv+YjRg>;ajQJ3i<P1bRZw}k!=aZ5Uz#Ob
zJNZ2?n%`4}5*wGs>k#4NGpb=#pAXuoqGP!ii<p(hDSf~&2pjz7%`5xN1R1>u4g<#%
z>tW3#GM1rZ@lx@$P?pdVI1wm7pWXOenOW2kO=<EUD}Oob`t}amIi#*+HasIGtQW{>
zmA1vjGgdhrTIaI<C>c!FY;kVD{9KMf?tsxnXNFbriiyrwFtc44p6YnlDaOCvMPhie
z?I(IiB<ck{0*vOL`Pe(UjX?9E(+Urivl+^(*SiHl-<2DFQESWX^Q)a<HsTq43tDOK
z;PxE6&UjDh8d)Px<B<L<Jiclk#lC$}w^~aSIzrV&xCkB*Ll;$W9CHat)np3-uVoy6
z090;8CxPcU<GRPqK*aRC6&9F*S?ycgUSO;&()RhmZwE+mI<u@&GqqJ~5^@TeBNU2<
z?tx2TL(KpjkLSm?=i22Ox0!@`b#))?mo0;jqbIq(jbJo>zN>Z2+)581I*KHj7^@pD
z;NV&qBRR;A;&D7{ct51qPb_BlO*Wo8pRc*<V~eYXu#MqGAQv^PcR1HGGI6`;?sqnW
zM1>8=VTF^NQwI{%_>?ghzMk^wAi0oad75v3Q5y|Y175aF347CuJO&+9FJe~tMC%nN
z7o%&sL<t*d&%OGmuXSE4K0I%gfQ{vVzho`N3m5plf0jrb$z4EVdZ2{;4DHWjRuLp;
z0Ce)VaTkD<dmd8FceoiFRU3?E<vwzkgReQies*K$T3DzUOxdU4WTe5dInpp0ar&2z
zml)pggEvuqNnV^;bG=dNl^rZkSy-D5t7x&P;+Av#w!(KV{o?F;E9y&lpW<M=ns=y?
ziJp~PMj5giGd4ipOt$;$bVf@ZFiE^)CZDBw4Z-WIZh_JdBvXrPeA?a0-l+=Rf#oeI
zGA%+mM$Xm-7Ol{jt^}4bXl)GRPjfm<<*4rx!P3^O8TVTa@XiWM6>43RK_hY}Sq5X#
zz)4!s$08vmbg&k=(9EHBIlk*T{cBPdc3Pa7`g^Yl7zh!AFa$)mR;)YDM*buLo;3K(
zFhEvjqwT?$=PpwT6TqNtl95K$!pF4gA0nB?yE`cY8r)=zzZ{QNbekBCAsu}ZGNH1z
z#;Zo#oGuFUW*k~8)gZ66w_fT}ABZ)n{voWFoiK2pm;qB)%KoX@udLc1-`iL-@I5~T
zfmlClQ8$QeuL~u0axqRfG&Rwt$je4?oG!iF&i=t&!8YDz6&V%VX<^gMzPT2#y=|wh
zQ>p8{kheX(X2r>iZ(g={Yw+~Jw{Y!#A@T_|5%0owa%<}vCAtnx0Fy3Kmz#=DPq>#N
z?=!SDebQatnETq0K(egsRyHgG!);T$DSgU<njs`KSZLBrj`m9vL=oa)^glRY6P*S`
z_ze1zd9`V@;^dK$UF0C=RN|5Fh_>&!0HX97_L>L}#2Y;~k7|PlQqOUIZw$Xb^8TSd
z3_ljuky_>s<U5WH9j@(S8{PL>+&*92;iBdj{7f;2q7eB%k%I9je)t2A%lr;RXREun
z1sUH)LT)bo2bNQw)Rc8r$=%wHhi+6?@OVkPJ`?t<n<Rd&h?8f5l555*u$QQ+NJlE8
zvq8)hcE=8zo9dew^%=i@3uuJ&!N$@Q#7n1DPIRG*QTqiHQ84vn7uKT00M>B5c$XFY
zxYjs{2t41zXrC2l&f*_z<xSn&2^iXL-yHBZLt<nFe{CKQ{*BbJ_xh#j#jnQ)*wV3n
z1W1B~QdMk6t!~YvXjPKS+=ZgeC&rQ#>KO>$1sVZ52&bio+Ltd`Q}69|oDx)AJju*>
z{FfCNgJ%6kvxRb&(Hwf*h0P|g19j}%tf+-Z+{I%Tn7P;fCXk0{;xilZ1o9P^CZ`zx
ze?{F_P!r160B}G-FIB`4kfMSD(tGdHL@A0?2~C<b34zdw0;1A;??rk-XaW&Jk)nYF
zL@A+43&qeOKqw#g&VS~6`_0Zi?C$Kt*)wN%;R>_#>)+tOtf!ddHV&W<*IhBDDvw9O
zi<*Y@2fKxWv%-dGJR5MxN=SEEPIk$p_guSS?1%j^!)-!{%Mn;2`y?tB(y>LikfRnD
zVn!b$V)=cIEF!tN-t(kBd6dM#d@SB-x(OjDuEhb4#oJ7GAq34e22PhMTE@rkX_jc>
zrAjCxN;Lz0=;GyQwJ<5$RZ|Q0>ZP>Y=os>Xjv<*8zT3oUH9e6udfwg{BGS)FIzr4B
zGWb2e)w-r~E~Mc4sxE%dL{kfUBe<{smP`)^v%;gluN_46(@0112VREn%xV^P!0R))
zRJ9hp^I(PbDTP0xj4%J}+|vzx$v@p|DWt3ldTWwz-Y7N`yXHG%^x9^m!<Q}rEvcp7
zrWEWvv#^L5+@};+X6)dQ^QnJ=;Wi)Rota1yN_2~Jb#>DC$-r~rJ~lPpn-~4$PlFHd
z{Vks#8x}MGRiQ89fiA{IB|Km21rJz-wxrv0HW0#3+TUY9ANhD!d#i4W_}|NpEd*B6
zs`)g&#ekl+@`Sw7i@yqf_u{4KKXcv7Q?n>R;ai54UtEuy4>k>03rMfJcCR2?Dzt#0
zAD4}kme#4oF|x}qTfTP9)zyQv-`=&JrO0ho_)$ETla%*7L)GH(&~#7$?}Lnr1C8Mq
zslso%e4cPjD@#T{)#{x7Nh4Pq%fmvM9juusmBiCbksYk{KcITpvox6VdIoEeI?l#g
zgdEU%iNW#r85NRq%E{{Uu;`~(H3H?DN9zTe9W@{sm5ppMT<hl_2gj=glF*Z6UP)U~
z{oK=`AiMH&yT{#-4?`k$hHJZJnmAz95Ove?`xf6@<>}tXI!l2?uep9#E2xnc-ot$1
zvNKQrI*Qq_VU`?5MXbCyG)H%zIa(JlH{S~x*>!m2<XGM=QZ5@Us3j``Ge~Lm^|a}K
zN_>%oY39^c*>-j#@Whbdnd8(ZO4^Bc=xQJmr_QeB*LPpN^AnAlD_)knsp<d25mEfI
z@l;1s?^{cQ`=N-{>=8|rW`!F+tH_&>pvxb1@+KOmml%AE=M6@E%C96wgujVSM^Wli
zRW0NIgh=YZPtpynTT!Vfi7q8DbEEx}O>CrjV9QY%zQDrZzL-$PZ!e?|-&-|omX9eh
zGmW>Mr&So6_o@MarKra&Oe-8Er#zAK4jj4VE6&HC;kCV6%)Vy#g-U4;H)KD>ELOgc
zK68isf{GsUPi3F|lv}m-FrK)PybNGI*3eg-1lHdFG>7|73T2QnNZ~RtO=jxGipY9q
zx`|~2gZ*qtysLuDKeeC!#)Bh&?Bv+e>eWBLU`u6D0dG1wd#h?3FHKi+GvD^9eH5`9
z@`t2fOq_0N`5G(E>py<$c|^DQ?z|4;aFJ#8ZkjUvhNDo}vHl9=OuROw_Gnosi|MeZ
z#c<&@<Kd~>w*lKYEk)m5{hN2cv=lvCd$^L!O}XoIs#RIOYOY4L<T}Lt4Xl)s%c~y$
z>o0iRlSc2FdPiLWJ~^zGQ-O=(xI4`4$w`yXs_(YdP9Y7X?bID<1@@1f)H!dO2hWdc
zsV8d#bl-+_=JQb{3s=c&F2(gXZu@_a<NE;4n=|^<rT+fWh`j|re54v84$NU0RRqV`
z<h?CCiD=5dk!#>kp2Z=|w5Q0NYY<-Ejr?;xNlr+{mf+qYW+r6j*1<Tj&_Ua$(oJtA
z>r)eO^?SK)=HxxZb=GG|duQ~reX!HrfLds!Igpx7#-D=wuEL$U`Ua=-rJ;d8g89am
zAw`gZ@=&%BsfJfUbBV>IVP#Q;?lJbn+H?Yf%RR_FXsr@o&1W~wJxE$;r|Dhp-nA@v
zn18KzIq0zK4YkZ~9~nfD+3H(U3mZ`aVC!R79-d$`e0Tf~6GREn-d?By59HSHF;cXD
z*%585pE!Mp3cy%v-*1AYgKW6Ky|3_U7*Rxg%L4IwvXthYkR-Cq>KqxqG&p?PHkR+!
zizvGWa%l>$q>p2YoIWi2HqdGvbalXXw4O~r1n?~L`mwtnuptq_b26naAX4$zEpYjy
zpP3hJYa)G|6BBpfti8rAlq4$Yeb1+cI-pxyGNvXMj`i$sTgd0h*3-+ZYKzIFQQr)l
zg?9kgD8hvFu-TZcR*uEHg6OUgJ@aVZ*<znC5t*;m@(bGE%UzUyA_D*)62y=9y>)Mw
zAQrZn`R4@uZd^YLoZqnmfD+g5-Z<IoTx=?cq4iDQ7$JlRS9wl4?*Ji78rY}tdmRDt
zJF2nNR!Kda?hL*U3p5UbUIZM6bss4bJw8K?Q%xY#kq72U-MkOW$66or!+G9+NS+c-
zE9A*AWK89(+*irvTY2*Mz~Wog=j8%Ht@vmlDvife(*XOa>G3(j0f6^fCP*Cnz212Q
zi<Zgp|K;GYN|_9KF8djJi}z8&2mc@gSJoqeI^?B9;JV{|{ioLBII^VG0`ATYgs0jT
zYDZ$)a(erE3R>rs=b69@ByKJMJ{<OZz~l}pIYoA@A#`^m)ce5)>=nxVQ|M(uifKE|
zZNlzm#3C&k8l<RA)6Z1Do8e!n?{-`h8u`5+gGx253K>(KNPe@=#$A}+vv>^yFyh_2
z+QiAN)@<E1_x#$p$;{#Cu)0%Dd0Vw$&sbN9H9LEeihRmTSb~q!lF62RIDrPt^A{7I
z^?@>9?qf>C-3=%1#A6{=s<b7|(JPX$Uc16%>(@c*E0J*~L5KW6)jJ;*>=#pW&%X2B
zXX?ylB6UMiY+uPAvy{MX-ehh|cJlQc|Bmpf_n+1Y^+sR|l=!nVo4=)>Zuc@)5t%)_
z4mu_@np9|WP_KyfEj%epx)ak}?is%U><`oyUljyZdij*ENvR%IX5jhDZ4z7p1iwpn
z&sz2z1Voi<Sz}n2v#69c3Gh!SD^z{_5wnuN!Sru@+5v{?m2$$4pn|bzrE*KE)QXe*
zwI6A@*FseD24m!B*<Y#6L-HY0Jn{a06HG^6dB3+UD;gh7sH7Cq8jOiFy|#BGT`wSa
z<k7C@T{&=xFCY>3Z_i9l{GlvR@(X_WWVel~Afo5+iDmM5+IB0XE(TOD{yp#;E-wP~
zH~IZ#{H(4UsxECFn;1M#s9+M%1n@3#|Jl>fQS($xf8d(1eY|aLl@ss8fN!uc4Qfx(
z@A<K`L|HHe$`Ggr?!>tSQgJ7NfO$%|1^TPX4&-OP^eXd^=P4Klg!V6bHC<%TJHu$6
zU$4>>?qRe4-tG;(1NSq1fzsJ|@OC)urV4hUUidF%k<f#nTxDm|3EoJrFY1z!*0(~h
z4xgpU2O#JH+(!!IHk?}8MW<c$x%?sE8-TRkYe}tE6=<VUbbv2d<Oyx5^LhTvUv4(V
z-I@%xT8ro6zDt&35?094Z^NKFS<=kbz5MrMH%|sURJUWuP!Wc1Ke>;$3eJY=d93{-
z^pG<j%clPMikfV;z&<5?d-tDk4r_E#FnfBFk3HO7`_w(??725K<`#{{e2q(j<}=)!
zRsx0#)Hc7g?(l`QEqT%xTxQOARY9*|e=fdOMgC+8l+`dz%Kcb6I`rxKn&@+ucfO7$
z{!-yMG1kQR$$xa`KsDOxiYGBcBnaTC#{G6no%MyMlz^+Fp2v{Z*N6cn>i<bk`Q6&6
z?09sg8FR&>(eh9@z@(PPxW6kz|MB{MnA1h#HM+fr4=P8=X$)H2T7=wdV$XcRjQ>=<
zgp+S-0||*0ZC%sLe}4A13RQVY`Ukf8f;Sf&48w<QRL_rJcJ}37Eo$$(RvH>;ZS428
zpi2P8m)qxVx?f^H12JeI?Tt5CnHvy>i6<{3A&WOn(YBx12wqPO`W{rB?@l-;x+lO5
z7pbb1x=8oSGUpTM`1f**xtxp`v(RuSG|vm&$&^Pc2=@_&sf}L_8IAD1_vh0Q(%wg?
zV)97~#RkPM3^u$slyc+k)Fpn0zHZYLXulu8jui2-PCSV5nNFT}(&|YE7d<NfG%ed>
z=^`Z>xhkDxRQ$fCfgPyt3#0p0jIcnk1HD#c8$j{W(d3)vlgio$*#W|_baH#<BPJro
zJ1^KWhJ(u61CwK$Ca4blM0f;&ry3_n>h%pPK-zK8n<|rDhrWjQ2_#nYfaoR<46AN<
zVPa-ZEFFf`oauvx^G@pfF~Ct!v5q@)Ni1Enp$RpwjFp*uES)ZdXqv#498(rs(%M|r
z&-lGppVbQXan;KO%v=it2}Kz4D0+mT;X`lCUE5#EIP=ynXx*^dGK-tktCnXrE+b{g
ztdbZNUZrmzppho+H5%pcp}8BbT;oKYwfjo1<LDZ(hQ9^!9EEDZ@5WGC-!KhNs@z9}
z^t1*ovb%jfti>7)AA-bQYYVHvfmXV5g}q1z1v_h<jUe>?2~ae^c09gd3mEgRn`Udn
z7AC0rf#9GMlM9xhNp-{3T@{X2?SD|eSss!kP{UKmVo5UT(7R=}zs8v{(5Cy%TA;*d
zd1=F{3NsDVHiPHJKJf@;XSz}6f*S;XsuipHNH^kpILHa~;Hp5|PyZ$ZUcOO3Gbpxg
zw?+C@t>G4@`C#ufH{hRbGcLc8SYCu;>+wtPMCvcM0y9jJug6KH`;rpbKJT(LpLx)n
zx3Pj1(HW<Xea`b>PpA;z)!C~3!&Q<Re8@|ixMWuLMYnafCG*;kP`RHGDEUyZ3ZaAJ
zdk-kLBeTU?zH@k2JjV0NrxWebhayZ36SDIgoE`b5;=H09z>vJ2@djFF;kY<=2(4mf
zs+$;{UVoDU^*?zTFM^e5Ir|@Ubaa|APy_=5RZ}#&%owPGb(yg(HZ-elMUR#{9G3Ss
ztO)Ni;4)u+;MlMD7Jq-85+%^X4y0MtO2P0kJd2VN-8qO49)-ehXpmaIjVr;Ara-z$
zz6mjFg&{f_sDFxokT$GNrv9ABvc>laFNW9I>U;NL<|Vc`EDDt#G}y@rK1Rcr*%}Sf
zDYm1-SHYIG*a#b{P9a)k|9k7a=x*%?Xe*o@l<w`ckyVY0b7Y79vE##M6#IU)SdEO`
zhm~IhC{EhO$Z4};1Wj&7Wq40mSyqLG86YLL{{eQ>Qj%pPC?75<3Wnm6k>@f(v;VdR
zZ4uvyo5lA1k7}2EACN~lCG3Qa)9gaR#&G}H_NB55SO|Dk4%&!3KlURIHT{yRD~UV6
zA>45|vR8lPZ%A0!tbe=1$WiW8Z<`NkZtDc9i?T5Hx*&t*HeJ1;;~=h}{*LAmV+2dJ
zHRJIswHeon@pi)9#<o41abeqX!>HkPY_P{8bbNeBt0<d`b}S!u6M2a7>srN0WXqF7
ze)GayHctI&Q_bMInsW8Ed#-Hl!?)M(NmRFp>4?edyi#%bGB8r7O^STcC?6P(b3G~!
z))I8cRqk?W1iE|x2(YRkot5!14JC)>^dZGz_R{i7J33Q}T97Y8uC5c6CDu7A{LsYM
zF)VH_Ci4`>lrXNU1`~7JRZ~+2#V9CB{OraR6&5r2`??<gCxg<n76Mz>PBhifNL?5h
zAr-y|pw2F7w?I+16c@LKjd~<(?&&eLRm@3Spa=v-=K+P_hBG=Dwtm4Zfb^+tRLoLU
z1lGd#4#P#ppM|fqXsNMr-JXm0WNxM4l^{qDMHHEP;d|Bwg5e&D%e_;f*F{=D4)RdC
z{3zOv$l*u8SScc$EtJZ;&!}R15i@s4?b>Wc*a;3%aSj<FIn}IN(hbm!YQNIK+_J{5
zhu3#M(*_ZuO>^!{7Sj3hX7Em(4$!nK&1Kzee*BAZX8zV-{n-fLGgKU7AxEp~@HhOm
z^{y#H(PxjPv+c<0Dgjd(pXI-=^gnE=nfM{yY<~svIQ&Vyv6_ougq7*$k{}~B5?Z$c
z<uwQM%~Oqr+EP~J?d3Gv6*mvvI>IX;+|rSlihgBhr_JB$L{MQTr>oQK*k3B%Yi~Wz
z?69plAiE`sy4t&g3jQqaq)=M}f!5NIZ}`wTa~6Hk*V2xE^M&M0S2v#_WNu4BnbLCv
zeF@NammTCVRYgdfkuoo7<l#`gn`@1EuDUW_7A1M*yrV@iu6YvR{XAw7d%K~TfFm0s
z2-cf!!DnB$_Jgoa&3t3C1Fb~vCWt}FrzSZcFO)9PdepTJdYJ3n5XF-o*#x1*FM9!z
z_rt`$d=Vlz9(Onp4dW)(@oDV#J@PZ{Q`|V?Z@v!1{B)EGYw^dmZ+I0)xTT5B<s+z2
zqb&EaRN&KPzP93!m}a7AadpmWbiD+=8TAn^9#zDrU{7qAko!+6W$hDkHO~CEKzQH!
zXWOp*O&aT$Z_obAy2DR6S+%2Eb7D224p)CLsrHhBIh$ZGJ<?)@D1xB@+Eq;kzsMLb
zwYa?XM{B7rbi}hMJ_bq>X&jW{s0n?^Qtd4nED#1FpPsfe@;7`~aCIPxeW1&<jKQj1
z&KWH%YUex|?I!Jxw`HaM!5V$wVSvJgdJa!^IZ9h7k(!tt@>6#Gh$n%zWU&>EhqmLz
zUl*Ph-3ubLfmz)BdupU6@-}`C8A^x)8U?jIizXk^d=57&s}S);9vaqPR4M4<h$Fpt
zrREkyHbi=cn`;caMQm(`*RZcaqer%gu6XmYSYIU6rASWYVW0qh)q#lBd=vD1*SK+H
zq>+WkAYDfX3986*?b#FY=R<-@&xAlo<pZ)&2jttFn7OyG5vWZTeJ=?*H?H&-tJp32
zbCVq8GH0nfp^d+m&|0!>(^@=|V-5hgbX8x5?f$g82kQ?GIGLd-P+fW}4i(*EP-$p8
z6iT)NklJDAHj#p`uz;_Jmy3mYl-|(Xl+(DFOMlJE(qsx5Q)JT3b$jx&v+t?HYO41K
zo#smRb_i{<-;`SYQ3^G_GRgKlXfGwa!Jqc;>L9I?`-lHY+jHwqY?lc?ZQn5Y+N<q}
zPrIb&z*CB1&n3<>5))65$rOiz?%JW{7rG>?2hr1CdL~hxAAboxTk4p}ovB6aKV&8R
z6D8q|XkIlD#!Bdshl^ljE&xiZG<0<s-7XtF!~RqCZwZ2>jF4ON2>+q_rsDS??DsZ?
zSHCJ&u@PwpHZxHY5iU+D#$je=O)NdTHO|QVS~vcvWv(Fym6yNcZ+z;2XZ-{FQpI)e
zW++I?pYz~*m^Q^zu|cegJeMVT@A!;0wk}wpaz7i9B5a=5#xPzsuC;!w+ro}W%TI9o
zxPb^f+F2dISCZS#vp<L?c#Vl(NGc@)W9xF7s^g{^m#BIFij5gY-se+n2rJHMTFjwg
z$+J|u+!h&3w*K|Y(-kpIVu>Uu|H~wfE<D3fx}cNxdw9>Kwg<AbwXVApI<B=lH?OeI
zq&)VUgIJFap#3ixP&e-no}H9zq3zAXBU^1@`x$Uh>)qqaBG&4EHIL~NfYEUq>fcK}
zYb9(JFuIqcCtX}|GiqF8@uR=op?U{$EVh;H8!`>0m)Qt5>4IM!MAX26J@HY=z+WIb
z#=3yA>`|1b80*ViIypre_U5c!xb@oRD*m_~7Pf+LD9xZ&+MzjF<dN->qdAw(J!5tG
z;R%)Tt)0q?o<qTA$K$(D1KxJTl@NIVkoyYP99yF6B8M=-R7y~<G0;qZN3I8NyIF)6
z*qR35?TKP!W6xCoO<E#hk@K%udCON>Y`?;Utr<Ab03Vh2XG4Its%3MzXV$OQ{dVux
zgARuhYc^3cnA8q{W4YTK8Ds`m*br{$sJ(k@tcfo3&c+n&%}CfFT{B(vi=Cy>u=AnM
zdZx;+$2J#%?vvpwo%nZtjZaQr7kwQ68CSLSMT%6)6Pj5+y7}u52f$uyTs4hJl<dBY
zf1~^VlyiqYg}e~LC~kR;86tBae;o5jooX}>p7%cvbK%;y3wVea;MJ(74|t1TOVMiG
z>5mq-!AN|Zp<$&KQmc9w8vE$H76My-{-dSSy!7@<!ugM~R7y9(fhak1S=?nJ9fa_o
z91#AXaAm?!a4itve-Jz)E8u=Fy$^J1(*s4songpSQ){j}NzZ4;rvQ?`-jv=EmAAym
zPSF(Ly`F8h(Jmzicii(*N)H#e397p;)dLb9cOrnYe!W!G3{(AfT?Q%*>c%B`1+YEL
zJuwa_y`9pZ-;N+tTosE=C}SU})zjOzyBgQkBIJ)`vQrA<Li?(5KB}9Mm=POd>ZfQ%
z&CO{q3WsraLeU_j^}#|rwq_<otnFrU6tTzXI0IFxO_cT@X*5>fvVVr6t(#)`Dz(qu
z3Dse!S@cgWXs{zI+9V3c(GStEN*-O{@s3Wm#grbTfUC{9`6=)1C%mLI(@4=eW0z8C
z{}HWyg}Ci)0!Z+%vC5>TXOc7B8CWTMZ`pY{4innZ77t}*nz|V-tCl4v!XJsZ#A*Kq
z&s!@YS0=Eb{!+0+bMu%yP;flDMA)07^Kjgk+7p-M&S-(sehM5$xvpOhtGe7q@!TOe
zsyTsB@-%~gFpkpmPC=%cQ6|SLA9}ZxrY9Q5g#`snLG5jXz3%YlH_lLeD00HFh?rwp
zH0sMMChV$2^27YhYdE9yoZ~*^8-x)&V1*uNFq>u>l(0UpJ{cxuMCCV~R~>N$j}5JL
z68QD@Uu5)iF1eB3Hj|&UWue*oU1BLcNgpCry4^$i(B~M~1?l1_;o`I(cDjK+Er4C%
iE)L#Y>?1CA)z0T&r?`tV*aflRT#aLbzWeeBPVs-G)X*^i

literal 0
HcmV?d00001

diff --git a/demo/undocumented/contact-vi-snes/cpp/CMakeLists.txt b/demo/undocumented/contact-vi-snes/cpp/CMakeLists.txt
new file mode 100644
index 0000000..fa9ea56
--- /dev/null
+++ b/demo/undocumented/contact-vi-snes/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_contact-vi-snes)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/contact-vi-snes/cpp/HyperElasticity.h b/demo/undocumented/contact-vi-snes/cpp/HyperElasticity.h
new file mode 100644
index 0000000..2ca21ce
--- /dev/null
+++ b/demo/undocumented/contact-vi-snes/cpp/HyperElasticity.h
@@ -0,0 +1,4932 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       False
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __HYPERELASTICITY_H
+#define __HYPERELASTICITY_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class hyperelasticity_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  hyperelasticity_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new hyperelasticity_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class hyperelasticity_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  hyperelasticity_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new hyperelasticity_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class hyperelasticity_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  hyperelasticity_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[3] = dof_values[4];
+    vertex_values[5] = dof_values[5];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new hyperelasticity_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class hyperelasticity_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  hyperelasticity_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new hyperelasticity_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class hyperelasticity_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  hyperelasticity_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new hyperelasticity_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class hyperelasticity_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  hyperelasticity_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new hyperelasticity_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class hyperelasticity_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  hyperelasticity_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.166666666666667, 0.166666666666667, 0.166666666666667};
+    // Quadrature points on the UFC reference element: (0.166666666666667, 0.166666666666667), (0.166666666666667, 0.666666666666667), (0.666666666666667, 0.166666666666667)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0[3][6] = \
+    {{0.666666666666667, 0.166666666666667, 0.166666666666667, 0.0, 0.0, 0.0},
+    {0.166666666666667, 0.166666666666667, 0.666666666666667, 0.0, 0.0, 0.0},
+    {0.166666666666667, 0.666666666666667, 0.166666666666667, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C0_D01[3][6] = \
+    {{-1.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+    {-1.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+    {-1.0, 0.0, 1.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C0_D10[3][6] = \
+    {{-1.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+    {-1.0, 1.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1[3][6] = \
+    {{0.0, 0.0, 0.0, 0.666666666666667, 0.166666666666667, 0.166666666666667},
+    {0.0, 0.0, 0.0, 0.166666666666667, 0.166666666666667, 0.666666666666667},
+    {0.0, 0.0, 0.0, 0.166666666666667, 0.666666666666667, 0.166666666666667}};
+    
+    static const double FE0_C1_D01[3][6] = \
+    {{0.0, 0.0, 0.0, -1.0, 0.0, 1.0},
+    {0.0, 0.0, 0.0, -1.0, 0.0, 1.0},
+    {0.0, 0.0, 0.0, -1.0, 0.0, 1.0}};
+    
+    static const double FE0_C1_D10[3][6] = \
+    {{0.0, 0.0, 0.0, -1.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, -1.0, 1.0, 0.0},
+    {0.0, 0.0, 0.0, -1.0, 1.0, 0.0}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', False), ('ignore ones', False), ('ignore zero tables', False), ('optimisation', False), ('remove zero terms', False)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 3366
+    for (unsigned int ip = 0; ip < 3; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      
+      // Total number of operations to compute function values = 72
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F0 += FE0_C0[ip][r]*w[1][r];
+        F1 += FE0_C1[ip][r]*w[1][r];
+        F2 += FE0_C0_D10[ip][r]*w[0][r];
+        F3 += FE0_C0_D01[ip][r]*w[0][r];
+        F4 += FE0_C1_D10[ip][r]*w[0][r];
+        F5 += FE0_C1_D01[ip][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Number of operations for primary indices: 1050
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        // Number of operations to compute entry: 175
+        A[j] += (((FE0_C0[ip][j]*F0 + FE0_C1[ip][j]*F1))*(-1.0) + (((((2.0*(((K[1]*FE0_C1_D10[ip][j] + K[3]*FE0_C1_D01[ip][j]))*((1.0 + (K[1]*F4 + K[3]*F5)))) + 2.0*(((K[1]*FE0_C0_D10[ip][j] + K[3]*FE0_C0_D01[ip][j]))*((K[1]*F2 + K[3]*F3)))) + (2.0*(((K[0]*FE0_C0_D10[ip][j] + K[2]*FE0_C0_D01[ip][j]))*((1.0 + (K[0]*F2 + K[2]*F3)))) + 2.0*(((K[0]*FE0_C1_D10[ip][j] + K[2]*FE0_C1_D01[ip][j]))*((K[0]*F4 + K[2]*F5))))))*w[2][0]/(2.0) + (((((((K[0]*FE0_C1_D10[ip][j] + K[2]*FE0_C1_D01[ip][j]))*((K[1]*F2 + K[3]*F3)) + ((K[1]*FE0_C0_D10[ip][j] + K[3]*FE0_C0_D01[ip][j]))*((K[0]*F4 + K[2]*F5))))*(-1.0) + (((K[0]*FE0_C0_D10[ip][j] + K[2]*FE0_C0_D01[ip][j]))*((1.0 + (K[1]*F4 + K[3]*F5))) + ((K[1]*FE0_C1_D10[ip][j] + K[3]*FE0_C1_D01[ip][j]))*((1.0 + (K[0]*F2 + K[2]*F3)))))/(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F4 + K[2]*F5))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F4 + K[3]*F5))))))*w[2][0])*(-1.0)) + ((((((((K[0]*FE0_C1_D10[ip][j] + K[2]*FE0_C1_D01[ip][j]))*((K[1]*F2 + K[3]*F3)) + ((K[1]*FE0_C0_D10[ip][j] + K[3]*FE0_C0_D01[ip][j]))*((K[0]*F4 + K[2]*F5))))*(-1.0) + (((K[0]*FE0_C0_D10[ip][j] + K[2]*FE0_C0_D01[ip][j]))*((1.0 + (K[1]*F4 + K[3]*F5))) + ((K[1]*FE0_C1_D10[ip][j] + K[3]*FE0_C1_D01[ip][j]))*((1.0 + (K[0]*F2 + K[2]*F3)))))/(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F4 + K[2]*F5))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F4 + K[3]*F5))))))*2.0)*(std::log(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F4 + K[2]*F5))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F4 + K[3]*F5)))))))*w[3][0]/(2.0)))*W3[ip]*det;
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class hyperelasticity_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  hyperelasticity_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.5;
+    // Quadrature points on the UFC reference element: (0.333333333333333, 0.333333333333333)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0_D01[1][6] = \
+    {{-1.0, 0.0, 1.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C0_D10[1][6] = \
+    {{-1.0, 1.0, 0.0, 0.0, 0.0, 0.0}};
+    
+    static const double FE0_C1_D01[1][6] = \
+    {{0.0, 0.0, 0.0, -1.0, 0.0, 1.0}};
+    
+    static const double FE0_C1_D10[1][6] = \
+    {{0.0, 0.0, 0.0, -1.0, 1.0, 0.0}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', False), ('ignore ones', False), ('ignore zero tables', False), ('optimisation', False), ('remove zero terms', False)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 17220
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      
+      // Total number of operations to compute function values = 48
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F0 += FE0_C1_D10[0][r]*w[0][r];
+        F1 += FE0_C1_D01[0][r]*w[0][r];
+        F2 += FE0_C0_D10[0][r]*w[0][r];
+        F3 += FE0_C0_D01[0][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Number of operations for primary indices: 17172
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        for (unsigned int k = 0; k < 6; k++)
+        {
+          // Number of operations to compute entry: 477
+          A[j*6 + k] += ((((((((((K[1]*FE0_C0_D10[0][j] + K[3]*FE0_C0_D01[0][j]))*((K[0]*FE0_C1_D10[0][k] + K[2]*FE0_C1_D01[0][k])) + ((K[0]*FE0_C1_D10[0][j] + K[2]*FE0_C1_D01[0][j]))*((K[1]*FE0_C0_D10[0][k] + K[3]*FE0_C0_D01[0][k]))))*(-1.0) + (((K[0]*FE0_C0_D10[0][j] + K[2]*FE0_C0_D01[0][j]))*((K[1]*FE0_C1_D10[0][k] + K[3]*FE0_C1_D01[0][k])) + ((K[1]*FE0_C1_D10[0][j] + K[3]*FE0_C1_D01[0][j]))*((K[0]*FE0_C0_D10[0][k] + K[2]*FE0_C0_D01[0][k])))) + (((((((K[1]*FE0_C0_D10[0][j] + K[3]*FE0_C0_D01[0][j]))*((K[0]*F0 + K[2]*F1)) + ((K[0]*FE0_C1_D10[0][j] + K[2]*FE0_C1_D01[0][j]))*((K[1]*F2 + K[3]*F3))))*(-1.0) + (((K[1]*FE0_C1_D10[0][j] + K[3]*FE0_C1_D01[0][j]))*((1.0 + (K[0]*F2 + K[2]*F3))) + ((K[0]*FE0_C0_D10[0][j] + K[2]*FE0_C0_D01[0][j]))*((1.0 + (K[1]*F0 + K[3]*F1)))))/(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F0 + K[2]*F1))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F0 + K[3]*F1))))))*((((((K[1]*FE0_C0_D10[0][k] + K[3]*FE0_C0_D01[0][k]))*((K[0]*F0 + K[2]*F1)) + ((K[0]*FE0_C1_D10[0][k] + K[2]*FE0_C1_D01[0][k]))*((K[1]*F2 + K[3]*F3))))*(-1.0) + (((K[1]*FE0_C1_D10[0][k] + K[3]*FE0_C1_D01[0][k]))*((1.0 + (K[0]*F2 + K[2]*F3))) + ((K[0]*FE0_C0_D10[0][k] + K[2]*FE0_C0_D01[0][k]))*((1.0 + (K[1]*F0 + K[3]*F1)))))))*(-1.0))/(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F0 + K[2]*F1))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F0 + K[3]*F1))))))*w[1][0])*(-1.0) + ((((((K[1]*FE0_C1_D10[0][j] + K[3]*FE0_C1_D01[0][j]))*((K[1]*FE0_C1_D10[0][k] + K[3]*FE0_C1_D01[0][k])) + ((K[1]*FE0_C1_D10[0][k] + K[3]*FE0_C1_D01[0][k]))*((K[1]*FE0_C1_D10[0][j] + K[3]*FE0_C1_D01[0][j]))) + (((K[1]*FE0_C0_D10[0][j] + K[3]*FE0_C0_D01[0][j]))*((K[1]*FE0_C0_D10[0][k] + K[3]*FE0_C0_D01[0][k])) + ((K[1]*FE0_C0_D10[0][k] + K[3]*FE0_C0_D01[0][k]))*((K[1]*FE0_C0_D10[0][j] + K[3]*FE0_C0_D01[0][j])))) + ((((K[0]*FE0_C1_D10[0][j] + K[2]*FE0_C1_D01[0][j]))*((K[0]*FE0_C1_D10[0][k] + K[2]*FE0_C1_D01[0][k])) + ((K[0]*FE0_C1_D10[0][k] + K[2]*FE0_C1_D01[0][k]))*((K[0]*FE0_C1_D10[0][j] + K[2]*FE0_C1_D01[0][j]))) + (((K[0]*FE0_C0_D10[0][j] + K[2]*FE0_C0_D01[0][j]))*((K[0]*FE0_C0_D10[0][k] + K[2]*FE0_C0_D01[0][k])) + ((K[0]*FE0_C0_D10[0][k] + K[2]*FE0_C0_D01[0][k]))*((K[0]*FE0_C0_D10[0][j] + K[2]*FE0_C0_D01[0][j]))))))*w[1][0]/(2.0)) + ((((((((((K[1]*FE0_C0_D10[0][j] + K[3]*FE0_C0_D01[0][j]))*((K[0]*FE0_C1_D10[0][k] + K[2]*FE0_C1_D01[0][k])) + ((K[0]*FE0_C1_D10[0][j] + K[2]*FE0_C1_D01[0][j]))*((K[1]*FE0_C0_D10[0][k] + K[3]*FE0_C0_D01[0][k]))))*(-1.0) + (((K[0]*FE0_C0_D10[0][j] + K[2]*FE0_C0_D01[0][j]))*((K[1]*FE0_C1_D10[0][k] + K[3]*FE0_C1_D01[0][k])) + ((K[1]*FE0_C1_D10[0][j] + K[3]*FE0_C1_D01[0][j]))*((K[0]*FE0_C0_D10[0][k] + K[2]*FE0_C0_D01[0][k])))) + (((((((K[1]*FE0_C0_D10[0][j] + K[3]*FE0_C0_D01[0][j]))*((K[0]*F0 + K[2]*F1)) + ((K[0]*FE0_C1_D10[0][j] + K[2]*FE0_C1_D01[0][j]))*((K[1]*F2 + K[3]*F3))))*(-1.0) + (((K[1]*FE0_C1_D10[0][j] + K[3]*FE0_C1_D01[0][j]))*((1.0 + (K[0]*F2 + K[2]*F3))) + ((K[0]*FE0_C0_D10[0][j] + K[2]*FE0_C0_D01[0][j]))*((1.0 + (K[1]*F0 + K[3]*F1)))))/(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F0 + K[2]*F1))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F0 + K[3]*F1))))))*((((((K[1]*FE0_C0_D10[0][k] + K[3]*FE0_C0_D01[0][k]))*((K[0]*F0 + K[2]*F1)) + ((K[0]*FE0_C1_D10[0][k] + K[2]*FE0_C1_D01[0][k]))*((K[1]*F2 + K[3]*F3))))*(-1.0) + (((K[1]*FE0_C1_D10[0][k] + K[3]*FE0_C1_D01[0][k]))*((1.0 + (K[0]*F2 + K[2]*F3))) + ((K[0]*FE0_C0_D10[0][k] + K[2]*FE0_C0_D01[0][k]))*((1.0 + (K[1]*F0 + K[3]*F1)))))))*(-1.0))/(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F0 + K[2]*F1))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F0 + K[3]*F1))))))*2.0)*(std::log(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F0 + K[2]*F1))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F0 + K[3]*F1)))))) + ((((((K[1]*FE0_C0_D10[0][k] + K[3]*FE0_C0_D01[0][k]))*((K[0]*F0 + K[2]*F1)) + ((K[0]*FE0_C1_D10[0][k] + K[2]*FE0_C1_D01[0][k]))*((K[1]*F2 + K[3]*F3))))*(-1.0) + (((K[1]*FE0_C1_D10[0][k] + K[3]*FE0_C1_D01[0][k]))*((1.0 + (K[0]*F2 + K[2]*F3))) + ((K[0]*FE0_C0_D10[0][k] + K[2]*FE0_C0_D01[0][k]))*((1.0 + (K[1]*F0 + K[3]*F1)))))/(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F0 + K[2]*F1))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F0 + K[3]*F1))))))*(((((((K[1]*FE0_C0_D10[0][j] + K[3]*FE0_C0_D01[0][j]))*((K[0]*F0 + K[2]*F1)) + ((K[0]*FE0_C1_D10[0][j] + K[2]*FE0_C1_D01[0][j]))*((K[1]*F2 + K[3]*F3))))*(-1.0) + (((K[1]*FE0_C1_D10[0][j] + K[3]*FE0_C1_D01[0][j]))*((1.0 + (K[0]*F2 + K[2]*F3))) + ((K[0]*FE0_C0_D10[0][j] + K[2]*FE0_C0_D01[0][j]))*((1.0 + (K[1]*F0 + K[3]*F1)))))/(((-1.0)*(((K[1]*F2 + K[3]*F3))*((K[0]*F0 + K[2]*F1))) + ((1.0 + (K[0]*F2 + K[2]*F3)))*((1.0 + (K[1]*F0 + K[3]*F1))))))*2.0)))*w[2][0]/(2.0))*W1*det;
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class hyperelasticity_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  hyperelasticity_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "9d88845ac10aeddb221e88356abff6e9712cd7d257c0179f4d6238adbe45d586b31782591938e8b3ee0ac920ee24ad91bd03d224e6c79edab0e46c2de2b2ab35";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 4;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new hyperelasticity_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new hyperelasticity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new hyperelasticity_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new hyperelasticity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new hyperelasticity_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class hyperelasticity_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  hyperelasticity_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~hyperelasticity_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "ccc8f09344ee4f6853231df05458928827012508435e62fc0ea46c78c9169d0a3c9348beaf975bcc0c70df44cc8554b5c5cfaaa30c84e5364ef5c01d547d0bbf";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new hyperelasticity_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new hyperelasticity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new hyperelasticity_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new hyperelasticity_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new hyperelasticity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new hyperelasticity_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace HyperElasticity
+{
+
+class CoefficientSpace_B: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_B(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_B(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_B(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_B(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_B(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_B(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_B()
+  {
+  }
+
+};
+
+class CoefficientSpace_lmbda: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_lmbda()
+  {
+  }
+
+};
+
+class CoefficientSpace_mu: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_mu(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_mu()
+  {
+  }
+
+};
+
+class CoefficientSpace_u: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u()
+  {
+  }
+
+};
+
+class Form_F_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_F_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_F_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_F_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_F_FunctionSpace_1;
+
+typedef CoefficientSpace_B Form_F_FunctionSpace_2;
+
+typedef CoefficientSpace_mu Form_F_FunctionSpace_3;
+
+typedef CoefficientSpace_lmbda Form_F_FunctionSpace_4;
+
+class Form_F: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 4), u(*this, 0), B(*this, 1), mu(*this, 2), lmbda(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& B, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(1, 4), u(*this, 0), B(*this, 1), mu(*this, 2), lmbda(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = u;
+    this->B = B;
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> B, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(1, 4), u(*this, 0), B(*this, 1), mu(*this, 2), lmbda(*this, 3)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = *u;
+    this->B = *B;
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 4), u(*this, 0), B(*this, 1), mu(*this, 2), lmbda(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& B, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(1, 4), u(*this, 0), B(*this, 1), mu(*this, 2), lmbda(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = u;
+    this->B = B;
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Constructor
+  Form_F(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> B, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(1, 4), u(*this, 0), B(*this, 1), mu(*this, 2), lmbda(*this, 3)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = *u;
+    this->B = *B;
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_0());
+  }
+
+  // Destructor
+  ~Form_F()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "B")
+      return 1;
+    else if (name == "mu")
+      return 2;
+    else if (name == "lmbda")
+      return 3;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "B";
+    case 2:
+      return "mu";
+    case 3:
+      return "lmbda";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_F_FunctionSpace_0 TestSpace;
+  typedef Form_F_FunctionSpace_1 CoefficientSpace_u;
+  typedef Form_F_FunctionSpace_2 CoefficientSpace_B;
+  typedef Form_F_FunctionSpace_3 CoefficientSpace_mu;
+  typedef Form_F_FunctionSpace_4 CoefficientSpace_lmbda;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner B;
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner lmbda;
+};
+
+class Form_J_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_J_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_J_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_J_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new hyperelasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new hyperelasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_J_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_J_FunctionSpace_2;
+
+typedef CoefficientSpace_mu Form_J_FunctionSpace_3;
+
+typedef CoefficientSpace_lmbda Form_J_FunctionSpace_4;
+
+class Form_J: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = u;
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = *u;
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = u;
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Constructor
+  Form_J(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(2, 3), u(*this, 0), mu(*this, 1), lmbda(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = *u;
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new hyperelasticity_form_1());
+  }
+
+  // Destructor
+  ~Form_J()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "mu")
+      return 1;
+    else if (name == "lmbda")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "mu";
+    case 2:
+      return "lmbda";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_J_FunctionSpace_0 TestSpace;
+  typedef Form_J_FunctionSpace_1 TrialSpace;
+  typedef Form_J_FunctionSpace_2 CoefficientSpace_u;
+  typedef Form_J_FunctionSpace_3 CoefficientSpace_mu;
+  typedef Form_J_FunctionSpace_4 CoefficientSpace_lmbda;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner lmbda;
+};
+
+// Class typedefs
+typedef Form_J BilinearForm;
+typedef Form_J JacobianForm;
+typedef Form_F LinearForm;
+typedef Form_F ResidualForm;
+typedef Form_F::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/contact-vi-snes/cpp/HyperElasticity.ufl b/demo/undocumented/contact-vi-snes/cpp/HyperElasticity.ufl
new file mode 100644
index 0000000..9cc1c51
--- /dev/null
+++ b/demo/undocumented/contact-vi-snes/cpp/HyperElasticity.ufl
@@ -0,0 +1,62 @@
+# Copyright (C) 2009-2010 Harish Narayanan and Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2009-09-29
+# Last changed: 2011-06-28
+#
+# The bilinear form a(du, v) and linear form L(v) for
+# a hyperelastic model.
+#
+# Compile this form with FFC: ffc -l dolfin -feliminate_zeros -fprecompute_basis_const -fprecompute_ip_const HyperElasticity.ufl
+
+# Function spaces
+element = VectorElement("Lagrange", triangle, 1)
+
+# Trial and test functions
+du = TrialFunction(element)     # Incremental displacement
+v  = TestFunction(element)      # Test function
+
+# Functions
+u = Coefficient(element)        # Displacement from previous iteration
+B = Coefficient(element)        # Body force per unit volume
+
+# Kinematics
+I = Identity(u.geometric_dimension())  # Identity tensor
+F = I + grad(u)                 # Deformation gradient
+C = F.T*F                       # Right Cauchy-Green tensor
+
+# Invariants of deformation tensors
+Ic = tr(C)
+J  = det(F)
+
+# Elasticity parameters
+mu    = Constant(triangle)
+lmbda = Constant(triangle)
+
+# Stored strain energy density (compressible neo-Hookean model)
+psi = (mu/2)*(Ic - 2) - mu*ln(J) + (lmbda/2)*(ln(J))**2
+
+# Total potential energy
+Pi = psi*dx - inner(B, u)*dx 
+
+# First variation of Pi (directional derivative about u in the direction of v)
+F = derivative(Pi, u, v)
+
+# Compute Jacobian of F
+J = derivative(F, u, du)
diff --git a/demo/undocumented/contact-vi-snes/cpp/compile.log b/demo/undocumented/contact-vi-snes/cpp/compile.log
new file mode 100644
index 0000000..11562cd
--- /dev/null
+++ b/demo/undocumented/contact-vi-snes/cpp/compile.log
@@ -0,0 +1,537 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form HyperElasticity
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'F'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 4
+  Coefficients:           '[w_0, w_1, c_2, c_3]'
+  Coefficient names:      '[u, B, mu, lmbda]'
+  Unique elements:        'Vector<2 x CG1(?)>, R0(?)'
+  Unique sub elements:    'Vector<2 x CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Identity.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'J'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, du]'
+  Number of coefficients: 3
+  Coefficients:           '[w_0, c_2, c_3]'
+  Coefficient names:      '[u, mu, lmbda]'
+  Unique elements:        'Vector<2 x CG1(?)>, R0(?)'
+  Unique sub elements:    'Vector<2 x CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for expression Division.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0539761 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 0.99999999999999989, 0.99999999999999989]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE0_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE0_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE0_C1_D10': 'FE0_C1_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE1': 'FE1', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE0_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C1_D01', (), False, False), 'FE0_C1_D10': ('FE0_C1_D10', (), False, False), 'FE0_C0_D10': ('FE0_C0_D10', (), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (), False, False), 'FE1': ('FE1', (), False, True), 'FE0_C1': ('FE0_C1', (), False, False), 'FE0_C0': ('FE0_C0', (), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1': array([[1.0]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1': array([[1.0]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE0_C1_D10': 'FE0_C1_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE1': 'FE1', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1': array([[1.0]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C1_D01', (), False, False), 'FE0_C1_D10': ('FE0_C1_D10', (), False, False), 'FE0_C0_D10': ('FE0_C0_D10', (), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (), False, False), 'FE1': ('FE1', (), False, True), 'FE0_C1': ('FE0_C1', (), False, False), 'FE0_C0': ('FE0_C0', (), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.107876 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Skipping optimizations, add -O to optimize
+  
+Compiler stage 3 finished in 0.000202179 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.107142 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000874043 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./HyperElasticity.h.
+  
+Compiler stage 5 finished in 0.000884056 seconds.
+
+FFC finished in 0.271301 seconds.
diff --git a/demo/undocumented/contact-vi-snes/cpp/main.cpp b/demo/undocumented/contact-vi-snes/cpp/main.cpp
new file mode 100644
index 0000000..7a45de3
--- /dev/null
+++ b/demo/undocumented/contact-vi-snes/cpp/main.cpp
@@ -0,0 +1,152 @@
+// Copyright (C) 2012 Corrado Maurini
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Corrado Maurini 2013
+// Modified by Johannes Ring 2013
+//
+// First added:  2012-09-03
+// Last changed: 2013-11-21
+//
+// This demo program uses the PETSc nonlinear solver for variational
+// inequalities to solve a contact mechanics problems in FEniCS.  The
+// example considers a heavy elastic circle in a box of the same size.
+
+#include <dolfin.h>
+#include "HyperElasticity.h"
+
+using namespace dolfin;
+
+// Sub domain for symmetry condition
+class SymmetryLine : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  { return (std::abs(x[0]) < DOLFIN_EPS); }
+};
+
+// Lower bound for displacement
+class LowerBound : public Expression
+{
+public:
+  LowerBound() : Expression(2) {}
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    const double xmin = -1.0 - DOLFIN_EPS;
+    const double ymin = -1.0;
+    values[0] = xmin - x[0];
+    values[1] = ymin - x[1];
+  }
+};
+
+// Upper bound for displacement
+class UpperBound : public Expression
+{
+public:
+  UpperBound() : Expression(2) {}
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    const double xmax = 1.0 + DOLFIN_EPS;
+    const double ymax = 2.0;
+    values[0] = xmax - x[0];
+    values[1] = ymax - x[1];
+  }
+};
+
+int main()
+{
+#ifdef HAS_PETSC_SNES
+
+  // Read mesh and create function space
+  Mesh mesh("../circle_yplane.xml.gz");
+
+  // Create function space
+  HyperElasticity::FunctionSpace V(mesh);
+
+  // Create Dirichlet boundary conditions
+  SubSpace V0(V, 0);
+  Constant zero(0.0);
+  SymmetryLine s;
+  DirichletBC bc(V0, zero, s, "pointwise");
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bc);
+
+  // Define source and boundary traction functions
+  Constant B(0.0, -0.05);
+
+  // Define solution function
+  Function u(V);
+
+  // Set material parameters
+  const double E  = 10.0;
+  const double nu = 0.3;
+  Constant mu(E/(2*(1 + nu)));
+  Constant lambda(E*nu/((1.0 + nu)*(1.0 - 2.0*nu)));
+
+  // Create (linear) form defining (nonlinear) variational problem
+  HyperElasticity::ResidualForm F(V);
+  F.mu = mu; F.lmbda = lambda; F.B = B; F.u = u;
+
+  // Create jacobian dF = F' (for use in nonlinear solver).
+  HyperElasticity::JacobianForm J(V, V);
+  J.mu = mu; J.lmbda = lambda; J.u = u;
+
+  // Interpolate expression for upper bound
+  UpperBound umax_exp;
+  Function umax(V);
+  umax.interpolate(umax_exp);
+
+  // Interpolate expression for lower bound
+  LowerBound umin_exp;
+  Function umin(V);
+  umin.interpolate(umin_exp);
+
+  // Set up the non-linear problem
+  NonlinearVariationalProblem problem(F, u, bcs, J);
+
+  // Set up the non-linear solver
+  NonlinearVariationalSolver solver(problem);
+  solver.parameters["nonlinear_solver"] = "snes";
+  solver.parameters("snes_solver")["linear_solver"] = "lu";
+  solver.parameters("snes_solver")["maximum_iterations"] = 20;
+  solver.parameters("snes_solver")["report"] = true;
+  solver.parameters("snes_solver")["error_on_nonconvergence"] = false;
+
+  // Solve the problems
+  std::pair<std::size_t, bool> out;
+  out = solver.solve(umin,umax);
+
+  // Check for convergence. Convergence is one modifies the loading
+  // and the mesh size
+  cout << out.second;
+  if (out.second != true)
+  {
+    warning("This demo is a complex nonlinear problem. Convergence is not guaranteed when modifying parameters.");
+  }
+
+  // Save solution in VTK format
+  File file("displacement.pvd");
+  file << u;
+
+  // plot the current configuration
+  plot(u,"Displacement", "displacement");
+
+  // Make plot windows interactive
+  interactive();
+
+#endif
+
+ return 0;
+}
diff --git a/demo/undocumented/contact-vi-snes/python/demo_contact-vi-snes.py b/demo/undocumented/contact-vi-snes/python/demo_contact-vi-snes.py
new file mode 100644
index 0000000..17abe5b
--- /dev/null
+++ b/demo/undocumented/contact-vi-snes/python/demo_contact-vi-snes.py
@@ -0,0 +1,116 @@
+"""This demo program uses the interface to SNES solver for variational
+ inequalities to solve a contact mechanics problems in FEniCS.  The
+ example considers a heavy hyperelastic circle in a box of the same
+ size"""
+
+# Copyright (C) 2012 Corrado Maurini
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Corrado Maurini 2013
+#
+# First added:  2012-09-03
+# Last changed: 2014-02-21
+#
+from dolfin import *
+
+# Check that DOLFIN is configured with PETSc and CGAL
+if not has_petsc_snes():
+    print "DOLFIN must be compiled with PETSc version > 3.2 to run this demo."
+    exit(0)
+
+# Create mesh
+mesh = Mesh("../circle_yplane.xml.gz")
+
+V = VectorFunctionSpace(mesh, "Lagrange", 1)
+
+# Define functions
+du = TrialFunction(V)            # Incremental displacement
+v  = TestFunction(V)             # Test function
+u  = Function(V)                 # Displacement from previous iteration
+B  = Constant((0.0, -0.05))      # Body force per unit volume
+
+# Kinematics
+I = Identity(u.geometric_dimension())  # Identity tensor
+F = I + grad(u)             # Deformation gradient
+C = F.T*F                   # Right Cauchy-Green tensor
+
+# Invariants of deformation tensors
+Ic = tr(C)
+J  = det(F)
+
+# Elasticity parameters
+E, nu = 10.0, 0.3
+mu, lmbda = Constant(E/(2*(1 + nu))), Constant(E*nu/((1 + nu)*(1 - 2*nu)))
+
+# Stored strain energy density (compressible neo-Hookean model)
+psi = (mu/2)*(Ic - 2) - mu*ln(J) + (lmbda/2)*(ln(J))**2
+
+# Total potential energy
+Pi = psi*dx - dot(B, u)*dx
+
+# Compute first variation of Pi (directional derivative about u in the
+# direction of v)
+F = derivative(Pi, u, v)
+
+# Compute Jacobian of F
+J = derivative(F, u, du)
+
+# Symmetry condition (to block rigid body rotations)
+tol = mesh.hmin()
+def symmetry_line(x):
+    return abs(x[0]) < DOLFIN_EPS
+bc = DirichletBC(V.sub(0), 0., symmetry_line, method="pointwise")
+
+# The displacement u must be such that the current configuration x+u
+# remains in the box [xmin,xmax] x [umin,ymax]
+constraint_u = Expression(("xmax - x[0]","ymax - x[1]"), \
+                          xmax=1.0+DOLFIN_EPS,  ymax=1.0)
+constraint_l = Expression(("xmin - x[0]","ymin - x[1]"), \
+                          xmin=-1.0-DOLFIN_EPS, ymin=-1.0)
+umin = interpolate(constraint_l, V)
+umax = interpolate(constraint_u, V)
+
+# Define the solver parameters
+snes_solver_parameters = {"nonlinear_solver": "snes",
+                          "snes_solver"     : { "linear_solver"   : "lu",
+                                                "maximum_iterations": 20,
+                                                "report": True,
+                                                "error_on_nonconvergence": False,
+                                               }}
+
+# Set up the non-linear problem
+problem = NonlinearVariationalProblem(F, u, bc, J=J)
+
+# Set up the non-linear solver
+solver  = NonlinearVariationalSolver(problem)
+solver.parameters.update(snes_solver_parameters)
+info(solver.parameters, True)
+
+# Solve the problem
+(iter, converged) = solver.solve(umin, umax)
+
+# Check for convergence
+if not converged:
+    warning("This demo is a complex nonlinear problem. Convergence is not guaranteed when modifying some parameters or using PETSC 3.2.")
+
+# Save solution in VTK format
+file = File("displacement.pvd")
+file << u
+
+# plot the current configuration
+plot(u, mode="displacement", wireframe=True, title="Displacement field")
+interactive()
diff --git a/demo/undocumented/contact-vi-tao/circle_yplane.xml.gz b/demo/undocumented/contact-vi-tao/circle_yplane.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..db34cd29662168c05877bf9c26c07a9caa946a27
GIT binary patch
literal 73289
zcmYJab9mg%_W;`1#-=fLW7}zrjcuoKW7{?xqm7NGX{^R<jHYR_vA41AzQ6B%?)`6`
zJ)W7*Idia738<(GFJYSR5UlLot(<Jk{9K(ZKH0GQIy=3qd)a6Kf!)bbd!a1UH^S-p
z!F_GGTP{!}9;!Kb-Bw3LL?*<@y`7bm>PAj4XkixR+Bpg$+;u_xqA^}DmzI{+6VBV{
z+w<((GtS#f<J+0p+pXCvgzD{Y-=^8?PUG9P+8adT^~~(`m&7aN?dk0y<jpSRLE`l;
z<nH2iDCC*r?K$KH29|vN^>*F(wsG(VO$mAEdpp~HJ$bvmczb!fr+V8xd3!wRdp;|E
zz3F@Hc)NakI+1wUSP6M>c{}2Gd+K|N3Ax94duV)n40#)pc)2Nld)R)xZwz@E?R(w`
zdD?h;;CMSKetXObxlajsnti*^;e3_8rpoB+?|XqUeQbQYYz%oayQYHjK@QBs{!;`>
z^?J+kcJ<%ljW$H`d6whutnc;l&HcLZm85Uy;<fheX0r12g`?y-^l_>9ZnW`@_-(dy
zaHH|@>fohLuqpTf<+ZwxC8%jZ&*y7)o@JG|-^GSm$al`BM?IJJgG{jNTE}MVGfPN#
zmW2LGtq=zzd-S=Z3yl$Lm;zs>rgSV*g;rhJ1!oqiNevTZ(FFPeMZvD4zXWyt20K(o
z1;^_U)lO2;_c03=dtCSpxVJ;*3Z9QiJQ^zX&mxF=H4lB0db-r5E{JP|0YPK)ciJXZ
zqZdsq+2*`{DLSuH%*70(b;iQMnhjiID-&0QlOf4TR97t7%l?yG-c(w#ze7RATJEyh
zvE9Sk8(g`1O~gtWHpG@`vSwvL2{e{#qp1+HF|#W22&65`(tTDInP459ae=2v<J0;W
z_F}f%+}$h9e;NZdDJI#$_L9Utmtp2-VDGT!2-@vhuQi8J$9ahu`PXzh1Pr!^bBGGW
zy1#`rU$^_&;J4qy+Nim~z#eF#C3)WB{g@J$`F!O<Lbr@Tdc6s2YMHqSv2P9n(CY%C
z=7X&4{iC*JQWJXp)FOf$Fq3i(VriCNbLbu87;|p;`3Q>1^=av|j8l2NxGK6;8K@!G
zRGGP<X9!5^u<uXLup(hlVDDXW?X4~*_!8WC3<<V(Z?x`|RpK{?n(3_FAAltUk@7=c
z^jm$h%x~p87~ekc*0TB{<x~CC6WWb{%P-dAH{=+_0E#li8o0NwEJ6d5yh|qx_9w2y
zF*FADKVG+wWMh(alstQ-Z$d`R6$iveBR5B`%ffjod&P`3J>A_YBW#fJQOrlK1P4x=
z4fbT%N5K+=Sl(0f?0u6)oTjMPvo`h7R!ueL&;|GF90Bv&n#uYf!M(G2;nOFAf5hk!
z_&KiT_F5^;xJp@a(Rd32TjV&&ioX1g5D8A2XUdH$(L`q>ZF=t`i>CQ>wU81lH-w4R
z^BhMog`6q-N_miDi;0-e<)Si8uE(#Ly|uM)1s|s|pv-wehSSeLxlC9x%qnq_0Z$$Z
z3jfUdHG6JaJijw35~*~_s_FTz|D)2sQThzw4=f=EVtHQ<Q&iZ!LUrF}@VV^gsq&qU
z-_^eqF1g^BOYlD|!Wq7akZpXC3vuGEiO5`kDdd?1%7-|)*C6n|LEW5MVMvNgaEA8}
z70pL5;=1E^Y_Emj#XT6#LJdOOKaW6jf-e&MelQ$U>Ees`3sm{TFagixOKXHjDJmaf
zf<w^tbI4(92d~iO;N%hKbeM7-!XHi~D&O;iAFVQsDbzonA7D;YD26z-)WYO?xZ6Qt
zJdgg9D|FEw2jlttpWK3l4P_XgaIa7~hrNqRC78~22)yoeArg8pHkK46S;a#1`K&L^
z<IUJ}$7=u9(%D{`6<e_9)@P?mRB~QdtqoA@UThbB?So<3*C8lvzDymgN5WVZd4=wW
ze5`T)2~%xe_ydN7$0fhbg8svWjUkF%-Q4p_0Su|eD>VCK-Sb^~g#>@+GMwRSC#`iW
zY(2gVw|>C7mRTJ9*@+@FC^=o_<tPV+pdS#Q(Z~AXg?mZ(-3iVr2a9^&R2%k$NwJ5u
zR`{b$nb*60swT7LlHkv_Ff!FN6|CbNdl*?@f3QKsqfNHgyX>N%+ey+zj*L2lrsvR?
z7UY{r@{@O`9^p<7>V3-1*!{-{{|D!R!EgTuNBsZbQ;pd1tLJb}HZZoZtz11oTw8?6
zGNA~KLOIRht1_e4LovVlAH4JbhZ|CaLjDK;sEc9_`5!!P2~I!ge`=X}y<08{J@}77
zg$|1O%l{Azmcn>P#LWBZBwx6zh2KG8<~qX6t;X&j{GW<iH3&^(vG)KN*+*>@*cTV9
z1G7;IX5;_62Wk|dL`Y9M|0%l&r~e{i4#qm3Ws$tOg&G;NsE3%s)!Y^5j2ebKLMPOI
zcNPO)4TB${HEO>fiaY)p20cRK)qY16<J7j_|2tSJ>Q0cL7}|DF3o$)Xq%A0B&vp4)
zDbaWhEd4jDcVOuE2t`-J_kSfM3}g{~@$+Jclg)8GxL7QF?QY5NIjj6|ZnSnZTPv*i
z{Yp&c#ncPNT=f;N?o+&Ki0Slrz?+ugRsH_IgRFvX90`!}wi4{;k#ULeC6$q*Sr)+u
z`KBLCf-inI^lzxT0yh;BjhlNtE!2Ii0xy0`^cPu34>s*EJpTW~<A3pM|3AET7~bL@
z)xdGZ;=co(yk|Q7E$zJ5ZmEnA#M*qRU&VU1*D2;+TDCCrmH*RaLOH}V>;Hsi!I*JB
zsFUEmm5sq{&;5^dG556_|NlsTvl%2oi~ZN!0o!$b5uZayYYOZ}&9B;58rIC{R|>lh
zS+6e4_lrMvPR#0A1)g=(-sTVqRnKzF!mL2zd21VSbu$(VU&7LF?yH-Oat%I)*~zy0
z97CBiHR8zXV!rmwos#fqd9>og37xc7>w@kw_ZCr)zqXLOcj{9&GAOk4)s4M)^nO@4
zLBl`eaAY?vpgy`mjJwV88n2#JOa12`jtHF$cLYGti%r#1&0lp;WA$bSOx18*LOw_8
zp9LOOt`H1=V~PQ~jUlbN6i^d@2Q$>Sn6?go!5H>BU`zg$^$TNK31|ID72Z=sZ615m
z2c%b^@`mD`-JpieMcJ*5c!p)0&Ej4@5;UN$KG39_;oxPm(&q(s`G?*9zN0#IIe9Jf
zJ%yfdg-a2<)poKrj|r`x2wl_VZPR14{KIHliIAC_azP*q3A^=A9}DK`Q%SE(z@+P=
z1bO@1=>i!#KLkjCTV9;`o}j{cvlq6C-}>rr$i7u}7lTHgznx3n9gG|LNr2-YoGFf;
z{Q`}D&!#(s7<od%@mOKV?R{)t$vGY&+q3B(L-NUuU*OMPSnY2+mT<3;)}IU(&RjCi
zg76TCj<=?94!;VP^Iw|LXsc(iSFTET$A-tpPo2_nEsys#nsZfRaDLT;AQ7PnI}AHQ
zx1M>&oq^mQ;lB(s^F<1`;Zjs@V#1{L$*1y-=l#EbN1!aN3C$wL<9JlBY4y^3(5tuF
z3RwJsc=xw*UQ6ayN_DNBx>Gz^`iUM%6<%%4;kpA=;A^6M4RefzqEP07Be;}3yyudr
z6ytKb1Nh+Xdf@Y6iFq3Sr`;a{r1x!mg?*gcWAXdy!wUEq3W=W+Pd{7_!(X$~k1N_R
zn10zv(I?_qfRKaca%5N1BdKmXAb-1ZhE<4_&~9ka{r76F<-h4_);B0skV3o+bK;F1
zqz2Sms#7`IWM1cMgAt6Z`?lxSk?tN)bwTouEnVRAmR0a0F!J%2(ts|@wZQmw&Co-F
zlT#s=oe-O|FR|(}xJR&)a-6w0KO<0ahK<qBo!?Mc@k)B+YLz^GrlI&Ev|@=AgSbU!
zx4~|}EO(2SZDp|l;)^~{b3Zda5$KS?;><{}*E9o|$d_+>w35sqSz>eEM^+U-M&f~v
z>4t>nXVaOo3ve8O>uZNquu0ZvbXu6SBTt$ICnW}#km|=qG^c9Y%-z-QJ(`X*wSl;o
z?$p9LCg&r@u4qe)oam*KA&0aV!I`xf`o}YD@xlqZyGWID+Rv1G^v>_w84c*_4HQk%
zd_~8wSX_GKLI#M$7nZ0n@?@l@*S0_ITw2WT_-5bF(XdV^_%JZs(=<XB*qD&xCV7B5
z2X_A13ejXBhfEBludBV!-^eX7g^1!h^EMFxcAg>`M!ddp;d`hUYw`hT3gnCyX3p2d
z8cTh?8SBzk1Dec}6z21L1VslfDWQCULUBlCb)G`GJPY()^j2w%zoZ4TtYeJ3$I23h
zOF%igNGI?<^B?xRvO}7MflBA@Uxj4?_FKojUho(_;{cx+yXA+NL*An4WPX=Q=ME)a
z+GnKFRr0M-iz_e&rJ;y&>sH-I3~w#Tq9s~u$eri|yQIZ)W!lrdC&&HIiy;NQ<FVw_
zU{CJII<RP5Qn8I>yJWBFeX7v38&KSJ6%Jofi5J(ojy1+G?QVmbD~%2^IFlrlESoVG
zn6^bG7)LYX*YIcc*M=+lK66-YUC2d&3B7yhm}O>;XiHRSL6WU2Gmy(pF}(KEw@|pr
zDxZP~n^%54YmWefGxzO9(cSUKCAx2hSn2MH=Wf57-&69PpwkQOEhv4Q-}4s~Kn>Wd
zqjUkQD#Uf{{dHQKo#nSiW16UE1It>jdZ2TNx-V0)<Qf0j@2GeES_J4EqO;4A&^*r%
z?ErCbOK&>SijGruol34fH0O9XcTvgKhIYmqDK8g9KBdpC{^4t9ZtPGRqqTPzJm?Jf
zZ~Df;anLNi&o(;p3`d&ButsX4`-Nq?m}+tduf4$zpJ*d-B3!Y^|7ycGTRWv(A}dk9
zlkCj)KD~;u5}8@y72&0z7}GQbAA|njOUJ<%S&RqKQ8ZIo`|ERSTb~c!aZL3~)VYI(
zkccqdgoCfif9!Xi=9QXE{$Uu`?-Yz+9}gS$p_|&+Ye?Z55L9f41}i?NQg3ACo6<s{
za*daaMtV(~db{iq%U0jlwhHa#vk3JYrcos=91|#oJkcIuZ(&jH+Fwpwh-a64=6=_n
zvqD1iKZfN;3#E7PI+SP=OStI7z^NE0&^6MwT@7<rr3w#!?kcjA@aPQj^^1>xfSKX|
zbHp2~Br`P3MDl-(c9XWPn=JZ&jxSq*y-%A#F)rL<+&gIWJMPt!29|To+WQA~6Fn1K
zbUS2`m-cgN`|8<*2A1xM?Mi8HZcy6s9#US#=3i1X`hp<@EGWxvmp_2X|H^;vPew}H
zMgYa!NppZk8^r>PF(u4?81!l756&!k-QgZCMqV~iGYa0`vR2a4DL+NCp?WzGnjDp@
zuV6v9-zoT%SuFiOjHhw;%r|sAP*B%xaV8uycZVOKzT6JUbQV6cw`=ixf__JMk~1_M
zG+B%xo71#$Q*M~+c5_YJ(}UwZ!IZsn{w1ZA1EoCL=hKkUkw#9EcA#J>>~pxH&$#`f
z+>{6%FUlZRIqyu+Q*7=wHj%{MW@qyL#-y5t!C+NC0rxq9wG{dtICF)czCUs8O*fKV
zY@Z>Ewgz!{m%?z6Byj+iT8z$*oKUjE?@|&kD132x|ALIwVJa^%<ELM?T!)e8vo})w
zeYjsS+Z9e8hu4fYSVz(}4AK8vj5a(<mHyl=wGhM)jvaW`$z@JC85qZamFF}M_0a4w
z*v;8Y$KMSY_wO%c>&Z@sj{T5KW!jKgo)pUa0bny<T2|>Rg^=;Kb6lq@^LZ+bFBJwh
z`MpE0##SL8Pbz_sv$~~~G}bR^ldeZ!r=yI`vPt&Zj$j?m_(3jXO?UOu##D5LNFC)y
zOCFro{CMjW422EP*iEhHw?EF64I5ATw7Rx%a4Z8Wmw-9a35VZ3zxO)RlPgKRaXtP9
zoe4Ig#mE47!)Y*@0>{I3U4)0FHOboc9I0|zYp-qPpMFszxe3x)r6GByp;YmmgfCx)
z5%*dT`Vl72?1-MY*zF~{vn#4o*LLU1GLa2h?SgN$K4n(z%=fUHU!yFKoQ;-^c$=P}
z8qDJFDd7){$0(c9mV$7`m`ajx@uA){+&G_Y<0KQl9`NCCx^kIu{xk3(=S7#}?B?pi
z%>(&UkV=5`({L3`ulz>M$EMuq4dEg7g55~$iX=hJN{3M6ALQTDiIj-x4zvvJ(}8bN
z-eIhG9C5F1og&sZ_)X^5ND(~<n1;vfg*+s`@|Q{xJ|uq?&*TBWeXD!Yv`O20P1C37
z8!vN<LxS4yF__LBW96;j&Vq~3m;9sZnArGsi2LWCSl{d!i)VcL%L7dMEzJT$ba~OL
zXLrZt@A5#8-r@jYH~w{qA^0XYQv&F{Vx1MLB?zF2lFGM@pqE%EFqY8$9$2b_A?rBk
zj_AL-FeabT=5`d71EAi)zvpd=1^`qoRP^UI|779qEd5v%Mx2p1$d;aTpEsaDpT&R3
zkEpbx%$r*JF4zCZ_zz^oCsS-@{t(PP01q_DKFG7fSG{!)`<cfX33~rZe7#e$0VFqk
zDIG}N?HfYa4cDnPB;Ys4hi<f5OJ<aa6%}V>c@_L|l&$nma(Cosc}N8zE;CKs{tS6a
zKx}ZJ7%gkhtj|e@gF*&Fd8*Fam11M+*yw#x?^}GGbymBqJ2PlK3jiHQ<pD^!P7ZqI
zPC~d+3Brc(d+_!$N!OAm(_@V7`iOlj2EL7gpCc@a*7dSHFp_ChT4dMgN7*b(-Jc_6
zSthAdkQ)A}iTa_Ak~8>b>U>b$KfdPPn^E-Dw#Y_^`!^k1QzMj&6k)yU?n_*6mfIMq
zbiM>eWVmP<-@>nLkIEY3SJ0*;=cPF$7u^1&(y51#{pZlqiajD5q$jxT(&muVq6B>P
zq113-*R@>5`z&H03b%}RK<rxDoNP7sVUXRB4}pPUT2|$LzNai7K8)C(IaP#@Wgzq`
zg^Vs|6ywb%8cWr=SBcQ&M9Vh!zsSkFOk5f|l<c9BEp-x@I4Vd+KP6%rqFKGJ3hhm@
zlOu1(zDK>G-JU6yVW#%Shfm1tW>*tQALS{5iZM*7PRLMt2&mi-otsaH-ep}yn(oeF
zF8XbJFh^PNG62w5&te>VneF!eqxKq^z46O6D!<jC`wD+t?2O(xU7*RpUri(9dFn+G
zd8jcx+*(p3YW+a$7<z=cK2s?-Yu#R@32Fr8)(QHul=1NvhGB12o#(z_kAGVg9dRg6
z>VwmqiS_r^uiE))0CS$v&vr;_-7lYz8%BK7c0FfW;K;CdsSGfXyzE+cfZiiZ^aquj
z?E<tz4ZZfnbx-Yg7Lq3b+wt;%mqlS?R#p6z<mVy&xK2Y*icGHF{F+a&kHp{#k#a+a
z>@UZ;pA<gHKkavrf^6|M#;-7zH<u$bHd_?{($QU`e$uL*!V#8mlk;|*y1aX+2X?P(
zTb!gdXok#-H+f=8hG)$H#cm|-?;c?~+FK{_*&g~c_!xTZGwFw`DFo47x#Xq_Q7Zr9
zrRWboV+MIDjZjrq%uffCBhtC&`mXg=*9U3C$6%T*eB@<~gt`@~o(NvY+@LBgma5t)
zQ7DFcXMzW&1M5g;&44F@$ZQjjDc*hW1#xP}J-$B%3fNTw3(*;y4!&g)L+x0@AT?i(
z0L~8@UX2)rSd*NUMCU(^_=FvnxCce{B3l^qvtC9TMM?3Pv(;m^AzXQS^?67ctX}m#
zMr{c*759gxlYny@1`T7zdR2*%t6%8W$*z1SEjQ4SRkK;V0Ob0AEe@Di##exE!EVQ<
zZj?{V@}h>Jnl0Vj`0w^Si}`C3N*fk?NI5&ZS4`<5_SdIT*W~ZwJv+Xj;xS{ELOwX{
zmqa2o#gwXk7~1laWfh0*Kc?sxF$OGBO!gG58bPl{nibj*mo-Ns@^x;M{-I0mK}XG&
z0!sGmICL|t^}|a}ydtCwR9K4PW?K2DETifNzo<N$J+>ScXgzVz*zMp~Rm2Y|qo!_U
zc>Q^Ygi(iSm`VS+Ve&RjMSqR!DdHgjcO9!+Dxy?L<&4>vV^cj|YvJs}cGsRl`F$=%
zv+&8blrLp})xLfFogNF+CpSNRC+aynFqT8YyNNv6Z-|g%C`83Wj9_~z*<z~ssfrY`
znq7VCUQ{~yrDTWJ7%@}Q_Vj&IwxwBbzHBX|KrcDvoG;iSXMB?Mta#~T0@9$pUTNJ0
zXRkP*b(nM1YeIPHQ(J-M-x2OaA6_-0&Uf<<6dcGKD33Y!#{LZy+%>x0Jza&*TApbP
z2HJdu2~Ji8x1g5Kh-5>Ynk@;4BldBtZa7KUeF?z@FhlXM#{glY-qF;2Wbg5RNJ9>f
z-!FvYvy<~#X~T{gI<QQv*EX~Koq%^KN1@=IMOE#!y}z*`_Ym$B(JI-Pvws6mO4=iS
zgl-_0(jpbHs?>`A%-m>I1he(DY^*pp@7&DSKKCjR;S<_4Iw&;j24D+26eR4k=|2bg
z-Qyn%^5sL`G5>ad|9B4VycUt8@S>Z~DImm0M&w=a#)zIE6z&9SWFj6~deojTm5s1F
zHmwQ>?YP!#orX5JHsPmjYm*B)0)%&H3(SFLBX#JDQ=4vZ?DT~`JV0N34<Xj622)kF
z*?6Egeyaj%<n6M@nX>kl<GmDBVV%GOMGHw@2fR|-SOCLSF}eNq<ZOA#mm&n4Ho3uf
zloBoMoz(>|oXT~AGEiI2DH_tARBk0f>KtHq#+$_#x6~I&oP^KRmsnyQQ}K$^sjTaZ
zePZcy;Y8c(Nczhc^Z?^{k`lV3-c}E54Za$>hA3G%pM#-@zcBySFJ*RpPK4#Gc3`J7
zw1P^@Ynh2ih!}lXGZrZc52nRvZ7Ssu3e0e*{Wt)8XArGQ+LkUJln?{+wmSm2rPN^j
z;$hiZT@ap2>~K75dSF9*tU;$92K|O}J;bQZ`)W)3&QNj|^J_(9Zi7sDVHy$8RU??t
zv+6KJO#auJ0LJP<N^9Bl%nCu<*oE$do#2o!pAZ*-8`ac+=w|?aNlrrl9$qiJ^11V=
z;2~SKe`pDa;eZZ(=lW>RSX_RR`QeagU#FA-CwT3!^I6XoD+(npY>vqfkIA~Q#AYDR
z2<C3Eu;dR)rIx=BmlvwyLi#lS)?eG7xW13JHf^Eq#F>1E%6Oln%)53qQ}WW}dQCgT
z$Vf5hwFOrt#t^3h8JrqtBpuRoz=~W~Xa1M)fOwVG^Qu1|*woX8L7s>-+n0X~b2z_s
zLmd@jUDukVyGX<PFo)3Bl5PSyy;y5XJIoz__mq_;ypSht*2=gwZ6Sb@(xjF>-dPAO
zN?m47oNZz-5zh>yJ!^6Mb?#qoXBU&(`E719QkksM%N?7R{^V$Kk02dQR!T8z!QDxQ
zi>TE-!6NZ$RBtYs$F|UEaBNK5L#Zz#VKqQ8{xP#N*7K+ff_}KdAUd=}nnVJR5lP@@
z1WW!U`fAEXVkb(*Le@qvai)KTm*CGkI8fo)$q%6(aH1!0f0&=jx90OM;5pc?Unrk1
zDgD=T48|lUbUtvM=<(+54^?4Ql%jA+!B-SSkJjM3|J9jbX$FD?(w0cmNn<w*J$rl)
z_{vQdPb;D<CDgiZCJ4$@@FY=hph5aMMr)@2c#kTtVuOdlJw8HCW$XcBvMpL>o)?fS
zwPQowKv&H0@7xMQ45Smzu@1`m*^X%F!Kuz^XCg{WqfSfOtVALn75UE-A6mv^R1sT_
z@P0<rff+@ahV(Yx$q)w47KQlKcSJk<*Zxp4SbuC2La&<yCKvq#{BTw(lr!y|*Jo}J
zmV-&B#XC(E!S@qHpz`Vp$bJ<-STUdW#FjtT={Jr|znT!Es9Rc7kD&fKbQ5Fn;~+*+
z>wGEvs|)fjF_!g;kYS)MT4s=Y2Hhj-L;2}$dSnu!a%;HLb;6M&EK-HjUxjYYBJJiL
zGo*ZW#4k&nqfwXT7<@2T$ld)j%zU{tg}TtE)#J{BDAWjwU=fHa_{lYZT>sO7P85Tf
zT~x!WT$im)11-a&i8{7@U47hHxVHj04p(7#U{|BlYJR;%Jo_E#tYULzbpz$^j85hW
zsNG?}6yEhMg9OzPap@8|yWHL}8{Ro`U@w~hpd5y&)TB2tr-n6M{5;?>Bw32Miz6g&
zo*1NccCwz#Gq87jG-2~{byymU9MX}nO+3zIEyPLs*kEGVyOG-p@-sS7FT3^CFz}0P
z+#XOC7)(K`FPC^DPx_&kdg0D4D}&+6PfuP!gm{k?Jauv{i<I|64`aXQ2Fqkl^ZVsu
zT+mMtXLt4~veZt&qh>Jbs?Gb68BQnC*&UKxTsA#4@s>3><hsev-mnB>J{L%I&iG5p
zaVedT3c=)8bm!xxhqx(dyjq^_`v;*z&}TG?U>$yes7baTe53XYvmU?p#&Y_xRIg18
zJg<KXws;PM@MX;{nWMchG0Hu7Az)UL^><Fjmh+DzW4(KaW|})5iIS6C3`PWUbd;<5
zoj2+RM+djY<0^0IaoH`i;7<;J&_B8r4MF59ITugyu@z+CCF_@Z{1p%POfwKv&d&lV
za~YO;*zGQ@%^ryX--8>Lm6IRwi}4qAs%c62)51>!6p2OTnh0}0-D5OWbA(korETCN
zwr*`o&qjS7PyZwtmj9`jY&1nAH+4eq>b>L-HZNcmdI>6yU5Ie;bB5>*2o76ZXh|DX
z>fkkxG~mQ$g(;ocmm*Tx{Hr`5t0T)u(u=>GH5-u65ce{$VgBgZdG!dc2{4(LI!W;U
zIXJ)$Ay0OTi*b=apFRYC`#pc1O}1YE);Hpm+!ZZSHr>U?SSD7vh^ODagimsdLlmOc
z1x-mq%Q~b)IRK_<hYaIn&R5;va=U+mh%q}8r@OEWqgqbL>%|4It<jex)e>mN5-yY}
zI7kM=5}*EAs_^$HWBjl#wYthxav~YBm`l1EIHV@YCI`4K_S_z8NQUi(I)!#;+8ad$
zt+*ncGmTj7IF?;5m3Vmy>l-?U({Kx&U#O;>6FF)U2haRr-m8UtGI>`br0ADe?5f4*
z6JGHOBCcCK9!eo%yMyW`5c+0+Ka`(UnL&+F@z^FQ<*FbV>x*iB^cxUC5>sY1WQ+DQ
z>_=BP_h?$%K>6`&+yW0c=J84BN3=?Hq%Yr(Q)!WGny>x);t{&w_R1DG@O2PJ|KS~a
z7npE}ItX=oZuNoX>pWG2uE+yU0l{Qka3e-8&tMo8i=o#+d-A_SQ;6(D%Pc;+>?&D@
zdHtxX=R{#rm`AMXYy|axcjBu%@xInYk*oV+Cv?u(tMLY-moz<N@SL$CrHRSTOr8Rt
za$FF%x44VoYt>^q_vsJ~rYn08`dnBLMU|H{dkiXnQ7aGALf>#ih$3SP_*7%^Z}#6y
zVw%TGtBd0D>X103i2XrWRRyc)?7(huPT*e|k>J``xZV6COT^zSa~j)N@%0gBQXOfR
z0U&|ta~50P#lfj^yf78R07}c)a`s`jzL%#QooSRugOgKd>9Jcqo$SmgmmTB?yc68&
zsxDJFWUoS^3s6T}!It=K^SUvrjXpSJC@s!_sb#6MS~8;E`=o}Cz5W?melp)v(YO#e
zP|&%DY}?DKINsj<ETYdnt|o$GO3+izmUl;A{@C1a5q^SXy!c4wf5o-@)m&Y<oix!x
zN*!IU{Qi&~-{K~K;&FEQa&+Pwbc=)XiPFJl1)^sYOT_-CDu4~^Tlk^jEK$&h{encI
z!HjtF?a7e6Kos>mhXG=p;S?g3S1VYyCcdo_?t;k@!Q~o6e{|(PWap@GBZ7E)fYAPn
zF5m@@x2=8RildnY{}d8@!Zy)|e8voL?$OVH6`qF+#c-jyM&D*Wjfnk%=<rW%ioH31
zwpB!)%|}1ADPb_)Uyw2?nw!Vx{JPi8z*Bv$lP%<Fktz>9g?pWnX-rS~V)`q!c=BA(
z3}oOqNX*Lq0?YTpw+Dqtcky$CtAw{pwo>+WDmV-p%H3IFNOLPOc$2`Gxh{$Cse%_u
zvV2XAl(p`T-G`{_VR=sKXL$h0r!ks6`tV6f5ua`Fe@Vv_2Y>T*cr<@42JcdjQq6{S
z&?FIVv_<8b%UC06U>w0I!)~*lOx}-``MF3X)z|0F$>7PBo_XuYfri(>UVDGfMvYGe
zs4LBg<Jn)dy%lfgs|)5G<3C11zsq<v5<3ezu|7@r`*r@AnZ;k~NuJL_yM7mI-&4py
z-YaKhcdD))Eo5_n$Yysl5XxqfE<wyIVOv~OQVr0I;Ikynny?_Y2r-PN0U37uOl*dh
zTR-*~@){H*xKu@99MR(VdN!s8%i}_urqHRGa!l!z(N3v2>Q~vV&yF;DgQa)hb*Z(_
zhJN+M%OQlAUX^iY?sZB_*f$C+l50lA&}i!(^aNF>2DIBT>CavuH5}x3bv02j^cyK!
z5@_pB2q((G-y~N|&0D!!RHoM4?vgZ}7bG$0@peyp@TzsvKmRd=$0;V}*mx%5Oi)p6
zSk~|sx*Jf?30h*+Kl0n@WHn?3JZ!++X~v{LY6|W^yIm5Kd9<<3mHD@z!RJ(HD{Ox-
z4A0!^VQHyB4!~wzSPVtZa7(0t+?V4s7Q>N3wX`J8U9?BWPwgWi^ZwK?>n|VY!aV?2
z)}T8>&V2C)i*g~GgyLKb=L|eFK*hVl1ZgeM9r`}}mo>(p4M7w{*{tqkI^*HMGvQe`
zW-(F_R;1Ykr<9U+Ka;T~P$b$VZEugJ2**%SMT}IB^F*Sv>>+p{njZod#n&P%{$&Sf
z2IIH<jm%y-mm_z>mg^lZ$x?r5p=UEz5$ID1S^_rPr7I{ho`Mwk&Sf}l((fg_zxR6!
zDbG}|$eFdrMepo+=N_XoRE|Gj!;Z=P(9LyRg9gQAqPABinY(Sz2XW#&{7|QF1xaOQ
zu*q(T)wuHQ6^*=eh5Lt@xi*_#M`;!YX3BgECC#7*BwX7uBcRaERS)B~%iz25BT~W4
zsHAjZ3=qY#P5*3(0#cGaON76gkWXFZA)YLW5Y&4)fnnTRBCT`B%v3s**}1<LW6|Hp
zr=Pt`l7*s(3p|KDASlz+n+-!^ZRBZSGfV;`mL8ize5H748<`JcHKe_pG@K-7*!&8;
z7-QJy(&Z$PF*V9ngjw^R`)0IuK8d2No13pUUGpa3&m5;mE6lLH#o-Fxog+H?W8*3Z
z!>$Q{cjc3{!mkS*sbcZ<7V9`(5ou%-lCLzccO}X}B7JU$cfted)|KAa|KjN%AP+)o
z)ulOs=phc+I?J8yF8!G5YjCo`07CcI?)1-v4u@<cUrKISo9$+bFV0W9y~n8I3EBv`
zIKAd;h!X$EmeYS5h`JQ1-9Gs+q-Yjch2PKt=^ED?I*VzL0B{6ywv>m&MUJ60)>(Nc
z2;kRpRm(3=s}m^@dKN)!D{o;j*!dl7V|o9*D=N3Sp19woZeYghsBFHxGV2@<QU6;K
zzt>ivSAAU`$Y+;Y_g&m;AA<ycao2;p>uCP)r?0<$-;+Ffjh#Ec<(IT>d$fpSA&Ybh
zHc}!?%fZu{pfm!kkxQs)`KfRA*krgX;G;k<2i<Au-}lIRmp-9B|C&c6Z~b%i+d#vu
z=A0Kw0P{UC^G9KSUW%csjYxD?@5`1@AfX5K>}-4K8jG3bz+ASF*<SqeiC=O?<u*&;
zo%Q^fkmd$$5{sEa#oWf?TvPF2v$+s#=X;5j)#h1O1C%jlk?`p59iQDgi}iF{R>XH=
zlTF%+6ytI7H3?J)TM$i9FPWyVp1G%sf(DW6Zyc;3L=BN1w(+Mr(kXsUr8kjSL~OPD
z^RWkWJP1881t0)8ozy=f8_%DOYb7!QW&Oe6Z+kM2I~ieA$yoyUHTt7$XK$&8qz&Ym
z8>?=Ygm+Q6_u;eJ_rqB+4G;BRU@1~*Y3zHkS8MPbAm(fA@*MGTr#=tLH3%820s^jc
z`V+13B1FEMZs-=GqgcO_w{T{_T~RSmx|kAit$&jf@e{<ddfezVA1Itd1E~&(isuaX
zi^qev?_zu*p*tUN$vq-vuwxErH}7oVvq(VBnf2iP2^#8sN1IO0MG&<9?t>Wrr*d>z
zIOO_*a(iR$0ar;qiQROfX%l_F{r=9N+%m#HtO<6E?3R3J9|@x6`NpF}7|5tfWD7T9
zgvCgikc*e}2tFyZs+kkOEA%E<J<Rt=QK&yw@jRt=8+GIlOUy+{7w)hpGP!@j>5*me
zwp&XfV&4wzkiSFs`HFdiL?6|)FU1GeR1N<3mbhboBt??5bg@)cswODVMUQ2C1S-1d
zsDeg9=UD$z4+rza|9mF$cu`(K<;)hQ%J@uofJW99I`4=PBd{ao^zf`5?AiEQTVe*F
zgJ_O!QaH}XUMV&YbW{=E^H8Ap!k(;iK$A)E6yHwX5F`k@lGI<Y%?f4mcQ)ANY6Q6y
zZ_X;LVJl%!Np*3Kj90nIEU+1?04Q=Gt_HJeBA<1)cX&)xsB4)}p8JVDK_m2!T|jTA
z&K){0T*LtLKgonQ;GdSwtxNx!Dp(hI;>Zl2`U%sG<WSDhDpt2%oc$M<+0l1J?#d%G
z%Q@We4UztSzj4S6PYrLtQ^B5!d(U|LT#%RU9Fihhq{8Km+C!kBr0VIJN6;5CFXi#3
zAPP8A=}rpZW@adBm;Y&89>FfY_VAt>d{=xY@9nuNCkWm28^2wdN6b|LFFTjHJKnv`
zr(#)_2U=a#L@?(T&!2DhoVPrn=GeZtjJ~)!9M>Lzlil)n>u||v2cd2xtR9tvCl#;8
z2MmINtx5?wS^}+#EG?DW$l-8&>LuRM>EaT5mtv$LAYwqD0q-W#fn8clUnqM5;hx+;
zo2y8|7YirqGHbtIBx`QT+1m4V{e~<R-|n%_2GQtkZ^%EyP}F%qNKu<ecqOnDQUm)h
zNM2D!^F@An^p}hfJBjrVmSQg?=Now}=QTOKtGWO#rzHyH=CTA6*)__^erU1rVJ{s2
z%x4jSJh|?0mmh}E8W@~yJ+q$PC!j0fPOliZ;e@MTc4YPLk5*0!>CA?T$Gm|NGHb^w
zz0IqYB-9lkCJ(JCPPEd@__9goe7tN#KoBzjh-{$#^j)d2K3)FqM>q|hzJgO3(F$0+
zZ#(`Nj4b!2|8dFA+vn-nxoz|d>g-scWDemm_>Xe@IMJbT^>~9~e;6uyar4ht<A^j^
zXgT^cI!;9)`mxnnp0Pz_j)Lw1%W&aSja<s9SE$AJc5)!4m^}CsGm0Wg$bmWS{LIsK
z%VSS;V|+Mnq5>DH*s2@S5ytNT3xy(4<nlk;UwOXYvSy&uh3L`cZS@c3&51rG^NXyd
z6WRQ9$F2~Xxo37QVI-mNo&u5|F&F%z(ZJd%(5iy<OY<J+y!!BF)XJL(1RD>mrS78z
zX^=e&REsb~sM4qqe<DTS10+;?Qt9<&3|9Z4HQI?8yGrT=JaIZyJ|@~DMnrLyx<|m#
zCo-iDZ5az@^#l>Kb#=$CvlTou%+Nt=0u|#Vz1s`G*FU8AKo)4Ue-?g6*Q4cuW+O_J
zV2=We1)~nw@%(bDiE$MLbABA0v{kI~UmC%4e;1~Zv%<D^{orhP!^mYmH0?0HjcGUq
zNPGAfKp{;bf~bv)tzT3diPvNKvk_Pc(CfGg;IpGKXw5{z*13SLmp%4K-RfDopd!x|
zbdj)5_Nb5ga*e%*J_HtQwo#!Z&#w(taZ-a#f{IE|(o4uKIdYqe%A4tpMJFbah(G0;
za)sodzB3Ta^~F=??X{53UyiiVl79TW*ZuCKbLt&Y8@h!4*hEQzxIEn*^P~~%CKq25
zl)1U|UsfU0w^`1ZI$Ra#eS)&4b+d)3W>Dl9qfSzU;u*P<>nX58AD+*j4^4L*Sg#aD
zWJtAz3+mYhTj7S4*$m|QDZ=?2{255ko6RrYA)t(}KTyn70Pu&kawmv6rTc|iw}smh
z(=&m&Bbgp3#hdm~*8RX+{l`c)LwA5*$FXS_xd{n2=s+QKuX;_S1VG5S!*f1RS6Dn@
z;z9mk57!{XWQn;hOjS8~6)U8gzCW4L{ay9xlptD_#JQ*ip~i^VW@yavA)$2tu8MC~
zwV`M~i4G->rNo_v!T7sguD1nqfxOxNh|pRkj#xA}@Z&=N`l>7XwJd^uK61w!DZA<3
zztR|cA<_}^#bs7oc2{@*kG?O`%lYhr-3>(uSh8AGLvybmJ$~I2k=Ni0%BEWn0=^g)
z7a_PKD4ZX<nh|&0)*<rlelXnK8}7~}E`o(<!f*H-QgMqmbR2Y!)IM1*(Y-F6=rcAU
zBh@>#vO}I2WIOMha%Z6Df4i?Uh_nQ3UaaD$7B+HvIg4wa=H)=0ubp{c1#ifk%z30<
zHn)hU&2r%Z0=xLi1=(6n9jFiaTds_VmY&HTR;zPJu(W7xflrEpZY}tQUyD-rhvXo&
zC)yY2ShwJ^8z*>%2-Ec+R@heq5M9^%=cq2yRgHpWH`d%)zqNPBY+V>SGH!+h*(BzK
z#}Lwtv#qmqR@dA9M9;eHz?mN6(Y(vp-*a&hc<=exuB-<_nT_Fv1buxAhpKhi7-DhJ
z<w*PzoeiZR=QfiVmf2&s-Khqm?GDITb-EpW(}Sf`9@wM8swao<bE0T>T)*+vJc25-
zB7mD#%g0C&8lqyP0ntko#%9(D8(l_omi0)jJopvZ#n6cn9(E>>1z=2abx!CL(J&q|
z7go70i=32M2`qT8vkjP-v&SS6MpIEP2vn&$M91t3t(TRK{v#u4LZ+&iA^&w2f#}zQ
zhTCEMkCaFP^iM^6!<9P2t~1xa|HF_#5*&dPyCK?Sc|g=Z$z(QdfE=Wa73+6ZWj_+}
zE(0g$19`pJS{YKtld}*5n_<s7T%kbnti`<pa%#*Z<G2Q972Ei6vF1KP)1Q4CQcxSX
zW#2gI+Zr}s&H0mj1c?TQ#M`Ho^Y&m18eLptT%>jznLOYD=U03E&(|9>Ij}|&fVUGl
zv3v~H91i~?5tFbOJ@Fo1HnLmA^LYKEp<-3EPvemOz9(f*_J96*r^)PGAY%F2&(0LS
zC)HdsrzEMW2@^g0Ae@uqfh&z?*uTgpr^Hl&64}@t%U8LL@l)YS*w31C6e#)n$QDH=
z$9OgPKE-<q-lq7>1VtqCIyWRKe03xbXl6P8ETCnM!N33=VYZ-<=N3rRh$ktcP|oJC
z?>G&-Ft0d##sX+pY}d+SxSa{KyM9-l-O(Qn%Sw{*n=44Z<uMh)Qle-J@QkB_O*`)A
zfgC90v&ARc4y!26+MvM*q;j_-b2R!;fkw@qRN+^JHMQ%d?vCAUSLR7<Cz3CS885K1
zB<*x6rQjEp+&)pX2_!Z}a?jvw8CV$A(>=7~b3Wv6*#Q<PvQ!L$hHU_MMqds>B{7-}
zX2XaYwhD|jdQx#&r6OZ`>vgl=+vB0P=l!YKHy8KCmgD#mrwak(VqIE=Ww4wZHyBg}
zjEp3v;Yc<#sXOo_d?_3Eya!3id5epeC~wtDPBNCSQgH6jzTQ0efcL<LQC^Bpu0_@3
zi5lTGJ?7cnqqUiRGtGz9KnS>>Ns-%lkEHIJF59#`_SdfgTtVt_p=|k_FQon}H7VEF
zkZ+Q!7iU~+-9zi6&BRYal4kgP|BzMiF^x|2cjj9Cuycw9(DJPk--SVgnp%ONrjb*%
zg7Mg&6G+oHW2PbcZR~o5h0Yy=?cTq?>EMf@e0VSYru%#dZA+rK{Kke9+yvL#c+e$M
zeGm#K{j#{h*IAO~k&<$KXiD}Y#35@*ovXBqq!$q@^ZKWo_mXhckQL`m01~P2Q@>Sb
zeA~p&j8G`2VJzOO7r?dX2lYJ~t=V<C^JboWS8~zTVaW%1!hmF0Sr8-F?0}8k?xs6g
zt7V2jj-eaDk7h&VTA&Na13Xk|!9U>Ix(-aUo*_Wai=?M1^F1DNSG6pPI+ZbaIs7Oj
zpu#FN%Ys74*BwS?Xpzk;0l=hAA0}@gy9ys1i&|lt5A2|)!XSxeFb?dP;HAp@l)ArU
z6|e#Kn}jEitd4*nk&}JdS_|1KTr#7lZXAj2Cp3fQm!8V&LX&=!#*ph6e@-aXK9>Ek
z55#gxiRl>DF6;lfD$-xJl}O6`Ukg=n>TK6lu8#9h({C#*-Fu`6*WFwY>{h&`3mTV-
z(Srt51FxFW^VL*yLtPHIVj<+8W=6xL{aI;*GI>;(3rZ+4T-D{}m;h&PJza#!qXzwn
z=5H~Q5hou+FKC%y-}S&x^;a@_Jh-9pUVBb|SWz$G+bu@X$$#ytxeq&RH=i(ap0SMi
zEYxFQrC%D8X`%N(BTRLK!Ae#B*UlkHCTBTcbb5@r856TP+;-zS#m63{WuRXZRegQB
zah<rDB5`U2K3Pk+2QRGb!+EfvIVoV5zFX{L41iUtvM)eeGbFntgI0G^@6)Zx$A=1O
zsnsYwEkz?>qiiw}+HBLF^P%G-TjCU%G3Ii$^e1NUtD$f|2fk>ZVO)Lh-ozeRPZH6n
z)~e+n*xO}ASi>Z(Tb~`Gz6oG6OU0hVKXO0+=`?wg%g?|epzG<y$6Hrep2c7!^Cv<x
z$=EU%@!-^8VRO{>O9<u`$Fj9e3W)-!bCOK?<0|T{!tKuXvPM`$oIlQJ^(Cy|Iq$DO
z2y0e|d%a3?)}swsw}0bG9F;_}PF8fq!iq;r?C8t2*C2HqBw+JNd}=%R5(U26eBUej
zW95|y^g1fJ16oh(F3&q720n~VF9+qEQO)+{J@y1kw@M3zkbM7R?&ex|z?>w69f{Mj
z87;4q0Ip(f<S$1}w&xeHP|O!nm5sPeod9ch?z@Dt=xnTW2txUL%E`X*%jqGjzxURl
zZN<R<;lmK4Bz}>~l=OQZ8M6$+cTr^b)nwDfc{x&AMwh0NXEFVoGX~x1Rd7#TF{Z)T
zNUgO7iBjeIFI*g8#@;(j1GP(o7F{!!V6uRxIXNUT6z^-NN|I)7-U7<VGN7Pu;i#QS
zz|&>9>rnf(#@97{Kjrya+*w~nzyF&jfC4@)?$(hE#BgK>j93)>c;0)qe-xDe)dc*z
zoE?F`5UaiLw>qP?PJaq_G}X}uPtAKdlJ3}?u_%1_WQ3BQ<OnIkRJ%({^rDT?1Xd=k
zyYzi501>m9wY_Dk_R3@j4Pbi4b{XAjnZaW#fBPmgH$G5tZV7LEG?9brY>eo)u!>xl
z6jlzXm3fL3tH>vOTidb$*#eP0IO9X5gbQ#`m<odi!|9Dm2pNQCJWm2+D`RW?V<2~9
zJ+nK9La9Hq9jFg!u-bzj%n3Pt)<-oU62IY=V2%kXVfr&)XW78qCHXXqNJOqk49$Af
z04pGFG|;$;hLecqH}FB{#T2S19r}lwH|pIFvOenmoeF#EuChMCtlDxP&nP}=Bxwz<
z$@yb2el%f;@nV1)K-tCXn8JBr{jY6r+4#QTZ}_F^Xi8}m$eZ4tx?Dm-k1`~P4xZGb
za&n|Q`M9bSz^mNmT5XQ5YkGYi-><NM<q673Fi2lg=^eIEk{s2h6FN$Y{9f9{SE_xA
z!WLkPQ<WSzjtCW7f2hD9m7Axq9fYaaV_Z3x70NnZLYL#oH7E`re3hE};7^{nBLCnp
zkN)GSZs;Bn!?m&NU4Eb<X|le%0?h^L)~28Wj`{@aT<1RzFVC;%M5gfS__}-W^Nc92
zDF4C-?MF6?{paBfd;DoEteeS|@r+$!M@->Jwz-Z4DV|q4RZIQ-Y2Ne3I@R_dup0Xu
zP^{>9HMT^_gNuQQc7)A(sxLL);YnE+A>9oJTi!SS4Iid1=KVMdj}ABw^a*e{L_l46
zrxzlav{8;|)i`gj7p?QuNn?GZCG9fDiMCz@B4!_jjYHfl<`613WXe#E=+`E)n8l{L
z(Fk=S%(Z!A5?Azou~y`B?d0WctZNMsWu-MFGn~c{0tb0E?l>m?NrTQa+&{1dqo*=>
zj-PTS9OCg7Q5e_2qRbC@_ncqi19O|_9lYo+Rb&Ib=bJc<$YNmTVXOE2@9-r=%9Eod
z1iE811k=Gx#R;hne+(?=t$SE0b&=U=O~hlgf)wRiRer|Gqp<u~5+Q{$(-fWO-UT<)
zS96SCYv5vnqc4hm-S=Ja?frp6*BgH_+^{PR+xJ1Tr+&&49{lJ^?obPvPgx}_79{^3
zZiuUNc<fvw^^aYURkN4;m|BrxkKrT&5AKOkNmu7Frb8L99j(Vh0Z*gGiC`0xXG<%=
zF<)>}7SCfZ&EU-H-ob-Wl7IHtUCy7OhaHS5_`muYm+7P;lv*Vlerez2ia;MCmZ&P&
zZqEV1?)^w@F=g(72&0`rTe6s8a>XQ59?o()qp@GHMf~lyIezbvZ?2R8M~l&0nXT@H
z=YHnu16>A+XJ4z++{Rr$t6j=Q9@(_XT6}r6$Mv-rlrDnRs4NExyuu%vOK5zBwts6p
zq-%Ij;_(1P_uTf+vyHGc<uH5GjsEPnrg5aT;zdta)hQr<O3Il481~Ljp;Gw>Y0acS
zU~`+|zXmb(%N1q*C=*7)g}+0vMQzPb@X+*XM8IN?<{V-fi^^$5bW#7^>?9*-VchRm
ze=8fgb?7<*YC63911NYQ5yru~dO%k1TOnfGkbW3NUzzkXlUF&8+7o@20(r&b=?>{u
z;HDCX4&ipYd+Y%HX$*MPY@cRbT3yA8I?@(l4<kf)_1Ved*h|sRBIb#^r*n*BK>=Lw
zZS)R@Sb6fz7I9$u0&<fBRZhMm<plDW`t(VIZ;c$^GI5Tg5ILI_T_YK9$rE|l+{5Lt
zqTP_vRwi<QyitQ_Q>B9*SIk|%x3Hdh6TgGVZ|MnC%>*s1-4qI_QQ|}dT&ijUh}z;i
z>km&n%58raf#CHJm4Z#uF1+2cVFRCm7A-_Sj()^^tu)fC!H(0E^|Mr#>%8}J8soCl
zausVJM~E&RKiFn#O-5MpjP;~-($_2=c9&hG<f#M01~Urt<yY#w$Ps<g^U%zF+O>y}
zmN@Q-6jhTy{7?|~+e}iY+H!mgpVVU{VPxLeBnxSvA&ZhIM5z8fuk8LxkCE_z+~9@K
zQ8r+4Os?_*HjmZWZIZDU;=q^gj36h}wK1q?F#pHVY?qs5b(bF%kv|~>YZBl_qvU)c
zBKd2HN%VMlA(sMN=s0Hg{-ANZ6i$<!-*-l4D17m?{`l^gYkzJ?|Cc0{EgN<?YY8Ec
zl0}G5dw7=PqOA2B=d;SE@BEvWbv#I(=(&2a{;pXWEk!3&C*=W2X08WW&q#5ucKk*%
zCDcbLr>;0#!99%PRok^C1AIK0cxsOhPhFt>@Ona4b6^7Eu@JcjInJmVt|7@g+CF!o
ztepU=h(Nuj`_Y-scDrOcbF^D&g?;I!?X!q%4f@cJv@0Hl^>Z<l|1kd+;6>V6=}`2|
z-54lEW;8y2rYft(5$gvgsG;#{@e{Pq*X>&{>d!B057{D7l-V28_F)VLlDMsWx|!hI
zJIob4mJd+xL=9)&h0UPlozXrt58n7TBf&<X(#{`EL8%_<pM3++%pWVIqd64au>l67
zbO9y<dzpro>=FAWy;Tdk%aIl{M$f3exSy4EWFEqcCFn^R7UL&75zBS!(WK)FMqN-N
zB=X(HQLrrBvoePcyeaea{N)95GfKWM4D_-Gqo=n^hQ>RARZkN(+G>2-kTPUDeUC|a
zSKEvO1?qS2*JFG!PgJpkL~M~F4JAF#LCUTGuYw8T<O1mB;lSlRJ<C8rMrcMX@IY<%
z!;h*Ddj7m+6PtTM^ogEoANw8}lYgp*vEny@+dO-_^8I-Yn+lw^|Hdy5$|fDp_gE?g
zMIkOKmXKO;F2Sm9sxcYmwL=2`;1fNb5bG^^3+pl{uSq{6G*Gi~Fv^-`>XOdlYbRLW
zRd8kga=_dG<TaPp59nJ-irOya!2$y7#|{U7tUPi?Kx6tV=zXTetoSgxnYNMO2&`Nu
zcrecpD4trwf5XviKHgXmE-8KL_1_pa_sBeQ-VU;rv`weQydb7z*l+9@4)^8AINj%h
z`d8S00t!xUXpNkXqj)R0CvWAzey&^S;=&&d#*RaIg)1?z8-HOid85#D0&B5$4FFtV
zwYg)faB9H}jQYG|(~VRVYOC;hgW8}pn(=yU7sxDPwJY9Vu|d6(ku(?SCG9OsE%Y1v
zv+1E{>F{h=JhPQhh4)~1+p>n(Z2Z8m^$q0neXt#eg_Z7x7r}e0iOc^7;6NY0CyFB?
zw%<+A<TR7qRQ6*}7x`PKuiBVg4_7Hn3Zz2j(L5nAl5{bn26sbacQsZsXk%BIH)+9S
zU0#6A+2n9U#EF~>vRx~}Ks<ul>G1LO;XK0YoJ}s#4_rf=M;ldG2t$t)VfcwA$TZHw
zpxznb6-bdAaw-WKZM|E-dWM7(_Ok9gENPBsNkb$Fx2$2%wR$w-;FL42VXy#p+&P?|
z+E6!&D-M%lUALw>VGOlQV0$|z+@GVV54{D;bbtTwlNQZ~b6@PHy4Qd)6S#3)8cE0E
zWefXPx%3db=9>u`?a{psFev_N2_Wn0Qh!4uZ66d7Ce57t;Wan;5-dkQEGA_uR7(cQ
zaTdk^0Ssrp*xk*MF9FRZzbRpgK+jA4O<rz?0hD(gjL`Aj-5k#n58WTux_q5lTd_9|
z#um#zEf|t;;bGOBo+TD+>g4q@B^u^hUTkmbOY#^a3~e-o3T8MtI?~dZRDfyQ@^Oz9
zjm@jR#DckEy6t|fXsO+xv5td2a>$KfiYi%?HT~|gYAWnk<!=)Gx$d=jE#p`)*Ycw0
zvS>HG>&?%&1nn{Mch8@^cW&=28A(7w0$Dql=kqn`8JCQ<-2h2YOn&9Lpr&akfq-`I
z=UTPq*(Z#8*cbwpF<Q=CIZ(zm%(j<{4`K6pa@xH12^%nvu~hcES+pB#il%<A?W;hI
zgJD!4A#0guiDV=oY*3v>IFZhioc0J`zk&I*czjs2bQ3Cg)`SCiWyq1yzH4?sL1R$w
zAwX4wh~=1^X<^ocCz{+UwkLCildJAH!fTK2HAByZIgzs1Vfj+*l0<_7>Min56Wox`
z!Pt*u(d1Zm%N;P`iocK{wV+zH3=Nm01zry7U~f|lk%f>y`Xm9N@8_+3El{d9(J&st
zTsS{gxOy?NrUjjkGkRMiCeLCcI2&@wZPyy~YY{`W`}qb4oR4GBFb8BAq-Wr|yylB#
z!aiXH<*@F7FJ!V3tNw+eBm9^gil#xkFiz04O<2HCT98vdRv&Ert)q)X?iu-I8G~lp
zagC}4)vBS7JiuK8Cd1A+LSndm0O2Hm53o`fS9hdVO;R+7@L<>m9ftAx`@msrNFMXC
z&gEk*D))*u(vk%(V0PuA3mP8oV6fdVxjEn5k=(06gGcD%@nPWPTEDmhqRs%VLk<x!
zq#hHIt;GlC4}sZ0Q<uB2uxgPrKr4FbhK&IT1;6km0}lC{WQv%Pbq=S!eNf{|z6<FC
zSS?#ybPcL+P=ykj7k3`KM)vkabOpc*0)m}vnj|6Ofn!_*BC0qyaH=nHW0WdnsPfNj
zH+lRjtzmK+rm_v1;~b3o5{s5oTnr8@9ArG_aN3Vk^AIRt)=&opYmP||gHnm{<Ts;X
z^SIpIrr)bY!ysRKPFgtlik`!Hg~Ql`m_H^Iv6^mjtddqo32^xOUmTQadJZU<t81gY
zL6ev4`uQY=_UK;abp<pL78no}6fD<*fP;=-Zh=rsz2Foc;j4f-Nv80ourkB9dO$-p
zUlMLGLGHZMqNVB42uV;t^L@vF)@WZP23^Rem&*_Oi1Q*<OY~?|G=Xxd2eV2hSdbVm
zo}VR2`*A9aIx(hR{x<{?<_>_!9S!*b0-+0=r<T}{W6{9S+dII*rF?M*(C;<7fZ|X^
zCDwPdyU{v;qV#Y!fgRZSlAM081`P?EnIEvgc^}W+z?$k_8*D>L7-Y$42e6fu4%hgC
zD7s-P+c~F@wTy!{3b~r`8YQ+$%N+nhp`e`wQ=KkG4K>xhMvMXs6_Wswc32au@-@N{
zw8qKb21DS_(bB_DS}@5`4bSxrt)AE4+M|2*UlA!2I6>%atFu%PdS?Q(E)Y(H3o=w?
zuR!zgX-7}KlbCjiOR_|>9{z@y0(uj3WqJ<4Tp4Ema6BqynQPQA)y1KI7kZF(eoSWd
z9I#-y*cqTJTDq7i-!i?BWM#mG4vuCp#EWK4wlN<!!V^Dd_Iw<m74<?|z+5hNO<FWC
zH0NkuzZ+!h=%<#LQNlTsc3?sjniP<8V|>&_gjdvu-hySn&d0H6DPJ&#MRObw*sxtH
z3F=Q%%Wq?ZCdT824lB=e@gkYy3^W&mBs%b)T=KUuqyvRT35KS7-3eS~+JTu~@Ua3j
z=*&z)OcF1c{aO6@uZuh2(Y>x<-kM7NSkYX&K_g!hQ0{_mCBvO7+T>JrM8`}ocydTq
za(*fo<x9{V2B}(;ZzR8SH57?*FH|=~QSu8f(5ByO36K!`j86HOZP4Y0_p+=W%s))$
z-3V>^y?*8_7I+w@WggXo=H+i8FSy2w$Xs==L7v0hvYf`uf^O(g<N-c~kkDx;;mHL%
zQ`LvwfeXQ8KG?$hy5<4hV@75K>+Ib{Jz)C1x`6RXV-Btn5{~3FNYI5sAPPK)&X2Q2
z`n`gaLAwpc$t7=RlM5OKP2!UxM{f1FAE#C2OWe>Hfyd}5(^~Jb^0|$W>ic>VD_8O*
z7R@caeG43BQeD8+=eMB|VdzjJye`e|_L7jm)<KpIQoDY$0h<0cMBQMrB*{T?vFImp
z${;2SNQp0e3>*Dk8)Q`IV3IxTopFKzaZ^CsNZi*(7yB{T^m{dESm#SmriDX2=N!(f
zasYI)+}fD=oNcWG!Rzn^kX#D`j?cx>O?9s;nw%GlUyy-=EzSAe-N={V5-Sm=#<)1$
z(z^Rtk6|*qToo5#P*cLhqR9uc+uMSLa<RP|=i^8OAO}}OVh9&j6P7sH(GotRLlpGP
zdCb-3e4L2}H?Soxv2gM~&m;3jeMu@UAv=?t5DrVlZh?sHorWng6vW5+$<|b0V$iw^
z)oyPK27SRf*z_-f!P&4P#hAlt^KO?CY;GiS%^8)><2TvqUt+*eK3%?>K}$E)b=AG1
z4F-+kunoz$1gyRUCg&CNY%p2iCZ6o7RkL8Bf2#=_w9+rm$?5kBAKvE1tXK?9U2NQ(
z{5_x^hNkgKhD5{Hi3ZJenk@DL)@RSh3E0%Vrs0SsSB_++w!PKMTb2NGH0}C)#bQs{
zYr-4?oE8`Z8qDSfTJbnfhS^BFphKtMEBwmk){gK;w>I<`fGAlaM%DOX^mMUErr)c}
zxx%Ww!}!<Ms01!cf&(UKRD~~e3SH|s5tCvtpAzb(=(4$R@Q=|vACOFzb7^RItm7E8
zir~avrUnjvXvbktcb;5Og7;Dl!!xCraXj%$!b`kH+^4eh&wDbvqvZgi)-2!7OH8@U
z5sPEyE}CNyK}a@yT+8o{UPukTh!_T#a#}iM;Pwx{EXdekY~C+^oAE-DXe+r9##P&G
zCuq<Yc2GCC*xT{_*4><Gk>tDdKGfLqzZU8V(%Uf+$Pd@VV?%}RIMiaI$(@;O_&ULm
zGR9-YM|YfQA#p3RM7YCYs!O(LZOD0%n!0-7Vbz_Ew3uK4ZCi`ipGE88JT&i9_c~1B
zp)NuBC@$^|tw6qjx-`_B@%*z<_iDg;YU{kki6+VE#k`KLx>paAMtBWFswtO1wR{Q8
zfMZP<%G2G2!$J4zIpF1Qjxj2Ac(Sj233~tGfg|@og8R%lntCCHBsrmcFqq4PwD@!3
zbn!t>YWS44^ZxGc>4jv`<o~%0b+K>~GMukT&zi6#Q^*7%NJI01)zHg1CZQkb4M~<S
z9J9LDk}xti$>Bkaqh7guH$lTujaHH#FEkjPey`vsVs8bG$2ly1uW?MpK{KW-$csk#
zKK))Xa~D>&7%VSgiHS=9hY{iu#Y@~(FIovZ{ay>k|H(T{!!E)!Hs!D32MntPFF(4U
z8;tkq_X?*A2e!OmIFl(F;lM@}MB-NY=QYRk`KCRvjw2|j7Nr2^>tsTO^aby#>|hs{
z;q!F<;eyt2ELgVH^&blwN^$4kEwCR47!v+h`D3B#UAR}Ysz~A?8()HSck$u0A7=rx
z(|CS-M>}Wed!XllEVv;q48vtL*dkSgwi4wl$W-&WpsNS<92m}H5!1=xhi7XYg68FW
zwvj31=FhYIK6S5{krDD3Ih}JcGp@%Nq5@kM*T-zO^NM$;@D*q^4to|%!(0^mNV+jl
zvZ3O4Ud!)6HS}`of?a|GUqorcEJ>6xhmZx1OczF;JyJuDD6$VAoXl3QJm4gbmeqqi
z_`*KDKe|_sj`8Frn*tRom)SZ;O#UG{L&2$s^Ky4r-RpuTJ8$(unsCt8T-@D}X9?8h
zUUnR$$?zDn`5WqdZTN}=%r-km)3c<E<_Gz5viSX?dmTz06vGp!SByA4M<ZV%8AW;w
z%{wGH=7RHZ+iXw;26+3Q?|`U$iL5&bTS37G*KBniqB*&|GaPB4X7lH6VExg(LPjMg
z@+gfq^i&uQuYO4sIV?&m+GN~$Wu-sD*A>h+J16rST0LhBdt^V3+$ljK6S-B>l2Kt$
z55_Pwd7XavavX!D*^lGl?j%18iS@!M01hN*2ERS{`*S$0<K&JRv16V0)=jk!*2@?X
z8#=<ubW!Z<iFF){=2KdJn}tKS?Kxbeq!BaF(Y6JivIiSb4yGB}!_iEC?itq~-Rl4Y
zF)qRPsN63#D%j5>r<1=69J-H7D?M>;Ux89{c&m8_pBek%s)WgMgv$4nJFcCdTuJBl
zO)v+s;o@Ux(bC0?w4T`8Crev$MM(uZ@)>7+)nr3E@P!5cfpW7bwYLwN2!~-7aLwwg
zezHRJEoo$tJua!h#r7s&f??pWI!f{<I$O;5Uws&6yAX#5_XQV}l`k=1D2}fFB?b-S
z49?NK-fumpDmNv#?7A4y!!j#loQH$?B!-HgUpZNg)ht>I%du?0VEB3grrfKSvwsYd
zfUkWE_Im3OmVw@uU?N>K|MX1i)u3V2&ocMH!cDKd6F6$sI@%HBe+&^xSbkiQgMY|Q
z;Q8+__FGo1+6aO@M&Q8hB`sbNsB)uu9cfO>=f2oIvnC846h&sF9wlYV1!aehh%plg
zgV`>Ao0fzznO<%&IW|yaw7u&C&0)$U3f^#rJV)z~a3IM_l*nAdI61>gUu<Vw?ZZw4
z9oIKAK>MS6{qYShdaL@gXzu3ZdUUT<{>0c|^oo(N@Bm(@R|G2XbwFR!MG*AJUVjWU
z_*Y>JgM-=A!o9);saGc-R>Jm+c(Ukx9J%SnP%_wNK~89I958LUNyILBFec%iqj5lv
z97+<PqO-#XpB5JYbpC{Zo_&}>oqMzN!nj0sn?wp=6XZ{|QdG$#<r2b3lrbYcomXjl
z(YQp83amW2;t*BEML#KMX#Fghn}dAd9E~}SoLLU(1q?p2jZ69$43cEW%My_^A(Z2e
zv|cpF5iq$=V81#FC<~_$BT{1+4n_=-JytaKqGw5#zdm|<GPKdzPKxzkP(ok=U5lVY
z&%2U)<yiu=TKO<?=M)&SXR}J+?=eOr3}W_Nt=TKj5(&P&9Lp}X*sVid{zAWpz{!ac
z;C6Gq0qQ(U4B8{XU>;!LV!3c9>UDY!gds&3&3n<<s-ahH3_g)4!J(t^{3xl$bAV_m
zy4AnL!r=})ha>mu>d+43U7;0v318)=g&d;xI$Sr-4-*=`3R;BvM;501sm)4J-S7cJ
z<G0*<7rhU?vLB}<^g&`gWyQ%ct#j)ax`IFhVLUFR1?Onmk0bF2Ce+9Ahn8xlC;=^w
zwg^xQ5}RE7HumF04B?R|xge0MMjkEys&vefhhZx8sOOn*(|#O)p_LAU7+g2zviOV0
zCmo}qJZ5a9^E%F>dxZ;~gH%6Y>WQ~)RG2>zoE%)B98jP*f03$tUC?BW+uGs+he+vs
zl}z1hfT>hN%bk3l+LkZ~rVbwcaq{L}xG1eq_iEAVI*w<8)nVv%4#t}BXn?N1dC=9a
zSwR<qA4Et<hjGK7qiIdpg25ihMtBwtH{dy1)pIhBK<7gXMk|XL{vQ=1CfXR9a4w?n
zkL-1TNs2h)xRe%89iSCZL1<Y)``^WHn=>sW5{~e~b6|a<jb0^Lbr4_l!8=_f0-ZB0
zKpi8jlF+<ZurbIW2Q=Ve)O#)$IgaXHv*f07amklK1Rh$kx>t;uLkn?0IB_v|y?4$N
z#!2B($gGg8Em}38RfsTP&zjHsgnMTl$6@M0L|aD&F}?^Dkij7g3Zn*nzTdjmaV%IV
zR%gDVq40Q)#<)Zd5V^oGa~(;qUzQ0nIt=X0@G$ik#B$fT#Gs{S?NSynxhgKWpiZrt
ztVCSSa4m<qYqGy>G_^zSfqSQoJ0PCHsaOr`zQUJ9@*K(G><)lAObW2BLu_6yz{tG@
zv>Ab2!n|8MCNO{D^mGYHKE_0yH=Ig5r{t?eYiS+2YvJ+*sQ~U@J92PP$SUzIjoHZN
zIxV2M8)jX=&+XiU7_-#bk^`q^Ip<*wB&YroD@d4((Z3jWEr<8{I7u{-vvw-`T7rcv
z5#AW8XQPFXT*a)phLLIKEIpbqwRk$w8Yt!^5;Ab*VqC1i<%bc1P#MFsQPHS<nIZrQ
z9;8<e|1zIna)MTr5wdWp*%Wob!}yLHJk_i<v_xV?8XU}9Ti|emSJ)Uyrtj<3%cN=z
zUVkICf@m!+9`PBvScGO7#KRSwcKN|w4c#)BsN$ou->z0kgItB&1ZA^}cj?*YhuBN*
zZ}?P57-?hlffrFdE%NTs5pjX%S&l{x3?>^1xm2*)u2B>it}#va%DE^H?HpQaw`hyl
z<Qv?@_!@y@*DyTk<z+(s1Tmb=RAJ*NUv*4tt`~YMfz!5O)POOw9<ypgwQU}N!;Cw~
zJ1d&WE)Fq2;}o30@`w78T(;k?el^rWU}}hdpnBfyCvc2YQicdZUX_b;G~gr3C<)v%
z<TkBbG_%7JQg4J7N*VUlJ``_9uYk1gXaN~c!Bv*i&BxQ)4k#21H6FTpw_HFd<zm{Y
zhjiz{23*iOOMu<w{;^64sN$2dX<r?L2P6fO`=GD)9PUxW4!?UhTuY%+>&>`m4LCG{
zV`7Np<mV=^aPoLke+)Z{5~<gOLGvz8IR6Fm6kddqIyVRoF5rR^8^pu-p^u-aj`f~!
zFkZenGsEopgYkGmtlTlL!1l#K*#^jhSLtr9gutFZi`Ld5B@5iexK0#NpZl(34o}0B
zIY~HNUoM~m5sVzE7(fBZ%_(;;aO@%O6%=qC#c=#j^D+zS(hgM;7-aYxIM#T)T;#Iy
z(lA#07;n-~u7ZyR(T>pJ(`tT-r&S&_EyC!pWC;2fL%9a#4-@V~O^<-@6pfR(N{B8>
z=qD#}L2cD!Ku9DdSc+Y)V7%7zr4n@%*MgSnQVLn%E+{_Ggir8L;V|yUP#(cGp;7&U
z^P60A4o$Go@?D?>jf?;n#=Rz=C;8>R1D>o|2mei1&xtVf3@h{8;B`5gky@)Yn_q`_
z>>-AP9q5HrRnQWtX9Jg<EkCY!;p%pcda8_=4y7Ik^M9@SeQ1Z!;YkGtc1#dDcg7bu
zo+=ZsNtT}HzO!)cYJj=GkyU}uPe3PeuCCQ$%LcuIC~gSm9R{jjz$vQ&R~mS~Vn%r`
ztEGDfbK5bD60hUj@)ix!&%TSW6@eHF+(KQf3E(8*(biQ1#ui<q2vZ<y;9^)B<rX}s
zpD*^EI>Ux9hhZ|Zo9mE3Em1W3b<odHQXOq{7jU#qGH5BUr;3F`&&CB@e1i7W2E&Gv
zIxQok^A{Q)!_Xm*vG6zFE@?($-~!xl?TujZrYz<NZ&rQ6D8(T-3X9Ds#GNIfgeOs<
zbLC>3j^MHGGvOknhlb9yXfdBx;{{E<lN?l!67V6_55**07{J|n#R7`3^FBAl5j2`7
zS-8c9>c@%~E*h@{Po3+NTt=aR;Fd@;r<sySMuH(KFol!LAo%mvLy1#qU2otZV=!^w
zf(JLwi?^v-S&7;)b_qonjQX=iJeY);OG1$lLP388r^O$O2CrvZw6k#SVl=$K=|uAa
zR~&ez%BMra+Fy;hAwwgXFm5EllKKLTBh4$ud&sE|2dKwJV#*s5id~qnjH~zR*G*jt
zMof-r5e`lg_R#G9^RohUix;{}fuk-3{t^;KLJ^o!T+Yl6BLlfHAe2h(+`3iZl&wXX
z2?mIv!A{7qwSJ7jk!(vM2eh-@@cMa@wK%(a!}wfTuGQ4iJnBsn3d+8#34?TRUS@xy
zXiV}<^22(=M516nU5hZ%AJK*6c;^LPQ0E#&8#q{KB>U|Q9wY%5QS_sll@})8CJH8e
zIchc%CdkqvxJ3+&fOGA|yHwfifWyQm%tet%d5u*Z+9m>~2Vr#kO=whRKM%&DB#6&o
zz!~ju1qYEp!U9dMr}LV!z_Fpnpw$?S;m`tyeD`7}Jj&TDp%JEHKo^qH9h>a8%Nb^?
zFfD|B@Z!vTl(RnuTpqH6p^&w<JRiK^P`xMucvDa-da88TbhkJR^1C-SAr14*kwvyK
z(fUG$FK9ef2HdEZBPUq}0Rs=3=r-ml-YgZewFO6*1V1R>p>$zr9B{bM%%C$szVO9u
zUX`syArONUU`HOB9kYWQ0Rojc=v*j0F5tYv)inBi(U2>D@T4=-R|csoaeK?q<KHlF
zDxe*3@*bhb4^{s3MPLL!F*z)uu1c<)n<`;05UGFwng)v8(NJX5*MMeLGzZ86h0^-s
zWvZpUMZ@V~v)2VK=8Jt^^;D5OWDL3Nuucoze!JpOa)M137=fEGv+`5{9CGrEN$0*U
zapu6o2#GL?>K8ZAqoVDy{L&Dbp*K(RVLJ+0(!DGJ7y?6CGdH}x+Q+VNixTI@iq|h%
zmjrL>XfYioz?N2$6FV;zQ+1)(52KjYE++GNH-)sQRAcB4g3TV6rnAxdBKr;VV0&^G
z<-$ivJIrOA<czq5(9lzCu#!<lgI?J|A9Rx>G}<c#G>J5n4D%|btzW|cX4Ht}I4w8K
zLsM^ihfgE1Si(Ga>uX%)^oHp@jJUDOZ%VI?=JtS-+a==~DvJU9g9l>@NcR1?>6hTC
zUIoG!51(YYUZbyzJf<RCcL{E`UKY&75#1<Qv3SA0%>~Xq<MdA9>htT+$|G+Qtqc-N
zJL{2)E(8$AAVMTCI=0z^oxT1z`Dz{(nV3!nzTMskvV<C3!7ww%m#delQ_oS=%46`~
z$CSjZOei3Hf~E<kK{v5O=h$;hCqhVsfz^`rFDnznmocmx^%~c1ZUoiTLKT3Ihkk$p
zd!EHmy!e97x-nuq-&_e@dyp*}YOVH0uy7^b#I>rbg#kpZ0dct;nlUd^Tp<1q5Y8l@
zpsT-tOIn;XXrZ^I-N(Y^i*{B_@zI?CBaP8NSkR5^7PhuS;yY4h2{ZFeg7*k(S2*NB
zCY`is&7B(o3mV;);Ac<}VRku<eOP{7fww}h5)wAaj@+@>6$i<4oeNy<Nxoc#7nb31
z;#cdVLoK=hpR*CQpQ5RE8^%|Z8Zb6V;-fTE68VedA$M{ap4|Do<p;e|<n`syXn=?5
zMz*fX!1LoBb~rKJ<dfccz3*U@1;Z5tMpio?zhXh!AeVt3ZLjAkf>&*=z(r(JaPspQ
zT)Eg14Ll_B;Bl%uUzy%%4amVxS*`>5jnUgtHIhxHgo~-CfT1oIbf$N#0U?BJ@<&Q+
zAX&$1Ow=*%1SV)njvk-RBQfu^vW%SEWByr!Te+W0C4PmWRcTEw-v*lJ0*!^`2`9(Y
zXNcG=WGfz=Y%f}pF=v)*rS`#)O6U%;z|uo9*d+P8VCG^xHv_})9o-0mgBi&Qjme8?
z;s>svW|_x8hMSeC+FE$C#Nic`i}S1BYlp8U*Z_&JV>s_y#8@Q#cm}U7Gqo4E*e)#U
zFox;*b(lC?eHkN8s&zw>xDUPm1>=T`xhsy)sMt4fsKPG87z|#<Jm?F&*#QKh6uQ7h
z+0*2AkXXRLu|h{C5z@^e=Gg*-NkXZFT%dSpYflcMT9g<3Fqpc5%hX{zRCq>)6Kk>6
zP;>|s41tp$9WkomoE7trxE63I{$L1U?@O{QXkeyLYs0*y5RWHY2-=($C|?DCEOLcr
zmuCF(*~vvOH{S4CzK~&i&vAhh4ae|eh+*MSf4+e0?0*OW(jy5UBmr7f0Rb8d=)MPq
zit64u-XpFZa2YiOTz91#eawRfp8#lGZ-REOPP6_CbATiPLvU0OPud$nq6zt$7z8gT
zway(rf>T~)qTvYXORQqy>P`0QRa=YR6~sijg4hQcU|wdBzeq;%F6kI(kc*d@*qDRX
z4OtLA<KrzvM}VjEuo9Is?nYDSgHHMay@-xs6g-_J7z0K`G(=~Z^p!5!h6RnIz6@N)
zL^%8FEMAKj8Vj%5+Wr+A`goCc1u)`PLXT)2K5X!TmE7d!+qH)rwrJjZ{Qp?tVz~Ns
zoc1LFc}7P*`lpi7MT5opyvuRww88it?t?hTeMyK_JO1t?s$4XF^3lAUCUV6l_ZU{5
z;%Q~sp>3sru9Xb4#g(jup;ztsW7c<ZhE3C1^gc+2Dt9@ATXA7)VcX?Ph0T8o7sEOQ
zPhC_T%uL`0iC$%Ee2~B3dN|ryAb5-y?5U5mQ4u(a86<&?m|MQusG!vdB@4OgYm7Is
zN}RJbBu|tuEK3|zYA=>GO2bVNsxCqGH#tJ&Yz>1}!fJqH;0hwn3%IKN2sug!24kHl
zXP7BDwJ(?z6%=Ltn6G*BE*sks;5Ud~3%O-dwc1+X;SPtPoJ7*$+%_IPXL?4XA3+Wd
z1V<jG=Vs$27-S;ylO(}^LeRr)p0sCK(A<zU$aZgWts|rcQ85N5)c)wAPvN|-%mT4y
zf-<JN60C7{`$B-2;1~=Gjh-*!+NAS(3>-RInprCrE%tnIMkn?G!Ri@2VhV8MH)9J0
zt`_vY!<-g_oiFxX(mo)I28w@qmj*6fj2IBOIb|c@Yz(qi<e*B+6kxPP2$V<Y)UHS|
zN^2v0Vo=DIWIyMXX$KryZDCl@(z)k?z_AYq_9ml?qhNN);z280u3|63H?QTJBRXjt
zkVV5Bl!f^=aQR|bE-GkDxMVfTX^Bo#4BED-c>^Pk%U%xEc5cHge=cJcSUpv_J!2ex
zUJLV$vm13u2%Lhua6<5^txaFZ0OSfnO$jnnn<HdsHZxp)Br@_h>15V{g7QbE*77jE
zK}mkiCYwY|H6}2O<)SmxXR6>vW(to{P_rT0C>m}O7&sG<j$Li@tSUIP0M!IrLugj~
zG7DAU26YwC4|_2RQsDAaP;;PvC4zudS5}}k2F!5s#l!|Vq2-LeK`UA<v~ZH9F1?c$
zuUw@hdGabjLb{gWGncD3%syr$AqbVLM*_o=E(DW4lUFfl#rfqnw{X>6XpMZP3JzXO
z4qmA+AZXo+{2)bxK>|odOtLzME2@ICXr)>fXN7CwqSWgjZS5Ei3d#@dehD&q8$1Nu
zN%9vN^Wjs!c$q~<_*gV}&DmdP;rdPIiZAq$tQca0k_*~Xx@|{r&~ibJH?(9IIx%0S
zktAwmt!8+F)Wv~h;6d?#*#`lVstdfC0paq)q=><ZdHeG)%zT*2V;bO%9Ml(PKn4wg
ziT!mJuHN(k`J%H*;bj76(<qlj_GV$iE7>7|0AYq{pBJ}z;jq#LZt3b>@G@FuF7Ud>
znZqDW{!s9z5Kb9l1!oto!=Y;b%vCrH+8=E#(AsG8hBTl>D{T@u*hZCrvCf!`c9D@h
z+S>BvgQPZ+@}rL<Sf_XNjG~q(LDQHFc#|uuwpQSv!Gt(iZUu=SmZ4__hJ+;}+y$+4
zaYR?GEW>wQF3~n7)1}3_OkglI8|-Q<{idE)Sy{Gl7zJkIOoJDYm0aLytO7R)OfQs}
z4@p%q`woWeey{);ezF%QbY-j}OQE-lu|&9K{Ic(WhiMYv+GUkq?7PYg2m=8Uc!vUY
zj9*DHIin?9@-Ve8=aZOFw|)*WizYe3H%@HAg`4IMU(Gyq*>JU?Pr&)O6lH2JC|bg{
zK#qc&?6q;AI^s*zAn}RV7WSN(6(ml9utR?0O`Q2?YcXdBMsJu2fL^<3!%R6qLCKe4
z^?hUf;~Oi>8L8cv%p#|8uw3-O!<4>}1<C)qIK|rZg2O<rh@n1CqF57W`mdocM|;p<
zI&UN$jb3mD4MnGgd9ZL7LsSG#Ye0BS7|r4eEI^x0UeSi#h71;#@E2XZzOe>`vEp*O
zG}zy?nwA<6ymvny)zG|Nbj10lY%QdcnA{sW1`j%$BEVW3^V?HG2gr>mppmVOL*nO0
zKSEpf9q?qk$-8XwBWt+uCh+Q38zp*x#1G~JaIr{JY!uK$EJ>>mU>BbQ?l5?G#I+Vp
zF1u7rACQ5=6#H@o=e71ahG<D#H;Tu-&I=C{qPoK#DNx>po9p$_)_y~42JOcRCppUv
zT%2*OO9A6xhIp`9IZlEDE5r$sN5d}U0#3EH5;-UMR3Oi5b@k{-m~t+upQH{LJ9=@d
zbXDwQ;IUjna(u}SvlXuN1uYP!?syof*Bd&sQ?PI0pd7T{&f>{gcCqjJWNV=_l3gxW
zD7q+@re#nq8Pl&KEYmKo*G{$;he{ttgqRMzj2(f+AF72YGsLU7w$lR}=@jl;6j+;E
zlvE%h5X8jlFzxpoE;u#8HfTfkYNKca7qJB|;QVvFrg8gJbV%nJAUyY-LmvW!?x=p9
z-#<aMwSYtSSr|OPI`&!c68JuhL4gm#g@Q3Sb#21D7`Y!Xu}Go^Q{c*9a7dFZ41*A}
z#2Dwdd2n=Xa_uu((IMgrWy$ZLacyu@MnQ}w*++Ps_S2sZ;g7DcSm`jNTo?r;>$spC
zbOER1ek@wemhoHR&?J2USD%%c5x8cg{E~rpGo&VeL8@Phym(19Q@U_M2x?oq!i8w=
zpC2opyn-7%dcn0Uxnc)F<uI0MxnH4M!~kK;zK%D+O7Ln1XW$@$w!y<hgIno^uU??G
zR(4&0zbOv=T6AX7Q?@{T9V6Jly0nWUI!tlx#Dj%voD)_o9PAP<Qj*{~siQ+z=Z8H(
zgUIf$MrDpR-%%ohms-Bi4hOHJItT}`R1DLvb3sdU0MQW|wY6|L$N}*KTE>hD0rHCi
z=VnNe&;xOCL{nO8(PpRcQ+u^=?Sich)3?@PPsxXYi&?8~8MRd<c!383dZ?eykJFu?
zzO@Dp3JV(=Su~$6bYj8l95IJ18S;?~vxmIQBt#3nWOnE?Q9JBIxWGYT7SE@&)C(tE
zN#VjjGXy<V5Ph{M0WI>^b<m0*;itT0Q04u?r#%E7Dh95>;MAVb2CtTj(X@!dm1&oV
zNM4l3geae*sarr?0wZEbd?6aRNVo!hYb{!grv2{63Wov57jWz@^mPyq9u+g#VlO;S
zfnP={F^#sdo42Xmg$52yTy|wzG}JXN(6k0r5!_)gVZtBWY@FE;qKqQ|&5ZdX5DTmU
z;moY)N``JQtdUql<);s`huqTnOg%8ARNW<vz(Q|6oaVdf_e)=4P;+s3aZSDZ30_oU
zg>Vgyv3?qgS+ow@=!*>K(bi%wmyQO32)%B#e5Py!@MY+mbZ~08pld@^y^2M{{H<l*
zS-9RW)=DI=0$mdf=wrsuYfB|t4z7s$6o`O+<1HSd5-S!CLl`Z?XwZDUS(%Zs3asZq
zW>k4+wbfvj3NB&TKlnQOBW{+8#wrudV?1cI`(VOBK766v3XxuL&=U^h0XQEn!^-{e
z=qN*d-s9D-qid6aE3U6|NhV%}P4UHz5Xq~QUeR|~Mw4ABwoKxNf113;DuLp~9A5eR
zDz9SDYHzkWxx(dibE-Vr+VTb4vW}5yvNf_D*Nh%wNh8q|j+w^sLa`qbE6Wy6?)arM
z)Z%rHS3bg{8@3!`;5y(p-*UB85>(MJ626y@FX9E-bi+1qDV3#uXYf#IxcPQGRoqAz
z9nx}HGK-~h2i=cpmxG?W5dVavr;0_3%S@SXaOLJkNE)j=S1TIFz|2`ehb&YK!3a=9
z;DWk9W2};(CaS&!jFz!Yz3^vDn70D;7)D^<<ahL~ZL!K9C*Ld#Q%if9Crmue=&Hfo
zzYA4Bn7*|JF5@%W+uY(|tic7IR~fcMMh(_RlDd|>%o~m<Vkh`&%KMaH^8zhUV?N<Z
zvvSZM3m!x}7yN1FJRmgkHE`Srk@7ORHsB~94oeQB#&15J&I7V&A+6(GEnM_hzb>m_
zvcZ}FL%1@!Y;7A*ge3z;62mSeT^Mc!)z&U>CEL-|KUO@PsTX*hg6bfLL`4^@N-}ke
zF}FJRKBkEFn>mSaO?ti^L=^aLP;Z2275fR=%`T@&A9kHr>~LmxVTy9gNyI17h(r)(
zg7dJ03^0%_4QcxgCst;AA@O>BZW#@035WFD-%tUnt<CUtg!~QDj#7_H&ob=Pu@7J!
z7j7!cp{N_SL4ym{!uT0DcjaOc3Qv^^Rb7GIaA>oRHNt3!wh|l^yX3a%qSPCTo+=X!
z?qP9>q77ViH?s>vnNA1|>VJm`c(RpEKAF&=HXQIIF^AdZ#UWN`gfP)+%&Wtsfs4go
z3<?QlD)!-0At`@}UABbjB9?$2i6)A8=={BDe+Y$&{fUPBb#=p@a1y0mOo$6*W<Y3D
zOyE_ZwKhAUf8pQ2MLLZsa`hstt;~QdTD246Ryd3Wx`6X6WFwl4l6O>xk*MY}hs6;3
z*D#AOh6`PEP;ITi`8I5D<)T6Oy3Qqmd4T*)U_6m;Cgy}n6<ou7*#?_-iT`q1Y<a;E
z$W<XbCC_x_2u@XS3z{v4{#fD4)tOnT*so{_g*it@hgh~$JNoEhP7hmgNSrR<RIzW-
zBtA&?*IBq6ZcdfTQw4HC3GAvY(FA89%ZZH>4xS(l;~?Wj?X~K$vcTC1tQHMpDM#zd
zDH;{~(3m3L3g{59O6C03@v|^l*GY7g>P6t!RI$IHv6Jbkn;W=RZnyyTt<7H*^8zEL
z=c1Y2Tjj7Hx~5dSgziYWF5om)v1p09h7a>#;hy<-r*M<4^|0WPgi`)*sA<tQ!HFS-
zaRbSbdQ)?1WNQsv&!*J7prH<YgQjlSn5OaxqG6%ZZ0lr(r;L0vgnp<OUZBwpd&0>H
zS--JH1`nL=1)lOMZg9{bGJMOf*ia>7U;-u+jd40RVP+$*GU3p4V7q!3JYR2mmP4a!
zQ@|O8KR6;zF#YWaYrWh_6;`u#O4d%`x|%jwwC?Nj>nz;Ww4<QfTDe1;#OA2rMKp1l
z&d>-0O^k?)=&6U%!v!3BmM2=O(RN!baPG=sGIX5>1aU}`dnQ)6N|<>-X=o6N!w>Tq
z40iM5<~$(6VIX{7s)Z8|<7RG%{m$8iaz>*eN1_8vy`P^>qFR`eNZ=sB1!^`I8iYPa
z7f!e~=hQq=^u((eq<w*>Q^t~)Tq;*M_DOuZIL~3cC+5xcSpAixJ#<bPvvARc<;<LT
zC80WefkzdbM3B&kcv<kRHzQcVFmfL&rY;4^H^YUbBRUnqt!Spw`(uTJ4gUq4r`i>>
zhfvV-Fwt8qj(rCi@R{0%LdgZ3x?wM9(JCxfxOAgeiPYBCiew|gH3PPYi*mRQ6&?=h
z;pcaO#u^Z+cWF!qhVI5XkN^*oVKf6~NF2{km8jZU_{*UaX#B|LiYak5$!vWeb96pU
zhUZ0@_-Jdtp~bXhBo;2Fi!(Ypx?zuqJ-~+qNxH3D$n6wI8$E0bFj3>?>!};Ih0Bz7
zf0E^i)?&IKI-*lIYzbXkNTaI=^P^@uS-xP@2?Z>CGcb(!9L>`W+rSm%I+l5`c<p9Z
zVtll<6(bkmz#fp0fUhy{5^8<9TIIaN?z`v@h$^jJ;IeG!h4C|ZvNtbyoapI<5a9_g
zD@6_(^m&*gGsq@Mvi-;Zt{1$1^wSAp!eRQt5{VhS)Y^qkEPA>&$tSB$J`QHx%eJ$;
ziu@%CZ0d$7%BQA&cD+Wgu1yxLG{1a13x`1v7jWzYk{5;68v*q(l*N;(W0E>7(=m0g
zU2tO2YafvOIk4hD_JfAZMaheTYr@J*NP;dhuIL%7^x=96muC5MEe99BB82RyDSNnK
zr;DW$G*+=_GiQ7h9R{x4R3~E~TbnVQy_GCmp_OjSckrYhmLRBV+~nplOtyByNlv?V
zs4aLmvz+3itwkvw_9_u$5(3Je=F{~QLI!gTQEI%|<&U)X#{xHuGwipUct!Tg)wk0O
zXc(R#vkTzW*9mcOmaVcQ5hvCQ?N1EMfGk{y>#1V!(6M)MMhBfT=DNfoa(s;W77{9$
zL&c-X3bzsltktWP!YN}GF87-3sbcYJzwkARVfFzPgzfO`gjCr^?Hxi`dCih-HFU}h
zsZKh>i|hk3a8P%fY<Z#$BfoHg<{3p7567Pr3kGDh<-U{rAYnjh$E?ze=KUCTdV7Gg
zv4iHp4{^6$nZplpw9sI>{LM~yw6*ms!X!8MR5SF0My?V^TO}IhBGeu?&OcFoYgaf-
ztg@$y!9)Ij^Xuk3AWTk^V>;pgl*Q{CW1bzHJ95nBDkX^=2Lwm-mgN)5VvTOe%`pzF
zpv?lTpTD63qMj;HQ4H&3D9T;3-wwlaWP_G5)uZ-y9vMZRDi8%=tSe?@$5z)ka}>^p
zHITy$vI{)UF2rzEOu!r0Of&wO7}*Be7~ZuRu8kKLP}13j7R@I!py$U5hdby3&OhG{
z-Bf*y0!nEa-i{gBP5$w4`)}^Xi6^SIc7>DgSnQ2p@nA@QfyarcJ;W}jFbdjE4y?(a
z!dkqIwb?PWE?iW&V$zAIM1v(rYG!)-3fFIZ{Gw`W<pOGGZEz^f$Tm+4OC`4t45{D=
zRMU;8e|*HXD_r$v0_%bXO~lQ&Q-2ls>S1!T1bwZ4vpz))3P%|J10i4JTZ#TE7B1Ue
z{$s(zF@DZ{$46TmzGNLhgN+F_soA1T{ensF*aL8yZT^B1Q*G@6Cn?G5pK0*!#-K!M
zYb6wc_jZ%?poLs4^U!icryMNlWHH@jKvP?5;Gk1n6#Ek|LG606GBYd7eR%bu<~fXo
z=i8LyyJ7qpcw<PLFC_FaYhl@<)wE94v~cCd&Lw6}?vNka>lkBRQ^;0fF<hG({vpN-
zxO0U?%yV+bge$Sw>~+C&>88y#PTyKgszsl03zAOOYAR~z+6fq~l+g%Y^Uak&<66Q+
z0StMzIW1@s9bTc$Sj81M+xsE1ur5*92*^o-10j%aYOk>{RxxNfg}m;&30JOe1f#8O
zh#OD|X(=}AR)fn4jv%mi#xZ>{_bX0ut%2({&|J`bz3DrOg;U0I&3>roNB`^c?V#*~
z{}5WqO1L>Ri%uD{XmR19S2$Ul7b~-ntwr-QT<IhF<x95{z%j!XEgvudyE3$lMcG<|
zRxrfIt`q|oy}NLgh=q!Mtj7d8OjfJhwYHh0O8D#1^MU$ZiWf(8QN=!HN~YZ9j0$}j
zd<;!j9DfssI=w_P7Z=df)^-RhP?(XQ=UlY)yE@wTF|aPlN#`!YOloTl8V0#6UA7j^
zl^ZVl(bf*%{+u(EY4XmZ9U3ZOZ3ojX2^mHr=L?BNtm=ks(R@qGzB6zbfqAjbD;4`7
z7>AP*n4`r53l3ii6Wy@gvpjNfMpu>W8#uUO*`d`2Ej>~6DVnO_&_`Qf`O!-$Ru>Ik
zAAZ&F1A*`VO@*sc1-HO;w|0gayy>lZghzjsAj=@3#kNWqWM^bUUf&S#$pwp%>lZ@h
zSk+#|qLplj{U0k_ym2y*l`1$K^)L`03ii}&3Y5nr3P~Iw>}vTU@N24qvuJX5E*a2-
zlXdygMW4bkR&fp5K6n{Rkk_0YOfs~D7=2mf%nUcD3bnNsEq1q@Dhu4r^oQ6Ot28($
z`6e-YinT1wlW1**%EEzEsTZT8V$)c~qV;9A(h7&t>;)Y4DsaAn%VI=<HAH)e<<y7g
zSB11GUkD~+Q@x5s^NU}!g^Os$xQN6WE6am}OA;7i0B|Vw*TF0up6L#RuDiKjn^u-B
zT4`=oVNbXuq2kT2Q(gu0PK#VY(5e(GHA?W+lZ+_CETqMLlOc5SDh4j%mDwtZ#Vc2$
zyUtUkcO=WTjM14b*y#_SDX{46kC05>!0D-C(OQj5r;LS@Uw3hcP2XDh7{lZku8)|R
zVSio2OjMXz7Bj~82u^vG1<ewSKUTQfZmOYOc@-4I;VO|a>N%Jo8dlPhfhF|6hvaV@
zNMa|i0`2wi#gSOqed`PzTtpeg<&rqf?Fdg5`waw@940W~!W0Y3XTrG|O?eopQEv2-
zor-+}7gCQapK0*mM}L9WH6?+uvFx}6>2q)k;Rl<oik`BBg?a83kREC6j|HxIZ)X=S
zc=)vE8zDKb994l`G=#`-BVAUe9F$`o*l4XP7wXfbzO@Tn#-!DSHJW(Y-FQ+Z$2rT0
zjUZ=*s4!dmvJBai?0|;pf63pN)g-5LmMvOpc81zFxPB4%CC3_27^5bJIt|&fwZl#k
z1dKyf4f@QRkEbOdi&i)n^mArfxOSr;NsqR6G`C{B!{EPrUt9{&hKgiaj!Tr)Z{B62
zF51AMKxu!S!Ate#R7p;q5YSbWDmDTJ&t+Sjgc$?oB8QG`a=|YqPa}j0CqE$=W7i)G
z9w?CW8zK40tJH=mmvRO-=u+m#>vBX7b3X?^*_JLCzvRiQ7_=6xD&QO3O`Mq?Z7s&j
zO27wez`?ggTP1O|*HVi7VWC5$eSwzrHn(uT<b@Nnc(ODvR;K6Vj+!yF8Pfx5E=${M
zK#34_iyk0OI?uO~pOZT#oSctoJu@eseBGP-&g-dC;M$Zi92Y|QW*cSv7*x<l^og;X
z7ic_HpvtT;XwH(LM<WNtcWqAgBxVxjKBKfFJXP#tz=@YLY{c%VT21@#uW3Q<UDrdp
zV7^nJVjoqe;XmMqk;Re$q2^prt3lggxQQO<TiYcKK?S77l0qm;_d|{#;n4X2oA!%+
zH+^djTuk5fnG;WL!>eDXQ^w?A29E<ZMVLe9#;F3Anl6hnV%BTF(Eg;rDPtBcq_ost
z4IYLD->jACvEN;B*nKeGjfM*daskQKhg1NgOTvYMF$H?;L+B>Ct9-d$y6Hnj)mZ{f
zc%0+3@%=(%o`O0|Vj5^^Lu`N-w-}I&0g!c!Nsy0yvr_0VxxiJ+Jgj)~uWr@~oe(N0
z9En^di^Xh-d1#ieJjNNyLEy*q^YaQ<it2=5(Q38zyA`h7bmk=0*7~m)i=3LsP6g5W
z)}rrd3=(X$R1BC-=j?EL#I*~Y9LFX(H)vS0>0&m0id4aUXzh+_FEs5l(ClAh6sp8V
z@Hgu>L(NiD6`VywfHvdI6)xWN9i^x>AoN8-Clydq3yV9bL=5PjE)bDm<lqGwYd{7L
zn*D`WF?g7=bc0u^kHO{A{c!NY-~z+e$~yIE1%eDc-n3h!M_jw0Mc>j=Ei`Z`-AsQ-
zkG8hLSg)YF4sOOd2b;W>D*q002M8Gb1#6TZY3+{%?wb?Bf)}p(Uelwk#cHphsPNMy
z`tfB7ChHfZfFPkIQ$|DMxllPh;@TBWqGrR^u5hv$E>4w4TPsObMd2r6AA}N%Edh1;
zdmu(}7zxDl<_ImZm&Cxqi^t{&1`pxG&C67W$tnp)gtG$TlvJ%nhul0dVEzP#%a)rQ
zA<<#d!nq}TUGTEYH)m#|3a*TDZYxQay8rYg2aWtN04c)>8{NeHqKh~sRl()Kv6nI`
zT{MpvajnlVtakA!FJHteX{zARXN#juZg|P6?7Y{EP6VjgF|r_D6lGGT3T~oF{<^MA
z3kN&K3poFrnW%$e?6QNiM9KEdbg%<L-~Mo7y@_g7Tf4#qmzO>ugV$ZZP!6Z*TZ_q9
zqnaI{a5BV-1oY?&^s+e17$9)55$IdHqOIPi2Cmkde!rAiS+1Czlpya3*bVboX<tQx
zS~QHtm@)D8;#kRAS+;1otWF3ET)LQ{mhy~MTn?DlhVclc8eLk2Jf_#tL0sTaeUT$%
z#wrrbV&a#i9B?36T<9?$1hiv-)%jK3BGV1K<oFpLHAWX&H7Gh)Itqma(QUs7qRVu{
zo^Tl?iv4v44;sIVm06Tmfff>4<qVsL&s3awA*6!N@C=c72p5`%R7k8On7G6eQ7i}+
z594MsdeC9S)u!J42#!6=b*Mnm|BaHTonV7PoA2-!m&>qS$f8r3J<Ag=LMd!-bBhPl
zy$d|efIxZ=+FmXMBsw-$ap*@vCo$T3Z}`Q+49LJ?3f>y4OuW`^L<nhWYh@G5F@|xd
z6_LW)8k*#&#Gs9emV|SiSfaMppdrIsx(g?q+!`Opty8$Ef*XfoLbeZK=(1KCn3iGD
zmT=Nttj$UpoPm=+((VL{Hg!QqXkPhDM96@|TsmukRgjT@l1DdVmc@B-Axz&|1BXGR
z3yWj$O1PP-nX1-+3dTIbW7VVS-DIzFyP_2d&K6J%-1z>a${LV?gF@JF(F-1i3tXrW
z)VCHcz!DV6WnDmg+m`J71&fdn;d`Gt2AN*Km1n6KG<cdXnsy5ZkE07XWozZLNIo2f
zkT+*<6&(?MD;=H1(7N96i<N9GG;krKfq!_hFTO@GWJoI^WNFRko0qA275J~qTa<eg
zT<MaVgIGjwzg)V#-$>e1qh3YeFoswDRJ4p(_EhjHLTD7D;-JPZ@H};5Q9@ezv-(J1
zmr%@w+A)a1V-%*l5KN|~4wJGTI&uN@l+Q6Wsx^|tpkrchNY34awM}CciM2e2jYEFq
zT(LyEWbGKl2c@!~Jv2vXj8zOA+PR`#nHEpdm5WoQu?8eBOui(%(9r*B44eU%#&A+h
z3hFmP<<ztWw4k|l9*}{{?#32AHG088b{Zn0zY23s%ht-t1;tiHKUv6ED^soDEL!(&
ziNq`%v;h}z{ekNkSeT-u`T<8)wJ#Iizz`yU9xoq#=3!{0;@TAt24-fdSh(7Ch{zF~
zW<UkkY9AAHB_%F1Bk5mq%H+`pn1(~!#V+r2A}ZlLthdbky9H13yc>B;r($1Tq~ucp
zW#wV*|JT`wia~sz|3anvCd}-r*q>-{b=K*>kLp`)h|hmj%mBaG2%R4Leh8&97DSUB
zZAB004`|L;{53FJ^kS)~$3Et%$r^W`F%NmsMWf5!!@3#G+P>Uu1ZF@<U?hAF=>5!=
z=|CfD1&<WR1c47-b_%B%kR)(H{^O7v<>_Pmx$izx?-~Zx4J+^qIMu75PFTy(N@3<t
zHlHq{L%KI~tw?Ct&bi_2s8=y?u6<K<7(B@kF6JX-=XIa^?qT#QYa*6v-PtfaSC-?j
zcJ{IlE|TT!R0U_zdbKVV-{A5U9Oo>{;pGrZVmbJ-d_4J>9t{L>h$$}=9ogxeWsBx=
zTlbxTlSBRH*X5_eg*g(a(WB5SN##5;Wfdi)&&Z?eFkQVsD_Y?qoW~HnI!Dw0Sn(tv
zJ3pecV+{ypP)Px@M7o%GGOu&UV^A+I@_&a<-1(`JotA(sTJPnX8b{&c&=p?5b&WGo
zbs0G^j9r?k^-A!7wUaOlMMAW21NVq)6Xqinn0dP~5Yjpm2plFCCMU;A1Os}`8s$e@
zi-Rg*Bz4A+rEHDUJ?4!|T8oe!Kk|al%<5aaz=5J#r`b+C3AHcE7THs;A_oi{({sUB
z^2@j*%s+{_qJbaMyK@VY>{YK~(aN`}ng$L{vFG<)_UbShGYa+S;74rRXPoK3&;Zm&
zmh9`*?Dp*GFiE(KJ|H`1+2T3K11`=?&z@yWTY$<3-6ApPCBKuStx6n^pAE~C3pnjr
zUeM~d?A5?w(&Yu5)_{CN9Oj)|qH<I%Ez9!7Iy(AMRzpkDIa**1$iT@`FG~%`;=y?Q
z0*|pu1Tlb-g0g6uHH@xfI4eBB5f;gzez7#ebV8VDwXU927ETuD#kULWE|kA_bTGRH
z^JRz1pwBkrJV{WOV5{8xJZ&$WaLr*zf;poN8f-!@&di{C704f8#1n?Af3n-IAxWvF
z<UCsDE@G8Hy^2Iz5E;mM*)TqLIWy(Q4u|TYhbR}ESPnc@&`Mjf<aqMta_Uw|1&L@v
zub<=&Fa$n7qJy3)7OfTQG`(j$oA3Mo|E?BA(Q1uSRIS>Z+Iz&_YS*5z_pDmAYs84X
zVpBqFYE+4uv163lgj$L1pU?O4``^m*MjltLoaZ%;^LQQS@oH%L0r~~Pyh`qA`8LyE
z!D*%X<5x_9p2cKxLgPp6`%iBUuaIT#T<g`5$Czh=Two^ID{B&?u;!LWcu1-MOYc7I
z9s3cJ=0|cn;)48l*5h7b87<NjAFhbq3~;F=jB|Ewosxfl-v7q%B!xl9>kSeVw}LY1
z|31$baEhZT@HUddMJ=HrHJU@zVp%3t=xyB0<Lj=MLk*Cg<!yqJ7CgXGwrS|23ZWug
z;GVI?x^>T|B(E82?UXUVCnO(P#bP;51!Y`pOtAM)gK*Cn#ktSV%+##%-vLiHT}2x_
z>@Mn}TieQ*>hR9#Ml@`%@A$15^;H=zhjWtSSOZcz=K4o`|6;f7a+whH{Y(hGcXWAi
zIpQK$L9cIGg=}Zqjs5(*d3N`E2KQutqBFrfAD>N<0IS7`2&>QZ2rccE6qA$WTQXA<
zR&iIe$@)Ad3Bny8d(FIMtMzNlDqzEI=PWwXTQd*(tg*utZ*kA@!uU<=B-Nu|f+I*Z
zIAz*h9@bz^HvRLUW~#-XNlfr#Y`{w0)*{yIOV&d@r($6*qZO{aKy%XT_UD7W>xOT$
zs%951N$tZJ)|XhEzbhtTGmZBEisA6l+C@9}^^MhG3)yl?#aYZkn(QP?iA@OZ<<7og
z3n^02xR#!6Kdj6g(q{(9IQ}$z!L$=QbSF&izL>9f^!m!>wm`uROK?lLb#y^uwHbC2
z$>(IU+5Dlm{r@p#tJqM-N3Bp6!x`)D8h>2bSD4*@JPA6Z#Aw;q;sBqrWXUdKyB?H3
zhp9eFx9E#o6MV5#+ZZn^pa@mw6<wG4WjUB*tVM3T>-C5{?jKn*v9KXPN4L&u<T>Bi
zAN%ru+BqINUU_Ymo}2})r@5B%g&=}aibEeCy8#j;iwu=}`kzx`Y^kzG<1l-DOMp;D
zrP2^R@m*An5qGq4sLT4n0ukpqQOHxNBSKE5XE@yW!-&nNy-x)bPT619wY~aFhS6wS
z_%6uv=cBP-ngPI&MAij0`(Et1B-2%^+wa$jEodJ)$w_QM8i_Y$x9bzJ<S=W-qP~*v
z@<of|4l&#OS|Gf$@u-t6-mT_=yvg?_UABx~lOz7!ZAVxECvNUbQeqgV2gBNB+!lXD
z>%hF)bagQSbawKTe3FLClzzTcO(gc?`ai$O?RZmMrkCRvxdmHh_IOOZHt=s|GGj|0
zhi4NC7zrY_+|pWn(lrfPuq7yu%dxfG>$X}Jw_@1KxAzTR^l*&Y3!{Q=vY}$GKE-Fm
z#T$xg+6K6kf3laGmN&JZ)R}8)^T2m9=<)EU67D<Au<zf^e&WH-WqjW~QW>b3AK5Sb
z;qVxqjh~~NGDUGlCdUx<Cak;&J%+$2XeYhet&jM+5>apko6aYZX<A=Yx*e<GGjk?_
zt`eR6TxO?~<Mr+1aIc706;>4$X1|jr`Tji%b+MxAm`RAhZEtFFoyxp*iym06CBiEF
zY3W8AJm(e7eAaUcQw!ADO5DW^f=rZq=Km8xBb^q~x~U}&#}X_nmX=sNxfUemi}DiZ
zBB#QIR3udQeN}wj(B{}gudFx3ck35nR{ayEeN*Jto0yO6DnZ)LE@S82*A36++6Mf^
z2X<cvoIK}|BqZx6r#E>9o2zk@O<TInnem7p(!*WhE4K<D>v}%jWC(wLV%`2ZsdIN^
zTqA}2@%)AuX0%9F%}*!83H+!yZH^E4=&!fASpW$k74vs@k!DpJJi&Ed7if5e=X<Lt
ze(cjcROYma$$(_C*+_J%_VpVv6*IaV4y9>x1#5HUXBHFXE8mkZP!BE(A4>a+I<9{O
z9KN?syw{DlPQUU-pU&^Uid8t1OFpY~p=`qof8+h=wP2j18-Ln(!B*54+(YXZ%$MKy
z4K_<u-}epCnRH(HEkW}>1tg7-JO1;C*`W#|Z{vk)hz#v5SK^4VmKYMyO!_e4H}g1+
zv^uln7QPl>yU~cKnTV^zMf8{v^1f1Y+A5j)x$FV!6F)C`B;lXWj~6C?WJEOtkK1yM
zAX<^F0t_V|w5%MSj<ea|aR;k@Y9@8uxX5MTX-5z|f~6U2erop=m(%c8u(4CU{PI^2
z=GWIuS)uuqf*7rjzBm4Js)(nbH^0Q;HcsgENTYj&XI5KOG1Zxb!4FMI`{(Br3G#;l
za<HXDwlpXLV&Or+Rr&f0@$Y25WO()*YO-2y^QqVALyv4JWnM%L!frF&L!;~M!;bZW
zf~WrB=nWy@RB@zw(?js=1)S1V?D4z)<QI~ZLqtETtk+8VZU&FUiSQ>rW2*}1T@-|j
z_&ceC>tHiP47E|6nqH2V7ppU43Dol>678>eU3||OUqQ!kN#e;Dzg-?Dz`b;UTmdk4
zmtxUf9VQ`I9sg_E^-n!kab`TKnp;zI+>R}cBc?X^kF$7Gs!MuWp1T#FM>>6__bnS4
zD}7`A0$XZRpg|dZxB)V1bR4@XPyVzn^TzzgPvc&W_od3`&erE`R!N(OF9r*6t{ImV
zI~4<)Th=DQ*brhpq__Pu9S{hLB)kp!RkVvoiZigGqR!ySo%iwVPb2qae9tHWzND4#
z;^vpwk0|T4!0Vc~yz$I$o74XY8xN7<{djMZLH1h(&iLU1``Z_}*cWE{!mfk}PYR4e
z?y-*<sWO4!#i9VG!s6wZ$V6K6B&;i0o%wove#WKE&zk#pkJ+)y_0YZ<eVkq#gzBZ@
z3lh2?+1xBUf=W-Lh<ekpf0pRYvqg=(_6^@~zPPq0r3=c+EYu`S{c15n@b6qd_SlUM
zw0&1@yQ;8Z^J;R|U1NVVO~WkN?h=y@scjKANrRu>!I-7T^B<<qh?Qn3*#HFlOSV&9
zA3OKB-r(_@{g`E~2J#L*ef|nA+7jgRiP}aES!`=_I?Cf_bb-~oY@M#%H3nZc%;mNT
zzc)RYdcnGAo6LJ_t}4Tv`IRBnW5W01oe)o|YhBhrYyT0~0Aq0X*cKIW;WX#=XUolP
z#ZZ?6qkc`9xUxSKf;ycK&b(%_Ms0)C-eKq$W|Jj}vXLwM{d1aaR1KPq*h~mh6V-ZJ
zs-ZpN-3nh713+QD*pNU(z)sbcV7Pzw73I*x1|ZD`YB*y<FX?VzVG`3Ckcb}6c;7m_
z&lySC%csVXN_T_DUE1?Wi#&m~2D3e{(@5%)^(0OO^&$~soP$f4zz>;@An$GaT*8hf
zrtV)Vmmm892nyrdYEo!w5&dJ0dT&*(%|*A`tiU6WBJ|Hm{gcmk!^~#xvfd<em9JRy
zNIsQ&va6mvK#MXkmDu<26LaFM*IKrCSZcb&z6lXNEAw9x6E3LbXwrolp!QKT6Glb_
zIP4iD916Q9sv|v}nCipHy-R3GYsNmwJVLf}dg>jE*A%AoOcTu5gPZY-_!jf5oAjSg
zj^?_hsbgsH)8v44vff7m!^|G^&+C8uI(`>#xMniL1*d9fMH(B%w>sy2RU>C6dNngZ
z47m88Lduo8KxpK4TQz!KH%3Q0pADbm<(tZ5$0gAv355|0TOP5PLa<uIXcct?L=juY
zm+NynH5VkfHcU1`UVc8KL9cy-Q};E5q7(#A`qEhGjv_S5bZ_18?TCJ}-q`uw=37jj
z^;frqyTH?e^+GmEY3kR(ozLepYsaFAOq!)oSZhaY_f&JpXC`~cQL7UD($sRH_lhqw
z0qMw!IU-}9z_J$UurH=P`F%B4@kB*13OxUBO*Txoi2EYtZJ!~wQ+IgagMZGFNq^E_
zLa3-fh0u6*b)ba^Pfoh{yF<{H!8?yiLtK$<Rr2hrzVotC!|sJZMP+}gw!T6Wh)qdO
zdki*_(3@{N(lkDGFKOlyMq6!0bwz$rClo*zWb3_tm(!?fWw*E<YQ_I*yRYGjR*sO$
zSM3u6C2F<;0dJCxOy5jf)A;aAxAR}%`)DXpG2T;LZ&e+Z6Sap(wE<);A;rvqNPt+E
zM?YYBHcbP-3FZ+g)|t{Pmv7F%8?li8XQ(3d%rmA?E%Pg;1ljeffE|w{oh<9w@SpX^
ztADU7KK0&Ay%()oA%}zK9Rt1n1pf_m*SuIP_Zn}CmN$y-KIXLO+%Ui<fn6WdEPy`;
zfxCoj2zO6O^9R+_G)wR9Hk7p2Od?z=lPNi)Sz_;}HKdnbseUGCi}Xa`uI52G-FYFx
zF=TDcKJZ~l<~}<G8*;gX1YW4u_^E>T3V8PR<NC%J)5a+_o}}~=dm?4gV@i^+o_Wjm
z{P(MD%FUpu6^s8R3CT&|d0Wo}0#;U@(}GCSUwh|zH`Et>%xAH<uBI~oYCy)zdTO6*
z<eS~>IJ-z=6@4J$t&P=92DS)cd@qQZ7s*iMFMzlYbU|DqKS!$S6e;}_Q;CF8_1xs#
zzt28Py%QYycRDtT7279MUZtS_`zQ2%o<~`5N${mo$H;MKbsDz1ijUKR8z-^lhhWSC
z1wNS|yhx8BN!DDX*DdIfH4&YlO)l121gMR2Z88{Hz)D~gJYxZeFYAllS9^Zr9zz&A
z)q%ixT*-vpxU=jM!4t9TipDM85kIrN9S1?Iz{9<;r%FM5_V>0O*U+h!vs8$Be1qVz
zoXdAvar<Dr_kF+48)`sRAiKyIHVT$r({<}!QGr}Bb@)D|43CzI{!!9ph1I)OPCE4$
zC&QLJx>1_3fXA^@>0_(@6b<Dx<ay362+DI@`Kw6lP(dYmgC@{_jgp&HUwOF+3Cu6B
z%RBB^>|J`Q=&hX7(?S+U{LAE3P&Kf%lIn)pUBJ4q)W@^$a;kN%WCYOB_KVZwE{5i)
z+9=|qeEq)uNq@D|*U{`}d4II8U%&P6?)2NoCV@<tvTocqgxZhXs+mI3oWTIqx23yN
zSgFkm=b3@e=mLs2zfDF!ax`kR_;O31FCdJXg>Joy(k!}xE;&RrKC=7ypQm4BUuHv-
zk79$ye;6q9e0b*Qj&1Gb(IMWt`4qR?g`3z4*q(Z7xKsF}fuXMou;KTNv`V=5Y(U+(
zMCzf@ut$c7dX~EFBetVN{!flQ>s%vjWb!GB%$DL&fmK-CV7&Y<_MxP|zGkjn`;O7y
z|7_WPt%!J>>fOU%qxVxvZ2hgkXA>_ziK=Y3$Hpwx3%f<)z2ViR)@wh=FBv!;wg-vo
z&4y)buIIL2u*(-k_qC^l=G;pNYO482&ZRDY7vX_AeRP@RHACEs5#b|ui9TE`@ML#<
zh$#=u?i~N9=(fs2gU4(%VkB16#Ohc;aYMn)m265x_au2o2WS8UKJ+Uv2Mnm)6Q5jf
zTzwTHCt`2<H>I&-J~(@zqW_q+Di7Khsd#p8UF{v(+_FWqvO=cEi18TnHO)JemptYm
z;qw>J=$4vZqUXq47D}Lj{ci+JLdszjQu%3#i6r%OO<M+V-jC5sE6SV@BEcbc3b*l@
z;AF?hEW{Y`xuc66hy2&&j!oLeSMEa|fxi`omhnHxy({jLb(sOa{_xD$yz;-uST;$@
z0CSsCD<fl?u<udIEcuBGjJ!`l*{v60@=Ei{W(Ul=N)!a4kSAPW`KiPe!S6k7kx#y_
zQF@p>hLce}QHe379%!d5c#I17`XX<C#0}<h{zNeRgV|_~J+3bjy86=u+x2FX9L5sJ
z9~Nm=F*hQy;r<^|hAO_?tH5Kn==C?n1i!As6n7619iRUjhIxmt#B0Qvt7p$gE!*YX
zSRdS;@T1-x>0zyt>-}1<sb6>TF&yA%X^}r2w$eyC*H7MaI*d2o#Let_KjO2vMVYGe
zr^@;dwMp=UbA0hjEw416b#m=UP4{2q2u8@cy=ec^vn8x&_vIH&r9@i~N;rgCw0or=
zfR&(DzGU&T9pX%IP$uP!f2iT5IJcRvs{R}m_JN=;ZCT^rY`0AAV;zFnFjI&BefO`%
zN{Nzhc7|F#V|Y67^GN+lNar&L&nxGqc&3iAo$H^}d%RBTU{uvL-wCgbCds%rYZUca
zA{{vI$D>k8yGC2_tS6cV<X#d1;pMppLe5sNSNMq0h2I|t>>1yZ$<N!qArx(nu-tr_
z>I(GZ>f{UP^QA|cad>9WhTId;cUn9F>nxg-1QHm1ksSbP#wik&V=Hbv#nf3u)tJV=
zOf-xR6?BC6WtEo5Q$q`;qlX$;sMX1c6^mSFJ`kD3iF7oB&-K}Mzsghc+5cx6SNK54
z+eS0TRB69<csi)}^M^s}dqSfwuYt?ivaWcAX2~yKI9`VdCOiT}Yp5j92ZKBq@ay8b
z;(s16j0sneYt|2}b-%bD=*3@JyWeYgxW0XOz<%6LJY17LT(>@47+vWx^W70Wm^`4@
z?$P1*qv6*(z5ABxhBM**Ui~r&H*4K<M)$$rK0*x7ynCc~F53Hdz*6(V6VVgi1O84w
zU1r@260Xf|lINWlB(kI?)~|or46HoXie9ng52us!eL}h?@O}UCLVoK^TVc!RmRLS8
zEGG|=yHhPid1;2&fp51%dO5=iXf&t;Y9X{{^S{!h49^>B!Qm8eDh)mhLiEI?>0D3n
z_<=W|P;J6{3{`-LPAi;WTsafol1b^r_buNnA{Ca(_9K;2vrAN^qwhb!kAi!jeVW66
zN$-07=Sc6;VdV0@c6?os_rBWgfu>OCWgY^bh<^EA$z1R#utvUDjBYSxMWS+a2sf1X
ztPd47@B6nP()#;Fp)WMJN_IYJ^xAB4$M0BB;(*0tMW%wUK&{h=x<smC6fZtu!n;$1
zy1?M&%Gn8&oBH?;&2wD~wi3KD7P`Np@VY;y3o+C<4YG|bGMz&8SXEwsT953YTtU;o
z+?7pdOYQSKbMbFlp>_LK0wnEYPRHjN)g3>&rP@MkrVb)C=%0mnw61PI-K?iB<_diy
z?T^R2bqa$moV_PHWRd9Y_H*EI3fBW?UQcipUpVsCX5t_n*=o{*QgrQ`h)gp(q^n&M
zW<(cBwVBqO7>lw=kdkODeDu6oTexU1nb^y3yNlj47U{9;J}%5MX(bX046WbA4l{B?
zvS!;`?{Z?|I^+&`o>3w-e=ge12b<DUUHf+_#U~hu`E-vrOvz4qv{7H?ufMe#j*iaK
z|AhH8i|>2P`U}4`d=~QJ@q~zEe=+@{#KMJafqPI)7H~7uca}F}Ujhj0)0ndx_*8w?
zyr?8%tVMH_fOf5HGOzeQG(2wy%G}h_n3qd9%PrpbILv0$PcZjnp(YR?KR9RisZ^sh
zk82w}X5L3e=p$)YuZ;Pno^(fD;P;cco&AB@#v^vf3XzW}%=tPvHjm~aS&mj6r^rh?
z<>+S8Sx^>Efrjc<8yQ01!WOTY_tTTKhI((uS9!n^d+fjtOeeC3w!7E|B)oFHg6dJ4
zx&h4RJ}7twcmxwrb{AIvjilysb6+nx`M!FcMD*(?s%9!6dtS;Ynd!LGHN_#Rpdtv=
z|IhdAO$xQ7=EYHr=fSq<SSb}($7Pq^?c7)-Seehnhi^C1RH3`nM*#h=7TkqDGoS=L
z+C6XN$}128Z)63U9wtx2p-SGBfyV!%F4K85)cO?dRXy=#YGTy~a|DQn+$Q$>Hq7&&
zhqh&z9nW_z{#^c{&}m@#g<Bmpi9U1-5)$RsW{!e6_#>XMpPt%1Z9$%K9e8&I2O1s1
zLW1Yirk+ey)bi~Ko4OlduQBb&X)ftWpPvfm#X&SMl;^^EBA`R=Lf94gw>2HXxOee}
z511?FZ_aP*K45X)&b11))}7+1oXOMjB%->Iy^Dh5%Jo2l{}~GyuQ_hje|2kh>|j~B
zR^{+lJnu9>_|8TFNceD<+-~bfS=9Z$8qfP3`?F|)>)A#TFg_)R)3QbIv?`FsI-r6`
znY2nX4L{fxQ^rl(oi7&1?3%WcF5$+Kd$O!$cf;2GH$q@9apwy=(tR&~Roj^F%$q7J
zi?Yl(qh7orLSr%P#qsdD(|L^VHNg!mHOU{W#8%8lvA;6{bo`sYtpm>c^km2~jIruM
z^CjC@Y{-6my8{7;8QWBJzP1?{7N~nArJ-#zt<Ua0!gidawpYL{5w=tSo+ID9pknZk
zrSA$pHI^+*Cz)^OUdm#e;4r=w-5*L{=jrv{4s80FUO28Ze{;XWPrmbF5ce2!Y?vcW
zjMubX)f9(5Hms5+#&5E(Zc0E8O3Tw}&`G|Y?Xvp`640a$BrzS{8R6p6oNGJbJh^tm
zbS8Fr{>3_My0yBi<oq4^>5?ZALg1&B_Go6Us`%7HdqMK5wwSb(e|HKXc2qc%CT}wm
zVfGpM02I2NI(QG=Xq6TON!nBA7@s2P5pX)Kn7l0Cz$)53LhI>)(T+nR4miE^-t32K
z!KrGb{xnDQEz`$B<w&WHgy&sN!#1wS9luZQHoY+!igYg*q_mp;G+N5T-{ITUck*um
z!<X3;-mrSsnFS*0TU8mA?~0<o-LxqLZdR^A$vo*ZnYfDqO#*AHVH)LW&^d{;)$>zj
z*9JW1^vL?6p^owUWj$fh-D{`XgToZb^7I{@npEpGL*uULk+ZVd$!7N&PK!NTx*&Se
z%*H;nqTyD0;BM%$wUpM;LsLhP3ix1g731GR22U+(r$dE?8|)lgJx}-&N{`q+*3q8-
zM7lnCBx^2i?*Fyt&2g*Oe+?O4yQ*vl_$OfvPlvmHWDxE>BZ0A{8d-?$9y#at^$9bd
z!a4Cnp_1RmmgM(O0k-AC_NW&^iJH_M;&mj=T&;&7Gq-E|U$=kPu0X0htXuC*bm)9c
zy-%Xqx(c2|OYG96I%UUvmEFt8`eDAe^}0=<?5Qcvc)A5zOC}fOw4@dxab?#a<X;X(
zo4jp!;%&XLBgh^KaLusN%yF$$>gO4G#b!^2ku^T=n#B$D`pt9{3CRttd3LJG|56~m
z)+3CE^JI-zV1#g|)jy7G%(jL}dr~IAl=BocZ?uz69pXN!XHm61h>#H|L6;Ox-6T{*
zuqXiOw^M<JFkNe^?r8MR;byLHtf(Y%^gb^?Q9v&d@@gb=@=R6i%rzFbRjU1`{;KiD
z(oSqlrSZpQvI&bEhd{x-(xenOOoi8k{ATe<Eg>2m8#g^6zg?Vy7wXd~4~nRdW|i<Z
z&?omxu@7y&+d?*eUIZbP0R($Vb?Sf>2kWH7Zx##5&Hw0hYRd9Qx(a5T=s#ii=xiXU
zC@v-1S9sux%1OMjm6zV)t`{FI7I!Nd?3o!}!Qwd^LVPv>8DfE-?}RE7ee#}IvR-}f
z4FaVns~*0Z<HoF4c}?rIm-R1gNn!0Gub~2zWczjr?5uZ-*+c{vP4XiE@q+N)oUJsF
zebjmw&j_)q+C=V8ktQ^9>65lakOfyylkWFAB|I`jx`H;B&Z66-jCD}jQ~j4fe@AWW
zpn~&4^@DVYqlXUamnW4En<j<I7@oKmV#$YTPX43vugO3E4+T0TtLvEz3Iwic)*LZq
z^-Qw`0=G0oHfLoHhFXg;`-BJg7eQq5Gr-F4-;dVnrx6*MEo>QU_v&^PRdz1=+r77{
zggJq6URxb2bi{fizs2>9xP3A@Spk~qbeqOA7<a=4sGMq=gU(v7adlW4osz8kTAO5T
zWE0{q`;@XlXlM63oIR(z8{xX@^SeeFzYhMr*}4t%FS*OT_o|8fxA&-+!ts*9g`s0h
z_qU>D^eoyDz0%|vg%I=~Z;9KX;-Xu@h9kq*j;@hy&#5d99IBqV!BTCs!@$UBHUC0a
z{H=<1(>5>6h@W<t3G}8qwI9YymXU`(d!{?Kh@K{y5k7ddmfbmoswr+WPQeWMh`RO0
zoK6>?s9LGECRIM39ZM1+L<|FEXg4r3wYw|Et%<;|YXZ;`5eMK6M%7wpqVU70O|YV5
zoD)cDxU{Pt!yZ-+DV_7^fT-B@T7YtrP5Sr1Z$WoK<#17f(W)SyEv{gS_ddy+8mc>`
zH@$Ax$*QUdAVIWDqxWy=2)8)ozn794eAA=U*Kzp}>ODJRHc=EK5ixZL2zw40`Dima
zO`C=$(#k4-$Wp$n=fYg%W88_Ec>yv~B(;zBmn9D7*^g<+ZFbo!r-np*8%4M9{nUcF
z{jkzQ_QQwjjD~$?g_T*D3-4y3=Gz{lR?@ChEoJT8#=d)_{nuqyf{1aL9VK>hbV?l|
z`9L*pJm!j>U}8=;*YL75#96oV$4N}D&dA<oL5o1%hgBjQ+4j9nuvDd8H5c$j2AKPT
z6^>GjdY+MorE!#E^z)2@?PPAfjc!t6EV1cA27_x5Ps=L)`V+Re)qo-neQq_2H<;b&
zm_)}^lFU<h;^;@5lww_jLjbqfS(;&H%h894JrpfBPe{yP@N`<@l|e38*14T-GDUR}
zLFpb@&7q~`x`<6p8qgL}%s|^7{M)It`F3l|(MdhpDCm4xY|YJatNitdp=2<xzdvSk
zv)uTlRXe|HO?yO_pxTFsM~VxvxSQp#$Cdn^UfuDjS%6PmZBxFj(Ko}@1iI^%-+MkN
zf->#>Oxtxf?$g;h>RJgH*MTRj-_rfk<>v8Qkx_Zg^$djo)+72E=E1C&Ic#nZ)q1oV
z$r=Z|q2c<v^coY78(Io`qzgc)_T>lxUt}le6Xr7G{c{VUr#w<bo24yti~l=zHZwyV
zO}TgBAoe7bz_)f*-A)|rgtlb>ONzNRm>gu%c(y3ph{M3HP=$?gOfFucit7pTkSi^<
zVC<tR4k$F3pI~n>v7A$T5yP6E;s!?VP1N#y0}mp`-+8$oy;xkT&w{Ac`nq+7ff6B?
z-h(_7=}0A;t&&Jx@&UM~Ya^Gz3s4-1s)0TVa%@`tj-8bDT*9&A-!+;&UR54nk_23T
z(bIkR&Um-hQrE>Am}{$)HtCu={T>2L|E(fGe7Y+8a-(Ofn{h>OSQJ;|?j{qH442b0
zLv?4;U^;RtIR$Z7R$bZ~f$j~JoIXBhdFAUr&~1sT@>-7)=RrFI=)~mBVp>usSc(nd
zFSM~_<Z?#Y?(CnlOk@&V0iS=TBN-hd!1wRDHLQrkpC(m-Y$|BauUvKQzB&lcNoE?v
zK4wZLmKFsOoV!{JX-SVpOLrT$a*ZfWPdW!o0Spf(o-|Fe-ybq@pdE0ygfqk{p)Y(n
zUMHR}Xzv$|Yt8^^)XUVt5<c0OTeP<>OP#S!`G1mbojRquQ?DZZ$J~kt*CZ<=p63?h
z)L0>tG~${IPa=knZs^ujl9~%2$^9us9s_EK4Tv>?W#NIX6J*ZNZ#5P4=aHSPzQiX-
zWw!XYn@0e1`7Vj71%hC8YByWD++>ch<M5Kbh1z|WAgDVeUR62#T3A{2=U4ae2zHu$
z6*gt1kQ*AoRP`BOwZ(z36?V$8%?`bb@0P7)CC1B%_5{Ebp0p`Ww;`#xG*mG_OstZM
z-K%wwYk+1%8J}IY-E<?<Fqx_Bu_DZvt*4FIrIdf#tV2rMF1J-dUtd-1B%?yu$sI@r
zO4pRwuF_Zv&Q)M8|2qT5wI@M(%Np-}D7R0|89@IYTZ=1ReNBBFzU^;a>5upK#!~d|
zLxB+uz`P7=ktkr4y5IAzJ)yZg?k^K0@TK#|zZg<yiOs;PX+P_mECXwkiOb$wO_jQ`
zW;{zlgGFa^#@T7;(_idIVOo0J`K+P?I6LUKI&vN3^$u{c)69oNxXSz@THRcEb^4DE
z+g=4Y-T}~45lT^6cCM#En=+1uqh6OaHyfb$U-TNpE0&ihHDxUo)k$!rWzM~<Y}C9u
zl^;<%Aei}>8hVpYt;5l&=dd2wOFgXaQmyOI65NXe0;4(a^iL~zvbxg{1zQl+`*Y@g
z?I7^hmDt!17}8{Kue#e)ziB=cR&wYwl}uIGf1FC7s!55?E&mtnigPEHE&A;P(zJH!
zdt}_>_Kxm^H?-nZ79Y6$j)?+O3uqIa%pU5NtjbKp(k|&An}jj?FpAI`u-@dfoYI_F
z+bC$%e|YJGU2iiwE1l$IBfF<Zxb~^7&y*J7^(ChW*QpEF)%T{024#`>bvP2_h~N{)
zvRM4?|HBby{TOgR2ioiEJE?j`G2}FU%uMQ#@ugj5JC4)y%Xgo?!nM6;wUQlpz*y3I
zebg;Bo)KyRc_vi8zFM=TzPN1%c)hQh`_9h}<$Y83%y(AT%cc|~)v5*8hKfw!kI|x4
zJIY=O<(`F1&RFr3tHE`kS|S4aGP2mffCY1IPUnsH&vA*LJI<aCK6vvZD;FmD;M5T~
zS()fA0!+dq3v>qlo~CJbw@EA$Y<XwjEp;PY4QM`{oIBkB<hmXx1Dy6N=N(RLHDDK|
zWfHy&XKFMtJzI(Cr!&#60zj(kOaV=}9u#N9?hgVD(}L>-8yY(hc&Wv*Y*n$P<js)=
z1~0RSNkfgJew(fqzyQYkwd(9O7oox7EajEZ(@M@c3<{N#QHZ{{!GR-}+;qdhEaYa=
zfxQ*s{NZQ-hvBOG?4v!_2ZzFD+bv8<p8}C%5)a{GW~i3BZai3aOh4-|*jo2(@9?S%
zAsNhHRX1MjAjn-W<$JH5<0fCO(@c)tu?cv0ldoOM*M9LPlf`Q$sp?7)uvj3sS($sJ
zX|Hk<HlxrkSknoJi|S?)(BT=|chhCD;u%qg>l*oyU#{KdFMSz?efihfo9-nL>a{d{
z7`~lYSy)(wZ;6cWOy{2|F!YQ_cDJL?e6NUdqM+R6H$r<7;3Cdv-%fQ|!d|H(j3SrO
zVY85b#GcfU8=wYD`6aQJ8002YzvP*3p^*R3Kc{e9cI6d^;zGWVrL|7mDyPqN#lTf?
zAJbMPbcoq||L0r|b87KiQ0Q1!1Ex2P<7=)SY7!Qruj?l^Nx}17yK#jTu7TgNQFVL1
zC0O(^NY_st2a`M#=SQcGBhNzLQ+LGTg+NH;XYEMUGK<vJntFDLV|41g5Vzno!D=zP
z(Wgwz72T_!Ps<3cVVnxs!?wFiLyuG5>LO+?4;l_{9;?LdIq8V!#$#Bu*9po%*NY=v
z(qA&b=%Fli|81!cTxAp$l;Al>%%eu#nXV6`zaL-~U-@UcL`KygU}~B1POwiWQi~#S
ztn84*i=PL!YuN>ah(O6@r}|Wk8jLr8ejtCFI<VJvk6I)0AcbD{@<~`HYs+s{Enve%
zBTT3mpsIP+9|~q3*x@=ZC~M%j;WtROfGJKW96J&NLUcXtk$&OK%oUP=fNQtzC(Npv
z4i^TsGvhaP>P&1R`Ljlix(&yzOBo8zV7x1Yu(g^z^A@B+@&3GeVOl$GdQVGjtW95#
z6L3S7KE3yYKYXr@2^FcXTCwN2l|6O*(D5d<I5pZvt~XR(RSR*y5FFYb%n;(t>7l;9
z=+3sDK8?`f_!?RuZyMWCcIY!xVpq5`DfPUhu30w+iX3*2{_RAq_Amq7Y?a$q5GPIM
z@u0rW3QbcNC)HH<fI~Av?KQ<yMs5*b!@|=wL`caV&U@C@Z1ejB1>V2`m{FKOCItP3
zaPF>yS*T8PIC?0;Gdwg6Y{<G<5(`PWxzVd~%KY7_%N2SsoSl(lKhhQ41VF~U%g{s+
zi2gnuI$|09|1qp<6mx&oKk98dI4&(3_-ZvDnZclCV)9~V5X7aC1<HgxcFGYjg3Wv~
zG`Su)4=nxWVrs$4!Iqy<S<2D?tSYO`Xr6DexZ=R9w&qaKQ9nIVK0^6Ho2KoXpBhji
zdu!6By))zLBYNm@tMUXT`IBzu=6a+#ST)ks|Ms*9{hNRT@RvHg29c{jggIDg9S`8I
z-Gd(^4@X-K{&aWr&I4ugB<Ck;b*p-8X`&pwrjsJxIq<p4|5n%S;QO$}8w32Bvm+xX
z*)I5${U+T-lW7L3D__(k$$>qCupas(_10TiLroLFX9#9hxb1g@Sqb;WqF1l9H7KP%
z&spH+7Ng9WRGwpR+d<|EBF!0^RtNF}31IM8btw}@1>yC8UexUfTsb}D^w0=7!Tfu(
z^rElC)n&D#*B0!req(~Za>pi=^UL>)%TOPEA2>is!e{FFQf&{Z;AkfXe+t3d`(Zu)
zC6{<UBI>a4&8cqraF(&(Xf_*2aI9bD<fv<5xqaG{K7|Ivb!{gTprki3=zUP$&aK67
z(q07bAG^P0pc(Vz?a=C4qnA-tuKAOI3b`SmF&=T$SaHs|h`^d}+=s>dK7jVYuCyWk
z_`UFNfs!dl4$Gh|hoGSeBy){|;8-!z{a(rL#YOEofOND8*gK-Cz$#f7I{moA_4SfE
z%TjuAe%%>T9IW3Q0}6E8L+wt~n)&2XxC?eItr4gyVhT<ESPr?^+Lhe-ytWN#Bjp6e
zLB2)poZVBDD1n1=)(*+xuK;>HXSu|xfz@SudIR?8E@0M}9<zoetuS;4*y~!bIz96~
zXeiKB8>~j-rTMpu3;50H51&J+i);J5qP<wa@4a1W(<9&1_K*g9AE0zddlf*5<6))c
zVSB5@kUxmMpoPT}rkh)9CP?7lz<kv-i?(GicW`-$bq@Mk?O_)fCpex-HG(iU$^TTb
z<gO;Yy~kO11l6-{E0=(hO{G4mOLOrJx5383BNObchL{~vq3PfJ7wDywov{p+2~NG^
zC?Kg5L@r44`+2W&g7#a<So`a>QpJoYO{Q?cta?+Li`q9n@2*PQeO9PjcZU8bi_d&W
zb*8Ton(GsMwJuW~>Qi|xP)abaxPbg_TVD9O&x5mnHHI0{A`k7ZwlY~m@Cu?PpL99f
zE?@+oNs8kb{bv9V)>RmBpcWc$ud<tnzujck2z6R9G(FWaoX*Ia14gjwQA)D;ZEGQ+
z$xV*j-eTOY22(lpw0SNch<RHJ?64^41;)!ZMKmq92l?bne+xEIH+Jxg-2JtXHfzkb
zBN`>8v-Dl-e0RRjSSoHQCbUFZs9A~I6;^#CuEyrzXQxm8=@;-(@%ybeAUp8(N2gBa
z1l@5RV~Eo*2o~J*e#>kbqln?>u6e(MCEt7glA1|LaMkZ-0P?|ZwkffD_NsN^n_O$M
z=vWXn&LP9dwK}W47|tPIZ<c07_(WKqv(9u*Ibv@ON?&PG84Y>o>&NaYnk~mA_zN<o
z8O=qY_hC-ErB>e%1Qe>&Cakj*(3HNCd<XSoe)E_k{-&(tn_od4E5h^u*C39b>nYz#
zcyS^jmw5AAh2-^U2s>Q-jGNEqAI!W>G0?$+#rs*on%_D_hi~PylOIhiFvi$%zF0{B
ziu~Xz@Vn%<H@LPoZ6(-$xMb#k*t8NHJlx+H1NH}1*{)d3MB5Noy~|adLur`r&htU7
z>TKqK`0hDaWr3x9ehTK)HrW`7Xb}A5&hstkndc>F=m41V;ZBU|i8n5)Vp*$~gqW-9
zio{f^{9B0q_yjUYjfR{=$kz1TU0W;lz1-<yRXsyfb(_C0k8NQ-A<esk_+TSU$+>s+
zEx7vCLWc`^d7<9ld413RIrEzLcX_^B21}K0>6Im$-uC|~(#!&v3_l>W8549_F1n)i
z_j91)stgxhKsvVOWIx1^^|=44MgITcmzn$fBmMiFal6FJ>rChOa4AGv;v>toCK|<d
z2dz{O`yD_?VEduRwhyge!C+SFO>J>Mf@43n3hAV;D7xGKQozf`-EJoOjbP~e4{gK0
z>hLPDQ(gi5^J6QE2YwZkQOWA-zeWS6BrGuwP;+)}7s=qkt_>YEt>@imKQW)ZDT$*U
zNT|c9o0K)t1C5j90*QMjWlRJ><9NA1f}ZyTlA?|cjoQdqX1J^tA(%51OEdCkPi+30
zEm%hAk=Ct6jRjeSAF$(^JNAtfB;LK6EP3Tq+({G6kG7FX(47Rtjg~C?A|1R`Wm%cI
ziS|xIPb*)YAD#sN*D4oT@}wCSZqyH?%%7e}pQ~7rUFi^ewN=Pkr_~wRA>{kMdGGxu
z-HvGIU2^lDwk{;s#_xs}^tpboA`O6SptUQaF%siLNJ$itfs<au9g&+(nG}-+-2+9#
zoNG)tROO&$#+9yXoxJ4C#m3W|`mkSIsUI_<xS=t!ngOQMoN&3Uy>TVo0Qy{ZVhxrm
zHpNbQRznqegpLBw*xleXztiqHaiiOg!>j4ZAXg#gXbc@owBY$0obr>c9trbd`3VMX
z>Q6_b2*tQvNL2`gz2BYV)BodF1HB<+l97-lQ{#qipqA6-%R+Z+>af=8#S;DILXE1f
zHOz9N*HnQ<m7q(=z>I#uPaooZw15l|vDhwa17Yml)5#Kj!Mfv$qmIMU?D3b5QUEQm
zBxKd{@NG#zkf}6Bh72_FYY+<fv;JH1wky+C7d$L-D%WOQspQtCwVY$mF<zV&Mbyft
z&P=P}Sy39gF6>sVsywlpV#~5|xaw*k6@(7c-r4w@Nms8gi$6pT-f*jV3wq~xL0j|6
z-;Ia|H1{S?1Rm$XbEsD?gpZ%>^=_HyPTy(lh05&yUJvss2Ui(+6XGsR4Q$9<2JI=T
zuYm!h84a#>YYWQ`s)434t!c?~2FQ#*DAPVu12J#{%!#4JUD3~AZ?}IV<KVYCtifP$
zSE(csRq4jzUMU?{BwFv+K-M7bR3uvG*Pzy*s;FnN%0|7YOKy<kSUoDP$Y@$!GM&lD
zZm<r8garEr6083KRsS>g?&<F8Vkg%)lS3zT$%J{UW#C^~V?Il}JTG-iyW4E6R%o7j
ztF*#$6X*aEa|~^DjkvhUsMN);Ysi%R9#%+ZK*GCOu+3CaS5)KmnL+Etc=FPIJ9~~}
zysr>Ju;>CnL9e!kZ+^5-lMamEIk9i}0v2eQuP%7Q+q8s=0&W<MC<;Vi()X8oOmwGy
z{{f|(cs>a2y{UVJ|Lf-JP61M_FBoSvjybzYRX1qg?U(<WeWTsL{@Of%@P#-1z5#Y;
zPDVz=ycD4>KlnZ%8B0&W^>3hj86?k<@?Y!UAbMk}wuQ^<ZA$?E{aX&c0yX2kyQ$n+
z9c{3cH0a&pbVR){)|}N6b#V+<Fw}EsB_lROyL_IVS*%lt1)(|^iRxMs;r1hUd1zH;
z!Q8o9^&41kdi|TcSzg6{r`#w5=3*Mr!7>4ug?_(phu8N^S(-XvU5BO-35CFJX-l1f
zQF-y+i;EeS{#+*+13GYzzLqRg*K2ZpvMK5Eu%<qY);{|+8z!B#HQbcBq{T|NaLN4@
zbFmQ9y73<RMuE+7nlX|*kYrb~#KNi?>U4+MO}$QM{uPij;nZ&4Bpv9Lm~|!5Zr(T}
z3%xQR|1X%Mr&`b_ySss!_RyVSzi6lSwMG?&%g-Rr@%k`etP(j_Qo&BDAud_?GQEeZ
z>~!)RaVE-lfV2rajympD9@Zx;Ht<J=r=(QD<+MD<k41kNF&9?|?_eZ$I95J<D4*af
z8Aj?Fmec-vQ$A3a)4Bz%=4_s)oFTh9xFgaP<p>sR;oQT#?(&+<Ir<vnA^oqMogiOm
zcC&3iD}o1PIJGqIknaK;Vd*Ye{0_`>LHC|j7}_f*+h`4ci!E@abOK4z3yhTr;i>8k
zqj6LzR7#5!+!JrVsLFoh#+5|x&zYA`bC^`jO!qaobsMm+eDFCpFHampO}y>!-2IlL
z`Z^a`C<~YOUbdK>aknI_!Qv8~nia73r{haWeBrdiCHO5nuw>_lQj@u<lU07?Ghcr%
zi>0}a=5f)O4pC8VAV+X@dhFbSS9~Wr0>M<$Vr&=R3F|Y_W9c~gVT)SZLDc|N6-DR}
zP(>d1HDD=CtnO64h8i+-dUvQ;!N&nH?N=yBSZYwMY}Gu0oNT%)OGFz-7JZj=p~=~G
zqUm#S4K^0R&a-riMr$x>354_f84qJ@qTAIpL{PBC9qa44i>7dSV^@iT&>Z~{YFzA@
zxz2=EnLZjN)TnZtxL*`KaUC@knlQl&lq4H4t*)I)jSL*CsB-<chMbUd@+lB3i=To4
zZ1niW4!S=PULo}=*=X`bll|lIVZXHX#K7vxvsJ4=Q$2T8<#e-RE(c`h3C-OHL78lC
zX9P^7dFq?|<0#PzVPLR4%?_29JtyiMEerVjc0e>gNy8iYuSkaywIc-CSv8DARwh6u
z`;5|#kQa144Mh;rBc~dQ9-bmd_`IavTxGoBP=@?4hBhpz+L2jZG%93meg55JCx~9u
z@?5`(?c1?e$=OKjkAGju-(?=E0B^X)*kZ2P7E_nd6;E><HQ(u!)VdM<)rfN>7Y)&+
z<;+L<m(j*rv|NaYl&4L0NC#bwNdhDV%Tt;s)oz58Wd&RQkL>E-_*{w~4&TG|$;57H
z{cOYS*oiclUGfL&VBi%9ry!`-cO16l>_=m~+a3flzZJ%2M~YuRir%B_)gY(tF1}#5
zstH)l6wc+JY6dVPL9OLu5OtpdOec5Aoysy6?O9!C6q^g<kRLj~^?kiJ$M|D&L>=es
z;eYRA3@OAij}Mm;@KyB4uyp=^MADH)S6tnXm707rbm7%H`i;kroqS>nBBQI}wy^z0
zC5K(nvC7lr)q(@KEOf_>h0rZGN@%Odq2!NG?%*AFF}?EJpTfO6ez}t=k$R>T2WZ3d
znK0{;zj?Qvb!^RYEU7mNdeJZx(iN_N@UQ#c;Cq}jnGpv$F|p!7ttJ=ikc<u5k7uv2
z>ZvOJ8kt4hgctU(QJVKBb_e1fJ(kquQ5U5Bv=*@1U`DMlVGJ=-yiow*P375%*?lv8
z*W?+*P_crGdcuaJHY=4Cl$4nbt8-QJs0(v=S<$dvaN>L+p8FwG2$N`}rvyGitwLS4
z>{=&tBaeQ0cMby20HyNHFl;Aa1PocuMlY#ME|Kf4mfu>q;Hb5(w}{Uy-8fYMuV^Aw
z%}CmI%;Luvbse?RSaeMGV*{66Hv=PFY)eH0;^vRS?o}9R#`@HPXu1>Wooq{Kvx27$
zXfS&?i;f}=hPzEkH&GF;f`BxY#)125CRz;}=)wrtZJv`$Y(Xu<5vQGWeQ&DIqD0~4
zaOhJl^X5~Mq_v+Y`2fOF(7vM?ksEzK2cu+e%*tW#;)7<j7!}L+V>^11scIXq>{=iS
zz*Ao4d!d2<rE90lkwgO@=WlLfxGu*jJMA$-#O5Xor3zpb>Z^xVgy%N;*_EY(Kh5tk
zey>aQXD(Zm<K4P-JLsOl>L)~fdAB!cabIkcntH7}xS{bJD9!%=#}$dMj=?_?UB%tn
zIs>0iVLokhbdF7fGP#puaex3AVN`vykEg_|jPqSnTsb3?j(>w&gJa!){r`tQ{)b!s
z4>=$|M9-&(O|9By8`V}~vW}+d9IxeJPo0~i{qgnav*&+V$B<?f96YG18GxCR>2&Y^
zLq*f^|DouUx8FKQk=#G)e>Xc+vGXDcOhp5X+`vi>Ndhlh(bDEsPFM?(pzp4<v0^z+
z`CKMdUzSMi4$^ZVoN+m5L+G+-uXZ##bm{LgLlt!1L=^vB_pK_wyxx-5uO?JZ(V*bj
z;Sa<FFd^SO$BEvNQN>qfi9)>73vv41SfAe=Y3*R-*P-5E#9!r>Qhn}|g9qKzT_Ix6
z9}T$Ic(|0@^*?)?Y?m%=-D#9jtoh~xC?LKZIJn4`X}@{^tuJdfaP&W&3F`DoqTC-v
z&OWi^$*NzM3k__gCf8Y?@LC<MnJxN?6K?ptb^oxQ)3-oi`h!sDLDMX#eB7x?7w+t~
z2(IT8O5(gZzY6KwoOvADh}b#9)tg{g;V>8h_mIX7>l|oS!Dr7y6%^)^7i~4zW?^d;
zh~`MoF9O>`NLEnkcA`m#>%|>NBN<GbBfG^J%F(|M*U{PvHjMqzq|wsZG^2M_uou&*
z(IOt`9NHQ^_QTCoZhy1Nca}o<aVL<t3Lye+Fr26dGJn^~yf&70g|Ey#5=V(`Ul#+A
z_xoj*`2O}Awiqtj*$S6t3ni&NFH%$LUafh@<R>Z}Kl@>Rlc4fUJ5A<9i^5=H4I^+6
ziHW~n7}Qce8bcNOqXpLKFN}ig#pdKV0sW6%m#VTMOxZ8lEDf=V`l||ob-OG!Ee$?T
z2fKztt(VxGHOo;gOJ*ouwS+IEGc7m$7i`eI!Vz4c>6R>xY#Pf))BgVW=2wGjRl4R4
zi658PxaFcQYraHF8n@nZE(Q~MI%CmWse?IcU?QvlxK+P3KfOVj6nTL+?QNgHX3hM`
zW)I_XxIs7Ko%~eOmwp}kN5`(yGjJP^IrS9^Gw~fN_M|=?0bf&h)cH4ibKYr$2gm7=
zs)0zyKvmxU&$enrPvmQ!<EHPH_~*x;hDJL%59bSXXJ=Y|H_}?wq#vpp=*{!*_(j!e
zH+d&A?C^<hZH^Ya-Jp^mxAB6HWJyXZusR8(d|HxnE1Wq<WRw=Q6GxHq5>|}FZIAFD
z71~Oat)(B&9k11q&1UH5w9f|P$j3QXx9xNKA6^l40K6MMkRXxOEuCbu5kfw{tb%X4
zOB95*mhxctx^ah0)j}*AZ5LUpwnmU81Wta~(=d126;L($T&9BY%bK{c^p{z?y&yxZ
zQqW3beP!GwP-WB6b=N}r>rmar&|&Kx5b!QAgYiZ4%dcB$&318{Qx1H-X~I>%#Zg=C
zx11IA1r<^n7FNL|B-MXK{|S-jZ=`b(v8FV|H?;5S7rMS?56qBL5<b-<Z0cTAx*0!v
zFMgF{;C2j~>OEWB*H1!he|IZA{H0|jah*P4wc;l$l}xCKRKAs_7OhP|LIDNk(vN=%
zZ~FX2`=mKs#OJPRyn(l&_Og^Ol5<OgM4x(%QjL^$ZGMGEI3ub5W$QJ0)!LUW!JbOQ
zluF?5bCOPW{6itqM8O8~)GR$Arc0WLrbJw!RxT-NA&p%5v3M|&qOh=JTlai@^7lz+
z>%{bbg&~qqhSsgOh4WuHY|}V`)=@jU5~6zn8He$!0XHMBv{VmkiF<O7a(ODHul|UO
zg}I%zvU2<^-CyOS8Cc2G&Is37V;C38b`R)%pD~FJGS`euZzYOid@f2JNy6$rpGmfq
zs==2bg8D@wsRzLqtqix?&qaI37EH~Jzba+D`!3=gm}cToJ(V85(Ah3wTqn@&;G0=v
z;YP>YvKVUUkb1ba%}}RN^HMVqsT6<8ggovYJwu}_SEq2I$lgx8;JDjT*LOzhJ=tW-
zJm7J7mn5VAMI&qFy6K(clM*u5rNg-_yKJiXhZ%@AY$jI%{_(a#D!PgJc2kFV=&`#W
zYM|bf=&N$=W@61Z%+if{Yjvw~tu3H{-#n<5uw*K_rAZ=s?#Im@Yw5)SLwifekMmXF
z)>kd%CMY-861Px&6RNap@0{3S^#c#aWm_@p@_nutT0C}chUq-tiV5wK%}55=>l^{N
zdS6%>G!+b_UF@@mweJlFc&B~d`5(O>EpVv1kH!=TpH}WO07m%N7CV<zD(h1b6W0nD
zFLSmn+Axau9a(Bk-)i&Z@WKC%)_Be37RGCiCT!F<(K^BvY>R_^CF{&@wdZo_q(JG4
z18P)qOTmO+uY7L}X_zM1PsS4YJ#;SX#8e6lIzChA=2^Fi++`?(xU(bOn!DOt?=qs5
zM@tHcta+p}p)ZBNyyT5pYt@?~sN|5zH4{rsMZ4a;#?8q4xoa<W-3m#fWTz&Xo3l7o
zl(83+<*}ukak7r>p~4cj6{XTdJ1?Ex;h>(UDPNE#BSz;etOQ5N^(eadEpfg5=!y^1
zu@2~|mIAZEca&9V(DG3FjMQ#7^#9m3&PB6foTpuYOQE@5_?OX6*0OPxhZmpLk4qY>
z60h}5>w<t2krD;wfyXPTimNeL9!7s)s5ByFI{6aU;P1a-J?rWXj0@n(BfheZGpsi=
z1M95uM+i2WzIUhtdZBgJKmDPrN8#n&&7vTY;Z^kD-r5AjxDn1X^Wsin;mxtA7J93`
zwD_s`sU$1BXW3UZ0Xk4JmVJr(`>z_ozWFBWq=_kmYT~xu`1NEf!ZPmU_c55JDg#B0
zh9@BUr@jAET`BChaPkcL7^G=lb)&bCPF^?<QhEY3H3>7*a=r7$dj~W%#o`c9s9i6J
z7?_`0XwiJasmJN{GSDUY)~9s6;gD6NxV+;o|L;ir&1)@}I=Aqh0K1=(75M@Qp{eUq
zP>NqrlQJvno05T076~!r@c&2DT?V!Bz5l~+3q{-FP@F<>2~MDRad(OrFHUfGch>;L
zp|})x2rk9l6Wk>@+<gAO@67!uugvc3>}Jkn_Bwm^eGxcmC3&kI@%qPSd39fkAFtP3
zY|S{D&`bbMEo55E(@HXTVTbl;`DR^-&*3_-E|l~fNiJM-R;<P;e=N2tlP%U%ueB-k
zKl(0T(bzl3G%C6BnrRo6wPT@93yzgOe_F1yzw(m8<*JIe2XPbr;TgZE?)#2?5mit;
zZ+FhQ84gn{Q{_HuGa1)MJ>Rby#?MY2U7U6bdggb`8<~sUPS0ceB~TGL9?zm9`ROzn
zqpINghv7NEBvn(iEn&_$9MV~>mmPHrwOWKU9lyW)KlV4-AYEo7eI?Nlc0SRFWe*ab
zNF;hu%4)TlClUR<+j{UNw_neDxpH5CR0=4r<=uMUpf~*>g_KB>&^B{}4ov7Ou%q^l
zf*+>pHq}mLnMkcpPi5;iO-*H~FSM9{_xidn_RTtFXWfS(leQF^Pq_hWoQevPm#yPD
zgIN|5hbvQAecu`x%jn3Fb=;Zm5E3DK@?javReX3xbXS|lZjY;fF*ew^91cDV`*HB;
zso|m5lYO&pS66i&ejz^;ba{*<ueZF+Gm9Q$JmoCtvb@{ogS|O{F&pKYqv~$j&7tTu
zE!*&tH5_1`eQW(Q(vvH4*G)o(tmvt0E>DK6P*g#4@``+6iFz=f?@N#c_v$P%eVw<4
zcYNCF^iOYlk!ACoznod{!GIud4cNZCs37GY&H95mzjxRPdCr%xXY$>GywvlGiQ~iP
z^Ynnd7tlDv>l2fE-H!2L<|mSY2M0t)?QKq@^h-B`@t?46oB;~D#2d<~Gnqiz7!f7P
zQ}O)G<o7x2TzhO8jnQ3ejOc>QxOaMWp6<QS^fa?yjaO@*VduH_{o`HcHj``L^7%t>
z8=zbRh)4AHRk*<7U1i_a9646R1ai4{^&Iir1f%I(sC$$~`2(KVBG15L-M;C}Uc<y6
zXo51GtRvv^h}^Ctex_Oqe~8BVn^(5cl3R*;trWKL^7f_Lw1oBqMELM2^+(RVoe+nf
zK(fA(H>`uBRXNRRE|o%~`E=A4x2WZs+Mx&qEJ%i19-R6n?X|-&RHR+oE!@x7f$3bC
zE7Q{#{nWRX>HH{pl~~uU>d3XU;3ZA2og{eJhd|wvn`X#!8r%KKGx5f)rV|2~{2R39
z=8uzV;D%GXuAQFt1?Ho@$uSH`_fO@BTUC_uGHYgHJB!j^Bbyyuej#aZdkju~+9Be$
zyA2Lif@fMSv~3cQ1*no*Y$Q89ol43HU10DJXa6Z^wG}eC$I4=2DxDT?YKtpyn#uN-
zIjB+A2dWJBm@gx3*Qcrm)SfLicE_YW(PRBG?3wemF<t9e6Bch$!L+elY4BYXM!<>b
zL~+6aJzRdHyB5%?l9zmXUP2l67V^NYIws%LB3d?I-09O0%kH)HO+$ip1nO5u3-Q>P
zrwAdL20klIlRq!jXZ2qGNc!la-dPsV(Prp8PqXD%XWOciJ+VP%JSg(X;;c3{HGqAM
z<I~Slix+eYLu}q6ItKAho_D^$>xsHHlE0kQjpV*1k65LXRTO_H0jG(V!sFjQM{-@W
zEt>E8%h-R!{Kl2>U@xSEQd#J)V7Mo^gdyWTed6)?z-MdG24RvT>K|d}p<(GmP|rhS
zUwUlDQs(|U&tqwd-HM<9Lcm#V_AfJbbUGscc>w~fJ+mGbU3k`iEP2cGp4<j=g=m@I
zc%(nSZdC1R^2xOj3B0RyD{xv@JarPKZG9mNs4@J#+E5#9E$PNPnshoh3ZC1)hP^3#
zZXM6m?c9H+!I<%#cTYUzSzU*U+?`kttI8l->*&Cg<zaH}GIxFg+t^9xF*C*D-tvHO
zU8Uh~D%tqg(``_Yp>_sc<3w&E0A!d}L?d(JcmS2v{XFPicO=DNbNXf<f!8jDbg1B%
znZjFXyftpU_>8-gNetG8e&;>xeL1pK{HzmOFPX(DI{c(x_{J-y;x~D}U_KhOO)KmE
z!ymL9gLZE<bh>f{(_|O8KqvVx&{qBHd|c&l1t1-RlNYoUpKb=&or|6b9rBu}5#TG@
zW=>H$@!T4hcDJiRME*XGzq93gy6nIXJu+n3yy;*bQ~0%2{`<RMwYQpPQVWpaJ?Xok
z<9tr6f&>e*xQDv5x-Z2Oq#T2(O=^p$^mt)WD+X$<BKxPMcwt{{^<Q~+TA(aMt9aKm
zZ}T43nJDoD7JzN*H{$td_$P|35cA%i)uDkGC)b9$kxe@-tYG;bMKkT%6#sHF&BdW5
zVXvfn8C%rv=YW4qo=VJ-Gd57})Nwm+J+aBjw(fpb^O<Wuolax~8cUo^Bd%6aXXGd`
zri8UrSs*fW?WPTjKHI;jmcB91I7t@pU9JKX4Fv+l@=h>R$D^UVB-mObPlT0BZVs18
zN;BU6U+7S?Z$pfC>{d^SVO^0Oo5Mx-wFKhGur6ZRzosz_zW@DuH3g_gpTkw9IVS5h
zW<LWu>(6zKKIFfzy-0x3A&@OVj_O4<^lQQW8E9G>Ew`ugxZX-=D~b-Og3q1=;^akk
zJa~lK6-($cy;sL`xYCYg1OgTm2;)x6oC_ULQ^zQ%SIR6b)k%rh-UXuA8Q4^Hi3ICf
z#1ne@wAC?A{3|>U)z$g21^|f2rpwsT99X}<a4vZ>e{wa>s|qj|dcPqf;TqH6!TYek
zCNL`{({;oc;eWEK`nK?K#DyjZ!|62pI7ivND|K!6H)2!HQ;st6mVtI9La_`{pykfk
z1NCT4!nEfYo84OFh7=N*iWOYs{4mKZI0ezk-;}H(Uo&gGm3q1XbB^%lJ}h&oya-5+
zIVkNtyF?HBPxE_ea7#SdJTNgMyJ0%+-g+a5seR(#50^3s?a=%oQP_nu!1(%_$<6(+
zlp^ji&Bj9Alae{PMR?vABG|Jbhw7LrdEKeo2;L&3lQ*@&pj(>WeE2LJ`CP0s?zn_-
z(t2DcwCa$}L1VvelT%0@@w{-KIjX2e)K<GQ9H71ySxu#7Z~EOV<Z^14NIH;_n4JTh
zDmV{BmOs#vAw8J;uA5!p2+m%g>97^(gR#t|g_97-0^JREqpw823~&w9o*cHtGc`q!
zj?~L9HHu2qZdkTx6<JMn9N-QGSjAf9$Gf@R{W0k_heRx;rdARCP|jV`-LCh(=3qco
z*p$^If{IIEN7po-X#5d1KvbIqdLG&qqV7ZnFfiae8>T%8S@x3)o_ajc4P?cg&l@bm
znWPGE&}bk36&ovZiWBATVV_*>FI>vS58J`mfaFxiiGNBs-L~&dz1`L=h^X9UUFyEc
zr%aF7<a4?iT^+kwHF?J~JA8me=@lK`XD7svi17xdTEIJY3#i(aoH`Yd*iM>Lr5JHn
zs}e<`JWr^fNol~(`vAb*DeI<_l5g{LF+oIjm^CHi11Gft09Q}>=nLZml&<L19H-9d
zWvUBv`ldJBqQ!Urby;7aV^H4;zfVrFWMMb2n9)f#!C%h;f(VI1HL12FBFYLSb_`zu
zYB=imugHRs5^GU6UW_4sMN}poa{ck%(Z6E*Zw@OT^4vysWz{}apWHjh#3AIwxLfNf
z0M5~Q&-T*>)?ioI-E_!g^{$J3mJbIKujA&|X>Ir{d^UOzD>=yp5uR}}A{@`bP)dh-
z#I>rKljpFJZirHK{p3ePo{TW@!N;v^H#Lic*Z%bh)VrIH$s|D1(mnr&kUy)N3`Au!
z=4~iVl+j9R+M1;kZj*M93vVs~vUjI{Ykzc96%BmfXxG3meK%op{P)9sLeca)-S6*c
z0-va5X_2$t(dt~TY6FJ+%la$M6k-94X(T{qz-Y-Xftm`!N(Dca{+8iE7q4iT8KEa*
zs1zYk5@nLnc-<Ly$nP=$iV}PapMN^p(!I7OWa~dshIQp!9rZ3AnysR9<|S+>`ZQcT
zc?L@qprgq<?WS#{X2!74)t`Kfk~6U7gLO^UxBUb_vpr&uJ;h(!2n!uckeO<V%((f@
zF#_z;<li#{%{H7pI}|9tSD=jbe(PDIsP@ha|79_%dj4Jv)`>nMl-|z>V7699Ju643
zhiXY!K9Ds?;oX8+M)(%>74b^n6(?oFu>iw+QW&@_-Wnjd24Otq87^V6U~Eb|D<A<;
zvH$l`_eX%Fkn~v}y{*>7=9$B-V+^$(lH2WWdp*5FT%m{ZSg+7&p?o+Eos&&5+6^Rz
zbrLaH<DApWy@pEe#QY#3BdZ?3Pi@-$kx;ZkX^Eh1Dk&f_#qD_*5M3EAYOm3nCwO}?
zKMO06{#t14<7@ZTv}+Mx7?!qfpdn3Y-;gw`mAQO6SAgsGGkJ7orvV*Ek9@-G85)w|
ztY}}zJCUGh$!n@;M@`+G=rfsKQ2aEMlZ2qi@Et7eu|)nf#E~^E8*@AYXgGZ3Hnrr1
zshv+Ia8d>1jGcMsrq46)A$*P4RD1N4IyD^E4VFFWb$2Y?((j!^aJBU_fex`aSUrDC
z&qJgT8$7NRed4kIQ4_u0dRD<C5-yV<_JHGJN$a5I`6QD8r&VhPSs%;#rS18$o6|XH
zpS&^&$sB<$I&jU0(W>1EHCqDw@I8PNm<cM<HxvqhrDvSGr)U9=72(p~^C<Y^h%;5c
z=#$NQDk%1qQhD8>Gor7lO((g3KSAb*zTI)J-^))TIZZ|g_u07Oy0mUwo3{KPFV-$C
zE!a1|4secovKc9S?IGl_u)f=R1}7oWlImGpo~-Ggxkk>&WV+s51SBJxi?qqRxRQ6$
zQg>^G+9j&4(S8iarxQ|yc$UIxw0}SHN1hfgWF{dNZ?h<-)&rnlVO_ixapu}f1P<8r
z_5#zu$tUU>nZ&pAZR)9~vPQ{LevYD_VcdXox;wiVl>C()Y9jUfOak?J-OA%KBI$iQ
z{a8JY<_3V}*TPPL;z8As_?vWZmHSL%sbV<8>0OW*Y7<KcH)+yM-rg%KSGhm_$AT-@
zj9$4Wq;37HgrsK$$23$;pOr}cgsF8csv@l}-^obo!p^!7xjMfW%FnV%eyXkN=5J~x
z3lYIn%n>#Rf>!dTW)4B>igN@5d1_`flDb@`-Ze}zU%Rxj?VSWx6m6wt{0@D*Kd25Q
zK79OkXV>p`mE%2RkCxbMK48YcJgvW*Nb^!rqF+d8=h_eLL?AC5Hjn-D$RnT?eR!O$
zq#)xrojBXHc4Bc<@WE}%`#UjtW2yj+X%`OZ+Wyuyyk($|EzL<IEl~8PwxEyqKW<Ck
z#3Y5YY_wpS19aS)zwE!uzS}!;@fI;fUM)vGAX+1M!O`oAR!*>FzR3s_qs5g#z%^-2
zJqlBx16wKzG<XiF0x?ysJ_KL?xpgRWq%6WGL_1VJhiMn%L`1yJnf%e|_&kkfYAM=t
zs{iKrn*i(b^vH<Ke8)6G-M98OT^EyX^)Kcj32o4vD^cZeFk$dT0(=S;j1+?FTbNqn
zr?62kUjSul@1vaYS9RWY2KGd{P$;7)Oh(Udq5zis#Q?Y$S@G1r2_hmnffjRv!_(*x
z$lLUD+Aa1DC0%fwbm$FlH#~St1-nhjA!Qdj)lT<~9$ml0X~Yr#SU)+7mr7L;(i20{
zIg!rsQCVuQ`Hp8T8#i6sel|}{2(|q<b!;Y}48QPRdhd1Rod!0)>i&@GIfRFk5k0%~
z3R-%*MVwKJXwGjaA>Y|%SXrE7rhnT$Bt?UxfX6GD(Dy`|ITWPYGA=>~@*OZ^-vpm_
zqi+<}QB30nUkdEpz0`&zqha9Y)?M6hwWYl>z6M8gTK^zLI{2_MKcMk6m@Zwe>BJe$
z?Lj{@q4a$YDt>cj>R-;k8@iZ@Y)e(t)IH`^ziDwgI)SyXb-L!iM6`7S&2&q9ZB7&K
z`eVrKD~Z0FwA>$2ufEcywYE_3Sl*m{cEj4$l-75tb=-uyr<f*)w{g9=TFd>69?kGi
zXU@bi$LxmV6a#GIf%U8ECtI3|1J_k#p>(lZ+_%4+TTc=T<jB1E-nbPVK5+5tb<I{K
z*#VCj1KpSW%J68{?H4qW>Mk~lD0_GE1@5w`BAu8JYi@o`bnF7@-#O38UFI!!8d3M;
z(EG1nT&KF0^N>DRlTsC@{s@o*65ITr#_4c}=oK66ZpLMT>L%jC7qh1ZWdbGnn1C>g
zWkJ%>R}(P-sV$cUQO9HgIj%`hm=!77h4iseNAF75g#bJ)Qyb*hP?Q2`qGNUW*9(jF
zxVWTyYSs5C%a*I-wMNT>kNC?0^Ht!<?W3#1S7PY`p7(o^o%Ti4XuZrWi=DUV=G46-
zM=!f=`Kf#2i)ZW)FTAIF)E>D+uL;Ow1O}hm%bkFP?NT&P5D1+ki`i{<KnFw)96{Kz
z+iu5(^LK-&*g5+CLC|?jEx-yq$F+C*Fv_KhtROU2-d<_f8p3CPZ((-q?7hq-6SQmb
z9onpUQ>7Vx#y=Lze{=Bslz@_>VQ-zX<QSIDe@o&E!LJYqO_L5Zhmj*(`<V(oGpnLx
zC&NF?Af!A!Hp=nfW+|xdKkVtp5G>`!wHA!Ddh*Wfh4u(~eIk{4aM_X*!sXs_+*4Y*
z!7(@OaVHZD%<kDWSrHu0roA}*aG_rb+ea7N=dWmldAIXuvXl(%?r$dDykD1N@ml&S
zHwp6*iAOI!vTjK^8A(Xjbu0L!tYz^+Nj~_smnt|+M)rZ=tw=TpTQO|~cVuTb1MxUv
znFzwxbHE?#TXVH61HKZ23r*8rdE~#AGWsD{X0@A+NSu<eV{aCY#WP-n41{~Q!&135
z@JX8Quo3X-o7Ry1QsUKJ2As4bU6t(`u+og%+hLYMOHdj5fk${@ezewMvwz>3+rDk3
zRwjhFtZuRU++kvh5IkuybrJ+mko`YqhrKf4<L=t|DCvdlxIEvAHJMC`fr|H^o?XN|
z>A4PFL6T_R^$Qa#16%U({;!=!=?l#S+OfTCLsp(<F3-X9`9i>ne%_L)&J{#Xl-)%j
zt@{0wyiyWQ)t|fFuN940zT&*+e=>YyraXwxHH(CX6%#5SL+;z>U1eG>h#7c6dMf<t
z2CUanM$=ymPSNqSRuo;c<D*XWzDGRlk8{Y(wrBsQqg5zXh5b7u_@bq(0M;%ZPM-&e
z)@~6dUy8F;$UV%RZxN<A-mq55J*=Ixul8`6W?b?c=(dhHq0fuijAMC&j#-@0&9~h-
zhhLuN3w3}GtND}9r=2X4CJAFvYRSiSIim5v#Zf7(MZpL9;b>LNm#dy2#be`#5;G4q
zyguGe@0XZlVnwjrpyPR=m}(NSB1!0=_k+r3hS!}zdYlal1U!-K+Y<&UnYQF!c%~3y
zUNoP{RITM;GJ29>(U>i9h|*w0-Rp9$Vo!n$Q4KJ&bK<wv)_=IBkm4%wDbkw+G=f)F
zh)+d7C-}Xx^o4B|$&;v)j#1$$)`EM100T`x<%0itzoyf-ms9%7VjLZxw|lP>dU5{b
z)!kxaI$lfg^wh8W$D`#@G+L7cRTGa?ctTnaYC04*eYLQivM3HG2Z2N#>vF5cU=M%X
zjHW6gjUe_()V;};q~*3_?;jeoN|FzI-RqlCjd}HM8MQ3!vj*Tl5mQ?h!!1`DzBPXs
zWFl2DwCc5=E=;ix8IPc8q-ubwRLFWxLe{fGP9koV5cRhw7+<lVuI#-dCnQopBUf0L
zk?H@atg=#fdnmnh5-7{i$K^7Acuei3B+75qr)q(O2{+2m3v&DP6;3C!5*ZzVy*2US
zL)EFfu9_!N9Ub-ahwiicJfVq``GkZm(9(-#dcjGnL1gXL<id-J-($cq8Qt(Nx5k}D
zgEC6mx$4@M?m_ZKA$_SRE1W|r$H!=j=)NYG&qC}2>nKyduodn(8DsB6bMP~Q5(USI
zI@|sgn;!Hg=d!3_?+QpONkx5=M@BE~b63R1rS6|TN|_<vH6368WScb>=mS0ZYUr44
znf$JWS6nAjL_PdMAS*5pTyiR29`WN_-Or&3xW$4lF8asn&A|n3TXjeN-jV525sIB$
z+}$1T<-bC>c6QIM4DYMGlVAoBy4Ow)0N0p=EyrzE#Kmc=;3QzMP?RSes;w*vR*5zj
zbH8<xvn4Ma3|}FVe9iUdlL?#Hg9N8DopxGn%S$qgqzzp>w@%T4acPd%4WeLZ-aX55
zDZUdwD&w%{^Y;luxXD)S-l%Mqmmp2xfP7`*u+1;a&99FN)qV_y?@D(81s^V~crmw&
zJ0SN+WsDKkM>^$z65O!F)a|2Lxahtzg#ribxW3IpkB_np|2cTDGjoTID%(u~x-RdS
zgo!b|l3sg7AgXwG#@e1mFYEi|3dofB0gX0&C$%i5mwjmYUlw)eiu2dr{ZL#Vj@x2>
z-6}r4?uWX1z66BVyZwVlL5cDhsPIPqAJm0`Fm;QwMWWqarZ{T@J9RRz2B<rYrn};U
z8g<XEJ&5S3?+LxKUP^hY^StQNGogV2Php0Cb?9crUY!O^HFn8K>-*h%4tx1BAN8_<
zKoV9jmrNp#qi1_s_DAfNbI{0t8zTCb0YmU(?N-4hyi?u6o}r+g^=^t-I~k#vNBmzc
zRMzU3I+B-)@l5`}6P9lBo17q$>phS!q9&~KPB~{T@Ql90hP+~3@L>83Q;@6kIR6T~
zn_OAHB%7eRpU_jyNml_+fT}GOj1ne<mn{FRn4&fvkCPKyMY2j>IxE%9-Wdm!$nBZU
zv#e$rC^>VLrnM_KAHh*23%PZ*k|bcY%kxc)TK0TdU)x~^*|C)--R`Q?|Ht6~SNWN-
z4>eE0`n!E{75?LdMi1!i{W*L7Qs34D1eCTFuY?Q8PqWENh64yx7Gt8OBjpX%iQ3{s
zTnoVZUTBQ&XS`q30*e}|{-|ASIEt1a$=l@EYbuPX*@U|^9;=4@`Fcwdbl<j`I-M!F
z`QiOu?v2aYGz}O_>b%qaLX}Vf4srpV9y%ls+m9n<=&d}o=&GZ&HMt`lT6v((B)tRJ
zW_QbcY(umx=;BI0JW9lP5FGmR)lDU%v`$g*NH$zu+Mc^r5hoCijY{|0ui#-H{7-)i
zgQ2(h{YPThldO`A#qHH^3l9F3oSrMxVk)W!N_~&HLrye+mm2ScccQ2|LtFK~jnWG5
z^OUmTU;+&y{{0#P$7Y#2TpL#}8O~E)twJrd<i21eAb=oLWmDhER5dXTZj|&#t?7>g
zBc2an4qrX}EN`ZLm*1b@pf&+zKEnT%&kjC}7=o>N2nJ^_oi%kMHF_2?hpi#GsA1P5
zloVF%4IhZ(j*-X6?R|G$%71$ph{3lZ&4`|fkUyiz@$rycmQN@8N8<=ApPWHwnL?kp
z?}R>@pKD(eoq_GMU#3C$Raru0Nm-HTcra$n@xvMehuqaRNH=K7T4p5ssNTJ|+xbn2
zMEu*~X!(c&gisQP9i#-}Ok8PXro^;ne`rXc0o_BxNo(X8DW*>@-Ac<jOKnJIZ%k~=
zb2jCVR^FrP+M==&l)1j{%$J|{q;+pz@R99C1-4Z?UnxOyGKc1M5s7DQ)5PNZU8N>K
zyvK&ab5cDCg3u_{v}yzJNUwF<z(-xjZ@g%JjhE{b@8Q{+i#&CP$vj5`brGL2YonRc
zI&6|Dn=!sD4+iWnn{93tx|lL4{KyRUU1G;aE|<F1V7OEAVV2-rf48Yq3Jt6;{XFRv
z8MuB)mFyK^tU~gbO<oFB1&?iQC^Q8N)Y+X!v#v;RvUiV18hluZW}I%>EEjHj-@V$z
z&P+1i5=X2BbSe6f?-QX)s(wr3jc4cas!ZJeAqp@4=7HOOnqUw+3b~>!TZeczLDtj9
z-MDxwn?~TRhlPxvRdb(fToBKe?2=4X+c#3q&FJd6?aGT2C(K~a?|Ax*L?kido7USs
zR^oxZSm^6ywWf~yOt(S-n-5$jBNf%>NdkGB=-2$Pczpr7Yr@})#dOnUH-Td-PnU!*
z?jz?*6TFO42(IJ*V%%<@97@lm0&h37`!i~Jk^ZiOo5+JU^V%C}>7ly&ztIPph68aO
zLR^^8H92jyY(k2W)tid#aSF}cJXq!49=l`C3?p}Uv%PQF6;WawxIkvAlxXaYOFgJ$
zsNUP?Debgh=MU>y%rEN05O;CK46YNGr)P;cIzfq8p4I;OFisRiMY9G*Krdd`y0>Tj
zBw4=e;8<Br;?;|F*t`N}WRjF?yYvfH5>fsqWVDrq%-@F=5%7$KQ(XUi9I*VN1FQ1s
z>!YvmUEYAdXf(IvoF|$*zfJQ{xI2!@p}WNBp84ypypdKbb&8_Q@w(W!h-vDZ=*+0v
zrx<#tuktZ|qMi2ka=BC%4v4t#LIPcz0!n(nlkv{-z1x--nb{<a1zVDi_7Y_1FFV1m
z9yZ82Ft1gz0aMR`f+UxTlRnJ}H5da9ru7DuCWu=peA3-s?1@4seay}Y0e2=ezG4Fy
zRE%MF9`FMGyzN(_aCw3dDX`2lEn48XSS;8e?#71S+Yp?&Pwz>Z3wrsR@t_n~$dr0S
zdF~Df!!=^y5<fYL-gqkRaS0KQ^+9VWO0;7?+3qo<l8$|x&=cH9kV(k^B8n{9Z8Uwq
zD?+UxG=24^v7AKUH;7%9pFXk%B>4+m16s$ic+u5axqfu(CqvW`k1*QiH^vC4poA!L
zKSyLc48n){4JK86<czkbtxcZTk+6w!0NfWNgR&+hR_*znH?eF=ZEBl1mWTp{LM~$G
zDrn4exId5L?*_4m?N;;NMG3Hz^Op1h%$jWe%APPSeB0{-gf!W3B^{M7e8apLI8Cu(
zTgMlU0X#W<w*<{&l<Dg#L~<`s3EKWofeN}8E6B@zjH)xQ43WfW2-hqsk@O<jaABQa
zgD7+}$&=P1J09yD;hup;hk$NoDflF}x0j%cQ6^^Kk7Bxad~T1GTa9S30Ek|wjTc_0
zx|7$Glw0_PfYynt*Z^&GP%7PeqId{0AIo_^$kXwy<L_;3JCa5o0u<CN;BueeU%X{R
zc92W>TPsGF@ZOWY@~_{n@y#C$U5$PuRCq+zk!CenR}y}I7;vG`|MOFqdww+cX`2rd
zfXDm>=$cv|5sNIbW}slaj^5k`_Y}uceL*dJ(d9$`Y$;KRfia!TkYJuilY*!kJ~woo
z(km>_gj#e_o_NTNTnO|98GpDNh7<<cyjG&3?JLP;vaz4<W~u}vpu7PdL4(CU$829F
zux6-41;5yY*_c-%3lZ$E&K1I^Vq4F9`N!zRF%!y!KHi;cYikvt9Ar;se9I@py66rM
zjdaAa6x@T<czmhMP9G7Xga%3>z5J`{qO0te4D!Mp{;6~CZ1adhcGS0;^!_2^j>7E>
z$5j*m%xWibqg#n2p78m~)mGA%6<5+EMCd6ibAue^t~ws!`(7>4_S<-j2T9fkmPlbT
zHV1D{j3H0`fu^FL5ob>WJHtm*+-o1c*DNtk4NE$;rFU=r)r_L@-Pm5})A_0NsCEnF
zKA$6iwhRRRBH90G9LP}gS)imp{u8%LiBZ%fmDn?8Gqc@*mi}W{{L3Wv%e8Iu>2UcL
z*4N^?f7T#%A%cQZ)vhd|*{VX%L|ybv>4qC0Kd98tVtJ>_*1z5n<77QmjAa32%f)*~
zUp}?eGVIlOqcPz=B&}4OF9^P82=taY!E%op-1k|ynlrP6e~!=ZUpUzt`<98>ylPXO
z`sASkdB~-E+ypFFW~D;>M7?n-J+5tYmB@p`^xJe0p>lqY6`BiyeqgM)&cA4$G>j3K
zdW?VWJ!lw*nQz}+LgoYgNOClB4QNvl$i7^N17kN1p$=VCV&m0ur(f{eXDav;nJ_ew
z2A~j6$nd}SA1Kqo;`}IsHbja%u+jJa$WkYE8f9(-Wk2Fb$Xe)GkB#t_b#)O5c>bxk
zX(>A_ZyF)BMDRp5-$L$A{%C+SIi1PpMj_Ta$P(in3poa&B?ED~4_i$>(z#@2Hrn~U
zclx(U0w0#^B|^Q*SQ$Lw6HHazBqv6)t3q{cNC!=kS-N1|E#OlP#GO`xg$KvS1hjA*
ztJFqilp!A0A|!fld#;9+7cj_UOd)R?af&C_k&a-&r0P{I3av&8iq!gjM?tYGdI;SP
z4%mLf5yF<eMHn8PsK_39j%$a6gZFq&-2NT1IUFVb4x}9#QHRGq&a|dbELn5@y`K=W
zynjUp_l^h29CNE#i4!rf3x3RCLt{xWkb{)QOi}-JlwAlc1<opG6u8tRiS>i<cyFWe
zL%vSD#qNUBr0%3?n0Qeg8vNL<|DZ&kdmbJ7uhv+YrX*HCZO?lx0!#C48>_NN+qsR>
zZLAgg7B!!($iIKN&$yt(y{2p7@1ggqee!wRa_;uuVRQ<_-JlTurd$Wy;*SkmaN(pM
zHUC8UHDaf~(bgE{cDePvX37~dc&<R^sW_i6&{Y?=Svtt#&kaYu_HW^b$(wjNjXS<7
zXzV-pIesoq1#p+&1ji1GZ!*GI!GvTt<rFKj)4j(@MxI6B_45gvz#vo(yEDygzDicT
z`I||?$rk-dgi7#R4AKy-mE>VkNW!OHrjy~5f{y%cLK(KJmzI=O>8G3l0a-Tqt7Rhp
zXzkt9ddha%<7(n<NObT}MxUlOHC?kYK?3Bj4k^oYULLp6=@!H~t8oVojNN=Jotc-4
z$NqW@SKMZvt0*hDF(t+N-5*Zncy|x*-3=CZvdm^o{rP?7Ee@OnD1+Q6olhBS!+mmz
zHMjqovbeuloG%2s+!uyfUA(ESk~LJgKRemHR^$K4y3_l&ytqW+gusQttNz!eXA-rS
z-X9c85Pdo0oJl8(IPWK16EtDmPPpt(uT7*z!grXEs@Ln!IW#W*QDZ*|kb}$*DAX8b
z&j3npVG|1Rqfw#}RaSPDFh@-~j{JnJLv4s6{I{q2+lbKeH^VeemBamXe+?+Nr}5WG
zrXa0&ggFhj4d}uk&9>gF0R9c$oscJN!eYm3xZiGC99-7K>s^1b5{QQK3Hx)7{W-lF
zI9#eTE=Dzx)U3f><O?Zna1oll<o%^Hy*KmLG*dC2PD%%hsddsVXPE^grqCxm!nO3P
zfpZG*$JL<<WLrhL<A4cNy*FP-hi)Q)2mwR7jm<&nSR!oZpbH8T0tmPvpYD^4wfg6H
zuJkmLYtJWaJcH~V(VUqm(^enUNPsofDlM1sYNdfaNV2pmWYGHchlgJowrKaIvw|?n
zYT;Ea4c@v|Lxx!SMrEP^ZOP1(&_7q`I(QzFd<jkbqlE@rTU8CzL$-DNo&S%8k$CEl
z+DQzej6sbRK=WWotVQO<F#m@pgS@S%GH+ZJTqGldR7>9};cCe*;)WD+fcotmh4o_K
z+kY{>eBL=*h{E5--*`lAI<&fX{)^%8Co^tZu~`G;f;5*hF|X;@4xhD5E#!mlanEsn
zuJE~w-q8sk5a@z2!?I_~g$@YD8G_P}F$L6Pe{^+4-eL;iP5iKbJf9Kyuuqw|PvEpt
z_ld0_Qm)8=r_awo_O_m?^?<-@#r)0rbj)D6!OcWioAbRe)tA%xCk{%xtdnV}!3S7(
zrl`^f0){A)`(QWl;O)-Bu<_bGwZvNWm)1LL%^EF~1fG=%+m2=RBmBLA&_#mL--EJP
zaTrySX(I8TA`?4z{)VfADYLO?e51p0{s7<G`Xx+j-Pue(#3o}EHX6+P0RAjr-2ek8
z%4CvA@`3Ze>m0Q^#fHwq9Y69B7hj{xC~WW)K&&dlc)FpD(E-4cNLEeoig{b6e}pTe
z!gv~76J6!p_P8#O)O*pdbz#zg=%UnWNHii4F$b?<ZdsnCMtcSz20hwqY}Jh*MbN1H
ze5Wy6Tk_``U4tdTv&>pcZT6m8<I~&LSP|QEV?60@=@?$y#|ruKHV{-n!&qbahUUi_
z(1F%K#1?!kU%w*$cN5!9a6i+&Inolra{f|!y>Ep45Z~Fa0=&q*c@fNYFw)BG)A&(a
zfwWIQ|L(V49xU4@k7cgp?PCk(`y_eat2l>?X<^tW%+DK`vnB1h6q1W@qUa2R==V^3
zo;}<_1J7Q=_a@QP?y<v(Ykfoh1CPxDmU<q&&fsFsll5TbkMp3O5|9sp#9xWeg)wA&
zc<A%NYhuI8N>4#ZLp?{iJYvuU^|k{!LK03+D8|Hsr0{d(HwqaYw#ApQzXNNC!-PN(
z0;xo~8$2XP7rDzY<Y%NU`|D}UzqL>MvXB=nZ|7FNLCzSExf^yxqY%?h5KZGAC1nRJ
zFNvDR-`4Q3E;#%ci8p(`WR$vB<6G6J@EXk#V7xnQU+au5z==olP17vzqufa;x0`Fs
zmS<>U;!l@}*Yu(Ea}GM8AF<{Laclh(zaKaFv!8@K5R#UC@HaiIT~0qL**<6m9o8(i
z^U&BE#agzO$vqI^0Ba=wuBwN4%l}?6mP@hILByqmkr~%|tyBI^OS(YR;`6@_!_HYt
z>*2+XcG|j&SKXrdaRS(*<T{=#t>l?>@D(AT2gR<Y8_XZfd`B877*qv&^uTNzEmeRy
zTQiyDZ)d2<<M^YCUw1VzMpSagHn*#GSOJ%u3G({eNe!OI<yAjIAKSxI0B?tP9X=<W
zMvO&N?@?V|q?o&0_j4-5@YlvNRUVE_1D&Dq-X=DBc9gIatY`CNwg}INM8|jbh9F5t
z`3`6G^o#oZHKo{Pbl=j^q+-%*8ih5jkSyH>NnQiHcd#sy--#pelHEi30+L*|Ahx<~
z8U+O=mbNsG4H~Hqfl>b@!v>}!`6MsTkUod2Bq2v84XE?h`NC{>3?!mlfj_C0Z=SG6
znqP#-Gos}44X6jTc0pAP^3!1%QQF^gE9_?NH}v+cHNE}IW^6hO-q(S?{-Ya{WNn=P
z)OTlMqx=24LQRg#IKMz4&yKyyQE?`RqT;@M*dsqV_#5%TwV7C@7^=riBv(`zi7Vg4
zJwwl1F=*4Yd(RK7;LmZ(m7x}Dgsa>L4$If9h>S}#S2V)54;VZ%YD^M-E6?P%C0flU
zi>wsL%AAF@iYyb{9|kQtdSOpPutk@JoUot#7EA=zONN0x^<xO*Xg*(s1@Wo`fT&ji
ze@K27A%6XgdKINaoDZBWdBFT>##6iY86wTd39@0lAl(Lib(hJ_p)7|O1tUp1>=lO<
z)%-B5uStG4i3C4X306qZ5W=SuBVMSIW$XJr+OqgLa!<{^&3$Fx%$%u5wfkJ&-GXC>
zhEM&52IzC91syv%s6-jk!VM~(<&cmXSNY06HqpcpmuQTh1F6!Zd0sdP2OlXZMUWl~
zc{D=MxVb4KX*0-t^zKzrW{U>5hLAN0h#I-{U4^l8K>w%DYW&6|oXw0C<h%g~qT6I1
zOBPRqSZV_Sx<+T02QVi6^0~y(H0vx?sWA^@Uk8!M4aOIZZqTr6HjA^-w&iKS_Q?0&
zsEi&dJuZ7dWPRGoy=Km3W~zAw5d$;0|5J+^F|Jsm%fBOp2WNUQ)$sDS1`2w7&kSjl
z>8G$QJxM8B&>qALJdeZY5cwV8W2LW{JschaPu(gzDFtgoI7JDz%2@am#<%6lcH5gG
zV-hcc(+3cJCcX}=S$6>0BwLH?`FZr8anJLxn8|jI)ae~^mU;8xRl-q=8;lV|cD+-S
zAv;HI*DbsoaigFA%v3wP)<qz}K70)qqc<&Y+$9~>fx_(ThbTkgD@c@$B%@B3pbS#1
zW>`s{aZSMBr5QZ|L*wfprj{;;iSEpa58hb0Wq+!a<7h>>^NBv%ZW?7IB)E`W`0cp&
zccpsj3lx`$7@tw|<i|dyLu_1bU(#ho40?0a+9I<<!>stgla7vRtne4D{k-ktfcP_G
z^dT7n(nb-6GnZYpmhS^>Qt#JJz|yXJz#cU;Q0sz*_yA#wOUcWz5eIT?T`6Td!`dGj
zTTDXL$MHz=FT7(h@E*FapGp4{cW)Xb-2BVk)8*Y7VZMtK)V8LriL+`GgYZt)7CfZ+
z5*ObI?N9e|UM`~`BAe1SJN&z5Qx(u+Hh4(;t>Zc-j)V)6V4#RcO!d{=QM>lA)W~=f
z#AB|2sI&N?*%ixyCs;ws0RHoYR7Qcb4rTQs?tCp5N@gd1lu{gZ!y<FCxRdQ0--_Hy
z*KD5Y`7924Cp=`3LZbE%nMES^d;$HvWI#gxIX)5nbEbNucwImYg0|+0IvC75R`r9%
zs-XqQ>zH9sBUf*8s0UuDHPB^HFdKNH3Akr11*Vg_F2{Xmm;+prjcTx#{$8#b_KZu&
z-!#S}An*auyk>djgT*!IB~HSQ8@`tKQ5iu$E!tWIpz#IFqN)2#RMT-A>s0(uKXz&H
zqIcl4EI?z=p@ek@kvO7@Hz>xRZHQFj-s>W=H52_ir_e<64r6s?L2}|B6v!vxZ>qyA
zH5NUY+*2CL3YH>$&%3k}Qq)2L{ZD4|o#<j~IT!^)-Hv(E`}2k5Vu_Bs<i_h;g<<L?
zFT9h(8NXR1Vq&VCX|=U*XO!c3XzSoMbUu~%>W<tasx0>Z5N2iymzX0+<im8)35^Sn
z(BaOxJ;ms?qWuQ;1~c0P{K)^}EG~rwY*QhnFg2$|jG66i*jXNtl|&?hu!8yS#=;Qf
z`7H(QE;-4!<^`cQ&~?B7{7Z9)0IT+9p!df^Iv;vLq@FP|+}3-~bGEJvM2VWRfglfE
z-on)e3H&#ozEzZX583Ka9exUZt!70tlM-mnLtk4_*ycvt9(~ve#k>>Cnyz*~)rxp+
z#ZG$wE;`D;E|(w@g}Uu87jRB6?tKp<0eE{R?YO`9Mu}HMZ`feq^?Ths&Ca%97juL3
z&f$5ZQuQ9{Qs(am9+<%+2CqQ5`14gETKWoqqXhC*Guf>2v>~Km3xYTU_cizzvGG14
z#q{Cq#@EBO-t?fe5$GZzL0LB315D15U#`es_(;O(E)s6f$n73>8h3)j{B)Z(y06=Q
zrXxHx*>@YG2OZsU90}R(VkMM6ru{!mWj*S@9{{0Sk~VABg#7=)ilv(H|1Ajd6z3Nd
zd~=}Mrm3p|#+!0a3LNzxK?~qZVqpwzK;Tr^U#4}c#P~R|`!$Z%e=y_U>&8>(gxcLJ
z!;M-|1>UUMU9Kp5up!r~xt^2hF~TOW*RrKCZEs`=`DEK|SSfg1we7yk{JkP!#6R~4
zO>(k-7UT$bYxuO~$WD3wc;XcbKaiZ*1C5m0tQM7iQjkizJZA`K9pS!lDCj`|H#@Ld
zzZs0D!?52O=4vv$Zd!J~N{ST5xo)zcNo<R_)$sHB!us=QY6x%hi*N_#XIAHZTylOv
z#!T?kr9h;Zuph}t;@qQcq}-bq5XGN$#gUIT2>)qbe8k%cp$hMz>|%8X9cErtWa6jQ
zfJFRo*>?GPhJ@aB{F}_%zG4VX;6#K{W+Z<dip{xJI=OhZ7UIlrkZG+#$LZFGYCl~=
ze)<<Z@Y~G41?>xUMjT#5@3wcTby7DP2VJTu20SCy4ts{oP@<OaTqr3fOiWOs>=2;@
zB=y3L-%Y&oDLQ{qGXFcqB)Yk=1Y}y~U=sfiZ(<&fa?c+a;GlC56Wdbtu_DL^B_4pM
zL+0zD#mH;hP%N9eL`v@~1g9*f4h`_cA|{TTw%KaVyIb{fD{mt7z|Y+Y9f-)xHOJbB
zh<ll>p6S@;I<|GEMvwpB7d@TFrBgiTpZ#IW*>eAlbALiATTk|Ma;ZUYw6Jpl2q-iN
zyw?=@DvMAYUS~4;!N@p8C-5^m?mO}4s8+ODo&&Nnl+xgS`cKRip+@_?5DVO|LHqA7
z-bYSnOCe5k{35&k!?b~w5(?1_tQtnr@~4fc3fTug6>dDNrF&@Td@OQ=rv{vQS~19R
z7A@Rb-Evz4&@+qw-CDt4g)FRUvce1VQ-bQbMMQloCZWVtTnjE9yd{bWAELiZ=kVW-
zj_GEBseWn9$lHc$k>O<yoWtpXCvX2gE~Vdu(R16fPbs_OomuEx%g;}c>r57hqc`v4
zXbdwWN8%7TY}2+S>BPLwSh_E1IXgSl1D7YJ$Mecm+jNf9ZzBn&hcC|gYcw}Sn2VB4
zm6yc?6_o6i0~zlNY3@N32N0*kJVVQf7!JMRm<`5AiK0DVZ{ZP2N9`|@rBIT@mRzzb
z{c<{7sG9qd(&J1dUT}8=tfQw<agIjrEA-hm*e+*9f@gC(Rh=Y2#2wK!CnfIEwp4Uo
zOO{i75JR+vS*JZd{u%d+P#Cab^ihK4s~na?=ECP)sI^r@+;U$(F1@*qBW7$O+!{9N
zdTtp!XlG5IvN|0xjV}?yYqcDauTevbFa$Dx@)%Cw$A68};=NGl4~;fT6cvtHOWilj
zUnuxIDNSipq1o^joc&LF=)FDI<_&Ee*yBkILA@zWUfIF200(tO-RrO1UIEsY5xoDk
zVwP~4LIJUPZZr6>*h1|){H264h2;$|sH|Bhch#yilG+SyUsEq#&lk}Wc~*`I79UtT
zbc&o>#>mkBif;20PVWnP%FUp~Uy6yHu%-`!@M$p%RzU3XsC7Vpxna`m5kGJ96(0Fv
z(wzUa#*;o1UP3IgJ}eqIRG=WXTH9su-aS)l$U^I}aN-P?j<%w3O||KRVh~j3X%%0u
z-doPlAq(Log5_S2CT>N~NCRu9X9O{!HMg6+#~Q}ZGnDO|Ap@^18}0iA`Mwul0e!cH
zm_)^~SO2qqg_89PZ0`dfypj0^MK0IDHHmw}XM!P%UgIQYs`CTg{fz-;m8o>Mb4X&b
zSLwLGa=Ld_|LC_Jny5V0v<u0T&`eQSRs41mv!l>T8|vs^ntIGg;Ptbz(>dlQCAox9
zW$l?E`I?q7$7F07gV#ccs|H+7<YHj`(5mhGIRTFF<Y7m*SM#YcT7s++qFzqA!$c;D
zB0!?l7b|AFmK~E#9`(+Q1zAp418J$W^vHO}p^KBEG4UfA&RzSv!Lfu}6^@&%cTlpB
zMjk9nkS4WTjM6K7%HBZ(5d)O1f(@5($;qqLXxi{XY^Fak;$tj{^7>Xb{HSsJhd+F$
z)Hr~4f=jlUF@PqI!i#Zt0bMXE#-z;Y>R?u_DSngLR8C>GT8rn2RvkVPp%NClDJ(D&
zPs74Uyd=L*H4<MW{F+fz46-omp2wv#IC{Qf9@FK`!RQ7Ga@RlW%~CyE82#g~-T0GT
zGtQ?-+3>F52QCFd)?2vou+fRL_fPq6>Jub&6^95`9tuOFY|GdTcE1-&EhfbE+)$Hw
zIMsX_)909T9fBeaLQ`(l*O*eInlq~#4+Ip~81a9T5aNQX93=H9VJ-qem+B`a=!CpO
z52Bxwh(!q)92{<fS?L-Dnf))M3AjZd4EVTU5{B>HzIcbIavi$(|2lp!p|Re%s0%+B
zNi?COHm?A)kB4PJnkJ0w_2y3m-1q1N4r_<ZT<b&LT<AFeqYamAoR=G2yl9Eh(KPl~
za)6_IMG^m?>DwUy&nBuD9+CmNln+*da0gmwRqzCwJWC^r_@-CWQC-g$3Sng+Im>qk
z8+I4l5yJx`-Qp60R<Rgm0v0IAKX}Q=?s!iSxVnqX8PbeE(J3?mXJY;F=HlVfdIHk>
zo`PHjWNmrMD5-A+q(}{1I{qQ}qW#950Gd6Gs{icv2C8T8tzxwFS`-MM1T2{q58e%6
ze{mJCsZ)jacT$U<;Jjg*8V_Fzh;w{LA+gk~U3W%tBavHFs#;F>L8DEP|48w!GN+f1
z_wAqcd*1RyoZt5q8z31spDKt2E&n)<Py75<Jwhzb+LV}Dbc@yosOR8WWeL}pz4G&D
z`UT1e)0x(f@(&mpwF0u|NfWWfj~<QbZp{78wJ}e&9Hd$S+m4Q!#{;f4d42u6V|qNP
zJL?Rbw!5XNLdqKPfEtjFV(#s|u_#^@tk3aB?rPqzD{XY^E{maYV5ESIpVu;k@JvUn
z^c{4WWqf0Y@-^IA_h@dsycKA5{)M2$TmL!h?rKqp>Y`y8aOwBotXS(4JBDBEau)Hm
zv<5i~`jB+mzcv&2-{0F=A26CtSiG1vfE+*VRaqW`Qx}@1Wp=djI@OjFA6B$5XUo2j
z(FOz%m>B*Gh*qSea}&WwVqO4Z2a0br)cv+YjRg>;ajQJ3i<P1bRZw}k!=aZ5Uz#Ob
zJNZ2?n%`4}5*wGs>k#4NGpb=#pAXuoqGP!ii<p(hDSf~&2pjz7%`5xN1R1>u4g<#%
z>tW3#GM1rZ@lx@$P?pdVI1wm7pWXOenOW2kO=<EUD}Oob`t}amIi#*+HasIGtQW{>
zmA1vjGgdhrTIaI<C>c!FY;kVD{9KMf?tsxnXNFbriiyrwFtc44p6YnlDaOCvMPhie
z?I(IiB<ck{0*vOL`Pe(UjX?9E(+Urivl+^(*SiHl-<2DFQESWX^Q)a<HsTq43tDOK
z;PxE6&UjDh8d)Px<B<L<Jiclk#lC$}w^~aSIzrV&xCkB*Ll;$W9CHat)np3-uVoy6
z090;8CxPcU<GRPqK*aRC6&9F*S?ycgUSO;&()RhmZwE+mI<u@&GqqJ~5^@TeBNU2<
z?tx2TL(KpjkLSm?=i22Ox0!@`b#))?mo0;jqbIq(jbJo>zN>Z2+)581I*KHj7^@pD
z;NV&qBRR;A;&D7{ct51qPb_BlO*Wo8pRc*<V~eYXu#MqGAQv^PcR1HGGI6`;?sqnW
zM1>8=VTF^NQwI{%_>?ghzMk^wAi0oad75v3Q5y|Y175aF347CuJO&+9FJe~tMC%nN
z7o%&sL<t*d&%OGmuXSE4K0I%gfQ{vVzho`N3m5plf0jrb$z4EVdZ2{;4DHWjRuLp;
z0Ce)VaTkD<dmd8FceoiFRU3?E<vwzkgReQies*K$T3DzUOxdU4WTe5dInpp0ar&2z
zml)pggEvuqNnV^;bG=dNl^rZkSy-D5t7x&P;+Av#w!(KV{o?F;E9y&lpW<M=ns=y?
ziJp~PMj5giGd4ipOt$;$bVf@ZFiE^)CZDBw4Z-WIZh_JdBvXrPeA?a0-l+=Rf#oeI
zGA%+mM$Xm-7Ol{jt^}4bXl)GRPjfm<<*4rx!P3^O8TVTa@XiWM6>43RK_hY}Sq5X#
zz)4!s$08vmbg&k=(9EHBIlk*T{cBPdc3Pa7`g^Yl7zh!AFa$)mR;)YDM*buLo;3K(
zFhEvjqwT?$=PpwT6TqNtl95K$!pF4gA0nB?yE`cY8r)=zzZ{QNbekBCAsu}ZGNH1z
z#;Zo#oGuFUW*k~8)gZ66w_fT}ABZ)n{voWFoiK2pm;qB)%KoX@udLc1-`iL-@I5~T
zfmlClQ8$QeuL~u0axqRfG&Rwt$je4?oG!iF&i=t&!8YDz6&V%VX<^gMzPT2#y=|wh
zQ>p8{kheX(X2r>iZ(g={Yw+~Jw{Y!#A@T_|5%0owa%<}vCAtnx0Fy3Kmz#=DPq>#N
z?=!SDebQatnETq0K(egsRyHgG!);T$DSgU<njs`KSZLBrj`m9vL=oa)^glRY6P*S`
z_ze1zd9`V@;^dK$UF0C=RN|5Fh_>&!0HX97_L>L}#2Y;~k7|PlQqOUIZw$Xb^8TSd
z3_ljuky_>s<U5WH9j@(S8{PL>+&*92;iBdj{7f;2q7eB%k%I9je)t2A%lr;RXREun
z1sUH)LT)bo2bNQw)Rc8r$=%wHhi+6?@OVkPJ`?t<n<Rd&h?8f5l555*u$QQ+NJlE8
zvq8)hcE=8zo9dew^%=i@3uuJ&!N$@Q#7n1DPIRG*QTqiHQ84vn7uKT00M>B5c$XFY
zxYjs{2t41zXrC2l&f*_z<xSn&2^iXL-yHBZLt<nFe{CKQ{*BbJ_xh#j#jnQ)*wV3n
z1W1B~QdMk6t!~YvXjPKS+=ZgeC&rQ#>KO>$1sVZ52&bio+Ltd`Q}69|oDx)AJju*>
z{FfCNgJ%6kvxRb&(Hwf*h0P|g19j}%tf+-Z+{I%Tn7P;fCXk0{;xilZ1o9P^CZ`zx
ze?{F_P!r160B}G-FIB`4kfMSD(tGdHL@A0?2~C<b34zdw0;1A;??rk-XaW&Jk)nYF
zL@A+43&qeOKqw#g&VS~6`_0Zi?C$Kt*)wN%;R>_#>)+tOtf!ddHV&W<*IhBDDvw9O
zi<*Y@2fKxWv%-dGJR5MxN=SEEPIk$p_guSS?1%j^!)-!{%Mn;2`y?tB(y>LikfRnD
zVn!b$V)=cIEF!tN-t(kBd6dM#d@SB-x(OjDuEhb4#oJ7GAq34e22PhMTE@rkX_jc>
zrAjCxN;Lz0=;GyQwJ<5$RZ|Q0>ZP>Y=os>Xjv<*8zT3oUH9e6udfwg{BGS)FIzr4B
zGWb2e)w-r~E~Mc4sxE%dL{kfUBe<{smP`)^v%;gluN_46(@0112VREn%xV^P!0R))
zRJ9hp^I(PbDTP0xj4%J}+|vzx$v@p|DWt3ldTWwz-Y7N`yXHG%^x9^m!<Q}rEvcp7
zrWEWvv#^L5+@};+X6)dQ^QnJ=;Wi)Rota1yN_2~Jb#>DC$-r~rJ~lPpn-~4$PlFHd
z{Vks#8x}MGRiQ89fiA{IB|Km21rJz-wxrv0HW0#3+TUY9ANhD!d#i4W_}|NpEd*B6
zs`)g&#ekl+@`Sw7i@yqf_u{4KKXcv7Q?n>R;ai54UtEuy4>k>03rMfJcCR2?Dzt#0
zAD4}kme#4oF|x}qTfTP9)zyQv-`=&JrO0ho_)$ETla%*7L)GH(&~#7$?}Lnr1C8Mq
zslso%e4cPjD@#T{)#{x7Nh4Pq%fmvM9juusmBiCbksYk{KcITpvox6VdIoEeI?l#g
zgdEU%iNW#r85NRq%E{{Uu;`~(H3H?DN9zTe9W@{sm5ppMT<hl_2gj=glF*Z6UP)U~
z{oK=`AiMH&yT{#-4?`k$hHJZJnmAz95Ove?`xf6@<>}tXI!l2?uep9#E2xnc-ot$1
zvNKQrI*Qq_VU`?5MXbCyG)H%zIa(JlH{S~x*>!m2<XGM=QZ5@Us3j``Ge~Lm^|a}K
zN_>%oY39^c*>-j#@Whbdnd8(ZO4^Bc=xQJmr_QeB*LPpN^AnAlD_)knsp<d25mEfI
z@l;1s?^{cQ`=N-{>=8|rW`!F+tH_&>pvxb1@+KOmml%AE=M6@E%C96wgujVSM^Wli
zRW0NIgh=YZPtpynTT!Vfi7q8DbEEx}O>CrjV9QY%zQDrZzL-$PZ!e?|-&-|omX9eh
zGmW>Mr&So6_o@MarKra&Oe-8Er#zAK4jj4VE6&HC;kCV6%)Vy#g-U4;H)KD>ELOgc
zK68isf{GsUPi3F|lv}m-FrK)PybNGI*3eg-1lHdFG>7|73T2QnNZ~RtO=jxGipY9q
zx`|~2gZ*qtysLuDKeeC!#)Bh&?Bv+e>eWBLU`u6D0dG1wd#h?3FHKi+GvD^9eH5`9
z@`t2fOq_0N`5G(E>py<$c|^DQ?z|4;aFJ#8ZkjUvhNDo}vHl9=OuROw_Gnosi|MeZ
z#c<&@<Kd~>w*lKYEk)m5{hN2cv=lvCd$^L!O}XoIs#RIOYOY4L<T}Lt4Xl)s%c~y$
z>o0iRlSc2FdPiLWJ~^zGQ-O=(xI4`4$w`yXs_(YdP9Y7X?bID<1@@1f)H!dO2hWdc
zsV8d#bl-+_=JQb{3s=c&F2(gXZu@_a<NE;4n=|^<rT+fWh`j|re54v84$NU0RRqV`
z<h?CCiD=5dk!#>kp2Z=|w5Q0NYY<-Ejr?;xNlr+{mf+qYW+r6j*1<Tj&_Ua$(oJtA
z>r)eO^?SK)=HxxZb=GG|duQ~reX!HrfLds!Igpx7#-D=wuEL$U`Ua=-rJ;d8g89am
zAw`gZ@=&%BsfJfUbBV>IVP#Q;?lJbn+H?Yf%RR_FXsr@o&1W~wJxE$;r|Dhp-nA@v
zn18KzIq0zK4YkZ~9~nfD+3H(U3mZ`aVC!R79-d$`e0Tf~6GREn-d?By59HSHF;cXD
z*%585pE!Mp3cy%v-*1AYgKW6Ky|3_U7*Rxg%L4IwvXthYkR-Cq>KqxqG&p?PHkR+!
zizvGWa%l>$q>p2YoIWi2HqdGvbalXXw4O~r1n?~L`mwtnuptq_b26naAX4$zEpYjy
zpP3hJYa)G|6BBpfti8rAlq4$Yeb1+cI-pxyGNvXMj`i$sTgd0h*3-+ZYKzIFQQr)l
zg?9kgD8hvFu-TZcR*uEHg6OUgJ@aVZ*<znC5t*;m@(bGE%UzUyA_D*)62y=9y>)Mw
zAQrZn`R4@uZd^YLoZqnmfD+g5-Z<IoTx=?cq4iDQ7$JlRS9wl4?*Ji78rY}tdmRDt
zJF2nNR!Kda?hL*U3p5UbUIZM6bss4bJw8K?Q%xY#kq72U-MkOW$66or!+G9+NS+c-
zE9A*AWK89(+*irvTY2*Mz~Wog=j8%Ht@vmlDvife(*XOa>G3(j0f6^fCP*Cnz212Q
zi<Zgp|K;GYN|_9KF8djJi}z8&2mc@gSJoqeI^?B9;JV{|{ioLBII^VG0`ATYgs0jT
zYDZ$)a(erE3R>rs=b69@ByKJMJ{<OZz~l}pIYoA@A#`^m)ce5)>=nxVQ|M(uifKE|
zZNlzm#3C&k8l<RA)6Z1Do8e!n?{-`h8u`5+gGx253K>(KNPe@=#$A}+vv>^yFyh_2
z+QiAN)@<E1_x#$p$;{#Cu)0%Dd0Vw$&sbN9H9LEeihRmTSb~q!lF62RIDrPt^A{7I
z^?@>9?qf>C-3=%1#A6{=s<b7|(JPX$Uc16%>(@c*E0J*~L5KW6)jJ;*>=#pW&%X2B
zXX?ylB6UMiY+uPAvy{MX-ehh|cJlQc|Bmpf_n+1Y^+sR|l=!nVo4=)>Zuc@)5t%)_
z4mu_@np9|WP_KyfEj%epx)ak}?is%U><`oyUljyZdij*ENvR%IX5jhDZ4z7p1iwpn
z&sz2z1Voi<Sz}n2v#69c3Gh!SD^z{_5wnuN!Sru@+5v{?m2$$4pn|bzrE*KE)QXe*
zwI6A@*FseD24m!B*<Y#6L-HY0Jn{a06HG^6dB3+UD;gh7sH7Cq8jOiFy|#BGT`wSa
z<k7C@T{&=xFCY>3Z_i9l{GlvR@(X_WWVel~Afo5+iDmM5+IB0XE(TOD{yp#;E-wP~
zH~IZ#{H(4UsxECFn;1M#s9+M%1n@3#|Jl>fQS($xf8d(1eY|aLl@ss8fN!uc4Qfx(
z@A<K`L|HHe$`Ggr?!>tSQgJ7NfO$%|1^TPX4&-OP^eXd^=P4Klg!V6bHC<%TJHu$6
zU$4>>?qRe4-tG;(1NSq1fzsJ|@OC)urV4hUUidF%k<f#nTxDm|3EoJrFY1z!*0(~h
z4xgpU2O#JH+(!!IHk?}8MW<c$x%?sE8-TRkYe}tE6=<VUbbv2d<Oyx5^LhTvUv4(V
z-I@%xT8ro6zDt&35?094Z^NKFS<=kbz5MrMH%|sURJUWuP!Wc1Ke>;$3eJY=d93{-
z^pG<j%clPMikfV;z&<5?d-tDk4r_E#FnfBFk3HO7`_w(??725K<`#{{e2q(j<}=)!
zRsx0#)Hc7g?(l`QEqT%xTxQOARY9*|e=fdOMgC+8l+`dz%Kcb6I`rxKn&@+ucfO7$
z{!-yMG1kQR$$xa`KsDOxiYGBcBnaTC#{G6no%MyMlz^+Fp2v{Z*N6cn>i<bk`Q6&6
z?09sg8FR&>(eh9@z@(PPxW6kz|MB{MnA1h#HM+fr4=P8=X$)H2T7=wdV$XcRjQ>=<
zgp+S-0||*0ZC%sLe}4A13RQVY`Ukf8f;Sf&48w<QRL_rJcJ}37Eo$$(RvH>;ZS428
zpi2P8m)qxVx?f^H12JeI?Tt5CnHvy>i6<{3A&WOn(YBx12wqPO`W{rB?@l-;x+lO5
z7pbb1x=8oSGUpTM`1f**xtxp`v(RuSG|vm&$&^Pc2=@_&sf}L_8IAD1_vh0Q(%wg?
zV)97~#RkPM3^u$slyc+k)Fpn0zHZYLXulu8jui2-PCSV5nNFT}(&|YE7d<NfG%ed>
z=^`Z>xhkDxRQ$fCfgPyt3#0p0jIcnk1HD#c8$j{W(d3)vlgio$*#W|_baH#<BPJro
zJ1^KWhJ(u61CwK$Ca4blM0f;&ry3_n>h%pPK-zK8n<|rDhrWjQ2_#nYfaoR<46AN<
zVPa-ZEFFf`oauvx^G@pfF~Ct!v5q@)Ni1Enp$RpwjFp*uES)ZdXqv#498(rs(%M|r
z&-lGppVbQXan;KO%v=it2}Kz4D0+mT;X`lCUE5#EIP=ynXx*^dGK-tktCnXrE+b{g
ztdbZNUZrmzppho+H5%pcp}8BbT;oKYwfjo1<LDZ(hQ9^!9EEDZ@5WGC-!KhNs@z9}
z^t1*ovb%jfti>7)AA-bQYYVHvfmXV5g}q1z1v_h<jUe>?2~ae^c09gd3mEgRn`Udn
z7AC0rf#9GMlM9xhNp-{3T@{X2?SD|eSss!kP{UKmVo5UT(7R=}zs8v{(5Cy%TA;*d
zd1=F{3NsDVHiPHJKJf@;XSz}6f*S;XsuipHNH^kpILHa~;Hp5|PyZ$ZUcOO3Gbpxg
zw?+C@t>G4@`C#ufH{hRbGcLc8SYCu;>+wtPMCvcM0y9jJug6KH`;rpbKJT(LpLx)n
zx3Pj1(HW<Xea`b>PpA;z)!C~3!&Q<Re8@|ixMWuLMYnafCG*;kP`RHGDEUyZ3ZaAJ
zdk-kLBeTU?zH@k2JjV0NrxWebhayZ36SDIgoE`b5;=H09z>vJ2@djFF;kY<=2(4mf
zs+$;{UVoDU^*?zTFM^e5Ir|@Ubaa|APy_=5RZ}#&%owPGb(yg(HZ-elMUR#{9G3Ss
ztO)Ni;4)u+;MlMD7Jq-85+%^X4y0MtO2P0kJd2VN-8qO49)-ehXpmaIjVr;Ara-z$
zz6mjFg&{f_sDFxokT$GNrv9ABvc>laFNW9I>U;NL<|Vc`EDDt#G}y@rK1Rcr*%}Sf
zDYm1-SHYIG*a#b{P9a)k|9k7a=x*%?Xe*o@l<w`ckyVY0b7Y79vE##M6#IU)SdEO`
zhm~IhC{EhO$Z4};1Wj&7Wq40mSyqLG86YLL{{eQ>Qj%pPC?75<3Wnm6k>@f(v;VdR
zZ4uvyo5lA1k7}2EACN~lCG3Qa)9gaR#&G}H_NB55SO|Dk4%&!3KlURIHT{yRD~UV6
zA>45|vR8lPZ%A0!tbe=1$WiW8Z<`NkZtDc9i?T5Hx*&t*HeJ1;;~=h}{*LAmV+2dJ
zHRJIswHeon@pi)9#<o41abeqX!>HkPY_P{8bbNeBt0<d`b}S!u6M2a7>srN0WXqF7
ze)GayHctI&Q_bMInsW8Ed#-Hl!?)M(NmRFp>4?edyi#%bGB8r7O^STcC?6P(b3G~!
z))I8cRqk?W1iE|x2(YRkot5!14JC)>^dZGz_R{i7J33Q}T97Y8uC5c6CDu7A{LsYM
zF)VH_Ci4`>lrXNU1`~7JRZ~+2#V9CB{OraR6&5r2`??<gCxg<n76Mz>PBhifNL?5h
zAr-y|pw2F7w?I+16c@LKjd~<(?&&eLRm@3Spa=v-=K+P_hBG=Dwtm4Zfb^+tRLoLU
z1lGd#4#P#ppM|fqXsNMr-JXm0WNxM4l^{qDMHHEP;d|Bwg5e&D%e_;f*F{=D4)RdC
z{3zOv$l*u8SScc$EtJZ;&!}R15i@s4?b>Wc*a;3%aSj<FIn}IN(hbm!YQNIK+_J{5
zhu3#M(*_ZuO>^!{7Sj3hX7Em(4$!nK&1Kzee*BAZX8zV-{n-fLGgKU7AxEp~@HhOm
z^{y#H(PxjPv+c<0Dgjd(pXI-=^gnE=nfM{yY<~svIQ&Vyv6_ougq7*$k{}~B5?Z$c
z<uwQM%~Oqr+EP~J?d3Gv6*mvvI>IX;+|rSlihgBhr_JB$L{MQTr>oQK*k3B%Yi~Wz
z?69plAiE`sy4t&g3jQqaq)=M}f!5NIZ}`wTa~6Hk*V2xE^M&M0S2v#_WNu4BnbLCv
zeF@NammTCVRYgdfkuoo7<l#`gn`@1EuDUW_7A1M*yrV@iu6YvR{XAw7d%K~TfFm0s
z2-cf!!DnB$_Jgoa&3t3C1Fb~vCWt}FrzSZcFO)9PdepTJdYJ3n5XF-o*#x1*FM9!z
z_rt`$d=Vlz9(Onp4dW)(@oDV#J@PZ{Q`|V?Z@v!1{B)EGYw^dmZ+I0)xTT5B<s+z2
zqb&EaRN&KPzP93!m}a7AadpmWbiD+=8TAn^9#zDrU{7qAko!+6W$hDkHO~CEKzQH!
zXWOp*O&aT$Z_obAy2DR6S+%2Eb7D224p)CLsrHhBIh$ZGJ<?)@D1xB@+Eq;kzsMLb
zwYa?XM{B7rbi}hMJ_bq>X&jW{s0n?^Qtd4nED#1FpPsfe@;7`~aCIPxeW1&<jKQj1
z&KWH%YUex|?I!Jxw`HaM!5V$wVSvJgdJa!^IZ9h7k(!tt@>6#Gh$n%zWU&>EhqmLz
zUl*Ph-3ubLfmz)BdupU6@-}`C8A^x)8U?jIizXk^d=57&s}S);9vaqPR4M4<h$Fpt
zrREkyHbi=cn`;caMQm(`*RZcaqer%gu6XmYSYIU6rASWYVW0qh)q#lBd=vD1*SK+H
zq>+WkAYDfX3986*?b#FY=R<-@&xAlo<pZ)&2jttFn7OyG5vWZTeJ=?*H?H&-tJp32
zbCVq8GH0nfp^d+m&|0!>(^@=|V-5hgbX8x5?f$g82kQ?GIGLd-P+fW}4i(*EP-$p8
z6iT)NklJDAHj#p`uz;_Jmy3mYl-|(Xl+(DFOMlJE(qsx5Q)JT3b$jx&v+t?HYO41K
zo#smRb_i{<-;`SYQ3^G_GRgKlXfGwa!Jqc;>L9I?`-lHY+jHwqY?lc?ZQn5Y+N<q}
zPrIb&z*CB1&n3<>5))65$rOiz?%JW{7rG>?2hr1CdL~hxAAboxTk4p}ovB6aKV&8R
z6D8q|XkIlD#!Bdshl^ljE&xiZG<0<s-7XtF!~RqCZwZ2>jF4ON2>+q_rsDS??DsZ?
zSHCJ&u@PwpHZxHY5iU+D#$je=O)NdTHO|QVS~vcvWv(Fym6yNcZ+z;2XZ-{FQpI)e
zW++I?pYz~*m^Q^zu|cegJeMVT@A!;0wk}wpaz7i9B5a=5#xPzsuC;!w+ro}W%TI9o
zxPb^f+F2dISCZS#vp<L?c#Vl(NGc@)W9xF7s^g{^m#BIFij5gY-se+n2rJHMTFjwg
z$+J|u+!h&3w*K|Y(-kpIVu>Uu|H~wfE<D3fx}cNxdw9>Kwg<AbwXVApI<B=lH?OeI
zq&)VUgIJFap#3ixP&e-no}H9zq3zAXBU^1@`x$Uh>)qqaBG&4EHIL~NfYEUq>fcK}
zYb9(JFuIqcCtX}|GiqF8@uR=op?U{$EVh;H8!`>0m)Qt5>4IM!MAX26J@HY=z+WIb
z#=3yA>`|1b80*ViIypre_U5c!xb@oRD*m_~7Pf+LD9xZ&+MzjF<dN->qdAw(J!5tG
z;R%)Tt)0q?o<qTA$K$(D1KxJTl@NIVkoyYP99yF6B8M=-R7y~<G0;qZN3I8NyIF)6
z*qR35?TKP!W6xCoO<E#hk@K%udCON>Y`?;Utr<Ab03Vh2XG4Its%3MzXV$OQ{dVux
zgARuhYc^3cnA8q{W4YTK8Ds`m*br{$sJ(k@tcfo3&c+n&%}CfFT{B(vi=Cy>u=AnM
zdZx;+$2J#%?vvpwo%nZtjZaQr7kwQ68CSLSMT%6)6Pj5+y7}u52f$uyTs4hJl<dBY
zf1~^VlyiqYg}e~LC~kR;86tBae;o5jooX}>p7%cvbK%;y3wVea;MJ(74|t1TOVMiG
z>5mq-!AN|Zp<$&KQmc9w8vE$H76My-{-dSSy!7@<!ugM~R7y9(fhak1S=?nJ9fa_o
z91#AXaAm?!a4itve-Jz)E8u=Fy$^J1(*s4songpSQ){j}NzZ4;rvQ?`-jv=EmAAym
zPSF(Ly`F8h(Jmzicii(*N)H#e397p;)dLb9cOrnYe!W!G3{(AfT?Q%*>c%B`1+YEL
zJuwa_y`9pZ-;N+tTosE=C}SU})zjOzyBgQkBIJ)`vQrA<Li?(5KB}9Mm=POd>ZfQ%
z&CO{q3WsraLeU_j^}#|rwq_<otnFrU6tTzXI0IFxO_cT@X*5>fvVVr6t(#)`Dz(qu
z3Dse!S@cgWXs{zI+9V3c(GStEN*-O{@s3Wm#grbTfUC{9`6=)1C%mLI(@4=eW0z8C
z{}HWyg}Ci)0!Z+%vC5>TXOc7B8CWTMZ`pY{4innZ77t}*nz|V-tCl4v!XJsZ#A*Kq
z&s!@YS0=Eb{!+0+bMu%yP;flDMA)07^Kjgk+7p-M&S-(sehM5$xvpOhtGe7q@!TOe
zsyTsB@-%~gFpkpmPC=%cQ6|SLA9}ZxrY9Q5g#`snLG5jXz3%YlH_lLeD00HFh?rwp
zH0sMMChV$2^27YhYdE9yoZ~*^8-x)&V1*uNFq>u>l(0UpJ{cxuMCCV~R~>N$j}5JL
z68QD@Uu5)iF1eB3Hj|&UWue*oU1BLcNgpCry4^$i(B~M~1?l1_;o`I(cDjK+Er4C%
iE)L#Y>?1CA)z0T&r?`tV*aflRT#aLbzWeeBPVs-G)X*^i

literal 0
HcmV?d00001

diff --git a/demo/undocumented/contact-vi-tao/cpp/CMakeLists.txt b/demo/undocumented/contact-vi-tao/cpp/CMakeLists.txt
new file mode 100644
index 0000000..4942b30
--- /dev/null
+++ b/demo/undocumented/contact-vi-tao/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_contact-vi-tao)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/contact-vi-tao/cpp/Elasticity.h b/demo/undocumented/contact-vi-tao/cpp/Elasticity.h
new file mode 100644
index 0000000..3a3c274
--- /dev/null
+++ b/demo/undocumented/contact-vi-tao/cpp/Elasticity.h
@@ -0,0 +1,4739 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ELASTICITY_H
+#define __ELASTICITY_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class elasticity_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elasticity_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elasticity_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[3] = dof_values[4];
+    vertex_values[5] = dof_values[5];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elasticity_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elasticity_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.5;
+    // Quadrature points on the UFC reference element: (0.333333333333333, 0.333333333333333)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0_D01[1][2] = \
+    {{-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {3, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 78.
+    double G[10];
+    G[0] = W1*det*(K[2]*K[2]*(w[1][0] + 2.0*w[0][0]) + K[3]*K[3]*w[0][0]);
+    G[1] = W1*det*(K[0]*K[2]*(w[1][0] + 2.0*w[0][0]) + K[1]*K[3]*w[0][0]);
+    G[2] = K[2]*K[3]*W1*det*(w[0][0] + w[1][0]);
+    G[3] = W1*det*(K[0]*K[3]*w[0][0] + K[1]*K[2]*w[1][0]);
+    G[4] = W1*det*(K[0]*K[0]*(w[1][0] + 2.0*w[0][0]) + K[1]*K[1]*w[0][0]);
+    G[5] = W1*det*(K[0]*K[3]*w[1][0] + K[1]*K[2]*w[0][0]);
+    G[6] = K[0]*K[1]*W1*det*(w[0][0] + w[1][0]);
+    G[7] = W1*det*(K[2]*K[2]*w[0][0] + K[3]*K[3]*(w[1][0] + 2.0*w[0][0]));
+    G[8] = W1*det*(K[0]*K[2]*w[0][0] + K[1]*K[3]*(w[1][0] + 2.0*w[0][0]));
+    G[9] = W1*det*(K[0]*K[0]*w[0][0] + K[1]*K[1]*(w[1][0] + 2.0*w[0][0]));
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 192
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Number of operations for primary indices: 192
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc1[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[0];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc2[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc4[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc5[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc1[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc2[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc4[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc5[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc1[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc2[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc4[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc5[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc1[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc2[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc4[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc5[k]] += FE0_C0_D01[0][j]*FE0_C0_D01[0][k]*G[9];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elasticity_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elasticity_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    6
+    // Number of operations (multiply-add pairs) for tensor contraction: 15
+    // Total number of operations (multiply-add pairs):                  24
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+    A[3] = 0.0833333333333334*G0_3 + 0.0416666666666667*G0_4 + 0.0416666666666667*G0_5;
+    A[4] = 0.0416666666666667*G0_3 + 0.0833333333333333*G0_4 + 0.0416666666666666*G0_5;
+    A[5] = 0.0416666666666667*G0_3 + 0.0416666666666666*G0_4 + 0.0833333333333333*G0_5;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elasticity_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  elasticity_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "1ff95894afd7adb39703a7e84d6731c5cdd64aa0b1843c797d24df3fa20baebd33196e5c5c25917c603a91e326f513225480fd010a35d124072f545f87c09daf";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 3:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 3:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elasticity_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elasticity_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  elasticity_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d1f999621dadf3d7421cf8fc0a6a5ffebb8c026e8df96feb89f910b47d16c95f95272e7920278d4ba5c3429bb14c6f26e07b57c0cb79cf98381bdd76587378b6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elasticity_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Elasticity
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_lmbda: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_lmbda()
+  {
+  }
+
+};
+
+class CoefficientSpace_mu: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_mu(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_mu()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_mu Form_a_FunctionSpace_2;
+
+typedef CoefficientSpace_lmbda Form_a_FunctionSpace_3;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "mu")
+      return 0;
+    else if (name == "lmbda")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "mu";
+    case 1:
+      return "lmbda";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_mu;
+  typedef Form_a_FunctionSpace_3 CoefficientSpace_lmbda;
+
+  // Coefficients
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner lmbda;
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/contact-vi-tao/cpp/Elasticity.ufl b/demo/undocumented/contact-vi-tao/cpp/Elasticity.ufl
new file mode 100644
index 0000000..c96e4d1
--- /dev/null
+++ b/demo/undocumented/contact-vi-tao/cpp/Elasticity.ufl
@@ -0,0 +1,45 @@
+# Copyright (c) 2005 Johan Jansson
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2006-2007
+# Modified by Garth N. Wells 2008
+#
+# First added:  2005
+# Last changed: 2011-03-09
+#
+# The bilinear form for classical linear elasticity (Navier).
+# Compile this form with FFC: ffc -l dolfin Elasticity.ufl
+
+cell = triangle
+element = VectorElement("Lagrange", cell, 1)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+f = Coefficient(element)
+
+mu    = Constant(cell)
+lmbda = Constant(cell)
+
+def epsilon(v):
+    return 0.5*(grad(v) + grad(v).T)
+
+def sigma(v):
+    return 2.0*mu*epsilon(v) + lmbda*tr(epsilon(v))*Identity(v.geometric_dimension())
+
+a = inner(sigma(u), epsilon(v))*dx
+L = inner(f, v)*dx
+
diff --git a/demo/undocumented/contact-vi-tao/cpp/compile.log b/demo/undocumented/contact-vi-tao/cpp/compile.log
new file mode 100644
index 0000000..605f117
--- /dev/null
+++ b/demo/undocumented/contact-vi-tao/cpp/compile.log
@@ -0,0 +1,425 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Elasticity
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 2
+  Coefficients:           '[c_1, c_2]'
+  Coefficient names:      '[mu, lmbda]'
+  Unique elements:        'Vector<2 x CG1(?)>, R0(?)'
+  Unique sub elements:    'Vector<2 x CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Identity.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'Vector<2 x CG1(?)>'
+  Unique sub elements:    'Vector<2 x CG1(?)>, CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0215261 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.33333333],
+          [ 0.        ]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]],
+  
+         [[ 0.        ],
+          [ 0.33333333]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1': array([[1.0]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1': array([[1.0]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.33333333,  0.33333333,
+           0.33333333]]), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE0_C1_D10': 'FE0_C1_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE1': 'FE1', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D01': array([[-1.,  1.]]), 'FE1': array([[1.0]], dtype=object), 'FE0_C0': array([[ 0.33333333,  0.33333333,  0.33333333]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE1': ('FE1', (), False, True), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000912 seconds
+  Shape of reference tensor: (6, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0467238 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.00579596 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0997589 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000750065 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Elasticity.h.
+  
+Compiler stage 5 finished in 0.000864029 seconds.
+
+FFC finished in 0.175753 seconds.
diff --git a/demo/undocumented/contact-vi-tao/cpp/main.cpp b/demo/undocumented/contact-vi-tao/cpp/main.cpp
new file mode 100644
index 0000000..1749ad6
--- /dev/null
+++ b/demo/undocumented/contact-vi-tao/cpp/main.cpp
@@ -0,0 +1,133 @@
+// Copyright (C) 2012 Corrado Maurini
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Corrado Maurini 2013
+//
+// First added:  2012-09-03
+// Last changed: 2013-04-15
+//
+// This demo program uses of the interface to TAO solver for
+// variational inequalities to solve a contact mechanics problem in
+// FEnics.  The example considers a heavy elastic circle in a box of
+// the same diameter
+
+#include <dolfin.h>
+#include "Elasticity.h"
+
+using namespace dolfin;
+
+// Lower bound for displacement
+class LowerBound : public Expression
+{
+public:
+  LowerBound() : Expression(2) {}
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    const double xmin = -1.0 - DOLFIN_EPS;
+    const double ymin = -1.0;
+    values[0] = xmin - x[0];
+    values[1] = ymin - x[1];
+  }
+};
+
+// Upper bound for displacement
+class UpperBound : public Expression
+{
+public:
+  UpperBound() : Expression(2) {}
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    const double xmax = 1.0 + DOLFIN_EPS;
+    const double ymax = 1.0;
+    values[0] = xmax-x[0];
+    values[1] = ymax-x[1];
+  }
+};
+
+int main()
+{
+  #ifdef ENABLE_PETSC_TAO
+  // Read mesh
+  Mesh mesh("../circle_yplane.xml.gz");
+
+  // Create function space
+  Elasticity::FunctionSpace V(mesh);
+
+  // Create right-hand side
+  Constant f(0.0, -0.1);
+
+  // Set elasticity parameters
+  double E  = 10.0;
+  double nu = 0.3;
+  Constant mu(E / (2*(1 + nu)));
+  Constant lambda(E*nu / ((1 + nu)*(1 - 2*nu)));
+
+  // Define variational problem
+  Elasticity::BilinearForm a(V, V);
+  a.mu = mu; a.lmbda = lambda;
+  Elasticity::LinearForm L(V);
+  L.f = f;
+  Function usol(V);
+  Function Ulower(V); // Create a function
+  Function Uupper(V); // Create a function
+
+  // Assemble the matrix and vector for linear elasticity
+  PETScMatrix A;
+  PETScVector b;
+  assemble(A, a);
+  assemble(b, L);
+
+  // Interpolate expression for Upper bound
+  UpperBound xu_exp;
+  Function xu_f(V);
+  xu_f.interpolate(xu_exp);
+
+  // Interpolate expression for Upper bound
+  LowerBound xl_exp;
+  Function xl_f(V);
+  xl_f.interpolate(xl_exp);
+
+  // Create the PetscVector associated to the functions
+  PETScVector& x  = (*usol.vector()).down_cast<PETScVector>(); // Solution
+  PETScVector& xl = (*xl_f.vector()).down_cast<PETScVector>(); // Lower bound
+  PETScVector& xu = (*xu_f.vector()).down_cast<PETScVector>(); // Upper bound
+
+  // Solve the problem with the TAO Solver
+  TAOLinearBoundSolver TAOSolver("tron","stcg");
+
+  // Set some parameters
+  TAOSolver.parameters["monitor_convergence"]=true;
+  TAOSolver.parameters["report"]=true;
+  TAOSolver.parameters("krylov_solver")["monitor_convergence"]=false;
+
+  // Solve the problem
+  TAOSolver.solve(A, x, b, xl, xu);
+
+  // Plot solution
+  plot(usol, "Displacement", "displacement");
+
+  // Make plot windows interactive
+  interactive();
+
+  #else
+
+  cout << "This demo requires DOLFIN to be configured with TAO" << endl;
+
+  #endif
+
+ return 0;
+}
diff --git a/demo/undocumented/contact-vi-tao/python/demo_contact-vi-tao.py b/demo/undocumented/contact-vi-tao/python/demo_contact-vi-tao.py
new file mode 100644
index 0000000..f1e98b6
--- /dev/null
+++ b/demo/undocumented/contact-vi-tao/python/demo_contact-vi-tao.py
@@ -0,0 +1,104 @@
+"""This demo program uses of the interface to TAO solver for
+ variational inequalities to solve a contact mechanics problem in
+ FEnics.  The example considers a heavy elastic circle in a box of the
+ same size.
+ """
+# Copyright (C) 2012 Corrado Maurini
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Corrado Maurini 2013
+#
+# First added:  2012-09-03
+# Last changed: 2013-04-15
+#
+from dolfin import *
+
+if not has_petsc_tao():
+    print "DOLFIN must be compiled with TAO to run this demo."
+    exit(0)
+
+# Read mesh
+mesh = Mesh("../circle_yplane.xml.gz")
+
+# Create function space
+V = VectorFunctionSpace(mesh, "Lagrange", 1)
+
+# Create test and trial functions, and source term
+u, w = TrialFunction(V), TestFunction(V)
+
+# Elasticity parameters
+E, nu = 10.0, 0.3
+mu = Constant(E/(2.0*(1.0 + nu)))
+lmbda = Constant(E*nu/((1.0 + nu)*(1.0 -2.0*nu)))
+f = Constant((0.0, -0.1))
+
+# Stress and strains
+def eps(u):
+    return sym(grad(u))
+
+def sigma(epsilon):
+    return 2*mu*epsilon + lmbda*tr(epsilon)*Identity(w.geometric_dimension())
+
+# Weak formulation
+F = inner(sigma(eps(u)), eps(w))*dx - dot(f, w)*dx
+
+# Extract bilinear and linear forms from F
+a, L = lhs(F), rhs(F)
+
+# Assemble the linear system
+A, b = assemble_system(a, L)
+
+# Define the constraints for the displacement
+# The displacement u must be such that the current configuration x+u
+# does dot escape the xbox [xmin,xmax]x[umin,ymax]
+# This formulation is imprecise because it assumes
+# large displacements while the energy assumes linearization
+constraint_u = Expression( ("xmax-x[0]","ymax-x[1]"), xmax =  1.0, ymax =  1.0)
+constraint_l = Expression( ("xmin-x[0]","ymin-x[1]"), xmin = -1.0, ymin = -1.0)
+u_min = interpolate(constraint_l, V)
+u_max = interpolate(constraint_u, V)
+
+# Define the function to store the solution
+usol=Function(V)
+
+# Create the TAOLinearBoundSolver
+solver=TAOLinearBoundSolver("tron","stcg")
+
+# Set some parameters
+solver.parameters["monitor_convergence"]=True
+solver.parameters["report"]=True
+solver.parameters["krylov_solver"]["absolute_tolerance"] = 1e-7
+solver.parameters["krylov_solver"]["relative_tolerance"] = 1e-7
+solver.parameters["krylov_solver"]["monitor_convergence"] = False
+
+# Uncomment this line to see the available parameters
+info(solver.parameters, True)
+
+# Solve the problem
+solver.solve(A, usol.vector(), b , u_min.vector(), u_max.vector())
+
+# Save solution in VTK format
+file = File("displacement.pvd")
+file << usol
+
+# plot the stress
+stress = sigma(eps(usol))
+plot(tr(stress),title = "Trace of the stress tensor" ,mode = "color")
+
+# plot the current configuration
+plot(usol, mode = "displacement",wireframe=True, title="Displacement field")
+interactive()
diff --git a/demo/undocumented/curl-curl/cpp/CMakeLists.txt b/demo/undocumented/curl-curl/cpp/CMakeLists.txt
new file mode 100644
index 0000000..0a06862
--- /dev/null
+++ b/demo/undocumented/curl-curl/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_curl-curl)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/curl-curl/cpp/CurrentDensity.h b/demo/undocumented/curl-curl/cpp/CurrentDensity.h
new file mode 100644
index 0000000..2522370
--- /dev/null
+++ b/demo/undocumented/curl-curl/cpp/CurrentDensity.h
@@ -0,0 +1,8256 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __CURRENTDENSITY_H
+#define __CURRENTDENSITY_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class currentdensity_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  currentdensity_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Nedelec 1st kind H(curl)', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      static const double coefficients1[4] = \
+      {-0.288675134594813, 0.0, 0.0, -0.223606797749979};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {-0.288675134594812, 0.0, 0.0, -0.223606797749979};
+      
+      static const double coefficients1[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {-0.288675134594813, 0.0, -0.210818510677892, 0.074535599249993};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      static const double coefficients2[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      static const double coefficients2[4] = \
+      {0.577350269189626, -0.182574185835056, -0.105409255338946, 0.149071198499986};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.0745355992499929};
+      
+      static const double coefficients1[4] = \
+      {0.577350269189626, -0.182574185835055, 0.105409255338946, -0.149071198499986};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.577350269189626, 0.0, -0.210818510677892, -0.149071198499986};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.0745355992499929};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      static const double coefficients1[4] = \
+      {-0.288675134594813, 0.0, 0.0, -0.223606797749979};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {-0.288675134594812, 0.0, 0.0, -0.223606797749979};
+      
+      static const double coefficients1[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {-0.288675134594813, 0.0, -0.210818510677892, 0.074535599249993};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      static const double coefficients2[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      static const double coefficients2[4] = \
+      {0.577350269189626, -0.182574185835056, -0.105409255338946, 0.149071198499986};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.0745355992499929};
+      
+      static const double coefficients1[4] = \
+      {0.577350269189626, -0.182574185835055, 0.105409255338946, -0.149071198499986};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.577350269189626, 0.0, -0.210818510677892, -0.149071198499986};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.0745355992499929};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    
+    double result;
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]) + (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+      return result;
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]) + (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+      return result;
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]) + (J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]);
+      return result;
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      result = (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+      return result;
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      result = (J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]);
+      return result;
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]);
+      return result;
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    
+    double result;
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]) + (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+    values[0] = result;
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]) + (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+    values[1] = result;
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]) + (J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]);
+    values[2] = result;
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    result = (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+    values[3] = result;
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    result = (J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]);
+    values[4] = result;
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]);
+    values[5] = result;
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[3]*K[6] + dof_values[4]*K[3] + dof_values[5]*K[0];
+    vertex_values[3] = dof_values[1]*K[6] + dof_values[2]*K[3] + dof_values[5]*(K[0] + K[3] + K[6]);
+    vertex_values[6] = dof_values[0]*K[6] + dof_values[2]*(K[0]*(-1.0)) + dof_values[4]*(K[0] + K[3] + K[6]);
+    vertex_values[9] = dof_values[0]*(K[3]*(-1.0)) + dof_values[1]*(K[0]*(-1.0)) + dof_values[3]*(K[0] + K[3] + K[6]);
+    vertex_values[1] = dof_values[3]*K[7] + dof_values[4]*K[4] + dof_values[5]*K[1];
+    vertex_values[4] = dof_values[1]*K[7] + dof_values[2]*K[4] + dof_values[5]*(K[1] + K[4] + K[7]);
+    vertex_values[7] = dof_values[0]*K[7] + dof_values[2]*(K[1]*(-1.0)) + dof_values[4]*(K[1] + K[4] + K[7]);
+    vertex_values[10] = dof_values[0]*(K[4]*(-1.0)) + dof_values[1]*(K[1]*(-1.0)) + dof_values[3]*(K[1] + K[4] + K[7]);
+    vertex_values[2] = dof_values[3]*K[8] + dof_values[4]*K[5] + dof_values[5]*K[2];
+    vertex_values[5] = dof_values[1]*K[8] + dof_values[2]*K[5] + dof_values[5]*(K[2] + K[5] + K[8]);
+    vertex_values[8] = dof_values[0]*K[8] + dof_values[2]*(K[2]*(-1.0)) + dof_values[4]*(K[2] + K[5] + K[8]);
+    vertex_values[11] = dof_values[0]*(K[5]*(-1.0)) + dof_values[1]*(K[2]*(-1.0)) + dof_values[3]*(K[2] + K[5] + K[8]);
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new currentdensity_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class currentdensity_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  currentdensity_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new currentdensity_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class currentdensity_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  currentdensity_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 9:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[10] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[11] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[4];
+    vertex_values[4] = dof_values[5];
+    vertex_values[7] = dof_values[6];
+    vertex_values[10] = dof_values[7];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[8];
+    vertex_values[5] = dof_values[9];
+    vertex_values[8] = dof_values[10];
+    vertex_values[11] = dof_values[11];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new currentdensity_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new currentdensity_finite_element_1();
+        break;
+      }
+    case 2:
+      {
+        return new currentdensity_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new currentdensity_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class currentdensity_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  currentdensity_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Nedelec 1st kind H(curl)', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[1][0];
+    dofs[1] = c.entity_indices[1][1];
+    dofs[2] = c.entity_indices[1][2];
+    dofs[3] = c.entity_indices[1][3];
+    dofs[4] = c.entity_indices[1][4];
+    dofs[5] = c.entity_indices[1][5];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 3;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 1;
+      dofs[1] = 3;
+      dofs[2] = 5;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 2;
+      dofs[1] = 4;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[1][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[1][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[1][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[2][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[2][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[2][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[3][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new currentdensity_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class currentdensity_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  currentdensity_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new currentdensity_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class currentdensity_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  currentdensity_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[0][0];
+    dofs[5] = offset + c.entity_indices[0][1];
+    dofs[6] = offset + c.entity_indices[0][2];
+    dofs[7] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[8] = offset + c.entity_indices[0][0];
+    dofs[9] = offset + c.entity_indices[0][1];
+    dofs[10] = offset + c.entity_indices[0][2];
+    dofs[11] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 9;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 11;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 10;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 4;
+        dofs[2] = 8;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 5;
+        dofs[2] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 6;
+        dofs[2] = 10;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 7;
+        dofs[2] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = vertex_coordinates[0];
+    dof_coordinates[4][1] = vertex_coordinates[1];
+    dof_coordinates[4][2] = vertex_coordinates[2];
+    dof_coordinates[5][0] = vertex_coordinates[3];
+    dof_coordinates[5][1] = vertex_coordinates[4];
+    dof_coordinates[5][2] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[6];
+    dof_coordinates[6][1] = vertex_coordinates[7];
+    dof_coordinates[6][2] = vertex_coordinates[8];
+    dof_coordinates[7][0] = vertex_coordinates[9];
+    dof_coordinates[7][1] = vertex_coordinates[10];
+    dof_coordinates[7][2] = vertex_coordinates[11];
+    dof_coordinates[8][0] = vertex_coordinates[0];
+    dof_coordinates[8][1] = vertex_coordinates[1];
+    dof_coordinates[8][2] = vertex_coordinates[2];
+    dof_coordinates[9][0] = vertex_coordinates[3];
+    dof_coordinates[9][1] = vertex_coordinates[4];
+    dof_coordinates[9][2] = vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[6];
+    dof_coordinates[10][1] = vertex_coordinates[7];
+    dof_coordinates[10][2] = vertex_coordinates[8];
+    dof_coordinates[11][0] = vertex_coordinates[9];
+    dof_coordinates[11][1] = vertex_coordinates[10];
+    dof_coordinates[11][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new currentdensity_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new currentdensity_dofmap_1();
+        break;
+      }
+    case 2:
+      {
+        return new currentdensity_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new currentdensity_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class currentdensity_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  currentdensity_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 24
+    // Total number of operations (multiply-add pairs):                  27
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_;
+    A[1] = 0.0083333333333333*G0_;
+    A[2] = 0.0083333333333333*G0_;
+    A[3] = 0.0083333333333333*G0_;
+    A[4] = 0.0;
+    A[5] = 0.0;
+    A[6] = 0.0;
+    A[7] = 0.0;
+    A[8] = 0.0;
+    A[9] = 0.0;
+    A[10] = 0.0;
+    A[11] = 0.0;
+    A[12] = 0.0083333333333333*G0_;
+    A[13] = 0.0166666666666667*G0_;
+    A[14] = 0.00833333333333337*G0_;
+    A[15] = 0.00833333333333337*G0_;
+    A[16] = 0.0;
+    A[17] = 0.0;
+    A[18] = 0.0;
+    A[19] = 0.0;
+    A[20] = 0.0;
+    A[21] = 0.0;
+    A[22] = 0.0;
+    A[23] = 0.0;
+    A[24] = 0.0083333333333333*G0_;
+    A[25] = 0.00833333333333337*G0_;
+    A[26] = 0.0166666666666667*G0_;
+    A[27] = 0.00833333333333337*G0_;
+    A[28] = 0.0;
+    A[29] = 0.0;
+    A[30] = 0.0;
+    A[31] = 0.0;
+    A[32] = 0.0;
+    A[33] = 0.0;
+    A[34] = 0.0;
+    A[35] = 0.0;
+    A[36] = 0.0083333333333333*G0_;
+    A[37] = 0.00833333333333337*G0_;
+    A[38] = 0.00833333333333337*G0_;
+    A[39] = 0.0166666666666667*G0_;
+    A[40] = 0.0;
+    A[41] = 0.0;
+    A[42] = 0.0;
+    A[43] = 0.0;
+    A[44] = 0.0;
+    A[45] = 0.0;
+    A[46] = 0.0;
+    A[47] = 0.0;
+    A[48] = 0.0;
+    A[49] = 0.0;
+    A[50] = 0.0;
+    A[51] = 0.0;
+    A[52] = 0.0166666666666666*G0_;
+    A[53] = 0.0083333333333333*G0_;
+    A[54] = 0.0083333333333333*G0_;
+    A[55] = 0.0083333333333333*G0_;
+    A[56] = 0.0;
+    A[57] = 0.0;
+    A[58] = 0.0;
+    A[59] = 0.0;
+    A[60] = 0.0;
+    A[61] = 0.0;
+    A[62] = 0.0;
+    A[63] = 0.0;
+    A[64] = 0.0083333333333333*G0_;
+    A[65] = 0.0166666666666667*G0_;
+    A[66] = 0.00833333333333337*G0_;
+    A[67] = 0.00833333333333337*G0_;
+    A[68] = 0.0;
+    A[69] = 0.0;
+    A[70] = 0.0;
+    A[71] = 0.0;
+    A[72] = 0.0;
+    A[73] = 0.0;
+    A[74] = 0.0;
+    A[75] = 0.0;
+    A[76] = 0.0083333333333333*G0_;
+    A[77] = 0.00833333333333337*G0_;
+    A[78] = 0.0166666666666667*G0_;
+    A[79] = 0.00833333333333337*G0_;
+    A[80] = 0.0;
+    A[81] = 0.0;
+    A[82] = 0.0;
+    A[83] = 0.0;
+    A[84] = 0.0;
+    A[85] = 0.0;
+    A[86] = 0.0;
+    A[87] = 0.0;
+    A[88] = 0.0083333333333333*G0_;
+    A[89] = 0.00833333333333337*G0_;
+    A[90] = 0.00833333333333337*G0_;
+    A[91] = 0.0166666666666667*G0_;
+    A[92] = 0.0;
+    A[93] = 0.0;
+    A[94] = 0.0;
+    A[95] = 0.0;
+    A[96] = 0.0;
+    A[97] = 0.0;
+    A[98] = 0.0;
+    A[99] = 0.0;
+    A[100] = 0.0;
+    A[101] = 0.0;
+    A[102] = 0.0;
+    A[103] = 0.0;
+    A[104] = 0.0166666666666666*G0_;
+    A[105] = 0.0083333333333333*G0_;
+    A[106] = 0.0083333333333333*G0_;
+    A[107] = 0.0083333333333333*G0_;
+    A[108] = 0.0;
+    A[109] = 0.0;
+    A[110] = 0.0;
+    A[111] = 0.0;
+    A[112] = 0.0;
+    A[113] = 0.0;
+    A[114] = 0.0;
+    A[115] = 0.0;
+    A[116] = 0.0083333333333333*G0_;
+    A[117] = 0.0166666666666667*G0_;
+    A[118] = 0.00833333333333337*G0_;
+    A[119] = 0.00833333333333337*G0_;
+    A[120] = 0.0;
+    A[121] = 0.0;
+    A[122] = 0.0;
+    A[123] = 0.0;
+    A[124] = 0.0;
+    A[125] = 0.0;
+    A[126] = 0.0;
+    A[127] = 0.0;
+    A[128] = 0.0083333333333333*G0_;
+    A[129] = 0.00833333333333337*G0_;
+    A[130] = 0.0166666666666667*G0_;
+    A[131] = 0.00833333333333337*G0_;
+    A[132] = 0.0;
+    A[133] = 0.0;
+    A[134] = 0.0;
+    A[135] = 0.0;
+    A[136] = 0.0;
+    A[137] = 0.0;
+    A[138] = 0.0;
+    A[139] = 0.0;
+    A[140] = 0.0083333333333333*G0_;
+    A[141] = 0.00833333333333337*G0_;
+    A[142] = 0.00833333333333337*G0_;
+    A[143] = 0.0166666666666667*G0_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class currentdensity_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  currentdensity_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    216
+    // Number of operations (multiply-add pairs) for tensor contraction: 426
+    // Total number of operations (multiply-add pairs):                  645
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_1_2 = det*w[0][0]*K[4]*K[6]*(1.0);
+    const double G0_0_2_1 = det*w[0][0]*K[7]*K[3]*(1.0);
+    const double G0_1_0_2 = det*w[0][1]*K[1]*K[6]*(1.0);
+    const double G0_1_2_0 = det*w[0][1]*K[7]*K[0]*(1.0);
+    const double G0_2_0_1 = det*w[0][2]*K[1]*K[3]*(1.0);
+    const double G0_2_1_0 = det*w[0][2]*K[4]*K[0]*(1.0);
+    const double G0_3_0_2 = det*w[0][3]*K[1]*K[6]*(1.0);
+    const double G0_3_1_2 = det*w[0][3]*K[4]*K[6]*(1.0);
+    const double G0_3_2_0 = det*w[0][3]*K[7]*K[0]*(1.0);
+    const double G0_3_2_1 = det*w[0][3]*K[7]*K[3]*(1.0);
+    const double G0_4_0_1 = det*w[0][4]*K[1]*K[3]*(1.0);
+    const double G0_4_1_0 = det*w[0][4]*K[4]*K[0]*(1.0);
+    const double G0_4_1_2 = det*w[0][4]*K[4]*K[6]*(1.0);
+    const double G0_4_2_1 = det*w[0][4]*K[7]*K[3]*(1.0);
+    const double G0_5_0_1 = det*w[0][5]*K[1]*K[3]*(1.0);
+    const double G0_5_0_2 = det*w[0][5]*K[1]*K[6]*(1.0);
+    const double G0_5_1_0 = det*w[0][5]*K[4]*K[0]*(1.0);
+    const double G0_5_2_0 = det*w[0][5]*K[7]*K[0]*(1.0);
+    const double G1_0_1_2 = det*w[0][0]*K[3]*K[7]*(1.0);
+    const double G1_0_2_1 = det*w[0][0]*K[6]*K[4]*(1.0);
+    const double G1_1_0_2 = det*w[0][1]*K[0]*K[7]*(1.0);
+    const double G1_1_2_0 = det*w[0][1]*K[6]*K[1]*(1.0);
+    const double G1_2_0_1 = det*w[0][2]*K[0]*K[4]*(1.0);
+    const double G1_2_1_0 = det*w[0][2]*K[3]*K[1]*(1.0);
+    const double G1_3_0_2 = det*w[0][3]*K[0]*K[7]*(1.0);
+    const double G1_3_1_2 = det*w[0][3]*K[3]*K[7]*(1.0);
+    const double G1_3_2_0 = det*w[0][3]*K[6]*K[1]*(1.0);
+    const double G1_3_2_1 = det*w[0][3]*K[6]*K[4]*(1.0);
+    const double G1_4_0_1 = det*w[0][4]*K[0]*K[4]*(1.0);
+    const double G1_4_1_0 = det*w[0][4]*K[3]*K[1]*(1.0);
+    const double G1_4_1_2 = det*w[0][4]*K[3]*K[7]*(1.0);
+    const double G1_4_2_1 = det*w[0][4]*K[6]*K[4]*(1.0);
+    const double G1_5_0_1 = det*w[0][5]*K[0]*K[4]*(1.0);
+    const double G1_5_0_2 = det*w[0][5]*K[0]*K[7]*(1.0);
+    const double G1_5_1_0 = det*w[0][5]*K[3]*K[1]*(1.0);
+    const double G1_5_2_0 = det*w[0][5]*K[6]*K[1]*(1.0);
+    const double G2_0_1_2 = det*w[0][0]*K[5]*K[7]*(1.0);
+    const double G2_0_2_1 = det*w[0][0]*K[8]*K[4]*(1.0);
+    const double G2_1_0_2 = det*w[0][1]*K[2]*K[7]*(1.0);
+    const double G2_1_2_0 = det*w[0][1]*K[8]*K[1]*(1.0);
+    const double G2_2_0_1 = det*w[0][2]*K[2]*K[4]*(1.0);
+    const double G2_2_1_0 = det*w[0][2]*K[5]*K[1]*(1.0);
+    const double G2_3_0_2 = det*w[0][3]*K[2]*K[7]*(1.0);
+    const double G2_3_1_2 = det*w[0][3]*K[5]*K[7]*(1.0);
+    const double G2_3_2_0 = det*w[0][3]*K[8]*K[1]*(1.0);
+    const double G2_3_2_1 = det*w[0][3]*K[8]*K[4]*(1.0);
+    const double G2_4_0_1 = det*w[0][4]*K[2]*K[4]*(1.0);
+    const double G2_4_1_0 = det*w[0][4]*K[5]*K[1]*(1.0);
+    const double G2_4_1_2 = det*w[0][4]*K[5]*K[7]*(1.0);
+    const double G2_4_2_1 = det*w[0][4]*K[8]*K[4]*(1.0);
+    const double G2_5_0_1 = det*w[0][5]*K[2]*K[4]*(1.0);
+    const double G2_5_0_2 = det*w[0][5]*K[2]*K[7]*(1.0);
+    const double G2_5_1_0 = det*w[0][5]*K[5]*K[1]*(1.0);
+    const double G2_5_2_0 = det*w[0][5]*K[8]*K[1]*(1.0);
+    const double G3_0_1_2 = det*w[0][0]*K[4]*K[8]*(1.0);
+    const double G3_0_2_1 = det*w[0][0]*K[7]*K[5]*(1.0);
+    const double G3_1_0_2 = det*w[0][1]*K[1]*K[8]*(1.0);
+    const double G3_1_2_0 = det*w[0][1]*K[7]*K[2]*(1.0);
+    const double G3_2_0_1 = det*w[0][2]*K[1]*K[5]*(1.0);
+    const double G3_2_1_0 = det*w[0][2]*K[4]*K[2]*(1.0);
+    const double G3_3_0_2 = det*w[0][3]*K[1]*K[8]*(1.0);
+    const double G3_3_1_2 = det*w[0][3]*K[4]*K[8]*(1.0);
+    const double G3_3_2_0 = det*w[0][3]*K[7]*K[2]*(1.0);
+    const double G3_3_2_1 = det*w[0][3]*K[7]*K[5]*(1.0);
+    const double G3_4_0_1 = det*w[0][4]*K[1]*K[5]*(1.0);
+    const double G3_4_1_0 = det*w[0][4]*K[4]*K[2]*(1.0);
+    const double G3_4_1_2 = det*w[0][4]*K[4]*K[8]*(1.0);
+    const double G3_4_2_1 = det*w[0][4]*K[7]*K[5]*(1.0);
+    const double G3_5_0_1 = det*w[0][5]*K[1]*K[5]*(1.0);
+    const double G3_5_0_2 = det*w[0][5]*K[1]*K[8]*(1.0);
+    const double G3_5_1_0 = det*w[0][5]*K[4]*K[2]*(1.0);
+    const double G3_5_2_0 = det*w[0][5]*K[7]*K[2]*(1.0);
+    const double G4_0_1_2 = det*w[0][0]*K[3]*K[8]*(1.0);
+    const double G4_0_2_1 = det*w[0][0]*K[6]*K[5]*(1.0);
+    const double G4_1_0_2 = det*w[0][1]*K[0]*K[8]*(1.0);
+    const double G4_1_2_0 = det*w[0][1]*K[6]*K[2]*(1.0);
+    const double G4_2_0_1 = det*w[0][2]*K[0]*K[5]*(1.0);
+    const double G4_2_1_0 = det*w[0][2]*K[3]*K[2]*(1.0);
+    const double G4_3_0_2 = det*w[0][3]*K[0]*K[8]*(1.0);
+    const double G4_3_1_2 = det*w[0][3]*K[3]*K[8]*(1.0);
+    const double G4_3_2_0 = det*w[0][3]*K[6]*K[2]*(1.0);
+    const double G4_3_2_1 = det*w[0][3]*K[6]*K[5]*(1.0);
+    const double G4_4_0_1 = det*w[0][4]*K[0]*K[5]*(1.0);
+    const double G4_4_1_0 = det*w[0][4]*K[3]*K[2]*(1.0);
+    const double G4_4_1_2 = det*w[0][4]*K[3]*K[8]*(1.0);
+    const double G4_4_2_1 = det*w[0][4]*K[6]*K[5]*(1.0);
+    const double G4_5_0_1 = det*w[0][5]*K[0]*K[5]*(1.0);
+    const double G4_5_0_2 = det*w[0][5]*K[0]*K[8]*(1.0);
+    const double G4_5_1_0 = det*w[0][5]*K[3]*K[2]*(1.0);
+    const double G4_5_2_0 = det*w[0][5]*K[6]*K[2]*(1.0);
+    const double G5_0_1_2 = det*w[0][0]*K[5]*K[6]*(1.0);
+    const double G5_0_2_1 = det*w[0][0]*K[8]*K[3]*(1.0);
+    const double G5_1_0_2 = det*w[0][1]*K[2]*K[6]*(1.0);
+    const double G5_1_2_0 = det*w[0][1]*K[8]*K[0]*(1.0);
+    const double G5_2_0_1 = det*w[0][2]*K[2]*K[3]*(1.0);
+    const double G5_2_1_0 = det*w[0][2]*K[5]*K[0]*(1.0);
+    const double G5_3_0_2 = det*w[0][3]*K[2]*K[6]*(1.0);
+    const double G5_3_1_2 = det*w[0][3]*K[5]*K[6]*(1.0);
+    const double G5_3_2_0 = det*w[0][3]*K[8]*K[0]*(1.0);
+    const double G5_3_2_1 = det*w[0][3]*K[8]*K[3]*(1.0);
+    const double G5_4_0_1 = det*w[0][4]*K[2]*K[3]*(1.0);
+    const double G5_4_1_0 = det*w[0][4]*K[5]*K[0]*(1.0);
+    const double G5_4_1_2 = det*w[0][4]*K[5]*K[6]*(1.0);
+    const double G5_4_2_1 = det*w[0][4]*K[8]*K[3]*(1.0);
+    const double G5_5_0_1 = det*w[0][5]*K[2]*K[3]*(1.0);
+    const double G5_5_0_2 = det*w[0][5]*K[2]*K[6]*(1.0);
+    const double G5_5_1_0 = det*w[0][5]*K[5]*K[0]*(1.0);
+    const double G5_5_2_0 = det*w[0][5]*K[8]*K[0]*(1.0);
+    
+    // Compute element tensor
+    A[0] = -0.0416666666666667*G2_0_1_2 + 0.0416666666666667*G2_0_2_1 - 0.0416666666666666*G2_1_0_2 + 0.0416666666666667*G2_1_2_0 - 0.0416666666666667*G2_2_0_1 + 0.0416666666666667*G2_2_1_0 + 0.0416666666666666*G2_3_0_2 + 0.0416666666666666*G2_3_1_2 - 0.0416666666666667*G2_3_2_0 - 0.0416666666666667*G2_3_2_1 + 0.0416666666666667*G2_4_0_1 - 0.0416666666666667*G2_4_1_0 - 0.0416666666666667*G2_4_1_2 + 0.0416666666666667*G2_4_2_1 - 0.0416666666666667*G2_5_0_1 - 0.0416666666666667*G2_5_0_2 + 0.0416666666666667*G2_5_1_0 + 0.0416666666666667*G2_5_2_0 + 0.0416666666666667*G3_0_1_2 - 0.0416666666666667*G3_0_2_1 + 0.0416666666666666*G3_1_0_2 - 0.0416666666666667*G3_1_2_0 + 0.0416666666666667*G3_2_0_1 - 0.0416666666666667*G3_2_1_0 - 0.0416666666666666*G3_3_0_2 - 0.0416666666666666*G3_3_1_2 + 0.0416666666666667*G3_3_2_0 + 0.0416666666666667*G3_3_2_1 - 0.0416666666666667*G3_4_0_1 + 0.0416666666666667*G3_4_1_0 + 0.0416666666666667*G3_4_1_2 - 0.0416666666666667*G3_4_2_1 + 0.0416666666666667*G3_5_0_1 + 0.0416666666666667*G3_5_0_2 - 0.0416666666666667*G3_5_1_0 - 0.0416666666666667*G3_5_2_0;
+    A[1] = -0.0416666666666666*G2_0_1_2 + 0.0416666666666667*G2_0_2_1 - 0.0416666666666666*G2_1_0_2 + 0.0416666666666667*G2_1_2_0 - 0.0416666666666667*G2_2_0_1 + 0.0416666666666667*G2_2_1_0 + 0.0416666666666666*G2_3_0_2 + 0.0416666666666666*G2_3_1_2 - 0.0416666666666667*G2_3_2_0 - 0.0416666666666667*G2_3_2_1 + 0.0416666666666667*G2_4_0_1 - 0.0416666666666667*G2_4_1_0 - 0.0416666666666667*G2_4_1_2 + 0.0416666666666667*G2_4_2_1 - 0.0416666666666667*G2_5_0_1 - 0.0416666666666666*G2_5_0_2 + 0.0416666666666667*G2_5_1_0 + 0.0416666666666667*G2_5_2_0 + 0.0416666666666666*G3_0_1_2 - 0.0416666666666667*G3_0_2_1 + 0.0416666666666666*G3_1_0_2 - 0.0416666666666667*G3_1_2_0 + 0.0416666666666667*G3_2_0_1 - 0.0416666666666667*G3_2_1_0 - 0.0416666666666666*G3_3_0_2 - 0.0416666666666666*G3_3_1_2 + 0.0416666666666667*G3_3_2_0 + 0.0416666666666667*G3_3_2_1 - 0.0416666666666667*G3_4_0_1 + 0.0416666666666667*G3_4_1_0 + 0.0416666666666667*G3_4_1_2 - 0.0416666666666667*G3_4_2_1 + 0.0416666666666667*G3_5_0_1 + 0.0416666666666666*G3_5_0_2 - 0.0416666666666667*G3_5_1_0 - 0.0416666666666667*G3_5_2_0;
+    A[2] = -0.0416666666666666*G2_0_1_2 + 0.0416666666666667*G2_0_2_1 - 0.0416666666666666*G2_1_0_2 + 0.0416666666666667*G2_1_2_0 - 0.0416666666666667*G2_2_0_1 + 0.0416666666666667*G2_2_1_0 + 0.0416666666666666*G2_3_0_2 + 0.0416666666666666*G2_3_1_2 - 0.0416666666666667*G2_3_2_0 - 0.0416666666666667*G2_3_2_1 + 0.0416666666666667*G2_4_0_1 - 0.0416666666666667*G2_4_1_0 - 0.0416666666666667*G2_4_1_2 + 0.0416666666666667*G2_4_2_1 - 0.0416666666666667*G2_5_0_1 - 0.0416666666666666*G2_5_0_2 + 0.0416666666666667*G2_5_1_0 + 0.0416666666666667*G2_5_2_0 + 0.0416666666666666*G3_0_1_2 - 0.0416666666666667*G3_0_2_1 + 0.0416666666666666*G3_1_0_2 - 0.0416666666666667*G3_1_2_0 + 0.0416666666666667*G3_2_0_1 - 0.0416666666666667*G3_2_1_0 - 0.0416666666666666*G3_3_0_2 - 0.0416666666666666*G3_3_1_2 + 0.0416666666666667*G3_3_2_0 + 0.0416666666666667*G3_3_2_1 - 0.0416666666666667*G3_4_0_1 + 0.0416666666666667*G3_4_1_0 + 0.0416666666666667*G3_4_1_2 - 0.0416666666666667*G3_4_2_1 + 0.0416666666666667*G3_5_0_1 + 0.0416666666666666*G3_5_0_2 - 0.0416666666666667*G3_5_1_0 - 0.0416666666666667*G3_5_2_0;
+    A[3] = -0.0416666666666666*G2_0_1_2 + 0.0416666666666667*G2_0_2_1 - 0.0416666666666666*G2_1_0_2 + 0.0416666666666667*G2_1_2_0 - 0.0416666666666667*G2_2_0_1 + 0.0416666666666667*G2_2_1_0 + 0.0416666666666666*G2_3_0_2 + 0.0416666666666666*G2_3_1_2 - 0.0416666666666667*G2_3_2_0 - 0.0416666666666667*G2_3_2_1 + 0.0416666666666667*G2_4_0_1 - 0.0416666666666667*G2_4_1_0 - 0.0416666666666667*G2_4_1_2 + 0.0416666666666667*G2_4_2_1 - 0.0416666666666667*G2_5_0_1 - 0.0416666666666666*G2_5_0_2 + 0.0416666666666667*G2_5_1_0 + 0.0416666666666667*G2_5_2_0 + 0.0416666666666666*G3_0_1_2 - 0.0416666666666667*G3_0_2_1 + 0.0416666666666666*G3_1_0_2 - 0.0416666666666667*G3_1_2_0 + 0.0416666666666667*G3_2_0_1 - 0.0416666666666667*G3_2_1_0 - 0.0416666666666666*G3_3_0_2 - 0.0416666666666666*G3_3_1_2 + 0.0416666666666667*G3_3_2_0 + 0.0416666666666667*G3_3_2_1 - 0.0416666666666667*G3_4_0_1 + 0.0416666666666667*G3_4_1_0 + 0.0416666666666667*G3_4_1_2 - 0.0416666666666667*G3_4_2_1 + 0.0416666666666667*G3_5_0_1 + 0.0416666666666666*G3_5_0_2 - 0.0416666666666667*G3_5_1_0 - 0.0416666666666667*G3_5_2_0;
+    A[4] = -0.0416666666666667*G4_0_1_2 + 0.0416666666666667*G4_0_2_1 - 0.0416666666666666*G4_1_0_2 + 0.0416666666666667*G4_1_2_0 - 0.0416666666666667*G4_2_0_1 + 0.0416666666666667*G4_2_1_0 + 0.0416666666666666*G4_3_0_2 + 0.0416666666666666*G4_3_1_2 - 0.0416666666666667*G4_3_2_0 - 0.0416666666666667*G4_3_2_1 + 0.0416666666666667*G4_4_0_1 - 0.0416666666666667*G4_4_1_0 - 0.0416666666666667*G4_4_1_2 + 0.0416666666666667*G4_4_2_1 - 0.0416666666666667*G4_5_0_1 - 0.0416666666666667*G4_5_0_2 + 0.0416666666666667*G4_5_1_0 + 0.0416666666666667*G4_5_2_0 + 0.0416666666666667*G5_0_1_2 - 0.0416666666666667*G5_0_2_1 + 0.0416666666666666*G5_1_0_2 - 0.0416666666666667*G5_1_2_0 + 0.0416666666666667*G5_2_0_1 - 0.0416666666666667*G5_2_1_0 - 0.0416666666666666*G5_3_0_2 - 0.0416666666666666*G5_3_1_2 + 0.0416666666666667*G5_3_2_0 + 0.0416666666666667*G5_3_2_1 - 0.0416666666666667*G5_4_0_1 + 0.0416666666666667*G5_4_1_0 + 0.0416666666666667*G5_4_1_2 - 0.0416666666666667*G5_4_2_1 + 0.0416666666666667*G5_5_0_1 + 0.0416666666666667*G5_5_0_2 - 0.0416666666666667*G5_5_1_0 - 0.0416666666666667*G5_5_2_0;
+    A[5] = -0.0416666666666666*G4_0_1_2 + 0.0416666666666667*G4_0_2_1 - 0.0416666666666666*G4_1_0_2 + 0.0416666666666667*G4_1_2_0 - 0.0416666666666667*G4_2_0_1 + 0.0416666666666667*G4_2_1_0 + 0.0416666666666666*G4_3_0_2 + 0.0416666666666666*G4_3_1_2 - 0.0416666666666667*G4_3_2_0 - 0.0416666666666667*G4_3_2_1 + 0.0416666666666667*G4_4_0_1 - 0.0416666666666667*G4_4_1_0 - 0.0416666666666667*G4_4_1_2 + 0.0416666666666667*G4_4_2_1 - 0.0416666666666667*G4_5_0_1 - 0.0416666666666666*G4_5_0_2 + 0.0416666666666667*G4_5_1_0 + 0.0416666666666667*G4_5_2_0 + 0.0416666666666666*G5_0_1_2 - 0.0416666666666667*G5_0_2_1 + 0.0416666666666666*G5_1_0_2 - 0.0416666666666667*G5_1_2_0 + 0.0416666666666667*G5_2_0_1 - 0.0416666666666667*G5_2_1_0 - 0.0416666666666666*G5_3_0_2 - 0.0416666666666666*G5_3_1_2 + 0.0416666666666667*G5_3_2_0 + 0.0416666666666667*G5_3_2_1 - 0.0416666666666667*G5_4_0_1 + 0.0416666666666667*G5_4_1_0 + 0.0416666666666667*G5_4_1_2 - 0.0416666666666667*G5_4_2_1 + 0.0416666666666667*G5_5_0_1 + 0.0416666666666666*G5_5_0_2 - 0.0416666666666667*G5_5_1_0 - 0.0416666666666667*G5_5_2_0;
+    A[6] = -0.0416666666666666*G4_0_1_2 + 0.0416666666666667*G4_0_2_1 - 0.0416666666666666*G4_1_0_2 + 0.0416666666666667*G4_1_2_0 - 0.0416666666666667*G4_2_0_1 + 0.0416666666666667*G4_2_1_0 + 0.0416666666666666*G4_3_0_2 + 0.0416666666666666*G4_3_1_2 - 0.0416666666666667*G4_3_2_0 - 0.0416666666666667*G4_3_2_1 + 0.0416666666666667*G4_4_0_1 - 0.0416666666666667*G4_4_1_0 - 0.0416666666666667*G4_4_1_2 + 0.0416666666666667*G4_4_2_1 - 0.0416666666666667*G4_5_0_1 - 0.0416666666666666*G4_5_0_2 + 0.0416666666666667*G4_5_1_0 + 0.0416666666666667*G4_5_2_0 + 0.0416666666666666*G5_0_1_2 - 0.0416666666666667*G5_0_2_1 + 0.0416666666666666*G5_1_0_2 - 0.0416666666666667*G5_1_2_0 + 0.0416666666666667*G5_2_0_1 - 0.0416666666666667*G5_2_1_0 - 0.0416666666666666*G5_3_0_2 - 0.0416666666666666*G5_3_1_2 + 0.0416666666666667*G5_3_2_0 + 0.0416666666666667*G5_3_2_1 - 0.0416666666666667*G5_4_0_1 + 0.0416666666666667*G5_4_1_0 + 0.0416666666666667*G5_4_1_2 - 0.0416666666666667*G5_4_2_1 + 0.0416666666666667*G5_5_0_1 + 0.0416666666666666*G5_5_0_2 - 0.0416666666666667*G5_5_1_0 - 0.0416666666666667*G5_5_2_0;
+    A[7] = -0.0416666666666666*G4_0_1_2 + 0.0416666666666667*G4_0_2_1 - 0.0416666666666666*G4_1_0_2 + 0.0416666666666667*G4_1_2_0 - 0.0416666666666667*G4_2_0_1 + 0.0416666666666667*G4_2_1_0 + 0.0416666666666666*G4_3_0_2 + 0.0416666666666666*G4_3_1_2 - 0.0416666666666667*G4_3_2_0 - 0.0416666666666667*G4_3_2_1 + 0.0416666666666667*G4_4_0_1 - 0.0416666666666667*G4_4_1_0 - 0.0416666666666667*G4_4_1_2 + 0.0416666666666667*G4_4_2_1 - 0.0416666666666667*G4_5_0_1 - 0.0416666666666666*G4_5_0_2 + 0.0416666666666667*G4_5_1_0 + 0.0416666666666667*G4_5_2_0 + 0.0416666666666666*G5_0_1_2 - 0.0416666666666667*G5_0_2_1 + 0.0416666666666666*G5_1_0_2 - 0.0416666666666667*G5_1_2_0 + 0.0416666666666667*G5_2_0_1 - 0.0416666666666667*G5_2_1_0 - 0.0416666666666666*G5_3_0_2 - 0.0416666666666666*G5_3_1_2 + 0.0416666666666667*G5_3_2_0 + 0.0416666666666667*G5_3_2_1 - 0.0416666666666667*G5_4_0_1 + 0.0416666666666667*G5_4_1_0 + 0.0416666666666667*G5_4_1_2 - 0.0416666666666667*G5_4_2_1 + 0.0416666666666667*G5_5_0_1 + 0.0416666666666666*G5_5_0_2 - 0.0416666666666667*G5_5_1_0 - 0.0416666666666667*G5_5_2_0;
+    A[8] = -0.0416666666666667*G0_0_1_2 + 0.0416666666666667*G0_0_2_1 - 0.0416666666666666*G0_1_0_2 + 0.0416666666666667*G0_1_2_0 - 0.0416666666666667*G0_2_0_1 + 0.0416666666666667*G0_2_1_0 + 0.0416666666666666*G0_3_0_2 + 0.0416666666666666*G0_3_1_2 - 0.0416666666666667*G0_3_2_0 - 0.0416666666666667*G0_3_2_1 + 0.0416666666666667*G0_4_0_1 - 0.0416666666666667*G0_4_1_0 - 0.0416666666666667*G0_4_1_2 + 0.0416666666666667*G0_4_2_1 - 0.0416666666666667*G0_5_0_1 - 0.0416666666666667*G0_5_0_2 + 0.0416666666666667*G0_5_1_0 + 0.0416666666666667*G0_5_2_0 + 0.0416666666666667*G1_0_1_2 - 0.0416666666666667*G1_0_2_1 + 0.0416666666666666*G1_1_0_2 - 0.0416666666666667*G1_1_2_0 + 0.0416666666666667*G1_2_0_1 - 0.0416666666666667*G1_2_1_0 - 0.0416666666666666*G1_3_0_2 - 0.0416666666666666*G1_3_1_2 + 0.0416666666666667*G1_3_2_0 + 0.0416666666666667*G1_3_2_1 - 0.0416666666666667*G1_4_0_1 + 0.0416666666666667*G1_4_1_0 + 0.0416666666666667*G1_4_1_2 - 0.0416666666666667*G1_4_2_1 + 0.0416666666666667*G1_5_0_1 + 0.0416666666666667*G1_5_0_2 - 0.0416666666666667*G1_5_1_0 - 0.0416666666666667*G1_5_2_0;
+    A[9] = -0.0416666666666666*G0_0_1_2 + 0.0416666666666667*G0_0_2_1 - 0.0416666666666666*G0_1_0_2 + 0.0416666666666667*G0_1_2_0 - 0.0416666666666667*G0_2_0_1 + 0.0416666666666667*G0_2_1_0 + 0.0416666666666666*G0_3_0_2 + 0.0416666666666666*G0_3_1_2 - 0.0416666666666667*G0_3_2_0 - 0.0416666666666667*G0_3_2_1 + 0.0416666666666667*G0_4_0_1 - 0.0416666666666667*G0_4_1_0 - 0.0416666666666667*G0_4_1_2 + 0.0416666666666667*G0_4_2_1 - 0.0416666666666667*G0_5_0_1 - 0.0416666666666666*G0_5_0_2 + 0.0416666666666667*G0_5_1_0 + 0.0416666666666667*G0_5_2_0 + 0.0416666666666666*G1_0_1_2 - 0.0416666666666667*G1_0_2_1 + 0.0416666666666666*G1_1_0_2 - 0.0416666666666667*G1_1_2_0 + 0.0416666666666667*G1_2_0_1 - 0.0416666666666667*G1_2_1_0 - 0.0416666666666666*G1_3_0_2 - 0.0416666666666666*G1_3_1_2 + 0.0416666666666667*G1_3_2_0 + 0.0416666666666667*G1_3_2_1 - 0.0416666666666667*G1_4_0_1 + 0.0416666666666667*G1_4_1_0 + 0.0416666666666667*G1_4_1_2 - 0.0416666666666667*G1_4_2_1 + 0.0416666666666667*G1_5_0_1 + 0.0416666666666666*G1_5_0_2 - 0.0416666666666667*G1_5_1_0 - 0.0416666666666667*G1_5_2_0;
+    A[10] = -0.0416666666666666*G0_0_1_2 + 0.0416666666666667*G0_0_2_1 - 0.0416666666666666*G0_1_0_2 + 0.0416666666666667*G0_1_2_0 - 0.0416666666666667*G0_2_0_1 + 0.0416666666666667*G0_2_1_0 + 0.0416666666666666*G0_3_0_2 + 0.0416666666666666*G0_3_1_2 - 0.0416666666666667*G0_3_2_0 - 0.0416666666666667*G0_3_2_1 + 0.0416666666666667*G0_4_0_1 - 0.0416666666666667*G0_4_1_0 - 0.0416666666666667*G0_4_1_2 + 0.0416666666666667*G0_4_2_1 - 0.0416666666666667*G0_5_0_1 - 0.0416666666666666*G0_5_0_2 + 0.0416666666666667*G0_5_1_0 + 0.0416666666666667*G0_5_2_0 + 0.0416666666666666*G1_0_1_2 - 0.0416666666666667*G1_0_2_1 + 0.0416666666666666*G1_1_0_2 - 0.0416666666666667*G1_1_2_0 + 0.0416666666666667*G1_2_0_1 - 0.0416666666666667*G1_2_1_0 - 0.0416666666666666*G1_3_0_2 - 0.0416666666666666*G1_3_1_2 + 0.0416666666666667*G1_3_2_0 + 0.0416666666666667*G1_3_2_1 - 0.0416666666666667*G1_4_0_1 + 0.0416666666666667*G1_4_1_0 + 0.0416666666666667*G1_4_1_2 - 0.0416666666666667*G1_4_2_1 + 0.0416666666666667*G1_5_0_1 + 0.0416666666666666*G1_5_0_2 - 0.0416666666666667*G1_5_1_0 - 0.0416666666666667*G1_5_2_0;
+    A[11] = -0.0416666666666666*G0_0_1_2 + 0.0416666666666667*G0_0_2_1 - 0.0416666666666666*G0_1_0_2 + 0.0416666666666667*G0_1_2_0 - 0.0416666666666667*G0_2_0_1 + 0.0416666666666667*G0_2_1_0 + 0.0416666666666666*G0_3_0_2 + 0.0416666666666666*G0_3_1_2 - 0.0416666666666667*G0_3_2_0 - 0.0416666666666667*G0_3_2_1 + 0.0416666666666667*G0_4_0_1 - 0.0416666666666667*G0_4_1_0 - 0.0416666666666667*G0_4_1_2 + 0.0416666666666667*G0_4_2_1 - 0.0416666666666667*G0_5_0_1 - 0.0416666666666666*G0_5_0_2 + 0.0416666666666667*G0_5_1_0 + 0.0416666666666667*G0_5_2_0 + 0.0416666666666666*G1_0_1_2 - 0.0416666666666667*G1_0_2_1 + 0.0416666666666666*G1_1_0_2 - 0.0416666666666667*G1_1_2_0 + 0.0416666666666667*G1_2_0_1 - 0.0416666666666667*G1_2_1_0 - 0.0416666666666666*G1_3_0_2 - 0.0416666666666666*G1_3_1_2 + 0.0416666666666667*G1_3_2_0 + 0.0416666666666667*G1_3_2_1 - 0.0416666666666667*G1_4_0_1 + 0.0416666666666667*G1_4_1_0 + 0.0416666666666667*G1_4_1_2 - 0.0416666666666667*G1_4_2_1 + 0.0416666666666667*G1_5_0_1 + 0.0416666666666666*G1_5_0_2 - 0.0416666666666667*G1_5_1_0 - 0.0416666666666667*G1_5_2_0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class currentdensity_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  currentdensity_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "9dc70ed7b8a297c41dd67dcadde026f0f84dc9465be0a78b8960c9665dc76c3fec417dd2f9a8d07ef81e4f1f28f48516f2cca0d4224d59308ebf2ec61b9c4378";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new currentdensity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new currentdensity_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new currentdensity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new currentdensity_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new currentdensity_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class currentdensity_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  currentdensity_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~currentdensity_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "b261c24bf756fa7ae3e74bd2151127d03bb0884aa54cab0621d8841d1a4278bf8aa6d5a6ea1b39c9d56ecce79d75461e4774a95bc393d531fd1666f41956d1ea";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new currentdensity_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new currentdensity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new currentdensity_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new currentdensity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new currentdensity_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace CurrentDensity
+{
+
+class CoefficientSpace_T: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_T(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_T(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_T(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_T(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_T(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_T(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_T()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new currentdensity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new currentdensity_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new currentdensity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new currentdensity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_T Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), T(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new currentdensity_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& T):
+    dolfin::Form(1, 1), T(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->T = T;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new currentdensity_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> T):
+    dolfin::Form(1, 1), T(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->T = *T;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new currentdensity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), T(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new currentdensity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& T):
+    dolfin::Form(1, 1), T(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->T = T;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new currentdensity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> T):
+    dolfin::Form(1, 1), T(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->T = *T;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new currentdensity_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "T")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "T";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_T;
+
+  // Coefficients
+  dolfin::CoefficientAssigner T;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/curl-curl/cpp/CurrentDensity.ufl b/demo/undocumented/curl-curl/cpp/CurrentDensity.ufl
new file mode 100644
index 0000000..7add808
--- /dev/null
+++ b/demo/undocumented/curl-curl/cpp/CurrentDensity.ufl
@@ -0,0 +1,34 @@
+# Copyright (C) 2009 Bartosz Sawicki
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-03-30
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# curl operator.
+#
+# Compile this form with FFC: ffc -l dolfin CurrentDensity.ufl
+
+EL = VectorElement("CG", tetrahedron, 1)
+EN = FiniteElement("Nedelec 1st kind H(curl)", tetrahedron, 1)
+
+u = TrialFunction(EL)
+v = TestFunction(EL)
+T = Coefficient(EN)
+
+a = dot(u, v)*dx
+L = dot(curl(T), v)*dx
diff --git a/demo/undocumented/curl-curl/cpp/EddyCurrents.h b/demo/undocumented/curl-curl/cpp/EddyCurrents.h
new file mode 100644
index 0000000..9b567f4
--- /dev/null
+++ b/demo/undocumented/curl-curl/cpp/EddyCurrents.h
@@ -0,0 +1,8168 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __EDDYCURRENTS_H
+#define __EDDYCURRENTS_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class eddycurrents_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  eddycurrents_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new eddycurrents_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class eddycurrents_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  eddycurrents_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 9:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[10] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[11] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[4];
+    vertex_values[4] = dof_values[5];
+    vertex_values[7] = dof_values[6];
+    vertex_values[10] = dof_values[7];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[8];
+    vertex_values[5] = dof_values[9];
+    vertex_values[8] = dof_values[10];
+    vertex_values[11] = dof_values[11];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new eddycurrents_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new eddycurrents_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new eddycurrents_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new eddycurrents_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class eddycurrents_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  eddycurrents_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Nedelec 1st kind H(curl)', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      static const double coefficients1[4] = \
+      {-0.288675134594813, 0.0, 0.0, -0.223606797749979};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {-0.288675134594812, 0.0, 0.0, -0.223606797749979};
+      
+      static const double coefficients1[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {-0.288675134594813, 0.0, -0.210818510677892, 0.074535599249993};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      static const double coefficients2[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      static const double coefficients2[4] = \
+      {0.577350269189626, -0.182574185835056, -0.105409255338946, 0.149071198499986};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.0745355992499929};
+      
+      static const double coefficients1[4] = \
+      {0.577350269189626, -0.182574185835055, 0.105409255338946, -0.149071198499986};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.577350269189626, 0.0, -0.210818510677892, -0.149071198499986};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.0745355992499929};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+        values[2] += coefficients2[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      const double tmp_ref2 = values[2];
+      values[0] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+      values[1] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+      values[2] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      static const double coefficients1[4] = \
+      {-0.288675134594813, 0.0, 0.0, -0.223606797749979};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {-0.288675134594812, 0.0, 0.0, -0.223606797749979};
+      
+      static const double coefficients1[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {-0.288675134594813, 0.0, -0.210818510677892, 0.074535599249993};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      static const double coefficients2[4] = \
+      {0.0, 0.0, 0.0, 0.0};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      static const double coefficients2[4] = \
+      {0.577350269189626, -0.182574185835056, -0.105409255338946, 0.149071198499986};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.0745355992499929};
+      
+      static const double coefficients1[4] = \
+      {0.577350269189626, -0.182574185835055, 0.105409255338946, -0.149071198499986};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.577350269189626, 0.0, -0.210818510677892, -0.149071198499986};
+      
+      static const double coefficients1[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.0745355992499929};
+      
+      static const double coefficients2[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+            derivatives[2*num_derivatives + r] += coefficients2[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        const double tmp_ref2 = derivatives[2*num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[3]*tmp_ref1 + K[6]*tmp_ref2);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[4]*tmp_ref1 + K[7]*tmp_ref2);
+        derivatives_p[2*num_derivatives + r] = (K[2]*tmp_ref0 + K[5]*tmp_ref1 + K[8]*tmp_ref2);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+          values[2*num_derivatives + r] += transform[r][s]*derivatives_p[2*num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    
+    double result;
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]) + (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+      return result;
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]) + (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+      return result;
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]) + (J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]);
+      return result;
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      result = (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+      return result;
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      result = (J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]);
+      return result;
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]);
+      return result;
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    
+    double result;
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]) + (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+    values[0] = result;
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]) + (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+    values[1] = result;
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]) + (J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]);
+    values[2] = result;
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    result = (J[2]*vals[0] + J[5]*vals[1] + J[8]*vals[2]);
+    values[3] = result;
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    result = (J[1]*vals[0] + J[4]*vals[1] + J[7]*vals[2]);
+    values[4] = result;
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (J[0]*vals[0] + J[3]*vals[1] + J[6]*vals[2]);
+    values[5] = result;
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[3]*K[6] + dof_values[4]*K[3] + dof_values[5]*K[0];
+    vertex_values[3] = dof_values[1]*K[6] + dof_values[2]*K[3] + dof_values[5]*(K[0] + K[3] + K[6]);
+    vertex_values[6] = dof_values[0]*K[6] + dof_values[2]*(K[0]*(-1.0)) + dof_values[4]*(K[0] + K[3] + K[6]);
+    vertex_values[9] = dof_values[0]*(K[3]*(-1.0)) + dof_values[1]*(K[0]*(-1.0)) + dof_values[3]*(K[0] + K[3] + K[6]);
+    vertex_values[1] = dof_values[3]*K[7] + dof_values[4]*K[4] + dof_values[5]*K[1];
+    vertex_values[4] = dof_values[1]*K[7] + dof_values[2]*K[4] + dof_values[5]*(K[1] + K[4] + K[7]);
+    vertex_values[7] = dof_values[0]*K[7] + dof_values[2]*(K[1]*(-1.0)) + dof_values[4]*(K[1] + K[4] + K[7]);
+    vertex_values[10] = dof_values[0]*(K[4]*(-1.0)) + dof_values[1]*(K[1]*(-1.0)) + dof_values[3]*(K[1] + K[4] + K[7]);
+    vertex_values[2] = dof_values[3]*K[8] + dof_values[4]*K[5] + dof_values[5]*K[2];
+    vertex_values[5] = dof_values[1]*K[8] + dof_values[2]*K[5] + dof_values[5]*(K[2] + K[5] + K[8]);
+    vertex_values[8] = dof_values[0]*K[8] + dof_values[2]*(K[2]*(-1.0)) + dof_values[4]*(K[2] + K[5] + K[8]);
+    vertex_values[11] = dof_values[0]*(K[5]*(-1.0)) + dof_values[1]*(K[2]*(-1.0)) + dof_values[3]*(K[2] + K[5] + K[8]);
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new eddycurrents_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class eddycurrents_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  eddycurrents_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new eddycurrents_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class eddycurrents_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  eddycurrents_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[0][0];
+    dofs[5] = offset + c.entity_indices[0][1];
+    dofs[6] = offset + c.entity_indices[0][2];
+    dofs[7] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[8] = offset + c.entity_indices[0][0];
+    dofs[9] = offset + c.entity_indices[0][1];
+    dofs[10] = offset + c.entity_indices[0][2];
+    dofs[11] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 9;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 11;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 10;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 4;
+        dofs[2] = 8;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 5;
+        dofs[2] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 6;
+        dofs[2] = 10;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 7;
+        dofs[2] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = vertex_coordinates[0];
+    dof_coordinates[4][1] = vertex_coordinates[1];
+    dof_coordinates[4][2] = vertex_coordinates[2];
+    dof_coordinates[5][0] = vertex_coordinates[3];
+    dof_coordinates[5][1] = vertex_coordinates[4];
+    dof_coordinates[5][2] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[6];
+    dof_coordinates[6][1] = vertex_coordinates[7];
+    dof_coordinates[6][2] = vertex_coordinates[8];
+    dof_coordinates[7][0] = vertex_coordinates[9];
+    dof_coordinates[7][1] = vertex_coordinates[10];
+    dof_coordinates[7][2] = vertex_coordinates[11];
+    dof_coordinates[8][0] = vertex_coordinates[0];
+    dof_coordinates[8][1] = vertex_coordinates[1];
+    dof_coordinates[8][2] = vertex_coordinates[2];
+    dof_coordinates[9][0] = vertex_coordinates[3];
+    dof_coordinates[9][1] = vertex_coordinates[4];
+    dof_coordinates[9][2] = vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[6];
+    dof_coordinates[10][1] = vertex_coordinates[7];
+    dof_coordinates[10][2] = vertex_coordinates[8];
+    dof_coordinates[11][0] = vertex_coordinates[9];
+    dof_coordinates[11][1] = vertex_coordinates[10];
+    dof_coordinates[11][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new eddycurrents_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new eddycurrents_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new eddycurrents_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new eddycurrents_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class eddycurrents_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  eddycurrents_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Nedelec 1st kind H(curl)', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[1][0];
+    dofs[1] = c.entity_indices[1][1];
+    dofs[2] = c.entity_indices[1][2];
+    dofs[3] = c.entity_indices[1][3];
+    dofs[4] = c.entity_indices[1][4];
+    dofs[5] = c.entity_indices[1][5];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 3;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 1;
+      dofs[1] = 3;
+      dofs[2] = 5;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 2;
+      dofs[1] = 4;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[1][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[1][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[1][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[2][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[2][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[2][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[3][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new eddycurrents_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class eddycurrents_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  eddycurrents_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.166666666666667;
+    // Quadrature points on the UFC reference element: (0.25, 0.25, 0.25)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0_D001[1][3] = \
+    {{-1.0, 0.999999999999999, -1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[3] = {2, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[3] = {1, 3, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[3] = {0, 3, 4};
+    
+    static const double FE1_C1_D100[1][3] = \
+    {{1.0, -1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[3] = {0, 3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[3] = {2, 4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc20[3] = {1, 3, 5};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 384.
+    double G[12];
+    G[0] = W1*det*(K[6]*K[6]*(K[1]*K[1] + K[2]*K[2]) + K[7]*(K[7]*(K[0]*K[0] + K[2]*K[2])-2.0*K[0]*K[1]*K[6]) + K[8]*(K[8]*(K[0]*K[0] + K[1]*K[1])-2.0*K[2]*(K[0]*K[6] + K[1]*K[7])));
+    G[1] = W1*det*(K[0]*K[0]*(K[4]*K[7] + K[5]*K[8]) + K[1]*(K[1]*(K[3]*K[6] + K[5]*K[8]) - K[0]*(K[3]*K[7] + K[4]*K[6])) + K[2]*(K[2]*(K[3]*K[6] + K[4]*K[7]) - (K[5]*(K[0]*K[6] + K[1]*K[7]) + K[8]*(K[0]*K[3] + K[1]*K[4]))));
+    G[2] = W1*det*(K[6]*K[6]*(K[1]*K[4] + K[2]*K[5]) + K[7]*(K[7]*(K[0]*K[3] + K[2]*K[5]) - K[6]*(K[0]*K[4] + K[1]*K[3])) + K[8]*(K[8]*(K[0]*K[3] + K[1]*K[4]) - (K[6]*(K[0]*K[5] + K[2]*K[3]) + K[7]*(K[1]*K[5] + K[2]*K[4]))));
+    G[3] = W1*det*(K[1]*(K[0]*(K[3]*K[7] + K[4]*K[6]) - K[1]*(K[3]*K[6] + K[5]*K[8])) + K[2]*(K[5]*(K[0]*K[6] + K[1]*K[7]) + K[8]*(K[0]*K[3] + K[1]*K[4]) - K[2]*(K[3]*K[6] + K[4]*K[7])) - K[0]*K[0]*(K[4]*K[7] + K[5]*K[8]));
+    G[4] = W1*det*(K[7]*(K[6]*(K[0]*K[4] + K[1]*K[3]) - K[7]*(K[0]*K[3] + K[2]*K[5])) + K[8]*(K[6]*(K[0]*K[5] + K[2]*K[3]) + K[7]*(K[1]*K[5] + K[2]*K[4]) - K[8]*(K[0]*K[3] + K[1]*K[4])) - K[6]*K[6]*(K[1]*K[4] + K[2]*K[5]));
+    G[5] = W1*det*(2.0*K[0]*K[1]*K[6]*K[7] + 2.0*K[2]*K[8]*(K[0]*K[6] + K[1]*K[7]) - (K[6]*K[6]*(K[1]*K[1] + K[2]*K[2]) + K[7]*K[7]*(K[0]*K[0] + K[2]*K[2]) + K[8]*K[8]*(K[0]*K[0] + K[1]*K[1])));
+    G[6] = W1*det*(K[3]*K[3]*(K[1]*K[1] + K[2]*K[2]) + K[4]*(K[4]*(K[0]*K[0] + K[2]*K[2])-2.0*K[0]*K[1]*K[3]) + K[5]*(K[5]*(K[0]*K[0] + K[1]*K[1])-2.0*K[2]*(K[0]*K[3] + K[1]*K[4])));
+    G[7] = W1*det*(K[4]*(K[3]*(K[0]*K[7] + K[1]*K[6]) - K[4]*(K[0]*K[6] + K[2]*K[8])) + K[5]*(K[2]*(K[3]*K[6] + K[4]*K[7]) + K[8]*(K[0]*K[3] + K[1]*K[4]) - K[5]*(K[0]*K[6] + K[1]*K[7])) - K[3]*K[3]*(K[1]*K[7] + K[2]*K[8]));
+    G[8] = W1*det*(2.0*K[0]*K[1]*K[3]*K[4] + 2.0*K[2]*K[5]*(K[0]*K[3] + K[1]*K[4]) - (K[3]*K[3]*(K[1]*K[1] + K[2]*K[2]) + K[4]*K[4]*(K[0]*K[0] + K[2]*K[2]) + K[5]*K[5]*(K[0]*K[0] + K[1]*K[1])));
+    G[9] = W1*det*(K[3]*K[3]*(K[1]*K[7] + K[2]*K[8]) + K[4]*(K[4]*(K[0]*K[6] + K[2]*K[8]) - K[3]*(K[0]*K[7] + K[1]*K[6])) + K[5]*(K[5]*(K[0]*K[6] + K[1]*K[7]) - (K[2]*(K[3]*K[6] + K[4]*K[7]) + K[8]*(K[0]*K[3] + K[1]*K[4]))));
+    G[10] = W1*det*(K[6]*K[6]*(K[4]*K[4] + K[5]*K[5]) + K[7]*(K[7]*(K[3]*K[3] + K[5]*K[5])-2.0*K[3]*K[4]*K[6]) + K[8]*(K[8]*(K[3]*K[3] + K[4]*K[4])-2.0*K[5]*(K[3]*K[6] + K[4]*K[7])));
+    G[11] = W1*det*(2.0*K[3]*K[4]*K[6]*K[7] + 2.0*K[5]*K[8]*(K[3]*K[6] + K[4]*K[7]) - (K[6]*K[6]*(K[4]*K[4] + K[5]*K[5]) + K[7]*K[7]*(K[3]*K[3] + K[5]*K[5]) + K[8]*K[8]*(K[3]*K[3] + K[4]*K[4])));
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 972
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Number of operations for primary indices: 972
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        for (unsigned int k = 0; k < 3; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*6 + nzc13[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[0];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*6 + nzc14[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*6 + nzc16[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*6 + nzc17[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*6 + nzc19[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc13[j]*6 + nzc20[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*6 + nzc13[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*6 + nzc14[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*6 + nzc16[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*6 + nzc17[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*6 + nzc19[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[9];
+          // Number of operations to compute entry: 3
+          A[nzc14[j]*6 + nzc20[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc16[j]*6 + nzc13[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc16[j]*6 + nzc14[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc16[j]*6 + nzc16[k]] += FE1_C0_D001[0][j]*FE1_C0_D001[0][k]*G[10];
+          // Number of operations to compute entry: 3
+          A[nzc16[j]*6 + nzc17[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[9];
+          // Number of operations to compute entry: 3
+          A[nzc16[j]*6 + nzc19[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[11];
+          // Number of operations to compute entry: 3
+          A[nzc16[j]*6 + nzc20[k]] += FE1_C0_D001[0][j]*FE1_C1_D100[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*6 + nzc13[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*6 + nzc14[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*6 + nzc16[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[9];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*6 + nzc17[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*6 + nzc19[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc17[j]*6 + nzc20[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*6 + nzc13[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*6 + nzc14[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[9];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*6 + nzc16[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[11];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*6 + nzc17[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*6 + nzc19[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[10];
+          // Number of operations to compute entry: 3
+          A[nzc19[j]*6 + nzc20[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc20[j]*6 + nzc13[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc20[j]*6 + nzc14[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc20[j]*6 + nzc16[k]] += FE1_C0_D001[0][k]*FE1_C1_D100[0][j]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc20[j]*6 + nzc17[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc20[j]*6 + nzc19[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc20[j]*6 + nzc20[k]] += FE1_C1_D100[0][j]*FE1_C1_D100[0][k]*G[0];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class eddycurrents_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  eddycurrents_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    54
+    // Number of operations (multiply-add pairs) for tensor contraction: 177
+    // Total number of operations (multiply-add pairs):                  234
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G0_0_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G0_0_2_0 = det*w[0][2]*K[0]*(1.0);
+    const double G0_0_3_0 = det*w[0][3]*K[0]*(1.0);
+    const double G0_0_4_1 = det*w[0][4]*K[1]*(1.0);
+    const double G0_0_5_1 = det*w[0][5]*K[1]*(1.0);
+    const double G0_0_6_1 = det*w[0][6]*K[1]*(1.0);
+    const double G0_0_7_1 = det*w[0][7]*K[1]*(1.0);
+    const double G0_0_8_2 = det*w[0][8]*K[2]*(1.0);
+    const double G0_0_9_2 = det*w[0][9]*K[2]*(1.0);
+    const double G0_0_10_2 = det*w[0][10]*K[2]*(1.0);
+    const double G0_0_11_2 = det*w[0][11]*K[2]*(1.0);
+    const double G0_1_0_0 = det*w[0][0]*K[3]*(1.0);
+    const double G0_1_1_0 = det*w[0][1]*K[3]*(1.0);
+    const double G0_1_2_0 = det*w[0][2]*K[3]*(1.0);
+    const double G0_1_3_0 = det*w[0][3]*K[3]*(1.0);
+    const double G0_1_4_1 = det*w[0][4]*K[4]*(1.0);
+    const double G0_1_5_1 = det*w[0][5]*K[4]*(1.0);
+    const double G0_1_6_1 = det*w[0][6]*K[4]*(1.0);
+    const double G0_1_7_1 = det*w[0][7]*K[4]*(1.0);
+    const double G0_1_8_2 = det*w[0][8]*K[5]*(1.0);
+    const double G0_1_9_2 = det*w[0][9]*K[5]*(1.0);
+    const double G0_1_10_2 = det*w[0][10]*K[5]*(1.0);
+    const double G0_1_11_2 = det*w[0][11]*K[5]*(1.0);
+    const double G0_2_0_0 = det*w[0][0]*K[6]*(1.0);
+    const double G0_2_1_0 = det*w[0][1]*K[6]*(1.0);
+    const double G0_2_2_0 = det*w[0][2]*K[6]*(1.0);
+    const double G0_2_3_0 = det*w[0][3]*K[6]*(1.0);
+    const double G0_2_4_1 = det*w[0][4]*K[7]*(1.0);
+    const double G0_2_5_1 = det*w[0][5]*K[7]*(1.0);
+    const double G0_2_6_1 = det*w[0][6]*K[7]*(1.0);
+    const double G0_2_7_1 = det*w[0][7]*K[7]*(1.0);
+    const double G0_2_8_2 = det*w[0][8]*K[8]*(1.0);
+    const double G0_2_9_2 = det*w[0][9]*K[8]*(1.0);
+    const double G0_2_10_2 = det*w[0][10]*K[8]*(1.0);
+    const double G0_2_11_2 = det*w[0][11]*K[8]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00833333333333329*G0_1_0_0 + 0.00833333333333337*G0_1_1_0 + 0.00833333333333337*G0_1_2_0 + 0.0166666666666667*G0_1_3_0 + 0.00833333333333329*G0_1_4_1 + 0.00833333333333337*G0_1_5_1 + 0.00833333333333337*G0_1_6_1 + 0.0166666666666667*G0_1_7_1 + 0.00833333333333329*G0_1_8_2 + 0.00833333333333337*G0_1_9_2 + 0.00833333333333337*G0_1_10_2 + 0.0166666666666667*G0_1_11_2 - 0.0083333333333333*G0_2_0_0 - 0.00833333333333337*G0_2_1_0 - 0.0166666666666667*G0_2_2_0 - 0.00833333333333337*G0_2_3_0 - 0.0083333333333333*G0_2_4_1 - 0.00833333333333337*G0_2_5_1 - 0.0166666666666667*G0_2_6_1 - 0.00833333333333337*G0_2_7_1 - 0.0083333333333333*G0_2_8_2 - 0.00833333333333337*G0_2_9_2 - 0.0166666666666667*G0_2_10_2 - 0.00833333333333337*G0_2_11_2;
+    A[1] = 0.00833333333333328*G0_0_0_0 + 0.00833333333333336*G0_0_1_0 + 0.00833333333333336*G0_0_2_0 + 0.0166666666666667*G0_0_3_0 + 0.00833333333333328*G0_0_4_1 + 0.00833333333333336*G0_0_5_1 + 0.00833333333333336*G0_0_6_1 + 0.0166666666666667*G0_0_7_1 + 0.00833333333333328*G0_0_8_2 + 0.00833333333333336*G0_0_9_2 + 0.00833333333333336*G0_0_10_2 + 0.0166666666666667*G0_0_11_2 - 0.00833333333333329*G0_2_0_0 - 0.0166666666666667*G0_2_1_0 - 0.00833333333333337*G0_2_2_0 - 0.00833333333333337*G0_2_3_0 - 0.00833333333333329*G0_2_4_1 - 0.0166666666666667*G0_2_5_1 - 0.00833333333333337*G0_2_6_1 - 0.00833333333333337*G0_2_7_1 - 0.00833333333333329*G0_2_8_2 - 0.0166666666666667*G0_2_9_2 - 0.00833333333333337*G0_2_10_2 - 0.00833333333333337*G0_2_11_2;
+    A[2] = 0.00833333333333329*G0_0_0_0 + 0.00833333333333337*G0_0_1_0 + 0.0166666666666667*G0_0_2_0 + 0.00833333333333336*G0_0_3_0 + 0.00833333333333329*G0_0_4_1 + 0.00833333333333337*G0_0_5_1 + 0.0166666666666667*G0_0_6_1 + 0.00833333333333336*G0_0_7_1 + 0.00833333333333329*G0_0_8_2 + 0.00833333333333337*G0_0_9_2 + 0.0166666666666667*G0_0_10_2 + 0.00833333333333336*G0_0_11_2 - 0.00833333333333329*G0_1_0_0 - 0.0166666666666667*G0_1_1_0 - 0.00833333333333337*G0_1_2_0 - 0.00833333333333337*G0_1_3_0 - 0.00833333333333329*G0_1_4_1 - 0.0166666666666667*G0_1_5_1 - 0.00833333333333337*G0_1_6_1 - 0.00833333333333337*G0_1_7_1 - 0.00833333333333329*G0_1_8_2 - 0.0166666666666667*G0_1_9_2 - 0.00833333333333337*G0_1_10_2 - 0.00833333333333337*G0_1_11_2;
+    A[3] = -0.00833333333333329*G0_0_0_0 - 0.00833333333333337*G0_0_1_0 - 0.00833333333333337*G0_0_2_0 - 0.0166666666666667*G0_0_3_0 - 0.00833333333333329*G0_0_4_1 - 0.00833333333333337*G0_0_5_1 - 0.00833333333333337*G0_0_6_1 - 0.0166666666666667*G0_0_7_1 - 0.00833333333333329*G0_0_8_2 - 0.00833333333333337*G0_0_9_2 - 0.00833333333333337*G0_0_10_2 - 0.0166666666666667*G0_0_11_2 - 0.00833333333333329*G0_1_0_0 - 0.00833333333333337*G0_1_1_0 - 0.00833333333333337*G0_1_2_0 - 0.0166666666666667*G0_1_3_0 - 0.00833333333333329*G0_1_4_1 - 0.00833333333333337*G0_1_5_1 - 0.00833333333333337*G0_1_6_1 - 0.0166666666666667*G0_1_7_1 - 0.00833333333333329*G0_1_8_2 - 0.00833333333333337*G0_1_9_2 - 0.00833333333333337*G0_1_10_2 - 0.0166666666666667*G0_1_11_2 - 0.0249999999999998*G0_2_0_0 - 0.0166666666666667*G0_2_1_0 - 0.0166666666666667*G0_2_2_0 - 0.025*G0_2_3_0 - 0.0249999999999998*G0_2_4_1 - 0.0166666666666667*G0_2_5_1 - 0.0166666666666667*G0_2_6_1 - 0.025*G0_2_7_1 - 0.0249999999999998*G0_2_8_2 - 0.0166666666666667*G0_2_9_2 - 0.0166666666666667*G0_2_10_2 - 0.025*G0_2_11_2;
+    A[4] = -0.00833333333333329*G0_0_0_0 - 0.00833333333333337*G0_0_1_0 - 0.0166666666666667*G0_0_2_0 - 0.00833333333333337*G0_0_3_0 - 0.00833333333333329*G0_0_4_1 - 0.00833333333333337*G0_0_5_1 - 0.0166666666666667*G0_0_6_1 - 0.00833333333333337*G0_0_7_1 - 0.00833333333333329*G0_0_8_2 - 0.00833333333333337*G0_0_9_2 - 0.0166666666666667*G0_0_10_2 - 0.00833333333333337*G0_0_11_2 - 0.0249999999999999*G0_1_0_0 - 0.0166666666666667*G0_1_1_0 - 0.025*G0_1_2_0 - 0.0166666666666667*G0_1_3_0 - 0.0249999999999999*G0_1_4_1 - 0.0166666666666667*G0_1_5_1 - 0.025*G0_1_6_1 - 0.0166666666666667*G0_1_7_1 - 0.0249999999999999*G0_1_8_2 - 0.0166666666666667*G0_1_9_2 - 0.025*G0_1_10_2 - 0.0166666666666667*G0_1_11_2 - 0.00833333333333329*G0_2_0_0 - 0.00833333333333337*G0_2_1_0 - 0.0166666666666667*G0_2_2_0 - 0.00833333333333337*G0_2_3_0 - 0.00833333333333329*G0_2_4_1 - 0.00833333333333337*G0_2_5_1 - 0.0166666666666667*G0_2_6_1 - 0.00833333333333337*G0_2_7_1 - 0.00833333333333329*G0_2_8_2 - 0.00833333333333337*G0_2_9_2 - 0.0166666666666667*G0_2_10_2 - 0.00833333333333337*G0_2_11_2;
+    A[5] = -0.0249999999999999*G0_0_0_0 - 0.025*G0_0_1_0 - 0.0166666666666667*G0_0_2_0 - 0.0166666666666667*G0_0_3_0 - 0.0249999999999999*G0_0_4_1 - 0.025*G0_0_5_1 - 0.0166666666666667*G0_0_6_1 - 0.0166666666666667*G0_0_7_1 - 0.0249999999999999*G0_0_8_2 - 0.025*G0_0_9_2 - 0.0166666666666667*G0_0_10_2 - 0.0166666666666667*G0_0_11_2 - 0.00833333333333329*G0_1_0_0 - 0.0166666666666667*G0_1_1_0 - 0.00833333333333337*G0_1_2_0 - 0.00833333333333337*G0_1_3_0 - 0.00833333333333329*G0_1_4_1 - 0.0166666666666667*G0_1_5_1 - 0.00833333333333337*G0_1_6_1 - 0.00833333333333337*G0_1_7_1 - 0.00833333333333329*G0_1_8_2 - 0.0166666666666667*G0_1_9_2 - 0.00833333333333337*G0_1_10_2 - 0.00833333333333337*G0_1_11_2 - 0.00833333333333329*G0_2_0_0 - 0.0166666666666667*G0_2_1_0 - 0.00833333333333337*G0_2_2_0 - 0.00833333333333337*G0_2_3_0 - 0.00833333333333329*G0_2_4_1 - 0.0166666666666667*G0_2_5_1 - 0.00833333333333337*G0_2_6_1 - 0.00833333333333337*G0_2_7_1 - 0.00833333333333329*G0_2_8_2 - 0.0166666666666667*G0_2_9_2 - 0.00833333333333337*G0_2_10_2 - 0.00833333333333337*G0_2_11_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class eddycurrents_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  eddycurrents_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "5443d252627c7fa242e1250871afd5ddf944e5314ba95ed6527fc8dcccab7872904cc3e422e485e44cab07e45dda4a35c663252e1d515296152bb1e8ae0640a5";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new eddycurrents_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new eddycurrents_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new eddycurrents_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new eddycurrents_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new eddycurrents_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class eddycurrents_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  eddycurrents_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~eddycurrents_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "9f3dd1bfa1433c6b6b615a49e95e59d8b4bf800836d300474a3eba3efdf1cfabb078d5dc71c16a00f21b96467dbf2b618286472ea68c3e26cfbb81b57a879744";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new eddycurrents_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new eddycurrents_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new eddycurrents_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new eddycurrents_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new eddycurrents_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace EddyCurrents
+{
+
+class CoefficientSpace_dbdt: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_dbdt(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_dbdt(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_dbdt(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_dbdt(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_dbdt(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_dbdt(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_dbdt()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new eddycurrents_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new eddycurrents_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new eddycurrents_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new eddycurrents_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_dbdt Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), dbdt(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new eddycurrents_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& dbdt):
+    dolfin::Form(1, 1), dbdt(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->dbdt = dbdt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new eddycurrents_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> dbdt):
+    dolfin::Form(1, 1), dbdt(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->dbdt = *dbdt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new eddycurrents_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), dbdt(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new eddycurrents_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& dbdt):
+    dolfin::Form(1, 1), dbdt(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->dbdt = dbdt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new eddycurrents_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> dbdt):
+    dolfin::Form(1, 1), dbdt(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->dbdt = *dbdt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new eddycurrents_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "dbdt")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "dbdt";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_dbdt;
+
+  // Coefficients
+  dolfin::CoefficientAssigner dbdt;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/curl-curl/cpp/EddyCurrents.ufl b/demo/undocumented/curl-curl/cpp/EddyCurrents.ufl
new file mode 100644
index 0000000..69b90ae
--- /dev/null
+++ b/demo/undocumented/curl-curl/cpp/EddyCurrents.ufl
@@ -0,0 +1,34 @@
+# Copyright (C) 2009 Bartosz Sawicki
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-03-30
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# curl-curl eddy currents equation.
+#
+# Compile this form with FFC: ffc -l dolfin EddyCurrents.ufl
+
+EN = FiniteElement("Nedelec 1st kind H(curl)", tetrahedron, 1)
+EL = VectorElement("Lagrange", tetrahedron, 1)
+
+u = TrialFunction(EN)
+v = TestFunction(EN)
+dbdt = Coefficient(EL)
+
+a = inner(curl(u), curl(v))*dx
+L = - inner(dbdt, v)*dx
diff --git a/demo/undocumented/curl-curl/cpp/compile.log b/demo/undocumented/curl-curl/cpp/compile.log
new file mode 100644
index 0000000..baab00e
--- /dev/null
+++ b/demo/undocumented/curl-curl/cpp/compile.log
@@ -0,0 +1,1673 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form CurrentDensity
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Vector<3 x CG1(?)>'
+  Unique sub elements:    'Vector<3 x CG1(?)>, CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[T]'
+  Unique elements:        'Vector<3 x CG1(?)>, N1curl1(?)'
+  Unique sub elements:    'Vector<3 x CG1(?)>, N1curl1(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 3
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 1
+  quadrature_degree: auto --> 1
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0568941 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00165 seconds
+  Shape of reference tensor: (12, 12)
+  Primary multi index:   rank = 2 dims = [12, 12] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  648 entries computed in 0.00154 seconds
+  Shape of reference tensor: (12, 6, 3, 3)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  648 entries computed in 0.00148 seconds
+  Shape of reference tensor: (12, 6, 3, 3)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  648 entries computed in 0.00174 seconds
+  Shape of reference tensor: (12, 6, 3, 3)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  648 entries computed in 0.00154 seconds
+  Shape of reference tensor: (12, 6, 3, 3)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  648 entries computed in 0.00148 seconds
+  Shape of reference tensor: (12, 6, 3, 3)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  648 entries computed in 0.00142 seconds
+  Shape of reference tensor: (12, 6, 3, 3)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [6, 3, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [3, 0, 0], [3, 0, 1], [3, 0, 2], [3, 1, 0], [3, 1, 1], [3, 1, 2], [3, 2, 0], [3, 2, 1], [3, 2, 2], [4, 0, 0], [4, 0, 1], [4, 0, 2], [4, 1, 0], [4, 1, 1], [4, 1, 2], [4, 2, 0], [4, 2, 1], [4, 2, 2], [5, 0, 0], [5, 0, 1], [5, 0, 2], [5, 1, 0], [5, 1, 1], [5, 1, 2], [5, 2, 0], [5, 2, 1], [5, 2, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.03737 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000271082 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.338548 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000583887 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./CurrentDensity.h.
+  
+Compiler stage 5 finished in 0.00109076 seconds.
+
+FFC finished in 0.43513 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form EddyCurrents
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'N1curl1(?)'
+  Unique sub elements:    'N1curl1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[dbdt]'
+  Unique elements:        'N1curl1(?), Vector<3 x CG1(?)>'
+  Unique sub elements:    'N1curl1(?), Vector<3 x CG1(?)>, CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0448599 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 1, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 0, 0): array([[[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]]]), (0, 0, 1): array([[[ -1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.11022302e-16],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [ -1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.11022302e-16],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [ -1.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.11022302e-16]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.00000000e+00]]])}}}, FiniteElement('Nedelec 1st kind H(curl)', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[  1.68780044e-32],
+          [ -3.04047097e-16],
+          [  3.42052984e-16]],
+  
+         [[ -3.79213356e-16],
+          [  9.50147179e-17],
+          [  1.00000000e+00]],
+  
+         [[ -5.82117938e-16],
+          [  1.00000000e+00],
+          [ -1.90029436e-16]],
+  
+         [[  3.79213356e-16],
+          [  3.80058872e-16],
+          [ -1.00000000e+00]],
+  
+         [[  5.82117938e-16],
+          [ -1.00000000e+00],
+          [  3.80058872e-16]],
+  
+         [[ -9.61331293e-16],
+          [  1.00000000e+00],
+          [  1.00000000e+00]]]), (0, 1, 0): array([[[ -1.31656255e-16],
+          [ -1.84937612e-16],
+          [  1.00000000e+00]],
+  
+         [[ -1.89606678e-16],
+          [  3.10503271e-17],
+          [  3.33066907e-16]],
+  
+         [[ -1.00000000e+00],
+          [  6.10622664e-16],
+          [  3.32868111e-16]],
+  
+         [[  1.23778550e-16],
+          [  1.24201308e-16],
+          [ -1.00000000e+00]],
+  
+         [[  1.00000000e+00],
+          [ -8.32667268e-16],
+          [  1.00000000e+00]],
+  
+         [[ -1.00000000e+00],
+          [  6.66133815e-16],
+          [  6.10622664e-16]]]), (0, 0, 0): array([[[  8.10259588e-17],
+          [ -2.50000000e-01],
+          [  2.50000000e-01]],
+  
+         [[ -2.50000000e-01],
+          [ -3.22762902e-17],
+          [  2.50000000e-01]],
+  
+         [[ -2.50000000e-01],
+          [  2.50000000e-01],
+          [  1.04997706e-16]],
+  
+         [[  2.50000000e-01],
+          [  2.50000000e-01],
+          [  5.00000000e-01]],
+  
+         [[  2.50000000e-01],
+          [  5.00000000e-01],
+          [  2.50000000e-01]],
+  
+         [[  5.00000000e-01],
+          [  2.50000000e-01],
+          [  2.50000000e-01]]]), (0, 0, 1): array([[[  1.42304643e-16],
+          [ -1.00000000e+00],
+          [  3.88578059e-16]],
+  
+         [[ -1.00000000e+00],
+          [  2.59243420e-16],
+          [  6.10622664e-16]],
+  
+         [[ -1.66533454e-16],
+          [  3.88578059e-16],
+          [  7.86445687e-17]],
+  
+         [[  1.00000000e+00],
+          [  1.00000000e+00],
+          [ -9.99200722e-16]],
+  
+         [[  5.55111512e-16],
+          [ -1.00000000e+00],
+          [  2.22044605e-16]],
+  
+         [[ -1.00000000e+00],
+          [  6.10622664e-16],
+          [  5.55111512e-16]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D010': array([[ -1.31656255e-16,  -1.89606678e-16,  -1.00000000e+00,
+            1.23778550e-16,   1.00000000e+00,  -1.00000000e+00]]), 'FE1_C2_D010': array([[  1.00000000e+00,   3.33066907e-16,   3.32868111e-16,
+           -1.00000000e+00,   1.00000000e+00,   6.10622664e-16]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D010': array([[ -1.84937612e-16,   3.10503271e-17,   6.10622664e-16,
+            1.24201308e-16,  -8.32667268e-16,   6.66133815e-16]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D001': array([[  1.42304643e-16,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   5.55111512e-16,  -1.00000000e+00]]), 'FE1_C0': array([[  8.10259588e-17,  -2.50000000e-01,  -2.50000000e-01,
+            2.50000000e-01,   2.50000000e-01,   5.00000000e-01]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D100': array([[  1.68780044e-32,  -3.79213356e-16,  -5.82117938e-16,
+            3.79213356e-16,   5.82117938e-16,  -9.61331293e-16]]), 'FE1_C2_D001': array([[  3.88578059e-16,   6.10622664e-16,   7.86445687e-17,
+           -9.99200722e-16,   2.22044605e-16,   5.55111512e-16]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D100': array([[ -3.04047097e-16,   9.50147179e-17,   1.00000000e+00,
+            3.80058872e-16,  -1.00000000e+00,   1.00000000e+00]]), 'FE1_C2_D100': array([[  3.42052984e-16,   1.00000000e+00,  -1.90029436e-16,
+           -1.00000000e+00,   3.80058872e-16,   1.00000000e+00]]), 'FE1_C1': array([[ -2.50000000e-01,  -3.22762902e-17,   2.50000000e-01,
+            2.50000000e-01,   5.00000000e-01,   2.50000000e-01]]), 'FE1_C1_D001': array([[ -1.00000000e+00,   2.59243420e-16,   3.88578059e-16,
+            1.00000000e+00,  -1.00000000e+00,   6.10622664e-16]]), 'FE1_C2': array([[  2.50000000e-01,   2.50000000e-01,   1.04997706e-16,
+            5.00000000e-01,   2.50000000e-01,   2.50000000e-01]])}
+  
+  tables: {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D010': array([[ -1.31656255e-16,  -1.89606678e-16,  -1.00000000e+00,
+            1.23778550e-16,   1.00000000e+00,  -1.00000000e+00]]), 'FE1_C2_D010': array([[  1.00000000e+00,   3.33066907e-16,   3.32868111e-16,
+           -1.00000000e+00,   1.00000000e+00,   6.10622664e-16]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D001': array([[  1.42304643e-16,  -1.00000000e+00,  -1.66533454e-16,
+            1.00000000e+00,   5.55111512e-16,  -1.00000000e+00]]), 'FE1_C0': array([[  8.10259588e-17,  -2.50000000e-01,  -2.50000000e-01,
+            2.50000000e-01,   2.50000000e-01,   5.00000000e-01]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D100': array([[  1.68780044e-32,  -3.79213356e-16,  -5.82117938e-16,
+            3.79213356e-16,   5.82117938e-16,  -9.61331293e-16]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C1_D100': array([[ -3.04047097e-16,   9.50147179e-17,   1.00000000e+00,
+            3.80058872e-16,  -1.00000000e+00,   1.00000000e+00]]), 'FE1_C2_D100': array([[  3.42052984e-16,   1.00000000e+00,  -1.90029436e-16,
+           -1.00000000e+00,   3.80058872e-16,   1.00000000e+00]]), 'FE1_C1': array([[ -2.50000000e-01,  -3.22762902e-17,   2.50000000e-01,
+            2.50000000e-01,   5.00000000e-01,   2.50000000e-01]]), 'FE1_C1_D001': array([[ -1.00000000e+00,   2.59243420e-16,   3.88578059e-16,
+            1.00000000e+00,  -1.00000000e+00,   6.10622664e-16]]), 'FE1_C2': array([[  2.50000000e-01,   2.50000000e-01,   1.04997706e-16,
+            5.00000000e-01,   2.50000000e-01,   2.50000000e-01]])}
+  
+  name_map: {'FE1_C0_D100': ['FE1_C1_D010', 'FE1_C2_D001']}
+  
+  inv_name_map: {'FE0_C2_D001': 'FE0_C2_D001', 'FE0_C1_D010': 'FE0_C1_D010', 'FE1_C0_D010': 'FE1_C0_D010', 'FE1_C2_D010': 'FE1_C2_D010', 'FE0_C0_D010': 'FE0_C0_D010', 'FE1_C1_D010': 'FE1_C0_D100', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0', 'FE0_C2_D010': 'FE0_C2_D010', 'FE0_C2_D100': 'FE0_C2_D100', 'FE0_C1_D001': 'FE0_C1_D001', 'FE1_C0_D001': 'FE1_C0_D001', 'FE1_C0': 'FE1_C0', 'FE0_C1_D100': 'FE0_C1_D100', 'FE0_C0_D100': 'FE0_C0_D100', 'FE1_C0_D100': 'FE1_C0_D100', 'FE1_C2_D001': 'FE1_C0_D100', 'FE0_C0_D001': 'FE0_C0_D001', 'FE1_C1_D100': 'FE1_C1_D100', 'FE1_C2_D100': 'FE1_C2_D100', 'FE1_C1': 'FE1_C1', 'FE1_C1_D001': 'FE1_C1_D001', 'FE1_C2': 'FE1_C2'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25]]), 'FE1_C0_D001': array([[-1.,  1., -1.]]), 'FE1_C0': array([[-0.25, -0.25,  0.25,  0.25,  0.5 ]]), 'FE1_C0_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[-1.,  1.]]), 'FE1_C1_D100': array([[ 1., -1.,  1.]]), 'FE1_C1': array([[-0.25,  0.25,  0.25,  0.5 ,  0.25]]), 'FE1_C2': array([[ 0.25,  0.25,  0.5 ,  0.25,  0.25]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C2_D001': ('FE0_C0_D001', (9, [8, 11]), False, False), 'FE0_C1_D010': ('FE0_C0_D001', (6, [4, 6]), False, False), 'FE1_C0_D010': ('FE1_C0_D001', (14, [2, 4, 5]), False, False), 'FE1_C2_D010': ('FE1_C1_D100', (19, [0, 3, 4]), False, False), 'FE0_C0_D010': ('FE0_C0_D001', (2, [0, 2]), False, False), 'FE1_C1_D010': ('FE1_C0_D100', (), True, False), 'FE0_C2': ('FE0_C0', (8, [8, 9, 10, 11]), False, False), 'FE0_C1': ('FE0_C0', (4, [4, 5, 6, 7]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2, 3]), False, False), 'FE0_C2_D010': ('FE0_C0_D001', (10, [8, 10]), False, False), 'FE0_C2_D100': ('FE0_C0_D001', (11, [8, 9]), False, False), 'FE0_C1_D001': ('FE0_C0_D001', (5, [4, 7]), False, False), 'FE1_C0_D001': ('FE1_C0_D001', (13, [1, 3, 5]), False, False), 'FE1_C0': ('FE1_C0', (12, [1, 2, 3, 4, 5]), False, False), 'FE0_C1_D100': ('FE0_C0_D001', (7, [4, 5]), False, False), 'FE0_C0_D100': ('FE0_C0_D001', (3, [0, 1]), False, False), 'FE1_C0_D100': ('FE1_C0_D100', (), True, False), 'FE1_C2_D001': ('FE1_C0_D100', (), True, False), 'FE0_C0_D001': ('FE0_C0_D001', (1, [0, 3]), False, False), 'FE1_C1_D100': ('FE1_C1_D100', (17, [2, 4, 5]), False, False), 'FE1_C2_D100': ('FE1_C1_D100', (20, [1, 3, 5]), False, False), 'FE1_C1': ('FE1_C1', (15, [0, 2, 3, 4, 5]), False, False), 'FE1_C1_D001': ('FE1_C0_D001', (16, [0, 3, 4]), False, False), 'FE1_C2': ('FE1_C2', (18, [0, 1, 3, 4, 5]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  648 entries computed in 0.00155 seconds
+  Shape of reference tensor: (6, 3, 12, 3)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 3 dims = [3, 12, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [0, 3, 0], [0, 3, 1], [0, 3, 2], [0, 4, 0], [0, 4, 1], [0, 4, 2], [0, 5, 0], [0, 5, 1], [0, 5, 2], [0, 6, 0], [0, 6, 1], [0, 6, 2], [0, 7, 0], [0, 7, 1], [0, 7, 2], [0, 8, 0], [0, 8, 1], [0, 8, 2], [0, 9, 0], [0, 9, 1], [0, 9, 2], [0, 10, 0], [0, 10, 1], [0, 10, 2], [0, 11, 0], [0, 11, 1], [0, 11, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [1, 3, 0], [1, 3, 1], [1, 3, 2], [1, 4, 0], [1, 4, 1], [1, 4, 2], [1, 5, 0], [1, 5, 1], [1, 5, 2], [1, 6, 0], [1, 6, 1], [1, 6, 2], [1, 7, 0], [1, 7, 1], [1, 7, 2], [1, 8, 0], [1, 8, 1], [1, 8, 2], [1, 9, 0], [1, 9, 1], [1, 9, 2], [1, 10, 0], [1, 10, 1], [1, 10, 2], [1, 11, 0], [1, 11, 1], [1, 11, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [2, 3, 0], [2, 3, 1], [2, 3, 2], [2, 4, 0], [2, 4, 1], [2, 4, 2], [2, 5, 0], [2, 5, 1], [2, 5, 2], [2, 6, 0], [2, 6, 1], [2, 6, 2], [2, 7, 0], [2, 7, 1], [2, 7, 2], [2, 8, 0], [2, 8, 1], [2, 8, 2], [2, 9, 0], [2, 9, 1], [2, 9, 2], [2, 10, 0], [2, 10, 1], [2, 10, 2], [2, 11, 0], [2, 11, 1], [2, 11, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [3, 12, 3] indices = [[0, 0, 0], [0, 0, 1], [0, 0, 2], [0, 1, 0], [0, 1, 1], [0, 1, 2], [0, 2, 0], [0, 2, 1], [0, 2, 2], [0, 3, 0], [0, 3, 1], [0, 3, 2], [0, 4, 0], [0, 4, 1], [0, 4, 2], [0, 5, 0], [0, 5, 1], [0, 5, 2], [0, 6, 0], [0, 6, 1], [0, 6, 2], [0, 7, 0], [0, 7, 1], [0, 7, 2], [0, 8, 0], [0, 8, 1], [0, 8, 2], [0, 9, 0], [0, 9, 1], [0, 9, 2], [0, 10, 0], [0, 10, 1], [0, 10, 2], [0, 11, 0], [0, 11, 1], [0, 11, 2], [1, 0, 0], [1, 0, 1], [1, 0, 2], [1, 1, 0], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [1, 3, 0], [1, 3, 1], [1, 3, 2], [1, 4, 0], [1, 4, 1], [1, 4, 2], [1, 5, 0], [1, 5, 1], [1, 5, 2], [1, 6, 0], [1, 6, 1], [1, 6, 2], [1, 7, 0], [1, 7, 1], [1, 7, 2], [1, 8, 0], [1, 8, 1], [1, 8, 2], [1, 9, 0], [1, 9, 1], [1, 9, 2], [1, 10, 0], [1, 10, 1], [1, 10, 2], [1, 11, 0], [1, 11, 1], [1, 11, 2], [2, 0, 0], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2], [2, 3, 0], [2, 3, 1], [2, 3, 2], [2, 4, 0], [2, 4, 1], [2, 4, 2], [2, 5, 0], [2, 5, 1], [2, 5, 2], [2, 6, 0], [2, 6, 1], [2, 6, 2], [2, 7, 0], [2, 7, 1], [2, 7, 2], [2, 8, 0], [2, 8, 1], [2, 8, 2], [2, 9, 0], [2, 9, 1], [2, 9, 2], [2, 10, 0], [2, 10, 1], [2, 10, 2], [2, 11, 0], [2, 11, 1], [2, 11, 2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.239943 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.067342 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.478033 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000754833 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./EddyCurrents.h.
+  
+Compiler stage 5 finished in 0.00142312 seconds.
+
+FFC finished in 0.832775 seconds.
diff --git a/demo/undocumented/curl-curl/cpp/main.cpp b/demo/undocumented/curl-curl/cpp/main.cpp
new file mode 100644
index 0000000..501d1cc
--- /dev/null
+++ b/demo/undocumented/curl-curl/cpp/main.cpp
@@ -0,0 +1,135 @@
+// Copyright (C) 2009 Bartosz Sawicki
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-03-30
+// Last changed: 2012-11-12
+//
+// Eddy currents phenomena in low conducting body can be
+// described using electric vector potential and curl-curl operator:
+//
+//    \nabla \times \nabla \times T = - \frac{\partial B}{\partial t}
+//
+// Electric vector potential defined as:
+//
+//    \nabla \times T = J
+//
+// Boundary condition
+//
+//    J_n = 0,
+//    T_t=T_w=0, \frac{\partial T_n}{\partial n} = 0
+// which is naturaly fulfilled for zero Dirichlet BC with Nedelec (edge)
+// elements.
+
+#include <dolfin.h>
+#include "EddyCurrents.h"
+#include "CurrentDensity.h"
+
+using namespace dolfin;
+
+#ifdef HAS_CGAL
+
+int main()
+{
+  // Homogenous external magnetic field (dB/dt)
+  class Source : public Expression
+  {
+  public:
+
+    Source() : Expression(3) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = 0.0;
+      values[1] = 0.0;
+      values[2] = 1.0;
+    }
+
+  };
+
+  // Zero Dirichlet BC
+  class Zero : public Expression
+  {
+  public:
+
+    Zero() : Expression(3) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = 0.0;
+      values[1] = 0.0;
+      values[2] = 0.0;
+    }
+
+  };
+
+  // Everywhere on external surface
+  class DirichletBoundary: public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    { return on_boundary; }
+  };
+
+  // Create sphere mesh
+  SphereMesh mesh(Point(0.0, 0.0, 0.0), 1.0, 0.2);
+
+  // Define functions
+  Source dbdt;
+  Zero zero;
+
+  // Define function space and boundary condition
+  EddyCurrents::FunctionSpace V(mesh);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, zero, boundary);
+
+  // Define variational problem for T
+  EddyCurrents::BilinearForm a(V,V);
+  EddyCurrents::LinearForm L(V);
+  L.dbdt = dbdt;
+
+  // Compute solution
+  Function T(V);
+  solve(a == L, T, bc);
+
+  // Define variational problem for J
+  CurrentDensity::FunctionSpace V1(mesh);
+  CurrentDensity::BilinearForm a1(V1,V1);
+  CurrentDensity::LinearForm L1(V1);
+  L1.T = T;
+
+  // Solve problem using default solver
+  Function J(V1);
+  solve(a1 == L1, J);
+
+  File file("current_density.pvd");
+  file << J;
+
+  // Plot solution
+  plot(J);
+  interactive();
+
+  return 0;
+}
+
+#else
+
+int main()
+{
+  info("DOLFIN must be compiled with CGAL to run this demo.");
+  return 0;
+}
+
+#endif
diff --git a/demo/undocumented/curl-curl/python/demo_curl-curl.py b/demo/undocumented/curl-curl/python/demo_curl-curl.py
new file mode 100644
index 0000000..7b83acc
--- /dev/null
+++ b/demo/undocumented/curl-curl/python/demo_curl-curl.py
@@ -0,0 +1,89 @@
+"""Eddy currents phenomena in low conducting body can be described
+using electric vector potential and curl-curl operator:
+
+   \nabla \times \nabla \times T = - \frac{\partial B}{\partial t}
+
+Electric vector potential defined as:
+
+   \nabla \times T = J
+
+Boundary condition:
+
+   J_n = 0,
+
+   T_t=T_w=0, \frac{\partial T_n}{\partial n} = 0
+
+which is naturaly fulfilled for zero Dirichlet BC with Nedelec (edge)
+elements.
+
+"""
+
+# Copyright (C) 2009 Bartosz Sawicki
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2009-04-02
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+# Create sphere mesh
+mesh = SphereMesh(Point(0.0, 0.0, 0.0), 1.0, 0.1)
+
+# Define function spaces
+P1 = VectorFunctionSpace(mesh, "CG", 1)
+PN = FunctionSpace(mesh, "Nedelec 1st kind H(curl)", 1)
+
+# Define test and trial functions
+v0 = TestFunction(PN)
+u0 = TrialFunction(PN)
+v1 = TestFunction(P1)
+u1 = TrialFunction(P1)
+
+# Define functions
+dbdt = Expression(("0.0", "0.0", "1.0"), degree=1)
+zero = Expression(("0.0", "0.0", "0.0"), degree=1)
+T = Function(PN)
+J = Function(P1)
+
+# Dirichlet boundary
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary
+
+# Boundary condition
+bc = DirichletBC(PN, zero, DirichletBoundary())
+
+# Solve eddy currents equation (using potential T)
+solve(inner(curl(v0), curl(u0))*dx == -inner(v0, dbdt)*dx, T, bc)
+
+# Solve density equation
+solve(inner(v1, u1)*dx == dot(v1, curl(T))*dx, J)
+
+# Plot solution
+plot(J)
+
+file=File("current_density.pvd")
+file << J
+
+# Hold plot
+interactive()
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.h b/demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.h
new file mode 100644
index 0000000..065b75d
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.h
@@ -0,0 +1,9504 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ADVECTIONDIFFUSION_H
+#define __ADVECTIONDIFFUSION_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class advectiondiffusion_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new advectiondiffusion_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class advectiondiffusion_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new advectiondiffusion_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class advectiondiffusion_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new advectiondiffusion_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class advectiondiffusion_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new advectiondiffusion_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class advectiondiffusion_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new advectiondiffusion_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class advectiondiffusion_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new advectiondiffusion_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class advectiondiffusion_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new advectiondiffusion_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class advectiondiffusion_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 3*c.entity_indices[2][0];
+    dofs[1] = 3*c.entity_indices[2][0] + 1;
+    dofs[2] = 3*c.entity_indices[2][0] + 2;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new advectiondiffusion_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class advectiondiffusion_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    46
+    // Number of operations (multiply-add pairs) for tensor contraction: 155
+    // Total number of operations (multiply-add pairs):                  204
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0_0 = det*(w[1][0]*((K[0]*K[0] + K[1]*K[1])));
+    const double G0_0_0_1 = det*(w[1][0]*((K[0]*K[2] + K[1]*K[3])));
+    const double G0_1_0_0 = det*(w[1][0]*((K[2]*K[0] + K[3]*K[1])));
+    const double G0_1_0_1 = det*(w[1][0]*((K[2]*K[2] + K[3]*K[3])));
+    const double G1_0_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G1_0_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G1_0_2_0 = det*w[0][2]*K[0]*(1.0);
+    const double G1_0_3_0 = det*w[0][3]*K[0]*(1.0);
+    const double G1_0_4_0 = det*w[0][4]*K[0]*(1.0);
+    const double G1_0_5_0 = det*w[0][5]*K[0]*(1.0);
+    const double G1_0_6_1 = det*w[0][6]*K[1]*(1.0);
+    const double G1_0_7_1 = det*w[0][7]*K[1]*(1.0);
+    const double G1_0_8_1 = det*w[0][8]*K[1]*(1.0);
+    const double G1_0_9_1 = det*w[0][9]*K[1]*(1.0);
+    const double G1_0_10_1 = det*w[0][10]*K[1]*(1.0);
+    const double G1_0_11_1 = det*w[0][11]*K[1]*(1.0);
+    const double G1_1_0_0 = det*w[0][0]*K[2]*(1.0);
+    const double G1_1_1_0 = det*w[0][1]*K[2]*(1.0);
+    const double G1_1_2_0 = det*w[0][2]*K[2]*(1.0);
+    const double G1_1_3_0 = det*w[0][3]*K[2]*(1.0);
+    const double G1_1_4_0 = det*w[0][4]*K[2]*(1.0);
+    const double G1_1_5_0 = det*w[0][5]*K[2]*(1.0);
+    const double G1_1_6_1 = det*w[0][6]*K[3]*(1.0);
+    const double G1_1_7_1 = det*w[0][7]*K[3]*(1.0);
+    const double G1_1_8_1 = det*w[0][8]*K[3]*(1.0);
+    const double G1_1_9_1 = det*w[0][9]*K[3]*(1.0);
+    const double G1_1_10_1 = det*w[0][10]*K[3]*(1.0);
+    const double G1_1_11_1 = det*w[0][11]*K[3]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0_0 + 0.5*G0_0_0_1 + 0.5*G0_1_0_0 + 0.5*G0_1_0_1 + 0.0166666666666666*G1_0_0_0 - 0.00833333333333333*G1_0_1_0 - 0.00833333333333332*G1_0_2_0 + 0.0333333333333333*G1_0_3_0 + 0.0666666666666667*G1_0_4_0 + 0.0666666666666667*G1_0_5_0 + 0.0166666666666666*G1_0_6_1 - 0.00833333333333333*G1_0_7_1 - 0.00833333333333332*G1_0_8_1 + 0.0333333333333333*G1_0_9_1 + 0.0666666666666667*G1_0_10_1 + 0.0666666666666667*G1_0_11_1 + 0.0166666666666666*G1_1_0_0 - 0.00833333333333333*G1_1_1_0 - 0.00833333333333332*G1_1_2_0 + 0.0333333333333333*G1_1_3_0 + 0.0666666666666667*G1_1_4_0 + 0.0666666666666667*G1_1_5_0 + 0.0166666666666666*G1_1_6_1 - 0.00833333333333333*G1_1_7_1 - 0.00833333333333332*G1_1_8_1 + 0.0333333333333333*G1_1_9_1 + 0.0666666666666667*G1_1_10_1 + 0.0666666666666667*G1_1_11_1;
+    A[1] = -0.5*G0_0_0_0 - 0.5*G0_1_0_0 - 0.00833333333333332*G1_0_0_0 + 0.0166666666666666*G1_0_1_0 - 0.00833333333333332*G1_0_2_0 + 0.0666666666666667*G1_0_3_0 + 0.0333333333333333*G1_0_4_0 + 0.0666666666666667*G1_0_5_0 - 0.00833333333333332*G1_0_6_1 + 0.0166666666666666*G1_0_7_1 - 0.00833333333333332*G1_0_8_1 + 0.0666666666666667*G1_0_9_1 + 0.0333333333333333*G1_0_10_1 + 0.0666666666666667*G1_0_11_1 - 0.00833333333333332*G1_1_0_0 + 0.0166666666666666*G1_1_1_0 - 0.00833333333333332*G1_1_2_0 + 0.0666666666666667*G1_1_3_0 + 0.0333333333333333*G1_1_4_0 + 0.0666666666666667*G1_1_5_0 - 0.00833333333333332*G1_1_6_1 + 0.0166666666666666*G1_1_7_1 - 0.00833333333333332*G1_1_8_1 + 0.0666666666666667*G1_1_9_1 + 0.0333333333333333*G1_1_10_1 + 0.0666666666666667*G1_1_11_1;
+    A[2] = -0.5*G0_0_0_1 - 0.5*G0_1_0_1 - 0.00833333333333332*G1_0_0_0 - 0.00833333333333333*G1_0_1_0 + 0.0166666666666666*G1_0_2_0 + 0.0666666666666667*G1_0_3_0 + 0.0666666666666667*G1_0_4_0 + 0.0333333333333333*G1_0_5_0 - 0.00833333333333332*G1_0_6_1 - 0.00833333333333333*G1_0_7_1 + 0.0166666666666666*G1_0_8_1 + 0.0666666666666667*G1_0_9_1 + 0.0666666666666667*G1_0_10_1 + 0.0333333333333333*G1_0_11_1 - 0.00833333333333332*G1_1_0_0 - 0.00833333333333333*G1_1_1_0 + 0.0166666666666666*G1_1_2_0 + 0.0666666666666667*G1_1_3_0 + 0.0666666666666667*G1_1_4_0 + 0.0333333333333333*G1_1_5_0 - 0.00833333333333332*G1_1_6_1 - 0.00833333333333333*G1_1_7_1 + 0.0166666666666666*G1_1_8_1 + 0.0666666666666667*G1_1_9_1 + 0.0666666666666667*G1_1_10_1 + 0.0333333333333333*G1_1_11_1;
+    A[3] = -0.5*G0_0_0_0 - 0.5*G0_0_0_1 - 0.0166666666666666*G1_0_0_0 + 0.00833333333333333*G1_0_1_0 + 0.00833333333333332*G1_0_2_0 - 0.0333333333333333*G1_0_3_0 - 0.0666666666666667*G1_0_4_0 - 0.0666666666666667*G1_0_5_0 - 0.0166666666666666*G1_0_6_1 + 0.00833333333333333*G1_0_7_1 + 0.00833333333333332*G1_0_8_1 - 0.0333333333333333*G1_0_9_1 - 0.0666666666666667*G1_0_10_1 - 0.0666666666666667*G1_0_11_1;
+    A[4] = 0.5*G0_0_0_0 + 0.00833333333333332*G1_0_0_0 - 0.0166666666666666*G1_0_1_0 + 0.00833333333333332*G1_0_2_0 - 0.0666666666666667*G1_0_3_0 - 0.0333333333333333*G1_0_4_0 - 0.0666666666666667*G1_0_5_0 + 0.00833333333333332*G1_0_6_1 - 0.0166666666666666*G1_0_7_1 + 0.00833333333333332*G1_0_8_1 - 0.0666666666666667*G1_0_9_1 - 0.0333333333333333*G1_0_10_1 - 0.0666666666666667*G1_0_11_1;
+    A[5] = 0.5*G0_0_0_1 + 0.00833333333333332*G1_0_0_0 + 0.00833333333333333*G1_0_1_0 - 0.0166666666666666*G1_0_2_0 - 0.0666666666666667*G1_0_3_0 - 0.0666666666666667*G1_0_4_0 - 0.0333333333333333*G1_0_5_0 + 0.00833333333333332*G1_0_6_1 + 0.00833333333333333*G1_0_7_1 - 0.0166666666666666*G1_0_8_1 - 0.0666666666666667*G1_0_9_1 - 0.0666666666666667*G1_0_10_1 - 0.0333333333333333*G1_0_11_1;
+    A[6] = -0.5*G0_1_0_0 - 0.5*G0_1_0_1 - 0.0166666666666666*G1_1_0_0 + 0.00833333333333333*G1_1_1_0 + 0.00833333333333332*G1_1_2_0 - 0.0333333333333333*G1_1_3_0 - 0.0666666666666667*G1_1_4_0 - 0.0666666666666667*G1_1_5_0 - 0.0166666666666666*G1_1_6_1 + 0.00833333333333333*G1_1_7_1 + 0.00833333333333332*G1_1_8_1 - 0.0333333333333333*G1_1_9_1 - 0.0666666666666667*G1_1_10_1 - 0.0666666666666667*G1_1_11_1;
+    A[7] = 0.5*G0_1_0_0 + 0.00833333333333332*G1_1_0_0 - 0.0166666666666666*G1_1_1_0 + 0.00833333333333332*G1_1_2_0 - 0.0666666666666667*G1_1_3_0 - 0.0333333333333333*G1_1_4_0 - 0.0666666666666667*G1_1_5_0 + 0.00833333333333332*G1_1_6_1 - 0.0166666666666666*G1_1_7_1 + 0.00833333333333332*G1_1_8_1 - 0.0666666666666667*G1_1_9_1 - 0.0333333333333333*G1_1_10_1 - 0.0666666666666667*G1_1_11_1;
+    A[8] = 0.5*G0_1_0_1 + 0.00833333333333332*G1_1_0_0 + 0.00833333333333333*G1_1_1_0 - 0.0166666666666666*G1_1_2_0 - 0.0666666666666667*G1_1_3_0 - 0.0666666666666667*G1_1_4_0 - 0.0333333333333333*G1_1_5_0 + 0.00833333333333332*G1_1_6_1 + 0.00833333333333333*G1_1_7_1 - 0.0166666666666666*G1_1_8_1 - 0.0666666666666667*G1_1_9_1 - 0.0666666666666667*G1_1_10_1 - 0.0333333333333333*G1_1_11_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class advectiondiffusion_exterior_facet_integral_0_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_exterior_facet_integral_0_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_exterior_facet_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates[2*facet] - vertex_coordinates[2*v0]) - dx0*(vertex_coordinates[2*facet + 1] - vertex_coordinates[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n0 = direction ? dx1 / det : -dx1 / det;
+    const double n1 = direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.277777777777778, 0.444444444444444, 0.277777777777778};
+    // Quadrature points on the UFC reference element: (0.112701665379258), (0.5), (0.887298334620742)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[3][2] = \
+    {{0.887298334620742, 0.112701665379258},
+    {0.5, 0.5},
+    {0.112701665379258, 0.887298334620742}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    static const double FE2_f0_C0[3][3] = \
+    {{0.687298334620742, -0.0872983346207417, 0.4},
+    {0.0, 0.0, 1.0},
+    {-0.0872983346207416, 0.687298334620742, 0.4}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[3] = {7, 8, 9};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc13[3] = {1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc18[3] = {6, 7, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[3] = {0, 1, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc15[3] = {0, 2, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[3] = {6, 8, 10};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 5.
+    double G[3];
+    G[0] = 0.5*det*n0;
+    G[1] = 0.5*det*n1;
+    G[2] = 0.5*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 102
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 102
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        
+        // Total number of operations to compute function values = 12
+        for (unsigned int r = 0; r < 3; r++)
+        {
+          F0 += FE2_f0_C0[ip][r]*w[0][nzc13[r]];
+          F1 += FE2_f0_C0[ip][r]*w[0][nzc14[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 10
+        double I[1];
+        // Number of operations: 10
+        I[0] = W3[ip]*(F0*G[0] + F1*G[1] + G[2]*std::abs((F0*n0 + F1*n1)));
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          for (unsigned int k = 0; k < 2; k++)
+          {
+            // Number of operations to compute entry: 3
+            A[nzc0[j]*3 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+          } // end loop over 'k'
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 102
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 102
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        
+        // Total number of operations to compute function values = 12
+        for (unsigned int r = 0; r < 3; r++)
+        {
+          F0 += FE2_f0_C0[ip][r]*w[0][nzc15[r]];
+          F1 += FE2_f0_C0[ip][r]*w[0][nzc16[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 10
+        double I[1];
+        // Number of operations: 10
+        I[0] = W3[ip]*(F0*G[0] + F1*G[1] + G[2]*std::abs((F0*n0 + F1*n1)));
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          for (unsigned int k = 0; k < 2; k++)
+          {
+            // Number of operations to compute entry: 3
+            A[nzc1[j]*3 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+          } // end loop over 'k'
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 102
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 102
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        double F1 = 0.0;
+        
+        // Total number of operations to compute function values = 12
+        for (unsigned int r = 0; r < 3; r++)
+        {
+          F0 += FE2_f0_C0[ip][r]*w[0][nzc17[r]];
+          F1 += FE2_f0_C0[ip][r]*w[0][nzc18[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 10
+        double I[1];
+        // Number of operations: 10
+        I[0] = W3[ip]*(F0*G[0] + F1*G[1] + G[2]*std::abs((F0*n0 + F1*n1)));
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          for (unsigned int k = 0; k < 2; k++)
+          {
+            // Number of operations to compute entry: 3
+            A[nzc2[j]*3 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+          } // end loop over 'k'
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// interior facet tensor corresponding to the local contribution to
+/// a form from the integral over an interior facet.
+
+class advectiondiffusion_interior_facet_integral_0_otherwise: public ufc::interior_facet_integral
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_interior_facet_integral_0_otherwise() : ufc::interior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_interior_facet_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local interior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates_0,
+                               const double*  vertex_coordinates_1,
+                               std::size_t facet_0,
+                               std::size_t facet_1,
+                               int cell_orientation_0,
+                               int cell_orientation_1) const
+  {
+    // Compute Jacobian
+    double J_0[4];
+    compute_jacobian_triangle_2d(J_0, vertex_coordinates_0);
+    
+    // Compute Jacobian inverse and determinant
+    double K_0[4];
+    double detJ_0;
+    compute_jacobian_inverse_triangle_2d(K_0, detJ_0, J_0);
+    
+    // Compute Jacobian
+    double J_1[4];
+    compute_jacobian_triangle_2d(J_1, vertex_coordinates_1);
+    
+    // Compute Jacobian inverse and determinant
+    double K_1[4];
+    double detJ_1;
+    compute_jacobian_inverse_triangle_2d(K_1, detJ_1, J_1);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet_0][0];
+    const unsigned int v1 = edge_vertices[facet_0][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates_0[2*v1 + 0] - vertex_coordinates_0[2*v0 + 0];
+    const double dx1 = vertex_coordinates_0[2*v1 + 1] - vertex_coordinates_0[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates_0[2*facet_0] - vertex_coordinates_0[2*v0]) - dx0*(vertex_coordinates_0[2*facet_0 + 1] - vertex_coordinates_0[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n_00 = direction ? dx1 / det : -dx1 / det;
+    const double n_01 = direction ? -dx0 / det : dx0 / det;// Compute facet normals from the facet scale factor constants
+    const double n_10 = !direction ? dx1 / det : -dx1 / det;
+    const double n_11 = !direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    const double volume_0 = std::abs(detJ_0)/2.0;
+    // Compute cell volume
+    const double volume_1 = std::abs(detJ_1)/2.0;
+    
+    
+    // Compute circumradius of triangle in 2D
+    const double v1v2_0  = std::sqrt((vertex_coordinates_0[4] - vertex_coordinates_0[2])*(vertex_coordinates_0[4] - vertex_coordinates_0[2]) + (vertex_coordinates_0[5] - vertex_coordinates_0[3])*(vertex_coordinates_0[5] - vertex_coordinates_0[3]) );
+    const double v0v2_0  = std::sqrt(J_0[3]*J_0[3] + J_0[1]*J_0[1]);
+    const double v0v1_0  = std::sqrt(J_0[0]*J_0[0] + J_0[2]*J_0[2]);
+    const double circumradius_0 = 0.25*(v1v2_0*v0v2_0*v0v1_0)/(volume_0);
+    // Compute circumradius of triangle in 2D
+    const double v1v2_1  = std::sqrt((vertex_coordinates_1[4] - vertex_coordinates_1[2])*(vertex_coordinates_1[4] - vertex_coordinates_1[2]) + (vertex_coordinates_1[5] - vertex_coordinates_1[3])*(vertex_coordinates_1[5] - vertex_coordinates_1[3]) );
+    const double v0v2_1  = std::sqrt(J_1[3]*J_1[3] + J_1[1]*J_1[1]);
+    const double v0v1_1  = std::sqrt(J_1[0]*J_1[0] + J_1[2]*J_1[2]);
+    const double circumradius_1 = 0.25*(v1v2_1*v0v2_1*v0v1_1)/(volume_1);
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.277777777777778, 0.444444444444444, 0.277777777777778};
+    // Quadrature points on the UFC reference element: (0.112701665379258), (0.5), (0.887298334620742)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[3][2] = \
+    {{0.887298334620742, 0.112701665379258},
+    {0.5, 0.5},
+    {0.112701665379258, 0.887298334620742}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[2] = {0, 2};
+    
+    static const double FE0_f0_D01[3][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    static const double FE2_f0_C0[3][3] = \
+    {{0.687298334620742, -0.0872983346207417, 0.4},
+    {0.0, 0.0, 1.0},
+    {-0.0872983346207416, 0.687298334620742, 0.4}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[3] = {7, 8, 9};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc15[3] = {1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc20[3] = {6, 7, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[3] = {0, 1, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc17[3] = {0, 2, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc18[3] = {6, 8, 10};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 90.
+    double G[21];
+    G[0] = det*w[1][0]*w[2][0]*(n_10*n_10 + n_11*n_11)/(circumradius_0 + circumradius_1);
+    G[1] = 0.5*det*n_10;
+    G[2] = 0.5*det*n_11;
+    G[3] = 0.5*det;
+    G[4] = -0.5*det*w[1][0]*(K_1[2]*n_10 + K_1[3]*n_11);
+    G[5] = -0.5*det*w[1][0]*(K_1[0]*n_10 + K_1[1]*n_11);
+    G[6] = det*w[1][0]*w[2][0]*(n_00*n_10 + n_01*n_11)/(circumradius_0 + circumradius_1);
+    G[7] = -0.5*det*n_00;
+    G[8] = -0.5*det*n_01;
+    G[9] = -0.5*det;
+    G[10] = -0.5*det*w[1][0]*(K_0[2]*n_10 + K_0[3]*n_11);
+    G[11] = -0.5*det*w[1][0]*(K_0[0]*n_10 + K_0[1]*n_11);
+    G[12] = -0.5*det*w[1][0]*(K_1[2]*n_00 + K_1[3]*n_01);
+    G[13] = -0.5*det*w[1][0]*(K_1[0]*n_00 + K_1[1]*n_01);
+    G[14] = -0.5*det*n_10;
+    G[15] = -0.5*det*n_11;
+    G[16] = det*w[1][0]*w[2][0]*(n_00*n_00 + n_01*n_01)/(circumradius_0 + circumradius_1);
+    G[17] = 0.5*det*n_00;
+    G[18] = 0.5*det*n_01;
+    G[19] = -0.5*det*w[1][0]*(K_0[2]*n_00 + K_0[3]*n_01);
+    G[20] = -0.5*det*w[1][0]*(K_0[0]*n_00 + K_0[1]*n_01);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet_0)
+    {
+    case 0:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc15[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc16[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc15[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc16[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 11
+          I[0] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 1
+          I[1] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 11
+          I[3] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[4] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[5] = G[11]*W3[ip];
+          
+          // Number of operations: 1
+          I[6] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[7] = G[13]*W3[ip];
+          
+          // Number of operations: 11
+          I[8] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[9] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[10] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[11] = G[20]*W3[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc15[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc16[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc17[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc18[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 1
+          I[0] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[1] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 1
+          I[3] = G[13]*W3[ip];
+          
+          // Number of operations: 11
+          I[4] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[5] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[6] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[7] = G[11]*W3[ip];
+          
+          // Number of operations: 11
+          I[8] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[9] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[10] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[11] = G[20]*W3[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc15[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc16[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc19[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc20[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 1
+          I[0] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[1] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 1
+          I[3] = G[13]*W3[ip];
+          
+          // Number of operations: 11
+          I[4] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[5] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[6] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[7] = G[11]*W3[ip];
+          
+          // Number of operations: 11
+          I[8] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[9] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[10] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[11] = G[20]*W3[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[11];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc17[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc18[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc15[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc16[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 11
+          I[0] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 1
+          I[1] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 1
+          I[3] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[4] = G[11]*W3[ip];
+          
+          // Number of operations: 11
+          I[5] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[6] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[7] = G[13]*W3[ip];
+          
+          // Number of operations: 1
+          I[8] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[9] = G[20]*W3[ip];
+          
+          // Number of operations: 11
+          I[10] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[11] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc17[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc18[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc17[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc18[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 1
+          I[0] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[1] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 1
+          I[3] = G[13]*W3[ip];
+          
+          // Number of operations: 11
+          I[4] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 1
+          I[5] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[6] = G[11]*W3[ip];
+          
+          // Number of operations: 11
+          I[7] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[8] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[9] = G[20]*W3[ip];
+          
+          // Number of operations: 11
+          I[10] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[11] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc17[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc18[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc19[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc20[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 1
+          I[0] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[1] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 1
+          I[3] = G[13]*W3[ip];
+          
+          // Number of operations: 11
+          I[4] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 1
+          I[5] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[6] = G[11]*W3[ip];
+          
+          // Number of operations: 11
+          I[7] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[8] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[9] = G[20]*W3[ip];
+          
+          // Number of operations: 11
+          I[10] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[11] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc19[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc20[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc15[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc16[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 11
+          I[0] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 1
+          I[1] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 1
+          I[3] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[4] = G[11]*W3[ip];
+          
+          // Number of operations: 11
+          I[5] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[6] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[7] = G[13]*W3[ip];
+          
+          // Number of operations: 1
+          I[8] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[9] = G[20]*W3[ip];
+          
+          // Number of operations: 11
+          I[10] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[11] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc19[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc20[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc17[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc18[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 1
+          I[0] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[1] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 1
+          I[3] = G[13]*W3[ip];
+          
+          // Number of operations: 11
+          I[4] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 1
+          I[5] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[6] = G[11]*W3[ip];
+          
+          // Number of operations: 11
+          I[7] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[8] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[9] = G[20]*W3[ip];
+          
+          // Number of operations: 11
+          I[10] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[11] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 948
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 948
+        for (unsigned int ip = 0; ip < 3; ip++)
+        {
+          
+          // Coefficient declarations.
+          double F0 = 0.0;
+          double F1 = 0.0;
+          double F2 = 0.0;
+          double F3 = 0.0;
+          
+          // Total number of operations to compute function values = 24
+          for (unsigned int r = 0; r < 3; r++)
+          {
+            F0 += FE2_f0_C0[ip][r]*w[0][nzc19[r]];
+            F1 += FE2_f0_C0[ip][r]*w[0][nzc20[r]];
+            F2 += FE2_f0_C0[ip][r]*w[0][nzc19[r] + 12];
+            F3 += FE2_f0_C0[ip][r]*w[0][nzc20[r] + 12];
+          } // end loop over 'r'
+          
+          // Number of operations to compute ip constants: 52
+          double I[12];
+          // Number of operations: 1
+          I[0] = G[4]*W3[ip];
+          
+          // Number of operations: 1
+          I[1] = G[12]*W3[ip];
+          
+          // Number of operations: 1
+          I[2] = G[5]*W3[ip];
+          
+          // Number of operations: 1
+          I[3] = G[13]*W3[ip];
+          
+          // Number of operations: 11
+          I[4] = W3[ip]*(G[0] + F2*G[1] + F3*G[2] + G[3]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 1
+          I[5] = G[10]*W3[ip];
+          
+          // Number of operations: 1
+          I[6] = G[11]*W3[ip];
+          
+          // Number of operations: 11
+          I[7] = W3[ip]*(G[6] + F0*G[7] + F1*G[8] + G[9]*std::abs((F0*n_00 + F1*n_01)));
+          
+          // Number of operations: 1
+          I[8] = G[19]*W3[ip];
+          
+          // Number of operations: 1
+          I[9] = G[20]*W3[ip];
+          
+          // Number of operations: 11
+          I[10] = W3[ip]*(G[6] + F2*G[14] + F3*G[15] + G[9]*std::abs((F2*n_10 + F3*n_11)));
+          
+          // Number of operations: 11
+          I[11] = W3[ip]*(G[16] + F0*G[17] + F1*G[18] + G[3]*std::abs((F0*n_00 + F1*n_01)));
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[11];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class advectiondiffusion_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class advectiondiffusion_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "20f24628549d3724a4df32866f9f1e99233fd2e127950d32ce90505e88535e40a32732d1a5782202f19f7df1a96aeb873a61306e7873da472211379a64fee2ae";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_finite_element_3();
+        break;
+      }
+    case 2:
+      {
+        return new advectiondiffusion_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new advectiondiffusion_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new advectiondiffusion_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_dofmap_3();
+        break;
+      }
+    case 2:
+      {
+        return new advectiondiffusion_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new advectiondiffusion_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new advectiondiffusion_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new advectiondiffusion_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new advectiondiffusion_exterior_facet_integral_0_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return new advectiondiffusion_interior_facet_integral_0_otherwise();
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class advectiondiffusion_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  advectiondiffusion_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~advectiondiffusion_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "154ab9e78c019e1a649b5d78546dc0d7243447216aab68167696aeac9d9e479d959da6bc8b91c9f62d36a239a551a8c31286f05e6a9ef8b6de1c86be42e59cbe";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new advectiondiffusion_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new advectiondiffusion_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new advectiondiffusion_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace AdvectionDiffusion
+{
+
+class CoefficientSpace_alpha: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_alpha(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_alpha(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_alpha(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_alpha(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_alpha(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_alpha(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_alpha()
+  {
+  }
+
+};
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_kappa: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_kappa(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_kappa(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_kappa(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_kappa(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_kappa(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_kappa(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_kappa()
+  {
+  }
+
+};
+
+class CoefficientSpace_u: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_a_FunctionSpace_2;
+
+typedef CoefficientSpace_kappa Form_a_FunctionSpace_3;
+
+typedef CoefficientSpace_alpha Form_a_FunctionSpace_4;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 3), u(*this, 0), kappa(*this, 1), alpha(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& kappa, const dolfin::GenericFunction& alpha):
+    dolfin::Form(2, 3), u(*this, 0), kappa(*this, 1), alpha(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = u;
+    this->kappa = kappa;
+    this->alpha = alpha;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> kappa, std::shared_ptr<const dolfin::GenericFunction> alpha):
+    dolfin::Form(2, 3), u(*this, 0), kappa(*this, 1), alpha(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->u = *u;
+    this->kappa = *kappa;
+    this->alpha = *alpha;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 3), u(*this, 0), kappa(*this, 1), alpha(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u, const dolfin::GenericFunction& kappa, const dolfin::GenericFunction& alpha):
+    dolfin::Form(2, 3), u(*this, 0), kappa(*this, 1), alpha(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = u;
+    this->kappa = kappa;
+    this->alpha = alpha;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u, std::shared_ptr<const dolfin::GenericFunction> kappa, std::shared_ptr<const dolfin::GenericFunction> alpha):
+    dolfin::Form(2, 3), u(*this, 0), kappa(*this, 1), alpha(*this, 2)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->u = *u;
+    this->kappa = *kappa;
+    this->alpha = *alpha;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+    else if (name == "kappa")
+      return 1;
+    else if (name == "alpha")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    case 1:
+      return "kappa";
+    case 2:
+      return "alpha";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_u;
+  typedef Form_a_FunctionSpace_3 CoefficientSpace_kappa;
+  typedef Form_a_FunctionSpace_4 CoefficientSpace_alpha;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+  dolfin::CoefficientAssigner kappa;
+  dolfin::CoefficientAssigner alpha;
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new advectiondiffusion_finite_element_3()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new advectiondiffusion_dofmap_3()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new advectiondiffusion_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.ufl b/demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.ufl
new file mode 100644
index 0000000..a714ebe
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.ufl
@@ -0,0 +1,58 @@
+# Copyright (C) 2007 Kristian B. Oelgaard and Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2007-06-29
+# Last changed: 2011-03-09
+#
+# The bilinear form a(phi, v) and linear form L(v) for
+# advection-diffusion. Discontinuous formulation with upwinding.
+
+cell = triangle
+scalar = FiniteElement("Discontinuous Lagrange", cell, 1)
+vector = VectorElement("Lagrange", cell, 2)
+constant = FiniteElement("Discontinuous Lagrange", cell, 0)
+
+# Trial and test functions
+phi = TrialFunction(scalar)
+v   = TestFunction(scalar)
+
+u = Coefficient(vector)
+f = Coefficient(scalar)
+h = 2.0*Circumradius(cell)
+h_avg = (h('+') + h('-'))/2
+n = FacetNormal(cell)
+
+kappa = Constant(cell)
+alpha = Constant(cell)
+
+# ( dot(v, n) + |dot(v, n)| )/2.0
+un = (dot(u, n) + abs(dot(u, n)))/2.0
+
+# Bilinear form
+a_int = dot(kappa*grad(phi) - u*phi, grad(v))*dx
+
+a_fac = (kappa('+')*(alpha('+')/h_avg)*dot(jump(phi, n), jump(v, n))*dS
+         - kappa('+')*dot(jump(phi, n), avg(grad(v)))*dS
+         - kappa('+')*dot(avg(grad(phi)), jump(v, n))*dS)
+
+a_vel = (dot(un('+')*phi('+') - un('-')*phi('-'), jump(v))*dS
+         + dot(un*phi, v)*ds)
+
+a = a_int + a_fac + a_vel
+
+# Linear form
+L = v*f*dx
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/CMakeLists.txt b/demo/undocumented/dg-advection-diffusion/cpp/CMakeLists.txt
new file mode 100644
index 0000000..5fcca02
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_dg-advection-diffusion)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/Projection.h b/demo/undocumented/dg-advection-diffusion/cpp/Projection.h
new file mode 100644
index 0000000..d668f94
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/Projection.h
@@ -0,0 +1,3325 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __PROJECTION_H
+#define __PROJECTION_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class projection_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  projection_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new projection_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class projection_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  projection_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new projection_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class projection_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  projection_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 3*c.entity_indices[2][0];
+    dofs[1] = 3*c.entity_indices[2][0] + 1;
+    dofs[2] = 3*c.entity_indices[2][0] + 2;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new projection_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class projection_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  projection_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new projection_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class projection_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  projection_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 4
+    // Total number of operations (multiply-add pairs):                  7
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_;
+    A[1] = 0.0416666666666667*G0_;
+    A[2] = 0.0416666666666667*G0_;
+    A[3] = 0.0416666666666667*G0_;
+    A[4] = 0.0833333333333333*G0_;
+    A[5] = 0.0416666666666666*G0_;
+    A[6] = 0.0416666666666667*G0_;
+    A[7] = 0.0416666666666666*G0_;
+    A[8] = 0.0833333333333333*G0_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class projection_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  projection_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class projection_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  projection_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "e070dec8a6b4373dfa344ad7bfad8b639b98aad8754e0c26f64b544a88bb9709bfe3c9bdb825ce0db112da30044958b8f17e505a3980f82d89a189a55e5f6047";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new projection_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new projection_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new projection_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class projection_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  projection_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "2df015a0199216d2572ebcc3f4c2a536b8a766af9edd6fbaf71657386e33728c8965f867a16521939e614a36208c3b2b7271a00c919344b1b45e265f37e1b14f";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new projection_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Projection
+{
+
+class CoefficientSpace_phi0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_phi0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_phi0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_phi0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_phi0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_phi0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_phi0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_phi0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_phi0 Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), phi0(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& phi0):
+    dolfin::Form(1, 1), phi0(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->phi0 = phi0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> phi0):
+    dolfin::Form(1, 1), phi0(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->phi0 = *phi0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), phi0(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& phi0):
+    dolfin::Form(1, 1), phi0(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->phi0 = phi0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> phi0):
+    dolfin::Form(1, 1), phi0(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->phi0 = *phi0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "phi0")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "phi0";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_phi0;
+
+  // Coefficients
+  dolfin::CoefficientAssigner phi0;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/Projection.ufl b/demo/undocumented/dg-advection-diffusion/cpp/Projection.ufl
new file mode 100644
index 0000000..f849727
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/Projection.ufl
@@ -0,0 +1,32 @@
+# Copyright (C) 2008 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-05-05
+# Last changed: 2008-05-05
+
+DG = FiniteElement("Discontinuous Lagrange", triangle, 1)
+CG = FiniteElement("Lagrange", triangle, 1)
+
+# Test and trial functions
+v   = TestFunction(CG)
+phi = TrialFunction(CG)
+
+phi0 = Coefficient(DG)
+
+a = dot(v, phi)*dx
+L = dot(v, phi0)*dx
+
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/Velocity.h b/demo/undocumented/dg-advection-diffusion/cpp/Velocity.h
new file mode 100644
index 0000000..c899ed7
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/Velocity.h
@@ -0,0 +1,5113 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __VELOCITY_H
+#define __VELOCITY_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class velocity_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  velocity_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocity_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new velocity_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class velocity_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  velocity_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocity_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 10:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 11:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[8] = vals[1];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[10] = vals[1];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[11] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[6];
+    vertex_values[3] = dof_values[7];
+    vertex_values[5] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocity_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new velocity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new velocity_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class velocity_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  velocity_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocity_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new velocity_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class velocity_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  velocity_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~velocity_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 2, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0] + 2*num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+    dofs[6] = offset + c.entity_indices[0][0];
+    dofs[7] = offset + c.entity_indices[0][1];
+    dofs[8] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[9] = offset + c.entity_indices[1][0];
+    dofs[10] = offset + c.entity_indices[1][1];
+    dofs[11] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 7;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 10;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+      dofs[3] = 6;
+      dofs[4] = 7;
+      dofs[5] = 11;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 6;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 7;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 9;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+        dofs[1] = 10;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+        dofs[1] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    dof_coordinates[6][0] = vertex_coordinates[0];
+    dof_coordinates[6][1] = vertex_coordinates[1];
+    dof_coordinates[7][0] = vertex_coordinates[2];
+    dof_coordinates[7][1] = vertex_coordinates[3];
+    dof_coordinates[8][0] = vertex_coordinates[4];
+    dof_coordinates[8][1] = vertex_coordinates[5];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[10][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[10][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[11][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[11][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new velocity_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new velocity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new velocity_dofmap_1();
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Velocity
+{
+
+class FunctionSpace: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  FunctionSpace(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new velocity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new velocity_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~FunctionSpace()
+  {
+  }
+
+};
+
+}
+
+#endif
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/Velocity.ufl b/demo/undocumented/dg-advection-diffusion/cpp/Velocity.ufl
new file mode 100644
index 0000000..d703660
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/Velocity.ufl
@@ -0,0 +1,26 @@
+# Copyright (c) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-03-07
+# Last changed: 
+#
+# A continuous P2 vector element
+#
+# Compile this form with FFC: ffc -l dolfin Velocity.form
+
+element = VectorElement("Lagrange", triangle, 2)
+
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/compile.log b/demo/undocumented/dg-advection-diffusion/cpp/compile.log
new file mode 100644
index 0000000..a10981b
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/compile.log
@@ -0,0 +1,2743 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Projection
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, phi]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[phi0]'
+  Unique elements:        'CG1(?), DG1(?)'
+  Unique sub elements:    'CG1(?), DG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0192871 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 2 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 2 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000794 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  9 entries computed in 0.00104 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.01053 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000286102 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 2 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 2 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.089865 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000705957 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Projection.h.
+  
+Compiler stage 5 finished in 0.000886202 seconds.
+
+FFC finished in 0.121947 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling element Velocity
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+Compiler stage 1 finished in 0.000248909 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 2 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 2 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.012892 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  
+Compiler stage 3 finished in 0.000174999 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 2 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 2 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.259956 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000296831 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Velocity.h.
+  
+Compiler stage 5 finished in 0.00111485 seconds.
+
+FFC finished in 0.275217 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form AdvectionDiffusion
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, phi]'
+  Number of coefficients: 3
+  Coefficients:           '[w_0, c_2, c_3]'
+  Coefficient names:      '[u, kappa, alpha]'
+  Unique elements:        'DG1(?), Vector<2 x CG2(?)>, R0(?)'
+  Unique sub elements:    'DG1(?), Vector<2 x CG2(?)>, R0(?), CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 3
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 3
+  quadrature_degree: auto --> 3
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_1]'
+  Coefficient names:      '[f]'
+  Unique elements:        'DG1(?)'
+  Unique sub elements:    'DG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.046869 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 4 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 4 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  36 entries computed in 0.00159 seconds
+  Shape of reference tensor: (3, 3, 2, 1, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 3 dims = [2, 1, 2] indices = [[0, 0, 0], [0, 0, 1], [1, 0, 0], [1, 0, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [2, 1, 2] indices = [[0, 0, 0], [0, 0, 1], [1, 0, 0], [1, 0, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  432 entries computed in 0.00373 seconds
+  Shape of reference tensor: (3, 3, 2, 12, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 3 dims = [2, 12, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [0, 2, 0], [0, 2, 1], [0, 3, 0], [0, 3, 1], [0, 4, 0], [0, 4, 1], [0, 5, 0], [0, 5, 1], [0, 6, 0], [0, 6, 1], [0, 7, 0], [0, 7, 1], [0, 8, 0], [0, 8, 1], [0, 9, 0], [0, 9, 1], [0, 10, 0], [0, 10, 1], [0, 11, 0], [0, 11, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1], [1, 2, 0], [1, 2, 1], [1, 3, 0], [1, 3, 1], [1, 4, 0], [1, 4, 1], [1, 5, 0], [1, 5, 1], [1, 6, 0], [1, 6, 1], [1, 7, 0], [1, 7, 1], [1, 8, 0], [1, 8, 1], [1, 9, 0], [1, 9, 1], [1, 10, 0], [1, 10, 1], [1, 11, 0], [1, 11, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [2, 12, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [0, 2, 0], [0, 2, 1], [0, 3, 0], [0, 3, 1], [0, 4, 0], [0, 4, 1], [0, 5, 0], [0, 5, 1], [0, 6, 0], [0, 6, 1], [0, 7, 0], [0, 7, 1], [0, 8, 0], [0, 8, 1], [0, 9, 0], [0, 9, 1], [0, 10, 0], [0, 10, 1], [0, 11, 0], [0, 11, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1], [1, 2, 0], [1, 2, 1], [1, 3, 0], [1, 3, 1], [1, 4, 0], [1, 4, 1], [1, 5, 0], [1, 5, 1], [1, 6, 0], [1, 6, 1], [1, 7, 0], [1, 7, 1], [1, 8, 0], [1, 8, 1], [1, 9, 0], [1, 9, 1], [1, 10, 0], [1, 10, 1], [1, 11, 0], [1, 11, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 0): array([[2.7755575615628914e-17, 4.163336342344337e-17,
+          5.5511151231257827e-17],
+         [0.8872983346207417, 0.5, 0.11270166537925835],
+         [0.1127016653792583, 0.5, 0.8872983346207417]], dtype=object)}, 1: {(0, 0): array([[0.8872983346207417, 0.5, 0.11270166537925835],
+         [2.7755575615628914e-17, 4.163336342344337e-17,
+          5.5511151231257827e-17],
+         [0.1127016653792583, 0.5, 0.8872983346207417]], dtype=object)}, 2: {(0, 0): array([[0.88729833462074181, 0.5, 0.11270166537925827],
+         [0.11270166537925827, 0.5, 0.88729833462074181],
+         [0.0, 0.0, 0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 1: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 2: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.88729833,  0.5       ,  0.11270167],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.11270167,  0.5       ,  0.88729833],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.88729833,  0.5       ,  0.11270167]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.11270167,  0.5       ,  0.88729833]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None): {None: {0: {(0, 0): array([[[  1.12757026e-16,   4.16333634e-17,   4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.87298335e-01,  -9.71445147e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -4.85722573e-17,   1.38777878e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12757026e-16,   4.16333634e-17,   4.16333634e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,  -9.71445147e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -4.85722573e-17,   1.38777878e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17]]])}, 1: {(0, 0): array([[[  6.87298335e-01,   8.32667268e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  9.36750677e-17,   8.32667268e-17,   9.71445147e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.77555756e-17,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,   8.32667268e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  9.36750677e-17,   8.32667268e-17,   9.71445147e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.77555756e-17,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17]]])}, 2: {(0, 0): array([[[  6.87298335e-01,   4.16333634e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   1.38777878e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,   4.16333634e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   1.38777878e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_f0': array([[2.7755575615628914e-17, 0.8872983346207417, 0.1127016653792583],
+         [4.163336342344337e-17, 0.5, 0.5],
+         [5.5511151231257827e-17, 0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE0_f1': array([[0.8872983346207417, 2.7755575615628914e-17, 0.1127016653792583],
+         [0.5, 4.163336342344337e-17, 0.5],
+         [0.11270166537925835, 5.5511151231257827e-17, 0.8872983346207417]], dtype=object), 'FE0_f2': array([[0.88729833462074181, 0.11270166537925827, 0.0],
+         [0.5, 0.5, 0.0],
+         [0.11270166537925827, 0.88729833462074181, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01]]), 'FE1_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17]]), 'FE2_f0_C0': array([[  1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_f2_C0': array([[  6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C0': array([[  6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE1_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[2.7755575615628914e-17, 0.8872983346207417, 0.1127016653792583],
+         [4.163336342344337e-17, 0.5, 0.5],
+         [5.5511151231257827e-17, 0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE0_f1': array([[0.8872983346207417, 2.7755575615628914e-17, 0.1127016653792583],
+         [0.5, 4.163336342344337e-17, 0.5],
+         [0.11270166537925835, 5.5511151231257827e-17, 0.8872983346207417]], dtype=object), 'FE0_f2': array([[0.88729833462074181, 0.11270166537925827, 0.0],
+         [0.5, 0.5, 0.0],
+         [0.11270166537925827, 0.88729833462074181, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01]]), 'FE1_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17]]), 'FE2_f0_C0': array([[  1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f2_C0': array([[  6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C0': array([[  6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE1_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f2_C1': 'FE1_f2_C1', 'FE2_f0_C1': 'FE2_f0_C1', 'FE2_f0_C0': 'FE2_f0_C0', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE2_f2_C1': 'FE2_f2_C1', 'FE2_f2_C0': 'FE2_f2_C0', 'FE2_f1_C0': 'FE2_f1_C0', 'FE2_f1_C1': 'FE2_f1_C1', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C0': 'FE1_f1_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.8872983346207417, 0.1127016653792583],
+         [0.5, 0.5],
+         [0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE2_f0_C0': array([[ 0.68729833, -0.08729833,  0.4       ],
+         [ 0.        ,  0.        ,  1.        ],
+         [-0.08729833,  0.68729833,  0.4       ]]), 'FE1_f0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE1_f1_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (2, [0, 1]), False, False), 'FE1_f0_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f2_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f2_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f2_C0': ('FE0_f0', (11, [0, 1]), False, False), 'FE1_f2_C1': ('FE0_f0', (12, [3, 4]), False, False), 'FE2_f0_C1': ('FE2_f0_C0', (14, [7, 8, 9]), False, False), 'FE2_f0_C0': ('FE2_f0_C0', (13, [1, 2, 3]), False, False), 'FE1_f2_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (1, [0, 2]), False, False), 'FE1_f0_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (3, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (6, [4, 5]), False, False), 'FE1_f2_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f0_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f1_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE2_f2_C1': ('FE2_f0_C0', (18, [6, 7, 11]), False, False), 'FE2_f2_C0': ('FE2_f0_C0', (17, [0, 1, 5]), False, False), 'FE2_f1_C0': ('FE2_f0_C0', (15, [0, 2, 4]), False, False), 'FE2_f1_C1': ('FE2_f0_C0', (16, [6, 8, 10]), False, False), 'FE1_f0_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f1_C1': ('FE0_f0', (10, [3, 5]), False, False), 'FE1_f1_C0': ('FE0_f0', (9, [0, 2]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {FiniteElement('Real', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {0: {(0, 0): array([[1.0, 1.0, 1.0]], dtype=object)}, 1: {(0, 0): array([[1.0, 1.0, 1.0]], dtype=object)}, 2: {(0, 0): array([[1.0, 1.0, 1.0]], dtype=object)}}}, FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 1): array([[-1.0, -1.0, -1.0],
+         [0.0, 0.0, 0.0],
+         [1.0, 1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[2.7755575615628914e-17, 4.163336342344337e-17,
+          5.5511151231257827e-17],
+         [0.8872983346207417, 0.5, 0.11270166537925835],
+         [0.1127016653792583, 0.5, 0.8872983346207417]], dtype=object)}, 1: {(0, 1): array([[-1.0, -1.0, -1.0],
+         [0.0, 0.0, 0.0],
+         [1.0, 1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.8872983346207417, 0.5, 0.11270166537925835],
+         [2.7755575615628914e-17, 4.163336342344337e-17,
+          5.5511151231257827e-17],
+         [0.1127016653792583, 0.5, 0.8872983346207417]], dtype=object)}, 2: {(0, 1): array([[-1.0, -1.0, -1.0],
+         [0.0, 0.0, 0.0],
+         [1.0, 1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0, -1.0],
+         [1.0, 1.0, 1.0],
+         [0.0, 0.0, 0.0]], dtype=object), (0, 0): array([[0.88729833462074181, 0.5, 0.11270166537925827],
+         [0.11270166537925827, 0.5, 0.88729833462074181],
+         [0.0, 0.0, 0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 1: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 2: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.88729833,  0.5       ,  0.11270167],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.11270167,  0.5       ,  0.88729833],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.88729833,  0.5       ,  0.11270167]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.11270167,  0.5       ,  0.88729833]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]]])}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, dim=2, quad_scheme=None): {None: {0: {(0, 0): array([[[  1.12757026e-16,   4.16333634e-17,   4.16333634e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  6.87298335e-01,  -9.71445147e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -4.85722573e-17,   1.38777878e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12757026e-16,   4.16333634e-17,   4.16333634e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,  -9.71445147e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -4.85722573e-17,   1.38777878e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17]]])}, 1: {(0, 0): array([[[  6.87298335e-01,   8.32667268e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  9.36750677e-17,   8.32667268e-17,   9.71445147e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.77555756e-17,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,   8.32667268e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  9.36750677e-17,   8.32667268e-17,   9.71445147e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   8.32667268e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.77555756e-17,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.23165367e-16,   0.00000000e+00,  -6.93889390e-17]]])}, 2: {(0, 0): array([[[  6.87298335e-01,   4.16333634e-17,  -8.72983346e-02],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -8.72983346e-02,   1.38777878e-17,   6.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  4.00000000e-01,   1.00000000e+00,   4.00000000e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  6.87298335e-01,   4.16333634e-17,  -8.72983346e-02]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -8.72983346e-02,   1.38777878e-17,   6.87298335e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -2.77555756e-17,  -5.55111512e-17,  -5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  4.00000000e-01,   1.00000000e+00,   4.00000000e-01]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_f0': array([[2.7755575615628914e-17, 0.8872983346207417, 0.1127016653792583],
+         [4.163336342344337e-17, 0.5, 0.5],
+         [5.5511151231257827e-17, 0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE0_f1': array([[0.8872983346207417, 2.7755575615628914e-17, 0.1127016653792583],
+         [0.5, 4.163336342344337e-17, 0.5],
+         [0.11270166537925835, 5.5511151231257827e-17, 0.8872983346207417]], dtype=object), 'FE0_f2': array([[0.88729833462074181, 0.11270166537925827, 0.0],
+         [0.5, 0.5, 0.0],
+         [0.11270166537925827, 0.88729833462074181, 0.0]], dtype=object), 'FE3_f2': array([[1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01]]), 'FE0_f1_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_f2_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE3_f1': array([[1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17]]), 'FE2_f0_C0': array([[  1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE0_f2_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE2_f2_C0': array([[  6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_f1_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE3_f0': array([[1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE0_f0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE2_f1_C0': array([[  6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE1_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[2.7755575615628914e-17, 0.8872983346207417, 0.1127016653792583],
+         [4.163336342344337e-17, 0.5, 0.5],
+         [5.5511151231257827e-17, 0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE0_f1': array([[0.8872983346207417, 2.7755575615628914e-17, 0.1127016653792583],
+         [0.5, 4.163336342344337e-17, 0.5],
+         [0.11270166537925835, 5.5511151231257827e-17, 0.8872983346207417]], dtype=object), 'FE0_f2': array([[0.88729833462074181, 0.11270166537925827, 0.0],
+         [0.5, 0.5, 0.0],
+         [0.11270166537925827, 0.88729833462074181, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE2_f2_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01]]), 'FE1_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE2_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17]]), 'FE2_f0_C0': array([[  1.12757026e-16,   6.87298335e-01,  -8.72983346e-02,
+            4.00000000e-01,  -4.85722573e-17,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -9.71445147e-17,   8.32667268e-17,
+            1.00000000e+00,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,  -8.72983346e-02,   6.87298335e-01,
+            4.00000000e-01,   5.55111512e-17,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_f0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE2_f2_C0': array([[  6.87298335e-01,  -8.72983346e-02,   0.00000000e+00,
+            0.00000000e+00,  -2.77555756e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   1.38777878e-17,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   6.87298335e-01,   0.00000000e+00,
+            0.00000000e+00,  -5.55111512e-17,   4.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE3_f0': array([[1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE0_f0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE2_f1_C0': array([[  6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE2_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            6.87298335e-01,   9.36750677e-17,  -8.72983346e-02,
+           -2.77555756e-17,   4.00000000e-01,  -1.23165367e-16],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.32667268e-17,   8.32667268e-17,   8.32667268e-17,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -8.72983346e-02,   9.71445147e-17,   6.87298335e-01,
+            0.00000000e+00,   4.00000000e-01,  -6.93889390e-17]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE1_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE3_f0': ['FE3_f1', 'FE3_f2'], 'FE0_f0_D01': ['FE0_f1_D01', 'FE0_f2_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE0_f0_D10': ['FE0_f1_D10', 'FE0_f2_D10'], 'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE3_f1': 'FE3_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE3_f2': 'FE3_f0', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE0_f1_D10': 'FE0_f0_D10', 'FE0_f2_D10': 'FE0_f0_D10', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f2_C1': 'FE1_f2_C1', 'FE0_f0': 'FE0_f0', 'FE2_f0_C1': 'FE2_f0_C1', 'FE2_f0_C0': 'FE2_f0_C0', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1', 'FE0_f0_D10': 'FE0_f0_D10', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE0_f2_D01': 'FE0_f0_D01', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE2_f2_C1': 'FE2_f2_C1', 'FE2_f2_C0': 'FE2_f2_C0', 'FE0_f1_D01': 'FE0_f0_D01', 'FE3_f0': 'FE3_f0', 'FE0_f0_D01': 'FE0_f0_D01', 'FE2_f1_C0': 'FE2_f1_C0', 'FE2_f1_C1': 'FE2_f1_C1', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C0': 'FE1_f1_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.8872983346207417, 0.1127016653792583],
+         [0.5, 0.5],
+         [0.11270166537925835, 0.8872983346207417]], dtype=object), 'FE2_f0_C0': array([[ 0.68729833, -0.08729833,  0.4       ],
+         [ 0.        ,  0.        ,  1.        ],
+         [-0.08729833,  0.68729833,  0.4       ]]), 'FE3_f0': array([[1.0],
+         [1.0],
+         [1.0]], dtype=object), 'FE0_f0_D01': array([[-1.0, 1.0],
+         [-1.0, 1.0],
+         [-1.0, 1.0]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE3_f1': ('FE3_f0', (), False, True), 'FE1_f1_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (4, [0, 1]), False, False), 'FE3_f2': ('FE3_f0', (), False, True), 'FE1_f0_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f2_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f2_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE0_f1_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE0_f2_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE1_f2_C0': ('FE0_f0', (13, [0, 1]), False, False), 'FE1_f2_C1': ('FE0_f0', (14, [3, 4]), False, False), 'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE2_f0_C1': ('FE2_f0_C0', (16, [7, 8, 9]), False, False), 'FE2_f0_C0': ('FE2_f0_C0', (15, [1, 2, 3]), False, False), 'FE1_f2_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (3, [0, 2]), False, False), 'FE0_f0_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE1_f0_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (5, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (8, [4, 5]), False, False), 'FE0_f2_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE1_f2_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f0_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f1_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE2_f2_C1': ('FE2_f0_C0', (20, [6, 7, 11]), False, False), 'FE2_f2_C0': ('FE2_f0_C0', (19, [0, 1, 5]), False, False), 'FE0_f1_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE3_f0': ('FE3_f0', (), False, True), 'FE0_f0_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE2_f1_C0': ('FE2_f0_C0', (17, [0, 2, 4]), False, False), 'FE2_f1_C1': ('FE2_f0_C0', (18, [6, 8, 10]), False, False), 'FE1_f0_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE1_f1_C1': ('FE0_f0', (12, [3, 5]), False, False), 'FE1_f1_C0': ('FE0_f0', (11, [0, 2]), False, False)}
+  Transforming interior facet integral (0, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (0, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (0, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000789 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.993568 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  Optimising expressions for facet integral (0, 0)
+  Optimising expressions for facet integral (0, 1)
+  Optimising expressions for facet integral (0, 2)
+  Optimising expressions for facet integral (1, 0)
+  Optimising expressions for facet integral (1, 1)
+  Optimising expressions for facet integral (1, 2)
+  Optimising expressions for facet integral (2, 0)
+  Optimising expressions for facet integral (2, 1)
+  Optimising expressions for facet integral (2, 2)
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.034147 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 4 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 4 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Removing unused variable: facet_area
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.367466 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00112486 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./AdvectionDiffusion.h.
+  
+Compiler stage 5 finished in 0.00176191 seconds.
+
+FFC finished in 1.44538 seconds.
diff --git a/demo/undocumented/dg-advection-diffusion/cpp/main.cpp b/demo/undocumented/dg-advection-diffusion/cpp/main.cpp
new file mode 100644
index 0000000..a4adc40
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/cpp/main.cpp
@@ -0,0 +1,120 @@
+// Copyright (C) 2007-2011 Kristian B. Oelgaard, Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-06-29
+// Last changed: 2013-03-21
+//
+// Steady state advection-diffusion equation, discontinuous
+// formulation using full upwinding.
+
+#include <dolfin.h>
+
+#include "AdvectionDiffusion.h"
+#include "Projection.h"
+#include "Velocity.h"
+
+using namespace dolfin;
+
+// Dirichlet boundary condition
+class BC : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = sin(DOLFIN_PI*5.0*x[1]);
+  }
+
+};
+
+// Sub domain for Dirichlet boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return std::abs(x[0] - 1.0) < DOLFIN_EPS && on_boundary;
+  }
+};
+
+int main(int argc, char *argv[])
+{
+  // Read simple velocity field (-1.0, -0.4) defined on a 64x64 unit square
+  // mesh and a quadratic vector Lagrange element
+
+  // Read mesh
+  Mesh mesh("../unitsquare_64_64.xml.gz");
+
+  // Create velocity FunctionSpace
+  Velocity::FunctionSpace V_u(mesh);
+
+  // Create velocity function
+  Function u(V_u, "../unitsquare_64_64_velocity.xml.gz");
+
+  // Diffusivity
+  Constant c(0.0);
+
+  //Source term
+  Constant f(0.0);
+
+  // Penalty parameter
+  Constant alpha(5.0);
+
+  // Create function space
+  AdvectionDiffusion::FunctionSpace V(mesh);
+
+  // Create forms and attach functions
+  AdvectionDiffusion::BilinearForm a(V, V);
+  a.u = u; a.kappa = c; a.alpha = alpha;
+  AdvectionDiffusion::LinearForm L(V);
+  L.f = f;
+
+  // Set up boundary condition (apply strong BCs)
+  BC g;
+  DirichletBoundary boundary;
+  DirichletBC bc(V, g, boundary, "geometric");
+
+  // Solution function
+  Function phi_h(V);
+
+  // Assemble and apply boundary conditions
+  Matrix A;
+  Vector b;
+  assemble(A, a);
+  assemble(b, L);
+  bc.apply(A, b);
+
+  // Solve system
+  solve(A, *phi_h.vector(), b);
+
+  // Define variational problem
+  Projection::FunctionSpace Vp(mesh);
+  Projection::BilinearForm ap(Vp, Vp);
+  Projection::LinearForm Lp(Vp);
+  Lp.phi0 = phi_h;
+
+  // Compute solution
+  Function phi_p(Vp);
+  solve(ap == Lp, phi_p);
+
+  // Save projected solution in VTK format
+  File file("temperature.pvd");
+  file << phi_p;
+
+  // Plot projected solution
+  plot(phi_h);
+  interactive();
+}
diff --git a/demo/undocumented/dg-advection-diffusion/python/demo_dg-advection-diffusion.py b/demo/undocumented/dg-advection-diffusion/python/demo_dg-advection-diffusion.py
new file mode 100644
index 0000000..9f6d117
--- /dev/null
+++ b/demo/undocumented/dg-advection-diffusion/python/demo_dg-advection-diffusion.py
@@ -0,0 +1,101 @@
+""" Steady state advection-diffusion equation,
+discontinuous formulation using full upwinding.
+
+Implemented in python from cpp demo by Johan Hake.
+"""
+
+# Copyright (C) 2008 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-06-19
+# Last changed: 2008-12-23
+
+from dolfin import *
+
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return abs(x[0] - 1.0) < DOLFIN_EPS and on_boundary
+
+# Load mesh
+mesh = Mesh("../unitsquare_64_64.xml.gz")
+
+# Defining the function spaces
+V_dg = FunctionSpace(mesh, "DG", 1)
+V_cg = FunctionSpace(mesh, "CG", 1)
+V_u  = VectorFunctionSpace(mesh, "CG", 2)
+
+# Create velocity Function
+u = Function(V_u, "../unitsquare_64_64_velocity.xml.gz")
+
+# Test and trial functions
+v   = TestFunction(V_dg)
+phi = TrialFunction(V_dg)
+
+# Diffusivity
+kappa = Constant(0.0)
+
+# Source term
+f = Constant(0.0)
+
+# Penalty term
+alpha = Constant(5.0)
+
+# Mesh-related functions
+n = FacetNormal(mesh)
+h = CellSize(mesh)
+h_avg = (h('+') + h('-'))/2
+
+# ( dot(v, n) + |dot(v, n)| )/2.0
+un = (dot(u, n) + abs(dot(u, n)))/2.0
+
+# Bilinear form
+a_int = dot(grad(v), kappa*grad(phi) - u*phi)*dx
+
+a_fac = kappa('+')*(alpha('+')/h('+'))*dot(jump(v, n), jump(phi, n))*dS \
+      - kappa('+')*dot(avg(grad(v)), jump(phi, n))*dS \
+      - kappa('+')*dot(jump(v, n), avg(grad(phi)))*dS
+
+a_vel = dot(jump(v), un('+')*phi('+') - un('-')*phi('-') )*dS  + dot(v, un*phi)*ds
+
+a = a_int + a_fac + a_vel
+
+# Linear form
+L = v*f*dx
+
+# Set up boundary condition (apply strong BCs)
+g = Expression("sin(pi*5.0*x[1])")
+bc = DirichletBC(V_dg, g, DirichletBoundary(), "geometric")
+
+# Solution function
+phi_h = Function(V_dg)
+
+# Assemble and apply boundary conditions
+A = assemble(a)
+b = assemble(L)
+bc.apply(A, b)
+
+# Solve system
+solve(A, phi_h.vector(), b)
+
+# Project solution to a continuous function space
+up = project(phi_h, V=V_cg)
+
+file = File("temperature.pvd")
+file << up
+
+# Plot solution
+plot(up, interactive=True)
diff --git a/demo/undocumented/dg-advection-diffusion/unitsquare_64_64.xml.gz b/demo/undocumented/dg-advection-diffusion/unitsquare_64_64.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..0d633282ea9b41c75a2836a49fe8be09dc826432
GIT binary patch
literal 84425
zcmagGc_3788#g}I5YkwhRJM#|7>o!-A!Lko7EAV-2uTs5lB_Wl#x9C6m>El<2w5|B
zm8}peTZk4y%JMt(<oUkO^StlxpL;o<`?}6;I_JKY&vg=w;Q)RAZDs*tiA^%`YEt5h
zSj}u&tm8aZu@uHJe?4>sgu_$wK8S$@XJ+pof9~?#Q$m09yw<B#m3JEp{e_Cb2Vd|V
zG8sB2C;BdD@Atu()ylW2MqjTL4pbcabtcLqf8v?VE#VCflTRiO93Q=%|3GkS^?Y`C
zX-eg7O)~mjqUdSd=ij%g9|q+XpngWRj$Isxz~rv&%P7@o6gYR9j=1?M&BZ@1w>77p
z#&<IK;*ZQLYh%InYo`U^*a|7Du4`I%4nEG2yx1^IhG8DFWxo7yI|X+_kLlU*cJ8S#
zD5o8hsR32zT;qfr&pD^C5BH3W;?l&-nsh}_#{Bc8lO8__gg$~4hw+`;rxYY}!%hn&
zMP<id)JZ<b#g<5bsE`hGhmqP50>aYNV`p+e5!#r&T-|&!?x$bmB&$S!G*{-4d16{t
zoo!xL&3$;-h_AW98619E+J=pNQ}0!nj`Vd=ZX>*QcB1?RmJm{;FhpMR^H7u1iSmg0
zaU1<$2)y!ecnE~uf%b0t>1w^TocPgx)}gI~dg&cqtHPT}$q03Bmuw#1<SmqpF)-lD
zd&G2y))m_*ULW3oy>;S__LRQQHgbe3*(|aV%|7gGZo_=13GEPkNB85J*yE%Se~zSk
zAFs%<9JwN+>8SnDQb<1A{QHqB&jjJ$y`K%HZ@p2STl?zAootdb|I{R1n0{ZkW<c%C
zA_SJHTliMp<z-HXtZ(h-Oz?5+iHPT|CtUDu{#-7oYs7x@Zvw+wlLs-aua^YQJt`__
z(CF8SC=pppD$Q9Ioyl+JMT>=ph!GuRi;*X)wivE&l`KE1-4Kn+o_>2$*k|&ra(BC^
zg$F3xCZC0G;R0{`U^kYD{90Z6YPx~8FA63$n-AgR;n}0o_k)GJ{)*%It@I4-C#tYE
zy^B%`))9K__dA=}3vF}5EY!X?dT1UEZ&yJy!BmYPaDM5c3O%k2;iroq90i_wWsNx8
zwF~?f9h*^87vqJG9C%H2RxufQY!rR?cxN+jVR26w)u7C8QTUDB%7#Y2YX$En%3{JM
zM|8r^E8Lu$RYwJSq)=|FncBo$Q7;@k3|ZRXXZz4rm=HhN%_<-GR5?R)__p+;m(pb4
zu}-!8v4RJ01rbn-qsGX-{TMKtlMyK-jpPQ-r`SZvM*FuU3G6}m#gX~)DKua%48Zr&
zNHQFlUhd{3y<^Tsp%K7p{(Oo?6zzrz7XTB}NYwrLlv!Z41i^^-4`s&zG%T(9Z27;G
z4J+m^ZtACHy#sNuSnyqHU+oDd81jYO$-3$2+Ah5DHi(f1?w84L_Vtw2VL=<UHIu+k
zWGKy^^HfN;uWM3NtRR$Xt`|)kG!GS)Op3q926Z#nj!qvm3w@Jd#(ew@Cf1T108T8;
zVih!$78mS9n&(~t_m$pfy?gAwo^g?sP7E2@)#6I*F^xCYRTfIj)@_u`$18Gre6=He
ze)Z$WI?vXp=UVAa-`n{fndQ6PBAOtdpH6RL>Uh1urO-4_VFy9jogn!~)=L-a4U|DF
zQOaZ_Oeo3lv<xlNTsJ6(;&G<^#~o6~ezqsS^pM?x&>lr2*o7qX_cF9$3+0VmijN`Z
zasr76Wh?uQL{24v=j5O`TciB?B<wxeoKqMy!G!b2eNu-8o9}f~<Ul5ARs))R)rk5j
z3EL%`@Bo9>C<xyHLaVe2ZY^_^6And&fTEmFvOP}RkiL58Ij6m%NyCzaX>q&y(-Jk)
z;uq>q6~_BBVlkh=rp2v0lQe~i{_5M9iwM)=81<)8z$6^=`QH=XOyRYl4_M@zPZcK1
zXENp($^&su^nEqh)8}apMd%Gs-u1`GsU;|K8J{qBR&3yo7G2Z_tN4a`YYZ|_3#W^s
zv5G0wo42<3mX%!h=!3$wK`-Qwd~2#luzE^g-Lll#JhEVZi<I;HiS8O__~L8!DQV6Q
z)ZV0r%rc@2W;eYS6I0(vpJsWOS*f*#yuR4GI9c$a{cKI*!}HRL#irL^9+;WT>25b8
zC8i2VpJp>XHGF?vQZ3N^(&Dkw_8?pShsphud3o(-I*D=qQm5OE9nPh%vnmI=5f&4h
zC-WkrUp;8}!BKvO1r!3|2-RoWsElj~iY%&6F39Kl-8&Yay3$<zL~W14!o-V|I+pcU
zmr%H#6j&J?2el<m1D(Dty{!T(=t%>=L*t(05j|13_7r;QHb9)Ifa6pz(YXE#`6D7r
zY6T=O(If!8EYAaw{G(ablg12O>PvBGnjd6$;=3L4!7_Zl-kO5t5V8MydE`NEPX&eU
zi8OgfqCbJ^UqaEFQj(s)X-2l_{%wG>yRU)*yM(j=@V*r6KahWk=#^hW;s!~i3MkGU
zMI27SCc|m&w&>&v3iT3lz!jBNe;>YKHS+c@Dhi$YT18PD=BV4-5H1tJX~NG>9!NXY
zGC#<n4dHMaG-4eLuJBdqshut6TsI3)zB^MJklqw<jIH+q*LaUWRDo=)6()O0mF=4+
zSMxi8mKt{hRK0A}9gLVrfs%u1$hS=0fD>%veq0j^0*3Epqgwl7y&eFFS;)Orf!a?P
zv9SWBF|&{#4?_dA*~UY-CfHPS_w0j(OJl_xs7hnzAwP0L1N7L&qq!yomvc<gj*I~3
z2ov{xPTK1YwF#aB16${rS5@F#X9)d)=V%rI8M#WyXPw>So023V3XoiwG=X~tvc@!Y
zKt|rnK6{0TJZCOUhrok;S>x09bvGC^RN%P4qb6C?Xv}lwf*+bd$5o&XHT|BU&VYIo
ztv(7AG|M`KU~Ym70t8LnhXI`3^t)l^I8L1*3*a9F9yZgwYr}_hcp8+rK?tMIgx;2i
z)?4jJb|=;cbRVM3RiekIq_$KIeVm4Vl7_yZhJNDTvFcT#*i|Ck$7tqNCYhK?ZqFps
zGbK7Q$-^4@q`!*<HQ1I;rDL$k7(JksE09qxpu!5GfL5ZwZD$;AIxR5pQkK*uOYe{+
z18q7c6>(C9nUDRp*dRs>c-|YsM?Aj;&rNN*gA4BAKK3JwGEZ2_nPyEB7_vHV4kIz9
zT={mAC=JdepLoeBigt&-Pg3HM+~;OQypNz>m0_e0m}5$evjfSL6f-F;edtu+gCCQW
z5AFJ8{D~)Dx9gA+6PcwCw40dvdoG@$wIg*BW6n!ShZysc($cz^r4F>COzWOa`t_0$
zL!k%SjZDX0iMA|^u!n#+LY)k(HP3EFXN9p?%{4wud84?n@U_s;D2pShT1?ty@i`v-
z6^YE^AXSSU^<&nXyB*#i4WjK`w2(faIj1ozlbHH}y0^?iT0585&>)K=wp#3fpAUmP
zmPkCYU%*dCs$&ua_S2S_)6?!}3#2AqK0LRuk7snLd)7NG(o$deT!OnBj-1o;+~iE5
z1W$3B$`jb@*G9(wn*5-dHqC!v|MMPbLsvwLPoGL1XVTP8%B8DH_FXiDy?uT9`Xh%k
z=&L-)AHt*#RmuK~hV(b_#*f5lc4u^JBPn>EkP)Es;o)2sCjAwPHwW<2NY?8-$SGmw
z>p(XkOqx}dOulGHeH)K05>EhBRz-&I0HHR!@);Km$#3KP-`=}l2K@7aSVP4u1zrbV
z3>Xv-+w%J=@nypKY+pQ`EUs#DhE9s)>&_R)>6|gjh{Qs9WIcq@I2B61yCJSOo(uqc
zcs|}dqVnTGs{P$FQKUPsRrthV61u&H;WFtQCTI4Ovn2%X>ZhrgD(Ln(g;U!&kh%NG
z=Z~uJoQ?82q5C=@TxN~KgazzMkBN_0kq|dB(Cv#4myvPj_ixn$0dGRH%+vLDzssBC
z(Kzie3l%AGBU9bJ>~N|fCo&gY*P598T18%5_(^!s1eiPtRpBv?BBsTwD2p4p>h`@3
zKe?7IC2-dyigf?Ain=(=N4Iw-TxN*V<OM$&X~rS^aOK!q;(B;K6PLw)0g{1?Uc0%Q
zFqw}{KgTUrH|cOhzK%znR|0^@>b0ZYg!4CN_Pe$kfSR<qS#LA}KNzbBX%%t*v#$P0
zvJS?2U*_=Y=0i18no%aYUp<e0g{yl&JrCw>WHFIMZ;*xF#n8b80;;AoSSGq}8{q2k
z$VB^%ClOm@anTr}Z~<1(l;)m^PFByOdK=+B2#{)kZaj$$;1L)P0Ee2&Zi{?K3f&Qj
zdhi#in}c?}<OH#T#3HN4zh90$(&TqpaPq5!>A?9+`d)Qhj5l3j9Ba}-0}S@}!$22>
zQ9W2N_iG$`WOo8K9Ux@VW7Gxv-2Y2v8B#F!N7?5HOoF3g=5XmHkJA)dt#$s&(X`<^
z_8x$VueHuwVM!VeGx0d3hV)PrqP<%B<^udPz5vX)40IN~*`~ZYHsE#i^(Wc*#U7C<
zX^jrl#iWPP7GK_x*Cq7>-J^S#N<sls{{OJ?{{L?qf73KO@y>DS(@0Z?bD8S`>T7P7
z7ZXP&^PaZ9YL;5PWODNXMM@EF68sAIx$g3Dgo<&TU`*6s;JCu<*_(IG{iv~C-65Sm
zg?Zx|@nZ|k9ZwF4_3?TF6U0Julgj=3x7`n{<c-Fs`s3|~yZ0$9e6NHDZFX*59Y$N0
z<;A+8Y#LMORedRCB)E&7ZO7b`JY(Qmdx|m{?!so<5m}Lx>`5c<xg=ZoBBd-F?gF*#
zh^j~u^prict01ca+n!jFG~mal*s)_eqe7fe=Ra&7I(j_#!4V&Os@vA{Z>F|*!HQ<7
zOVPL?aPAYRrK2rAzM>hh^F4_b%`neslVNaS8PvcXRg@1$AZ_uuie?#L@gON9d3#y3
z1%NxF<a<-Bli>)Xe<&mS<-tocDw-vCRXd|Rcb7eV*Xz9r-hKl@L42$inN8;F5&Zlg
zTDrHmehyteWoesH|7reUG>T}H+Apan%jJkBHBhMGNE2`(xi1YXsVtt6XY4^r7l=3}
zi*!R{dnr;hWRJ567x=zF@^Ko{OV>9-O%{0tjUA^*wIh4nO<~|Hf#ef3q(55V3q|rH
zXOI0NMQRq=<7GB1eM%M<gic(i$gCrg%t>UhjOrns+SsAO{kOFRSR1K7Cq)l3cYTla
zSifgCP*1)joJ7=<(a$sYAms=|oRLLFp|RjRDOsbQ$1-fu7Evp`GOFzs#HQRNNkds!
z0y<GL&n*KGk=4&bdyw+@j(kKLf%65DjcLdX^poMFH;S3n4}WQ0-hEp?3S^Y;zO5k`
zqusX^r=FMZJx2pVfNTyYK91XI(3wY@cfWrbN#TeJU8i@+W>;P{@|aH21040~By*sh
zN;2LZPxfccKfPYiR#rg$RnP{bMqQ`2l~Jj`sBH#liy!C&7YuUY7Oad2BR_zZ6~X9r
zu(CE-#u%(@9!B4Um2t`C6toiMJBjpHM9+Ld<Rd|w3PD``z?~ya^CRrqAP|1gT=RFF
zK}<u(ay#oAsb?99QyyNFLcb#wg;h+CrU|tfht@nCRtl>)A5Wie%s9k((cySeRS@6B
z<xgiz%bq$<={9z}xRo691GeWKP9dpKbKbH_ySS{<X28dyXz{Vtltghyqh<2mJlMXI
zIECQ6juC_8y%Df|zp?O2UqA+{kVMm*M^|a*l~p3AbQ7+N?i0V}#UjSXs-pzG60m5-
ztx0)j`O)mGd2cLPi->d=2&<5RUN91f@t2W0lk?0g3{PTakT;@{v;1Kd(o(W!^21q4
zb~&aal^O`7H@;`AnerrB$Cf`aNlIwJ*f?L=d#r^rY3hvcscWYAM(ex-CniCK7L1H_
zlb>D2;7R0WvKD81U9uFy4TUF>n#o6^+sTF_3X#6wE`A+Vlh|;j89FZWxr(ZSZi7J0
zDv0%qM?ZEZa8W~VVb#DkTBO%Ah7z4f@|=-G42nE!EYWE~o->swG?SP!m*})0W!M{?
z|0<i{3rm=SS@_8%49M;GlTVnExA21}FyQS)b<ncsP&&|7L&>}2Pbo6LQrZ?%DE{xk
zHltt*pdAC_fOe!;^^Vd>DP{;O2tuW?ux)h=ino4^4h`12gc|8h33v+kmb2|u8BTeY
z2mkJ2JMRAuoLT|(az{M}E+xagflDbBl+TxK$Av1I3ob?54uc;7xC<)t-y(ygUx9<Y
zzs3TWNF@SNCU=diJJNrssLmQ)>h1qPk?TUD%K1x@7b&#wNUOEP2U65$$DRF+S(Uh1
zv}4hq;p@>ZU)CNmi?RNq+R5bHlc5D!fJZIR8fe`tw0VJpQT|0E*fk?+m=Wxr5#_!S
ztiXs`ZbYv$%I}<W>`uH0?e~U0{bH2;+X%J?Mde4)MNs*2D3}_GdS>t3-9GT_8&by*
zcy5G5e@~hnCv{AL=VnO5Z=pS-Y^oX#x>*kBWrtLylNC%5cD&f}B*NFz=ZL;v&kTMB
zEo1wB<iVCv7A$FWB_(LL6CK?opc<KTZpzssqZyk=l=XmMR6UKC8VT<k9|kQ!$|n()
z-GnY;tAG~Jky@=);}CmA2z{C@@`15903Syf>;Tw>X@sj<9Kv0MkfPZ_4~(_>4#@>B
zwG)amTGQC#Xd2ywqc=Fq2@)V}2nb&W+G;t0SpF&@##Lss0>Q09Y?dJwK)W*@nnMu3
zAj;+uv_35ZOD%(bErS#-g8?lAAuR*o%Ac{NmXvQzYg<_>wYs&<KQ6&HF2N<v!Y?iX
z7q=g1UE+|nfQ}hN#*QXB(9R*q{~DLRii`&yp=~dJhK)^IcwH_mWzy;QX||I~4~Low
zgK-<(g!;>2uTJ<GTYOB*c!JQ^AsC@s1O#Jg$OD)sWobk#Lho!&T80XM;EmAD0)kOA
z<UY)kD`}zqO8ODb9=%O`Svt-}z|SifPDAd&JW&Q@0L00ow?Tj{L>9?(Mun@PpAsya
zv4;BHuc#m4=+Rpzz!oHnTtoX_QginAWC0#09ZwnQmCgHXvOGr`9Ny9buXxF;&N@Ur
zXm^02YXt<a(~wJOfyq2c2FfBNHRFeZeprnF#b5mT-kN@jpDfoLn$(*|%|@A=NF}%1
z!O&F#f<83lgzl5DXGxSRvak>6#JaqhX}JCS>ZjSx7Yn>J<VJmxtEc3BV|tLIK9<!}
zFu%^Bez+RV_N7s!U7nZ5@A`?OUA#u1s1OkQx#}jZb6YLHzOoxMaBu|55oNxn*o?yI
zS=Tx}N8pLiZC(8;ix$1o8KcS_H7=IdI$>W^hMwE1Nbf8w1aR-lSO6awEd%hCF?h_5
z2xU_dSTF+5-Br+C<C1u-v*=3-ZVX=j%vMisSHXl=`sAo`P54MDPlFh!xgm>rC|K2v
z#j+&W>`HH{SC!GIk5KiLj9;hCtWcpe@V6A(dZ8;blm8DSrLZ4<!Eto_*5T^qtuyLp
zms03I;QBmvbfaheD&91s33Pv39xMrkJa&Md{xXl6gTf(GGx8O1?)F6C8tmwB9=QsI
zyPisBSHxb9PR)=~#JM{Vg=_tva#UVD1kwhv<88ms*F(tD;d`#6eo1;noP+ibp<p$s
z=64inFh}LAx@?0A#hiPNXtNFQ%sMoA14U&?!wM>;n>wNWHYMgb*i~~wqkY*EJ9wq~
z#f|AkX~qRgG*4&UBQGdp!csjN+#W9b_~*o=aQepiiD}s5h@5+Pv;{-&L=4j90RNm4
z`_sbMc3<Jd>O}SMp&Fjs+T3i7DL<n&ZI6m+WLX(+9>0q3{`pKm^&V~5*Ldk}Yu){y
zL%`dN5+Mv|wiE?$_gq!^JChHHHTlQE00B+}lnBP}cpT!sW(x&)@fRV5z>Ciy!~!oq
zG_KS`gdn7uKMi#M<6z(sA@ppYCB_4_i-VnMS%;W7KuX+)h!?hcW^@kpwd#9p1p7s`
zDl5mi7>IOsXr>$tkUz9!?K)Xn)I~^-ZiSubCZs2{mI3(6RH-p=?axF?q_YiJ99Tr}
z{4be*D;tVw^$4yH@Qk}ls1d)r(5zH(sB};v7GEPCz0fRHap=mRTENdTg2ZiSvD?l`
z%20SP-sZ+?iT|OHx-$gG!$g7UJn=3wL|UAI(rKiVgK)#T@utuFpHtGaov0TF9u^FC
zp3O~tD5<E(<8UjqMpMOq4LP^i`+BM%t@G^B0}s`rJ5emD4;yV?9;#fIycFm@xQHp5
z%C+b;Bc-IW!?kX(T?lmRT1-ru$`kK2L!`tR$e%`9I|x5sH?I4&pa>ih&0?SiZBHq&
z->+Kidqc**ZrrsET5TyDI!r0df|U3ltr(8z@lcZlCPn@%CBq@59%>YN7KHA4l}Ph<
zrVR5$dq}g>M>PXH;zZS#e+SOr#iZ{qC{s3dk;<gc0G&Z*M~8ay!7H#s6Ij<~T2U+}
zowGoB2cXXpGCQ^fAO*@tO<i0vJB-zn6TD%^#`_=6Np-z+2i<lCMdi%B5VdLL)o2IB
zHaPm3Cg_{C7rm4%12Qc@3#43j#|apLEX?_I47%njvB-x=y-Jh^@;gB5L(Km>E&|d$
zzNQH-rWSyv?o5f<Oo`4+@?54wVWtGoc4m^Q0UZe#l^so3piRc`YXNx(R&6m3Cnppv
zbTF7O_O`ZRJ(0`R_%3Dy$V{o4dLL5H+uWGwFV+ksS}_S0NWvUKus2Dx070y`5q<nA
zK`?a^X7|d%i6Prgw8|EIcwWwd%_@^r5^yPiadZuk5h{?Bx4$4J^zgjA1Dj1IsVrb2
zjRDn&u?hhYxI@Ufo1~|{_H4G9q>2EOk@5KFjKbR&O+=mj-2j)NS^Ke!^q2Z4@qDk|
z2UPLyo!2rN#|ySGq|#$>ItOwo3b>2-1BsIgmTV5Or03Rb*GrKrc-%LJ%xug+gQ8Ho
zBmDuhk^$1Gh`Di4GOQHFK}Zs4@xVh8CzUMO@Uf(3Y;6eMlf<wVj71m;6a2;@pQPh9
z_5=?}$7#rkTus)T2Hxl%Q<1Bdn$xhruAyHX<zc`R4*{O|726IV9~X0(SqyaQ>pZz#
z%hmEm7i=}nW*(6{LU4WBN*x2bi*f0bBF74~T$68f$*-hYd_j~C6D+G*yH-SU(|48?
z`NX9&M2>a*l^?nmXR{+>;P;=%7~wb|=@Dl$C2}lAOG?G;OKGq_XL*?L&O4Y^vG~by
zp~?Zf#m~A~F^+I-CycSj1tLY3fX&MVcG-SQE0{!FW)Pk~0J_B1b;-CuIguscZ-fVQ
zVHVRW|A=gAwrpwzc#eL4gD{RJ1Pr$*3Ep*fKlma^DYC$x8}k@)&$9IQ6ENf3lW1oc
z_(iWoq^u6N*$qg3yEEk63nggeNB6xa3xI^`I}kSug3lIqZ}okb;lZ?@pBbj38$G!K
zLd{TlzBAU4Ymc?toW$)KnGvB8-Yk15tU}Ffo(3^Y^0B|IvgLvqW6N@U6IPJQN7_b?
zI(Bu;h?^1Ks~J5p^MXwSa(uZ~5H$dC(6M{Yj0lME{>tV1sRUGFe{49`-g%^&S=Nuu
zdzP#DwO~t@9G|ikhgFGotetb6^x>v2gRD*v_S+wfkozC6I?C5B|Gd5d8t2Qn-=}p>
z-_G#dGd}2*9QXISzTbrM_l^Gg5?A-eV-%lK&7k|m*vzJoN2?j~elfVuLgj($Q~AKP
zIibQgaMwKB*mIR>d0sigW&lL9HQt$(0-~1H4C?N(99xeuU^UIQ2*8uQ5WA{}UKc;y
z_DlHyVrYf`wbA+(<V@x9rW-yXfls`=QKP+nPrbb5M#uZB8F0TCtItA}ui>YPZAZ|R
z0XsmiZ{_x~@quc_LO)#LAIKjO)Z0El(l-X!U1dMq0l<wa)d9&rBA5E$%Y?q-wHW8G
zZezX4b$PT9loe;{1E~_fpztBueh_e&J}wSeapVr6*s(_yes-Li0ME5U1yfNJwFCWa
zub}<8D7tB?@goJ=O?zFf8p_x^Xip6a7MyCnPmyZVipoz-#hy~kdEkKduGPDK139${
zp8F2PeM05GJ<#8=3hiG)%~d%v*Va=OgE^N$iF6jJzP-jU(KK^2CF+p_#uT+Q>@B4n
z5odH|^qK9ai-Sdp&rVkR#b%<;9YcqzvD3Hxw)W)%33%MOG;)g)t}v43#{16l6J*wz
zDBO%qj-t7PG09T-R10GqHI3woz|G=`!Y$@UpahSM7Hr;KS&zdQ)!DRZ{<u+F(;KV1
zKE0d>#uu>Qf9(DL#li!I-Zn56xipxn6+VRA{<%OoXpxQkv+w;lw3$!I--xB(h%LGv
zOT7{MXDol+*!91>@@)@YOUs~V+l`k}1sr&KYZTzX|8e8Vt!}$xdTY4lZb0ykAUR4n
zKSaO+?Epb<XN<17F<%D!OotFa*u`zzK9{+10F}kj`n8?&^`QXIQ`4nY39ZvEBKPkH
zc$)4`-igK)Z*Bm-0+J9I#qbe}o?_zdd?1i=2O_@*Y%QV|>|*+hK5=xVBV;mp&oj9j
zXe$wX$zemgK)dJ3s_t_8N-cRMi`8GUyzF?8lzayww+Cz~qUPvgTHSHRGnu6ww(kmV
zg+f1ZFAcV5{{Rq$J!R&L3KdJ^Kf6hD=97Q-sP5sLqaBQg1?r|5cnf)k7?P-eMPL<a
zAy3SKNb1nk{cnwH&PMB(@`p)E3pJXINUN60xZ>lRoADFSlEf5jCc}uElw{2+?fo#R
znGA{60fS?*;?&Jf;4J`mpxuxmXxAKs-XDXPU`Oi7TZ)YP=H;wPJ~k81C@1Gs83A2(
z4x&0Sa=OUPt%MYLY6$oR1(>**nfR`<_1Bl4`ng=e&twrVdi-LW)Wx<Uk2cuFHhGUW
zneB0uhYL^oU18;RVdX;MvJPS87-40g{WHF=s#jhf*+q{mDvRtQN5%r}pK+b)`2^MT
zma2Mw{{gu244vmm$MM(zTJ?GMYuTJhtqp(I2xPOkSxQqr{8Hqti_e<*TC6<*mlO6$
zR+;pC9iK=Mzo35x*mx!zkA{)3kEIG_&JKCzr4&yUa(gxjb8oYG9iO|qEXY0T_wTc3
zKKIOJsqLc~Nuc|UDRio#$<+k9<Wc=@1A6GaBo)z|6G%g1Mgmq4N^>_wCsQa?8{_~5
zD%g#plhRUV#JgS^fj~?kV#MN%sL5+HQTYb&JlRW%YB3<$H!7JtCE33qDYz`zyCIp(
z2JPp8;sl|6N7z)$DdE+5l)4P?%mY#f89bLyqSHyUC8Ulr@LWacISVU^Q7g2KweF}j
z8fT+CYJ;{pr#pHM9efGtds$~eULnUzfkszI|Dr&XSIqHJq)`<UzC0@6{RjkyVn89o
zW9WJ22_R1zEM#)awsB^&P*O?1+llILk(M#7ghS$q84N6saNo^ukO!6*|KZLX_xwA6
z|A09Dk5hoq|Hm5#!uXXbgw%f_J2C$Ugvu%q7W_vBz;zkOld^)sv_UMYPd_-?UOV+;
zMX&L0VPNdL4+xQN!U(C=7f2$E5L?w%<GfKK6MzbMK&;skq;eABumh;n?ko!ca3Ge*
z3yig0gglx?crgf>8LiKtakJ+DJhb(v%3t~7fLP3~Jg*3*exJy1#*?SEtxC{)AKeet
zm;pZ46=o%FRwYk*{!nn4b})2&y;AzMT67D(G?t+UiD^|3;<uLPEgaO;(kl({#3Q1c
z@ug7=J-(P$5uv_rXN2_&yhJ2}u=joelq-e-7UCC|7ddHd?DSZ@$O*B(alAByA;}!W
zU_Nf9$RscF+sgPru>R!@V)ReJxCJ?>9xM5jM`;|6-v?`_-NS0fA75wa{UCn2>~IIM
zV+TXU2Ek(BUzcM+8l_eui|^)7XFRk>I6x9o)Z=t;8?NCi9*M|)dQns>+TLxrnorPA
z+<jIz>2*YY)?N#x14K&&y=XhP;b#>+K?2_5?jLoN8Y1$8_VzT}TANibZ@h4QziY^Q
z;rbT<qumd;EVk{^tsH#fg+Pts0ZUrs8)LBp-~fYLj;l<I?F-;6uLJ{e>+O(aR?&^z
zH8`(A0~_SV4Wj&4A>4a-S+%WRP-WYqm&Nj^L`)6z*l(|dsZsJ=jlSiz80uFcn=v@O
z&i4HKQSwZUe#$kJ2e7QLM!)}B%)jKH*{bZy7uG<Z?8>jahm!!wz)I>buY`e72|y(v
zKNpK?JCX_FW7gp_o@+R^)x1tT{wDb3?L4PNHG)tz<G&r0ZI{G<Cgn?Oj_s1h(Vusx
z;ka2_qVO|p@)er<I6Ao{kD7qO$)u886|liTZX{9x2etResK(~`$$HGA{Vt{wrxkFs
zKzRS$yc?{jYT`ieeJ-GSoyN6{?w!wrjiM}Gq|!-`ify(XhXy4OOJmBS@vqC>&CTEM
z#eD|y)rg?1!ms2Y-1&97N8cl^E=OEXJxuvF4$4&6!fGkVQzUWJ8mlHy1U_bs^L<R@
zcE%x_=!giM{@%hih~+?uGcN4~`TC5r;K61(DGEmb7ZRl`6D*2gRBNbfDSZYnc(8?h
z9ZDETYoU|x;?5r~oGT!xItF?^n0Gc4`OK|(98#Vu3<3gIeE#6Kud(l4R!I`sT))n^
z#HH)U?bjM2xDF63fwsKWv#hm?-dY5-<kr}oG1YP<ZD<COIFBfwLlgq-3?g@TJVa1A
zd84c7dKV0E_pf)!{2kAKLB#AVqO1J}Fkc$yz5TRDGKoDyyGaZNBiwSI`~0Zun0gm%
zGL0zjAXuiic1gtT9|byCoQ;dfv3HAU$bTRQflGy&2FsI6sY4H1J(c6qaU$g%nyx~D
zT{25)HdBbgE+7sO>03X1QRL*<sh0`f-1)r_!$?G08=mhV!wD80a-J`2=qg0J<#Blx
zEF$DQM_4pBd%}M1Y1=K-j;F<{!}po<Cy)@)8#nlLv*32}r@ikIS(Q}6>K~h}>tcRH
zNPfI{xx`6PAlku=_&i=RASZn!LacPJiNyg@xPnTfoea2YWm;iem(&n3{mM2?+ABwP
zSeNuTLdtrtK3OP30xrpU?#7bwOWpXih<us7NL`@}CwYNrYd7NKcuA+6gEu3B#s|hS
z$#RmMR&Jri=91@f*4pM=x*T{w;UO{{mW)SREqv5?Xjt$?)6DdGwJ~tf>n=NB3tT1^
zf~0V|U-=$Pjv+-CqZc6=!qwe|fz)4_TXTsCnh+>&mbJW#>EbF7I0AIw0&7)M#NJGN
zpE^U{n}`GOCRu|W0GkDLu9^7W|3dzVpsxaws7(BT`f~E<zmje&jmaFcWm~SZG9MVr
zo1CVL9b5&Fzsnf&4YEQzs?CFPy@@s-1#(+tU86BY!Ubt;rlszg_!M;peH%z37XaP3
zKp}ujn<D;!{7Z!H3T(7N_W15!AeV{n-`yuq!INOM%xcH0>)}HhJlno0!s6y;R_SAJ
zBpX)e)wcc32G5a6bP8!UpVUDG&(TT5BJgZUXvRTHU3*J(vZeB<CHkP1uDumH*a7M5
zh;(t{^mEoJHj+>GlBdPW=ak6P+T;_y$kVvtISN2Q5j@=sPR%NX_CJL#Po-$DreN7q
z%@3qvp{d4dsaS(lbE~%)zyUlCq?tp--hdDKZ{0<3r`H;+U0M;H#g2y98)ejBp#icU
zi)h?TUj7gY*OW@mSHzvXMRVKKRRuQ)sD{vBte8ITe3-bg1tyK&0Ho}l>ELDo)##jz
z2)qYi-l4HTc>?C?hqURvaY3S6<(L1FW+Qv=<mR?hc>n3r*S3D=bKRo?dI92op|o%)
z*mKWoLv|;SMMZ6!PaHC9jBviD)$n>;!jwqv9FT&)5laPJ@h=EE0F<_#uLHWORw{rG
zh#Up*6u|Xgg$&Ijh&uqq>noycn4nkN3MjK!7C9ONr0s#AU=@Pf0dybjD*Jnv#9!Og
zz)p-$$*5RQa5202Xw)FP0B`}mLka*Fpq)@{30V3Mh*P^Rf}F?%;H|&|W32!nthK*>
zPh5`Ikrzqokp-8yF+Gr!6ofG+5ZyDB*kV4q3EnSIwBR<o56PE6$iwkz;O1{n?l@O#
zaG$vd$!}KDyyU#}<3NP7JLiiezQ}?j+!&?70MDlRG!7@AlnauVk7;^n{mH@iE3m8D
z;{UMxcR)gM8*=$E_2kN1483(?>xy9FjGR!Xm2vo^fO&@rUy;XFhb<qaMLB#Qe2xbP
zGVtGt(H{ikYUT3p*We%fclSy7GYFrF$bP|?JUJ;{D^35Bv<5qG>ngm24}&m~QDD_9
z7!x5U#cZXyQk=H=e0jg?9Rm<x4_U*QH<w;<hlSiHZ``x*J6G@bxhni&&|FG+FWd@9
z+Ur(Aj_l^{?^jPrZD+!F^4&SM_jVHDr6(|znLMLDr0S_6-%cDL`5J!qA0mutAcy{k
z2(Xz+$ptdydA22hWRPE{{?2VI<p7=ANO2IqYpWDc`oPC(3s!&JA56H%P<*hSBIg7o
z0oLUIgGksrivN-Smv8W#NlDz*9O0$0b4!K?z(@SgJ#VM={XYw>etH9U8q{dFE$XO*
zK(CZ?eZ(g=Gw87~77_;vX?Dh>s?EX+#Xcn`w^LfeJG@f{Xlv}}<y5S;po+P{0i5vx
z6UzfQ`vVrP2L^@}i1P~cUkYSyMH>Hve&Uoq?vsAftp3xtF_Q0M=wmT56EU#q7^%;w
zxi>-kU2a))Z%DLllIdF#9iUtyQ*JwRE}i9Q2W#T>8;yo#jnuiuDCH(9zR9hui8|L5
zrTl{WCek97_cy@T3*J@&u{P%a{PF&vL}Yx>!S!NI)h&9iW~@ahq>vAB9EmULXof(E
zrRQ+5$TCQw55j<xKz|tzAcUfh76|lSX@+0y(!RL6U%giT;iF@G|F19nzq0f|5U>-&
z|C`wRlfS=#+XoPsEFcb6?JjVANHBprRz-seXD+vDt^C6}eL)1(B7&L%ct{b{<lphi
zvNaa~uUOM2{!buM1O;6AE3j9kQ!6D_E2Tp#W&Ufa<d@R(^QBmzoh#Mb8KZ%<|EI)_
z8L;af)twp|_2NUp9=|OwP5zeVh@}O30zpJeA<*%P-2e6I1ES&*!4BLK@Pz0s3!Zo_
z(gH=qo<%`Yos?ECIi0g)hQz&5RM2-kJY4%s^7?nT@8dpK4=hzEC~(?qo~wHDT;J~S
zaOE>eukUU{<KQAjok<KTR4DF^yn?>X;o;IJH>0gJ&pm!-cau@QKtweO##zcKoV3}9
z1-PacK#)^feCp+94CARuX76VyvFv*08#t+Ey1YCt`LGi1%Oz|&AGPeUsf$ELM}tB#
zrv+?p3|8v$y^bn4owQFJwpR`-B|+t$H%sSxSoT=ch1tKOwp*4z6eIK|-$=m%!|tDN
z9A#`{ou(Z44ecdb(SJ64b*w_=*l=%=C+b)tym;oKZN|Y%?v@pK>5VC_gujy|fSq##
zft*2+HlY*m4>8wKm{T~ZWo6L1;gqyIcuq!NMYAVR08jyS1!`r0Yd|@Shb=w@D3ZAp
zZ3C3cysK!I2TEbyfy;q%noFoIpcLjQ9AR70Oa|~_65ZVvZ&}ey-JXC80WCna%#P+#
zK#OGsWd>M`vc(Vlxy$3cS36aw%pmT}XuX~d>7{*lTkEqvm{vT2IskNiM~XT?*Q0EK
z#2?&yukARnIryb$t9RhaGN|b;op0-j+^8MwJ-N9w4Yijw&Ja%bO+Gg3?$Mh(OrbR*
zt<n-xT&3-fO(8K8i6x8DS|;Yz=o}SQz1d;7(b=m>B?7W0chS!t_{eIRV5-ptK0C+3
zZ5^NzBt`6ILp`Dn^{j}Qo-Nw10~I_A?KOcWW1#&uP@E&Q&xP&j)#C6IC6os>;F&s7
zM<aNynM7|T&32GFy1{d=Lr-|0lK>)i4O`tTTlBK6vb`O;%1-x)J^HI3()Zd%p{mdG
z@DsI^x!Uv9brhfa@DmM`@dmx>Mv6~U_=y+Uu0d(Wse{nTdzV1$Oc0JQdTwP~c%(j)
zV#%u66%y_bA^&tJZTe7L?OW*=!SDYOcI)Tvl5LFy&t0<3QnQ7+4W!Wl>p9d;F#a!O
zho5UCc)0!-jkoP8%zr=#?VKr=fR$-I4!nlk&G|m-zs*ukd_Oqv$HMU(3&iyQLGPFT
zgZED(12_H`3n=}+Dgx;Kz>WV`-eD)ZAR6a>+EL_1&Ha9aegwgzw?%;Mt}OB(2CI}W
zWj`+r)C-pa{3Tz*<780K(r-nBGa=77R@+%`<+tNcpczUFx(F?Id`4*V6H1gjjIS?I
zB;Wl?T4cYHNrdzD-lok0Kh_9$BxfI%FJJnIao>5RBQ&QBuErmf5O*%-J`!`}tURbM
zaWikW({T<{uOfJB7WunZ;71;G3WaG*ec-ET{Pw)!5t>5=SM3i<pgY%MFKIlF)_{8T
zuEy(6<u_2iW&!!7*v%RJ>9VzteZFV#**~m&HP`<SD<Aq#R(=v*Y&LpbakbR!-}YB1
z_vEet$5f6`{@PD@-%g7^#@Gz#a%@fi!Exug@o#@v(4-A&mj8ZRX#LQ{EBJPX@9Gr5
zynERIZTBd7sLIy$sjVf@mf9NZj^B@#wT&tlj*_ddR(9blV|^;SJSvNTcG_!b@~<?*
zYrod61fkM+chO$~O36{6AmB@i$(IzHg*WxrIjabVfCGv>^cWjy!z$N^DbTw%I5hG3
zHVgmPE7`X2D{tUmTF+K)26Mc18$$#6dTIy?#|hBu0P$`|6t2QX_{h3X>-yzgmGziG
z<9hS*X(-&eRC0>~uE3w>_640hmPc*eJ77Pam*0-UWu%e~6mdBYMj5r(yc@C}Khe0w
zy!_d{1IEA6{Xg^OUOzgbx$|r(@v%12V@HEsSPfZMnkFlUq#vzuWz=Kyf@M8G7#wqc
zKBqBGIE`$eggq)?j69Y`_f^v8ai$wJ^{YhCjP_#sA^CItN`l?a)RG?nf~Olb_p3zH
zjQBCY$2u^qF|r&GLFn@ksIKj48TkmDJAo+NioJ9qf31b^%4B{1{$JwUQZwHTu-rGc
zUfl-*2_~S}6|zE72;DlJpX(&P=lth4Y7&23a<~8X)oG(QV&~rzBzL{=LZFal*9#vc
zC|&#^a<mgDs{xYsD-a97Gan&ffyH$|a(;VRTL1iidH(;tjsIt$kRWIOwzJomDXFp5
zZyf%^{^ZR)N2=#0R10Tz`Fh|0N>6K5J{srZBGPHBnUWAFe{9hjR|$0AtdCEZcC`^~
z(p#1J<6O>*bjE6?BnQfu?~5DQT>CaCa;Vk+jPSc?XHPYJsXc_@e+K+6TE|oE!{Z~6
z7p_Z3BNm$ZDh?q4!rrMyJY=C6RB=DCer4?E)BCGGgX@4=KM*9!dC)R&#Zi7)ocYE@
zP}owShWk%^IkDDG<$4uz(Wm#rl+?3M9YX4Tih?wcy%({{PQ|Bm2x(_3{A}dr^Qpjz
zl=~F8G>@$p@u{7PM-{Tyr#G81&3Zw@t;+|X<tgHwCWw?619>&1wW;vqk@cHXK@)=a
z@B2<sK6aRtCdU}asUa;*g^Na5tu)+<e2!7)5U!5^$K8UD6*GRc?esBLV(w?2TdhS4
z!O=M$9wjEmss{|{RpJ)i(IFmQLJu-p_nK;*-go04<U4G5m!oIT>}UbVd2g5;fH%=%
z0djtS0sREf1$o2x{~_~-u>Zs4(=+=1O9mkPYs-NrOl_yAu0r6|=6wtPOw47o>_L&t
z@g8*s+}r4_Tjsc>I)mm-v<1HUXp!{-KI{-Kcm{m#;js<mxgR(6MrDo<s52HAvI@K0
zx?JWs5TtL*1IvWe89<Q#FZl>e=C1roqwMnU7TM``;1d$6I@IDj7v)zF@3uz@<ZgkI
zy7IjBXjN3|`u3M0n<mEvar%N5mVyIaFw#7XX78+@<f1R=uAg{GALp%~<fpH?NR;?Z
zq%+6J>_yGpZ6>$3km+p_9UbJ1bbV5mJ}yT;DNkRJrk_~M_VghUPA-DePgZi2RZ?Nk
zqRO68C92%Ys;IE)sIqFxn=S<s5EgJLlI0)eo@$!!=Wr4O4tUdBi)P);lO6>XRgqCE
z4*!FcFZur=<wySqDZd5(J&Cx$Ae4|=Guh%0*MUwjuF6Q{>hZuXlf^Wk*v_h*@G`XZ
zFm#)`CoD_FX&ln5kOq?6=B!HFt~-tv?85Enl@65I9wq^7JHW|nxe95yCjA{BzY#m#
z3FOj%>>0qX1C;#Vam|e`iS0~YtjA7*@F39QfJ|Imdbdb<``<+|B1eCf|4kMe#HFAA
zyGTFokAPM`Q222d___iV`Lvnee(Uaj<trI}URK$w=O#<X{6#+B(R_11ph$7i`tpa;
z2W^Df=+<8namzsI&fMGY6QwswiV2AQt>dM48Ir;=3}qpHXL*qtAlY83UW8xr1vAD=
zqZyLm7>0xpzmB}f4Qu0*cNk7QG0_mAIJoBn1q*BWl*eft&ff<c@yuZiXSSGV4xu<6
zd8z$_kN<tPlR>MF!n)^IX4L9=6dov+-tO+v2gS5(3idQQmR8=<2Lkw(6~TlVIdG?y
zUic%od55dMVYTGP*Y$zaeap09LYo{o#!8PBK<xKtjR=N3y?9RqZ>3UE5~XLKU|lUC
z;j2&hMC9laj7XM~kg!rYUZQbMqQp?%ZvXyg<kHLfPrh3gsg3>;<+<_M(zU<1$aM7j
z!R-o%9gj3XK4eX;Vzns($ktwGcvObF0txjmLO7tE7c$u$F9=y|k5l^RMkU@|i=hCy
z^=mQoYcWOsG1R|fd4JUO!l*<ikeUY)@IW^G@A#d640(Ie=b{IQ>y>RDl~F+JQ%MC{
ze5Kp1nq|bc<JSZNz3^g&ZJy?dG`$o)l(=_2_z#g@?2GE_*`?_1E1&I<_uH&|v2P4!
zhkLgNxQ72A@BhK->sR(W#(0f7LRO}`ZL51LRaCFc!anx)HRs9QMPZJnmY6HRyX~GC
zoJh@&RIrEIU(cxa&GYM?74PCDf`Ct-qG&Kiz4EP_I}f_1#f8-V5rt@gBwJU=;Z>wQ
zYC+|9qF}F3)IJpK4T|y(1$&R8PN3-1sQk}+J*I*<{ca)e0)=*)q>e4{96-Y}CC)M@
zcChfzv4;I3G;Vw6i;dwYnkXJk=c}72i`$+$WjYe+dq-zsT`7kbK@&!#+v4w(?NT@f
ztod6lS3E6a+b&P+llpmjk4JvAtcL(b5C(iDY>cZ;BS#{z*Z$kszXu90>UN!F1|h0t
zryA~GEZhGg=G*{cZu<XD%&A`3_UTIl0fyd!6C@_k&|nT5Je|H(*T@Fhdxe_Ost%kR
zI~?E6JsJt}JJA6RAl85)-#@v4|B){g*skvVQ_5>1Lg@WR5c03;-z)(CUqQ%Ds396R
zdKM_{6X#>q=0kBR0Tu4^c7wCvI_1}*TkBs+Yn+-P8!3>$^N<Y{h#xCt<IRCU%7Kj`
z`{w=ji;v(6i*4{<?(jJd_^)F5MML>txsTkAmdsQZwH+;-eBX!d-;e!ai<wM7|G02=
z|5?4B%Q^{XPxY9cv^cBY9$b;pb~Jq^_(rq}KKd3aT2ndtmT>e5=IC3WqcnRtHoZ^Q
zM5&XbZpCn{<GZ-g5FpWhJ$al>C0aOQMM<B+(W?(vxc)2SrOc6Io6o=>YvrX<q%>`1
zyg3#vghHQy!^K1k#G>T(b1c@Zv)Dk_#m1W3_lz6OhulmG6f0&GX=`-{ru`x7r#@+0
zb85uL@$)t(2ZRM2ayeuu*T}x;O%Hhnb{E@vc;WcBj6Gg6zoOsQ+&Wy)sdDp|?VIr6
zh)a#D7oVLLCDbcaaT63~oNs-8xsn3^^l|;QQWMA71qvRCpjaQ*RLWFpTGON@QLNF2
z5Ai6$oWn6eXd2R+lH~cM;ad}jRS2aw9!+Xuad^4bY9JSTCBhIEd94nAM=(s_XwsD>
z!;{ZfRZkXKQ`Bi`$9TWiN#7}WZg=)Jnv?Mkm<FGDdEygT)<I@0%lqeEw>7IO-fCUm
zAQnf1&cP@q;3tz~b7lrUz!j!tbF_lqug_j;o;<1af!%lwwJcn2A~V4}%jwi3_0G2E
z8|Tz2vo~i;kx5f!(SH7p=h}zEN-rfY7GIhSFH_)Kb>beOKCfu#;qN%5U84WkJ9lwd
z_}YE*Acc6L#;&^^7duCSbX^V@#yHIyOg&Bhg2-uN>y?1iAlHOyK81HE0;@*Er)<BB
z@zbx}7CFE)%`5xfC-`^{ac{G}_O;NYNA-1P)Vc$PmCRS~BwenmPcxrl8<%L<kx`V!
z`T=pI(lzry0C`}(%)|u`tqSY7(W&LByHTZmj`ixE<kgfLKf{N&cQc|hRXZhu$Y}vK
zkam)Cvs24QcVR1AG}kqWV8I>wTJ_+i;@|HF&kMVWoOU>H<rYW0+s}v@j^<I>zyqr|
zE*y6@&sp{HFG<g1ejktUFcDL4+JCKJ(te~;4ts;SasSJ(P*UZmMl{uj`8!p6B#U&-
z`#sG(i<5O*D1JS-_KkTSb|Bp7I&;XX2_1Da1AWa(t-)>Y`LRUofnUCPUxY8;?l~A$
zD~h)Na#hyv>`j)~Y3;?0==b`kF|?B#hn#-wX%aPCSJ<#I8twj|=I<1*y*Uy6Ua$d?
z_oesB?MAT>t|;kSZ<$(?t63OK>|w0u#2);#=gG|L&r;=8f=K>M3>dFejKt2p6yF1J
z<fn#a|9pdMl+F7RwRlKQnAM(7;C(er2GbFs73`$KQ7tA@=Z7;dN%|hT+2F?Kt7Cri
zGd(*6-E#ETf!~CFZu6s2&XAvZm~+ziw}Oj23lR`v;vVijayho`zxPGzWU{?q`&J_}
zScoQ{6;<LMmyf#n(_UcSUe+S-#{Ab;A153W9F>Dh{TtS)c=U+(ilI8M#KSF*(nmz(
z(!Fw2QwSfep$~6?a3A$vL8^l#R0rV|Fe$BTnOWejOgE)p13p&9zVj@pR|^Q@ubqCx
z6u_j2E731typh^rJtb+z51q)D9;z3OyK$&M7BbpdxujsL+wdJjo?%>~tbp;4FZ_3K
zhxZ**b?Xb!7cfrx$^w)nYj{)GFP(TC6YAc4q*eE2>CtV}+jp9L;;Xu?i_Z!m?CT`X
z)@OY!vshW<_V!|>#87w5?P;#Vy|K&Wlb*o7rdV3-PF$!JuXV&+OM^*qEdh5fbVwX~
z^!V-upR1xQn4!cCSW`N7xP4RY4Fvxp!a(FeL4c@Bc0urv1m@{<I}XcxEpNTC)Fhw&
zGO>_q_XV|f=N?-+{j}K^edw)c$EN(${oDJY!!^I|36GB@z5SZj)~|K_iX!a$$1h2h
z3xg6Ewb{mj%?kC?QxiU(iL{y@9~`jbojkCIWdxmkufDKCswc0-n*ZUN^K+*b?1P-{
zI+j?hp^xyVS6l2WA%in1%G~$h%6<hRcKTCSQaiXcD%$&tuU`>N?(~M0f3l9J-B<=R
zzT9_!9$Q36H6AUhEmVATHj}12cQ4v_w0O@d+2_;<eKB0UqOE^ndt(>8A9o~94N75F
zKQ|6kZ%uh5@98ZS!>G+S;;_dH3N_pA*(>|Cny$7|kBpdeHz|SaInV5M*<#d54A8n7
z*I1t0W^|}e^M>RqKdmQzeV?VMeNg%QfqS`SPnwCf9|z4NxrZVqsG7s)8P(qNmVaiR
z#pQStjfy1kGyWd~_<Eo85f`Qhx3RJB?*3<DiU*1Jbhfp8Ig&j3bd=~a_eaf*vo8CJ
zpW!)A`pcb(oNublEmK^m!e2Z2N0B<LGR3}h>Bzf|c=2~9PxXGG-L+bW9S&1I-==W*
ztc&}CU_GQY^3QBagZ{|9lEu-ZJzl)#%Hiao3dg>Ow~Al5bSNBtWO(l6A*EpEjy>=8
zz5FdYXzP&qv8Zw0`@&^)XM^9&i!Z6m<$KFhA7s6%5bg4H)E+zZ)LRI@GGD$lwGwvl
z+upXCT>lM->h^z*0bwsWkGQg4zlE1&9%Yf2*>@!w_*%}9L1v-f8WV}Xclx&Erxkbk
zx$NqSu>N&!q4u?3r-ZuAaT<nwqS~aTpN2wEi-A_1j!h6La|&hiLmyWe_G5!dQsdpH
zGS7Q&Cd871K_@lNo|rmpb8?io_t&1~Cy8M<JFcXdppC7xiCZ9iO~>1E&m@tFr#jVJ
zAb+2Di}crJHpDe9!wt~}Q(iPo?%W$R!ii}O#4Xld6=WEbPg8Pc3S>UdcSs1C42KIB
zG)1vZ?o$Hx`CS8^QP2c14~1hPk{8y<LOfXKHs(bhh&HJ_2pc0sS8`zr<luIaKAZa0
zqsLINMPBT52=_{5CH7QtvFD@Iu;*;--yUX)PPlr$0Lru*?3H!&)}S}G7`@>FO`#8&
zcomEx0gLNFuU}OQ@!%dWYGr4HuqU~n4swdghn4u4PieC#Yy7~yY7x4Nd;C)?`&S4%
z)~Dk_g<Hw^^}|^G_(rr(isGdnCw-nh17MYGU{jtkQgR+AsN`&><iqgB>qox#SxjYD
zhqCwA3txUXLcUBK=AFBBSzGD?uj45B8kc3`o_@}UI{uA>raP6=Tdm56`vu?MHh!5|
zSF68IP(FMg^-LX8dS>9zdZb%!Xx2BTz|L#gBuqtvIE-ffPWxNNS8eEpA&xsUd3Y`M
z&`&p6yr37}@!pXs!0%&eyjsVSocS(aUGI$G4PlN4OGl`aniVbL9`r#Mv4EG?#1fBM
zE%$zoddOSR%>2D%tKs*u^T^0ud5#cBT5qqWzxY=3OO1BOnKPhEcZsl|pL@>EPDX{{
zPHhSHy}$pdmN{8q-y_T5Q)h3UND@3Wx%Nd{wzY5I;j4tL*WJvE^C!(azTd)49rms#
zf(c=5FRx`Mmm8fvd$_c$o>}7L`;blNpDDz9&(6C%+@9WU?N~EHoy{!wF<?r_`l>B=
zA(edZnfp}N&RWZtvi3*32Rm%o^!)2s@(y3NO?|chA+LTL`@zq=Nj{pF?YDQ4DZcmo
zbF~k?k@FFs7d8A@&oUi+e?(>~V6yt=J^n@;?UrrPuXeamoz40huBiE&d(LSTKDpLR
z`|KMj&o{Kj`^0Aq{bB#xlD>mw+UGwVdVR2L&!f3-QDJXqxoyPCmX5eh&7&vwt3CRI
zAN$$bc5uXiyIJY6bjO>q<@eU{d!%pQHn(kfuE+5$YV7}`?91b!e51F^&e%eBS+bQi
z$-ZT>MRr26MaphOb_t^pV@+8~$darPh0tQDQ1&HDM)r^``+Gmn@QvT+{ruj~`{(7H
z`<&~3X69Vy+|M(kfz!ax`O~o=%1@ju35pYv?adkM{ZW}Gy@~j1Za<Aju9q{ZnX^e@
zf3c6%;<-01Tc)^w=n6(k@TbXQcE=o9SLg(a!vGBUt;Cn}#JzL#cm}CIF@I32D@U_W
zqn=LUFr^fJ0^%);I?5L~zjzHfBSHy3aCX$L=;@RMT#>R3DOKtPpJ^sF`Hy%m+ckwF
zY1e{_gSjVUqkSXT1{(k|!UiH4=}tGQv3oD@!<}?VLJ4o7Zu~s)>DXmr%D$)6BupPT
z4L-?7oh+ne{WBU6;z2AUz3hI#8|xfx4^gdxvJ*7m#iiZ`@X9}ULQP(N{YTt9_?fQ1
z3|rRNs0WNB%8b3=-z^N7?>>-TxPgy1iYK9rEWYt~TbNTCY_vl_QND^87YwZa=<70y
zp&$z`2K68+Gu;OH+O3HwOvyy4_O1C?ZjQ-!A=c9KoYeH-`sNJ4L?I}45BWU*AB3zg
zaS*k1C3_b?jg{=J!t^P6F9dGa+|q4Q)2F=t!Fl&igMvBw{fp2s2wl@E=$a~X2y!$}
z0iN;f!d+lnCQ5N0pMde*o)NsZVQZq%l`?xg6*PYUp1nVDJRxFDevHsd4~GKY4-b0t
zg$KTj@r~H-Z{TFF6}n2gMT6p%q$fB-a;aJP?c3)|I!@YF_eDmJ3_U<ZGGbbMvO8tH
zY_5F496iy$PMC!%Oz>?ibc$pWt3%4ppTFM3+F#mPh8(a#lP|Qlif|+@-OO9tm?_uC
zcm*C^)H<G#ou1ZDFNQsObAo}I$|%-sdcDoqwh8|`@J-MEc_Yt0ry`8pN2%Wj;kD3J
z_^PwaU?AEMUTjDI5?U;QTMU@sjB4j$9u`6?vz--Vr`2WO-7#$K(r?ptmQ^6UIU%2H
z*!m>N*UMqx5gC*OA_Q`zWpm7J;VDZqnN42}+WgB8Ez{M04m&nsh_lixmH7E${=qd4
zF>HMHzx+XUL8`62BsPp_YXP1l)^}@`vjX)D^oB%Ab`s*A-XV<V4AkWP98ylwWwlCj
zG(VD=?lTx*H8?-*j~|z+2Ai&(QcrUQx^k<tET=-c;%=u86;bp0RIa^_^H~?dyd?^C
zR7JG!5Isu<hiC0k_fiX)X&*-?Ey!ZhEZtz5{vH&qyPfMq1z3)ByUr#0z73=Thv!g8
zuivqDv1y+aK_W{fkk1%J{SCn5LcB1HOU=tnmoNW%ZCMB-GYsD2-}Ktj`+2YL8M7hd
zCGvN703Dlk6~oUEAKH%jGlQQbF<2+Im4X0?Gdp<t6D-AXv=5_wS1TpY?Be}ir}#h|
zFq3N^<421x%E3+|ve4GVG@t~Y6mrYvP7rd0S}FX6qo?rA?HWGDwktMaM;7&qHavR9
zpAsljedkoX^U!y$QgRYwsf%ZQ<PmFVqVJ8yn)BgXcj-uIbFqQ~EA7#K*F^Bo2a5(@
zY^~6z0?uB{BxIqahN$ls<zI~r0gd6OCK63dy_S8V-`y4K3?Q#=^C@`cNoxpUn!i;_
zF0;<{oDUbI?%5y`lV)B+r)O@<OkxOs_75xlcotO9iIn~QKoH-3oDV~}4!du6Z4D@y
zPp~v$Zw!8h69f0Vc-DA{sdjLxR46k@)n`1N!M65E14mNZEHB(^kR^wlfUx06Qk(}a
z@*4^O2~JDnR?<O6#15lu2n(?dBT+@dx$}M<LD$x#+)gNSRNYxGV8lOhY|&M;Ib+cA
z)3+1g6TH;6Q;Q$Z+ER0!b?#d*k}}tRI9P*n+~REX>SP@!ai@oi(irB{+GBVBD+{Nd
zrms<Iq4?LX=jC+0>&?JB4M=N5f7aJ=uIiD(-ic6325-N^(4*y_l~IXR434Zq#fnl=
z;n3m`$@7QoUEN@{8N?&MA|=Mdtevp4|F%^evde49y`No-Qu=9k6>Kz}&U@L<9L}mc
zQv(#o(7CMB;7a*9U`M4rQHmQY?Tp`e?PsVoE~5y#t%up^{rNB5n~o;VY!Sqz8YKBT
zya3$;v0>p7tvYI`^xxWD;$3jb=!l+Cqto*)rOglS+FTt!9{NeT?g~@rhdaCPxH3}x
zAc?9_K|ASIEV0}e*DZ%NMa(v&0TcntR12t*mkZ(W(?n#~DpWw5FjTu?t!LX?G92KF
zX$uN}S{nzGn9&vX{cyeOgcqdG0X;Js-~tjfyM^~G6^Q3@bI^N-J5cZz>4UL3T0rGC
zDCnnWDm`yKaaJ9z)l~uMFdW)aNgzDm`7E57f((=(V@jie>#Xjc7)};CP%zgy)*wO3
zciygT@|m!jV1Ssxsv?H{_1aVsuNjlqzj0tE94&bVvN2GP!-}=H&z^@RXDi*o4K6Fq
zlxwzX+mcC*!Pk_iP7{9l+<?bSV@&iY)i2aH-@k0(#8Z<A22AsMl&%hVMg!=E4Y&%F
zkMf<Dq<?lmEkpM@;WAdY+!<<vfa-jdd3Prrycxbu+|z+%9IS4SM|M@Lvo226fvwDJ
z;h}2uPr}y$HlMwR{Jlo9LKg%C4*RRnW*2-G&ne4)M7fS)Qf4A1Br(lZs$gHg_p}y3
zwL@_Ii|%~On!ev1We!{F@IiTGjR5<VfJ@XswH3U5TFF;zs$S1x*dbi&>tk`YGje>W
z6d9-lI);tq@%5Ap3&FJ{wm<k>K*!faVy@>he6Fzz-?~E*N@5ZIxoVzi`Xg%I(}H%3
zfyA<*wHN)2ktkT;<0@72Kv0S0BXv6OJ2SbI+}AP9eP+{r?jpvg)PqIuXi)-58nY;P
z$pJp{V$y1w^0L1_%8==EkaNU)l*1;S^JD~6MDdUaHP+nI#eibBUQ_+5Q+8*viY`lu
zu})h%6sXQ%q*oIa4rU#O3IE`Nl`J*_(zbnX(B(Tqahvp^xQ|$YngVc;jminaQ`AJ@
zYQn7l7+~<~Lq1~tVRU*gzc5hJN`^TMJG7;(04kxCLd8eJ&@Qa__za*usmNl9hnDO+
zwOknQ*--cE)11`;XW6K`BJOpkM$)1LOSXtFO0)OqD5wRnwP2_wk7R_jU?x25@-F98
z7^3}^2G$8*p^~#L()wxQp8^>+lfIqg>*=6rPTJop@-%VjtA3HT^L^R#uwT01%5-Ov
zH_fZG`KMyoN0(twyC&jSK%!6C51CGP<q0KnvbTeeOLpqI?SUK#sOzPjFAT1nMk+vA
zE=q^+ujt|!^nunT(L*IKT&A37_^7g1ApT2MRT%LpHMP1vP4rNMQPB}j*>}Olt&$hz
zJM)Bmh)Md^DPEz{;W$`Y4%-O^U8X<Y4u~h2wUl;EM2l~BK+CV=JnGTelR<7e5)<q3
zIu?B3ZfH6Rs>N-(I*CZtDg}!ZR^K2wy4AbOK579z@dj5GS;wZ_(B!!~L&1mO4;Vi5
zWzMM>C1(PK3}M1Q@k(E3tW#q8=2NE$N$T+n0xRO$&Y86o33FRS&r+ST(?8`ockUSt
zamLc%(zIcvgry4HN@uW=p`Gc^!@Rjs=}#R{<hClX|K}Cq6O1~<piarVgGoipnX2tf
zIwh!(zJI`^lH7kH{hAz9wpKd9U?N)XnU~}4zyh$HtYU};`b%dwoI4Km_%M|lharyH
ze^!UX*4K%?%t3W2woO4JF?weuqB+pkR+kjU!ZvqUJZzlmju;-5CA+6rT(=wf1_()%
zAJv4^@hzsO>1}MuSkd3|sqc?(u{}-qAm){ZY~BKYnVz12gmG->y>#vI<s&QAK%d@M
zN@k}|SK_441c=+%P=as%n8g?dA1EWfMk~`lGnit=^rrKo{T={~B?+bAmY(NdF>I`X
z^oXE=C@%FN#QTY1T6^r#S%eRy4ooy!D8~Ok_`K7AZ4J^%l2A%0)&We&Ep5Ng5}rvK
zGa+Xg%JmrCvl2GoLiOrv+0MT+5hm2Fd`hIW^n9D|-d#No!KcmAZTceRgR(NVb^M^p
zVF&H=9-94TV-vHYBVp_0yz*QAgj#^it)@G`nWMR6&`&OU<JKhRXeKmZT&r61W?h+T
z=fqcq2BAjO{G!x!M+TB83eWneM)bHvl5gJl&^O53ex9xLATGYcJFzLaqJO166X$-Z
zRZg>}6E(jVJAMqWe=JugoRUeDEEH_d*tv*3$HEryVx5r9MOHZYZA-0i&0vm>NxcJ^
z^XFE^IwK1}sIe`)IMx>xAoPn0DD?jYKTd5c>(qSN9}R*>FG0I3w*$K_Pumq4Q_E$#
za)$gPhZ|48m1r#Z-Y0E4f{=MchIwSC&K49C-W+VF=8JxMN!vTkK+m+aXY%Zg27aQ+
zMNJ_w^jYaF%XfB1@-_kEJFIPJy03A$kW&+WX{#SK3+mH1gSPyNFbW?fppDf>EPSU;
zyDEw~sUUCCh3*5!ts`3UD+LZ$dNIUs+6j2&N-bGw>y_e==JiP^ZFD9F5KS@Z?3{EX
zXIU3Qn8HnH-M}J06jQ791#G%_9^|`#(uP-kLd$W?R1=qQPDsP~OK|zsTdS5K^4E|j
zFrI-&V^clgt-;<~cwEwa@YaGzr9)WmS#uCn&=sXIt_}Cr)X{t|A^al1|6QzU79*1D
zQF}BowI|ymwcm!7*t6BXI3cwSLeJ14G7~JI{}o>O*-3wnty6mV&P7V|>5q9r)1JEE
zjOes<BkWfJ`C*##V04%54<QJGVf&LmsxPALTu-@v7iUK0G2~QOh5MgRTcT*fCfH&W
z)V4f}k+n}-*NJRV4pp6zR13J(l27B7-gHKeS$rAexLi+B2@_&nv!Nh1;($)au1<e+
z7wNvGOQ;MuxaBc4)|eE9oTg^hZI%XHD;XSRbMZ33ao2h!6a-2^7D`@<wD359LCWh@
zotuikx6e2b@lk&eC3m{{@WTD?LDz_hzXwar(us;76je9wo;;5T1&4K?n)HiU*YqjZ
ziOnDiXRjyt@;BBbAa{akNZ2N^92eyi#w>mkkdTHFnQOO3=u?eXKAfSThK;j8SEBu@
zRPSJvCYAWY^`<je*HD~F>KwP8#(O;LL`wf2??0-Hmw}(i8snGKrdLZTZ5!h4M%cos
za{zaPV>j<X*?{Ojo=u!AAIiXqUE|o$lt)4llCqEE#8B|X=*F7UP^MGiPPoK4R=;UE
zxT%>j`>g!&LkX0@@rx`>83j?MyoF-SKGEVXa{mZtaC@+J>wTF2;D4k>J+=ba*j2xd
zd;-0B@VP}}B5<8{vC_6Y;dsA7!))!3ya+b)#p}bw`hE2HP!vMZ_q00@oQ+^D7Fic(
ztdJ79o<mA}#8sE&)V5@LF%%9zz%kbOa&Q!)S6<`PM1-3ZUT3C1bMWiKP_%d|gnUFt
zIm|$RxUz4bs5k_3`k~cA61E}G)WJs#rW97$yE(!C5Z~P{rGQORTcm3F54pw%BMwh%
zm%u4iZbiyOF3HY0-QfU0(GVH|j0S8#_uI2h$}R1nCa=;}0XVjJ2I6V7x*UK<`Y?LV
z0i6bh&XHh)<`aAv?4Z{nXec{9_0D1QWapqWM}#$_#Bq_uoye;^cp_nPM+6W=%j<XK
zI7*gS7{{f`<<miLaTa^$#sq_Ci@SrL9B8VpHy!=fdb^#xFK=#<b;UE8llTG{9`vFO
z2F9ePXGD>d_dqw4$(mDfY9-fT;0z8MQR?KWrS(TMp_E=NA#zcH2Oyg`(#s)5KSrjU
z4VOxHd@!doQ`@<bT$%%%uNX=%CHQvc%^k=zb2w8EXnCyBtkiS<#9uLK{T6L{mf^Te
z&?agQZ{l#Kg@d6_Pptie!{^W1LYw%j?YtY6dftKH3^o2c@iNn}Z@Y>~nucf#-Ff_J
zTWdFszxdU}{OL;wbyPY~ZEa_u+Bhh8QND}Hdk;dr!nsDhB1$mMYQXJ*g$L`(G?<&|
z@G?TAY(Lffl9~obqLk2CAk<2Hb?*eHl>ce^VOeJ0?-t<mxplUG@D_FWmw&wmZ1%aH
zcNy*;=wSV{$02C^SWuLHQwX|P_o6Wj)jcJXI=&Hk%^I2Co~(b49wT9kLUyk_&bELR
zA515N{)AhP4nku8HvOV#KeljxXts%C{i;77<+n>x9zqM=S42+*K2qL{+h*9TH95K%
zOXQuCA9isEA&I0TA>xu|kMaFexi<8fn(%Ju8KP%pK3(xWH9R3arwRCurN4ihUOg`)
zZTjqj8_i->^=va@I4+XMfq+j|>5TV4yksqpq$VAywpS>Z_mB9?wLBu4hNP-qY1Ldl
z!|}IkL6jEYiag^p8vn4ChflK;xS}_@*PQ+Tbic;h+*hvGu)VR^!dDca>5`O7mwExM
zFti@M^Z0|^ef|2T3up<E0JWe?VkXaw-DsE^gdgNQd&djNn7EamO$h0!%^aR}dHCc*
zOl^Ex2KmrtbYR(A%RriU8z708&!X(c*Wc)MjjdUhzT-<R%_+m*T)l38(fN6MxCz{D
zcOy7M9#WT-+7y?$!}6BF8%_KMZ}s>G0?~`V{9hLa&WW%HE%7k@<%?s!_+z`@(km-2
zYKvBbB2hSKPDD03j(i&cwjVpd@+vNB8^0<qL#OB6>cbj#9;Pj@$l=Fs|E~3{ZrryZ
zu8a(mH%BUN(~7q~wEg=;{RaPuA4dk>lFCeIitXrdi_;Yq-kJMB@N$XA^awe(!$ed&
zTX9Xw)7!P&0(b6*qHR9Yn0$Uq`glU~83Ch)1HT=jVEhNSL6b6tXk4dmGcz!1oZv*L
z)T!$u)mH1whAx$c2^t=yHSKKYi?kA&=UpK&<;PbAl==u9eI)a!OLd8(xWzxbev@MP
z@hz#@jkxkZIyB5b9e;c+`uT%EUc7nZjKe2Y>JJ>`PE(bVrQpk>3g3wcM!;!#rq#zx
z&F@S<EpNLg)?RXY#<?;p`~9@cdhb>9Y**U1H`L`P;%=e;_N~a|P7ZvKVAij|JE?&#
zoehboz2rrYLx%LqD#N^f3^?S~M{+zMWwr=YdOW!aiPknH1u&IA%ZX4mjy%AQ&v4lp
z6&RNAvQAwFxi!ywd1~Opb!Pq8hgoMo5WAuP3AYa3<8QdrI0L=oUo1P{O_Rv$z0K|W
zSY!x$Iv`~v=hEp`o+<M2(~%iNwU<OYdF=#5<81jqU(bE*O3PZVu|DI?-Hd5*fS_Qx
zM&E@fZl-=a$<Be-r0M-xPFzG{3!VPde3wn-nZgn-eNd0fC~^w_8UD8|mkIoK2sqVz
zu1?Pgy6(Xd#1P@~5zAxYKkqAIUBF7!?@Tr-f`!kt(p4SOAiB{e=GkJV4?4et3uvPu
zSor5F_J{gQU$vikeKe6T1|MyS>(6Y0t7k&H8JSzj8`$(i9i}5Q7n57b7ueK+gZi7?
zr-dWfOPNol+>7N#b_L$=ue!7VHb#3U*4x4O<ImIkFwS<;W%t6|Ag{MWeCd5g4f}g`
z?(T^&Y`CBW7*$kOUUZ?AE7!2*;su<pnw#^$+ZH{Be?RBC<v&O}MP4Ghs-|~&-#d;x
zZB?%`aezR_SwH#SeQu-!yUJBKZ`gejY>cjKr8SsHIC>4ErPqc{?i@)CXV*WvNn^(-
zu%p4WVZrdx|5s0FjxZCi4X2O8rLm&CFGZv}SH-kGsJ66M2}i8|2PKgGpAJ|hkQ;{~
zbK^g&@}Ewb15i~0DN|R&|Lc)t3dm$^b<&Q%N99agb)TGPb1@#vDdh0Xvt;`rr}Q_r
zCczI9GS=Sw^98J~j$AvvbbYCl=RKK|?b$2}e=WOxUnlf(a7^Bpl&=O4$pwmIzhYDu
z&LsMj`Ao-I6H1gaeJ53TF6Jr$_ES&?IGNSg@bfNFh3t`-1p8~=dc4pX^rx|xX;2h;
z6Y+f3nDpNLNJhs)v2fn=&gL<HR>IuBfB&%SGu;)6P;#O5afrhlpH#QI(f5o5D-oN+
zOKKV%4Rp_vE_UET`eSZeLT3GRUsoJ7%PLS(+Yt*r<F9wYh1Pc(*+O;;d#UsQ;#Sv&
zTtm}0Fr|2G>v7fpY~tMV=RVCv{%mnp)(KFDvz)M`yX+DlAbm=pJ+_6~U++s#LpeL2
z9ifaqlUXhQFUQgT&l>x5mdf4c=0JYl30-uBNW{9CcQi`h`02?<8O*S&1}>;AIv<V`
zk7LkG-nFc9#uA}}Bg=i(@S#Y=u;VCI=5?3%N2uQyC)%tJfl1Adje`S4WMyB;Vb}D6
z`=t^xDaYc>EB=jg(G~;6IFQB%X%P9$5^+*r!z?%&OCcl_5hxUueDOQkEpFEvj(W?E
z)*p;<erm8^VcaV`3eutWu4mp`lIQs~zz#i;e{bk5BkU4#0<n*R;yjTgAV@~kpU#-9
z`;$#?IF-Oc{!F=*lQ+3!N?l0uRKAHM=%sJOiXWpeP4~6lU(0>zg4!SSb9$9`x~k9P
z#E-ExvzVFDZ7VZLCxSTYL+#zqCK+0qUgG?sVLuC=n_SGO1#}^VK9K+fGVm+H%f|EA
zHE0(@w#1;yjDLp2skum&4SX#;fFPYyN!aS-88Z3{V#t|^2R0V`4Du_QEf=)7&%SD5
z`B<$h>^uE1;eN9E^&3L2bW6%rlX;f<yfz$Dd2RjO{9Galk?9*Cm8w3IgCkumLrd3Z
z_4W%<Sz@;e^e$NNUw$3?6x0qo64>>HHTMn3^UX`xrl@+C*M=(we9bfSUbSxF(pehu
zV<(%*Z)Q|`CT?At%v1R}9m9P#E9_6V(I3f-9Qyk+{@jl^g%VyD#=RqzFIPAJt1gB#
z<9EHv6GZFl5L@}%m0N!0oARRvTz?>%Dj+&{Vn&7PF`o=`6DSuz*I;8i4spVXh3jyP
zvv|!fHxCoEv_H{1TXB~^)VfzIRBg+3_hVsc1f2$vE<RehVwW@J-u+iO+T9H?w9}Rq
z^5?Qzuf(-dJB~Jzu86RJa>fVMYO}xY%G;km8KiW6gDNuOt)AgKdP-0!(_A%VkOg5s
z`136h#E?P|^3v#hHS2xwY@^(5B=1s-u@!f-Zj!3rwwV-Elp(cI&)#3%M+W3&<6>rR
zpb#rml#erNh%E~oSj!=j{<z!?CD0e2gNb+zRIR(A`DHGjE9dd5J>W0DPL|gWlj3{*
zXGY_={-O}5?B&HQDl3kokvS5lt_0uzU{FTy1!eJH+*dr!Ll98v+@^K-BtZ_EAeNT(
zg}~j9`u9I_Vu-Em&J(_z!g|DhAQMI0M7OT!Wfg^~>9EC_1Sg6k=MTUKod$2|KfPF%
z_+}7(0hGaJjH7k+MORvRPxV)LERV>m{&!=mT5K)-3D_Btm*XXr8p9PJB<DMgxj`uL
zojjoE5Ofcqn{pi8OLTqGoLyzZ%zL?$^Bb8{7L)G*UwVC=IkUgsi9@`&NMcMVA^*dy
z6fCk|-%pp}HVb~Bg*Hd97kwYNpu<M<vQCv3IpGmN=i{3)nTLFK{4a8c<Xi{~_;(NJ
zasu)<gR8@gRCFP~V(CVDqE|=%KKWo^!0)FAevz9PylY%i1ez(XI_|^dd#Wg;S>!WR
z2Kar<_=XGOaV&3oo`GL<rULI7(PIy==vFhjM8tT#K?)u3GmN(b+4y_#L^4iJRX5Q5
z2~<UKK{#n<o?>~Xt5AJ$2U7X4`!}*&?<ub@oL-m2Esm|_B(oEVXbJlR-hO1Xdg^lL
z!b%xb#+7|=?%a~MUaII->7Iafp1GOgrqF-R-_%_uhazooTYx#+i$p-K=ePl@)lOfz
z)o00w@sgaKSYWNyQdm0(FV(`<b>C^KjO$KE&X70MB`Vjs_Xd>|VH8hi9WA^&t-Z^w
z6?*asXME%{3;qf3X=K9%sXuI`mHg9TsOTI8VB};`d<8=<QBvAb^{w{zDtaObW$_xx
zBx*myB^Xp{bXzU7z%m-eWt3hgVtn>16mk*y74}O3ewVtvr`Z@F&%(vd@X-5i*ezXx
z!*I}?ZbiB3lL0#oZ$s=7GI%=d#VcOPc+q3gsq7ISRrHF&9OYIxtqIAQ{$_*&u87M7
z@x^%2AE=y#BYcI-W3?K{_6RtRMttNhxPv256eb`6`K7YI5rG}Y@~B7!teO@(H=}j*
zwvK^X4Su5&s@2HufZYc^taq-HRN_g5*pBM_y53=6sc&q>^(dnpNTI8B`#v-RLit*B
zGEd}`fN1QO_Panug~)xUHCxEEvcz5mK)wY%KyZTv?Ivd;Z2}RQCx969>NCl}3-ePG
zjwh?z<-(4gUQmj}j2?!MTlA`IkY5~Ae$2m+<e=c@H9}S*`4t|Vc^nEFlD-jFibvZ_
zZnXX^dAQ+ePHk2}9Z(p;D|E8&!p`di0ELY;L{|t!qzyOJIofuRX<?1gwH5qcfrx90
zsuG}KKaFgp|JdqkJu6mvlMs>@cxlP&*h>N<*qGR}6|vCqzNTaKtDmdGy(+0nRO-T3
zT(o59(A`+uNyi7zewDk~o&#fo0BAqyDJ|@3c~?6zzJH=$<p_5-)W7)B^C6vCzs(P>
z$RU>>72OBbJRO<^{#j#$_lo0J$I;>(G?*hU#$`Ccp{p%V+JUmAf*$JTcd$UHrKy7A
z&C{$~uBx|WCN*6YTYB6?Lo5qtw1a#>Lk+Qdg2~K>jrRA#P=8J@oh!*fcQ(rc9Z;6`
zNnC#nK8MrQkc#|+onQtj(ba~w0P2AZ#F4(mh3=e40zN1n62}C<kaRBMF+)o*DBvmg
z9)JR_3ktYT2J7%Tn8l3g2{_4LOsyu>4+LFPEXBh+OUU04qqNFlM_UqSo2!<YTdf-i
zm3j!OXX+VR@V|qbez1Y%2da8L8CySrHu2i<KzYMoU|sL#NaW=dHZ_1e3g+2o*Clb2
zn+ZQVm{@kG^mQzOC?dw+8`WxcbF554dczMy5cC%CSY#YW-gSd6k)b8*5MR)1fGX2>
zp@5rd`Wydgkp#s4?!=i@#=}sfI1<h6k_REg=__au;Cg1mx!5U~kb<Ll3Je4?$p067
z8yNbyB-ZK-T|>UF-^R9NMRP`<`w>F^k`ny-pi+?p9Z=mbec<}qF8_clAj2OL1}-8X
zIT@*{v9-DiK!U`NMT#SL(+@$3(V>gGmmrO~APA{Q6kn%h1uPpXyvV|^#n6q<-H`B!
zs>_!<TFYhZl&(N}1p7jP>7l@{@FF3N$$>-^qVckBkA@ITgOL6vIuJ^`=Ntk_s&=Nj
zCE^J#(__v9R={z%ga3O^LrxCmePb&~a7Wv&OufU28O%!2HG3DQe9#7kwtNJ(C1KTE
z2;buAG<RVHhd~wJH}l&1f=Vn-6H$}-9Z9#rDlLitjiI-wzPOtL-n{gnWCS2P8!YHv
z6or8o*wiHWJ{C<EX|qyZ3^WA+%F<vvAN|K^M{Dqc0&kAR&j0Csn&D$DJ$-t=tu?4P
zEM`^wtI%2uh_v-XmrYGLB0xycZ~BrAA#bTxI&7WIle~YNQQdD^rqG;j)68VGGvx!Q
zDRzHaRZ5D&>~v~0K>bnReR9CaEtv(Q72f-x<he}7N7`5-UKoQ`CD?qhJq1FJX&N9$
z97{gzIHOGilW&1SmM3t-8=Z)aw7G%^Vv^o}h`DCTA3Uk6Pmpy4JjYcTt?SNhn3Ddc
zxonsFQO0S|L7RDZ7)YKHz-Y7^D3(|2eQ^Y}8(>hZb$<-;|0)NyI|Zu2*K-vB)M<K}
z<ASTgb5L_WCZmlSkc(@f1}hPE=0)*h$M8*C+80&NfH`73OY6gh)5sXf2%n6oH)&AU
zZa29Cn+7x<-Mep#?jDDNgrvX0L1UlHWQG<f1KiO+f%qWoAU@zY;7j|PnnQ5I`=2*Z
z1(?q@pbA_-J?_FeS7g9K%xke*aGb$CKJOg=*mXud;2^T0?v2~^<V)FM*(CWLex&No
zgAe>Be;uKz;zcUVmIQ1$4AtWW_yB2p1BDrXo}&QmOANUJ?=l4pePGiXI@_H+(0t+o
zO?}X~VhHa|QhtRKFakPd2e<lDc~ly-XX0Ag;W=P%Mgkf#^2p22MKmGCEkpsLtxC)o
zU{=9~q2^<7)5>HCG&2mojUoVNHm8xrF!Ey|eS9z07X3=s;?2b!-sMg%_qm7gc=CO3
zJb5u3yWAN=-=Yb|h|qL1?!rwTc$&GjH_iB3#C^eZH#pJ7_B3455u$m8w@1Wr^!I>z
zI~isRJ~#u9e5W+8m$CkS*L(Rw##`MJM~>fQpjOn7xz(?t=ObjE4Ji#56`St>4DBI}
zJE;-gDIC$_I4biFvU2|bB9>zK=W_)tTIz4W&>@+JefR*>ZKH=-vLDR6<1YsGfg*1<
z5e>EbLs@Z_5}-DB`)NSF0iaeR;93pN(J1G<4nd>0{HKe;pxO-Q)jj}e!NHGEwFb{F
zd}svb6Pc`oYrnJE2$^T$I#YRYSQT!9V93MutvXlZeuFWJD{%{|A=A>AvGstKu)ZGe
z<&!Hw4guv}29<!qFmQqo{R$2_KKM_Dl3&48AF)7o+=fW1l6vuD>_Ut`)%Oy-L~f+L
zc*IaoLxVy1tpX*U=5~2zm3gS%AZ3i7!Wy>>)fbtpYlO@YWq*%EM?T9C*cYRgISI;(
zoTqvtnV}eyjgVj=Y97m!Re}c^eiKCGiyM6B)WNz(psS$2+-FG(Jg*UwL16?7OW*N&
zPh&oji9-uhRlk8sgu~#->l?qXB?6(t_T3~{H7>(%pP;z$(^yD#_ZXGng+VXKzsSrQ
zXgR<>NEzabBf+m|ZWjdldCq_|#b(=kVSnBmt@aRr$e_*UMGor(kU(FlILe5=+9kEM
zTjF&r*cU@JVq1@&y$gvHG&YGJBZf3=%QtZcr&8v&VpwHqNaElric1(wQN}<^_+x;U
zJiZ6iqs@VC3Na4p0j+!N^&1C_knrdR)?CDi2eh<=S!F}n2bMoLFjLWYSZF{XplJMK
zMjNoOfI!U{gdI>0Sa!H5!ThECKYW4ui6np#5{R(M<BY>3CQT0!{(68R#@B(NMIz$B
zc1l=2LVGXI;{B->ND5{%G`O`<Xv=qr8=Sx@@(@xJO4rp0{&iQ=+;N#K$c9d45b3_^
zkMCWm<#-L9sR(;dbKc~l>EjTA&UDNdI+5Qm5YVJ=6kLH0br|GUFyhDVS1SdABc(7@
zy#c5@vEZa86AJW#9h{NSG_&}YLpIM-uu1nOI4K&R&IE@z98|9Ncv6dg2E~_w10Hp5
zmm5$HAvgyaH;v>ghyXoIfRN@sOaH^e@PJjWZ=usZ2s+hrdk-iGU~m+Q!u)=KgDmbi
z$z=y{kTq%%1J17QV<{4$K);P}rcN`u-NLYUQIG2>@XnLt`(@l6u%#;9mLyUx4cT(z
zw@QdfZ0uFU>cs)kW;lE66%@!!6SVU8FQ9*ZSN#U60#Fth+T6^X>}ep>`N93N?gAI`
zSU*Il-at|V2wjtImIQ8dm%fvcbIYyVfB66$yD`Xl#=nAQh99uA%4x{=OS=IJU|3k0
zm<4I#WH#h^xjF$xxiEu>Oprr~caKj?HZG&jVFFdK>)jj|z?~~LgWQ>J+pKaVF9nKY
z%Ma%OSC{uDArW{%u}P}#R|AF3sk<I1Bfjt(+|tbXdwv_)cWQF2_sMKvHIsA*U9b%`
z+Tv!*jZMGZ$Olcy%JiJX-nQ0F4fl3upPQBFrky&<=iDUxFzg}axyZ0-ll#aUk&gst
zm-VVla<!8xLo1RSd09R4ECmh2HHDS0e6elRmtv2WWKR<*t0L;R;g#(RMf~($`gZK>
zXUC^P*GsRRVm;QF5~Ka7&l2DHOgx+BXtdOj|E=~fWGpu#eP#tqTnV}!%&6^Z>|Bqe
zc=b_>KIx(ZE22xIEQl1ihh<A7Mu$yj^=UvX1U++a3mWo$RRAoS8}!+YVj$DQcKW4W
ze9fy4>|mJ(eFiS6_ykD$xX*Df>2v8}|6AX!%G1>I%CC9}hL!#DU;3sIGUvsW-R<62
zLMNO;yR;6zS*g!)?>xuf><4EbV|UpHsMQHWV*`~&>z`A;Tyb1_I^reRg>KS!UmBd9
z&Dn7|aceL-yWh~1YkcZNReQg9CxEj#r58?r*Fa^I-@NgLP1DrCl&h=52!i}?*)$*J
z3C1!{i9*iHKY;TwQ)bt|w6Whg5)_HAubuKUTD=f)d!lkP?-Fu`&7{TLPABWHcl6sQ
z{o-`P!P$a_z?_3KuL1L$mUQ*SHP+jT<u`NR;cND__i7w%o$)Asva#m#{SI+bX<q4t
zmX2~%#!J;Fp}(!UG_$za1Q{I8O_Tn3e<4YI<yM*bq(P>9hF@|MO<rtk5+cCy7Vj;p
z4wDTxg^bM~F+DdlCr|K}^6ASV*WNx6>DXdA2Oc{HPiiaV-+H;VdyPW#EFL>n&dMa$
zPLFpd^9j0^{jIG|R%N(wTaMU<^W<iUCLkO?`Nu!uo5LP@0T8N#qcJk6bdAwuSxT+t
zBUNHi0z+VRE&_4yK99bR-{-*_7Cv-7dJOc`w3=D@^7by`MRG~|b_bEiEMEm;_(i50
z@N8`EcRIwtSOCUWCF6sFpO=~iVuTqyt&g55;nPnQg7KMsY%UCA@qNrH0%OU2JSY;m
zj>Z2KCc_ZqAjm;P@6$?JmaJ22ZPDcMO&?~IzWTlD+n{*wKF*i-auJuLST%o@K=|PU
z&8hOW)(5|y*QZA&Z5(qTdQI^`iM*gWdh8x};uwFHjg0S(pw-iGdVlhpN57e9UwqxN
zr0ntCs*T~4-BCT0S?S2@>p>`hRW6z;iF;{B=#_0LO5ZG=;K~-{V3y_kSZKQQBo!o&
z1!Nwi#oP1??&@eW&sM3QLfre*s!`%XzZ*aCwIMw+q4W;F;A(1c+21GCZuG0>SqX#}
zu1V*uy(F$_|1ZFJ){cwOWZ17PKo=~yA;?!AEhes$7A6nzf%w_8Jf3J(ev(oi%s)H1
zH1F|RLEJU{99}@U5GV5%L11d)4GRTF)(y%5r1)RLEx9Y-s)M?3EVETa+*n}wJ0YmL
zL}qsF`|VzdXZ47`o?e+gh?lWbvQC_OBjboo`I&Fk_qu&k7aBFT&Z5AvEcjopei~kn
zc{g@TT)uHA{XRM<_2}+yuw8Et;^vUbl5n_ZQnD43mt5R0Pw{y#lZW?7ldOAWZw{$1
zoe1|#1twLU>~(~=2wQi6&7E~}0dJwNEY78@3Y(UHnT*Hl#YM`S$BUy+(r%HzSiSyu
ztsm=UvKC7ki0=C1^!V}s*4>0J4nmEeZw|S{-!i!zM<U7bzM`?Ca>V5+Yj=k2UBG1X
z=AgS|F>Cir2rY&(_Y6`vg?kD=0=#OTeY$iTztQ@t7Ox5V8`8ntOHwJ^Q=DnU7k#ce
z`%}Q}%ogh(mw5j&b&pG*E39TIXYHP{z5B%ahlSx-_uIvjonM^6KapXqj9Zb42EW0i
zev+P`>1bgIm7w}ZJI1;DAw9){Cyd5F-cI)>&s1_>U{3n_c6t&TZrLJ&Y0+2Hjnx`;
ziQebxv68=6s4k3-&JaX@%aUS5%bzd-77MiAa{vN-uCcKp*BMox{Ip_}kShajtZ2PF
z#>(zund(;nk)glkOL<eg7%B0*MQ(H^%I0IeqY2Oa%gk%J!tW=IS*y`Ti&z;M^z@l1
zU&wUsWuf~m@-ES8ib&9#TxGTxn`E5kkgB*=B1*p5zRC<zGt`&xM21=SX0D$D32F%%
zlLYC})|EVUm!}w~)!dw#ZAQ<LKOB5Oycu2(o`9_g245^1xme2`7Y`oZm~K|Sg9Vp?
zq=BQa&NA54og|#@*O|33;+d};{GtLn)~CMs{cfb{PB}kFczw>mglsA6inHJg$&h<^
zWkV3mzY-?6e4YAj9se|=wSeG7K12=Ehs#!Uo?32Z)}{`olV3SbiAKn%_L2=`KMETn
z|09e;ewxz2)0U1=h3%wMSU~oZupMMPF3PDdvhxdhzAP<8b=2X-X9IL<-sem^H$AGg
zYJxKM%lhXJp;M<2=m0WJ>l6OrI$Z;pvjO!B=?(hHlEe9qRlY2!=OVbkDmR_}gS4|+
z!=GIfE6i&sq&pa*o<$$q5twbveKcS~{ZX_aJCS%P8VsS2?u8xoA+xeQfApo|r{SG}
zd=$m#GR5coYoQvwH;b+q6>_H5TAO-CiITpZ^Lx>9F0?~Z@I~}7uLhG~5$!}rk{nl)
zmB3K<4f1-19N1c5W@*hACG_{FVHMhK18uY^FdKS?*fRBW54HAi@w9(fnkfBfAa=TW
zKNPREtKUC(lwSME)k^lNh_?$gz`sC7H92%{waF+I{SZX6>pIiGJ^M<n@TW}m9ur>c
z*Yc?2#6Nj(Jd0^Rsrq~5CyowSWylaQ=Co-6lxBU-BsZEAkdAQG_7vL^$05c@fX;47
z0JOUhg8}aq4kBf%OV!mfmb(wGE^8Ij(22$#t1te8PAi@$;Jm!Z@cRiM5jK58lr-fW
zb{fmvFvXJ8HpmjyF=6rpS*Q(PEKXBqt%me{GksikJ@;%O=Vd;4{}@3EUh8>glqY<d
z5zXJN_@dsgd^Q+|LIK}8sQ{NA5gpuxRZk+4wN5RvOvhb2u-2=g((0WY?nME4W<%XS
z{N}tI55Ek+JHFTyS;)JWi15>tN6TTWJw?@HbEH(jd*xE`<j^1IunzyxpjibR{|f}t
zmgDm5u<tPLNp;}Ot7i5~yD`Vfx(Kwg6|9;#mBV8d=eLQ+maCkG{S%A8TV+JKl-q=K
ztTJH9s205ZcM;8TRy<Lgt6wj#gB>D-xi#-5ifRv@!y0eyV~t)%@~W;qZyKvqh4A0Z
zs22g?ZAi!v$5YSk^nmkqKiHF{8>cCaR>N;;Y{h;i@YcW~1ySHR9NOjimGgA~Me`Ip
zz;&n%&n{NfKo2H$=jcgOnl0+BWTeX`b6kg_6`=9t?j!p3)0Rlo262?Fh8rUAE9dQX
zF$^#os@>HvX@ii7Uqf#6kzsBp*jDKX5V))1M_HxV+Byu5Oeyfef4{k0iuK<b3M#pk
zMU96&(sS(eZvt-tt*%%r;aP_!`5ngUm<B^O(oYQzHz8CvMU|X?vfjib5j{8-b2N45
zPM!=Nd5&clGb%=r$ZZ4v`Lwzyz3~;~@5RO=+Cg>j(&<djo_A>surtk<FnMOw_JGfi
zOi?4XyH&+SX!Bh!i?!2QU8AEG=DpuAGsCTZiBQg84HgttJ9E`N#!yQ0-Y(cAPiElB
z&4`%EhGI(MVn&5|-fUWNouJ53w91b@@_y>_Ybff_KA-L@$ig65SE=ozxV13{tqiMM
zVT0gtFbudFA$20>q;B@_204{8+zSoeyd%xDF1iq|hJO8CpN*{`^oIrZSD*B!nPNjV
zd?e`rj6_+JrYEg<W*506+ggKBCi$5miN!sUgL1OONzke<p<UxDF6n6@+PinMWn_{`
zUyS~P%*on8bk$8?%RJhr*g;g{v(`p%)X8NkDAJ?i$HrK$w$}4G(6tmQ2o(}Q#oABg
zI*aDYn3<5iec7avo|b75a=z<Zy#eU}?0Y7>{^|4$Yo6H>E(Ra3Xj7t){LC;wDZ<=*
zo#Lw<v@)5rV<ceOaGm1Y6yj5PZG%=a(Y!%Ui|ajYOVPs3lhuJy(7WS2`FrD*vy0pI
z;Aaa6Y^>{U;}@5X+|{S~HL^XH_e+v4N94<lLRh>g@jScExpx^-0oE36r&2?uy>((g
z%X#x@TPCX~2{|?7AFuina(miEG*<9RZ|F;7tQgf$o@>Z`+rIkGp+8<W*`25^D<q<A
zE)BcX+Yw>@t6p~IhZUD;MKS4S1=mBLh1Pu72;~{yOKX(l23XX{b#0+<Z3I_!a~5>m
zUa&}a2t>+k*O{-uBt!rw&a^<Q!U;O<2G;5vC{Jbwl@|ABdI{?;I1g~XQ0in&TVVzf
zR?A@rgxR1_=}_KiZABbqd6*+^E&C31!Uw*4Pd-4}I<O8-uhi(?sGm6U;G@UUKZ;Hb
zL;Be7R72mUh<W4eLLtfn1}noD5J~PeL^;4Oe~0D!6fru0bY_{Y+Eu432%_xfGRpm>
zesk4uTQaMIihTHr6sZS9B5;qyNvDSNgMlyg3abcjkFbI5ahVc%Pk~T5P1)?#BJdwn
zdqbu57Yv`AumC6D5DWW>M&beaEjmV{Mgl(T*47v*FW<ih(CXai>$+SSB9ol?Sve4R
z)_-alKXW>Hg!@aMPlWkK-#VbI+I6O$clOi)vlVTHW~`>7tfkC0d&YG)@Oz#ib&u~R
z4!+s_^t+MYjFc?-;jx%AIKlBNR4e>5>ksP>zo_<;zV-KcD5jBR3Pjg8E1HU)lb3zG
z6rj@XDc(zZ%_~p}rxF=5Kqbz|D(>m8E*sF0<TUm@>CTPD8(V&K00P1J(z@Mbl%7Tf
z)E9X3S`W{}zL1k;2l5JHX*C2M%#<7|e*n?}xt-l|%g0HKCy<!Al>?!m#3HyRLC{bw
zBu(`C#OFMm0D&#=MfI(t_LtK2%5GDEUq~_BJ-1BbKqN^6N{i#E5|Kw5yAS4OJ{%=5
zAzZNkd;Z(Vz=*OZw+Vx)S0U%?U$fQjKyl#8TXGndAA(MOm@6J$Ls9|tVbdhwQqHDw
z-fnGW$q}j4g^H#EJ8A+7RR^m5uBFM<hg4O-8`6ns^#y^ytB~^*P>b}~NQdrz4j+`3
zb(P-6SM?+?(SBEW&?;OXq<}44hxG_9z+=eYtkrA2tj0p@*21$ZoVO{5{Di_|1wqmz
zkYr(K#)Gk$X5?#_GoUb1vo;6GntAU8yvzl1><&BSy?e}oR}y;c#PO!TlLYvd^STC6
zXcOT=4ny8C)b?o2$TG23b19IRP_%iFw+K|UOPxgN>GL>y*oP26QxXIb<T+3DfQlS&
zes$29Vf9ASO8DBFn1%#FmM>ue;@FM%em^c-UreIFiOK>bIL$vt70i1tBMTL)*GR)o
znMx!h-oin3PT>fg0P?c{i->KXm7pLJ@`MxzxH2L>cVcF!<{`zom_&%~XcIi_3>4=-
z=VXK*%%Cw-l;<;%hc!Fwx(FEjp#tSZSdtnEp65E{Q@p-B+?$RUi*X}Mj*q3nr<x5-
zGsUjf%dW{<YbG7F(C$rCabd6am?OPXs#Q$uWgk00Ja4Yv8)pZ)5+~SmeA%*?=QDwT
zb#GbIT*&Q~sdrYINu<UN#ijq?(WDMbxAIAY6-n-#-Md1jye6bev*s$o8?&jX4Kyd{
zQMG%I!SF93c^=d(xALRD*-w0663qgm0qNUkO)5{)Xm8hHrjxB?tZ&m*O_q6}s2KIx
zP8NjvcxgY$SHzbNc#i=i2G5r=j}60Zrlu*DPhS3EiK1<-QwA&c967Fx1MA0)8{}kj
zbh@4dgAb=ukD7^gkdId(7ej!THdyX$*a)8DlDNx31ik?n7(6%guB7eN(X-G)$jIXF
z<nhIVDuo+;K3QZ?KhJCZmab~rej?V?3U2mgvzv?*Wn<(BlZ+Zk;)}0Dn6H#AH5JvB
zf|_=zp;jN8|0J!^0=7aGBi>-ewMm=ZL;&jj`+QLOJJ1y2ICmK;Md_*eK~U3aHgOy(
z0em^r!_X+u9RS9LFRfRhP{jMKzTGKQS6eGSm@16fPHHuH9fsP6q00eC8`WX&RV!_@
z3k@C6n4ryAw)8b`LlTS$1(vn{!COnv&nf8AHHf<9*ehG@ehge17vSO{cQX=<C{qbu
z!BK_+k%Jw~e1>=MAC!%ODsNRJbTz_olMt`99(-~BgSZQc*xy1ad|m&8xGgZi`z4Zc
z+t^Ivy1dOd7rZ}KF;?^C^vf6EX)cn<T9XgO8`x2)1&7%_0`;-p50&5X-qecIlowpq
zh4j?v)ditqj37SP`oeDzW<(xR2jELX550WeRN!p^oIx1|uNQkYbdfQFv|0@iCE|G~
zCHH60&l*ISZxhceD$n&wJY_@&PwIx!g1fih7mu^Y5>;L#h@{;O8z!b~F0D(gt>5&_
zuR=?0H*lItRFa<cey4q|hdReniu*H>q&3lePu?%)pUa4F+rAOrFC*JBUFOKtz)_4K
z%U~!|wPns@$9o+jtZ{b1(g7iB3aGPGLsYo6n!W3ChhW=8Y>Ll9ATE(fL!e^J;FplK
z_frgjMm>$!K?t+*IK(RGFsru1tfUXIQvBao0Z|6OK1Kb$E^*8FhV-ULQZ$|N9p;gI
zhFYl;PE9XatC8AI%KbG;or;BLf#RSRD5V1$cmTyW#TAF3s0x{H{uU4dT49YO!si`D
zGk-WG?I)ggfR?q9XgD;6s!CdxIBf^?w-SGmKw|zG6+?l<q=M!*s7{}aWs7F#FD3<Q
zc0qT0E%*up5j)DmD_Vh4(-R`G2rZlhE%dbzPwP3POKa;lHykK}GN?gaI7<Oya|4R8
z++&>=4UzF!{}(dE$9m#G1_;7ztU#U4iw^n=zWd1n+FDVk?1ya4-*zIiX#?71QAchS
z9NBqaR@}>qTA7n;oU#-(3=grlUUX~fdcDM&6I8FuM&u$WD2<&S@bMBQ?;5odERcf0
z>UGBa_w^>dqnH=26MfClvXbJ5$imt*dv<h&3~N-_xp4CU*)|sd#LdT+*EZatkj!vM
z%Ji_8BhbQg+PimwvmD||B($_gY8!!`c3Tj1a;B`>@Uj?N7J;&q6|ca2aEpm3_xPwB
z<n!?$pW_GlTxLDMr|1S+QMGjh+&x1F3rHV-nYAg>&3^L^f8x>KcFHj)!F4?fuB#a|
zi1>6sb4eq?S!++9*cAJTOJEQIKhOt;nnq~Eah2J|PXaQ)ThMYCTB!*C;hTfJ4cTbT
zFZNb|S!7|zlZm`=T+M{k5lk_}^H=Re`At=EQ_P9#+s+~9o5dO~_Fe-^M`~sy7!w46
zpag&s2N(k=h=8tjOg$u;Z#Nh}dm%@J(eYi_BT<T>jGPvGXl^k+47<1KuQ!N$ho_%@
z!YLC_Zvy_U8W?)g;Mh~kgdspQU(-~;!PjcZL2wcQYiAYV9m=5~F#J3q)FZ)n^z}o(
zh90<*_QB(Rdgp#I$)}z0T{1z<Bp^7i;VQ(WXJuLnPM7>NV_yU=q`M<<MoUoIsfNzh
z;(Z2b!0FOZ2v8X4u!*k%obZguOW_K=Ckg>o$$jI53y`0BKR2BG%v4{2>Lji*x&u{c
z7OR&EAetA3Leqj+NrFIPaK-RGD24}E{RdrP9{)K*!pC0C2MVd6DKF@DN96YuXXOLE
zR|8bLaoUzX2m~i&4Qsf~0?u{1Jzhhke>ko~Uz%b$L;a!naa@z^4EWMi^@qkI-;dYz
zkfG}{Pz!;eey{kw3#$<=^<YOOmMw+AvOqMp+}s+_WYpRUHRS~|r@u5@XZvR+D=U6W
zS=G|FUJp*AjMTzRdk;YnY-u#_Pva4=<J@R+D$wuxd*?SVwA}><S;e4rR*>uZx-fhI
zrHtCwLt_Nur0g2!W$FFi|4T!<Cq#l64g>~=JyJMKR90*nZa%&@q1+Hfyq&?kNZlVJ
zu3OK`U{BjmKpO(RKg0<fdbL4)fG!*1&hD9AYVa&IHNkn37gIdi;7Q?LweXO{r$^L6
zct!me=1-%#>?b}=5!2^itJeU+{t)zDp&e9$hK+aQ!5ATuGY#Gx>|lF@e4raKz~;BL
zKERnZdOeO;O_zC$E#o7)&VbXUvL*1o+ruSRG{0Un89hm3!7Yw2UOSkH8#Hx=8?%E_
z+jYvGf>OAt3bZm1B;T8Lc0j)o3~p|^(R_kNpZ^8Q9f$?yrpvJ}6l5i}6~X@TKTVyL
z)%k}Jyw<g#r|7G4heH1yQ9NnCCqovi15w~#ir-Ww<50G{Gh_JU*aqQDgT)Ed(kv@#
zBlI<>Gcye*sH)aAWU<SHnx0w<YYnSrz&yfsYlEV;NYPqmyQT%{a-up!`(1sUAgw>O
zf*ckc7)&m+2!fAC%EA<<B-POQoM9`CB+^<^SE?$X1xlH1B2CaQ3(x++q!7<nvWN4S
z5;49h9)RNDj~9a`Vy0mPS{K}54VHC>)xa^`q@j>+iW^}+Hxuwl_OUKMkgo35#@mBr
zz93$_Kfn#Zj>B*cM{YNG7&=}76VQ9(H{1`)YIbdgHHZkB6pzGm74rWa-(dI^c9jhk
zuyDeZ%%GIqZLvWCM&)$RL33nbGKrZ9S<8iH34)~t{cv;kYPG9ieBn)IFqXk?jL4sc
z{mgp<Z#Avd`_)ZJCdYkzPnxs)I~!RDDhIf734*jyh=D86Qohu{5U`e!p(2K|O2J!4
zYMaQQR7+HtyxxxmP)K*%pn$XXc5(I)&#xzdi3-2k+xiLQ+;)hOxf+<SNPmT$(I2^7
zbD|bd2VrLA0Hs;E(Pb7baC}f%Tn0Gx`7{7d`Pc4@E)SP^HYLt(HRdu6g8vl6QJj6r
zsZ@LS!4Ilu$kNw$e3;hHED&3Q=0Ho7mL8m%Dawk-Y*Pt>NLnUY$EzmoCscBFgY#s7
zhJ?V-(-oYAoxy1c7!H0Efs?T05#5Fg*n0dSfM6&oC}>hqlr19J^K}HXPM;4UIT4r@
z&RRcC%hB$72TO(&(3h{R22fE<tF<bapnl$=a{vdB9rE^sVHp%!1PBhCiQE|b>`B^X
zmqV<^9l;SCFC(mp+q2bfOyv2|$BY|VBFvY|mXsNB$Z%ns5j>Cx{jl8ETjBOY;8#_L
z@2ec)fsf$mXLC20?^5vQkCE_McelD522gyQLM*u<_7OO~St`&p$#I=yRqN`3j-T4r
z=(QUP(#F6-aF+Ay5jbHg^GZhw*LW#Fr(m9}*0i6znzDOZp;NHjXmH@veE`xHbiDo_
z-Vy_x4=rTb!GY5=nP_lS=NxYCJLeBh<L*yOHE1N4FOBb|8ix~$?D3d?6Y9Cq-TE+d
z+EE>3TJwWB@59^R9Ly=80x7($u{pVnPut}ldWjKA<P9bIo+PsH1pL?u1%HI~h!*Fh
zBK(x*t+4aVBc~AzeB1B2XJu6i|BM7cGZeTtk*W}Ko1v;DWDQal9?dX~-c+v3J`2z>
zQ>ks9DCvL!_B7QHRR5C%!EDD^t*D&{&vx*wii42J0>oNt%;SBpNDSQ)fz+`vPvZT%
zeT2*N5xxmh&#jfyWOSlh1RhwRBdAlTMB@2KXkgI{hPr{PP+kU*7ryBs4RZzxA7*=V
zpVXca>JGvU0+<5#^Q?`6Lt8M}A)57}?frv)KxaE3N?pg{mMzZRwiBsxs^NH&)twhn
z=B!ZZU)b3%?zX0&){n@8YCiG<l7dpf<j^UgDIvFk#t1mBlL8e1T?6qvq*rlv;EoQ_
z`~eK^1_8bY)~@fbMKqU=a7Wd@l{Ug@Oevh#MY{`JQblOa12W+)xhHk%NkHnzhromj
zIt(Zetc!=FZB^lr;sj{_Qy5rra+>B2=-?IXDkM1I(2H=F_Ib|?eN}+h@8O=mG>|TX
z=P}JsU9^!M3@VvdA0@qq&)S*$W=v7AD|Y1T=W)*4(Bb^MdVMz19g^V_sEIylNKd+s
zS;=gB%KyW$BPk0r2b{aZg{Z24a`{PvKvn_0s~Fj~){+=7qmXuov%w}7P`e2JPQF)w
zQ4Y9MpkAy%4u@<V1IPV$*Fjs|lm?Abt~h9PAfHvB$&Y^!qGJ>jKIr2GE1D;FGP`ln
z0cgTrA%|@(^YH%+`gekv_Z5&WdR_`gZV~gjZ#^bfw(=#op?u_xzEjuNiJeFzzVAmC
z^C%ZEh*A7gSOof-5gR_5W);j~Ptx!|m*hv23Ro||VBEy0G4xUKHW;qjTI;oU8}em%
zzl6?>BV80^iDkDDFQ$`4X)9g>?Ve?wT^1?GKl#(Qck0Pi1?;D?rB86Ev(}r9;e*~@
zLzUnkPA3=Bc=<Oyu%CDk1Cr7jHv|U2$g&XxE(oo`t#d2LzgDM7y7?Ew($>l%g0t0!
z5B`l`{j|r(7epbR2T@XYZFmd7IppF<&Ekv+&u754UjfUdh=k~XH}dSVP9jxRQyVqJ
z*7lJoZTB$r3-Zy7@I%d5S$FVd%5maHqOs<6wI3EtmSwSA8_dr-cJH2oW)uMy)Ug1H
z{fQ-nqUv5Py6_rqevy@cT;H64=9hX+(znh{D$D0yeYesrjVh*D?Zre+I^Gb1ha0Wr
z6GN}HyLuo!xljY-MZVfKEx!m-8<Ofn@ZJ*5^A3@J=6jn$UqYuw(~!cYu=`V6CLm-^
zO)9JBUVX-8B4R<s22ji$AhpTdA5;I-_R)xbg9~glVkW<s1hnP^jJm|25eo`ib1T0V
zja?=^Iit8`-5I4X2!74m>$&#5fz2nga}PhzBsU+uka1?G{jZ`HxRv7i1W-;>a06ok
zeAglm(iHp&9}(-c+K{z5gOzhx9mK6mKOn1Y_@JRBQYK)8!xY?>m>a{SK!u-*mHRVE
zN-^spV@)HcBqUbsQtF@!o09b&RxsLMnj9)E8>3htf)CO<41>UZK3moSOq0vO2327i
z$z@A_-*1SuPvPebU4dLDK$_1=IaH||!hlnm2W6Eh>>L8*pSB_f>0)e21UNkf$C;ty
zQrPP&c27HqDZx_%mwNqJQDtx_V$ewN&dTmD-K|{%?-p$i@c#x(I!Z6Bt_=77%JyNz
z3Rqdta7L~0K?isi7yb`tZyr!%`u>lXD5*4riWb?IC~K6;OhbdFY%Pd7wuYKeT4+Pt
z3=PFlMyJLY6N!$DrIFU5C^a+@rA3i)(xJ33-`90Nr#ihqzt8vc{eAwt=Dwf%zH9W{
z&vm_)>$K^7x?Sq*cm^mWj<EKpdR}l{vEzRYla-SXHqIj&0BR_A@!fyy(kCu757EYl
zK2oUBPBp6jvNT>Om^VE6=#55&G#MljfxDs}=-BS_^sk%;n!v)SkfKG^GxGEG?72a^
z6K2<53p+E@q!o&;;|0F6=G*mCvkDINo<rsI+|J?1Hk3TGqWA`DtV1M*tex(#4e3DV
zdJmM%V3v;XE2m<KPr<h2@5`}{;s*r%lCjHd%@;D8+_v_#`F9!Y9QyS(JG;^Paia~x
znw9;Bt67@|eyg@E=gmvH?^#rA9Aba%9szf2kfjCP%MQ=I$-YtIj}Lm^<Y#0Wvm5`s
z{2kY8Dp_Xw{%^w}&uU|ztGV%dms-f{i$2YAz}HUi*w4C33wbRAqK3uQN$f-`&)`G_
zXU%5&DAhIvpVn3Cwo*Hht>N~<d75R9f=$x=*3qp_!;^&zM#c3EnF;1ZMfu|DPda(r
zzmwvpZ<4O3bQyT=Rh~IMd{|Vhx+ur_yI;D8%u8B-$fx3}nd<?iZwu2Lm!FZcDoiZ6
zU^Y7?<PQ{|CayxJVIFGltyE+a6)`y@MetNdb&HwDsGZwa=<6vOR%be2`jwk?m7b}y
z#;o*;;CnPObQN#;nZX6YSMfbB8vDy10U2Ss@-YgVR?&LgZZw)Wa1^;f?<k$+^Skhp
zEoOyHdffIG%v^nxKKGsF_PvnyX?Zy(9k;0M&-p&_d`Kp?cpH3kcyj%Me-jZ%cc*PN
z{R-w!N7Q7`&zkJ*bh0+>dVq{`#9nEu#e>^Kjvwy@Ec@`->0QZiWM=v*A#W)9fy?Rg
zf_Od=K8@<X;YvhqHjj5m6<J(rEtle1sI8w>cjXf|x+>($xSrPxc&D82@^K&?Tl6TK
zyn?GX3ZT3<)vWC3PF6_>+RTRD<3^m5v9h>^Q21?rxS<vG`Q4jx8Dh`(54>nN1sHuj
zhtbnl0g7Ft#Spy#s*y*|3TCi{kdktxukM5#WA0X7hfL*XLH5zoQ%*JM3tLxv&;_tD
z!snAvV_Kjx{uHRT#L+Ge&OF%$+QoRK4by&Il5Ra=y+)h1P3AvG?OR_Q_<DibdID4K
zUCjxO<(vP?B@@CwC#d>+YV8|~3_<>n!g9(~-muhUiH8E0iipDwDt#GQ@gK1~#(VF;
z(FWWkyFByRV*A^VAYsb59ArJytrGaj6>ck++ibLL7cv!GerDWYkt6p5p_Yep{0Lsb
zwxH7jK=wFtHBFrYHiNV07Q@p4W?1-o9Xo~|9Rr1BJML6{;T@J;t&01!=Nro&xd3$t
z9%LQWLb|s9x~9En+vZ_z`i?bH6U+uH|J<!tZcA_VxSYpJjP!5=tVR{M(96>jRd(z~
z?{S;rAihoY&KQ0qu8&K{M=#{<TIP!CWo^^pK)j4qJU0!P>xb}{0=jDO7No1j)W66V
zZ>03g1vBY}(@xuMLYLOR2XMIrwp7_ZcEY6<{b=Bz9}RjPrP@C3KRFc64gKUAMkSw>
zYq*H(<m3(z8t51qK6H%j8+a;ba7L{ZI^#EIaK_uC2h5cW13lV@msQz*p4T+-->~oT
zjiR>b)WpAi8`7eTwhWT4ma_eE^}cFt-&vGGP?m82@+Yd*iIWqrees>_=GnfBN_U&1
zXQa`Kn{lq@czXd6_wFI={o%>V41ATd|3DBqBY%Cc?oEp*J<-3~n=>)i6@S2>z-hEN
zzv9SWvJIi@Ua6;!L81eIoTBMjH-PvMi0^G0UAMjUu0-@u&^K{5Wk^(AlgyAPGh-Q&
zkHjv>u1uGGScPn7{1=1g2rh;W$!jTB8xeELCP^WxI{&4k&@`GA<``EkY*cH!Z~t#X
z*!ec&)0}ktp5iaCi_t*&%n4~$#bd;R@+EdAvi&Rs)LsX$5+viOpnIr+^)d^F(e*!Y
zcoz<RqY<em_CnTlm)<XZG=vYEQCn}TXga(`Q>lBZ#q*nN)QE8SQN@-H&$r>7=V{_e
zp#68ELXo><m@5(z)hL@`_)6Vs{`LK#d^a@b3yGd$KmFi?TX1zaGXFPe5W8$w6n*U0
zH+88Ee}BV0!IlS_)E@uhXFAWFYKkus6RVAGoLK%gGYk!G%-YBTz2M7+BlDDfJW#b+
z+`NW(SdF~TPv|K%U>NH)rM2P$;;E*y_yI01EK`$JCowD^qdXJksvGWMxaP2KL1>XJ
zTR6IV2&h<5+PB!V`B(7hp>x`|*gk)aA`+QtSVU&@Bd410rV$y<-|jsv)3lb3&?#Vx
zTwu(!7-b(5sxfH*Cc$8ORa3#b{`f)xh>>>=j}Q6Man+0ByZhSr2(_jjo;=Auz0+H1
zsPaUfk8{L(ry6P89(buP&-DCmV7NQtz12$@TueYQ@`CPdtZvWnDZQfq?2}CNG5L-^
zb3O;Q*b~bDgPOD40Aborvp^DHVYe&dy<9``7FL&&zssJx#!7Y*dDq!vL4|uz!2?$<
z)>|STjNzNKDmRR91bdb$W+*^L2)>!_mdh3K!s*lf-rDLj+9@^eLuTWfxy+(?>N3~1
z44)6?6-SUCOc8z)u?eVz(O`^@*qOQVXz8cGmQJHC)bU*)zymNSOmS&MMOIVqu+&2t
z`^jJ3j|c!Zuo3^bFXvbrd!Hy+K_TG~TG8?TW}fZoW8aUwRcK0}MG?cyx0N%jpkn>!
zaY==8&lWMP002i<h_LDKg8dBO07$Nt63RE>mcF{4!tBN=D7$ECOmc~vVEehkcq@go
zEHW);xLGTgO^g|wd-5XQuWKW&9299?9|?G445+r;pyd&ici6V~FV``MJb5;c${~H>
z9zs$&UgJ;%U@T#W^4k~R&T#!YfE`i%yZ8Z(2xH#h@h8eImvf51{>i<hUIoNdUuY#~
z@T99}+YrNWvtdTc<L7=YT3V~usfDWtwJ>(|_=~R|N+G7X6&B>LLRzyv8);38WJv6*
z+{C&QhuLKV;3z*o(xFJ35}6nekihtSy|j2!%0`xS;3t$ArR?g(;$^NVPO@tZsY~<X
zqopVk(rrW8iHm0cXp|!*Is=Av%_Gi9obsMzNcU;EzjXjzdTa32BJb{*+7;ieh@CFf
zsnJ@E^|qhs*3$rK?3AF~$Kfm3pC86eG;hdtlO{l?MiW+#S4w{r?;R8nYX4T)iGtmQ
zy5b7^s22x9`eR4EgqPvD(R?c4t=AkU3^x8gX9p-~s7b~jSD(#K<z}a_bif6G&N#QT
z^b>+_c0FTD@%Lu4-SLa=0zGZvBGsLq$E`l+iQ+Q)qqCq&uh&#aC^Rt2j@ugIphV9l
z>!S`5Z<N&_D|w>6J#5$!R#85ZE$hRxlGrlc(C<d0VlwheMu97K)C*f!J=dw`Vxe*v
z60duL68vmdFS%z;Tk-FuWTDjGaPZ2W^L=;su_4nleU?g{mcBOf{Og=?mZ&Leiwj^E
zdoov`YM8}UycU8+K$Spct{ztW%^Bo6{gWef$3^4Dw2F9d;;oA68Dfjf`A6+rGVTJe
z`3ZESk<D7mu60ywMhS0uk}hZ+89oDs-x3|DZ?fl3q6%f!%1qp_uvL%ezl6m{@lpo$
z!ASI6*9}YUYgY~1zM*1~pJ@yu58cNb{p60o*u!azXe6GUHYiQ<;ZypLC)`#pyI2s!
z&RE8tthH!;zNu5c?<V>bdMf~wjEF%)SF58`JNtNxYKjLB#UPE8ZIM~PaS{~nnpD57
z(CpYpFpCF|;C}Dy5E=rELi7S}IeeN=W*`S@PQ%3*4`AxFo4z@Z`w*ZM0qQ{#A-+Mr
zmx%w;NBt_$E4qq9eQvRB4rrd)u3m9P!H6B<w#FHtESsYy3^BIu4*9@lHfBD<VTr}S
z<pT<va0b_B;+*4c@KuEQ;OJ5cLPvVfhzzWzmko^O+4IoSD1Hx!=;IWiIc!cEJt=GH
z1Nc-J7@eHlIwVD9OsJFj(^?0@*=O=<3Fol-ol99xt0s2|m+b4yW=ab3RX~Zj5b8Xg
z7fWL)&pat7Ij!#<fidS`dMq#K{-+7IWBIE5ZUWJOos=9a#fxBnyDEpBEZI`se53I<
z{O@Py?U|60Q%_h*0GI9D=Ma%6bfaej7T?7HlKS~vQgWJMDK}AAA}mE{7jX<rkE3MZ
zi1uXRjR~qaR1EQx`%szBL2T|6iyMu$y<ke`Xi8B6JmMQ$Sc4e6b6qYf%=WbG&})8d
zrmI-2e#m;T>d)b0Oolu=MXzt6ZzG6gbj7&O<{5RJc+vLuaywjMl@n_2LX@$y2Do@Z
zej!*~jC%DOYROJDZOacc&4n((^PVvc(>X;3pAo=nt_*@u<cNWM$4WNpGn#vJJtIVw
z?qQD-5354F(P(y#CEj>V5<TqAETX0=$Hbd*^steHgZ72x7`;CmC2XsggunM4O0I#>
z`NTKoQ9;BOlYsJxTh$w?bb7U$!af=Nw-BE3ti3UpdLDc-oSPx_Y0T1AUWW3<@&i5E
z$+f{PPgvrSIYsyRM1y-G6I>(XH`qi4ZSdB%En*2yK@Bcd-INno>R1ZnREAq6v*S*@
zKfU=6<P%6#>1S_kO6krL(>=VAJ1hC-t_LgqF#Kgw0+1d16Qxa=fMd86W})Op$hzJ~
zoFjC`WG{G9K#4>q*WzQTI2f)w(<Rf**sV~Z;R2Tot%wS4sfuq`$L(c~T#1gc&$^4<
zIP^l>S=l8%)tV$-fo1uBj`p2uO;TrYfIOv(M*xmBE$#Mw8E}1+^xv6>=S$6$pZ#4|
z;I87kT9lV?2?fFpC+y#3bkMgrz?=Cl&%icjY=z+M4@DJC>M6=={N{G*QnFE~e-%V!
z1|b2C5sZ6K(KWK@p@>UcLgsj<eZ4?EW(X-?4Df+5IsP1vQZUrVz!3XwZAh$m=tZ)&
z#Ml3PVM0Iq`8$23bCSH`KX_ioZl`;>1-KRR@|Ue|Qxj98Q8!HfVTQI0E4z&qhRiWi
zUGrw!A*vdh2fo5T`w8*BihJAHO$0B=zwuY}XYDeWNPjLoDtAd>Bo$#E=Ciufx526y
zT!}56@!gdE%wC@@MFa@rYMWR-$bDcAtK<b=Rdc&ikPjxHJ=8{TGp`K{N13?-(?>ZI
zL<F#U`DU)YkAlIM_(<nAJu0`Hf%bKa+z6d{QM*SUe_;+G+KUOE5jGj9;n~Pal+64*
zXB%}X(d_SA^XS<facLQsj!WMvOsqOhOXpe!1g>GH(s1h#+P}A;N9~K*nDf;jHZ(o7
z)WqodTIgDE+z)Ktm66Lm6h-%gt)X(c(P+>|J@_r4qzNVghHIszXUN#c)g50QNH__~
zRz(2#djTN2ZNL%`<1zH^-hF@*XRyi-@PA|EZ5%u_2l#*7Y%mPOcnmQNn(5he_D1&L
z0jq%q#5EKJB|BAFHZh&H1i^qY9u`sQNrZa`(J9ZAH}v|ao2HjE(9orqhnq%%(LguN
zz)(ynAie`G9@F=X;y@P<V>P&9Q_=AoxZiN26*sE5rG>rBP%_g|l=<hhNsvQk_p#Ay
zikAPlU9DoeobGT-f4cy)s>e~2bLHppjP=|=9?&-4c1Cw<UeJLp)pg)JE`OlAVSaO{
z{I~-VSCq@TrmNrBzL+;DFD4}ic;Ru&fGph&mTK}hPO2sYAbe80hnAYivuT`QtDRzG
z*rmix*QKTJUMMWrUv)-id7Np&{bjCxP3*sj(zY+&HbwZ;vC<!pJs9)x7q1`B3asp_
zE$tWhPu$WtdydMpstI0O3-6exyxqKYN*)DWN~cF)V(3hjg|AsyG?Jc+(AP>aFge{F
z0#G3FK%|;{RfbR1y4pQM`6i<OGHi?QxMaTFs4RUj5Zrz?@A>KboY1$gm8%BHn(2NW
zev@CTJ*+|d$|I6BRvIMA8Woz3Dl<)-p_j79sXe4TWkOiyDCK0;{O`XD8=7`tnOg8;
z@0@#kUCqo!_%|NaAGYaZxKCwi$b+MzbGAWi)FuzHIbHJ4B8=@8%<D3%w_jrCDx2S=
z<nXn1@vsY?v$b>$Waj$4Sn)C;(?;#4`$xxQ_3+wU%cnM@Z)IM>-^I!2`37fGg_FLw
z<;@IxnVb@z;+gueX~)!EaYIklt}}|XJuRNll{oBzK%EZu_>hHz=gG48-m@s?V1DgA
z3<Ia^9X7$R5goPD%<K=no{)CipodMD`BpgX7iYWw4E5;B?CC3Ct`r{n)R0zuS6+GV
zm(Ef)6Rs_q6HKq8*Xz}B8=mEvy~4XwXdgXe+t4_@c`oY>*sCk<ky>VLuHv{W;|O}l
zjYEMXxG++EVa!hABiWlkxS<!FnkQ(h4cQfyZ~kGp6K>iaA&>VMSY*}tR)5(007AN*
z#Tu{ll{VE(^a`Da($3thx5AKJ#qK6<UW>TRx_?13c%zXWrE6~1YR%hpmXt--cseal
ze|`2WIt=umbAk%><|!8KQ(*ARx*gaoSJBL)G}9Hg{-?{(t8o9pK9fL{H|yTKXv?gP
zR1c}U6Wo71?uq#c+;O}3-ML_BQx1uScRkvxI`qbv4N+e6rSqY{VIy_F%S`v!Gqg(Z
zPC0p8^PI2a(thTx*PN;rx+5UxmEeSqVb?{)3w5HsPw7kI_x6LWuPXmC2zrCx>*4je
zS+=3?%f2{+U!2_9;LzCN&+qBzhT;R{_m#?tTyX!DwwtM5&kCQXwV`vv;;W<zQQT8r
z@kXv;MV$5{LCu2TeZ{xoPTg8nc_oXTqe$D$!1q9F?cP`8G8gH#n|%n`!z~t;m4u1K
z*<bMer)5psFkGLH^!n==+9>Q^R=lu%afTa`ng74>&+7vMTeL5{^#mY~;=?bY{JlN*
z$Bw$0udi@fMx&GWm9}~Jp_`epE!}~X9F2B3ty~sdXj`g3Y1NQZg48j|%FzTsy$;dY
zFe55xvvWj8dYgJ??Mzp-lNXPyC`Qem(j|v|S>d{)Ei$XQP+RTc+Vrg2fbva8OMOMx
zDw~|}AHa(`r<&YWu{o=@Kpzhm9P&a<KjUslVJr`uwH#8G49lfs!G#U<g4!bsm%Zzx
z1aM)M%Ze64(}IouVk_0}rFAC>KTR;uPPwvx8**jKynI7@tcU`NAlI<ljSgfy^42{T
z)}6zW!;S}`a=ZtS$?`#HFgEM^ldD`%s`6hx(`I#gN?4~_>kJf^G#gM{I$5!z_$AeZ
zjLNK|pszV4xW79BMf7*4QHGL_3A%b^*|k`H)t6M^Q&nk3ZRv*lzpQM=ic-)HGU4S}
z!Ltd^3-Z@cB@h_PKP+H{z^S~B3$(<AU#TePGxApCm}Gy?<6B5~={@q+Z5Ek`qZ2Fw
z*^7<!u-*1gr;6PaA!=t_`EG=xKF{iyy(t8dr0YZ>iUr5HU?U5zAxNtXSpK*erEaj2
zBW`J!BNezWv-QiRkECpCe?9WMqxu<^x8%JS{B~S^cGg0cwVbU*G-mj(iX}}GZu9wa
zOG8IP&8~hcQZ>0=xa3ehH@CT&4er&j`FBpnj^g1n-CpG9%iI}m`|q60xyWI1Jw3IS
zj?Fs?2xBgElaY9oh0E<iHgj`JWp6-(eukGgI@tvUL#@CKYqE#t3jSns)1CEa)~Qv_
zMTYYaL>qt4k6NT%X&ti5Q_B!c-!V#4ViNbN|MB9$J1}ZDmN>rl56%U%%nZrUKZdd@
z4Yqd_3xz31?UMq`-qRtltL99%huun7=STHisscT(L<*#J;grSSyzK6=GuWp;zDCM&
z%>31<hg9W_zRx-BrZj5-mtw>$tX`QM@@zMk=-gvtS6^|en2wj>GvAEeXcfo_Oq3hW
zLAbrqA@HJ~d{xr{?{cxoZa>kGLt7qm;<i-<NMt^Wpdn%M@Y;JwwzSHOtHnxt=nGdA
zyP93&G~OJoIO}exy;ynAxX~}e#maj|QQkAo&6;WJL1=~=-nsu-Xp5>UyTk&#c<xZW
z%D+0IBr5|@cr&)0K}G0z_4xNzl>l;wFdHMg-&AVcrqvmzP-RQ(8a0JCyv)?!nz0nN
zw5&t1%Nvw{qJHK<%f6h)bwpDDN^^vumc<|e5Q{+$hnnJ|9a@^OrH{4n3dDpfVq(IG
zg}ic*82XlC63;}o)bW!$4$)G#9k@~OGY5|14FGzCE!)Q&Rbq}FVNXza`Wi4)<$bVk
zZ>WeAh}aXoF@{TU4qNs!q2TP2sWH9Py7yVC-}!eq_RMXi`v0ilr7)ly87qgspu2aL
zK2oZX{cUFSs8%0T%2XiGH8M4^L&=efYKCE!<uBSkW>|(E=pD3*ScRe_tH)XF9r>0N
zp&p*8|MV(ATSg`S`=aeDRy-SgPS7P0N>MozLe%_xRkrvP<c9;pSCSz_uAcr~@vkZy
zzyx4hb+)sF5OqYZ1o<8S7zDAXyn!g~RP#KMl31$RF&XQ+>ZA^2lVW8m&LyOzme#`W
z3L4}O;>l9kwLO$C{)p=3tv{3Q&Af|-76;eL4cab!N?vj2pRJz9!#8CYe8D%V_zlQ|
zp0Fs~r&AG`^=yJdGEJ0{*&w|sA*j51QKzL<{YarU!5t3i5)lZk&YK~GkJaIn=B<N#
zopX%+LrBpGs+pYVg3j$O#SBhDpCY(Qk?~bp25>*L{ptrzfVT`vIlyB>_3W*kBCw^Q
zm$#WDKG<)pTS>t`WlRLGYO{)l#7Ei3v!<~x`ZW2_#D8yUCf2~uPH<I9u6G*BH2G;F
z((9V785)#+Cbj+FS1{5r(APOU=<V`Fiqpb^ezFQJ{j^|kTu(ZCTi+U<{Kom6eelOK
zC-hZ3_vg%VFpC@g$98$qj?8OpXgE-gk$FL<SumRmKnB1=t`vj?JqBI)jq^~;p2J*t
z-psXa?2*C%NGAb+oLKBZYwm4V#_i@f$z`^tTkdoG7&7aUCaKAv!?X3h&*lYvuL(<p
z)x>wkj+!jEiHlF#b&9Yqyd*W`AYGA=qkx#;V0I5o=oKJ(8NzenJbq`i-X>E`2uJ<W
zYh}9U^>PCrnoQl71cGgZ^be7985aNW&+WC2lU*L`y1mcn__;73<BaZtu;_04?Gc-l
z%OY3|JAkXuV;Xy#TlNgul(b(k^49TbZkOd6av-`~aRwLzWRnQPH1$vF;vKqqP4!yk
zGIgu;Z<6+l_GfzH?<Uaet)d#6`hiW&8_i8MW>e2PVd|fPk#93PD%WjZkRr1)+JQHj
zgk*8?<>4p@Jor4~Oku26ina;Rmg**@dCj(va#nPS0E$eC+Y_}ffGIAmtJfCfM-&=_
ztv3f6V~c%nxED)LEP4W+=kW=V2R(=5Odk71Zkaem+dQKlDBKsK#em|u>BD?iG&=~5
zMz+cb#~nI7Wb~hh5|ucb6kJOHdAOI4BgljPHs4%spPOE*K)3|4vkt_kD&n=4{A{{K
zW;8!Cj-z9}UkvtdetzycM!3rV9K#?E)R%5FQhkZoSvDmT4N&q#HHxvbuGSNVp@o9d
zYFN)?#z=$=h}jauanaals>CR?G0}WID~?chnXUjM2l3n_OCDZpzBnSic^|qDWhjhz
z>H#Ynj5a6Og-T$caL8XtGyiY`W<2}G58Y~K73AmKQXcj3M>XB?e$rvfSEoPGE@fn9
zlp)RuY7SOEg@}#F%X7dxxMn`v&y$=4)@Uk#XkZkugl;7wO;2&jOnp8v(!_{kT+1_I
zejME-^uEg=Qd`yKgWw(EZ3uk^02c3f+)4D(mL&+vU%V2)4@>;0H4&@u&Bi@DMd)Yj
zR(r#py$p4WN#)M%gE!}qZ;O+)lAB&E{{LJFx7+)OT)ONCo&iS}_h?K!3lm!cDv9ow
zy^bz0x#ghyYM+1Wn&qe#n11$1qiHI<5JvnsQ#V7(Ry}#qUZ5FieYAtQONd6S7iXy6
z&8lp~SYRaRK8W9W0K_lc(#zv!oM;~#Vk~e31wz_I-EQ%FLQEB?nm0+9AVE+dq|$#;
z5x>$o19Sy(bczH)y^*y)=O9CB{|bC;Nb)3J4cPUr#IA4-7)Xowugr&0sI@Q$gQU(%
z&JJPd-|1(hWFnzlPT88c{r;x(6uXaV1p#)d%@8mKdgatAoY`JmQ67ACju^90(0%wc
zBU03)V<6Y?YoVTC(ki)tp?Z)=l89x{s-*cKDvbpnw{KK0vxGnt;1cO4bu|;j5Jtx$
zTIVmpdjd+XlitM;dotuh_#6@!S(CrSicWql?a`R|7K>8ROOGr_5aI-qp;+xH9-V^I
zQVmQ&x9ACKV9u_j;baH&*pC_*lV93{Wc7qQ0s$jwsj!<FAv5QTL7S3>_pGW*o8z>1
z+s@;I7EXM*jCjvC1@$^!sr;%}D2Yw7ql#Ef$>K7ySvhojjHhvR{%v<5>SN>=)9#(a
z-_y&NP8L8NgsF_L4a=H@M`j;<p+qGX7o28BgAjciVpA0FCgP;l4xnMzYcSr{H-a(E
zY^6njQzm9?EC#b12Ux-#poFcOk3t>|eGE4$&);_q(28{G#^TQ`ibRB>qlk@h$j@MR
zp51`cD1us^+Dk2en<=H79B{i)d!pA~yjz2$1e3EX7JW#&-jT85o4d0ew=6#(n0DA|
ztF7jOKMcF%ALyul7Dm@K^$6mRk1^uS9G-m1sYYX{qP6BM&&;w#)xX8?-4oJR7d_cJ
z)g_zF-6j{praEZ2ttrS~Z0UHZ?wzPAh|lIW9vEb1ZGMai@Z%0Tho!5%A2X8|!!NYD
z>6|iXTgq+n0EqUFPkdmc{~-1L$|$FrrgcTJIv(v0)XFE@#F;+CGTkeTifYHvI()(C
zP<vcomV-l{eG(r?E5-d<`s#;I#Rsb3yUT^FJcF~-ft1S@TRC3ZUaKE1P+?ELmRCHj
zJIe+NO}cKDqg;aP<`3cao`<P2!^(5Dq)vO!Sh}(L5A75r^ot5o7!Ru!xfM~1Z@A(e
zUEy~SLP_A&jVZVB`71IpMyiE3_JLGj8Vwcv2?kvi_vj6t1Z~U0+XKQ|w+4jGuE5d7
zEUm>L{gwbm7jwGYSayK>3nnha+QPM>k%DUl)-oo0A8^OQ)yIxy$Ig+uggb|N1ArHa
zxn9iiWgY!U903g1*;|_d;WLRaO@zL_w|G+M>$_&|FHJq!hNm?K<;d+#`t|TL?S;IW
z1J!>hmzgsr^{{h-jwNn|a$=x`QO8cOn}m_j7=w-7B!@2$&;t7&c9Zy3OoQhIQX}pS
zue}KN7?e1PA4NKIm@aE<Q~*^F@c?Ac2?`o>zK!Ld!0#gdIC!&k42e-XhEomjp5wsE
zzb$T&7zL4*&v&pYB3d>r#lGj)eJ0YjIS_k%GqinPe~-Qy)_AzEbjH}4(Y-+$psT!Z
z-+&_611h=_CGOVRbr~yMd+xWZD5!<YR^<AxaRHn|utvXDvrXWmMCwv8o?;?|$Cz8M
z)l8JK&vOZx=i99Ou_R38NLwI?B{gPU{-EffKoqWSh(5C}$0*`v0c}}(IXr5L&Q)%J
z08*(rGy*0xaAwm5t6H`rD@XDKKy<d(X!S3f;ahw!L_%q*-3)KGewAwIJs-SY`;RN6
zS8*T#D?|*7EzrWt7R0aseH_Ul>p2UbQZo%6`iobrjOgmT4MNYiONWhL%1JCqPJcwT
zGFJlSNRfxk1uR*P!CDb2lE6Hq^fs$O<oIH-4P-5I@CpaSK>kyVUi&N<^<t<>hH#(;
z-k@-<N`R7ugqvHKaPt}7+Sw>PmVf?8a!X(lqKq_sJ-nIwWt%`*aGX9BCqgF1BzT=e
z{3TEh>9W7{u}z?t(2e5;u&LY1i8+khh7Gyk!sDcxANGj4Co`w|BVRl_>E|rGi`+)h
zGo<aJ)Q+#e3aBi=^*7j=mwloX`~n|9{qp*J|Eswaas&h18dpmOhHuPad&8X#Z+x4!
z2qX4m;pW73^trV^#9bw83g;Wm4o^E&=5VLblZ@dY|18sl4M7nEi#df7|LXh<qvje~
z<ffpC&7+HYkVTw>$G{!_>dN5<deJ3DZaQ|e*fR8g4ylc*&A`K{rM%Da1CIj3l%V<S
z;sHcflRxss(8CUERkL691PJF2y|m4D>D1vnq);4MHm1zkA}|9?tJ8uc9n}rqi67Mz
zLBmQ2(u6`JxMggKqhR|k-eilDM=XOCwb{(G`nziW3A7F|4V=?FInS~u!gIKB@k7yk
zwF|DiDHbmmH#zPJ(GHxG50>!?2r-T&@KufcGSrB5ED<{*{eS`zdm1ISsVmxOYNq_m
zj$o9yKuPw>@i8`;$CZ+EULLrb?I>VwW;fZ~o8mzeobP7iMs5(>wmrN2$>49;0K82N
zDym&&RBj0N#=o^H4-%mJKjoR~0so38@R2;wok6%dh)f~8c?(wiKJQX}e`4_1^n5Ab
z4WhuO(6>bM;mXBc?<VvHkLKf*9V_M)qx#b!LGBt%@3eu#1#1S(ZWtJrU&#3u@=z|D
zp|yK27H5Y{LqC>8v702GsaSfinP=__;tY!o9t22_3<Wos5R4`+Ln)Eqc1^+c_aDPP
z#|O;zIWZvY(CVd;HBPJ!`$<jeE45oc%f#Y)-f6VGP<nmkg)dAX+ZP6{F>+Xbn)x$A
z_5J`@Q-28h>?OY5g-6WG5ida_-oN>gYu+%IOmfQ-6fLfvVY;i20Bcece#M@B(kIU<
zhm<kc3yuK_VhV8JisBf&r7KCu$t3`Nvl&A<RWih}yaU2!kf|d0%SaF6MBQrETez=$
zqyQKGhw#IIojRiX!-t~RP192#dr1p!;k;C&vILPQZ7x^!Xup4YR9evv*YVV&rmY%~
zH_E@w+O3%UGO&fQuqWd!51C7Sh7S{Ko^&)x$PT|^><x4aha4$Xp6I>D^7D&IEj%gx
zpjIWtATD0hL=N=lBVD|~4UaE>(DYXZv0!jV*3hzZ>pl;6kQswN|8D&wUdjVDS<t@;
znNMb*^eVaO1Bp%ZLSMP(yy`z7nM5j=Da0wmKvL9`wO@mcCKU#xe{)8vr1t%yn((`F
z4Ljm`4#Bz0U!5E#mCJH1d&rGaH_PH!&pJQ(1*gUhJu*J%P0|R9Z?!FIVvD<vo(Uf>
z)#I&hrJZsC{3Fy{ybV&Ch#~xvV+bb;z_2LDpF`z;=@@%8Hnx*t2D62Q6G1JGVjN_5
zp7{wPB+n)ea;d@<7O^EgCf!lBxk!sVfpZEfW~G(^&#v^xH2eI(@Uldh7d*?@4N3VB
zMs5!No&_Et9S;?~&HR-nUSCDEK6hTMR<emvwiXrJq7;k{63f_!4qCCLxZ_;}_{e{9
zwB~>`Q&{axgt1Ke8PEEnC-|yA5i@G(p&5>IzsykVseIml_sUqr^$>{PcclW;m%L#S
z7WB^sF>Yo*ap0};CQ}yK<NB3teMhbZ1^N57aF?+syR|82*#-t3+p_9sMh8<U;iw2=
zaf|9L<Uzfx1=7CUj$}-QzTw*gLsNxh&{J@c>w^vUKJ(F6u5Vr}o~?-D=!j>*UAoma
zG5o46fyW@|FSwu(7+eZaw=qRl)mp9+CNsr9{D#YC)@7?EVcPZBFVlVhJoMA?IfpcR
zGFIBXpv%FwLlLk0ncR(Ix+_sOFeAPSQu>i)ah5mdrYJ4Xnu&|UJJzr$Uo=PUd*e)D
zQ(REX<#pB}cQd~00E=u=iWMKif_Z9Jx8VNCGzzufUU{#$RzY^v8LXNSLSg$tHQf!@
zP@#iha!lD3y2#$hDo=JP2|uQr^8B4_;N)Dmkv(E_A2{jTCE4>P3nARZ;Gqo1hi;In
z$T$3R`O`eQVGOx__Q!WBUM`#(ma4_`XdhX2e%%|VZ}=v>rY?5)zVIM>R)cQSwQ(oN
zS)Vk7<Dac_9JvQh2UbTEil;9f{5nJVfOnfu@V9o?%v{?uIl+iJw2F!S;aRY9gT00)
z*D8qRB|+cXZ4NDM3g*-&z%7JuPU#;dzE%CDb|%Io<%({~9`hmwA3XC%8E#D3?F)4b
z)p(!6IANaay9fbsDq?fpbG~)(rke^pa}c>S-3nF9h~dnHn|=}@F2PwT183__Uli|8
zsaYUc=p%R5cee7nxDWj~_|SjZ_A#rS1eZt>0EygetP1VY3#5|CgfFFn(xb*a)12D#
z_Xnqp1>Z@1-d$^6Yuajzuk8O~Ghzu6H-z^6_9y!M3ATQouF?JwMUH{h<A6ayO~1OF
zGg1kK6WyU+n-#EUdmT%d8A@q%JR~!0B`|S~3<g@X^y=23P9|o++x1-_mcyatIu!8a
znAx|KzI-8AeSPLHlZ0La27M$%?VA2X{d#;kRkK?IX~d9I`omI9iF3`vzn7Vd_iYCr
zdS=FNhh_H52->eqdwpPr2QD5+p`u}QV_@asVaL>;?!4_aZ!dosUM>-(YBodsX@~pa
zMe>0eUabpAHM$6VuoxX%W3h`1d=hslCfA8wTZ&=-JJ#&lLGf>stPyd4#q>JOJg7az
zpI6;1_LgzcSA7eD7a~7LXjOakEVAc>md5ana93P_BiOLcU(8$!@-=ajtbqrZQfEwm
zsGt#-SQXtLkLw)XdDhIe=l56p+LhIi7}`g@4KE4wiv4Bp?zTZa)D~yx*71XH?Y~vf
z{3KwTcFN$HI@gC-ET5mJ{VemiHqnOv!YB5A!5GgjBL0rSH~y{)TZN8Jipnaf-sQ{_
zO+*dNo2bW{dBHy+8|bT{A*?iK{9*?b@rS?7e9%O5xoVtDVQs^8wh&dnP-C+P3Brwt
z%lq4hpqA%2%cUa%l|5lSw+&l(n*%GrDctp^iS+$HU-X2s0e8{yc{m-OQe;C;Fr2}X
z#l8b}DAr(u;tgiISki-BIk1!3lfor`@U?#z{-o0Ekl^>_q)AKCjVD}KGMtQsO|qaW
zLSEA?jbDhqN^=TG48)XHwmW$d9>pLUYo%=aHZ=Ln9!SYkD91{G9nLDbnLH9hdS@TO
z??)-+v;e#cOr(qpAcrg%4HcR`ti)(he1|<o-o<!s9<Qo-0(^AHteAeYK|hg4nD_ux
zyVQsu!@k3Nr~ksgk#iLsIesdDH#io<n1#YWGM2IIAZfyF2q*1um6$8c<e@0@=!Ux#
zMIkjF(|Ljkw;^&4-GiIw0+SLt@Z;xprZwOV>#BQ{_eJqjcYlkM-Q!B4mu{S7G$ij~
zPUztP(2~jgSm;}~{z^!pqpvr65;u*rw|dx~doV)YS+g$AaDlJlgWKA08~Rrmy=*qB
z2f<m;J_3t@fbX|xzC)`MEyP@Bra_}^34a$#XObqUzJcx<dVHEo=3@WunRXoH=XVw7
zgMjFd_&jbbulEQ`JRnDb|MK!`TyVQQV+<LHBR^5Zd}QJ*t(j`_htC7UuA#ZLH4uVc
z@Q3wx5Zl&nW5lsFY%;TbhUd)If1#<2<&L<?ruxW@MoI%iDd!1Tx%boO9&P8TZbNt1
zNPjJ>FjlSW@cTmydTG|uhEATnw;`S-35YibkpKjtij0;RB6-hA?!|)}21Xt%SNRA_
z8od8+lu<2C7=5Bt$gmcMruZBm5axc2IQNR(Lzj*tzw+>{-r2&Cc}|Wm5uy~=rlFnu
zLVQFuDgxeH!g&M;YapH(UIt`|o<;47f$g8TV_X3LQDW}24RAW{@o88E+adigU_123
zG-uaD5UjWTZg*tR+Z}&z6ZJsrKERe<!W<t~v;2M=dSmCDBCZ(#G><EaH~0JKBNeHs
z?CLcICj0^HhW}kiU<I)%zU{Z@-#Nexf7gJB&cxjPIe<jM8ecJBZ~GDeGrQ+@Zb0gR
ztj*gyU@`mvHX|Cxi3d@gwtsm1)6bA>yk6NNExqf|m9GVh>a?$MG>~S|TqGv)TvSw;
zwF^(G*yCsObB}+ORRVpdES(lrx82%h4y_Am@)TZfi2Y6F20aZ~1tLCJEUb?A^A4!o
zLC;!bKII0ZxxuihL&ze-GL4qH6P<c3H`M;~j@3-=sM0wd_L8=K>OYgyefHo01sF<R
zNmYCV&wPAMSnrjLVvnSmRPS_<eba=SWKQ~*<Wl@1^2^fU7eMm~dKg+N%pIS}!z!l)
z06aS8{_uv@SW#SM=GwgDi`u;pfcY(gb`U*k&uzcwNrbGEUygT>ZdAz(>(t8&f=O4Q
z_WT-H*Uw4c+g^TfKR%fNV=MiEzn)1hvoH!6+duF!%%0>oZNirtFm<uc@Yxd`13#q<
z=7R-Q-{-pUO{w4sjH9J8f`SPypGIUUXgT~0tIs5!UxXwCN{%xu7>djVBK4UBl&}7s
zn})+6u*Zn3nq^N3)c=IIGvQ)bQ2j*?ai>psXbOGa_ivZ+O)>P7XA;3#kfkj~-g3}%
zOB9ESd*|}bn_W9Vm@sUt2hSO5aoNYXP`7QW=TqZfCr|Q`xde;v%pQ?tF@AG=!6~!Z
z9b><m?1I9frJ7sL4hJ)Dm0S32OckD^kwGI_5C(gNL>+zJmE*7?HoeK_xwWg(Q!DN2
z;jTbE4~A?4jbo%u?7;9eEprlC*A>$G*ZruYdL>b3ahC!K@eO%<6qD`zl=jIf`sJR0
zKl0Wbv?%>ywEiSmkI0*`v5!h>Cv_(ZgZ#GTEb9@a{&+|Sd>>2rQ&9AfqIB)WT~(ni
z*>Q%(DKZZZ5`=D=Vrnw_;GIDa4AU}KMroI6$JXIr#+``qLwSxX6>eL6u8u9<W!fww
zZ+Pe+@8h(NyuAyely5WO{(0O%rzqLR#Vope6z29mk7~y)hpZ|~{t9!#pZ8nFH;`F?
zsYjmkF(02hPTF9Dss)+mw}kBmApjjnplyd~{=DzF2(|$5vUfsmgmvnhP*sS9^Sx*L
zkstrUX_2GH{Zbwdhnd&O1HvPlh#hdxH@;2jMXkb=d{p@kh_10+@oWU30V6-<GHcqY
z5NQtE*qCh<hs7jL^(X3RlX7A38^;bQ4tv7E-m3`0-^<}yL$a>UMw6#<#mc3rgJey0
zJJsH2rS$a6N?auM9rK=}+O@&kR4g2MOQ1@hQpD*K-s@w^dgUw0<o)t;F&G0c+Zbb@
z828jocdg{wn~fxeDY_0R%n58nR%9rRB?#p2YWL5E6F{>cFbZeFC_rSuPB$B&I^kdk
zQk}d!04)ruF`+QTsf@63b{}HlTm!+18uo>%5Q3F@umre`09jxot=^3Q*bg|Cd67;h
z!z_kw{ladYui<r=inh&((D+iiaqg#W6(~CXdDI@{;$Ay^PePt0#Nsph^&ybe@2mj}
zj#RIZfH1j;GCDVqxhN~U<>mk1L%{9@Vh>C-T=9|+sk2lDLi}DSO5lp9f#=AVJO{2i
zpyj=OnF1B~N4kl@^tv2TAms4=bgwXcgygmkefWqGtY!4#{!;f3sMMS2v=@3?nd@g<
ztXy8;U(AvZAqp1bFG_7SJ-F|OE}ypU(apgTe4m`FCPpxw-g_ReJq4p}{UNRzE6)!)
zx7&sGknIQKEigM_YyU82-*qP?3aW6bcta%%riPX_pK4aNm&YB@+LO7v1VWWSuNSp?
zB9HE&CAH6Q)r3PSnN;WiW#nM(kP{G<RBZNaR|tcPQY7z<#Gpfn1CpMMyTT?_HQZ_T
z#YkJUQ{H=zT%M#TxFeVeZHjkfGh~ra)<BKoCz?H-hc(@KNZ}Fi<tIYTsNlo)zl?`0
z1bQyzZaG~eQ_?_In<z_JPPIy6WKqDj{E8)c8be%`|Cy`p3o!>Ui|)&x!i}`WDoCse
zU&{Q@evlvoFnB+pQB<YlWzvgaJj;YJSexj0jiD~Q`md4}r6$YB6S>Dp$60_=_{t5%
zFuNr9;yJC7UB)36ciFsV2sFvlpHO&Z0(bD;f2g*pU<Q!&N`f62Dsk%!ZNY5Hl2AF@
zBpPtmB`LQhVrO0n+s21}FeFAmk+2f1(zdTa4!1F<i*BAT{?>;<zRz~O-+LZ>@c2Uh
zp(Xd1qx^i&cRKLKAMTmCWG&I2{wxcc1-65HR?dXmF?=(8Gh8*K@DzwzMxp4Wv&mz=
zAi6tq>akMrp3wK;7WHmX{EyjT6Cyv8BdHun3?NC3TQ>Xsi^X>a{lN%S<<s0YzyeKE
zAI)66fy^JZe|E!NIMs0_zWG%iu)*siFbLIr$(rgUc+8|pucHnuFu#wpVqf)H8V&UF
z^)&HA3h=OY+}qZ&jCJIGZ{j!OnMg%Ho8IFz`=+y+w7Upc$Py#lh}?soCU2UQuvQS+
z$be1(1JR=<Nsr3|uG^3O?H_)%^y(iyr9Ua35?C_{V`nr89Kp{e8RClr{$)(>7#PIK
zADzDDw2>CfE5D$13`ZbF0~0vfJ0-A3>1A_lUA>mc5Ss*YBlb*%b1`Y?XEskJ$BVu&
zpJ^c-qT`u?{pi2?6`6hFM;jDEpkD3OLUP{tT*%z-$><nTS6DX^g^W9u70Ttz(4YA$
zd&V$tEj7@Sq5ed#6f(zmdWHL&dF8Wrpt5pRCmCl_bH)#&-hIE58hKZY9+ab9F+*j>
z@t}!xY=3Xg6y$R<`2@UZgTF9j1mm8WBNXQ0Eyn>B8$8y-=@t&VS}EjQoN^{nU*4!M
z)ZH+as7Pe`(QhePh=(~NlT~Miof5$Lw?8D(6MAFynv;;>Bzj|&>-XXoP9pyUl4d0p
zU7yysk<ygwvz2l87>O8}ZOc>Wza?o;Q9+WvEKH3Edjsy+%m-y7V>WeL_HZ_lkO}@V
zzD0TuMA<*eE9Nj$(WlyB_?-B*SaaEIKaoFC$C6w?JFC#NDq;<6zz(23I#m#`bM!Ar
z<xxa|XYhYJ7i3@MGE(~E*@e7<X>PTFEksdc`#6nCZp!FDryMZJ*izFaht)0&c-Bi|
zGN^HZE${n|F)(~uX%6y7*TETvonvWRI<kY6hf${%7ex~xxgcNcM&OcZav|r9lP54^
zdsk{7cx$bR^{LxETa8DZR=gyT9q;?`$JY+6YQCToB`Cw^ugnB*5tGW9Fo#_1x1(k(
zq>1EQoCs>tXC8Fwet4<)F(*mCV$Cd)CjwSJjHf%NEb*g@=$~3uA{9l7K9T70%Qy!}
zun8@{E;)Kk1k?P!M-!9-X<-Js;}kv};U)02%H~`ikF%lApj(ZoxT*{leKU+&_R|*a
z0%+C&U*P>sPAdyT+3AQ!#=^LPA-cri>}+&!lqHg5vmA9;eUmD?c+bWLV1ZNHGc^`V
z8CpwOnd&_6g<eLMsxCYe0%?aiTouW-MNbheRD>D|3^P%^wV=8kOacb(Y_UU+F0chi
zesU;7!G{g$Gp`ptA^Nr4aIatnGk&~A^b3>RAXH+5y$;3EY=?Tz?xnt|yp269hGJTR
zAEPr^-_v;tf%I^82$CddJ-=5XDa&T=a5ik64*1KAsCXTGk3|dm&tvs+4H?YzROpfG
z`BISiY}O7^bzNK<ux*XW!jqHrhJ<-1+}|ct*$Mg_mA#HphI(6HWuZ2e$nJ^jY-a^+
z@2P$UF+R$0R0WGEq^cO4jAf|!H^n6tUAwrar*A+_X(sc=ze%Q!R78STu~y3SZaCDh
zLJ=%>baGB$%S(M2H)<+QcG(nh3@a^>4I~6#A5wfo7I2z;ib9rbL!#wrW&ox}_F!XE
z(g+fN*ED1sLE?oKT}435$w$BHZXgc#jQ&G-Wwv9OADay$V_4Xdkuebf$TC?gC2<Y6
zlVAtg===RtP|?%kj|O|&#vOxb=j#54q5QZm)w`CE?`s|UcEX)s|3pP(CN7^0pYF@)
zN%({^W6f9KShIM@8CdS0(m%}_e-xlK3!nmWzZY4*$XesbFUDIvu%+V47Ui@-@2i<R
zy_^FGX?R)kZ&Sm@vcSYT_A1T4jmzdgZShI|&nfMh=41oz!@!om$p#pk3T!39!6e=8
zT^e5g^d-CGfS{WM*zX@Or<keA&zJ!F6=_gzG*)M{lK?xRgS`BOrR;8fjmiG2Q1_tt
z<%>4L17*HMKdddOp*JGIK?#%B{Zd**{i=;jITp^1zX0hAnH94S=p99Ccq11AuHgDs
z0c*F&Y#t>Rkdr6=ieibmPf*9F=2C5DoWDL2vAq09z)uo6!2fH=j2&@RNH)xZTXBC1
zz$}yd=u$!T0|)y~6<jxsHT9}mPl7yVc}2gfY(QpQqQdf)6YJ_5te}ouO7E4+Y1Man
zwmN8xA0t~WZMSUim-3fI^PoY2^T}eP06%6>04)dILBh_@m&rGPJYjHEIMv{)xY5Xw
zopEE$LyNLr`x!?S&*j8~?t8(5(=IvJsDCcyXk-)P&xuCZMjEl?Ucj7c=or~?y@C^2
zqGx~XI|b3R`ybukTG!O}(}c+G6&*$FkZ6>q&aP39_QMZ1`ojmVFT|~iRFU0oiQLWD
zJ+gT!`rVGlCrj~DlUud*Y1fZg3^NCM{Oi|G6w`bHNb;={XVv;m5`DWa26d}K)2;mo
zXuYi+f_Wi8Yw276FvSy=K%h=Feg;n{SBi;L49oEE^TQWYiPZ`B?S0fv+Y`hyKmZK8
zc%KCuerU%%j0lrx=NMSJtmxk^0JaP~KohXWSnu~)$7zx57(xf&FE*SW<KPJjEeD3P
z2ZpZwA-x#SN}Oi~OPDA9aQKU;r^k&KzVB4ITOhA{{fJau(IxF6Y0zdsf{D+MIKn7w
zGH;Pb<Z&-TQ1Cg=aE>i>T3A4`w{Mj(&Ns??I*%a|*#`*~!kgMejELv~5y`M9_7<ZV
z4#;W(&kE)Y4A1Xg!&)Tv;5R?aA}-(ol%A|JBkp_g5j>9@Yo0+{3Wkz!&d^V|BOndP
z!i_CElbygQ+XT1rC|tC8C&=0jzc7@rz7yXaM9hOz%M;uU!*P{R*dx-u;JKG%vr>C6
z{_eSTN6-BkLuaWAhFp*y?i=-w*{7+AKRyx6@mEgnE@{iO><LM(^UnOPIO<@I=D8lv
zR6$`{WkY<`2)S{d?{o~VYnxr4c`aqi&MZsg>M70JriHwI<h*sE3z{cjXx}t8^p$e*
zk6mg<FW&j|OO(>xrtovcC(hp)WxGXrTU@}$lD6t~ZF7Qv4!>D2XY7MLHK(lJWPbs7
zu+z`~{!T58Z)I{?+pM@&#&(O!1zxA8N!xmVMP8h;{ef@8Lh$h4>)Q6zC>Z%wJaVoq
zE*6+!E3Xq?_wlex@#WCczx7Up_MPaXsC6}-%L@tCa#OK75y=LGPt9Ck2W)%y7|O_R
zV0t0Ac*FOkSH~V<n9`!2VS~r$uU>jY`o5{?gDANsqpr!|M&sA<zd-X`6C<CCm!-<(
z81+;m-w$U68hF`9?0&r0v$b>{Z*ka*0~3m3D&u<Rty}x}M&q)$*hd2Aa}Yq^X#9D7
zqtN$BZQNX4li6We@uqGL-p3)@ULSJ*P39tD?TJ#=m~B5;nx5v3z_3j~b*e~%38s&g
zKzaS4fB549o}r&?L-2Zc$jl<=>OKvAgDb2rd^9lBQazKUmZG}$F$Cidj|6tJA^Y~$
zTd@Eh@_hg4SzGCBfh{N3H&*!3YQpY2`opgToM25&GnXpLTsOEmUA>{l^j1jbP&c(2
zX~P%q#&;+?DLrYrt$EAjw*I(38pBKWKKtU^fD+z&AB7t{4=uNG`D1^p-DBi(byJj*
zPrjLJ)&{frUEhaZEuU-wRAY144Cf#I&@&3lnVV4tIq3aMNg?00CuRMht0GjY`X7h2
zto^<9en}PTPso)jgz_}f{Iqu2G4XmX#U{$hN_4s%p(9WtQ7Sx;^ZlZ}?Og2mp`{@=
zdbi69F|N_MU74UGv7FxW(+j>X>_6SHH9N3c?(m7Iu^2$vx^+GMFmzgVfAs|yMg<+7
zCaV?y-Kh?TJnP-dZ-v)LhkRvFy=_Yn(!1GEzrb^#Rv)Dsa;!fc2dDhXrqjdCk`&2x
z>n<QB(d_8dr#uF86m*5(tsw5%MQG50Y~=q(tTtV={vJ#VR)(Up*&-y=uKsp<Fn1}O
z1n(2_4>B-Kh=d{Ku91Kxs2R*-<@Y-d6?*+L7{zh4j&YA$!Af0mE8y5d#00MxG>Zuq
zPnaaUuI;8;nkyC8Fke3YLKZE^Cj8Vlp;S3p!Nky4D5~)ZK$hJ?Rx9J!bmC$(P{v?j
zsZCxhwwc!&zNfh5d2J6YRt!2Pz=?Dc{I83juK08<w#%UT;fDFgrL5DJ{`i~v*w#f|
z4fkThA^Bc}*AMWCMdK{l*LGFYo+y;wY_r&R`M&6GCBO`#646tMxl!8GvGIocV0?b7
zRaA#^ALHr_^DuRBrlIXfBIdyQ(UdLfi-}Q={%Yu}_+qge`W4T~=;D1u^I)f%Z}34s
zC%s5}%z4TK)|@BEqa}3NZdznLTcnFe%_D^xpJ^tZyUteG%~t6Yn45{k@7Yp%{>4{l
zk?UW94<`RMluI9~ntIe12ckfyMl=N7_wUlKcYZxL@7GZR(=EDL26^~l&kAgr3jg=a
z1OjRTk5UdYJ$M6Du2Wr1q2(89$PK%JA5{owhNSlqt9Uk=Dy8xzo9MZTX5#2P8@sFz
zwBtii{e=n7WB;7UX66N5#G2mbU-6a%WJb#0W%dAG)AN9Po)xSm@5wvoVXp$M{g%<m
z=puV=*bQKyQxw^}+oN`(V96JFuO}OU*%YN0$sfZ(l*`tv;+@gOL5^Kz5nJR#(6USL
zr1V-pgVs0V?fbg=T5Lu~=o<Ii*T*0I^1D^b=e3yi{B&>o5b2pd!xlwE$SmqfpUOK;
zKnpyDo+vadQB<3;VM?nZ&nU#cDbq-A5R@V4D`}~i{4Ut5Y$}u?`1lt-2tT&PyJoYr
z89vgDcwsuK_eA+VY^n{&OKB$1Rm_%Ie)WX@X?=x;L?Y=<aQwG>*i7I94zXy`=sRdR
zKT$wNQutgn_<OW|oj<Z71@tS&5vt{J1mHlM=2ZWtTDC$K@)P5fE71Z?v)LOf{cLr_
zXZSn(n2mS2wH1^s0EUWx(owxCO1)ykg@hB$OlgQ$(O*y2{yQuE+ScC<Ro54oWPWJs
z34*l+b-`845}b}7T=NGtRogKB(kbcIq+jK(mYci2%<v&W$_i$T-%)khM!7)AvW$sF
zy1nDAlugG)BQ?WkXHCSpCy|_CB)C_*eX4ghaR&8OjB(tU^Y|T;QLN7fVD2n2JQM<r
zW{FYqlN5_Bhof1Hm_<xfET?}blZX)VNhY#*z<E#h3Nx9K#WR1RLA@}AGgwB87oS_^
zt~;3_|F6{X<qE`>K<c0bxpbUKF){rHqnEALG)JFjiD6SwBxzajg<EX#l`sXs^4h`U
z6=eRBw&VYLWGXP3EhkESN$SWXp!B`}5pPK*1!2yV`0X$?K9r9{C-`qif$Fkf9;d&@
z-~BlOgpfDb%4lcosM35-D|v%>WfIuG0FuNB{b63snVCsE+j3BB3Sf@c1PN3Ip30vI
zFirNZ*OckkV^WCsKKw4N`c|S}`x3Vs<RK5_2*<dUXzuFCepTJ^<n9oS=12I3d6zx~
zz|aBy6vyy&=_vrsY85Op4~|Oig;j{abpuwwy)iH-&l3}Dxt=v3g5kQE=4Q?HhXHen
z66h?>7TTtW8i7I?*{gnJj*%UG&18}!C!-q+vNe`bi+jz$tSw=A#FczjVTD!Y6rS->
zdk?XYa=RVZm2R|L!z@<H1a9`~M$S)x=r}|jJLy=uZdDcc$Q>-nMP$nR>)M9u2N^z~
z5)UCi%7qCM;TUp1-ZLh7pQ!90(VNf!Y4EK-J(Kp`>Um)Kmz>>KbBE;R{*dj+`cy4i
zB(10EmL1xn!rD~r6UnA{<Y;P_S#eFT@I`;c>_e-_f5J-M$}ylPnTMAC;yld+;&H`j
z3%gphQC8Xkz4&XGl>mTuS9-G+t+Mb`oSEz61wSW3S3Z1s=IbZuz6`ZG?0Sy{MhJ##
zx;bBCV0n_7nx*LkkDRN?47tZLlXTAvPew~o)>BI(EU2>bo>H=xc=n<wdH5*bb62`5
z-sOo-Oa6jC*=bVF!s4GIGwz_iYb((8^W`dvCi2?eg?9uP^^DkwPQmvH2-&yA1QcWA
zS$1D#4#`u}nXl%JyX#5DH+B}rZn1hYi@FA_^VqLHa?E-24~;vdP-BcgE(>Ry>rFX+
zsfra%3fyGhgVlfZO;)+}8SDjFAGVN1@so)Le(FN9WyY_~7P#gP!8+W5vL+VAg)|g>
znH#zco%EOP#8l7>3%Yt95q?v8G&YgvTo-YUNDbU}#lws_J_P!8ja9P@xOQ>C<oBm0
z8iWw*V2~N?cvWt_$@!@g{sD(&h}<QZXzr@$VAe8BW3}e2POD;|?_`V!Pv?<dCY$gf
zqCU9uo7s*N)dr3CAj!$QZQn&^IO31id^qdPqGq^D-wr}<4IApzqGou41~d0Zxz;59
zUbpQBpxb}{6<n+TD&Jv6QT7*5tNhR~=8vrXMgfzpwb4Fi$V3vln0oZb`LirSYd!OI
zR9~>^w3=Hn1T<asOPoo}GEq0wZ(;RsX?&;eL1*3;^hN+5+xC(JHZ&*`7M=xd%ey@_
zKg?H4fZ5A%G?#f&o<E}hSgY3h8K)>NzqToAcwxQo3dXCc_EIS1{l(W?;c@Ve;_?rx
z?D(m!HLKQIE5~KzG@>oN8$|ommj1`qMFH^rC^{A_-688ZI%CM>-?LT}w}D>p@l-Qx
zJEE99K7;PPP`PL23A>v_1K=9o!?w|NrW-u$Ny9Gow9k$sw|rCm2r_kyVPpiZ#eFb2
zoV-~__W0Ur`K)dI787QrfB1Y^CKc*GU4Baz9*Qk=--vn#D?88?Oao2pL1aK3#{zVM
zbJR%ywF~IdzXl;fOpg$6^KCJDbE52l(#(Vn3vmfB9s|51>4+dc!=kiz)CRU9B7eX5
zHjMT#5#>)(xOglTKY5au!FBx!O6he$GpBX^O0BS%7*Y&jpkWoBT!Q{pI0Hyxbm0DQ
z3<^SU<Xr__1A{P7<3XdW+Ccgxu1SK*-Y;fCq=`4w{A!bPp|S@JxSbss9rIX=ffz7~
zaelNfU&srPTxcMkQ9&a6&tMdj@?U&JC|x;}MUj5=uD*~?>`B{_i2x_=XSK0D<v)jZ
z5Xe$=9i_3@36TLiYaG6M{3_(|v=H9R&DFm7#43JmCI*2{LXomsQ-MITvgjG6obBX7
zLjL}j;TUmE^b-T<zanX;&rg8NJdrc8MlwOLr3Tr7T1vAk41f%(k<@S+tr@29T69qW
zA#DFEkL`E%w&P+!N)97q;uS~gZ-#SmqcBBC1h4BER#_)DK)HC}1tWt6mWM1rq1{N2
zx$3)!zQ41Rnt|*9ITh^cTZPX*M^lfFNYv%A7#z>LkCsxYA0KeAMM-+=d#huQ?jxt`
zL4&6|`u~uft~^_r=~CwL&^x8u^Y||eMUdZQSlwQ-csGMMrntbReh=rcbx4l9Qa;~y
z4`Vhid_g;m@b}bw$87WQHE#_keu=Q?AD!prVm-^qQh9RC?;VwPjWZ=v{l4M6pl{(}
zQm=7{Kn;B1vmi?HI06P^sF0ujZTAX>aD>Vm8CJVGn4!5n1T2=tt=K`ifsW(Tt>Bfp
z9LM28xQKOA*EB_$FBLaUKhW;i46kqb-{l6EDy3VFo<7Uvs$z0ir6ytLNGWEyMCjZ$
zO__+_>KR=b-MF-8r~6|SVQ@W7=6{=sq(T_{O5Lp^%gAS{3(}7*b~|$Fl^cXBi;+{@
z6HGO84e)kKLuY$MQGM_|HnGJ3&_0xtt=nm44p_smRC4C|f_Wb5Ro$daPu|qG2`TLs
z9VciX>HQd4_9UQt?2+!)er)Dfv$?~<<C&-DVxDu+G-cgj(3gh#@VtWT+p~;r%78`{
zbWd<Jd{uyV+zb$%mKQ7dOsIaUU3S?3QMc&C8h3*u(}F+)6m3U~BhRx7MbYOEeY>=3
z>B}_H6y8*&<oIB(`WVOL?a2TLG67+HR(FFj@xm><sfv}xt?})O$%S$@=Mn`fAtEhb
zYrl}vTA3?X@kwUpt(+QfV)miwa8dI_p=FPmcT4z{joy()er&NxF2C#8-V|NCFgO<i
zl_|V=Y$tw%c<>?{yfIQYQWyPEbf(k3hEp@#9=aXQ;&+F7ns^H~WEp4FRiU}zKlyUX
zw|3jf+r-i-XlQfR#EiQ4YzS^%&+-HD7ufC(Eagvk<>dIAjlY6mWUFZqWvN|XYIbdR
z{gQXUEv&P}$DnaW3Zz~WCAHO4n2_@85n>_b$i2*vrFo$I@&BTRWEn)NSUP_IMJc@4
z`od>ShuJHKjPYX>W8^A(s3}X$J+Qb2INzfUixboywdC3^?&@VYz!={}yI1fi<~<J#
zjU^_twMw|HAX|r{ms8FE6n3SZ*Vb`zk<kbKb6zmg2`Kx%;K^zg@#eFKH_7><?=J+A
zU{*+Qtr(AMAT<j=fn@&><6f``ZIAU?>q-e47n;uW&1Ez$bSIVsUjE-h0radh0-iD>
z6A$K*@`_Ohpu~K0(-%OLJD6$`EQFX|`UC3@L-0^<9~VG>5WDowMZ3yWxdy;u;Z(#H
z=q)%^c(bRc*mbMawofwNM<ZmGK@(qbj|o1{Iy$Ijbl}Y5d_%rDctlFt5}=p={jg7t
z^>AnzsbLJ$Q%c0-4ZN^=hFk-jjdd9Vt9)Q+1p^b&7P@25j7qf`4dZDpl9lb=kU{=M
zW-Tq>;{}HbU$@#8KL|-WZh?M`r6McYv#IsCfbdSc&HGHxmH-F_?W<Gmnh7KyekHh$
zU=63LdaHw0x@QAxNN~blv4ytO>7RU~&9MVRwtn%~+OEyNZ11^$a2USrWl~N>C@XJ4
zgLDQ&i~?x!0%!u$SgaxO%D99eV}@YVk#GLt+NQg`fQFndzT7PAU?0!W7$DCs`YJZP
za*RWhVf-LJ)B2bp^1=P>z@cBjGOL1Xc}4x*6-rkY7trNtPCh5tW;3>VvG^~58^zoS
zfUv_jWgBE9w5X9eb?L<xo^${*hXHl!IxJWGSX+2VP!3(h9V>6dCijQpE?czaxV#{K
zq8JO2PK&Q9AacIq{qg%R{;`nEx$b2|hVPa0o;p!mOW2FAbQ#hvt24=EQ>bwVF8Mf}
z3w~KQ+<)Z)A!`mM4SK|NwEO}T6vLMxy8_vHywBpkVeIE6**)uT|118-UOuk0Gqa9O
z4#fXTcJeE|U=Mdx>rD|Q47QQ^1MQ_ILv!H?6{NqCD_k+OCJS#(xQzq3tCz0Vga+}a
z(aC7>88!FLWkVY~d7p%w`Xxr$=@slr;Y~Jmo~(g&HdA`srXI8q#B^6!MOmiJH`>FW
zk#@eOoj&i!+}Bs!R67Jtz5v<Z0yh;Zra$^>*vfAXe|`g!Fs#Aj>SA?pcldSSwI0Pk
zw(fI5IJ&N+HZq79U07oI)P)5(M^w-<M#riuWt=cQ`CLZ(>Km<RVRo0;5}&N;3-YVP
zZu-JA0PUyN@ADEn<O8Q)-^Hx>NAKDDn&9-fm&Pf>5>Df)p=S3*wUrKsZ#L5ry_GFJ
zd=?E$@W9oGUa`jp!1B`=QvgtUE-rS0_;KRicJ(+hok=1Di>)p|)Q$4VI0$d`U8ZVJ
zoQk|hb9L*MPg0lu-X{G~uTx_$Q!l1g!9+|%g)DTTB*zn6C7kjx8A8ZD)kr>*-S-VT
z6W2JyM{E<efwOag4T)*LEHXx7VUpcfz@)y{NQTs#U?NL|%|s9u`^u17(+ITX-d15j
zlmygsoiyPM$p}%nXC%ce{i7&GWpp$T(6;n#Oj;L}W@;J+>ln4>pX;Xdm_GY<@b0CC
zhgNO%{<SRu`gY>0J^%Do65j7tBGSK$jjQIPMDZMEBx0+rv3Wrw@KJGqYdHMW(Mk<e
zxr|S+d1C;73>l&Xz5zTTW+HE|36;wQ_`sORKAAcBemU0py<Fq}jOXzR3?*z@&I&e!
z_L-s(mq1wB9|IWmd?sm<67<UBKbF>W=rtx#0_T?RkjfbXoHv9DXR1+}FAM?jm4$Zn
zStK;Y9VB!8v~YO@{*vBbF~1=9jf`kVhO$-<Z!>;Id|9ApvBTb9$+&&F=QSMzv@qY-
zenbWp1$%U)acz2W;C0gwIYub{Q(_cXZ<4!G@)M_;9}87Am@B=OHYj5K55Fh8Whw`-
zq$wOj?~;0;ikz0k^a$GL`gz9S<29`AUFFHb6Q4g4No*DIiZoR^NBFi8^J_9oVC08q
zRMJ|J`0yn;i^5$ZkTq^(5|(7>S@59qJt$pdz1?|ePZG<2UdD7U3O;PlmyucQd|T*z
zDb4kw$Z)FA{=h3<dA-48C0tec+n4^ZK+4GWcf1ebf>{SMt5}#>(d!aSD(eF|uSgWG
zO&(pfO?z&JmNNdBG_lK6ZL-Zi5Pywc`y*lR0&}f^rvSNW6jo&3Ij`gzzFU-c(>KV2
zw?{d-qe8RG1H|HVbMnbY#L<6e3qf4gPN~uW(_mzRLdQXRY|#l^d^o`8Tx>zwLR@Cp
z0?zk$NqJ}r)h6-jKrO&J>~2HP%mfJF{fL%;ix9_q24-{Lvk3}5OR7Hvdcm>`6zI*x
zpd*)ObdbP9+%|00P!M>)KA52M0v2v$#+)@3iHU58$^){8H2OHn1sn;>VgqoBMV5I)
zKrWUy+ED#0&}$I#8E7UKnvY5TT)`)e3udk?_D#yUD%bEcWGq<bOrb*~(UZO7Nc6&{
zI}My}zoz;(t(0}}I+#qoxXeZ+Uy^GmRfLiStlRo&<gS%$l^zZ<nISK1f+}|M9TYNY
z70e#NRmR{$bx2_Fpb=Z=)KGemv>&Oy9R2t~I#Y%K%=kR+Bzz*TJ7l`G=LWXCL5r_%
zEX(y}%QII-$u(@uMGKp4RYMPbA=~_VShq`qG%9arN9oJhrZ4|)sLfWi_(D!^(gr{#
zhJPhzM+~3h-_e^<{w`!BF?{poff2YZr|NEu$X#M|B0+W{Zsj*YJ5X(Ms#z14@eSk}
zDmL8It_5nBk3*A>n=<Z~*u&gHWKyO9t&1%5DvMkCM^V7DOv%_4_kTLO_IRqZwO=Wc
zTT!_bDwQrmnaV9@a=M%{oP;z9JC&I<B_a|kY@IT6nMx;@(^O+z%I$P9A+`yVqRS*E
z!*){c*;2XlexLQ*YMVdi^S<w&&u6XQZ#`QxzqOwAd@t=)CKe74Mc)|el2B%r59ldb
zokUNuFUAf?1RKA2qPkEL*rO#wE+<>u{jCL;BQDRQq1%4Q=#U2Y=ri0*RR#PGvL-kq
z1kFyf^(9_U>B2)Hc}x=@ThPw?Ql@5fo3ef1;Q=wEcF>vGP_{s&ESA+Y!RF8Usk0H#
z%=#}M!(Oq}3@j{fv6c$#A+upEnbldr(OUXZc)(iHqv0CIT=~*z>+q{XaqJ<s=F6nl
zBoITq7HDrR@HQ$h+XBWuemvLsVWXtXMcR^Y?K^?v9oF80US|*2o?xh`KaIkK3_l+~
zf_N_~=TgXrb1%Rj0Bh|QlsS;^CMC@j!F=Iq$&!ppeyKDBD7Fr4TE;GW-+gs(nop6m
zMyOonTKNJkA4`T}15Qmtj2D}|yWHyfTirGSwXp(8y1kH-pl*45mkts^#+<0M*iKU0
z=B${Z$?(o#y)dyEvGZi`2>7$9(kGkBg4wM;kmHglQvxMI6k_r<q%zH9Tp%yWvij%;
zLurVWu*GS(eoTY;a1Q^V(^s(>NVk`AzhD@_4UHRGx3-~_oo)+1-#y3dJLPYnVAlLN
zf3%&<jQ(^N^X6B*s;>nCesv>37UdLK$r6oig#eAJ(@}-I7Pw6FzD!<02F54#V85d4
z?*SUir`h=6(@6=^_e%=I+e~N|Z8LZmx6O#yHUmWFWZG3^+UK+SMoZshz)2fhf-o2N
zEA;evArvMp{0(s31B!~F>Qo?%3j(h}>z*htU`lG|JU^((hM;PR7u~oImdmKU`jKmo
zr2QP|ZwBHFKB_JROb+;!V`=*GI1ICRC#wi=1H-el>@K{d6@D><Mx<$4oAJ9^r{EL5
zYyXko@BdIFqfJ^Z)pFA|T3x>z$BDp<y&X5Gwf<8KqR9)i_1mT|okBolRYDZp^7+j%
z23Tn4N<ag|7js9mp{Pu6VfyyEs?rK{n`c5dW?lxV!R!?rxVRuUU1MapfX(&mRb?VD
zPG5csCkg#}?*IuM@(~Hmz|SvCD(txgfN8ER%ecvK$bu-ESZvC!>=+XIg~?PTKms&s
z-4?6MX2>wfE^o(sO+z8O_qwfISuWK)yUFT{-%!{8M;n4KrZKV?iQaDp95J9{jlhbr
z(klS2UD%S*wdrIA$3XVN0}Sl{Wr<W=aUNhK+Zm`2oH1wmWv_|t;9C}klZ`J&Y%jq*
z>oQn=VGPuDObvJE#sa}>kB?Km50?9W(FVc&<IeR}0dd7ddN)-0v8v|@awJ@_dk7=f
zpO0UVFcUapwQg457_4xxAa~%!Wt$igzX{xnAMlCp2o7s{*Yy>!&>>HdC2WbAK-etR
z0Fg`kXKK!+GTr4rX~wP_B{g%@w@n`B7heFiKVN3Wc$*3SiE9<3hQP+x^gboi9&{i2
zEs;*LFZ>9y+*QRdIKAVSb(I-bfGp?QPJ=9r>@DRAHh93G(CybH+vZy1P>$OMG=dBr
zb3cYqb6GsqWwFYSP=*9l`if10n&;gSqZI*yKHIoF>2~w_S&B6VF5FU1RWnuhiGn+x
zb9o@ENiyxK=XvSd)iacDww*j-?0?sv@|XlLpkns1(5@3NFx46j9qIN*8y$*D=|O^M
zYaU#%y?<$>Ez9XZW0GId4mIr@N&$gQ5j`bD{R0xa)Xen6N}j>M@~N*1%^i<UHZ;(g
zUH-(4YApX`Mpi$#A_Oib((M-Y&5Rm;Zq9n#<^*bb`+C#)zSOe^yTr9&_WI^bP+uOJ
zj+mRJm~AQ+?tg-hcW74~_i=+!C$2p|hT?BspU9p~CKoOGYKqek>+o8b4}Z%^&({w%
z$R2&M#}&wsirGJB!_<n;uDUMzmOOhXE;4YZge)Wm`%umdKgr%Sh-Kx2?<N`GlrI=1
z|4aH+jipr~8H0L_1p%XSw^={xQCj`%F?uYJn@suuBm_Dm|BEm{F*|m^iXo0KGX%0p
zz4r$ugAACaN|CW-^g%PixlF9otg&10X5?Ve%=1~OJxN}fNn%<i>|%n@%<Vol?*9<h
zcufCjZx6S7GqduUsv~j|d`cqk<;nFs8!T795%NKd8r`^V-&5nZ!4p9VGn5w$N}0bu
z>OCq&+h5iOI($0?T41hQqVIX+jKi7;K$*Z?FGp8&o1><}>cj;1#*-HZ)mJ8lxM6bM
zVJkKYGD8;RW)%)KNetQuldSgidW?@7JhIt$fA{D--;zIupVTUL6QEiCp*6>A-p*%_
zd2{uAOK#vBlZaK20yO6_B(i$|6q|MBWvlBe%nWj-U<t^WG@tauC!*T{V+D=xjQE&}
zi^F*}Ev}Jas~S&wLetFlp5A8D$gq1?@u0s!&g3j8&ni#d7~vc!a`9id^VcW5*{OM5
zIu9bhMa83b^GU+X+30cvd5oI~M^l@Bd|_9zD9GyNJ8iYo_wtW~f2){%b?-b2xXw(E
z4A*4ARKWWbiv;=+)lZgBzQ|iURmPonZ|1Fc3io#4nF1##A9}-Md8<q{|JcEQ!q?%+
z^3R}uk5`z>ort#D(=<&3`uccDeE2G_PpcJVr8`acUSIpjctD1~eV<5A@3hsP7V%tZ
z8@=5=CEo^F^(>YL+CZ<>i-K%5Of;P8XHtJN?@~2ZG***?T=2EM^9;BoA->Zx?fy>s
zEigy!-A50x-xgkHN&PP7#ZzxOwQWGv)Afqn7&~d>v0mdXqI&UfZ*r()g)dY}2oX(t
z%1f&^NuI}8B|<yU(}?Pg&nMCrLjp5JaLCC%_A@vp1~E{W*(kdO?e=Dk`#i&WL~L0<
z&3lrs!mH1~UBR9LVXnVzwaOOrT1@R8r6qgLV>9vPtLnKdlTvyZEc9);*cLW=G(>Bq
z>Pul4Id%x_6jQU1cW%Dwk8mCrLRPY=HP%Z12X1%(p7Z;uGk=-IOc7-_gvK_UAI%A|
zTnoFZkgevc-pYhnuxW6Sc;9=m4B{y}($5#%Z4Xjs@RNzs6=QY(yBktn<(;3;!iP0=
zo<^YDnRNKT9PhF6c?N40bKGTB1?)@iA$v;4-<S`ifz4883wb;X9TmFjpVCPe@~Mv)
zqeK-o4N+O{G4diHJ^%7(ID&I;N|dg(AbHBCP$ri2rS!d*4l^fhW5SZyIJro&>1ftV
zjs{&Td1h|L5hqz<J$3dT{JYW%Jz?^40W!5$)qz4UXK6sQ)}#Bm+f_zn>Gy)BdP>3l
zVK+_5mpWjL2W3Mzpvg*&mM`?1u;}L(AsH*RD|99*{d<$OR^|{K5`Qq&ARH9h(Sd#z
z)W!F;uMEpL?);_-RDH<dZvfCMb;Mw9O3ABuhzXNA{uC0if0^_K6%6$6xsR-Wav$r0
zH-GH~P}p=^U)Deue<?rB1u!<jq5f?)qbUNUa*=qK*(8UoWL@!Aftv4d16cu=O6tCY
ziAY(%E0dc1_&~=y)O(YZGWz!G!6t!9!<z!wU84E^4VD!Sbl7)sj7K|ES)pCU8~;Gx
ziA^T(Lv&&<S+0yK{Cs?M)7kNXL-&68%(+8Z-s`*X@{CIuCui-s#C!(E+Qc<w#3hP^
z=RNi{EGy9~u?Rh&Dp|5vf25r<I;Y1-wfyT6O&Esr>KW#d&L@m=->VeHZzVMt%A<5-
z9_Q2Ui_>Hk%t&2+5(o(G;+!*CMKdC6CJ-=uTL_$&KBy^T(N58jHE!Cx3*m&8e{O$e
z&28xGOqd@AxNyFbTwe@N2wn^DrYE3NG^bR0NWb-OIIo9xk(tSy(lM|_UkjkG$c5}n
zwpR(qIO8BL%q1rkG&WS-eq1%UV2D|%0Ia5+e~U<d2F!J3H~d=|4){H}Qu*HwRrMoy
zZ@?PJv}6?Iq({@#_ODS-EQ?Y7K&ar(s4ajtDHMh8APjORpPXHarC$n`5JNGbknCFA
zkJP=hWjx2d;zjiJwh&HuIdfZCrlxxCJiT{#)S$J3pvZA+=*6$YS0MS;oKA<B<WNFF
z-sY)|U+K0!?^SFTAO?0?>B^I~urfzgpBVTLQMEA9<{Rnog3OD%EF^tpPhMI?^&zu0
zB$1Cg%n@9fVWoTA{-uEEQ!7?!CL>4(kc7la_aun`p~&G;6py<=^byPAyF-2W1uY^)
zd{R;=W)J$K(W3@&0H{6p_(kP1`{6~c5Om(#0C51^d)^=tP+lB~f>Abn$T<%y-J`X|
zgK6gQ0=OJhg7&k-=xA|n%(FDsa1=S^O)kzrk7r<V(u{PY{8MYfv~>quilB>i?<V;P
zqxC!l4BI3}!IR_8@Cqqe!dVfcE_qyDrjrJRtr+3uFwU8Hp9OglhcP-NoI`ZwrJ0HG
z^W)B`gYt3A#29*8qP+JG1FY~kn}({TpsxaM=f|+&R0LqdSs&VUjp&8ASV|=UM}?YO
zd9e9KS&~8WTpBrGM_T$TF?OUnZ;l=+B1`}11z=t-fecs%au%*=){tL!PL{9i=ve=Q
zc8(0P0?dHRN~ASjJoN^fdXkONG8<iAc{F}Bqx>;vdK|7E`>yg9SI&3K(;K7Sq<u&w
zbsuY<0KNI1Z7GwY+5hCj;XYStt$ZB4#E_q0slOKn(K#PX(Z5&zebx2mf<9bvpbEfV
zwpJpP+KZz-K0e7Z?bC3R4>4$K!S~0VpM`dPhaG4AImofNF7S3xs#y-afF4~dx{I`8
z7wqbu>(rUU>HwkrE&koHo<&5p$I!Z^=E|u7EU7@R<TU=Kqf6i8HjZ_7v~u=h7u=lr
z9}w%4N*q@B*Al}Ygj40I5@8doHtvQLlOp~;0(04wZNZ^FZRJ$yE2Aqbk4}gW_F`~a
za4wedq9*rqaN!x7p$7`JHtkdfriP!%8C;@0muV4;PclsJ`+|e&OwmP+;em0Qt?Gf2
z3^eH>8HR(!9!4$1&6g9bkj*8BRX%i0C%Jo08y|?TAgFH=Es=yRS&;z0s^O*Pw)RO*
zrW?3n_by*Of-OgjUBlqeGGdSrU#;e1FEe<(5Tx6LME5xje(52VUDCSpV;9Tso<F+5
z2KeEb(O)ad+l}tb6uDo~wiZ}m=a67`J|C&!lKV+_W&=YP?;8de17tv22Ol4$h9a)q
z&=?`07KFq8B7`=ykr|xZprA=0FAeHV9vC5M^Osqv>5NPGC{n{1svFT%{-loMM>sAf
ziT_!5f?=-99m0fVK(`nIIIjF!iLhl**_+fuX5g>WDwx}JHzP21yUu1{h@+oJhDRs~
z8QDXZiFA={Rw{0W(4XN%yShgc)BMbbFs6Kq7RWlQ>tHS~3ePyF&2y<tr0uJd9IocZ
zu)Cguz?u|bgd;pV=zho2KWz#er>wCZVUr2%`ikJhDv@$0K!ZVr0%a~Pd~_0Ijd9Qg
z!^fg1{2s1}hDW936GQ&{Y{W3JSZI#~7P)jdp-tb@iyz4KVVf%myyqB$=4k*AyOVa#
zCTC<P-CY;1$@bEa#35240t|m*rCp}WX*$#@9b$;;lISBLr0lY;vSZc(kUP&(lVzu%
z;?=4*j3F9IO_s20@R4VD0%>Za$Zmm5<Zwu$0bBkwyG`O@9QbK+6lqFAxl7ByyP?3W
znVLSVFOOB$5TSGo<R$?;z{DUhPfr7D;D5?YsV1Y8bo-5X=+Pr0GXgFQ91-5gDTy1F
z=Et^k*Y3to8z1gH##{yPV?HzUI2Fji3FEYrqu^^FJtaHwVHs(uC_qa^YSTd-+tTWg
zj8XGTjvlEWt*CGPlkr=F$iwr2?zM4Rb*ePjPtiXAdze(|w*HMph7f(R7D32km3|*&
z7be8mY3h)!%V2Lxulo!*aQ!(h&tu&K*ARygc^GzeCQ;)B?B-4Hi$6!BCBa9wv`M=h
zH|m)Q5U;6)iVP{2!PpMAownT4yVuatQ7gG9^@oxj5MOYROe<;|q8Q=Ju*JunKV<pD
zPNCPZ*2y58>q%}#K<yttMP$JTy4k0VWig#bAq@698DU>;*N%Fyy#T*=eA-qJ?=bXT
z(A@vlg_@5u%$&7OG(-qaLd^8$oX6%<l?`c<ssP$vNK?y+0X%6q6P*_23Wn$;fM=?y
zV@z1w22!9RsE(s1l!j|0Lb+<Hb{-}zC`=elZ=%ZSVUlTK?dX;yCO=aX+r0g@bZR1#
zZ3*y6US8;te~{Cj*=uuE-ZTGT%`gf7ZEFtGlF1M-?gAPXwA1*e8p^h?6=`#034k*J
zzB_GhDNz8owM&EwMNPNBd+5KC%U;!?GUyKZW;Og#D%Twx->~(4ty9Sw6~ndj-9&|g
z=!{@&yn;TS0~2j&8R$m?ZgP!Mip1&qFG76hpf!I=EQ-%$?&Dz-ug|1s*r7iQp7!D5
zqd1xvu#}fj$iLI_=}}ySC5nPK<DQjanwSRu|1%_nK;0kF&aVU#!ZRZlCNF!Ir076R
zOCf7(<j?TBy6nribR6jRoznY4=Jxqh+A>2(nNy)*Ag*r=W$$dlmLM)3=<ZIWFWz35
zE~Q$|39-tVxLo?Ly_k){U2A@%vf$^rOFT+@k3VfTpURTFk;PNir%DStI)2wAil>;c
z#dgBsb?l&rH*#~)W}C~!_u{=Kfgin<Hm1rZXi=^SEf#su6+6sXfJS~Sd?Cs{QEd#`
z2E)=qQ*(Z%`{Un3GOj3V&-h%?D{ewvRHJV%oFOL(>%<j8B7^N3q_V=JT<i>q4Z@>g
z1xb;h>&=LfIWnwqpt_8e6&`p<WLVK;8^mag73i_RQL;;rJTh!%d`l;^dGMkdxfE8u
zxC8u5*1ZO)dGxO7E$>k5=;Ys%3uF%`OXOqH%sMGKhEyc^{Kia#19)jv^{gSYVQfdM
z8FO+qf>CKt6Iz&xO9sFTXx-$f`km!h4?XR0uZMLHfGM}_w%y}p4Q*4fv!85z`2Hvu
zovnxpTQnWNY`@ps-SUelohFVuav^;Z43Dc!o;0b(Bwr4N%<v<|i-hYL?gFM;SN=xf
zq&vhy0g8;xorToV6p?4aHq?HP!RuK=R>NyPM}mqw1^R4>eSkwh&To2`R>{1JuW;lQ
z55czQpO(;!l|6BZ@iL*ZkYs9VtTOdaVewb>S{H||Xd>bMO`40$FQjKr&0gMG{-}CW
zcR>3bB;|Q3uy9cRp;KK$?s-EM{*97cUI_oSGle1pp6lv|Gr}*;kiO)hVLG_~O-P2~
zkp&8?%<~IZ{Sw}h($!g#3v=+_!nPQINn)g(t@>ecm{DCtsheN#8dNG9d(^fi+TMP@
z5^ND+P>a0<zp_bXPwvDY3qSL(H9Z?W)328vZK5*9<`wuZ7IhVJJX3T%9&YR@2+Vk@
zTYXU7*<0<kPM5%fzw1l9$w@Jgi<+0xT$5BTnn15TS6I_|Dv+mb<-kQ{hw5D_i~kWP
zd&@;S<>_;wCN1gP>&9Pn#ZdFd0<-;a4R3x|Aiu?S!c&w^R*7#HU$N1CknS+wI^r9V
zV%+`Wlcqt2g%xI?;3z-{4Jjo(l`+~K7b1$-V6^VY3~65DS-;;mn04K)Jf~lOL@!Fl
zf4s)qNu4rt@txaa>af*cX-UwTi0^DwSM%bvv!`AE_Ly~TJ?~|+V4mJvodbn86izi=
zG~XSmA1QDQuHSR}=1exdDttrb8Hwp{3Qkxj2=4eSNUK{|=;5MrPB1UWEb+KTyt+l_
zztShKuKUB}Su(Fwbm4i}Rl^DGWl8ZGQSu1^Uph^=?Dys?r>$nL+k5qOFC@&h{?WFr
z`bPTCet9MDw%RO7!@9F9y_cJN`tR(1;3=558>T({c8#0#uv++vo>O<~ewSxc+x7Lr
zH<&5eI9wckA-Lr4$4p(^mIUo;C`j66G~=m~iR^~rX`dzxDh)2#wOUu+YO#Fm0w>f%
zy_XyFCnrfAJLELIE<Ufe&xma9ac1WoeyV+DEc$6=Yu^D|duQW;j@pS}R((_H0|WTj
z#bHmijpUzgU^e$JVRN7D)$7i`1gUKP!=REsyox5;ggh{W`rT8*KO(9XJRnL|EKfWw
z1?WV*;Tr*$%cfT<xclKFj@O-6=Qq#e5nXX#awMt%_VgX_+3zJS!R#f4AaYT5s)_g2
z1Wl#%vh-<1t<DyV`(c1&9t%Ee%~r~uRwf?*o}DueB@<P|b*CCjzFM5j4ldUwi~2pr
z?&A}OAJ4_(gW;EybUaRm8p{8YZ#jBV%TP$<gr)H(*ScsKHqSh#l;x<~ohztqACM&x
zoqMeBU#iJ({+bm-9jt}r9dXIjlqfLz@#J#t`UZaqnUT{Q(P^v7?zd-$qHO#)O>05a
z`;&nM)B>aDHHZe|9E|J@V)LqbKSe3xq#-%MG$!m>Fvo47^&8!ke;hb@5q%EQ)L$c0
zD|_eet?48y1s-2rXSa%$&Cp<tHw0U{G;Binr}Q-Y4f`uePQ`_Dv=4RVC-jkUjHmH{
z`f51Ne$#zJTl_p6?q$xTyIVpjCh)AE+OJRYXYm@!XLecrq*;yYm>Hv-=No@Xdh*fh
zULOgQxvl+Hs=v5Leo~YJnv}B87<&zU+%~5<rD12&8?5#O`-hlwLzi(~R5#FJ>iFxD
zIvX{pEh9RGq3sWz$x0n6d8pLx?3H?Yhak@Idm4-LG~;I8WKoMT7g^8(2d=kp3jkse
z?BDQ%`&m6HzVZj)t1WX>*h|(`a>0uXR89+d<q_5WBAe;O;F+g}J!XM31=X@CKtlxk
z>o($jhf`D>VRdPllO?3LoADgjS`~h&r{}!HbtP#w3G&ZHjoVXBtis@5PtSLor8g$f
z3oH+CX#{3A3qgSo)#W9E+9NP4bBMv+r4bKpQ`MS%{|4cHoXy<UXEUG6wU_*Z8`>1%
zY>=a~5u|zmoHu~h*+1>RBMsRK-h$KP*-(-KcE3V=*beY<Zurceyc3A#rLv`Hc|9lb
z0&c9C#z4OZc1M@Dc}YDVW7k9g7e5HQA)j4$!{@gt#snvx+j@59@*KaYqxp+*g}GeC
zZ%2tjTHIwTA+9jPFQnV@t3|(?n2w7A5E-fj?8*Id(>MC2ie^Xt9?)SwsPKM@ar|He
z)kNQo`$B%@mapDD|M2rrk-q8plQHv!t5z!t=a8S)U^7lh&om+v4eE9ZuEarFEZ9mR
zwBrFY`3ix^Kfl+*Fuonlm@9EUC95jRZk58u%UB>bec4M?$9?$EhZ%s?x{&9~*l6Wt
z=ofi5m>Gf<8I`X5f%(I<_me*i%BpK*2i9Xl49Yc>f(xx_BrQeaW>3o2Lz;)|SN?4P
zH<nMK8}lR!XhOE|YLPz#dA7N2=oV%A<u$*P4Rt8Sog&%3v>kfZq{6LpgRPT{*^ZjJ
z=*j=bN0AmDJkT2w87r<7mstK&ul=r*smqwrr)6%h3p=4xr_IS{W<q$(qk(K~!2-1w
zaKLF&j|AwNz9Cw%$szbA@ZTTWgKD8Fz$<x>Nl&V5^3o?+FQI)^;evEfT<8N6x-m{G
zc#4y44eHOF^`}yxTuW5AOq8I?ALc`7tRRqRbODPj1+(?mol5Z&#Zz4ct`!}pap%`2
zTtRi09-*Fh0K=_VLrS=SS3?x^)AO9_nGpKzjdfcgx;~dq)OjWjL!9{J5_azo6DqNC
zr3&G=YsJ4K9Pl0v$vvP@0|ZZo!q_k5$9S&%D&Yh4($A=<bdMWnz5Q>7-Ad-1UGMIS
z5z_h|3Sv+}_;%`5M8MvP0~s*iuR9~f_3ub1@BgKmJ`q<6`(8;R5dIwgm72b!em;J@
zR?Uj~T?{2b*al@kSVl@H{v)Z6viz-($cH!auscAdY@b$52)bt9;(ktQ%U4@7Gyed=
zKivJWO!DD?3o{}wLAtnxW*3BSSI3qk(;mTKY^u&cc{vJ<{Vh41gb>V>bmgL|Y<_jK
zvouYIjDT{*vU<k`GTqi^8umM^_V^NrLb%eGq-nBz_|;{=O{h8p=sTAOF-VHwBWW!P
z5i|z?1?(&hL~10i3Z^<+)cfg6K}VfNr}hJO?4w=+yDoS-y?WQuBM~39JQ@;IvbDzw
zjK2c*;xwh~h0h-aYvNHuSx;^6P1i5wPG`Xui~8%%R(-~i=p|SQ@R7&7`4Jm5YwIjm
zG7CN!L#ey!yL8n$X`OPLGyCS@o|#%wN6*5z_|30N_Y=$s;wgo1XLi+V`~az8{7NI<
zVWn(cw4BM|mj*w499+ZyB2mfQqQ2-wz!6;e*pYUA9d?hLI8|m33~~8Nz^@T9i^{PJ
zd9K>tFWYj`qsSx+ASW&&n_nsUIjM(AzPr^qhP7T6@}5Uj`<odE_fhNPLV7MYHk`u?
z>?k#5a-5kaa9De_y%&lzlm>gQ4}U#xw9sKfOb-uq%<OtS{Bsua@Yh>Tf4#w!C{hmr
z=Q1?^T#jF+Nmp&<zzk*O8qSYGm5B$y(mnunO$_u38p-TF6G%5T;Wj}qGq^v<4W;^)
zV4edCDTw(yUb5QL2TJ~3VT~&=4?uRjfII=&ve6*m8Eg=DkE8idLz4H?lU_i#0o=FN
zX_30O(II#gxI+7Ayb*5;zZx8TPq|o7DjtO8E~($yt?|_wVHkLob6ZPJUaa%{`bNGi
zp1dgA_bUr6$LO*r7g_D$r(N30A|2i#e^>LfVEP9M)cY1jhIP~hb=Z?kfUHLjQjAn;
zKau!$={t|#A{{2e>F4)8BahWtfr7g7#(xTu!iSW$8R?8Yz37(zGsTTLvgpsW_RX+P
z+-vG@*_`qge^%AV0dsU{O#K^9%9R4C;0o-)I$VAk)(hTh?9zg$=J)B!6#^Rk>HR3^
zW?~c4;yXLJShY>YpuN{7!D}|Rc`7&8Z-SM+UfQML@$@1<6AJFMV4>649y&LS2t6;O
zj}&^~`KDJ(XD8aKRmkv6f;4mP5D~#7NRS>d8NdV)fC(j@<jpdi)tCSXK&wF96Gxau
z^4XueFk6>j?XXiSS?QmI6M_W~X{E>JDb{QS$AOFc3rhEIzSY(lsQ1)opt}6dj-T^x
Vy?E(c6C^WACv)@0R}B+J{SQ!n7T^E?

literal 0
HcmV?d00001

diff --git a/demo/undocumented/dg-advection-diffusion/unitsquare_64_64_velocity.xml.gz b/demo/undocumented/dg-advection-diffusion/unitsquare_64_64_velocity.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..f59db7bfab21ea9eafbfb67ed3e19709174fb55c
GIT binary patch
literal 205780
zcmZr&c_5VA`yULA(Ad(T2FX^G-BhD!GA))!w~IE6W$ctBB}+1vnMz7oDnlh*Wv4|U
z3?iYDt*loRMM)z3o-?Z3z2Dy-@9DhfJ?DMLd!F|>pXc*@PI9q0%!={tRv5nX7mU3t
z<V8)suH|<;kj%5bD(>=9r998ho%cw2+m?PAHyKK^>ev<1S}wdp@yer{_*Y-8_I8#`
zs_CB7R>Du4zuwW;eR6AI&hR6B)^XNYLEY!W`|`{AyEHP61|8a0f8(3U2ZK#7D%SdI
zg`EzT-IF_sf3=lX@Ur-z`(TFgWa9%5#S4-b1IQVtRWAH-q)uvgoaANM>b@f%y^`;A
zE&IEaJuYgu60<#IlOEqKtD6o+LXvixse2^tHbge>xM{-P!?}h{4jQm@_#=UGYTqAB
zS0x)MwT7IW)yp{rG7~0Q^zz3wzBf*>#8mdn{JHyJ&RuPbO5r=qc&(GG`XcJPpR8OY
zwfn|eHJu#or`v49<_^qV8;<|9j?F`e3M15H9@YOIx7g_V6ON{<*M|psmxiq*B5R4(
zwuiL2N1Ly<^^YUp`DE>rUHX@@>f`QS$})4V`?%S<%`tCh#&Q*%3mR~oiZ?0gfd00m
z#I`*9JpBv&@r9YgnzqSL7NN>yNd2yW6tm#k6Se!d*AHTi2vLr!+FFhTPOlj#PE)d#
z$MsmP!Drdp9&#Sg@VHZ-m32=$KW|`5fvqjgS^C{+PJ{O1C8l*d_j+n%+`EClqY+d0
zFmtw?Z)<(5ejsnOyF5Ak+Ttb0R$VX-T%dM{EkfMnzH;@%Zd1S9;`U(;pOwWfv&02A
zyo>aWC9ib7c-ky=^YO+PrpMn$XU?s9p!Qd>47`sR_W6KMtxl5?t3tP5Fz=pCu{oMO
zJM`{*<-6XOio5XxNt*es9?kWRIchp}Rd$`jJx<Cw-A*)@wTau*Nr`Uinr%rnyz#d)
z)wSA^o{0afoQp3^{M+e9UN84}7v~4>$RW>T<tnoPb7xlVoy@G#TH^MRzu}d{gwsux
zlfDj>YL#D*k4zN!Frc}a@+SXA-l^L5T}7nCwRKV|LRzvZ^}D3Fhgt9%$Go?*VIQTs
z^e+Ehe#D%<_S+pbjWv%vcAECMSQJQl4{Tl4<Khm-K{$d|eb9d)Cv&9Zp}^W&ld-N3
zx(_<NF1<;5Ao6^VkO3UUK0XGS0q1!YMEQ)zw<}xy`7uPR+~>lHVg4i|bDe87ue?RN
zPe=;)FKV+{Vsxara_xitswBp%71V<|JI&o!98vsoSYA6$_k@tL;ZBTCx_#)Dryijy
zGI=uHR-a|MFVAK6U9?#zb&s*tM=<lqz3|Mqt~&<>ttk)d^vp!QtX`s}w?cWr{wj-d
z%$cBKUh=!w3rC5^j##;GQNe_2ic(xxj^Cf7uTE_)E}MyvkKDlcI(lNkii<slC97rL
zRCs9n$hq9AEeTG_>{6(8CUnOg<q34!k0B-+V9wObhHe=c(J?<&f6`JS=yU3ei29Se
zB((8%<~8IfJ%!JyEzqzR8iJq!rw<LS!ZV-b+k_t;ZS*8AQD*F1f0suzGEBZze1)(6
zi~*HDjw~|#w%}?Z-aZO-Z-?=oF#bLoZ@{)DMI=WZ6?$yGf%jSUU$JGM$KENA9xoC9
zEESR5j=gf`Pkfj|$;C3w{W#&irsO3N$;&^>cS<HM=($l#-fCbzVC>+gjbA8acuieZ
z9i6Q;y#D=sN4a2`rZA=H0&{iI*8^Gpp`l&84{yrF$^AX%fICyeSE0R`NJvolRF)$g
zw;=M=fErIl9%@m77WKnWdAKHt?}YP^-`9}G_cwUnXi|!jO}d4xd@6oK-n-?-#kV2L
zO;|^k7^wArSna*D^7X#XYf%p#+}&o?rx&4e<ft3&j7+uy*}Wuk^i6;8`HnEb3L{az
z@`U3-@sm?N>LS>5HzPs<e}3nj^a*(DuNcX~sAwG8KIJQMf8RDaZ*8ajsCdImo_e(x
zCPbr5@v~HS^wGDxfu<FPC3|%{E9x43@oU&UMB?l0lntFL3`F?IK|z|BkCX$#qmOij
zM{7zjWbJIc!CG{yPXXnh(mNMfU?Lp}k#~0WUfl$*Md*BQvC-<sOW4Pke(13(KexYA
zc(M9W)zgTCC85RsgzlzKyrXn5je-(B`1j#m>6JFkvB_)4U0%f|v%{5sHb7MfuK#`*
zlpPzi&SMlWS%z*buBpB&2P-VJSe>Wh)1I7?^PO5^7<pl=vDI93h#M|7RL`j5n*H0F
zV9mWmb0QA)bCAw`8k%ESE-sqzE&Dp(qr9TBgR`#`nmc(q)q^z_+-09o!Wfu#)$w>I
z>_3Vzc#)0mj!d`?#nc5%r)BBRP}z5XF7&0$Z0GU5c|fg9<jX347;_!<lti6)J4>c6
zP->TTV1#*%Mb%?OCTC?2d7EBx3&jR&+r578FiDmP#GuEZJMqp}lB@;0U7r8V0}l{K
zx8&(;&008L`PGs#b>R`dD};!y{%UNj-;OcREr3Dhx3RuD{_u-+i^a>HHvav(;^~xz
z4RQO2ZfrQLGxlZ=WOPV#l@r0))=J$wo)cuWO7W#L6=(`K8T@$zZ@}iS8}CsruutR<
zMAo70!$V9g#+;cgfpav^t=n>mL=Br8Yt&KCQ%cbDQBK5%?0VGy--qLyAt6(G`N65j
z;&wSH&`U}^V~zT^Qu}YJ4^GPB9ONU@^!T%t21~UHws@Zq=|8(M9`{-An|evbgMdBv
z7c@p|yq>$4_vq>J14j)lC7O>wVW1(bH`cg&SkHKN``2#e{%n7|_om;f5;j3R<Zl^`
z81lU_nb0klmxLa9z8gb+S7LZq@Y|}_CzBho2_MSMYYq$%J0redn6Kiyo8&uqOa5*+
zrgo1efe9xFgqtKDp1Zy;Ff$`;N5nl>(J8se(ZNsQqk~U{9;b&qUEe9Jk%RS>*hhrP
zL6bKNufHu+H)6}h1z-~wFy8bqG_ToMUy6`ASQP4rMo>f&Fy1%IVV<~W=$hq8=;{9R
znzu;8mbPWd7-2qR(X4IqQh&{HQr3!Hx+;)T)0ER0B6npY5sbGJ?6yqgzm-O42}350
z6N0-x-o$Szk3Ng}N<rEGGz<OgjfRmw+pQbDaP@@q)#>^tNeBG*`<FV;?qKe~K0N;#
z`8x0}NxU&B<6SmHH>2mFS~Ws0Vn^o6r;}5ajQRaOBe(S?*;_a}{4Sp#yn*n$Y(aH?
zRQu4Y{NljSYVS>}PTr4AwhX!c;I5#C$UA7*bJ7l6<*JA+{mbCr^`gYMBl6_sK1&Q>
z=<6!;)u?(es$^eh#MCM{zggP6;BoR?lAQAqdtQ0rN=tvG!i?PMHOeI8H@sVhR3taJ
zP2&Xu&zFddsvec?w)&)BmfruR*JW@4J7b9f{F3ormz$-?2YvYyybODZ%|T2_vH%}>
z+kT5sl_QRacuOt{@RgYFX{y+>;Pzd{7Lf!rg6p;PkY7S0c*xt|@WcIux=%sh+4^a)
zWQou)`N%NywzsqEg@)`i!j3QXlgCbn5IBmT;E&&xGknK;6Mx-@NF}Ix+x)DmYZBv@
z5a91;Zs}jlNjJ!bb66=BCWJY#!=3GIZrV!|q*mGpL|*@D7u5ad%EIwC-})V<22bmL
zm#AD8m5ko_%>&X=viIe6MZxO~rw=bO!$dj|a1H0h)t%?6))}$;r8E^D6RuPX_)@?^
zJI|JiV+{JUv1LzNjs0<Fl!>7*SQ2AExxAp;WzphC_%q)xVD2h}C}F&pU;Yzyl`J#Y
ze@J*dJyh~VL%2sIm_I^ACmXDr&y=UL-?C?VwB~?XsO+ad7j{SL=SY@`c-eDLr%J$R
zL_&>(VM&@?p$==bP@+Jf{bdUo+YLCM!3xng%^M>}`x}J7Q-T|7<Tb?@$XzD?_zuul
z!EFMYEfdkRf$vKII=rwK?2eS0KRa?)+C9ggk<8{#_~5HE9%=bogVf{n^*##Zbw`DI
znl69cu+iDoo>voBS$4rr!7Fdh@sx#caVXB!^7QDZQ!g)nT^P9XXlKr5J)0*YrZ2Dw
z2P?$&!mj^nklS=SG~?W#JUf)Kd9U36tlXX1Z(i2tHFU7_9L>e_$Yfo`(l0Ijy~?*r
zcdqtMn_AV^t6W{8S6yYkE5!LCY4Mr%+|aMLmI(zaA9=uEl6h(^`Q?GOHQpPz-WY7g
z-t2whlJg;sU+-df30?}jv5|G@(<o)lhn|P1XgZ-3e0S|sm=Yf>wSb@Az;f#YtNB;(
z%CPJfBX@jyV%1Q^Qw_AZr_aFRe#rF4N*)Z$YaA?@*RuOD`v-mTXC_vK`BJ7Y7~Nf~
zjejgM^5-YK!Nw;a5ctQ1)7R`yO<Qtfj#Cg(A~4}980OI0A#_5O@Fe}>0`5EarN9h$
z*VwxmA02<ob64RcERIe&*lri^g>TlJ5l+B#Hj1#pz{<r#WwmX1xn6I+7tA5I$sg`u
zWCLzdUfn5YuZp}>lKr=M_M=zl*rmDsYd63ziEvPjWDjm1+LBo~=lBw9>>6fjw1cpk
zlUTb^krKYM^cmlkQy+59m#74u3I2RV-Yf5X$)9H}a#2Hz@mY=HH5M0zzSR!+*M6SE
zmlo9T)GiVBkPl4B7YMJpCn{~WNTc9<Nh!;Qul(;y8JxCCi&4(nTs7P}6@C8lx0N^K
zahGitln*w#C7e?zf2B5=(SO>Uu+ULHs%S-UpUKRh6N+0bCiGIByhVi>v&vu1RcMPQ
ztWfa>Dr`})PsKmgS;c77BR(v3EkT~XNC1~~k|%t?{=kvE0sE_{=t6~DV4hsiv*4cE
zb|P7xerz-}b#0(g<5H+EB8uuRm~M!#UOG(KK|GYR#_(J4(W7b)(q*F@L~&^v%OVtq
zO7rf9(+}`X>&Wccudp=f+@FRW0r-J^&zhSPZpn#$-=i(M*Hj?9Sc$K^`dpa&!v(88
z1|@8eTUWc*I4O87ly+|po;wt-JA=xLYg^&Lp73COc(5$|ToLRLF{>oLO>4nt3zv++
z&YJa!%MNLNbPA|1=eBNKpLj8Ey*`h8qyvT&U*0^M9(-%f&cCI6`*7tBHF|B@cXNyn
zHrckOI{P}DOejAk^60?+XQ4HlEwZ2Wzr{<+dKl*r*D=<{cO9UrhuItEV#B{gY<4LN
za@4@JNSMmo?BKRaVc%yK!imO7d&5F>;w+k#kzky2#ZD;v%L_YnQr;B=M$;`23Xy=l
z`B)$Cj6uLqs2Sg^jTAk%ep8z^F6(W+Fz<V}psQ=_4ZRGkppeG4(3U0gwor7|qzf<F
zDZrOiy-u44wPD_~vty{zOG|E)968I`zp^YSOHsn!Q1`3$lVb~RbE}iuPr6f`MQzR$
zI`L*z+rhX)>L<&BPD9hP;43FLIv?@mH5RTiD!5MZ-92~tcExM6Y#yae#|Z+{@xocv
z>hKILQ{}Rt`g4Lg#Gt9al_@8SjO`6wYOywFY~gN{XQiD^^hW)=`B##Z;xA8}pVhoy
z+ZI2v=!4k}ms%%R?U}Y^-zg_6oeriNcXWpdc%57zQy@Y_BXknch}swGiNino2Jg|v
z!!r38Jg{-j^^(n`2XmZH%ldEdIFyKAqQxaYF)Uwjd_-_m@xU>Q89rKlTq56P2Z_K`
zonfV*R2@&==`59j8ndfkDwie><zHc%+yAUyQq)<3Yd0O|HBKs@!5FtiPV5#4uWk^=
zX8-X)Fi9~#xJBZSQ_-`aO+t=uo){W)>yD@EH^5g>Ja)DFOx}7D4*_B~8|&lZ?@IG0
z6Tj<<;3{$nYZzZ%zvOe>aJIYEX=@{ad^T0<?h!+ZTvcc7G`5b=`QS?KX|sttt}#>X
zZQMGqV3BzwmQ^0kJ%;oyp~}PeiABdm_wI;~6TEvxU!eSpjj3{XP?nN}uc4Q4_<Q!t
zEj!BQ+u8}=?_B{)UI&pRTlN0A(M>xcUh%eX;Qgj%Y`FK`v;J4gA9pmaObq>Eqa=|-
z{L6{Ag?7QLENGB7(MLNabwr-NqvMdM*^QB7P<SmUcgi{^c&Wa1QFtwLME(-<4{e_K
z-0jNt+5z!qW!!7f#IFpu2&=VGvbNXedl(Q_v-Dlzd)v9kehr_@$9EoN=wl#?!|qvV
zWAbrUR%oI2H@7nR)3x-&bG6eOD*~K&-{(@5bBG>4Dpzus;96)bGke398Zc~BDOw?6
zb4E`)?90-fO<=-tf?3rGKYM>}KN2ZhU;sl*p@WU$^EW{Q3X8pb3}NK4_tJaLx&5dn
zK8X9KdM{lf)L1n#O{b8o_o39rKy|IqWRDVdO?g*`jZvfa-O$u8-Mrxm<=`*$NV2&7
z>+h-1WfO<??eJ98dHBATX4v}RN-NbR=#|9uHkU=B1;Rvmx-=O^f?qU52V5^{Ir;E?
z^lhgbM+|c>)Q{g$DLR+<=1YGevBb!?trq&)+`j?_vo(wm>7W{PJz!_p!0Zy)!62!i
zC7NMA5}(8x_9VJ!E)l(U42tjViATZ{&eeJ!b5~0owzyHWP5D85=5?pM^@(=dl?_Ch
ze+Yz+6YE8=UIH79a&}AO+J!&-w-*fXI#>I_Y07B-`UR6#`=@8NdVX#%WSTAVk2LQN
zYse8io~kpbcWL9Dw*b<gV}vV>L@URu9(~i%;ax(JH(73w{_^jjJTw8V=YCAbju)By
zzs(YQ_qr2TdW70V!sk2vn!GM=(X48j#QAw+%;t^%nD0I3ew)UBW<N}J?~@O$;Qs`|
z?f)q53UQ4}>CWI0U$8a(Lhymvjpff~!PR;=3Bbea(LJS+W$?|LPzSP;eR~#WRqNM+
z>0E%{y8HjHd`*B~am*A9MhS-ef&MaO^b^r<S_zdm7wXx=r@iEHY(i8^0nb2Z2yK<u
ziE{_|R&X{6r$3v!pkVx7UNf;dShLItJfEg?zEhq~V*3i@sV2I11}Ix|8|M9&a&5m+
zcuP5-U~}E(MJwoUyTh=zPljR3Uo}`bO`Xl25jpqzZot#H+J+$a(`ErJ)`y((z*#EB
zU;gr9Y2w~i*?@)nw>HWIDwKDbwk^Ai5w6e_y{slu*fbk^I6V9f@6=kea}-j7Fm^<_
z9jsFsnQIm@*XWrdT`<~18eqi9PRd4&E}H)w`(X+9mv{|^c`mLEN}}lpLAxz3$6iUi
zukrjC<hU%+&}g*KNgmz!6|A^VyNU8!-*!*jQE7>5lY8~qDqw*!Cc;P<>mmLne8#|q
zZ@Ga8Rsrj@Z}w_!#kpw_`28E+uN|nl_AIC&?NzxM-FJ_+E?qXI(SEqTvD@`zU!1T=
zyTEkT+e=EYBBABt*|T%DXZlZ^<kpKsV1ni}_~#c9+5xn><f9b|EjVfqVtGeU5s#K0
zrziS0;PO`TU?Rfh2_D%Y+U1yDr%?(a;n>_7I?OckSenw{>gFq8cxD`!WaPf)E1uin
zI%-xPEaZ!e4jNf6K04I?%YuJZ0=(RiSAu0vCNb;_^F%pvI6Cv@_}SfQk@FGYHH9fw
z{-*2f?tTcNO=SzOmBq2ymW$4e_vw}esVjo9IU~<yj(ipJdUeRhNrT1xx^{0+Nyg@k
z7qUdI6_;wjhbEmk(30;nw@KTF>VDdA+U0>$lE*XaDc9>eRD+|w>VCbFG48gnj<DqL
zLnr3=3a?ti$m-S7>H9cpQ=KTz1&i6-lyENe&yZ=K`tIa4VXs10pNTt5*!`?Ifg?mH
z9Vb1<r0coJ*cW79grdQWkGVU^En+Oq{0lC98FLFkgSCZ_fBjTbb71J0t1GRH{yLGD
zDywN-Mjt^HE$hd0gQ~?;)4ql2*ZrW|-N$sdz4ishI@3Iy5RIg-$KIH?ExUvfj?k3c
zH}qna*TjLW>-$oDc*IUb=tO*8B|;dHx0bRmSZXe1pW?Moh}te~9Uiy;mRfnBom+XJ
zty?+n-UmsePRZdD@o96yqZzthEVo8Rm0NQvzV7)oV>zjt+fHs6*0;8kbj&A(H@Wy>
z6}?!}<%IV#n#8*M0?dTJqFX5wGiH^<JXv#|V}mz_PrG3-M)Fa%j^QaGH2O_k!oVly
zbv;3R8?X6e%ES$|9)-U=#EE%Z%mwkb2jWN1^6SI3MQ|;lbp_eUR2R-9QO|6(9(JLJ
zBr&f+xko|B3x+f+_ptL(OAE9lU)vT~<DMMB@H`J^d#-N_9PF35ns;nHzy$})-E%9a
zqTpTVbn=$lj~~LlO&UFW*jt%AZYy(&k#$(7hfPUa*P}31o+(CLSD4|z^1ploYQ^Rn
z9>+c1ZTn2Eh45C>(3Cc1u1MZIlS~baT1aAH#Pob+tWs=cO#EEjB&!myTS>YmP_34(
z`{Q|3Z{zJGswCs|OWiaQfV&@*!}b0bQeO|4`G!9diRhP@T>2$=<gaHmPbM{o#PU+K
zNohW*Cjr$aoK(izjlx$u#nbjiK3l_&uL`8q1)6U3l$IM}<W6pdiZQ;BvwV=<k{~v2
z>7gD@bYHVlZjjx)tifp;vxsTxSm3-@JiY0z5;fh=lu1>DOFmbWQyJ^1eY2|f_+WLG
z4-H$T=d;IuuBv^pH;>pR%adgLrTJo?ENLo={cMhBXL!@EgA8>zK4hL{*ahfsBDyEC
z&N9;c^d<V)gK`bnqpC7=oqgeBx!3voJWPeCdAV3cy%cd~b$|%LE$b;<Px8<)Cce{`
zRlpxkhM`jjF3Bk!*~JU^(#q1h$n$21^X*ewXRmhl+2gJ^<#C#;m)NGiB)}2q#Ck=o
zletapW@o-sCGYynD)8p+^ij*()E<TVm9;qh%UKrh=0cbOcfFY27w(c(&@F~?ktA)k
zH0ZsuVod(-bkznsRvO6zu4m0(3mFeS-`OOHf!s(_(%!pICl0h}w1#GfeUC7fJ}K&@
z8&l<$Zl!Kfx`tyw*v?ev7_9r~NDk1BA*L;Bpz;l9NtxiQY$OdOX;$Nw!%jacOp_*x
z0^`tTJnOZ!37*xY8dMWN+A@B2#CQ9+XmD75)6PEErk%8kogV4esX^b?G*KwJ34`nh
z72nhVEnytwAwWy)!9EY6aTXmH8Ge?NvdDCH3m?b4D>Isyx6C4qF{qXzAwuwC#1ATT
z^sGR)|9QbMMM8s6ds8`xzDL#=@4P<62!GfXY9?!XQwA5L-DagS?hosqwl9F=S}BLB
zX(ziyv)!wNKfMslr_LM9qa|+;-)EY+tP_K)(iFZd7?OE@W=Y>;ObLHbZraV=vsa3|
zv4$_4-B9rwKK*7m?)zcE4Pny{_i2FVN@YB`FNU=$suWbWur&y;s!bq;q2jiEf$p98
zqtuT-{rZ>~GXd;<*?TD3#8rM3Z$qnw_VjY8pE7xrjaVIEIar$4AIE!1;QQER(Z3ci
z4I4Xsek&*N?c|yIRRcZ#P8*1^3Ex_!G(H<|E(~QHJY!N3afxAFM$y7&gfbk77CiVW
zathUbuat&fyFS&uz>E1}s|rm~uesKS+bNtO^;%|CU=2BCAyFHj5za{PO7B+q?7K2B
zYJcUov^kjr+eccl_CRsiTgC35IWk}wW)vvn8*qX!lD(q?d`H4<tH8mRJ)QUsf_N6x
z>BIU9@wN=`V~0uL(0*1}ufbg3`-0P2q|(FA?NB8bc(EQ+cK3pdQ?mH2a;$02F0f{M
zN(3XT5*!+;SVSWXpdz|S3&X!>=ch)WIo8oH^1ZsEQU`sP5yxK9d)Uq&xi@2uHs-me
zkDk3iQv7vWqk=`U8Xjb?f~>gNOywAwl0_ORKupCdC0pDzL|Vk7AeI!}d;9{)r&Oke
zjxNG)n(xJ}Eb$Ysx|d483%lyC<Ro{=wRKj1=o#;3C!ga6VvdCSJ7ZrCZ?t=6c%j(X
zNJ}naZ0@fiZGj+qONHQg<LWx_P`3Dteuj;d1T&!u3o9iY)J96a37F_pDL-Drf{xW-
zeYSWNZX>ar?goygIS>qM3`c#y+@fhGV?5te_k9mGh+Y&W@uU0nxbJ=l;bD3Z@1v0S
z+-a^ViFPJf2v@O%5YhYntQ2$nU1^d1US$o!Q`R2Mc5iTLowzZ};pG;_WXbnEl9iO`
z5o#2}(J&=EP&Gg-13r$|trX33vd3_o>Kjtb4mhfB2r!ilIIa}3<W%yz?R->^UfoJc
zuCm3C1|jO9K1pWXwT*-W^FIdg^bY-1zH=<4kH>r6jPP=gbJR1snu=K9lfA$vdntCa
zy_79@qq4+Q*d+htcgsYylA_}+m+JV5$Iz55Hu=?8Zc{y-ND{2drKUvm`VSk+Q$2n*
zX-U8!m);eUu4RNBgod+PZ#w0=I$Id=$ZW;Qx)VAJiBmx&ywVY0U@c9Ib8ZDI&ln^e
zTdge;mAYKGu5?7^1LLP{Hs%(qlAV@;0al*?15J+luibJD*c@5nI%JX+|655!mM#Hy
z?fRJV%)_)o%Z{Og?vyWw2OnE57-|VV_R4p^vRT=DjB%hyzxYH>#o4*Rx->R*Pvy4J
zMxEFM86P-CWccxkKmQD;SP~C0Nuw7Vh~~SSof!R3@jOnZmhf>aYurFTv+0iC&h&kK
z*QgJuWfUC=l^+FI7Y6^-42lsNawuVfDCgXCxrFe3Hg;`j+9Uqck9|m!)F~}HWEK4B
zBb<d)QyTcDT(CWyluApbnoWx5cww%+pQCw7cvZBX-$E&s<Pi=<^MgJbvlsf^Mb1x<
zN@p%vYOz0vv{tU+``p-5;hBe4jg(xX1^8hOwPJ>Vz5%B5*m+q;+miR}Sj1q6;=<)G
zog*GA8n}8%Fv?P}zQTp5U-4##?%`aD<{K$+<;c>(Oj8-008$uHrURWvwi5=~xv`|n
z;eLAx>`R7E;;8o*zY=G*aFhsgu>#DZifw4M5jS*NpRyV6<&i$9a4d0U6Xh862B*In
zV3kS}1@&rtwdn2j;nUkOQ4XrO`$6x!Y(*j-6YgH!DHEymby|06`cDJlda<Y8>7$Lq
zUI4UM;M3Z`CjW6xF7dZUEq5_h$mh*(J*E_isq`qU@&h*~{-g3l`H$aPrVak!`Z^<U
zdW>E&qL1xG1yZ}WYv@jPhG?mX1_@0j`;zNt+>&9z-rcKimEvi=xT;qF538lC{1Q}8
zzrL|uvU+>UX20PrsL=o8KmID8P1qsqYOVEVdTw%{*iBn`-ns)4S0eYzOH5)+ya;7*
z)}{Pj3^eyF<ucjwQDJoRwDh4;ZP~^%ugVk*B2L}QnSK35jgX%$#VlT?LGaSPf}E2e
z)f9Zz@UvZfhA)h>S$u})y(*;#*;x#oMv5)o6)w{N8~-?(0|91hZQx!>WxzXx?q7Tb
zf>hu42#;H~RJ19=+Ihylpl$Lt1N<2<>gacvuG}0CpG^34poscoQ7MMf5rUW7cd$6H
z&;WS2jUpIWm5krQAk~0qYcM!!N;olQU$1|7)2yrt!OOq`9H$Ckf)C=%{HD;R)qe2A
z3H_Hw_$qF-B?^8k40;`|HSschtgtD3EWar{E})NC9=Nq{N87TOka)Hd)vYpaDb<oZ
ztGQ^Z&8+w%afilli$igycvY?mOa!b|lCFb3x8`fy3F0=TqS<)P349N;;W_o`>inwM
zMg)iRV@l>%#QCMMZWmbBa^#HOSf65eie;$a_syFKWEe~p!Y&P!=I-TLULqjnxADBg
z-42tk0QZ|s<P<Ev&E*z$-g$rv>t+`YZ@NaE&R9syizW#Y^PcV!gvDK@oHEd}0xk7F
zx*~Tu{tzL94%PYQIL7C_;SBonhRqaKe~+2&i><_8)xc5T6Wd47Vgvr&G-2_9lv&x>
zIfXNB_8K;F;gl}9gKxxHu{RQeqE`DYveSK|Ur6tS<2X*_izP>M9P2MV#XGL+kMVMg
z2vV(RZcS@~Ln~5>mB5i=bu^~Iq`si2nJP+dR_kCj_Fhx}SwyV%3sP@_C=W(VcFn`1
zP_A^uGVMOBc!L<+m{d(w?(ppLDed;oyPIJ>5|`GH4ePyD&oc7cnShFxT|ZCfN(mo5
zVxtaz4x!G49M^F+JY09;(vsp~#+Mfw(+>Nw<nu+=us{_kq2j36sO8`plB;e_YXY;l
zhF(irp03mv#T?*>Noz=Nar!=-2@B169!*iK@wi#VL{{gV<ItSw8-6=grSrL6Ze@Wr
zoG^01_;QO39>v!^{xX`)%TV=U)N{A;t@;f(P9a2{UUr(zrG8Y+4HGXzwOrEs74BCI
z>Dn{fRFA5{8T%6J9K%t6J2B=*1G-#buPdvBzYQ()r<^YG_|AZ8eN3f1rt(J6=@}K%
zcRtJ47@f4(>OFa;2tXRgU6LpRfdhTRI{wF$@#J@>6ZGr=G12rE;#m+>od5rh*HoUg
zVf~n1CkPvU9w>bHS3E&JVZH3h2YG(*VrhdHo=9#h0SK~h$-Wmy!gyE;lQZ2ac2DT9
zRV6dL^cPmSy{EECUSFXI_Ga$Tl=O?$I#K!;3DY;wvw5`fMllD6%ru-a=z1$U@^kJ*
zuc#E!B&HbIiD-dLRstC?cGR-z*)ECKqF%3Yfj8?b1iRTVCY13m&zpJP&$i%voHA{8
zw2{(=a6F%uXqI4nEPIaAT_<GDH=AW4Yn$*Xy2yjf-{%Y;d=b5j4xxhKE?8dPv74Xm
z^3k;~SZ0w*d}sXEUG;K0TID(c=HCH`e-Dm*V4|#hV(-}Pi&QM}dIQv(40kmC#U<Hd
zdtC!>7?EXP;E@IO-I}wHcFAq$qBBs9m_{#FJTS-l`|_Wc1ja`X;-q@uQOv{O$J)hR
z!-%&u{G<lioI4PU&|U-d+t(+?Y+)%9O!3<DLB`LX@+)Ve;vr0+ye8z33Y9F%dS4`v
z?qU0i7KkzZS@-y98g`n*SScp0Db&x}fU164!|#)a9~UKJMB#VrSnW7>`RI<T7JT0#
zC^k}`scT{*Wu5}IY7n529Z1Q{u@-PuTK~VZfO!aK)K_d971gjd*L^`pr-NHkqJP6K
zb~lpf07|Sz8*?vO{oW4^YrM!fr1k&=B9IjfGZ`xD3ULl$Q+DtrtH&BgeO?TX2p|y5
zuIzkm*`D-ng{egMbT$>as$Wk(dlZ~nS}f^Dx8MnV6ubO%Z>xL3$8ifY<mjSx;3ro~
zms4DNncWIHe$>&k`zjNckjJe97N}uP8VQ?Z@A6O|n_c4Z=f3IHqLn)c!j$jVYguuD
z^jFvT`}BtnF$<|FM&w-`m4cO&>!q2GieK|L4*+O(XOZsl_vKj&ajLKJgLy2ZCb1F`
zzE-oSc5V*!6Mi6CMrV=2Br}SlCARuO_h_&Ss%Da`BA{_o&34bd;bU~#cfcVmi~vNx
z6HaeFLGZh|p-o`xB3AdnmMOeI6kdt*`OTWHtiOGEgKp~MRZ<!5Yg0mrx47pC6}2@Y
zxpqs->4jjW>-tm(#mgW*UT$H8e|eC^1A*#guqX|NL?fjznv`i@;GSi_)Mhw$XZhB(
zDZ4c7Tp=EKlbOnpnbr$Ow>+510BR9%GdJr+$Ui-mt$s$g8!)_(B4N?c8n1k@K)O0Z
zVzjZ*`POSiulnt#vS$pV3dRbXo8hn5a8sP&0I<+UQQcZVN$M#4`x`}lzkt(nEAzmb
zb0{=K2+0(B`qTB5$(xHa1Ay^DKpTzr4^DmuatsR$E=(RLpd^wU;uKCO+s%7o(OT7{
zF*%K^O#sOt%!AuR!y`1%15p@R6cvw&gR>ZlkM-sMEXLJR5X$9>t5_`s*gX%TII~=o
z^;^8BW64yB)Y-)>Wn>j;dM~p$M!b(`O^lXsW!aVEn=2tn>gFI*qgdxC`uN0-JxloU
z``)K@vpx1nf_*k1SA~j;nWwwiGsD>m^M-pd6RcO(@82fOL$v$s%S$c*98gB_AX<bn
zTF8LcZ+lg`t)P1JZ3R>tN4U*W)DpMyT0y<U+K2)gBjHNToQxbCWC@OFnDKqX<);$n
zcAO+8eevZr)ZJ4FA*ZJp3M7euoLvl45C+=8J(_)JDufaJEA|B)xF0d3A;NIB5~#Z}
zbf2iXnE)h(GJr8b>H|0shHHk-E$Fsc(GYc_>?0(T9Oc`0u8w;&<>RTac-TXpAh1vQ
zq~QZGuuT^qYkufkSu050)AyeP$h|fei6>TPl^?H^>+W8xdP7#FpiPQx^z$v6%`($C
zPHQGVZRADx*zogkv6!)#ildo?IdAD1Yv!|cDKW&Lp#wA%U=*yIC@nqXkUvVnU>;*c
zlW#qoF*wAd=EP?_Ex2Vdmtaun_&tzoJlg~20q=j_41aMF+{%pEh0(^HT31FJT{03p
z3futX14HqPs`%$l`<6Al-6w>1e*Pn1{DM+^I9>ua&E)mtOS7^a0;f;Cf^^o^X!@-x
zPMce9Q!}6{usO2sl)iFcO%OP(_Gi0JvcN{W*|y;6;MJE?S|9{GtA}hO7CNk(no$WH
zRA+@VvZ5iN^#EVSJ@XWEMNK;8l#7{CvKyNxzpvHMzmj=E?ExPUXN0J<Rc_*6Ab^OK
z7}xNXoaNs>dA)=1UQ<G4S}1K@eP!*el&i@_6a404lP*z12(R2?<Hec!EEG0LG5xL0
z1v#%QfExF?rE9M%p&~+n6@ibc<JTNIhNY1;L~99iS3^H)aQ-ZK+6&aH)Rrl+*n|_U
z>WjuJ$SK0QmE@GYp<`ctK~FF!U_^*W8?>~$`#MBR!hj?+{<fb#d3jk=89kV^%)Vel
z%4tnIXEKoXOC1VyQ62reNVDDLmH<I++G3x5K{QE2vwd@l6v0d9k5$Y7kG&4pF3yRA
zH9n>nYC&fKroLE4Xw#JM{W5xTCKSP>efGzPg8SxJLtLK`xd}uk{XM2IDRm03L_f)h
zI*2;hj304J=3o^^fcx9O8vvKLCzjTtXJ7Damx%q|b`}tcD}Z5CkB%Q?8@3eM?_CAK
zj*JOjL;B@r<g1z}KpOohz)g*xRq}&4a~s5&Z2<f6!AgD&rf%i*=c-a~xAk&UAwc0_
z%9D;??g*iUoz1{z@W`#iRUF)ZV1rdkskrO1gajIM!fxIVp;+OcpaCMys@!N`rEH?(
zRZj!?AX%*pE{*G&@-qn`(<OTd#lMUc7Q=a(4O#L(q}z|PVDh+Sz#0_{pO*0EJ$d1u
ztpI~09NNzpYs;?FY%RT_k2pV1MGJm>oAWJ*7wUE`MxV+`<c4>R!b-cCyqVYl-fY7}
zL8Yo!Cl6WjlWzb9e`>Y$2!^=uC~18tV-vAqQ8)W6BVQtV>{{vR%D}c4;(g}Ua^mTQ
zV`ssIg)+oF08Cf5;{sK$GCuEgU!VecdSUFIJd3yE2kiELb6uwyRi4vX`X`0B@O95{
z82S7q&J*U1T<vtXta`f4pDwzrRXR!38VcJq#qcac`v!3I9NkUCCzqg2`gx!;_17_3
z!@MyTCvC3S&wepW#cj@Xi-?I&qTVFUS2)=ye#jLpGeXjHi_{fwXO;+E+kVuC$Kagi
zaprN|_U6ebW-&`jT7$L6sZ-z1sX&*vYMYk<6qEtJ7zy{vA>NpHI~j;3-Y)6er?~t{
zRp7?JgE)?L2UBr2NB#8V$-GNSvjka@+0<vdSltTlm2Oyklj|+&XrqZRVB4Ew8Diwk
zED~J0Ujdh9KF)J^7?g%K4-0%1;(8)@oycUIk|uU$t=*j_fbQ#n?-w2E8O9-SwEi(A
z7a%<y@46*W6(s_)s6A{O0Q0ET5deJ^jJSm|1<BA@2#xO0`0{7tkMx1)!>D{kNG6Q+
zup!kuFPHV)wuX4<RS3=Ea-v&zo{5WQ^GE+-(?9<ADTCCMWxqWW7+3C(KoQ07&r6f_
z3y5I2yQX8TZd0vNPzqvP|K)zGrPC5`!+Sdqc?LNIc}|55`LNai=-`vb@oV}k$2x)=
zyBBn>xD3DT+kzzJ?{D6h^==Naz6?zI_LN2Cfo+-meFXrzIxOG=m6c#lS53+Yi{jNd
zuLeh+8N8x*m;lkhfW;~c2w2M&;Ehz@`^p@o++ayDi()C7?W-4+Pl^Hq`#+s{4R?*Z
z5C4TYh#!>q4v*+9ka4cEsMj5>J(yy%X#7xn^IiUQy*@zL8NinL2~m$_gcF}2j*45v
zoVam6gC~6img5&RHvnenK-mJw6evo+guDZgx!m+bp*rLX>{_6J)CSZNIEV%Tw%34I
zKDn(AW+erKt2B}vsm(TqTx!b08V`Hi`Uv%_3g7;+^8~UaiZyO6GTLY?>$h9RvtR{a
zad2MU3hhz(&Gw33m1`x);GVF^ca<YxHQIQ%V^1tgS5^XnEf}&CMPrnFEj9_Rs-6aa
z7DIsxcAiV)rDSi*p6X>DPPbfY+B?oBq4@#DFxDvNrpZCr&|@9C^+wn<eUy+exxO8-
zQU7*e##&bh4QY-g8OQ$dQ)$z_4fLZMJ$Ec7%B+ul3`;ny$%uGG72To?2t-FRe`}^4
z_>nMZ4*(M$e74I~m&`c>tlbMhg#v8w@YmX^`oDJBEW}~=^BwXPbG}r{CuRt@g#6PC
z<ey-An<%uoT?j2~9tX$By$I~jI>ZwlCh;4dKP-Je^fVivI^;EcPI^c`ppIGHsNLs9
zPaM-Ks3%26N*BKdJINK#NM$%GA+~8d41IEky;0{8lIKQP3InrC2pKHZQME5@_K?3A
z=S)Z&bsY~=e6%M#?mkeXTnKduP*phbU7E^EFcN*Bp>EdQ2UuPd4Fpu1a)UDAwk)t;
z-eg3qVHF=5e82&_W|NZVjg6I<Nq#2_3-j`Zvff?#GMeosz*ogR@)?E<5@(C%>{eta
zDBEo$s{YR6(?pleP9t2RK)=I*h`$@Nn}LJtQz9s6?e`_ADRGX?%5^bED%1wqtsBrg
z_}dq_v%>vYL&>_H@fv*Y{=Mb&hj+u9l=~J^lbP^0!#WUDbC9G6l#aFGb)NLUeW~MT
zf#_?ZBvkw?{1e})X%Nmlw9~wE;Y3BCbwIT;rV{9ozwG{+YseCiG~=_V|E#J0wvP^|
zd!9uHggOtff<C$T5j9@X4*-_uLinHdz%`6<?UzK6S9H`yoBNqPGJ&W9jb|&MI09vd
zxOd~;`)AT<P}Oe(GFT%VpHYsITw5rB_Qf~@kx5OwgH7*eIwAd6;PC%ffZ@eP!J?Q(
zdi4g9*}&({#|{5eNjWyMY4(iYu+J?czk#!vt5q9pqVrQpG^K{{-uf`d;|C&9=E?wt
znb<wc?X#}Uahi>mYl%$ueReGje`c@ES>Ld+i+Pl^?4Vph)&7HW#U^#ZWGRua4nHz?
zyu_HJB!05wXWxZ^s*vy7&gw|J4$%6%j2Fw)y+ChuW>X8SsuRoS6Mg^buDdh+wifs3
z`v{3V5PLcjq8#k4wI#lGwd$QcX2v(IfUSr~eTD#dcCI2J`?3I&o41+|B7UW)AhJ*c
zS7rv@3$j>Xc<mjNIO;LTuW~b3^MMC9Liia@WZRPi?4bJr7*>J|8>Kz7iBl+%hk^Y(
zSep3Zb#wJ*MwQ#`H`WEm3`{r|TtI0QaY&;~D8igW_U)e>9t3x3BxwE*+fCyVun^Lv
zSZQ5RZCDM7z7k0E`RUuW(6g;1tG%t2VsunF5*5)gV-0iF2HC?J3-Q5+N!36Pr677&
za#-!+*O5{!*|TN3IZN_!6%}M^#n-rzw0R`u{NM-J|K+XVP5*FN9kA>M>&u*OLWv<@
z!sk&~qo*w7L|F;6f@G`zCucO+`kH&k5VAjl?w~=4Ok0(CcHsV;<FeH2qf)rXZ!I_U
z95?BB4axHpH*O6oyzkjHe)fwme2DtJlH-<H3`BLaz<Z(e-MFQcd0!~;Nt#=V5`hMU
zRvx|F1`z%D&dVAEAIOM=n5WE$i4eXPS);U_FtFwluHXWbNQbcL=D;yQM@2$N#u$>I
zVbIoxMb1_|v+>TDCAAvek;|RP#KxI|%B>G_w>TE)gLNg6_>ClW{1!^8xb#Y@TGUsn
zS*Bcyem)<lLQ387_^?}aQvhuRbt+Rz)dKPpVZD`RDZEwDFfvAhJ8}VY>`nyau)jjC
zXzBajC&yb|_9o&{#b(LI(Z+c=0>VJgC*coa%hzy?8Q;~VjK;jdjXRPVkOkAhLzc^R
zqcwlvAhAP+2Y>k}NlB~S$qas>@~?mGWVsh0qUwN1tIgye&Kp88atgG&_aROZBC3HN
zGX!*Dxg<6KlWqbRr@kOi){4ad*WGF}Fma&%p=>&TbA)d1y_EDGncFD3ggg^54_U)*
z<ktca3g;$&kl7+Hm4!MjMnNa)M9T*D^(KUwXEjh0;wmP%xgaz+;a`JIxr3iqQ+@+x
zP303^moBe-uA919D$?Ow>FJ`7bWGf@(10fKKQ5}n{K9<fpmOZL90xZAZmdNlG%Q-&
z_vO*?LqID*M2ct~PohN`CI9Iz9z1JZ%ADihLW#>XUQLclZR8S}Xv2l++A3Ug2yIN~
znHk@v9Q6f{I}PkKpVZw2<I8Oc9ozdtW`Ny%h6Ib&&?47#M0$Jb+LLLw`P177<u>li
z%IW$*fw9DxE{gRORvYfKB~AY^dDs1lHhLK$Uu*z$Hz3Mr1H|MB$O+UMx**g@Vr?8?
zgYvG3hY-P*zrS-u$Hq4ydDqegG`a`;c`a}a^dK=;Vhu$Nsdt`uMv%{IgV5%BJqI2`
z!=fku^VEKJK^yL<>bSwnjWU`=BfFsAQwSs6^2Zi4U0~%~Z*T{m`KRU`z>6*rMleTq
zDT%Ufvv&I3@$Nki!Gj3wTjeWHlq@^<^=iGk^*gD_0duT8{VhX)Ro$$ru}H%&T#9v`
zb54q}zf#an_cYt2Pp^P}ep=S}B<F??ZCfnGG$qwo5xNPm3MvI<bSF+|5p%YlubRyC
znfv_o##i6)gwGDP=YygGNXB*Fa@4mQ>L!?EGB|mvUm9(st`lYI(q2#?rO>#Fbq1*r
zFcBaJkH^>Ug8;aKH$~u6oDwO@r@#vwRPIw%vMvM(jjb+{#Iz%%Bf3jz5HBc9iMg)%
z4Z;728e$-7kc0r?S6I<}+fNYxGGJb9#Qrb7p9*FiLc6yxz|n=P-R7&l`%UGB+}v*7
z&u;A%1C2g*FmLA=EifG~a?!+8qnZ{{K-I$wUzYF3-^XUWTSyJ^smD?Cv=j+G$x=*@
z=b>@4=3gxMs1KqgYA6pKpNBSi_hLU;4#ko_7TA;ZH3&nVX1~qp##IgA%`am_d9_4G
z)c(3L*I;pn7q)je2n+Rv&JEf?9_R%m!mBb9Njx#uI)1#88M*qWE9qWK!BO>{gZLC=
z3Hqy}$6gakPbyT3(Y~KPF?T$ln`vOYk>Lxx$*or3hjc^!h*5uJt4pVN`r$Dk=&BU8
z+Fh{ZUBKf7-mHW0_GWhvSV*}@8DQn|E1vaDA<kzPX?Kx7#9iRGvlulwNsRg8yKvkx
z!5pj-9k-ccO!lB6Fb#kJL0JS&{XFvd=OND>d~1;HHl>ipaIr10FMu;{I}`<jY<B*f
zl;LKB-jX$;O+h4$ps4*ff`IXV-rkzV$YMNCV@%`?b`b!!`y&)&TyXuQF>UU`KD$7X
zVTP$?q=NT&E<JOs-PV+)4_p)ETUZG)wJ1h7E+wLO+B_XG<v>X(Lr_6iY@p6}t4AFg
zP4&ttv?KrY;Eh5(D6D56Ae=zDjA}E`Y?ROzEZ1w-U05Y1@iqeyxe<=4xT0&r3m~Wa
zTs%dfgdDD|K51wt={gL`wSR>V{}3VETy`em<2U#$s{f<E5DcV4fcO6tZq8JokrE+i
z<4k?Pxgb6CG;nod+?_GdL(J?vxIh_)(Sj`kpJx8Zo_peH6yYY1O%Sy?eXJFn*MUWE
zzY|0Vx48`JQpBLHO*w6Uyp3MIby0>QVPjFD{k5)EYt3^=+LQHrFOc#agb*-Euh*X+
zk~fQ)KC&8w5t(fJf-XS+U5G^Gs&>Q?*}B34gffHJPy#NDZXM(?cj0fCmws1KhqEGs
zY|w+jb4`JrKUcAhKmG6zO~(B(0A3J`#G*tHw~y3&IL%iAs{iTg-hL!O6QsW9Ab2JL
zsUy@omsIF28A}PVp4kCkQ<Ow5si-pAW+}He!ez<?*s8b|N#Cm3Rq_2xE8XOm)H>U|
zDc(`1)83^DY3>Hm`RsPMBUvkDTh-(d>sfKmMI?>jX0U&OB2?LYF?0KG@czCT2pxdw
zoCo&*xrlUN>kgBiJ<Ir8I<w-a&nllMA5yuCZR)MyN}KT|x8!N5U5|72e%R6R><0q#
zPrUU*e*={2JV*P_Gtf`^7p>da+Vx-L_Up&!uDAugQQBZ0{ll`i(eWWr+nQ)Ai~Rj_
z3r{?pSt8Ndts%N_%hqGZcd7;(yB#xt2regi<se%<`p`+Jw!yr5n?Vu>K(PS|;Ut(Z
ze&`@@X`YG@uR-(;oW(g3Uu?XRU%*06$95sek*w$Mqh&}jvoA<7&sR!=#^(2~b6>Z^
z=3IZszf>6cXWW;f&s8mC^Yv?-m9t&3bj$JJf<iG>3pq`Wj`(uvKG&XSN`&mABxwYm
zY5+WK8K^)`itDbPqQoeWsu<#}qa+^WqCRbB2I$-YzqdEKsr@c+bAC#|UGV<6-eI=5
zjG~7UsqRDz4F2Vb%55t+r7ZY0mV8FIDoe|k6Z~_WyYlwcn2U0}(n+5V4LLCbc9?VM
z545B~Jp?EEy!d5xJ!XM5GJc>sVIeSoH4|!UQ{Z(gHlS<}$c)eImsR<#4Zfltg=wTt
zL8%~kWf2T&8fcS&jX;DfN(l{(HA0Ha3j+etDAwU;v$0J(d-<EMJzjUJv?(8?vb1yu
z)~{dzNZKCu&7ZL$_?1wU3yh(KKqSD$J<v0ThD3ebOwg~0?m-k#trviEWxiqkAYNwx
zK{X%&$J-&_)!gI@uF|qV$vA;DV^EZL@!^2pS<|ykA6*w}&U(>2%kLf~iIH{3Ul9<Z
z+>8+AkHj@ZlRxs>^%c?GY=y{pB7Ve~Xc0s%xad{6?F_@az??(GzoxHe84~X|O}LYH
z_R*Slrkiu(WYE8t;op%f>nzh@s*&0wKNYe{4QCKd)eUTWBv1EtuX78J%vDW(>X*t9
zRau2sA5*-qA%k?XO3doCQ*qw3BFzm_8q8d}!?lh}BA}D16`*$XTnlXqAgS4_d(e2&
zXA)OJ-z#>o9BMHAWuHH$dwDvPNQp2X4xhr%o)^yvYqpE4@G-r-mf9C6Sx^ZZy^gD)
zo!bub0^#N+u3rw=hKGcSl0`aQ#q?v3Z;(cMSVU6bI9GM|%cVp3rxn^Xd&3=*?o~O2
zfndZR_5t{<3vJTx^`F<!A}QH}%+=*|*FJHs_X2=i)oUY>;pmqYZJkSMsm!!VF`||9
z`fg&4&Fq>mV{S~>h)rX7%2^x;LOOe7BACcvljJ!$nyc}NP@Wf6F;70ylT8rYup2oi
zlpS&fz5D+o<NL`?pwN@+*fv@#k#!4b<eq<0K)+nf(_EoA*Ppo}E)_8dHUb+M`7pwd
zjeM^+j!mygSoep&P@{ZOyz?V4(DnMDF1?y5PPBUf@C(F@fk3RF?*blY8VSBg51BtV
zOX>=aE)S{tk<JV#z280tt37)kQ`!Kn0jY<+7%W-0`VLCTMuQUrLDU-jzU?5!Fd`r^
zhISZdVix?^{l+6<mXnLrN>9qAdx0B^(erDNV%AZGIB^%l^ZC<X?*i<h3%b(>V(J!-
zZrIrPR$!juYrIo<V<n~(8zgN~HaC<02=_zGYb(7xuxSv-@k;0Ko8wGMl2QtEId6xw
zW+eND8Z#CIse0LB4bK;W9Dn;BDPuhR?-}<{pd0A`5K&{s_TwRl9n|FQF9}3628pSk
z`Toe`+ot*|Q_ZB<i}v3eZRN@*ukV8_z|$UodHkvUl|x3vg)@n__>QU~@F<y7F$CHQ
z0Ott}LEuM0XrDhekJ1~LS}gcviLmB*JwTYw2-4f;gH+5D4Om4O@%~;%*@*N@Tp5J<
z(G?S2i6T*&B2m8TPkc+$Z*vrB1u|iboyQ=4{}*9Co%z4)ITGKq+d#yui$pbuo%iZh
ze@rQe&IgKKxnViEpzXFZv)WsOc1;F$OC*zGM;mDpZvlS%AU~3x4ey_g7JOuKM_cro
zSgb?HRhj*Y`zqZw`_ZFe=L8d}^i5N!lCD`moaX{U0tHVMTggH(MhDdVi~i}^Xo7kn
zdi~)6rhy}ARqWWKjfusYk6O}38|{E+^#I1>cA+ZSKg*<tjYw5CP2<E^BmBoIKS=+f
zS>DfGAvEu@MK^eqs^x7WPMpz?J;!M9rq)ti4M2=ECH7VtsxnIW%Wmh%{wVoElTpCy
z{ipIHO9P0@ybqE$fWDsNj^0E)51T<4)xJI@jJ)d@L+31G`^H`}t9~+b?0P={Lu|Ne
zWYG#g!boYJmk~ZY%oxWbcy(qY!2BJBrbrS6+PvrCah}4TEXS8O2pm;~Q12x9JcLib
zitP|+2y&oT6RgHirJ`t~7)5z|dSUCu?}hGfaV10!Yy?fCz=ut&5I-<?d7li<NoLg5
z)-$54xCvCHT6PdUY%a}gphv}>u)f?R+L!klC#eEKM9lNN*Ce!vuAn~Hg~*Zlh(e4x
z7SZFW&6&P()#pl6k@WA1-k;)`#-gV`<aUWa)xQ2;d`~?2@HbamN8ce+lQG9h<4vjX
zuwN6KBP}qrR0DAqTyX(fNnEk`eG@w%PxteV^MaT<q?>sJ_&w?8Z2@-a%eY@-K{WpF
zMmu+KUS$909hc@s)7(1|ld0vD0x{S05clt@_mFERU>sL1zGHa|Bwal145=DL4z@Dx
zS-KZ|BAg;He8hFZ68n!_pWd<>%K;HRXv`EF*2>IR(b`;4yf2E`1Y>?F`{^T~r?u;V
zT`eF22vr45K-ExQv6!R^szIiQDBbr_pG&htFa^0fOon@FNbW?7>C1N--LW*D1G@t+
zc;_}XaHM24SQ`3vGJ8A=l2=-$m>q*$9jKLgB|*b1XqjRop<?8x&DOf2p}dp!-FD>{
zJcl;z>t1s_MOou>6CB1WG#=s;8D$X(P{H$ZRq@?y8+-=jI3bsFy^2$DtqQiAiNj;$
z0teIj7pY?e!sTNo&VO6W^<@#S%4{FyzLlL0PSU4cw1?eNW%MN=>z^0v=L7RUFV1-1
zqYGSUiv6_^_xZd)z)yJviYB;HXAo=vnh!#O#24TDh%tqf70L}D@66p50D%Nhdffj}
zCR9_@q&$KA{o?q%BkS*8F4U)ZVyOtN0CA|hdjW}U2k7Pe05%K_ht+^07S@eufM8rD
zGwM?fkv)K53F5jU?o5J|{RaojyLsH_)(=F~3c@9BD!L(fm`>=sp3MbF&#(ScVnV2k
z`wNooraWYOnNhyFO-zewkMX>w98PctU!0yxx-%;PI4H<6Nmk1M@@hMaRI#dBZ@$dE
zO|F|lJlY1tdEwE{kUg;QEd>LjAz?n!5OLlxVMRuf1XoCe7DeKeJN$9K*3ScLQ|9^H
z3fS|vJ*IDFiN~{t=Ziz}-*6Sxs$IZLweAt3z9VE0!or)03P^!8KHK$ikS`r=+HvI4
zsSmh`k!2QWzXcH7-oQRR7+Xl~VExI>+5J!&bLrRhD0}i6(XUxz8LI&3tb&(&$Nrk`
z6*<Fk%Xud+Y~s;=nNTptAq%CI2s|!Rxwzw!>$n@2qb-{(th8MNn&bq;<L*Jct|wQ*
ze1-&j$a4PTs`%_cQdpo5l0q+_1*W5{MK|XvS(NuyZs?U%w}9?BBshm33-s9hp$OPb
zj9IW#!zShXYCmtZx7i55nZ5Pfky71*;+F)r&T3q1dNMZ!@^-IEK}jURi9uqVs<u?Z
z$9_==v}ZRyTKnF2-90(|Se368E?W2GCS0+^q@UqcW1ISKdwaM#c*v6cmbBvnC$7+D
zUY;;Dz-A!U4uf@+FZu(7sp;1%g&KotmmhyF*ax=vYvV)<iW}B}wQ}Xp+}nU0=C`w7
znIUfTPqv*aci;~B72W-NH__Ylm<MPR21Y>`Q=ZVUW$$ol?(~$uOpVG`dz+FibuuFe
zOd*T~vdZ~@aM=S$WB-aLey<ogZA8HXx0v531n-ag61(!6WT_oq*eYrCI-%I!LNC^`
zO@GaCVok`%Ndg6O+8hJfmzV~p@SKu4N44hz8mUyN4I6sDZ`&iYN`DjWcvz3qO|3^W
zAW5d#f(SYHDdcrNU(&6wZe70^^6QLz6$!`Wu}W%PZ!{~RN<!96M{3k^So;sy;T42Z
zM34?Z-C*xmuAJXGN1B<P=e4J;VzRHURdJFETIp_Z)2oIlz@l!2IM-1=NO^`eFst&u
z;X>3$Ubbe$W6^dM8O=qnS&$gbUe+)sE<$h}et|*+;B39%Yk(uL0~A`IFtvlsPgMXi
z-VXE?w73EHgm&9i?FY3(dZ89K5kdE2+7~>~3Xj|E2OX!AZ>2FDy(A5t*7S~FCAM=_
zb%-XrCH`^Br~V8-Nn}#YDpKju^^xl<QQ`;fv4|c$YYs(YE2t1^W^cqm4GFZONn-M_
z!2%_NHY43kRBzU6a4_qO3Ov(M#Ulf9Kg#phV!(A-qa5B!6#pTrDO0r}%(29g^!5Rv
z6#WV#1>w!*w^kgTF&HQpND(+Vxl%6D`7?EHO&2)<1q#T|fWAJ0p)4!%l{Nx+ii_I0
z*YqJsa7qSPKM&SH?$~%5l0SQ=<qt9^Tz_KtpDM^F`@!b9UJQ9Su20kJ9e+xJIf4Jw
zL%>nKbtlny0+P5}1)qn??Z>_~NtsK}CVd3~5_fml4^iJgYXoc_ds`?3X&m=q$QeUE
z2Z;#0b{fv>_Fyv#Fhrn01zrj*NF7`XN`mXL{z*-5(}T4IYp6Sk6ql#HF#^V_F&~-*
zcd56Y`B1uBn(Z1U+b7aQ7JT%lNEG9sIprj$P*_CfPlAkY^X3$4EcISy%cV3e5e=ET
z#<a1<{X3c_TW=XF9`1b+DyibO+#=nWW}~+$CSF%8qbW6Rou7<`j8FSnQPysjg3Rsz
z<Lt`=p<ciLXETgFlr<)dr6zlpvJ5I~NOhx>AzGEC1!bABmKJL$vP9dx-JAAA%+NxF
z=$4SC5-A~MXMX1y+V1^)e&6r!_lM(I&a=GV^DO7Qo^zhJoV9_X_0fmi`R_!CM>cMr
z-qpj+_3yluI_GVE+iyq3#opUggByl;rH(LV-L}b7uU3Z;#;?}e`>tBHWzJAT-Dw{A
z(h(<f)b3cKsOpiYZg2{;m0)%Q%nZ!ZmVo~c2(L;ax?2qr6d!MwGD`!WRE>hwFk+9L
zjn@O~E?>wv{rM7LtSC?_!?m$KrVr^)hQV$CWS9xwJswyv@>{f|L9N%qebbx8oJ0kt
z^}u1p4Ny^o-0`#V&!OfUD+@m4UvJewpuN%A`0epc+b<>`Fg_k9*LM?;*6Z6ZC2v=F
zYJKDWjvLQxMYk;%duo#npee)+p2?sd9b5U-S{GV=0F_BWg81UVJ<EBqv|Kbi$e=<s
zrwkr(g2QaB1x*a|VP!YrY3hcD+o9)Y9kP$d=|Vq_u0d|Q#{v3VBKP3!GnDY@TjVa}
z?0VX_rB>!RJ<uw{*n}Raw-W3Oj)AYW`e1}^8C!38vCQiaBVAdtyB;o@@S?69t~{-K
zP3bw<0t6j<(3YD55E+1$aM%#n(LODIXibGd0J&xXRe5<Uy!5ndTA=m0OIwPa^V0``
zB@1jE9vdP<b~uLN{Q+RPV;A6;0Amfgd{C*Y6Oic!>=?gt{4luQe7U)uJql2Fq2U42
zLpaO~q=LP}d?&!nU%fH-kZ<}NijVanC}u4{Quk@kYV0&NJula<tI%iF``}I)RKbo4
z9>JjRsmOGnJ1qdp;q2d>fd-@+-axA1ZloISa>%ABZrJ#?@VkQe1f3PV1AgE=0d5s=
zD3@%y+~Vz||6<m5hiqF#xe{==0OWNf0-(Y>STZ4>yrC&V;xK?g3RKn$41aQ7>YUfs
zt#<2>>*5^b$QbiB^N3`=vB8{e*49f-qu}m)t2LaOCXNd{(3MoT3ItD^xO9UJ{!$6n
zl7YizYCCT1luBr#!!-!t*O)UnJ=R&fZIQ?X7+E5@{{lL&T!Sp|H4(;?hGcj9{sx}z
zfb?2{D7V#v#h=P``Q&xLfQ*lXpH^HvV`MX=|F@akU%aF0xb{mkV5#_&<Nic2d4(Mi
zIqvct93MXaCv3V4Araq=4Sx>g--MEX{t58I<x0Tl@}I#L2l#2+UsA>a;5qGZ(j2Vn
z-j2F`=xVwJKb<?zHw=+Yx6mpDrcRAl0&R5Khv9T%NqZC+G8_ao0Gzb`MZhe1i5eI$
z&;0F1zG7gn{@6a7Nk#;z3(N=Ii+FAh=n&f*+%2pgwMP1ezVF*Xw>YGZB`h#ob_JiH
zuOE2O?s&!uhvS~JPM6?Fxp+yVAyI1E*0+RN0%!cRz^!UPhOt{pRVXRC?V;$WsO+u^
zYt~XcmFRw>HvY3RIAx;a=pV$_2&^387jgyP60Tfi+N%;0Mo0L5!@0Ej=~RmE<5Iph
zg@@$(W7}@*-U42*@VDuq>dIDd+-wE0*mQaBrQYp_pQ7Nen%#HbhV9MZ>2S7w?IJK6
z1|wpgzblUwP*k>c(;hgK0b~h5kF)+>iRgfC3)18gqV)MD#oHsV7Ved_+Jl`tuVQqx
zs$6t=%l2S&I%pt>+!_J!8U{PTar?I(+UN3*TQ_C)H~5@8cYL1_z_<vS{eeayq-qv~
z0_;B$%!Bfe^PC?6#-#!8@<8C_8I?V_3U;-|t>?dJ)WOXh$m+sUYPY81R<Ch?$EwAI
z`!5(7PrO6I`rm%=wW*Z(^ZpTp!_GnQ>`(i<+Yw2$hbt$n(RhfDYg!XO$X$Hsb$eON
zmksDQFu!$_Wqnf=>;k?K70<(;--6B~Z376kvEIrOSteWnu$7?r`+jh&<&lrKD_^Fy
zAzM)7YCp*-vH1ErbITxIUqr(_jcUc^ttL0&f&g&*`Q;B5FTeOTpf@bb#_=Q|FsM>-
zVk#zl4p<nK+|ryu_X8V@*0X%?+-}g1t-wD7aVmTztYe=8<lwr5ITv`slL&Yt9&T~~
zSqjig9u9$!kl`Dm$zWjDcPJU&OaELe8Lr~)U0@mZ9GrqCpN@VOSh*1v(3|KSX%_`f
zsGi${%J}CdWTAiJPq<g$7A#{=Cl12NBJ?^O-Ejc+hLCSZNCrYh5I1_YS3z`Aod=@R
zeWcmBArq&gdrukz-0z1c3$thee;D<Y%a~cQ7AM6ie;5ifPfV}3MKUkQ*)upf&o&tW
z=7a|!-p2m(>ni<UegTV)CZ0Kr@3+I6Urz17st9f-L4d*cGn`KW$U_wl2QF8h>Tme4
zH5(lm_0(BQBLgltXQ%m{6UV)P3$!M*rFLPtRy2j-zU>E(gG7d!__y}4Z*>8>*#wPF
zBy|D4KI2dVE*Z0@M(FVAZnr;A-<Um7LY;)F_9`x|F??&#m46+?>b;5wZT#i$c@1?f
zF-KQrz{NIv?9<*Ut!uc)O}KGMJ6JMeM=ec<2BRk<O^3pVTH80se11JTXXPJ(F;91b
zQM;Ut%%2ajD@*2Fz&_0QTL$2BFj@zN@7S&Tnvg3AjImF5dO&bJF!DV->a=zvg4X$E
zb{}ctmBRyTw?M()qs9-4HH)L=F-$N=S-eRiCTz-x`1ZJX6T@Ox<k@v)XS>gzrpW9#
z?jEHJru}T0dfZ{_hogfxdtZA^p3sUGn9>nb=lhjVL`*=8Z<z;o0>IxMuoUWiQ;3BV
zh8-;M>LTg@goHgdJVza^)8GE$>0uk+t@!44vGMn`)<`|+B&&J-DpU6h6m4qYxL4HU
zSI6n^fcd`zFOd$%Qz3sv<0H<)F`^-Yj0}I)!yNp%@RJ^CN{m<Z4R(ah4rf{W{LjcO
z{tRtz#tF6ScyzzOPpAh1Iu=Z<T7rD9VT66ZVggQnkZ(3t`TNPwzXRXTg1(RO?}0W-
z9XdFLEru-c&_L|vzUd>flNNWthOLs-c%!iE!h(k^xRt=k=NQ*U@O4z+KmFFgryq{v
z6i<Wx4Ibrs>lpD{k>}4=`M{+|zW7WQrGgHx4ydCuAc_&-2E^M?V1a`dg%Nv#{DZ!c
zGKqqzHA?*rAdK9?iYIu1RScB?Rx!Hs7;nKUrlZq`@){sa1PUO406+|+pK0;11|Enp
z9~rdH#+w9J?t+8nn}C<MxUs>^Ulz>Bh{uLb?c@hRO}S1K@Dhn_5Y}>k@R^|~xH#~D
zGT4{RJC?XY2#IQ6uJBB_XZ*$}iyD~|aGSMiCR`?|Fz8O0ju@Y@$d^NiFf!c#T^Fvv
zNze)$jxt@lMQ$V5_b=8z{V-j2)s`ASj(t`(Y0OnWzj~pQW5L?&%$1jnb;0_^TkhQ3
z`v&$8j_gQFko?9l?Rl(^BGPprelTKm;A>|-0+i#JG6J`J)Wt7xAG@;HY=a`DR}u5x
zVasrFt<CKmM;(uc!?<lxZ?rf{*@{Q3T0dox(*GDGP~WX!>22ntzB>|{5~bW}Cy<b-
zF00|4vpnx`XbJ-oFpw~&?wxZ#7ZM^MVU&~^Oqm!Gka_rNuFkO+HgEyHC)WSnR9Xw~
zYI_1Z-G>RF^6{};hL>DJS7!a$KCh(Ps>40Wm3r+e@xG<&MQcJf!k@CUg!A$oLe62+
z>Sc36C4!X)R6j58uxmb2m3mn+S$(y-vU7?PFq~=atL@YG))rX0$y+SQDWf?$vxzcH
ze!uUCnSjYAZ+{=tt44Y`%_Wp<>jW@}0lN?JKf8Z>w*$JcSni7#zB1WYpjL$1D<bRM
zCa;$>c~IQn)m!m?R$3<iaSEl=a*N%O&;~bG@69zK|N2ujNMBwX{V?S)a7gHi$vG$^
z{`;lY4-e`3mqaODtT{Hmsf7RI(t_dKjgOAqjXXcEl=UTkX~|dBza95rKq@m#eOJ&u
zee|p6Gfh5ivVbt5)2nOE#?n7pRc{{pv+0z>)cIQkg$s9S<ba(5mrU$-7e80M`Tp_k
zlQ?YIpAxRc)d_pe&Rm%c{(L7#YyIX+((2-28#mg{?V$u5w|kMk==Jl(;+$4J%XqfM
zQMFN>;fuSE{^pWFzuz&TXSuohy>HaLpyMqE{8B&Fm`{F9+6gzx;dKR8tlwF<Z4bBl
zE)5@XjVUl7;6q*T+6~Kcib$U;-V<{2K#!sNWri33WnnTgXO*Bv=eCmvK0Y_u!l$6`
zCd&{uJtdV?+qdv@^KK`1Y)$qRN0wf{hcf*XFKN#yhVL0((pqJ@`z|PWYi|vK`YFs8
zm(JWKfvsuz<HnZT+(i?%H+fJy*n#r>apO6>pvE;j63jP~1)@X5hsLNyJ^m|$?&a{M
zGw0Z0YvgVSyFD-V<)iLu(1Yu(6QznSC$4V!yxXz{TDuJ$(2<){boo%)fkUlrdeA3c
z(!4oEwM*<vO8#WuRxYXyg<jxQ=3r~WPBiZE&)TR)KZQ!yEnc(d)N{FW;d>6H?o?C5
zfX?kvef968o^m&S4Xvf63~~OqRfEUBZu+gPW+Cgb=wS%)7yW&4cg=H)jKBHBSySN*
zx7WUctl?uVxBS90s)OAZNBY`}e=2b-tJ(Sf;_gQW#<bR81vtkY$<KpN5t@5fx2FHu
zr)P%2xxFM_Evq4Tr0ec%y}IhPFHXy$NROk}|F<>EcdX=E##&H+#Sdf2&8c_2xhKb@
zo%EY&icFn=+qqjZN@A~UFY?Rsbf>>GyiF|<wohc~*_z>MhR06wrCavQaU<Teq04qC
zGJP8k5z;^Jt-;mgjS5gxJMh%#PL(3zv%r7R99Ki05TG9VWd7G9w<6(+MAo%;qe~7H
zw?0g4hJq2<blDq9T^D@eb0U5?9r63LqCZZ;3U?_rUa5_>K<lNC`L<loU5Vv<8~7IE
zC+6G`?y+gmD^jwoVMP%B{}Ob!%Qh#X^1>U4!&^{g(dnCBCT658)4*a5Gs$YZo|j)+
z<8nvlLxIbH?7_r)2ZTPubKX!w-6f=3PQZhIOJJY;4~gHnZbhOuG9}}tCT7jj+ipRG
zvbsgWEs0Fu0Sy8*dUy+}6%Q=US9}xG^mUMW)okzli3q1cR{R3CKG?l7qU?f+$jinj
z=TRklZTM<pCRVfc-bAb|a=fGTo_aLE;<5X@HxX&qsTEV(S6nvM`s0J)mGj{}>DMny
zQanbxgKX{xrGGxWXABXOnumzFN5y+KbnH6y?We@>6{N75d2?#qZynxqWqp(R0SM)4
zSo*zO)q+$Cxb@Y~u9>}j%4lByMnT0k)*R7_h~W;tt6fwFy6hb#5*0t9!t~`ts1^yg
zB@)t^6Ui*S01F8>L!U(=I`Vqy#M9Mh5;57;=MphFOz!G-=iPg~bmr3xbZC#;{_=F8
z4LclvWX3wJkJ(9PrWNll|I~Y^HNwkqKI`U~l^EuhCRaY`^N|w7YB~HVBhoCaux-{(
z^dzoh4O~*u_%JphdLG@9MOS&9yr@s);h%>xmJPRR1@}moIeQlQdowY_6goMNsVXNB
zK%T>on^02}V30`yIAvSqC=4kjiA;}DRTIb~lLT=KZO=wwgi?ygoG4W-0T$V;Pb>K2
zdLQvTO9?rGU($UdRza0*N#nQMC(f}P&pjMg`06RiS{EIo{jU76$KvJ2yz^#0*f|Qv
zBD7vu?9G48m_rh<5=^pXiM!@4$0a1;)Fc98_T3NWn=(``jf%(`d3EUa7;d3Ne~gq{
zGDD*fbClq?;7t9iLoddx%9)D_1A^4ZLfutmmgQ$&Z0a@iq^-o2B~=ukV(1jw42z75
zoOnWLQ{?mO*ws7kU*t~~={{A`w!bWLsMQ*NKIGFZwR^|?4MM%;SMPmZAYP>+lIg{1
zmHzTIS14HEtO}O>h;~4gKAOqb&U&Ehq9>UYSewu|r<ZSSEumEQI!per{?_uo&i3i(
ze&R%MtWk4$3B)F?6Z?n5xbwVKu?to#u#wPl9m4o?PG~%POz4;st6|4de5x|<Z?RJ8
z5IkI4w@O0COzN#FR^2+^MUCvcJ?3^zo6?TpfC_Z8ht7GEV)mF#r+})52J;ZL*8D{8
z%L^tflT((FR;i`oZ(h}x1p9Z9L!-?|7kr4m{Ht~z^>W6o*ZV-(o@At<CQy}Psc*?h
z7hXz;QqhZ+V2XB#Y#>BQ>fv8oupEdLkrf$?FRznJ**T{Dp17b0h@Q#qr*NJITei~*
zokt~fx+Tj9*&{L9W9tuclX)H#x){RIfq9?H_1L#Vg?Eq>X&s8oMxX393U0%<$&U^d
zYGd=-zxH&VIK()FcW7shsL}@@ZB@<?g;SPVM&JZDW-un5#wB!G>^yO{C42j3Se?%d
zQ82#)!}9&rS9CbbWJ}et7V6=o4_#3Df=7Tq<|Jem20>}f-YeR0vpT3H=$u&pYhd+s
zmM-ROg;2kP_=mO#bLrv2Axd5Xuuu9oW?(QUdUKd&COZD~{qmy`_{&+4xgRn;cH;+$
zMTXrDwC8H!B$?(t;nkn!P2h!Zojek~s<=N6fAzGK8tu2#3PSD9MUwnkL2tw;{f&h>
zSWmfZ+aOw$S}e(>0ir@J+=`9`pHF~u7?XT>I7M(M;5Z=ZjWn{Dyqjvk$egXi?H<i(
z4fc(et;fXGIJ=1l?Uu@<&#CaK%#o@fDAWje;S7D|P39Bk>se(o#AFvZvOI*v)%ZHS
z^KuJkf^lAX`GqVUlp5!C%fleXj1*(XBxT;K3$iH3D=Z;w@i)AqCHAo0PtTt_(gD<{
zbbaS;%U<J}`7dCox9PwgcH+A=M|E1@Gaw6TkDCnpW5o?KWbf3TEDiU%mt>^F!BzOs
zS$r|othJw1at}|xPGujZ;MXiBI}%sA(=vsRU1R9T%J^cv^mNJ*YsCJ8Mk9B{Qj9)S
z53)iTIi@JYo+7HP17^qHZw2qYGJy%jzte;Y9<D(ZT!0EP?N9}&ErTkbX9ecxQfCUL
z9cnB%No<i(uOywVBfULspUr6PEb_;ybiWVP#dUSBURBz*=c(Ha5Ycn9hPqL#i_7(4
zRcVT=VO1{BG6~1Bab6NSL4uNwxRp*!9g>X6l(J)cYZbdn^YV3w@l~kOJER0s8OcqQ
z(CC~P5-KOuo=Wf7X9u<USIZA|<miOj7H^RPd%uLJ;PIGXZh^ZS@hDrUP&{}=Na}=#
zxCvWC4WBG2^*@p|{am8*1)p}hv)Ul>klrby=F~HhT@mK|D8wESS?=VLDf}}Dh_0q}
z5W*2LLOBf?Jkk@Muk^S#Q-A>&Yu*JB;^d-3{GK=PDFp)O6CVv$lrpPGhKQZNJ(V1^
zRL{RF^!oDt_fKf!`+VCu)A#iJ1GrY6dP(N&+eY|q$sx+WiJy+FZEl|SHv+S*J9UUc
z4o`vE<_xoK$ZlLB$sFctqk6Z)^tpPQmibxWRAwpeXeW2!WTcP3xd35d8cUA9Yyao=
z&dsko&CBqUM$jTLl{wTMQa;E3ztlw=R}ClG=Ki}u(w?`%h0Xy|+hz-PP2flHKXs~z
z?L!WaYBGjr;dOpGyqX7$%fw*Gx7H}{oA7@qz~LKTcqyi?`_W!6Cwos^9rT?wW)Rd)
zcdBEKU^`)f;Do^wW;^%CXJfnIfoG%ez=QC>0qB8e3PC50bLr95jKLjmA|$fWD}m4i
z@z>m_LHHf0#<}g`)s)You9z6ORJ*;}Z7(;g_@vdj#LeWR74=qI->OR=lo(B6bggmI
zA%&R7@}+(Y-W%y#%o&s7<#8NvInIyvr<a8B7sH%dFhVpldFb8?9|3@I%G8E}d}XTN
zn0Xb250^U=O>=Rc68&N0k23bv#pcBD>gHAD#YWuIN&4^03IR`oWd#59r2UFTeHQNO
z0#8(gMl0ziG0V6^UU^y_9g7BuCNDo-?)_bil|h)TvSo@}4ISlG_EY=4-x&l)P?vvX
z?d!dMx5k`xNWwJtM6G;BhiQ^nQmP8nY*O@^HK^H7!PZ}xtv<!9zDwnms4E;o$|P*w
z5oP~pG55jU>V=eZi5@hW=u#bSZt<h*Z6#(H^l(J<g7kSsvFIHLqpG&u8WQR4NH1fb
zX=}XA?elqYFn!`~&B?OenbPCLpS$(b>;0*(>`3V5%&R-9T|BMC8th&WeyCEh&>ue-
z@%6LyW1gG`1|FA=Yy1r!YK)Wyn|Tdv`utjMdxw>Cd%b&akmxo4hSVP~OpyEieasKY
zC47HacmlyNJ9q<=-+#q@rQ3>YOhABf7JUgnw#T;OKTOc01|r5sJ2>Vfb0_HRsPU^W
zl-&B}Z)@E&#ZirdAXE6nV9`Zu?};nIM`Qq(ixx94IuKSLn=2uh%B<@CL&qetHvAC3
zh9gl~okuhsX&tJuq{G>;b0s%n<?Y2y?7VQw>UZdR{|f!Wn<}M74oayYEO&CvWK`J+
zO3t#+FjY6T9le3BXaNf)nP;56T}r1UjhRB~MPkgMj~mX^y-^<#X}3eX1bNh#=I_n@
zw=~t*>hj_jJN{}j3W@9s&pKr4S?u3GZSMu^(C7lRG*rO)1YH?|t|Xa%jj(<J3rZ|n
zP;_7ggU*H@v@PLX?t3_DG0A=374E}HX=PEv09&#ZXVt)OnWpux$l(i72~_C?Sb%Ze
zYeE)mV-8(HrGMn0Ml_|=u-#2#o2mST&iOh}#>xv;#aMYqDCv?3J>exXD^$thM8Q<X
zkgNveY&-GQzxTj=++OX`%`g39i`6HU1V0tM^f&SiPO2b_FJIknztW<rg!^FMe5*Vy
z^7W!aUw3wPg+`-weTcM&w=g5ZK}#tKe$f95*<1yT=6e1`>fE_%BO}3H&N(RJjP@JY
zY6_kEt?FpwgxKo;O!m$1w<vubZVQIh@C8qSDBbz35suSGHW3W9;La!94zKR#rJwQQ
zYRqnZvLmi(TUXd0hg$hVUbBW?CL`&SWWwye4m11^EN`qKS=A20`Fe&n$uSq}DUoUZ
zDg3QBeOwr2x%Y9^@lD$T*s40=#4tNZ)yf23@&a|8@bp^wo@$3qk>QT76Tgl8g;pR`
zOLz6qSZdHCLv$wr-_f^QhQ|Gm9gb;QaC|$9ZP(t)Ij-GRVNPmP|KLDuyr4e$8lDjL
z(f>~NDRR#onwU?|C3H6>PZ0MGRE0;Igm#p%vnT(~2<sDr&7}<OFyF~R_P6SJZOo7m
zv<r<7QT!WwIWg#%i|#-wrNa%u#ZlrSJ81mT_aF7x+I*@o31yp-8ZS5u%V($F?lCe}
z?;DBy6fq$R8+@TNj~LaaLTl1NMBXFRq3Y|@@34J1VbBFmnBcTC>@MRe%)v{8(y{zA
z`wkKkX7(b@Om+4cZ<B(Z6zybPbzOtwe`lB$g7p#j8CyR+E%ji?^OXDV;Me2N(KEGG
zJK7N$xGk3|J#?!t>~XAVF;KpHpO@tZS^7`ZU1;l)9T^bqk8BM#e;?I8e8#!h<lW|W
z%c0?x^7Z2s#Ly}`@=>%=`{j3rBz3&G=2Qy9dHPevWM@3X*}hzrliD9ut-?udgvG04
z{(uil{TwW7cHJ3-FxPQPZkrKWzH|hvR|ilWnp3#bN6$GY2MD>iC<vHMmWTzEEjHE+
zuZ~J>%%IK$Jj1KYo{K=(j%AlgZ^Wvf(<T{*a?E7|B-AqZvFy4XaIn)$1W0sd%*GT$
za)oF3f6e>gaGq6NR_^S?Ol`<;M5OjfWOjVoGDGB2pwW^-JhZP1{C_)HA#AZFI_xM#
z>9F4Ght7OH5q!r>Iy<JUQ0Ske=bc}0X{F==cJ<>!c=eL{1CN$@a72ws;dXc@E6+v-
zv|+$e9ioWLB=vI3)#U>u##3@j&K!7ik8d)T3;EiRKU(ts9<zL6|E*=O-jryEt_k8_
z0+$*H6LkMh{=47ifUwhi+*Ihe`}>hi{Uc?bZoSyZD?K8Uv1Nt)h+rf0wRf;QKRC$s
zk5q8y^-K4Dt5)cjo^(KFK#;FLr{i%utNP?U^bQPo5xWl#OF61-+TEzj@E-4Y!khM-
zNJ+e*&$9$+wijVH^p-b=GKAcGux3`i<A+<1EUUwgJ}0YtPH#?<>rf3TUoH|P(UWn}
z(kW_6Vo6o?$bmL5(fx=0L!F*$1}JKABwlM}T2EJA8pug3X5B9B+Va<dwm?x{Nb8Ps
zr<u}TrhjPtBM;8T_QBQ6DT()xvg^^APRy`F+DKR}-$*r-(fT6N;WOto&1v43&+7H&
zFbR<jGo#t@Pm^Holckn<XN5ZE6ji-DoY-Z~tut$nu9Y_q4S#LBj-%>VrHS4>PCZ}y
zr@%nmh!6US_}~X~<)}^~f?^=R7@PFx2xlvtG71RtX=lMJ+JMT>LxX@%-OIvB$f<%$
zS&V*KA*V9<fT;)^>=JYxRo)v;p5n6<j2``aZVta^Q1ltXcM`_QQRwMV=@U8N8dgnL
ze~=;kOF(FuW*K2=?)?l}SL&$5hcF3G+!^P$4tay!oSc|C^)Hl$F#<P3VW0UCZRSi=
z74Z{CRA-VdSa=SsMi+B3bTE~B9=nWlw;ew7Ky2S~fd}uGN!P(-Vf|P$nwS%+#z+qT
zNe(V5_nGCG*PHrJ*_b_@GRwOmB$x10sYZ~ENy8b!Gqp)hChDW29Z&8dxsw4}!_)LO
zfj{7)pWpJ@Dv4GC?p2Q*Z*_r|Sg#JyLzm<m2iD*bz#qnZ*k+_0=NN75YzD_cFvpn_
zX~!NU^;7uj)pv1os3GRqvO>-nVKgNQiG)(7xlAtPZDVL_hM4coE)t8qn{vBCLDgS+
zXi;cMe(%>Sy`LZ^H2$hwed7HXtdCbkz?7N5KJ9koQ@Me%get#^Tmb!zG`lXcJ{GOK
zyybU>Oi}P%NPX&R+Fv<>*$Y2E^ATE;X9+yBsZ;f#Xp>W=MwzK!``X@_RY8mtUd?((
zm~bE}qD5Wt0tZA*q}lyU;7xM^Q6qr|CsN{X@IH|2rEymxXhWZcoaEa6XM912eJbB@
zhhBJmsCEzDn|LUx)YADxhsZ&R-VCX*>|+oLf{MekF`lmdfw(X`_9OI?l+**t3pwx5
z>q(S^_h;?|FJ{!(y+0hUqz<oZmj9YkGk&Ne9jfeYdt%mWiBxP}6>W%n?4VK?=rd06
z-7k&9!$a&;*hsDzE|0g7bBm#u$7H(S`)K8a^BlO|yZ`rz*soU8AV-Io<I7Y*R3CJ}
z)o+6>JO>E^rn!_U;#lif&sXovS!2YU`jm+1Nl;_@!{)WAvj=7SDa<Z?P%vgo&?D?X
zxCeP*@FjoyulfBJPLS1^F*L-pG!~%qE*GsR2nActQ+WP|tr%-%%Yc!{rNJBv7(*-J
zflQbaRx@vG_#F%r)+CG=^h$D^d1K`icj7gKiS0)HVd(V@l4{WqdYSYsUM=kzWX5>7
zSI^*_xEg(Yxqzfj_%%vkLmI#}-I4&;47q#8RF^D(|0v~pjE+f`IS6^P7r~rMjUDnl
z?O7iWwo#H%J@?;v+zFhOUzHrw{wc|V-aIS6{wm?J#Z2&xNNy&FZ|JuIaR&tFe+az4
z7Pu#vdME-jBMOg8tHEajE`q~8mfU$nrM6sOl_t`UPkDd$QE|VM7D(1kTAANuY0wA$
zQTv+ya^{Sj{c9em#Xt8|UJc~t@0|dF72A!VlG$Fja3vpu4DIO^WQTk_cqRpWF$L4h
zYAoJVh`eAZ5lI#Y?&XxU;KOt@GtIFTh4gWs;lbZ@!f`Qn>>(0hUrp-z+xBMsm;mOP
zQjWQ30!Rp?Ms-V)9R<%jGrkw@XfIb6`Z<B{gNqXlRoY#-Ui^pIS{NZ?HkqY;@mG=u
zlR(ZChdYf3(Q*aFladnxz012LSu}5vXE&9)9-}E8YX>4e$o<{ddqI-z)(1hqTfdnu
zVVi5|1q6OR+PJXbFQli9>r8CiR>W3KGLNnRvTOi=h@8RK#aBl9SyL6+F({Fj6D^{~
z9Fmnn#7~D*Sf8iey?K1n7A|}QBVFRz#qh=WP4JcQ^)%s;0KB(*(#u3yi{jjoK76LR
z5X|)M>oB5cgQ;I~@~D~SvW>SZN*iy>2fc9bJs{S2Tf0^$9N(ml@3n&$3!{AqEfy+h
zML3355S<{DSXCW!Na9=EA``M|KT(5A`0uDgR$3W*nMvREw$F;w!=G(HJw~4@6tAsr
z)fwA%AcLV4E7?$)cT#85L3im+*g^p>`;|1|x$2fPSl19MTw=Ks2#TN=YJZ2l_($x-
zP0sYdN~%5~(%JFq_I}TDe6~M12$sqJkw`mEf10*MMk@#%c9<_R;rtNe67v8Tx_qZn
zfL0H-PX2H<;9dR30P!dyT<9H0&mq}Mxldm8V#}PP9@&kjTqu6DM=RSXz??0lhW`oa
z`MyaW{N%7lBH*7B@ZciH&dRn|ibw@*8lQeRz!=(5eI!~wgspVv%uumy$rfI(q8#o8
z4Ce|zl}wWqDm)wzJ^l8@Uaz;b@u78@m!tRI9>ENPD)7tnmMryxdH;QC@l@U?u+4ln
zV=005%bS(W$@;S_pTf31VhoWEbO_IA!;(E!vH-}*qp66hy+LoE?Rk#>lo}w{<QS$#
z!mUCb|4^_1TNH3AT0~gFw)T<P-H6S`>gV8L^pOrMi^|r5uwa{;49a)CEvysUI6`WC
z-TK=ibE&qu%!)#u`WrPwnpC+!4#&mXS&kC~Qz0$|T#_1&f{p4fnNo$$f4#n4eC1P7
zWcl1eXDy@}ceS?N-haop{BwPE+r)&A<#>mu*8n)Q7-1@OgjZ}+uHsCozhlk0`F63(
zisT*#ZvEGHuih&<WsWdH7x=?EVUyWr(Y~n{J3#y|6P~v$$Rd#U8<K3o49!=66NP4g
z$M-d3W{J2%cl~A6p`mpK;{}P=R2<DMHiVx+>H?r0V2vY__9|~urG(3rmUf~m3Q1gV
zFw<6dc$=rGZKq)H{_FJC2G-Z^`<Xot+Aaj&L7Rq=Um9neaIBh_Jn6rEHbRm~Wqy*>
zQNzDbr#lk=a%N=;d*pKBfbB=l1yuwyp^UrbPr}3aN7>(s-0{*22nSex+lwwVBf<F7
zMf}g5&&#=wgM<lwleYM!0%e2}{qai^(>8Qy5n%qW-K+>`4B+{{ocV|4@0bHJ9}pe|
zqvXYfz0*j&ua>W^RtbeQkH?)-%FZq&`+qAOB`wKoaW+m8K;0Kd-RIR9Q0eoH^N7yN
zqj!VDM<vvh8hcp;Z@`G?4xv?=8PoC;g4rRq_zDGE`t?Qr*|1!|BL70&to-jyo#ZLv
zUbL)#N>#7uXt`KYiyas7$dy6_eu;qaATHT6GZlUrk6e~$YDM2N*f5|)R03_uUr9YW
zns>~L--Jte<eJV=d$ID>3Q_zrN5Q}9;k?DEjz<&%BJt|mVsx<T+uBK~aL=(HTv`Hm
z4W1i`em{PtwwdN7rz2iRJJ1{6`&E(N&iV;C<L6TT35T&oQ?bcBm~4X{Y^Z=LDWmE3
zqYy7|+^c;yi5_1)3#9!h2~!*aY}r9uQ{l7?t*eABdh<TNnv`5as93MT3|IK@V#)a4
z;McFh5Ay%Ja$fNwSSy0YbNt_m0LrJ0O_ub_6h53yuk?X-!vXpGtG=Yfxevpwk`*`E
zG;nX~#BIv2V85m3H6Hu{lNVI*A&_%n@(xiBsf8ooF2IM-ZA_w<CoI7rajf>pEvyKB
zzOuqt*`fMY7I0JWO&11ZLl;DP#aF{wO<Ui6`AqZqZ$t)01pJfAZ9<~6d+=Orklq`S
zAU%$VV=iZ99TeNsA?%o&=c%U?9u)z_W~%A+X92@csc_ign5zgS2j;Ys)s;}7+;afj
zM`kV&+w)a-#FHAHz`D(pmx%hJJyj}wa3C3k+lu4a%x=kk=$bmm0oI7fu<F}N-&$p8
z%YwXtnqCSAVd1zkANu${dJf>WF#2Z>wopK!HkC7GfR+%{Ez?{m20DnR9!QNKzK`9Q
z;8rucP#g6ZCPdWG&6Tir@mb!W)DRxRRlH7Ela3|i82b99wPE2e0HG(Tf!+hX$#G_Z
zN-$I1rj*<Ca-|RP{LfF8ngxjVLnqWnRkm@)_D$9Ag*NF?)vQ6%XbLnmnXEtCG9m1H
zBCmCPpIv|0QaF#Z<JFFi%|a`upq<+tpSL+9*H-jVo)zpI$Br*>!Ka|9BVIA)a#86K
zi~4Ym8uJ^>IGv)OWNzsNr$;}CSy4WLC)E8!nwTOK+uRe`Mww|mq_Hb@1d}>Y6&h_v
z`W0^6=Vc9YE5Oi=2;PDrRsrNLC?wrY;BM1~!9-!iH`<pLalM^51&c;?Vmz1?uodj1
zp9Q3j)Q+7-0P>8?OH{L;+4e5*8b=$hq=%0CKht<PFmKxoU_(tje3%mjW16>vZfbU!
z4Sg4DhZZ?1Qi5q<icGL<nA<w&FN_th$lPxJr0(8500wzgdB#=`^5ZT$H)b-v+Q~^4
zncHo_Jy&nmk#);0)Wv>U6R<k!r}Q0;tnq!EvxHBn25R*1l!t`N&RtyC6vhd#(#|AC
ziKH@TO3WY4pJkj)OWkCo8JuRND}aYDZf@8pIZ}SL>(RvJBx|DpS)!g*l|b7k`H>I!
zQvZgpq+(sBlM}Vs#Y$Zrkkk&<w#*^oxon0?YH<J4BNWcTwOjwt)-)Q$1xP>mTI6VK
z@REZ~h-dg?UPzzp;}pzI)QF&cp+;W2#g=3(_|35>N==)lyK1wU!F8jnXLC-IEKd9N
z;~waRHax91H;+pEtqnK*s53Eb*-H5MI}@Dx9CZD9!OGumgfH~se%;L2<X4xc?_SO1
zUvh@EA$427Ol)bW%d_e^gL#)y2RBDufQw73rG>X#?|2e@&FS}aj;^4d*u$;Kp*n`2
zwAfpud=!s8kr>Romik!2bmf9h%N^>AJ1uvqho^Hi6Xp%(-A)B^CpBU*uu4zQb$MlX
zG}M{1j9Fd!x*C*dW4N)!OQWSx>#F2A?!)0b@%I;q8Ih0C^z>`DO`kG$c=L3Nz2Z>d
z>Vdq(PacBKze!QV#$_U&nTXM%U4!cIh8lnC=?(?j4KPIQ@1<81%$<{%pXiXn&u|%c
z1MVBDV&eHgWb%i$Xqs+VuuM!NfAV0~K;Rr)rVA(Vaqyd`g7%8fw${|)T{WgQLkZLO
zaqqXrYBfIj4F0G@@5S%;E5f}c3w11wL=OAX+O@;WLym<i&-4CEqSVQ&R<c-pOReNR
z@xevxPg0%rk`GX{THKnn`GQO5k?XR9T}O5v&ZdN9DL*z1G=#jD;-U8aOJjANW32CI
zsy|+kGE>cGaox@%Ap$2PN>?#;oja`QwUSffZCs{jBkyZE=+kXGNGn<*uWml1`#za(
zpLo@Y=;`vgX{It+`5o-$+Pxa48!W4%ugcmfx-7R7i&bB=uo{0t;~s~IP13mcCR|u`
zH6)~Iob13lq&<GE##(-<EtDo1yOhd6goOx3YX9m1T*Zt0{+t-!F6^4MAB!++pWPIT
zwOQoTh5hXrWm#Vhx3sVoydiYJQ}*OpgHBk%_X}<j)y}h`3%~6%4%sBy{+HEe#j3Lx
zy|5denPx->{~;3^$~by9j&I-UXGIw81i5+rD~`7rVr7;LbTM@xN?y6T68G>T={IcE
z#r1o#@{R#-67VwgAd`+V>oj({VdPeb2-y}uwL7JjQ0d3d#=Va}J_99+3oz)b9*w<(
zi`*^5eQfa(F-`R+io<l5Q1gI|?+&WV2<pPvKwWPyo~*_Pp(;*5UIWToy7PS<{s1I#
zP!b1{Se|i9C-%On|1+;Tddpx#2m7j>h|mYrc!ZScWj*|)#tt{)=<3EI;r@a`FIkR_
zUFE=r(FO0pOo9+4lki;XzB_!PBZp5qw3#M~ukPlK89!LS*2$_UA`BH&M4lYseAZkU
z<z*P_MfzZ4b|shHy2fRYZWw=>|GLSTZ0WKGD8_&12_s^ymm6+;HIHv@93@X_olN@w
zoVe+kY37p^PY(Uny6P^vz=L2Ze0hiD;Ky>^E}}fqD1gm0Oequdv=A#Vi>iu#DHZRV
zq(l*|AzRohq+3R$8B?PtH3Hp;W2@g52@e$9_mb_fIZ~-tl_-H2_vhIut+kr3EVgw}
zJX9xZ4*Y%YdUJdI@(#9NLZ#lt7~patolN3C=|T#1Awj))5>T(%qWml{48)2Py*c(r
z%vX<i)?)9c6bPA~OLBSqO50g@+VIszt2th7ZNJjwx+m=N^~{uDres0KD|&z-KX)^q
zeLLRCG3CXtoO51QzHOIC5crj1Z`utPh0u1Vm{Ap7ved3T!QO=XNnElP#l0WwGt4s-
zLy;J-G0_M>I^-FaaGthgen(s64o&icMh%fsW`F5C^Ap}rJF!`fMTM;M22{-=O%Vq{
zKl{oQ951Oe%BUNq)qLV85*;d2q8<Sw=PEFUl<pX0y$hdG2s0IIG3^gYY}?Ww($vYE
zVVJB;!6u&bs%AjchqYygn;t48+wUfqZkns~3SrZj)dGB$s|@_7mQ4_~GLB)bD%Z+K
z7^c_Aqvk}K)8gI}{ah>c=&5q)*sNzo!p((ozAUvRRJ`FOFWDkH5eF1OIRs#n_|FOF
zC%uXpPuP7|g`hMARmE7f)6JX+mwDz9d8RDq4?TVNT84PX#-04KCCOk?iEowSf3E9$
zYl_8PeE+>k9$R&tJXBJ{c;Yia^m}YUeT|y^{x~ld<vX;<wqgVbx_*=tW#tKNBEH|1
zI?wh?WAU{&#+P#|FI=FBI$#ZxD_t3@I*O#|k|tEX=H<U6rG~{nI20kZDbH>sM`^`<
zuP^^g`eM4ZG}xGar-OFDFTt4FK3HJ;VPKC=Pj2O-3$%=p*e9@SnP6erA<Hz~5F4zo
z#hB*lFvA7bXxtb-P(<}dqXhjr=df7=^V5kiR2mtp#xh*+hUdI?{FK>PWI)#ssoTZc
zdc%~izd^C+<=7zSg@a`cV$`IskxR$%0)u~e6~9_f@KfX$R{fC***TsTchNC$9DJYf
z?2@T5!v#}Dowz8Rm{Adb{``HJE8^)pHZxWQx(OB)zs_J^*ciBa5R)anM65^?y{HFX
znymB2)W!5Q3hDDul2Ef${5d|q$DUR{(sV530^Op<o*u50s7+j{kWP;<82PF<8Y1<~
zl+|ew|GsMzcCet>!c`nq#h%=L->X~40*>>e<-x=b4yV7GV!CoO@hrE6$t?4vJ#U`w
zpH!f7CFJ@GPWb3tUIhy&Z#9L>Wa52Ui77CE|4EjbYx7%}34Z6ixHqWKYj@7R0s3zH
zN<Fmr0;x8m;v>=wej(4w<K7Q%!rEVSXb;VcfvTPDKRDb)8utSiaX(G}1*0RL?s7#7
zqU9Sb$!8Ai;jekmlsIibWlFS+J*J0b#cPSRcNT9Jjqu>xq*w}F#Ze6YpU6%(8tH3(
z%>;M%N)aKAeAquIu+8Mfz&4ZS@~p^oVLp7`8GV2h>9Kdjd&;jHaO}=A4+)q*o9`U`
zejOHZF(f`Fm#lKJs<wcR?X3P!6)_}WdvmdZ?adyxN*W2a%AZ=ZuY;$D{nB9c3=zbf
zh_uN{iT;_*YzdW>cy|ePqMj3|>C^RO@&nJ*4-h87;h~7}D~m-g>c9@hd=(uUEymx}
z!8Si1$2STaB*tQ=L1<Cp?Oguy&9EBuysMU;2fsmi3@!p5kd+7zIKu}0;-GDJ68gnZ
zf`0wfFptS*b0bq}|91E-T@lypk37sy)Y9bn_Eoy<J8ysg+=TXXtUWGKixYh$t%f@-
zdO|p^MJn!Gp3(}L^r(n5zR1m%771-$njdVEmr?nqG%AXuh6*mjA?!_)G}DVu@;fYd
zi&DgP?j7ITe*lE0i%*g}m=RK5Zi3^hV^FC%-|L!5>~+}8_v}2c!f#nQLj@Tit%6Ut
zw?@mFinq;?TQ)K-_cs$e$!Z~^k)}io3;sw&K4@j|VNtEF%+9^XJ&Z0sSy3I`l4geb
zbS)nG>&sAF^ugxTWBSEaV-6Rg|HG)K0+p@}iORwb@DMtPRprVm@Y&J~b;-&~;lHW*
zBLhW?-`^zt==S=l59c~Sr6zh|1pXp~VJDndI?s7OkG5KMqf}%me@zG0VnbsQ0liur
znjlyUdsyO?D6l!eM5CbT1EYbssy$A-{n{c?1;^B2&iaOqDbK9xWxp_=4r(R*_X^Ip
z88Ve_ZXYmz(Mdsa5ZGl340r70{y8SSoG4#qeMhBg&j~hq^B|?dPe*A;l!MqRkZ-0m
zc%-;e;)4z8S3-%*%2T2UJN!)k9#;qp=gI8Xc1K05MOA9RivrndeDx2q=GK$=h#Q*4
z)+!kIXo|P>)O1Py>U&g1W%#&QP1i3kVg4_#<Nr2T(ZK&PqF;KEW(K+a0eH2)j{9#(
zN0sK!%y0~te$BnXeLP8uNP}a43DUCQ`PAF1{y8~(;^7xTUAU-u8|M74Ga52s84z{I
zi#a{uFFCU|@FxD^g9DtKn#*8);6?Arr3ZR{*=t~&f6*JO{w(E+;!G%wdUYt!Dhtq1
zFPXTra8bmAjRL*py1C&3Ubc8E0o8rYV^?A?L6I99r?WUQE9VLs=dXT%bK1W4Dns(L
zqqppA)Tp_cDJi#(I?Gb%P0Dt0y-IM>xa5XYPg_f6O4=_>XOSp#9XK&536ub<YE=|X
z{g(UDBT{SfvxexaQn8-QJ?)9x2Eim7MlkFb&wbq7g8-^hqYWP>n$y}=lyGY}p~fK-
zQq@-&Eu|Wv^?iTKkRC_~*#02ZYUwnZy~ckaf06ibu2xqGIM;XP3Z-b!41Hk;9b__|
z<#kvpIYacSpErq6s1{<yWTd%Je~@rNTi)kPFap-P`zXoJrfdd3u4>0Adq-;9O(=$S
z9A9AQE8##UQ>4C;xsInq3591LM>k6)P{flG7K(Z6cZZV6bJr=}-&)k9DxM^P(o=SS
zYw8)bSoi*U)aWz6vAN<|yngb?wN)D8Nph(0lC_~IV@NuQw;Ynitu1d{@+yE`ew~|?
zl3`M11@~p8<DTgH-00jKE8Z*6LXYbZku}@5uPd+mZNkpJ1zznzN1z)Ut_{w<vz<O&
z&;yr&Ji~ZcThMB`D&Gx<y@Zy`6O)FPKfhUC-SMhogu)o_?r6ro)o=m_pg)GN-u_E^
z_LOu%;giL*49xRfE`Lp=BBl^V2F4Xe21fJceF;qAZ)Jv9^38n%oEDE$yK%Ig-5u<k
zAWLJCQdUv1w2zOMiD6t}slr@ZBsmXb3+ocp-~}~YJ3{#>+NgjE%YjNr7Fj~YB*lSd
zXS?@9hnYtf@=V8pOCv2njpBKS>wVyPJI-6>@Z^KrI%i7p%hFT%F`B3x3`HWw6=pNd
zK0;CsV++#^bBW@gg-L=v3FE4F#1}(`y$Vy94vOkb2=;CUOz~L`R1~J#Y{|vnOU|UH
zYcuwNE4C!YN(K|Pg3=nfYvgVQ*$F?LCVpU2Ed7-lrtsJ5tc}ESK>Edym*~Nx@hU#v
z1MBIp`{jmH-;(x-)KoXl!?>=!3f)+Uy72&q(HuMK3!R+{-Tv(sdXxlslmY3QGE5;{
z0DlW7L$s2)yLS0Cu1~M)gf{1~OIzxwQd|$r5cYok+0n@xqBG-k@wfT(yK@9=g}iaf
zxhpGRdmQaZ8_}>u%kH6$^|ak5P?D4bhXm6B2xO|G*`%K4ca@Oi0;4X+Mccy&@2rvU
zc6T5~6g+0&J3)Z9s<Gdw!&t7~!ipD}v<@&@P<ubPs3&x`o+SY#vLRL?XxmN?o9mKg
z4I78Y?D%xn7|V6}*4~enwZFIL;FR@q_RTA~(asJFc=^0Nv@bV0(Sf%WC7komX#mUN
zLb!B7SL$BMCe_9X&&yf82@m3>WqinI`y<=gg8}_Pa|c=o&KmGArup`g4lK#vU8q>+
zi@dnt18{m;2!nVwenL@n^Iy1@N4Ojpev1E|^;`D23=H?Z+x#w|f9E4<N?)9$!vKwj
zD!^WX3J8VMtEsv5A_BH2)zTS^wJ`s1uCd-E0o%C=lq_5$@_)jB|C4x6waF!JBW^5C
z!Ke^xA>6p@MFdgkfrNO{LMaCt?PF~{JNFN?vWdYvTcZJ0J>v;JVSb{#s>tO1Hdjkq
zL<oh@;n_mJd(5^&Ca;6({Vj_d^HUed<gaI8HP8Z_tP=$uQ_`~qZH;)2Pr@rKi`3(9
zPi4%j`n$>}0M8{C(L!v-MW#y?!aM}Wa$&}SO!qShb>0p$KF)WR@Mc`eW>Ir3zVOf@
zBn8gQQQrJR(<H6!zTV74(=3LGIWtAkMEiKjtN4uN>`cArH6~9Ew?iKqKpr7xB(4|t
z<PkmrSwFfMvtvkYLNq<=+w8ZvDm*j$zfWP!m+A(yZJ=q$YuhKcVK&sEo{s%7-FYj>
zeovmT_sTQ`RPCQvhHI<P)9toe#%~MXe0IdZ*C%yq*LA&?bvukL3m1uWOP}q<_vian
zaDXoTQzk&-z;<|G3s6n4|Cxk&lSZEwf;{q1l8o*dtORSWjrM-ZUthZ~yz?kPL|`xZ
z-ho#m)aXY5I|*u^?_~Rxz19mc<y#`Qb<O_<VEQK%<($EOr+E>OAcSCr=KA*UOK^A+
z{W2~0SMchq`uh_*$O)jV1}%MG{=U9Pyig{VA><HvQ}VlV_e}!;t#ItfFS_8;@<;3!
z>l$jJuZMnk&wgq8`W@%fLKI5-4?5$2(j$MQjUQA9+w>qeZP_i5QoUuGQ+9J!jCj6W
zAHe3wHPaYU$*A{X=z%6Y6wO!Y?o_NjuS3N<XpB|r6~&x35ToYDc*(k1kx*13&X-Q2
zM7j~vT`G!%f6n<B96Bn4UaCG+u(kgEn=PO;XM)K4Z`SchPcVxF2YC4Uvi2ofV&+<~
z9O0{yFb%+mDeQZ;O?pHx#7Ge2<a8GR1Kq6P7od~A-Y@cS(0K-3!#Z5Nt{r{5An!?Z
zi>WU4)3JQR$Qv_4F*X13l6(dQ0f|4CML;6unPg=nMP?`Z&1V=I6s+6747Oxf6txjO
zOXy>RG>g;six?3Gk46U7Uy1I)Fc=sR>)FGer!-hwf<z7r6vxlMvxonHqqeqNh?w-W
zVr;GHKgTaj;(tiT|6!0Lre`Uq`2VY-h$g_t@aWBrpPOgCxZ}!hn@;6xED?8SJ%}!8
zdhuqz;Mo6v+yCP%6wMr(eT;)5H58Cn;baw5998R5@UP@g;0xgpWyD9F@8GAy0M_`f
z?E*Z^!-!|ep3(JQ-vEyCm~YU>ucQCsAcBGZ0POi@C{m1hAjkaErfvW?3XiVlZy)@*
z+{H~nbBhdf<K8>8%x}dAgX`cX%`=H`vsS91YtA){l|WW!@8JGNNI?=FDu7{&lq|i5
zL>RVtN;f04CJ#ytbTT8>X0&bjrbzw5mtsQ2BMps+w5xA9)e7m%h%}fIvpM|J_3|HV
z=A#V)?Kp}kP+8OlW}9$SAPyeIJ@yySWnYa+(%R%&rpMG3F8k3M7S5GsAqN9<{HZ{t
zL_^|2P&lV9@<4JyUR>CLX7MrV-haTs_doIN|04CQwD0v+qb2_25Km&R)749%vC<AO
zWIv{(2SWA!6FGmD;S~y&J?KLExU>2X4Ck~&>IQcUhlXJ1^1FVu7}1vb*8(_y5Wp@$
zn82NRuuh&BnT?&Flo0%2^UsCwe*@G%vxCLO13~m(J)qZLbg5Z4mci{T;Em%pH~SX%
zp}>(O)3Z!5>R7@2iS55YWWSCRjnMy$n0?2WW?`XCBOn*pSQ?2vKR-z^_@`0{6YnQb
z%D-|TU=MtpuM&j%+X-Lcf_g)`-yLe6GI?&@>w5Mh=LK2(KVeLYEvCi*FV8l#_?H;c
zT`z8|)N7?1XE{uF&FZG#HQN2V+=kf!hBhB{XL@uo`QHk!xkwF+>TDhHN*D3nJ0zQJ
z%efEVZXpN$mbja)gL_jWe3xiVkqUCllMpnax{zWO=3R_Yz8xdDFn@BdTiHCq!u+Jl
z0im#7*0s<iCCIHxM7aY6NtL*<)m2`nx@`6*RqE9z&U2eC4UM?Lx)CZ;kYwSXqqJDZ
zZ*%=%0iU^l)a`;0(kND23u}RGGh(-{rv1?{IC)Vt(Cr|w^*`#oXUDS?L*vOrozont
zyInIX#0M*#KJENYwLEIux~jNy<$%*hJ1lKqkXeP_9XI>e=_Z`>n`H;n(6_P?yBjdq
z`3;>6{VVvEG!X~>8)LV;Ov(t(e~1s@S`@PO3D2Zz%BPENU(@c@%`kjaEMxk|*~6v{
zTjzx4Jy9N@Wl^?mre!6H)U5b@{uwZhv6QO4v~Au}ZdLDu_{j=_kNXFSp?hbHdH6Fr
z!od59hPC=J0M?YF4}vHaqJXevA`iDlK=n+{-jR3F{#UHpL$QV#>HL0Li^ZBf0I4p%
zR*E$gn_Tw+ljST@^YuQebv`ODS`_+QuS~Nk%0K7TjmhGQ)WE^Bt(Ul9ltzfg#tVIs
zdcmjZ1Nr^9>!Uh+qGILzT}%INE5JHka=VMoE@^W!Wb9pc)pR|9<FSrfzFGEz>Glam
z-MUAOkLY=8mZlRwnEFiM_Srvb#GGloYCyZNk1Eoj$@SjBaO!rG%iG(rQJa^>G70h}
zu}p4+Vh{%kusUmN*pazWhGNYMFH7e)PkwN7di?D>2&X(875XA|OM)mZ@Eruf!3FQt
zrz`?7S#PfzFjjqWlVfeAgkt?3Yo!y5G`XZDvuV!7TUh5qs3P?1ji306LRSy`RN#D%
z_YM@@hsnxN^`8y#qCDcMSmW^ehDFRiMel3-A_aELO%G0=T2Q#o?b>aNm>Yr?FH7ve
zkQ8KDVx|7Nb0%<H_V)VY@H;eP(ScpNy!~q=3&q?Y#`uQa@sG?j(a|5fLUY?=GO?nN
z;&JW0q*}W6p($lo;yL$mNTK#+PboJ_%p3W7)Yc({t2udBFm!;g!EQ%7W~t^A30jwU
z*G$YfK6@C)DKv1vWM#byB(m&6(=o<I1B#5)0V*FSE%Mr0tZ|=d&5G*z&){k;9q}Q8
z>8<JGXJX~?lbN(@-F?y6I+b8;M(V+IOx>0%bquG48*oc~PoA3zT)DRtZ+dA5slRlf
zOQ^r_JSA_<0e8U<vjMpVyHzy|r=1&!`&^s!@&@fz8Rn&)PRC|nt7*ib<N!!!pp-0s
zC4h!2Xu=O@H_n^%sDCWKYLG-w+`)?HgU_kg=JH2QNFfDiFu7IH#oCOM9f4i)?8>T|
z_+TMUoP>T2L*BlYir=H*epC2PzTe+^<oJ|zH4Fv&HYz?yBk;O#RlexvrTiT(*LKJz
zS<jywA$GXfyo~;6`dD#o*XrTCrM^v2WU0NP)P+0lkjG;?lI2Si<*funZ;iNoeO;RP
zF7AVCtm2S6d~0PIuGpG*Z6J2KTzjIY6EAVzmo7?itYInGXQnev(sUN%_iFI6%kK%7
znZ^2D7p~10T_RT3IaVrMW)AXW-FY6*%dN7R*7HZ71VQmuY9jmf#v%i;v_hXO-#k^Q
zk7kGJOF{KfG@(9w*Md&A*)+0EL-+KoSf9Xm?&<W={ZTX}ca}_a&(X5Bu50~)QbB_l
zyVEHHbfsWVIO&W^8;MlfhP~%POHt;=3fj8ff9eXsmsCDg%>mDg4Am9a+#xl+&GcJp
z$`e;iit?UxT#{7abty)nux4NE36&CWYcJRKxYbop@Cur5w`y{1WmhY5Y?J-caVOHo
z;Dc~rT?-yuORiQwnlf66wY6=+5933FQcO9v)vZ+giL}e^L<P-aZ3B+&Nu>N=^OX%K
zj1uW$sLVym?JZzI(C;c92g2A*2jcmRU9b57+X+=MW7i<h?X2XK`85m`ivM+CW7o)K
z>CWphHueWl<vngt`OB-2oB_~9XfE8Xd>)61@zVIvZ6WjawTzoFKXtLgU&+#yEolm<
z3X^oK%||c<_$g{X9!pfXgx~1}%|zs5ZR~@n_+x29LLxe@>!(dww$;1Su`BKOTo=}G
zP4mVkNS$-TDDU5a4m#ra$gXK#*u!ZaTV-j5g`V3n$!CRyW<%rexEjS<<l#0>0q<p-
zlH-RxsZ~U;zUM`Bg|FOB>~fHu8MbDC6U~HRKNUwBsq&IjhFE1#Drtpkky$LHCCj*`
z8i~mun9F+Sz-^K+urU?@8*>5Wkh`di>$Qycm<3RRT<D`+gSCQ+X$T1;AU-l;5paF|
zl6UJg$R=Q*vvhC6(CbW&3Dy&Tv?GZy=FAm~+dY^ZoJC8r5)l$Fq!#bSSqd(p&PH8O
zRStEgWZV2WJ^|NxlWY93|H!_ia(flo_8iK#L5#c*(x=yMchkcp33~dx6f@U)usB*f
z<SqC16R@_hs=THYwjtq)7hEc`MIQXn;e#<pg8kpYMN7;zqy_`<1_)Nk*|%wQb5^W;
zI`y#9{@&_VY4a0j8^7=`jqq7S%d&<YHy*ZN(PaLX?De;BH%yi*Zr2yOg?nprJc<8H
z!OE)W(bXy)mXjAl3%4|EjWIo}w8ZnJV1rueqifn>3J(?)V0QC(-o*KOjv5G#dTI#0
zwTXS<c8whIY-Y1V7EMfYW=dfFQf`Cr$dYXuT3E9iHw?tSnrno$CfIq&WRXJil>X*d
z6dNi?Im17`+OCD*a52Udbj!k3KzdM!N0Ru{T~cq5(p^*r=zdO(YHn7?tD>)(*k#d4
zOO(YPc9zSh=U&lm*Y1y5TA>(XHQ!6jH2*{qe~!yGF`?JDteWx87e6JucepDHhW`ZJ
z%jZ<Kes<s<=Nm9ueg|tNEZ133PY*D5UKwyEYBDQNvT;E#)5&)FIL9zHIg}G{8l|Ny
ziTWf}Wg1|-suq7Hsb`MI1#%}asUcEk6Og5R-?V|G$s;cW{#qkGNK-H5k!)b4buzEZ
z`Y0M_jU{rHKG@Z6{do3F|6IJO^2<nFxt7%S$2cwJu{@SSnK#t9vh)4u3mH9KF@o*D
zrl<?Yp;2s#BO;S&oIpWuMS&zA9?5{%07|z)B<Lh(M*?|}WhSa8*7mLkJhzy&_z~m#
zrs8Bxf082VGRAHJkR4anMU4=k^Ozl6&#Pfz%LJccl)B$=5_iWIX4*RYLer~^quTRD
zhMfa2o8!Sw$0t;rykedZ!8Z8;4(sZ3mBx6sqNW5psSp)>fqaw?S6BtNGF{RY0~?;I
z0rLN$?8^h8-roPmzV9PT_QKGFh7>95*p-=7wAezFHc=`2mPTb8BdIW!=ytQUDTQz|
zB#~~EqOPqj5(;JcJ!eSj-p}Xr{r%DD%sJ0F@3;5+ea?B#^SqwdG1`j~3VsQ9g3?0e
zVfl#LR}y-R!&<43V4d*73afnrhkc)L$RC{VJa|b1c&6tM+hJJ7y$;>;<l_3{_G}U|
z9V;M+Q@zVq!%2?Y^7lTi<JU|=#*B<8xFx~~FJHI~JJiy8!o#p6yn+G|%g1dgQVXU#
zvtls*JrIg~r0yMfNcVPm;IEYqf1{3QT&!dUm?D{-DN#7sb7I}WCK>M@XmuOSK{$50
zw&GiP&)Hh?UB6H7IB*G>cfTzSnroPf2S<QtHC#<%rO<(7Nw^<tez*bU80ZH!aA0AC
z4V=+cFi)@)z^?9p7Jhi_Ib6)UU9O||=}4Du-+lfKTRx%On(C3n1K$rtlJ*`RiGN%u
z4`B^K+@*(}exB}@#eknc>VGBh{1%G{u7njf3mKB8r-uJ7%$zeMEw)U8z3AV6p3uPq
z(i5p5aMYVh74IIf)tubPE%@ya+e3cKE3?x|l3t_o)g>VS@#5mY9~R~>07jrA$eyHq
zsw#amHpIOwva`wS|FT>BbsM`{kN?djrPgu|Fxv$yOz88!xf}sTH*gWdzBk!zG6`HV
z$W+X}Pk;TN)2Y1^Y#h7SWQJj+2K%p^D$Gu3WD9AnR0lHx)0Xff84+s;lMnD1MV?`l
z+Yq`TNS0&2+{H%Ibgn(1*s~aZ$ZCu%1>lhp4~YDqlFxe`fyShY2bkB`tIl&?KRX)#
z_~5eTo7VzZ=5>Vqi)k7DeWL?SRmbArJq2sWWNT5mW~AGGxqe+P>wHsH*subiLm8nu
zl#vzK-UOf?|0P+!8vo*jz@GpwTC@dLpM1hLx4}KZ$nc-vYkrLBVV-Rz%*rBs?R_*6
zmX9fthxA(8@){=>)tH-BF&yeybwx(XSShrntY%HI_kdj{g`dyCB+)J08aH{WC(=4!
zuREgh<??Dj>5lzcuMOHBc{nN<f=sss$V}k~_yl=k497?|t-Q}T1bTw)C)#-aB$c1x
zhWMr7xL{$n;uLqbE7KM>87f_@8WmdSz6MGT0gCZ|!zri(MKS=t5N!C>&~|}Ykqu~!
zW@KQ~L1wA5$in=i$j4D*ID7r@?Z9yP!B<6q?yTa0m^xw=bxiib<Q^}~yOL-goob`;
zf;S%}W<zyVW0dRSRsL&o)LEXZB82(vB<l)2@p|;A>Y$4Vd`fn!@WvrJ|3Ar%Q*LEU
zo4yGS0_s+hN~e!`vBdESEuA=J<aeRDB7ki=KN6uP(b(F(OKyX?F&I|>UGSffk|APX
zwMjYlZ>FJ1=lSLr=WH`z_$@}={%Vg(b!*Q7R6e}0n##*dl*T)qc)5A_eY)hh?g=fs
zRKaPw-?^(#V6mw!Y2AXM%<mLf-JXXChU`K>5$y@%gPHP3q16V988R_X=XXbQEN;s*
z(<vYO+5GmyfEVzjsjBd|<0>CjzH@Zl@?cLKgkzT24!a&=J0W9PxNAsN((4Er5T!5f
z@Nc-}PJ-P3n0W%KDtg00S~+U`VN#J3<)5Eko-l20V7Rh_huqOL{|iAl78}}_zniDr
z9i6RFpg%(A+MHm&HT#5YWLu}B5VFziXijwD?P$*t=3E0%BE~C~1spA5{%em@(QI2~
z_hxpt_JS$(fi&&Web#yS5yG`F&B*%$znhnnzy|*xQAg(l8kofLn1>kQR|UMcXT5fz
zeb5!|`>h|V4k5SGBD2=dHZf%1vi?%UzX(zV+Vvv%g>0JoyajB*x}|*5k#kPMdPY=w
ze%4u02#}8ZOKAuo1J+|4?~>2UD#j25P0&<Y_>au>v1?9#bC*n)4}8TwH)ZLM+~S$L
zuYer6`DyIuYybBdky*=-qlJrp2p6z~S#-cHaQ#GwU|u@c=)~kq;P7YpXN{48K|YQl
zFi#7x8S__H(%GZZ;rrn@S=S{!Tpjj#RY8Mm-CwFPxuKk$TSa!sbr=7z`~I*9|M(=u
zgIYkN{iR0#q~63`-n#~|aE=XEaUdZ2T(%iQP7Ppt)42D@Ds3gy0ACy5@1fs~%4=eJ
zAU^IAItu{k@Jd)-pu@wgmdEQHns}>$(;hdN^IU}JFu!J|<4Wfkf5Y@vqwlWD;KD{Z
zYWc&iPe+C)b<Zc=?y4y|s0~xY7lgz9VPZxa%DmlqNRsyIH=ds=2M|d6hoQGs(GZ_0
z|2f623|E#a8WxV@j<`^A#Ami%NkJaR7rtg7YeiuOtJf&K0UTgId#3ckgZwK-@dsqF
zHSq-u1HoNjY0iSSGLS*bUr1~Jh^y`_eEav{+yAj(|HzHVqs9528=RrZBnjq@AYNjF
zb1l>qs<eof6UEDB2Y3<8>pN8PM~>-Kuy9VVjMoP^pRSOd+%>zh1v!Q+>X&&}-GZPK
zFcpJENhpuN1nD;5sIOz@{5wfZkH*4y)d1@)B7z4Nc47X#m48ny(`M1jXP;90*1uhz
ztGZN;*#YwFpwacq$jx82Mra;g^)Hp1^8SgO5`tTV-Ry97(usd`20&0U6RQG>$PN>~
z5}>ufh8fwi30|D=9GohQbSY$|yl0!r?>;E@%YES5tNrHtRe1*Q2Q8yNd_^Uvdgc*f
zcIb|Ntg7fC*nL5(GP4X#T{~Ikytprw56TT^2kYXQtOLe?@YYee6p=f+$#>|8<8hwj
zBe#{d4DNXgp0_c8v^7V$!RIJ@{1v!fnBX`u1f5d}<>C0+oO23g5jt*g%43_6uiOPR
zzLH^l`HU#&=AKe6iaLsNnjN}qHr}v~(VjwY_$=th(Ii=pRw;Tx3m>km0~7ds_2r5^
zZ)}(`skKJJE9-aH0XgP5mPkW`mM}rqLF2~*N3?2SnF?3FAyz$7dNw}WC6#4*C|vc%
z-?Wvchn)RS3SX3XEysQZfj@M7+<6SL0H$@^gzrH*{LXS@-Q<nHAWx%Ejg=T+MeK02
zO0f$_{Kke*v?}hBtLe2v6NBB)U92PHUC3~hF%ZXO^^;pg01(RY;p(PcVUgl>(M=L>
zKV#n+bVaGJq+wJYoZNX1ncQ~`##i!ep*hM$r}~_+j#I`cY}t-y!4$LrD9KXRPp<n@
z_m$xjyeN|}su15dg>~Mf2&g5?6lEGFtd;HW-QR`R7ZGGJ38?Qd2OmH)<<yJX0Q^8I
z5KvnmSJIe(I<RFaoNrmrdF_ees@dR)LvPu~gfF;>y#5vl4qAIW8%x2qP`Rl=^(c3M
z&>%<ITp_}=7>uAjlu0o^dya=#1HiI$QTCiI6T*dl<7nXsoyNwZmgUIF3UDY-1%>C`
zTa5ObL+c>A<Ipaan^MRs#uW5*Z~w^JQg*%1XVea+Phb#SC3(4^#%ypVuIEkU(qNBp
z`6CK$OW$9v+Q+q|=QBqROWep;)|RmN)UH9CSzs`WPbIzlL6}b0sPgf3yd-BABWW$)
zG-p(vQ(h|1k?V-0tpZ&z4V_-7Qtcy`D(#qarLJ17Xpx<DF}v?(-QsIu`$M{KNzMHp
zb)oe1inF}R!P?A8HD0m9OL!s}kT9E3(Up5ff6go&9kj_~36)aDfBNR?I$F2xV7T2?
z$0guNaC34^R;O{G>8Z#{9AX-_Kum+*X-`(&!U0`2-JXLcVnu4Hjw-I3HHvL3ds7%c
zMKZ7gK!c}E=7NFik?wuk%=m`J#MixS5S{?$`U;q%;E-D*EZZuquT}WX%$cS4Cg@E%
zU3F&~N7^bP!<j(|8v;k?A`?nSUdb?{7VO$<AZ!7}UMv(f*83ir3%>9aV@7CzhehtO
z?$UqrsxTcb<;go(P;3AuovXBwvu)}CT7-e~5uVA@6lukdfZ1AoV>Q4$KXSXQR23iH
zX|8BkJjRM}dcIE*cd_^aqPb0G?WnZtW_`Rsk(yz#PGz1ycys1{LgYc)&O7^c|50WQ
z?i(sR4mEIzJZXw{u`p&pz(I8jo9`RHR|ZJ@L|EguZ~MUsB1l#MOakSynjC-Qw5IO%
zquQCk^(4kiwi|BZ<42Iwb@u5aq78zrc>_fQM*E%9bh-9!KI(WhQ@7AIo$Y3zT43;g
zxxmw&C#P|)5Vhl)raPC57OQ^U`{gUCGO66zkk@f0@O}ukXnEm_c-EMEjf0=F!<3<9
zOs3tf{f#K^#1zlWXSHr++Tcn+G6ddN#unM8%jY+Go$7&?w{#VJ;lkIfmT#O+&3jsK
zo5icm?a*k&sqn@=@fBf>r@(6kfF%v4%S$(YN|%cnkI}fSq7jAk=rCW;T!;pE!set<
zm<HGe=ITdVM#AjMYFfe?Z59V+^gsj!w8s`rZUghgQLZ)MapPy-U2;QUa*sJHp6<^x
zu_|fW?_>y%%O=GqeD3g4IEvL|X%THyW+G@~?0b3Cege%vHNA>`@N3-k?cZv3fcR{2
z<H2PC(AS8^?g0-6^=VG^$d)_lMQeqIv!N7L7JWQy<^X>@oNaYVxiVfwmImmcATi$I
z?E7_r36Ew295+y3XR%<k_^XT3`A25=nf5$mi!|MOLZ~{__Mag9613)n?mC5QM{tFo
z*El~r?|Gg4huFdzzaW}~l!c#h9iId3`k6e`a4HV_j(XYtETmRO@cUE>g-^dM9*S&2
z-hmJ->MR;<O2JM%K|(!JgG1zk&PJdzr@LS%1MPeYhZKeShZ~b&{cTs#sf-7k^Kf>Z
zAs(XfP?b8`C|jd42quE19F<-56_f6=0ITu@39QN?t%Xc~a=Ml<tZsuozO>FzPeGXr
z+T(XPb%njNrQR<MQkXE{e;~uL|IPGETgjg>4or;}6d@x+Yi3Qy&rpib@osvCRr4?l
zI^b~5=nCyEeNo-jKq~kAW4^pQ{pt7SL1NPLNQ}FUMM0Lg5hwvRxhpu*Gy$T?G9F`4
z9>yE)@Oseo4(zD@8K*#9om$1T?xn}kxNeudY3SN5e#7A3WwHO(!J@*nKEi}UEi$#i
zXt_O^;Wmk)iZFn0iO>^h>&-}GspE;}8TiX}{CV!Fsz+A<W(0;H2p~}TCF%SZ2-*)=
z+T9Sr4I7wtfv(U-2urvDrpXFv+PBq`Pe9ZC570JLA+3WKdJm^67z@`JY2}(eiff+|
zySK^pjJsHZV#2kdP^}J7O1?*ZFk>kQushwl@E7TQ^c;p$7laPLCL!X#g?;>MEXb3O
zgyX+Qz=H_{TWb0qjmQ`3u7MD^W6uhpOe6cvPO+gr;`X>Rktbj8Q~gH}(wz0`haKx*
za-dHxGFZVNn%^(7z3w&Q32+r~&y4!I8vn6&7-0=z4_Cy$X!A*`_Cu}^@TPG`tS{zn
z4)yd9Zac9`z;R<x^ELiCyVZw;R0zjhuwdE6^aK@j9@F9PJKT^R^Y$XPVd#n0rEbSe
zEJcQoYLd7+oSe@n#+$O|+AkC`LQN#*s&IaIdtTx>4(qJCVk5QIZbzC_1o=my%A*pg
zjo#5;S2)R`2tro~?pDB!YfPny8|Mm!Pxt=S-c;T9cM)D*At&F1C8~AVJuYrFbtmvd
zDT619Sri_6TSA!Z0N^ExHS$R@Sbvegrr^U8=t&&HWO51r;zXk6Ax2SIx#4@#>Bz}l
z(5cKskzmj=;j3mW+zyaqUO~bg77@Xm7uU5p;;*zJ6UTBJV-xGnhOYP6TmbsekWrOc
zQ~)+0lM?Lm9Bu|VA%T4S<1Gb6q9rXNiu$=uqS}`il`0`gN&=pPM{UF+D<TT3=)@~Z
z{_~iW!JKs#RoA~vt$L=W3zpzfLxvx7fPtTgzEVwF>t*Qfmtm()3E&lrQitUOx!6o7
zR6JW0R?Uf%TaEcA=6Fac<XAEYMwW?5o?!_}=uaeC(^yQdBEi<bru6Q(MEZ<!s^&G`
zb3GI)I8)C1vV7@Ad^#6*0keZ#)PXhXAO&@xjym`pb-QuC2Zsq#zhck1{h-DQQ~uPE
z^RI)4w9hs2%Kk76kJ5%vw|u+6-D*abX`Q*l%z*h`6fw|uAG^Wn6Uuoq$Z%ISG}b7r
zQwdffr!FZMZjgrO;8rW~fOd&%P!+R_xvWz$NDb`d&A8@>z+z<RV@>Kqixmh{KJo|Z
zYy}N)BM_;=4T^O#jJ%oClbUNyv)G3Y7k&HilEnmKOnyqP7o$&MA@Ms4e<qml!xBD>
zj=cQ~LYk^xo>39{)2lO8DC5DqJg_%|EgL?R7x0ZBjPn0T3PJ(ra*a1M=M}`|D)3{B
zH)lkIdb)<ajR+T9K4>&E<h}MH;PFlOcE^L~m6`i0GZn=9a{XL6;PhP)PM=@xD!5?*
zrmvL)(K#{LEqHL&Qs$fdEOgU*w9A)V%gS9~2R8U*^(6|Z19r6nM?u7Ufx%QOJjOOm
zue%rXHB&}7r~8qg5$cK?UELVEniq%bDJUD#*dpLs{~~~a8>-}i8=4Ce0-;|+e}07e
zz~xaikb&nh2i8>>Q{$&CtBZ!GR{Rzg`7qY<!BNpeCP*SbL+4pn6x_*0dlWeYFA5@p
zhKl)7ln^9-@t!Cy=%?g_>j)=`ADU0{*-|$gG6~*-pRGTs5Uqb<z2n7^E#C7vt~H9B
zWZZklABi*U45QEl=xWVb*4!<h#wIMPez9`>lA|uq*WjW>9})gnqQB9}XKgyy{x_3f
zkDL*FX>jLJXH$kyXX6B;c;_DeaYva31!L=l<O7s?@$-=1IdU#eHl52|Bh-1;1j(tl
z8(1cYJ}QBb6jxSbZosNs1x^6ZZIv2+g=``r4(Cs2Dg^xH=)A_mK7pbl<i2?=Ej+?O
z2b4cX8W%75VKF~8Cu+A8&eBSv!N?eG0VAmXsPF)`;gOi=a#U$)`Fbs_aJ8vFFN5$j
z;e_{B1%3H`g{9t>j3yH{fdbQKT+M;q9gthf7<tM2G(rDqx!%(R(In4I#ekUu7iUPw
zsfLuZI9@&=c;XA>vdv?eUGCNvC?E4&O}QaVF+knv`o~+CSn3Tt+kZ}4y}!5~wr(JV
zS)TP0TGH43fyK;vJB`I`@5rn9R;??y2`P|UO8EavQn7=^B<d38rGxKWp4OWd>K-v3
zy;3*4s)5`6MS0}gn`$c?07J10rnjJ_w&};J#Toz*!MxPJCK^9q&q5cWAxbc&AL>%&
zVDx#i#Iz=c^1<+<!SF*B*3e=uN7)Xebvh)mC#xF{tc4{EkiJ#)nH5Jk1oOg$<gk)Q
zheqFa7A6pBY%#DJRVE~%Tx(qqi>dVz1g?P9%M?~GSIe{IqcGf+(Qx;G;f`cs<(d=N
z+cWZO-S#pAm?ju7O*nbz&F9pe!W21_8<xTRjEMrJY->*s03kD35C>|Q2bXu>gUGk-
zR3h!y?wQx0?@MZ-*Y7#hEAzgdjE;8weI+xUtEo2&5*2id)-!+_v9_jh#83x{@me`K
zyPaGu8FCG*rZAeBh2?0kicu71YrZV__`uhL1M0(nxv|A@^We01JWWvg=Ey5e_K>$R
zHl^6(IRw;7;&U?<Js$vs|F^J;Mp!%%PWVZnOwfH4%Gq1Fu24Y{#qvfWwN#W0ikPJ(
zMBdI9Qd7Fa=WD*yoz4RP1ynnIUpNqk2OOZG$lrhvA+FXTgFE{&+BjUb99T^x|0vW5
z7r*NrIQ)tlqg-U7Dq!Opy-}K0$$JSxy~Xt*E_Q`KV`TA96y?3*Mqy0P>lUu<-a`97
zcI|%pg>y~b;B=R3ejeM(8>enbbU5CEItXrCoQx>hWJarqL-K`GT>fMlz*lQ9k@nm%
z+gcvzL`_Tl&H8z`mSe4?qTGateOBFV6AlO5jx$`D_Bl0VOmqq3c)|rj-S=G6UF-(g
zTGKxwTdATpELaNFkvG%c<6JI=m)MK4%r;8OG*%U?S}|5Dt4_v-MXVlQ239Gu`=oft
zria}Ib$_MVy!}h6VYk>sHou<G$nm;BK+m~C_*Jcuzv}dAFR(F$;S6?WQcYN+?-|Kw
zP!0Nbhdc7lkl;dH@}A2ByX1)qw1`luUiTkQAF&o=r?R<g$iwkUNAMi8xF5d><4ut+
z84>U%%Fq%X_dWANLP^-B%CKIdW@N%BA{5KK2D`i3ghiqr&AAkru0e&xM692@(*y4G
zNxpYFU8YH59;%bGU5S^tW^j7vJgeka$6w=>Ove_78B&y%3|o+DSZDI3oW!+s)!bP^
zsWP=CUGel-jw#ZDgmS0ByjZso-$XVJ#2iXSE9I3_c~{Q;#1ipc@n0#9Z%SGJP(gWm
zY|n$+rtJWx=dQ*G?>s#;I4uz=hds=va6woiw0CxC1Kdu2Vlv#5Qw>~DI!(7qo+vWk
zJF`28)SEBbnrAn6eH_KHa!zXN5Zn?&iN+Dys^&h4TVtd^l;Y#gDeE2xH<F(G{b_`e
zG{w<KL4b%?Na)2Dmp@pdkYK*G*g)uk+C4VdBnrpUS18jS0w&`fhNpYwA#Ae?55#_U
z2Z+g7CT_v=L0W18X_n%WLkgbO6+D7DbueZHbDj$GtxaIv6a9ciFsBmR;4~pkad{wF
zq}TbaaS5mILv>o|@M^4xTcwI^@eM84(io50lND0u-F@6Dy;3|lTubx8URFfOjb=$F
zrf{`IWt;4IyAOv7#p@_DuYF++23rv#Dl)Fs=?E>!8JDh$l;|>kdL<aBiSgax;SOtS
zN7zmGpG)B4B=@oHVBsWN)UmM@h_&<P+d-A#aXm`m8P>f=q71YW^ixPi2%~i~&GZ)Q
zUTrhER+WqHfe~4{%b=syx`Sf;Ip%LbPFhijKd1L4zw<ehkaSmt)h2S1mh0miyPo4V
zDt;W_e;37JLWoaT_?GsqvnjFzCnXL@b1N$Bknj1pG;Y61Xe*G|=vw%Sea((Rz$*9j
zr}C@KfX_<gRn!b_g3>eHRd~fwQRr*-*1E`<d~qnv7az$q+*_-wXtX!lfIDG(I{<`k
zn#i$R{@$hn$pDn;7u!LC@L8w#n}oIUfJA_MdJ}y9Lz2;;V7vF1I1kON`4ZRpr1IjQ
z4^3h@6~6|kMWL2uuc9yoVt^s~Py<)^fXb|gAg8V<#F``eDrzI{IHf1>-HTjd$mhoz
zwCReyiVCGr>LT}R7u)qmS=U8w%!jM0wniEBM_p)B@i(!1vXJ{xSw34Ae`6icFo7TP
zZW7jZc(B6p!VOl#@=Eat&EM|C3q|%oxTE)}x^*t;YDx!954ms_sySY_8;&BI0MM);
zK+52pNgafAf;Z#1iJBtd&Zs*f<T5wPVB!jH7i@KK+fnt(?r>G?hoUf5stSTWp5idb
z8aoMXfq3YqmF$w?C=-;7a0gbXjxj+#kpMn8*&=xn*qoHtlqQ`LI8&na?%{030b72)
z<0d|XT6bikQHW@?B(1QE!~yXhM%MR)A{(TbIe@&L1VL^~MFc_`kfeE*v9PE?2vZnU
zwz}kv<eR@V8o`bpEW??aozST=FE<t_x$~UK1pq^7_yEX?*;W`C<&W|=?2PElmV<Ab
z-AEGgOp&sE;iS}2i9?ovFVkXq{pp44<W<a~kj3j3TUj3UDj%E+BV1%myD;+IWzDp-
zA*<KwkBwCgTk0-xLAd`ha0+>)M{fHq^E-FOhYh-1n%j&w$;qS-tJ02un+#Amh{xfN
zNAXDG1$wfWEN`2Ax*pfyVRckTmD{pC<jzTc(7AIep}Zq13nB~1;JebrgZ-;ZtN|PI
zQbrk^qYqVSYGAuvN&}<XUu{@t#2fZf27zhYi?Cf5i2^pr#D=o(JM)I?d70VpP58}{
zdrN22AKI)~9{9c2uN}}_kpU*Sl_<Hi>7j($o&*GpD$;B(N_akNc<UsddSlrLix{Ut
zxI)h?&c0D>->5{jUnoc1O&>`b?=*MKE3fDf_Pjt7!-raU@vkE9RB3A*uh~@>IrLi`
zlIJ{V;dWuoi}+YKNBw_GEw5LD+rnX#wzjxzwD+qB0}xT?OjZjWc7Il07GlO<-Lg0p
zvO&9CI}89vF;8-CUx0H<U+SpHRD|(HUKgDay4=w98QTJp3!cEu^lLJ@lk?z}wXFuO
zqxPd=jYq%?1ksaW@XUY}%GZ(Xx>*+wG*C-v*ft2@;PtJKQRYBhu%?fkf}F*LZLXVV
zK(=>`aC|+->W|gE$kB$*-^Kp!b4Kjj$H%`ZkmP(^dBTIQG|fCXkHQpQ^mg@ZdkWN3
zF2F8D?XyHd66CPW>NIQ@m7>hCwnx;4_t52%lN@Vv-L2*;HHvdES9X5?SqcFVdwfPQ
zPvp`gQ(cVHxei&^Ch_?GBN>qiLdUis6AAl1cfVJmd#qEq|ELrQG71wL9397bfCI$3
z)(`vy?qw|L<l>Gny8_1p$Q1)zQ|`buB@RqZpZlsaAOsPW@U-Pnl#xSbXJy___p&f>
z<$xn*z8JhY|61^-Gf=K&sEyMIzUzMLZtnqDcxkMMH{lbMl0rXU3KDcS<f^z1I!4>_
zIOQ<A5=Yj#%!I1H5T|cat!Sl+6P|^cfs3YLbXPF=m`))~x<@g4k<}6iY{>0q(Pg;v
zxF+Li7+pSzHG3*lTNUFxe@XQ=wttG)VmTtWJ}b^o`wko|>(*v%#V!hv)i;(3?>Me*
zxc(r1`t~O)-3^tlet{=d9pa{#X)7<}m&JL0jM^LLTfX~QoqPMbENLe^l%}6ghg2+1
z8SZ+C4SSJ~>j862dX0OaY*2{6gF4sB-R{L^VUKFuPh;Xw*NU>pAyESr5Iue|vV3>t
zUzrVTb3bML1BHCw<h(BCL7cNyRGr_osi7Vt9H(#_!dEZ3b#11?Fw#(H4q+i@Q`=Ix
zyTDQUI9}X_Ek4&B2&fzoI~4`ksmR6P{!j;os``B<Py`Mn*U@r0!3V#;dkW4Epg(Fe
z_;@O^@He>f&x};yznY__f=tK;qpwLv;jCnsx!L#K<vZ9C>bcd`wTOi$LMU8zdfMH`
zkr$%|o)Qc>$4w2BV_8kcSf-WjoVX(n6i&W^mw>`>beBd@2d_RX#S-N{Q0;U`-VC@5
zoW<1V<()=QB>69$B*x@o5|m)NQXs<p7*TZa9AQ}I)jl369#(k`C>y|GbN|sgs@Ef*
zHoF0jgY%Ihc7^xfbq0dVd2Hti@cAR!2?z=Q?+G9s?Cdz%3rtJ7;^3jN7=L&=Q1#BB
zuPHLrnWIq-4`Y)P1Gbs}n0)Dp+K}_wm=_#;rp+tfYu0|5k@)+;(}&f3V7t)JF`VHm
zw0qmMC3X~JbfKkI6k{oH+(rnK!>M<$s;0Y~FDf3@CX609?|6|5LrwxWc1{kswG*U=
zPdNj1gn}UuL0C!HU=)<qXc(it^|E{z%SO|vO>^=PgMcZpdJ?%inT*FM5Y?7o66n~5
zrA8-kWo)7tjAV@4<qs|$95S4%4yj~LZns4|5@4VT1A7oiQh-b1XSRu}Xo36x5~5Ba
zI*?y`dGj`VfXNqxi5>KJAD3@r;WgPR{L-SV>!X^-$iH4=B*XrH-%@L#yVE!?#&Xvo
z6A0e_PLffO_zJOaz~9x141zi6?*hccK6s&}m!1Oq)dARHOLBklU`w4@k<AjJW6c)g
zsNYxm+Z4Ousj64%Ox8wswc{otl-w>JB90cJip_H5y=>oYnDspyh3eD3X&v7IXoknV
zPkX9-pTMfL74S}_Wnmro<0ekSz2XL0+_mK4C?%{-m011V99|R`4*kH!7dnqYolDX}
zj+<!u9P<ZiVs@Y=K5SYEu})awhKWSZC5QXB8ft%;tSJFisL|PPMJB@Z8Ds^zJBHi?
z6<Rer43R7iN100kz(SfymT?w<8>%`01G)SZ!flU3^!h)Om4Ty`V%868zSpdLS<V+x
zXc!rv-A4Fp{AQXK{&rQy<|5xWmsH2lVIvrJcMOpBd~ut-)E*{sYF}4^k)Zs#j<2;x
zjt}eZ4%~#BCvE`%%(tehzhNDL&yz{{60?}og?vO-uKcV!*gH4KO}=7>m(yDnjQ<xo
zL=OYTTGlYcWMu>j(L#5*+rq{Ym~02gptYSR8DStl?Y3k)A=&Bn`1*lJCTkY3$m(W;
z<pCil1}60;j$#o4Lk6xn&q4)Qm|t`Gdg$?biv7ew#U!P=2})CA^x5?AkXB^CX4)ar
zQ3vfcEw@9)$Va(WV=5IeHD<e9XD->X#7noO<F~Dqi#dVsvN$^h4oYiaC<5j?6)eI(
z0-MwVQCDmI4W9oP3eQA80qYTHVaVT^{}Ut$`8|L5Vc|xq;x_<T9d`VPWUlVbvM-(I
z1tbp@g&Rci86O>*?)tm0>dGc#)X}XeVEAeU%lN)z<a%9DQ<+z}RSxVk0Bf9Qx&l5;
zAkhLK-P~OUH0%T9)EYavoe&PZ=mxx(*u5FwcZ7x-16xmJe2g?r%<u&6-fkr(JI)1#
zQ=$7L!`uaeK6~H}RF78sjR4RLz?1XXFK6VyW!^}jo%gSQFWdttok)?s*$*7JVBJA5
zH()bkK1;p>=|9nYp;~}KA{-ldE?-*AfF&V)<C}xNfKzSb41)=<YojJ>duS;>LGu91
zHd<H2*gh>l)r_L=1;B#+7Kr&q?~X1LpZL>PGP%H7HdqG=HdB}h)?y|Md76=-IvA_G
zl7A0-c?LRRf^{UJ6wGYjS<4tVCky3wS;P6UXf9SzQ|@WHhB+a7*+};r!7@aMZ{ZSi
zeF}d68dr}13);{8O#loS%cj9~5G9y0gz5j33;+%cm?|Jy(FyTH(B0w$@CB|s0l2`~
zm*t>fpx_v`<}AN@Rfq&<5v~>EvsY-R-_ib76(6)7<_G~#A<7ZlN&AZk)-^};!^|!F
z2pdJ<5gLw4Qik~l%-4|60RIIHK=VodXJ@&faxng3`<R?EqJRebjD{x=-xy>u5n?|Q
zkJGuOs$<DVEmZm8m^`x`Em{&_O!rZUk@4*+j*T-sa@mEmTIDCsF{@h9wOPzWwy(PC
zwLl1C$Kk5e?|XNJ7XHy@yyl~T>YM7S+f9xSKoL-ZK^vw6>}CH*CevZ5`K9`X*ezQw
zj1OAKz%ycqX*pHGJP9gXp-t5Kz_){ESrZcSSe)AmW&6IlA=-w%#97HdK~=^i=o8>-
z%*Ax%0<g;{ry^}(VI>tT&s>9<<8ne}%-RAQSe?N2v#6Z8>UN7ZU=#w3bA{$s)V+s1
zPoSQAgcR;mA>slIv+Pwld5wlTY{F62T_M*``45h|0aQAS>gx`nGAhR)7>2nF0^WSS
z3#5&m+bDMiboKdVH)7>8wnYj60M9T9)*I(r{;U`v&>DtpF{3+AK@}q2ux>@j?ol#2
z*^EgMMh_gAR?Su==j;gMT^cp>aP}d>oC4ik81*7z2Xj8&%YpPK*09#!-SwWG4O38-
zwJ}Oan&shOSJR7AR<MM(DU3M9xXElTYuF-Mk^TkyAO%YSP`{o8cW;QPErUK`GXx@F
znMIy5)(9Y^V=><QHdq^V&~jEG7@c!psld<qHs$3ho5NrLH7Xv<=3^I`!M)umAMJJ*
zoGv`IqKlK2dZR|hd*S0mz~UQ?&zl~;`W<+dUIEjaJ)(7+PkO`Ndu1w|1vF!X&d3s*
zg=~iX_bdz!-WHh`bM1E(xm&*(zomDjL)S$-2hMz23nUP9oMUp;Y$d?qhK$d1)-)VY
zC})gU>jVl-t?D=c5t-mYTb!g`41`BS@ia=f+kFl^f6VHUB@OWKU`M8)d=QDB0=H*x
z8Tg)F8lXp>i#~uHl$^6gAyErInYr$jKz0O1{%N+HRPeus0|h#qoAUb;!yDf;2TTt0
zz`5U&F++g{_-9}};i)AEC+L^FVrMBp>nL>x0y?5xIbnZ9SZgktIgyAc1t5#c*aa|S
z2SPzI8{b8Z=WvZo1SAt5X?GN`kE>zEL?Fpc`GZZTTq+`x#&@NI0j-S__#7kJ974av
zn_uD$WYLepUaDU2cmOyKK?h?}4~C1Wr|plJ_d6b4@H;Znx#nDq`5q5hH{y`jQ~4h9
zIR41(MV?Rr<Oy|SQ3Y5AcrjzZiwPh8d=6p(#3<6V46zevb_}ye$1@u#aRKS3O_jt6
zca~!t1NsaiJ%PDMj3Nn!Eu|PRc*VN0Y{I!a&KKRy2iVJLROI9?^{WI-lAMbgSkLeX
z90%sttQTEQ9GgeG<iwCw3YoL~543`2Hl6_(pz{~T1LEOmQ`k5o=Z78pgTV@IvS^gK
zPFH1;?BJB4P|Vpz*f9`J_h5dZv4X!9rU5i7*t+Y%{DIi-N;dWXDi$!<S5>&pSX1bM
zT^b_e0tESwWHGdyu_24O<_3>u1F4B6i*SrPoHnrEs(hBw!At(s%;zC8;na8|zROYz
zF)9J-zVD_~`LzfQ2#-U0^10pG$G6mG0{ne0hR4}`0einF3v@*xt(q}CCpZ9pu|O0v
zhvGlt%c=R>`Ic3Wdvl<di|zc*OuZXO8+uNK_$R|`#9yn$Z??xead*kAyIQEHf{=4q
zG^SW<s9Sa7q*Rb}G%S}P2ogQ*4f~8tc{{XDBb@YnA*`J9pzQmGfWRU>?FDTzo$F@%
z--HPriuY)yZshI8pIQLn;yg^-4j9(v8#7mNF$k&{%a#Xd69njUtn$y(u>jhDmRug0
z?kc`16O530U6Y%l&|(gDF!Z+j3JG;?;7A03%Kw$LoyqS0A+>tsb79z2ejM~s9t&|i
zroh>L`9*d0u}z2JC-6iwIo}5gr~2&><s7n2?Y9!~dIaW0#_mcuNYKPpbHrte6Wp$b
z(x8P;d4r}koShg07({c>#SO25RvzMjYVtvqogfwV9UA_k?mf!6(KdaX<i+Z$SHER8
zo_q_tmdbc_0YEZt`OylN+A#UgG)+(v7gd#4i*{M0#3;{BG%F#?9d|f}TlaGv5Kx^?
z!wGg)ay;}Y`AfP3sA&-S)xRmO|4ltcy5qm-(6?hePv-tgzlg$%hO;-cms^DBSltG9
z6_efZ61o+k42srHwm|j~?ty_SKls~VAk8VTd%+{TNFDztIWtK91m^nJFr*W!@sAq#
zehE-&oeBX<jXMePJ3NHbmhX*J%&ZVA=Ztt3*4;IvSl;}xin+i7Wb6mP4EV@VED&QU
zE(=0taaq7530p=)EJd~dw*-tHK`UJMpMw=-E*5jj#yb;HX=g?OYGF})ro*AR(9Duf
z>we{V6D#F9)&!8<anWOkKLHO$Z0YN%P?tl3fS(I{#qVgcjKAUF@W`q^nA}gWPX(H>
z`#oh<8#EB1^oCPa`^5ba|5yvqP9H#xx`EXRZC`(i&iN6#^Xp9TL-NFDt%(W>TFqGC
z=z0amWK9+#!hrEhb%beg0gK`wy>~jJQDg5LuBszaLBNAoIPC5t_dV)o=H~z)2bdcc
z$Ga^$k^zM*GXY<ED1?yl9|Gh)vmDUQl;4jgY!if8v9Bm3^<_wkxKb@KY(6i-uHS=K
zGtU>+Ed#JxWcOc`e0cGQtKvQ-8}WlN*K;I|-cWDVbl^Ymhpi06GJI*O>8F|wWu3+I
z_B7(90OQpBVMABn^?mL<&k_63l}(TPp7WdKObwzPJiLa{Qz%4u9L4Lv_ws*AB+4_^
zbXn}0{}@AB5vN)G4ikuM0_3y-XvSz?$Q&_jNRY|o&J3}62@!i@EW(i(;Tu$kw^K{M
z1#(?u(a%31)($*x0#g~|;6WkB|2)2+2*FAb+?Uyh^c*MEqAe-VX8kfI=jVW=0}H`F
zwDpE}`|N8<#w}(&UfyrtG-J62g~JPTUpMoWfHRMp*IYLlQ(dxFak-(!5StG^gw0Aj
zS^kQPvFK#q<lt{~ms_1CqUjUqAp%w&BZFfnEtQi0?vqF~d!ks@X`Z<Lpq94i_9=~|
zx~7DV18iz5LzY^3__0mvC)Mq-9J+0M-8E5$xZMU4XOy@@qU>eEY1Pc3&M&o`c=}b6
zF_~Jo5@laQ)?c=yFCH6gbrYh$j1i)6FhAUC_G~VzP`r*pNy$fr*^oYqAw0#pt3`yE
zd+2>Eo$tYhb@cudJsd>R>7DxY{ybSMar|rGNU-#dUXbf=iKUb8>d^CZG|uAGf45mi
zu^vE0_n@d772QWg!>FiShu*Jexaq;B$fNey^*18vI0sEc&jY80vl$m%DRoCDU<y?3
zrg9!v2$U-tne6_y|0zF(UUDy2gs2?kW7f<yqa;moXh}84rhGwVAwFiL0v9M6K}9pD
zC=A5<rUOSl>(adJu_>H+BE(e4?7Cn~av+>Phf|lewZQH=E-?r<^w8go<kW}$&}jHW
zA4&Ey8STL_jS=)r$!A6lJxb)5((0EpUi<fDBFU#38tA=;20eK;7TEP=7t0Su5^$7y
zr_^(}6Hj`&gO^g_G8*V_58BikOK*vT8&vyaYGcTsjHIgACh}RInmzCT(0Nx%-7Wpe
z>E)`k6Zp^P&4aF&$C(F(s71aj)$x%2G?~jE(F6<qAz0{ZjEa;SRyEneD+=#lWzSX<
zj(HJs?fS<)t-wys{q_@hn(eZnC3blt8{$--ac2;zK2db{dL5%?<vd$9>@LX0FYi3X
z_@?U-dAb9?^s%L%VDk9>r<^WjX}XS9c>-HsCVX@aquUsyJyB+iXzD}5%eH$MjU`oO
z%9DDwZ*D6toto``kIo*%@K+lFCe|`@^K42k=C8^G&MB>qu1D`)F-of75hl0KCk4q;
zq#KtrR9y~cd&4^pAS|PhRki8f&78#M!i~Lm`eNy=3^Q!*MiqEU9HsCuHP4^LSzod>
zYo-a9Gs~fo2(cjfH16dMV-i(A4ZhQZ&8S&9oN)$r27dM`nmfzeuZ4Jy1jjT^d_z(y
z*U6%2I@`rT-z;1pL4=Z|DmIrndfE0|y$NZ=LkWASByz5zKdSSUSXRD)P%=01%7AMW
z-DZeOSz^m2)gxc<*j+awO`2Ed?8)jE-Lu1w^gNKTM?*a+?&=e2d#HM7lj%ki22nhX
zkQAp*@LVpjWnB5ll5-C(5QIFLwpTObqP%F~zdv_6@*Z+0tmOXt>7yr;eR>TtDFLf2
zb~+pkJWGkASW6uyk<^xHs5?m=sUZ?`&)mt+r;12C->f$Jl`!a$RR8Y$=`+^b)8>;8
z1u112V>RZ=Hy_uS2UNxRyJshD_kyHC!Oqt~f;;c@*$)?jWeGMyuT9f(TN-Tr9Zn5p
zJtn{R{E~6*tGyqW8f>bCiG?0?@7@`SBRwYepLQuwTcoy6RJ`!8&eC~r$y<9){jI0c
zQHQfR_5=B%&MNK}&nxd~xm%<R6GYZsRg%K4yBd{xx{Z{w<xl+j3wA0taUq`wqkBfa
z9T+I_@@bawyPQijm7*>YM@?@s8%Z!S+ej<RZEMc$opf3#tvH@`YDdxpX=RP=(2{3X
zDCCnFk;C{#K_sT^?s<r-IK2Jy>y0!kT!@3oW810xsPkzPBw1_4G4GMm$2IXEDkCaS
z%RkS;Ztz=5HF-}`^ir7@oQX~Q_}frTg7x{d(~2ot+G3{aZeA)e4i6vO@)ty<rAd;N
z)v%^lUC-9c%WQ%6%^so@#Vu6h_sv6^+F(M5)BS|mjkT1YJ!tCAI3L0pz7lt_QgQ4K
zNAu0QmsYMRaL^W8_I&f|(VhaL)n}Ry&RTskzNLns{QB`v$v00Gn%a9WNZK{Ei)}Bx
z$WWaPT592y<(QX~o;IJH3rZJhp!#cz%_XggPPln_Mo8LePwOuYw)o8@E?(|wU;VWu
z0F3oeL71I%<BGfn1L&2+*@JUf^lEkqrmcy8g5Tlrm3hfj)H!ORuM=59jGvMhZ)lyY
z-=?}_>?wc!k`!jYzepyvqI)kuS0tl*$${H0xcxYDz9ahMGmd#U?PWBz`p2=JA4b29
zGAcS_I*1?f&w$@enuSR>{XXG&=<e{eB44(q?!e6F<DT_hGn&C>XQfDF#)HRZR?6Q9
zV#+B44YpK=)>IMY=T@9VD`GIzl3dK^iWXIpID0l^-1yVXDu8NS)`aBeDw8YnaRnYO
zUi6%#;Iz|8)?YkTtkpj>#3t=cs(L|K57ruiNG)NrDw^PZd6(I<&6wp<x#40ZH#iyV
zdQ%yFO^lDfDN13LpNG*MNn`;};iJv@n#-)OX7S6V;XCQ{9O?S5dhJM$?W@S79p+~o
zT4^H7o?CL(S_YiG#yLP=C`;+kEOpPJ-#Q~%kiT-7`Bj@Yk?uK3-#oXTamct!5bA58
zqe@)CgQ?T+foy>cz!^!3vrj(fvyNH!cF*P$CURwATCCGX2?O$;Z*k={t;$OajCObx
z8r%~hEjeehBhO|DIXw0Jm-^DBHq_|sL)Esa_?(fznLYj>a=0!nI{RtL`=nrpu9&p@
zBmL&M$cN4LoY8cj!=^at`b>KrzB`KF^34diZ}~=>^K8D5PJ7sYA-z9QU~sp2M3x%t
zFm!>?Y3P~N|D37^Xu7$htX3*sYO;o@J=~0;Q_1EdVdywvN*N=COL+BK%BP5M=Em1w
z8;Ehl9;knuxIz8M=`}TUQ+^832L7$!x0V;5IQ>4bXZ&@-5&N(C4ql}9*<`o5TtPNj
zk1O|_wdax)eRXlp+;hC;n%Wj0^6{&1OLn>2<L}mFI{Gs!ZTLeR$MObX>&E2E?Ph!Z
z*(J?%cTuEI7h6{F{*wOnPCFew<jc6(LvonplkFE}?32xExGH$l%=)vukuB!AsT~6C
zbhyY_>slft(NIrDl4N)LTi(o~)5h&|F^Lp{x)^8fnfh*7ss_r%)z=Uqi86jqCmbe0
z;%0w0-*)F%T2S%<3nnR^**3r8Om7rt=`FvjlD%5(>u_*;j26zhb*m&+bMMLNi$NXc
zr;V+eMI)2wjZKWc{lbt*(NLckSh35YJpXr)cQC)3f1D)cW?!Cv#-H?wPI#F4{pXKb
z_hH%^8wqhubyI#5N^epq2$wt88&H9S3Ijom#cACgGo``bR!Uf^nrYR{HoT)>n2LnN
z!+xhjvWB|GRV&U~;_CPGUyB0#B*Z1e2R&fjSqIBd^G5TX4ywmU-*dYh#>h94Mees+
zNr>Oa4tkhre$I)bIDdfAI+vpyCD2p94ti{Wvj#aa+yHYTZKcoFJ1E%dbSdf$6^|Y&
zDTjqR)_HH8hWZJ$575JE57buxw4-k{A0wkm^>!jrGv#q+e{Mcpj9F)Wl+<jatc^QS
z@Mj;R?^S{n_I@ih)P7E$qA%5KLsDIKqM#jBW=c`Ffm(3S`Q;pIFh56giqb^lcqd*>
ztcY?-;*N=H_}h&xBl^pmo+YfoeJ0l>C!SCXmQ8x(lc2inGkN<=Bv~`sK&l|MWrQ==
znKzI?*3A8uV6e$Fh*Xeja{2MOpm>iHktG=~0xaeFY%ia2Ace;f)C%ZImu;=Y#Xosi
zU(JtI-ApEOXw(ldMs;Wjo`%)Lv{d{zCxbNkNyXQKWDIAPWUO<6n#dS(+`BeZ^RZ7R
z+)10fA9IKxvf}DPhS|0JC*QOJLj^u$4vgjq)>EDwK3`tJ8DPJ4EG{`PUGuvTuc}xv
zUHzhM4dv>OmcJI-=;O9JL?@qiB#CcSaVG|lxZH@30%TQ=rQ6Ex9O<169ae;C2or_w
zi4j}yX4d2GGrKAaO<`--8FkZ654gg*v{>;i?dZ1ZnO!W6V~pxX85h&<@<h55w;V-x
zU4pLAI4l1lqg#<t)0LnbTebO(Eq}eZokTMF-2I52=x#6UTNU^QM#ff$V{Z2I{VnR?
zb$o4i;8GV(Fhlmk9U=VA78%l;nYf#LQI8b)`l}U0Vy{nM#jB}*^H6edcri|%G!Pic
z%;{GWvZg%gBTue9s|dOJ4QbrsTi!Fw^7E}XshAK0x~2PFcKG?%L_Z`3bRAQANZg`Z
zZ+0jD37h7+w{&&8G;WD4KB!<QpdjcnXPLd9e=?u4MXs9ITl!r_WKwnum9b9Z^Rgai
zICB`NI{qB1?1hsVvlLmfbzEKFKk<0<F}W~9HMBFPJn9`iN#0XMLtPD$s~#}Ylye`~
z{F*$U9PR#yzSWg41rFZ6lP`DyW*)A_OkWae#%%j*GD-4+uE~p%gA$(;Q0PUZ5r%!=
zNO8>=XqMa;_;nSOI>NQS1@1{CnBL8|thba9w~~5KS5jNH%VD`E4A~r*S`w*=pt=%T
zh(t0>IX?@n16}hNOfWyS+UtBuwa_Kf%l;Pbr}7UpDXPX*c`^`oLs$WL9AkgSN`O(F
z_L9hYh(&_c;eG#XYQ+`BbvTW^4)w8d(kX;@baSNFA~ly;^h4=Y_gtj&iX%xn8786l
z4wYZa;TfNsQ;mO!q3%DZdpa+eus7`~o=!FA;6@hgme3o!D=y=AP!}|8bx$)*P_SX1
zp^Dt6QVC-J_hhPEr`bjpy|YvBK>D-bJ)XFpp=#L4iC$qK$%~$vw9(6DtOYC&fd2+~
z)xdj?LbKVkB1(yNY)cr1jC0eM@GzmNz4uW0UrAt~4?UHsur)2~#P1ku0afk(h&=W_
z)gRsSe@{Aa+RZi`xApDD$Sn-mY+AwTlu;1?j9V?TymWe-IY->_uL6%1$$lk$;|JsE
zg7q85Lyk{g)()`$q6f3jk@e+4n<Djb-(=2@iD|08^-ytkc*w9V&yPw@J5J(J)&4{m
z-RSj>sC@BpO`P@Gw9^tPhX_9jZfG@jYBrUnimxv`m0IW{^C9zEeh?KJPuDVn5GNO6
zD2-Sd&3Dm$_H2**Ay-Sb5Xqbu=cWTjCUw#9*#dh!%2j`Y2n=WsCH1Q<3^NCZ+~m_R
zv{l7Oq!idI((jHpB{$tR*2eAd_u=%6(<r|oOCrI(zMcL<IuQw)qt2vJKYMdf7iC?K
zPJb`x?#qp(T-c^M3WI75CIaxo``iTuL6<%z)+!<0CY;ohIU9U&GKn#IXk<p$o9nIk
zV5aOvLZHmXH*fyPl-=p))owh0KkBe!{r4MR)=4DJ)u_X&N4LIoCO@C7x=j5lEPa$8
zMGpc9f9p9pI4qmxnk~prFIfk~?tnpSd!~3}`k1*%jg95Aut*`9!HG@=YG|!dZws?w
z_iB&0nE*ncM>|?(DX=n<NU$=htHV-DB%({fk}58aE)2`9gTsFi>c0GVUi_C_K($cR
zx0ksnyoyDVomHVN*<E*f8;zIBuiIsM=VaZvzGUX(5Bz?W?IS9`UOi<>Rr`P6%+<d8
z27#eV(JrOnduPmBZeiGxNLH%aMB?YtWC$<cy)-6E62jeUT@Q!OGFo!9eY+I-ii8!m
z9&6Eb+CFwRS?{)oPjguNWk>Y27Nf5f*1!z}0iWh0RwXy`;cH!SwbU><<BIV*+{zQ)
zT)D*P<g~@Y=+ma4Pg@*)+AGv2%XQ|vSya=p(B|%80uapfv%7*~-*3G-V(aVBVnKWI
z*E&`u$?mBRr{ovUG6f$l8I({xazAMWqt&>LzCJ(lcDd8f%k-8ZwA}u>mNQj@g~DAQ
zJhTJX3rup=?)qTQ<r(*+EUo-9XbHFAuM#;{0Ky%)_3P870#Xt1JjzXyH^SSFp|1t6
z%=FwJDsZ~zDWPwPHD^K?Eyjma(KyyXf6}fG=aTjAAB?@%Dyup=sXBQ=dZGIB#yrIx
z4)84QwdTXC89#A8Nbf8OE?pl=5Ia`DaB}F#g_+@w&FjO2D<>&;Y~Yz6PQBo7KVK|6
zqM<%Sh6&{R?~~LifPVp44%k74qSEWXZTf>1`>BRi&#dI+q+#$YPEY&o{v=NHQcmBo
z*+n(>A-(lb8X_})f<E(3W6RpK*n19Ts$z#z^(*7dnSb#k#*vG7DeQ`?ew#q!K@#H6
zv-qtIg{BN8L1|HoY-vg-;HJw9Gm@KLB^(1iWZ{`oKJ3}pn}>q+&^BX9Kv(C?3hlK=
z2?Dre_Le81D;g%J>g4a|=jSA+{d=-;2quArK^Jg?s|TABND!MFb^2&zq&!A#Jr)Mp
z!kDyv19QXA!}RNW4}j=bvb%yuzu(#<>kWiga0%C1NN_725`8=C*fXdTn=G<IU3{zE
zwR|c8SBN`Ia3@Bul`5v2Ts-4QQru{ME&t-$w4Q^?TOF8^H4M<@%2Y=oedkd_QAhFt
zppS2L;PM<!@v-N;GG;4v#^JKzijP-}rLK+P@8vs^lu<XLsz(kIgQ-k351>LWoY91%
zvP&-}+p>9ZM;*N!>Z!-I==Ps4I|k2T;X(ZTXD!S=AL{gQ>gs8#+9VRgAni28S|5@R
zmG}D1h|04Xb`B0BA6p=M2_~dP$*6~l`qk7gU7kJhCFtCD;7pRFZkI_8br-B`+o_y+
z$~7j~|KrSzKz-(oet7Y5ysF8Lq;>H1G_#d@yA$ocFqUs^jY_t<md}G~#5SrF(^bBC
zh_2W>yEd)wZ%_1<!4JP<YEXXB7Fw)LtD(Hig|6yf=g#Mxp?4T*r^Qz@g&(3mhraQL
z0PXfN_;_N%?V9_HXU|%3;MzGiobc1YOgzA^RA<g6Up!Q{qIL8dT1V$68~rk3E#(6)
zvW0E|*0S}e^8qArjsWwLUmRtA`hg{QzNyD1n97)Q(1+RN3dQ-Ze@s;EsOw-q0-PUp
zh;<dByii^`)&{&%-wqCCik{E7QQflMP}L?5rijzb@ewCC_ZPt=SN3DBgdN%nwD2#!
zVFqf#oDQ#sUVPjaYI-f74$nsAW2PgC2zQ@y5>2b<Z((TgZfy;QX`qPyhLL3aJspBI
zL?6N7waSyClb%gWl(HRvcZx5HTo*c?FqUwVAn<#Bnv((d@A;%9LMF$2sI`$#cS(DG
zQt(eThvL_{qz57D2XB+Qt2ne%r-)hibn3gSHs3OqEBEmF1Xf$WO?k_(DHm-maN9>D
z&e}Wp5oEKx8S5mo^1D6sO`30CeEgMO{yGNzATb#JQFLnZX?v<4q3LxlEVe4>ylRDh
zp5FJPh5T%r>^U`FQ7*jw+w(41@V|I`LDpsidOt_!um))?W@Vf*7_pO)m6{H3439);
z%wJ%tJ`JMFnbqni2{u^S*O|Z895ExcBl|elY!IZLn|ePsR5YdbaJtMx_`)R%mhTx=
z-O4V@PTw12Xc3eLvz|5>!81HJc`0q!tSa^?4V0QDu$%v=N_~?#Q7*EkX3qx?r48}}
zzME<xrw+oKKRJEz$fNf&R&Gbea|&H`)|E(tI=IKp=+5(yRbHHEc<FKWz<ikSEq`<U
z$@dkj2;9P!&nhiuPXGDkkq60N{#^|GEsxcp<q-;f<g)ED%7L~j@U?6Nze;X0csJgA
zfcr&14T{Dg=P#(Yl%DTTIE(xGf-&#{dhq5VGG$PvSqf_Vp9)gwp_d*X(Hy;ezXrBK
zcWX$Kfdw`)DH5K%<Mcm?^|BohO{s<1$s?ik63&U7tp3Z4vk32Sk63cVlANcsL4B#G
z`nzmC-Tm8YER@wYi^!+s*b;*rbnCHWbbX9MpHz?zm(TE$C#DHk6fz7GD=IjB4)N@1
zRv4pyRpoxd3IF-1UR-ujbpo>6qaI4_)JdYM^%FmHk0{sq37Kf_jrSHlK|0yJTEB*9
zDvgzZ?(dJ&<?0bbi6l%zc^*fm3dD`&O*0MSuX*>(1gC+6X?@9AXA)RgDRc>E^HiL=
zgeMKBp8Hso*wbWVgS|gYxC@@3?`64ECpygJHrSLnl#snn)0?5?uEVC-v&d^TU%Clv
zceGiRVy#xHN>RDjFGkFzwp%b{Q!p5|Rs7E#yqhX+sI@&3JDhdKL!43{Px#H=!8UCR
zZaWyjC=|6)UgC-!H%yva1bB%(7O4ELahA7d+*W2L|2zTAMDF#rck^S_v|;C%_c$l6
z-XqRhLVT5{$}R_$k962K+NOaW2sWkj*_7m!>bo4y9k9oJUF9h^hZKgxYV(L20b#kd
zYc~LegX%<%jvOwTB7Xe4kJ0I3dMp1<ehxKladMy?tWrO1a^KNUc*IfStgX{d&n3*=
zA|s9<Cc)hKF>9G+vSrA8g*J^z5@-{RHj@FU?FZx<0-{~y8Y<z6xik9**;sCKlyR)A
z)0@mY`Oay?+Br{4H~q25Tn~2%&<^zH!=zp9-*d2*X@DjToq8^T3k9Iv>35^mg`HGA
zdaC&)*iAB;Y%IoFU{Sw+!{Q75dm%Ax*$JOk#?<><v}D1|#{%c(USHl8>N!J<@=@q)
z*sVIg-U->c;4&u)DmM0pY+5pB{Yr`>ESs~I1=J(E*<_#(Y+TW$&_#Y2&-_SU^W{m$
z=51rJF95NeWT$2uE7elwrj)1&3n|4J7FzN9)T#0tk3J^=92TAIVYcULOYBiFVuokM
z<6R?+XYOw9YJA9W7|6BEwykxh93qIHRAc_W7Q8m_4X9?<`{`id+12zGY&K7?Z7ojq
z+sxTH`&v$9W1c&aDD4SKMO1QuBPr25jUq1o)??v!Mk-`;NJwh!Le-amwSgUf<nh-B
z%ju;-Q0Xn;v2vHZYhx}f8sY(`pcw5mK<8^&iu=sk(Sm2nHItiOWWt8EA@1ijn7OXQ
zTli^V{$;V>3Ksu;pfeM*!MgV4zU>C*zp^05)Dx03Qeo|9F6Td5ojfs(HXC8#pw?>>
zIX<<A7TXTjD)QaYQrMCskc<>m&?Xo}P!ldNb%HV+QaPHM7%%qAAT=bsQ1i6-P2>n$
zkF;23^_<?ZpkG`Fa<-n=NRt2U_V0rkxf5x`W4Zj!JI0m`p0k6kvjTVC*rqt+dc#$U
zE_<*Um6CiX|7c$SO>=ToYf|T|#!KVlL@~7KQ4U7C7v@6Vvaq@@+QKk*LVOw<LFLFn
znnggTP;&gUgbheJuv<4l>wZz)J*wl))gvy>?2f6(XlR1o`9p_+Jw$~NLlX|HWWxvp
zBM3Ej_|zBvtA?DfOD4XCmJVbt)|uh!{oi}h|0Xnv)W&~mn9rLT1^~rp2YhE(m%Y%C
z;e~{)*n=!_M)>YG70Dl;Wy(@_P%nbrmJv#@xtd?cuoM^9lL7;->ar~k-5xm<3aU&@
zPE=R-Ban&2jplPg&l?yrAD1pF_@Ax*VEBS93Ic&*>8>Q9sh*joN4kf*I9C^i8!f$`
z=)8%xlDYr?Z+|1&xi8Xue^G=lJ?`Fgg}D{!290b^d!AFFgEUkPGdN!(3)N7jZ}aH=
zi&KVY0a4)#=Pgy+`{%OrQD21?W7Vp~<98TIM(&*c=rRJ<A9%NU?=;TBP(S7aL-&r&
zvWvF0yQE?04z+NrZa$o94&(Kn4$J}_xiHG#X`u0YkNWop+b6nd`i^O7`V&kT!K+L`
zjWpQO4w0F?l;uQ%=nQJb>_rLnN|{Q2zen;u6Gjc}qRnYZyk_Gr*Vu0G1p2dx@ox<o
z8hBO@#|d6*vk@WZxoZ-2>tQb9zhJ^>CIyyu_h+h6Wn{;j>KhK&qB2>v(GR8HMJ>}P
z_pxQ=4#lZTIcV-mKy#M~YR|2<xj2;&F8O<#O=5%1_tF8&wD?);sob49(d#>hMBF^p
zy&P!Q9>a;b9a=!hDEzoq?N0pRnM4s5QDxOb@nZLa?sg3_n$`p}j;Jo(j@<Dd_+Ec8
zGgtoov6*>_ZB|`=PD<K;NnRpjVN5v>(Oeu^41GLR2v<$Pd^Hw!>HK`N?oJyqsgxUp
z?@7>RFQsh#iY9<mzG8AA@7sHMu%fgutdh>cnzK&i497+A^DZC*7GVUKzTK^;b?0A<
zai-N-9o=U@_eynwI=c3vWb&ksQg#xO{*lnPntM33*2kXN%QVQOh)9XwBpj3ay!ilt
z^230@ek=V>XXt9PO@DFpo8;7up9HNZgj7Nxn-jO1*XP&OTS|#LNvUNktyt#i;Nh8b
zhH~u;m6Vv0NKpU(6Ot{9vzA(o+MGo_EL$<U^%Y`4$8fvBd7}Pza%P`gGdg^Sb42*v
zKGl!OFTm6GB0(05ZdWOL;jf@<mr5j&RxBf^@AWh@C;on>F26hPaqJn;A`(dqyEORo
zQb0Z_od6<WB{l~uaUFtTNTqa8QB$?~^3TnJ^_teGQX}`V3c3%V)uDWG=P)6xh43g2
z?<foDHdBR@Uk@6pG%QI01vOhK*Oq8bJW%i8;n1Cjves#oGn5W$L0!J3>gGgJ;zlHN
zX+h|Zn|guM(qmv^5&Q}km%cK+z)9)k8Te-2d%(+UVL(SY$^UHKQ<yAOm{jbZP5Ag1
z_?$KZ_mCv_Eq``u{%rkqRzuD;t`SBjqIMm>IpE#3E$^K<5k}0?l#4w*dIEd12L2yo
zR~`@5_rJACqR18^OPH}YNR+*?he1kNYbe^KMH>=jB+HPdWEo3CyEZ~nDl=&zT7{2B
zBuS&vWc$6(HKgV9`F;OzUU$wt_spH^+<VV?-p}*A*D<1ta+n-WI{#Id9qwqCgkpgD
zCijCW1;r$|8F}r0tz3<DB8@5o-Md%$WB|~`g7{$8*^d5WY4`Qzw{P*Pg=D#476CKm
z7u0|JAYDew3qgK^p2!xnSGCRLmljDRs;lb16utqoqz&-D6jw7Iz<(GX=o&H~v%G3|
z7;y(=u0W_MFU9UlUGD!=a8)Z%mI{z2O|Ctr-|_Bs_!_*zY|h0AqRcMEnt^a(2qoun
z16XB461L^~QuA>dHx2`qO%%FK$-jDsdjA`F^%mx-Xp4e0rF=)ba`E{A_MLf$@oo?=
zoCYyOm>?(b#;<0j)H{f}<>&fPjuTYAx>lv&A+mVk4z=%sg-}ySyJGX@v+LCO1Bi>D
z{~!Jk#Rb((gt-u3<q3B$m^mM4cJr56XnCtF(0lE%-S{K|gea8)tUL3Tu#VI_#HK);
zau#0CRY%1&FxSUEx5l=-e#Y>28C2W*gTv(#_C<wc_9bns-lsYm|LJ@|mJP|YgSb#b
zW{PLvvESlA4O^KRZKhO+4;7l>FF(@k<0cWnVtm6S@Mto>s1|zt_>gS>M0t^?6GHq1
zcGR@5JvQiw!a2_rpC)SEXu0qOX34+AaT<&R9u*PW=rxB&X4EiA0z%U&wchXv8+rHE
zHS{FJ?y@F(TB+Rw)i+zbH&&rr^96&EDk|G>lPptYR{&efI40@~;J(e+P@fR8D1QRL
zEDF`Z=iWMN&TKiUnD{7m&c}gF&CS^($1N)oqr}7QehJ;~=&&klh%EE^WD1SjS4gcO
zT_VXn%xa{=gD$?4tR^mt9=@^-l}-yUk?b_|{;lXeHGoVQA&e0NhB_&%29z6bjy&YX
zizMTI6fi_-5Uup43CgB^Dox+(5w#eHUkMS*b$xB@92pe|RvsH#Ov=tt+DH?WOTDdf
z_6aFzXMlRByP$6%l(|}N*}ziBzDQDr2C@e0A3VCyrKv5xAo!W`BAa@JnMb=c(_CIK
zJWHT&D{W}EZQX+bBr2H<RDjA8T{9)SDlV;W(V6WvNl?f|)Mm)cbAx-`G1?18t`_=D
zs}Ni48e)&li-N6E_{phP0#p~Mm!O}_oaqRcAR8i1Fl&8DPb0u9DkFjF>-*Lf;w(PE
z<NBi;m0!CFdf>Rhy#fmvhzPF6tw`~m3s{0ikM4_zsfyF>Rg*17Pr{o9WHq#)NX1Ua
z#4K}QZ~+e8&FDm#=iwYxHljAweekv9<><uGG4`*<&KdhM8v<@YAxyM2cC#~K{A^-n
zd67I*;Ro}!UZ%zGwu97ohf#dl%DY?aRrn>%MDdxPx1uMM=-Qe%-!ygF-yB1BX=LOs
z3v9Jk$*rl1x3{Im!i8ZuHZl&vl9e<KueUX47DQvMx9^{;R)M&l%i%#8i(M=UxL750
zOVs%H9uf&+hJ|c3<xTE&>Z3it7d#ryZ#+7U4-KM9&h5+<qFo|UChz4Pnlxp_E5+e$
zbeysPw;W=ZqK@$PIe>?^k}ljY0{QS(s;s99Q~coN_1Asuxx5Z!++T}T!fH|JIILPH
zyFu*7FZc?aCfewH&77kGw>ZoV%{SzKa_ZNS%zZrRpNZODbHDa+KFY!*`v4xU;div;
ztVlV_avVTh4c{^D1xDuh%bIlRyiZGXRL(%0^5;4g4)n422vFT!Fey$F+u@tGxnF*4
zd0qarac0oY#7PPQlSp6e^Pk-sbXMK7vNcZX`+Tu?7x*U^eK%r6wYJ+D$+os<&7fok
zsVVo-1CL~~O@S}*U3v%Mu}U9ZwTm1aa*}@_JSgez<I|^VUR1ZPeZj0}o5qV5p*C@v
zlI0Z@=RK(X`Z0SiuMo#-qL&B2LDsHQ@6zq$#N%!|<*W7uxxgpr;9dNXM?F}r000GP
zu{KQ0T^KT)Iw5@55pcEccveDP(Ucqwj0nMIW+StXt}H~6Xuu~bdAQqr157j?5gxX&
z^mB>W4gp|I7$`qYloXzi(-I6%DS`E)72v1VV{Q8)E-QMtFGrufO91<Akl+V!SP+ie
zj=tqazaDpw%<Y!mmU7&6sw^K0fthT*1@8;-TS`8YI;IEAnM)XMPOpi{?XVNFr#N99
z&rT74qu8s7H(u@H8d?WvvtTzlqhesl5K%c!pi>0c$HQF=eboo2cc!w*bj0sS4JBQo
z+s}q@3V9|)Vp-ADyA<{J^wmU(`8fQEv3&`PXmQDl7C`3t1GpD;6&rlloNsQauhmx&
z@5pZR>mGhBB5^erLL&~>APT7>Orfj{f%inPT@;;uEIkfB*1_UXWfcS^lefXD?$ib-
z<O~*u6^(2hFT0F3PU+*+3jt|@f}cp-UIYP$?GOr=Xu#^!pxaKSq=dxR(sdtt^S}>c
zHVDTKUn4WCbU~;wan7MK{?P9iSI=1VBi#8Wx#%K<HiQEpfG>b9u?sxWj-sk~GDL(t
zR=7h!fQzD`2^VFH^Sgd_-*XX335~*3^v@MUhuHJC-5+VmP*e7BuScPnP6)6x;L$PY
zW1+7J?f%EQ$BI7g^(kR}^i8lb1$|vaWQ$AH-A@&>=`-(YB~HXw&kApJI%c3g?$s$@
z65UESF0$rfQ*fh?KvO@fj-CZ>R^{A)Zna@E;TusL`8-6Hph7Q&OgV9>2J$GOc<D1h
z+E54Mt2+9)ZF!9|g8BF-C<p|%-q}7VdnPJ>O~hQb<&L3D$DJ-dwHoW)z1%TY1xtnp
zt=-`0jXz1O)6`5j55(puglk`3pF0~0z}<Y{kyPuj^ctfh&l>fHcEY2Ko_1mbz+86t
zZ9pKqC20bbF<b!hp#t|3e)>9xWTB(=D>@&yt}lx@BnuAdgQvMS!Y;df3Bo@OXIj>p
z<_c%yyiz=wmLyMB?hA*fr>`iAe@vJ+ofv?puGU%l_yK#P>=sg>%5>tPp)411ZC0b&
zr`HSTdE(R^XySW<$f%X@xDNCN31Q7K0~Qz4)M1~W&a!G()k>d20dCaTwnNC^knJLn
zYJrON+LhSTrw0x5=laTQeZe22oH#)-PA<f0()KOMhB-634=z5*PUr7zv1oEM7C4{g
zRj6u|uh?UP+fvR}a-c2e$S`xGTC`btwe#B3?WQgr(5$l%Go$7maU5_wMj(8?JTyGB
zUx`;Ua5W|DChhx6MpV^fpA+o#dkRL_9?90Vo0oD<-LqrKy@n^YE?;`AvuWa>nnMy{
z%hsNW>XUmKpZv(wls@}?z?NTwV(+FZLCnKbDfHBx7wPL%qIjP|NKoJJ<7A2n6^?;e
z;oCMNZW#p45JXKNx$h>>aOx&BNAc7QM^(zEG!!fqazYR^)Q@j5uwQ2%5KG|tfVY`e
z35y>l_7mAv|HxD;U+iTjXHxfUaPrxd0|JOE=<oSE_E&hZ(>s<szuR6=fWE^WeTO=Q
zW%K9OBUtj33p4$QwMjxABh7%*B|$s{C;X@!?L#L#H-G?=ffVLpdZq~tW*gTKP^Yj$
z?DIW2IGNbXhYm!__<;%4xi5yE5TXcFqI`oHQ&UW%-x3ml*h&<8H9Zuz06jr;+7~fW
z=zD$?7g3^UL&)Yv1uQc*J`twC%hFx^jTc-pt4$Y2A|(aX0u<8u8AQRtDyZF{F)b|=
z6#cVdQMlr%w|oprTd?HBlZfcVuIF9D%=TuqaItp^WK)u<(j{~@Ig1ip%`}&2NTf!p
z7b>bvTIO!$#9zpWNf&Y_2^&c>=rSP$7ox%68j8KDOfq~5pvwT9-7r6_hDafVRp)U=
zG_B<+=`}kgzJ`PxvPQvy$*YnL6u|(d=i<^ykIOoInjzSvMq$xwmWrQiYys6vN(qWu
zIfB|Ekj~I#H7<ecpbAkQJ<=7<=GEv|ivcMEhQKKZ`LO6v*sDDSK?@V4EhxN$)&Hf+
zl>3>3d6i+TemlxcFnB7swJ=Jy_>g)3$~PDECAYiaZZJS%@zu+x>9mEMIE4bj72;hg
z2v=H}`j({6WSMNnE&{~!7SmYj>a9$750a>Jei4PTi;%j^y^30JmQL6f7M2Ml2%K@f
zMRrG7S{izTN7FgKH4Ethn(C->&fYA3D|c;7AO9@t*vZcp20iaQaGzWPzi8f$pnome
z`?hjEte^7=rcj4=02E#Vv&L{?^pVq^SEaqwnD$F?Q;qr}&+b2q!9_I40R#gE9Qj_%
z+QErHiONKAKrvJdZGYaq&;FRC$yUOrllK9&qF!^^9jYC)2qX>x>fc;pVg3vB^|#8D
zDbIy9cunQruH}?3opJTlcL%vE(Qe5XGMW9u#R100%4pZN?5pS|`J+XAbZWtIl7vUT
znqDVncZWo?&q8GvzX)H$ACpk&H%UrBjepUQ+5<@n(xf2x%TXyu=6kzg60Df02*|P{
zyVtSi5em8TYRyR8)!m*gm(m~h>@E94(2_;CzROn#vEz<S_JGy@&qFz<p+9?{8~|g`
z4jyLnh`qE#?kOK%1fNjvl@?#w83I=??%DS&YdN4)UjU_|_y9;#i}0P@2)wxf_)G`F
ztjYn@k-7LK_CFiY|DRqOxGYVTo$Ds^2~9NLa9S#K_@Qobp=QLAEpu-&fvhxwjr}*+
z1S?wUhH7s>ZV;yS7c>er_zPskbcRd(wdMLsrJNfcff#oV>GTW&RHt5tm{w%vAz@pQ
zMyv16Gb=pvaR~CVMA()Kx)OB=amr0aK#>N5nLH58bPmBxD=`2H50#!hzE_}jC)N}p
zQZ?I3I6Dku9%VV!X6xbHLYp3>_LW+!b;<9zC3{dpI(5SRRnXO<005#~Szmmu_W|V^
zNwD}TQyp*Gp*+YGad9=ti-{_Xq3_O{tglVDu<kNBBqXpT3jU)`@E>JnqJO_J8ak)o
zUyaoXzo}fMYIcZv{dFR00{09IBq|z6%y|U$_vBg9siA)!^|RS?<8%n^hZ6P?Ix%bz
zIH>~PQX13-A$P!m_^E~pM?luRW8b$x6qeCTqdtF~H9`?N4iqu!aqOI=f!q-L{}ju%
zNG+|wcn{VP)%jSSUe<We1*0n2A%5g&u_L|a(@mKEUGCduR)=M>L^LdacUz!4zFT_x
z4*$2Fe=aEK{m9&#5tAO(3XBfNR(QtyfFj_Y1}r5Y5ar|ETjFTyw5D!`eVo%Pi~}_b
zg>puUop{(9UvT%}5uHnQe35Jzz-v=*Rh#-41wka=q}M>m7*tk}y;d{Ws%%KZVZwnx
znI4tX)knj-Wml)|Zkr=s3Ix+wZ}=BgX<ub~yLY*s24bscK0N7pwJPDPc{_l|I;*rk
zxs>q&qK$S~qid-F@X}D;0ZYRwZCDz<$a|MmuIQFxEPcr#zKnU;8y1h3P_%QjMa@HP
z7(f<+04Rg69X^)QS8?1y^xXHJiP=KAPwx(wt2zMFjU}tLZ4Z#s#DTr!Ex47?sts(X
zt!YYTEMU8ds3~{59;Sxb`@{gVt~hhiQZwoz$NU-Hz|Dk}%-4A8%bW8OPAkg6Vg@5Z
zjZvUd5oO9AQKm4i)1%vk5cZ-O7qj%qGc!EuEtqm*e0&G^M7kz7o1GM8%M^D+gnK<g
zvt)QXF8PhMHAZh5V_+60(f*x%8D9g-m@$GB8r&$7vjpNkj&%CU?>Wxy?#=rMkj3KK
z1eny!E~Z*3_isM7Al`2dr1q&Cj<)F34{N%oF&cz~p@(8}qs7WJ;NPQhnS<C%CJ>-h
zhk?JY2N9ou#{=BPZeT6}8|jy#Kj}JR6an=K#^d<nDzNA1W=`*N*syc}?q$sC6Xe03
zwF?AZ=eQUI&D^oS5vY~utK=b22~<Jof2`<a>%g)I`zAF+6=G(fuJ=Ir7Ts<V4e~~7
zgK81m4>6$RMvo6hye*KdQ0%|)M!bgl%aNb={xxOyNY)w%v1yR@T9pm2z7o_t5oc+v
zao41MsEF+1?rzf!bl2p4=&J5U1(3hg)!##bKq9=lj*g0YVV)36+?$o<NP4M8WiWEb
z3J>hq4ER4Jr=`u3Nc}?Q6$W)wJNNo(Q}{PMw36Q2w%LW>%t$Yw=frk1;68wJEyx5_
zW8dFz%RH{EyJPD#O-tPei*NMxv3;C|hGbJJZJIQ_VS)Ke=oGF+-x$y8C|X%#Y}Mam
zv~bp1yK~X<6V6()9N}^pl?=$b*u{nm3CbcKU2CX?YzldyMfns&?p(}1+~*rFX|H9@
z+~?mG=D8nY2&(FEEk~)0M;qZv{W^G=V>HFT>>P`|8kCG5!5G0f83iP<@ef^8X@A{L
zNW<){5N)_#>svETqS{DU#8T;>OWV%xIkpOWEMN}<AOo&OYM?Gx<|=sH09rKeN%3>%
zp&?r{Pz||)Y6w=SBWuk!_O$lLtme}ezS)gAW3{j{-HiY<9Tl+vtaaD!_h2o7lpM49
z&x<Preg;#rXVKnsiXsH>T%govXd2?axh`QHE*DQCK-e+&$O{K1y=K-Pyi!1w55-m*
zf{L!zU3rI7MEBqo1EAhB#jY!lOj5m+Hp}(TA{j^lKEd)_**bs(=TJ*kp9<TXJq844
z=#fKmUgn`qTh`Yix<lk_!AONy$>A53`+R8{7rQeW`6f)H)7o~nnR@L11XKFPwTc0%
zKJ|b<?jkYU^J1k^=dlnKAAJTq@-zL0LeQR8BEl=<5MIgKe}2_FqxbwD6})P(mZy3z
zan>8Md+VUlEa=Z2a7tb$a^KAt0-+yJP2$(7_})Zh2?A04$$OHEKU7@VE9N-SO6JL(
z6>7SroO4CFj14KVyGU|0cxNrMr5%=9rWl~)<GwcBW51bjCurTW<x|8@vEC$#%b`z^
zOJ9rX6k4*DlraSHVxQ^2)PmN_-+{hO!d11ExV>$u_2@1$9by@SWj)qs+HM!uFL5bG
z+pJu_Sg^cO-pro>Y@RA}*V^7gk^;>69jmWLJ=$jq2oZ#bqzr&tQOuB|S!_kYq(2Lw
zi^Q$uXsK%lyRznK2Uq5OtRiY5tpN717VfE~O(2((98u#ye^{s7Ue{K-suc8pm3bZD
z6g#!232`?N(0&lhO5b$cl#?LT8y!hfiZn=E_@vOGFH>_503*zY4j?H6m4;MmW10R|
zk_xIMe#%OR^@XFCJGP8?nh4};dNL}EIXVEaz>TS0sEk?y*L{59%>iTw>ur>P<b`Pb
zBas!7T5tMZw-7Z0z6dxct&fMKdo~MAbCI-NSoFU2stn>Hzab!!6k;(E_osNa(k)Lx
z=w?nBaGV4Yp$Yrwf{0G2Q>-ckqQoN~JFC3_4+1{E)H2jTDxycpl}x?M+oHh{pkQdF
ztDCVjw~_`s$=ZM^PXzgk`Ih|2?7rrjN4L8rFX|m0Xgek3rjMNi`gZG~KOP=3H=+o?
z5&w%w?|6!ab7iCLJ;shC=hX1XBrD;!{HA<B&z_V;y8bx0;f?EeZtvgxY?^(4$3(^B
z-zQpg(u^H=yr1|n9?{GiqSzl4phd^yRDZIDiycbaA5+biN1?IFn5sh52?M;;#sr7o
ztt+*(F%PDa#ST>HvQ!^U&w_NmPZir41n<7?Iv=&2LwI5{(kDjnAtv>bGH}{b7OV8T
z2svT8zx(xN0#$ZABOl2RO6w7`7QGci?>}Z{zD`7xdzkvEcDr(%19{Z_U?2*YrT~>^
zCmz@_ye?83>Ac-oKklG)ZpP-kXx^HNG52v%7bMH=N^?*ci=XbcEaV$T#Ml=)Va-GW
zxA^j769@jg-biJ*v!KXXb(D6Gaq-(Yu2tTJUOv0e?cJyW&BlunX9T#s>ph#9di}yB
zTofVGIlbmB0!pQz`trX^7U3Isw0(oQIy!HV+40DvFeqvEr||iP=Tig|d=ye5Yx0Nn
zoH>fj{?(lMOOMTfHzG_-E*n-+I<4i7I7S)oVx26AN@Z`GA7(22eJ;%HFa;#02UrHD
z?%|G3ef;T;$N<vPU>7J1MirA4lGM{rXV=3M0+djzLXX^KbM>3#%CKA`$a%+NnpOMU
zms7SVcuXAf`c|9woEku30RvhB-KQf(!#OJVqb$rK08{yE@#|Yx?$7bh=>;PE*d!5q
z#qy3RD`ddjaKQw=gA)`MrvB5HS##S}bB2_y;yT4}BWn9LPQN~T1_jM~#!o?4!gEHw
zkT^PlRp}@HyCCSl2ud%(zhiXH(5MbcTc;8+N{H9i55CefX17K-_rFScelh^ydYIiD
z{hI_SxTo*s|3C$!!@NiR4+0dLCjX)i_`1*e9r%c2lt$uOdwey7_hz{4-9?@tD#Upo
zzShC#v?7ws0;x&Kqy9^|BZ8Vzv{rTkP3j#1!;Y@4`^T^g1QOU7`8g2&Lz4sZ>e2Qy
zw~Jg`H*@=zdE64L>$7Ft=E{W7MGF8Ng%os8S?g4Xt4t?GQk+|kM0uY1Fc?50QJqx(
zr(#hDQB2}$jxbBY<W-heE!rp_+RGg@T!+G>XhsUFFJ2-45&|l)D*jm@{ORe=(l5%u
zQ~?UcY|6Kk8aiY6p5>!&Cl+6uAjdy1iW?q|iGh%)*t@gz5cBnVA&?!1g4&1PYwXzM
z3wMA9wsYiJfN6|Ow-PcPiq3ZM>BwwN8@CfU;qYK6L(-g){!ZLs4;rAZ;-HrwRm`*D
z$$ifgKV^ZkhvWO@kuK){E^^yNeDWUS#BxZkzC1$8|6*jq<XILwYPJ@kCFd(QwQb>n
zM(D?O)uE;4NReSo>o<OY2k3EinkrWGX{+$SyIT1aH=v<cX`g!xFm6NQX2NKjVRZZf
zAN@-XRHt{J*dG>pHbFQFj;GVVMfa=Dk}!Z}t%N}b84@aALSCqRmB-|TLi;z@=$J=U
z^3M>RL6v(<{d8UN6I|;5x=H?*B_bx$QyFGDx{%)HIPtsJo6&Y`VbOx7ra8(dz?WDo
zI-btG5(Nn1H3-=FgBI}AmqY!VyMiM8mQ0$FSXO%iFYQ4(HK0XpUvE3rU!np2kt>MX
zLyj@u8dOswm$|DsV6|&$i+!z(1<o*>j?FmclCqdK3mkFWkPVJK&OXC&8j(rGXLm%-
zt<V{<#!&$QHHoX%t0azXA-5dfhM&ata2}#T_j8y&{~|DGf)tD(G4CCzb_HjlQJ@%9
z0zWZifX7GRWlSfaQ!KS{yifpX2iltRepeBExiuUWkK4To1eWlhv=%oB1;e1HnHu5F
zYY1ym)y)dZZeU^X+$!4UFiQZ;n6emzzlT&}9t%2AA+k{{{8Nzdt45(|Os#;nYWHcY
z&AomJzG6h3(2Rlq(&EH66B?LAodT06ICo`=_JG+7QR4D$%;5-3qUxAn0rj2?K3G%3
zZ+=nxc$9?E!F=op6l%Y3jgzc|e90}z$bH1`^Q=%0R^lcJcbTwSS%jlxfaMiHDssG{
z>`y>la)|GbD>bIF2;CG%HFE}h2$N6jZ>F1EzFTXz3U|~V|MYN<D=SpW#@B%scLnJ-
zWBhT()Yr#@hnbyI;HenttZS>bPl-J!lYCp*1Y%@!-a}w*av9?~886mDkI}?W)(NhD
ztP)lcLl!AxC_3<0#>s^ECiks}6>pecfUYI~Hl-G#FpVIfwX!H>+AfmSc?ZsJVXTjl
z)|`@gpPnZQUAwZba`TIzpxTL1x>{QBO%YOGhtLEX5*Yw9zeYLp!Z52bVw&})h!z!9
z|45ZQ$IYbB^O+iRPtSJ%Kd~7fEl8o?9;X6$Wr73c1H>F$SrBtbK{1Cs6o&Y<%1p;#
z+)h`#7%9ab!aMFPFqm>xrFR^A8he<|p*zk+^`Bll=pd4lxxnQ47geXOgHySAU}pXV
z!jZ|}K3^|Nj}oIK<Mpx`jwvP6hyf5R!P)269Hf(3jw2fc(z{%r&e(IRUtP&8AYtX0
z;KWtjfTxvF=44wgP6HPS6*HYv^$tmRU~oBilYtQC2;?m#)TTNGEGP&8V^v@_h6ISf
zX?*l0Q3Nt{6-6wY<7pmU8UNkt_cbrGEe}KhD6C3%eW%a$QF|~~oTq|#;P3|(3tLj4
zQ0=c2Elf25YiTd{ZG-7$6*1M*V9kN=rNjl}156<u9x{iBT;~uzMUjSrSdnG?l4~@%
zgv-OuL;Gas(loVxM272rraRfvs^W}cNvzXJ&H)tj6reg%+hNY@Q~xy?@FW?Syk5DU
z?zvJQAy6q6>uP~0v#u7V%Da#T?=#ZcwPISkI7FhCLc%&7#KiZh$NKx2Bt((A+Mf*e
z{6JI@nY_lee{0i#*fu`n>4ItsRh9`~j{6|%lxIJ7aX#ov&i_tb<V$E@<)q55LInOE
z9@d<&#)P%PVJSdzVAIKjR(^W%YHJlBed?(Pv5p)k*|`N)9Z}DAsbNe^+YejZc#8D0
zCE4tb0{mrXs}Oy<ONf5hw7W+-mH1U`oR`uzK7zv+1-z?}{)*BDVCS_h*dc*wHs8jt
zxOLW(I~Ofu&JP-U2D*^lU0IIfi-ZAD2%Lbj<%s=`u|41@u&EZfz}I15i%B&Yg=Y*5
z8fcd%FBu^hZzl^9N48W}A?EH&b-g5#H_b8$anyJP(*qHbhlXVK*_B>~DLus1O=8bR
zfs59#kx+uZU(Ersu3ndW4MQjZqDc2yW%`GTNz%yf%SABHPAbo3xBEApWsM90Ew`;X
zMSgt_cjGBf2oi?smJi%VYuPH|yw95bG|@%sw;#B7F}ilquCH=P>po0dyE4}<`gp;2
zl2HQqVmPlM%hcss*0>Ka1m?Sa&IwTt)Mj;eK*T@hfS>cpgbpx8lMz_(w9-FOD6oA1
z(Ar$zFeyrcJ%tvV(78d7XuF-+o9M0nux5#^3M#e}qLp%uxyH(tg;5n8r-SbGHHQ-^
zC!|GPNqSKCQk;@RDU_b?YO+jk*h#B2<pwg7G6XxP$TOKZ5Y&sRNNm>wrzmjZvhTEd
zQ*$!;2MIZhAJpZm@=&^=-mha#w0J+or+LZ5_j87H9z1jbAF79klPO~zS?LvX9)~DN
zjC4fb1V&Z&H^sE(CJXCnI29)0#nmKI^>`oE)z?<p84#jdbLk=0>F!1Tfp_hQZATUs
zSUcrH-6p8xNIs<mLhrSXB*R|)r+Mt7h|~<+74a3*e1_w_Ct2?m)|@qeF5&X#wZ{x`
z3)~K$6g`QrdU*Jucxzx)px{=$)p|skK+{XK<YZaE2j2#MbKoo#4m!@|?Tjv#zC^QZ
zJo3Vk*)Q8Q>m>e(?lz~4)0b2{ui^A-LSr9_w*)?7zSYn2&v)36&u92lWr177Nh7t#
zPgf*st_m$5KDs0JVaoPlxj{RlHOhRjOgulCqzNhJ-QUxr%yhCW?=RB7@QK~XzdF&Y
zHg@*B<>Hz(>C`o{e*X8QF45c%TCCP9u+}rWZZUh_0xCt<c7tkUG;LeRrYN*2;h*@z
zv9Q7M(MA#e*oX6|JK-bejpNacyAn4?d6AU)Gly5rC9F<tT)SM)sLyeT7^|it#t+4X
zz>rOA^u8y9V}sB{T_NIH_45}Yxss~+N3rQ_zqUms0~M+cX3J-bJE#wqr4JmpZks_-
zNd+F2U0!n<HS?(m|J`JJ=kFm<##+2@p9RWr6~Ld>Di|wVrGcDvW6};Q%>vEDm=&%x
zUEDEuRUtT>siV%@TDrq(W$5j!6|N<)!cs|fm^~0+_a^tXg<zGrz>->xmn%YB2Xz*l
z@f4y>23Idz{~)b_id2<2K^0I(yWk2ksy9?iMmy7nQ$IB%YN{V`PuS%$yC6fXUc|c4
zW-$&_*roy6mlcn=+oKQmMGRe6{O2rP*MjN|OX?FB@fuVpmL5#DPnv$c!$Ny;?%EK=
zuG+J^J-Ht7MD026J?r2g&sIzS+@g8$`=twJwqf3pV5+H_+`k1Zy(0KxPfxg`yQSXl
zS=pYocG<HFtY0ypAmFSEljP9HArVSauu7Ct?n-8sK!L|A#&-sgMchL3;wcHicmQga
zqbi_EnHHvQciHQ%@geIwWB(iAu4HJseX+h7<5){wpl)196`~yN%#DYFY=eW3R8lQz
zums<m-3at_MBtZf%O8Hm=~W{Le_z<6<li37>0e(xM_jHUdl4?YmaM04jM(@#z<Yeb
zNPfrw8ZS`tml3A&sKeN&B58>c_Pz|@KqHL)c)*KB$i>$0vPO9P7{4FhcVxtF8fo>$
zHPEgk4U&iAAbBV=87MyQ8lnzZ$y6&Q&h%Fc|0c|%IH|OQWDui0B^%(zy+&Jh()yAr
z)<!+c>Vhf8;kaNnIBj8XSpzUV7}pRx7G&?EJ5_-<RkFZlC_Ub-8^n*;Te$s_5og;1
z;EJ_OrbEbQor7q#NMG}dci&#VU4M%$f)@!KFry(|c$+VT31{JzecUgUjpDEk)1{B_
zK-F=$tpAyslOR9Ob*zf(^yrSc(s2~t!{R$wWe{R?030a#6k&7Gl@3?_Y-0PI64@v8
zZMZ0nwa4IvYk+~aq6nmoPb6@=@=)g2NeZw|3srGA+g(AM(L(g~iV(3Znf|`rfo&Bc
zUl6m-rI@klqE!4Al0>HC!MMWjWF;^6yJ}#kbRwx~VXjPWrCUf-o*|hMqmOe#9Id1P
z3I!G#ItCmmiQNUF!h+@Xk>%?S`k*7fxY{&XWT&ZvsZ+UoF|Kz`n743k))NQRwNGcd
znev4*pYto@M&e`s3dOGLX#E$CEx>!tDdU?yf&BG?FDy<$+(db_jkdS!9+LgRqW*;g
zLW6X+=SK00Wu~kpU3mxsN;9srxP+})eb6#@53<te%In@v+j|q4aD}=-4?B7CL%<H<
z0N@`feM7Dkyk5WFVPbhtfXQ!FOVeaW4XQ;+#)>Dbx<#B<$^rN<;dvqv{T%S9>c|5U
z%|Rda0sq}8Dnt$W0oQJZqkPKV?yCihn`w)2+_LJZ<i{E(S#J#_!(2F?y9uJ|g+(~A
zY&sC91b8-As0&Kr7i5Z+2mYpX^*Ge34pi-=RQMu^hTa$M`+eW4VsQ_Uf;?KHaOBjW
zl*0$>yOrRVV(u|)OfBH8%x^S3U~^@_w}-^VA%ijaZR7E<@%UNJuij&`5V+TO(=p=$
zKq?YE*9fSJMNCK(aBcWh0z0wzD~F_dy7UV*geN{-ZZEj34l*0_-4&jxqj1FBx8#9Q
zm;v<zxYMpCzCkVn63%BCLN6g~h?!bIsF&wx5w)P09r&u{7+W7&uZv0mFI#a9b@Xi#
zD7*_X;?=|epNH%l!sy_nVRHT-U2HRiLm$cR#g|%5;`0Niokiu<LpcquVbkj)S+%`I
z8){KlAn!jsbI|I)feawmUm?1`dhuZ9IwRnfnGRT8KsdnN-B+!bw~mdW>or95%{}MM
z7rR`tN6~ff4>K;cEc0F>8S_9H{~y_&5w0+h46m(=!El|aI{+fC1**XLc0$-9VX#Jl
z|KU%QxSyUVf8bllC}mvb$707O;Oz8d5y8>s#biI+VgC*%?UagPGJaB|c!Fk2>#g&-
zdy>(x`Krh5$41O=MiJgUzM&|3JQ|tAJR^R0lkjd|%jv^#p+gwD1dWlO&A%D(EazZZ
z1%xI-Rsp=DpW3(P73zs>|4H(a&z^?=Fc3yAOv=cBDIS?d86XF!dRt@_b-5d4H<<i0
z6c(beYkE`BVFtq!6hm?LsDbh)<Shlu{KNmB;S`_%5YyZ}!x>#5kxjKjon)W7k0ABL
z!8&QFA^(H!ic1gX%--Kq%wJWcK-8;XC(QE&J#BL_Bg(e~2_x$uLeGm5z|v=H8d~~j
zBbyQLS5wN?@ix&ah!;O7msicKKzCI<T%%Y0{v56>x<j$p0v1*Ht-o*gnT^O1IReSv
zGqe*V1`VwzDIDilsu*~+)zs%0f>Nurk;zIIID<KMxvJ4%Cb%82G2^rvuu1!koB{L=
z7~-YC;$J-yoDBhu@W>XJVU!Q-c&R)Fa{Y9T;$dRL?)AXfl9>QuDIwW2{hMQMmpz!c
zP{ga3+6Evr27LYRw+*k)G0+)ovk>VH;#I$eea3gW2(yYhxLQH*fR>`q#T~=(q)Hp0
z?pNCFxbn8&RJa6izh5DE6x%MG)UVp~w;d=x2ONUYqHucuRJC!R)w#}p!u-giEHi(r
zPbe6NnV9V$%ysQnm|{NraCS%P9Azx5(VZIywu>zDe3zk5X<l}whL~5BX-MFEcy9e3
zx|q33D*n&fpJ4U&^AFiy^^r>x+*GSVyU{1MJn&vPnZG`>(fe!U`Ouj_4a0;n$h^jc
zCe;Bzr^Jizk+LoqBgB*XPiP|Km*<5uB65e(rxE=8(;CiO1N45ihT$o^_(v6GC2weI
z1aq8`wGMXJ5HL(eOm~=OV={TH2OIFd8rgHIcRm+;^?+sEz&7G$xTnBaBPO!NNs+GG
zuk%hRpry5C$_fDm*}-t;V}H&N@1gT=FQ}i_W87N{t1NH6!~SRx12>Z~a;Pf-?{nlP
zK$$Tx6<#d=avZanvN9J5^uRN_l0KyP7z~gm-mT=f6zIxmVz)iQ9^rp0e%b^+f>D6k
zC<5FkCb6ug<ClSh4XMA49xQN#jZi5Rmqz#6SFRZi%xV@+P=LVCi{w@{fL|A6B?PsI
zC>|)jGk9~LS@?v75f(-@KzD}>_fs7_^sr5IyfDuP?l+D_fl8mnFT5<c^(7zr6$R49
zS6^-0XgP9V@B<-=cV{iri}mq1Ki}-h5m{>2`Zk}PXlwg;!gS36IlTuG@Z$XKOMa5V
zVt_k~J$7yw(;8@TBV3R80aYGn%z8KJ_mlbcIRrmvlpoT&IZZwY!|;&8ow`L3^c6Sc
zDQc2iBE_E$WDYPnGbyF+Sj-aszr_y1T{jYn9a8rZ?z2l&b?lDqmqhNS;|5Aw_gHuk
zEFSk~e45YwAp>*4vy2%Jv%d76z0dAn{{;DpbuEiqK}s!kfVVHU`{z9c^G7335+vnf
z03rRrZ2RDpdjqi&=2taL_>BfWGao%Rj8oGqpwDs+bS0`})Z|j^hp04nQY@-8z5)#9
zu!FLewN|p?6!}+Ki1%zKk-CdORagH^R$b;kyqNZQqwV;bR;FViqiU>+-N~;-C_ZrH
zmpbr(PFsKzpW^(E$BLXyIbVMu<jGK6!=!mnY$U%=jXE;z$4kTwgt-pT@gXt_^GOdh
zpM(bl7T|)}DtNYrBfr;FLm<qJs|8N}YU0%o$zY!fikfw8NGOB&Nm>Ct!;%k`O=uAk
z2JF7%bY)M1fJc2|o8%OY;A&(D6{9IV88%CWAjpCl_*>Pc3SNEPZRY72aYt<WcM)c$
zz{{8FHYv?kZG-w%QBNo<Sw(S{8tTs#W}528D}GYALO(_b>k(_~cL_5CGgz0<>WX#I
z^kk~t-wU_JE3z4lV|!sfBtfxvg2D+M%hFz%-7#<GL}EA#eAlo{SPt}d@8MIP5lW7t
zW|NDUbJZS#;NX;_I`G~>R8h1OFF_nOragbN6$K1jQ8)tR4A3D8QW0yXue=H$%N<5!
z0=38n2&n_|oOo7C%4=(R0g+)c0hu!WWZ!pat*!mEoCF45E(n;mcp|R*(f1|3*haeL
z`V_@egNr-^w~XWC_mdxu#94g8;+!!0en;vatO4qB#D?kz+gBfb32HbCo(*>5F#grB
znp!oz<G;F7u}o>m*9x&jPniqdaS_>IH@EgK(n+`2`cZm%bmJhm#RJKuC^5s&PTMkS
zQn7wIz)Q2QBI(yYkyY02{hS-bTIE&a&IHR50Y{<$3luUNYUR*{9AA9NqlVd*@F)rz
z%Qh}e9+WyGCBUwoGGonN;C~v0Rm9`TcC}a83lxaklA;pnCDoORdekVl>c`HU{j%(q
zWZH*;a?%s;;G%_KA*LD!o?^Vs3z_VX3nmU1N`$7Jn4?%>DLFN}w4QC#T|y4rs+&xQ
zcP7zQpAD+rm@ZFOeYf*Y*r$%cBuI7+3LGK6<$~2~lLn<8==dod(#*Pj@saS-u&EG|
z$gBZr3061-LJAVK%ZFiLdM*LeF-<z-%UHoCOM))uKJ)%l+(#H(Ml_=MMl&bV%zMt=
zF}RhlD*Lxzz8_xH<#%^2lX<rF@|UrKP4@Wg8A3SoUDJqmYCjR#+=HTBWOD6^W80#U
zA+YYW#dQ&LZy!}!)ZWYL-G;faZ#npw00wD$eR{NCiJI!LvU<2@)V4K-*nBU;Mcr<9
z<&Q@DR}=HV5L`pO4zuvdaJ);Qd_fjIxoU2g=t{l6ZQk5Xm<r4bR=$uRF%PvU!bd^e
zaAyH5zTEgPz!MPZ{{0jdK9#!tGQ21SZ#nUL#8zehnhN$K&;XC8I%4j4HbWp#M0^#A
zhPi6Jox*=<(F7vI?Z{*fR)?3janrR-cH^S!asa>f$tl7C9}Z)(VRX3819=~T4+rX7
z9d%EPKSu|WTxV2D2_8lipM|bqjz*YHY{~FyVLySjk(u(WB{$y=_iJhcvE6YiDI0}G
z5O5=bl<fge4RL2Wj=cdEm<tM}Tz7r9!mx@MZ4Z1XtR>r;hSx5%8Uhv>xI+{(K-AuM
ze4v_K&;YC{)GAdrARkPhUxGlda|I!csrP^how*_jT}Vz1NcZ-pys?<Zhw?Q$uX<E*
z71yz5iMag>JGL+-&K^8>yxfbB8#IO$A+QOQc0e?<28%3g3)A9}2|UzEMRwE;D|LW)
zm*;fFsjC{<!hTgMu(rlJ>tvEK+24RyJ!yxHAtVS9TC#j1bw!t%^rVQyrip|0jp{cX
zDx8n)fl!MG!k)B&;70;-WSn3Up_LeIEB%>nnF|;ca*7}Zv}mpTOh+~>ajaWjS6Ye4
zYC=llCC+WMw$T-sQ((?g#u!K<^nHL^I1i|UsqqA`xOV_T)eYsVig<N1on>VV%^Kn!
zd3YXfn2c;$&Yqqw`QyS7L4o=R<=$P3&!nk6kQV3h^$=<AYD>jBAnoNj{!+*yjv%%>
zd8bwWx={WA%8r0d)#CA>b0ED$+(A1$A`o)H<!hv!avxxRSmn<Gu67mi<7;F!)H2x*
zCd__11q#&)T_{~N*KtxGb?<TSVK98WaZ&2rE{LdNUXkbr0oDdgV}!Kj!3r12cEBx5
zhp3I2)4+|B76K3$&uD8-7ZE9TP^+Z4G5f9b8bGH)5G$Grw0Z|4mco^eY9ct^AYY!Y
zys+NAD5?r`REVmY$2ooRm6ljIyY|-9V@*z*9u2EzI$P}kf3UQ&C@=&|uK`|cJo1s&
zXE}axtwVOvc0f`}ONP<p)0r=KaFu>g3auk=)2qtms%B<tnMlR637%ijI++SPz&1J7
z$36sgf!Sh@9F6sB1YOw61nhX`fO0t@=OIWP?I&kHd@6ciTjD=5J$DrLm3_DXWH+$n
zF-b3L=I^1yPq&gT8y@~v4V?ANZE{Xc-A0grWi1zno;u(gM4^B?k%oFwKLT?S&?fxq
zvkdSR`ei@De^Lz&QNiy9W@zw?yE5JywPug$9$QSY2>dPlG~p<&P2gn8U6qRoQT^K=
z4nOGorwy1XX5dW<PmABV9q?=+k$@2l)FZH=`_02D`1wC=&!1=g9V+_S9!SAFdi1_f
z0?6Ir>Ik63+P4lQ56MnvpW%<uZ?Wp}S=987Or!grs&S={V>K4qZFb3rN%LQqrZ3C%
ze<zA1KXkDASGVVGFyp)b8arW5W(`QGVN8#CGNsy|qX(kA7J><y3P&or0z1Fiac;^c
zk;8~m192W_8OTFPBN#^L3X*a^yb|hv|35t6cf9Nq|3kmLz!R0rlQZwI_ZhC^Ppb#>
z^XKFLoki$<GtLYS>v6<KZXs>RlQd#oB~;}Sn*T!ZRrqE7?jw_C>SVQ=7Y<dJVBX0Y
zKB}1*>^S(Ad_&~{Wd<^yK`T1J-$ur`;W9jCNjLgcqds--iXBZcvXe1_w|c=LZj}0j
z4L}X9GD1>8s3&l3$;FNzpN<HcAGsMhQ}bo*qv2CAzZ#uk23-e+iGQs03U_=5avoT!
zQLGo?mVdc9!*~CwdrM&xW<Hn(<bNtUFT=d3bPbC0f&)o(R(jbmIjC-m6z}p}4`&w9
zx6M`kgk2mtbX68Z)-TNcZtDI!=U0$^|Lx!<25z(Vpz|NO)qY+uSA;}h&GXQr*%d&#
z=i85$mES|Ff4I(|!$HnotosQ4uABx&36m>Ry64|%K|%U^x8eSp87XOU<H>!H%7NDQ
zMV>7<(K#f6pIn*}f}@D=yS*u}FfJ8`mGBNcTHLV;s9|MERoc-Akt+Go&ISl?5pD#a
z%0>%Iv>tRvBBQVM%r6hvWlqNy;dT^&ad4G3P?Rq@4BDMh-BD1_O#fKN0}e?d8}ZYG
z93UR9rlTk?AJn28cV0oSdr{ba)lX+E)@~s`yk0MTV;wv~O2v`FNM&0Z7)u|fitfZC
z)e!{~963RiQ`l%7EZabZbYsTL$92S5D%XC~NzFcVtq@9$LD2|>CL(<iRz=tuR7IgI
zq@@nHAi^ZD+3&b;C5Ni{{l%hhp8N7a2CdRD^#sD9enrSq2fU5{dgqS;aNrF5cb4hj
z=%>3w5j%Q;zb;rMEOrx+S`Rkrc>=}Xze~A%HV@g>UP1P(ZJJ5_grOrC!qZe4E3s?@
z;rYcC7+ijTnWg=-BF0c*c)9?vd-)I(s6#MtW}<W^W%8=N7q%iw;7>Q?!G$y(^tymq
ztc5O4`u%{i-o)D0SugHac3a&TFz`H&v}cqPzZNTdy!FRZC_fmd4-8>mP&pv7ezk8Q
zchCUcXs~4aNr)W3#T-UdKaB4;zWCuv8hJXyKPWWsxMX&B#fpTyL*VaYK07i!?q=`u
z?rctzFiT-WttQKl7&asI(>X#wPZCWf%92PN@-B2CCG8<dsH0glY-Tt{Q&@%H_cCje
zEwbrKCNx0_iT6x*2E*1l-;x-BixM?t%ZaP2BaM%-k$Y3A1tPuvY*uYT+wWfQa6|63
zg3uI_$k}N}GOi7?svXIGY<{O_Y2C9P4}E^vN={Y}{_o=PCa0VGF|qPgWSsSO>o!i?
z`Z>rt>n?NNvihpA;-(SpIrsXo-l}efEiE_h#J?4<X5xFn!e%KS9|Urp+CG_`@V+6k
zX+m7Y0rn?TAl1IH46`X1wXhhQYL3lTu|Vlpw$1p6>Yp=HthtJ;<wz*@FBGN|uJ7DJ
z;C|v0;hVhbO-H8V<ZBV96INY7%G`hb@)2<mM3qM}f$+Fg<8?($8`>DhidP@ZwuI~*
zNL4icz%-wgkoyRt04QdgIVX1+XgrG#UW~Mn5xKX*^x<Arx2bJ$5U%~^dKig^FpUvt
zdcL{x%cUdzcHnBAHYxnm3uG>G4?<>zddR`Brpl+&C`7i0sDW*UF>8{@oqlB5`bt(!
zeWgP(WZUaqz=)#K@*tK8G2hs7cdXawl$Rf8W3+zI!1CYG<2s5WGIXNxdmBkOp;q}X
znZu-vG*<iTh;vR7yYY1?+=2lk^|-0gaTNUkbuaf^yxTwYA{2f+qm!C&eLmZQ+3v~7
zP{}+5VadhtX>Ab8y_g}i!Q;#pk~EDN9miUdqLLYq;|N>sk2JYuV3n(_F1tVX!WPm?
zLY$yfYH5DWRasZX9L|$eZZe|W!0LJOPQeYjjp3I<-*<gaoZ>Db(lB7vOnn~aXt#2=
z`+l8eH4N})3?qb{x~EmDWCAhlyGM|tqn<h#UL8lPjMd|<=VH7p=jWjH#t~Mc11=Dm
z)*UBFr=~-E>?6#=u>*U57=@hzNfqzoB3D&4>hmBzyxaU7PBL;#51lw)fJnN?m@*Sd
ztIbz1A<ykCsT95aD?$4T#4PDltSG|+=L%$JH_s0At+z!V<cxsR)%ipol!bZVu?We3
zc*XX0Gg;y$U{=FB^k*kyTMg$@xaH1Z+6UH)yu!X4d6qRkXxvy2W|WXid-8nojrO*6
z;cMi}Vg+Z)zKA-$P;)rpI@JN6B0sn~AfstUP@U_HJUa)Y6xGyng4iPU)G%OX34n)I
zjw{UuV{(Zh<`$S!LFLvQLP?q^@3V*&_)_f{Sj-&^s$L9se@GvK1Scu$q@f*m7Daa1
zOAR<gec1OzF$sDv70RcgWFR8^pz2FLow;;4{$&LJR9S&p3scDVFKGChE#KcP48Sqz
zV=yFll&B?<bd-$?t(<I#HpKEH9SlaAsGP)C0zF6O#BFi_{28tjOj~?ee?8Q2Wh6%S
z(S58#-RmD5J{rtkiZfR41P;h{)_cat(WwKTfw4y^yQOPM8+RlB1l`Elkl^N3ooE7i
zKiqzTx{>z{dPFOiZ3#4_st{)yL*ljjU)$O3Z?g1o_#gKkZ19=WYNPUopuFGRVUy+O
z9HrIP1B~2NfmI2VUDBU(R(_M0uu@kFgshM^0<47!(4NF#rcU&1SJC;(G46F*daG@T
zRY!Oq&1<~o&d;5=I?#+8X6WR3nT-?Ct6(PQG{c!8!+TKpQ4_toD(1VHE17QaTR3si
zP}fRM;AfnE;0aCn=zEUTyYwf=Y0M7>S@WNgFRioPdF5qmZI(F2CR^_*`SUs#!Miy<
zJ885s-zZm{ys%yNhFo=(=%S>;6mgbyAt!nLVVh=Sz4qyduIsYEb;>E4YMhN8@a)%D
zr@0(+Oii}%BrI#<1YUx?2uCIN*<N2G3#qL64``KtjOa(nti^@u`4s0|Sv=*H8vzlZ
zJ_T^XWU64jdeCA%?L?XNU2^d4tmBRwLm;;&xI+;PKv+#k)y1j0?Q1cOW4fcAU#Uh8
zan_&#R^8*WI9~}Cy03Y?;0DrOD$Bcl0wPBGJq@%M2%C%ZTPkWY%<yZmbibEU1!m!z
z!Y}RM>-G<rF#VM7zLNYk!AHQFXr$;)On<IB<HXT|`Ka)>by}}5q}@xstHE-eaZT})
zqS1xyIaTQ|7p^l_eI}jUE3>>&`04yhN1}8%vE;W|_}mpj%&qN&W(zl4(mhn{v3<0D
z_SB_{MEukXikWcu=N&!DZ;m=4XTg|fY}%GafYH=@?kfvx-c!)h>>zj!>^*GpxtAMf
zSoQeOY;iMi_!4)G)5S&CEA1rVb0z&<1Pj`@3%NtGw?}sDt5-6VexD=xGOEr->vq-`
zk_Kcq)Ef8qQF*guoX6}G<KV%4>3fHTUq-pwoV%S>Px|0c0{1+mWf$3?9=2gP-ZKK{
zI5T6~Kh_{i&XIvcc{T>g7PZK*D%4$B8kkZS@Y}p&;oe#bw*$!yZX1|L_=Z9X2RR7?
zxNW|!XL)V5f}1G?ZaY+Q6&-%AW~^u=S6LHHz%TI}*=2*f2I%=2;B2)3Os&c`)GNL@
zx)H9*Y=LLwNzZ~ndLX-N$|QqZEfIO*TZYvt>OkNcH#<c#4@7+^d0->sm@aOUyTfcC
zioRkVmTl-HaCZr#EtF$0J{ZK{o7}+<jrZ~919q<gR)?(6jsl&@+5pBK4%!|GHcMmP
zU%$a0Sh?49;gNoY`hE}+)~h0q>B*~#xGyq4R$R)Bm`o6!bI9EC_$tprMH3v^y**~1
zRWSpnrtIaOLKW3kXE6n&mH``U<YOURmXSJ%HuAwZfH2&O83(*W1*Ie!Q%k_T0IYcg
zrIy9Ee=6;e*|Pkd$B-%Ud189aWbI(#@6qo)x#coupUbLx6*I2m+-7bnxF^|Gv1|Va
zL_|Uc@7W5k;v~A3NM0Gfx50eoOxf?6k&Yq9yVi45n9m=xKLs}?@4a*KE_K>@`nLnV
z0Zml1Gm06GTO_Wg?IKhztM_STrl4@oEbzc_v#cf0P!(UgTNk<CsEA8A=OaU$6qisx
zDXr`dmzjdZL%UsY>X3p#T<#?i$aRFNHX|RQsVF7m!!BEJiHooRtYf}bx$Pq}f(_(H
zpVni3qE*HZl2^ZH)`$`pnb{0w2s2wmiBX0>jOakmMh;Nhmehh%)4GIWMT#{@Af%c)
z)KE1QcO$tH)DBEXdIu{^cccpDsdnPvm#<1We>N(Xt|9FxUS1@%6cUwLkiM`^)%0Cp
zz)Is9Sj74BEff>8{|0NO_r1VBV(f}Its^ja(h-R)G8}ILGLGUX-OSwaTM)8Ar^>4f
zHPcbc^tB?aAcY3Z^g!Z$+zt4iP(1ibHDSBHfn}7#5FJ2xXH_sNGNBzoPE$v4yY2Wv
z!I9y(KW<2|ZH6P{9#Wt@3bj2NI(#?X{PRB(T@Nm{hy3ESwxxkc&jG$tp#*6ZjDX`$
zIa*`+!XeEVv9^5welB-&wKpdFfb;!^&MlMxhE_j=L&&KLg@KT<00kr>ycYK07==jQ
z6nRKK4uOplWS<3@1^MY(VH1_QD~ik?c~;*M?&zsJV4(Lyhr3reZ03Q|D~GAv)Uq{2
zd!zh_S}&>7&N7JULMuoP-^dd+f<@IPdDJU8@t<XEXNHq5(j~VNpj9jR7G-4>GeY8O
zr$6Vj47PP(U+rimcx5=4iK%UaEHD|4*AYa<D>^<vZl|()X;iLD$o(al3VgoNrlId*
z)1w@ZMJ)QrSoopu0lh<6Zy^f&jD)QAwLBZ7p?J}6Y9Ewj{g(*Qg&IE;wi<~_`Me~G
z!GFER4r>Gd^z@&xsXV85AC}iUyplV~2Z@Bmy_vI0%)wTM$l7xEt)z?p#lqo_;T!-U
zGO?-L7J?iY>#IFYl9T{_4sx%sS?O-7vuqR`?E4Gale!&{5iIxD4V3%q`L^R_7zBfk
z{ssSlmDeaXbP#;YiQ|0B=Ly0{-hLp(v?yX4|N9S*xc!05QJiE1(kej^6afs!MjT?m
zx=hRXaT~iAT+r%Ju9{Kk3k#S08wxi1^^#?=0MF#XLsA=wfsr3aW_k@=B$ypmxrl6J
z3QZ3ljt~2Mqva02sbWu`K6Nm;?9IKUaw*F(KMoK+0&4^4LT4GGDDe?kx?^g{Un_^a
zAr}GG=qQ&~c8ytI=@ytj!zZ~6Fp}#Qa%BM+D`mt$1a;8K=b?pG|Ii^;>^7nuy23NF
zS|PTF^g~BWB7#7lVCGchTiT<?O=5#Q5`<`Aun6=e5BCos#Ka&rZ~#MS08~L@v5~Y2
z*lGMM0H3OYIQiHK{@jCY1$wJ)zAzu*Q;`)HAq`RX4Eg0>z^-H?AD=m2%;1%S!@gGj
zTlVoy4Q_MJ2XFxHRzOR_ku}Je>q;^bWMbmUTo6<u=OIMz0q+llI{XVR1Df11M${N5
zf#+^x@FZ@>?REH)HA;Laq?~a+Y(V4AggY`>4|1!u!gUaZ0($+QnGR!~Ie*Zy5MmY_
zk|Q<3)H>0{<7^Z#5nZEw@buF>Nb56u@&TOSw=Xvnvxe`bi~6kzl6k@Reu4SsZh2}z
zT*j8?`*^?O^uQ?PD;bhwm8O)Hri`P3K^mXE;gC^zjDg|Jv`d1F1~nI$_dk%0Aw}+3
z>b~D_Csm}_1%osU#Q{NUDV2-7CLl3^(2`ZJcC{Xa8Q1xe+28&FmoanGpdMegTXnlC
zEdRtgDJOLleJyVqGCu&f>3XB1+`;8n-d?x!$=~WSbuJ>-dAJv$kxj<zZO~{;2018E
zWf2-OJCM^%7mR*&F3RkM?J>9q9RsV^rxwU{%R_6Hat!0su0XI-0h~%!)XTpJUmLU9
z58R3)w@6h#8s0}h^qaAvFfw9>z3s=3k-g4;44y(rTs)HRRc7?~h9|&|klXd=@ESh~
z^Vg&;fZzb~-iEaExyRC!hpPnmCM;Kq3|sLbZ2N^_J5y8DW+$sLiyerVR#Ae{qbzeF
zty#r$WvI1`-Ac%?lt*kstgGObrX_GWc0!7iF$1Z;ZWUf-H`v8N`jC-aXjtRIef`Jx
zE{b37^ln}oCQ!p2?oLrw_*AjtRq>Y3$a(TdbaDS{vK^K_ZCwBF$J~f=5g!bDKqQ-@
zf5{K@-@taiLw=0>Zy=ZN6Jf~Zy9ZfO-hj9wdRmQig*7_{F-)GN5OyruT?i54tvl|+
zbP%M&tBS%-LW-Ys+3uR+$hiV`3NI|0Rfm0qjWB6147_-h7BdF|H1)qy34z0b<=mY5
zg+4y0bEpi`+KnWm`wvjIfz|~H+;{{2lX@p)1AymEBnl63UWaddVR(3&aQZEU7yddA
zOdzT>2Gz37X#a!see6U}^p*@P79Kl#to~Q-Vtm<56fL5a@3q7D5(+Wd8maVL<a=@S
zThf&7JAPK?thF#10E#rir5pC`3UflrZZN<qb^w4Hcu#<RgO5b)|5MZ-=<@@7d>Cvk
zAgv=5AB@TtBR#!@H+lf?lk<^(`T}jug*Oxn!!ImE918<Dk84gJ#)+#!yzR~Muin%=
zZ~Jt|I&Bpv)u6OlYSb$ZkekJ>G-V+z*Sqrpvui$pzG(YrBbnnLbG?HRU}*#K66A;h
z@eLF?`L&x^s@<zRKr=tO0v@^pzjdtBcVs75$kJ)9fOL%%PcYz^FT17ozJUl?@$=eu
zHzk3aE1=eU!fOoyGU0}ud&uTK0t1Nle3T%!gtpix2f{*+F|L;YqDMj41Mqz0XaUhk
z;7DPWbuCL_69zkYC}U<9@Zti3_5G`$zy@=Q2Zj&A!D!f+5#?~+LT=y^eI}sZ2h2s5
zkaSfK4L=!B?k!e0yW+U{T>cv`@0=-DeSl0H&_naD#Slt{17<Pf3lpDkr<)_5l$b^3
zb*FdS2kh6+7ozJn6Akm94i&#`H6(2&p{{_BxpXA!nz@Lk`t>iqG7<{2Yt7}4bv<|T
z$yfZ<dSN?4*yRx$xBUl~gCz^1pv<7-zNVoi^W(q#0`$}V{nbjR|ER|p&7i{vgTefw
zwZo^loNWhmg}=}6SIbDl?$P+)L$&{L$6^*5Kghojkb${8F6>gMavA!=>N*>kUVG-j
z6&a1jeEmRP5CB06<ZiQ}K>o#`)V9eFCz|F}=b1VkTjf6FEi<n1cqa0=$jxt#9N0Z<
z^Jfmwv3olhz|?Wk<~rt=({yb}=`%?e=6#`gUjEaO<>Cojac51xY_Xd$!`$S)08Wt1
z@6_RO<kq1vmlKTk*s#`H6*A$<9n^Z2Jww|r;{p4vevEN(TTPGk++Rclzp)%UH<ZX0
zAyEy+NDkLP#*2=8{E@RMkLr7q2W>t~)&eUT(fJna;XTclk-au+F)t}=oD+MKZ5;T-
ztPDkyVXR|p=Qtt4zyE-*w<^|wQAIZLn;Run^!+H|ybaPsJ+^5<x>>Ujf+310=?W|%
z!HS_Sd@Wv~%ingA{6UE-!zPX9Qbj!+GBAXA<Nse2fDi<4jCi%rAE$nLv#TXT>G#75
zTH^PwM)|*gDTYV;FK|}t1qHLA$Rt3RPp+KZ=j$o6!Y1ql|H2g$eZQBfJ5Y9Lr}nK+
zoC;uNn2RgqWK`;M4RBVyt-TD}1UjaF8Z2Z5N|AWzMIJ2N4tjS+?yJQr29`A)GeLWK
zx*%BlS`xP-1i!b`z3GAl=!)byS?u0)hqgf(&eUj1VHcCFA@S7(UY~qXd?Li<gu8G4
z8H$@ym%n@Z;T4B(hyRGz{986_sU|77+rZ`qbT6xDm%CtX3)%_v0t9oYCB%<&JlDP;
z+Mt}%=$;8iH=+z;EI^Jt27_7Q08C`8T{UF6#$LqON9^6ahi&?OISI+}N6e#CqkH-{
z2L`D%O<XN@rsDgJ%QfTeHg<0(>^#|TvZ{%MxLH@%3AV`rb%>{M2hDwaF(%jhDRBqt
zRMk)JQ^PT!4E@|W#-<t*$$#}^%|WK^C@1I&w~J51*ZSUyyCp1=c+2kXp3H%p!k`e3
zvtPjS+KPFgV^OK?V3IMeQ}C{WY=VfRHP$Ocjfxov<oZ3^;SF6;Cod!v|D(VtUq4a_
zh)V;UtSJ^(RD2i5^>5aka`5ot##?3r9}iU3m^mGjEYD1%hG$r(HG-QWx~D8zAfQM2
zSu<>DpXMH|I&$J7n422-2h7q7zRj8!Sbs3pu7)v91H4bgJXGiBsGfCPZM}5IuX|*X
zRJ=#Yv4#;(z?m4cvc52Qz5IB5<VPa#Ao(E4?BqR4#h3dxA2~eveN?SsON+`P|3jOL
zx<GbmuOXI1O7&2MEL1(GOqFuf&p9r!Ubd2U_(<Uu0?0Un0+a}am(!>T7cQZ<QyQ{V
zHU-P^k+=E~e)Q<S9T%LN8e7dsLY-Tq9%X_8IDHNfMD|0h8jFj0OK!J878HFED}LEs
z?9V<a-W3|YCsUul$r5TR3N)GuYW}U8J$!cN6lI=1>q!8BF*-H&I5;1xuD1Rfml_uK
zkBDKR<%1=S3_&e12!C90tcoujP)D0*$2NCAdI+h=gzU3xYAx_7M%bQCpi<9~3sDv~
zEW8c=q>Q1}0gx*cBn>c@{75TKf2<&^ow0#gr*D2w?Bb-yEP_oQN>svLhSHj><Q0Bs
z%dfLqE?XcUvWoEvaKoU{!_PTp0#M0<1RIt0*(NwQl>cj_z5RaQ6XV-!Lw06el%DMO
z;%jigrV$qxfe1h6$~mtgU8e%mZ<5l1zE`ygCJ)5(JW#q27Gw$8r@h=1C6%M0965eq
zTnrgUG$1obFv>=94rL=r6|GDuQ`dtWBclgltsdU+;_j6RoeGYyc;)>NHmyQoQ^+Qg
zB3c3Q*4DJ-=CpU2zOTTk5($?0DzinHdxq~a*16y|MIN45dU%MFp{cjam^);G`6$3$
z%FEVuhTt$x#QQO6*z=nnq)W+x5c9Ztq8_fFhO&FX{YNNdJB{CmRYgjDN~>mAcY{*c
zAZ;%g391L&-2YzjBdGBCv*9f^FR!W#W!}!4DkZ>C;NFme`DVa~`lQynTT{b67px<w
zw$k%+)GKs|HOS%+HbHEAq%e^ns)u|J|E%QnyH*|Pj7?!C3u(N9m#)OetQpo#j&kYA
z171A34!rrmT@iG7kgEyYdI1PC7n(#8@3Px6um_?wRkW?T#gW33Uv<QXLN-C5PFEp2
ztbZvsqlXIe8|)8y0*+U^J7z#ypWy^57;{68Kv>j5(p0Pna~pLdgtr(xp|GMk4R-&w
z2e>0rusj`M_A$~)_2Fv@ZXsfyl|uQBOFlkN7oxep6)Xo#9=ElbKz^39C^x+hQb~Z>
zBjhfot2d{C4<t+-b|Hxq@5iEd|M<%7?>HQk*`8-a<>S+Y<rW+10H)q?AhY0pAY%U0
zm>pw^kL86xj<e7t*__a6XSdd!x03n<>BYt~ME>Tv^<n2iZm$7-G@sb{JIv;h=MMsg
z0I>L_7{dKYC3({mZ_4|U(qS7aXuLWmBmGi`eY9l&<Zi!gZa){8BX_tC?H4wRz;o`<
z>=X@S03Dn8=fmO!q`e@}BEf<IiIHKJWP=tAnCb%4S1cRX0NbpiPFq2G3=x})bPvM(
z*)-bhId(T^0_jnKUqf#?z{Ka+?YdzV!u}#>8L0zlm5`7CnFxbOnkqwpEI*3dF_HA7
zo1I^^5;V=y9^41&BL8{%4$mP4FXBgzmo{MR*k;i{CCYmZ-Z@UH2)q@A#cnL3_9L`*
zBz-gh!M|x6eo2lnqft8#9VtN!hs+2ea3UfCV02$MMPU=XF(xMZI8K_OwsP(<luE$^
zz9w*VW1P0200axaK*|3{+n2{f_5J?~iBb^>d1qgy>|2YP5(#6;@-DKKC5<elQkFqG
zMKUInrKZJ@KJ_k3WJ?NJDjD9&UP@7xLM9F7_c~(<c`u*G@ALiRT<4y9?w#x2bI*Cb
zp0DTY^_sPz;LXPGW9|-ce+ZJ-nX>6fjmg<qS-2EstPte7CJ}agNBrqEoeYXe`uX{%
zmhHtpuKo1ZX9!Gk0NhUt>trS0KVmoDs-r^oDJ-QyN(kI)1(X1Re+$`rn_%<1_Pzso
zydil$#qJPo>Z>h8s|t#RXj2r3)%15wmF-|if1nG*5d|B8<u9G+t-?!%)r>i?Hhu5=
zNQC8wPPFywtyaKpJh;}s*`SlF1YI5(B_LE5bD}o#XL-<QTs|bHP(}an%v1~=`O5Nl
z8-*c@`JoOlU-&zjwLs`HNPyAl8ZdR!;rcMCsTw)Cfg6Fc*dEZ0@3QrOHRL$K=_i~1
zZjp_JdAXU~t}P44TzQr?<rSS3O%IBhGu@-dR~-5EkcyP5Ohh6swBq`{YMx~Ui9%ym
z&yoDTA72&-;}U{I+3mFUQ^(^i>dTX;TioPhVuh5xzas3M+PcGm7?tuBkU~R9-Nm*U
zK-3L$+?ydN!j4U<*XPWOU0?n9aJoV+`o|7Ku7PabvDY#+F9q|TGF0^VqXfGs;Rj^@
zs2<s1_R#ws%KCvKdsTCU4Ev#{v<^MmQ#&mBt&r>biA{o>`*wys{pMslKa4YZZV_EF
zL(Xi^*6r4b&(7bzIV_(cy=vv;eg`FHDBs6$>7Pd4XKyQ@q_gW_QQT4`ogxW|K*saT
zveL>DnXcRab#B_G|J;P&%J5;M2#_^6!55?Fs%4idWQXeHZ3=1Av~2-_{4aFSPj%(D
zv+*N)Dt}`o5BgR7)%qgPJMLgGU3dk@y&i>Wjsq+ScLVdt{um?;o`e|Kb^$sEnUMqz
zzKFe{Z)CV%zPN1u(Ch>fgr|E{{B)f_q_2zNiG0g0ntIRAzs|ZTD#{Ta{6%9OI8Fdn
zecA6AaA>&25|Q0*z+(41$_;)CSTs|Q#5|3;TXO+I8D9@jbPGlTJoxoHcbKffe1~w)
zJeK)$|7eRi=@~5V6gND7^+}Y&Lm}YJ?|UFl7o<CPG!7=kL4HMy24qsSnrK{^Gmq+M
z42jPRNRT2u00Y_3zgaq0n0%sMhh!yw?Vj9QZa@W_37#)Mj}=e95-d`XbP|^FB1f9;
z$%PioNb2!G-dCaGTs*va=YgFxHBs%9?6v)nsmI#|$@5^-7rM+sOF_p)**OaYXXg9B
zB5#7St<w)7w*2_TZ#Mx`%ng~27!GDFA0b$s8N?eC4*R2azUU1Ug+cbzR-rFvbdNu}
zoB?K8Qn2Hzx9_{JK-|_J{^iK;1JdY@yKf*SmdeV$eoOH05XWdx%4t=;7U1_W=H>x6
z=4kyPHpy_~0(6EtQ29S1ZT-c;HLxsAdPM-m7_KRguDJ}I0VXyUT!;+(o*0EF{gKsv
z3lqilL{&>A3jJhJht#8pi44C38HkrHg$%{xjX56=^aa6{gQ~&RLZ#u`8vlF)%!xka
zYcchVi<|#rRdNmyoK=tmLH<pY<Q!;k$PGmaY=7q(00Lchf5!@W$TH5mqJC)Oi7_Vz
zUWlEO?8@^V*uzV|t0m3Z&HJOfLv`q4Ipq3ADSZ<2ZT+@Q3(5?-=wz^CKx~&?v_}Ja
zdJWL1w(Gf9mt7t^z}khx?~vpk9RLW3b;U7!tXUiqY_kC^MAgLFA0j-@72{948|Mk3
z?)wxnrr=9|2c}JeO0#t0T4AsQl=8n~AP-sBM*Bg$rD7oN+4Y?YzdgDtk4sU4WA(ko
z?6v3iiI-=hG-#~Ny_inf?bf^G56V^HgH9>#fHZpr5RoHa0X29^RxUkt*+eDnI=fDs
zhQA5N*ugH>0I<^huqS>53y<#>2o<^`Gno8-EeMbH)jyc?9y@|#8U$?_+qgkah_e;J
z%H=MicI&>smxWZf65P(h+{u~e&SzW>abA8*{FDHn!As{AHNF`r#oebPCM}H+_UWuK
z%56vebSXbum$%}q5Tsvis8aLyx)BZ%s}MT=5e`X0s<(@*J!VvSAP{<NEbzOx-M%>>
z7V}Em0CM83?0+1n2XRT@^mWBRt>**d<>!rY5bt#zIQ*h`?)rm<O(8BhT%7(lj}<9K
zq;34L%HQ#X7|CuR?1beOhmW?zk6OjLsn;#ru3B59IubRAC6jxK<^7_l8FOIUt(&z4
zGFAI7oXAd$69cCl2VCC+gP0RrUnnjz&LcgHeeb{Uz_teJz~YwWG-YauE}l$lyPAm`
z3L&Gw6kMA?vgj}#F6JJjL>ymNVkPw8F)c?&qVn7dbQWoiLbs){7|9RwJFYLEYpsIH
z&i7aI_cl-Lpev;wF}m`KZyq4^=T5*cR1w$zQH|R1=mLi(em@gk=?D6s%5?p!<>s|-
zIjB_56lHxnKv@RNq9}Y9Gcue${6u<T*Y4feFr9i?0eH`lb<p7!L)G6~Pgw9s>PZNH
z{b{Yq74)VYR_@-`L=9LR^HjTTu9HBU^8J%V4t=6A;kr3htWgG(qNRvZbasAAOuc*+
zlB-ctNU$lN(gsxC4>9j`z+3q^-F2}1;PS_Bn0m|`DCiX1W{EH@t+H=Uale&OIW{i9
z$}v}0a!rZh@@Lu9Jr-j8cOTAlbBuW~K){oL@$~g~-MTm`VoQf1HkHf;c93IE9DHKV
zu}m!Sz`cH-zCaN8`cV3mmABA$2w~N)Uk`W>H}kE`$$ARR1`ZAu7Oc25lgJyZY0|vK
zLe)TX2}6W=z}z}rrB-^dLZT$agd_etggwav4`0wMRRuZK`0n6``5!PV#Mbs76Mq$Y
zd@d$_H`DC&QWVK?sTPYkfK2nX0gyvx(jnkfA+B(IcRn(^LOhd+m=DMrIT0#?=rrq*
z`>z=4z;8i*DM(Qy<eH2+zSGM^nl2<>kHEjY-?z9sa`mZ*&7jELTgB&4RgM56a36t0
z9e=x7G`#Hc)IKl1f$F>OC1knZfUZzAGO-K!;KuzWj30uPaE7%Sc0(X&a`Pf@ATGh{
z(zjPgVOCfkJHGtE94z;?K^MB0uSyJ^6{u(oMGr>1C?xY4NZNYH7w8jeDAOtn+kP=`
zbUCPZGeYhB4Z^*i3=>Zu3U02q9CF%1h-#mAtz01})e@M6w-m)Yeo^WuOv5GGE;4w<
zHiz~HcgvT9kTvtC7sC*;N6)72&S=w_*8(BR{q~~Fz9=6;Hd&ro5Q&4d^q^-<Q+;RI
zB|N<R>`D1=BsQ>A^VMqZ&kVs^>_2w)*iiS~eXZoeR<|6`zQI2AUvL~!bye2Q?EW5{
zNXD`W!N)cw91VOWz@UiBb65x2Ar_rbW#cSbJvSlpJM$?`f0LBGNtBuQ)dn?YB|OOg
zA=ARRC&oYA;Zt^u2)*+_qS7#Z=!|r>SWE1a{vQq%0pAP6R;cEee>wRU^F)WYb)$&5
zad#8<E(pDCW7_7P$}APrAyz+<z4V)0{-VXaJ|e-pjz+h{y0z(~D+aeNj%!S38zj2%
zdzP!{-%H)d@5!TTxNSb~5)$VLPHK^iE?(7Wo2UuD7+!VD{-h$oqG&E0=T=cgezA4O
zWfT?)@fe@ja-6m+<_(3*$+#O_RM|KIa@6ew9CVo7-;5*p^xV0H<<Rpyw}Ge_e}v{5
zDPjEnEvmFPXLltP$?7)f!{zOlkht{VDu&xcBe=IumfKKAMG<~PR(IVz=(!$xM!|gv
z6vc3vb27!%t8n4JiK+3P*e2-7bHPQQ8JQDmBIv^rIP~NgeQWI8l#Ux@9(R7F<uA5q
zMt+x!-<}_yEP{EqEly;m25HY}T0~~tA`guv?&}m@7+&tYx{tKJM)#EhA^F4~X?shb
zXw|JY)u3t34|-4%WbuG*ew4$Weet7Zk3`s7+2tSEy<uPDR$wnB{xNV(nu{nKdg6&)
zNyFC;_xj1cX&*RCI^ypdH@rQT=S!J7k8!Z1?x!eD*+*f!lAy>G!QUeE3{W9n)wF^C
z40oLN=E7CYH8O@<w{fn5N46av*=@}SQa13&?$O>rw+AvuvDhYZ-@2P~B)E@B?42+C
z#ivWm^AFxHsfR*CVyH!uy7>L@9L4w*bM?2}ODf_oB63L|mtAPUi4*082Pvsr4+Xz}
z{IT!gv=g=G_Y9b~<sN#fvG7#wCZDo&(aWvoCvi8*zx@7|mBNdU9n9*T!_O{-xXSHc
zwVj<|D|$_kaxzfta+E=(P{!WO+iIK|G8&R`lJPv%y!9q!d$`><uhCm4a4Y(#oVE0j
z$xQ?H_{Mi}tKVMPTC=63^^D(*17r`G5zL>4!&bMVhf}Pj=WI(gSaQ`eQhyUwv^>;U
zYYDs8y5&a4v@b{Q;95s&P~%~<5aiIs-EI25dT_3oSj4eIHHt$fF$SMDMH|f5jW$>b
z#TbeQl(SH7L8;J{j;uXlAd2CR)U@Om#V5&V(hN=aCPiO=X(;{sHR!MzI-D{PmE}F0
zWKprrFEv`THrfEM_ZyzHrgp?5h|~bOlqw%bQLJ+urvnT!HoaY<52~(LwK%5mNZ&cY
zJy{CAi9a?BA@J){Gv%bhj1QRV^IhzV50hB=O^aXGdcJ2m_d8q)&%3QDJU8Aa+n%hJ
zTK?E@pP;UFrKdjMpX-*xc`xOh4;WKTi`z(+37&AU>11@>cb@}`WG4Vn`SyrEL)?bW
z$bd~cLx?NwNL96KzQf6A+EMNsYkiJKpG+`3XQl2frDSH56P~$7_M;rFjg*wYyIXKb
zM^CuZf3$I94r6URZB3>msr1^yYnsNowJ!5-d2;8hjy`@<rd5AFq_Gmfgc<)Zja8+2
z**`YSKENYQ9V_obM13kyv?O3?zcyPZQ^?%YS+jo4i8miMF}?0TGvsy`3|k@aR$W>x
z(LzG%jK+L@&I1O=!em}3@bQ<3%#})Cb7Paf5OgYQ(?1rbXf{^qxIb@UT=c}=Wb^dO
zA_wWY*Y#c<<<S>!_uI?C#>TGNb(3e5$r~j}VAE5@t-aAHis6eK!Ig`aPrdl`t4#ad
zSr1tsfIdslD4NYy!Jf-tSr0&JD2k1EApwJdV8U4wDo_|x{i*ea(Se&KJeWoI*GQIJ
z6OvC_Q`>e@@XXG{u(m@<qEQNFPe(TtFl&ycmV~oeOx+lDo_eVj>&Wfkf{#2DN!5Zm
zhwtLf#HA7|@2^?4$=c(<_RyQPZMV@$_1Cm2w0gGe3)(yIR1}3M;DC@Rs{50ReXl{B
z#gRYX3GLUrC&?LNUUN4R-gbSdWW<1%9=iqpoB)qLRmn_-?_$=P=uOrQZThG&1}9t&
zU0mPs8KlE7u3vL9+LN@&IxtxJ*v-KagBj=X?3P(hRwYKFlVstfC8ZmegO=#Yt_mq%
z_hZ(U0_L&q_Xl&E!hBACp=a)T=4ioV;BjDy?xET?nd2QdON=<HEzZ^G3FF}s(~DHt
z`JIV|e369H0ui-s`a<y3%G$P_6R;KYI3RUSPsz*`9&NZHJlbgVXw%`*@}grOUbW?u
zAPxbW1UFkzT!ep9h{nEE2N%42Nl^Y0k);=zZjiplqD1nX!0(CtS}T4R3sCs8;X>)(
z43P89rWdt{CE@J+wuuUS(f^_{qVxg+DMO+!2&8-`>BBB}X32H!-yh9w;%?=e7jh+8
zgC@!o1~(rXwlk6YpDG<`P9>cYnFj1q@PA8O7m`O6c8PU*%r?$VhxY7^WYcG8-r*13
zOG(yZ=j*P?EXBDeX*sTwzVlT)%n_`9oT0D|?ZOcw7K53@Y-3>Z9N8ys3w~Tl)>2lZ
ziIU;5uYw2Mv=rWp<zqu7Gh^Y@5+fez`)e@H`G?|#-6HYMNtETL5d(*AghxO0&Q!HL
z7b66n)lp{y=v>YXokg6Jv=+hj7EhMZyI)akYk*P&_1xzxRzvQ<Rd=7+JzBVN`H9d`
zicrMXTVK!bTEDnCnHg-}PuHwplg{UHK-8A|{+dX|lRFbn3vJe3q;%2~<{NEg7-u_F
z8;ou(jqr={m<zur3qOo0f;-?hNLPa%1~3BAC`4ry91F+7gYA4WuNqhXTLT*#gl%v9
z<imV!%<*}y@%1I2Nr@?)tC#RuoYO#$(_oXn(hKw^MCS0{Un31q*_~6rwk-m^AbwV-
z>-9wjBJi_lPhbvzH+p%4ZTfJY8R|J(h16_*QEfDHO;kEck^|Y!*VH{7StejfU636b
z`C4o-_6GX4|LW|C3!jCNp0ws^i%5-Vrzo0D!qNO;_)isgm|g^7Q+U@PMDro30qmRG
z_@2DHXgG(5p)!cu*~0$HrrIdBuqM-B3EV%46aMd|x`G}DRvuTVZL{XIxLK0QeSO<G
zD}McJLMhS_1IxDxcdkCKN)z1*14d<clGa&?`M;bJhfc{jr`mETUKI-^)=a>__T6S-
z=IyUQ=htQf=!V0c_-<Y%gz~HzReE!Jn;u_q3VNNh{dSFHL?%o{KMR^Bq{23bpqm_6
zmI75Jvn_n5b|$j!#R1kv7%P)y7#3lR$$zBA>3D~wFOW@80RMf&6ZAo+xT0fAPE>1N
zegEB6B$JZ7kF+VXtWD<F-slqiUW44yYa*SZXZ9rR6N``j<7+bPq_$ls317L$Ht}ZL
zux;XJM&>g^A^BTtTn}77t2cW^+GG8#HPRl#BXdVJBUNDDk&rqkF!#E~x&Cb);N8Hc
z%J=xt+g2O${O?@~WnT%L`U7Yrslbr>zp5<f`wg-P!xB-v>0XLn3&i{g7_He<R_>Zv
zLD#$!{f{$JhZD?Ltj(19%P6!1X7X7!_(KLe-*vzntQNsX-hgRutNU<vDM*fu5_~0_
zz-8cy!2UvJ=><N?Id_kl)+Iz3j2bMEIBTCM9jf4a;5^&)vXZr%4@fQh$Xya{pLqG&
z3h`LeEm)<5_#j*D-~H{h5Bn?F*_gS$@8W(IPD=dk+S=%t4CyuUL|?y?A4%QnpDa21
zF5kqdmC^g}d~`B%%&P1#^CVYaeyu!L_;9`QDYOZZy0Kc;ZyN_2-{Va$tuWuoe)D_O
zxV~!&5Jy_H$+QUd50=+0O6?bU;hE`~)R9VB><9Rpqv(ZKmi>+T!Lq@^Ls@nOR6e1K
zIQ4@s9(T|mdaQ4t*{^_JQCXVgCDG|0h%0IFxC+C4%Bj+Ka*{3#DBQoXgw0ua{_*%h
z>9x!kFE-f;^GBWB?ezS`TX7j9(MDMd+H2)<VyU0eCCw}xEh)`miTs^z;(ELnnbUY*
zo{YuLM%iduLxGId^`Mk8(#=+ky6pU;XHCNAUy-u9eiAjkg{HHpX(eikKuzy3>eMPf
zqvS)Y{DVPk<7DIGy53=eAMj?Da0V7-Z;Jntu(dDVG%r)RoRD?cs3+qN&X;0CeveIq
z24@E%qc~TF9u5ZtJ`<bd>tu7xZ%^s4a#@GQd+bGlfgFl(YnJ0@qDg9<Y@FpCoH}(U
z+12>IayiMvfr$At*Zzzp*o{D85q`a-iE9(cOmoFeI1+4xh;!34Rj3$hm!q+jaeV<P
znWT<(pW*Pvn10_ds{h(zTE4wA-ccF)k!|A1G!pFtRg;?Ok1@q~p_3Az$(e~IK)?0Q
zMvf1qVqF@GeZ3NFu6QlLG3fq<rkyuxfh5hvF3k19`ePo`<M*K$JBi}?X+h1&PI6}W
zI)=>TW`M8qRaQ84MBN!*7-7?(A{{%3J7ApAB0tL}g&)Ug52KFs@xfoo*uhFY#cpyN
zX-|Rqlnr5!juofEc!QZx_d<<<-*=7wShM|pW)oIEL~fN&Wo#WoGn3lf{xa5&jI(q6
zS`?d=nP=ZX>mfEh4WN_}ZqvhmR@}SbrJT<FR)#k8b6t1uh<_$XS*5qgtIPg%g?hK;
z<F#58G67h~3lB@@Fc%%aZz^<eXfrpxIa#UOiHNc76^J8#!$$vKR1V6h<5Iz~3S}%&
z^q89t{+v2T*DqAyC-X9b8ewR<7MQylzd~cw3&u<xLw~I0FDuT*E(PYZZE%H|4$31m
zznlSFWBWCy2Ia-DGxQlfe@_lcUVQ+CznnJ%&i;i9hG9Kg_sYNP2tTK1eZxw($bTjn
z<eS$qB92mS(?z~wZF@BmY#NkTr)4^LI~(P7NyL(y<zgGX7gTO(4rn9nti7|bwW`p2
z!)L;h6w)_rxK%{}r5NK@U@l(}LupPv;+(fWoZ9Wnk87l^q28t&C0e3UmYPk^!Q4Nw
z9I{%Ry{1=kY-F{|9P6VC2AoF>(ue6@yYXn~q_?C<#%5KHmDSCsQ6-GpZ8>%c%rC!)
zQ}iN_m2UV*G94U?X?_?p=qHr|Pxd_tMo=OxmF_=OSdJll!y=6VGFSjxO+MocqxV@H
zhcs`^BZyBUEJSdxQSNpmV(OW*j)akK*fag6fB$l-%1EODl+UVme)s~Y!?Q%=N}8V2
zSs<1Zg=%Rn?(ea6jIP6!Gbm3l8|NGeZIYuavs_F!k4^k>O3ul<^-uS}jlfW!Hu$H1
z4ijI2(6DUtUyhW&8BOL^xuC|O(09d;QU%|E=9ECn4o%n^$v5h~9KK@srVbd}_Qp(k
zd+<m_8)y&2W)#8c17Pyh8d_{=`}9)W&YwaWp|5Qt1q4#yqp01)%cjO#d}wEhQi$u;
zYkCsmtHdjvvQAOah>9QIjD)p&CfMw0EbdG5avo~XPRn#UJ9+SDH&*R8IJja)IZKa&
zD^1zdlUqKT*Z<ZCU!*Euf^jx;Fa9!dL6GzV$wfm9uX<Vl#lWt?;XKSkVqW+oYhf<(
zg&9gVr|PC%RFiw{on^z7hggri_a8r1SL4Bl@Nv(4K@`je<DRSBY<#DWUHy;P=tapn
zb(=y)x|-hmH;xib@U?fMOv(c&(U|&&tT7ah_RwI0%HTiGce6}|jT5J?%M@=UV;qcO
zB@BgBQ@eIFjOs9+9aCFe6RIX=9J|)1Q8^Ve;!k;1*dF_Va6Q?zMc%{spDTD{jouhd
zY8>4tp7x9()9n6%K<v@z$3}YN^CD&xQcp%B1L7_g@o=aKa#Y8rpE3L~vO0E2`rSDW
zrKPI8->b5YQfzvyzGBl_QrZa41?DA;;sDBd8_Vn#>Dbyk^fxLsHoY}B4m#8OIuc(O
z2&M>rCag5W)G<sFEpOA~)=+JFH4YfVcP8#Ubl=O_sJDHEvu&eXY=)P!f0mNsoyji#
zjf`Oh#By;43!+X*+SL(x#>zi;WQQ)_yioUhvk<IJ*65O*XbRGUX=Z9^BcVIPlmt-D
zTAlrdT{?Le1504`m4!2=6j(#km{{2qS0=&O3|=M?)~pmXHFZ{D2&5*pg=~OfY}&af
z#JTF~59yammF1uOCzpnqqvzN0G^J&*Ro)jZiZIViR#+2G1X@O;8Sre-af2S0f~tqj
zA1(aOXtR<S2X21k!;FlEU>J|$j>Ig??{;ZCRGH?L>z1XIE%vESnlAFG&h87jGi&y>
zHn4SK38w!S1C;92dk}LUkmKV3rroYvHd=h82&X3zd9k#wRr}tv019henX#GrjT?Z(
z0a6HSje!@>dizs1^&r1gZiP-!Aj_b?WAY5FZU>BwdiyOro*M9>#lVieF$#P%Rfpso
zAIYvJ?;S`hksTp?x?qYKpxb6WNGhyKFK@4U{k~6KJBK&T+}D43f<3lWh&*|;#LbSJ
z&Pck0t0&Ov+@f)x)61xbZQs*!J$>;G+BuoZZuD{+=;3-BdZ^b?yRagk`+9r&El~nh
z#H5T#e>$w8Bk*9W>^;hTKGCAq`VW0CmD`(tB$(!rj(qmf9(D_e%2|KN?3o)B5C9W$
zl9EX?OEbBal+GYRc&49)_Doib8i(^R)_{Y1;PZZNZ)p_|XAW3Qs;Ctl(FIJ`YIdh4
zb`NgtlW#9US7%2{tF!(_rkD?KzM4uZCK7h=&)`Cbdi#Gv+Zy<wK+Y`93U7a{ohGBQ
zSW7mS-kEhTiHU`eXP`Bu@iDQ7kgKHlDnBVX6J16NE^`N6<~dv@gpQ4})RAMC0NBW|
z96!7y#F^)qN^I!z=h~}Bb4=lf;h%U8XT?KjEx02OxcNWf=5N8xTOTwsP5nU3HGeL9
zm=cfc#EKlmG|RgvQyH$$sD~&KIi#K#HIOLdE2&D)VHsknDMQt<A1rgt&kx@zYy=_~
zBx!`~tgj(IK=_Zl&+rma_+1<K9gq-GbU5EtSLpe@GE+^t1fx|7!>jaxU`nkpxmrg}
z`Nk1vdjkhivIQ9(sOy>7c=l?*+E-8&W>qnW4YVL<yIGN=pxlLGt9{tW{*N_O&)y7H
zpR=eB<1=Xy6>wZgg{Hb+o~}DcxxG>)XYS_Pe3gZbQ6Rj3CY&7;!9o6+l*mgk&ylG0
z>*hT4MZ<h*VRbG;Qteu_DohcGUNI182<tz9h8G{(T^f<E<T_^e$iVXohnsdch~M!<
zf67fv96fwmrFe-$Kh}b-)+=yW{J*T|HM^JJS$voxn~j|p9M?jj`;!{3!NkYSS#-Vb
z3uMhW9;~rYqAd0KaPVdwkvvl!e?L1v=YO~U{F^muTA$qHOqNMw6W^0Z@rz=f=Q2zG
zIB^00Nc>vVm#XfDR(Tr9BZOjTb!&tmWtuuj57(qZ<6_Xk&VUZ4r}!M?(+}-@xPHrc
z%P3IAQlI9NlC2pG{dmjnUID!E{X%ocDM}j-PLPd7dfUXMgS4pt)HSkkgH^?zXUT#u
zqvwFc(9Di^^mbHfKhg*yY-%0j_8RKW-VE8;%u2E1zH|_QvXB_mSe))>XS1_c;4Aii
zi+mfwqrkkFQ5!%Bqo;nuu0?V;$jeiUWxlyyb3idev-XbrTQdF*Jse$E;DGT+0EKL+
z1C}%(G%9==JUAM;`zj`44mR_o=Z9~eaRU8Vf~I^HxjON+qrnk;phz>d8~%sZeDhk;
zGlsrtIjU&)YUKYuWq<O(v<ki-`y|N9O1)P=OBMzWt3rLw;AIMU7_aU<r~q*_K|KSq
zY58w^nUQfKVca#3r1Puqb!a6Z>E{9(!|JeJ^gn1ttKG?;jWDn`BcZ&E)J1@P^$e`6
z)sJu3cWMcKYrC5=E8Q~O$aM^oN%&~Ls4QA{(fK5FJ`rR3>5DNsw;YyY43gA0Bxj;@
z<B*-5`?%6j#^z24cXQ&X=*z7~xK$QBjQ1*#Np^i`UQBvM55Ghl!t&GoI|w2N#QO<S
zJuc8rfc6Jbs9mj9z76|<!P(>vyL0IEaP$#j@KUe9eu__4GwuyG@EIM`Ky9wvOMZW6
zH9aIQIO7gkZ*7|6qW0o|wM2n_!VfoN73!cjhXgOD#XVVpF2WC=2tk>XnhWjK9oPEb
zZOp199sv<#CkQk~=Rjh{r)M(L%W0#Pav*<PfB{fO^IPi-DwP5BC=Y`kwrQCy@~c3q
zaV-ZW(G{O(pPuAUCs~=+=$hkar^pPT^dGQ;&Z*MSr&cz$s^w$y`$ZmXh>hW#o8&P1
z^898{+@&{q*b;J-VzcO-(v|zN%hmHtV`D2Nah33^?Y_mdQ96EnGl;!o)6kN#6xYbe
zbj9bu&(Ym*&{uD~NW(S4*U2_A^e+>;3D?caM<;e^l`S7rkV%0JObT9ykBuz5v5>m#
zs?jmm%fW@F*_litOD3M7A%So_Rqg=+2n64s@BvGM@&o~ia?N`Kl7iMP^K71!tWgCH
zjw1;K3f3wB8M@fu`KMj%@Mb=@VT(R`Of#%>-N?~|Q8!oP!j_Ngy({hDLy9AI|Dp<H
z{R>E;em3P`QkYu>Dq6!e{$kKm9>w$aTpV4sz+W(H;ibJMnm>H1{@o%FQcMfROrkqK
zaUNDp5HzK63Ca!n4FQe=iy2GlV{Hh56hwE1kcO~I5=BNJKc>ijj#2z3p8GtyhRhd8
zKwjTQNN@QF<1BCeWHHKXI%9L?vXWvqff7!K4{gR~i(>gxWoILYqF!8OHo_2ungtr&
z4w-wh^iFrAK~CEQfWCmq)?3b+Ahe<vyE5+bp3pPp@KL^0-sip8E2mrA%fCz8%ZPb>
zc>}Elu%tod5>o8{4$mPZAA<1pOV~Cka38<#%~+NZ8fNvVaGts%J*csVH4+hWq@ga`
zIIi!*G~<rmV+0zd<9eK9K~?)*g!W9}0>6%#StWgt)XiIa4uYZr(-Irk@l|t=oofwA
z3;isZGq>rr$N8sp&qi5<Eg<1u;9pc?9#pOPR3|{M*JHkI?tRQ`_yGWo34#HWH33~g
zy7g}X@}Tkb7W?^kD0`95^Z=qVcC2AXZ@;An$gBv@+cAHU=C{#vhfh3KdK2|!Yljb7
zl&p~ImBP}F!~sNvQ8BIj)Ye$4RVvcf#!gXz(HINz3l79|SrFToutwvy-VA9oOf91;
z%xeBOtWFzAs-S9XDlD8}^X0QIk1m#J2~m?K#M^~Ff0r<?&}+9*2*vT7&FL%^Xa7d+
zv><>E9%h*;W_vBDR0Cl3&r5)odLVRF3$4bY{pkR))&q3v39Gd>Ebj>{h;=0rR>y^4
zdbqz)v-}4TGcS<~n?G*zm?z6t3=+H2+|2>QIy!Ud3LHa<&o@Q4W+Uj>9U$ZN02P0<
z1q>OL@TV<$Juv_vPnKc3!ZS@N9kF@4KHCD|H&HSGEZ!4n1kV{D06>vxw*f`22RQ2a
z;CKW4-!*LL$v?6F_PT=dny*VWZ2k80hXFZ6efI&<T-{r9;lJBF&y}%?hf7TRS#(dV
z`+-Y7&lR-#)C<zuYnTirk=6g+Vvdm=gG+-{7p_?w$;UXtDEB%DXmq8$u~mgSJm2(Z
z?a3f?Co6S^*y@1<ehqeBg5(`<Spi*);}EuuPH<C3NOwCrd`+plARmkf69uGqFh&q)
zNL+8Qe+YWQxEIqBA6&;D%u?>~3zxXg?`kbif2^K``-+YHDeoZpXS{&iv#L2D>L?|4
zG$!AP@wRRsNJ^MLK~l21^$p9PV*Q!mTdf1rM}a_t+oCkFJX6J2-bn72Lc*7RqUBFX
z2?Q;QStkod4%;okJ($V<%_;tXH-Zk^zG!sy!*bjKIzKAc>>8BM0O%oTB??!X1)T=z
zB#J5USCBQBIc8wdcM9NjfCa=Vx1j1;?IJ@qU|OB_|1=z!cS4WXdJ|7(Cz8{zfWY4I
zOQm?p^L+CGB(0f)wD#APst(2_x(ES;`WwA2E$#z^XN-u4QT~)_ko7fwU@7#q2s7Fw
zG5`853!jC5tYGx&s%q~SRkg*=s~Y-|<%w^R|AYmgsK;em<xEpREn!j4ar&~yy;<H<
zg!vhWktrS!qhw7$jIuK60Jjy8Zzy#uZv`CA5wJJ-QpcgC{PN!5NytXe=!*{UEfyXx
zoZH0b$z4?FgKQxlfk<xeCaA+#Ee2opqH&>J9R9)tFo=y#wg!nK-qMRDs27+gp+?&o
z(mIIvFih_Q5)5Mf)Q$uY+`*oQLV)pJ4u8YZj0AUwZ$jSzwMh5%bO+l@{m*%)Q#miJ
zJ!=x#o`I=q76Y~z2G$QgTplPCeq_Mg^JIEq!heq>n|w5>BY~z50Au}@r=zg>*h_#!
z@hm%5=o`x@MwFb*xer43c#ICLH)~C{ZEz(1Tm=*nZj;6&yf~Vib>+Wa4GRJ&m3RJP
z_(GN$_#RJ#iC-{SchD)~Jo~mJJBclcnknQ~_Zr19lZu9`abC;EkAxVsHlo##cWhic
z)ZW=T14V~^jEB<GKNafX*Mv%tMiJ<Vq$>t|OFQM8S5JH#F_*xmFmQ=xnu^G<C7XD)
z{)`C0J3a2vc!?99FIni_2+BKHBz^+Y{J2kF){RLi%sx<&po{=AHx1=RmXIaAG2gI}
zHVuVhU`_zFT6rsAe}EjRlrTV7Kmw0EvXIoIz@!Mo8we`TQFM{mw$z_lLX&G(dURTj
zbNz}hDxkwP$@dd>exmiXTY{9I{e_JGz{nf`lPnIFR*VUzpRgpEG=$}`stBT-#JD{)
ze@s$uP0@3p6(pX^6{}2E7KidGJ+;!Mo<<$QN~1FjE?ItHM5t1q(M5I}$MtHgK0H+4
z4kL1m5ImrHVNj);S4`4Pg0g$#mY6fy=o^}fWm}qbf|xMz5dXQtGKTzxMFfQBk$h7-
zY*RZjaRcc@m6u^W%FOtqvus{2rvrBp-76O!@oY043z42Cd&7XAMO2@GWfEpUm}Lad
zR(A?xJ#zME<q$J1`>>;@P>sx1!&crIQ(X~6U~J1?kyCZeyI|g^+YgqoUhvER4@%>t
z?Jpb?3HE|nHcH46Pz_&c0+<GxkkJy1hahN{f+&tQ!ErPyGPH&PtYr3k3d4N+;G23S
zz9n%sqgj!xaR#WPZEuF2lPLMjLrvuyDv^~PxOeJ5XaFvO5lvv0&2j?X{yg+mfxnK>
zF@J!1fMwj0Ll&;7o79lreueCD+uAB!D%TNaiSV2j_8c3g^IE5DSP{Wa+u*h=EvQR7
z?U}bgrAzjhodp)DB`KO9{k6D*9GG7P*t)4=Co>({|CYfApbTG(J=oNYT9E#PW*2|-
zQhv@-Rmt8P`mhZ5>`_a<r<!bRl6;(|gt8wy4D{%K3U7Mkda$W`UZDv(dCY|I50#%f
z*z8dA>}x9M^;M);NdGqnvCz2otsN~c-4)L>@G9zXMSs=^Ye_{D%v7<QC9(q+J|UC;
zVrL=zt6MH6o&Sa<B+#f`Ev6u!3x^FJ+IVerxz2tMm!k_krQ}4o26MdZXIKdiA<I~j
zQe>r(ohbQSmZtJDFTDL(dN^1TdIi9q(IOvGP}R72d%pQ?dMdJq)R;oY1n9ULI<5d4
z-1<xy3N7*{a=)FWmtTe99UKRP5Rk<k2vk2IfQI35rS=0?8%LL)Tg7d{@#FR>-L9=!
zp2ixj^7W)W56y4rq&c4N0k{EBf?)yNXX?*G>6qt16j!VGA#6FU%78=e1S&us;E><c
zoiPRZKDvq-p1X}6R=F*}^%0cqY>2%F>mL(?D6P^7v@&{*r!!AM5GKuKIcO}WcW+#J
zp`YolJE$D==v>hjpM-~rUNz*WS)I6pL)Byu3u)y5>Q?-Vf>3Ks0Dkd+49@~<kFqee
z29~A0>l6LQT}AIVMK9T6T+1pfgWVGVMW(<7rhw)>F*!+pSu_qBfgOvOTlEY?|2W(y
zEa2w^xxmk>6M8HM>kuH{FoCRR_8ye)Gh2bo?3;jAb5EA<t`6O)9#TQYELmf#on{h9
zDJY}7Y;jlVlh35rpSzb-P~~`1wwv%U*(`hzn_#LK<t9+MufAA4))eH9PLkyZ>LK8N
zSgxaz{4tj;EAmNZ7`I7DW-9!+4lzM4TQ;B`A%T>w;YdXQ)u^~u-@<;h`0Uju{9pQV
zOA5X4{?DjE#%n+L-lXP;dEk}L>;%CaU~$+bnS&_ajs)`|_+?8hl{D5whAvd-l1k07
zhcjRoI)F%yrDmcIUg(?zR#P7qO~62j-u=de|BXIG6=%-1M7D(0oO1*~wvk2b4#jR|
zvQ2}7a#~Uz&<y?pzVr`6wuB%sD+GhuwyzN+Bw~J*VRmr#sdltw!IwM;&EAX*X%~>p
zfDCEncddXN4|p;thW99a%mXz?!^IU=g|E-<2Ft-TD3XO*{x4fP3#!19q{+sq#>=_Z
zKVfl*^V2s}$qS{%8as2803QNiV9G2r#t5+b(WMfVm02kB%bfJjOY%5dB^+}ZEmX|_
ziYnyk!KbDWc1@>b;RDFlXl>so^!>fFvu#Cdw{&(SC`drzL7Nmkm_@2%OWk1d5P^xr
z0Cw95h_W-wX0ex1a{xIj$-7`dNZgA6igJO#yFMD2KxVT+U{eMxJtlI@uPigY4oMoh
zs6KO;VvqMX^@4h|1;j#FOPIa_fKSSSo@5GART~L`*V9!pmh$zU4|*ZHD_B$AVDU<4
zu{tKSGLZwu_gmaq=drZ750bHWn@64fA@J)MjI718;Ni&XJ+7{r3xj+w@t$k-3Lq;r
z_%?bq_ySPm-vtT_6A6{94dUO-3cbvbQvbeBPk#UfAbs@tZQ_$Y{DizQZS!7J2^^{2
z6;qgjC;P$l0i&+@DS+nxs$$^1;S*LmyX6hJ6YMQNVe?7+e0n9oA5kh0FtUl)zWhSp
zDF{;chb8CfV|JSsep^_?L`q1N-q=Tz`we^e0WyWp@+GmF*v;^OpUp|p{9MNn8(p4A
zQ~XSTwpQ;v2j50NTX-201;7)(`eNUXLInQAAV@F?$rVG1G`O2TA#9%opWqhyABf~o
z%C_+du4YdNq0!I37-$xYY=NT0D#|0R(bR7B^vr&Bz^GHu!6l%Ei=rKVR7p=-bXSsv
zYhNbgU{uIL{Ve><9r)22RB-^gCfL6OPQ<nnfCc^rbXBhFdvRaiJg5nA39#n-s&(PX
zDDSbiPq2F$3qYRn%?YEn!>IBF%`fNnJ<V44yAvCEX~pOCa&BBd=#a!7x6?Mn>?=b|
za;FyK-s)=`uG#Oou_5(&>;{1NYcX-X0-wMdz;oF61LNd6s!Hoex588_^~pm$537t=
zunlMlE=xyW8efyUm(t+Uo?~j)@PA4?+fY!YkfSG!oU)uXF6Pr)Z)cv`DIsG*|47do
zrm<)w|4zJ_DYXs$6qv@RGLWherHREb2xo|aT-tMxC6?R6dq8Q$VO8+uz1bX+cK&4(
z`>4V&pFSfnuxoH^W&*SjO-fVC84z<y7&5hYcI2CHZVsp#DKu%FfC(pf7Y}=Ds9=dj
za}qF6Sp_I!AT0ev6j@#GCen~{0`4kmyq=v)hmA*ee0X*&1HVh)_?l3@o&qmNAPmt#
z74(NO2@Fa+>?5F{WDt8XS+J2|9dGH`YlR2?24STs25cUPlL@`f15hXpHbB?~C@YJe
zs!4s_k^)rBK#H-|+3vB<^-(sX-P&oxM^SWlO-Mh+SFC!t;_Fr+?o=LE|HEl!1>QBW
zF4_1>gkJZmt5My5os0hE6op`7^cM7IR0<2KKrEMI3k6rrrxm>$<M{5Se+9q*e|~XG
zHa<2BAj)4)LM<Ba)1n!?hd(pg0ok<sMP(XageKLdDU~fps;BIMqU>UPhKO=Ca37Zt
zj_J>Ru~ChKZ_%nb8!JNvpF0$K0kQ=)1Z3hnhz8r**=J*!<V?HX{*jF{pz3gB3SW^6
zpx+^w6A=DZt>i_%0T^5fX-_Z0w1JzV23Cz4AFBW$o1pZ4U}n7R<O47w@A-=+9LBNl
zO46B)S%{?5lCl_7o<(W)L;L)u7*S^(SuFC;3Zxx5<LMKSBl-)l<G9d1lf?88thkj?
z@GN#qz-_!Hs>(ZqN4oBO?l`W2=x??{%reJMV4ACi|0Wgw8%uH)?k%?eLU!<D!Usv8
z5r)~2Qx;ei6IH2dtshTfB8RZ@CirLcoEtjP4%*jrhHSJC=fs*iTyevZ-!n9eNo90=
z7$&;6hR;f>HAOO6|Dm~_Nq7+D^d(C#axtlx?vF_Wv&t@z(RV0~Ff;H$#fwSSlEIAw
z)Co`-0n7iUOh=6W5>hTimK0c{kArTa6{jch4dM!YDbjr78Ke8X*Y8)}w2aj)xD)G{
z#Oj~ev<y8CuyqYU+}(kky||m;`yQJ~FOO!tY?0sEqZdd?d{A|RiCueuvXxb5C_n-T
zc=n(gZIO3k-kCeR*j4n4dx5af?goZu5`#2|UEYbM7F5X<Tl#%Y;KSA5=^eS%=403E
z;<%_;px?LS3Nj&xBE!E6(63pxgh<2yPy@@ws~2*ygO0H<H6WS*Dm2nMWN0{#dZ7NF
z(AhukqbGk*D)bnHMZTIz|0=(Sb5Z;wnOkNbd=fzD-U5jDbr8I*a0hch_$HaBBH10u
z=qnFmD3(Z0udrVMBKhL`nq(x%<KP64)Il;YwXaC2y#yUZQBM~*#p7A~jo1%;7NBim
zjk_;#u}N?qze=sz9u?xEa8;N?b6I>jEp~vsp`ni@9f4%@>l`$*WyTyc`vfv|LP}vM
zf_B8diJJ|gM7qD_XZV<C0(|`7eY)EpjaEO7)DlYF8~fV%vPZ?ahMVf1Pml}#mts0T
zkg_Eeg~rxb6TA(H1_oO%Eeum#IE=HgSs|V6hU>>(LwrZ1Eu4&}QRqY8DccZF0TD;~
zUd9e6;}GG2iUB}<w$0*(zRbqVb~l*K8(~%-RMxX=$Ri<4`{I;M=0;>dLqR;}@N%5-
zUBTtd{O!U`y!SE9?V^<%8(GYGV6-87tjM@|b`}o)6nP%3WoN)@2Gf=k%teLyfN5Ih
zSFw<sUpAd`z@H59`0kJJ0XAnow&PoJ_`p&9(bD~{qGeCRRKbn`9g2T=d<Jaf%xHLb
z`?V0~Kuj{AQ_{0+GBj~{WL!pOV2&oPv62etv+{G|AS`2m<+1GZe+~Eqn|50I0{0N1
zMF~4~nHR5ZyNPG(_t&Uz%G=<V&_WxXX$AS41&3uvXBpi8rA;;Y5NlP`XXAvQSK@#6
zBinDuXd@d>z4fx;%Sw5ge=BbPBl9VZF$+a1rYA!>8{3K1@%^mx-7QxIls5Ddj-gyZ
zoecp)TR&8t3ERfQJ1^s4RB~(mnfyRS2C3^wI@z^Gxv|5{tTI_AM=>GS9;WvO<x>-2
zu{^?nV^pc5L6oRMV+0LnT9Ls71y)-<=yxU;7PG@(iW-BNKUL9(9{7x(@{DeT`VXj5
z6MS`UL29{B;g$0%j)k}whPv+(*Ce}{4js<w21k%Qa0F2Xszzm)>_`ZUWjRjgXL0ds
zchiA108CaX=mC8H_OSMjK;WPOXx{yBoE!crbF9zL^K!#w4<FqCs>4txiRH7&#){P1
zx1cq|C0W#rLr!YmljE)RS!CQ1e6Me(vX=@AXZ<OQ5>5}Q|3Y+~WW4@mB^=J8+_dX`
z<dh84)0m(!Fo*>bRPr3~4-x+0F-qNiO!Q6L&L5tY=Ksst=U3FB^DFiSqPTD#7v|35
zoU^Z^P|cD%<rwa^xxs&!O>zj?m<>6ff`2Ztsu%^+J%-Wh?hMGX2Kw;gkXfYbs**~c
zsU0n^$;j>nOh(z@=OUiR!XhU7n6S><2trZbPYQG<bI-=jqe6zrgZkr8mcKuei;=`T
z#h6BA6oYKsBaqi?)rn0jFrV0OWB~QKzYhusLH;>#1_(xu#`N-+-UT#*dgiLVz}y~_
zk?CXN@tDk97>^`$(K&3J)p(n4DKS(|>%D1VzqBN#a)h3BK;(yfsT&CR;Dm;dZx$uH
z>)}l1^*ZE~0C>iE&>R+z1Eegf!6e<<{XMA*==8`I<%^gZiO4Sl2$9e<Qcwl%%XpT5
zQ2n~$<$CP3Y?VIGPkq+*TI*+*1*ECj-UC<#<A@{wIMMwava?Kv579IPvmjCovOJU-
zD%-8C-_PBA<+5UXbF9+DD)_I^f?uJ9SY&&JO_53s7-c8vk9cF)o7|+_Mcx2cPw!R$
z{D|7KW1s72amB6%=?mvBo@=Kx4pg$JrphcP{SY8?iCzM@A8z8#aV&l+7!Fw0gQ=T!
zuynzY`RNu0h6I(_5F^%=NBxXdkPp8qB;VVQIsSF@+!o`@AB3*@6Z+G?dnZh#TJ{0u
z5=5!jAxOa*`9<N%9UpKLj&kF@f6>Xt2HjR*WFqyAzfxSqX%f6N#y^gtJ1Jgy1E5Ld
z?b8x(z~vI3Ck8UPQPa~PiX@Qys`!B0=N`tm&|9O|bS8-MJXzTZtaKTkpZY-h9<tCr
zAl^sNw#zli|MomqS-^*o@s`{v+3KFrZkFx<AFLmIuZ^;5R8J7VCmM``C=^Sbm2)6}
zh=jstuaV_>^A+Z~NNn6~C+zDUgQ+g4f<-AQkfLMfw{|K!WJ2g3?IEn_T|LGanV^&W
z)!+IMqhu1u)Tpp%BQ6eD<RN%I9N8|oEOS-*(uM>o`3=)JYme6M9j?>{&i0=`;I{5Z
zbZkV$p5A~r7D2*rDG*>uh+^Z0*frM*t2XG_VM~*h?xx`@U%k$Bi!ik#lDEcNcJyX=
z))Pmum9a{lKdT!NVzUc*q?lGa90xYGH?XlEiTiUao?ib!9f%>k;8}{eB)}s<yQH3)
zOF;ULoL&L0H!$WmBxC_&p6>abjCWBc_k`!z=gK4U$x|Soe7XcT_ZyH;Qh_RtIsB|0
zXV*aQyP*_fzXJFTV?jNP{q;uoGRxI<=PSQ4*mdwrs~32-I*u14@xvf2g=<Zzz-8j6
zddk8s{Eh=MRUiU8BCmI~e%xl29zxMGEgvPEjwg;Vc(r61bP*5Z!CsB3t%wWEcASl`
zsdK?XhKk$*n<jS6;tzeg4ehTz>t&niYojsM1PTm;UuUE1%zQtfY`6Ru0+U1FbhUrr
zFa_=aEGHald|h~>mXXy$r#8lMosYY1klPBH@odzNU&$WQ*((lHqG54Wsi~Sq5uR-w
zm6@b`7+J;pQ<5;<Ec~(-0`9BwQfo&%J)To+L`(uWebao?6dRrDv&OlKKiZWisa<;-
z9|Phy!$E|#O9*SPLXNC6oKt5o3nzA^V?%<6SYkPc8i?h@R&j_S9a@X`o}<ONd~*m`
zA*NADW+jKS8WG_H#PCUPT_AoV8c87{nT)cyBn<srbD)TKVxbXDRVq+`DCZd5{E^xP
zvGTxr$(<$mKuZREq84pVo<oShK5-to;uYv$V>ia``02od++#(?+zQu%(^%8TZ987h
z%{D>i*?%EDKp*Dxjw$9K4dj474jW*0Nsq-F|JX2Ma+U4&%{;FOVF?Hjv%@q0<hA;j
zXCY_H`a-yBD?^OxHy-0$*6D)es}Pr>rNuR&*mKxQ<?M1;xdqV5eG;wQlE{^T<=8OU
zRIfu#0WZ|9%QVkM6}lNdtD78{qS-iDSzs0K#Q=}2!Ae9eB-_wbfRh83rM`x&dw?(F
z5QHoXSa_%O*ampetPmD_^C7))P0O7TvYZ^3RNKBc#Co+0$C&wGmdXxq-wh^pe-U_b
zr$Ni-j|F}KYcn(w+j+P#KcWk{tW9nfbr<K0HH1$(bN_*Ucoq7&`G9WcKJNPu_@{3F
z9o-3tPk>72=QA;vNlit-xC8d@E#j%s<u~ROH)}q6nh@po^|M!_8=zCjCSr@6W>+dY
z0lD-cx}XsP-$hX4X^_D|Gn_2T(wYvnqJMVwr#M&$&l7kak|_g_e}Ha^3<bgKsCul4
z=>!`uW93ce#!}<08y`JBxis8oFrz*l5#?Y?bDReD3B*~}zTNT<mXr5bJ-XXp0gsco
z!NEWZwHD+uM7VSI{mOV7rO0_*LGMxIxtQ(!zIMUWIcJrFV5^nNZlUYht^Qm6?XN8<
z;KHbe{1{oA9Dm9aZ9}X0WxW~jO)O`-#>RPFga1a*pwqMMmDz01Pkq?@eUEr~79hbp
z!ME%Vpuu&Z0DW!`ll_(s&~qSi3<Mn541vRI5ID?gJZ;kgMqcqsx!C)j&i;xCa54ai
zqp05?iwVo}DjY-(g&<H%!8Ix9qdXzN4a|aLYFZ~OM&rD=k6aAhxLLgV`$w<-K7J6o
z#|zlfJ<&f<k0iW|0&^N^4-@g~8X1RROih5>Q7~db{(<!qbs?ZGJsOS3Z8M8*lv@RG
zH*}6b!y2x9x2N9%De9~+BJ=NgGwv!XN|e=vhJSO-%<c8ctE_fv0M0A;2yX2;cypD_
z$Cf&ne<nE<KTQO###u8gp|iTP&Poh2>1;**O1i+t=i^kfd*>v={y?mjO=U$=oMKc4
z^4=K78z#vk4FMDeVaY$zoV*IE_7{$y|2H;~u8nugNWp;=y>gTxRZmT@$>?Gx(>c|$
zUKo&@3i<u(`!*s)VXAM5ZLbwl8^--h5c_*Xh~+6dz8PsvX=Ay#q78MN?Kp+0^^lAX
zyU(^cGv+@FS_4N>{OyAhp9<CV=5t@+8mQ)ZlK!UEv#&1iCa$lpP^H?tKHwR>^SX||
zQbJEstkMzZhvug+B|((=R%eH>OOplr2`f!7AHXrF-KD-(wt)N_h`MVL{CpEU_f@Hv
zdaZUFtF@*)CQUoB8TCLo!@lH0;JJe`9-qCYbD3QpG887&;#=4?oxBw}TI)-J*Be=h
zEIVy1mK2Lrg;=qmH!N;GXO>6<UJDhv;GoOY0^M7{ZJ!8Ctr?DM#F39nXEf2k01ljV
zS++-Pyv2&&jwFP*98?WEwRz)PY#`zu9xNx_q~l$UYZ;pAvY!Z|aZ7;RXA%x>-pTp}
z=F(QzTT-GK+j?ut2+-|47P|RTx<EdvS1Bi?J3&UyLK%8_Fc7#$h)wbghyXGOJa5!t
zYwkCLo`Y9c9VNX64_-A0$Z5Q+d6_o2F^2k_4$Zqr^>1vQV;2R2wjfCD7!(-<LFqQY
z=7s1YB#178DFOENEnp{EcB@Q;3i%7j`##t+{BGmasK0%-G{HXwQg%a{atNSk04BmO
z^K#gwn;q>17mb|biy`6_r@-cr?B~eotbJS|_lNZg6&6%Y#jyDAv{rX;ZyTV;8CtCz
zA;>LG8%Eq!AYTy4JZbjeGyN*-6ga}l(MZN26!3vtF~#3)Jxmg$<k~1-lxdplxP(p2
zefe9=7o2NWze#<&ro7ERt`c}nKsNZG4zjZ`g04*g$JV3*MVtUca60B7_|_wh9k{;F
z+f6}&26_`5i$_8|a^l<r-kh4?)|nCqW2nNRsDEuHwFv@G+#P0SecPkFxFAMc8Def;
z0uv)xmgJl=c|!K+zH#P$(AP<=c5E5#puC2McEuB(cRf7sba>uwU~2*uESb~{FQN;`
z^^*<VM3c_@&||6*YTSKeCQt0=oc1vVtxt%KeW2p^(X!LK&Zt=vZkK@({NIT~nhfCi
zcftMr+Y`pcuYq_Pq-B?9gJ_hTR(+*&=zZoU1Km%I-|(Ft(VQFn(Cdg1!m5$~CJ$Qf
z#(-_W5l-d;r`wR8I{OBctRwJ@Q8bo5ar!C%upPV`d~1&2=$-4jyy|_U?Ly+-L!6s_
zB*~6%QZ%Vp@Dr<DWFm1A+_(ob1$w#))phtBInG_!$Svuc&{AIY5H_tqIeh93;DM7F
zisS*l`mk9y&1JhD!G|*n3tODcwc8eiA3(?*3=}u|A<<ov4dUT)==vW%`Iw>ylhEl$
ztLub5(py1xM{aO=g0nysEcjxa5j@p@iSEY2;m2Z!fV3Hnq-i8*>LaP>SAW`}huA9s
zAxZ%EaE`E?$El$seh)(Xg>QzwY|R?M>Lt4tR)J$;FN6vjWbo!hjex7pYvii)Z!3y~
z&(RFnkgq=UY7PccVi#KPrc|!LJbWJ+`+<RlTg$k+ec-0yf|IAd4|p|#vOd#^_gA;x
zf7>z^-r*O`Ex!uVK6^`W?vmij;#7FJ0GxSwR2RN?>3*8t_YDGe0OxCZ0hZz@BVrA;
zs}Q+M2T&j^2%vF@()vLToLv_=4`qOS?gL_W1NfLX{uO`z5DK-hMbXJ`Xd6P&o^0dO
zJ7Qc_ACj4VJUx3;89|`Za@3~=h?bMf&;)lo2F1BCLJ@Cd5aT;wFE9uIV1x;25=Jax
zXo8niZ_Q0RmG6}-m}^>~o9fHLWO7gO1MpZmFtnBmuV0RxjSC`4RJ>h$hwq`(1*LN@
zoEisV!k!dP{=X|fCmu9oux6*r$pgqUjBOVfb5>D*jBLdvgmSau?M1bE=2p%`AHjtH
zNKaF>J`j{Np2a$_h|&MGj{vA-IaQ4e#PdLrwL)KSf0fI0{^O<Mn-rn9+(*~i?U^p4
zPr(d`5Ym~F!~la^Cl;JLa?Mf55NJBR$H=?jnk~`J=dDW3Ge#!31*!mugZz#mvWO|B
zA8TY)kq?rsIudlBF$VU=o}u?yA(I-=&pCG(E1t{*2+zy1h23Mt$<U`EJ_0xfn8;|#
zf&7(TFrv~}m;uP<Q-gMl#rXia99)205Lp_9E@}sp#uzDp#Ux?b`+uGXIHw=L;;b@s
z5TTe5<O=TLLak`OyEb<te}{bE)AS$yjSqrgbXg|Sx(ZQXEG80urs1WC%R62sAZ!*~
z`s+Lc64BJjXo8Sk1I8rac<3V;y;y<T2f=jyXi5?|Ht*hz91sE+5opp!PWu`N$1wl~
zTGdVD?Sl+iH)c5OOkg-CoRSey?eCbAAZt&8$`H+g70N@3H3i*s9xa>yb``sA`p_Y-
zO7cI)kC}3vzwOL&5gNyfzzhrO4N`O%;7?_#qsh)Uf0uCX67IcuOlPOv`+bhZ+nXx4
zqIf}|3ag;tWGG14m|NjYHqm$#7Zh6r#Zedw6*5riQ0zM`VhobUAtFsxF^WjjJRXr~
zkkWpQh1^^dKHX#8uLkT_?`=PX%C@M@ku3XIe?J3p?}5q)EKDFRB6oc_AKdlBk-NS?
zuNC;eIvX|r*sPdp=L8lKaQJ_@A<f}5jCr7)u%gufg_K2jL~O|_7V8mi6mgacK#%ic
zmBPz3Z~{qyWF>6i7HJm3ED_wt54y>c3m?ladj(=l@$oZ4IsCghe<Z)^U6sL@r~hm)
zp1x^#ewAn~spDZ)oRZH_A2tD*(tuteY}omq{HTp-V#f{j9zCy!yswhw3BH+bm9Z#j
z3aVl~jG+o_On`<*0V&qd_QFHVkqW??Nht0J!kdvFCJH$c2MDS<EM;zvmh|#`AZ>$B
zru#F%C0(FFq@S1@HB3-;W2NYY$X>E5Tpsimsx{`s;CG!m<e9#?&80Hd3wq+Ar+ESp
zF&p3-HOQw^TLmJ9l;wRRZ#d;pdb-d=BRP$n$WR{?8dUc?Nf2PX+)!Vd9Ow(TSPCHa
za=R==Bmx5=ds?7AfTaD08c8dRyDo7%!zv&l#|S2BggEPdDOs}ZhQ*CS&(D1j5XK(@
z!mNjYFcnsxEXmU5sX7osCJ)MTmvfaPA_?}EWR3TIYT7wLk*3P~JbnG)P?~Z(Myrmx
zo?4nqN~yIW_mM<D`<7D=i@;@0+wX+^9~K_-v_SZQ_<GGd=ZCm%dHHl#*aw&PxXP_8
z6j}%5ZoE67-Q7s|zMMl!&eR~op~}6ugFpdR2H_jnz^EC~*~iLZ3L?G#RVgg2+FBvf
z1l&$FPucUEdtQgA6;mW`EAIOJkKw&1RXsBqVTZ&0#M6|kd!*}R8wka@`gu_{<h^wM
z&c3-pw)@@Re7xvcCP1tt8eN#{dbRL};9B1pp(DQUH*hc*pO+E~c$d7DQa3y{Z_X-?
z5SyM0T}m;dW>P2K%d=fk;s~s?lC0mkV&Ls(ACc9md-iik@IAQ~$9}{<gXw&4)2cYd
zH)p72l%QSKy6lc3NAKn9`TE3lRq1oZQ4DSVv$^k0JtlXlm-Qyv_86YCGB0-+_Lwrv
zstfSydeQUapKX&l5xlu?*N>!*7R{Yfm}}L1y7ME0*GVa9=5~e^zwDsi&<naMDI|IK
z!um@sh1Dvle*2$D@Xb}rlyx=S1sP(ODpuF{>{=9S@bJ3|KA>&M3g6;Iw!x<>RgzvE
z3c$rzBt8l|mzzjzKV2C}6KofZj+OVDzj&=PSux}c^y%#!xT3k?tMvMgFlYUh2c)De
z!vsX4*CiH*S-+JrNaB)Lmy%r*&7b<nD8g{$ImV#r)#{Cw-IpMa7_f+LGPszf+t{8g
z;<8N2*&|L?F~8f|`L4#*hbTqNH#%$BBezm2E#YQZk~cKuKtmfe9D|1UUeJ&Q4Rz39
z0Sz*!Ap;sJpg|HETs@)To(M*2DE^w%lDi@+r8?vNF>T36_X#~F92TAXC1v{vt(h}@
zOZIn_O8yur;_dLWhWFs~ocN@$Bo8<}6&jMDAsias<DnrL8ZJSDEi}lWh8xfj0Sy>v
zDBdf#MaDp5rPSJZ3w|S-$yr0<9!ve}nm43~)SS*SKWHG->Rs$RlNCb2Sl{Xsj*XRv
zb4+6dqt}>P>-T9|@Gq=2<Tt97*&<^pur%5P8aHbh@f-aK4cno?9vY6LhB~-<`W|b2
zq842JcAQ|e>vOoHeFj@(Y~cpV<Hx#ucY7Y~$F-UbUbh_&jf5L?x-Agu(aaufv+ipe
zr`+P?_UnN)d&A#LT~ALQbt>kyt`mF^CUWyOW<S5iHd`wx>`T7Il0Gr(F9kas@)1?~
zx<uSHZ2o4foWCl;;m|(Oi(1BSI4)}KJehCe>jQf`%QS7TuV~{K`SkjvJ#<o9)|_B~
z>r!b0OF4^S&U?~r^x0;KC*sEzMc=Y>40cS8Qjnsh%PonH)rt<wylteP<Yp=*rL<3q
zA8#uVZde(wufM7>EUfOnB)`%=Jt^luxq5b+F6Xa4t1WYVu9u<y=lZa)?HT<1cii-(
zc2=C$&m=~M?fnfptkjlidvJTLanDPxF_Okj$WvI1dn{kW#;&o48JkkL(QCQ3)ODrT
zVPRQLdQuHR3&Zz*){<)5UYGdsrG<VHx~YnIL;aQemhh*d8~g7Y5+R(duN*vmRbD&H
z2I5VIO5Gd}5!p;OaZXNx>%8}+118lin#NN2;u7TnBUxo?N9i|#j60r#$$Ktr*Z&;f
zC!4mFf@x?pV8q9Fd)?r8s~gX+<XIvAd_{rfA(z0Xo<0d~#7vj$^qhx#Eu);n^+#?>
z@3Cuij+0r45i+uj&b5MGrJg>F5IHAf<b4Yqx?QG?AqV@?-e@co&MjB#&9bJ6B_t8K
z>h&*bmdo9evDCIS%J3u_i|!Hlou-*^lUQ0Wb1{GWYKD*eMa`FTx01rOEo37zjaK55
z7hctNyBT>?+wE55J#Dw!3m<5^{ju<ow%fhPGHti?$d}q~nG0WQZ&{GYmW_#jGw`R^
zX_AJ)G2zhNugNP@x(_g!HXj#ZxI;FbIR4eSZx3_dpod-Lem<rb8~v*i*JYuC#yuW`
z-ga)5!w=@%FV<b3Ge@hWC@5!6uvTDpx4OTGtTHiK_F!g5v)|47|8zeviI0sqmxM1*
zRQmBG3o7YNN<ZFRSV?r*Y5Ck&_)nq-`N<_Yt30t%&HDex*_X#dz5V}}21Cf6CB;}G
z6hcL0vX)5d$|x0KCR<uei;zjy2uVc~*{a*9VbCH8DN95PhDvqYjkKV${$A%j!%f}$
z`FwugKb*%o=Y7t3zvu0|_UG%o4esr;1J`)eSvi4h?ZXlQy%nSn(xbNy$!;MYJoiR9
zCTx4;qtiz=Dmw2n*cp)D`OZ?cxHdW7g6e29ziKIJmfD>iXjeYmG2)-orFcQt`Mg7v
z<2)~Q>$&PhDY?glNq!Y^hZ*HpTB2<@8w!(-FQu=mU3tcFrI-4exiUp57huHYUgN>$
z7~L<K3}A&Q2UOtT^HuYoF~_`irxNGNG70uKHO4;so7yFpj3%1<-=6R6mA8>BNh%wI
zR^)tx<l}Ml6<&FsWCBTxeagzkm#UF`JewZtmFEkiE_6Uw1C>B3=v?7d;y*X}@t<@%
z=#V7oc9Kv-om9|4O771dtCb;j`M!k@89PjYuaV(fi|eNMcb%LkPH~!cXYqH+!0<rp
zZjwXKk&P~vrm81`d%A49Dq=3slN)>~wgMssEX(Nv@*T<a2$7!JW(yxGWt;Ls(;~s7
zQ%dr<+IwQUd|p1b*GG<U?5<`eE6w}1kfj<LYC~0H-oGs-Gr(SOKKIc5+Qi6Dr`pd-
znoF5>Ct=6R0pfdu$v2hu@U61SG1W%mR?Tf<$(g}x+U9LB)27-n$Tf*qzv#3}xXzxR
zJ^0SXU*>Vr*3Nl<di4#P4(?R#Bh+joS0-BYFxpfu(ECkZUMTA~dAp2|WzrpNw~kz%
zc=fGLo5c6iuT9i4S(|JR>`d#%J2m+#N!F7tsU|LN2;QXfS)&K=O#&WM@J*?69UvdY
zdL^zUmVcvb)#J?XHk;4ov?&(4+1}V*=0?7$$`{6Ri@v?xr8}mf(N`(r8i`?Pu;^m&
z?fX83iBmdsT2+V{k4;`~%yFH&<I)<2)RMOItt)hVrMuN+jpBj{@g2+=>s}X$4H5sC
z-@Vt-_VS|TC61mZFj}Afl%Dv^|5dN`&0LhNtqg}w9?zc69HU%Vd$8{|-~5|i>-T)R
zpXROPVn=G#-<~sLW}!`e(Sr<=SVj3tlVnBt7L(YD_Tps;-Xx*c*x{O())lj=@!TSI
zRy8!2-hw77Vwc{^H*!u3c2n^twe3<Yuc$48rREQjH>L%nZ5;2UTC*>H3w@xe)Al+*
zQAMzLyULPp=&PpsB7qi1r@i07`Iz0+`L5dfeDcdYYo;SsyvnmKc6^y=^o8v3r0|aL
ziUyNbc-X?_^+ip)6hp7Zz)g>Dq2GpY>CkH{<0#zP&rRRDOrsr4g6rI!OoH27thR&c
zhUV5*Bx7HVL;h<$^@lH+i^gsbmmi%O=deYb)^c$}ng2D$Q5om?-Pav+Di#$nl6S&u
zSTTzMzjhV_y$h)Q-h5Z?_-czNytzY0xNbGE){S(V?Z%!7H@y9|U#YfKJbc$^!$`Kj
zlfOI;4X_ex6)!lp*wvEhIF|hgzDSv&ht5kcc;Ab=18H1Az8~-XrO<A{<f}X~YMXhk
zrA<o3jr?+pHM0r(jmd{(T1=z_wQ0c`VlHp{4F`P)t#)k2+Y!UTFIQIVDQ@a*R0~_r
zvU$*Y#>lzUc%=2zcXx?`g<r}Du*x3m;-=fZ@XnIE&?*($*})oN>({8%p}yFz<1HpH
z_w?rlo98}-Xe@kVqmaIMAhS_)m4fUiV)o@TrxQn4d2Q?X;+xT$d{g_O$)i2qZnlG$
zR(0ET9p9$(q0FE_HFSM`aBgpXu~@(RDHwDyZ@L!hIuBimeeNx7CfEq9$x&@YeWzN_
zqO~53ujSMwL!pD{mzoNPb&7no8VUI;$U;PK^ij|iZ&E?4MAz}hCa=nh+-wi52m0x)
z_f`7hPAX8nsSWhA$Gb%A$0Y`L&`TH;Ju&Dr46@`7vc4Q_gZh)uWYmvMu7$~o-(m8P
z@0ZkH18)P<1}|H3=f>dnduJC`eiGfNd^MihZ=2cq?lrt}l1onT?cREd(w8y=H{0P$
z?@Aoe>vepE3as|unnq7;7GUI;C<A2lY<$`5U`h0UAyjmew$YEKqWlSnIGjwW>HF(+
zxTn~2f6E<0I?I{+gWsDgZfZRb|KCgJTjhU1fz^I*Zfbkj5*~QlSaMTqqV6m8ocj-3
zDz?9Bx4HScy*TM*S+*Pb6)LdW?@f4DH?{u^*0`x17d-HEPpI8^PJvO4q{_(pw2I28
z7YfaPS?uq5re*T*U4u0vxrosqtkrP+*|t9Ji=qV+!qyA53jJ`;>oSq3xCk^bd`Xfa
z^`&fOvE%LDdF8FK-`&++=f2u=oI;Q3`U4yP)gg!bc3NSr4zfb%O}heE8JqjSkDk=^
zIHC2&iYr^C1UxlkXx8PA;fxwpTLGm*icZSk6&piBHl!VAIzHHwz;t}HC!v^I`?=W@
z6+9T~me$`+d{8vI3^>eIL9K@UXTmdY4#&9X>S%k=b9)s$=;wPCwsC9!xp`BfHF`Jv
zv*5IEW!JTPr+0m<C|vhEsZ#Wva*`u!EaB#}#L+^DGP@s)yJF7f-9K(9joe7yI#Vn2
zII{`93&w0ZUl~`-t^K!VJyXoc6{t%<yV~Tz7H`*R1qP7dq2nG(+n5FnOHr3^@FjF(
zK-fjVm(Z)b2D;Ks_09-L<6qsn_rQAPAtN-a5v{SXKvlF=1g1jQqb)#<hOP@4&=u(V
zHe4Z;9pkQcgCWno&!a8<Emz?BL=z}qfq~}2ZGD+Q`JygS!MT+a&vtP=1J3c9hQ5>*
z<&ib;>6|g{p*Nqk__s6W6%IV={TBlKKasfatLg(k(Z9@Nlis&wX~o!CN;ElF=}m(R
z66A!EYz%`cyQ!)}z2^JFZNqQWu3+VnW?U;f_T638ZSI#c8$`PaAX9o3T1=9=j1V#U
zDHW?eV33qAkXTkLSw0b|KI&*_n!0nk(Y5VoCe6Irx?=c}M1j-~wA|;i0qgFioESrG
zv{uP_x3>iNlq_<b;|HYG%Ep?UEvhPmMBjNNecJkM8SGbV_h$z$4_kj%L94+8$>@E7
zJQ*!nAoUs1OKtDG7DPmr%Ps=ZxJ?iZaE!3^v53f^^Cg#(9ybQ`y+FLGwFIOmtnj7m
zI%?%*_G^2TqchPVtd6Tp7YX451#Ycv)HVzD=Hi^pa~E1;4<MamqWG`POF%N+p%hy$
z(q$zz-R_e3RPQ`^1MWHSs!)N|ptu}N=rZ~<Sh6b^TmCG%{B~{kjoeP6@IgHhs}^mx
zxNXQ-ywFEo^ZgMjIF0yEW0{<_ck<ECUBXB@o8YRtK)zFWpM776VtIRv(a!qzb#|Z2
zmKQr7>ypV1b{oDVUhwecp2J({8Wq}B-NoPC<@?Ao723FN!yoP{Zs%%xg)2>T!`9z<
zk}&$rj->j!C=CR@-{ZhOPt{htYrtS`RDH0lR|1z0xR^OYi9HpDCKmE72j?VzDWo1S
zAN*lD_?PuN+qm8j*=85NU(%f5y_$#tzbkI4-D6$SbbF6=Ar#()<MOD+1bFL16ICR>
zUY1?oc7NVY?f77x(9r>jB|}FmVX_O2Epin+&<5JUlPOcCP8Ii$dmK*Ao~qw+F#6R}
zueVKX!(=oBWMHuynMXzrgJhYm<2B>LQ5J+_oJ+R|PddgU={V_Wid=cpaUM)O1QWfO
zK$jveFtPH_{*b=cHvWXy-l4I<##-QPR2GM?%FJ7kjm{(6yUl8v*!*YL_PC+ZNtGZ*
z^<7B}RRQ#iwtyIwW56%^WyufM#~i~q-~N3lyf--pyheEjh%i+9z4@-BDN&$X<uwG}
zBG1ajl;WmuItD1QDasGlDloGbu+N=Z$_h`_ZCJ^4yj?kXbeGZoof3YqA(^o46EE4U
zp6{8E>J1X+<rdH!lMej>#3JSb3hrXpyvxDM#av=hRo(Ti(cstZ$9|=>3?oUGvY}Fi
zk<jF)3Z#9dMqg6iZG}4|U$J?X+gT`t4#=xKEtdY{{xW^GftqIOt(~(tZtnM4V_*C`
z?0zSKUnpX7(==3R<cn%4D4s`kb2qkr9WohwZR-!a)Vbi;_e*Plvp|8>erY~b@^D9A
zfrq2I;GlWgFNYt5dxz965u33n>k!eT@w@i*&UY^ekAPHG0u6?(zrS5^BrJI=ycaXX
zXLbeTM8~_TdXwN){71gB2@~Fkm2ibO#*FHW_hWjw5nAdAy3uOYG3=Z45T>e3<9pFQ
zYHH6fB>&{#Y=QSi-4(3YMJcVP`rMOS<@=$48fb>cZfZX;$w38H`>lEL(!-YC1t|gW
zTKrXB7f~}4NB2r}0?FnEYlN=P4YolAR{Nzn;1nnb3CR}Xht`GeA3fe!^=T@o!v(wg
zPyy;&focUPpnc;N)MJTy{y#7IxJ8Gxt?I7rP2Z;U!+l}F*B@oGdEYK1`WI{+t8t<{
z;K#pt+8@|Suzi+KjO(rU9M@g{19ie6&`}vY-POAgbW|`9xoiaE06>8}MV0}I>;zA_
z=}JcG5jZXJG>7t|JrxFrECr(~MK#6kS~z~i2V6krb9HWz;$0xcdHOp@@m`SPT>V|U
z3jH&xCjKq|y?Jrhh|<VUiq8AqcVyK??+2Xu^u+mz&CbfrN5Z`&l4eNjGoueLI``r2
zl^y~Zo84-mZTN1h&^9}6?boJgD_j+Ag{!Crg~_P-$fzpYy1ppPgZ_22SjUf=RLnqa
z$<`GL42jlQ1x7NrHmUivu*n*kqxflh((WrX^WTrgFNvrj&#YBRIz8HD)4&47bSD$-
z?aFzTCK7@d;her_hMw`MWV*54zE&m1LUZfw3We77Xy6VeaGcsoB#{M?T04vJ>ug+i
zBy<*VN8Yad0ET6kBB>Ns@;;PGcK?gq$CWj=^~5=cg|8ls9ol|GVDar30fuJE*N(;$
zAnsllVRwo`oXf}x-9*Lpt^WR@POq2=TJ29gQ3px^Tm{W~f;c~HOE_Znc6(m~*q<kk
z1SHIg{n+(x#3s#1@)C8XjPuV!xk`mqcjWM;OS2Yj+Y<!tM@#+P`PUm4TpjadXVqHH
zY_3e&OYk_Q>lGTh%{G$Z)qP~}QY}Ws1q<Jo5jKz??Fr@(4kP`xcE9;p;^=1rHF>#9
z5u(Yz2P^&9Lw>Nwy0qzhZ=64UMVAa4?XV(5y<Xj`1}{CE*%OoW*dOi24PaZI=`>mN
z8qOM;g6Fdc(k%QwGE;R2-}b4Ns%O84tZwir8Mp9!-}!*>LzZE><yO>>nTI^W5Piz{
zS7R`^$FlzKWq1bRII-~z!cXqpcq1qTo%L@36dUm8L0P+*-(SA^7BC2c7|C^HTJofM
zlriW9j0qZ@^eDOkE<ahKJd2Y@&2Am=n6TF5yYns%J~lya6d)pffG$blZ2&XB`If+!
zc7X$O%u|PUOX)WF7K{CGmoHEaTW{69YWPwN=o85F|2$#(*Y;v&{<!IH!yA~A84L=e
zOiG#&$V@-P!uKnTbQ5~Ji)=<K7<1jiS|hrGvo9pQ+(Y;GRr~HfH(gjLtSxqQX+l`&
z3h;>nBr+;{A$=_ztUo<Km|&(qMRxi3_?L6uN}aW-I?$GwzZ{jDuCy%M6R9Bd)jdRC
zM)FPBz{_h1=9#sws@k1lF{<|21xZ$|g*L*Z6|LJM8GR*=mR{-`&Pfy{UY(kdbli&`
zRlBm(QPoSG1br!thvK9<H16yozeq;ma!JzG1nHtMZ~BQ8Fnj<ztlWNVHFIRoo7%!t
z0_OWgg=I&~b&DQsqt8wWHclpVQ^@q%m4%L~qzkRv2--C!4qkZ=O%lBF+|I=^;zwit
z>6%%FUGi~Hx<=6%QMJ1Lun0_pMa~7Aq#XC9J9?RQkXC!;xxNh<RDUhz2o7syym8*w
zfi98>UjD(sIeemFI)gh1>$-RUIx)}noD}KXXy{;rmA|TWD|>kyL%MsnS~n{}nlxvG
zG`Gl^@zBoY&){_QR8pk(#giV}^;|MzUAH0k(clN#6!|D>6@?)yeackC`Rg`~(YH;V
zCuW>vtNhi?0Gz|Yce`2^C>F*`leAh%1nu%xlA88o6MJ}gaxC0h2mKy(xGT%bB`#RD
zZe>Z6BsTJ5jY%@YrCY7Yjd85jx6o1T;$xFohHUqfgs{PYosIeNr_TqJG}#4Q4A$@s
zA1c_D5-7N6N|m07HF>45FT_oEzO;F9Vfq2<G|onjpzeio-|i!u-yJ5rs@1v>Dnr-3
z5D=im-sA1ML2$r5LBqD{=Eat4@tZU~6Ho6fl`q1De$1X3*L*ZGbbU@;60_IWP~LgK
zy%CMmuI?~_j@_K>E}2-hlIYV8QE1eR>**<vJ51E;d;{nyUL~bXcW-v*qa0KL@L88e
zsyx3kcIWhloqD24Pv0Gq>ALcsqLkcUNQ{G@C{pKJ(iFqU5I9xqTjHqJoo}sC^q|dT
zQF8FZMg_R$NWgx&OSe^#Tfwo~m7BYtSha3Fqz3LOaGkq>>)e-a*SZzn@OwWxiO`*#
z!F`W9$^DmG_pK<)k(vVABU|@rb_<B*>EbofqO(+(mgYXYX5<_O#=1KO6_Jc${6*OD
z8_r>*fYnsJp5Cv>*&KLVQp@Y9ZqoABMH|RNhJ!zBz#2salGi0u6uffelFmMs%b>f;
zhI0>k>rLK0vH~tV4|;`j`^uJ=I$r2Hen?Vl<Wh5+$?>rD6p7Z*K9GqSdeS(eNWqGT
z@`vHxV)W3x!vgbNn}Z_y4oIki%M~%}$KSpVypN8T14j(TtZOm-4Y7X{K4&BiK%G;P
z0FU24U2Qs;>um-r^@{+9kq2SD5Cnf6Pk?+VQy3xT^?umiJ#2U7kW^HJW)!VFmv&st
zrZar&d*!`$)9%RieSXn+u`R6uc4Y0I!@l&`Ug5_kQe85CA{W)V?o|iYg8}jV(v#7l
zcXKx1meo4Z-=X}vXp^FvJCF}Ju%yutFf@K#assaC4*UIO*~&s#tG^kn%S+A-=rl95
z`{JI5ykYw(;2hiUpLGAN{WYaW;Jzlp*Skh{H)OhM?Uu7jzEM}5rl?Ptv!ryYP(w#c
z=JCNxO)&>vxA$4C?2@TN3KJ&y)R0WGoBW!vrZsmQ$i5UL`{d!3$|s?}Vg{=JJdf2C
z+6E3$`V<kqHITAq^a)P;%ca2w!OulAcXhQy&(HnM48?vW_BJTU7R3y|#HV)qNV>>3
z`m>E#3HqghtGhz7Clj<u5tkF@$vis{EKAfEE#gwV0jt5)`(u#@5X+x}oz8xC`=`-k
z`conHWGA6@VRU#$-wPX#b^ZO74^5<gvHq~TfTvYJJ000~purxJ3FuzMwKo6ZB8YO{
z1AXiN_U;>sort&?7A!<|rlkPLS~0K(dmxcB3iR8Z*H?Iao-51eSSZEUb*=39f^+YQ
zag}lT!D8|ZFsRX^jQ^5?UAMP@4$XZ6>?S7nyB=nCYE1S5W3TS~glYdvlfv_sg5NZg
zsd4k-hJvpt=-eSVjm&!e7ZrT#XndZdM0NFa{4V7`2EP#9oXdt>27@GaspV4B<afsR
zJy|)nNv&ZPX`ivY^Y=^5#g4F*OM>SeSWj^~SGDIbaIKr#eNrxm|L(nwdSz~EKWe@3
z$^F!mm2>8MCZ>8REzDKxUV7z0bo@zGb<#F$vU%0u$_f<yIf(gown(8P#A}JF3d|(+
ziepN{*Hrtq1L=HN`i|vY^uW?pwMz!0BC|-N&+cm=Qh*Aq_Sv1@)|I!J8hHt<SZ_gR
z4G<HmU4Kvs-e8S#hx|PFm$`p8%}SaaI*>yJB0vnGC8vYN64p$W$T56=cg29;q901S
z4cB)nlwU)EonR7*CY`p~&b8Rx&VeU~LQg@Soq1vFV_GkKcRzbBcqOk2?ws-KgF+Xv
zYFyXxp(P2=Hr^h0pk0GV&H@AQdb#kH0R9W7;t(~3Y1X>8Z;UG13#wQud{X|-&#p}F
zjYC`oD?X&$-(bu0d}G`L<1)M&{LdevH*?!DcNO@Joi)0zjm{q_Qr&GGH?ah7u@Cus
zK;!%SWpH0E1AEP^)i=A(K7maPMp{(F&hJ~h2mDs!io98Y>0(+xnR3WIG>K^cqvhy>
zygX<-`ym%lIwE!-q{xDU26ZL%rXvp&L>j+e3iYI8u{ngK%eb&}=>8iV|Dox9YnU^x
zEj{vVktdq=A8vl}>~@}Qda-b()``c+Ql<Y;D&G!X9%QqEQaoXfPF^PZ%aRGBR<<j6
z1v<<(0-fQyql(zKSzb$d&x06&0g0Nhf<+YJTuzy1kyuZeXK5m*Y-dVv)SP4=BT}@n
ztNsRCV^<Xt+1;Q@m~FB!BwXrCu)_S;D{nfo^4wRnpJGSnJP|k%rtW=??aX||xyPwq
zGy9NzO-ji_|M%@TD&X=K<2>)_Ia)>=x)+6nr&jr|Y)P|TYfQRuboWBgBk`W?D^))K
zs0DJKaf7&b>P)_C$3FB-Iecx!pE{yzk9m>O3$9F)exo78GF;{0>{GYCJT%Jljm9>X
zSH4Cp>(#kuVoq5ZuPCCA)olIRI;RTnJ~pf1RJvMAO4t4&5${tOY7ZV57_G?5EAPe@
zHPO{wdo0qe<HD6`sTCP>wvn*}QReaeHR2&-H71pL_yy0SiKALSgyveBt|f2Yo<&j4
z@T!>`JW#&F(zq^8v1o<MlkN2KR6e$vcH%Q1di1+323w_mKyeK30fn4LQ8y<~`i{nq
zD(NVV<f_!Q<Su)mt;Z-H!j{MOdc=Kzi?tf^9TtXl%|6gbU1q%OK@&<=7w|0GP21I}
z4QCdV^ez{9DJ%ZMVl;O6`KxB*wZ|TLq<IcdrQ@%y7}Sfuu!2v&JC0qgdCwswhP2Az
zK@4g2z1cP%fhjBRdHSZTy7%E^`JBA0jOWeQv(n?4_fMJ~;d|=;B?#VF&BjFTy!dM;
z({pF;Du8QMPt<BowzRp;88YAWpy#=O1w=Kr*lSichm+f;SSjR9U8Ym8c~h;iVV%6a
zd<G#QPsE|{j`KH@5KVq|>RDZ@wNa(df(M+0i?l2^MCD)I3JTfC=9P*Wo=5XU9a`=_
zC~um*Qs3BG*<LZ-Gbt|<hQ<|YiIF}@s7XR$C5vhbsF)2!-|<kSoFD+Yr~SU6%dMif
zoB0RD`_{~Fa0*)Vx;b&AMOb}$ymFD3hlJWm9UYq0vBTElJBpZi$<?y5M85heLW~v3
z6(^(xgY><Py0$N{tbCek8E>7$gh7P$Xi!5H!OjZ?N$A3$LT^~<Dy(F8;;?n|;S*-?
z4sZtneZFPw6<atu;KX++0mWL&m>AA!c4_)cm>Y8t=EmxE&)I(tuMaC2_`nLa=vhv|
zv*@$nS;*)%jW9G9J&O^#jgN=8RXZA#VKiW?{X|EER-19yI_V%w4==f+^}v1Bf@oTq
z)=XUiBCV-|*i7g_+1ns_OQrdD-v&$6@cFIh0+CCSHkEx>9(t?U?jY|rjYjAoiQ<K~
zk&OtN+4SH#+xweKMGB@8ReBgUIO}4Tg1B@`ldpx7o#{mhqC^iv0CippK3#5Bzp>px
zuHzar{is*hUG_5D%E0;iuKuyMn5D0*nM+SVqy0tjaTM}aG&@5{q7Q71xk&utHpHD)
zwu8j5h<2}_Y5Ql{J=wZPM$B@<FAwwhU{(yZb?IGpM$VQ+-jqES&37~5X%9WlJu6CG
z8`X+k-l0UkeALs*$;$NNRPOT~hKH8mJ~Y<((=XAlHhK0Jr+-Z#CtsvzyD}vu5cB~{
zeGx0NvuEnaBKu>6<1aqXbn-|N-u2D9q4`<cj)9%hFc#j2#6tM#hwm|AY5i(=AGbx|
zeku#mOS;Dt8=<KBxWa2Z<pHnJGYUPqeCw&dIIq!5?x^&wZ*JOkx_lOYnU<yBFLU7q
zqXnCn4M99RKrRLnHkxv$WL_Eb+2*{7w)6?#d=a}qyD^q@L;gt*d2vJiY6E48SCqF^
z^KFrC@nAjpO>z$NIynAu@-A`?S{<8?lE++yeb&ao`-zoLn@Ut&sG~~L@NpHuIoxA%
ztea~^8e+ItuCOZ1$#u}6rb!T0d(f~B(oCPVZo?)=$>C{VG{8m%Lu?AZb@x$5;n<xA
z2k{_;Ri3=qdiUXr#Ti94Gn?}LKlhKC5AD=K&7Sxy32K@Q(UPO1O|xkyT_L>tlqUXj
zj|(n=$ztFYJjo;p!>T4AqIN_?rm(v`$N{q)NW~Mao@i<u69|Do1wy#hguXF>M_{V<
zl{=0t8d@M=M3=Rzthp(@;3g};@G#w7hZaKzVn9<Q(UjZcs|%skJ;^{|9LBMp)Z?rj
zh9}I0n>2JfCXd{@z|8|jS#f~EBI({0c!i&uMn|7YlZq<{@3`mkET1CayI<}@7u#O>
z?ZH^RzQu3ztr36tPdCSw1?n!u2DO@ZXrUJngI)mkh(Fz}gxVtf_fzYHpm$Y7pv2IF
zrHPrTy!6KQlpA`%BYX1saDvko-8y({nH=X+@Kv3T1?3bes<AeWfC|Zp;^$`Ru947z
zUi&5RPovC8%-3;4qe~C5wBlRivLfk?aal2_fZ9#`%62vbAJ@+29EEmI{>*@?CLe33
z+o-^5nJAz>6|@4m_J>hVHjN$6i`XLf<d)egm!rx;l(*$KL-$HQ$v;T--5ht28kCOf
zs0<LMG~(mD$VMufsr1K3vh1iXQZxda<bW6UCL5`0rqCZpayyr^N!Uo;k(>lCvioU`
z2<nauzK)u0!jx~<#uu(Li9u_<dplrTkDWHGC;lW>^a48VSxAg@>+n>e`J==8wTv^W
zntX{)k@Uy3EOFC|GDHb#D{E!}ljSBZ?MW^nXpUdLi5D(p&2Gxq>8Nf=wGJ5y9cajV
z?q8Kn=Z7iA(`m~&{w_G{cD4>4_9qEVW}(SGXl;03FqtHgx}7?ZwDYcpIAnlX`90Y5
z{C$Oi;EBZsOP}1b#Z!O8$eWQnZL~W`f;n2&ot6HZb_N~sF&O%`4{im@4&`V-aW>uC
zqS?+Akt!94SgJ>7h(O7u1KC@dHvAK1i{KSbd5E&KtW865WEL_!3@=ck*{Rt^$`sG2
zenDEG^Y{lTR!1KKe}=-8TnW(wpHg%MO-GG}LbY6Q4qmRZ+#<ot_3!3@b+cWRw{^2s
zls6HI!$k2qCJ>IitN@WvZPM1uo?~Ch(wf;*IJ2OZsfQ=X1MLy2tCa1$T;*`dB0zh|
z9v<Rq1|Y5MqWU-Do~Ay9++>J2={ufETvjA$mz!>J#}U3FvvIbY2<_J!R4K=Jxq_$^
znSKb?VOupPjjvez)ch`KG6P}TG~-Ph%taNs)IOQu;IVl07H-{~!x2jW(Wo5L-)CDo
zR)55x()ZS<mJh?r=C7ZHSkd2XK#DjQF$5lO$<B;*{E1`1^ZdkJCf_g30q4+80)~eQ
ztoBQ@C&%MxF#-<7cxZM!5OGWSV=O_JV`e!!&_XWaz=JDe4{zS>5M1l~l1cGP$ih=w
zOYU|ob9i6nALbo&<c)4eo9oaPVIP*kRqM5|iB&aWXDbjTI1DO5lZL7)97ZcXZVS1@
z#tCP7(TKLZom3zpUD@P2mqzGny1r~{&mpaoz;P9GwBo6I7$fOlV8<GZqYU1yv^%GU
zrBtVmTF2sA7jJ9(aQ*I!xgYaq0iVDa%Fn#yCr&d&(DXpWfKdci^B{MBUpn+HC$dZ{
z+IXYGl4AEv^4LD<Cs1?2sbhqM3as{bvp=2wG?$BeuxvR+J3S4~zEO4;7M#7wq9$V9
z$*~cihl&9p+a)Hnl#ZE5_WLEW!V_svQ_s4)g4BKd7iR>M^aYsWVuPDd3@~ls@5x+k
z!D>Rq!StRcP;r*kBfUfLqL$^*RN8FkkIy5~@u*vz_<Dm!W0&wPNL>)I51+gK+wh(t
zNnx%=f)Oi-(jf`MmL?F?zmxGanoS4E2Io-B62Yf~i~D|e=LsifhCwm9Psskzp*@;2
zCe|v)D{LdnPhP8gB`$PD*))+U5t<@Z>*H)s4Q*!ZIjEC4U$1Cb@l=c8#`$hiG@ByU
zD!f8{lYuHl%~X3(^rIbBR+yMdKOTxt;pj-y)J&%zR<3Vau4-4ra^iMrnodtpu4`JZ
zf-hoSLw)`)N*!vO(gH4{(hLkS%ff)=)KdQp4KH%T&2ZL?Xj<oiSC!k+7raNO<cLhu
z3p$rS1HL(wzUS;=)#>j%n9D6T1yM`cyY7w77M3NVYH2zu+w_OXnxz@2y2$KXEJYt5
zXBBVlL;waL+2ScK9V;83WmPPPQ_rqZ)|AwhC88lKt>TGJYHm8%5JNOJ3MMtjz$FEV
zo}&A2GDebif-{>BK6<dhpla!p@U82nP^_kXi%G2`2lrZ55-5D28cU(^#E=g5X^VJb
zGY*!qY4(&bjF3H)B?Pxj$f|*H1^mPW3%|`cBV2(Dsu7)3o8818iNmfn;$0*<SvI>#
zJi-^tLRU}laM;j3&6ywH2o^5_AO<`G{~G4Z_0MIrFN`%Ec+YPv;`>~XMt^s9taGtL
z1a;v1z}=kZ#{3=E61P``HhnP->^!0wXzgSfw?X1j%uBdS_Ej08s1|goPITo$R{|QP
z8h1JLz|dc7f-<tdS8a=XIb?owWK>h}iWVBGf}V<q3YF%M`^->$e;SJKpV>VWgoLxW
z90WQ9MDenf8l6J$dxFtVq+9q|JIzItBv2P0);098_e%Hy;ii0xp&&zkpnVhCzzct2
z^bR6GPq0D5ac-ul(55L6{T9*E(K1q$0=zF;)FG>ca9*gmD=urswmrLHgH&7W&dc55
zRy5|>&u0|6H$oNfxLKA+l@PwJWgYU4oPChZPM`KTHJd)|>C!JjYo&b1b(;dH5^>jr
zSS+uMbUjo1fu}w*&z{VHTImJUnQ1&^DqV&bK1o;ad=$wh6<szi!}C8q@ao0+eCeJi
zFd41wH<MVHN9iGG8q4%##%G-X4GK;dr75>d(uQ)zn(%h`Tj0nrXZEQI`Ynr|4nNQv
z{UihQBjh8ff8ffWthIq3qly0GsS@z}>hZ-xKSBmxf<ejOp|pN&mRV^Rt769MTTi9o
z>PqyooN2A2yc&92sc62;PZ#5|*1=YL7p6c>M%ef&Cuy9YTkNutJwE&rf{GC6-jhTc
z-apVk#5rMKc}2@Io<Q-Utig$j>c(XypLOrM+*slb?EnQgY2t<`S?eS(@>zT~&^9rJ
zewcvB8n=cj8;2-bLXAzr(}2Fwpr-=~E=4TyiHqXcMKLzp@;XZ70Uy(&zG;;e3q_{9
zphbu|biD61d=j{}og{~})I&T)8iaWy9aI6HE~|_07?uX9Db7=#4--KZe)IiIC`tHP
z{!$>Zp9X{80CHG)T<<-Eq%C*eY&IJ+S%J&OmA=vuxihNx^=0MS=g9(T;;vTTS62Y{
z06m!FeXN~?sqSc9e)LF{$d1s#|H)*zim&q|7ZT1_HGOIB`b(RmBa1uUPGaybd5{ZN
zL!0d?vCf0MmFRSs-e`1}wde$`Y+pm=4x<zIK7Qsj<~<KI-x;*u-^Htan1(is32c^Z
zI2)a`cjSr>f7~I_Nb##f9d#!{j)^qHWyOj#(6~kNe`$6<_pi@3Tby1*DGSRS8P<FO
z%@Sn_p}J@R&Bg#sCJh6f>D=PCCgTL*9oHNKTw<&A)7T{NiB7Ald@j(ZXLs2>JgT8t
zL42Klb&)}nIc8>-G1Co-Fa8D2G$dODaDUum%89Qts0LHHMkIbJQD&iz0PZ++O28~n
z3vQ?SLLD34NLZ?O$G{8BejPc&3eRNawmXnMZ~BWf7C#M4c~EYrfTtK2V#4YQ-zGqI
z6ah@{CuM8XF_9D6z@vV#5+*e_|AXj%J7|VD+M?HSbC90!cKFQ5XU(e_I}ye3ED#2&
zapET%C~;Yv3^_l&nTQzpy2b@%v1+5NXyX2!!9`_v*$rzL8QJujn5;NzT1X=61m;da
z;?@)l{BLUnkX3HwWNjKRK~(QSZ=je3ucf8Qa{+B-2k8j@PYPL|a2{JBg(|B`o7X`~
z!b|q(*x{0?vT8I?$PYbEJ!?&%v^AllgCYG92WINaIYXD<OmQLI68m#T*wMe>pIrmn
zlwI@BCSUNo_`@<k*{xIp<uKT@JPP|;dHvm3<Qct~om|zFZhH;Byob(jl?om$cer&&
znIIgx(H{usUu@0E(+A_S{yK;M$@WCH@c;f8R0%@_wz~yBp33aBic$Mr{H5|Yr}Fb@
zrN3tP+7l5c(x7Re!e*lOdsATIssI{%t{WK{ovF4VpA28OoN>QD>WcA|X~bh3ooU1z
zj*b+!#%nUdCHj((YX_o%I6nivr{6Z8qAPHsUnn{SotEyoS?x^`#r~<v=X1H+LUtPZ
zr(REFEdn=IeY2R$+9>KJ*y=eVTvaTN3M0n%0(&a)M{U|!qhDr=;OA}Q?URFOryc)`
z(})q@^ou{1_Bhl-Xb_Ln7Y|rbCs{mp$KPVcoHmQaeC*4ohBBY_aICei!nOxGg}o=f
z?m-jKDQrlf(;h^p;~Ua~+c~jI#bKB3+}z2IcMi%3qP)GeZBt5UAh>P}1OvaOMRyw3
zh$s#b&U;0HH%?|Dc;o&&>9N(K*>B(nXi8jHoL`Zu6+|j!zSlk%_^6UJ+o$cV6C=Yj
zss?_8Jo?c-u0Q}MJ@l2&dq#PiwOxtEl-21#J!ShtL-0J87Vwl%iT{DUbk3&T=CPll
z@|$Lnw5P)hiy_+wpsON~C$Dk)10cX-L;wN)DZ)G4usdWRcJ*4>o_)X$!ZbG%-o4MS
z%{CG@)T%ZRH=I{(Ai=Hu$7bK+q5fTIPPi3F8iLA;_Mj$GfUU*7L1ZFz7!#Q>NMx>{
zw(8R6ulxu(%yKwd)&<qkyt4;SF{ajE4*XHBtDQJbkgd&gzWr<%PIe{ni1a_3q5ne3
zO$3S-7W-13LNnr*T@6XxN-+;Dl5Q!PQ$LM#p2(zun}!->=-nb_R><VprBTm1Hu5NZ
zh;^s|<1{}x*2*TilO~aLYb7{2;>Uj$IPX-E^De5Lbl<vp^>w8jKzr+pmpcnL9D6e6
zxy|{iUX<;8<=cX~8}1EPy*_J1&}?ZEQ>77lIC`k+W95`h@3DS(q?jcykxC(l5NIFc
zGE)*BE`6_gwJ~?G<5ykw2z?|-`pFyHxQ9oLu^GAa#+WQC(+mk>EY%pT<!^&i?_eLn
zuSBazZzC_{Ej`nS16XT_u*2u%p4QpKe5`PtOL?a{{d={tdSuz~$&rosM>o|Y2MY45
znC>zgVoKl3mj?R}sK^FUQTrTJwVW~0aYSicG5}u(0tYV_kZy@$0fkIDq9N1c35(5y
z#Xvr+Fl|7s1fDpU+rt5ets{g4HSq&p#Y-QAZ{2oF2-JLY+}y40Ee%0KozlqlDMd}=
zC#rI5t#x8xolU3Na2Q)N9X!Y+aYGNV0Q)&z(UKqYH-aevJ_55g*4QlJiROS+a||8)
zFOl@)1^G;t4ql-UJgDiYh85$@1&D}<_$m6#d8`9t3GQJJ_;a=&oU%=qFC(#>qHfy#
z+)$`k@QPNJ*<y#O1wz0z8HYNho72S&>zWKyD5-RBn`SlBhRCcH)HHNeXCY#};34xO
zpAt8$Zz@`b@ok(#5o=&*h|_C-?JBm;F%BdCp<44M@bR^x$*mjk`xjr!f#9uj4DFAe
zK=_)&Zt+uw&!d%ReSZ^ndSr*zfbn7a>%v$Uq_V-&yGp=IC{(6YHF<*9n4^PvOA;N5
z3Dq>@YuX|Kz9Tv00TLjpRnx4KYMHZ!%q8SqkU!}$6?v@m!5!tYLBcS_10*c3iFun`
zaF9Q77CWP{GR=ZHXK=g7(F_566s~aB*bCeFfveYgxf)9ts#T+C4!El@H&coSxQdax
z>L*`RYw4W-!Mg>b6uH18<-zwO%Jq^#t<fF6ucN^S(K%(i`dt#?UQ?5<y7G0g9~V3~
zMn7rd-VGYG*%LP(4cz>zdkcB6F;`UZr-1qeiClLxPwW@PW(k>gHy1sFy`qTr9JcX*
znkQ;Q5163KB2TTSa=WwLViKf<g)0Np_}vcI{XP3ngm&7W1$ySHIY0vty=YwH`NE(W
z={EEZxTu68A%D{nS4G;))0W01*5B7}U)SO(Pb5&Y#@5J!D5ZKBc~jbUogP_IZ{LCN
zy(p)$-kVdQKV#F<m`}`zS$ynI9vWk$S>&~}R!77JI1iZ+J>u~ONyHnhJJ>g4vaTfB
zH+P)#_?=}04__K-k=_7wtvky>sKehcg<2Y9tPX@b&QDBxO0-~M#H)bw@K!I)z+bn6
zeG3t80DZl73TzuyWbpy$D^k4umATKykN{FK#zO*-WbPcWhO(jkv09JLA@&i&Kr#fr
z?m;e5gOg*%clCq~hUjX18c%Q=P>ugVy+k|(bWY$%4cYLnWNnVga^EimyW<BU@YgXA
z1j;PbRlgbiDBSzPEsaBpSEDVej=J9vJsmYr1G<U=rm14=sc0s!ElgAOCK-({J+RGn
z{MHQ<|B+K~2M5ekk*b4DH`o<AB#wEokdFM5ssmCV)ZT+xDb%z~t7cFwxo3iJ6b>E8
zyw@};%bX_p_1l~i)_%lhVN*YjucRqhL^9OYb_&EVkYy$ce)Rup|0yXt@I>YBmg4mR
zTYGLq<}k7O9Of~dDhJ>BHeNUV?a15)oRNh4t)mAs?rW8&j|`tFM~w3Tcz7hKt+KfC
zJ**R!g-?MEn_<x=WOT9vu_yB&dtcGuTCe|ZkU|t_H7;Q|33x#a-KZ1-2;kOkCvCm*
zW|65WI4HT`oiw}Vr~O@WqRR0SqKlb*)S|DKqdWcKF33TSv9R{UtT@EJ2-OBdMk}KD
zkxRT#hA1O1i@22c;*2lgTry1dkRM4`m6yfrK#&ApuD~Aam~Ikq1v3+UiQtKUj4aNJ
z1^Dz@=B97GtQjY0tRFwlLc%9XB0xLk)Gh*~iS3|#S|-wUkT%V|_~IhPi}H0%I|kl>
zF}JrEQ{>RUR32F}KCYNjSQtCG4THR*YK$kYpXy#55{mXqjuIn(X~(srTtzttbYM^w
zH72w~Sf`8gda=E^RWl&wJN3ljOq5ymn`4F+qzReVs!YGCr~F55*y8!RfmTkxi~Ulh
zGMIMkSY6Cg@;T-<te5fNCB!gfD@MV;l`6>6Leqd|H70Zff1YOW`&xgi5TSEvkSfjl
zDteyh;V0pRtG1{LF34Iwg*0Mc;nRDfNH4>=7--JA>`XU18jHY;OL?#lZbnVmgL5Zr
zfS>HaG9Cc}!QboWR6C=^4z++6Yt#K_3tra%T7^rZyvc)hpxptoG>&E@MC<+5b#f2U
z1M$7GbBpR=!y!Qr1+ejoC{PAwmj7iAdV+)@7BR(Y9^~L*^Pv&vDt4;1A_VU`n!3p0
z8^KM7!gv~3=oJ-M4T=x~<u(c)Vi82FfaW4}S%-E8OlNdJ1ONr`m%P+RN8_&%Uj;=-
zFLxe!u{0$7{_NTOd)A79|Fx<~3`JDku7Z`Zp|8#7AFatDBOMeu;Rz|8UHPxESYEWG
z`54_DJIMvUI@7-K%9y9x)f4VhqF>gFT>--V-|b#35+pYsN``<F2cuf-DL^Ds)5;-;
z$qlvs<Z_Cnk4*iB{viiF<f5{*kEcZXj@5jadis{?^x;FdOhP?8>|3(Mtyruq2{jf=
zWN`MJQ*{2r%IS3PlZ?46R+4z1xq<0)A)?ukcs)5t%T1CNr)zD$-0A+a=;by}m3fpE
z_<5z$y4(SJS5d7dEt}q*9*XDRzBZ2fa@)$5rj4v`XLW8s=-&IB7K>H99Q1B<memv$
zfAxg@vxXMD!AUC0K5xk#t}jJ6rn;u3s~l43`_Ak)wE(~l=U(+AHTEeo7oAkJ5U@Q(
z3%eOtD$auZNOW;>*jaoXuJNM=nn(H*LqpXy>Evr@Ro}2J9}xwRQ?AHY06EFODF@`#
z>!TUq(f0=>yV_~Ddd-r~mjJC=@#2o)Qp(ij%AZK@msNRFI-8{z>Vzh+7Ud~}e<^`d
z-%P#3?#;sio+sge(kyi!S5HcceA<DYAo&itbk8XDw~Is80%`~K$H}MlVJ#t__CE~_
zD@8W^k-1}FgVsf1_Knv;RxEYJ7XNwt>?5-RDWg3FbF|1o)AYovn8)#g>w^JeHTArU
z>?hTfkwclByFLqY^cGcmyISiRL3y~!=YCGiHKF;{^KL)Fo$!z`F%FSGe2t`5?CC2j
zRB)+rlTAcmO0)2vE0$kugQ04>k3|}Lv(CNMk*Ry)@BDeGaR}-3HFoYxtaSsMjJ0Mp
zHJM|;CWv!yaoF+}2M3Ds$I4xc2t8dqRJ4e*=ialU&TrnN#GSZyE%#;cQFip2W`_%V
z&!#(ncH27OA-#L;yiNH&YQ_CW;L5#5J4)xHBax+-^+T4e%*aS?F1;Wx6!7h2s9epH
zBayNTXoRyh@mWrk&jd|Lw;T94)HQmO9-8_TbXhnRqcUxiO82PtbfLW_qO-nc9sj6w
zH$b?!&yaIK2=Eiu5Y9-oh_`m)1HzSn4)yU49CV-&s6(2_8}aiL2#4s5heP5a9OB9g
zhxA;=U&jtRhaiu>8+^$g(!^IOR}2O_SCsNkOi4Qv^)w&?LO1B94p<xoZm3Er#Has{
zj}t&m=RQu<6)o(chvw15u-F0q_LjZsYaR38oTUtl!54hXUMTO=j2)>1XJ@$<5#pmF
zLT-LIZ>MGmgzA}IY+hZRK7u#R-#{~N#S7nSn%8IL#IkP>ZZx0et#BajlQ&156ABIf
z@@v+MAzTKd;_fvmBtAP}y*M;S^j=eXKx-<SRNa`7oCWby0=h#a%|(GY=K_2*P<aZt
zD)P<vhk93uI7C(onD4zBJFsLv1P9ik$cgoMMIFTYI$Tds249ckLhCFg$75Maforo$
zlp!htQ6n0J1vF4t2?r)2#7|J@L>KRi#h19D6BraRa5b!JbgwYXGYd*zAhP{I&$~zu
z$Qhy7pE~_|)ZTtt;XO-H&fQ9}<@auSZO;6Q^EL;7S;)dmKn7Wqg`bU+YL=18c?q!f
z9*G0=!WUO;s`Bo>sW+}z10q~*3u!6fi^Hk2Sgqd{hwK8t(?QVF`HTIO$lD>DifqKx
zdtf7K0^753GBE8fUFLR*?!DY;0gHuPH+&X&oCP!g@Lkqe{XNmh7m9k~ANkmy&7b%{
z*gzJ1z2Ma*AUj0J6kO$z^pZE<*hlRvL41`VHwNG@3RwbV@ba`Pf{_KV3Isn;N4{{d
zq(UX6>zLsAMc@Rik01{#VNQ31NN`fC?m#G(Z+kGzAD}^Ly4M70BkO&p%@aY{H2WGm
z{Pz{NL9pho^C#oiEeiOR^-K|*wYRGVEyV!5hb!dM;H)~41}i7$C~sv=<Vuo0?s1Ac
zOx@cRPdhIHfs<4Z6?}?;|J~0a1KrM11iN}B)<#zq<CL|kqrkXhnjOr_NHx`)Di=9b
zdGWE$l_QI~adFYpaYCtt;R~!8_N3j*BzV9Heqz^C&WJPkjkp~OX7|l?_$wOK1vBrn
zt{i1WPBQN%;~XZ-SWaw~%1;o5qAu_f%#X{;EP^DfDcFPbj+P0DB?T26KAhz`{NDH*
zQ}gPg*V1<<fv+a7IoX}ncB%Lu1wL{lS!YHC|KuSCO*<7Kyg=5v;6{=mA)<4NIAke4
zi9I+1X@L!VT00f5GS?;VH$OnRYX%{5g60EMV6~r{>G#d8<EVP+>xvHnipBj1=Eg~;
zwjvkI3F;HT!yr!)6yS&F6}%>6q-Sj|SbK5BEX;-EPdI;(N(CX0Qs81DjB3{4`np`_
zDc8pceB9x=eyM+Z(@lW8>F^`$%xqIF=i+HOE38eC8i$lfh}B!80;^4G4j^UJ8!56-
zWYdj$5TZv4&D9^*ColcQ9?H`}KB!QIGzvuWA1&+Q<h=q|9sFbPrMV$9O2+OCzg{M4
zCoV?g?42FR^%()7APAN>3Zo2iY_$IwC^0keYx1Ga1ebR9{L^pj7w}*CQCArNj((pC
zgxA8NC4oc#Fj*F7%>!M`#SgAPCa=eon6nG}`93a7m(n!fc<boP!(nP8-_PMGGaQdu
zgaH5Qcwxv7%p#$P6$L({roiG9p#Nq~(}p8lcM&+=LC^dbACd<08C7kQq*Md)s~WId
zWntk%ubp67;Jn~ty1%^Hp$?LF5cH(aP;|6_PP5mXw)8tw#eL|&z*rvUAX3VJcnBbn
zc)l>Gfu4-{i;$|z*eV4`E<hjgG)82ml_JF#Bb>G~;A@*4ob*R3Hl`ecvw&x-md_;4
zL0^8uvRLPuCyy**F$>H2bwpLdZ`^&IQ-c<TunccrVh_do7c^9n6w%TE^jfQ^65|%I
z_zo#gxO0G4&80<gp-g@O*<kuja{c@~G^{)r%hv=Z?`it_X5DDK_cX!CnNBLVE+r0T
zmLm(Ly;GXYHQ<gjeu867MoX2uBbL&Ye*j<&KYO+?zDfr++m85ZyAHRQ)CAv%t^7bT
z)po8l5U=%mUqVUf)9}JY7AsyP@ki>{Zod9y!?3~UwE`7aN>04iF>B5^Au{UkcX^R{
zb4E~&X>-Q1mi*-%;?&lNX9v83zUBi8$;t_DdQqK502C4eC<Qmi9~P&&*yF4Lyo4c^
zBoSgM4MQx&A-EGepyy~_767&#i}Po7?Az|Q;KY}?<3~OXyy^r*^P4AIsy~SyP)^FG
z-;V<a7*GvXNKDkAd2_;Jin&c0lbh5z6(eS;2p1l8Q7gK%`+HC3+2?`vXG?e%)41)l
zV3KLY*aHzJEQA7YCpyLX;mFKxoWowPsdGdm&4+udwdQw_5++d9k2hhUX|M+|CR3)D
z?p*A5iM&0H2CS_FgD(9$I;kTbP|z-_wB=|;KvRRuJ)7RY?=pF8f%mwnX(maWvu!+v
za^5Ur=<*RU3sr@nE$^3g6jt01yC!`afL@D6W@iFoQ3Av*AQYJ_wiHO@3;;r+0;~OV
zvlEHx5G1P441HrS0FT4(IMJVBqnBo*_z4`n@2Q-3@B8h{4k<g9$dirdN@fK<lty^e
zM8us;Jjm539?C=bA^`*RmHCI@KLK~S#^N~M;BSx3fa*I0EdaE^PqhCoItoMJW9Pp+
zR=pU_xJK099bqo~_`dha&^A_d-t&NZ%lJvNOa=mYTmTb<zx$#75wY<5z2PUw;YOG&
zNZ9F^0vJbe|N7|=8Bm$JdiIeA2P;?Hr6%qe!no0|1}gk0-Y=hww3v=I9ts(7ZTkP(
zG+><R>im`iOf%Udl-O*4T?xKmSK}o9YF&BH40IT?W{&u$%9POb(4`w@_k8=hf1r`4
z7^SCr$m11|?t|6-x2Dn!hkeC@tJlu%S#p`&rSrNdp&{p=0(66dv@pOTiNa}dV84hL
zsY1dV<)Gye%B`bzj^<?%oD*l;+0qDP4|saO#2ZxmT5&=4fV^)Tq?gaBuL`Ws24o+p
zxO<pBVgPEY4oYA64R`M{jkes!6=(&Eb#5IPSkfSe@&WFIAq1d4BA>>Hr?cut+Z#by
z!xD(#Q!)3KQ^$@k*|k^iz_gc3lCqy}E<!MYIr|n<zaHm+TD(M<D&=wmbO9{8;6W2S
z9fm*z*x|p^?xwz@Ay%f{Ta30*1Oa4VieQQ0JL3Wn#;G}%{x~LUxPxump+pBwdX2b<
zZ<o=VIj1B}yPmv7n7(kcd-uf|S6Z-O(s&%{?4BnOeVh<~*w$ct1!-9gP-Py-<bMAT
zPBf-w`~B@y;?>4|OxDe>wj=M-&n_kpiM~w0Uq02Bn1W)m_R_D0?W?Cqo63DB^!L0f
zGV2CNv@}xvcpe^}%vBg%Rs4TKEc~NxdyuXKND4UL7kBWv^DFoOrH_v8_NgX{U*>MV
zT8`)kxtUBAjDKYo>^Ts?WNbD48OlHTIsfr?Jel4~{aMlNUO=1AH9m1`n0a>Xoqd~0
z^X$Bs5tfl(yG1{e8z3bJ@EHhv#D*vp#~-mWV-(iK(B&=&D$YPqangc8Gjj}H9zzHJ
zEyzIxCI9KVE`pL@>fSr>El=l3V?98T=9~(hbAR+2AZ7P~O$b*50g41@VeoyUV-vPq
zgQI$|l*nr3aw=y5xng5nBk27kaV}pUXX*TiufxrF93C}0xrj2v()&UVR5ei-rx#OZ
zfcXWOM;L52As(=`0N>7&7C$#10aom^1$_8SM8wy2@7JRozQuBy#t~t199z{`YH4&>
zF_b7z#|)*vpa7ED{kJ@rs{jh>h#>78ix4kVMqy)%ac}U3z8uI>kr$Uf<pEJ&{c5=4
z8C783brX;Rsb@t2b<jEVV?dpklrzHKunfbsgX4RPz4)xoaPm3?`4rn!G_AP0oAdP>
z=dEoa0U%b_Ib7Qk9O|G2AS)9qCN)jM?uUg<r~&|2HYt9AGyx2vrA$$)1}`drwXo)9
z+$4~^EUsrm6oy&0gm3<|q|I`*0~7Sz9L}M;Mp;{C=+3;yQGF6t?8(avdTlbKhxk_q
zgu_|_+t|@(0chL;Tn{pV=1y=gBjtDGfv&%FFo_R5A_=JhkN`D_al}xK5duk3l9)>u
zja6=G8mJ0%Eb2mQ9>^TEyoR07sVC0r|Gp?HV!r;ZV2_4|&&OU2q$89d5Awi630jTg
zBK`}MP;(qg$OBKLj^hn~Mp&%HnW^ttHEjxf5o(o8-H-KA)0T_sjqZMZRhLUOJPY$*
z?aIkSTQn2l5+-2ylg-oL(H8yMv^0#h!x<y4$0~K&!o3|&4|)Vm6UJSpygkaQI012F
zP=ID~)t+(k;Auhsp}7I_9UvLA3l!2%+v?Buj3S7^f!|STnDK?IU{G{Ec#~&n?Lh!(
zIGZj1fS3DNLLOhVNZUa@!3TbA%jN_=mhNFdIB`6~4wErw7_4O&l-&%;jD_8tp*3+p
z0RLqxjPH-}bUxTLkU_VvmHiC^GEtf7C(Z(PJO@s0kQ1iqE)h5WHn?3!6nCsr6q4XW
zd!Bc(x{i{&mO>D17WkwjsZ{XBw6hBluKzA_-89lBGK2o1+4JEuC&RY#>2PiI!|g#*
z)Y9qe*NXLQLO}yE5g`JJ6L~|tW;lz5T+Q%qYAkl=591=>Nan*ChWbly92AaN_p~6W
zGaocwWf0krQa8T;MUfgz?_NAqky;s0-y-I?Hj#SfFOCC3Q2m<Fh~*F>jbNN?{%Ngp
z$j#H@zoKP3#7{%{t2hf~JZ+0py~W$ilS1b~3Y&`s&av-5!7id4#dw6&7}7m{L!Tjc
zQjP%vqoEpBOlsnY>!JXfThA27t&o?cDbK40Fp{_HcI9_(&Jcd_G%?nT?_LuK9}$}Z
zXZm?1f88#^ul8t4^#YypuAUHSX`*w~VdQZF9Irf(uU7SPaad`RuS(}%ZilDkicBYp
zANNQoclg(N0A^fq?F5Qb9i-{Xk6j+S(>E_hul<%JU&h0Xdu3dh17^bx&ZFIF2--(k
zy|MB6uC)I~ng0SM)E>MWDo8DLK%`t2J;QYG&LFqOY3*#YkRJdGb#_r4-Ah^U;A2l@
zgj`$%#o>#2F&x~Qd+>HcrKrgApttsSwpT9LI>V!@6L54!-&HE-Y|X4X)5#gjYbTul
z#Njj~7H;=A8ZeM8eWP(@&{7A9fJ;~dDgZmTvGR-0in7YsR%u;aiubibg&nu{7qbfM
zvn#%6-F*2u!EFPs|23N(y$&R?xUi>Ydy3CY8rY%kPICTRX3SZ*ckj{8kx&epk37L<
z{2fcey28R?pJK3i)F+A@y{gTL4hw&30g@h%aP{1DgR*m>T6{e(4TU;tU|#$~gemvM
zV-3IXV#q`QY(M4Ob@&FW!j$E31WUGC*of(dX(9508%-i!@ta-+7=AMWh83fP1zmKX
zc+|BVb>WL4ql<TO2DsVHL;P*B%uZ_%L#{d?p!y%+dZwtu9o_glSc(A%%I<<Z)mT3Q
zu)7JNu84ti_(9DwcmjwW(()IVf_#})wfCLFV0&@qT<a{+b1RxVE_=B11wg(7OrK9P
zev)sI@sxsP8Q@`wUy}vQj2lrt0=UJWAt$&Q$}2#AapZsMDOBvibqK<m=IAMDS%DD)
ztHl9@j8KeVf|GYvQsHweM&*lMC-a-%QC1hMTgGX0UX`J4Q^v8~;8`q-|3JubAMj6;
zE8wSHzfI|}a<cEysg@*)mas%1g~7>GaUl2}*ykl|gT*Vq%2H>u7TFU6=F30H6)ItQ
zWEkdAje{O)JZdt~6URZvUHzdDt&@0K2b<YrI~^O5aYR;%xV?vS79C%NhfJaVKAh>u
zdYfsuUNO6-<&>*kf>&BjTli_yjA;-gLCGc%BvGc|ddM@dtdx~mCGd}exQQl8MnRb=
z1c;rigfUnL9;Loejwbk^EEZl|M?4j+CyT{$&^sC;w`1PL7;ql7s^P6ZR1{u(uKds<
zj5Ji(U2&zyFVQ02rWsePiF2^<n@jtMFQz~(#6O3AQ1)<^1gzdDL|KDRKM2^HrxKJF
zs13B+XnVUl;j;~ND2Q!I(dK!(uENhd?xC-G-Z`o!GHWI3T<Pt45C3PXhrSBxbj0-+
ziVR_(1P^rV*o9gWJG{_Pg+6V@f~+d#7ca*`sv*P<3C)8oF87!sF2|y%2&ax=jexVi
z{dd$l72#PCmRnxdl!slf6G12%1ZW>exfh|uy3L!ODUq)^bMhH`fy0M?K8oM}_rcij
z`H1N7XYs!f0t%GqUcHSjPs08c%`^@O2bl1Yzk$9Oq`ZG47AHxS*^Fd$|0Zs00!x)b
zHO3(27-XO^5x*b8@3w`3aa7|mfYfx*pH2~}vJejt+Ag*Pa`Xk1UuuambaM5Vnd;3M
zPW87u25#(5feNo6OF$U4pYw3&APE!+#Ty@{lzO%Ga{A9o7yYPx9tCnz3ypPEJr6*H
z^{VGJKw1?@JOTiN0#O%$jSrc!Jvy5cvbHV=3Dq31af+v=$)#u0)nhbtA#zqiAq!<|
z#TyS@d4mqS2P1urG~@l5S;M2+yY|P5qVu|4&pvN7r;ngiZ@{Ze*o;aUV2-ho<E^`$
zg5iID_QQ3z0}`eIgY?}EE56-iGBMe`;y!uV<~R(e25=ULSq!znbO7{CBupltS`Qeb
z+z%~_OwnI`f_bmPV3x&)gZB^Kl^LCm%;MI<wU7|vf&&Neg!F;i6t#FF8*#|cKX%+w
z<zW#NuqT!xYI7Kcin=@y&_s49Pn+~0Cp@K0%-mnZvhScnC<D@C81IcM`?}=#PvdP2
zEe_t6;?!1@RJ<+e&A@a@^a!m*>*0we7GgIuRiKZh#l<lh4FF6EOL(6^DH!cFehsN^
z;5;%m^yk^4dMJ&3l26F5^JrQ-DH=e02oeT|&2R6_tXrlpxJ6Ie(E=agk~tq)#T+z|
zijWXxY(P*z4MZyY;tCE2dpnb|Zy+28|14V8xWDw~WJoE7Fg<gkXM;ch_8$bn5lQdw
z`_{2c>~%nVL)M5eAZsAM43Z7tv(Kjw9|UDmCQ>gqB1F!9VCy$?AN!Uwoq@tKJ(UOq
zBhJl;glLH=I%fcmBS0yTzvnmpo$}0R*yQk_={oXqdKl(WOe@G0b5@>o&;lh7&NE;i
zO}ocDf=@r`0lP0&zIBl}xMb%p!t)cwEqAH#&!E*W(>IXo>yvtCxuSd)XLQ4mWL$v*
zc6@?oR4^wSl3o5j7s2tU-{$3oB>+zl+^|-lr?6lJ)I!z@z{w9%3w0o8)5jHZHi1*2
z`^k$N8dMt)AhFsT+`{N&g#<WR!4?i=z%sL2hlZ{q6SeVvH)N!9;mY(2=WkQSYOY%-
z4%YH%$a#I)ac*qJl{nyHX~9YewOr+2k1`4{;Qb_M78i<TG6BWnwlV%UjkXD}{wy!O
zjGZ-a&Cisx7yGQe*#Pk}ZS!4ALs)=)-nawHR$&mhi4Hd@WJtvenx+q_c+7J-bJ&nX
z#6Qz3NdRX#rN1L@&g?+8G!J3PP#uSJH_n@YTOC0VO83w+BjH*e#^5n;Nww_k{mMa*
zsn>uc1oRdd?GKuKl(<N4Kx?{8;I|VIgp+y%8U9-<qQD10B)m(YQjekJH-MVp{8qXK
zJqq9Y1NUX2NZ@mE+E>4}L6&I~h~%<sUO|jEs%*fZv7|X~YM;9}v@}7^R8%o538mp6
z`*(V*@`I-31iNC^e3L>w2+P@4|MO)ugE0h>0oK);p({zurXRKv-$o9#Y6e6qHvvw%
zW<fvb+v4-(wkV%{xOt!XMga^1RfHXFG0F9nHlkq6b6sETWr1&e`&#bU$=NorLsiDX
zOhDxmhg@K8EI=;v+*s!b6zqNQ>5E%$kUXL~&~;Kvx$HYLVhQfe|6}dV<6`Rn|NqL!
zpi(3)RLWA6B!$wZvPYH+*()uyh}4Btny8c%Qk1mWu1iRh>OztvqRo<~Bw3>g7n(3?
zevj9gnVPa(@6Y%4`)8apbIzGD%{k}wdOjbI`y;s{=8v463Q-UrJ=~3^d>T<CP16i_
zaos&V=5Be!-jq)<Ec^X(6LI?)*nddn0l5b(iRBX*uOQ=9?Y7>!;1>O@x47qvM=q}Y
z-9jFYsDuM5MS961i$w09luA(CGb3Sw$(f4jq<mbbE)RJ2*}mCp*YKj+V|Fn=zmOcY
zZ2iz}@7P=|XRq0QaT5$jn)ElNwYv^TKb&|V>BL;y+vN)z4E-TziDm0JZ@?zT?wo+w
z>FBZ;{f#b5gF9zDjG19Mw%GDsvT#dJvgJGBTFC?K{Q9Cx!;C4fUg??m&&<WVHB}KZ
zt*=#DXWI~WcH_m<-n-;h1}MHuECMH}{M^-QmX-FclTx0VFu%30avea4lRVuZXa3ul
z<D{+agnMXgDzvt5nS7*>$s8rz1W&x<BZX@1ODpADbRIUdUoVu&>T8wg(?p0fGHGAa
z7siyu6-k#_ns5(#k<>K{`ij4T?``4TzGUHZpjaYM{YY|9&0l;nQj)X2Ayo9O)oce!
zucdJkqOG()m_(a2D~lQa*R0aargPY~65=ezh6Cvjg)3k$P0+czfwN8CU=qe!29RVa
zTy_}%jgxTA+>kr5lw!<Eq11F%``=_MTy@P<>_6D`iu^LZKO@QHaSiI|cc9P8X#VqP
zdtj_3F+>nSA`E@6v~Ix|O9WYlMBU*CYD~44Z1xu}cr}U%>q0NCpq*76XOozUD`CJs
zR09qW$(9nf-yNbpq3F6z%wdN{^_h1wy=ARkmgUh08f28HH_b04(LoX*@y}w_1i7wP
zpDqcRvig^rf3tP@;0Kg*_;bc;gY&sTGR5yslGSguPXfya{&?%{#4lWw%pWPDF8G}s
z&{vB=%y*JvNV2H;V?rfQ&An~jj%!Y%`hCrLS(zrZ#@fs;dXh5~p4p#Pt$yPRQZSYF
zuiFgAt%$3ZMLf1f#6BcVthH8hTTn0-RC-2D$(f12%-23JM#`21zq{z(kd3RCX2>E#
z&2G&>Qlk;+@0}RUxXRXMJ;%i^_RjTqDKp&_GM?3&I4;^XFo*#qlv);WG~XU-ZJCxB
zJ%w}KcJ5Xm`gp$_)r=+@0bw=G4Li_2qghfndYrn(3$qd1^7B%)S@tfZrGJ;60FQ?p
z@quWfhwmFhYPJyc9s30D@eE5NXK04_TTna!wEiil$ljC%;3SeF2;~&%I@GFf=}Dlq
zSRV}KXkZvVr0V<7T0mlq9Mt<cs@ERa{jWD_qj|UX3{Wi)@7;f4=H2fuYf4xHDCeCr
z#X9IBo%DbcseP-OM`RtHqXrE(l!h>2;4MIRs4^6l=9Yk?@E7r|3Q&o3;TA5rEuzpV
z5Ruq|pg_gMsfVVHwXylq*goWw#GYVif}e@~r7-~VMrp!kU`3|vCuk(<Fc`AD<{EPw
zDMu`srx>b($KuO(*ZyQE15d9g=K*5|B6PvW1=j^Vp>J2pJAz{SqbtN!p_8fnpzvTt
zIzzjD$Aihd8$%0&$I|!MY-wru6SaTzUe{Nd5t)-N8K5z7Xf`{8S|qla@~#0~_wih_
z>m<?#>E_B7>622uN&$O`3`H}dsdix^KeBh0XCSXELuatekePBb2X(Aws?E6obxL*i
zk4_l(9TivgC{=qW=%w>~r)os#xvX1uClHpN?g|BbG`?N}EnIRvpx`kxLOo|Ay?d=J
zedk)+V|`K67jH0|ARVs$*7bFV=g{*fr()*Z6D-sDesNLs<szOMN?2ja@ubuk1VkhH
zhEF`hW(~ldohs@>p`l3>8X&fi_Q0ic0inztMC6Z~U(vN=@<SUtRJf8J&--{;6iO_#
zei!h?xiRb6bXpYoJ>tir)cu#+jEa77#n+?l1R$321=9J5<YphvC-OUum=W}NH2HD-
zVqg9UxC_ZOoz{Z70-+lb$Oh7s9r`UqM@;>Xh!NL@_dhLrH!LzJzdZ1J0H<w^lGh@O
z%ct~hEKCS3iCDChEcdfBTxh$qm<iC*l^bu5F#=&}Z;GAY5(9!=YS}|zO9l)fY^mLu
z7VvE$EgRLA6jL0ar4W*xGQwuM?42l9y9($z7V9oq_n*Y@0+ve><UvNw+;5|DdFxo}
z^daLP-16S^Ik{-QWbQ-JuH}!OB+93x=~vz8Wi}x%9|9lWyo4=Ps>J(7%{BN!crxqo
z<)jTJ62dM&lVD%!pw+G-a5?{b!}h_^D!mJ^yYJ(xpOw5TVM){;ZDt0ILyb2@dfp-;
ziPVB2&Zu{`llk)7<r~QA8Nv5tLw!%B<jD~x%~Lt}Cc3^n>Pc*w3ey{eQ0Ll-u?~g0
zY_djuy&EuQVv*Quf}wviypfZv6JYG=aQC+A1txns5iQLxLPNiM>sH64Q{X?W?nket
zQ1?)Mk(lOwA#y)wOL~`lu0jBty?--m$2$?YXzIKDyNZ=~On=FlMGqR!w-pj|Ok5IS
zu>C(s9oW{Dvi!-bv&s*OtF!NOE0U>MaGYnho?nhO#UNG`V_Y6DenY;aeMtJrE4}a8
zM`W1u8gi;e_~no(@(QB0IGaQ_zEQ3~&`XK!_#L3aC0M2A$R=`I1hZl<>g(ymP(T+!
zB&O2D5(!*eeRle={SNlBaP*;9NA#hU;Zk?z5i{Pgwr^B2sDl=yZUKX|y?Di077M3t
z6(1bB&(1PIW=Q3e60eAz96~4~I<*0(v{Npwq1iassPdhS$E6bcS}ssBf?9Th$0*uJ
z=bE|nh|<g>a<Q=v2E(Bnb(v<jIJ9hU3bo-ZrJQ%IES~vnoIswR(`-vKcf%w}#B&`3
z8C2}!E(^pyCd9<A{kCy$zsdE3q`!;ZRw&%tR^kct!k(1<O60~vrk=tHCay990ASb4
z8BRfHD*6(cB<wLZ{zO@Hsv@_+yfg~ZqWtp}xo{Ek?>g3%LYkN-nR&CTG6naxjG*w8
zFcQIqfs=aPqVQ!;A@|?3zw}yR|4do+OJC!8tb4f5b<&f7kE%tMWKw`4+C<r3u0M=b
zSo7YO<DkVsO>2n>g<kA}DOnYi%=k~qMDty;e;(%fA!mr!wz9l~=rwmya$fP#HXgjF
z{StJ?SR@3$`CfaGH>_0UGBij%1_#jQ5j|$-|C73LYj)m-@zaH3<53G+%?elJv?#Md
z_!_QnxR)kPjx~>bDZ+t8W%<4^Im=!x?7M+a%C9PyDtXm^KbI6RlQ7|NmrgUBwd-Mr
zih=aX5BnuUH8Ve5JTp4S2DqBCtB=@?T5-0AlML(9z^B18s{0tMy;Fy#e-%?vv7BJy
zKH25dp|BMb9sH`<%b8*6%ZxPBF3zX@VVzw=@3%)m#Zs<n_2<al5#d-IUgfB%rLo+D
zW@8;0l@jB2K~7#y*N71aF9Mq0GzhF1YZpX2pf__=@u-sIq!f#kJqo7G^9@Y%IEFw#
z50U?ms{gb3bYoH3|F4|_l!~7mV31pjP2~~D_$%qPxfripbW+|auC<F1r`R<A!^RAm
zgk$1HUfX#$i5p-Pr27;3C2q<GfD$)#1byNIu*3oS6lfFKJB3c-cRbvG2UwbMVYOzZ
z>gt0jrr&`glB4AxuSLy?(h+H-$21pYO^g|ecB-mmg}Zrf@7mYKPddy?L;i2?0j0e}
zOTzP(vIQSN^x1u0yYd`&E41+6scyqQLVyY*ntTcaCFeGhzI_%Iv4|m??v#j`cDyK?
ziX9$`53V`Na8?^{tl`?RfeVVLmSIdd?glQV)R^U$>7_Ag7ei8{v}?DQu&uP3PRe_x
zCfH>^f<we8);%?G<bX+r4ocN*|GQ?p9KEhj$Y7lur2`)WJR^2@ZI^`_0&(QLjOl*&
zNth!#*LN~q5)(3|-2KSwm1RLyfye6#`+_GfRv7odBa>I|VWDZIJo&}bn-#CxivFG0
zyVl36Vzmx@N5p|ZdMgp+e?%70c~C!1ul+;rbIvBxT^Wdh<`~lSp%#KUmvUY8;v5Ug
zXtn+4FG?9!!ePHZA$5iNYEF``<{&u`^*8<ITm$1Dv>}Mf**hzY{oSfAK<}}Ie%~es
zyMpB%F1S!MYE_p}UIgl4IBuH{1go4slL97VVq;Oa+Lh;D{xQ^P((Y&V&FrG$3yIS<
z889wU57t;3!(<+oTYMy`cyG!*wvG$!4;NQ-BPN(cDp{Uj*`pD0x12$$A`__2JDBDc
z9w&P(XiL5;P8*)Lb3kgqs!Ih8frM@4v58;L`2n<Ya9*=C3ftYq^;8M<7i`hpFzw<F
z))V@0PNT`rkMwbe%hC*Wze@6Mu9i^h6}z-$*Yi9ns;tz#RMa{5#gMj>e<~<3b*~%!
zLJlz}dC##-sFK13s-$-sO(-g9i(R*qvaWbA^Y14-M~2A|1=V~Dt>EturP^KQ-!{u(
z4mt7EX#O?;8V<1kNy^vioxAN$(fR}-H-X>%_$ec&%fw7|Irh4n_%DE4MaI)RVY8b-
z4wE;hFIhvM70zN!#uIkfW|NcRV(3ua(mwQck-tR2(A~4kUWBCAZ0y%5ME#8fgA%OP
zHEt}eT%DsmAv^5+EGz#nm}bH<@^hKI;03%Y5WcrMxdOasOx^E{7d^bijjrxHkSfa_
zKX2m7^ZsUf755PW&;$!NB8NbA%^oq^=4kVwy1y_;EAV}wKO?kEc;C$z`p>ZdA)vS8
z9=Vo3g`p=rZSDL4W(!a;IQ1n~5f}52wL_eqG#PW-zp#1nj?@@<2(A6gJUJ1b1jrH?
z2E*JebcYh2M1J{m=EiZoiJ^wDJ=}?A-q+j6xk{Bg13)Ycnf^mcnz2#tGn$y|Ns|Go
z4b`+e$%o~xe73p9n&<uYV}V*ckwjfDKSr<?9GQ)aLOJXxz_LuH+A7x;)y47!Q^(ph
zx+|u72&lTR{$g6#YCy-R4R%=zMKMQ%H;o-<{@EE`2$=WV=6jz!dQRsA^GA&$<p)*c
zdcNq=z|@Nd9a{}U%l~N_DqxttAI&i0n*w@SdYm4_JwH8>p}s9xFQ#dSeXe=5W6&ZZ
z!pP5g^jzn6a;WZwC5&f($)EYD7)!Y>ev8TEV3L`1_`dY#XWs|;&|Fte7B{8cJM)dN
z-%X&;&SD;+N00|<=|5L}sX~6AjnM8E-UnPMFxl0d+#XcV?nxP8lDH>Di#$+EU8|~D
zOsHlB7>NUx(>LK4+k1o{Dg2`Ud-gE7*k})><rGb2FJYxz7(xgK?y7>eD8=UV<y*^$
zpy_lst`@ZiI;BD`lYb}OfDcNbt}&0>HgVoBcy-O|dS!X=!(GJvjxZWWb;&f{Vh1~b
z#a|u^Y5Z43)&-G@d5^f8IKXh1ouB&nZxnw250h>T2<JsJ^{Bd(Y6ghmU#FH|<ukn3
zh>jMCZAm!tY>uXXqj-KmPxbP@H0WJH_Li9O$HmPR*zq?438k$^nV{0DV2@vQ;f8ya
zt5LIRDF!P1$tM#oJ~8O*6p*{;Cnja5P7E+%0}ILBR7dUYpPV~X^L&j(B~+S;Vo;sQ
zvTy6OA!qAxu)`N53?Fynn5<Cse7&7hAyj^^bA|HT*%iufvP3=nZgse@nhFilk1Rm}
zXb}E5HZ(}Dx1qQ-P;95H7~_NjcgAJ0(!#~E-*4@kC|~y<I`{(hraZzT>zwV8nIbxF
zfD=)@)owoSo+bc_=R&GPDY``nc(g#><i_~Di_@Q1u$AT-got^YU6-TXRx+YlZV5&4
z_NarE><HHySz476>baXkr7fwatX*sDuobjgQ=qW2c3q~$cmeSgUc*;l0C3c1BEu@j
z6`+d9u%^H~xMeeJgiTE_6jt6Q)<W*4P*Xm8IXty#?ucayT)pX*R^t1QW$o-g=k;5j
zzjFnlf1TPbAozjB*G<nb^pPJYNIT^7L9_~kPeDX}(~szwD0V-EZy0mL0VfRAID{qw
zCrlUQFPT+PVb3Rtb)oI%UIE814CZih(xj4;ruR`uAtp?UQB*AmHl-iGe^<3WurJzU
zV*?#f#5&LY!kL4gqdj_wD1vtV90T4&b5T(Z?<|t`c%7<<z4h6_4bsAK+=}qi#;^Zg
zc|R0ARoXWtQ#G@D<=<>+rbs!K-X%u5$YvkTHWlcP*}7-Fn4I@Mzb`y*C1`~P65EJ?
zI-J90#cNnWMAgM07tjU$wqhI*A3#P0r!Xpr&d-yA^y%lO7QW@BohTdc%sVKs%YE}B
zEL$Q+ykWQHw0iRup5vPX<sUvsjFA~}`3vt(T<WllQPM3!DzHff8O;)j^940Nc|~~H
zqPnhKIuYl(=p_^h=0{472RZ9+;;VW056F$h$I!;Y#D8#$hmzc9*Mivk!oFnSSQvX_
z#{7;WN`-}g^kd}BjPJ0IrRu-?>QOC%>q*$a@9uwUuBoOF3Oz;gRNd#N!`?uXJ5NYm
znO{sIq{2u0%I5oVw20J<+=P!QPWf(9BsO5f&W7vL&P}bzfdB(t8NoZ;QKf7F-Nw@V
zid0_{cMnkdcMD5dC<}L1tH^8VgZW~IT0g!I2P5wxmSMsZJtfG`4+VQr8X(O4WBorJ
zV+~}I6eSHm1V7!)7?#hxe5~CEJYjM~(W3US71R~Rny<T{t`Oz_kWImrtWxzC`u?b|
zgYwk?u`cv`kr580-rZJ7-92MI-}wcBjI5P=zu>QL3$nJX{XVl-q`ryqEbcRJ;=G>a
zms144<9jEyagf%X+{w8bl-&Md5iwF~HiO8DQc-MD*%RtMEgQSel{uP`#`bWbjbyR1
z*3VWl8pKGOKvqeO33g=|wH7GlkiE-MqB25Z7h1ZV9DCeqHqW30aMnxvWiNZ%5$U@#
zCwRsX*_$aZUYAFE=oj6bM;M>f<)KW5ZoDQ7$Tos@DRXW>ngoJ500<<EzZwkisjVTP
z%4jv=`e@tNl-+u|tZX*tUlXe9J~Cv5Aq5WY#t3x;)I<~z2(HW%QZonkrB~q*+Ta%*
z2c3g&6p~7k#S)%|C|;Dh&fV!emGTALQg;ePnosY%s;#Ewy9AlJ?&$(c@h2nZgxDx@
zid{&|dS>#7)iA@J)Y~0#;hJw<+2Ly5DNs3CzMo>W?LpF`KBU)6!$`1Du?Xpff*&Q4
zF^kgj>apuxFGLX-oSueT+a_(10SzVOavo<gd2mZ7Yp(5mZbLN1kuf48mMoowA1?*=
zab*YnIG79?iS5D!`S0y6-1Aa<*jAHv&a|LCe_oI?3_sTZX25+LcQV}n$^5TmH6&C5
z1B)nl9wH|)L&WK7q>10HU<*NOhZRmlKA_@@D4kSWFHx-xD)`x~&Iws8;z8rRd&$sZ
zWcLmW_|D-0myJ^i@VQ+{hL<7C;tQ6DqKZsA4FwXaK`3KQ7xI~e^VMnswlx)oc{G!$
z2PMTKJNl9s2J-n>fgCl=P@hDkP=Y43^+DKuxsub`uuOU8+|Y^YyBg;x`hCv+H{Rp%
zbZ`X7)VDdS0N)U0TWro+Au6#Vlje*NX5T)1p;8xhf4)uS*UX%um>p7LGNHCC%&ScF
zlG$t)biTbk{qf|)&6ORCY563QnM{5dQ|kLx9Sm~JQhjj?iQylo=DPn8R2FCDznZhK
zsZy0->?uGg#ValGTa?9=B3@@H(p8<yU;1(NUES40nU-QC3b`YJCds$0jon~gY+VWX
zo(2B_zG~4`1FjY9(c=ltbi~8RE8q7VvQQh=Z~v9H3!mPnD?)GqD>hmcPD>98d%1+^
zXH5F9q?Kzm(b=uy+$d+)VTe}((;S~@E;ZPrI=;j45n82eg`Hh;BrpJlon5{^o9t}5
z?o(T3AnBSy6HaFs?!UGg0dc`238?eLB$|oYT~HxVf#;fXcW6;+F$JRJiw-c{!-pER
z)@+E7g4XOel;ktbZR}5}HQ?7NEy+vR3^D|ee!G!q1Tiq&jHv4$aIohuWuKn_{NfW^
zF`9&WKfjUOZyV>1pRhpjTyTGx@3f7aDJI<XkxCdd3{)~o?DRKhRX}wBAJeT&-(kt^
zKH6VAN+YXBVVfLdGw!E_Sy3sZWnhPPAX;L`yx=cU&!M5v^{ToS`5ZV5@KgMGX2w#v
zEtGO6#6pbbe_$sOR`nXA<nfdq{OMwPLFoLi-Yd(Nx|ly=4lpN3C1`t>FmvPiln3@c
zm?{KkyC^P+<F*X<ATsU|=pJxFlGDH){$%a$_`l9GzS)iz0N7PuSog#VlSY)iFIc7^
z+vqLczi@HTtL=GGD9>UHjlPE9o+vzL<2<G3@b9+n<rJMGS387i$53Y$_~ZOF+?0h^
zm3x^2VTOl0J|^`6U}6zmo)*${`IeVnmYFAH*;>#cYX#MfKOGz})NRe5-&mxoUB%WJ
z{p2JmbWbq3^LhgyNNY7`y134YO4)Rqt@D>$wu{;{CCMRG3pG#IXe{4Ot@jOybo)zg
zv4@;4Wa8`qtq1fmdEs%&mc<HHH|w!|VV!)H<gt_CMlOjIVaZy>4??CpTUFS|ilZj2
zHM6yKqb~9slhl{)8uGzPo%gwa@jvUc44yrh$Wr>}ZHqzd<Vm)E(~l;MGSQr$Z)&m0
zD}lXtvLT-G!`gnYg!HJz_lN49d17W|d1?JVg;OVQmp?t1+efS1_Fz)*qWkMyKUCNC
zl7Ee-ul<GNraUpTWVuh7^qS4qtd~L_mxE&7ffvWM;HK~BuRnA(ly3Lu2N^9I^tfE(
z;o<sNiF&ENG7qQjLe<w+yRs~v=DLAVXMfzlWzq?Nj#_jkP+R)ny&8`UySyYD7xMB8
zQ|jd*O3Mul@!)#bYc@DXsfLRWB83{8F08bjkX`)X@j5s6fa3|4{dNMO`s79Jo(`VV
z_96XK)o!K6WEO4kQ{4T}`hm3$8xnT;l_v~C8XOi5CyYu>y6nP>)_8StmRs?IiG9zW
zbO~E<i}|Gg=+wcB5AIsBf=Pr-1DER?#_w9Pv`hwKrTAUdbIV4iwk}}uX6XC)%yKIm
zS35HGqPw5s%jd7G{w87}q;9SHtFndweNcS+(!XhK%sjKAk=b_uM)EV|Gn1xWwzKW)
zd5%z$DzPxPY_^*ZK`Y(Gg42d2(-QZIu22jnALhW?goHzt&xW6tU%rF($F#_>l-X|o
z$}aAwYsMIp+P(><g^Nyu#2m#W9i5WelG(%mi1?7wd*$Eb|J*pb644WUERrNRNs2;}
zk|p{hqKf-SOF>U1$g=Wz+)Sd+C*2Mr*hlL_R?zwos{2J-AFK{Sm;`G~GR;7#-xAK6
zjMXWr1N6LUA)kFq->0X@$!jl{XK2_&PP01=@qL86Za>TYX*R>P7DK0R69I|7CSI#d
zO|#LY$2qLhq7_caK#qrfsPyA3^aC8wS5h)!qYX8*SY&-QsbP5JO#Pn0T9eG&k}5}I
zG94ZztRk@;z0_qP1wFwIZYr4QCU&Dq`9o1e+r@33L!;EUn)qj}Pb{os9RyOkAURdZ
zGRp4p-jwNDUeoQY<R@vKmWxP)ZKW7Mq3~xeG(%FHS5Ez6oWnGq4ZlnA5H#8^pKD=9
zgH0^~$k1%kc9(;aU<}bDj7%}qJWbCI^ZfLvj)mY+6e^0uWRJcX+$W2-?#)VN8TbTJ
z&aB>Ak@Ija=`Ik*2-+0rSJb|~e2ipD*#^g%Nv{}LIc}vb!>`e+r@>}<H%kqsi^Ml0
zpG2T4n~9R(Hp~7!2*DpP8IWj+JfmHSI{9c}VqSIj+RbkYvKFr`x*`483hsb^c)0_J
zNs~_zrBtkx7*_BgWX&|KuYp3g$IECvbA}T|Qp;M<Pfs=1aqR@idD5;F;$t98TOwG$
zIFey@kBV!O-1&6&)YS1@y_+=aqs!E7MqCc>c>2=YKAW=#Zan-~$ovFTSc>Q1(r)JO
zLxR}c`pkfxmw+AI$>8hW{GxL|Y@7jOA4KzjGm+Ufz7J|VL~TYOfynTwpPZQKR`L9k
zN()@1%HpJs<gT5o^`_uLpW*W#?ku@6{Y(&NEc0I=**Q-=1GDmyU_eG2UVta2=BGVY
zbvj>FXqW##D3gHld&depU~*bqOj2C^<oZdxC*BsPdk-{wQR?uMc^{=2kP>D#jfdW$
zyO6%KqLi`mM}ZU)@-ziE+^)%FN>q|GWoL!RvGRV{(>2Nxhs!M{Dc)LxJQoBy=nKg+
z$`oq5TgB=Zb6$K1k#FFlU%Dt0MuD)d5T_&<XXs!Evkan7zBKFcoBq!`4zgCz!}>3y
z9hlak)18>r+mae$S%(^ao{@MfQ*!A+nHEAc8Afsym{%JDrN{^bZf^>rB^>9dV<clQ
z`y1BQ#kRJ(=+u>$x8V|oF(58sV}nC>zAI4dAA4=lkj%el&f{)+bRIv=UT453XWwDH
zw^BmU2uOPX9TW-B;hvo3!Q5R0C9mZedZHKO?HWG=`DV;RsV5GB^fjTV6lzGNC8%UF
z*O<HhC4G5YX<_tBw#zfWjnEdT_<f3FyHB~S)X&f7R^eF?eh*P8PM`rpz%bcCF_fXc
z{Gdz7aQJ904-XAfS#~3={hotleNpt#$6((ADUK7BvYngwdBT9x12&%YzM0Ll>I*r5
zQ3lM}+mqVI<FwVm)KADArcQU~`OAODEr-*_>=BU9C&fXVQoObP?1xhv+B`k!;4RIi
z`ySsE;UJZfVfb!nLZ(9x_H!|&P-+P|u~H|Lo1=k2J6?f?i4+CQHJgg%#akL7Lkgp0
zNR*PZ$(Nh{LS`=CiI!dD#7klY?^rH-!)jEUvHWGs!oGQQmsC+EoURl0H?2-SjfJoe
z_L<^9ki`!YDFT&rK)@sLd44M_A2;$(w_c<J>pfc4vTco2$h9XDc?0i#|2N4qopQto
z#=bK9p!)hngA)Mr&O=foWWj8gl!4tnNLP!Rlw$fOF#Tw_35KarE!eYVDGiL#!;(AE
ztyeq|?f1p0KV#-b$)#TUR}20eBr>(_yk?lK=n_*=u{R>8s;|e7g(Ls&EjY|nL_2cS
zs%b<DoK=re7_pSf&|a?mu7J5%R<qY6@8}S})IQtH!{+cUGRFDG+9_;(OQG9r5O-QB
zd&LR20qt(k3`%xs28o{r{3l`c|1$f;OmYNKl_{i8QP8-+eZ#pBuVJGy{a}O<U}P-?
z7M1Y_D8)~(y3vDV&YCjYi0qZu{urTHSk=H1Eqq0ER3Y$Ap>y_3P3pRk^uA0z8-<oe
zw|i-(gfJ9_7I^hBLM@gd?MD{cg249mASLuzZ7&Zzjw&ZAMpjixV}kQ}>ylDZqjjE!
zSZajvlGe<*K!Q!XI4{G<=U)pq&})%4DlQq&9SM*z%{7s*6e{;X$RHJOT`2LxQwLK!
z;Oj3)2WWA`!C(iyCDrU`WFE;G*|LusrH7xBkC|Hsu9L+2H|hQ9gY2%pW3S5jW6_U?
z&JjIy4lDYOy$}u~jGkRxWBaAJWM3#WRH&<2NtSpWJCM}CLPN6t$~y06c=wo1H>S-r
zQ6YQ>7N1r_cn>fRzP#+`w`g<8bg`Z4VmDkqerQ`0#mv4dvBaYF-+a$AIDx3J29!54
zndKMd;{RXZ3Z0Wjs>XvUUQg6Q^%|P4>z{Twi)of~A57>t+qm<%;#14(`6o*r5t1Wj
zht<@Szw`8s3LJ$ha;EUE*y9R8b#H`9iHwl>lx60pg)LZPaORQX&YyBy(6CUE3`X%m
z-+r#zSJzi!9>WjKT&p^j6MX62pDX#8;!Z8aon!P%BF=&8MRK3NGIhf^%Q9y0r@qjZ
zLRQ+O)`Fsxmr6Vu3Rv$FoKi3MSoLk&&TUK|N;aNPYk@W9s0A4nNtNDz?1?}?v5-`6
ziR}mkytvM_y(8JRK-f&h#d{Aasq7)JJi)_nR;!2mjxQ}Y-kSK)ZNM?mwtdj2%|gd#
zTQ(J)Llv6@OQ7dTGLA7fE_^41g3hX$`#8w?oke4#q|AlPQ^`k6b|0vx^vPZRJ7I>X
zUv)EgD;b);ny<R=;gxlqR%&gOPVEyYrhjNHLO>^!5K@7pUDA3f!5g5Nvvv|sw>A-K
ze>nA1)obpzziug*SmaE_LxI!AD)E?#|46|nM4kRWHXoCkKe6Kp!Ykc$Yr;o2X;N&H
zAu(e=0vXsD=KMYvP-M{7D@}d--O5MeYRI&{O&2n`Z|~LD>GApS&`~Inm=3}grIrRM
zRexPs&^|Rb1j&`0r*K`EHZ<q1359|n3<4=?==7UP7J<&)&P14qARP>Yy#o&Ix{Scs
zI!kFW+zs`YzFwo;Z{`v?ovGV-u3FB^8rPRrY7mq4|1W3<ND(HW_evlU;iZ{~wNa{;
zWbC8HBv5P5{Co2k1MbU5ON=EfpWgA|Zs&V&vZ7P0dX$B_7oNJ;fTf9Aw-e!JL<&oS
zr%=}=qX*$rj{L3I8cp9PvNd1Ic&XFy=eS8bmHMfIts%BRL)?5x)|yq^&76O?aoW=f
zN~vpvK@LRzC?ewTYD-?;d@_0IR?_XU`nq)+rzo9_drdbPz9fESN7r_O`NI;KFJ+tf
zamaKJ>8toG*(ua#SyuCG;0F+uF0tc_JdslJvx|Upa%i{rZG-HddtxZb3r;VQ0gAGy
z>bQ+RnT7QjQ2lH|Bp7bhF7@MR0>ln!sbYBbx(`Rac~MimpS_S#t=q{Muy7)id*@_<
z(V!L&2av>yghm&iqXB#e3BqYalPoZ-6^>Wgk1`Rg1177`nJL)P+N5rE39D^}63OHs
zuJ!zArW(bYfrAJPq4^|Y6uKLNssAG&89u~ewCM;X%=D*kyj6nK0Y|u*Ga&o<uRlW@
zXj6P9S^g%9^@~4)Dfx2LzL^G!4m8kf`}wNzU`tY{kWiPhUXVG`bjJ>S7-?jS24~WY
z!alre@!smj?A+Jbdy<~gV=@5seY#;fmFxGE3JvVh$@|r+aZ7Yhg?+}S4)`igP`}E4
z44@5<N{T@lrFhE!cw;oQ{e$Q`A5MPXzlThrbJACRfqY4dzXsF)YHI3EfK{E6CNwtJ
zEyK9K0UscRCI(pk+A$8?(FWJ`2h+^6o-0SRP=-1RCfw8hg8t@&4Cc=c*EBN}b!YN6
zzuZwY2S<4Vn{;7uF-3U6l&{<073jYXHG$|=l2P9j)!}k~!#sS*?s?J9B(wtO5hcc_
z9z<7t{Y<$pN$OvvDwX<&LD|;@*U=iOgF5B;YaLYkMbUIURv$)pDv=h_t<4a7p+ZNX
z4Nyk;ex591&JhCtqA<CvDnCi7Pf3iSqoH##ca<yklOH^ZAOVq(HoV0H6GQ=FQ-rq#
z`R<P<yH<N3wm=AspE~qRU#mJbIClXfkwsb4+P!wb*u%tG-FMq@aR;f7>u)9m6vV3e
z87TEoAi-a@hxp5cLwGpMyENzmRgrJ`Ycc^K-%tjqQ=fQ8F*{%b&x9!lwaIaT7^qVW
zpE1O`(gt23a+i@`)z{MTMf(t|Sb6L1r4r-jWu4)@A2g1{9d^r4RwiH1_Id=#;lJeU
zrbpCHlcC*=o<RI<|3~T}MJ%n}=H;qKT~U&jmHjEDcCSUCSpUPUrbET2*Q>9E(ps`J
ztIAv1uiKECLD<}aOLOPk>9>D;fr#O!os(_@Ou@aRa*~NZ3@OTDVzP9{b2G~e^yOph
zdU+JAni5@yOTD1~BHC;D%}I+iiT|U2CXnqhE0;3)g{J8q(YbM?LnU(D@KaJ;?_O$7
zUyNrBP<i;>-0l4JX;3Xo%$O8E)N8|awhp`DaQ-$b|2ESWu7ceG`&fymNd9eqD(<$%
z{ccBKKO@FkKLsieH#1t_|C9U{=1cFzix>+1Eh8D|uFPRn_p@9zFnbC8Z5n~u$3t?@
zxHQ780oY}#6pt8Bk2f!94}x6(x)!<z#@(l{E*5Nj4{)AP?ygIJOGrY#L@RDA(ek#n
zrAX@w%BI&J$-5>0b2VS>WnqInVb@c{9wHn^T(0_QIr0=K+$s}MIrY?Vf-<7E3g)bO
zlsh2ZBj}Un!_}B^fk>7k|04R^dmZV?p~I!w4wgRKUq6><(WNVg)k(D6SU)g(5KImK
z=^ME0ks$IWeywdScZl$!<@)-5$m|W^a<vhZOb&yfWLX3yd)2*?bsJ9f{7x!p&WJHg
zj#!&<=erdBF$N(q*BD~wx4${2OSb)G`m<+AGiv|>D&^gZ?z4Fn_U9V6CZ=soe#BHW
z+Q$!Nj(E0&c9G;apC$RtV@Xc)0rC_{d8VG4L!OFww&q(&e#0q;(fsBa;x|s(?S0lh
z<jnm1ivSy0k8kIVXf;=<8WFj1-6EYQ;U~j$5Us^spv;o5Lh!-JH2irZtdUg^8(yt!
zsV#Tbkg;$C=q@L$vu$~s2HY*@WKFkQ=V#P-bJX4PQFWEOSgduh-m1amt2scAyD(>+
zW<ugV26_dLsn?*h^odOrRtj<sN`G%Duz!5&nFK>cPJ7;0>0Ax1$&iP<F@IOcVkKfa
z>gu}j%f+xY+w#u75`;pNPy>DdL?r<jQQnZQj0n>lLEys=krk@kG-5vCcUEdqPCE^~
zHlRwkXOGbfTGu<~(axq@5u6B{N(f(Qy6D<qp=4a`V7%FK2B*e~dcG^@qUB<w5qVoa
zM5$$nWg>~B;9FxJnU#^;3ju6N13kzP8`-jQ$w>7hNoB4>&fYD5rOgOL0jb|w*>Fb6
zN!@8zgPb?XKAD^{CC@R8=ObD{B6TS0QleTXELl-Cvd%d+2?4eNa0z;+PT3SSckUX$
z>P5ZkHWNk5UQmL0q|uZPx)jO3l6-fd??-W|1xQwUQm?!A^oK!XX6BngZdB5NT3{in
zj04~VRUu|aA~w>6V94lF)hHHgE|Cbg))W$+JM>0K4}i>936dqKj*$62ie^LHokToL
zlu2;5m6rQ$LX{C1vdYzv9&w(*HaUvc$_?xw(i$;+!t-@Bl{vw?c`o>cKDp!d3uH@X
zwfS&-wfRyRmJPu8QeD&}5|65YTvCBVCeE4Umf0^Wi;m0k#Bk1l$d0DEHpEY;Dbo$9
z``OOWED5sZl+K`fqOaa`xP8&)K88di(QC>!E*+p_yT7a&kH6qJyyh<0+c^Oy);Yf=
zV93<6(*_%45aXN!@CdMb10!Qyc}t3TZ<VU?i3M1f@~c8*j5BI&qR1E-kpBJ2kx1C2
zJ9#mq5A$of+Zw1naUlUgaQ@gudEh6ln>=W|T`x7+t+NYdc+3{2Hi@?AmhcRAzJM<J
zt%lgE(I*k*l$N({=M)htIVjwQFVjrhaJdP?Omql}_?WFi93jv}KpOMoJXVkX4Qb6r
z1hR6&@6xCO-n!N5G8XH^he#fOds=N{&<>De$y;s@;BG%UvYRZhI)tgcVyLiE(_>PW
zM1+E!C7#Y7IKPNQ;t1WhTy?)uu1tcd$WeXAGGs;y=?Eh=1I7{B)q$e>JI71ZyFZG_
zk7d-wT18sNz;_>>^2C`J&k!u154(eK<?w8#y4(nWtdK9$qN5`B00mEZf`_yu)E9L*
z>stE(UV~&j2h8&sp>k@<;(ka+Kmx9f$ykC$9Zb-u8$fM!bFC*w*E_M&>(fZg|73Tj
zs)tv{?hUUCays_;Rii_%;X7(Zh8;<+Xtc{77K!5zCx<S{f_9v<zGhA~6UFFRgf~;g
z=gq{>HCi%AMg`z)gIY4?R1IC<=>-?q5u43Co-NGIAtG_#WWSALgt~5w_TF`vaog;u
z-{<bC?{STZ*(P}o>bt;6SQPrl3k)LrxFz2c>$6KbOsOOBqPgF~({4pnqFDFAUuY<f
zmA1m?$HAZzh(3gKR7=oO;1v*<68XXUUky4Rz@p+&1IS2nJKJUs5%*FfP|D7p9Z4po
zm?7h`OP74O%;n?!yM1fCi$|t}IV=s_lA2r8QY%O}t#%HAFb$SlOyS7GB~BZwL9LjA
zf<1ME7|hRoApF*lg>_-|jfoPB+S-`B%18Hi@(Y@CSU5J{-lA+oH6si3Y9SRvU5U<6
zS6r-e>9+ZWc-=~?R9f}2!z_bK?~i%vp)YgkTm_S-Q(TTeoD!*c8FSK*mP~yCB_w2#
zDxj0X3@LBn?*-MA(7;b^&Yj8)&?aB8489~25&=uTF-lr5)rFl<$DguQj3S!DaVOuq
zFiu0~R&#;AiJhbheR#@khu1;x5(6=0!j;>I`dX+NrxK}SkpEQmg&_cs$pj|mdOTi@
zR)cZd`-^L2iqApbhGqfvAZQ@))qC9u4}9^P@ZbVBi<(U(WMYE=Z?KU1ym*2g@22dv
zEs~1C!`m7f(H4=#9PomgZf7c~U~(DfNu!nqDpl7+$MN$iP^=QTXX@z7$r5&TIzQ@{
zITM{w1zaKhk)SbG3>b6$%Eecg;WK=&+beE-t~6sP)Df8Z5p5S{ydn-9q@E)8p1j!F
z*nkUw2nj-9!6CGVJ4XDiL^4@%nB3gt=Q`9xppJBw1uZLcWj{XVkFbIUCmgR0%KEl^
zrgXH<hXE4p2ib9^(JWi2wl7Q`$9Tc^$Qa5@M5MLjrscG<IpyV&x(p7RXV)~tuCVx7
zHqzUc9bHXp!4CJIl1&D$u$~i{VtTpnNGOxcKDK7nXw<GXoRwYZ6#<fxeAO#6mr2kG
z*koVWP|9N6GIj~F+D69xC>Wpsd3$=u{I8?^o+cOO+Gzy`N@drSa0WaEBq>905yXQh
z)hv0eiuAqzfXov87al77%gpvV0<l!>1T<3hK|?NuP4crtC)ejJ6*4wCTbu0qz`ZPR
z=*UhQ)120X0L77?ufc&q;g`N;5Ty)YOCQ@IRP&lK8qow&)+-`>wc?S5qkKzu>f@cu
zXqr5>g^`r!>x<=q<D6s4R;ccC3mm~+?y5GMKwwJ9IhE9A%(X*|8?J~TC1reC<!T;3
zkWiIwlGWS77oC7ys@{?mpw%0BaAmfyS7$RNtB$8iLxJc|fJ?2s=oB?nb>K<7VUc}e
z*P(%dgo>OvHAj4yq|3jBR&}mgPUQcs542SCy8M7(>RX`Jc08&ZqV?+JI@e+3KmO_>
zlvsVik}^7t>G9p|T#4Q&AE;0-F`rzu(4REY#GL@C5?u2GLKpgA7mn?Fa4?oHI+(@m
zXwz&WeRT_|-ukj<Z+kQUY+w57*5peAqCG8w*UGPdg7i8mNb*6CN|j%?DAdS$QD{yB
z{+IpmKQSTD#j=a#9cxMz(Tg^uR$cL*F0R3Mp^saS`_*Q)mG(_+7Db>_TXCz<*+JXm
zr=UuZWdm?u+8vGi$aSmAbkM`=Eg{>(wPf*`nu5c9<@@x%Qq*Uo$(J0{tGRkJF65%u
zBZb?j;iERrSFQiS0P~xw(}4lE1*C}1=H`}lu8ErwQw)Kc`t-l%betnH)6j^WlQy0Y
zczjix?QzccH!V>%VuyMju}gN}vySyMd`o4nls{jpEk!Gg+f3gF*#52iPZdKari58;
zFZ-6{sjjs!^r3~_X{j?%XDU?>q9>Gj5dG~m=Vi7uo6<~WdPJ<l2|WgfIUss-oi}+2
zQ03R(Ou5_zl2AOfkSe~Rto)cFW9a|UH=y?EcgVpIva6yE-4DN{m*swFt3-gIx;ASg
z@tKro%8c@|i0;)_>T*ZC>Coa!z+(YOeb`|Ycd|b*FAFk`1CE;Vtzs5Pv1ms6Y8ytO
z*vwG9$&mZWCyuJPpikJ1`i&<A$rA2*+n2!?<~V76ab$h$U_HM@OLmN4r~*#C3j_-w
zkQw6}pu}0c_F$MwO^Ai#00UlqAf0%2yr}NZ?@c-ItBH;js^7G>gy9-EA-fL%`~FwY
zZ)^zLOe{N50<evsr|cWhG#_Ix3aMaCYp0x<@Fb?`PKn?1ra<4cf4>1L^f_xoO}{7m
z=aJa;AHy-4U$wCjasVf-pFUU>RE2IF@zwUAU|k%9ol%Yh$=r$5syaKP_sVaQP0<-e
z633KpB-U+wqUHeeH_0FEipG_;9Hs*R7OXhRbz8^XeyO7+>W`+jeY+BMA0<U^aLAcG
zVtszQYRv66O$)<8B8lojaGwzoAqYAnpW!UtY+@uKMiW=hiPQ{#^1k3m{wjr(5C(Tg
zk>{k{(9L^+=k$v~^Y1EJfT#ZWcEU4EDB`8MHJ6yGxCPUo?6;I!<TYw_$KAQtqUbxe
zJ$(BnM~dRAP(yWIs;yiPS=61?v;aXDRuRIAPL&jO+3753<F+euuJ<H}k^x-vVA?7|
zQQwI_#M=4K!jE>ST$Y)}Kamfwx{C-#dl<9C$*)7Q6Dwl;IUQs3?)It%AHKZ`yiXuU
zq`UHzc9Mc@7u3C;+83C3DoTZV3EQ`Aho$6YTB13LD5L=MBUjKgAc&5bxPIu?t>SWK
zGi~xdO<E~9VU5e5sGjI`xv$lV9`EK`X<kdI285|Hcq0Tk9HaL;;(%_6Fw<d5G_!5S
zk(#m<W<$@|-@dw!8N~0WP#XhYue1cseR8cRb>C=u{Bc!Z2}`&J4`&R1bH`kNklnwV
z`byogXscLKmdu120T!L`lp9is;+A`qjPQXBkb6GTrACTA`)+3IB~vc>)$^&Sm%S=F
zuEvrH2tF4AGk|9i-B^i4X_$Pzc;v7HqBf{Njdh_dD|4VU?Zp^q;878l&-JOgN_y+)
z_8>oc_*n6_HA>Pk;R}>MJRiZm=zqqWNEffcqPB0-(flb?O!&@}3iiwYyojCYc?CeS
zDJW`SF_WV#*+HuC??Lqphy~6C7cPEH`s-gw`LQIgSslK&W98y?LC*VhM#r64zms0s
z$K-<!qSkBdgKR2GQZ#<xD2)}G+cTUrDITzBJ-1VxFpTOwiAn`TXR>dzk~D@uwJSIk
zHe$d;FykS1^0XBPEC>YiL`ckV=^fT~Q`uiUbABmW!bFvl)C&n~Lhp>A(kxK=hmw<b
z81bU1khkQoPEEMY=C-lpZ3~%G>?tr-%L)2+tz0J!v9*ff4u@-#?<OznyG1T!?>{%b
zmDvj0rJ}qD;~b(=`uWto`obefH9N0D!g-ru26t&odeYB@oGJ9}#Hfi0&yC6>F$bS<
z)=2Hy_fglPwIVI^Q@~1#I;VII0)9`C&IM-+03}0BRF4!$9jcv_p6-&;6HA5Enm|!v
zdmum&Hn_d8nAhDNXG7${f>mKX3Z}R|IFu=Kj$F6e)10E!gqlF6f@|lg>fHZ2`jylc
z`S_ixj8&hT?mcJu2XJ04^gva=_2Llx3{XxHh*EV(&7#L@`Ri6zJe89K&Yp8sE%Yxi
zWFsF3<OI~=2tI+|2c}k0LLfa)%<Ig_9}U;PdKN1=7B~r6=*x^B1Z1;<^!v!}3hV#b
z>ehl0Z<@WGFyx#|Jk?3yDMm*#JW4B7FIQn~Ycp}Zn;!AxP^KHmreMG(o}5d5>4(@l
zgBa6^B#?6J5c;C*M1e==P&;1EkOgdkxO-$_1g16}j@!5C@wzIar0P|5NLgxLKF_f=
zXx7ul-uu?ZXxX^(+=`{fs?d5Lad3`I5i`h8#qwc?veizUH(JuU9t@>w4{lm-gAA4e
zDqhN7EE=^qz9=ETgnehh_(V(xs&)kDAJgaVh~3T7*_LNB=x(M<$>D%05zYoD+&pFF
zQ3eZ1nK=d_2{yB<YB8XS;Ft>l4$~AP7`nQWpJ0rslU(9V0?%cpOnt#>M!Mr--Ab9u
zZY!XpKiwCVqUB_vcdh<;R|Mn%Rs(rG(cce8Wj6x+AUoP}ln$qn2;<-!c3Kp9id1zq
zh<ZObXR|5niaQd?9zo2d$;>MQ5Q1D>VN*GS1=|7rhL|k7Sb=c~W2Z9~>y-0mpw}^?
zU}Mnyp^+&|<#UHw9@O%hQ8a2HR;@vX8CZ-rMN+EPg2(uqr%hI{-2V*u$q`O+v0D3V
z?2hA!J<lcu+IE$eQGO;XBS{^aEDUy21CV$QK5n+pFa({`#bm>S*UpiXOYTrf7r*Pb
z^EM+-T*mAEQHrgE|3{Asd9j8Y$#LeVD8s#F_^Z^2D+Duy9*f3le*2>~-JK~1jM=P8
zRgxWi^i`jt8KwDfUZCCMsV%X8J};`cO}5BMMRBi%&%JNSq_u=GAc?pzq#j1_m+)oF
zRn_9C<bhi1wmQTzDxC9A37gEQWj$pwUg@&;vI<gPT=O#f=zV6?(Ij0z@?y2^WRn#h
z)H=t|C1~2VS(lyUA-xDqb4{4JtDd_?$7`B#QPB`P{ggEUtTlPQplOY*`x^``o>V}{
ziX%y9y_?aqSd#MxdBLQFm54@VZ{!6ajTAUkaz7#04+I@+o~DpObT@Dfr<3Qb$a5eJ
z!4E*fkLkeq84^E&vUp1?_|jyQo)Qp6*$~CmcZnk~C~r0I#H!vAA<{48Ze3Zj(Y1fJ
z&(w-1dd|;~#sQBLNvRl2Qas4QAp~pK$q5%ouCw4J1-w+ZgP>lXoU~9mcG9A*Z7RZo
z_|&90LQRUqA4_W+WHR*G$C9EvWj`PELI)Xt9-7kzMZI$KtjMQ(`;Sfuv)JyNpNy{W
zWmJb&$u|p|0n|lEfn13mwL|Mdbx>7_xat%tV0tf!K#JnD^mH-*O8Y=5FsMn~`N$NM
zaiH2oc$3G;IW<8>QWAB&W6qy@yh#aV9LVZ^ZsVpT?PzKXQP*Aic}nUISx=|H_V<c|
zV^5Zo0pwbB8W5nlZFHQiThwLNTUdX{Wgc$-ehl-jz(wn73W+G<XOl@GYgnFEUk@PL
zm&EfrUguGECsiige*YK2L*<AfLgo<+VmIGtZLn9q)tf(vZTTj<4`EC;goCV3ILI;J
zAd93=fVe<erKv~?_^&B*HT=#!{L@?Rb_A3kAY{;r?d4Zj4#gPAjEEDy9^*qtB2)zM
z6C0B{;?_lUA_heBJS=!omU}-JhD#2;vTlY6PbL?be`0kMVI=%)HK!SARo}H5A&H6#
z%%5Asy8iIEl?q9Eg3-Xil}S7wc%YVkv&xmXBn)}NNU+Ep9b7&S;~~amDX(kMy;|Id
z@btmYltOB-2_c6*MQSkfTmy2}aTmu~cz^)A7Wydw;6+io))8t~EO~OaU!0Bkpg*z*
z)~mGKak|||!t%mxu=$@rE>{aJ+m!mrIAVEgU06B+cY^tq#r&>hsmK2;0DO(U+@}l<
z_>hHFy+6`x&M*4d$c~?L0cB*PN$qnHi-!~|M^`5jseF^9l|~WEiwgC%QG}@Su3S7S
zm7L_@O(9C90qqx$WHNE8I=bRizg~{+Hh`66?-gY49BOY|Y{JQtt#&wv#X`iuv!8Is
z5`J^-Ymc_5U;i4D#Ls5NSPLN-dA3{KOu$ivXZik)H}FR#4}E-+((($~Ok=yn%~JV}
zUChu7QHgy|Jv@jfiJ|SWkHw|M#-j|opyd0CB5`|Z^`|~B^P;-XUWI6eu~e_}H|O*(
z5W>no?uVeZ_aRBT)YSuC8Sm2r9C&48He}|C$yjydQFGuQNG&3TDr9c-ghb$oLRDh7
z#MbVphqK*wtRBEnMGGC(MJvn9(|uIXn_OsV2H*bx$v12LzBjYL1c4&xC&`BRorne<
zVs%)4)u;&`Vd=9XITS=|AB2AX?E!+M&5Oi0!z6}aoI2E!=&JvH6;F*K&Pe*V7y@d*
z=doFurJPnDq(3@yYm-Fk)R|Y`wY<K(9)%WU;lzt0#D<;VW5WHUH6=4~eD;*ggy?n2
zd{NFRf-iDehAwJ1+zWv>ECV!&m}m$C=4$uX<My|(izyrsTsc-I@5ow*@28Pej512n
zIqP;zYma|*OYN(4(WI2877>0Mf5oAxiA?FrrTBLD$&W~e%}#(Wyv96Q%{db=h7i=P
zlBbk+P;<S<tACTM^I$3H{*W7jZY2o<cKZCuyjw$qqatnBE|WaIw2gf#OywtHrzO1S
zEWJ4-S_C;1X)VS?Bu$dmdtg7Q-kK8O&Y<c=HRQUOH3u7rg92Tk_I<AAdd{So>o74n
zf-~wR653G+r7IkI`Att(n)ZA+ksPiz`F0d{AD9on|EIhYVrfhsNXj@hc@RwcemWiP
zUiYDP+-*~7O39T}FyRYzn18#Smn~6m{4v<$$&D+|b1)F-zLTIL^-~SKzuXoPA-q7*
z`*VpdISf?0;d~)47mgJYi6J{}f$W1V#ZO9*ydyhGacl3si<ym%{<k^XpO_8p_XO86
zE4dLQJ5m6Cg7}yX8M6SeZ}zS7eZ0sz#K?X?C6$&V`%V}*DeLS??Sv*e5wwRAdO{S%
zqyonvB*hj=do-^tWar+_ocR2^rVs7Uyc*hP*_r3x7Py$}{gR!~yv3C3tlg=j{{&|Z
zUq{~sZ4lMbW4`sv)qr#Of#8jzp==i?7`9~(e2m-H9Px3Y;l#1<R%uz1#iU`%TLwAQ
zRO)s&oZRkqb>8mg(*MToZn*GvhsZ441LxAmIFoxI>|BEw<rSXfmf1Hu1THS58d{iC
zw6?rNsv$wj;8r+_c8Iz^-Y$2XW><h-G`<#CGW6v=XH~{r<lUUw-}pm~<YxN1!$mwF
z&c!6tSjRdve<eFpu|&ot%{Ap6dd`iAZ5ekIeG^|VWMw=hAuh7uz=$BI2FZT@_f)u&
zLeJ~WPLYcNE<XP-liJ6;98NAPi0BAEw{B1jWJ?Ce=j^{$)SvDY^Y>+*ObK+$<A|{E
zI$&qx*rTL8r3BY4VV+kn#!rA&)H{dz!gr%cKHG#6l+sVlWxKp=TvoOs>-=+e@_Y=T
z1RuN$M^o`K$F_9X159@iPGtDzda`}r>;djH#<lq5x(c5-iq3%_8TqA=DK`H>xcZyl
zXhw7(@#_8J$KHL%Npf3|kf$Q1uGNoW^Y2n#(i@Apy`HJR&mMH1>5K`Y;A&8N$H*r1
zC*)9aHddcZ-m_1nR?}T(QC2f&e`+z|zWA`8O@I&zRoiYQpVmK!^9_V{SyW1F=fyP_
zOptgz^Zw4=F{*UG?;RYcMWjmNTtGLzUS2v~KvWs4LS0{Ax?!Wi-+95Hplifj#ivkE
zCGQ@B++oUPRQMN+$H}@YWuW})LY;G%O!(jG#puwXtom!_)5GmUoFruDuTqcDV733#
z+)%7%k|*z}4?)hb6)P#~CLg)u#lNQimPGnk0X;g$HMBz%WD8N>gydt?Tyv~_d#wH8
zvi-&S35Qs(Iqc~48YXO@igFKzw6KTQLrFz$IXUaJ8#!xOOV<{KY_td#8#hk9;7WaS
zE`%``(1TUG495E%5_VC2ArdF~-R@Z!zEbEd8i#`lMtY<J(x`F{jF}|);!!0MY<^kC
z@oh<?$~>HnfC3SLjs%d#VWsKoc(>iO+%}5$8_}m9w;-&}74@S8LUchiFfLIcs2`2u
zAfh6~?OvrM+N*{H;qs6$Tb58k98PYt{gzPgT1Gx9|792faTHQr+D`cW_5;w3HAO>{
zL+VE+a;PnRQ^zMZAKrxgzz8uq?tOnV?0Kc$-o7otBa+v5T#*;35{8)&-3Fz&Cp;|v
z(6qlWq&~xmRA;GKsRF5#4Iw_jVqi%9HzC7<FYqM-2jVgl_&R>(y;&;z8OX6gJ1wC!
zx9$A|wTcrvcTSdOTiWSu<ZR|N+OfSTn9Lq2%2@-N6@N|_ca|upaN;OcYty%PFl|CH
zRlS|*^5g5+5(&`b`H>SMLIeD)_dDcoHGG*`tRB8@*+Sq{9;eEo7Hv})$G8;Vp>oGs
zL)K)Xw?y!EF7NqAN?73m4$J|E5Hhj+-ITPG76Ty_(J^3if(H1yfcm`4ALT|1#0;Gx
zLJv($$B6w6dl>m~_HXVpNvaq|$v-#ri>(d1;1$ylHf}9#`int-m4vM@vJpwa${;q5
zOLCU4b6N2uohw3<Xs2e<_WLQ2$SY?`t2D&0IVzi(q1kg-guIh8r1O`Q+b(a69-UAV
zlvDwTDn?xJ)F_rUr?wxUu)^bIZQdWZJ@OB)_;LS;0eZ5t*N;l%-Cxl%34Wg?+^-82
zI45ZslnGB@on~^bjwST2>Kva%KmsntdJnX44U*CP;-;`q*j37O?ru=vj+pZ(vU_sq
zA5iVsA|1}rgwFv3v<qTGbT!uyHz`dYEWy}!&bc4wd-R&jS>PcNs5ru@=@`tUen<$x
z|BZEz@b5jP6VY_?$5+?97QEj9=tOdex%B<}PptRxoAuFS5&ZYNCC>Qj0`KLFv#nDx
zg_oTR@X4}HIAA!*emJ5fgEVN6@CY3CV<N?u_0YcZfzzNkZ0GcevPo$*mrA^z^odU!
z22U=UpK$4re6*g9bR`m>b_d!s7P<-4Hv7pol)VQLYL|eO+pJB7tyxRyHg&`>>^Dwj
zs?uX4D4`~hC^kG$OAtae0OU|Q>@Y6C;B5TWdw)aFg=Z4`)BDr3k2Ai1o#a260&-F$
ziHvS=i0ax$%rL9M`W-J3O#d=%RYfZsC*VcQSNmiB3q6w%9YI2!v(WEyWtsC|puz>o
z2$=sur-}ON`(n@>CX0)q+-7v}voBZgm4wY*iDxAmoBs`ZzICE=<-Yu0!oCTTX}Z;o
z{HklB;`pp0*z9JD%pSXQA68pd+E>R}M*eDEn{p^=6#;XuMdAMGT=@&1A*JmtQM#x1
z%1XsO<~htqt?c&H8a41Esk)YF4oFtiFn&Dl%iUc&?jBIEQ8&aW)8ugeH3<WBQg9Lx
zEa8&$E$`HiFISo?ai}EQ5Id>Rr2~&|02k)i)W1G7N|=xQa&OLo-sd?|#cuktBg!(@
zs)r{y082L$>{0p#n*@h9A0Itt>ZRQ<Te&w5gVz;%<0LHoIrj3iX|{Qay1l7qMnTaO
zsg+z<?4~U{k>!}3ZjL>qLL#eVrrPS)#=3IsW1o6PRNb?-8+%V`&RYYnMnwI|iA7lw
zmgd^7TY9O}dtW#tHaH*Sxk+MrkFNAq-aKoMT3n3nxaBQIm%$90RXTnTBF)Cn^5i(g
zy6-J~eD}_H=8=SLN-mrY%*X{PiF#AM0M4Z9sz3D7*Zm>yjV>=6dP#e;_bZoUNk`5a
zai^B9^LoWP!WtCdOa8fQ8<V6|{`fA_fO#Zwo1Y8kzRM6Wg@*i7934b!2m7BC!k{_6
zHr;}EXhC6;;t6qcjg~7}H44QQe_lZ;I7d684>FT|_T@gB(KkoC^5nYNy=#{xjC6DI
zT#^!X!amrjf}s7~nG&8lW&N^EZ`L)ZKd8;HSTP6Bm^?v67)t&~*ah-S>QH7*l<?Fo
zo0HPcll#2it7H_B7}Hi{MSXr(U~p<)heMvEybgQwZO_~`J4dhS(^M8246L2{yrq}C
z4;Bt5?5{j2T)DF4l=U=~#RsRUY*{pI#o|TN>in<dhb<&4i-0Y1xe~C`(Q65R<tnw4
z0A_T~9ouEyEo-P_L9E0NlpOZ=;@Knv@4@HB-qx~@1884M5Kp(lI?)~Deuf9sXl@a1
z2N7!rrBYf{s*;@NF<;J~+J?xRINM$|-Fk(U!H8PrM7gT!%Dv$^ZN~mkE$t0g0N<;M
zlfevI7-K7^JC31|R*Yc!>^|@pJkxM9Hu0Zz5&R-c#fUV6^@oPw{d>js3)7LEJ^qw=
zn~DEL*EMmDxk^+s1cTAtM87ZLIqVzPnk*5qy&S)ZV<YI;K(c8g`qCJ(>p-_Y3YNVq
zWpo%DO4+Pq0rnB~E~XzF{Sq#&<Dl2Qs&o!<tx)rx+Y4fk^KM@0KW=JH@OawCBSmTx
z8Jq7k8kJ2wkVK%mdA4FLDYCIMIUcT%6Hm7r6PD;(X_e)fFcR^Ji^V}#8eEwsyI4Y3
z84LRYvPIVLw0O%lPggy{GD0Ns-y|S;AfQZt@8pc-M^H?&l(jC5{np5MrFKLvZ{c^^
zxAEhBx3{&7B4!am!nGyr55yOP(x5G|#E=F7&}9)R)JC-0N3Z_{otk)Q3gM-hADtVd
z_VVe*e%K0)1xsOL!4j>8*X>)mo8`H%Dv-Q}b`>}@b4kx0&KU#y)4J>e#X)vk-b!q<
zp1qnAgugWO0z~bKhvz8C5OH<-u*tSlYW1U;lgLyLns;akr05YOM3q|l&(&Axv}j{)
zJL9r<!shHV&)M%6DtLX`HtV1C{$dtdJJSqS?MDQZZp`H6>U-kN-pw-dN~g5$8pKvj
zIiZCtJyI*9Kzusg*frG|?=Px_F__vzS|A&?G2!~Rl%zs790~gnb_KR>0>+yIiB+3A
zTqnHdbmS9bXe!W}CcV$h-r<BxQyFn;+*+IcN6%l@$vTh9*TRfMRLF>Q;f+t66#L}L
zfAw>ir&Qht*Y6tpq}S!IGyQUzL*^8E$tV$6jD1v>-lT^($&eTZMGb;BP%gNalefr(
zvP`og?fv)4a-<Pf!fYn#_;jvXVMqG#@ii;N9{s)Y>yw)>2%8XGhTm`1M?Ko|Y4eN9
ze^$rgv#^O5TQE>08wr#E)nggsod2|wz%1C(ZjpjA@7~`jmHIKRt4$vBHf_tEsGQRi
z_0VNX`EfESV7g#Zn!0B<#6z7DiQjFSPQMgeuTN^xVwSe;sjcrb`pul&Yp>J`y}eAr
z1r=zRK)-tTKOVBjgcOjGZWB_JY<mn}a_HZV*Inp)%>rY>xVy)C1;Jdsxhbp>nbwng
zm%JP0zo^u+aRLT<I9DJmBM;OP9x9BfGKnWD7gNz}f4GTr5*<7OW=HNU^gQH&TEYWV
zI{a0Sao?&&VU{V2u^Yr|@RmZw<7f1UI(s&LQmKuHZIu{A)D;i<t7bt~FE=wUj~43e
zz}d8=VNHmWVZnibVFVv>dD|T-?AFBslrRW_Fao3wMc#@Cf@)b11Z6WZnGy~Q$qCOg
zgKz88LIlmFN}oZ<>OSV0I0g~LqLNMa5HgSq)K9xov2x^UYAJhn{qoB1ng-%>{Rh>Q
z6uvvte9UDH5|^jKT1+$(KME%(9R)G#s+>a!sl0)?MpZzTg32AHf*%k#{AxjWefzKn
zRWJ?rIrpl~%KxAjv8mY6t^Z`~aOIUfGm1JfTF)Yw_OM<??eWQ>sExgJ8x7kn8YY|h
zTq)%qlo#m9z-N(@*Du;YbeCtuEr%Oq;BQJnTl9-A9V2?&JX{5L-;YgS1v_x6JPu5>
zXa+=!CfN5|ABI`!yTf#nu%vjZ?$uY#{=p;6HJ;vkSbDW0j_5)}J<QISmXpg8RP2}r
z|E$Sq{Mpe#FvSd09R&W(G8#2;6{zg_v%$(bc16$mUq@t0Se8&vc;Nbb^Tb}uoW<wt
zdltg0n*eEoh9E+X*lQ@o5{2wUX3hV2DpjW@??HfCr!cB}QTg0iN^{t>U^6x9k-f3u
z<NMER5`COh9~5n_YWk`3_VtAmxA+w)a#4VyaG1z-2@ar+IE}EbQkQ6bh^iEIm5X|;
za-3cDwEx^9p-=SUCsXuS@(!Kor4~IgQ_*Qp`{94vpJtO_(Ccmst3siKlZJPr&aC3<
z%6^#88PyVSQWv%!XA35{UAbW8PI@+E3Wn*RpmiXm+{*~3gB1w5zJqD>2{dYI*R-%l
z)`Qg$5v)b8UiakVd0zQmt3EO$f6F_}!eotW0rB)e*Mc&K>F0}6eq&%aC8>th-SJ5T
z=H5&?O~>-l3+w72P;G>tt+sys=zp+_13ojg99_`hfm^qTJ4p=e$cvPUPvhUPu96#C
zCqKzGu;S`e^8N6ow_R#VQ@<*(*1FaqE5zLn3PzGr3;ka7s_e9+mfh&N)c0q8z4c77
zY(ML(Dfgq+;WEw0AR9E7K=_b^XXxgx8M?2Nk7!Q5b7IcUK8(T9;{wm?{x1PET{WeQ
z`wi{|9_TSBWxvkR92dfQ`tUfE7kph7`YT;(ta$3%>Mqu5g(8MnhNyYw<k+w6OPLpB
zhK`HTNLlv%pYqjlj{I5``HB9o8L5EsH3<R`qyFe4Vq?J^aleCY12g`_Q&ueacQ#{%
zSAxoe4&;K*pX@H4(xz6{S3abFIK9>PO<gg<7?nuT>VU(K^TqBy8R`u>tu|EksCq|o
zz&81#wqM=ifBY;Ya$E`bO7a<-Mid#LAIgV)j=C0yh?J^p!yK)91zKmVxoq#6T)<qj
z&#@kf(RA7#r6uSX?N?edf^kD?tc0aw=-^=W2}KdsNPgxkUq!{N%Uw1mGavkHeAId}
zEL+IGk|Ao(eGM#bx)fQ;OjKL?eR#`0PgzNZR==Ee$NyA&9OOhBF@mP4JlQ_(&-6*J
zD_E@fX)C_pWX0;jFnzszAL+N7kXAdp=J$~f<kdQxg2Jd8*0`f(r>0Kc_i9f0RUS^s
zIoqCkTu)2-)$Vmm<vyeF=LNr;qGa_Jv*7mlxPAlI#Ylc$X7MrX^BDwDARj<r=@Uk@
zqS*6^OE@g(cBYyVk_xjz5M``N%1Zx{j)9gW3P}RRzJLXhVGa`kXAk`n(btDE5K(Nn
z+f5o0n29lJTRnQ2N!5&AALx9i@~ZhGR>cg^3a#ArI)N`3$_ogG2BiGsLh)W!lR?4W
zuKPZz3Hhxidru+Z6(r2qbd@WQFYOi7qJ#qqYLpR9Sx85TO|z7zC2r5C339s0=occr
z())wnrjpmJ_j4`?MzWNnPv``se9Nswq5r`XLy=_uAfX|C^HUf-`6qE_f7G|;6!E@w
z4H~+$A4G0Ul}SmfVjq(cB|J<EALf@PFB`ttC1&K2@~_hSFx*l25x&WuQHdL3H{Ci_
z(xJ|JF4Z3GCM~$6&@7O@Q+Oj%?=d3EB|hFry{V{Nl@Mv*a<d#ix{>|e;BvvOX$}&f
zmdWneGOVuQ6USTLA4T%+3We^)sUK@d_(VTTWUZE`t?JMgQQT9X{A~Lb)1fDl(TsFZ
z--%}ALCX?O!x5ECwNP|0EFxSy^QJDRA(kBYrz|FEN+F1bdJtmAuu8&d7AO%O8Cm*a
zwK`yRMMps_0=;JV6VBHA)fIt6%Qm%EbB2jFf^H^`DViWRQM>4yIO8hD*O+@jul;x2
zp!P}Ad#gvgT?;-@;KupnsRS+;Vp9iM&VrDg|M0_V&Ij~PitZ!4yQ7`MJ++eLxJZ(m
zRY?+rF^a$RpR1$Qo6v#u6oW1};+%ExrYxSL{DZ!o*pt!FnIjg$Es`G+&R4SMRBYmW
zoH8d$z<m)K2&fy~e@p;<KTk##iG)o+8y`_Y>Dc!`^FZNbFgw)aLS`{fQPNS1o+B@H
z$FvPbJNhVu!G~D{nY8g1ve9`PMifMTWWK_JJjubegcLN%qNo&$yYf60%=PIOQXEG!
z!N_qyQ#*I+(T+{?NpKBz&LF!99)7m^cC-oifZu3jg;>ba7JV$Vc&&Csb9^4b)%mSi
zb+4Ia1Opc)oX{q1B0~?tv_1d4jnu#!iEDSXNF%S?$jqPQP4t+lUV7u2*0T}WId{Yz
zsiB5tMS#y@*TrO4mR@^re&kTx^+pM83BRCMci;JQoU}PV09lrAarY6K{gUa$|LBKN
zzBKozn`W$_dGhT-G)BtVPv@n21>aUq`JP(CojT4cQUkeGcC-aVsc>7URQRd9p?k--
zd(4}>=owhuo1q#MvCeh4FgpuTpu_8-Gm&(J4o6->ZXudn!QLb*Oom-@;gg}s_3{mt
zcHv16BU0!lXHaGLThgB~jh(TCW>aIYONWnWxvadS>;Ko;na4x5|9{+;##ZAdQI<&(
z_X<fQvSzE?lx{bbvV<vPsWdIJ4N<g6DkT{e-TS>1#@2!&Z8Apg#YoXgx0%#UQ<<3G
z`}3I@QR;ht-+$&YXU>^p24{J{-mmxbRjQ+pH-rKE_r2^SmupavSs|EGWOSpAHAM7k
zfMBG<$yb%x-R4z*-sVMwULJUsaDGxk7WcGmJHcv-j1aShZGF@46URUhN7ctRlM2aA
zgoq0dyrEJ;!}j=QaO)Le5q3f2Ky!l2earKV_qmHZ0-uFv3bzm+MNp=GZ)``nuL5C7
zwxdMhoWVireBqv}UHD58&LIK*U7hUpHVAHnhacN~HK_ZqIzjF4XR^LRBtU!QdpJH6
zJMj`6v8+=R&-G;EQ_!xh6DJiGLmP8={WhG<z%!^tMlvZAL`gpvJMm92^pQHQb;<Ub
zxL)uU6klfAXxG8rkBCs(?G>~RPyJ{jpTpgGAlSj|%$McmsHG{qcuNrt%%DOP>ec7o
zqFuSSvTt@9Mxl5cZQ&%7jD4Zrj2UGR`#VKLaiiU}+L)3vZvj?l`vzczzjlnwfD+Et
ze@=+1LWO+(&_D#V9{-(?^I3K2)ailx2m7NE&!@8--VCO^Q{7WrtFXt%qv~giid`iY
zU;xSwS6;yOdW4Rn8mH9tLAz7H@*_XVJ{3xb6w)nb%|kSI5O)Tr-cGer;A=86&tzn#
zX6+8y=s;EFSp-_R%(8$L06OAOjMpI7P{l<#wpUx8-ufV4TYu^nl?YFp_Ln+6=bnz+
z4=N~WPidciFSmNu!3`Oc=jxYisSZJMvLjgUBM{%^2c$hCwHduS9QcA?5P@NIdKRHg
zggpP@?*YkHGY&l<@mBZ@EtW^27&RdJLk{qZJ%<-TSsEMb8!o+*VD_PC<<WoI!{b`2
z2!9j6Aifnz!t;=QUo(#CeUo8<i9wUV8GiZH6LuyLEx(1Z?*nWCz?3jK31CVhz7l$=
z_x*NWAY2S$$hO!ptp<_M?v`=q1<Ymki)AfH`|RGXim~1G2Eu>A!4zX0@Wy<MkjIov
zPeii<qwW<1>tWO;?wUp$oEkh6nb<2uj&=~IU67#d2tdU@5$Ngf?69EE;c0r^<5XbO
zPSIdl9g0tr>Hn+s7-(8y3yVUI#<nET)6s)UT+2S;vvi2a66(@pN+y7dD(lHyes%g@
zM6)KQtD*-zFz^eXja*cz$lCAg;PI4NRuhsLZnc_i?p~2qz(JDtKcR2I<MA^xGXPYP
z<jfD_Q0y+cOjfI@VYWWExbieS|M?F*3PT$P_RBRw|4Jxl)IJR1%~x41Gx186CX5<9
zWR9EH&T)b1h3!^Wls^KKVajE>+v!p#kK8>ivi3)G+KbTYHh1L^pE*t?v)Vb4`f(3b
zVD{y=JhTCT0m=yfF*seRM6+4QrOVm@g_N#;t0X2!Emk4GM=O(3*&n<bqq5*1WDcTa
z4Qn1m%G1stga6@px-xWAfQCeZQ4m>s;V4MTm#Gwy_k*3`Up*bo!wB;#&gt}UAET#o
zCDrkCXt<UL3*lx3-Z~|X#Iz2niMj=sf=&(WfG`Ei5(4ckL>m&1_|6=$1jf8CP@<5A
zXn@iX10W3%y@eIb>$9v^KL95m4JWac4`2IqM0cN}t7t?}7+i5>CDaIhYI&5K+Fr_6
zmV4gfd|F_yta~3URqL%3oQNUF3djZjU~$%Nojql66~2wG!fdz-FA#5(N`Z||3pWbT
zAs1)CLkW7o&%U|%p2~B*>^}wNZ_sA%c7KQ(zBGv>L%M^+i|6a2Gu>?`K%ul1L4n3H
z0Fhz>6UyCSn)k;ocE@cUK;T3IG1O9{R9T}HPPpju&T!Xnk5aY|%SyX@gY3MhC<u57
z(Ag&kfsvjfMIw%|FVS;J;8vTuyC)<med_XgZ<O)z{oShQ#=*HN^>9tq?3>;6*|mz*
zE3rm}?X3Y#02~mrjB3FJFd648!gt85B#VmBmJO}2Cr|}MWhN+KBkT*6d+8ADS|O<>
z<D*vLsdAQM>t&%ougFgOw^`bm{A?ZY?}N_>tol$wAOuw126=Kyvo1>&Tl>YURN;m&
zEi2a?Oi_N$0H|NYZ3hn&9%IWuE+fA%<g|mQx0##!KXJ1iQFm=TqEw-+>(P?2GYcUZ
zOjICYkF!Dg#YMQ#Wro#u$*O2{7_dL?S}kIZ-mDT<jKgUu1M;*}vPOu|D~|WV1Ibqg
zVTi!P2=0a2A?YKD_ju#IoJs@%nE5SPJ72g0i{9-!04?PtkpT70e0Q6a82=evYiCOR
z=Fyy!0#^X+aS)Y@4X2QEZiHbWuol#Fuo;PbbZ8_7KtLj+ZsP&b$`-~!@rcZ7R0AiW
z4o)p>%tkdTr;yNJ!~oc3g`|X(6she8_Sk`6^Q29iV)s1#z^Mqu0cl^;3g>WO_yL!_
zaEoIu8e1R1Ucs7D!@Ek}GmmidXQ#8wPkgCpfmoU;)~o5|idHa(BIjsNlx{lxys%(!
z%50{FrggNmyy{tUpn$OsrR5fdLJBF8jUcJjW_{vrq#NyqlFNy-=Wbyt8kCWy>51T4
z@Xrg_EudhkqZr%aa4ksT5V5!rre}8k7A?{35Y|}UMxTtbymKLQ-9nhqu|qtBrSaM@
zY++7+985~u{nU&>1jeQD$e*K5Gz0r6iM&1$1efcI^|ADuoYrnb^^w-{m(Vszj#0KB
zsE@Y2gJyHIQH6K=fWuGG$kfgoMFA3O$p;s(z;Fulb+slc-oKL;{s++UGP8E9m()}|
zYAlE(98)dFLCDTSE=6p5s^58mkpyh7g-wuSW6-{raL0>h0_S5CI5;BU@EHTFi^9Oe
zB5k3Y3OrCSS|rXCtwh0vFScY=YA@VmkxOpeL(eX;a+M?|#_8|O^>dDR6;t#oVutk<
zJN=vqmp<4=1=rK(Ajg#ZtV~mKh?9qtRp!0(J!w?)vT46z9x8;8?)waFLzc>;Tie{_
z=F}k;77l9m>h5jVcE3hhyE%N{^O>bwgpg7VoFE&5*J3{w+#Ms>n^``Nc|OO><AB1J
zfYjlLs=>vBdk;yFew5U5y?oT;*vAieX7@{>`&TsLcC!jH2r)q_>L*&X1?s~5iu{FR
z!Cwe>REVhL3HDVy6DN9rwJ|8BP}p@+HtWAHTs^E?*>|03bmvu<tOS7&>$9}QQLul5
z-P1hD@wXopP3SG%WcG~i4frV0p^NemQKzInS_w)sY{aeBAvd%PQUIWaEV^IbNeACA
zaQk93y9ESIQLfr&#hI0XjYu-FMEDe*DVql@^wf^;GT9|PDdV@oE!%jXP7OrqmrWx>
z{VSHKj&cc;hn;CkIbu3YDPX)rKU2J|@Xj5bc<zU~k0vpFR>ok~-L)LjU68@!r(bd%
z-mhCM>+x7lp~K9$@1M8*V~tMNIi#M<D%}*qn3U624!Fnt^7iwea`Kfv&go>QcwAC4
zI-TplS`Q&@#6ITWxZIi_Air%Yx!9>>YkP<8s*T`E+H+Li{_xDx1s#FL4i{njnQP$g
zNh#7mx4q_pOq1S3+Rj^SuNy@TgNoB@sh&*cW-oxSSfG1sQer_w_YL>U0zYrMC2_5t
zOnlmszFJk^3mNnG)pY2xkEb9PQtJVBtv-jX8<2q)x7Bgp>MK3yc-rO1Nh(B}7Pn<N
z7_|p(Of$V3b(7<(@?6iLwqvpTvc!v>8BtnJcj1{ATJ%bW9pNRsx27cez@bpt8Q}jR
zP+n}_m^S!Ry=}NcywV5ajR0*%s`}A}Dt9>RIhx&Oy((vFEsUe2<xF%uoZ;K_OHlSA
zWq)|4j1~{Q<m9N_(3@2YdB%IyRp%p*&d|y?|6w%dsujB>wh$q*Z3TFFq}aNS!HKZ>
z<IAv9U&`R!!h`AJEW6x-#g|Z)-K2y`Cf7)Z559W+`j?=vgN)bn%=c4ef6b~4)3}+}
z#JpOxp=9><zv1ViC5d-0&Dzyn&HqZC#y0!u!20I=x$Ckjji;x%GahduPv-9HfRB{y
z-%Jj=o&)c5fDiGw4c>v*<s+w1(GC_f8VU|sJGI1|9wUmxt<CT;PFlwH{W)gWo_`)_
z{nN>w1N@^!5N+L?qXHc{uKR_9<RF97ZceM$dnT75RMLiWMogj~GGrRHtAI%{Q4hd*
z2qm=-v67xYWDcrh(A14+=r;ur-G5wlg#c~#?a0Xb8sPv9VNcYo5(8N4eG{_Ip^YuQ
zRE1)2Ou!nP!jM!(D7M1&<HMdl6mb=hicCR=FrXG{gs6oFt-TCet-3%kEf1X+H2EMu
zZ5@f|99oI?k?%icRJg=TA*5k4gq_F6oj8><nENR9le$m5NgwmkW^#7azeTtVnf!w(
zz>FDkbBIcC(P;?V4TtICaKjLtOh=tbQX)u>Eqz^)kNU$nY0@r1Y8|msaVp#n#*A+R
zGlV_2A$|s4%x@NQZ9xHk4Jluz8eg&nAP9bAu=vt>0N#TC3;RMrBvhb9GpdmpH`b2m
z*mQ!H+B7(&S!&IjBBi@iQ%?>CMJGYW2_awr<YRunyfsG!S{aL$)SkKzS%oknqKY~j
zc8CcAU3@O;;+HTc6X8Dvq!KYT3BQ?H6vdwgK~iFM>JnN+%n}s0*4<uJIquo@(5i7<
zba{qh5PRaj->>cSfWQvgY$Kz%D5QYyJOS`p4n-AmF)4VSQx!T*6r5)nh}utq$l3}I
z;>dBdNX4-7&o`CPpqIZv(b8~N32Ln2kS=S80!WKUU=hEW3^pcB1zNvnBGL_1Bz*N{
zPycHA%f5#KztHPhyIqV^ok-g9v!fXApK;s_$^gWG#iEx~qo5@V4d(aODZWf>zM{)t
z3$~Q$74CCOls1)&urA=u|G-gN0GGlJh*8#KTZDAEK@t@#6|4jPmXXWuls7<yDCB=7
z-fn&yv_gvO?R3>&FKX}xj0F)+r2DE9CLi%VE`0W17eVG6J<B5EezZ-H9Fl~fghO*-
z(4`Qotu3o%fRT_PAt90Ao1u5Ue_LYQ{8?8o{^6^AY~oGv^>>ti{I9RQu#xCehrAI(
z>N9Y==M6I?j6AexIz0yEjxcdYlJ&FN-7%Q?%gz-&W2EADmCtlZ`J$8sZA+;2j`}_R
zt7`nkypd>e;Jy%OpXjT9Y1w~Lj-We8cesP}m-**Kj35#27rzC<VndQ45f}*LAWFU_
zhr6nkVe9y!CN$Iw6X!>5WN=;3p*1R@CmR%>1lj{@&Gusv$f+dnqjqW8A4`6JpKU0e
zF018rb!>c8T6FOyFah>9KH+3yKMrmb;(8YctU>$ndm(AKf_@iuGRjjv)boHj%%E|1
z%ts`>Yaw@_dL1RN;-YIgl<sjP8QT1um`uRxzUn&LG{-Jhrs)*}E{sJGSR?c&eDQ5t
zun87^2oKqZ8oh;sZs2}Ir2j9FQA(dJe_tS`uvYyJaDF-I0&}djp>w>?A{RS%!4dB<
zKO$Cy>)Ol5!Y$k5z*>|A=&CBvuhP%pHx6@8{F|TKa-@5>P3egx@CM-vw0!ZIDy8jh
zpHay&kR@)Ce~uI;*#E$K*Ke{?@lOS18U@hY6NL?Z-TI?~gd-ZjB+zuNK=ly~V2+54
z`BLXeP4`7dH3wQA>Qtl_S;^RU@}?n)Eg?rgk-6T<4ANZ3+=-7@SfjPO@25Dxim$WO
zX!^9C|FLquwS4h$jZpGJbya!$<%zqUVQ=mZtf;oN#UbQn>Z+4bSd9a`n1h5RGW-bG
z4!s0|RF1MPXidVGmM4}PJy~nh?nanLStQ;U>vu&UBs9rE3v$f0(^>>z`I`G&zb1Qt
zSh0)ybXWLl_Yqbr41mxPn<GXtB>K$wA1oK4%YATbFWcAxRILjDX$ME!#G#3$?=13b
zn4$MjQ3^_*&tlV8FP>&+7{AH&$hfLAw)sNnu2602YW=EgAkJ9BpH$xlF%2lyVb!*G
z5Y)giMh`kfKut=|`fDHE6%BOhu)P`x@&V{YnDP?6=zv}nZi!#?pthhG!Sl272;@ls
zU${JuAC5v+4{`F#!OH<i0+drF<8S(Q?pC<&N!EL;L7l&~-o_8BVv<E)=R04q#s3_{
zy^LJ~iQ?CwZ34MVrX}5P`?>sc8psX#T^m<Ept=qMYYzYZS_;5P5IR;*qQ*pJ!LP-#
zMKOZ9yHYc4E?u1(r*Qh>#5Jk~-ZDql2f1l7EFA4E0-A0-gz39Q9`373&{DgT2ebh$
z6MnqSd{u8mlP_ijHeYC<aq`)DzynpXfPO(R1R=1!7}@^3K>g>?DQGaC126Kd1H%$&
zp;fQDr2jfuqji(>&O`Q+`i|Gton%`yAL$3C4<C198mHRKw(I%}Gx}obF_G_?i9taE
zb{R|#6c837-Fz96{L>M(Wg<C-+Oz^an@;8)q%WtJ8jIJ?hh$nF=X8NxWW@;?t}vK3
z0LlL9h#3R=u5vm8#{?ix_;Ey!L6UD@)_})m_`N{G>w5A(>=)IHUc1E#HDeB00v0%M
zixjuWq8&vN?}zRLR)Hr#=ICUEy_ack3@!OLX~k+X(^&wwnjy|A{sH!Y`XN2VR30SE
znM=gOzeuEMT4igDe`xIb$t3?ihx&EQvOkVv>Js=1<w`Dqg>+;}a+yxgf|0T_@R48>
ztV0X=`q}O!pFb@QNp4T3&qf~uee7%HjP4nDa2P~^vIv?&#DK-~jxL{YX?Yo2LeVZ0
z(bvRp97<Pi9VDZ;W>MBMc<QAJpgl6IYXPl^VKERbpsu6e_kKI8olWLa+;B6w_D2+{
zk{NSP{K~YcZXCRl{`N<j7R0E5`k5Hlvv`x!BA9MCb@dsdXU&ar`?$OMpK#9!M|~TZ
zCxAZFkr1$w;qJaNaSq>$kpz9KLd9V7(s5Gth4WSrk_`c$6<T8o|CM@%wI`wq*tJU`
zzq&ns<3iS{$Of$gw9tjDRa5n++XK%jSD##<oSsH6b?{h-f;tT3QC@>CSs-sOZ1=(3
zd*QibKfLeE(99In#!vAGr$3`P^-?4Y+-0_+IOV^8fc{8HgUx=1^`kcToDY|xgR+ga
zIC&n{u(Z9U7XUc$q(WU7-<+s#qi&zsJJVrPCShX&%57e-3FS6_UJvok(^Se4JjqJk
z{^L=MF-7o}izpEa46(^Ma|Y;HsR-nicGZ8%>uWw)XVoP`dT#=EdrTO{Fv*dPccz-(
zVFo&TqzM6UKy+IwqP_*9*nztU1$SH-B@9f{zs;mZX*CX3s$eSI*d?BJk!x?Lz(@q@
z|A@8`@61MN5qe`^01s~GGe9JsrI_XBQ$ZEfU9$W5tZ9q`p-tER(oIJ^>Gv505ri=4
zm?AOna#I?$1wsGEBMkcc_wB&aNA$#RDtmYWkb+EFF9QU2BEQzly@dX<O$MuUX|7f;
zLoPIQwzI*iTOvhD$RVw4?o7%7_H_{RXX%Os+yr4pFtY24BhgTB8Xy?XBjE__y3;t6
zR+zrVscD}Zt)iOqoA;}Lu5f8XP<k<M3Ed&DQ|?134GB9n2|p|E2QlW8QXRr2wH^4W
z3ej1WYrY{>;oIfi41*M*f%u$n(ojA8<&Ph!Wsgvu^NTE2`2|%1_YeUa5K@`z_C^MD
z+26aS*mhjiQ9avy*Rn#9izu@xcEk-qjtJeaPDFQmq#?IjtkC8zHlWEO^V<0f&+>A>
z#R|8Sc3`OI_E%O#MK46=wL-WQao=$>&!OBR7->QK1K&Nq{p1k|{fFVqhQj6-Y}47?
zd228wcgu#ZI)y?aNwp^H6~&;v$9alqYrN-%Sh}lK=74ZN@VTtATiN4b_A&kR{0h_!
z!kNHGos~wGyGak?#72CM6MU{O-#y}6U01ySZoruDf<@x%CPa=~(w+zKyCF?=oLm8n
zV~xxG5h@`1f;NuO^F=@BoJM9{a1V$%Qf<ydTq$$q<)*blo`d^ne1~9x9q8O>el-Od
zbzi=}k22t)F@zWj2PEyM&*s1syvuA3LY+XCv)Z0Al_27E6v@CzO`1ZiAIsg~e2l$9
z7=H0tGXGksU)%kJ!#|?|38!SM!V}uJqivakn;=rsV0`(;<gavnMZ)Ccz96~Jsx972
zujky~bQCwR*v`Ue$$^3_D2)9l#3Hog{DJ=du!gR?d!e5$uXUE(oy~^ox~>u0VkrLo
z;^U;~%9DkRaj*2ezwLa0AjZ)H$-hxEdZPlq2(;XmKZMbd_(*cpr16)uD9JaC>DT|W
zwXU39kL_C{>&GG4<{K4i%SCJt4!Hvq;o+#xZ@jN`P}vM&za&TmiEBp|+awNHY>}L4
zWMpS=zqK)-LSq#wo#(ua<V70%52a|Na)|-7TXFe19M>|^&!k5i2d?`XfUkHI=1R+1
z0_AxU(NC@8YOw~VGc&W00WNpHAngA1L#}M#55cb+Ti?Ym?#aSA5Gh!s-vSy5Uw{7g
z%wvWJ&V4+@-Z7v5Xz6S7YGHW%DzvjwWF_5*b_T{LWvf5X`&OVkOfWtT+^vF(&=kM|
z$kOH<+L8}E?s*dX$z57UIju$-4$yj{s^YduOJr2!1VpN(`ho`3x=pkMR(IF}h$5o?
z1u&DKEdeYO(c1t>LJledh=^$Yj-Cq*pif={H3}@uiBxp5ncZ4$0fvF`j{L(^G#3H5
zzRXqHuc}SsXU`Z9m*>|cC#z4}$_n7jjt69hcM`?_iiV@K9WROPTJ4bW!lDWgW(YOn
zKeH5YUt^R-Heab8$)A9Sn+1p*pRAUTF3)9{(sjC+9cT>GoD|^G!}o;mvi2oR?IlBD
zI`e1G19<Ke4fKJ|=46!urv<K|GX^ygm&263orjxM3ZC2_l_ArORBlwSYvJ;}h3#k%
zQ}%IL=*<NZu@Z{c7teoZtTa|*7OTi}aE_5nFp0b@F@Qu~o(O$<{OrFi4rP~qqYxb#
zl}g2BX_Xxd!>tH8`UGA?#XxzWj~~4zT<J<zJo~_XUMjcuJ@1J=4}dG!LH`Z@1B$#D
z4hx(Y0%`PeqtDols>+s-+jP0(LM3E<CH8Qazq>V<xs|44sCr9!?-geFJbvY=N=ub1
znZ<S5{e$a=TO}a~X!zm??dp3s2GBDjpa_+zxXi*TFKUK0jJM*u;`9mdN6i^?daEES
zmu6*3k&ag59P3kwHe7Q64vDV~0sU)Gtb<6H3F&;vIVO^LFbQG=3ITel;!xnvcUvN6
z0zyb^$r@M&Q9RXW1`bh^%#r#k<G<6S^H|J!Jy|{3=`#wu&U*iudpW52oG<wHwSPT4
zE(D!{q2L;BZ9Uz)<iFw#-$HcDz|wK3$sZ3*eyG&;WN}ddEEH*9@eCtX>?eVTTiS#m
zZC{xC`gK+h!1N{V=_-Bjl}mxXFuOZ90|A@-b$(0B+P@blPUd<5Y+~aV8E+$b0R|rc
zmlVnekgxd^WNo+pVE%}8V*vseqRmw&U}O`9JYjAV#y=@92VaB^VnB&DTu41y3J1RN
zGacI6dt6cV@$-g5?E{nQr9yz+n=s3D-L~vUM{0|J1=sn6Q|pO1{ct=&@0U2#`-OW1
z1bPzlZ{W!N`fx5bW!hK+?9}lxI*q;53=-HrgJw4(CyhAPrI0U{1umUf-!@OrenC)k
z7hPN5aP!0eQB=xzJU|`hM2CYJ9JNHTfNBp{AW)S=LNE#Jf<&2t`$GdWW$7pRVb7(O
z$r*K>@p-f94L)q3aD`s0teDWP24c-{_xv#A0&JvHi`)+)C=8hC9~yk=ap1m-f|ffR
zj%dFqodyM{l8^d=9&RQD!T_n|UJ~WJ;7(2U?~=2n8}mP9L$hGS`C;f?SWDWg7)+(4
zDZ*WVFg)k;nFP-JUpZIdA~8Jc3ycq<;X-dTO~{GvKD0Ru$v28ltJ_^xZs3O*j?p#O
z$dmMyIdLI!K1?yCX(~qu<PKVEob$RpxDO9^uiNoqHgjz>^M@}y1j1(gw4v)8bm(zg
zUVQz-ZF|ev!g2ARq92<*OI~+#Zlw2}-S^WGpB=13#>#!u!L<w$If?K*qQ2>H%zCDe
z`y)(aGs46AaN)z(y!>z7dEvE8G*b7OS=%kx0f!VqwE>rBxIy)syLyOcyIg(M68%U!
zb3G`F-rIV;Fg-iVdY9x(8`n6KCy@{`FdxBXOg9Sw!HHDd5ZZcjAUYk4`cO}d{PxrZ
ztn6z4uYV!Kd<?>yi*BLuACb)9@IelYVsubi>5#1%G1}?I0XPB)My{JJI3IsaluXu^
zj&LiTFjyUO#*LHjxNbS5SO44DZ+S2{gdjUUB2ZGl6)O$UKry8p563yN-g0}FA=lD%
zFm(Iu_&Ci<Dx`bC)bZ6TE^5L37`VQFk<m1FLM7){RVlhN78k0*>~7o}g<(!7jv-$e
z2CUaQv3xy;wN-?dCNWMFPpIJ88bew%_?93MLsCK_j#SpdwLPA7gy41c)is^+@{kk%
zzq5kaj86n?AVJI;j3V`X@EoaNf4SFHM6<K^ugM{7$2Iys`V7H!jkxiDpS)_LdN!$N
zr+`;`u8jhy{CI4@5{;w3D?%OKp;A|fyZSCT88#8kJ<Yq+^mCinNMPvY>dxp7>FXFD
zp+CC;_h*+aJW_qowup4=h4a*|nl$f*D#c^}!#&d0>_$cml3ld8`@uiYTaz7BEo48>
zA;N6V=P8|ePsuX^R?5<x16BejCSaui9HHq}WzgL5gXT`E-s8cPi{X!cl+_xP`f*(9
zkN>=)s6)gsWJf?HJ*yUKW52`@xcnT$`M^ow=YqzDX|1`?-u`t)1(>>SDI%m1O0R&J
z324*?wn5Y9ZXuNW8NM&KogBd4_z<`ZMKSM<z5LOT>m+8IcpK!gHbW~x?!-U0q#V?q
zUbx)(xBy6^SGFsZA6F@dP7h4#9zqZJ)&)O&XR&1s!i9I4Ya1MBPIs|_;rQqJ6~M_x
z9jh+~{+(q?o0$+U09YW<0lOCOJ@IKUB_OWt)-})!>{bZ+3FS~^h<~#9hgKrJ;MLG+
z0iR~(G1npvs)#E9=Z3+6Ff?O1gbWbF10qqk3xl3;<80~(P!~?Zz!hLlezc&DV?Zd6
z-7U8wMh!U_ikE<gWR&|)FnNA;a3V<Hkf0Re#JUV(kUTTbdK75jP`4EC`h*j!n=@{s
z1dvAd-1h74R2#Q4SyD@PU*jD9T>d5lUI>nv0HWKy!cix}$7bg#g8P2db-2w!=DUr`
zEgib~1&KK=Gz?~!OaPy|`EMH_O9odhn!K||YSOe+n|*x=K-ZrJsja*BlTKt!G^een
zuK1Ji_f!Vs$B#`+w!+eJR%>WSC)>x*v|qHJZW%dsp+$wv%sDh!ek3c<V=9>$Jz;wM
zWP9o8TaPk}miTsu@f^}0bRE+;(88&)ndv!iFYTeBWk)`s==c5B$=SB_#125vt2gAc
z%Q7P%tWho57Y?B5GswK`d@s88_SaI@1X5IS;pISW=UEnyxSW7YfB-#T%NT#AjlD0y
zJTFkUWXEp?IV{-+=`7X1(pl!gJi*fB(1qmSjVm1P2jj#yL;(W#`C8sKv=}7f05OwJ
zER*MEWFBE1_}xp6d-v!7YQBM)Sxvqr-8J|z${e?`rbzRrZr|ebdV>nZldhC!z<R!_
z(`FwHrVEP9rojj4jMmEKQJm=ox$1Fc>rAK1gcLLoN=jiJwFLs1S7s`cgEu(SxnWU|
zHV62maj*+!P!xYhdQs49DelS>6UpGlJ4)9Kep{FA8?y|8y`g<VBQHu?vaV*pf_i(*
z&sSc1NKe?6p=`+a$viPV2Yy$OKG%@Oy78x>Tu4j{=l#<54tR#vaeE=Du8tY#MxFw{
zi?Yfl)!k)H?r7a17Oyg}`k?7^_=Wjzbat?6MO$|4OQ0@pa3#+O=J~2vWgdcGg}NM9
z;K;)EST%4Kwk>mI)j_J=Jqg!o7KH~7Q`aSq!?}4mGl99Z`b@*agUfpI63WnCg3ItH
zb0ydRxi6vYp*i0q`J%d9$Z`1L=l_5W0lMT$Zha8gYZLVGQBU6TT@B{^!nv0WCf-b;
zyVkwY(O<sl3L$y9hB2*+&7N&O$sR)OA^?qEYZsAMLQIF`=1F^A)GBD)2=7lzh>E&X
z<4nBEOb!XH;pDgVW<0QlMgrTb2t|8Oj6BG0@Vtwj;b`xo#*C;K9PPb=vV3+;^bJtd
zdY&Jub#HKm|8{+qk~TuJ%uI8dj{RlRK#L`_ET-9~02fTS&UOlX5Z*><6U7Bk-F&(l
zBG|wC`1E_Xl&r(k#ul_z;H(Ka@|92ni2zR^MZ<|j6g}~f;zm)zVzkEy$7KG^+)NQ+
zAwB9mmz#a23)oo&gn6y4g~v)@=$%M7t=4`|_GGDmX}x{o8((Q{^|q5gd@7k)y>k1*
zXv;fg<0qkH254a@|EVK>23>*U$|@)g1wVs_hBuM?XZrq6q}s2c>5%3O2f8MNd_al=
zXjijoP(FyBEkubA=~)4&@qiyn-}iF)`l!~Engy*ClRWe1fmtzrKX<KMLy_94==%1>
z;FQoX<T^v=@aXX&z(`OMYdu?FVnvwZB*N$o2kHS@?>mdD@MQ)m)X4noEzCT6`<8`9
zW#wu;pih0Yq;c<GG5*du(hB1@cG2SbQbk)D%9?Scs+g#UyhoQ5Xln%xRe-_5k`e&#
zkWC2;T9~~Daa-2fje{4{HMeKJX1%)FysMrw|5Ox1g%3A1nPbo}ysv<~H>&|%6B=m3
zhdsj<xmG|Y#~or1#Rb8WLyS<YTw&rQ3rNen?Gre7X+SF(qY1I%9d$lT+W`+Sps&?1
z2vNAJ;Y$kTaJa~eXCwZFrq8Ra8qm6f=H{bNLE4D+Y)O6Va#8a><h0lk^Ixd;RL_yO
zBjrhsHLjEn=2=2_coZ)K8e<;jbZD7Gm^auE9iuYA{xHW-+Ws(_URj>F^>JsqQwquT
zP9afdsX7>R&<G3I3JA2{6hQ_>)`m3G{QA%m@FwWstscOXxv~U&6chJ|tJP*QCUp{0
z70*RPQOY#32;uo12`Rr+9Jq?>P{`I;zp_l(4Aq|_O$Q^@CR|PS^5kOZsTme-24uH2
z#07VlCeswsn91h48-g;F_x?nC%~fPHE%~Wok<snDjVVjq4Bbke6gMro-RM?-m+?eO
PQG)(v&HD@kBZ>b5Ctgem

literal 0
HcmV?d00001

diff --git a/demo/undocumented/dg-poisson/cpp/CMakeLists.txt b/demo/undocumented/dg-poisson/cpp/CMakeLists.txt
new file mode 100644
index 0000000..b5c8599
--- /dev/null
+++ b/demo/undocumented/dg-poisson/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_dg-poisson)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/dg-poisson/cpp/Poisson.h b/demo/undocumented/dg-poisson/cpp/Poisson.h
new file mode 100644
index 0000000..c8507cb
--- /dev/null
+++ b/demo/undocumented/dg-poisson/cpp/Poisson.h
@@ -0,0 +1,4032 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 3*c.entity_indices[2][0];
+    dofs[1] = 3*c.entity_indices[2][0] + 1;
+    dofs[2] = 3*c.entity_indices[2][0] + 2;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_0_1: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_0_1() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_0_1()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates[2*facet] - vertex_coordinates[2*v0]) - dx0*(vertex_coordinates[2*facet + 1] - vertex_coordinates[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n0 = direction ? dx1 / det : -dx1 / det;
+    const double n1 = direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    const double volume = std::abs(detJ)/2.0;
+    
+    
+    // Compute circumradius of triangle in 2D
+    const double v1v2  = std::sqrt((vertex_coordinates[4] - vertex_coordinates[2])*(vertex_coordinates[4] - vertex_coordinates[2]) + (vertex_coordinates[5] - vertex_coordinates[3])*(vertex_coordinates[5] - vertex_coordinates[3]) );
+    const double v0v2  = std::sqrt(J[3]*J[3] + J[1]*J[1]);
+    const double v0v1  = std::sqrt(J[0]*J[0] + J[2]*J[2]);
+    const double circumradius = 0.25*(v1v2*v0v2*v0v1)/(volume);
+    
+    
+    // Array of quadrature weights.
+    static const double W2[2] = {0.5, 0.5};
+    // Quadrature points on the UFC reference element: (0.211324865405187), (0.788675134594813)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[2][2] = \
+    {{0.788675134594813, 0.211324865405187},
+    {0.211324865405187, 0.788675134594813}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[2] = {0, 2};
+    
+    static const double FE0_f0_D01[2][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 10.
+    double G[3];
+    G[0] = 4.0*det/circumradius;
+    G[1] =  - det*(K[2]*n0 + K[3]*n1);
+    G[2] =  - det*(K[0]*n0 + K[1]*n1);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 126
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 126
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Number of operations to compute ip constants: 3
+        double I[3];
+        // Number of operations: 1
+        I[0] = G[0]*W2[ip];
+        
+        // Number of operations: 1
+        I[1] = G[1]*W2[ip];
+        
+        // Number of operations: 1
+        I[2] = G[2]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 60
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          for (unsigned int k = 0; k < 2; k++)
+          {
+            // Number of operations to compute entry: 3
+            A[nzc0[j]*3 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+            // Number of operations to compute entry: 3
+            A[nzc0[j]*3 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+            // Number of operations to compute entry: 3
+            A[nzc0[j]*3 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+            // Number of operations to compute entry: 3
+            A[nzc1[j]*3 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+            // Number of operations to compute entry: 3
+            A[nzc2[j]*3 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+          } // end loop over 'k'
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 126
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 126
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Number of operations to compute ip constants: 3
+        double I[3];
+        // Number of operations: 1
+        I[0] = G[1]*W2[ip];
+        
+        // Number of operations: 1
+        I[1] = G[2]*W2[ip];
+        
+        // Number of operations: 1
+        I[2] = G[0]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 60
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          for (unsigned int k = 0; k < 2; k++)
+          {
+            // Number of operations to compute entry: 3
+            A[nzc1[j]*3 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+            // Number of operations to compute entry: 3
+            A[nzc2[j]*3 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+            // Number of operations to compute entry: 3
+            A[nzc3[j]*3 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+            // Number of operations to compute entry: 3
+            A[nzc3[j]*3 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+            // Number of operations to compute entry: 3
+            A[nzc3[j]*3 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[2];
+          } // end loop over 'k'
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 126
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 126
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Number of operations to compute ip constants: 3
+        double I[3];
+        // Number of operations: 1
+        I[0] = G[1]*W2[ip];
+        
+        // Number of operations: 1
+        I[1] = G[2]*W2[ip];
+        
+        // Number of operations: 1
+        I[2] = G[0]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 60
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          for (unsigned int k = 0; k < 2; k++)
+          {
+            // Number of operations to compute entry: 3
+            A[nzc1[j]*3 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+            // Number of operations to compute entry: 3
+            A[nzc2[j]*3 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+            // Number of operations to compute entry: 3
+            A[nzc4[j]*3 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+            // Number of operations to compute entry: 3
+            A[nzc4[j]*3 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+            // Number of operations to compute entry: 3
+            A[nzc4[j]*3 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[2];
+          } // end loop over 'k'
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// interior facet tensor corresponding to the local contribution to
+/// a form from the integral over an interior facet.
+
+class poisson_interior_facet_integral_0_otherwise: public ufc::interior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_interior_facet_integral_0_otherwise() : ufc::interior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_interior_facet_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local interior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates_0,
+                               const double*  vertex_coordinates_1,
+                               std::size_t facet_0,
+                               std::size_t facet_1,
+                               int cell_orientation_0,
+                               int cell_orientation_1) const
+  {
+    // Compute Jacobian
+    double J_0[4];
+    compute_jacobian_triangle_2d(J_0, vertex_coordinates_0);
+    
+    // Compute Jacobian inverse and determinant
+    double K_0[4];
+    double detJ_0;
+    compute_jacobian_inverse_triangle_2d(K_0, detJ_0, J_0);
+    
+    // Compute Jacobian
+    double J_1[4];
+    compute_jacobian_triangle_2d(J_1, vertex_coordinates_1);
+    
+    // Compute Jacobian inverse and determinant
+    double K_1[4];
+    double detJ_1;
+    compute_jacobian_inverse_triangle_2d(K_1, detJ_1, J_1);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet_0][0];
+    const unsigned int v1 = edge_vertices[facet_0][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates_0[2*v1 + 0] - vertex_coordinates_0[2*v0 + 0];
+    const double dx1 = vertex_coordinates_0[2*v1 + 1] - vertex_coordinates_0[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates_0[2*facet_0] - vertex_coordinates_0[2*v0]) - dx0*(vertex_coordinates_0[2*facet_0 + 1] - vertex_coordinates_0[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n_00 = direction ? dx1 / det : -dx1 / det;
+    const double n_01 = direction ? -dx0 / det : dx0 / det;// Compute facet normals from the facet scale factor constants
+    const double n_10 = !direction ? dx1 / det : -dx1 / det;
+    const double n_11 = !direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    const double volume_0 = std::abs(detJ_0)/2.0;
+    // Compute cell volume
+    const double volume_1 = std::abs(detJ_1)/2.0;
+    
+    
+    // Compute circumradius of triangle in 2D
+    const double v1v2_0  = std::sqrt((vertex_coordinates_0[4] - vertex_coordinates_0[2])*(vertex_coordinates_0[4] - vertex_coordinates_0[2]) + (vertex_coordinates_0[5] - vertex_coordinates_0[3])*(vertex_coordinates_0[5] - vertex_coordinates_0[3]) );
+    const double v0v2_0  = std::sqrt(J_0[3]*J_0[3] + J_0[1]*J_0[1]);
+    const double v0v1_0  = std::sqrt(J_0[0]*J_0[0] + J_0[2]*J_0[2]);
+    const double circumradius_0 = 0.25*(v1v2_0*v0v2_0*v0v1_0)/(volume_0);
+    // Compute circumradius of triangle in 2D
+    const double v1v2_1  = std::sqrt((vertex_coordinates_1[4] - vertex_coordinates_1[2])*(vertex_coordinates_1[4] - vertex_coordinates_1[2]) + (vertex_coordinates_1[5] - vertex_coordinates_1[3])*(vertex_coordinates_1[5] - vertex_coordinates_1[3]) );
+    const double v0v2_1  = std::sqrt(J_1[3]*J_1[3] + J_1[1]*J_1[1]);
+    const double v0v1_1  = std::sqrt(J_1[0]*J_1[0] + J_1[2]*J_1[2]);
+    const double circumradius_1 = 0.25*(v1v2_1*v0v2_1*v0v1_1)/(volume_1);
+    
+    
+    // Array of quadrature weights.
+    static const double W2[2] = {0.5, 0.5};
+    // Quadrature points on the UFC reference element: (0.211324865405187), (0.788675134594813)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[2][2] = \
+    {{0.788675134594813, 0.211324865405187},
+    {0.211324865405187, 0.788675134594813}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[2] = {0, 2};
+    
+    static const double FE0_f0_D01[2][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 61.
+    double G[11];
+    G[0] = 4.0*det*(n_10*n_10 + n_11*n_11)/(circumradius_0 + circumradius_1);
+    G[1] = -0.5*det*(K_1[2]*n_10 + K_1[3]*n_11);
+    G[2] = -0.5*det*(K_1[0]*n_10 + K_1[1]*n_11);
+    G[3] = 4.0*det*(n_00*n_10 + n_01*n_11)/(circumradius_0 + circumradius_1);
+    G[4] = -0.5*det*(K_0[2]*n_10 + K_0[3]*n_11);
+    G[5] = -0.5*det*(K_0[0]*n_10 + K_0[1]*n_11);
+    G[6] = -0.5*det*(K_1[2]*n_00 + K_1[3]*n_01);
+    G[7] = -0.5*det*(K_1[0]*n_00 + K_1[1]*n_01);
+    G[8] = 4.0*det*(n_00*n_00 + n_01*n_01)/(circumradius_0 + circumradius_1);
+    G[9] = -0.5*det*(K_0[2]*n_00 + K_0[3]*n_01);
+    G[10] = -0.5*det*(K_0[0]*n_00 + K_0[1]*n_01);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet_0)
+    {
+    case 0:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[10]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[10]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[8]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[10]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc0[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc0[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[10];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc0[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[8]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[8]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[8]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc3[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc3[j]*6 + nzc3[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        switch (facet_1)
+      {
+      case 0:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[8]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc0[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[4];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc0[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 1:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[8]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc3[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc3[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      case 2:
+        {
+          // Total number of operations to compute element tensor (from this point): 502
+        
+        // Loop quadrature points for integral.
+        // Number of operations to compute element tensor for following IP loop = 502
+        for (unsigned int ip = 0; ip < 2; ip++)
+        {
+          
+          // Number of operations to compute ip constants: 11
+          double I[11];
+          // Number of operations: 1
+          I[0] = G[1]*W2[ip];
+          
+          // Number of operations: 1
+          I[1] = G[6]*W2[ip];
+          
+          // Number of operations: 1
+          I[2] = G[2]*W2[ip];
+          
+          // Number of operations: 1
+          I[3] = G[7]*W2[ip];
+          
+          // Number of operations: 1
+          I[4] = G[0]*W2[ip];
+          
+          // Number of operations: 1
+          I[5] = G[4]*W2[ip];
+          
+          // Number of operations: 1
+          I[6] = G[5]*W2[ip];
+          
+          // Number of operations: 1
+          I[7] = G[3]*W2[ip];
+          
+          // Number of operations: 1
+          I[8] = G[9]*W2[ip];
+          
+          // Number of operations: 1
+          I[9] = G[10]*W2[ip];
+          
+          // Number of operations: 1
+          I[10] = G[8]*W2[ip];
+          
+          
+          // Number of operations for primary indices: 240
+          for (unsigned int j = 0; j < 2; j++)
+          {
+            for (unsigned int k = 0; k < 2; k++)
+            {
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc1[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[1];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc2[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[3];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[0];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[2];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[4];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[5];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[6];
+              // Number of operations to compute entry: 3
+              A[(nzc4[j] + 3)*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[5];
+              // Number of operations to compute entry: 3
+              A[nzc1[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[6];
+              // Number of operations to compute entry: 3
+              A[nzc2[j]*6 + nzc4[k]] += FE0_f0[ip][k]*FE0_f0_D01[ip][j]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc1[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[1];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc2[k] + 3)] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[3];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + (nzc4[k] + 3)] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[7];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc1[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[8];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc2[k]] += FE0_f0[ip][j]*FE0_f0_D01[ip][k]*I[9];
+              // Number of operations to compute entry: 3
+              A[nzc4[j]*6 + nzc4[k]] += FE0_f0[ip][j]*FE0_f0[ip][k]*I[10];
+            } // end loop over 'k'
+          } // end loop over 'j'
+        } // end loop over 'ip'
+          break;
+        }
+      }
+      
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_1_1: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_1_1() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_1_1()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates[2*facet] - vertex_coordinates[2*v0]) - dx0*(vertex_coordinates[2*facet + 1] - vertex_coordinates[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n0 = direction ? dx1 / det : -dx1 / det;
+    const double n1 = direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    const double volume = std::abs(detJ)/2.0;
+    
+    
+    // Compute circumradius of triangle in 2D
+    const double v1v2  = std::sqrt((vertex_coordinates[4] - vertex_coordinates[2])*(vertex_coordinates[4] - vertex_coordinates[2]) + (vertex_coordinates[5] - vertex_coordinates[3])*(vertex_coordinates[5] - vertex_coordinates[3]) );
+    const double v0v2  = std::sqrt(J[3]*J[3] + J[1]*J[1]);
+    const double v0v1  = std::sqrt(J[0]*J[0] + J[2]*J[2]);
+    const double circumradius = 0.25*(v1v2*v0v2*v0v1)/(volume);
+    
+    
+    // Array of quadrature weights.
+    static const double W2[2] = {0.5, 0.5};
+    // Quadrature points on the UFC reference element: (0.211324865405187), (0.788675134594813)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[2][2] = \
+    {{0.788675134594813, 0.211324865405187},
+    {0.211324865405187, 0.788675134594813}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[2] = {0, 2};
+    
+    static const double FE0_f0_D01[2][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 10.
+    double G[3];
+    G[0] = 4.0*det/circumradius;
+    G[1] =  - det*(K[2]*n0 + K[3]*n1);
+    G[2] =  - det*(K[0]*n0 + K[1]*n1);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 44
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 44
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc0[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 6
+        double I[3];
+        // Number of operations: 2
+        I[0] = F0*G[0]*W2[ip];
+        
+        // Number of operations: 2
+        I[1] = F0*G[1]*W2[ip];
+        
+        // Number of operations: 2
+        I[2] = F0*G[2]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc0[j]] += FE0_f0[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc1[j]] += FE0_f0_D01[ip][j]*I[1];
+          // Number of operations to compute entry: 2
+          A[nzc2[j]] += FE0_f0_D01[ip][j]*I[2];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 44
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 44
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc3[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 6
+        double I[3];
+        // Number of operations: 2
+        I[0] = F0*G[1]*W2[ip];
+        
+        // Number of operations: 2
+        I[1] = F0*G[2]*W2[ip];
+        
+        // Number of operations: 2
+        I[2] = F0*G[0]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc1[j]] += FE0_f0_D01[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc2[j]] += FE0_f0_D01[ip][j]*I[1];
+          // Number of operations to compute entry: 2
+          A[nzc3[j]] += FE0_f0[ip][j]*I[2];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 44
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 44
+      for (unsigned int ip = 0; ip < 2; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[ip][r]*w[1][nzc4[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 6
+        double I[3];
+        // Number of operations: 2
+        I[0] = F0*G[1]*W2[ip];
+        
+        // Number of operations: 2
+        I[1] = F0*G[2]*W2[ip];
+        
+        // Number of operations: 2
+        I[2] = F0*G[0]*W2[ip];
+        
+        
+        // Number of operations for primary indices: 12
+        for (unsigned int j = 0; j < 2; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc1[j]] += FE0_f0_D01[ip][j]*I[0];
+          // Number of operations to compute entry: 2
+          A[nzc2[j]] += FE0_f0_D01[ip][j]*I[1];
+          // Number of operations to compute entry: 2
+          A[nzc4[j]] += FE0_f0[ip][j]*I[2];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_1_2: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_1_2() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_1_2()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 9
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[2][0]*(1.0);
+    const double G0_1 = det*w[2][1]*(1.0);
+    const double G0_2 = det*w[2][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.333333333333333*G0_1 + 0.166666666666667*G0_2;
+      A[2] = 0.166666666666667*G0_1 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_2;
+      A[1] = 0.0;
+      A[2] = 0.166666666666667*G0_0 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_1;
+      A[1] = 0.166666666666667*G0_0 + 0.333333333333333*G0_1;
+      A[2] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d873441d5e09c7a2a23f37a429b1d15e8ef82dc868c2eacfd0da0a1353c0afa409a237d7576ad0ffcdd8228717131423936a606331ae1654eaa78ddc9e737b14";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 2;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 1:
+      {
+        return new poisson_exterior_facet_integral_0_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return new poisson_interior_facet_integral_0_otherwise();
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "cb4052af717b8c446ba0b871f4af4df35e2e75406c6ca1ab527d5f95dc7dc20d102f57e7679a52f1fb57ca63cc72104a892a53e35219ea3f25fcd8d97c9c0bfa";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 3;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 3:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 3:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 1:
+      {
+        return new poisson_exterior_facet_integral_1_1();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_exterior_facet_integral_1_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class CoefficientSpace_u0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_u0 Form_L_FunctionSpace_2;
+
+typedef CoefficientSpace_g Form_L_FunctionSpace_3;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 3), f(*this, 0), u0(*this, 1), g(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 3), f(*this, 0), u0(*this, 1), g(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->u0 = u0;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 3), f(*this, 0), u0(*this, 1), g(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->u0 = *u0;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 3), f(*this, 0), u0(*this, 1), g(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 3), f(*this, 0), u0(*this, 1), g(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->u0 = u0;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 3), f(*this, 0), u0(*this, 1), g(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->u0 = *u0;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "u0")
+      return 1;
+    else if (name == "g")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "u0";
+    case 2:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_u0;
+  typedef Form_L_FunctionSpace_3 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner u0;
+  dolfin::CoefficientAssigner g;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/dg-poisson/cpp/Poisson.ufl b/demo/undocumented/dg-poisson/cpp/Poisson.ufl
new file mode 100644
index 0000000..9a9fb4d
--- /dev/null
+++ b/demo/undocumented/dg-poisson/cpp/Poisson.ufl
@@ -0,0 +1,55 @@
+# Copyright (C) 2006-2007 Kristian B. Oelgaard and Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation in a discontinuous Galerkin (DG)
+# formulation.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl
+
+# Elements
+element = FiniteElement("Discontinuous Lagrange", triangle, 1)
+
+# Trial and test functions
+u = TrialFunction(element)
+v = TestFunction(element)
+
+# Source term, Dirichlet term, Neumann term
+f  = Coefficient(element)
+u0 = Coefficient(element)
+g  = Coefficient(element)
+
+# Normal component, cell size and right-hand side
+h = 2.0*Circumradius(triangle)
+h_avg = (h('+') + h('-'))/2
+n = FacetNormal(triangle)
+
+# Parameters
+alpha = 4.0
+gamma = 8.0
+
+# Bilinear form
+a = dot(grad(v), grad(u))*dx \
+   - dot(avg(grad(v)), jump(u, n))*dS \
+   - dot(jump(v, n), avg(grad(u)))*dS \
+   + alpha/h_avg*dot(jump(v, n), jump(u, n))*dS \
+   - dot(grad(v), u*n)*ds(1) \
+   - dot(v*n, grad(u))*ds(1) \
+   + (gamma/h)*v*u*ds(1)
+
+# Linear form
+L = v*f*dx - u0*dot(grad(v), n)*ds(1) + (gamma/h)*u0*v*ds(1) + g*v*ds(2)
diff --git a/demo/undocumented/dg-poisson/cpp/compile.log b/demo/undocumented/dg-poisson/cpp/compile.log
new file mode 100644
index 0000000..4fe8845
--- /dev/null
+++ b/demo/undocumented/dg-poisson/cpp/compile.log
@@ -0,0 +1,1558 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                                'a'
+  Geometric dimension:                 2
+  Number of exterior_facet subdomains: 2
+  Rank:                                2
+  Arguments:                           '[v_0, v_1]'
+  Argument names:                      '[v, u]'
+  Number of coefficients:              0
+  Coefficients:                        '[]'
+  Coefficient names:                   '[]'
+  Unique elements:                     'DG1(?)'
+  Unique sub elements:                 'DG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                                'L'
+  Geometric dimension:                 2
+  Number of exterior_facet subdomains: 3
+  Rank:                                1
+  Arguments:                           '[v_0]'
+  Argument names:                      '[v]'
+  Number of coefficients:              3
+  Coefficients:                        '[w_0, w_1, w_2]'
+  Coefficient names:                   '[f, u0, g]'
+  Unique elements:                     'DG1(?)'
+  Unique sub elements:                 'DG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for expression Division.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0598199 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000848 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {2: {FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[-2.0816681711721685e-17, 5.5511151231257827e-17],
+         [0.78867513459481287, 0.21132486540518719],
+         [0.21132486540518713, 0.78867513459481287]], dtype=object)}, 1: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[0.78867513459481287, 0.21132486540518719],
+         [-2.0816681711721685e-17, 5.5511151231257827e-17],
+         [0.21132486540518713, 0.78867513459481287]], dtype=object)}, 2: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[0.78867513459481287, 0.21132486540518716],
+         [0.21132486540518716, 0.78867513459481287],
+         [0.0, 0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 1: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 2: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ 0.78867513,  0.21132487],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.21132487,  0.78867513],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.78867513,  0.21132487]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.21132487,  0.78867513]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_f0': array([[-2.0816681711721685e-17, 0.78867513459481287, 0.21132486540518713],
+         [5.5511151231257827e-17, 0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f1': array([[0.78867513459481287, -2.0816681711721685e-17, 0.21132486540518713],
+         [0.21132486540518719, 5.5511151231257827e-17, 0.78867513459481287]], dtype=object), 'FE0_f2': array([[0.78867513459481287, 0.21132486540518716, 0.0],
+         [0.21132486540518716, 0.78867513459481287, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f1_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_f2_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE0_f2_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f1_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE0_f0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[-2.0816681711721685e-17, 0.78867513459481287, 0.21132486540518713],
+         [5.5511151231257827e-17, 0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f1': array([[0.78867513459481287, -2.0816681711721685e-17, 0.21132486540518713],
+         [0.21132486540518719, 5.5511151231257827e-17, 0.78867513459481287]], dtype=object), 'FE0_f2': array([[0.78867513459481287, 0.21132486540518716, 0.0],
+         [0.21132486540518716, 0.78867513459481287, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE0_f0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE0_f0_D01': ['FE0_f1_D01', 'FE0_f2_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE0_f0_D10': ['FE0_f1_D10', 'FE0_f2_D10'], 'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE0_f1_D10': 'FE0_f0_D10', 'FE0_f2_D10': 'FE0_f0_D10', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f2_C1': 'FE1_f2_C1', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1', 'FE0_f0_D10': 'FE0_f0_D10', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE0_f2_D01': 'FE0_f0_D01', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE0_f1_D01': 'FE0_f0_D01', 'FE0_f0_D01': 'FE0_f0_D01', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C0': 'FE1_f1_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.78867513459481287, 0.21132486540518713],
+         [0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f0_D01': array([[-1.0, 1.0],
+         [-1.0, 1.0]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE1_f1_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (4, [0, 1]), False, False), 'FE1_f0_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f2_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE0_f1_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE0_f2_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE1_f2_C0': ('FE0_f0', (13, [0, 1]), False, False), 'FE1_f2_C1': ('FE0_f0', (14, [3, 4]), False, False), 'FE1_f2_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (3, [0, 2]), False, False), 'FE0_f0_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE1_f0_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (5, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (8, [4, 5]), False, False), 'FE0_f2_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE1_f2_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f0_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f1_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f2_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE0_f1_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE0_f0_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE1_f0_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE1_f1_C1': ('FE0_f0', (12, [3, 5]), False, False), 'FE1_f1_C0': ('FE0_f0', (11, [0, 2]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {2: {FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[-2.0816681711721685e-17, 5.5511151231257827e-17],
+         [0.78867513459481287, 0.21132486540518719],
+         [0.21132486540518713, 0.78867513459481287]], dtype=object)}, 1: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[0.78867513459481287, 0.21132486540518719],
+         [-2.0816681711721685e-17, 5.5511151231257827e-17],
+         [0.21132486540518713, 0.78867513459481287]], dtype=object)}, 2: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[0.78867513459481287, 0.21132486540518716],
+         [0.21132486540518716, 0.78867513459481287],
+         [0.0, 0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 1: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 2: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ 0.78867513,  0.21132487],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.21132487,  0.78867513],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.78867513,  0.21132487]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.21132487,  0.78867513]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_f0': array([[-2.0816681711721685e-17, 0.78867513459481287, 0.21132486540518713],
+         [5.5511151231257827e-17, 0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f1': array([[0.78867513459481287, -2.0816681711721685e-17, 0.21132486540518713],
+         [0.21132486540518719, 5.5511151231257827e-17, 0.78867513459481287]], dtype=object), 'FE0_f2': array([[0.78867513459481287, 0.21132486540518716, 0.0],
+         [0.21132486540518716, 0.78867513459481287, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f1_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_f2_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE0_f2_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f1_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE0_f0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[-2.0816681711721685e-17, 0.78867513459481287, 0.21132486540518713],
+         [5.5511151231257827e-17, 0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f1': array([[0.78867513459481287, -2.0816681711721685e-17, 0.21132486540518713],
+         [0.21132486540518719, 5.5511151231257827e-17, 0.78867513459481287]], dtype=object), 'FE0_f2': array([[0.78867513459481287, 0.21132486540518716, 0.0],
+         [0.21132486540518716, 0.78867513459481287, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE0_f0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE0_f0_D01': ['FE0_f1_D01', 'FE0_f2_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE0_f0_D10': ['FE0_f1_D10', 'FE0_f2_D10'], 'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE0_f1_D10': 'FE0_f0_D10', 'FE0_f2_D10': 'FE0_f0_D10', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f2_C1': 'FE1_f2_C1', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1', 'FE0_f0_D10': 'FE0_f0_D10', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE0_f2_D01': 'FE0_f0_D01', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE0_f1_D01': 'FE0_f0_D01', 'FE0_f0_D01': 'FE0_f0_D01', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C0': 'FE1_f1_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.78867513459481287, 0.21132486540518713],
+         [0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f0_D01': array([[-1.0, 1.0],
+         [-1.0, 1.0]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE1_f1_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (4, [0, 1]), False, False), 'FE1_f0_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f2_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE0_f1_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE0_f2_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE1_f2_C0': ('FE0_f0', (13, [0, 1]), False, False), 'FE1_f2_C1': ('FE0_f0', (14, [3, 4]), False, False), 'FE1_f2_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (3, [0, 2]), False, False), 'FE0_f0_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE1_f0_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (5, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (8, [4, 5]), False, False), 'FE0_f2_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE1_f2_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f0_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f1_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f2_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE0_f1_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE0_f0_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE1_f0_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE1_f1_C1': ('FE0_f0', (12, [3, 5]), False, False), 'FE1_f1_C0': ('FE0_f0', (11, [0, 2]), False, False)}
+  Transforming interior facet integral (0, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (0, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (0, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (1, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 0)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 1)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming interior facet integral (2, 2)
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000705 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {2: {FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[-2.0816681711721685e-17, 5.5511151231257827e-17],
+         [0.78867513459481287, 0.21132486540518719],
+         [0.21132486540518713, 0.78867513459481287]], dtype=object)}, 1: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[0.78867513459481287, 0.21132486540518719],
+         [-2.0816681711721685e-17, 5.5511151231257827e-17],
+         [0.21132486540518713, 0.78867513459481287]], dtype=object)}, 2: {(0, 1): array([[-1.0, -1.0],
+         [0.0, 0.0],
+         [1.0, 1.0]], dtype=object), (1, 0): array([[-1.0, -1.0],
+         [1.0, 1.0],
+         [0.0, 0.0]], dtype=object), (0, 0): array([[0.78867513459481287, 0.21132486540518716],
+         [0.21132486540518716, 0.78867513459481287],
+         [0.0, 0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 1: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[  7.88675135e-01,   2.11324865e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[ -2.08166817e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.11324865e-01,   7.88675135e-01],
+          [  0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  7.88675135e-01,   2.11324865e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [ -2.08166817e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00],
+          [  2.11324865e-01,   7.88675135e-01]]])}, 2: {(0, 1): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]]]), (1, 0): array([[[-1., -1.],
+          [ 0.,  0.]],
+  
+         [[ 1.,  1.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]],
+  
+         [[ 0.,  0.],
+          [-1., -1.]],
+  
+         [[ 0.,  0.],
+          [ 1.,  1.]],
+  
+         [[ 0.,  0.],
+          [ 0.,  0.]]]), (0, 0): array([[[ 0.78867513,  0.21132487],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.21132487,  0.78867513],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.78867513,  0.21132487]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.21132487,  0.78867513]],
+  
+         [[ 0.        ,  0.        ],
+          [ 0.        ,  0.        ]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_f0': array([[-2.0816681711721685e-17, 0.78867513459481287, 0.21132486540518713],
+         [5.5511151231257827e-17, 0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f1': array([[0.78867513459481287, -2.0816681711721685e-17, 0.21132486540518713],
+         [0.21132486540518719, 5.5511151231257827e-17, 0.78867513459481287]], dtype=object), 'FE0_f2': array([[0.78867513459481287, 0.21132486540518716, 0.0],
+         [0.21132486540518716, 0.78867513459481287, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f1_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE0_f2_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE0_f2_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_f1_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE0_f0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[-2.0816681711721685e-17, 0.78867513459481287, 0.21132486540518713],
+         [5.5511151231257827e-17, 0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f1': array([[0.78867513459481287, -2.0816681711721685e-17, 0.21132486540518713],
+         [0.21132486540518719, 5.5511151231257827e-17, 0.78867513459481287]], dtype=object), 'FE0_f2': array([[0.78867513459481287, 0.21132486540518716, 0.0],
+         [0.21132486540518716, 0.78867513459481287, 0.0]], dtype=object), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0': array([[ 0.78867513,  0.21132487,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.21132487,  0.78867513,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.78867513,  0.21132487,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.21132487,  0.78867513,
+           0.        ]]), 'FE0_f0_D10': array([[-1.0, 1.0, 0.0],
+         [-1.0, 1.0, 0.0]], dtype=object), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[ -2.08166817e-17,   7.88675135e-01,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   2.11324865e-01,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -2.08166817e-17,   7.88675135e-01,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   2.11324865e-01,   7.88675135e-01]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0_f0_D01': array([[-1.0, 0.0, 1.0],
+         [-1.0, 0.0, 1.0]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            7.88675135e-01,  -2.08166817e-17,   2.11324865e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.11324865e-01,   5.55111512e-17,   7.88675135e-01]]), 'FE1_f1_C0': array([[  7.88675135e-01,  -2.08166817e-17,   2.11324865e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  2.11324865e-01,   5.55111512e-17,   7.88675135e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE0_f0_D01': ['FE0_f1_D01', 'FE0_f2_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE0_f0_D10': ['FE0_f1_D10', 'FE0_f2_D10'], 'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE0_f1_D10': 'FE0_f0_D10', 'FE0_f2_D10': 'FE0_f0_D10', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f2_C1': 'FE1_f2_C1', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1', 'FE0_f0_D10': 'FE0_f0_D10', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE0_f2_D01': 'FE0_f0_D01', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE0_f1_D01': 'FE0_f0_D01', 'FE0_f0_D01': 'FE0_f0_D01', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C0': 'FE1_f1_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.78867513459481287, 0.21132486540518713],
+         [0.21132486540518719, 0.78867513459481287]], dtype=object), 'FE0_f0_D01': array([[-1.0, 1.0],
+         [-1.0, 1.0]], dtype=object)}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE1_f1_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (4, [0, 1]), False, False), 'FE1_f0_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f2_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE0_f1_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE0_f2_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE1_f2_C0': ('FE0_f0', (13, [0, 1]), False, False), 'FE1_f2_C1': ('FE0_f0', (14, [3, 4]), False, False), 'FE1_f2_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (3, [0, 2]), False, False), 'FE0_f0_D10': ('FE0_f0_D01', (2, [0, 1]), False, False), 'FE1_f0_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (5, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (8, [4, 5]), False, False), 'FE0_f2_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE1_f2_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f0_C1_D10': ('FE0_f0_D01', (10, [3, 4]), False, False), 'FE1_f1_C1_D01': ('FE0_f0_D01', (9, [3, 5]), False, False), 'FE1_f2_C0_D10': ('FE0_f0_D01', (7, [0, 1]), False, False), 'FE0_f1_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE0_f0_D01': ('FE0_f0_D01', (1, [0, 2]), False, False), 'FE1_f0_C0_D01': ('FE0_f0_D01', (6, [0, 2]), False, False), 'FE1_f1_C1': ('FE0_f0', (12, [3, 5]), False, False), 'FE1_f1_C0': ('FE0_f0', (11, [0, 2]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.00101 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000824 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000824 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.621015 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  Optimising expressions for facet integral (0, 0)
+  Optimising expressions for facet integral (0, 1)
+  Optimising expressions for facet integral (0, 2)
+  Optimising expressions for facet integral (1, 0)
+  Optimising expressions for facet integral (1, 1)
+  Optimising expressions for facet integral (1, 2)
+  Optimising expressions for facet integral (2, 0)
+  Optimising expressions for facet integral (2, 1)
+  Optimising expressions for facet integral (2, 2)
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.0244839 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: facet_area
+  Removing unused variable: facet_area
+  Removing unused variable: facet_area
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.067678 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000618935 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.00105309 seconds.
+
+FFC finished in 0.775022 seconds.
diff --git a/demo/undocumented/dg-poisson/cpp/main.cpp b/demo/undocumented/dg-poisson/cpp/main.cpp
new file mode 100644
index 0000000..d92af85
--- /dev/null
+++ b/demo/undocumented/dg-poisson/cpp/main.cpp
@@ -0,0 +1,132 @@
+// Copyright (C) 2006-2011 Anders Logg and Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// This demo program solves Poisson's equation,
+//
+//     - div grad u(x, y) = f(x, y)
+//
+// on the unit square with source f given by
+//
+//     f(x, y) = -100*exp(-((x - 0.5)^2 + (y - 0.5)^2)/0.02)
+//
+// and boundary conditions given by
+//
+//     u(x, y)     = u0 on x = 0 and x = 1
+//     du/dn(x, y) = g  on y = 0 and y = 1
+//
+// where
+//
+//     u0 = x + 0.25*sin(2*pi*x)
+//     g = (y - 0.5)**2
+//
+// using a discontinuous Galerkin formulation (interior penalty method).
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+int main()
+{
+  // Source term
+  class Source : public Expression
+  {
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      const double dx = x[0] - 0.5;
+      const double dy = x[1] - 0.5;
+      values[0] = -100.0*exp(-(dx*dx + dy*dy)/0.02);
+    }
+  };
+
+  // Dirichlet term
+  class BoundaryValue : public Expression
+  {
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = x[0] + 0.25*sin(2*M_PI*x[1]);
+    }
+  };
+
+  // Neumann term
+  class BoundaryDerivative : public Expression
+  {
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      const double dx = x[0] - 0.5;
+      values[0] = dx*dx;
+    }
+  };
+
+  // Sub domain for Dirichlet boundary condition, x = 1 and x = 0
+  class DirichletBoundary : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    { return on_boundary and near(x[0]*(1 - x[0]), 0); }
+  };
+
+  // Sub domain for Neumann boundary condition, y = 1 and y = 0
+  class NeumannBoundary : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    { return on_boundary and near(x[1]*(1 - x[1]), 0); }
+  };
+
+  // Create mesh
+  UnitSquareMesh mesh(24, 24);
+
+  // Create functions
+  Source f;
+  BoundaryValue u0;
+  BoundaryDerivative g;
+
+  // Create funtion space
+  Poisson::FunctionSpace V(mesh);
+
+  // Mark facets of the mesh
+  NeumannBoundary neumann_boundary;
+  DirichletBoundary dirichlet_boundary;
+
+  FacetFunction<std::size_t> boundaries(mesh, 0);
+  neumann_boundary.mark(boundaries, 2);
+  dirichlet_boundary.mark(boundaries, 1);
+
+  // Define variational problem
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  L.f  = f;
+  L.u0 = u0;
+  L.g  = g;
+
+  // Attach marked facets to bilinear and linear form
+  a.ds = boundaries;
+  L.ds = boundaries;
+
+  // Compute solution
+  Function u(V);
+  solve(a == L, u);
+
+  // Save solution in VTK format
+  File file("poisson.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/dg-poisson/cpp/plot.py b/demo/undocumented/dg-poisson/cpp/plot.py
new file mode 100644
index 0000000..96fa7b0
--- /dev/null
+++ b/demo/undocumented/dg-poisson/cpp/plot.py
@@ -0,0 +1,4 @@
+from dolfin import *
+
+u = Function("poisson.xml")
+plot(u)
diff --git a/demo/undocumented/dg-poisson/python/demo_dg-poisson.py b/demo/undocumented/dg-poisson/python/demo_dg-poisson.py
new file mode 100644
index 0000000..1525092
--- /dev/null
+++ b/demo/undocumented/dg-poisson/python/demo_dg-poisson.py
@@ -0,0 +1,103 @@
+"""This demo program solves Poisson's equation
+
+    - div grad u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+    f(x, y) = -100*exp(-((x - 0.5)^2 + (y - 0.5)^2)/0.02)
+
+and boundary conditions given by
+
+    u(x, y)     = u0 on x = 0 and x = 1
+    du/dn(x, y) = g  on y = 0 and y = 1
+
+where
+
+    u0 = x + 0.25*sin(2*pi*x)
+    g = (y - 0.5)**2
+
+using a discontinuous Galerkin formulation (interior penalty method).
+"""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+from dolfin import *
+
+# Define class marking Dirichlet boundary (x = 0 or x = 1)
+class DirichletBoundary(SubDomain):
+  def inside(self, x, on_boundary):
+    return on_boundary and near(x[0]*(1 - x[0]), 0)
+
+# Define class marking Neumann boundary (y = 0 or y = 1)
+class NeumanBoundary(SubDomain):
+  def inside(self, x, on_boundary):
+    return on_boundary and near(x[1]*(1 - x[1]), 0)
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(24, 24)
+V = FunctionSpace(mesh, 'DG', 1)
+
+# Define test and trial functions
+u = TrialFunction(V)
+v = TestFunction(V)
+
+# Define normal vector and mesh size
+n = FacetNormal(mesh)
+h = CellSize(mesh)
+h_avg = (h('+') + h('-'))/2
+
+# Define the source term f, Dirichlet term u0 and Neumann term g
+f = Expression('-100.0*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)')
+u0 = Expression('x[0] + 0.25*sin(2*pi*x[1])')
+g = Expression('(x[1] - 0.5)*(x[1] - 0.5)')
+
+# Mark facets of the mesh
+boundaries = FacetFunction('size_t', mesh, 0)
+NeumanBoundary().mark(boundaries, 2)
+DirichletBoundary().mark(boundaries, 1)
+
+# Define outer surface measure aware of Dirichlet and Neumann boundaries
+ds = Measure('ds')[boundaries]
+
+# Define parameters
+alpha = 4.0
+gamma = 8.0
+
+# Define variational problem
+a = dot(grad(v), grad(u))*dx \
+   - dot(avg(grad(v)), jump(u, n))*dS \
+   - dot(jump(v, n), avg(grad(u)))*dS \
+   + alpha/h_avg*dot(jump(v, n), jump(u, n))*dS \
+   - dot(grad(v), u*n)*ds(1) \
+   - dot(v*n, grad(u))*ds(1) \
+   + (gamma/h)*v*u*ds(1)
+L = v*f*dx - u0*dot(grad(v), n)*ds(1) + (gamma/h)*u0*v*ds(1) + g*v*ds(2)
+
+# Compute solution
+u = Function(V)
+solve(a == L, u)
+
+# Project solution to piecewise linears
+u_proj = project(u)
+
+# Save solution to file
+file = File("poisson.pvd")
+file << u_proj
+
+# Plot solution
+plot(u_proj, interactive=True)
diff --git a/demo/undocumented/elasticity/cpp/CMakeLists.txt b/demo/undocumented/elasticity/cpp/CMakeLists.txt
new file mode 100644
index 0000000..80aa258
--- /dev/null
+++ b/demo/undocumented/elasticity/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_elasticity)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/elasticity/cpp/Elasticity.h b/demo/undocumented/elasticity/cpp/Elasticity.h
new file mode 100644
index 0000000..758dead
--- /dev/null
+++ b/demo/undocumented/elasticity/cpp/Elasticity.h
@@ -0,0 +1,9652 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ELASTICITY_H
+#define __ELASTICITY_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class elasticity_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Compute subdeterminants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+    vertex_values[3] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elasticity_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "TensorElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, (3, 3), None, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 9;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Compute subdeterminants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    values[3] = 0.0;
+    values[4] = 0.0;
+    values[5] = 0.0;
+    values[6] = 0.0;
+    values[7] = 0.0;
+    values[8] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[3] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[4] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[5] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[6] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[7] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[1] = {0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      
+      // Table(s) of coefficients
+      static const double coefficients0[1] = \
+      {1.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        values[8] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[9] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 9; s++)
+      {
+        values[r*9 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 9*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      for (unsigned int s = 0; s < 9*num_derivatives; s++)
+      {
+        values[r*9*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 9*num_derivatives; s++)
+      {
+        values[r*9*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[9];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[3];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[4];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[5];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[6];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[7];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[8];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[9];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[1] = vals[1];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[2] = vals[2];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[4];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[5];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[6] = vals[6];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[7];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[8] = vals[8];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[9] = dof_values[0];
+    vertex_values[18] = dof_values[0];
+    vertex_values[27] = dof_values[0];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[1];
+    vertex_values[10] = dof_values[1];
+    vertex_values[19] = dof_values[1];
+    vertex_values[28] = dof_values[1];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[2];
+    vertex_values[11] = dof_values[2];
+    vertex_values[20] = dof_values[2];
+    vertex_values[29] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[3] = dof_values[3];
+    vertex_values[12] = dof_values[3];
+    vertex_values[21] = dof_values[3];
+    vertex_values[30] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[4] = dof_values[4];
+    vertex_values[13] = dof_values[4];
+    vertex_values[22] = dof_values[4];
+    vertex_values[31] = dof_values[4];
+    // Evaluate function and change variables
+    vertex_values[5] = dof_values[5];
+    vertex_values[14] = dof_values[5];
+    vertex_values[23] = dof_values[5];
+    vertex_values[32] = dof_values[5];
+    // Evaluate function and change variables
+    vertex_values[6] = dof_values[6];
+    vertex_values[15] = dof_values[6];
+    vertex_values[24] = dof_values[6];
+    vertex_values[33] = dof_values[6];
+    // Evaluate function and change variables
+    vertex_values[7] = dof_values[7];
+    vertex_values[16] = dof_values[7];
+    vertex_values[25] = dof_values[7];
+    vertex_values[34] = dof_values[7];
+    // Evaluate function and change variables
+    vertex_values[8] = dof_values[8];
+    vertex_values[17] = dof_values[8];
+    vertex_values[26] = dof_values[8];
+    vertex_values[35] = dof_values[8];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 9;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 3:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 6:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 7:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    case 8:
+      {
+        return new elasticity_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elasticity_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Real', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Compute subdeterminants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+      y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+      y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    y[1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    y[2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+    vertex_values[3] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elasticity_finite_element_3: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity_finite_element_3() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_finite_element_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity_finite_element_3();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elasticity_finite_element_4: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elasticity_finite_element_4() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_finite_element_4()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    values[2] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        values[2] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[3] = {0.0, 0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3; s++)
+      {
+        values[r*3 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 3*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[2*num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 12; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 3*num_derivatives; s++)
+      {
+        values[r*3*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 6:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 7:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 8:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 9:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 10:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    case 11:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[2];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[3];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[1];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[1];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[8] = vals[2];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[2];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[10] = vals[2];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[11] = vals[2];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[3] = dof_values[1];
+    vertex_values[6] = dof_values[2];
+    vertex_values[9] = dof_values[3];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[4];
+    vertex_values[4] = dof_values[5];
+    vertex_values[7] = dof_values[6];
+    vertex_values[10] = dof_values[7];
+    // Evaluate function and change variables
+    vertex_values[2] = dof_values[8];
+    vertex_values[5] = dof_values[9];
+    vertex_values[8] = dof_values[10];
+    vertex_values[11] = dof_values[11];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 3;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_3();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_3();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_finite_element_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elasticity_finite_element_4();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[3];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[3][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for TensorElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3)), 0, (3, 3), None, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 9*num_global_entities[3];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 9;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[1] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[2] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[3] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[4] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[5] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[6] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[7] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+    dofs[8] = offset + c.entity_indices[3][0];
+    offset += num_global_entities[3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 3;
+      dofs[4] = 4;
+      dofs[5] = 5;
+      dofs[6] = 6;
+      dofs[7] = 7;
+      dofs[8] = 8;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[1][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[1][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[1][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[2][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[2][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[2][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[3][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[3][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[3][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[6][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[6][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[7][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[8][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[8][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 9;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 3:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 6:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 7:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    case 8:
+      {
+        return new elasticity_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Real', Domain(Cell('tetrahedron', 3)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = 0;
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.25*vertex_coordinates[0] + 0.25*vertex_coordinates[3] + 0.25*vertex_coordinates[6] + 0.25*vertex_coordinates[9];
+    dof_coordinates[0][1] = 0.25*vertex_coordinates[1] + 0.25*vertex_coordinates[4] + 0.25*vertex_coordinates[7] + 0.25*vertex_coordinates[10];
+    dof_coordinates[0][2] = 0.25*vertex_coordinates[2] + 0.25*vertex_coordinates[5] + 0.25*vertex_coordinates[8] + 0.25*vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity_dofmap_3: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity_dofmap_3() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_dofmap_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity_dofmap_3();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elasticity_dofmap_4: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elasticity_dofmap_4() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_dofmap_4()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 12;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 9;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 3;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[0][0];
+    dofs[5] = offset + c.entity_indices[0][1];
+    dofs[6] = offset + c.entity_indices[0][2];
+    dofs[7] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[8] = offset + c.entity_indices[0][0];
+    dofs[9] = offset + c.entity_indices[0][1];
+    dofs[10] = offset + c.entity_indices[0][2];
+    dofs[11] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 9;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 6;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 10;
+      dofs[8] = 11;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 7;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 11;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+      dofs[6] = 8;
+      dofs[7] = 9;
+      dofs[8] = 10;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 4;
+        dofs[2] = 8;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 5;
+        dofs[2] = 9;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 6;
+        dofs[2] = 10;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+        dofs[1] = 7;
+        dofs[2] = 11;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = vertex_coordinates[0];
+    dof_coordinates[4][1] = vertex_coordinates[1];
+    dof_coordinates[4][2] = vertex_coordinates[2];
+    dof_coordinates[5][0] = vertex_coordinates[3];
+    dof_coordinates[5][1] = vertex_coordinates[4];
+    dof_coordinates[5][2] = vertex_coordinates[5];
+    dof_coordinates[6][0] = vertex_coordinates[6];
+    dof_coordinates[6][1] = vertex_coordinates[7];
+    dof_coordinates[6][2] = vertex_coordinates[8];
+    dof_coordinates[7][0] = vertex_coordinates[9];
+    dof_coordinates[7][1] = vertex_coordinates[10];
+    dof_coordinates[7][2] = vertex_coordinates[11];
+    dof_coordinates[8][0] = vertex_coordinates[0];
+    dof_coordinates[8][1] = vertex_coordinates[1];
+    dof_coordinates[8][2] = vertex_coordinates[2];
+    dof_coordinates[9][0] = vertex_coordinates[3];
+    dof_coordinates[9][1] = vertex_coordinates[4];
+    dof_coordinates[9][2] = vertex_coordinates[5];
+    dof_coordinates[10][0] = vertex_coordinates[6];
+    dof_coordinates[10][1] = vertex_coordinates[7];
+    dof_coordinates[10][2] = vertex_coordinates[8];
+    dof_coordinates[11][0] = vertex_coordinates[9];
+    dof_coordinates[11][1] = vertex_coordinates[10];
+    dof_coordinates[11][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 3;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_3();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_3();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_dofmap_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elasticity_dofmap_4();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elasticity_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elasticity_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.166666666666667;
+    // Quadrature points on the UFC reference element: (0.25, 0.25, 0.25)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_C0_D001[1][2] = \
+    {{-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc9[2] = {8, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {4, 7};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc6[2] = {4, 6};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[2] = {8, 10};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc7[2] = {4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[2] = {8, 9};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 144; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 387.
+    double G[45];
+    G[0] = W1*det*(K[5]*K[5]*w[1][0] + w[0][0]*(2.0*K[5]*K[5] + K[3]*K[3] + K[4]*K[4]));
+    G[1] = W1*det*(K[2]*K[5]*w[1][0] + w[0][0]*(2.0*K[2]*K[5] + K[0]*K[3] + K[1]*K[4]));
+    G[2] = W1*det*(K[3]*K[8]*w[0][0] + K[5]*K[6]*w[1][0]);
+    G[3] = K[3]*K[5]*W1*det*(w[0][0] + w[1][0]);
+    G[4] = W1*det*(K[0]*K[5]*w[1][0] + K[2]*K[3]*w[0][0]);
+    G[5] = W1*det*(K[4]*K[8]*w[0][0] + K[5]*K[7]*w[1][0]);
+    G[6] = K[4]*K[5]*W1*det*(w[0][0] + w[1][0]);
+    G[7] = W1*det*(K[1]*K[5]*w[1][0] + K[2]*K[4]*w[0][0]);
+    G[8] = W1*det*(K[5]*K[8]*w[1][0] + w[0][0]*(2.0*K[5]*K[8] + K[3]*K[6] + K[4]*K[7]));
+    G[9] = W1*det*(K[2]*K[2]*w[1][0] + w[0][0]*(2.0*K[2]*K[2] + K[0]*K[0] + K[1]*K[1]));
+    G[10] = W1*det*(K[0]*K[8]*w[0][0] + K[2]*K[6]*w[1][0]);
+    G[11] = W1*det*(K[0]*K[5]*w[0][0] + K[2]*K[3]*w[1][0]);
+    G[12] = K[0]*K[2]*W1*det*(w[0][0] + w[1][0]);
+    G[13] = W1*det*(K[1]*K[8]*w[0][0] + K[2]*K[7]*w[1][0]);
+    G[14] = W1*det*(K[1]*K[5]*w[0][0] + K[2]*K[4]*w[1][0]);
+    G[15] = K[1]*K[2]*W1*det*(w[0][0] + w[1][0]);
+    G[16] = W1*det*(K[2]*K[8]*w[1][0] + w[0][0]*(2.0*K[2]*K[8] + K[0]*K[6] + K[1]*K[7]));
+    G[17] = W1*det*(K[6]*K[6]*w[1][0] + w[0][0]*(2.0*K[6]*K[6] + K[7]*K[7] + K[8]*K[8]));
+    G[18] = W1*det*(K[3]*K[6]*w[1][0] + w[0][0]*(2.0*K[3]*K[6] + K[4]*K[7] + K[5]*K[8]));
+    G[19] = W1*det*(K[0]*K[6]*w[1][0] + w[0][0]*(2.0*K[0]*K[6] + K[1]*K[7] + K[2]*K[8]));
+    G[20] = K[6]*K[7]*W1*det*(w[0][0] + w[1][0]);
+    G[21] = W1*det*(K[3]*K[7]*w[0][0] + K[4]*K[6]*w[1][0]);
+    G[22] = W1*det*(K[0]*K[7]*w[0][0] + K[1]*K[6]*w[1][0]);
+    G[23] = K[6]*K[8]*W1*det*(w[0][0] + w[1][0]);
+    G[24] = W1*det*(K[3]*K[3]*w[1][0] + w[0][0]*(2.0*K[3]*K[3] + K[4]*K[4] + K[5]*K[5]));
+    G[25] = W1*det*(K[0]*K[3]*w[1][0] + w[0][0]*(2.0*K[0]*K[3] + K[1]*K[4] + K[2]*K[5]));
+    G[26] = W1*det*(K[3]*K[7]*w[1][0] + K[4]*K[6]*w[0][0]);
+    G[27] = K[3]*K[4]*W1*det*(w[0][0] + w[1][0]);
+    G[28] = W1*det*(K[0]*K[4]*w[0][0] + K[1]*K[3]*w[1][0]);
+    G[29] = W1*det*(K[3]*K[8]*w[1][0] + K[5]*K[6]*w[0][0]);
+    G[30] = W1*det*(K[0]*K[0]*w[1][0] + w[0][0]*(2.0*K[0]*K[0] + K[1]*K[1] + K[2]*K[2]));
+    G[31] = W1*det*(K[0]*K[7]*w[1][0] + K[1]*K[6]*w[0][0]);
+    G[32] = W1*det*(K[0]*K[4]*w[1][0] + K[1]*K[3]*w[0][0]);
+    G[33] = K[0]*K[1]*W1*det*(w[0][0] + w[1][0]);
+    G[34] = W1*det*(K[0]*K[8]*w[1][0] + K[2]*K[6]*w[0][0]);
+    G[35] = W1*det*(K[7]*K[7]*w[1][0] + w[0][0]*(2.0*K[7]*K[7] + K[6]*K[6] + K[8]*K[8]));
+    G[36] = W1*det*(K[4]*K[7]*w[1][0] + w[0][0]*(2.0*K[4]*K[7] + K[3]*K[6] + K[5]*K[8]));
+    G[37] = W1*det*(K[1]*K[7]*w[1][0] + w[0][0]*(2.0*K[1]*K[7] + K[0]*K[6] + K[2]*K[8]));
+    G[38] = K[7]*K[8]*W1*det*(w[0][0] + w[1][0]);
+    G[39] = W1*det*(K[4]*K[4]*w[1][0] + w[0][0]*(2.0*K[4]*K[4] + K[3]*K[3] + K[5]*K[5]));
+    G[40] = W1*det*(K[1]*K[4]*w[1][0] + w[0][0]*(2.0*K[1]*K[4] + K[0]*K[3] + K[2]*K[5]));
+    G[41] = W1*det*(K[4]*K[8]*w[1][0] + K[5]*K[7]*w[0][0]);
+    G[42] = W1*det*(K[1]*K[1]*w[1][0] + w[0][0]*(2.0*K[1]*K[1] + K[0]*K[0] + K[2]*K[2]));
+    G[43] = W1*det*(K[1]*K[8]*w[1][0] + K[2]*K[7]*w[0][0]);
+    G[44] = W1*det*(K[8]*K[8]*w[1][0] + w[0][0]*(2.0*K[8]*K[8] + K[6]*K[6] + K[7]*K[7]));
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 972
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Number of operations for primary indices: 972
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[0];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc10[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[1];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[9];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[10];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[11];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[12];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[13];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[14];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[15];
+          // Number of operations to compute entry: 3
+          A[nzc11[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[16];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[2];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[10];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[17];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[18];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[19];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[20];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[21];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[22];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[23];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[3];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[11];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[18];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[24];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[25];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[26];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[27];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[28];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[29];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[4];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[12];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[19];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[25];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[30];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[31];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[32];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[33];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[34];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[5];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[13];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[20];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[26];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[31];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[35];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[36];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[37];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[38];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[6];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[14];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[21];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[27];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[32];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[36];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[39];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[40];
+          // Number of operations to compute entry: 3
+          A[nzc6[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[41];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[7];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[15];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[22];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[28];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[33];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[37];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[40];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[42];
+          // Number of operations to compute entry: 3
+          A[nzc7[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[43];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc10[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[8];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc11[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[16];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc1[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[23];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc2[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[29];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc3[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[34];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc5[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[38];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc6[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[41];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc7[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[43];
+          // Number of operations to compute entry: 3
+          A[nzc9[j]*12 + nzc9[k]] += FE0_C0_D001[0][j]*FE0_C0_D001[0][k]*G[44];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elasticity_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elasticity_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    12
+    // Number of operations (multiply-add pairs) for tensor contraction: 42
+    // Total number of operations (multiply-add pairs):                  57
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    const double G0_10 = det*w[0][10]*(1.0);
+    const double G0_11 = det*w[0][11]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0166666666666666*G0_0 + 0.0083333333333333*G0_1 + 0.0083333333333333*G0_2 + 0.0083333333333333*G0_3;
+    A[1] = 0.0083333333333333*G0_0 + 0.0166666666666667*G0_1 + 0.00833333333333337*G0_2 + 0.00833333333333337*G0_3;
+    A[2] = 0.0083333333333333*G0_0 + 0.00833333333333337*G0_1 + 0.0166666666666667*G0_2 + 0.00833333333333337*G0_3;
+    A[3] = 0.0083333333333333*G0_0 + 0.00833333333333337*G0_1 + 0.00833333333333337*G0_2 + 0.0166666666666667*G0_3;
+    A[4] = 0.0166666666666666*G0_4 + 0.0083333333333333*G0_5 + 0.0083333333333333*G0_6 + 0.0083333333333333*G0_7;
+    A[5] = 0.0083333333333333*G0_4 + 0.0166666666666667*G0_5 + 0.00833333333333337*G0_6 + 0.00833333333333337*G0_7;
+    A[6] = 0.0083333333333333*G0_4 + 0.00833333333333337*G0_5 + 0.0166666666666667*G0_6 + 0.00833333333333337*G0_7;
+    A[7] = 0.0083333333333333*G0_4 + 0.00833333333333337*G0_5 + 0.00833333333333337*G0_6 + 0.0166666666666667*G0_7;
+    A[8] = 0.0166666666666666*G0_8 + 0.0083333333333333*G0_9 + 0.0083333333333333*G0_10 + 0.0083333333333333*G0_11;
+    A[9] = 0.0083333333333333*G0_8 + 0.0166666666666667*G0_9 + 0.00833333333333337*G0_10 + 0.00833333333333337*G0_11;
+    A[10] = 0.0083333333333333*G0_8 + 0.00833333333333337*G0_9 + 0.0166666666666667*G0_10 + 0.00833333333333337*G0_11;
+    A[11] = 0.0083333333333333*G0_8 + 0.00833333333333337*G0_9 + 0.00833333333333337*G0_10 + 0.0166666666666667*G0_11;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elasticity_cell_integral_2_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elasticity_cell_integral_2_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_cell_integral_2_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.166666666666667;
+    // Quadrature points on the UFC reference element: (0.25, 0.25, 0.25)
+    
+    // Values of basis functions at quadrature points.
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 81; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 1.
+    double G[1];
+    G[0] = W1*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 9
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Number of operations for primary indices: 9
+      // Number of operations to compute entry: 1
+      A[0] += G[0];
+      // Number of operations to compute entry: 1
+      A[10] += G[0];
+      // Number of operations to compute entry: 1
+      A[20] += G[0];
+      // Number of operations to compute entry: 1
+      A[30] += G[0];
+      // Number of operations to compute entry: 1
+      A[40] += G[0];
+      // Number of operations to compute entry: 1
+      A[50] += G[0];
+      // Number of operations to compute entry: 1
+      A[60] += G[0];
+      // Number of operations to compute entry: 1
+      A[70] += G[0];
+      // Number of operations to compute entry: 1
+      A[80] += G[0];
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elasticity_cell_integral_3_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elasticity_cell_integral_3_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_cell_integral_3_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 0.166666666666667;
+    // Quadrature points on the UFC reference element: (0.25, 0.25, 0.25)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0_D001[1][2] = \
+    {{-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc11[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc19[2] = {8, 10};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc15[2] = {4, 6};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc10[2] = {0, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc12[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc18[2] = {8, 11};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc16[2] = {4, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc20[2] = {8, 9};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc14[2] = {4, 7};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 99.
+    double G[27];
+    G[0] = K[0]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    G[1] = K[3]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    G[2] = K[6]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    G[3] = K[1]*W1*det*w[1][0];
+    G[4] = K[4]*W1*det*w[1][0];
+    G[5] = K[7]*W1*det*w[1][0];
+    G[6] = K[2]*W1*det*w[1][0];
+    G[7] = K[5]*W1*det*w[1][0];
+    G[8] = K[8]*W1*det*w[1][0];
+    G[9] = K[1]*W1*det*w[0][0];
+    G[10] = K[4]*W1*det*w[0][0];
+    G[11] = K[7]*W1*det*w[0][0];
+    G[12] = K[0]*W1*det*w[0][0];
+    G[13] = K[3]*W1*det*w[0][0];
+    G[14] = K[6]*W1*det*w[0][0];
+    G[15] = K[2]*W1*det*w[0][0];
+    G[16] = K[5]*W1*det*w[0][0];
+    G[17] = K[8]*W1*det*w[0][0];
+    G[18] = K[0]*W1*det*w[1][0];
+    G[19] = K[3]*W1*det*w[1][0];
+    G[20] = K[6]*W1*det*w[1][0];
+    G[21] = K[1]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    G[22] = K[4]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    G[23] = K[7]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    G[24] = K[2]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    G[25] = K[5]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    G[26] = K[8]*W1*det*(w[1][0] + 2.0*w[0][0]);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 129
+    for (unsigned int ip = 0; ip < 1; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      
+      // Total number of operations to compute function values = 36
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F0 += FE1_C0_D001[0][r]*w[2][nzc12[r]];
+        F1 += FE1_C0_D001[0][r]*w[2][nzc11[r]];
+        F2 += FE1_C0_D001[0][r]*w[2][nzc10[r]];
+        F3 += FE1_C0_D001[0][r]*w[2][nzc16[r]];
+        F4 += FE1_C0_D001[0][r]*w[2][nzc15[r]];
+        F5 += FE1_C0_D001[0][r]*w[2][nzc14[r]];
+        F6 += FE1_C0_D001[0][r]*w[2][nzc20[r]];
+        F7 += FE1_C0_D001[0][r]*w[2][nzc19[r]];
+        F8 += FE1_C0_D001[0][r]*w[2][nzc18[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 84
+      double I[6];
+      // Number of operations: 17
+      I[0] = (F0*G[0] + F1*G[1] + F2*G[2] + F3*G[3] + F4*G[4] + F5*G[5] + F6*G[6] + F7*G[7] + F8*G[8]);
+      
+      // Number of operations: 11
+      I[1] = (F0*G[9] + F1*G[10] + F2*G[11] + F3*G[12] + F4*G[13] + F5*G[14]);
+      
+      // Number of operations: 11
+      I[2] = (F0*G[15] + F1*G[16] + F2*G[17] + F6*G[12] + F7*G[13] + F8*G[14]);
+      
+      // Number of operations: 17
+      I[3] = (F0*G[18] + F1*G[19] + F2*G[20] + F3*G[21] + F4*G[22] + F5*G[23] + F6*G[6] + F7*G[7] + F8*G[8]);
+      
+      // Number of operations: 11
+      I[4] = (F3*G[15] + F4*G[16] + F5*G[17] + F6*G[9] + F7*G[10] + F8*G[11]);
+      
+      // Number of operations: 17
+      I[5] = (F0*G[18] + F1*G[19] + F2*G[20] + F3*G[3] + F4*G[4] + F5*G[5] + F6*G[24] + F7*G[25] + F8*G[26]);
+      
+      
+      // Number of operations for primary indices: 9
+      // Number of operations to compute entry: 1
+      A[0] += I[0];
+      // Number of operations to compute entry: 1
+      A[1] += I[1];
+      // Number of operations to compute entry: 1
+      A[2] += I[2];
+      // Number of operations to compute entry: 1
+      A[3] += I[1];
+      // Number of operations to compute entry: 1
+      A[4] += I[3];
+      // Number of operations to compute entry: 1
+      A[5] += I[4];
+      // Number of operations to compute entry: 1
+      A[6] += I[2];
+      // Number of operations to compute entry: 1
+      A[7] += I[4];
+      // Number of operations to compute entry: 1
+      A[8] += I[5];
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elasticity_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  elasticity_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "e6951279997e6a07751547e18e3cd343cb8024aa818e2bd2d9e3dca9a8805d6b9f297e2b116570de1ddb545f80d89b9571201131863084c0f6250bf28c73f373";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_4();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_4();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new elasticity_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_4();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_4();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new elasticity_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elasticity_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elasticity_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  elasticity_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "1e17626ddf1d776bac151e58c6e5bd4ba11436c4134c74fd78f9c2f8323c86f39f0cc5ce84c73fd7a80dd467b2f1cf174de3ab29e675d983f36ba9ff009a5d2d";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_4();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_4();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_4();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_4();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elasticity_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elasticity_form_2: public ufc::form
+{
+public:
+
+  /// Constructor
+  elasticity_form_2() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_form_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "84a1b16c593dac8cf8b8c7af376a7c4d5e1b3384d72236f8d2ba0d2745abaf15e00d0edd6e577606e07b378b77dfbed41570c0dacc18b6bc1e906b1f625598ec";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elasticity_cell_integral_2_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elasticity_form_3: public ufc::form
+{
+public:
+
+  /// Constructor
+  elasticity_form_3() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elasticity_form_3()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "8cc74328bb84d7dcbe036bba7484a8180753a9e12a34463bdaf14af288021890f32528fdf442ef09ab4c4b2f5cb2743fabacf65a703872abac9207cb316cf2ae";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 3;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new elasticity_finite_element_4();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elasticity_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new elasticity_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new elasticity_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new elasticity_dofmap_4();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elasticity_cell_integral_3_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Elasticity
+{
+
+class CoefficientSpace_disp: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_disp(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_disp(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_disp(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_disp(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_disp(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_disp(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_disp()
+  {
+  }
+
+};
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_lmbda: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_lmbda()
+  {
+  }
+
+};
+
+class CoefficientSpace_mu: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_mu(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_mu()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_mu Form_a_FunctionSpace_2;
+
+typedef CoefficientSpace_lmbda Form_a_FunctionSpace_3;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->mu = mu;
+    this->lmbda = lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda):
+    dolfin::Form(2, 2), mu(*this, 0), lmbda(*this, 1)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "mu")
+      return 0;
+    else if (name == "lmbda")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "mu";
+    case 1:
+      return "lmbda";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_mu;
+  typedef Form_a_FunctionSpace_3 CoefficientSpace_lmbda;
+
+  // Coefficients
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner lmbda;
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_4()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_4()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+class Form_a_s_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_s_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_s_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_s_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_s_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_s_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_s_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_s_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_s_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_s_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_s_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_s_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_s_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_s_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_s_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_s_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a_s: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a_s(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_2());
+  }
+
+  // Constructor
+  Form_a_s(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_2());
+  }
+
+  // Destructor
+  ~Form_a_s()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_s_FunctionSpace_0 TestSpace;
+  typedef Form_a_s_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_s_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_s_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_s_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_s_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_s_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_s_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_s_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elasticity_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elasticity_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_s_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_mu Form_L_s_FunctionSpace_1;
+
+typedef CoefficientSpace_lmbda Form_L_s_FunctionSpace_2;
+
+typedef CoefficientSpace_disp Form_L_s_FunctionSpace_3;
+
+class Form_L_s: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L_s(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 3), mu(*this, 0), lmbda(*this, 1), disp(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_3());
+  }
+
+  // Constructor
+  Form_L_s(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& disp):
+    dolfin::Form(1, 3), mu(*this, 0), lmbda(*this, 1), disp(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->mu = mu;
+    this->lmbda = lmbda;
+    this->disp = disp;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_3());
+  }
+
+  // Constructor
+  Form_L_s(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> disp):
+    dolfin::Form(1, 3), mu(*this, 0), lmbda(*this, 1), disp(*this, 2)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+    this->disp = *disp;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_3());
+  }
+
+  // Constructor
+  Form_L_s(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 3), mu(*this, 0), lmbda(*this, 1), disp(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_3());
+  }
+
+  // Constructor
+  Form_L_s(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& disp):
+    dolfin::Form(1, 3), mu(*this, 0), lmbda(*this, 1), disp(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->mu = mu;
+    this->lmbda = lmbda;
+    this->disp = disp;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_3());
+  }
+
+  // Constructor
+  Form_L_s(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> disp):
+    dolfin::Form(1, 3), mu(*this, 0), lmbda(*this, 1), disp(*this, 2)
+  {
+    _function_spaces[0] = V0;
+
+    this->mu = *mu;
+    this->lmbda = *lmbda;
+    this->disp = *disp;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elasticity_form_3());
+  }
+
+  // Destructor
+  ~Form_L_s()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "mu")
+      return 0;
+    else if (name == "lmbda")
+      return 1;
+    else if (name == "disp")
+      return 2;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "mu";
+    case 1:
+      return "lmbda";
+    case 2:
+      return "disp";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_s_FunctionSpace_0 TestSpace;
+  typedef Form_L_s_FunctionSpace_1 CoefficientSpace_mu;
+  typedef Form_L_s_FunctionSpace_2 CoefficientSpace_lmbda;
+  typedef Form_L_s_FunctionSpace_3 CoefficientSpace_disp;
+
+  // Coefficients
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner lmbda;
+  dolfin::CoefficientAssigner disp;
+};
+
+
+}
+
+#endif
diff --git a/demo/undocumented/elasticity/cpp/Elasticity.ufl b/demo/undocumented/elasticity/cpp/Elasticity.ufl
new file mode 100644
index 0000000..d4555c3
--- /dev/null
+++ b/demo/undocumented/elasticity/cpp/Elasticity.ufl
@@ -0,0 +1,54 @@
+# Copyright (c) 2005 Johan Jansson
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2006-2007
+# Modified by Garth N. Wells 2008
+#
+# First added:  2005
+# Last changed: 2011-03-09
+#
+# The bilinear form for classical linear elasticity (Navier).
+# Compile this form with FFC: ffc -l dolfin Elasticity.ufl
+
+cell = tetrahedron
+element = VectorElement("Lagrange", cell, 1)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+f = Coefficient(element)
+
+mu    = Constant(cell)
+lmbda = Constant(cell)
+
+def epsilon(v):
+    return 0.5*(grad(v) + grad(v).T)
+
+def sigma(v):
+    return 2.0*mu*epsilon(v) + lmbda*tr(epsilon(v))*Identity(v.geometric_dimension())
+
+a = inner(sigma(u), epsilon(v))*dx
+L = inner(f, v)*dx
+
+element_s = TensorElement("Discontinuous Lagrange", cell, 0)
+stress = TrialFunction(element_s)
+w      = TestFunction(element_s)
+disp   = Coefficient(element)
+
+a_s = inner(stress, w)*dx
+L_s = inner(sigma(disp), w)*dx
+
+forms = [a, L, a_s, L_s]
diff --git a/demo/undocumented/elasticity/cpp/compile.log b/demo/undocumented/elasticity/cpp/compile.log
new file mode 100644
index 0000000..c15de6a
--- /dev/null
+++ b/demo/undocumented/elasticity/cpp/compile.log
@@ -0,0 +1,1968 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Elasticity
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 2
+  Coefficients:           '[c_1, c_2]'
+  Coefficient names:      '[mu, lmbda]'
+  Unique elements:        'Vector<3 x CG1(?)>, R0(?)'
+  Unique sub elements:    'Vector<3 x CG1(?)>, R0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Identity.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'Vector<3 x CG1(?)>'
+  Unique sub elements:    'Vector<3 x CG1(?)>, CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'a_s'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[w, stress]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'Tensor<(3, 3) x DG0(?)>'
+  Unique sub elements:    'Tensor<(3, 3) x DG0(?)>, DG0(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Monomial extraction failed: MonomialTransformation does not handle tensor-valued elements
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L_s'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[w]'
+  Number of coefficients: 3
+  Coefficients:           '[c_1, c_2, w_3]'
+  Coefficient names:      '[mu, lmbda, disp]'
+  Unique elements:        'Tensor<(3, 3) x DG0(?)>, R0(?), Vector<3 x CG1(?)>'
+  Unique sub elements:    'Tensor<(3, 3) x DG0(?)>, R0(?), Vector<3 x CG1(?)>, DG0(?
+                          ), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Identity.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0459449 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 5 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 5 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {FiniteElement('Real', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0, 0): array([[ 1.]])}}}, VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 1, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 0, 0): array([[[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]]]), (0, 0, 1): array([[[ -1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.11022302e-16],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [ -1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.11022302e-16],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [ -1.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.11022302e-16]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.00000000e+00]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1': array([[ 1.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]])}
+  
+  tables: {'FE0_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE0_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE0_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1': array([[ 1.]]), 'FE0_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE0_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE0_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C2_D001': 'FE0_C2_D001', 'FE0_C1_D001': 'FE0_C1_D001', 'FE0_C1_D010': 'FE0_C1_D010', 'FE0_C2_D010': 'FE0_C2_D010', 'FE0_C1_D100': 'FE0_C1_D100', 'FE0_C0_D100': 'FE0_C0_D100', 'FE0_C0_D010': 'FE0_C0_D010', 'FE0_C0_D001': 'FE0_C0_D001', 'FE1': 'FE1', 'FE0_C2_D100': 'FE0_C2_D100', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0_D001': array([[-1.,  1.]]), 'FE1': array([[ 1.]]), 'FE0_C0': array([[ 0.25,  0.25,  0.25,  0.25]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C2_D001': ('FE0_C0_D001', (9, [8, 11]), False, False), 'FE0_C1_D001': ('FE0_C0_D001', (5, [4, 7]), False, False), 'FE0_C1_D010': ('FE0_C0_D001', (6, [4, 6]), False, False), 'FE0_C2_D010': ('FE0_C0_D001', (10, [8, 10]), False, False), 'FE0_C1_D100': ('FE0_C0_D001', (7, [4, 5]), False, False), 'FE0_C0_D100': ('FE0_C0_D001', (3, [0, 1]), False, False), 'FE0_C0_D010': ('FE0_C0_D001', (2, [0, 2]), False, False), 'FE0_C0_D001': ('FE0_C0_D001', (1, [0, 3]), False, False), 'FE1': ('FE1', (), False, True), 'FE0_C2_D100': ('FE0_C0_D001', (11, [8, 9]), False, False), 'FE0_C2': ('FE0_C0', (8, [8, 9, 10, 11]), False, False), 'FE0_C1': ('FE0_C0', (4, [4, 5, 6, 7]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2, 3]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00146 seconds
+  Shape of reference tensor: (12, 12)
+  Primary multi index:   rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  Internal multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [12] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {TensorElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, shape=(3, 3), symmetry=None, quad_scheme=None): {None: {None: {(0, 0, 0): array([[[ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.]]])}}}, VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 1, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 0, 0): array([[[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]]]), (0, 0, 1): array([[[ -1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.11022302e-16],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [ -1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.11022302e-16],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [ -1.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.11022302e-16]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.00000000e+00]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE1_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE1_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE1_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE1_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE1_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C8': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  1.]]), 'FE0_C7': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  1.,  0.]]), 'FE0_C6': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  1.,  0.,  0.]]), 'FE0_C5': array([[ 0.,  0.,  0.,  0.,  0.,  1.,  0.,  0.,  0.]]), 'FE0_C4': array([[ 0.,  0.,  0.,  0.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C3': array([[ 0.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2': array([[ 0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0': array([[ 1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE1_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE1_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE1_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE1_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE1_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE1_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE0_C8': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  1.]]), 'FE0_C7': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  1.,  0.]]), 'FE0_C6': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  1.,  0.,  0.]]), 'FE0_C5': array([[ 0.,  0.,  0.,  0.,  0.,  1.,  0.,  0.,  0.]]), 'FE0_C4': array([[ 0.,  0.,  0.,  0.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C3': array([[ 0.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2': array([[ 0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0': array([[ 1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE1_C0_D001': 'FE1_C0_D001', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C2': 'FE1_C2', 'FE1_C0_D100': 'FE1_C0_D100', 'FE1_C2_D001': 'FE1_C2_D001', 'FE1_C2_D010': 'FE1_C2_D010', 'FE1_C0_D010': 'FE1_C0_D010', 'FE1_C1_D010': 'FE1_C1_D010', 'FE1_C1_D100': 'FE1_C1_D100', 'FE1_C2_D100': 'FE1_C2_D100', 'FE0_C3': 'FE0_C3', 'FE0_C8': 'FE0_C8', 'FE0_C7': 'FE0_C7', 'FE0_C6': 'FE0_C6', 'FE0_C5': 'FE0_C5', 'FE0_C4': 'FE0_C4', 'FE1_C1_D001': 'FE1_C1_D001', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0_D001': array([[-1.,  1.]]), 'FE1_C0': array([[ 0.25,  0.25,  0.25,  0.25]]), 'FE0_C0': array([[ 1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE1_C0_D001': ('FE1_C0_D001', (10, [0, 3]), False, False), 'FE1_C0': ('FE1_C0', (9, [0, 1, 2, 3]), False, False), 'FE1_C1': ('FE1_C0', (13, [4, 5, 6, 7]), False, False), 'FE1_C2': ('FE1_C0', (17, [8, 9, 10, 11]), False, False), 'FE1_C0_D100': ('FE1_C0_D001', (12, [0, 1]), False, False), 'FE1_C2_D001': ('FE1_C0_D001', (18, [8, 11]), False, False), 'FE1_C2_D010': ('FE1_C0_D001', (19, [8, 10]), False, False), 'FE1_C0_D010': ('FE1_C0_D001', (11, [0, 2]), False, False), 'FE1_C1_D010': ('FE1_C0_D001', (15, [4, 6]), False, False), 'FE1_C1_D100': ('FE1_C0_D001', (16, [4, 5]), False, False), 'FE1_C2_D100': ('FE1_C0_D001', (20, [8, 9]), False, False), 'FE0_C3': ('FE0_C0', (3, [3]), False, True), 'FE0_C8': ('FE0_C0', (8, [8]), False, True), 'FE0_C7': ('FE0_C0', (7, [7]), False, True), 'FE0_C6': ('FE0_C0', (6, [6]), False, True), 'FE0_C5': ('FE0_C0', (5, [5]), False, True), 'FE0_C4': ('FE0_C0', (4, [4]), False, True), 'FE1_C1_D001': ('FE1_C0_D001', (14, [4, 7]), False, False), 'FE0_C2': ('FE0_C0', (2, [2]), False, True), 'FE0_C1': ('FE0_C0', (1, [1]), False, True), 'FE0_C0': ('FE0_C0', (0, [0]), False, True)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {FiniteElement('Real', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0, 0): array([[ 1.]])}}}, TensorElement('Discontinuous Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 0, shape=(3, 3), symmetry=None, quad_scheme=None): {None: {None: {(0, 0, 0): array([[[ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 0.],
+          [ 1.]]])}}}, VectorElement('Lagrange', Domain(Cell('tetrahedron', 3), label=None, data=None), 1, dim=3, quad_scheme=None): {None: {None: {(1, 0, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 1, 0): array([[[-1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.],
+          [ 0.]]]), (0, 0, 0): array([[[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.25],
+          [ 0.  ],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.25],
+          [ 0.  ]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]],
+  
+         [[ 0.  ],
+          [ 0.  ],
+          [ 0.25]]]), (0, 0, 1): array([[[ -1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.11022302e-16],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  1.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [ -1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.11022302e-16],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  1.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [ -1.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.11022302e-16]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  0.00000000e+00],
+          [  1.00000000e+00]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE1_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE2': array([[ 1.]]), 'FE0_C8': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  1.]]), 'FE0_C7': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  1.,  0.]]), 'FE0_C6': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  1.,  0.,  0.]]), 'FE0_C5': array([[ 0.,  0.,  0.,  0.,  0.,  1.,  0.,  0.,  0.]]), 'FE0_C4': array([[ 0.,  0.,  0.,  0.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C3': array([[ 0.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2': array([[ 0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0': array([[ 1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE1_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE1_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE1_C0_D010': array([[-1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D010': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  0.,  1.,  0.]]), 'FE1_C1_D010': array([[ 0.,  0.,  0.,  0., -1.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE2': array([[ 1.]]), 'FE0_C8': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  1.]]), 'FE0_C7': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  1.,  0.]]), 'FE0_C6': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  1.,  0.,  0.]]), 'FE0_C5': array([[ 0.,  0.,  0.,  0.,  0.,  1.,  0.,  0.,  0.]]), 'FE0_C4': array([[ 0.,  0.,  0.,  0.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C3': array([[ 0.,  0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C2': array([[ 0.,  0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C1': array([[ 0.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE0_C0': array([[ 1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C0_D001': array([[ -1.00000000e+00,   1.11022302e-16,   0.00000000e+00,
+            1.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0': array([[ 0.25,  0.25,  0.25,  0.25,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE1_C1': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.25,  0.25,  0.25,  0.25,  0.  ,
+           0.  ,  0.  ,  0.  ]]), 'FE1_C2': array([[ 0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.  ,  0.25,
+           0.25,  0.25,  0.25]]), 'FE1_C0_D100': array([[-1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,  -1.00000000e+00,
+            1.11022302e-16,   0.00000000e+00,   1.00000000e+00]]), 'FE1_C1_D100': array([[ 0.,  0.,  0.,  0., -1.,  1.,  0.,  0.,  0.,  0.,  0.,  0.]]), 'FE1_C2_D100': array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0., -1.,  1.,  0.,  0.]]), 'FE1_C1_D001': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,  -1.00000000e+00,   1.11022302e-16,
+            0.00000000e+00,   1.00000000e+00,   0.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE1_C0_D010': 'FE1_C0_D010', 'FE1_C2_D010': 'FE1_C2_D010', 'FE1_C1_D010': 'FE1_C1_D010', 'FE2': 'FE2', 'FE0_C8': 'FE0_C8', 'FE0_C7': 'FE0_C7', 'FE0_C6': 'FE0_C6', 'FE0_C5': 'FE0_C5', 'FE0_C4': 'FE0_C4', 'FE0_C3': 'FE0_C3', 'FE0_C2': 'FE0_C2', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0', 'FE1_C0_D001': 'FE1_C0_D001', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C2': 'FE1_C2', 'FE1_C0_D100': 'FE1_C0_D100', 'FE1_C2_D001': 'FE1_C2_D001', 'FE1_C1_D100': 'FE1_C1_D100', 'FE1_C2_D100': 'FE1_C2_D100', 'FE1_C1_D001': 'FE1_C1_D001'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_C0': array([[ 1.]]), 'FE1_C0_D001': array([[-1.,  1.]]), 'FE1_C0': array([[ 0.25,  0.25,  0.25,  0.25]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE1_C0_D010': ('FE1_C0_D001', (11, [0, 2]), False, False), 'FE1_C2_D010': ('FE1_C0_D001', (19, [8, 10]), False, False), 'FE1_C1_D010': ('FE1_C0_D001', (15, [4, 6]), False, False), 'FE2': ('FE0_C0', (), False, True), 'FE0_C8': ('FE0_C0', (8, [8]), False, True), 'FE0_C7': ('FE0_C0', (7, [7]), False, True), 'FE0_C6': ('FE0_C0', (6, [6]), False, True), 'FE0_C5': ('FE0_C0', (5, [5]), False, True), 'FE0_C4': ('FE0_C0', (4, [4]), False, True), 'FE0_C3': ('FE0_C0', (3, [3]), False, True), 'FE0_C2': ('FE0_C0', (2, [2]), False, True), 'FE0_C1': ('FE0_C0', (1, [1]), False, True), 'FE0_C0': ('FE0_C0', (0, [0]), False, True), 'FE1_C0_D001': ('FE1_C0_D001', (10, [0, 3]), False, False), 'FE1_C0': ('FE1_C0', (9, [0, 1, 2, 3]), False, False), 'FE1_C1': ('FE1_C0', (13, [4, 5, 6, 7]), False, False), 'FE1_C2': ('FE1_C0', (17, [8, 9, 10, 11]), False, False), 'FE1_C0_D100': ('FE1_C0_D001', (12, [0, 1]), False, False), 'FE1_C2_D001': ('FE1_C0_D001', (18, [8, 11]), False, False), 'FE1_C1_D100': ('FE1_C0_D001', (16, [4, 5]), False, False), 'FE1_C2_D100': ('FE1_C0_D001', (20, [8, 9]), False, False), 'FE1_C1_D001': ('FE1_C0_D001', (14, [4, 7]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.534044 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.0350552 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 5 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Z
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: d_22
+  Removing unused variable: d_21
+  Removing unused variable: d_20
+  Removing unused variable: d_12
+  Removing unused variable: d_11
+  Removing unused variable: d_10
+  Removing unused variable: d_02
+  Removing unused variable: d_01
+  Removing unused variable: d_00
+  Removing unused variable: C2
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Z
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: d_22
+  Removing unused variable: d_21
+  Removing unused variable: d_20
+  Removing unused variable: d_12
+  Removing unused variable: d_11
+  Removing unused variable: d_10
+  Removing unused variable: d_02
+  Removing unused variable: d_01
+  Removing unused variable: d_00
+  Removing unused variable: C2
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Z
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: d_22
+  Removing unused variable: d_21
+  Removing unused variable: d_20
+  Removing unused variable: d_12
+  Removing unused variable: d_11
+  Removing unused variable: d_10
+  Removing unused variable: d_02
+  Removing unused variable: d_01
+  Removing unused variable: d_00
+  Removing unused variable: C2
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 5 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: area
+  Removing unused variable: s
+  Removing unused variable: lc
+  Removing unused variable: lb
+  Removing unused variable: la
+  Removing unused variable: v2v3
+  Removing unused variable: v1v3
+  Removing unused variable: v0v3
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.318027 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00113702 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Elasticity.h.
+  
+Compiler stage 5 finished in 0.00136614 seconds.
+
+FFC finished in 0.935968 seconds.
diff --git a/demo/undocumented/elasticity/cpp/main.cpp b/demo/undocumented/elasticity/cpp/main.cpp
new file mode 100644
index 0000000..aaedc4e
--- /dev/null
+++ b/demo/undocumented/elasticity/cpp/main.cpp
@@ -0,0 +1,197 @@
+// Copyright (C) 2006-2009 Johan Jansson and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2008
+//
+// First added:  2006-02-07
+// Last changed: 2012-07-05
+//
+// This demo program solves the equations of static
+// linear elasticity for a gear clamped at two of its
+// ends and twisted 30 degrees.
+
+#include <dolfin.h>
+#include "Elasticity.h"
+
+using namespace dolfin;
+
+int main()
+{
+  // Dirichlet boundary condition for clamp at left end
+  class Clamp : public Expression
+  {
+  public:
+
+    Clamp() : Expression(3) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = 0.0;
+      values[1] = 0.0;
+      values[2] = 0.0;
+    }
+
+  };
+
+  // Sub domain for clamp at left end
+  class Left : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] < 0.5 && on_boundary;
+    }
+  };
+
+  // Dirichlet boundary condition for rotation at right end
+  class Rotation : public Expression
+  {
+  public:
+
+    Rotation() : Expression(3) {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      // Center of rotation
+      const double y0 = 0.5;
+      const double z0 = 0.219;
+
+      // Angle of rotation (30 degrees)
+      const double theta = 0.5236;
+
+      // New coordinates
+      const double y = y0 + (x[1] - y0)*cos(theta) - (x[2] - z0)*sin(theta);
+      const double z = z0 + (x[1] - y0)*sin(theta) + (x[2] - z0)*cos(theta);
+
+      // Clamp at right end
+      values[0] = 0.0;
+      values[1] = y - x[1];
+      values[2] = z - x[2];
+    }
+
+  };
+
+  // Sub domain for rotation at right end
+  class Right : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] > 0.9 && on_boundary;
+    }
+  };
+
+  // Read mesh and create function space
+  Mesh mesh("../gear.xml.gz");
+  Elasticity::Form_a::TestSpace V(mesh);
+
+  // Create right-hand side
+  Constant f(0.0, 0.0, 0.0);
+
+  // Set up boundary condition at left end
+  Clamp c;
+  Left left;
+  DirichletBC bcl(V, c, left);
+
+  // Set up boundary condition at right end
+  Rotation r;
+  Right right;
+  DirichletBC bcr(V, r, right);
+
+  // Collect boundary conditions
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bcl);
+  bcs.push_back(&bcr);
+
+  std::vector<const DirichletBC*> _bcs;
+  _bcs.push_back(&bcl);
+  _bcs.push_back(&bcr);
+
+  // Set elasticity parameters
+  double E  = 10.0;
+  double nu = 0.3;
+  Constant mu(E / (2*(1 + nu)));
+  Constant lambda(E*nu / ((1 + nu)*(1 - 2*nu)));
+
+  // Define variational problem
+  Elasticity::Form_a a(V, V);
+  a.mu = mu; a.lmbda = lambda;
+  Elasticity::Form_L L(V);
+  L.f = f;
+  Function u(V);
+  LinearVariationalProblem problem(a, L, u, bcs);
+
+  // Compute solution
+  LinearVariationalSolver solver(problem);
+  solver.parameters["symmetric"] = true;
+  solver.parameters["linear_solver"] = "direct";
+  solver.solve();
+
+  // Extract solution components (deep copy)
+  Function ux = u[0];
+  Function uy = u[1];
+  Function uz = u[2];
+  std::cout << "Norm (u): " << u.vector()->norm("l2") << std::endl;
+  std::cout << "Norm (ux, uy, uz): " << ux.vector()->norm("l2") << "  "
+            << uy.vector()->norm("l2") << "  "
+            << uz.vector()->norm("l2") << std::endl;
+
+  // Save solution in VTK format
+  File vtk_file("elasticity.pvd", "compressed");
+  vtk_file << u;
+
+  // Extract stress and write in VTK format
+  Elasticity::Form_a_s::TestSpace W(mesh);
+  Elasticity::Form_a_s a_s(W, W);
+  Elasticity::Form_L_s L_s(W);
+  L_s.mu = mu;
+  L_s.lmbda = lambda;
+  L_s.disp = u;
+
+  Function stress(W);
+  LocalSolver local_solver;
+  local_solver.solve(*stress.vector(), a_s, L_s);
+
+  File file_stress("stress.pvd");
+  file_stress << stress;
+
+  // Save colored mesh paritions in VTK format if running in parallel
+  if (dolfin::MPI::size(mesh.mpi_comm()) > 1)
+  {
+    CellFunction<std::size_t>
+      partitions(mesh, dolfin::MPI::rank(mesh.mpi_comm()));
+    File file("partitions.pvd");
+    file << partitions;
+  }
+
+  // Write boundary condition facets markers to VTK format
+  MeshFunction<std::size_t> facet_markers(mesh, 2, 0);
+  left.mark(facet_markers, 1);
+  right.mark(facet_markers, 2);
+  File facet_file("facet_markers.pvd");
+  facet_file << facet_markers;
+
+  // Plot solution
+  plot(u, "Displacement", "displacement");
+
+  // Displace mesh and plot displaced mesh
+  mesh.move(u);
+  plot(mesh, "Deformed mesh");
+
+  // Make plot windows interactive
+  interactive();
+
+ return 0;
+}
diff --git a/demo/undocumented/elasticity/cpp/plot.py b/demo/undocumented/elasticity/cpp/plot.py
new file mode 100644
index 0000000..4c99b66
--- /dev/null
+++ b/demo/undocumented/elasticity/cpp/plot.py
@@ -0,0 +1,4 @@
+from dolfin import *
+
+u = Function("elasticity.xml")
+plot(u, mode="displacement", lutfile="VIF.lut")
diff --git a/demo/undocumented/elasticity/gear.xml.gz b/demo/undocumented/elasticity/gear.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6bf6b3067f1756223b55369ac28557609630f2fb
GIT binary patch
literal 500213
zcmV)%K#jj2iwFQB^h!|x1B{hHZo?oDMfW)cV&B*d0|Ql@?0SOs098yIONm{@R+IMh
zrB0yPG{eRcV*d9V_+zg&=fhrnhU3@`eIwPfmLl}qq3!zjM!q~hJvg~pFBYqI*uQnX
zh}Hf0cv&=ZH%%XpRdqU@mT#f&w&QX*zE_vsO0E||tPWw^iEY^Lr>~FD$SF+6*Ij6j
zLoY?!9U7_Ux>y+@rfwTXF?Qdv(m8LhTi4BS7G2+lb0Z_<?{jIOw%$qcH7}e|prrWz
zUDRNtsQ!_wBsb)3mRn=W<iN^NX#o4bgJ$_T2TTs6ji=;*1hp$^!6doU9(0leVyz1S
zEDOLnP<8+d*}ze43k@9G#N9LSSx(xUs~o*Iz9>UEgAN^Hl9QiRMf^%}1grzx90B<Z
zVTg($G;4AH9C8vZ%-|P&yb)J6i-y&+E#xc$X-rW<Wyu!}gCbVXBBU(F+oPOCRG@WP
zno<~%92uAOaU6>DkkeRe>u%nUK!q)UVlD0?0NVnKkg|x{T6L3!Xi|ibvWUhQ%q_$Y
zT<JJ~VJ+?>ShfWgA;l3@{H4I(M9$yY0tCnE{}6r{FO%yCVi1U?1Y#5UCuV$@;$n~L
z^;tB_hk}1h07tcpT836~O>Odg|CGoNj((8Fn8}__IdHZNzVeh(%ED;&aNubGG^(d4
z^huf?&KA!wzNY~+&UAISP^l-W_q9D8S9ej7qENK^{Qolr{dD2EE6HEOc|><Ql!?MI
z8C6mo?`L(RW`dv1Lf((gw}f7*3Jwx|H2TA0pA_!*;P5x?iRa~lUMd^$wJ$aRV)lFp
zL9Z8WV_~e6wIRi20W1y)_NhXL-0g*@3*d2d9;<u%)PhSTV6=8DD?M!Q<?!+$K;wxp
z_>eLy54F1M#t@)+4v|#e2M~G04~WckZZ5<MwH?g&E>Yus*zwq^z+sjy<?;X|buLBS
zJV<dT&?>cB*~TDYbPOxiwexLaC~j?wm1;9z7K*&$fa5gt;+*XnWC%Zum(h^~AP7Ty
zxe62oLjR2|dvk{SOaV9&9sz!0Ms?ef4GLJY4Dpcc3j#xA_lV@LVGIXs(&!Cb|H32k
z^f@*j8>{az=?{;_lTj?BLv#3WM*F2Lc$>8*K=AWr)6$+giIJ244!Yw3WRDLpiB(8G
z;oGHQACJb<{M-0@*pf^o*Tfg&(SO$N`6Pu|wVd&_DpU>9MuT-;C4lXkF(xrgTp9wr
z_g*cB`;P>t20a{>JZF<I!s1egd#`IbkjAo&hY}j?C7XK=j$M85jk}k`QVxsvJ``cO
zuGGy*6muIWqdDXZFf?}YsiN(Kbb)|0o-jHJdig(+w}T{}vy)X=aF;v<B=NgvumbyB
zeMEyaHjX?$`i-rxJ0OkL6Tv5st;t9jErZd!N}q5biyOa3!`~Y>Od8T4i(Px((`^YW
zrJe?1+zn%qq&V8*TO`q1cfx%1wYMINR<Loki^7L7GdhAG1Yu}PxPnOkja|H%OZMkR
z8hE=ZghX5IRIEkAJmCrgfcA7LTE;wvjVWZa9k965w|@cjiyNv$qk<n_U4lXk4xa-m
zpmMWGP=rAr$z|xq`36vkL3}Kk&bhjTtr+Af0!;L366hK|qUMXhJb57uqiKZM&`#!X
zUUyy*y5EV?U#xn3b`eZ5r>}%qvRzjMtI|$w%QmjqU4+a0x||mh;nQA7XyTgXtF&kP
zL|B=IP)?Cr)3bddtW86nCBiLgbrF=xjWofbca$N!2&!c~rqK=QZtn%3W)P`fqZ{ho
zM`(KI%q;_945wFw2KYA>|6J7Y?pE+=22#I5XKLO)kRj2;hh3^$^nwGX>O5ckXHYiF
zd5wwUtm$n8t21LryJPAe@Xla)E(o7m74n^J2E`Mz|D}AZqKzmGkqquA#vi@qmBH5<
zkCN!*xl3syhTbVkJDN|mH{<(Y^P$Y#t^)>P7`l?d_>uh=t4U8JzKXkmP7=tqEd4@U
zrch!`>%R#@@;$>yaYc1@*I*D7Z}#%V2aMY98VrL98qioK(*GVr=z3f1FQ)Z>XfP0}
zQ-;@cr(3&gFcg{r04~-37X?F~G04#Ez}pv0kNt;rUin|`O8}y^cRh#1^!5cqkyC?g
z#^gka_L(R*p<x`2b;i+u3~oZ=NNCcJmi(@Prn^S;07z>&1W4zOLiH~VRNXsPIbn>s
zbl1Qg%}hIB?9rA;dT}EJy>Qll3>G^vSqH?lz6P6}sGpQD-sY>VF}Rozg0&_071(^s
z%g#?j;Jxk|0I98Gx<&0r?NedVQ{=G2m20*y7>gb)E5;4S+}jf1XjyqC%Jq3+%kLWG
zD4owE$tdtHfje5vg8%Z&*?$w}>$Uq6#g?o67_57wm<sx+%hT6jvN;SZ#!e8x^ScH>
z>L~(({V-~7$r6Mh4Be87i0*%5H$9Jpk6R-P=#&pgBL`^ga)1&0m`5sUalqv`C-pJM
zFF{9&M_YXvE<+DexE=8Ga)6QkIBrGxhQgSywy|QjUxrTl;~n>T{(H9FH8{kE&qSf{
zULp;=YcNbv)q6rX*30V<2093P`Jgq<t=u)}q^G@xhQ2-+y}TE)poik97>v2~ce-lO
zOOdLn%*W$nl{Ey-cL;_=LOOSiJWFIf)#z5=%TlwZAN^_Zjw;6~+0aB(^$_(=rhe6s
zo9?Z~Rd37ccPn~sE-Q@kfsznGU@_tLgrSu;LP~@R-BqDKyrsU5p*F`<Z{J$0Cv74{
zagv#~!N&MqV~UtfRkpS*%1J9)wBEk;>FxGbPg)Tp$NFW+ZliuL8p2#6Z%==Ce9yy>
zmG)~0lhg>y@I)ZH%=E6ov0!*nr0RIqHMXWPAIFd(51z+eL*tm9+Pv1-X1GgmI=Icq
zcFgFo{zthLAUP0%urDowBLDx`VP`I3=B|}Kpy{|`3?beil-E-fk#4c0jR7jn9~m)b
z8vs1I^=0Awy;trSivgxx8ifb5?K_0iwNVTuW9^vzr7#eeiVPT2D535c^zTn<1XP@j
zQ~RU@4SZvT?$d6xA%qa@-*#@Ywu?NNLlURWYS~h?OB918jTFjQ%DH0t7#zEM(Ckq4
z*{-l)2E?5rJ;kx~zXyoabuhv(Euz1*7<aDR83_Heu6CIQi8PPwWMojGTuvbMTwCuk
zK%{n>495Ky`uiKkc=*sKq73Z(3kdM&(ESvv!nrM1jKTLhPZ@WOZ<Yck&6D#Klfa~p
zfwvYZL9{UXBBNh1CL5no%xCK(fJ)Cl|9d4|A!tFF6bQH3h5(bg))-_2LQ{7PdinDu
z41ep(b{j+J<)<2iUJ#Sn{v1Lxe-&M9+AmRI#@IYKq8FVXF@7kwk{gC$7`Bpi+4BC2
z)kaZKMIT`Y2oYbpNPb~J)u~d+Den-+X$;4>qscu^xvuol3h2<QcLBzp{FXvemjVTm
z$8!E?A!4$P@lWLZ0|P>)*bsE3Ilq(&q#^BwY3#|GDHQ&o@TT${wp3{h*d~4MrmxdM
z`$~#)3b(+R;ndp8XpD-a_GWZHB8>G1MnzI{1J|=ooyhNLMN%{CBZ4VTW7HVR1l`wd
z8jN-<73XyRqepau=I|LKVS$Tm5m|WimZEc#)f0=;OM!3b6zTcXDLj8Kpu4~1H9_wL
zoI`IXXJt1U079osAe_SyejR=Kgvrr)@=0GUc!%yFuoC3GX7qD~e`v-)f*j(sk4vrb
z_6AwW3g>?Vw0*Xc_N1lYkEP{$uR8GRLxSE?&`mK7>fS4Apv`@tn_OdHh6P#YGlVwD
zzM@;%ZgepJ@J%mDuINgF5QMd)h=Bb!c5rt~_{<hCJX8=Q$&^TNACP=sC~pI`J}~u3
z6MVwzDD}2uFcbNNQ}C4)^&rhX=eN}1hdLONxutZJD#%ZMyW<F7{BC?=)Wo2PuL{dC
zRi(kE{Cvxp(sKVbXq+kEYn^6q*?KhDRvKr@?hns{s2S(ujhtSG3KG6%fyS*w+rR~v
zBTDkeeSfivp$93y`9)a!@W)a8w_$OWbHdw+tjg^~HD6zB<tHjLA0T9Xd7T^SMF-_s
zeo@cVHmy#PhL>#H1N-;JFF?%5su7w?1dXHhfQE2F;KX3E<&#S}VRZvbY2b{`bLr*u
z>4vZjOc1Zj7rD`>QjwUaelR$(kr?7KTLT<uh<|aQ9h-YO4m9uZ!-Z7?N(F=q<}$L~
zc`v%<tO5Px1UeU1j=y+h4=h8#XWWT4oRqJzITXIjXo-Y0o|HG{9vZy254ntf68Q?C
z1;jr5P;zd`6~iD5-I9ZiAN$`}p`CL4ac82t0mg9>kPzZOz__-VpcPCz_QhlPwb6z8
z@w*d64^oWC4?|MH2e$T)q9X;ggAF~&jr2nl9f~~BsG|W5wEBUH6!iXTem-`(w!@)8
zP#KC0U}2g|*wBxLcN!0Cd{fL(kmB|xcC;XB+Fy=-l%R+fiZvhlDeB|2T|{PkmLu&D
ze$8nZo%!@DXaN`&30Al-sYCyyN<H#6NLAb0qa_-YqbS_y);B_Z3BbHvZwumarg#fz
zMp?D5CotDDHmcD%Se7%0W{@-_qunltWR8{VNd`00j9d>HY*SpfgBdAO9g_%w^v)Nj
z@K2-UL0stjzMKMj{?P77BBcg^n>VDyND^E8zi}h2z*L(wb=mvg@1YQ;|BaKBY;U4p
zqnA)LQxsmDqp8M|UP94KYZg71J;zi-6u^uZvM(#p8bb|H5Hn>}(E9MMMktJ#ODdQs
zv%Wr9SAHnDwj2RM5OyV%hj9OkEhZbv$0pOg0GUxNXlefr(Jkg<FUL^Y-t>m}xJtqq
z!St}&ENPOc%FR^82W(qDL*Vi=^1Bc(g<ejym=S0Nd~IRVVpzpFq(G^r$u1|X;_8e*
z$5Z=3=LNjt%pLOjI%CS_1-#-k<wD)Q?xDW|wY(aWQO1rX8)E2@&iDwsbObP%E5?89
zFnUAoD25wCkE#qT;6RM@CdYtTuJnI2a5^wA9YpMxCPA7P@@M~tq*!33zhg9T`i2+G
zku;@4G;mtA`oq0q)6yGhTF9R*C&1U@^1q^pVLC?FL8W}hXz(-(%uZBM`NxtrdOo`_
zAGaV{RwW0oM|X`Elj>ObeTl!`;oh@N@G&|`pZgSIcnT}Ok>-Ug(=g$z$7vamG&f|o
z$}xrmQ|Qyu+>rT=evo^PrL>w-njWhAErfdofQt_S^3oTkgbGFuzZ$<;`a{VT-8vA1
zu$4l9gzUfABdUt|s1&~iTy)p?f{nTDNFWZ7EXqF(WRavf87`QIdt+>Hxd&)e=i=+Y
z?oERan>-qmKD6ZyWjC<UA|8R4@ro2^xkK3yVDDnA{LUGTA*iF9b`eWyj3U$9n?SqH
z+YpaYWV%ILo^r&QG=>3Vz+<-=%Gcp|ri!Ux(?zFNwEUr!#}w<O%t!F=Wuryeqp9e~
zsJ<}*SK`s`_IHev#%K<a&GXA#eqz8RlG#>eWwWq^#=z?01FwIq;H!Y<dB$w{ETi*T
z>P_~vmIv75A9WO&UXQzDZ2HYQ1SW5{C?6#`z9AqnO|d3xpmls>Kw@$jPM1ubJ}fPd
z<Qpo{UEE3^d^kq=+lVE^N4KKl01Cq>&&p}L55y;pA*drTY$VC{Mq?D2Mt<}$e6?47
zDBl=GreQF-PyTI&&=>}cHn5}{!oVA&$Ta46Ys(*HSCk|=2*R#}A`17v*n{0!!e8?a
z&`hhCK@#XsmaWFWN0VtDTN&ixmxgFAO$xKot8Za6MssNyHwPaJ9~~W~CvRWKDPuo6
zO5fDm=gvX}`^M-fl`Sy!N(L#9(PUZ@11gDSRirU62wno^-RefBBONl5;lBo6g$^FV
zP#}oW5>Wm=8Uq92b2B%{bT2y4p(CwpHtzR}Ur~o$8*{tzesBDjbdbgi_)=VOR=&*q
z+EUVuwK2~x(^9(0LR(F`5egT*pri5|qM0=6n$b+U{O}lx<rtHcccAn48{+_DR3`Je
zcW8`e(vr=GJ>>q!k~WjZ##pz=^!+><qp7r7PEc9Q+YTQdj`VnsvI*ajq>ci<V!}r9
zm-85{E?xb#JN<2oFM3H^T)OLwW?7N@=<sNLDN~K5J`TR|@6l8m&?~FOiGK_HRpX6}
zG9Ow>W5Az$ZP@w!1~C3nb_F>M!yxQSAwWp}|FMxt!yG2nz4l<WA)*Pk;R$0kjWhZ$
z=DmmZ&FN|5HPFQVa%IY6K%cz5J51w6RDQcOFK`--5jSPMFIGHL3~Byjr~M*UG*evv
zF`B`P8vhm(7y@CK`0}7Jv@nL_hCkJf{}uy=wsh>!!#-npt>_NuHD(^{7LBnA!zWyo
zbE8?&Ge)J-Gg?=ijEeE^QK>X`>u{gDX7U)Q>92$1VD4VpYi5F~{*==@{tLYx#W-Ch
zDhgsTl-?c!z1>8?WBaug&=`tzj9w0R;FBATfniw@V7c@8pu>VOMV3p@q~FGGb<8Qc
z<Bd?aJ@O*7Fni=51yXpKdT0!|JJ0sU`tz1ZE9xoc=(UF6h1*u-Q%GJpa4-#Bo5nyo
zH64h{(!FR5q|^DWqy2u^N)J!6VxJ;&4#>PObwp!W!)S9t&fu5S0nr8$Ty@BQj1Og3
zkOVOZ!oCE83jhDu>g+7xuro~`P=;13U;_DPW5I@^w$@0xzsd`I+CwKu!$U;*WeNBp
zl{ciO=A><8+hTufjz<%Qkbm;+HbOJ#FKVcszT?AxvBiyd0~b-Eqm>Jr?xS&Q7f~Qo
zT*U+4griyz+<2Ua2E929<oZx>8xy3$XA_{8Xv<4aF-`aHxq)9YTHnZAnuE3hg2_3z
zaCF$44F-Tz+l+HtLW?9huqRRQP4C5?(o5@2jxcc?+jrg%X`^Xldb<D$x--cOdYUJN
z0yodw1gK{lpffjpnz&?MI<ge>G^Yb<IT3%+J$UYj_&HjH%Y5Mn2+gY4rrV5nBN}f9
z^V^rW@Sn6!(i8F99Dh?%g{oku9c{>U3>%!Zh8O0vPdr0Ps<)?`*RiTtf7~d@=xPq}
zayMSM(>XaY;qd-6i+q*e{tOYZHfsAtBZwF3wBu^+v~*I*6*<m+D7%6r2|^I|rM5xA
z|9@<;W{c!7wPqjCGwBksF(Le-sMJfg{xq=Vj-pTcGr9&>&o;Dn6mP~UA2%b7`7@@D
zqN8(D4|JZoRFV~Y^G$_<f@|51)CZg)LXG4hAMX+c#7obUb&I{4NZgxgsujgGZLVp0
z8;3X5R4Y0l(F-?mr#H`3(fyLHInwm#ZlbB8n?1!Aw1yWH9hg~vjMa$cdb((ysU9=P
z{BnVYyr4kZjDbCtb1of4(@b%Cm(dq$S_6bP#S~RmV2ka1wE?-_{8CiO7$h|unrhzz
z8FMDy;55kVA<^toIBsZ;vC%)0X46Y?>_mv0PHj-HH@8&9GWq(~$BM4}_a>K)Gr=>z
zHMCz)^mpf84$ag2Oyf{~035xMmuuzD)K-*OrPCsd<9uxWAO)=yVerfvWEFft0j*O`
za9huWlaPSIATpu>J>%Ib3dly2f~tyVZIq!WX+}4VYSNpe9CXsT`!JfD@&47y@k7~_
z<w^{Luqy=$S?+(aM>HC2%}@Of5R|4QEXF_r5DpCho=*Jrm-PsR?(lGGXz8K=)HZQ9
zOaBMOH-IAfZ2^L>&_}=pqeurv^!d;Ul_8;y!1AH8Bs*Kb8V6isJB+2LYf9M=(ln<i
zyF8tty)g$w<7p@b${p$sKs26IQIN6pyV>AT`4ZGGdL*WuzEsIaV@K;EU+t~m8W>ka
zd{wg^1;Y)k*k_2l$VQIpUMKy}KpyE;gtdr7cZV{CQze09BS$47s4^nvn5u~OF)zpp
z(^EmMt0Fr5F>^TEc>`lrMBDLmsCaNKbv@k6jjHroFAw<1MvTg}qmDAAs3|K&t7fSL
zk#r6Dl2;K(#7|~*$|K3rD8Wgc@^4+0x(R?qb%OYzW4L+}z>4a*2jD$+svM~VRP-!|
z0V?yOPDaZ{iY}Kwc<j>?st6=EeNtDPEsq0BLvnLbQG6*}$Y-(eV2zCo#e9CqFn^R?
z(UAoq2y0116#8%M@Ma$2<IS0CAmi$aLWubbqkhi&xWWhGsMGEJRxHsi`QSvCb=b~)
zE0QR$mX5<zjrK~i;)rq~ce6j_y^^dbqC7PQGV`^9MyRlvHxrqSsG?;sRs@mX9^59L
z8?=p<6+?87vi1&E811%XV2C23_im#W_{Knb?xz(?WVzEA$j(P}(>ovhoL2nIt<kDz
zQ=Q%^ponC``S>OfgU0|zw4pFKSJFbSEjXf#6lfwJx_Aiak9Rcpy(#>cK!ChjNBtZ=
z=#|x`K*sYjt{TRV0~wM38sU9*+~Oe+M%`-|d5=U4e09T{qQ0p}YtCMWmeQCajz;T(
z5P>%RiBS|$&LS+*e45e-6-U*+yNbObDvs)IRC`Vgt;Mk-h%UX=p1<2lTP0Z$L^*s#
z1k-@C@f*W%xOr314dG{WBN&IYi?IJ=N>P9h@14rV{9iwmU0bq4Aqd-&AQ8L&ja}{B
z5<WU}(hcNPtH>+iAA=#1wbUBG*0^VkGNiX8&G;WfUJ6S@?u`?49$b@82dhK_sJ7ZG
z#VHRM0yXU3$Fywm9#g(<l(55s(W|E5*)s&wN@0_OtCw#bgPA4YbQvy9T|Vd(vcpCb
zX|zoJca$Z)U1()V&%?b{#s*j^I^U}2Ezdr^QpPAtI(NG*!(<u_SSpIyvgx;*(`1Y?
zrGZxScPIJ(8KZ1ztUlyEAoB~rf>D6;VXu>mkTJ@ZhKIGxAtzElW0WnuBVl{N{)hi%
z(K}w<J9c?04_1qtny$}ri=bmLZt`~(>f?9h4;W=kkrYI@cW0=ReZZ>GG@~VaWysVu
zWNWXp5;Hij#7kdGlK4Tvrn5Iw=13u#p+^gR#?GlPg`G>2Dnr*ZT>6&ci{OSw$~-<K
z$;i7+Jeg}dWQ?Q(L<PuPIpje!_!N--D7%6y3qlaq5+I27-`K)G5O0%hAkSeGgFt9z
zd#72ww+3BMACp5mUFDdlrBJ$qB_@qjwBz74Q9S6ePcd1fo)`yzY~r*zCXdwbm`?<^
zt{aUpzO?uhB1sMORexhR%%M>9(&NgnV|;0`2I%x#(L;V68~hmJAuTa2m&U-A|IR}G
z4WXkk5Ih+QIM2%b$G;t4`V&MLn?BV#pBR%@DhDhAMktud{EeYtx0vFY8Ov#VOlm26
zny4ZmUCFNl+76+(YrCa~Uk9`u-q+f_l0NxJFQxf&Tv`H_#y~gnIY?(zWEuRg&4<p7
zf@>BPxNNgTOp2+P6OL^b*Vjv9j5n>#fpr|P$}fnG98=e@;;LO~JjOWF7O_JNrkX)x
zj5qC;!i60sbf?uunrWkTM0|_U2o7s(l-@}0MMI1$4LsQv_u;L%!HvPe$`_j@je+Z4
z{gLWlm;Vmj_OFhs9si^3+-@a?K_J?a!30SEjoqL~410e(X<+2_VuF2m&{ZQ2&=i%)
zh4@M70x1V-vh-%skxCymZ`4#>OuHhwl5&$@2E6E<V;M`F*O<BV7YIwrhwVU92Ni&c
z^|s3)HAYj1HQpIac{2xa${f%OH6v$*z(K({iLiI_2$f;%&6{dkRL618_eI=j4P5WX
z#O|nZ3TzI$gE+axhK1cI?mla@7mejQ44t2I<X}!U;S5Az!Hb?X+KYzi4AGO{4#P4K
z#zj@01g&w6W%PBn@=KS{8jdZEagX#XmDXr8t=fV;?vWq<mV~K~<06S(2xpCZgy@LS
z5yTx8HXfmT56EKZ({t7U7gd)5dy@Ypjhw3D)$pFC^b8np<n#pfxB~u=ud{~Xy#&o%
zDz+Bd(3?3u%aBf64uAU~ks3`#tKWH_*~il_UIVprdE@KkAI@7dr;x-P(aN#>U&`~x
z*p($q5Q4BPfeXw1FE%<=llb*s4$yS8(MAL04;ySfGMV#q@3dq+uV7hH??`@Hy|O9R
zQ#;2NJ2xdkU$X3o*YAngDuz5A?1*<mhKJSkt>a+p5fA2xTAN(87G#~$6Mwjf6Oc%0
zeL>Et&U=3Yxox&mdmek})tgEHsL)ex1BBB#wSkNL%2kwZ1DohAw|4-UrDe4T=%)68
zyYIN%o182fpqtKIZf-pG$fy4U;^&(^j7`eY9vyfA#l%Q><D4hf*IN4rn5I6VEQ48l
zZY2c}8z8E<QoXn6S>Tz@*_B!GX|;5ng#gji-V{eW2jH<oLs2x)^D(gY)(kW!GmzPm
zZbMIGj-YS$v+a%1txYBvrXI73J~6X(5b(|0ihnVhUfKc!yVTZ?UoIOV8h~GVY=+_^
z%UvJECJJg#U5QQItH3Q?QAn8BF3$uv&2sR4w;V^4a|w`2b^gYT!gnnd0ld<T-N^Do
z*%=*M41z$kB^3qjzp*ECXE^zK*)+fqBM2<8(}6$UkD(x?Yv3$^k0dYDomG$<Ssc#7
zS%Lijrv$*~pvq-2_6H?sBAMtgwSg)R8u128d}8*YjT?F}BG=a;PhGANZ+I}fxp_g8
zgrj}<owSa0NRl(IIN~|bHxiR{yZKrlv^X@MRFy6I504g<C<rMhlNYX1WY+P5k0Lkc
zFI??5-N_Vy6!~<OWmwx91D6+i6gTf_G&lT~kSPL~j_Z#G!W$>6=Sco@*d3BJ9Mgk<
z0*>x|puZxLWk|mfg&gHmLG>heN^0h{>8o#qhLL2D`s)X7G{=6Ffm9_Pn2~i%G@5zW
z1TePQAEDuHO&jua&?0}3CSEi7@<$6UN*>aRl9w}S_|lB-hYHel4V5wE{v}gI5L*U0
z@%4gToiOn8h%Tezx_j4Hzx^trVoU3zDi!yHXjy)fP{E~*Syt{zYA{q02PJkxiLfSW
z5rq>S`=jjKZY&647}^p9NTC15mS`nT{>HZfivcDt>?GTTkaMU~q-Z6&wBC!+R=*=!
z2`=e@aDz*I5rmgP-DpfA{ZE8<GgH$20^A(uF7G9;?dN5~`4wZS2#`Rh*W~M{qmlwC
z(iw}Qz=_yXg(yn*5)oy04S6ddE%~A?M#?tSOTh!tS{AquL$vq_QN-?0xFR_j>UQ!z
z<a-px_L%Y_xSE5mhDnH5x#!Wjo4vnS+iwCmmyEIaP1|D|-Mnm^BV#xw%P?6ts*vZ%
zM8|OYS(I8D?K{6QFrAyWWI5zx>HC503@8{kbn31OlEN^a4mIZbku8fo!Z4p@R7j5L
z89D}qqv4x!%j_Yat(CeF;;Os6ZC%EA_w;(Ph8?%|1I8-!EAs24amr`Q`;h%V@jt(~
zb&SHLpXF>f^@eW@aw6LlvAoRA`-Fh8G??I$4!*03wLp{PHUrmouSfmm{usNqBM3qe
z))Ip9=)bYUxf$ZuT^h)!>jn`Meq$gry4DoP2<Qf5f%;H9EfM2<?ea;CH_qoUVbjrO
z->`>)P0>!`cB`i4FJU0l$g%JA&i_qm43KGP;_`f<KK&nK$h5cUWJi8AUrA#OnRZZ9
z+?|&wzaE8gl;KP+x#{(o0#WS+^0-scO=Aq1UehFydacc4fJ_SpH&+bqL1WA|RTzi&
zp=i-so|pnre+N;JN0swa87_4-!&Ht5KMruILxJqKq)GpAs1wPaCvhI-!9##bv*uFe
z`u5Y^u;THplSdDv8b*%;x+E`H0d~Y$v>qs+OKKuPxV8-CF;Hx`6uh!|EUo@yAmn!>
znB&~4WMAXQd9o&(3s@I-S^yI$7F~0*`Dy!DraXp&JZfHqTw!I<5a810t=VB`i}1?<
zE=@F<^>dE#7~s;#!Z^a5l?4P!Mx90?VelnC^e-RE&Lzo#5Qd>wqH$xx{Vz85hUdzr
zH3x_a5+d+N@-N2a(wY;01BTqAJOn1F8kLK&^N4z6p+!(R$|&##=6;%5{u=`_-4Azu
z(z`r{D$pgBPZkXH&ZT3tUiym=bfJC&G*QyzkX9m5KOBgXUXmqM>^6NJ-OG+#M_#k9
zybeT3(Go7nL?NG1G)a3nMF$)D-wi*zGRtgae9UDGh;(6M<0H&ei9}FGI?cv-oz~0x
z2?3Eh3ch@<la&0%fJmMB310qVI>u$v_0X;8HHt>x%Vp9v_iTycBTqevTTM!g8?xkQ
zLe@sbEhwEzXR?)8Q{KvkNS%hX3ZrD9M%<cG-f!q#z0C2ZjB!t?*?h^Gn8`w(*i_*S
zn+@M<hWxYa)&bhSk8Q*By+EYFaMTQZ*3j1hmoA23xsUS?3`9x8$Y$l!c7}{W(bHb4
zOJf~bgcGMZDl={*qlMRGj6cfGBR7H=27+Ir0)zhlF-ta9#e)HHk9%og!WKtt20W(y
zaW5$YglqWLfTq!B0<x6XKly^DLE?9l&}X#>-SL^u2CUDu=-IA5${OHw*{xKz(?Dxw
zjf+zi;q=rSAC+$naH@)Dwxd$>vIaP{xFhGR#}^XN)RM7q9&NP`CvcloCrRirqTB-$
z_)RKK;&$$Utz`{xYBLos{v{rY8sId|8{MB`t-LiU1e~ssG`dAy1Dvi&>V-~;w?gVn
zV*T8yVf^AsfazjJ<vs<Da{o%unj~rjY?t49lA;DMU25$=OZ2IM^AzD!<cRnxOECU>
z$2g-5b7@_pb2~)w6D7s`rv`^7VTF{&`Bf}4jy6-d*!{DpcP5FyHSSA#=FVLndy{fO
zec(RL9j@n%3(f?lw+1X7n(`ISFub=0EM3Ws+t0Q|S>wXgL^)h<bd(!<0{6+Jr$n}u
z`y2xEY2Sh$%C5!6Vi1O{6iPm3|HTe;5{{mpuD$`9CWVrKvBNTIZyxmNLGURSuj=Me
z`O`z0%nQbIf-^*VEY4Eh5bX#kbU%V;;VgkNPN!wr2B#^Uu|$;Iv;-G?T89tK)s)=>
z-c5ighfnT0Y&^Ofi##iEL5`BCTIl2?7}4*Y;N(#uIcYk3Chfgo=_5O-+UU-i?&BXO
zsCJv++TlpK!4HT%4I{BJ8wB=lBAON_8dt$(A|J?2T3J^_F46QU-fdJnMj{BmnzZ%1
zjj!9MveS%Cwn0JW!S-{tt8|lXP!MmYINmiee`ID6h&@@c<LoZ`MX~@I@C3?&hNbxU
z{PwsXN&ZrA_@Sdtaeos>LD!#$^OimP>WD#P%g;9NH*m+$-`|q_EoWnZ|N4s)H^Co?
zAsQG|91xsfhL6kZj3*j3>Q5)gNUDd8lw-$`x)Y=%)d1(@{FQtC@ZyKEYq4=CgkdW^
z@@N0W3ZjiU>2&7~&?tdC8WL>(YM^s64V_IN!IS70#!PwdsSY9c1CXR62l@HEa+(Z<
z0aF^9XB)E1zkMxCnDP?2a9wT)=S9K*s%Sm4Cg%5rD8RwLMQ$hmX=1pPIt*)B&SQZJ
z)1^GTf5(VRkxLPGT6V{4O9hMaULZA(mfJD1Dje2}&dWHucJDjMT3zJ~bY6x@1G840
zHy+YJCuRgRntavH!Jl?<)tiEoCgx*bY$=AH-Y-6VGr}epNdZ^|A|cN-;}41pmlRMj
z^O{K>6g^SeZzc@4-FbcJe;epZb4p@IYd#z{tAIz^O&merQ90?A0vIV~^edQk*&dVM
zP0W(qToA@%GC42sk~v~r*Y)_KmH;lvE<N5Ky@!9i0NYIgEa3YcEg1%AM3(Cv##B&m
z5Mh8v#Gs(PPMP9hy#-!7vFjGKmV|?$7D(+xA#o9^%E3<xly;KUSs7d4{rUrZF?ME2
zl7uh}y%LKJ=KdFJ=<MNnzR(2}SrBE*i^Ss`@U;6f&L751k3K%n5>LDROK5xau{2>)
zFgxnWoNx5`D-=?{g5gock>!{wXishhlcU~BTIrseAUBvAnH7pr?@hf>OhbaVTgDM5
z>0IE>jCR3bm)qI?tEs|`Skyd~`?Mp^nkoeCqi**`Z5L4?e+7wrFzm6FhO|!zC}s<I
zQK=p>L}HoVC|w%P5>E&?=4T}OuljLS9Tg0VrqM(9670!6Au`b<1vP8(ohFvqZkJ<o
z3FQ9|h{dGnnD1SP)6J_YL>d%PPP<!l6#-pRy)85!UyD*hz;vmOyYl0kAr|>0@Kg@0
zdCu0f`exN)MATPUVkNM%Cq#;wMiQ&tRaw!>=5;CT*2!}26M}@kR!0c)Jrbuu;H?Nj
z`)`5#g;0r`bKF>AV~(k=<gc0nXGs{{N0Tv#oDFvhJ3i_rV-Pz1hp{Wn)ffa}SJD9j
z_rKWF{jhz>lCK9?v$3s$6`EJe*nfyy%NWF+>+V$e&V^<BmY!UqUk0ywN)IWKCqA#e
zkjTvzJ()ZU3yI4uA3f{qE@E^)dN7&@_zHh<?6Ku&kT}#BLmFnOM-=MN*><|+>AooB
zct9PRHc(jxIVk?dFd948SPME`$3RImaA4@DO|3smeCgzIc2eY@7OhF<c}ufhO~lkO
zXz2GCBw`MoJRlFb!Q}cs8UMuKF}29%pBb_TRU623A(QoE45_v#H1whFT)>#FLlBn^
z5YRc9qGJ%3ULDkrExgGPM5Qp2@%Q|ci~%aOnuO7EXF%KfN&)vfN!dB2jmY$#oIE8`
z=n(al4|~Tu!C%B6GF=8)rb@>^Yf_GJW#QN*PnL`UGJP<D_;q5@?*nA&Xk9xU3b|wq
z8Uwm$AG-XHvMWk<AOvAoQUR6wU#!s1BYgDDrWeTUs2i1-ApCcLOeeDZO!D`mF+iq@
zHXrsr%h4F^6==IJ#h*yK0bP5M>7quo?{OLfWO@d27_w~$KOP`ccX(FkfWz_;1DerN
zuadY110U9+;5J)4RjqZ+h^$FttoB5&7%28@p%K8P;#GiDGvPl1T#Dv~u}vM}$HH1w
zpxW7JERLl#M$?UuovC~34|CF_BW$#qy`YT7xZgyu%!pn5korI8V;ig`$eVaHq)cb&
zoV811fJ@^*SckbF#Y2xr3$!yR-I+A8Xb4cL!NC#`jgB8NT9=PgH`=_=O?r9kR;_Q_
zQ(PD(J+*Kq>5!tId@#+=3c4qZ+q93pf51SZ@_?r28*OBsA&><sNHPmjJxY%Tgrv1l
zeTrkup!<Y)(~>rLbbTaj5(3YZLBxB~Px>9kr2Wap_}dV^85~}eoly=1AqYdSBmxTe
zzu0OfneySr&IMl9HK~rJa3;XxOvHb8%u6QCfQ*Wk^T5$W<<1x<&)J^JBN71>?dXKO
z79t;(5~nHv8#tuzh$5njI-Nanfc_a#MHEjRBFZD=R0-?*D(N%>8af1zv|>q*u}RoU
zyC>U3oeQFwcLqdM%~2~8L;1BpM9cTee(a!=D;cGb9>afq_UT45$_yHPbN@d1KvBY8
z@{Y=(aPR!CKtw$gPI^qC|Iy+vwE<^GhSDQwG9jXh=aO~pF;$vT!X8kt-kqLlk;P$J
zr{h`7uM8;Z1VS6e3EmN2#JJqeMT|xaAo5Mmn0^Q*Wbv4q<1=Ho9vU<QLfRFl+ft&&
zZ)~xd?DfUhwK$AT6G<yZQ}IS@ZBY*%Qp6OEHY}bVhb*M1DLM{$>q?JrkyZ?+fofQ9
zhKb1kAV12k=*WT)gtY`Li1gps$=r<L{lx|{E4qjf!T=fmbO-8?|9Xoo2psB;Z_@Vk
z0c3DU5)_bS-{LXgQ3KP6qbJxp4+5Wh;%X3_obRAhLG5Xs_}0OaTE?3M<tNR86F7c}
zo{giT@T=kQMq;%V4{~WGEvG%cBx>^@*R{HTS8CR!pJhA<dOxzR!c`Ac(FdEvVC*9K
z+B24u2Z4W05N2D3R~~GV0Le?~^VZUT*d4H#PoNp&OX^`cU@`9xFMhM6d%sj{M5}qz
zV}5K*H(jZq7}a*gg`q*W8>pZfbpmz-&L_4?{;=8LGm9d#RLSq~XjZZuwcF3-!LCrk
zU7+gM7XFZ+SxLvVcR&C0e%P8Ee1DwzPC`B`W{-<&f)w2$sAA*o@AvlemaF6s30juo
zD;snoOMW@1NqIp|F=RnLkN|<YeGlHb$sx()w-{|pz8nd+(E5IT;~!;LaKu0e0$TzR
zl>QqFCUY#0Oo9zC=!pmHvi>vz5{fApB=KkWe&9$cu?mi>I_bhlW(2w*v7|Q1`r((@
z)H_2f-0^vF4`6sn*Url%JmDKpFk&}2H&)K+ZLv$4FuUY4xmI#8X>J-|yaEKUPuSJl
zoXW5Q=JQzDc8dxY&Cre&`Sy^Hh>>?!Qzn>p_7h@13W55M1uf!zSV>f^DoqQxRSlTZ
z*-^RJ3JB#!4CiMVR7B?+Rv?x85g~id7fE+Jyol{8{1~j>_XE(>X=~ua>eQwmTJ*>O
z=p5pfj|)H04A7y)kKKEjC@dghjdDU@!KoRsK&B$i-MNs-b`fvDrlx@^Actc)n{JeO
zdeoaT*6zQC!&GJSW@bZ?$q#F~0nNPS3B(*Ou=9l*-?W|%o38h~5EF1I9h?l12%2$o
zyb3aP<hdU!=0wf=3%FF&r%CRSWiHL*Wp$W78_cpvf6raKC_AGZhhY$iUdh3L&HXP{
zqIC24SgH5`LA1db0y9%A6evA9pV?rB97HJSrkinV;)kCkjskBQK{k#Vqx)+pPw&->
zx5HEvxjTOBe-sAvR()#b4dzmzP#32Y)<c9|1IZ;X`<~)1T>}Vudjwx(vlu)$YG9nq
z8AeMXxBcY?6{(?Hm`P|ZJ#d4PbfMLw^TF7({Gc8+TV=KtT?1YQufe{>o^p^gfH`IL
zNqcO2b<Zm}Ck-dG@-1642?KJn?6gZW8Q#n~pq%c#%*DQ!j)VUKsFOV^eP2INu<jU<
zvYsRb2`{sGH8PZP*~Ivcp$7+rv6N3JoHZWlxt1Srj?RK2Z$9j$qmIL8X^>n?JZ#sK
zw+RPH7Siu+n9(LpA(3k^iLwQXFx#6etZRcw)b+42{P{7uOaIpZ>LjJ=%dq#p3D|Ij
zed;;tiuz9*u#Ty59j5Kw_d^Ry`ukCReki-PBM3qe))LQE`fu#?ZpZL<v4M;OyMjQ%
zKA_VWEx2Q4&vHv%*rO$&-@5agfR-6=kCuL-A-`7}NYEI_Kp#Zr^}{*Kuvr**CHXjn
z4&Mr$tW8xKeOXUG%d4%g`;UPTA9gAmE7^$=G={Ynv?ERMdWy#IM*c;o@)xN|h(>%W
za8tI@jnNp`CL%d7g>1r70~f~ARP+(prcC}AxK6VKGuguikAVW|QK+%4JiyXhR2%n6
zv1?|lB~Kay?I&rvQnodK1`nc;_#CI{W3OHd3j)2I2gJB#5}xs++63|@J`k&)t67j}
zJA4w(88a?Ul5L|L0*r=TIH&Ct$->Q^rNM)=r6P&yl}(G{L2##<C(4pla$(nMc0G!J
zD`>^VNeuPT_O1D-65ct6YgO&cp{!SE3U64$y()<=r8rI7Q3V$&`rO2p#&;g1Kb_8`
z=7+K~I+7p+foMu1;9&lV9q!iJeP06!ymHj(Qf$DE+p{qx)a~xZS?yE8u+D(A3OoXN
zCJ}8+D~T)TQnofdJwN3S@cW#JOt&}leIhpb3?@WvZmmO<cI&w1T=U=am~{x`b;8Vh
z>ZohfA=Hijy0=b=AMrW^>N-)ICL#LN8AkmjA+BND8UsO0A0?>fshOvB#-eVUIK9uO
z@hynyKN8Sq+nt3$NdM6ReO_xcMzSeY1W|nxZ!9lAJ)yd69(oa*D?o&v(IE19<)016
zL?#g2{Hf37t~?@md$IxZdEO)>8W4IYH6x#LeSIl23cbbbWUN`80bv~)fGos33lIpa
z1`hFV9t}v~LgKeQY$_4;v3jxNCj>Qk_KgAj7sXeGW3#4I#~sMG4rdjDynSCcR+o@+
zQjv&LN;KL~oq-IkL#X8lypIR68&iVv<IDYzvU59@7zSZzO9t%N>A$fHv$H;Y?S%rO
z@hb|B1YBwjgH3&J5TcwFiRJg&(pXnIGOy>7tNOjKGo93v*@%Aq_B>V{<Rq5AL7GL^
zjmGZ0)OCN6v9*zW7S$%P*X@-wt)cbZd0^Km*US=MpH*MjM^gzbK#rlQ7eFkv>>vTn
z4{T>mX7YnxHkr1qu_P&7ic8X*A7^(J1RKgZDKBPGz`Fnf!Kx<x!0K67A}M8RuPgUy
z6cnr`E{Gsbnd*TYHTmrS1wo%W;Z^*CtW$4N^J#DV4S=yL1=CAoBuXVgyV_8IjK)al
zHF_}p2S_=qM1=gQK@ykxv0Duc7*;0#ejbx@gBS<Flk)Nod+<86F%s&MFN9$~FsE_W
z$e{|eKdOM=-5Mi-VdrxrdVfwD(?PTHTQI!laogT?5EynO`;-r4%sL1R8^3BVO`9}k
z1Hn#WK992~`SKIwkFqPsvKRzmR}!R%_rKWS>wLnZi+F(MsnwL4051p#R-qalGlpG&
zwA_9aAv4{ZKYh`BegikR)1C`5X)@L@<l0Rg>jI?Zq-wq3JOJ~dlMn<lRz6so%dyLD
zItf8a$BN~v%v`6Zv+@}7W!hJBjm?9=`5!1WpywoB%m(~AqO!OThzJj2UnO79lI-9?
zP_W!k=uJ=6ybBNztTt}Uzd*lO*o9!)TQKdYvPpmhs6Oz65v|)L0fJ(@(R`GH&v;7$
z1iwnNrsn>CcnoP~kq39c!{cHgD1ho#j+5!l5kP=|UtjUzKMM9mH?MlX3BOAQ?LH!(
z!h^IzRA@zd6!Cd65)iC)JJDQpLgH%<`(-qt>4BXdMUw}CeMQl&R&zds&QwuoTPkQ0
za&G(RRyLv~Zbb$dwds?w7u{PUL7)}HuKQ@sh+tie1Rj>LpiAY~-1#*raVv7mHW2gi
zF`Ylk&M3#C5QL#y(xRgK-`JDMjK`mO!T%d#)JrVT_P-#PF=?SP9!Rj}gW&&U<&51b
z#*mc{GAK7f0SXo4v|C7YSy_qBAjj)UCfW|DValfa!^V<f8)BA<@zXRhLvX7Ce@(DK
zpZU{)TNR&z{(9{XK`ucRZ&z6>@6uBRx2nkb0rw;SWltK<q<XpzCZItg29sCKsY+|*
z9jU5lZ?%f};m=ij*phQ$wREy$=m7Qng{8fvOZ&q5rSq8xLW-3+NXH(o8vU((zVsdT
zdv@lx<T8Zv0kyG&#c)0dkZWLFzt6@V5&`5YTRsW0sGuf-TpB>UPFh$eKCFZb+Xsz@
zvhvntRTsHR%i)Y_`NI((W2j)v{jFp_ZGk%9rw?T~lw&5bQDsYVqGY&0s+<OB^)Vkt
zzIEDLK8jAUaf6?3;~~nif($9h11?JG$!S#4+$sYFi#j?I>6vw0_GQR%)Scviiya@z
zuIPxN5QMEHD1!ShRy<q6NAJW1JX9V}4N2~CK)t_lBs*<EqL(-zM%{Y!){-6!z7)qy
zP6Xl7L9zf%SK`RRfAJ5e>Dyb~7ZlZH0e_O1KF}mMV_W#<JnxHcI{sHf>vf}r{4lNV
zEJXi0L6gW=)E>w$Ea-2c(U4&+bxmL5=>LEQ@^qaKJ1Yq!pn*8pR&_<uHaOxXjjZV8
zb~@L8msY%l`}u!8lpoR5{EcZWc=X+(u!Q}@QI|YbZ9IgLL@PA9W4(SsD&i6cfUJ46
z$-g6r_UZ_DW3?8iG1`o=hXtL97XY~`KNi}{ARRiLGgwW$uXokS418?hs_{4^sd5}B
zqlP=P=#*j=1%l=CZ$K4PX0iSOzVb6Za0%o3QY8OJ1K6V-w)K^zSa7pkg!aouMNTIx
z9G?Ym_<IDYQz2Pl`n=76V-&M$-3Z)D{c;+0V>1MLbtWC|pkQO3XWz>_K9rqXt^^?n
zM7IQjiu>Q#weL(kd`u#}fr>`Dc@_nR^D1MKKS`|WJ&tjzu|Djdu~0=g*14acfq+o_
z4FExMO>G&AkQZM&%qq2+F7g>kDWf1!8lKpxsfKyEP12B>%qE$)_QF0RdHF#Bv$sTq
zyd0zb5<c1pQbw>}(nt1;d=?*;4wbD2^Tfs*qFFmFs-2_|LXLf^DovuD4%O^JnSH-7
zTYByoi0BSnd>`y`x<l{}UHtvDKNZX}1_law<yqr6$`JIXbQvL!$5Jh0Aao`{AlpT(
zjzOv4<|35+EMzQV5QcU=+<F~0CCV5n2!&*&UqPfIMw$d1$H{LCV`J$ZBkiO_cXTIk
zuB(he3Cf%h&?ZdoI|ezuv9|1Kk9qwr$I;IiX`EQgUyBKzei?)OVp8VM87(PEvt7%h
z3_wC3dCSRT9c2vU_?k*;uHj<u7@pEC|D)^*k|YR0*q4N;;Qv3iSW`>5HQwfw8Z4y2
z5TGf$tph|-QMPp?VJW*bQ++nyBdI8xrTIR7!O#aW=5U<Z94VkL>x0lsj}{PJ_5gC|
zAC^7*Q4){#UX-Z9xsu#BOJSTT4<N#I^J4rX9GTL<P^LhV1guO9?;i=7D4ot|xL|$x
z8l<=@i@>eyByM1ovWc40xOk=yAly3vw(-kR9esZ#5f!JJ7x=DoKHdjOf4yRVHoC3-
zaC3xVRXBkqN(uD6L>X5(wK!tpl)f<(Sw)Ilgbf3I%@`=Mx^wKUj0t+cC{Lw+%E%+{
zD~doC>bCuI2-MaWkPNR&xN9!58P0O~Y{5s;P==rH{=duV0|p=Um++Mmr!TO8(peqC
zkcQH;{td!ne{mx84Z5Q(u|Tp=cO4Ov#P~4J{*i#?{t?DB{0itU2;Eh+m;-a^gV0~6
zlJ1BKYd@ItN7)r+NeqIpD+vhN`(JEeoEpA%;R1QprW6xE@HO4}<RN;D#&R@?N)rOE
zSiSE=;6m~FKm5{OX45)I5~s%X!~CqLosGSWT@RFGKBebXj7wNcO;Wy;#*V;=T9&jr
zPjni5g%R~&z@|`=KMNQTsCKf}W4r4lNlugp5K178PdJ%Tg8oELB}E%sqDVY(kpfL6
zDYpX1wWAgvkL=~Vly9Rsa|U0Q5I!6^)lpRt&~*_4Ju7izIq**BgsbJJ3@$goh$0;@
zjG>5PB5HtK!tMoiIEqAeeK`uo5~lTrc{f%aM37Y6LdJM$oz+a_(O+HV&7%`x{|AAv
zx^bIb^iFr4#F9FTfB9mgI$;&c6?y}CJV^Ko7~m@*GUh6(0>-7QAJHKGM{Yo65JP+&
zg81suR_i1&O40(VeIlo5fPk)fZbHo3m~{})HSURq$nn@8FXuzql_W_FgRn2Lc>Vv!
z2CBOd)t8a4IjC@=*ch?=f`G4EnoGYHUnb?HQtfyT0w3uJJ>4ZhYJ<&wKaMCV8o>}C
z#n)-o)FKmj&fzhNuWPQV2+Hayda{Z-)T-SK$>(%^lS8k{!I%KCHnie@5QS6W-Yhxu
z@*oBeX(Ee4m+l8kAX*vnR8s+$#e+b#vWew{@5EQGIE1UXfi_3l2mgT~U1jbu(lOlj
z<UtV4x|oZbSwqHieuJ-$aH-1^)v&(`2BzD%OZe3sWK#L4fTyiHA1pcALJXB_Zt;rG
zgCz#X#I<!ELceVS1bl6MX)*$=Jk_9MWk<|brJ)ZrfsCbB`xR8_niGeP73@-Mud-f1
zHauyBfwS?D@)$+e_<s=wj+;GSbK(crtxs3BFUVZRujYcUu}7D~C*ufj$wlJdn6q1Q
z1`kqvjk6Z9WN9rn2$14yW@?nz80UJQfb&P$)g)^Sg0L%r27m5<u_v8*#N8KnU1eHD
ziUi0n5HOIw>h^NL`vXWY@j^9J{}^N)WROZ4T$8|88K{EL!CGf+r*97(g9aPa%FR4Z
zJbX<VEE?O<TMh=6K|oq7MlXXs0sYji9(Dx;SF`ep?hkK52WwU{=F+Wo9iv}mFdX-h
zQldHr!vQ!s%Q>m*EP#}`ruG$YpqNuG??$m(Crkuy<*=={5}??vku8^`*TD@IK+0aT
zpqn0PEnRg6cG;^<`bO8=JW%A;OsScFn?Fw+l_h}qRew<-lBFmerjF8hFNkt$2PH*)
zb(GFLy%kfRI~>sWrwFd&Px#x(HUQs1Aiv#>rlXLO-Nx$Gvqtf-EQ4|Vu49}7IP}H_
zIDPD}nrWCdl=}hXqPT)Ny5{}i_>kgCMdK^c7kd8-+La|>!?Ld)Tep<PsGyS;@*Sbe
zx1mU`iNQ3``D3*8@Fr!m{hMX_N7)r+YZyYnElHyGzp=}?=NsOBHsGixVZ!%%oi(^V
zV7V-^VOdR=qfQz!GD+|#O?5<FeUp+TS2ZboWYOS+t>l5EHpv(mx1_nW4CsrYI5yam
z%o6MzTF7pd`cuYamn>{HLgz>h_pw%JF588_xPv)kvePRl?V>pfat4}wfK^tqbYsKK
zY5g4(R9dM=PL#&p-E8fOIH^QtwA>z)uGPQ)9||}wjSt}&FzsbLkOHrOh0_yWYRwuJ
z0mBvD>Ht=XKG-Y+MLxLdvGj!fkhZN}&4qyD(x~$iXhKYb;tv7KrFsc8ri-9!tEmY?
z1U*FN<Uamgcc2O2YQp-;f)2f=Ccvv7Fp`Djk5++vLla=u&c!bgIv!X{cTa#<)2zU7
zv-oy<F#xN|&dYbA-Ol8IfmjbyKz93L$~@O!n!JLMl_JhvgZT~ulFO~wE{Kf@6up1l
z0*XuT|47YGgr-l?(FBO~U4R`RjlPY|>v#4aW#@JzQ3wLjlz1p!@=t7`rmEY&#RQn^
zRExktWUBLl*wt^#lBo%(wX#R$){8f_Zq~Fm2fkLSadhhEH;KV!g`i@K(tiw1AQTYe
z?ffpEc)Vx?!GL&PA^kcmB~8pA9Jo67`x##yN}hyEuZ9;n;zOm9ZneCVS?u%@*9wX>
zIRw8UygzJzu&vYn>mr~hhJGk0Q`<!CCp3rh0@bQr8>}(b7g;{61TOX4q}x5Ce7N6$
zw4&b)%Bv009()I&R^v2ARawq;cs77&RlaE)WFf!d3lj_AS<%M{IuM0*iNQk1vqV3Z
z_Vrgw9(@L)RP*FTMOU^!{bvE{tbp>GxMH9A&;k-F?bZp@6yxFA(gMahX4e#PJL>*m
zg?)p<7lzF}rw1)5R_*d&kE@-R(~TIbax3MZDk4*Tv1aAhO8S|Hq5C7jswgnoPL?^m
z#lMKJmR~8mt%oay3-~G;5#osL4)Hzh*<Zj{A#zcpKgzD;h=CY{wd4bg>A$hSY=Zbj
zTR=4SnsA9@xYNx~auG>A6IFk1_ECDblN5WEHBSaN%+`y`lol03xzf<k#dOn<6nk~T
z%dR@VER*NEDWvGDh&8OL!UN=}ISqn9Di@UEI=(l3lA^D|^@6LO95DU94##v_Wxhv7
ztAl<UhsE!qm@B`~NQ%2US!4@W?i$}%CdFNy_+6|1xLA<)9|J*D==Oyv9P{w!C}BNM
zZNtyz4_-nXOn_k8!wSng_>X$w%q?x&?94@Dz$M*=p6NA|)*=epD(xH25kbtPF=n$d
z(xwZv4L*M{N>Il$X6!3uxf+S?fzYC@^tL=^I@yQEC`pYYTl?SL%WpN(fh3i=Bf!mi
z0^w0gTC*IzP{NTv{Bk4(bG3DWV2L1H-k_9n-I)75LPh$00aD6US^_^V6j24;E~68P
zD)rSquB;bNG+UkuqiMtVIjVCAl!dfRi&B$d5nkvX_Uc2~nI%aOf<W|2YKhDJFV@gC
z!SiDxI=w)KB}f6u@<rJ-%X3`)>#?rwH%ccl!<g!r)>U;3I}%>h4Tqzmzr*CN+`3ml
zR%>PJAV+Xjk11AT%?t4m{YNJeA;~kB4zh`OkxqN5BoPDZs?N@E+G9+ofRTo_nNioa
zS6jMllDV>&DvPT5{ZzSwz>>O(nqMY_l~}x_gQUK?1(<k_%gVkuN@{E*)AJqo`7-P(
zN~&!0s0IhLb;vjY1v=o(lm4N^UUJh>($spWSFp8}#FqfF`2*345Fb?ZjxkFDYjozb
zyR_Ua>35q1mb=uOG_A#M@r$EC3Os`!v$;PxbO}LWjnUDTZ}F@S0xK{|q2_j8w7?lW
zmOpIrdH%AS{)Aw$`Y=v1CkbBx1YW?X<A{333#Em}ihXMsxY_kqErZ3{qaTT^RUiFM
z=+!FgSa?+0So-JCs}*&_T**b-rzMSL(-==zf;F-KHuHQaJF_E+VGxL>q{EFM|HKy7
zGc-S2ixTMafidE7{GpPr)=xV8nU1ylO&Um!1)HmIEVni}eHAcoAq-QZ25MehOWJHC
zD8C|G&2;xg(q_lu4yUotTes6yNuwQ{z&#??-WMXqlu&V!JGOqeTSh>Z74?3_U+d`i
zj)6GqdB+WX9d==J4VA@2$`ZQTXRQ9dFJ#Y_APW5mwA}CaZH`RKzXUCuo_oI=A|=ly
z>>mpxeeqOy8WYBn^XwaANvah?Vp(FXqU+*H3Nhd?s^uY^X<sDGR?Eh|NMl@l%R+8o
z4`-U1px@jFlC9y-l~Z;wFRU%$7Gm)d@hQN5<A2Nfk#Nhcmy0N-|K$7K2}r)>!LgR}
z>9X^nuYwHJMTyxxyg&2eS|lC+;_#5MVca#}P&uixA41e1hjyW&slwxni=5SORYJ0^
zxPxpf_Zz}*-%nG8yz9k)9}$}zAkq+-46#u|Y|M-IoXkspD7&H@3qlZfB}OQt_rKUe
zUY7FlHj5V^GinfNY2zwht97j}T)R-Xmzy~2THl{6GmT;__nmyvsH1$oLxp{LWcs31
zBwA`0LHHhvVxO``N9|%!h$=KbefA;rA_(a&jZ_gSjw%y_AeC&J#p;vJQ1cj@xmKD2
z$Pu3p>7hU{Kkp(p`91S-P!tA+^kY(9>|5uSFenf#8KNM2{5;KI>i;N}Yu#9T#l=nt
zeh{Qm?Yqul9e50LQy3Hw2CDRms>yub0fmFbi80dn;!0lgu^1E(7TdkpH`as(E>@*7
z?FL1`B&R6nrad4OCJ8(-UvHfGHWLl|j5Pn2*xPXtWU;Rz&h8BEen?x^XAj#A7l)sC
zm`YP9%PI5ufg>Q63QbKbjiMxjAmqWu^+Tye%tw7dL`>h+)V5P;a2{l{3*p|L+|P6I
zB_tM}{%W5aM7fYu7+b>%9Wr+Sb9ufM*C{V(e}BmjW!GY3F$}_1$_Gfg|6&JMJ&g2D
zI<tU<(v$$k@CA~7b{|Z=7$+2ebPu|L6!Z9VLFyB0LpG0+es<kQp|6SIcnuWA%Ynf{
z9_x%dCy$bj*1bz{OdegE@+b!{M<K`eJ3O8RxhT$*OxaI*^J)@HTFe7&h<6>O(VTC|
zin%E=3y3PeJIj(4i#Bq!9mMF0!QZ(FlEF%ga8$E-rH&;l=D)R-ti!Xk(>NC?H6GNP
zWG!jjfAC^{<7%l$L>soi*$R}1<G1?MIG1#{k+1^A{r5dQO8Q&RC>2l8u!bcleT5<`
zi!*}xmj8n+L<rc{7IJ5P<&7mZW})szfoDF}06`PN+x`8SZ@Ku@NS4f4eBx2InvACb
zB7bF;vA$yS4i3ba))7$GmNqN_mAlJCtB4322aBTDgIV%!iSmL-11omsEGvZ~Pv$|8
zhn0;99{C)8y_ta&JFhzOW69#>a+ai6gr9G#>knsFlq@j_!mdO$qTc^v57%wt$D1kL
z1C$D-3MRmpmwq9~RCOX^@ZFA$@j<o_!wH80L)Vd!%FWXA1W_j-2As&WnZFp2<V3{6
zByLCbZ8^raJm}*T;ay23M$wG4%t~&D#p35fnDVBLq*gNcaY_?0q_)kdORr>dCEi?7
z3QC<h=ByJBgNId_Q<h=<MZugC5yR@&p!gzU%9{K-ki&|#Z^i2iCm|e$aVgh`7dPd$
zPs@Nr)Om=gsuh0{L09!LczA{?Ch9^)8M^DJm!j$tLH0=g!34sfDKzoO<(?HlN9}8x
zmqZ-!RYny$Y9!@$7<Kn)&59umhB@Jfn4B`iznbk<T=(OvQYR^bvFqpL|K*zy`HI(0
z`$vg{9h7fD^XNl_qb83Bf?jPQ-@5v@gLL#Hf|=GDHY7zRgdSv+VX9R&o9ad-dwEfY
z;Do*6N7Xp3*p)ZBo>GXJ)+(Y9nRzvFd$9=-_KH0RGVQw3nn}|V^lIqerV4+QU0V{w
zAPBpX4+whyi>+*@gumhim{xoQV}hS`I@!4LE5cxe!GCcYeHFJc(p_GTWZ$=<^a$j-
z=2%DuExPSuJY%Xl?~q&yttbxxd9Eo&Ik!BwFXiuui7Gm2rgyg1>Y^jZ<!(rw)<{i@
zQ<MakXCav@;X;cA<88p=dp2hki)vv6yQTXfVqX`%rp2)cX6vASwpDeUhiU{q=w5W3
z^Shf1#Ud;{epw`S(dI?NB9PW<gMP=3!e?=<kke{CRdsqJ^anYu-ZxtxoCS>HQX!$`
zZNWLg4#=+l2+MvXyGZHO*?dGGm(`RRnQL6=HxXQx%q%iCr9tYK@BqPOxeYMgiT{Y9
z9D_wvzF^uWKsg30sHN1Q&jZhzl!LH<>WeRK&Y47&@pllGP{U$Gyc_tak7|I@vyoCk
zKCEl62MJ($>f@a-w(X1jvVM|b8An+?Il*Cxdr~1`TP^G45EPc2-4HoBZ!5bWWmj}$
zK?uTnxe62!u>ZzR-kT$Q+(&F6GrP-1FhCfPqSWEBT7Q=~?S5njiokab-`})B7(Gd4
zNB_&|=EswY#z2OuZC>a8Hj~FNWI-Prs&Y+uz<}x+13uF`gtqyz(=^w%{q~;W&W8wk
zTW%TI(vP)R4)Bt%(wYE`6DymHX^aZh+@y$$CHIG6A20bT$8xYLJ-f$^2Ptk%A*1z<
z+t$sa6uV~25=x;!vQ2;#yJn1oqQ^0Rc%Y)!71+dkX<%aE2!T=rt3z7ReiPN0JW4UF
zs!Wh$$iu5Gf=!hMC1UD6^oWg@cy)^*!HB>uM3nbH@`)=dm45#524r5+m7b=eX|@dT
zp#tS<MAQxOWmp}&L6w(swbMAEQLOmG^AyLX6AE%Q8+v#UR99v#amCFafdRd>{XW@3
z$_H#|R@<9_be_VSkJyR6meKZY==O(zEzxS{E^N@OY~CHtOSRJbf#v6yvMa!07zBY|
zQb4i)|JWd1IhJf0eBcr*J<;PJtXMqjjus8o%KMp8GQFY#ssIu+>(?SmeXb6lI!e$i
z<<fq6H-N381kZXKLrvl_GSC7_@GJ=&)-LZ8H9l_etarRioUgJPC<lkwb&{w)acL`{
zTo74ydh0#LEA^cY@k-nzEh(#Bjd+22rDLS0MUveBAt(yaShhPl>KGBY9{h=EdCmrk
zAUD_4TALfbBMte=O%vBjyi#{FY6w`i8xw6`J>73CNAZM2nBV1PAzTMRY0J=&CPs4I
z`lpP_mQ?fYeIR%Jn}mR6tC=X4^9;WM@<goNcwmmUKp~9q{_8T(P_VqG5$X(#zM1ME
z5wn)yBr}%%)U@g-5wkuc9*^q&6E+sKaC%63cd*DA4V3-uAY--zTk0UewR0xz#wUF4
zI!I9MUF-bRtYVOM0V9Z(@5Y)>8hO=?J_;dAWPjw=<CppGMcK6_TMUA*EvdZszp*2C
z<`O>ofg8xQRVk7LzEGeNkj67o4x*Ybk2K!ZcC$#|tux=Y0_K(Uv{0*i&q2Vw8a2Lv
z=-~hrv&FGnD|UI<Cym(>Y1!!gB|kg|=mIrvqt1mM7RSHT^jRP_nuCBeaF|H4BD?3W
z16E5HitWeIMQ(smVYb)oTsg*$7%O6nTruE#=lzA}AXFf6xV2n$WatAFu6Tcse@jvp
z#;grcq)>!=`QcvdXpW+VqFwf?%KGpuhCf)dmC=18dqAl$yEatgE2~WN*;Q6l7iYeX
z?~;8&<|svVajI19ljk0wRHWtIY*=(W=Dsp3%8P{-XnS^D^8r>?v=`f6tsM*>pPRX?
zXs?^@L|~3&8k6TB@+G&)UZM{e6>I-oZG{m|58uR4f;gavZ+x?dMTUYP6mxiFp>@{)
zBv5h22}&i=+zV+A1ws5@=6;l2TdoBm2;0&qqPYK!U6@HIA1BwkfyOaT!=r_FGsEET
zHTz%kS^`o4@O-Xm&SkK&0~T6lgy>O?HXbC|cFht2erxSmjO5z2u@29l%qZ*9&M3*X
z_Du=+Wt%;tB-dKUn%$TnY^pp;a&1U5imyyYzc`B}%7P)~dEIswD9N=RJwi7p9zsq2
zv7i$cBIV*N^ViSc3tC})%~9;ch9Rp23R<_j4BPQ2s>|e21oaT@m^`O4+Qq#j*ZTLA
zQf=8&M1UxYDo7b(ystGLWTJj8B{;5Rdj^4EOQHJ;p5%W-G{pLT3}x1s`OJeruQhkk
z1r^Kd3B%A4^IxVew`|RLkmTBse<<YIZSlSs%a)kuOolpBb=wgj$+a<b7AaI{$9a%Z
zKrmy<bB=a%lqB1!rO%-v&+0r%l5LD^MtT~SUgc4eY^O=_mdTQvdr7igpA#mlDkysq
zD7%~m?YZIc@jvU1{wO<>D~Vwch^8c=t;j#Ifp(kX&81NSWy@NO_$>cb0*cuXkSd#X
zt><2#_jC^;&>G%Id(>5UC0pz^?FqPRUc5_ke6f^~$HdFUatSQv1<~mEG9zf#6I&2m
zY<jRyN>MX=tiAy{DZ|pvTc*gASyv&=-HnwoVB0}1=7=;`J1b+@5pncFg*>;VMxreR
zw*M9pLWc2aRQ?{hdLu&L*E1*Y;ji^WfpE+oO-wh@dVRqWj+srIJmGdXtAAIrF$~sS
z$o{5+23c-ODxP}k9kw8Jd_Di8S48XiX$UN~JTICeSQlrC&_LLqicsJAJ<RDZh=hS4
zPczlm@apwOh6pC+(1r0o<J?S6ATiNBaxfFL)=mP!!`xuv{K_i!7(u`=FYnJ`Jh{%r
zs7eG26C9+~eq_mo%8Ier{z+a<Rv!N~m>ur{1~Yd1{jKWfI8?})@Ag8)z6A&fCf@yq
ztsLjM=$M3{V5YK3CA5*2y2>AA*Oo0Y5COM@e(C*hY?z!;?)?cHa73g-mntt-0tOSk
zENN`-3fGuV8X%Z&)B|(a4wiLB!xMoghzeQjKNc4~L8=~xD7CuK)@^u#WKAn=$R&2G
zc@_wmn?T+8N6qHVM5O9Tx9`5Ob~Yx=H2^S4rNkL|*!{(i$X1s)x@m4tm>YgXy55zp
z9}f?x`@VP*=$9RaGX<6QZSX=g;IHBHkl5g6pWiOVB(SeRnnb#`{ke7{(E|J$@{B|M
z-~?yS7d?rVOOn{6b$(R+d;|Bg(j7&FJE5!kVxrd)JBhJ2WGXIjD&dG`Yb;61rZi{A
zN;F$mkO3_^K6QGF&x1}&2;!*E-i@jsJ2hHR>u2Y-)`%*aU@w9QHT(ar_+k?1rJRa8
zq9V6Vfq0#Rh3a2!L?aXcycipp9MUXqU{ZixYPCe-$(&C8kiafoP)FWWW%+6VU6WJ+
ziSFkrv}6IZ1j3TE@H^y31;}M*G7yxd^FO!kL)o?6Kn#Phm1rP9_FwFRPKx=d;x1sR
zdCAnqydgl~Dtl71xMMu;4FRQ;KGKA0OY(R^*s|eG>Nc?t6b8bU&1kdZ#*h!s286BI
zFa4AtZ!1KtDT%15efK}K=I4>M%HPp!N$F&ta2`!-BeXGgyLzC%1Stc8p;lEgEb^KJ
zT!pI_P>84|mg1;c)oBdto2Jn{Lz#`6Vh()08_Q{oLrmRT9L<B|?>mG7!r)<Dn-2yL
zVgQ+tk7~441Pw9);s~hP$A78PAcvZ|KiUl$_<3;$ImFagi@e+HJABX}Ag7A`EzZDq
zw`4YIYDhLLH@MNeb4097t&zMhHQj^mk;$WB=@`vvRx?fpy|72Z((;T#dj)H_LqH91
zZy|tzACPwpD6iR?mVKA}^l627CC|c3RMUd!Cji=&j;`_VGsmw-peb}T18wVWy<^}{
zstEkE_7A!tF<>H$#J*H-&D)y(D7&H@3qlZfB|$;C|HW4JWhvRbk9vS<W^{s<Livvo
zrCi--b}O7P+jLV*lya3N-Z(8U74rv>3amEab0@iF4<Hp<O(%q_^noxQWC5hrb!88h
zPaeg-qx7l31d3x-a05td#TAQ3+1O=4_CE(f@f~3?kf|D{6=!a<haCze5F9M`9>^;E
z2MNf3dSN3yWDmpK0>YJC4umsw?{yyDr6O!9SBS8NY7hdXVyxYRc(oEuez05!6xXBh
z70qeR51)fdLV@6#wiEgQ0@3P2ll~ZqDF5$6v$`ar8%)6GjsR(mF{+)j#^ymlu-w~N
z>-5j0K}xZ@TO;tQu+J<3uE!usvHCSnYCgDU1`kr9c1bHQyBG4KJV=GwHDD(o**o~~
zCJP|q{>`MA0I>!FIZ-hlkHBy&NptNR!gq2-NmiOfr`wIctVjjfOW#LJ<R7=mqXe$g
zaJ(Gnhq7zC4Il<#D<wR`{)_ccRm@*u0qY)-lVBUt4K@EL3^||;c6bylG6#WZ<%aa`
zw}bgzJW7!)wOc(MpC^T)v@6bz5fF^*o&`v8tUg9F09TqXSZ)TwCXo6eS%4rA^E;d2
zuXJRra}We#L{Lf7=3pOyposOP*|7A*Vwu3Goee#Zb~T@K67;KY2W*{D&zt890t%Kq
zaDA2td5%#G%g0de&FQr^2PuXnOft>!A@lH6K)s^J+*n%l&OsC)xbLJyxp<i(*c7j!
zwFc<|q!>06(bT5z-UUc8tk`V_^T$eyRT9{U1&*@s40hi9_dvw5@9q+);`kym7^Pul
zD-FapA_8XD0ZLJ9_V9v<vCWnIAA_4{1E+VdXAeLGnvJ1hl7}t+4}>iLt#eg>WA!<R
zq2ka?M&BJ>X$}IFKwA44yPK7-NW*wDZphPlGA=ZJD7&I$i9rx{B@q$1|HYon&Jy<H
zP16gc)wa<ZNN^|GYF!O(e$ODKWX-!5Zt=Y*_{5tiF>C7Cil7-Cd~-sSo^=-nZysUu
zEagFpWV26h;t<7$@F2yq*;0p3XTau!05O2H1w9W~Urg-AZ~`B3w(mI)QZzdS8$U^j
z?gdEEtgfDOwk2N7NwMtuT>Q(`A$(d|I1ahC!?Y!Hp83w6aHt2Dn7j$We79dXY6aGU
z|B}k#W17NIDPUt`o3jTWe-$NhsRk1MvTR0!2eGD&qxjJsruYO1gji|uFxy@X1}%q;
z*fOt)f7eRrx(KuBkAkfd0TQ^8mR6`|@sAf$SGpL&n&0tf{n$+q(7Mt}*AU=1_|%<%
z*mWN+9N2!Q<Qb$G_P(p5l|CYnf&eLo9foQjNsVUlAO;XYc+Ye@JjQOL!5>q4%1$1{
zF|QkP`_!{ufE2-IHxky1yR`oc@<-Vf<uDY2uqz=T%Ka}k&C4j+J{}xk4HF+4TI@ea
z6j+f&50R}^&#<GjrO6bDRO<76?jRAKSD3yd*;cn%bBDfF;O>0(n%7Od9DLW9>GK=f
z$gn3R)=U;p*<A1)B&zGgB-~Y;+pJ??%y4kJOcPNfH+jksN1rXzMkE+AwAB98bkTap
za12dO@H_g9kCZ@|z<JTayvo&RQB_)gKn5;ad!W9~RrU&D0_Syp80w5u6r`+AX9~{i
z))h?}A~COnpuSRaaxo)sL^30i=WUm-K3#SL!~z61mX}%4I>Z75YJkB6q5!e+S8x}&
zO2l2qaD+iv(^IRxo|s^|?iq*+y}&%BfPuYAcu|PixxOF+TXoFTNK$X?_h7kLcw<FQ
zDAtH1wX`r+bp;LFhy?5`rKiX5dECg2B`y=~MpdcTk&zVHD=}rdrM}^V<hl>o;j1}k
z_>ULbhq7z2l^_IxE%8y&{u_Hs_IBWsms@Cnpdum+%ugZkt$YX6AGf%*OnE1SBA5CE
z^WaAut9~}9arr#HaPsHw^QsELN6QO;Be9^5`j$xGUDFrV)TDkkl8Uk;CHtq2x|PUG
z@Zo3@F_wl~M2$<Ycl&Dwap!O><<&R?MyO#W(E_^y8{urqo#nv28Y%qzbrEAw+D~Aj
zGnzgUoS+fUuOkYqDB&?x9zaCMloM?oZ^%X=l(w840$&^Pu8h@?f+)b$kRX($th>0D
z$58#5!=ZS(esV((!~h>y_$|dzpj^}g0f09#U{{@4Wj6Fc44|99w0DJBG1cr%4}<`+
zV$hUypxHtwYk6l&VAihhc@69?gqjvR2+*L$J=?6R2Z~zkjS!qD#<i%1gaAt!+eLhe
z5;XSnJ7R8JmXVBfN0~6AUf<N1VO}w=-@W5*m>0@fp4y2|;<;I>N_vEW9*tROhbDE-
zbteauc#+Tl*X@t8Ge}|>1fl3%dIAMSxc|ip)0WSoGr?sxOeBKf3-C`u?odx%v?hqw
z)M!F1e+R<e(y`ZtMiXNF>NxTaZ#E5f!;z{WfRVj=wU{&#U&WYohBo(J7dD^#DjH-V
z26BCj3rCs&D=H(nd>3mvjtvyRhF||p<gAO=01IFOl~6zXn;U&s5CEDGLp8e}7OXYQ
zzMKfVxyb>oRvFqxv@m0|p$kwePu6oK9;UD~O$EqGChAIJawJ`t3Ye7`I>ivrv6>nM
zuyQ|<NT2-4x)M;+`su6nm9TZ6i<JoK(Pv(hQRMB-7!J(_Cr^Vr=MpVENKjn&o&3!{
z@=WdOA~Po!me;v{M5D=iLl*}%18U`b{LC3>OTj;_#}MS3;u`f~H3d<XacefrF5CtX
zRW#ozLw)%)O%{AA8py$mE~BQg0ZvWNlMLybP}7BiOpQ8m<=9#`A2v_=Z?n{2XfD>Q
zIiQhnYD%dWAZ4`Rf0kjdH)YqB#6Sqbu7tQ0x&Orq-In;#8M7D2xNamo1b?27YbOfz
z5_cM7!5baYx1-W<tXMQgD}6Oe_K_{?Nbg5irbfL#@i)vkW3<}WASB3&59im>TCcL%
zuUl|Qh!*-OiYPQ0r~IdE?x<s~TMUe$IAegOA@CQLVK&?u12pwOHY+k5n>0qNefp-I
znk%<z(lkXyYJRFVUx8FyFF8X%?6>T~m8+n46xFD-Iry_v?L{A!E=Fno1}Jrkozgps
zVw8yV<z}ss@-#~W(^dir@pxfW(is9`f8Wpg5zKgk1)`>{?NQUu9_&qgm99jMn)KQr
zF^zsU>K-5bwH{#|ziG9xu&qXALK{R;q@NYe@)&JS>vfim>>4~qo6|hP*wz{_Ja~|a
zh2X(i)lb7Ki*aE?M4%03@n9hc@yG0@wra4aTUZigOGDv-!O98SgU{K5eD^Kw;yhgk
zYEiZvnJlp<M7!DgrtFGx7z#nyl@w6m{ui6X%<{2haDm3*vr`J?rhFzsB2peKMsudp
zKYcPobX{oubA=cs%NXaT9#lwCdu<@FFKU1=Jb4x_Ls8)02#A2u(5yi*!L|_)FzZOK
z+c1o-?{Ai(7ObrND!WyX_qE1-?){weqANFz(45FfDGFo`lT2xVfLsY#hjV4ta<9}m
z?vGr@!h9x*LE~Nr0lUtWR~Mndbr8_&u$6=cSo{}2`1eYNN@FFDU&C1w2?!O|I>^HA
z*mG|p686SQz^^089--4WRswz<y3@;B%TtxE@5=Y$Ydc+!+!`Q`be*P*3aiy)f`+ST
zs>T)@I&2FdskR!#wuf5%{J|%1so@_~w$3^R81~Q;rwkEE9R%)c<gcDGTKB1bhB@V`
zM3a)!3M(Agm{E=8rVS#1Dn+oQBUiXF{42nx30+FA(a<H>NLT&svG`DSMK=(IAZ#T8
zMcwRf`;)vp%HP!m8iS-D6#&QvHyZM+S^EC}gQPUoLT<qSB{!pcMpROoic!}C^?-=&
zn@7<^u_&%4%Eiu}XZ6>6mRRJ1tbVPFv-Cu9sgK7EVVOWlmOWW`sTI54fOrX{rAn*x
zZYLEeRr<U(zLla_km9vD5Jgq|=60a?Z){SJ#ZJA`AZWQdnU}%argYvU=(sY>Q&3-X
zT^s})+YHn;I=>$(zG5XS=|=3b7`MrTKn>^!q8h)}c#MIAOi+Qi-k1cVgt}P~?fv3v
z(pwK)wi84xn{Ly1xcT$`)=RTm3`rS0$W9tKK>~G`*#F3*I7qe?(djTX-C}V-l4DOa
zUsfEp@kUAU>VTA$(CW_bFH%YIDu$1j2cQr1!x1P+vFn&~BFzyDcO_5;h<Xc@w7%4h
zM{y7}0*}qMFEHS>Hc|Anc4HGbt+igtjrgVgqwI=~EC@kZOCl=Je`AOD-Vi=+=3)bx
zU3Ie{BoH9rSUGJ)RFq#=2(Ctc$Jm?=<9h-G3YN784!(`SudBi8LPzy!T#3QMCuq&E
z4b-Nwb@3SRYdgCU_0j1($o`Wb?-ui1V6YTwa|v$-qYq1h^EyVkf83_eVAUF*`3&C!
zE3+~Lz3w&2gMel8yG6niVa`8F)wPD_n^#wHa&^S!Q9!ffBYFR#^bunJqZH3(RPDI9
z$e_m_-bjJsjv&+w`4@o#o|QJ#HUkA+!lM+=dO!kpd!}hM%#^BeC0T3LmNKZ8{qQ7)
zyvJv|iQ%<%Q&8oaEeu`ib%#P=6wjX3F1okM=FeL|9AM}|%gqVrw>X-T1>?G}m4NW;
zic*)hV#v933U~~dw;9X>?xlnBrzBwB<`^59n*+Zz0tD)SGY~G_zv=@BEQJpGujcPB
zkq5Ds1eSI~b@Ia}rl8*SL)o=mNfd&xmH;0>|BWr~gYdNj4dghEazR4!D!;#YvZ6A!
z(+6?TH=%O=*re3vYzraG-lz=nyTJm>g$7E7S+%%6mN`D53)nzGm|f~1JV)6xK|z@P
zF2NE-2K;`>wpXlWflcLf1}iyO$t5i-K}cz!WR%szuupz^2yGjtK+*i4<Mdl4wGTiH
zIeu})iCky1_fbj}CYwv0-5&=NMiI7td_xjs4^Rs6<rqLtf1E_J`4!cz7B129{%OnJ
zS7iI^lxQvebCRvEr!I*efNi0{hF~C@H<DuK+aI$Nw7&T1xRz^7+6Mv6l^{PQW>*J4
z2NT)O<xw?CmH`MPFI?+!g^A{8kg7GPV4j?7a{C})z%V&pRLT1LTBHW8Jb^6r0mdp~
zF?e=(#MAzHElPvMyC4>F1{Vj7FM3X6zaX2-u-^ZSLdmYzvtNRe-KM>pa}<(2uh-GZ
zEqyMLpACb)D7&&_iD3}dk~vK5&R+QsW_Kj-S8xNw2RMKL9a0v7KsG^pQL+1llmkYX
zD0MI9R_&E}Dj=^)@)7gOf3Wt+Q&J3Ef+C{E18o_<HT!)OnAh+SgEwtk4x*pNO5hOq
zK1R9Lh~{QPg#z>%sTUhKQEERc6FVz`Lr`Ppxe&G9?EeqR?cbMBSQO=+>7iUOZKwkE
z8mV6cQCDTiw7HN)3E}W<taQF<c|g319GNh$tpnO=?1h+@r`O8*hS(#TiblZ8Gwwus
z%wp=(+zin!uhPl~=dnjzTnynZ_Xwo^ts3^_LJakF?FT)smZ5&LF+!cXy3(V^?M#u2
z)*A)fRRpn)^rcz4D9r~6XjeW+$KdY#^d3!Z1=cmH%Y*TWE|${1iP*;~JQ!|qE@0z0
zfOVyrq=xc1w)8o&ROgY_ax!>SVtMtNEOZi{T?<jt51{fUf$f7IqTH{9Cq`ESYYU4r
z^f(N;cmUX!m8Q!djfr^Ec!6@&q+#dHj;?YL;;NyfF#Zf9;>A|}DZ8R$2|^Iok_saB
z-`In>H-!7T*g$62btM=GUnt(PfHHNFtlA=($c9z`O9+Wi`p~$%O5e(+MLq3aVUv$h
z;#Q8`+4xoFVqc_`tsJ_6H+ee+O`7XSJ2(7Ja$}$?D=0Qj<FN<XiL{!B;6UA+j8B0e
zg#dpmRm7(G)b_mKAea+RYAwdm_3*2~LNLu{k=eNkNnoI6-K$6)?$-IRMVp+p;n%z(
zP#JmjK+B52bQ{8C=}QS&X<#eR1cHi@d!tmW9Abp~NRQw3f$<;QROKzaSK@$TxnD*6
z>-03LO8+!XR*l9$q|f@}iCoOir9nVU)2F#Was=F@K`Pn@wYKsh)pXe6mjvu|yW(Q>
zHiiBt2t+K2por42Yj8yU4Ke}p@uB($S=V`x#!pY>g>vX&PH9&SZYowah+@jGD%7hz
z4TeLKvuHOBf_v3*&?gp4Go1f4sKZL%KrrOvPGg`!D~_H<*2iEs>mOxTfFv;p!oH-0
zqW=G5C)Yi~&fJXnflRw~qY_Aj($(mlAI64B{ax7V>Y5i14)i`aVkG5?hH~gk$2%kR
zMD0AyxtvyBAB&_44SQKMr6<K1gS7g3x%~BXiq$bls_J1*!H91VVy%5&7Q0z|A}LUw
zS6`^2So+V<vcxMxbJbBsDq-|VdUlKFItr;(m1#kn<Wqdv8HL>HT>-3^$*4~^fzp+C
zw?=f>ev(;Ek`Yk4!f(D#Y!;)H<Bv9q{JZ72HI!bw5z;rBJbI7KE*B`g{O?;p_~iKJ
zQJ+r&#Vgy?#!8bty_}XM;LKKg`)WQQZ$oeugfy#`_Ac1XYDt5zh^pq-26)Cu?XI*i
z+xIJZ>OXAq55!|EMXcUX2kFVlkOHz>a9%tKFImG<-#S)(77moI{NB$CjxD=*9n!6^
z7~!EX<#7OXlI;Xy!Rn^Wa&(Fyv@0(b)0auLUyNKK#H;3kG9fG~Ao86B^F!GgT}upt
zK(v>wzyKoYzp;fMuOEBf!v^Lg#Eing_$LZvTh0fZ?BgOTP;EJ(vUxa3@c$?R)sAGh
zEh|)`^xH>)Y9Bq)jGF!HM@67o6U^2#MVPA}mn~r>VRO@5o~dVlI!FbktwQh45kkks
zViA~DCfABq*Xg<l3rs6q!L7^Y>SG+f7=x;DnEAz8iNiK(d#`8>VO_k<QOG(<a_;ZN
z=fO=dVjA6y(Z9<~6hpzX^V(aoT3q~vI0}Z~D52Gn(vQhuC^)bePsWNH5SX@Vg!}Kw
zgw)!zBZ`pqF58i<e8Z&=0@YSKroj5Rls8bIT35{Z&6bR(j{?<>LqsY$$Y&pAlWpdx
zA!H5DBmLkaXl0Tr6jJn+{y>bPY1Jt7)^Bpbsa`w_Wcy5a&ilDJ_P;c$R)z@q)as^=
zest{=VR4D5V#>vOLD!mZbyWR2sW(vkm?W{?S)$?eS2j@A=S$fY<VqBRuq&Z}$o((&
zF_W<@Ci!(an<k^YDniS*auJw1aN5}EK}1un84-Cq$s!-NxoHeG9uVrz@enI;9o(P!
z?cZ036yrfaw<ajXRM_%?0^7j|xq}NT><2HOQdGB=L7<~Yq4TgLVB1q>yPxtNy4k@!
zQ~kFnrcR)xgGT|~)+u_E%laX%JPPR6MegTgmCwz|qwGeMd40UBvKL+jqL6dVv(LL7
zAP=hxIai^`b*VgNHiKUm=(%R&1G98qpQg}rooN{empY!-=25g=v*8+HN7ZjUis6D>
zS*5num61FO*!I|@Ep%6<JZurz*1dhvd76oMl;%{_s{%{)VR2#oQu*%PXW4T;1Pi1F
zTL;pH6}&)Aqm^kDEe+lVpAsMgAg#zzH?YNHfNnqj58v|ngM3L*3-e68Hr2mee4MmW
zm@LeewluVU|J&iO(dafXmbU0FGI^9nx6={%mDF{e&L3sxdc!ab0^yYs1Gd?Jv0_!t
z$G=_{I9Yyx;W+q*g1N0XLpq`kdAg3Wn{mn~t$sx8_ta4^x3TG}Sq_B$wf|9|#7^Id
zhrBuMqF?MToY*+S$8kfpb?uQsidCe&$gKN*fnnI}!NgFfRf2%w&8fDyq5k{#(ov$7
zS`AV?^&PVpYr)ozIjE?;FL_|oFo-ex4%GNn#JW7=Xc){`cy3m*Ll*#AQ+37FLx#|=
zEYw)V3!5bN8v5gb9IK~`Jad*q(RT!PY_6bwG`=}g6$DEgw>7fR^2L^POG^eIj^;+L
zXSc?Wo$<%N<2n7H^jRyGO@^3Hh*}`&p@Tq=1??0)r{7BlA&YQ`<mcY+G+n@CuwxZ$
z*pr5<7+#l8_|?p8&p>ZWT|eQFV`r}AY)<UT7i+=H61$kLbaQyI@}!1QTALOj0*bS*
zgSPnPo@pQ`phWYfv(?HZL+b^U-<|zXb|pCy#31ZT2}>aV|JV>sH_l<CagKGdQWV{S
z7~{&6F~N9f=HfvDUDRb{Y&JIk^D&6Jy!vA#ZKbR{1h<p6{?I%xo*{S*lU=H=F;&4c
zsPbAH136YD69|ISygnR7ux)bnaF$iS%6oJf$T1W2$~rdh0%g#3Rn6CIZdKQVch|Be
z$EN2Mk*X9P4$=(6`rRx1?Vm71O@IV$np7b?h{0R188#ZmaEzwsK+#2jTz6iwz`7js
zZ5jj{4VS|DtQz?p4<MbderQv4a>+|@4I2%Y1bB*i2tFoY#m?f|E<`=aNooTl7UwE-
zH-MxC3E`I@%X;&QpVprri?oXmOX(};Lb=xN6DaYQoXS%X)&E`xvMwkPE1<I2ctChi
zRaxMh?EPTuV3(}x<bK1%a&j8lAnCHR#=Oh5bbpvHH^{p5Qy6_tGDCzs$weq6T-7Vh
zV#~ux(09!>o0s#IK~85Im@qwLG(NC!ra?cHU5kwcAqec{DnK0&`)}+dd)eWVmpo{I
zpcwhhz@HRj5}Ei|8ohQeD#BpkUdRgxxgxx3UQfLqP3D!Uol89*i<lalON(bgf*Y`{
zejnLtY<WQHfVmHv#-33uB}Hax#l2`ZHR-IT0^48zD$I&9TpjFv%{@rlRXihL%9`lM
z5>C_$Mo|&I)axhtJI}Os^qYwMQVEKVw0IUjRit(;2#Jp2@r|7*Ag2p<zd>rEyRjGw
zBz3{W=_SUqe6Mn#MCe*+K&9SDey@fm90<2$<uul%s!0j~wzF@1pw-7pT33vkcS<-?
zv@a=L0W0Qh*let(18H3`0_ROhjuIyRO%DQMlp|JDrZfm@Ag}AHM9l0NtGFEs<aHtA
zWqlkJJtj$ADuWVkh}j8;EJdm(Re<*??j8e)UGe=Trb*S$k<_K|ceo#dOj*4OCR8hR
z>h{_Vn;H|U$>RQXe$wzzW<S4_UD2__FbG@8)C$=9FZQ7Av-q>RfUZqAAPAxJUyOsE
zIq|4Zg8}-Y&v2#0*AFF|q!wB>MWt%7P?FKgHiDCg>TJZfLOQFYZNc3@-b%b7oZzIl
zR5qLB)PyGyOrUj8{y%qRTGypRAeUtvu=;2N);k1sGC@~O&vsY#%R%&O1H5SV>^<X=
zK{%*#x3gaIWJNLkfixB?8icMcL(_D@76;B-cmF|?bWO0@?*UmDg4H)+o!xD;W8Zg>
z)|m!2dv%L5ZN7uF)hv2{)JHOO3<?gixjw4`r5bSg)wGL*S!Xx9DAVJemRq%jdP3F0
zp}!hunWa}~c447MYPa0-)du*@`s0d0-pah~w#1Spj390Gj4)z=CjhS)q^<CYiEoYa
zG35XuZIz!clNjwH+Z}^BH5Pq_y|lZsL;$3%3{<7N?V(#lfwYyEO`RVUcU>9-(pH)3
z$EkL8qh|l`Ti)UNN7<F+Fc5>VFOdY3@c)mMs8UQ%g?nWUnu^u-eC<y*2?7@5oi$LH
zTJOfqi84A7WyLH-Dc5Ro*Fiinap`SgqA1IB@FVKd!F`I$Kplljg9zcZnb`1Yb(ERv
z1*<UPzk&uzvL6!Kqylu_D}ZR~OTf8ZwJvo-`U=<L6oKg?jc}M{ZKnBuX<bH$r08<q
zMcmCA(J;*lXZI-OWRDj>(qKg=X*Esa`M)4kbge_GXv}&I9Tj-AngA&iz;v&J(9|V<
z{2s-k@7-nH1V;J{C*CsB*7pKj1!1a<YId0Q{V3`v<g|#>BF3h%Q!1d4i?tTbv9FKM
z9CZ{@1frt8V~^dNa3i9Vg!t?2;qSS{8_$xwv$nFPMr&M`>R@Jj0^LmeOHLgm322uN
zcIF~==@F8u3(0QkHcgFJ#QPO)qCDI^TPGqW+o**k0LF}}vyQ@Si?q^LA=@B8K9pVC
zt;HY=TZxwg?7!Ge?vY~uH7sDEmYNjD&KC&Tc5@uJ^M0#a!!Wd{HFnuF#_<$DWF{Bm
z8hz7TdjPo-n802})CXaKrY<jd7MnOWHOc}A$#zWvF{@jtKppEsX105EK)vMCA^^I&
zB5o*a$@QBIR|O&2-o{DN7CpERC=jJFeMb@BFm@e;T)QKDHcyWu`~Dk6+OZ;rFHuAj
zFQ6Pr(_69@>;2&kQ6-odljq@JSJyX+Xj*aqLdJGdK^;Z1V8+Qi9cS;}dmTj-*fGi2
z!`iKbkZWg{`zaUp^{^Cj?e@)@SM0c$^;g8nT>cI5p571sx{(T;%(c$U?n+<bu20nh
zEnWT-k~A5~H1px12-l9R_PvY(9zcX^TjuUN?>_h<0b$!lJ!v26>;(|A?Oa*$tZ4YI
zKUm1b&XsLY7B@X*g8(G5a5DwX{{N%uAQBBP`5NZO*gkcX-<JKO>`H79h+)`D{o*$J
zFGd2Wj?hUY3s~(P`10ECJw*GOE6*bNB@mIQ4TCGS=gmwMP{_9SZ6`Nb_}vOOI*+2G
zSX#g!*X})U86RG>%D*8zOTt<PbF_d$u2oQe*kbGk$)iwss}I&hAo=|#;YOFZCNnG7
z_FF+7g;c9U@B5M63noy)#+Q3{awNjCm%>9qFnDEv?KP3YNdna>$B1UnuX9Q0d}(9p
zy0u{X@*jjuyMs)JdMP3e68c}kj>`W@7<rJuv>b3gItygLbuJ47?_-5a&!yKcge|aX
zar6ySKt0q1MwlgBi&;AkaPlZr*I1vKpf3teFWiSbYw`W<d>iG`Fgk%kCF3P@;5C$%
zH#-ux!rl_XJj<MUTOMIE%xibdUc4=rUM3N?!z|ioT4=#G@<(Ai%#yLz8DM*HKaVmV
zrL*C_?S%`GYR_)BBL*MLE!>EHv-W@MVUBkG7^%G|yB1uBK^S%=5}E|=f3XMZTkT2H
zW-eeAO4By+=PL?~jp6aM4j*Lf0!Gp>>Y?Rto%MBaA!KjdzzSXq)0J2;K7Q10%|Sm{
z4wc%0X>=<v>3)MuDz&I9Ti@xXgBX#VFdJwT{w{zxOem2Gk~^MTrjG|EV>>J2`NY^p
zv|R_epx7G?AZ5DHCuV&5TgZykl~{qf*yv@vDL!?OLPLb&j<V(`(^1Gao|=+tYvBPa
zprF#u+ZFAF()AmZ7>osImswf5>L?p!a$I%Mdb%H=IJha8XJxG-RXPajtlfT0|F55M
zaNzRI>TpuuD?(S;WTU8qXcwj?{R9Mkudwa_xx;N#6r5Y9u&?zJ^LB781EJ}ZX|wi3
zPcKW1#x?^1O(H|5={E?C#+(S$Bm4lv!0YIwNpU?nDJi6@kH@)jGs>I(2pTD8nb&T5
zZdsC=t8Y@qA7xi`D**_?R#H%k`!Dt+FGu;h!v#zeQNb4aseDBHmT<;yu3N8D3l;k5
z{@GzW*B)Bf;I*xP7tAsNSu*H%l*kW@6mM^1b^G!N8oRlqwx&#(eWx#zk{Fa~@CgW;
zx$Jlf2%(2!x9>VeV<*>geiYvf=QNd&CJfYKmX1gr`(j^98jMqMBh7kH$r?GZo8%=m
zcwY@~%0i6<SWF83Tp)37&wjuGCTo(S;ppa<?xr}cO89cdz&phQj&i4-JpI^ZRLTz=
zq`#sn&J|)RZ(rtW<iEz?%!=>~X<8<kmR|x-UyH!u^8p8&4V;X6;5bbfEVOPCQ+Bq$
z0<8}g&D(B(K_3EL%M1cPIeX(q7{+P>VXL8}wFa!1({^x_m*3~&xphv!`Gte_oMB~^
zA+|8~!|kz(u`KBO3tedT8X3thhai2Op_@Ea2MP6uL$lEr@-N+M0imU=?VVo>h#64L
zb4#8JM@D`i;g7Ow!Ic;UfmbS42D$&mw(KU(<mDyB3lLh3g7d+wd#F>pwVb}HQT7Ta
zKSMU^h|Lg+E8=K%LxlQC7E2*i-PM&D$m!CHTn7>g5aqJqgdTvv-%A=qxJFKsK7{10
zw+JRB-L|emA#Kh5MQqC#k7Il#zWrYzj)i_FnFRNjf8WYu(#u;K)#+&mOG5Eh6lqvM
z_t89pDBOy%N!X~j+-B9_;xYh`@AZSa+8;t^&1KvgHb^FV%Y*Jimyuq-d^MGD5Z%^F
z(k)lb25v@RL26L2KMyo)5Z#s-#TCixq#hLU7Lp2#$Y?6^K=IbZ+MCOZC3cdBi{NQ*
zbT7BJ=E@3!C4#3X0@@McKf#mNvu5)~Ab54(7;LU{j)P-E%n0Y$FT{a>cjX%hb=qF6
zYtffYfY{Z&uKm{b+;nWO-(w76IPXsKxfrZHvk9W!D!mnBP(u42gM$s{<&sDK9mw;c
z>{@Ik24UDrK>qtLcA)BTq$j;|7qBQrCW&$K55_&Cr>=YVbe~b3G)5b8WcP{A3C9M%
zr-)1E6*psF3B@m?MWv6m`WsRfJqF7mSk;P^$gG{mNMuh7{r+NB(w-^LW;3+=Eq*k0
z`rl@2*3zP<&FR8_3&tExYk`XyzYN^>cAw$z)J_M#8wU2U=J}ApACGK}g#>!$&P-pd
zqdN+`+Z1Vkpl7Q?DdLVXlqN#xQ_-4!p81=!vBBFUu17Ebrq<%cgP>^Yc8yz+TH-v&
zLiJW}<u!J`FN+6(Jf-L(9GRG{On|hO0uBg$1A&Jt69a&blv6LZ6@;3|@>5D){9h1i
zVeC#EtxI?iv=v%-;S~F@M)Dxl%0MVICerJl7%@Ppg;}p5GbDKs-2Dn0>c-ZkJP1fN
z7o?LYS;2#VRb33sZ1crJK&y}9a-Vd|9}C-uvNOn)7=&Tyl@bUT?tifl8V!%l=!acb
zR-u)f#y0s40<mgf>|3vHeqfadYxPfQ`wa(1KENis)c<}uQ#;SDhdY5=C#TqT_u3!!
zggJ+99a7W7Ko>c)W1|=9stB8T5dQfaCwObN7?B5|(eLFrKs5)|Spo#7RVDGFIb%F5
z2le0MoItlg6c5X}>?)4xuxcx>c@X;jV*cye*vo7GKZsyyyFNJuFI@tJj=wRTcN-%5
z!^U0>fAMs>HKnsrLY7)waOA#q#q8z;2nB(4zxt0gKQ&88Q>xf+cI}%_1`2g*`sL(S
zw0!tRmpBzRFUPXl!*b|UIrUB7^XMM#1dg4I8{O%4djNrB*SkTYTq93xS3;}e=PRW=
zun7XynDfL-v?)6s0n*W^%04C#ny$rK9)z}4)boJXKe+Od4xv&ti<2T6b~RQLAlD(T
zoPoT)K;e-Gp>JhK8N>f5JGUeYLJ)>-$p<#L|BVgSo#OBb|6QqmXlxA$zKS*;2Zp^n
zR$_Zq9##h-73(7?)Ok|sh8sn!de_Fm!u`b%S3zJ{BlpzD2^FXX5Cnijzs7gOQFraA
zAOgrj1oYM1>cd`U@@hsBgLCF=yjX!@vxmYb<7(Uq4C|Z}|Bkk`@pVK}<2wqpKHoky
zKu(Iizf|^aA_oc}Sq{KMv4=?GPGH!pXbLGoynq42D%nu4b!+3>T)Jcrh``t6y5m4Y
zwDQ5F!t|TE8z3_kX9StdM#Caa!qugo;l<L;I>t^(YEdF)YmT~UK~b*GU;;acNF4)F
zzzm*WW7ZvJdU8BQILz!F2U#5iY2a8KLB9%#(Ri=ut16p+dbxGakRo8M6o>XISFP+y
z(JvJNPAV*t3Acd3hD+$zs(aNNV<{Sz9phAfkjqrS*s**3RT=;D^CBsy01~71{!w-<
zHx$DlY^5e4HQs-*7gQ<c@D4CQE#*fVu<`Ol!+o|jW@IPpCMd}OtDj$0vG7Vl6^if9
zlpq<t^8F|HE`X$_S!$Jkz7n6H0K&UCuGShJ`mnM(0JoME1QF;3O4j{}pkkIU<#0Xp
z&Q=FeLW_#>KDkF@I4gDSS5!MsoM+TQEY-1B0`bmpvIoIUo`zTQY79rL)lJjH0^R^g
zZC&TkwRPUbjU`Uig1cek9<L)%agm~Y(byP^r!H?xgupOVs4tBtj(}*q=h}GcQX{CS
z#VP-F49K&&0HXNn@?OI;FzOSlx)zy4xA-!TRgkSCOm#uppGRpG<W<H}d>XQGY*g6_
z35-<LZjED;dJ=A>kb)<)>pT7yx8`tpIeM7)m6`aU!t1*g1wvJ@>LBBS&`m$lAgm6e
z{km)_9$CZp2C8nIZGN{}6ohIDhaY9vVk<EW!d9XY1hfBQ7gP!7Nl$k$KmgxBAiu5V
z2Lwa>f{-v+tJ*c7Z&IoY!gwH6RS6RPwj3wFwJBE%72ku!Veyr)(lLJo0}$3;8TI{A
zSUCC^aS6yh^q+g9JtH8$r53_~{=`e#2VrV}NhphcBMnGysi@(~ANA#xKyvH8;T#L&
zF_;j>0-!KbR$R+qINYpwScQ7_I|jqq|6QfCRM-Z?@p3qfC;S|mSbYqXVN@sc@yMWo
z3_|O=*co(=5Z{IS4f2QFVw+&Dc7IApZsm8z%nt@DOmZv4oUQK4@}&j{*;u1)eEN;P
zh#j8Gx{`z0=VskEY9P6l`T5P^tiCWAo-2{Hu7_h_J^-l=8+JKRdkcUYb%Q8oE1d>o
z=ncwe{X(d{8saq@II}xwFhcQKSvOObH4$|HQlWtPqN6yAE4@N=6seVuo79;>WZ}Tz
zKPqrl-9Z%5ucAgD%C0Tjfe?gkX+#j*|Hdk3+Qj>H;lJe|#_<s#w*`d-=EG;(TW@$_
zI2gI%i6b`E7XNc%!3lTt=*y;Z+L>8kbeb;)LyMwU0WK@+B6)w_)l~KXk@bpJ{9?IA
z16t&<CMyFXHMoikZSt7<c2fRY7*#2i0D+af#G(&d8v;ZD1}iHq{;aey8diYMR2;`>
z;uW_ojmCI^a4;mt!rl!xfY9?}p8Z{CHKyG0ks^FfG9uOg1Dnras$pb)Pc;tLR*#h0
z@YyKg3nj^Fiz~z?wSX&DfY2vZcX3wFZeq2ufUuIh3=O`y@m00r$0Rb04@{3+v5qf5
zS4r05GY`gm7v~jRRf?(YEAe~Hst<ssiLglY#7H`G;<Un+ZrSO<sv`kH6O>HpSBu7u
z2Bs<-knwpcn?4kAPMXT(N^nvSsahD^6T?AtscC1e*!2~qHmy(hVnB@_P*rBrW>b*j
zGBLtasNd$}L)jH12@Ha;FR7r0|9@;@c9(FIPVbr8A_f!G`JOfrGCUVJ;hjk8hh|8m
zJ{7%C)KS(r_X|pf=!}bcb2Lk4_lvS*T4_x5!N{k<aKC?}yoPLT{+7dfX-l#;M?f1P
zizQ!^*<!I~w-FL4ORccYF*?WjaD^mNn2H0=Gl7OTq}vXFl%=Ag-GvDAw2n8%Ca1rH
z{IT4*_QuE<J(Gfxjo^=MjEvCm?@MAB&TV64jD`wJM$T*O-Vn^8YDyw{+x<wO9;Ls>
zasK@koc<TRg@`JRLpGP8jlqRJEKC_;lQ+n{F_=dW&ztudAVb?2T1p(F0wmm!dt)$4
zhgJUs&pvr$WR!;2h{hw<Yi|gy^tWW6{aXt*F-oOWth@d}(Z|Rr6@R#q2DDoM0rF9&
z(j|+b{~jP4MX|MrX}g&SsY1z=OI^;Veg763P=&H(hcjPn?>-3AX?O+yL1yf#CCCqD
z=XxVR2m;}j#0NtEjh$X{e*Cy(p@E6AvxqprC&**!G05}DeyeZ`D+yFxPfy}<E<FXC
zJhJX)jg_dF=Rt@}H}gr)pPMhyFrJ~#O<{99=*W+;F`l7j5AsrXdiN(lB&0by_gN>H
zN`Um>&nCCQHuLj=%*j4&T5Q|x=Tcb7Bdoe17&4s&yDnk~6;$(AaF7Qf09Znq=B)@U
zfb9Q+ejA0|;9Px#;wH6TFspOujnD|ik%WDMc*DJ_Jf+S}xNgmZ{PA_%;Gb+#r{~_M
zMBLv?)M$$`E0@-K&x7D#2Qn%bD@>m8hJ#g74>ysch3!Dt#ROIFW4Y%+9${||y|WUp
z*aQa~T3wxwLu;o52o6?T_&Q_F!gfN`x<V3|spsDqyhPp6l5lO$eC3M^*MDQM_KA69
z%{&PC{jEW~<f4V`Ji_kd6_DO9D(Mm+5caI<m-RoCT~U(7APBpX3I%iji><En2%m6)
zjBRO*fZ^qb_G~;36+x1njfkI2@dN4Fr;XKE1=-c;D&ne~UQhrby^3Y0DNea8fRJ7#
zweDMe4i=&iCF05+Ir#E&V>hA@CG&YH{gj&5XU$-dT+dr2rKxBGgyae*xn6zU0Et+|
zo{`Hua`<1vRY4+FVZw!AS>wGLwYZ10!EzcM6hO$W+ngXnS7RlKTd}!mz2k5dgxm^G
zWj?JBQ~?W9Hk37t{k+MlAd^xYVCvtbv5=tFb7WfVN}1U8Z^P=;_3%?3#)sCwjikfY
zO71b@B6X0DJ4L!n`-wK<mG!Al+3s_5X!V<3V2w)8<Am@$s;$8TEL7b~<H@sfH~yTc
zRUKi&#)qQ<$0+xzLrJjoH#>|urq(gYuZNtdv4FknAj}S=;bbRzOuY^gsn&V@L<8h=
zZ>;16>>p+4cEvCZ!qAlhezN~!H7BRO`~?<J)5K9^B!e@(VJRFCmBM`;XmRGkoHuIb
zhp`y0l}QiWIIRK_#4CooJ|zrtDH_TpAr1WvVF6;|xW7$?lOWhu-g#kRt#Y_A0V09b
zI=R8EtpF0_0As-YWMJX8VqTq%HLSKDl{^Nefe`}YGmL~yfKYXn&@<L^{DprL)T_`I
zYql^#<r{>2ilNokdP5FbkpFT$ZyOWIy$+QRh}(c(n=GhtSW5@9Z9=cA7P+L)JP5^s
zNiW_*-A_I=Z`aFe9vHe`3;&4aF)qET(mut9q>Tc|rB~TOt2OT(mIr}edq>jy>D7@3
z3Hp^PuokAC7-p8svre^S&cdVFfQS&Ovi20N#Nd)fUc~!s<yYEuw9YSIzjJG0l9DaN
zz*wANf7|9{F_az7m1!R1$uAK6tg{!l9eO8bCo%mfyS5vKVGy{I9Ug}L7b{j(j*m!%
z1x~~!aOQbIYS^{*M-D!v5Z5v)FbH(t5+R?(wo9w$l8GQcO^t^%1|J5Mr>9-8>zUFb
z6U)f$4Vf_YLDH~_7G|`tDCj>%=Cp|KM%*`(*Z@gYB`0LFSqA%T99b<oXm|<g*6+OW
zOlk!^Tn{kBockaQL9`fn<;jr<{1xGH!p82wktpIVFwLeuxZeZ%OgT|9>^t{cW*jN4
zyE_v>4t5=!2nwo?ul@G8`457eR`}s0dLBRU9)P5}#sd#^h2e<%h3@X)t$dK@m+wT<
zE(o4khx1JA{tN?<)YpeFh2HMepxp-%uo^G!#;}R40RnwBxV;lM{0t<4#$t-v@rQIE
z2#CNY#ZXwL{vI1gQtMVXGKwXabiXDP3=gg27-EQ!O#=c^EMWwXLJ;vjNa+C3!Ub&Y
z0SG~oGJ4n$#d^c|P<AcJ6~iFxO2I&E-~VET*N2qpqQU!&Cb4A<5uZO8WNXgr`+{he
zY`~xJ`6)5_2ZYvjlC9>-iSi8)ur&=m2R{p24K+Z(Ruz2=+7qX@_znVZzz17WS=fYq
z00M7d3j1s2P#*6uEF>+Bco_ABsa)&>5TS>}lBUcf-2H`xq-8nezU+Y7T1b>>fD~aZ
zTs0(g<N!YF^8}KXWf%{}hNp-Whz3Y8*2D3HSsRX9xB*dojYVZgcl|{1eURd7&LKuE
zQTA2rGYy(nJUKy<v<ZIjHAPpCK;q*5+9mz{g{l=Hqob-g<so(&dIu@G`W6<!sIO@U
zZ&Gx<hj5gfW>V$Bn<zd<*{n|^Zn^pg2ddVchp()(4P_cd1B599x)Di-V?IZp^N_W&
ze;R&<Y37>uc|ut$%m=Ns%40<AI|$QUhl8=kL75GR;%hLTzZf;um;T;R)$$2(JmRiB
z`db50Yv!%BxFEjzW&o<zeg7te)&*(@M_3tc89U^8&Xjyw*B{ERV98<-g#A(x5&8cg
zTbSLK^sqAzZarnJMxl*_FCd_6xw0!p5-x++`Owuj3!d^Q@xckLOb4nlB^KvdcQ7Tq
z?i%cEX%=hssRmJNOL88z9Q!OCyiNclgk{nhv!4FELe$FOd7jtp1=9ft(t-SP<w#bh
zko}zlRclulMu1fNivH?A)!O%QWx;kn_xB%Et)vFYmh82`5<}Ip`Za-^zI?w1BRL3M
z87<g_DD?D`HK<yZozWkwT!s6A3$j-3xrZ`r?wvgV35;Y3JCIe`N*@HmmR?a>!qw+>
zpC=Hu&e=i-v}?3<Y=Gbgfgct-yX+Wb1V*7i#Mu*B_UUgxC|gxtNAohD5EjDL(O@Ul
zP_qFB@`3#l>#a&f1|Z<8Ihz@p-G0b{s^!n+{j$utR0bRghT$FTI)88USB9$A`SpkU
zn-PB*v3&=T|1MP?(eVB;aF`Gr+UQ$dtLS4WqOdQB%KL}1YfC~P24PpS4_^1bm}S(2
zFUuZ41}aM_0TS*H9v4KlwhUl&S+sbNjRV!v<al!Cd&~P*4p6P!mPD>OH+F^O4BY%H
z<L9ke#^#2tEtA&Vg&?{*sc!Qd;!S?ec*S2Ccy66fb`}=#0*zf20jiaRE5cQ`PEzK(
zCcw2$4#8|7d)9YfMkx*m`a6?oh}Y-c8pPJ~v%(xPI2hg#g5p3nYcK9s=Z24lIf4qq
z3P$KXxvTH42)y;EF-T!iirNiDP|XVEsvrqB%mX%rpqdrKyznLIlRpRPt0-H{PLjpB
zle;Ef!YgqL$;N~J!4lk(g+cRNQ|tXOKx`|C1Rz9|4W12a;IH<n+J3q4j0|)QO%Psv
zah6y7)5zM@1m#zK4brN+^*xQyR%y1`wsrR7BC#!zFg{|-lAneU)?R~MmFI=y{oo2{
z>-ZTPp>{q_`X>_1TxDUWTyDI?Ai&)kLR&GySp?QG``$`u%LJ3OJ3U_e*1%cyP1)6?
zI}C!rD~bFl_rKV~wr?i8;4Yi;VM+#^5v<5UEpP_Y_5WZhTe%1VHiS2?H9P^h)_wrB
zKs_!V#(4K6n8%aMoZHoMPz)3d-~&Ftn|%~Wk^^FB{?v2u{UX+Yu9eeKiB~#yX@`l7
zM>W8vlXJ5{A4&w`)*&m={HZ>4XWx_mfc5D)X(TzdzTpYTfecW|l{MV7Zv))Gr(+sM
zCMVW3Rs(LJq6_tWd6MCMBj5(i0vYFM7JjiDhy|5|m7h*MOWzZy1r?$gmvHK%)whvU
z9F(%u9@a)AfwUDB@j`r+*#{GWv=vowVLx8@s@4W+fwUE}{Q+zFkUrjxKr66Hf6n9=
z+JCQ*wnDz+HGaaQYQHWKAvF+eJgMv#1e13o<OX&IcWj&2CO4J?Zon3WN1wyjg^^8`
zVguIf90t62C*ZPdY*OQr{dlFeWy*7=UfVwJM+vm8c(BnGu5sZ9l`Y@Aje2+&(*7vB
zk{bwO5Y`eo2uc5qE$qY2W28U>D8nEym?LDsSY`1@(Ta(n!ne>^k71rYsz5XE<w0z%
zU<!!DTRz&5)*6G%bSyvVg?GSIrE&9=N30_SA#kl8>GZldxas8IpL1A6p3J3XY2hUx
zw&Kt^)3s*T4}J?lWnd3e9<Uj^;9SXUd9dNy-RO+U|KdUCdaf;JU54hJE19hrt-m(T
zuL3Fov!!vLlY0W(V)Jnv)Yj6`F}h-Xv1R=&!^qc9miTp7Gy>Net-tf@@>4<x3$N0y
zl3FZ9PJa!EEeGOkyfc}@@@fUKWqmf@po&4(Jc<UfWgf-RldLfxyz@d(d5tx8EK;m%
zNa`&FG{L`oMgQ8Qpc68&TxREhQ3}Bmyq1~h#VgyAJfHxt<)+3~;8?Mz1-)*nL_v<t
zKCedp_e)@~j$QAvxaBjp242geYSfuekCV4GrNM4vX5m1mfRDgynWJGQpbp0Ow_<;k
zT}iG)Aqcz@0;1mkVjt2S%0(x?+`a{I;4xSf{1nm(oBC>~Gn4t?LxF1zSo$jFGhWw#
zYh|w3K}CJ{huvJkYoN?*$x9{-VC%$bXI|;x!)_3}UgO(p2$DWr@PQjf>Zpb3@W!N(
ztvp90O6khg_>}|#f{9F6U3~HJYa?4#XLGQUp@YAihPLMT450f8vGeffG_>W*Ku^-5
zVDg3_P)MklJgOSocq<KP%PxKO;e6N#WUFX>I9B(~|G@!%;hbGxQWMvOkN6tesxqYR
z+E*=JjMrBXwlcfGkrcMYs~RX<MHXu<`L+*Xh3G{j@7S}7=9Kq-z_w&d)1~ZFam^kH
zNLv}pwxN#@URxLFg}Si}(Facs)>f?9h`*(g^oRRJw*fm2Pd+yf<BY2jVU6kRHy3|N
zP_9mdOCTgoBM+jEeNAvfb6KAsgUt#-Z#P>TZ!U2?CI7pfjoxl!_cZg2W!t*`QFaAK
z5QHGCr4<#h|HckxZwU9g*g!^iRI)}AVj#^kQ=y;4uf^tR7Q6`KOFkILw1=<c@FI*Y
zTg{&;xdnKTW|cJ{lkfL2JPU%Cguk!m{NfG?ja$Jzk)XKWwsIEapqCXfa2jiV^IHe%
zRvu1pA>O9^I%$nt(qh%UWwHLpfD~)ZDqy}I&FpNTZsEmvJ_Nd$OOb)}Era#AuM2_%
zZ7WElH~SO4sGrcb@)*Dk!{qlKlr43Kmy1PN<qKaaTl*12I_JW@sGg;41&9k~qhj>+
zk3iXKebX{job3+`i~)=d?mC)v0s&IoRS`##(X@7fF@b>|i3C}P2U!47X*uRLlm~%O
zkblr{*x);-r<Aa@Y#?ALU0CQ?tpG8Q=u;b5f-4>8L2&yz%)rD&Z$?r=K`;?8;Jy6t
z9~RP9rr^|~A3o_gx+x`X#VK}>D4AIZ{B%m%iu1$1Y~VxL6<t9Lg0Nj~0uU*(|6*6J
zSHdSO!1IZvN=Wi+#oA;g*&JZnS=EBRPyJ(`(3TyN%uZ<Nv-N{yH!B=%7@PpML3Xm8
z<?OW+)n~TLN@&XztwvGuYY^jLOJIr>?upVr_26yM13<j|T(*8WS*5@(Ej398g$-(i
z2lk1fM|$<E3B(9>0hoIAJi9@P`jC_dsId=%z#412V|3s;+Rrd(Tla+vv>tw1Fx?;+
z&DsY)43z<Cc_qFTKQV~;#t`^mC7^L1hfj69c=`txYJ_(g^5R5J(q9RPTQQIYs>KGC
ztq~;OTP!NT9*++;7J7vAfNTG^(uQ4qBM3$bT@w(}kXh>2df;23(vx*93jbgwTIeS^
zu(plF2P**)rqaRh&v<ax0>E_+`h*jMT3HEj-4|)}vozf92FC<MZZqtwIdT8`2|2<r
zI&maN`=SABmuW)eMtpGQ_xgM(JGbl%VGsy!DHqUW{~K%YZ~1tzExdc?M2r|=X86hU
zA6ou5*JV&LNq`{ZR+{!F3G6~{6soTcd+}+by9*Ja9ed*-Wc<oPMiPYF=YQI(Vy5OS
zti-qL`E=Ytp^Mx<0pk4v8%qRDC7ACeKsG%31|Q-ch0~h1x2~>CUQqd1IcGsSy2%wp
zN_`hHy|=d@0qUcP$s_n~oom9UxaBIuLxOQZ09o)&6Chq4SjsHI^Qa$!RTji^t9jur
zPV~KUJCFzV=-iIA9P%Kz5VaAAyvuni%?N>Q{|SODRy9yXr85}ze-!U-$qZ9&&uIXU
zxD1N#*K?sO_08GTi;Wo+Kf<1ry2&PYUxm2fNN9%|4ODBXpdjA5Fai^6Wb^_GMc9Gz
zO3aa`vKI8*%AR}HH3}$UQX%G*S^!wD1~CPI{T2<i9$8_R(BF#D(0Mig_sgL4x94j$
zA^rXB`J(I!k{|{_*q3Ti(EopIVY@?gmP7M_Oht(xkp83Gl_Tr(toj<HJg~$4s1w_3
zy(+djr3@h)8C9;`1!KDyN5%x#PEGMg%T9n;#Y`a_)fkjnF_WrHhEt$VxEnW~zLoeE
z3~|}Oa9pS~8F6wk#kHfv&mtSaOcQg5^U78pC(nzyJ+j<&pjcEinQzGuA(YA$ib5)k
zbw`C_9#Jac022|dpkFeC#*DFxRVYy~x*5CV+4buJI?kR8cE&ENLitW16ZDc*uLDJ*
zQHMCYt5qm>yjT%?v^Iqz%VL6usEb)pHpY5}nH}XaV;Y%2>5yxIHg)eZCUG%l@hjvn
zkVff+M~pWp=-qk-`F?4CV>oK<q6FEy)t$(1#<-b{d6b_)KeLv#4d7=f?>&HI;p<pO
zh%2ZODD5!mhqEidaUcYNUqTU;|9|Z8nld!&HE<u8pdzR+qd&dxLQZ8uo8ev!6ty9R
zg<;~Gr=3qkT4h@NrE7Q8YMEc!Hfa>OjmR#%qckrN)lvcj>3qte1(b!}bopO0WUqgH
z%!=KWRVtR~Euu{G|H83{Q2~p=Z8iv}WkA|3pd39NEjSC<U2%ctB9s&|DEwTY;+cmV
zinhH$YSY4O2?bI`YlrNkl@kJc5$wa3DM5=ogR*Y6*xs(3c^LYIJw!R%&e|*UqBj(C
ze_DkR1(p}VTgKSrH32%1gTJDH=G9vZl<f}xPoVTbY=SL9;@$4VM}Jzrq6F>?Ka)_x
z4De<I`Vqq}u6T+_m;s_!@6TkK0GNS|<o#s4<}aHqJs9`cg<GoOp@NkGf#Bxr7lJok
z8~oSIfIQODZcaHnt*WCiAPzKIMTzlL#Q$)TAI{DoM}iQ9qF1sMMDBmF)=Y+HC$)f1
z?JFRH%7@SEUt+^{V@%+Vx^SvyWQp<^YY;$;L;2$cSqQaH8&_#)?-h+`{T7W<y8|mf
z6^(d~4WAdzFIw;*@URXC+SsQWnXiOG#9D=VY+tY4E88Wuu6FGd5gTpF8CiIZ2_%uH
zIo}J07P7X!pq!oi`C4#Bp|DGq|LW2gpJAW#Dr&yomkEuoOoB}N(E*s#Webw3Ey#6}
zB{Yg8m<>QW>5Yz$%wM1}>JY<hUud%s>I5DmW5(q0Mq_M77SLRWFkoL(wPGTMbnFix
z_7AAeiUO_S;UKj7p&HoO>9LCYmz<KoLXd;gaJtj#FHh5gb@Wc%PEdl?yrNO;S~VC!
z3kQ6_V_%lhQ?OFlB!Q28Ey+KvXId6}GmnmIW@hFu>uq86bhK0!*54fYG<H{<2WrC)
zWmk{{F$luGq*f6B|FJa}z*!FF1D#?K2%#Ze9t7-3_**RO%8^NIrAqzbRYnyJP9p1*
zxPs1*U6DzT72z%q7R@SRACMROfM1>>RSr^YI3pr<`U@=O!;_dhgFSRrB@4vIC*gFV
zahUU=LadYVm$FWPkX|EB*SWH*l!J7RlkX1}h0bBFpY$Z5MtI#CMJcBk3LuWfxw5MW
zQw&ZKuIpS`hBB<rIaPL*?5zJgRdzv{a~HcXXS*s80?av>?`#zyl5OK7LigGg+JyE6
zQzlrefFfi#gh)o#D?lVzYfo5Yqv}bB?idezvFNLs0a$%5gzGw2c6Bx&*<y@EQuS(}
z9iz-Q@^Nt4Ep+Bjfonv(bgm5I!#=nydn9i4;VGeSkQ5X}lkD%yxnzNZ|Bla(voo==
z00e<(OM-aNe`7283C~S7`LYcV4-{}@=DPuh++fOtcGSFb%Oy<qi}9hbriqZP(Ba{$
zlS$<a0+EF(ZvH6PRw>CYgiIzkwysgx7>C?IiOl<CzJ>S>Ko$rsggOlxn-?qjn&7*y
z8)vqHzk-mRL<(M>pi`_kN<M^5ZwP9gY*62C0|P5-(lUCS9N7ySZHbkgL#LOOy~lfo
zYYCPeCsTA9R)>H8Wh``xb$a0AF+qC4iZK?udJ?BJDa?orSEnJQe2iAsC5tn^N|_ZR
zL#tpVGhA(mrL2%duJ{YI$W7^h4bh~E6{u$C$QV>SjfTvZ=%ga@lQq9zFNV(7{HWCZ
z=QNt2SHA{zl^YxZFEc`>*7%tg@(pSQEB1#zPdIL&lriD^;_mRq52TY`RwaALM_cre
zOGozT#R{wkrrFbQs_@<_6UvXb>OxmT{{)q<WBH-%3X&iMVc3_nNd^A@v8B7CFta(B
z2UwxlGy!RED_h+IVzKQ8Lq9WC;e%h9Ei=jUIVzjD68}GRz8FC$pH7K+4QCh-Us_#c
zOUDS6OA9fZu`uh>*uK1+ZwC!4@`IgEt$rA9tTYwI$bPiT@Jm<lR&67jGovBm7|B&<
z?u8K?3f-!WNjLBsr$YUx>%K6ogvy4IIV>wss9%0Iv=l*=4WssLjNAdq5+><6o!o&-
zv8RfnG;jfuB~-<$bY|2Qdx{cS!<f-ftTL)(xZ#)8{cGp!^@pjG4tXk8SsOmx$Ycz~
zwkPNw#=a2=rDfbWB9(rKZ|`SgEUC1N8%NK1*)H*_)R?ig&D8^JldM(P+45~y>KQFR
zoLvhJ!ypK~k|GG+|6(gy;$s;Zx&!nTs2>VEFuJkr%HkScymygBWOPf6zt2O7?cxGJ
zyTlll@JX_AVHcq+#_}8&^GcSHMU9+`*)R4YXl0M9zq@Rc&q>^;3;mV@oHFAbVf4-!
zh?y1$Gm}9VfiGAgXeNVqSI|=}FhoH*;s_ozJw*s<T}<J0#~LL$zY)M8i!wY`82!)=
zvu856BZ`8a0s%}MXHH{M^Fmg*K!6`hykmcUUL$5!ATW9su!P~)1I}83fUXBEcES(T
zrUGDsQ!n2?6~)7vyj{2lnppv0nE}KIO*<=um3@RMqI9?rcFOBxA!vUOgE>OLHE#n%
z65}=w7lPu7*U;@jJGWCUP<rSSjsDn_$Z<t2sLPtCGDxNcJ>J1OwZqJ`xY^c7Y+0K-
zfvL1Y(xgDJ41u(T8q5M=U*s>wuIN~T5QMcPA}aki_VD8wZjL!qfKgmzQ6PlVd6TKb
zF-QU3-v~FDwZzc9;1Ef&=VIdrzESiT_ZBo~dm;2niq#~gX+03Mk|G=}Va?kOUVTV$
z`Ux7l51=s`9ZxTF(mJ_I4kOY+B36~BAFA}hu4}puW5Qt9kTL`Ol4=BkD!GPK%assj
zKTS_agtCt7kgXdj#f?yfhbs$281W%VWpa=ctPS>Vk3+>uF{(8jir7Y~BUlT?8t6Wo
zFV?^%%EBZ?SX@~w!m8F_ry!Z#hx^F1R|BJL=ql;HIr6MB^Nkv5TCC;D*zcsk$6zUD
zKUaIwJX`CP{AMCf0^D%ZFoV}3Bc+Hv5JrWd+fs(+0|9(4E=v+Ig-#M-RtTp_@*E@r
zh=*M9NWZN+yOSI2DTu$1?n_7j6k+N3j^O_uEUlP59NGVt4}X-M368`t2n4?reBu26
zV}m0N#Yn4#e4ynVMqo@=F2LNCdodo&Q7^9EJ4in-aL8EI1<?2urKvV$!_r#M&4zz8
z2F9a`Y1-XEl%*1o3RQxJC|=5`hIc%VKM|?lY%er49G^4UWYsZT%~ZpS8cSPY(_4iD
zIV08ZvSx6gIuDatsuC^uwml5nuf=u!NoW|^Uca~ot{c2rs^N9E_H_mF<K64)@N;*o
z%CMdi%OyrxV{lnHoZX)>in>PlOV<Vuu>~Z3s<FT+028urM0Y>eAZ*I;>)UO1#+h;r
zco`Q4yOs-$USEgD&b`7^$zes6e^c)gX~S2(FMYA`JNB*i68%zr+b?!YZ{d*9Jtz;U
z=B{fnacy}8E$4<qTCM@uWy7ml&!}2i!|QNu7b)UxzehQy!_5+%5WG$gzP$Arqq2zX
zHl=H}tNthuG<AiGw^Pf(!y7`!Tgt8eEfi^817_9%h<M7lN1z=4rSYNcyp9}*VHn!d
zu0*B&8#8I&@bP}Ua03`+F#-ICk)@@>eQV6ld&qZ|Optxtp1*IwN+<hAj0_YFU(?cU
zvMu?yCJW?0K0=%!3@9ITazN44hMuIhjy?`}s)qPw_t!{2=tWGh=vGFITK`)Nrr%yx
z^5w_@JY%Gn9xWFV<Co<axaqzXKy<`Xo-uBy9;*{>Sl5)_<4pVbxg4jGFprK=Qtb`X
zxP7E@L<}0fU#K%ik>ZlC984)2J)^_#+D&~fvq*;_r5zRf^6`KrH74duC<^H292}|D
z`l8nOE*;VzF%D%1MYE!hqt69?l-tKBrQfqR`N|<6xP2T(++V+OlZaBt#lzmYbcpnx
zLNJ}xxMvm{xOMeDzh6M88Z~1ak(uZ^NSdZ&m*y=bvjhktOU-s^WQqor0FuEaH)tVw
zUG9QR9fbJOfhp!5_TE2ChZxgnr8`fk0?Qz!H`YAxLHucyHuy!^mDoTGgRqq#A7TH+
zE~s~ylPU!kaMOIH7@IFhC}D#A?l^a9VNTE+Yx6{J=12LM#puZVh3}O1Ss2F%%DJVl
z=DT+gG;fgx`%kOSFT73g5{A#ZRg_5Kb@2HgV0$dF4Qu2(2uv!TIPaI6ZaaU11s)aB
z7m`7O%Dp?tMxaXMbnXc$kWos2z*1!d_4oO=Dhvb?s6kNm@(IoIixU)3Yln8zLiw!*
z{S%v4wcjPZf&sg=HDJ+fJ!SHn#CarZ?KP0|ZM+LJ5_EeAY2-w|S^)9wx>jJk<uQxN
zf`os6EU=J5VRHw8`pE(aG+rUq{5=rFPfAcqOYjj&fP`Me1X%#jt@(rF4AXfwxh<Hr
zJE?$p20&zhT<CiiZfWP4&YUoegj$=0fh-uvDVlOX<CB1J`jc4U0TfGs6Cj?cnjvg8
zx`qqu3z6w2zXtw_ORpfyS*OXZdp%oYReGP+4`o-B#V`oMu7rqS?|-q$`bzld+u#Cu
zu4QUTNM1n(u31Q7V>Vk-2Z_6@-F(fXpn_1M05Wk8hZ*tt9OuTbffdCT#O|IKJhcuI
zDyGZOlbAl~z3U)Q;V;Hl=Q%p0u@XbLq`)hL)0}GoB&nJ}cFSJy8!dnY191Mc1V2he
zI`e;!;HP-e=F~r<`i7*zQJuGgfphl>te4sV3oz1*x85n#RS@(9NTHIFTm4i8iGpPl
z5MDfZHb6iGxbzJt=&0W+6uyAx)CwmHKen`9uqhmi8J=W9P;;7Vtk+MF{nq?m4S-NQ
zd1?hDCRdUR|3`r#;5H54I!{)EK%;<y5&qjz>LGe2M8^db#1GPfJXGwPu2Dvr7-_KR
z{5aXe4G{RI2tr8Du3)pX6nIn-`mOE960NK>Trmf2=`1BS*-fd{d1_f3MT>+i55|Fa
zohC#60?L)rt(Nplf707B&i948rF}TN+FS`j5O$?;D4_Sh*lISh{NUxmUZ8RKaw4VF
zQATExvw~Y13B)O<;2k^r`#K*aS)lCS4CDNL0VNGu$9%1G7R~Z!SE<p76lwy-T;2t9
zyq&XnR#)0~nOTjqT~<inDxjqG_AGfr!!CHTyF<TJlrqQ&J*l7!g1})fpxoyIH5otL
zKw-S;&}7LZ?>GnHtzbBHt~`iw6i|X{u+zm*E{(3Bu(##<ht5?2h0j}RGwkC=C-gxM
zDg~z1;EijU{jDSNb58;Zth@hFC<eG*4cr=x)rdAK0;&%VF6<Ao#urf$(B-)VX<cEM
zrvP%REhG`XF93wSLvA<!<jZU;qiALk9O_M@EX76_&jK^7j!8W8u}t;VvCGW7gC~r8
z6+qIUJ>8aC5`HMV5*&y@5cnlg5&i$iR?@9Qvt$bo=)@o(<rpp$j61=6TEE(w!WiTk
zvJRzX;?Yy`dblPn#`lB~o~qZwP43$&BO{gWIk+d8YygG5=VyOqCWrzk!+SkCNhUTv
zrLUn~O~0d5tB@M&AAo7n-KYR?T{VM(eitUgj4&rCE8bB+1h{0G_6(DLh@g<kc^5S8
zi<nOFca)>GIyZ^&+HK4kl!mR57<E@|E*ZICjI=Y-qQkuH0T9MgPgH!Huptr;pnxy<
z+B<R6krQ}d0w~AZewT3G3uzW*&I0;X!S1at#qcWxP{8oh>Gx;s9RLfn>@iqBlmrTS
zB4HjWeZ#^mdp*47l!U&`=Bdi4-B2tBP+YAY+CjAvDC}9#Q0~!$!l4dkt$EZPIAzWv
zo@d#yam|QjdQMIo*E7~UU5C5lC~6<ht_4?u5QJSx5w~*xi#?2!Ey<Eyd2@iqQ9jN<
zOJQ5AWx;>fI#F-{*1{m*ob5+`;u=L*$LgP7V;2DIgau}hw2d^U-ze`&nCE16f7%&k
zdW}M{2{ZB-Jt6iA3TF?U`54dFf9sWyO({UXakHxyGPMvBSP*Ncob-sYH64}RHA)HC
zyJ=ycIPPO58mat?<J3Kmje^;NjI3!>|93<nE2{-w7n&+Y0cCLJXkc$_b)E_e<*6DL
zTfvR(i#I4__a8D%(GS6zm_L+C)fWE3U7#R)8TAy<D_gR%wWx>QQCW*+$FtdN6|1EP
zU^Er688k*OP%^8Pd3xQiK_qjatwLM4^rMf=ncZww#cIRUtPq|=pjtsm18#X=URjWn
zVe?fvXk;nGZ~V~8T2>bP1%A2xo>l)SyA~XVLJ)Q(5mCAS#RhK~Wy#WH7ibXigGl?0
z;=c~XJZ<fd5mk}w>x5rfFus4FfT8_(G126-SM5K7Cu5UffS-MA$CIl`#~7Czq9FhF
zi5vSugM1otILK=M@9Kd+?oQAEn{r*1f>^TzWJQsb)k&6?>`g(M)?3TTvdO&p<S~nY
z)GcAW6M&B>&8j+RI#xMIQ+m^d&d^A*ZnuOx_NQcg_yp_;2|~r|k3xHB@21e^vbrVC
zK_EQ@LiLD|>NHM|Y#OhMwuB9->L;u7?h&IPwb5F#W7okRna6IH<ccOBm5!Zj)fi>j
ze{%Zj;~s&WfXaYRj@#}*&wYY;HGBn(R96=)xliehfS?_*|8KrNz0HpD(X>V{t=GWF
z5UtJ4<{=O2zc@+J2N?NwU%^wED&c`rmP>VMEqNCWJ{S+9E5WGUH7?TwYj1*UFN0*!
z(Lg3E{~X{=GRD(fB7A<KlC@GVqSl@qY2hkDV}615;#j-?wbV3%MCk6i+K=yXKy}s1
zSyRsQG(tci6R)>iVyVA}$vMx9H~|6u#huplhR|V|4V#ls4p`K_I3ygzTM6<a>}rxV
z20_@B{3!zWzt{siAK`7%Wj7ghC`5!H{7lMT=U5mNWM_L1!n6fN1vQCsK=JJi=>e1;
ziF9=qxL1?m&D4wv>}l)zdRxFQNcOEBh@S^O_pbtxmW3p`pMUDW@p<@K(4>$xkw9_e
zz*C2ay8;OQZD?KQQks6P>pgS=g07kYRf0r$+OgObB_SwKSdFmLHq=rfCnE;86}*WJ
zDb|-Nv`vq6nQ+S1hGY$?TdBpLjPye`y)7C8+mNgc0cT5BS6Q=E!kBa|ZAzBoDauqG
z1xew^@1!Pz0v&dnRm5uHYP&AuW1J6TN>)yb`JGD`{HohiM92F#5ReBB8`IFjRO{9g
z7*{@)V8Cu2Jy?OU1{RWuXbMtx8=S3}Y%Zj_x95G|ArNJ>Swc|=8}kf<P1}c=82Z{E
zu@WG~*#hI<cnL<a*kDJM&h((j<*Wl_QK1x7B)WVTxd`_*a31>|Hb_9q(dwzoj_c~T
zE>ZsbDR_a*f!$<M2OzhVnSgB6k6Y=+1juT<KyK+F0V!KOKANp=Z#3umxJC9>Fh|%3
zLU;i37J?HHw1T}8o6FR&o%38JGy<Yce_GnXN`;;PSs&Yhi1jl2BkWp|EC@l^l|)eR
z{udkc)gzh3FuPu*v_<3>Fo2K^y65=kbP$>q6XlgCKz8qnVj$MIF!WEr)D;zJR}!#f
zZ?i1gPO+b5_VS86*e!-%fIy3;^j~)W6eA6m+Ksf4RnACrm%ZUvNw9UJ5>SiNnee;&
zqd^WV)i5883USK&NCPrpsf9@mm=EeT^7>mhAPz1HdXObZ2nh1Sdyfgt1%2Bjk)M!}
z{5-A5SN<zsNQ7kb(FL*XHhJ#fib{Vi>_tS%y}uJTPJ1$y`bq?^uw$Hq;yq1O=dGMo
z=4<I^_W1YJJ3{=A(??AXvBKfY-Z-}r+2NHQHy}nJw31IDLxEWTPfA+vlpF#%w42?w
z-}Zxv+Iuc18Bu_Q_wGFsU-}t}TnpiqcyHGngtYSI+q9Bj44-~CXok5(Ns%049<Mhl
z^-quh4{Rt~HpED~V@2DSBESRNiY^&(J9l6u=?R_|WCEnlH&(h%5E32j#fgEC7OA7W
z%8P!<c;gcq5ZJAbisZPKFs`s2T`dR<*I2m1W?u6F6XcZ{HX!71X;n;w%^+nGkFd~y
zpawAvenpxWxWY2s`X3uVgk9T#1R)4($??IX|Hcl+J;GO}fvh?%LV$pZajSX>f9+F?
zh~?w+K%mgu`<W89+9P862Q(-Z&bU$n6!jj=zOzvX3VLgF7Xjl(TM=)D#MG&<N_nN^
z;=qpVIHGg&cO*7JSr|TQ0;b?<8vamHyvisFbTpq+6+`jkiVSJI#9R1|U}s&c8pU+C
z%9w1W=a&u*VL7Gd|6ELLp<QVEmDM09Ftx`J%x3znuVwOoQKh`X7Vb(PSXQ6*z?ueL
zRvE7p;3zURX(hCUrC_O2(=x$ui8QO=?drZU{-P-GWF5jrv6e9#ihQjF&g^sAu?)1%
z=URk@frhp)zwH8r(!R4(|Ig4B77u$xD;9p^X%ezqDUWFr<+BSjcl=z(u{ev5LxF1h
z#2D-d=1vEBxS5-%o)v}DbXrY*k`^BzXcbqC@AdbHKw5klIj9=OU9Ywn-`UgOcneBQ
zStY$B!moBFW7jv1XHvL}P)V;?b6t~cK3bhFpouf9te0dv7eLlH+USCZUX#jti8M8j
zh?3=i?hdDk?*_Ajrr<e@Ll{T_ET?gTLEA7k0Jk`MH|pb9mOW6Ay0CW36)s3>bXcPc
zoP%J}z*;30>&X<=!TvFJZdVM$APik8@tge@D>OY^`lEIMVmk@8gpt<6r-&fjEZ75(
zJ}%sugD#Nt{XyYyqQYtZ<75wT3o1tr1cgK2ULb_}h3Vp(Es!5Qy<nl2OOV^<E_8uD
zsn7~$*BS(gv|9KAz4H{6!;Nx`ugOkX0!M;f=e5E8L+(gK{cx?y7wFkcVvMX8e;Qko
zE|47P$+DN{H2U7H9jwhm1w~_)EPL&EoUx&!#_3SuT`Unn4xSKP%8BAdkr%p$B<l`7
zSC=7l<f}~{a9B9?n#>{_o7IE3CsNfBOwR_BtJV-n@#Ar?$_7hTSPvdo9weROEc|Rv
z#p!w^d0)0&J1qg@c1D%rSo+{Mk&aylj;ys&q^!=?KTg)XJTDg3F#IvAP=h`^PV%c^
zLTRCHYZYYcAULzd$DKi1M<_W!ww@01@b>{A`_t_UWb2Wj%=LT?PmpMm`5$Gk;+dTk
z*9nP$FOV%mAQs>6w0!jRkI+$IZ2f|10gF|*2?F097<=iF^rHN4EUW)Gg=_l(;7S9S
z?<<RULxriwE~bM_x(Qm=i+!~ze+N*XdOEZuEcCQbkOa9V{v@3UvfAZ)@cbl#7hzX`
zYcUAIuH;k{?|-omE@@fv({};l7*<OWawUD0@qMYUOK^nV6;?K3I#@!RmF=6ha%jbA
zW6k|hzok<kczNs7xe`13BY*2if#S8#F*4)jY%?BQ-@8r>LG#L7^e9%?+vjEsG(d7j
zRyYvY=6Tr6!u3s`=uo|4*^6P@8MT*Q>svWTWhF6(a|7_%?;)xFk$airvLaN_@HckT
z;@hnx>0AGz&Fa>J+^n|%r;inl`5c?I&LBuOUmU!ZTwgDRH`zUDB<mXb$GLJRvI%1L
z=>ole?30c8A^3Xfg1Ad=HS0-Ga&bHV%P(Rd#HT-#$qQShcHZU>HVOGF`~5p}I-}!B
z^ervWZkaT)CbKd2*r&EYuf%`~=R8b+ylF4ebZG<kSubtWJbw^;;;AKRE5O@64@g|#
z${M|LeHpb7z`R=tl`IsPmFw%30B!rrOK>Y*r*eJi*h9Fr)_8mjKC*}#nad~04h_t6
z910O`5GQZOKz<H1FwZ(JURA7=>)L(1E^HuRvpEp+=dG8DvY`)DC}1A@%$W`yDE7Na
zC3z4+0E=JRc!>3vv9mBhdv(!>G19UF(<w~<pQ7$RzOEfhVi<&7$@zh~|HalgJCf3<
zn~Ill2u4VN8iBj6eB@yACeUdM1N^IjyDpf;P~EuvBMh+DASkfe-G#v*%kJZb`tIEn
z7_bf>Om@2X_z?z#H3Dz#33t4{DlkW2BmJ~S;H@FD{e=rkcM*6-qCkOlqQ$5-uGCc(
zmlZ%3D6rOE$^}@EDs7bhSR3%ymHKk9+%5Ix&82%I@Ym~A)BW%6C<@WmZ+{>Ru5ZTr
zTmNwim0sRO;Hy2P2z{3|rq0N#!=EX9HQ%jizm3TsaBa0C1?sD9JYpji(uRcy1?Fr0
z8?M#P-sz+W-4-wFps!ZZM#fNpZV9Ub?X@1{LR9SbWu4BP(;o?4wV0J;P4<Itly6@!
zNUtU?G=+^1lWt7}LlMW;uSDQH6yp#7XOeSj1Eu!X357y@f2!Qzo`auExBq`2zJCyz
z%5~rJASnaMeJ!_6scTVonRz5=s>b*h{uQ{cJnoVK&kGhP#!qhqm}@LVak4*H%Ac<k
z+SnlCTGthW^Q5qL)9ChCPnKZ^n}6oTJ%zj0V0{%lSM|0oe0n28>F?U59%Ch7<>4sQ
zE@O^TU=168j9mee#2^U!l2)tc{~tT(&L-T<O|Bnc)FK4~$zL|MY@AE7x+s<3%HCAJ
zpCc=s#M!&|UUB&CcLUlO#a**F=%q9tHm?DJE@Ychv7%Zl83?VL5a$Y~+Y+yiI--}R
z|M~Qj87qvgIgG+@JeqR7EbqtmYZ=Nqp|xCHVhv9<Y}>dY881LtNpjzA6o}Ukn_)=2
z7(-Vu^2fb@t;Gh}v5E$95jbzBoJ-tK`$~WzCF7=twpa_8@nwDgP!$_1jI+B*u_;dX
zkt5YwY;PPyf4J7o2d?-rYg97}{O0|?&>u$jPS5=Sz^d<IH#DU^H>Asx(jHY3cy6Ee
z5%Y@cbR@m<V0drqdl2&qUpXSvN6KZ_`rck=VqQprM$!6T3QzyS@F3`g<b)%|OC07s
zYiaI34})!vd641d3=Q=@;{(>lmW{^uq!o^@BgywFZ-lXSl=3ekBXlG=KH!Zo*k%~x
zZely@u9dlUHiBN^FygCOIgy07SU!k)#RWJbAYHx93gvqn^4CiZEDN`2r?0l{TLp-D
z;nN%cWu}B?ArgbPCg`lQpuEXU*<W|;gNRqSZBZ<WG8z?vw~xXg;uXhxiD><Yv2#my
z7zSbJmf{zfo!#YMoX#NmN9_X2q&7*c96&QQ<6?ZSx3{u&b=ZvLAAn=gS9~5tymB+l
zX?{tgD|s~3j3QpK$UDip8=DoH#AZ>%D_3V>=6gT2bw7*hVqUq~;XJr%v8dKDDqA0S
zOybHz0t)}*0~th+O4rjmHxQ)3C^-*zvNAjhdF|X{ctGYUG+0=>Ue`+4wNbB|E4g`Y
zyk_4~$Sb$0RWpR8@>=mL`;J0hacVFr$guG%`;H=B8RVH{I|irGS6Ry#K}!OUg5KZ&
z`zmYsKyu_O#_`)JDPUnOiA*@sbsKKs-sfdHrdOnBSKh({8+@9{7b$D~!YSAlXND`D
zNMlhIv<y(W+MWE0P9u3IT`k*XqBz%1jZx|#ufjU(YW)^3%(YLaH-f}4X6N!5P>}0%
zRN;hmY|t9lr|Teqv(#c@Hk}rA+R{q`HaiDS0^VYD($%tcJT_>-GjZ&EX1lPr{{C8o
z>wI#ZWSHLIIl4dXRw76xYyJ=ejGJBk&EZ-V7vMU5jIhXT9^)!c*Wbp9aAlO{h_atc
z7QgaEL|KSJ;~!h>3w*mQ=6-#s|Na@fmRtv75O$?N5<>2Ou@|Ol?Af?)*OjGa5I=+Y
zqCi~ToAtqa->Kha(Lci3&q@!H_r7(f4lGv=43^JqyK`kcbZZJUSF!idG+QhDRgFsX
z2hSCsEtM;v!sF>bq8E6s68@q%+Q$DW>kXo7V2`~tSko9pPEc<!U3Eh#@V2CRUA(up
zIdEN7>?CQ4`+I0#rWatlO2*qDIZA^cRTpcw0J`f$&xxqseI*yhDLoYUu5Jq{<XG#q
zQvc&w63zuVSM$jg?a*w<rMqfL^R{A2S_$LaMI;J?JJF>9WRg#4c5~UMEOrTE06{RE
zX2`0~?@*rqfRMk%8H&0sfSrmHu0x3j9TfOm59sw~db}$1B|*sD`U=whSzMs&Hz8*m
zxA9&LZa3o2-6RP4+PFQ{+Be=%8kn9M1g`dT3-_xFgL$WC!9OJk87#>Mt&Wq^r$SFv
zC5+Z!vAB0P*4WMy`!2tYk-=gMuI5Z4xXhmt1O{u+fi1~K;~G8X7dA531y%ECPg4i%
zxwLxg^l`3FI-$nA^PIfI7=!_(>&Rg0TtCRQ*4U&lRr2{fC4a5;kFjgPu^<FtS5iRK
z`(JF~y$$Uo8+I;0j3U1R{aXmMHDZB!8gteC5<9msp{)YmqObz^Hy`Z0l|jmCisv;!
zhwYqlTa7Q!D^fJ<hKgHYPH}H9q%g1SYn&jTkg38m^{s{obalY@<sfN|ChBU@W*dS+
z!CHom>gmE>qVI{+myj>5=&z8AituNcz4bSOLV;koB!mE<)pL6j0L&|5cq2k#Sq}id
z{k?#^d<zyDMo7(+m;TS&piYo2h9rb3FWaHHZ@^oMR`%JFVv&V-tF6Gi{2*GhB>y@u
z3k8|4;v`pTAMS(wuZ7@k0P~9T(>h$`M*Dsc-G;)p&IOuR`xd)_pSQ0A#4DWcVb)sZ
zL|<B4Qh-;oTvmHi?(d@tjE>%xD0LLvN=Vn(Q@BUIm*L!0RPj-6+L$k!<U<IWwP>?V
zq+Lgxo8;TCqiELJmzjB{T~74dPpoLx+Ga#mB+#`?^xHcrr0X2=d}}WsoakGt^@ViZ
zoW3d2irfjkc$)pRehWxf>Wo2(@gg(7(taL5T{$V|B<0v+n!UYSU|lw0WHkb5<1KOC
zN3a09B2(O8txO;C!`QhcIS_(SbW8GRh5c`Az)W$;59tk99Yq2jxO4)p^S5jqkz<Yx
zorijDy4ZLNi+4qePKKF?5efKLANpwh1-vY!zu?~(!PZUD_k2dM+$IXj`wLymY%K-6
zA{sJ*yY@}rY4K>eMZB`?y2U6T{#7aZnuFn|y%ree>Vy}N*HUx39y}N9184h)KCQf9
z(;T@K_)3)y{Gzyftxn$P=xDh`zAWeP8hm!2P?CbO^BIBDvNwrscha7ukN-hHU(&>?
zB7$YvJxQNW$Qm&|m`=LkaDVCEWn)+Y@Us}w@Y^At_oJ*lJD6$_gHO1nl>Cle>jL=_
z^3q<Gtf1CjRX$!qps&>EE=Bho)omR+&tD=a&w=<B=Ubw7>^vUM)>b=JH38uz@xpZz
z(((2HebI+4{0p%YG)6Bp9xo5jR~UV@(ZwRWi^Va`i<H6U;owUS4E83Z^Tw9J-X5q@
z%J=ma8tVf3TFuh3a*AFuV_hI$w5Vbx#sgU_;W`=`z!&kVx1iidpb=u0@$Lb9Wmj@7
zV%%!EQ|4{l)B<1T4ox$@&hcg2b}UlX8XHm^FBWM{=(Eh5W?1yc*tI1)6oRlViEsA5
zu?y{75`QvXK$&_JC4@ks$yQBhQ)luNgv(<F>MLCXGbW7cW504gVS_TU8=kjfe-{H%
z854l|>V!1Xm0{$5yU_|G2nl>v>*XGi#X>}Un$FXK`ik(i%0Y8rz@Z9R*>_<!P+x8+
zE{gck2kXc6<`ngHoyg5J@*vV7uQW)zd_XImMvP0`b%X<HSHPyq_Vs}wh#v}F`VEv_
z2__u_H@rO@x?au3A3^BYbEqfxd2{JFAiXjThU;kU&hqgt?~;qV)iG`+4%+sgkueFo
z_L&%$*_{gZwR$}BKA^xs;f+i%Ek?%DhB1wfiRoig0;QP_>p^$rgNcEgw%7g{8H4W1
zzOl8M+vu@K3S2J-Y?l!TOg*hJGL{<*vMX+~fuz!?8~Ou`rQd++x`y`A@jEY)Hi5B@
zvA}fo08IbiHQAu{2)}hI2hy&1;wmc~R**pX0Arn1g0^e4b;-&+PvdhLjT_WmgL;eR
zn~8Zh$$(2>Y>;=wnJuQ*Vz1^S{hrbYi4j{#^DSE@a(#I_+R7kew5nPoe4d>?%al%N
z(07IBRx4^d7n!AOI5&x-{bTG3Y$S$3*e*XoO(0G7U+m#~!bEz}TL2{-p$9hRKPyHu
zi=<b?%iDvc-tL-JaK!6U;a4NL*@xiVY>gzPJ4EF&MaKBes&)R0TawZp{~lQ|c{zQ|
zY`>f(Dc$Q)3j0`5yAG;*+vq}~UT&q_sJ_I&;#+JKpk#qctwqZoxhV9lKMExa?q#$x
z2P#J$FIG5>VDo09YZGvKh5*e#GQZH<XhF%hWqEY$ZK_y&AGjR%ib6c!P-y=g^7j2n
zCP$^OENZ<zXItoxqu&2OOt^L>+zT7E<6wLD*CChd*7Pi*vctCsI6y9!SNcXHs0#OO
zO^ZaomPdDSiI&#KY^nbWVXECV)h=eqz|UG34jlN}kDA(J#N$<V?G?0cP4vriie#}7
zOxwzHw-=Xaky6Rq3|)10yuS;B^;yRBaq6=C!xRK{Z9jv;!5QPeTf~f#RQS8U3+HC$
zW}J!OfWOh7WR<*@qz`vC#k<_dkoN5*_H`G{p6H!Y^KQ)k9D~c}20Lti6PXA8-3II6
zj#^VbUyONujeld56}819@lE|!B~FpZ*FCXw5*{IyjW5A#aMH`Ymu+FhW|aB!%h<VH
zK@5UGv?U%Q(tl$s*{nl;*fhW~iWq^pmP|qGBoKPduSokgvLHYGSG;D(yqroLq41Jz
z=res>L|zsc$M#jA*-X{j9|CB+NcnVxa=u2YwTj-aFCcNEiWsmWO1FKxG6iXvZzG);
z;OK@+PzAL!QuJMcEG(r`x^VL%sNH&}>gDzY#@tr+a_e}BgdcpWUY^VaEmkDnGU2zC
z<FE!!PrlO*KK9=_Is<EHPG#qi%Udb?U~mmhK~kb@ijDb_3O^WN!#tbd_pDJ{?ydI~
z1X#XKxL-I~<~8Ne+BhzYHYaAqw_Lco_VfhRFjoU<DVh98IJAKPSi>tpfE>)24=sB?
z5`m~5Y>pk991Z6GG7b!^;aw%WjqK}F)TaA(T7fmR5~RhPYUlnOy^-RtitEMRi#T&)
zt^POK@INqdixhX3*R^;y2ob~=Mq<j3ltVwUfNd4{Gg+#&R?Rs?|3L@0wJ+tzQ})p{
zB<e+<`ppBhVLlt_Fr!*!@zNF{_|&`R-KzPsvgnz0=%fCrc+Cq4cg#$lT4n9h-*zU5
z$2;s}GzsB<2;18V&xf%yI%60Ff$&Na6Ttl!E7<l9UuYNbvz8FU9Y3N47H4<@;$Bkd
zcVf?ILq^GvwHt1fNKRIp$)*3Qh3XY=!-s{Gr=V1}!Jw_&i4uC8a17KyB7F1^<lB@D
z-AnyOe^X9>9P8lR_oss3_4qPJ!u3^##%IN#|4@MRl}|K_I#~y;g_POa^#tly+MRj#
zT5f*8@2verM)Glz?!T#Fluo#Pxc$wkP!4UPpY@81VD%|zZ@3jJ?BgO$%Cg!V|KrsR
z1uPqBsHI1ansOKn`okq&-pLD&^W5414F>HRh}#G(7)kOR+zv*4`!thrnD{;>x_ISk
zbr`JvXba@<fi9RWBI;iI0NP(f$f3KV0ywgy2}ASPLtNU;6w2Xk!h_Mb0roFs{=1>>
z3-2$BJd?xPcOj$=e<)#^nD@n1Y}AH=AJ+v)VQG;=T1Y6-U3?RI{n$&Hi!dOoN1n-%
z%3MWT8;C#+i>Gbzg1b#nvzAoa6a_g<udAL*juSZ${{3DMyXjIh?uFA#cU7hTpGiWt
z0XaI&p>z1Z1`Jt5Av;HZj+}XQPTFgK5HvCUFycO|_?t}5qDY%u7WtevAt1Z2mDQ$<
z>Ne;&@oP;P+{=rxD>0H724O7${-FQH4m)><%*_xNuuRqu1__Xd?W^Zfj`Gk!^2;9|
zT<Og%qdlA-)yl$3Ohoo1E{fQx4dMi^SnU>q7~4JB*@*H?btN@-6U5jVdEKxosqfH@
ztdD&TC7Sgpy#HG9Z|Qc6(io({3GEUdSV|hK_tj${(EZX0{b~OcQmo3yjK40yiw#YS
z(mLAf4p39ufP@mW;5L&<7Vay_LLunXEyH=!om$y#zk^UuRssX}<bN$|m+F082ntHw
zkkQx{v}vipq^y|}f}DM~iDS!8N%vjPg9I-&_B#P9L}Yw9cJLVo`e&s@LkfBDgBa>m
zcGT+<2X}|L4OR^59;ddWx<eAY*w|SZ{1eUGvQTRSxE02?0AbwgBBHsvqdYG`jCm&B
z4Hv-Qf{duuHNBG5zW`>__5*Lgrv5{4xM^JOakyl+pp67E=0B2@S?L%r(5BpHhQrk;
z|Mq0o-bEtii3?tA@}QPjAc#jF%%(P?Nt`W!AJ3CCRf}~SwULMu8YdQLjlLvdHd=by
zAjamNT@52fE%#59V6+G%l(@zF&buLFT@Fg<B1w|wwZnpGw>roFF>F7KT|u_QAPBpX
zB38Wr#XgL$1ULCz&W6`A1tS4+85s~d&KdkBR<?TlN;cGn7O~{)18NRX_T42yF|r6W
zmkrw%TFgIQrIt?X5+aZY--aNRxdHos0~AW*CmFKPzs)**n9*8=@*5t18fe*`v9;IC
z>UD<%mn(KNnQ%R^C|n#r^M7&-*7?UfAQ5W2<n1ZgEFKCERM`5ocDz!-)i)1VyB0g2
z_#u*H*^Kz_poZEle4yM4;DSM9yVo_?r{F?kX%x6HH`pPE-=h|PjHdqqxL_C?k7AE}
z6+Srpdb&kH5ZN{7(s?W;Wj6J!eSF&@pfGbvKh#KKg^*xHZ^gO26x{>v6kr8e;H%x{
zsIw)MB^Cu#SWC-cHfqDk;zuHcz<NiQV7yPe#0mKam#o=utXY74q+hZJv>+@BdD{VP
z&L(R<dwiWOkz~#Mii-VxZskZ?yjFN0rzC9_GxWJ!)WdnT(*Lq1Eh~sZ;ntptPi<=H
zUFnVcCDZOGa`!EEb(cw($2f#a;!OROx|L(Ctgejq6`C!RItxdaJDxvGTOZdWsw8`+
zk!E3~3lPJ<g%U~n%r9i4+##X?tH>^Lu2v3z_Q%+j9a#*6u$J%@aQ}_1Np>XVhr9+D
z#=#CqAf8cpHj!oC9<sb~epDhL(6WV*oXA*@1kP_QC>;!1_O=mlOw3*+4ri}p7Zh58
z!<$x4#wbWhH>-VN?D}R2of95xWyx)YwJ%)He3C=@lK1aYyrurq0V{5j{+~?F6>q7l
zB9Le~&}xd>M7-7*l(7pAEjPPvLWNDVEWacdkCg^1)C;zhk-A<=3gzK~LCX~!ywbV$
zJYJg&%FqRYcA~72DKc3fb&sypr!ry0t+BbrW4%UKYEKr71Oc&@OwmhAp+1z0Mx2=C
z`KQDf+6Pj9AH?nTXomk=8A}@;u9C9qV9(MB>Y`(0O6gmxE<TE6j}f<90u^v@Ybv`~
zjuv&WXCqrux<u^|$@}m+RKT9)uA45txUFB?Ksv~?oa=Tz30dOkK7u;?0eO~+fn6X=
zolpvE^{KE*v%u?glG7!j@&yPuYcydLr@KVTusUf0b9O2#+jL~_rGP*US31kH2o}FH
z_EbQi&icWeonO^9&PW(nUf+TWr42l^=Z0V=FB_0`A!O8X587;XrcS3oTyHp_JP~ka
zYe=7Ls!gbxLOv3Ij9pun#UKdVk|J8!|HcM7Ey17MZXoB>2a+ZL!FZ3WuWzv_?9gdz
z)d+2nrjnXjSpT!xOpI93W7Z#SI3=l>ISNXY9HqB@3?-n(BT3QBw`$=hdwk!XN8JeB
z=Tyz)dCnggPng>|Gm!7}1sF|Fw8L}-saij#RE9j3!Re~3cWH4vXb8d-#qhjCX6+#c
z9|VsY-^Gw5sN(ec#k5(uGbcnToW%sD1+uyO*=vyhib~-uSZ^uJk$$vb9DH@H#9J$c
zIkNLU274Ync`_upO;fG)WNFOxwHijO<hOl-`TFH4?I72fd~uQA3Z|ySWV^DsQQ*K)
zGUh%h-|K!Y6Y`>BgR`ns&ca=WEZLtV47|MgGhY`2%EXhnuP&!`g5AcE(wQIs4i>)0
zI-L`fg1jf!i4mssgl~53(ww1F3;{+*;$!+hAM{(%#z^TbdVUsLaIjvfv{xt!;_kZe
z%QCog#@!hDN0a1{(wS&^<l8{Bys0yV$dDVwe@ND)Ntqis8wbgNt7{ZDuZ;BR+ztc2
zJ$Yusrwx>Awpmb&?~Y+zcghdGu4~)Z*@4d6^T>+9?c)?0?HO*b1KHv~#;)zaVHkw1
zWRRcxFLt5r3FU`m0ougaF$hT=#LOZ{URta*yw#cj5wja2(`M@EKi1tKUKT%hWEW4*
zr@8W=<lcjTncGThNW0QxsA7fJk25kz&r$1*Epiik)PIBt8<HeLh$w5kls^RFvT%^k
zPPCyfdn<nk!e!p3<?i!+l4KBPc)5cKmwB7Qw{>v~`jqX}ISs;P!Pe-)R@!#6N+{ne
z;j&npL<+9c@t9QYCH4WrWic$p5obH$>8n-=<;Edg=APye9^F>FE!si2%-h;qrd5}W
zj?Y#WmLOPWK_f{<+gH==9RUP{%Kj%ye?i1`<&pmZ0%Z{-Yr<$A=vYFp(_}NqG^#>s
z(tpbSI!g{?oLrnMwbBvik^KQ8WFbDE$1A=K;H>(~EFnJT;T<7plJ}dDVR;Y`9`lf)
zb0MU4m0~Q5eh?iCwWdsy>x$jghOqvG5*&-cB-wr#k|t=o4#IvHTB>G;Op%y7HtY3^
zWxoq6N1bf1b#8tM^%Aq)6{ZM0978^Es8~dqu*AkNdUl6`B%DKJQTEqCvfVXhSUe=~
zkJSD3N2h1E3!a73bz2`w-H>+iA7f{LBrymA!7mA@G5`PANp^1rudZhI1C}w0K+Evo
zAip~{AHGo)XuGqsR~bc#Is$0S(znOU>NaQ9d6?Rr1{up}c9lU!6;U+TGwJ*u#$Mh!
zg;t(70Q$-R7|Z*XQaXv?;|TfXK?WGJ9V!5T?oo;?-cuDK4L-n_ji7FBLJvOFNa2+a
z>jFDF7DM%vX(hN{ZrZy57xQ!?qHdO}ibd#q16*wT)JDNGZ!wQX2XeCv#$Lvblm2d-
zPO%6Hx&v4&#ith4j@<v0TgcNq=*$i;l1XF5p*SIb5UAKTi<4`+4S7FQA+?(VD&{L;
z0G4ImzP_#>iNTcDDAgAJl8Gj{zw}(-(B8{X%i>n@&QI<^hdrcX&r>TJ?Xa4AxO7ko
zDwYWb>V@t7-m6-K{vbfHEX1T9oUOJFaxb^sq`@`jFFbAD^{rY&fQfD2n(eYYrF;)n
zNO^>S#J1fZtYq~2>Qxm|`x!uDmPU@}u%G=B^h987n>#mcsn`2hl@I`8dqD<mZ5Emx
ztX=<LnA+CYD5a`3@9?20A;7~@%YYh}?bZ97!M-#p;9>1)M~G3fq_To`ITPTpmNC-a
zGe3-7(G|oX2wTaDC%FG&2WOkmAI=4MR*?e1<S`<4Sq9omhXowg;^if|6o)mnT=19I
z7<gEW^(t!h9^~ngA@X`H0xL6tE}s2d>l7gu;9;J)PSM0KDKm=|l>K}GAQpX`&ms+J
z8&{SZ__Mi>+qTeMCsm%B&R4Bn`YkZAW_=Ie-Bx@nPIU?03LLk!{5-l(IBpE_*C~QB
z&~C2i&F$mA6jGSQ41a0F7-$!tq)Di>jYGNxF~(VA(@kPrX{3t14%UFhn#QOg4%rLK
zaph{eJRYE8O+%9!Hz-I^Gellza6rYv3N!T^(>QwtAi%`jh*1%yn|ohgN*SDtPW$mg
zCXMgM=Ba9d01xw(EMvsB#b3v-;4Y0AVpGh+DrptRTehJ7p2etQd|uS&*7!Vw*#&5r
z=fft6cubOD;}&f%jIiO=*&^yeK%2_;dJtL`8(uN(jGa}rSH)eP&tk)C@cwvsOQALf
z?@ONr66UFiCSJIaxn9StzXmC-NAAhPv5}c9YSLL*L==p(Rc<lOFZ`Rk7r<a$_6xix
zp{4l2PoS`jOF+R|(E1|L_nX;!&x7}MOaTnmp1#LzMp$%2#r<Md{4#bWw*kX2Y$YFz
zo$S9@#k3&hK7=eFIF6u;GWp*M1cNoIm@DRojXe&6#&S#x0bz}Du)<AQX6&QuF4@>1
zEUZzVDzSO?HD?wnEMY7N4C4(qc})E4dyl+%zv{bDWlQQxXR<z1hZ(V@+?a>ZFuwUR
z9X;dYf!CK|8v?{Av?X+VMj>^m7nJ+u5Fi#s$s^1&+VOTDItsNB6$yJx^+3@`uj^b5
zufIoC!gg^>BHMm+%w>j$0I?{io0_1=(uouxI_6%^I3Yx=GivKBNg?gM+A@PckXR>)
zy9<`N5{o8D4(g*!&#_yQ5oxE=;axHf!=M=HL7Z0?c3yVBYmXBu*21ftiMZ(dxnYK2
zF;>=(hNWC)JNOl!`f|6A@~g}8XT^G4Z^vBUio!03ze>+|UwV8c7C?8@WgxKXQ@`i<
z$}E84sLOpe3wvD?{i~J&hJ)@HQzTJbJ)EBj5-}We!{w~Hk(sGqdB4(#BJN8lYU1Mj
zf}V|Y{Xwvm$4kfLmgvY>`!226aj#`j20E_sX>u*rXR+t<$(H3+en)3+!0R6^&y8XZ
zs@a(^S8l+|9Rvs>YvX|mWnv<@vbID0LG;`o#;z?}Vi1Jw<*vX7pxyt*E{q*Qe=^+w
zM=M1nklaf#%<B31K)dGW`&$wu^N=)9M-x4#hX*({(qW_<zKV{~N2LUyQ6W*X7@bj&
zWqV)~dr1i(iITOD%7C^|R4DdaN&rciES7>vrx-)b*b=1x`VS>c)`p$r;47lDTGe<E
zzM=G6|ABFxNl-78r3l{-+&1R<p^-TZIuF(sEoe&uWu9Ivkn2YKT$^vzB4pxirpq$Q
zMJ0Sz>P2QlPzSR@iLRamj>j-R{S5_f>t_P(!7Yz5{ENQLMBuhMEx~HpMMvlJjHj8h
zz;8o*dloDGAz?^QNZ_{$)&|co`mX$qJPQ*o8|omwFP&$fQGRNpcx~2<qP}=tb&j8!
zfY0g~F}jzbR$BkB@#Bl^5)Y&V6<b^1YCTB8WL@^c;S5{5LhsaP6C~^YRr3~$THLGx
zhTLTnB=a<&-tAQ^vvr;bCPWsj{qWb`C-_0`CK6&KGh3S@I}5+P1L(KsM)E=CZ;g$M
z{ct5frh#uqu@XouOgn^NC<JgL0Cq3%y3ZIZTorleMv&HeUYnBS8VUZh<(@kV65G*c
zLc4CJ*{&`3W`F;TU5O3EFbG>IFC_afc5zR_L^}DpK-8uU!PpqJ3^QA(q<UJWX0d$J
zq1Kq%*1ppe``s?nM5%xo#?%%i#?A?m%)TD}U0<n|a$B#_uLYYktCwk_ybcpjW)#aG
z*i1v2hxOLQ4H9Lot<AabWv*LtFGGtZVFKrT0m5f#`O;21gJc<oTyfIgnzLRkvEJUO
zCm@TALk+LqYn7@0m?$U=XA8`LNa{lI`d9~Fh8`Y<%T>r2JemR>xSc__q&I?{<jR_R
zeK|X$F1=vJ{I;?r6fZY7_%ir_G3>TM$M}c#*3}yFWd|&@*p~^5hW55)eULCi`x<A_
z?=+e8uUp|DVFuB4AdtD1Q=@+HK+(@aV76zEICWsesuzxzzl*1mf_sQ+&MI}T*Err8
zdadx1Hptv&#_{q11Y=g9osS>J;Ea@J6zKWQBPcV_kK7iF!)=-WmYW-#S;1u7_|OLg
z(5&t0HJ3@$N@d)W$HcZ&Pb~V_e;%c$Yt7TO*1FfXH2NTC1~ZqSyR3hWYYF4!fhK8o
zvY{I3i=p>68w3{pESA1A$q?&M$z>j0o@ml$vv!WpGfbDhH1EF_`7m~E$rghkY)d`>
z>;5-(LFW?u$(#*jYKxVa00{yOVyh-gwBTm;tBx*^&0^|n8c0k^HFVH;x`#I6c177^
zg1ji4#&6^cYq#`qg_}8#qT#1C|IMXr7TuXgCS(>x6;>5}x)D=1i-yy1&pXOP<Ea!c
zshhRvW|NFHT&rlksJjpTC?#%T2DAAMtVidhmS)+-#3-pVIjPdp1AaHot5P}ZbAURV
zQ>-#6!1%0gN#(4E5g;SQbLZklj)pZ9B!l*R<9sR69`Nzcv-K!+vzQzySkOWP_oL_=
zMd?7fQ%e3(=0m`#P^(bQ{7}b;U<<#|Bk2!{g0S_BI9t+t!dpn|x2WM&8^Sgwn;}@V
z+TW?9uPK=MgXk==QrZy*k*DNJ8-BL78_vV9qyKE8*Hp|RcSKiXlcIv0v5kwOAj93m
z%DDS))rNeH#|jeMIg!Y%J9`cH0rdMoF;g)xPP6vRZR8&rg4t~#elh$>tUB@O-Jn7*
zi{X`dHRz{)G5ClX2blm#2q%arxw_tMf*|;#NE*R>g^KEv<0Gdaa4&v}L?w1(?Z!9x
zT3}yX=+3$97Q^E%p!4;>zo;mJJ}77F{4sWI*%E^wY)d|h*!^$p!gMCVpWH5>oT}79
zLI6;Jyb3z&z-&N>mR9Zq3D934sIvG8Q&^B)`q%sM2?nYxBG4NrlpU#tRUkkXm>Q_E
zjAK!f8CK|SPa(cs(O^oJRk!%DKShzm0krE6daYqWDTr?G3$$$z3X6DzR{G_Bj4aUG
z0?+j_ZggcfeNIo%3xezVwfS5A?oojOr0Y^l=A~I^gxFw2pSE?{TS{?4O<$f_DWwu$
z8iC`+2Z!%DvX`P|$%dnnZ#K%wBC2L=+-5Js6C!1m;D~`LOBBEgfK}clQ2?oCvB_$2
zBdG1ZT03<2+Q?*~H?!0<!h9?fGP$?&DkbL*8*T5(<Zr#Rguvp0$5pwV?KwZ)=Hwj*
zp6oOE&S+%y%Ht1xI?h_x8<IiaR3HC0DbXfl+Od&{`Mqnd98tgCk((hpf$?~V)5$&*
zzC0R`WRc)5q%E;7syUOwm&uP&O_uGve><|jjho)F=0-8u)w&lWhtPdAZ3ONbfhahb
zY%kkh7p)t`WZCT$Mn;=Qt}WHnMlIQu>NOf!2W39>n-H=69ZlkGt=B|b8c1LLW9-U~
zECyj%OI!k{|Hc+4ZzN|wOd9aO1Oi6a@3B@ejx+1xC=N@+bn0}v`&ch>uDr$N>53OP
zh6|dE=h=?0gm(mVY=}T(uD`<9_85|oH8gfSo`Y5FYcL?BAZri7>Q|%+W4kTk@{y2h
z>m0bj#X59^IzF9WPXv#x3YuovaDH`cZ1W<5$F9kv!aTD#cBJWo7dkdC@Iv4<UPkkI
zR|}C9jmXWOOpP9FhXw%_&R}9u_SmknrA;9LNH{hX4(ho-QO}*yDInR{7;?L}{Z9$R
z@I1^9Q@rpZ(~W&?v$v^xx__s5;e9Z<XgRZ@f0c8CXxKhC^%L;a#elOPlK3!3u&K}+
z*%dQaPbO|47Uq5*G%=WlRwKFm@NwjXV6qXNYw7XiPU1^10z$%8gXuahQsAxT&OeS`
z2_|{M{`NS;Ex%UY-xCFE!-VTyr7D~7?jlo$I#$r<D$jaX2`!3q!fU#LiGuCjAvbof
z5=q#rrNVL$25a7by=D|e;a2k*byX=uaGxZ3vdZ&tUJwLpo@vIv+Fl#wMJhkcCx{t(
zxbL-~!*;|u^#H+&Y6f<q%M&?Xe&hd#^2gW}Wl0Qzuq$a%g!^A?W!p_~KWHz&V+OQf
zNH~pv&9Ey&9G|tj;&$|qt9HexJe4jco&VO}y(9}oy&9J-?%u*z|GYeJ0s{*Y99|su
z5$799ARKiMX^B|gFoqW!Lyy_?8r7cEQ{2HsxfQ6>F%T|w!DXo~;LO01mPj7M?#b%H
zN*V}X5SxfK1pOEY*ZO~%43STsA&xjk52^L<LEeU}{D6&n9WHyw+7afh45K63*>=S^
zcpV?4?LLNhK=F7NU0+e;Y1H-V(5Ckws~kOK862|4Gzq!y{2IM~)hnN5jhQx77_lg{
zA6;ba2~yVX>DtGLG#ME|F3TlP0-$_R-HpmcQSKN7uRR$Q4shBqu>-R$V?)-MFToY*
z*DX=Z$?Mt?<m*F5d5q}F3gczA0{N2Qvi@E8E`y3dzi@3GUuqyULA&F@x;dt<>(D@R
zrVT0rxm;<f`y1<70eneJYSI&5ne$wJjTNw$1hXC~KSC5McYw1ra#0q7%3!-)n+e-|
z5d~L(Ub6H87HCnGXzl=4X=KpI1gK&@uc==}!L?B&$tdFMV=O!5ylYP=lBAC3Pmhc0
zHuA&R6&+a+g0PlUG;05i9o)?&><_yQFuoOehG6mz-ayJLW}cL<k%M`#xJ)&W@$yZS
z4tG2TSr1QlltGxUk(TL`w5O_9nQLUc%;r&=M3ZTJ)$#@zFSB6B7{s!``6%%$$aq=k
zGEbepX~-aOmO+@WEosDf9q1#!Q!XJsx<tLYhT%hJJu`_llmtmHKf`URV}bh}N`j<U
zNV^E1JCsZ=a4%32T?Mucb_+ud?>zX(^7xVR^4(cm9n{v&_{v8@vWXXZF}KfZ&AtkP
zW2F1Q&?R>7#D4p3m)$~0HZh!^^i8t#0ajgL$#%ty!Ye|?B*^c@c9m^*knHjzs^>y0
zxkA2&V7ewX6~D$W_1DfU`}82s6~=A69(jJ6bl(E-*Xy7=)B1B4{~sLR;=SL4$UFD4
z0TX%`X=7$>%MFrTu=Ic9b?_$lw^e)If+Uw0;nDQE|6C1#oqbD40CHRirmQQ-u&jVz
z-zX%RC_lXA*EFc}dCsoap&snj9NG#?rTKjw!dj4oa>$8sAv+YC$`}$*PE*L3377wF
zP5o=+C3e+l2t=*kwr@>Ir$Sz0o|GKH{GsfMjw^;i*h(=rVD?|EIK8vfAHCNFbO{iG
zEf5)<(foUpBo+(cpVg(3{lg@<A4s~Y=+p{T+ao?ALmqO8M(Zd~)yXojTH8G!muMSB
zr$HmM|9LSq1Qi0<msN{LVTL|5#$~tWNf&-GVooIZ`AAMFF1vL=a70>k^n5|2YZlGZ
zjKHmBOj=+uv;=d2-SVe4m>4rdTHN}!B*1RvW49Z7pDp2&Uq^!^gA{`d29e(lC@!nI
zcc0$JqDT%`nOrZ$bqYG8PLV+ZQzu@fj~zXRj-_>-Y9HGD@<GZud{A2-F4}XTc6~!u
zTGr8FNTg7-TL-&Gmz_Qd1eDH;;*26Q0Z1;#is-Hk7AF%qY#2_1wsi&g4kzIpu=3M!
z8dx-__??wBw65s4e?y?q%wmVhom$DtLaU=z(+tdi^@+R&rZ`D(|BZY7D8(qd2<4BD
zB}fo);3PgtDgdv0WRAt`SFR0JwG0n7tb`!du7z^G3lk^C?RN``K!IvkR}!~{^vqpB
z=IWziV-ZR)NPTbDTfd%m4BA#?IoYn-DE-VolwI3(#UKpZr4#T7Hf+}Mi<28k`EhO+
z@G)SBiIDVr{|Th1^b(1y*Rm(hwZvOJ!1_ng=j%(s?~6=$$CyLcCU0K>bnOFH#O3!%
zqT+5ZU4^TDGR<tmF4~8TC%*}cTUhIK5(z`gq612mQVclP?tA-WF7c24Q73sWU88h~
za=Ola*<1kW8quaz$|sSbUXIXT%yU5-8+>v`;eVvEuazx@A`L*-nBr0$zBA%56yK9H
zh|Bf?e|emeK_A?%^f~hwQ(_ddV-LPbI-}(K2QZiKsV#g7?g#!5#2d#W?@<7Ag<v-{
zX!ZtYZ@<^aYd$N$xjf{Jmqeka)G5!9?q=XzJC^|rB%q8!4)dE-gaPM@2dv<jgn~eQ
zj3|`=FyLIfn{~`fTz{C$7bDWTZG3TTgY^>cP(5EG6mAQKFGkeM@PEvU%e>&e5n6h(
ziT1pt<a-0wb>`BjYO7-A@3}0kI?AE-B`oNfE2Y?y(jC;~tcPIeubBYtGGCNKH+oT>
z4<*tFFd(13H9D;}liPkY=xMzH>)I_wqtR-uP5bloKv+C#8?feJtCJVCW7L!qXn?xL
z#WJ`pY%g^|HrDp@$Jn)HOALarEs0gZ{cr3-dnchk*bU^2W0glRsX$f&q3LCq3A{?m
z(pO}G?b0wOp$@GMTWNFZOCM~PdNN3lqI+^BZ%$dWY+kkd+O%rz7p-Tbda6JaY?t5H
zoXe9KLX*5bQi9;3osAl3A*M_<&QnZQ&|Lw7BtJkX?0!r}6?~Up&vb+HaAU9SDXUur
z-(`C>>eO4$`P=OE51GK=3~1<kUNh(CCB(v7B0WbeZEJol1r=nMXAu3O$VzXT*HS(b
zQ;=N_LTS;_C3$(YLsM5lc6ou_lRBO9`S$S)E6A<@p~{LpBADNfu!8I|ua6mvJruT_
zT9=%tg6-OK>gI!K*;)Fjo^n#KUE4!3hRIhS*{(&_;XfG!VN$TVtV9ph5|IkBYsW)5
zG|FVKQFiPsDaft>;SZ5Vu9qP7=72xgjW+HkkD}pkHT68Ig6xWu(@DF{omubN^Fl#(
znSb?6wnDDv)txH8dXQb_L5yUVNAKL7s-JQw$S(85IT3(DJ+0%#2(s(O7zyLuPc1Q!
z4h&lQ*#8g_&rQ9S-`9G-cID`cijA+0ZUx=tA(-7qPY327V^?&=KnTKCQc#i6x_zO2
zP3#Zn0=yIT1Of?>yEIa74FgyuM}8Plk;~}DfObupEV+k==U;GBF9yMDgqlJlN-DbN
z*Hip7vQHzo)p7&a6<2Mb^cXLXv-Y^GrZP2vT{%~e`}+wD*!fb|xlIYo`hovV?FYX=
z{n`NQ%3vBbm{<$-C{qZvOq7h`VEgDNiVb68{aH-8GZY7l{|Lq>Vq=_?+NoVr8)2K)
z)Pq7|j&)3f)RU&BRI6zY%zO>k=GT4&*tN}t+#GF_l5#Ec`k*<xSiN(=+LbPeyrpaf
zvcXcUHx5{*n3mEdyR1*!U>kvwQzncs`hD`qpjPNt_4|jaZsN>I4^Zy!VEeXoocL^a
z-|IZC<s%NXE9If_L(>$km-CR+UxMQrK}aXZ|L&^SE@79}<|Kdeq%d!MJR|_SMx@_(
zuq64pj}K|}KOSILws}**B%CaAy&C6-knJR;e;K4L9rXnU)HSom3Hlh3c@iXkyug6E
zW){0q=E!4wy*EI*a;%J^2gz>xcY#YAiZ{GXgjd;q#<8;J#V`;U44^fcgYOqJVdI-d
zyxxqR+m!?%2t-q|RY3DkY^|M{D!ynF@U)Lcpy2w=wwQ>&XELjv&F{1Z-U-@@DfU>`
zR~Ch?K=s~8ap%0YB-FVA&EjbcQ#AsJOy&JcnF|RCQPlu&*OIg{6&$XlfD1?qVwGUB
zzH48RA{Scbl};Xs0`PxE%IMXV6PWE00mB}@UR8=*$Z)7Y3tOsH^|}W#sBxhhMCh?_
z>({o38W+M}sl(^mQNhaVWO!El=S`&F82gE9TSScuk6k57SEP1bTg~eIWsTNsi``t&
zR)QAWTQES83q%G=hbOkSxo($)8keVrzsD?9TEAU2A-ftL$-8o~TYc6H&7i)8)+T`r
z(D)$>ziKXZP~JL&Oj>8#v+J$_@4mD}Qnz4(1*dbh$-<ea-ByZQz{W610v=%+!|UId
z+7<{RLtagepdm2TvtdHOyG@bDdwPTn>so(_PHT@POz?i%xVA>rw$2}>s{W~hB-oL%
z;w30-ol`y1lQyw;asyrr33aUxnBvO_K2eEmqSX(E2SqJAp8KQMRz7YQdkbE^L+OBF
zsZ?cb=@htq%k7n<)jYVppZZgNN4>e!vu5vqj9t;O1R)4(2~iOGZ|uq3Jd!W&8emps
zL5L*M71q0S2g%f#&CS+^vv%l)ypJna6W=xjFswn}zNQ*52~$TiUPl_s+Etf9m1K#o
zUoU8lWbIO2B_)Id27+?4(MTg%+sr`*UxSA@-k4v}-$t@tIU)Vyne4mP&uOB;tbIO{
z=>JBH{A`A|Z{j^6iGWzOXEw*8*~ozr36Of}w%=n>q9LF#@~VQ%v1rY`nuNQ0f)TIY
zHeHU-^K!bxT4}@}=k|NXYACD7LD5sViT-9Ktob{-!YVR8JSvXJ;Dj|@NTQJ}Q(}U5
z$Lo@}7}wdxLQC){kxs3|744%{H5ftnN`%;Zk;03=c8rSAFjnCvn3aDHPuliJzO3f-
z(JW$3lnt4rQ;cpo8fkA$`fZYA!jGK!GrYab@5W~&GfdbVS_4B{_d?snH2sjAyp6q$
zz|fZSVv58XMr35I4$N%5zpDYYS8wv;uAKF50yA5#N=AefDs|>n3XE)B$HU4OMr70B
zj>TeNWXqi{Xs(3Gz5Q6Tk@i*jRLTFdCrM-|I@5qfgIGm^fc*P1nX{|TJMwnnkFhJj
zwHO3pS5i=5_rKU5dkgK7AGQmSsSJ@)dgmju1$n?R=j0FRS5v6KF)$G6e&c-I)<Ol2
z4GzpuVxR4c%H5c#gjJ>vNag%Q6F>TUAy{V?1Lf+ii=;lz#k9dW3c)f}r}wjNqOh$#
zWsO3x_CeG9cDPdq@07O25`vzVK%vHlEq?^XHl6{)N>C32+FYH&^J+VIqd=@&fzh-@
zCvKpa^vkIiR*q2yy5K_yRqrvI5EKL)b;VSur1<Q8mv$72<wni#gM>C$QYU*GRlEvS
z2vOvu(aA>o)l~7yZEnz<Y%2nz^^!1AFxHt>65(o3>g7+aKzld^V>yNrsyL96%UxTa
zFBHpVuEFY>4^nM^QxuMs_-O4&O7qds;<rSga4gH3CYr?u4aJ>vc)ug%uKwfT+(woW
zAK-O4RS`J<w`u~GMA#>FlJvhYNL%|iG5K!7Cpnlrozb68zz8&*L@eU_JzhXo$|$ee
zSWUefA{w{j$D@F(oIOz3&*?K8*}&_cQ$W^A+9izG5^9T<(HjvM*>&lhMjl-tFK!Rw
zmK-b^kG3c6LAh9%LzL%%dmJy|D@6Zy2meuaCD{(bFziYh>goO$`|;yfG8;pe-K1cX
zU@TeUB2dRTf4%tiy8X6q`gkbi^Nfnr=ST7Hz9^2(A{29Rqw4s7gB9tOJ|uu$&qtjU
z*tH1XiAtXsRIaHm4`e>Avh?*aFRWaZ%<RMo>LSu|1ROY4HhuZ}^ciy7!0kI2Kvoj*
zSCM>OMLgkY0}E*a&Y4NG`nZ1ju`dUZB{?fv?xqw-kEg3}BvvPNt&Jo8c`ml|2ws4!
z%LNSWC%`so617*K9HIkStY{OXhL)1)^#{!=C<n%*Rs2qEGVq}76duusHi+*9fT*;T
z#U$IX(Q9To&@72HfSH_)M1f)RhucxsuOFJ}tW%@_GI<dcz*$+Ik?bxm##K&v&}JEU
zRx+Qoz~b|V^Z?J2HJsQwRST}<^cO-BR&uTI@(WWf$?2Ib4n%8540JkjZjpl#nVwb-
z!U1XJKshF3lk85<?iW#E>s3Asiw-M~{(P9+axI!!l<U~Z&Ybm*TGcGKqLN{QZQvdL
zL!K#7cust_=%aWh<rCMt)_ajCT(q^yQS8l3&($}QtWsPMmUG<ceUbi3iu?dw$j=w$
z*W&k&vMaH*7zSZ0H5bSJi~aCgVOL+G?E<JtNgx=TYj5j^BqR!Bf+4Id8p!ryZv}fR
z=$Soqf}|9CTN{D4i=gpG_UWVFtPi;?s9SBK`EMut3q+?E>w$U}1=L`m7|kJAWl7l*
z;ELMkLDC(g-%fLRf)e10(+pLHD7}90{lvI_l}mhzD?8jQr&gGu5F6d%neR-Wa{E8^
zu4Hvf6&JrQZR9G?3tD8QQBUIlS4u-Gy<U-U{6K@|a*Bt~-$LD40*%~xPKvp#_yb^O
z#M>Iwi9dZzI?iSf?&4SxrdNi_Cpld+Es-j7qzR`+@8vFM8Ru;vawG~YZZxdRhpWXY
zQJ~FjP30Dc%3CfGubt?Cau^y3lnzFSsuzUXfdVO(9sNOQd$AxC4@?r}m5}how?v9r
zzQ+>u`lY6LO7$flj!~jsJLMPP5z)q;w~NKF!}1t`!gchem<*>F)w|tA>nUgk4p$VI
zK`uRcX5_k6XmyadLZ_tzq>-t&_&iE0*;WuZlhddmjBnMTcC^w;w!!R&_kr0WP!u@g
zjwtU1PxxzREfauX>nJ8}D_#G)?jK`UfFnT&!oH*+D*yl3={jdS$)<N7APj-R2$YwU
z>$>~iFnU*Kg#G!TO-dS4N)Q><9f*xSj4P<>T1dwhq}_;K-d8A%)Cjo-nYRhHpPMka
zwJ%d4it^kY5mGP{yF3KT)iGe)kwf2#&)WxEIDqB%9YvF(sOZzqSuqw{no|dQQ1!n(
z*Q6A@Cm623EW7w%=+-CNv*JOaVVR>JJ|lpxgoQ*itS%D)7D`SsZndseLFe`ya(>4A
zlE|X_b5Ku632-HV0eJ7?cYhT?5?nxGI2x`auHPA>C|YTvYboQKF3l`FSeK^VWulcF
z6AX3ds>81?rO2njylt`dBZ6|-M=1n!=1l{g;n_CoeG*uO3)llsy&&ykl}8^EGgO7W
z&YNjnjDX>8yZCcaiGV@+?rn{|fWeu__aDH3-WUUeyCv-M0S1ZP*zo%F17H^$Nx;xu
z>+*u#t4ogzf5EPnGQOoWKLsVFH0iqFG~|@FgiILs@012o!#WMEcB8umJEQ4X1gRls
zv{ic%=fX~D8eN=Px<S+Gfeov&`OAxzf^wmuUT&MO<9?CvOG`4MZ<j27D7&^K2|^Hd
zC10rA|6*%qs}lAnQ+ol5ZWWP)u<;qvbGf?GCPYQOl~p=UxXh=h+%#mGR=_q1lR?;q
zRrU!^C%6B5QuN_nA!i19*a}f83NI#dH=ofFC`0R+hP|U$NMF!$=mQ;*vQGnB*MzoE
zjtVROb|qAX|58{{?eAZ4CIpm?b5-WRl%-uAv2>LbQubC^C8SaBv(GYnUq;<=%uq+o
zP_g6eG?OG&w%fj}*auqm8J{4uncm8(XNX3c@NT%0Ut9^H=6XVehQ&W~%`0Ih@v;ND
zt+a6S>In^cgRRcx5*wivBWEhcjrUjy|2bD(A6@kI{2emSxYE6mRJTQu{&^3@rVxjQ
zADjD!6k$Rw8yKXlT?_oo9zsH9ID(;0i7VO}ilE2VV3U{`=(6gHol_ikSlK>LAZP|5
z8|EyS3nVM=Oe{N5C<U9{c^I6|yU|BIL3#XtiK6^Nji+<_&i^dYE>MQ*a}euTC9-sX
z#fQS}86h#*!XCx;_iEo63b)y|)R|(JQ2BNL6FI|FwI+sASIAz=E9@qLvzaN<79@wa
zRw%w1VJ)}ckR!d7TNRPTmiSV0y<XzOp+b9?Rs#g>bAKqik|c+L5cVba;s(B!*AJ9E
zNOMtYa!yf>JH~((<N;x^SH2@K`5BM75z?(LpRn1h+}p@2gBH1dKOn63$~yTtvA`+g
z?xp>y1D1#T!BKuO2wMAF23B$k7038mjKmLn@wMpWLg?8AzwJ_2O|Im0Zh`G#e$gAO
z&1M=y%WObg|DXoX?(AbAVy?5DoO5+4XG~h`+5gNc4AbdM3R_Nu1G+HY1#-qkv$-&B
z@E6d9Rr&{mYYcP`mHs73C=4pb6OEGAt{VKH@=I|Y1v<tF#I`Iu7A2RZIfr3?YK0yM
z5E<nu6=V#q6gFbaWB*8%=4^ol+QfYsJ&E~|d5(+^7bdwYOT0rB`_yuoX!z{*1B-@A
z)M(@*re38Ojh~gLB<@Sx*WxI{bQH3X3+STlp+db;{OA>=0g>35!3`dmEhU`QcLi((
zTboS1U?QCFSgkh?pl4ZWJAyoGc0aGX>Xgi-Xz;AWUd_YGAl_q%vS^hIxd3*y=W4ua
zug914^X^}l{M2aVtc)<6wBleO7eiaRPK2W;J7>_@jK*2(_UP`TakD-6LFV?b#^ZVn
z(6HIgVx5#31`n(3rM~=OYe@XV*Og^E6oRlV;ef;bH};^m2|q6jXpR-UA_4Nt4%*~I
zkk?N0-IJx0<CpncpRD-n)HDwWE%bgtnZ>qFRQ!2%Yr;wLp{TbN?&^yJ<2}{8(HR+k
zQ<nVQTilftxJMwiX`8X8UP&3z$p>?Q92CiA8;%rxxuDBD>ziQU6TgFj$LUiWn8Cp@
zwj!LWcpVXh+7maBW%*@BGhsxS#vJl`+K~bT{yN5iiE}*OD1w`Js2*!Kc8bOEKzj0K
z;RcrSDH_#l8LZm<q;kF}mHzf~m!cd3g_OfJSUFH8Ih1UPQ6E`1V=L|+tD;bd)bEnh
z=-k*b*4MOx(izoyc!T13-N2U3?<}65jY?8*J+Tb|!l}sCF#<I^iuic%W2lsq8+*pu
zY2b>pv+|V8;ybSYqp)eL?L(>d=A9PmakVXt0?*BnToBk=WAh-!*Lq9GB~_LUf`<lT
z$8}0&b`1i*eX$iVaD>{EAQ2F7+Bp!3=ETqnF<oOgX+J6!#rw?gK+PelCfx)iS*l8H
zuB0{8LZ;Z}(i;MY4I`FmauJl^I(EPE0Foi|eT@t06HnZhH<8{F#0Ad#>qGqD*6^2(
z`yYe!n0HPryO|||hUrt#6&Uc<_%G!I`$73{iiKD9=8vyyF|Hs4fi0nY)czZb#21##
zyx9gAPB=h;-7iAQS62fMzKTdyO34>s^shl{EUyRwAzH(6Q;c%!xJ*oeCH^Wf`mDOT
z3H86ZCUDm?cLVx64k1CoAYCThHNc{{6k9k~28FV4sjk>Bm$Ub;De6$!i#rKM5fmtW
zCy_qNz&Gh^E(G{oZ``0ft)8ipOqH6ZT4FgQ5IEHdT%8-Bg`WtZ4|lW!0Zz#kF?kjS
z^5L?7c#<Hf^(jj00W`yI_yiSrzIId%n=_02K+wf?WZ>22Y_q24g$ZcBvT@M-y%A&G
zSfkXsp!vGF*dfFw=+kbX5UvTP6<yo0B2Q$$eQ-rEt2lsUp24UATE*m*02ao^(H5Oi
z*k~?3(x_;7-12prZ5jYf-u&o^R2M9_-%+UD%j5twkAzSsK@;rWXPPDt>*^z9Y;ItK
zyPjChzzy+eE}ke1D>$-SQIoXqK&F*LbGTszN4+WXMuh(siZ=g&Exw^pq=li$ky!j(
zfhxNusJoNp8HmoZg=+$TjTP<hI}K>}!FCcMZM0TfwlPd%YqAAV>v)@#!KHd<ixpc|
zgBQPTW$ZEFd}Iu3RAFlIL)f`pF${w+bS1yQX8*-%wGE;_>H<Eg8xw=zN^S{9#`?XR
zrhnQDABF!QhXSpo`ZZDf%4<0K&Ar-}$`5dgUw09s8{COHMfd0OYb0}=k)WWng7CD3
zMl<=%GIC_ttaCG@amv9N`gKj+%ipZgwCdYVg%cTd$T(nZkcnU#Yin}W3n{gZ^hV@?
zd#cA^v~z?9_yCuyr1EuF;noJw`(9FN>GJSt+<R8(e3VVDGcsy7`ObQ2kfGxkP^$Km
zQ6K$-*ibvkh!2!bybO2zIfTwegWk%vL}$+@*pfOk;M~}nR0OdRRK74&u3tJYrLCEY
z$Uz0q>AuuWe+E<e0)!|B41s}K#eODqd`saASNv@GIY`Esn8%Ww4Qr`<f$~U`bwsUd
zC)IR%pUM}Ivw2-Yg^U6M<b;r$yP0@(x|^RHc+akzt7FS%Lv1G_5<zo#Eqmw_y=Pe^
zVbOP$I7Rxktt%EOeR<(#!r#38R6X>Q5Q#WFX{3QXwU?^Ll;@dD#MNjB5U?lBB)@$C
z<6@D`MFw5cZ3JuX?F?P`AQKUDNO_uXyw6an-D9kgh<KM+jQmC`LzF#CzOrN@+9b*>
zzSv2YJ>>uUNM0|-uI)%-7=*QC{Dl4+JJ`LExF5|mz{E*xBLq?fxsO5oM6Y|eyxPHd
z<ug;W_G2W#Qb8HV%OD)P8O(NKV=k(y4f@M~?<zSKCg+*6VE$*8DV#h{z;|U3V{xpU
z@><E_U3n0I@2bO@n6@-HSSgtL8g$OvtcBi<n2y$s!uUEj2i=u1sH~U}ihT|rj4!ty
z=&qal3%v!g9!ID1I5J&M0^OBC&<vS7h6V0I`TFi^_FkJqlCh0bKh^iI3qfGJZgCe_
z&HPHs5$4Mc%o(w04Tw=SuIM;lKM8)<e3$rJYZmo2n6K{&4v6Lbjr=}V2eoz1>TkpO
zFeg~a6NrmBS7-OM_ZqE}zKDl;{*BPvY}k!SkCV)*DT-)w>cvDeN&#4jd7CKlu_gD7
zaWc&AfWc5*!9jr<b0v*>jP_m$0yjC3G5?r|N>0aU@0C!P|9t-PO%*L%(n~g|hE$Ce
z2;xm~He)RPPBw!q<b2g7*IeyfF9t0zMj!5yCZ$11ZNwvETuK3th5_GcLV_lHu8x7@
zx|w-AV!-p7Thfw}cVF`KR|<)qTE1_S19z=Se2n8@nQ^z(+@{p-nrkx-gH^6|`Wu-I
zjLJ&x4`bJsEinkfwq)>y``_4wIzzZWbT+`T)><G50XWP15Q$Nrkd#b{W?5PTNl%j!
z`ZNVecG=YeI2-wJWP*h_A~{I;VglZp4#dQ>?9pflU~gvE&oYx~(_sFbPKXsaQg3QF
z(KS%j_V8#lSNNk|$&M&}gio#7--|*5ukg#(3Fz(BXr1VyVo7Ls{ca8;$fA$cVqf|J
z%*z}cboO%cD)%+dvv9z?EU7_juhtMKsJcvg<?_DbJ5B_~wU0I)daLrNmRe0t`FaB5
za+OIC71gpMPN!Mza`KBPwDq`I`RAzgL|^vmzP?U48&M>h9(LF|iG8k;tWSQRTuXX%
zr&abM+t)SaFS|nV7lap^o7w2Uvb;Vlk-y@QOXn6xBR$Y8JqIVU`itWdd{gpTN(2HF
zf7#h<ydUqtn;*Fd2&l`V^xo5TPu;F_5$fj&v`cXT_HPt=oWF7r5O9}*qczmq@A#F9
zfIz!!A%_d`ZnY#XLY))@+@(muN1bbju;`VIfPlMHq(%OzRt1t^X#dpu>j}6^<&LBN
z>}#jn!BdvkL6j>Qsl7Zy$nRBo2@oORE{j22M%|!sXEs8a76jg<u%BmYX^r@UIg{XK
zTYrRIQI^CY2)hziD|ocM{lavb@Uz(q@LG)uCXzpcV4s~2@&9fHhG%)7(q6&@d{@ke
z-TY3@q?=R~_gnwY<d+;MH#4HMEWg*#F@V=xe2XY?y!a|L+dm@$xULaKInieQ_~G7{
z3<9{W=N;P5JKNBnRb9U1HUPRSmucW$Evn5TRRB|GY+$<*<;^xU=XbUkOG6%PSIsXp
z+`0I0zjxKSFEIkLE9!8^eq`kz)5>zmH4m^|QJEirmM~)`oEu~4F9BMsfi6{Nk3!%r
zsa<ClV7u}JHy)y6Pi)bpU6fb218i4h5z2=|=iUr*R~jgT0I&PeseA`^@Mf(lbJqh)
zOXc>CC~Pfe)J2Z#FLAodq7iP`?ajT=Zh3n%ZaUO%mMLBojJMQY{|w;jm$L)rvFof}
zQp*Y6&7ijR+R6%v+K3{o<$eUFD}(q=tK6K^PFTwj^rtmS3Nsb8W|V8O^v_I=2nt9q
z_awGSJ+2q<CRlgiTD+2cO2DhQmx!m=*J|%9b8zD7jJJ-_eCeob^3tJRo$}VhN;~DJ
z@x_Y~Z@s<E^z0&eJ><JBv!l@~Sv{zSA*d9|AUnJVQ88%rb!Kel^B13g&-2UJnO!*)
zgD|uu@0k7@8+ge`<VQ&ZK7Na_<qN1a{XRgpGCdl_dlAoUS9@uB#oqz8;*A=MPFtL|
zsvN#LpaE><l?FdeGxEOBCQBlV4zA@R3shNN$^P%(<S?+7r|&o-KsFomDu;Cl0N099
zCawsqZds2U)_WGfmXBi0K8Xq*F{}?q;99XtPpLRP%ouybuwH#YTQN#s9K~3F@u*=*
z3p&`Ak5Zi+E1&TGqzSG(sa>93d&g-YGd|m?l3HJT0&ax_S@a>!`hm)HkG_Eg-Lg<=
zkdKx<HD?9pa`OY<vbAn4PClnhWp*8wE@SNKjcxztU`wIY)Js1QqwL<RS~=|BQFp(z
z|9thi`49Nstg32>Q~RX>=&arpZQiP?O|PNLKlkNw@b0ze?5UNiTE|IXE}yXhqrZi(
z`H|o+#Q`vvXZ8a+ZMfN|s@8)HPJ}fwA%HLM2%fH&au9^tlxlbyJN#?Et7>2_&-Ur;
zg!r;8VUEB2-N3ng#;N?UDPyVqOIfXFayXMtBk#Ly?<%YHi#5)KMmM4U4)WrkEPuI@
zLAnw$urA+w^ABw<e|wOwc${Kt8WLmdU$OgmldeC;t|&`F7=&G^r9kQZFSepP1V1*j
z7vNRR=%h)LTSkS=-@Uc?-opE)Lkh9_)QJD$WGV>$ppHo?oh#Q-?(6I0sV~(%=nTMh
zMc~Kx^!<GN`RmKIC>AoMH3pb;de1MW(5kKj?J{bWTYJmyLWdMu)mrqA?R{4F)+-&d
zu@bMX7w=~f(_GK5Ca@4iaKrLrFJn9awLnV0A5vgVcf@W1e`t&TrkG19U1=UduuSH)
zHMN_5iKT?Dll%Wj8Z<<zUNdM9sL2Fcn-+S}+NRy7sr}F)1y_3l?LO_uuqfWloZk|~
z5CmDQ5v`ta(6DBclDdxB0_O9)+{@I?@2lg!g8zA*$cB=6_<s{AsVgm($b49E<|Z-c
zBMPmy6`%2WS~cq7Za|p;Yryb)v2r9GuB3wW@e05i(ZVPPKI6&E`J)k_b-N-j%LfjW
z<nAtgr3v<59gOK3w|1x1##e&<*SXQps87K}(Q4)Qr2fGkZ%7Ll?M`wk#Yl-<aS`x^
z3hjmW(N`zAh_@jD7O7)*wVFCSM4-$D5($zrnf@E|0$~<C>pS(KCRWGfPq+Y^k?o3h
z#ku<7?7vSf{4jQ9SrUXG>`IE_a{r5s=nP5!q~`)WN+}it;Yvx2>rVNB$@l~=W1w04
z#>BW{%x_{DS*bLI9L>&JN_yDYke5U-LVXdf<nmY&<GKSnU^b|rCAh8RUsUOkQn47#
zUXaN0+O&U6m}|d92fsqva;l3<(K$iFTrrPAJPWaVmOIH^tCD8BH>$3nE6IJHw=kC3
zv=Pwd8?=J9IyaK*jE#V<(K_Pj;C|^+w2uVPbrivV!xP29eH3M}#10Hd*O9UiN$YOZ
zNA6oT#v7n6+qj^Up11nZUM~@NBdqJy_J6*1xN})7OF$#E>%F_C$0kO=7<_jrCGB=F
zuV8tv&HpQltq<}EpcFqh1b8-p1+B@1keOIy%;MxdM+^AWnk@Q*K<#nL0_)TQuESUY
zUf~fOj&gzctDgT*zMxnlUg5Jd{fo})T=jGZ=;h})Ia|w?tDx0M?!2#%wYky3V&~h&
z@{v;(PdPSc-soJhymezmaE(_L`SUnATI`pJ5mK6c??cyb4tw=V^h<SpBG&SP9rjvB
zhmZy;nu}P=aOz~Q=3w}lB~2|LYn>f9*(=WE2pLX7eCo?VdeAFO&1bH(_+jjdk|hQ~
z*p(C!@ctKjvYjFHCw&)ix|Xtp1oCLf>75v=gMqbfn$BK*UYs`k#1OA@Em$InH+cP_
zB^PV)ih+{!RnpbP<n&^#1#G2z^{202BjY>|6z6q6S)l7&_deynq_r3V_RL}cvO53?
z=oe`%MS7(!s~r-Ug8GrxG)xQuJL?Z!bI|C;S<@tKh*yb{zvwMW0KbxKqTjF~UWX&p
z<U~i;R0l4O^y<Yn>#YKyC$Py=Ns(U10ty;kT1v%~qf@p@z<JqeR^jWhuqrt^f4iW(
z(hRK*neL8p;#gEbBcQyjsc>{Yb4EbdG(@~**H~EOc80-lk(WqdyzYy^8uc`>Z04_V
z_>XbC8q6Ey#{Fn!#e4E=ZDN9rw0Iw+IUdvHwOfksiYygT9l@{hM>f+KDYh%pG^5a)
zp2ie^fntzdySZs@(-E)nYI>^y>5BuN-$N!W>A&WyrKqmd(H_`m2s~RpmkLNgO|S;w
zk`Fr_6w|~SyRjEFbCheR+On|=iYI>(kOr`!y#+OL(KBAn4*_X#&^%eW7UaAzF+Bu*
z*a@k}J*3$QCM4#iIA|`N)y!RgjGft$1ThFhQ?kKl{)w&W?n3g9b`qe*7t`{?B0BN0
zU)hk9*MPYid8bE{iQZTeOVDKiUCn2KBWkt#U9?`HBwa_%0?@YVdtC3L<r^qV)U{sI
zz3)4^jmbDu*T7h!t`#o0_!{@pS<e15w|TwQ3;K^m7gUD4dP)Y0>2NC?4G*2lribhf
z(Je_=q!hA4t@R?`UE0anUUZVP+A1b_Uay(8G}x48(b_GdpfB!II4y!WSXU6CJj>B3
z;;NfA86-FDQH<z<6JD(T>uY8Q?Q#;3{v~KgSslcQM8Z1voSwN@%61u~p(Y16hlZwx
zj|SDh1BEc7p|$QgevJXIEZ}y~E?cOBIqSaYA#&d`<2z{A833lWl!5~8c+ISXWSXsx
zQVm;eZ`O}P#y~AWVc%)AIDMe1N+u52Wv>qTVvGe18uC%D4QN+1W^xJw02uO7js~>r
ze7L70M{ugeOjMQuIA~XWDcKj~B&f|yRPI*Lu6k5r?$)@4x#XiBPVU!whBGM0WXG|o
zhcoc612_99oZ4KkY<hJjCKfM5V=gn7JWx~z$^BYZPosx0{NMXmyD<M_?257^20_@B
zKos@<7hCA=68e*w3-H>CmJk!bc*#B3!w!d%$1RL54hXMQgJ9VAghQ;!@9bj|M3E+-
zX9M3_1G1Cbg&7F1C+*8q|G<*!p=W7~DhT3(R3B+f$Lab}(QL(c#rMz>9E=<tFdIEP
z_}f&z3ff2+Lsz>uefiozaNwA_mXjE&PnfJIEh`LkR}}MA#f~Y^w%Gl&aX@#S=D`s`
zrXWaE81!r`zALZYv=IaMzJgHok`>*R6kWNsM8aJE8W3BtU6E>D7;>1SE0%zmHna?a
zt|-b&+mf?=mv%_ZUk3@h9j`NGH>G$^CZa)_LPqN_NdSAaQ^h>U0)25xoM}l7T31)|
zAl^vp>U;ieeSl)VIH+KUZFtw4&hssvHSk>7v)2~ncDk7wMi_{$G%4Dc`exN`d_XZ>
zVGv#Mn_1}KWOu5eV*dAQJlD|L#Ol8t#&!vt?&8LC9VyQUb&=U`VcX(Sz;g-gVFQ+q
z21etY;HBe>=PI19sZ=>H*D)FdIXh1EVE&8WhKuP&hOR5Vb9<Dr-?C(WL_*kQE=AmF
zj#O>3WE11hau8)Zo@L=C+jA59F=qT>?AneThCyIU1|%VscHIXO4~su;lLi>aA{ev}
z{*MA}S5$pO@d?H1$`#2pbD{2vj=qMb=pS)W{-I*iGlIM;TFClzymzKNsMvJUH|V=W
zE9Y{j8ICBIT~qCy&8D8+xVjkKnmjRQit`!-Uh&UyRNJ{tI_6ASC<cX>YTshIMt>F=
zJn10uvgQ<NNtWm&>WlZ0(0D~B=P3QsSJ}lJH~10lCU7p0Rx*#gW6reDLFOe6Utvl2
zWba&Tdd`q}r8{(0%Va-1xY)FBg3L?h;Md3jf}T`t8baZkfE}|khU)2qIuBAwd#zJ5
zi{v7d^D9_v(0N^_NXIf7Wh232db|sYZ@J3QBFVzi#`OK=rIr98+TzNz7}>SsytK9z
z-W5&oLA5r)>aDNbXDh(V&#u-jvCZZ=HjU55>ohlunvJ7>J?jDTvKS7zx59)i4O>Ac
z@WF3Etq?EIW!n`*)1Bj2_Olh_<$K^-H?5BK0Tk2HSdf>;yj9v)$#tpH#mzL~vAC=6
z1e9j#pW<fz0mRy_=-cWVCO#cwHjDE`;S9spu4K>QLHt^{a+s43J#B5*2UGsLYuNM3
zfybz9y<L&-7%#@o0LNkw1fo|$LD2hOY^D8SFxgNqKw4{6z<DDwuNBe^&n{EO+w5Zw
zvac_48AsF0%%GInn~f&?*$26dqw8g^+lU{>P2z6RWekCrXU4IR9LjU=6xTswx~gcP
z%e;omSs-0+d(d~eRYSbZ-Wxb6q(6=~kayWWQp7BwwGJ?Nz3oBWWlRm@>Xd^BA|Dl$
zB<`AoBQ?GC8RR@=3`n~cs)nAGANaHK3L8&&%n5iYk1em>YPC69UT!IhgD^E>&2aH@
zNLHG!5{0Rq$7<q&)0A>WT4}-(c0PBB<XfdRF9;Glm<`=oZ0!;*&I@`(4wZ`&?bo`6
zsBv_=Oy`KJ4c)(#<UGGzO8_w3GXdpxv)-<o-wcGI=jbU0$)(hq(d#0zff{$}I6pJK
zoUH&Dt^o%azwyXPNMWV!M+k7(gu>rz$7|e_()>||3EB5v8zZ%FMvB7q+tt=(Uq%T2
z$*;TmFU&q{_M`t@R$_!;pge$p@u%sB<hph}5CSGv(ZSncM8}cqm*qntfMO@bvEH9%
z&Li2EdWaR=TSXL|fG<4BetE$_05r6Q-^gvp@;wC)^#6zYW9*EsB?dtt+7bvF?Z2@H
zyZadOGf4v+j7AZL>%SQgIM10lfuu=>v*bIt6(BfmAjt5EP&9A*yf4D5{&hinHS(!8
zzqMV{sn(9*tavsNldHE~b5XY|7@Vy~KR3G7QD)AK7#@+864^$mj>s$T`kQW-UInn&
z%<yzqa)U0rwO!K*QnY}7HGwrC<Q+cxa=LOAE#Rijm*cmR{KJ5N<hETY+F1V+$>K+S
zxmOJ=)$J9eOEL@VbpBN3`HBOUyD{q|yZ4WG$T;<7VCx;D?F;b_nZ2cq`@qiIz}#_C
zy8`c>56#diszTT@K_jYUHr%_&oQ9NMrLbiV#a{fvN3ZjiSMF5{ivWMuxfXxT1VA=R
z{CsZ#;V@#uilD-mxmQz~%i+F&Ca-u4D6DKnPA0BngImGcb+muwh|r`I_IMwSgK-!i
z)bVu_6AGZbJdFs9!v);Gq-<!Px4L%+<?xqp_*pTTH{m<&FLF>0hoP7pR=)4=A}K;Q
zOlvQAfYB?l0vdZRz2v^s+7(m9h*Cb&d2NSVskJL>l{_p}AUbdA1v*Dn7mF}#EX;IQ
zi+++Ce2xG>RxP@1_#z5cex^0JFCZYtaj^avyP_nEK@fH&6%@Gt#TH(72>#GsfGI6i
z2{9>AP9@Rzh8IlG=k$Yzl=mWb0UQ07P7!1^BK*?@Wc_g|+Ql38UbZAB+#`mEd}*?`
zFBkq^cAyL7QOcq2$EIi#g29(bf&qhkS)g6%6zvh7QMqGkjWQwa6?}?53MzM@CGmua
z3$^2gP{BDJ^9_d&YEA|&cSm#42T6}F@9qq>qLm7N-ku~qzC>jpA9}9aeIoWVJifH3
zT6zOLsemMN^$h?_zI0h)^8P4eU)=uw7uu*>7Dhq^kb4x!nh;sEr>NBjs}Yt~uY%W{
zbFm!|7Sf4ZZP)etKAjZsjzIz{B{ZcjVZ63#b1=502+#PlZ~^54ZD~JH4#qr6`GJP8
zeRXo<jiQx_U5F-wePgTdTVeDyp636*A2Quqv6lXoV5u!Gs3EWfSID?&(C%Zf`Pu}t
zu<1vQBNc6FgTUp>&y6Ww<L9VyZQ=zfVR(FnFxWy2;q#SL!SMLfVEtu~!Fs_heKzo&
zF({x;c?fw)s-Qj{hE?A<WkE6B>+*7Ii|xRqHZRGBC;-eQf24|5Nt}zr*MM(~ul`Cm
z*iuvaW9$l$BM3p*mq2mR|9`A-of7PHvi$(#xgG=p<PS5D_>zNoI-cjM*_@ZKT=ba5
zhpz4DlHS0sVhcaaX*$9vXN|01jjOSO-fvU+n!75eVaC1hY8Ro~7Ocs9J@DA6o2%9p
z(z%awh$V=_vjmJAt;De(F2!aJ#RMdHxe}z$94JpVizmxIj`EZNO3^3vDYo!<SWMZ9
zys%ofBE3A)7sns&8Hy@fXX$K4+V=VL-FrohIA9z!>@(Btv-~`dht5|#2e8A-`&I#U
z+D~Ut`cefMli=<e<fk{X+v<5~2bo*0LJLP<8v^z!6Ywjtt0q4G(rj!+mRXJ_!$%z#
z%xLT83x}-OGFvElMxHv6Hm8I=_1i_3g$;nO;m^L-#`8NVe;eQnKjvxfKxK1o*LKse
zM|2M>3z1pnte1-|cN?JE09GO>`9EdltjID;T`eRpI<47o-tlF{mIc<rGPi(DcJ3Ar
zdMibjSqenMN#;TT?@b=`EX9{aE~wHo=24vYdsU+dv(K;^Fx&)~{1i3#QR>YO$2ztE
zw)RWQo*Jn~JH9to|9m0s?IOnYEUY*)>ur<C5jbWkGLBK#RHRw_S=Se1SCB0s48pDi
zwzP8pi+vbpNc;<QH!I$VEdqh0!u5yXRTjzF_ffJ?vnUOYNlh9^sC*_y`Uk3mtD+9y
zUOEY{r08eCW>LhAqT|gvYOze6v`r@~+$>8$ijp_QyzC!(YX!$vHoxXI-AJjfoyfC7
z%_3C?@1D&3m;RPszy!L>3$pgfsX=_$Pt1EJ5MK6ycJ$ahdn^y?P9~6E_I)}xBepTc
zK<{1BUfvGBoZMb{V&Ahu%p&0#c+(NBtUe%*#Q0W#S@JlcF_>G|;5$eHzTUfDR<3#6
zUu)#LUtr+tB9s+iHlj#Cy_;->Mlx^1dMjF1PQ&MHe#gEra?$#wAhTTTMVn?O$1$xm
ztTywp!pySKgeQuCwdbJ4h&H-dVP<h!h2D`4jKt(-M1SfOxxz+ELgS!KCJSiezv&`T
zUdN!{X~LTktM^JJw^<?6V5=N&Cniiu<sLrKvG>-un-Qi^xnD{)*19c5v`4?tvRp4h
zzJJVrDtgu$Q5b=Gvqo4`W3jf@#_z;NzU3Hoh~M`TzGvdI!pb5`pc3;uE`|wAO!RlT
zz_MJgK=plonbT=vqP>QNmVLG~>chJIU@pE$-v1c8f+Gk*5Z024xY~bXNA_kC_QTi!
z<9f&u6GOe2r6@=IA9OPI8Oh%2#XJl%Of7DtoCux&(6)MqH^a<_jw%gMy!o|a!bzAx
z3_!oq2-D{N2qwxSK*G#mb|@8NpK1CyhO(DCL&9uEqrL<aZLAF9SJ}8b39}i8M<^ch
zV$UA)Wpn8y%;rpEX`y(ZcCB`B6FO@$KkXPe)IVy6dS6s?&8bs>kVJC;urGDqSt`0q
z3hlj4w!v$y{-8%eoGfibX<0Jir_}#B`7$V~c><sj8Xu4OdMV7@<;uCJRDVUgFnC#b
z$(N0_M=Dea`PS~IPOj{YzzzzJ(=2<;*O@}D42o(=O(VuSw-y9Wu594_zH4K5JLA@5
z-pQ2#y{IG{+<>l(e9J#0a%B-^i7Pv1@_l=eZ@n$7xsh+;5b;!1UU=m#i<2q~)T^<F
zz3XE@LDp50OxZwBAvN)wbKmL#oJ3h*WxbW}ZOHxRMb71hkSB{EDv@z&<=56wJ<Awf
zX`-2~upmD(jb$%YLQb9xR}y;O5dB=YTS0-7CWAyscY4wHh<yj*Eq`FLWW&0Ke|KQ$
zkr8hl<W1KfW9N3|Kn%jrmI5}h-G5^Xla0juXwm>D8NZOP5uYG2+spNJZWi%!&V!P9
zWx$K|4bHr_l&T&b%vW2%lcyx~tu{di!G!gf;bl)1NqFb?u1DuE2ruKT`ph?<d94>f
z$-JCU2H)Y6yO+C(tOy8TGS4iKl~N<N-;}N#VPG;Z-$q=9S96h@(3K+$OqRdoYS8qp
z3_7FhTnX#~n9S>xU}aFm9=}={1R$B`a=~q$?T^#Lm&iV37Jy_qK^OD3|2}(PD+ANo
z1&Ay+jnV4q_U_H-9+nOOnb-Rr<~Vj5essMz0*~1VIyGIg(z;}q{|0cZ+AOtdxI9B=
zb25+>_W?APL45bBymt$tJtSjs!oGZVIX8CG>w0j&#YRn11lg0tUzd}CTz>##RV+0c
zFSpV4`qbYfcrW8Y!rWfNJ^K3vuvng;Y-?b-aN_-IWAp$P%OEY+%H0Ip$zxBt02do;
z@n*k##^U_?*d)NkQev=acHLpjZe^gq3BXvM3VfDrv$f2=x~t2{1};{A9B4T=sIzWP
z1~P^t#xazkc}Z)k>~*vV1Qau8gOn>Ty0w$jc?GDLl@EI`%4<*6UHy--E6A1@1YuWF
zsi^nA*oV%%B%KBQyIEygt4IunAC$@WF?pXfX;-3NC*=^vV&yo`sdCd>DwEfAAHrC6
zH0Rye*i(CdFzhmEgEVHruZE1S4OO_WQ=?$kX67f~nOx;&*!3Gh8nf&@=N#RwUV~O&
zhMADYGAy!&zx7MK^JncqH6e`!id@x*)Sx{q73!qxFxD;!wV$eFs@zu%!dSalf0ia5
zt_*vZ)i3jK>W+y#C4O&LyZUk^LK%y+k!FLD3)=rJ{w9R6EPHWArzLIAQsl0u%Epr%
zHW9rgilriVJtW8u(rb<GLd%XR!>$60Lm11;wIG7Q8AKF*^A2$6Vt3`T+!#@t`5Ivm
z!MFlH{QyX<t;9f}ZSK5@lT|WXiSbo}Akco>mwrKvwwA9Je-1q?|Bf*~o2V@%#-{|q
zY;9_+7wM~M>$LK?!J&q=bA}CZk&{7538?-$8z>P;Cw*S#!CBjV^?#Nq2Plz4A|)Pa
z_4-h9%LxlLEG6;|YvwUK&;4#<TYhG!VOdf|%d<$4d@8Xm2Nz;k)`ZD^8nh7msl5ax
zhZdG+K-f)#T(rKG*p3q90!TWa@Jap{yS8ixLJ+nk6b0S?#x6`x6YdY44R|_g<&lu+
zS#K*_0}_^A#tYz4lw59ai&6s;CQ(f;WPpiNxWCocGeBW-q8elrba!O=KZ)E1Ff3iu
ztSCYj<D-YjZS5+TUnI2ANInHmIaS)*3kN*xG3Vq|_0@fEt>xM;0w5;7%OFo=r@PF}
ztM>;DNK8^2laKzDSy#Dj3(<gxiN_v6Rs5l~R`|7T$ru4K5qg+q%5*A++WT!m>mVum
zgKDVM8_ROe`x8RzV4W)3X=7Jqx*wmz-s~A*tIVYIy*2hW0%7Yjw)Tzd=jvMywGjqe
z^Q@u+K+Wo`=GsY6Q}$+^mS3~H*AIod-4S455%7Ft0RL&AjEcXuX|VwWleF)|<COG_
z@sC5@KDGeCVwH^=SI^`K=Yzhs*_#0b%jiyChn`Wi_7Z-*{g2sPW>RbHeE37C>3VH)
z0}7Uz%|i1#Z;RJ)_5P^@43<WD6c&h8q<F-M^di~@94uKFMin;SyHMRTNcB6zOd&2h
zU`CBVI5|`uJKz5q7jxS)(6myWy9lVoakqjtw%ABm^gYlFKNYOhwx?l)!^Ela7=d8V
zO6P7HXht|J1q*R~#p#Zbb*i!X^~cz?;5rP0uq&nElji;x8+3Y@NKfu|02ZZ$Ky1vv
zRuFQRFQ{oNLT;=j4msZz#N2z7SWt==c7nQbbt?xPHooIw{$$F>)I*qnhHfBY5&w%8
zK2tR0fP!DF;KkO^R}@wnyF63g7pE)VRdJ9W<A`r4o+mGle(6HR;xfOX-!6NDQS{2k
z_QJ(RlHn?Kk(3_na4>xx@dCzTEpxWDSd(ARYL)JbA@oM3i^)Bya(a}jd@U7v6HtKO
zs#rZ{KjkXlT!WFh>z3B6kq%LM>bixEr9cn(?wWc4S68K{aiPGm9BPlED6Z)x_A8w0
zg^mrGedNttkZ^v=R=zJARsf?Wxmspdrl+yn;klPv0c2rAj>%>>^%jTc%0dzp{|(v7
zNA`}MXou&<Z@^vR00N<&PTyI)AhIDjEw46L^=LHbD}mn*hp?zd{w)U;n(vA=D+qKd
zx7=6L$>$|nVPp}Ktk14mc5tD&<N9ic2$S98K3xZknMcb)$&&al5Ky-7Ku)lj=}|14
z>=|QLMW-gYNqcuUJwyeRMXtWlVHe+|wcBQUH@9-ZN>h8&eD0Li-pv!$g37YL4_RF}
zNE^#MUh<zPGd_%6(G|oX2wO=(0Y|&-Puf?4KeP+@T1yd<NS;OP7GFO;c5qO=u6Nfj
zG*X`HFc?$9$i`P$wgg$WpQT|^{m|Vkj)V);5T8og7T99$A44dsvde!l*fRg~E!ssN
zHPQ}McD*f#Tz9#KTOl0|aQ5;nh+MfR>_5JGH1k-$`Y1Bw+?}G5LD9e{BZnyJ2G~;M
zGKU|CyDOM|Rfvlra%D+i+rx+sE4dn?2-3{2U&2pvS3*n~p(vvzNHf>|DB@oeX>cJF
z^|l0<J6eNh;T?b9_+|lR=97JAI#~fXI^SHLL&2CiW)lO5Sl7_QWW5fRU><fe90Caz
zN}BopVkjxWm+eIe=4l@K^Q%+41YOqMF^n;oS~9xu(uxOL*1c1X=66ocGIOiZ(?zK?
z4e)fQqNdqpUF+U=amte;T09>`L78!`T|s0a-7@vK?KjnMm;Yj&Yj9zqRM_WUV0?R-
z4i?>c=lYaiD02N;MeL0#q;)s(Tz_j63vF?FDWP#l#OniXq0HTVE@K&<d8i((n$B3L
zbFU5nR)&(klrL0$aBW~Bc3B!!;B38(gTgNJi-J76CvX0q+m&)?p<kYbu!w~idW=6~
zSDT(O2*R%92THyF#YVPw1b-~+1$f#@5fe#f<$GbIH)WK`D2wi!)-G|r=<B<TVvN!^
zPc)BL9(>8fb5dwg^i#?O9<7)5y~HoQm9jh8=nkX76$ot2D|&KhxC=u|;bC@p)VUPC
zc5-Moi^?Si*-yPA?)q7nx>0cQ=(=F~XKw}ZoE%#GIQ$#W*yHV-wv$1Ned{DR40z;J
zR6r^eI4LxPo$qhagyfJ_9Xt6^dVv-i^L96~lmA{4cT#B4?esi|Ll~@889V(Xth$j7
zxgSN4(JvJ{{ZX>$!qgxSBB+&qX}&!&ikF1*ygU!>wsBzsI#rmqV_2I0Y*^RL!evX~
z(#fHL-hE1xZllge%SuTOZJr-S;FBy)^yhm%T1P3MSZrdME#1yF9xY#p6dD8&bDe>g
zzoyll3>w4|6G7V3SH%S6oP`gP5xY~sI+|wMgn(6lbQE$C(M|Re<u=b-`h}RdaoWwh
zJ{x+SUNHd~B=a^-PgE5~kTqYj>Yf~0gC}<OEszl{H`n`-EvgTuE#zAcqwHA$0U0Do
zG^}#t0%3ycc?$@5rO`I0qc@i1{0#_vF?Mxl0>U6{CHn)Z`!9Ay?-INRbOF9<5rKs8
z&qzvihs$mI0TPOLd0ryf5QcVD5PY5x%go~ZWgP-xXwi@&@Vl+pxjyQ>K?vH_+?SCX
z)Bn~FfDklGlC0ZE^Of5HW#mr)+B(itw+!XmBlzU?1+hBoAu;%81n@(U`tlc7q1U?K
zMZ>R^k-A}l{gw|z@NEA#m-KEu#$VT0iGC0~+u42Z>{$8^TW6MyD=F-lingoC_jdrb
zq|uMFJ_`LdK5Y3dZXFZq#+6bBnDSeb@{fm=mPPvOcdO*KfmrrV#fDkxDb&gOOv!Dd
zo=eD`JZ8>c9*4Q@j+4p+LxZ|~B|U(^SsM=Rx!>Q<z}I#Fh?{LA&Q^T{ea}W}*C%Wi
zTWM5+2U7g-{L<S@fbZ$#&W8S5W<8YXD6A)LCRHeQxog^&6{Lr9A`~V@<4)ivt;}v&
zIBw4RrHImKT6_$@QB{&2S}FVkOPt0wbrwn7zEd7xiPK2*E^KH4-o<#R?+1yZ37zB^
zqd%6^m*IerS*YMMK|m}>^fYZ=H^)K9Y+FfZiG(Uoo7bc7aJj9gWF=OhK33hAL~9T;
zyT+aFsPe<u6<sk9g0PiTRB->r3SJ-Ke$p<$vnNFjB#Ek`)?P>gJq)vD)<e`1SlEHp
z#T|vG@U3nD31>*wCM(`M7f9eGVFO68F%V^8nCb!v{7sfkv+e~uFWG_aHF-e^JW7QU
z3~<_l!^@q8=Lgv?P(o%)<YKE{d^Ty$ZCnx_TIrK>eqzt+qGx=cF+9FoN087*{&yB$
zK`rwHPo)s`%N-z%u)C*U7Syt!O-uyY^Ix}n&30Lrg!#Q<LcyzhjXC_cNE!3NZ!rbp
zbU_5VH42)}fWMO3v{eTS_*GItb!bo%(9n{pa|N`bC^$N2C#tAt3)Ip3<7rNUWVVV(
zf*BfjzUrgLaTT?)H7V>LD;cM1#`DcNIFfOr^&o3WnJM6ZKG4dh<+1MB*-G!6OH?UH
zWqt%}hB!qO?T4P3f>S2v<h#e0Q3vvc^G6h%GO?9~#Dl;p>Pp4)mDKW@$c}YgrD^`d
z>R!<uTcc&7MbBfr)Y<t;P+X7X6qv8XtXkbuPPL*vHXjY#ZxAbt+jy+=4bE(x3(ZUO
zL$gTMKekUK$U&92@?qzaD$PzS3A$tc+RtG$8!t(99wBn|!`QVY2@Ha;D=D=K_rKUe
zcQ(PF%wE8;m0}?e{!CUGXysyl&A*e!8`dsz$1Z$zj9W_rPVi^o&`U5E@u#!!^?e0c
zEQ5kDtXHdyfbe>!UIf8<tcA$BX3ohEj}o#S#5S^Kr24pEGF`b*LbmfG<jHvBAB2Z=
z>pszd+=VV?xxmeaOAmd40|_f$7aFR0l}Gc0n<3Rs4jk-D!AQ=<$-BhVAs3;*d{B|S
zvx0o)f5p^J6fEmRum<v%nqI44A*y%saFK(OxE8tW&mO&#o?F4O-7m>IF*HcyM8L8-
zYQ0omzIlD?de{MgSy>Y!NXiJ{Dnn(I_@JmE3`sG@uLmZ}P{}UzL0Q8a=vR0|v&Am%
z{njs*x`uW7D)eUf>QMPWle&gwt3A*}|K;;Nlbv@50#>*TNM|*5EUr0mQtISDz-;Ab
zhhz}$-LGs6X-?#Tz^wlFkRJ0rtc!OqD{BV^X13|en8EzE8R~m#_{sr-m9m@Z!0jGo
zCg=M&Ffc1OEc`akU-|^cxxacV6q!E`j^Zii=;>7V(0ifxj6E$&Zr-GyBwNQE0(ZVV
zq1?(d?NX}C6S9_Tc|w_Mn`2)w-Tyj5Ka8DQlEokhM7I>h2kd`iBPP{Ns^((;=8MuB
zCJ|55{D?yP89yZ=N(-+0^^ssEQ7TQ(I?%1Tx3ztp@TT-t9Hrrv?ScvpV)tq8Y4)>;
ztgD0|gDvKJzFYc~*+k}Wo7<VampI-ne?Eh5lN6|!cO*x*?<@adk+oA4$6?!(<-eAq
z$}X}=`x#qB2YBA@%FY);M>?Z9-bzy9qH;^he#c-BnNd8t{q<icJ6#9hm$!5<(`r#E
zUkAD?;MY1Dl+GZxFVQETZw33R>pu}!Z2nPfFPrc5r3Cclv-`LXp+0h><22(zzN!(C
zT2&&&qncd7y;e<axEQlKf<c(%Di8(sa@VQG7?Z~~FGTaVw9v$3u*z6}v4ib6CrrhH
z`v%%>{Mzy*Bu}sY70^rEb`jfIzXDI@Cmp$hc}cvrUn`k}5GQJ^KwdsJu5&vr7+HA*
zn4ZjmyrkX@7f%qQL&R|ex`KGQY8>BC6J_OftN|6oOKPboM%Oy{A>K7$n)D!E;t;1I
z$Q-jo#c2MB=f6Q(Yps42IV*^lNRYVsX6B5;u+kVvSReU{tZ&io?8<qHf_Lp@2sd**
z7s`K>UC|YUFbG>oY$<gA#jc!Qf<M?>fLFCvOh|G^VU=4Ad{=0P8jA$FoGH!nwki#0
z=1iE!w9IJMe+ZiFW*o+rt1C_E^btH>ZdaNodh4LA&91nJy(wv@dE(GcT-&ri6xj7b
zMzV9o4|){w96Vmv!11bQn+Z=o=fg$2tbs-#=FrhH+B)bh^O^Mxp(Xfa-f|Z<z~LEI
zF9a-C>&`H(n0TaxV<6Y%9s$W^(ON>&t3rd#?^2{*3NxB6Uy@tvKjqwC3B74MV*;Z`
zODdArB1mXDO%v?V)BO5-5oYHyI?-aZ+4pO(8JHYN7+q)$wo$~GKix^#wWgFgyceN`
zy)f`Iri&<A3LLTg+Zx=j$H8H#(E#<Wud&o83D~Wcq{+cO${#gww(6u9OohpBk&{^i
zQXsclq=8dVoctid_pjtH-I(<(w6a?tn*-3;#?@fAu6pudyT|_JAWm#`1(>Nby@ct%
z^Qac(IQXsgq8t2sMhtTi9c!Zo>A-K<c`!qGtmZobm#>%ONN&IEAMTMlr|M(l#{RZz
z%y#e*k0bRHuC>>bgWs}%m9MAsq3lWyB!)p)OLlw!{WmtS$w<rxXB!~+0%95I<~7&X
zqXEDrVUMk@n&$O58bDk!Z)S<7Uwo#<o?F$burU})c;`5LUr?F$><HNEjio?58XNx@
z40)7CH@*gv#H^%k)fX<xTEN&a_4n3sy<Zztt|p4#B$;{7duFTea!HuzxrbHBP)eh{
zm=i?Tp4gf8YCOSv*AL4T0GA)qJ=ueBBW6#o(3*HyfpK|tWQ@^Ir{33-R(4z|Fs>Dq
zCW`r(SPn<`!3g9UgTCd*2;-}1NfoL9x%_Lq^z>qBB@JZV^$G*z(um8r#O+s7whd3}
z;e0o&t<=Qq=VnTtlTl`J;9UL#OK!pKOT`D5Quk^pV6LD9fo#znE4?2LN6M1}n9CzO
zdB44cpkS~b#F(uyy6#Om14)d*;fIzs5M6~7U_J8j%qvs-f!*rWK$3~~r6xojp7hen
zpr&V%AsAlo?VtTBrIm>U>Op9*542lC9p+UwhZuma5T{+4GYj=iSgEB!Evbk3Do}&W
zi<Z^Xyv)*wWIQzU-80yG?OFZ`TT8Tay^)MhG9CIUpcp&7uE6rK^F4v&-E#2dL)q1(
zF${vRD+&0={Vz6X9bqrDy8yF}PlJ#IOfO3h0X(syhkuTgG6*Fyg)X2ifyL-^;=($N
z8!Mj06ae(;L{S)r9ZiT6V~!w8zF0_yw;P9+va7$~NZC@01u2?bmz3D|9`&&T^rsBE
zluw097$+de`E6G#iJ|Albst7)C4zcnzIQp3%aAXnJP`;}g{}%1)A6_FPSEzb{(nGE
z)TE5&3_eJFD%C^j%FzGb&?584wWQnSu&`VUcwRgPOcv|{%Z7JzmaPYkCKowA6No}#
zLgHFWnQ@G?z2{7i1hTX=4r{=_-WAApQ9vDXbH<&&rd~)A?dr)MK?wDzBZV?Xde>5T
zqHp`{jbS{|R`2UdHoqI6BYWhetyMKOHMx=>v>ho61mErK#Clhv&9%l#bXZNsW6x2d
z(KY8C@?cTMi~XA@->kLWTmzMYK;i905DtrL1@D>q0wLBnx0l@m6<~zc<2lyuLc#6+
zVlD6>Zy*-BcuYX_H&Fs3SV|y@RWR+JeVO67Z8uqxgPJgSzr<GRDB;uCX`?iq4c_1G
z9$lt?w7iDZeE}!s=wu(vW95IZ|Do{4U3hwMcio`Feki+w<Oo6#_@!|Wkf$ZD57unD
z$%Qz#J#0~q0wN8~rt9h}>jIcpMqh{ocgAk%`AUd+ty_h3T~XL0hiR{Hz`UmAffU^z
z{$eGVbC(tbuWy?zl07E!%tLLY%yP!;D9>B1NSVu{UyBxfD~upZyr`SBX`KM-<>roO
zzs^TZzdyIF^o@7{*vsu1wfOZroRd{Kx+^#OZ9%eYcQV0K%EjF5$q^yjb>HOKvT3u7
z#K@O;F9q0_k90Dt<apN$69V{Ud6s}kElLLAL<$~dlJNu^n`9MU+5Dmw2M^$1yP^f%
zpRTdu#YqDIOD(@((7WBsUYHROurwUrte&b<W_s>1wfz@iM5B^A)zcXN=zkwmDkqT-
zdVZaygz;cg7Q>B;h+h7VH=6>;HqVFsc<EY7(4X$FmqHxuo}3Dr9vtt~gAd{av0ZM+
zX4WCaL2ZDpjVXbH$)yCtZCzwpJlGZ@VQG3w-%<t!pGcWiN{~;jwDlcGA-XUMo&J0h
zP`u)!-(5pW&|C}gH8~<q&WLcB5?GhC=29TK*V5V$@UZ+N0nbmd=zmN3VeAT!BM3p*
zmqbzEY5jfS_L|tvl=cJ6t#SxS02o2Y-Lfw@UD=}h4=Z5AYQ0Zz=e+qLA6+v`+AA`K
zTodSKONK=WMgePWw__MdhBdftXD(7}ufnX|4jrJyeCYvaQi7#<mm$)pP)6L=xCv~k
zZVDHC_KMd4FP1TZ6QVWhrN2L@hvYzv<&T<!z1Wv}y^sd&zX!mrEw%+@vOxX%>w;Pv
zj+1qYW^0Vvw;E*i89Rxw4AhLcHsZ%Ew?_+R%<T#a>A}}j{tVpxI|ORXOSFr}teDEn
z$m~4@)Y!@F4gU55pKmx}^{^4iF`0tk@B7}=5&hV)05?{>@stqe0}pr0D&C_vf-K=Y
z1MoiH|AOKE&1d_Q1$3L|gAiAT;#bGT=wlPvu`J5i7?6oK_@oRIa;*O#F2PIBr(AW6
zOS~?Bz3|}2G-~Yk)wqm)Hdzn&^ScocWLxa;RrP1Y<{L^o{n+^cLAJ+3Rev>N2Sf}~
zs~B2$13{MgxiRTiaoQMtS51H))7p4NBb(iqWuz}Zz>n1x@JRA}ND8kr+tEM~^w~K$
zSuX!bi<hI)!-C+)RH=u`Le)_;i;DDxT@V5jPV?8IQUJ!Sd3rDc{8(**;+*W-7FR|-
z8N0G92|^HdB?Z^3_36j7RfMnfTp-T{Q6Yp2qI2y#(qp}pl=QFWtOY-Nql^R<Dq-`h
zQT7$>Xd}^p@Mn`CmD~^te4(C`)B(Tr3;|+^rNWfq-W1K)XuC5c2>)U|Ne3?5WWBmp
zC%r;s7i1O|E%ttFBTh~|*L0O2@uHoe5cB`f+GmK2OuajUW<n+~JQ4{eb(XGoC&g^7
zB@xeR$r0Gl(+Pw1(SizrdUl4O5s=o?2?t9uasO&saU8ozh{%kcaZrD%Ig}t`gWaZ_
zOk~E|c~r$;8(TxYGc5*mFpLyHZ>cW=A4<myNd2~};P4z_XIJWT`pB=w5iZi^BQb{d
zK|L)=;@m*fXG;)%z<kf7xy**{?rZ6R44QnWjkIZHWs}$II@3T%Mm(=_vb$`l`pHo$
zxrk*Xp{8EhD8f<LEkVM)qJB6)#%+!Dh_218M-n+Pc%!hA_f`CPDTXesBvN7r#Eh|&
z-gx5-88Wz<xX<;uD6s^L+Ww8<WHgR&u4vPncrL#%;w^wcFA0ra!=qI+m60AT@?jn7
zJye)Eo{+xv7Oe{q7TMO$V*_z5GMV<&o+LF6yBXIPB#F@dT#|6D&<gp^=8v&!yOtmX
zVJ$K8aO}Ua3+pc7=b{aGMn;305VlGiO@i6S?!O~1T)s&Y<Ku}5>LIh$qft^}Gw3fg
zyWqmGpC*$;SQJP?GUu>}dY;o{k_YpEl(v;@MTl__yBQ@7_HVB7+}=Zc;lLhT%KZ|q
zRWP@#{|?Q7Z0E>tK>U`Z_mfFvm6bon^DsKFb4Wwl^<Ma|7fx;F+fc7}FQX_y3KE5*
z3yA2^UT%C4RM1Q~JFN&SS}IPn_DcjhL<gX9l&5t)8?ax|y|z?*t&%wDBb#gn$@)Zx
zag>gF?u9p}jl<~*9l}CkTPr0WSoW}LKOMm{p8^85WyxhklKCQ&r*y~@gBXiir(UCE
zzI>HIFUNCEU{UbyZT1zcR<^=#l0wFRoDDjIy=*8(w}mHrKaLz08k`GQ5?RB!z`&h_
zGg144wX|d$s66vf7RjAZyV4ZK1?5q|$9M}{E92!hu!>g!K`XB4B!Qb}q`ejy72ryg
zi#|@|I&c3D{0(iCQh;qP{*!Z!*+L224d(-8z$*l?-3LnAv<G)X*@}XnJ=BxTTkK%z
zXOr((x(yn?2LT8A>+@BzUHr$`m0dXy!myS&4fNmGqD*3Gf0Q)98;&tHlBGu)?L*=}
z>;%Ad<0o?{o5wfPU61gyYuUaSAk;NC@2vYJmAyOxk4HO5M%OX7=yA4Fe@=}kYk2b!
zD#XP}VGBq+`5HQ5t{&q2jt09T;mB$lKAgDsWWa9Ae4?>o8U&7N17m_*9dyj(6^sY&
zOYXd15gyjr`5=c1Wot|e`~N1yh2A9U+(26W_r0MKXB^6tKD|!wXtdVw?=`^}fmVd}
z5sSLKXeY48HSsMBGMOIjA}xJ4K-=li04!>m%#YwE9vVw*bfp0p^a8gCB5kcIzC8OR
zyftqwCB)rEUe4F;5lzFv{_j|X{BHQK{$+vgUr+_6i@+?T0=%M$ABAQ#=wNU3d8neU
z@n|iYQOGA4rIC~qeNrUq*7tr<#1>(n5Oal+nKTlu;m?~0#StKe^BzHb{DZ#A5%;g?
zC8aCDN}(wx3}oz#wm2?6Dv=)=aTTqowWfb!p#4{Gr3&Y%Orho6DC5iFM7Y2>rgN84
z+isH6e6A$^Un^RrMH|6G{6ao0-(p<1$W%p*@$Vk=iz{BCYtsO%iVXVe<oZ$QqJ;36
z=3VznCa!chT6XA<v2)9EAOwNvmPBcR{cmg}PAEQRD%pT1v3-D0xBeQX-n1h7%&S#T
z!9n?AY5|U0OJUm{q1sli@endbbHHA(z_#nyg_xL!Dk04q+~F|3AlHAz#C!w51uTil
zXdT%$kqKrNM=wOc4qw&AdV`sWtzQWkJ+=Wm6i399#ySAn%H~;mmARHE#8=|hJdyJY
z@d`%Oxl-L)i)GuugTYzEAC8uQ&ept~f_A1v^7V=fw83nLm~4k>yN4d0g9SLU_JCt>
z4&nw|v-`pS9YsdNbpygR2c+_O!YSR%G8%(xSNfD#G(6ThFEn50&bJ}B)ia7@^4~LL
z)-rMiS&%rOxB6U3KtbymRGqK|Qm~VDRXdLU(q-QA5&tl;B~K6^6{gGiUDn@Gg8!Y3
z$46+7$8N!w4jKna10D+aAIYqTg>hc)lMdotCs9JZJj{ULl52oRMya?qjR|JyBmyp5
zcN??AKma^U;3za3XPVJOoI&<O=LO}i7w)OfrEV6n#OXpox$7h^g(Jx_v08um<AdPY
zpaFwtk}}&bnS)L(Xorbus%|#VB6!O@F5H<6^B@J1>Xc2B1P5Rx!wkBUtK_Bg5rH6c
zx@h!^gKi-34&|b!eki-PEQ>)9wk1LEv9#I!$ZaQ~Kitj+Je4AX3FOAShK?i=x?8<S
z8h1F+K<w(~uM-3j`fWEbqN8RX`p8vE+bRi%bK^xtylWbo*srY?t02_IScaKf0yK5m
zS-l9JyQVhfhI~=4G;)>w<y+XEz^AtmoYt1KMy1u(1^9L9|F+1^HV)#5Xgg}-0{ja3
zWP!^`8Z;k;YIza?euaz^falPXF(EB(t~x#e{qla%W^XuP$atOZi*gdjB}Ml07m?sA
zF*&JBy@dFe@fqR#kCaNzn5<Wxpq|`z3N5=+@g6UMb+k>bU=&M<lwCP=>0J6HEl1c2
zb}CE|4nu9x+oNVK?^Ix5^MeF}Y&*3*ZXv17VkDzAu42X(;1=Q$)rid@z`@43JK-xQ
z^_#=;RkliJ>C6(E@gVNCvfI|!k#siIsG$mqzS}e!Z`XtgNl=(L<x)=#&VI7vx87^p
z?t~xjv`Ry`ec`wO!)CCDk(7!J_qRZn01f+Wh*O~0eiGX$p*<lOW^nz`@Rom^LSSKY
zIc2F%1Qzvt2<s04wOiJ}181~zk?B{9^9}(Rw)E1Cx=H4%KT5H0tBlmb;v{d(Brkn(
z?<Xtfm$EC$u@DA<SF)`Xxc|i#p6d)|6MXw`hzbSD!0=a!vLYx>5*aV6kK=zy3p0+B
z<BOrl#pOw^k5$*&OL6`e&M%G&Va7pTZE0ly5KA2cV#s}(B`m+tV}%qncbiORwo6s&
z9cZ=&2ShB~2A4r?-(JjiUaO)TDHutJ)DKgTNrzE39USdKoDhQR*fDn*rPRsFVjhb=
zq5>65#%#=c<iXpI{bRj?SV9mvN{>z9eg8OwUdnB^=B{X>N;;Z~o2=by*%;ilEP8h<
zzUkGk2-##J{uT1TT{;+#{uTsaEW?8^LkO=gwIJRHF_IxBiwfs79@$DH2z_t|Hs%q}
z;Swg9J2O9Mds7CWv3L%4l9cG{Q4Ku$_qc5~(<InzlB42M_wfg_)iDRa&Y>mQckZiy
zS25?mvgyZ&DHD=Xo4Zf-fsN&45khh{z1n|X#n^tNX#5L1VSfFM6u8<*AInKz_N>>o
z9|U+TygWHiBv)PSas$%d9{?Y7ohM8`j=yN_V6Z+K0w42a6x>|mO!m!B{?@u$z+=8k
ze|9>X!^+*I{~XRFSRuRn<@fnkKLE&FE-dY45iF!mZ&1YmJ{IYkUR9AF%B}=Cf)E6L
zNktL<|FOtA>1L}ElKp_?sDnr!yz&h9@xg)H$=-lX-DI_<A0%G@$byMT9-&-P-ZM(P
z=;{+kWx^z}N<z%ZxkLrH+#&#EaX+whY&S46#FcRc_?XWqTcG}I4rNf(XG&DJXJ<tE
zi*Mbj>E!DjRZj)SR&HD3C(k%JkLH}To(f1_Blrvyr>?xRUY8I6j-Bk$0QQ|hI*4zf
zC@I^2X$Lyy5fByy(ZezWKue6d106eCVw=8quDnshai^Y&C6OPrPCI%RXBVWBx7GoU
z1*W`c<2NY#h@ZJGiBSIaJEQ-6vz4C%WbA}_6}H|I8*hxHa+3j!S+tv^W^uOn458c|
z;9_<jyuj$}yy=Gh_Z<aTEb=FI@0xwC{PWbQN|JxMA!m{>^`oA8-u7U{DBnlcn$XMo
z>~~wa2vHMQJAkohScjz6l*I81B$Z<zr;VDgu))S&xrkTa?7+p;l_sYrya<BZpY)8;
zXn^Fjj5y(vy)hy{N;w8<UQ1`EJHLwOP+cy`Xp|^irQWlwot-UiI@-%ogsRjevOVu0
z)MaMSMCvtRl=V)L?P@%-aZD;lPaRZ%$x!x#+1*n?{^wfN7iCvq<S-1vR<f}T@&1by
z;y%*f^+>w_m$U>MBqRy~NrOX!dIu3BmGA?m6hSg!O$M~&_o+}o`K%0rtHJDfb@OAC
zchMdg6_U7EptX5scsaSS7(PN^qs)}V#r)%GgiIT`iOFugyyy#HF<UE7p19sJ6{tiy
zq$6iLxX%6`qm{dhY#k)Qg~_Hrp6JSmWBCO_9WnIj$b`W#tO{ns!;>uVcRD)<(Wp0Q
z9_5;!5GdwnR{kjWO@|?uR{uTOhs7%;-B~Z#Dc$stGHH1e46|!9a*zEcQwSA<=eWmc
zboP{bAbvzP)Ft?^$Iur_9%5GivI&WesPP+aWQqaa{rS{UV5xL`IN$7$NkUHd`_wO#
zI}1}m-wAFwgfC+BJL_kG7A=+9a9pH}^NvRAD2r5N6_Vjw0J=y_T<a*%qTNkM4+J}M
zUnC1aF<Oxsev#A7Lx_?aC4yqR&_Q{;x%7ue$-M1K^AK4IV?fWiRkq49up$m?`LG(q
z3}S?cUs<0<=f+aNi`{ztYb@(1@~LqN(nd0@o*NedEGEb2?yo()?1$rHU{<S8bRN<#
z&i}K(Rz%5J?V358885=FCAWeYgk6b1$dLPAtk9@&HZ|L)Clt+~jQQB!Gf+cW?dS2w
zvRbNYK3J+;eAW*e(yZ>K&7+N$0&KcDO<eC#%*zk<wwh)bx+)cf;=nr-OXw=-Uzd2+
z-RO%L9DU8vl99*wf<M^V3L9AdJb8=@5z0Fm5}4DjCi@WOy%2>uV*V9Q6Iq+$<(O=a
z;HI|)?r#u&lGVyzjI7XTD@5;1Ebr%+0{GCPGj%xwUnhh(1j-dz;u&5}DMr#5yVWGf
zgHX??ypyFBNs*n9Iq0S2qhY;TeUfRafgtv;(t|{0GCzp5$`!I**5+rK5YrKVxH}H-
zjOm<vr*|CY!|+)z|0P2YBZO{Ss-q6GIi8b@J0!GuRv}3cK-$0_>plW1uyv+uxe86h
z0)e;aujwx2V>4Bpr`vweHIV)~)2VCgym{|nfq9d4KQQ`dj~ujnb5$=S?UCXCL;3=I
zU6wS)&!UK;FoInX>xpvgj7b!%C>GfiQNDona4BKZY`HVB(kFtyW<e&b4iIIYAHuFA
ziD4LoeaQ>N=KminBr`}S_1;mvU<ZT|FNRZ%W&2%;K~K&sBN^>Tc1o<8^MO>U_>|(p
zuP{!aKtg5_3sGsiLp_6~-6A8FS1s-GUZn41SNo!<7c+;9#cL`gakn)H>cwn01`>!)
z!@eRIfiZ!Br+gW+<7HJ;S%V%3DJR>2nUGrRzqZ5AI(V8m2f8R%4PArSojTY?I;_-j
zC}g*;_?-Sp2?>z4*mU@U)+CyR&uH)uk%4TOL&Gr6M3z1=j`p}vE9L`=N0IJ6NO=32
z1_=<@>vgCDynJng`1_#~AZ@Q1A+gbec}o|?^tyH;%#Ke2p@vwqco8|03%1KP5sCTd
zMm><VXMSO@F&?7KMpNH2=H7ZF^p+MWtfDlbDOb%V^qRn6jdy21@XSjdL!Lj<L0r(T
zt=imy>FjVl5*X|OCzI2;sBVnAbTHXjFbgxH%nXV)^=%A29SF&U(II|NXPKV&(i9*>
z5br%WI<xchs}jr-qH|#NR1OzxZE(MdFXmfXN$0>4WVSF}?M+`M6}RZgKmsxEBZIw~
zBM2;CNrOP7>zdQvP?PH|k4+%(+6&4J&x2mB`5P)h{}FZtI1+>)>`M-y$p1ffvhGkW
zx%56jMu(tM+Wr{?4=?e(`=5cywG29MDiA;n$MASI@mG5lFJ9E3fSA<~yQ*H~mJ`J3
zgr)>KvjDU}OTS{(giMr1emQ0H<-pO-we^U>iPUr8&`P4C33j3?db2(qlL9>o`NQNf
zB2^_IZ|S_#pin=29x!LKo>c)z89}}hB&vUyWN)@_Yn=x9XEANsdpDTJV&DxKn}TrK
zpf3%S_>?VyvT}SHOC-pGd9gt=<(xdy+`2h&Lks#!tKqh<=G|V5`VQaWllQQJk=DLk
z#1}r}cRd9oETvCs&LMZCZ3&%~P>3I%oEE^>s}-X#>i)L0i60g^da|Muw3RZj6rfiY
zaYK;VfX!`mrbYpJ4TnQu27%#s>KM^Y1?m+W0>q6*dDh4kLlux$nrXKnXm6*}jPdUP
za&X0nzX@U!s+4h6cuA0&gwYW=zHL6*m`c}{ibUDfB46zRd$I!F0OuAtjPFWK7No*S
z71mP-fgGe6D7_jfcwizM1!*qF;BMaD=)+zM^h$)L2!H2RHoY|&7AHZf06GweLB-tA
z56<=gzcFfoUJ0rLGfsOgZS8@F;@2veh;e8(#JZ5fiSk3(8C^>Zf<Uw-6-4d7v6bvT
zE<cYn;E53wW?=ZH_WP9fLL->Yow!=msy&`xFB`H%G*REvFqZq=*JUWeP%ul#i(ikL
z|E$%vvXdrx*vhsgmNdzGjgt$Em!*eiJ4}}<^|Y4(j?f5pgK_fmdov=P?Qlo=DfEG9
z8-RW4&DBT{*3q~?cxg|B{LK<b?%VFG-VQ^=QxE=`BSEp(+_XHOpu2qV@4$bA?X>fz
zgC=x=&4uXZ5o09fE8-!{1H0ix@bSmRC}u`HN*@fm%ckl|$Aj?ogLu@(6PK;e?BRF_
zxE{cx^uS=d?i!7ZOOK#7{nMHHe-Y#mosEnmb`c5MkeihGqXgS!X2x!A#)a7*d$~}Q
zZkn~Dx$YUvw7?mxR1}b)yX*!!oqr-rGR{z9T7n*;YXn)+nWU`7uglVlQAGR^Ab*u@
zTbQ@tU{bkA80_6a<JA}%b$WgGRhEg1QYb44QyxYU@|dUBfqBqf<}<_azt#fCb%<cq
z+X;)^ec(EGaXR#T09)zA6N_Dly!ssRqZuS9|H;fVX)rc9@DC0W)B!R5Uyc#Pmpl?V
zImNHPBrNux2#K{<M)#cJm%bBp*N3ocNp>Ivfmc#df%{+VL99oUO=q97oQb10{o%$>
z+e~~S`#K>$pGmFQ07{jd>GCqB3gT0zpcLJ8Gt{m{quOb80=@JDEV@gFBbmqN2H5yO
zeEv>KC_B!<U1=KXmXd9v=m}VCSDY-fF8QAF4@kSG@MEXQu1}1P;sZqByQuR61J<t?
z19iU4_h>QeT<tE!bfv!!JyWhL?7r?wt&?)mjOOkNO9|A|>~QvLJ1L$kW`dX#a~sHu
z%|R%fETStlhtN=tuc*2o&SNQ_D{s6_x%iCsRV?6Z4V}N@oNH?>^~g1d89$0!<FD7%
z?|(Z%0AS{p@TKN$3>53vY%$B{@VyaTzt%t(KYI;-P_*D<0D4V?JerPH+Da5i{~BFQ
z|Bs36c$3<z7WAzm5;3_lJk9P4jhm=N(H(TJrrRH=<HQ=_GH6ktE{C`^2dUe1?A^SA
zDheOMK$5;4S=OPxQHDy2=F<4!U|2cU*!Qe%^Q|5ozeZMK>VcMYsBg}}C^~+*wpz@6
zZStT5pq>>erYkkZ#r|1#Hngq;pdvIWsw+kjfWYf>+zv=7VJ0wrC4=c$`+|_Wg!;U6
zh@M|@d#yWlx~O5OOQ`?NyZteCB{mYoAgm=wn2FPWV;5#tnAJ+wHGuMv$2|6r72dPP
z1Oiffv;_<tmtGgPeHjM5?o|q{b-6SU1l5>f-n7tya591V)-zhIkB!ey7KAo(g_wFm
z<+|>@*CXuuXH~*v)7SYXMi((-a4E|YbkMvqUS}XzwDau#RhA$ZmR(=x4ys1#<SF*A
z!UX*}VB1&fb~h`at7K(@-emTDoi~{e`@vK|$LVs9H%U0QUoB32uZGiY>!l?N$Ezjx
z*`T*GgE(D}<mO23v09|qRs-t#5VGy-$>-8lD0H1bUEeC3`ieezPmUH9dI|#MWxE>#
zM^KJ%u-WQ-1tkYTRMrb~knI@rZ7TiX+VjLg8Yz!$1hz<wz(oEq`AvyReC1VLzdy`P
zMulU<B_fT=d?DNz#`Jg?`zw78J)3gZS-o_~l`Iok*P_Q!&Ke8{A=R>LQ8Q$vZIrKu
zId>+>Aq#q?B8%SMMI*DatH(nojT|44M=z{tfiB{VIS3Js@3^*6u6h}X(~+SlG;l5J
zd7|=O=ft*w*e2;_YWzy*6_xiw5-ih4M*D`^fNLXz)1iDVd@*Q&9r7}Y%6x&mDsZfu
z$@4$Pt|-Z35QJUHB7)riVk@s5lK#-W0MlBlKu8j;7Pc1bwUdtwy7Ls&2kWLSH9=~x
zE{LjR?gqmG&E`@YqxNblL<T6+mlJw^^)Z}Y2F$hLTG?8{=d+Em5d-o_J82<|p3nZf
zF#j7~UHhamlZ)AQzYBTR$^zB$RDTyS(OWoC3-S78;b5YhW9->>KMkM-c%|cD;SYYQ
zYJz%a>!@v7c$cTbL<PzIky8QKpNimkWgZ1LV3{@doCRP@T2nz=OJMQpAwi-aAIP-|
zwY6a8;;~GPk?Z~wJ2lvp9EC$($aVYo72IX}ZudN&`1XHz)@0eoW<w+PcC&lVk^#ez
zu#Y<&SXanGQJjKgq`zQo(y63*I2;w%Nirw8FW#fYT3FXP*5NKU2Fb0N_FOeBs4KEK
zDT3r+{gU5se7mlNbw#>TY$#j2XXE?Zv!JeQ+tj7yC!L=0@7Z{rMvqeI{E0$R>sb*?
zzbuX@=uZ3fLeO{5P|*UrevhIcpH3QT&(xzmstfMQ274t0o>#K*SbN)3(!#s4PQwi-
zYr@(o6^>dQUiBig^U6K_{G8(jp|{N(RXS)%%FfM&CkwPiAr!KQ8u3Til^t0O!=RRY
z$XEZ3tx4X1_J=f}No++H0V5uz@F7iBPncI~la8F%g4qSv<-#S|PCc;NCS53XLw9n~
zp=A2oia;ZhJ4_+KpWq>S0@lk{{ZQiWCWECjbP_(m+6PhMu1&qtDpi09z`A@aiV}Bs
z@+vn<GEcm~`eRv0d)<R;=DXL)PzAu+W<O~!1d%P+E{UiGu=Y>Fatl$Qg0%Hd@ozt%
zAxk68IEK0Y%&6LyrXl;dXc|>;%WKPee;Z=xDP~ua^is3j|6^mAuf1si?rnzkUl(%!
z@Ef!AGK&ZDeC_QB?rnsv2xn+sf;Q!gfe#rS-hJg=(K$5&`yt@%i_DT@u-3zUSQA!3
zz}xH~*>!^?54@Ftef3u#LMDfOH_hvTt%St&rH6kGW$B3~Z^744MdEr}<&(|fk=w!O
zTLS%fFKw9^Ow{DaG)Hny{S?;+i7v$0x=3GTm;m0~w^}5+pm!N^MQgRUEUveyN}>z8
z47RXf_A|1#jCYXe!rP?DrnegyLiU!V3i%uUM4P`DZBP!>VbyL|MD~Vp@(i)1>VA>E
z|AQNHH@wYEXqwrc8soW7_`VTe`X66cn5;nz!LHOQrT4$sW4<?H|KtK@wyP>a{2Or#
ztf<;|tVH{1I}js^GdW$qt%<X92D;}6a;O`MLkUyf!Wyy)2=v)(sw@3Wx(Hm2HFGAJ
zH{@wEU1<a_c=dmb8G7fM(CYBli<P29Numj$n$oF__E*#KO6-f(Uqv(1&0h*(L$k4c
z?}+OM-qV{C(1^3Z6;AJ6li%gRBv8)EWCZ)&e9H&k^Uvve*6~g`>&K&|A-#}CMi5+2
zJDtDrWXOU(;TNart+de?r%>%E5Cng}o7?izKN~he&xH2WM*_60Vf%$=2pX_lc~7l2
zwN>2i1(0>Y+(MNt`0oX|B@%#rYj=WH%UtMuj5fDbQ;QH4*y2OxF_R7s`<mRUu|@2c
zOOy^P)t1grrOB<DTNH>Sg!`v0ox{E+w`zQ;8+oj7%KfyZQ@3w+t496akOqlwS314L
z&2HuK#m45B->Pt6N1i1$y;ZUm!%C*Sds5YulGWz7YLcsSEvq@kK~>8Uez*ZEw`p@r
z)Hli=8TEKU_YJXbNYUtClkRrPfml;q`JkT|R+gYwKR=X)NLwS$z8*2FTkdE6A>&rS
za)kv_&|2m<(fvPH_Q%*2B}))Pz$+1q$^9?3u~Sd?`&hddP$m%!t$mV$&H>gzog7q>
z_F4P#`B)t9If;&j-q8E+K1U&e=Zs4hOZ+T}%(KxUuv&o#cfz%gK_dhP+gW|oKo|ki
zbDrG`A#?TqW2+J&_{UE4iameI2E{fuY!y|=0@mN>Inz)fRp{ktfRehVs>Y-(6pq%S
zN3@SpScy;thOwR--R3&idt)uhy)T-5zvqg5DBP@Ie})&aR-(f2<q<1+*=%ma<2M)D
z|L4zPwpJxC8%9L;7_K}*d_-G?!d#!={YT>@pc|@bh*=YutS>__O?1rEOt1N1+h%L#
zyI*i|M>46ve6AZej8$yKgo&M``<bx%EM&oA#kx><grE~rAcC=65sQiCd+e>sSC)(-
zm^DFSU<m16AhLfbg7Hiic;z*l`RD}kMCIgUbUF)xdwuv6d!r)G#2+SwK?vOIHd-#E
zDf?H1eJmKP5-rtrT?~%ToNp)jc3Q^CW|ayB_k20zV^I|=!Y#DCV@4Xsg1yS>QltB7
z&WJaRVAR7Xla&To`LS171S1&rFu2#71b{8<8-yT?a#*5+D`K5K(idUZcI_|>!d8k6
z3ikesUDNa;@}n-machT%Bp@{e@><AqMcbWwjF4tNNhzc@1J-=&U8&7yPf^{=-n#V_
zq`9#AF6`YU{&FA)$Z_R%yLx11s9~4pW-@yPDX!NHHY=BCC#p%%6C}9qw#g(>Hg5|5
zrK33ct$TC0Y7YD&V{Yq`06$1?<@Uz<HREYT{}-a0ESBJWs&1P`mbV457IIZBoSDGW
zGw{9NIa|y5j7uA#V-1$({<g7nz;bV&4Ly+|qBrtOi3hmSEAF<reZ!16!w(ZBd0Cs8
z{7IjEy!!aHk<z^6NHCrw+<PPc(vPG>FaETceJ5PD!u%&_0xt79{<s-=l=_95NH`gw
zJ}U+{+2dyV`x7<+nm#L7^d$`0{u4be9q52oHB)Am$<d(+o9L5pEz$rB$NOBXb=X9{
zSMpkOMIo>@k4KG{oIzV5wKc<N<(Z&H*hB}d#%%?8x>Lxrb?F0}==6x>mX9%Mr3to^
z0GH2=^w!CZoI`W>9<5jWhCT>M1J3<4yBd^~6}kS7$#5OtTmd6<@5cS7Vn|ydZ2-=a
zJ5guPu4d4oizHXB15cOo$Jn(UNeqLqmW&<0`fu#O-b2dAX|Dk$VF)pnkUs9EShhRt
zeqC@d^O|>T`t5CHzXc9tQ%RW1JJX=f)E_coc(gcPPn>J5iy~y3B`L<(!q;g5gP>V9
zgci4##`J!jl}RpXutkET#<{1EH4B_8*m9}p9iEMg?<(}m0F?EBc#gYujoS)cDU&Rb
zdU9Aj3heaaw&Kf?4Oo}a>TNytVE?`%0M=Cvtd~{{0-~{mug76vU3HX%s=XWZ#UuoM
zj0M)!3f4@$Gl2XZGz1+3eYQY-*JJd;vV)Hfk_Br8&8;r%OdM*zPHWbybxV2W3OVqv
z)cy{f%lwRp#~7m+Pv!C$3!p2?JlzsEZ9my(r}6I~0J?nSr9z{@FQ#%m3&X*yT%YV4
z#4GnTmFszFp~bGA7g~YHG?vEGiG_ieHKQPH??F?!{ud|G6(1koX42k84COkn9V|!e
ziANBdJeBLb=0SGfCA}NOpQF8)`8uyzuEk(FACha3`ir%9IUXd|<^Mk$2x1Ei@K}47
zA75f!!O+e@rN-^UWMw;<SYTa2XWtYgiIPXzPUZwqm$!`UM>UK~vex3PC35mZ*tK0d
z41=(hY%tjDzt|0JFTy{{0y?Qf9bS^$FzK3x5r}v=3jCNa0Sgw_^N#B~{IO2hohQK0
zq%wl!8r8wt+`AJ6sF<;V#T5s3SF*l4aJ5Px{7mY8&As*dT9}SueU*S>AYj)}{2B?r
zHVOEHz;3R&9LSQc<+hYx1R!xGaRavM0$Cn?Nn#x=uH?4XKS$jzvVl>Is=LDWL6A%-
za*bwj8x*AKuJ|U!1tJYZ4u6umU!PQd1H_uwRkENa1zDhAjcT3dRP0FSy)Oy^Zp?S(
z@0Zp`D<e<Pp{#?)rG}w{u8ly87iTC3jqABk(M%d!^xBJ13IZBeGk9A$;?iE?^Cv-{
zU<~vM=Rj}lQ{vMn={zn-5@a>u+Dm*I^Nq))x?w=!aFWRqpK8i^<8d8rz7Gavx-9W&
zKiNU#N>-_t5xSmv>G=moS@3C$O4nv)3fE@D<S3xY9>}N7l=87lu#bWuWOdg|o;lQC
zy~d{)2-yX_mf71lpS=h=#dHw5)VvhfQmJH1FJ?Ii+><@vQ*XAetq6M8I|yC*T5+(x
zo0xzf-ko+Zx}E^v2$d&&Ya0#rPjmev?Ai_-hC$d$euBIIVh2qsk&jarpp8SYjUN0L
z1z8*W0%}{FBPS=-=b$rr{j)*7)*fJx<~CY10<M{3Hdtosr8s-KmAEp8UY5;dK|PrF
z2n;kEmfpaCbKNd~cdb6O2Dw-fItXWaen>>kF$wKdR)k(z`VlN%^5X{kG!t;0wt%`)
zy@*Cmk0Z+2Mf0HF53sIOA7ev~O54~|O3i~L=Nr(js7>q?^tAVXXdYxg)h3-Zj)VJ^
zGr!T9`t}>-z7E7IwZqOJX8S=&kV^~1>!fq-K#)1>m;;wEkpb~a_p{C*yC^5ti^|(3
z9SJ7bo9Whf3L!z)6d+!HuECdAjA=Y`z0m+{l4dyjW(>D-&G+s4kI?(Y9A9A0$?@tX
zApNKekXL%WECz}5b!|AvIVDCxR~uv*e&>5zr2)vtp`I%a1E5C4yEgYK7my1}Iakgr
zN0P+FZ?9q}pp%4Zt~iInETWH1TjBH*&}p(ri){zoq)gpe-1uA5Z->O#*gzR1Hn74a
z=uJOPA;tn;&1*)dgkrpeV7^`hFMi9q7CRp=j++L|D?vbhIQ_!`&e{2p#~eUj?rB4S
zKho^%+W3&=2#{C&80p5n`yXRxl;AK30?{jhQNa6OY$fS3^kXM`fYOvstth+^-~Z+P
z*@9g6gh({d_k16G(3C95RR*??8ru2^g1c~9U3qyL`j+NZ4JS%(ygyqoMBE@(=#g5T
zw%<&Do|BSm8rIdvkpQai!#gH1O06Aas`}&ySbrX*^m=qrlX@!oN7%9c^v4H!;n^2e
z=UJKy0ZVsH?%QXe7v{2jAtimz`{fwbfG^D6#!|gJHkv^4Q<(r?Xto7U;;ok_Z}RE-
z3Vh)VbkU5nqh8VJ1~dlr+9n3ZDX7)@RX+W4KrfsVW8Nd}5WkrGJcwa6iE1hs?tW>n
z^J$FIt79%K=XS<dl}}eSunT=+FFkUQVfHGY#(-M$4eR<rwzYW>qa6iS7hRrKyaPe5
zb_LH(>CJ(GyQJk*WA_rDY8C9lwLtrm^t$RU)Q@c)2?L(7z(ZGZal%GAi+uht4QMPi
zPkG9EMf=KK<WriCIgrMI=I!%B+3mjhXgT=P6idS%Pmxa;Uk!!7Y`$d10j`$7!&vkv
zaq+d<fi+fdneow2E)u=NGgCYbUsC^q>4UOcv%fp1!5Juq2^{@hS5ED?z!sNzHd24K
z=KN50ZO0MAAh0Eb1(^ODiy%3c`$3Zi7+XeIf_?mkfmW>SQjMkr4)Z_4FrEflqV%RW
ze1!?wpK)y<WEgOhPw6MmgBZg2ET5?$dPUxDTsXc=3og|GOs|bfx75hK^cKeS1=VXm
z;GJ{uq`v(I=EXH=Kjhuy^9$Ks#gON_dd<IrqN8nJGdPl0N`}?|EGVS-K!J}dT2mSh
zjLYJ%K5!}J^>bEY;M>x1VC<&U2rN(viXdxw>ps{#jZ<&MSFr&khOA8y@tsZUw5DJ&
znsdAow>vHgU4m5YHC;t!pdk3+M-a+EbD?rbaKc>aZ12Y2j#kLrcdj{DfJdx-BWYiH
zziV!>I_zc?(4|vQNOuQc@VEiI<!%dd%87Ifg!z4txs8uUi5}_bi?LB_gv?b~)|@D8
zEy|v~C5+(OVP01<3c443ArfajMnUF2tL-8>d4wL3i_OnciMs^G#U%Md?1&N{qim?Y
z!elfE_Fk=s1eJ_IkhcuYt5YByGwoZ8$7&*$Qwc#3k=3almsNps?90`jIc3(LcXw3D
z9-~y=(t>Ma!tAW0N_Y%XiAzw&KIaTxtt)at+E@+6^qj2!z?nacT?rDzAPD;s)Fb+}
zef`SX5<0U(`vJx(R!tzWDB6SIqoF)$#yKn2wMt`@pC?O%dD6L6N_AK2ME#iZs2izy
z#wqi5(5!w%IqF12deRlrTi$Yoq_ckAu%5KG1kQ`Kv5%W8=ZccbeJXQ-6JyP406Duw
zX=wN8;0UM2nzeuX8B$IG#&?A-puv}jdJCDgUdqH<4@c18ON3O#iXym|x@3QD(BRAd
z){J7e_gk$?IxjT%lC9EkjpYym$W!wrqQ94!xrfQ!{YPhz)<*t8E;ElZI=8g0>vE46
zR{lXQG>@r{30Udh!8fp(R-_9}f3G3z<dkAn8YQ|`q??fjU)IFxTiUuEU)xr|*|9dZ
z-oq6{sg(BUTLGuX)^k~0s6{Rm?VOgOH6IHz7YNgW?HKtv3*>YA3sCmZ?oExEJL$<&
z>PWA-aC)qn#cntiwGbm*@A33W1gFQ^M$@llmO^g>1J&}Oc;b#KoqK3KA&8rrs7RV}
zH2G2mSt-#OYiCmC1GM<kK>>iZdt(*Pl%5Bn$h@-ea9wJHrq7epC4$A*x&`^?jEz*k
zLe)TruP&8f<$wfbl862n(Bi8L;Ry>;kH5t;U&5}%R$>^0twh4F*?+MIJsl>}iMIf1
z)0BW6>|a5;#TU-QD06TZ=#>>2p9B_PE>^UC!u(qst~Mfk4vViib1Gl2Xf(O$j?OX!
zF5H~@itmfxnAg5^MgCb8X^!MT)>uBKqCnP0Cjl2Yfk%&6Pm^;gkeqm-wRw3BChHJ8
zqMXX)OIl<E#k`2J2xB!@9j*Ig)>S`cu6>Fu%bO)N;zB!pMXpO4b2C$PSv2fGvm&w3
za~WaGWv;@+{&8wyRGYx1?|tSlumvZU_D(Rmdl9-3<?!OnltmnP?1SPbVTRG9#}$?|
z1Unf@7Z=6H&a1cM@@mVuQ1!^9%hx#5T>ilID=Pk$Fx|P!hx%M{!1gNzW-G^VQx<sf
zta;xRbC&HP0Os_@UDxE!_)8XbCW#@TTF|aXb6(5IF-+}VRYFU{=@VdGLUi1A#hyh%
zI`xrgr`_*m&M}|T#h-~0ZW*Pe3!l~9ImT~Y1X|9g6*&@nP*6wFiQjWB#|#-*58+|#
zBN6-!WAjA37mFrrRP1CPmei+-XnvN;zj?W}wE$wg`t_bUiXjSgQL_kI>yjLqmlxYt
zVWS?eL(+6jndbttsI-XkI9B&;KH5b`e(k$I#;z!fVGx8}$rS~?|HVeOw}k%CeeQ?X
zPLz^hqA1MXT<Dj+FhMWgAfWb$A)A&jaD;$D4O6o<zS|LyAf1*$!b=aZH1(dHdOSP|
zbJxD=)4%PwT>`jS^ZN#id>Y#LsGGWo7~%Rwd)kFEcey%=Y~(K&9%T>Zk#ri|Nrf0@
z!|H7IUdMWRCCH}XYf`lu17XsR#ne$-*T|+}dVhOqUqhB1@b~Qh-K{91w9y+~@v8D8
zeZDYtF`&9j&luOu;j>*Ma%r>NFM@aC8de=X+ZQ5}hT+??i{cdLH-JFxUL=ub=ZpeV
zBjxQ+{g5Dy2FLoLs&>k4nk*}Q;*vyzSb?B1^Sg=21HM2OEu&1=Y3XC#G(`IM`Q<I9
zqlExvFJn>~UEh(!CQ2~M@`ByRK0N+EQ$KBx%^*|PF9FhxB1STLL9if=W?PVMuK2vm
zm9`axBwEG@kwwtvvjV!bG<}dm%Vm{D@Axq4vx<PUCjvP%%Z}BB=%VQ=HX!{-a*#rU
z0kcZ{9MZjk4{HA;Q!!4#bFX3?2N{qaLnVP`+Y6qXzhYGJ)cy;V3|dxr`Bmg;7u6bN
z_lwN4c9of|YtHN6*`YZ4#I2V$%-)P$>zTta2wTZ7Y`XtqhmtG8e{{D1U+WMYBqWMA
zE>I5rJH81EGu)h@h*sk4|4M{BxibTEQs9=;dqp{h4AL2-C_k3(R?SmoQSxNYY(y`}
zAfxwQB|;{HWM?*uSP48&+2d+kT2p)SW>GNu=D6zOLa^zt&yfgX{3WY2RAqna=Z}d<
zPugsFZ%o!USWFr`o0@*ar$pg!CeR3O%mCV=Pu3Y_9!{)wYm5RXMV%?%l#RxRvNp`o
za!&hIPN}No$(-T7%v`}9$F(kZ6lpEyNu7;2Y7#2Z|882AKG=_Z)XAN}ESPL<{KHlq
zVQori!jn8h7y=yeIdv{$S*`!@WX}fHVP>5?ST}SjsJcEI%P>YSfrf#}X4e)}eKt(t
zGjnXaLGV;y8|)#~XTu!+aI_HM#JFWtOXrRAX0=gYg;fPmE;||T1z4cq9Ct{4PHqwg
z^+8}^lR|i|fa<rhr;gHzm2A%V$7f1`9p{?*eM$;#>{sCR`&z~=VAmXyEHp`>!K5e?
zFM6uF#xzQ}ls<S;Xpk82V-8^2sw-9H-RMc7MdMOHN5`-hSHH}Uz8#Z7d!l6a`g-B#
z1b_70vnPoby;IRNHm;X@R8R=<!`KxiO9+FoD-~#!-v43`R$qc2i+h1g6$V-o;41{e
z@4B|5-w?v;XI4qt$N>H<-gZX`zJWK2?#KI}3H~e}r6<iCM#p9QQzU8a0|G5k80>NZ
zSXuvKv+baD5NMeNpnMBYUGivzYK;s6?W4)1b=-B98p#U?yms2j^cZn~uhk4KJqVmO
zUY3hJ17lE9wZ-~G4FWAe$cyZ)Qpzl|zXE|k%g$s*|9y#i@6VChwm>)-G|i<22eWjY
z&l91&j|ZU8)Zz-pXe&hwvf8J&gFsW86ugNX{_6r42Yr?ksdx&x)?{&mOZ!(rpT#-$
zpncCWM&@mUi-SH35HCFxV)E+(7YBEyvMCM7tyuFh0j39mx5jmSv(YWC{YO#8wE6-E
zZ>Bm*J7jiKm8!^)9t7U1#*xNh-+?5UMX{I9ae^o*a9PU9yZ*9z)4`Z&c!QS5AqQUS
zJ#YOx2naKc7{r{O%NQR@lpX{Q8=pWj-Z+du%PReU1z8rqU>Lg)uhEj6-O?Y#c#u8V
zFE>|}p-8K?_C<%4v$QfAD~efGnf*!Nu#s_S;kXi%uAgf-cLVb8u(^)w)M6YY;;gE)
zWg-VprlW`|v-bVR*cly32!ud1C16~J$v?4!z1wd5INSs%OGgE|d60OyWA>l~WU>rG
zJD3*7P#NTml-GbrmTw$ahN=Cs7XN}AA4li|8rdod2j^rv@jUO1G~=rSg{=5(%*`|Z
z<&`|SM*;#_)*8yuy-eA!zHs&-2zy?pq<iFV%k*2kYB-x-mlG?nRbSsOr3q+bwKkYk
zf&FV;p?hS0IOx;v>apRzDnHY2_sE#RI@`2DB4cf>@a`UYI3}pRc3e)<f@y1dxvlxW
zeh%!L#O9m<Ip>C68CA!CE|woeT57Cx_;cG9J4g8(*+PbqfhM8r)z`(2=N`IPy}2Am
z5sTH)D{HO;p^IgdMf8}M+<YTzt}>vDmA8<LI#Ibf64u<wgD$2;Tf$+<TXZ^LRbr0f
z?OHhJDXnS}7oXRN26Qo{LRZ;*L(=TM=T{l3SY}H??87lRZ8l72CuKkt%a5eMcdlg+
z>Xg>k=)el7VoQ~O<g75;0N?d6MHN)V#MrRX^38R##~L;FfGU>1VWP^-!Z6kU==BJw
zVwE=%6qy+%+luF85i&ky$YNO*aFcvKu8T_`WY0$WfGVbD<N{}%A*U^bk@-TLG5UmB
zrd`b}qW_CxKa5>blEokhyOL;Cxc|jg^ld_auouWMEww@*IVeb4=@`|k?xQWSUyw(l
zz&H*jKai)fi{d|({E^_Wb-_VKBB3Dd<MR1{6B7wTE9-)+<)xaEgW#x@reWE-N2k||
zZi<2uTgku`#M*^w<-1*wW-J&n-=LqA0PGq_|I=zrK#;KBy&pkG@ZB!RBSFHJL$m(g
z&Sa6k+Xd;d1VYTc<8h0u?JU}(U68l+!H79cLCx6pJG1t6gh9cHiAxDnpmB20YS-y$
z#)1<oZf$`Z;Ht)~z6$jW#lVUc*U{yl{jm{;4=y0WP^<-2L)GWywW=vf1xoAm$XEw{
zkj}dqpcr^DKYcoLW!;*Zel6Aw#8~mw{7#f9!TI%4ts9uJ;-V82Cmll8<yx*AxUm(>
z2-2~x;qbLwH&A26x1b9ZlP6Jjsohc(1<I_{wQz1~zLq{}ih|75c5cM~5)6Yo5?ylI
z#=wj%6r;tc8;nMoQ%i4f24ZZXP*J|l#>KR~^pRp9aebQ^Qzp*KjvA&IG)F<=P9Oh7
z`g<ueW4)a|TX14!E96sELI-CDZe}J1O3Y)?@Sf+O6N%fI<gp-eb=?Cje9*4t@W<E{
z7&#1su$7FlW3&Ha4|R%^`#aJFXcH4K2qerglnKNV5ED}Ac8}|ux)8ngxJ1KbpY;3X
z*OrH%$*PUy6~W99SoTyNWGDkd2cpol6T9!EIfn9NI?x2c=82mF6X5Hvh5-Z%{&oC~
zCiB--4Fd!gRW0&*gQ$w$D}aTOf%k!j@#sHzhM}Z-v`$dMShyPq5kS8Qz*@pzvDTeu
zt9H2Mu&7Zsn=R3=D78>-1fj1o&#9DsL`wwBOOxJ`u2^G<;lY7Y`&vfXpfv>Fzn77N
zvHF*DP7uuBgl&VFbzO_)Ov(n2B?{(djsp8_=3ID*(V{%3gu&d*xN_D@xhT92Em2`a
z@n#M?<ZVQiVC@*_EN>bKgvF?`kQrGlChJ+PjQfgM8#31*_Y|cjf}XYg!VJ2#el6k5
zY(H;Um?G95J@>Dy!h)dBM;WC)Yed^24PpNxN{dg?U4~nQ|3*(J6;@*W+PLa29cI9N
z#{kozh8PcTSky$<mY`VkL~c2DA1s|<vuvv@KrBJAn3BZ3M`IlAv0zb_s+O==iy=^a
zk)E~Z<kDN}M<Vy#vv1N)!+iN$@ofo>#WH^~B>9iqoGg*@|AYJ^?Aj6}20_@BtQ9Ty
zzu1y_B<xS-0?brWss@rCgw^*hlwXpnzO)Pb>5-D;#?aoY1JN4I=L<R=w_jZrUu*#%
z>5)gQF4XZO)dKH`l;6?)wwBfb+%7KZF#twfZ2kH;UDd)aO9;Aa=_^|wg;#2+YvK1D
zA?()no)=G5Ky{P$(zUSlB?R5te95`D%FWEKYhep7DKeyJ^NOVYmYN|dg!f!Ya%A-y
zooIHOdv><nHb`YO<X+8b8lv&hj`EhZ&k%CqM8hamYx*og`n45suc>R-Dzq`W7pkw9
zWXUkvB(4qClucs8cZB8^ZgG%eg6a)!qMyg_4YzO$rF*&|LYTRo<NdLB3$`PNV%(4H
zGzJ(58-%ExpPsHylHY~`JjUCZ{v=ISzjhwk5!d5L0Rl{@UzJdlYq3*y)z>svQ={;(
zB~u3OW$>)I)|_KEH449vB2|V#AQ9f!tHkbd6#j{X+e-74b*`McUiPXsMz$KKyFCb$
zvr_(=tw=Iu^*C>Ll&=wR$}j=56+X(<5;WzoitD_84lcIDkt!RN11UXKl-Ye?rX}C=
z2)KJ|$a+CdQ5^~C^&#^JxR~K;p3zMtHf^hJ9u-@-qawy1W7l>hF$}_bxeAD1K>v*$
z?9L$hhfM>FL$EE74BrRNiqVQ$BJtiU6t)AC>{qssKd(z9im=s*l5_+dJ;X^(LjRu)
zUa^6xvB`nYx1t0usw`iuPkd2|W|dV5?RGYBya66Dd-f2EKYPWN8)yfUDtN~IzKlf)
zJ@N-pHffYgeA>9?!L%*`PnJCrDN#hEd^8FDLKYdp5W$GH$KK9^anNLGL}6sBz7-`n
zc(Oy|ZQ`gK`+DrrucY#_)EAbK{cZaCZse<jCp#h~tesmYDI4OT?TrA~Muu7q3zJZ}
zDkVQkgO0Q;uHV8<*-J<-Swj1logf05oQIKx7L2J%@O~}82pOrX%#cz(GSD6)IFN1b
zp8+F_dTj=f>92POw9TpY1~W2PmoThf4UXIRr~}Uo=Dknsqu#%VZbY;M$l;#nRu%LP
z2KNwPqfpou+DM<r2z?<KtXZ6LNbg2O+vS=bn>tiA3PEV3R4V)!VRcqiiZ%<Vy^zO@
z^$Z^VYP}KE#Ez`02kf}#jNc-3_(=t{S){AgTPcqQ44BCl5}lS>MX0DCQs^|yfZ6%g
zLPA9-Gm~BYLShf9JzU{<&fh;{*OKfo48pGDFC_QB*t60pQa8%mb;Tqu5G;XkX6U~7
zhy~5;@gpIz{5uiUJ@si-meD`!NT@{W&zGPsMoqpa6D_#9@lA>Jv&#C5lR%W9tfWXK
zK#4T071p_@D5&gvex)o`8Q}_`Y+bHreNVm-HC-MlQhT^0&L9+8@LY^_vrqg*xHB86
zGqBc0??4VQrN<y|Z)FO|chyz?ls{xh0ULH}WC=o@)#VdCh?Ahnz`HJ)vvWD)7Lh;|
zlB(KZjf5b4+|e0*T%4nUXoLTUQk><kYb(^os`Pk78*Gv)>g>dGat16WSxG;XkgbR_
zs3Tuh<OUX2sbWLeLm4a?u2~}mf$hax+Z}8$52oDR=qTvsUH_a*$TsM-=fXVsD3FlW
zb_f3`<+MmhjOE>RARyD{m158^lA6_X6pyNw!X(yJibF$-JO3c)C+c?Emq*cb%iCt4
z0@@0b*Z>j^?V8m1K2}<nT`#$8Mi2@uWFt@j##NNWpNcXNyAZYG`ZwD*UQm*3B+#JE
z&0~qB5|^j$wlPHhEYRv&VTcdNR)oV_8R9MERIo;{{XiTx63L(K^8uOk++?PF6OhRE
zN7%JpR{(;rl~8%;{)<)GTY~*a7w{Yv5l9Gt&+OhOF4_VL1>XV^d`Cdf?njDO6gtEE
z%ol2O1)km0{mBYHtE@S@KBdwJQ0Q5HiOX@*(s(UNgQk7~=-HYumkjw&pZem|{uk(s
zI|Omqba@C5)czG^g=4#=XtrB6Z*(^WoTXSpnXOIHbsFVC_##zSxIUrcILkf-?;Qrz
zY6~{YU~RWWWIe10YA6MoC07=y;t=T_22LG<f;8@?$cDoAquf9*Siu?p>2UmAWUsEe
zz>gK=TZdXn_*{=T<>4m+_U#;1B)Rd^Z1Y-%(4k8qg_k8?wWy}yL!-+R4DPTCFH07G
zAqJ62{i96D)3O5062mD-GqM?=ixU{%k%56bw9wUD#k~XaM%|l%g4?7Z<D>No!UIo)
z0GOSvtHPeJE^u(Oc%wHBz%1vAmqSPn?rEc1Y*NDoVwO={Rer8h?8*dZ{FB2JWHz!p
zw_I%&5xft0Rr&&~``TjjreegaOUeHrLrLN6f@Exu@u#Ff4aQMYm@DA2^_{b_xZ`&;
z>gcJGSlrk!daDAjZaDfKWLEHWe|JH@gUB?#$O5$=EkjWxn=i($?b=}&gsl|(z+|+$
zeNEgV-5<3JaEOf^Ko)w7tjLfn%*=MJU+;=n=69VnR&>=|nAzSCCnMAg%dT{2BThW3
zy0ud^4|DW#1f<Lm98nvfDy(R>NZ?hM%!QXFN4(k*$up~q#pb+q#SCuQLlG(?wv1W;
zZZhscEwhLTPb?bu5lkLIFw2NCkz#CyCPLRAL%g!p9X2`yGxM2*P7jDywv#IuaZI*(
z)IX$+!P^Tz8Y{D2`eFm6ECoaYMyOA8w=cOh7-jQ}nfyC~u|EIHyUGI$LfOu&>WYnP
zfDHCfn`OioOqSbQGw8P`fP^055BdLE)U$<3*!BdP(~s_lTv!6hu&$9X#$weExg-F|
z{K9*jeTfl5e4TN`!bpYdt}1UB8Qur$Y{(r3N;VBsQi5g;Jt`Y=Zvc{wGq(5R2t7O5
z^}7D~0VEp}6A2^Ta#mH<OX7$UsAGh+8?w16u_3PkfMnxPf!;>UCs*q_UICJ2j$NL#
zleYiz8ev`FlBM=;ZE&0D$oG6uBfkb*GDm(B#G2~U+7}ZQt@9lGj~_hd@z#H=n}W3-
zS8o&O3ne>39z4*<;wp}8^cQ1ibR{teLeZ8)M6mzH7Lr*W`5`G_I0G?8K<>MVPQScs
zNnfDC6xqeoN+SywQ{VIRQ~J3$O&CMp#?Noomu4|U7Q*7NAtl8(S=PS17$VyudBxC;
zoCNW^k(a6}+F?h*6V+KR&tHJY)<&*WyMK1u2#z1urhgY!8i06A$V7+8)Tx6J?G8ZM
z3-hByW=p>H44xmG{z};ib8l2oP%_=8HvO$Ng4HU5I$J=_zUo*gjj~*!8RQR}3!Fi$
zeZVxza)kt5s10fnch#4;;v}GZmY57|B*ras+>Kzp-h80{N*#pW`6yFw1YEC;l2l+{
zaYOx5ne8JBvKI~Pt!J(Mkiuxc;{>YWG8(W_Z_CGkMRz|$2~fpoxxpiSWRKGF+mygm
zTvQxVDY(C=2K5es>@`ll$nManR*c)&f~OeN^o_qV<;g*8w*%l5Sq(-uRrS-^&f_Qn
zrpO!p^;j$zmJbOG>O%`!(zGOK_=$j5EfPpu1|=#Rtttu@vbaJJx$SEZ0YAez3a7#6
zp;{wolTgYYm<LnxG_Apem#SUSraFWfvW=nCGhznoqY|sz07sEI@y};ax^q<sn#c3U
z*tKO@41%yN6<?VBZ)~K!lhFC#&IWR<TERqun@Y%{Q-l#??%6U!P=lz1Y>@B3^}Kf=
zLomxs$y7r&N8@>oP{S-!1YWPs%fwb=LATr`qCO_&py)|+!u5D0{mae3O&*Hg7NwPw
z{36>QdVQwIL@{&_7l=;%+s&X1V)9U25r_q%N9lKmh;of(p@=@nN8$Xq!}3#u@^j>%
zxP6ZVB0~0CgNWx~|MiNst%=2;e)g?D!~x-!b%+5ysgn}XyFEnxIkNrSfIbIpyxtj<
ze=&8hel0$}Kr<&Db<+g(3ezy@1YHKOpeX#+AhbM^WT1$rUhV@jWdss5!LGlC8}>{B
zgCHU!=19)1tE6E~4vH{eBaNiJx`UQ;Le=Z!-=K3S?zi0kmG*5Uhp$c{5K(&MS=p~g
zLWi%DF0m{yP9$X4!IHB#s$TKJfiWH7Jl3+XUt-YV>u!E7jBVM)pyca~s@ItiF#e&p
zg_o3G?lsC@y{!bHzD@m8?NUI{-|Hl8q#DqlvH=<xln~GsSqb5qua=c1#*{_UzS82R
zqQtnKmwd8O?&@Pu?LzPAet@!I`9N@|_GKh-!)791&i{nHAIh#RTVfD|ZOJF<)@Jn=
zYE9^TFufb#sHKPmk}nhR(~^=~#;#5iIuAb!a4vQ4iUO>@C#8FB#}NL@y}Ou*oU!V=
zr}-ywyc_tbJ^)#1(3^94=v>18pVWyn$pgxnZ&eR=55|2>4649c=xP2*9NQq3{dSjQ
zLmtR^eCY`jfx%&EgM-GS4?Z@+%(XN$0%%fBk;$tMKD6P;4+@V}-$o>*ux5)etP0r=
zR>q$<Ov|Nu(Sz{M1G=TTP)Fx(*}R;eo5aHex<Vrm#aq26PLCIge7~_m>cmnxBibMQ
zi!CJo9@$YR8aFhjc&S2X(I`$BNu8*fKOENNkEmrmO8&7D1XmF^%yQFau}T-ZJ>ab>
zDNh=i_5DJCZuPbK32(@Jtn?2f$73}OpYT|zTfFge4(rEmj>nE`=!&!FZ90yc8Frmy
zs)-rVQz6%eE1}v-Vk0aNIPE!gH5P(ioQY6lYOpWDb#}kl4HTaZBS0JHX8E`;@ipR8
zh1_#%2m`hC?9hU>M!Xd$=k~=xzdd_?Or$uO0JbH1a^U;b6mNm}yIMa&7+e8v8Oxav
zKiTqFCorzC{~!b0vZ4{{jn&k|(Zz5n1lK>tuIN~T5QMcPQBX>I-9NdVBYd&f0OP8w
zn1s+q$<2!JV9rt{Ve7kS2h$5yB>623{U(h8om>8wv3$4d7C)(yGTkh=9n+sq>P-}@
zjk|a@-dAgBO@r1PdP`DVAIg*t({4ic0qFN^sRM&h7Jg@_G_RiMV-SX2lj^2uHitTp
zE{2!(3Ue?uId+P1kMyuwa$GmJ+UeUEZ$Y}j!k+V~i2@es6^X7s7H(gF8$EnVo-4}#
zS<<GTii8}B^*KG6uCU+NBJ88KHfE*&9xY;(G-tACEmpj)^<{mmc>WfN)xu=%h}kDf
zto@oHY+-p4O&2k?zAQ3D1k)2lT3B=-x)Zyk9|>96F%Qp_y{ynF{k4PSx<bWt_|lo~
zOoewZCBh&&0G3eR%(0m0$?(w!$u!n|6xe0+D7Z;7S`-(9aF(IKF83PEhrLW~1@1_)
z3!w+!G!0_K%jXyDgJ=oD-+0ks_r@6d@;Ph>a!7UsJVpY;?mhi7v+M}63C~56v+EzI
zeURL;iXoIm+za_|jgR+1oU#ZdWfm<8w5)OaW`a;xxae3Kr);AA_IR#0F}PzN2f)8C
zX`Ii4SYmAzfe^~Lr>%d=t}V-w5QJ?>KvDO<v4*PCB=bW}Z-8?zD#arth5&idtB*sT
z(*GZXSp#`p{1$w^qHy2+JC;d!W1y@Y#prmr4x}{#()zQ&H^0Kq&KIS33RVx2<-Jxi
z_QtIE2`T;m*|blMQ%<3DbhrJZ<Dl5}O6Z&b4=YQZ{PN)za2n)vvx>>6d7wUVKX8Ex
z(J;^JLh2KI<Gk(DDb~F-lD<mNAJ#kPXV@MQ(IswBIr+rq%{aMdbXz0n7`$EJ*R|$W
z+g|@;WwO?yK<h;RNe<dmRw6#qO<ZPIz#$&FVSjIF+bbMo;5vke>=SF-wPVG$*GWdt
z;)+ZCM5S+GYvWXTJggqjOu&Qu!Lt`uv~EgbzX8Agwqk(9UIjgS>cSbjwml%DXgeXi
za$aO`#mN>Rs5S0#5g=+J7!7P<XUOh@ZOyw<JqaPs=A=fZ^iVd%ylXffVMGQ<SSFQ4
z{|GVfib7RMK53(Wm?MtfNF@kSYbylz*1?2UdNjG#yek6}Bn50=<xHgwku~m0CBsdm
zAS5yRSyQTAQj`XP-*~A<e^D&5+V+D^2stbG<`V%%iSg<Wr{-Nr{5NRnS#jA??3O#T
zKa^byZpAPNyHXw@Npt^;4QGnYq=|JGsQRJA#(;mh$_-gGfhJFOfQ6aiX#G5$_cG;a
zi}}j_p7k3gFON*iKF~NucHTZYtww<qy=DX|DJ~@EkzsA!I$~741`O5Neig)96^Iv4
zq_}-Fz0;tTesae4vdh*eePIHs%dH+36g}aU`e3H|HQP$B*IU{Ucj!y`15p2h;T&@U
z_DSkY#b(;F3}_U<W_*Vs({8vRdBRRLfuRP5$y&1ig~c)Z{YRn<=EFCsVE|EQ3H?Q4
zkcSu=VMzb6xaj%ERnlVRPQ$E7)atr8gRW(hk5LL+NC&cuoZ7^6l7IOJj6}&aH#3_{
z3V-uJ1Paf$;rO*ylgadnx%vy;$c3Gw98QCt5rQEvl<jRsG0eBNkw^ATqk*=(=5^G<
z0=*hrQQ}a@v#8z6I-XGsgSNx+Su>2qT4Gc6Ivk@M=G!{i2QJeDS)jy}%Dhn!n`<V2
z(zTNI3PM%>&J@HpXc;#|W2<;i9L9J3g&4N+a;0?G9?y?rUa#NFjoV{LroHn^GjIp5
zmtcX4*hT~3*5I<rijlVeintrLz&h#!{`4n}P_J4;GAd$wc<PO|HCsjsb$R7VVqb(^
zTb9Kj2;0#d6>V|<8yi!{K<6Xf0M}lTS0Mag35N#-LF&DQlb0xABP8Z4Mh*&O(AitA
zIq7;4F|lbFYd=Tv8rk7f8<8?PWt2)64<A%=NGYcZ8X+;qs-Tp@L?`5<CsNr6i7k&_
zIGluuvh)V;`_`XxG<Mn2%1EwZYC8Hss_6;<Q8B-)#W+vd#NpJFs{fN2LX2}G7;23P
z-|rVlWXxL+mPQAsrspe`dQW5wUmktLqs6fOx6LOq<~`;|9TuhLTAuV^#KpkQ?k_&J
znhm6saTL}cI@@!QtJRUsqt^NW#X!~^EsT3tZUli+O^AtsVmDgC)~Pt9_!MXK-B4j|
zx3L}mn<zs-OLT-yNbFia9-YXb6Uz0#p_6}tVqW$l_`e4@({vziN2&=?G3-I4jh*PL
ze;I0d$3(@@q)Hn*fi5Lz+cZo;Pz=jOEQB<x`F8X{7#P4uTyc=xxobmbQG~=+#+^Q9
zMO>Dju$FNY7Fz&l9I+67yv($|n+OW5^_Yt<<yDmIAD6>K%+mI~r6XlnuAIpSNJtD2
zC0p)%xrjS8AkAC<DU&%%n_S3=Ufq@no20QfLSifN89~C?HwF?y{+sDv!mjAJVi1O{
z1Q<iS|6;Y9KFR&4IzW6mLO@7J{#^tF!XoXwhqYePOMBUDknl>ZhwBTwA~^d>AR&Q4
z5zCVWxvD2|I)A@8^?g|zym%0R1l52E>TB+OLo)gXL9DvwVX4pOdZWj+<XUeK#L75D
zx1ygG_f)O`J+O`N3V{3EaZcZd_dg#Pj8_bvz2ffMvbD|rDH8Z|*kvv%N)3Ctzexmt
z*O)wd&DG+Sn)xM98xkbhB;93Hj}noeW}J?Yp)3Y9%%3*{@`G>KaI(7e>K8Fgl10*?
z3X-%gB=zVjn68O}8QOWAX`7bVB=opqzOF&bNscQs7-vFt$=w;mu*wr&OpDr^%?O{D
zbrnUpz8+eF{Jj40pBvtfwvHL3u<d6tr0JeXC9K@`x(McLd2JY&6SouJPslN$5LPPV
zY!j9!Y2T1g%OHeR(yXzO$TB#N=l9`279l@7V6Q0q48}E~PF($o7pLrSFb;Ko^}ep@
z1r{<`^&i2&dJU$xSCM@PuR#b)loXqik8j@I+kT~jWzfN@*SfWNKiaEo9im{6!74|e
zm(F*P_^6JRQx_qK9rR)64>($n?(&uEkKE?$;en}AoO>0`sTy>!>&6}ZmeJ=k^S>y&
zqAZC)5OyV%DtiBmt!ZZx{9(Em;I#^h1d`iI8a~9qCT6=yvb?N`Wf?}&H<Ov(T~BA~
zmrrt5kIT|hUm*}SZAh}!z#DDxTk@lcNEjeslX!EO^@WlA_8}6s?+W#vqt)kn4;~qz
zFz{CumC2f$|HF#2VpqNE$x}*s-|lII!+bnM(VuXhLDK!jx6pHU1P4XJ9mA|TjGC`4
z!LU(g;f0E<+7IVXe@AH8en7J68$^BA5r?V65e$PyC8u<ur!Cz8Q~}Z>LDOIRvRdlf
zsVZFDpOPQhB0a>g{*V}`Mh$N(DR5+>J;X``#<s2=<$c5D2c?w48Wabmmr<KYbAK<3
zYZlvBGq}m|&oeIf6_LmFs=ko6j&05xAna1xLFWd6M$X>4tVj>dHTu63sA-40r93az
z)khn$3<%iNKwX+@r@2Watc_Bo!V~p8VI++nLSSoePEZ|RL$t8lNPb)s0YgEhiTb*)
z)?Y6y(}TGNb0%OBQuY05LkX>vC4i>YIAY-Wg0Sg(^$})B)=~mEA1bWGh~~hSCQ=;*
zQV-)-c?c8xG62}DTwGn$a}XHIAGTlY>yNT4%90QUVOOd}1nz&aExOahpUmzB`n1Ig
zAte3tEXN>d9c1AnF+ba_uayYWbMy;PAHwvlhB>f{6d4Nin8t(TyrE$VEP%$=;cz3m
zId}44AaS@#5@<|ckHy87iqUxm6b{?NbF)nwD4cvSat$aOjoQ4*Y&O*O_f6f2thbEA
zb_C1UBAP&G7pZb$j%-!2AOqht5FH~>ICSvNqp9X6WA<`iF#;9^`0`qn5++-{N_I63
z3Www2%YL|~>EK<g!do9PL=JsS`0mU}tP2kbq#FFdyy$N2ZYuz_KuW)<F-L~H1>gsE
zB^d(5bIITfmS-HOy$-lxbTRqoTrB`@8Pr|Y0{@r+Gnj$3=N5W^E0T9Y(R~@6zy_Nn
z6g|s12;M5~o?<WqYklmAT^ZMOhTLViLFceZb8sbgd)@RpL)slLYdJgk115^5b;c$Y
zH!R6~@tJM-U1b3Oxc62bbHd!i0yOJZsRqD&m`k>V<w+Ks;Ka0WQ}LxDJsT{^-DCKs
zsP(+-NgS##)5DhR8j6t^_ZR<G!-u4H_$ViTW@7v#e&_fSxCv3N!vc2lvn)ASbj0nr
z%~3I7_*_Uq?_b9&1N~v_%8n(5L0C&ZFt+<|>{-dK#J&%b2ACWk43ZH4qi7`<eEeCn
z!PdtkLz;gUc^;l@>sl#a!aibuFs<)ozB=sqDchSiLX9#Wn%W(uvy^R|&S!><eNzHS
z5Z1BS*+!}Mx;=5ebVRyL@&=bbV9d}o^!aTw?6KP|N0-Qboh!`MAXJDM!{2%Muxz{_
zfuwkFV*oJH@gsi}VzclAVuw)OsaY~i&*hJ@6{JbvQ+?1{8bMOW858$ar&f}k8(Jvw
zRaNIfs=&V@)$5O!YlZ()8id#^*eMDsJ2VRYZLYNvb}w$RiswE3XBNfMAOvSI<zal3
za*kWnQ>G{1$bT6&d-JF?K>9PJ+MQ->E1DDcD9c14`1b4@889CK$3JJoJbG8O{0~Vu
z8=$gt11u}A>n1CrY`5lJ(J2QD4CLB0ie|!~Xl{baT!bqw!}PG!kZQNGKFk2(WLY{d
zZe+orKbaEWHWkO0KwzXnI4+K6C3s-WU@f`k%!34zBd7AI&U=5=7e}dH^N&Ksx2?@$
z1(uXDYq<IjPouajRaaA9@fFfaOQoGg8tk+`0##wkC<xwn>8Ys9$b+4-TE7R-oA=nf
z<SC9s7#M(0x&KGm6(vgyg0L%zV$u6w>_NAius_sy0jGmhk%Z({E?Xm?lVyuaJ28dc
zut9Byl<7QeKPZqeQ=R;m+mN)#kdlwAK*GNIHP2<Jo2puG6TC_TFfZU}5fZnK*eUN^
z0fmK@9A4bM25lqmAE*v3_=oKS(LS|`NXwm!S$_$TuxaF}T6jdQV<j2|6gGW(l81{3
z3CR|Gg7R1a7PkD_!4$nbU@Ovg)@chYEPNjo095;^db19!)&LTAT^|v&FF$l6v<FcE
z6c*YTo4$2Iv*|l3Wl(^Gc^ycYKOEY}KfZ)IGTU&w->Yz!UlgSjI9MnYB58ZflIK#t
z>}Du%u<hBl2utWilY_|o@;Cqt=65E?%GwCy=AQ}C^3)&n^{~aKix+JP1~V(!WeOB*
z$2cd3!lG*=ryVN=2)4DM58+SVora@rYaLmjVBx7n_uz0$+^2aD5G>p~F$w93oVwN?
z^SZ<U2o_W}Jh#=)g<+>0L<I=e+axN{S5_pBi9M}jf~vM9cD2`(6w<!)Ug~d|<nqfT
zLej>S$DT$V74T+TKJoWOYKj*swYrsZ989JfjaMfxpC}LNyjPAUbSlGz_hh#>{fIxt
zt|(bT7=&G^MQF?YFZRHlm*5Y2fOT}MEhHr2MVuGeV50RLr=lk7$hM*d3+6el%{;V=
zzC*8=iW>98=b*n_T04n-9nw~?V4lDr^&0-r*-6j(C}^<wS_i(LSP=$+zxN!V!QA95
zh7P-Xf$_W*yef0QqL(zJ&qrUjc`I+S4+Rqzhc06pqcW`W-P5uQ3MMR#5`;EAW|x1(
zAe2m)PP#(HdaG6aN#C7<2^(%Im>3r;0XzAkw2uQO%!QR`rbCQf_Uhg80tzl{#aRj;
zn2a{(jG6bw911GzB%;q)D$~h2XTD$uB*P@<yHOMWC>*Nm+G{|Ykm6%w%*Pzx`_e@*
zjmly)PKjZ<@sxgT7VVX3v@nkROp|F5(vsOqJ}izwp<31lO&;$~p<kavwZ*19A$F8~
zYU9&>fFQ)uMwkEX(#M9<OZgRqSO(N^7C+56XFb*1$JsQRyC|88U(NY|65CxCd|1Nm
zRG?JH%DY->UlkByOAav^k5*kOHK#qs1VYT#7zM)^L$o40eSrZ+EDegN%SjEVer5P{
zQz|}--E+=&%+D<{eG${dm|6)XhJK$K{rUi;joNwfPUPPy>yNQ($wD9oVOQ!83irR5
zV3jZnsY@5~rqd3Eguq{$thuC-;?0_Oc!&jSv?~}fOU5MJn`=MveXO;g4Mxmv%N0?I
zxw<KjWW79Z!HAiEQ8cL9DWN=}TWuwEI9T!h&{%@L;H^vjP8Muv2c3N8cYKYEi;)1k
zIQ6P)#IsYD9CCeVC0BiK^b4Y$MjosSWQNv=VgW%%vFOIg13N^uXMzrl7&DbzBh)i{
zRA1{shmkNk$S<>kTI<p4p;-&f5rz7LsfU=wHo3mn6<C*YDEKY<8%_4VVzL!%81L3F
zCBU6g?#fXf*&xH%2RNf*hsMY*zYhNt(ZQhszoK6x{O?4rPJDt56IWja0O<c4S?gDF
zP%G##+teAH8vBTMv|ZMdW))UKyr=>MV;%eoRRi^tAUJ44F{FMDKwWoOM>PRVDC+PJ
zSrWkX2GoCAA@E_AdZ635UCOB$^*&%{VWnp)3?MOec)PBMf)Ue}m>)ZQ^z6X5OC$5D
zYH^7`FKr+^=s-062X@)+6s}i8S7nUfZF|<siBmgHh4BY*=8atzZ*en9D-hTy$AZ@6
z4X-awCRX1ez4*GeYzIORwj~{m%KkTY;Z95VX*R&=_^3cgLPpq!LGp>>vk7h;Jf;`d
z*~TCbGTshQ8RW!0m;HQ@6!w$tV@V*A%R*MzPohqCj<pC9NDG_uZc@7T0k5;Yx*;M;
zr3m}A%=+3hEk;R0N4?RL#M{+8W`@xLD56|#yn}+o(t3Qg9Ghh>Vo~ID2nrF)`RbY+
z@NIsY5&AIKAH=5Dq6m7FW*k3=oM*f154w!9>RHVKuj$d=<8s6bB!{KYLggB`BxKDg
zb8L_r7H<%RWH&C=f;?N2a%mekY!$TN$nUA_%a0^vfz&X(UR$-W&LB1=c8UVT;&TS~
zI87{=!ePnTDv%nMEjDjK3ZIA|I!8d^VJjiZx;}eQ-a1kTt!4w_VabiDgP#%!baI}0
zvKIx1B@wOFbAy|cNW9)0av9HHm75&n%^-RP0_257;nEKMWWP8Pm!t1rfnkwD51Q|!
z7F3mU>1ZUEq_D7f&bGJB;mq3OaSY|vF^U_!W=`K<LLNy@@yU`M*0KXo-5`z$^>FeS
z%ClBj7$!{@{h!uPBOvXI0wY;`7}X6j!K}g2XK0-v5DFV((30r9Z_PJ|7D0y*zMW6A
zii-ae&^{-nxc&$`qa!$C5QetowZY*28w*@A5?@LK%%10##R&9N5RA(77%o%N-a7`A
zNInNHVLM4gsF&~1y`l*qG6;0AN(i(P?6&v7UFb0khYr^Fb6RY-<-v$?q!8_NM)YT>
z+upCT8Bn7C{F*b2E75xRyPxncL_9g^={B4=0tOg)GdXgdp#e*7ob2LtGTX6bj}5M)
zV<5MFYaq7ITZb3hYf{*7N?<GK&X_+Y%II@_`bdym>zYC4R6W#Y@7$K_AdfT?;&-x(
zdmCPEIxmt2)(s0Zmnta_LpXCuu5;4Bn$gHE@yeK}UtRG*0qgrC-kZ!7<gQlrsi!X-
z3fS#o7MyIoEMs}G%4?loA%Rttgrt}4!%nlk_l5rYK?A#+{K-}qh7;n|?(_}?tlhvc
zw%WVDnB40U_Gk1iq9DQgxMIIO$Q!F_%ccMNo@2`!1y08L?pUo34SaIvuJ|RZDSMKF
zrG13nqH@S!b(-Ugk-?GR%9Z+5sDhoOX_Ac%oBAo5Y2r}9u3HkCdTiw^gmuve73?;P
z2<hI8+C~?`I)-s%=nanL+i(Z&>Qhe3Ik{k!Sr<8n1e8_r8M^xc5$rb5cBnmzKux`@
z?w1SVxsr`P`~DDiMaL3^Agm=3Md-h=2Y2%bU%3XDUDwq>Ac0g$A_bl*8N`kholAwC
z``RhQ#}n)3zpAU@;AJ4}Q-F^aRPUg_Mq^B#lscqEPH>#n^w(R%#3yfFYqnL@l}hzr
zc!J466Ns0!o(+h^Z&7%H$rs?a?eX#fE2vQaZT73$+i<LjI&8GQ<~1Y+JeCfIb3$wZ
z@FfuBr_r1TTRzrx<2ioR44e6?5W}~14{M|%|LK;0(BW_#M(!TRCRpRE+PhUA#zIRT
z5@|ugHJ<pv7ECS@YQOso*!Xx-4p%Udz(hc(PPE2Pc$k7!MYYGE<Lq@N9^ktbreJSO
zm**V?E&9R(JX3PC%RZRu=8~X{S~odATcLg!-)iW;grdC|H#yb(yv=%*DbvOejB-{r
z(edy5V78`EatutDuadTL9%RbK7{o1Q@2PCEjK56`1x0|h5?#In3MkJWoAvTaZJ>j*
zJ$zQhXpB~k$zQBDTP7%&uKN_lc<HlAFHh*9NHFv?<oi^`XbeRR?-sj4^_^c77U0MR
zq}O&qkgX5Hf)T&o2Ao%Dv%RjvUP;O)n|~Z@`YnGzLtl+SoGYOQue5{l`XlU0a3lyp
z;Fm<(68`_OmF)?|CYzcM5Zk_xx>k&m)_KM#bBr{!gW@j8>mF{HH+=8Yq?R+@&;U`S
z$lXabJneFvzJ=j(c8UVL{5HeI(!0lKkW}+Lns$i7yYlnSZ_-#ix2-QkBNW<|q$i`s
zeD0Q7Jf#*IgYL3plS-DbQJdZ9AZHZX<#0RP5j#!lk*qmcWb=nn=Pge<LeF4!y%10?
z(rh!58F%`?1G30rYU(rlmb9?oH&Rg)aY|081kHe_=vF>UKWV{q&fw4QuivNs<-nMi
z@J4BWieNRhFSIW+jO;BRiz_*_l1o@nI*)>~udtTXHe%MJc9#LEO+tZOc~p#++IWaI
zC&=|>DfPf+XwGE5=RSSPpl@+uT#*7_qYu_*@?7>6CW{nB)<_OY>$7qa|An|@<A{Q|
zGR2R*mbDPdCuI-%9@hu<o{G!*_tW{ZvCs<%TEMME#~Itp`-nk*PAK|9w2k$5%h^{*
zh7l&oTZ8VuxUYX{v9qs`oiGaHO1dtK#A(|9oUd(tL5n=HnttMR&zR>WR*M?+oVQst
zCEU&;c1PRf+cTMyFitbB4_E`r9w|FUVO+Ne3P!m_NQz5N^nd&M!`QVQNDzXsmV5we
z|BapO+>*>s?iyf6*9V3qAjYE6kax!Dpnsh$-_$Xnoe79HBgwk)U$`Tx#FbQ3IFw~0
z7D{lIOsAttT*rv3o5JDRfS(eVjL}KNgBh8QmJgZVbp0U%WcdM$6?-1(mEY(aqbgjP
z)I+^CxW%D8#`+=%R0s{Whj)~HaEZ%x5L&Kb=tdJ0s7V%<^uz}K9Ows{d3z-|dR}X}
z`aEEM^#?$#%F@vvQtQ<N4#K(Q7xzz=?B#&g%NH8o-9HCD(^*=Q1?GU(D_J8Tve|r<
zmh{f4B3Je{z%h_^N1f3Mc`_P$dh7*_qc>_l{$L>@25dSXX4E$Z^i?0YLXQR*K^a3t
zo*qbGz5g*5r^YYTnQ9(`V}P4{KZXGz7+z>p+#jco#lG~usUp{Isa~ke#B3R7TKY?B
zxwhd2^jiXBhcd0X^-`<#+8*TR8^s!@TADK%P<q{sTX@C2KkW_SNDfap<cZtKPODFJ
ztg~OfhloN_uUYy;Pmp>L6R7ET7aR}MA-0p7v2W%R>1i>_PHM5_wL{a=x2Bs!)w%9{
zyPeE(Ph+dkCh@+gO4q(;KT-=H9OZ|wD>{@I1Ys*xg^2qv_R7;5zH$q2wx<+HNai+n
z5K$)oXeyv4!(kPQlxCdZ0$s_dpgLw&JYJxoHguH5rQoI}3$SSO=f}N?(_YE#0C#^x
zDcV9`^TBQVJd<?CP8FV}rN9Bs)NVb`6C&vNmAxQ|&Empb%NH+!=1~Se-;j??k{9P%
z$5Z$-*7ed0YPuAr+m~-B;!JE7UxEKtkUW4F=X&q0G*3>xek<6J9Ipac7C7~h^1dIf
zKtn^n5$@Lg03Wk<aJ=f>BDyC<t1t6GVr}Y#^}++tL5kJaqQZssM!B@ql+}eFt-jFd
z;M6-)QtEC?*bbB16##YHthE9_{CFia`obQ<`GQzk3GBzy-0k{o;fQm9w~_}dC7BxO
z^pz=_L4pJNS^emRfPD`R#jn*%cWgGD1&YrXaLa-et{PQGS)UvFe7#o;3h4W=#|sOm
z>6Ne#i^1=CT2YKrDoJ`gq9_)CD*V1$%u*^zIv;5Bl|N3RzKu~UCA|=i(ryR1BfyYc
ztqOJN%vgNB_J44qgqzo<l<wjLRW>%tccOTZwqiLotfM%$JvyJL*eP0049HV_!LE4o
z$^MrA5q3pc48tJkN=a;Ly#K|fZ6El>F5tE{Gl+<95Z>kWRqj7g$Zc(+YD=(3OQZ5t
z(Fg93D|nO0=N2{SW}ao!(D%-1T)~1IHiNVoh`P*mz7LWGbcQu+rp&b)cxj3($QG>I
zoBI`)!c`R4G-#|=>BG3n?CpbpQOZ9<zM*J*K|ns1sCJW*O?2$~PZY$mbKp|9h_;Kp
z_(wT+bF=B?ucR33BbqwNJfv#tX4fmOxfx}0@A#u}(qv3DR+dWA(n&>!vihm;+)i+^
zHuvTPL?KyC52Ndq#W<-$OHe&}UsJMeKALd>m4-G}Gx)nqV`@j&EAvX*G@18eN3zmX
z!a3tL+upvyYO7;eS?>F=R@}mhXd8qy50cg2gPC?6bTwB=-#U_AI>=^@ypRo6mQWxb
z9$mZsF@Ulo%SS8+xp!Nj6nd+aqv=(L98-zqu>$td=l=6V01eKeap@<c25%@$HXJRl
z!ro4gjYa8Z@rH6F(b4ldiOq0U6RpsH!QWlfA_iA2&*mU>Su=5{b0pskT3(sAIH0_0
zhK@nZWFz0%@`~5T4?(z|wMYb$LD=y!P9Eh)H!qd~vN8sV0;Be%W+7>^q2=U1#?A%F
zVGxF)SHh5BeE*9rN?Ob5%&NVBr_F~LOFW?n9R-Utq;afbl=|W(ccY=;Jkm0PBw&u~
z(8%f^LR{Qx45b3l$$xER-AIdz;8xTuW}W%T*QT?NZRCaQr6V3~to$>bZR{wFDH~*w
zf1UU_35T=XUyHMtm7%T5U52OFg*jxN{li*aP*vyB4V$OjwV+}qop5>|^#q}YgnBO?
zn4bI-1OIzg)0TXRQ}5a>bURrjW@U-#j7d+yYZoyhD0h><ao==p>2VSck*<)RoH3av
zeEGojQeO#&L@6WIsy#$nc?j1BT`*jycLUlU60K~geH7akGd&Cph^P{+E<)E9zJKJV
zTDlc4iB>;vL>$JlG&%vO#zS|Q4avuCFlKqtr*D{U74w%~+fwuLSEA#a^j2^b5!!L(
z4El<DzWXY2$6Eh3@ADMB95ShqGHT9)du~k^NgoWhwYeH#pVEu>EA(|`$g)|6gY5eo
z1ef%FnFs$bLeZ-k=?#WNfzBc!oq3+37c`07jqWaw5ZKF=F8|I^tg(GEcZs6c<w}=J
zL5f~D2*~SdAI+BQOG488nCY?KFI?d@j(f~0iZB-ZIMTIjAmGnW8`>XZS9WAE2*X<9
zvJL$=wwTPb%*QHeAVUZQVIBVeA&Qn*$Y=8gk)O+K7OdCfv;IZA^|rG4kI!nXR#*-^
zTKy(y=@X!UdE%IV&ydlw^^bm+pt~F#;9XWnx4$zTbR@xcdDKBblYM7Rjkz4H(Z5lU
zT^_!r=sVa~xzyxzy(89eD6Z3I!(Meq{yGD5lFq)pnI%!QT&QRQjp4BPFYbZV*%Dk6
zJ`&ABMU14T25#%6g{TG5WiCMrQ18XW3$XEZ5;E?p@MqVWc-{lp2LHy%c7QN|>iDze
z!XvHU7#v-w4iwb}5Ab7`qo*(|T^>si$-G*gn=$|!<qr(5F4z0VXvAhmnv6^BdC5b2
zYW<GBA{C934o>2WKL{@qq}lFW-Sq-W{3wR8%kR&THn(>ZgssOgNB?fHcI^`*B)0x-
z8`4VLQ^@f!>|Nf9qhfYtS=O`hX_?8qw-6(?!C%Qjd46Moze{>67)lXXW?lttW>~r%
z&8^DmX4bz-+6)PYRY0Tf6{0gP`|s5)L>zi&hKTPP9uC_-m$#5{xIv1}{6-=4bL>Xh
zYYXyA_W^=U?F3p`8NBg%fsI!F7`vil2|^gulDcYQ|Bb!GHxt+&ZX0mCHF`t@40D;$
zDeS@MP1cJ+NV_2?ic$J#FZiav3k>6&%<E<zyRZ8;y+&nKaLCcG%}mW=1gEzVslB@6
zyF`0HezMk=e9>tn_Zoo4Et6T10b_mZsw);OyL(5~1;$;QMUHZf9O?FTl^HW>^;Gss
z9Q8!XU1QNhpOz`x1UQa1q%fy&`&G?c6zV^R`%R8#MS`t-2nHY5bjcwudrD_ogVAAn
zuT;s!AIf8FDDh*N4WrP}{S4OVyN0GD`a<?)zd_~S3^ojcuPDn!krCsCC}oix6fEg_
zdy0r&h*IvIgR^$RaU}N&Ni=qsVjzRZVf=BGl%SJ;|9$hP$9Uj|Ng*27uz=tE$%Q%4
zem~%6VvwhV1ozFKtdL^9cI@_IID3k4HUmmMld{;jPYbF>0%X6KY*{76d&MALGUc?b
z$L+(t0o1S*iC;<e;!JA8ynlz3$o#T?9LG{$iyatrW9SVgM$3>xlZ1FX>>?%?$&3HW
zsB!elX+!>ewqWpLz*0X%xy=Ku?xiOs0`sE4=1LRE`o00(8sEMR{fj1irqF`4H2j2E
z<NA^1Fn@$y*_8t^2y4ms#GP&V3&{)8d_-x0$v6xam-O8X$hQnLym7vcj%#*9<$vvs
z*td2~9HbTSyk{yQ=ZT%D4!yzeA|0yjpjRnSzmOA6+l9u+xNgRye_L9CVBMVcQOCU;
z5b)5RglxGum=06MZ}COO#1ML4-$8X4As0xa`y5!*JwMhQ+@M+47Qx$y4G&5&>AGM#
zjIVf*d|v0$q;(m)9pYbiUt~jVVyW%tMyZ47u)QZ)K2hqP!*hhP>*>`L%R#@5)WNBS
zmMa(frxfqJAJ9Vt`igUK-nlr^%Exg>N_-*JT<7}bQ9}JfMQ)UW%7-M;ur8mogc2fq
zhZOUi73f-WZ4$HC(jo=kp=-P51Y93$^4!~y;MP0zK^IEuExRU0O~<K2H|P%I;qct}
zn(Z+ChK^9+J6sn;XOW^3U`QY~q!Fg%g5c>e(hN=@CVdWkhnbh5s6JVze%sJTTj16%
zNIYJ`YE+f8rj1lm*3GIa5k?I1Y}tv`X95PfJ_Z1;A2y;VnS6jjZWp;<V9|RYKum_o
z>WpQJqplB2+KUGe+uBOW-N%()3lFy5iY}<^$>k@n)>xJ};j$@WxfzGaob06v{P)k;
zxg9zT!Z36t+q}&Fi(MRgCFjTO0yHH71V_lXm6nc2JSsNk+ZVNM+kwYU$IwwP>qs92
zhCVd5yu0fFWM{-=jjDaTQEENSH70d-9cc_%>YB*Ws9zJaI)$m#DmPL1#~cj@B(up#
zkBD$;IYy&A2XHX5D0u>^D^Y+br_1)btc8P;*|-tOpJ!Pqk2Mrj`HDcvj(l^T5bmY&
zrm1DGun<^i?99n{jU!TB>qhYH_PM!JJUR>u>(^9Q2Pd<ZqTm7@^3bTSdg2ErJ8kTp
zFc||(&)gz)zoH&<V5pX`F7sHw;R^>Sv#2-EKO<wLi>6<+AXu4&R5POPMVo&Z#!8I<
zR%UvObbX$L*Nz^)SoysImFeD|RxuZ%vaPcWF!jO7)&^?~^x1zUm<~|ZR2mn;sHOUf
zuPEDqs?|1G(RN#w2DM?-fyttvHaz}kgODPzd}`eWX4qv59xYukWjyApx(Nu{xQ&I+
zeTnPHOL{qEz{uLVY19A4n?19=syx#0K{*>oG&HJk-~O!W<=X`zJ3pRS>e+kD99>b@
z?Q$TpBkG0r*Xdne37Pe@2tpQCh*VDf=5eL$igN4$kcEo^n#*LR<Dyv7ksSKR*tOU?
z5QDIl$cF^>U+lqEvZ?gMbpg~~5CQDi|3}$~GB1xgRZ%Ngx4i!?O8aC!pBSd4y-0#!
zKXCveTajeqCG*PyEb4;wQBY!C7q^0EYN5bA&KhkLqrs?<3Y(^WTK6+;`U4?LPc|in
zX^VfzpAAqK1qj*5tt7p}MF7jbuS71r!__vq1kuuZ-H5cG7Wi1w!k~(r9OGSeGGBrq
zZ^cB&?H#(k-skO?1v-|sdRFFk6^>{Z>IQ5q`ZR8SbB??9LLYsQ17E@`2dO_(eYS#H
z{UQU<n4}~}DNlN?{d}bZ8q0ZuR>9LQ0k&7QOan9~DMC!jbM9=uu%tHM0F7k`2S+N#
z+eL-+w8d>JC7>}$X)7pMOt030rqVYDfW~67cie{2q-cE=*$*4Q#?q8W3wz~wkw`zQ
zrNkPrvGjoA<I0Fq1whYkpP3o3u@NCk_D2VJe`P2cps^Uy>A(_qKsld$7ulckW$!jG
z**No9eHhv1K9I2~>ws)LKT?8dcXt0f(9Fg;Vm%s#Y27agi7o~Wz+#wImRVob*K@ag
zJaZ0T%gDCcMkV2AhtcL5u(7OR{37e}h0H6OWX>|XKh6(-j9uH2#4reJ$!|mdjU8lX
zCGw-a2AIUgj)Fk?6rrcRBtT`0hdHm=K`u9f&;&i<j{cVfIhHcFi^G-PdZ~nrb9D6%
z^jQA+O%5IeJm?khXr~baK^Bi<9K@YDl{+e#q}dJ-Wcfzan2RtIH&ga5Y9Dh0K^BkA
ze*MV5M}CK6nsS>Q1X<hbQn`Ijrvh$<*;j|bZF>UbuQHP8WXP5sU4U>fWIc`?{>6sf
zvfHU>ab*ys??>PFI}&C61>*FB;I>_HFfkLg+C2B)AkM*#wKc}Z|Hn*pSy5b<fYKY&
z_l$;5S!z~+Hh<L4O-4cXP9F}?vYJzw`<VokK}zmkRv}WrY`;bU^$sC*GwENK!+JGK
z$<+ltmKCYRWeJ#aN~60;bnBfy;%gV>gCsz#DqF}m0zH=Y5iFDDC@tmJe;M64__0(+
zJrEO%1ev{JIf=p?{8)PkEGwRGY`f2)K)o(>5|7h8N)%2NWfb{^b`WGKpUwu;Y)bC6
z-~H&-W$N}zW$SfHbN2k<T<Rdm;`$hMi(08D<nhu;=RAw8Sm8w;&Fb7C8~A-Nb<@9+
zA~pLIr<tR{sSl=ZV5LKa8Q+xhx^B`%#6ghd;yQQ8idfqpV`r3XAq>LMEn!=%?0;hq
zbS8-(kLw0HYHgbmIQ$?#2JA7*+rJYRb?kY3)|D|BP%!HLRp2V+ZM3nCfIU`lVD^?B
zPocyoj(Wfy%avxqF^00|evrum?%1)%W|97`9u?}2^-priAVgFYNjbg(Hv;Zh4noJg
zjIFJS?`;$;CZk}3Ey)Y05HB`a`%Pev<pD8}N0Wc+6n?os?bw=8pc2eU3$DbK@z$2@
zSD93~Gmx5>qnwf^p0|g#8a3vU{lF2p^}KZ2_)3!vxMQU+CPYgWB&}Eee1EP^?zYtx
zj9@X7{yDq74+X3-I}6DPP)wCjzTjm2T81}Pp7P=yBIcz)hs*m>@aN_aZ(N8EJee6&
z?eDU<+18B`Z<Hzw#lE+eYbSagBA*=Rp%<x4>lKgosu*y`@*8g2W2ar=+PTL2hnW<X
z(mTFf*u6CiznyB>V>z|sdJ#jXW-0ZX<)X-Sq1oj@#%OXy<*c8iQ&xZx?QG80BzKll
zyQbGxVF?pIM{#7S-t80HWdxJVy!xxKO|wA$Zn$j!MpOzF;2;_Hh)~c(Te}~y$*dxj
zNSQ6rt*h<V?=LXQtXeC;*}ds)F2eFZ?eoXj6(vgyg0L$=RfPLr?7_B=;1BHuGSeMh
zBZ<j_a@C7#s_!y}<oxyLd~ZQUxkO_hIml3}#`ksuq*~_p&5Mp8V(4YTE8C^JFka9S
z^&-yNPv=#SA~@6t;k|oMNj0E8P{bC-xOX?;19EAJt@vGS8w|zBlkj9i_B8$4JZLGI
zQKa=6K)5>AS6?M%g0X`0$ULKcYs1zY?)g@FH^H*K!?^!J=%{0Czb6$l3R}`ZNpnr_
zeaXzVBAD?gd7W6YK}>rpSLCwIIq+Qj7WI&s+pham%Xrc%$)Ss?ZL5a>xi!g2e~erB
zYa64bP{vUXn+%K>UfsXNXBcF%sifc;C86&vKEt4rg;_WGB=bTm<Xbg?K_m;CQuaoK
zoz#x_j2<Pa?FRF55Vh+_&uD*>qLS%CMM;p-D(|++hZU9V{>OMg^qO_n+258^C5vqX
z|9x~CN^L#rW9_U6Ws0hyc=RgcP<PvdCzUcD8xPw2pG6P1R)4CeP!^-AoB{g@PjVgY
z1pNm=+?D*Eu%=J`8V+XLilCZy_ej}7+d@3&>={$aWX`Y^oeh5RKu?ep$)3EWO2*MM
zRzT(`+AjYwb}h*c!yxQR*mbbD|HU4>w1{ko_Z{kte}H7EZxtm-=0D{mNAW6E`U3q(
zc*IUv4N?eSv)5v@1j$CY0Hc@<U9(DG^dsRJI|yPTAf|CDePP7NJQ2=!;{OIrwIA5;
z9%5wIElBna;$_r4^+7bCY@Tc(gug5Mo3GtK@SxpnWJB)9Du>NL<3T%CCZPxxT$SBz
z2V$hri1BOY0zK~D5N1o1%xjbn4f_JEAYFL&^jafI7Q`l{PuDIQ_?NwW&LX#H({9Ko
z_~Ad;XD5l0h2&Gx9QO>eVeOmslamxh5f;fI5dl4w^tVLFg3Lo7r?Ir)<u49|miU-w
zoRXKIC*gEV`NRvDcIzZMHomIGKWh&uZCc&kaRNzjY=GdS`jw}}J;}PY<}sKTOp5Di
zw5P13C|w`KgOF3J$m#%5RX<g=&_*GrR*{P>8V?WFS69DzkVPsh%QwHlrGS^Jtp^N5
zNU9Bgl8iD-GiBQS2Thb*vz6k3&>XDUg`yt|7i}TdhPubo{HUL1F4}7)qkIR$WSk0X
z-JGT`7aV-U1`9{F!}P+_AhHp_q}ZeomT&RV-9|||f-jXn#;yd{Vh{vgNx%i~f3YuZ
zA48L$Ne@tB#45@xIV<t%uwHDsNrNbG>G`I!rM31IIp!^!Vj4cCFcem;z%ixSkwRja
zFwd1aRt1g;50dEG=(zvyY#hY}&2TovG~96D7p+@f(hM|4;%miIhANbrq-t4p`s;u$
z);3r~VQ?^OX<<CQ39mH)Utpg^t!lAsbR-~)Y4LR1)&WVsPIRR~k}DRZ10>kHSNQ?H
zDS;|>ZpH>vV%PRkv*JM#3vNZxKg?uCwH)F<Uv|Pm<;-AWFTShx0MAZ#!a}GNb8<g|
zz;TGrE0$}~ufN)q^6^ROhHE_QRTciMXOElfV_)xfF?oXYy;1ndklNQ<e68hzJ)dQf
z6IUjk9~*mN^_iQRV_rj;R9=lenj8?tR`I(OeIw-Qegu}-8V&dSQ;pjGNP4^Na-S2Y
zyJI8{4g4rijE@9}gJ8_2Q^Ktf^sA@0(Va1SV0M|H!4?%HigRg@!E=*sgy3vCP@mFK
z#-5?@;{x=sxx1FfoC*2gv8Y<$2?7Fx&JLdbx{*LR6ydXyD|Y$-I;GE5Y(U+O9vF~N
zw4&_LrHIT@+av#D>}qo*2tnADP{EJ;Uu<EWP+s!V+5Zz`6oH}8ib5S^^aVIij@r-1
z3jV~<2+Cs6yhYmQ^=<A3z@I2(O4IYrqII%5C1Je8HczzZ2NEMHf&r!w@1*yexK~h!
z4D_Vvf{(V%qi~{L{*zVS%^9Ve%2%BHNI;Ghmjkh)hGr^XMED}fpx8!M*!G+qy2g9+
zSfLOHF|-|7OvA%emB(>|rQT7br$=ool7XYM(VH<0j*kJ_QBS`2pN;TEP}DjHdMWJ`
z9`V=-_3{SqYJzIvT4nl3ls+0m>Uz*eyDm_Z7qjT=#avjVRjI*k;A9@5B+AbtC&r_-
zAq7`%nL2-x>}4Zqs%}>Yg<NYLbRm9ai=QfNHN)PXir&F5F*tRriE;&Lq`};!6oAG{
z8lD)Je~L+xC^wW-?L0^%!sYgj2~`b7m^={Q6_1={D9o**Ll)9d6I*x2gDiq_Rv+jE
zunmFA?}#dWzQDNr&1aYh(IU)TtP8G^MM?)(M=wmU0~Cr);mHwDF1M`>oj%!C9ooy8
z05VX?5_`~n7a4#M!lsK9oJ%{fvN_F4^ldbS2GDiIqOv4bY2q7q@xZy}0O9rs0*IpH
zE&nyIe;7NrD~Dkah_<9RP}+7MV;qKj>?93vY)ME+1D9f?lrf@8;VwL><I0zbK$D%a
z1ZsC_nmaA}gcB=y({ilh&YPARLZclLEisbYtHk^M-@7w7o+zHkm>9{|ED*e`MGvGf
z;fxu&5kTUy0GU0HP)BR(dqlCsN<L*RMF+*<02QsSL${NZxaJBR=QFM{acp^CN9up6
zaXAh%UB|P2KLQGVafHNmqDudHVsH2L>Bkv{#B~J&8K+6%IgLIyHvw4|2k>41yL*W!
z|C6F_ZNcfefJgM{-8^nhdCPNBfUVd9Qt9o%bfu-d<(`jvcPYi$J~7+|u30^hR*wTm
zdk(A-x>^<WG?@=^rZn{7Ib(d88OX7w=<_$UuQIF@-G3QDIl^q{YQBaPv_gc%{~NJF
zk0}NGp6^@dhW}2gTbJW4@YEey|9i9tb;~+f_l|Edt!s^M^eJyOjg*Wxw;L+xopV7)
z)&M-3f(7f+S}&h+8vmh<%D4lDtex8A;o78mSOG?&AK##<osd>@!SR623S{nsN|?D`
z{w3T4Q{dWO!~#I+nu0e%-`Dv67%11sT^mlZ5C}1x%cDIduIsCT#NAGeQ0#6m#;)W@
zf*6FQ1Q=iWC$`|3LcFw-0Ohu6ZX~1aDXkvY_H_lQ1at1yHO{ycVAks$r=hh>U{4HV
z(@jUK$CaT9FnL@-D*hgb$^fVM(yByh)~9DP2W)BUs5EwF!>(YY;f-k}96D7Mtq#{z
zK`d+u0eD+}u$|v*f!62HWt}CC)vz=@UY$#+v`fa`U_ks-KYl(7NbLq@NG(A=t^I|Y
z3Q>^SiGaiHG(1lG!qgHWRnr=Vy2<#$0{rIKRRLMA%_ZlY>*^5~RoZHCCG!$6SK^0k
zgO30BWCc^$8mCbx-UmPndoa0_3HDvV(wDAU{e6~+%K%05LFvRJ#YKjmdo}!Gi`XvI
ztuEGcpyKxMfS;sj7`FnI-NV3uFffBZev%6zw@QwY6L?+hGbz-jRF~^+1GU|JyJ$_>
zxSoJ5Y?v2_#_|u)4W5|REwtKP$-j%;0smx{Ek59986d(Cpn@dropr^hzo0cD8*g|K
z5w>WLcc?Ki(2C2!5Vw5%5@J#M$kph&2_#xV;uC=H7#8sGo84gZzHOY`3*znt7+l7I
zTc2f>lD1MBPM!?m>Q=SbX=kG1-$47`>(Dy^RoEY6SAZlj2*SQp1X2J0v4eIu(U}{%
zA8=Y>Fc2VWY<t!<bR5<xzeFi#;{yanO1ktT^U?a0Mk#KaTcMmx^L>icrvMyuyAUGN
zm#I7*MqZ_XC>EC7_SQVs&|iBe3uRye*_EBJY@l}2eVXp77ROFe3fyh01G}|-XV^=Q
zE#SHW>KJyC#)-0ym{Ox1kX<SMi5f`ma8*)F(q8@tYwEKnXpn4f^GFuTkOHnNE4%2o
zn(h>C(WN5wA#mF4j!?E(Y#nv^43;+wx+|>8^{5eFF1{OyFG@!N-<1Yo&!jhz{Z((P
z43S2GyUP%m#y!XLYh6ev7?zlV(->>&;coTK0?_KVk!^XigNrPk4TP7iOTnJU!`e7&
zpAfQqzd(3-0#W#V<nh*je!oC@d1h<4*Y!+weG9~1_Gt(>uRez&G0i3i0G(MYN=*Uf
zm0~6=s5V>7`6F_^fIo0vmXM2+1JAzNk8!Nri5-V1XEup+d{FNt2bo@e2ZgSPN+>~E
zyk1zCsVUA_e+YCyW*3g2PF>s+o>lSEO}f7sCtTWVY(ds5qCJuM^!+<ZKkM68dXA`k
z0K#M4Kw(;^wdB0w3Xs297Tq}mc-emw+<%N+TegHS2-}i~eeHi^x6y0D{A6YWJz9|h
zNfRwX&<jeV1gzTbTZ9AdCa~G*aCG_B#JaS~BW>}&3T&zDz7qG^@6cJZ!3#}baa))D
zzJ$GYTIP*8$bE2}6F#BICoGO7;JitU9y-F!hC30j9TSpZ*vIjuYhB<Y_(i%BS`$GE
z42?Q~Tz)$^DZtc}b=DEHKq@nB79rp@pnyf%^v+SD(S3g#W!A>Cv+tOYo<#R#uaG?$
z?w$;Rk*cKcIf{)`xr41^%z|iUjj`r;WQh23v@X&L`d7Zq@YIMP+yyHkUNeP94UxC!
z&$EX(@vaFDxJVjLZT_CWUrJ!&T?-b*G$lVDy``6TeRe<FlKx?0O0K;4z%(zZ$od}4
zAmnuiW;rV6&v8P$Ywv>k`#hG)XpFV|BCE(_a9?+Ia>d8rXM>)2*M4Scp~4AOuxQWW
zTcsIA^H#Qyur;l%pZ~(MxF)2`z(KgE_>Mn2XBiP(oZG`IGe7pkMhP*m*)mhgGAVU|
zo0s7CgzeUfgQWo6P{pEI=@~&m&<kvT-n||0J8Qo`$&jZD%inV+@6z|BCpiW|uj^d8
zQi4TBD~nisCkT4sGBUp~)KAn4ulMl#BkWqw8;C*JN<Q!d_Ft?hxg!6mx`0395FbWJ
z`fHH}z3LkitrS>)l}V*QDBR1P5cGl&8kwe%?08@_K&L%j!Rp)F{wEu{Oxz0gB7fsX
zy^d83)NHUpPgU$ielv)AjZIsadc{5?@2$w8f`_Qrw?X_eXGc;%5&FVg$Fu3EmtEh$
z2*s{K%cY}UJOsUP_fvnaDsY}{RWTahp)nW)bXjZ7U=QaY1N86Q)=GXzVw&&}BE31M
z9#k^=g89Bwyg;FdYn3IN|28<i71{5l1bB8!FlzM78uywv5k4`hJ1<KMjjI@K!LD9i
zqWw>X*sv*^bw*b(zf>H7f>G+cVs+EU(&a2z>|Es#;z7egkLVdq!9I3r<UkmayfLQh
ztz1SQ$wi=4&}W<VbV_|Je15Hus?;0Mw~h2G{o@kFHhO}=liNwhuxm^=hs(UBCD;xM
z1SVz<>8)`zsl(_9hRU_C{(4Z8YCTO}+D1RH2x8cY$qO>7;C&(&>70$Kr@I+cd+MR5
zy1~Xj(R9vMCEQnb?zKohfApNLHR`p-w}<>j<3`%}P9009Yi?tXEI$N|Auy?9VQ1@^
z>};)|vYGjjf_`BQdd)aJqL6@k7|ckW@r`-GaeBuOVb^wDK?nj{!ckmpE!78Z5{CTD
zHn2wzu7LA^;oSsSla4GGQka*=|5dM!_m{-+^{45R#5jPInDOwAO-?E2v>mN6LqT4S
zlss`eM#;{a`aKDSczGkp#%|islX2t=Hwy2HTZEnsu^IaDM=!KoZ^qjT_o3=;?<V)Y
zx(-F*T^`LvyV8C%YvpYI=#@|>V@8c=k{bRQ4#{tDT&U4!<ff*xVc$cteNk{%&hOjQ
z;vbrat@L-5!6~>a$~}}JU@V_LP9H<%m#++dg#x7Lls4yFt&1z0eH7l6RNW>;v~KSF
zymZ(oyldmG$;x7NQfaJg>aQ#g0w-_yW?_R?6fB*&3h_$+*e0HBws&TlREh$;(x1r5
z__e*5%`dd%4Me==p-Wa2d-gPawCVl{g?Qzlg=&5B0kdV|w{%X#%e~$AX!6QT=Q=)x
zc<rbXxsqknj4x=m1q$$rMwI?=H@%_J(z!&<K)`DsP*Ob5MAq9(hInx>vvab>oqo|q
zp8C-XsS|rfldi9^y`^*6t$^~bWMMJB&Y=yN&vk=PXxGl+GK??C=ltYzc}NQG+7AtF
zKZl;X8D{#75bc^AcY2~Ar`%iQ^KZtkCEG#}hHZ(D72N;EUZdWmqxfcyIEp|?lcw(=
zh3z^dm2YZTk7#aB$52l8)@{7=5#?@@!QAiP5IKtu@5MV}78{vn^SUFHl8sVf-D-7o
zKHF^h2o)n9T_;Juni^ru-TfLN*9AWGlIKGdr;@KAN~#NeVD)?3-m`|T>A@1YE*Ml3
zEG61g?gKV)AA^uV$S){*g5xL_X6<9&sKN^pGHNUWg^?A9`dc3fFE|x2V~zlDMnRC)
zV`Px<LNy;(J&fXHK8F6*HlI33c%jmx>w_BUj2l4O`q@Fg3lck(@%2ZBqLAaihZ>l~
zz$DEuS=av&BuOvitSQdhRot2}XMfBIld@<5D4(rpS8<;mKKPOK!nvR~=|#SRpy<a~
z8ly-7@>WTg;f}<ypI0hi;4z|g(w6*EGUQm<)*$PJ8W%akVJDr6T+<`bRb*Q#B0z<o
zU{~%&pCDV38a{P!@0>K*vE{{M*h0-g-V2<&oOSkNlKhK0;V~0=uZ>*Y)SO&uk~OzK
z?F;L53=%7_w<tZb&LjLFQgkN}<scdVB>dXf>C<#enyod8-$F^H0*NmFbC%S7lW&6l
zk1}*ePYge=T(EKOrnOdqS7Ond6ZvE8+L9y)LD-d4RP_EATd3Jd=#NeB1uVOLU`Pmm
z55k)7(s9z`D6Z-cqE`pBSD<G&9A|rjB4g9-B0nOxuK?{dR(W}Wvt#H-Fi5Yn51)ML
z`DoR%R%cEM>D4DShHc;bZ%j<iEAD|}ZtO;dZie%hUjml44M_5KHgB(;l3n^04Uk^R
zG?C2D)OZc&Q|CUxdZm#SszyCKy4@Pj_3}W>9arP@Vv$S<b!+<g9abMKBdIdlnU7#D
zm*=wjz$RW>kA9#LIbOy<@j+HYQJm1K@#b4B2j`WE0i3?%5=%<iP3JyAd8HRg*(co}
z_)+5vP+m8COcYJ|soCJJ$H0Cai|Vt0*PCLTz>l*2XMpg!X+=uC#wjn8SNsUREAAlb
zakecAYZE|f{sMGYK(&tBB$jEF2)c&O^?~h5@3Te4|7AgM0!TR%1KD*Sw(V<;((<xN
zr^*<lb9MH4^a?13rqWe71{qu(YpnTf({BmpM}H1Bta(w>*k;{M2J@*u2OBmkqWEJ!
zax?^Ui4ClA$DUhy7Tig9tV}EG&*6^!xGVn3rJN3+8OvRc!NLP4UW(aoP9$Qv#MK6t
zD;u7HNQt8|`wwGRlq@j_!mcDDh&Ox3f2G|a*&n(Wa8~Pr5R&}dS60xwOkk(z@?7-l
zE4TkYEtD&Qq;=dazE#Igy9greBcS=2+}uMriLN$bXyIImeN;TL)H>lTdUn5|y0Ted
zkWTp+U+8Q*9;AhIWkGXDxt(D6d`DWpqq?+Pp>k&`K|HbZi1s(DIL-y8z}I=6P3Y{=
z{u6B+3)-J4TD>;)bNiSAj@LagN?!=$BZ-4Yzn_EsEP<6)_#kxF+I*}ac_mMQ2HKWV
zKJJBBbPDZfg2yM5eu=vDi{RP{Oc0kFxXxKy_u*~g*3JbIk)J)ewr*JiT98+oltd5(
zk8A5TsVf*>POj%y6(*uwTlb6L#-_a<y!9gNN03)R@G?<_Kc9orap&|l&KBZz%&mg;
z@-ab5d}|78Azn9ZU(QIGN+)%NTSZe<JPg9gC@`#QmAgKdc9FWT>!9+w>TH+@%?~@G
zS!9yF9CRG67cgW|-)d`BJPh0lN?d8{OLC<Btdr`ZR0=7G2<Qi93!#l`Y839lJV^Qi
zM9TX)CsmMWWjUr&Z8%wJ%gc$N?jj!3B4e5}TC2jR#rpTp*wvju41%zgP^9AiiygFg
zBv14f;InGwCy;zG7_iN*F*Z7}kDdOFRzw98UGfpupur-sxR&Qm3+KuvMXV%Zl}(xT
z=>HoK873zH<~c5w2kZ&gUDqV0yZZT3-;&r6ducz{Lb^PY;+n3E$739dPo($enCx<D
z8IH&9qQS_Av!gMBO2L2@cf>wRox$1mSu3n7@*=5-I*j;Ia^~0Qw-%|_29j~pwH^Xz
z<>iB_wv|NJwJRb9_jeDEwMGu=4YL}l(+C>SvQpmeilJ682S^4alDSFQbzAt?LcBcE
z426Ka+xWXuu7!BTAtN3RBNSJhhgPUDqNtyEi3jD=3@N?SOES3{?(76{3Acsc@N9cH
zhK}xVHPE2H#>Mb#AH*7pTXGi0&o@MS-m~ihyi(qD8V$nl&7QcmQTKHl+CAo-q7yvZ
z)(RAGS6HcnL#iJ+<FoBT3hg=x(M>Ewd^14X+CVAx!4V!Cwp2JPZb^(3SXWX%*FtQ9
z&pWf?c0&MlWdK_g1v#3<74DZEsmr<_E$80@du;#hbpUlmphZIrGS_5>(O$HIx{^P%
z`jdulv^Ct_#(jDLuuDY1Qx)4lTs<iU#>ewv><VlohC$d$AtVs?U+hCG*_>YDZh@$!
zGzJXj|0#!5BrKaNPx&aB&$dJGO15jhWxe;5i^OGTd~SJa%>ueBx6tzt)~BDMaO<%o
zyM{0|5EHiLJzc_mG)=Zkve}-4H$_(?>%#rT=Hw3sM^$8-g_K0J6^c`*g3%y~KAPtR
zx=uU4uH?INm<v`}@1kuaqCIqh?{W(i{$;(7$UL+?!f6pPK8Mb*3S6z*gYCLO{Xv0R
zR+-Ow^3dKQn3;*iUI4lI(pfbRZ4Uw4<th3Mhh4)+iYCX~dI{(*&&hMV&J8!p()!iU
zHY)fo&o~l-TQevwl^k!MxsmU>j)6);{zkhZS9_a)@5&{06l}iWG3L+E1-i?93O~*i
z4zEAZ)tdzFdN2ONL$;|F?D}F?ryLrar$wS@q+amq^DeMmZo{Crd}DmZd|z9IwG4Ub
z-u%Mv_NpJj3v`#S6a00?4laoQ)+(&vyHfdus*}fkf9%$1ZNeF^n?~R=$(%)NMYq4E
zgJN4^*a0z8&|S46VDD~Vyeu2FAWE3rVFA)H`-?g#B0m+%UpHSX@}v(2MsHnXqwfH(
zIj-xRQ!}`BgieEvu|5&W=Dgb<V^@#_F$luGgc`N}|6>c?PC_s2e!z~@Q9?+#<_p4E
z9pForf|@Gr$!j;u4YqdG%dp$9eJ6%Jdx|pr`j;Yw{0)2R{IKPDP|qA`Ir0OhrtZng
zgCp}ZsdEezS7sR?`L%2`;z?V_#KYZ>;Vf6-@olETf__EVmLKh-ekoRgf-Cyjk?n*u
zK)-GVkpEgSO^U}3=cq~chJ*Dglp+KS)3NhdkJR;4jv>E53M@zfrlf(@k$R`1cwMf-
zv+JjmbdMp@i`@5AQcoZWHg|Fw4Sq7u?6y+6i6&bZNKj-G?N}<Tj<RV9WWnb7>Xe@i
zjWjUv*3Xn1A`2Ei8&lU*ONNV4S}oOuXmT*HNduCY&?Z*mF0R&bp@wEp*_fE8v-Ya4
z{)n#3Vf;Vv`t~hIb@{V*7i7U4-0r1&ceLIAMu#8`HrJMR)9y(`Y2<e8o(1w?w<{ud
z6y7&inm1Et3~2J;!WOdgcMQnybh${EEPR*@dqW~}z50>MMUuF7Z(UKLw3W+58CbGl
zo=^AmllN}t^+uP6pEMZ!*s^KC_q9gPI29#$0EsYMP4)r)@$BN$qp!dG&E&#>30498
z{#S2U0AAFwrC1S1nUw#M#6jJN_aRL`gk8ar03itL<tp$LQTuP~$nH$SJ`NjTcGN{M
zA^9(irfc1FFM_`4nby4OD4YNrT`c-YF2^m6($slQ6JTTJqN71MF}J*B6ar#~v0N!L
z$KNcsL4dF2fgvJ>RL!ISMoMZ}*Q$>{5ixv;Ntrp?u|4xRO__2Di2<e8Pc$%im7EXj
ziq3`v4dzzi;_uxpK2#lKN}^0s?JZK3?F^n;y|z;EPI85Da+j<l9`v-#{xbN2|0Ms#
zxE1zEkG5q9s>U2V7^|Awdwj^v^`g+;>&#TNprZe<o6AimFc#IWz<%U_r6&A_o|;KF
zM#B<ul}(pB*NvHMM8;q(*i`!buJ)lOm&{coG#0IN)2X#JHT(a(+}2SfA~z4o^zHPn
z4(*D6n#nG~1^I)4Dkl5`fR_7A0DeG$zi@28<IlCxZ{8#VdWoWZ+q+7i?QKdR=thh(
zf@2Wn*Wr(q@H}yJX^DuA#cCeCcEUG1_u{2=uMr*Vc%hTzdpnXRiSL~yFl_TTMNwmg
z<}6L_LM6F8y9CG(hNC2q6t?;4#p}vao?nsSdC$Y=%SWC%s=r0HG!WzG!n{qoh{|=X
zK#=VD6yDG0C0p@DdV9S|{_{uJ8Q@kBf<W|20=le6>+K6BWiV-GFF^kKQIJ92AAVsY
zv}VyouJFu%iUUfFd|PC#w^yY3UM!g`$;Q<=6RY`L1!?Xq0Mop9PAN9wxEY+OzC24N
zix{M+S1JmpXKn?zA<f1>HS0xB;2B&&PlS@mG@)tI%G!QusWe?LolLXE1H6OA$~u9W
zddUMWczd!JLAo(izPg&`11$Km8hR97vhUdy+(<EN)zvWoZTR)pl^1JDCR3ewR4w+l
zK4tq@))yuQP!wvrLSf##KmOoy*GP?P^inK{tV>L#u2vFR7RH;9W2@Jr>DDWWEV~$*
z;Gj54G9vS0Tq$Ha)KTXT*TopN2qyfPE`cl-Z&V%`ABNeXCkApOAStZ_llu8X-&xaR
zd4^v4SdQDQEJfF|aJrsHw=`S;{59tS4<r0v_oc`3f7pQl)Y>>_jJEVi5B#=JB3T@V
znAa!6<a(v^@j)B-K8KZrc3u}$Y6Rpj6L6<vRVGGAW&Gno2k0+dUO`7=7wp;Yr@TA~
z_*ZG5iSQa-jpd0b;9qJ`%VR}ezuJPSjUp?G8%POeV{4Cn{8P$fRT~~I4i?;QxBru}
z{W5lKSr)<|Y)iDz*Zwy)pmP%X!*v6ks!?hal3W9LZG(CUZ^+%|SI;H`L)LtkmJDxg
z%1phluCW=;c(CgWYRl}ajL1NcdEezgm~Xn|TrLmg^94Z`fy!vYVXLw)8BuvTAjlk9
zXQZ#m+*j)>UmHe$g+paZzh3jw5tUE_LFOyjMxj{Sc}S<8y*JQfA*^CJL4V12Hop>U
zV8=ozqZH3+9+tHq$4lVGB+R&|@;a7`n|=&18mKYxrXy5nMF7yw$Hiq4Al8=*hFbe1
zPU3&G?p&b7o}mU-@%_#G{69KCi#hBUCG{%Ol9+bQ@)aDyFi=s#ZM*~5pJrVLSh2|6
zSQw(R_Fh67cAaGz#MRB9e<17)Mbgzrd%YUKHl|T|U&8I^<P+oa6&fJM#9}_2F{yg!
zkR0v4)nx!(^Y0pLd2|V-bkC7-sk0iO#w4;+8s*nxX%<OY{jfJ~%}{(6!f2Bb1JRPT
z1|HxWZkNVPnYr|`QY@b~xG{-*uE{)lN87~>Ygwh?iuy`vSH1Bp@!^JBSp@+0y>(kj
zAy4A5{k#1ZRfu0v{w;*Il_nJDb&xBn5WYc_aPnYSa-o=`>}R79y^&_`EBj;YijE}+
zL0C%)i%9>Co$TBr_>+4L?6`=429iHUY%qTPB*d@@dhd4#3F8>H`qa+kd*nEf{=j$5
zo<6n1t+H_%H{?B^7<>0#VQ!S>xQ4p+$!VF+%}DEXD`adWjdxSF2%Flvg}Ji`9QTxs
z)rOq~<-WSE_*dY#XC>_`V*T-1X_veeI+n1{uB%jPkH-Zt(`^<wu1^pzKS}RteUz34
zI%$r(1`hPO_^bT)_1OfDo6uvK#TC-UzaF2hpt0deyiy~d=LpR!+4C(z%soG$(7j5|
zxt8n~H!ezsse2+qHPMdD)3hVo6eYvCJQ$joH{=xd;+?iu&{!%m#Ke$sVD9>DVy2-*
zp&uRsMU}Hz0wO@o%RF^mMa;El7A3Fc)bzfXm+4pFy5~$+F0!0+&|WgoYqJ$RcEV*q
zNz&X`?CbVTvvlEOV<qEunI-~F)o(*I-)ltO1-+;g%kYczikF9qxSLtJ>>JbUO7@hA
z&k7?Op6&}l5kad)CVRe^0?EcHEJ4=2lD@7dd+ss?lH~~qP_ulw!O#gt_qtHB;dyl}
zf(fxs7UeE{EpT6*0uB+;8nu4`Vrtw1$uc)?un)v&PXhD9*cByN41%yLDHYWFUu;49
z2>r?I1(?=S6%rDqd=E{Gtc9|Bo{i@FfmH!zet8*4-SChT2s^CLOb;b7>cC|;to$I}
z@jxafn&q2+p;fMiV-_QTi9whs$NA!B=H5BVS9hZejGqFeqVJOsS!DlK=!kd@_ezeY
zYpb|1m@f(hTCAuy#wksYBSo#YP#jr!wpVsE6?f3Y$3h9OL9D{Fzf|>|gHoCRnSbW1
zl=v?01}W$8qiK-LTRZFwND4t`@KBq16f_vBYMX|W+`k7?H370S-2sV+3DveUBE*Aa
zhrw=R@aM-Nwmu_5Jmt{Ay`qq>sF&^u%_nJ%woEiJvMwgoOm2R(hbgO56C~@s0}%2c
zdsRb%!LLz?k_BHeH|=?Zk}5lzZnue&MRPn05kH;lkkIybrFm=U<0i?%W6Y2AaN|F-
z0eBcsu~eN;H4^CjZ2&vmQPelaUX?EObpDAmXJtY$CTuy12C^)^)f#dZcDHLTj2`dn
z6hJ~`!usBtMp84}eMYHz>7ph^7B~#_<F2mxujJ*tM@^8dKQ<bkL%{p>idX2GCPo$m
z_JSB?nA8THFw#WGdK5trfNTps#A8hU`zAu>|BU=Gb_KW=gCOimDuQtTi+$K$C`*3W
zE?_ptKx}CR>YNLL-LJzz42Vnz#)UP^v}Pqjw@D2MnHXh*sZ~7Z;z76Z4uH&0D+l6@
zggNY2<zWUs=D!yVYW+)by^rqeAMmkLtUALVWY_!X7A;`lW8QHU$x<?Us6(`$IN`C#
z<=9xy$qR(xX?-FAJf^{vf$k|`uqRYJ`b9Eg&xWH_=vNd=13rEC4~R^*NhyA#=t$bo
z{z*WYA<4ON_3)K?jck3~CrGxgb7!t{w--eOxqqSLAnbca@}~?<BJ06NYU3?&vK9BH
zf@gtA!>dvgCr-AiADsU$bRLsIEp*QblzEjL>D}bfG2v=(mA^LICsG!4n>-U}2;M*V
zNNtWZki8DUNT=X_0m(|g2ABu~N=-Iy9p~R7WA`=G!1UUvT^^>hjOxAsyPQB71&RVm
zbko6K-FP^GvSn5*8ock=^tqo*plqq|fUVpX{Yp3H#K~yQd9Wo+hieh+w<MXhb85Oe
zhBiqVv+YG?B~dcpkqQ3{Pt|C>_AO7)ECL77yH85lQZQmgdWl?tM_3RnaU*|(ikRK%
z&p0xQAtM0DkgC|QhMfP{xcxD9B?$<`AnZ$JDYXCpn8l6+FX+uv9lJO*3CY(WDV;g*
z+)-ixCQ6jRo@YBqZdg`9=*!Y->MYt%tYL+B$w)EZT3+d`9MA@=luN6M68@-TMyP*~
z+^>4`X+KdBmYC+dENI8b?HafxevDYrd9k*#c1v39lu498*_jbVeG<M??fNDwCVX8#
zp1cVb)F*QD)0;uEwVcWVFS|1H=Uq&_LA)g=7U}1SO}Q`1!Y=|hTkV?>RN%goSKH&7
zWBpeZSTbT#6w~K87dMgs>)XRes0kDx{JFI`GKz?F_4A6fTZc*{?xSAvZin?x0-4u@
z>Uy3pPw3>G%i7OtRs>reant7x=ks3~o^esm&<1pFpa?@)psfRlaZ%EO4PbFdPv60;
z?Pg0h%tIxI<ZCVF-vP$A2QbMn3u}i8N<p9hdys5!<a^V5RFby76K~r!PAcroLh0F=
z6xeDBS8l;nW8~M6C&GL_exJa8&ocgE*8n47rSIowFu4`e#I-?e)7D}`$EN+y$tJOI
zWkKkfgL@JZZ7)2An6Py{Qa*VEV8Jc|-wZ*BE1Six_mbgH66)Cf3JWe?CcrMI`9?1Y
zPwofFP8(Z<xTV382QY-?FUGDINn#j;eaQg~_WwV&Xm<`#ap_VqamFziA!$Sgy%4Z0
z-AQZ*qGq=(XOC@ES9&n2Q>!rZ2kDUk34{65(lvBF^jFA}jfS6RnXh?8tYVcJ{aHrB
zTR!`&bLO-Ndz|zOh`Lg**WoNao^Azyg<OJ^KqA85M=AJg=MlipW9~jG5Wk4>G+Eg?
zX;pr{@_(J-c?8G{{eqS&wFfdgJEbjiadYY@^b3Tl#eww3dHV(#cT1sP8(ndhDT@?i
zL-;w!rjxc?bAf7-p=hIwJI<Oqttn>%5ATxSzQcS?pn4)YkOZ{Pk^B00rg$PI1ght5
zcT>MD!sl<&3>hy)%|*N>4xr>Qce%W<uWfA@4+eEh-@XZvuS`Cx*ez&d>V2I#D4rN<
zRlGs9n)B#L9dpgJSsuu)1Hr?|x`u`A*cEajUl1aqS|?;$yuFLYyrQDxf*%s3qf7K;
zsACJ!3;P1TRofQb%T^g%{PQYg<BISv%%7(0?DLYX^H(WSqvVN3?t;hRMNXgjMp?iY
zf>Z|tLF8#c=IYuhejtZlCm1DSHaur$MtT8XP;;mfA^&7f`Q~P}Su4W}_<~k|wi~ka
zVVl{A9-d1d!mc36VGxFW2|}>p{~ueFY$f-i-g;s>K#Xk37F+B0C@#&Vn0bO$_+*a6
z7rNkYSsTwLUsM#}x8Ihji4Jnt*#}HY_jy3s?RSM3A@h<^<;<bZJ0NI(%pBTrQiNR=
zS;Y-%_~zmu_ci-#Q1V$s!#2j%erzl+?fFUcg{JYVBw}I9p^+Ms1c{M6M4LKgkPBIo
zB~oLO_C-hv$4Swf&-e~|JY>M&0J>#(*_F9GXYBt<@e%E*rz3W+XYA22Ij}g`M9#N8
zx&{-iw;91KLU_=|P*LWD%T^9~`EZ~yihbNvQmwpN6o0Gf6H9Vn2O4ZSrMIkn&+wx|
z;%ks11$;}X_S5$5!%~@}I5xHV5USrbqNHU?L$+bS<$N{(TB1f2+w&GO4ud$Lm|hM^
zvCeJtuaBI=fDS|qUdiemk|CcikOYIMR{Rw#HKIg=={JSrYB92k+5qU{YpE*yp76@T
z9&Cv$m6I<nid7;8Ij~qcdGB*arQ@!!QimV~Rt71;)J;kMdLLP{1hX)RY_zR!_xJxI
zzmk6PUjg}rDD|O!g8@?pdp28@gJ^Oo2R~7~ah4_bgY4HqTp@Ye!56c>>C-PlINQ-&
zO+U7l^Xmird^&%OUD<U5K?rMUPQ>=#SipWp_#;Xhz}`6+aY?^eAsIMEjnc=0Qzk1f
z;MUNZ(qU^|s=D2aFK@5EheAxS)=`FvHeSwNI<}`pU<4@HIsWwPCxeZue);1#O}L2t
zS9x*tfu(TRaxX^Xn>G4ASNun2hst4b=xcK#_#a<etT})|>97mXN(u^Ed(o$?qk-CC
zfrkok#c!{|esjCb8i3Ma_ZYkKkCB%z*@2d{L4lCTS2X^I`Tg(qfXZR>-DLHdzoQ;^
zF3FnO%4MX^ncy8;%)Y0j+S5kJU!MdY71|C~1rt{;y*WIy+c@HEW^AuXAPZ@vat4|9
z;#BZ))_daeNHmN=0{e$u#IZc>#dx;F_NWpVoTp?aOL@m9SGq?`Vgi6%7Rh1M(J*9|
z7gYoE5pjl-RlL#FW_?nobWlaGc=jkv75?2>QQxj**HJ~VZ2BM-#Xgm`OL(&Mq7*2w
zL;o0l;5Isot*2K}MX*;J30aLD_7(ByuW5wfBs<71ELK@w@{iJpQ+9om(lRdf>SL#R
zv>&8POlC|p7O>5(&~&qM&=XY$v!qBYqMoD{CKY}<71L%Ie+`P;B(eB79n9*xyc$pK
zemCy^5O!?|5`!S@N(dF~(f0N$I!l<J>>Plpt;!=LTn3T=GCkXc8Y!*M?Fu2im?Q6I
zzg6f7f@I?U3{VrxnJdv}_;FF!fMjA;gCHkn$iU7w5^lxuFiocR*+2N@%r_`qD4?16
zh+<9I$A#H6cF}2K1?4VB%{kW~+Cv_i%Y{OH?llESXcCY=NUut*6d-2V9I~30uz+5c
zkrQ1JFtMkNNZfvHVP5e$)!Yi&x~2-0neHG0Y?#GYgvPGxf=j{+`KkFZTBr>}XO|*&
z8gd10asSgAcoZzAJ7=hGG~@;CI=2gd5=SH9P~5uS+QYKo#a{{(ksMr!VYlh1PBgzS
z3lh`3S(|tds(}B;35AI5^8?<~$OyU8!dQHiUlbswVki*pSYu$W%cmQj7#V2ZllD$V
zQ?<`M%Z(I}JFm3*&tEUY{F1d_+zRLkuM}#dr}4VSEEI-{0>p-i7viEjq+ET^a@~S>
zn$C<ZpaS3;osfn4=f|783u^ImEN@%Zxedt7h(nlV=av;aoh?h95U60UU4^ob^hbn#
z74YaWE<kJt`+?O=>v<t1pahs;dCMzkyb@h<k#nS@F~Rn~m&$(<l)QVxw||~r!p<zm
zffxj$SHc_E_rKUccS2!lRQZiYRwe?om{<IBOa~x06p#MWwcpW@o{}usv&Ikqk~XZ7
z9me$vtiFi7hVwztJxtbQgC|db!Dip0*fQE=U15w`3t+HkzfuF>+^z^Te;fnL?Rx{0
zHguk4#I6Z?$E_-Su(FlDtW3?kjaF*A`7Gw?+k^(g@(^@IvcYd$1%W%~$cC+lwRJW2
z>6nOV)jojew6=41_IX6ihq37EOFE=iHbvntOokes0%eS45DoKQ^Ui$uDQUi*b?F9E
zEKm}D>R#%Q1q$oPS=>+CCAn_=<^~qly@J>U{TsEMIsB^>EbQbx<sUD(iWz?If(si8
z@piL!?F1V0^bCMu!}3|n0^g{8dD<8>kYW15PoK7}wCi@^t_c0aNS;oaWz8Qp290?c
zU)Zn?KMXmBRwEHNTIeUnE+ODlM}glSzG~0_hwa|M>v&3vUg?%eN3X5uCqjJ3J@bs3
zJ8?e-8x|m84o9uE%Nqk<;AlX@LbDTtbPKzOJzJ5^zerlE|0zcL*1I3=d&rOONJYb>
z0T_>bvOHDratvsgNdt=?6mwbE#1#q*XxOu><Bzdx%W)tEVOL5*p7+04VWML1N_G2N
zsc2deCSV(<XvovV{!GAhl<dalM&s?*$N8@i$UI40EL`aq2;8%Brz`bKD`7G7zBH$3
zAxq(jhOUi?ip3(<0kQaQow(O}qLH9j><!7*rN<ssqcWgRF#N^hbvVgDl}m{p>?bN_
zl`Pjz;~CF3ZT-Cn6}wut<TK&MG_U9G=O7S;^<6N;_Ilk9OE6@n0Tl~<`2ojx^u@{+
z8KV)|nM^GYR@^=hB2OQdCweYqyY6)s9#2mYnQ7339h=!!`sdi!`*jimN!YxW^KY#k
zrd4)37!d<*c%^Nop624LSiq(i0jvbY#%O)uI#3qTU_FWkOcE6v&n9=+ww1<Yz%LW8
z14F#Juyot5Hxh!VAG86A)iz1Bu*nkLgP0DI8QTjOk}HJ!ou8!2AfVFv)dYf{0vF^T
zf*5>*Va(xQ8l;fv`qi})6$?L&Jb)*JxBxAq6bu<<kih}yP_<3s50xSTx?Mm4AJB)M
z>n!rVH_oE}lbq7}A;=ONoHwjTxIBIlBQw_91Ln<5(x=%p{lBJ_SSt&XS?}Cw?{=&5
zJ-ibXi%s(oWrmsZVN<7%3HxH~N{$1FL0C(^4gEJ3h-W1Bqoe`P`dAFs!S5hsB%WJn
zS+AWVc38_@4WL*`TPVSpeOX0Mbzy4&#UiaSu>8{tZ2WtRfr-VhPk7G9C~ak*?nI2S
zNf2|==K3Q*VT<K)B_!4+ZPh%BWH$O7u8#>Jv3wUsQomm1gw4^53Jf=iY8WH+h^tij
ze)X~f#7zw)oe7@!4rQCHAPsm}f+CIP6E=(2;&N#TYlAsKJFQrY+*+J>nOGRWut+!;
zlfL9dd5vo_?Xy9q%o<RNpB&Na(*E%+g?Vu3gO<-gmHg^@RY;Xtho7>2e7G`tI^Z3|
z;ebEriEF2oBiki}WdOo5n89MM&kqG@>sJpevareiR#9Nvho7SB6dPVX1)IE5P+K0X
z<zGBWlxZFC)mpo;xmC7DlCuE@mQ8Fg2@p?OirHu<ahvtXLh3WqmY`mMI!*%u^A-no
zlUh>DTa)&o2LTx|4mXs4BQ4E)y#Zxd0sxj#?vh%vyVn~~$44Mw5tSBuncsJFGCmGH
zpIag%dtJxh@<D)2KAspbu!z-$H}A-{&fev;NvXF{6_)x=%AXF~-DQN-VF?)6P2hGC
zEiJZvzt`6fVONmAFbKlFWED{U|FKECne>u<z_wBlO-$4n$JqG>;(?VWI_hdrWQ>g{
z-|6J_o6TP9mkiH=z+yZu24DI^sct9dk8VN_1{R%Ir{&+*jn1k6{I&-JE5!_Q{CcR2
z2#_q+2Lvl$o`yke0_MLnNPp0zhBz15sR5wBXICB>Eb<NOF!i+cuu{;SOCI0C&9Fh$
zsTI>@U4#zmRqSA4r7UU~Wk(1xs*Q;JVGb6ypADl%pQNH(HCt8|hvS`L3$`1Mgk)DG
zfW&|onTGAA99)43o%dDim|Rg|8n&N~TdTE}bS^A<P8?hTC%3Q5uzmWs^Ko)ux(*{`
z=L{04{#sq(;23trK*=@_+-0n~FS8JiVRfwz_DR+nPC*{nTMPp1wxV!A@ecax-2+NS
z)Pf%3moo8laOobLK03w_MBMEg3`@)+IK(nMkVCx4d8`-6^V;0%7lBL2fVS^$^NCYf
zF_tq6=qn3{OEN4O&YK_oJr0fd^aD7J?ESTR_@##lAma-bm{upogCk@*&d^RC-GD}y
zZFg}0CI9{abX(mkFzsA}0Ltikej!>PBx7rH*m@Nw`7X147`uYqhCvwmD^q`9fJy8~
z>&Hx8q*bamsjYI@*AElQGl#jmrI(i!FxY<h+5Dqq5?(=w2Lo_zk<HD6JtS&0a)wfT
zje>mliIbUaf*@`gT^4&hyR*a)PfjE=DwMTfjXglzCBvX@L#`ouqmemgYX!+4U&tp<
zF?APLCG1oD|15#J&D<#t)<y}|2z)ISF^$BMVNA8xuUHq#O+E|QupGKyS(R=q(eG;R
z2*@z)ClgKG4h;^Jdzu-YL`HH&!V-o6#K%A$L1O1@R2V&pN$LBZ9H_8j&)t(t#88i|
zAnu}tOd?Hl-&wRzU9f6Z?ga|zRM@<i_O>L#Vs103+>(#csaw-Gr3_9OQdWKvL5#M{
zg1~{7kS*QfXPeMSOe=CBVJSEdm5BD&JQNaV)2v6Ghas~`PyP=i5{ugjvXjDSIlg-g
zHmr&5KeB;f#p|}@F1F5wk!B?!!WRVsdTKiEV(WAmrCp4>fpE6PufBe>Kq67aJy5+c
zp#uQ1_>8u6I;=MGfNW39*|eE@f&sY$+{#)?7&SDFG&cP9su1VXdTYN=>*aELxt)L3
z<Dnc2WwY-uyRY}_`{(*`{r-Bqu}tF@jt9~WXp7}R=VVLzP)1>+<3VL4UOkAoL&Vy7
zLow!Bz@#8t?~^D>@%6}uN$pE2A5}jkY207GWqQD5%_;p2^Gn#dCCe6qFmy^SKK6G0
z6T6)y>5p@(Z~`fe0em4}n4Z>fu_&0v{zfnjxeKPNA#n*a4opyLFPPx)PcT7SC&9$L
zaWm5zx-()89|vF!H?(l0t$Ycy(i#eDu!dtXtl@Jq!90piCCrl)Pc!_O;GGzn{u1I%
z2#QF+U^gz1$*;r=sC_pPCColB!*e~G7LuTFI3tv$1F%|osovnTbZ}m4W^&>KFIte)
zI4R-an`ro@A1V9}bE8M;7o5~EWm}k|T{i^Nyc331{ZgZ(gegDApI%QBZ>#ZxJ#O5j
zg3m8XNROoo(j#FAhp!E5oN4XFG&jTABVip0KetgW`?rM?IpYsUwV=r3Ym}65I9xSt
z+~9`3o-nL;IyFkFI8rr(g|AS?Yo}bFcC%$WM#OfE_%YL`JxUL<>cIDL$m$8Rf3l%F
z*)b<>@zZgb^#$ax#bsD0lzwrh+5y)%DPk@<kB9Ha`uliP>XBT-q>4M;iNT>0%o)}g
z9@aH2I1(S#HO0A}!#YikP>$XZ*ErMq(=zAS^Tu!1xARL}W<9K9&f5;nVGYt<{P44G
zG^dhh^qj6WoO{=BqI&c%RE_igi8(wg!mmaSN-y$jjO`TO(j!jEKCyxdZDNILGV0vx
zcuals@rc#!5i7I9+Uw$<z5Vi?U4oaRC*QS<UGw=b2L7Y$46XzQK_J>v6pg0;#&#X}
z9QGh@8{kD4m_ZHxwG&X*U^FcY-`ERs#_7H8RszWj;4HFyK~<Wlc{dU;PI2=j_v$?}
z#mOr08O7LBz-t8#);pvE-?_GRw*!b<f><N_^gXSoYbvU;0I{}6h2hiSxoaMj-#K%>
zTL}n{MM0iVx_DB#bRcoJLqT@RZb8}q7HuP7JaMvVk1=rb;+#qi3<|PN0i1z1S*12i
z*>FyP?{)&kU9aJ4S(<Ps_vlWWtG`h|a3GDp6r;Mn;?j6;zNe}dV<ca}5KjyKv_-gf
zt1952B5QP@+cAhwKf}76S!DTm$#PWJ(_&d?vIgj>a%%*Zwc~fpYy`h)61A6OtAd5J
z*p?(rN0lry55eEfd@0o-b4}oPw(1)UTCu1ZP)14;Z_^wyXR4=2&)J9*-G`-vO@9Tt
zuB}w|q{EwpI}52T<dQCY-_4}3*woUNO>4(BX9Kvf1B~^gj?zIB0)!h)5%9jXl7W*R
zFNMV~%S3H&+Lw(kx<JkZ#+tz*S*mL)-de42^Lq}G?sgVs2l8wi@@$)Rja~`3xk;-J
zQScxHn+6+66r5?icRPrSk4B_7bZOTQ1FFhrtoFSJW~*Wh#J^sGb~t<M`9s*bBuNay
zF!V~n5JT>Nu?d3bRM%ADU9Z#$*s`VYQMzR~(DDP$`_}~;48LN296aODC+icYil2Q|
z>l)E}C2{CM%Z>TcZbZeQ{A=M%U;B(hhoMs<7G+Q-s;)0rUd)5U&Nw@sJzN6aKDM+u
zrjT}4pJ8@5-&#E_TGl%JRka4%d@cz)<Lq#5n|sg@5PMBKe}|F_6J<I=dIg}-!cDz%
z#)<Z#eM%TlsI`Ghkc~{IOD^s_kAqXjo^WlyJ>%>^?(k_Rt+XycFE#I9KZ8KZ4fR>I
zR9uB-=}_4XcfvZo#vt#4Wfr}c5jIvc`>rGRoVPNkXqk_YS0!=Gda&{XxnJSCQ6fh6
zQc&_86nKXgHd4G<Mu8pIqM-HOfw<5`r7$=(o2>D#^U{jD-_EP{tWoZv_bOWWvXCR@
z;Z!BLIf!JQMu)8|LVoacrj30@2|~uQt)+hj9YVgc{2UOnl}+sLFTBY{C~G_C8E1!b
z!}`@GS<!LzXeTqjYY@oS6A2Mn9&N!qax}p~@);hdS+I`5Iz9FAhC}N+uXNDBavMO&
zS$)u4fD)zrtK{?h@)?9MzQb+kA&bJ7OfU%H)v2j!7XM@HOmZBEK`45q!g##@#X81*
zKT<~u+4cgFYQTT+z$y+piT3y|L_h!MjZ11cmn~j7C&_1t>}ga?p`~{|sZOvUdm{KQ
zY6WHVeHQI|lv~0RN)#t>4lkEvwylltQL5Gk8cLGcYa-H^DRNuwbNo5uCXV2pUzL%W
zg=#U?m={n~`?)XIkVZ8%ZJ6nCD)LAune?$##NZoig8hx@_xe-z4+mAmwy!gbrD?|#
zSFy&7%p$Vq(HM2%>?WMuf5q8{Mn8PrfL!RLe$(+39mfN}m!`pBP3*JyoyKj>G#!w|
zptEW`h#U#Uj-&WMd!IoPsQv={ZDqtLZU#F_JN0aFoBEMU>5E!C4J69v1L{~!C4C2K
z^GuOBJTVljjtASZS9%BHj*({sR&J2l(s1TVL+<ocOtFWuE@V^+3(i|6uc;JlczpW^
zBNpnI`bMB-%Tx@*<nx6V5|;;rk6<JeFM=g;B*)Qa*lKZ@>a<4&PYsiA&}1IZupE7d
z=~4HVf+Wr@>SjQ>?g&NQNoeeWlmxm(-5@26MfnuKE<{UBM_j%l*5`4r$Hj8EEPD}3
z0tsjgITA82>C}%R{G;p)k|c&f82F`t39<kGu^oe@RLvf=dz%wAiES*@6!{Lq-Asyq
z)6{D<R*KN&%Yhx&X|2H{{qigR3?7|w!{74eWLK|-*GkfJO41BOGC})#vQr0wU+KF$
zMg(F32);G~NMR&|OX!3T;OC1FeZlVb1&AK{fI0JY(hy0g%!O6k!wpoRv!x^8JVl_k
zy}N|k%YVtN2<GR5S#cmMmQnzsmCKJj4W~MxrcMZ#7#+ONYGTc?i+GEn%CV*24uuE$
zc8)$Py>P!psd_u4emtw6U-Va=2mXo_9>9KM!oZr({|hf8^)ucWh8~sA0X%{B;2;%f
ze1U~@ta^G9t|}^Og9!VkaWrqXP(YdOPmhQ|#DC5shHHLaC|2rwup$uC^ow42JJ*QI
z7H6tU$^Za;(LS>Et9d~KNgHg*NG3)KkAx|<=d-9li}p9F1V{Fm5!{W+1u#%R5B{T?
zs@Dp}Az&Z5jlcoN!19kKc}|PAj=ofR0D(rh6c?T11hvgnwvB-VE}*UjS9PH=!%Rm(
zo{r}{SAVj#{T5@xiK$FP5LkVZ2bw`N1WU4A>5D)=jGYT^#2^eruY^CC<o*|{Abqo|
zu2k;@tOyZ%m^UHP)2;=QI2#vF6m6e|1<rxdRxVZLFICm{M&ZCzZ_HAf%ax{SUo-*1
zz}$+$md_h^zr5p<HkHvBvLbOJL;gY=3Ny7v^x42u&*7+s{q<i{$O*e4UoQnvgEG}c
zG)z$NpLoT-wx=sYr(UeGpF0Q7@(6YM-M0MsvOF{sQ!^1keZEd=3Q2kZ1s6e$ip8mA
z%=Uq3)X8x5LYSxYV(lK&6cSA-*$nj83^3*FWgcAc#s$oWFP|Nx6y9uiP|1WYrt8vD
zFXZCBb*d|5ABCR7&^h~ROt1FH3K?{R=w)D&&hw+^Ck8dTcNH|K5OOG!P{EY0UZGX~
zNf`c)=DpM_^4o-=m3FngBqJQd!oGz(1{{2&MPc^g2)5?9K?nCAC&_X$r03+#uYD_1
zQ%Gn<qH)2mY{9S2y+ci*8;Nf^kTZiSF3H%Adm5O~E@?C;U6qcXmu<SrmU=aZ*HvuC
zE0ouXjv5)PaNZ33GU9zTu~63bLz+Se>r(v8VJzvUgjIBlEn4{GBkYH<b4OzsgkkWN
zz`XB&u_lmT89FFiCx1<Fuq??SAQ}Rq<;ivvh|Er~m60SnCS=EU>wqSZAP6k%!^v%o
zRuUMk*q5yhTejf0X=reR9{}+y8cMQhY8NSJ&Hf!=b<hl5zt9v0OE!l6KF|#JrC-M~
zNC(qjH@Wr5BN~=0DfE=uV~~P=pUw@EQ4JS6(W2llqAXh!kqmPYwX9XY57>jmw@vxf
zPAyZ?7}|!Yu6si=fn?jSN+0lI$So7T4MI1JeSFpd4s<WqFSS9|xi9JP6x!XE_rOmy
zd9-375%S@E*gGFRLeSF>@0_;NBWQ?MnU}G$%P-1M!hO-C8w8MpUk14<dI-nWhx&?$
z*f5yvb9N7G7yv7`U@QKN_c@D#h4rd4+dv}pLhqSsf39)*$TpxOo;&(>0otchoj@27
zXX-AgB_vK6d?!VECMIlVv#j~jE}eKsLHp7sxj2dsG=$K!^cuS8kOZUoS&}EI8M=rm
zZ)AlXtj$(dsfjHK!zN+a5QcTqZ=fcY^N5GoA*TZ)Yw51CMiQ#dAhfEUyy63Ews1uH
z(_I>vIx$-CW9$r&8wOz@_@zn$1ONY6W0PB_o_4MuV1fhkp}WN=Mec?v_ze=ecmhoh
z#dUeH8Azp?n5D3k#K5^Ovp2(#?@%iHSZt0ZYhiZhZ{-(&)k0K>HEfF``I>fO<B3pK
zs^YgC6cAVO6EhK5upM%4j|KIx(mo@?9@6GgLIg%?I3bjB5({`tm{nJ(zdM&BKTyH>
z><YdF+5#1H4+k4@xA3;&94Jn5JuY~XauPq3SrO|mN!RfFt*pe?PL-JM%6Vr`R-#iw
zDJ!vLC6=tjQX{u!vp+}c`TEAi&!*1R%K0ZVlQ4tHyi)UO_le9V5i;)h9q{W7K4^#4
zNV^iXo*QRP`oXf0?Meh2B-R=sDER1-iqnP%5-Txi4aL0ksM1sEu$h#V7@QCHCxPGW
zHD-VXB9rsspdkzk-c*75vWy+@;EjvM6Bm8y7yE=%qx;|;MrqyV;x&+EB4s3=7k!FV
zA%<6y3+I>q+(3wFm7xgIM<HVGy!OBiG-+3;|N8#Njvz8w?jW8Jgb6{IVy5=hD!U)-
z;&_Rf_zUXZ(9-=6r16`vbFpn0hJolx5=Dyf{)-iHa!*0f;<^A4I5a=^p+5sj9Su`<
zd~)v~{{Iq{i1lxcLT{^4+ME9ZCUG9Jz98#2WWCF0n8cDezh0iXo6%MU>gDFdSjeN<
zGw&O8cmD8(t#qQQfJxkp<UK&lMUCGmx(U>OyQyCvwRpR!T`I04%oF+=;uN}7&K?#L
z3^9q-df3fc*8_8{)r$p8;s>h$Y}z_g@F*W>ek+ruBHydDk44!qfu$c(N;Gn&_TFk+
z7jYDBT67kcbDWZ4%SWR6Xa8xfE$g6W(?OJxz#gphxsmgdMc$o_sZjEoDRs@%aDT7%
zCJN^YFhmbr5d(ZOmwnPo>WRs0>g||wgW=lsCn?m8+y}-jF`qp9wz1R0BVLFal#Q87
z-iYUg4-@Fzk5Q#&>bw?|o3p(I_QGEf!4(3kayx%v6oOL}1jSX679HKbd*Cn}H0eQ;
z9;ZpC{Y9$Q3mb~0<xq)Xld+EI1F#$<@0ySQlA8gS7#GKJ1|%|&;I_jD7Q@Y^nNmSE
zn#@j%4TwwpVeDLR8-`&RdZkLy$G!i>)~?_SPz>NM5Tr?M(c+^L#S?<`ijl+*zoX4x
zqWTbe6nPl-UoA7SA5yS~q|Q-1Yr<ifIWQlBM<RLoIm~E!xP>n-F-yn9Dp=zZ_EEm#
z%S<Ghy!ua{J9l=h(36)KtrlE#G8#$RDr{dl@e&gSawpFSS9vcn2bSrA#BV5q{<oQw
z@)C=Ha;bQH2G)IGT6+wd+jB`y_JXVK7+c%wLE<pg6|C#v+3SvKTmv?V9ID>07%hZV
zt;5(7AF+=_thQHSqH8x-JjBILSV}a8ZLD2kOKz68#bNx(Tq66Mu*MTCB6-B>PuAr?
zpOk_4EXMCZ8gD}ATu!~pKdg}vStEpL_h8r^w=5Qj`l2mVw1u>B{C>;PT<9D4cs3_Q
zEz|dxh26XxZPAyIp}=5|mK1uae|w?O@DiQMmPXYf33SF*A6bY|#gsRBZ2@vvVMi2^
zJS4z)Q8Uo@v-W;a)41ZJK1>ckZjZfCf9FkK1q&;QFs|RDWg@PM*fw)wgt7RJI}YOV
zoVSS|zSr>&WoMAvFbo61FPWq$QUCu~owz#!+5${(J_$)I%jC{3^KE_ZUd|B2)Y!vy
zLADs9Q<?22Vzz-}RrizK$2HQvR3V6htfp?<Wuz=`bw%+*=b3lH-1n74?$>_~Gz+Oi
zEWEF!Gx|U20*4_YnfeOMSu*<gYHyhsqQh9-<n-{<l3D-N&Ynhm)q!s-nRV5kL!=Rd
z-~@EzzM7xTe{eCxEh%QJA=^;#mvyIEr6?9i-l%#ROUGii$r2Yr%z+CZ>+6tP`Tn7@
zn+3)>%>cq+vVbXaJlafAh#+niid*?eLs>NI%ye-P3!s`ZSv`!d#iHXR0YQ{{lGh?2
zPO2okVk!g>-O=40-93cGy^ZO{L5P@)pN`1kRBtBLj$IQ%^kUXyAyie6#P6Do5JC*q
zi8EwWUyrBqsjAvNM1!bjERl0^D6%=%Xzv-WJl!)1Ua6g!?M4(pJd+UzX0yVkUaMV)
ztT;Qd5X)Wq+dH<<Eabl;JRuM5eHEWZc*3wx3ufom(9sD3nxmahCx%$W8f`#aDDtXP
zm*S)m<%F5@XBzPj;QPhcxga+P12ObUHv2K$|6+xvdhR5hQ7_;j2D6K#eR*4?ng7x%
z->CSPfE!?Q%kHy!=?X@WB`wuj1bpm~$3e_ytPy}h%Lu4k7Ldq5BJ7QM(3!y=wOVk<
zMZAwJ+2E#ZsAX7TiGl~&B|X%Yl5o2Tm_I+)EW~>nk^;?8j;-Gh3xC8IpNS_WQD~=3
zhpUJo7cm%ih%q6T0b_gqM%pX{@lJx^5AFJu7D|qXy`m<2q7VAPdocv2>9XexA5kx&
zA}GdS{b6tYPMFeC)o!Wy6km3Ku8%?nJ#Pi9lgoYl1}>s{#SID8gJ>}@AqVlV$@7^^
zl}uZo1MnTKS#5U%w7HeILpEYF|JSf^*C}7~e6n9=p%lAJXRL=1$UPacJ<48@o@hyC
zHDQHqe1ThpwnH18bwYSRstEgfm4_HP(Q=5MWD^y#{fj)ryGNTyfuJb^<e|S~7bl*4
zAQTL8<#E{F112f1W|btosx2rxg*%{<wr<(%pah-Z`kgu%auI)3jsZwzs2$3Gka4AY
zv^c4?B%j=6x+&9kkMfJLbIFkygn{Ul0NVuaf3eAQs26E^QM1bmMM?m>em*FJcE_cn
zbCYQmc5ftP%R<<<Ky#!!x}V%nl%)16*7g}I{-6vp+g;mU_AiSlB6^@28AD2+3@74`
z{Nh_qe9}14L?<ub7M@}e?<N>3NluWQVzg`9VGXc|TZP`$=@e)ZSF_2}ViA*qu@!WS
zls>WT`v80pVnAkZ78rLe`#uyOGA8xt2rP)yF1ugr1@ju14&s3ZKk64MX<67E3vz>_
zakx+avWS9T?<X~z3!1g2eIFgxL;p}r0Ac9J+zy})Sj64P_30!cbP^G47gS88=wHD{
z`QPB9n19Ux;8cfBisQO7%MgaJ->X&b>Yi|;cCX?_Y?DhdVEpm?rekYE3?gX7k~`t3
znc}FK%rYQ(9ioJsWz|$Rzg+!cN-gvZlzqZ`<&OG{pD_zfLId^9IXChZtGZfI+~FjJ
ze|Bt5BBMT2y3IPwS1G0oNOqqXqCKb>6Tdjyy&B{O+Jj+_4RMFpWI_<}FhJ$kuf5%@
z1Lz^T4v{kUx@LEUsKbsMDSFZOwjajMEy+O`27*_@mi*BDFSglQrbUHh#b16x6-H&u
zjHadAY87+9;FTT?OSE&Il0-G4JO-_#)gax2DvD$kMY+)9`{W{P^KtjAEfQM_qq*;F
z64WEB->C}*Q~SpcuMfdEh`rG&B;06+q~X7Gl;T2xJ{jnf+M>rI^jCh7;URv|Va`@#
zd%}{oWS8o^(10F|fwxsM_3a)*)E*s<#_i>O(Pv5@3_Vb-=`G(%q`t{Q^dU9Jhiqsc
zN~L%?oy5o?USkfEm;*4UU9L2ZrfM!vQ}a~g{<^Ztm0l#9gjAT?^Zhd3p{&Mq5m&s+
zi-TDGvU>c*S=Ko+0Cm6*0!igF!$X|3n@th7Cm@8it0a-hMhu;Uz$C_`7E3ch9-=#Z
zbOJ6j7|zwp{R|KBN>9!PpZ-|ojvVS1cMP*JfuNTQbTeFDf0A4t5s!5$d59l6VK%cO
zs)CNp0`&K2_SrCG=jUv3Ar<r?X<%(>!E3{Nt#?IIhzarDgLozLdv^5(a#D!Y(CgQR
z&YNMqvlxFUI~UvrLKui%sW!%j`(Lb86hG2zqDd}*Si}PM{N4|QT^>ySKumOeBHU#(
z3|x<9=Qs^qJQ<|ME*?~fNv8@$iP@+2m;s3Rn%0-7hUJINYg!HNsH<=Llm-|9h`0^;
zV8!>nvp|QqS?q_Lw&bAJYqXyI*8<Jn#GARKiB6zHoQdae;rUwtcM7bJV`>Ts!O_Ay
zW~4)Y8c^cdM@QRc{X7p-msvEF7*!2%Rnds4{c#wNaau3Ga1Apd2fJLOc%K_G;5`pZ
zIim@ux2;VFwIa!)m0J#!prl4x>i8Zdjgw-?jYjg3|1@>v?|CF=bl=$t1~|XR00TK9
zOv<F!U4#LsHf1<1>Nc#&)unwBJaY>c76aL(O}UC<v0Dwd5KA#oAJ!|+DT|Jf*SUOx
z1W@AcdSOnyJLkkmcF2JmAMe-jxnL9Cncj)cmZs=LqP_4NSxe6+pG^+$)`tJ|GTP)Y
z9Oz{nD*u6Ay6@#%&WIj0m}K@(W(jKRFDv|C%Fe~MVHgIYD_P=Ek@sJ$Nl-qzb&G2k
z5NsK+biCh}h0Y)R@C>_AS@^TM$i#Q&>SxYj;ovpF)5Ad+6`|N-K?<J6D28GT$G0lx
z-Br}dly#4lH3JD-VoPZu{|D&ROKDYnV%c?9bWR!R<8u7C;^y881_hxq6Z*77!6?qe
z6HtuehLPUeFGOW>5?4eU$gv=k9S&CDvps(kAcal)7U8BxG0B4{gc!^#Z7!v-BqoPz
zwo<e}r(QjzW}$Hpv_>hq_MZc-RdnK6U>X6^xmz6W{`fc&ALYHs<a<$|;bYu{BT?v0
z5qnK)n0MMfK<Gq~zr{p1RI{Du&DL(vx~HUyIf2@_=l*A6R$bTOl|{U)>{<^8^Hg-=
ziKu}f{IXmvD_j*^VwZ1Ea>GS_qfOLMaf#6dgMlD7X)aECmL(Y<@U7P;!bEDXu&{}j
zGOOC@|CCvYc+)EmCLgHw=q+(D3+a28=<@<R=@Nx&mwmOiB(@8Kp+n2PEM7=TT|~&G
z=z>2O%GhK2wXq+Rom+0hFbo8*Wb+|P_rF+!CLFdY&_(|86$C~klU(lXFFueHd-w?;
zDDvIC6)m@pd8>3$o&2r)+|Mh>{K6<FTfDI(&YeH|OotT`Sv0Q6@g($%bq!de>XiL3
zBvN{=`*TBLkb9U@d~h)`t9A*1jR`(%4bPEs9878)S$-fY_D<#UhDKB(;+gWP1dhb+
zrvQ-qW}drm`K0Sl3idK)R*jLZBOBlr70=bit83znd-NsUNkRVMtUn{Y?M7KYN@Mlf
zC^$^;(2XwwBbr-YW<^XmZ8VseM0L%jEP&CfA`ViIYpxEoKqdXhh>CsYgDBXXOeo2x
z3%I5P1DRo)F_5i!$zRkF7%kxeR^OK71(bZ!NQwq2v9niSZoubjL;V$@nwsNzU<39!
zfc|b><Ym^HVnBXf#AZD{B|LO>=+P95)CuTEZq5`%0b8Rr#Rctb!Qm=4^tQ=!hNk%M
z4SU;>QPk5XF8aiJAAf`^?LIa$J$8_w4H?XDb6I+}tXQqz!a<qPqkXF_t!PmZ^)_CL
z`xj&9VjD3G!_bvvM~dzJ7i)nFpNbR(yFhS<{1lOVeD0j<aebMis1Z^7ZV8+e`uw9b
ze6M$~1dgOWd~L8Kr6g`e>W_X34BBCB#wi&wHQKFOl!FwU2s;2tM_ii64;M}0TJ*~W
z!ie1-*nxm^z-TxJN)kp4dL|~i=0>~mpO}Yr$40gjx8lBOm{~5ZnJpv^S{f&_9hA+>
zAE>Yokh=-;qwE!}vojA5XuSy+YXLpNhCPU4E*JdS?t5&Hv5hC>>Bi;#n-ec`(i~+^
zeFp-XwkWe<sscLG-5VA0X1dI!S!xBP-{oeh3T#YjwGK4@K=YsO5mqr@X#WbmnH%lD
z%9-+tcEki+p1gG;K;k+nx}y7P8&yQWcJ!XY)!0i&OjNs{7#=B7+u6b^`jQ6tdNp@I
zhQpQipXm{OOWL||Xx(QqybOC0F>`2X_C0AxBfBJP?@{)oK^B|n{<8b5Xor^5B?=vJ
z+z>*NuW*b*mZ@DGNfe^_(SbkeFE$-FaF%q$Cy)Q>QJ}m{seo}@NV341!j~GXJpPOi
ze{ps$xDCTF484*giIH>viw!8MXP_%aU>7jjd>lz8`Mxf6u%A;cp!(><;a2_{G4jBq
ze=maNCXS`sjRtg*O@Smv9UB<%$7OGS+W}lX?z5;1%_*RXObCF(IV-E5)`>O!wTw;<
zkKJNnB$90zaJ(yLhP&I|`8Wd)us|`&XBCP{yMw?;oVbW04;iV3vpNVqVlcyt0Ejy;
zeOZr!;3M*}ul10mLJwuFK;jgUGUg)B_R2YGyVA|Lg&k37-o=3}eXrL=h*QLjgGwVw
ze}UYyZ^oP=2A0IYk{CVD^j6zjKSg!1RRfs0pJ}1*$MsOk^%vP;c<`R=ASj7neG@0a
z&xr?=pts0=ZR8Bie5svdR~#emk;A<{6mQ+wv<$mkxu@jGCUp_VWfoi7wd`Nhr%<>=
zi%2%|OEPR0x@n=Oyo&yZ^-9E>?mW>7*k)*<xBo?06EPH?x^YuC+GXC)HG!Mt{x;-3
zONCLb&!n?_7%<GAO52&K4$XE0cA#kFGH<6r`628~awCR;82BY^)bjt2#h46BK_&=q
zItj4hZpkE@)VT8jpgFd}==fxIwYU*VYCv~J$K4o5++_SQ$_~@!tH-m78-1v#r46vi
zd|Nb&mr2B7=SH|lRSaa)oUI0f0bDyZ>G!14jaa7)Brg93Ju8BsP%n;T^&o6b_eQ;V
z?hF`$n1ou$B;s>=x&;+{+=|tUdnK0`i8gJpp%W56fOT{d(kbytcSMKQt5;bxRF!ad
z;cHq=AdgN{?EaZvJrS)kiHOci)vjP77iP5`_Yu^eEhEYScR$x8GrppKq5^ucU@S)k
z$Q<J2L}WG%AFh7#HiX$)1NqMOel>faV_6g-lZgFdXcv(=lR4X1v4kW}yE?67glG$&
z!#KSsNW`J@A*4P(Bz5W0;1TQ1e>8zSVcS+rs*!obp@v;AZr0~YbRys|FE<Y0(9mSx
zY_fPnn@61HIMj>|s`>Poxv9<hE7X+4n>Tg#ofDDj-aMj!tjt5JS|vJjuQrQFZM;k3
z1uxs`?pejRb4Uj%E;67m{5f`wR~Yk%DmJE^U!0vwZiFxpM6cw~F1xw^#S%@ZXK6-C
zN!hVNV8Gb*MW(SXv_48bVA@!1J<=kjdzGkcOjNxHHvJ>DC<7K|5hub$$(JL(j5U&!
zQpcJI-c7%mWFl!_Nsz14j>wk*+4dMH>#<FS6OpQpU2bEqzm7^Y!k$<Ysq36Xo~>=!
z+0RjYiTb@?7gu~+G_q>Pp}yHC45&8G_@^trQjV;SGZBo*%U2=qOB06~#0wz**{Z&h
zCkT{`?3VhYDPUq#dG!MrT~7ZWGl<20yx5P=+rDr0isNIk2fvNS_WO&S-K4z7TQf|J
z3PF>#IVtZw63ePypXo=KLiWk1>v(H`A9nl~fr&MnvVizb_vziDu4a<Xq0=N7PedSs
z)!_p1T#ezOBh+9@u~;;)Jo5lmYD$v{#rC4ANzy5*6jsG+!I$Xu^u+T&XVD52pVv)j
zo&%P@sGjvIctuOQOeW5OB=4GR5|QL(^u%Q1GjZJifX&D>6-dsY;r9aKt`VP=sYH+g
zZ5!pZDfAd|Vl|a03t{BMae?AB^Vm0IXMh_q2m`?{1q@60|Hmq|x5MeuYWo314$g7B
z_Uxal{NfM5ycHdtZKTE=F^~w(3A?01K%Pk;l~u&iIdk4Sb6_nKlQLn72(!L#gR1%u
zsNrACdR<t#@FgzC)h5V|BZ(V2I-*s8h4BIY0JZM8p`*5J+5`6|>ES!%hlQ9&WCDE;
z+($`Vb;TVm%H^(>cl-)4&xkjOlE*wSL5H7p05LP(p>0=Hz#IcGhxssSDaflKw_ugk
zTy*UXxn-nuQ&=OePjX2CJj&z}9b?4(Y#w-rn#Kone5N7Tn#7#6;-%xVdN_UP(}!Ml
zMDb*Bq{d{+W<qAVHw=o(oN=AkWu{JA1farPacIRKc`;%~BJReeag&JODG^sA*KiG|
z7w!OsN?(e%2Vjj^w#6XH8zfPwLLqz+2Z$I-<VB}*9=H%=h@Cb(YzCb9s^WGqMWlSU
zf!1$6<F6LC<Lj(P4rSMj?5e3wwy~cU0|IiD?jh2lcq$2spcTKS_(DZGER56P1-npI
zivRVOaQH>p*`+oR!$9~-tJO-f?|-qTh4~y(%Fwqw862^;toakl_k;KG{+dM$o#TMF
zfWu^Tm%T{QO~7y$dC+*7Vq1Pg?V8X+>#{d<o@jvk(_$v}=EG>a(D5@Jc%}RQex{88
z-#{S0{;=}|<7sP~<WXw@*8&a`9dx3D&bd#%qN^HyrbM2jt4)k6Jm;vh{!aHzoQkrY
zCZUBJz6yky)9&Bmb=xTlH!Qp#3#Z?PbJXdqH2TCMY9=tFYkr0>=2^CASehmXBxlGe
znso|jfrn9&5IsSvYHYj<Y~ulX2p2qKlaoX?#O<hS4SE<@@sOdAg_3040H%c=3dYWP
zOL?UgauVhSKZKJPaPs2fAG*qJteD!PgV*PwZPjI4MI24xlQ+Y%AiUP`==wn`&Q1S0
z4e*Ie{T!W^0EDH6v*S3^ZCfm{@dWXMWhS1=6^_f>LJrBzD4mJbXXN4*Az(`Y6!W%W
zy0vb*C&CbSVCMlbon7@~j}3u_Tkr4Z($v2IA^Mv`X4c_ZIC$6!!G8UMTWl}r;)s4r
z_*CcmMcKLFMhL?|^h#vo*x~*cs|3t*wOw`E3q%4X!OS-fdME9FhDgJ$F>&kn@;o5c
zoZukE7>?it4M2a=yS7zz<wAugfk;h7*wz$Zywl-HNf+Yk^bE<>lG5TT2ihf^;n9#b
zI|w$++1N72PbpR+#exhiM}}s8!aC;v`}tCg;T$azK|r?`<AO^+PceoMGI4_@C<9m5
zlh}8(-qbiH?B#)g?<v?FGK`1cd^)I==4zjg+l&d+p_~4Rh`5x2g6l6KtXYV{i^5tL
z1T7LS6J-}VKP)ug7YaX6712wmctb%)Blh@fFmty1u$ge3{0L;TQFfsQJaj+?y{zNt
ztI^#>R3ehW^5C8KqrJF`+yVKm5>aryf6<ybaw1biRIFLSPA*~$+mjN^E|(KUo)o(f
z&cgwhakg1h3t1OHb{`^z#fV*BxMW`C==~ID7)xKWb$_id7r;rxgdNMo83qAPL4woj
z%C2w$HHq^uWQ2{OZ0|+>N~V1@8WEFJx`e`}VLa2KLd_d$CvHFwl-IozzZg3g90_3<
zhF&Rcp$YfD*lJn)GMdrKbAbp!OFnk&e}X*6c~5u(>Y&8NIDNY!zz})f5)@X!&az|j
z?b`21Sl7PoHfrB*enipKB;)G}y4vMJc`%Olwc)1Q_Pb~ag9UssO!R{7piCIyaWraK
z7>eu1yu+r7YrJbjzaR%KEHG__D5P*L1dtB`Z4AHsv=s%@C9HX_WM5EY+j%+&bhCI^
zlt3lya`HF4`NSp==t?x0p_X|ML;)<i0%ADY+XnP9XbP>>+rF>^;7m`9=@Xrt^nnWI
zu8OjOsMSE!YS=*spy3iyGuBBFloUbkKxRNxf)A$7aJKeSxG1f(gd79{{2Qx`)BVUY
zdPR%gP}hEko+#I{fgqHU312)pMFT$UCre?5DI`5nWG>vSYCFDlf*E3C_h^USO{NOz
z`Ag+CfzVn~YJSLAH&5wW-wFpNm|<ZigAe?umcL&1>!ZzkVVj_(s6`s{F6SxO@R<h;
z<^i`RM3FsQJC?0ssup2VM(b|4M3(Fw;%+i_Vot#kny!QT6ETV(#?B>4Ll6eSS0WM!
z-2Y-@Iny7`znGq#E6UOcG5vbb{Dbf>lJy9da18kZHO$le()~`%>X)P3mXO1~AsF!k
zJySL(GhGi<V286Iq$dy$U#rKd-7GZe${@|@j_#{Mre&WI=pm>m=4f}{kKpIBZ;idW
z>8K7;azdUm_fBpXlAJ{W_cQh3*Mz5bxp7VjJbd}3KuBMVJX}>HJj9COM-B7KL@I6Y
zWC=Wkjx)w5`^82P)dina4kzOrK%78#^Y6ZRgopbgXy-y?(Fxjd9FYP&d<A(!$El)z
zx_!_j$2E+`8_97Rc+}qZK_5OT*&DEEG@`P4r~*9<fT(yyDk6UO6+}lpu?L_K3yj6t
zw3Wca$*T|a11ERIT9+2sVd|(4%%38qADDC58@gz!WDiYnX@-h%*b!9;J6z%`ZMpVD
z(^eMEWgXO!9E#$Yp$ZyszgKtYY6&|0CgFs#5}we6WFNDu{PBDEZ)l`?eGbbaU-2eH
zKKX?J4fiqQ1?Cs=+nezg#-(VFA}~d39TtQm{TGVE5OHN>XGHNu*%{?H48lP4N(F2T
z_rKV#qRgXeyPED_zmQ6lU_9eDB4bs!>t>OIco521t*^_${otL}SMiotI}>bNacbD~
z%3|aYuTjh6Fe64a)9z8cg7X_Op})Vh*}lXJI7@0!i5Qs5K^)8ZWDC`>bU61qoN~PJ
zc0i}dLHwZ3_mES~tMeu4a3V(CsU4R$12oZa9oJ&)aDz_YixY8kB02(HNjxl7X1HZB
z%U*;mvx@4D7H3AM0rBq~8}4(T46;Bv*}DJCy+Nkfw~QD>J^H4C^Ni8jD+}5o@VSnt
z0iNF8pA!_`{e9LOA&d2}r!sSfK~fLqkkit3Zxz9Z4;-Mt^lChq!)$hQ$<<OB6(Mj~
z&OuAN+l5Y?=OoUP`e)&_b&QLGRr<-aOY6;>c5BkZV`vQ~+N?nojqBDIqTwQhb@A8M
zJb|8Wk0crr2HnA2SAOf?EM^Q5=;#AV!}?~Gd>O?nDH(tyd^JCD-US+;^s9fhw<dEd
zPZR*|@C$sVZQneJg-4nL`J-LV_`7}c!`Rv6Di8ue_)5Y6)!hGL8e@H!_a-TKu2_r?
zcGs^D!i}{l9otBnF}g=WM399`rzh_C(^17I1Xv~uNAs8|NbtJgdeq`Uo;FVF@&L0R
zaMwHWVG`OqL{qF7qp+RK#P18Tu=#p^eR5n+8A=|}q@m+71mfx^u976qm_R06hIr_B
zLKhyo^kalCTobX=tiN62Bf3ikUr5775oz-s2b|tlEQYJV{)x>UUt08Z5EjE)bYWfd
zrm7>28^yTM(cKZe-1_{rfJWF1C$z?7u#=(ft|Xt5>B8+TWAg`1S;M6WD_}A_?xpP|
zqnhOpS&Jju4{QJL!dh4VRo|?-3E*W2npOwBqj<wXKzHZM=e6$+kQqIK|3yy=BFBT3
zf!xkm7AKR3uNBjtv-Tj~(-@$7ygx7*b{_Vf@L%!%fIviQLX7~>%OhDnWcE<~_;V)y
z94i7_gr-O>#p-<grJ`1;M#M->9=1i-@$$wyC+vQVozp&m^hsAL)+bLxZN~?Vb=G(6
zhm(3MO}ros#mT|s;ghj*v5gppVdzSc{G<0@tY~399|E-O0z{H?F1Gl)O|^+mAl3d`
zIkyNdMK*cThmtq9ofbO-L{|Eq??9si-VWrSKq~IAPm$O|cqQ@FE1lL}mp<(D$P?i`
z`z^tn4hW_NN{edPAeKIc+ocK1VZ5y$sSnXxb1;acX`ad;CxaQ4+*Clt9=3QG-aY^k
z7np7}>X~nXHP(mtzp<>h11cA7zGdWNi$G^*#ub*sOGm^&A3vBTr(KK`#fcl^Jiji1
zWS>xRhyAHJ`5@wa5OF?j_k#jYcu`}!IPt;PY}l`vpbu5CY9SW&-NdHLC(xx2sWagW
zb0h593j2uq@6BwTz__vf6;-Q6*ULdI`kB0iT16fb@yL*~4N8;k4o!i~qf`vN)g-2)
zb=9-%FGj{R6$wE_!bisRv_R#f%@QiERfk34`O$J*zpn9+8Fw!!Ouxeqt29&5hZ*It
zISPxPee4yR+5h~a53_B$IFaGaiX0u&-x`W(GA9Ey=VgxNHbsI$Ty-*Uh;t5jJCFvb
zrg;QoeXq+e%FZM?ffxvaUz$<3q}KmGX2MV@m~pu58z&tQXsabZ5CHb*S&|QjE}T(1
z!j4ojd{~*Jq#ouv@&=>ejk2tPyQnQ)(!(F0)DpRr|9ITY?98uAH^u&wX@?G*KPsY!
z;N+9=S;v?&EgiCu561>^2AAm$2+MWY74qQ^%GN9J8!wH^41{+{T}|!Ox;PfS>ACDc
zc^#<3t9%Ru_0(ApD#&Q<`_$dj=}u<^4*>ye2h>s(>vvkhj5Dv6PMYv^ZM8v*+VY{+
z=o8Xh911VSVK<-H;ANiSq(T-rSThKD!-9E8OJKuq9ey>Gbl53{?UX%@XawP$pjDC%
z2Q^K4sOo1S_d0>C5(WUyz=SUOkCvtadWiAAg<7>5{U(|2iK!$U&LqaBd7sa$_A|z2
zzv-bk+!T<0N>rbJC6N?$rP$ifq#QH}tNZmZ>leb{TR)dw4`Ch-!V#%obi(r+hjSei
zb*0(J;cM!5OG;0BR6sgBMB0d>Z!h?6<#SsY%tPkBP41a<ki>U#cp)9WmCW8t#m^6z
z))!-Eb{s(n1JRT~qs#dx=CVC{tX=EvO@I%eKvG}N7oz5Hye^y}e&9|n?-7}Y<WhT2
z6;wM>oXXmMa74SNK{Q_kOd=W#`OQcD#c3ml%o+K?JyJ-22Q4BH4#}DEuGd8)J*){M
z+12p6&<uWs#=c$%>0unoWAUP4O)lv@4UYIcJQ2#kmJ5v*z?pSB3pxB-m+jc#h&lYH
zL>fLfs7-;{Jvd_Yg2j7~el|!lojaN3;RqcQ*Am4Tw`461oS2(Gde4()$4y@TW@ry7
zI`^L8d&Z!oeaR9AIMKj?ek{y>=Oip;FWhJkd*N7mg6)^TtEg?@#5MoNUIXFy0!}mq
zMmO3+q+^C?-2$uHQgo_Ddx&JvD9qjISzY$5z=<!D8?KZ$o9IKhp^r{3iP4s9HPIiQ
zu^>^|c`+7jxkWUI30Y`bj$)MCVe-)Ms4*x64u`<c&!}F<K@{V-Nu7{u_BthW+XX9c
zDC)Nx^EU?$QSDM>%mz}lDID*hLc4<sC$dl-8VbZc)P@a#HsiRI{KIwsr0k4x9Ed>}
zdZi>V6S)7yR$A4M{d4yMQ9D&Lz{B>RgV;0WAUc@bn_-Lt?j@vnb%|U&FBXmKa$AB`
zL;-9bwZxwP`(m_-LFtJ73Zag19ZxQlh%tFR>?-3d6W7jQg%l6GeOl?dA`4aaG6E?Q
zRJ)tq;K?ZVQ>LQ47E=6Bk6&f23YsriN8`PeY`hcNGEPV355l76j0vGCzRq!jau0jL
z5H~Sx8aIp;bB68p&?IKkG$zZGF!!{OLRgWSkCN|d!Mt1;bb%C$NgV%<z#Sy)i;*0}
zO)E^jmm#Ci=k*^*BR#^7W84hMl23ax_7v9o-#;XYyedHVb#?<aYDBVe2wcz2lIV85
zd9O*h(C|W)<AY%H+TOec6k8W;3*R-Sn&G6wEt*J&55H--1hn&AZ;`~e^=v-5eutO!
zR|$VT=B1<)H>)}e!A-bh(6=m*Jq6>X%ulyF)aVcwL%}s9fH)h=qkEAhE;ey6oIM!M
z9_uaLu*8QBj}ZA}py#}bTO<)#0e4vG=Q`zjjz)qg4ag5+XK)2U2*S{o1O^@YZ*2F%
z$G3Y(10EbkF$sx*eL%6xZ*CwTDC&sfJker7ErctKOOK&*??dcKq&2C?$g;7;1B-d=
z&*(<V8H(sbeEW@TYx6~0w&Wf`jROy02tuZkI(Q8CFla5td>@Pgp44CL{0@_RpYneW
zba6s1)Wy7zAQ1Lr3oE-&yiGNSI5IfukSy0w*1$#ZA#k|^mwV1*OuaJ;0`V=Rf&~lE
zXS|mJJPQKx;-dy;K!%-4=~ILs62<85<Re_+hjJmZhx!S<vyaw8hV%F0QPt=GABd=J
z{5gv}lPx#9&uBkmbi-tJ64$ZhLa05O+sedi4Pnie34zrt;?<GCYHsF{mRyF8qdP>4
z_HMG+6E3UjI#7FH^tcF~T1{?kNsJdX;++Z0(D^*-)Yy47jTm+aDJC%69WAYr!d26V
zD3)I^uSBr^%0EA*s*|b)^Fjl;6*N$R*rUlvYnQA&PCzM}J7`3k8=8R`Bz`F=u3{8%
zp%z<QL5$w$bo+u!yv(f{Vt70M;ltUP*dP$YK(M96dEI|why#x~KrGNeq`O3UyzAL(
zWlYX}_H6N5g;^0hqk?vMh>5m0oyS4twGB00M*De)iM-~^#&C#UD|5*`yAW}S-q`K8
zqdxms)e1^6vDiy^NDr?35hEf7y07V+cWh8}TuDl!hmx2upGJx57nqOt`OGwf?7GUA
zOfyd<kt!$YGtDZ=&B_?=9c(%WYu^Oh2hZE|r4uC)fupxcGnvEwQsp2ICGl-o@`4gj
zR1cVklK9B)ui)(Bp?Z+~#Xxq-Gs$}L8U@dy5;h$f(Qsv1ETG+1?i=#EFnTlyEOE|T
z<yKx)X~C0V8kSxox6E+W9IHSKG(T!m15HZp_G7);b4E4=5G$biVSP}Uj^=E92t7$h
z@&}O+7v2-zm`+-dny!!#2e+4jp=M5QQ&TBq4!<;eY7Mq{K}V3!9|8|KG3t)&h7$@%
z4umkyz3i{_RZn~=HR((iU6tCDvgi1OyJT>eh+t$z&n?Ro08BBxS|=aw3)Aa`vNOqT
zAcle9m$XqD{{Lec*zTfX80qAu6M<PJvbQQEV0`GvxzW<^(7w9E{-^~a7SMY78_+rc
zT5X|3oziGp`<HRM`^E$!z9DUsgdJRJeArV~?4hWbq$f^1e1;w6phyg;(;@QXgH!Y3
zY1nDS;pBlX`U@#0j(zy#9^y!c3@G%(e2_>AK<u6Gtm6#c)cii&D@>vNkxqbz#_Y2w
zueOXRc>v>;z&Yb8p`|T^?<3MJw#0kI#H-mSro#vA#t1Cwj(A?f>UUE3;h37_y*9%C
z9)}7)RF@DGx>t!f+7=qWIa3keaoM*T2h$-5@x9V?=wJzycJfi8MC2(8t2DSiVcnNf
z2x6eU=p{+qm`%8C2>h_=4oyrecI%A2?DQTp)5bWjtrFa|zh*<`RXP`1MC2)J6hz`$
zMEp#bE^Vb)>Op2tr0s!_B$h%p1VnE1DckB(5=kPzA|^4U*EzCaf*n4G6wh%5J!?hy
zHd_etbmeUXc^jfZj&83?u`OinOxz+Co_+p}7J9gTC_5Jv2Vxk8UMY6IzW>EqhU%qI
zSg{u{X=)sgWl0$<=wPpv>OA*w>tZGNaH)En4ig0XZzmjDb?4J8F=z!cAUQl^H4_Mq
zt<q;OtXM}&>g(7-E%30zwd-*?ay0nIjozbSfS52rl1K4s)s&l2zaxpdMJ^6R4L4xP
z_HmLEVJD)^)lqp*v}`2Artw{#xFxImm^RAz13BKfxH=c{cOZc-g=-7o=w%QuD`Xo@
zFyd&3SFv}jQi1`jKNG&5Fn=XD6UqAG^p|v95LM7Nu4pI##&-PJXpJ5OWML+|9%41`
z8a9zY6LD(G3rhyGI4heK4OLTMWHLY_Mk_WH?aK%;P%+8>>tRF#P^3QgQsG}s>sgPB
zyNfiq?H~Obewn`?+z{2G=L)vg;g{^;?+CgJWexi{w4t)wvL;Az!q;AikME_2dRuql
zXz&uhv@G;ifBNL7m0dQoqkccnRs93bWmwIaXfP8=>{H<FBECGppbLbB9HKEpdS@fz
zD)ReC+WXK>eo2y)%2xjG&pWJsqP!S8w_J%q7=~_%mXyH$H+HKEpUi#9{hKc|qAekI
zY;Ta}1f+Qd&1};5Ntw|22-i<(i0!QTCXAoDPhup=rPVVWmgl-x(%o86QK+L1Ax?dU
zJ!MHn9Qs4&&~SG)1PjX-S%itlRmn1dx){&fq3nC5^_>>zT+ut}O+EY;b?|CjIvPUj
zYk<o&ThqiUrVgWI1WAg^7u5qwG0_1sS2aFd4wrpuIGc)kTMC+3DreD}J<@PCU0`wn
zTCJXH+Lszx;+bWMk-s83?J&x{()gp#(`~j9y#C^}Mw|#-J(Y8lk#HW%|E2jK1V*N6
z9QJx8MsaCeXO&)o3&<Gu(-5bq5=076;_!3-vUP(vL=>r8(E5yIBA|G&JpoM)I|)D>
zNyJg6-J<xxlj|O{ThYE7P`3(0)OgO9>HHCp$zk6hoJ}=FQvSG8j&<JX`)GKZf?1wH
zATyA|wT9p8LP79ji<&gA@612{`N9k*rf(afU=Sq9tunVro}KncBO8(aV-h6?vuHOP
zjpC9<@d5xHk0AVuu`|kXAcSG)l^`S#?tigX+VzXnR?7VKt71kOFmY`EefQA<Vnm9I
zgR#^qro-cywIwNf(GCO0hy3f~<<-!y37I11GptCk(I0^QsJ68c?V_3WC7H?l+4}dr
zzYVpfe^SDJvn|O=Nz|6)rM5r8Xj6Z26vLQmt)#G8ssQ4_34-Hk;CM<&E{xGv^w?TF
z<AVNhEF$-SX|f&}RZwD?gK8GUF7}|UUTqFhjiHuvoXY+r3!z_7S)QuBzi$n+2HL=O
za}(3Jh4!}?-LynsdRv?>qA~0%Nk_Mao?o7$XhvOQ%oF+Cz)f%T|AeM%py@I+U52L1
z`$rSPJ`8^zH6PDFAawi97WdP6!Ri;o<U<PNZ3_UsVhHuWe@&QX@-6#qQd}bg2Aj`c
zFk<&80;-YRk-62E_v#xw=&ccz2=bdtrM<T{q--6)=YVXSYGV5dzJJ1=SAT;L-?)!<
zl5`=!q?R(htx60~!=Pl12>}}YKH9@Xoa1j{AHfE#uy2kMEhe)e<S!bw#oPNeT@2r}
zrtyE|z8E{RBL_klh^7RR0Fi%Ud${!E<D;E`syu@k==1NMTu80y^_|=y4fP!Y8nBu;
zM}8`ccf6%rxceh`G^De04w6t2{_|BbhvC)mO0kYvdeUU$9wi3+w~DGc@gCRZ)_$r|
zU54ws1W~A+Ow--8WYhaHJqf3Iw!3B^TVYq)a!tZK237W*giAhF<ks&$nMA|7<9@#s
zWn8(s6SFxdlTlu#;C~WdtZvMUC^=tZ{{os$J}2CZ_@crSV`kEBZgK~Qf}Dx^7VVn>
zAiAcHh(+aQiV*XmntvQk^;7Dau7bun2a*r5rrdLJFh1eFi!%kDucf~Oco-cAyd&bi
z1xTK&arPo2Z2|m3KijGvm?iCFa}*O9LB%ZU>$Phi*jFFnNJhn%Z)E5g&A_>ofn(01
zBF)Hivdg5>82=s%ww#0p8;r}r5_dE*r6*AtS`qf{v{>$>GE}bb*<>WyYu$iA2;esP
z?j`}LHc4><v>z1#8AD#<CcZ{5tIH;_>X2ZN{>3Ex1yyu(PW`&{)gd28PC8HV$Ulso
zTaLpp3<IxZ`knh<Y=Nyg2HFqi0zryKvMf@gFFdkXhoCq$bBsP8ZL_my&jRpj5OQ1o
zbw*0MBwW5-ETG@J#oL9fNG_;6>sqoeRxlo!vLHFc(nlEmLnfB3xCKMHpwz*T60V=^
z#Ji#|O0p<9+!MT1Yg)K5ok*|XPNSzy^@q#wA11hty$++T2|aw~2l?AZ1!9Q!vZ!bN
zitd=B<95I^9~Xy^EeR4PRy)2hj6P(NuKdefn^ZV_WZaASSou5=qmHboI&{Jhr?9`}
z6iVz`EcEb;Cn@^A2HhDmZUq@qP)P?vlax!bZ>q{_y6M$)=Zj>QPTov+I8`6628c@Z
zl7}k(DKSVY8qQ{5cBA1u^p<;m5_|;!ffkk6E4K3CW?>TA@&=a*zIC^#amlhIZcnxO
zy@NIfY(>BE|3&Fu3Ye&PS&}8mO60FipR2n}-YZ^l)hM{>yb=19(0^0fG)yEwhl&Gj
z4Bn~dB+{5lCqdo;p#lMIy?CeoV~M4V=#L%aGi#i(IJwUm^2gb^;5Z1wK=ev+{@nj!
zmD<b;T~?Z?2f#uQLhSi1p>gJ5P}XX5b$})(xvzq#+8!+19MK5$j`zgG{?`WW9cJY!
zO|%df>0UUqB?xH;PifooHEj6=n++XGTl1AFd{(s1aSLoXZ{nkFCJ7O_klU)poo~l<
zS1CWpMD>=rN?^04OT?Bw!X#sqJ27?jW$H5&5aUY1^KuOPp;VM&V=KkPDS#(4u7ejx
zPpRyW)@3cwx_Zi){MNlg7=g|<2P}h~o-8IbkU(c8^EVN6mdnA5qo;%iR73=-m@~F+
zIadKtSqZk*Hb89Z^rzAmPxV0Bxz=d#o3A7hq<#dK);892HTg~g6(qrYEBN7CxN3v>
zB7iBe3jHlNb$QMuJm)^{bD;U!0=)a&x;{zQAJXM#Q8GSmc>adas>eSJo^1r<pAj5D
zpnN>;v2`wXSp!mT(p8a&Ef+zH2c)YINI5hyoryTB1pCu&+CnI+AgZppRGIP+Dwk!b
zM2GyB#JCFjV^&bITfYFxHr6!pMcKI{ISj)v^h%<rU+#agXm%El6E{dYH&MaZ;s*q9
zyK{9myB&1id|Qhz<5U4~pK!-%Xwx)*(tIjH=mz;k5h6kuWd^I3UBykV;+=l+uWb-&
z{Hz)?DN^n7skRhV7v|k6+z*rYbNrl47$y4GOL)oB2yj_Ps|Wzfp>W@){=2ewL>V;F
zBM(tXCMjfvZ*2i7cQ1)7M3A%0?d{!<rYb|S53`JbIcRS-L{-<TKau?1N+9j{IL!x_
zacZj&PIZ10B+N(Uz<ldnP3=lwZ~A-$LU|OVbyOqmgZk33Xi)5upQLUJ>bAtp*^jnB
zC{LnWug3J&p}OIQPyZ#X3i8s_anGtsSNM~VWk7MFDG7|kYb|}VRMbe&<)SxXe-P=L
z0JK&0r6i)5GxYV&@Uy#vLv*iR2_1BHo|;c7$gB1j>#j0x%WP<``8J^RRkf^=OXex#
zby(>1DWzaaHu?tRn_Ud2?c>C}1cqcnDS(?2nf@hEZNe%q48T5Eda@h*0Z18QZ~d1U
zALZoV>+4Rszj{-4X1NiBFc7^GHd}N5i)GZAdhRSzC4cjU1~mdhRXu-w3kYn}@6UGp
zl9WLCmdS6Mg0K<u5ha{<B}t$>dQLp5-A*Yb);SZWDicuOs0oc~X-+>iS|*8{)-}+T
zTmhF214OlLd^B;&|969mASuaz>cECNu%Y{9z>QSBqh&E2z|%%x4f2&hfmS=%vkvx5
zvUzmtRZK{$k2ek-aw8N*A2y60*{UNLmM)qlc7T4C`uiFQ0Y2iFkqB~xABp!sI14Qh
zOca-0e$UPJldRJr2K6Ea*@`J!VT6HfB&pI0g;;}lB2Yrd4q9Toe(AW3^s4|16*X#}
zB9Vhqvyqo<g{#!=-N4O(s~r0e>xtdF@KY)VHksMW_Fs%7G>MaXErs{@COEfka4w}$
z?iJrfQ~7ak_0$cc4Lo!-4YJ@9)Yn>8>qrTd+2Oge1hNlax~zXDB~nfqI%eIQAsSuB
z&rNNWR`uu^L<D3muuz+~5#ZBmsC%=naf>!Bmpv^r%GbTQf2p2WyY_FpA|+8WwM`Od
z0?DxGmk+|u0JmWnhJjylD9f_{|FIR=bVgSc{6NsSi6fcR@zEWcEQThFh|+{<WWRC}
z$-8|@k-N>Wdob)g{0;z)^*}c{u*@z?WVk%FNAOrTw6|<aSDk~&$Qm%j<YWyHv2A(L
z?z&6+_;s2jNAVrtXmKREQ22GiUeeaL2b<YznW#=}KcFj9-UQ7)5`1+yhu>tMOVuZV
z8_RK#bsbiOm9PjxL4}Ss&!T4bZyn)|H@Ttim3p&W!`3>2%z6&(eE0J;=~1SCo?5Yt
zmE=@+kFo@;K-T`I(D$^RdRnpcX*-WlECZeKnz5pdPZ8U%(|l)Dus2oHJksmKYPGUj
zg<rEz&T9cv_P!v+`tA(S(<jyP(zmW$DH0lQW^I3)a@tZ}Emvmr32O54UPpb^^o!l@
zsrDE!QSnE@_&pS`t27}1VtR_c(n9)PY2_SUMl10Yv`(=gZykSch?UG8C=ZI>#`h$D
zcTfPw$G9L^sXhE3N9bdTz$INe0GYE^KM`^zWrfy3K^+Xk3|r_-I!ufmm5>Rs2R{GF
zmOq@G0j`7~3`DO4rG;|;i|xkEJbsKx&A$LqgIL>{HxDZb>>$p_7#&=Vk(OiiC8_xC
zkS2~jkJ2may|nLf^`1s}lM~)lHW(}pTnaSq=y!~pXMJxNE06Y#nt61j9rogyjA$x#
zPiUgYYlD{Is*K4vh7hpOw=#A)iZiIKxO0dtPckBE?vZI&8C!?R8v4)4rXx3NgpLvZ
z_+ULWj-|_lSgo{(_db7d2i1%$zuuG#EPo){pU?mjm*E*+^#<4v5vdD0CD59>{w4#m
z>6MER4l+U<`*?9w5(0S=KHRxGX+*D{YPFIAdo{Jv&<c8Mxq`HTntLSP>@5MM@3P-z
z1VFC4dUiAcoi4L}wGJpAk_7)nT>Y*z@9C&L7rnfJ^u4ZcCy=Qm{Zn;Yz@?pS)lWNb
zD2)_|$=eao)^9%vkS>+6cbWXW2c5jq;AKoKC#tTg=N%_5{KeZ3zSaK(hBIF{nzdH$
zfdxTL^97%V)nE~{Tt6pll^i3Oa?qJ&)|Im6l^nKP>`f3Tu^;qPAIi?aHewitfh)yw
zWXt<6)}jDUkH@!67chb(uq}!_y)ToGHly^#8~w@^yrPBeU5VixelyyTrfyUP)c_af
z5dUkdTiFB)Sh?sfRsI!835-GLK`hu@2a~b?_G(oEbIj2R1C?4f{}%Kq6F+z8R&&4L
zd%YM;pE3`%O>@|2cnn`A!*C^RhJ}`<x1EkWf*FwDsz#u1g!GM?{*>(@kQZ@7c|#{-
zTl1uUCZPeT+rN)if?X&8;cr@n&dn||q)z9QTVXx<aEw_mLR6|F<{|?5;0{5UauW_I
z5!Y4Nc(q(T%DAPv<&pDww-D?NouMA(mcw8J=3$Jm-$FV>3BUQe(1GFpr@#0UqWtVu
zW;FWn&(sn(bFDj2e^70#4I>V=zyqvO{+XPBknZDGB4oDecdO!0pU$n+BTfO{-tVBf
z8tGp+z$x(}X2I|-pvj(K5NcDFG-c$rqm%YQ$Yc_t9J*_*qd#C5f<)OM?Ic9`GPO<|
ztp7}{8?!@{?RS6+{AUgEMcNtNMhwF+bfrkNt$6>%dLQL;aVe?;x`2TMu_Bw|<71^W
z(VdKRW6DiHAMKvgF;V)yd;sGdmo<~p?pI={dx5#n`UUG*?Mh%C7MO<xc^`=C-2EG`
zcVlO$*uBKl_Qp<~d`KeBq3E7)is(&ivPL;P`7|#VlzH*9j8?}}5UV%yU(Re<qD(UG
z$MkK|tV85&n<X8Ul7fQgXu)Id^$CUE{g`q4Um1vtb&q}}RCpgvk2U`uRyywb;5B&!
z)>FA6giK^_jB0^+vP}7;v@OB0%h|u}`h%qUBZN2lM`K3NS=X^G3ck7}Z<NvU-ejS2
zo1xCE;ST%(eO*crCTPOx{Wi|QL@k;@Rw=ieu1$UzF1YAb4kgt)A83YkUHNG~Nhsf=
z*QJYGfW%7GHk3*NK|m`G5B0?a$-J^(iDX~ZBQzZ(+U#dUg+#esa&yBVq&roQX_F;N
z`laNP%smPFtp4Giw}4|2368AP22;IOf;SJ$@RWccMDFhEn-xkM7hZ=b2xP@retnmK
zFUHOVw_zBDp;t<*kL~+kY(r5#2iq|A0!Hf8jzm)AKkKOSmKYP0SMKfYw_4m}i!Mbs
zF@bKZ9w5X^-l<CIPHeU4-qIVpN96AS7T#D%N$&$#-rA<u{*dr1(lzkE&gDx9ag&q0
zB!oqSQG@V1t%`dW$D@d_odhHLPc3tl*aeMw9g8+89i~70A|@XzHO6X_jK#97R3s>%
zilinJUNQ%3%^T2?i^#quf-~vebC-Xf@v~3Hl;`@mPYzL%$swytID2ErGHn3%J7)G7
zFp_ko+}6v|h=I$ijKVsPOcf@%{YJM;Cqt%_a)<`9TmJT7baFMfnNa(63EEoadkB${
zOi#pN5x@}BKafi7qN%Bi+!WDc-=8}BK;j}>P+JRWqr8f34SqvJBp^a+Y@*Njr7u9S
zcijR=#wJ3LZ08tuR6QPZll&7;at59-qx?!o<T}x8=#bsXDQo}hiV#vncgTO3c&V^X
z;~^^Y)I~3;p5)i@d0hk*NmfagTJ~DVK*!}*LMD}GFuWKHC)Dy!u<eVobFpC<gn{Tv
zfP?MqzgVR<_pB<FoGyTXmSB9p?~wp)s{cEy>dWV=!{gO(QnOJ;xMXIvnpYDPiC8Hm
zc1SNdZ+lJ<PzsGeVTR?fwXsQ8hWEIncAs%v)od=zA^hw|5?~{-;u%<;Ox_OtM&s`)
zak2A3@~s=>fpMW>@%kg{DyA-xKI>{)S-fHk5KjHzuv)TT9rd-islN=%a`!haVUhzx
zV&Kd?;59`5#T6d8BJr=zYHbSH?Bhx-syPBTRjtiqW9_$RKPQn$4vEz_f>jUj$ZUZd
z1CR8?FjnZsET;3(*X*UBL^t6RhY;S`vwzhFEGc%}wc`sI;K;s1CQ#Dio}0JJMx}rH
zlPp>7C|7XFdm@@rdsu`@E{sqQC&d5|C`a@^-Ffe{(7Z2rdwaV&0h3TAVBBp=fu1R0
z0w!&%n%s2SVyViB-Za_-Onya|z?jDB`9aSHn^%DVS3=j~>HTr|?5Cs-iTv58`~MFT
z!ICp8bEFisf=buuD-*<%FhDqLCtB?LzwyP{xu7r%!!Yzp`PgZ4|BDSu^-{VGja|Ud
zk~U6c={>6)+9nye1^wOl`iJkgcf2dC%K$VL$vnB=;iO0|4Sy}k_PtOi{q+&PNm}<i
zyIH5&diZ<ajg|zEj=QwR<Tk?Jv7k%d0KN=K0>e0=zOGV#`bs`Frav@+(j_mzMulr|
zb`)TFhV>M5>5|!*Z`P7T-0FTyBHgv9D{W<Q4uDV_UU1u@q^4vVxTz~Lq+dZHuF|!<
zmsa;GjN43Ij@g!rWLH9`bL!Zhi+_K$Uw@R%cA~w3nVUm~=fh5u1jfmPV4!!+QNp%c
zAwe=}w+3}?Y^Q9#k_5@AU9Dj%>ey5xr>_)b4Cutw7$i%4!C_C!fgqW@q!d82@wU$d
zR99)dD{TX%Z6dc?88NmXS;&W|Kuoan`cauE^Lw&OWC5FO6BGi|<Rp!25)CkR(3t&E
zh7`#j{M}gHgfZGDgEHBHGt@sYKS88xo7k?(hfn}(00_j$xQXO4VRxAl#`xjchzQif
z9kpzu8yVOSd)kY!bIYw5gn{Umc#Lt_|HfLWnM2iE$^7LDK|+Y*dHpw107Y1!+P%8$
zc@NyH6Nj^K(ZnHkITc!a*Q?`~(mN^fEX`)pUEYiYRZ4VlFk)B$B)cT1sq;&Da>~7*
zUOMP}>7d0(q)jGhYo5~Nq;l4$fFVhNw*&>;O22WLWhRR7c5Q~XUMKQ_ukDX>(I`in
z_)WXDNZ`vx#1&;dA#{_&9KMC)P->AISN1w&P%_<C$b`XT+MQNCA$J4OsY7t#UavOl
zJ47#V;O*;$DJ)X`zN(+v^O>&G`(NnhiHo)Q>`uOM832jIbY1Kuawm_e15lziin(3(
z%w$NiN6?=nS+R}dfmE(;QlAh#>9+(tV9kpeeYgbnuqe0(jr<<<j6}z@(J@7ONrq`n
zc9en1v1td>dKKzol_U`1@fx-poMAG!HW3DG)l;H4(Q(3EJh*-Bge$PgAi`i_$|Uq4
zHP=zbCXsQ7RQAVOnfa99f^c{pK5|7eulBFZw^@!v=`9K`@d<}h79~t2Vkjw4X6hvL
zcJvADi?K6Ft{4Pj=#>l>jk*8D;`%|4Y*P9=uP7Tgqo&vrir_-XX<gZlZTl{)O-3k>
z_F|owhk;dOZim}IZ<$3@lZHtyv*pbf7O&H+f<Dc^>^L8M?ygfyllVAn6(>ApwoEx(
zMaC&%;6uQ#>jcroVWP7)(f?V$_lO~j8rV%e*iBhlv<-XiZMc(KLVh!k{H7y#09}qW
zPNA6;qDl2boi5_h;*SHZWbjs@EiJOh=AFMzOmUpQY=*pH+F$#d+~Y3r*+@0ymSPHe
zQlx~4I7;M>H~DD0?>~56-g<#n;?L^aMdsYm@|OYU_<i02M9V$M#EFtnVf1>rmV`yn
z7_8tu!W1g%+Y8F3(SK;l9=f_BqOU^pei%XMaImi%Uz{uoG@i_-wV<gSMNhmtQ;~@S
zFJzs27>~KixW4dveSDUCpA5xe`2J+-v=C4}kb)NGRSQqltK}ZIi?NGfc}Z!|Cf}$0
zM!ULepi;$K)kUeu!4YWXxX>wgbjls-L(eZnY>0VEx*n#b!%@uxWdg*rhx;q&Yd?&g
zOKt-(3`4KvkH)g^f3X(9@F|O;^e!s{P8^R$B%iKPwt-qX259xcATr@9K0tG~5|MYg
zl-Hx{WR(neaiO4Ajt(gd`DBoL?HAuu{5QDsAsLW<CACke<AHJLW!F>ZqHwS1OXLe)
z`EkB2ZMRb5e9~hVGgj7UOK%PfNtLrrs(2VdjH91^T1Swf`~&KdhZ^qq>swMKG_AsN
zkyF^sFQda9GUAO;6nliq)3L0g7i1{En79m+hKakw!s|j(<?EOKc)N7Ccd)xyes@Kn
zC)O48a#kTj?Il2ra>Bis#n=WHcv0wXif^S~$5DUb_fulR_PZ-570(k@UVAl8fq$Eq
zXc_!=Yrt8jhrYY@u0_QtnP`y-()#eH^RG?Fmh`NFPi{p_E=DW`6DhH+yq@{-dgkTu
zv*%Kx<pdA|QjgyE1s^6PS!Qo^tm)|<Kw-ygR!EklL_0Cjo_e5kAEb-J`6g|clU`M;
zK|8iKIo11C?Y)$tigQ2^Tb5EtwcN6r>~fsp6kUF6Ovg#4zU1>m*%{<G6v8m{O2Cgx
zxc|kb8p)4ErSWw4)ded3GzoER6XFJn&-n`-Z2t~Jum!1Wz<^FKPUAMd2gbCM#y3`k
zF<;8C<!lqpHq&ceFpl#@PGkLLkLXL&KkN}TV48X8aMAU8Ke;pX#L7}YmuEBDLz@wB
zXJ&9m7*e+TFtg1wneE@HR_EPagPaf3)oVucYrmRSx~e>`1|9(Z!fr380vWoL41<fY
ztXDhHy`S>#P{q_$#nh)NX6y|KOG=k0$IWm2h)$gE(1k7+d4RIwDGJM2#R(#1xj(GE
za5h-zGe)kkkb6aP%3Ru~2OZRr*I|^(F<0oakx$|&n&|RS1{7-Dys_@c>eA$7GYJcy
zzG`tEEAI@22lF5{x|3hof5@<90q?%HbxeEvt##IE7J9FBsUjGzpgC7rb54dWk3;Uc
z+R9FqTG6sWsJ-GJfE88Gt6Wxb9bkFX3l@=^dBfiuQCbO`1>=MKLoCXcZ#jZQ>E7b<
z#PLGJy5o&PfR&E3+hO*b(RCTDd=)ga_a{G$ok<pgFc3tql&P9<|BLAZ`)7e#*||dC
zLDJNCJwNH4JpH>0RjH(f-#<uoO9*e4@OKB78J}E0uPxFTd=&pg<DFc2y2||dajc{{
z%jF2FGEmdk1(ylj#c~Tus#0Y8%oSkG)Mf!{k?pGJk9`PgxO!?>NmaHxyYBX?rU_=y
zK`@HHHn0*<7x0_U8TZdWx+9ShNCpbBjyRWD$d21u0k5dd+xbZ8-^hp%TxGEHhmiIX
z650GD30H}y3cGSSccpadf7=xjb-Aob=16!bJ7`I#W|4S+_gB1qPX^sjjiA`PHucmA
zMz!&-!beHqSf$*)Qfq#lojVd(AQc-3yK@+^f;=Tl`PDs5CbM7NlBJv_m)lu#s+kq=
zCM@46SW2Ru20fG|El?_cgoLETYuc!3ncGRDf}x~7IuPSUA4oel?h*1p-18Fvpsqw-
zzw;+ac_i?@_N2A9*>z3zC$Le5wt)>{rX0{W$V(am%I>QpMXD>ZiJ7=Y$3iovAF=RK
z2HMwq%zcq|F1ZcEFc7_xXo;kC|BKZ~I!{Hrn4;Zz71*&QQk>sgYSc)L{4LRDt9^Xx
zkr<0m3u@bmRHCIEcuWjDCdS4>$2S1S*7fH6sKN$1X~D8YNJ%*MyvC6~qoDUK8$!x2
zVQrA-5;uKMR7&7Uf+(YLt6`A1E{jWK(PhKrSnQAsci6U$oLNjrM4^mcq$3v<($|ri
z-w1Rw)gr%mb86h|k}J5~z$G_+V@oZ`TvoJ{LMLO$y6!V1=dBPD`}y|A<2q()a4;sK
zrNY(c7k`uNUEyNpgryLyIS+HCAj&N-&8>~{d0to{e%vO2a*GeJRosv*Y%A|fq?C&o
zBSb6LTJQmEa6xwb;Jp2<NcPDKLEuk%MJ+s?EFB<)O(wpzSvrkAS9)o~5-1aFvgKDZ
zgGoz}{yF?>JNB+4{$&u9;FIGR{38;);Dl_yc@sz3no9>C({rU$yU*%N;gdZGosdD)
zDY|~xDsXaZ1K7&gj$n<HKLTR!I@E3#I*LNu(QWw&c@vHe2oypkf;gO4{IUBb+U?Iy
z>4UK|%54~iVd#}2S(5GhUu?q?JrC_L_OD+?;3hUDiex)<ImR#JY00RS5DKGP^(KSE
zQ7$ZvDApfmcOils%_;iU`;<J>K$O|%+nT3zlOJ!hlS$cK>$sM6n`18N@1M<1X7>`a
zjhR8+%k>3E4kfO$(|cZZ&Sn5sXmm;rrH!M6H&W;ZEWSLKaC!BrcV9*_2TE${b2B>C
zO5xZ8BA-g2^!2^T!U3DCu1>-icuAkSC@KL0!-32fujQqCx6qTn90$91YZNFyE`(|&
zz;{v%BB;S{EVN!Uae5`@<GHc!elm$>y30u-rNQAD9G)2t6uR$DB4x&VuWK@<Fm-7`
zBBe9%;0$9r!<d)k%L;}vd#Ep?^AQv8(HT>(WUp?|Pin{QhuXk$$gibvdky0)V8$q_
zK2{AEiIlYPD~y1pu6UNoQPVnZuMDePCplo__b)r11w-kmtJ$Z7>H27&>Q!C+ROC0~
z-H;$$KNI?efy{$zGf8R~(i^1^SE8==t0DOJul`!J4}Bemvj4kd))R1@vHq{;z9>7R
z+=xLKh+YW{9?1PK)@a*#v@5Ng{^ctY(JmOz%=3$1eJrqg=SM5AQ>c``0&uTraJr13
z-8rb9vwl;2z8b6s`um#o>Oj$NM)lB(53YuKusZY{%R={)<J##sqjuT#)QMOorc7IC
zU?c7NHKx6u<Ou?-kGkw7GE$Z)Co<*y{`0*yIgiK7Sst3QOnJEzb6Lt${(`jDD>JLx
zr}%ch`ajesF_E&7^Wq#hPSf4XB304fb+4b_&R^Xt%T$#DBId^R<eujNztyjybz=9_
z{S=TxIzGd4BMFe01T@p^fS_5GtE`%3r7}7O=x(~o{e<DAOdrZ(<z9eny>pMj&aINw
zp@Vv5LMHr>IRZyW){A53W+rL#Owu`+B|M`3;2zg!@npF|U2dO0xPoi2Z6lp@K*mjs
zNiG|oB3DTYCWo6I5=BmJ!xD03?;Is0D}kA>I+-Jqm5nk0R?|9xu^L4q<jTv<p=kEe
zMl)k)jt8s5JcSguk>VHuyJyy4T!76c<HHWv%zons1;sd{pG;X<+%QS}ejNSu#n>6x
zMhwF+aHZI>X=VS#3bfBt5foq-2p-=$FOwAS_mk=kw(85pLLgo%+UUZv6jeJKT*B}z
zvaKsD%lUMxg@tsE@5xw0Ep~^&2t5WHh^XN?l|K^_p(hi@3HTo|94PF{gQj!tjy@7I
z-1$lCT|#{?k8h2lyA{m_(f)c_9^BJs?o%-MQzn?dBlHtrn*_B(P3@={5zwNEo;o6+
zc565#yjLE&;87k|Y>y*S!hjZ@e3fInav-B_)@%0$Bo_DTv}szinP%AHI-IzZPh9gT
z+4me2q^VWQ{65+AK8)8!g(gv&dByo;vpDR(TU|7F4%|KEA<o`qH=B8fk@}z9Y$p4b
z<X-nQKSJy2f9?3gWZUvsIDxZzZ0rByC4yzSnnd|vT2e!jvud(yIm%I^f$lxZZDh(&
zQ*BHg5APnjF?IHgL31^R(r15O9m4g>_^JHP217~B)@QQ)ev%jJDpwf@%MxYDu?_(@
zubC$$(MCmR4HoUJF8_>Tm)NINr)P`S-X<*M+nYMl%~XP`S4E`zPqFKZvvbX17=&T)
zm1qKi-v45ow&lxSn$iAMsuXP%gapU-Yor_zT$pVwG<LR?=mY&%G{kyOlxalr14iiH
z9Y$rV5lYO6ZPiqlUP>o)3`2_OAAkFRQAtnf^a0+i2r%+<mmj5r$U6tOquHl#a3-X)
zoXP2trCY3lKIYJo{L^d6agxK>SkKV~sO6W5^@l9<o&<Ev@$N=@eFFYsE@PwYF4U5_
zjJEjVxm9lXrHVAcKl8waqU|MWW4Z(=0a(Yk!SQXtYq#k_5LPAPrruf!Qsur|`br?7
z%ZG!+frG@W)r$6#2#A#jX%6f<?zHc_Tc%u@30)eORA#6E8x5g$Zw;W!r<qz#OlE3V
zm$P{Rbon#V#&m7~T|$TKuqnD_Gk<+4*Z3-rGn{u3mhTktQ?~;NU3$`&xE1zHbK$Q4
z8U>1RJ{f}9jq_>hWqA^bB#xd%Mbg$?apD9|nhVsHqLR}_Br0#Z=7WRfKxt*8VovCC
zjB4cHu7&2%zb6&yjl6`TF#FBfZx_za1-D@shM`xgKQXQQUu?q=K5c0+rM-ZG*hy@Q
z)Z;$`kx%K;X}UZkmFsfRtXYQXUj$3M1G--bmM@C$EofXD^+#*LQjR8&>i}AK&U(}{
z?f3d|u$e6Q6YGr%70Hx7FKrs2A~&V-Xd)=EztSn}s8pZrcKd=XR)#GZ_{1gv{~LL9
zvQ#PJpR7=9UrP5V|Jb6Fk}E~)wB<f%6|NJBWSz3ZrJle(GMQG<>&bRoj*nc_mBTmp
z*!4uO7f&{?Pj-w^j|3uf0qnyYkl`J*#aDDuE(-$3GG=duu;rDWQ;|p+NuM$B>9~sx
zQtFfb?VpLKo%FnMrr%W~LGH$DHmy=OssLlvs}BOU&1Z8b{dl8B01E_c1Kis>a0cI&
zc71ji2-wk|LbrL5%5RM<N*k6YQOOgJsA@{GXrtWMw!ZJJHY>OFIJmn#Qa}197cM3H
zb)1VP?2jTW<%Z2jG*Qw3^W(m|5H<EFWhKFWjdVYL5Jjktg=(gzJOK5H1H|81`eN*i
zavTO>AbO?5U<~)aSkrXpQLQ3P|N4ch7O?TyZ=P0yJ~g0EQE?q#1DW=?Nuzv1;Q*wz
z$A5cKA|}w<3r{8NQ>3;NCB>wLHmPN7m8^iip4`}Hr{77z@pfc$D-~{Zn(k2d9DE2n
zA69|0nf~{Jtl2@Lp8ne`NROQ!yaoJZLTI#GQNkn*y(R5-2Yp+JuExBA1d<r4*w#U*
z^{{2cLX@1q@jo2V4-r*YV_Jc`8oeYuKoXY)SV|*&w8n=LBdHt!?C{ySPPJc2Gn8Nc
zk$}IM!@lw^yOR(l*U76NtJavu&wk{E7bQN6F=_0dg6dtL{4dUwu<nqal>gzE^|UfV
zAxdJj^Vbt_>-Um@(|2%`M9B@X>j|`ds;jp=$g;L5$sjF)RD<(qe{O~-6Z5{!<${mz
zD@X<HH4^*{F0_ok_ji@it)yIJNKELsBX9i82%kpu{2#O%(8xk6zr(j%Nus2-(x%p&
z;JTa7*>R;rx(!C)q6R_xhn+-1f-6~5k8vwywz>Sxge0j)zm6?!Y0r*}FUHO;w_zBD
z!B>iH*^=*nu?1N9x$8DCZ+#Ms#EpI^l0SlgMi$i0rb$gU{KGF_AAv_+BELjwzA|ea
z!zLf;_uW3eZP>^>_$C2JQu~ioq}V!AY-_cU0wf`=Z%LqSrGOp&JlyM`6HRoZ;l8)>
zuT3(T+P2_4t*NMO%?_YanB<+^AizST1R&4hYl(wN@~mSr&D4tHd{F!yOUgIrXOuA2
zi<UQ|NMOmO_NXuB?2CQ==`*fiNjm?!&}bg;y8NF6nb))B)-@Z8LszNvCmR15n{-UX
z9*D%{iqCwc^Sm<3cx4n92O^FbYq5$QH@qa9|7NeFgNfCav>3!z@-3tg$-5#}seLKa
z-oN0y*cGr`@Nj5GSOBBxx0|~uIPztM@$LA)D;w8iQ;dW|xsozjkXA>|r+Yb{OwjgX
z!dj<5VtdmMkRVaM39FywZC&h|zWh6Ol!&n{9E1Xqm{vYg0JZ{bLhS7Ou*~e0ghUx*
zeYO*G;wJ1_w22+1CU%2?UC~T<VUJAs!HjGe)gyW~{)CagI6Jf4hG7_pUdhzrq3(aN
zx<%)yPJz(vU%mt-Q5<U4`#KzM-~0z6nQ>ZnJL(iv(M3sjbA&&mKRFhKi!${Z8h?#y
zL1=vWAz`8f_YXRNzwcvT@~>WR3I7cM@jwp0#_nO8;p8VbYh$NiB4goGBGs*V{u@U<
zZ<~o6rVum@Cgh32C2N#~gx3bK-5|D`iS4dZyde{jc+CSK@rT(wM!h9jmt-=+(zb<A
z>ZoC4Dk%fIB1lrF$)MLw2Fl;fPg|1+#_^!}N$`*aA@^<=pc8^M>Yyl@hdhlV3S`qW
zpz3KG4$>!k`e2`k?KDdzk<3Ca|NmnHy1psDtGZ`bCLvEIq(Rs6VvcO}VKfVQb1AOZ
z2U4n@NFXA&{wKI26A&@7hNBl#37RAkrYyV4uIo~Lj1s2adqPOscY)NCJ>d=}v?_Lv
zmQxGbXXEtymC|J77NazWgmr$m*DI9^fo#u>Y-0wQ5L-vRrS^6uu~L*PZFMVM4|EB3
zhv7d!+w-8*Z0+Z5{)0%$gA3&(n|miSPtrYZ&yo+y&MjAA7zUzSY93CV{cr46pgBer
zS5y8FACXEEGx0q9eWi6%BAg<mP$CRZv}fhI(glP7=tI5fIjs^U#YhgatEmE@Zm-qI
zqgvcD^KP;f5%1?=5m(kcN+2L}Ewzo(B8h~LJaDU%5>^s|=6%XZs%ux5EJ6(V1#`$`
z_S=Y5S4^`4rEvtZpXS$rwoy%*gwD?;1xajw*kB~pl-vUDTTN*nHj|<wPf7pY(DGG|
zf`1Z!VB5DL!i*!<`FM>Jb}Qw-3IbtmuOLXMNRlBMOhTSgY-ZZ2VcDy%&4?Fn?Z4!)
zWpDS)!d2YOi4S=A;@?ZST@8Q%V?XKt*dr@4vJYKJ)+Rw?H+Yf<PsdeqkNXJG>#KNd
zZOAfAl3H2u{sXmE5C85K*|#UZ6E+D!(&;-c2`f2dlNqxhX=OWFO=F6g{G3TH<UX55
z2E}}^3skuA0|)5>3kYz1vZoi*q>y_fM?Dd>HNOn1KV){DhEik!E?bsFPF^daA4DeI
z5L|a(PH;?q#Agtt8G3QI$nrnN&cuXa7>1%NS-vFizgSB^Pc$j~EFc=1`1t4lN#!W(
zNNvYmYTLDNE0UZfB!~zs->FFnT^STqQ4Tsp_XI45zHgFpiHdh6|DGroa6rAABrh2t
zu5FNAm`8WtF9u;uprfsy^SA^Yss0PRlJgK*Z~Xrm#B!+()g-%DAZ*XhKMzA7tq(YO
zB^wY|*$HM+WmD^9VzPV_@n&?tS|S|Z+o7HW$c?LLQ6XwTN>j?oqNvG3y&i(Qe7WV_
zG?JGb6*oRhF+q2QPQnhD$<2pL5lZ(4?;iSP0xUthV-3Fyx#L~t0|hCs%Q4=jiOb1R
za@`XVi>B2?@!e>$8bNWKel1s}IS_e(_NEV11ybu0Nl!*b&WDpZmt3I40i(>407@g5
zC0~eUOfTKZO|sy6X+g5RX6mD0bx`JE=?B5zAo%*x_ERZ09`Z(e^JxBOQhPu+S|}ON
zlScTJ5rl0?bk64bH=Q@)%}XFACKWwNKL25_JWfrz{!DO98uq(}VvZK8y{^6KL)jVS
zHW0!<^h&|3VRHYAwW>0YD3v<fzkDH<%>wq=Z~h*sei?IM9q6=6zPuq$zQrf5+kf1(
z_Yl(L6Woa}%6_D5h9|ry*MeT`Vv^n<>vpuXmW9b`aQfXe@H&3$U3pIKN9fOTIjRye
z0aXZ-fCgVE`%gqwp3f7Z+-aNTOL8rYqH>?StWCamrh-#1!GVbCozNzmZ@=rD*;WBY
z6iS3PdAa5O*u+$WJX20^qD{izs)kWS*qztg%H%3naDM-Cu-xW1?5?~@jY}`KisYpp
zlLo-p!z~&m^?=D~j>{|i^`mj-19FoDgmf}Dq!V$H+;}>{ak)rM9}F&z3OC*yyEZ|<
zfCMp(z#KELlc?TCpJvw{l(~)U@+KYiosq1&{fkl~7_WV*K_;XV&}n<;Ik9t(Q&%$a
z+4i;M${A%5QS$D}iqPTRs7D@&Zg*-_)Zh-BpxoI~N!BN?DyV0;h!4KI%GYiYQ=)b+
zaFYw%WcF5+HA=R*DgOyni_Iw~D4@Jfv+Ro$bxm(iHNQAJ7t?@Y7>KUquVn4NSWDra
zLtD7C3m7LPwxs)6Z0X?g3TX1*AD9TrgR1!K>lX{yX=P;xm)Bo^yM%(_i^}WrszFYM
z%9Ar6xS%}>1XY%_cUAcv^4!Chl;|ZDhPOxH7);LgXK`m23i3XV{HO8ZfTt3k_I`?y
zx0pd|UO||A-NMI59RZc(7!qUn7cuC;-*sUMw7?d+YSX>!N+p!?(FtDFT-PA)g=((w
zcZEC2P=RNA5sX`alsJUm2+|lgU9<d-__p!R!pUJ09&-FU(!9G7)6nWB88LdXf}m=&
zm4ZC7(N;2m&9dcp;q4lz9*7S<4Wpubu~Pmlnvj=adGsRHy6|=_&ASIz_zHC?UlJ;}
zl1}g3Fw7H%Ig^fU+olpwIg)ZW3ARq?GhyAnOIYPZ6FfO{_vmDGSvF?%o3Ws$gB(6?
ztc^dt3#?MNWy2+MK%NPEGnKH)#o@hCE5suc)3VH}<6bO-pw&sDKsO)J{GL$b&|nrf
zQ*>^o@+;{J7e9Q6hc)wquye`P5C);}UhWDk&{p=pvERhYhta{AIU=pm7B~+cq*cAQ
zHc*2e95CpLMSInHdPScZl-E;<6-OoDF=R704I>8_LZe#MJ`4AbE&2G_4zJP0Q_D=D
znMl%7BB1nA2)eD-24nFlc@K$z(rvzP6<?f9EA^T%c?~+Akl!YhtQ|TMMP?Iwh_q^V
zYe;|YwDs=i`Ydkeb*wuQVfke;l@gf2j`~;r-IZ>bVarHeWcI9;6PN)+*7WY6c*CVT
z>u;H7KsJ#r)C9Af7=7<I2VORa5<R6AgceYit|!BlOTHsVAPgFNIy`}(4?lDy=N+LF
zpkIA6{qIP6ckw0ESGHpr5MZS-XBK2>Nk*834OkCu*OU7aJ>|v-Z?mQyeT(Zz%*bI$
zjxeJHe%F&s<$5F~Lz17;HPiw+DfIkqE;>@JNsklD;0Ql(^`UDuTLvR5o(xoH)sl;S
z;$F!}a?{C9;g(rqdWLrUF)@pi2w@_qd^m+-Kz<x8gOnFtkfKx#w#M$V04wvQ*VIFx
zj=vvcXPe_d2*c1TQ9=OU|6(gu>&I&Q5&l<bI>WTYPM%-dP8|ZZYPCW{Q{oaWz-&t{
zo-SM>*|=OjgUj4-8SrrNcM0LOLwJQ_|L94;X?*}61c<OF8L7&{)~^};vT1p;IyPj!
zpmdJ1bQYc^S&-cg%)hCScUh1kp3)C(&`B}4o>jggWK*UIC_N1e?&<mbp0i%*oj7=4
z*z;N(ROU^_;mD|0nqT#^<!^U!yCJ=9&Xqv%(>vfI4OHY)Mt`R<G&F|#nuO{_-)Tp!
zLi(KLfR<+aJi<hOek;2eWz#bJ>vnkm8;Zp)ZB$`d9%vn`prC3RyFLlpw)_J__3IYO
zYZ|I-Tn@u021&_0{5tMMb}o}7i!<YOI@juw*}f&2y8$a;!c&-8>Yc*2v|m9k>BfxN
zwHc#Ho^bq|%8%_DARkd*k6BX#C`020(U4yngj($drQJOQKZ3;7DC6j4({eDHndGF;
zB`Sb=4;{Yi!2O0f119MCxoV{Vq4?a^Ka`!xb;B?WL|YOUkU;;9IZ-m7j(r&C<`bVN
zOAvwCZkuLAo|>6NY=567N)g3C%er7U6cFDW1h){rJj^L~BjQ$Lvz)$YAJj6i!X~;M
zZ0H6e+)5kdI#~%1YX(AIb5IAh6vg+>WchhfrmiV{07(h8JpPbR5@vLHmT_8OmKen~
zM&5tod+j5Dx$CB-<eGLt&JK(3moQ5n0UD*5#i-hkx`bE)Sca%(03N&fJA{!M#O1*_
zVK4;nBB;v45QGAaW9i(Cgl)1?kw{4`kvnJ<;T3*oB6njFHqYm}AzbnM%Gb|+ifl3x
z((2`3G;m6yLi*C_Xky7W!_p`UoD%9|;_e}0uh+j;0plFhglaSz@pBf)D}j`~aq#Op
zLUb(0rZ=1^K+4ov<QH!0jMG2MdMctQOLZ+m8nJ&xnANd$RmY~xs1=9*y!_tQo4I47
z8||tgV}0<?NhXZHQ=|E7>PPP2ZMRUqh8TVQ+9X;cUbj5c0;df8lrAjr;%TOAR_fQu
zp@fjb*?%2{?{+1rU&1NpO`dsBb_TW;!Y~kB$+6=k?7vvQs`!OcsYeGO!pIN@pYLsd
z=)@oT5H(D$<TwOd$;9gvF=j<K=8Ncn;Xp{82@EHpwyFeov;K6y-q3R=;@A<Zl^BFC
ztB=5uJ4PNaEFIl%RyO+X^!hky*ZEBzGh}QH8Jc545!-}9t+Xl&D3?b~)a1oEV7$nJ
zs=E`9*ILIQYovTgn7pnFP+P;_`S38*KQ}jqDsMdL3zHU(ZariQVDd^?(j61*St6P#
zHGZ2nX0#=~8x+%?4GImi*h(-%@!5#!2Q52f)AO@ZvePB{fXPl*^CA&4EgN<BAT8@v
z`NY}rR*}inNN}d1??{aQM8`**=hTo0F)y-0>8afsQ^VB|h*;Q1Rs*$<DRaD<m4h+n
zUMl}=2iUn}idU}^cu-b}lF<5^+zH&D)a}IabAZ;G(#_Hh7$tO-hP-c`Bisu4qEw$U
z>vt)VrG$-`GL5i${gbt<X~g?%{1`g83H;YvqhGh`Q6`3;Rh^8^{+*Y8LL4Z$ql-Jb
zPOr1+Ec#saMcLWqI0(Z)_)5WX9CH7QE!r|)x^1QDzVQ?RGI8+y{V~@lL|$Zd)@jQK
zcoNz0&8-Z$k&mWizYlUKan`#ZC>Vf$`Dj3tP5)hY{^-N)7m>C<n)D69<EpS@Y=oBN
z>i#|DtKD0i@aoUSAlNr=L6p1YO6p6?wZrmgf+tfOWNLp*nUChQWxb)v_vuYBO_*o1
zn@HdE5>{fGa6Zj}Y>&k16-(Taf^e@ZU}gWYp{XRRH3Om{LGr`qJw_8Y30yi!3<L)9
zrW)5e0l|p801&RbWvA`fs3{kuw-sCJzX0C-O8IJr8&H-5Wp3EOk!VTG)A(S9v4q}@
zX)7CCvJ1TneBNs%bEz-x3H5?@?dTf3UjItO^o6e^9k^5WlcSj6)DBfBUjZDr1-vD|
zTMo%ZtNAncXzwaNtSn}34Bx)-Cqd<bpfdhH#)$?x`JpnmGvY6$!>y!QpjfMO>*)|N
z*$NOi30HAoV>ANSi10-THhI9nIzSW;5XGbHMk#DEIglpK@mV5q)bed|%pc0m#l~S6
zhM_Cjmi*EFi!}(!XCUpJ+yw;GO=5}?N!&HnEt|UKYPto+I5=#Q`u412VTu?Ch7Jxq
zp6rVgtJ9eVk94WvYPAZ#P9GGeiq(Vym#y?8$8-|z-Js2UlCfFxOIP#BskA8MhjS2S
zU?shFcMxU8H9~A>Lr9TUk@U=DiZg8OsTqcE2Pf2@;;c7C*w~;u+MBy74dzP5241j%
zXK-fu|BqmJGlJT~tlO@&=g>_v%8*DTgx$kQ_=@x;VMK|vLzomUFxU3H->};fQ&fpB
zv?c(_QS+W;?sPsa@`1Q&rzy!BE>x98^ZQn%7i_i2HfrSzfCiKRu21i=9yvtD?seNm
zYzsmRF+FmqwC!HWeDDV0B9E@y_cN<B{$$GPdDp%LmE<6rp2iuKt-_Wc_4)#n445=Y
zR7@{zk|$>X0tr<sOuBpCOp-k5Y!$gEx90jH-ICp`68ln)&{ya5W2N?AB^<v_D%tbI
zuaaur;FQO~Q%UmVceyB}RJJ?)V(biXBnDv^_$3kul>dM1R#iPzw<q~NP^nZU5If`N
zhrQibaM4pf<q6Q<=W1q?M49;tjD%+{i{jkA1|U<m1H~EOmAIW={)9vLByP9Biyx^L
zZgs!K0evmZS4>eLE)Ba#$dqfGxYx<OdorVKKOD)Et>bn*>GAvE`t8OfrSh-9p7~D#
z!4uK^UZ5&MNT`y_e|&-`g8@jY<mSR{pP~avp}dpO)ro29>H89!+hl>Ugd9FP7)xK2
zq)<*30D??9jk^jj;UQ4c-w4cU1$$!J;kRrr+$(*uMW0MTzn3MVW{^FJ(y29q8r!#j
zO33BV0d(rO*T1p4^Au$;L<w2<m~M;67&oex(Y`k9&o<qEcM{fiSiR4a1~60%r5%&&
zU?AI#Ut~y_yi_5tP3ow=y^s5N&S!UQ2qL%6#z{bvUulq2m0$S-mqu~(vVDy}lEh4;
z{>U-P*h^ouGa5`@h;Wf0(CpeAzN_jFR}kz!mhbvd9h>r!?=psI6O%+u`%(yzG(`%q
zN0n5FHLREwq)k2~#UIAbCAVQ12BKFIDN|DJf3dm-=5f)W<DFN66YE22e!q7IA|%}-
z>F(g9ozMazOFIYs{({y%{6D1X<03x!OLcue`S)3TGW4l*pdVcyzNq*kw!f-<(St<L
zHL4~SizJD6xL1f>VgQf{0J$f%M|G^Pt6>7QBrQlY5$5`krj&jpOu5C|`s!V7Z3{Dm
zLdtJ^?mjqlOqcb+%@77zhfDth`49MDTjPWb0w+^i{y=JRje`Sf*>x)%a+0M$jPhvT
zYC9njO2$Cs3K>0#Wm|sH=3mSCL0UP6)6WNVBZ;;xZ|~BwZC;ZlY-R|9yhO4gNn;+}
ziB^Q&umwUkn6*f*8m|wJ*(!t!V10s!qmJ<hhyciccE@AgVKZ7FnJu*xU+-X^n8Ti~
zLLa+2CmeW^eP}-y;>bdYSQ|0R7HaJAus|HSXsVaI*zYIeJuT%c2%9WyWlD4Uz#2II
z7As~$>%h+#d&^$R&uOHQMMquyw33U@qmeQr0Y4HC5>u}fQ)im@P|v{96&tR2R4hN7
zok?!QFbo90BvM@L|9>oj0hT5U(u3UQMA!pJme|eeua&B#Xk;K=PmCftdc8(}Zkd4R
z7AO4%4C77IG`IZK`hS`kn;?-hNaXCfqSeyJ*<gZ<V|v+PO5l#vJ5tmyMy>jXmB|nx
zot~JFZQBu{>)!h9E-EFJuq4lv%!7DVmCnVHhHumG9q-WRFS&e=2#GDCu|+gfZIV#p
zHX>vM&Q`eW*+abPCHwt0B4n*O-87u=%NW`)y;>l<7E>Gdtl&DUWxIYRoUPMi-Ij1_
z)}fu~XBsFs%8|nx&vzq?-4c8Qs093jn?T*&t}8X1Ip~fAG$Z+GcBLC5lGv@A$O%Wz
z(g)=cAp@*PGDuo=L*bGJGDC#yq*pT?mYp-)9G!9tKU~+B;PD@s^AFQdRRX|cG-|Qg
zU5h~({aHbVyk{GT9Fk)8O+Mcn&lG<mj|kOmxuJ{{xsB_R;ny@0%v>)Nq{u!vZCIg%
zhCJ`CD)sk3j38MzSao`;#O-iiU+9k0xJgC<Q(sP=1M&xB=a$<r3<JR{g%(Lk_rF+!
z)H?!#0PDYg8A|memplBTJF3?9CPqH96a<{tp|G+BwJk%*n|b;41cD?}w}`wNH|Q=u
zBp{g7N%7!~600a4Jb7_U0>cj$W>85IzLX^90naBm%@=@v#x(5INt3LUJH4l3-KO65
z{g?le?7&jC7Z6*WO=CY;0rN{ifEK%zM2?rw22J{y=|UmM<)-v6FYvAuwk8ap%87=s
z>}Hc1*`jwe41DnJ6+Rs;Epn=|jT}c^0<w1cJfM`wRM4FRXL1po+S!8ZI#`EA#U3ZE
zUp$DA^K?_u-F7#n`-DvG|Iv7W>0PlESKiL9aa*(8m)iffRohP)PDuzL39Phrv$gFN
zbA=>GB{&-kxHg78gBD3`N{|otfm6{MHG+1NnWvwklI#(D$&Uz@Yn~1Y6nwO(uvag;
zTd_&DDn2fHMHSw!n*KuDrvVOUex5U*wk2My**_j5lIpIhwj~~ubVow}_!n*2fC<TC
zq{HV)H!W}=jAFR|*uI|%tRWflJ*M?X*%{<I3<5FqN?-yR?tii0AH^?SRC2q^YLp-p
z277F~xgDGy1}4v==SmN|zA@Zsu<Op$)y}&B!yOzB#H^nDE9set6iP{4<?j5et937?
z{vxBG#vaGd6G}>lPyW|aekVen9xb7-N+*F6)xM~N(q=q1K!vi!P1}ell}t#M!I#?9
zdGi6ubwEtK-dYFIvyiPB$P<L5;Wuu|8|ZaLkV9r9FK+*y*{6vl3bA@T-_)MOVBBp`
z@2>`>aOOn<5(IW{+_~LH#05elInhXdIB%~I*Hj7ThK74v=e8w$;EuQ<O-*hiCENBb
z+v1oWQ|BajNhlY0Ho^cxnNLv12hc5>NE>=@Zbtqv21p*4493uzvWpFg@Nr#a{H+c_
zZkS|Ni`x+&*R`qSWWLvv=k;3tvmuUL!}_@8VT8^E`JsrEspH>(uyqw1$p&{-XIv-J
zCxu-CaMEvoTbx`!Rf562YNkrw+@_T8&}R|){M`VtASZ_*+==tXA~f`jQMeN1B=WyG
zai-f=q^ugb(*KwIQFbm#3d1lEy%K3#W99xA8wS$P6fAn!u}a01Bg^XF^Pt=TCda!-
zvc}A-+g8P%lbpqz#P|R4j|zv8>uT6>yMO;;;v(ad({tBP+pU<+ENv6l2A}i}xc|aF
zJF>`RfKn&G0{ZrGE20PUUNT7e?6+T8<fDmWP@K4l<VoD*AYKUPwkT@W81IT*-%ZdW
zXS$w%Cwm8c3QZ$2n<zw(5lWMYY$!a|j;yNuI&a)4%51~b%G@Y{Otz<fYB*oLHp?oO
zej}4V48~eE%>E{ANHREC?ZMb${=Y~)={&5F!O80~cn}b;D<J-2v_&jf1}Cq`+sBi9
zXg|Vl4VA^!O&V=-*~M2@+eu1!bvU;gd4FWE`kkn0k@T%e!n*^|MwtdOitMUZ{-01t
zx?Te$9Y~Pkt|V^qa3vaoPE-JHfAQ4mNsIm%e%nibe2~c*4_bi9WvPyqi6Hm0z+mao
zd3AK!=LT?Zv|9y3A+D}=G)VDIiy=TW1c<xRz$D)ZM&P@i%*yoyZRE~o7uM7h3E^C^
z_5(})GIlPw5rZ%gy%G$@f%{*qQdK`kY+G}HT@gZ%?fE(OFUVsYF`}y+x+u+C1*DAC
zg2iyttkq8!xJ_I5Kr;ZI!~<R2aUheZk%j_Kv`jBs7yHB%kX=G%hjGuY+Y;oFub7$j
z88f50EtvrCK=>U`nuVy*O1{2GoJ_ZDoDB?TgIOB*N{*!zG&hLti;&+{D)!_#C&7EO
z`Pp#aTqprdTC{<Ns~l<3{*)&Pfn>C$9#og1mb|<2E(uK1<TwezZuShUDo1V#Omc2k
z6yHb>ddev6QY9xc0m&8)88#e_n%66$(vGiWrqa4OBPp*><UZMM!gt+fqRAx{L=UwI
zO?MyECb$yR+86~QIgF4Q<5n_sBu~jHP--M&2>7#iXBKw(?h=w5)Fz8_3Br9by}`uw
zmCvo;)>QBK{Cme=HJs{(;_>sJzJC<~BYs~E;^K;{bVn$kq_+zJxNvcuPy;7KJnu=w
ztKZ$e0V(>dXNmz%Zftj2vs2yN`~MI3#n`#vMhwD0^h#hGLhgUDRw?rmZKTd#0Fi9g
zV9)Pbs1x&xfsYdYc35Wa@HV#+Hm;LAfL#c%@%OE=;K_{1=gl95{G2-d{04xM2CPG$
z-Qmr-^90>Wx_VFTsY0^7@nF#U@$?-#dBO=-Jz4twM{j;h$lFmic2Z*xQe*w=mP`SI
zE0KzVc;@L>!BSpOIjKMg`9drF<?RH&$$YhNf0N4#G4sd-R<7^d9HojZkKYCWWn-k=
zWGTNL>#iE<`!@lUzm1$ufRczbh;u4W1c(!PdjSUG<eQRimxqKy0A=E~aMVk+IXqT^
zN)pL#pi$U*s_z`P;v^57*fR}+G*lSPk4%J3E(uGPMnS!)=}xaJ36RMK;i}ySn@WE*
zmwFcYKqlAcz_oL1m**BIS(A%Qbwq&cP&Hc1UL~^eaqB~>+u$gR3qbj&gH+OQiW{zk
zx=I{J`aKoKl=!v;zAXuYYpH+<HW}xQ1Zb@IaLO6}=~T5#)6y{|CmvJe%Q5YBId2cw
zx6x^ah>l<I!jrtoLF+yAo&qDN_&0+7hqH6ZZ5W1u=#^}ZWs3K|SPM7vR3Jd6=q@Y5
zN@PWxA77R1FgvwjGp6V<^D4UnWs36l%@i$%h`d%uXh{&1Ke2EpVQhoFs@GmkmF&bh
zu=I$~O>Ja37jjE!+|)e|wz-*?<*n_v?ewW#(<;yh*-drGZYBOfjgZHynu>uNGCkSW
z+_jOCwi~qX{M{4-nMo+;xNTcGo=o&q2@eiKCVNr|;bzt(%G6~0hi@}C%>aih(k(JC
zdDT`(mXUXIWLG}42iFlaZnK%Yz%@Iw_hP{00!^5UKG_nN%1S^DeHxo*n){hCmnvOv
zBkIQg3K=TtExPoXeGl)+nh{VGwB$J<C|I0$CPnGJOiM1PvM!P~klS97<d#`U-)-vc
zYE#+epg|%rab#i^$X#S*=jYKT-4}n5yVtg#Z$(|Yuuhg;c;BCFzBv%Nj>rK^q;3yX
zrN$&Kgus8u+!XFf8p%OZGB!?<kpz+5`YXB_B=9D5H*<m#D7Wo%*RqSF7+qf3S|kxG
zPss5>DBa-~<vKp{_g|cyQH}#43`4I3goNh)7u(UaepKB`LH(OA1Qnfe;@Ez!go2Wu
zvLi6_07%UGcLI`VjBg?^UrlA;YNNhSiFqHrn-!nEo7={(SP2nj<J*MhxubdR_1KJw
zr%a*A+#_?NA5W+m63X4+m;q<P7;cmjN<%{V{cMx7)q7&(6(<;G%kC)dQyHF#rA#5W
z6i`lZ@`(Cq0wyYPX6sC+Am^V4`%x~4fLp5Hma0nfU_0t^Q@r^kB7Er<-KhZ8N@Czc
zpUOya0RdK8StAM<N^EW-1CP@^?Ot{!4F6Vh+-c;P^A>klcS>!iO9rNLx{-q*wqYfc
zYXnR_l9>4HKR62;(#dqpDb?i|WR+c8FH0`R<}wIk3mnQ99@X_N5J&k!#~oqjKwD`q
zsZX^MZ*To^V-Mm>6moEx1iU9%%v}r3O$jfrkA@rIV<+e(uM&sFEB6FN`HtYAaf}g@
zQV(W0xNdT}L76!Iq_riKkud3dj*Bd2y}J(vOf6t>1az+_`=5JPc5p4g-XdVHCmQ(7
z1%E5M{}?-?9EU*|h+YYBz;OSIRjNAA-K?s~1^7rvF!s!w`%3dhDE%Mi;=_ufGA5-g
zN9~ZP9sJ9uzfFU?OX}Xc5Hmi8X~e1wKE8kC#a$BI;n6U$fB;UqrRPrK+0Eu$1Syj=
zxhFV|fClfE>GBro&z7`FvI|U{56(BHllkSEMeC|N<=ZFhR#Knjk~LBF2<3=<&R8V@
z+*KZ6DU^KACP_*lbt6frZgtlBJ_*^9Wp&$pVULFi0ljsqOFHnSev*{qQ;55jptk~0
zi3`ZRd>4EAj~;sK0^y&nG~Ad0EUqS?w{ob(;Oe$Pu{8g4+>G7ZPn@7{0cjpt!wn5>
zXI_tKf<dZeV;42mkZa%t3`+wDk|m*?sq#ZG=_!c;vbF0hJ9SXQsj+);<0wOIQ|Zk}
zKr;Le(kSxMjlDz!n`qMQPic)J|A?EQif|G20KZ@ydElc1gPZ!}ujVUb#*v3qk|P~x
zWzxLEe%(rBBqW?7tP-<qoW7oAA~_Sl5cMo8?dc!*c`<edxDCTF4E&O9$x;0Ok8ME9
zQ?V6bK47$kn@FU1V#<~G(1g6Pl_}2h`i~sRB3W7sMx73NK+OvolJ@{}B17sPVDpCW
zjpa!04KoqLrWa=0e~IkK9cXQuxGLzc_w;Ji`Bz}i<lUI3;gq((J{@qE8P(~AEPia;
z^`|V!`htQ9P%y_H)7S>}Ah#wq7Av4~+lh^2rzB-a4dFx!-?ok&x=sAZL0Ep!g$$wz
z%MRLP`;nwvzu{@hx?{;sNmh$D-d3%{<;Ag-8+p-SrPA^N+B}aHwsSOSo2qX#bb-0l
z^k0o~Bv26OXM;z#N9U!?$iI2{*9UtPm`~Y|rIEzKXH);_m6`<K`bkUVEh2?AwtW^Q
z09W!G?@;q=*W&YdbFxV?)XOY#JMRK8-tw6{iKt{XuALPL3^v%!yT2z90d5I`-XVK;
zr|lgQi0h)kTATdFMdI%AH-JJL?Vmfasx@tYAKQ@(*c3r>Ym(fuI(tqwxC@h0u#y7s
zyM1Vrl-x4y3Td=H)?4{&x#kaJ=aSq&2*l7U!61J3zgQ+I^l&N*W#?6wDdU+2Nw0DK
z`BcLc*g7lnPZWUl{Ao#6@yqRPL~OOpNOB=b4oA2i<`N#XbUWvgRLN98D=nAgM>cu1
znd>0gfRZm8^4g7o<~NBI$zKzb%}$)l_XnzZ55RD6gZuv6787NU%s;piVxHvi&DgsK
zu(o=PK+P;6S(fa=n?5J76AoM}TBT)KvK8Wh%XW*tH|=|Dm1S9SHO6<D;MD;h4y|0s
z)>Z;|mvFTHJ0n3Tk{=hEwt%(r;J1tC5;gD*=lftHQgJe2<ixEm(UlBWhnBz$IAt%n
ztVeci#GQx9*ftTppK>KXyXA&!fbt%oyk~Yd3O%x703)GxC<s4)xSfAFayQrCxIt%D
z3`r3xCG<!lijAIv4G>qRdqIMRh;lEl>}?3*%1|Tqp+<@X*9M-NEBT&8jP8&<$(Ncq
zXMV-$VjOUjcx`0L*2;CfyBlz!#yFwo3#nG313=(h(U1<E`2q9Uj+&Gz+23l5+~md<
z{{A;=DwTod%7h#uAR>^EJo{gaor!J3FbqXkG9^-?_Ft@MQa&1Oith!4$Oy#aUqAUp
z7yficUfUpf?HM@cK@jln1Q>%OKjFyhli;^v2a*PFpVoB94WI)@q9ky*yRchzj*u4^
z+4*)Kzmm?kbHK=i;FeBYa%DM$&bM>GNMgW^r~5XSE<H~M<n8K}>nT}yFXedfi}o)P
zm{l&_crVRfvO7J#6&8tC!o9fR3;p061Z9OIY(z;(>z*N9iX9~KcuUi`8vyx{LJ2P<
za-1M_orRJ$hNS;V*tl+NH+BGS6uoIbD7dI4->D+6$t3agPDrwsz8w!Yo1nuch$bMk
zxu6#m+4RkUy6K9?&O*L01dKo18;goMw$O#L0ZG`q2HD0IAz+dK<N%V%Nl8piOTxb!
zRCN+mK-QBB)SkFp*8rCnBAEc>XyxW48f58Z;6_eXb&|~#P7YGO;TX7%+P&mtpuFi*
zbq`p0<f&S6+Ayu-Wc4Vq8)e^Yg3Ajgp*EeV?}m>9n8F9<UTC)yFH~|Oa0_S+Yn1)c
z`rpIni?b`SjTnYuE7=j{XaB|8x*=8Mit^9}gv4?Dh+kFW<kqgFz`ZGb@*9hiV96e3
zbyh%twD;B%6oe%QL8VdQNtGyO|21Ng!DdN>k_0Iy@{@>oB;+Zl!}el#BbGn4RhA^#
zaR6Q10V)y!KRg5_*UXnFpUwX@FTb@Blbk#wZNAzj0eD-^2UZ0+$tzLIK2?n^{paE>
z^8V&eXZqv9;%bnt&0f^4_&P&Fv_8Ck6iSb5b3F$cO=8W<8bE+}<YFO-5hA2U8`jqV
za&T=-Y>up!^pKg1m5+jO<hMk(pSAQq%RRx!4hd{Rq@fTvKKxFt0LiACNLh)j_P%{T
zB#&&e-1(7CbyYN`e<t?+2H^;7wzfZSS7bDFORz!tw~Bv8MnhB5wx|4nc;wZKT*v!k
zDzx`26wVc*yX6wWwv0q&Chf<1YYTd0Txnt-2d}@&r1B$Q5*tN7jRjvuAqfN!QpxBU
zI`MaFZ<RzMdzZ#ic^h-G39-Vi`6(o_gve4Nk7N__)O3~bOC?1>NQ^X_f2Mn0e{gmN
zxekLc5WNzPF(&uF*k{psZq-VT{w^yNMG!DEe)C~J#c7e`x3pq(NQ<<EO>Y_B2{XcM
zT_i!2WLYc!`%Vfc!}hhd*8ke9|DGcgqkJS7e#yzCuW5QepMbX#D;N{xQYxhEJViT_
zOn;fE2;w#5*4o{(J&1;J8p$FYa~dImX|~En6u)&-8{w}t)&3r>|05(z=BP$XnXU2$
zbvN2dJ7|(jA>1wHZ!q$J_I&V8FdM*S0fU>Bz+~-y64fXv1c1>>_L}$pn)lsE)hLOn
zl^XJ<hU`-z!|v~v%QsWIKVNrJCT*$K&eR+~Pr#|#8>zS|>;^1_^QVK{(MJo!g<pG-
z2#^3*Kmzs=dI7|B5C%LX0xb|X>uNR5sDw$tG*AxgBJQ9+4FnL^A3MU?TZ~<*{j1O|
z>2z>9(SDApWIY%uVWk8-8E!b$o;WY>zf*<XY$B#`D2{yWya{QO=l8^|tLnhDrF3V1
zoe&O$n@i63HeMjyty~grU&?C^{!cO~p8cjD32{<IWs-M2oPgLL+Qc7Y=a%ar3<J?E
zVVntO{~K#{FFvWLs^PC+s1Hb!c^uy_lzryz@HR|X8aKlSfkj_3cf!d#Eg)jfX=BdH
z<>26$_98w{`jS31sr;@32d!Bes_BJy;ZJ6cd-VEqmiP2G6Me}b$r;4K_Z0{CzZ}_;
z{&cgFEl(ps-mmPEvbe6*=35km>5WIlN{WK(8okWT6ChOeqf*0a6dH7b``-ZXb)jYK
z9Y9<1{CSn~4vxmSbA^a;7P_RB$_34J0H+!ZKH&&fo}Vj-uB6I2S|S8J_>ST3^vuK7
zB+1N`pX8zTB{PW>q6g&KQ~DWR!kGl)DYc(8s|jaE*$l66Cbxr{EPH@xWg&KJ-V0|k
z*Qmmc@oNpt3i&0noyjpzLcF*)2T50tmlZJARhGyWZ{HgnGz#kl3z+K$#BYm*y6QN1
zT55*GvfUBYE48{4JN-LZ4F8@uUxEWb2wrn9<rPz{F_YW{1n@4f-@~0CUCHbmS0ppx
zD5#9^CyRC{ufpCx$%(;NaXhZ>i9wSeU_n{1;ES>|v27TJq3BAc%R}0Ku>fuUV-TdE
zvVbAMvPtn@AD?7E0eX_FC^@kQJ~QwFt)v^8QjLW@g)EoPUkgE#M6ozVWsz{F=j5sY
zp#;Ty<_G^7pK1a>M=^#F%98fJL{(<&QEOfgZHZi*a&4Z|lHw5z3M^eqCYARRnY%F2
zUojW%#EzTkP$4j>BGYHC23Wc>^|+zC+?C{m%zs`iT}y_w&prLl1@?WuI{-@7WF>iF
z_U_i)P*l$dnR;LhbLlL_&wSr)OV`Waxs!!u_0gJuDFGJ?!4goO&9R<Q?Vg4=4BBg5
zy+-C-RQ?C#f8)ax0F*CsY3pf@YWVCg7lJ5jL*-O^i-C6f!HL|weH8)S1HJtv$Biw9
zCh%{8DhhGQsFx0GTs!&D`TZY<I>w^arnVI>h2-&_oF8H)$>TQixD64W#faesKCaL>
z&ETou3U>Bu?v(^nwkV8bQ1$LH(s%>qBpy}4RWdOcPoKZm56a2Lm9Jwn*Z`^Aq|NW#
z%<zyYzH@;djGYUP!ypVquVjod$^9?3Qo%23+U?{5h!8;7^ZPOqg=C?pg9AG``16qB
zqET37c=f5@OwZ|f>jDSqq#HC|%wT%`xaj)NA)TC<a1-gg1EZJWsoY7JxpL1ssjgRU
z{h>*!gS5$$76&G5uY|E;sp+p9p9bnq&LGMV)2~VFTzf#Ag~v4lQn2fFns@ok7R~q;
z&6IpbuM?GJP+8V%^00FAJW`()1eE8bcV0@owy5TPGdzEfl!g|km~*=VcHU8|sbq4b
zc4wGwMy|s(ea6F0kjpP$=cG+Ou$D>d|IcZsr1s5!RU^e6Z)~JHHV7h*=2SPhRa2nq
z%29Ncew=!_QJO*M^%JX7vWutd3C$1ZLp*9uJZiM_VHyHqgl2GqTJV0?D0qTe2KYi;
zsk0MKhIBtpP|K+O-4-imjZ~ONN`OBbRV5}&1S;?EeAUbnJxNeYD~g$0p_XpN?{U+c
zp!HuhGq$C=X3jz_dpL9~cscVzDon39s3mCJ4Bolia?$ljiBk~~mZbB}g`xdXb}pz9
z!!QuNl4X6I-2Y--O7#T0rITL3I0h4s=J&m(J|`w8=vA}koMyHlFAJ>Yuk{B7+Le5I
z!CDesX_!Q8!|R!xEflO}uoBU3Vf_S8tzamcClRjuf?@!pxW*{etR*Thre_}X7v7SK
zE8LXVG=7gwD5)`ja7t}B>)Si6TA-AA@L?^eB4WzxqEpE!caYMI!c6G|@^!ugFK7K@
zYO)g3+A$ux^;G>><hpL~0M@t2arKm32=jYeC=t)zi-Z_iGg1V*66YA%Q-Bw6U3dfJ
zF~d?W_)cR_J|U|5cKE1Gs6V(NyHHf6)EpKz%4!IoXROr3I&ITm7w-X42WH@m%zR0M
zXif2CkEcL#<v6MJf3j&xKmB^kwF%Ot;B`OP5%o78^9c;uTY~Ruj`D^zTRkr+B4RF=
zY<>~x`p2Lnm%eO4cG^aW-^5u^fqPOaP74zyU8*l!8X(mC$4Z+$;p%J*=V_=Xj$WzR
zoCsbLhcJa12$^0f-fP)x!uWq|R9}ppSq{S>3`FnJ6F>k1_rF*db)F+N>f|q9D2rqq
z#&70*Wj`EB<&iz03V=Er-;O{~vJ<7#&?HXNt^%i^LxtMu+dD9R_zkTm_>Qo&(q|eu
zsQdS`<$aXZUt19``UcY(=#)Kp)6$jl;a)w7eK>SVO6`VL-Q#{Da{y2lMg&jI_9<`h
zuq)AuNIG4NPpu(2cP;-@BAHUh09P5mzNtl`+!#$2MvJiZxAhu!a#T(LYR*tXbS!^E
z^Y6)h;pEkS{h#n_b)h{At*x`tCOegAgl0O&#_)RknkH?M*%bChh@k2JkEKfzeb`9y
zXk=bA5Ay`FB(_&2(dh{kY<I?JKS{cSq`FMf_5Si9Q8I<Qew8?FE0HA0V-0-jgLZ#{
z1KMPW0Gq@asuqOliepi=!)XCF38s7+;tMjyZd7b!$%AZP2)u7dL;DWaxs@{49fN_D
z-bX;VHbEg~xqz_2OXYa~d1AK``ppDXWw?LL1o8bnrQ6iz*SK5+O^wHsvNJ$(7=&Tq
zm%xAm|Nq$Cq~|4*X;0|~m?lkvk?fUQi737WW&n=jH|R5wG>I~u!u0Rub~+3FwP8xq
zSeWJd$TEA@?thQ&#c{uzcMs%WOi3DMD#d!GSntL56be&v<|i^w#j_B~Zr^__$%3_A
zu(tPeEju70T*=CTKk_TtG453?U`Y6q*F>LoXQrRRuv;na(OH+=Q$>3moh7VEa&PL2
zJ=TE?WrxBw-?8Nfbg=qdwkKi|VrhOy1oS{*CwZ0TWUy`jF-OkUtF&%TT!&kUs4`5&
z9ilgr!_&GQc-IEIX6t-_nha2r-FM7tGVm^TIGO?@E88P1uSg4|1Na1T7+PIl)W{1K
zPdnIkH?A1j&li)6V<gGG$n8xjY)tt(&M+lC%58IoUaOz`k{4SR$H?4uN2k4zLy7z-
zh8U(S<S32oo9<YqD%HL#X;0>>GMJ_vskP6#{2zDxLv};|e?WFqdXodr*e2i5fA1g3
z^=ZnSrh;yDmV=y0%%6OOgf2eg<w*W;c5S&0gfQ?*zyf3Lf3db|X1vmp4DDaOtSp;Y
z*z@{Whnn|vgjf<^taVJ}McDv0g3A8_*noiKV3W*azEZOcTc)#&-j<Ro`L--~14JUp
zCWWZ`5W6K>@pY&!qb^Wndp3RegGu`arEm7+Y*MN2&BY-U@?-E)ME8}}3Az?xFKejf
zi9e0;5Bv$zPTqE6O*^rni7jlQwpl_p_1DnC&;DHrLQb-6r|1!yYU9T&&eh?Mx`znm
zlwwb9Mkeg+2SSiH6_D%`luqRn${+x8a~rKqq1k?Sh?Gq#5>`r*ewCEr`ezFT-VOze
zK12oIpZt$<J?}K-+T3YuJ0buX)Ncfd#6i6)rWJ2Nnn^`fR&9=JXTv`5149N(VrMRx
zoz@<A69<qNnkroU#RmMHwETCH3wKrIsT84u3yFh48*RKF*>6Lw4`M_U!d|5X6vhIw
z_YW+A&~izVqM|MrRz6+t{+vQC8WaO@(jFzZe=k1i7iDLZ+%O0O(JL8bkhuTFn(<^G
zX`N=<KYuaUc!Xf3x1R<ge0PFwjC(_Y6`?b>U_&NBUm?EdG3|LfahcpVn@cxt0}R_(
zR`*TB$O#z|tKz3rb%~L-93=z6X6Nh!;!)ceeY<psk+}Mf3ASJfdze*zPUDR^4E>jr
zb_pMwHq~`9r|nj^Ewrcq3&1-Fp?gNchutOa>DR81e^r)-YX985F1vy7BVm05Xf&y7
z$WHN=z2!`(u61l=rIPn9INamOey0=oCFV!ffDORn^2D-~D5;aO0<Sg|zxs4cQZCz4
zY}m(>64Wd|7aUX@)<DYLPt3(m5BEu_k<T;8clU#-1oaQ@2Ps98D!GWYk$1%0!%r!H
z_%X~vkJj;TwDL<|H;P8b60Xyt+=idgdSel-ZJ_jHr>~AmOeO&XcKVb0YB)RFMu(Ip
z`KvKlm30Qoakt+)sJ4`ta8*saf#Sn^)rx<-*Gaada8$~>UPdZQ3CqC+iEe@8fTq-U
z6^YMGP$l!A&YcE)x?G}vadt+z5raSsy;2B64EMiSS1Ep^-AcpuFJA}<31E+H<)hPk
zJtBeZB9L7ve5*!82w~IB<kZx6)u|iET0&KZh7X6>6V>FI8-xqh<Y4oDR;M4^;SR#r
zwe#i(iRg<|%-eyyLFZHra+e?jB~mg#xVjdvrq`2s;L-u^@>4vTNyf&S99)_6{<PoL
zkjp~*BWp-OP8KRQiz_w@wwJx8xfMb)i9&UTkldrQJ}n~OOiWJJw#=__oI{15qj%R|
z;qIga9nhuuF$u-wa7o&X&HesY4!)9fzD-TmiVtG*^}7v+&TJsAGBsI=8V}iA;s$;v
z1e_M#2x=0{{U7B-TC^l-BTJ(c?oYeYtXgUPyMdAo;~ZQm(^f9}<9Bx2%proKZIpbb
zF)5+i#%yvgff@J4M0;TaD?AF)u&IeW0Z)3%Et|nJKQFmgYQZ5)U57uCcG^1US#p(Q
zT^PG|yfcKqBT9)#H5Y=MeAI3Mmj^q^PD}V;x|+BO>szAFH)s+OHyO($)>v-6FG^pG
zoe7S_AP@t;#L+<W|Bua~xX^Aiavm@!VhDsTxBXB{xbhwhtZR3{Al_F5#U@!wYv^pt
zrq?zf>}^7mbCP>Yr@QR^o~$Ebn?^j01Wr|qZ1(N{GRd~NYT>`6@0#Tm(o0BkV5KUq
zHSoXny-iCzax2gSZObOecleqVy^>|JdN}z559VpbA8S(ugam-3qpCDL!n2Z1F!0Em
zEU9P<nO^w61S4w?I0q7tj^oY8*3^wOe+Ih1S%;sah17-%^1*G~{nmro&YO^^Z_c8V
zG1L4U;lM+8V;O)ul>l3@lFg(~^7unz5dD68w)zq5T|3E|#5}zfv7qS4_j>qeVto@1
zRHaMIID%Arh@`M&BiXIdA9Xp7^sA5EjTHa!M6fCclEUddkFpT##Qk<^H@Vs$zXcat
zFVBL)RYoV*n1AAC<5SIdBY|-e_yXZZz!$y{oaMM*63Pcxz$G+#_0L2vFuW6o=eqNZ
zWM^EI5<}%K(cQ#qK3n*45KQIqDbqJHt^gU93a23D`&Vj8!5J#Q5eqNI&cFs@5Qc#(
zK?5P|zt~Iv@=;YUxeFi)6q4Ane|o{gk94Hd0N|)`VPH9@|5vb`Y;jIFHv#u<O}|cZ
z2oZ`8g=@=0VGlo_#I;Ce=^r%tEw|!a>}ka%kn(0Ufy%Sk(koxAkQ#0RVQwjNuQA{_
z+Hj&ebP{+Dm#)f0tZb!Clj}mAThHz|mOM!6=ZnKFkdpT846#$z+^F!`8bAr7oV462
zbj#7`xU+z8385sCOv>bhZnoA^LMKxpS4u76CUoJKc|NtE2Bs%7MNgPsOTSQaJ=Q=1
zw<HQ1-Oq>n8h%tqmYq6Fc#caQCD#VIxudz%P`g`xzxKnAdx|e}dI>DkstzRC>zQMX
zeVrUD>`47#>KX{n$I@^A!XLZ>>ud3e)Xxgg5^ee~3o2Sqe}Je)7U7SO(8$1qE#o3t
z6MLi5KSObjwH`*@9eBA}!Ih#h5^LZUz^unNEBrvp9ThsHIzCfWqS?zYv>4m$7lK{K
zd&}?o{(~OV?w9Q~ceH4Wyf+TIWdFn1ncX-L!!Wd^kvx_){WrEiHhlU>0Hy)Mn8Sxe
zK7JnwFmYiTKeHt^6(9TN;kGtVss<b|t&!{aIZZgoAshslkkmFm1ZXs!NFsRNnVkO-
zJO}Hzf8s)swEq1=V8OwJ-ahrF@kU+;RWrw{YvbGb;W=UY9U)*MZY(rc<>y4*PnEGj
z86@XDI|?WgzJObB`8#yntMXT)F-HR11DIOH)u^l!u`x$-84ZGFsum;pZ3KvG5bCf{
zN0eljCv73R)sCbO^=yKM(2#iVPZKZs)kRbQYOUa^iI)r-QGrJyv_;0UFoFi*3gmR9
zE;QrYs963RP_mPRAGIa?s2vk~Y!?A~k=Z0)6ebCYEM9p_ZY0%6a<iO3%DUl+-nM7k
zWK8CUa;8NfQ<SsUJl#n6+9}sIVvAnnp4u8<(~aDiQjp84xb=g<vEjGs-%Wa2O_$~J
zi_&x=b-L*wZYZeOwjW3u*P)5R%mzyK-2MT*zikpP)-%X_8Nk-#e_VAUL5Q5W&#;xG
zKTs6eH`mAcIEc{FD1Vfl0dB)E3<JMpTZt_H|6|(<^9;1>*nL27fF!a=ihNsTz1<*Y
z=iB4`1qJy+ieD*r`$wR=tD_gXH7<XG>XI$1>9w{60omKx{w2t_9Xi`~HW83x1@tP`
zwu?P09|>C`A?pA~y4ijYwGv!=BZ6W%GC5Kz?|2(9#9r=mmCpPqr0$joeBfvG(5<>k
z^QF=hcf7X^KCOi8j~&vK0{EX#C%OhYI~Iy-w4c+`*#!?7?ND_m?ed29w;vol<YEnE
zU4$?bS>;7!MZ{!bNKleDZ%in*<ASS1EU;SJJ&E=^der8D-@5)f6R&t#O0z^nN@=J6
zNk@rR{*o*jGW#GwOGDQjah3@EgNd~v3?h2=XLtJW-knwGwxw^6#^BxrB!pj)E><L4
zKk0{)HM<M2&OY7Z%B}xNrw?Qn__4>vad7?3<8+?b4By{iB^fC<z%T#_Vh`4?(s7Z}
znGywH(&lbI=HlR*7!xEA2Ode+2N<$g$x`<&z<^bRx`sbd>NC-Iq6_yzLiW=Ezc@RS
z8;M~U2&SZy67x@NKGQ{GKJDEE2um<*sZTfN2xQf@Bo<V}l1KK$_78;kPq@@t0^D{;
zk$$|;>WY-a1WsYXOcB6)SW{Vwk_2W?35ZSv^^TS#O$f=3qlkQ@xLGYX-A>Z0-8;=Y
z6}c|q$CwriN(f1+Q{rCY<cT%&p)@H%a`7?QBe-%+@XhY`yPBMc6ec3AjVkl<J6@F_
zjY<%iCJVvwB`hgIa_bfVMH;Q*z_%T9e}v?lThc^p>wT#yE)sid==XLA74Oz>n<65g
zy7u_b^T0$7S=?sFoqAD_`pmY(E=lXg+_N%?bR#{sM>oYpLj1z}&K4Xb!mo`?d8`dx
zFZOJFv(NTxlQxQ&^TWz0OIdb`Y7+E=T&*OQCtgDv2@Oe5r`T*=NBi(Y;A_y?03&_R
zCGWy$QY2*R_@ARxE%SBrb&7%<i-usFgbT!GAItdVsGyyTKIY<Z&esrG(k=OzBs<z4
zC#lU{Nb>W)uU$$Dl4dnalGQiR4njrV5NP*d?2K|G24NU_B?1J<{V%pF?f5a8mB#(+
zS4AsIA+}$>+)1-KRoa#W{dy{!)u;~2vi|iYD~bqqkw%52Z(jwxuG1bvbxR_oiefTF
zg_O)};b)K5XndYYy)WmDL|G}k=p;#EOn{w@IDfh&M%N{@60^p^5VuO_k7-3HvO2j6
zRkLOa)0AiUJ81*b@%l5S4qS10e?|=o+H%8WHIPR7bL>6+d&2R@(l`XOnxTSCmQ}M$
zQe;503UF3AZm_-l9N3>V-wEk?(kE?I`KLSIK#hm4(A$p**WbFhjs*GG!T#7)O_F3@
zfS|l=WOY5+prl8pyhm?QHaR~1XMz?9%PfcR`oC9&R^!Jb3dzuBCWl&xCH+6wlP4qb
zs{nbX#<ZeABk-pg7y#}-5x=d~;ZSwB27GY7c|f5>t{X+iVoRv~flI%nMZPGae^q2{
zjS|f^x}QkrbF(&@1dYKdWbX9uNy|6s+8t^ovqKWnY5oT(J#x?|bp)+sI6ll{%PfT+
zNfa@TOi^))<~`Q1Q<v6C8-m^uewYQp3G#=sGr>_9hN0+{vel07e=!j1e@4R~hXYWl
zQA(V@et(h#e@0=l31<1J$~%&g90;umNth&2*MLpHNKWUwldQ>1f8g$`UZ>A$gv&Ef
zMsxDP@GnO47Nm8QJg@yUvT~<hrwy=`Pr|Z^7OjtZKgB-~nE{cBnb`Hv4JEmS|J=Hl
zf#PJ|ijnF`*dr-k+Mb5gfl0R9nMQ?E&+vC6{N0Zu+XGVajZl!-dRSICm01}<e(MGW
zUPRNbdF;6eyFLg7Q*eVd4un?2E$NXYysy&;mPN(2M=}g&0^$_s?oM})wK7pS;3k(Y
zxn{tLCOMG1)o({{>cEvOe{;40?o|>mA&T;@0Dm1VIQLr5>qYsoKvJ4=e5^|W{`@&E
z$r|H;q?}I7iPVxlG+^vjCW;3x$<EtdQd>_XN(Wp(h@_k?yG?M)zB{Gs6~DfvCEP&{
zXYmaoj&chH+&bzeQ82TnUjv5HnRgxcMoiq~^>87EvQq-F#^P>>Oxmqp?f4t!Wwgr~
zc$wFcu(8SBCcj0Vvggt~7(0{fh(Q>LUWplT|BHomQ=jf+QQmpQd&agbRMR=o**y|G
zS@GSiH<<)xa(mET3Z6U``|mxf*zPx46kAO&afQg)N`a<`cDq<8e+iz{ycE_=G>l37
zxhYWGKrJZZ6z#)+ND8I+J<{MLWGdU44UBwqll{9be6lC8`1X|$ypkZySl!hEpCmSQ
z6o%!vX3ge*mO<^FfBY!{Oe6fy1pii)`_}@32<~A8K<h%26X)Fp$q5hVuo&0+fF|j2
z#0Z%goou(>a%(Z<mXrk6Y*zWt*^1JafXP}2I4SCL_Z9c%J3*o)lT6bJ{=^5RdSO$(
z#UWbqLw1)~Nf~}GDV|$NlWvj9R!49Hh(CNYaf2lT1t<K(Mq0)%@6@ftt38Nt5Ew9K
z-0(JYZ~J>p;BL4#X%sixwOnv`KurWoa-Oe4r|=%kJ+d1v@0A#L<K;(yUp(|ouPNQK
ztvaH5J9}X+>^j`juf00le@F+hL^gl<Fv{Km9x$DVI)5mYsR>N-?oHrq@X(H;CIpgc
z;3qFH$PB!-ul%#Zaa(kfBP#m-%6=F-16zqf7>2F{1e$dJ#jfhrkFV-Wz5yB`1SyGQ
zyHCF+;q7=GkIr-&Gq*PHKX2)8`K~QeQX{7wKFXGp7ZnY{%|e!NSy{qp_()>DJoZRJ
zq9U`x9wA|pyUz({R~KXXiy=fZ)ssj~5~b!5(qB@ckx@#oi)*^Lr`IdO9%&(x+bf%P
zDOL7Jzd89fkqrvb=%Nzb4@(zGdAetRceer?@cUuvBAt}9xW9r;9e<>x!$ks?EJlAo
zrygiHp6D*pCbl<}X#-+A8n@H#)0S`5|7=T}B`9#M(?_Cw#Jm}um7w`PYuOzKm^|?$
zIZvbn5Vi?_*#;KwN4*WokKTSZD31n7a;V4}_(=>T7e+LjN(51E;dT@og$6|}o7)6X
z4vMw05K7;MLY8SCO(^B_)r~931A3ynyE5#WKq*U+dKFd~WJ&97`84bs&Fya_Q5<O|
z*7TWMIOSw|e=@$mSW{XI_KFk`)O0LM6VtuOmNopEl)d#{%g#h8V(>oc0#g3Nm>cN#
zX89i_ASGm(>-)ES%ZIWvJ8~d|foMudm@EIp*2nadtNhWk2~Y)N3!%PVy`bM3F$ri&
zTjg8OY4_%L2S}-|WW(Ir#FFm4Z505dOh$=EblLe8PUdeFK+2`z?P{t5tH}Ujy`Iu;
zB`UZ?#n(RHpf`Be_H`Gmvgua2a=6~;OBvh^d#m8!8VIk^173Qr&s);3gqalmK%1CA
z37;6p7Xo3Gylx{B8n=jmVMCmr3o+xyDmNN4ZgD7XZEpQmxkHtUg5dn8E268qN;Le*
z#5IS%p73x@R!St{|M1M|4e8`Z{t{Pck4ixqui17-Q04byK<``FZtF(hB&4z@=2D5Z
zz)H|~|Nq6vbz)C5H%2$RvZ?(sJz%I-l%wP`gBgd-m+Ng*h`SmB6sGH;Am`nV{fUEA
zlH(KDOGTHNQ*{5Y!^kycbTY@Tnu6igu$LzBl5JHCi<G!@g=;kb?KCe5@!bQ0X^>L<
zT+^QTtjA?S#UlVkchnmtb}LDVGfRmBL*NYbGrmnhJQ)?8EqdT}_BT&lNaca^s+oW;
zy7UbJ+Q}h&D#ssV=a%C@2m`?@VFNaE|BG!jqKjzrVJ?6ehk&2eaxLa#+$Z&;0?GA@
zccppGO}=_fbYX0{;JqX1NC_62mzTm|pOxTU2JPkKmAh&$-ReArs+8uy1yc#LOg-c4
zW>3#Q6<(7MZgRoB)KBUykC;2dQ;MH~xzwxJkAdb_98M#Zmj+UK($SdMH>T6w|K5{U
z9wcTc`(RH>!8pl4zc@&MT<2Md`MD#Te)Dx`sDgxDYJS~43w=k_)k?&dveW0Sr2&q)
z_Y0>2oyi|<zz(7+%ATd(V7Ufx;m{v<JnA%>&&9W)4x(8VJMvc<^as_>2{V))WOWwx
zmo;t?+#8zyroLeCF5TP#K0kexsknuAf{rc&>tpHt&WjVy4COfkE*CXSManQQFOvgv
z1rfsJyP~<-R(S>}Q@WtAUzh<3d0xuj>{;%2M?jQ-DD*tY%2t0HL&A*#I`$Nx5AtG9
z<Oor%GujLMM7<Zk+(WhzfpBt!l$U$ddjjja)Pxaj5@E{yPOI%ituiOdC%`YKisxgF
z(l^<)%0I@=AW32nhJk<C7hr4>`2WXt4pEbu-70aL6Ga%ub}S_QEG0R-FX0)^^er<S
z%H#^ws}#V=&hm#O3|>*Wgm_1rBqk46U@}=KGTd^As5SQe5?fLPRNhjFSt?D4r=RRc
zx(*GudWrE05nj#jMbw4O70_MNz+NCuB53_x2wU%Vol-+H1W;~<soL$O{J3mE3doau
z-gG{1-tl95t$;k4+y{6^;;}h+h5$-P5R8|X-mvibIs{K%>e{9bdMcr%^#jOgTZRXy
zVnKh|u5RJ~F&JjxrMkcovGbYJm3)*l8UYhez-T3csQWF=ucLmJ>@0bD*a9gLhg<Xz
zZvvIeiy@G*C$4@eY4IxR^|FXZ2&n8x%YS~Uk1Xx!Q}OIe61(5t+-Z%wuR$MKeov^V
z;lVV&^;l{)8v%&824dC!V|xDC=thL%_u|HSX#y}VC&ZKyXY=l|2vY=3Wl8s^@AlmK
znRof8V;D%i&Ov&+NN>{yxDd;sY%*??I5rq-ml0f9&+PS=vU9<$7=(e~l`yt(xc|la
z6vg8zPnGEfP#_6E@9x0wxUmomJ9o5Q!$rB{3w$nn`ziQbWwP0xWqZz}gc34vdEdL|
z^UklEd%$p+r=nSvtW_#PzGt{zxRcc`B@;Qf7dR!a5)=%V9t_eVX)Y^_JQ0V8c6P%`
ziJRXB20u>8HfB2mfSJTh1vUf7<nEtmzk1~x_{KW!6=ANMu>o_W$IqhZ0O1ot;x$r%
zd`tUlXgL((?NEpjgoCzKF3IwwA)UDLqSX=Ix%7LQUtz8bZMvaN&!0oudazKS9CfJ)
zqYjkY$$ms(l$BYDMI>_X7YB<-6)3?vhv87j-Ilj5%1=ud6owSbDT0T8P#8Wf<%C_?
zNjYI(Wi{<up*Z=K=H_vl=B9#y5;}cS9M0+VkE7+j&Ajkj<RRoLN#aRM#FGr9F2srJ
zMC#H{i)Menc_$8LjnR*E`rQ}WeX`RW9eDJY^^#Rd#n`RWNX<3~Ed6S2eAg+u)rqfY
zmai!KamtN$g<af@|4?==I1Ym_5WNxxjLH2kw%I0ru9TG~djZta0`_=5pF_K-*yRwx
z@N?~}s4loUBUoO#(q<?*@N#7KGYr<POAx})Pa1|N-{vAIa%nGCN)K*4{elX48-<qX
ziv;~-o!mLf5*{gt$)7H#l4E42JqS#={rInGoBmAxNB-7+L{v#-?`?K=p}z+D+X>@N
zo~jhQohxDPknODzdURvU7mlp=346dG(K)aO%tpC~z6zWOzQrSe#lw-uE@T4l*%P4=
zt^=Hmkn@RLulaMfu;L;99A9^XTQZwusaQ@WcNVw1{4XbbMLCnOoJp>P$I3>1B6fL!
zCNP#<)!O84M_W`&p;yXYGD?OC3SdNEb^So)SQ0h}l(%_gVdB3xgIXsZfv%m%%YOvA
z4kKQ&p*C-Pw+6x?6FBZZ{o{g?@K)e7PLNBN408*jQwh8~2))=|JWP4sf>siRI8CXs
z-&3>jEl?;p;i=xAEC84HQVA#V2rcyAYQHs_fV(Scer(euKGA#E+k|eiY`q-LGXEvr
z=>)W?<A<{|%5fM5f#{VCHiq2)V(qr!v8z-i+P{8Tt!pI)X6B)~K<p$GUUu}m<al`|
zt{~2L;uBvzlWwK+d`EU~gKW41diq%XCLOrKa2FZwqO@Y@4=%P@iMb>aaj2J6+(X+R
z7S#qMA3UHQlMuT5lAB;xW7cBo|EZU7PBKOk_fjULm#3eR2+qmNgL19_4caRCB!`lw
z6uP-dMPl?`MK7^Gw9D&_>-W3d%p`w}CRX+C?EYvX%8OH=InLxNFHXPRoNmC^lF2h`
z=IOTG-v!G(2?aw^FQI}=QFi;Cawa(oq5U>ZD{02_%rNd&`lOelO37mG`KkX-c+Apc
zE<3n=r#iuJbh-gff>8TIFi8qR^v_CwlMYY8xieQ}!HxGN4oX8bWf_ERz@~llXPkUj
zSGp9LIJ)0TnAb|JMqJ2u#rm$E_fsVvAj13qt^n8+;tu|H=Cngw-IR`kyRQpyoYeT|
zqtn`zQWNN@bTHm3zIL_GqFsrM*UZ&9ap;Pr@mAc#R5D(DT-s+VAQ>HBeY6kC&MwJe
z5Qf250z3TV{ukSw6n$hi(^dP{CkCg%IF=>7R+4&&j@`W?6f?(4j%1YfH?|c~z}xvW
zwob;RZf^5YS6JhT46w?sYrNrQ)DBwJp1v669}TKYd1^^3hJP>5_g2vr531i^_K9z$
zSKXU!65Ztdro}v>Vq=yh0{wHh=9k|QDr;mp7-Kb6H`l|Wo*}IA*xn;t<WVtdNFSO+
z*6N15zJ^W$pt9o_!<BM(M6g#%08|c0z5|l)(177Qd@=#3MCmv19bEg&wNJOwgbUlL
zQW>I`P{>Cs;T!^34dm4Z&6BhUV+gA}^#yj0E!Zh;N3o=%fLPhf=E5maHl^HVT~HUr
z^fi7}8Nb5ILXF1Dp5CqWuzR9pDkx8fKW>652QzA?NW))|vje2EO9baQC#*{GeTTIR
zUWyqn2xUGh@R8_z``24&WoAK_LA=UD5B+jkbSufLPYHKSKEcs?_u2&^ymDxQ9*TBH
zf_QY>69^%e(F)3Avp){5pLdKzn1`-FOn5ZgrSXmRzz=6<fa5R-1Hms9V+j2JW35tl
zh|)^iyAN1NN{zwZ*=wZuNG5F?M*k(5AgTnYw9;B|&^+mSwq}lsZ-`Vv%bMui->7tp
zUjg--A_rKIbTo%Gj9s=@_gU3{Z3MtyJ0ukD;{%o7Sx37_q;IKTBBATy(=eLljs&{O
zoLd8>)RYWj{_sp{U4AFV0QyMVDGGFz$<2OhE69{`;joOw)jWH@9g*gaq-xN*ZLa3q
zo3yEuIFl4>%c*OS#YIwor*zEP@*A_$uJJ^c!*Y@;t5&)e-N#V|M_sKc`VnpWzS`Ub
z|MdaU@`5Cm+V_=I{Wsdec>Q~~KW4%qNPDXnh$=7Yj#=&;%3(p^uk*+QSoQ#xJ;BE5
z?WVoeiN;j7h7J-rRW{|O>~@Gc;J;2z;eZ1J8SD9UF47%o(qZHukibXS%db%T68kTF
z#F~^sbvOsO8tPqE!Tu`zUvM3E5F*sKYz*e88^^;mJJKBuASO3nLHRazSFiZr3$;Rl
zAzUDus8;$ZlGb&<4+`YKKlC$0J}EncB!)p427W0x0nGnD)-+SCGwDI?ttVze2?1GJ
ze~m+qGU5KxUa6CT&BL#1Dwd?gK0Rr#o1kXtVgb960zV!QOFRdwb~b-D9i-vGG_@Ut
zk<M?stq;YZ(L%2tvLZf(UXb&b{kjbd-th36cFDg~&j9%vPy+&8VXs!({<Jjk3CehO
zY}_k$Tpn-FpBo9)gn4R3X`>lg_oo2Dl(+wm8E<gRrgaL0Dwj(Up;cK5S>c*b)5Uy-
z;d84j{P_LuHRCbP;P7@u=|79oFK^<M2jw_IdC|d;bQ`4$ik5<OPI7|D%`4OEZz@`*
zgwv#{-BJyuhu`1GQr>h^+(M<BdZjwZQcmy_F!~bmKze>qfO|b|ebT`y%xZ0KcU^F=
zN#q<AUIi4tcdKG~Zch2+?RVsf?3P0pDq5a*v@&<=U0c#$n>SPjMaz8@4kN#D7=Dfl
z_bLIdYB~okMb6K+UEGzV)B*SWo<RSa;4o~hA`(Xx_@IHWZs_S|ZvN>M&XKaTBnd9%
z>DLcWHlL|JP)(aq0oNX<abAp_0gl5k2n4?b1snYTk5$(T<0@5)KVYR!gX~?H{k9HC
zIjh!@nhw-+<qgs+@#u=ls5&>srY+eEEwHv{>AhrU3m?5=$N$zL7#l)Q(6yA>%fZ{L
zbkH;7<EN?iQXpPsH7zl(3Z>nm7hRTrQ%e^?RDB!l1J0`vib*!E+k&gqPOLo2rTm>j
zXMG95q%1G!JzZ~}rrBL`<bRrJl4e>(&5J(oC$9_xhlAD(44mS$>1>Z|CUTd62Avoo
z7}e5BlP3CuV6=_u9yVZLUI`)9tR^bWnxK8H-mO%B?N!RVF4<Hip2_-Wa-gvk+O>J;
zG@G?&Bx9cPjY3BT0g_^RTa&CzN;k&3v)Vc$DJDMpcZU!d^WFkEqS`uAvfn2t-F$Tc
zazY$h%)ve_fQ_Zy6v}$k#WZKz9%5LOW#c(HGM?aCRr-ZU5P^@Gb;nJSd75i|IR~$)
zQ|^G^Jvbw`71z{0a<VYs$E;S`G28AZW1KRCv3{iYc#LB!-*m%E5_t>!L2R(;_3b_x
zJGbMCK^Ta(gjs=1|BdA*do;O|L^Qw{^VYupX=#5JrDnRNScbb}wa~IkPDwoKwm0HF
z12RtbfBgNV1<XnD4lkV9o8joeTkUu<0WDQa7X$;%Ds%gr1}V}HAk}UaLjtE<jNPg-
zw|DS}wp=O{l>_?3;LIE@2VD?fgaPaz_hC$k0Tv8i=%IwDawE~+K7HeyN+N0J_@rP0
z6CN{4azC;^F%49%iZ&*3eb0nw)T(O)P+7qb2hA9D_kP$=FnIiv7cTx)qiv;3r>F(u
zW}lU_9PJi>u99xOq#O=I!dtC}fecc5t&v4e>{Gu-0#E*8@bqnDb!YG-;7MdK3e)El
zJ^^C3d;pP6nLgZ}Bok+HS$;155D&>sattM9z}M)(R|!)dKS>qweD-dg-L8E>oqE^b
zB+7lU(p1rAptwj*=vqGoaOCk`1ar<+vemxa6!=Xg3QtfnasyhVR7NEQW6IpZW%0x6
zFOi5U559#5to+oqz2Ec$r>P_|$ohbMvG;p_Ah%zXok6a{FbG7iWDLgf{V&!i$~-Ur
zS8;b;p(KqQVBpRFku+4o(#nGT-Zh;v4|0eYCw$h+OUcC{y*6kAK=6VAwP>ThxeYHN
z{Zo_7to!l)vSUiwFv>*WHnZK3uCGZicBoErJj6XE0YnWQaYV^}k&|BJS_mBVvY-$9
z_Py2$^Yi7dB6U#BaBQ`I{9fJDa4oe&2le{ZI_8d4=6`#sazMmo6*BSt$T}w-+jv!i
z+0wCOh*MT$9({ld1cVm}dPX^EM4jDYN@=LKQ~`6>IJI2v5-4p26+C?OHK>*kp7>&R
zP8s*q0$Yd6^|-nfk&r0Y*kj$n>VmNSRsvcbQ%dW2NJ*XU1~aNQNpVS(DR~;KdG>ic
z9qu?%ZX`nUKPx`>ukvtWt8(JEx$pq}!PL%O`lQ;E3wpTft!vg#I+?*_fMelvt#06$
z2ao7|w^K=JG6=BkHkQ@51?fSjQltSxGI}ocnJZ!Pb)+*K<(^25+^tmI9MCIG+)khS
zj-(D{ZE)hiUdbnW3Wju-7y9Sshq5!kjTnT1;Fki%G5r5yO)v5I6jfUK0hA+L0PpTt
z*6@v9lmm+bc$I6HD(t)bmZUm43afMG3EnZM#9?wZr8@b5`WvAB8`&S*$bJjofj!4>
zBV0AoA1wN|-qwN*7QGRwWEYsVGZ}_XJxlZ5wqbA}JaHLsv~94ICm%$515Dn*f!~&1
z`Aif36kP<d&7Galu<3dNxk{|heI6LOQWF}k-&{(R&6ADuv^l>Uo<on3>XKEiGAjx#
z_<URQe~d)EdodEo-!rS!V{ZI9Zk8$KH>}33ZkAob<7{Gl9aIE+RVfo@7Wytffj(H>
zoAbXC^lb=z2}_~!nx`7cQ9VklkoyYJO3!W!Pd}cINjw8=t___=wDK#b3)9@;zi1qZ
z748+LCG~~j8TtM+y;dXjx6TwtnnPpJ>e}@g9O5f$yt6Xn$g^dvspkm`6@vaPhIWig
zdv+xwTG^4|JBb=bn$z?=VWFbtL9L>705BH%-Q^kwvuxlWM}tdd`d*N_CC>F26{m1w
zXL`QZive`KqaV)BCCOnJ1fo}xpe5w{Uu<R;JgSn)U}u+=N>O4N=-(F>KtfhIF{ByU
zr#upPC^5^+=X=a)JlIjzC|AlU4u*|qi@vaZ(`i&BJYgcXzM#-(RG0`rIw=BFJ7=}y
z7$K`1IncF%5Pjr1?bBj$8buJiNbp=B;3cc<_Y|L3a?z;VS&6g-I!xQ=^@*Ey^(PK0
zk7I*U9AA6V)hf?~2`oW_HVbD;p^vXt>M20W3OI14)?Ue=?H#8wfz1;);cE?bW$n|i
z<XB|z&tx9sX$W_NN~f}cWu-|}LalV?oED>93}y4}>np2gMT^A<btSx$ji@Ffm5dSn
z(^9zQf8Wmf8(j0e#5Wk}OP05juN%J{18@QDWVPe4@^xCASczJ?4C<o4ndPb%{3=mP
z83FT)tnx@N`5kRNAj4k}Su`vN8P4t2-@Qg1PH#_gmMm#`vX<hhL@kxXj959e`u&v6
zn6;xO0a}s_y%~S)I1pG`KRA(E8OVGBhnpuN)W6u<AI{D#w}B9bqFcgX1K$6}8nyB9
zC{!}-U%sr#hyi?kAE6!06x2kU+I8}V_I)$HGH>;Jau}6()CIUFGaB;Ob-!Fr1Xn(W
zb0lYZIKjMrmCFfd*wNU;Go>aP>2D@~Rf%bjkqAU^5~<Y}(4`I%p&~9J8gj+iLTeS1
z4rqf>XU%_jKPUrCkyKXfPxxc4RzFd~;H0unj`5&+sY<;981<yRyygWnIODxkAL&SU
zlkrKb>DyTWtNwR>0&}~an$P;GioR0GaX}UN_MHDA``4A^P_&XY|88RM)X0jya-yz-
zrq@^F(p!Hi=qpW#7$aBN`nZ-ds3y6p16z>r-ZRgsJTw_+F2|CBl}QVwyM*|ZapnR5
zaUdrb47lnRigD&5AMm-${iPD49?55#46-I(ZuJ}YUlN^&tk~=RT(Nfe%Qa`e6ur){
zRXk#+0D}Rg^k~Pm*XOSR7dqajFr+(%es%bXK0IQn1kn}}fmq$J#5hw7*upj!p7`!e
z4`}X-vNK9@5Qbssl?bt8djE@UX9qpElo_>ud}W+Mo!GLZ&z10FK>IWhnfodGzQCD_
zJkCnYA^8!zXgCvqWdN|u!aKbD?&Mr4?5JoxW1{fIdqd*nJTfsVVtmBT*9Iu&u2dNV
z)9}^!y03UZF<%m#6xn}Ea1bpgRY8x~<VICr_DB(sd5)tE#>xIy(o|$VrvIJ9ABNMG
zAcw1jKRus(Ol>u?W5;*KbR>t9cMT7rnQt-WO-%mXH5rXds(QtvqH7-eQ9`ub=z(sS
zR_qYlXZV;}0s>2x2iF1I)i?i**LEXXt4?9+FSov^!-QwHNp~XQ@_f?u(%auf?Vsh7
z%*+d?vBRsgN1@?!Ndp6Vyq#(fL79U?S15gVK<)TJ6!Mwso*e3=Cl}r2#Z98th4!CA
z;~u8~z&r&2+(IJl&?AOrQPGk+(=T*fB6`~zV}Jg$hGW@61P42#lDF_q2*ON_dZg^Z
z5{Wx6Xb?~=7k$qqI>UfH5MIqSz%Og3_|`SznU^^H@64wE7&`+Thd~$!eksN_f&YK(
zs^~nlN!8^8D2af8*E@R~i316ieF(D#At6la>M=NU2aX2fDuH^x{seMrqhIoN2BOl=
z>Ocz3%8C_N=_>`Di)CHDuWO?k>HGpoz#&y7nAFh)fqqFcyOE=}^vjK8_9*=l?{A;W
zN4A?Y7^PjlmtXR{mtRKcdi7*}lNQn^^Sc(DY1B@jT}Gz^rP0yMnhU92#w1RMhX4A9
zRD*r$+G**QEh-=SqBj?K6JU?)k@8nO*zzJtbZ&rz^(7A6S&2UM{y#yRET|~RwWM2M
z=nEHaOA;c0-8yamdYi;*>A(`bV`XV`J0&EME#cA`TsrgmNS22l39DsQsG=<=dL2gk
zkOlq3YU#!?8Dgp*`!ZT$wS1G&p2GEpjFwm}J&wmS(dO~mm-R@?)DTpKL2ovM%Z<0A
zeXt|T)-3oZ=Uq!qRupn&SJFq007{>LEOce5mhk)7Njh2cqjfz2=sGcfmfq^*)^wn6
zmS&k&#i<?%oDjfW|J+OdC_9(jieV6nZpkqQ?EP=7Pi^j@>Z?jR%gBm}gADh>uPX`B
z5hd=cQSmuwI=OH?SZ89kBz^2sYbq9|?mg4qg;=@@+_JTRu)kYrj0>)erSAJ3n6D7U
zKSFe$Y$R5xbQ>#Jr_V_OD{sQ)1x<27bF`bL*sUa5tbUMCXEN48ve5#uE~xV8j&!7I
zIpP~_n|-LyPi=%VM=cy(d-UlDq|&hiFCFTsNenHX>q06+1zReu<zzN|8)%`FNycVY
zi7~6>_0%3}q?IP$CkqwqF)sY1`y_%1tkffZ)$jx<E3?-zx<E=C>WNU)e7Cv#NCzr(
zW@ku+a_iBbsnC7qTcbQFkTKo1arNJAzZ-T@u}{v?gP(R53a{N=t5A5jnQdd!3!=o*
zD!q1>&v$1S_9V@F?(GLXi}&ZdAWC>^153Kn4)=FbFB{m24XiU|1V(hv9QV>$qOk$O
zdBu)eqV1Bo!KFfJKg6I|rZnI^57L1tnWJTcLD7M>ZCL+KNyJeQsaLX-th>EGPk*X)
zV6T0vls+gsw;YFI7zSR+FFNu4FSgmD8W}0J%>MODDBM<YMQZqGCCEJ!at|mW1cmzR
zQ#O@Yw=7&IH~*s2SL-Wf%pVT>=ySCdwh13p0^T#J1Y5i=5Mb8Nu8=9=q=6@%_~~Bg
zG*>6S;RTm=If!I}c3!P4tPm+zW!ai->vwBf{+b*D<ryuG>D@})l63`WBu6j?N@eAW
zBy7WKTL1*u9!{LrSs&{sj8yrLY?1MJivySliq#Tn6w)NgDaW?+pF0Eg^AeM701F~j
zBJ66z+ts9Yr=^co2*EAj46Nj$&?N`I*v20~rd!wZ&2~0q$%gL@8Mt$E^G`S6uT06e
zN(!sP@KT}(t^_Flj*D-^#Xk#)7ZBKtC}G0UQ<{Eq+|ji=%1vi_^B=~Bv~E5__L1|v
zANUNF5Lgg74BdBblbziO2<%q^)H&?*R<nKVjEI{cJemhPBLV`u`nMa7r=w_&&l?Ui
z{6m@KVf#N2*zKGu=M;X->ki=G6Y0ZjHY+;QIAS~YdiARG!`Yc7MGV70^hn^y?dAR#
z0}Avs;DXL@0acQZSnl=DNnnA<T|SdQz5zio{cR9#a@TfB796>xceYbPU?&w}Gbd>g
zC+iFBHOncF0+wW(0oSpt(?eBXsS3+v&z-uzF;ic;c1dtb%u{fnpM=I6T&b$Bo+)Nj
z5|qKc>3vsAJ#{4dK4oPSN|G|j%ZeFH;=<eHzxX&DDF3S%5n-?$!2^ChgxU5~fupQ?
zFv`!y>q9|-|3>@FN<eCQ6(isgO2S~3r%LZ6!97zFC!Ch*04IcIZrn9KI9<t921SU0
zM>ZP0?>7Kpn96pwGsPprU|aYd1*Y;bf$@Sl8~EA$GwF23T__7CB^*|%qE!v@n>crI
zx2%A9`@dXAGF6p5=d$Awk7OwegZny<KmP$lTs1#w|1NhZBZQj*ODS*@sdj<FP5dNk
zwKwhK2o>XYd5$U$Hs7nS<3Hk`CU7wQn9}kl;0rm0uX3=J3{E!kd-_KY*~=Sc=eFY@
z48+i1%7r-L|9`BzD|~{4RI_h=iU_5l9?u+ym8>P{DB7Sk{w8I)ZF6#3aV^6Q7f<2(
z{rRPJrjwLAQ+}?zf;P<KU4wzj1-HGMBY9A~&)cGv+rXtJzxRJWS(1*ZCA2B9qHUUq
z%0tjG;;mMJ`(V%Ix{`KXiLa^0l{Rm!FvV;teSvOt##3LmCdsLs4sQT$nYE3uC0&~y
z#n?_YTJBmrT!kyyFiN50`M4i>;z4+lYtz=vNI%9T_qOIQ&4=`aBR>I&a;w#9evq7^
z?Kk!E0OUH$>#~jPO73MmD}K84cg9`<*^!*KTA>9X9<s(#h1gv=gfNl_y;d|gWIJ+s
zcJ8^UqrBMFwrx;F1j7$^0C&Y6DOFnkjz^$qFX;8`NoiAGY5%kEA7HUYjjb)Z`H}76
zM{4cO#YbpIQ-Y5Lu=TH`E!FicX~o&Qe`Ee>B^x&!X=(_NM!B}f4iI5VBCqyH=doPZ
zRL&4lt6xfFdR^EO!;`lHvb)=_QgXja$@i5$jGYT^#4rd%ue5f|;N1UWRlCb0YN}2y
zfbwx-49uIqB6VtAk&bq7tvcd^)LL`h0C}&IYl2GetG{aGE9pKnDdU)ZP4+J^_4}F>
zfH2g62dk72t;y9nUma!^+3fPJ?t=S@$N1belDzQ934bh7wI)AfWbZ0@>C~cD!3>LT
z7wlKs-0YH=KuvqT7WR}tRVu%Zvu-TI=QYRt4@KL7>=UY{<Yxf)ExV|C`$?o>2gyZK
za#Oa&w{Prv{}KK>IlA}<1GJ853-qt{gU7AAzO-qg`5cX>_NHtYA;sitO6pe<-hB*A
zXRW0~tD3{+|Ei|s8pyhV1O(GE`rb}WB(#%i<7E6-nU{SqPp0;!L{6~U$+dQ;DZj*<
z1lu6V3u^J;-Pu1=H6^74fl!&LlxT6~?~Vq}3oJt)kU?YZ?IYc67d~bSKS)Zzq~3Nx
z)tXEsGn=`You%vEY2{9$I~gUx8bQ-F5>22_3eiqp_W}wVn3a1aht_#(2H{aS0yI`w
zjj7O12Kr!d^0S&|U!0vmuEQV<M6X0B7<~VW{d|;p?xNCE-LWa6QA>=6dGn9k^D|w5
z`*d#(ae8$%Zr97#;AoVjrapr85hoUPlRq<of(?mXBXri8TV?pVY@;+JQufK+Qkq+%
z>=Ws$6i~3lOI{NoFu1NGqPUqjTW%@>eAKBo!pZh@GgZbgNz<TUlNOh6O2)(ke-)lS
zf12q-2J5N}R<NRJ|93%^0yw#Y{OR1r^JcCHXx{ST&eU^?CY#AUvhNm5l%Li#OAh*C
zP5O;@nmJu`hBt7s7XzY%N+I~~5w!}O2hT4EgvzzC<79D6f_zXv6FKoTm3vh4_4-<d
zjW?lEp5+MgL1C*5e`-aj?3FE{*69E&dXMZrj!@af!x*iA<tlwg^J|h&Ihv5(&*x9o
zBWZZPe47!W5(8{~yL(h?vb&0e%JU?i>%CQpbs`I`u`__eHoc`Ln6#KlF1xP|B~+$1
z-vmoY9kyS-nIf4I-_qlYJ8fn*@wE30LMkOZg;a|Gn!;$!PxJh`pV*~S@2CdbK{%8*
z_k?81&OPD%$JyEBC=>!g_%3q-X_^M^f3cZNtgl^|lyT>(qmlQ3`jx7qW_#B?7TYYP
zb|<*ygFkrr>&iiAqH`(%kb5C|2!HRzOi4J};H)!N7qWTu12bh!S|*9T53TGBe`<oF
zocN9A{q8&A$iZ%iEk6fgu*2Upp(rt(M(K_bm5{>zekh7^RO0QS*gK0dZA({`D9Tue
zSlQw(rX6JtD>W_AlmSv0Aca9xb*A4hPrJ@oPFNS|WOP%yv{HGSDrAH^v;UX~O6|6s
z0#72Nw{qSRJ&9=M0Su=XTH0)`!af;AtQtH;hdL~e=|WL%_757p*P;^4SMU_kuNR^6
zRnYlUP(7c5YBvc{2~XL;t^^AALBDi~r%XH|i=3dt$>#VZof1=75}B5yT&36Jf9ky(
zLm*EpI`!D+X$ZzHqzzM<`e{XqY=P+geOh)Bz{wzG0wsQu(Rb2MA{moriMd-pxjs&z
z+?XhLq365#ruO*SNq~budQdWhGM)?z3++b-2Wov2%G50m!;T>q^F<VJe||YT7uyD6
z7>2H7`KNgQ#hNC^rvO)gK^HJ^XTz3Ak<`0Jdh+%^NvC_$DKYf8a$@0bdH8IFnlw<8
z4r(IYd)R6_%lZ{-7kn!w1{gCes-J-Xp6i6$gq9@jDym1`=J;<mrontjjoYmJEnzLC
z$A1(*6gBhUzl)S%dZe!T`OBT_yV1fFZ8;w*BPX5mOU7~GB{mo+%k*`CE)IghD7Aa|
zmB0iwjGrJAdTft{s<Rwlu^Wq125)5W*)};zs%*L^=Ro=lwD^3N{qH`vm9~!3+TvoK
zE7^Opm#cAooqVF=pnb3<TlPODUe~%!y#9jwZY97HK|!y-dmYP8dZvAJv*eU$1O|k~
zN9>`U3{Ggvm6Zel!{19w=U39*J-7yzCi`Q_vpGC%mC%-pXJGLTEPO&@`Msmu?zfzS
ziWvGL=O9H}j=+~Aux5y@Q_yX>ouVxlrkEQi_<giedc8rSsH{oF+Pl(Hc$bfaxoqUH
zwBG-r%1CjSbI>Y{Ne;^aEU}GX4)V`PcZ){WEcrmg@14lYAI{Dsw}BW2f?o<nQI!7w
zu{e&qXkZd>lG~gFdlrdXR}WWw@`%Z$hCXGc+<(C+DhISM$Ge#M@ZmS^)74)jDiN$=
zuJz9@FJB9Y<j0lbxUWN^TWO>4*szr<Q8DP&{j(#b#KF*E@4E(K%-b=RRP)lDVy@#7
zWsZ-1JHePJD)Ce`JXNQOV-fSlN@6_>jcKir)^|nGC)%l~oXo)L9k+@0C=4j3^}ngy
zSt(Ty$WiEzvrRHn&C3@P-e9p0$a~-Lfc6Y7@GE&i3TykWWWI67e`?Tc9G18sPQMpS
z_HmRjxE(kpujc?=w-R|K?(^mJ3K++G!eXj<`Epk?*i_GwzD~~c{zL%$YNrbEG{d!L
zX7)j5H7~7nW9uKr${7ryd?3-%IwTqG-Hv*{*OiTc3dY;|K&o*$A@6TfVP~5PXWO#>
zXA7VadlTa|hQ8kW7*mbQ1<xiK*4w1MkE=EciyA<o5kAYeN=fvM$Pj(y0k(V!wj6(m
zd)2rs&Z4NF!3=Widy|k~7g+M8%HFIp+WB31@X6U3>?jb!F!Yx?ZCVfi|6{C1>lefb
zQgPc;4l4vrY(F!pQ;JN5`FTr1TrZGn5)8rjRBTX%xsmx*N|s6f$Q@&l7F+eC`HdiX
zY%?vD*w>Rmob?s};Z^^)_0Czr3S%$hsw1(oS{cok^8nbA%HXOM2Hn-lqf>_2e1o5L
zR7h4U6|iV5dQ2D%s%`p0tOP_z4Fnah8w&xr*RbQHhk2bn(Dfgsz9@}PK)b5|b(d%-
z0+r1w#eaojXZhSKQ<Rm;K3NB*kFlNN(W}t1nw0gd#720;XNBo3fjzQX8O=|n+5L!L
zXnLys0kT@Tgkg*-)QtR}^&GymLB73&YHhQRx_(-gD<3a;sD{K09c$Esc$3&P`1coB
z4EB?w-cKx7Qm4r&E(nf9D+N>`R+5SNfzzNAD!F$I8xN1c{e0uz0rj=PYNhEY+Q5iW
zYRn=_nU=HG*9{=KvByJw9TQFiN8RC%<j!ruLglp5G$(etOd*t0QiaFt?O*?E-}dJH
z<*V&U*_q`w48uV5N|CjV?|-qjap%z}ijMo2FM?2POX6%-B?FbZNm{%_L&TQm={a)B
zTB1vSd@%ZY_y8cNyjOxt=g8Ujm?u>NhsR>QW3k@x{qOk-4{9lPN%_j9GDzFe^ktvL
zq9V1!25FP=%g&7djqxj_yc5X#gdFlE3`>Q4pFHi1^7+fch&IT>e$bNTmHy}OSMSi6
z`x%M88-3-yBhe8Cd67b+LM@r=Pm2c+T)Q9K0A$n>E8>ApQ$7K9ty~9h%z}tXjBh6d
z^mr^0iIuF<Se^+^nbM(G%d6za+ha;x?J6F0<$g?`@<4x$0b7X}0!1)ZAeP;5#b{=|
zOg59XBK9dfUoYuOgGuvW{)}E_*WIxYH}8$p&75(3BO{jM*zlJPS{IjM?Z|-@h^1bP
zC}BTxEqOCFQl<KOvre<tsRDW9L(q<2Vl4zqbTBrZu~PrDr%g}sl|ybxid*YtNnL@w
z(eOp!mZfUKB>kHweOaR9o;Y_C6}<*Q_6~qh-Y<27F1-;PT)cT(#?M{ugR^tXZ5Re(
z;FYY`in{;B8U*2NkhWMOfBh;9#gL^XIsEHC365CupW7#wG<rGa5_!u62<@H&GbiLu
z>FkoF%fl5uc`rl~Z}47Z<?_|{-6(YGGz2`)m8H#FD3|Xu;co&`>O>jf;!H<3*LGLJ
zjr6|&!7|8QzBJDrpr6W-i7Z@3Cn&o=d`D_GR@<_?N7Nf?h@WQP`0?Rm9yT~DCn0~D
zLiM-FiX~&tLm}0*IC!u6iQKhdqCwca7PG-NE?JGTTDg2(TG;6}V9avcwo(~Lc^7`=
z3yVk@MHU%LY^IOD1~&TpolQcgYzGn@G4cl1x|LXKp;O{n7)+)I@b6iN1T-+45N&^d
zCe-Ts5HPZ9Aw3J&RyG|8WhIRU3_%*Jdy-lh1;tgbxNnr<rll21)V@c7wNXd|x-rU2
zIx?D_D|gn3kY(?Dk_aPD!pO6<X39F{cB&alGTWm@{esW_?{?(3yRIqL%mi^tQ(mCR
z6zVBoNt!9oVd&mz&2_qRMtyX*K>6zZd|q%c1}sFb^D7zqL)p3DRt&;G@Jir-G55b%
zrI+mFsgb(r1rSR37_UA194Tdyg4asJYeoNTh4s8H>5~V=eOIOC2iT&ZyWV`JqFI;Z
zWTD^O#0{G<De04&S9epE^T2NF@W7rzo+PkQG0uR}*KL((Nt*=L1FPrkl06$u{A{ju
zogzM-lJI}o{{{E;rmO-qND`%K{gH~6$~!iSplmVb`xBCu$`<^x03HP!d-=_eGWkuk
z-VdVnXnsyw*^}*$AAx3+FLsD@$yuF#9BHMi>p`-5_cKza1at9$k!Vr6Ud!LN(j|jN
z!6->eL0j!-bT^VBZA7jCk$&t+@NW}%C2cY`O7PTUa!qBX*0kKnk~aAjw-s?4rhT@&
zx1>$}mEoGv{MVM>f|MY}$@{ELe*h#@V`^qfH4Ya?_DoFr8R2ZEi{u*f^dsxE>D&F5
zRF&LO(gr02WjFomMx5M&e+(X^>!1>#`I`jhE2=^?=@ZfL?HN{gDXEk6n{i9#k#Gb3
zN<yA&9VtL>l7%hd8kX5ri?yB4wM}o|@1~_6#?HW2LKudjD?yvK>Hdp->4aYpclu_5
z2vr3VJGOt+QQj(=yaO3@z8`H!q{LNI13P7MdiY1gWZ?LL%X)$(r=QqFOHN&(Ivr5E
zd~t#DiQ8Xj{Rh`Vt?F_66f3Dkl77@SJ}Z3Nqkl=f!h%g+8fx1hXweVHkdiGcAO-SH
zW9`|ksb*%Snk|qvDs?J(00CMOwRtr4>|^L6&6U1VJQbq79W*!SI@2S!P?O`!nl;a|
zX7%TdA_sS@foI4#EBevCYY>w$@eO4;JXj77-~AIu`NP5DGXH-2O#5l9N@ypSviV_4
z%;eN^@y$E(b*g2Sh*FL*xR38mqwV{3k&+=Gio+SLLf`B=D@GEl2?9;YLs_2HfQ^J8
zg^ZqrJ=ksH6cyRg&WuBkGb_xn`A-p4WXOW<8b?3#zGRQ<@O=?n<h{~KC1lFJR~HxA
z0)Rb)`m|7I+`|8fU?Ul^BQ&jzbyh02yVIK>%0#TzZqyIth{Z*Av61TgN2tf1$=Lr-
zUhf}cXM^i748q_mC6GVvf3ZD1)gRkBiCzG;=|%u!n@9jQbhJ=b-5P1F+?5VEl#{f!
z*#X(?fYkC#(NeU8<lmu~;~st<oVbdSDe~jQ6JaI)^>`g=eQPWK^IN{Pm5<jaj$xnb
zHT?!wmj2~k8$u+Pps0<uvK_3WtbQ@oBh7^!G%+YI*>ArL_liiJ7SgyO8QCU{W0wwj
z(E)3yk)ZM@2|O^5k8ZaG_XRd~Mh<Mt(@qxUP7CRYX@oy!QHIdSH#6#`5y@bcVAQJw
z0UFtI(53`F(rmAl3+~ZrBX!$eMiie0*-zdM0?wQ_f%Z4*McMoZM9Puh4&Qb-q7TfL
z10v-Q57`U4^9y<_B0;1~1L$F#ljv%5mt9f-M-ID3+SFUSM3Td9CfV21eVAnb<>d0)
zL8LU)sJWi<|GR4dAOuHxXH?cblO<3>tDlMaw$5pXBAuyz>C|Q|VL1jwOJ$%WyHJvS
za84>xT&m0Fhs|QHf>CD`^j}?<in(AQb1~}8NBvBJy%pF5O0t+-jw}mbl$}v><RB13
zuVkRX=>8W=YIgNVO(l`@H(%7)*cke$r5{HcJmV;W3q|msuFiP!hzljsdwn=rE%qtt
z@JW=MgO`N>_j|_urOYRB{~Y72bN;ftY@gCV_2w0I6R)wxeymZJ;Ux9Djpfv^W@=`;
zT@C!Z*)r)!OF3MOygf0R{M7~PCB#kx?YDtoH@Bzkb@$USLUV(0r0-Be=^hK5GL-yg
z>Zj)6Tk*Pz&56j5I#%htYKoOo8B6wsoz}vZ{BpCy15+j$P4>e6xgcfBl8e6brUEqC
zJ#8Jkh^3;lDE4;CXmY93+s*k>PNdj5BU1%;KYfZfX*TGud#slWHu-PCe`7dBmr9g4
z>GV$0H${@@*Z<V>+`-*99zFf|;k3toI5M1U)RaGexrTosnY;1_+<a07i*gb?0B7IP
zcTSTi5rUB@oOFCqEBiAF*Vk=->!Raj?h_%F*Aoz>Xf{U-^j~KDOztcrN>AGcm!DHp
zj1Uuevb>vU<%OwH6lk;MD<ksh$_5V~jGYN?g)j_6uS7OGbN`FArOZS6Lf>2<h$X@H
zY~NS%$K4NnHAw&pQ;V{dzP~a+36=M^x%6LPpbj6U<V_?~&UKTN?PWGW6<hsZGCnDD
zf@MmuOqy0X$`h%S$ekM5XcO<LRcEg&ZX-<B0RPg5)7ILpz^(_>GCE1vqWmFA@mdn3
zxcf?8TBA3a$7=zm0%M0e&Mekv)MC_xLIF?eARy5L;R_TzS+4b&1U&g9=04hO7gO$B
z;K@i_=`B;3m<FvHR216DV=?Wv<aIBYPFX6|gn07shHDswG>k$<4daSP%Git;H;C5)
zfvHau1C*o)E?kiTmRIe#ul(j^oUWEnjZU@F!t2ZW*=;$;-1PCgo>CA<iF~>NQD5mP
z<4T~ZR?3IF1Aqr#>RCVU{h$j-bOHOdE<o75CIu=Jrk++%_nPV~qm@(cbf?@i2hqFH
z>s<$0`8Z|<)M+JiUPdd!lkX4=eDfw}U3G2zr=|}%vQ93$`f*viS1Y+RNzjjUz(FT?
zud8n23{}n%unPop`tLeFoSjjQ!ypVquLRgQ@%=BhQJQ&F*_Dj;uV1JI3dZ)l`NX+a
zPtxL+Fx`*_0Igr2>hFX=Sd9Tq^Bt)1j#+1NpuK)!A7}pu_AwDsI%c_n`kmNo*4UEF
zKU!WDo{XVf?A-=ijnoNrhzG$Rxa_WD;{l%FF?Fd-QfKtyZQ!GmvZZv?W;~iW!8ck%
zQ<ck)EalD!DMy7J<i_!x>~5syQ`*N^c-(Vi+2ZX8zIb+qMUB<|y_v_G5b`)M4;+|p
z6PG%QOM>q&x8#+ErA1_8E9I|71AHobK%R=KBIgYq<>Zet^+tV|DqA|rYa{{`T`7J@
zwJ=S=Wt7YzZ_r;mbeArX(Lg0SdUY~+Q|0nHEfo$JI-I~1sHK%7p;~AV-)LJ2C>UOW
z8N8`-xkh?^=N<6s5|6V==w2gXe1<<9=zo|K)v4<ZEhUvy_<AvLy0%vDr4xWSoOSl3
zTsW;>{zWdqIunT*81mB2)0@hcDIs<09fy1(y<9JqEQdkl!KiMSCVG@M1m601_s@H(
zt$U_Y3p1l!G8`)>Dm)mnKa8DQZp9!BM7IRk5ZM35nnui_YO6c>%a_GVhIs7bD*+&M
zKRI%!NTCL_Jg9pdqub3t6_g9zOYgwV8GoEx`fVHkVD+f(r;z&1n5Ys4h6k4G{t7q&
ze(NTdXx^hUuvFUX;WeA!Q4qd=r3sSx9M$?ZNtTsxM<w1-iF;@GF&*}6JK4B;Q&yN$
z+3g*GWLXQIyWqKzm|}QKBveWK9FzDG0{_exmIOC$z^zkz*HcmbQN2GwvaIco=e__2
zO<VnxMUrJ}=Qf#?_6pCDG5smHL}}DNN?%GA9lf3o!G4{ljh@YD)_Y5@T!IBG^?_Qa
zUvbzoNwdlyGWrp}A<<sNu239sH?eaGO<6Rx`^%51eMEpy5a8A^MSQZP*}bwvL)K(=
z+`5ox=L~x$X<2!m6YY?G6!56FDDSo;$+C88MLRW+NPD)$;HCmS?_9=|h2~9*H|6l_
zq+iRWCVXv)i+aR?hp*x+!7!oW%2I*<wi(-|u>|#13H5t$4dlx!&`TCNR(^+<zZg5W
z9E(91hHj}4Lc{(yHq{+`7+sCz{`CvdmNpN^_D)fl5g1HDkFbe_fXgw(U)l824*m2M
z>GbnC?ZSePiP?PK(cgOTJuA^X!3(>gWrU<{qz{>JD*y2Xe6Cc=W!WPx;PRj!D!&5N
z_4JV!yUJs7G=O6o>XZG&N~$d-hm(sYTnx|{o9GC$yy;i##+W->WnbCRdKF$7SUGOH
z&ree@>@h;?Rd^+T5=iHL`EZgrv2uhKG73Rkxa_Bf&TAAc6XEe=$(Ev;&*24E#=*Wp
z_P0sUZ^CTfS(1A9Bld+oA$CA>`8~~V*ZGE8z=f-j4J9~K65jeH;H&prAvcCUNVH58
z-XcX^ztJ$dqx_yQU10oy#QV8IXx&#80G59VbvQ4ghh&kMXQhVUv^s(X^hy7%S=Y>G
zB}iwmm}m=UE++hZ1VHSy5X3FLyH-roz1h>Cte^$gLH3Tfl>aH=P`Rk%2;SQpDz-P2
zTWNlK7AN)%vpQ_A;hz(2L73;O&fVb^KK*kNY51c5qByDX<7_WBv=8_XWoMY{FbKoo
zD<uI6z5m6Y)K`C0(<FBn$d8qQV<&bUAe=`KoTl{4(#t*AsXRy(fnBUaea;L|EwNJ>
zMARhS16#B#PYTQ(!P;2TnnbYfSXc`JBw9YgT;a`r33Kf+i5Vs~hl#q0pY=RFPq}Sh
zHw)Wvv*T46{w=`vbqrva1kf2pr0?+Gj{Qpc1u<`=_QYOr5-gYS)>3bBiZZ?EURMTN
zOy+Wnxm;3nuaF8;X~ic&(VN=JaUc%900L4gD?sm|eb`NPtnQnf1!*GVz)BIYH^J~v
z2>VLy3vrHovR|fUkG2HMAqACanj>LMe3kKK1&Q#0h_@?9w_o*hg?TWsuvvWjHzSvF
zihwO_x}U0d_rLVQ#E5UkSZ1=NGd;p#t1{S$*|xZgNt)5^iIh^AsVSlRZ7DAG%MH)>
zN!#-^aq1@0q9ws59=@OT8H<3ef?(i_ix$7vJk<qYJdng(U01uS)Uj!%5)B0|<nsls
zB&qU_8^~KE(^(>d;Kg^t?-jJn5NxGzcQr3kT{qDmV`pOHFbo61mb7}Q{u{f%7mk3$
z0Q*1$zsR})!IJeZm&1R0cnZ1Wp!%W5>%j~-`3w0?t>f>^S=mbUE$y4$vAgB#{p#oM
zmPDwsG2$(+0I%aR$7xupOD9xWU_EdPB&~J&y;~Woj7r=adhAYjc0}==LlG?F2OT>c
ziMp$xclU3;LcVlW{2+}F4td9O`j%%eOq*4wlwnF}wmWyq4V`gKKh$jAc~7oEE^_2g
ztFiqE<>ZbdykQjNdD^VQ^VQOR0-}~JFWE(kB?a&AYHm%-SneWT*|`LClulgdSEjUU
z3Ft#c&##^&`#q>{<$DJY6PVdbohyjxMl3s-2w291)zs=&LSwi3i!xv-D(I@_RZy7e
zR3G#Xqjx)Y(POAg3wyH{IO$*?NcLJ_$Pi9s4?2N-os822A-q|>+i!6v$uf<Q6-js%
zEUaVNZz5tz*?SG-4gm1Y8kxIDvLsf~RH*6+KTeLa_(nxvEumDN>Nbm`pvbNkk}L~m
zs@0FXCzG3tKMOKqStt7wt7Vl*CBJ*q@E>JofaEX;LeVRUg4Fw8Y&)$y+GeNN1B8ht
zA?k<s-y%gl6^HQVo{^v~96Y=E&rTjUA?$c>2lM2YNS(7`>JDwKG8d#<W$?)M^?hG|
zKI7?f2DLM|mRT5I`+%v0ZmBc2stUDJ@srYJ<+H=B5)Oc_fcMPKVy<+k+lci>rGo5A
zg)KBiq+VhPw-aG|2sp7VjH9ZQJw`n={ZvoDi2b0R2tJi8nVe&9)Cy~(To52w;(7{|
z0Eg&0d52hO6u<zte@x1L8%OztpjBGKH8Y76lm6O+w-Kr_kSrP*oI}c+l!Zc~C^`m0
zJli!<s)m(+%j~j@^(kOG!@I|={%95RzD_Ak7%mKdv2!gGiDv3{T2VoyLGJJ6@tY`4
zP|zeAEu=6v+@u~|_Ub_Iz@YLu;?vR1ujpoqP0IbH=*3L?1>O7uNcbKpQn%6jOCJ)R
zds<J@`W#x9btM~HeM2ag-x<jz-&!RUON*>z*qoVQy>yUILbD{$29<R}jvewX&>v-I
zfFm&o!@w^=AVB~Bv0G{DVb!~n*$+fCZ6U#q{YRj!MlXOtr0Og}bY|E)&kAIDDN@6}
zWl)}ugYs06Wmec-igPi9Xg4Lnl|)HYw@?78KF?V9NwPB#B%2Z>^SN373W+s_^!-|7
zn=KO7-14yjH_$~H<=0xuL)0uS5?F;!eyk-pI*y+RWHMCDjw`n<^@T09tr~<(M&O6h
zRDuSRf;oJPJo;Ir;WMoQ8!y7dH)KG<T*Xo*s*uUMiG4S=ICeGg#Dk2hi5zGLF2wA+
z?l`+AU(~@x38P)Rl$BEF!HbhI4wBgVqy;3|Eo|Zz0)-E@oEmkz4xy0*kup1#kkzle
zoA3gOu)@E3(h2QXIGKFcZEa8q^%RDX%igh8fXF3%pIADVd*b%C{4od+*&2TaoHT|w
zdOt`uKqNAK7~<YKV(-Bc9|;>X1}64|a587=DUMZeWLFK_p~^N!=W_XcUp$-obA8e&
zR{2c-&#&?@jZIv-zma)=1*&^P`=RV?a3lm_D10Sa+XDB$*d(*|W3oHRa}S`=3Ict9
z4Um%2T18fbq@);NB(H|~0ir3rqyj`v+I^@Uo3*8PQh<;dkXm{O)nZj$p`Ygv|FElI
zs#R;aa!Ka4p_-)U@F~Og=PX&n;uW3CeZAk;-*?iJcKtaoUdV!rIOMVib)we?0W7*x
zaN(zZm7Z$ICO;C8zGNwF-Fa#-68gR;NfAgL^^im}iA|8>tLU>=5gj=Zwi(<sMA0eF
zfogK=!L;Ldxt+A<3%o9to+_Y`l_$Ciy8Lk-e(-h(C!r8PZf*?OHPgz#B0E?!s`0E`
z9nzdj|B)JsG?wiR&|d#|9xUe}#(?}f$gd8156A4a3=`A-YT<*-P}#ur#vvUy9!D+V
z8z9Q$S<wf*5WKJnppAL*UL}~}NG7vgbb?+;&P7vI@+2Lz*E~+&1LwNI-uOYC@aOJi
zMS}%u*@yFY71W(Ddqq${w3eNG9+$swZ#Z%`G4-d#{|+$fEr4<y3~wlsAp1P>)CKoX
zmwKO##EY^sNRAMOf#6^A0yH)f{QqO2HcWd%4$9s*Y^h)iY+0=t{hmIb2+J$mR7<9i
zpq{kz)!};TXdT(EF!Aud8_2<5mUlM4YoE&mQqaDY*j8ZBy|v4~AduU#u+^G4;YiUI
zK?H#exMBDJ5I;xnahp+gkx<-tkBl+N0Fqpy-6I8oi~|cy_aVe^A3}_ykAxVQPfh;R
zZc6>)7cCnXHm`JS3PyLUu>YrXmI)-?s3&L!{1~l#OW;SjdU;)0B$1?(eN98gkGpWt
zkzeqn%A4(s&nX0xZ#^w^5h34GU#$@%Cs!n@KG#)z5NSUBd2g4e551kH5KN*bQLW^y
z*65-Bo>;d*$Lako&?#TPYnK#8Pm(MLPnYC@*>`}+_%Y@I&fdV;+cGZe-^`OGC0SC6
zB_&x>+Iup7EcaQIk8jtmG?}Z{$N6KWHb1sfn=*JT8=e%Eze0T7b|T5t@hm!#oRdy`
zy|SIqJZ0|4T!g~d@!Z+p_Ws}5nSz^4!QG$asro)!K_0y)*-|^@lr**XVX&CmzP=ed
z6C4XcAc$T`+XkBZUu?|8dQ4=J@&bJEBfZt~8mF+Y;a91*xO0{S%v-5&Z@wIfYr~8r
zwzUre;d&4VW+gb1xDH)sLm{*gx9zkzG<O6L)5#>TRXFSsLfLhw;rpP-eo<%>9;t;`
z#v(`t29L@}?mwRkJN-MtBRKTYKd~Rfi2ATIwX)F`!%XK|woLXAC1}4C+Aq1u+E+iu
z3}%f;3I$X7Ox<OfJ{wJP>_VmvBh{=W0AOPWW|P7SO=)_sThZqsZSlt@n*1jmqznF-
z-5Fx8I*T*GG6zw^_KyR0WT94m#D>#v9;qFS8nc#MamTf^LqhV;1kg{P$Nl@7s5Q}<
z?)t<()5bzL$LyOCiZuz$(7Z8m98=yPuC}lE;6@gL&ZT{2jU@tOzYw^QsXj!<YIp<^
ztl{Gs+{n&2{=c?gT5^17@;Fq{49G{H?ZNL=lwUVgz~;Lu_Jx`zk5k>_3B2=6`aQn5
z(%f-MS^DofD>t*}5R1v&t<xowm>-tG^}6*fBE~U)C_5J%he05QUa2t@$o((26^-9i
z%1Ukz&=Ep33?6^%<DOe#j~xGjFuXrsKp2A$^*{w@#`(4!@P|6~c^)_VvnU*2RFN)O
z;io|mACj7GpQTPi)H7E}C?PT2Y{Gb17%OCvr?7ABaNasj=Y3);9jOx{Uvm0|egV<@
zQDuMfJ|bC3C?Ox<G>=t%BgP6*=P42<pWdf2&7T~AhI8evXwq5}#G-QlQiT@fHQg~0
zVc@FrGs(}hSq5n)(6keBhq0qEa*xFT6946ePX{;u{N`ZtVkGq7C^@X%HTuj51Zk64
z5!ITm$lrFYE>&`a4W|e03MsQ0T_<T$AC@l=u_|aVAEi=5b~JiVlt%;QQ9j-zP1c&Q
zYdV^}1GY6ys)XnO88d5YDne#PX&6Kb%s^IX9i)VAO<1Z#G@q|qkuak-wy|%2<u$Fl
zcfj2l;aF$hr}JJ3K=Y?c3?h$)r!3^>=6{N^C6yRNR;4;mzg0r<+n_BP&3gSF#b3TM
znMGEmKhDlJ2Voe7p;v0_^ketG7zmLU1V21+0HUcHS{lcG>Q$*z$$p^FA_;AJ|9+6d
z`>Hg3rTKFQSc~`oqLyyl0SZ4^s%AQ)6*(94e6JXVpG*>NRf?0ts2g(hDEuUT#<k|R
zupM`vi8dvd66Pijl9q7#7EG<^W%>?Fn@l&RA8!anGIqf=v$=>3*Tc3cN<}g@D(TJ>
zKO>DbXIKN0Qjz4la@a$}{Jp*VTNoqxWCk0)2d>MpQ8G$768(1x`vQvu*Nq2SzwSYh
zddf_T<L&Wk&~FF?6?cN!3ascW9V#s<<&ad1?$SE-1b&j>p2qs<V3&2+SF)1?$guT;
z?33U@Pxc8FeDcG?P_(gj|CDe>&JGMwpk31I(YGBbsghhX+9ozsrm`M1n;{}}Nw$9f
z13f=0ktaodUwJ*^;$G1FIW4+*Fd-X@Mz94m{5c`p6wGwAKg=FNm)!YZ39uDG;`M9&
z!Brv&5XtRAyt{%~u+{GcesTs&PEo;h+0Of9(Pt0&VC)QV90*|;_@xCWg#Q0yr>mNw
zQuogN01_2lNMetBr8c0<M0=MTl8n8^H96z`bz0TusR}N1mEYY#0YbN-vQIM1(#6h%
z7)^@n3HsX3$?oj)Sv{Ie<kqXs7?AAevU6_D<Nn=X{kz*hUfBALJ9jG;UQ{|e1Bo&k
z<!O-;!WpUS@b?D%J>hD#XB=nb=#n*dpMrG(%&{5SA)JvglwS_MXB7=va>#z^dN?^3
zL0_wj-@4GdJnWoG5M6`ZZnPXPgPC5oF1Hem?;ckq!I4QUV#$sK1<@6mLU0O_8+iHt
zo*=raUrvMKU{D-9{l;#kJ0y34<W5Kces_f~6iOL5khPDS+<u>MN%9Z=<EiR*cjIse
zz_OU>`7{Ofv@+{0?g_s&S(IKqBap6@pAz#PH`rXn&`F}~Yjbz?n-?v4&)^f|N))D%
zu%#xwtNF!B@u^jXQ-ne3tCjM<{AWbQHpM7}M{;kn15pR_sE>U3AG~#eZIOdi2xZtq
zh86p!$qT8f8ZCF-OhJA)JJ%cwVGs&$sRAu^{~H@~$Mcc#{=m!zjMk<F&g=Okywl*|
z{42jET)3r;#MSe}rwFc6Z#eJ5Eh7(v59*<(!7z$e_~1e=9SwMFLnH~wEZT4e7jl^*
zJ>?elkx<)SaqWUFcS+kNG`LfVewktY`=~(qGW5M=<?poiF3b{F$SMTjD!*DE_}uJB
zubEXcAIkopQJgq!m}4`mYiXV@zKtpP0dGoIW#+(czHjK(_zI$4K^sOcW*bC($8!C-
zz9+5tbvPv~!*(lG5M`;}PAs8-u||s)cqu12yF*O1>qt{carPJ7s^SC@9hs&sYru~|
zOZTMt3~2I_8krKiW4C~)<LT<!1=s3|0E3)-XMZjMWgevwz}K7h;;Jb6T|g9$V63aQ
z5#4CZ&TEgpDOl&zhI3K~XuWsOSNDW<q8Z^mWjCheA3AQ|&H-gEJoMHid<u&b>vuR%
zrpcbdOhvQVL4-+v%b}&jP{4d)pQTB$y(qs0WiCRxmI-;-rS5o9exs!fRGEP)Gs^yO
z^zXzRTz+*HM{%Kq8qE*W=ZCU0$!!>hq3Bh51WBX@-v449Vm<~z+VAeN5@JJ;sXzX`
z5`puyts0tDk{yp}e0MW`BZTwp))_tvbCzfClbf=jolVlk0osvooOIXst(JJr^~La1
zSKp?)IT=5v%}ACKU$rj3>)0mp2)PTA&+I{3c$9-FR~r4sN;E1w-7av{CUEujOTTgW
zOeFP0sO7Ct18JwG@8k+5hLMxt-qGGH!&Hd?sRO6>9cb(HAXlc!g@5^!U%X<9^gD_>
zPH1Zyv?AdZrRVibKcE$X)0(Td<T6+0U3ug%H+z13XO~hf3+Q@;`41iOBSkNbXE#Q$
zq%xsrh%PlszierAD4=<00N&_q#(kD2Y0Tc>i=tdifs08GP0*OMS`JI4@1p2shu+@M
znBaPI<q<F!@wI+q1606kd;L%Dqrx=grx#--seV^v(SL)Aydg!&m|q(NgIOz#f60|N
zzTuwoc%vP2&!*SGR>_ds$aihkLM3;llkbX(y`dvZ&S7aEo6|!XWzWRv|IHMBd~$X!
zxDA9b5WSLtS-|(dSgUmXh}tMq<p8lrmL=Hp`*FRoG-Q!ONu~Sq4{aTu^U?fstNoqp
z$XGF$A~?j$ScS(coXwtv6zEDgfa%u+>ATw1xeDc(i%DFc{&za!oT6*DiQaFc_p>L8
zTD+)~A60572dPw-ikt8Dutc$!FM(uk5=f4PUSOdoTW7reZVk4buLKb#=?S2r)C*_5
zHPkQ%Ec*E7uW|%7b5_JAw3QPc;p9p|ux0b@rNA)X#=UH>i5GE{_YnYwy~rQ(d#LvH
z<cutF7DWB;UeR5Z)ft_D@eX(uM23yIeI@Yu1@27yO(U<giWuSQde)?j-)oXje^p_Z
z&mPG8gprm@@C;vxv3F-!T`KJr#H4%FN`+n4L~jH#HdJHst}!a)QjOW^g;QN1KexfZ
zI+m_HI6_AT0PnSJB%S~+JM@!JD<wLM2Hhv{MC$+6S!l!ya?RwGYtSKlrS>QM6$4~t
z9-5BbOapH~Ed6Sp_eI&6;5ZD!Fz`!0B-{D_#}-J#QBf3N_X9$X!c`=a!;A9`mzI|E
zEhAcjD2Z6+@y(4^mY3ErIm-62aC#132*N5-RPss-t8rrkTqX4+E%1;WV*R?-Rp*D-
z56ldZVN)>MQ~e&CEq_f1Ba%Mf4o232Bi4_GgN-G0+y`km9(<wnBK9mH*YyQwd_|u^
z4#XJQ?N~6#b#3b1W>fDrTS2M)xm3Zfbxrs;F6obUw@#2C*p<BEECi({RJJ1tlvP@z
zvqITge9XQ5ebuiULHepJ8|cVZTNheaCV{m{IP4k~So_1h>FC}Pp+1cD`zVp-<gV!|
zoiEo^m9BqOx=>~4d5<s8+jdD>Sgvsxo~yfEV54^W@5$^RTl7+~fmif@lh`b0hxVy&
zw~qd>rxn@<6iQ9tvy?OouAZ$DzYq|%7a#`~OGs!v@!I65JF_Pn1j?xq*9i5cBO2pU
ztAUCn1`~ob%Y`RXWInMVt`f_5h`)P5uaKMloZ~A&e{VJF&QEvK+;$Wgi&1wH9rkKU
z{y00k90x)e2488I2@vjov1M2Fm#$jL)4uT(F+YMNcI<y5WQVW0M|+hs!^kW#>GEPG
z0bq$9hM;f860d2ooM7Iv6bRW4$wa>qM_Gv^EJ~(NUNJt`2Bth|Z=yaRO07?j1`X~&
zpi>R^y<)`1pN)vSqFy4Xq=A$)zaIv5#Hnsi4mee_**;<nsz@SDMcONTi+rD@W-ayM
z{~G=eZYQn#ZXwf{?ZrQ1ECl*A_%)aBv&>>o!B$%UN(Y8<{#+}u*H+W5xEGQ8rO#|j
z?DbuwsDInPCn-J*$%gEeP=HlZI5*z-c*E+$dsKa-8?3%S?3H9&H(Nps+6S$VlcHgX
z&V$+qj^Ri54@MQKOXN(3n;DVqX@@-mY!a)m=v9v@t%>f_NU+I{fRT;>oRogG#atM)
z)j%au@)3JQscjuy0$_5oqsf*at6ewpECwxC8AeY0(8>KyUqdAJ34jvx+x7kZEt|OB
za9yu2qQL8hg!ycnaD4Do)gIC05yjf|fDwK;ySC(pVGwvFkitXvzgW|m?9#?*H|?Ll
z7!9&z1pD}W(uwA=O{c(xBKsjtvmeqjA`)kk)DH263dJ{d4f#USb+Vd5;lLJEqhPDn
z1>5i|sjK-#>+=t`5Vu3_*#@Wig2KC{?zCViNkzm%Lzms7&MFUo3?(UqIma5`Bh&38
zOe7}^K&r*xW9c;4&xIQPLmj&BONCd*XXfslW?<uc>zbctlXat3;3kZhS0fE73$tGs
zbx9h!HX8_|R~hdiKH@q-D5umR2uvd(t@0e>ex$pM0hlY7vi=o@>O4R>E@MG!AOtKs
zI?)`nW9zXVdZlP`Nsvm(&Z>_g+?Y6}9A<{Gz^=SR%285&BT`@1WMspSN!>e<;0ls7
z^hjLM@|?kM%6%i5a=d_E2%7A49m$``Z_$u=E8m0J2^op@WP~CdqP7kihwDfPNjSBO
zLGX+^q+cLUZLK45%$__*AgXr1d!tpCt|P^ZJSFoq61MV7!60%~QBAYrg4+6^><o|_
zhCv|sr2;xh{{P3)NzKw}l0p4|1}U*E;MnU`TQV*rnHz_rxSNKV-@!^7f_1@J9fCDq
z+JoJ3(?$!rxw0{6rk+42hAA&J_(t>3eVy;FY$o44Efam}$x0-WgF%(-v`|6p=_q29
z67Gwp;WuNv2@Y1G%}&|JfITzhd*EO$e__wx^EeJ|KW++rx6(YJ4}9m{?Ne8jS42tZ
zTw`S-sjFpm$SMAj0T$~M`_t%~HgewLS^gK(O7jxGU3+~~eEsFM-Dl_Q{n_4bi!Nf6
zl190M>JIyry7e)kb2Tz|hJ0gSTH5~$B0f)b{fpJ17_TuIF~P$<iAf1q&+Fh;m4LBi
z-7O(eG$tpy>4_S&N+o;sF;%I=0k3ULU&=DNj|r`-L43ASs%MpB9h?(ZPm%Jpp9bnP
zriFVzD+3bXS6^k<1ZQP4yxPicl#R(DT&!qIU5FgoRh-dIU@ciH!(O31>48iNl9Vsx
zvPi&s`xuS!!G+{O*%>8A2*WV+N+eiLdjE@+nO4uVe3-oeLs;<Ik|q7IfxE`9{$zUg
z6&P#?osn9dk)q&|1a+aibgvVAT8nUhy@i;&!hIBCF4L0Bg9@0!KFScgZBmg@-b+dT
z&u8C#YORn_h9y)}j-dF((tZj+e<d$*6Ygqg5;yy6^l6V~T5<-noMt8CY(VaIPALtg
z+sZFEDRL-wpVX#X&?HyF8fgwJdslxr7j9Dla9h{C`RkuAel-u6%OaJrCW!JtSkQ7o
zQne<8nK&nSEpMpr=-){qC&`ZxR(XOe&1{(fA*9sA&&H=yOw4xsvXsYjTN2`p49geW
zl7g44@IgeP@j84^kdik@Irjs69c_Y;68%kCk-LlkC_+S~q8$9UL7L$Ls2*BY(UZ7r
zQE?Nu#2o4$H!4b8l25xNj~Mt8AN_Okbcr(Tq;{XYOlS1{8~KwMSe&y!xSHhJ)hi|C
z`>4cEpnMkjdn8w;DTTfy7y8~s!t?Gw71NYaE6QO9M@8__y|^c=dagP3o3b;?jTnT1
z=v{h(4cGzS|6*NLna7q^n&fZ45K1;+&)Cn`=Ub@x2Wq~xa#A*>deu}^PDz=cj*v1a
zmBUe-%8~SrnC#&ub8^0LgMqBk#^Z6hDQj}_XJo`yteLvub=*Ovl%$T%IEy~OZHEuI
z<V_|;X$p{)Oy1Z{?Lfo!(dR_hjc-#;jLF8tw=Oa0*WeiY;WLGD?TN(gLO|XFKPKK}
z07(y^6#=xu<JJ=hY`_x^B=2Y|a`!96KVnerV$l1S4Q^?g6i4Hr-Udy{i^6!5O~T@j
z5OrNg>MEPQtuO(=Lb+~p9gYtu*Eu10tL8>kU?qk^HNQ$}m1{dw&!=8+ZLQ;;g@vQt
zL@CpLG=?nYOb%Vw1EpKShKIbRT**#u+{ul5oHWY$&`7Ri=~^tgCMB}s?1$eF1yX<B
zR(tZCb9?Dbvp|r%wVM<19xh)ZYSACjEjlHO(R{jr2-8G_DeEO>%?;!;G@1{zU!8sx
z%`TIHJX&mw{W&dt<y?f<4`p<s(5!Cz`ue8qTu>v1VIX>?=wr#b|HTTS^Rg@{N)NEc
z#v3DPMo-g9nysK?Jxm-NBiND@$-p5a-sk{YIezMO(1D<iPdq4%y=Kou&I0aAE*v)}
z1B<4wc}J>-Fu2qm2%p0MiBW4S+9Hjr+9xkMAS%bW5?qp?R?k#!)4y@&i+kG-E74#9
zA>qwRMAYH%qTy;Ue}6h@k{$<8N7d>*9CpXpK2m6s2LHiO5;@&<3)4z8kZl^sHZ#XW
zx5(K+Rt%mrY*tuEoe`Ek5BV%301=Qgpd`dn_fXsDAS;6{rMdyFkxCZAV!k+`r36pB
zek6CyhEX-XZqg%RU6rw)WIyw<_7}qI77&?&ojrO#N>XI%8_5R1XmT{IxnfXKBD2Zx
z?m?)y5_%@<mz2m>Nc2#~x{77fI{p<}<#A9~BjsEpD7+*@o}!?i3(Vc`xn_TDdHz{2
zTzJM`6bwrmWGiuPWv>64>{niI$SAAl*Ix=`>rrdHX<L%$d5o{D)W^)bhv7EYQ3m^r
z%zqd=lN^ab7>ZuW3^wNe7pqjO|3iw>?d)ok2&fpa{f9qZg#C2`u!E1bNnhjIq{?6&
z_75K#Omxn&Y!L&%AJ9QA)@?b=>UxtM=Q^S>En`fbF_k%NK#3e!DZ*x61KyyQSzcf^
zDFWhF5o{}IShZhiAmW<p_&1a(+fk+*Ru3rdN{|z3jfXbKT=nTVj!XlB55l4T3O4*)
zBS$?u@FS3-cLzU$T3)Sb6m%Ya#{(Wo*n!$3Jf_`+F*+Kai-RPiEYQaham508L1tRI
zOO9Tj*vEDfbPV#s*W>GTk0#J@O*zH)ZJ@2%F|aKEyVHR*_DTcT2#&OuDBGX|=}8Al
zM7?y~C9@`?#nEw<vS`OGVsv%IJj*I}(1Com=j_;X*0a+$Zi>5{I#Y5AV{wIdz2fqp
zRN-htA2jR>YDtTr1-Un0_&zyKfNm?J4q~JcD<&!K>laa1)-(cgqzj2Mo5ti*y<?xH
z8Ajki`G6!_4ae{|vjYW4$ESm{iFVehUU9!m<UC>0@<l%3C#$5MjlS&nH6O~(E!SZX
z2BKSn7zWt?#_lUVM6J}}{`JdJP}>;K_{`72**+&l$eZ|3AwK-}xH-1@{$zhA&|Ep9
zbXPRCzYfl4ed0G}!!*6pBLqk$6FKg$i&!+@2cSN7c0N0k3AUMMw{s*BLph<i;wP?c
z94F!mit8xbiPl~@atC1=LVp~@mpqpCAU|Bb%N76J+}%gn-T|Gz1JECzskr48j#Is}
zQRt5qo@8ZEUvWm%gD=5+dpdk}_jAVmoURhU2L30<uC(9ZHs(cRL(+icq^B*SZd#_V
z1jjXRr;QY{9=UMY!><2nFfHN40j`DEZIgA!iAYLLJT?YUqx_>1YmzvV=MJ$EL6ZLJ
zL?mT_S6!HMAOLi~;;PglLqw_ofEdt|rzbiKj_XHya(Gg)h@`}3G2y3Y8K3K*)Fb1<
zv2$%^N9vJnSpcsHqzp`Cfr*T`?!KC@l>R8x?1>G59cPajSE`Y*2yI+koN6i)@>CkJ
zDH&Ymo;0a!0}h7EY)U>V{WSt#jGa-A#2^equM`M`aQ};KcT_*5&PeGWKSi37se&Eb
z|Idpd&3a@raz0%t+>hV|bMP0ROEHp6ArJr>lv1m^Q{<A8CUX1(;YH1J;NNQC(>75k
ziEZol;?OqoR&L<p?XHz9z;<bs8Dvo!a&kjX-V7|boJI|@D2>o%-1sLXVC-@nEiiCx
zj^2r1hd!mX`gS5#vQ7O>?s&9LJlY4&snO02(hUeh7x$6L-c)-HQ;M4$z2kaL2T$KU
zM@cG%=t)n4R6t<$b$fAcM+&@u2%P(CDR3Z~gr95>ly}O!-zo9cPSm&L$&;wQIkAAM
z6D^m~dozcW(#u{eoZ(BnV`1QWh(S{im*je6ZF09@DqRRubL^X(WQSfNCkw99h%__}
zZn{ZL;HzYFm&i&#lSHzml7C-q-?PM24w6U*xxHaYG*{N|D8M=ZO;nSeMycFIwT*Yf
zwZbQli1X-m9p(3JaDKV@XRS(Eu#|Xr^#)SegjD7zd)#$c%IMD<YV2U%zOKl_QXZ4L
zna^D69J}5L&CPMk@ITJZFt=hDguzz|A%y0~?tiUK)APsFJ&A4?Kr~8Hg0amy#d^L@
zFele8dIK!QgS(UUIV~J{1e}6VB9+)jq2}fXaNm)=J8}x33}GIj+bB4$yRH9H@Z{F)
z#aGd&bAN>6?`S7J6M*s;`PyWl^?-bxcHS_`gGfBz`(;ME70oseweQM(G_6&n%V}@g
zrOpOI-Lw^y$XRp*MqRL(f|wZnm{ba*jMM-|4y=O*Sk7r5NjcX|adqlCS{FY^Zws45
zxiv%q^nluS#3OnXN#%%h)q)G6wHR%?EPqJ1mQae^P<QRh(XY`3`DflE{V^x)Z`3XK
z7<f)@Cc)abO(NY|f~(`2{}5bFVU?hHKA1!Y$+@f@2uq;KQa3C)ahLLnd4EtGF4?Zi
z#)-5PsqIT7mXjtt&s<lNxv-A!=v^c|CJji}0b;Rz-q!Xgv(QR}0H+xEdGO(h(MQ7b
zW+CCc%VwKL_tk&hYm4vd-@x76dzH6WpVOf#C8tGB8s4>NWxP{p<;%X-K0Zl1n`8$;
zAP8Rx9EO(rU+fv<d}P;Fy`3wHL`CS|PkrscPJ}VZY7JCuWvYOe>#7(Sop?9xNl=@u
zq!0iV#goYJuDwvOm5M#5#+-=p_fG*KuC#fmU<DE4DPO3kA}eD6b`Id>QC-bB{Z|FD
z5^K^U&APuUNnAzvk+4gi7<i$Fak)+pzNpB`-(MHC^%}L=xoZX8NM(0NtwsQUb}ER&
z)~5)zl18q_S@f0g?_zWNIe@J^2)iBRUJTgb7q<?!5(PiNBC4h3=L2Fw%T$WyE3o|L
zw*y4Ef(D~3r(R@ux15sd_ga@?RwV3L$NTCO6;Byta9vkyQVX95&kQSfE%rapm2j1N
zqz-q&NZ~!xg0F1#bZ4?ICF_#6g9^T~)vMdvNpZ&Ru=LL)&6BOD*iJv|bp?`Vl^wz}
zDOw(JP4^`bPg}zxJd=%h&_;4ma+3Fnb(*M6P%bM7^{jg*pY5aVnXK*njy;wR;_9cL
z(}aZ?G_rv%)M6RFw@k#kE(C0=jw+92@BYUvORV`v*%{q948t&VB`dZ>??2fA2k5Ej
z57PyN0u2(Ir1<We-}Hn<x~L{H$fV7rV3OS`RC|`E^)6+f!bMyC^}uH-zJw}eGAIe>
zSxsL!mefPu{t(pO;9hN@Rv4CRz)s9z?ZBTZuqz+x91!6i487}fhXOmf*VKY67-9Y4
z_5PVu-(AD&_pV`Sz`>Bl07dTHuff3rISG9B*@O+?gZ-}zxJleFDfTSn{6f!vp;oXx
z85C6n0Vq~8<eR2Nt?MV6lPduY6Wdzfx`2cG4z_5$pN3d}A;7InUI3qlPG2y6z+VHL
zgl0}~CE4Y-CjqQVM5Z8<7kQ|ew^$#wRT*cP4u`@6vUKGi%FD7DMZ@>2O7lh0ur9#h
zJy6~Lcvs8IC9mnVUD*l~mcY~T33<YR+N#X827}9_-sP1qb`!O(2_uvwRp58r<BybB
zm1MFa4}X8H_m^g@N*tI1_bu&_1pFkTR6_{lNU6h8r+*~jO#&+k=vP%8f|VTo>W{HA
zz?Be$f#{V`pe^^m*#9xkV`DbXUVtbuSUR0I|0|JwgAJ--gCc2aPV2)?$(5m(yVZ;9
z4hLb%yTuZ<@*EH^MC1)<HJQG?ky_cGo!C1v>bH2Pg74b+al>=jLp|AT=~nG{jdu-3
zv(v7$L70<ac+4k)o?M1ow-O*s9h8HEawgwWv!=6>R7o6HO7xmd-mEy&@6vqI{gdQ^
zoAdu0-M=JO-sAn(O1kXsLH{4XqXp`90cc$STImkg2)|49iuPk1!<r#$qh5(0Uowrx
zBDd08hYG=xvI{V$x`I9*s3cbQ?LZo&I^{ti<Kds@6s=0!6o8D2b(Z~~6jJ4Z(PPLA
z8zfGo57aKCN{J{_8p@UjeSurjDsN%#k{P*A29UAS-b@QarF6YO*27BQ{RC_wSbp1T
z4oQEE5Hm^c(Ku9a51f$UfgVNJWUcX~t;j@=ot>x?E@0#Kt|{oz6z)5k<tG+&*N;|b
z9M48>Pdn99NS2KtJ>G6~2zq_`XX;G%!mQBSO`^}Dz0}Hol$}YA!!Qg4za&!|{r``}
zu+zmk4A9OkC&3D|P;9bGBWZDu1^;k?(K^a)!mcKXma`|pk}ln~G`qd+V<`iVDKQzx
zAtn79ov7O%laeiCW9!55)*rF%ab*oV5;;N5?%PgyC*iBQH~q>4?nG_Z)WtLamkr;0
zl=!=rjr|r-v25&z$4)22$*Bwc8<0Oz>hV6z!QZti*eMl=DN**;qufXxcp<g$6)+8I
z;g_EswI+Zyf@(Ta9WPA!^N(%`zIc#@UEqtCAE}Zi%H%bLOxG{%mgNJTUPghK^7TS1
zDWB`r#soY$$q3AYCzx`A_mkd@R6c5(;*3Ud24+$I%%saQboxeM@f2cW#PFddU6%iP
zg<`1arM*PA47$JLtOV0$cK(|>vm>2{_Xm*PYo7j_WNfmN2ff~4yHg3-{OMahuakYp
zKMtnn1u`xrT%JmxpMc}n!hp!%<&rIn_$9sK7o(>{vpgF0IiqBqME>$0bh3FtHb6vd
z(4LzWEpyT(&(Soh{bWO+wv?5egekObp9|I}Pv=ms`a{{d<R}osK=eu^ZpZHXUu@7!
z*E3>TIP6$OB7(%J?}wEDy&p8R3az#%bL_@SG(L@LeWUToD8}n|oTOJq0s|d3)Lyn)
z1zHw$={Wbn2EMuspe{{;$j?u;<K)=3lGud0v;%L2BR=LG-iufg>atc^0#K}mu$`68
zn;k#icYJ51vRb|vBNp_vA&P2$1yGkk=}Hhj8d4A1Xr)ZK=BI;K?xCH77rUi7(ZTAo
zO`kYyy#ID^I}(o1>2N!aVx+&wp)O;Qm=Ppq2q7A0^eZWCO)4}?!Mm2U8uY;;iQ94t
zO1(g%30U(76t{;8rIau8j{d+SaH4EXm{m%tnf@+>I5!|Um`l;J%Xr#TAsu~(bO!C%
zoZ{FuvP9o~s8B*(5_M)rNfGI5?Zbc)?sAl_RinlASo^&XTE;2GUgEf~<R#ju?d+fA
z;s1n)1Fm3D{@U9<67KR=(l~8f(wOAFVr=B0DTvTFb_iY717E8qltLQXRj?70Lhs^s
zFTJ(>kajLM2*WTCT`A7j-hVMrAukoJxF8m=Dl3iL-re&Sl)}+1@y6#yn7mE3F*iL{
zLVZ1l5Fq2%w!LJ-p}wADA5`jXJI>%xU+-}XIOO#OfO1*T<qK;T3Pv9tX>e~h0TO_D
zjt=g+<Lt<0ITg3k>eGQuP?g5FN;4z7Rmng5)FQE>jE{?*J`qR5zyfF4;4B}(OHl~`
zY{qS$`307-dky`z#5&{Yuf5$41Qr@SnUu;1-jhD!0atL2aqowF*(wtJMO~?0qT7AK
z+>XHZJ8-T47e~9aDW6>OzqD!nDV&FZVcyF0445`U_>?fsNTp(jFoVI=_4R~?c_Yw{
z!NSXpmxaV-A#=+`=fmK_%7HLQTozXEma!_qO_4KGti&a+T`6>Ye)O0&{>DmN0yyWH
zddK<OB|0S%@NT5l%HUk*Rj{!ICP-XXV<!QdTr2XEmihuAb78=3K)oE`Du?b<ztTm}
zX>tcEAO-(e$;;<h|KRKla4UvE7<#3WgaG%y*rZ83wzgknyFiqnCMq_z^P%&X*0<ji
z-}uLDX*sA70yU&S13qL={6JcCKBPk7?Sb<TV3a;BD}*r=npI2MP#Dw@Yt;==-mqo8
z!PGv}jJ>WfWZt5QJjpem2wZmbM_bSC+3X+PbBI2Qga@~1l50mr+P|`DC!V+8zB?&U
z?2netu#Ps}3;aqP)q1QkNUD5p2#0$g{Rdej50T(l6X;&Y6DR?ZNlN9VrIam>r+wSt
zF$YsRF39CBbl@!*7lW*vg)o^cPZBu2KU%_riB;ioK!&?tEqN75VXjm)tTd^b0x~$-
zarQuUDFH;0rB+X>;pkxdUZ5XgB2)jc5d5X>ds3}h$Z=9_3{VpilvNmtlj3&T%Rfq!
z#sI38rOb8ySAs?C>z?xdOYeCWSj4)KE+3fq%*yR)Zwb1~x0MjO9<4M#uOuF&M`|mM
z?vmF{9G!)yDeuvqGJ|35FUrm($6*+Tp;z)pcC7nfY&t;s1hgsG?z$2Zr?4$jBo$Ao
z8+?<;#r7CnioHA<us=ZPiK|o||7K!#8b_P_JTYB4{$xXNsWKa9A_7HLw+L(^w?sk4
z0XZ*HDTiggl2l3!dXNCtwU7AxuMF-Y66%lvDf!qxT;ZyWPoCgG53!CVDUwV|b;*4b
z!Jx^U$H~}jop|d=%eAKoQkvc&Bav8k92Yv@YmNRxB@!ta^smOfp&h)e9yyU%mNE2Q
zrS-)+o%d%VZl~7Ccgaa8<?V`N58nLk2#sZjqQDDqAY}Qf5`Cn|rAchx#7xF|(j=*r
zckBJre*iz&DXt@!4_L%fU15=uEV2@OgSVS|7g=e)oXE<+r#SE_-c3!!)vX3C38oD2
zr1ttm;dNsvs&ceoXdIbNQ?DJ<ckK)3HAy0#HD4>)?Y~r(@=ksH(&X7eM}91Do~5#6
zM~R}DwRK0c@MMar#QlCB+&2>(!Jm+oO9|VRAY7GM;3xf3MCJ2|{y00g?1n)Yh;Au1
zAf)|oET^vL>Z55U?FMwfA=uKqSjcq*#D~6I3|*o7c!y?5i~&b+EtOSQl~78^(8R%a
zopo%#G0|bw`$vafOy2(fMH&0|7|9zf{5H<DN4o<lL6-+%E<<XsbNQ>g11V?oyk!O2
zxmnBds%!H}G5|aEyKTDv^dTdKA#9RNn;HSmQw9+0gWVBG83>4@KWrJ_X8GM=a)MRy
zp)PRm2SZm&87*OyYl!_4OQWP{EH^B-ry8Y%{c?!?5=%p={e{K4O7Wr+@@RVHG5wl0
zLhFUlI{vjLm?mIn*wYQ{0GHQB*6vhcXoq9`)DK!lP6@4i^~7(x%1hdAF`>#%71q!-
zrTdu#g<avSuF@Oh%)gz?9B+4*?9QG7p_M8AB0jY^=3KVAt_<Czx;J^|rKZ4Tb2KWs
zzR~FjEkVudEyfFs@<BL6J5&uayq9luz$k%&PN1MU+PTI5N3s*54(WYBJ5xNtNPm|I
zqnxLPE^Sa6$4Ne|_1`LCluypi1-D@shM`xI{E6lJUu<1hJ{MgF7Q298J3;J-G+$l_
zIP3$-F*m<sT3w~~W=BB=(29RlssF~PJsrDfaQGi@?pbnx%K-5NO6vn4+un!1N_SGN
zw^hl0IsEKk!XpSiyRqOGZ9k^<LM~g}Mh7_4y*+#HKM8215TJWOSBB&VGE=wAhAlg=
zD5odQkUlxO7;#t0D}0rvw#ucO%s`(!O%qZxGsz@LXMKBIXnx@`{)d5hs{|3AEVoUT
z8<grAmtQAdZ;WPm{nv%dyLVq{3e468X44ixQn_us-pX(?kv%_wC}bj+rE{6hkT^L)
zyW0qGddQq>3_qsQ)WoY*i(*6g?A;G&!*_x?CA;`K&)=pl&B%A8C^_o4?s~NCZnDfE
z6ZYhh1PX<|BxSGc&5$_x0CXl;%=@-0ci`&&xk;U@!@t#=RD`frH9xn3)r@G+grub2
zk_U{>$U_@huQ6vwG565(8ImVQ)0jr1{{q2w+0?ulQYfW#E29v=z?gnC!e*c2-(z|B
zS8CRUIe(}$@kQDh<tPlpK=ewEV<+zYFGd&P*VTd;R{ZgSqADb*@nqioe3!;c<uy`I
zPYk)!&?X5}o8A*0POgs+IX!S;e>E0?=X%zs&CWDTmf6K^5_`RELYUPn`!ZR=6YG9S
z0k$c<h_G08GaxBR&dLd-ppxCwJl}>56=6ei3HTMk&_S3+;IuihMJe~1zcR-|q(Y&T
zH)hU}D7%yQEmtTJJSz0z=JdN~eM8Pp0}M+#%p@IVjV|DKEV;mOSaS8InVF9$>pSI8
zS4!xU>Exd^pfaO>xgEN`!Cwje<4UVRHZPOgWX7Mn@3Rs{R{x)<wdD(-#mUvZ?&=nG
zHTYp3`Y1u0ypqpG{U1h>MtmiXDqln=MBg$$KZP8ro=uE9pG}O1+-|K<Cb3Qn^TSF)
z>&BLwB(N-iCggt7WAu9ssFx%%rNP^=0BlenTUpPM@GOjrnQ9<B2iNcPGffJmO*eoe
zpgFEpOU^iQrS1AAj3uq*%5i|DBE)nYlcQ1>0uW(At~ty#A1yM*e0MC}C_5M2h(Q<%
zUWtH>;r<uvD&mdRsH(FUuux)wzw?eIsB45u2>f;MZLcheZQ?>-yDO@gi%@A<`OML-
zY)UJSn9E&%Q9aPcD1BV*$}LL5)_TtxT4!F-$`h$siJ<1u(d=Ymw}aOo$&+}zARepd
z1tQ*No#)c6jAW%HxJ5zSD@(=}6pj6zb6A?fi8>rqx6%y)MCjd}F>!%bUIcV2r)Ozt
zQd$a1OZA!9jt7_LD#6)>OqliB66iHO;YWk2qa$@+y{){QeE-XGU6k`ne^S5F*lCYV
zDaV-*_p9`Rq{89_mn7dmDLrI^`rpy9WX<|lN#J@*uK!pXf1C+Ry?ybWSgk}X0^WRQ
zh<0wT&*aY`+JV;N!D5etwXQ5_J6`F<mFgTlH=65!M}5oPP!2_xhmz+jLyKY#yKqeQ
zE5EE?arG?cqLv4SJBP!pd@qr(bV*Pj*hL3cF%E2^vc%{skZ}(>yUJ5%t7F1Q^n)hE
zwh=Y!Hfgm-#&{m-aGkzClJ0NAkt`jlF|_<B3;!^72DlM~Fbw<>gapF>Kh|os8LGBA
z^MMGVJub0h`@c#!RGmq+aH=>d&8{H^5-iuoPsUEA$vw%T;4fk6<nt}Z#!V&=M?1E#
zc+~AP@DR(T$4k_ez5Y@hHQdZRUas;Bhpz;M>$7GaH&P6zJ`;T9N6yNJ1{qLS(#;!L
zD8|Z>Um%01D_au!orHeZJw5%Vs>A|pWj#9ClM(ef&D79f67*MZoFn-T#~<MW(8C&b
zVc@eS;_-D@9ev~Lqgwx(ABtAY<r^gYc;3}49xTJHp7Li0bIDRoj6o<C24hn<JA_%1
z^kt(wCY_niFB&k^m9{}FY7646ep|_KHK^yw;TrHzolW1<9>4c<jBuT~3%8tG&veKu
zdBz9phr=iDQ`2W+&U9iYFsZ^DvhO8-Eijiq2tJ&2@vBUq`o<A5)JtazMLM!7lm55S
zHeuTYwgz_dQBYcj9(;<vd{5Fj$s>vcCQJ#Xb>x+Jjdnsz46{LNYWE;I^kpVDP8+_9
zPI;{URV7?}KpY!lzwh4ai?Vaebsz>|=#~O`?|)-AYRh3Xt>n3X^M#^{CV;Vx%$$x?
z*@~wba~!*PrCd>CyFstK`fOEbTK3ejt6RbNk21W>dG{lG6p7Vu_LxfUG4=E#D>Bl&
zE9##w?t&1k8(S8KmO8PqSur-g16T>p^&p@2-5%@QZ^oGlI<e~CVt|-GjJ5`QmX9I<
zVsiVUxv?5nRQfJ3V>y-vaWlFAd}u??3oTI0zGDtHa*Dm;9-opX-!0W*cm3M4ZPZU=
z$$Yx7EV2E8CST&cJME{;r+_hM_!;e>qioPn>DSfG7>I`gfHw-d76sh{T-9J%a-}#9
zX+DBO=40uf8_G`1_-ur7<-ev^<~d7=nt(3K=%VC=z?=muXpKm48Kx1hQ>sWQWS>|M
zv#Ut&^XBO@!QEj^qkB%l29ab^0%ist&QtJ_x2_*iX%z>RK?I}ANRDJmw9CIP7ME`|
z<rfPmV4BmVMC&894Z4A4UYLzF-S$%3Kt3w4Eo&f<=POFE?&(0G&jj1jGSd2v<T9IJ
zTfR^C$Jx2yI1Iu-^hy{5aqoYzM%B(^m2NfZUcf>mU|@b9s5*6Hi$iUhlQE%8`yyar
z259D<Cya`M3(K8(+9{X6oLSr3tD`3(1!_womh@8iO*F<?M+_?nRzeK0`nI>HNC+re
zZsO?ZJ}~X>p9G`fL=ZdntznMP?MX0^q;XV|K&pv5zC5)m&{+aH=?>l><7Q&e3?Z0I
zFb<sa{sarWOoV9oeI)56&Hl((!q&Q$!8K%Az$ye=z9&(i+lMfn@|^?Fauoi%h0{mh
zL65dm;|4p{zLs_>vEv`MzoN0k%_i9sbLrUkQaig!$8}77$UC`{toRz8t0W>UZkb2o
z*Mx)T@+)KD_dxLPKP%w~o3$OXbYdsrr}AM}*_K$+&D6|v8L95iMZzps;E4fI1d?xd
z-|{DCY~cbyt~nui(=QSMmX&bn@(&k5Uq|u<JxOf7NyDb84gbZ~#ntc}2J-WRR87l(
z3}KZ6(a9|Ga3SWc8_x*BDkmwn{6jx~SUxE`7bFK^7=~U6Cvgn-zgSsXKev=!u?N7z
z@NpC?l79NyCVvoIV41#?Je%GlhslO0lRV{jnX>2@v&$zm>DDP`e_j8H(r<LyS<<t!
z_Xw0(==<rvRp~^R-l&2iKL0QrCusV5Ih-Ksd^W@LtlDtmoHW5<$xJrBp5aU)2`JcH
z7b^0d9qdxzH5U(Qh2U1EuiusS>y1jXot5e9)%NTkM+*!^WuRLNbZdcbEnIdG6qQQ?
z>dC8%nMZ^}2B_?n^0RKadRWVae@Dics_ABw1Z7)03b;g#4feHZ_SJ%k2<+=q1N-4_
zJ@g4d3qKDa-p+^3@@LXuBniqZ2=M|qHz7n+#K>T>?M${4{4IJj1VL%Up&Pi^^4)c*
zh;}RgR|E$a_jJT*h)VdsVu!`jU)WFYJy!^L`ZlS&z7c?`l|r^wB5R$>W?Y+EiX$XV
zRqE$RK8rV7a=#nNw^zdab)YxEV-p{v<}M*pnZLF_0@|DF2^;hzy(!<^6VmqwX=jjI
zF$e?ED`7i?aQ}<-_p9^#7i}g|cUd8WPymnp=KI61cHgx1P}3`Gf@nC?YY6mIZgqLK
zhyA>oaQ|S5Xv-nXz6Yi^N<po#T5zCD#!1fsq}_ngcKR#wzUf}b0Ngxm@l?QlP0WGX
zss_KoTDEW^@UGmmDQySayTK?vCh;D4kLW}>v(cds=7ugwQ6Eibv6Vl_@b?OwD`VC_
z=eB-Pq(I|Ptu!tl({+o+(NCbt@238HFOW7DC1!&XGq=NYU=T$k1Tf1_)zv1&68Fka
zcV?*6%0^|`vnji+QYqvNoEKs~U#A57O4Ddo5K|FT`IwHswXGiw?>&;;<2hhHK(q)Y
z{*Iv}$E@@*ofL?Hf(If<L&O^g<VI50FnF8=9%l{e^S8Z)r*z5W$V`sRV=Bq|`tmWM
zy$9vXLHRQ7jKkI_q;$!9`}xYtj}**~n5w-nJEqf)B;*?KpQGKLDfBOUM@h+&Ti`A@
zl3Pk*_-dY%Cb>1S*LYuyol%m*APhsVRP4l%`(JEn6FoZ9oe_WesfV_~*hrRy|2^B}
zvdpk(i&sMa7CrFcn%ry<`yMrTB@m!5fGu|J25uXIB=e-{EtOu6@moH2Yc3M*Pz{bK
z$^qwC`^|ql^h{JVYyL1B_fz3lBtSA7dPM(4dLzy*623VYouC}hIu5qo)=aUcE5Fz`
z3HwH8_*s5Uxf5xF#}k4i=YjHqx2)f(zMxyXPu75C;&#C)hidP9@@uN!NP?3;pH~NF
z-=-x2OHxvH)7@g)yVt<J^0nwP5^uyWB@Q1)c^gkgCAMOsrhDKo62S)nCTEGucf#MP
z%b#unBN35T3)h!nioJme0g-b(LfVpPxDw1-o_7_DRnqBHs?+JI*{qFDCjcS?(f$yt
ztO1l&`CW@`CAzN%_04=zmJD0v2DX(jaoga2iSFyzsFawlyyq-$`9D!WAe(#nzZnT7
zDs?FHN$=8iEH0S;@0OqmwL~Dc7Z~(fj#Ge5Dz^>3+o01K-N!+P3iIg!<~kYzke06;
z%e3<DcK<j#qa24p7>Hg8Y)r!aFSb#Vc}P{IsrIj5mP!dF9?zS5=2iccgZre1Pz2t}
zS$sQ9J|Bs+WD^;$O5<~tnCCsEz})NQ>g?2b8rHZC0QWUJkRMy4>}Zr70<hYG<u%F}
zWG(32e)ERoeSH^9aM?=Q-c#eewRSdd(1h{F0LID!YE~L6%m%&Hw*><Z>>|tw@=vzi
z@bCw3ap|7CQk=9ZK|ghWG!a`_;=YVS0I(UlP|WZb3JI0jHZ65<pn&aa)*BzSBmK1E
z0YfO1RX4^Dl{D}gbiUh1FqpS$2foTLP^)=JIlu8%uF~G$WGZ9xLj3UY78PifgsB#j
zV6U6-aUJ=+v>*}aunbk2gq2M{Fd6tNv3ZdMkY^El=(o27OX#i8J7Kqu<}W!DT#p6;
zHKJUK8_x5zOO0Ha!hZDX=yAF!XEtAnJ2x}osX@S=BY!q|#$;m?K>vg!1&G0XF@dfU
zn|r|}#ZnjQQC*+>uXey|*pKZ$k~k|M!48=-$B_1QJtbts`kn$L*o8E(G`<(SeaEuK
z)2E-@{wO;a9EU*|h+Zj}7|i`I)+(x>k<#5sFMzBlBrxA={<y2l4gZ=XiVa_7ht@f%
z024v%zTFwb91p28uvtRDf8NaI`iWz#+*^4QfkUURTY24*x8xr{>ymTOT~Z!mNm^pB
z$6eo7LT3H|#F<q$+?j|}@!(<WjZ&V<Z}ruAIo0*mZWRKXHnC3$o>5|V>CE(HhY;9C
zm}E;B@8mCV9vY_FLSQr4q|AbNz27%)d0q-&6K0ydDh4s;NlmyB0y__+0z`kz&Pw`R
zxv`d9QP?PpjUsCg-7r;dGd1K34f%qG&%^I4@tpRV<ogt5I0IrdAjXO#(O0=-E-RZh
zEf3GLY2AXvwUnAAK^T>6BtMf$SrU;K@DwrDdK{5w$yjdV5V%VbnB4x!Rt`V^%x~AZ
z>u$+a+5o{D<bXTrZ>|y3a#3#Guufk3c-jr?w$6L<I#G*1B(J|$f{IVo%BM5+atAu)
ziyG~Qtpt6wHBkp6S2cYs#YGv(!g=IpWD?R5$00Y`iWg&NblX4-!_bw^qAmOOU#vk|
zzAKOqW&t5K5=SCMl6_?{!%q+jRFs($f~`FMf2)H}E}3a3H@SkX923Ucm}z57y<>>q
zs}f!JvEFImB<iy%-nZZ?8NL57kKeOh+;^^|54%;X6)!?~DoU_qrt&r<_`lBhdZ3Vb
zO6WJ(w=HCtxk@AB!XeGu3f1OJDrQP7J=)1;g$DK<zx9fK>#s_WiOENzceAwAqw-yQ
zocwjDe>V~aIhOnatc;imj#B8T`Am`}N;|&*GDrCutPFMaz!SwI<u|88J9*(sU5I$f
z61?|0QzbfXm}+@~JJ;h$cjwaqmq0HRQm#oNSVw+Y<|;J{NRUkDjmh<n%!x>-EYRhN
zl}VE?l8v^6eDXHbHT&W<F(kOh%=hHBd$Zn6<dI*K91gt%Q&}`_<&k0?Z@+9s=LtPr
z<pd7Gb@6NjCs(e-Oo>m63Ymzzt{KDSmXJ@@g`>3F(r#y`bVutLA)mZi?eTYs^u0Cm
z(cE$0Y`zSv_RuZFDo?jfi;Qk^kO!K6B0rp+YYxLO2!pS*)I8GrUu>E-KBVpk-7XM?
zsG$TKTg*-J5oP=nRL*B}BPiHY)FUg<uc3D{^NUmnrK0*tfhk<}^Uuc~m(<Ry_~oj>
z0Q?C@^$Uq6_kxd$k`<a2Iof!-gn%Hbt-uP+=-Qt1o~k0L%W+nF<HV(IZg8nUN-r$P
z8wW7b?3{`UqU=d5A=!<L_^pLX+PEk)u%?pzJbYfJNK=*1GVtD`_@BqQq<z^=TCcNy
z2n!=9N-gB5Kk9$?6zqgIrC|XSMRZv_N7rZp<U;t>u(>p*T&-^Zim|yVV;X1op3r;5
zckP&e{HCwy4A<4bntHTva+!Tc7kOPNW%D^z#tuwL{yp*142&L{hx`t2Do6f>3Z6Xc
zaf>2^9(d*Kxw0*A^1}jn^8wHr;zcs^0aV~*Yg8B-6>(dmLX1ytRPr|}oyXbcWb;bv
z8k&21l5pepF@D`n_YePGvdK@Vn;4-iA|H<=_wH<um*kbeo|K(gjsh_ZM6X2Rc1-Sn
zv4K|CGsBEj@W+=GHCbKTZx}FBtbzsTT2J)ERpK(z3b+pO?r0OgNCZtzVml@*#kmFI
z&t1L}p2qs$a12}_)na*?dEofEk*UK}#z*TMn=3?*1hvs!0N&YSQMbib5-{0(kQ$xc
zLz-Ax5Fmt1f|kQ|EsU7b&Ljbo{~T{$o!UYsC++{3GDbdAA4E;C2QKN9*r?%%`}no-
zk@rIqZZmmgi7#`>N6**)-4|MKUployzWUPFtWNPsD*sgR-4WrDOVR@RHA{=NEW0Vt
zP!hU30^g-h*%}tk2w{;REY;5O$R6!@&`<W0s0lLci~gQo4YO<OAg19(dp~Zz(lwut
zfxCX_T+EOO&>EH=5!kziSW=Hl+Vq1r`b=L5f$%~(g`#t#=-eMvVy{LAfRbnKB*NPt
zXodbpA+T}lK8<*wpWH-HPri()<$M`mjH!JAC+f-IjU_dRkD>_FlXb-VnA+s%C@Xvq
z1e8Z&&8wB0P)XL4d+sV-bNq+1Gs=w^27&06aDW8g|6+}z&hsi;i8O!vh1QM@7>1ec
zAQl0WatP5qAFNJwzc6ZS;L}4{<i7RZpH}1m={gd9(^?vt{XXd#iPpVhBU9_W4Hy9f
zuyh=69&NQww_*sXNRS;JTmKlT`ktXq1k;(9N$V|5U<9CLi(0g%N~$MHax^JHqycOQ
zgnz8}ChA8ze1O-`?f-#$&h+HWJ3GY1E}`qzFU`N;D2_;G%2m4cxj%xG6vv0hxR?IV
z!_-?+Nn34OU@dMc{Or9Nozspip+6!8-8%1@3jh67x6_XNlt!r+(kRaGq)il?#*!hy
z(t|HI|FC2)ECubzAh#u47E|5TizEiale^kK=PwPG?W#&;KZY5GwgMFWLtHbzc$W*|
zSiPl1&TV(O+|0@Aw))lam;@vP_9MwDdNXuvpoa=UWlyK4y6yI0ljyfYE?FE)eC31q
z9qLM+|AYv~<&A?5V4E?A;lCYJnlgc$a!u6}*Mz!~YrE&lykM?w3zP9f*}3322*W`1
zN+faP`u-PNRG1e;D-C;qMnFw)Jiir635&nr?ln=j_C8?Rl^VK0nnCQ`WEb=3l9-dQ
z5c*48Z=clCl1*+m{J#WBmoIFbT(?4t4>J|*#oX-n7D6LW_Q8j8qb+w4lXFi0h~{0%
zsVhS0Qq$jAeyuY8tp^REkiY2GCuR9aY_&Bl9I|vUDNQv?&7a5nqT>gse|_+5^sn2=
zXn;TB!ZI2k+PPup75;i)kKC*0Rh7@Hha5^iMAvj|PBvjFq|xuW@B5E*YXw`g+a@xE
zL5dh5=06|(5f)zy0g$QjS{B{9x{%)dV<r?^>h>u_?2UH+?I+M743c9Xr@q75=O|{o
z3UllYY@S#>nQhMSuh)Vfkz41B>{;OtdmY->3%}NcesW=-2ElW7Tod@UURPR{R~<&I
z-GcCI?U`Tnlhqf8rL)J9NizNE8m<O@%h~(}f=qG{WeHh-35nC2j0G}DqAK>4WZg;#
zWrnYA;gGFC(IC0%Bmq4m{KNpN`E0I#oSo5a#4rp)SBfoKj`v@zKvF%Sy$=>$z{p(^
z!x72HK{de}MF1*q4Wue9GDd}EgLs58aDCfRi_jwZaaa7J<i@rWf02@m8*CDCEv4@<
z?5tL#BoCRyQ<>Wz;(>it)ciD}5p{IDtE=}RMZ1MWT{CUXtaJVh<5PzuKM=LAZTH2}
z+q<tWObD{%4BEPR(4Y58gv>JPXKegXH=}X?F(XbQ^+iibcipm#?QecP*B#l!%0dCH
zefJlvOK6U@8`YU{*=UVQeGIrnxO`AmhrbqZ4F}FXJh7x3Og0Q7`X<}F#1+jr>>mCQ
zLM9Tx?L-inYeP%3fLkFxLY4cbq(4)d3l6!(Hw*FcDj9P!UJXST&-#`4WSm5zz|$%b
z#FzianTc!$Y$S*kgg%eIrj{SEXz%}6w3Y1F;Ek@v8`T*4F<`ruK9HA#+0nSl6R~}C
zOh}Lz&~wrdM=jJ28@3nm$a@hW1PzM0c6gA8vY&BkS85cUh}n5;v|aQ~(m*~aCK+8!
z;sG}z9{F~aeo=M?Ne+WB5d4x10^$FEY_pE1IczH9z2!u?915dpY32$C10>}JN&bop
zio{H0Edcw;x$QTmXk@3wqSHNcyTo4?34iELZrxKwfO`JaJ#^Yhjbt)XH|`-C*%x1c
z<)218atg7`iQg8@e)csp6Bz`19{ThjEiiwv4jEbf%Syz59NsQJp^<x~h#ix{NVDIL
z(8y6Z<Vb+5(0^YK)QtKtg@6F{pDBbaoYLs}3w(I-yIkJiCZUmppthy#p4%<s^0x4I
z8_`JS{Yo=2*g<+io(pY6-Br?7Gw6i&%rC_uOM)ngY5hdVZnlvvMIqnS=eubC!~MNR
z&oty@8gdF|9aFcG^{ZF7mF|sQ`W)3BibG=Y-IWP|Y~T7=XZLR!hhmw?wIqj=9H};}
z_iAnv*AFWVmD-P1B6|;zF#s6@$Clx>v9+hhRAy~*jH7`~a!fJEySO^8Qb-u%phx>b
znT3bzAloGHTGLVMpNBKM?erLJ$dHWmIv?!`A_O^0I^-l3^!1BrIIkaqAe(qd#)==#
z&S+PG5Qw3_#K08r|9?!gu?J0V?rePXi7Xq1+ICtyNO(s#zz7Mh{A>>;_2Ks0s&{7|
z`@t<@(}xH2bOVo~Knev?##xzWG*!=4rxnOZieUq?Kg^C~)ab|x<Vad_((~toirMRH
z{{KosfjpN8RoWdSapMvZ3M5UuN2-TtsSAKaspQAr2wa<|$zf-?5+`?~RMKxLPH10m
z^-4DUp@~jHNmm&CtyP*UMR=<$K)pU0Cdq+oQU7~a18X-N-?qji!#+1^hSeCa+06Un
zjDL7{QVEm9VC1k1c{2FD7J-Xn*Uv;u8nhiA%P-S+`Nk0;k5s#oFmJ=jOSG+4ia$i(
z_0vjFfN}07f>s9dae0L+;JERA5SJJU!L`b;Od&=3yiA{$utB?*r>>ZaB;QUHmdxQP
z+gaBDDo(*WE?Ym4tyWP#j|sqGN_xqZ+h)XK*Ub<@i*!6z(!R6_TZ>lji@qBhWZ!Ay
zowV@lA8CE$T8(_?o?jurCKKlIGt4rhTpeUW+PM~~q?@GFQgo3O$rq66PsYwQxnU59
z!B;Y{0(}3Ab?RCloyia70AWaC!|v)upaV(1BynWwk8p1#xxUJ;Th)yVe;h2zn4|`g
z<rjJEp54YNkUD|Dc;!NBbNM#%59G&sLjZ0jw9j(OJ-;}&jY`%mtQst5SVRKs%!&}w
z$oqsaSgg~@Z(S`SW$J{wyLsQUVIVRH-p%*hfE$Ied=+MrF5s&oSw~1CZ<>>v8VCC?
z?KtGnID&R2uf8co^vz=tl2*c+_&Pp`le)`yNseNdvB{3E?fv`%O&EEdE$Z4d^x@se
zO3zN-J@vdN=uy|lp5EArzZNzBcZVM3YH*@S+>^Y*IC#^)U`d2+h`v|X*DOh4;VM#H
zBx*QjxGU<v1U7k_yxZ=>xTGh%B8Dq;lDG*rMgs12b2WiRax8=Z7B;{1_ot?eO|#HQ
z4n$kS*knU&{j8Z*;_!C+EmY(abA*)%?lL+#a7{m6LK}zT9c@5WKsnYmX<&72=I+jI
zvq+i5;j$x1>KJ6yFS#qN#M4c{+tpA>H-PSZ3Y?fpEaBHU@i0d&5x<>&NIRF@hG7_p
zUP+WRp>_X@wMfCoAZ;-&y30yX65BH83vjY1tPEloD<bPLEpnz}Dzk80V2V7gzVXXI
z<J1%2DmhSY(yhX#k*RAY>8q&|ykh&VX)VdZBMGz+f}m23x+`q|uAnK|QLnV3D4ZKT
z?jpXGIUs;L{<spIz@%<YaLS2_OV*hnXv$NfvaNFPC=Xs@|LzS<nZO;S8%>HdKR?<3
zu3eHHcaLahpa~oPVtT}TcGsE|r<0t&ecyp7oYdkf=pt{mrNI79(3H}*T#880(_ztk
zk>Z-=DvC@(F3CGjKUqRk{*aZ?d%BU8p`s}_P8X@rYN=ibA3mH?v`->5$mUKUPp<Tk
zK=G8jR22Kb3l_8>Zz&MI$yujdOcH7b9V5dsRib;6gEtVX>{#Re5sr8A>;8Z4X%f7d
zFnWIC#XULl{0nCmd?g;Gmx6gZQRBu~n2mjJzFqe*0S<=WlZauj=iC{{4Cp}{9@Z_s
z60Op^Y3iBg>K4ITc93&5VKJyZ`W3JK;OxwC7=~dW_$BKgDgOUs35@K>unQXLQV}U+
ziN|twM_Ovd3r(j&-lzt=wq-UADlKJJ?>IBYz^Y)>IXnc{3s8&>`Z)Z3HK1{2>V8YZ
zhe=e4^`bAZwymn8!c-S_NX^%*Zk(*~P(O{eo}jx@{baaKniN@cY9-v@0mo6w?+w?<
zw#mX$^-em&GhRee@;xppF)WL?Ojdm=8Co`cZ(3|KRMu1K{>fU;NZJ01#OjT0t1)0F
zdcwcI%BLxhy8+hkSwGn#hMKPACL3c**Ht-9kTVPA@sagIaKX7Mab~z@(2k?mS0$rM
zWvOv&k$|epR-bTSt{xjNDJ(2_@o9B+3Cxwn{?31jL!F9cUPnS~qI9==V1b7!FT6ej
z-~ict=SvZ3px4)KqM=eE&o-~7Lq6)(u%?!#dSEB<%5q0dgm;ZBuVy7{TW9QLusTw^
zyM^|qvEJzsDz{KCBLSCkL?X$kQOBs&ZamJ=65;!goY)~Jo>^|WYTztQCZi!}H;p~M
zmL<o{*_%upV-qq!XEVIt59EilGs<xogn{Ul)`m>r{ukRS+If!JmE88PUlt;WVvqgi
zpGeLwVK~+leuNp0(Q6+<v=k67csH>&c)9HNX}v@`?WXl%B+NnZv84gN7y~-`ZwJja
zM$rnK>yU-(Xhm>Yw47ENMYE8Glkl@|rxBBroAOyMMit8yyS?9pX1VC_UBE>}1Is&+
z%2ah@&x$pp%B;OTPGvj^(sw6%GtA4L3a>JrycvA?_681lRqVP*)^~Uj&NM3KPiVX5
zr&|$JmM(+d)u4Gb&SKxSsk5SV`3(o>=L=n4$?RFOCeJSg?o~6}emG?f2kY51bn-_x
zN54;579oHX+)(M>jO-2iR4`YrIWEj#Uim5_b&+6Sde%=1VEJ-^;qj~A@3L0qgu4%-
ztW~u}ABjsGK!D>gLA`eW*>Ihl)Z(IM=%KN-PcI=~q7?ecJeGS8HO_uT9B$tx0sjhD
zm!6<4q)Te?;e2=G%`CJ%k4#m*f^PvIyaCV^NY~qf4g&2D0>R-15hE0o@odQT%h(y@
zI1Ixu@Jq5K)6V}tw%r9dDN<n7TTh15qLw3y!++MXOW1d1tpLj9R^G|BZ6<4$$9Kv@
zfC42cT9%d)=%pJJCIep<hQ?6;SR|G~hY^Tj;*{&^%Qk8yGYhZV>IJYSfbsMzU8JZ{
zxAD@UF=d~@qPq1Q{DvZLaIjK;&SIt{&1D|@MCQ5p>$eSkp;!hkQJ;<xyb47BYzg^>
zSqdU1CSIZZVn>BoG5E7_Pg<~V+8H?ErYvw{1x&51Ggh^|03ld1OHt*w+_hb`ceE0k
z>K1i;l%Rdpfq(Qx6+yAYn436rbGrWLY6r7a^h|&ttmis)S`AfpRW9;^0rLech4xn?
zZE_8~hc0VXx2D?~g|$AqB~vbJJMb|4Mn`lj<+FqH`h-W*dzw8RSe7j7&2o(O5Myr7
zPtk%D$k()~{(G{e>bK;x+w(8?@M_S=9sLWA^~&R$?Q!*27&LvN`X?hf;R(_DLuY-P
zoFKGHL3B!hPHva9GX}Cyx#Gt9xh5%ZtXu2umW4_s(}r#<?`g#Fc^hB<q3qmp9EM>S
zc%}FyEBC+H1}!)W8WimQ<)=nar>-K3!><eV2XLTF`AtN|SL%pcNeoQVCg<CZ+0h=~
znGkl@f}G$fUJcMI4F_FUwgez+vQkuUIV`;xk$&UI!A3QEKbo%rZ?#=#`2GzlWh#ni
zg0F~;n=-AM8v)><48t0I8dLPr<$+~E)+FrPx%xBrXxZ6^*eLOwBnbs4HTtqWDk3&V
zH{8mla<Zmi`?AtmRMsRdj#1cpi8<5fu!MBV6mcjA{3G2_ESnM=H&-R#!nq%=%CwM=
zK&5Q5uwGXblx_WErTD(m_4%Zju)mdxo5VBP4>Z^@f6j)9O{=7G26;*TnKKrZH7N)(
z&9cqZ!(MijGD@gi$kcj{^rzIViz&#N><Fj3?uYq)e<~&RoP{&H108{;d)R@@NchEU
zK6vo9NeEm1D^g8@l$#hUQ)klj)}xR}nUl9t8UUfDYYu-*k}-MEYdMH4Xiy`XWf+7s
z%2O{mr#b*9yEZJ5Hxlbvl31Zu+d-vmS2;fz*aKtMMlrvw^2gbk<wgtwLG(&&?xyd5
zv9Y4mV<JUUPX7FbzydF|{yqxCBy)*>%%y-v$a3U_O`ePo1dl<Y>qOLj;WwxI`azp-
zh?HE3AEPyzm>XN#!_oLD-&eN~VYWZ44rQQz{pM_^Vdw}Q?4~{)le8z$!!QyLd~QD{
zn)qm|oLb#j6d#BGB(42nq)D^)laWMD&VAC<kr@k;im=}!*-pa4MF2ik9EeoX;*p7^
zvJFD8^sHUzx|bJrXFI~~iHN#b9X(|hl1%ZFvy0=3F56-BBf%*@C-!&&+XIt!q%&dR
zjl@)0o!GI0$L;XAHfJ>9C#%rW(^@lhg4ed^F3EN6BHr$+0+v8WyZuNi2o?xjy5B|d
zfPV#~$jL2myQEGieQmF1?ItN^GWD`0NBaUv4sSe85?yH-`4KuJCfFyTq=?CHe|^XM
z{dL}g>KjW*CB$Uvk82Gg^)NBt1Nqe<E1|Qj#3^U*#34Pn-$be@FzCLzXwls?g!=mw
z!Z#8UpJdLXn;L#fZ0*G%p^}APiEHPJu`|n&7=(f7l@h=d-2Y+|MX48Q`lE7ywwlER
zT#NIByH$uyVkbAiNu!y}RMZKr8~vKzW>W}YDrX6j%Hnuqy43-JvbIM^Di3<Zmoe8T
zW`AO)NT4_K_}{p&;q*8%5m$|J36Jh>l)GRC&J_tSGA`K{5(u7?b%G{l6{Czx7T;Yy
zyTdB>nO!VpR1%=HsB#fUS!^J@UeTKPLb2WxAnr(vUSGwEcM)pZY+<HXP6?v~_44GD
zyw){Nk1<KPDyhw|AQs1EHz3)!J#6Nn&Dih;y4`V8q=xmJ3GWz2jJAQucODtGfpk%)
ziqP1KSE9tNh?Melsr3Gp6AfekX!9U!UY9*u2L4=+M*dE;NO2KT%Cq+Ge{x^1FUgP1
z>!L=o4tP$ans#10s(>bzVe5aG0WjN#l>?eQd7Aj$ZoAO6A}TFpl!#SK!9L+#wut}8
zsANYRbPcB%m>5`&M1k8R87r3&<aWhAvjUW)l#CNrQL-6vxj-aqfJk`@_2TlU50UCu
zwd}{_t2I`8N-cksom-B>Fbo5)RNIne-Tz`+1j`Yyk1F}=m*4<#V_6*XQzcZ~#NPWv
zqt2%FR@V|1zj9Q7p04ziyGs5rRNTqrHV6n#0)qP&+w%XXd#{OMV!tMbf-l=)^m}6w
zHQ%2{yu_~Rw)m42Zr)yz2RV};s`UAZ;Ya`_DgN%=CcWFujtzz~htc~Pm8$n^H!Te1
z$uh4N4gjTe)$A&XFLT-8_<5D@AkG#2_m-SV$VbP)K8CDb<Hi?>spJb;0v4w4UmTH7
zzotYgp-L_x*`6GcM++7N3}qBp0A3PFSYZEj#Zc-l!9em2B;UO6OZWVvl2OSYR9ZhZ
zMQ1(N6a|Ax&7=}<?k91)p}{0|22I4EiMX<UyF$uTko#~ztDdBd?C*be!3m`4C2u5T
z=<av!#>Q9>J@+hXM)Sscln|ohQF05s<X^gWt49dUBi91uB#PPa3bpL_hvt!$pv;_&
z)QKy>u&X0#Qh&B~0D&a_J1z1YK}ZPvd_@gn&ABIbLtl)YQIf<U2t==B5C!gkvH3|q
zr?NXmE?`Y`1hpUZ?~!1n92*{IyB4LqeO9BzYbBG7@VC!X^3_lF{@Vk`DGhg+wEh|q
z@uZ09@Vwqb#6f>o({03^PjitiF-HGsm??m5+Ci;o&bL}5Eu==KE^Vc8O2b^EEpG_a
z$i#OfVZT$G&3oD|sG2N;w6=P3`>XnsmgLA(R)e!%HV={7#@WOG=SY9rwWa&otUjlq
zM#>vL^`uoiME7WGB!`ipSp{61U05IXnTUGHe>&LThpu_|=jldDA_=~Zba+%;>(?G1
zzKz!qr)<a2+54waNs@3M^Ax0z)ArThjPaSYqL%|X4YkdyRojA6$<npP%EvPt<!*_F
zkSb}#3qnD)(1vBbh)7Z;r=v%?LI0_6XL`Tcq)IM{5sL}mjtkBn{ZHBiNqwAefF#4?
zXZO<-;C4Djq@L^(mN-XS<Q5VoLus43me|LKtsMmu)dD0dSaRpD)FMPl!Q^DwCd)Q$
zy++b<V56#(bek$0rpn((k`HBPgX|y(1K}$HL0Rs9vDdNgN1yF9_5fy-VIpMzzEx^(
zenl8(blT(*VwP13Dpf?T?dn$)xw2e^@t?iM&ZzjO9Q3~PkqYG24Lri&)+i9}X4+6>
zKr%WJZ+(XdP$1my`8tgcm4Zt1he~vBoYZ<-BtV?hN?r-CDdL^iWo!5xa3jD@l|5b-
z%>j3};2Mw)re$FAAAyrJT{=pnr(B_!bZe?>y)AX!O8P5M1#&N!F{$=th@G}?)z!Y)
z0E}B5G@2X32(2XKCSU)@7RbtL{#`g2`@?#J;JW)fab)mhl|Up3QLShIww2E|@^8}>
zB*mipEO~6m$X{uGc%=$RS^-J3AAt->z77-n8kNr5!$bi|K95@mTZRZC#*&d+jL49r
zh?-r>G_d5z9U){y5{~onkV$~dlJe%=`dd&F(K9~<HHqL!4-`k+FKHMv<+h6CNmEjW
zmEZ#x)Z8ajh$Mw_Lnt>8r+3|0X`f1bD;?IhV!ZKqp|oX_J!!Jsu+JPuY%$M2<R52e
zfEzIg1Hmt0V8Q(VV<)w@lU9n(X+L1)bR-ydJ^P^ya-<u;y!ahDkCQnQLGmUkZmy0U
zsl3@v3zBd~`{ij6lVrQDLq9^STJu62f?In^V@r}cDZltL>>{0UU|`o>1ahSKWD`3S
z;_t5mRnu~$;FJka+4{aA8t)j1s?x?Lmp3-KhE1+s15A=RR^eQfNuyxO56DGzwY@O}
zE<+o6v}B(qa^&{D7TcDs*g=Bns4J1G%C!Av+Wv2q-mBYgjdT8yg^?B{)fx&ZtYHM8
z)l17>T9dR{BMhbq2DW>drkK_vy`6~(S*!>uVTU<!j{L4NIIcZ<781)EmVe98t7Fx8
zuoA69s(BD`4Yv*p57MrIkO|8b*FP=a7QoY9&c>x>$cfv>BBVT~p?XiW1SyZ8$csmf
zD&<Bd{MzK+@_B8KRq=%3>dpg&Ho2tFjQU4i1S#h9kPR33zqaZpf*>`iG+|MZ#MSD4
z7>MhSykfucG29G&B^OtfI5kdAjf@S=O%(Snu;<0t8SOd<!!Y!hR@x@v|9|YF37=>~
zSKb>>6)S@}v15O(RLp#n!=WxjBbmb!M<oJsEV;g{AxyL|5h@?WP(jrwbamC5yddbJ
zhQ~9VHA!sIYZ1y+%#L^<%Wz~rJ7%@-r!eomcPnAmFtL+VCA&`z5!CRYkF3e+czB$g
z5usjJ{+{@c@Ab$Vs!lHQ$S>mml_oK`*OmQBiik`pwG*K>eYSU4hg+w<83c-}?r0s;
zuOo;p^-#{vi5sN5+tXS^WB^3r{pLAgA}q;P;vx6Q&U6tuGO`m(EPNCb8B!tzA+d-n
z{h(HfiA;s4r!3N9NjsF`ky>`guW*1=lYI&oAJbz{@sJ_#i0?-Tid39_8Jy)gA*E&7
z9awpI#E*9?rqZ{9?TtpDG=3=fpdtBe<CB^_W@R<nm1wjPS0-NfDG!2QdZHpBZ*J@T
z_!+Kz$z>%^n-g8|kc`B(L3uZOJT9)|`?sx)8k$|&J|C>`ZcP<4M{**)lE_lO-{K*!
z>T^9R+8qp_gukapZo-J4ViW!tI~N>=VGxF1DGdpP`(JF6CLU8a$-O|7wlp6b+xKw_
z65-rdZ+j*7-8yCd9L^*IMsxQqgug_JqEGRVQFWB;*tLBOJsps~^%E=MaM?$H`(h#2
zAk%l3Rl0A|H$p>Lh$9II|NUa2X}Uwy<oEq^BCR1HQX~CI7T*F4rz^sX5xHEWA~?3<
zu{5oCx@kqRo~=(1MM8Sutrp%-heNKUSWi2)W}BJh-OMEN=sA_=AKC8Swas4=sTmQZ
zkzWQY#+=r8zLGQ(Srxu=g0Nshpi^oRCh}?%g3)N5KlbWLm`LMr)1qBJn0CsRmTV?+
zb~|J7B6K1@*aZ^n)>;Rw*h6!?DAV*fizWgbjR^A~spwsnE=St;KJ?icsB}h4#xG$Z
zjU*Q%-1%cI@p(2~0Rg*Kc&)FlCG2sAeoIK&kyu;?I?C-Pq~a&Zn%r3Kc1(C+Yqun$
zmDsip;}&T1PjtDgZ{(4q@#v0mC~?FZ@-~skBMY90YOxJKGKp?wagaSqoh4#3%6(0G
zF?Mb_4#OZ6-BNA9nEh{TMpZdf>c`CnP-4X~=DvQbIL?ufP(hAyS+nzCrTMZOUs+)F
zYZ)QPlFnM7kXY?H{zzdHT%LNR69@_u5=>v{x&JTDdbK+YBqv0(iFUEb2sFKO8-^q#
z_Mq2*AXWNz3kF#SuI>S+Ym>EmBt5RcAd_)fHaqsx<lIdCOf=oyP)?<Nn;+}PbtRha
z#tuE2uHoe7gbppNMj@SGSBGpDRg9D6Frf&WG{VB2L%?UNNZ_vsoCNj#)O-^fFx?NS
zkFE`518pmMZhxROq^2U&9z)_D;q4x~2YK<SwO@rovd>CZDVo!AH6BroM|wNK8*bvq
z2`=99a#C2f#^Er5XCFCGn|>tdBTkwVrp;X7eCe;!aN222LwHj*g10+5rKo@;i9lYk
z|35kH@3)f<uw{g)q9RG75n!jhq=2{vl63U{_<wm5z>Xf`7WS=UlM7AGo&t&W14mM2
z(&8Uf8U6?z7xL=IRUGaJk=3^GN9k5_>#=kJMNVMOYa_AWMUL0k-v6WQ+;SX-K`6SH
zSwR8@oBeNWMx);2s8L1w*DuR$Y*M(d4=cfJRkd|9Rof*#%RF0!O%0U4mnazB+LFuK
zT<u)4kVv}SWOfF`Wj)4KV;jknx}auh6Vm^a7`m0zREDhIEad%W5ybdBSm`d2bW#^w
z4q4tah-&PB_xmY`%PDB<Hm0qYJ)v&>CV;7gO<n>k0q&#7)9y)xg+vm2gwu@(CJh9a
zuYM(5(s<{NAcQNRCHJ=lr6m4MuOvTvCHXymb^<Eh@sy&8bBKhVv)@yEZU=+-`WZ*R
zC(<S-;$7f(?wvolcL0^iFb7aDA<L|@ZwOFIdSG(SFP;D}7X2x}1W={GiNH1R&bIXK
zs7a+a*h)m8M!{@t5(|`aQ`|+CvW201_HBH^|5KZ*hc=G-Vi~7n!sU#SiSN;J|HV|l
zc{$lOTSDR9JMI@MNp&YBWC8p3^TBW;^WAUjyo46-j(PMO(z&i}+ao&JOd#rY^eYLT
z)O>0omMN(F)!z>iCi%O?j3Y7b`1@o(zl@!MZNxAP16PV{$FlZctU&ra6)g&80pXK;
z99yJ#rVxNhfOk474f^lt8+gzq$)$_LxRnZ$jI`$8N-{~vf0~dSX)QmIIj$0c+jpDo
zIlXl=(BEw&%5ylIVghVy^L$Z>Bq=#S$4Nr>wf<*VV|$@ek^=nk-wyn<-<9mrmid3B
z4C2jRe7lpBG=-$;$`&)*zNe7g3Iy%msWbou{D4bIq)ffGsXcCKYNPzw=Cr*PFDV(9
z;&0k-BSVt=;<T+c(BfTt%=fO6PLe}EXu)(|FrBy0$*zOBwXj<jc1uycZ=WSmjg~xw
zS^=%!fk@>$C8z0R<dRDeim7;$<BbI+i89FB4dw_U7NA4Fk}xVcub%$65d#*L{IjdS
zOtIPWV$sF5S62;BW#nqqZ-L^?-W{~$VDgfoq=kv+!E?AufIvtliEfxHDPzA_1CT01
z17#8L;37b}`n@|Tu0KdgLFR(~nYSm`m!!&;hVRC>b=NffIw`4gOY;T<ap1XnT5T0<
zU>+PT(|vuk(=X1>1vg?42BKFoHW=mp7wf9Qk0{%AHobsFB8M2}cbeX+N;Ek6G(RAD
z{pfm42Q;OkyY}D`ug1wK4JFdRDV^gRj!7NAG_3|$88oMX%Z^?mLz!gQrl>(_8>hS|
z9g2ywL$sxdTN*g!oS67vy?M!)RU2lSp>;=eht|DUJH_$A!?A}Ch*)*RacrTr^IDp1
zW2rhU1vU;*pr=ddB+cgg?GnV^n2^KNpu0Sv@BRyQ*O`EMGB+y?!Q`J_)f)CrLoi7u
zdmz3W9lClq`JT35^3nzN9EwkCes@lJb&=Cg<bo*K)HfC3_ccN6{b)^lP9Yr>nh><L
zCSm3@Aj`pLcM?yWnz3rCN(nN6!$@K=GRK2Th~7!S&FwB*UC@WiEfdHR8pZHBUA&4X
zA@91M%7>>wre>uLYv}NsxoiSJ%d4MT+>^p%xcq<tEpfhIN#9QOSlffD<QSGi&6=2A
zPiA`k!T~K~?(M1l>*@M?rTve3RH??4Q@#5|*}33I48kz<O68M4?|-qaR^yjZN3-r8
zps3JLNbK0ZP>lMyW1@MxwhaP2Cf`$*yeAs7JHR=Qj*BW?##l4I-tJM#l1DFKM_2Ji
zXLt{)OwIlZFq(WfV;TRqP|0H)-<5P`m*w#6+aAGmQZ{%{txEfN7e1JsfXmQX9*g2I
zv@;t^1I9_Yd}GHYJa*ZSCd9JTZ{%4Oo7QPRC8&Z@Jx`gH?Y=3(`5hv#a*DQ=>Q!80
zAfNkSjb&CQlz9te-ld#xciEt0VcaB!c9z|VpOh}%0bM0JQrD$++w9j8UYYRUTa+5~
zLKnvFdcl>T@EnkY@;Dz1qfk~FAB8NJWxZV>`X(g>2qj=t*?pgWdFI!hwQEoK*NL0l
z5iVCN&Kk!aK@(;Paxih!Evtbj*>J{I@=vyl=crsG6?#KOfo4~903MBWeoz&u1`o(3
zUN+~7<r3hj6c@p(<c6H~HX2A2lLRg$fr+Zb>OSMbTyhJ0nUU0$m2u7R(IkZO^;CO3
zb&d2x*_q`?2*W`1N=fVlbN`DCYE8Y+J!%#6$CpJm@RnDMJ$~QaS>nn9S~ZQkonRAQ
z-675r?STRe1}NtsJrRfZMkiHxRH~<Pf@8{3=IKW#DJM2T0O4EoV`uoK+oCs`@D$4-
zlW;P9IH>|<CYvC|mbspw9+aJMYLtMXm0&KE)2sZ#0dj@sIN+V;>Zs?YUARRs*(rB-
zdD_vz%=v#d_bAa~-rB%7E#~1vz=cwo4vI=0ifa4>&36-W`D<*!jOB;KuI9qRQbuC#
z%K=t1{jwxSL`jm8Lj$F-!vFYHoJ0&Rl_-tARfUH=8!ApFP59)v-!d(B`#^D>)ZGd+
z74jWd*x)V66*=XC78|h+{gJAM{rVrI0Ff7OC?>U&;4$qqfpVSnJKn)tk9%fTQ++aF
zI3Hd4k!tkJ^l1+Vx{`MoSO8ARf4tMz95=+Y@}IQhk7{Z!b@KJ1ng4;mg{CAF?`U)u
zPPmB=vMi8XKM~#&hkcD{Pg}L`B;TNc=hdX;EcMUuN{fG;n;*{3B{yOihM`xoZ25Qp
zi#0I9=K;Flw7XdeP{vVYks`nENEcT|S}h*X6byXmr!J5VHWqvd@Y)Nz!RarK0F<-e
zDfwVZuBOdyJ)N(o=IzM{vHxe@4nVmB%QU`e*Yt4sItf6D`Pzrk*`JOi){?W4om#E;
z*`4f~&u;&Yq@olotcP7#f9~@r@TdahOpF*C3K7F*Cx9{w+SvuOlSYR$iY-bAx(;OA
zMn@+E`^2&A%YvY5VhM%`b4_fD)0a4QDN|>>4%RwQQ<>YpE&D6&lH)b+BB?b=A!g4n
z%puvv>b|>0(G}hE3Y;)EaDMkElU>TxRq(ZWJVawrOqaF2ej;hO4Im6FK!DP+7w;%A
z0!4S3%<5JNGP9G3xcFp299UXa6PDuYPA6c5@X3VG(IJ@45L?9)l|~4kyxF~SdX+re
zo2QE;?*wRyDkp+~{Ma|{5+(l`f+fOQ>av(r;4K-jCa(&6Fg~8nVf2XvyX1N~EV{SO
zSkn<gM_gnQCGOCAV5?%#AAtiG2|hQwrtOEZbHQ;Kgn{UlVhG0E|6;3dGmogPG&w-6
z1`>lkA4`rILy^Lc;LAWnSumc9NJT%v&U3uxl79TB8^>IST(^*UVC8ylcgeM%4$5n@
zE6$9`-|Hk4a6E{#9WRL_(rerlVh<uQ)=3TzZ79+_8g|8}UvZ|Dp~)@ehIH|4eG=f3
zv7MM9P3Y=nh4~pmCEHTMJ@a5zne2wr7pM`;2Ue>jQ(teTB2^vs*&1GIcqxI~RWQ-X
zClpXg9dErTns?W|Td*wzO5O|<RaQV!@+$-&$)=rP?h|rRSqIh(0h089R*|<EGhy9^
zG6Y9nzk26M1iAYN@ZW#SkN5G$FE2G-`jgF96HvX<rM+JQ>pZ_a11Pd5qx002?C{I`
z>w@VbExHpD2rq!G{&WOuMn{FSCm&#1cwpxlX>$k)%E{?AlY)XW*P7{MprCwrH2xzM
zY*p!=#;_ch=s&WytQ4*@rC(=?i=->}l(2tNP|Q^rd{|~m^zm(|B%MlwPtrUKBmgCq
z+6H!<13%8$9=rq-N%kw`A7kg1>o5od(Jf_+d1U_^yH!#jq*PavzkZ=W2{E?kjIj0!
zTsCe)FF(2UoZQ#%BcMIqBl*8>bEg)|1P7%y!JB15Ov(K;xSz({)?jImlLW+#WNmB-
zB=UeY{WIYWT*Qg*m{*e;694c)<rY&ik~X`dlU%gLJXMvl>42z$t=oA*R5|?YaCfTu
z;_dWy#S_>lT0O?lwwn~>b6_~UznM0hs|3(f%hX}m^)cU<OoZJeUDTOea~fMbZQV>%
zDm9_jSH`me#BB0goJytWn-lPAQ8^EL(N))zT7Plnzu$wv+QF|lmXkdmc3N=?KP_7}
zQ`IR0Ywyplp7^PvT}?l?io6E^(!eY#E0y#4We)<7uR#Kaly2asoR&g1M4d9q-XoJp
zcaZYxK19KDGA40cC)q(KpHJwiZ**WCDM-cQC~o9Rf24G*o=Q(O*C4j6?*5fNb+QYU
zrGiS#rv^#JS0m{cK~wQ}9`sHg!@hMOUq#|mAmp&s>CNAGNBduKu%F2*4u&XI0_dpL
z$t>PebHe&R#?I`9VHk#?D_Qat?Y~$LfX_htK`&smiQ_0D#rIi8Ruk#M@Pen#@9B?k
z$(5z+Q@T87KTdy=NUJP07Dm&%a)Llz7cB~@mH%MIB37$Szl@rJ5_3zopt=Wgu8>s8
zujvFU_uc8?SUXt2n*=qgy1VrG=1HR~kSY7acsPF24kzx@sdg(dsldp37A&4PgGT<Z
z>B!cjItcc_R^ppn8$|E}LY)uF!!69RJ9^`9g~pU;v`?*)uMyv^v~kMH4HCp3^n%DR
z{C(4LJvYpff`GOd#=O`_Y-~<OmA4TR10t-6BM>V4Jo64rPHaj^|Mr(qS*o~ca~I5_
zZoMEOp>n{RdzZE({gOR9e3JvE5<O@X*_v?cclQlyl3qvD@38So7$`QpXa!2;nWWa!
zhIabc%()d0_7Va}TVhnm=N4JC0_G%9&q>zvyFQU>wlD4+8jf632_PtmoXU#=Njl|(
z@3C7Wf4Gr9?4P)T?vA+(h3aTsS1ZNuznhRkHchjumGXb3hJB))X0R=5>P6YP<RA>g
zK=exWq)D3lUkn7DXQ3iocC0KMsjcJr*`?e5Rf)l3KfKi!(}l?FWX~M16g@#~^<-p#
za(ejBEM?}RBS!si#zo5o!>GZ*dgbd@l~O_pD>RcVOfRl;)Ss2S4V<8pWKAKuXeBKq
z3{FmelL)R{erC($t0BNi++pVO_I`3>o2BdE&<2UyLue;jV=OeitK_>0aFSd5^A{Xd
zgs-Zs8HcuZwTx%$mP*CaGJYuICOe{{j;LrND(ZE2{YRyS)y$nr<5CIVF}0qR>hApF
zhS7Z*>I)s^-E%s?l)kLE40hjGamg5^(*Guc6K|Y&sd!Lui(GN3gb9jD6O@y){n;HZ
zK>~okv367F(w)r3lvewrJ4O?CxAV5#*FNt?&z|wpRRqOe1B(KpM0=&MQOH=(`fKil
z3{mcHrps%BV}aKv6#8<cRDzVgcqweqs2JGKl`3%oQ+~Iw@Mo^{#Xa5c-zjFMb9j}n
z6-nnPkI5({-sqj&hptS<`FZntFm?vX4udcZy%HFM;r<u<ooV#acJY;6SDqv-4OsHi
zyU_ImFTs^dzW{;}ypS8rO>UHhttS*jbdO~llM#1|ghEWb>Tv3@T(3g;&A>vV?CmK5
zYXuTzfkCMQgMQN@OJ8YmR;CiTv6^6z{7XO@WiK!&1*^Yg#O>w(x+POCuBl3U?w#5S
zygvDdjj#J)5GM`0gA28g&lOBe7HAfdFhB0jy9`4@<p(QlAX5)yYP&*inKDRO7z~Dw
zc>c{vrd--lu62G=Xv(iOAg?5c^u`QE(}r^TE=NeB+%mp`o4abi@ep>?H8@W~zypPQ
zHSx#Q#CMhICpl;mskt&qXZQO+36wVqS%$!Q^SQTwLU>*ai5g3P2hC}*h1VR)+po--
zTjrZVvo*^eCj!*#RI|O8jyS#4C+*&-7KwDz&~C8cO*tO-u#+>9kOEamqj)Qb36AdX
z4aX}}K>^||C*xext`f9K29$G2CP^@n^E|jF(nFNgQH;G+Bk!^KcYwsnpz#(*Ij=cM
z3!Z-EB2I!GjDtcw^}enCZx`T?u`|eF7=(e~mud%y`TxfnCG1f3vbptSg;XNo_0B$(
zCeI{KZvhLfooQt|W+`zp6G(6J=}vWDuU~e@-QpyxYXIYVfYuHFOvxO*Od?a??*jB!
zzWbVhUMHET%m%IMk8j1Vj{J}l8s@oyxVR~-Ni-!-mX4*R&2owwH*M=BfxKc{4t&c2
zc<k^xP)eGN&O7P@XdEz>UjA(ZGVb#qtGf`iuduo++4Tb|_!;QbZh7EZIQ;)c8YRg_
zD{<$s2`4&*-J6gm_v((ZgWktmtnO8bOQnt!*9!-+ty9jJ{!}4pay4#l^nv81foyiS
zid?1ke_P5ZGLmB71^wzet*QnriYzGta?7>_Qwn7}G!if-xoxG9fYT3B=iu}mV1n>w
zZI4g-Q`5ki6R1@()kkSSIHtc<N~lagUn{Zo$^U$vLcemE@7ot(+&B@a2{riGF~J1;
z8Yh@OTvbqOMz<Puf_)tt$x9O4uD^r1F6%x^>6LBhQrM=PIc;i4_{M{~N~8)W>89$Q
zFW=Cyd_%4h&Kx2D1`z<{QdRd&RIsl<&-CM9f@n>pFKK6h+b|45(JK|Gv2*{6Eo=NA
zmAZ*Vy8ud~+JXP!@p~ll6hJy`xTP&Wqpb>YELZ+74tF^1{Rwj_@jU)efyuDkUnARJ
zBSq2|swbHED&`cjXNkHc#m@ejwEJCsW?9|+N$*Uwqkg`SPNeLcDU~y0kg=cjb%ra^
zPdB&o;#odnk+$h2mgQU81he&+bOvR64XnDt)$yX)%7Gl8-v&Y#2wjlPduCV!;<dZ=
zs^=={8?(W|BF5uJB;c>?rw%oVSZLnUqOUQSt^661>o+3V$1@q(oaLQJG*CH_o`u?%
z785Nq&I|s^`ktsr_3QdOuHdg(?}-g%@U&)Y%lR=r-gvFN2e;e9g!kUxw|%E)vcs|@
z2}Caqxr@W5GZX^Xe_#S7UeV`GvM$ZJQWzT;OrWmlkFU(j^G4Iuf9m{ZvV*hl6$%W@
zvFKvgY_w16%${NwOjm*v-!ZS=^LZnZa+HCc1{}dJj?=4RZEJ&&ftf&d=Hp;aQ>SkB
zkew(4^MGwT!R4PP>5H>-O_C6Vf$){Y0D=2oY-?uek6GqNTYG^NDk|ypW7*|Tzoy3j
zm$-zD?kW<fdBd(iWSMk6|1;SPM3y);HbyC#uwh=zHdkq!l?pLMwLoC(&EKc_Z6QjK
z4_b!zb(%_uEI%>60p`qoYQEBrUjV_>SEc5Mtkpg{>|f_eV`!Soy!i~SOdMsZ8dl2q
z`BxOI*5v$#b?C*09NpJx_M)DwrXTh=O|M5UI9U2B%I}-o90w8v{@5k`lNt~+l3u>h
z%kvGfqvk04<Sk;R-c||pBmIKz>q`$uYqG2)W5IQ<5{DA9@<>eU8~98Mdj+b>z%DeT
zfT)lTAJ9(Y#?6=qSI6E((tF?bcoW;|RiC0e#tzECI_$xHY6o|@FppoRYrhmvyD2rd
zOhxx3vcU=})UA{~G_~ydY1gTCDKTfwu;j%co08@fEe+CR3!n!UuSK)31#jF7-dI3~
zm3V~)mVfdMp`6Nx$fq~<(7-ZvB267gvu_gY<yW+JHn<W4)Wq=Vb^iUK>|AmihG8Ij
zC5dCv;r%bxpe-MZroc42tO!c6WLfibW%Qep+smWc^2fUVrzVoJ9V`;LXp(a6GwPp}
z`ljT{VTcm^6{E`YJt4-KWk#H!CLzn7*oC4}i%LPI?n&WaL>m6<gVA9^2`6`3+*>Fr
zfBI_U*2aCAEWRKVmDOgQQ8(f)bSB>RU)SU;2;o}2<SZP&NKjNh&}K$pjEUjn@iUI1
zvM^U?bUHiV=xGq03q*$y7)WBb{EQ<SZY$b=j}z6{{=a(4mrCOyb~bpk-*5-D#Qkd#
zP`nzGmA4=esO29$y*aw3!uErS&FT$X)ZQ#><dlmO7jX@Hk=fyoZWzC=-n)k^e2Y*T
zPZm}qmRwMhb^n&bvKp^EHKv${LWOgHJ(DzC`4!pynM>EA6OgL%doEJS)eQx69h;CV
ze<vaEN_0@W66d%6YR`uy!Rm~SNpgP&L$HaIu`k~fSPs#o_}V>xjVXfv{}Bt5xrjDv
zvp`%Gu*$^xIr-|V@8|J@vva|17zBdol`y+}eE*BJYMF-=ry9}=tiXx!F7x|E|6Qf)
zmAu~epmk1OkB)`lg#bd%0~NJ_-x#*@YDeiJb?1ICj|ie{y47k>9>kxSwfkoy^<+R*
zRT*`V%{P$3Cih~JDiilnUuHb^L|)8fPxd4eD*5Ko<o!Vzd`r}%H*6jSv$W!mF#(cY
z#3I14fa8!}UKF^zLYEcAMXpEwql0iV3m3GA0u!dY7X=3Xu1S(55l?yJd~*BSl#!1$
zbtwW8U^_jq9ReZ;BDJ!?y8gk6x_GxhM**u4PI>WttWd}q&xehC`)>Yco39(&Ct-su
zZ<(oqxoZ{T7ch8NEM2S+C{t;cN1S=&KjO^4D_wuDDMpTCE>X<-I)AL0s;-&pc>X{+
zS#|pqm2lNT9&+_BtzgI%_I|BNYF(`9zjRb-n-}XfDdnMf{8^o=M5qGUa|mam)5CWE
zMFfXbLxgN*t7a^k83a($FT`oT@I~3V;5HD#K=ev1HU{p0v8vI|W7R~O^a4m>3D}<B
za}{0JO|<*!N26L;!&&Sp_KAC+Z#>ub@O8H}mGH+iRU1&7NLGJ^Ke>f;Z)5MQN;vlE
z@@ydt_K1bnh1KM3<M5rKMBwXs!PGc>+5f0z0$<kv!6M>s;S;=;uVwbJ2BbdMB%_u(
z^yN)cLg?cbS!2tJu?GKHAEpt=CYc#a2XyzOuTsQMFgHOVJOIczMc}qoS_*X>O+uN`
zV6|aUG=H%^x022^ts>6OG%sPb_etR7GkNxya+A;-{-?!TuE!8;l@nUBha6LoBQ~7m
zsKDCwk6Jb^YhC&(L9;rb%=Q~ye+14SG{s@FqALY8MrU{hdXanQ*AIUJHFlh!GAU{f
zkXruh3r<JeR;4RsLb;#mcS%rVUMGN!1apRb^Rf|T3Dmfe6X4=dt0R`OC0nAEZ2EM)
ziM-z%5WlyVOZ;4y@<#92wSLF0DS*wMZ6S`mAt!7}iq>Q5WKRJ}lS`P&wFdiioqf9O
zN>Kg^S1A=pgW>v^pU=||W9O3NFbu=cE5#E1yZ^-|D2C5y1{h`6mC&TFEt3@aRS7e0
z6V5@K9Am&dl|m0OEIHV>vAgKgdbU1GiH=M@2J=$C&-sCR^HeIoQ(S)q*QA7|h3PK@
z*MfiCo1+{1^TvE)tM^JqCL2)*X`ZI{iFCVU4RxX>eMy$Q7j%T_WB0le0XUe|2&+l*
zSw05-RV70s<{$>P<tJpYT;C=ihs_)qO}V=R4wR^Wf0%X0`eDAY+uO)PnR%Snkgw|`
zso)1O>pBoLa3M6L$38hq$VVq#auI>z>6ZIbq98B75~i*j2c~Tpq3vW@mq@shW!=f;
zxriK@nAFsT^6{2}VT*A0pLLwJaCB`tg)Cl5pKo{DT~~5nA`b8MXe4_*{UNiD3F!c&
z6@(4eJ5kb=G&m<)9`jF4)lUVVj#OZa02)E%zW5WnL5)>{;9^*E58_We2CC$Ol=UKl
zcx=H4iM=<2u!0xBydWOYL`MT^!2}>`-(#70%mZm&Ad$Xjy?C^I-fH}ca<ZyRNv%vd
z9@uXQb8&Ea{d=$Z;p~iZBZOffdZmyIc5<^GzwJu%g0!fn`?p^f3xqhf=gk+Q+V-La
zI*^k;Y<!P83LW)8`saTIQ7-FEkzV5km6GiPz=`NJ9<kmc9g`{VdMiUAd2yFs?E`md
zUGS~+8x!r2k2d;!l2s%$z=39OqqAK>h`P!m_Zz3@sZb6LSiobI3Sgm+Os2)thomF3
zKc*50d~1TIOEE=x?nw3hhTb5iP0?&}P5EHep7B2EKlqHC?fHA@o+B{-;TgYw!2IQY
z<8^k8-agrE83p#X4{SfbFi&xU)o1<m!L~we=+jl7PDQKNS~lS@IpM%fIB=-qUNNgk
z*zpN7R(v?u!iJ^Z_;HxLGxj^$b`~$!ZRjQvQyD^QTR*#?NP<IHC#_j?QYNYIIF3$S
z5mv0&l+>n$3TB}M#5;g^=RRbWX}^1r>4B3pcr}A_cDZIzMK&L^d$WtX(2A(muPDJu
z;Z)Tok-+wzr9-rmw;KS^G*EiT#Dx)M-CtW3$!ykLB>j=td{cIAxeCKD5ZzLp*d*Qm
z#z2+k_=*b*{PBa8MopS{UaCZ%Q-?e2OZnJnG*9IlK&^@-9hNaYe(A8aEej%B75V?^
zx>9YwpR_8n1E)JkSqzr1DlO&-_?OrlyadwQ-6gt6&XR+6M5Yu6bz6Q+CkkmQ)%lzd
zd>P-HN{vYpS24vI&lE-bVwAf|!MYnS*4<>?+1(OMG8SjJ-DkMs>gLBZpShzm;nm~-
zy0;?B{Nv`jd7oH!goUreSK>O!4UV?W^?y~eZ^3SFDY7sFMwA+gaZW!^YLw_RUQ!|A
zcsaKPlatU%t|!5C2h*J%OwI--Mcj}<%_=oG_VA#KU`b9o9CQ}$tG?4FNU{br63BVT
zkiA|cK_t~gd=;m>JaQvQk~rlI!nl8`lkXGjf`vAHfMT{7k`%qJG!T7zB4py^svv+0
zf;|NS`7RPt$ZACvf-J%*{9|oAx74!lutL%br*{BMp^<UmuyAk(Y=<LHg)1SFDd@L?
zn}pWt{1gm%r|gV!9EL$4dL?7PN$-ELU0LBFC8{R<>lbPei7_+GTww~1<n%8(L)I86
zCF>{0d}2R?0b((=HVUL7;RC{*1R+6QG08Yjyd{~k0gU@9xOTfls6c$Cg9ajCMpY5{
zVLC@$(IC-{v{g}`OA1*eh~%mUB3RB?Ev_-;^e-Ec1dD?BVY3DR7N^cr6?PzN6hV6w
z*a}F%K3RT@A`lr3sRaXaExMS6NG_DXKcEoBXpkaOiMymN2=FC9;^0uBmoXDG(pq_+
zvEA@COwc)s@4|HdzfOedhK$r-?7;Ul?!Kol+)C5d_our~7QdcTMLO=zfNp_`x6!m8
zI^)#$@VkTR_DwAZRb5M;`x&{-KdK7m`#epA(s+9Vo&@bk>J~CVBQbRItT}l=|J&x;
zDiR`>y>N^e<Z&S3D6zIgz?J`Gn9R8?{~;2?lJ!J5sxDpjkl7-xT-*jiG+Y69zEmVu
z588B|MW12*+Lk?A#I^IC5E8LYd6T88@T@_QWe=y|xy<J^;*YU2z-<_YVc?gdNVJ{*
ze{8^7o`JNR@&TbqT+1dY@}m+vxFt@39dy)%ZA1%mDEAIdB{CwZ6xE)T1u<FH07My{
zis4QdeQ>$3aTWM9@N_<oDHBnXf_7Uw%_kZ4YI`_?k@x}UhB*ab+SdUHOroGL|DqE-
zP;V*6JzhkB<&0?bTM09fKwSQdyhq%BuWS$AH1T9;8&TYy$AY@+7d8`-RFW8mq6y62
zM@|rv2Tp6abDUwqY*j0_*Cr+p3%Hi!?&dODx~gwXJ7aQSQ9r<2{N*&F|4sQfV){lr
zUo%?mkqIAH{7JQvwwt)PAN|t_4>2!q+3k4dPCaV1vNA{MEy<{jF`H;j5(PcEu%6+g
zmAoYD!S$rLP;v|8mdr7*WpA~)$=c5J2zHK%lDK^|+*_lVg{!?DJvUyhXh(|w{IwE!
zTkF0oonI<lcNxH{mJ5*C$v0c`65D&*J_{B2Y+IW?(^Ge)0N{9V^<p9txx~5U62oBt
zHCo3_iOd9RWoj_|b@^B_<Ay2xaCSzy5`r)k-4YfGvj2^}$!JfF_;Sts`PBr2LVMeD
zpCX~Z7qsp|dt33>Q<{#s<U^#+0r%NidUfn^Jf?W##vAXuzLxam;$5+Htt}Firu!Wn
zmGYo2AN*w~O;D3Hf7v0pPHazSDEXhK$u5w8@6J3s8tlZd7UsuZWR1!@$tAqDQEgS=
zrP}S?SDJsbmFBNg=icv0cor7h@cBOdN`kA=UtseGp1(tIy)fj^1tGDI+Vtw?JyILq
z?~(RRsxO`d*OhB`#{3qU<jj;qaII)2C6h}}LY_QZLaRJmZ4ZnPvrakpFPq*Rt@3jJ
ziV~WY330LLNO424prf58Ja(G!gdLCE;|xwFMFMCaU7@;Gg;1GG+wf7k`UB}m<H2d@
zx22`!WXP}%(jB1pc=6F8RC<ht7zo$aCcioTOF^g{Sr))X11i-p(~-8D4d%>hm8A=&
zJXVk?>3FvuxWx*z;VT%bNHm(zVp=>wBF@LF*Vg`9+l+H=`{V3fY#WAQAi9!%q~-k=
z3*hFS9HY$%U4V&XDGqsjyq%?KjFe#BQ~AJ|ecLBAFr38t;vYOuNSr*^8$du$Wm-e6
z=~p!$M!LV%DQmTqdq|yp*YU5xZ=JJvV#DNB7_27QA*H%;BaD2l8fdcRVwD0sm1=;`
zP%xTY-$=Ae5ubWgpQ4~qY7|}hOuH`I02gC<@iA<<ueQ*F9e{me0Fw+yY9ve@<)nvy
zJpxR2*#cdkFQoX`Mv4Qc$wp-v%(*ult9K%;rq}j&DPVY4zW|yX^tvb+j9l=gdvXaj
zsW_oHOr;2$Oyoi)2i?x91k*BaJv<U*5+yJ3Zy-$fYto5UZG*uCLzLre_C=ObD3=X4
z9lZOU*I96I=O?I0<Vvo__0U|Td~Py_aH=P1YkQ7o*?y8_K>;4aw(q92$)QU>up-b!
z4f{tgrAvN^GMlCK6H7_80KSI`G=>8F2-Ef~OOqVQ9P@%=Lm0cu5+zYvZ_A3kFfYo^
z#kOG>2BIs)CUundU#w^vJ_Ux0OBNs;S&@wUKF7qh{^!IcJ8{`h*_%hrNTvw-d-Ppc
zNYX1TBdKO2Q@w*y{SSN1{0kkj?;d|-EbQ?uw>?R0$qYYfgW5sGSrYI(J`Q*m{>Zne
zXb~0NAnWwzf8me34V|WT%ZrHxBZ(mCgpoWs)biIW<R%?Ap#8i;?K3T3Bm9vM#DCP>
zeFgsuMl#VP4YVn!?vFbCGvNU)e95)0&otBW(t?v5)W~Q7LQq6eho98P_5eCqkQ<Lq
z?y30T*VRoO9P4!Q?jC+WH87%u@q)sRI@T8}PIv>iQV=F1C<$M8uI41)5^=ZmLYug=
z+o>r@%%lTR3H7uVC0Emt1euNY6b&q?<)`%4CZ6pG?g6lN$sd)0t~GZ1K%z^d#lRom
z5R$>92$D<-jl1O}gi|sJ>D^HftMFV}p@c9?-bk;WPx6w3EkCJ0N(9u-R}$*qS$>uH
zEYW4o77<SywxT8^v(@bhY`DWj{$VwKI6Jf4h+!CpUdf9V=l&P#ARRpqJU|)rFJD4z
zB(f!n<Y$<=V0WefJE}(AK{cdETG(dYFl@o-4*D<AbYg=k30dw!`pqA!|Af)Z#sP3s
zrJNaA9S58}SQwdTV7sb8<S;UJaZ(Lh+UsCs$Wel$VR<6<`47ZC3XGgkB$~BT<nh*A
zQh~4muHS4yCtU$YJ|&?n90LSq$=tCft=;aflgOq@((ZSgUy)KLwt^#P1$t`;4>W+E
zQLY0ta*L5wYXwKbbm=J@FeOn{?iY<-l%7Y||G)bacgx#5Q$?bU4O-WVi(r${|2cG|
zL~3KN&c0WtbN0p};UzKRXmk*4>T(GzvQ1W3pXKW*xB$u>540PKZxgH4M8ayQ*y`);
z#v->DY?Vu^p*<XuF&SWyjnjm-kIm}Wq_))vu*g66>BeqUB($~Hp>OxrasO>Z>9uW_
zCSb8+;9?EkO@J)votmpt2bSvAaEbQ>bV<k7&?nWKQ@xpfCn`!qwWYepNe!RZc@X??
zb_O^OgD?>MQoyi;|9|YF>+QHwPIB4@6txkB*xudwXQgeRteeN-%W`&~OtaUWHcuf5
zCV3-b^l^N!5bgxdN^A}RH9cyBn=-vMb^MSc7K+PNPH9AXYXp{wBO}~=#MNR#Ei`}w
zIBlYLot5+em@5w<8^5j%{<^3@N393f(*3>+Zr<SLEyup{9C8lZ(&jLFSIa%l>w(qJ
z35_c<0-RTET6OuPG6f|mG_Eg8*sC&Sr7}1{pd?|{U!T9N)auZGoe6YDc<GmKt%I&Y
zX>*h(kxgy}Uln-P-Pu(r_Y*A1n-(-kO?#kn6%nq8EfP)J2_lbPcY{yR2t6SSo!KZr
z_i{=irjhFavVh}(?7RmiY@NJ+vzsQ0X#i5^sEZvOlXP(!UBNc9Z`SJP#18ijHAqex
zvh76=DjrahD@X>i{H|@#*}LwZ?u3w`n<o@{2L{!05-3oT+xFY9zms=(@1PAW;cCPF
zf>}H0<mqJK4zfx44`u(`f2&L9ol0&5Hy}HXV4_$T7<ebUpa_sw)O|z!aCSyH2*e-|
zy;56BY43kAjd30(8d?4Gi|lUPE-=i)YRAKpHaVJ_IY~X-Q--`9rI~vr&Q(hAJeqG=
z9j-%7hg#Amu_;XTg)M=;^|I@bHVIvB>1prGbxH$9NSs`oL|&aGc5izxYl}z=WxgcN
zOY$O3dl|`y1f-DEvM0^0{Deo#3X@3W@l0+#s<A2(oGEtXH3=xsjdhQz*Xu~@+cm}f
z;hOa49+L2*sZAa5^R}01MKp*GQ{zp}CSYe1u$Q*yXb>GhpE|}6_l#5>-+^LDS}~jr
z)gDBOI#PeTrsUNd5VZ?;2iW!Fa}xjNQY3p<nQ6podh3G995^W{dO9=x_g`dRUY;j7
zDGx*aM~$7IJkY^DN!ZS-qk!%Ku)xa0NxCIe4|8fBJ}C8_>Ffqu{Kw9{kX|{@ktyUT
zJ6+65M!o4g;JKcjq~XL>4zd6%BLTj&1YfGMIL={W^)-!ehc0Wf>KU#;uY7@V_W1{l
zGtxl`YLsT2#f`Fa%XJupf#{Yn4-f2rW4CJS<EXuo)4zOKfN0||%$W)Oyo~V^dgU3+
z&X}F$I+d>!n68~5=uQxHU&KR{eV0P7qz`a_?C`H_*Ne12%8ZF$_4)#@3&meIRDbTh
zU^ic_^uKFhGNa{UJY?t86c&Y0**$)?lP~#|T4nQkM2MBKw^!!*hzy-po>d8|t8>fQ
zQP3UaoXW#W!F6SJOVQ)1#VyWTvs?en4vKbMzV}utI~wqcQz3v?{9f-T`MIhCBoN3@
zPuA>)@VDzq_{;)XV=YJ#k0(Ma%CA9XtRysU3k#k2o$Q)8uh1+r{pcO&^8z1nepZUs
znz(}jA3-g*2>|)dnEIz<d0H9-IoKbi0HTmB&Euw!Ic>ZnrTC3XD3`G>jeU9j)~!1e
zOq5W|g_mA5mAlo=H=x%z*j*=Z`feEm-s>Uhn-_X<294XiP+_IKEK}Tpcs#8img#&|
zI;5^2QrB-(g7n(rbvcx5FFcS|9(ZUa;(;-dDSyN!D6br8WqjFdi~lipE;$T?Kn%T7
z_?q1RVr|v>4T>rayRJ}(Xn?W(=JP8Y9>yTdG;yp*Q$pv!uI!z+&HTuOen~5(E$k3D
zob-@8aGcNtY0{dZk~Z#lJ`%-m1xz6@80T0Op<XVR1;*B75EJ9U5q?C&>-oG^ye|kY
zeCCpqP%r5UStmy7?n7M5yLl^kuTerZDehOGJuB-9^)i@|!Jq|(a!`yF>ZJ^gsd5Xu
zzSNHk#6rE4v-uG*YP90+d8%3@DM^~lxLSIFr`Bv)ytKSmFu-B;E%}@F+J>rRW9FJz
z`g6Tm2$x=t;|d!DFuis#&?17zf!WT*3NL<*R38$k*H-ZP!i#VAoY&l%AyBWKSYXFe
zF+96EQdXcqy>8Fcm>tb!4+=S;Ubm6_d8_cJjz$85DP~7|>90cDe)G&m;`D9mOr6$s
zbYWz_^UVa*>#nHt##`v%>2^YbGVqM@Syva$lk+r|NKpP=1tp#-{nLeVDZbs_;?{BH
z1l97!ol~AwoP1U&mS5mac~N#Yxe~%K48Br-Qj*^PVsC`-*V&BB+p(bn)S|?8?E6a0
zP{Y8sS@B}RSauE4KU0vm2(}40oxZ$*vBVO;<IosQ(Bks!Ny1oS^%zZ($_&a0KN_4x
zwgR&i4O5Lt@?iJ<Ns;t)omO5DEQnVO-wVK5er3jB(k40Ni_DmWvSj`Z4`bGeoc@9M
zd4s~^^D_n!UDLX&CqtBs(FqWk1Lf)RZ9H`4Moh7fdWrnGWhb*zbY)CIRO=)=FT4iI
z!yV9-^h^E3j{%!4pP!v4eNsBsfQXAGZPq=a;8qH(XExq55(%6m_hM6uu#^-UK1Y&K
z|5nr_*HL&A&n98VRaWMk7`^U-7#0tAXTi%h-kuP=UU3}i1$i0@XZ{>o|8|>|06H*^
z{9eiJ?Gjbl;VRE}T9NO+Q;DtYr4pc5V$(V4-t35ZiLVSoD6TFk%~hna4+{wwmajed
zDG3XBVw>JYG*ye=E=EuA&wPS^+)DJ6LBs}i_i-`b(?1ha3}ilBvR3@uzy7h3_V}Qh
z7#gSkTnSnl)`7lm;O&pIGs=w^gn{Ul02@5H|HWEu>xVX}YTCd3vI5zJXgq%NIxL~j
zfuH;Ql>phAhor`!aEoWY_8+3m1@^ULH|e%N1qS)L<v){trCiTMgSfzSwXzaJ@C<y3
z0YcIHTIG2u(6568!ge=Qxel(#?^k4tHzqQy*Y*c>$ZDa7p=yD(J*l+bliIhYkS4#E
zz*|*GyhF0pE`hPkv<{nA-+f~GB4hdh7v!o|4WSjl*G6j)?5`{7V=t6jQ7PM%N;7oF
z*W=8y&QYrQ%5Eh~0~mHG&UYwVm5~Qr;8<ys59KmBMA@hWVD`_;NmfaYj9T{xSl8>o
zQ0<}04OKOu$Oz^!>pQl7s3g?sU8&xqcqocNivmTlN7R)b2C6kCB*cEM1PRdV;K}z)
z*qS!|IEGleRY|yFOE|ilqfM3uW&wI78o66WkA8<Fe-ZY}eFF5_8Dkxos;v$1;dLeZ
zEv{L_Sd;>lXjURkjOloB^6eJ&IGb$V&HlSmw7~%C!RkI3JD1#sVHk*B$&5&ey8p$R
zHlC+0ijH?#309EMB<IJv1mjpp`is3n`;g@xU^z@V3mWWkTF>;iQ(rPPo(2kp49x@S
zX$DOgB}Fb@!cFdF!6*C8o|MpFC%2m*RZt)w+z!vzV*k!unTdU9T2)LRxH5253%)1*
zcf;CIG;rlHSe~M<u9Iv3JvX?MRL1KrDqC~>udH6*cnhoCkQT0B&J|Cv!)D~QpvtWh
zUL+e#Gy^|A%<iD|$9MwwC7&nAHc(~oG6-=^g6QA(C;u%e7pJALzg==ZGV~V;a$A~C
zC?z(3F>ypv+x@^lybBRAT759|5tG)`inY2h4BRK)@`4QyhJN{z&@n7dBKf<Bw+r7A
z6y6U5bL7I00<%Xij%&e{C*F?NxM(Zw=}#@Ja;ZICgLUUQ#{Rksm5vs9l^Rbg;XmyM
z_hQ!_v^p~W%|4@`?+6PGgErLzdz-@F=E*Z5vz+_*Yyjv=fAW4h`%D0pA$nI$0hKku
zy}V^p3#eQSI+H?q*EjFa)&eQv1uSf_wSDdXjS;>$JC_`XVh{*k$;Kb>{Vz77C|yL8
zM7%e<tdJ8q7SK@rh%&zwOSe*Z36w5v(N()0{qIlx^s`*qA=q{UU$&DzTt2kYDCf|D
z)|M8$wxB4xo%)-_Ut62bReUZGJ~EP03l12sRDr77Zvp>966H{w|9HO!i<KRWwW6p<
z9(7kET_~~FhCKZo%)2&(7cbJ}K$@ILlk2iH8U8jHXrOfrw2q&;CP^1cN91%wP6=k0
zBB=)$N+Cw5!?_wbi(Y~e;)65^r014E9qB@;NOK(6@kUxx=l=<JW%6P*FtL_rDsKUB
zS4_=bBk6x@yFL>xlzE>r67#`UyDJ8G*VXb&n@CQi`b=mzN|7hk@-p4=WhFf*KCD%`
zy{|CVOMW4VlGcmCj_MFPNBtx5bTe6yoD~dK#;Rq76ew{dI}8S%MY&bCgV?D&%)a81
z_Kbct5`$CPuC_h7OtKH~R?2vBa=t{kMz)3*Tf<(1cH(fsrFVN%G5Pz6$LV_u|A(<N
zyMY*lfoMyBLty%EY^6=+S=#+D4Ol4Q^juU*Wqkj=ZN)N3`88asDxr*bV8ctv`&OEH
z11vWJKuSDvI`p}SmhP(M%uH1!F{>+i`6CU9$_>+C<*Qohs8$}D;X3y1**LyFET!iR
zceDE@h(M$Mci9x&9uq5=H`j`TN}`gXSP|IJh*_u!i!xX#|GG(^at^4}y);^ou}b;H
zC3m{ymf5b2WMrUHes77UOY`i$>zzr4Ddp#lvN6#J?kq1TLR2}t>85ZY$Pl{AJCndD
z7p`3^8MG6R)UtOYW0ZU$7OijHvtA&=`4x&`U`Q3WnW}NO`cqqz<28GY!8-uM-+BTi
zZ;BJ3aRT6OT7y&S?ce!vXYkWL4jvHxud%sxIYZbYp&EM;$fVDau$VebP>u5RSK7Zq
zz9E;P6V+8t#Et^qvC$@kPr@1xs`wFULH@#Xn*M*Zx{UiGb_}|<Bf8e*JhXMG{>1Ne
zUgi?WQdN08b(>v=Bd?A-&lqs!&|a*A@jxeG<3JfUC%3hON)I6UVeDLU90q|He5E7|
zFuwoAR?4nFD(w&V0w_%tVEp{dt>`jR^QKk!nc^3A@?IBR6Fw6+p=evtLam2%HE%*=
z8a=G``BNQHRzXV|Jp3!kdjU3-&LaZ9f|&GqFJYa!IDjHLB6vwGk9D;J|E}f>iMo5i
zOWtB7tM2AtX3G`iI_62o*UUyQh3;;TomcW4xfintqT=0Des})kM0Vsu5aA$*u)mI-
z5xnGJaz7#M%ee(T^Bc!Rxw-o9b#h}V|IOE;advDf6{tYzqBAOrW(6;~;M*2_+d6z(
zoVP^@Ws~#s3%<V&1^4OP9Vb!^nw~EBHglzmTg2-^NGmN+7fdQ1wT#zy<TXSMCHeZ#
zM0-1_3YuU1G;-)|cBy%8#`tJ+tAZdU388yvMRnm!%w$oKWNZ$}i_kg|2X@s-4J7#8
zs74V%Tr;Xb1sBOB;^r1{BbVN}PDSP-i}<RdUUwZeXjT-8{>iq1_G#}V`=*8T%7;n)
z!vH@`)C=o#?8MZuPGX_&ftCz7;+tneQ!;R=VKK#Bc&9AuAJWb(xnU57qFXW`u(bb;
zB^~=7Ws*)s+rNBiz(cUC`}(TntcgHNae=!FN8VafU>JsNT*tr)`h9KD7HR#Ol{n#4
zY8wqD+Q}aSjoYlhYyc!*D#hO_jnA+sU+>zo)vSI_#;kO`$4=cf_hzL*5+x>!xu!d2
zYj46CxW6s}XsBckPkCo|I^&Ds-O}*xX6If}SoIUvhy*d;k#Qt^-PV21%m_1PfY>sK
zHGh;qa;)T&U_t2cNf51{C3G7LE;km0j;pD2%ULO%ibedpymn95zt_#OQoTC>cQ+KY
zRBCBtS64D#mL0%M{WsjQ=dbcC;r)s}xEWy!lQ@D|s%HWXWmdx5zQL9mwdy6({`EZm
z*PbAw1naz8p5OXBMan2~XBrkCkyf*0sRc61F_0`S)->DxnuJqw@y^CAAQ-n~IR!Z7
z%X?1a<nE&2_L`a!XBwDHFhTkz*s3*V9>OV2p_ryyU~2ZVvomRMG!wAP9qF3AXrS~h
zMERiXTyh+SVHkQPOaAKq7n=^Id<HrTrn_z`BybYhBt?D{5=GeyOj<9=D2;QBn*PS1
zC^f9Mp}96D5oedLgf-9PlE~|YRPqY-5<~eqh3aIP{UVc^=n6}_lo-k-OrReQ;Bl^7
zkiDc6AIm?ZeZTyWll@?*wlGvX=$ridlRZiN2Lpzq$hQh#hiwU9$B^yZ>zAIR;h!VI
zClvrxXuui?IS;^Xag*<V{dwRd9ytB62TqYdDNea02UtW~?6v%=-SHc`2u(!aBH#a^
zB~#kXJ{FQBfp2s9{x4b*St5>8qoKC)TN^mZqt`4CP|yLGc+k|uNpi+*xV7t`Y;E+a
z@Nqy*u-R(|$${xnAn3^GcepqiE+*(Rd?oSi+CWU1&aRH*WLh~|5kJXUIhWAMt8z&n
zu~b;Rt{ct!UoZ2h(xFm(ngV=TN%B^}Nu+i{f@ioE`!@6ZErTII;zBP(s+TW=^iR*x
z=)Cx)?y+qj+D%j>Qj#fDawdKt?pwXv9hhXUJkT~5^Y_O0>W8v($#EElVd#}C`P=(n
zY|=D*E`kA=?z$pUTUKIGq)sF;H<5JzCf&bUq#BMtK9D-5KuFXZhfU?pww(RSEEv3^
zzule*PdzIS6wF<@ujN9#k;p*OZ$DCZF13kZswD%hTtYgKcETPwp6nUl@f-<0@*kw*
zndT2jK{1&ISqi{%mns&83*@@(Sq4+tZCoRg1Z81$wP(9qlx<q9$|gODF9^3$?BT%B
z6}hbrS*Q{n%Z77|n|TMh<I4iXZ<F|%g6nnBtM&MWlYr~loF&$sL%O5~AM*~8e|6Y{
z0U-&}#X)`8s16%t|D6cQ>#O{%vZ80{QJ;RFUka!biDss3^v5y+*%An|h>&cI_SPFn
zZ!$l+dKS!Fx9}HvML>|od%U4TVpzx`Rd-tK#A(&;6Rh~iiknEoLA!ypBK<QF+b@PP
z>`o1R%eLxjwX-CyQo*>-BsD5s_mMX7qmv{mEAf3gq+AiuZ8}0H+4dAmMUob&R2u>n
zg$;`oy2kdkwi%#3x*{VNvWRV<+y{~-A4_MQ;*YU&!HpmWVd#~TNr1`yFV@v|pQ%P#
zxfej04+JpSU)VBQ?`vn;YhQ$}w{q;8YqnI))bxLVut-hE&LO75!TLx>+V2JyS?WJP
zpIoi=biA4Tz5xDmolr(&e@U>&?ygc>cPD%Kiwz($nm=2z$b{|dwt-Ddu19=ghqm!0
zLW(uQS^|kI^8I4w_tyB(w12f&T$AUTHMO=qo07y^x}KKSZs}2i$jhX4kY;fuznZDM
zDCvj99X8nh(Vy&@*m$1FZy<eoXpb`;seOv_`afraUw(*7h@dUyx#jORaLB;*Lj>G1
zGpuuHDe~Hlij&z)ikVp3IxHBZ7In3!n>%S1@3hYqT{cpFUeuqt+5XS%Uo;40v0_~k
z);yF%>xA|E=5A%*w;4@V4K-(dYy^LlrcZJ6Ye>T{AJzbT{AdeJX$!ptjQMC@WvGUv
zCqo>WA+nZhNUzAJHGq$rWzi_ht?cOBHi&>cCW%PWoD)#6j<3;y9YdN&QGoQ#DqgF+
zB{6Ta?6H^l=#uj4JuYo50X_bbZ2xd}E=Uf8FbusCUjz5QSUXAdoZV)|v<HZWI6#bK
z<b!kO#!sd-ROpN_l9WgGSr{W|p1yHvl<bK6*GO(<@Wp5}r)Bs+JFoZC^oZOTPWu<0
zy3`{43e-8EaCJy<Y(_DZ(d#I=`EQDcL_1aZnTG^>%s88o;ONJP+$hs&6lZT_p$Lwi
zs^7-Mzi}f~M{p#8C=<)xF4MMVC44&sM@(d{*dIBz1nixN4-B`Fo!w4+^|fob{YEOE
zNNyZ4+~PdUMn?Ta>g^{am9!>^^+`>uTrqM^Vcsv@aY_c|vdD#4FT@CkBzwWE)56@Z
z)wdc>CdrOZua=c&SIaTb+yL5&(bAs;hs182MC3y@a}Gb7RL9dD<Jg%dUKZv@h;W_Y
z-1=-GSFn%^KOD+qp`5Ky&Q`R?wb0#mBq@&<Kl_JYEnJ9cbA)SmVz-TjoKae1l-5|x
zi_>lL#`*rnuW~c;hGfJ^wB~^sA&CN{bgX+x)S`E3s^P>u^~V=y=YktC3<A+B8G{%5
z{ugVMW*$;oiKrJqaW;!>=6CB1<=nZXK>AEjsMBr*LLfQ2Ekn=>r8Q@N=sLja{$mTr
zO@8lw9wh+sn__Z%VxX)tFzmL93>tJHNiAy6Q%}=QG=x8rbyIQ5j@$Om)Baw9A6F2h
ztK^k+IJJM;e;VMUxLLk+Zd-=5_64ve^f8s-l9I-_k4k{(ABd@T(EP=z(`?jt^lw@%
zTT=F;$%u_XNag6)rHC@@kpmg?6JC7Jp*zGlZIF;46l<dLo8=m{S|H1CY&}eCi19nn
zyH0zLunL$IE@D`tZp!p4^IsvuDNdG^^-!B6a8)XiFUbbl)~>g$19!GajR8Iejfktn
z!jOEusibxtf%SWo4~3X((Y7=LfDEFpLe@h8due4S8B8kx63*F#pF43NXjzA81wfW-
z_x^`#cUl3EfBAo(3U6q?r*dmu$j|X234P$bTkBOxQxZcD3$F2C9q(`r1Bi4KHogmM
z!DglJ1NgN<&~hU@(PWHvUFud_2_=HVt=7flVI#g`9;Q8r<QHdWW7|LsLg8IH!2!nL
z{THhg<$WimmAG~R<men5{Qkal#vOcUq(Jpv^A3QaEq>M_-Q=C^6Yor&sS*k@GGGqY
zTBmLW+4xT}21-K8ie?L6q!`2e%KUn=CO<V-!fB_G>e5Q`tguEm`7$JuCTd+I(JM&M
zx3BSR0+l4c$7r|=4EU8_Ggabw+cEu;mBDgoA3nZun%@etyArAvwcN|c{>?xoe~lZL
zF8&pYIaQLP{UT=ef*O}eUc#Bz)I@Ukk4WxPtGv#GO6U+A9ibEI>gQ=pco{0ml;S#k
z*XNqbM~aLEsJpZ%!3ejAzRd@}4rCHRqMDt*C_u}EOO{v{jXz?SsDIr(7g`$PH7jvB
z8Fu+IE5!s#ZsTr>_*bC~e7E7ZB>v6nD|*l0pWTi1<AwDj1Jk2Q__pp35>aG7rEFQy
zeWP!ed(7Gx<#&$XOt@qUC`)bYgreQ!a)e9bw2RShV*0t}PD!BT5&<My!*&o%k#>!T
zwlK-m-G)9s(U4DKuQH^O_RZKC<X8y9F!V|!B`w_lVuQr^1)(pQ9jl5~h@`e-%YY)I
z&}wm?7?%AFMk53Bw_vCusuMx|&cH|*7fBg+XEGXD9}ZjOjXJ=o25@RtyJGpRVXH&n
zwQz)*Fbeiw8e$|z7Jq#yv<C>_SiX<MruFAavJCpPQoMabb-%e`j&W0gZWS2GYVA4o
zEN~$6H5Nt^wMM?x8q1%w2+7i~ta>`{Bn|q*I_<ALaaQB+inWTD{RCN(kU#+mw5Mv~
z^<?|LYD={7PBvP{PDH&0fTFV`58P)M7itC3VM(CCqV+^KiWaFAL_Tk41zD1h6Gu3_
z4W`b*o)hzs0LhWM+e`|``p`X)B^f8xnv|RbA>EdLC-hMiYkGfi61#^bL`^0l(r0$7
zYTD*2^{m(X{71ju<FNX?ZIIB4$0#I2EK(88Np9a*es9Fu2>gvaSt&7W@d#I&wF*kO
zo^-82xUq+a62wf7cGgN7Ba+12DzK6y?p+@gO&@L+9|{s_l0X|7g*6H>spVUBMj_*m
zvop$J5Qbssl}KqJz5m6A7=A_DB$xf|ho~!}O=8EEk=XV8nXJK!pNYg2LgU|Qw@au*
zt`mnhlC8H$`rImN)>DzlNg7)1NRU0-CloDvd>sML_G$mz@iP1ypGCsz8Z~Ps(C%i?
z7ITZ?D2c(zd*r@cg|XITcN|yA#P2+DDNhyKk(N#tV3XK31(|ZC&3Rf*xkyFew8-Sz
zrP_8z^(W#m%q~Id|3ocL#-Vr|(3@AJt<@%J6Zw0hXDJ()btq$EEWIuMx=bd1R~*h1
zry?Qe7o;ju?|<l{U?t;^N<osBugY8dWy6yOM+;w;2$NK<)PTwpI$5T_a{Ka8ZXLzm
z3hG7?-~p2!R;YiX(Kf6kZw5KE$srSN{=I)&Nk%M#-~b1}-;(_Y-mbL!MA@%z-=|4J
zCXvKfDk&auSRQc<Gs&?U@vI~FF|p%ULu;G)Qz+!euSO($&SEABuzgz-dcS9M7pec=
zp^|FUm9)+10xWqv_2TSYkRygc7<#1`Y-8X5V*N~cY~AiE?FASo6GK2qI&<Sd@_(8<
zk0mU*N;s&*j20)FGEU~|O&m7BBFCa1XH;=+<?1$uell7~XV1c6S0?{B*4A%(&~8y>
zS6R~L|ESA5YgZ9%sQkOURTlMHKON0v(PQTSBCT^b(Jr{7P<FZ$S`15AG865|Kh+B4
zVF^e&R%9O3v&aI{x4iw<+A~iKbbhpd;CmQ*g^Y~rHlAUik$6xz7A?I6K4f7sQtAES
z{)%$gAN2mh;70y_CgV&lBh8<YP<`y3CRwMF5^T*qU^L%YCfP&3q;or}22vR7Onv!b
zM~-6II4ql7B-oO$X{FX$N_{MV<fQF0qzcr|3;QLzYRIPETPC(bBBSOb<D8H9yyRO-
zB(j!?`<zUqPz>8T9T`-1_6Q#Nkq*KlOG)Xq;vfk6-#QM0P2XIQNXL`hv(0KiBh7Vr
z1Bs+X{<hnIxz>%ZAb&~TI6Idlg<%+oUMZI4D8B#2hDuF8hfp<5X2(hx1CFKs;f0f>
zH6_`W)h!+!ao5}Qxs2YoCAhI)9SX_ih1A5}&L)LJ&hnMiLkdX1g8(yp8~$9etXfgm
z6K#5I_=fM6ZyQ*(vK|6Sas0G`q!0#~gVYG@tBQc^^G@a}act{4n)#3QEYdc@Z}lRt
zR|rvUZxlpFLjN9^hmH<)uYIx8I<=KUU9#37<l(gcc4g+xguD}I^u#^9LKq|-y}i$Y
zSWiFc-SWr+r`ERNKC;tc&*eU1H(N;LU#!hMEFCox!ZsYafQLdfLrs7B14c#y{K;`H
zxFek$HCGA3Hc7NWM9Z^E4F33Zm$*k^B<Tm+0T?Offc8j7qy3}d&pH<iNvT+g$TGdk
zGC(3XHOGC4nE~2*SzIgdXGOL3)@F~doBqI`wJ;qE2BUomto;K7f7TLppfO}=QyBz3
z4qpj&>)h{R<VSMd7<pgQ`ToC8?2Flpuk<PWJs3qN+>x|Xwpf_tYfpbDI~N>@K^TT!
zsdXrU`(JFd)#NeKe9T_JqF;g&+eO&0LC*E;JW~C*2R@$zr&rN&{UanD(t!5G#gt7O
zD&fxLc1Q#yaNHgow^>t@|9RuliU#PJyeyKF<C$0NkWR?9`hclP8Ar6=9R947wg)pL
zS;p8KV^OMhWINE11Y$|b?QB-xD(qPUVPe_yMJK6wYyja#QbtXolF79RNn&&8Qq__S
zQrp|4|9f;Y4SX?CEy)m*QHhHTV-jr+`%WU3Ok!h`<nLtOHoIRFv#lpcfuf-NaBob5
zL|c-BvN$PgE-irH3usHG7LwkPJi$d<@)J^4iF;!@q<FtiFKe1yok#lVKwNu)cOXtB
z4#ZmFpX6<FqU;;@i3AX6&Xah&5U$AbYeEowoZqi*YfS^fG~g8~OJv6473|ltk|cxF
z#*1{z5;`jV5soBD+BdpTI%Lm(Ag$DP*3`+Q9Hd+N%5q62Kh>zEzSTyRvLus%1iRjX
z219Z6pXAbmvU9;vAckS+mD)P}%>6I6z>Z&$Sds1pq7Vd4?8N?!6kl_S^S&8ka`@L0
z2(}LVa%SpoKieiIjhqIT4#B0v%+~?i8#ie&hvJpe$2$;2$}7IzQq3z4Q!srX4sh^K
zhia?UX#2Y072V7|-pzEJGeH@ZGF1TPinHN!c*!DxnglQfu&~U+oWN9ODQ^SWN^u&F
zT8Cx2Hgba0`gU&T4*$9Dmqnse0f-k3rr1-}$|LoYoDL+|8eF9iyAonon*aH9^ACt|
z5or-AZ7|>}rS&OpzbhVjPS;7rUwM9yB=ePT74LmZ(vRbci!(|dsXBmSF->~$v{@u;
z6Ax}eoKnoOx8`RW$dcO-@oFsNv5nc+$jfBq5_UpV_HZ8@a^zLoZmC#snMJ*QQ;*zI
zr_5N2NkfH|T#gGgBQMi-OLa3o`~b%#(BTwH6O5%eS`<f%@)CV+3wGOdzSMnugwtup
z`@S_V>Hd`9Ei2z$#dM*0Mm*5X6-utfvt}*EKy^*zI89spP<D375rZ%czLLQSko#Y(
znG}8Q&rY>{%ag}py~H3(`XiDWl@J2ngUP<YJUf=p33!L&Pv~E_Ey$nNaQJm%g6gbD
zY7Ik^Mo)GwlGJ%{;bxG24HW$Cp*#UD7vsidp@+51w5Ad>1zcun=AZhK58$-v<wmnX
zgvZHMSH+CM-`%gT0PWyFg)M}F9-;a^!Zw&$L`tm6Q5*bbRqi8E-w@AR9asV>RSOkn
z#}1^(3&Lg(CWX#x_?&RO*4yp&x6}T9?oD>ZAyW20N>!emXXUish*a=p0`L(@$BYqv
zM*+U9oZt#2q5*H^gd1PSr$T#ENBjH%mR+RvleE~8(C;S{!LaI6`GQFKh5q;tB4rkl
zl3TtPZ}&uZk=k#<DbC<QB(H{-V3_=N2O#$S1dL%1b_s@gAz^$aR1XGO(o%gAiPwu=
z<x2dRHKWt~j7FB-q`HeXwTrhov6-@$JPDSGjoSSLM!Vn)OkV|(!<;%r4ZfONyfycz
ztBVAdsZM;Wwss^c9)NB56{p5$nX~T7{GjYia2$p~D0(Ggz>e>Ku}V?@qsmN0dV$E<
zY~XJTC%V)6olbZr9G#-D8+?!cW5Vp!Fjcn1flSAESnKxb=qhp54QzFPn)W(ouOAMi
zv@0XafwX@}0_p|#pQaGh(~^XTwvTq;Ot*jbO9}LS^mS8I`VDqw^ah8V@vcg<yAqLQ
zS&6C@G^Rf#`VJ~;C@v>sBJkd}Y1jAt;B(sFuarx>+-0EFTuHFzQex=RpvX5QwB4Tt
zdE8et7OL2#E_$rluV{QF)=SIQ6YD*xP<AmIG$lIAexg<Bdd6KZfCA|Uy?_hN<R4kN
z{{ADQ<>@+Mlj`NDDudj!-7kmQTk$us^?X*AueSB?3vs0v;9H;(m2UL!46vTM%dDmz
z`B?1h6ILwl(~wXdV$8IbUGJ011PNlIt+u0Le%sS+lJqVR+99IER_I9V-QS(xeXJ$0
zJqLDX4|dzhwoRy;h-|_5B#)L}<ru%J4s@XGH1%Ke!Q4wwCM%k7ex^?*;4Qn>g=7Y!
z-4qV;qU;Q88-`&ZxRPv&6t(|iZPWaz2m*XMKm^B-C6doS{v_Z`n)Bg}l+0M-S>>SQ
zK}uMj8W=@qEXHUGLpuEHwt8<!$Nc`)#b^~iIC@9@;F*w)8E9ca|40onKWq3)QaWa!
zWhWD?Wrlks#cmyHgNe;+5^>RE6(2m2j_oQ^RP}t!ee=0lR%@)I@Te1wnc;N@|L(E}
z+&WerS@dr0rCNzg%NGYxF*C;-VxMBS4-$cO7$%4ywO&P#jt|}w4m2IQnd)gS>^kL%
zPl35|D_WkRLPbIATAtPwm@9XYdNHhF%8K0HrWp-Ju%HptF|{lr6aP#o^&98ExQ+9e
z2bb-&kETI3DaT?VAL2AU0GMti#+dC>9n@XW<R|R|FH}sxjn6fIxnG3vm)`~J%}R@v
z`X4K`%vQjb$C-#n->yGYnpUen-XAuBh%M>ymLV0BQd}owV?bmcBN);!TRB{7SQm50
zxAp19#*Oye+pQNp0g0vuzXYQviQo2qjZWjX%4}@pd4^emp}-g4UX4My9Nf9%i?cJz
zaTtVw=#>I?4BY=>o85LEQd{jr{mV}+NC_bx`wiUZqX2f7k0f{?2`b#CulEA}_5O$>
z;c}4Ui1mdxMo6|iqr?0m4*(u_jKh!U1Jk6oE7C!Gy*p2&WXlXC^v{zNEJATLTOpmB
z{z_9k_}7}c-@`L<bK_qT`Iio-8EvQW{Os^FYdFX?jBo{hxUT$|-h5SC6REGLtr?!%
znzUMClF{0JRMwV2r;SuFfKN^o1^DZLNMAM*pOzwaURO|CiW779_i4VuD0<-b8jDuT
z8!MBIdwp-zn9yGr=9-J`w$w{7hXt*tM9VDoTAdRf73rxzBA1KQ>1~u6M-}mA(D^XW
z#XYz8Ps2?_r@&F+XO_6(25z`Tl1nS{@K4Dmzb;Z8i&{47<b7dAO0w)jwmr|^Kiuml
z4B2HP(MBxsq-J!OR9MiKACr>ZDyP7sd8r%ucNcb1)VHHNH>Mq%_89g9KBZRv7shYe
zQYs%5+@`s8&F$Wlq*4wQD|~W|yD^w}8_eS$|Do($a3h3aAbO<+4*~9fv8t4LMqO0{
z7qGn9kbviRb@gl06|0zGg8zV@_ro6#M}D|Ec~VGyaj~-ZR78Tcv~vj`q9h?K=;10#
zE7Y<|+q4(10cxUm#sJj@uQ!7}eWHnRW~Zf111W?<7w$DtUL#bMQ1QN){E$34E5A7y
zl;qGrSl^C;d4UW_avY)>!Uy9)Dx->dHqzs2U#1sOl!|#a&YTk_$TWcTU@#)1kp)_F
z%IG{}N1Pkwhbkltu2i#)biK3nlS`E<ZH#>oL+s5=Xr)K~<Gi!WBDAZM<?7_pXy&87
zj!%YRa}{4O3?(%2NVJKFAM3#FBVW@umsh`l;PbPJ(O(WQ73q^z5bAv;Y7k*tkp&<C
z$r~S6EgPSY8LKiNIUy^~Rx+;`8E$J{C-3pygOPQ(r`hYI_?aamk|;g41)B!8W$wpl
zJL$Yr9sBmGpZ&jdl}RqznX{7W_}uPvUhkugSyrq<_$1x<y2g3-{K=`z_-hutV}X3#
zA>X8(3vR<O3`4Kvj}+JUzu2|_d<xQHT)PVpMv#v}Qsm0*VeoU$=UCO`IQAWqzhoEx
zIgvSDguLcG<n>JHayX;}>Jw5~IuLVdS(QM6tW58nA2588>jo74_z0&00x^@4%FFKZ
z{0RYaNc)b|SFx9BW1ig_M}l2SSl&5M4cerX*X~otWtS4}2^UIG7wC(NgM8PuhzO(s
zt4V@9YpEQPh`t>xc*^oI;IYoXV}}%+i48bHFpnq>+dgauT!>aot^sd~uQ<(<4ym@y
z+LPt72T0+O%EZmsMy_&-diWkz{B^2vWWTrz#v6CR=1iKj6Pf+3Gf9c;z3u;9C+a6V
zTX|QLs{-SuXT+pLQWrB3>mF4;`0)S4NRjyevM+j37o}K!l9UvgD9F^;x8g)CidxK8
zS$^<1OR2T5N=c9?kaKjpnJFFji%KB{lGMQ*QbKazun6mHjS?UU=Y|Z;sp_fY@Ut4}
zu5&YqZYEKQqF<byYm&n-2!pR=V+i5?7u(Es`P^xKDBS~8L(<mfA&FR0G2uOc^uBT7
z%I{L^)TI_0$~+)}vn;ZDK4&FohK`1EBfV%|-y?ByL)0pWT5O52k`qx!Lz%32gp6vC
z&>qDU^i?q)YPp0V;jl`L#K}#8G{^e9E7vjg(_zt*bk^JKXIkPup>xucmDo6|jS20q
zn*jNsxJ5%rCTP){OKdBr9{hW2+)0gHlDc<p>aLU1LMO~Z)L7_*nH!9$k(ks#w4+Iz
z3o?rCZlR&1Z(MDL{Us3g^W2kzmJ4$XIji$6pv;?`Z^o8A>cVylC_!5FKO`6=eJlNa
z{^c9D4Keli#sOaSi8OI)x{_xd)AkNbkdmi+9#dfW3fao22y8Z!?9ij}82C`x_C;!6
z1x(0%Ngt{hSkQOgW!SVCGoLFajl>z=b!CEdj`n&ubvh7(U-(|s(8<YFc(C!o^m__^
zPhB{jIBa&GbLxPO+X_M_iGMdC)B$y;1P*BYzM3D#&Me1a5D21I3cX-_|BKCtOg)s0
zl*(Ve5W-g6)cQork4(<$B>RB`5bNu895Z5TW(>b4uoBX>17TB$QP_@avy!ODag=*>
z^-vyt`8eCAhcd}jcnVqemq6Cn@<q)pCbB9(O`1Fm2~)Rf$*q*^NpEFRjFb|R%)9+D
z)%%_%I)Xp_)PBFMrL$opvxrA#C<Hd&2$WlCzV#z7O>zmRy^E6FI=WjzyfkLM2N@6c
zV$tJ0LXiC|k$<;^6I)E=lwjlV9ME=Q$BB*)gUO5A!X8gRu}dP^r}F6*l=J(`J}`Wf
zT)l$3R~0e@?*QrJn;gU=4jw+qSXcNxk?uhMMAG?^7p_o?y!Ig{HGDT3vKbVbh8^P@
ze)6NSKYRI=;3tu$k0fKeVV3-734RiROp+Foq=nS_;>3|jiRY*kY|`YTe-Vz>`S>qN
zo%jLep55|Px02L<BDoRp=e@{&wineFNl8BT5}><O`H((Bys=DnF~12FEXIHu7GG>E
zlc99%5jUlX(xk27|CdBkwv0DFl$~3ygD?z4w?rH}l>Kk46=jaAtLhH@<I4)5fSq|M
z(L64G^yNwEzmrHNmn67rpCtcwrRkp&AdWf{B+m-|dU%an385@$w@5^(JboyHGtU93
z6_yoENqB`r37!;&qvNunKftiwMTPGx>73WPf_2SnU9J*#4id`-*|QP&$4~#q2ACwG
zcjI&-@46WlD#?PG@K6ffP9pLdpWrH$d`}>?>Osrl%l{w2BiA2?M(*j=LfcJ|onp3;
zhbD&Y9GLX`&ObZFY$wG`BgA{Azn5ZGt&SXM5eHgCZPd82Q89hxsC>)-k)9yZ_F$?o
zeVtq9*uVkMptZbpSqYnriG1KqCp^0mX`3@Go1lbFM(N#U7Uo{+{a#o8?leXgW8_Bw
zdE3reaZ_~=WgFOarECK`Uupegg-3Mktx7wFy-<h;`D6NG4{xnlZTi|gRCde3Zt*Zj
zHBcGM+u1Q22xTqKQ2>=+{9Fb~*>iQS62`_sevrVf(W=Yca=5CEUkPgenrdU&DYa-x
z^zNRVok@<wAPhyX6b296|6-jkm7hzAI;MJ;l|_gEhd-Soi5a(8E$7^ot3~f9j(?5f
zh?0kW1iLZhNDbTfat{cA()o>8bP(KbNh@<PMeR>$3T<nB?yFy_koaoxceL|T>pB*v
zy*_pUE(uJMJ&mzwOmLlBFW`|2#&9FXqy^DxbgwIQq{yU=H=-FcF}M`PNC1-OqJ%~o
zM6014Sxmj5p^Y2{Ne&VbibmIZLnC-{;r4xyK0+${hRu<r!|TKdXr*uX+IDIef+s($
za;E*mDn~3$cb-y_YZj=a!|Od?xkD%2$X6DJ-Wn~*oZS0N;YO=8yAsezfY&}81i-M!
zD0Ld*{o1p?!yR85o3P5!jRVrtIBj5e=Jf0+K1$S0KqpsXubLSGA=UGG-6c8+5mck$
z{wj??0-byw)A>|?JA;3dmFV9|YuKse+}jJ7i-O*S3F^k7?TOy#tr7`4?bi&XsI&;i
zK|mB&Ha?QUT^_a=yo!-(U_YFl4UU8`2!*dC1)ui*7n@`wA4aoFXD>jQ>ZJJoc&oYg
z9^0PmeHWtgv|DebD(<h!<R+8d$SPUGW8rw>PuYzvC&KNs>|-b<&=cRY<=Q{V)Vrss
zSZyjr-_yZGPyyW_o8eznO6-s9V)Q$yDd_dBdy<lF!CXRWkFh(z+b?cy1UDc}8qa>(
zFG(dKiQbl|@SAtM?<Ezk$MbBis2abrX1Y55oBG#xqz&E@HNp}Z31wb5zz=ko^orCD
zTuLG`Or>n!QMM;etA#TH&#s-3TZK`Om)QCnlw9NpW4J*hA7sh(c2>bfZb)5ua?WeC
z;Efhsq$gN=t$`YFo@)s}BFoiFpnA;LIBBhfQ;?BIU26u^=2~9Spd=$*#GO(}BOplI
zOIt=Hi8%v2Ltt?>(Vr7JfH{|fO5r9uwa^hMfCnG!52}4w-wneE#P4JY75RpvckBsM
z<PA#Pcxd&*+E>!f=K)RsUq?A^pNKZFX?{36quhvL5QttW1RI<CU#yj~^Qd;C6765U
zkmEQQ2AKJMQd`4p3lV_|WumT}Z~~ixk+YwZ3DqM*yR?oPi-m`zwIaX04{jqv?1gh}
z{r5)z4?*z0f^vK9ktR~?B$0SvNx-(06+`DSF0n;_v4wVa1ZxXs2Zu_zqig|yP!*Ca
z`L>qT{$%I+grE?^o`_-hqgH|P<iA5(+p~YQyaCu!Y&JOB(Yr@4&=2(~UEGGcs%1-V
z8eX7ZqCutuxo~TvMF7H?WS1P~Yju}nt2OnO0R8IXhCaXI{<C+r)FIJoGgL!g*TBV9
z->(U$jktQQV%gZRY_z9<I%MTp5FPtr`*BtizCQA!SqwXWgdKWI`^HjyW$7l1oYe!k
zo?AkSQY})Uzb+2Q?fS@c*c(HpCq<G|4QVm@6EJYyP(CPdH?=gxX!~SC)yTOiBWk{R
zh=*$RnSY={nUg+Q+6Ravd|JQLAS7e~R!CAZHI@Ay!PHR7k6*57y<75&8RLhtb4yYf
zgo5an0zw1(-`H5uK4@u8$3MSr0TM!Pzuqh5a0u-*%Kv89vagu{CcmtBT>~gNveDFu
zPnh~LrgD9D7`HAGmXB?4%Jufbioc{$`hcr|WR!`|8>r;+&3($e%{h!s&uovTzJ0f`
z-DZi}4<qV;0lv3G0KT!ea~Yr8rnEfs22Rp0ypJp`)b?)e*i!pN+187XfBws+Z*Cn;
zncyO#afp7KG9205O1?Ey?)!spb)L4d<t}Z7yRHAq<m(+Zd5aw>fkrk13at!?Kb8Y3
zC*R0uWN(H6gr$v!+qU;#@yOk1q`{!l4F(nZCHG2k50FE7h}4ro5AZ;GcVSHZiqNIh
z$h#1-$;|~J*tQi6drI`#leYNAT)P9)t^=yPYOXXtg@t=|=GvWI&s1rBR3iGb5E*x+
z5)h>~0ee7*)Faw1LzFxyy>Kn@5s<&RkV{TzyYw~<m*xvM;gd42p%N2U2YKc_lF>8}
zm3dmvK+CgI-Id}=Lipr@yK}NM|0p|?+=gKoie5<rNlEv=Sll#x44MMp*<~frb|6vw
z(=RBMj5M2)k`@U~jtHI(B3Ynrxbt+_5;umoDJF?M$R*H+3989M*4Qa0$_D?#^m{sg
z+R|vu6Y_LB`cF;rB(B6S_4f1F&faEkNdbydO=d+;<=<;mLh}33FA2}qhBB#FD*-KC
zTQ9|i0SHN^L6UjfZl%L<Z2OG!X{<EvgEz7LvnI4)Jyk%rYT`zTaMtPFf{lCVX~3Im
zl1vG1xnmQc<hrH}19-6#EZJ0(+-Y(Wmz<WCDbu{#rF0jWQeYg18>OKwM-lFrElT&-
zNMO?1=6u_v987u>J$om45;rHGImL^P8+_N3MO2d=Ah<6~DRXqTmY%>BK8cA27QokY
zCSa~J%L07zkau$qG@Sf&;|8(-K4}Epd#?z1bO2Hf65x}y5;3i{()CNfCx#}yYQj`@
z^e<}4-X!SZ{;6qdPUvbCAWZBpa-fyOf@>Fdxe~%)L#&K{mgN=IH8p4<oP@)-O2l=X
zX}%<Kub%_$LD?DQHVnfs^h&nmgvtFcwj!&Zjb<COzkCUH5u~<A@x6D~ahC?3&;V+j
zwo<tPJCu@Y<|Iz6(=VtxClfpw0j?@Jq}YzG7P0d9J$(6fPxM<O<8pQ?$@huCgJY9m
zMSd%(P76bNG4t9(irRUr1kfX}mWIb_s^1CO7-z4QJhcUD5i7BolY#Re*0#uSJ=+hq
zU{IfFKfUUC&rP0AEH0Sd^`sIjx2>+v+YAUJkWq)FLkYR^05wJ=%OKn3s_rW7pPf&*
zeB1J0mwt0)dp+S}lgL7Znw8L1dS!lh(XQCS5(mf0M2A1isbexJQ6JDN<HdI5S%{S&
zW?oMv4Mzns_OR-g0_;r!<V!}L$Nm^&s}d|TtL^oUu)KV|W6r7i-7!3gLo^4!6P<4_
z>8k|GY-6H$AgGkkym=Il7@h?AoD7J(>Fv*$?E*SU`bEe7irjd`SGYpe_-;4PN^eYa
z4qpeS2`;<_1yeb#z4qmXIJq-mrdm^|B$V(|uYx$a*UJ=pd9jvCf08-BI6Jpohd~&K
zZV7A*Wd9rMM?1%ra&=9*fe}P4A>(;`kopa2H53B+P_a6UVbM4_`CR=*Y7f?=$YSzF
zTtxHOqR@9eMOm6!hTO9u^K6njUN1+^Ntq1ho{wp&<&Y;-F;2>-C&}Wq)of{6X=GQ~
zM6i_2hpnVxmXj+l@4WFMv5w=hAFS#618M()q-mwOl=Q|)Vy+X{ygqU1n#37oX`@qN
zU5#S@QPs*X>`}jLnO6>ckHeDEpG3`;zw1HYySg)|3@6touKJffk~t9}KsO``L9fH^
z7vsu}^a-_zPdy}`2M-D2Bv~Qcfe&ERbmK5WkW>#)2vX~}UBQ{30O6lxSN_YcG@~40
zL^(uCc{L7b^-UY|WK0T1H}Miog?oKihu>t%<N|fKlquJ{Bgz4#k+*S2s&A2Tmvg5G
zyXzb9K+e6GRbJGmUiyoCZtw4~gYsSz>x8I2py5{*O|~TTSrbV$71E2dbIFkygn{Ul
z0tRgEf3eA^RgYHBqB^t73Ps2P$MySN3B|hx3Z1~(PHxut;;a>1xf1Ub`7mkD72BU9
z>ysN8o6yrO2yRUa3#OpTDkNf>D+c`8)hvTD*WVyMggB9%?#~yckjh|?8w_&q)8s)P
zDWo#yNt$jaixXovKjm74l${?gc_$3Oin~Yh@09!~F?Nal*(DDTRwM?mS0NNEJWt+M
z@<jm6L><5^95pLWxQyMWB=AO*%mJ<I;Ywmr>6I9|Y|#U@Wd|f;N~q6)%~&*UCNEh_
z5X&IfwPAnPJ3M-;GRdSVk-MX=f!Ejg%FVH>oZ2R4R+PSRgogIJO)8rz`k&Gug;gG*
zVXTYk^i>a5!n&CMb}W!j*XEZ|)(ul&-EGMj!3MddaLN?jDHl;U<J(-A6h;{h1$Jww
zRdvwbPxb}@qg>=~mSC6BnI(6>KLsyvf=)Gvffw%g_A3)aiLWcRt|wZ&{6?#y2Te96
z(-gElH;9vz@GeTn>%<Lac@LK)P4b7dGq7zKhJoNp%F~MI{TFM{nn$-a@D8#7p~yl+
z@t;S5ORMGZD#{z1%nbLF@lN~$O%h1|;h~gtNqcK%#`AVd@Y>r92#`PfFqV$=^bezk
zxn_?64F)JM3d({7)()_^Y_npryx=a#cg-wjN?t}PAJ?r&P)Z64dZ2E9ptoh3S@JuM
z;T0bzx6tAU*eJXnX~1bz@w(06S&Woq($(8Epta|38qkSwr29cgJn$vLf8!TL+UG}(
z@dvmB3P6aN){vSgklDI_82|@UMTSj=69G~?wHfv&Du2<m)v!c>+$urW)=-)%&uUr*
zR6=e&t*P456rx@vzfJQ$aSKuO9pYA&2C0CWaj~YH4}Sov))!@QRZJ#77P~8^1psEx
zkX(-sBh~2+!Asx{QBhaEhn|^8Xpk3?)YsAQ->&Jcg5Fvs7WF+lY(ktgOkSufM-ycn
zI*W@$YK>hEuEddU$C1LjNa!@Yi`DejR(x!WT9yX+x=z11JGUGNK^Tgz30i8||HdXU
z-h<JP;w(UdRb%OWahwfYSTsA{z_U^qq{El<rQ?_Z2s!JDGtZXmVh26!fq#CMnZhX?
z^18lp{Ru(f>A$lQ!bu^T*L`;G)2{n0R>H`2!6NrPC9p{O?0S3G3DD<LoiK7uNeg<$
zKTu5yi)@{#mK#)Oe%?0gJt2I@$+-=hw}#cJ)q5I{fCeNWB=m<+O)s515-ie1E;pAa
zw7Ep)=A~Idb_lPc7ejY-{7LJ6Kv*Q9E_9{FFmfZ)C51!=r?z|g3F+G<V=|Y8D-F}c
zseVp+z_L+JQYMLk6|o6Jkn$ZuIXMTD(Syn8frh943!t35twak)R>jsz{;tqc1jd&=
zjYox+A;5<c#nVvMoOzEYA4lDq*zzXEJ4+lC2h*sZ`*SGbjE+55R$cv013~t{EvIvi
zP;+Wt&Y;rKC8z@kTXCL^jQjHI5CUm3aY8u_Ic}#!7`SrOChE`vZd`3onL;4XNA{!a
zTyPwQK_Ggi7=umjf3a0n&7-ZV#l1ijCyoQm?^)Uqc&b^=$)k4vTo<|K)%Tq&49jgs
zH6|45Wo12AJ^>(&oC~gG2A<W+rLy#rFZsI+vc=VlyRUB1OMc&w>xT^qbKCyEQrDTL
zfJm!e+YqSC!bbawTUg|@GC3EYX%Z_jdwxX<i<~ArYvWazOYl*ymL{D6Gm3!eiCy|E
z=%5Y0N@0=y9I-r(CG0W-<$U(Ohbb&_S#jl)U+o}htlb2HBAxk942^6PH2Ub4DvS^J
zeS@wiwEpNZ<p&Yr4IHDJXvc{enDAgK|0S+C?*2>>5*Ywdafxod=EeB8McWhMq_)7I
z_S@RuanMncHtCQfT-A;FCT+6s-jGeo!+&51ChNpLj5SG`yuGGMTf8VQ!;|)V6A<b2
z%1*Bwk%T8-{mLjyBvHoZmZ);;e{ez}jdsK=Kz(pKSgqrA3WfB63#)6|`jcul(Mvjs
zAWN@*Enfd__0CDmB<;vpC{qab+`S=SK91}^%FY1EVGxFaUm`$)`2WZ5rZ-w=ZaP)^
z0Vk#f97~q|_ALxM4yENv-~oe3rRw?y9&hMftbFfcGuf&ZFcdw`1z;DwYlW)oLHiX;
z#(|g9xFV=6R9$b-#8tYdXmI46!sz6iNMC^*Le;gT!ESDY*w(KHkzAkP2V#P}YUU=l
z0}V&s+)iLOedTr{+$JY7?BM?1yF<}uUgA^o_y=uX6ME#83phiP+swah8tV1}?P%#L
z!;$j85j3)*<W(*#vZ20$ZTg95Lay5kM}Bx6>A~92;x<{UL)Pk}V=Nbk35A5~97uti
zVlU)UrImkoJ!!kYNTey!{*+z&B0CHwkBMy_tu`#V=ZMl00+TGTt-Fy>@AO*x6p4a_
z<|e+bx_pmlMe9?6Nlp%<=>ninRM@gkp}-_Nf;SyGpKa!c&N%ubFiEoeeZI3h2b1%W
zW-D;X$)P<_282WMC_9t?e7Bu#l##A^n>`m3h9`StYODF{w6|&m<(qr|P<Adh48kxF
zT`7+9;r3swQd>V)fMmLWMS#-8=X=NOAE~v!X*c_^+9j-#Ei4<ijQCZ)m}+)iT}r_@
zDf^&OKVOsg9BVrMsl>iSklkT}b#gCj(5TwDsYFjPd!^-WS)o)q2pzY8o_Nv<YSN@`
z+>$*y(>^)H*C1WBeX}}tf^h45IR~sCwCnXg!5DaS$7Ac=qAO&mU546awNpZ%T_>N+
z4UUIC_o`FpW%Nz>C+`f-?2$PL^)=y4fXO#~U-);s94AzwT^qajp67Ty=KBk!(&!2=
z;?NJmMw`{Eo7Zt!@*)4RT`81GM?-fa0>4Sd{tYFqDus%3fSU1h%iFcfG6V%Xc7TjQ
zCW~d3=Qv@PoY6Y-nX`#ZUe~QN^<)>5I!$2sij<(C(&nlTZwj#*h2gC$gw3V=sf0{v
zpXsCzFccw=rqC$qM?$6?5SfPToT)WchD9i3$~5t;MgGl-&)l1aRaJt|9TC=ZSaP`x
z(s%vr7H>g5I}D+t-*cy5l$}wM!ypVpuS5X{`~DZ(PJ^B^+ub_->rXT(gqR>p`V)y1
zGmbr*V>U9FJFCZuJ}OC+u;pup=Ulyb#Z($x!*=uN+ZW`nuSbZg%>2Vg%cNkjA9dJd
zAeoeBiE&hU42MRk=S_6wQhx|zv@+T8#{G<6FnfgizI+4K&$g(_rA4wYe*r0T#A`>*
z5L4-rI}PMF-X;RhRlZ9G+Y?8hAR2a(sbo>M<OLS5k=bP;^)|ITHnm$J>FvGj1Jd(X
zSqHFqy&^%L8+mFas~ci0)1LR@&A#A1S9w|yGie<aOS*9_E+bx!)9i0$*Kil;_C?u+
zw!9YbY{??Qyd-2Jg_BZWD8D?UERC}DDKd6)qafr8`9Z|2=ZxG*p`Zkj`$il!%K8^Y
z-*9(ONC!sa{+QW(gON+Ul|(Yx8hzoSU!F*I9|@{*$(*9Qo}cde$eC822L_pwEptoR
zB_RiV{m%+XvNEw$xal8f9_8uCTCOq?mCk+}&E$Z}nO>geMFvjFCA#Ahy#vEfbD?*n
zAIi=x$6*+RqHD4Z*zA8}^T=?h+Kg`dmoG#j%Z|CP=Sn>`DNdN-6>c@5Hq(o#fJ)zs
z19G5GpXk%&kTIPEGnDQvPqUJ#nCZjc!Qu<2h)ftp<t=iw6;~2Cxtv%YAf_>KQPYPT
z7O$7P!5{$j3RNZORnI6uD%a@n*)|+KZ->t&fs^-f>Q0=x{FN-M(z#GXfWt=dD1JQ%
zR3&u5i=GxeIX$`V2^%%|p<{K3MU7Ck8G1%M$6-u#Panl$Bo?m&Yqx>hKd}*GNtQ^q
z#p_``1xoBdKYes1)_Cy6gD-x%lH4$NJMj>#SuBy@TDi3_Fn3=oxxx|nV~{9KnhxgX
zTDcJi7a(g1vTqWPPm(AfDsgPuhAY1H+u4hBX|A5=C77k|3CuF$MFiEtEZ2JhNtD~-
zCR(@lr|EhXFdKwX=eTiYk^J5WkV-JiW@j~jeKR4}{Po=V|J3?#R(wr}<*tI`D;mh}
zr#43C_d@cG6UWz^N+0$#sRZn_x~HG_{9^2kawLX97<wieV3PY^Y@_M;MY~#!``4eM
zHi-yeu%CX@_~z-No_jh$n8|%trMso4AfBE+NtuTZ6Lz;oLqxMI^&m8a@l|9qfvh<K
zss4t7?e!nFxt<Cz-(8B%l6Xr_f<i7&b!k2b3_&o9v8WaYN~Q|d`^o+s2xf~V=9eV`
zLtpnqhH?zT6wwW3D0Qk~IW-puCXxo@Rv^454~zMC>v%yhzgo)S^WB9D=Q6lx(u7WL
zw58=(3wS5cw#%cpN51Q8v5To;9B)z=$T*Fo)(r^3Oe9<LNVYBwedTKZcRJ!rO%=-N
zl!9kHI032)>K-Tni@DB>w^^Z`P|_}_`(%Ra#L-xF40ziR+&p54P=C*UJNTfmb}lWn
zs=|miqD5%cAGaBW-*nU!Ep<I4AGDvQwUjhe(od<ChP7n6P;lE(y;}!p%x24)(esyI
z>Hf22MG)UZt=^Be4B02a&5exMhmhbc+2z2hZRvBSQAS=0xq=ao2-g9%?VzmyMQCU;
zJ1!Ne_tVQ+5@5Lw0~T6q_m=)pb}mT{gD?=i5=I~7`(JEaiTg2?EadE1sRRW`Aa(ac
zmq1n?xz!r=!*D2f^9LL006k20gMdsq!L23tr~$Ha5|XAu(rx|aQ}sT9WS~#Lp!jk`
z``WL?8nC;bMh;-)B&a^0(a(;zWnd|Gc7vtWTLM|R83WWQsCd*8A=jW@Nj(pc22gFw
z)!U(~3Zh_xZYo6YJELFhU9Ge)pZwIdU1{yfh2RyvT~D|WP$TuTzm@=1{+nF_j?emG
zcJ>X6-s_}t{A^WCYN%Q{As@LtnZT0Y;IlTKs9HIXPtDde<q@m>IJxZPm$WG;be4NQ
zS?=}W&;l-cjf9094?KcSjUr5<wR-&Ekffhdamf>UXLy2gSbJ;%RYJ~pjg)btAr>u*
z{bgwjze8S$Iuh+Yxn`Ru0j&&2yi?yV*V~PkiMIj8purSTR5%}lOM5BT>}R(nL}Ur(
zka*KU*lX1L6wFSWfDekBaLI1cq|TC1I^y@T(*CwmiNGq_%TfhPw6>fc_JYr#qCL1O
zSB5$?<8Jl*qwEZfD+Xa0x)K;0oc$MT`mcWEl3tZAz>$Q2ku2%EP$q4$$&<3k%8_J=
zX7#}Zm*v@Yg^RqBT=L6|IF|HBE2=We<a^-GIf?#TmU3<HK+1YW0A^WbNp$_H9XJr6
z+Q-grFKWP>+yNZOy91sVe6whN%CThCjm4`SXoku|rrSXZyvYSneC0X+Kl0?YjwKr&
zuTK9HR8#kf23apkCmbhf>nXWkPz30egzJ3VjoGd$RQb>DG)l+9;5MC)z*P;?ANE1N
z=zV2K_BoI}{N0I<8-!$!7u)|1qijT*qhbHYg#32*|3QB+*LiV%Kvd=>#t5Pkp-|}Z
zIPjgKH$QP6%W}UonemdXh)P7Yi6MW0A;r?qMv#I-msC&CY^W;wl=nYqN&u3%iV|Gg
z*>mY<n;YJ40Khbg<BB!9Ttt)hZURJ&3fU<BOrthPDzCIR6>=PJY43BS-TL|zi<#xy
zP}^)pQ@U3n8LPIDKvcKdkb8E~lon7Ef$tY&&<A@}BTZ`3>gSvF?Y<~G7u*D57>Hge
z+5DXQU#yij^Gs>0Sq^{&iwSn-H)0TMIQ$b|gtiiIjx+bt?pCebI|?x6=&(Aq-SmtR
zelSSPoVdAjgCEMoy_#RS)8BRG?5=Q*z*Vz$+fRZie{2EzbW;NRCtHAE%6w1P4LjeJ
z;H>)nT`(m$-izn#Q@&D^^ml!)LdMUND&v0!)(2JKPEE0%LRI!d*3);D)6-ki!`AIz
zGO+ybUXUc%575t^@VI;xnY!w)X!Z7~scRHLk!Li&9Y@ytOgwwBr#?_*BY*V8nynEH
z<LAb}tGFUosU)$$o4@>7EhzFB%hvNMiB&ej5PL2LUffvm4&*^YUJBjXU_=3m{F8K%
z^bJ2eCKRc?sN$%4YToK@+e^TaZGy7}id@|v^)-AyiN&ooWXW(KyR!RU0;>^(5SKQ!
zn49>~%T~hSwQv_X(oJ`8x)!^qZ+y5V5>)UJz7?z6=OY{vU0+-J%8tUX9fhAOq}B1o
z{P=wJfsn`d5Q&rIUI~QyUFM6jGfHw8gkk8FA}|K-f3bGj(W8@(c=rOHKoT1)S$Ya%
zsK&`C7B&-dT^*|LvA9j@cxvOvi1&P4^(k~Cgvoqp_bt7}1)g2k4n`<DEy%c_0ty%7
zI<q13y6y^CJ?!=T@qd4gBV&;1DYb;svVG?7b*7ae$Y}*V{Fg8)D18c+3_uR~l%9d%
zT|nH+^3o_{kRT!eB43*Mr!v;N;~sV(%ZgfYM~S1C^Zf5fhvJHHl5=$rA7VybXJrU-
zdrW3q9O&=L088MH>F0@N<%B@5I_Ic&dfmtFx@bKJoL{QHq3xA5!}II^D+7IWbDk(U
z9A;+ODU!j*fkcIWF!5v5*qqL!B*G~p*S(=0+U1MKS8@bHTTF6C$NIP|(lYWG;0^)s
zkSI*OPk~uR8h2*o51&z!)y;Z!c$B#{-|#MPNY%7l^^TkIXQ|SG@dj20qh6Um>uGL|
zsW~S~SvquvBpV(lFb4fBWfUOC33)AXULtdpQEYHycpzbUZjtI$$MK<hyRgO-7uM6)
ze?aA5l%2tq0w4@TTOuTc(0^lkFdx@Fj5ff--6$}V{OOett!b;JpK>#eEX`e;43D+?
zfjyA4!fq|b8c~vDT`$@M66orl(vh?F8uw+24%SI_B)=AK@YZa{0v1&E(VF@tZtz<-
zi4xs&y0f1`HA`;^s8p9UPpW0}TUuHfR^#R6IqTRD>)2=hXOM0fH{DR?f0p?TOdw6z
z>i58eG8nEL_ZEv$-MRy|@)&ZaZ0ydVFlE!zBYF;{%n`4Ppgg*1K={TwvXn3y!zs!p
z!mcDMYv@|SX$;4ZYf&Z-56>x^1dKe%ywTfm8@dGajSrG*PuR@8K9;GHa<j$I-7hAq
zC=f!petKWepYNlVnp4V62F5iI(t|0Ta9}x8{_h!x>;sJ$F(lpf#V3mvuA+sj)xuT(
zeMaidyh<9G5|#3R4bY~bL2y05n+{jlfpflHZ|EPv^+jF#OKlsv5FxnkansfbfNaA;
zvtY|`7~eQ~JUv$2Fk1QhNR*_bH#z8t?pDz!(Xt0==YrcX48zbXS^moRzu1B{d~S;k
z+^`D>3SuV`DUo#MLL4YRd(r*4I?`n$Rb(=mS>(?@HoUM!3*uNwE>@v*^9MZRv`TUr
zSV_h@IVHHm{zFdVo2T169ZbAG;8;m^kU~5Oj|N4y?Vs-SjTM+j1%CzKt9Cvtu#&{M
z{f=3Q+3uJw(k4>=ua{*la-ju^lUyvF@$l$nuok)Wg^MMgAXZ1K!<X%>MIxJgRbXeq
zQuV)Qn&L>f3S9}P^b@Iv{}8YiiFkIP2N&Fyu>L?9_(`gE8%6!&C=5S!JGc<oNxn#D
zYmi1vQ%irCL^j@eJbez-8#nA0hre_p8%I&Sb=CW#!H0fxX;rCiC5)#q0tRe_!F(al
z)=)ZQfngH}g`}cNc{WR=hN#At_@uw4q$^j8kAwm@Vrk>^y**BXi_<;_>fZ(z1+ewz
zBk6Dtq<_!^?^D3>=)P}XjP@nNlzDPuH+uV=80}O2)+_bf1Vx%2MS^(jsFG<S>$k3H
z84Dg=;FwVCS=0hPd|`ix^TpU1<wy*|F!V|#&<5^*v8{IMmyx<!^VhEk7$zjK<6uX#
zK(v}vdtV00w)IA{Znc8aBWt=POk@9-74irL<`VZI)kKv(jTGuwyOJwfB2a9EZL`1I
zC`;OKzm0M>A&!xa39^zCKa&Lc@MwV$$5cR4g_gWfGUz_EVWi}%y4K+s`|29=Bu^B2
zP_v^Q*Z=6M^bJ&JRLv5Xd!xEGUzNVHvR`#vMFt6o7adv&;IQ|r0vYcJe=w+76jjFA
z{svFZ5@ZnOTYU5*0)ohgpyGEY`n8yRsWVDAvzCC>kZb*8w%Ie3c(1XbA=esmWRFx=
zK+Nfnn{t+rB%Wwl>Kz+HneqMQcL&&*<oq=yL&wyczmWwtQiSMpzRs!nI_)CBmMa<|
zM}5CJ)cg(?$%NoWULRda)JtYq?-2qU8&hdoKPvo8D9V042t^To0PWsiC$+=VT9T}e
z!p5Z)-F6T|w3WjU<Tw+CshUFjTBU_}SwrVPX@7yTKJ5>LTE7m7Agwd8dFPOx%l*UI
z87w&n!!Y!hVuMNe{~s&USv_|-tmxi)@({=*wPZ=L)AI2|z=nPXGsQVlXPfgs%s~#u
z_zEObK>hWLJPHfcCwY>`iB$b0A~(Q}t+XUjJ(ld^5(X=)u{wK}q`1d|EB^67N=&Za
z;|5k<kf<IH1{biN{Bm{spOqw4n_*7@xW^jEg77fH6gBF>x0AepxRr`d+`$erEFhI|
zj|{zo{w*9r*5<z)8=TSLz;-SJ8^iQ#!%s&-rPv4a^TmDQcT<jgO5(3d4Aa@BKM_90
z2Q8`&YZf^Yw!=!e$gb4MjbuQ+-<Yce0H}T0U|Xb)%iX$kU6qiA35wW9!nA4peQo|O
zK=?>!j3G-AN@@S*q`1gaHWM+FyRh*3TGQX&*?v(Ako3Gmn~}q>j0RFKTc{6H*fzIw
zB~0W*tUPdsd0eG)BwJ&k3wJ)R61Qjhs6wOftF(8HqBeS(;&~O~+FKMN70)W6GwZ?q
zDE6@!G9<F2Ld3{n?W(RqJt%T5=tbI@;8YC5K=ew<#7^7$UyMrN=ZXpqhznTxUunF|
z;;*^}|CMTs)B7E$z{ky!t)tC!=Sh0Je5B*Mh1Lw_22qY6Yx|^zFKgfDzR(kP@UYFO
z3V)2jn$;{@ulw;RBy-zdT`^u&TaGrqYQCyHQ*gEWYh}?Yb=&>d`7_lld*JjPNK~WB
z<hX2eBlM037VUFG(CW=U@{t(#AufGJ!a~a`0u^xl*Z>yEMv`hK<l$NYNCr?nyhG(U
ze$6`+fMlHP5vd)g_ela;l}+0CwDRj#s7*RC#rN&oW2NLf(t*b4vPv@{dJM+U@nBW{
z;Y_7_ETFw$b|?txpWQ+uYjjgs^en^JIc&KG4tceATBWqAusl~#`8I?iQ?Cuz;|w1O
z^99l)v%34WLV{;mBSP}1$)$!<DX}2WS6JCI68-Z`Uc|dB14#gokRYkmVSD%|ZF8AV
z_E56CU?q$w|5*S&DqDEH0Q!odw=K@2tsm9Ng4OS>PK4C)GtLKPXMpT52m;Y7324>(
zU#y)bJlf9x-R1&}nHYmC`@l@>r@1*@ymC9H@;DeoitGf|TVJmj9tjPw+F#4)Dx=&;
z^c#tOzA%S#HFTnn!?7h)C>S0-j!RCQoM#m&Pie3AJk;V<p3=~3+R2;d`cXW{7c95j
zjc`~SoU_7mTc=*DUmL2Ubz05wlwSaRFHhBR=U;Izru;BhNp}u;s*aCrvBsHY-M>b1
zY-uR<R2|Q%({oRHs>PlamKnP62Zi-Wu#aE9kvyc`edxq*)(|oxWjn-#<TZ6uzR$9S
zL9SkOji#mV2V0mUJre1yb`TdLRb`}ouF1+o^Fw81wf~>4jCi4;NxtlBjm24$e7Xfq
z+o_Rfubu@19%9IE1qy4x1bZ17luD9G;_0)uI1fxt@8Ayyg>^_<pJRP&tr&BdyH>&K
z<kwQxM<6AZqHjm_9ZPETjvCpGE3Vro#XhDklb0gNknB#u{aU2`WlcO?Xi?jDrP_m3
zd;Aee?x)9Dc&F@Kj~IqQ7`##qwqx(VSfBcwYkN_$07v-Y07BAFPP+NMm{T0&bg53u
zOmfK{V7l2bxNLsk3OZRgY$?@y1(J1f0xSWYRGB^sW-sO{T*1xnIhL0sEB98ICd)b@
zx6io1NswTG;5T97dD(CxidgG<Pmma#T9r&o^9g~Hf1+r);d4m<NiNw#czbU_3uilu
z6ec;r|2EQ5>mJ>QL0v@pL=ARu1GRhctX-tUnM(~^=a<{{Q>rt4PW79p!L)vb@R1;r
zd!j~XBbBF#8Yx6_Z_Xj>ky^*nV7b{y%jRPMw$1A{A0vfH9!F}{j(ns*$;W_^a78&L
z*l|T|ov@B9-z?z@YHv5LiEU&#;2L{&RSJ&8!Y~sz(<;=qc3)~dBYzSC_B-=gmAjw9
zP`bvz8~UqZBgu12+oPfN(dby0`FxhGHC&jsY>0JvI;{Y2qP>d5L`0%dD^2)5?d53}
zyla>xV!#{W__$jhY$Cw=>`d>Rol$ZFAq+#W1Q?9D|HZmZqer@F$FzU>@?bKH!IC9q
zSIMrCUAj-gAtjfHq@2oh%@2@PzsEorK&`QsB0eVU5!uFqc4wS2DXpQ8^A@C^uSD~Y
z^`6Zic7)qT(fe~O1`Tm4{hS)gA_+}L{@+9HsUFZpA}@x*8>i~U6kB;B*ppXg>>x#Y
zCd&1_!!SSC<#k)l66y7Y)|o~T+Bh4lkpRSYeaJro;6|4WQT2u1hGvUvt{-Ox1xoWO
z-gFE;iEUp}hIwjsvL@>Xk#ysT$pc77;lM}z`jsAF;Eukwx`{|43@g{j|9;_)HTJ0c
zk84WHg>c74L#&%dvB%J8*Hs78kJjk+IY!0)5A)<OBvxAxi7G!k&FAzPY{DI9kGmzP
zm4OmW+A}unAh#Fy!0l`bPJ1|DXOY^QL<OL#mvZb3eMN$lEq}SEAk`x~bRiBdo*ngf
z08GP++v!0b)Wbf0H!8IOQDmjGI_tPDtu6ek)2YH-DQP#;fE|&MZUZylSRb67OAf;z
z3`DO4jQQmL7i$#Nk5;KPQFmEcE<%*#&5Q~E^T!iD$chh=|H#3(jq}O(#MGs{fwZ!K
zYYcUijbIVuA!~us<%EMEE-UQZv?bzJ3A|~-DU90pVp^_JyJ@S5+~jg)*NCjuAL?Tf
zpK?C=e&YVi4x-o6bZ~J$SE)Z)qX&v;K_Hct-kp3A$OlwZ5Xi~^FH~m-N;oSV5&ZFn
zdv~4iKubv==|>H;x(Z;#Dm1hcSAR5wbKM`g+y5vAxRIA9;znlkmGbb$CmKg?q&*dQ
z%5NkfWPGIe@`1K<Kk?sI2Ct5N-%qx-x}amRw+hBWa+JKg`|fE}-xD-)qN*TlW@~H8
zgFOI^<gKJ39{8+ew>NpKWoNK~GlCH4u#xm)EM(cP>Y{(v2^?7&m{xNVSgq+6yACi{
zsopCEa>#)l$|4pej_gVv*_A+YjPwtU;ctWqB+qMHei_4}6>Fjz^*eLo8cW2|)<M_<
zB6}|)5I_=d#EY|Y!9f@VqTrRF%Pw&Liy4(S7)@OC0)$f9l)lgGIju2IM~e5WvxX=g
z!W|x6onGKW{PQ)tXaDy6VNO_CIbn2+!-Io!Pnl4LAPJqIf+twSi-*vb+J9_piif=u
zGb)`?M<dnGIrabML=hUT56<b3u7=vvu$65rq@KHlb-chj+QK?!BY}mK@4|h<6G5<z
zG+AvDBsXC40h4@wfEi5`E&n8xAo=n$QJ^X^<N2RoiIGFMZ3Nm8HH!HwPD*4*7UMwQ
z%dU({pSFRkRX#nxs8jpJDPxi$JGqG2s0RhW)=~x8q(Tlwh^WoCO@+;ifsJ$|`3es`
zY93UE<!Nyv9T|##1!U2fSby_|Hk;JJH(V*K64FoPHd_M+IdrV>s_1aAt;6yULWz(r
zH?m(F<<~*^rCUi7q*EFfHbL-BKgKWGOBpNH9lS)KS86_vDu%Ts9gBR~5XWq(+jkn|
zb&M8lQX;)duybOTVZfmB{;5{5Ym?V2l=>FEM`|tkNCqzHzFIfZ&TdzM5QxFA#0;}P
zy#I@7R{D|X$>|#Jys<&Dve42t=C|fnNg`52dZhYqOn6Z4j7eMXgTx2|;h&#0PsfcJ
zhd05GdQjw+%G0d0sZS+2QhYawqg+F`YE)4OsixbZ7ts>wcaI`@o%SwFL-8sK?UVC0
zK;*Fsh!S>$@rxCAFw)mI!RWxnueziM2cwIBI=Br{3FFK!MuP%5xL-|oBc%Ba2B1(O
z$ztt<VRdp#ZXr>(bPyDTR@bCwZhiBUw2qPuB=K8~s@!HPDJnQh%Bw#y6U;s_9TFCs
zU##OL8IsFh+!_;k8~!1}3He8Jw-!Yk23{E-DDP1$zVxG#HF|#=3r2V^Lsl-w7$z9l
z=r~tVf?dIq=XnVUFyw@B_1(XHq)484g$6SJSSfLquC4qK*0YN{xa9O{gSM~wqWCdI
zkY{p|?QIF`eoQB&Rze!|$7~`s%Wq>!vSbbj^07qZqyftBKrliglSBlUDm#h!e#TKJ
z+xnj&(?2mEoSgw~#V`m%uT)ZKlKWq5nl?Ya{{Nf1T>zn~5Ml?LNcMNa`|+XfRrq-n
zn|1c_X~Ita8mT<@nn<z+vYa75@@u0uy6jCh#ZK;l3?^S`P;}eJxyT6ER^>Z_HtUyA
z5^fS3hiccRD_W4%HYRo=OY1(ttHUS>snzxq1l;6-Cw)`+6OpjxhnfTzDF(G-<b#|%
ze8XfXvLltKgojAwzZ24|Lk}<V<gi6uBTxG*DtjkVm$jHe%46Y`H|*MPLQbmn79Je;
z#m^J}$2a*T2;!}Lt{?N6c|RXKm*kW_s5bn~Zyf)kB&pg6nNj{R(0)?E{jU12`qw-X
z7R<;xUIUTQAR|9z!ACCLu2%_&UXyv<-_sLm)-AFnHZVJAMr^ytoZ=)C)xrkps*QI%
zNSDn?cALD;H*L~Ks%Ho?u-*#1q{CY`C!8ccK6S<X&tcM><my9!MuHXOjYFW|+%dcf
zsUmfx@+)!)FFCcbH9mbgJ~%sr<cdKUhF+-#2gCg@)=Y{Xo%su;-DUGV{6N4)mb8--
z)LxdKJAld3*W0iu+cEo&=^}~hs}qjq+ENDRwJ;J{)=ssRU(m+2OFouYE)v@|YpGb@
ziJyX(icP_ir}9@@(GmN3Q6u94nXon6k)A#%i{F=oNiKEEV7QL9`>O%f$Gh%8EGdYk
zdkgpkkUX5P-?P^K5b5~#Qs)4bUkjkkst+ZA<f0H<!A&IWvC(`aKzAZx1G-~AyOIS-
zQ-I`D`%Vq17vE1{q_!C}g+~r~E)r+ZmNLTsvy^$o&bFo$|EhQ5_*pAzN*!+%|G4$f
z0;E}rqtdi>98i4X4llC$$K1#2+#^l@hP1NhX>>%AnYn+piUdPWrQ7!t65oUVT}xz0
zV8}vtyu^iie*d$K(%*6bLlz86v?HTvcdg~e1Ps~mV`^yZ;2IFqk4bq+z}QVub;i&R
zP|Y@6B)rIrjPfFXgB?3woJ#X(q6r!e?f?VQPfQ<4D_m4B!2f%51F-YAIFn}ANqIBA
zDLWV2h+!CpuH=sx`}SX~z#)7tE<kx5AcA5CiY<y{V^+@EYApiDWh`>gOC0nPXI%{7
z=CkSM3&*Pvcyu&et45rctJe{Xr{MZbf<$i~l&ROL+>SHwO6M{e=TpmQ<go}7YKE|)
zayIkht?neo{W2a)i(6(O5=zub2Rt(a8U`Vc=7XawYX28eu7`5O{#1_mA_|9Wq(|8D
ziQ(B)E{=vD<zLY<ps_4oyjIS~;G<!YHTz?2(r2v3)E}f(yfVibXzbBTSV*&86JJ5I
z1#ee|H)}QetqLY2qO$|Ts?$g=wVaci+uFyw*F{mjVwHMcCj;wphg9o$9QzWovgown
zLb^+?W-Eqkik*ub85w&N$f}x~EZ21HSc<AKGWJMHa~FoP$lkYC-Z`@p5RF4zW1Hl!
z7Jt=h7>zMQTE5Wsaz?#!Mjh!&Uuf^=$Nl_0#S{;s>iy|_v4L&ilVs-$VGLOu{jdn@
z<?GQq&lG7s*9l1cf9q6#De3>x!fG*+o^NMXQLi7$&H&3n7zCnMiV2W-|BLOu*7;Ps
z`_Kb4FQgc8U}hdghu)u9MYD<NJu%Rnz3kpNw8#)!#w=3be<AQ+N4KtSu7-rc%fnR+
z-TK7IaY0hHsT6T*d})<^AWwPLKe8YeKvJt$LWCr+2MvlpMp0^cR#$U!mnQO_{zbA2
z2rn%;9C6kUrKQoCACqH1FM&H(d-A=J%UA;pfHvwwg3PY89Kq;d_mtNzZ}5&e6E;tl
zyl7*zxfFW!p6+7?MyA*J+lTC)`<T<7oWXnpmv~A>%uydW2w>o2rUXw%G@Er23=lvu
zZjayhBPLbJ<%z33dF<r8l5hKiJ@s3C^Q~;&IGU|)adnRC6EV`-&)sQHa^k1x)`RGj
z<6J4j;PM$5=PcEg9rEM{H8ip;oN)i^|4xIgf)wBu@2QJ<BeeA&wRqQrTutV6+#(yv
z-2`y_KCsTCTS1&|2?82G5DIyLU}Igz(V1L~CfVrMJ>6QVe}8ZzWkW^yTC-YdoTK}p
z?2M8e24NU_CBPVx`(LbWiXJ<=v!moMKhe;H65Fz5?*CdfKSApMuPOR&FS&t~zu(=u
z|M|NUg+sSPY`x4gBxIBN&b7okyvWn~dY%pmH<AJpJugKh<>5Q76WL@(qekq!Fk}4}
z3=*=*A0|t<n`Xlr$-g_%l+osX;+RpvP@F!xOr*iGB#TOJI7Kec@R@;V%J}-XT!P+;
zf*R@Mv_2`x1j)d@Gj#0MNT%yekCY%Wu~V9`F-S8%GY%aR2YB5>(ZmSMgHmqwYnlv2
zLs3FjmpWChPECiz1W5)!K%K7D-Cfg(37jan)@XR#iZ}mx5>1KsVqiD$zUt@`>~=yx
zS;U;K&dV$0Jz>voAmLM@3<J}pV`t+QCI0>}8u;nP>wYJRr0k+{@PSWk;C+6HZn7X%
zFUp=Xko5avXNsd72bSbSa3|#oUolUyl%3A>_m$ehD!fVaNg<OX8z%4^xr1`W=(eRV
zF>zHDe_)j~$L55604I|2P;^Scd?DV&xwiF-v}?;j7=~e2qD!2v_rDmZnjHi}2Jy#N
z6tOjH>({0>b8vG;(u-vq&bu<oBx9LIaXD$jSE1sDmwAlolW~TBRzxN>IEI|eOYxO9
z%mxG|*$Tmyr&jDjpJGXgCZ)I^$ef}Mf6qx+GCH3xS9`}vWaDRa+qDi^qmIs;<v--D
z5<plo6#Ev6*z2Cso6(}}TFIEbGHdtuHS~S;M=imU!F_EG+G|$PL410o1g8|he0Ehl
z{ylzCXjSQZl7&Nx?JS~9$nih?tF7EfnF`1mwaoy&a3_FJNxAtno`lhb{FAFsaN9<s
zE-2ArFF5B%fa}LXVoFhHo55%dXbV!yFF8phmHha4yQu#Xd2?qLno7!$Y~l9gW~SxV
zhj+Ba8t)Qt9&CORZbK@`W^V~k-kp5Q-h!N3&o%#&rK6o%#ha&u2RB~e;buj$SWN~b
zc*cvHAv?M0`{6NiahV*FO2t7IXL^eRG)S4R3l|bw!jm}B63NggVSqI+ZO-zjAW_P^
zB9-ryon5kmFbsvaRN5ph``?&&ulX_#BM07m@mNrslANFSrxQenxb1kQ{&2yh66Vc;
zl%3$Blr+f(jt12gi=stK%Bd&sJx3uispPp9nY8(UFg^9vRm`6KMlv6IO-O*VG3k>#
z-msHzQdSl@sq9WYaq5X@#)_FFO9VNRt=g^_KNGilJPzplG_Q~X9{<!=w?M+K3`&?+
zj*vWkMS~DHuq#W;D~mw~PwppyYwMmx<>M~<r`}J6*;-QK8cZvFmP!E)#y)SW6k_XV
zq>?G7#Pt@^I3Z2uo}@|LLV`Ah8%W#Wsq`mn@(VSG&nNdO&RJQ`nyUHk`n${DI9jtY
zT6qkWgOc0}Dom1&OU==}w7l{_5H+o2j!svxA~)|Kb<)Z3VxluOaJ-qiF%dbfB<0MA
z%-g9^I+8GYKkMjn$NbXK$;yJ55~0cG{r^arDZYkAGLULbflAOGAo(4=p)YxCiW*ls
zsd;Fqu$8v$%EA3b*_q`=2m?X%O2$jMegBJPG@)LPltfMb_-cW{*zVfyO2jz%1K(*m
zdC;1afVD`I^dbBXnC$oN<ar^qlqZ?*9&cs9Og(!6D+z+_A6ZxWM<M%^G-pBFKfd?F
zWqN1*SsJS(c0sHv8VF5lY(XPU0^#?#GYOdUE?yNf-6XKi2!lBqwyle}>QOSU+cS>s
zWppw;OIDT)Q-&MLfydZ^We}y=iPGT}+w5imO`2BjC=Ug~;Z^WMj`zE-ADsvL+Vwr5
zqBJ>Rv`pRWSPPZbjsmM31389GVXnbmpw%l=swf9!?D2C2-z5?&W0h<9SonwObh(}w
zt6bm{3w&a6E>Nr2xWp=vQMHs&p<Ny&-$*DaC*=MKxql(-(1Uvtco$6_jCk-Jc#tZr
ziM4|fp-Dc;>k7=|!Mh7GPtESxtWCQi%c#$E#wsu2H<)Hj6RGGadtWkEdCBL3o2Kwh
zSO^>*%Xhb6#JbNg6I)8t(O%CMB$b-rUFgMSde7{=embzqLo_V?I9MHJl}XkdAgp`&
zjjZ$EZsv=#bHQ;K2BF}UN^HQn|HU?{^oDjD74KdE*@;6ipEvJjINT4ac-oZGIobO+
zRVc?ql9Q$v97+GS3gT2mQ53b&b2|D=g|AQaQq=}zX#;Z<etxk859DdHvBVH%Fto<*
zrb{n;_Moy*dD2sVxa*UZIR8VpxI9<Crb-Q#C3V7=D3AB&F%U5Ud%^hI^hw8fTceDi
zg^I-2jU~_3uSs!t0zFNu=LD^~Z4e9eT@&Fe24F2!%YUj<be8f1o<?(@neu}h@U(z7
zIh;GHh)~zTT-%JHK;M-_x-q;wP}jfi&Fz|A^j+m8O$v$z8G0wqVVrWr@jGJ5!4#ym
zom8Q6W#y}!0meAg(UGIi#wDH`{9z!9e*!Okw5l4B^G1>l^;*SVW_=`(eq+i0WeG&E
zm-kh~L^rf=cslf5XRNQ5`tt+=2ep^_Bg}vh)n_V7-}Qu9PHqV0;nBm!qAHlwzYXND
zA8UK~JWAj7Wlhk%j{L)#$Pj{w^uk2u+wOiSJGUeYK_G^1Ne1bL{cr4AGv;VXc{BX^
zV~Upo-JQfB)pxr0V(<1Z<5X@cExt|d8EZU8>@SkKf)q27l!q6Q^1V%qbJwBQl34A~
zYhjRh_m6;DnS(l3#pB9QqVE8=`yJFu$OAhyevPbgYqq*8l*Ytzhsf7Lt#2rWdD5!i
zX!@S29iz^K|BI%7BYoQ)N-4~<C589b+ti+8q`TZ;A$e)6P!4nUT3V^j4ka+Vq@vO0
zu2mH6<CC^~+`u1a;DIQ?mz|FNdJj4zq9>K;30CM^T*fc%ERfqanZ-k_;3)4=Fvk%)
z@@9^6Nf~%^oZRq#LQ=VISj7Ht<FR!$iQ{A~oCbAI*_r?F>RO4&YnM#t@udGzZ@638
z(_kX<isJ`{A9)1^ElND*tWXVwlgU5kEQ#XiC(Er{D9xkv*B+re>WPdAx$+B)ADA*N
zW}$SrJ-tlAY#+wX0M~&K1fo|G7R9~)#oGMec_eL9ya2HlS#+40&p4#>1q_RMX5Qst
zG}}nD+Sm2&h7@@hFRM*wG+wdIeO_cp=fEGbKNtckw`6d(2pKk1?q^@_(~5HzKUUOp
z&JwT5yM|vhU7W_%rXLST6keTcsV@kzdYlLw{XbX5dSF3Tg^1dCu-{M?luNXaxL=->
z#-dc}ViWiUg{gjIw7LulrP6s$G&Ldf*3{Bk?XXD#Q=%2(XodJcJ?4)@5&fEAoB?=N
zq*S@~-qAaODJL-Hj9Qaspn9{P1g0DsTk#<!Z8z3r2WwhCO(HaMv=8>Fz#K?kdM@!Y
z47Jh!IuuOMpjeK_COR*>1q2eHa;SxjrBj!ea(o}06+~Y#MG7?WW|Z$|`#_b5z7lDo
ztu-+UK8oaDi2tgX0okM%)lWoUp$i(YkZrX|yLTf@EGY*q3B)sl3>TySfM4@n&oBUD
zU&@AOdWMPY>zL5$G;*|4wO}9QQvsIv8sggcig_Aof9@0HCGFFLvU5p75C($il?cp-
z-2Y;t(l1pmY~8UMgBBr9zn*@ZHC!d2L7{$;Y7E!5@|kT5r(;2b0qU28{cPZe_Gt;A
zLHS0nD~MQuXD`grRl=2{qf=xvl!P~ekLzkODU*>jDVgzPr#roYpjRd(;zuWe;c89%
za)3v$JcF4%V45jRv!ncPS4_2MVjot&P+KX(T2C6m64S`4G(vClkrox|0H|uLqhyEt
zx2E}RO{7`;uqFwXH*`3F4)+^66mepAx@E2u1rde#@ejz@2$paHN}?EqkozH9EwwT?
zk(G&|y~xSFuKcY9m1L~iwP9XYlS=j|zMPfX#Bb-wPEOfzr-Qjl#W>Q$`O!E(PCO*O
zQh$V+YZ8>`hi5<5)sXc}4U^KL=?!karWsgqp(R;Lf;koh*#bmzS^&KzSYDsWe1(9c
z8X%shy|Kc0MgwQiDoZS$wfi;gUq%2eYU!}JcQg5w2%_s>)Jn%#mF&|m!4l=O_0Db0
z4w&V?BYZkUw6*^4)TYLJABV5R=^LPS0@TiaaCQb+5`!QRy;2kvx&Or`Z+iHZ*S)}=
zohzOiqDVoNQq$!x3s~t>b0S%q8MAv-e>alc=I`Y1D$PBhk$1q#aIFs2jkV5K2Uw}q
z#bZu(zT<$Ej~%BhGyIDkPq6au+y9p1s5>g-)1x`rhd*g`GfU2nERD|{7rQBi?5&O`
z04pP}fc9c)eECzypUS`2@$oAo-N@#@22E0{1r8h**vOpKJrX^}%ok?;N&&1yROTM>
zRyA3w_X!`LPy!llO~$LYjwd!}c*=j;%v#vt1NHSfJFqGBma2GiE_Dbld)@TyTdI9n
zT3FgxirNxj4ipP9@h8U%>e~RYGT^ukq&5*cZZ+)TTS;#$L26-;iXFs)306K-xBfxk
z?TJ*%%xdo%VB6}w<^)IQz(psmBF{P>2TW-YIT{i!-!$$zFeO>bM%J>?j6P~*JBI^S
zWjWWyEuJBzuNr6os_Yl!2zj2&?kcD(&t0I(E_ta(X(luaqn;Dgf_IehL)jT1HxR-w
z@JnD0WB&iKb~4qHX_M&s0Syp>&z2?syaH-pT7A(><Lf8Pr0i-K8%(>n7FHCkdnD$Z
z;rg-pj#HXb{)b!4@Mf@(U;?$Ry^|ZMJmqgWV?0)&_1JuAlT>19lfOrT+2T^Q^K9d6
zCJq*qvM3b37nMBH+xu&Q)KPQy&`hy4l}}XIs8(&fx1Z?1_+3%(?o`gD@4>~wM(Ywe
zIorkPP+6`fNI9$^vXEBN?WAZn6wF3l9%j9FRmqvyey2YnkvR~9NP9{lzx+d8jY2m<
ziY;M>bi+3k$c3iz?*XlL|A62r<sdqqnuGrV6Cd4cRFF(dQ59;+*GR!H=8;qz2{FPs
z6{V{$^dWYLP>H6TB*>GHm<*80IXw~&G)c|#ecYUry^nam);LxMK?xY$xRn|e-mfWA
zFj99r79UqP{v*(oh1**Vj2cAeK2~Rt;uN^qojzyI?!JRiSfq{uz0t4C?xNq{oruaS
z&d@Fi*S;t_gWQN=7zTbRc4UeE|HoPY7D4I06yT`nMcdn+1jTD4HYt)>1T|~VJ-vV9
zbz?KNo`v!Mn%Bvy_?=yeC@CM-vOZX+LnVMRLYB*fN$t^JPY{*z@gcV7LcV|X)2*=*
zPziMPPC$2bG_$5wO;oa<x+m<(<300=8wm99Y`CL9TtADlWR?<F`9vnxDBxXlon>2u
zB&{853^F_N84p=9M=1b_2a58+`1Q^^>1E91X>|u<52j7yp84S%lC#z5_6xcV3Oru4
z)yA*g(_zr$)IWMkFS!4?gCgr!sC|rAQ9)70)1mg>OV}jGY^|pk_ioS4?(lr!4%1u_
zBX+O1y)mhT`aFDPix{tLf}*@=S8mT29(*X)Txn5>(H?;A_O;Onl?ngX4sWaMc$54%
zyiHJ)m0bzdA)!0<L8aE5nOeBeftMB6yvI#ZmYFwUA$OU@za!x-6O?6XW?e?${6UHN
z6K;0$7$iI1Na+`xM!Piy^o=#%{&>sTtr>f6#<qdn`X3*=Geq9jI9(#MlBf&n$1UfJ
zvopwT7>0r1mn@T_sQ-VgP2e522~ftp<zy&{WKi6l<ppMMYRdMcNtBF&*9mEq<YK$E
z0%S>&s=0<qlr-vP&)KgCN&(>TfB76)d9VJqroo7$CwtUAX~K9L#FE2P?;C5vT5^)J
zOl``n1b<La-ILZIJeG;28`e^J2~o*)*$%ak3}M3hc{j;e${)rVaUotqQ?liRQv&65
zwKjvCrC=9CPp~HfWwCVgsC>imF-w<0rZI^qMZ%spo`bPO-I9~W{o0sBXMcL5`Xw?a
zxPs)I6k7Mb?21aGBG+1HWgWVoe1B?pQ^YHs@3eqtaC6SxuZg%djFdwY*l(phq$Enm
z;2ViQArpG06*y87<vC8q${yq)Z0wJ1CPqr4Ec@d%w(WVVAdEI!#v~<C{`#Hj+sQ8O
zEsc>#lw^SpTO?5E&J@wtr%03zLE~gdJEI^*zsFaxW=wKX1sB6=9ANwIT@{y!P+h&(
zQF-$He+O%ZkrMj&lEFWl!Jd*R-87|qPG^rBd%S;(KkAz=#?C0mK^O+2R|4BfocmvF
z(Ju46qEgLYzpOTe5N5{De|!yzr!&1OE#i;;ibLxG<9VVoG8xEwvO<<cDS}@llj^uK
z*SY#i#Wy~l1flB_Jy5+?k@ivPWYPf$p;whk^sesXh4lhjw4HvJ`2p;SWk5=`;<IlQ
z%VZyyq;Es5Vpct#*6WtCD9w46JK;`Oh{ino{|=2%FPNK1HQ|?jykr7}wF>wqF>mcD
zbN9!2*_7rw&tGr9bTNwrICo1%NuaRwvYXGM0@o__mCna15vzCQRialt0K#T<vdAC6
zq{=pEnldN><2cmZ$)7*H&EqCCSbkQ@H5*VU=8LO{X_b;GIK?q6!?S<HL4!59cxEKB
zO%jaRi!ZdOq{l8>k};_&qHU^AaImIKNc_7T59Y%6qNgm%tC9vW4^_GosD2;!zE|3^
zDF>sW$CQ{e_vB`4-@rFOSWj+|98^*UzE4o?!=9CH`OA>Me%Gn>-#0+m00=uIQ`GR4
z=#NYr%M#_&kYYWw0YtQi)C~|8w1NfT+)$6sSG2+pWoLlvFbu-bD-}qZaQ};Kn&OxK
z?Mt*5uqfJEz+emMNAAHdHhKq4{*63goO7@PuYGf8-~3jdws8*J?y-^l0aDWR__vwQ
zlF*HHvsEBLULtX+mVR!l8!u7p3x$DoIL&h}XYpys9iPPWYkv5#Ypjq|m>`pPjVa>6
zv$cPaj4UDCSl(zQ<mF_9*4y5~F}85(m{fcl6oDbW%f^dY)){Ana^f;EkZMu;Y_-T~
zA_Z$mMi}A~&tk&YPf}8YjE|fcOqC^b`u6qHTVM!j8A!w`87m|%7hw6Jt>WYcBFmOO
zogG;0OUFf6q20bkO_7&@(_BkuvWt~Qn{}R$6I9)$FXsFIJ2=y?v&8AbK&S=9wa%}p
z&-&R;WaJuK704^-?z3gtJf|bOhL7U84Mz}_%^OdLB$X=5;43~l+xb=w_EXd)OREQ-
z6=L~6fCbFuz)}-JD96Ee{)}>mAw^zx3<73ovbT<vW3eq25;pOY?pv5nba!K7e!?+C
zQ?JwPatih5#rvY{jB+A|VIX>?q;}H!{ucwm&U3YZru^|$Wv#R!ex8|MpOn;zQ85Bl
zH+RczGu=w`vaRX#Ioa7`l;NKvva=dq@SH|F_8<_soZRB(9#orPDBrg($R+yWv4Bl#
z2|VxuF0_?f%9B-!;=4x2C>*v(0++dUqMVq?oeUj3FyJnM%g8os5!%Zl{GjZVUnQ0%
zfPx$3k@PIWzbJ{Ni4f@LUpfbv$$hjYEKSh*T+A+CXd$ljbz0mm^8KE2q$-}<BK0D;
z@_yq9;Jh}bPi3iWIKOCA>>q1Ne-aQ}8Qcki%$aCZ@Sx)L_pkd}$>TbSV%|fe2cgkH
zXtaHQS8wqFn@JcCQO~xQUgDSupL@CI9=PXz4`%x{y|y^Y8l+4)aM|*qb#<ed^yC*k
z`PDsn`_i?xlF2c)z`s%}i`2@%H#rIe4|>g>6BHD)TFO+&(As#%e=td{EOH%4e2+<X
z$@CZTPOa4c19R$wxtG>-o_5}=HZn8<3j})urG0p-wc2gyjX;Bek%NJe56aF3$3Ykd
zqE}jQoY?oj*rHYE1+^;;y}$@4#g6A=`wHN(#C$|~I$II*kAP5DvB-{X!CI;oHif@M
zVBS(Up=R|Kg*8F+L>a598w6xD@;r+|((w`(Gj1u@`8ege#ayN=2dRJTk{sTzcWc&F
ziqIj6j2wgTIR-7tGH?k6ZlgRQWDkEX5oNh#?qQR9VHYnSLD(WJm)fl*)!_;hLjLy>
zTY24t7_Whfc_b=ks}X3im7GdBl&(QTY8^B!s&d_~M>vx<@<FG~)=D;STuAiVe5t2Z
z95u<WQ%2Zx65EwKsc(9uo#0J41OAtxf$$?Fl-@bsk-og9{><H$7W#!5FHD03Q(1aW
z1HDNe7_wq|BuQaeS5*Y2m%5`1(!SmVzZOe@pcgY0l|Q}EyEjq!1Gj_(hMW7FdpM-e
zS;+y8rZ=axGISxR+Qk~AQxzoJACzn7QQ`3=yuX>>lrJK+srX5L5YJoHdip%7-rFlt
zifRh*)t<n{PWitTI^J!^znq;*Zp1JQL$74XUoCq7Yc*)Y=c36#li6h@SRP}XkRtiI
z5<F#LqP7qeX~JFH(pk7bP8n`DLhmPQa^_Y7QME`IbJmm!SR?qHR1RYOofdIGwE6>r
zr3W0kvM|Gp^^+F_%$C3V1$2(!l7<CMCw*g<RD>2#mP2AcAF{J>a_eT!R!5LO%y$xS
z;4@$`*3FI!5^e%=d#?ElQI-RSfe^J_s6{pq83hAaB3Nuku<(9T)11$vk|8{87_WDX
z*BKPbzTb~Z(DB@vxY8~miz8KfM-gEe-v0OYXGI?QF12fKAMR3rUFqR2jZ1Ua?LMCJ
zU7A8Dr)JNY(5x6DWO%|+=RDn0kZC39cU$)^8+m8v;hsAM6T_aaK;)KMh(!@qIdP$y
zWP`1_-fvB8C9O?yjO41n)0o|87<BEniTP@(hKPdFa&Vt45jo8TO!aQ*(cZb0n$SI-
zG!f13Z#_dwqU_vCcPf#`*wNW$w8>FvPYM<)*+*;Ae>X49RU?O|n_T_+X6($8BL-n0
zdL<#Sfcsx89#{G?m3*`hFe;gC3VQoc4t+~tl_bX_*wp^_y80c2R-TEg#7sKZ`-#I3
zwi2n{f(pwqX<Z|B;0HU2IG7Uqw~6nYjd<N5q!MN|0c!7`6n218GHJvlK&*c=XTm7E
zlBdTK7*Gvf{fAoN3SEB+b<|KPb>&mr)d8aH2glQWiG0wzBVP#`6%4u*(v>NecdxX6
zNT@4&;6fnAVz1=urk^(SXP7i3Rv1eLpk@8-cXWh00Uo4zYv2I33KXh<8pIfZn&#E)
zmkFUPZGNIb*O5c{eh7<)S^%%N4-%)Z<@*_MI)x>$L2y`@+t-n9n0&D@q^Y<{Ht-dG
zWn=!DIzloxKuG|U_+t%aB_@==zkh%dGK=3-TK{{}vG(0l`f=K#^`WocyiF3@vFwxd
z4wRKSAyR?|pNqG>OWc*Tx|38-Dvd!p?0C^r(o><Y7W<jpj@sRhxB$wbVY(X2sYwn~
zec7#Ygq3;^8cU*s3Y3iY8hBR%pFG6%iU0a@JpE91M!5}yKn%SS8DIwPf3dEb_z^W*
zx&6yeEI_+3i^ujiw_JWqd4qKP;~tPMVUg+v>6qfwKah0Ujpm>YvWYN9Enk_6p2Yum
zYKJSj%*qZ2f#qBuD7t>#9!2U(J&q;vcHu&~?6W9NGF7rC1h?8ZRxG<PA|#i{sJ?ZE
z^sRID+A8gXC`K}g7~iTOlit~7!*O<-glF>+!QEYK`526BexXn9LVz@X<}TF3S8O6A
zU%3rWBt#uL`mbNMW)mTq=i8qqOw88%9)3t_D&ZnYIJu5@sD*)yL<zqZ?n(^@5?}Zy
zN_bTxW2!xE9?g=qv%QeiP%;jUIF1Q5T3^5Oi;ql+Jd?CFlHvRIH6(=OO<mg)+AYh^
zZGO(}wB6u8V%fyqP*g7Q(eEBR3Uv1_G#3&|oWdDLH`9TlGM2AM#Z4ZhF(D^T+sz~V
z?5MRN$<eF?jfFlgV>c9)Lu#|v|APpPzart*Bh^YI?+V@_QGR0*NBPT`h!yecRHVZP
zZ8vO|{h3ny#n`#vMhwD0^hy|r9pC?ARin;Jx~q2f0I?vL1m<I3mkGOeqA8!wuJd+w
zB_<L3XM(3pWoA-=GF#?{Y>xurs2s?+@Sw+lT^!p-s{iZ(_Z#2#_avTjZ<Vw?GH<)d
zVs<_Yuq@2@+eUGj7fdAal&SjvspD3S{P;v6j`9&je-wnA!)Bxi%G8nVF&3qxzyFJz
zOlh4tBVqF|kNo1G9J(QGz^Gb+km`dQGSsAq;GePxzc8Dt3zrL|l-}?W8+;r%;`sIr
zxk&XEDFu-R{cZM~K9Xn~2=hcql&Ib77=Ct*CjeEcYEbWndT*bMjSB~m{4OGxP)Y4K
zhp0(9TgE^S%pIaK?c~Hvt|=wZqDSTelV0UdIDI!e%h%RowF2bMf3?L-(z|D&b6u^^
zS}nifL`-I!6#b$xc&H#o9pzUpUx(C6@LGJ1Y)hIR;w5S3op|VqopR3hbAz~vH>pzy
z{ynC@Z1*jilK3iw0$tBb6y#n~h?b-}ezE>4MR-^hcgLXFs>Js*-iGr<*}2#@48uTl
zC6oGc|HaZaxhEhka_$0ztwa_@9^Z9)6vahdTM5ZaWb~94U3aBL6<2$A0*jhh(oTxx
z)4$sxbVH%nLED>TiDNhgR>iTU#O|DD>QH*;wugUUO_^e1_Ymk~fY+H86HuY1<mhA(
zi8q-Bm+fCW@TW{H4H6@QoTzu5+N}bM%53nNHM1T$$NfmyRHlxTfQ<Nxc{h?~a3J<F
z95{pz+-XZ&afT?Ra~Vqq+#-)$wS6Sz+YDeN1JF73Ey?A#uKJR_AHbf@5=2wmZ{48A
z4Fcm#s$I-t`kfnmw^0`Y{ZcYI!lwUm;IG2=CT*!i=+v!?%vYq(*GZ}_=@$w3>jv4n
zLAHYW@nV8F@K^QR$4+|gk}2-*>y(QWzx`j1$Q_5QT6UYLD~VE~)Rro4fZb*#0r?eZ
z{F)5&%}u6M{?+;)_cj&EvkoWO{&0*>UKpNU8VL%VpnsmzMUtFEGcznwo0z%w=AUT2
zFE+I)AmX=H8)mnP$!$@c`iE^(h5C}E?rjOm@yxg%oSh4910f7VueAPv!~HMTDvh6`
zRO%$X00Oa#!Q*+pKau6-#t<bvC{*s0%g#P-YcF|7B24}%xZGQfsgZC7UqE&f#T`_T
zbebP)adMGz+0}04T{Yb-<iQ<ajp??B?7Fd-mLz-}i}kuX1OIGz0<82$8Qe>p;O(eD
zeZ$G?=+)7;uh|Zk7u`T%V7xODefuy?-C~TGExv9k-dM|%F)=R3SkgyaWXaPzu?OSr
zho%vOkTrd!NcykV%qjmhCyJ(EfOlf5$WH1};@2qoGD_U^wKM^j;0(yVPx`oLrHSWQ
zQq0{U_W{1R)2Mw~gUesHg~{*Nw)5_W%~jw5^lySNd3c*%-9BjQ(=-|P7{<vbg7AvZ
z3Bt!PPM)a?kFjwrEIo4X7H9`2N!5<0ph0|;%$8a!lwOccE1+bzwd{>LK5LcI2~JLQ
zdaUzjb#m`kyw1rFPLt2(#KW>Jy>>tk-4^1R4s=MByJNVI!j#jXR?2X;_{ImxKpQwJ
zFqVXA9BZjEtkWi6jGY0h#2^eruVmC1z5m6wu*{QB`OID*6f3pPWb#JP638H&)u&(a
zSJDi|WnSsjR+010{4$7=YEk>;VHo}TDnl=@hY&qww6i&s`qa+u6HclZC}VM_?2Mu=
zdS(je)aqOTm~xQg96%SLoB9OqQ;Dy)egihWu6r@FqP%1RoU#X`6M0>;ZGHo+ogeZk
z4}&_}K*dv2*tS%{r%(~XR?ke6-klr+K7@UO2;~5myrB|ERqz*Gd6Wpt3EpBQR5LFu
zM_r%@oNFmve>m6nk|T@qbn+LCsi^e3h2N8MC}{{k%+&<CTD{vfB18GAL$Ksbzd-Zf
zD!Ot1QbkG$$iF=LTIbP?Yk9*Y<V%hehHxI`ff7LG>eH_?*_%b{Ez;x}<R@)ENYn+I
zG1t6ZGFlM4@b8TLB*PHb;2%)WRL!sWZZF{W?RDIcEw<Oo<xR$72Jr$(3QDBHe~;u(
zX36JHz_eMM{>KYA8!Zs_1M4*N=1l#H%cmrwz%{Vw2eu)O*yMw?y}u{hhq5!kZ6Jh!
z;FrMI2mJqIJ+;{(B5lomU<J`h!Creua_vVhQ@J*ki-4IYD*ewJF$#2Wqmkdp^T!pg
z<ZpYWvC{bRqDHQyYsk%m7!Yl6R!hGeS(1cTM<@Ms1q!4pwyC(XVIQf;i@eAIAWz^r
zSCP{`>!#vwRL)dIHRHrxfm=fT5_uI1YH}D(t>y<DB&VlH&ReOo`N`s^_C6uI<_%F6
zBY|o~QAW~>LiqiMQSu)en8IQyFd8pUtfa3gV=t1po&s=!iaMQ(H<lvXWV=GyAzoou
z)wFuGV!KlHvf%UWff9Xe4>)#{KK3~7V;dG^3A)eVh6@pg#q%@CUWdvICMZn4VdQm?
z$$=dDkl6ljl+(9PexR-cP3BM?q3d|T)?iOMeV*Ci#StNOqC~>Zf(9<EUNDB3-VFnC
z36Z`%R49xzTl^NP{|M2?j<hH@49GWRVE;JM(cRi7EKU!`7dCE(#eGqBMmZ9LFbusC
zF@)0lUu;LK`k~oXo0-3UML~iT;@G~61jz=E;NjKfbWM7FmB+*oqyUc8Ali?<$y#MO
zff#w7P^?@8=AyS=8U~#Lh2*u^wY4OC9UiMbaj_+&Xg(bOB6X>b1Pa*^Cxty??d+(_
zk~YZ(YRrM-xW&J6mKSsxgG@ABCn8BRQ6-w?II@gEs`&;W`3>9WHc(KVQ@`I$Y8Xv?
zu$#7qD>-2nEuHa2PI<q&9Z4#Ot)=;pQ-r=)osk;)bAc38pau2%Dl37Z$V8oH9?oeV
z!NA5*@67Xw*zBG8n`aTpXyhZ={(}yL3`Sn=Rl&ffF83<S6xWe-(}J8Wj*mN;!h$lb
zx!BWEr{lz`wFXAi(McN=6h?MiLmRvt+7%X*{OPXt@q5#_Mv(;)+3{z`Jv^}e9-%rC
zt&#l8lGZ}oqW+14LoV8@%ia#LY>*r)%M)iDGT4*@mxv)p%9?O3aLDa`(rEWLIN-g`
z$v9;4u)u64uW^JQ%FZsyVHkwLS8{N0;r<uv&#XRoy4z9qtxulVg_s~AJt<N)0#1<j
z1=3D)EQzIC+4w#|+V#;c9?=e@(*pMK<~^z4J`?~sNfSRO8$u#ebhM;bSNnwgzSJ1e
zwUo8BHngw9FN5nl4t=ALmmfIvS^7W-gFMFVR}f`0iLk=|`3>_2{g0wauWo-$Ukc_9
zY^8tbyW+8@d3|^J*&~@ulWoyOyEEaB6X=-2RFy>f<Pi3l0>x8$J^NWKL?6N(Hv?(V
z#il;8jov`86;lB`1sYPcFGh1aIbl(xTd`3$AATJaND?kPWo<W%0oyYS;f;e4y9wW)
zIc5u81%r_YQa*m2B>a{nw=WK1juQs*gn>Nqs9A@vumn5eJzwH!|E&0;9UL|g1v;|M
zY_u$TG0|u#H6hHg(EejYD?{Asb^6p`G_tuj_Gt(9TUX8~KOU)2Bjjb4Pk$x1&iZcf
z`X5`?4hAEG8GYUMU3D4ciNzNr{uce_ZxIkPY_c&H`G>W0(EodxJnxn6jGY0F!ypg?
zzXT2o<o_SL)9E}^X(jgqsA(x#cJ1-Ul{|C2TIc^}Q^Z&sG)C0J=>$z)$aBD15j%XX
zE3f1`WHATj9V?V|T5+N(f+iVXcXdG9<oL9RYSF^_i}Pz%f2N#FRerj9P`{STki#^o
z2s6_0L>jKpo9QvV`FNW(^A=d|I(?UXU6Y`jXhjq3R;o}@hF+a*sVlE^Jdx{7!?eaB
zh{Yeyvqu${{hDm1!Dh-$l9MtCW(|1jIPliYN76<!LPK#f;SiUj>_?PmkAng921MdP
zc5X%hZY{{)MO(5quGlC%&`Fp)E0GIX`{)?sVM)T|%S!l=q0wpOiy!D#m!j3%gOKpe
zcSOj$JLR)OS{T03tZYM*$B_JH=kpK|obL}FL6*<$dFweV{$drJHG*o6jbR8@e}3KG
zz~d1y^IQuo${x81;Ys9exY}*cz&%bUGC!L2*^SuL7sF@cfNZh;1J=5QF2}0sfmCQz
zM2E=($&y6}vpRGXI&3i-;ddpM+rFt)^GW;1#Q&G&y`KI*jGaqv12GIkuVf8v*}nh9
zns&<P08OFUWhFSX@JAH+{wZYL1|?C;Z7AJ*^k)vF3rUg&dCI$5LQtNyye^B9*G<p<
z*&l6Ydi}yWRLZ2XE;*V{q~sEqKxtBCV2i9vY7yJtKwgSWyI$@`vMwo(wgr%&5oy^<
z6Pl1EMVIvh{G-QJFKPT8J@nHy(SVj7tjQx$#F2<Nk`V#@Vb*H`;AG7`WJ&q;k3o1n
zsKlI~Lqsy|8^|QJXR5Bm*6la054V1Z6lDiM2QAq#wU2|gAmhHAKi9!a`gWtf#|KnW
zUCCYTwLnTuFjpE+dDUA7Fo~vo+M@}~v+gO#(&U??$$K0@WLd|D$-*R~^-PQ(iMxK`
z$f_jIH(qbOL0f9&d7@x~)o1s>teYg7&XU`-WlhpvCS#4lvzfJ%Q6#ncBZm!f;dWG%
zmt&ojRu7WI#4m()6yH68s?rINvNE<|!R~k-MJ4=@jDPSxVzi|^vxOaUZFB>^^TFb@
z2kXIbfC-|x(iK#Ss4ETDgmuA3?QhLnJ$$e9#n~C<HVnfs^h&X1E7AQgwqgLE(rp0K
z{q?7U-8zvhisavs@=2seyE}jFZuF(*8Xv5Q5!Q);l%BLfs(ocBe=3U%Ne<Ca%J=sb
z$v$ZT*1iCKVKORZ`zoTfTBRK_*HN-vg*NP&BGHscz4-^C-{Yj2I3H{+enLLuMv1(d
z66trhh;#uSo#<Jpcwe@06HSRsy4%b{W5m9<1tJ3=@<fON-1o!XVF*n2KTv!^h$6Rz
z#sVm^9lHh@5;pU)X3iBiN+kGr3xA^`YmL||1VwhFoPk~o<(4%#skl)h8;%xcvozZ9
z`sCMyV(Y+KSm^)4xnqTYISGu!<qGAOk~l{B|4mqAN6G(0Q8l7@jncSPT}1J}4fEMa
zTZ7hpUCkS}CA*Nw)CF*J828waJbaxkATp4Cj2hq@1MLWVyA1)6DTpiukp*1#?N#Ul
z7!tvE^;&bbI;s^$4nWAsIV@-}x*>;O4k)D7vmrs{RQEUi_)u($k^^5;Mi~h6eu%yp
zJEP=?K^TT!2{4Yy{V&#Si=JmQ-I~AsS&t_$gh-b3SD8sen)||DJtisO2lqe6&{DhF
zrl+APqSJ$C4X}+BEs@0YW)}Us_o`BSuC)8K-Cb2FL&+GE)$7PZAj#`jy>QHqkc$w+
zPy~?=wI_nXN|M=Xb`jUp5kp#Cseg{^*u0W$VRTh#{3FrE$>2buZ5J|MIV>f^Wer%$
z%lsHa44Hyq!rONBGr_Q3gf`u{bqW9)32&9VNz9}MKgc#_C#_M=4jDQ~X(VL!!MRq$
zV`3!3*3*8>Gi$Lt*F;BRVS<B6M3yO6iUdgwLxlkLr69^xU--mB&W1CONgsOUEYwM*
zLDVbPG!38h&h?}A_%V3Mt|^xN|DOvVthSB1Ct_^$th*yMZ^90&)!+R=j19CO`q%C{
z`(N*@dfi~!9q6C0ESHq-s3)k%AhMCHmz-#}8ic~0HH04e$e3R72&<JUVT=1&X-3Pz
zv4!5aTsvftP1o7^8*nnvFx#$PReE|^&X$IM0W$V}V1H3|Cdml{F%-R0OFiHJVxcPj
zPs9Y&>{zKJ8%$e&`nQn3A8vH^<0r$_kFxB3EX%G!BR3v|Ye!3ZVH-0qB&7ZNRz`9h
z+q#`Utp!AGJp}fIp=sRxlz?3EX|2XDmq7Cl;jiZ>q{V*3kVwgX(z>`dbsSXMFFif&
zM<nq*>1mgjo_;&|JtL3vo)ATPq~ZyVBBt#CumO;KnoS*jIa~cusViXRs8ZvU42gu<
zSR<u6qKZIr!L?b6AnPUG07~A`xPeg@1mzb5bzSb1Bv(;LMwp$*KT=4Jnx91jjzqDE
z<$wR;<|FmR0w<Cc@j*)ekXnHrg|DvqdAuJv??;{%LP7>z#}KY#KD*M`_}vglnzT`d
zM{86vPtOt!fh74#<^;&Phq=d0E0G(CXfqZyMJ$V>>H0lBqAz?xOv=VpQXHWPiJXpE
z#JpQq)SUg<%Di{<_@tF>F=T{0ze?+UrI>A6x=3gx=uu)MOo9XOdiTHF#vjhk0Eb}^
zhJjxy;L!5_k4@UhrRtb~eIQCu8$s;Y!$|2EM1mfbBhs`whazu8t26&Yv=UpA!|KAS
zVWGN$1%a<cRCh(Hs1VmSMS<i{q#-=fZ4Ewh|9M&NUu;R1u>SQytAsgbopNsFcw~PW
zC%B)vb3a$#$YM+K_S#mEt!yLG1xe03rn#e)&H~4|%p<km6M(&(*puX(`UD}9-P(LZ
zV3Q|1iGVJJ$=gy+-o-^17hRm3N}Y<(C_~})J{Ocrzreo@Zf9}yR5FZ=3Iw;MjEqQP
z?pE0WJvJiMK~64ft+sPY=QF2Ub$dBogX%(svTj6b*llvz0Wr14Zt}eMIy(9N4Wz^A
zQf1+m;_xI!!dJX>H++QU;AH;-6E%LmO53Q+fg5ip|5g?rscbeX{*y*V)B8Z|NMhTX
z3}L;7n9;&1)h~@z)He)W0lTJPkT8=(8MTYpy@ky?+u=po+2uwI0x|eXOU6LB|HZ1V
z)*n@x%FSDztRNyXjDP0)DgIL!CW#05kZ*(sjDWHuM72jZF_zT-UdcT#DR$3<OY$|b
z$~h6Dp)7d&B@<G^mUjHI%2nUoLi{dGO-^s!^v+E(O^>`X$D&#4f@Wq~CpB{&FHY`F
z1h~>AEhn#ts6Qfcxxf2RtBf)(D20Fc3CjF)MSc8#Mbskwf})e?!t>0#v^*Pe;M61|
zh4_FKSv&Pj*-#u2MnOhOjmX&wLbBYv{fR`=eZ(2Nf|K0uR2*l|-U&lHX0ncT>lu=Z
zZFswzai250q6I5ypx!Z$)&rPvg+b3S^#BIlpDPEwCRS$ROI!Z3%||X@kZ$g_@1Vzo
zv#z0EZvNDQii$EsK}90?Tvr%H-=|DN?t2j#fvEnDo?+;Z6s(Q!S09;8eWW`HiIz6g
zV(I&J#)gfoXVBQee&nkl*Y8A8<$-7-khM9uwlxddTf?l?Zp>O=oSgx#10e`RuT%jQ
z?|-p2{m$E@+Z6K;uoHBRL55*Ikp{I$^4N*45mm#%+ZZNtsC9UMZ~OaQjr1BRG1%nF
zc1ClmW}Bmw$Au_K>Hh4x937N0hnY-A`#=e5S_iRAE^Ee(Q)PE%Dje8`2Fgei@$=0z
zypLYTgkj_ZZ}ms}hy8e5hLOLJj$+bn?IM8P#o5Ht3p88l85J;+-D!^0NKS{f@!EPQ
zU?e*V(oQdGS9<k2oAtlTTTERsZ4TCVbQRLNuTD*Wji$eLP-B6S{I<HOX*O@n3W>@H
zBhYCAFuDM2)(HvX$f?w3WBwr_{40kxMqXz;Y1qIGg9_59PeH~FiJpQNrednKWPv~u
zRf|ECY|J-OtM^IOKg+x!g__AMR*f|8tJ6N2qm;LD`d5gV{2kNLj&pz0nv&R~BTUSL
z8ZgY{ARoYsvZ1)ltkWDZlkI`;yDb!j{W2jcGYfH(OO{VdQk%69q|^l@l#)u_fr)Dr
z6<YEqXXk?BFbD(DD+OZ*xc|krYBSH;O;yu9Kt?D*V8`?MfCEJe>i!^|VMzPqH4DIz
zN)GZc2F&I_w_U4tU4uzW)5ZVE37pAfBlEYlelsRGH@4Emv@MYg0Z0D=iGbAX-=uE#
znYM(bwka@h#douz0DBzk(gD>;bis&{#Lf%Tz}!W$+nPfA>G}MHWHnOff+8FZ(!>ze
zVGGF#kwe6*FsklpxYz499)A@DZluSU8jRsbjieGB(nKGT7I6D%AE6=TqfvHTsT}v6
zEWt;Kq!OI2;7!8ubD0%T>dNTiGdxD!?mX))t{G(zllv>PtC9Y-N+fXuiOCF@GXaxh
z=hJCMIrU3ms*_(T=v!?o5*kqAN3K}vj5FyL^=fb@F@BhJxWGm)x3M6C_L$!-Qq71Y
zJ)^7z0uR@ztDsGB`7SNpOIdc7NUFi7`hx5Emjdq_q<Pcwt%l#Vj<_u({I^%Slb&1!
zftIgCVmf&^-r_n0>=1L_j`GS3k|ZaRFjAnsA3uzp3yy;@5JRs-J`Umj7wf7kzv;44
z%>^PFXc)$xXCDID_9E2D%f6R6+{&Ba+oYLSs_9846<jl&+kuOFMw79M;)=h3-u>Dh
znm&6RE0Xoe-#6|j!Ef;*cvBP8I*<S%ULWL13&!Dt3vx<AvoB0E-xpzfXXfv#*9Z>b
zjnGACqy4OuAEx^VPE7@^*>GXzVt_o!+HDf0kK!)IO&XLZOof6f`2&WJr)8;=LJOow
z-Qaij$k#Mj37xa(q>YY6RDx9cBz&n-73<fns87oJ<mJrO|M-+Eb_Zo`5-<MSz;B$}
zL8N%T9H+NK-yu3dm7S31)HSL%*zaAmx!i}J*Mqy};+xw)YG%^9o38lXBxWYRHujY1
z3!3fD1nI>V*^gbAn*DB`^<QLt`X}RN&vC=c3<@sjGP_3~rl7at1F#X~)T(vz{xDvK
z50ebhUUgfP;KbM@>9*?j7pf14hxw=_M6z{02JLz5&E3j5qEB5lH(AjMB`|IfxA|m4
zsq}FK;do0g%FZN5ff$COSE_i3UH89OBh>$;1uYqNtSktXr0hQlryK##6i#_A5v-h=
z_N{xI;-p~8zCcd3`PZe*Uwfo)B>9m?qK1dZNymKVc}|u5J+aeCqEz?xL1JeLr8N9N
z3_}pRGry>$7n02(xts3I5Ub255^k=6c?Pk)0f{Si&VOCKR*DG5`XZJ^#QdH59};Fk
zorG5O!E<>-om}|uNYry{l2fxhD1}(+X%bu|u<Dt{J=Ku6lt5u*eB{2?2zn%v$>KID
zeiM<+731JMkxUX&6t31Sw`L`|M?y&=nLO!2#0!Nty8F=&Fp*4N8Z8GmQn<#r;qy^)
z;7SLsbff|BTw>4bL_4|twVkv}RNlv@@hrj6wM7SAEm`pDoA76!*NJvg^8|z96fOzf
zV*`x;9fq#qNa*l$t3|}rI5$mT%ix6zqVn(Bf4JgxVsEr>Q&(jz0amr<DPHly4fztG
zftwvih<Tm#j6+nm)kJwL0(9oKyGZ|SLVa`=SOb0ayn_W>{;345?8{2^Ug?LkGf8q7
zgrVq_Y(N9|zgYL?Kc(VSiDc)MN*=&Sf6z11^p>P(c)BK&z(3sGQKWtHoK7O)=^9s!
zQ4(N<B=i5OJueHkT(?$Bgvh)(6PT%Q<DjG@l1<tQuG4_`){Z9F(k2!2Yoz=l(t6Ly
z>woD|c;~@4o)`oMLk2lE&%h^i^*JFHhSEKQ`J@|(Z~t#8K_xyjuQ@S1qhBovQ4rI@
zQG}5TT&JB@V2qd?qaux8A^}_0+>0wAi^+Aw4;nCnE%87>n77bDt(JLYn<IF_dsafF
zHd#F%#sphF61r6q9ObhfcFc~BCRL;!*fCpymZhU{`$5%VyA(Mnm(m{w*mwVN16oFH
z;2*R-{oo@5w5<0w<Tttuv#IQh@Df#0g~zzx8z+9XoFPY6i7$(|Ik@1DwvXciEJMu&
zw(fAObXOZiOm1-?18opRoG<UQ5tJiFxJxOzLR>++TYZ>cD9vOKEf)+EX?gB;)jKGq
z>9zkcc5XQi!!QiIQtZgIbpMNWUm6#SqU>M4guqDBNTh~i^;fR&sHdM!>%vSWV!;}J
zl#GHiEI~~mT~~sf=wWb>S`wrD4U`OD+Dd!FV&gr#WB79_tmgcSumN4L6nsjkj!bzH
zj{@#l5S?V_0U~d5C8&Vz<jy&*2w!O;=V7U<V`6MShNqURmC6(E8OY~(khQk;R%?}!
zjByJn6Ecop643acrTWXT_`WNNDzYzHwM==26Yw3h8auPKe4%YG=f2AyPa}D{iO=?6
zRPQ^L1%wEwYYrsSagvWG$;bBT2ke?G_S1LA>>f8hxPy*7DYAw)mD(H@(;C)<JV`(K
zS94PHr;`1y74qc9Uy>{s(n*XOzEUsY<fc;hBu|xmPogKdYjRD6+<mUeSJIm`JmP&m
zSi=(vCGHs^ckjEQY<by9u3Djt3rq}ThJHtW{j!f+>yz*5tjjLt>jn|{B9!OC)3t3N
zmq?gY;~}FO@}#+dMc5Sv!FHV;4jP0^u3PkycG@l2u2JJb*|{V!48kz<Opb#H_rF-X
zh#yST8IfIAOi9Am(i7@1!a;*@P`?YvX)>EuTp~TIvaD{UGn#DI1jx!weu+6Y782}}
zf)Oimw87}%HBW-<%FrzxWt1HA7#pwcLKs$G(kv{*i;hiwcdh>AUm+rTSe=@%P0}lL
zfp2<+XL8|$^{1A;`ALLqNh0FzHs80DTNl*wyLP;jWGDy3!pN$1o$`y)^iOuUb8WKA
za+_PJs!^W01^``30&qgo5C5uB5~ICx!oXiNdp|8QCIgCckP#Ifs9yTcjbDm#AauCf
z%)3p~(vmSLuuRt<pqBl_TRd7i*aaM{-9Cy})F}nuTOi)WZpo9`gqt!G<Y=7%a+N#S
zCl2IwRViT40;%KeP$F`2U_Kj!`VNFM=~ojVucJh7jnL}W8s|4ZfPuUYG3#p1bK*bw
z=R}Sw4(KC^Lcn&~H@+v%lyzc0qfV#aUv-1)tAi5eg$@mkJ#%2K^OX}RK9rqVasn|7
zM6ZN5$-e)^k^=gPFjZ;z;|G;J_IM=sBAC?qE<YOM_PLNL5Liap>JBQnSymeM3nj#|
zVXE_t`H*IS=~>=O2(hd&J^$Ys-KS%s*^|h|qboldkId|zGp9WZBHm~BBCza(ddFv$
zG@#rvSMD1VLXeZ?&4(iPl?6|dLQ~WaSnvU2Nu)t1gL+OQ{C*N*`Db<)X8zpPfIMhH
z$=Y?Qx$oAl5X<YBCRQl-XYV3m{VGCzgCh8q*MDIB%Jpk3C59PvG6;X?fzYx?*)$()
zn&Ci9zjoT=4G!#rc#el~+^qCB5LyzcHPk0{b-pY*7zvuAlkWG|fmW~CHGhr^u{;u0
z9IPn&sfMO@Uka}rtwHpMaoA_IkhO1}@XCcEUD#Qw!bnRv3t^RO5k=J{Y6@Q%2&YUj
z=`b>{vG`&~7-i~3OXUHj>_{I4S)~}%d7!LeiMqW-XOyf`R)!_9?uh>9v@Dt^S!E+q
zN34y;Yx-|e8NR|Z8T5Jqecj`KdB+c9XOzP*2*c1Tkp#%N|HU>{&7;~TnZJEm1*QNt
zu`i@`f@Gn2lWq7)vq4}V{Xo)Ho3={UZiml3Lwa=8Mxx~06}{Bgkqw)EslLv|1#=tz
z^UkCb)84hbL~kWXcXO=somZRg)T0}}NU)ypr*ZJlM5cU>j<AN(hK@!@G&VcQpLyyB
zI?UpgU=@PN!}Ym?KbN$yn&ePo^5j8!B=#t|WRgwNTj>?B7>=1?TNtEDZ755sbg$c7
z?}lDAu#c2GZZ<3+u+{R{wtyJeEi{P~Kl9|Z<K8nC_lzl|a_lbGb|jRXb=!Gqx+2jm
zjSf_c%?(r~F!?q!OS9})tq-5bI$_7X(TQfc2<%uv^I5Ij=a*hN;@`2`U3FHn6&uMV
z5>>oy=A-5*Pzbb!mPQqC)ZRwzHFg%M6D6AE<D2|XXq!AOC7R^}X~zjTypD8|PosPI
zo7Z*NiUTG!ja)N=R<o!*%Ym9E4VTi!cS72ox^}h0G2dO+0V71Dc(j27*u-$-g9*}`
zvU9<47=(f7mB5A=-~VF$Nb_JTb=_QGl!i0`&+jXe96Cr%*62hnbi$jnUO91>8l#02
zm8sW2t{Nr3p)45C8pS9R5sxZ5HrEZ5PXoh&qQ6;dHH`8ewCdy|0rPU%Rw({)V|F6O
zog1TZU`vii+Ti+xJYD6$ER0Pz1_;;D)?D@;o8^Hda8go<E<?Thrr@l`2@Lg!3y69M
zj1;}3;R7S3tE1JOE;BlVFRMRlA}VdW4O{1keDn{MA8aR#ewY0rfe!|hR#MEdYbX)*
zBA+p2ufMFEsLB&5cm^aed1F>c{_i#2L850hi4Nh#-*I{OQnC<Gm5I<G@vtWz_Fs^Q
zGm&3>xKwYGFv2;@G}IvLwKZfE`uGp0Ub*fP3i!(7J~0f0BaAicYvLJCEIx+y1hHye
zA|E0x$I!rgQb_aMj}zKhsyaiwrHw@<uGa3z#LapeA>MLc8VOvP98Hp=Nxhkbw;Uo+
zc22L2K?_7F?GEvle}0|w>u5<nwtx@P&L+2F5C+0`=?M~JW4Qmt8daH(c2SM0?%w8E
zB!D5FAO99fS-kiRm^$RL)Jq`Ce=a5Rg`1-3jrq@nk!w3|HQGu<<3an^X!4V{5o!UK
zftP5Mc(hH|&Q<>EmiW=n{@<7cTt+I>C4J=k62brZWmkcK%b4H989*_3IF?mc_W>?X
z!JBS^MOG=FRS;N0gLz{HF~=LzMG_NMhk0?955S@6S9r0)Ma+z1*A=43v^G0kI6es8
z{n1ZCGq-R5zFFZCSG^<o8q<Wo=+6UsQx@LeC86dYpKeQdqKnELU>@=i%H;#0uGH=Y
zxvu+AA?>`;mvYl|dk2gf-JH@pb+jPM=U;l;JIPF&%rtx?R<}wN&psvZV*a%Kydkn2
zc;!Lz9RXOCzK{cCIdR~eIB-IQ$g<R|7GxQPKN7x~4I6%yzYzdgmd5m)N+JyIB=4qw
zItZ~hR_ixoO2(9aOdJ0`K}^?ayUk9yd?X;t+?4a0ez17RTvo->K$dk1gNtr3X#aij
zyBk-NMX_=m>CyW5<m_B*7=}S0x>AU32>UNqsp`E%{aw`skR7=$=E0rjJZw1+ZP@kZ
zWCqfEyDyvwSq{_|W`YL+vKirbr)F=UUTwPNYN(;PI{g=?DHe+{GJ=N)-*|}dxk!kv
zF*X)zhZ&gEmp7>|kmc7%WBIIC$a3JGmUN)fIA&*miwR3~$&TmM{2)$PsKSPT%u2m|
zv+1rs?5K4KS?V1o@PQ(kk1(DhFbt#DiH*R>Fd1Nw0fq`W(<84EuAGaZqpitG(Ij0K
z=#_9~E_wpUN3h=Y7n)dQs^z@IIYu)|7yd6>r1D%2)}5E-_+9nacelQemmexHW#g3o
zHj*!JgDEk`nL8Qsp66X=e_S|IcCw~qO$7+>RVth*FOllMNR+q}P3Z$AXuWRkJ9d%Q
zOG7<^7SVu!_8>r*@<XH~l0BAPuTB1ue?`I{r+C2&ztt&e^TQcunsNeR3k#3Z-8j8g
z*RkQ@M@48c?7#4Fym59$ISzv`5WNxsjHma%Sfw_8Ua21w?FFoW5CmrCdE4DYAYfmd
z{Jd4pffZ}nlV2cU7jXfCXB&o4_#mUmRRSQ$Rkt@KJpp7zL4klB1A-uQ>QTst2)nDO
z!<7g^5r{9)@zS1a>To6gbDE1}V(st(x;k7rF?eqH^1H*8emy~|kDt+9!LAbN*ArM1
z-f;#f1Mzn&KjZYNq|#osX9hR8<GcBYK9ys^+bsL)5uF^pNl+zJZY(g-BuNn+^?x@)
zs5}L?$s}HtHM*4DGlf)1cHla^Rdy^|!+#U%&Vl8QaV6?)X@>0&qCX^9;(CA@qF;wE
zKRVDo+~CBCAPfQz_JWcs=OU^9Kea(bEl(NHk1p0z!@I0WM37*i?%i6<WbPl%IDIO+
zQoxiAvPe%V&7V~eg(kggKCMKc0n7i38yt4%46CN96-=TLqfUf10{g199;+10n{oZE
zgrZiJJ}7Nhscw~=Ei173W@!Xx*fvON4HL=&K=*|FAm7_tbgKNeu77iOCN>DeFce*>
zIh@%0FGdCUr7BdPGC-{)&1wJRbvsNTR59vc(#y~5r{A!p<5abdcZr1gdfPr+f;pw0
z-@m<ByN<+N1*#1^xe8IPnbcl&=$2o`sk|thKaLZ0%K+?s9C0F<j?~Y++gpMr$?zM!
zvoDeU8>ev{>1Lad?x`SrAR$0;l+YEYf{6-u-;k+=y|*9va@A!8GnVf>sssatvaT<_
zXu^{GZi9<2&U`(j2CHWQ(-Y_y8xr#nHS{{k>SZLtiyV5?J7L=80L`A6yxH}h3*!=H
zg0#>mVBmg;V&@r@S@^mX;X`6r9KTA+FwWw*7wB?IBL!YeM|n?Z)Y1`4CtDU(&%uyU
zyvZ7sXPwfMg&z5;j7nqVpMqRDgSR)NoH9@{(&w46PX`$o{1dS{87`sJZpc2clg)`i
z305Z|GkI?P+`GLeOK4*tw4vKX-ejQ_X;at|Mv-qN$d!lQ?UVY!*%>7_48lP4N(eBB
z`(LbSn|;dEGu^a*`C<SQTS(fs|5+XJwj>OZNEn8serq3pmhyHAxZylb!Q>S9kq)b?
zeIiq(u9ej+QZ%uxEb@<RTmn>=O$p_KAt)4)yl&>gJ88W!PQOiuk8An(`i~;EmBE`@
z?e8NOA~^rgUGwKabYqX+0ChD#kizV9ABc+Z+&+3#eR7K1I}2yRgx-kOajXmq)CwK1
zP^s(+pLBU4z;Yo)eO#eTvkInMqyu$HesWj8TR8#(tPN!-PPWpWR;nan$=Zg~+z@;8
z;CkEbPRcztoTWH9mC(N+e_hvUe^}l4ZBDi0Z_G)@8@14C(n5VT-^ftJKD&)>0UdLw
zU>e}*AHV$S$`W29b?MlmchsW(a{>W&C=oOQRV^cB+kQ@YFDxsB9IH_doPNg-Uenx>
zadgA&%5n%2+sXkO^OcV?;p5mhQ=(cJa80Fznt_x1^jDg)t*jOkrGYwSkM7GJnJ|0M
z2&~dW)1Vzb<&rRaKKJB<vva|X7zTmpl>j@z-2Y--t-`amS#_cwAjrn?htJGhmf(?t
z8^QI13I5l~IX7Eh%y(4dvJAVxSAwOuJoav*>vJwrwu&zBmDwus0V*T1rI6R5!**mV
z5j=RUowIhv+R44L>dTny_w1gGsW!(kmK;j~qE+84<#&(&b4(-ygJd9$0gNd_M=0Pc
z5iE;A!-FAxmXh9dK?56`yElWT_`WymfhFXJgO-2jO%E8sYw6i_G7wIZiHKgFh+Zun
z@=&-mm>>-<IOk^3{2!}GmGt@avU#(#hCao+a9JI|*94~@VDuz6Wr41=Zp(DixNaww
zq?d}aWstx_f_lsezr0+zGTtc@w!_{lV=n$Ci6E{nTVCIPkT@N?Rn%oswro>W!RSBX
zIYW~1lzf0?$IVZX;0C)<@NHdLI=^_l1H-d+;@qXB#1dS0#vQeHU22c7XKQ!rKNEbV
z^D5|mn4G+wTt+^%@s)@Vj{%qa*!W60CWrZ<d$R1{a3ajiKPss|l${Hbgdhw=uf#7v
z?tih_a_xsTqZPbB7erJl>AXm&d<ju+u8G4G1FBp#%U>N+W6YL}Ox}9@HdZMoqhq0t
z#-51?cOq{K$lK%L$46V$$|-}#oa+$TcKX)y`gEt~6&(=XNNH{<^&IaF2Q1K@3l5mE
zH9hoWdP!g5uFNPnf_$2x;`bja?9Gx|GEBK)?$n{e-fgbuu^%R=uqd6O|NmDuEbQ^_
z+7nr_(DA(iVRV?V)Rkzoykx1v>V%j6q?3oekQq;e%9qRG;$69TE9vnUmh>V(i<zmB
zPD5F*0ZC@I5N6;2VK3euX3dQR1}?mKdnGX_1iLY@(wJf2duXe4DwL+{a?5(%#+q5$
zLL8M>l7qTXT2rT9AHXqUh>+KIv%A9X=8N6kxTz}c+ytsV{@tz$<)xz$M^0x_w8csT
zbaMScCua?^Z!^qUdZj5|P1}5LC)D&fMk?tfnzpe#Y?7Qml$}v>10f7UuY_3)`2H7b
zCfg@6leB98@}*(f4K|i7-9Ye@oNVNOXqr8j<uK%YMkfdPXp-3aCc2VWC4u%*P$Pld
z-N$Q)NsT`x?<qAL(*5TQEqVKl2I5%#eiVd*EDCo>xo2-)Q#QJdr#Gmpp(zDAc!rQ>
zNNzbS9Z;I3?0AAcesK!Tq3eJ1YuX>?7GX>VWw*x>>9+}UVOoLa@pFfu>{iFFASh?a
z#&4*8OEJQu#7~P^niBS519Eb}O=igER#rrIV<09a()o_EyDg0stmIh?#g#Lh<fC&Q
zQ8g85R5-e1mDv8U#kdJ`Ta=g0+Nwl*6j=$=2)w0#ArzZU=jr^@Q;9&($#Z$x;5v4c
znsj|ZTDrX0a#&4u{;h))S`$cNJ4s73lP~XVy%*M+4-}f2jM7Y!givE02O^u8Lr8v$
zXFYAmxZ<xRfthBTPzpv;f{YO`5fPmB5&m)pBYBh^Rn7h%&in;u2*-Zf5R#d+*JO6J
zHYio}jAR`~@{)VR{ipq+>`ZVYhG7`^B`ZGl|Btmrm!n|20Mic$%7xe_HN0D7&+h)Q
z6}aSp(Wr5!1b$(ALXo^zYJeuR%=eV3WL)xADeIHd*2CvNCW<6R#MPv?uLj_y`Da&(
z<iM69+wNp^e*Ku?U8OQ_UzoQ+|7&9v+q#hwMG`~#tL8<`XK5sfBDtlF#8#qk^>l`{
zTO^8P<akG*tVC<`^W}*mIi-zs0;>C3?DUuKDc|j=FB9so9kpB+_CCRQ9TWXtZ^1~6
zK;CqdFkT5+o9G#&N^c9SNGPwL>Qq9peZQqget&ZWo$HM5ip^P{HI!rxP~x_WNhNw}
z{&Zb>WT7D{`LRDHLnLBkK)tv%q^0PiOT+%B|89`}5FNnd@;gt7kyG-@3@+{Z$E5*t
z0I5|Y7dpW5y9ddTBbea6g=`)G^#0#nnAg9-pCfR7hZR|q`AJrApDIm1hntciJJE<F
zS{^|5XZVh^E;+EP7u-r&_9N^tNlJrEorWh2>?VU#G=C5R;dLfZkT1&4E!SZX2BKR6
z12OD>V>euBj@w46>0iG_2_n?^aVENu$<OAs%%uwCd`X4cr-59{CrsCRxZ}VH`zaN=
z)|YJftEFACNcS?9@+5^@`JKzXrRpOxjn=etR`^yjm<i$6sfNO-X!#CSMlRL9K<t`s
zf;m`kOEGhEF)4#jW}$!6+kq7HdBHPUD?s{M^Z}JzDp(FdD$o}^I%el5%kIR3Mm*@4
z?x<ed%E41j@cJ}Nu~vq|sh@1C^_lpsT;)5+f&V0FCRI7fom-efX9pZS>%j}cdhM(g
zGY;29nk)6p+)_HrI}Hv!tS$+gYE~fKQt*uFb1{%greeZOne<x<4^~wZ1}LQa>Z*Ue
zW%<5hjIxVve*d~azNs%Pt+{V0b-(In7q%-CGw;-?Y72?>&;x6&V~^JUk+y|xCCmT>
zLHoXiE7r-1>CGuikAtla_O*!E>PtIe4kn@9^Y>$r(i`T<IzkOl=Gb_WR4SUMAknFS
z-$$>%NYNok+S~&jpsns}=3k8pl;$#&=tGEPZy>kJ+f)5fb|y&<gfI~N5+Jtz|HnM-
zaU~9HMw**X6{Z(jNGa7p3Re+zjYD+x<qg#X7ah2S7x}`B3y-Pp>+~HGE%SpCHP@}`
zR#H+WsmHe^&E0KjFoU24{?vraweuwSnFHUfa-HGT-i>)S=066O{*+=2f%#ttTNY@5
z$1;lSv@!I^4SaL2T=dMq2#>;G@wb;%t<2Zi2=j^LxKb6yQw0_Lu-nw3VdOvnqk1Ks
zEVNgQvDm)Ag;Mg+Hk}M&6p{fn0i%PWBQ6W<n#;a2W6YV!J{j4k$b)$im!)%DR>$z~
z8~v17^Y^XkOjM_wUFt0U0x4VWvHpK`%D%cvr`9WIj2;_QytG7;ok37PzqH#WFHd(%
z)h|+tq<UF%z5UIgwlm$=RvF#pDQ~I1_Ymp;LdNe&jk-G6FaV2wotZQOtDB!v4MzuZ
z$T{#?z|8VZN)%lAHMq3b^l48@wai7;3OZq0qB~URmdU$}>{zY`W#^LQFbD(DD;bPH
z-2Y+;Dfd%qGA`s@Rw`jfa-&aod-A-44_0AUyCOLFU~MFTft_~<qf~}h6G_E>kjlXn
ztonaBLw0BAp+lWdiZV)U=qucOpW@(xom^stFyYAQ+h)`<1Zllcp+~BegqoMc4S^*~
z3hW`T4Mu66z?Udk8Y<1^&=Psj674fw@WBR4qA*J1vSIG~s}vfR|LMNZm=&!1i0dIC
zPhqPtRCiidLVlT||1;^@pxHchMgQo+Z%x_H0cS|gA*Yu*AW9>uZZ;5kXF~h^YacP}
zUG@$isF)mW9+V{$wJrLb#~_M_|1AUV=SG()8l5npBRzQem-Q+-ok3GI(0KwH%wzus
zqt&T8=k<g>?Xm(pf8rzjrDh4s0RkHh%vxsRfY3m|CeihMQ8D;TRHInFWJ$HL#%ZVE
zSTD9u3+i=-OQP_3=#t=gWqkPHZ*Hh-)PzUl&ZDc+nWD;AhE!fbrW4j`XXtMx^4;ol
zz9>7R90x)ehF*z4GSK^9Y-y){>{cr!{hKcY6(xzC*niu#FO{#aChelU$<ylw6Ou)m
zdFpfFq&wlv|91>uVqvtuP9)ZI*B^Q0Tfm4&);aW><IrSRVON7)F(eabWTR137k(?8
zw{b^xMH#;){6YbdTnwk_<=kJWI}2c`Ed}X`n3EyqWNO^)RzM^f!Gu8RSgn4$l&(5m
zS#*e~GksKQ7o=l5`G#xe)qFuSwmb($I~J`^H#uX(vD$OX?<eG^AGc&&`>gTY72X8c
zPgfSSzhLCBCbpShb*3<9fZifnM)#~oA@zJP#v}Y_!V}K>KXrqfg{9&XCv~h5VlKqh
zXMU+fgT4=A@55**h2vI;GB{n%0CGJR0)8;%Jch!AE+O5HmXf1dby*=vfDHZR!X3wB
zT)T=KwzGB`SOOC+WFrO+MR{RlxLw{<*e$fm0oBdsBd1RcyUW(%Q;~K@P(`khv%S`E
z;$A3E(GxW!jcKWi?sF+Ltd!<iZ`6JWW*6!sJD!*HeDSdFz0iV^Bg@86=6?t5?T52-
z!3`h;f#{WlRl)mTtZABgwy_OvFF?fL2L@*Rje}c_+ke?BOw9{Zc{u3ppAJH`38^r+
zqk%hGSosJVgPGqaYLe-dbq}l>Xy|0y=h_`|>SzCC<tk12-|Ve#9b`OHcl(HekQOu1
z?PgW*CI^hUG=jF>2-+@8Z9z5CQuL=6S=&=rVa;IN1l>u{oz$wP*JV5t9y((1c=bF)
zUD_D6sZ{-KDL-mTMw-fa^{rsc*o*s5->N01)Ya=fVoLKg^JX;yK|=u^x(jAUq<z*O
zViN=!La=v84&(vqjNQOLQ^DOAb%f++mKL?Cjw!-O<(q*b>&Uu%V?scu8Z4fLe$q_f
z#)}gt40QYFU#;7Yr`L-@E)e$wdnE)_nRV)K!a(~}QLs-D_>R<#GH&iU_+&|DfY7Mq
zrq>4-HrX(!O&kgsRjEBLVjM|K-j*MHEAY~I9pz|Z2DS5WC~i8Y`h}_ITvhYK!Bscy
z*z>{Jx#c<xgFtjk*!U6ee`8nqm_yaHg5C`vNAUxgVP-r-v8rRt+P3`nIT<>J0}<*H
z+pV^$^|llG`mhu7W6ZoJ4G!`#hF-2hiUA1P@WJ>OmGcgzI~?()CTTdg6%q;gE)WL#
zN-x!;*+M8KudSLO(3drh7@*<nRv}WyB<jF0#fM%EiJh8h-JzHdavZ)?@a+?9mX+Uj
zOmSi){8W>ew?bbUD3rn1LvMrYpcd+@xiP-4UP;5oeiz(OmidbS$Q?)w^Drb9RVO~p
zD>t3+&jJ7B>ToJH=4CTKEP_9Mf(#th#LJkv_na}%1cAB@48Fq0kn*~FVO3q|wX!+E
z;0IehvqBst<6YAMYpRp9Cb-8eWY9uEkJ!OS%r<;%hUJ}u7N(dwzJk*`Y~HI92XhD9
zh~e@=#<s#!ht@2XPn5xGA5E+LvlxIAvIjlq!W*DanTOCU+P5)Br%hDoJ0LSVz=;Q3
z{KEjY6$%w0pdM0CTS^Jzg!b*nE%`^;x#UO;gFy634FquRf3ZoAx?ZHTG-h^LA=`-^
zaD8}$axRp033VbgfpX9>$igt3rRXV?qMb5`T$cN<NeE~l#*R`YR>)U7Y_ROON&xex
z@Uz1fkig(JL<p$i>E5*d?Up@24@g#q(DU%yHKU<U*VHxR9cmFuE$vE#*}{XXYVwJ4
zjxQ*CLO>J4tFl3^($LI7i`jsM!+U$~H=q#EG@W%7Oc14ZZ%t$0p`1|2^X14_p)%-t
z+W%gfvt0TtetCX~Iz2e2gn*_p)&y+~davi;<q7{x-H@iJ8ijOxwn$1;T%>o$H+uDd
zrq<84k50l`C)NzB2cgtZkWPSg7TsTwpQaDi3AsL8b%-`jmEc<k#48l-F+=V!*OO@P
z7|?nQvcubfR$#G(AoZ*KQ*uAap#VYu47Fm<Ml(Rr(6zx;Ag}LH?S(al32nR>)r(Qt
z9cnN^wauh;>jAAaqp)U*!LkeN=K}ww?PsK$zve&NNc|*XTOcHdIo$)=tO)}({8c}`
z#Eyete0&49p&)S4kLZW8bHQ;S24U!x5+J|(U#z=r{W5B274`yFqKO#5U~j>oir4W>
zP%w+?lMO(=U(w(FDMxffLhG$CgR4T%ZLc6D*ebE0H-~yFBW1szNKnklVh}%Bl^vEy
z6Y$V1h%^}z{!8UhZ;4;u)}jq|<j}HobP+w#D-{RYf<Aemwo{QO7>Tea4zv%cFZ6*C
z@6}u`ajJR4bO41+MI_QsI8ZFvf6_=X{(UQ6oS_US&Fv|LXlpd}T}M4ny;|ABiqytB
z)nE%^7EeGC*9lgLEmmK|^_jRJMuS=w2s73^wwdyIPR8IsgI`3brmdkiLR4R8D9n6d
zg`5VLqY#w3pyth4Jb+*Fg)+oCw~|a0XseZ!QS3>ph62}0915934P)B!-R4xZD$UPO
zN@89j(-qKX2*u6I=J{EP0(GYR-vBQtlqSwezu~EQxu8<3%c)XO_V)#ivBxLq5lWA}
zZI)r)*aRk!;&bQRsYL#x<@yUn-^Iqa0iMC4oSAj2{o6}VkKJ1T6fb#Db}qOPgD?=i
zQWye;`(Lcv?#?4pv^BYaMIuOy=l5?Z*e!JI!MSOuV`AelFG*;p^MD}O%6PIWh`Hxt
z(^_Xdtd5DXu@{Vlmi1x37>yR}2l5SyVeQTPlrX)LPbr04?adCMtc0d~JAs70`8)4i
zT#qJ3V9%4|6+#J0@Z|L?Y+_ky`RGhWLRFm5DX!bXV5^V0u_{E*=1`v15K-#~bE>(q
zDz2p-47U!SuOEc`<!mrvTw6%{pp!kTCqie<Cqi0!P!OjYT(#zt*S_?i!Tn(lv=+yc
zQsus?OR3L+`D-K6QY#94pa6ljLx#atDYMVLt)_R?blyjrm;PJkWQ1e?g42J#PQps`
zoQ)~8pq?vDYx1A1sDCYEV#M5NI*o$TpGPpJT>Ogs&{cTnW_&bS>IU05l<RI~6jX9|
z{yK-I2n#;$28mXNK_%Pu2q8)^RvH^9ij0GP93tMO#H!o}Zz%2r5GuZP@=g2oSn;IP
za<Je5E4;~xweCh6WgztO+J7iJgCvJx5D0$BAcM^RKepL8)7pv;VsAN3DV8iF4Kz-|
zF{66TWkV_`1=Oe@q<UTeWV0cK+fSBvUJogsjjaHzZR)o2GrrrwQtEj&_Byz>f22Tk
z{8Ng2T-u5sps5@(O6SFqBf6ws-{s?5>TEbrjw31x{h%F9-mr|jW8(h*1x&e;zfN6n
z(Hvzj19yv4+G@H*pN_o@^>V~w88qJ{IoKO3Q+8;SPO~}bx=k1Nd3i$$Vj{=&2?@}X
zUUz$w&hbRKk~dP}EtHsO5sl?^J*DIvTZk)Y^K8ssJ*8F~0VNh%qc+&74lRYRMuE7M
zX3(m!<H;K}quAyc5UO+!J7N!baCxI~SL?hNgR1y)PR<?H7}fY5mDxhXst)s<jhK__
z&{9^tm9pwTPwgFZHa>s3lFsSK$@O9ky45!>rxIL?Fct%5>A=uDD;ke|KBUf7he@dL
zi~Zh8UHHg4HPiv!l~5rYp;<1L1w1xDnsJfGwa51OB<b9^sU)Zdg#7xopTW6Kp-I*8
zk}6;wOX`QRvq5ek1flSiRs_ZSU#!zi-e<dMBe?*ht}-m|hkrwDE%dyH>b+qcQFzW+
z;kueP&#f9;eU$pEuqx-QCUQ(zJY>;TsL=(G;s%99)pTn8a|RVW`X)@;D%=8!^xqR0
zP&~$QT<mw0e3@4u`NBk_SO~N3VKBc}U$PQLfM~?LuV!rD`tw&88j4RmoxjQ1oIiL%
z+tOTskoJ8J21E8jy(1iS=|^#iUOYk>Hw$V76AHR?oBa|`YBIwuTjAvk1YLp~(e*pP
zWmq9c3IcsIJt6I^Ew;o>PGfXo6JqQctx!A*{@muLh<h%{rkfSYCV`&>Y8-ZJVltE>
ztrzC)&qyDzflb(_D-v9t?lQOQ1xADk`9ze81gg{T>y?(MfKOMm2%YSpqn(A<wqZ|{
zk(V>UOHS%xh2}WY&tMR1Kz9$_0rxDdYCzEt(&a`@0_j?X(i!Qe%b?}CmdC1OW0a+{
zN;ZfuuO?M~y1`9n5fxB`*}sJyU!0u_j>8}fM6VPWNZ|e#+m*KS9Q7l+dw~(4lmat;
z{-mTMx=&zq(GA`I|EKaWsG#85aoN87ZU^pmJ~i3!3>mkX*$aqKPN$UJ&d`CTe2>i+
zgz!2$VE&H9987@9Vo&_7`Rck6P%XSYih9q3eXi42g}BId<-`iv>>SSj{ccKPSGhQO
z_grZ`?Q?_p?YM1Eg>Q*>aRpHwqNI2i&ri4lear0Ru3#~!((G(>innati|;|t7d`}P
zJ!5{e#r%ANpZSGc7@e9y2}Wunbrz(?n^CR*t@?zn4cCe|47KT_z=2ddUs^j3?qJck
zvfy&bPUl0QK?~}1Z1}5wD6AE@Er@$>Ml}kyzG%!Du43~Ka0IHfaMBb`XEQ*xH4|$u
zI$EtlpisbX0d>3l0Yc9zu(f5cQwO|ZvP|t89SVg49PW!awEjH&Cp(>LA9dEsaaQV(
z%*lIkZ~kgLC%|xuUtm-2XgZsppoGV{sK;23x78oY&Mn7*5C(!*0-A^C{ufI$yDmqw
zE7|$W7Xma9V0Tx0sQu5ipzt9XCskvpj>`}4Vek1+7aR`#gFg0x+Q>^+!t!bO&Wr@0
z?`9?36kd)AsILey-aVJIi5_Pt8wU_Sa%A4;Pho)~dD3UKE~rl~5SaxtqrA@vneL4J
zEPUi_7kQ5pE-YBsgCiqX4@y)DI|w6poJd{uGy;X&vt#!}Z?yb5y<02nk^KoaIFyYK
z?^oM}eez1-us~ODhC&6Ed;K(nvgM^vDk^&{uqU~}UEb=P7mkx~)^#9M{S;<J_lGhM
z_`ZGlwx0ssPLbN_3tSw-zw**smAVSEiqtG4>&kCG2e#7Lg;}lVP&0bDgQx7wnS1h9
zXWx+u#`}}7%=fSSk3*}o;U{l{@K;yxP8CiX*tgbj#{ukWLFOr3I=$67&ITT3p#S~Q
zy0u@~P?$d(w`$PE8mPHP-a^-c*KaW^$UG4?nG0OCz&u+B*^F&>jZc9Ts|By3acGga
z5JRn9Sm1mv@IzilN$M8bJ%)O5b}l#$!ypj7QerSM_rKVxyPD^yQ3c%#pu}ly@cf>o
z^lQgMLlg*S&YoG5@oloR4=^C#rB3>n`fnq|lSdNVxv(i*=havydUH&~LSwckv++C{
zZ>Q*GcB)~7vI^~-qxP6Ep`D8?Xf1dmIkCnJgACLb*hubBCT`psEw!M|yXmC{|8T6x
zYHg|s>7?;Y$tV($NbBW*Ik6O!*H8x55;d{TVtWnY&HZG2b_&JELL$=i>Yx<5pz(_@
zuS>+yIMK1b#ram-5~-YP)JTE}*_;Q0zXLhdUk=AFS*5<ZHzAvo%qjzwSW;^G%0{L0
zJ-1E*=Pz>WUUkN&I=5c4p`<clnx@J8Ug%<%tPcSpnxSj*prhO7M~%x6!I{qoVugCo
zBViC3N9O<gWCDQH2uzgn;o3v4sO^&tP!m@4Byu(!0i1W<j%FM>2<z?W2>cZ>RFx9A
ziD^oz&tW$2*tnR$&D6<#9>=DFd{t?{D(QR6{BU+=xfR186y4G@lkNR)td$y$(?%`4
z{^bh=2~Ti`UqT&^xZvzg$`d<xyc+ij>^*r+BM-F)hPtEPDA(ag1gb~)H}U3_n)Ivd
zp%Ql~jC@mxo1Mm5&N(%*b7*^mDWNzU61=*2bY|a>wkRvOMiS`Jx&>K{kmz8lIK1%;
zM(bA66YL85C7U}4Rc{BdJY~;Es2kz8QBhkS3EpVPpj=uB>R*&?^FC!;H#WA;6~$3K
zMz6?rT?l9330~Cm8GI3Fnq(P01J7K@qKI<6MQ>LIo|@w>(G)p&H`ID0IPISa!t;b^
z9rzOkJG#`D1A84)3ecWH_W`^0#^lU$<cU*Y<YHdRsb1fp453>W7+5J+BK*?l*Q!Hd
zNIuaQ&YyC>i2~0$RLb-l>}bROH-g5kG!mq@0upj1^l2<~tEE2MjlpLy?+QSbk&WBY
z@Sik<Zts7!fDnVS)<#jSpIXc(K|27Zh8DBI^7JfqaXSa#LP4-DhMawhe{gmMHVDHo
z?4_kmmiGV0KxlS`im2fMtBFPzW;<s7WHvrm%%7B?s5xY>7{&Fx02xoRzm1*bXUx(_
zW4lsfgP;b*{1vcN&QI^prlIW~LV>;(NLOAJm_s;KtWXu@LMxV3AfEPsV(<=?^OsXm
zPd?UD)oL_hfreY{svr&Hq+x<I%>E}>+$SavBg=$T%qHkqoUxyjR$M0HcNel?pK&su
zAD}KjvS_pR)}&KOP)yQ->(J;fF~df>mk4AF<%@R2AVf0CP&BAmpbl`?1@#i7Y@sl%
zPp<!(uxy7x)RZj+s9bt=FA&y=eh39}C+M;0Y>a^}8Wciq;h#y!Z3jP@kKF$!b<m)J
zo(HJeEcx&Lr3?x*pkO%3$XTaVTeuEDfZl-YKcK!XOv7=`u!BlF4C#T?swS+Rcdonb
zj58q7e}VQ3bPIJZP>j1SsD27lUe9j@wz(AeVC?LY8wOz@d?f=5DEGfu-8B2rNjjC@
zc+wb;F`)hXr_^C3ev}%09s9S!Q$60*kU}>sVVe1U+|5b}0UUalAVs1t4vaaiTwtI-
z5{xH5-T2GeX1m^_!c#%pBJPdYzcz?_8--Jz&<1UGJ}9`;P)>|lm>_Xln8S|4R1ci7
zu6*Huf&SrV)dsY!)(fQwq!_T8NZM?cujyKacjX=<CU=ccrX#Xd-cu0nx8_gJK*H!R
zU030io6|ynF>FkCj{>G+zWjhc@pN6yNd~(I{+WeKmf_Dh!b+btL>k)cIeSl7-x~Z3
zYZ&j68_+A?h|zi?o-zl8PQsp7p$=hMq(A;{R4!~(^IPqNw*@m1@9Hrh*gWOJ7Xf|Z
zbTM$$eia?BqG>5;=5#$F;dW5HsN5foes-Z~hWswMKRkEg_A&XP<DAk_<#c{h1vRS-
ze|FL0kfkDBMx38hO-r@UQnu#~1dOqB+)_k=hF9MX6M*iKKZaO^36A$tEpWPkn-<Cm
zp;{-d+*>kY&)v)=imPzHG7kDh*%>7{5Q0GTN)8gy`(JGLBmKzEY!&1J6j9?K-E<q~
ze+D#bbogJp9*p(1?pggYQRk1-DD_v|L%m(t?d`&@AJ_;5QE_Kh-08wG<FdwKIL}Z5
zR|AizJ?ilq7bJ?J5`s!p`cV@)J(!5o>6F}1EQS{wVeB48U09m14Pz1)7@A=g_MhmK
zG{T6OD2n4pnEgdIA||Sf8=EB#Wm8uK0HH(J$C`R7t|^J3)$kB?ly3)|*#T$v68+Y!
z@j1ZzGeg-zI0c*XR;Ysqj6Je4gu=Y>RKWg|2Rf2!k(B3p>x6~=R$<z^k>iKzAH}KF
zEnHxz2BD?(Kb?lbt7ZecfY4+^EEH3gZG@B?w@6Cf;zl}gBb|}bi1pTOs&UOQ`6Z;n
zF9>^A<H5L5F;B4!^~@3K@1zv}ER?ZO{>?(|drI!Nlp1qhE*$i;a*`lLR!-(M717Ul
z%=-CZ)^B7HRv&TUpp&U1$iUR})+hxI7KqNBB6gh(q<m*pi~mq|2FMM=AQ1eLF(6C-
z|5%%hSv;{@$OmqalPDG^_FhuTF)=1JA>#AvZM;B-18O@4Q|tm0oaOASEwC#d$BZ$7
z)6)I@-PY^>Tl~)p@kpOQQ;p>ve@mH$J7Ly%ea8QM>W5sV>J2LVPgRDX0L7`o_tLtN
z>|}icic_5#Nx>b2+Tiu@KjTbBuF3VnX3g?({7>L~I|r$Q5yWY=r{|k~Vk394#LsVF
zBO9x;&#F$k-}`-#2!aMO&>8%EfLZ$Bn)(ZCSxRMsb5@lgLq%$@rC=g*w_LFLg+PO`
zH6D93R=6k2<R_V6+Q<a+a6dgZPFzOTrmIm98K2C*$Xp4`iCM-*;+bQ8rWEv#Z>7Mk
zM0lDoPa{l;^rWCU6Rirv;S|+#(WR8#q_QeLzFt)r{mUMt<~LQ1e;)fmvvt*NKgar%
zAgYTDyfZF1>1cefG9xZ?cI6%<+>u)MsxDHvRCP<lbMBKET0p7q%-<i%&Ll@d7>1%(
zs>E@I`(LbE)%~9lLbBPhvVcHj=T9$6A)+8nucLCFn$1UL0|os=GSnw3kqPN>=A(yW
zb-SRoxFaHDFFvPGYTQfpiym={!R5Io%0WNjN}0*BVzwR(nfw#&9GBA$(+^ue=*N2D
zwXeJX)$bMZhYw`T!Y(TG)1dPibiRL?$9Dy1;jZB19w?%s(tiu6RNgKa9n2?AgGs_#
zod?YC3ai@|NHM7tSGH-sf<i$T{zdxMH={!#*VNH~o*9W+5xIM4JM!fd4!Y%HzojhR
zQjU2+bl`?qNRxl#@OCr__D0Jc)f^#cYs7$r?iLG-f=#g_1YHouKj2<5v=>Y=9U<sL
zDMuPtQA4<4T_NC-=#{lF`O4uO2Li=*M7>#<Xcv5ST=?h1oIU27I`DB-hlHr09TW@*
zUC`%YYKW}I4k(oWyTU!q(E)?L5RYpscf<0Ke(F{4$T95o{6Qc0K*VdI7x{xO$n!C)
zRhwlctJVJ?&mYRpE(d`S2Etb=^as5E#oTE6brYl1H=i0n7Rt0Ub0;1Y^ix2~=xl(;
zH!8%RLvs0?9FeRdowtCGACvosRpCAxky^_H-&3qa>+>w}Oo3x}LS?EVU=eKbD?n8e
z&L16?pR#!u3rsdCJB9P!%(CY#l+d?6vZnM3dJF~F5?OLl403~GPIhC0K;~I<QA63o
z$XnGL%bux<O@w|Xf^EUca_;%@C?RLoip#v9?goD6lszZ<*^?46n$WXz-BI?OJVP~6
z++leL50geH<(48f$Yr;8o5oAL=Ir+1kUzB^F`uK-aaNOc=$~qs3S~R?<~_8xHU2@6
zb3w@nGw1=}*-4||fX>vg8I!dV>>9NJb7k4nR(3HsjnB)nyJj~UbsQ!r&|;8HN2Kn-
zmDQdnh{mlNlpV)msx(E<c5z-*&;>(rVfVN2N<CYQI~uo;CT-;B>{MjDVU6hce=@3|
z4<#ZS>aVprAAMMWVzLpDl;G>vqwi<vi`}j`xF-8&y}Ny%oSj*Y10f7Vuf%3!?tifv
zWm1nQoe1~*<;$WGVS81@V=yERe8Qnm^+|n_lQ#s?GTSq7=$P%hq~%fcSc*5av`j=%
zaz(i4MfjQY890<glt#?J?=Q*HEO8UdL!b*1ViH_gbfgD~!4QOPfq9nvlMU_Gtmm8o
z6A>M@wje^IJqGdKnNpn(wC|;6O^^bpXu|;g=j3{5dl{nL6MZEC*WlG7542#K`fQyE
zlwlCvbNevz;A9`^iO6aTvbS^?368bF8(N9PQ4<&SqDge}_S~$j5-sr;4C2e-<HQd1
zDtC5oiH(fd=xeEgY))R<5s3u{k0_<A7u@i3>s8MqbhS&XT0wyq^G>UTN5$%_I_`5_
z<@q?f0&S5nC*^A=gzrTVUlW@TAyU_6LSL19Wj)@}SK>B7gw#j5bX2S5PDe?Ni|CO`
zMzX4pOr^l#YgajS-D=~+=i!Eq?K}4Wlydx`Bzb)*6>*-{y=*r$cP22Jwr;g*yZ+g-
zj|~ep!uY(k`eE!`k{kwMAbKSuP=gn9|7*=uW%`kL5wy#SlCetx_3vXT979DmBG;R=
zdEuDn1}a0O%Y)c;?MbDG(i-Q5@>x^sBK_Dim|hSx2!ZI=omz^*PT8&BjOt}-SiilH
z#@V-9hDYb7X5*0`7tKY5Ps)Zw_L5(o3if-p`mtXINZ(%FPC@epsh=&91U$+Ww{0~b
z_N7tCH4yM9=KUW_`HFkpg~x-AyS2UM@-!^6YgI9Y;UN36qK*GrTvcJO^0`+XNp&B_
ze=8ADYI@j6Y?jKpFp50?vy1po*_tsBf(>Lzs~|BI@t?BQ*}PoUygfKsSD{HY#B!EJ
z48eW1z-jd}qd)-{x0!EBkJ9c@g@w%Nx-*|OX>3C7`G_DRquH!m&am~CIC##2J+h39
zzCGTq31_MEbw(Q(^(Ph65Nk}4&sKPOM1WFMu<0>()Y~d71?$|<Q=keBLY<>P^_6ka
zkxAZ(yG!B<G%MW&dt4Z-f4?mE&&1yPY_O`pN)eEp;Ko4VJ+HGDlZ=awG$Jxy6V~|o
z<?LK+9E5=&+LG~pWcqLH62v?cSvqf0Kt_fDvgfz&>=bpads;6I7l24151(Fm0yl+^
zf^^Z3do{RMoVfSa!<01Ioe>e<7`KQU()XlL8s!$4yIel8U>aebdr~N8L{u;Hy}pa+
zkZUOlBLtI(=)?E@8^@cry3r5C9>0ZxT9;$+2JL{Bp>U&99ndt`u;b(Cg^+hL5%dAY
zs-7PC0@Q(a&{iml2TQBMup7Bvpw7t`{1(do`3Jws6C^dct#OcqP3_YQ&<htB+Bc?D
zz>`5e@^`hp44l$Rk=*$h4+Z*aIQN4-j0OU69NyqjD{tSN1sd$mWcc*x)W&7uE}cM$
z4{}PXof**;D5<3r>UA((pknNOa7jV#V^u$1V9Z*7=87s<W;iCS(4v%tM7#ES*Uwa)
z-Rf<9iC{Wtp_9Hc4iaiv03szy|1ajltHfL8g8fq!Q$UjZz{e#_d;TaiI42`Pk3>MC
z*TU$v@Rd^kqwI`w8-`&RdZpO1Dd+wd+g6k>MYF={Uw=v@f#X=BNZz5=ZDQ~hD(b_B
zA`-N%`&A9*&9rY=3YF*-W&~cK!JuZ$y<?xCOR-5Dkz~g=KJa@p0*UeTbwPPNJ+NIp
z3SS!0W#n81F*)T~;s@v!it+S|(YIVtNITakl%<-VAA6^{8-*M<nJyi|G)%5=$3lg^
zR$(zDSB1P9&BK?A!8?0c+W9Y3kHTU&-=UsQ=zA#W(w-2L4eq?buk2H^l(<6Ea~3a-
zl09^<^A&WdH)Gr~g4n|c_!cPMPgMgYoKEv&zrXee|HNI?4iJY^!RFyfX+`1qlJkz_
zdN~~DroWV!Es`5B)HOj3sD4mw6)Fg*QnF;opB~u%&0}xVCYaL6rjTfuPxk}zRN?-R
zLn9c2pw0$VE1YD_lqy}fDP6ZMjA2$G{X>gsMjwjXASrVC8{g($IxaJ%z2genaRu#!
zq!dIsGE+JxOP#rZtF^FZ;Y~JE`uy8xaqND7!Ake+Kb)Oivcez?g|}1!B(VRDU1#)s
zwCa`UTc0wZDdPDH*a_K1llZ@x=qoX$7F<Fj82BJvYwLUCwvPqF9KbM!{(b=-iM~R%
zE5qh`1^dA_Xqi$3jN;HTA?vp%0!9;v9C5mirhJ8!n7Hni0ePWHolptKBI1KkiA*VV
zI}?n%-sa)V>CFJfVoEOupAH6FzPJQ0veI<%niwO98%Ej0p9nFf1tsA*!<abambk)*
zDlG&?U6Pfh1x@Wwy<T*NdQo6|*n-h!VuRzu1`U%|YE|>OR6`5u_;TF$3e|utZOkKR
zG-#LIG7}vgB1_3nc_j4QsV%YQb8pKDaiyG9Kc#Pkc+%+g-}H_BH8#YNKA4_6=To0K
zpV~a}5h3DrgsCTKvBr_~nJDEMCaSjm*vP;}8YE22%Fm3z@Y_@DOO2OOG3>We3s*nh
za1i!IDPnX_%m^m@a7yhJ0a40pDONS54auzvT)o+wQgK<;A7^Kj<1h>Y(JRFU2mAgP
z+m(`ev`V#R``52g6Qzw|VBSW`{<!TyIMdqCPDdlDi%z2vCuptLL2m&=^pjL{l_Ft<
zZ>5x%l@mF}#DiY$u`g;uZfVGlS`Ot+<wF!+Sb<kcb2lkIM-H(St_{AT{>;^H#{aWI
zfK_xrxoUYiv2Q*ntT-=7DRNOm3dUT>I7Hd}{j`4uk{+sh=61I)pL^AP?nr<rX$)UW
zfhjsw8WEG|1~t3wJ6^#G>4%x{n@Cxl2@e8v*(Xj8<(P63D@e<bReCBIz*bVh2P=qs
zD>%r{HTK~~=YZfG5WMg#uvsVTp;>1zEAhkyDPvH*BL$Di#=oT6;{t8WuPzXf=*zcy
zk%GffI4M|Cp}Fl0L0v^^SxRSg0yP|z7JJEa9|0KhN$E^X;-h?k!7H5a<dQy7YDT(_
zpB15aR%+U0dP6?$f5-AjZ-Gk+007o>-&@lmk8~>X9Vo$4SIMk!e)S`DemFaqB!)p4
zhF*!-faCjLte=TqI>`d3yKbs6OhUjClI*$$HlF$t7hJYN{OJDU7<0yEj|VeOifB9Y
z^rVv3(SH<_u|bBYp|>WV5u~}TyCflQbeP>s5|8x(UjpHUZfXKG@-iT#=ctTM`;{|m
zRdT_T@GH!Aa9u@0Yf?xBQ`qz1nhQ+-3x@Uk+F0&M*hV2IGVsiGO|+AC<4%Jmy#Phu
zoae~h|EtP?vRmhzxRhE|ic^%KdN#5mkH;vj03&s-BrZgFr*6~bS_>57LbDO>c+5~r
zIgnO>nb&HhY++DaTW3UuNKkMn=ll2LqHf`PBnosF`|=C)s3KjA)}ofi1a%5pFWB?u
z>#wV#_!3v_?_*w#{YRdrBu{X3m8gkN@5B-f!_2^<Ff=yb5}Ed$(4{6N{QK8>w&6Yd
zt!FqLUiWj<Tq5a!*#ZXvd9e3Mw({NzP}+MN(vcxv$%ooSeJ{LjqCMT&#=CTw?gNX(
zwKOI~d;0d`>|Bx@24Nt2B?}8lzW>E0<4HeKvj|FdSy6^yEYv^p{g&CrIFVO(o=S%|
zye3~#bPCFhMm3R0iJ*?qe)J%E^l1Ep806|Uo|Kd)wNmcEyae>*9gYI*Dpi8jY0{Ay
ziqXw8QTcxVXh3?Sf)niNbU@|=K`rRwwMS4>xaVUieZ;4e1W(jsosG4kI8oIcC0Ob4
zOSi*n+;{|h+J&jepO|tm>ARuX=s5`aOmJNto_RusFmG&66r#GPkl0gr;x%*wDb&*;
zxJ}&%YD{!Qd*OHr^bDN{xx|wptG8<8_2j}lp$NNlA2szIu7+t!q7F6E{Vei-5~BaQ
zOm2rlVR1m3#GC?Fp`Ux0E5STp@)=b-Klw5Dsz+n3a9YH>!6Lq!V7@zuWqTdN8@p<q
z>GU#T7Jhc7gLxi<L?ZQO$`DytV_z+KC@sG=L6iRVp6Yfed+QK|0i895T4Y>!y|Nb>
z6pQ0%T<!#Vn(L{|4GSzsuD@se=d}=iNj9#zR5DVt&%IVSi4YADD}0K2=Tk-gO#k8R
zjB*?XVIX>?U@&&>f3dC7&ZAO4Z0!Y5NJs*Ho|$?vh<dK2@1DOaHV>AUe@Zk=q5}(E
z4}wi;a=Qm+eT|>#i4c`?&OFZqiQpcMp%6nm@1Wq>>mbQ$uRBNbP*3ea2jYQ`N7~yD
z?W%_wKUd|bBR0*ijsJ39_A`{hOE4aqUc=_R@Sqc&a65=U&b?|}m4J{*6SlV9|C=Bp
zQNre?PPA+2)914;*CqIK$y(jlLEwQ?N#_ab+iuj^f{sTjr2DE*q$&LQiL`m#)ukMN
z!fo1?$|?LgiAi0zQEpLm%O3UFErmblR&&$bdU5s$z);;~lW0ZFk!fSZY9gttfhZEK
zs8Qkm8j8G5Yuqd0&s2dURR|zJWZw0LF9&MqAmcqiIg63%<q7&s_zOo|+337BqxFl7
zN|e@mqT;bf%hi}#&~_)BKw>L#E%h-Z2Zo}-T5`NeWp3e(?zR;7oSe9g@-|k=Pp^J8
zk{y$-O<To9c(3(Uxrs*f%Q_6w9Qf=<{l7}wb4@!A1LxV2`GfClOmO~Db_Q7vgD?!e
zQfmm<_rF;4X3(c?I<;rll^!@Lv5_qSHGv}iG+YD<QD;hYuc~vdbj=vnRwZ$ZEr7I}
zkko@zfI<6z5+`-fTGJ?zwZi#p^9rSs&8Q-+N8#!D1*%cfbiL?yR9=KooY0)o&6&u6
z(Q{J4MS6b2nFSb;LAu7(JL#%peyn>_7<+|zW&`oUENJVys7}^%sH;({$%_t0DHrue
z9dFFpl{U47MDGZIa*|+&>#Y!GU6<>dM3w%Z*v!wd+0Uv51Gy=}<?hPi)&|SlimSJo
zpezJ+rp0-%#cxjI@^9+eUA9(vyRI|*NjbLG@oUVBbaUZP&+un3pB(sE@6DB<+TR{<
z3$!iJ6so_)DQ?6GiL2bx#>H=*9}MNpL+TDAlzzMCx~<;F2WOPPDfU)(MsabRo$2cZ
z@M1bUD@6f3=YZ(kl6(v&kI2QqU0mle)NXx@h7E~$#q(EQY{GV8X5HpaDH?3&SJ{FG
zXJ>%qFbG1?D~X1H_rKV7w)xLYyHn|2;13d`2>j0lwYEAjQy?<G1d1zGkucW+yGgsL
zn-~w>M!_m=_2=>VdlxXgC)GjIGYVG06C(HS8VTmXv#v07HWAEC7MR2TXO$kCE|oHK
zF?cO#T#CX!2m=(i+hnRP;&(N-D?%~cj!fAjxRb1ndBIonZGoZq^2-Gxn0to`paQ7<
zKd3UOx#9MK+nL)ER<Npn{DL|~n-#2L@G~V3gw!t`>~W2J*g_pZ9Uo>!^g_Z%rO-)2
z>u;k9NXT!swLa!PtAH}jec2;b2}P=NE}8IESTDTFsDsjhf9w8L)~EoZLtTV`o8Wv~
zobY{TMp6QWt%>UOz@YsGfc1$%!Nnj)x4k-Ns`~kk<MK}p2YnVss~mGZdQ>qfa8z<J
zJ{2MK6GhZhNvB@uIZG&?-XNSAj5@vQqV4s{6V7LYa0WSVc+fFW$RP)5!^03O=&w-2
z3-`;K7K+>w^w|DPwES>(1~?AGAQ1dg9EySef9!hK?zn0yncf3}Y-BmWdUqev=Z%A@
zp~?Xx>i}H}6hj*d&WT$n;)iB}8jZf(VsD9(!awidLrOM;jbIX=jRDj$4CSm($0Z%|
zTH|#^Li)rr;C`tEnDg>CZ)}hudEG8PJCM69Ivb=)*N}X%t{sVLpN*y%(@>6R1iI3&
z9nu=rlmO5HCu@XUItTpG@vDls4W(u@G+7xXm8(%O{VE!v>Jkd#^$KO)_{Bi_3@6m8
z5CV$H{v|^~`ph*%IPv^cYwO;)MFoHk9JppU#A{J#GCQl%-EL?^*wQ_C$<@AP69D>5
z_9N{G<U;3fK#d6iYGPtM*LR}O@Hb{_%(d_kMZEqc6c1fb_eQ9=<_bLx1Vehc$`5I0
zRTF8B#%Zs*gyIR%3N?@Y%%lK7g`N$Ec_yIaY&5rpLat$!3`+rC-5zBu<Z<nNLBs8v
zII7MaCq&h*@zuU=@B8xq?F+$B-R6e7v9DTjTP*%ib_PfegD?#IQjCGv|Nq#{wbhcl
zbOz@GDkP+1ELr-662Y(Gl51|Sk=xt$Ky+Lrb3YryK?efNeH$p@J25d0{0a#`JPRdI
zLU)Evq{l#Xr^@pzIP9h&+tRh;v#a;2Ci~leCZapnlhWy46SlFxU#GavOXPC$>W+Hk
zavB-XBDw<8!==LYQP^6)BdMnDDmkMNSdcbu4~ghlspKlb)G4mBD-varh%)fe9DB#g
z6xlgd_Dl+Md|h7d@LM32DuKyX;*9lv8UAUPZJ`o@Do{q_$Dcq!cc#%pa$<jNJb|+N
zsxDBg3s`{q)=;D!<>LvIBZMKf(zx&^sQ`O3q-+%C1Plx$;(@PxLByG&JKeZ>G<CLo
zU<O}W6_cJgxZ7Mu^nubRp**|B7kk%#aPLGr7JLAbuuzQGoeZ@ez8-sFRe6JI2O2<<
z(+k4qWYlvc4Mnb2Cbiw`hqh1zK`RaQ4^(@yDxG$TqP*jtxaiMWs5Ji5pDoTWKtGh7
z4VJ_p2!pS*T2Z+F#rEygeC}T#%mp%ZY86Qc6(CWd*H6OnT^Q=-0|f*=9-IsoIqev@
z;R5yV!;MyWb?b?3-jLUZOo5cLd}s}fCc0@J9q7o}n1BlPV@kl3Ua>m)qv3;#Ibq-~
zvdHW5%5;bb#aZjj)v?w&_j&;d9`q!w3k^L3H47)GXwaz@Ftq>{1(v+N5~4t-`b4H)
z|Izy8&H6!y=WY7%I_{*Q7>ov)o@<Um4CuBCXaKwtdyBe-Knyq`1~7b&N(AB852a8f
z<f2Sw`(WTCbEx`NfTFg78jj|%(FcZFdFdgH+6s;TtJ9{fyNgx6Icv{t+B?!as(fj}
zfI7CPE|p$G<=hI=<S@GR*`BapxeG7%eKFq*Y!r~ZU=S4IKWQ`QzU)s-p3_tT{dth6
zPCK`1&pXG$)^8q1w|qP5-+VVPe`a4snGOoZgen^21AZr(Nu3;dEkf3<-o3VZH-&0X
z|Ia6BXOtr`48qVWkwTJk|BJ1(BR@LYk5KIe5KU7`VjI7~xpLu7G5_^om?bKVSAo;T
zMI#Ioh2XFjiIwxXH>~3l!Kc^!tb~2atndaYF9ma^ju>H>rkGB4JEF1L+SH+rVqJP|
z`@&_<8-H+c&g(`xiby5ZFwJay{tF-on=eC!YS^AOs3Iw_bC;f#UjEe>r`+QY6=trY
z+L!jJ5vq=x0sFzB!jM(t1!4*+Rul%tObI_1ZsDD7jwu)SAm*iIZR9iIe5<v9@wIU3
z-kp8`yz^nP&L)W2w^&c$PFsNItLWOyi$C)^a@Q_rTrOFCCX9S$HZ-1(U5;eN=u}Oo
z-;RPffjeFEZ5+Tl@_`1Pvl867=SGmAe)T4+do}t2;7%KSF@Yv%)>@sHU2x|klnt=&
z$Ty+b>`V|PtKR^sQ;kqn(kFih@LV;&t?CKfNl6&#@H@tvl7QaxnvCMowb55~Iag2g
zo|YIb0G73v{fD%3!F3=6q3D*tzx&_Vn|9>bSDQf74VW2&h;TpmQWL}%9VjEy<!%~9
zp&x|r$+&u}rWj$O&OmW!!_Mo<vjJXZE+L5%=<_P)+_5g?1<S?L+I~#}*%*miF;HoS
zcwahNc;aitP250VLZQi7-UR}5VoI^QVvTL585uCjm^SRpS;xWYqJC)sx#Nk(?cJk(
zpae23V!>}wYv2dT>=1F9O}iFMBQKbSyVRN4D_$TQ3F;fjsR#hv1UzbMmq5Q)x1)6}
zWd%$xELFCxNaf&ke<?6qF!}oc69dWCA5*BvHeea20ZWN*`?Zusd$rDV!xpAzBQ5pp
za^O^?en@<iGx*hBwS#qbqhs#4inGoZq3{3Ig=l;kG+X?1yxfxR*P8yMi1oBddcT`d
zsNHcD`YPRZ3}8uX13s&l746Lr2H2jTF4S*oY!wBzMF&q37A(BCs``7S`FwA43nr{)
zLtjO-+i`A!jbpM(bZ8Ci)z0nAtlD@#gWY%NQi1bXk?QGxoSgx##2^SnucU%v?|-rN
z|Afb;-7LBnAT2>1U>Gihq+%dB9lu|uBH9b@p#Ja<))JGSamna|c&B-8x=c}c@v5+1
zP6xEuSlTx3cJGBskGS$YeiUcRSx&E6rXb@|61dRaVo8Z<s;03_MYJ=#?NEE5JhB05
zYYEj`@~(z3)yZ<LWs1G#4UH@12dlxt-1w^g#aC2x*XQNIKrhskZ3I3CCZ^%54O2ur
z&E6tpgCj<Y^B0F+Xfe`VL)HPIXsH{fuE(NZ>J&1!p>{2TjCl*8f`I>MX|y~PVm&CP
z-aS<hJSFV`wc$a(qxOv}M&!#g&mFq=ReE1<r{-+OK`v-H38)t74^SI7`w6J6ML_ND
z^x5uN*Z=WJ4H+!x7{h;RR<xc!rvi#`_%D!z#hjfq%EnzKQFG)6y=1I*$-z-pFgwjv
zR^dwT^T1bHZ|5)M3gqDQc~4YXxZbC8LVGCI{^@e1rpQiV4;WL%Hphn}^Wy9bkQfF*
zAowLD67~NdYo`rsC$<Cj1B^x@CkMw*Q@l?5R8gStoJ!SLMWINw<;pXE=)NvGhiHja
zovXA%zYkxual{DCxzTST5!(CC_PjZCI8MOFiF_8{1{EK#LQ0jU9m{KJ6!~ZjtxG>r
zQ%z@Qiy(t5&6dP^^Lm@t11>bB_w4g=PMjyRSL2LLdC9phFRh&<;nPt4&5LY0l+&UY
zol-73<w7pVWW`e#FCk6A0Saq*UoMTn5IZNt=(m)=%qapTvB6GgP@tJ(PZ6rbkN6=1
zK?-|tQ1G_rpOYhHexvsP4sdd$DAj%V!rrQ!Cml$pjX`2aiJ}R-fj+JP62#R|Hh)0)
z(kRCidnkM<vN(fW4o+o>aEv^zFizKu35P%z$(U+On+6GEHKY_p6Wi;zX~BZ3J>r15
zHH~#zu>Z-1s?qbC#i!R~i4U0Cj1RD-&Gf<986`0YgFy63h(enCU#v52-$w06f)`*C
zK#<)4h(hV<O31zdpuv_>j;f)IFV7Y#HSwgzoUIUA5(cuAp7Y28TN<X8PL0}1*MgFz
zs|Ax9q@$6JRr19=u#A168rpw4)0UMpsl$T#x=fCcy5~s`nv_2u?F=tot6%jK!x^(+
zeCSb;<oUpZAV!DT(^-&mGJ7nfIfzkVfGxB*(zKz-=C*<sJ^7D6(~#o!Nz^m{ffPLi
zu8@=pf2yy%`p>TQcfT<5z1X~5feZ!MYziJ4$LlsPG$BHPd79L$N8D`z(u4%%1<6?7
zRT2XM`Y&d@8d!kHHSAWK*TNX{6Jl}Fx4D|3Kbbb|UH@8xggfT374B0v+wV7v6&?ZJ
z^KP!TSF{|AE|L$b4vb#WbKXwF1H|4c$6@&!3nA%vii!}Lf=r=j0J5npxGh+!-z2F|
zEd)`ee;}$iWoMTpF$e<TD+x1(c>jyd>=yl*xK)eEQ=TYL{G*}ySCBP21(6*eFx||~
zOlK`fhz~K2X5b;jt?Q2MKVi?zugeLOGuzypYplnFY>vF)4Gynky5YMPqx5kawSWIa
zhua-O&ibloLN!$bbkPWIdE3xP>4yWR(N)f`GnH~;nXq(0Pd(CyV#BcWeh$(xx3wqw
zjK7Nm2Lk5vQA-kzX-aS~z4FYbMn^4Y?$86D<`%8=<*503zMroui8<4h2H9)kJ2N4e
z1{<Ff<t86CYT)0%FGHAIZ{lt0&4@{EtTf@5o#t1$Snk7Am%N(^zg!pXb>22?i`BNA
zK~IYw%o}aSd7KAV@`s{yn{LJ<!8q@o^FC@(lyT}cHEEV$S&FE4T533@5p4T-Wpu9(
z5ehg7*D>C?VqR%uDG7=!)o8!~=Aax=`y_2TVWNW5%KMWM5;<1hgcSs#*nLmRv5e2$
zM{YB}VHd7Fo1Hi(zY~tWa3g&<JEJ6tK@f-@X-A@>_rKWIe)MC?$rNNSU?HL*G~Ik%
zit(JAsRq)qho@x)lZb2eNDcZkrbRNc^6L*_v+eVh?BVY#Uq^8rvWcON<^93tfG8ai
z29LK5Fwl0vD40I_1PJSF(SMmYN42Y;mzJTbx*|R-e<cyDeREO-WqabJi8#NMJl3(Z
zQbaP7^UWf@Zu)tsS+qWU9p^uum~<E19WO=7o(H#Z$@_b<cm?t%k=CKIQRaml>(b-#
zUdY-zDnZI85YnI2!#&SSz$H6n(78dCJAQiQE*CC&v$^q#$uxOoy}{Xx&FRL?h^B%?
zl=qxG(8!fgbhTA5i4Z?cii4Y$HzT$ly3AVWIv2XU5&`?Tbc4yI(-6M3yf>@C)s%L|
zr@KoQfk?WOnhN8d0Mn)LhNu~%kd;xQHB~t_Seo$A-1ol%0G6h}WX`R{-&^5ff}<&m
z7{E160LJ<&9sc}sc1Af8gdh;TQlqUf_rKV5CaFiFyOEi{{xTvZ&>+QWq51E1`y6ro
zx<ODoeMQpakY3;HDOLpJc_#u&_k=>E2UZvUz{bOp(a-pXpEdwNwon8hIOpdLdfG^q
zHz?Hwf;h*OGe;`ZKS;rrK`1rhgz$joU5+3KnEKf@K}-uS^ZABki&;oa&9UJ!s2KG$
zm4%f+xUG5{Fi4I<S<O^{G-1hL%J6*Ce15cTGd9mePze`PNw(MO26RZMt+XNk1KXHf
zvC4Sm!a3L$BY`TbmXB`Y94^zPxf#klq6gW94fO>`Ht*jSx|tOt$^0kD2Go;kKh?~E
zMnW+Pk&?=eO=*C3G2t$if4;Mf;+(t6{2Rey0g*u>a&>+L3cpG!JkGA%<nyJemo%dL
zxf9)t-b|15N=o2#B`CcT->3xHnDB5x%}I`<pVh`7&g*6}Ayy>yR*-GC+4p`(Z_dsI
z$6*i#qE~_mEpY#fZKdrzM~PZ{_W(gKF;4uOsenXHowBo>dOLyi$Qyt9g0=AKkj^$)
z*wWp$$G^aK&xol=f=r4bhItge*{(spk@>aBfEy)N<@aq7R1R7g=zDI2%!L89zT3qo
zDa2F5C*`M$V&q1C&Q>`I17=R&{aOn1CS$s&uhX^O@^WN{ceWwnX&UfoCftR?;kd6h
zfc9ezBpf%aFHTP(%~M+Ec|j;#(&_b=PKIig5kjZppc=3XW`tx_hqTtWWRrR?_(+Im
zoxx*bK?j9^{7*|ROUgu?a;ijvP&p6X<*KBFF`6Rl_5AwFO8Np3Tw8fnN$t2n6hDzf
zNh#SwR~w&pBuEuX8wznBV{KQfxUPl$JnvYO+}K=@U3mKw9#%fu147Ti_b8<p?P}}W
zrU<rn;dnM}(Rq(9>X;!jo&(OD<%IGb?(s)sZfVTIQdj#H6ZG@l-|)lP86Y<dgFx_0
z<s{ko{~zm2YL<-M1d<PUB#_`_;I8L9yMYpIU-`~P2}+mO?+C#%%bd~jBQYQiU#0q;
z$=20#4sYKRS${peCgv-5L?G~78vKzu%TMjMTj$^8TNyOr(4dn{Vg_fKHCA-IT9HJW
ztdo*N?B?gqk!LC2lC|TMsAT=~sh#j$TPY<q{q>hxHzi7xTOi7fNjiuamNx=Q)F?MP
z8Ut}HhtO!&RdYp=QaN6fHzlH_t8R-Hf|>(75r}J04ycC`6lF>j)2A<Z!YvPFV{g%0
z;vpq+URj+0<3Jq0SN41^TjMkx7uW?>cDEGhEAhLSrhM}d?1Z>s?{d>8XL9JaqIE^e
zwF;_fp!9&^0Bqw_y#1%KwZJBj5*R&+9(iDTJ%gtxQ%-|))d6rkl^X76f)e00Jp4BP
zWS`q>+Aq7C2<0eRXL@Fe*o_bn`qOEq;f-_xqbvs3*<A8V*|{Du48kyYC2St&{U>XG
zRG)KcTEhZ95DEcgTc?wwsjT&frJE;_4A%*<i9p#*zrK4rO=Ta4bOICJnn=v96oW}?
zyR}hf>SO#KlY2XXY5pU@5#UhVaaCyRKE3y;Vgo2BE-N7=;*2c+8TDQ{;s&^*#DmhT
z`!bnJr*ul2Sh>$6cO%U&f?p$Hjo#|tC8nBMxrfQ^1wzP~D9j69uGE%lz^R;6zO&Qr
zIt#_SZH!3-pXtIT6SjoA{&;cIlp^G6()NZXP6Fw0LMmSHmKSCxkwk9E!cKZ%R{~ws
zhS=sQR9+6KsEb@Jc5ZSKDuJm-V*|%MJ~nnHDkj5_^s~YR-Md?Tj-z5SjI8dIVH%B1
z>YOZ>R+-I6!rJ%ht&REhTcqr2atIX9-dVPVHq?zPW?d@fYu>ndg?w`7sUHV@!E$j^
zSy?@@+0o9BJ|ur}c6Lb&gCG#TQYC80{V&$^XFoDdQc2(P#E2D(!0uXuU2pp*et}8~
z4P^3+vHqSQGcmO)4?)KxoEgYvUOqSVDy@^p6`ngn<fp<Hm}KSmcfe^*pd?B<>Q<U&
z;JH!mE@^=jQGg7XL}^ye8G8&7O`#1;4=`KFP)lO7b+A?QHixII-La!%Egb1#J^TsG
zQ39r3rK#stw+Ih1!9=wK<xC;egQXKgxfO-1{k7u3{x!cM)vG)#$%o%8wIUjoY6{h^
zCS2{}2x(g)Riaht$aBlJ+Q{G&g#{R7T~(_6i!#-r-Zj6q0ZUd!a=k<z0IO!=ibOE;
z>@daYPPo?xLl*2jx9qILet#YMoTbMd*Zg{yS}{Z>66Fpb#Y(EQ4nk!lp$$@OdyJ|l
zmHA%RtK#kP)Dn6nKP<J^Jo(g;4H7D6mQp(ocruhv{#}#qZu*s?8HuP%NT`(01lW_b
zGr(aO1fl4as<g%3|6)r_dAPdl+w1`SMWj?fKBFVJp8qtbQ(x_<lq?e|ir<%WvCFwg
zB%j<Rqk;Dv`nKRMDOwJrW*8B4_!B+FCBgkT|MTGnV{AgTj4o?g_nEepU%OYH2o)R-
zK^GedRGNJBAKa*0Le|FlJ&x~9PlqW+*>X0eX9i#tE?=o??&do^EWUsg4ey&1GDVw*
z+ve*%)E2eN=+CL~OX0Fve~E;FMKA}>Lr#y57PJlNl*4oqr*0#h&{3CBv`m2@NY907
zfl3Z?xZ|{%E7P9`ys#~c#7^{PFtF}g+0-n#Av(yEi*pSGcOcw|=N+iaD}fFfy!HK)
zIOjd9Fzwo!JpM)5WEO{(lLckN221)aEPL4hrg0|At~oXx6=@uJV3TW%Bwp_QOXC#C
z9`Qz;-Hb*GO$TCdz~;)xEE93tf<)b{-<+L`5yKz|hF4035ci*~y|jGfNbbNcfXG|W
z->a*QFl!DJv%ydR*#l#l37vZ^2>}$yKN6D6v8OZ3e#Xwi%{u%Xcb)ONcLULFHaMc*
zhLSK`ip#HCgC~j+YTHPU?5$RsfN$*i+N;PpH0Gvt#1^_Ft~9#bii6ZOr0|wf;|NH)
z2D(z}3mqbHnp7G$<3CcEHuXO~!owcXhLm;+KPP0F&}j)JA!-pnk{ALvOyHBV8$2D^
zZ`qvM3QH4t%Y*8oQC3HPfL<APY5Wknpf^xnuO?tfX+?8-w{J@<ovV~|MwZe~HeV_2
z3o#&`Q@X3{^h)DGM?>6zyhbqD|M6WAUg_S`bGHaeb<uX2Q07cBj()#Y0C(j&k59Qo
zBOx_(KOda!mCdN-Y{0v6%Pf9d+7?&>+m){&z*Jrmkq;-|oSlme!!QU$cj*La2np=J
zSgT5TCy}a<E`Tt`fcYE_@Z#Tg#HHEi^T$YT6mk2(4r7i|xg^$GxjA8EpOrFzU8Rw%
zi;-scj@!{}Ic^#5W1g5aKwW_#kF$Fw)>GcGPOgq<+n9ijtl3gua=;XE$yUY0>1Koy
za9FkmRYD(rJ3^EvWs<PlV1`@Y?O+rqg*IF@V8#%z#a~j>aYsf#xk5>MJY)j;z#Sad
zi${`(-Ve9`wt?bGRLXvYPz&vZ(5c%X>g@T~$&TvSj-@g*dLrz*B#RUq*;d^DGY2dY
zkwm?;J#QQh_*N~jlC1f*^>frlRZ<gcNf<$6sCh4>V=a`7VcgJ|(S#5I_sSEYlk0~4
zXVs+`(%_T2Q+gnL1G{xe9Jk}$oLQ57aB=ANcJ*#FCiD%x#-dAAZ}v*)bKsUx{1VeG
z4amofv~xj17zTmpm29)A$^9>;Q{9JCN1=KFhJ5)fEQen^*0!C{h&IZX=Vp&|funlO
z^Z(7@Wc(y?CwXp#JS*cZp#_H(oQ|cE9RBS2pB(%VyKOLgY}Ye#`nR*!i6>%EQkU?x
zJf;|*T?IMs*IK0hCaJbU4jCTT(8x^SkweaVOqvnNry`FpGAv|p#N;Y5&2s3=>hAtu
z9<<Rz=}<zEMTUF*Qm{zIB*g%l$RbAys9+>#{%vn<E38b18}NQ^HGQb%_G~LdV`94a
zQV5Tsbak1lOo4@*HVT&3SY(HDvd<B)kLztzFd_yc<)}^W#8itd%AHZ5$R0sN|D_~J
zMk3|vYr%U0-`L2fpU5zzJj;FGk7sR@QMP?baVp988nzM=iPL45eaT;%3`Gj6&_S$?
zr2PO>N$xURp*)VKHqPu)|Fqi;9^GBHR1kODZ_ODJt=N%X*dw>#+$g&O8-_s`_EI4Z
zu>T*MR$(K-wxkEl3vL=H#)Mnjpojpq)=iu#$2E?4g!9rnTVotvzD+R#l52)~$`21G
zNKlAe)lurma3yv;KY~i67a}!%(>80m`Y1kahf?>!t<uk!?!O6vbOX0oVp|x~YQz&b
z%xfCC(5tjj^?~=Epxb}ZjV1kL*lzN3a>KT$1w@fGG(}S126t0JBptD62_!AFSGo1F
zKe<+7*CQlH4)>k%IZ~S=ji97R4*x?{Dk_SSSk_lv<v)0pfBzge3z7Ck$>gUBGyC`?
zOMYkS5fsy$zBka(g-cz>dV+B!IlGEpdhK+mG;W-L+KzZuZF&?CQ=DE!0o^|*P=X<r
zZ_~Pj4B0A{@kA-}q#fqDW?g#;iJ_V5_v?rV4<e#032Mn&CEvu5q682#n+FnLt5o7a
zH96dq&D18qnAhWqn}tL6$<whu{qQy|u_2PbIXjmehG7thUdf*^N$-ELR#kaKPAZe^
zx+%gKO~5eV_wSw^jLs2pKtiRTYnxMgM`guLCk(VTt6Lp%u-m%=NxrT^iT*Eje4F*5
zhtKZojwEU~2Xu1;*c<f8MEs^QDJ7LhI(b<VGZ|)Tk-sNyj`fo#K~`_cVaF={B)jpk
zbdp-`Y?@TMy1A_<5Lcv>^teFkZ3Tq0giem#3Q2uF-RD=r1>C`nwA){~2b1haT{HV7
zdZlQXIV#ofC`Eh{WsWVL@Ypf5o)@RVLMN|u8KdxwdVp!&fFl@`z!M82BmGK1?`Z$s
z06WQgLQ+3Vq8}`{#<tFQyh15j9hhPE`G2`1X-ro7+Qi2xupBoLT6&E#PPbco<WFO}
zi08+gJy~DBoycpHV((DUXbZ5C$T7S|8K<jc;UOvG1zx1Q@`586tYO8glnUN*d1i5I
zXMnnbx=GTTv@=R_AOxY{l|n=%_rF*^QuMPX*%gxuOeqD(*z)-FC1vvVqZ^EO5vu$>
z^aBwpAN{Xt?yQmrR4QY}p!sRJW!$^vpiW5$Zzd6wUYDM5S}2=@J`8~tNq+7#LBdMU
zCQ8@l*xSAt(}9(t_MjZo)lIq@dyQ>RT<LkPa6Rag>Usaf$OS7!hTadTVUNP@GKVvA
z@Ww+7=s;LuZ+<mXXWGKDrjnTwSeo34$sHPQQu-7V%_zlFf25m+dlpXed974%rxt?W
zg&Wx!7bjSkw7Ang5hStnhg#scl;aUy+ml95X6a&|BJ%Tg5G^4h&o$AsuUs>+r7u+&
zacASePzf$an+TEyzvMx0N5xWpv6L@{x}U7+A16PIm!y}ULhmqM0?czqLu#sCMb4xU
zFc8d6vKzF)9V9zOQOY;<5JpXv1>a;EB{RDb?tVR}cye|nI1qy%@Jnk2#Q%S6n@whD
zY&T#(K*kZNbvVwISw4A5SW<}sZBaJL<W0QrUQF>4h37Ij!nW<$=_{Tw7ChPt|Kl7+
z$y35&N*}z=7hcjRUIriv7#vPhLWJ-QRn|Q6jgfBF3Qw{#uHcX_8@t9dJf-OL!tTSb
zF_FNK1!0i|Q6XurcIM~4`>7qJc!^yTv_aUk6CEBR-l8!_qX^#e7Wqo`@<!1Q2{2i1
z2%a4UkRx*7dHK$FO{rdbzeA$xoY$=>)k`J{2nS|4$H{meYnAflrN;ZErBSdXg)RmP
z3Db~L6Ew*MQh_FVw>&_KD4G6SC`C*X-lyGtpg<E;OksA;71P}CCW@FBOYi)WD&`|k
zTbShkS#f7%%4^t^6_q%?2YX`hJK2u{-?pqx+}@EiR=PVI$jLZ%mgb8kp?{wyzoeZ}
zj>9krM6cvvPtx4~V%x3C8_C@YTl<$U1PKr@W@bka{(aAHTkt08sF!n<BTNG{P{lu=
zu5~a3F~M}D<UOC8VQ&q$sQ_dR)O~1R7&_M5P|EqGni;cjNqfMk1<hr*d<gDNXT`Ei
z-)H;O$fni5%V7764W=;*dg)dQO6N`#gpussoKw8MUMYvZvQL(&ZRumm1-z)!mq0GO
z5F;HLKdv4E^u-^b?zzPH(%iz{r{0kh-+DKBO0*&;bN1E$XIDD40Gpsg+OkX2mw(4Z
zyj^)cI#{U8TZaPjGc2c$`<z=Uk2;l$Sqg`JT}9;BQUIGDowJhBb~H+_rv9fx_I<jV
zZ9%4{OpSauE6e}Kxey%V_z1JR{bAaIN--tb=c@(2sB`hG-V{}iEd}jnIH%dO>zZu<
z7kGTjMdxo7SIW_xWD{_JuePR7`gJ&`UF0;Vseeej0vm=w7<N<Jn8N>$ZEIy)qtX(z
z2O=OL0c?}PQ6$beBFQ;~xq_o$r#~vJm=ylKt`OJ;D|r%uddhwUQl9w*R+0w^^4Hep
zCOM_LcT2b!5-zpEco^8>Euserc`b721vutPWUrkoGm9yXushMVg>*!i(uS<1mvSL;
zlmkR5LF5z!1n*V5w|>EnlnZLtpr7%vMXW3~L)$WeA-R!c0vH8LO4|E0Is5+_TxN(E
zC5S9SA4SN}QQ!!H5ao|D(jx!21ZqdAO#5(KZ9F0f^7a7rCU3!ZWPLjdYZUYDm$<|5
zWWi~KCn3QJg_JN)p<<`a&fo3)W5xMO+2?-)>gnOAW`|MTb*KTsh?^dLMbVaf-_YdH
zlihIcKNXPqU7gS*bT1-b3C(#Vuh@hpVTGVxYr49=Y=!%bg_J`8NhsU0khG7&AvML&
zR^w)4cS2g;tMsDmT#y_HK_Ggh#3^C){uj&cB>hNfDv%3wAtJ~>2a;^#W5qn>Nffd0
zXFGi{ZLbqOpKXv-Ksr~|rn7NzHHt=2mU6qTyreOqolrX-ZROgOm9&UwyixRv0E}I_
z`$Ex$o#Gq|MWzO5?<y-9N1g;WWh6~4ko&Ebo*U~ZS&yhEG7ja&{@jt={*#W>SXN^m
zOJmeP&r3l}$w(V)*pcfO5uaJWITuA@)Nv8;sp!ZtHhRSAi1*~pJ;o-=5sEFkUzy5V
z_}0=#IqAuogx8unDQZv+sJ7aYU!f4~W8qUA?}AK$B-(5dXY(^a7riM^PfgNgFH@XN
zX>SrxqsKom`;Osm{Iv=^I<?QLBLTr}x>gFFt+J8M`d@ktsB@bIKVr`9{kMfl-t!#0
zD;w!lhtGQ`5=V{-NNwBsrH^gIp!5DNS2FS|MgHG(b$f7jb~zTpAQaxxrM0x|e`7PF
zIbUz;Bvjvgk(2{c<Ts;K7srh)WInI#yj04Si)>`Izl2|(K-9#VlA51mC3JF|61p4h
z1I6x7SnJEj4{Hc*??B`Jfk>}yFhrqmoJb3@6^w9Ws%zmyxf&@AdA()l1*=Lq*Nrqr
zZbw{cNM}M^(6k;5(A}aW)i%0lsA`(x&lTJ1!rO_6PUQGCkyFy5zKYziBZZk<e;slu
zrFKV2eO>-}gtxC6z_`hP&=zxjh1=p4+){3%8m+GKKXFS5Nw+E1QoQ!)ntJ{Fl!Hwh
zWf)-u9MVwoxb2)tNk~`d-xd1zGR=PuHcga$*2guxe`kq!9<z12D1(h}L3uLV`B64V
zNx#dqOYsi!cB5o-IVQJ2UN-N_L~;wfmt9YtiMA2paHS%#0?veo&i*3Hol;jW^1rgJ
zag`@rN|57Sr;78--T39cT8(}<yOv~$K@fPQr$NN~Uu;qtyQ!F&0pBjGE|hOXo2yh#
zK+(kO;&!Js*oKXh=5^pPtsB7^C2Yem(UY7SF9f(RPZPQKkcS8376A{-M@itc$BqwP
zxZK=vm^jIY->zJVp5F5Q3+dQFvL$JDdW&%g%~cwNNYly<4s4`p7~TCYt_S&`vNMcV
zRyzWjx*iFrwfdfecJGd-@zo7Qds4was+C!jzk@NivI>h7aCAD6k>Gk_*Z9yxMb@#z
zE>YQ$sKtLMnQ$rkOe*#-n<UpOU2dk&TP{esoY1_T@q;pX7>EmSG$^UJqjDO?z_6D~
zmk|>Blbo<;a9vL;D)F^qMT1gH`7V<E#ceZ1i;}xEC3zdAlfA{NLyOW-r5d?x2ZxVH
zODs+ji#xv(A|Zg6Ppacsm651+noktwnOAWhBF2IEp|3Vp;q`-1TS&Gby(qg9B#1!}
z_NFQu_5UB+PNxYS>n`{K1}Ivt#H#I*TV`4kZ*WS2DeE<Eyfh?g1I#h*0d-|e`5=eN
z%)W?&v0)uN758->&n?Q1Qgu=ag8V-{9tRYsm0;uBt+Vd?moZ-}@Q(6Pl!+IA93?(5
zLR78~jKlupe+!3}%dfX}^w1|#vYW1}h|Dd?00s^&!F@GwUkx9Rr`Wdk^B#wZk__?e
z3&K;rnZ(3xcA@M;L29I6M(LmbPd)vV=n)7{SuuNikKGI$T0XqZEJb*gBSr^-GfNO<
z1jyS}Lo`b`N&WAlO(VS`<Ny(?3ESGN6IrPsTEa`aP!O+hf4M^}`NOM~cv&5ye;r;K
zcpA?Ar)Dt+Bs8}?RErrqJP>nFLn6iG;1UEeD+o5t69??5s-)S!y!Fg}Jkh{D<3K>6
z)^|kNWZuf>r_A_n5*O?!E^5rd*~(v0U((J1Nnsd-qE~9HLb(6MbhiBuXX6gkJ%9`l
zLNOmcrzn-<(9;Gzo{>a;jjJaN(?sEInh|gt`GVE()BOADoz8E&JXY%-A6#Br7s+ix
zBMXbJP|B@=8VSclsn_p;F@3*qc)*y4fBqAk0GWeLcO%~~E?r}w%)>!PMo5a$dBs(v
zbLAGAhY}Ut>#{&-rfC?~gsvjzl`HDv5GeC4p5nWsQ!b}<DE9FoLp5xR#Wo)3_R$yQ
zTQ9^L9|hk=Conr9;0rnIS?%258EV!&E=1Er=x?%a^5@lRf;r!)#`Rdh7KXd%+}-NO
z0teC5<gh8tWdnM24$c;Z^fB=J6*-D-rzl9QMk&A^H45b*nrP%1lk~FAh9CvELXvL(
z6!fEIB?v@wJ+vIsZYac>%A8>grZjH3V4|isasbU79A*a--9u5=st%$V$=O1MDNg74
zdlU1MvvWaW7zBanl@enl-v454)9$0A&Om#BFoFvjm(Nm?psn(1YU-X^o|rrK5eUuI
zzM)%uE*X5Lfh3!KBq0ZE+pL*8$r%fxXjn(mRpwng65HR0?SFp7bx@~dZ87C%A~fGW
z2)Aww;v?;=#7*xFI@5f5misLO;^W5w6QOy@OTNwBSW@h_PG>6q*RJSxcJd-i{Eum(
zGZ$;Bo*R__H`6McW{minYA1oP?1`;wBM6Q@1%Vt0#;b{Kyz5l%N|~(#;MDxD5T1xj
zg=`dZf9T+5j6F^TCJ~x$r|KDdNB?0_@R`eC$@5+Ung{W_4?Qis@x!^tg?}bG^V{No
zDp#i#BD{WGzN8r9qBGIWt>i5va>{)WZk|WjAr0#F12ADTHP*YSF5Wz6vnPxsfGgF$
zd2VavPLTlsH}5tJ;!+V;qME48rV;A4ZKI&ui$g*C_%EQY-aMn-Mt{k9aCQc`4a6W2
z{8DqZ+2j8oi&SZc(=`dSAFwdS*sv^oT<5rDn%J4Ds&yg{-n&ZwvoQZ}MC$FxIHn94
zf%U2K`~6f;F|jfir8Y3O)`lM0=LBRZ^CFV9RNY*2pe2uncZrmaI(~j#6CJ@IrbZHe
zeJuLt#xYnbKX{Tqw8v33g-xQ$B&viYv-;vzfn+9gLUx@TDT-sT((%p(T#c#M(k}ZZ
zI&}s-2;)b_WF%8yJh`!g{XpaWFK(BGQv|&9KcV8q;St9t-g^)1z(($WoJ`!+<%#QG
z0dP#e0{nAC&D|M;TL<6r#opqQf*I`1IOe5rtLUU=xQ-NV98>P5F1JUa;4W4_<wZs@
zWn@N<EyQ5f!N6fbxy%hQks{|6)!x0obAbatEfTL~k#1t3?d`qUU9PYDLO)lgT`2B;
z*Ak(m**f}lbysEM9~}Q+rL%qHW-3Zc<Y2(F;soRNN!hvBFbso0bS1}4a%BI-Dn)vS
z)kuXbfWTn<xdR#<vIKa!$T3x(xfL-R&Ih~{_je`d{!FS?y+VMO@)YFDH9&55+*%{R
zOF?X0*68zQjdpJl69!!2w5U`wngn_&x=4!CTZuW>RY?N8bU<o%j&v5O*#ZK&T=coj
zN_Q4%c;AT5;YJc8{eSo&*igyH<>CJ~5BZsH3BA_^B?7q=tOF(7=)pB}Gz1ac+?I8Y
zUqQE)rJy=%pL^XjTY#3CAs>G0=|jrq(@eCslrkP0`ViL?w+Z+~;doTN)c`9OeXuJs
z9_xJuRH?|jmcOTR+IYvZjO;K8)rIog_C^#r8%Z`Ub-G1Xf`BT;C$3`r3cB?z1^tWb
zc;Pp2$`thQTTh|SbG1iOe%%0~ZbT<Q%E+?RG|owKt6PZ*j8eQxMBTQo+$42Sf>HX2
z^dP0kLqrYBgk?S<T}nDlAD`QovNNz@C<KA%O6sqA?!Q=*rtfHKQ~V1UP(<(!IM9q}
z#Gy9vvHaoE@~Y$sLiwRtWgUOG<!v@qY}nk8_-~2#C`YITJURJqQT(@rgUkol3UG3Q
zm`%`$83{ywW&)awD~o0-x8&Ka+B~Z2;a3MW`vRL3<a$v=B)3Oed6XrvNx@Xn#f{Zi
zQU7-!5q3>#q!y>|fGuy?Bfv>P8yAchd2->(OOXUNsUYEaScWBfshh0?I4MtMEDt{-
z@k^HH{sNv9NtUW7925$+^6FoKP1ZtVn_7rPYcVyq=M-(Z>Fac5Ohc&NkZK%|a0EQL
zn}DdUc<o%e&Su=fd2&vBba3OF$6jqp%?>H|Y@m~B@fr=Y{rjDRlXu$*dvoxAnWuCe
zD7SW@Or9Ec0te0nfb#cB<A!?8Js?J0I=g`xCZ5}6GfB`LSJu$?QlsYajQ}aF-)A{P
zxnT!Dlz(E0u63|YeX{}?EO}eOld`i*Vh{#_@RgMOk^5h)j&+w7bs%qjVq%Jb*?f@n
z0$~6rnml*_WH)(AVo?Jzh0`<#dz*^gtdGYeC^X7Kfuc@Be`e!<mv94mIdNHx@EF3Q
zi3E$H23>Ye0w8%SfKkri7n<5#LeR4NjcSRzlnRZ~Djky+mR{lVO6+h9;<<65oqF5u
z&SYRSYI<UintQbCT@xaK*+@|O>zWqd-!fcDFbD%*bx*nKp3o9&ZyW?eG*L`4&QOvH
zjdDWn-UXcn>c)0pEd~koiMQkomnGg(AycZb0wZqO=}d9lg-rR#l2XY{6c*4ae+*e?
zsg(uY<F~KlQ}G)j<zvEJ^2kcxp1!o~Uv2LTlEx7LDy3p#uv%vcyJi@FFe_9_1(A9r
zgn`m>(-lk8XO!a?I}})(nnXq+ZpjWDVyHC7c+AANTx0AuWUqQlRpYZxZQ?fSZ%uv0
z68zgbm5dK(SAYW{48p#o(~a)`A3LLIS(ZicK0t;7gSCJjyv!{;P6z5a+0%1H6&Y5x
zQV~j7hSp8j&dngc35Zf+!$Q(0?QCk_y+WMGK@e7rgd}9tvrKkbwS?Fwdf0z|k3i*c
zs%~D3Y4B}~F`&uJS&I$rq`aXLv^)^1#Lz}4<{Gb+oTOu+9cEG3W0nXAR?1-(+NErh
zV5NJWYghL2MN*sQjKJ|z_y>=J0pUt`9}+bBx(H^BnN%QL3ASf|P>gnn*K#D}Fb5|Q
z{t2SD*L6LlBp&wEY*|&(iM!aLC>|5wK)`a8Bu<{QMUgm@>P*r5I*Hy_g(7&k#qLYU
z^7YT9zPN*y+M={NRD%2f6WxSslxm@~G<9g?^kX0=aYfq{_YF!66VcZ+8p2un+7eMn
zK)+8HilU8^;e%6?(5mwvV*fQ6IrAq?FSY%HZg{ovmNtSPXXlb5F$@CHD^2?+xc|i_
zil!dvPSoJpWrYj^Vp9~n%<ysDdetpx8WmWII>DAUzZm=Y$}@PdE$^|is~i))JFt8Q
zbB;mCg*Q~tE!j5Zu~A{m!x<RcdVe?-Y~aEh!ARr&H5n8n(Ke_{-5SxO8`~mh!Rk1<
zeo`tH9T7~~si2+z+<j_%X7baDsicRJVeAiPjcKL+EF9BR6o>9^bLYP)95YgZ4z!mF
z05Kz_G_Vy+lsmW}OcVFhMAy3J-HKv=?(K}RYcwEF(D0R`p$3Wx6~!S&xT1Hg!o5i-
zriqGp=oH$`9qs%sY5vDfE+o@p&7WeocWu_GXy+`lbf?}=du@vu^f{j80y7^Bbt)zG
zUb!UsH$=j5p|*vgS}tkmg)d9J9g0$DKF-`hG+}_zUokFjFmplc(=|gocZ#8T3#tp!
z?3dMw;v@}PzgMB9#Q`-ROpcw-<4MvlX=h-pFbu=cl|tIIX#d6F_~)lyDcIpJU>sLX
zjTJ>7Bk5G9pO*)%x#MJbP+X0PoS-#hb(poz2I}7yw@#qowtPduI`Im_Y96#rD<E*s
zlSBMQqk>7gWS2FCH)=lZ70l-44%KIpI`8Cnx2rQ7xu7<2w2mpr&Tab@OKU-F9!yr-
zPbpb>X~i_(yO`5&BfpYd5SxFg{09X=Y+A)B-)0xwUq!_!c+FiG825XZ!^zsqw?bK2
zToHt-8{<s08;2zjl#Rlk*=>{-f)boIx6!y|aTIDEAP+?-MlkrmJb$H7r`X2vC6Sn5
z$!uf}a(K<*GQ~k@hKAe7HL6-@#rtV(PN`IHSj{+31}E)6uZNii!cc0oi#~Iy_nCs%
zjDOSb53ZI{09+Jli8#h&{>{YRvZ0sk7y<Rw<<7ALt*QMY()Qr&43Z!QK_K|0WDQ3C
z|FN}_owlL}$lh|IL|_b#0FNaT%HiE*G91cX>kZ}L-9Kbv6i8)MVk<GL<us99!{iE%
zylP@KUA%TzMDw4wjSKMvSc=sA!O;$`yay(DO_eA%Tk_0I<ciiDGdx`XP1V$au$>9_
z7O~k>UCulh#++RE63VeD+^X?__a393)=l26*E_CLz;*EER&>TWeQG_6Z;uBlCp>$?
zw?%5Y$`YIzccvnsR^lQ@htgbw<YoMe(xlO@t16A|xE+Aw_!ptc^+2}}xvJ4%W=}{e
z1RG49ZU2b^xouKz06?|)ZJLYGboEudH|HU!e<ci8mGmk~j%^^fbB&V7ckG;w+|_cq
zB{lY&3LaW<jT1M6lcF=3PjIJFAGt-=ZgocPhX*jAD1L3_756Ta;aJh-XQ7-An{?pc
z*v;N-lBi4~g)Xh*9<75w9J(Sh*YoYm*%c%~41%yPxl~mC|FLyDlQ5(0fP3qSM#O@R
z#A7cZyf3#j7~d>SV|4)ollc@(?x)n6YjI_g`sjkmH1SMHxmT=|(GxWexlC+NDE&;m
z=33&WG9#6_70b6{@<RiY$qU#FM*u0Un*$_?3O9oXq0OFBit){et_KOOud&UPOZ}v#
zv1qXM_sE{%$V3?{x)}&e14qxDw{N^9?gcaOm$iI+gTq=<$H8I)e`z=~Pe{IMZ<C=R
z)+I<KS6>a?cq2ojyyr<2rKx!vpViRj?HnL^@HYPgNI3`q5SZ*vWpk?W_BD-3D+7Bu
zA+c!!_uMqzz}r+3kTire-x7b=oVsk(F_!utq`pDI#CfM<OHAC@y`((O)R;&l;c!N`
zE|8{iIT#y=OM@toX<rS^rx+1<OCp*hV#USV#Zr)DUAaGOU(T*AhhY$gT?xXg-2Y-j
zoosJZQ^NlG6&d3MN<#ReJBEmxZdCyDdKne4{KQ`bkhx@AiHS}wx>*{Twn=gGk3uE)
zM*?8#62%alHzK-iyLQHgh_^3$GuAR$fFcC$##ITGV=M3<kxgxvEpiXGzg>{LEubZ&
zEhPZaeG~#Lu|uqN1vs7r7^}(Mce5-ZZ#jpEYIM2IwbFb`h~CJ6PBcAJxoye;MD<|@
z4yTjX65zYJb{1;^Jlt?AFW==Ra<~8_%DZil#Pu3m^$kJZNS*L#N`}_g@D0t)Pd<fI
zEWGGi%8$_fpgV*J*~*D>3f`Dv;ctlROkpdyU4PA5rm)LKHWA&nT|0F{#0M|svsZE3
zxLC^Vr_T;{VO+tj`<4*5`I;-Ie{{AM31QNvTT0^bR38W8MyfLN6o0%QIk|swickf{
z#|u1S3RfJG-j%EV_>io8FTVLj+8Hf541!Sfmjq2%|NqCD+Hly>cCfo|d14T+7Xl*B
z4`;U?2QCMb%5-vDQM%Jizu-5oRQ}S)4_s8u(mR@$oVubZSjoQd07~4g<@4h9%nihk
zX>qY{Lu4w*5l#-T+bn2knF_Ln1={MCau(2qx|eO+)2CzXIJ?A?{tI`pK<?qZMkz0|
zzxGYB5^-0}+1sm>!r!0}c-`XbEj|^cQ}f-e%HSp=@@hH4y-azlGL-V!FH$tDo_o2<
zl`6Gat5#wpk>xb!#mcbyu&~qI4{5Uvt;l&R&W?L*mC-#%+rR=mUgH(if=dWDl@pW~
zEPF5iMHQ`T!h;H=J&gQ`Nsa|CS&H&DgL=P&kUqWKR1VM<SPv|mf75Elx{zoV-sRe8
zG`%DR*17YiGzcp3O5YIGK8uPC9H>u49dAw`zZr}>+c|+=y1cf?1C7e7q0GuT&kf%5
z>LnMxTCC3)&-->D$%C_VL1GvLf#{X+1J?UrtesAMBqkj(7jTd)xUgvEmBtV_0_Nvq
z(Q&Gt76SWotm};RB#EYDAj7EKEJfZ!!ioS?(dV;Wd<CpRzS4XXHaag=r39>Uurqa=
zxlx%t?**1}?m`OXa^?{XYgj2$D7;A1g#L4*&=1fc7c&#reGddycYHMxdlLw{&ofXp
zNW`kw#HmiM0#>pnL)s%oePe00l*ttf!&T`>_0|X1kTg$Lc{HaDSDAyoU{#&13L(@0
z`?&c3JCFDI0=j0u9;bT|Xij20v1j(j84;);&HjHt59UzfGk+`v7CO4^RSLpgSs(If
zoBdLVkQHM1>^C;Kr|O2M8ntMLEy$zY@moyT-sAXdAl-|<Ld(7KTX|c@A0p?_rK#Dv
zi=}l910>E-{WHRIOb8J->0D~RNxK#-1VRvaB?Lcs|BKZt9n9SxSQnT#xDz7ibUkWo
z_tPCFoVe!Hk)i15yS1+h_|Q@S$(k)09w!B*Ct4eUzD<L|8LZ6TK;!^QQKc`A5_lGi
zi$#@uG0i#W2<9zuGy<E|2>vldd0#7Il?ngxl_(G(lDVYsP?^LpH#A3B#h{SQXFA9v
zD9yyg5Ll~vJ^alZ50dF%v(mPc5}xhO5owr|iM`w`)e%(ROr{dqMBiNE)sL^6t;8Lv
z2B#8V>v*lnss8!>=GfC%WfJ^s)LN&0jbM|{rM-m9PeKP9dxzEq<rJPmaKcjv4X`q;
z=UrAK)G$=NS*x}~X$mx~`$g<`0lq+8DBTn~+%S2#pG_0WfI^Yj1?R}c(F3lyu5k?~
z3_+V^W9ADh-*o5+wOa-KPRjf`v2hg?=>^Y+7UzoxXXk=zF$e<DEs5Z#``_3zx#5u1
zHrTg;2{j|q5r<bOy_;+*=W?{w<eNsy-6}{gzjPd({Fz(7E~K`*k#-t%V)9Gs#<8HB
z=+pB{6aT)Ug`1~5zes`TjcPxdMvP)8FY~0#JCqeeXf*u-<zr21*l{qrr(W1v_8dyM
z?l)RcE?&;}*nc^xgeu)QmJQJvbt#{MzM!CbXDfI585n+@kAPWFlrY8y#BqeJJVyQ(
zDMDIrWQ8!nh>_g+ZM_I=50~?~wSOOY?^coMB-i(4U+@RZ?r)V<u-tS>s24i7r5}(X
z*iN$Qwwnw0JnzZ1X9h!Rj8>w9wW_Eu#=-33gy6z#C0DSeBCBhBV7Mov1Ede&7ZhwC
zUZrsc+V4|;QOz7mAEH8?h$p5eQ90XXA~iCXRp}`j`Ol41*d8y}8>z3MtLKNjRM_r~
z7gA?z=lW%>#(Pw1O}|7nAEK%cygG>L+Q?AG|Dd$|k#=rL5`r)k-4d^e?0;ipbr0v-
z;&hPt^DC9an2KCD^oGn4%G?Kr;|YSUueU`BreoSmD6GX5zZkk;8dK%eYCqIb*n{=*
z)HOx5?*pwvIEx8##9@lw-i7mAc7|hP8OHp6CB?Mbjj1Qqj$)clr?W?|d}L*cS=C<t
z8{qymK!zgon~Wq=rQLL~aed$wl4&?`AGRA)e%d9O3X@W8&8svvnZ;a5Gp!6oCq%}h
z0EJu$pdT9O2YKaxgWR<VvSGQ}%l7vhEaB9UC%md(0t8PpXA0^{=GYMbB^&=G&2OU8
zOhrgw);8^Ao*3J^X8Mu!wPH7@6x;)xTU^RIFx#FgE)<RdddI{zy(q=h&}$mX2;9jW
zCc-OMK+Suve1f8se<@0?CA*IQx-a8+X)MwDo7tiS)0VFB#n7o6M|=~hqS9L)QuRaH
zxga47!a(#&jr_{}FQ$X?R-t3!c!8ZHER<#wa;W>G1RUgCm*A#`G>z~Jd`?UMx`6G6
z1(agiIgEQ*p$02lD9-haPM!OjK^d;PP`5oXu&-dus!4WJUalfYXiio2KM|EXJGC%2
zJ8#X5Bzp-sST-^k1s<j@UOydbNT#NIFXO7x!Hw_mDT-ujROr}za`_d%CzO90*Ym=`
z3KZ2$EdbTGJ!l5o8Cw-`aEhic0K=^hs1ZLG3bw0UtKU|NhE`CjY0s;J3VY0|3$|;1
zRi*kikPvOKo!sj4mta^WNhz>#rgW;XXVMiV8TlAL&2A00H+aP;ymn9*9@vAeT{uYC
zlh_`BI)Tz5!!LNHZ{3&QtWnZSTTfyhV$wXs0MseAr`17OH9%b`!$Bx2QK@o`30$ra
zP%YIz$#AB9JMSwPvnsD)e{5YI#7Sxvd$a1!*|{Z241!Q}OMs)8{cmhinQ*8w>B64>
zZc1)04+Zg)DA?ZNRmX688qUTS94oJG)c!;fQa6t6qk?+=m{DEfubh`2W*Zv{&KCuN
zy<<39ryo&4z5k{+F2O6Vp4IIFdT`c0=m}MNPa;8{x?#=-XYC^?>QJ<Qv#Ml!Td_(7
zdp#uD^nmRoMcN-&T`Mg`rEe$DH(L$oL~TRC{`3q_GVHA?eLJE&733IfV+%kDRXI^p
z<|wPD4b}<dF<(TXpeNfm6pYGJ;}&5ve7mLVD@B>e8V7$Uyqx0UReg!X1mE7<^9v?c
zHS8wL0dQGYH8iF{c|Fe2OxjDJCqrfur}&1b7}YQFtXNB|X7K7<RjWn8cCtQ=?a~Q0
zy>iEfsAM~pr7R}!L{UAW#!R@c;kNqr%cDmzVS`u6b^&$;_KY~A7KLw*11Hr8sb7A<
zsH5I$UC+dd|4TuI?b-0}IAj{LwcgR&FKK6%BQXpD(JKYwH1_>3HtCtpD=T9OqW+I8
zz$^~M0*-1&EL5~VVNlvmpjTUP*aNYHqfUl1ph~rqqi~e8T~0>Y-cZpaKkBtG93qZ#
zGI{fdTPzslQN+ORV-#+%-)+!LiIjN6Alj~<I3-dhFPb0a^6kh9kjm6MP`E*G)G4Hr
zNHHZ+DpdKxaCUq<J)#A%gQL2)JNOx4wDslhb_YjgwUfDe@#JLkzX=CNb#|fo27Il8
z+9-$}WQjxyyQ@C*?H~HmqXMc13^tC^4Hm@Sp$a5iO*d-LPuF0%gQHUIX4EU1YcO8V
zT_267lh`L&wFfr{j_OWG?He;B8{4~cS%ITkA782{IO<yLSD2_ooPAX_@VejN>92AX
zWlZj0R_Of}ZHzZ=8*wntGq`Zn{|uU6`zUJ+;@hv1;nU4szu_KHFN^TKFKlq!ZScqk
z$(-MgyNdpb{fDzFNrD&zfnS;+DE|Lrlf&3;)GEl_a-u{#EJDj~+x_!m+etm0Oy7Se
zh&rm`azHCGdIL*0?nV*RQ3W?e7`b?H@NS9QxJ1jrGN59~7LvHRQ&2~ROI3`nP>c)F
z7GFmTxTmv%4h88Z5~7H9P#4)xG+N$rt7==!Fm-)9O<w{Gc*x7SS0pJRzKY9(qKssa
z@OI?RV=zN2arIL`J{7)K>$aX?3Rfhbx*ZfG8zdnLS*kM)$MuddLXQ0)U(v<3H#}Hc
z1`X@}ivK}7p?y;@g)1Z4`%thjR71@xbAm+s38L4V6Kw0M2!`MK(yM}P7kV7@sgX*a
zxJWVDcCw5>Oz5bq$IY-ZYN^^sS=O%6r)JlfveLxjy{gPo{h(lZp<tCYiF@ROG<`AJ
zYuR1u9&D#vYSk4CvncmBqHIk}rhIU=?Fj|zCJHgbZCc9H^nE!y10)7P7zlpJKos-;
zkJYhe!%#<JA5aFu83Nb4JP*~z3-9?eFCd-AX)@0YaH(RvGazE@!H`%WXm{%pDIvqz
ziIvSE+M;d`NmevQhfB5ji369a{tX`a07{7G=xv#wgK(*I;=7ww>T`xmWr0G4T)R6?
zCRY9e$rI~J51&owlaiX%`V)3>?~(&xu1-iu+zVW4!J}Y_|0Wq(H1U`Tm#P?di@QG_
z`xdA3{P1enXn1p>D?;V$_WULxBSr;R*Zj_IPP`OlaOGTT>|kAO`)db7jM~XQchJ5u
zt9j~!OAUyYXud(;$<(asBN*O<9Wg4+WmIS|RFzs(6Jd`Y=V5B3W2~Ac&<>Z1Bga~6
zc*eM)Ln`cT+(9WdGDBRK5(}h~>4dFOe(0N_>?T%q9BP+Dsb<RvhPwrxgHDH%(U$6x
zhJVBEa<P`U<5-~mN2VTv@YWKHiPcA2BTYFZeK<QC9E(8^2w$oEEY|y9>}|68ky;aZ
zdw~gzq)35rKsnot_S!9H%ek^!uDOm1SDI56J<FwYwD;IJ$ekfaBPtHIjog{9R#oKA
zboNqx&J7162$3q`g&MWLWCjNPkEm(|r5@uYQCa}k%`#j^yZ&6k8I4r+dzBUQD~0{e
zb*0frl^N<0%D<h|_>Te<CF(3C@@pL8JUgKUD90*6cFPF$VCAKsp?=mJ@!)D+MCDx0
z8;#UVH`kQZ7_Qn#JV&U8t{B5tyc>gqHLh;B$|NXn+Izt&F750fa)JZ2C|75*kvh&z
zaP@hDaTYN(8mVa&^UM$03s&hSu8=PDR+n?L*+|`mXwqJT^3}m#C`K$?zc@h}sp@1d
zM#6X?!{t1IU=o{P_@`BEV^wg123G~ExW>%s{Q>Z2RsRO6Z=n1Qbyg2G&1($RuJacq
zlJ+xKDyvnZAIi>X*+CctqQ6uEjq(3~>^jqO*3tGt-+W>cTmxZQd=gKyu{IiGUwn+)
zf&AgTY8^5VsZQ{6Qa*D&oVpv<MWhC$kKhK!5csVoCR{|S+^$SJ>lKHo#s=rz)D%Ry
zO4KDa7m*qy?b+04kt9wJ42gE~nBa;!=b~OwSLa+rYIZHYjSh^yR#lr4k-8*Rm)q%D
ztdn*ZkxB<bWKJ9QfU>M<IF}%GQs|?hD8zo&g91H?R6n~te^wGq{j_>ey+fpqO+O39
z?I!7G!&jhv8&^{vSt0M4n&{57Dnq=RZ_rj_gA`;WNaa=%xxwSfYEz*7B(fAlcTCkE
zj)+unH8w=y>le4j<GZhXqw2diZUABbfMKrvmsJfQnggpXM_-3=FX_BN5vhr*H!ufA
z+pCJJDI3}Ic7mwYwP+WSdJ;O{HW=0j^deH1U1j}Jy&q?L9dRI1KOcRRA4dZWWHN-*
zAssNQ+K)j0$Jx2yHV}hA^h$;Cy5{~Di&beKk<$p03ykm@v-}21sQ5=2oNuKMpmK_D
z&ROB-MSoyt&Wb3c=JtWO88nx2`1RG03fsQ0?SX&Aj{61~M{rVo5j(H=4hn6Ld^q?F
zP|s{M4tQ(3=-$`Ozt|rewo%<sq%5Rnav<{IklU$AUdlo$y_6n)LXCQ{(S};DA;6gD
zB=k8udX;{=y;p{oRFG1iZ;(VEvyQx>3=~pj356$Pnf<6O1BF!4i3c;wATEu1$=!z1
zc|eolw?hP&b=FrDQlF(Vq~hVs+8|F_!ki2_3)7}ZAUC2^3aPsLZ8m^TsQrW*P^s-d
z=K=EuFU`gcE~GM`{Dd0yLgx(?9ecHpT1%CM)UfwA*piAus?$&;`nVu2{b^VUg|=Hl
zT|muGpmcurVNOKPFem*s4)|i*&FM|j{Y&jhg(tHJEf*1eG@u@wodFWVAP5A%q`9E!
z|3B7Ds!N(?2GS2ONG>OG3T_ItqpFKyyWebSaZ5ZQq>BEzqI)10iq@K_esn63v*o6V
zxn7O=t}Rv*gphjn3W&-{CSKqaQU?So{w?^Y0gKR-b9=dZwN}63nK1?0QS_wcYU=Pg
zG^OhT2ga9y@e%g8al8;xPki+o_MBH_GKD*Dy^zW9{Ie%w)ozj^NJh>KG4&y&vO9n6
zgZ6+Kw(Vx4r>f>-zA|2ccAhj!_SXUtQdRnOfewaE@s)caq>B7X<`8wS5~gmr{qzOx
z$pYba9?^5vaQp#T>f=$W$dE<<5E&#BKc~`*OopBqwAV0s(~rav03r3mO@~*rWMN|J
zS4(JK2&q!}{hh5o`GTOGZnd)dU#vho1v;3as^e9B1Xzo6J7J&uV5_qUYmaAT@1_RY
z_rQ`sdO3O?!*}LNm;&vn>Oi!2Z$loArd`&lrP`6xyg54qTnS+ih+gUAOk;chi>=Am
zhjE(}_X31cq{6^(M$z^>;GthZ6yDypr>z{@sNbN$QrU(SY(olV66b=biMK=HsXhIw
zV0OGc>sR?YvsN@*@GHEX31u<Ot(_pVZp$=Ss=%GKr&eI8>uDngv7KTjks(F7&^chR
zRQ$@!<2Uuc7YAf0_4Z6qZ|4SUT4{2F**TC;YC#m<o*6w<BuO|>AdNOyDvWBOLA)Ai
z_JXaht-jD}G(nH9PV?1zD#T!^A|Hej?>zLssDiEfL@WM~I~e`CE^4q;F^?bFSo`XL
zV5!P1HH%Kr0Tt%Oyv6s2L#0SrDXNItu7KRrRv>W~`@|9D*8w@PRPsTQ4{8uaTS1i3
zO3xcS1nh6L!rO-?2c(d)Ue05%)SHVkf~`z=*F`6TrFu)h;_(urXKPk$gQZTia)`R<
znz71YsrSebKYfE>slJL%&1|t9=TFgxv$H{V5C(zpm6~Sr<NYu8tPLNXsTO<}U=TM5
zyI}Sg5NoMIOC?s5%&-?7tTb+Mtk6<FAZkO%lguz{tUHUPRB%-)i{X{qj57%tE%oF(
zxNx5wLQr+I)0k}Se_nYdL#&1$9E0eL+i+E{WONd%cE>BURJ;0O!Q#mgs_O`arX20f
z{)u6;Y71e<JaZy5u$21Fr?2De7jmdWX7+?B&<-af$V@?Ij`$BSVkz~_RlQ7gyM?yU
z0_^_9p9#}a)i>CWNk7P({D^0Cg_bHhdNPA3ijMe&rrIx46*@XmA)}@0(XMfoO2``5
zUM+y6AJEah0fq-)@bV+>CQM6xHsh}<(>t9992u|BQU&QG{wG;fZg|zobuHR9M!7~z
z4v3}HB1m$vVB(t&@j8{zQsq>b9HMv5AX=&ljfu^R?gkk0%y<PSqc2m9x_u~?In??|
zto#i!hn%Qn&{BVb;V}AT>W{Q@!EqRbf#{V&G8laSi)~bi=T(!+PJ021z~B#)vENP2
zN@4PXMQY059dgr7VX{)S)Ai*J*#hmIy+VIs0nz*e;Zi$HoI#((v?bpPs|vKos;&-M
zIr$<xE`^DL)RP{Zpy|e634cYPFN6t1siNg+i$BSizO{6nEzo{36=;9m#?;jKys9u&
za(!^Aq_wx{$7qGU@=E1(;ws;(#igD$my<E{V!jdR3mGzFQOyz2J8ZbM2RQ>=su*1_
zx;+ayRm-Q2D7aJ<%KuII6H_WZSycShxI=sU3Rk04rJe_n2d@yN?lDvmZi3+nGjHRm
z5okwAiUz7N-=p;cME$cV8w{2ndD|AvOWxk;0Mlj1gS;Is)i(b9@Q64(u@;hTxK!;7
zRor0WpgAhrJ_GIk;|VS<b)Ty+Id%rqcC-MqaGe*I`bXN87&#Dwu$GJsYutZhmwS*h
zjx(^A1~lN+tRI13RF54o#$WWdZjgam>MPXWrzk^_?GRt64`R}U6yC3>rE=N-`vu8%
z?9Lr$hJNR2`7|SSe3;;(;Xpg^>K0Ug-`_fClybRv0cz}D@W}R3RC=)Fin>0fHj!I$
zDVkEX`ync5^m)UPLQB=otEHo@cz{<q+ZS)CaRu;DmnQZ>FO){;@_pHlQGKVHLajZj
zLAPfgQjf}7dvWSe6ap!0KXMho8ebsS4n-pi8>;|Cdky~-3T#J7vtsa|D%uM2Q=dUg
z?Hn#V=kBmK3kt6_+Ttl}@t`}yePZS|=>{$J_kB%})=z?PVY+gK*Px{;<bFlBtZ<{R
zK!NQc7ONQk?HGX}S7F&>RDr}4N|g&Ot^*B6c|ojUQ0g-j-mh@jE<u6q7-$Jz-ApjF
zR8w|gPm<w_v$IQL5C(zpl{B*G{ZH18(|n}S4%j!J7=l2478d*}KZ~kksS1i4s7Qit
zv9>_Eu$|Wr%5(>_=b)azQjMlR<I%~ZxMeSB<t)&D2aXq50@Sh8#8xG<<LwGtZHQVP
z1P)m07|!jld<B+jylfjU+s`sXTj$JRtByHvYFcq_r!*qwh{mvD&r1Z=wyRbi`Kmq9
z%H}_~8tn8Y?#?+8tD5G_aF=9GUrR;#yiJ^T=^db4;?{z#BDb?ZI@TSw=aSivo50au
z2^lQa1ZzZ}(h>`Nf8{P3SSr;!{K3($a)eibrCx3Iaoeh`z*3DOPjh0>IU(m4UV)_!
zqBb`AVaF+m!rQ5>HRrI+xDZ<k3&h(QR&0Z}3sJc<1i^2V%0qtTZKsO0@CWy+R-%V@
zp(s6XkW^r)VXKV;Br}N$^Rxw)YD`4;-T}HBydTFmV)EkbTx=YMVHmp7IngKGf3c#-
z`7sR)NX-I*Bs2bmrnw9yF7+~k<DOM(1TPQ#<{b<pc-y>FAY7`U0JX#kHsMlhdm~4e
zYIEuvOnr7*$emf$xDuBd5LLlFnZx=o7`wRC(B~YBUNy1`eA?&#E0iyLZYV(O3uZ1Z
zbs7l`HjpDEe(z*;EJ7X63KZItP{@ICw6R*%=yFO;c$|58*uhmav`Y?`y6BaSP_OC_
z$AxwT-5GbZ+vhRCGL+DMEV82Q*(eaS&wDb@v-0~0D%Ae~oT2Io8C@y`J`a_PtT1-Y
z_@!49?SUUkNQIsLODLiJwJ4B<zOmUBm#PA7UldsP3NG~u2KMdA;?+1Vh0xAvLKE^|
z_TOi4xYUKrJOh*AhRoc>r6Mb^c@O!kS2fz<Qa8TA4TXX{opo4~j~DjoE`dpxioocW
zE(s}NY@l=s4kQFdBaL*YG!EEkq`ON}M|a~0m6U$>{k_-w{>fN8*Y@n$IrlmD=N>nJ
z9{Uv=6_~~EpP|z#CW@0FojjN(Hv-dv1tQ)n{rL|R^;FC8M{wY}TGGp%2^-2Al8X#=
zO~FI%z_@JfY|mw>*@?ljqJhk?>J$2j0lWtj#~cRl44^ItzOkWffC8F@i#%`z#w{hE
zT)65Mo2^YnqVW7p<jP4pkgm8+p_d{9Sd+f#9_d>RC5HP29|I5Nxa(HjLpVxPUzz*h
zj%rL>_HE?Ofn;ZKQuTi2d0+#aFzmYru@>;0+@Vy@WhO7T0#6`imT4agzS+vE#@##@
zx7ewO?XybaUicF~8L_Np59jw74HU%bDMEFS42&7v9cV)p)tQwS0|X!rP#%Xy&NUqG
zr-rsNpsQD>J;4tj`dAG&K!B{O!L9)Q0ULfrVozjKLXt=_O4P$z+z(^s2D>6`UK#{h
zN#3e%)g0yGn0-X-x%|NgP%zEDK#q^WI1fW>zHOm&Ha$Qtdw|Ae16|_Z%l~ppZ|B?d
zFu9%||7S`9j~ItxT!<y(`$=wK6<=&M|JbC*>5f9Qx^NxSs|Q+B!9+6d3f+dj{l|B2
zJ(Ec`8v?N7aPGy3TpiO-;vNjmsVbnALE1rIqlX;yPouD7vo3EKHIM~yv%Y{h136l-
z0P^mrOJfM|urT+0HguJ@<T<d^ILj=NLsDW$mQFz-KY+B6@w0M|?&iUxgY=l_Hwx7x
zjc>qu^9%3U5lr~v6a<e>*V==>b^?d#hUbrlU0ysU>(ZS$1|O+E^dG*Ik-LnxvfLxd
zp!~pSfWRp<Qm8Hpe4QN)Z5oLDwBFN*uvr~9mjT=|I=L`XjZP|pNPD`$$e?Id(h#+m
zeoC|fxLlRqRIKA^w(r>R^<T;qRIG1<u;Q*f=Q1?`sU(aWN@ICm9411yBATNe-+k=<
z;3Sj=e_ef^r9O~Y+Q~XCzqSRGeWOS9>|C7wcH$6Y^Tx)cL=vf1*Ea^bVvsu76|&l2
z@assaP=fmpAzeDbFe1{w4X5d8>2dS%$-p=I)Bj$NM9+GGmqZ&w%R?Uvxe@2*rZQ?G
z|M}`^2sYX|Rqx;}(Hz<CDZva&q8N?15y}IP7=!jj#nt+FQ&CimX+?Yq8Wn$ASM)#w
z0f9X;bs^&PdLSdAu`U97O*H<{(aE}mBAX|19E*@hJ^IgnlLLj{jwgR4OU~l2E(IL2
zjOpY0;;&Vf>wMYm7j0J2DP-I6Nra~zzdOYVh!&F&wyl1i6gAic59ASKB631wd!|zM
z`uDG(KKP3%H{PX2XC@UpuT@?FZi}B6y6g@jo~m#oxQIdl=R^T1%KZ!LP;ySs^Juxu
z3WvM+Wjzq0RC=0Lb@wW}hp8z_4<v}Y7H9L2h3Nr8vl9UIYL~ELptxjwGGHeqq2qb4
z(?3zTd})V0RK%$I#x%E&#JB3cWJd+Vd=VxK!7yK@lYU}k#iOrQBVT_h%C8sTpmSZ#
zp0?+@5?D6OrPwtcF}~Pi@gR>)h6o`Dp7hm4LfXo|s+=Dfv+$x4*aIzR5}G7&Epu0`
zT>xctJzrO!WtAGXG?7kM=;<Ap*hbtkhrJTVGQ_oPpy|$TD;po(Xt4k0!Ts@u7;yev
zKBei@6yLsk$zHogSP9s7Y9aFD;vs_X{!Qw0dI-Y*L(AKXY)A)8+Nfglxy_>&NwzOQ
zq%T5ymux~p`$#Jq0TsPVk6zM>%tMn@PbDd|k%}`Y^SN#Yxs0Dw5X`4cRUYq9F<2mq
zVEZKhyg6b`HG=@^9zLcBL3Ur`5eAtT#4%d~w2_T#q+cD_i`t>eLI`C^BQf9o+wVEy
zMnDKcQf5BUW{FTI@?^QwTc)~)qIJLR?FO^Qb5HId+TtDQC!_csic%@QwD*B70b=(i
zNIKl_S*Qe=>$#29)tubm|A-H&M%2Y+H-fX~g7V4ptn>IUbXb9b*fPjzmx<SHGw<q~
z1gFD}yDho0ddh-=qqnh@G`>tz7=afiOfV-EbRd`41dVMJn4STP3d72OILIC)HG0bO
z$xS>B^)twFeGnoT%<Tz80Ifey*w3yQ8xuIQmnQqFqME6pdDp6D4JvJ4Ib%Afo)rCy
z`n;%8Kh%sq2+@Ae;Va)c#4Ln=1b#N;Cb8o4)jrmSS4C-!{AxXMt$6WFDHR;wuos`X
z@F?N*Y&}~#J;vfdMFkUJtHq@Hsv`pH<Tdsq7V)|>#J{6ak9|?o)=Dy&V{JnyTw3L|
zY3)g6_JgL{GzfB7W?0an?6+>huaEu^!bzbb%I}$26pNMpi)88!<S<^3O6t<q+oEye
zfpO8yKW8*XG8&x{_x>cb_=-VGVp5Y;s==Vo3z*)j98s&kbZ5JWPxUo|I)v@5K_RU4
ze8n!nqO)MHgK@3~vun3h5Sprqxt+@K2ce4v`8#vJLY}IlmscjH+h||T#gl%#rS@OZ
zd4mR4c4lrLC_4v>U-IWqIEXi7WJ9q9=XVooLHy_8k>&w2sKDQ8zZA-TF7{&i;Jl)g
zh{7#y%fY(pf4?Q6*h<J5@z&dhtO9=B`$WIuk4}Z_R^tooC-1hgcRZPg(^}atVzcJT
z<L6aSpp43F{5ujgUEiLa@G|)E8GzTYH#@a=!WbFTUYx;5IGITLGphj{*t1($Zf93>
zYsmIS%hNA&Vo>styB^QBW*WVd`GAnGvq<Etqf=3x-6_cAmlMb8c#mvrqSBolpLpC^
zP%fDg8m(P8+PbOxJla>i`gyQ=VYzcS_Ns#j*T>V26b6%AcuYW>KtM8g>#^u<@r42g
zs`bj63a`k>_!If1!oq~prp?f+v}be$v?i*I#@cB!M-(p~JaSH)OL-w;mPEmgqY7f;
z8|CXDm64E-^D4+A@2$g2OwHx62&Ob>tqqAA#n$&`+$OaM;Gz|+d@n98om?QPvp_OU
z*+he!=_k2Xz39ugRUi|9U<&y<=*$UDGeHIr*qF60$8Yw<6uPcCdqY=6&0|O!zQ!u7
z;wPar<*Z=gAh@sHG1MduNQxB(TIj$fC`{2xw{-onluhoG$Ku)K0uV9WnCI?sQ!J~+
z9ZLg)8!(D&n+HVWId6R^FN#6LA>R}oRq`=@y?^HOKd3^_2pk5EuIf%SR%!;9`VJ+%
zK4(zO{`~+HY6Yp5_kFVX6;ZtoqAYQhv$e#gt_C-Qbvz?jTfH;ukeE(d{zY|!98Mom
z{Z=`Tg1$dYrfa!V!FC-qLk}RoqJH0(o>}lI^Lpoy%$1qQivAxw6sr&ezJ_$Xi*4lM
zT%vsAM8vl~{~qgBX@Q0N0>(H|$+;m$!P6r9V*@m)&rrK4sfM4?IxPl6zVZ4K>bM6t
z?Y!P2%(fn|S|TlevSh^E*u=X8xVZiI$P{@#fXPl;n$*%aU*6mV(Fv*!#;x}2Y|Df;
zgEgHcsCRS~8qK{^hy^_92lz$rUrhQGdphGsJ7w??z)P1JECBL}y7MU+Mf=6FrHc>S
z5GzdWI~~U=ndQs~>1>M8l1tqP@m<bTazlhfcbziTli_CoPjUQBeD~dU`S|R?h}Gsl
zC##)qtM9|ZX-ttDvtAB2h%sjT^MbazfCte~3UJ^pk-$02=HTd!H37n9=rr}3mu&;*
zEyBgi4H0SIKPk>&zV*GJAI_@#n2qPU-Fv4txv%<WM)Bo6<F|q@t_TpO5}m(3miqdy
zakLi^u->fPz?tyHuQq$G9n?s<_;3rtgj|wfLM}T%M_ha@7#~=@&x`xmb$l36;rre?
zp^D>)f&qA|Ay>?h?($=rra<#)?o!kyX#5eg{^)t^-|t5ajTTA)H=FIIp*dtU7Ta+w
z&lVBE9#Hm2x|HQI;lu(n8*Z}y;3CbNPO=%vTH@&HoH;yl&SE!_F+r)U@0}SCPoZwO
zZ|o%gJ(_poLVJbDi$LYfOROS9OZ;O%`#wWV)hrHz`Hi5jJxR6WE#3fc8V6KNkbaO}
zR=lpk6`}0N<1rxpk??@heqvm&C`}^vsj3(!m`}j7soTTPJ{UU#tt2hI4tiP$R>@_u
zAhxjktVVvWE|jPtjF()Gb_jELmN7aK1YtOOJw*+zQN#x1>&=$k5jBG;whx}lzeOL=
zeo*|yh8jGQEB_4hFi*`}<(6xRpcP&Rbt$)?kI9rG*WC5yBu6-6WL4z8N=(5!O~R|2
z1LvI-A06!zrpd;;+0S3Bbs4}2Brt44+7IvTUe-Je9w*NX^)E!tV`1MGonX`H;~o{$
zo!#_c+4zjm20)d;{TK0uqH}cOOXk!?I7dfO<yb0%iq<mUJXHI-VRa#=&wuWH?l64!
z8<cWI*5qiBv>E<|?EI*~U0bNLo6m~fAwSM3d<<4QJi930_%mbl7c=h*=a2<J>WQ;u
zvz%Q4-eSN?=x9wEili6Lh*w73N$uZ|KfC9OAQ-puurhI_@l)>E0L8s-uzO7Dm+M3D
z+C#h*Z}GibZhZw%A^#WG2CUEMgZLi{f4N7hPFyS>l!$pI;dd7J0$tWJudxm=3T7wD
zgf^hcQj@nCZ1b_+!O33c&kVq!`Zq!LZw7PwUO{6(b5wAHqvZ!)<UJLq1Ac}tr$77v
z*2zZG)W=&0fLO)Ng%P|gj(xUqp?K5RUCZ>%k4oU&Z@1D}kc;5L%Oc#62Xo&17sWA;
z$!H~$!!S)jn8v~L?NvLcUpQ-ltR`(2I|pAn@bi%opX?&CX*rX;>mfCu(zSD6eO5pv
z7&dR*Gg~+Pi_AD;vn{~R(C4g@vRjDe=q4MoiN@TBbCkHf*cl-$%CB<NRJyPJTJKWt
zvhK3(1Yk6o?`G7~*Uacxzoi9GlYln3Q!JdX7yX5AmN6DJfE&}#U1O#}_%|Fsb)F@G
z)+#qW+i_J+jN$^R_#uCcnx!Igs6L=b>iZN)wkm&6ERO)ECt^~-^j?4pV_{)qWL?9U
zK$^}adH9?IqSxEcb%XilyYHu|OD-aS+JfKP;EQ_8?(?{$6kSh42LuJ%o$KKM(}d4-
zHr=^y{V6{qbz@H8o-a`k=6^reZnG1!C?lxi)eOtDy!prPk|s7buBFMhwC>1-%sq)s
zt#~uz^bQzD-L2i?vYwRZF$)<Z`>sxqi}@A44bcMUR9mUj0&<hOpHlumB<>z{eoyCE
zTDkU)TE_Y&or{p@NgZF&`irw*c&Alnm(xr;=EQuf7%16WE<CAa_p8|<RO-Ses|N4}
zY56#Re3kuBu7<D&v?hKGfK;!_Hv-;3;TR8B{PNe)U~}<cII_d*KrWLy<ydRo<6Uoc
z*~sVY*s}8-YN4B<r6%}FZoWmh!hAF?iD};kd^9M;puq_-h|R#)&;)iK=NHCz95Q@j
z?nX{Y3)-GHuhP=dgf|qkuaj2eI0a{uwWIh|mcB9wR!-OszRR#_du_k+b@UO!(#mh~
z%a_P3V<rbpI-0=At29M^ghiYW%@6*R+Dh}mJiQuIfHs+4E@Wzz;#Y!FhKQi&@+5l=
zxaFWzX`UyyJ%A5l)_Ifm0kHVO5@Gx*`u12x<@Bfb;uoZ778zqzKE-wG+7Aqpx<!sC
zeeo)E$gmSXi|{}Hj4)Ae=XSgM56ti}-OjOP9DkYcGZo4jL8imA^t(A=rmG>UJtWna
zM8=ODF0aKrOmEkQwT;l@c9VfeX?dzHlQ;clk`W8v!(7dOXYvY#gYqaDEZ~EYWTPJ|
zpPN3izXcZ#&f)dLTNfGT;!;ci-*QK-3k*2>FMj6<aX#y-F^b5wq2vqn2x&&ifWPz=
zv1drXnc1E78tl1eF2^M<(OCc}Ho_)CpgP-HWb8@;GdTijnZZv#K*t1vTfs7WooqaR
zTt=;H$lVYQp^!?^67NPWiV6Y4iSDw$>m)DCkg2}?MbP*0elzR>Gw;1Es*o#qD}$5o
zbbhdE^+U&B%+qXra{Y*4yZk-0RKuk6$imY~|D2YS8QgfP=~<_9^5QS)Gh|%=E$>*S
zF#*Nm42mFsi^+b;2UB=qMPWv_Ar^J|n|~h?8bs3vYI8A8%Lw+U#I1O(`cF%iyf1q|
zo=<olTEI{WzBfBYKHT53`49R6N&Mehu#RrPqib_V%^PG+^zzzK_0U8oF3(n*v?`GC
z?++|>^k~O$A4^2_<OS@8-DQmh{~KIj)1T8N0q+N2kf*4zGplFaktM=9A|!T5drN)o
z1?F?-vnv~Y%|9}P=wg3^#-3s|bc-pHtzcw31C->g3q&0|yyKQde;nxnsnYaHy?mtr
z)fk?Og)Ou49lnyAFO0n!CAF2G$~DIORq%z}LNz~Dm<oT|Q^g}dLK?)(2Z^;c^mw}*
z%Ugr`R;|&<@cySU`srd*;j*Rd*D^J2*&5W@4A?dxWz^AV{EMqM;xS@zjgXKJ5=99$
zE$;A)ah`3pmF}q-7c^ALoo%<7iLWLrf9||igOtY{Imzh!fkL(u1xbop94_XP>7>3l
z;GGN;kRroW266_m3K(AOjOM5|ZJW5W*IN#Dq5+0Hsqrn@X4cQ*4hRy^YZleR`!p7V
zp?$!t5$}1=`CSnKKO}(E<&rbO{B3utc6%?r1q$@k+)j{SjxdIk3~nQ)JR3tvW{eCO
zYIzw!N@f*wAV9(oF?;iyfqEPGdmE|q!#uAA{rVsf@&=RrK(2eXYbJ&tzcB^k!p^hu
z2|AcqH-<{OYHM$l3;rP(fg76AT6W=U@TZ+EkXPesx85t+qd-{~)8H}QJy5N(d5yT~
zVl9BZyyK3^G8YASd~NtxWu3fkv2Y7@@r5UVz}ulA3ZYna=qS8RZZHMfd%q^4Dv<U^
zrn6c|mha%zM|XblC=1H8{$GI`w~!#OMy8DHL2Il=hF?W-GrAF8W#vSh&`SS_nO9+v
zBi8Qx=f`P%UtJyqs%4J^Cnosk{^RbNv<8RB-K@R&S?;==%-wwVeQr3j2P7M~tk?q!
zJ$m;IQptJm7Lk5!m3FtwJ3p~op~gTA;7K1j4^P*8w}c>Zf1KXn8B?yTrK;!JIF~j&
z3&d7+Qpb1IY{^L%e!XnzfJpGQ0=z2iXZk8QlN2Va*+ReihUTq!J=por{;6Ojzm0rf
zw$bY3(>9*LEdqDLo{L1gf$kjr$;2!v_IhyA>Z3NsM=@UI)XsD%R6wUawn!<}sPN7r
z!SfYlJftRIB?E}LS8#>R-uHV*XDxEfcD^2;_QsjUC!!F(dV_56gr_KL?MQ8vzp$i0
zZj@7`j_W;02o_$e+R}gP)mSNg5_))+BRHJ+4LHv_$<Tt?nXVR7`CxsH)Z;&>oBR0b
zk5TR2Ht(rj#uP=vc+v*@0imk9UN|mE<HH?H@uSGoGfxj@_w<+T5gV(@a#C$L{|T}e
zaAL?d1`Ai7edy#hAHYsX|1^4^5L&kq{xi#I==}$8pJpXYulo+q;x#j0`7oI=5&djN
z6nQxrg|3JtlYGuG?aF7synyXZJ5j37Y$=m%L8E9&ZC3$x1B)*wv(he^TZNvM=b2B-
zJc;LzCt=CuXN7+sTdjo_H7<!C?n7fKMVV+91Zp&`AOX}D{(ZbAg}PcQWp&b-e@EW$
zQYOo|3oU3)qsqBOmKjH>VBBKdb$9>dLQH4~8^G#p9h<(%y1yKyREP^PFXF$keac;N
zv4=HTs(DI4E6QMIw8tTtOI8~ia(b~qV+71+F%X~;R@K+KGk!irv!@9-r$_(G4NOH|
z^efc_IQK>J<3xNgQT;H)?EmYNRhNUG4UK%%I{fU<)i?oU&QnNA8YyNqKrFgVfdAoj
zS!RJ!-Gp2`3ulC~1#;`H(a`JBc%!F_65<g!OZvN0lJ<N51>dMlcX;5-6Zu|t)xyBK
z@A@SQKLxH3Cx$VdxWW)Qv;%&s0+3WS_Ovgj>PS4=MO`W`!3P*fY>2{#ze_+6ohZuH
zY)m=h;-`zeE+E5u{tmY)p%Xmq&71wouG1(AzqJupbrv*ct)qmHWQIn+Jn$fhHbw5I
z-+2YwO_-iZmF@U-`@I~i6nioYy9Uh}%HCdmoQ*u-t)=740IF$5Ulr}yoWBnhwl5Hb
z%(&QRJ8(bBDecEGTe1=v%zSw-o!def<0zwB(wb76)S<lO(`vMGtTzNwDT^O5{Vv_X
zZ3GRWT|l+TvyMphq=NY~7|{?Mk`LAN6yM%JE`w>FWguHGLF7E4a_?_o8R#I&!b5=>
zRn82p^g#w{Jt2m?V>VqOyU=aWKuUP~MKLv{@z~M`9O~unZ0B;YIo*Ha>kbo`e-z42
zyOLat?e@TQkRxVVGX3}`xhs|hk-U6Kk)q7kpF#1gg8>+;WNr&;fEY=Px{C-#fz(}x
z+pnICibd`=7o}hSf)zP{vBe&y9lyA#;yx4vui2`UE6Nm3J~@lyA_%!yzphwQ#SB4I
zf8{$X<k8RX1(A6wgtV?rL&Gl$ju(jPl_<F75<7jG)0N#xw}AXBEO(uQp|GbZ!kI^-
z;_Z9CBIiJY<hqsKUc~w<&my@SP@sMLKTURmg-6sF@%me}to^@@^5r9Qtqw77tJ$XD
zqp0AIUN=6*k`_@;%Y<zLFMC8i8uM70EcfY$Be#As_u9OIGUde1fgE`}u?bw_hGPU>
z^p`;aLfbExkBkWp4xxFX-u#f^#F=N-GQYRZZt*@S-*mm6LT|d4@bcAll7D9O@uTYE
zS1TQ{mC)eAJvuHo&KawKzf@eM;!H6_!sax$FRyw8N2~CNt*OESUX3Ep9@tDupN?G2
zhfq3{OnuhqrY13%$HaPuCt>UH>o&$YRsR9pw{7FMRuK>MANClH+0xruH!cOP5SGqK
z_-p0f#}t&osYxEbI1Dct=vm6_=B9Cy=70?JY}+_QQp<x8f*Sk~Vd?P=FY|uXmUn{<
z36or6!&Y;@RykB#e-6YY{F>DMAF_&mUgWLC+?dIE`O;onPFDf6*T_~zI*_yp{OU4>
zg4<R^K12G8o}^ge^FlnY+q#&BC&O6ieS7l4?MBx;?}j0fNIk6vE)l+Fv*=Zod_m^c
z0L52i1KJT%xSMI3c|{;JFZgXRbS_Ai)p0mcKR*6|Y||M1!rsOy1(E%oIsau8#8fL_
zlHt09n7c0b)g$BV4#@p{_!Dj@A_5&*cx^>CTw86bb!St+Pp`r6DM(2$3&1_Uq`Krh
zivGw#U^SnnmMr3n*>PE<{xYrks;R3q;AMn;_j}hrdQ(O~F9Po$M*^<+I8EG+CQp|x
zi8y83*&R=xRjKkrjOT+Bx}+r-G#bn^d2JCJ<X)?!-WF=&hTy@WWQl+KUOZuoMqqV4
zg?45O0KgGJzuulRQl5iR|MK*&3ci;W*lzypuz55@U3g;i1d7lNt{y8-h$6dM6=*C1
zCBc*;aDcW5kBZkn1093zo}d!S)_d<iEpGG<J}pIRYri=ionsF`;ONsfd8JOGoZoZd
zeISt})EU+0_gp5PF%&T^^d;0$$(7#n`BZheI^idh{=0~TQ?%o4>`*cp{**a=LFGe_
zd{OnH!-ki9;OGuv0OApv=P%qrwl~8UZ+xymd4wCB|HNyTb5fIg|APE28U=IeHaE)T
z-G>cq*!`R6rg%5$zrj6^dFqIhg&;K3RfLmeo7D!r%vJ#Rb<v@A^3w<<ZeLEVAmf0C
zn1QH)V$CB8?>zuM(q(t!lGkW>5e5QAcY=JBN4>(MMEYb95ku{#NyTP%UXB@}epf~p
z-IY7$NbbI`GzZLPmp)J6!Wq#)dl^ZPE!F^~7&U&#-=zR!35}U%Ux+K@O`TUVN&VKj
z>Th*gMN)@LV>I;vwH{2U{hj%)1Hs~*>>9$>KcI&>$z`%dWJ<t$7<iLl01}z)O7ShL
zCaY)S2pWm(MEfYHh_0*w!E3$^yx+{&cLM!v0)mC4`9(oiErpUEZRcj)0|-8S15kn4
z=ly{7GPdcYB7C7BSh4kHrD;r;h*9B^FpZjL6!|RxB%A>qQWz}9iI{fIW7)F12*X^#
zzRC{%IwZL<d7hk{9KaM6{fP1h%bft;^QX5L-mq?}n<aaS2&Gi03+!tc%QMgXjG85S
zNz?IMa2)S3{QAmft9j{aXYio;OYc3$k!CE$l5D9J{r8}&_PcGbv+j75IWE~c0U7Ch
zG|r+F|Mw?SJyhh*go~nkx%&TRVp9h6Am5M8%1<vg9@pb!07s`|Y&SJ!2$MNP617-@
zgIPSLE!n4!35_?95?qRMEvSATrv>RAvU)Ct&&vB>e%|HD1oDuGwnx6(BW*O$|9rHl
zR#y$V`o(LT<1mFZCKG!P`Fw#IpH@&Ef1PLwH2UlivyL?U@hS96C$P}-<^wt+_@zv~
zd3g03iJVIdpUw>6&Lm}|DfClFMi72w&;|42!1HB0t2c^n(ZJt)iWR*I)jsV&&-HS-
z&xUi(Emql|Ayb|fyF6*8Xk0RHS;;H>Cf*F+;$K>*P2$-p#(jN_M;XHWj?GSU#cQb(
z-z7}&$Oo`@K$uKBlm7^is!e$P=ZSYN6-i7KP+96TK?@^U7Bc#ed=Vr0vIt}MSDM@v
zD=nEXtSUvh*PZmj8)UG*md;02Gvebz5sa!Gb7R|Be%kGQmV-xi25DQQqa1#hVFuWW
zNmF#FA9lp>T=4wa$HgUlJHL|Qgi-=Ouv?>y(f4@_5=`y0seV3650@M#jqqgb*DG>l
zGyKOzNiFpNeSiJBR@s%UP{5zYh7z;4C{S0KbP&l<){n%QcSj{2zcKPwWCCM!Rn0${
z(k)Yqi_m$9gjYllY8{8akd}b5V2}nnZL0isuie=GC9$W|@ofU;h2wM%1tlV098^U}
z^v5@tNK+8EI=s#X4UwfcfcsvO4~;nYNxyQAZZKgTUIv{eeZ2cpQvqk3&BFxCgew!G
z@ic=#^xA9{;`9xuujt1YkxEapzF`A$aYdJX0%7>`<gR<F2fJ3q>BzGfB%HGIzlC@V
z1CA*0y;6JyM!AN6tX+752t6b$!5UJ^eVL1QU>u$iO~VCcKx?#y)qQe24<oyFhY+y%
z;Q8rajrT_t`{jwG8Z(I1uZXHbdQs(F2L|MggeU^k4KZqr|J;dwRL`UE4=7wvv?~tS
zjyh*d9c_KYZ49L(X=L)X+lSCY8paE4Y(;Va*P$3D-Ru%43ycOp+d!427SgOG3l)`U
z6>a(zuXY;!0Gj)B=7)DGQ#J(~C(cWXr>PGMIjT?{;8S4{&d}rkaJlftV&MQ7F!#tw
z)$XGKtW$&dQ;o#zjAdJ~kxA-`!`b;Yi6G=fFs=P&|25Q65r4_T2QT2{4BE#AR#|Eh
zb+7oDkgLPT4tGXGG`e@RxVlunaMxob?u9jO^v0VTvYjnBARar}Z+geB7vovU*avK;
z7sg))DBgiEVKA7{HAa}$q3*^^uGPv<N}xsAw>yq_^fZUq{-hYm(B<MTIK&mfwzSaX
z^6m0#>nW^u<IJbh51UNDb3b)-d69o#?~Uklf(+^8xD=<H)P*^Qx@PdPYGjp{cb<zx
zJeDgWA7pir+9YX61>-^9E-^flxA1kb&W-7X$7h%Cj(JdnZ7Uu^BimOx0VtBZ<f_7T
zP$Y$0Ys$t|X5}NyjN=mlLw?*t!IGzpg;5PxnzanEZE_59uFeXU(L@?uk$~QR4EAaJ
zi_y+eO>_#Gep`m)cdc%;iKpIA0JSV27ey<|Pk8WX3z2O`o-0FNKi-b8-lb616yWP<
zKKxUM?IO%lg>uj=6@Br=7F!^3cvDJ~!N+2NY!@SFVZcx$%~#St-_ZoWLrXk#!d?l#
z{q%i#M99w3;KIT_TRol9Afw*S5fuqRq3b(s+u=BFk_;%bcM{YKB<^A=t%@-nVv-+1
zgs3{HpG9wDL_K@p8Z4FP{mpI)&E_tl7YAF{x}|obc!G^9;{3%unSC=V3i2*zclZr{
z2K3f?W|>ocjxMUo#TD^-$Pn+g_>M?i)zfT0D+3+-Qc0{qQf0Z$@Hf3F8n0;Y;G3nT
zIr8$ZRq^e)zve$^SI4Nh63FA>nz_TXFu*4G2q>gAP_PS^fSGT-PU^H2%<G;}Y}<n6
zzFAub*}QI+s~N3{W|0%M5NVEPSY*12R_@v*<VUX<ZIL8B*1!|(+%!eEK`sm)lNaVP
zK$a)FaSS%dGN4;Q+i#f<D@0XrTdH1g)U)B~-tpw9IFw2!d=h!rs@PEdjT>`#WSRj|
zP30~|o@$c?Rf4r<AzGDYSDL=l{MB^lpku?1E97p#jw>Ri@uCgix7P7SSW6_!_2Nmr
z0jSM7(NAHvGCM{q{M7e|gY~Of3?Nj9$P^Lu3d7D?wC}SjdR#%e97=k%j!hxBjdYXe
zu7X!Z@_D|nr8eEE0|#&#){G-|61SF(d(PG4za^C8rOq@N_3!{Sycy)4|6P9(oIYyU
z(WgB>@eiS+oDOh6aOuIVb(03+rONltTpr+!tHO2QJr2(lNYxFVz1x7=Wa28xy>)VV
zT?zaadW&xvRPw&sA@}0l4;=3N<tM^mnJL{5QnkR1b&@K7F>)jys?yk+dw|54XU@9#
z0hzou@fRk+-*9@;54><tZ?)}W|9$bQNia<MrA*4(nHcYHybhQP4R%QRrx*LvRidc9
z<KWQ0s)AMUMb>tr=`e_Ae0h&jC+<v@I;-#+gU_?JPH;lGi2IC)3xNZMEt6#-YQ*G#
zhtHp;Q^wc~^eS*Dxf?^0dxZL81|-9PP|Wu|xvwY+L(I-?l)b;LXX^-3aa9dFJbBOK
zSGrvt1B8n3M~JL3CA{DiJm;ZxZ4N#0;^Fr@hjbDiI4XnLRc)!V$bjRQ@sI+uc95#T
zC~d6%fhe~xLUqDY#*)2J-D@Owff-jknZJB94XthTs(jIj(9owSw_T1%-OGOJ4<yAQ
zwF6Z~dxx+rxn|Rt))LS3JuL8xxg9;AF5ibUDmc-n3WpZ1pDU;qWn80q=^;t90e+RH
z!0GrO;MC#_elDswbF|_gAMN^Md+5p}xsd6DBSzIrbC^@FpQ~M=IZ6n1{|xg*JlA}T
zLzdUd#-#OVsqlkuG5;6wZR13}yWk6pSSF@FTjkg5Q(6tWv~fz_jywX@#+{0C(-VFD
zpNsT_+CRKWb11!@MvQ!xoR}bt-=i30U>5xt;Yo0?MJ6~C%Z>|}uKsLfaK57|II~W<
zdC>q~I-8-hw@(Zg`VTGC5cD6K@EUnlZy5e=FIxS1ikOIYUHIlRccz=Ph8=f;{H~AD
z*B|qgWZUQ7P0e+^l`1@`7Bxm|1+UgAqePG68<lf=LXW()_v?fNT=?pVpzRsx+8p%<
zNO6k)$hi_ZKVasEENd}yc&cFmw=ps-NoTWCP2Su`*kBsu^@cc*8S^MB{H4emc}hR;
zj9cbt>I1pobdY+KoS`oF_P2KC$_*`YQN(HIxBYPJB6#+VOGTdTaK`Br2)A5Pc?dhb
zrf%&Gi#MbjeL)9n>}-FnrlLi@Re4})SQD_P1*uCWCFNSxTG0pZd3!$eYd&jFKjSc}
zLtD(tODXyze#|Gz3@uLlE&fA?Wq}ma9j=@Vw{~IMarh?g9qv-3M>miG%=|{bF0;>D
z?oS}&RO%sU`b@Wsze|kPN!=^Z6(%4-fy+VlVdU*Qh2yT;XIxi0wkE-*xS#WlBCyq_
zgkvdCWy*MaE!oX6mOAC0Td<PjmVxZk2z5T`#4oD){Yw5dJ6I0%TIV@qwFy6a&n*kH
zM$CcEE_${S^v{O!)|iQEP_9<J`1jadr~CN0Bd~;Jp*&gv?2kk;vG73pc`DVo;*jd$
zi<YOOY!mk}!MGMZOvgW{H*o>iMT4L&IgtjUs_%QT!7x9a@;0YZE_e3!)4R*W&(v?A
zuGOzi2We<=lYUc@@QFK2Darp}XS<@wkB06MX&yUKg2V`8@YAmg0qPgMef&}u$Zn8}
zzj$zs(Z+H#1>ZSmklFW%P}y5{x|e?&Ma9B{<1N{)(DmJ*(2l6)=b@TD139tu&I}&W
zFQyIYKhHE;DC{}nX&KAq90jVL3pOd_9ECdNJDjJK!Df+e8veb}&Ay$a>^6wArKo}i
zU#7e5L(@d62n^~OP9paH_b1`p5}&UMN`l?&R>ZKk)L)(~jepB6(U?!|?57XY>i7#)
zz*>1kl?|MvUslW+!fa8Tj78Q?RMnt4c4j_ajF$Go@ahpYVMYh;BB>44k(!*L+L9#>
z3RHJ*mo2i~5o_5+m12=4vP*#KLxt)yQ`<0A>=23eXZLVMQ((d{o3&k+w`!vbw-{Ol
z%OD1_iPr|2Y*#sEOlj$44t4u=V2Y+#A;<~;VH6l7+6oTG+9C9{%cP0v$81w1#WoPJ
zXn)94E5XzYPjF|-<YP0M_cuV1et&#Jq^iSe1SKymRnO>f2?Ze2nGS#7OwU4lX%{BE
z^wT{*yF9JU)Dk~;s@|iii0zo^pa0SWr!fE9U>I2?_z2dF>J?%Yywj1tNOxeD$+#9~
z&pkz336{s)Q>zk~A<@3$yp(>McpIR!LXQiJEJRo>MuhsmL(+~P@AOkJFr0(*-S0X}
z_U)v9VwG)UV;QsqXo_xTQfo&IhnJ>7o~s^Eb@<WijSpq%r|OnC{O41;c|~_UCxnLX
zXca9MNndnPZQXP+Jig|}GMTqVX7Lq!QrNa>ePYwk4C#vKD2~E3HbQ>Su-u!YAEU^N
z1BH1ngM7cu-PfP-jFJ8@7>_o1rp}VYxfJJBo2L73&{!#;pWIntDfnrKN=^)})EeP5
z=vRY(MfC=Bq37F|r}P{Bzx^fGL2r6ei*s+I9~*s;J&+a*9~htR?D}|v<%eDFe;2Ye
z_fYd>k-@B|vPOc41o&cj9Ge4;=qu_`Q?LLS10O8ywLg5!t;6%%lgm0h47Cl2VwBI{
z1KhDRJ-v(xeZ^tF-+Gd^h3-s$<0d38<1p_?L4Bm#I1p^qLS^KD&}^35xENnHcTIG#
zFC*79#W-^TmI}ppbKR8o_MvzjM9Ley@WSmo!A6Av^_1h!e%OQSJb1D-l(Gbmb8eKp
z5nlS_>eZz2dB(`EXSAGD&l>PCAe=nt+&c!14-5nj?9Ou(N1qNfJGyci<)SQ%ouAd{
zsg%JfP*r1NWGhO0@ZMelLw_EqO01&{&SSizxCrt$%5VPg1_DQ?%(K?aKLp;G1WEbw
zV+;LTivPlH$HDZW)jhecMi4T8=sHRJR|M}q7Xe@GS#LGQ4m|~t%A5~#+~|ep;1umM
z2Z^XHeNi9gFk@jI$;6NO`&=L_x0&SgljKJailyb-;s2tI(Z@5Kqjk<b39}_dXm<3$
zkBC}>_g=sSqDBT|z?HC@InsA*T@aW2ofMY-D(rL9W}h_5;L_c!p|UM>9ZlV3p??Yn
zZ-T{q>QHJg>DU)fTuk}R?V*S*gGy6oC<3=3hDgN{XM?aE1=V^Iotz?7I(Uqkn_v-R
za<ecKzQ>^3hoOqxx>E6{QEZmfnnWAELkFZ3&ls!_?YVxPj8d2pRs<NK1d{j{Y8W~|
zklq^MsXY+O0}+X+K3Oj)VKUJ<`uhc#mFA}xK)~p6&c-9am-aR;k8DaVfAyWVo%3Z5
zdrRcgF*+U&)bz0>V$k2-Mj}$Uk{v4ii7q{xN%s6VWh+S^ccjGr93*!!@lyrz&N!_m
zs@3G67u2PbYtAIWd7QkgJHCE0qxktpaIE@}k!Z<dRll2!3l0N0xva3TL-|6r%_w-_
zKawz`)7*o)*$my+1TE{5;c?fhzhlrBabr|-&C;_**`Rv$p(6<!q*<4x3nX&-2W^WS
zN8w#N#~ocgxlOlGJBY)cVVlon<Ve1zXDAIDc>WBr?1ZcNiz0mylyB7~&y>@gBholi
zkQWMPbjfKdg}YPEDyCun__SiuT{apc@9VyaS+~Yc#)$iPU8(Gr{~m^%tDQf5{Nhx2
z)lCcR85VL4e$r^)qc(;29K^&bo*Jl3d<ENJ^|zYM|E9-fGYpB{4zd^d*4aJ<2fm!~
zS!&5W7;7xlnn@>p_KhVz@xvxwLapMUnXq1;q$&7<nET!~@kw$Qwa$)KC00WZyz|4A
zJ3$fmX>Rf3E|aIY3}9*eS0^tF3-GwvTyofl@hDTIBb|;mkB|!|+_pVSCcZZjqJKW0
za&j}Bv<5-RZqCYE@UO>-<(Dr4X%Z8-SjH+?)(S<=#+5dX9QXkYsg&<uC$#Dm^}s=l
z9MLdh(Cbe>XE{-U;nWvEK!K=UKWq?{hhi?~uv&W_LS~8teLS59wg+fD8i=e|Uo)Rk
zA`m#Y1-SDkS-z>hIcG3M_QG3BMgK)Z?%oBnlzZSu&+FRDhWr2WL${+Rvsk;{16U*;
z)BW28eR?6&_Kd)aif9eaHI>TN@h~9$Gn+Ddk>h%o2G=(3*+K7C!DIPmv`i?I`OK%^
zn7-rHB5u(W(Gumh{$=<x+o#>xL;B5NXoO((6QlEqAc3@M_Y^U;I4mwSW{2k2*VRXc
zHrVp!Gu7V~>DL1c?$^rgCB&1;JDZpS9QiBPISqm@?w%>eV|j{x3fJQ7w&5o<)!8O7
zLq6lN_HM8UDr=xIxWpLLeNQ$ul5t-vrm}YF6z^fhM!CV#qfCP@!duOpS2!H^Kt_!6
zG43bE{H;kSb*$4zM*Od<+fpx%9!Sh}ZsbeM!dkHWfHP=Q{EX~fV`VhQ(O=)=WM7Q;
zxP!XtjeY-D##U5W;uerhh_6AybOSV?!lcW&#o?Aa4DgeAnby1_iockvu%9`j5!9${
zD(xw7j&*Pyhz6Xb*KeE)pzr-A*J+moM<=jIG3>TNqmN7sn9=iydjcEk%2;s92pXLx
zR$D}#fLSZo;;&eyl?~Lg<3>ikuCc#OB&6Srq-{ohtY5R#u*1(Fp;t3wy(RN9{2S&Z
zFf%KbHrO+!AbQ>de@t`0GWU7n((*ZqWwB6-J%)xvuLnN5Sz%WpUPWzZpZxcuRw<#3
zTr+1K&QS$XG(YKhxyy2}8>K{XZdOl()XxW?m*SK&PW|PiUiGyqMiKb^y-I<?L15-6
z7ALiCudY=^#?j@raFF$TFlOH`uQ<F2?fba1E?RJV1Rmciw#X0}mkWzGdySuAT+;6u
zCT+jvq;4L<(Tq9|io<0*iZX^M_fQ)DJ}ej9&BZ(c?SV9R+uD*1e%bSk)^wJnk1H#o
zR+SSY@Xqj%-a#Bm07?C2HO$-%Fo*8nx>QRLomxGye1UoEN8|L+BbpuB+!wa8f%W{u
z=#d46ofrQj<D?2b!|eJ!KALq|)B&2@9lYkZX0q{lw;sv^^}9sUzw7-Mur0ZzQv)W~
zASygHCg&bWygZ`egLJG67g&a$E8~q^1l`EgH<ey>wF5JyT_^;(B||Y_N$0FV&;|#k
z_wY$BZa7g0e3N&syh$$e6MHMT@RYjOqy@tJl8W!VVYr4+Qqw}vpM8O~Nvyid^8{l$
z;&0A%B1}&knlAKzyPJk7_I|0_J?0ghj=jZ+zH<E#sYLhaO!#kGILKh=JhQpAqY*g_
z6NaQDy;!AYlo}K60S(OSaa%m2+m;QnL{N8H3jn36NlLEccrM9kn)Y}WbB~;IdZg&L
z)9=7NsBTnX+<HtkiSu0CQo?Wloy7^^;1^nt?RWNn)C;6Z(h_*BNJij>4<)~|MDVIj
z0$T(16GM|eYJ@|2{>3eJHjR@>s|$UI-c{qGA(?6bGHO(L%8`~UX8=P7>~Hdmc>737
z0$<3`F=KXABFqt_o<W!}2(_o)=AJSnE2J+KbsP@;6=k-u?$H@8Yr&WnY3g|xb?FOM
zQ|5Yb3q}?CIz`zsLvB#OB5wLMsitT0gSHO7MIzmhC3j+$Pn9tWHZZdU#x(+iccfH<
z(}7&ZeHJ6Pkd>hQf5)nO*Jx9Vcj$VTA&V>z#?QVjVJr@aCz@%mxTN9vK2QI?xN_kl
zE}Us2cg{q9T2s>Ck~&#@3vjsnbmJ<f^gCCUjIth_b;oX`vtpmNh1tnS+>YMbrP!Us
z6mRsW9B4weDva%Oa-85hjlq`h;VEj=gP)Y_%CkfO5{9J>64<!z@xORm0Ed<6dhJGd
zA#c(g%{lCEA8QH?+Y5PGNE$+3`I*=Qj&X@`5%WR~Q>^7M#2LUR*SKi)Mr)gnkRP%g
zGq?ezuz$CEPr@&5Idf)VaB*~g?XBZwus5KqQwRqc7Krm9gx6YJ>c5fJgL?w~x$`m2
zZ3re7U3r>U)kG1q2bhISS8q*W95xO5c*TD5R)W4=KWN7+8-jb3DGx-ZT0nOya<o{K
zWn|!5-^h!ghEy|xlJp#gf63#OGv0X$c)k=eC>wfoea<3<D0M|tK-n%L%NA=xVJ`#=
zGr_X$Ps0t3HO-*=1&uFYN`&sbBpJTA(}j84@58SqNHQ3kNj&9ivC_VMtQTanT$%f7
z8s4%I9_0j0`g^dIU{p-<Mb{ua)}o=Di-yUcK>vWwlfdW(Xnq3(>02!!u;BZz>E~8Y
z*;^L>t*#GxmlFMIfXD(kKUJZlHZxZh#d41RES(OK3V2HKFU?8cN0vu%&-LJ|PX?(v
z;`2feZb)4t%0RzO|LKe=%Di_WWbhC(%g8x4^1UU|QJO3|j4BJXxfYm!jhtbAjNOS=
z&GV~A{dJcG`93~C2L)%0>|%4iF);Cc#yK*-U2PZ;70&;>nSoBoV7Z?%Ih|WrjHkWB
zK=?KOON_lu*2lZU03cu4eMo7{3=C50{k+k<RmyV{*qv<l`rSBhvsRT_-Oc98;zZ+k
z>f=sJ1wV2Bkv_W8tf3NSt(DVcUHz=uB2PBTe&8D*rzh<XSrSa_tN(~cvz9y~N7@if
z6<s)pUX!jxy_<WpBD%9glE=g-`OjwvJL$)wH3~HS57KBUyJW+V_wc06f-8L#d%^K4
zxu|uD1Xl|Z8MbPjcHECNqc0%oE%(WeCcQ)b>xc&0u3Wd4h4g6M`77qJx&5sZ`<8p3
zrp3y_BUC51`qJhP=r8a9)?#aTGTIFSFspMVRgQhidHf~$8{-Jo@V}>r=eXaRd-xt(
zH&{kzkbQATHB&|lW~s106|>u;1qA#>hWycV8vT8-{VdyBew6c%+eLJ~wLva!t9d?z
zYL#RcV1w9wgTz7;7eBgDArO<jj}ol`qcp;zXtPpq#q+Gihd^uX&`h*fJLU@L<cRR<
z@Ws5{!xaCM#;)<lFaf<|w%+q!yEFy6orr*Sq~;|#TIAL&k9xl>Noq%xvblYwHj30=
zFkd4aZ$ZWD?ryO;dG>+FQmj<&Rl?YZHD<Zud*Bm}dVvf&HWToRsN&LB3;op2E<2wL
zQmPxZXKon%Nh8wVgigTo;?FCpy&V$(zoIN19vvMXQ5{hGMzDa(dhv9U`pY6ytG7d!
z-WMgM@?5}HPk&fu;9YA=_}lpxtm<<XcLYRTm?Gbu!GUQXb|C#5wts!_-{en>{ex`3
zT2xfcRho^a4b_4em!=Uuj+~7}T)dn~kU^f3w8;~0fU2Pm_}>9Xsa}iH^y?rlFxi2k
zWn-i!YgsD6$bu15+5A#?Xx@`6ef_r;GKz7X;GMf3rMA(jWF_&ulKR_=VAdmC99pp1
z`u@;$7UjV-f{v-~TY8^60YB4wep4XZzs>*51sI{>AAH`@;o+fH29mKL7Dv)T$=+^0
z(0>r#RFQ)}+rZt4Qsk45D0*DEXIv6<G!G%TkbcfAo_)w^3>|K4$uyU|)#a|uJ+T3u
zA5luQyGbQFAn0s`-VPeS*^w&miim$0)^wUY#R)AOlQP2PeTUwlHa2)W9a_~HtX+?a
zsi^NZ3bZSm?nO>N7tWZ!ZzdX`n6-A()RLojp(_;??}OUz*jJ35+gLBL%v;GszhX9x
z8@_9Zl!U{3FA_VPw^=Ga?#(0$Li)IqY7Ts8c=*%au_&!A+7Xe&DG1hsYd$`BJZ`E{
z)*`Pe9)YR>!8!!~i2CkxyJe2kydLR7OPL9})?d4ikxNX4hrEX{T-bX=yGQgLW{s=k
zqK>Sg^PJ8u=-lvT-@q8D9B^zY$lH1Jdboy8RWy$oF*{7sxF>6K-p1!|o`3=A3=mjj
z3O3&J_yntm0bOLj`^+S#8M|h8utdCy^#a{uxT)$v;<Rb_+BCI-+b-yr#;;?ItOB``
z8~lt>s?5dco^F%4zuzf-kS`|92|rcMx=w2WN7!7xub1ie#+(pse$np~zAUPc>jYnn
zq#6IyYWO2TW7)OKPJ#~;+DmhWCEByiJrs22hZ${=O`{0{ua_X37tcl<1PcOo*iTwl
z{B1`~fpEXA(dr8)V$9|^Yez_f$23nmuA^SChtH7CFW+y5u81*@I-~P~T@6zjjI-b{
z$aJ6t_FBc@$YS$NRr1@5Kw-~shf>vNWYZ;ZEEbard74%*KwJ1dva$rxIbcJLDb~<M
zz=D-9<&Ytz42(gvP>)I~(|g?16#>jKa;!4`Sz!C<dqJ20#6PfG$A1S`s`k(oF@*JM
zuUGt0`HgrSjCx3X`x@A-7Nm%}v<yf2QF}bR_<z&H5pKSJ4+$$XhE5gDo~}2+JWptz
zh-$*h==5t1=e+AW(v@T^>}^$I5{x*JubuV`i$8vA1{8%HX*`aldIadler3Ttq$M6k
zdv?JTxLm+P>m)g$NOEVX?e`rnG^DjsY`q{pUnPZFrze)5=ogOS@cXu>*Q^!7eB`8%
z^NPr)@4y?;__fCQAcK2?K|}DcnptorB8PTG<PCeM9Gf1kWV==Vx#<Gz7|wWCz|daz
z8Hp9%*1tvqHpk%1J5U|bYNSGMFVa;ir4k>{NvtH48Jl0<k~9+1Uc9}nsW=Hj!BRi?
z?{!MKUD@|${cW?SGFMesAl0jpllHYTVX}90&+X~cBIj~uG4;o-I8x^bMZumK#>AV?
zp99b{0H;!Rb@j=w9y7||PqP;_lO*TJCK~jZB@Z%CF2gMDeXGQfg2*uDFwQo%_zWh+
z^C#E65nb@B$Zw+E%JgAY`)SW{8IL~+=eORYzbvBhPl7zBlAn8<T0LXc3l}ln2kFE@
zdousjsVHImCWuC=h$&fFA?mI;!SHM@?$aT4#&K_PZkx*I#hZVMc+7lGYjU(a?V5ki
z`Gpb-it&@M&J=MMc4qyJwVDVcWrfHN6p)v(&$zE7uj{js24L4?x3U%RfN#hE8w=_a
zQlzXiA<{RZKQ{FFqs?Tao!kJqyp#1m#i?kAK8sRSp7JS<pHeUm2t3~`rpo(M=JI?#
zGSY#+svqxtCga5#-rwZ6%qP6}3dpMEsFy7GjR#s3B`rzI$Lb%yD67`Hb481zT)rR6
zqQB#LGD0}-BGtu@6M~_K5U)|W@Mwp*sC>yE51jxtarp$K!WH>;ZUp*Nt5ay2|E*P5
zh<d>3R{w9)n~+CGwT5NUZm-tVII3ndt|QJYM)`&D5~3*zM)1WNmlsWqFac8-0QY|Z
zQ^t?l9|qDnPw%QYlbq?;3%VZP`PX=UzZELXJ<GTEbA|BC5_zMZ$;?uu%iGITVM`FF
z;z!g9M36fYzZ?P-HDDc)M8KeIA_{xi7|NC5^6x&x2fBb2Qki|g=X7~yZ`6Eh2~X4J
z@AfJ#5^u0N<=)sjdDJ{f$-4fE`sU121MV8hXmR>(J0K2_PevA67kV@Gq0<^#6i_C*
z6IK>(D`&!i`N}cg<1V(rT;pKg;0$itx&6$)&${z6ucvuG!Uk=O)nzn(!+5{4{VB6I
z0F`@1XjV@0{w<qM#>)5RWCeICD}utkqdXIig4E@FJYA!8pSRPp%K{zYSPE+2ODF~<
z;}pE6eoLaZjo-H7bQcf$vnx~rENd=%zKP9L`!<sq)mB0VHYDpm-QJkPzOT`n=j58e
zFiRRQn`}Ff)Ay2w;zOp%65=mD-ERi*5%&xI0cz59FgQ2(P`v<#Cbx5{{oZwZ7Zv%S
zp<Rg0eSDASpzEK|@R1pyi!S2ZeD9&HR_;4ZZR0%<pyi<Y%tmxmS9vouf{068|0mb^
zLq>q$Mf11AEgdfEc2OrJn;=8<lN$%SM=B9~0W2#9)5MkjP3}2d#Z^v~urTH>w{HEJ
zg3K>vN~2Hg*;_7%?c9~)`Nm44eXwxU0oxiaUoykk+-|5UPfSoe1w|Gz=cKB+Z7ZT8
z_1h3HrN19A4LhmzvrK7heVi_Am6?>7Kb}y@`#h^M6*5oWKYK9%^54~AhJ&5y0O(<2
z?Ee88LFK;lSLjN4B>o;TyXUTE{mek$>FsK#$IMUB+n0Rkrv@%CRM7%nhRttL_`tY_
z#X88d&p!s<yI_`Kr~@beVjwqYNr)oPUU8=t#tRjhB?hRLVW@A<U(X+#b$AT(c-?$c
zc124J!XWIIW-XKa|Br1qCDGO!_~ug&IBF?r!g&XF+pNBo5eTa4D$c()-EFo)oQ_P7
z)6cby<7QfrGY7F#H;zCNLgFlhau5%Jow{PQjW%`51=&F4)a`X+6aVIU7Y2cxa*piA
zNp%$NFU2Wv({L`}*Tc#6a57zHz1q{MM)cGk{>eM$7*R^kys#9ryZgA5AsRXFmZJ~|
z#FTQR(l3<a$SZ$!0^+6jDexpMiI<+-W2vucGo?u3?`C<Dm~G1O=5}XQVJR^-_&}J?
zYMk7NHNQeac<J2#?2;obJYYfKrOOhxhGiGQXulyu8i<r91MyOZy;BO&5Y46USHUV9
zV|6gNb_$&is)AMGCt>8hi56BNtD%Xpu`)$%qB@lvWVUm(ql<GB`a0%0Sq%-NgNl{N
zY9$ASner{nscLB~77JDpGu@kC7YCcai7n?;ClE7r3R9h9#nX6F3j9!ZE=UZ6AP~Kh
zX*9C;zgRnF@@Um5dVw7l(D0K?pom&3$GILoL0h@m&-~Yd*M<dodukVHk%#+6$t&)R
zh@R;kj2)!7KZ$Ll8bZ}R37J`NO)9+IAov7AA7wvkFIs?750#6#+I?;)_AB=I-sON>
zD%O$ujw_2pq3qu7nLDE*NOi=|!o=It3BhuYY%~{*pQMPM={G?_YhxX0{9sg>Imc(}
zq}a=)+ERNNkF(X@f(<l;!rMKV9i5@c975H9XHaR!f;K{pYG0E|6SZI5SGM5{^h}kA
z`b5etChOy|WzjPgi}b`ijC_$^JO-%Z-Y%e?LYxj)`vO6_Nc@kHmB8hzrgtt7%s|oG
zO7yl8U*~gyV3`m!p!{ZtKNH2h{Q`=tR9ghu^_U#0_E1fKA(Y?klu}tbh_|m<P{VPC
zpsRgJsutnBDLWS&hhY#3Ua6({^X`AKt?GJ+l4zk9Kmku|%fRDIJC*f_@7kka3fhfI
z)#!T@n#Z2s`pB7zanRy)R_F@k<s#}A+D**6mIYV&E=tZ+7O_Hufj*L%_q~ansknYD
zSB>~BQ#tMAOpgu@Ou<#&pQIkNqnK;4g6$UvQ8u+O)z79r@k>pqvdNTIa6GQRGnz4k
zz4TS%j`nzMq;s+G21?F!9r?=?r?W!aBi}{oJ(a_i!&N*I7A}zELc7V~%7d%?A0%h0
z=#7ZF1?F$eii6P3v>ENbw{QFwq6HYnjf3o>4p+G*pF+o%G@0T-mAcT9gV63_s+~=J
z;+L7C_w?UQrnG|ddHtQq*(h>0m9M&^ow`te^5f*OB4?^S;@A(`|IGP(^@1sAXQqTY
zT=iW$)br9B&31P1$W`Y}rWH)>oGAj>ZEo7%>lWAA{B)k<#=$QPf0Ug85``cLM6YCu
zCilPCZ~F3>sV3+GI}EOAE(<Gve~Koc<~6DnOI^wS5S6pNU8C|9>@%?k(M)wXlw6_C
zm_w-TWe+kZA+>^9?@;%&=b~y4WI(`^{(<f2rfOP}jN)mxcZQJ=fbgCwjT4l%+<*AC
z;6o_B?UVv4jt#0+&-g+p*sk~~?at6KjLt-%zM`9|l}*lKtq|wnO=cwiCh(r>q~EGr
zEx5Oj@P;e}-BdhP^}2wgg#zV)wA~lbvMx*!NN_=l$)*k2v=<|Lr)A6$mBvuC6`(5A
z?6BRu1G9!Xm*P!)=L0?SoRWfSs!T9aCKxFbjD{qFg6WKCQYIMDPNm0HatGA@#wont
zsi<JO7e*m*e1vkQ`^h|k;=3MxL8WXZb24|`;!Q&jU))#I>g`7J@q!61U^`WNVpx+O
z&V!kP!gw626q8U}=RUOW7=bnh%}63u@<1!wHkJC|b}fMZk#;Ug41^#My^`W@xc|kH
zOz9(KOrgmxD+;h9jE(ln)C%lYAx;oFNYvM%bPq7{@=O}1_O%v&SBUL<fPE=$gt~&Z
zPg4f=0zwrP4{Jj=a-|gJYhen-lk9s1jk@+K9Hbo@l^VaSTmF@s9H3Fbx|m1_0F8d8
zgpuCy^_Fa$>3Wk++3+dP(kWdq<)%u+TA1RSGOSYpnTOzJd#)Qh3?!;`d*cW!3Fiwt
z+ny{`X3QxKCr+(YX5vTdzq5nNs)H#%;S&y(86?yZv~iwY{N+mq^pB)xfSz}d0E22@
zZoIw5WN`7HU(NvnHCk63KqussT)w3|hu4FW9@HqM{^}*`)oJ^qW$FZ;@TaN>ut=S~
zx{bP~8gu^jU#~zqkDQ?+kt?rG*0_;&olRMQ&tE5|;7_&5B3DPI;(QZ51*GJ-tX;0+
z|Nr1mwLM6?0wjh(5cVY$Mg9NBw)0Hr+3s-L1DXRx#X@5K*Fk-l!5<wggz_2WuR?O<
zwH`n*+K1nf#_r$*4WT^Roh{Yq;P?ir?Q!*F)dUTp`c6_)0pCr9d^gMS!Xf9B-Osf{
zG^iyuN+pX^7}QTyzzw`uMaJTU520=>ylDZ548k)$-ekOf3I~6;N*|;NjKiLfRSt^O
zvTH9aL4v%r4bYz!#}zrJrv1(hWY=8$<W~`|pRy)sl&QNwS$q$qcCUc+p#pZNUZ`^t
zA6~WZQ12mT?#Q2V^&kyJ{ZxfCL-7ZrC^=&}b`bT`^;ue<!76|ECf<-yKUHZwaiCM7
z)!H{u_z~j-WKw-ijLnMa07^MloqRXWAgL(*AbCXnRLKlff0$`76ylv7)l<#b+25{Y
zWLHo>>8Zy10;;Dfd`M3E-73rR3N*$#uFRUz6u4ZSY4*WlHpV)xftRtW?4~^$tMPgM
z%3>wGNISdSh+z;2UuiMeA@{#nQ>pW@+HGpuzU3t&VqwDX@OiC|y|p^9>`JQsIeI(L
z_49m<DGRC<Q>uCjIk?rf(Tcbl&Oh^}hHqsRd;bn9?x7rtx*n8t-RPw?dT9r<xohmN
zGV`VdHAM6oX>jm$r25izF*|Ay#YbTB8WuryQ=fGG&q=HPiA0SgjOwOtEViq2ssVz|
zIjL^C>cqvNem#|2wZD8Sn_jOGB|Q*|&dC<k0BRr=|19XNT2Lsu*9R8kld6gqdsiV*
zbdUdj;3Q2bT`;+z*HZ%3kg66!CJQ0$Z3kfHUeQ%Hy(GXFViI%JJiG6IHLO4V4k~NP
zz5{i>LisSVvrsOi?=7*)rgiLLuwxlSTP-NN-wx_a3v3%(9OFURbdvp=w1zU_8>>+O
zQrXm*(GK<{M#@>}Nfq~tMq@oK8f{30Sy!#apAx-N(VkQ-8iAiE7d|+<0$hhe5OyW2
zh<g8vZTVkHqRZgz0%Y>gX$!4~;uS{tcC+@OZSeB9aWqj3)+8_t6X=D?qm8z@y~W#k
ztuyV_TiMkP<XJ*-0|9AM)|Cts5|-gZ%wb3FI~2Z1c{~x#5Rf+ouX~u|Qg6_B52Cb;
zlt)5SLQvf7cV1E+N~_q^0_|~X|II!QG`+VbY<3hFaVmE45VwgX3<D&-9?$i~#lgQ`
zC+L{Slb!3UABz*3<H-p7;RS_Pb>UmYyyLbd<Nxl9^JJuHQ$w<wy6!JHLx)5tJJk(-
zZUomyqo_d)b^xq$2hl#HTw7dE<V^41MCdt_ameYDuI~L^)&tN4Mwn^=={D=mnV`16
zBC)z}_{$TyQ2`uVHy~gN2iZF<*ISK4?K1DnXX5)!xRshHsdc7(!%CGOAe(l2o_>J6
zHdvSrg_9<mrT)Yyf`lo1(ZqFOR30$GsO<Wp8!|`i`|Mm`O#i?r(<{`Av~xjj7zTmp
zmGrl`|HbObh=*%A1y3)q6A_}2?E3LLv=BOA-z{(b9_<s-a_xb#lW|l}xYMF073!;t
zXIl5vNq$xKxl6UQ1y}-}X)YEIkbgEqrQ3BryOdpWc~L8MO|Q+MbN}l5y87OgD&KQM
zD*zOXwPkG6M}OG}!hQrPn{WD8f+Z#uWA*wV)Rys0p|+i`0H&(t*HhpfWOov2yO{_F
zCmuqMNX`5D31g}j7Snuyny!@G4|rtZzu95Kx_>j^n~ns~g@>;OzeXf5?is6hrVRuD
zCp54#;*=`i(c1-#<_E&<O4Z1kfKb_u)k}(#6xlj-SgLPC&If2hOlsT_$%_X47E^vo
zJ&~!YmAsPDZf}qiA!xL&1LTnD50H&X#@POPiw@DU51Ibe*V*2lKsi|1`8e0Zzhv-D
z;V+zZ(E)N0FFh2<|HIk2BsmO&K=exbASCX8v6*s(M=DMRGCQxjB#g0y)ZKqUxl<T+
z&ua_j1@Hq+3s9_N{3`BaEQ6?(W5uOjT#BU6SE$_z-(Z}Z3MSMOtzJQTyRed3`Wb4s
ziAiF9#@ykZE?0WphCRLcH&}x@KtcEA$_RONz26kdO0jBr2eZRFU91^2h_x_>E44j5
zPg}oDP(2y0WKE&)#e4eW(BQ*Uz7i{Vr;CCd;z2Pg%TKtv%02A9X4nWCU1^a*p%>HW
z6~dTWL6Rx#Cg7bev~?g~4gC&kzmDnw@Q+cQ+XN+4yj#4%LNa)5S2P6_YP9*SCbj&g
zPKS3o=vyIav=nU}EwmlsoxX*#sG@muU`K6N3bN-F?X=ShZAW;g69o-{y)Vw*KdaD_
zfp<EwPn{vpIw*akFhSRJG~aotxjvbiAH!Z#O`((tdcB(LaVFY2S}4fyPA7uk#7acY
zH&EVW7vDSoJ_%4xBiBS$?1!^6O3oMrf$)_gBAWYOtWKN#%uLfC(>GtTgOLbfW&MUy
z-tN+>n2$ll8h*8rAup|7E**197NM&f<Lr5upzpMji&oU(>sWP$d}rX!Q&(&B997;G
z-{8o12Kr8`ipTT$&IHSw2|8BQUn>}r72C6_v4RJFMI+ZDP&YCe2-F9tIpT=hMg@|-
zQ$LoA+W)K?AE4ap8>`L-r~;I|uu24K3&}sV5aSX<salN4T~q`rs$z4KyXF_Si;6a)
z1pMhys5wc@tu5Wy*w~M0J7wqds<eHM@KD=;^1rPLWIeha`9GZa)60S%D4bn41+<Mr
zm__`l6T2=@y8smD^G}er)1sPFL&T;JwFvex@`y^?X<3!9hY6nf5wIfu)Co9q<g8%h
zU8Nps;!o#eL{v`RkzS3B1lf@5t+WU(zq+sBhE?)*Lm|Xa2)Uh&$q%d={HYzwD&t+T
z$K?E}(Rq4@szCW0tJ(*sh*wqxP)cO%i?TCHk{ASm=#>N&&HXR7smb&+Q`suaU%n_n
zB1+S!GQ(H=wy1BkcW#!wD>(-xnaCfMX%6+Yu!2R?x4kgOvgMuLE)><ShZnCOM`Z@8
zJ0DFmQ9@CTYP22N8SGeHD0$<73q`dXorL7f^z^ZT>A7%JJD8MJK%8s!H(FJ+vWKYP
z1&WbF6D}y#4&9b)k@w3Y1np?mF|gxy`qP3&+B{7-Q0hId2nHFr6<2Uii#knPWp2p?
zY24spIo#929j>Y+srS{M-8MuW_^RQnPKX8v<a`BzQY$Q;3dyBHk?3PXlwqLq;APfj
z;Cx}Apwu6&CMTKlMk{Da;OefD%((8IpZo5yAxez{O^8sK@?eY#_A>Jj6_jdm+pknq
zYuo_3Z)hc^^_a^*&J47T$BwVYLsSfq#<KSIJWU8n{m;OFA~D=IL{Wg$SlV+(Z)6<6
zrJC=ef>Mn)sBO}K=P_US3Mkciqye{|`Z>PJqg_zyO;kKZonQHxK~U<?3IaP13Xtbo
z{&99jNe+WB482l=Vkq~&*k-5bk*2$Y)4zUcWDupUWxRxPl3Hfp=pRtAB?7eC@wRLX
zRvR1eTJ{7~1<F}?sg)h15Z4lG)qtv3Rs%E*g{A#LFJvR3XCy*h|2I%vN|kKh5!b|k
z*MMI^xs>|Gii^JC#!QI8rPRsl>i}I!mE7!k1Zdx*^t=<G{)Za;(gE7{7-ABWeQLF6
zHcus3+2#A<vJuuVtIqI`6f3LUjyK`O<a;5v=<O;6ahSzn&Otp1&vxNp6v6qvNkDyS
zJ?1kuZNC9U1M2zMd>3G#bw96vd?N3%FXGt0buJNTov{s~)$=A4j`qOZ8K{cFMA;Ki
zJFMc$YJ{r6ZwZCgT}{xb3`fsXPu$HxqtX?qK743uN&L{J{Zvj$ROj1PGzIlNAqBK<
zcc3(1s=F6n|5zz`|D>3A;2MhdQ&lD{^mdok4`*kW96<;I;VX@ZF5drQnPlyc%_bG8
zyv-BkPm4|i&C^u-V^kwK-^!@Kx+I(KFHn_qMa7gF%!p#>C~|ZZIli{?XbGs3&hGkC
z>NADvDy9T=Ctv^Hqr$CIkkIIk(9}F&wllkGGr=w_bd&`q88WNzD@grm)?&E=XWvYn
zkD#Kc59;p8Wp-jg9_zeRl%KNdjw<6=6!KWXgHnFFxR=+<s4o0M!PLh3RL|kvTf(qj
zwj{UidS&+@KYk5*Sr-;vF;o`a11*51G=^Ca*D-}qbNjj;#(N{5+jn-LilF`mgaA?{
zAZ(zcynK&IjU=129Uo=|OYy!=6S6l*v|nfC86$j38995`!*~gu!*~|JTm<cXH}euo
z2KpRBFv?FSayV;nViZuCcGhLFu=n}781_B9^89GF(G?;YG(Q?COLl&7P<-lxpPFRF
zA=p;|=7C4QxJQ#Yi9CCS`6-+vcGlPR!_c`i&}~Q^@stAAu7H7YGNin)dBN=H^Q9B>
zInNKu&IN~I7=)o$YRLco7hBcNkExpkJ3y@@OBuB>{B!0wPqCLRj|bSMRvZtcn>y0{
zyuF_nQv4RX@07+M(8bJ@x$ahoWRJUP&O0-yC=-D9^OF0L{Kd;HNlatc?#A3sd5Jw+
z37HJf>1Y#E7-j5|Ux(E=K|nJ#RWAP`;!^Y=p3~NK5hh;dO$KDKRBaokQM0tp3`%6U
zr!6C{jWTJbXR?9Qf{~P4-=o9g+Ndhcv>5Hb+QMP2PLmgC2vvZR$a4PxHxzA};xJsL
znHKX790aOGQDG|ysLHBn@L7C=_Rp%MBJ~fM3?hz_w31nsioe=WHAT}0+dwlNBX(2P
zgCyN}o%I>nt8V)RA41VM!+obrmTe5PNN~mVpbh(GgVdf+xzSgP9f$RRSC<a>-j;D{
z*|S13rT4-K%AfM4*<{@DsiK*7CH!;J&UPvur#6UYI;cFc<!7ZRI^)Pt(M;XJV<Nq#
zF&Cp92`G5=ay+3rS=G6|#98&PV>g#G2r}bmKz@;S1xO5nFzib!0Sf>B*f!6kp4(a6
zK9EDKP@5(_L4|upbmQWe)@+!fog9Q6l>7IB;Ud~&ueJb5q2@WRtWC8#K6H8IHVz2+
zDOD-0svEcRpRK<|jwzIqbz?R=n%sE~P<gbIGquJ_fXR>1<j45>aPkn9{IrC4asK##
zJlmxiHCbNRL7h4CHyE6$R#j9jE@7lU7gp83K)ImComKe-RFAUI%Bqyfh$fSgb%$Su
zVzd{IZn1D5HS)`S!2uuSOq=>%n<`8_rVjL+&H$9jgwN-cDL4uA4L*e`A5g|0X4hoi
zVY!<h$eC7W-)n<T2CzoxUKdtX&#M}m7d&FDg6ACqAZI$5ee83dHVXy|&yocsS+Vn$
zcs+}At29pr>BPkfQKrxc5!2}R&f3YgkttLh?FuV3V1hFmde1dxKqNBIc?{k2<;E>h
zALqR?3>DF2rtkUxH%OW8+RA_Ss!Fq=wB4z?i8r_up;dakCu!$_gD?z3(JRGqMsxp*
z0mc6n36O(0K&=dC)PICwU!tT%T5NZ)eMknKU53tctAqV5)Ih*9HSFgEq@gg2L5ILt
zy{zU|H$o}f5gdjP_}M|HgL#SyG&R(xhWgZ+{S<0_4|N7msQh{*(A0{yD=VT|g~ilk
z4fb60>jF(5jy7+tvi4J}stz1X3S2G>qhmGLbJ4F0H0|hEFPszO1l#!S5@c$nUMo=l
zN>z~C+0HbSNbCg)bfHY-nCpy<Tt|C~&1Z+a*CFo>%L|w;&@?*p*PtucZCxv{k)XI8
zY@G4}P0hH|R=G}wrJ+aAER;aghUe?YR(W0rbAhJunZ;+CL0*B}IJ(fDzRuvm465{T
z<R%j?(9{g&;u1w?@P^>5IjZl2Y%e&`!VoUb<tmr_x=_=8RsO4F2&18zY8z!Dp{9oz
z0{8LPx_L52J))<PNcLL)ZB!&XFCyF<HOVR*#&b5j3o~7d%D=G}V-Y_$Dh!itUDacQ
z|7=C|v>RtvlH@=L!@d+_jN$(uOQu0`S1KtxbL&g1Sj=V#VXcsR1ZR5Q6S*cU$ZD*4
zObdCa^WrHNn;wfzG*!zLIttQMLY4jC>E_;6`3&O>bsWGCXk!PIq3pd>UwW_rH9l03
z1CXx7p5G%^rx_Tw3%YLlXD)(;H6FyN@pNMiJvcf>;OnapS0~s99AtwAa^$Tp@C=C8
zP93ps^p~>+4%SERIH@2`cTt2zX{_g-6beWu)F;SXTB*!O|Ka2Y)|5snJ|J&&^6*m&
z0R`5S-fQQv=1Z_Z&7SA#M!h-qDmQxc;R}DB!cG>X=>pPXGGNjM+Ipc(i19U8JxY~5
zcGs2a(ZQ7dN=;&w5yn%Y_h2P3L2LZG`#_s|oc|<}0TEL9)JfWO4L%Y84ll;bkX-bv
z;7zyEVaF6jFjQiDZY-xDPABs88}e_wH2DRmf5W+c2T-AvkbIH(2Bdt;w+3`VoVOr!
zp|!maPQJNPPr;aW<wYbeo=EPR<QEqdeCd<2Gr)Bigkk8FJ`f1K|HbyT;g_kKl<Wd1
zO;bu@Y_E_B(k8z7es_T+Jl-g#l#;knHZar6&prmj6!ocNg4mA<qP!ihe5rN|$`@SK
zFi&ndBh3VsF3u~i-}!Iv&V-fX;TzD3cgz@al*WXVqI0tQ=1bXVIqt$rp<F5%IZgQA
zR_eJdlL;rCO@7?-Qc#g6FN~T^I4O^ZAk2wwoaoYpRO2Z6IG5^v%=m?(wYn<Yh-RY-
zDv1(EdKP#kN^oQov2+!P@Yd)+wbRW8(;o%0QqBdEp5lHkh0LJ=zE^6hjeArlYxfse
z$dw9R)9;sF&XbJ6{+pBI41wN`W-vDyFAx>)g^1SYO1kTJfn$|oQkARu#5)L4pjt#C
zl)`vGl5qav4Bqpxz6l%cv5|KioON?_w)_ulK_?Zqja|hCbs9O%+&Yb?4&&<eeFk$W
zpJkX}(f<Nex`#S+pZc|Up@TJGQ5_9&EX1(TXRaS;Nb-88`&sdH5QMytCTRo&)0vr8
znB9FHa6ULY7bJ#35Qtt$1!Hpmi?w6rkumLvy}%A4eizsY$P*Y(2FFc>!(0Q0d0`i?
z7T=A9a$r*+n7m?o9OaeHdd%Ee)-1H5V4BD_qhO->b9&9PE6sSD5v!Gs--o2SVH6dl
zjpuZtp-_U=iA1Kcp~6e?{{hOE0n(ZIk{zpbnm_1z2kMJ)2~?lcXGI*|d^I$>V?r9<
z*<Ub5g}T(m04VG=VLzR}UB0<R(TKNr93bU!`RTG=#q{Ado5&w<y~+>{t?P8ck!D_c
z1FbLiwBUUh)a}>+lBbUfCdm#G?Jtl<%Py0^%XOW}rPPc<nV|N&qivwZej-aTbQeAq
zqq>7cVUb<tMh0=ug>{v#90&m;ge-qmn^4+k--b<cz~PplYuWKbv!?&7IWMv9x}{K`
zOkJj!tKM85Kq3(xU5b1Y%OJ$piDg=8@?y-c1!nP2tcXc6;e4~`#n~C{FbslF^p~n4
z+W-HtEu9{X?FR0-3Bg-TT9JD$>CH&sU??cAd|yl22$h#A2>mu~IJZ&)-dJ=cW=b85
zA^U7xm=p~RxMbRkWx}}FHO{0coyrNUth_x3&suuZlbLoITbLUtj*($e+%95QJgp_J
zhkZjz6d$AhmDy{c75xXSW~-#ws57}5dhfeQpPKY$D0p_$4u-+XPm3!npaB5;4hFtU
z;*-^JW~4XRdSVX?SB`z6>#aCLJs-4kED#%Y!E#<@U7$~P5E<d7RVstB=h2Efk7Okf
zB*KpDSnWQ%!OgnDYPa;`tapI=msY*wnGT#14xBD>;Pk=nO$k=JMe~}~ZYX$m3<S~A
zeLrO5*mDiiJDzi>NLCC$I-JA=tKB>>Sok+g3$!oT2v)mf74e}O3-o1GS8`m-CBl$P
zjUi`-I=^QXamR9HRR_<mu4uf*yu3zle!KR*I6D_3hCvX3t`tzB*?+O#)%Zwju8=Ok
z6{H%zZ-|l=xyU3s3TDuFwf~?uI<PNgE2c$nkc%JAkPuZD_TOI0KkUECs@+S<T#5YI
z<&p5v3##-EDf!4$IJ@EtbG+~TGmZx*zC_uy3n5lveU(j|M3+zyXQv=5ZMhisEfKNL
z(x(bAdD(deJz*O6FVtE4Jk@&NF`h1C8FWU$1FRhinz|_Bhj_<GoyAWnEUzD_(vO)u
z>v1<(W!0`TejAr4+>V@r_H8Sb#*3=%qH&IL)<91I!dWWzOP^p{PjL2VJaq;>*!TX^
zuM#JCthTcH&#y92r8f$?i{?blkM_nWxo6Ex{Zq8ZqGntQw^r0EnC6$v5sRWrk=2#L
z0^r8t>@Chv7-OSt27*EXq+YnSaplT3VpGqX(97`9R`6hGQ@o)2y5$+a#@J{xP7o-<
zXpSD~j)XJxZ(EfYXJ?e<FbG1?EfozV?tf#Q)9A$}X@&Xg*F7M#Qk921{p(Csy9FZH
z&Zv!clFg<Y_O(^Cjm{{}nunG{XxV8SHN;&wj;)*zYCw=(X&W`>Y`Z?L`9I4Ds(we!
z%f43U(QzaCw@Y~0?o*nd@v>coG1RD9-6n$u97KH7{8yB+-4BW*4wCI-c8)O2tV6>n
zvR%=YL)4ZC#!&5S)rW(b2$sh=8M=K1SHmc|L{R-STqO~~Qf^T8KNOYB7*r{hwVGb7
zuG<lmw$T|SpjrmSgT)=xcy>{J*1fG|Ih3|h<ls8A01cz;Y*n}A$g7q??N_VDT4k+j
zSS44h>LY<dYWK#fcia*vvR!{$wcc^+wUTj>I#5;v`yf)gGNdLtw7fsn42rf<E;x_L
zfcc^bsa<!F4%A+>9c#6}IJ*)g2w@QRCAA0k{~z1cG0Bb>uph`!q-`WXeJCc{d5W?u
zq!^z@-uSZ%WwZ*kwiN|~P6nS8mG#E$<v*zLYLz8?#lF!Sw`ZZ|XR_V+oJfdl*X2UC
zSsyYl>csLZ>RMH_i?{P1N19R~M4_5;7&NCYmzj-b+slbAP<vjUwoPn#C`IQ))Tt}0
zE%xXK6?D^qL@kS=zb5f44sb`Prf)zoi^gef121EY-V-=Yv%4tXR6B=2wEzQ^W?HrL
zxLtY*YB{+{UoPn<sHUS!LtsKcNx8tMgKEmBEDrbNg8-r_Z5ooxawhf1#br%`XgV=*
zvNZnFbY;=}qYk1eht=E4$z&`!D*=W8$<)wAsX^|h822a7Hb|xfsy{**D*r=Q9yC)T
zl~yiDyLB$o5#iR^Mxw=KZeeza?x*C3vNJl8AOwMEN-83ne`5Eu{g|8GDm4MhK?js>
znoqoxGUSYP5ibRqe(&5Yl!NTRj=#T6cEbGX+dxazG~Q>U>=Jnf_HjUHY3^L@)EKSb
z?A+uA)%ok@4^sz=QZrGa-Ms$Y@;L1;1;R=lVY&i+B1WdVef||xiY2E)T(bOjVn`fa
z|5}not2dVH<tB&nP#^K~z)MnKT$!N8+e>Gb{OzTM^6Axz@`V3d5--Ns-@qb6IN5-9
zz$SgCuy$aIBMuN!g4eYrU1guig^*eSO@{C5a}^Zs_p3rqx1!uJlAIabq4$h-M^3jS
zA3*R-Sb-RQP-Xswkjm{J1ose&bRnb<Ulo#YO53%)#)2cL+Yl!lsGKZ5(Drj)96{a3
z5DgI??uKai<ngI{T~v*kn{+qKdhpB>MCz;a2a0DBR+%5<`+$z7u1j2I6jZ2lVqJ{`
zw=)lbzU<LarbpQPfM4l|>beF34|>=~>vXF9=brshb_OT{gdh~Xl2%&Y|6)6^_=MR7
zn+rsV*-yXU|Cd6Kj@iP<1Nlfkz_wm+!-Dp?luX$Jv#(SdI)0HK3AkR6j#NR4X!ni2
zUT#4eee%{6E=!zn(`jfZ>r%L_{K&KAYFh05D)4r)fs*NiIr1&t^P*@J)k8ON2BY6U
zz8vtpM~<vWVKlE@T~HAXWnDqeOsZbKi%r}{1{Y#Gn(~IO)<(SJYN?9tID^~!+kbO$
zT;O^QmKyv+k9^q`u^s01E};x2X-glFy_9viHcGTw_phJ}B_pC0qwl5_-=Y6HxPW6Q
zWGM+CTj$I1k`CaBug6JzZ6|p`F1?tU3v>VlU9ED^_+l&6(oxS*+3y2BwrU}f>z~Lz
zjkkFtzao8Ha3$qZIc8xP*kF)G&n$4o*NX$HRcj^L*+U}F0_g<$FVuc5vbD#>E^L+L
z7rt7s9i*l@#D%2{K*Z1=xRxC6G5W=xi0evJfI1EPY(-B}b_KHwKwIJVR1u^X;rHM2
z=nrLQfEz&wLeVQRgTiwEi`BHlW3%Z-ynq2jMEUT4?Q&tOz!l1?_F?ZLu45|+9?O##
zZbQK=kG|OoIIse#YV9E9QKWj*`b+<rO>PaT@O2KeNZmFS7xsZK%cF_qxVYb6{RGDD
z@!jHwo0pZ*|8!Hok94yRI>EKG6pmgkCvc`kwaGVv`i-Llp%);j9&(}}jt+sIh=1Cu
zrJ%~^QcIS)mamhgaCGXm6WW*vC@1!V4onNIPFvi-8HS%ol`W)^zc3>hEFal0(s?o)
zB%~fZxQxLdHczBVZ};TlbImj8gL-XCszfwG1bkacHTm2%*?$q5`uFdJM^$}P-7b~m
zx#C5CI;0_5tkC-roCXQ0IO)2Rf`;|qBL)enR0@-zkO6Jl%If#W84}WIG!iD@Z&}Ds
zq{7?5ElJgD&lIc_hPh$j!a2@MzP*c%dYp2{4_Z^}|1ui3BDT}HAYN6PwdfCLXMh7S
z2m-+`Sx*uF|FKK1?QGLF0q+AFL`oH0_JEo(6uG_eV^*_HOwhRSXpl+;)eT=E`;vn4
zhp%3&`bAg>HSbm(fw^uKJ<`I!r~N{>|0byF#IK62E84fauiBVcRT5BVwAWLf>R|Qm
zxm}0jI7GWjF%)Ur_PCK`PBL&yRfVRJXccjXL>1bYsq4I<XO^55CTeVP_s1^u(uq|(
zbf9tPi7cAyl(xihSA$+UUx4}w(7XYaG5-QWg!H9{(7b#Wb`KHK7e?==GfB=9k&Xzd
zKY%K4&O9EAWY9}%*VhLtqqG&9h;v6it;y-gDaJKbLxZ&FWr0Ww%yIO1riRfl?d;#*
z3mkV}9RSOWY*WV+woet26HWG%RXW3P_f~&$tSk@_(rbD4%<9Gag4@UT*ug4AOq54F
z;VaQgodvqG!VIkXa&|6A5`!QRy;6c7$o((2TPb;DoY@uU0u&Nsq&wZbgew0mP)gYe
zRX>C}zY7Hr1E-G-*j*v#^w*y)<fYxAP+>Suqr1tdGI|*5;+FNuYVQf!tOFb^os3)t
zGnMEgf;?qc1)@_oa>7ton4cgF+^rA&%KG96b;|#h-%4S+$@{^F!|S8yM<S~-@2b)?
z{3EWNTE$+sx$GloI+WjFDgy>8p7Oop-oEyi>p`7f0fpKOh5lx>{>Y;)WqEG5qNg9m
zdiF%oeWw=}&kp~(dwC5=KoU8*Bcm~j%^1bDmledRRHT<c0-K@yUl@zuJi@^=hBPK1
zN3^Bl9kU`vQ}mK{ltfl>uG0mg6hADs!um1`aoY5pYc(Fg-Hs$!4YZ~2FO4A2PvzAA
z#`nfT)1f%kqcc?qE-f1`&GiXhuQNiM3l;D>lQF@>TijvRtfE4jI;{G`*%cr`2!g;b
z35n?cKXy0QwNy+AKA;^yB7+6?#}?A6TC9|WuT8}-l1fG@4E4IJ_m?g#6QVj8+-&4z
z#XrQney0U9kFblIu=bj33Q8hHw-{7&3hrv{3ib>XI_+SoMVb1GrKqH!P&Bn2(+9h4
z19j*NHN7jSEhD`by)Qs*4n&S=K*b`JWMpCwh3cKH0}erLFP0J=87M~&Kp{S<p1fEJ
zD~e-KMh_Tw_q_Od07{=6;dlHAAR`B$S&!<P$%i9S@TN;rad|wwoJUzVsi#+cr87sE
zhha?HJ#a8LA63rU=P4m&b8@>RzzaHML_#<}`9XuBdIm}yNrceOO{c>PKsA>~B^qnC
z!W28?oC%}nSnTDy-WNZlolz3QAP7XSR8cFv|Hb-|^0rMfQPK<SEM&t70-i$o@8`2d
zX@adgOO#N#siMc!wATbBo*&&)N}3i|r6<bF;Y1|wR9(8)TVATiTDn*jUcOj@lE_~N
zNA>6#TZ8Hsta8d^g0z^Rh*2hAl{wTnfg;sb32p_7XifrB*pgGK+-`Fy>74T&TPJd?
z*th$qqu96mNgV;H84!*uMva6mEp8bXaXng8n(A`VGXsUlE75@CW>>m5FCvV%9<@EC
ztaZ<$mXIam4{K0kZ(VabNZpvLn{Ra+aW~qin>K#nN6)w^^lfwqX{VciNot<yX?irC
z{Q4NR^<*`s{pRNtO^;Tw@_Vcl&Bwn`A#|rZ;pF?R8Q3n}o`Q;KzHJgK@Uu5(=Yr!f
z3<A+B#qkIG{ugUig*U5YD{wC`0!kh5U}oPzI#8-$tg2m?NoSm(-EIk5d5Bn9c{W<S
z_s5(V9gZ}fsou*-1Zq9JTh82ne9A)&rMg}aVwHD8^N2Zeb82*|8Pd#>6Ph;SEo_F;
z==73o92%a{q-{J~V&X>sB*Fq}>_Bm(H^!edKe|-6B%<z`T|DeKnNVN4l*%A+sOv6C
z!|r=V*=^Usg?WORMw*XEv4!~!z{f9Mz+f<=g<Y$swo;)IFcW`2NsTfViA45gUmB{A
zRf;<I8cQctT%$WPTH1j`_93gd1BxFg8_a0oURWaMdttZs{TIBlJ`LrYFB-z#jk06Y
z!SRoS^*0BpV7k`W7*^FCtLELo3*ZL_b+E%iO0C%k5UnM8Kj%hE6Lo<O<Mhtq0~$hU
zrxEW>SY9~Qgv6==1~;m(cf?=5L%ldV7bJ#35Qtt$O`>@Ji?vh3+fLF}>;bxiWQ!kQ
z`3MEu4<bV%kF4YDHs5c^jUG%!#_hYI780^bZ1<CKre$3UULmXM_XTbY$&NuatlIex
zG6?m^D^MtS^?u`3)%7m|)p5JwcH))Z^5&zvo7ze}`Sd@OYZ@{0?D;dV&og?ABe7k|
zyGSa&vwdH&%InlCIroYZ`XUrB>0Mf+5-$`*=No;OI-_p69z|<PD^RF2LI$?fI))R6
z-QKQWFdHu&CAAf+?7Oc{`@&F6XY@MtQz+n-DrXL2pbg&CR*Kt)vkPP$Rt2DFqL!kw
z-uO3Lfs#6-bX(<i$S~JLFqC&q$yPd<iVnyTsQoIJdjbrox&r0u7_?FxL)~(eKzUg~
zn}<GAV<{!?#lPTI69IXyuy3i|pcqB^0`SVE0F<-6_jZ*Qt~paD8=+|bvB0vlz~{y7
z!PyxlHw=S7^h`nyM)$v18z;QY#BIR&^Vbg2NEWaQd^%TxvKngqVby7`dQhkVU@{E#
zyeV0+%^C_%2KA?)T=Lcq6xkSE9Qq)-@@X9?^t(g-fa9Ak#UY+lI(4Iegnr0%Y9J^r
zHNDOm0{CJ;SEDaUh$)qRH?w@xr3mO)wN49ksuQm*Fqu-@a@%ba*(P~p2Wp%aIFMls
zQNbN3``@Yq;PI1LwW2CSm%dm9$GKnHt1P3Q)Xqi*y!+%yU3JPLpi3FqH*M+;@($J|
z=OMZ@RmIN{ZgzZ)D^UBpD)niLp-*k9QiB1dTZWc5`j-dQiE(!{OQ>~f8}IZCyk=E0
zraLp+ejP!>DnnJ=fRcijfY%fc>f$t@(vxwLh74vu01_%{C{8;`d&6(XDjzk`72-{)
zjAAU^G-W^PCN&}6l)`L5xl&;rC{8;HLLXm3q2Ntr&Mh9LLqDWl2@b;`4EqvSL-_y4
zrcJ~~qf<in0gKSIq&TtP31V06J^Pj*T4DXw>t;xHxL4+wF`zk>Sjm)r0M+Q2F+ZY%
z-Q0@}oS&h_oVIGYAZX$35Z=|~{|>70rvhHM!@pWnrFxZr&cm(rCO&~tWx!WZNuNT~
zPV(lM_gS(Fb^SKqo4$wPRmtX<M`KsXM^N~(qtwP6QdJgezQDd>x>QX?={eNcR#i}Z
ztO5E^<WOPrT+o`aCPM(q+61igy+Gp<!+S9xt74$qp{9sdmoc&kQpE`Y0-VO4yyo+@
zU=#$ZWce40gBd710A!?m_NUkNlAG>@f>Vom;J<#?p6Hlnnt_JH(=DaoYJUnfzIKZ7
z&5V!6M*@|SgiCx(D!<w@0<}SCnw!2pKmVWsfx6IBV@C>H2?*{T(di-eVR&sb50jBX
z=3y_+&M@0T5Cp<o3N^(2Z|wa@KJKm85$^(;gE(n6$ULC%$)K3KwOFSH+e0E%{@+pl
zh3Y#{_+-#Nq8@Rfo<^5zfzez+ZNm>qZFG7~am7j!=Pg%IrHt|J+13*tNQQ#S3`#9{
zibOHey4J&7L7k6%<!Z)vL9KIzf_lYrLGkY&$1hpyZ`SJ_YMQzfK+{pRCsdK&26#RV
zX4nDiQFfr5?W)KKMi;su!@9AI^?r})i|x7-mA$8Z4mAz+VEZI%VY#W3_bVtARG@03
z%aE31<Ha!?zbFx}R555_1`{V6qh5ebFe>IW-oeBwih|mhL5(sZ4XE{(zbmK_l_;80
zi;HrZsGRL5{~c>+N_zv;cc{5@r=if4;xpzWS6fgxehJ=MxHbcIj<wosuAqLT{S^Hv
zSFWJWdAswf>_7==e~@7gH4SyK{g1P2$&wfZfmf1fRPKMV>3$<sCME;Uu2=N{E40Y(
zN>TY2MX|dSCpb}bQ^B$*_;7+Ts1s7vyF(uLoIG5!3kBb<SixvcMw+lg*!S(opf-Lu
zylGd&ToEX;owl;iIWrE7K<Ns_zB?8r`B0kDyHtA$DtDJYNVTP)CS2Pw(Ha$MMexcl
z{;Q6rypW-?W@l3H^r6ZhP?e?Z5h!DOw|0NQv(@JpZPk1zW4l_6BZ{u8gIy#wV5_!B
z)orHMu2jgNN_mh<cBIlf)ByPPSLX&4x=fYvAV#K4BR2vHS_bvVR^@wSR`bDMsUPDg
zc9(YWN~cTFmQ?wjR~K6ape(0^`C~)X@8W~Z_E3M$f?5WZwi*^X2Ec&wXSJziP-m%x
z|ITd(%3j&?)a26d(?Me=*jF-0x+@ri(s#3${=?ao;4lorurIA?M&SP+n>1mYRoxQy
z0SjCxhaI!U6%|w^$hkD|Ev~4bI-}ql<ITG=tnyT!!EoLcD*l7QHM=8+(;RySa}_s)
z<xmWwhG;ecYyx1#$wxaCRCUlTZfGxbkeQ{-%5dEs%VQX44i#4@YY-T%sidm{h0)%S
zjb_10ki~Es`9co`bqQs4JeD@w_ntWUn{opRsy*Rqw|LOABl}NoX&F#Ze?x^?p;fqP
zj|aJ;x59!Q%x~2O6jbZTEVa(JmYXcYQGoKBFF0E@zh(6cLO~VOx%e@ac9K`X4JP!4
zi7UPAaO`juSK24pAFZlEX|$i1IDACYkF5@l@3e1nMFmx~yB7Lo4i=z}3Rg8K{@V`?
z2A)!7SB!kC#u8LPIgd+g2MbVsoj9knE@5xtumrW^lxls@g12y$@2{YtGJQkg8!pe)
z<!z1^XIGHJKnMcAq+Lb$|Hs;-&dg?GBlfl@g35vp3@in)S^(3|<rgNTm|mW9rz%Cw
z<-HC?1-0^pDV&I62DPyYrIFgz263W2_7R<Edm&83M+t4p_ZK2^P#ZZ^jpt|TnCJ<e
zu7@F9EIXKhX<AbIWl}d*bHbvKK9xo$4uKy@Vxa(YN^p2R&@K4$wZ9i5eY)1^XqPa+
z6u^Hl3lst!_j$bNgxHB?qg<o{V0TMk6jpv(z;!FwO03PqP-2BJ5E%KCeN^Z8QoLt|
zVtR1IXCxHDrA75sx+yXq_<plRI>m&nie4FB0eQLYtJi}$Q?dX5+ar<iaQq0sx0NMM
zf6$dM(!nBoG5sV7Q9xb5TxCOw(U6F8v&0_7<G-DXd{x4GHql%?*oIeJft9Gt>PCH-
zKo2zep2m<hfx+p#@RJB~8o!b7N#vQTI7E;&M?=PbDtd5oDaM3$*^-EpQQn+gQFa6&
z2)mLN8Rh;L>wYxJtlJix3-G{+3`!)qA<}m#hP;;kCN#AQ(E;B^eEYND=0Aq66OYy&
z+)onOP36@WADI67=}w%YZ0R8DY>@01<d{TG#tFVJ<w9wQy&o+2;@AMJ(?!wu=}r2s
z`41eeQRnb13svDlX2H_f(&Za4$y6DI6=xAHNqgSHD_!OpTn|h6<r*)Rjk1!J;O4e}
z&2A@*lMRffs4@XZsZ;jU!wSJktCU(B<nv5#2Y5nD^d22=?4lhwg^uX8C=jc<f)LMn
zhk<^mgTd%#k6;-)z?FG#{Jx4I;M?@_mI_hb`K&Rg4+nao3a&p44rk0S3@+^CzqwHr
zuNQI?I-#FFxlTJ3mx%BF_fDB3pIi{=f~rRCA2n*hkT>)|1xg&7rrI3ocz~CkzJ)f?
z5SkK}O>5?t9TwlvykZsiP1zL~NeqI(mNWzd{WtbE7k5eg{{agKvmjywVI$@1BbOtK
zUIPJFU75txf`QIeF<6?4)eNm@a$%Q}>xyXP5A3y}=*hL05rhme45hMYpx#AVoVx8o
zvfLeOh#WhOJA^ZTI5^>ww9{H!|JSjnxvG%ZE-H`Pci20^WC0VL`><t`OyRd6%LU0V
zOv0?tQ@sMFbH&6ljMC!AtLK8?;GDoG?JqMGv>OYgmn7T41P8y!e1Vd;deBG}!a%nr
zE=`?oO#Fk>f<O6!>7sJOjtxjCaZ=D!>6qUm2jjV<>Ee!jp7X7pSR9o3%Avm5*~xd3
z!sc`4lCrSimq*+$848q%Pp@-%YvVv&aybag%5uq$le4}lJt)*WMUj+P@)L?3qVX_5
z9{jjlqA;D#aSfZ-{F`o`W9cQ2<YXWXRD8(v5>-IuL`5o0BtVTp%Erje{yk}bI6K2+
z2|*YJUkNQ#x&OtUqx8!g_eZ;Xfev6Ap^)Z1s_|Z{d-`dptpbKxsHlS*lKqae?c}O-
zZ27Xs{U(&Rh;CoFjJ(OgjzH9;LdR`>wr^mCK-9R#7`&W)E~)Ok={e~k5Oq`$PSdX0
zWCC0m6%`e=y1+QWqZD@7R``H`UE2-4ob4J_&U`f1H6A_~-c~Lww0x~FAT@eXn>5Tc
zE6HW{qhUb$uly8wbMSjV-3p@;*a?LbpLeBT{sp_JUATg-Oip}x-XIa>na_HD_u#5-
z6nTXjA2kDTwT^C2;uJy!+K;HPiTS*N_6i?&QTxdR`O8P`zc#8sdk>NJBB_0)OP#Ke
zh(1=Ncc?hYdTVSMJWm`hIK4ALTn{F_IrBEAS11}X%9fE<7r4>h<4Z%yfRs?@F9xJn
zD4LHR$Z5Hvp7<Wj!l71eb|K{b^f&e0LDNuyb{}jRrd*D}Rbd~hHoM5|o!<G5b~X3(
zzCs-zYlTOy{c(0i$qK_D6y1^~K+OI(rmvPmr|N+3&o9Q%OG0viJ7EJ`zDl%1oG<8C
zO|&<BwXV4Og!ZXgFOWvj#Fgv+zyRGjJWVZ3316^2CW7(gCUK9W%U<eIuL!J@4+iZ{
zO-*(pP`SD_9)jRJo&4V;|5xg<_v4~8W#4ss?e6UC)^IvWJJYF$Z|_*&>H{@JNIg}m
zi9pz@zqjnt6pf<MN9jz{aS5zHe>D~e)-B7GY3K`6`~Ry<r3fi0(M?ie4kq2|1?H$-
zq@{)V;w!rFc6OvR#m*jA)T2*Pj+`n?)xkU|!9_KV7d_@v*IHn93kLM~?E6*zWQv?!
z8%{SOa1eoZMU{0n7&uU2YK=3A{YR%K3rd@)X4ovkrU3=Y&C#gds01}Zy<Qr=THjGM
zrpgZsga{R<o}PW-Y^rv95}{dJ@jh~GuO%-{MFH+mrq-m|$H`ZXe?>`RR7Lm}5S_wh
zerr7ML52!n(Bb*qxJg_I!v|+)mn$&{Lg6hH6o2-=u{%k_M`tvV-nTvxwP4{u&)J!>
z<*XR&t`Nbcf|-73f#RPbc)O=p?@}pY%DufqBi2jgq3B^IuH!-1A9AyaM#Ds7V<v!s
zvEJ<ao8j#3^hCM&hR2NweJma47wA3FGD#R_#Z+Yf8B_3eHOd>Gpl(pgbxRbesF2D9
z--QB#MQW7*KD;vuD}i{Iy=kp)4B_gfZ(O~-*&bjFna8d9{$(l^HK>qADc^jm^kpfJ
z3Mm_m_h-{@nA`^WBO1_ym<fpejDX3tgJSxB4qf2beQ;ec6Ff_NP4#R_N%tt3UD4|k
zDiFkv#Hz|Km}ax;QY9t8G(m+_gP5l+iB&tZN|>NR8l$rcTUXZ?2$+NlDXV&<dkQbe
z`5P~A>?(9*o6IqH>?rQS-E0nr4(26>963}>t`&H+Ac&VYeg(&_28)q9L$5wv^m#h3
zDw?JbkaqkQr@fpr4?&6akFzsKVi*LW=#@%P(fePlS?K$nCLKw4SusM85I!GnF3$8Y
zpI2xr%75ExcA%wgMVTD}rK<}ECSL+mGJ_BOop*FwzY&?d!%Qg*>S+oi^vTqj;-X#^
z!2C?T{##TTVm2kh@q$iQyAq@yrwwQ9YpQmzCqR=uTfebWLe%o}x;|R%#hw6`_nse!
zeWZdLT4{xD!P^URSx<<PpW~d&lKzMZ83oIYDEm)TWt<gdw4fnN&7%8CuPyBK;s_5<
zBrj(*CiIgAqbX(be))Z9p?Dxs`)kZDQg^{4<u6A7H-*eO)jFnteEza<)5gT+z!9RZ
zB4|%^37BwGhd<Q0f8h^o#bjN2nJ27u%$S)5xJ<z5M~z}#8dv2j5vK&4mKhZS;IzNi
zz?w6<kG&{z^<c|GkaP&H&YTLa1^G)EK$OB2Gq%FpHRP_)s>^KT)Tsuix+r))NmRT^
zyA~XZK@fJP3D)iY7kkN~Z8Eokdlw*DQH1gdMUgmVjKbM>qgU8kKY&n_ve8BD%l@sv
zF5+~Kef5?H=~az@<9vS3Q9voAd;;Co25Aj+>Uu5zio$3!+2o9D9F8JyD}G{Jy56o7
zvoX!;EN~7*QP(+v$v}EbpT>+RzU-i9IzArFwmr{DZKO>NQik?vgPKk{kfKht6*1)s
zxkEgsiDilHa#gSqubYeCPg14|7n24wDBPbBRc}tOvU(2ml@nNDS`|2xo59Aj(mfQ_
zW(!#Clm9@<G|;Kcs*Y!@T46d&1}jL@`Lo(}f_#cSzBHsvE6bH2{#=xs$0~}K+^^MD
zO);3h)l;vAua%0yz@Ia=OkKJTPl!_T7fn1rv?dFf!3q=XRXtPEu>UAK0~>~65D2am
zVmpTY7i$%Tqmmne7kKfMy43&R8*08sHOwzm^(b7NxM=F_?1jl{cCYn0a&c0SOe5(n
zc64ne9m%xee+a0?M*sZrgD;d1WSGARtKy23iZ|J}4>N_L))gr}`gOG(g4DX65ai(F
z^D7ag*5g?ewia3R>$xjK5KS8kMaBU^_QjT<u6KfuBd`oL-=o^il`gqzoS~ahVf`|U
zL*Xxt)<2iMC8kG}E;No~Ryh{@rQ)Kg&IM@@)OF@&anUIDxR2vcM8_<ii+7???DmJ>
zxf4}i`Js*Q*iH$_U!7KLQL)kIrxFVED0LiG%>t_LK+UBRFhG2}NZWzZb>!n%=PP<4
zQ$DCcrVJIAezsSTEDD{Y%D9H<(96ws!VsyuyJ7c4SB{Bxox88@zYk-C0r1Sfe8{EH
z`^otxy%;2=1@+_eL)w{GM+}2Nv?U94_TN~Njr=E3b{E-cU>?Rg01d<R*)~*Jn%m~y
ze!ML6NM<`o^@&mT#Hcvd8*S-Ib5{ya)Ujn017DIv+__2BGQW{-F_e@mD?^*@%HU%p
z(|ak2n=>hOh#nVn5=}EnRTrY;>LL_JIvVb`q5QSrfdCpo<-S+t%V7ilCzO^t7fthf
zR+ZOopC7#qb*}YHUQ?9=s>rnSfgI|@>bcoHUqNs@&b<sZAf2t;k0N}CM7gm@YCEsn
zCdZO2#nSNyY7`=c!lfMNxQ3uE+IaMid^^u4cnD;xP2Nq{pI?FUMQK7*^Pa~3@nSrc
z%BDKT>he85m3905`g`??RTLZhzoFWj53CA=cGeWEb@()m$rUJc)vqC1A=F&yit`Zo
z&0<`}iL#j_=n~pPFynsMlwv5PbPwWK>Jz#2w*q7zoSgx(!ypJm&lH11?|-r1X~SE;
z>5SM5?0{|%BP<hC`R`s_lLw9`T)R0Q_gYeo%@v9s>gee0vr9P`v6~7gS3|yz^aK=P
zTx~;AdXsbOyJJyvX~nAAW~dY;OZx)Ve_}U}q!)9fMhDvlR6LU2%5U$9lZVDE>9uZ6
z%2WL2#upVBbzH0Ur*bNi19j0J%)FoO38-_{ki6Y`|BS7+<Dfm|C@;k)iaFN5%?gjC
zgq7RXkAug~TG4N({^zKT^uj!7>j^Rt%TW<DmsJE8UmpwSLs0Zb>CP8apH*B3infEp
zDnSOsa|b2m>PY(TI2ezl2W&S<ZCO#*a>6R+k48y=I~3i765C198C%i^S?vUrJ;^|S
z@JNPrUTtDK$)c0(J9($Ca|8yEIy>mvL6t9Mtje-I0o7)!tWq6WQGQQB^{>nR$JrSm
zAq;~+@Jj}fO#lBeN2lz?S_kR}ZmuaIByjM}s`gi;N$KzWvFv_f*-4YGPUZ}%!OD)t
zu!9<)Z78fg6fpV;RO18v2=(!S+-I!*gHo3+kHlL#<e`JUzWR|W)y8?K1Uv3mSYhoX
zB`4A6ylLaq@l~cuP0}F`g2%-e8c<lfvaVT;f00!%^dePAh6>4DrEwjoafA}9t5EiP
zt=y$~?LcAe^fQ<ei%ZE_KU!L#xnl_8mXS;_96YQpD>hQ4&cr659-EpdHTEE>(mCX0
zw*Oe6LK=RA+WFmg&=N|w(uA^n3il;}I~%O9b}|{0>P_a8z5Cr(Q0lI`j7QC2+coE)
z;YHDx@&|WNgI}9fwm^zh!w*U>H3YH8N?pFxY)CQ)sfQY@P*Wod4d<9(#LKHoMG1v(
zcb1)@t%7Pam@y?wZzo-07N~bD`sD14k{gCWAbKSWNk+Q=#hP@iw;sn0xPSR#2*QZb
zvg~(LezRZ(ueJyKSIkFpn^NKrlI@N4*5bn>f;c_CybvNK+e>rW+J)!$cWDkyDckoC
zubR-dj8~FobUqv!$l^~-)z4T#?0pz3gh(}<vrKg^uioN0J41-{ChSN2(q7TY45Y6I
zwVhez60aw*6JA=VqN?qxS8=w(Fg=~%*#76$yn1!`VklSV^s2idL~6ngfE0_GB9H6U
zLQEStu6ohNo;*)5z-(crWuvyU%H<FYuLqYQG*z$3P^CS|3H}~HXsU71&%eXITTO(W
z?E%HFrgme4PRgtOs%ctIKoV~<2|A!ny{~I#0djp&GQ^KgQ<Ca)tvp_Q)z`0@=b+e}
zU%x@#`r>i=x+&Xt@`^WPjTnb|KfMB*x{>YT3kb~h5u2j6v;V=tlBW0q8B=6?FE?I|
z)CvA@c1GD6Log8DQe#MT{~NmxKa*bcNNpeo4Mlu2Efn|d<|$gwhP{k=^#GE7))c>F
z2((HUY?GaJ&=%8q`hu|zQg6Bsd&}|9#1$5pDfd@UzrWg}ljwC*TC;a{%a`@7yG{WK
zQ?Ci%eeY<cpDOFMFS<co62_>3+udxgOm1W^zXB4bnu(xP-eXouMeRj>AS?0?Ctxq6
zOwURW)fXZ9-a&`!BaAQ}jHxVu@f4@LA$5|fG5VHUmbgp?<ev0_ls7x-H#>n=C07r)
z$574wF&v7oVKk4(f3ueef_xxnns@?F1g<`*<e`^OX>+Wc%KD{6dDNpgRqjA46T<$q
zQM9=93X+biLR;tlapw`-ALL9`%X_BBLe+&n7k|o9<0>v-3Dp@J9m$^vp#fZrDU%jc
zChtSZ`<n1a+8N+L41z%LOX`Z+|9|X~p6)jFQnB}eMiC_icG$c!QkhaW0v1qFlV4T=
zsZ5!ts27r1@h4({JYVDsL}KS6OJ&LvG!2+T^=n^&@&mYGZ-5&B+Xa#^F6|8l1fzgD
zh7<Jl#H7T~`aP$<G*HPI@`RKu!C`RfOXGjkTI4vRikke1Hd@!Kk<%3Uk~p3T8<CHN
z)4(=K<G+!Bb|E@emG7c7q2t6IK80$_PuUZNuG!88%aFv34R&LH;|v*Q#j&bNTM6Jo
z>WZ2-+xqp)4=;Krba`L&d`uL&qW+q#;2?cz)`UNG<X68I7c86>b^XM42akE^h8Ts@
zPF;<iG2HVLhK-<Qm`*TgqJvWYjuRY((++Js{fglsDwpHgpfsjNTQLDM;$KZ`sTHI#
zo$p`=g?jIxG^TWhq86~Y<qVC^z*QOJ-w__hI(#TQ7bFNG7>Hg85uf{CY->O1wwMwZ
zP|T==w7g!1qK%zyID*-aFct`>2z>BD(~xckLN9ed-#NHP71=MG8QX#m(>*4UEadZ{
zgB_++%HZjq2D7(w4jiz&3pctXz4?FaFfH+!8|`TrmqG+}oH2CzwK@AHdB?1X<>g){
zCb9eJlwz`}9fV-^GujY3W@LRx$v%07ZP;a{1CnV`a@+eHsXkzr<50HK1InKXwn$|l
zQ=ZRx6+AmQu6ApWsuJ<|%W-6+WSW-@SW+%G3(T7Z;>u00RL=tSncIFx{g%r53xHF&
zD<^v+?1A{pAepw=JK@e+Kuj|IW#fos^#`_SQ5{3|g(jaMxD^e4n!KRDRPiLOLU0Qa
z_}lY)YH4vUnq+LzI|RHm)?dOLs~FckjC6ryx}nJ{VwK0GKw6$70}<4hkpWO%-nf*c
z(vE7QqpS|e^zCHwqU>6*7zRPul@t`~{V%q+)r8J=6EBdbJc^W00w!IVYgHwZ(6VLf
zP?h7x)zS{s!7Nm<e1Iq7I0-p|#OCTkrOy4pB88Q<QKab39bof_hYPes#uk*Uyo^?G
z&~hY}C<6b1U2cJ|QMsPP=1n6|8k2Ml_<AqDE1;VnbFVkSimM32PGt8jQy&U-X))G3
z0%AnkA0m6VIW9yrRn%E|@2WVKGWk<2aKZi%7no+7#49m{d!`O`^{cuAl_!E`DYO(t
zf8H{wOCXsoHB^ISJfaw351dK=rn8=U=o+dZR>4l#k{Q~sXNuj{KxA*k^8hE<0YL>O
zVgJh{^G76mdn{n?_Iw_{)<=|f34>V9l8JF-*2GAYB7F@7?NY`kPUSZ|3ZXNhLCU7B
z!^jRyrm>M$Crp`-OX|4f5=y?kXc+l4ciV6P^hd!JS6SP@_kYN*5xo~@=Yqr_3<A+B
z86}GMzgQjHxA^H4>;Yu>B_S?kk77)wP15Kls%Dz<T1Dd8gDQBePp2B#XlqUEmwHlR
z(!pt7h@F}MH1Hz>`+-3$M{Esjl-6A_-z-lYPHwAdS7Ou=x$Bh)0u$w6;=;eLFbE;@
zsDX!)N2f*mB$GfxX^W+Nrk8x@Hco|1O2=8z(ksA$59I}+jrL1a%r#a-_4A_DM4T4v
zT=36)-9$cGyj>l|V4jE?B>m(NFS_%9hL45g8vOILsYNQv)wAWIR*4$ExLSWTb1o+X
z0i}<qYxt1kv6PIUpVwsUt1IvoZOCcWMu8{9h-Us{+rT}wSXWo*Vc>Gld&UjalUGl~
z-PCE=>V<!E2I9GWMqS&NIQP~2)e0K1R}*{ja%?^Va~bjmVbj3qqUqrwSkwdEsOaP}
zZ;^TapLq=bi_rP5QC_kei04(z=y9K{h=E_4?nbJI7Gu8oUF5~t6(BJPgRnOh+v5KJ
zv3c4guG<OS1IB<xiUg#B>pcEl$1f!93;qGu`K3`~U8p6B^tDdF{u_^=IUAWtJZPHK
ziKkC$C9K(~&>0;`EL&W9sbDxCC7tWzLrME@({6{Ku?*k-H$#i87TIzecwC;U8VT)8
ztx!&HTuaw2F1b`No2bhxQNM+d*g;@5NxQq||JDR;PiIyZP9KzJ!Oo4s{Q=&IYmXlg
z5}NMxHmVw9U;IgECSGM5QxP<$cXPhah?2I1Rz87gSamt7t=P9C=XW@2Sa)kv$;f$4
z4j+148g;rU1_8KCX#}#pm_l0|v_WNlTP7Ff1Yv3d3r>nD9qB8Aw#i4w@Any%IZ0F4
z9yiKIMv@BK;4pEIoah_OoH4IWq!AkYM7P>uh$f~5rG!q(NPPBFW6ACmABr02Rx@Sy
z{{%7DE;P?{#qnZ#nk9I1c124JgCOjeDphg+|6|*3CTZ8+fqm;!PAQE@piC%em@qk-
zN{U3)xTK*%zU<5acjbVOWRifgvyooRO7|5LQM#lD%=d2dz2_+a(q&Pqy!*37we#Le
z(dK*w=fd4`@97Eq^n?(~Z=mGfI-KHwlE1~h`RGooN|^i_p6p;<mb)dcIM6IR<<HI;
z=G}ZO9CCyCKVy=NWl6?b6pLl`3eB=;sI2pJGTtaWu|Imb3yO&?Q(`NoOm=xfruxki
z`I@{kPnxk)`^Vt~yiF%&28dIM(AvTox9&?o2v2l_S2w!16(puhj5Me2&cR?eZhowg
zDobNOAD9=EGBVi->XeRRq_&{~`shrFEGczLcNvPIJZn%kORUN+l<D>iX}{SYD>M{^
zXZ8p2#t^7D|EcqNlGWoc7(%7^3DulMSNXXApt7wKb~*%eY(h_&i8QW=*GP1O4f}$6
zb9N;*48tIBC1dcn|6+}za;P|wp$nX_IsTZuLrv_V^190kwfyPq715}1pjL|ay-#*`
zYx4+2n^(~ST0o}r)VmcdrVwYpmlz9F3JAntC0fGM;!4Y$O&&s&1r{S_IYWWq_$Qp`
zHMKaw8y4Wge1Bq{x$$v^Qa9c$)S+I{GGmeikl@A{&3tRcPP9Kba8Jt#bsYuSQ_Tpa
zV@lG-4xzKt&FIz{hc+DZ;WGmShHFo^n;YmEAbwTc5PK&Oxg&9j)1|?$OcV3&85k}$
zdd*U9wI_g(iZjgDzTjOo!6h2*bfj;!$f|?$@|H$$;Iw66jM8@nfUp%5pW_Vcpfe?)
zYKfR!3<_zAIm`m6g;n$ssCvwKZ*3lN*kza`>~B0o0i9QpHdFtkKy4e9)O~9U^uyV;
zB{2+wz$=M}kNaP&nND}fm}DUR>rWXmis&v&&Q5>YCcjmlc8vLn@&qU2(?6QU>{tV4
zDIgLHb%w_zStZugFd&u!nQ);@_+V>`66<^z@JeADf-(L3GX-A>OMBxLTkWsLD+bh3
zAc!K9_d?Ydv&3pmZnxuaOu!3aqL}Gv+Ab#wUU!{jvf^U^z-0yPsTM*74#=%Ic)QZ=
z)wko9H-br+Vs>(~Dw*bJ!a2U8kcB)Zp9wuI#pu4VSaZ0h%B;J4sZlkL-vl1KGxK5w
zo`@-pT8JR_v8KGUm~l#6Q*NzpiN$#X>l^P7zu8b`xFXIe6eKLQ%!<mHBGxnYX3G1U
zDQA*`J6%@*^j!-Z7bn62fXrHMR;Rb6Ol&?%+yY*!V4hSbo@DI!D(4l0-KvVR$S-lJ
z1DJUolKb{G85)x3P2A~TZcKFxcJ7@=yWF7Ag5rC3{cv^#Mh=7^uq7ibnEo64`A=9b
zTxP^?fKfz17MH)>u?)8KM37c<!qCURTvPy>3{#HiJa+IaU4z*ciDzmi;?HX1CZi#W
zkk4XGJo6qJr|jF9f%N9M8z-q$#(r2Mh-q@JkaK9+nIs!kRp2N7x6-<*BCMHdMuhY%
z%j_u=5U8e+6T*aa09Oyy5G6%V*GOz9YSL;3#zez}_*mx>8#5NEXLq_NE4!N`cZU-}
z{^b%gIZ)ymdnN$bYWaiTW88|OGw19jfAYzxX_|Z2!rz%+Zt-P<om=dW67*(tHcmFn
zNFzz)*UT3Q$Se0@*--hQ+B2UZ@XZ+&=otvvyp)|9T2d~FiJhj~Brne%|3jdgOzdQF
z*p3s6l6~hU0^dwMVJIv04C&Cu(RnqfR5=E}gsC@FMV9gy;gqF5&9XydO*bRY?d6)R
z(c_8$II)5n{;i)6i(2zuJ^tbBTCf;|LD-erT9DoUV)JPeW_1I10P}#RKOyuARc|8Y
zR_TMOM^WYt)Cm7FKtrhc(6V{j{+cn=WPV27&t&p|2_~156z==xzx*;b>G#?9km$&A
zo}l`?a_*oZlzlrWGEBRlA<ipfQi@URV2i50RXYFtf>359Hi}u!)_50k{XaGB62G`B
z$Z~eJcSYrdF4d_SpQ4cDY?O!^>!+>o{uy`75Q;I4MT=Ir=~35NV(GXb$9a^^RJb|Y
zlmNmDE08KQioG`^E(Vf_6E2@<oYJVO-oEFKUK2<*BO!s?D0ti<Lm<2*bof;1(_s_)
z4aK=KEo_^D#y4G2wYZAU;FtzV877;ZSalXK<gu(nk>^B>xC?_QSx6|16j@I9Z46i&
z1BRiK7^=?^-=m9loL!4b!YVlz<c~u9$65m|r1<)i;tB6aaXz^0N;STMxzq%mjB#3K
zqqZIF&Dj|sF$jY|@JmQ4#{Yk;(^eL1IzsvZhFmVhfE?b|C03x*O^RhMonc<)yk(}n
z)J#)LSB}5=?2O`<!vf|g)^>^byEC1WI#>Q4HpYCqIG37@=Wgw}A!oTUd6dz2!e~b+
z96c{}9u9miytt?K8K4ZH_N!N>(UQ3pyyE$36olk4c%{7n70*w4B9QjArlcWqMIWOv
z6H|wOUkiNumzh$CPWG1WRiWHb&^I)?GbMVWqNZ<CPAR5%smEx)sSS)S%@b4t>I(}j
zn0j2GI&+;CJFx;(>kp^&Kd6`s$4QQmz^6u@m^3eas_&j!kW*)1>O;T_^?}pc^3bXK
zElh19;58ZJ)L^M}j2rR%@F|3f0DN2Xu6Xm(CjwusBl_2RTnvT9wSfcuFAktn+ZX+@
zcWr`~Ui{q1lOheZo?uE1JvqA;911}gb|o@c)%#!UB~RKZm<&CD%Z42cx(}*i7OuA|
z(15>LrEL@xNg~j*PoCxnjriPjP^l`-y}f}z2RM88*da{Dq|k-)fVAf<=Q`6m$F?}n
zeP^T@LyaRGUr@;I3Uzx<%OX(8cS=&8>TcAEKTM8Z(5MZjb&LK^V!9{h1*st6X&gat
z`D?%%mDJ~o#>I_H{X=V>wE~fyM;yHP2Bdwk?fWVn4>RdaqC|TmN2O{vL)5cY3!(&Y
zjXhG^kD^I}HGhVL&j^nIMQz6OcKYxM;l7W~3tQN6Np~`XH42+TA6pRPcQO5Q>*nyu
zK92*)bjGGsC(kYU@Ia8}RHtO!RZum!pyoLN5Xsq!284-Pj{R-LPh8I_bwXr|ejN*c
z4b#@$CeJN-r8LNJQVz?9?2xPF1*ssv$-FLNXxrWhsRI!G6Mjx!^GDek<v<LAK=evo
zOx3;r#kNV8H>QmN{`y5w5Gw<NbTKD0v#+#Ch&gvr_KF=66uS@2ns^W8T(BW!qBWhG
z2YBC5v>pYAW<sYl@*{Qt*2dG|I%wu=Wx9w`g1|DtkGZX<ofSc!?H&~my<?dgL%XOX
z^T%<TPE9zTy_%OK`m~mi!z+?Rtbo3f`5~Bv7X6-|ac>g%P9kwO`r~z^2gFg*Xzb)v
zt>&IRO=~lX@r^JNM<YiuaR7s7q2>S(%TnPq9W1O$0^8{@QQ`sogv2!@ePNaLV?w`C
zYhXl)?3+kspDMN4bPvUUSiqN%EU-y7DoZ<ea<oU+SA4;WO%}5?-XfFyPfJJ|+vuiZ
ztBf3+yB$xnEh<^e_SdK8RymQZ58ODRF|-(#?eu59Z^^}M@!AAi>f9=DlhjD$$o{D1
zkF#^hVGxFa=#^+~aJc`)iYoF35g|M5x*Da9;}Cyl9(=patcl3&Fx!s4olj<NR4oBo
zUIO9V3MKnHq^%GE{+3UX(A(s_)``!LU!+|3!p@QCX7a_Hi^+8{<@W&WvFHz~2itif
z=lvN0cWg7}bJb(sFjRh_1Y(=aX{#wlP1w0;Qb=lZu=sKKm%7CR>evOTu`swFOib*N
zLlM9EJTcjcG?}kC5=rh}w><akdjd@C9tE8~y(Ux5u1d19_y2cdmXYM<{_N&8sL{>)
zH;Nk4@&=9gkSXC=s`qWj$y*^pGMng`=vsl`rf^nNvb-ESe`O;?Hk;WUYSIS~*>rM&
z66v55qG0ZIhy>A_eGm{W2mpojHOVGvTA{N*hUb%60fj6qK+VW<(<@+=HMJYkbxk{y
z`gt-qRIO~3adr+$xA=o&{zyB6EQvu7h@Pnj6}kV#W@h29jwTQ7-epw}u>=iDU7--y
z97QU7Q|To1_8jN6;I!FGdq9KW)C8Nh1V<K$-hK9WGj7%Fa6sK;gW?MvZUwb7btr3g
z`+Dly%>Ze;!z<0=8&D3^4a<Z5Q*1!>H3!FM;~O!Yr!<`tlmcBYYvc%PVp7vlEDpwo
ztY%Rv_m8}UswPN9;w&dPHb;U7X6E6^L~=Hnx~ZiqTwWA#BsD1t@Z{U7(q_I|c&8~K
z-Q<rW4#05sJN#<!6P$ki6<ed%xhl~9<z-W#crr*M`}@j+6LOj=#IFfzE6hnxv)*|7
zWZsa|T$ZlaQLXGhb;BfkVv>bo$p#K}crJPsn<?ovZ|Uhp0em2lpE&fieC3w5OxtSF
zp0g!WvRI@JUOdzO<?ITO7zAP1mvlx7|Nq!_+md)VNAUwWTT6kYw10qV4^(afDYhL*
z>n$WHm43>j?g4XNqEHF)F|cakHx7yW+^$lprd!zV^rn<M7UF_RB}~dUBdJMUVgsjC
zDWuI6txKCSkIlg;U4YUB%v@)1$_a;4-z=rH1WsIij}6NKu`M{sMi)L*U<Ro5%-&IN
zK%PktN|nF=nmF0<OT3_1iFoMhTtw_>%KAQ*_d)|Rx#YA^pr#L*1gB}4r#;{hNEsYl
zE|Pumo7D`GQa8>KP-eVcI-q05odQyDJ5k<5;<==7om9=RtEGC%K*CMV-i)QyX^HJ<
zBGK$HC|`m!3^rwNm%@(Kl%RYG4TVy31vRXFLk@v7)PXTTe*a~z_LGt@P2ufoLyh5C
zxp;G4LhtbJw|vYKg_bzPQ^B-(q<6vBp-;}PAc<iR1b(Sj6#W0k>Ll4^nl=G*%V`IR
zA}k;iF`=gZgEJ^lSpmWh2Qe?61|v0;0)qMWCR3Iz7S`jW)IH9&ass%m^b0&zH!_%C
zX4jrUUHT{5ln!d#qo_<_T4Q8^IBqUfsPkA;Rx=xO0}Y{Q#T|((ajPprwOgT<*4MAk
z@G2Dcx#5jx71R!>3}+l;Q*L&ts#T%J>3Vs*(Z}od%y{4v2fjWP)5poa<!oG1){cFc
zV6B9slNF6X6EZ$COlYFZ)LxC3C*C}?o>3H7l!CFe^9%f5ajGE^9U!O4)on{T^u(Iq
z6cVgC-f)si@<WWJl?gp51{CvU49;2YRhfv4s|XZ1P4U*(#v1!JR(_uQD-PwiRVP&V
z_Y6tReZb!4`LsVWC4lI!(6IxrE_)^ajx=H<lv{x>7KR7~^9<%!je(9m{-NwjkQjtP
z;Fn57CIA0eomO@;X)N%8ofQdzaH;23)ZZJ_cC9dSQ;r3z4dd+DAT06daeE<akKpcb
zzphHkRUC;rRN3C5Pb0Y{R~k)&#9x)qvk6JZ+r=tKeNuvz$d4_K?#vUK;6$WR;t5V7
zvl_7BTtq6I+9M|-eY8D9LeUlWV+cCRa9nbvbpCmYvMcEoPW#m3Pawlvf93#tPII9I
z)o=5vLfo4QryN;7iQAveQ<?y}M-6-_aq^4BNbaf#Z1_Ptrv;=&S7rN0DqfatO(s$|
zm3C7pAhjonUq1}}^l?FgwZ+7UpD_;?W&+6-oUi>S&o4Z>IN~tRX^u#E?mZcrB{;z$
zXSSW4cUa*jJwXa<GCiJh_d<tL7vJQ~W*qDSgOqYW{ZUH0$XSpQ@|nh7diJOeQd*LF
zlXf;(4#FT1zEXoE;{7jH>)ZKo?e-D72XJ0~kU%CdzoBH|!#*SRmpDO*l-Gt5B0%h{
zH{%kce(@TRnk~J!@dq0(CF<51AyU&-0`Hlg2ddO{xEi7~JMvrmR7lXXTmQ_MhFabQ
zjc9@=0AY8aWaNXU5jxBfgIel`bCHsn8x2Sp5J!2`huwmaub-XDVGb3NXiX<e)XuG4
zY1GutiPb#KO%nH+w@$2)IL$OAB^ftylF~FzmGRY&;>0MLS{`)9nK|K697WiNQu6gX
zAcf&s4w(B-!Ah&k0RvXk<xhOe==lUyJ2~;1o;8^Ayw275jx@30GViQ;{d0QtnEK<g
zP!6$8HO2v10=4Tp<(Pg}Y#NG3DJ$uih>g2YNFHz3K`lXB>=`>a^_(S|(~2W%u+;Ct
z0%CJS|EEET+cdS;Had+4kyEP`=7LJhH=yHl)tF99F5avlP;+a@f3!Uad2)7UNeqM_
z5Iqy46XE_BOFqKulrssM3s5dBVnb7knsvNqecD_2s<D7>ei)10=y-kJpqn9L2ND(r
zC|cbr=nrNeCm@wGJ9->Ddux-NyA>^|zytkeeiOO`m$}u$2wdnU4CF>%j^)sf(Q2&4
z6W{Eir<{~2c6K*@8r|4Aa-T(=%r4#)6_?m@@91h#iEw@>)bW?ufpCgWj&=&8gT?AO
z84ko51kQFf;00rWYS!gbM3Z)Gr~zcNLGGiERppvBc;^6|c}zVng4Rw6+Hi_zBTLQm
ztJmEYG+=xSP_G*#s?=otK4^asnKGIEMxX=V44eI~baLt1Aep_ch}gU2n*cY(KGkl{
zsJ?!In<~9<y$4P<x3DJhSdoQMsH_<`HLb6EpCq01vAb#l>#ierp5df(ZThoVlfyTP
zTxAwsoKMcK0J&ipgng;RCWZfhth+6ewzxg;KET-+2tf!owe-Bb9FMg7a@xJdhnxSC
zly`NTx=PYE^aNDX#TsM-y^(BSHQO`NZb4uKmw^rS-!&>Sz%;J|eA}g39<?y3b3Ir%
zS3@3pJAN-m<4iDcg1_Q>25aG?PUZn={!(}{MVYK#Htdo#%>evxeUkp<&gW<pQMf`A
zbAerOw2YvmCen~e%P|1bUuWXaO5OJwnM+ov{XKnaN-od@&%h_6<&>*LEyzCK&21<r
zJZe#FpgmTzjK0$)5KTu#)m0)&vc;YaLFx{VH-R8`&cr$)NjY3JdO7ls`;J=Fd4D@D
zLUyjH3#*4e<YP%u<iDh?v~GtWekh2?8VNd*vSUvzQRHYwKHjMO+)z0%O(*sXtnQrb
zOqul`R07gm{cZ&32U$HRK7nXDH*9c_x(KKZ{{@`s^TpX2B{2wtK=ewj#Tf2?vHB4n
zj@4%I0No*Ep~PeXoZu3VpM@vOPE*-mdq^l65bTZ&XJi2{0io=PuLJuIg}Bxb*D7&B
zL)nxvJ1^%@$4mPk`I}js?ZZ$adu4SwH;M_G`5wWZ8AU%?q=zXLbEaU=MT|~2*_5<X
zqSWGqX0p+g<j8`I6TwUHo6O|PGo<y_-_^wh#Z#E$d?Y%&5EhUkfpdOp8FkdoChS~?
zmn*@NTbI?P0F@Nq{zA>Gl(^8maMWH=ybF$s`^?=a$EZx<y<!wcO(qgy)ehew!aVtM
zp_zS-ofBg8Uel0Fak>Vz-X-9MLZ{hFa8x^m-f;dheqS(YJ0l(bT)YC*?|`anyCQje
zv^XYdLd{X7E~82vSDFIL?TY1U6n{Cpq9uf35cW%BYjFJkkGVUSuv?w9zWHJfX{0Ss
za)V+h&rAWEjlHFoN!_*_tZRaq8R$_=<dcC~!y;JK1k2;tQ@ubAA20|V4v#!iJ+%5A
zdPqdGx5x4c!w3-R&3r1dY!opA#EWJ~G_RSO&0SKeb!IMD(bW2%n5&rZF{(zw@(YQV
z)@B1pq&El5X}3GRzRm!V+?saILG_T6*1A<Hp!m&GijrVgY7ZFH9{+8#KEmCk{ZEs`
z?oG?K{D;KmaNaUKE49!$)dt+1^w!N6$pER2)EyFmcnV71Owqf}@&}8V{f|4X+)gV?
zAR`c)e-ycM`yOzTgflyw^!D)yHPF@*Ad#kgbZ58cRypTvd?A2$HrZZp0xV^^MtZWD
z`{j!!5ezU%vY9=TF6%acv(q3QzzrR@y%whoRxv&E;7ET%NVomu&DpsiHw=S7^h%NJ
z2)O^nnl|2t>trI73+x!Y0`U>NK{8CYCV$+vH{_mQmsG?A=xmjifM9o$@=K)cqNRWI
zPO~(>DyfJ$G#PLUbpzWzG9NeRfQpzyiTS~!$Y}ctkh0*>*tf`vpS{Hj6l(;t=~CX(
zyEBm23v|MM>lw{G7{?j(6E-h=RRBdR0xNLVpj6B}DScd({$Rx1q&T;4qVaFV^L|zO
zZrSNNa&+3<8t_&#v}q*i`6t#v^j?4>$h?!o)(y<Yjd69AuM*RF;FI!sB+@+Qp{8kc
zBUsLxWH4thL}G5Q%{zqSII2Q{JRD;#PEn>=ln$P=VC$LJ?r{Gp-Q3_sZiYQ9-f?{U
zaeNhL&c%y%vBIan7oO~#n}p~uic+!xYwiVw$48bc*;_g=%%1J(i97yN{X{leK{~N~
z!&}kNy{n_w#{9)@1ij&StCp^T;@Bu48JbFW^$YOB*|{Jg41+-QO6Fry?td|(b{}Kw
z2=xLxkP=D)yQw>XpyD5&`kF&Im{+<!Y)SyBVo~#8U;7vN%qK8I=I^SG)bpWB-b`!*
zhnhW91zAw#M6=~-ohvlkg#;a$TNw^_!`I1TpmqRqLhC@sVH=h(iC4bM4-)aJ84~NH
zAZO<l<c#T)Z_gX45J^YQBCUfLr}n@i&iOZ?TPv{?7kSjBTF$>CA$d4~ztSFw!+ar;
z%o|0EkBKX9F8CTk(c3i1UM&AeQiw>`8C!(}t+m@vt9lGov5GY1#gvbjZ3(MXp7WZ7
zA;@A3t)~1_c`n(D!Ly6Sr;S5)<N~^%OhQZCG>MrrN!i@%sOg)J6LE|49ZgQ+z(3yA
zIG{SOo;sOQ(Y)I1Bi?=9<(wQr=llz*o&wziVS(C(=v13?-1)CJPT1(&_ZBBA`kZeA
z3LE7O#eH2*_y?zLdMwx(D&t>2M3sNPJ-*uhA-*C#IJ*KIh(QqcrYR!(|Hm%5t*!Ac
zL-zp!j3HVIqonre^s=Lr|2kcHN}(RPBs?R6i{xD{FRZEaKnK?8Tr>-EoRcHD^yyHw
zaE&g<{q0!>n9~7sI!Cl^DI}1SE5!^)ad*8T9eD%*<aDn2M#F;-_m>6J>U_A|*?UUA
zv0xp-+ba7xI6>IZB>1&66~#=BpyZ-6KX)7sJ_L4wnX&*nFuIooL5OXk?>rCqaA1}f
zD*!khBaN?ZN-qQ<xG|;AF8Jk=ggUyk+&18wj$5^}zt=(mkk>pwH>px38}U}I-pZwt
z5Z!!`4!OJR*oG>FUFR0%k4g*1aZ-L~L9PaNc8f2GLUa#Y%a?v4Ym+SSuIb2qM<=p2
zMM4sdCF+jPWBPdVc|DD|Yvcu;Sexi!r=aL<!#a^R`S7PR+<4DF^2%ahZHg$}=l`y)
zRL}r9$B*|U>BHHzU@;7Wuq&xUEcd_Iz6q^e2krpnQ5&$3pg%0(nn6%Xqp;3*p_#;Z
z0?kQe{*Ce8r@%X;Ct1KacuwU+>KBanXYm+X8XRV-UogJp)OH!di-8BCQ#s>oE*5sN
ze_|`wauqG=Ni)8dQH!$R6kjJtCiQO?BU9Vt(<g8nLomBeU^|t=QSafjV=@p)SdwYQ
z)#_|0x8RhF^9+A+*|D$@+2Y+CZ0A73b`<vQ8~>dXeHE~sqp${cDb{8Sxqy5pRCI&l
zTo+Sj?AVl?Zsy%J^Qt^9Rls(hJ@Qw3nG6lpOP6%F*JWJ7j|vW%QL{Po_IS2J3s0pr
z>R@*tjw2|UT@!RCA<!!?DiL9k(GpJeA7FB=cjonUYRxElsU4W&?H6R{+0NtfZN(7K
z&7+dpsMRHh*fR8C537HDH}agsQa@nn&e@e1F${ySm5kr8|6=Xckw~2O3|&BnRfSLl
zv72o8oL$)*;Ba;jDLbU}Np)K!lqlHMnimhvkodzns!Q`YZEK)0CJes4<?SFG^3Eo2
z_G7d}f<pR+n@_uKWQpLgTgdCit|3`n;ea~Ukl;tn*ro*b84d>L^JvDA3kdcm4UHit
z?-l`)MM@`IH!b;)*d|oALAC!yx0Xdq%|5+eTMDQW_U09dEdq@^D!f}$d4Cd_IuBaT
zgKnXazm=^^Yk<U%P@rIOWMGMK@PkFQ?JG-qn|eIoydx5jWpFllZHd9`mF*ovT@oe!
zU?~=qBw0?!>7WzR4a7cSvvk>5T5{NI`$3;Bsr)ADrc4J>(0FC$<v49l{6C%@=Ua35
zfSVkWlbE%s<I4jq5hz<r=K3~=CTb&3-NDmwNl-7&t^fyO5QKecx>?-+KX#W(T8wT7
z+Xotk6_B#<&*deCVjQPhZoA(X7SA=DUPPg?X`BTxtq2;LSK)sLDAYAgtJFjS1IIYN
zkDeAIu}tAifgPTs9(~(B9~}<Y4B*8@kD=Hv^kzfVSiLrm{g@F#wG0#zT6rm$k}wXa
zBkqN7f|?XIO`{Ip;BlK$NPR`x-XWd0NCP+P79-WQSn03aROezvx5Wcp4yZ15Sec30
zk+>`rG!0HBH7y`fB<>Rx>Y3(xyY@NMP0<%I!>MN)pFT!b+TiU34rZKY8h_OBCwydg
z_V|b8fXHo1kmheXEzd{+oooB6%`LfJ5`l?g=JlyTHpRJ@a;645TiyJYbTKIoOH?zj
zZIV=rgiZUL<_?c<cmhOnbE;^_m)tj$^HRILZ_mE%!`T&OF$lu2GoeV!{Vz86T#`Le
zTm17YuXM3wq|^d8Qz30HLn6IZC+j;Te<~(Z`9|%=NwK+Pg)~#l?@E3Hh$C@1MXi0u
z7=}P+djA4hNc40_pf_x2gAHx+d^0%f8HbaMUF9uSUhp!<c(kw_5V#F9%uI}IGeEo#
zvDuhxv{73|e#6PU{Mq;!h^53;2}b5M(iD~Y=`|s_jpO(-IJ~NPEacE{G&0#W+13OU
z*u7m86Q9TuY)k>!OCYjaRmt8V)nQ{Q+6DSdmVN|xI0Y`@tsAXzZ(@Oq>H1H|FA`Lf
z>Z&o4-G#LFMvYq%YXiMur#S2s*O`1~Y5fjIIoh9MAQ+fqH8CB-#NBa4{$(4Iy+5&W
zz+%}2|I*>hxqLY^Z~B_pC}CfY+uMJ#A8|gMoePr0AP7XS6i5_u|BLM>@|bdJSDXuU
z0TN=_4Lms4lt&|bo;>0?=PX3K{g;t_$ELWKghJBtDefgB3(>Y2$UX!jwJ9b2_zdYT
ze7C=mUm*p1>8#W=K?rPlgD)Uue&Zg4LNy5oTmN@0``FT|%<#O!7obLlGuMy7${w9G
zHSez3yN+Vol<Ix8b*W_LEZ%*e9$myI1pQh9DnVen(!RvLjhl81?S(kO@vsEs6^bPw
zg~}TwrpGIVv$#WZF-gUydye@CnG&*UMg@!cZqw%Bx%_R@NYZmyw}jFes<DBor(C)c
za(GOhiJ1tr`Mm^@36ilL*_nM;0*XSOG-l`CMEjDiRjv{=CaW-;#z3IaXZ#bUCIzIZ
z<bjlBW!F3B8)oVx!>sp;T~L{F9O!kj-4BUWU#o8=$V@q63iSYepkOf8awG{l(@%~M
zVbhHsNmai%yAm9RVG#BvAWiB2KenlhO~<rB_W=u#+i+7Ok>)!y>P!-;(iN+Vkb-ii
zWBbBVGz-;08fh@{X%xH*+=AzgE=P%BO*}9LAPbh)4-9IVE|TXf=is5wQ8$1IuWE)w
zj1M)8)KJZnk*3W&sM(W<Cz3B?_ne_oMl4$Xe-*{dm!B)dd>=#AI^(D)W_pbNdblez
zc-@estY+HC+MSZzK(Zv$lH?CNWrELv6|}qh(I>ca1+7}_ect#?F$6jq>Ve}3$~~g{
zpm^OXr%}wj$V9i5>zc>WP%n1SZiHg8ko&(|>cK0I1ST6)m3J;W`k|WXgNDNW;O!QU
zeBdCMj?{%UaP*rzp;!;d5(Dh;nJLgi;u3Lub(4eEGe(gcb$^v#48Kxfuc6S9!qXHd
z3D<idJk8jViXOQKG3osx%s-Vbq2Q6DQp*eOOHNzTl|W!PIwX8NIJ*KQ31JZSB{!f;
z|NpVuxod*sxeMI~m{FQW3lehIDT7siMnf*Nce`#)R9MT@uA7vEFuS`YeP~lO^T)z8
z)*SWA1$McqV7foD{?Nhk8)_<Pq|pl<YRZTf>iInjowBrhBT&+D|G-SI%f4VqGh~rG
zLdwFU@Qa#{8Y$jUGl70dS^|mV;L?q+fLPKD`NEhygk60dsK4vMlIFn-RL}=2M_sgV
zDC6qwF}|QoGfH;Ui3g}b)3QN?I_LQ>7_1Q{<_>w{^o^NX-{h%Q&kQ}ln&#>8hVpA;
z>7FR#PxV9UoRP|VG=QG(fMyc!uluD|InzWo^$ZTvfm2rL@CFnK&N@V#IxAOb>DvWp
zUXMv4BGoI$qGqT^bC~=PH8cZmH4-jc<qoN}bS!IXG|&t)W|$X{{JM5CJec8G2>Gsk
zhmSFDKpp=?W&eUtKb&0w62l+}`x2$1^8b%*w>F`t>tXwWoFbwUh+iPYaCV(Js{ysJ
zoTTKpf)Ju*9!n`suWXIhysJ*ZZF1wC8}~>W^#`kG^z!hieF_F9xy5Z83>Cj!5NOFx
z?9mj7KW1=YHK`9`Cg@H6c0lQUDv6tx{266s!U-R+CqM||_>nEN&E5MGpn7|*G}gYa
z*$A&qCk0rINgiZEdXojH{%7UdxN_BG!7usR1mlW2)sAABYLXx2l~O67rNU6A=v-(E
zrTq$uGbHXEoZE@HI=LEOLQo|`?3JDBKG`XN`g-<QNpgl~8ny}twD5>xgQik$-K4!6
z(wG{jM)v8U$L%=}mz1Nuj%l*@4>X19gT3F+?(}d<&K04)n?#h$`{R`?CtRGO)S*f3
zIj5}PI2~FdzB9_jrpvh>1;a^EMN>Y>Z40D4%z@yfI4T7UePaO6EAbTs=LILGCig%e
z&aME7VGx9U$s$_$|HrnwnK0{Cu@5N6K}tM=I2$T3q%c&Ow7g@e{!Ra>YCGvCy8T`y
zRqo;&Zq|#Xgs*BEr_^{MvSkQA?F<|TAa4#{=_9WwZ%(8+plJ<o$eX?ZIAOG;M?Z?o
z#tQCznM#QJ7R&Ygv_ReLz6?m{|4rB{_EWgl?HdVOrhs$Iy>dgs`*Zff)*B-Q`sRRx
za>YR`eI4k0$Uze~$Zkoc0)dmvq6t;JLqF`3MM55eIrL4#O*Rv!I~0T*IMEql4nDy3
zQ4{BbH3pz<vP8LNS11CPfbaullVH+xq({sGWpkz|%WcO_ne2d9vhzwHM0HJ>F+;#M
z`u*&GX!7ykh#^0N+mB%Lz^j2E*<IQ^OiN1{x~4%GF|M2Zl+9qV%;~susl_pwlU)Bc
zG%bt|bQXDWc5O=(f*|mhRKn!{f9y0Bi-)EGd+TW@aa%|(CUDTcW)tsF=fVvK&piQ!
zAcY^Xg%wd}%*`H%J_3Q><}l?O((X3ywwHG(2`dfd5&|cbC>6U9Al7aw&~8k&z-_jj
ztxvayXBJe8d#O7xxENj*UP_aiThT1Jt&bbpArn(zNb{PaZOG_25&L>$$3&XeoN!F!
zWCchGuAzXi@v^P}@hb;T%Pg3?KX|Ee+~I2nyspGZ%5Xh#M8U=0ae)%Wjah_?H5+De
zGG?uF8!NQ*3XYQ8sUkNayPD9vN+svDiI#AU#FQ&))#=IPE<3{0xV(j0%X}p{D9Wfn
z4r&XdigPPN97HF(^G$#5GTwhpWs3f#eBFPq-e}5^NdOW!<1JjeDV|=KNjC=f=rG>n
zsRAlCHi6raZrm5zew<wk7Q-M2yHYDE_5K%I-_|63b{%vV$WuT>!$;%c)&vr)+p#+&
z74mh`N{{_Eh|Cj?PDy<N1jmis#NqO{?FmqwWK<V+wyBz~osm(yyGy(ycVJ6UhQ>jf
z1u5OT-uduilkb!T_}#U{dvZsNt=qOa%0-DE2i?3^8{!N)w?2!zeLgeo*klC7IhsGu
zNe&9uji%Md^8Q#9<C1=fC;IjT$Yz0qe`cS<l)!79!iiJOp=zoVmc%KVg>@8-Stw1#
z4{>d-fxsNf3wQp&n0#eocRnH2rRep=w~obb01V~;4Mr-I<W&x5TyWqhMa#vRUk38>
zx*lyT2L#*352MmOmh}-3;}Uj~Dk>9lMelJK2=4N$+MNC*u3)uR=g1UQ4`WFEafA!<
zlDB}4+e!Ti9GJEj;24fABkqJ5HNQO~l67uHFl>xwfc{^con4m0AP9xGB#@}t|Hh`L
zBOi_P1MOR1$`Jxr<O;gc%cj0|LE|$)9oJ?H(Ds=m`433m`EE{IUKcrc?6@)7y$~kd
zw!rPYIX!x`RF6DLoVJvvP|i$u*C+}fg+-mjZrGfCAQ~|8%BeYXDUGM<zTb~{em<jc
zl21D|=PsprF-J%Sme8^&+Iqah<nil=f)862oQf1h$p$n$oq}cFqiN1wuD=Nu(xsNK
zDtCrK?ZoIX@YH#>gV)>&M>(f3g;hz5i?<F_rxpBa*uJW#i9K#O&*hzP28{_S#0Q*#
z!AC(7naZGS$&>c4!CVm4ceh&3q-bi({;4Ps{rts2`#bv09Tx(uZn%(#jWd~|=x08c
z=Cp&0ANfR9b0*W&>EmN6&9Q?rXg>VXoXeD^oXLU~jgi9zT$thOpp{Wljk{YT51Sw}
z{e-^++`~rm&Ow_XyYr&LoSWOK3ZhOF1VdlY%Ko<17injL+dvFL(JOhu40HdBb)=X_
z>$HNl2guhzFkT<LOOe@WUpP9qwHCop@D;%xo9f6gab}#SP_vVa3<yydg%nrLWlX=%
zgp7QCMXgY0EY0$=cQbI!#dIp+DQ26Tr<j3j4*&b&b#QF0^NRM<uQV~w<~R|{lAnMz
z=?^!812-Unil5{pWTjC`5trAb)+x0G2H5S~tZXW!hohcMtS8o5^Armh$Ez*{*3%#}
z?!rge8B)FZPJIVgIiz-+4?kj+PlT+GJ<VqaX%XhsJ1~avO+rX}B|lQ6^kx4WG15rs
z0!-|OT3fy>MM@W*UHI}vnglOUkdpVWa@c);-)kUiF13C(Fnm>$(r*%#oKaPiy71LF
zrIe1lSD~Grw21ZF4fMnN-jro={sc!Fi*-6_(W3eZ0i|d~I@3t!Jki)q-tA8Y_P1#N
zV&M9Pft`*JaR*O{)upWa^LN!ki_Mq72WMx1<1h>Y!7l|2HU9s{uF@St<+d`p4@53m
zuQ$cZ3J*|ttI1ZD-Oeg|)yj3%soYo<YMqcEEhpJ3zG~F!@uBPtrw)Yw*@a*--@))s
zeLXOM_5s?h-XLQl&I9HR7iabbV)9+{pr?QKPFuM+S7{;Nw@oxgTA9jzNE9zPhIMa*
z%~*CmMe~1nQM%~D1lUH@h-K&VM0}l95wq!Q-+|9!>y2%rAF%$<ZKH+tx$A{LUhPs$
zc0eWads2eydDzyYF%R0bm>oHb#=coA+Mwm4#?$N0A>n6;4s?taL<xXYT5}CaG(dZf
zE0^D7qx+kA==Vpt67}NedqbAZ(3qHU$)H*l8guSq8=lU|*JNIYkSn+Z-k_L)ikXlx
z<JT+@L=7kmuuklk5#Xq+R@EpvD#i;{RrEzx)0x*td|#DaZg*D2Bq3&1zWzYJQFbe=
zuU$Mou>>#7>xZ;!!GaJ3fmbpC)B9g+du`6_Y6b0HU>=`=Fadq2el+cO^;i*o>>qrO
z!1`H1!StF(^~leddV-0}0{_WxmeO0JlU06#QE<H>Z1C`laDJ);q$*cN-z=3LM6%*+
z%DLk?DeUZbq3WCzXmdugUsh?Gn9y1tp+fo@h+grVo=d(taOltbtBpiIO#N<|w<ki8
z=@_J|ZStQ*pk&nV0R4iB>4$0^@6StO1&Upf{;~$O8>TA`-#feug{<Cd&;v9BG#WIv
zo<L<l8Kep*Sg)mGD94~c_J(4pp$5e-fd~}d;{5brhE#&%h#$-a6%4Om(GntfNJRXH
zL=>~0l6at8M_z5kke?U|>vcVmN*;W+cx~FszfyI!FTGo7S=a!-vfA@wuwR>MVqfp9
zV9bMHyMdynCoy>M!53%Of`u>)!md;XmG1r*bACvs+k|?7JfK;qrnFBevYlo3|De|I
zvXi2d8;`I}Mc@mIu$^M-pL^&QwkcPzD_#`f3Kk~74Yuh?RMv3j^bubQrGOGZh4cvr
z$0`Zhuioqvz03P`P^@~_{B;p?T))5af$YQHabrcHRDLa@l=iJug{Uw-gnPWfg|3aY
z%71XdH<cK%p)j~dml&Fl-rH!`9rc3?d4l6W_BX{}WY-C~qHh|<SVY85$exSn&;!)2
z4bDLs5`<jc+J8{JA`H)}rBJbv5rr^tD2ab(=Z9-7eABKCCx0EiD?DZ|3@ICo(-XPc
zprFU2KvA%rvr;%muDltbkRY5>QHYE}`SdmeCEsMAUhT_XNN`<FqFN9Y_mBC9v+8w%
ztW^yPY=<{2$`5Cmf$GN<ymNMLR}6zN3|)zrgR}o){b{dq8UiK@=m;YegJaMP((M+w
zuC1M@-B>v43jP&hdk>@xlus||RmJ+$RuY-PiQ2Eaia^QRN7mQkv9gr@!~PBS_8PR5
z@2u)eR#LlMw7!F?(*btGP}WeWox}gE7CQZe?*UdekSIk#SJKzkP&c)IxfFCCW`){G
z+p}SPcI-g;01CgNIlHbONwIW3v(f-VP#Lvz_@A{eId)j7Q}m$f>2yKzQc7N1pXD;0
zL8;x=P^i7*SDl{W%Vr_~)uyaSYdrvEgU<xDJa0Qt%49|+(|2OkpV#2-0R7I&Ub2$f
zWqrphsFJ28vlI4$+B+K)UPZ6Ej$(abyKxh4EfjX01k(K?(GO==fW#mO!@i`@QvLtO
z=4P8Rlq>LooWzg{jSxcF&!gE_6RS{AyRA|c^cI7a2_7gDiQ74-tR;ZnT$LEAyg;QF
z+6SP}Rw{@$$+kAYqyJQePd6Efp`dnww+qUIxFN?-Xrb0n+|oV<g)bR_Ux`oWV+Ja<
zx^mi87Q;}kcI>bsvYHb*FLBn5t%pjuWt(<%gUCYhzx&BTC~loW???NegCn}i*nq_S
zH?>49r!jB{4`=sw^wV+F@+8zl?X@#Z%|UCT)^BjpMXiadr!0TlIK^V|bZ#z&0jRy@
zsxDr#O>jl29pE(>h~e~=SIiY53U(mV;^B%ZlOgICFBR)B?fhH<NLhO-sNGCPC6G|Y
zvVw+C(%04O0HJp5^|>=-j~>UF2u3G$_w9B++QBZ;xVY;2)rYe)OL7>5f#{WjiCFG`
zv2g|KwG(Gba{m0)g{U?Xv=*RHQopQf-#^?$oOWdf+fmO7nqHBnmoU(!)cNpAYA<V;
z%y`NCfas`SmZUwmx+RvRFox(+PEhSMVr9w9{&#|M%{eGh-9DLcT2-+G6bJj{S$pbP
zn?`Ldu~*~MHS1q~V?tt87pflwUsN}!9+ROdjNvraTl9(QaZKCF6{`OTMHnL$?pLUq
zITl{K7D6%A*>ikHb$2tm$F!rzYJ#DouCW-)KyJGv;AIXg%1_Tw99BdAG<Jfnqdq&`
zDLdUMhjPK<6iP!!-I&Jt7^DTxamPRpV`zEXn)e3Yzi@(yR}__>lEhrS_-%)(Hw;wy
zsi3GCU7+ibNkED1^|I}&K}<bN4WX#tAV*XN7K+1KtnQlYs3L=)`bM68NnGa{6H4aQ
zlgu5f_13CjJFmV>96gMFvArgsxS}3IAO0viqb!F(5Q=Uoh+5tM#>SJ%B~4}q`j@YF
z(1KOqJ<Ps>eQ78PsY4%7ufwfM{DSl04Aif`gc`>$3xv$We2hfHVxy2+OpaCFT%mG)
zak+{`ftnRkcf1MSRJJ$ST&V<<a>($mL};)d{0~Z;)~1kJoMAi2WYS!wnt*a|=Uqwn
zoT_ho95@tG--G!+JbiUolVA8Zos&*!3CAb}2|>D)9AjfNNHe;-1qA67q+!U0bho5*
zC__S81d#zEp!B=%@Atm%|If9Z=UnG{&VApXYP}gm6U|dfooq0uFN_Hk*YqSF0j8BC
z6)GM*c`<Gu^;?%j-J+(TOoQ&11-A^}=TtrA9^>H}>QZ>}Rl;(XoTe#Q&{OK95kysR
zk;b$*xhGfrtU;;A@XIgc`vpH83GkUm&Q-XdfXU&MbCvzI>f0l_Vz|+Bi<F<D<M!`1
z88n3lXFsHw*3gIjH81{V%$1lgbMYZ%-^<W>;kexdOkVCv*8G4WT1Nj}g%DjiXBWnx
z`cb8&sMnWB#N#YHb(_eaN{Fq~JemX2=;zbkZN#F1jcR@)U>P}9$%Y>tXUKKow1aX<
z`$G$%gJp79xQraV@GE7UfOU)}2RHlt+4TL3jav!x+uY=mip-_ZD&Lpc)-dA+P%5j=
z{R>iSQ+}V9yYeH?yK4N3-jx0`t<HOj*pnzwwfIQ^<={AAHTR`?0BReWQ|1(Z=;Ueg
z{lP&ZENB>H$(5{z!6WGSRug;yhRRi}PQJNM6+U1YT4jk14k^IIYxz)34<#<R7Yj(X
zsZ6|kDuaJ!h<#6If%5-R_52T6@Im9zzxC4VIN`q-QOX9Jlwcsq&+pIN=eZTKCY5wC
zu;TIu)qk4D7TM2yw_Q`++11n;y^yw!#)+`|H3-eUtp2(%Q3kaX0AtJO^E%<-yQ#F&
zvc@iz&W)nV!;*-CymAt=10j5`BXwXaUw>T^FvaD8(d|f@tIzyv3f&J#OQj2=C3aYO
zSO@*mXfDI;%bT{eKT}If+;TV)$3LxmiU^$b#8>CBc-vEAT;@?4Bki~Pc$L7Z&pke*
zltw=v8{vZ@5s`YO-d9^2B|9Qj{J_Pvy~Dr}g!;LOO#iJ%7i*)k$IJlL%9Xl3tG`Rn
zb=7Z**1FKxt6xr-hbEJmlX^+$ui#pr&9i70#%cm3f)aN|ALvNZ%VHv>-12F`M0QxC
zf!z~D<2>Y_oJpHt4k6o>>90Qp=M`N8{CWs?%3<X(E%jeAl*6Oe7ECA59@FOx6)6v$
z#6aIOU@MQUhzB`e-Gmihx~rT$-8WHL+o{%auucgsN;^v9;YUrP>_X0E{u-ctLPDMe
z^)dIXkCr7t?8~o5*9i^Te#RPKq{I6K`agr}(kis1THQE+oeXFN4V27cd!2A8f@;A3
z$Dhw~FN@KM{EXT4gXe9xUj8Kir3KPlLu|P>?i3eN@{`M3qrx{xw#Z*?(+%j|x4arU
zO3KoTEwD{Cj^v8VC}t>J5^%jxK)<!dT(jnyFp&OwyXY=AJ#xiB(VEMWZ4RG9chETU
zAZzVVOdS$+;y(RD^%aN1HLb2?bF_1QXKQxcMp)*$14)Vg@E+g92TG2XKk*n`#a!vb
zp_xvKG6b<%pwG20>-JAJ;+ZbSXTR&kU2?IeK?Jv<0~xa9NZ#&c?^1^GrP{TR8d)S#
zT7+zDCBPzR2~{MA)^Ggp?-eSb>RQQvmn*NQ^NTN!D-?9<ahL|z+ma@Z!QzcdS*3W}
zmbFrI{j|(X-iU77KnRxxqm?H>E7CNIqV+E;(6I~T7#Fyw7SA~5CLfnY!J2Z^s){?M
zxk6A({lb(oCf@ildL&!jl42$eg5ejNYo}P*`upQxIRht>-pE$VFTtsKCFVp0-_qVp
zd`;Onp?Td}z*8dBpc$zRZ?>0Fm&p4*cKoOy=(z|+SzcwIj=>bAv#<V(lc6W`r2!na
zG@XO}$}GS;jmH2=W3?4;Z$7v#5xsB1xQ}J&D@)?VE3cczx8PVP=%SS#OegjkQA811
zpd8yNMGb)s;7+t<134wxdP>OoV+nN@-%j;H6&UsK5(P^X-F4>p-g#SI#YlBGfjVJ)
zL4ZGaR-5A(otZ5+SP8!7B)#i)%2yR!(d_<giBS4DxC@wEE8wpOP1$|6CiN;)B<zH=
z4xZVs#efvHt~q69bp!;gA7zp&8Ju)JXq00iN2%DsF-y${>gpk=zzyto@#8Xl;JLGi
zXfa+L#T6-4Z$aT3TAYossv`ku!OcS#F%kWXS&2ge*=;iRG-7>VLs&c@UuHSZ3_!fn
zKww5+mvw$$HTlyqfD*bZnL6#l$ytXL6~UOS6z&U4hMGl2V-d+RJ7_x+vXv$3`ws43
zME&q7MEnSlRm%e}(zjm}rfrsd{QE)7-&*GDWf_v`OI+Kz4)pwrQa~{AVYb*Jpvhnz
z5e@$g5fYDoh7z?LwkHrdW5)mxJaCCtm&lw1gkvNXYnpwbIPE%)T!wOJeh9mxq|is-
zlL&Y$3f%x)fGJg~yi@lfkiR-mKb1KDVi|2`P3@aeOs=_o`En7VS``Q*0d{-RRyAS6
zp3(Q7a@b|_jzWK*4?dP)Ya>@fo4o&RPtX*2dTzWziMG#yKe--%Cs`Qtm|>={==~pI
z`0vku=ODOI4<*%q`&RcPKcgPk!F^UMHd#ror!)@LA(MG~wc0_c;Zc<z`Jk0ol8Hm-
z-<$DWd%ma~EeJH}>poK}K}$qDq#7Y0xSW8MMWU_CUuYLLafmRAGmO&oJK9J^*w8tl
zq$OlhU=AcJK_r-dnE0~@m2{qmQgxRy@x22Ii|+?6iF8VF1<oxwf2)sqqhhIWo9B;V
zk*FL*XNerZ+P}Nb=G|8bB2)Ax#_<`kXy?syBG%^lm-jkHOQ@!EB}~yg`*~{e7={+2
zx=}kjWB!*twCcM9!MN<f7;Lh6mRRz$bROHIH!;?vt9W6gd1|7;PAIOLt>{`v``bl`
zg{$M{ULuUzithLL*b24PfnHQiD!2$REy(z{vERB*q-B5Loa3%TUA%qW7d&`t&g#D?
zYCuh2*`M_2OaFNx{B{fH0K-m(bAUls5uM&LPZ$|-(MuRUx|o3HK8P72StdQ;&z}Ln
zpd|{fJL}ef;lOo=GuhL;p))K=E+`ge@U!A{HAj;GeW?87Y4;J6J+*cPLZcAi)8N;T
z<3ONUJZiTAiGBZQQ&7i<!`nS(#>H&PJLSpz_=;azTX~41O@OQY!`$5X-r((%GLe?o
z+8<PkI~)wZm0EkE21-mog}33GWxTzG&f4-8jF-<vj2<*v_Lfk{N`=okN-h3k&Pr*h
z+qcN4SCN!`&($TtK3Vkpd>A>c|M#BczJ9p6**^LF2bs$@m<=wGMd)!Z(O$y6WhzOL
z(?N3o=*ez@%2<VH9sLVTyF&lF-{T$g>JyyZg<~(C0#D8r&QEPM-bg8{Rt0A$Nf`~h
zxS7|#jM0gcWi_~!lUO#lZCu=dSfm*hBB0&!>ER!d`?CGsEcc_H6mSTQSydEjrwl#%
z53aSb*~Xnqjf9}8FRRg$2aTX57TVrnY2e=#NrYv(V4_K6!GPnV98h{+qEV34L9<Ca
zw*mUjYXNrj9;7sN)c9Eec^j=E0+Sa5?Y}rVL%a1LDEI@ah&{*l0}0gOi+U?&6~+%+
z<<~{6=OKPBe>ZP2RsqUxPZ^4mQqMoI{C*;?xmYb9e*&lowEi3$#T)z3^(aS`xDap)
zqb!bER?{=In}=*djZ4H1h$T%r+&q%KvJ<MA-q5r~i*Jl6c@sJh%?YH#Ez6}5s6CAA
zx^5i^>?D^}yIeICL<5JA{0ozOZB}{n!e}1iyup0NA!571!<>{fCf7fLF+CYbG=Pxs
z5H86RqJ)jo_XO|98opfVp=(pp7aG@-o>JA$^iqUTFKjBDk~4&d?B*uUlpO2;Ez*G5
zl3$MPZwJ0qz6&^7<P7h+omrCl0m;@)-B178iID5_j?oc08>Hmy93yPFOY;}~kEf1v
z*Ccz4bJturhl-ZpL`tx25C!%-{%d%Eu@S@8$G)NO;#~dp)zk`mPc2t5D(a&5TR*k6
zQvqnMcE0VQ8hO}Rt>(jA#GFVMTt|_Ya0yxC1=@wOaWXJG`8ZpTp?+^#j|qKz^?`IM
z_&da~|0Q52xR&;4O*vcIA%5Y<gnwbE*CnK>Tr1j@OH}X1&q!YNlzU$*Ex~+0k^vho
z2V5jj{SHwK^z7N{$5uyAFcM3&rux`<28IZU?@=y)F_IhbZ8H^2OtdQAl>)x6ooP{a
zX%dr^wX&OvHrA(JXl)eJ(MZZxGt$5PbD+J`v--d?A-$zJI43q!yJc(yGv;(3Ev$3D
zHM*^dLqdJdGJqMTn$-(sfck`Q*>pSUD+kIgA^j?WBtr<*c{Sy$x*BWo$qyOrGBID5
zuTo!3sYje4f3R@L#8fP~yw1=bjyYMJ_2<Rn6g@bHliW(AH4eqa%DyPT>Me5Co5x0S
z69#Md+7BJJK$S`NP=R;o{3!IgWR?AP_~u9a4u*doCh1tGZjM$XMY?Vk5k?#4Q)+*d
zn*~A}s3yMPU>U|TE$d)ywg0i25_%9>grxA-1r{4Gp_rfN&gN1y1oU8P+y21?mr`DG
zlu6%$@M6i?ym?fa_NUuc^cmExK)KFj=TEfeUS%3IaxA^VHucFW=Yp?3^b?3_4U!u$
z@P=#pEWGjfsw7n^#Z{jqonlW#wtgt}?~--R&e$T6oyL`UvV%b_OjDPI3W16inKQPr
zteBJd5aYH0Aq55-OepcVdvL36XQNqh>rG}jlg?|v>!ecb&gtZeOH9xwLa@a@Ar%i^
zfIK#TF2h9lRqc7qB;@8sO9tS^J-9qpk^{Q;_0{HGnGQ~qs6Ra|Os+yhQU=e!c;3C4
z%KAvjn-g{M=Mw{;u5muqQROH$<q|Gl8a6dgzih(eV$l-Yq~MF9o#S%%X!t<td+x5%
z0oD4V29tF619w2tU`;!4wmOQTwI?#`kw>6<aajOcyGpKXN`K}g9?DTWgvbKn&1d&A
zAMDm{K?=#zX2e?mn}Ks+&w3OC!qV$#8rAz~l>4C_ZTnY@0Xo^FhTqmoZT=<-w$INo
z{H^0VcuRoo;S2gPuKVR#Z6}8)?31-hLlO9c*s}{DS{w7=5h2Sw{QSV20ejFrbms_K
z4fDHMkQT^K!}1xPxHv4b$`oo(eRCW&R~daz_lt6nRn%{?EQRc{kSwQb<x@g<WYy1e
zZ%=}sPoqx7l~0@fP{g8=9P}*yW;^exDq{p;*C{9^Qo***Gj-t)fUT&w^U9?zBk?dz
zvEQ@VlV(JUxLe<Qgq!SDT~>)2PMWvuywz6IXDG?MsBDfOv`4tp1GVXL%nYzJ=1vDF
zV*gzv!o9L?0k^+pAXm|~`%2ie!evF*t8H43syD>bf?6UNNfOu?!(;A_<2T-5ZNEWk
zafk3hG1VnJ^s2zOcHK#<69585h-&^QSp}FU&PtkWA(R|dYW=RXqhLI90asBL@oSGs
z7&^M%$*~sAW^df(OQb_*$8vnQ)3TRiNLJVnQSz`XWCO>!z5jv&KNh^~u(6z{ysF2(
z7mC0PEc3S*YTppsi<J)fyIZz&$Bf@lDVRz$w|)@X@+a}Is4?depIll)pw=5{#`p?y
zU9X-oGIjs{wNGK2&-=cam(g{Gh1IgzU(vs0j~!gZ1Dt4$OSbtlGHfmC$DPgek5D%D
zf%{isrK-Q%i|OOC;-OytqB1l%Sx-;Ks)`VfJ}FQg#xk6BNG#CIsw5XGO6n{A{X;Z%
z5@zW2seus~w41Hv$KlAiQoR;*7Qo;qg89dU1m57uFBa9KNsWlX<cSON?LvwrHO9m%
zZj_6Mf_|JUa}Z3(;L=?anY!!yTdllTB|0k4g=NGqzSVS&_zMXcVIl!HhcPG@O>J1v
zHw+qf`HZ_<i?S;N0><7%zH#L;-GAD;ox2w_dC<G`((>x%DRN8Zp~x*ap`Up9>FKc7
z4{#^30?Rjy`JwbB1d}bJMHG8c7A6X0F-1#>>-|YmRVtDeWD7$rKhvGPP*HZJ&>{f(
zvi}kS-&gvr<k(3d>F?tUolsb_^B0Vb*bT~8((d`u|9c3%COt=Qr(|J6T;+jc<dM@J
z08vIKJuAi4=lI@)JOIMJd77jtTr=ovYBb4lPk`$<Qj=_*+$;gSuRW~WEFQ8urxq5H
z;f%KPCArdc($p?|8>Nh|@h9ZRk!Fack0e~2zLu_oZrQ_G@t*x(n50*TJh}R6ib;k9
z>1X?d3~sw-sFYK;&CNThKkv@fs`{}}sW0l$ERga~68LewkxmvH2x^17&L3J%(ysHS
z17{6aWf@+gVq&B;XWpwDp}IQXdS@8JP!cR#ypP&vsm@xABVX!=Eg}^(T=YePe+vyZ
z4rM3iAf7MA-FLrygd%_R??Ki-bm6PA4CMrg8@?kiItuqxv)XQ(*&AEcHcE9XME}Fu
zS@9o>agHf}W+7H)WVQ3b_jY=VXJ(PeUP4uOm}l3#=du(fwT)pZ!Xc&u+$tk84*+!P
z1Va5BuJf~GP@Coaink#}r#N0e{|mAKu&*{9dDM-E>mI8&1iQ$1pcv6jO#7#I^WL}&
zph`i$cZK^sNA&lSx|wI@`)q}JF{X$=d3o6+66KRGB|V%udG)%ktzh3*q)z~r+7@`k
zk-KaaIpZXh%sDW@@0XV(^W@bAFC{zoUDS(4LB@+iF`PkpUiMzAk5IhEi*~JN-70xI
zhP))*^CMXfzqckrqfc{v21zBt@A#m2H!$%_vhf@LQpvJ@;aXaxJ70KDj_FF3bmP|j
zmZF4Jsz8)9+Y_EgDCf`4D%mq^=0fscwG4qBDpOz0--x4|vzv2dOQ)+}V7x{H8qv}V
zOB-<$^g!c9ejUW8t&Q*sI98|X*e+VpxX&ybo(r{}2p$}{5BNtHqVN2U9v!g&_=9pQ
zJ}2MlT>Um%=M`BeW*i-zo+4I{+k*i85n%7zv)@GHH|GMSb`1P6U*C5uY8UtuCr-9z
z+{|8cC7Gh*@w5?NVQxx6yC1#&Ga!8Nzp-`DAzYYKvLqWP%FcoNDz{FQrzVzrigpa(
zz(no9luCy%5e6>m#lmZ*x?wZumREJBgjtrQIZ+9)rH#MN$_8~hg|(UZ3;YgpEzni>
z6XJNz?Uj#Uh_^EBm@%H<X<UFoZ4O;=8Ag(n$m%IWf>knnCk&N6Lc{fVc7l+wM=blR
zTx~tiLzAReQJiD-q&IU}si|X1V~qQFfuMzklFoY?>(|tmQ*Uw!`5Vw(198*ugf*tI
z+oV}t@<!(DY%NfrDT83mxLFH>x=4mHP>H5wb}RK6zXEHw80^InaEY1-Xd|CTJiMfb
zf7%z4hWi5i&30a`UWZ74zuO5n)l7nAE<o<2mf({xnES@1mJ)|+-MK)IvcLL7#JVW~
zd81+eY+;yfP*#J-<0V045%rvxz0<V9L%I8p_CherMM_hEn$Dy}B_Sjyq#=S%&>Uhh
z7&u~=d-8HUtvA@p9M^;zw8r3y{kHjv$o9Kr`P7jKp_Y5+Gh$R5GW|3HGx#ki!H+34
zDo5!;XzF)xE`r6m6RTHY45D5Z3(<lf!w>DHYKfhkF0QT-DN|Vvoy##}?1tlvv6D-j
z?EBOqf}L^jKM<%4gG14J3C}ppM&UPLF7EQjXVvBU4FB2bc8R{2>8CCMdGBn5&(c19
zBm5q&euUMieG*qMITP!u9}V|WSSa$5{CIhJ?_A}qH0u0Q7i#a}UIFVV<uW0Fzq#6>
z?lvOE%K^QWZJ)t9d1iwif;U5`t)(KDG#h`>BsV}a-!!j_xAZnS9o!#b%eoMMnaW-w
z;qkq|$zN<<%|Ghgu(Ha4`^vo3O@eqi+3%QvcS%btcv!oi!TyT=b=f{>?gZq@V8S5o
z`o{D_Oq<TnSooz`WIr~?<ca4F#8|)y$vLJ#aL^aD^Yml-0abDMD2B^%*9O->4bJ9~
z4GCO{Ets1XjlS>q#V^L+Y#z<1D{Wo3o+XcK%n*jzwX1HAjt_hapaEf6*xcQsI!257
zKOw12(0;WnvEW}iKw(l-WuvNSu*WKaB6lg|>Vwlwn(@M?Y<%1!mK-A0$YZIEs1F}R
zz#tz1EU<c(;O2z6q^b~qT!>iV6pWHCO)^L>(&nD`x7=8#QO_AC7f7n4YQJA>t($61
zv;4{9JIra9>b|9u=%b{*=?vtuYSk?H18vC<#<WaFG_lTr?s}tA3z{9bkB*+i*@!~Y
z$zXg{B5bnO)Z3mN{Vy0=Kq>gF8%zGM#^g0*#f!!y5g{k`!LJ)$2EhmnsxcIBhLWe@
z8DD!B_ML4^d6yU^6qHm!O-#Nq<Td0Sa)OHgf*vzll-h(~W)G(d#5({{AUAQQQHtj3
zvvRz-d;!tvc&#u4e~qU!|C3^gavR1qq|#<#t~DgrzrGS_^7(?>R{&ll>2*%G9MR)G
zz$RQ(=t-i5s+3>{OlL$RST@k7%9YW$R(S~2072)6$L`s+3F63?pQ;Vg5(2x9g&7@X
zoUaUak>Aj!C#7`F?~AI%fHeUX|G=bRBD<D|-B=C=A*7UugiFZdoNQ*>eSg2HMhn7P
zvM`+svcN9aAW=3Wm^kdpyehX1-sn+1&A6-^^=+wt{%GT8!1|<$AS2MsnuCnqq9hyA
zQK;su@}cg<c`QSEm^*Aoto!2=&pCM7#nWm^`@BiamtF+s!m`AhdhfXq*xaKpEr15H
zKt&}IPHHYsr57pm$A3s?XT4*pZlUI%<E$1ciMV~4EnmH_(Gj&!v?-RjPr(o@XPY}>
zj-qavk@zmlvDXU1%YLqyby{vO&NV$v9FKF?D20P|=!5UxxaBuHYIS8C5EwnzJ!Vop
z#t%~%rrTE@tJtKPG9BZqMW%omf$BTP)_?YdxU%qJQJ<C9AAmW4FC^7t7cJQ!blVV*
z(!k15)wpg8DJr|?IVxZqxgUi_yI9vSA0@00qx{cm&QaL3Pc7oYXZyRhn_@Z-L-wM3
zXuo3V@-~4BAGW@*gY>QOL~Wn(N@wdA?G}ziao^5I`h&#8E5BP8_0rR|zv9DAg<uAy
zmrr<Yuu0E}Dfv>plPR;HW?ZOK$R}dR<@|sGy8&)XAj@IkdH(}=<w)?;2VlP+*`Gx%
zFG}`A$K*bQxHdGe=*&suk>0cox`g>0Q}7$+g_KajavpTcx|h+Zn?+(7TmMuJjQTh4
z{hOVC)8x}1g^R%2%O1)}3Bl3T1#0xa=mSIWqo2PgBYc)1t`t|lFcDFPNL3FJ|Ff9f
zwu1h$VkTp9@sPs9F{0%X3i$HYrHt9MW|we!@i6CUNpaz(=VYRpaJ<>8vXAG%k3)=v
zEU1lxbOXm;Bc!FDHy9Un^v^WaICw<76hfdvW#Y}g7e@J^x<nt^aW~y)LBmMwB%d34
zY4#@hp(IXMmq013RY*j4x5gE>s{X`74Fd$~wfMcbl1y00@7Luy=>A3}A;;twO)Tmt
zBx3mByWNvvxEEMW#E(fb95w!$U?mT~oc8P@gGSv9&HUVO3;Q9bK3jwD%LPCo_*M-k
z*=tR1oxj<-XW_5ls{1c{bWA2;y;tt<d#g`Ese=EFbJ#|?gE<xjmTk`4473^l{3MQ<
zrsV!&>C|EogT=|4#7XC;JZx?zjI3}c?mst(vVfoDWsHir0lHjrSVbHaAFkP1EP2Uj
zYE^nVpUcw98nacDr10aB;65|t)C7%ph9zI7B1}OS+s#6fLnR%P4{1+*<V?}Zan3(|
zJ`coh@eLlN8(n;wW1GUad@RanrEBBR&2*m4VwA2v*UiTbEJ5C<oTq+BLcEfGWrh)6
zuEklDSm`$2LYmbc$Sm+l5Y~&;TW8M*nO-l0y`#!_Ys}D)Cmed>v{jQShW|)ry7vX~
zh*zA`y}yxuVzkPZfcB6hUEd4v-f%)Kcx8H84`uLiRmWzVA3x#y-a`)*8Y!NpE0xmn
z<Zk*_KJUrM-8}qV;&Av4s2sNt;cu$9#``M${=U0$uflL`M~V0M^`{WW(Py~N>}RsX
zb`gnn@Q#iF$<3Jm7}h4ORME1aFe>}M$uJzfN#JldEb9DAEWdT;3FRKYhD=Js5bL;i
zBGWWPj;W7BU13C|Nbbu4_(rboK-1D-tcs)N3qSm#p+0&WfHam@{`ChY0W@@fXoYH$
zZwUJiKBvNnsu+y52ikuv*?(#z#sKR*VFxW9lBjpU5!<)LF@AzjvNQKmgIXQgvqYhh
z(v=sb11!{S8^832P4=4$FSefa$^^xl`{pb=H9+1-Y3S#c44vO&4SQXmZtXjxnXjEr
zCZ{DSt&tB47al?b+a%J<S~tO81g(^(Ar|N<4I$S=%zz=R#D=<a=%(g|Ahw@mIzohj
zV#O}2i269U?A!F+Mi%Q(bu8m6EL#2j`z>}yVWocm+Jq3-T<`UuIbYfNH9-cWmz$Q>
zK(zm?ldM}<6ySHRtotZzWL>U~Y0(lk)=VulIv*CSKS5=`JO8k?k1y|;QFf=iFzKOJ
z0y7_vV!qxTj%P`y!h_>kX1z|lS~u1m)3jBDc>GQ1;HC)PIJSTySM!{)=DC0(yi6Z<
zBJDzjj<U)2Al)*b0oIQYkv-P3-ooYOoKZVO0rr`!LDJvv@Pq=MdT4~ICHgQTo5o)5
zZs<|Ol9a>fx|H5P9WEA@{qhTi%I}q)jy@JKbrQtV_)=YSH?4Y{xypQyoTe3emgPZX
zlg+8xy$YEe(>I!qG0H<F9&KxM6#F<&lq-;uN&)t)JNiBm8&BftV7ZSz!}g0)q!#!n
ziP-?vcfV_?E9h*R!p(#k!|d^uQ+NEfJJYP6yqqse0kk)|(o+1_+8VXsZ_opNm}yNz
zJA$MjOnKD-Ie~r;>fN5rMJUvSp)QS;PyC;*PzawT*Blar*E0rn#nt%2>m^^{tPy{|
z8H4=#4G-tiQA*x2M!4=Si#3qS*VH7)>=~oY+38FN?+(4vOx73Zr<K+?&&s534L!X_
zfvpb$`+F~L=6;SZv06X<&mBvL)_(W);jdozn=iP)iXJ?D@)Em(%^7I4sN^9)<Sq}b
zCf5z+2?l*%iIs&S1E$aSt3MgdJT?9e8+o9H6*|Pm`p^i&2$z;Gyp_T{Wi|WfjYE}7
zBPV{E14pe<DpV%Nkm6zAzuEZ0IF30}`F+f<&Thpiy1v`$a|UcJ{3<5g1~qo?f^*3y
zCa51i0(rMR-n-9C=V*h{E10KU&ns)yH&y;DS1e`xi18mt;Sz0)7V`#MVTArb@XweU
zS^BD%neFPK{r8x^d2;yDHz<02gfP|uzL%UC{-t2MC+ydN-effgeM_6tE*zvNdq^Ec
zv%wV-Y$1_z|5Qf#C#8V;5xM46H}qBs;g5>{w$0$}X@iOiRep5B&vF4-;ch8JE$6!h
zo^Hahs`K6Rb_;(u1n7h8W43!xU(ghlCp{~5`45)4^gG-u{;#M4l5O<+j%&qzaHy%N
z>IzSjtb~*zJMvzW5DTBuCCr!>#@X_j*q|jBF+$~#i)IvEq0h!f4<DWVUBWBz@W0k}
z!~ap^sUZeycmr9o7&uJNyJQST)fjaSbKfCtzG-cy-w(?CEvC+Y1~C1u?kPBe6iQqR
zzh#Xv&doQranpER!Pp1tG3pWp?IA%UHco2<z&&JmKsq&EI28a6y-u&I<sjKfdmQ89
zkQ=j>@`KWfO$x6`Z2t$AL^5C04^RDA9m!cjOM~yXd{EV9+cAzI(koKj+nMDoS>=2{
z5VCx5>Oap)grTP5Ja-8jpzUKtiMfa&5|vLOEea}uj)Ey1gXO+?v!E3E6T#4=T`L#<
zM{Sg9r9)`S4vT>cmYC<_VxOn^-{1riWoF_k*9Q@{Sm)EvZ<}r8CiXZ!#skT`K5&Pj
zq#-6lLE%qJJ_j;|QPRsy3t8)w9^@b($m%5yh4$>nj0=a=q^$lG`B&U6&_Ik`&{Cpv
zzkLxiV>L27##`{Y$eBhzeccZVh<44B%moFgWh_@FQ!4akxQ<AC1wr8s_C1s_sI!}0
zAEimg4k?egim4zyg#P(MebRU$&il<T@e;RKZbjxHF5EgmK_h{;u|X(<J?&UPu-XCH
zUg<`tYGn?^{0nsRN1;ndKpf}*z$ff~kC`;9q32!Cc|h1y_~#E&u^DVt&z8qY)kU(y
z9XVaAUbzt`0{8|U-q>^7T09OJD7=#jAxXT39cfQ}HhYAdfwn-iZzpo;)t~bG3jLKS
zOLAGc-x-Zt!;`8>iW91(&FM~y6fVguFV)+sjhH4MT^kybsN-z(_u(6{1uosbmK4D~
zV*e*5*5riON-xHsy@&{3qv2_A;&kQ*=PGZhU1D`x1L%-{(cwLeBZXzdCT>FcAcc7{
zZ{cTBq_9nwd2vbAu|S3l0yQlhaf%_jVGoIh_f|TsSl*DRo8*pjc1tDgI?-j)>Jy1y
zLJF7UrWK6qhWeQ@H_fy~G~QH?@xb$Z*t@Hcm!iO@-@{39Va}53K43o%fo1Lhz3w(P
ziSTOEk<&FxJDG&K{Q^dUla;}hc#^7C8Di^^qjdPpWS$>tx=|PY@+RkLbxv@5f3VlV
zZxaJ;KU4EUCirgDG<|2!i!tyfEXC)j`aqbQQNY2oh4sBEFbj~7@TEYKkDFflxz+yg
zJ*Jgexa2tio9a<q;w*kj2_&ju_tw4M7*#7^&sx0waR5ldVG+Pihz`+9+|<`4KVJ7U
zebYxpC88Z68rH2&Xbw3r__{IL%Jv8{Hbj8~DETh$E5`+lCP)yPqg7vK3e2Z?p^PMX
zF#c09I4X1p@D5T)#n!WAOZ@56GSiygNP^2h_N*fKaTgvn!_bPPD<cIYN{1nQ6Y}@x
zB=KyvaI=sMmH4$bW9fpXoZPS4ob6}NQ`gyuTV~-R<=o~7YFM$dSB9XS<J_BQ!K(7z
z$XS_b&@;U=Rx?;dMpMn&iNP;6`d@73XqUjQ4Y({JlGSk(r*}4ZV$)UWYQKxU_UUb8
zMO_0h@5w7$97{qw8ek!OjN6dk)g)P%a-m%Qks-I=Vl6&%UD$%iG6Gf)m+U9Byh`-a
zV(rjYA1{rUY`jXkbl|{{Z+kId<FV=OC3iO5D>jy@0z;K>V+#D*|B;YZMEl{q6>kMF
zn$<T^SbSLnmN{7hTj=deHjy*e)6iaz-Js9?hwL&|rAUP&gv>^PH6FUI)Z;*+&Ful*
z<rAd*=%T8NYz*<Us%Gt;6D_H#gZFttrXU>Zdvq=Od->6<vDO@f3mD9+Y8_p_`n{=B
ztU$?b777P8Veqma!<Z>r4S^-^_<T)dqR3l0_5;c7U8NJx1HfS|nB=l=3>Plo_c^9?
zZX!s}NMUofOX7V-k+TDV;!lo-!bPhk1cd-U1d4y^e42krLti^<|7+u{YeV6-CQo8w
z-s*cNsaCi+Lp!^Z!+9z-?CUJt06#^a->;MSnT*S|<r>cnnwHm32!Jtas-Bd~t0T=;
z4E|l(?(zP#__aZnp_P1S)omYX#H)N$GzCVG74tP0%UpGhm%W}$(fTgbXkREXKL^B@
zxqL*I&~{aY;{_5P;M^TvTRNAs;FLQq>lDRyUzxn4f=XVqh)<Ge)uX*gtc?AhHJ}@e
zZhirZ6!ZnWg0lbo0vJ^qD!kf{h~K*h>h&65d{t#dpISl_-gctOCa&)DUMq$_LnrKp
zzKner`Y2E=doJP~-=EeeuRt=-*Yi;3G^&@c`FDqcQT8Z_IvRV8#4(GT9NOQFW@0Vu
znIu(x-J<qx1(#{s@=5sU63WCfpn;W%7;M#4&iHA}w`uv8jC1a$$rPSe)eH1S24gz?
z{jCike95VPm5dIju*^%FSl-fHS<!3dwU~#7?lu&0fntm|`wL;D7cyx;#qL}L_^>2e
zl$0KP_C=Yv=kXgKqsKlQ6_lRG@VBYAZ=QM)i23QM%-^jk2cTw#sOYc*jpfmE+|N_g
z%=@)DZcmnF-_|2SWvkrff6To(CjKmBH(C+n)z2G#tX1wFKWb#qUln@ue3Ci)@5+9B
zlaDekSq|4pe&Dgj5!eKz6e?3hDwr2}+ONx$@Hc$JhP$rPLBzvc&v~L4YF`<rn{08E
zG-i&~f3mYJjZ-ZY3Q_@z=gpORI@fqJtdeZ=goqzP6z4^sx2#8fKEmZ0xL2(*fm2Q3
zPf_>5QofRhq%N#SX;<yVG~-K$KMqzK^N(^EMVcIq(@R6%&?M@_jZYwh|0qld)lepm
zM}SvcV{&ODz|Cg1WWy6t8Ulm)%RgX<2Nl6q`(jmDeUQaogSjIBGi3SK*4%iRl;P>?
zApMfSt8_BdGE?`->+No>=jv8y$I-j9xHnH%=Cadx*n&b-;M=0Gp9x(8ep8)^F}ax7
z%~4_4A>r7Hbdg3N`9_}37SX+R1w;X1)@e*(u*jdNf9D2rU$<-@A1e3zpS9|SQ$5-5
zXZoakq-`%`6DD4kd`~k$I?bkjbzB(prb%f0e<TkN7-MjApucW1%{kQjb#*~xG55&|
zkcnO1EfyXXDxF+^1Z3Q)F|Qmf81EZMX4d5|s8qStoE!D1x~gFJe!n5kUr2!rohZSh
zdkSfnjO_5|Q|EC?d4*2z9xLv}UJn<_%0T|GIPpjuhCsZQ8L(rb3K~KOwhqzs{5TO+
z2xq0-2efz={40Uiht;_R+|u&BB3RLkm{VDsAmBCN<J4H{7G<mxt|;H5jzNkuK_>@l
z-9)`wmd`#Aw^;nGzMPI8MHa1ItcFW^qmtTM3LpJY4c&4ZD8wu&jQ;}hHrBiz8%o~3
z?~RgXdUBD1XAupTRb?fnU@GJz%xqeH2il8;)BXKryX;`Wy2l08fa|<&qts*XcTGuw
zzx;hfXJ~O{UHvdoz?Zm{vX*N*+`i;RfWww#))8P`?2h=Kr$7I5+&Jw(dkc1Tmx|?2
zu=Pv3Q6k}qRbl_8(xA-`HD#|~0>4!<dY-K6?y-SUCQ4svKsSF&n`zJN<~-hC(>zv5
z{nEH<%7j483&asxQduQTa)cfEJBTmRR^%+#=T|Bldt7@c)+gR!fvDxU0PWP8ftq@d
z4^g3A+DV1eZE6`otL>8OKquqFc|Vmo4?G>9eHYQ>3L&L@g~rw9beSoF^q=vty;Jf;
z1NNz^fry_yOpmdrN&c4*8mTd-O~&zr;Pf<d7NQBn&oYH!^K|}ugmE>TgxK$e6*htH
z`P^O<?(e#qcx^6X8Yf;MP;9_&|9Yr#z~_Xy*BV|wAugS(%=2E05Rc}M^LC)+(q=Wo
zIakUT_zO;>WIIn2^;QY18{)IA1M^gtIAxY@h-ZH)E|Kr<)Uei%Dgz%qXxzU@aNh~F
z@UH;&s^s%)7>>4fuT|QF(K!34q#1gu>;e?%+-4AGZH8uQ=sT+^S_Ux5L_QFIvXxCj
z3@!N~ne_pEfp8lwAwFm8^<KQi60=NZ=3UPnpAxLB)&|s@lrKN(JB}OlZ~2O9HRA2k
z#HVQW;d)ZS)T14%dE$8|Pa0r^`BuBQCdD-!3BW0ssr{beBFcuVZvlwgjLknyfj@*6
z4~K-lH`Q8BbYBUpxaPvhO7dS6^|fg(w!m)h%N9}^_4|J|^@&c(z>X6HMIHD;b<gH_
zC4cBMMdbvyCSH&GZGC4IH{ExLTJFEk;Hvq!;R~bnYSdPatdoGn2}Zfkr)Z%JnXlGU
zT7X}D5;YT*vz)iCkQ)uSkqL5EJGFJhylZmNj;49_5^nlUVFM=(b&RzeB8^q-6BikI
z0{+Ov=>A1yTk!^ke5WD?o)ZMt_h5a|jK84}pN&s@2w!n&(74B=M+X8k<B#Nwf|IqF
z${(!ojNY2WoG|}<7m8E!C|@Rhei(WG-2=jv6@~AnnW<HFWwKYhCTTU+2or+g3Bw~+
zgelvDWP!c^o&_ws%MzZ2Su7Pf^#X%Y(gu(FZv<(w&zlku*KG&~vtd?4hMxJXpXw6b
zz?7uq)UPPRl@-jBh0e_@`nHF}bbKp4(rGFF5jh_(v-@Q7=vhY?)WsMX?4uu=$(;l8
z^hkn-QONSy)Vk=e-4>;Gw28fipWDdz`)8iw5x3gjds<5GnDF2GEU3aF3CBHm<^oe<
zED_^xx2@Y=zWjaJ)ysub%W*s=!)3<^3J~G0i^{HF#bGZ@bwnRgKa3nQcwVw~L@er7
z4xKn!sC7ayx|KcfnQtFtG~JhGXmJ{4J^84t-BYh+<w-^1u?zgLKkM8@tiGyn-{P<v
z{3ZqU+Hg8D#}ujS%1)J}_tS9tQS&^tm`C;L(FfBf`lG9<M%WVSnt>H*iqSNf)+l{*
zF(?n|wf)y}!?$}CJHW~yBM7$~XC3EK8C%I#zhTYdaJDi9D<OuIYLS<-5V+}G7@nmW
zTCL}L<LexRHK0W-u9JhjYd1SdLaZf0Xve=C*hmii1iA*bb8yTS1<0S3BJ;hvZDT`5
zapsxPZFs@bFFz3<n(NL^Ys(9;O9sgiMusa(RE@9j?+C5MbqSJ~Q4QbtSGLQ_hhJ4)
zmVK|u<`6lPFF#f9@^`eH2rf3>$Zo4+j>`OEnQJKXi}Jio_;Tj(dJty>C<lnfA-94f
zSGX)Qm&$b2A~(`6ihb<XG}#lx>xqkcUK2AA=kw}KUB$QZmg49A>e!TMw-f+v-K}~Y
zG3r@s@eQw@*-a_8^C0`ZTwB!ez(LWCj1hzBu3s2|wur)S|Iq-gVQhgds`1!=+WO(l
zEbr;gG)?!s9+s3pIyWX09xGT6EtZvs79vd-(c#ipP9u%3{vgtiUXwkmlMlGX-WDz%
zx|&EhPUI{1JB9ThU}K<Oo?9bhVwWEwFJ|3Zrz#ZBh#ezyLCP^Uqo}edgq{$MF{pW}
z=d@h_m^|7=Mj@O%b`&q%ZP#rWTzzq^-17(02W;oY9H0MaCWjT5NeQfVXK+z6Psiqf
zwjKlH-AxMP0bIe`s(pk=(No?mRTL~X*L1UH>Qz+lMyV1?!_;?uU_Vt3($Qo_PCS*m
z5w59>Bbye4R!+t2HP~ER>peD5Lghw`nT>2odOlqp7a%Ui0g3<1Yq6XC@Ecc6UcnV*
zM_3y?f|d;$xyK${KVy`7-oBg~N(<Q^FmgX<f#wClC^-1vyxF7$(&c%rUKnZQe<U^|
z(xR-otlSH)C`yBrR)roa|ItH=D3RdqW@eTzsmUuJX9@}IJX;mt77jkmY$X+!96{!&
zeg2g8c+T<()}H;MWj>$TRq>xmHIAx2dh7_J6$c2mc>E&R_<PUtA-E7*n8J*A9^_#&
zeSE9N0YQ+qUsBu>tGmuzuZ}sdZIJp>!W^5b^NOqdH)Q?_wf>#8VP~0(Jb)l-DY^Js
zkKXl=3u1tRpwQUdSKC?gE9sD>64nQit3T~vLamf$g+oF+PsN2-JFsS}+Lmjz9eZoP
zUh=B{RncnUc{?xl!+Bmxi(Az-*HIjIhFrSjjtIpepo{X%Qpb$BYlE4|>Z6DK)!qZu
zt&s?i#PD=~5*a`YH$xBPjR?-cw$&a*y?rorMxaP$#lICFWGFht+p0=JGUr4@(fXCC
zZ;7ID9+c4JV|fSFLJ?Zkm=dpCSS_e|-b>WcFi@Vm(3kJapYWQuM|EE%KB&@i#}t(1
zr3XhVG-hlzis87~Kex(@&Mp*7$g<9Q>E?W_VUYmjUzluGTa=G|)Ck@S<v+PJk(aqx
zG6vVbv?UQ4IGj?7R!vyQei-dLBSdQvEgM`lvE+>pt-8RPYoo9P@x2trJ0heN9#4;3
zn{U5^q6n7?u;*EDf9jTY(&WvL`J9LSDr>!l{*`9+oKN)gnFlfUsC%rvp-8h0gJcLA
zti||;n8|$?FRO_o9ZcUJHVjf+>F~PWf2l=8nWwXM7<NWJ%%Bxf2>9Z%rM}#;Ap;n|
zIev=t`{S$^LHx&+u+PiYJs-)AkN^DpgU_gx906evY)Q9YEAE7NDgEe|Qy2-L<n%XV
ztrb*Pbw-V=Jz*Si@e?P4ASfGdyf!hTchgZ><EFZ^)K%lA!x@k(lh1#~{GZ;+SQI^&
zD7C)&Y#BP6tPGBQl*cV{<{&qd?(S0|$Z&N2QB!YEbH(h&j_d^r4&)I35wy7pHr-#z
zPHa~*xS*>W31F_K?tGkdJw;Q2wCV3y{8XhjcWuH}fxLYsK0`?zUoroSXkElOZ{yy|
z(zN^Xbh>K4zgBFEo4KHAUdiHgM4A9g#H$mliQ15QoBrYRWF0k0?9a~_%J+L25Ug)v
z;X^{x$NYN~UT=5={bD8FzAFJ#eT%L@qUWsMOSS&FuF|0q%+?t9!Q4N#uR3#=9<cKt
ztrrvj$1CPdUx8dp(xPvU{>z&`ea?)#kcfE5a1wb|oA0;-*rcnl?5*1Mk;^yyI8&^0
z+S03A0_-)E4fr%?w&i2#P?GPZl($O8s%L;~uXEpWg`cB6A@e#f`OooLYv%QSU-Aro
zB;Z<9=)gXe50{Z5+|jCRg#XNEJ^!Zy>`+#YGpU*+kbkof0G7?LJD+4!k!*Ezm;%9d
zpvSEMhD)6Q)P|nQ!opSriV$31c!5&DZ)2hwo4}i2NJyNlA2<(WZ=BPfqP##jYkpX|
z=lfg9W!rS0T<h7{5`aO9RYUX7tLS}m=t(i)(;v-pJ8%{NE`sqO{9^=3cC=-iLDuTN
zxi7j}BYa9~Tb|isiAIn5MUje}G|bcB0K<?Maa)XXygG$gAgdogP6Bo3)t$R<Fg8(T
z-4*yE8xA(t&Q4@<Tg&koW(A(^)Y?^?+zZDH{{Idz@4osZZe*6H##QJ<7#zicV5%1_
zcECYU%aDg)$fCSANo|XYt76LI(+0bP(=Ms(*7>a0fV@%gX9Ct&<5AH$Af~i0;|;lv
zC(9{iWwxB`VaEi1r3k*!p_1vlLsz5NaBfp{4R|!{R*i97eYoy7w0S;=^LuK7RbO2*
za{0BDC59;|7Dw@MilJ83T`cn4bv-;VWDq&Sc-i1K^Cws*dgkv|%A+imxy$Ql$R*yb
z%XTRx%&L!jS?%{9Zd1fo&_mX`OKzfjzKlTA{cq?-PuQ0w-5*VUzf`sD-z@htwJ=q9
zZ~>J1&u4^@3$eC1`dIs)eUmXK*jh71t0U!TCn@ntjrAZ&+u{$3J~x#)NJMCTpOvJx
zN1{U5@x*_Az5kP)fr8HCf}WgR)*NgcX0Oj4$~|YY>r`?tA!!Y`3O8betgG=G8ssKX
zEX{f)4&}<=st8j7D|<+>(Alsgp)Kkm5WX)Y1g@9g_GhkJroerw`r$XkI;sY3Tm)53
z%bpP)&QWko-Q%~$j5#_I<G<T9wHQ~(*;~9BL3!dYvlrJQmy48Js_SGQ(_1zjwvcI=
z?pw%+5l@#QWvvv~BIbtogLn$&AiptB&rrGn1Mp<d=V##zY=M$K)MYro<+TkoEa;i_
zkKzYrJcL5wH^xmpT)+Ib&)YxP3uDj&CU(}YHV+ESdQABfe?)L)`Dv>Hz2#Qp4wAJG
zlHZZ<cDmU*1S-A?wy-@8-3Ib}y6OR$g534*w}e)ciu;G)ej^o0du8i{Qir2If$J?~
zrzOOp%}|ZOD+BuDFJP<I2%OxI59j5ZXgMZehco2%sgz7zRDaEE9mx&Nx#LpHGeTY-
z!*A?6dW!CS5UY1U5~-!HumbIV@$B-~oF1HeyCx!2<F~}xP24@QpdCc2LrM;)CZp?n
z@nxWsXxki6#>J5<Tc7{TDnZ$au8Qbgf=wR>pGfSEswRhPC$SnWwlI{~Nv(DNV9?6X
z0mUK{f!^t~v6drMMQsq#U_*@C%Y>K3+^sNLbtF>NG4{&yZ;|0W+_9YFxucYo*d@46
zGim6s30f%^Wb4?)dX`riSrvMFPk?HHc^fq6;c+7{wwDN$O{=**$xd}&bIU=5kqj<M
z6ht28LiZr4rAxGc;O+A%W_41!{B{$e;8BHMT;|(6ga^{P|DpczzuqljzlB5(60`TG
z@ATy9vDOFVzq0a;0Ix)0BMmW7<AepvG?V=X`lc%c``<o6x!musU*ZO2V~u#FS60HT
zj)CnXlEh0v$j_v_YSPIZY0n&|q<rh=`;1n%FCRcvf4;;hWk1YG{M99vwhI}wib4ig
zluwlroa$QUe}!)oeOY#{C}8MUo_9<prfchZ7GB`P=hg5Mpzk6bpVS79M_0dk_6w4}
zW-`tepW@T?5{m=0Ry=j*$Yfc2P2;mvH&;j(UwH-zrnbu(eosJBz|ox4^ey=sTNz#<
zLuH9H17SwVr31^7^OU}itF!I8r(4-V7@6e{3WF*uRi*^J>!B>Zf1V{=I)$~e>1iBe
z(>}wMRB8=Qcg2*d*(rPzd{2{$)K>Vbqx|%R{XQ<mMZ`J{9TEI8F~~(wz!Wx{*wJ3w
zk;pRc2W3N8Id%8@O^L1AyqsP>uQG#*cXn9!58_F4WIg;WLC35qcK~E@@KdXEbc2$&
z_`6*?3xu@aX)?hJ+%IRAl=DTXj<^(-DDpvcb_~B(IKp3IGa?CkR{5G*lC4)>+eOw>
zbEWolQlH@pcy3Kx0e`Bs^g8-K37&4?;uEtyPHq6rHE49V2B;^_`%Q1ZXo*+iVacNr
zWa93M`ZGVV$E>bR(ZKq!>l2Lqz92{w$B}rm(zVvI&%3)Qfk6G@vU~S>SxtRDkP8s@
z&#r!%i)h8HJxqb+t%v12B(|An_uS$Y#8!R2TWoi`30uCSBjWe?k)?^w;q+63P6KUz
z!VXHwVDh!p=%^%Z`FEj~dyQ6|^QzF57~l<Xxm>K}iwo=AA@<{^xWe_qY_t8WE~BuI
z`Br<Ok2wOmJ73*CsV5LeN4U}Zl4oy?Kf8Lo>3FPIMMHoA09<$Pa}qh|gt1?I;A?t)
zo=oHBM9krR>p542q^S9_1;=R#`h(Y2J?0^~v0n&SE$@tF<{?}vr*e;0vBXwU*u<!C
z;QszlVEk-!l=T(W=|y$@ugH-5Z({&0^Xkz0ANob<&Hru8&wxXx9l4YrVW(FA&zvm-
z)4YeX5nR>F#O#;eC{gi3vgpKJP$j<24K*LDdThgs;gv&TrF3^uIvdb3MxfU9iPU40
zlDil7R-lf=1L4{dRCFh}p$$}~tF~mp{Rydo<z6#EE>2%rZ-b(Dn)s{tun{N3p((8#
zePu&pi<FV<mWBNfV(;AsqjlnVt)dlmpHz#Tk)IJdd5DKIi0luLz<3$#z5@<3)yZET
z0;E0Ssr>*{)1!46)Qlm01O$K1EB|(@gcw*Me&xv5O!>>zU`se|Lx%@ULHSiG{BlN(
z(jPL~b}tAbayr3ZHvr3Wj`bIqlXqiw-YxY?!~TaQKezqnKz~ZL^h4}xsKXTC``VbW
zM|<hdTo1TiP>-CC%u`3fOxOFb<>8E{BrQXXE+}h1@;uaiATpcj!@#pdg39e~JinBT
zGHS=K8N-jr2vVUD3`?iCpU`!2rIIgrmh9=*UjG3{8CVD$hx>7JYp)HTM<Ju(ugm0>
zNK#xe3K|xMH|!XRGhbrHMaz4z^{&+;KIT2hyYVPzP}6QJldhqNHK?vqN|;z<uxdQt
z5m*&;lh&UKN7h!gzMR4@`*vhy%0G)Ni*XP2D-aMZExQ3MypwQp{UqLxEfS<k=OH$7
z+=H<3vDhVoT5qyv{A-YOE(RXg4iCi&_HN$1CF-1y36#`vwtIeirAS}_$~z&(949=H
zRl=<y5|GcnI2o^t@iB}`T=byLN(_~wfcYziea>O44bLzKae(JT)#2Z2FZ_*Q+y8Vk
z377Oxz5gu0+Qc9ma{@xBZ54i7Kw4=ewzcAcJ?-nVStKX;^c?`-N;#JzaT!mnv1g~R
zauTah_aP^-w^tx68Bk0f*u93sdj2yDB<f?xr#rjja&bh5IO|fL6H2SlJPL67Zyvj&
z5A+T(e4TSw@+^;atCCC<vk9@-1~FEtxyNh!`HqT~`pHLXeL!cVwRpvOTg$oa25x^u
zcK(2LXjLyZSaX}B2a%oW>K-c;Sz(<$bvrE}h}EQ=bi75ztSL#69(}_~p0+%jjA)9_
z_OrLoM<<b%|Fqm^lxeZ`o9@do+SU1GJt0_;WgqZP$m`n99?dHW??Wj2!)4mH!?Jll
zbbOA3Cwu7NG55qmuBj~Pa}#yij-Pz0yagHT4I|MWnobrB@CMHYj(s~BxnFh5_viIW
z-)|*d^uIUJ3M02Vb2_?-I=d}#QH+bO%`tw08A7(c*@C$Zf3&@g))IeKn{gTa-T&RU
z-cGbE>z)S3hZPFwyT9DBc}-D@m*+Ukr7Rp!MmQ&gQHlI^XX96SvS2D)8WAqTO6Jno
z9>rd{Pu(nbN%4OGJ3++0EtQP3KW(Im#Q&=~uDX_bz;PoUJP%;@$S~&&oJ+MVw8O6`
z#`F0dbdHv4(&$e?=DCpQIhSheQjKGqrVVez6tP`@KOC~%MZKB=0lC(}sK|p!K_&o(
zc0WP+DrO2M!xe3&9X(wiBc{+&$15mPb6laN78*#F#%2D!dZz_CuR2=lcvP^ydB-_#
zX}}pEkoue>rt&rPo#{s_E55S(Z*X;j<$F}=&ru2OY)t5Jx@ZctqXL);f#@Osh(Hu3
z<MI_?NLs=9sJfQAzYM?XcMj}NguZ#rwxgw*>aSdBqAW}hE!B+3V1&N1;w##v=BDf{
zFi5Bh_$psl@G$VPf>!6Pb{s8rFhTh$W(u?$pR+3HXdoFf1#f@fu<@eojB+FhK_Gf1
zTcp+dUu-5FeeAYoz`yw-3@Hks#D0F^m86qc(WTC3^9RE60OrJ%f0AJ@6<leRyn(0(
zhL)z5y8DA)Qx#k_-_*6{pjZo_;T&u!S(n=0xElV+Fz=dz+hsxfsj0Flsg**{;MaZA
zsimZEul^D8kyrN{SA+2K;DacxT0%=z{lN?|uiE+t?FJo}(nF^D3Q?Xf_{;6ZHD!CL
zD@2dVL`zdk-FY<<JDNC`on(YM$TNw2s?on_-O^=fFHF^heVoquDiEte9W=f|=Ex^#
zM@!xCm3j3rmuu>N$7)0<V>BEq=Iz`Ut->HhEO7#0fZL}M_ccHc3aX_B!Vb4rNXBN!
z+<~m(n?g&a$H{7Kc<0<Mewjc^Rh!9lUD~A-Nav}gmfqP7M|ZaGc1j=z(NYyPTulw<
z5tvY{Cb!>nTXxL<^0UJ+8<P)bXJW=M2!hd-i~*1R7wZ)sZDNad0Y1QAK)JRFmzq72
zX@jRFkxW>)*is%vGStcJc;^`b9qlqWLDI5enQlwomr6-97smxG53Ply`t=F$22owm
z6}eQL*T=<?1pz&m>ZJ5fQrLD+HTL~KQlOoRU$w!!{sd@`33?$Z83fyWS!iETyMEV|
zgJBAydpUD;V0_&mvoE#UN6Ht2JVA;`#@e6`8}T|pzs|9vCztwaw|%Ctg<zZAx$(&E
zmgq~Zteoo`Llu}gu=NR27PqT&MGtSaiHmiwF|H&J400K?1IKQHT&gnGRT=AAtWIW5
zS8`FiTET{}7vOmSAt^ogJ8Kns0kp3OSl}wd6;)w;X69`|!20t9`EQrlAT#3^t`1)E
z!Ha<*zRs3Ql}6sV)A`c7znx=Tu`d+?UF{Ch68Bo(NsZ8+&bq2;Y>;o9U4ab)AqZRv
zeFWTpv3^oHQvHwE1ulvRgwx{}sxHpZ<9QOY^ZxVu4dv|87oY&34sSYuVqX=5EN1i>
zu9FjVF7?S)9CJ*R6RVPk6U0~|EeAmc|5BU3viMVT;D)ky`GQlk_j!Y3TjypMTB9gf
z%U;4o_u1LG)Mh@}p&3ET0>w5Zk{7sCA@B7yL0=SuJ4yCI1{%K-N(e})EnbrIJ|H`n
zIsgg)>Hu)4{dESH+Aw<ctHL<1DgouOUA=#$geY3@D7{O<85Fj1XAmbquZl{B5_d4T
z)KHCBr5=<rW=GxLX@*i_K7fjUsaREuXKx&Sm4GUXiv}Cs#14ug4TTMc*-_Rq`d7T~
zGk{CQ1}lcUg)BzSR*Rm@IJa3AV_$ygqOcKaBtvT>4JGel9Y-1|MyksOA9O#I5_eD+
zZ#SHvss9Z(vwg-<=*fIIJGbNtLJ){<$rmX5-&iKeaIlg|$>i^TQ7VjZ>9%oUURfx_
zRtMI<KKqj?uvErsk6_SA3(bM^&9JCsS{yr6E^5(|2vNsU$Al*{`Ebmjo@&CBqf20^
zBM2L?!nEi)<A9}ZXN4NcMlehCWWZ8)Q^v8EH>UJ&56YDO#)I7LG=3GK00zR&B8j-7
zZuiFT2;6x;tAr^k8E2$ui9|o_#ReTq?X-8gFi!McTp9g#f!s2FugVflC&yA{3Y~2M
zKEs2SDAmyTozb!oGzZ8yJ@Ll`ELDA+=;g~rFpwq^EsJ=UDv;8Z$?w1%HqQm5=|fym
zUkTk0Ntl{HJ$T<z-yWQAJO~GJP+y_FvuS2#JV;LlacuZk_e%S{(u1iQSgNdt4X*sE
zD(_OY#m%tTAaCN1@&%Wv_7GQ2FjG*=B8gQ|w|mC9evxs4gm4aqS|ZvT8?^tKif9jE
z6J9kc@14)tx$-U*Q;ktO?Q<f>2WRJ&#4rd#(Je((X!gIcb~??une+knFJBD7tMZV`
z3k+Vc6=yq{ZHC(P;W&_aXxXTx`cXdXL!<52M1l5$LZmYy^YOJJioR5Su+!o?CPd<q
z$AgW&)RR{Kin8l=HV@K<dWW1x6OCHx2eZ#$=1T<(>PwxX5D|OQT!5(hQn_*VMv`0^
z$S8<n7Pf2S=m)7yRBRPLZAGRiuT3=iQlWL#3Xa(cEh`YklfiEf=T(@ik3QFmTB?h$
zPn-iwD`-Od{C-|NHBCj?hx2OuwSp$J<F_+!BAkof^8?v_pxrl(CCXo<G<!q)5V46k
z=t^eClR2S%T=!sXg)7zKYAa)O#W=A>RBXk|0mqYZd{LJtQ_yNBh&z~vw~dkzXz!7m
zom#4sVx3*Mx-INMYN;Mv^hZg^U`nrvGPW~yX9Xs%l2Cq4h~xL9RYxnK{o?iAIlB@g
z2w@P|QXU@De`Du($*z-AgVz89xIBiixe_J!2GUnCQTR)BbbVuET|f#N6E$*svNVIi
z@swc<4E_WLJRjp8_=4LU&YqNQEr@y7XEK?y)S*?^rF325g<gKpUO*(?FRCBScA(H>
zFZJAhKokgbQbbg_uY(S{;9aYAk^#rB)_U;;0fqpsI7<bCnN^*ua|jGVv@5i#|B14D
zF!X%-&7uJVfp*ND!Ph6sD>s3P!@X3;k%ggE<AWOOBi1bK0Sw82t3WtoFVz~u8LgU^
z7Y1T46)b`U<c$U7jWJPW&Q}%JNQ|TkHLbybz0?b>XrTIf)R<K+AWC298@CU%V}G!(
zupFB&jwBO6J7=ktXqQ<l3rym&673^jfrk2JlF^60{S1bPui6Yz8tCj~+P3zUF}Gum
z({v8!!)r@XyEi_ZoZA({APhrSDvuzt|6=`Vu5uDmOcu}qBWz<~U!n983g5n)SM42C
z30~)U0?CYD(FP@#?p=WlP!uh7;6>%{NuS6D(Nbw9Wl+E-wUt!~sLTcrf8{><5L6#P
z6`)8U=OxyJmO5CKHyDCKOBGV1k}29(pweHn8)_a>(Nf1y`vMtsW4kGumHG-)B|7u+
z5-%^;kOR4>%=Uqksh<^FwHwsw1lOR<b~~B<9aO)b;LmCqtA%X^+i9Ya{gp>)1?pF5
zsd60bK0$|xIT`3n9jvNum0DjQRiiIeWXPf&`1EHxvcd8UWm|0u#KA*Lt=gG&pBM$-
zcmkvV)OP0;Jtpe(0z_=pp8Zumja!L8@dvV&D;d117SK`?TB>-&9e*IdoSgv@gdhk-
z@3JRQlEV96Y@4zEcg-EJ3;cn6qDac;x|Z9vYJL)D_5YIE!w_(=K4`xfZ?rR;@U5zh
z?FceV;yT*>>0IS0m0wDcc5)@}q)I3<q`;{fYN;p|3o5*)RUAQo;-FvZVYpdLtBfm-
zk0@)YhD(1282Bq!L<+PkS7!#~vf?0USHvq^D`@gTDM7!~UJCmw)}8&>E~uqWtfGT4
zDbTKnS4!HKq_&Z(Q(zytib<8Rea!V3ZY%fSsb%&TdPzFMpogJ^%^p=gSCWvW7D^#Y
zMT>#JS)ZVm+FLb~3UFnUi9-iv#VS;nijE_A&Biu@Zjh18*p9y}ioTNq?KsRl_@pE|
zJJjS$k#+;^_nQM<jo$6rb4qQagFh?IzT#k+aD|g1UEwN|_Qz+RTlMAaOpG7~K`7eN
z2ICU@Z)}g4hZ9Y}H1J3810$E$Q14#Aqa&q)hN1LYz)8bdI^SOJ^1%%<g}rUJhT}uY
zYhZ&T0mX+}uA{TQ_#fxj^5sIocJfzhb!UFB(}3YnOC|AJK?TrVK%WfMQd=nEpd|;2
z@A{~v4o>wKYXS<kQ>ao)g;{rW1WM2Tsw#Uw71>(9MlbC69YduVGL+tMNM@?Fkp!R;
zY%f#+%y8IpQv$k5oo}z8^K4IYc75#)Hf;CRo>C8$A3_=1Eu@xbQ29<*O&koU9k#QJ
z)y9FDmi;~v1E=D@)YZCoSkYEk-WU<^m|e=&ZD`+JWtKPk1yG@us)Zg%cJCB>h6hfy
zGO1@FwIKry8-5q7P)k(?Z}pg?uUD~?Apj)<C?bwcVY^Tt(yjp8VGx8}Njep{|HanV
zUlO-<gT8-(jM<1_Kz1mwofmYDxP9D$>fd=aG^(RZykcMKPhK_8Pv_857bvdPN`?Xy
zBAMAPtioXQg1_qY?G0fq+UuO#x#v(|yON^woubEP%Ala7F8+#_1A`RJ5Beb&Rv`^{
zy#s~%cDH{znSsgyW?oLK?1qy;U+U_w<_A<OY#eH-dUbf+TC4Ew9$!$Uu~Uz{$`f8_
zsU89332>z0*v=)WV7oO$G8l4-XA*~cp3$=}b)wG;Gxan!&ajq;wa`-ku2Ti8_G(oL
zO5!p97|*u@1R0FwNqL>jMlBWcnL&v&>98tyGNGl?DwP=ScGwbMFy~chsr&CnjsvSy
z1k-^lRt=O0B3(imi7Z1-3s6v(qRsql4BpTfTx<v4mcCRjJE2I1+{r*owRq_AeAVnI
zjlg}o71E`NPQ8v2L0qKp4@v<FTB<$pK7&3vJGX3yK@f@#>58!t=RdLLuE@rw>4Nqz
zUlhsV(HuZOphZzB2~o^0c}i^r<i_Tfm<6cZm+GQ^9O$mjr3$-PjS^aIRpLCzTq?FY
zo@nLrZ6q06S!~xzQN$%&%B?*b6IB&1RlV)4|M&(wTKNHOFhp5RlM+SU-W^xmW5PIa
zEpeKFOI@_Gm6B7x(+A@>2$y<uK(|#+l-xMZ8yIq;Y@@Z<qJS=Z*%qN+w8S-oajD1e
zDvmP{W#6wPo@%U0Y!|rHHm+}QFOL|a%7%@;eHN7hgK??r0mc6C3b(6>By80=V7(@<
z-DfRD;&^3T>YdrA{nBP1SI3$0;6>D)n0Kzj(Z1n0jw|^BS8%DyOq^P8?M!25Y>&YJ
zmrCgCveXO>tzuijrK;g-?$JC`>OiZwW`IjwY{mSbZtWXeJ(BJm*9>r}HxPY6dkj(T
zOC?PlPu7H>w7vc7_xI%N400d_K`44AMJ?X{V$;lohiTfvxa;ai2p|PNL{R#c_1P=d
zRMs~=w)11+i=`}HWsE`Sr7F|Em01>K$VUlRSE$fSRokI(YDo5=uyz`tbNEHyx#%^9
z!rHAZ`v5g!sCGS-{5D)xK+~rplYs`M)EQQ&9z%_*fah1+gE}DnO-$5{f%yzAA)sCb
zyj6Q*dXm6PRjV^>t9{|6Qb?)%rPlF>fb>#bz^-oX7OzTNvXJ7jy<PLGqcASG)C81U
zJ2#G(SnU}}O6~Ac2Tvo0cP;HyIbHQ<sNv*yX>nv&c&Sdwr#JvfS>qYM;=I(w7&f7>
zb~fHB8*jTpCanpzlgTJkxfmg$41p<eZ$jXu;yByxT;1B+jXNKI_+a(eKA(N?D|85D
z705aKqVIdBYA-=17a2aBolz3QAP7XSR7E1*|6<K_%%e57V*m2BBV<)rRDfb_r?Z1{
zBE@)5#sXyUd#OsgM4ON1Z670}B9d{fFUvTcYl`^FMgu$O2UN^JXZv+<F=b!+xVHIN
z&p~;NP--)%_3>|^mTJ}iVC4_yjp<A+)ebiLi&q^!40Tf=yBeC&B7?f9P)mIu)pZEL
z4us!j$B+|BzZ>Yjia`;{aCO@JsRz>?s5;@5pw{LcGT2WtINJkIu)U!n^K5>~qyTIE
zN{VNxZ89p|h#AU_?dKOsT%{rG`f!U-OPxUV4hvx@A{k>#Z9bjrj<3pOWhgga$@)&5
z6jvajXl~<1A0k6>wj*ZR@gGzj-R=f%29VTJ%}C<t+M~_at980`)lwB-{mpi2sgwAs
zCYsu$b&CO^mI|-BS(%YW4OH0v+TNd(ok13ZFbG7i6s4MQ|BJN?^CzvTkew^ufIyIe
zxM8&&@o7;u5k;SYU!t@<u8`SFouHC}IZ=3fBe(0;(=}8~{7%j8#9*A;;Zo;sP^jXX
zL0sx1s+3>(J@qvXdIe5GROeEUq1QJJoH$>xm)g#HKT^Fc*y`MWZFS*Wk3sfQ2UPN_
zHB|C;*zkM4%85E26|5^}XL6u(^q(i09ZJaJ)OXTv7w@d*fKk?Nap1tEy87*dD2k%E
z-)`)sx~^7sx*t{+6ogCl!sI}|f&UVp7S$&QO7FKDQ}<`t)Ut>ZGJB~LR8sJ08B_+U
z>m$zi|KKXBiMJ1CmtVyPeSOI7I&pHM$nAZC?ilz%W4-PbyC_^Lcir#4sepV@K*lFd
zeW+x<{3@ZK{|_7~_~z_Nk{AYI*q0J8O!WVcHD!?*3bm74P8u16;?}`-L1`_Ojl^-}
z*%=C`33dKJjV}5KO4ZH_M+onrqQ_*4bD2<G?O?Kvpl6V2tv!w*@?L5MsH`$sskb|z
z@}89>&V0G-p*E2{e!;>zx-&FTcYyqI0AcS8t~1DcsS8%R?CEl-9qR2etG)SY2~g~u
z0qkgvJn!KB#E*yVIVO>{RIuwQ`gp!JMeZwxd^lLe{fmCwK~I1(OSB2IN>sBx$Fl!d
zJD#x8OeRqbX`y!8kXcI|pa$!E1jS4yu=s+Ptl)8mvH=E^u$Bs8fT9xR8^<2UAgrZU
zfWk_LM2Mzp4pw2$>Rv1U*XIe4YL}Bx{Z}d^KM7FggCmKv8ZWk?4tBX;SW8{7(q+G&
zU_+_5$64*o1Z#k+Gx(wGjFK1xVIX=X#fawq7pqg{g;Lrie}3(duq?=C!T`k$r0O_>
z*OyhK1abx2TSx2bOVO(ny{bNx{@%PkX3!6CT}FyN#JnkLKPHC{^`GsM8I@@}JC4XV
z+XHFGOYNXK=}SSucEM`2$47Eddqf%D6W~I@_DX;>P(3>+pI3OP6OlPqs|xemx(Z(E
zWK>eEc-Y_Qh4)ewqe@#_*9SBjAYN(@wF1SVD3Er%)XAtU?J+3WUXeat2d>MKfr9OH
z9=?-(kIDk{*I=OrQVPnzNk;4>;|nrg>U>mtf>(H{EF9z2^;I)a+{v`%JP)u0piJAh
z$qbfE+VvX>>B~WF#&#ZeYgS_xY8_|r$yy<6(OluBYWv}px>2UPQ<>>^Zjt7tN);Y=
z6Yd!bg^MK+VAJ*&XJ=r;KnOz7l@vLZ{TFMK%EMf)!FB-xf}(!l8%)aPLlu^$$6C>;
z$FExVD%K8-+Gsi7go34RYgLJ>cmm{g$h!5Vf-X7V#4G`<=N#)wUusv#l3;e2lr$e1
zNVHE*(HY5WaDmL@ioR5+!NS0$Ut11HMOC;OsjYR~d5f!_KjKv7uGMmYpx?)Xc^+iO
z?}Mo2infHNqV%3|-loc58z=fww`I4#qFwt#9t;wB`9&+Dy@ggh;^L6Wix3nn)f|a?
zn+msV;bC%+aWrl+azC$rH1I0l?+n{b#&VcL;Y-DX%Wtv*(?Px5K(JKv|EsG6$GT7|
zZwCf?v`;5F9hJEs^&&gB1Fhgot#~jB%pd@oIW?Gqr84Zz1{pQVkWVD_yQCV{k!~d4
z%h8nTy}(W4f0cf*n)B=^WU2d_lOq^2RdTpQ0a7jcreQs(%%!P$39D{EYScwgF=g?|
zkOx&Xr3%Ed&UH0DIP#0LGs<BY24U!x!XOQ~|HW2q<xwe<NcYz-iy)e`0o$Ji)=o*5
zjnp{hwKc9jdX_@{SCWlXt{*-7jA)y0<%-r4^n@=1_#0JHu<N>llzN*xO}%b?1cl(h
z3%9cA3$<VB(H(=7dgEX8u`E#P2?RS93bylcbw06Kjg7QNwF{TNvF!~+O?*QV!=jHW
zN6g4bN}D@MBvNZYTJ%u`50eY@vsvZb$HvJ#&~A^0o}w+P1K~#BI3l8tD(FTl4rAtc
zE^S416}xEIk1KDpIU)hR@!muqRa+>YYQr^ayb`LeP&la)WTXFcbrriHa;Yswzt5=r
zNmLHh0aX8Qfis}`5|!aAy9E_}RBiFIs{=KlIWwxd+VM*L<wfr>`=u7fw&<hw7}r)9
zn`f%{&aM?P3`*))kSvX3wva3`)u}4X=0*~MYa<3rbzg2ov5!}Tg7=`%P2#3~#K__q
z)gvfW!t&k&<@Txl36$eBLE7Wn_>3yk{;L$;q@7!?!!QU$w-g(&<Na@}A2EkCS69$>
z10z3>g@KuQK<!wkAS#DND98s$7^QlSW@Mlq2%{I01zb|s!uDq}6U`W`6<RL1q%tZs
zI)t8XVQ8O+=VCer1q&wBj8XL32K5Ogp^So@$&^B=Y1yCWC7{-#Bv5F%EZml&5);$M
zSR@tHiPSr&a;dHU1a%S&UcwY8q>A3K7P1BJpvomX_O>d$sWRl*kR810K9saUJD_DK
z5_XM31)Q@M--ww*k;5#0fi!|H4zFzZ6pCnHaQYkFn{XY>9XagKC)D2R7aJsDhds|(
zeY&b0?asVL?|XDcH1gt?!9;D1&53>o<!^f9y9HTV=Sd^Ba(m9-fbOn0A_0~^l7E=Z
zyQdh?3&S2aq*e%YZ=R~2I95AhaLS~>eijzh|6SDHvh3xhNFL|SC2s|Kib9&Hoz#x=
z;kp3Q{7H}=Vo7<6%V?b%cFyW0<9&Lv&n$%+&qKHQBJE0W7=}UEmjZ;4{{Lg^rr1pD
zv{3B<Mc|SHoH)F3(X`z$#Z*UoeTDTJ#|JwLd%n{_oldmlOjEQcc!zN>GUinDoxxQ(
zC?I(xRC`lkPA8Q6Cvs|e_w=c-&bV@)u0MPlg|>o&H_Z-=bWRC;&vZt?(n@qHANK&M
z7={+wtjwHXP2YWT0;MD&_Ja?ksR{Bt!%NIV_K&GMNYnM1(3hvFx9dO^Q!Gi**Ar^|
zjfRr+46tB|Q+j8QKG>_m+b2U>A*oQ3Dr;^<Nje5jD2}lgZ*q{PqB!g*+PGE6Q${7P
zK$>QNrYLEQ=W%PMlwLWLAwIo2QQNOHBu$l4um(LucOGey3RY;qwEwYM*)9j)?lp?d
zQSdReFmOPcip&dEos#G^ta4W8aE9LW%CNGjc`>DVjsM;sJQyHg7p{Q!0t9LL&D8pr
zWm9N31{-_AGZ4`;z<o0G%y#>Py@x04``tpf3+y~&dL|~9Ko(mM&dvolVi*LXSMm=`
z?tigXZRWAku4>W?AaDrA3=DsWT4*)UDg!dbsx#w~2{gTR>F6?UU8L37+Xb4=Zj5bc
z<;;tLeHYGZfB1r`=8WbKV*A3|oiFIzgV{2^3&(yTYQ2e~i=`yWXc1ruM`RRL>ga_r
zelub_Gd#}1-G`zEsM|)X_@5|wyQ_@77d)FyMYJe%8yEwqY@A8RG<c2_!ZDEPFH-tr
z9-RG=6VhkGP7`L@^;Yg;3tu}cgcU*iY+Ox{5YtQB3bPt_7t@L*G!tSvo7`Zs%+Fp%
zPtO#hCd71Zs+MXLnU<q!1&0DK{h*XL$Y;hXC?&wuNV0u0+j3<-dp;@vQ*(m);C{$X
zn5$r*+?>QQActn1W<)R8CqEbdFa!sWB-cC>avM{p0yqbAlp?*W=_4O+Y7oiPOiMR>
zo+&yFoD_5#o<Zt@5rqpBlr&FBg4~~&CXjUPu9rg>81kL}=)E=yzluQ8CF8z0JA>>9
zLJ){vsS!oJ|HYE@Sl_&C#O!9ppp7V00aZ0b4uV+wnH1M(+dCoA5dPzu68E|A(a=Lb
z9>S|}BS#6B2bh5CNe_&u2^Sz}6gFcx*$A~fA2AXdg#-nz@?R@kh8^N?I6zVDb|q<9
zHt!ue-;d3@PUKmHhz=dK@j#{{+kGx}ZGuD52VeB6p(M-MssTe8INXRlqiVR#+m!Dp
zN)37^#9wBRTuO57(z<lVrYQ;P9g*3lW!h8EfT?G|FUUBNKcY1+vq@WlSQIc^!V_x?
zsZ^wr0FOuDZ2UwJM?rdn7rD0j(D%cs0F5)e*93!t4NV0;bJx~own<q;SE1$m_aFN<
znzzRp+iR0>Q{d%ZT~I;Od*TkDlC;n|smOIlZ?MA7M4%=dw02qM+UZaBi0O(6A155t
zOhb6hRDx|bH@1+_s{Y-ppxS8f)#!<nCmhsVhuA7a8R~kzzs~tK5DscCt6D<K`zvll
z!O^9*&Q;nU!NB5v?kCxVgPIc=xO~E;R$rW5Tav>d47*aqLzMepY|{jZ^s$4}zkX?q
zAx?v2Sv)AR{-z>#i;#5~_V|{cP~7~v=_xH)^vMpObCuUVS`-gD7W1-$$Fjy@ShwkM
zOP^`CC0DZ|y{%2QDIOG6H*K)_73@L1#}~*|F;p>>&ee2)>Fc^j@u09j8{CwNX@d}g
z;+F-^w5zbU9Dq_`C#=Sk!mOV5B+nfz>t0}r3;hOFlINj>7TBFDI9KVXT)`LT&EA{3
z#weKl`uZ}MB14hnZC)V0;x1HrhZ^zy0G0obs`kwavqvCTQluvd`^r>E^eF*ZOPVP<
z^a4e5v^Sx2+C9A*&Cg)7V6?C0GDLfqv0kF$1u78L;{$5uD&>9$%F0EJH-e`ObB<#R
zcm-2@=*Z9sMdzyB$dwpTc-RCy)}bUhH!{#PL3fg(yU~*7b_^AeX40Lcrv(p=UwS)t
z&&SL)0HxaQCNFdqnW3FNUS8|IX(rP|+QDi=Cr){Et^p|PblrOPBtia2JG*R!VGsy!
z$^1aV{x_zlmXCXDHB{exaSlb&R$ylQIQt~iO5ztBCs5w}DKl=!>w7y)(gF`LW;@Lv
zskx|FO7}gp$EQkE?Lt&ANt<`OD++s6=-t_xxTFoXk<0IkGOw@!^JOi(qcBMue!d;q
zmX1S&tv3a=MYRv=DyrQsR69&k@$PFCtbv6=pOr*ZLfR`A=pFCwuWFA>Cep4%)rrb^
z(=vHXtYtjahobw}HYlq7k2-w@YM$gOY)NsiUMs*TOj5zRj{cGuhA(5iO0KB#3I|6x
zIM*()m-npO;MQe$h#C&3Vf$`qB>KOJ&C_!Ug-U=xcGlZbQDI}hE}{C77{0UcpHTA(
zlzdQBu<&n^1XM6d(ON+f)cmb)4oeinIOb{x_)k|)aDg?Lq#D`<<GWnpf>&wFjiAah
z;z`_OV3O)@Td~SW^k%HxTmKHKzCf`R+n%lVG*mnBhX@0V7xDc&WoMMbAPmFMD?w^f
za{r5MnwA#?(whD4%W7#DZ5`Xcpmc|_iz4oy01Q7!1*`S5?E%%uhw$>`O*zLG;BR@P
zmnW|iLPHe&Iq_{g8_z0hUD!rP@&@l;`7%f2<cyS5sW+0al9AJvuvUgR`KCabJMHAS
zhm5tB+nt8pOJ=7(p!PN6=ap}Y+2S13Rb?wiV}j!jB~_YlnU{5-*vABMFWY&C`iyT0
zMaymqa_pcrNLixq*Li*Jf*q~E={ZV5pBuH!8c?$d)tF#byOD+>JOZ@Uvucbg?ocL&
zC##)k<NpepR8?0+CIYob11kMr20`YcbH?e_j5T@hNt8;Hs8mA!W`+E%X)Y(<RC#fK
z8C9fGuQw{ex~Db6$mTAMgT~!+y@Gi1ZiJE!>`{mW_-Ia-P<|hknbUr8RxzwgG+EQ{
zWIpFE%?Fe<F2c}~5*8xM-IXj@!N!Hfj9(wGJ^uK3;mK?Bv4S30Kx!c|cyV@aNfLt~
z6x~t~6|?`1O;^Ty=$iSE?hR0Ak*M4UPbjb@bwvj@tk1GEkNJE$3qIXDWCUnCfOxHi
zQ24)yB0HFy8x8;BRp@=-$$J?KM6P$Iu;Z*&n5aonPPYp<-m#LYG<Oy>b!-CA_6OSj
z=R$A{mE;#)YaNZx&<m%Ql{9uEw_SS`j)`ZSDNs{L>g$iYOZ0WUf=j~!3oM~2By~W6
z+POSEwfH0}A*pt2P{9~{ILsK1g8keSl4{sS@1VbRrK?)OrF4R%V()9%`*y!*qnyWb
zOpw&u=|8%C7i#?VROqQ_YvLeIJA<+lBz395nxQ5G#-bH^A9wt7dRUPp=R79P)h;A;
zFXkx*8R@=-YK5L!DoO{8cj&~?a@&u^5Fn{d#NC}s+qsnYD)8im&Cndm*N0i@m1=s#
z`Or7mBY0X`AuIZiDf;4#lcT&!Ss}_$_sShl-n)ZL^g<|2^F_ZBj%S2}s-MrU5RmG*
zzOO^+B4dm<?En+@RtxPMYLS&7OaCG5jFKb<K_GgiC<=Q2i*2gbeojq3FuMl`MT{Dt
z>87-YzQ#e48UU%TRWA;Z>JxZ3uaE~oY6sr!z`Fx_$B9<}sa>icOG@PZ3kpc>G|C!E
zgk$6LdD%W-l^UixRNjeb#LV^bLpbU(@N266%~Z!LW@D-lb{iPzDjb;7%?{5z7zzw0
z|Hu&P)BNNwBRXdC_?5$XQP}D#M0-Wr*OV%agIq9#qMAWWY`ZDKV14D`e+WfgkCpY9
zLfU~>`3))*)rLCpJIqUO7cqOz&WT#Ty}EBpO%^D$DxR!Wg^<A%(Ww^0`vVwa7Wn}b
zifSh1TQg{F)AnY_uTW4_WYF9h#8#bN%<I4_e|Xi<@ZVY29S-ECm|Lw>$(riN<{L$A
z2VQBnyZ&5l?kk2?+5=UEsO)xUw=3Cw>6K7at9>g_Abkasspm!efLdxWAY5~+-+EOa
zraqV5-k37JVEeCE>~_klQ?ZrT&cVssrNSWF$*1K}(^393^TXL0AUP0%K=4ahMbQ6$
z?6$H_d$*~aBp;x}LPTZ;-<u)QgKJAPSR3mzhy5^wKvwDo6&|^AskEW@m{K4stqha7
z21j4j9*Qqd#FSX<sD@08mR1&ra*u9=0Mu&z#Z(=LPs;w46arA!qAH8xr-R(0%72zV
zDT~pRR<(z|-zmE-YF6!ESejAJA3cAn{!Yf*-wpy#S<?{bVD4CYp8~-L&Al~Nf!<eQ
zYDAzX9luy^4-OyiBTGb-5_%k*80YW-2$p>}AOxMp1Ja0;jea!F-oBj^V5iWkt96nv
zqXNnviwLmOVCY;3#B0oU_C)hCgq`Bw^y)cXYV=S1vwL(hy80QDGZGSSHX)}Tl*DQg
zq9Pi5{4Rh^)rxa6lm+)fqM;zr)X8-a;the+xunE)_nV~#U#r2_I*Yf2bCPTvs|6tM
zoL{yQGT=Z;%44RlT3`BBKN8shDXF0Yc9?CLI*sn5Nq}iJ<^%Yk6mI0GjDKsy(Pim}
zvU5RV7zBanm0}`d?tig%+VaS!EpPz_j55k@c1Ht$kj0-x@z*oF)ayGXC6%O1$!o>K
z6o6$w^?9+2!ch2AyBO4GBREk!mOEAhOO;Eoz*qK>L`+0egGv=zfSo#-l`#7`%+~Gi
z)?y$xF5Rw`$zt^BvBuD};#=C$hv)`hjMcHM#0EEv6xpUlVK3SC&gI07oC%kgR}95m
zQLjt>jKl>acHvQVV>=?j6PkWd;+|soXmj5_lQn9il966A>iBk7Yn#9Jr5qbmqO|?z
za&Keng_H~!y)RO+Hn%E8OQkOy-v%oy#^-d>!Iinl;JPa43dH{>D^{gnvZ{ung`)zk
z{=^%+Th_RR8!UP#5DsaFLpn1<GDLRYs`9S_+bt{E6Ic7mhy@+*?wtkc-#sx<L}d4G
zs9b@Vt_$xernoMRl*tOKQbK)JEnVP)vop$a7zCl{mKuE`+5g67PFpXhPBKdW@^ufQ
z(L{I<sAG2fd*1Q`q*dv~3}&sWa|T-#CBbF<#;#?romQonsPf35#*R)Q#bOpSSTm@x
z+KuAPq7u81_iv&4MYdo0&R33A$6wTuLY*_J8iDPUubft;GTy<FMOsxjN!K~=PFNIF
z5l!|Kf~_4?xwlFl$-6r!K40h}Lcf)!&IjzefVxv?S7MVPSo?x*qeueaCQy}gP>&4C
zK#5?c7+}w!`hQmCeC4y-n??vLYZZy=)X6%>F=3@rVs%|e%C7{bT$a@qGuYRtV@CZx
zvGv7u(hjQJ%U<91ZKFb9ie9|M0F^;$7EQ)tXeZIIjW!}qVD!~<>eKBh*{f4;*PO7-
zSnWD{>{q@<b%e_!$+FN=64|Tubsn%IFnvneekePW9EM>Kie4!gY?J$6td(jWRZ|Ij
z*VUJUC>i*}r`!3Ahspn(wFjajFzr0`ajF5iWXw9W$`P3UQD!etU6)!y$#1Qea{O3&
z?y(vbNZ|rA^7K^E?UrR{HHt)d&W$01z|`WYPb}p=G26$e<vz}8)b4~rdY(GD+S1z_
zGyrO4)anolR~Y(A;Fk;ha;bS79;;EoQU49l88Vns)M^S(*WEak7*@^#AysQmh$}|w
zP}NQP1FCJDDpsR%A=8IaY!^9@8!^<b`IeeYhv+L4Jt(`<?fz&6u`uLvy*Dn9Zudts
zjFC~LcRl)uD!s5^)(+c`VBS_6Lwl@8SFr_vwgA>A{*C`&tVhY^B}!xtLa4`1rRa5>
z{=dwW$RFr6k;C!a1!@6&MvNUm;klbo+y$4#&!(}DKewaE9N)jNa^85AU^^NlfZl>A
zHaZqaS}%<}wxi!GO=Z=SLtz6c9@%eb_zef7glco6P$a=j()yer-IjEM`Qq#hkR1j=
zAbKUys(Am4HB+<CPV(nVdVnx1A);AW_NFBDC4sKN<t8PL#(PP9M{YM&Jf)BC_=+ll
z9(a3_`qG3%ij1COQVjr#MVVo)m9t*k*EqPiQJ2clNXt#@oDeW%@;8twUBQe)s1~r4
zMMBC;$$o=WE*xYTs@yJP6@j;XT#6T^PN~e^$VvGbLYDhY^Tvzv2fJCL0(?)fx`@$p
zB{K%f%~bY)pZbMkEtI8~HOay}07^44{O0ji_3k_%k?hFqu9+ByDA(j$Kg$cG7r0Tj
zx&~p}sopqH?Q;U;C=;hE;^{|9U?=y0sjR9C<-Cs8TVH?m_U&~pZuER?g5u`44zPiX
z5#;EANA9TK+ZtCKK~?`jW$Sl%1XUAF&KPW41E=wN-izdVLzI+EY-D1yC!icqe|h~;
zC=9%wKxIFzPc&(vv**i{!Lq#eeIX7{I_L$!)Mr@_P-PaFF;%V+8bfsk`<t_KL2eiX
zV(68O`HA~qtW9FQP15PG$pOq@4aTtgEM=TQR^RM2!R~viTv$m>xpRRWC8GTkn*vQq
zRgg3jarrdVK3-2IN}F?`s>p*y)TL4rkYm4yG%j1Id<w23F{7w4n&TETat(F%M3LA`
zX$}6*Wlxa`zY@Ptk=NK*0w*9L+}}%?C8Pigspxl8@&cFrvHc+D<CvUV6W<E)yJl$A
zr~%oOJTez-%%cR$R*|%GM42*!69%J83_@~Dd?))ulnK%i2bPntV<A&(3ApEf7+vi0
zLoAUPh^QB0lOK&+UoaX8g|9@rI@e!Ep-EW_6G)<hZg$k&Fn=$0XhCA%P0We#-A-KA
z0q0KF!W2@3@A{kbrpw_svAvlUjV{8W;R#h>;*V)gG-?<&WPXB<PbkYmpteFrFp&}L
zT}grsm5W&dXc3Eg*HdhVns2Z62cg`{S>RHDnufR`1j|6}b&Xs9eJSeP=k+d{jgA&z
z(?AnbMJ?xksM}*dl%3g;12G6hQ<B8Ui2M`t*4FUa{xM7f)Eo$1biXe|Z}v<s08|aG
zZlDWY2gErikn-M++Djtx0`vxe%$v1wkC21dF&d#DjiS`?RG)mJJnA(-<OQhd&g=Do
z?Z%O3G(y4E%>rO9I*c|3wMTM58--PJ(fIuITZteYgqkRI=96Tg-F*MxlDA$kFF<Y6
z1b+mXz}>U+2f>X72R#w!(u|!!-9Q<WY^NkFNA$CC1F4TQ17)Z}c}~FQ(rDBtVu3Pr
zfUOw0$@p7N<0Ua0-%8oe^pf@gLa+B;P}$B48e?$aAl9gR07o~I%*!b<CZu>>_t1uJ
z`mgo|tOS6nVI~)7Lxst9x(#7l|Nn|A)S|F&(9ddI3`r-iI#d>RSLu^aP^<@ewUq5}
zUY%r+AgL3IY!56vvhB^UbmTds?#v9dp@WUSYd#Hs@CU(;j@;ncSXl3|2p*036m2MD
z&{(|KP7Po0sdDk+d6#-;(*l0p&Z~n8Q`%4l&Utfo1~?LfAQZh4DvI9!V%y9Nk4c*e
zx)*3#6s+R=KZ;CV`d~vlTDDk`3;}D|=$foxLr07tbVOiR8*k+e&>p><>7r3ry7Ys^
ztA!3@LDG@K#5oT}5H?hBFlF}<x*OK=%Pk8w^c|tXxYbXDJXU$)z=npccvmFS!ml^q
z$Sn9!0biC?{ue8Z7@gVhNa?8KAOoR8zm4i$g|S#Tn{2$(dXyN!L)esL-dJzIL(#-)
zEi$l1GUpRi(HwQHjMllkBe-?ceDA*$4%&|q27Qkgpuep}umD7b5j2-UQk(T)1XUj&
zXn6Tyb@%$z^ij-pSSR_~DMdNXON`#Bq7Mu9vT{>)r8}Xr$6T;#_wT!MIsdtW5v|ki
zp}Go0KY5h%b6Ac}XZm{aMSe$1Vs-x6+1_}kkQVQd{Cs*rh<2reVj(_DD(CRU3Uysy
zwwj=`)`UBmxyJm$aFjWv79QSqGN(FPE@3qproR(zRW}}mmP^q`{=I+UeioQN&d$I%
zVh{#`EeQ}{`fn^hN!TN1Cdh6;<M$gOPH68Q3VU4{Z*%jiU**A4u9!(P1Y7-ODA8QF
zRhwWSL5!_|1GsEQmt57i9We6RH7jaqOUBus{DbYEy#D87IOlbSMc0KR3sV80&ueft
zM3;Tpw|zPE^BmEN9+6Qv8ato`Lh-G08KGR5y_$y5&x^TjkS^(#%Ton(%h5!*fTq;*
zyHK1?C%H(JwFV>TJ8vCB!E&*5r;s@pVOszlHt2_@j2ZZBg#AA0PpES`rXN~?AW7rP
znBvtlnRQ@7dcj6xTw8X;EuXFW29u-4=moHvPdQ|9Sk35u4^?V=8H&@X!<ctods8_S
z_<_(yc`CG+(s5dhh?t!shOtkXOkp<=3q{3lN_>^XHy#{xXJ2%34$-WtRPlg#GP|Om
z1Y?N3R11l=Xkgo-Eoz0rLqtgLaUjT`F={$5@1k5tNxRA_%6*Y`1~?LgAQ1c#BZ~I_
zKX%EDHnY0B%H0P#YKTIC(9M%?4fsIp=j4DNNZC@n3%u|>lY=0aA4rw;io-Y)i(n7x
z6~V5$rI3UQ9Y?DXsX8M$BhWGNg70)-3T>9sd+I}?sCLn<6utoHsu2J^5~M1ulVA*(
z+vRS@-V|^x@av`=_o^Z!6lsp)J3YJagb3XmiPBCvehsuS2K2ch2YwaujC!9p6+#;<
zUqE5-tn77~$#DDo{E*{wsw+_SF0na+F5x#iW-0Sr`O)UEoD&TpBn1)q48B5`7s9lu
zCU#@tuolZKo!UCH5N1x_7(#S|x^V20|H5D(;-l1^qLq<L@;*=7&>JFUi2?chCKLlg
z#3R%HVL}Kqr+T#&!lZT_FGH9)eKx%GOay=5)V7zxXEgMXI$0Gnr@lcmzxMR8svpwM
z00%-427+H|LB#(5W0#z;tH_1c`@jY&5}1W$DW&6nxs9gVe!04&aG7rWep&er#u7c7
zC};J8Hpz=w-Gshr(!YSXiIO)aNO7!(ItaF&Ch)6w(DeuE<CH+INyjAW?+$D!b^K&|
z)sOZ}V45o8y6~{<_4Da^0)=Tht$DSGl#ZjbI|ohNEtJMKy<~(Y-7;-exy{5O2x<b$
zbW*8k(XmuVWW`SIg-8DO&C#lUXB5w#WfG<uX;XcG*#i-yA{vqEx9DJa=kiX7_yxX?
zaG^k{eJKUIbdt);P3a-UA*Dc7IvyY^mT4ia*Bp$}C0|OI5^{-j5E-LA#j%`TP-=T^
zZ`!O0qjYgv3+I|QW&wECXRu4Jwc<~+N2L0pUC^@!({s=>6J+U5%nX7!2OhLDTKz-W
z8Q@3^!Z7el2?PrN|Ja>Q%7ktAl=K4;+fBj5uKihx@!&CtE0sbSz=OK3cu>f#EeB_?
zrKqh3?oY?vsO9YmS=z%EQju4+c>i+f5@e|cg{zNJ`FwW^VWjsl>LlE|F#FtMPkp1<
z_2t*)J!R46*VCWb0e``td5bfpeH!-D;HfuO&s!`|ItK8{E%{)z3V+}F9|WCR&;kew
zJ6&(jP{6b|-3e0~+2zb*?U={5{FQO8RPiO)^d{fB%t9Tkbfcr7RswZaDuK`^`@!a7
zE3`oYEjmxCelRFL0-=Ly`JHIs!svl;4R57Buum+NnglHQl8_I^saGk44<n;I#nJKQ
znuwNm!FwAM@!8Rt`2k7*se{h3TyC_a$MrvN1M){%R2L>x?-m6^s_=e;kG_uyRizZ0
zxv$D*&=+nOyjtPh<CD?d^d6lNc^7}tBWWq~6b|1HrZ|{7IPPB9THr`039<;rY_Hhv
zevgJ9%FYFeVGsnOSBgc%-2Y<jB;nC%(}D-c4jMnm0-Hg3d{JUqQ6axY)TJ`*_Ioj`
zLb;1>v=YGGXl5KQ1%Jvp((XCtgW~TlG(8;o|8s`)vgEKSxR3}cNxp5IA#DwDPK$&U
zXG3N#=do|jkhVr27CJPEzPVHROgTe(2c<J&c@-!>)0^i5G|InaW7<dI?sJCp0yv=P
zB(K4SNWPiru6qKUPzuyz1<J6h!~EgJ>b?R+hh1}#NHiiz2GHDJbb53~__W7D;O|L(
zyf{N@-khKt+HLkGDxKTp1nC*oZzPGG>0&%U3a?t{N3T713@_xVmv-MI>t!F@fB1M3
z5zoT-`ah^OtMvEra>19O#!X#K`>d-eBuu}c@X^sc6s0mMl8vMQHUB^jn=4TJ7t}!9
zc+DypQnF-kwXufei@_OEjfX8tlbdkAYyL8VAf*>zGy%XRu2}T?>dDy|B{>YjF!V~e
zU@-T;SUZ{ZbDG`O&i?gF0~E*@S<)L$7t-=H+Bhmmt|OISNT<2U$}bn^M*p~`W;<Qy
zg;jzu@`Stoz*3xC>eqtjUs0z=4YxLn=lFYrvTsQERIdCK2RVvnk5hb0_ORuoDJA%1
zhMUffqFo?I8CA!_;q^=IjLMbL*66-i{o34hOf`ifO1crJgB0A9N3;ALT^eo|-mo;L
z*CA@?W?O2Ew#CU&U7PMTjm=<ppeBVR30skzNZNTWr`ZBIdLq~U)jzt$$<Z-;Ob|H+
zCL?_opzzggwC4%BSz4(IHJb>w7mZPkSax5lLVYX9N|iSp_23ybf@j(&Ks|_Lm_QAn
zuqJE;D1TwxBSwV;w@1jl<WPeNZu08+2g!3RLFpArjZ(Qe8*+fAQ1kNy2abXVXbMH-
z=;q+~_ht!au(a%Ug;I+TJbfY3^W!Z0^Je(jYt?<_4C&C2L?QE$-k+ph(G|oX2wO?e
zsNH|DyAKJT?JKsoKpxd-)j;3}#>1|%LZN##FUb(wgC3$}J2zyocns{Amo~_tbnP;G
z&>?5)NC7aYc<a-1GC<RMkylV-D6ENRKT+WclqUn|ZMMS(RJ$FkM^W{)d}ZYGEQu3g
zE59$4i%0!WDEjJx{z1ninA>ueSQHV{Nwu<jDU^FVHG@>*<!m~sR<_`)6gS1)$&YwB
zXLf(#)7})7zo_m+#l2neFBI0Oa;Z#tkp2X!(rSmV&xuhb|Ix=3HK`QSVVlNl?u?ue
zpBYRly@EoYD7wKbc7L&JNfT2gdtw1gY`=bpNu}t1lJP^4r&M7B${mi3qVNKiX{<J&
zlu(&a<<$(9ybk+_MaR6^a*k)PknOxK!7A#<r|y!$<WleofG+%{N_z5v&UR%~`4vS=
zTcNJT>NJBN&aMClVi1IV3B48c{~x>LGRopyVE2IrwR3<_won_k%iQp)VAb4EwEblj
zWTj}Z{Ut>~$pC-Of4CV6Q2kap4GyumNKq7`34b*0+Bidts#Sw(#8Pk|5pC2gr<qL1
zAlRP!SHKFj*V?EoP;XE`-#`_tBHN?OgR@%2J!CryZY^I<Z7@&70Yy-7(EO1@Ioqk!
zfD!dVh}j|e2`br6oiA|PFO}1IZoFw*_X_6G#LK->dNPxNi6{DCRK4$o3t1^Z`XQ8u
zmSDN8<wLV)Q{L?dV;t8qGqLdo3M&*Y<<36Q@CTYg>GJ~5Q!Sq$b26OGW-~&7xR7%X
zneC<4L)~et<$t49teO<5kyUL&1@SrOdu7px#6Cwa^N3a!%O%EVGqOF3nfx8WB*qF$
z!79$NV{?>jY|3|vV!HvvBns23rNtdLU7(8sPY^-#AJ_SC`X%jLa2$p~AbKT#z{K~z
zSfiDAsI6P$?gd7K5P}UeJjYc14eC4PuBXX~H<T?BjFMpbL4q;vW4z6!W}#N(xvGpr
zAk5EJi84fA_LET+dT9_j;e;Og%Dbl`gWgo-Cr@0J#I5$#URMW-4D$NmVjvOg-afqn
z#sX@bKnbe@`+uR>>NN-kcl+rBCJCmt57CP%26bs|<n_UiYfl-e*Oh|mmWZp##ei4G
z=4F~iTRvkI3cL%e)YJ~FLW9>_K2B!L*9>a*gxl$#T1UlYhG40lKzX!>ETM+7g&~P%
z``U{Ar0Uz31SR$RP)NTkQF@@rD-*Y~js!aVpM6^>PN;=L2`k<XACUc|SS8;4yw7w|
zJnpNQNwl-|VdeI=XC72^d4W=s`UX|@qutH>s3H@(j`86HNq_$aTdA*5YC%Jx&`ykd
zH1?A&;!5Pf*%=@?5Q0GPOD>}5|38+!yU?VPT*2-KD78R=!I@1ZVFgo+J8sXd5T}_!
zcKq`lEHwr5wENZA`wqG5mNq_C)q)7u?8>S<XGiZ(0Q6*f?`oCK$`vviZ0~!}=QA{1
z@?uxOQ8f~6qu2%N@2N1<7I0K$cuSozWrSj5E1cEQzJ&86oO?Z-1sqjZxM(=Tl?@*7
zt0O9E0dX)InzLJ+ruzRIRAga)ji#o85{3Z;bR<@b7pHJm(DOpu9k*4T-C_$UY7m2l
zki5ODsc`6?$Ed@3V@LAAH_V)h?lgt3FWQ*?NElz2t*<<6KvBs=yGG6ztW$*zI*KZC
zFn++rhn$2Rg$;tDYFl59eO_6Wyl?QnDU_!t?@iNN&fqAjYWS7&%ZwS5iYvcEg**nu
zspin9LE&h9<q_y8s;XbdPosag73FS94SJd)kBJA>-y21Fx@HP*f2q3&oM?jOf1E_n
z&G6=`F#&7nn636U6aV1s+;SiWK`6SV4xrZkZ)}{T91_O_?Vn#aNGOk9ffW=is<9`k
zveSn>i(67@)TkF1{9p|2z!+3!sK=UKK<VOwZC3jpl+hsJ#F_cjhH;|q+JVB_{jKRZ
zalwc;>A0vaif_M>%6afoA<iU!J12^77m^P)7j=e%THd21de2Zp7Lr;9ulM}<fxx2D
zdTho_T?=-8!!sDx&f2LOA(e4MJ%3Fk&Z4f=K2G8K^5_hUsxb~e)>qKO(>L;CI!-Uz
zNtES0)k3P=Gr*!E)j0i0)g<p<6=zW&fLW?`A{Ex|6Tsg?wHc~ZEAMoLwNqGD#r07Q
z{vuNf#e7~3C>|!o?5UocsI#amsBuD9Jr7>aq6$qerY!5KQP1ZMT~cHbQi;y7C}QJt
zF8KC~1Tt!g2wod%FJv;|Wa8h)8B{^-hT5^K=!?E{hg|A>!N<bR?P??)U((JfM`93$
zp;u}Hp>Y3;ZKa(&j~FzhyMO(%QW|K$v3bqGp<48BDH<%Q@@h5gZP>nMa3py|RdC_2
zvfxN$ds}6DorgUKb$(5TCv&jb47E(rOfn!qMUQ^ZJQ_%7q#TI_Iat)ybgo6dHTy0#
zgGDWzwm0$M969xoh$`0h6Dy>G+N_8J82j=A0qW6#3TDuKU~|3~<yo+(cLe%^u^;T=
z*PMeIGnBh(QS>}LQS}9jx_ZG{no=|Y71@p%nd58L=ox4|vByDz+JmOLL5*SOFnX^|
zu;5V@)%|qNQC+t8%QJ2*J!p7)kE%S0%8BaVP?+@6DcaSOc`4iX3$jdlaX;}`WL}`Z
zQ2W1gFsTh2TjR1{)7Ci?)R>Sug0p8p(x4(U!h_KZRuzeJT1<MqBXJn2tyB>0e_WXK
zo>+Hlpj>9g87Mj*xu5qvD$#j~p{gVRJwd|0!tn|9!`a#3Itars_)6rDhWlS^6HocN
zA*P0R0V`!$X>n{9R5ru}n(XUbcFp;?ier#BE+xgHz5(nC6@lZutOY#^i)u_=1q1R4
zgVU-iZ=mA3z+P2#L)`>+UJ=#RDdx=bTtUI2?)9B-Scz0}l%VHKjbB2QwZKuKAx;)e
z1Va(J)_f{Srp9ePO5?r@Bx9}z1GQMxyQ<t|KK2IG?Dm4<Y~>$ktHwJJn_lrL)?^Hp
zv~6jet+44O4a&{P0G}T+JIyfnb&OCLm73b1R#j!Ap}4au&5+}G0(F#Wp3SYVxRR*=
z9&5uNn^wK}gizJ91zNGFvVAOY|IY$#(@s^LzA~(O1=|A^bl03iTTsp~s8^_G-EOd`
zWS{v4O}x$g!4A~^yQ;|4Cs5<}vw8|u-Ts%Zcm4<KQW97|4`1)128(L&T}0dLNw;^P
zibcJv$_)-jmRSmi6^kla)Td*o8DR)7zTSf`(#|M1Vi*LXS1Mo}`~DYeDlLy{l@+-C
z+piJp5SuW}_yZI*I~%fYj)|0z)<Y2{e4#@0JGxKdj)0~06ATvhDXO8rPUpt5hn)sT
z>QLHXZn??q8Y(Iojn>Xc$58oVtr}Zj@Tm6_91l^=lc*L^`G2AIdsKIIlzBA{pirZ7
zRkS-@ZImU~sK@XO9u=r5$UzRF6e!jTiX#O*EvTs55!Kzlu6L*@_3WI%qdr9S0&PQ4
z$-sn53{sB8D7w_v;)WXa0cuL}^ShA@q0fW-bS&Mbq_ud>mKbVOnb?M4?l&p6r#GUC
zY-gG%orDh8%IL=^*K5QWo;zRjKYfuBifqSFQ71hH?hg@ZKxMYG$t=!68UvlYf=4Aq
zJtd@PDQe?kXZYKTW9d&FHG{?6$JkipHXM#EcvMNRD`l3!Q_EPJVHiBB1`BrsEdF4e
zI9II=GFzXcdL>9Z8NN9?yBr8%5D1@%pH_SSi>+DZ!*n;n`sUMwVvAUqAu^e>#`J}1
zc?P)?tuF@*;oeST%kCLPb2HQnq>kE=epRL&spT20BLm94C&0H;G{ok;o2)=3KhI~Y
zJoS<uK`{`I(Q~hT)n=<Muf4D;G8v)xIS_ad7~xwjQDsp_75eRu$Q+TuQS*`qNm0~M
z6Uv2I*o#nOUZ6`K^8&YeAl@+8r~;q(Zq-<@3i;m7=(*QWvD;~wY97+2i@rj_SL2V~
zDV;frJ6&o$QiF|}#Ma$2{n%Ha$YdCL3t97me+)(5PGw2sg3eWGY^lZFjZvrg%1|d-
z_0|5zDk4LSWqxKAv0ah%QvHF_T35rUqta>E{C02%$aNEtQAgEa!?o<n^xjsiit&#g
z!q>-Be7rWKU$$EM#iEYdk{{%7uf2~2x5Gxo?blLYERf1lkTr8NtU~qq4W94q!`T&G
zK@5Vhl?tfn{)=6I2%d6Jyan<orizNmHyLud(jcm`{x~@@^nh2oracGcY{!n?3&<;q
z>a#+HKTd`WFgtDTO9HPHVw@D6wIW2JhgY9fmwSRDO+cY;hyFo<u^KUI(Zo847paU&
zhVcm4p@<Vvf$fmiV|Y)q?{PSh_O?UqQR&&(aER*fT-5@P*;G`0h5A1#upPxVqxHMg
zo3!^Q6IBk10y5Y-*haa5;=nuyE|<P|oz<oVg1+b#C9%#Ol4)j0KtZ_Lw7AG^ka?i*
z<J{#W5cG9NWwsWQcee1FApzAks75|B^qUVfwi90Bz)Yf%_})1IWo#!jYXGViKY={=
z$cWvgPHC5ELhcu7x4YCR?YB_0s+dnBsQx==pzOR|5EUr;j^(%*LENPVPyrb}oSlme
z!!QU$R|+u@cmKsIwc!y(ak0C=38S+^_#8i>VEdMA-ybMC0cB&T^EOUHMFvtMWpR4w
z6KtEWKpo?kVb$%)_Gmjr_|^|uxj0OuN={Ru#f4;}d)*AHQA-tS^xBO-FM|xV>bo+L
z`knCqT<1>Qo>5;NGw24}V=DZ#Z$E7bK@6**+8C-eX1t~jh=w)I`+^LiWHYQyKn2@(
zHu7A4!zHb1HI(0>RPsZ=26fzdrIHy))>-d9!7JEK_;Iz$R;-G*T|>I~Zz$HDY9~}f
z8GX%H)KZVgKx$`!L-&Nz8Y<ZChy-7uP=E9ZsEFIeGJlm{XOx`k#$iR-_W{aivYvwq
zwrfOvqA_x-l56hk&S;g)Kyn8ub0|ugTIWTTnN&eQOXyXTmUBy64b{h1UEMxo)obi4
zYb^Ab@fEdHp;xW-*ZqL*zXg2WoSjjU#2^SnuM`l8d;g1VYBM}$lT3;8m#;1`N}_Ey
zCls|k$YM|ben;1@b5kgTO9iSoI<7B5QQLobgDn=0B=0=G&tQs5FD;nj7I{PVzU#c<
zj0KmfeM_jgz2hk8Wv;U{#cd#VsS16jh;DbCA6ZyxQt3{A#`0HWxV$e`NN}Jk4nhHo
zfCF@_B!~h#PHXk_9Z<%v3I&(?5Y>UMD^T+J4LY9RH7LC$2&uO?8F2P}Q#4|g<Gs~&
zmKI#9&`j0%7wru{JS)t0G^rAP1HI7=K!QtkFZ>k2r9MPul1$v3OSRxqb>H9zX?Evy
zwGt~tHSTLL4xJPVyR-(;q&`5sPlm!8wCx7vBP)ZiK*6OBI&!ix5t9`ty%w2Qd|xEk
zK101yEkmVCm|PQFEPctP##rUB|C?6@D8EK^Jn45)#V%FzJBXOObv|D6%Poc`^)y{S
zpngd^1Kf&17=~U6nh@yyFScp=eyRTS7tk&c0YxQ=?KnDqcj5G}YT}|NmfAs=$gko$
zSyf`GD6lQ^it3?{Ya>+ud{z#h;U{PrN_l%@j&&RSMYF|PBPNa}wK3s7XES%_p|9mC
zjveZSQuev3I9U~pU;lR~s?^v1Ru}1hA+uaj8@>3LZ;{L(UoCV!_eLOW+>^$|iD&j-
zr=fyTEh|AJA!m`I{f-2pzQ#!;sJ>#gOuR;x;}AJFDqVr7j{{d?oFC3Mmc)$Hv;fms
zS)nA~g>(Jkgr8b^iTQh==ru;-pr>kO4+S#2dDv@tiU(DxQnO)<h>OmLs|9`@*@MY;
zj>>L(+@_7~2|I<2lrsT(j`-NwpNi58kh0|!AEXHNs4~X|_3uzo3#c3y)Qj1XO~u2o
zBp2?iN<;xeVyiB%i6ON%>^EG%>5!&!LOD)9E4Pi!y)OBLT(fR^LbsnRiCeA&9b<Y+
zEy>3k`HQnN%8?)hf#{V`K!^KZY&)CbvFXW<+JF63(H2oDDE<Jwt$e1#ocWTuM#N#T
z&i%4vOuqqLn`Ld`$(PavNk>%<)cLe=SxLI|b4Zs@k%PG<SxU8rQmvsw<6ub1l}6t1
zqjS?VIRVOuiy)HKGR8luGRfA3zJ_)$P_EU38bxp4aCF6#67@us(FBpK<{P8(k3Th^
z{qm7OEZ*xOQo3;=kx*utX3*wvy??9kDH&~8xrH2ALfrOCR07P=cA?<3(G{(YBD09-
zZd?nH?M3g}ggCPbUVJT`ZAp>_#e5p%_|s&lZNxj1BLykC-GQcUFj>Wrq6>)Fylcg)
zUmIiMHjbo31(_Y?^DU@xhjJCJ23h3$3%Z1w|4;C}q}$7vh8~#@pi!v>D4+MW#Gujp
zG_qFl`bwIhN14KMf(}C}d44{JYIi8_2-NkMCs6owGaii9k(GD)njv-3uTVdnT|th-
zAPoCb2{knT|Jb4}b|iL3fw}b*d7_d@V;t)ST0WwL7}86OgOno;G27okh0my9ex0Cd
zt9$KuKeUfsb-}QKie+8@5Ho<u61PrE+%yz-W?YnMf9t6WGNes1q85@X(`2~j-;F5Y
z^y|u%c0s5bTi#PcJ9}MrmoED0ifd!7=b`K`sv>@^9igggsQI(rP|r!ITQVZkvTJVh
zHrZX)ob`jePrcO7sGgFmn4zt`UE^F`fPXrdM2@EoRCKkL@6oLb9TtP(+?E7IrCr<2
zyvMm=XSLA|fdpxzhIzzP4Gs0(1}O5Q0ct#91=TH=7lQog46vfAC#Y;q`qz=PvX`MC
zTba{T@l|)RhtAFz7PtO#s}ztPh4faC2)(_smS0r4^#DkZ{uc@s8tvSs0i;LA7cpl+
z7KL5x;oUcK^{lySC0hTm9@xp1+8CW>m%{ff?W9Lx;^~ZB`OMn8kzhT6Kb)OGlEfeg
zMXwYQw7vhuCX4V$+0KZw%jy^6Cn5+epdfpAMAU~KN+t6Su5{IOB&4bfsr=>b_}Brj
zJUwb6kb%gV4mnw%{l0^TZ1?nNKrMNd+QGgs9GS_GlM1#s7U<Q`_ZRMQPe?Vsp<W9N
zweM|^QqzSwo5Z`#gj8B)sQ*hPKy`G5R1##^`yQSiy&Wlq3=G=fNmbn!lo_R_e=aa5
z6>M)D&YpJH9`EZiP&n;0iGLf82P<UX3feq9TB{O3A^uf7($sC=LB%{h%1n|vxXnvU
zv`8E{8f1?@pF1Dg?EuQI8Oo%@iE5l(`<sMkM;Gh6(Sx7~B)^~z9u{**JUdyRo!mm<
zvJ)X<c!a+H><K6eO`|O*-B3%Ezm9~~ZHBsK39Vy+S3*}U1Jx3Jl8r*sS{Q;QG5-(u
zG2zEN`OzQJ&M3KI7zCnMiYx)*{ugUA4G%|c2if`a*A8N2gtV|c0s0Cho?<#17YP_r
ztoqyS8&*M)0`>CR4Ja<CISbzXmak|ub@xvf_}cA;M5GTw%!A}=<7kE_ojlfimS#<I
z+EGViC9oqle?0Iy^ALt?tWW=4Uq4YTb7OtB5L<mxL*FvO)Pog-nWuQFPt(;?cGS9~
z5>%=3SbsLkE*Qng(;0Q|_o3Qq)Hor@6(rO$;!&qtcAsa7Lfv{IL6usbHKAGg{l(u`
z&+!o>gBc`4G-eEvp{Jy836)X36JC_FCav0l(iLhzw_Js?UtY&5ZK;J?*Wyc1rU^AX
zn^>+vIq`FT2*uFTAEnO*=$o&$wpGxk$_Vk+xsMzn^wjD$E1|>GQD?#^CBWFRk#_`d
zniYu7q=(ZTVh4%6PC1T89k*oKG3rVx3EEUz@TP($miD-tevx(t$q~aK5d4y{1%m&7
zZ1+NwO6)-G-h84EB?-)ohCR888F_l+)sIk(yvn`qS@_!`>MLo3Zi5mH<TOyY4md{u
zN;a6bu1>iQB|Hw&7RuBUQ;D4#C}rf6LKUsTe_)A;rviZqrHn}Z*=@agsWR~t#8XA<
zhRI@Y_46_{uE+Jgzbfec0gQE1_{+^dV4ou5-)bE=X;Q88ywr;}MtA5cjrm^rUV}bN
zh6=%k_gDRm^m#e4Q$5NOJH1}+4URI<saKmRnMZaJsevg&s25Wz)#^p}{_2miC3JeT
zzRN4s^zz8Yv{Pt^PG?ApqTVAdhD@)^{%fkp;1g2|{O4Os%(2d~1uEx<>r2jVfd1r-
zM-$Yfr}`Kgy(^F(*zhT6P>f9ZlTRjj^jvx-lO1gHP5%X;v!1}5eRXD1h5A9E&NWqI
zLnfx=w^u6ip;za#S1KnNtBci(vop$p7zBanmAWX1_rKV7cgrJb(_r_{uL)9Pkpbod
z#X;vG5(P+_gP)}i&J4=b$u&BY%yNL-l2Llz-vRK){_N^?xqQGisEl6ldJfK+`2p*r
z4rl7hr9f4xXTMj?LRfI7zxv@X65;2T(RKZwF*s9K;sg=_4Q>0C{lS@f^xtYq<h;l)
zeTKu8P;z@f_f;N+StD`OQK@1gtF<mqT-DD|`m6i-14?hd-@b~gSn8T-V>+))(r5AN
z9*vQ@-4|TNqZFg~(IDwNdL0oPjHySlvt@RvF_(M^YM!AKLD&Pd9iSCd+iv%_uO?2f
z<Dei+Bab5yPw55&D0S(B1zVap9h}z_oOW-IJi&>^y2%0OGJj~1(!3icg-!dagH(ri
z2%BD!Oj1W<1u1$+e+GQF7h<HE491dC4ixIp(R4Pnr}S=pYeJF^VyS_;$3Xl->W7R$
zl6pLkb+h!<;q^CVXOzP*48qVWCA5R~{uf)d!Lu~23jOPsMG~3>>_AxKx7)d%Q>j}}
z^k?Zo*&nMaJ|3t*_ce#;MUv(WO=ie)h6-wZae*Wa<vnS_CMau!GLWP|T|tfiLisit
zR*`n0^qi_;oQM9v^==1AO0FaUEYlhfplUmhVA_M7%9KrStRS5QD(s7c9R|^gHI7h7
z(m;DVHk@5idk1RX8g+eX($~IDHQwz|JX89fld`b3Zk*tdq(CKrB|yFNX;_uME;0n8
zQu^FB3RkBWKp=P+DjwblM&U@K?&#@W&z%a6G^$;NtDd2$r+NnpS9g4&M7-AkIk;v6
ziUvsoB*v#+xs4bZiZn_`^AZ_}O2He7758~-R1Ud2JSXkK!Tc@k{Ha1Nj(c6c--{uw
zq!M)xR4KXzQ!1~)=82}!O>4K-a(mIEhzbPr;%ReZj{F8j!)mNP&F<>mU^&rv1XG^<
z=Ijh|AO=AwdZw|0djE@!Q{|ahGh%n$^al|Y`5;MHx|TFkp~fQFp9e;X*5BBAY4#c@
zxexmX=+!vU6;%BiQ2RMcxGctgXzNjYOEqkJU#p;yqUcKLBBp_AD37iZE{h0i*H>y!
z*f;IPTbHwd*4nLV@3O#(E~Gjgpw2V6(v>=1g-}@0B)G!D?!@~GF1yMLySipw`Jl>Q
zU7c7vtSC@RyYkE+O-!{=1A|=^;ZWb#Dk!vQWM@#iZx_)MC^FO~%}`gOwDFg)xrH(Z
zJyN?FZ8@Jp$wR8wP&(a^JLYuv_aG5Nx99k}C{61lN6cXhd4}o$HxyZZE+_(vM%GrT
zK0x6M@6%A#XwiO(e*kR`LOFpVv5QVRg&eUkd__lOv4qC}qs2H*rMf&)We*DiF&gRE
z8v>O_5>KEk@{)zj3$Bp4?lxb}&Hz_J5C)=G(iSM(|6;q@*jK~%hvEe$U=VGmGqVAO
z?=G6>3Ue>v$Xydq-g{~O3SIzm0XWq95=B*7FjX12YYy_^6aHOojCq6K(_Y>{nNy>&
zLB;0rT4{2F=G3SveJUpEnuP8Dx+QO9n4%cchU>&AaoWoo>W}zHhdV~rO(@9GQ2!B;
zAm_0IRUcMGZL78e)&5VdF9NwOl6dSkLupYC!|g&&Ky{$J%sR-qE4K?d0mW%Y9#=Fz
z6MX~98PYP`a{TRpv%!!)4RXZLZVE~sW~JpFl+IGnD_icDYha-&l{FMYFZGyJr5%Hu
z-qr(b<`gNpqn(_Y-WsXkM`BT2?KH5FN|q5eP#Gxyk>RLE9~Fn3gl5*x_>FOec=P(*
z#NV2JuKTDK{HRjExn?$?OxOK+lVcW}Us~ti1~IWrd;|@GGz>q(=KWTbtZgU^g4B5I
zhHY95Wj#TCNIMtg2tp8uUTIcP^!^u1Dmy%8oovL-1-d{f{4_K-D0vUn4g}RxP&zw!
zf_~tjH&8dmQVip0wt!k6%}$a22GxqhTCL9rC{m^KNaL$G9=jPRRA5{eTI3NbFg)Pa
ziYr#A+eJ`)7>PaZw25ekBNZn9qW-EQ{$mnW(N(IQU|?#)h+@BtRb_@c0X}e$QS7Hp
z)oU5Q)80;67h)Y!r1HZsT*9&+i3?whFQu%tK_Ff9EHaDkdHvbP`D2wt3k<Bm`a9Lc
zZdMsZG@DlSIft4AUFv_~xwZ1leo#8`boIr-mKb?%8nGT~W2Bf%;#)gNPbuOi0tF~m
z%8pfK-obW6I*uD{21;&LS%FO)#}1UvP}&)69Mcg}Q1!1Jl(qvE(e62vN%OT|99&<m
zl-?tT*7qpA-dn4VRrcQ<^k}cj-I28_0u8?|gfiz#>lbHdlq4|-0?{kQpc3zYu{BlU
zb?t0TLH2LHD0L7aO*beg{X35dywuuhpF!qXY4z9vOl6Ah*6vVwEAdKzX|$g`?WuQm
zd`yTUxeTEPU<%=ciC>x*Raz1-l7Pv;aNVM%u|iaK;8IOTn_baZt@AB6<=@|kw`VRX
zJIW-Hf`KH)QE)1f7%?u9FguZ&vYe{y%r3o_Zq179e@Uw^-(cXS&+Z&Iuoq4qQ0YG0
zsFnqFU+Taw+~P?{7mA0Hoimuk^3Fk@{kunvMUQ&LqhOPoJWAiuU@MG5<u;}5B|<lD
z(Ax`-lJYL$pwSq~np&Rf1$4UKhQ`~#2f4w8DSSAYNJ~R8pvieV1!YYx67SGShXfU(
z8On{(*0%y!YKpmbv8Es^*eM9UvL?d0@@rE#*T0unZ2+f4smH*tSF~oTqo8$#7%cIi
zMNxAdv#>!tz5ih_?X3T(t5`U6QcUezw?0jk-YbAp<f`|thzet9RkwrwaCQb(41*vL
zUC9s)y8mK*ZRKN{^od#Esul@y=Q)A0jGi`6FqZZd>2(Oo1TcCTleiQr00eD1jLE-!
z&fm=~{?%wx^RU=m?7j#j=gH+m{KO_JljA_jO{fhq#UfNbkBMjT7MHvH4}q-Q%?d#s
zKq&?KLn!^-F5O8+*n`oX2VZ(;MI%_U2fTI^z7!>YhJP4}&PX2>zO-0FVaQVLkcBK|
ze5otzjF;4c`*}d<uEv(SD^V|7rI)QeN6j6Ewe9~Gy)^Wikwu3sy$uC#azvo;X&gMb
zJQVhYsKSF6sHX-;+OGHOveR}}<$dC73S~l=mNBrmQK_FGOA7ph#5zKlV%f8|(Y`0h
zX~9tw{E;y=h1$g(oQ}XV_Z7Aj;<bZ5fU@c(aTrZrT-$@Eb(>3>DjvKDx!nx5_r8K1
zubT4B1l_@cj#mzh>ixSf&dvo#Vi1O*R|3Mvz5m5l8f{)i?XC#DKtv&>jU79m2fR4J
z5r9y9B(x6|c3xyV6R2B{yh^NU-5=0qH173-6jjmx&R}t0<w9M&ICOXT;G{L&AV6h5
z)=;%Pyxm^H0D>*G9>ZG#z+MO2?rdoTIzt!N7$%Ym6gN8-D}(Cqst5PNmjmy-`vU(S
zMAFPx6*CNkW7Vkt3f(!D*mN{@?!P;tkX-pXOF@;A>4Qv13NsS}hgGA&5nWsf-j$bT
z-x(~((t?7XRrM7UMfMGjYEhE{UNdmGIoF*FRc{y^0?9TGia)`W8h=9;L}EYS9t2Zr
z^p2VTSe-Qms67&WTwk(HaeVtsKuh|^s%8m#GqWlZ-O;6?sW(7}U`h>PxGgTK9+{9h
z!3UoH76}k)(!#39t22B;Fr|bFQ0TKm2cck(P}P*l%=XYY?)x|8OsR_n#^nQ)<YL($
z&d$Y%VGxF)D<yoL{TJ)Chs38Oh%Dd(W59|0@V8WC9SYD%O90&b^GZTjU#m(ftLy?n
zS3V3T#X6MITAbP-4E%f-wlZ{5yhD?iBrrE~%F5+2Nyu!1wwWY&8}WtiKsOy<FhAon
z(!VJoj}3ff8i@<L!Z?223T&!DAx*Q}DsS9Y&_~NePQo3ocn7A|E{8taq6^LRDpwWO
zrod*fuAiM;Xh`!DTB{!{@q(i)L1#5nEFr`l@uS(GgdUp)akTIz1MtK4GH#7TS+Ege
zDdT%#>UvzhbHfzG(PE$*l@Z~Ud<Ahd#(PHRH_@dbr{F%?^!&r-+c{YvjCOu{xA~}z
z9wTDcm=Q)q{Adh;99itHY&@u<&APpdaA>0JA%c@P?>PGEFS<G@2s<Y5$d)E}-G{R)
zz=0S9VP6{TMEw89F1f8m%`NCY&;Tl;wbHq@li^GzEhAEiZMX#{lpt?n0}gbUgy$^u
zTUxB(K>0AR@Eg@5-l6A$QMWRyVLPbibq5Ofh!=p+mTeiUg8?NiL<Yvx;*7BnC-h}B
z;83(Lk!SO=3-l+{Q?y5pD7$jM*mE@eQs6{<^5p^E6SrX`gL;_UtEx|7t_8QzzVOk4
zN3&5hal50;HJ1Mp?Um{Z9071t+DII=OfL0`^N<SUigO3e`3I>N)UP;J$DGK~x^?l(
zI6m$?oIIwX;9J3IPqT0n$d3nuBp!0-Z3En8hB;?*e%nWi!``{~fZ40za#q*EEmfJv
zqDzA=Kz*il(cZ<mu)i>Qu}0rw3gxvKcuhekX2DZB(I`6d#o=tWh{THbnW9_vKqaKC
zgez~8_*cjk>Mv*4g2gZh!md<ZTgd${w(e~Sw)=oPfIN{rK!cD-BB)8&s&U@r5kaX(
zSCqB@q{`?Dr$jpQSf=Zh*_)`xq^(qx{!QrBW@+j-&;w0*LPSDyu$?k1cHQz`coo)2
zQFf*F&Q8Rx-*E1QxQOin18vDRb;>SnY5#7#NkFM3u1Wy5n6TJ`7PUM);w=kN02mxx
z!E(Adc0ILdZf<vhAn%BaWw~m1Lit*UCZZ$mASw`LGoqM~@JCN$F?wSq$N__boZHVW
zP1p`(G1;Z?Ul4#CCVuS5w*1E~^xv~zefR*Uf_nn_OR9#5DVR~rzn##mAe^&W>{qpX
z&#zf%0d0JMwyrdJUvrSPq|G?2HA-;{_99<7#yJ1rlGa?3E|45K`4aH-xNYW;=(|Zx
zG;+jk4OHhCB3s$?a6fn?3*`zsBCJ)4YZd|S(CyCI6(m6ng0MG<t-}95wg;QgwN8b8
zfC-r_vPDB26DzlP1J@R1G5|^+G_^T94Y*DjmxT&0oc9x$`dIonh}w%%yg^|pac5Dw
zhDA6RmTsx9OzjU8j4RoHeb2AHNJ?8Ky<?G{`~R^k+?!Y%hLr{PehQuh7QeB)f1hpA
zW=NMJMs_s=i9NW@$z>x!<#;1iu;BVu4ECnlCN6UJySTHZ`~swH{{_e}r6k`gnnH}%
z^7vyQ)TL%1$;7w2eCM>p5hdHWzaQ|KU>qaLg$A;q&R}mD0M#A`p0;n4L*f{jajVE}
z*R}>U0D(7-fvT&?i_`vW!HBZ>B)79|5=~&jgz}bKpCM_$KhE6pR&<e_C9>li&fXcy
zjdKu6%MnPAuk*Xjp)P#&3c3w7ME>LKN{}E1LD-i{@hJcQ*v`&0!L@c#KadF&5lw}L
z)r-?7ppeFqpaj1e)T}&c#&=DYSgjx#B)Z%mU0S?vLZTEtrZ|+cqW^;ycZ0RWEG`|T
z*55Ofc+6BTU^})rL7${`lJ<<FI(c|!_KT6pNyy*n(jnCOgxWPvd#LTN2Zi$KDRC8V
z1}FcuZpl%lqombUCS5WPL5^G?cx>4;bdI~+TE4pFtM&5M$*c-Aj`8d<&eBlp7L;q1
zL#Vt0<x!poP^^99J|tGo_cqhHdCVQRQ#0t6g7Jaeg>U!k%`OB=1M|v&Q@p)Ew-ky7
z&~<&B+7u3AoD++;8P(29Ke1U>kXWtYHniv-C7TJSDJUwJ@RPT9U*lBykj<B{ClyZy
z&vW93vnxPi5C&miQmQTa|HtO-mY{W8sUPr=QbYpD?Ma*iCl8GgZT28BtYf4PL@$jK
z$;P2G(Us>6;<{!G!fnxeR=0o5`~#wxMug6STX@b#r2V8=pgQ!Wc|aM72YsTuiXo{M
z!E{9u4f~it2-?(auEu&%WvJDq#40$5WS&k=2pc7iJi&qpBAJRM7mcNhFw#BIRE<T=
z+L`n|`3aL$rfljI0FT0nh^BtXE`X*@w2TF4E>W(kqSJChO{khcpr$WfO>hd$eavA4
zQQPt#SVw2E!9U)XfVckL!r`?@@H!LXf;HpY`_xPLYgCyq3L!k<y24u@P+rILCxC<}
zA{pG??=WgyTfn;O^3A4H7zoy+&!xP4_-@AK*nVHUQ>x2kP2rmNIG8o6b{=2Z4qKxe
zmhpG%bQEHA$Yv4&Ax+a3R)bb=ECg-F*N&j(O8n@OdLt_FBJJ#w5Qae@e5DE`wfDc6
z!I6(nYb71ueA*$A{FP<*H_|u)kg|<!P83Rec3V`wBMyX}Z59v=W|Z>XUwRD%>pSi{
zZ$F)obXjI6%At5{8eg$2^D-X?TMcE`1KdGPMRhU}GJM!S@lBZsITX$+SxWpez^SN0
zwpp=EgR;4+xmC&_j)c$W_Ak<QK;phi>8_VcZ{S3I6C6YI<O!*D3Mjp@=rjyYNoVuz
zTJbI%N={>o?j!{Frb5!gX7E|L?=FJ2+}I4F!1+A`ZpGACEWGbgeOB1ET2XHtDk!q(
z{H}sIGAyO32}dJnJ;pSCJ?<dIP97pUq|?Z1jux93TwKPZrAQ3f6bMRMHA@YkEO4Sv
zzd+X4%qOX1q8Sq*K|!_XNj{Z!ca9{NNFBS%UbY1~lAi4Ruv1-I2Gu5liZA05bf@u8
zQED;HJgd(<X@~Ji3LBt0)k|$PN9vbIcjtWFyA{4TyMiQ!K@j+*iW1HLKh{j@E{#bA
zd&`Ldfz`>1``J8`iTRb4@Y;ihV!3H3<`nR1A5B?+-DuPlSWY2np5WB+#m5%J-|%v}
zt4#`ZD=mHgE)1Gea6M4)Ji_4;4;ktMi_x6AkNSy6^X7#%roJbJTm;j-QVlf&tArxQ
zeaxzu!)yYMq_qG>W%Br-6gx6qbtW~?#FY2s5N+er0Wa#Qgu=t072zY#Hp;=eEP)!>
zf2XcToO{HcDbSo7-?l$94z%N?<Lp-fh)yxdZbJj%?Skr;W|1+zEgPCsAVk$)s*<Nm
zWu50AGzzO6KkG0(C1krJ-2#%+#*7|<i&+AcL)ly~zs@V7XAWFDb+)6gxzvW><O@@{
z4NJf$z&MAyo6UDvi3eQL*UcsUCvV1aJ^|*^xd$9)&wS!CUwS1};Kp&<6z0aC7~9H{
zYnirPnwxr)b_GZbgCOint_s-ye{8qjC2ZCXX&+DyG$NWBeoe_04EPLl&5lmSyxfb<
z&dcs~3z|ZV*U842vb0YY-VEijDW^Ff$47BmIK^j>xye)S&|DuL6u@!Lb7lsadd}j8
z;P#A1a+Ot*8I#Ji-X^d6+ZgpxigN)tPGjLqg-!J_ii-j;oKUv0HkvV!c*6w0={4`n
zo!Ab@&4#MbMF(5L9itqI3x{IHD&x|)JOQ(5ZInUOx>;hJ!E7?Hh9g1G#D&{Jh(PN&
zJh3L@$BZmRwcw9lsYD*1Cj#U7(w@46jE!A{>H?cz$t{$)?Ab{@+(PMYUZK<&L9RSI
zLh%3~YVLT&_Yu=lC^K1|UekE`*{zdpW4>JCuXlfVx;JNMVgo@4LeZ8+8IS3|u}wDN
zVQ@C!Ht>U7D&Q9&oh+R7O(p_g;*#tnS1a?Z)(CkkoD-?Nh{Q%D^&s|Po-Hu_!sh{j
z<}8V|4P>&kZ(n}$XX{8n?cS}|06Rh?yc^P4yb_Kzd?^KFZ!`yOL+0*QeaCM36n_n1
zgy77->167J3@O00om-svTfEpdLII}7X46Kd6&6S)vmQyrQRH@EathQpWvfJ1lF#6b
z4d+isqGAF?BE73&62(OvIA+V^j3zc$9Jd~e_At%(Iy5a}8$ge7G;i}{95VC;r^Pt+
zmot7{P#5;ZKzslJMXlv*({uueAAPC=5_p~KeZ@G<YiJ3xcCxbWRW#*#aiS3;jZH^-
zForfMr6RcSn^)0Xte*ff+Cdkuhej*gd8E!$pbux~g2XTgLcuFlFoxd$Vx4|iGBz!e
z3%mh>8b#T+5N9ODMolA;sCW#`rR2+|`)t#iP~fUON|XbvRh;X8GO4BnUN&%X?i+*#
z$&1#F7P0}V@_7vcXi8dn>g=;Yel)FM9&};U25XZat!Tz>?AAull|WQMu>jwy{_M>x
zFL*VY$HH$iW$8C5co*+6ZOlf!obn^?JSl}E?znqIS9k4Fh!pK(%`dqBa4=7&L&4I=
z9H)|T^E0ndG}-1zeFWZ8y&?sSEy(eZF-h@-FnNm8gq?T!GAj1iqHFo;P1{)MlSxG(
z<%ioScg2my&KrlZAk|K!uDJ(Z^E@$2QaW3;-Rxqlf=@M1nReL0<p~8|^ROIjSL%5!
zs+FfHH7cKPpQcTd&IYwh#Xb8q7o3lm2WMx11R)4Q(JNJo#r-d~?Ie#K+g->DFn~Y(
zA^3mVF_1SzNGSvQ(Gs&SWHk>v>&}EQy<DM$373%7M1;HXTfv)pDW44C%^|?#qk2s-
z;S!JCQw{K@`)58?@<f~7adYZ471I<XHI??2#<S1f?iF`dt<@0@F;L&2^hu`nzc}E=
zI+H5j%Jqv^$CFg)m#ptoS(jzxVmpH~=>KM5?iZFH;VpNcB<6?cY0_R*WzG;AIdY*_
zqAv=yKUh7xt}NbfI~yHz9Ig2_XUMpUp}a8LS;VVVah*ZDI!JpY9>M4&W^^cN+Gr;p
z6?OKMa7f3<81F6O{31qoV;eVg+h<Z3%+3U6mz4KZ_f6`GEaA{L80t&4^?<sixT9)C
zMDwsejkfw^0x}2T8x3z$bu`u2eZrK1o54rML;W^a5_U#x%cAuI+%L|~0EuA`1cF~m
z8r1mzkG0e3Eop2b^aBjyA;_Uf(mWW{c4_g$+9GZuqViU!7%cmc5-8hohG^a`wlY1_
z<2XfKe^C-JH*Doj|BI)DC9`quac88A?=m|Roj6Q(+Y+AAm_21o_ThL-txe6}DiWD<
zx`iT93usgaFRA}oTb<vkf7;?Fw<BpD-gt+}JA#Eop4v`r0YReSMOvDwgyy7WKp~Nq
zqpjZ-*6z=bZb(brcFc(nJ~Z0qoX#rF(wzP5M5W4$z!s47BmG7vs*M(rWG9_IYx)8}
z2$Flbl#~RwNJ~e+!An|Z=KyyfAwW7&=H)L&WilGdi(hrgK!Ci&xH{__-`9RI?KV&Y
z?aQE(0wte5MO5m*yPVdRgg2kc?&nyNG*b7Zn<n4l>03`Y3NtblOiX<2ld~%^Vju*8
zEh!M6{u|3=a_lB|UW7E@;Ib%!K+@tSa`Ju!3|;{<vpFZX$MwwrFB_97fyl}1zYI4e
z(Fhz%v6bcp?Y|Zh493(0ZBs<g_=|F%OcB&x0&Rsa!Qa&TsI?SKl=2csH2<ea-S%FI
zU?!#q^gczhI0FP_mr6?Z^GcB`R|<v%V#W%GFDqWT%>qKf?Z%kS&JX$>K5h>{?hF_1
z&uy-jnn7w@Sm0$_nnHY{cFz_#@vz)OUdx@Ab08Phou@ECC$iuWQxD{~E6HMa2ru#R
zwGVnp)dispx_cxDRpFqx?h2ZDv(a$`D4(<gr>SW}D2F|&dqAd!?V*y4{x|HUj{RwX
zOeXB5;lZ1<7bG*^^NH>aCV&-ua65rc?KKS?cAm^6r@lbX=+Cp6kZDD!m{2dGKPkHc
zY==P*cBO(;>HROZ{%r}H?Y?k;@(K?HjS07Bo?;$QTUIfvycuo>_k-FFe~tgr6w@44
zAt=u*c<Vkzfn;{@?YgiFV}o%zmxxlID&F}OloU4e!WIQ6(@35^C@uQ|s${(LIpAl-
z#U-lqwRbAuP?v3kPd_+Lvlc19nT+{(of-B0{o9gnYfHk7g?khyScvl&eI!ijMCoq6
z1rM-5Ggp9_2KP)@szQAxQD6XN-muJT%y%X85}3*^BsogZi!+w^+=@@_B2E%Y3K{o6
zOXDbvUE)1L%;)gLU-{L)uoRjx2}|ImwW~%zEe!x@-o*SFo`NO$nVMBgbCQR5#f$==
zsgPz@;F%V{TB0NvwNSW#<H=13@$LyrxKBYfHx9!cY+A><7Xy}QoiU0ZB0jgiP*Wh8
zB>ot0K}CAykI;^H=488g=IaG#$K=`9dK>>+dXRPnNeqJ^@Jm$@@&6xdrZc;w+C*t?
zIWf3{ppsp_ETM;4DG*+%>wPxWY;B4uoRaK?Q+kT4E3I208C}fZ>(f9!K^v2nE_~Xs
zBqLH<8YSthMwZ80r?X0p_YKPtQydo9N2d-;%mW+8g4*sZ<w#61%KM`zC+X5v*^`qA
zeL%woOe9?r@tT};>A!?-;DmlAaT2FWhG0?#d4B3rnOx#jdWqPPIT@rWn)U#%w}3}N
zobxbM$8zAL%N@KycEDK8j6GK@IZW$vfM%vhe^}|9c!{?V=O>3Ez?qjQbsUjbS`UEK
z(v$`4^`A?i&XWl&I9MECxEttNjw81*hYK#!qM^0P722_F!d~Wdt_YSCs>)*0qCo#9
z7?D(!O`VSo92G$!NlPE@#GA7#L4pv3VPBGR2><`s&aNh5aGh2^kO8daNSZoOlv>fz
zjxX8jfe^Tc(Nh+avnsn1IfMACL{Hhv0ktP;@LLH0A-2c9Os#H`kNCG<u$hK-lm^?W
zsY{#Btr@t?GRQwA5?OLF3w(doUt&Z!<UC#Ly5vX=sc!1a9YI2DOFkq|y#8o%IG7BI
z<5U(x9RGaUZzKB`&*%5|OG`~u=HT8|m?Y(SKm1gp0!)%C;zXoN9sUCm$jswva_GL=
zJ0w*+;Q4D%*T@Rv7I@SVoyisFbE8CU0ai>_vVWFo%1QwwvYA~_+;iz8>UQe-Lbbcu
z&2j0c6Y`lbx+pTJkf<>dO#K1`vPX<x1c#@RybS1EwIEPdbIf)hlQASlHy(-UzLN5z
zA=&cL&MCb>LU7ai)s#+H(djd_nT41g>fe?mA!OeR^MAN3I&)vfRE;~_hqQA+Vh{#_
z=#|uv-~BJvsS_SHjs^7sI}3xGHbAxnVx!HYlB@eJ_)hIY=i<~UM?*4i3uV$qW?oZy
zr@3kAf1&aXC@eBDTl|6Iq9Ty0b)BnV@Y?`QgP#j!FWyfF=16}U>|CI94v)2oBd6*^
zq2T5ZGUq7<Wd3SzDWTsydL+*%)hnR8j9R3eVo-ff(~=%>;t^RLxzED?0kd!I;sfdR
zAdUxOS+cXB`9Rpy*NIUU6FL7g(H>@Iu&FPM+-uXgN(4!Zn+5?(7j}gni7a2`de5+i
z=6|@jV+vh*EH83r1FHlmq2LTzba{r<=HOPFlRi{ZAl>%+J6%H+S^NW&eN1Yp-~-G`
zLE8dATHX2zLZ;cIqbTLub$4;L6OQ)ec&sdhgLGrQpe69(>|Agl1Ysb0C6!X~{uf)5
zP2UjLO@RwEw2njR_iLGPb4T*Bnm-}nMsdZ^p#tCRPtnwFo3c{in|dA74L4;b;2lUh
zY)#M)x{X@WYf7~s?g}D<-PGffmwFU+VX`QFr)ADId6oH*Sd7VNN77#eU~S7?9Hzy(
z7(kGe3zzd7!(v^m)Id_5ITImog1OYhxWyn8w=E~QNLzMhYESLjkyn8iqmuBF8^9yQ
z#Bce(s~${7v%OntKvW={hck_3v?tsjZ@^B0a5|<S?>U2$yNv!z1l5jBax{^+WKnkK
znaJ9?uf#@7G~2DMsa776?$4&jK%0>yfS&+d^i6HXfGeo9B|}4&_49uis9t8|oG;q>
zns$Nj2z`R@%EI0wAM#enTCxd|Pz6~A%V#|oQkLxfB~Z}>fczq07iRpoAI`1>hk+0T
ze#r}T|NpTzF*8_g1NH+15LlKOMQl~C?RM({g~~1{WA3e_>b+$KRAT4dPnFEqeoZ1^
z$xU3#J(tC}fF!#?pJ`p9b@`&c0k2#R&XVN0ad<x>sT@fXi6lfew{~;DXcWtkAWlxC
z?Ee06k{<#9EUgzXvgTDR0k9OJ=r$RY8!r*BB(pi$_YLim2L35}-QCTFe2=xu5seVt
ze7>3&f-eQh;cS)?y^*7b9Q`Yhh*yI1t2QwaE0X?DfoLV0+{AY;z!Mre{QL)6xtu;s
z<1oMZn@B3aN&#4<ye6^8@eKo3c}8Q`M6k-IAlI>nwamv4KH^%NztE%tuKePn$wHih
z`~u14mw0+kK%XFuYLp(3Bd2NXY{1J4r7Xb8<<u<q+l{w7KO>DS^ykniWZn3AaFXT9
z-zeJ?ihYrGMmY?FFbuuYfRw`hFSbs?FBR1k*#7!c3(`OXiQ~_Mw#a51I3z2R>L7;)
z%?3{~)Et!DmYYv4ws+4DoOAZcwE>lfjr6Z=WyeM~T`IEv3$%zepxL>{`}?0?dCKa=
zhKa4DP#UrTG@QFBL~1me>MCA7+Cr#}=%tKpoxCuyc8c3G7G)}{@?G_&CC1keV|Ige
zd3xd7!H=X-WD?i(m}_1>p-zJ@SzilKq7`>Z%3V($+;B3DuP2SJu|4H~q3k(9cw3tj
z<Um=ycceaGLcDkhs!kEbal53<)EdNTeS3Y4O)6Zg4`PU;{aX#l8x6>l8|jR3w0n1Y
zc~C2CNG#R(2FJ)&LN13A4r9P#We%fvEK0MYLyVy<0}Tgn?v%Hw<sBr&CNwbo8Obyz
z&VgR+57E_Py%1BTlG$A=Msgtt@~$D(3F*jmpx;EgUVC$PW=9OeAP{Xy2!ieY8_S2q
zBhfe`lm-}#(FME9Ew2qDtv7}W=DguGCdZ;#>8PLeq)KL8cs+B^P>_9c%5!w_dR~J?
zx6)gjQQl}Yx47<}vc~3G^efY=;mZv?ymq`oAA-`bfE5zdwhQDo>u~6?lvQRl<ZV6E
z#E_7^lAwBUdLFFf%J;o~rh;3~P1DzweEPh<lPXnYd9D}$9hZc$6(SY5Dy7O43fBh{
zU{0}urE9WeiCyqKgqIf|gLwHEao>oO${eSWrJab~aVj{4QbgdQQO1;yd|GcUsz0+}
zGsz)dCJ8VooMQ=A7hd!()2D|p)&3omNzk3?p~`T!l&@INU9o6iCM#GpFbtw?gB5Ig
zPE_76s`Acmpx2ZJFNu9+GY^<~iE!@~XykGG)N$urT9U~pr{5s(uuCpQIpv@NYP_a|
zigV$iKo3)>6APDLWBP_^!PLld4=rJblJxO$5v4b2XMlwu48zbX32ZIg|6=ll{0a)|
z^a6V|hOTRt?q(h3aXOdp5mB_Z+h9c!rd29C9Xjha=Pn%+9hDK7JkrY20~6P)oQr=R
zBLc`P?W1r(!`xySh~@C-W!x<#9GFg{hi90GDz_Boo#E2pFt<Afg;y_`Td)T*;^Ik%
zq{3V;4x8>In*|NpNmDYW8S5+`6mP!_P(s7h^J&I}CAa8dWqukQSE<QxOvy9r&eCSM
zG|YgAVMg}o;AEZ831w&E!Eu#CX}SGUdI%8CODCx~oB7lOxRlH<K=pmSQZh}}B*S(W
z!de0*yCydvrPysG@cGZgBpuT^o6B{%?wEUNQO87^M=GY-bly`Kh?K$zc5CNlpj{Wc
zC1M8FF&PaS<yKnAZuLKBVv&j&AaQ~!x@G$+3z`dw+FaQDwXE>*G=`zfjDFpkv`^Bm
zD2rhbgk5P`6}kV#*0oLObQ`q$+ZRt5DkUUt#sh|s+!(SH^udHORypwXMAl_x8>FG(
zzz_uzlB`Q^T21#H!?TxY5s1yh@Ck<&=<rcNwsQ*2PBv-?zY0CqQXhOfT-s`!T;h!4
zLL5_}$n#+B-R%nS4FSk(n#LuqzsiMplXfZXPv<BjdkT2@5b(g7mLUfgwVAI|octpI
zU}gh}Q=l9thWA9`UB6}JmW$YL{$0X{FSS?|&(gFAA;>_Kcy^<pfUdw{e0MIeCLZ1>
zx`;s=_7Jh7Ly(Rg`|es~?*hv_g*(rGo8PbkkU86FCZ7{=P4n>Wb=we98*ROwm3q`9
zru9IxSj)7eWn9u4Y`?-KmPy>WvhAh$if`@5w!LPFgM-E)p!Vy2RqfvShd0nnAw@z-
zNJ%zC?yIdAz?p()*iAq*^UC!}u9dvYq;+=gN!pd*Kn#MwFIg(k{{Lf}O?L*PCSvyk
z1d&SyL0N)X50X~EnSQ{%A)oa4*RVdC0?Ty#Ylx$nusQlpFa-7H$T=x*gsr9ak<uEL
z*zmP3S}QkTKKK4KeUw3$5-opPtS9w5mGBPJH|N96F;;RVP)g!g@8SUaw<?ejQ=gg`
z*35f}L~t1?6)@(gO7^_TlZLCnF@vGXg(AiQvMH8iVsJh&xCAMt-FPq2a`{Or#ZsNH
z#8??kb{UqCngCq&O1wYZQeD%ro~55`dY_vh#a0xACPS&?I-9!wS}WtvWy93@PEJ(t
z>raUT#&p0tA#oE97`hXL;$3<2bYU&Jp-{r2pw1j7*Lkh~Ix81p-YlIR0oQZPy{zY=
zs?<*Ac1LRAJ0fRckcQVPr*1epfS40K*k#HG*URWD8xaZ!rhh9QAJVP_hhZ3meQ8TM
z(*J*Knl{^AwGN_v043BVfH_`xf*kqr^&mtCe@R^WkW1+DziUY#FcTT(G(F?{!jZ^d
z5=*XKPHR{Ke|gZ7oiEq=>%d>qI!!K)p0RT!ZsWtT_j25%amEF~hoz>#90X>X;sRq_
zz<rtxO8^2>F4&!KopO4eBhf{f|6Xohd4)Na<eUNihSea{yOO|NCQ1|Y&YFQ09f7%&
zw_|Jqz>_(n0ZMjX4h7FjSF3KXX4Re4<rh@0s>x0ekeb9;bmaIICKuHmKee=iB`}wX
zr#D$98FHIy3kTXVk@?PGYM92mo-^a%EEDZShx2GUOx@t*PTS2@g`BoORK8tL+jkI_
zJdzLf6a;<wy6C_;F_v5CZ6o>VObtCrvQpG`I@HJY6c+5YB)gOp968vN#1PXtZAe+`
z@D))H&aS|QVGxGB#6ZFH|Hn2>v)#cY!XB{F)J*}$p)YhYP&=Uk`Q2B3bBg?ECGqaG
zI$^17x)`dQu<4qU)HS&Z{)0af%adM~kj7e;5;!C{hn{HRWq#*?>bxW9^*<ojZtZ&e
z4<;qPIjWYonA%?-uS83BX^8-b^@O6O)9nLmFX1ylm`a?Mr>8(;$&re8J;7n|ricQb
zFh#YoY(Iu2C|QCXW6<ncnXlU3FcVZP!LAkP<_DXKGVzeu^ny4Zc{oPfdpH7f*#;dv
zu!ASD3!q-9fTG&t3b{&JA|e-UHI7mrhK{OU^=Q8j(5;t(x<}>K(fxFZplYe-`(S<{
zy>q`s8f#GY&7qt?T??CBlg0rHC|hE*l}=Sa`x7RrmSEok!X9;{I}s51ty2>=t-yPw
z1TCdl#x=jTsJg8q6Va2iD?nlx1YuvQx(faO$9B7GlAg|i`#=sgASG0MP4Hc$bMoCf
zdP)wcPrlp!aye(tt+z}6Tbhsmx+&e_7?MxTF$B6M9$oYK#|BZb#II6}w>J^eKqV31
za!7R*ad&~hZ4~1D5FvR>Cgc++mIhIer{+zw*Am}cP%IzEuL)2zD2^f&EKyu`&IW$q
zBo<~XI^Kovb{CmKAmk%><;0{^8S_X>?9ehHG1s*n;&f=0j~$YuZLF+AsdQ<>y?kNO
z86(wkkI-;z>NmE;(m-qUV{(gb)6zhU*rV_79a=xefUWUEn?Nj+6t>Z-702`y@rt2r
zvZ;+W<$y?S#C}ukKX(>){bJG%5~NB;Rmv+b|EByereq<xk2Se1@wiwo_08F}U^x(i
zuq%x}#QR@t=e;#aYrBQ+1@eGV28lrwZN@@kl2l;**W(fI2CC8}&)~%_Ut|MXymuwK
zMBXmOF&@N8glSNlOr<1{Zh*;jvSKK$aHHr_yH0g-VinB4t$Kh;h1}1t*C%z{Rjuxs
zaFE@SSw1+Jv5Ish{@=qzeCm>Cd^gv?SH4yPu8BACAZ!C!ITxSt<RIP7*JrFJklKOd
zkfQm;j2Y{zto8$^Tu@(c+tNtm#iAYT4VealthiEHZX(ff>hdcQq<Pd`bB&|S$&_6N
zp3<T9dHQVS8{gL9n?tg>oy@uhqH@RfccwaboLU|6`!fcr@`mDhS<_uL-ZcXS<vf~r
zT20eBPfR@y6u3(Hcc0wtfBqqhqiNb|VM2L8it~8mi^Y0nm~qmsi}MMn%J(MmS02AY
zWsQ2`LSo2u4Tg%Z`0}xVtn@Zcqej)0Do-F`l~Xpr(QdaT?3<LQ_QDTmS7HP)2m)J*
zAHn_`yPMHnawZw@3J8OM1YKAkB>}E{GSty!!%zS$rPzOypoh_o`47Jc5K9Fwrvmy^
zVf(4y>nXJ?8kL@SO{M2XIC0PtlC&5P!%j3+o-g~mxkJIkNz0o`yM8+tmFD+(Dgu@K
z-3!2SB!q-*ys%Yhz;Oug8->dBU^J3|STdhj1WbC5XatZeHgg;`7uGtRm4)AcDlNap
zfF%@70fPgvBxlKmX=HPGb#dJ@(@4N~tu2z&FdZA=j|h@A@qR1T{-2!?;&^^l8p_L4
z(4ZGemz=d6uT76I;IXyS<bDI9H0E$@U|bNY0ee0{fdH~3$H@3R&uGNj{NFe*OGOK^
z+C_8jI~p;6LnHLksP&5Zoy=m8WoZw4j%A^bSqlkc$AjaELRV1%t&qZTv3v0wk3214
zZdv^Hv$$g;p>Wi)c9tmCg^cF$^F!LTSTP8Lz?F;%3E6+Kwltk}RMT(Rhv_cq?i>x$
zA}x(D83UxGQ$S(T(p^fY)NmW!Al)HS0@B?u=?>rh-uJx!?Xa_RcAmq&&-2{(bzh&V
z7L|&$0?eVftsCZz!Kjv^<f3RzfVz*%l@z++-+1VN%f3Bdq{nJp*bl?EGb=Jxf_xsl
z$r%i9m9k9Uto>EA$X_+b$`rIjz_Az!@J3IKH`0*LE5*|X`)hdK>veo?`1X?OU63~n
z{!=`2H%i3)ZrtH7)@>>7(^q$?dJ0lpRuQU_SoY%8NK6*}?8LDqQ`k>*qTsIj0uyOV
z{;Tx?)f_y^QfpSd?flp1Veqvc%3t~ot`4Z229DkQ%0qm1VhzC}w-R11c^!ixtHy}r
z=ln{H88Ot+%w?knZ!3$RvK8J~CQ_NV^F=#J|7)tHR^cM#{T$pD+HYt_6JN^jDjTcd
zudigY@SZhb|B1Q<n9O4I!}p|++ci0ffLzG?ApCdS|8o*WGl^&al62)MATa(*Oqqh`
z-xcvot(~u9npOL{S0`RbP{vi<6;GY+w(Z;fMkfS!ILjE^EApI&;n*HyIh$R8DF*E)
z#V;HaMuva-C^Qm$stw_7cr||Un_O`_`-@riaKC=cIXGq!!3a;YIGZ#wQLcZjy&<SM
zhjrHYo10*2j#RIQJz2_fJ{dh5zC))N0Vi&M^K5n#_9dk@<^!;7Rmv`N?m7KyHvS)3
zWjFDUY3n2tY^l$*o@Ax<bS0lZuIf8dJRMxqWUH_Sg>Vo`(;*L9=yp#orbfhtk<QU7
zxm>jMYNefZc=(BKu3i-%^?9g@s0lE)pvap8qU18DCvH+b*u>-lM{6|#t`56?*7V)>
zK=Pvj%-i>PS*O5x^tk^<q^44Q%;4`?`kUBMTJNo!j5-(5BGit;FR$Q;GIjlt({)6e
z6cTQcQTE|kaYQ`(gR>q5xgC5)tl_(j8{nS{%J>rV#^xNAl<V|a32r4mzn=TLEupO$
z3sVo9WRqYjmF+FKsr$o0&rc$dU*RVj=i^UG4vhtDvGKGP*E&BjzYU*gfA&>I;I69c
zR%bQMoGvo|%(MHqVLWXAL4%3(XSB&9Pfw6S&Br6sWmlS5F}$=t`g(_4Swgf6ITp%S
zdu^kGc4%I_r;2QoTf!K&<qtn>dS&9->8AVQnswM^LKN*0`+EBuJik4!?6!vZ@d?yE
z>0kN3ArukTUwsb6&h&fx?l%UHp#@)i#76g*KQk?qmmNRLa1nYzDa7Fn>eMl8&B0Ty
z1{^#V_Y?#=g17Em-)~Q_J3jJUY#zb;OkRAbS)$k<pQmCKMd4n;zZw-$WX|lOME8RC
z+RNlO^i(m0QY9%HiS$*yhdXZ>bA9#D<bSVkoH@ROm5=QPnh<^9er*-ywHLq(x^*NI
zmnjI-*U6=xz5U2vr8K%^(QF5suo|;4_AgV_REGr_CV02BaTF<yZ9V9X5>D}4@l8EN
zb836x!&z@NxapZA0tNUvgLC(*&n{gz`h`Brx+IG;38yg~mMpHFiGAS{&c5S%bx$;P
zH}un_<jcAlpVA3^a=dop@!uVzSTRBx)wln0=!b}TlA=7nlHSZNjkqL>wH{Ypa}<cM
zmaa*<rtmyNC?<=3ey=T2a#e3Ih7q#JYa%kYQqk}NKR9-O2z}3hus4j7T7h$P%vi&v
zrcWWMJ{ZfIP*`sWEwTE3G}9|Lr_ob`OPSt<w~+o*T}sycY2-XiE^<Agy?nb?w?hVn
zh@gBLS6tA>E)+L6R?b-mqPf`NQ{e!*@-8W^Cwn}O8<N<0c(fa{*u2+EW0Qz+m)i1n
zzr#}3lfD~c4gV{O{y1Tdrp!iQs{UE<3npv9Sv<R;PSOEw@&zTH?{)A^^sJwGK~&NM
z>(T|r0Td*uf_!~OGIE@G_L6zcifrfdAfIge(01x+rjV172}A2uL{il3rl(7S%Dmq?
zE|;MWc))`3CqdoF3zG2o{gLQUEwTDazWKff2Hd&?rctchPaSFziJIB2d0+>@&e}>n
znxuPs%xz5K3c}|!i8K2fi&-D_YRf%>nwvGs-Cg#qBEEVEKIf7`B@+0M%T{w((SpZY
z#EAO)?pq-d1gT3ZU&<!W3Bwv$-^O@!RZgdx@GEM7t^MCAtG9Ph@gAqB$;sS}aoY0R
zh`~Qgw_^MU*j#ZnP@~jvi;zTHhgS9=)~IN_S8JaRsa2;;R^78~U#~v@*k;10Ax@&d
z#s1Q;GX(H9d&DVn!RW`AY;YKcXLaNoW-yI`;Q+5hy*i`9qq;*q{R!@X3q%C>)zYr&
z&Pvsk>nm4?&0q07N2YJaQKT07l({W>>@$5>Lo8iW@qdmUbPAfOrH==W9e&5pVoia+
zdY<_NB9f;6u@4V-%MfY|xLEJPJm>=1z*H8-J?ZbSNJw7<{c`7z29G)+#^@~<<f^l=
zWUIcvN5@@{)xp3{7}n4=g*LXQ4O7N?Keff9vl$tTA&Mye1P3y}@v}Ng$rSk3o>%OW
zX0Fyb;+Ox`AXOKN#5xxeasL_Yyn*$?Bv?7ON14rVkVb6*_?R43QYw!C>=40uUuE5C
zD&H?L38OA_amr*^7Q@&jsGN#UP8BElNz}&+@HH{=jj0+Jy-E3vEcYXnE=@!KEOh`X
zLS|HO`4tmzp{{e$F$`av4?;s0#VL8pyF8Wlw_~w<`EbhIOq0Aww99!LafISRWE;S5
zXoytZ-Y78W60Pd^ze0wCE@wRi9o6c4yT3e;eV`^bGRi4^!KN?xe#H|I&-F@3??W-b
z$>h<pfQ_;?{pFWhVOr9O6*Lq5OjT=_wm&za>($R}*tV}#4#)tIESHWLp?5^7vPqlA
zGnz@oL-U>sH9Nf#DnBr!*PO$3UTaVceoT^#9B4>*o~!y^g9HdwidDizxi7N#cgQqN
z&xJ~Sa0pIch}OqYYbv>8%Xn2|9tiSJ%lz8^VG*JC9oD;Vx)+~$WSR#_?jbxcJX%1d
z{3@-b6{+^41oL^4N3z*i4?k%zZI!m{x~$4)HGw=UL3ekw8^1gK4O>KQ1e7*PVR&G|
zY1~R%=_(8}HXl)Ru1zN=JDfkO#l=RaI=H~*?0pJY85-Z=@Yjpl*y5Y87-zND!}vLD
zB6Z>~bmt#brVsLYjNtXo=YO(s>O9YLW6|{p&tYEs#73K>f1R}J0x}H$v38#|^Ldc=
z6Y<!*whx~drG2MmUm6{5#PCBEqtO+6LJo)p+WXfawwYqushXy3m|>Xr&(dKJsKFN;
zepPxQsC5?&H{ZXjE83$_F1g5*dW=ucJ&z2?+%(%>4F680w0}PJF8_x8t~V8DD`nW=
z8D8r~UXtQXkefj*_uKB7yap53;6&-y6>+CbwbJ9s9}UdZPv86U%`L&FTUhe=dT1oo
zycUSszAu(svLOkQQENDtQ4i97`d5R5WV<d9w*>}c#zY5;X1$}Hxs-#g&R?FZhG+=u
z+?0(8^j`$?TBu)+8E*X=$czf+RSt|dZexJ)JiX+IRr(wt-pOqVVbUR;#elEuMFpJ}
zq%V(K>VwUkUXD~UVa{Jlt+0y%{7l+g=tYw4UX{!!PBE#o5)`$2$|ddCNXZJsItuGp
z#Shlja2|g)i&U*IQ@XadT6vb{AabGmLgnI2jY(X!3TGC#20A0-Uww~M;dcpQ!i{kh
zwteBs32<dtq${bAAAHkHh<lr<u5grPEMb{CF(&UQaKMJ7y<tGUb%D-R^2X*&(44T&
z`ZV~RMEJipq+S^35;IH)zx{YK#E3TGA6V_IS(=*6+kbVzvmkz4nkL>39kYsd0=-X{
zuVRiD@Xy->MfEEgW7)`kXnlv}=K&FtCPLY;+o$eSn*a4L)XUa+x^-Cuv(lMkT^BOg
zCU)YAde#*$RGrgX-l+DosM^=55ES6y{>)+jnI6o>coeJn3&%u@CKLRUZdB~arIIjH
zSq{<qvb}$f1@yo(F32Gb$3P$VEqqUuv+Fs60_5m<oI-88)kWryz9fPIxjzw<qJNSz
zVX+-!U+2VV_~3btT_iLPOUW#Rke5+CQ`ZjrMy{GlYuxy;m*{nek}%Ip(GVrc#bm<M
z?IO!A$thQ2r?mBA9e@t&-cj01&<yrO4iK~S%o#xyywAX*d&A4jF*fV9NyW^2BcW_l
zMY(^s%zshOxdyrq)TYO`n&Wp|E~O=>oyR`UocXNfaFn*vGuEp`GKPJn<xZ|^Y$g8%
z=H@j677f>#IrJTW{4@PPdchxpg}=oX(yZ#T;sgB*Zx;*EJRCl`s&}Qi**GHj-ye3y
z^XSxnpUY*Yms7dJE@pp|kegK#-l0iY3#!`FCKSub=|@ADL>J2R&j-L;{AG$2j>m`0
zljpeS#468MrL_g+Kdlhz^S&UVW@fOQcsGMJ4Y-mWL_Y_6F@`!>rbMtz;H3$B;Fnq&
zeNmg_&U2x!+`8f@y@elvhb}e2sE&Z&CR6AwOFhZV#R0#qL;bX?pnh@HtKLP%Kg}cK
z9J1~KT*g+z;H|4?ftNMz3<OJm>94IW31y8b6DlH8W3?8~wD$uVzdfIv$4%t<(O6(S
zyym)TYrro+*5gED+@JMgNz3jQGmd2a;$@|lQ34)x>ghg|QtvUU3ZYNYfx$+IpXJ0Z
z%*xaJ=%d#3&EXkY?fYh?B@(7WLSw@=>of)2FcZw-t&K?GZNmu6J=aT<sUkO`oaS~J
zIhz0W-)IZIbY7G#P$I81DZWANV+a!`A^SIdKe*n6RBDyt<mF7}$vb7$m-km*<NiJ7
z`<}K~I{;9%d?(QRn3NVMxWL-*o1d;HcX5P<sBtlvNN0ZMlJ8HnE%RJ~$D~b|FWdMG
zj?yG1@6?emOSp@wSc6pVIjX~JxA^Ji8D`FrRZi$#?^VGb<MdF|YN}Qc%L(UD`GOmZ
z;=JI;#%NnCv7>7*>_uPQ)Y$dvV9oP?YCjU@ERNw!jpt^7atI9ss{_(ms$ZSQDTw=`
zLv=~ompz``87@ut6_ab~hyrM!%mg#{w$W<eA(;<DdMSKnZUgm*&taur06{U#IC1)J
z%HZ`yzF$)Nd85+_D)<emXa7EQQN{Y*6E_S&9F{8iey}S`nuOG%SCNRlkZC37Kpptz
zzG}u>{YzM0if*O<h&$IsGLCV}iUSg}MO$pu^NEnM`dbZhp_X|O?eTI~Fb8bYRy$Dq
zjKI6Pf(|Bo7TX_3nV{6*kYy$3NaEa&APuYbdKEbnbwB~XP$OD6EW{q@@D)j;JGz~;
zg5*=4MoVBoZ8|pIvlB{~G+B~=z##y`>{Qn9M#5`#V5HcMggqv#Gf<NEFDd7QhQLda
z-#&W{f9k6xoKZvpn-IR8g5*W)7W3-$?efy-P$uBMD!@;~3Ua}{o})vgD={IG`p}SO
z?+Sg5?HkmebJ%{PKZ*?8N}JqB9vMe^XO&k~=X5dFkQv@qSPk~ICx=qG?ta0pQutK*
zay6`3GY@Mljp*;S(k$zzHy(#~V_|9hS=6k(DE5B{RdIf22?!@g-DxYxM=ODiith3z
z-8DL_ivN@YNr^6u$<fZx=7w0?@<^3m;x^-8yQ>$o(76IpKF@yr9WF#O45Gvo99#Ug
z_jgcW8kn34CU4{a9sWH~6TAo2>#Jr+)9FL&6q8kP9TI!fs^`^!=IvLxv(nK63N&54
z9lM**ZqFeyx^OLjYi3!Pkv&oTde3*ckTbG&b@qF#<%3p2i?Xl;U#uJR)2{d-^+%BL
zFej-*Zi6}%Y4sL9_&MD?U4c)f5WdyN;HU+`{5<U}kBA6-sbO$)Xp_sSS;9?vA)=~E
zdh*zwEKO&iC;YW3Dn5NKd0rc&ReuYcEhvEG8XT5i68-h?-bnYhK_7-yD>--?9zpfI
z8>nWAztZ8)jjW;8Nh9>Xf+#r@hN5U>-{3DFkTf^ti;){tE437kL|)yoP_{AE3S5<$
zPSCadK%&`$E*n3(QoU*_>O$|bn0JeoBCR^WrR%k8DyRG8EAkl@FuH+j$O{jRSMsQ)
zyyzPZSw86bm_Qr_jkM966cHZgF`vTl&hb-8qu{+``mtlEYL2djD6k!oRa>v<Utlku
z5_kUn75*;Xo~UR_+Yv`sQ>}{iV`Su<!0<OEUO1MC{2R;WGwebWqkk45zI7Ow#inh6
z+1?*Pdd<#+hDzfw6<CKy!+9AV*n56{*Z9n9)I=czL%;r%pR#uWJNV~nm7yk=Q6&y#
z7(bTbSxQoDo_QUl@n6zwUIhvXE>Iz_OUT*{yN|z>;UA2CXVyi92C`H?|5^VBOPn)&
zL-S^>tG$%rgJ+fW_SJ2~j5bQlD(DV-?!4(Fc14*XFDX-}%LPA2qufS|)Zwgn4_t*k
z52&lfg7pCMLs#H=45o%-4^btkqL#=pLJOc={|BKRh;L9pqqvJZF!KK22Y%K53{pej
zOoJ>oBTmr+{8ThV3vt&fsg~vCNwrF6WL<fh6bq~g5nSTb3xt)tq}8bSfRjI2sh(7E
z#E<*S1=BZ&i@8T%Gw>`e&ASi0MsxB#DQx00Ge?8-^AW(>;9HvoSz*kgI!9-)4Gup}
z5TzugNv=(_8WQ&9uNi%ou_7B4&KP!`)?iPpv7uL^NA3CZnGj-5>IR#V?0@1DD-8>c
zJ+JB!V1w_$->h!_+VRHP(yuh|>J&L%>&CEq65VBW^SvUVh;w%aW-es#D@>XBX!T7B
z^%ec7(jz5i;I+`;QUdncN_YFmN0<fVl<YsctQcXw<FeD6oG(!oY$7(46x4IG#YE;O
zGI^K&@<hw>5`YzlDlX`F!a*J9NQd*NI&sDSxUaPgEUg(-JmGuBd04M`H>s_1G*rJ3
zo$|}_!hBl(+v^gF26Q7N0Kro;QoXTkkn~HD>9Qv_uWm*2y1Hudws;Yv>&r{$R+kZ4
zfk@}$3+iG?jU=Ob`Y@Dh(bVQMIv)5r;PiO`sI@7z{+PTh*TEQMKk=?XER3_^U2oX=
zas48iizrle#KxH@Vv&DcYj}`rH*UF77NJ>2FfGY(zcQ&+D@=h|Lh1xAlYwECT?&`^
z;M6TyyxXp-clMsnuX-Ma+etQ(FYXhTZ4JT~D~IV`sjB}Jt$1)UxIHke$bC@eZDBGp
z!~LT)myKJ{m{@fLN*=yHCf$|nqD2fL-}1zM9oq8I1Tm%M_w+ZC7`9DhEKQDBnxx9X
zy-sw!w9?d~Hb6CrRotE3qz(>YM<RF_>-_C&<JqVii2K6L7d<z&7PMkpC8ED#x()p?
zAB8O^)h}Cy<9hj<lmvD5^Q#6NzKSl58P-kXd|DFfSYyQ@eKU?JB_?qXb61;e2TiKW
zZ}aaE+5o7eFAO~I2l}StaODH1-*jYS+sZ$_8ZJi!t*#B2_2lx6BZu_I0=7#d$-!up
z0r0B)nUg|l(Qm^^2G-F%nwNuias;D!23EDwxn+dhN}@C=dGc&L7~g-apmor1r}Ig}
zafm0mi46eN7L=cr?qE3D;{|LGPC2T7ybHN009Ei~rbv_{W7wD`lDFGWS#m{eT3Y=1
z0ff6Eb*C)buA+gK$OC8~b9YU3JZ)ultt#EC8K|`87Is;6KtRigOyo};DD?`_iV^m7
z3;5(;w_MpAXc??TDALCeo)Vk7fNq3YZqjtk;+T;s1fncn?hmjmWzNleOC82aq}pVt
zi|751fgkk)qjtl8x|MLiz{EN`5kxP>iUnF}3ox?7m4A!99Vh=)-tD-<P(Gr|3vT@&
zTc+aVRbA(RG2&;W<$L(2hpq}0@Efwg^E68|kVBN0M|EAS^UKOdEZpK@d_4+o0=sKY
z=KZT)!fIQf=Pq_#s4pi&-A4IKc^JEFN(DJMM+SI7hYIHUDcOV*Q&O3a<ppz+pWe#X
z37xTQ7_a%zK-dt5TKo0%?77955`tw3-Vgw}dtlZ(REb}{>`E=ENY-AB6ZBwrFXD~;
z{AaAjLBBDQW2<~13Vd;~-F4al)`L55Y{iNo<cNOw0NsjJL%>Y_s^JC-6~F!Up;6A~
zRWwCfM3j2|w#45GN5%9nn?ef1b3<H@zF4i(%@V%Xu}RD9u8^7-E%wmG2<kRrK0^iE
zc`)I;qxFNn#@I()MI;{^$H`sP_pr;?e&BF%>J;9ssu`Ny@7b{-^psyk;4h<ZaJ7!o
zlq712=W^03ZCU{U(_<16j_%Cb`mzIaj)Z9jiZZ-({&b|sGJQ|s$*_j!l+Fq{0xqH>
zTx_d3-<+H@yqVWLUb!?!9=gTAN+457g~-UanCIc~2I}6ubNlSxmc|9BmktUIk{>P&
z{Bu+aAqVk)ufid6gm86%dxabNmJv0Oa5FjbE;I&q0x9+Cno;P&zsy$YZ|-`fykmUO
z(Uqy<R$NIE38AUr|1l-H6X5(yiaZc-`FarZbHUvsMvnNP5T+Vinv$5^w<D{*jL4qF
z89Ge`B}3nPGn6`(#PGtw;8qHZdStN89P}Tzsruh@O*X(zuDDgG!9Mp$e*yQgF)S4D
zA711T+kA;qkS%QVF4%T4v&OGE#8`TetGVt5fUIVqYhiyK6FBI;jFh=4`|EGpm1kpG
z6*%q+m=d68d47L}?W92!gkx|*JX%=b4&lD<0q)}*<t#@}zfv5dRD+bHKTfEt0Gu`q
z;|`Ok7aw!v__hh_a^$`<y-kxKWft2h4?tQecHiaT;x0&V#3Bx2ooUL7-b+cc)gpqD
z%ABjp)s<O@;WTC0YS@tENW&V2H@{S8h*_Sqdw+01bQnQYpDn6?pNuIaGVkeHhz_k?
z&=O3YR^Hs}9Umiu*UbwKZ86n_U3va9kXpl>w81O_qPCk*yXEdo-U*8sWPDuaL77ko
ztYbrK<_?o6$v^si>;{`*Y3DRY${u0wZomf-rIN9~58p^h*g*<!F>1{j|Av4<Ahhy@
zafaC~b)-1a(;2}$b`HUqY(yB{!g=Zjs2TXNT>C~i{Rpnc{QE+$XSiaFWgCLBXJNk`
z8RiOLtM691&kDi~gPv@OBn1AhLB_`tp0B?sxe15U*7$jfjECXDA4veZN7!@EfcH$U
zpTvCh3@ir-OMJZD`keqtM0oJ!Zi9i-uY3$lZM0WOM5pjf=VN0Kc>9<{$h<9kEv<^Q
zG{9_Tx?4#@g4;i9I-K69n(5hKiMZrS5eMl|rT_iQmE^eUs#s*IHXCmLRa=p|M#ITu
zch|J1!w{3IhQyY+%8JBrYd(uZ<b8H3jYN}+D=?=EA#c^6!MILU4g)6a@L%JKZAopV
zK~@WjNR_{3Fxt*3mTw{ur7&O^D}@-ShoDhBvzxZMeGfCc?d@jSdPh>(S2!ai+|WiN
z(<yRRGm-^0xAUKlrCV67hztd6{(PTaI(DwLM5^<S5noK!zHkm|;U*Twc<`2`hD>e{
zC0h($h7BPX2GP@h+wRsiZ3#=DLzfaR&WblO+%1|c?E(eOlr_|HV0Z*O;~VuKk*geR
zCDt$1!EV=YFaP;o<~O}C#Dg19`tl!%Q#rxJhKURmuZUyWOM1#I_1|I=HD(NdSPA{m
zsNm}NkGrkh?J?TaE3aw-$Pc_xF+zU|F)c%LgfGZc|9Wc``Fb#}OPlu&xe_vcvTT?j
z*p-b0Z$T2ry>Bt?Vk)>y4{U>T3@&XLt!DI07znDk3r6rHm{3odQHclB8)8LVat3o3
zd|n5CDutIk>=ZBwx(T4k7|O8!>|pHsEBFBYw6{H;AQkVDit`IdZfLEhVF!-H1ErY$
z9C7oKWlc&a;d7$*+&F3qspba%9SqyP;y5m&98B&~4u0wAp94=B>7!Mna^Ra5Y{!8@
zE*w;~1sQibI5C)%7eMrr=ReS$$qFcI+gWi8D4ERCZcA-R7=L><Ki;Q`MJ$cAzig~#
zGhTd%O9y5y%5di160|G}yFm5LiaX&iZoX4vw;Sr<^K=E>ZWsp>N%M&RK*NGz6J%6i
z4+UEwis0X2i)m4%OPm~SsRWi(L=x?LUKhdeA6KBSL}@@V4xH<nw>e(^X<0>Ht>!^K
z9A#6t#8coB$5F6kj@Y_da4x)Y2SjaUd4CXq{_f4aY;KBc)gU3A>>}gNZdpZn;AI$<
z<;*K@;-es|Z%Xjn^;Lc9==+x`Yz+XD9I@{57Q8AE?ld$OYZ06YYiq?XpvU>A^`qF@
z|B8KSxvx+KQ`h(W!~W({HJ=|hG-G2`H?%M9ZupyoEbNy-^`o;Ra5Y`{yf|GnIWUN7
zj=MHb7sRcWBS+F=C^RHqYrb^-+w0*OnVC^6L5tx@3-gJR_8wW&dow@)FICX?lcSc;
zE>TQGYU5LwtCpH|h~A^M--Up6tc#pa{RKzY^KTHwzEuOyK_~P#<%*Ku!`F(qdk&BX
zQ<U>u=JFEh0uKfxhlfV<8)nW-d98I#Jha8j81y<3W`H5NVqRKWB(;YJ*_F<miNl^7
zCS(`L-_Q>Ds)K)Zxr43NnpYfXjXm`kVj!CGj)i^hDilFx{!dBYLlOMGuTOJNFqFzM
zR*k17-M{o8B24O?duPoQ%-UEq1zln@7cI}ycQEx4azbl4*L^Cb`pK$l|Ai+2*dpPX
ztKFU*_PfhwkkXwb`qSUde7*`KlA(;p37m|YQ^e?;CZI>5FWFfK??*Dxr{3xjv153e
zYur**8}@s9nV<h2s{+m5ZT9aF@=K9MJ|LzRJ+oT&zG-%1q$9e3U-qiDx}%Mj?Q>ho
zL(Pff=&#m}to<EBSfTGR#Lm}lw`tT8YMAVIxnw*Y{>2oaX@g!U>l1y~a^}kM0lD5j
z)4E`V0z~|{rZeAKEeq)9Cj+rd47cMf|E`IO6(wpU?{7%8WXx8~^C5o1=;}zd*YXC0
zco%GcMDQH=%rgZD9RzlU{Wj?>8fk}>8=XMtW*0x#pOKPi!fAqB{HJo2f}!v0wU~D!
zpkv>XKR<Z}Ljm@oe6M(SW8E6B`=$GYkK1(657)3<vE7fGe>h~b(*JF0p=rE!bF7-|
z3ixa=eR=SNGO7Pxb8;rc5cQDreXA+!FIbB!5XD@r%(<la4r@_l;q~lSVc-UoQQ6m$
z+cv4Y93&)-ru^<9{+56|RQ`#@OK66Gh4kJ(@^PC2<o1@8vJ1LVIe<P162G8plxBOg
z0v3&RoTl!NKE$v=f%|oqg>~&FI}3{eU6@voNo-y}Icu`s60I|?pf{YE+Wk$A*j!$z
zJ0F_W@FJEH^Kj>Wg44wC_>FGKkB-;wNK@%r8%}>Pvt?-QUokC{(sVj=t@yH<A6Lk-
zR0}KCX!X<7vNwHXl(ul=T&`S?PXNA>48R^~Z};1l7<s1jt|y!^O1#A|Iu79V&(MDW
z(c#lIL6>TVIB*3~BSy#c8y>cceiUMw+~p=KpfQJ0s|-^ethP?kApmMKAM`Ju7Szoe
ziBjd6MZCfH#g<Mu2fyZ9Y*F1^eJ|~VqKzl1*<498^4~^B0vx1kn-pYd$g2y(*QC}J
zqlEx;ocm8dt4pP8zoZlvz9nDB1qDk=1@;85T4xn$k6<K;{~LVf47dB3q+;~z+H6Kr
z0iZ&~Jh)ND{uIxtOy&69ntfPMMa^jOf%gmv*fhW`b4Oqh&5~M=7nd8dOAT2f5}M(^
zt`ghk#A*&7c-4%;8!T9k+_rJ<X~mB$IrFA}GQLUTm<C2PIsYrlQ-g0X9kS5n{scTK
z``f$*sv7Zq2Jd1vzQYlG?@lTSF_J};OPO&6L!9CL3!~RnUUftvwxtspei&g94Lk@_
z0{v}IIqZl^4qEGG>n*sv*~42;APbwHPv<4W==;S*;v#)2^434V<JdYaD#zDY$)k_F
zqkLcSK)$vo8{7v3VNC(|g}#T)MZ%Y^Rab8VKR~!ODMLlb+P_*atUuA*r*jFD7~_B5
zMev8~DQ1VCkH=lvY4?E7Kb|ghIv@OAy9KNS>1QB%#FQG!xs$qm?nBZ6sF|(qKw}Q^
z%;1H5xO)_R4Z@2kISN>#WtJd~hFG)_qrJbH>773wo(^}dDX=oi*Ow}bM;}-uJpj_J
z;roTja<hily7Oj9g^Vh~yUXy)N=d{Dpw0kd3#tP0j<e3`tS%G0T&ku)ZGb5v@)B7_
zs79f`D5WM>`24x`N&gk&^jviJ85lLa2e{jCx)}$vH~q0up<7Pz5%y>T>`<8=q!GDr
z#BrC0A{$zg9VSz#onSI4RUh<!exgQ3gd&6FV@L)dCfpl&M5YMom1nYvTZDnRi<7|q
z_26cDwoBuPbbyybx$K-_MQkAI^|Xfp*TvOLQeB;P5gAtDNwz@p!oPv{zxUJ?#<2Yl
zV}>~xCyP)1r24nkY#jN>m2MC)gr+0fw<bje^coY|>$t4`pdXDP7m186e}R_{-v~98
z;5d%cwY}q_7!6J*FdC$}ov~wz2j|{xTwMukW47`ni^df}NzA-H1UtfiR2K`2U}ovq
z2k-dG4NJZr5b>6EaU5wk|5j>>Rie9&#5<g|>~P(1v)jz@v(6o!*nVr&(~_ZC6>}{;
z)i8|%K`(qOy=&E^v?kzwpp8XhiZH^<>fv_Q8}c-bOOF+2v|Rj7r>f0#GgA&1>l(?3
z5mO2@*LFL-vYjL_5^Xvc0zHeHx#2&ji_d%a(VfR(ZDRvk;cA8poB%d_5E^-e6c$<>
zR7tykw@aE>8RDJHotG<yTGW_+!+e1$_q-pU^R-!pwB<aJ5ls8=iRlV;+)MutP@Ckp
zBWgy$`E`Z?Zn|HU&ohJx@U4GZ|5KG<qr<lCHqDbhW!_4#qz^H>R8rlJ`RnMiZ#kV%
zVeS4s-EY6hx;v*PZCUu_q+uUhb}@@VJ_5mh^(_l~hw$x;gZ<!Q;V-`jTz{Ne&f10u
zS2wP=4ChD2E)K?ri<;9-n(SoT?dh`Fd8l;hKcFMzm>GiR!w^?qv15EyKx+@O;H3+{
zX^3rs4FiXY#pK9S-ugM{n@{VtDWaafNqk)YwNu)$xfh7PtsO(bCpo#?v>`KRJWHFY
z63trL{Np6#bBtWyanytc<wv;Q&xGF}Hgy|g8-Ri!L8%v!Myestn(}`*!)1Z@hnne<
z9{xHN8wluBdy3>4I2}x_;rfSViOP0}ZSbVmGKe}Yn1%g3y9V^lT#H^jYDFVOn1a)D
z#RZ=3C%2tb=c0+CP7A?Wlw>H2p*{EIJHc1OV>1kjF9|SpY#Y#_n{SY^Su)yNIAt7V
z7`&>vZL<&oZDe7e!DK^9cl>HjMUE2ZUI`9uU%X`oB7C*a&xMD_zbWGjf|oL3q-&N7
zi)uMcY_&2GmEv%8##=^a=n3=VgD@3l!aBkb=L~HDnK%XI=?7x8UqEHhAap%rizScp
z^jJHK2F79;{)!aL-1DVjEH|<SLu&8b_*Vrwi`xn$kpceH>PN?BmO|&rcjsT{$y%+e
z@k^KLb)G>hr<>71=xHJ%-z6Ts7p?xZqs7y80w>{vd&TZCtAYr;PQzCkc7zl+qzAGj
zMd=6nGfHk-w#_p@zC6in9P_!%)Q%eKc>In>9a5sHQ&ex)l@{mSoOako$-}=n?uwdL
zNPK}jS;Wvps145-s>*-hs#S#*T!~LkmHNTWhLUW-x_DNHPS!%Seb5i&cFQ0LvbzuC
z+64v{N-#N<Yv$^ja4)=aY>_$p8OfgEoNEx_!-(c(o=vKa(PCKaxzu9h##N^14^82@
zu<h2r=lC*n)$gQL@tx~<AL|2r<(BdlU(w(+v+&0Vj1ujNzBK!9HJ&x2xCcr<46i8L
z!-5u6xLyQ3GdnN}TbCe>GFE7Lb)m}Z8`0qL9=`}dm6)V6m!tAy8nBz*nr76)$S?&(
zs7-{IbtI>yc~*={1?}xN-X;r4Q2QtrFq8R&v568>PeV<~2mtpr(_ThMQ~tE&J-|19
zxuCQ_!PErLh98P7e@4u<w7DtAuU7u4wtB%Eo;>`2x;lK0cWH=*>;sQ?spuuzde09u
z=UZ4&@T1~|mM&2NDwof})c0`i^$<3#s(z1sMj8A`j?Na5N^}Agtjd2cxR_Kyw*-|5
zu(yK$yS&q~2n<^6&#^jHx{zrfBiCLgd2i32xw%u0!~cA71A3NoQrWZ5@2j?&e{GAZ
zKfL;6+90De)ddXP#OuNWicMqZxnXMe^CvBN)bCLlBRKlD=+%3Rg?%GPY^O#$`<<)e
zd-}A!Nj%E~Ni&79;lQvAdit+93#4OX5%0K-0q@+SX*)ynN_Tv@1gM6KH3Ymbi3i$o
z#zzhvw(b6aPqgM&G$OZ7{*q2WTPm}=wY|F?GNfn;OGzfUe%aP~Km>^|T88rRwY{xK
ze%+Bt#@vq4P^9~58sK<gP!jxtSi>E{>2YL-O@kEm;IMqaA}EaO&DB0g?9!<BFK2Ia
z)N*8`-ua9bq)+}x@;L#6&H7I?;Y&fgC&_*;tYuJ+@U+M&P(HsTkMP3)D_(dNWrEN!
zYD6|mGQc>8?(`U&w$J;Suk@lbDOfgi@%322;Mjvfnv67ihHUoZlTO(hWQy@G5Z7KK
zSV?sAPniHS{mMXEk+4LUh=510ZghuXJweCaHaEHb9~1!4{f+5j;!Kv@be=HosT-tM
zrr2t~J99t>Zumj%J)YPB`sxRgINk##(q#CJWfY|vZ2_Iym`d@0;mJ;IR4s;+g{-7L
z+5w_g@`a#+W#hGo`6MQT0(oavIt-h<uRGp}7F-h+PyAYSutDcV0f7AjiG7mCaHA>;
zZYZ=%{bH*c0*TYiU!wE#$(2|r7ET)(<$e`?a_D89+&l!8JdJ#j*{&jHCm73{))g+Y
z6z~4B(%V1JS?4td67soGabm2M7uiMMV0v7z3(R?8FeBGlW)_rNk&ka6dO3Yu1XT`P
zWjIk=pj(qB3R67McF1_Yk4ol7nTw5bnT@Z53w-JniR>Rm?XbnVu4KgQmoppUN3PD(
za?TiH3Fa($synON=y57t$8`%&`L(VcP3rX%U;@c4hB8jpiDd!2BAcM~ifCl+iovKa
zQ#bQRI5YaZJ8!mwgCAV^KuJS>s3-5EMd9gU%OKWe$+~jVX%L(bIiHoH$EN#+tYYd2
zN)o={;~Jzy0=>pK3gYS|kn`WwvW>Pl06toUEa{kr$UhHiu^Y{Ow3@yn_$)Sibv70X
z8qM5tMOnE#Nor~bud!bePa>u;-pM5Z>U*+tebUA!<L-epEb)H#bVuD+PpiUsi~V01
z3~2H`4@p?uCXhDD$5IC*TL6Hh37%;K&9QHT^j=MB+wHy9K9glrxd48ed#!uPRK~UW
zfad>K`U1H9`Q7&Y%56s7|IceXKTrNI?|AM`az>iXA{afCRp1*xU-k56Usn(7;*^eI
zLfjTk`oSo)XGUEBG=pI_pJiwt7}CP0O-$Q+%F|0b%>uTCZ>BT++<qzhZ$(T8L5}Mr
zvN@8;@~^0M_Ekw2Fo$M3H^Ys>xe3a_x-549szU>xAxqW)%VpObYibct>iL;NS0Yj1
zV!QdT4>NUFQD!FUUE5z82(@RrYd6NR1oEW!m~8Np5xcI+dOHr(2EZll$3$kNFf35)
zC`4fMRtZzvdyE{aL%;H%h@-)!v2JU`c&2q?I*2c9jNo~>8?G{Y7m5cq_D48WLWr5n
z62fSV5q0l+C0t~_^G`rWbaG?2^vI?1wI#lH%2VW_$4MbqPJ<VIf{*}{xzx&o8S(1Z
zrM}(4!B%jgzLH5$e)W}b`W;Fy?t!W_@cKbb;{FTODRp5PSYVawivFiUKk#qQ7a$fb
zo+9s8@$|t+NgIhCgqF#UcJ3eZ3Vore{iPh;)m{eLRFilG(rK4t(><8_H_%i4I00vB
zDY7H3p#X}I$@6h9;%4+BWD+wy;0%*T@|!i_gVVbi(dNoi_&C6m`bJ1)QA&h4CfcH8
zWH!1Pp;`mSJMnqFWm`F6v?cXQA>-2@&S!f5&nW}t?pU3D4t9`FXZ}jsRQd3kdw5=$
z>*mO@+9c4^gcIp!kdPbOVV-GuT2eLV4S6D|DuQk>id2#WmuKBqifkvM_VLcK+U|ua
zRVf9^v5?XfeF<_v(s$X<5GQy`xr4s0cK@jydh@GR9WmHHyJTJYc_-EgeHOE8LbLt4
zN3zXW1<#h7!h`U#x3Igf5J4@X9@e9b65$2ZB^h}ncnWan4h)u=AY#w_`_<~x34s=O
zgF@k!NS~zleYB!M)1hu0PO(-}8-ZHdAAhduE7f9Ux2Oi(@A<P@O-CypC3Da*{8fDH
z!Mp7ec$-6Obz?EKrzSC}G`m-|81)|8u@0G=vI>4tV^a<HO?$pVZcP+DzhPeFO$t$G
z=dHB%ISE0lAxN|+b{cYos&;bS#P{K1OR3w1>Wk%Rl^zwIJ>ml?CuNb%NH{J2Mt^v3
z$lquJS7BON5M-CWfOqUhVu&mP7*;em!p}mPMpU@Pq}F{E>Ib?2h0Z|%yWpiwuaTs{
z^AT%GI*FmRXu$F%sCNRMh-Y|Zh{Iwin!hF|wia*MUvDJ0h*io0{=R~0t^ePwQFb0V
zs=z#Z_^T_I8i_e#K%Yt;CjLgX^%+6hw)#$$-BKrpH=LQsm4udyGOkWhh-zz3X`nC1
z)TdiEY7cv~F?Ik-@9+@HZl_;zMBjOe1h8hv&h4eR$o7BlQ4~rOHkO8(_;j8FNj?lz
z5w>dYRv2%GfETKWYFQUm8?|2fi){6JQSiUZXaV>CvNjj>4ugce&!RUJ6Y?w%j&GVa
z!z~3K&)`Q&<Hi-{Erzcdln+4xS<-G4A!qCKe4?}?o^fS@RV!g$L5_g&&b3Ouw~M+F
zx;2<lMourrNFqMNk+wT@8w)wW7}CB_Gem7vc>+w!+1AtiM9aTwY|y78FJr+`0F3Sp
zx2dwl1Se=eo&r2sQWK1aSr$59RrP6BB^ZCv23fFtH2!79uOd*?jas?t5R_S=^#Lne
z<;x?@{noku>vm)JkWyA&)3ga7jXu<6|EJ=uOCtTZBdWcz4%sGES3wsO#gMezYUTRD
zw`f(#uZgE8!B*Y}SCTb|J5(rwUhZl@7f&Mh0CF17+1}Vw|Fk!9N3>Gw56o`WSgQ~k
zNnhD)=lOgX_M+}CN2@Nocv&Ao7y3?NxH;XALCF_4Ld)L3QYqkF!2(u;1vefnbMZ7o
z%}lEk>u{|@IWk?gPWHJ-y<wgHh6g^|olwK$PnwAI1*GSL8pu+dtegzF0=WBHZ>4sl
z^$NzgpL^fDK$BddqrVf2|0+2QL1^@sUu9PSM{Dp|+btqrvBCFvX(M`OBN~JUlUZ1;
zB@k?Q&3GHY*IFci;-w&54NL>5vS?r)XI0~yyCz{~XMr${6E9Q(G?A|3^;A2ZQ{t%B
z<PWCiui9>iCa}E)qDfun8S(-llGDXqU-g^o1AO3*oDrobJ?K4#|F$D;|HHaKm(kZ)
zO!O*O!<I=5Vq0`&i<W$%0Fk@XpK)1PZ~P&Iu5!(aG2Xl-&Q-HABoaX^I{R3H6I`g{
z@@tD4%;)y85?K&&&~-`ln?I#DIA6)xSrE^|QuPZy;g3O0KOkzjzp1{V*tD{s0VZF;
z!NMNcmr&qOjE%Mcdr#Lzx3(~4fAA*)f6zbwOKLD}d+n-0E)&QVSMM;M`9NFHwW#nz
z999QL)n7KDhSMr~73adWk62*eNC;)18j5kFsPDXwRW>^~B4K{}<E7Frur)*n&+M-i
zr%v!WkS}tUYeI<L>zU~DWbKG>-{TJu(f^cM#HsJQ(oV;)gHWNAoZ(8ec$RQw%*A`l
z(L}eG^=kMXx2eOH9KAw0tEFBp25h=EPFYTq$n>i%cR?P0ymUam5<WTsGh-T>n!Xi$
zL<AV{D=OK@h)x_BK2XJ#@5WvLsQiRcE)oI-6tnNu1(G)WDm#@zea`Ux6UjuSlR`>h
zN#ID?6x<4FC}M@Mz&!H3B=C0BVtVtG0oc<-zts(ac7P@@mp;2upzq8ggQChCBznar
zkyh|pZoc6fNjLG*sZUjU#qZt(ef?6FpKcS$BuMbls$7P35SY-AG=Nbs>`s<oneIWS
z-8@PbK!SGoL7+i5@^?lr|BpbT4&Fa{!MRmrq9nn7sJ~|cl1~Y|MvQ|O$Ll|?zO=6)
z5C9zwKD!2=*dhji&<_HaM2AYoETzgV7}`|FxY+ngM>}}FX>t~#RTC;C+p+T<LU{xO
zcL&46X{`Twe1$7;HBj3^Ufz!w6*p)QD<(z+y-L(q{OM6daM%Hd&l_oU+(jF#%LLFv
zBS+}JKan=t3Ar-@i*{um;qxR#2y#S+N3xmouj_5bu#przNq5kwl8)Hd02W5mgJb^A
zaO*~vpo7DcNxWDr^#-(5y~Oq-wQAiT=cOPBlfsQ3ZY{>!;}lVu2j}d_9HitDTa_>4
z8$Gd`PkMiD5tV8quY?-bE32w?t-hMLV~HIAu>r0tamu+=th2~*sB<XuVDo!y#y}FH
z#R({)R*r*C<66C-PX+mns)=V^tZshAgl$o?V@+-37S~IbRs+X>E^AmYG$b$UmAP}s
ziV5rRpF8%&n$15)n@mSD#(ok)g;RmC2VEzx%10_aI#3CT<h}nTB&Hfo|JTE{2eRm8
zzZ$jdfGC2Mq^!O*+2H){Au57er>PL@mMQB)lqS8DCeaL^wy8St2oheheuULF6$`~2
zJUw#`5`jy(R%t!_$=KC=W{TjYdvjcR|Eq(fY{#j>1^!80d%g{vS)a!=niVy9*%+}M
zpDwFd=vyP68k`QOpC*LmA{#`E9N}Vl!&bxC5qPP2nC)-sqd#RR>r1&>Mgaa*EDRrz
z;0)=1E?j^#BAhJ>S!EW7ZGG-tJ#pj~8MeES{q)Z}9WtW~{{W*TVCubpO`SU{yvweH
zNh#2I>kac4oF1PJ2>pzyJgUJ5&;;?sCL_rvXJ*d{Aj7f-y*GS*h2O}o;Ew6T!jw2H
zGz=dXzC#O{ybap+hG*4Fo_<d;@G#uzE^~o{doB9>Eo#vyzZ>3BCg_`)1W3!#Fh>6e
zkHTXWP%{Y2wui-@E(PsfSYHxH6i*AioZ;W2B#qPpptyB1w0J-LJyPF){!Og7ox?Qh
z4$&u#y9%HHr&RS-)#~2?t2z+>j5NED14y$*b${F$BiOakyl&|`&}UqU7V|H5ARi1o
z&fg>~1n<>h7y!5u_J*@Fe3dK{pjbPCUiiG{`%5+Lb^#HUp$BT4o6yiAC;}=#+fbZk
zn7K+@<Or8Vr7m{4hlFh@UKXxFaGawrbtlm2O|8sLrpphCMH0J@Kh3Ik<n4Fe9Mp!f
zSzb!eN)igZoNkuE_3g{*;SXt^%Ats=FRaJacZ6%fUqHX_4l+k-DU}6K|AM5z%RsLS
zZ6ogfvI;n#nP81HoBs*xFeey|Wg!|xg=-q6RDTn!Mh2!?MG8)%*r_h%|IIXXHlILA
zA`a5-`4-7ryI%Brl06FuL-0`4|Kpw;=)GD#qQ3+TmaV$F6BYv;<+y0MEWW;#zH1pu
z)>czvS%H4DeW)!cvb(P&iu13=T4Z{A+Z-yxTc4Mk(afm7)HKfFXOID~b}&)3pzIva
z361?>SkT7wEYR(AHJoSELLu)@!vik%Vpx%IaV-^Z0>yLjCDk_f)m=)i48V`)WnZzS
zO|=^B@nO=#Yut&sf69h9%?>&e?2ijx^YY3Hb5nW4Wo2D+-FBB?p-B4SH9_T{M5&Kv
z-EMZ+j~_Qx)eE>{|6bZ+KlUBP;19I4Cyq?euo7c0!q-8>c59boZJn?o=!h_f;cno5
z+c)KI$jg^xpgDwwWzS}^Ht6~J_jU0M%p|y8p;c>?#WUZms`%KH_*GQ6%m2a3a7_ft
z_dYvry8^V~*A(tztz_r{uwIM9pp%AdlR|U88T8grC+xzzFDRb;FKcW}ac2Ej5$pxu
z2qZAW>$~F$?iAs*?X(vEk(GR1nBH9>3&jV6SGM+<g@6>eLU*!A15uY^5cH?uxhFU=
z{UEg%_gxcFrBBAe#iIvRo}N;D>|$X@FvP&pIs|%+NZt6;M&9&irHoXBv#oZejE9!@
zc(3u@0DocoBO%VQu6bhGa!1&^B-@2)G2;Sr(*k@XZin+|j7!XLNn$!Z3CTvBwzB~K
zn*#IkLw&(wxG#uU(Ay)o0{%OdODASgCai(+lZQ~StSMl%`w^==z`kw?^`)k8%Wj<I
zyTOidwxf`{_dM1S>GbUje$;{YQW8*|0Y8zYCh+NQ_y2d&OyDD^nT;0Rl>9vGM@5nr
zMZRaAt>&9ci137_moVH$2i;l>Z&Vzy_S#7>L=dr0qBbM8{wkKkBh^*CW5jnHjJ;Su
zU@s`cO82l>U@-x#63x6`8v7xiB-)I3>1TgWJ}t`A3!t1Aq8;8v&$>IJJu-DBQV%WY
z8co)pU9ilpgg%7<%W-}u1-K|*&U3{uwk0@Dd?|vU;|o$zy7k2;WXgLSg)cQs)6P{y
zaC%{x)MyQ28u2bYc2R?AC;?gIg}S*6Ml&`MIiRd6p7la)8pF@;RD@*5N<pV=!v&c8
z8e&wjuIh1AO+DmB;OO}kxc-CoOh+L@&yVUa)@O*CeVQ?+pf1-zs|e-y;HA;6Bl6kv
zm_dZt^-NaHdH*&)(>Vz9rjmkcwrF$k5H*4SU;nI&-{gb>RWAMtroGbvR=1XyVrJp7
zPciVqmir3ER-*jU($XsPN?dkvC}*!QJF-3e2WM;hJI?A1M;$U}nJRut@H^u5^G~;&
z);th|^}W%*j7&qAEB)3d{-NyIb?iG2i|QLtMW2-?aUP<j$qoI`kdz~33?X_^X)S`e
z9rLNLz!^;Q`6VMEMP43=$j$-o0LAqrqZ4}?<iy^lko1|ExfxS)AyV6c^dtbrt6tC$
zy9{9jGiw|=Bnzr`cQH;c`ZIdMD$DD+qPv8DA>^+qiC@QtdlAia$AXQ{aF)BINxqJ!
zbOU5}iOZxn=1dSToW>OU8AgB5h*NZAD=a<r2(poU|AH4*OAnLz(?NSAFk>>)%br-L
z71KQiRLhi(IYbJJo~R+6so^FA&VBlqx4qBIFPShGFNx_>>GL9GKVScvr?NvWWi@{T
z1RL@%?pMQCuOGxms~u-pZ^GG5&8WWL|55TE<Sd0<18<2}NW_ky7A4GovFWaW{|+ea
zAju!$8LXRGqZ@!<Y2efK2#W(6vFEk+#J0lT7gWOqS@l;nmpB%I5^6YCz(<W`BX@j>
zP(~mrbxO!bcq*Ae%P#*uHZK4hC$C5)mOXr`8yrnk*H*iVGixb}d3glp+L1`4ej%D%
z$h!;td8VGmuYxlMl{J)OAXNOVKV-}5YuKi4`C6f$h3|B|p;+rurmC?F`(zhEj(XEf
zxn%N6WFno8w+~Xa_tRP+qwP#AhVREuM^<4reGM}k3uH5uJ*{WNTsa?o0r_sxinbdX
z4<%4S@4zXP2nIBX<R{t+vx@=w3O5+6^@5#&+yPuJuO}O+cqoN1oEWQ0F3J$4>=*0!
z->+%Nl-(W?%sF+BY6}fq|NE~A>Q_W<x{!DQxahNm&H&`vSY#AIe!2Ar#Yt5nNAadF
z%ghUh@~JW1xDgDUjpJP!3YqNsFAfgQLF%y5YOd6HBku_!{U*@;5C}Kn_n5xFl7y0`
zIg1+g&^|L@h-z1Tfy2y`t|B|8+kq;eRbuji7pIb<Qs@csIH%2f1HnkOVE(HBak6v~
z9(ggDCP+3D-fJm}n8pw`h3q-U36OyRY$VR|w5hOsC<On3f}2y<%iA;XW!agHM#6-U
zzMRP&TQRL!J>hhvijp9Sq{J;p;<V>a>)wLkD(Ss70%r#zSd)#(Pc^$d%Dg+^<Z(F&
zVE4jGFp<b)9N0v&BJk3$Ajwv4y{`}5&U}s*<4w&QLyysQUi5NdDlit<tX-xR<G<6%
z6&D=<<>g)G+8s%BqEwhr<U`3A-|+g=RV`UJ%j+eVMdrn0XnDS!Esb|G4j$+T1<m}O
z{C!2iZV5ZG<X|)7PaZ_pF~K%k4r&+`vljY4&Om#Xi3AF_mZfj5H>arK1%3<T6t2u8
zMSzIkFDaoR3&>_m418cwh$_FMRKqzvfiq3{*!9;tT<?lPpB3q%tM9*m<nd)`gN}h^
zfJT;|!zPxnjbZ?l&Tz%uLCYI0A_-HM!(f=TJ6s-9y`VZ}_^4&Xj1OaG=Lf-*p0s)G
zItQ_HQ<h)t|FCq`QB6H=U%Ey}cL>O&Ll7xxkaB~K?q-A_GHIk6X%wZIu+iNhQcB0@
zP7#>WDe&(5JMZ7S+wR%9yZ3oMNsl+NcxX!+rI7HmmFTBAzrtU81=LzlCXD1<|6k#x
zX4w4H%08S5`bqn#X}3)NEeL>HN!=XQP_HqYC2>}X&Axb#Cr13e^J#A^HdU!<t5|Y0
z-j{>(Jwnt5h+BWdCceCa^N;tFycNmB=#2ouS%Jsv0A+QNvtx@3HhPk4HS$x-JyIh>
zawfiSm|cW8A(=)CbMR>G`%u+3p?YQBx}dGohidiQgtxf`JyL?C1~$ARnqS#^IRlVA
zBr~6?Y(1I?Di7t2&+v^D14g{z!abRvV}M<0PuwIa9Nc9egj-fU6+2*+{!SNwymR@<
z82D6|h>(9gH=k~{RSJ!1bRwM2T6{Rl=4w+B1J9WV=HIhy&fzi8Q_YAhJ!Yt+T}n!d
zy)<9-4pR;IhDm}y{QRmK?~*0_!V+TkK9sP~u{ucF2_lZ`sOc$t@e>~~e9Tg4cr|6k
ziEunfJF01VvwqthSJGX3fE3vmMCC1V6pByc6Au52{PPsx*Z4m4;-E~U?55{GvIh``
zC40n_#<8mIPcsLN5rzi@j0%*!RMRCV23<(tSz*-sS9lT`N`ghuq_T51uxsFg!i2<+
z#Pf$kY}XD!(58H-Kn&;pv>cIuEYne}#Ocs?kjdgve7;oP=yUME7;z;eN^9ZWWn6q#
zr8B_-f#_je<LI*LqcG;J{C~d$#*;Am4`<-&o=MIGn9CIkJfd$R3%?c*wH9pFlB`~N
z(dWND=_9K{hly!CM8nyywHaefU{p#yhucp*JGJ`+=?e9ntlZsy(deCwO%T+fAJIEU
zI?C3J3poF>pqCdF<wg;D@L?J^1hCahmJog~bYO=}{P4P&q^vk$;{$Mccr)$ONT5p>
z6#PAzI?`lsF)mzXFusr!PP5#TUvWX8Dzv-k)jK_Px3=~F93xpI{#}S$+ROr!koz|t
zy;p)4$sS?cie<aR(+o)HSr&W+WwS#UW}EsvP<d4OcZ9%oh9lNX6WJutZqbYi0)7{S
zGV7?XV*)#9G=D^eP#CL~3sLnn5NXe|yop|5(NXW7_F-e=r>cWY?2tWee{xORJO=oP
zK$+95gjSE>;^BdQNB`P8Sj4N`+sfD2E0fc|2*4if*#Pw9cp<9Y@va&VW$)bdlE~*#
z)B{?yW!dcXe4Gd*|J%Be&)`NIkpyV7K^R1&fTIjb<MG}cq_$;rz;y_Qay3vsX7UXP
z`ay>tUHqVDA?EhCZr6FA!qLSk^&v-N9jNh-H9aY8z`f!vJ52=XTPoN<wK3qY8qw<6
z?aQFoqm`T_wp0;8FI`x+?>Wrg8T9}fxX)*PbKx<AV>dXosOR;j#SI#U8~Q7-?lv0n
zbkkDP$|mj9UX7?mH;6|TziSO4tK7eXCFOV%2Lsr*Zk9!}t_+ezJVUWn%Rvd+rv&+;
zF7QkCgy+sRIe0`%l;VA;At!WaiP>Y2dDBU*5pmqrdCD;U&}Wr2kEd-eNUFcq;Z-b#
zVD0UOu)Dv{{63LZ&+JB;!uo#?So3Ml@!Q?3&la|Ueo0haQ<18OH5y%t5jQNW;t$S^
z4*h+c2W8JTEz`D@4335-;_6UTf63W-K<i48P-_S3v@ALIUp9@Ufg!)wb6K_1$y(E|
z(=|X=V)rZm$O5mJ_QHzUfM!h}aA_IMhO#f2X=g5W9h{MT>d7_i2l+N-dat6+p)1dQ
zuNwVF1iDA~59NBkh8w=xVYpT(wg6LO<((b+Va3=kfc;{*Y-jpqOj*@4+xI`Xn;&=%
z)Rc;_{+Y>Zt;NhX0SdCiTd&|`aryuPVad=3y1<OpI;Cy>zqr)*^+q~Y1&#O-ud74`
z@b|7W^J~My(&i&mvmP8PUe@sDU&B4FH!)9Ql7-lEHo{k$Azi4tdHkQvs>$CFsXI(>
z=uZk`uJ^*kjh8I%BgBQF1v|XHZxcmBpmwEO`Nl6hS~?wo$7Pc;TO_T3zB%~t&bY{2
z_<XC^08W-x7&qM+#)RexbR(T0R6EEhs+N20cRCL4c~gB6fFP=8#dG}nb)V-q#CO7y
zZE}`$HsF4>m)sdD;mISFZ<n@@c5@-An_hx1M};WjdLK`4x@#T+B05N;+kAjw;-zUy
z29YFVGzt;5e_jIFJ1exH_2tC7fdQ)xCw>G#Y*w7mf06c<Pn4;*u;|Fwl;xS1j~YX+
zY<<h)OmNr?lyQaWrf)|C{ocXGnXGUyl^s9>h2vpo2Zo2eMQ>Ny#XC_!zcQg>kEUKc
zk{)IHhOoRuaS861t?5I@-{YEMAv|9Lo^ow9rHiDL&Ll64@MgsaA7t&n-vToTOPC}t
z45Q{nE>+;t^!lRE6gXLU&R!_sC^?B~Atqdi|9Q(i9Q&Q+M_9@6@L~oPTb}fmK3hvE
zH^a0KuF;mh3Pj>e8#1UEpm=ix<?~b%K6B|pX>XL!VC8jTp>mJ)Z|L^*xx=DOy40xT
zgS&BQ$qTiFD6U)i#z$KrYg(H0@ng=|<@RGwTiXU}@0Q?fgyD}xx}oPY)<ZzOihc$f
zG=h{=#lGhw<-gafnPQdS5V_BK3<Q+$hawEu^iyWCHE0-5oN)~>*BXQIwcanW&c4vy
zPq+_9ZbhV!33B{aURk=pZ-hc-Yl3mIOxrTqPb$TDY^NeZ<A7?Aj`-9glKB?MA}e5d
zJ`5Ss^udcD>$*D3q8)yu0`4ajZe9+kF*R{ovaB-AS@MuDZE#(qwKJYHU;BoLGlG~T
z{EGkN?=b8~Vvf3GJH9hJ$xMy>Ns&p_(9Y5vG9MA@i7b5271+1Gn;v@I5+)J4X%55J
zn^n^cbHR%zqJYlXPxJ_O+3Gqw7+FOcHu$|8{8F_SZg@=<P6AF@Boi>MavpQ>Q3=qP
zdb<WRM~&xkHOBgeWcV5sdm=ZcZyP4mJoRavqXjejN&Fn%v5%fm`v^A_{T7no@kDqc
z^Fq^J25DLF-&ku*xx7<om!kC<!rY$khBy+7^3<a!x4(gTd9Ii(Bem(+xnf?0$EE3v
zDvo1&w*Ei4;n5|wLECr{{EkhR>|DeO&`Z}%AgC!sW0Y)(ZpWfjNTcr$;)Y##dZ*pv
zm6sHxuOS2tFyD}Iu=UpiZNzIQDX*{7iZ^QducbddD(#9pKjk6F;$M4=zw9LWh5(aD
z1A6|R@0X~+0Yo6bqZeAn{_Cm8-UGb0>TR1l==)HLia%_Hc$n8kRcUnP0;*5=c^e-s
z5Y!BILNZfyaO@Sv<IMN)33(pd>m01l@t<Ot3hf!T4>7yiL0DDV6mLt9Vm_P1u01O<
z2j7Ko!J0FxwM6@N*V*(rV7M&w_S7{%l=VRA6roqRtH#X<qZ}|iMJUAhhy486Wt+(_
zz-Y_!Y@G@*`z~gO`BnX7wUZ^yf|r5)SgX+~Vzh7r1@%fd;BSU>AF5AW&%P$giqqH%
z(44Hdy-aZj|K_Vqsvo>z?{(h(P|DzB6o$`5+|yZHPm7KHfvbz!fScaFNdE00NUre!
z)$Sxp8VMW7!K<xV5W9rlvqWTOi-xMs1#rI;4-c8q7Z!qM*!AcTRXH?Y_vnOXW>*S$
z2AJ^7HSKZMqoZ5-eLTncn6S=k4a&0CsS*CXMI=IbU6-I^_hHyzUHGl{6~)b9G@g(T
z0IN=<E<2`z`~Ap&C9dVMx|3n_^x!O0$+HbAgi{*$3%*_x#z^ZZ{``J8e^pUmo2`6u
z9wiBc$QoMy{x(FhG*-Q_mbe(Oa`(Q~L%#1$!1Y6KE=B4!{mkgN{t=<`>vYp{(XIuC
zd=RE>6x87W11X#-X|q+}o_YOx-({nckI=H66Wf=#+r6!3X<@VLF?Rx%-PIc=Oeb-*
zh=m9A@_WkWs)GO2{@|q&NSo&`Gym9bcD8<SkjfZ=E#2Z3;Cg|*7IR<<Xvc`l89ql|
z7ETLl^{>{l1jTc3!$xmTL?NO!tiQ}osHaq1p!8i6gXwnJ^@uN4Vo1g`C@X%-{sX=E
zw#ljkV&>bT273U-%aBXqdQU2JmQK{R81h;Ak3c=d1Q=I-cDg0-0;~6|Y$xW?>Hg7P
zMlbH*_WFa{#WTJ2d-(qF@L$|F6SAmyqz@r9Sck@?KOHKL%QP9Hm=tKumalb4ii3WA
zOj{2r=_Jip)@BRLC;0RcId*Gp>y~HU4fDBKvlfp=8Hs=AN_rni+tIdoTNo37{2rRM
z?h!q~mcfCwSP;1sdVaQ3*&cw`LkdcOXHJ3XO1>>F-!R)rTA%DvSvIe5-|0jIAV0R|
zr^d>~WXgz2e$xL86(@!!EV!6D>bMWzrNRlZIulVqAPo;<18c=C?q(9>|9*}W|Co?~
z^_i7DsJt>9i?(OqgaLqF&#U?8^jKmYvZJRzF>&H`qH$2~WE>J-P$(f&UwWGeSoY<=
zZS=O#KRHb9mRCDMP@H85R%*Cap%(X9&wJ!!GGTN3<uQP_6bAuutU^A-ZTmkrI1iFC
z2f3ycL*5U@SMSp{&;ZR8=SAAz>>%j-(ezmEc-n}U3O+Z=N+Uj}b@YmGie1aC1h`>!
z0d<_bbr#jYW=E;_=)iQsQ8!o8NtrMQI)U_N+88>wuI64Q_t$SOhzzG2&=;nqYD{9H
zj@1VRt?zycje#%*MfQr?Y(2pvHKgv?Oo)Xb<U7otI~I*;HcyBj_2O?$F!Jj_s3PGJ
zg1Kw5b|qqb<xNG!Yce%nyZc)C<&%EDOT|SM`MTS_`3BzqI2{4^$heOCzVq$J9u0V>
zRaOAo_W)2}d~HHSlIy!a)rstfv)UEDs&|xte2(A_iwSMIe}4s`3@P1#U<bnR%$EWu
zer@!}aGmiK6jXN&wL9;n@VIkR+M$bny6RC}nRr3RJFv(5?n*X30TjWB^#cIS>%V_e
ziNZx2i+1gIWmzPWI2Iku6yK_}^OK0?XYqezrP84w<|F#&a2IEZs(w56Gc@rFS3aGu
ztmAY<9c+o1c7jxrsfcp&;72%pvl4{!Ih#9he7z&K$115}7m?&xLfM#5v7pmfa~sgy
z{R4;Z@zl`ODsWJ4_cPl)BFVI%y$2qmC~&IJ(0olCBTEs0oKqL4`e7(e#FM53cT8rg
zKMqew{fQ<}<zNEen4tH`GTept*Mw*Iu#HgI+g#YX0J2~Ut0`H0`~o5Q&2o)JQS~u<
zN6|uHm`a7XAWy*<99)5@9QCZr=sCE738?G$@)qX%2jscasTO4VTV?@v{k-%Ql@2Zm
z_FgJ+Xu&Cx4;Z#}8x6$OA6~eLBw>Z?Hf05dOI7umt=aN%lSx+UU8OvWv0@ZD6lM+c
zhE^n}N7U(dQCWM;i!Y<tN~f8XUb?-&VLDz04<NIFkgP-5i742m!^-@hP@aQJgz8^l
zmQ}++`e3O3>ng_J0a*4>{HCHiS)3-A3%Q1|cty2R86?i0-g};V+Bf0LyLz2OPf8Ox
zSNU?H3wV%*^!4Hi-Fn2}^y++z%tqKJEsA`yR**jMc1r>rgK>80KfJlL-Rub0*M<^^
z=u2(^`c@(o=Z<ay!{o#GPuTuRhzDw7`E5caMmX<;Ay)9t!t&Is)HNsMW>COlLOI*G
zAhTxv&(TOs)%KtW;if)8xT4eRFBSNe<m*ReeLIU}IcC=J562G&`(aI(rRKqhgCSTr
zU$T_x&L}6qRHl?H<5m9fnzqZ#!%%*^%1(Oe<@dN*3&K<!N(hyOK1WwIAe^|E%^dYz
zxmc({E%GbS(;PR8wDdZG5IL}!dfy^|lQmdR11r)3;vz&zAMmC>k#MT~$F2DF*Ms6I
zIpJ=PZJ|!@g7O75#i7b(72(}v?+0<g;xunhNpEnCyKlsS1;W#W!`J#Rz9%pDA8`bs
z5sxo})8D?$KCW=VH%BoB^_Rjd3M$TsLL*wy^-16(js&%a1dx2@i~KDa%sYnC*%n)|
z-u&{{V~;lbkzF226Y@{wD+K%_ZT1v?PsIGZmx@m3m|l4X7v)C?`xpU4CP#&1l^F5A
z8yyp&vH#n>w|h;EF1og>*S+tTlewyg;A7~^Mf9CErdjJke`t6O-9&!2?BsW<zxwT4
zT3>xbNhfRJcz&B7;Zz6O^?4h;fp%zF^<d)k%3iaUKk}nL({7aWq&7L3Sggizcw>u0
zj!e$XWk$!wu`NsbUTP|dh$Kb!)&A{Y6WotDrd{pSmN3!Zv^Zn|QHG!@uT)FeH$jSb
zI{uYt)y-#Xn;_gTc#xi^xUmQCtbjNPW%LF_B9d}?PsGCyptsT=bSPrp#JcZHPU1zK
z@hjGUM;}uj<37>nAhY33^3JKrwF`w4HN!@e9;_n>xx;L(!i1|H?=1G^H;@{*TQXtx
z^H$?5Va5-C1n3ApnYZN^)^#9Sz#eM%`rX)Cz4-=;46x52N?g@nXM_z|eh`h_KZ22@
zIyd(pgg(8gPa-@ZBJL~t!bugoH%jt|4!-f7MdUjTTA!^#Y9y%>va|7T(M1EzvA~yo
zKA|`5_3L^t=jV75t9XYut9U)P?|i#Lyfl+p?56aoo`8dR7^#TVlM{`<qmvts`UN|x
zPPmM|zwmDA=J|}LID8enqs$KD*oYd?De<iGj|mBv+DAW17+b+G`@~BoYD}iQs_U7s
ze_9-FqINVR4_|So3?*0%1@DU97k(+o${Z(k)~Mp;PI<%ngVsw~K=czHnax?Zy1*Rg
zOOh3jASAA78KqP({p1mWn2Nd(-KRpo2X=$xe`9bL%q-j`>&(Ju`jhN}koV2v75dH8
zlo)5Gso-C<mBr<b&%h@SCJXmWVP9I80!8`aSYzlv=5X>WD53S494Pw7&&o=jYHzm>
zOshHZu~BDleU!1>1ttS<3&7yYF;abhSO{!qW&KkNJbZ?Wg~y*GTtC$9r6M!()VOZp
zNQW5<fi7)HVJLZoDyE&MpQ&PRS<!-ZmVGNB4!gbP5od=!Cv#No3pUsNKH7p-F()D4
z%1O9<m0eRDz{c~!*_8Z1v)k56obzBijp%t6>74~Z_aOd$epe#?mOe?qW5YVrmoHSE
z<c-;_?->CJ=UQ_O?<~)5!0A?xrL(fn_=l}uzw@~9Iv<KS+<x%nARq7-rOlPK_e)??
zzeO2eCTro8MM@MqnKuMV9$s~0CAMU(^dFt@h-NAjJ^N5s7(BxScx~o<jF0{t7r+-(
zY3u_y9ph|47ZG8kMI@?ci75M{tq*I&g)_*2j7B4LpMfFzl-s$B$Z5j!h|<-c-(Fz7
zwf|)_ObAQ|8l7V8J~^>+Igcwo;zgwRJapiG%m|OFgX`P|4Zz+(uG+#axMPk{d;MrH
zCMb{Ro^@OI`87a*`%6c=UAy6-7Nl{OEfg})nPb3Dl%_jp(<b2c>0n92KikyFsUE^R
z17}ZRcx42n8a=&~T==}G#Lmj(bUT1`&PLik5>AWzy3a*qbJOj=EplrDYZME2Mjqq6
z&U;T(ePd;_!@wh}%x9>8st-N~S0XxJaBmjB5u<bV<Eck8!RfcW*rch#D=Zs1rua=Y
z*6>*)Fv1Y1-+XnPaG1~SzKfD}Bp@x^pajV(nh`v_Mqd@@iu{{M9}jrqQ)Uk~*Jcx&
zbMYF@-w-plyy{2iJI9`&umUXY3FH)nLfTlt&%u4kc&s$@;oN-Fl;n5)fT)Z*3y7<l
zm;p@{u5m-2#9YnwuLD3DFv=P`C__`u?-&AZCoU?wAq!*&R05gg$~IY93vM`|pps0q
z579Q_&OPZ#l`?4ST&`SN*O9omlV2o*h=i;XVbILTq~wR>W?E66=X53ODjV;1W$COa
z;D7m8ez?1yz;^qVc*SBwRY)#u!2adg%RRFCJsycA`(~W$i1yr3Ut|>6fmNnP$Jf-V
zyL3srA@%zAfzx`f5vQSvR+QG8PRs2g`d9nn%W+v+Wx@}3tiN)?Zx4+7v?Vi$r79-<
z0yqt4RQ&Ymp+}zhaf__cz3@B2Z5naSpY6;_bC$;ufc9AimyEXoYKnJ3PMfV-5rBYf
zMR4@6Q#w~^#j38R+p~63r2_jmemp(dg*OUX4XH0`g0eg=6b?jwaay97WJUI>zPzxS
zY?Wyp)P~OaL<OP;3~!~e4`5;?Dqr3qHuQf2Gj|HL&g9$u_-8*Dw-^}>`a11Tdw5_d
zy-bVMLN4+8SR_Wo60CjuL?-%4Qe(7p_Tf)OA-aPU+=6g7$_8pB7&6%&oIw~TqS=Xb
z)6H>{@y%!==AXfQ@k|$X2}3N9^2>o860MUyPJYHqSffJmOKX?L<n6wYOPk*>3l9$J
zyVqZw3#TjMvKjbJqTzr;H?LryloYuty|6fb|6DsNbAchC@c@GJkE}*nh_0O(=Uh|C
z;~}I?&ByGVSt-LE|Ar<WGi<w<C;k}J_(32Hlj`*`hvCPA_G1*GFLoE%_yqX1DfqlJ
zL#M`-P7*4_^tCke$Dw^dxQCNo)yWNQEYE(v{!`7U0z_`;YV!$v!;BZN0kZ2=PrCnw
zhNx>F3DV9{72R9=d49Zo07w?VZfE|8Ibt5{b{107v)FjYyg|Uo<EqGz`PW<a!H!6M
z7Uy2I_NkjjiSnpBXrgE>;}2Y){}%8yII2^R#uNG2G!qe;XiT^Dj7@lYtzD4zT&Qa2
zGtogv2Y)CR<R_yIr6ub*rGGbM1+&tN_*(9&Jre4LO;{rh7!-)K`008(_2jzZNn}t^
z*nzfWRC?@mC6a6*vMdX{Dn_u7VkR~fL?`=Iu`PwD?S+KoO2n;Axv+B+iQS|Ot`&hO
zPnN$a>|d_BfRX5nxtR_aMV1y0(~s9lnYPZn^*spxM&jI=kH#+|&d;X#gwLXlypB-%
zGZbH|z3<od@tKTjT4>JEq^{k3iW~e2m+o_94w(E@r8NP)xJQ;>!p0FFn*9_%@%u>%
zH@|Tm^OO{Gct&Y_q-73sWc>`opM2ErbDuG`dB1g*!SdpzY#mRu5@U=d$@fRtXpkt{
z8H0@k?v~?U9PeH#yTP12$3<%NW-u9vB)_i3U)u~38#~Nfek2kw1Zy5q;`%g0m~<>z
z<ww3S<b?Vq2OurZnD!Jj8+sJ}7*98BKHW1S0Ji;OuNgEHUkD2Wy$8T)LQ`;reee!w
zF-~Q+LZx;Av)(^ak!M_{lG!g#W8Wa<U7@;hS{X^bNeWk}lGFowDc1>@jnnb5$pf%(
z!{OG_b>dI5l#VTl_Cj-%5?iIhgJmH`Pf%TlYdOU@QDsy`t=ZhRDT$4eBnK+5$5KFK
z<uQvIH|R~2I1%NzCs`6D5esC~(0I|0t{P@(<|A?7iM+30(-x1&XIvckCuZo0Z2xD;
z@+{u3AV4XW5?X2JQ%A|1bv>UmJKLUObY<4aJyVnaPa&rNuMtVgM<|4|fwiL(o8h-+
za4`~D>o(i!{A}flmuZFV-{wI=Dpu;q>CfxLn~24yKhIA_(=CS%=WP>Z^m<S`bA9-F
z?p1MJCc%E1b8p|siq$R^5-m?AJ9Ox}VX;RUwWljFMBF0Tc~z`JP^a@vDyHB&breZ`
z5h9MhIWAM9cU0&F>N!@2Rye`rr~8IV2&$R5f$Qp(xNxJegih}#vE&-meX7l_dx=Ca
z%ji9$V+F|kZ9!tDN;h(waj~i}wZzy*A#_8z1K~-T{*rxHsP*gP;<O?Je{a^DevcJY
zy{|=HTurx$#4x6=l0!pMQYnCQbbquPw{l#cBlDK((NGaC=3jLIRs8QVL$3b}lq^{t
zF9?XdV+s**;@)3|d2%N7-}%=}a`%<S?iZ;4sdBr@lO7-{RYrerO3SzVOl%J2ggvY0
zc>77Ctzt9DTS>N~$n`5OX0drw#~<uU$r>26T_qER)r>N56JxK@#x0zyxe&VxuqA7I
ziZdQljCKr9+jA9k?x$KykhJ-!`)S5dyU~bg?|EF+f`oYm1J;QBYgiIT#K)E7`V)VO
zgy6GI&IX8D=bB4$Xcp>Lcjqsm!Pgi}V(K_o*9KP~HH%wORqp3UuNfHgl_~Atn(!P8
z_#zW3fiWZW_7)aTaR~49@c==>-<F}F=OAUzN;Kn%m`I+9^FMK87#NXL`~4*QwWu%B
zEjiRdxTEx!3<IcP4M9q^4RvqO8#Sd4q3PCke`^8>*14|cd8b`YT0f;;*pDgS0>t_f
zi1>tmBO`XRc7FCPpRYdNr?#gXWA#s0_xJ93kkBI2schM!G_einY=uw^<F7!UNO*cQ
z_Kc!@p7J_+d0NwtLAe2mR@rhd2$NS6vI<*LOVos>eKnDow_mb)3D*&}uxB7+D=Dlj
zDTw$#0*WB^f04pj;oojW&K=|E)3gq7WdrF|NyN!=9P^CC4>AD!TPJ=43a)arUw*+4
zE-@nQnm<+=hBYJqP-hvL@%~uzkxgXh*;$PXqaLEnRGgqq@Bem1%)715e@iR9(FC!d
z(8_b$?m#CQy;X_Ahp=%-$Xk69nF3kM5~?I8w_N7c?Xc1Go5Okz+o~pQ&xb`trbV+B
zMx(8=2D3Rer1@xjKkM{meirr&l#(mpoU4?6EXw#DQ4TB>aU5WV72v0DuxOqyjVg8b
zs=KO-(CL4gmilIdm!s@nG@ppO?>O70ML6r(?}HraF~M8paLY)J!)3bu<|4rE778$a
z;<rBC4%Dx*U(f`5_fcd3Iic#v1Y9B}X9BG}x~1F9DC%JZd;s4q^6WDk(;YTp?jaUs
zaD6#IG>*Lhy_`16{l7~k+lW;YtKTbblcx(AKF8Id5nwv4^3~AlHHy2?C!kJv$ufH3
z^#_st)!(wabg>)$#c8)ak%w@4On@<x`VwYO`19W;r$me$f!7<(`6*1-#PG8(XA}<A
zq@QrYie7U5t|qNRvoReCzn3Cf^tQa020=*Zpcj^Twwa`5+0~FuZ=(zHsw5LwPP+dV
zT`TP8!*IJy)5&CO+AmTE?H&ke-$>bDr?R)P-8@N@2d}KA4Ob(*GbPZyaEA0s+MHCK
zq{BG3CUUh22A}GjI*3ZD*r{5gN&Rxc@mG4a5o`Hx@KOB=_a%>qWrNQ>3qd|30KY^f
z2FRj4VF2Ce7liWovY)T?d8oDQxwJR|#k0p*bpJqbLaG0%+{~ZoA1Iz%m814nrk)B_
ze<QQ|*X@V*3fL7}=0^h{C`<pzYUE*M1CCs1qK?nZ#~LgdNIiaiXJI$pH!@Zj8=BBh
zBt#vo>GxU=C!f%n!iWju>I9pY-;|QjqBY2th@r-7M|`TU&KQIOAH%(Ff=BFi((W4n
z*>1Gm>%|$Cca#rOQkcRHq0-?RcA?J5uNOvt7Y;u(51t6@=@(TIl6@h!B6ko!*(-Y}
z!v)Fj#aIoGFDXqUWJDx%L9K|L0VW~Iz{fm83-h7+k0p#bm;MM@9q|vRIIxwWkAWQM
z4QJ$q*L3Y(yK)8j?%%ccpNnTQtwd_|61lI%ttVJLMC^Y!Bc(X)Nn0^gT)(>WTOpG9
z`9){_-)bwWu>*e8gE;lB0|Aj_=aRJ_?CCi;|FM{ARrZEq7hQ8wQ-5v@8?mzt<e%u>
z2U?ukL;f|o2|bP=ZjVok@U{|2S&}N~`us?fHd@>LJdWV8SbGY=ao+GN{*WWmex77~
z?L9Q0%hpWDE)*<Fk+o0^AtZ0=raI)mCyCmU!V&jGRv4{_Nh)*~YN?MCHENr&9KrrB
zDRG65edPa3Hk{}wR*T7LwV3tGi#>nj#y3%vCN}aprWe}rS%$t&zER#bt`ltldLv9#
zRji5JtewdW5Vfaid+HMwh5do}p7{N?OZ!H$aLry=XDPpT{@14^EP-Ifeodb|X+_6E
zSvl$(2{oo&G5f~`>6Q2n5q9?KosgjBg+5)}bOBLh!9a5rM%DrOj_<WGJXHze682g_
zNZD6537%RR3RTRa4RWtQ%A5=Pj~4$_YqKP}?ZH%u>)D&n*Rc=V|Ey)ch_`|SSh3XI
zZl|6t{}HaNre!iXf)}M5*tethWEOlGR-n^=XAF%6i2byGEB(Gwt8}bGHP3W=mcwZl
z^-)l?DfmnBLTsU<8QHLjTT?6}X{q)~rSG%@SpDIm!PxL~*72=!Qq-+l10N8r@O2hb
zbdcab<$_Wf0-{H|t3GIV1h>qz25F-~0STQAUI{6{b)H4=oY$$aq#x3$-NH6d=O=$_
zuA|P9aIEmNYq?TZ>qnpWAO9KPH!A|k>RJaT*bx^UjC8zz^qP|N^3zC4>yGh<Hm$SE
z9AQvtqj~|{RNgn0)<r?D4>M?gsy}w#nQz;c1AbL;oLZ$-Dt&`mY_gdK1u#y_%4p)8
zwTif4A$c`zK$z%3)`RHA`+K{S$1lH(y0&y&r3*-cczLPfOi^?@T7+lEmx-^hPf#MC
zjzu7C$}SrTOx1vKDp-rs^Lq3{E9SjE^H4xkUbDwug-?9JH@JqzAU52*A%u?}O9By^
z%xD#KJa2l}==-W4iMV?lKC(qh!6Gmi@kUY`+;y}k`cJl#DU$@dzWB(vRa1Cm$g4@-
zk-u|6LVc<yTOyfnv)|(`CbphT;EpRqmoh;E^Rf)EXyOCBeDVj1eJ)v<q<ExC^Qf<<
zzD6V1&rd>$p_(@|wGl}@=02ap7b-#jJCN7cVGJD9(XEP28cnfD68tdJZW6t3&R?j%
za8V-jFryw#Lo58}AhP0^_aU@R?+XLvlMe-7iGb1M^&zsTx|)lgMq>r<9PJKDko^zx
z>K7-d#aN@Gh0dk9y8`aQ?7@t=&R_rKt#JO=0D7v$tEazx$FMlsFL#!P^r8f*TQf~r
zZzaJ9rU_AASL-ck^X{Z=R_WR|+M!0(%cPDB1okXeE(&s4*%apj+GLf6Y{gmp>Cp}1
zAGo*3`d6<h{E-{373I0K2}*R-;vHx{$Wz*SnV$*sqvm@A{706s5v4b>V`8PBFgF0y
zm!0HidX5v(p@N*;q@}eUMlcq5(ciEAEYX(yHU3J7Pjqsk4G+sUy$Q%D3XcSmNFx2z
zQe%(SGddsxD2?5x4eM*ZvPDM$p)i_3UtS1i8NKN=^qS)Px%|D~?@`igde?%zAxqc*
zwY7;%X2P_z6_#OG_N;&(CLwW|{^_b)^;jBr|8>io4|o0-_bh(w#`WG!<LuP1v}zZj
z@Cin{*z~FT?<gjMjl|p+s?uN{As<}0`)4WXTyL&hYBS$EAdsCV2(b5|PD18C-rQN+
zY52+c>Rb?y-w@+#RTgVSLx>?KFm8^5#_7}+y8tOdu0-}I!ocR;2!C(@m{$0#aIWgk
zXsPOBSjwcFc&YGNF$!D-Q7<g^`~9|T?|FVF2gJKn!g5U$YO&X|>Bdsp3c+-zo&)eP
zTlRs9nV~opqn2f6S!MYF1za}XKFBJEs>Hvm1r8#3<|F_=hl;&#;a8aM7$D1+@Ud5X
zWs|U6r}x@yzT=GQOfvd?2xhAm&Y46n!1LrMVcKeCRU{Zd5g_4*8yb<Fs^@v?N+r2%
z&&)Sk^1;Y4rQuPd!RfC|`OtHEQP2hao1z`f(8B1+97WcintX5T1XO_sMd6v@PuZ_J
zf0I}z5Em$G7fT(Em`q{tB*@xpkZI&xc$@a5gJ`**iTQF9yZmDBbexyG=>AY_4tkC{
zgPnxhNhk{sk<u&ssACIQu7t|wt$4bTxYS>wcLg4Bq)MljEU4O|z`5&_AJ98XKgpG_
z9-<aI73`h=@~0D^-vr$NaR}7{n6A{2Hcqi5L1hvw6Z>rIJ}-GRFE3%ho&3sH{Dy2Q
zH6w57Nb<fu!E&1nW3PiBqz}l%bRXh|Jp3tv?&B{h?FTtnTH|#ny2wp75u5HQ5}pi$
zvbwAv)<Y0v0X%pEvW;s3RrZ?V8M>?;>rcLffg?I06_$#}pGzBiurIuY--!M5GAzID
zftT!3L$EpFx@F_~1D?Uo&`uL;e_HI5({x^THkvGO`A{q5XEiQ1D10qmaKX6-Fg@>a
z3lzNBjf>dfU02e=e&aqj;evZuRh2n4zn5da$XPq+O%2Lr+ew;33}Sclxz4)=n^+yX
zs};yncW;|WeXR4~XEK4_x!0U<mhxcaCY#TO?+&-LtkRi2n^mzi7k^g@r{!J*+{@Bz
zZ!Ag~^C$=+`CFF%v%r~tOQ=<ZKO$|I6tYKC4)dSrEEZ@-N1dw|21l30F64!;&XO)<
zaP9JVpPoz$W5mlj7q9R&WwE*2{|4;!+LnnnL5ty?BkN}ncLFU}S;VW5!+y5PLw&O7
zPl)+ZnP5T1K1+blvVy8)sl2wz%_wQV+~l9mSR9cCYY1KLk95Mp6=`220UyOenNjdx
zrGWRn+U|y;Ahpj@UUQ(OBNk_xFHKD#c$hDe#)4$5A&+FC$aHcc_gcZXU%BWN{9V6x
zPCXjcun*U2dJwt5&7mvrctmi>xPK1s*N!YpAJQ>uWYo{~?9<5ILsWVq8g6I3eflr3
zxL-0BdItLQ3aMhfEpR84hO4_X!{tc<hiFjR6JVY_Y*pVW&$<o%Wt%sB7LI6atE_hL
zE<aE8Fg6*30S2cne`LfL=;0e@YFOwh6~L7M%I`Pq+|BI|^%J!d5;tEaYR}g78gSer
zm>H<Q!;a1dvNzsQiJY-=W+<5(9r1)`!ORI>o3{o>F%wtcz6#KmZqMG>fwnhR1)W^K
zDfpoYh|FqraJHMa-iAIkl(po?`9nQtTtU<NU0c3nnKzs74T7OTTdXa`S<bC&srdG?
zY~mlyzUBg0_MGXJ=dWjg?X-mR#9%|f*~0ENFS>^8v-ghxm*0I<7fKB*h80ed_|Tx#
z0)#MH;9NKn-}of0awi`ooA+HuUNLWR^NLht+W67y!4?Jj%<WYIMUK%?0wb*Auh2|i
z3w+*H^U|?jW%4-pt&}I8Z}<<5H^8~zH<XorUtD^Pijt*@GxyvIkIr!Vnr;t-rdzt&
zOA*2Lzm0XPO-;Iwn&zF%x;k`S3F^kM9VjL@a~U6%NJ;xWlDx9Cnu*As+uvRKaF6A0
zR$3FF_#7$Y7Vyk;U%K%=D<xet5`tDt$gy@bF!ybQg_-bhgPsNkD50#|?zo|m7_>f(
zrF`VzoQF}|On$0nfB!2tC*iYAN*Tj|%KWC@pS!pC0-*K9v9h$QTn8pC{@en>j9$!(
zT<k{el(dq=5OgYmZ3)|RBU0EMHqX&hVJv)J&PnH1a?xWbZjg9kO+wl@;IBZaB6odl
ze~+J^xd(VFJLJ8|7x6fNuMUP}CL8)%>ytf-v&gqA<BgOEbEkiBwo963M>%cv#R4a_
zmy`G=)g)p8TWRX_`e}>zK<EmQxaLElhi@9SKy*#v=BQrpaBof`f}!L=3npf7Sx-yr
z5mcvD+`pMk8za$E*1@rhvX(ygu&<!N)jxt7+I4e&6#iU{hV|jk8muEM1<#<#j@2Lf
zga5pTaL9@T5dgoQPdl&^MnXfZ>5vd*KeIZS$IeVJ1Y9qFbIyi@zUj+8Q7pvy{wUdr
z<&pjfFP<OzrqFON-i@T~1vuvI$c4KAhWz%Kfd_@9abA@N|KPJwq0j1{avTZDZ2zX`
z*dg!XgO84Nx!E&<)>YJKJ06X>sK;n@%tbZdeda42L152QvKm%c#Kf`Da_ryvt*>a0
zjGr;EnR+-!#ij{`ZNaL90j@BN8(=jeFefhSbHlJ&w!PJfyFI7U609?2F@!*cgunBt
zuWZ2MVre$N7TgVR7sI995S~>c8_a)qv+NmG7><n?{oV=bEySi2Rt9J&mvmTozDRx;
z2PB+)Ih{Gl5U3h}-(ze3`#hM^GHp0FZ+H#NZFQS<t#!rki?-n?COdZV$yfsu-Ip+M
z?~tY4@?Vd$j0+78{=h^ElCt~oJ(FghE|=8u6lz{BvH;}BDla=@cr1BBUeL4s{Sa$a
zC)#BeBk%!U;8+2wn-Ny6p##WSuN}SLOM8)lQVi7~2VRU18O>zoZ+Yb7m9r4DLxF?)
zjzKtxcX(|zf9;OpOWuTv-->eQv6teK-6lSS9kT`=qxBj$Vj;H&+g`Ebe_$??F<_J_
zstTxnAX$y-FJt~=R92>3-;``>GxWJec_i8c`mM;4T-DLD3Ti~aJ}uAl)Mwdf4SY+!
z<-j>jpBPTT2l3$aLz5KHonq$b<@GW-PVB*6;s*6KuUrHao9mvn%fUy<O^M~>x0&Al
z5+d|T4JdzjN4eK{AFPQjkieG6Hl`j$cih`{Xmd}<yu|yBE3>YT+aDuQss~K_>oS&P
zPFXIV8QAnh@;j*of+WcO=2q(c1A&!3d&^;)(?`zMugU^~Yiv97FObnAMbw(PI1c_$
z(+>XK{N4ON>bHGyXHVD(4f!45iyC`j-|v`mhz!A{!DmKE*(F`Wb%z_F%(Dt~k=X)e
zw}DbXffcM}FokqGH)>fz-sJ0==J>e0WPSlF?~dRrmkTbOktuG(BdMmH0{kn+?vru(
zUn^mJykPS$jFU%yN<{sT;XRJRz=*d<w8i&j2Nx;Y;)@1i(-MxpV$n75lZD9Q+2TS_
zc!>fDZ@q|G{thhfP(tD@e)71q{BxwZo#yv6aiAp_)LOapY{Egbu<mXM_(AJggSe04
z#Pn)W*MBVfOIs=|iynu2hmBa-fBaUWVJ3a}z$~{@U**vxZiK?$s^GB63!q=hpg1tw
zzwTa-Dp-b0@>=R#uq`-jk0p)<eQgUMp|us2axMs`m)WR$9?*-{jh%daOc&RRY;cFz
zt{*#r98^pY|7cpmm}tv8dTa4`6W=9CXi>kN3X_=&`<8Xuj0)-0w<wh0Kau(h?hL<p
zF1|5VTydf*k>E6`sqx3Dgad`tlPb<3786=+tSPawo%r3QnD}n@_Rchczs7J=esCa5
zz1zU4W)a@!QS|nD%+@Cowm|mwuh)9#UJR$rqhT|V+?Q8Pwgzki@tYrjbFD64U~Vc1
zbzXBgt+>-y>oPF;w(%p6f>V(}oN1g~Rw<gIFc@rZ3rZCKPp$u7%~9CBe+VVF!%6wU
zgc3HDQfIg-T(!wK`Bi6bvp1UnLYOuQL11=rQQD%R3(|ahdvUqU%3`b)2^&PfxVj3(
z-*w%v{KNJWJ^v4@>Clh4$C4;Q)59Q*hs|x3>JhEd1UHF%JpAbwUoJ>rg)Q7hayGl_
zQVpU=-WxK^s(9@cUoad@B_HP=X6(EkNlS}hI9-2Gu_L)W>OkfDjT!rtEM8!TG8L=m
zsu3iJ{Ar?`v-sST_3(+%UZHLzpm&-&QOm|YyG>Dxh<j5em0FH-Dyfuo>JNht+o!L^
zL~nQaFp-p&bDjlp2K@4c-(4<kg}GD<2S1b^e<PIk-I=z+$cWSVv)DhaCZBr>LcgZP
zzR&O@BQ)DCvY7VlBaX_wnO2$qR7lH+=k$o>Ue~+bAL%Wr!8PK$w$7pM@tLK&Vi~Ug
zl<+N87deoh34N5OBtwq9r>HaL9w(xnZMv^9*qatkB7U~N6Xn1E<tEzcU)sd{$LaY`
zsNV~niHJqjEtYaw_!q$S<DiHUmak|$(~)`+DbEOle+37CRII253;FXFzPXQ2JmZto
zKNG;K8$xMQ7Xg<?h+rW^K#;NuTSeq-QpNi+!BHCXaA~k<E=A%wg=7dpghQzw=G#dD
zy?E-6a(+<AM?;a?@efyCq&`7PzaxrP{paPc6qoCQ054L$@GXexWhw|L{+30%-G^tl
z!#(nBgqqf>A^G&f*+Z{h(|q!vRMW!YCw-aA;=R3okrnXE->SPeODwUP#Ep9eLJ@gL
zTgsy7@qh!$&i>t?uUvV#+?I*RZ^*T3gJ4Qbu+-|G)KkN~$mzJ$-vAn`R|=UUo}^<J
zjw0D8AAX1U7vr)ukV;$CPy6bBMV#NzXU1hbC<wli3Q<7G;>cA_mQ&@A`KWb%a4MFQ
z;}!sY2K%vxqh1SKw`80&;IBUcy(?8Noh8px;*x_pztM_@EokK(Z5yEDzuHy%B&vtH
z_ED$t!3<Uk-bU_p;`%7n7ApR34ZUi{DO2=g=XSH0h?c57&ony3Uq_A?m|kO3-0QJ<
zyWbUD;=)d`6GGFnraz{^_M)+bwL+jUnMVr3i1F8@g-u9xtdXPTVpR*h77`654&Y%|
zT(L6!|8$h{uO&Um3_y!1gsO2RbO{EUpF*T%H;~Ielr=Y&)HZ%I4Uz(Lp8%i3o`bgg
zw5-NMsHtC#fn-C=Xd!4Z@+MXCqO(S`?yF3hQ_~3(i{`Ks9-8GTEBv#Yp>FRux&!&6
z_nU@J{${a*AI@rIWQAQRV^BeBf?~Ufo>_%eqM{HOuc@$MIvn4DfK>UzVY;`LGrAF%
zKsGEcg;bBYN{#NBIE>1l_4vR-%|k>iXU;5ew8te+{B=5UOi4s-bxghPM|)}z;fXQN
zC%q6m0<>Jy6czM7>e#Hb6E`wMR<m^h1BN_Rbx$BQp(U68<XsdQRq6ypgnE;bI-$uy
z<PvEg<?i2-SiYVd<^5^Hh+k;*J&*?rZ)nr6uOI8s)z+P$$bMeq=uRnZ!;G5WXJ@B?
z-*_y{rnr6u710u{@9RX)6gT2TD&DLirJNH97(fBM+K9tbj?%Obtpt))xhJz{!Pd}9
z_{%>rpJ}Xf2&Px1V=lGerG^Eeb)fhr90%ImN8<{~Hl0ox6I4*3bEXsCQ|3ag^JkSU
zZ@Bg92^@?w800%ofI^egMj^&uLGsec@swgkQb`w}ZnY1%K{Lg@fDXLAd5ZNHKYW+#
z<1ULvtSYpqWpg5yYd;K_hkmG&%C`*3SNHf;qZd#eL~F7GB7<@I$~Cldxf}Z=o4ql;
z5>wRl*1nENPEkKASH26}uKzF<+U^hJzV4=`lg<$pJDaPHn-+#gUbnAoQ9#V`p8Tnk
z!z!velY7O}_A;LjwV?LJ7lOHy*iobB;VuJWe!p{E#@@-gp#F9R9umd=Y?iD44?WuE
zqzzYmt4)91db9fR*}`)knDTz!3%yd82#R4&piZEG_!zV7E8maiEj7^^d<{qD+5B;~
zQIl`77@pmPeLp*))%v27R}R;hcaq+4BVIMnLCc~>aRk5?eBg#Lgs_xZvy}u-b{(uz
z59Z3x$pT#!Wz;+&2Qq2~Qhn|%iLdcf+NNjrSb`@SuI52z;5&qZP2-;Qg?CZRM4-K5
z;m7-uwm`>4qPuNbBEXT0Q=Exf%2YaAW}BCE4mygpJKamK=uJMvirn>HjR5awf?9@`
z^1fu@paFjlngetzHb4T2t{@<NDX1MAZIbJSeu?>zoVJ@dwOU!c2wH+~cgxb()^RBP
zoH@O1P!9YBw%HiUho31Get2qg^+IL4(P}u*%1g~p_LnfTB@@i(#9{h4MA2oq>BmG1
z?Mqv25^--LRItiVK)G)<OcvxRo|e}!u=ojYr}nKzATzin)yS(Zt#roSN>BgQVC4g>
zxdrR8D#*v$9v5Y3;1&V9c$o&HP#w-MU?X*T<&0GeD*c!0Q|vy<!gz@SKdpI^FFxWR
zlKpACMK<SRo=2j?OcPraxV&rH`TbVbgwY&an+}JeG*2f;X{Q*|4_I;v<l9XYpwFMs
z=9XsI8S}fv9K<95IXLsF^nZ<wF4R)snr!ss#)p$~O%qZRRvp}VILelNr}3#ijbj^e
zWY>5)#$I%TUeui%P@l_*0Qd$J3Aodkp1J;kms9EgmD<f1krQBvNH%q`^8?ZllIcHf
z+A|_XHVmM&%K4L=gGrP%JHq|>2F*ayn6Q>2iC^?POJ$#=A|cApHG~6JwXpmJN>nK@
z#CSpg98&rDUy?NuDk{;zwOqyl$Is+Fvk{P2wuyv*%g2(DFTF-2W-DVG&?4pUTpg|T
zr3RG%^*~nY<`xVaOI71XPM-g@+FjzrNb>+2mb}clid(HOEe)P>oKx-I`li4=UIM~7
zX_xiYHtg<M_BFOdr?BO!<X@DC&eRVdiyA$>A;l|xTvo}B_gRN;@yTBW^|PT;Ekd=%
zsUs<}HsD?jp$8aP-1;)~5HFM!)~=9N5c}D+)>9eSmi#cY&U(74r{p&Hb(1p8B^UDw
zd`1lw2RgjR)yh*lL)ZtqM!o-+pG*pK$!<?w=Y>gt>+{3pNQ?T}GuYOaC`Fkv==3u*
zAcCLqhGrC-bQ{F?WQ6q$9uTPM-rn5?<&?r(-93S_^;bFspq--b3$snU1|QvmA3k@I
zRdelSs|y++BK^;X#;#9?)zwrOrE=nQo%m)YJ%?Yh|N105g!_eM^+&$oEG6$OUvxy1
z<+5ymk!4|~$(;%^1N;m;4T$T9m%so0*X{WGk2h6UE5$iDNxhr^yw!B;%=3E=+25_X
z5HpNY07o^hT1sq<8R%oC;8+(!&}E*q(MgQUx~foV5y^}9)Py4M&X>X8I#}JbL3(8?
z)h`mgo}flPHHsE`+<N=TYr31Fe%9)XR!Y}W1%FW1wc8=h5G>^XH#_%i7q9eo40TMH
zt_JZlop>5^R#_tDEzmU%diLYR*W=Hcen_NS<6LiMa^N_V@(Zh6g-kw2-Cld4_2!b#
z@8d$+J8>B{sZ;H~K^9nq<oA&q|8hFYb35B~9%R24R{2yez`4J)bo^FIGJ2s)<*dU|
zh743%vYW0elIp%sav+B=RlUGPSaP-S;#MebH}D?|$aXc2K4+kw=x_q^@jU6zK{@|E
z`r8p!{w$>1nrdo~RP5D8=Jb^FW6`mK{)-M~6F`8&qRZaWo1WfgqgKVya8x8^!<n4Y
zttTA*-vA51?gsCRvCJ92d!SpI>0~G7=kawKRroR=D5xz0_AZ|ouc&{=?$0|DlB<kr
zW%$7pr&%!bg2}9GgYwo%+ZMNJw214hw_)z;w5hE_b@qLEk`+7}T8SYJv^S=PbPz^{
z;92;5xNE{(5(HG7^Dj>c(c)|}?y?IZTCCwlfu-E$yfd3r>z{Oa8;)K|v}UafNnLHG
ztJ**ppGvltSe5T|zOaj=qM`V*!xe?9)*W8hFJxLCO5$b%Za5=y{UNO-(!2^rx@%2=
z6$h+?L}%BN9K{IQ+rN3T&c=uPYEiqE8N*karS0K9Bj5Ny8h|7nI~n(cw}mr{_!Av0
zJxBH|^8xwyBdB1n!cY{8>AGDh{O8~wMUrx6&~*ZII23%wq&7jt_n>1`YVvI%1tf=2
z^Ub|2bQYi<40w3XKEQI3BBFOI`q4_c!3t{|a!SYiCyf+R<6^$(s+pa#7Y?qc#Ndh(
z#m0$?-ck0sH90jhloXd6e024zYl~NuyzEOGzI+~y4kV9Lyv3cC%I5@?;RXpn>R(0l
zl0v%q9S8^;HXYvF;HEnU7=;{|Krs_xx)+i0vBYR5QprG#FGX8)M#8vf%7QK+6R=F#
z^Vh0AM<o^29$$NX7nxTj=G*Kb#nI076)lA2@d~%^(aI98B(ZjY5tgT)bLg9v%~jBS
zxe9q5AH>>w4W6?H2#c-Rz6$uK03QdjBZF{$fBM})I2k$ieBxZLKVJ4W!CqEVre><j
zl}Gtq;&D|H%mDtn54?b;OsOWXh_#G86nZ`AEmneac3lvW4NMu#U}qy(Rmyns;Y(f<
z?J;?VhLBi^&9vI+k-T8+fuQ2i^#hnl^kiL@WIE}aH>);!(dD%^JX0HbEuxA~1O3Y8
zeZK}z8986BG%guttd@%hBC5@y=bO>KO_El(DRB3f#1Wzg{Oq9wxY%*afGAB|;p@Tm
zFC#*n#f7H@ohnL=9`YB#grs?VKe~m6f1kPonFc^ti=qb$DC6&}Lm`83@<AT=9h}FM
z0CuHK{MRUJbQrrnR1X{e6UQJ4=^ig4FsTAKJflj)j!<ai=~mya>>Nc^r0qbt)(-8@
z6ywV_iGU<|F@e}A5l#1>RI-|aR)Yl(29=2w%xGi}AWWCpgjw!DptL*lqWaAGDDM5E
z6iGVd<)tC(XE)1T_hO-|i_s=PNzYd;g1`E1^)^4U>A6|%FN^bkxo;Y)5Y>Jac~8PS
zqf4pep(KVfo5Ddk_`HD%gRb9!)#4vf{~E0s-W@>FZs?GEETHnNWX{JZUmCH=yoie)
zvmns)M->P9fp355H6V6Y=bsq#+MQ1=fyN%c+BF786enAzv&Chzt?(waJ?C_ad*b=|
zPY0maSSkol>zRef@4Z_}xx{Uccax*LQU8s!0uKimzT7gD@n>kf$hIyalS5E{7mog`
zPzo+$E(O@0IRUkDk_m8O=~qJk2P8q;zEdb{9;pTVUroM3ia(`DNlvCrANfsZO^WpZ
zR(hiljy^b$C(4sYr%p~0Q?Fyk!}1+XR-&S(J3&l-=AsBEP3>VRWYbJV043`yC}dNt
zoXPgmm-SO^%cxLIcT7m1quSj^jTI8x>m3qObuO>h(=)YxNs{Hp&<rU$x|2BU5x*l#
z{k%3(R7j>5sBHxmE!|0vaNdtto}=}gLybhd?O)P)N74cb!IY7LV^@-aPOVM?)xKSl
zj+T~4GbH-C=hfw4AVlk|y$=;~sj$=6hM90nN5=YfnnEt!ouw1wm4@Xtq4qu$a_MiB
zub|?ZZblvgQ`DAEc4kmix@g4QgBE|_z}|opD_VNbMUi_|>qXhQB})i{Ky*t{(s}HE
zV`J6G!RxK5kUzgDf*qm(y1$ktDiqEm(1X(o%6VJY+5~GatRPOP*{YWkM?%n0Oqv$2
zJ(#@xsP-BC@9R9wq-p74%9SmJ3Yw0@@(|f@`i<+UA}NDcCE-;i=%H<b05XJ{b|hkj
z_@jI;7mwBDmGXKWs_ktmpm06ej;a1HR(gof*-os+8=y~ZlgII%@M^xbP41=cFOXVk
zXZ#MY`pKV2X4@chDlc%}usDH577Pls1BQ-%1Sh<m39mrA(4AIHd)FPW>f2P{YByGn
zc0qwN8G$W)SJ|2&Mj>@dtCpN_{(b>zuN>{))bhuxZoI)vlA%^wI$`&_@SET{y};>r
zmIW4p$4J>uzC!AB9PzJ3Cle(WTa%Bf9luTKu(D%{wsk*ntTlSgVG+=pj!|AKg>7<j
z)p(ZJHtW0qXYcg>_v?xFu@Z@I{b3Ae@0@U8`V`nGf;np4s3oLM!_*w@!`T@nIShj^
z^h&V_*t!43+TB?_I_U>wFQAEOLoh-@w@K<*t6d;mT<KKhF%1G~<nijlSXAjZP}n-3
z0A2TxXPnmX^Ff?aW@_wL4`im1uS{KIv+6Xd#L4}A;gVbrH@cWoKBOZ5_K~a08l`$l
zOlea^jDNi@EBDEyY*O`$lZG2|TxZj1K9#9w@-*bi=t0pDIi~PY$~K_XeqjhS#q~}{
zz4hzSQD+tC)<l4%JF9h~e%+ybaI3ktJ%HM1Gq?Z_E`V99*Mb-qO{&bvK3}Fkj|RxR
zfy8(6?ZDvS81&5e;6bf<?XKWbmEKQfD+tcnfRQ4D!Jxkr{bm7-d|GFVTN?;j&O9>I
z_5TrHUR`IWjP5@)V;vkZqIM7?4bAVV|MiY&Kw;dd-FF%!7)%O!?akogLt|bD-*vd<
z?6UcJxDraemSoxWNF+*YWH+&)YL_k?zc=PKJL=Iz7a1xbUi{=wymKzR0p4GO7iVXb
z<S+=s&?^y~$l?AM>qqc&w#*LD3up|b36>)%wg|Ot@OJltr|-omwBG0sZ{o>bP5S(`
z8>7%}Y<>Xxq=sq-%D=1X0G0Zdq3-{y$_UvtC>l>foSm=RlLcHLG{h_vKB}`M+uVrC
zNV62vU=+6m6;ppMn0;AKzrR(L4SQ9>BWHJk&@9<_X3&Ao9jJ@AT^O4nf86*5&-t`h
zh11?3yp8OqGec}Nhl<m#<dNe2;&$+j;Cyl=G^8!`j0vT;=R}=D;rl|QK#NFrH=2ZN
z0SXN%X_29Mc^w3s!yGJ*G^(&f(Se-b=GMSs7FsZB@rsF>-Rr!FFyU?F$JY4&xuwhS
zTr8%Tg&K;9KMT~(0xzKQZePClYON{_dqr|rXS<%0Ugl6f&{58fe2Xy^^U$cNqAe-z
z>jaCKhMH1=kBIclb3T8(WSA+o{mt4hjxS;yilt2l7<_0xoSjh)#2^Snue2=+_5K&z
zpYo>ZW}|ok0t5{*GBY>Dt=_~#V-)CB3DDlTGFEzS#++rZ+M69`KR|AE6siZJlf|?<
zUh$4~3BQg?uHtQK->XDK(Gw2SO)TQ$d9h2&^v6;Y$%oB(k3A95CS_tIz&r+$lXKz<
z2NF%Ej*w4BAvzXF`K$JL@m1^yBceMC5C)C9=L2{L4(&-h-uaUm20fh3zkNG!=)kAk
z@sncjl249LCk+*sr{19}rYQ2BU66N5^8r=N8!8iJUF0+CLqnwpdtWH1ywW{c%KCtg
zwB}W!p~h;ZpG`BeSZBX;@K9%Emp{XPvRb+1mD(57+hCKD%tfEir#<n|JD7uHmqn!=
zJe0KGp>71o)SPkYxo60K3Uu34P7^Qn)}gBEm84()k4@F9FK6ePBtZzm;45uQ8=U)J
zZ0E=F(dCqj&IKsSegGyUAphobR%+%4S#^d|_~Q@B@s=Y^T^&F}b%R>9{xLjQt$i)f
zP~&Hu-ff4WXw_jr((3*7MBAb6IjanHnpK~(dbiyET~_}fL~f5FQP)5`Oc8p20m@~C
zsQ-Exm<APHhWll*_Itf4DEv!f?bkc+LBF#Lsw*k>rGxS?cy`?9_L_4lP50(4P{O>Z
z-oP8BwgN8Q-~siG$_E0fDW5X{R6@)sG^&FRmZl_DOK=OJ-GP=LHmWK9wG~OrNNxbm
z+UQ&Z`y8GNQ*5LpsioH6R)C*Gx_-hY<w`Sztw^tBPHvErRI>u*FcqDbn|hENDOSTL
z3h-0TVC;Dtk<xT^XAs~gk=Owm<0y_TGjd~mQQtVGdp@SC#je}ca3kD0roKLLH@LmN
z@!7E?+EUQn*^Edz@TZ3NFK1VjLm>>pt|VhC+x;*0Oq62wvJCz6t081lq@}E&Y=#oL
z<w=;crl9&dDpR)54T)Th*=q)LDzQQ#U&3n!BtH>`YZNaJ?xoQ^<pgIx5gbTNj<=FG
z7KBrvG&^kUpLe{$(Pc#Ts1Gwpb&5#2q4c(gOe2xwcVh0V{~|aZN(t>%GF^oxfA#ii
zcyKz@T<s_pBGXD`1ri5}U6#<wN&5yh{-d&QQ8^tdv6FJp2T7uVuy-d1=}@DtuocSg
zg2&eVi;B*=Ty5hNy@3|J36U_I5tTvx-oc~Lf~C#GROd_yJn4e|DpPHpbW?7_>wD21
zoD~&-l)t~G&L>{Lnt-wys*OVZ-th{muc1uYoa~9a?5ya$`9iq3qTGusuES9GW*K&H
zn#fChaK!Kd)%S(4IV&n1uHZZTn^j^7q3-1$=B#Kyow*|a$h8b9C|yIDvgzIT7ss3x
zEkDZ61;>F9hM`x2@JVz3i|uTS?G9>1dV!}5%J56D*_&;K$1P?q=a7CzjU9DG#nxqQ
z&@!m`9p#N;c~KI{K<}5j<`}P7xgKS54jqYM=NVLGUuq;!z4TEsDN5_<!gD_rL1+Ye
zLC+~#W!Ttv!^RmD7pZ4G31?-r^SVXnhrl9{L)q?UczvM$K@592H#<2hqh^@ft>a?D
zBy|37Lv=*;9W?@?{w|B)XbIGyo&+`@16$BpOxYf16eUMh88tpjQ5SRuh3l4%9fM7D
zCYW3n+quZ<sEi6VLLPmpB4<$X9p#Pt&`9JJYNIvS`o^oNWm)u!s-97DIvP7_IWeVC
zbUK3O_KM~C)Z%Td5~#ML7U1p*l|uCoQFWqz`oOV|)kll46bf^DbM|`U$ZQhWZD(a_
zr@(H5g@sVdA2y9*1G+m=RPd&zY6=xQY60%9uo)Dpqwi6<=63%DRrj&FJLvvVb_GZh
z!XWHRi%7Bm|Jd!!HOX$hIq(A+plT~k!V@Sw?KU|Y5e-7qfGKZmsm_6opz8~2S)#U~
zIIt0e8CER6QH>{1{I-LDv0P`51+Y35HQ6tH>`^U%V*voFesMhaTK#Dno7PD1+7nz>
zyI%&oy;@E5oTZ|h`xwc~YUXd^j+97=U4DuO*TF$Eof2|dU7Se+u@(|2FKnmcxTjf-
zUUvzTm!lWOWwZx<Nh?}kUgUY+YJ_RU^vmd_7N8K{mo3yG?1VJ7B6*0n_VMAY_jc+;
ziA0-N58Z`z3Qm(z#$+n^qov~r3?Lc);9YhZUi06QB2kl>5-NVFW!XWZYA$G@GsxkP
zilhU@*}L$F4O%?CkGR@k>L-e~qJx9u$BS}PQ-bv=HmI8;Z(Dwej#|Bcv>H(bqnd=`
zG2Q2rsK$Q@iiy>MN+uY$1P>7yYn58!V)QFP;|d;Ks2|GCEk|My27*@#57Th}i|x*2
zUCv4~GW_MMWe5tyZ5J;odgt66s~Ctq*pfR^gRHvqhWem2aN3cSA6ym%aO2`+7ItLL
zN|*bi|D^o9I6K8=IUH0YRy!@<5Tgozl3P*vYM)+((+x`AtPxfIwZbPg034IT*uvdE
zEho5(E>XT$mCGwk_~cp}bLAB;QF(6=qi$r-9o5DFCsJIB0>?^WmhVXUYL|$LB2)`=
zWFv{@W@%LkDPLELn!%h-C^|*WL2D+jn9#M3qN*PT7;{BMWX^FE-J(zlo`{Mv_G`B#
zKwS})@2I9h{Y8#Clsl%+X>Yv29&?p%6I@6dTnS+bUy%mgk<y0&Hm<c{cOLmRq4_<k
z-=}pF)%rf|YDd$KV`|)bEX8Us2LlAFOP;qYSP3+<wVWj`EK~D5Z@&p;@2G%nx18H8
zcTN8U3Iey3PNdv6waOc`NTSUXDO&8jS3xwi>WZBB#$v!X<u_uKAI{DNM`93$p;zJ)
zAl(0ABaNEpN~2vq7qDoXf=ObB-#LlNY$UQ#kaFT!%Nn3eo_Axva-uy{^42)$Wp`LN
zPG?toy#Q6o=HvsY$waRgRD@{BimUZaX|lJc`U92f5mccR5s9H5{iqM<HWbmG;G($H
z58`SI%Fx9z0tgS{taQ}|lbP-BF4<n1oj`T0Pf%91e$zWY5R}q}fB%3H?M80~8m2Z>
zu^#J7T$D~d<1T^RE8)79))TNjDyN?42S<H>h!njri4<DGx%(xf*nx^WYK~Lz9;))v
zgKBHM;wbula}5<drVT+E(lPB;zJ>}OBgdfYRrP<N`U%wFUB%CANV*SKg~%@aOHG%h
zN=wCD_Y*sEQlJ_G%lgaqVohp2)2BWq{tHQI(-&N`c30t)S<D?f#wo_IW>?NoQlK7y
z@&Lq4l#NwI;S?TYnom3ACHA#C|4?=YxD~@7482klAm!ixV$-DY+)ewR<N_9HQc7d6
z8z}z>wN9Wav%6lLVp>k4f=Vi7PWNgPa9Q12KZl)2?BeGYtFGr_>3VJls>Gzx{f%YH
zq7)y!!gUsL>IesgG=v|2gBwsqoCdnazoI&VsvDWd4$}I3sY9w)HqOau*DN-j-7oP!
zy~K4+`wJBa``<%X13OU80;>}Biwg@e!#hy%9_n;~>-_>xqpGSMDrrKynLJ3c*EY_n
z+|G+rz8dSL>Z+fDNQhIS`T_mkL3Ma%FDRW5rvvvoW6V*`q_zV!5HhXDzUYH^kj%ZT
zLKbm4<)_VPX{;g3xjyw3ar$3Wu|}Rm<;Yu+uP)k+)wi{A7$8n>95H5{_B&|}&AAa3
z!Wfm?BS<o-`HH@|H*qF4qq83QwIQ~1=dq(dN?AKdGA2^6pRh=i(NVEDb0F@h9qeVL
z6K7JO{Hm(YA77kLP+z2-0S?132m`;=CeYCTe{9oMAJa4qrhULl+LRKEjiB&4;<~#@
zU1~Xgq6I}$j9~#RX2Q~sWY%tV!DP}`D5bRyA#b&GAdJ(Fc+XLnM%F$$t5PO2H?-^6
z@<+CS)fUcyzI0D@;s)b&!t6F;J1i<t$G*>Zs5NU}+h8*3rer&z?%$yQ0!7}=k3K}b
ztl%~gwG=SWm$JcYTjN?w|5?GL5@gmq(^WG|<n`z5oOY%m;6HG|KLpS<I~dMsR}@_#
zk|TDFpy)x_`v$Mr`Fw+lS5dR`!DLeUDs0eKk>2N4H?s#!>d-CKT@$oCt5+>3gd32u
z!;};;uH*hoZ5#$wWCq=@OPzP?*<9O(I=|9XxxqSK!KAuV*XClf_~W#ol3TJ5Jls#K
zf?GQOUe)~Y2Gu(`U{b9%e+}fOyg|>Bg>lDeK`FKmiqS&>+08OltK-#?Q>T@x8Do5s
zl(pK4G+<J*`e6rJN*pO#P{FDm&+10mx!^_!!$9;(7$(W={V%q(lAopRsty;hA|Otf
zpFdXhs8nGxM6IUQ+lbj6y|mD)?(Nw`OAc6bn06{90LeK&F^8=|p55qG<6eklfJHT!
zKu$J-dM&#lQUh~XpaP0YC+RhO#(FwPjyp+j6f-xsN{xR?EiQc<T)(lN&V1}TlMlLA
z#cuA|1Vf~fLU0nKu1QYy=t*Zoq|Su;hOlPVw1%x!WothZZJ&Yrt+J2QC%HI@)R+fO
zv%qNv61Fywuq09yU<1N#@o1R2lSqvLMjpv=sI*BsHcDMzN|`3Q9yC#iRQmBKmrKzl
zTdPV)CYVop5tMN-OH#eM*GZ(_-$Iq*A_KakUfpYm)Gwue|GgiSN_FqxcQ9}xaDTi@
z^<5MqwWg+uVYRBSeWMf(R04T58IqwuDZH_9aG;uT^k^xUFT8@iVaBgNuDodgNV^_;
z-x=_r`qJmBq7aLpL%c182emd19_d*12K&PqA~kR$1R4^7&*@Fsx!^zyf<W|2QW4Aj
zFSehAN3)v-dVvXAR6fJB17$$r3{Wf{LLodon5#^N=j9C6d5NFD)1GTtj;5?9P!5z}
zRn+H}?LL$b*uF4Z#5g#E0J)a!^TFMY_M4I|X=Y0ur~@e8!GUPWd;}HVuF;^^6E(rj
zw(r&0E0R>%zfhJ#Yb_{f1C;tEzl6y_EUoojod1*pWfp$5Hw=VblgOP`s)Tf=N>F!H
zpjc?Fl;<e(W?@?tb%A`HJ5W)8)HpbAs92z;d_p~B>nQUI^*Q6Ap9GLv|3B4frHWE>
zVx9o2wt539?)H=(mef4Z+^fa{qm?>Gb{e6Pqsj4U9+prk857CUq!_J<R69E(sB^Nu
z1GhTTt+a;XYLA#`Ay{e#O}+)S@1Yh<!yXjQ4ttK6$ZX~U>mwMQR3ROFM^b53Mj!PD
zJjT6MYf=^MSj7lx^!oLT0nM)mgn&tXn3+KR_o@q$-Sh2VoSgxZ!ypU;zvRXy#Q*=;
zW#+1NCcPVzen0~$7?3Ktkdzt2UOoXTs*)yoJvo=?sPdnB7@6I)y_r3smSpo9m&fXM
z;!)qcKe&)lX`T57_=Vb^K(W+~(?;au`T6n*6f!C?1tAakVFT;EFZ_UchZ>I3zoQdJ
zFT$l{)G6X)zHrM^J{N{04RyRo^z`|WjI@Nb-H?WE3UA0|AoVI$$S6G++$(yfR~J+A
z=@cIj2RDv~a~q#XAzN3`vnxoV935GMmzLX;$<6x$_!j68kctX51z9+H9w4Qfre4Wu
z^oObwz0ZJ4+@_a;342z8TTgi<ep3~3cOyWoxTT(YN%DASkeo_sN*QJLt>-LLifQT)
zPI6N(&vsv!T?mLKXkp(W$#SZToo~sOLxo>L!c<LfQj<~>R`0YvlrBl*C8PV?GrD4o
z!=FGMe~gNQ<w9^QEQI`jRHIt-t&9rWsqya)r1O0gmGDE_8Ra+(gFy63j*IPZ|BG#v
zdLB{L3cLH)uaScZCCmW%s5}>2dK`~<K#2e!1>!X?oOxsLSLk!_^cH28d~lT0cN)Fy
z2W#l<78CM>T5RcOsK|m>peVaY%VbO=*gciJy*OqUZD(|S56g$vctZ)pIu8<-*3PnH
zc9u@7C2Zd14>w5J<=?03<%6v{E*ktwp1i`AmPQ)I$nVy7%r3Sxpe8__02`-LT&KgL
zRFppPb!-bra`smj(FMf?)-#+v4_A<-MQ`&2xS)b}U4iOAshU?k7S7lXl%xSKP4G3k
zl!0p_#=zw=Rqv6VbE=ad8XR>#6VN-M9bH?MPNcU;VHa+2ly|5JP$z)gDi7^qOPwNd
z6h13!evXC0=fKxh%xhKu&Cg%)e0hpC&^WSxp&J^<o7MA-Vc0v=oJe<xIB!;8fT9m?
zuoB7n)Hdde<O(^b>-4rLt&HEG$Ya#5{WLai75tce^Myao&M1jN5C)=GLRb*)f3aF6
zFCE*NVE_EuiOzx{3A-OqlkB577wo8=t8*dV_pDcnD5og$S5$iY7P~7ATBWkoW0Rd}
zH#Iuc@krFLR;i0}ww(b$zbN{i@d%+ZQJE8?EFqfkm%eArb!(MQ&!Y4EZ(Q#U`<kYO
z7u4PJspUMrERo*uA=DSwr@g~-f?BKegH?!UB-BB)aJ1=A-P-02b(dZ8G<4xp^*hwT
z@C?`eQ!PNTuQM=|7#PZ8*(?<1N4i6`%8;?V7PJC|>X*E3-T%2wG^|rvP~I!<i+))p
zT~IOEty5aL%6vRg17|va2}<{<DzdRpqpCzzenj;Mis5z2RGEo$Aq%fqUu(FBsX-k8
z*ecUIY6}~?bxOP4)R_PMi&iY=g}OBsro$vl9I6Rn0)_HXlj5f~7ME9<l+20LIBbW^
z)s_h56cgB3%$^&s1O?X-tjx9on{Vt26_%9z%BlS$q(Tz2J5-IKtejpjQ~4XJ-l1NU
zoeL7fAP7XSRDY=VzgW}8ec0(_)C=rjBqFj4KT!Du3RzO3|Exmusa5sg7o>>jp6Heh
zU(j=-IZ_7cX#e^@Qo=v|SYIQdH*E^01zJvxsH?-WS}<-=5B^!AKk;v@k4C+-Qc7`a
zsunD7R^#UR<*i3l8XCD>N_MD?1?Fd~zN)PQtDpqHnf19y*>A?nPE8k-j&&9|3OAnx
z2D*XgWtD9tM=t;Z05?=Ufuh-+=w1b~kcD<+m8&!mYC~>3`&JAw?aIC#YHYwZlv8=>
zZ(#HYl~J}V-CjsaPAjFcK<T#oOVhGH)&-?I49(IEMnLt9#9r%YqcZ7im13Y}26KkA
z{%^cb?<ACp2&Lk-Q0juRXQ-OGoj|DvJ7tX~mCc~d-AEgss_~|iV68J|kh)#%8yhHJ
zZ?sc|lw;YMG#gf_OggVmM`+-oDWnY~4t6TaK?#XvpDb?cVCqv$C%sNbWaF-I$A~v+
zXMh|r2tv^-8G}IXf3c=bcuaS<MJEUF596SS@IU`T#T%w0SJ+X?9?4+PIxs^v?MOTJ
z2!bb6Ux9+6;k25go406H__~WfwaWh9c9XWPY`dfL*^vy5x5t(}gj(MVj52j5t?YtT
znQ<NUVUEJ-KvmrK%uZ8DOlqqHYV~-E)L)QvkB=CoyT^vr*FqFdCB%Ymp6Ab9mE9p$
z2UF&lUdz7EGP*UoCt+>|YP=g2VXGZbJ*1AM5KTWAHQKRcl)d`Y$UoIRyI*X=s_=B?
zfjcQg%ZBwC?>tbH3nX40Er(%9?Fi6J9ckQ#7*bA&lL?=qaGInTjR3erKRKZyGflB4
z=TDXK#wS$0RZ%#-0X6_GsJ;SqyZXKCf<mn;Z>kxn0Vzfw5s2=>->+@g9C$7yx#km4
z_JOL?q3Y<0Rm@C^0*RTU2p@k#UiV;28*jurg<)?(>OG_mTl&S>wIDkPgTO0cfS~uk
z*z2TW$+LDKy}-^oA|RiI?odidJU9{$%M*|Ov3WQ5?cSSrR^Ggu(*<K7#@o45&TXj6
zLpfHg@PG^`29y9wcc9#{o9{tPea-RVG}Npl5AohPeR@C%k*yLd-$lY0l3^=;>A_lo
z6m;0J%5D+3sP91ea)zht&HtA<)Ot%m7dUxZW#QPDV3R}Pv}uPS`0w(3qi>|#JiTi=
z0S*8RQj1?NK()I~Dfy_~E)+kke_`6-2)~}!P7Ic=7)Zk@lMug@GtU;hZK~M#QKEpd
z9jJb1r9|=@D+4QeV6_E>@vkGMqj3H+!s(f(Lw4QIL7zXIaTYr1Kh6|WAD{68l-mJx
zdKoj*7mi)Em^3I<X1!<1gnBsquq}b65R|=V8c<AL&5=cfpaLZyop>|?U##HLHGg^N
znPT9MBkKrF;}Wa>9f~aqsud_Gmug6}wuRLnXJ>%qFbG1?D~Z7X_rKWgwDNJZt(XhE
z5jBJWpB$jPXe!aQaJOeCXp4bu7>|5%f>vhKjmyy2mqyWYuY~21ffgOTcthZC^M|Nw
zHZUHXQv-RH0Wx{G-iFkd?t?u;hX7)Q>MfJkAh^@LXNaOHhKJo;fodlx`LU`&EuKN)
z)6}(l7e;#uM|NHJfd{IlVIVwv$0t`s1>t%`vp#i?EjsEmC|Xt}bumy2Cr}uaVGyw>
z5;_>)QTBl`dD*mY_RC*seX{KYdFh7}?9em{w>|O{cnuCtRQII&E2)(TLNg?pH$5Jk
z*mU9TBtWLJ+;ui@b7YI2-VDm`IwMcPK7g_R3-{eQv~@A$b<?J3zEsqIEM}%;P$4cQ
zNM6w%JS3WEkE*jyHBeo#nnqn8Q1U?X`j6u8tNLx=A8F@;#4rd#!80jF<^C7zM_Do^
z9W^~b-+;9x0rz>8I%w~4VU^Hy^q<Xq)DoDRru?rGXTNZG61?1Faj7(yy6HLACmr#C
zOD{xW|5t59p$9eJps=Mk`5l6h^h$m)j8Yj=JZG<gD^fN}YDeN)f<l5}CqWsJ$zC=d
zNO6Fjv+!pobZgn6HE_LroS^M>!6}=2HV<_l7oC^W=odcnMu}al_*6>gh0ErqNv%lq
zSiY4@wxZJCQRQ&jqVuS1ZrUlgR&VM9-t8@A5T2RH6>Bu5>a%KH5bAq9TOX$2{Hz?k
z%rdWlHZ%n=?18jpI(9-b!Zem4HzySr_`(zbOko~zyA&Y*1?DjY8<-Xc*J)c;tvkut
z;|o;=ZhZ$fPXWU8vPzxDTwWy|gq-J;lNG{(l8s9H$G*?QK7iQz>Jl9odr=nbo)zPk
z&x%cz;_ZUJI6DIzhCvXDUdc{Hy#K|vq~+1NWr`R00W|s*_`HBz2Fim;MfqloEghLs
zu?P32<iJIHp57s<EU>aA_mJcTDO;RM#3J-~%MkCPDiI(Z4LV#mL?b|bj1iLng3+eA
zRH^1*4_x{Y%TP3zHosONQMZjbCy6wdCN%fAq4Hm=Bm!k6jm(kdQ}FQpG(UPRL3#n4
z19x=~N}eW}T5)X=kT&>*WdGfmImxU@t5c$qa@+H(6QVRmJLsM8t!PE%nc-1YMI%s*
zM6wo`5A)h{ki6*e@}bKeI@beXColQ~D!78=MQdh!6up~4t2oAKHmS)k7wS0XHLZt0
z$Sv%(XTLgq1?SY4#3(}-3i1<@Zl}TgnZO{^6UUfJ^^S)X*ZTK=4U-!ZC4MXRv^Qtx
zk|Qw;0?{kQ!GO8{#U>hwM{6>YaqqG!xvL2#6rZ$nWeRgJqAaS@t8uDSMMrKhl{@Pj
z#PjN0CVRdSMd@C8p0e{jD2%=KHN*o^)G((B=XPKNNTNpWJSy|L<_Q#gzcND>k`sSO
zYgyxJK@hD33p_b5-ntu6k7MFYf6}W$v2_BqfXZt)2A+laa;<+4Lswj9{=ny{Jj?!j
zBQ;SGXIM2{DHX)mzI9?Sbl1GNDkpV9`zlLk38TMg{{`Jb5tj4*nbzjS>ja8UQYBJU
zGUp$GR09fCG-vS%S%YchGITV!q6>oyd42~(0V6;a0?iX3LYLfUAZiTCDxNw}D55U#
z#Fuq>ss<E_XaE$it(Pqz^iT>3VCwWt_djOvC6v6NSV8d6e_{wUkvfhzrHUD42zx(;
z8u|iq9XPywmBdIbR3mS8gK}q<Q147><ulk>I>%qA^~2e@;7AaHK=eum74`lX+ex<T
zvE981Iv1$$QxT-xl8POjnmN>t@k(M(D*8iuL{J+Qq!qbh4rTO087#+lWnVd?59-Xj
ztYEtn=hDu>VDv$mn%5GZrSe)kA2Kp^L7l?;h))bEw2oWqv6shkQHlHG#3S`oE$>c^
zlpAQNk(O;JNan)zs*XrI?L?~aQqUQcK04TqJ}5cDpHQ&){9^}dJr(SWuTRgQAlcQh
zM6e$8xToc>xlCP9<p<N03s2Xxu<7|+m#GKp2CtEMnA}N#S`NiEG)jOm*afMBr{sst
z)C1MPuJcWiLuK=kuIE7g4%8uMxgfWJw3|b^t)FtR&<4nOs`ZajGl!Y-nSd@&*(Jwi
zXxoURb&sPPP&)wPZ_-li?Xw<-LB7qY>xrp#(+_{;D^2}Qq8b9K14A<)s_2>DfV7v1
z$5+0x{*cC4roTb>!`a#8Kn#LF_)3a(wfDc+HfiT0{fpSQeIf|66hVd<2-V#b6a7aJ
zG7x&PjcXGVbHnmu{0Z5IO}oc<hw3`rl$G`#Fi@c)u9$K5dPte_0^&($!IjIR8pQM&
zZB#l@$DW3LtGY*Y8(+Pxz<e$~wp6|es%K|W3TQK)Qcz9|&+HFK_7|}P9UEt$>S3xO
zp81|Scr1<Mj#`*bCk<cL25b+50iOxZD#Wgz49#NEo5vVGjmgPxayFZD6}9oVot>hI
z0K^4k@@RB+MBQcnkEe8#11b@sd7cI(<IkTYMR2s#tEf$Y8)}&mr9cgH*Y?XT<ywtX
zvxR3Uij5GH8EJJ7z*`MWpDJqHj*Wa_Jlbw*V6ubPT75X$IDxI;I|-NhAp(qTRN+rN
z*p{{T$J?n9bq;jvjm}C-2SSjL7)IS%y7~U?Tz}5a1qWgf1fpk>R!i@HvE8K0qgppY
zFECLYm5+>np!Q*2cx9-agho{R1v~Mhy-6_w<D|C0^IGqoLJ~+CSk>|*aG|$1X>6Tr
zG@qVkjEz5yo~Nsf3eRt=tanIz5L@IG0VrBBz0TxY21<GoyaysHg7gY<6kh;t+!BD|
zqpb}AM-1LF2Ct|}T2O8M!73!#BB!L)D~si`7}D*ym9l1L!^xIoLZ{U1bY$ia^dkA0
zfjU_{Vm(jOh>vQ0h11AMBXt$0fhK6cXQ6jS)rqOr0jSk1i)r~3a|Vj|4qnrMf~7qp
zE$&o!l`#Uej{_=PE4pQX>R@g@(D|)p7^pp5FKeY2V%iok^)Z;JQE1NENGGJEqf~2#
zlzcRVP{3h20Zz&FK2dTa;tjz>+v-=;Iv7xAcb%M<*Qh?6T>%oqAPD<X7h0wN|Jb(9
zgr2<~bRXaV5d}1<xtw!Kh_;VuAbzWF1;7@#-Fy64vbx7zM7RtmqL4WBM!*XtfeU(K
zotAF6zU*)TPjnpyDlVceTIfV^MEPPXN-7PJHbka^d=94ukL|lZu};?%!&Q{X-nK%k
zc3<vA^$k&m<%=gyP)>6N=H-a4NktH5orWfVh_cI3&hokS2T>4optz<2K|7Qj&JbrN
z5Hf)EI1DVmKXX8N3e0sjt+j$_3~=(xjy-!gTLpb(_i{M-dn|G`?UV*k=rL$C*<DBl
zVyi;TgL5xgj3yIN$VKT@70qjkB^5p>sDydp#8KPU`ofv`KZ&BD065HfpwK#HUF&g*
z>+43zMIv?{E<$`I(AX9E9o0CM1R;om4c+1`PD)ht5hR-1UAFlw$y*NKW{X&Emq{fD
z!rcXxB75sz@y$wa&d%rvVh{wPEk%gN^xxQhTzDA08Som|K@g%~b{~K5tgak0R726J
zsdqjyP#jTA->)exLOncD&KSyul1Ozv0P+ABREwb?w6$Eh-RYg$6z@zlKe=8gji%A0
zcxy6~R3j|8;MnalbkX81RUkdIzP{yM>02gI!ezo~F6)&7>Qu|VL~cyHMC9&eZID^{
zyV!(HHku@IUqm5<X`r$Mt`6miLt)(iP=3ec=<LEodmcyYbIg@rX%~B3*y2W71C`@m
z=%BFeuA=@QP@5O`@_5~Wx~5(5KhjEwb<c!Yy_^Z48)XMREsk_-eC=#xDdMG<hK%mm
z#M}}}-KPF{7}2vD^Hi#G(L{+|pnN8QL%pR_;jX;|!b_M>t3Nc$K*7`OjF9|Xe+<NS
ziRIO4d5_Bkm!*wr(~bN@S@Y$o$fgfx=Yqr_2m{e8X+8+|zgVZ%Y^+L?^a49!MPNvH
z5w<L*J9Uy;fIdwH)#pJi{#Gp$)R=$1FQ;NDOJ<&=fT6BRp@K@r&+nIz0+JkfdPo)j
z8KgAr3`J=4c)IkD(Wfk+?_;?WTxOG>q~kLNz_lxObQIDlS`odu*`bonb7wNy19tAM
zRYtd6QI`iRlR&E6k5F+*9$Q8ey;&Sps%Xuk60gCQ(IoFqzWpVH7n$h3_My)btj`*5
zDb4%X#EWz?Iy4*F5n6g^Y(i=QS;25yopm~5A(?tqbz2_*tWHhkJb;z8%~`Gu9jS9t
z_X++0VC_T+tNO+B!|J_UA2@_1anwYUPdtMr@|B<$lq|OiC0wpnh1Lhl`9CR4@^<w}
zJK8R&##?9OspI?PF2rQ3_!t@w@5R{}U^fiHF!V|R58~YaV(aUxzO!sAYA&D$u1mm@
z?DtR-rW`ms56SGa(SUp!&vV+;{?3Ek0%PY`pX1^;f9&t;x<4=I2^1|i8RA~^mMy5`
z-%P0A&q5NtIq4km+SLsxo#kSu`%%}G@~y7BTZZV(Kalp*+tWb`V$Neh2m0R1f8{`N
zUl9@9B(ctoiIv+l0yQp3_t&I6mp8Ci;h@;NbtknD%h}6hSmIqq6k14WA+6`5g-A}2
zBI!kO+MR(UnzPGFf|P4UaV<s#F-dV<ei>9bN@s7>?4dX@?_`5X3X~kpK#EJ027OXz
z^zliQl;E0P+hxN<K$YF7kmtDK?9hp^eG(*PH@>91sZ=J+R>uI%#!J&>d|JeDk^=YR
zt^Ae(o4Ph-?d-;PQ~YN6V*(WidwZ;CeWzoPr^MXo)lM2S<HaI&^Sq+xKlhuoD?wry
z1c6_Qf<*rRv9>eawJ}Y>^a0rsM8a?^?{nm}%_W{&^Yg_OUlC4!L9OYjO?ui%D10#S
z_^r6j8gJCNt!SKS6^xRBpn<vigtB{1toY?RO&dRO^BZF6M#l|*i)P+MoU>u~FK;#h
zRF7omZEUBN+ViaGipnN{Ovpv0qt7V=q*pZVi#YA-K&z5j=0G0fU{7cHZxT^i)ifF-
z16)qbyv8d+AZIX1+Als2R_fxWNiBo#hf9AL*$DF|aVV+W(McMH#v_q2zsJpqS~xS0
z5m}_rdX@3_w-|^Xdsvc`(?+9|a5||;wtE*>=&unbo81GVyGC{h4zjZE&f-;6ifZP^
zfmmK;6F~|H)l3lT2rBl>!{r3?D;yJHq!p8>Xq`=a-2U_X2WRJc#4rfM;FTygkM6%%
zf3*IT3+)-YfX@g82*UCS*7b2`WT-qETF?7pdBrcB;_tG2wKezJ^w2Tw(yEJH#P}cS
z8z}{`>7s)^r)@S@K)m92g3pC`Z6|^Hf^}GSmT`jhSQ6p@;YX7;e<9ROZd!TuxYK~M
zijV(cME}haHiX?=)aD<;^Q36NiQ`l&%c@;-mBCef89B8lPl^qdVJj!tjo#0T9g{AX
z7f!kP{e!D@NvV&Gl-imSRSKc&>_x%>f+teg#0&3ym$dPl1O2T-ZKE{5gc38`$<$$7
zHSVLE(w_5&*N&AeeMF}57U{yKeDTIfc3}VDl&iW1w~<pU-%$<D;65Sk6EY1%Cqk~5
z%TseVPjCu`)9WE-&Ln*7pww2&dX_nvX!VUq*i{K{P83||&&LK#x+;l2*utCbG8e!c
zC)o*^=8Lm4N|G1^q2QHv6x92lZ1-d7mohU0<^r$OAc_zg^QKfbe^)j-$u7=aWz_Xt
znir!Pw9O$#2h>&Fa`L(PYd6Z#cA-DVlsgnin~Z3wqFkN8D@sBSMh28fz!eGP#_e`P
z7U&>wKUpQ<4r^CBGy%T>Wk>fr<<@6G3b+HsXh1}}ij#B1pGDfzE|7uSinlz+WOS0f
z;&R8M*$vPR^r<3b(n;s}nL^rfVVL8YP}}{<VyozCnfoPL$Z9}bExn%zL3D^7q!H?v
zLZ-^Z{FBb;1K(YU;UZaS3Yq-jN1Go3)k0lY0M$n4*x88U2PUbG#0AF`xk|Q4U(nas
za3!Vr^JY+5DM{r<FkkyVnR=nt@8UTT)n?n2G`)Y#^7Md$M?G6qNSb;URz`$@M=eZL
z+aBupw>3Ii?Xd7)(yj!FVGsm<Nuv<_|Hs-%!;&(wNcw>8EJzT`Ws>PI&0@NaJ?_5$
zG=S8xiCcEw%iXCh0KvSwJ2h^XPc9Ztif06MQ%$J}BV&v02z>^$O(`9^Ng%<ti;GSe
zFR(XI9KvCTrWJZ2q!4)Bc>QS?a*W#8tPQ|M<}Fa-nQVtd>b_$KAaLL8DP^^!){U(h
z&5W`oVjLMxwv))Wa4T9G#T^`1zL71CDm6*Tl|3cy_UHKuk~Z;F!Og3W%PbUn9CR+^
zjvkH!Kn*hv;cRcFrmC&9CuQM-W}nKXl5vF)&j?YqD&!SHYTugA=Z-0rB<L@r_(IW4
zC1V;=#ni-R(~wp;4Tp68KCNyln4F1@UNIznU2@zTN}8?w+?#*siOS}Xo^w(Mu4ND1
zDqj%Chm>BVol$bbAPhvW6k-;{{V&#Z8a;Wi8$tV*uQyW62wRBVZ%~~=Qi&pGb%&%&
zNXMMp8puW3(25ZLBJGHME;qf^qfd*V4y*)XD;PP)P<_9NsP9BH=H%XhACzsNLK`;9
zC7(QTu{$^P6&9I6vUqm12lH)3er~A}!~eJGEd&)c{6kc)UoA(~IVvHDqLW0+3QC|D
zTR~vwuq_mK)%y5vg8iCcbooyUbOGg!@ZxR$U)K5pYD|-79Ae{wZC28+Uty5xr|MkY
zsHb>(&M7koV}tluS>aH|(V}cO#W(+hFvb*f-}a|~yomciCAPbp97Mj$HL;x%{+tJ4
z8||U@(BR_ys{9D^iPF0Z5vmj%YVz|!aS79CG{&qDPpupaA&o1E<ZNt^5RR2EB+&rJ
zguCVMgyItBgBLKwLc#%9V<LT#b_Q4o0wEB+lC7|<_rF-amwXH>*gAmo78(s57~Ubd
zgh_BrPWp&x-g=-6VL~QWcG%a7{qE2IQkcNp(20;zl&{vk5So5Tk~^wYl0=1qg$-Gn
zg`z@XbU-5ocA!GKM*upmZ^!i$Kiu{aX*BmVF3^(cOS6(Znd)?0M00CfmB{ZGR?Y+`
z@cZ91nSiMc7n{z&WM5~ZqdYN&w{b~R%eyNS0dtt{s5hZFaqF3U>9(R^W>AGwq0-~2
z&mwSY%e)^}Wn3NvOT_7gH$%Y<MHmHy0qewpbP23nef8byE;fY}Ddyh`Na*u!8<lIS
zih_9>$H$*V+@EDDgl7a7j8}g>lmw)KW&3EIMuuEiSJN<k+o0>}-lUQD45&$%9Ldvk
zgjo*m9y6{tnouS)J^~HY-o+0-Jc0813s+fxqAU?;5AH$P6(AuDgRnQvYk>X#V@`KT
z<~*hS09R;i>4HgLZxWc`7k&dXhP6;8mP7^<B2~F_A4}@%O$PHE%6SE1(~Ql3kn2s&
zK?+ljHl?xnl0tda#Mc;dn6d(c=SNMf=R_dAE{A%Q;a@LSvQv-3?=c~oCx%5;_6ZR1
z0H^l;dC}Y}J`src9>2HlIKunei6rLtir(vB!TY;_9Hs+Z>m3WZrF2kyS_%Yecpp7I
zhm;eEFd#>XVNHkLXC0(4VWGWLi;}wPdNLFwF_F@~aB^x<`q4k65H5!b&1uBgww3JS
zUZ+bZx33hO_?GF9W$o4i)vrL83Bs8;`#&tL?3)y2ziNc4g%y?1Eg6;6rs+N3d)lM!
z;P&<}7MmRA1(LX@7S$t?6egrX=l5l*H|fbal%YM88&oA8Ced4if*fY>l@j7pY{%LY
zk06DKlIaeS9mnnc<m_6kAO=C$O6n=<{)^pD605xj-U4}$TC|Oj1E98%9Wd(PgzUZr
zgo9u`d1|U(-Y~>bC1QKf7wDIvtPkywBkGszBS*^?BC<C(ikF-d#fTsmJAR?7b}7@W
z3ji@B2iy8#*`us6Nk-qN3rd#k2Ie)p_e5V43D-~f)4Sk2fvZenJJA&tFbk|9aCt1l
zra*#&ap;%uUn1jNmS%FI^5u9?-@RK;r?hTt_6ir(FZblC@B`d_=Okdt<^y+;wFjs}
z`f$)B@VHc(8Ybw>e2Wb<R(QiThMb6$Pms!v#9GPXU2P=zrA1Bd&oxjrBrOCHm;UDD
z97yfgvTQM)q}G3>HbV0Tq}nA?yRdyi5?U@33wT0lN(`#oP-*p}9H0r#lukcNfwkov
z70Vn7W^_R18z}5`=mi#gIEAQq`Kp+oE$YeHndLAHgFy63P3&Oj{ufKtmIql>u>bOt
z(SQ(fJS?9=4Mv@G4BQi}<ez~I9ZRvI&PwwW1?~*yl2|4bwp{YV%d*=htYcYYWnEOb
zbd2;KX1DZ|prp#BXc^KpB}U0|87GS&;ig!06jd+bG>=rS*0E1%V=Pb#NY5#iSh7&+
zBVO7rj5ZtHTdkEZgQQ7ZCzOkoqE(CT_*16>rqp6(RxhmM2P2keh1Hj=`0_~hB~Lh<
z`$2|Nf9Z|eM<3?md~Q{H>j;#_xD}*PCs~W-%-B9uOcn!p`y5p4bd@oGubsT!SL>OG
zH5E}M)7!UCMFLXhLRY`Hua3A%?(unNm2*|QvU)#pQ%I>s3W{7#??f$}eM%pJBG%gz
z)CeopGf%AMe1)Rvebr%AMxZpI(~Ly{ZZn*xlhi@k8Q@k7gD~_=&4|<9|6<#u`tg-b
zf?NO*l2W&J@D}H5kHZvE6v3@Hu}KJCo_@SMeVh81`Ajl;UkBrD;(qjMjDa<##R%e-
z+1c9M&Fz385cydgbD7zHgYTBeU8_NBJPmbfM^h^3Ob=oI`Md+&bNTVA=d#Ik=I81_
z_ah_K`(`>*m`^JM@!z?DS50Ov=E7rWd>9C<vVe3x0m&IPYQ))|9PWY40v=j5Z73`<
zJri@K7jgdOt;JR{l}V8%wpt2iooh7q&HdZLTVX_fSnkIu8La}K(~Y<h$3*7eI0`PC
z|E5+3y0#iA609CA%|zz1)}7lt_edp516P>HTv&((ojWFPrN*H&kx8U^;r<#7Zf-@&
z<DE&(f0C+?w?HU~n`V|Auu~f~%1ox7eCD#BfWV%{`fhKYhauA8n5S^pMhr5ONyS(G
zzxt?By)-7rT5Bcr3}_IvCG^eNl^8J$gRqqvKVbG>ti4MlTAH4r3+MpLm>8_w;-CoU
zZK02k@VR*ksKr=gTt^>A#j*b7m{W383>v{8;V+5D>=mFH3Hd>zS#eHcv^gbN4Y%Ix
zlKCH%*3XqIddK7q1w;M;sZ}VjSa(ywa)=+_JmM??b%e80@U)+-Or5!l%7aJP|J|ln
zUHj@CZA?D}*bZrK(0=_Fg$D;mejr_OI-5;N=wm8Aa@4hAd{QT45=T(XqD?X=q>ze|
zMyQJme?TE~<7P+2r&8I0?)xsSpqZ(B%5w@nH1e}w{M;d-oB37>aHEU@3DC@Zw}=BD
zCKV*`8-@34>6n<rv*o_1L_3r5Ud<>K;jgePfdq=<xrB-nlT$yI2>0Zi9j{Nsy_*&9
zByJY!nfZNV#y6DSXg#Q3?NNj-LrSzVZ-8hJaGso9fenK&40{P^SEv6!Hffq|gxJ#X
zfaMYcX`H5iapu3*q!2dP%G`zYWNDz0c?Z-hIMTK%;QA`r#cB&c?Lx>hsxFPv=H5GW
zSzze$x@ft-4h@cFwF_+d2wh(HflPshUK0Owl?p;RWxk7tX2<fx48jWV;(885aeL3a
zJp-D*f%XCpeN4p-YOyHBjXvhhGm2heL~(O4k8f7(E>Y#Put5t`gdG0j!={62N$ObH
z$#Wbz4yDc9EjCO0B|-~8UulQx9EbZ4bYgC_g{aY@SC@v8uFX+HjzeMVWO!KEC7}6>
z(CF~DEe{&4%W$0o{ShTvmm2mThyMSnyyS!RLE|zs@HLo7U^FK;3yc~WjSC};=J4l2
z(&X5QcI7lWq5{SKlSA7#`T?ia?Z?7%QeUig%>AS$lbUbNt_6!h7=&G^#eV4hFSfmD
zg4#LgE|5nMDHRMp6cRUYg2VO<S~RH-L;))VK^2y`&6+R~s4+n)<=Kj+1$yXRlHU30
zosfK^Hfls<Ucb<)sA2<h5u@bJ?*J8ohOOcrObj($yuK0%wg+>DI=mK!Vj9<(pDaDU
z_U!dle*HN>SEGu5@kss|RspCndHtO8RtOfxIx0*GW7#5r=Ko0D(Yc&~dZVcHmIFZd
ze6FJREF4PbXk6}cmiaRviMjy8>Dv5zVMpguu@!e4jml^?6%la~78<9-?-kT`XoYo{
zFDl*9y1YPHWb!KRFAMF3)e6o%ZtC5;$UBf<_Mm;K(4u=Ar~e@hvQxfy+ZT2|R83Fp
z4)CbQ(Z2k`?l3NFlHA!{!eGTwl~dvTw4-+FG5`7!&Yg;~^5X1@vKWLx*p;RhNbi5K
zeI@uh71;&yFzcI0(vap$rIZilj(8ow9k~lrP>M>8lY6hugAP+qJ};20^L(<+DoRd^
zg_=xZ;rxX3$^PdJ(!Ah2|9?AB{#l5E?oah<^6j3dCenV-Q;%`Q%3d6(E>Gj}Y<5nR
z+x@TCh0^s0MP~8>Oxn`wtn!eO$+=@j!=GMMFL1Epa9nsyw1D{GNkIf78PZg}wgU%+
zObm@w23DkaGcTZ&310AZ^Q;M-n)U_h|C){;nluWt(J6^)rhGrfiJ@Cw?y19if^z2M
zm;R(R2HFz})G9_$%!KO|HM0>*9iwhmDP}^u;f8htD7h`Xjw%monL@HX&3|+2AkF1m
zD(nGrYaF%VGAL%MBKXy#)g1w)OweJ0bVZovb5Fk8FK1VDEI|muTGD-h*nea9m9U3z
zPPBoHKxWZ}0D!=5G|mrp{=MV2ADup^$$b9$KY<HY?)i;+=4zcQGfL%1njQzY>_#<{
zUgBVB=X~)}*hVtUgnM~q%1PXOja%5JCvlsLZT*T$C}cVm(6{79C3E$5oTvuG?pO{)
zk$8=>kX7*#Dw!`z;%6_nXqKD=YNLhFWhN%o&O>VBU$2po%t`w}$75Q?5#o#!9NbAL
z?FSt#HaW~f$UNl{zURMkWWhl*I~rA<Bg4F{tbVR=dP@E#Y_8Ji(yAam1z}M|d*hU1
zau5ziL|D`dDmXvyBh>ZoJ1o8FibUJgPLNo_d`ZH11Jt+y`W^~jZTz&1-sl<1hW*M?
zZ<HEyBeyY;#QN*8FB*Fzy)B)|w6{WP`%rd9ISzv`5WUg{Vv6s7v8}Y3H&NP^;jdpK
zuw4gZ&mbV!nAsjcw{K*xsR;8x#|nj)b~?h(4LhME3zU5~!i3xvD9+r}0f+^Jsfw{+
zsPq4T8ev-J3RHYTp@gv)n`&pKc<|XAn>JL|K$@~@C|Jbd@`Ng`9sr+eXr?Z%S<~d5
z=-F#l!c;>ucr5r@-Jkc4jqSCcCzQ80;+8cRpp?luRK(#$kq>HB%Bikq>J}y?9+oF3
zuZ3LK`WN4EWa3=0;yZOUvvVcOBx$$-H5QOmT2k%u_~83jXHE47Pfg8~;wEOgAo~Sb
z0{Ouy2LUO{?WdL9&4-=RWU%2iMGcgS0o5os&+P!Iq4^1v@MxECj)&h~@HaO7rfz16
zJ(;LThG&55M_Q+PnHbw{+clEHdpIZun|py&Cth_jQ!JOfS&8pvJ(D^Slx<viApJMO
zGuO2S=!AsXps3xU{O^7H?w7MGNOBkkVP8t@VvGNOtev)!I+^Wa_m-0e+k_BHKm~>G
zP;(5sK^-qiWG0JDU&q+q8@&!h8q;xrKxyID!qJh%%&yk75&?$0Ml9?SY0R9A0%Yex
zQ>f>tN05RvW-_N25Il#t*K#|k0JEuhJ-Xhye(u<$EX8-IA5co@>W-TrkD07bNT$8%
zY^T<xfh1;zPY$xE?O4S4&7A%`oIp!*)B6IF=JKcnD|F2mmbcU$PC*v)ZObz}v9$Z~
zq~G6KFa`3M$+X_<gT{zIF-xR&U0<kI=I;9XWz#bq#<8*Iq%kGE$~k`nif=$Uw{XVw
z<mS+Y%;w3_$64+0!1P<^pi;-Vxcayqb9bA>)HAs_k0zr`I@Oa%F^)f={9)1WK`n8D
z+RDNUbgi*w4=qfk#*mYD>B2Q#OHep!p#_GV{3h8BelzO!ACf|OJwp;6kg2Bich0T^
ziD3`~eyI`<`2WY+naHlSNyU6%XCVX>5JpXHLDh+r8AdNM%Nvmnc3vE)J_CZ8*I7-q
z@I8G5$^NQo=i6aHCZLL78O|OnF322M$um}dUa<t<LL_*pb(51eSh-(az1Gtq!$5hW
zl;IBY(21~~cRZbSRFnVz{-wK_NFzuMX%TP&BUN%tHoCh(VA2Q(NJ>pYV#Jh<ZlsY$
zBxIA4kW^rRln8>~y+7x7et+()?(N+7xnIxMbzP4O%Mf82<DC5Q$LO8~*eGy&zx<_p
znLeCYPr5nIB=Jzu&CS|%#;Uh5Sfw#QnSmrHpnLjtT?3uiOGry!ZL1IVXezTr;w9%6
z>g!Vzd}TiG>R<OgjousCf5ZE7dT#wVv?qBTMgr=QseDLxjy{vL{-9^7ZmZGnt}E*%
zbhwUc4_W1HSH!w&Mp(}70@yv})v-6XUeHa@>?UG&C?+&JdlZ>eO2dxkDI|2L7ww$y
zAyR1cQ<z^^NIy2#YkXm?`M%~0WA-=ArJp+n3m=4K>0=;)daV2}uY9Wt4V9Yib3VDu
zk)}Kqe3|Sg3?wSxqz4}Ot*#`ta2=>t=q`4gx25p`jp?uZEUcn8b^_lwrSAW#BN|bm
zk|k_q2AxK&Qy+z0GVgrhG7QmmzjreUkrbvhGw_q;y&_L%0xdMA)=DwFne>YU@oorA
zOSGe@9>+{-a@d>mmzvDhN>%$+GhLaQsF(}runpeIqj-R+-53)rVgLMU)~L3cxj!&F
zsa@e+h;Tc*+3k4Fhk0p?tHwKTS+wbAew$ZLKeD22zu6om6u3&l84kB3EkQ``2n$5L
zfV!AndBlj2oRL;>i3D$x7g8cWA1{C0E07h_nGG77A+J+3oKhJ$PENL8Y9A>t^a@k^
z;5cN#?)Ex#vZ6XQX=U6d)w6nex@elV33M60w-9grwVx}e)GZEwyP>1#mZ3)WXN!p3
z#%1Qyv2PERI%4h+TYJug(ShYe^>kmIRkBo4(TMZM9kipSf92Y%8XnwrzLT7n^d<n<
zjNSJ%Hl%Z_;{7>)Whi&csPdLtS(4n_njvcT0FWG6s&}xm40&8ed~mZVfV;d|fix%u
z(#ceu40~I<L(ZT%Z>3~v6T#FXKTpZ#=G(CTNV`|ek<~x@QTVEeUHe*Q#zHQD)SoqE
z)x^B?Jx&?-Pfs4QqaBd>%pOKIV+7sO7OHX>(EFn^dBlL<GQT|<Sf7v;A}N9M{w9Df
zpbcA!;0*-{T2NwxZ6vcwG6_45NOs1{@|H_8=aSsnY0urQ)pEbk;wGPysXoo(b(jj@
zMpe~$WP!CF<DdX_Cp3gM`_gtVuZceO3bo&!k4n4A)5}?Lm0TL&RJXhiy2|ShDfo3B
ze5rqk`*r7m<Hbp}iw3&lf_{72D1M&gO@dkaSCj{TcENrS|L&H=kEEXpUk9toKHu7O
z=#F#QNe!MjKY9_Pn#Y0SjNQBT;L6y|V(2Y7W2poqa<X<1{thvFWN_tq8b$ixN6)2G
zlJT9hDRD%g=;xZkR+3T@Lz_4^QsvQq)>ayJMO>)A7au%q+nZuoNj%QA8Ylry2`~VD
zbwqKxGc1Ef%`9#Mjg^Pkb&!lP!*mY%GDvnn*?!qk8`ezvK3*Je1_4b}No#E%M^S&+
zjJMXrGq&AZq&vK~p#cXggEN!@cA)*nvPazv;Hw+xx-rvq!FuId(R&n&ny&^yzCY$c
zl(3a*R)m46uL4EXmkG(y5~5aYnaQk0WD#u)&mdEt{urlhn`#+BCV-58rNUn0nV(g{
zR;uj&MZ><5b%@ZI1ZYhk+?C!5n!#Do;9M;S{e9)AD@ow+<V;^GL;}5(9IiX!6@d~i
z*uSom?QN%Mcfe8idRRw7*LilFSf6_hf~!2vcUH;u%LH%c)$nCUT02lIx(}TS$nx`G
z{Ott1M8CE$Ytz*3#P5yPS#C?V-#QT&>zihz=Xsk-#%Z!1?0}kM<g{W(MxV;6Qw9m`
zXjYOLpLNBII{o_uD5xtm!wLR#5%AhZ46}n7l{X%^2*f5452hMkUm`|)oX(`xcZM6f
zEvA7xBqRGpNQ7fj`_*lqZ;mJWZc74PUzz$vgtJB-rn^?H&Fcd#8h*K&BhIxvt(uu?
zv`#fAHy;tS%M|LDt}F4E9nup-oa6tv<3}^Eh}@P!EV1;Wc*)I$bBVMQrP0fjT^|$J
z>~XZ4IRFWIgQfYSys7p!*EBP;u?sxSF9sBaOq@N?T%xOEz`IcRn$t=(F`(%vFl<>n
zi!nQNnDDoC#DZ<D_=gg6&rxD!E=FLBQ0KGpFu%gRG^A<gn6rJQ@9=y~48gI0aJmU8
zxcF#ONJrZekoaktd0#w_SIk_?*r6lT>p+&>YnwGkWpdT}zWvNs3W~))(m9m9B3t{N
zw_&z(N&PLndAuzWPLPo17-7lrv~@R-49FSx-h`*cQY9J~wTMmpux>^V+Xi$d{`m+m
zOIa8?$hCO%<0+cSvj6*|OtCUm@uYd{KAwZv*X|#LM(){&PmhOtBtG9Z)~R;xY_$P(
z$OoXqzBNRupGJ9WvwyB<I{Lc(w2ui#q%XXoyiKj~T@vlSaIJXXVDz;DK*?97kSXmY
zhY!^Y@VtbQBf*57;-~e~Hl_<yesfm!+~ef*Ep(E3aV_1CQe8oeq6YrfEKA83BxdG<
zA*0Clt8aSX!w#>C+edq!?w%hJ-g#<ZTxX@mccY+Pix<qMyNxku@+F8j1x-0=^Aa$h
z$spQGoXPab(}jA81$K^zdscg8_oHzYrwspe71Z=#qFXBM<zKQ9^X;rmRbAG~sDVaN
zoyNPoI62bhZ(x529S}*FrzzKQuk4A&CSpxmTm{ne2NsUUv)66Zsc;vXVcF0k$^%$B
zc7~hcZMY4Fy1aBX@r;E+UYP(z<fm~JwMC8c24P!doxJZ_WMDNwIcU4$n)d4tw6GUg
zA;=$E{NKI_Ko<19Q?cW#a=ygv4%ghxVVb68@rX}ICZhlKB{3B_E%7AX?jTB*cd^sC
zNq34YP?RQ}@_w-q1ZWzw`+8n&5Gdhx3^vgB=v3nyid@i@wbj8A03HxO23>s*u*%Ke
zD7lUtX&2jUT>#JZHZ7xfppb`jEXNX@{pAw{Ip$I_@C@h4z-LYo{Ew)X?ZADP?eELm
z*R&#d6x*Ke)O$u@PO)%M2+Q~?yU9UfE{O;%l_L_)ykfZgLVLNF#Fpug3q%GJTMhi4
z(C&MuJm!f)hAU3uPv*QmG<6n{{Cjw}ZE@R$N#yk0Yx3Ls&&=BUdCAT)nCeW(Mz*T#
zvZ5#w5k@u^y=LQZT+H!QqwtKiEM_q&=E@p4(-$rM>(30B_+qTflNM+=(%26a{SlsG
zGzzB3S^$!@4+A=@z<~JIbUO$^e0Xbrd1eJXWr5DKg%qZCP`PXnwf#Y}I{+ayLfm>`
z?qVf<J4qCvL>!mj-RCW_vU}wA2GA1ep^b(}@)JN}_0};};1waNDx=B?M}PnORUSsf
zvfznrmgpTixs-$OW;cucl?fM|*~yx%s~jfJ!_4I5wap)2V>t|ep-$uc<TFVYu{l-6
zyEY{2eE#9K4E2Rl;ZSMy%Cs<^P7U}&#>^)M1~GS&bT7gIyg}~?US)58={rH|$DZXZ
zy5`nx=oMcOZ6Q@G74<JPYHxWplQ=)|;@~77yd2}TKcb^p1aY`d@X2~-NlN~Kd_l|^
zw%Wpv#_w0f5bj!eE{Kj&=SzyYgV^X!OeMD@nj%&an>QRFZkN5-zMywtKRT==>ZE&z
zrQ(`M%+annC~JqT?^k|$(^flDeiNPva1YCnW9J`xk-rjKOL(J}ZB6rx>^A)+wC}|n
zaoT7a{PMEg@$U;aFKrt{DpPCH0pXQnx+3PKg_>g@!}jpFA7UovSu;0>WZu{(fl3Sd
z&E20#wq2cmcsZ+(?xnwntfuA_>NN{LR~wp~+}<ykFWD4_YLFoM@DGE8D_bgO;ZF!}
zE4@GQn;4nFR&dvX({JjqZ?X{P$hgvlRI9veb>(1^!CDierRQWIl6&rqM)Y_$qyr?n
ztY0EceYxCX@aHOJGXs|f!-J8H-t?Lxdeigb%09_huu_YU`sd#X^sOH_yNSnQaLaX*
zY-cm~L7`*wr2&?QyonkpOj*NsMUP}5dkal%j{g>r9W-TFK_O6s`~B>@0Dj`N(z?{G
zbti7RM?EJFCZOajo%O~-hEBCbux5q7M$phIWmi0D5Z-8kWTHjApjuL=IY5v-dv~V1
z{?FybFCw>AfVe^ipXgIkg#AlakT>AN-D3%RAw%bL*!XJloz2TDtJ~{#{x+xNz$TOL
z^yU>BZ|XAhvPdL}EZ?DQAfXTXu0<A3^(HmEm;q$r5jb^>tU+N-O}MGVo2zp@glYvj
zAKrH5!O89=SVq0P;#eeHFu6cZFIlXDm|Kb&Zqj)_*Q;=SoU5S+(0!<>603MxT=|AV
zQek{z+vlTrzV3*X?p4)vPoyg>=Tg36BR}0ejkP8&`=$6?&Hd7a`nsD08mdvk77eG(
zbo2O5cs^J!wcev#)jAQ$A|a+55U(wF5@xdV+QGbV8_{Iq5CpN~1z2GHOk1d3N0y^8
zliTV|Ci;Y8WzO)Syw?J)(81R4)z=A0L7?h2b@Yz#&mdyo5Dq<IY<A3o13axOgx`56
zRQ?d}a5h&>g#L2ciT_U%slGixG#*vH`}@-(;*O0SA2W|z{0ND5O8@{~ZgEr->|p2k
zNUzz<@KS6}K{Y2>qQf^NseQ`{NVHe^eDU`Z)D~K#>OCg!5F!7}!J|cd<&V3S?3EmD
zwAw2^9F+xek^vA!p7QbwgukE2UI`lB65ZZ$u8UWeJ}E)x53f2%a;=z7+Wkp*;)dC}
zx@HVAd*F?1u(n@`45;e@xp_O@(_oTu;pvQe?uQ4qskoF)!cUQAac?euk{6;S0w9+Z
zSkIF{1|Vgmp4Ee^%kOv9k$Q8J<8`cvCY&*k&E2u0C$qgepSd45;g}%R7}#zIua;ii
z1>?Tee}Ae3vmDcqP985Lq~#ch&)r=&lHC)*KNEpx5F*zkmY-GZRw|zo+kZ>ic>LPB
zw(JjfoPJ#7rulf_J#2n-Jjhd0=di6-2k`KW9}W}QXtG2c-H9&4Z4shUVgNewt70sV
ziX_zK3baLsx1=vK>!0fu)9@X-SDfh|)=3-qg^9H7NW3#MwWaSaOr-a>d^{hKq(CdJ
z_|<Pwn=wg$DD5X7DhB;T%wH1k@?|pB;D=)%lxCP*QC9MF!juhLZKf>}@ZgEmKb9&r
za&0g2lp<6pecT&e&a~RCtSWFbw^$&LG>II9*ga}CzE^HYBePazWW%>ujex7Y13~o9
z$l2>7vRo^lK`sFvs^%YXzhLnK7C;Eq3p-mbtP=`KZlH%>+tvoz7VLL>$Yxg~(0wrO
z)Z0ao1BKr;OtA}oVv<{D@1#X<J)&%fHtzs-vgPRw&OJIVJeU^~6sOBkW`sz_`Ka>q
zyP1cyBO>q6%Uyl7jU3AYl@W6Xygj#yXu`_&{hh#iDr|SI4jGpf|Kpv3|LZ^(e)V4h
z5ITQ)ddFFJd?nnN{!EG1AnVZMD^wz?K=IXudeykx-Vgfeg<FUuQy2kQ6JHjQ-0<1L
zqpPV>OnS_1J6rsSP#wt>Heqtt24aI`d&=-M8guqm{MX`W<Tz(s^((G=U&{O3#dhb&
zAm2c=ht6%<wP?4%o|Q9ZNtCsgr?@$J;z~7kVTN6l(<1v%!LA!=|1~$U21iC-8bl^X
z5>b5ro(Cq`;2p=WTGqGp%_axO2Y(ec=WUFRfb}t`h@$j=9IM{Dp9ZlJ`Cn+`%LAXj
zQyNuLkPfue;K)+3#f_N_&=z83866ZnF%qwIQl70MrKf6kzpyM|&~UBc8=9!m(|g3*
za5L^fBDk>9`FVYre0{!Kt-kliO1-(O7BzNRYJ46)dmRIlEprohScgA<wwTTkd$Y+q
z{`;G?fqGXT9U}bxKLfc5)%Gv7d1hMEk?`v3lhOWRn+AEJqS&0zy=1x-LP1srm>n=N
zdN@g4-ahX!Svjp2M4^U0>Iwj>7we(1BI_D2X0xJBn^oBBmv-o3SW`7YNL?YB3)ZT0
za3q(o$YbtYB9Pe4D_$Yb`M_-mU|-QNqU3m_-RafFFY@^WDjR0H%hb5&@ZAcGX0uU<
zp|3B@BD2aMGKMVDY&>!V>aF%YWgIFqBPD{{{C=P{re{49U+mHDi(3>BI7%i}9v@*z
zD4gGnRj_mRANc-hfy5H>ozLv3A_Au***i=E8tG_v5@Ui|U{L8Pe7FN5w$xF17k?e=
z(Nhw7^jc$D&-!?0Aa)!r<%R#=4^>`dgK#oIQH%Vmlc&i9!+6cc;{;onYgixrRKP$c
z2Ya-!r=N0*R$X8rlOuB_%28QoMPw)?pAx}r3TD1*%lBR;^nDd~J6p4fd|JR8{_G5M
zejZVu11Gl|(qgC62jHc;(yoMAK(fvnVr3Qf+UcP~dKm%&*|mF1)AP=?T}liS!OJfD
zeb!A$Zg{<dqRi_ta)>v@#lN(YL2S;jdnvfm<%yHo(`*ZD#vLjwVe@`=s)ujGor%pe
z(p{(MG?SlNz~aY)-Wu|i2$YYIwpy^WC|##cbE|V<<rQsKY}UUu;(0U5$R|}d3+30*
zd86(jI@{`lc$_mA`CTN`tkTw}wH&ze{ZT_kY3-+8*0IRSD-%<In3TWn)N~2tt2`BJ
z1ZF5*YY!Ho_jkXd@bS<l)f2`6A`r3yZ6R4^!f;P<io%4^egg?m-BewJF>W{o^Iqvp
zvsrK2=v7Y?2%2)^0;q_ELjNz%%N~194Ea2m8ESRUgm?BbGRLgOgrh9L>Ydhw8%VhV
zmXsIrbF0vvzd#kSxh+T}?C>r!xZqXH0OBmJj_-lHN?_sS`YkK$3~#l;3@kO7rQ%Eg
zX;>hPxj3ccLxIkcHHZ~_a8k_F`=sS9$WM>TkC&#&ExJa_hT63xqc7xp(GNNspC3u=
zFCK@}F0Mi&>TWD^I#uebZ8hq>IYjt)8j*bPmT-~o@oqj}??soQyn-sY;C0qyM~eeO
zEl&qNC-Bls;XedwV99WdQ=B+MugNJ_sh$Q3ib1qXoT?PnJ$<fdL0@SeHeCUv*W`Am
zSL>y6g;a8vbgs1(me`uv0>J1j+YHHO=*Har%9wI9J*lRy-caagUqO|i6e-MI=9n8-
zYEl;PV%Vk2_l~xQQ4;u64SMzTaBv>^-y)}1dXNlBTrJLs?0t3Ok>Q^+r-lLP9+p7#
z;%cQLFRQBF<jcq;Kyonl74*gr_^9T%(|D(s4z|Q9(6lx!gElSN=5PI;Yw3yOS~c%!
z-=0e6728>qK%rb$3rb%_6MR<LO`Q_}r-VN~t0xp>RYOar0QAr&oQ#BZ;{rY93EDw^
zct96{`tsnGNGlcUh)nnOUq;#ooVy=w$Te?ZRln5?cdQ7w{4MH8VQs)>0hadvQB*u!
zq<R(~oy?c@>)s9gY*nPy9^XlTF%C)sYpfO~`s)sE!$+J>`aH&*!o|MN*LcEjw^~Xz
z2R$}oLt9m$vBhB8BSaSU{S;|8Vue=10iqJ!^0LdkOQvRlk^LB9#g?QQFUQ(LQHFX0
zG)teKr>moKo?f2TBFotBiDs!dn7#N9Fhmqj=)1mfx#<$clP7E;E>{aiZ7-1I78HBA
z{4|E=N3>}xG!y4z#!Hjrt`?Wgv{KD^W;guV@)>%L&xG1=(qd`EZk`c9j{#p#RN2K1
za+64zjNt>)!Fh8&aU^;3;-eJ6EB@?v6{P5;NVO6~*-?~dGXO9~qWOgHYt*pAA(GC)
z(hu`hv&e~8_Xj!=J4XAZwe0Hf+?Mwfy|2`erypjy4P|+4+Q)SE4b<L;e&9Q+e6S#|
zB_ArK;pT^#pgYo3Os`<jGnVZjm)tFN&Z(e<Tyf&(gLu2Bf>b?&^7Og_p7C0nshil(
z-LbJZ2$0mti7O&`z2a>9i(R;Erp(UaTZ~@eplU_>XUVz@0V@wHZY;dGsdVp80-Mzi
zxzdd~8fKcUVtFg<y7W$AQHcb$6W)hL$X`h4+uhRUiM&}_>igU$iC9pRe$bf}trs-z
z;_nj@fS@F@^=0V)Ld7V@|EYcD8v`21InG!bamiq1?ZmYwB>8@W;mc5i9K&13y4#!n
z$#zJoQ$~gH3r2P?+Z@9cit|6~8y}@wgtP}>%kC-$86+*oXq|d%NS^VN9E)x5n70rd
zp*`A5cO-x+>6_1jNSbB$*r9H_iT<nt)<7(56&AG$v%>zAMBZ5sJov!|yUDFOJ1?K#
z_O0SamibLVgTlO#`)UyXn}yeq$aK#9(4;k9S8V2YbrLdK-nEDOfpUSELdW3Z1%EDk
z;!e*8-pYi4s)zg%Ae-5`-z8bI?i6egfQ|o?$T9jPm_rPL;j)KaArRwOSXelr&o7-}
zKLq(UT4e^vXZ|L$WuTtAOHMZtyyBIS2Jo`=NSl<VeLP?;o-~nQTtB`3Ei)Q8jHFkS
zn7c1xW-<!F2JwBZA5?n%-y(eV!T)+&)#6Axh$+bGo=MBrBqxqKR$cK_?`Jg45l@T<
z$KY`1StGxo*c~VG!SQH|CzRoszI)bxI%$(De{0Sba`xCW!_G2F75sli_oD^>@rm;`
zOna?}z+qs_iN6yIP%gsxg<gdC$mVw4?7$#ZnzRBFpKJN8WrNQMTh0OW8pY%KH!O7A
zFZG1sjvNIwqGVPcy`V>UUx=alwIeK{Tsi0vL>AN$pG1F3kJlVjhSOf|P>v$jll!Z}
z;(_|kpl)2@YyKDAJxa@yzR%lm--7)&j&<>8s@e>jy@f^U3$J-3ASZ+;>W0^yQ>U<6
zSisX3{+{n>Fa9Lh%4jco-{S0w7<KE#&oPbrhhtt@Qf|`=O|yrnJ^uC!E#ei-7rEUx
zcs5zx0vS6~(u~_!c?t<(y!>Zz-{zfr#YKZUy5h5@iV}$9&P(-MuWUva;-)Tb^&f3Y
z8t#&J-pDG~%dh+MsvBnv>~#Cak@h9d_aGw$;Ki0~F_2<Aer@czv?rKJ6C((ZP+XvW
zm$o476;vQKksX7wM#v2T)M`6>_5Cn?$A)c5$kTB7=gd+7OgL4Lv>r72%wh6|=ZCC;
z&ErLi9Il5`4ASX7wV&RP(MbU)1}}1<ZWnKjnWYpe<{9&O<4ZB&7p)I+fH%K)-8mnI
zpP+Sop)E1^pa@CnFt!NH0neJjPPByb&B8i>TP-hP@Ra_u%VY$|3g|0W95t!9fP7s7
z--gn8zg5UbFPN5-5^$|EBP|ROHh=cq0A;*Z%GL{GW5&aO*6QAf#Sh$R1;|G}!U(Vj
zS}J>7dRKCN?pEoUI6=oqMD=M~;;&LFld3!I`~|Dx^ccRN4=({6kNy-021%XL7+=R4
zuH_5meUmpaWwbkU4D&-!wlESaxvVkn)&YAxb2(g>89JYboub*4UfJ#UPF)crgv4fS
zg_Ba*%-YXDNP7!5Aw}yCVvI6}XvZ}NRLAH6)ItY?MuluQ)k52FLMFq&BbaK-JUwF6
z?NQnMP5p1{&33T8bK#nTQfhqHv-sBfb&kq?&5T83mj(5_Cx0?tt1E0lQw^xeH33O(
z#S!r&byS*_;GZjv3qVL@d}xp6JIjWo4<>Q?Ijvk2ISbEjqWaL+FTU8E?3>?XqTGUd
zpQZPpsz?<AIuhQA`JC)EKn!;j+Dz69+txWYxVooyV~K}vy5CNP_lJ=8OH*;6_7?g`
z{&Ah5A?*mixmGV^G4CGYxay&aeWSP7S)^Fa4LT%!04BmCiL#gRv<l2Z@Zss03-thq
zJxDilOB4Sv|MJU|V%@FRO#vznw_e&G>VjpBf7@1F8AnZQK4u`0CZQinnaSOOT<H?!
zt=h$^v3=(#GB+v@tLBRr*ATqFk>78|P+-++?n4?WIXEiw5jn^P`*2KQKqM^5#l@$X
z(+2Aotlg{s-C`@kxL*&M@D4l2V_E;|lVY{pZ|KVGsUs28mZ&5c@co6hqZAUGBEIK;
z-D5F@C4&WPt=m&q-^9u})s9Sj+>j-vMzCvx_Vl{-^-q?UWjk?feOwm2Ao8HN3*0Qk
zn{&)4vh_Tv2#e*0jH9tRiSWRrqc?Hii8JwnR%MZ<0=0*R-yS&R8TgcF_qLG;YVgp5
zR6)A{hyW@M>NJ|ZUvKw@O{<9tZ>P!hRl3n{Q|%b312C5ju)#Ehx&(McPY0>iM-{PE
zcZ0i#8G52TN6gS;==X?QI)rf_l>!ec0xA8PQR2Uh852~O-I$EC{5!^`9OMLt3yrx7
z>?Zt}xMm_>P(;Xd9&y%!FO@&KBeU4!n8l>)LlYYd&2H!C--~;OirW~n@84~^9{Uv8
zCBm5UPj%awl;B4s`8~qf++}V$772N7pk?6FD{%o0d%7r5`$LbASqgdd$U0Df*rr^a
z{c#|6^6lVsj;OXDCU>X&sI;ML<1=G-9B{nm=->y%9F<5Q$ZBVX^hwKbr(l+Pm(WRR
z!wa`-<$kp8-@`8pLPgA+xstnn7*==hu%EE7$1N0E##5X9k9ee-CGRp<=hK36nLY-z
znfyAc;{qlNd{tRd7s^uKz<iVj*C*EXqiIW;W43Z>JLZ>gi4xQOmC-C4j5!xK;)Oi=
zZSeozd6+hge4uINUJ%-AtY>Yzi21HLKmVVAOw21+Cm}CwtFqwT&F-Mg*3OqC4M`cr
zDn<LGWT!+ennfswR?9Lq@ZUW(I^$;;z8<};xcPWLv6Pq5B2A5yRH?W90`7>7q+0FR
z4IMzlIoR_Orm8DKZwlL<ZW_82v&ucgFs@fWn#P?hSmGkH60LT^397cB4wb%opE0yf
z;69JqyQ!SoP*Qp(`n#@Vk78Bd5kmCuKEr&`ZQG&6h*!TvOq6;+-;v#u&H8ph2xIt?
zDP1k+Bbw9hL9tNs=W!zNUyq%w4_=P)D}QN|-vUKzmfooj&%HGPmCi)WdmUSB0$g)1
zsG6>nhU|my_VZDOR|rJB3SGRmR5QM!-If7IBIk&jn$V`z{>h;ojTjSGp|oxp;~5!9
zR}so-zq?Is!-{+c`d}ixSDKRTq&eXZJCBLHj^Vc;L}=S$H51p2CuKM;Eh{4)qowiu
zF%@el#&jAobr9RQRT<JA5uAzeR%ZSvaH#9C8T2o?+T3}l&A{TDS`W2=I~`fSs&TbK
z5h1DV<Mi{6AEH{{y@p53_LhI)&vgf_JnVdf>u92B4su;B>!h2@kjkRq;YC_<GoY5W
zOJR3IOmr_aR+;ggvK`8Reww-tXDL%&3->DZe>*~zh!%WH?ZWmWYks)uDAR1m`Kw~h
zOG+OA+2+s6bqN~^vU-zyq!e(@o7(2X1oH;!)1<|&GJw>@0>4(1kSxuHQXh}&NANfr
zp@oT^aW9RwT@zj4q}OhZT{mTyh{%ea;HphbEPX1o&`47f?LYm5U1sY}4!CLY45vGb
zhBd8q@CKX&dvP$}-otaGw)t^MVqq6M)bTmpM`??{T<oqqNZ&rb8)TWOeMsQP4M3TU
z&x+x+cNH>a-g}$x9>=YI%0<}_0p#@_!$?ZGn)Xs6i#-|;OAND^3Tg@L^_W#>CPO3c
zSg-c*pp(9_?2AQ$zaMyQQzbiA)n%&BVAJ3hF$hGO^aZVSv!|eNmbQ;W1#R>KXYDHU
zXBdhMzf8f{88)|RZ6_{yr*4weH|utc;D(c*rsBF#S_X%~8hARz!;fU6b9@Q3C_Y(X
zjk=1tzZaC+V3NzV`_k}d8&}n6XxMvfPAHq08fj11p<eb`^h>tq7~1>8B-W)ncl~1V
zN+_Rbh6wz<P><F;s>+Ynb2Ke?)4Y>-7f(#^uI#R#Y^_E5xsZ|oontc!iu|0Uzku+9
z0<Ya=Sx!GGSfC9<Z(=5O5<i4X#&PlSFVy`ArnRuT#WP~7$il@a%ErSm1$$3a{?PT^
ztFILgOcgTCI8T3N3|RDZ;`Df%nVmL`^==3U!2XrhWljfR!Xn~<(e|d&&0`5ojh66R
zl+lM0gMV*y|4aU<^tp8#2XyZ`_Ml1^iC$us%8H-ldXK%#Fj{RLMUVAW?}tRhhTd@)
z#Ols1z7A3NfU|Jnyl$#J;5`}9rv9qbN|hieJ&T$e)w&IDDhtW*rWrefH0=D@MNlSr
zF;P}L@KSoZDRj_kDYVFKq3}L$RBtTfw|4as6H2U~pr3?r1_>?POMS_HS|BUCtjBBI
z6CXi>bwHvjIs;2U2gzLWkxbAN+c^%@MGo@zz2A-$9z06HEMuw(S9i0&o_z#9nDb{p
z3(xrZWfbL_o3rBUVSe{;;_Jb|<tpmeE@Vzw%`Fxfl$4;@YQx?2Af1jeNl#%2lDyCK
zApMVKzlaoG0Gpl>NHY#cE%0G)wt7OY8ey)yJO>cBmVXwT%Iu<f6KZp(-=`ct^C#AQ
z4+}bZ$6x#Q$7SDqv#>gSOq~SY6h(wRJZKaSTzWu6j3G<h$!SZu;XiMQT(I@OEa0{;
z{jeZ0E8xX&;b!#BgS-M^58WU{`qwyA_Uh~8fq_}xYFA;=h+q-TiUpep^=xHaYNfE)
zG2#96^0DEf=nUh7yp|jIEvulV4vy4+BH-pqCQ$Zst2|#Lo=EAtnR=UuvAFVAu7CON
z%e|RVw+<QASO+uh`);3bwq}4M1{C&ldqXixH>ZGEZbyyJ*XR@kY7j%}&e3TMal#dU
z>nNF|c$jSb2QrTA0Ez=1OVQYX8q~wbR_pPkRXGbJ3+EKiKYSFM_MyY?Q&9{&7Xx48
zYEFmnX$#dk`A<t18Y>HX-uznPVTKD3YKAIn{-O*0Wx5}7eAVl^5!tp7r`trkPG_U)
zfJ8WVEhQOVVbUO_bPN=dLZ&$pdA03c$jYv?np(}~JQxw9d}EZ@d{=6kL{mx>90>bO
z2L}&+5|LQ^f5Vw$Ge8yH7N<s~!j<7@YdEZ=O|*Y~PQD53JpGVT)I*UX4L6aN#iV+e
zxFAhBOfGD_dAZt=gQe)sr$42j^mzZmYv?UmfymwBlGW%1BV6RdbI7b~Mb6ij60g%$
zY3Y?<8AwM4=dHS12`!1?!!)+;Ia-xgsod6GmEA5EP8n2;|IjUr**=UvmR^TjM9=7X
z8~SXUr%ZJ;|M8kvmu^;W0wGgapIuw_DU~Avoil$_fD09y_@|bCyYug$uj`YRl&eUc
zi$8>ZsrlATf;VMq*HHp|&>&dNz0&l^p;D~klE5`Fn_`{rS7{J%r3N2V*kid_wFy~w
zA0V~M>U!UOQ>89Qqe3paGR7?^htz{RbesO2K>5q9jc<MwpzrwN7QJ>QEn?)|Alu}4
z{RhdRD>nH~f?pO~s_+_8i;jmpcp|r$h}@*3D_@An?csVp1xJlJQE`9lW|yew+RA|S
z__iX==0|q?{N4oOb!5}=Kz0z-H(8cR!WBntVsP|6n%2v_FFc-4BG7z5fipllhzSYl
zS*x5eHT!dN$6GAUzk>97+Sk9b^Fxkq#cPfTGrLOv+k=NTK-JQpH-em;C2Qn!!!S-k
z{Inje@v;3Bg7O1h{37>hKq*1|4bLU_Ou|Sd`t(H`l4@z}eK^2BCB>G84hreg0$#(+
zqjlAuLrhT{ca5|6Im~~)gmn)Cqh^sMUURyCx02mCOBycxC-Mr(IPPFgKo=KWyQM#>
zQ!mpQY_NB(a*&nQ{C@pxj@lJUt^ImSnq6#1Sxxd|>H?I}KadD_@w01=nSo9F@%xag
zV^7k@?UH0Eu`P7>h{N>d#)Ql|dz|$c;7)Zw*00UEFQvADOuBxM5k!~2%xjphCskZa
zE0>8aD0to!0hwjoAEGr-xy|V?{&1)Cj|6@dYBX7i$p1^J-DT~zd31kC))Cb~x@m3y
z{&*s%@)G{DJ`Mj478(hf;~pz#WBJ3H9S*t$DK!7Y#eRz5m_$yR`DbO2vRm8Z(xXGK
zN|n+NdgSojVtgV2d*DCwX@YMf*yTgwca2}HdF2dqjk&1)^_f63QqD^m?lUOV0srau
zqG^S{?r;7`Xh4h~vCzlr0SHkKsB^d=kG#Ul8mwuE!{a|xyx?N=nK{i^qjfm{(I-_4
za^a6fD^3N(>vy>x`f+*J3QL@}tUvWtZRSpI<Vj@Z2Vh$152m;)iLnY2)|Ud*f1&D>
z#Hz~YGoxQ%BInV()*Man5+;h~GD>UVaMHRNRaN<3Jz*l;MWQF<sPH!{sw+k!a?^u|
zVS;jNs?~fIuUSPG1;$ZjB2`XPpSuQQP*-%$Q39hYhm_qv2Jzjbv@{`lsU96Qc4UPw
zfDsjr7Bm%CjDwrBfK0JYlLk`TV~L8Zme(I9%3~ri$emC3S!j5y`5Yk3vEpJCg@^AS
zs}%ft91`xXi^K1;4wj5?@$>jAzg&x4y)(Fa1^rCH94N0=ZHLl+*Q*y-a}9^cH)#@N
zup|89{rvR)!mTu=H!FP*Cdmen+Sca_NYn{|H#+A+rmy_g&KIU_%1Oy%rjoA^7i#rs
z&7HSwny24v_C@msh#Zze%a(Wn>bUppK$_#?xt}Gf7Ey?)<xq$3X>Wbh3Cqh7hvTni
zEPmdoyjtWBH<5Ei*A*42ID~nT6j1m`Sj=CNnri>KY+GHg6aq?mN?t(!?GEStl$CA6
z)x+<r4G?$34@&8)c9JUU&W<cc1F0c1e>oLm^{QtJOV{b1$A5?AP0@NPPB>YZjIg9z
zN+r$tXi<8u+?*?({{RK=+%GO<kZSf@woz(-&U(cTA2>7gQjEaS=l7_&eXN!#N<zH*
z7Mw*f_Z_Oo&;cyA%aLP-nF|OBA20jG>ha#{Ph4n%6RdIj^t6Y63;H(f2_%<5xY;G%
zg-_KD=p}i~F;6em>~oIN2>8Yt;X|CGevkO|*|Z`@1nddMw?ByvN9*yrHHRhNn+`BO
zO2*$_ecc%FKQ6-$Bo~VyQQ3?7MQEB~6ydNlxvAyXS6iJFe)(5WiAM+N>xAE7F?9S2
z<)5aqb0a0oD-ETdeUY;u5cocecCoyViyjB<AogZoD_!9z*TY~`_*G3@5nVi)G%SAR
z7FX~ySfi=gRG4U&wIu+LmXbMaDkuBbcpN00WPw#j)Je%um!2xfdSa+z*SgdNIfwmr
zLNH`DSeD4#k4!_Vs+aybr7zETn|x=rPXCqWe_j~K7yI{hwP=x$Pr3fjoOdn9G|pGF
z(nXhX>QI@Zh6WFH$KJR#!3R>#n@4yVxhS-M0i6c8L-d+^{oF{`-TZLg!<5Y?v44G{
zzu)t&J0qN&Gq{+b|H4N6ZfbGff3+LCmLHm1^(v<0P5`6(6f>+t6%RGw%2uW;Jq^Gd
z>moT)&;8+arQpjuS*pFE{eIM*9Q*1Xm?3HS)0g^|DLEA&=k1vO|7oV)>KwnXIXts=
z-nuO5bl&(bFYq8q!g!XqbnArB=e9Wjs)fIv2fKC*M4fO}uR;@1via}G?nsXD5o_~y
zU?PRzq5ffto-2e?8p0klFC$YOWQAoC*=JKX^i<x}(`Ig>+WS&@JITn~L!+`6oObtC
z!+Re654=ssPE|ZsA2`2hiSL%67^LuTY2_Ho2`FAE{QM!%f8(s(g@nrr>$x42sZ=sx
z&P|=O^PquxbG2EBw#gJ`tesxe$6Bf*`qWNe>V0&eB!<SAjIenNU0abQ%QbSk;+py#
zV}mgjr7+L3WbG2O!UljA6!JyFADMJ?bnPDD#}Hc9jnS~S1(v}M9Dg;CLKzVbU@9EX
z1&EM6)uxmJv_5Y<TT*SqW%YHc9MgY$uZ>KgUdUDwCkv9eD;BXnQp&TF{%^KY(bd#}
zOr4t4(xNBsXHR_xaavfq^@}T4=2g-WOVZZ~KH`mY@in(774;Y$c21%>Hohd#;IQKc
z;iX+GLj0yRt5KLEFy~zaA=Bb6tN|?=G$o2_KDaDNK{L+2^fP1a$gnGpLZ_fZQ)#4D
zCLS)58Qlo-q~hK>hrGQc$4-!gs*7uC*kV$lzrqqEwVpi?4DO*$lgKqhy`=dYIWiLE
z@xEE_t#vc^4wPWawo^pU#0jqw>aZqM^UhiT?bjTB=xSSlw0#J&V!xfjLB~{b>*Qk(
z^YW`sZJW2Do2^6`YDHtsbwWd9SF~c<7gsw4sx$dyWDrJ(-IvG3MQ}A)?v2G9`8$8J
zFD2GL7qo~ypTH{gj`k0AOs|<o{mB8AkHPg=XHQyM=8c6uVX)CmnL@L!SdwlC`t}Ll
z{qqpBfEgcz|H}jgO*At(%2fAe6!9|uEb{tU%T#+Wx7J^hk6!d4ROoD=@CWqwWp~wH
zuCgDDUe^fI%NJ5*W3!xIAdgxOvcJ=}7VhF@lKE4jvG3tmmj<RGWJsT4gOg|=sN%%j
zv;)ebXW(Q$=WA}PR=D2P6?Ru){ySP}6iI$9oNa@8S*sF4g_Jx!Ii!;IJlyQ#wj?&f
z!}vP0KZ~Yrgli{Mg#My8YBXt{rNAttux@^R9x!}BJ9dT;^e=@AX}diQ8{;T>g}%6f
zVFtxt{M}=o6sR{rv!z;OzGw1d5Jrs^dx*ZlYJ6cYY;0)7r}2sxnqe0vb4UQF;TQ20
z4=W?Gqm-UgPL5ltBRMxc_^0r3Lc~lbU|!?b+y2+M35Gw1p5AH35%(#L1I%B+d%T9_
zAKyI<`W~oho;3q<bxkMw!iYdq<!mf*fh?almw<7@fK1h1P@AdV18~m$s$5o;kBTi%
z{KZr|tw*tACL#FZUCH6u8uW<(er_-B7{Q-@FEb~^%P6;t6516&iTGRdE_z-~p4LYN
zSN~_r_I7`}kvMh03lRI)cdK{VyG+9BV6?h9;69bZN^<sbl0|;&dnCfqF`G!+pTaH4
z_lIiTPIX;)YE5b(gC%b`#frD=)W|Luwe^b5TtX8GkDmRI$Rk=vcrom(AIoD*<kFeh
zMgH8$rtpPaJj{*3eu_X8HNj4ws2Ji6`5CuO*OSpHHaqK6wl0xVKhT26A6wci4>we9
zBbOzD^ZE7F@q9bw0x2sz*|UWG(!Zn?v!*l^TZCq7>tA7|H-l_!gP9I;8s)(;%;Y6M
zkPR|KaH*xMDW80E>J-KG52p0<R~%whOU)*}R^!#Wnm-@e{e4%8rj;)&*957HG!VT~
z?&o&zy@LJ7?ybhUVf+-{8(p~#FU%f*c7Nv4_vkHKzAYubJG2Fz1wIoZgB6zyQHq;u
zxvAA!F}!&GHSG<sLeDI$_S`OYYT2Ks+wK<wRNR8e+O)|8^-giipy@;Ny3z>GlZqoz
zxm;PCBt^5DCPR&q$X8!6vER_|9y%Bf?k3uDv#78|Hw`gWi9LF-v2Uvo>=nJa*bV_#
zi}hsd<hBvAGGAV<0)<WtTzs)Pr!X_pHJyR-dfYgq=!%shb+*`nZ|Hz>-12K&xq-i-
z+PkR;Bt5|m1O9w!ZQ5+uG7YVCj!31lAAWu;6vSKGmIFNTN=EZ{1V;kQ0rg9Gze%UD
zyy%AOv;X0`{%h2gC}F80UZ?Ui=Q8!x#dLercikFZMX|X`#heZHj$_|^D=KE`1Pj#{
z#D}UIFJ$HR+U8TI&8NLdT9j`5x@6Ogvs`P7mhh3DIMc|;sHQGO--k5N1O-yI__P8l
zaOmUv?9D3m(~qPhh(Vi~`DUC2ry=9?>@XYIgGS&4p);l=(s|r+(=}MzyVkeLwZvYt
z^OM6+?-yU2SJGoq)AdBi9wy15w9iP+xjm@}@?8<<4P%4+^X#a;75p#+pb)1*#s(><
zJ?CSe?TnZIVOWtyVBoxI>a3!@`!dyYXw~(3nj_KUQlxY*_fHq@dvE|-lZgVolN*dg
zH$mvNep?Q0_8SrZIe!t<6qFZOwtiP5&O$rm<sDXa;^!S4=9@@1M+0k^Ji>{BCy}Ws
zz}}T<jv|`7K%mjGD$aVkza$#a)qYy`WgoWt?Q|QA%+Dz+(TEqu>P0u6B6>uEF{B(|
zRNiIMxCjX*&_w3ba`*h0V+ZLVdIUrz2*q<?+T@+AqdknoKFOc^Gm1Z!1T=Eo&yvbl
z=?UqG>T3}M)bnm7|9C{fzkK~?)lBjf)~7AjSx8<u7w}W56D4pgrc30>#oJZ#l~1no
zq|^G=4j`i0hW(2UAX7wj>$bXR5z5iJL(2=lmpb#%CWE6(ss9@s2hG4Lb{5#C7kM*)
z{j=&bAugXE!Cf-n%c&{hpo3fBYfj5KUDNWT8kv6vb7(Pu?OAm|g=03>s_l(VXZ4fq
z-<3;Y0(32MzQ6nYZxesl)aPz2D&&%;?$^>j<aVPeDmY%gZ~O{)2Wc?m$^BXKufLSl
zr`s7v>wCIh0`cl|Qi>#>$q3iUg(lJJ5mJ71W=d$ORI-p5Iq9H7E#Y<1A0p&=v&fVX
zOzhQO0&L_#iy|-56|~M<{*U@hLOr$icK1E?#pr>1nQidqiY*ZCVR)@HS)A9f*6!mv
z;v9KJ1E<+nJ4y=QFs2-9upY8b_k?8meBx{B(qgvpV0PMl4tL)Ne%7lvV+`_eC81qN
zWATo$xpAbdoyerpY0~0CHP841kl!fwi|&TB0xOSMr47V57~?S9gZ%m-O55tT*mJSx
zYn_csYyco<?9S(?oKD4p*`Du*(808^-CGCo=MBbvdZ$jkfDPK>c#W2I5w3a=`29I0
zZ*8S&Fop@j8rm-pnL->xsVwn|S4kvmr^${s9>e;g%QAB>H6+_>oL14QDt&_L-8#Y>
zAZ_(UHuBBm%{}^bUP^U=P~oQku&$SdBAr3`6FEf0o-Q@%?ie6Rti51@rsD97)8dnT
zr?b7=+J*i(0Om3N)+~}|2KHy*HCfJ%@EBTsw>$UQbc88`RFKx!+2myYjc&IUezrAe
zZH9f&v=-s66l^T#R)v4eJMW-hXWfsF@<v=Z#e5jElW0K`>ZYIvj%Tk369%HLZYZ^%
z@=oK79VTvni9NQt$Miu@ywW?nG>Ex(zOG{#J#btrsEl3@ke#0wCe~)6e$@_aGpVI$
z3<#DTlWE3Ye83)~|NK7qcEMXQoC9nAMEMlrBsUUW-M8MhFnu{S%-zHI=b70LvHopd
zvCb=XnklzOdXAZHj3_;Vexza%T{n%eFBSGD9c%ifY7f`(3XH}hN*|?XE!Yp<1533R
zC!NOtZSOy3d2jhUkyW4#7r-|(Oj&#!|DPg>Q|4SRwEaoZm{R=%ELXiM2H)W)GKn?+
zL*h%i!|E<q<~(ioN{rcX=8qI<*)61s|2<uZ1{Ne$ExcWxS3&9<D!htd&=qZvtDof+
z15#D#Ram(;w1-U|wsAj;;CJ-vxp1Hs!Z}0Q$(+0NvY(2Ct~CVFEUDt~VbfcimooJ?
z;(QbIwBcNH1<ir#;UFPD;RN{#x#`s<s#*oHpRuN7bBq`ksnZ!@ld09=)=DPl!ccaD
z`D7tDZ(+Dt6|ab4imD^0^RFmLAuH^NXDQcstNg1c5$3Y%rjO$QB8OC$Wwy~D7g###
zL=8tr?`joL=K#5=#OQ1Wjm!sf^gjEYc(0H3QRqomZexnvr>eRf=tC*dWplO{Rpw?M
zw0<Q!8z$_xA1@O>!`yj9toq$2Jl#jMA?lvlGjN1-D8tv9zIZx=f$MeRS$T)tUf^69
z{JD*os51|G^m?;_V~$Em`y;c$?W`!&0!SOJNHi}o!96g20uLX6eTV;y9MdDaabN?}
zlmdyqWYt1RZlr}rTl+we?gqRDw&{d=!*xeq^A~S6rO(0h7EKHPOJy@ayGK1a#iA{w
z>Gyzw;_}3;$C5!e&<+gkfes@SuwqcfTJ~V(A_k3pz1_jL4!;$k&$!uH`UXq8_;x-`
z&Zg+9g1dgn^ustJ>UObYf*@I<RULMILM=_?8{?w&N5tY5SGKBVv!CxdJ?_sp_1j(z
z?Xeq+c}Zd`w2f<P1CLm^dfKj9Vm-Sx)_)IG7NuRwU;I|uCVl~sE3HY>Sa&W#g#IOg
zn<Q_mN|0*fZ>pv(5MoetYpste|ApKlcX!eO%3<}4FCEsrhG2kegTHo@QY;$J;B~;u
zpQ@tO{!>4QJAGQF&~%%*DB05|QR#3R>s1?8Mrvhh---)vUBv@Cmt%Rx1L9i#W4WIF
zBR!<;(Y@CIdnSEX;u6H>2K$eum8^R3#EUm$+dhd7E@Yn>0%<80uVgW5wE@Btq!8zq
z9zE{D;C=|siT=qeAKxz6v1HIJ^i;ehG8N@PrQjOo-}2OffC~3!G9!k|a{EJ(S`&68
zEoErdGaR7s4bj{Uu#I)^q0Y`0H=lb5TMYM(N`ZLa?T3WWhcybz4)!yu8uD!1+9#9<
z!jWv1ZL{0n!-9~-=u(whuR--xdtV=G>W)JF0s>d<&H;;6AY=k@FSOPcmPzOZ0$o9n
zJpFf7N)=i9@s#Y4drbyn|7b29s_Z~rX4-ED-fH4sz&6{~v+oU!-JA8_cf+i?VMK`~
z7V9$fq<zxL2-ekq{2en2<8T9s^<^sf;4??N9Bl*9G8yp`&U-mrp@kv-8yQfVDcecx
z+k8XM-${#+ev85?)-f@93ZZg3VZ*p(4A{H4q-u0XbW8Y#6&BOgUoTBL(z+BvHKT&*
zaOtOWR<gnx4}8!$g2i)SP1;Nxo3Ah>Y6J#p6Pr=A4PQu<E8y}u#7!VTZGz&0f;}rV
zmyQPOJ{-!9Y9o9-2MJl>JT5gh0mJ~2+OyP!NRNxVw2&{OJpbaL%M*a+Ff5Ui@~uSc
zX4!ZX>1!b=g>>pKJqsJX{1g>|O+K2Cw1=2#@DsAp_eKFHa+=8@@jPF^F4*`YdjKuW
zEYzH*W_0cSjqSK61KT$)vjBg2u>I(6n!}5T!5c(fy5mO91XeWXLEV=I2D%KYnTr=k
z%D6W5)Nfkr%(Ri$BD!h?)^z{HLOZ^I3zvw^vo<j%>-tmHC~^M6EZW;9Hg(X3HTGG*
zsYCvx--O7^=^OOGV(^lDW%-ltdaN{ASeV#Zk481O&#<0%a7Sk6PsUW_07PZcmn+zK
zR+Or0BOm=fw%ok8Rqt1xdYB~A)IR$uu#@fMo9M1L55P;;O$p73l45GDdK_pFd(HPd
zY_;lV=bJ)Yyzw0>RUkF)?jtX%+I>(ZY0+Z6J?emP7{W#?Ep{(hzHR{0-P#}3|8_R}
z?>K==(>~s#%oB-PgcK3{#7&dmYS-~-r8k>EE=g`Cdv}-DkI81=HA5P)I7tH7r9RqL
zNkCPjpTTldU5kX~81!XLZ0;5`JdS6mkQ3FE|3trMX<JZQh5pDr46`p5%m`%dYkyHH
z7ID7jRriq|FSkb~aZq#zcRP8*sOpQtd$)C0pPXAe{|f^AmrK#5NPPA$>r^yk(cOE%
z%8rV8bWE2$+a9@OGR>N8gldYhWNdk2^BLN71He{ET2aW})r8B7?U0y@j$t<sqf`*#
zaIm$StGhV8^GMHte2P9-UySps6Sw3k*%*a0H^dE-__9#Pdo~JByV6&;5>pl0><VZu
zj12p7XXWKu(Rhi|>O;4S@)}c_(tB`7E`?u{N!8Kb7@}f9Olj_bN9&`Mdg7=Z%yIn(
z%O6shrru}63}Xp>LSazsgtVjr<5p+p2buuy0_SA>G&IY{n=xubz`}!(hv%=@3n8#e
zAFv?;?5VJg9$o@M2;4g<`E1S4s@9^a4BvmMj~Q({+OeM-bjno?sQMz$zuR5G@8|%K
zgc}sYP)G7`B5+w!??2$OB`YuY+`pkMp=UoIJ-ai1gX)RBCrmHmt1gA>7m+xM3z}O+
zcv{I*KQbiVw;p_UrXsyC4gDOs5JJH#@#DV9YsAp=(U0L;=wlJXGZ2{twy)Llu?8Z=
z{XxS5zrZw<;i=1~1h3y3pLZd<m2Who&mbgKqy5qqv&|OYKbc1(!gI#$lMWL-p*Lcq
zT+v@njpwJKOs>+={^uK<F45y!dZ%qnhTKyiFFAuV=SO;jV|DWOW%4gR5}(6qff58A
zb!bgrKr4E7t4wtEP2(CS4=ga91VU>AF^m51&hH|XTO3)Y(a{^$*ylDknS5-1K03Hu
zAx@$i25HSe<@>g0qE1b?EDA)zW6a$tR>C1cIcytVtslw#zJ#>tj{I-Cy2wlz_ylRA
zfrPBL!+}5P1TGOedJ$Cp{T9)PeWi(CLf>|;m5HtyV)F!br1)d4tAE1}sz)6bo7`0W
zVnbyFpFQNb_5Q{Q`hI>R*IKI18xJ;fU<3x4pCe!^P-LOI7kh$6sI2(l^O)MF&<0L6
z_<6?K%u74#7o~4PNff*;*|Wnl?dQ(4E596c0UN^DQ%Av)&C?G))6`f{ED{7XoBODg
z`w~0ExO%7|L>e1J1*|Cs`gG-*J{p9ocr;D(e*j)Vp}wec;Wz?CZDoPZcH9}|VKjcL
zP25GPrCvb2SrtMlwNyVr#Aeq{P`#GQU9=C5SYDvgm)Ze36tA^JhAmB4rJq(6*~>kv
zU^_pZnCF%J_s*6kpkRA*-CDgPx1#i=G7H<SswfY?Ktm}0$(%3SZdH-I1O?lf?=1OS
zPiBh?pt`v-9`Ehh_lnRL4jMKUXFKj}f<zlurFh$!mrB2LuEPR#1uA_(HGgl<`fq^`
z(#|c5VGsnOTZ&j8+5g7c54{+zM`$-NXCM<WV#XON&H+B2po^6{;{~c{?b|!UJ7{2)
z<^UV00BUAMZO36_OuI`AWe?S|W`;uTS=In?v^GKA`?Na)lxr_hr>^=ewE^sPWq^_;
z?PKY41=!WjXaYl^61a~3I$nkSLDJGrVJIpqRp@<&N(-sPqBd(oH6Z1=NwhBWtn8L1
z!6bFfRK<hZMhdC-ZK8B>M%S5i41U#8p3iyD6|OllNbT|cOp1R}nNg_+(}-l?Bok5z
zxT6HzeN9MlMbd>80~|T`Qp|lr{!`}skIKbHHN`K{8IbbIiB*-lURk0m+vplQGp9Ns
zJu>df6KnNuJskz}@Sp}A=d*kfU*Gy-1M|(<6(AuDgRn2rQE2!7kEtgKyQx>|2XaNZ
z6_OPAUa4_VRSBwb2R*xZJO4WsYjucI8Q_%kFjS!QcYwQ4{T^U|{sCq80OP+r2w#RG
z$1YB%eKaF_F=;G!IzOQXyvOt~sI#vjA>eBsMxmb$B_VL8*35gRtyNv+Twmu>#WUqa
zlD!qE+>zRO`9+T#b?*D8T9*lsPy6KD;t8SBFN#?OipkEUMn)ROvM8=VA=wpjggLj&
z30GPAdWVKWK2^a=9OdIY9oe_(Iu{_HUZ6PtEI`XpF!^FKk;0^{oOxRVid1h9Jo89>
z=vH)*=?&kPhB<h<u_4b5R$;UBfRU*8LJ<q)v>*7qj7bKjCz(@$!dG38QhjD4>6xAD
zYYWQhS16rr2MTU>LB*&Cr_^qq3O(sew-qR+-BTgaSu)1pu@_WMW01b4m~x`;CzL0L
zR)RuLDsaWvfd}}Wt0#rKH6NT^0dmA32>g;9h~)ntYkGB;JKL)yAJ_q61YKDFfr=Gs
zc-DICYw|)}1?Kb(3Rg@@exw2g=F|pcc>4po=+o7zgJ4e6D$ggkd|ZhYn9~47sglQc
z3Jf&cXLt~&Y>N-!UEIs(+vj)CrX26%0BU5Da0LhJT$EzPcTMt7zUe{QpcJIB0NwR1
z)*8queiy>UB>T|_1zq|E^}C#see<P)F4Z3eP<duRBzEa`!79+D##P|#$?(+PZMMGw
z2yW<TbF@J*DIt{Xr5-gno`eZHI~p&}NG;3$Z37LK=}>^0px^(nMgDn(u(NV;)*H&j
z(9@~{l&=md=i4V}*}<_woo?|QVwW6@&#}4+b^Kw~VAzifP@qfCJv769&q2_o(r`L5
z&VCH1_?;GZ7|^9d0TnH8QTZ^B>~-`Mbm@sXf1H_mo+Ur0?%Q7XQ$d$1-f1<e=%r1M
zUa+YnQeTu^Tav>d47*Z5DwO+QY%^O+&SW1ZfBn(~7qF51I9y()%8#(w$LRH8UO$4D
z$xMXtu|YlA0Ly#b9a7=My~EEC&W#1We;N1W4)mF`TzAC5a!Rja#`72S`fGE4pad<J
zdWOL3owSe%rqMQ_nq8ncJ!D_8G4^LuP-1C}9{6j_#nu9GpCJ&SH(S+{4QR2{w&D<}
z5LQE2t%OPf#t#T3?r~(~Q6C&$#8Ua@wp^E)RO$}Yynj`Ic7tw1C8w^=C2(ae@~i53
zR+Lx@Nb>;{6mywXIO<mDlvwJbMZMm+`V$z3>G3^u{^o_osa+{0lb!%l5uJ<i6iWLX
zY9|n&-w_NSLFrB(Qe2}B<n!Obo~GXCl1W=vqul0wK8Bg_S(i~#GAS_4!+BI!Pp`aj
zy}0BQwv@6~+R7ZQ`bLmQ+S24*SBq0-TU{PcNu+ow^Y7dU>1Q0u*4ej|L<*Q&a=#L;
ze2i?^NfPM=3ZjY6&Gp3Ol1KyKzXg7Ab|p3tgD`BRgP7;`U+ko7V^^h!&;=|&QDWje
zODLOB4zM6Nz&PLnsTqB6aTj%(R`_;a4d9De!HHIOd8V};xIX#-w8hKd>L`KEgJjai
zFjAi<`1{Ai5Z2y+BYXYdj;8c5#h$cIDuLqYh*Z=#8A76sdle$MZo3}~#g32B`lU>n
zbQ@w`QO-IL^C*uJ>I|frpkXLC^J5;|-yd*reI-Y)>t8ag3>TFCyLrJn@&k1)NR*C1
zv3yq@d<E~I`dr`Myq`!*C247|f((01x#19;1Kkv60viqi8GE{)YLiNV4juU({C1)2
zf#9WgP?(>pWu-X+Az3}9iB(IN*)V$cwck^ZsY9LfL^46cP;EZYWp8~PTqCvQpDYb@
zL6vs2PACB1`@|X)i5PVUs(gN&T>%cnAPD=?9EkG&k6p4!@!UD_KF}1iECRNLH;l1L
zHUDE2#O~K?iXVsCEHM92RJ&shG!Ox|491c)+uKj?ZCk?}?QOg4Q~1`q@kaM&Sl?hg
z`?R9BHT$BLRvBjHNxvRyhpS$f$Qoc(#sa%=*QBxoRbS3Z_gLwJRbSvn5H8!M^egU?
z9y60b!XZnV{~0dRqWGTye!ceu?%LzqgjZmbT#vPbDMMolDCP|3HaEYCK=B-^@e4!c
z5vnA`r4Jg@R03xuxQQYf)W!<T{z7Z*rq9rrl1&3B**=3((H*EdvTC3wK*LZvX3H1N
ze`U)vG^W|36--+r2r;-omr$<Euzpew1eW>^a2*%G(3n;WEN$BA6WZz<Do`NJSrtMv
z5n^Ru`+@hZP_c-f@cpWRv&!=V3kmHMh}T}CZw3i#(@KWMbcFhFb}l#!gD?!e(jW<+
z`(JFEN^Gqkk?aCburgXmY#*aap~ka^N6rpJnSDwWl2TsKY(-GaKD{+5NudfBgO|=L
z&fpyvvysIBjVVyp*xSeugS|n5LSqV)iYKKks4VCfrDxPy;}ug4PtdL!2<5lvD=yQ~
zaic>*GWnb-R6mP{ek4sbgSzODl%aOX38IsCK*fU7L=J_bY4uxG6@046;9}UnQlT*|
z?5^_L9hIpW6dKmixKL2hsFXBCP;wsCf>uDoD0;Cs7!q?s#v5nfPNCDDQO2Digkq`;
zP|8u^2?owMlZj#NoN&0J01wpu?>xsdsta4~BB*%{mTWYj>hWMnL)jFl+S>RJ<t+m6
z{W3#;+@S5~Ui5EXHYG~McLuYbLJ3f7XDIMU`-}<~Df`7>UN&v;(P@XZ%lEfp*|hi*
zd~<dNNDjg<4Ez$rQB3~-vAZd?l%d?&^aDFir+^bV(tjvWVzv*I@l>sZ8X?_Go_@pv
zyP19~<R~X<Tv5xAKnZp5ejC%a^=?;(oDT^gWK%8hUEle>dQz3LPw7iBHs);Lcu<x6
zdMR`%z4qAx>DP<N7}X8mp{%sWDWT%sj%Yu6XJm&h&!Fch{EdREXQ-e;SL*yapZeFU
zRnyd6?vVzHr;QOqox?*@&LX*o2PmI1f4DaWwJpxLc`u3(P=x}xU0RM<3n=>a8ms#D
zw+aFEZh`Om%2l;1%3Gt#!4Lh&FB~HT)ZICCcjhX+nj&qNa&tk1hWd*NegA|uLdz&z
zQL4&!J<b(WbTS+7#B(Cs=f(#ow_C$<%QSZM#`rkXp;K-l1`4S+C=9v1R#5!6$0v0^
znBQ{9R4Knk3*$%(hngr_Vj0iR10N7l>K)2$dJ*-**}33G2*W`1N;nxOaQ}<7N|`aG
zUD<GfCkM^OS$`LbYM-1Hil$f}E~xxM?o#_El$!n#!OVQZmUn!%YT}}+f>r+6s)-n~
zTd|5S8R$=((K|b0AaOpd%b7}raW4>zx^k#k&hk-D&Qz+ox^0>&s-p*J%QJD#T<Uo&
zTekSC1FGLtsB<~)sz=%%p{Vx8F*Dx)iec*NvwU5EGnZ=6w|e{8nM?g;)s$6uVioQv
zgO>R`L@_3#E;VSc^%#mXSe^}cNbQ@fq8JQvsU;NO?O+z*1grx}q9xRRN5ugrqTjTF
zI&?sZ0rM5gH7!G%o%;R~MYVU89LMlxC>(A1V18#V^*@wH;J1XL+ItTaWK~Es_k+x(
z+QwS9F<Lawg|2ev<$g!m&k((Zie{1uYRJ*^Q3O_`VC-=-<Q_*Yr$X5{lnqyau7qOc
z0Mvjbt7g0WoC~Pq&jG(ky8;{uLJ;;PK^XM^AKT<&%k1tX=-vk!9UW9!ilM}1f$l<q
zOI_1?gNl0;-GE|j4@!KIL+&<mg7xXls#Bv7$nZO#LP0rjv2;o^71pm4DEpq^p!Q?T
z6Da?L5(Ssq?G{DrgC1O}2(oI{=#gewYF``XIk?m(DDR>tP>Ai)6N*8GjYOpOlXGyX
zPf*@T3GG0EOBKH8M>c%8$Xdq68z)$#G&w4oa9E0_YCky-{Tx*&+k6E@_G2TF0xnfN
zU#al(=#s+BT6gNf*v{5fBwt)JZCLyDde)vgU#a+3Jq=5?MzwbPWcsQhYv_6<QhiE*
zN_{{IGdV$Gg|!e0OsZ?%`DA1L)?TNx;Lk`PQmwInV}qF4HOnAtt0!mmX+r|p8cYsc
zZ_8K5JrJqW<G)C2r_Y{9yjofQesur^jXHDne*I9`=M#cA&l(WTi$`q?>0nW*K3JH4
zgUT{wBE2X(100A!5D0z=6{-IJW0&^arSY1Beqe&eDoWY?Lt5*6_&Vp6^6LrmCB?fZ
z8&4mG_co}xqn5|@rEkDTfeZ>YRF=9{b?9mq?LNMEOK0C{rDk)bl#WTu_uX`qP#M&q
zy{~!kCKFTJW9n`4muS{vEs^(6-BC(0tL`sNCp1L$9c9#%SaX)1DHmX;xE*S-H%aP|
zIFcu?rb0JKba?8m;Xd)&J9#yg!V|0V#CnCAJpA-0D);tEpiE>R;EJy@zBFpB^?|ZA
zee6c{mC$1j6f>Am(M`=fxz2#v2GWB%Gq)>EhNKu8QXs0oy(PgP3~z*OdWv`Zj4dX?
z9?YD?H&AcniZuWYb<+n@ucB{ASmRPrHf=7HP`%qCfx;Rew9hU4!_B=(ODqgyD4RNJ
z*`=Q+gR&(vg(~|1Rrq(!;V(I{dY_?e`h;4umPWN5weZ*82?OMD#M!<T?&$L2><W+=
z20_@Dq$t||e{8$XgwA#c-3M~aX$3<9d-Z8#wNVf)T4Jbnf!e$q(6gWnlo3i%+rkD(
z<rx&7)^Pxhx)k$QOO+UC?sX2%nhyg9l8a7beT0ECy+N8~eHICnDUqb`o$*;r?#he*
zjy^2Co?_A%2_6D4+taaABIret#up6u($5Wd<cc`PLs<X!n3y!sr8hD4>NQa&rnbaX
z3;RTTu%g7KeFn1BElN}>*<jaFYJ7-6mfi$4mn<C=HaYY}17ei<==*s^NUZq2gfwjP
z##woQ1frBkbDh6;fhBG$mETq;hrvmH#mSShG!|BT>Z40iP*CA9k7@!rSQAg~H1PxL
z3ibZhz&%dMvZbKV@wG7n;!N&-x)$Oq6f`N3sBfB(X&^SPgD6n)em=QSV#7W=%`}Dd
z*!}~euo^8n$bO!wp{=gE>aL|;6xtS>a~a2(BBaLAwn0oU&dvo%Vi1IaSMr0J-2Y-T
zTiMq*nQV!Bfmei-ih#|RlIZHJ7Vqaaf2*@*;&ouW-%2g<nk=Lwl$~P4B+^Ywv;yZf
z@2#67zGM=&4x{lbulZ12g;DVp-iNYc%}OtR$Rvg3%HX#DecAD8Ptjd}*PQd&oH{%Q
z9FS2h^w%vJJFXY?V@FD$BPH?cN!Qxty-R7mNK^`aP-><09i@6x8U-es&r-^PNL+=`
z2XN&3m~xk|4{_B&84G_T^7pnS)Nev=(#X>y2`DKF2kq7p5E*m4q6Pe<&6}B8%%ZDx
zM@M^i;iVqT2)~U5gqT;#y>9S?X7AH@N(vxncr(MEQh^AqQ-Iv4c~RZgr>=^hxnmP8
zGHKdS)*%JNU5eLd;R5BA!H7-mPo?G*;E+<kDGlc!`gpJ010ElDX5<9LOr9if0Y?D{
zsFcl^9BtF?yADuP_+$!GrR~c4^!I+0UYwl^7K9)OMYp7wsQcg8d=5OCvH{%yi4jo`
zuKz8ybcKG3rv#*B)W4Rmiz4kG@77zvej_uh>{+;i<D~^}w^OFF-;c>Edlv9fi=ku*
zjW(YPxu!sV8ThAy2>>F)hx)}u!{CJyBU^6Z37G~SF=coFov<u+XdK%O^k2knh6mt1
zQ#U+-3?%=O212IBb##UjwVlx!zH@iq+n#o~yR6Em;Do;pV)!Xr867c2px_rEe3OoG
zTZ!P$eKNSaiSRV*c{%UA)#C_XR_*fu%L`x|`wr&7p4aCDBdIi+U;y1cgJca*ypoGM
z3Kx~rC7Ca?jv3l#J#hOBYy-?dXjS9cL1E?=an&<5(gfzrlWq4M9H1OQJOdq!$tq8u
z&%r8w&bZL+)J7CBg-|cR&1vbm80sp2%33lQ)f*1h=U`YvO!K%!yTtfnh`uO07b6Hk
z7>KrnMp)>-vGc_2&Y^RJ0^9)!;S=)mmBKie>&sl8dn%88zQNs)b?BSJ-3pnzEM1)2
zp?}U+%^&O|iO`tYK@u97auHx5!egIzx2~HuE?c%Q(Cd))zxG+;!v`{VJEHvpdR2As
zh>svV0&2W6ms|L8R)JPM9Xk(5Yxap$Mw+Fm5{#);kr4!?z{S+}Fe+PB<|`LG3YvT6
z-0fcQoH@s`D;6*Y@kl{y=fBd{KhQysg5IB9t@327T2xmi&_Qx{n@9FeXXW?GiAc7P
zlwX`Te-z<XWj%$n8|Xe4;(k4kLMjOq5@K?Z2M7}nTc!wML@AH_-lGY5t(iQ>&4JKe
zO2L$4yMh9S2S6p2o4*q-o7TUGl!{~!p@vHEZd#FQ11I$^?$e2@?uyHND+`Z-=2q<w
zay7u`2h&EuI#Y?INmZO?n*;2@v{BeY>U3UdMao90vwgI6UFk=pj)zop(5-zqy8<JJ
zVGy>GZDK3kf3fy2mEfHApuYfz2}v*lsdf9slzK4QIb<e;QX&6L2?jNOrn-@>$C{6j
z<b!S)nmwm<uA4f$uB9bY9BdI`=i9%3c=h=170gk`oB$7mLLo-kCZ$F5TWL;O2STA>
zefH3rMIZ#O7#f?lkTq_k*!0bTocs>NK|iPzHP5J=q6|Vo2P9L(_5GmDwsLG1L_tBS
ztW#~&vj-OS{B_Z?=nA|Zz9&EHYveF&P6f#$H9t!}o!@;5Gyo-^2o_0glW{U9;#m1u
zD2}!r&hsfmykv=u7tII1GK>F(=@HKv%RwX*TH3kxh{rq740)d9$DZUSQl0SdDp@Wh
zR9V0VRfu@WrOE$i-wjP4vMHpKfKZ<8BkWW;8g6;Hv{&(4ULLAgIHwV-eBr8<%Jq<}
zmx|zF>sFdqs(fOi60S2Bx4F2jE=&2tlOCzK{q1&z={f5m{s7S@XJ>;$Aqd0ZD;b>>
z?tigoo@?h1hUo<wF=$}j`kik>r+ddMDVqI_m5uLGVl<MxTOzNk#L;yepoldXjdle>
zxoBD{Fh}%!&8Ax$QGzW6+M)o@uGQ2sSyYigOYAAy{>pVPdZ<P8i8>x-2aQo5sNLVX
zx(Z`PaU2i{TBANBy0<zi13$o#V@DJ8M%NZZC@WuZz);Mt@k@5b@IT^H?XxMV<+&vP
z4jYIf@~+(W1M5$lJwagx{m~wQupE$OiQAQcq#XjGFEzbDTo)JwLI+MSzSN<VdI0z}
z&!&{L7A;)kOh71Rw<C23O3p~pBK7xjTHwpgAd9qvqkQKYfgWj5D9=|f3s|n3p>IHC
zr0m(O+YTEoZ`MJhp<=~-&A9{gYiEJqDrq?`nwFwRI?cD7yMt5${{eZV9jO|l5h*E_
zT`D;Z9_hD9{Wv?rECxXs2487_(0c!i?Z@a>r|>9VAg?&5wP}*g17fp#QC*p%T-RR(
zRac^Eo>nE|6XLb2qo}Ja%%&ulfnZ~8#VE?wqT=Ggict1hY@juUBfUV`msST2Lse3b
z52{M<s%rPD8p(*eP%^Koi_XGO*0S4Yn-(^gy!lu!)QOR#PoV3zU;qe;bd=<id|@R(
z_Mi_PSympHtwsLIP^47VojCuiN*buD;1pU1P<aQ+Q;*zDP6ke)0jSEga=X0t>ahn!
znmn5g)uYRDLr{<B`osz~a6rA^4E?CT7uVJSS=P01whplU3#zfCJ&gW0npZ~i{)#x)
zP<FT5RLG@eTXQ&tBQ2!)Dy^}5Fh-EPVP`g2-_=Cq5oEFfWoAMlAarxQu})|@$ip>f
ztFWW&)iqDC`#5(vX{o-Xol6qKAPhsV)Ib9E{V&$e6hBka4u<Zs(%AVCEJf;(Y+s5M
zmZ&?g@HU?>?E*KN-5%6d7+t|Z25`7u0>Qph+jFI#9DJs`7hRDZ(V#dns^?hMDin$r
z2+d+oOM?$XnX9f`1Z`HJ+~{lW2Ps67R@D2+rKryMMW9H-xYDhvw--kks*F&r)eR{7
zaMAL2gUA4k$?BkzZ?qy%q}Wwb?2Ks5+0CowG63mfNf{D4J-QMADqSq;MOC_2Rr=jv
z8yAM5j2<1cM6(b1LpbM`k~X_*x4KQQsVA?1l>6D1$6jmItVD!~tS>Q8MiC^0T^MO8
zyV@l+mLwgaF6FOPJ$+H1zwq*73^M%Ch?RKypzx0<277`l9=nfFO$kxZEzEhfraWd^
z)&pzv#Pv(_*{<Z9fy?WtHTdN03~(3*VHo(O6#)(Z|JbB0b`UMAvkycGHCs!9Z!&NZ
zykHEy(O7gJd|LpnN`ZZ)M}`z~^hhI=^k&&VvP^_pAk+PrXw|7eV@In_u2b9+y<pUv
z4mLH?NGpBk2BwEyS*o7spi4cuqfqhl8eLCljq;4ElJb%)FEnne-;v*Ak#lMnnk<p!
z6CqW~ij)@y;z!jhvxO@M7iosw>5QHXWjh|b3qlSw7Gct8b66q_`=ST@0{!RhTUsg<
z-po5~@cz{}8Kl3c^->@-|2f?0`@i_8u&$<7_rlC()g)rF6pFM9{7vE6akR5MyH*>z
zqU;%B^OhE(eBQk1h_2aK;kR(_!cz0D1z+oVc6&C?%qfMT9U3FmURad%oDUkIXAIE7
zi!VA~QZ~3F>W}?R+7;j+41>TgS+)ZH|6>~M9cyER>H~HG1`RE63}yEJSMcMm5)Dh0
zfv~X%;lWXQ7v|2MlS(@WL~Zt<0a*1Q6hANWuz^~)<gppZI(bKea7(oyk<UOXe0%Kd
z1eJ<JcpMjwrTq$pvM0Fd@C^0@3}feaUX(n!HHjVOa*2=pUV(ZigA63~w@@m-=#T{$
z^$g=$8;?~jss;0$3zAAar?v=>JpHr&O(x%wNf)G-O;+u^^4FHLnt#nY2VG0Lkx35y
zwq(%|^&KG4-;y{i6uVQg+yPMD3>^3o`5{U$ZHBqi8_yjSrrG^Zt&T;Ub5%-mW^O0l
zEtcSbVWwRUjsgra5B6267(+wiT+H1tCO$tv9W+r1$`)IX@83cpbC8@W+)>FK0F3}L
z05*g|f(;~TF`G_y?}E)qbt@#FgP|UjoojN$FbIRsgcHB+f3e*kt50pZ9q<J-n2`ex
zAbvWk<(lKmTDMH#&{r~OC8)4crObaE6$g$&>{i`8p(e4o{awqW2uio$c-aZjDDrHL
zA||U&)Qu24A4@o>Xf2f;X=<O{w>OtkU)H!a159u(aIU1jEO9%&*mQ(MI>O7ZGb7l-
zpMsQ3+X}aTj9O!iItRAOm!qK_`Tcx%4#n;jXz)o%J(tpQo%qdqP~(W+j*=Ceo2eUB
zW`)y_>=C^$Qe<bgVOAEL{ULZ~40d+vpodT*_{FB8rn}2?Emw8lsM{*r?r0>OTC^W-
z3cpAkG7CVeUD``;N)j@u%vMf^v@LDgobD7!<ko72kV&zeoD^^@!GaQWb3~aZP_!3{
z0?S-FvZ+7Mrbb$yt>wD@8%0}fEeQRyb8Bx2XFh#2`$ed14wVHit=~R+advG<5W*nr
zN*e5g`(JE-By_5kvKPnzvdR(&h6!TI{RBcJosFvCyub(*78ME}6S`iELI&ylG%5v!
zWu%gM>ARdJ7-_X7h8g`h4L}`4VM~F++m(w%J+4yK$V!%$(z+w{j8S!Rj?2OB9O8{h
z<sPTem8Z4Jhj!!+4io&CJ!@r{tl4;MEWcS(c=w*;n~1m4)Tl~EyUFn<(#fK^GX*HX
z?`Iu0+%vAS!luV6<wu*JM?$=CrGE8Or*FX>{M}?SrgGulm2s~;#0Opexj26si}0)P
z!Y!xPt@+wjGC*x@Qx$Jj?LZle!%m*?Krwuzt;MebCo22;UnXMNe08F-@I%gm2c8D;
zZ<yCUY0~jDsmANYYD^_;H=}bnXE13CNhXu-mvCArPRUeqXtP{yQ_BRrOaXsI`VRPy
zvopY97zCl{m8KSz`(JEZG9HcXg7gAEO09q&K0hQ{Agru^2z^%7JKtkrB890WfS$!&
zOQyb6VJc1MuL_A63CoNhEfl6wicyv1D<1U5g86D(WgR$R8PAZ)za>?AhH5<NK;bD*
zD>^Pls`01;m3CPX1T%GPTR_L2kv5R*fYV_9cys6=%Jl?r$;E>X)M!cyHnCFn0HA@$
z1zz0Vl35Z%R0`RF`0iT57oci8xWYa81!?D(L)Df#w&_G;YJ1G|yx(5N)%CVQeT+VD
zRuzXl##-{XG@AY@4fHd9<I|2%7C=_S)=md1jtF{R|6d<GMKTsogHZ3-w7kb(!n*^-
zp1>7t@hKfQPNm6L7&b)G1!>aWH7hawj<pfArCHPasHDFVyEEpJ|CjHUG!t^R=mMM$
zKnln%a0@J&$rL)yT%Tp%oSoSX!!Qg(S4u3O`!Cj?=n-`a$m#$kWSc%3QPeLSWG4O(
zO5Ylg<sAXFJ)r9qP>G!r76qC(OnL^?lx{r1ab_1RV#I9T@o|%c<#|g}cMHl5oATeW
zmBSiqo9pNI<%z`iNX%^9YfXD(vTQ4{Z1dibx~ZZ>qdS<V`J%R6e@!^fwFv33aZoGf
zBOtjnyK)?ES8bB`{3nemAY|GpoR0UO-;++IZnbBS5W#vkr!KFAJ}d(@_raCd;7Z)M
zW8qj^I7#SLeI;<H#q7wRJf2xKu=sAntQL)sRWXuBZfxSQD8y`t&*?g!M6!L|9)R)y
z_!$uIT+d%NS}!ZADWU!m6fJ3K7pRRgGgFSt8zHopMhtNv=HwbL9Lfss432ZVV(YZ1
z3C-X*x7{mlma3`dDH)oaj0=a_p(8-|l1{f4Bi&m}=HCNM`Rnh9K9rpSj>I4cMXzKP
zs^0%%+sV{NmQDj6z#pJsKnnji4k>rzX;8)wk$Mc(Jd~Dc8CTzd5*NJx?6ifX??T<0
zrlGjMClq=RU8TdM7dF$vPQ@$S*{z;Pe7oTTcQ6WZGHad^X?oSphiWyX+vo*mPMAlT
zuo`6t=YZjJIi=FOv_^PHYjGh}XQTUkz0a>}Qevd$kS>|pQ>O4)uos3djkudK0200w
zkiI*B(UPZ><NvDZd{T~M!zCHFRLnhiG*QcO;%HmlOIhWcSk<jtB2A|nQ+B4>2Qk87
z(9)QGZ{HU7U!-sjwsJrd%k;eo)MB9OEOecx=vK=B;_zQxOR=Kca%DK9Gsa$hOR=I`
zZMQ(#(N5hJAXaqmnTahZ9_W@W4Ycm<Io~}p-e}y*>RWc0S_aFX#>pP(6x14<S4Ixx
z5pMPSmjB1uxgaqNf>7{EjUOcUzgXKDSyCnwv=`VBL!$8s?-69W<^79`=rQtdx9OJ6
z4yPK1Hk%+WdfUo<6gRtM-`(^4Hqo+C`K#6`UA(uz5~;=DI<5SjlfNe}S@I*`yLVSk
zM!vwAV%bcCAp@k2tqd3eBy?P#gIgwP2u@LRv|QAj1=1Nv7*<qOUrq8{GQkqiCxhxu
za0?_%3h@>A8&&8o5u%gol|GX11MuJUti&}F^}FY})cC2y#7`IyAj#J_dd|AG?_OK(
zy`T%BNg&M!U*<?QNOXc2xJ{cSq@S5BOp@)o^<=daw%vN{pk{h^3R(R|q?8SiiIv1g
z@u|mF(ptFjqN?)5R&bc_p6+l;oTE<yaM;P2iD;fmrd2XWlUZQa`2<o@i-VHt7sf8A
ze7oFxcu{@^Rd-18IH)ZYr8;H{>VoCh5bVv_8Ra$*gFy65aSe9wf3c)#-e7gL0{WM)
z5uk}#Gk`yI8ikne+n6^Qj$rxAqc@>g0TFj^&+{&7<$(ji=XVE(Ewc}ejzjRTmOX5L
zplrG|UHAH>wCj0_L#PyzP2Ep5WKja*@Sbtz&i|PNyLs+LCV4DC8=faPbV}3Y=svh@
z9i(*^r4MA;w|()=uY@cZ1hLTs&Ex1+IvIId(sZTX^VSpN9<k2<X^51j7h&ndu(;(^
zaK!BB#L!y(5gYn<o&``TBSw#@tFE3+8mkbb`PV3)F^G6T<!2j8<qg#8K>4kIZ?77W
zg5D}pQt>v`mrFPocApV%`3Aq~XE$o+7N4dow+OBBz}af3?BGCenjnqbW~*fn^fn#b
zOCKgu&PJhRhEQo5*g6V1u@+<HA0{Z3=4usH3W!@}p^k%6Dd&u&^n>{1?Anqb20_@B
zDpk?@Uu^raNji3SgkB&6NGtLP3Dx?Fa}&riHiBPsHI;73oMv!rR=bd$xN8=`ng2|E
zo!LwPp-#!uCs40yhK~Tjv9+d7{}4WL13??gls6zqq!Ho>&bfq<uLY`$K+PWlneTHY
zs82Srn>h(FGB}+?>D)vNzF;zjSRgSq*Ff95nwCZ6KlWe#9M6zlcdciPJ=asK7}Rs|
zGY7OQ$LiViqnw$_q0Pu#jLc7@Wq@pHqkh?Kej&lP3v)L{-SlIddmu2GaG0@k#kuLN
zwdF+df&yh5llO>bqxsmf5zr2)KxdR()Lx(h+z3de@r8p>2uZXICnS|t^l%UYZ7)^x
z_7S0&4dm;M`h7v8LUGP=kl6LD)yWb2L#iwkS2-ARxhA7q2I+jd!iTae%3>G<VOLtG
zL%9FN=0_78T?<|yPiPbi60oQruNR>D1&V)hyHLD)qx<iM3k4{-c%4wYUgv8ni%4V9
z4o{`+ClVE6A7Xh4h$DI^k;MR`&hs?p9Vl7~Witj3JkRJAR)nghxa1PA%}jcW<(n8)
zOYvV6Jy?tJ@78l99OkH^HN$BxF2!0x>d`p7@N+rAl9Mo(r+21?U7LUzMt$d`MAcHT
zQ^)}6-o;R1z=%NIW8SgFB@J9sN~@n{mW{K>N*}PbhlH}_G|D2>G>?e^9XZr-yQpQa
zh!qw^insO$>a(*bND8`;6C2%y*<nrFNhcCGj%&uC{#N%lY?@zv+9z%nz8CYhM$K<^
zC|uICAxi}2%N#41HUiSL2$f6msA8`i36*(tXq>(YNEI*HgLOX9pkN&*W-b)ai=PS<
z_;Pk`SqQ@*5Z#jIL7V+=Oh24E+NvR4K<5A@goMD{Rl2lH^pOUasC${mOBF7ODfrSB
z?judu8@f!{dt)kC<3)4|2=7+okf+P|ab8BXegbNYcwfPZU(0RP*4sg#7$<>BV&8=+
z6aGM&v^)$lgCoZ-c5L39vBkxhYsNI#uSj(TiR7fSZo4A@sX$`2sd5>jY<Yek*MzEn
zg=#B8wS%Rut0%%^s4d?@fc<-(>ZoqH6O}msy1RWZ^Q;1jOj`c#Fp=256XsUv)<CZf
zF0a~FaHz@ODjvXX1Eq!-a~n~#1nT+UxJz;W_n2Erb;~-$h|!r<`T>=YO2gPRK=XxJ
zz)T}4dRHvPHsD`3PjaYSez8+DpL;WQ>PM02)^evtMx;35TvJWn4M(-#3@^#Us6o1Q
zhn<px-1wK6JUBZ89Ed>>2!2V62loFTyXJDc5Sm8m2PUhcQlaoCv6FXCi#89wfJ<9n
zxd>cRlHqTUIMr)G)-xvvvI>Y*1~mz)jtq9KeB6^fvMtVdn(7PKDj>G0&!B62loTn;
z3ZaYGU_UZ))=mK8mCpIFA?K)Y=8f}C4~!aVu!j6jvx*)>D-E>+rmzv9@PSy``l3a=
z(wB_+ox(#_+WJ01z><<!d^=9{h9JqDAgEVBEKQ|JP<3Rm>WOW}JjyV#4URrdwW%Bx
z5UhG;(6!CZ3J7M68mw=fBZMmhXt1?YfrDtJ*=_Ol)C#C4L1s5W($=m6E5b7WnFX89
zQQ-*OP-fEes1^sUFIWUCr+=@r8kKlG@C_FP;Y#<6C9HmFvT4}j$B}oBx9y(q_UmW!
zCG85d5C%cuFHM|?|NmpH@{VRTv_7DFK!?f>@nn>;O}slg9Vi=;#Ju)ji+Dqv2*ldI
zE&vGyOE&g4`$dYA&6OOX5<rQVV=Qtw-K+{EOHLm#;lV$9qF4+Bf(x}~ek#o`BL%k@
z3F|h$NT98&dpYe}`5va@ud@{>9c(%U+-t1~64bX`QND7bt*!*huF`G|3LIy*kx~NZ
zN5C8oYN!IelFxb{WeB%#AE4c0LP4%HjD<Dchg<{##c{eVf?irJn>!ch9mGoGe3iy#
zn!<8x3TYpm^RWm@9EowThAYoF#k0=ku9)G_DL*6S6(lU-Xr?8X9xg3#$p(}9@6RUP
z9~BIdK<{T&`4|94p)z@|XneU&AXL&Q_4l*1IGgquDRDcXnwLD}Sf1)c`np!x(!W-L
z<E<xfLt$~?aJP%EL<zJ?<LgN@=?Ju35bDO+6(BJTg0L^Ouv+>5$F^HdaM}&r1DZpK
zSdGYpL?MS~-GybJy8A<i@qB?=+0DC_oy>PlarvkSrFc~86;_~Br2um#7IUbTtgA3_
zlDle>a1$Di;6J4i>*Bz<5IW^~AS)X0q2lDL`?q9Zo68*u92sfJZl9OqvtEKwd42yG
zxU(}Uf%F&xSMgqhiE}A|gB*^zYsdn|buNX|xNW#-@){Wrx(;p&<E#DxosvFkH2(vs
zj`O4eNCU{v6Xkg~`#arR6+=O(oO7JX3Im{18j8pb>yz<<h{l%#1TtlZ1AF+^P6`Ly
z-oYfiZDqP-58CSBzxn+Yg2qi)ED8!#N^;Wt?6vsNju;5!Rwp+XxZ;D07jWp5vq@Dc
zcBM?JgO>~z_0doG$VQybAXxx{PRY*nG-z>T2YW>sEZXLgC2(X28k_0<#CdXd1vm_Z
zAnZ#{4we6ZY{|B^##<)t0}XnWLyB<6;jk#24`lLUBGLY@4S7;Hs4$9&LJ1td;rwS0
zNsaT0kURXy9#GnJUKw&zbF;*6Ru3v0LoL1;HkL43!Z|{p40Z$e%9K}=6WNC&k|)0!
zb+W!jX5)z9Dj0UMxVAFetE3kx9T_BWyFFH<)3sd-3qtvB&Sgpg`MTfDSzL0sIxrmd
zq3`~SFPo?=4ciA2&?hG#9Jx_XaNx8dPZMYKas(8dT!?`z1$}l#*HAs%ha(UuwKl)4
z%@QVQa3$Oc?zq7#ZVIRJ`!kov=TJtaqVL}^R4A0u<phFEV#Xx1N!Myrb9U~Wp%O;<
z;+b57Fg2Jfh17l;bp!>12M1Ud9TnrA?*klYmBGX}Tbz!m>u!b!u^?%qCZr4xIK&b)
ztAVQQN0F%a>Ad~q><o}A20<WtB@9lK`(Laxo$hX<X_0?{H((efuEM{dwt*T!R|SL&
zj`78T&H)i6gBao5d!@%nXYjnr;V?^1n=w<d%-zZJdH{mu3u(Ge^-oCm;$7fr+~d0)
zI5!s1!z8be5Z+MsXj0WTL^qyOG{ft-hjTdzs%4-XNnj_af*Oa<G7DVFysQR1-^3wY
zMkp?|PEp7wkS>{-x?R56bVTATOQCdt9x^H~EI7{cWu?05x5@MJ66z)W3!LNpIQk9h
zdAf|Tft0~#Wu4~k94^5&)34k~7{n3=<7WQ{8RcnP@Zn|)scQ&fDWKdK<+vs))X>bZ
zBcmYC-#pm=FwC73Ee(T^e#d#Y3abC@VAU#g7rby0wo{><#+EXkHgz7(wy<xgCMEj>
zHCEKP$A_r7p}t5v8(fJ&5C~rh#J}GEVw>#NkA3<Qw0nUG;6SS)^YsSBFKKt6_$5c)
zz9N(A&Fq%ru#am@m5dB{<pjKYRmd@vu2wPc#_|zV!YaO^C|pW+GL#s~76+BL;YLIA
z#`eXKxWvJdF5b8Kfyj=7RCQiSp*`?t1vj8vS)N0Ko}R5>14@2f!9F|qJXQ<aAIA!<
zOYzOe_=BlFTifC>-IjDs97J!`Z`(I0irA%$ei;?N)V#bhv=|DuBXCw}OZGYBO*Uec
zXQ(?}(jB4w#7Sj_s>O?px4P^&2-{1aSMW4eu>Gq4km1NG*pB+Gj<IU0$<Ke{+CDBf
zZvX}06ZU=pWwKZ$eYMKs@!w{!y<^qrz)_X!1S;WRBUXd$%@Ze{wrxmXejcB{dDYlS
zdWU&DmE0`PVZQ;=ZOcfUIGwG`P@Mt(Z(CTw7iVXb#4rd#!7HH%G55b%`=Rfp*bdqY
z>;PGkj3$_)JfhtAyEqfvsnu#b6g@3_k7Xa%vLe216l@nX4!@@3RPlU$Lg!xR6Q!`d
z$qA|;L5Zlh0)B#m?KqybbSB7l&Tq&#1@n=htO;s9@mz5XW)a?G(9ZQfLBV#Mv|g0$
zOc^$61>2SF>_B0CA^-eE=icYIZUulkVwvrnKj>SJsLpeXl(X1(WVj>BF*NNX!5n3>
z_MqN>mEB4#J5eLPZ4_*;?7_LzRQTzF<+huys0!O%PEfGD!uAH++fh`sT_6MAkTFbM
z^MT`PzLwp11@T&&kM~xC?S{sgyFJ&%UqJG4>T3OWR9!K^ek-aw)@neb40)|wR@5V^
zc7meqB}R3apu={<t<U<G1b?Akq@4k-#2^SnuVlpnz5m5_ldUt2><0P&0xzH=5@_*(
zl641f=pRr}`|y9>IC@5u;S74KprH0M?x5j!jx7|_j(Rqqs1{|;kgHuiIyj<(l8=rT
zv`I0=^f(k^V6AThHQS`4%^rdoe^^oGqPZCCSksRi+5!Dom1oGaSxT!EBOjlrd^*0E
z#CUblDyuj+ep{s+A--kR`FpL35;cv-+3+@v^@@W~yF#L9y7blxYB#9e+G^F?7O$YD
z+WY)2#0(`?QLa@UkiA6*H99EyBM0J8yE56v8D!aT2Zh*<n#^%AttBc?id@!sW!AV>
z%tiCa;A2JI0q=wAg&p*BMJc9}8^y5YAk=QUO0>FGjO|46IFAYnYG+LbPXch1=SB}s
z{0gXVH_i^~Y7f+lvNJ$(7zCl{l?qZY_rKWg&Xh;mG>cx~4;n-!$RmRcz<XXVElJ6B
zfwO`Pd3!&oU@%Zqh2tz$e5o_o`_(ZnQpQV|khvpe1Q{-RNCXvRLi*TF6;%nyn*Wg9
zX|WkSXMSWA^(OTBj#csR0=J|lQc&wb<`t3VPqdXHwkJ%=B-0P~8S7G(rBu;m3p&s(
zFECZ~jbuhG^|V*~Z?D-bqn|in&}%hu5+<P6Hmypekke)1N+zR~6dk=3-cHR67d?6V
zf{WVYdB4Cpe6HWl_JDe*<f2+q$If2Gy;U#K<ps`9skd#PJ60w6&=XViCS@C6kXouH
zs97{~Q7KT-=*KIVeDn4PQn4eYSE(uqMJ15^!J(F_SsxUDlTw(-C9ClEgPzCWfvV_^
zRnJeU-!Dk2R{bFTECQpJdbWy-K4ix#ygjK-qDdNh-9qDsvopZ45QKr~m4qpR_rKU~
zcGFiP=2QO#Ceu1rVG7N%LhXJmu+%H+)p!GSEfQ56=ZiVz`-U5<#{-ma?<kI{WuQvx
z#YsWA+Qq);*8%E*)f%Ao^CS!}wGLSMC$+>C6e%cIyDDk-+t7*>x!Tt&yi{`4d$e@Y
z+|o;em8)F`tk~<D`uX-l0Sqq{R#v#EQ;cIyvAR}P$C|4QE4<Vh>bn5(QgtAPiWurE
zR;b-asSZX&4#g5+f2F@Mk+Zn28l|uIDOY=4;iXFP1RGHN6z!*}8eXdWs8>L>_;{rP
zJnsRXXBbrzt3-gI_HobEP_%MopvFg5uhM?4m7yWgnDUvZ40x$xxuixFoi=_GQ01Xs
zt*o@47ioB@{{Vkb#*0HoN(xH%0DqGm0kWds-y>jnsn1aL1Jn;^=Yr%g48qVer4VrM
zf3eL@>!*ynv*2Dp14Qvpw)lWLaq*q+k!0nZ8f0n<efRhmYV1Jen&9_QF}8D3WT{#)
zJA2~`!ghyO4zD!y)jeMvE!BA8WC5>qE35+r+oz4z@tU$;#&_&eYwLPPOQlvR`$QX>
z2OChfLJd0P4mED>lpQVAxQwTF?uotouLVsBb*@nbPAu<K+qGgPGi?hGwMyPBJ8Vxu
zvDlWwNCyhG2Nc!LYi!l(`3DqimjhA*3N7^p6)cK!Cn~g5<FxkM1kqCOQGF(8byoyO
zOEtDj)G9(^ac%bRA-0ns8(t;YifVdvaZlzVrv5=4Su~(xg}VKNn^4oF3&R=R_ucU_
z^Qoj>k(_HxnXaPO3pJEfSoKcy0cbZpl+>VoG7cD5RIsY{vv-tKX9M65jaDol>rMnd
zmDJ;hvNOPS7=&TynJNs7`(NyD8hP%oIwie8ltdvw47NhbX--p6@hNYvf+=eKH7U@L
zb2RZxDM0<s)fj$oQ!&-AUj0kE=i2!SgdcYb>No3c@FcyItLW@%%(ea7cln@}mncZ8
z0s}bU$9^?P>08cjE|65kD6^wlIfiLhbCnZ;q{=M@cJt{+Bo$LsJI|~Y!|0v0wnI%#
zQSFU|6E~b~zHF-D)p1Sx7=CzKNIOU>0d}Fzc+%!pAy@rsO301Pd0IFHuaIX(ey}Yz
z39D38yqdoQd|09&sn$)fXw}02Log1#v7PMi@o_x}FpyN6+P-`P^!YgN49nFHoG`rx
zk0+*Xs@+?vN16H8EG?>?!M)-Fustn%rJFSvrz;s&&&hNJlB)PZ^Ue@W=F}PT-VTxq
z-CgIC`%_b<sXHhJ_jaJ-oXJZI#pV+!*qvATHUW})vrT-0{v+*Na2y6<AbO>>@x<x<
zFSe_;JklhUL3@FxF&gsG7&C7Mk)*z!Tn6B|amFyO`Vf>zQpL}b=wXe~-Cmzu5=m<G
ziQyJ~JDY6y>QSR``;MwU7sAHnaZ{+^-Z0~;w(-2`Z=9%Sv56#AhTFM{FbQR&{z6ty
zQvXoxM%5B3DUeXM|HAFTS6})>f%|t=tG*&hC5O8&uvSHqs$QU}N5v+lC`3JwLnNt3
z6c%M}#T3dxVNu7TzND&w>NClMWsjeMs+XN46^p)C$lrjDs<$&qDyob@tsl!ip=!IL
z4yt?wm7sK1wOSx<r}<mWZwj11J-#n{X8Hn(BvtK#+H$Etl2p0>^Vv?4dPK2t6e}p)
z?pHG;4L4J$xT^B2s;Ce4h$Qs|c%tYiQnVG+c7CNM_nqu98k$cdDStUTqics@5QgsZ
zHn5G1z5inGr@5p#X$f6GhY&Tz2%}pl*nV=FrM~ir%5$joHL6vKYG0uyu3$x|5eB&X
z3guxAWBE9&M*AGqTdp2Jb*yWTH8RFW#(SIxb24x%RdkT$k*i&Sg6+(N$zb~_S9wu{
zk}4yr3EStWKuvN*eH9~9$e)%^UkN2uVTatPuTXI;pMVs%Qc3$;R3)f=CBqA#zaHyg
zdtSGrq~1hT<P}Ql6h9nMGsG(He1WR43w16|-{&fSgD9z*P;^qN(PyxH$G=cg&rq<P
zQ|coq*gj$Vg6*pm)zNM5QK~gO4A7Q5KMx8eRal2QTlAbhgS7{|g6%te#K&(?`x@0U
z><6qxu5w<9Z~LIL&DzN#6z0!;-{gw=DwjWXD5<jeOZ^pUe13z~2eiL`(#{3Bp%8?k
zTZ&IUX8#*&XCg=Q(hk^e;0_?_6$HXXAw^GEA2rw|DE(BBKBk8X29q(KOV+6J+BQyp
zUPUHVEE;Kj`|5I01uADUWKwO_CopnZ2pd-RAemGpkfM>&oAOnqvd8ZV+WL4}f`Z8q
zNTC{M?#35Xt{|CIYyN}T<piqVrE(_1%|o!yLokJsyV)1isZ{#8g0XSlR<HmCZy)`i
zennNPMaSi~lCo#FGgYaKJ5mYWZUZREgPBS$)hOpSK61$hm9JprQkzBF<v05AI8cyW
zs__iBm<l^pttv<^bu&AW?KQze3ZXEDjM5Ey$VS!Z6qfe`(#WMYqZk;oo3E#3#q4^A
zGX4#?)9|PS#n~S9>b_cV%k~T}DCl=6x#Aw2ZqcXJQmFU=d37$Y=&v#5D?`EC#j(}E
z>`&(B<WK`9BQRv~zd_;cbSQm&y}rIEI~Qb!K@f^=DaHt9{~K%PJv=z3Ex3U@{6zFB
z{Hf)4GI5fDOBF83g|2EkMSHwE!==s(XVmTDb$i0>aH%M$41F|JtEn17jTewgGkqWR
z+da3(&GZ|;Ql<NGNk2d(q|%=X>W+eag>nUVq3-Wco3^@%b_Ngh@w$CeD!5b~+eGnC
z1($c_j+;X@xKzd(7A<ZozOlvay&7DqbaouhgX(pAJT#!er3$4Qt%Ztr-bq0<6g*In
zS;E|^T{U5=5$)5h8jleA;h7;}D_zZQ0H?_^f*}!CeT6c=ohHkM2k&PvRNtL@KCT2V
z6)1r$o^4eVP-RUr2D<G*flI}M4kgYzr=TiOWwn*9#<Z<2pz12suG!mDs^clu6*rWW
z!=s&GI9Y>KGASrs^VQpL)a^b4B3{k{mpWZpj7}B?S`G9c>c!caBtZy+Q1nbD1n~YB
zYd3i~ltOyv>K9N*5kA8Q)cz?|Uyuqe)go`7E$ORJ)MVmn^(>MfU%V#rRcN|VfsDd0
zjq*<GX$h*oD|j(`0Sa$#xG3yWq_vW-fKj;AGZfxF`U(`@4(G)rz!u%@B`CbT@y6-Y
z8F~a6&7tu2c$m<0?@_YIcabPus?Gi@Y2!aAxK#eZfO27;O7aO_g-gX&8&$RKRG=%^
zYI3Q<`U!<lxF}eVs^6i;ptsf|lc_+-yRBBC#=BH{A`~i6csq-gjT<UK>UqAKQsGi<
z=f|OGN+fd8JRrlR8h1TTTx$0fsrILW@>Edr5oKj6)!+wBi459SpzwB<Lz#tN5gGCs
zA!RBRTO9xdnK&?z=b{Ri3Y614?81S8irL{(fl^~ny3?yxQgGZuU%2Rst$w7P0g?kD
z2n630j{yGvV@c)Q9+S<Mc=v!%BTifd2HSX2{bkBerhH1>S4_cnhgTh5^`8y4Q%mJO
zC{!7G&#YpqpHcZ4m8~^GPAxU44^mya&Auv_g6#}~k1n=zUadPb9aU;5&yYGr`QogT
z<W4O$lxLvSXc9XVt^m|hLrEvpgGS6y*+EpPc{HU*GBGn0As6B+Cj5p{78zfBRWKFj
zKTdCd+rj+Y!9j}#zOt!<?a3V{89!mBLuMVxph}I@6W+w_644ayIH*$N$bOjSObJ!V
zRJ&fFDO+pneo?2E3aT3i^1%0NY8^9BOT|~#f>aoF99wr;II7fXfwZ2^6fNwaf1-L~
z;p1iZ9aM3>z+EyNY)|HE%)ZJURD<o~XaAuns?_9F0DSdig?P1&WT>TL>W%HOgQ{Ko
zYIlLe?Z{Q~LD{(-I}E}=w3k~!uEApIzp;Gjh%uRA-N23(D*<WsxY}lwMKHZxr0$hc
zV^q><7<mS?R8dp39D9XJ=LB7#r2^G2cAlv!QXHrO!EC``+hnXRYCz%b2%u_XCuroa
z&{CC}SCAK7jy;SR2Q77l+K=6W`hP+#w{xdoy&ErNv{W(5Unp_wSs74mhhl!2*y~_H
zmA9wdF9B74bskS2XsMdHF|<=1J?I6H1BJJv0w^Dlp~^s>XUfMI`_CCAPV;(0P)~wG
zEUxHxUG#=k^9dEAz)VD5{Vae6eW|~#x?fm@mb!kywh?r`AX=)JNUjP2`sWQnyq!s`
z5`V~bc{xycyV9yz#dwU3li^qNrLIsJF3lRT=Rob=4wPzkk_DAjVXew3sYrPVrH!Dp
z6YS@$0D+b&-lCHosntjCK+%^9!J&%0?z)}tzb|Lkk_90Q!mc#cBIf=V8{a62<B!&z
zt31F^DzP+$3brG@ycRaGcvV@ImkDaAG@W%=lkXe1>25}+3Ie0ML`u5G7~P?C3P?+f
zq_p%#GrAk;QUU1{q#2Bq26^}Wz3=<)jwi-3p6$A?`}&;cVIX(Y3HB_lJ+Cd%j7TL%
zk>e<Fu<oqw=7VvG_*eH>1r7bhpEk@>B6{Uc;n~Nwb85Oy72G)?UG(V_2+JLA%;s4c
zz|w0H8IXjc?q@|VBuJZ=>LLBGB;p?zjX@q$)vY=9f3L(0^m@;`yYqtTTNJ52HU17-
zxVdCRbzs6s=$X<wM2IERm<D>@Ze>eUN!&K$GMm7&@}PIqOS1p!gdDz_Q_}6eui`9_
zXBf>e`h$TmU#utzFJx}3RzlXt?tx*LDvZ}=bE;!yt<sYv6zW~eayhWktMS+Y=aP5L
zJm<IfsCO`IUXYC$OtSm}Agy$(>0g!+Kwc@8!B_b}Te*Wz1L$r>d|#qtRYOr%PBn7U
ziBL(|H3N3B_HD%AV=rK{yqEJOz=b8e-|_n&-)gy`8F=0x+rTmgz{F`W)o|&ib~56*
ziUzTi3ND53wzDx6)Jpo?I7YPG72D~J(1`xO2t$Z-I&3+}9d%H>2hR(-acQ7jpKsY6
zY~cf_gA~NWcoOu|=_2DWG2`x&{@S^4bZqTis$rKCk*U{x1oB%@vyfa9gyfF*TeJ93
zzkE^#eK>NoA(`&6tE{W21n1ls^cYhW0)Z~BBuj>q>IN9Z2IVOBU6HI@drJ?6`M>Z}
z(MaGSp&de>JS`H4KurLtmoJPH-7%?Wf*0S0Vq0F`Pk4lf{JCoDe9ZkWex(na0^4p+
z%qs^qpR9^`bIZB92r04z&EWrWntR1bZvt1t`r=LQay#!;6W!VTu}Zx>MW16OM_KIG
z;H7)=ugWi4M7)<<hoq>5;X=w0YGGKDW<@iKf&#tLV_R;z=v{kTf^O=`IJh_FTgs8g
zWo;V#7@Bd1Aqqx&TU?G!<&qh3pyo!TVvnep`+(z6;RVIA4J!<WJNHOjO5^eBlTfEh
z1xo#N!LlSg#NicXdSF6e0a8ktB|Rn@Z@TLZroc0BNsqq=qAgII1;k*(i)coM(?~eK
z(iC_hFQG#?ZoScWjKSqo27OCca$ng24jr_lN9wD8aHJCwy2fN?xA7@o+M#*XeG0ty
z^{TJ(XLHBD=5etq8*^Z_$>5ts&`r`z`16%yQ*K7Xmi&~$<_MrACouHf88_BtL?YpG
zu+4#4$l_xcw1f}sWh-Yy){(cn&+CYTEfOj;3N-m>WliNvl9CB0<4KZtOt{DkIo~JO
zYQGj+R&|%qsU9)Fq;G`2{ch`p^!{bBa^n^uM1mIT%Gtm~DMvZpIO0x7;Idce`zP}9
zGr8HvT-2m7>L=(;?Y27>YI0G6%8?=u@YUR)*1?sFnB+I7tflT6*2`sVF%sy8?{s;J
zmE_7uG5IWZ7?W)j3P5+iRx_n^=~IP+rlJwVp#3kMVcG-^E6w>`9v~FaRVcO6-{<(8
z4b&2qTD|&F#K1&@SJJhd&XN|pm9Uzccj@&6fl=D`X!Sdc{doR(aO>9Eb@+$%_A{Sw
zCsJJ`M$Y<p0d2cES-M3a!?zo(Im564jCZ;#V>hOv(JR95>g1t$;K$O#L65+LN;;_(
zQS)z(uN`^kuqGl6U$XLnruhU046m-W<)HK6Z=k1ybk<h;udsfiOHP!>neaS4fvWI4
zrzUkCOlUzNBurGcLB<h+NIevfT@U^^P~Jnp<JWue9_Iyyqlz&kC{n1kOcbsc<`Fp1
z@A#MX6#eo!(&c|V#GsNlWM}_q4s|w<17GUZb@z(bEop|DJS3eHyBUtVt;05a!&W2-
z4y$U}l+zgi7K{^0!kleu4-4gg>C?@Mru`PW-90*4;jtV>!PwZX3_q-RVg)*q#7pky
z-&N<MiFD;D>Bi~4F4C?iO{*IHZJ*}Z{-v=<hplZLbrJ4r-?p_F`h>B91UWjus>L7f
zG9}{>Hjr0DxKej5bmMB-KJC1}9YEl=mz*=qY>)qT0qan-FVpE6fm^K~uAu#*r2Qx~
zNW0GZ>%p?IrGGqvr3vhot^*}l{e22!p=w}RStErc>3ZDn<LV38PaSiY|M8W#4cB-+
z>mk%Q{88c@qqS&}Z)>Aay@-y&<REv$F)SRit~(Sr82peCFx;RB3&;I3KfcRR-uAil
zjL~b2!X(e_qX%l2iYx-POT`eo`6TQ6vNdA}8NP~}O~B-aS*hsL`PRb@dL&+1RfA*e
z)5CMBTBpF@{9fq7y}2m!ZWu_2-5duh9A}nkg(N(#5O+ghj&qSxqi`}{P2qk?PrXn{
zf#yO&ogVTgrjjZmZW)nf%xb2?J;KFMW|UebWegj|>)CItI-=udBx<Js)nG+}Aks3z
zxUcp*bRJAzaoFyc#GcmtToGVir}G^IO^Qam596@e*~|N2G}h5O;i-O@ZDM5%i~qp+
zm01*1pQXyhZ&4<K0VI(rWtDpKgz?8gCK8*@5GQ+D?Aw7dPQ}$Gg{au28Im`;a9Mf?
zt#TTFXXQ;-Nke8ppvO(E&drRPt)agyfBHh<WL;qQ=AlYZ!{VX_J7h~@2m9_V)q?L8
zc-=UGsIoyJYx+suT~>ID$jO{L!rtTj9wo<9Ln%hd9>5sX)TnWH@H50%jXB|X!c1D^
zO2&6vw(o4CjWUT=@%kdz$dMN><~D#X#_zH^9gl2RLjQCn$4*MqyL@B6Bt_OlOPYco
zDfA_4b(cD*y2Kr1xh#Ht{ZPg8f~sl3p+w(%5jNxdV_s&Ai9g-(ucDkGXwKgp_Y9ou
zrDZ6XhrPJy+XX4c`C8chmZEE##BizG=?y#AnnXr&_!S8<=tq?jzMD&@WwAOWw{^b-
z@-6v}4}J=+R{E4MuN4FKoL~FK#P2hFzFg^mA#9L^bq1z;_K{IZKmvS-h|dgoajEU2
zUcF9t3U;=x-8{*2flM){Hm*8&R|q<p>NbA^D~RN5_+t)iNz;a3eeR7!UzR=YyHv#C
zztkgGPRjVwuaSqr&lQpl7p0`Ka0*5coKKtrh`zxu{>LF^B~s`Uc2vMXZL;JUWIDmW
zSXkkXUZl!xh&y#7oRX$GFnuAbjHY8HHgoF9dt68Om57+T2KXct3-ZlG^pN$$_g}4g
zbx{Nz<Qr+=wX`P}z^N9~DKK)Gh@e?de#FR|ie-{!p_RLR)*V2q?JQhgL|WV&Qobf#
za?g8&I_ACiQ)|Rq@49#r^;H5C$}b~aKfLC_OeDf4Q(dhwnL;S`j4hwNcpLnA4!=1(
z_Q`Iv<e%Kn8tCT6xr2Vc{45_5sEgbj%RFVb-3H4Zw$!<uQ2ix#e^uQ(T0$*P#3bmQ
zB~OeB7(|*OXP=GGuqBu|>Gn(%Pr7*GQkLI2=;zd{*Ob5e@jB;?=gapln_`t_hC$%1
z{O#c`h;%?yyS}tY!gL_6j<pW-XlRL!4OJeZ)_e-nDfgB?62<uSo6vm|<7CNS1N^l%
z!T&IoIOAYl`66hRL>VTxgmRSrpAl)<nMYzqK;0<F42A8SSH-!dlekngk=mat^KT=F
zFR|t#>vUEXe~n~&Oydb!2fBLg*`*$d)m+z%=BS-P?|#&+-#HZ|d$q=`$5B6%<i0C$
zvS=T&s(5~6IK^Hm^bA{Lh^P#Emqz<w&Ek<a?vN-^HJt_AL9LIhJA$Jwyvd7`Ax>um
z@AVW=BtKpet;KYl04IIkLo<eHpjb1LJgE296I-tRiTEBdjBEtA<;DBN`Y;x#_KoV1
z|1?I>eUI2VXReeG-p(Q7xfF`H+t0Wdts4M;hAU~TJ5;Wn6M-U1o;PP%Mg<=c-DdR}
zBi?x{nPv1N)7EF{IqX!;@|{sPj2nD^%6|91d<vdCidXvG@js!mBQQd8CG@d3dT3|4
zE%c;Z{j6Ut26n>18B`lhshPXcMtSs=KNTTb5e@2)r?LpK?E35%ZFmN*^db2{v<BNW
z`%@CaAwhz-SyE%;=hi+R1GBilCJ?+KNQTrPWDLQsPjjzAMF38%D80<;>-X!D`5AL}
z4;Z5O<2Kax(7Tg<x&pygk=ez<O|5QrxcD3yLGwy#kAifGpY&TC0{-SDyZWXQkI>k%
zIx7BVDnsd3r+xUyjD2h-!E9PDE`kl|SHY}rt*)BYuT8!>msq3yelBJl*5z@B4{$P^
z<pU(1EFGT}Jnx#NBKWK>6GqPf8EXD}RSZb0=w9Nc{YW{eVP3S1-|~O|CW>?)2K5Wm
zW}-ACqftoLLw?@^_Q(s{*i7}BJ4L2({0XyeRmmcr|Fv!$MP3!%uN%oa@rmsMkS-g{
zP}Opso9K?xI)CjY^ma_KD#X(7wYxg_c<aYnC_(wFA)u(Ngy*OD4D~9PDx@PvZH<fJ
z<_4|5Xr#>X-4qxXaz{L52B+W}@47f$_s3Rp{U%Ziq_H%+h_y#Y)vRBGo*6vOTqzI9
zpfG>&1_^7wdWKcbat#$Vf>HOFV5;;^(*N`h`n?_~>{O>NjjFdQ$SZxB*j5tq`_3aG
z2+Mt+u%*3OqB4Ng*yVoR=P2nMkwe7`6t}_!H{BjUP%GUQ`F!R3nI$f=556Qnq?65H
z0wnBtWw2MU9ydJc&0qp2VFdV>*p9$2n7N4!tNv+z7=i~>r)jQ++$cKxn=*Xd{{?36
zx4;j)?2086GC{;Vr%R*J<)5DDjrq@e#hpz12BiSCpk!_@Hq`9wm6mg&I^9b!dARwN
z^=<lwg+~Wu7s&l&qJK<+kTJ+k((?_dklsiTIv*dWOtY|kE2F%l`1{qz(fNZCib~85
z4BioNF=wYSyY8Vh>^v{*Lxp-Jxui7l&=42yy<w&IGW_LVu<Rg0H&zUm8L(XYAl^1~
z(Xrb1vcZDs)$_j*5q6!PACv=Cro?8O_@qE~((Htne4+Wns@~5H@{vKe=H%uq&L~*L
z?8>iih?p9}^Be;Xo40(@!<lNfUUFn&znU6kKuApZzi1ox>&yUL@1Y*!v}-W80{V+;
zRUF@6T(e$2b$p)9@t@P^(oT@+&VD;*o#4clY!1xs*+-eN#PjFvgT^A&0OHwb{VJ=!
zT?&UG!@x(x#tR7c4!9(mv)qAA@w;wFN<|HShv0#ohDe+}2)Vlv*YLhCjO;(T6R`9@
zGaG%n$_F3J?p~}?y*n6a2Vt>AmT95F0+Kek^>)h}iaRi)llQ7n?<2RN_0|tJ2|b@G
zvsmL-AIQyjn<L@8^*L=(ax)DY8pCYZ1G`64({?~@FpWb|Paz>Pco=wWXJ+_O*<%a_
z>J;ClS_4UwT=l1@^ZBHevt){>n{mI0Sw0Z)3Fdk)N!u}Q$mmt!G*xqCS590jp~|N}
z#)kxWkBog6AsyWYhe`Q+mM;RRpxf5^dj6gQdrrZhkulbZz6dbvQNvIOQ_1D}+R)}-
zXROhzi3zjPSP8x1wel~^ztz0*O9Q~>GX3tl%_`Uxj$vd^_fI*Puawro#30?SRSmaS
zg~!{!iLcSkkdlU|8+DBJK)u6#y(+Br<E{&J-&uHi1giqfe|kkN`;V9W=Io7rA%{)S
z>|UP7pqg6e^j{70UonWPVX6%m{$qEn9!!<vFOs@Yn~}r7EO1Rw$z-A%3X{bPwLtBn
zwj%p#d`ox@O0ObocvvZGx64@mf?csa1G(29VGl3TE#Pe!j1PqOHPm+xkOT`v_}pX_
zv4Q_zeN3i7va>n+@PN98978OE=9yXUdGlrAFN+gqqJl`IqZOL^7J=9l4Jh4j$hSoe
zuK{i%M|6!5E93A~L@M`7gR11dwMsqPxFl<iUG{Lx98OWCZ6LrR4KhdC05gx`EO+HB
z&Syw}muyxVM94D8$>L)6bSRexEV(N9k09UL3_0u!^Sf*)Ag>ZbCJoE;&alUGBQ$pi
z<YB(A%OHZEQ{eitqf;8e3eR+%sa2ra%g!vTDTx-MJo7u{bEHH~U?tx7Gd=wF_MuU%
zL<3XYFaf>ekAmxZR}mYjKM4Oezc5`WwG$I9*vgqaYlaRGq{EkRF-@mdHEiHan5#yG
zA3`5~klW#x&z_Wu*ucNH>I@Mn_^(f?;1lrE9W~Wf@rvxu-OX?l`(dXen(xHr$|0iX
zUF>6d><D@yP=!gT17=~5GcFYx1fDHULbhg3hoJ|}6N^}VXLJT!i~v=5<)C-(&54?M
zG%1#hyGExUrYr44h~T9ITj^Hoq0portGur42i#~(&H30OrXAV#p8`!spo;0Gv;yoH
zO`j%17BMsC__3H*mOkB{P_R-ngs47aL@7c9Jw4ViC+z+mG~&-4p+bq2+&ABy4<!IL
zd$y48!ue5t(|rEe&T}RG53$)S6HWk&WJ9TdOKT@ixvArPJxS?>(S{FAG?}l5S1OIC
z?&yic%V#rNwo_3i58wYi$Kj$4?N39?x9Mx~o&^6e{}K<Ti=hAE#zC#UPFwbB8wJw|
z@-uqF*Gt{FsUYP{Jl_iSYp#$?Dv45a69cS^FPZL|zS+$5@C4XPLnqA198+D5*uZOx
zxv=`+CGnqkQU!LgQZ)v7QwfEfMM3Ep+|z<emB~e9B*XZ}PX-D41QT8W;$2Q7s?W1(
z1h$^FH2Idrx|nuVqgW?P8jRzsH0!J0*am03;ZiDZiW;qRohRNb$2~+8PMIfvmF`-`
zGOR)v&W`X#VfBPiRdRY8M5y6veF&mTdosI1;se8_j3PgA_OA#;j=vDxE6!F;OMkt|
z`9<QTsOm6<;>Kq+P3ZHqf7gwA_^BUi8GT;(xE7}d1}1JkW!mm-Ig2}6)Hzw|rs`i|
zDOEJO$GjVU<^2WBV#3|&Sr>ZF^8NQwYyiqk@!!ND*+YuMs~r?Fa+<L*a~X1kD~1u9
z>(MC-TSUO+%u{i<uwrvbva)klf0L$A5zmgrz=&Rb4~!}9pBGZBD0}Uo7-R{ACey3p
z%zTP5)04CFu~1;*>w3=2x4vHFtyA#2b*L+?=nipFK{T*GxmrNqQP$BC8#DaIAwP`X
z(oGH_>@cr~Goe#%tyNZ<*S40a7qLS6LiKu9_ta~VyK0V-6BC$kZT78mVDUBO2dp(c
zz<#B;`la&R$-Pt9am5Ar<{GX*`n6vFtKVV7#r(CXiHMH8&^|5mDkB|hi&T8;M`@=Z
zd`sgW8j`WqBy=SMw1sC=g4f1*^IU&ABMjUd&npXk2xjG`_Va%P&ah-Y8XvdhXO{v3
z^5o`3!~2X;h6rM+=>>MSiYiv%JMdSHpbh22zhIo50;on2&u6r&f15`{@wAchoE_j8
zuH;7=XXhPH!)}F+UTFc#c(PF%$CMW?O{EUpJS=5_D?@D0#!R2*sjm;EzT^+}m=UbV
z?SGOsEE38KT%`UKh+P?wD3#vx>qwGzt|#Wap+dlRQ6if>fou7E?gGxm761&4-{lMY
zB6%Uhb}m67G})~76EJHX7AGtg5QQr$$7L{<px;hWo)wM|d){%xO@bJbztbTNJrsU=
z4HE9IN0@~+=wn?n!|!I~Ux3aqeq#Y$Z%YT9OT)5>`d*`5e%%wDX<HuZ0<3E(9^L9)
zXFGn8NVoP(4!{P0-Bp7}q+L=Twgg7>@pI*!T%>+mODV~OKp`2RJLCq6O!b{)f*V-n
zq`_INeZgf=Ej9X2Y0LO01MYhOmEH?Fxff%=aZ|B)w2K&QHsH2O*AQVTL$Leu4b^Sc
zSZbrQ1}aVwW{3eP|IaF;pP@F*Rs8XGS(lA~C#kvo!O*vVHd>s2NzE_(vRa=CddGxV
zCr;#_-G2CF_KvKSpXKFhxb?Hyaqhj43d+)iRW#RfvsGLWb!U!%YAG}2Z!f?CkVXve
zTN;tgr=?N!^f;!-11xJPa(1@Q#Ji=qcryoj3l_02EvSWY2w{|DrIep@**pb*aDdvD
z1&`bc@x0C{>!q#lkXQ-0vS9@M-rt?7<mp+;1r)eB$_?KxLNTU<(#&D;f0Q^?Vzomq
z!UT{G!7$w>rrK9~Ny2zDQ<WuOF^HW_2PinvtqIDjsqJ0)<<InMwZApK3QM_%3yg|b
z%u)dE!rC)eI$KP+-)QATv49?zy#=80AW{8rdhxgWjMr2)ivCbgu8?`^>T7D=TyZ7F
zm2-ipP(gNq-&n*6a^33a;~F|+&U5tsqxE$3g3in8_n{cc+qM*K{`4DX?6T0`xp}%M
zKmn?42zXYA`tEdM_;A2>!1{Qovkq0Hup_VG<SbPpH|LrGs8vF<G8*(mmB6fV3apL#
z$5a$Y%d@)m{BmM*7g7qhi{O|BB7(3VdZh}l^gIXI(r`C4D@;qY{>hlvkGXxnXNW4r
zz~E~2;?cQGW~FYqKF0Xv?T2Aztzua(d3gWEI9@8m^evJTzY>})<wT+;qu7%#pT2@Y
zoTTLyHl=0Ew7MkRcOq-Ds2mvj*FNiP!PFi0!-zHe^_K=Q7_2wiYXL~M`SbqHc(JB~
zP-KQ<_GV6~+*e7<^tWkAzPhQrH6Uz*aS?cEWq0xEWeAs?FcYVD3KfK2^8rYZeQ;y?
zOx;1BKvX8Lky6sG^!7^@`xn-0&A5l0AG}HKvjl82(wxrZ7l{4J$r{4ywww{KLOFi@
zKORkMukMO-Mn3b0Ss=>Sil099w?oKZiufn{Vylsb3mj>IIB%YksvA=V=kj3tKjX5r
zxj=YYN{nCLoKtvE4Rrm6W{(|`mnRTV;c*qg(=}oOLzuqwWfCCn8EP>9ehqn@r0+`b
z_+G>BUVOuKQ9NoKpexU^GTicd1pjH2a@P~P2atr9K+wKh_28LvVpt_QXPm`R-E8}T
zZ#L#vs{Psxw^rS)Cbc!feNu!~vl^68vQgrnOw?+MM({b{Ez4%Y%6f&c^C0qQS35@}
z{W}KPKG?Ph_UQbkBhR-A57H3;S6vPM1rKUg&xhww!12<^5w2AceASRUmX@j{7NFM0
zRf~f5wWk{dOy6vw?>&hrb37}B51H67N$vfUh!fvXO5fL)Q)>ypvn>q4*zNes;WJw;
zC8?<XAbk$o<>Y-IQA)>UXAEa52~-VtFPdt`2e5SsBgV*eL~y>PgZ_t9Ef%1gc{erq
zY2|UZlGM>KoJ|l9;~O9mipm$fs~mP))pDB3BlQlGpP9yEfeMHo_14pjoYfuqe56gd
zxyQy0B{3C)(jJm^?^!LruUoHHNcpfJ@9}lx#-~PKlbwSQG^M%JR0=b`oy>pta>U63
zduSF!=@Mec#<o-`&T5%;B@ISNq7gumD7yfs5rg?3RDtyR?`70WMF__Ftk)Vo#9UB*
zp0z3}8&%f%L%7bj|ND{`f;ppDsH-~l>Lj_EPf-uAw1&+=J$#og*MfzgOmk<Oa%T7`
zLZ|6lbhuSE$!nA5O)GmkcNG}kdX#Ucki4ZkJ!k3W_z_`x^-EV=r@;=w4&1iWT9>LU
z;@T%skY?1tSCrJ##;cARAj(nT``go#re0IWPb=>IDVIt)$sL7cvIjn%Vn~#5XF@Z&
z5HCc_auIH*Iv2H9H$**q=>fsFJQx|)#cuyQ)~8j;n)xr>>B*$B)$DHbC^m%&4;B2o
zi*N9IitE;PrYKvXYkqQ7HhaU0M{)SJDz`|YVF)FZ-}(5vQm;I~Qa^QF;$RLZjriV&
z@{|mC{Nc@muX{3|>ru5&R2O`6f$&g$Orb^Oz?$PPm=&U0aJW3H&;ZE${LGs?)Wc_@
z;rqkIh~h#jt^hkzuKf{%9DUr#ubli~Dk<T1zBa6^=`WMALm~*xhWag5-PnnlPuKBN
z3nQIDcV5IwDtV9)hyJ&^rg26K)uAE>X`crQs_dmz5r4=FZsjA7e-%BjiX1n!ou9Nm
zunwj==_}4YpK|5ACZatrQ5Ve4ZW!)Zz<Gt7Eecj^;A&gb)lMm<st^FX53(e-t(Zuw
zrO?C2-n#6*XoadWRWM746qE7|yEB~YPF5n<u=I7H*-%<L{mT(T=Q|Qe(5QF@c=*Y&
zbRMXbA_5%w9nFx+;-(*xoD`(v<IssYcd}mVP$ux~@jv$$QU8Anq$sTYC)xRlee=R1
z%2P~ft7V5a!Yb7%)st}GE^dMdr~S|Gh6Dr@2fI}kNnzNl)0E?#=S~%zqE^2P^T$07
zsgHrV51fq8@ws!f*!PIw!azT>s2T|dJsgUUZ!LK9D7~c&3Mtap**G;p+?*2KSlKc4
z`$3x8Iz>H`lZak>-Em>AIW1TqS84ft?c34f-L9^UeHgu#33k*8jW0+F))ZbCf+cK2
z8E~I~NoYn<?yEJmxcyx@wH5-&<KzJTmf?n2VeC2zYwurJcbg~ag33!c0J*d_>;PY1
zb-RhH=(%#MkGFEw2eDMIPVdV`8sJcn#uLL!5;BGw*^w!B*EM1b2ImBU=|eFl4Gm6z
z<%6E}GToczlOh8#1xx5M)y}W>xGQk@)R&ucFbv(b%8DS$mP?u}&G1xZxxGXeFI>(~
z1DzfD@vRJ_ecg(@E9OOVYuZPE`t3dLab@ibu+a()0I%ju>y1y8YFJSfx~b$FAv8VU
znRe<>MW=>pjZyJ49z~vkPz~;9H)yOxZGQ#f@?06gSeDO<40^Wo&abbD>%5z56?Syq
z2tCItpqW^e-6}CCBF~rzDnipV$$iPW>tTbl_nRG)z2w8#$-f$stcKhz$1X_1UX_aK
zL~!)FhwJ(8E3SY9`vzE;@{+BPEqP;ap&2Kp7?JuPA2dyo&wrVc2m?bn=FpV<>EY)5
zTAzGGz7*(37L+8n9{&1c?pR#3Yu9EqaQ!ZMAw@NQn}Nv-#EzFx_>DfWv@1XC?08=h
z#EuaCi={szIv$*L(N}<S4QaLc8}ukuQV6q6rb>Mh`?FBGq6O~)WJ*eO7V_X&llhh?
zG@}IIEi$g*^R82m$hgdTDWKX0b!^F-BHwhd;-!h!OUOWmA_=i(LsOPSTSgt>zx5aw
z39QXhT^8o#rPE+DdW=hzFG_E4080fC?OiX7fh0=2ZETVpm538Fv$U7@_-b*Wm<l(h
zm^~ecM?tu;J4QrVlPeBLb~RXugOD|;xrFu4M~2{UZk-~{5)jDZLEZFKHR8lAs2lsj
zpFWv%O-G(;>12$zUgwGl>@0@q$inKwc9Gm0Kw$b<GpkbZahAgXce+tgQdOt8omqs5
z0Gt61saLNj?!NPz9_C8PZ4vHctAp{4zn>G3-R%tvq4PX0k?}6E$r}62()sdCG;4Rt
zWJD|A>HK|`1ZLg$dXYVnR*gWYMAQu3c(TUET9c-X=wDS!n8|*AS|gfR-zra2l$&P8
zgVmMpduoP%GzF?A%*knmgAg`=4pAY0=WK#(7z%cRt%?^RfZ7O4*!cG(C}W;tK38-T
zx<kNS^}_LnSgGc{A*cqwdsi79AO9dIL{hMRhsZrmH!_$7NPeqb)CJDg$^*)QUj#V7
zd0b@$u8Bg8wRKwQy?J<;qtu>fP5QbJ^R2dkddY|U%Q-wJQ_bnJ+*tKr32iwU5tOS*
z%1^LD2FznNbYr;K4i=KbflN2u)`@Sr$9K<Hlx9poPV~#N(e^`uT;+Uu7&8>w8cR}>
zytq(iP^~$|XC1c3vmdS)a=yZTvu8ZVo8P`B0%qC{_^YzI@;c!W+q<2SAw%BBooz=P
z*o;)1pS-d6!1c6H0Trzk@%z(m{w&sNtU=pUSaH{3oDFihi<E#(v~NB<&QODr+_)|n
zUGk@Ui&&hh%(KgV?UJ7G!M`MS#mvE6FY^mrZs&#`3wgNEc8;PM1G7a*uvt^GJoL}l
zahZ$F!-!FY?fbVZ0=X>@Pm3beE#wU9a3+E8a{CIo66v(ij9ck!8*H^A50}qK7mr2r
zsL6$#P=%LY@k8k-kD4KUeN3?9Y65mv>Q3pNW8I6ywCdB<<(+nUQ-7@rticU~`>kXC
z-$or8iXXjRtwXAv1~|-~p(PSdGoBc$g!eOi^a_8Ooki4Ecqq)ulKKfp=70xx{4eY|
zA`o3ZcHroZ+lI`x$0Ovi>y6sMXQ|&J?)842!o5WYW9?T5B}DD@gykkUFU!7+Z+!T$
zeap(O5j>9l{)E&jYqITpX~W`&YZQ5rseulomQWD^$&k9}r>oNJ-mxXt4?XB}<5o(B
zflS(^fmDpUzv=smewrB3j%&Hg<$;5azTO;ZMEZF+>)OW;1kW<ZO*Xzoq`|zy#RC;G
z!j@&qaOl3ILuc7*l2u5s#GK3g0|m+<h|S#-S=IZkp`~UkLA?GtZY`duwI`cEolHP-
zbv3R4Kjfk7B{6>S^_#ITBqQ$`KRdB^C?rYB*D$)7TdsDXf#lOB<6e5=;4dREUV4Vv
zN!rOyt*k`{sXwtX!d%A4d%|^Q#Ic^!KC+s8OqD{TD0T}20I5~2U7gp1xB&bohu>2W
zl+!a`i2iWyJ?|(YuBbuhRR79aB0zVdxEsp?;2{&3JmmLTo>coIkm5ghCL4-A)RDC^
zmn4zgvbg)Vsp6oK94wTag2S#kG<b_wAw{L$s-O3ehyR$OD_~GoBcp`Rt1$7|k~tFq
zDL9N|$#==xkdjAp)=P{}bJLUh_nm~kRLIJA!){GR7HJB#0X{Y)Nv40SOeLZ)(--&+
zT<fKlqcveHWA%HNlWjZt+nc;x$}pEH&aN+s_un(*atiH#Wl<IB6e>Q*;vB9h{h|qX
zQ4`eSLmXCX+A5P}&Gr!Qd~4)keC0?cm(7R2PbEqH3M-O`24~^Bjwvpkp6*G}C-X_p
zHJvJuAT~x5r+vH$7{>!Xpv!$*-$PH%`c6DZ|NI3R5a-vZSB^%(<KCQGH%s6%YhY=v
zfSBlzAGQZba5PaPeTKSHE2kr~{aR@f^WTmUrUf{@G^uKO**4RY9J-_6OelW7RW8%z
z49CQH*@_ISx<5OmC*IGDAjW}61odV}59056_^R4?Pgf^9VpaHq88)7=({XN#+hLR#
zd2ffVdVX0;{cU9Gk-<8L_C-PgXEyd7t@Rg4Q5QTKDZS)po&JiNq_!z!4S}9Fe0;Jc
z>_-Ebh?4W}^mnQ$@&W$pHa{ae-+i$%t-Rwe+by)kh;Ij{{Vq0_|BtD44`!f_e|oBK
zY0MDWa-muM?KM40qQ)qPF_Hhwr*t+r;CF+vmnuo^)AJ!|?E(%}TRp~?+bkLZix7XQ
z*i8H|Fwi;pIgJm2uzP&8T`&`C8lUiHiyCY`dpTu}>wC}?h4U(Bb7+k@;@(iddZvSV
zulG%?L@r&Lt~7(hcqU`c?qo9dq>+tiiI}fX8o%W;Vs%VY)p}k&2dkji$eVY8U0>K5
z+>v@VJ@p2koMJ0J{dHQEdLw~5s(p7qE?YKH)E@kx?dULW96^D|EC&3ol2Phs$hC2J
zmh}?d+u+l)org#U22)(&F4^es>=X)&BR8KL?lc8EoEX<Vzg$sh$LXMyR35&Lyu8ji
zztB=#xuvnk6Q&2x>^z+@t2gppssvk-vhgb(?9XvkZ2Rn=?txIW<cwYfNa4{-n}m8$
zc3h|_L=k}sd#V4|7uipTD#xH2BNxv)t9=P9HhwC^sEH7+7uSgoCJ6OIKN2`;pnkl(
z>7|GDRjs=KznF$3nW+G|(ys`uX?PbYUbV7cO7ycKcE6cC2=JK8s63-3QaWqw+EB9q
zQ&Hm{lw;8jt?Y1cYNmm3VwAHOw=!Fck31|ecCKKt=({X7p4qpNZ=FLaEtR9@&|f2P
z*-e)<&|9?93p2eAy$T8DCK&7&lWaJlM#zprZGF1Z??tqyG|-v986UKeYldmIif<KG
zB1_8|e40ywH@|ZlbUw)IV~8y2*B`QsWKu(5#?>Ud1f+7dHRm)+B9&3qTNER}Wjd=K
zA*eBLm&_Yu7D)O>fx)xVY4_sX-_gMlDZn4;y`{3(j&xRPRPZ%deNlcTNn}rHFop#s
z8T#%ubgdILQZla%fh`x5ocvsBUlbsUkn=7Hl`X#KH_*RatI(!8;yJ|<gVk)Hm2V|Q
z+y>H8O$5ko&k&Tp`Xr^F0gCkvi5NAsT^te`ub5I4y$P*zT7Y{=a@%t!O1;Sh`TWcM
z2x^H?aQiTi)}KzdZ^akmNa0jie#1!BYH-N}7|JFq%xNSPTD&D|Pb{gQU&_l0liHmA
z00OuKT<0|2X&!0orm+<rXp)d<WLBTk%}I-|Id<$*z*i;8B}Fwz<|S)1G0}V?G&q$5
zQzQOy(t<9U!Y%ilYR-CQjkae77@BhcX!M4NuL#2A@7c@#7P<lOs1qosb`6Ea7WzRj
zuF~VnNvD{f*OQ1Lhfj5VjKMKm7~`R(oCUf`?x#Zzdz*wXk$%51Ac=$9t4ckCgD0!}
z6<v&GjLQ<w#*yAkbS>R@-(xGh>gKzvqaKte?Eir#DhpAbu;Y}BK4*UH`>>yd46gDS
zoDf|20GzY3VbEz66Y@D$rkPN_Vwn!-l=ur%aroS0>2tO6?lq&lQ)|wnQOT9K(%CX5
z#vbu*2TAXDZ~cvhrQ+*=bvC%Bw?&m`0H=knM)_*gZjm%@!`s=awZ0EOG9#Cx&^(u@
z@3Bws>)2qvyz+TyxRv!7qRbda#s(OxwIIq$QO=z6&oj6$Dx#;FX$8_~N`nlhrN!3Z
zrUtwiQOoTwV}D1u>iA>B%@&+|f3Rp&0S$O_j#-b@KN0t$iw1G(OTUBr3+Xj;p#4)t
z`}N$h)CVb3`Hyy^1!E|8ayWf_R6+2=`;V_99ZEzN!XFC*R<uBCCuQW->Hp-cX*8Av
z`qkq~s2Gy3t6C0Cnw<`q0>!ATqjJ8;>`YIRCLa`jYeX4Da3t_hRI&#OWHuJ6VEp1R
z5%WA7iD}S4w>;<8g&GRILQ3qJy{lPVuRQCidu&dy@|h34!&vEj3L`j3r7FL1^Jwuw
zCuk|Fyud{CT7d!#uqrpGNbM4z>H4vh{jm!kPDqk?=Scv(YV|Qwbn&cq+(-xes-v<l
zTY1U-r!E~t*elI`=G9I-A4ipk+on@AlGZYC!o0XTO5j$3^h56|nQnw24QpPQlAjE^
z7~a_b-iz{!E&r*CF7_H-lVc_DLk&w^_aSjgUTN+K20#j466ZO;P*F=XH;<DbzBo+B
zX*_jHyh;7bC2VmeTBZatLP6*G30a*NM*qdyvCf#$9-4wQ%kHvB$4pnD&QP8uwOG4e
z0=~9!{o?Id-wmO1VL1i1HdFQxU0Ut?)=Y#2iFx1EU#oOF%H3|^&LW9sbC5a{6Z;aV
zufxLb;_v|uOw`2q54KI%C=1lt%AWn?z>dGp@`de(+mN?QcB{15HGUQ9W&RBfgpF+|
zgU=}#xBXe_`dO&gkjC6TsRfk8c<mm`m!s!jTKaL-F3(k*QY*}bW%r*X_xg}P<{dh~
zDd{=IFZbu08LqYKFHgZf0!aeHuT;e{jLZeA{VE6{e>ux}o!sT3mbErrKKuiZoMSno
zGMI2#Bdr@T)XCvOf0*o-xNG&i((qfy5J}%pFxG1+4a#M9#kHp%@x`DZ>CER)ZR4RO
zw=9hNi3<Yv&6*R`RK``nQ94gpgO6ZYbS7}gaT}F&|E^Vv&Mr69V(NYWZ$=*z5y1E5
z2kG~uZKiTi=bvBFmwhh?#Sl`OLmHwF^8FkygBTDv>Y=eLiMq*~KC`i#CG?--b>Alc
z^yf8@q!WpVP3CmEmf}%41BVIG@U6%e=b8ErqM)^{5Q@5=|HQ>uC~LmHEc<$Z<Nb#0
z&$9@)P|||a-hpYWDJK6755NLw(}s4%5R)lYkGMP9BjKKP+aG84P7hN+ZWXJ7I;%j^
zPreIj>UYrEN@8MueZx<{)}G()UB$4YiC8*&YDEl!=8<aLLs)_u4nec<mfv5L9jTyT
zO&od(ri-w=X0<>l8ns1TO&s<s4QQ|vcavHFOP22Wz2%W9;@6<;xbKVVz(nbX&7F}|
z<%c@SEqyd5ZpPh7gB8U4R`8<l{M{gxk;rI<iLCo9<@_np24U42RIdnw6p`I&XC0yE
zU;X>}<^@d>GwD4a-ud*E!A6Uw3d=JXxGfE*BrTk*t|y7(naVv|n?%>}-bz%aIh(I;
z`c(wy&YR?>tqR~2u^SOLe*m8WaleJYaqSKGCu#;`tZ5^w(?$S|Pd34PDM4xh8$_Ty
z&Fw*Ko_})k$UXvh+5)I^SiYiX9hprtNyWXS!Q+qdZ8e_tZxr0{Jhif3s>TRMs@Ue)
z4Pz0JZkJdp=L*F|a_*Uj8;aRsf9({`B$T@ab$a~#VLu|2Ur`sCYe?aeol?_NI{+B3
zsrrjRZMQ%I%L2*xW5>mZFQSR<c|~s!gp9G-yPAH#@wUrLm}T#??npnPml_RarBh4D
zU9KMX>1w!2pCjLKQkx2NZ~0S(yQ3~a3)0AoDy;r?rZ`FAt9Pw!q2V(Rb~j3Js;vue
ze!`%Ey>KF>cCatkCDLNxFucF&PzNyBr#VDX9X-;N8Z90Cm7KjeTqWoz?311Ol~iB_
zB0^&9XsI*@k)pJagzN_F<>`cx{*U3xP%*O!;Gom`1c>1N2m{4z)Fl}Zz(awPi<|0D
z6teViBs}j;!--mkqD7;R++u<B*LyK)TJ9Rvz*DNwgo09oS*c8fw4+M3iJM&6L(}YS
zMy#y)XJ4Yn-(**R#ZeG%hLb)~{o+&6R|wDGL^F8tE0p3zNj>k6&kLl3VY^Lw6Y4C;
z{WB{5iY#n;N0km)>|qSoAu5MGz-Skab7Wo;s_8qG&{UMO<<<PhbH27m%K5<eRY`nQ
zTxE@Re_eMmPY~*8_pZ}SY=+wd5B&lnMm+TjLfwCu6(-G6lzYm{2?Dh39Z}sG3VhAt
zjKO(%0bEj@a@*jO8h|gA*3UK!<k9C;$inGtx&7I#{Ia4n=W=H8(ZTqzT(fMkT;Tg?
zbN}3=5Wt+J#mH?Mfi`MI)=*j^7w8^jZX+`QE3Ba7ny$Hs{YetY)BYU!N{NAFTdCsx
zJ<}Dx<3jl1f3x?qzsRytSz;~vmNI3XXKUCzAqZSdZCp!fP;H>O%miy2M0mj4+g4}T
z|0mD9rdg<l=s;Qa2j5t;3qz`M<?@Klzpssbs!KR9&ESIv*i@D;emeVd^_Gmor-q#O
z)I;!N=Mt&nHN;PR{+40+Xc;7I`MsOFku|uDua0Iy`Hsh?i)#;-c`PcqaoQkTK${My
z$R~-m5a~}pL774lzEBX7qvm86)}T`bDLfR{Zjzprj)+fJZlBLX;u%PX@a|akXTt8%
z`YulGNrvsxp=K_ALqG#*>O_ja7DU*b2GT5}k;_d4X7D_a_;Eyn<-(Ue6Ba?gs1Km!
z0FNt0kgmhp1<{Gslhf&L^-4SDkdyllD_e7)^{|vxn+K<KN`j||)me@EaqE-Dh<#x@
z;JAUV7kO^xnX+#GN5w~7UpGS(%$Cg6afr3}Y4}Qo&)A39(TZf_#)kERfXc;QV|2!3
zQG_!0+rFYk`ePeA=fJp;{4Oe`K)<OmvITm-T{@*m!mDqz@@lK|98Q+LO6gq#ZKf)>
z3f!`qpBP^hm^K4x3eYe)r-N1q(t4EHxj}tb)bE9o@b6Y-<^*V6yTGQSj4G47M+%mJ
zxL?#vs@6cw=&%F=$P>$4mJ|87CtWZ+9cDu9w6hrRg*^%RSOk>EZzh;)xNxrMtYO1j
z$usfna?8HITTPget;;Lpe47cQ5<7{L(k{YG+fy7iM1@sewn>gR<GrOFI$xVmXoZp9
zt!mCFYG`pD(&<mYnXrX=eV@#n*#~sY&<Q4gu|;@!T$_Zi_{ITYA}Ve`-9F!~;m^Ch
zqm={zmn6zeN+(gcRp&65cuV~zyaJ<3Iw?d_x|8jHP#MR~m|j#HvLZIfu0eLZXQzU2
zidIqFL;mfG51*0@?8dLUv6<Qokz~L%9m88Gu_B{x=B{>559kaA$*RV+RP72NojHeD
zbx)4Y?{G>EU8+&;BsRV;g%ygW#v_UP$QvdnlMdpc@>+=%SsNb+V~{Lt))4@Tv}yfh
z(S%<_FB2taJ0M@Gs(5{^S-f4l6EFc6^$pyoqfiI079KJ-^p(VJu;ymQr|82N_eEqs
zWGk)%FMX@dIcB{N!x7l1e4_Q6(oaWPGM9!7+<2Mep<Nf;IR>Z?qbOBMg~j|G%B8dx
z79h)%D}5Azn?wLPx*}JAUX<pTrfL3?qI%a?lJAyazi2<(Qf=cB0I=t3I=UUKcF)rn
zZks(CzjVh%P8u0wkJqbveqs5Y{NYz~L|(mMzqBfEuhw`oId>bRDw_~QDs2YjzEN7D
z+dw_t0;d|z%P)^mQYv_gFnzYFtkqB-HU-TT-W4IocaXH>^}5+5I_Dlivv|O0n@0AX
z&Dx=}Uxl0x+94X9KDxTo<SrV=r6&K6j6wyZKe!fi6)TAYRB`3^nYA>(lG)7A0(J0E
zV2pa>K0N{doZ~x%Detmie1c}__VI7TpPCF&bE`o37jZ$&VC-^8AY-viF*mYyUWw5H
z2wHEtAVx%n(?G$<dig2Ud(a>ilu^)b`2{gHL(Nb*S-d0=KC4$<rw%D!i*Z_i8J?-%
z8L5D*A>SVO%mMPNsMo>L(su&TbNN+#$k_-ujXC^jJ2PvzAF@$`6O7a1R78uKniiJd
zs~37yMoq{4qdZy=NypFs1}cqcB}L8K8RWLIjb9Z_+4pMfxU>zaEjMdIpvy!%wfOMr
z^+s2}3QwW%?3GXDuTfqZiU@)Kz%xIeP&trzV)vP1z0Wj@=w>hQjE}1eGfg-(Jv?aC
zU0R8a)Pz1u-7$)ibVHyv3h!ARfj>}y3S^wHoU6&(!!#1g!+kGNnlzlSY)s%!1DPZ$
z7yi?6uU}t%4kpjuhgtv^#H4#Uj;wLV;gGqBB$!pFD7>Hb68gtlWnP6p-H6!Wpyz!x
z31__wkB$Ird?$R<rIrrY^<CgsMh`Znzu<aAdxYmsI+KuPS4WwH)<=synU;lDsW25}
zB=xb;(y@hOvB;Z+BwIp)7Sj-Y3r#6kh58q@b3^dLia=aI_pFNv^;!?*Js+nE*sgo_
znZdJ*2yGjO#DJ-Q3Rzoyk+kDcrGt`pZlar3)6nMceG<~;A3QGb#aik=4Z+RJQ8&tX
zR^81$kkcew7xo`|M%~Fd?2)EZ1Ng-76Z;46X?P50xKNSZ%-ojyz&A>dVs7(C{XjxW
zgOBN7<?no#yxCvDhrn5T;E#)Q<ODryGmOaYra=2I9dJPc4!X2t&i<0{V;~nGNV;$~
z9L#4;Q`^ST3EShk`x<ZEos*fXioMRaiYpi~^V&fW5w=V?dt9NsBL?GD9!pdpQ-P=h
zhlu)VJtU`YEiILSt-f9T^We{gf|1wAXfya-838f>{E9bIo_yc(<9#@~1LnpF?p9QU
z8L;FzJO_1cXO#w{wVLQ+M?fK@+Yl9#cSHLA$q(xk#-L1CnPl*)ctbT0ukSHGq1~Bx
z%NK+#<GxM+Lmy`C-?moHqPb?qe(O%Btaz0<?oe@_E_wK!qH;;Eg7wdP-K-3+BuV1W
zn@<u8{q0hfh3R{jk%_BiMS<4AD5f$YMZW+Zc5T|1n4Nz#Gr#I)XSGMsSNk*xMS}7@
zmwiTF4h~`YBt-|QiPSQ8C?Cim%FmvmwtU9^h+j2}&$EuG-rUU$8zJv;FI(V9=utSu
z?5}H38t7+EUt;*b^8AKGpP;fxCqTO2CC=-FlqD_VP@+)jNS~Xc$bbg;$P2i%fe)yS
zOZJK-DO2vxw9>oT8ht6rOaq%q8*dhlRfuL$;gr$W)wxArcFY*@<&_Y_oc7Nkx}xF6
z*CAK!PlbPMCy7S{;CuF@KD^H#I~tCj;;bREaP*rhskiiOQ7LqyN0dhzMP^$aFtj6L
zX$tNYO5L>P9&-?t)z4l>2CdD<qM&7N*QETA*BbGKFV9)W%V6oIpam{LHLJrmrQ6xB
zpG68j2N{_?*n`;khp~C3@ml#%&IT?{!Hf(?)SNXZ(2-1rlfI#p4%{t{2u1|RcdP#Y
zKE(l6+<(r~oH~sy_Oce1uOI~_&nQ_=I^8pUg)-iv=d=2-Z9S);B-4g7|HKhw1u*eB
zI+a4E?h#^Tot~<`hDubw`e<cKa&C5yD?hXBQ54^lRuMuKky!iIq{sV24{+by_!ci+
ztNS;GcVhpVBUP7JWq9FDss7P{My0mt&C0e$CRJK|kCbi@%%Y`gbDJ)$2fp3ZG5hK6
z6?Q|Jdm({30Nq@fX{)!OCLeQrnPfZ!WN=9r+b9vK_^kNV1=W?nEWyVO_&YAZ&5w(Q
zTRE@_ll0e0w$)rQqD%=r8J$+iC%Y(!a*A$2w_2>~$x*00*HV5CeNu^$Ox}|xvr>%;
zhaULx*&h?xuiuL?+5TdZ@#)RCx-=x)9UZi&#nMjhK5-fycYIzu@$lX!3u%t1T)Pyp
zS3hS9MvYxMe?kdhPNwnk-29Hd8NFZL*9$QpV1h~sV%zep+&%NT4QF^yrRL%&Q39%D
z82e5F==PKH&5Mmk)Sq#y#`iFE$xHb1&6&s-o}@8vKUKGVou1!sIq=2Kz~b>YlL2+i
z|BX@(Im0oJb|MIc>`mGgo48mo>&I~fzj*5PN<I1Ev&+F)f%B4k^%XPjTXf|WQ^+}t
zmo7=F)+{twsQFrpL^XPD;4t-*&8Bi-j9&*@7yD$MyTX|HFw<yfzH|WqONW5uvFui1
zY>R355<Wa_bD;gWojtFYyWgz5s%g;ZU<&fq!>zF!|7NV={HGm{-Q=!7^|lo7BH-yL
zkTgc;@EC)!UE(T|yaf7G%v|XoQRX$;2*~t3P!DriepC1qlTDZ>*;x$n_M=XQJ#+g*
zF8C{65Uli@P*q2J$5A2dtzTOZP%!Y1goN&xNr_HF)=RUn@XJish+Kb()`sxn>(cXQ
zvbQ(2pBg>w6K5=0#wXZEtZAcRh7H?;|Jh|b@K`VbnC+c4F(S!~%kiUSoS3^Mkat`0
z^m|-xNf<<8Hoikf{-+P3?rct8;xl~ZR#~=fIkS_dmaFUh|CFDlj|H(nr-*VwGs65H
zj9X*UCc`SG{=Vy#^KsO;W~5OBGWXwNt9X%NK7v{Y_q^YlC#Jmm<jbKb?2&3)_kxir
z5x1zQUu|plEpPpM?a>U6s&DVi=fP47O1{jyXHCv@K@B-}+G#P>m|=4=*;zii8rx=d
zu6f8Mbp#&A;u@J@eh~jH!>rz%sRrJ=_QU3>tBy&w_ioK2^Vc6&ih4LCXpVHMs>dAJ
z=nHQVJ|iYOY}56|;~#1-1I!h721|q$+*>C3E%n!0%5%fi{8r`GqTviA>6Es^G5E70
zkhS*)lFb`9Cu6FULYebBooYMr-b78R$5bRcM?QOMJ3*Fn(fs!t+uQIrU6dn!=jR#1
z>50(6?o<ziw?y;$1_x+iq5GWWXaei$+TzjES4Hx_8Cbd6?QkO$d`?~O!?1&%!_%Fp
z=M2wM=pSBP2lCg;HSYW&0YBmb0Va{*AIXk!*nie|2BTYbG+f3%=b$mfK`XU_9+)xA
z{h~FyD!&)T?o{M3c;X&<t<EdGEi=g>VR;2X(>z?O{W@ANmo@Qgn3=s(<>;F#Ly}1R
zq3(77cD8HOyUK5G&;_V|JS%2ibgo(oNXzTt;FwD>R8gsLy_VrP<_r~hKef$y>FMWR
zeEs`y{(WqLiuFTLz+(7!T>Av>0gSILYu35<+l{(dnw=r!q{5^QZ;pF~sbq?HYKYJ@
zX|yM{t-je{P85xX{DEl6z8R`*Bv(LmQi?28?~THA<H=H(pOe<AmliG`W0|j#87+-B
z-T2^GEz9$Ig9szPfOQ=bxi6oW8@bdPnb8RxMUKAz1K%e4sk}Cz&2T-(U(2yWx;j!+
z^9cDU%Nm_mD=nroam*8i`mZkB&oG-)Y<f!22i=dq!RCIvSa=aFW;g9$S*NUU{j)uJ
zq_B%#IVA1g?BF#`9Q?W?)p6zfQS+#8n!}&B9K<w@u3H8f$)6E0G=(nKfAVwT8Ly8~
zuYQwvNLN+a85aWU(rXZtJ;V7sGdF3ki=)&&QcuO#B<p>!*SLS$5N}vc%GtY6QItY^
zSp#c+Mx|tolP_mX+SzInJB#ByKJ_{Rfr|Bz@S%Tx!b7xj%K4N=TWUqr6iC56GrJiA
zhF>VI6z<k`!|Wf%Je{pUfWt)tH>S)cU{#d7ZZdh*7Qa~Di&9<!n`~js!N1Msa_<UR
zO9f->5+YpXJe?v=@W$?-`&T29mY0$pD_^`!Nhc6=DgP%@0<Hbk!k{Q_p{<;Y)U*(2
zQNWDSf?MdHlAYyAEugy<r=t2N(0=cniGm>oI;#sh+pxjZ26<5gLkfnoP`D3eXJErH
z2m`^DFd#7dFIG!U{wXBIUf`rkjhbTL;flhIbdN%>n4cgq7;W(xO8)faBGo%XWlWvw
z`T?~EnrVhAYmn;7Ek$!ihC<E=Zs0c|lu=9aHHZv_oDmFbhJzxtA45Tl7Fk;{p@NN}
z`d%7ghBS~;G1Ps;4#TN%9UebjdVXv$6iwKn#rU}Kt~EV6ctbE1eLzi{^)8fbsD$r&
z5S6#pY_4-gR<jLN-cj1H?dU?)MNVq>UnNRTXEkZaJsX93Tm-kECcb8SNbQw0$qX)1
zUr1a?qAleD=~|n~ogs*>?yk!a_@TIB{))x?riVNz+*?|4n1-xe>s)U-idTk`ca%0B
z5P48}L)Gcw3!%zGe}hel>MmUjp&yFpSSd54<`%0B1sfW-Q7GOzrlXjnK{AAXXnN9e
zU8?DavuoKwAcTSU{TZYx(uC~K=o(E>5BvX#n$Tgb4=hJ66Uv5$PG`0P1&amT&`j_C
z(6)!`0TuPA%2IQi3wi&0ZmFe^_q5Wx>g5EybWfK|MQ4C@ZfQV4S>9){QncK@%!J3f
z$Iu5+gjBYk+qp{Gr&Xs^c0xs+WPsYL;QEn*l3@{4A(1zhW7>TKqBU7?qQ(*L*2{7K
z0mKl{Le-036xw2ww&~|DXM;l96ggNZY+-}~)eM~6e#&`%E|R-U^JyHCJKXZ|d>x1T
M03s?huwg_h0QzHhp8x;=

literal 0
HcmV?d00001

diff --git a/demo/undocumented/elasticity/python/demo_elasticity.py b/demo/undocumented/elasticity/python/demo_elasticity.py
new file mode 100644
index 0000000..b985616
--- /dev/null
+++ b/demo/undocumented/elasticity/python/demo_elasticity.py
@@ -0,0 +1,111 @@
+"""This demo program solves the equations of static linear elasticity
+for a gear clamped at two of its ends and twisted 30 degrees."""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2008-2011
+#
+# First added:  2007-11-14
+# Last changed: 2011-06-28
+
+from dolfin import *
+
+# Load mesh and define function space
+mesh = Mesh("../gear.xml.gz")
+mesh.order()
+V = VectorFunctionSpace(mesh, "CG", 1)
+
+# Sub domain for clamp at left end
+def left(x, on_boundary):
+    return x[0] < 0.5 and on_boundary
+
+# Dirichlet boundary condition for rotation at right end
+class Rotation(Expression):
+
+    def eval(self, values, x):
+
+        # Center of rotation
+        y0 = 0.5
+        z0 = 0.219
+
+        # Angle of rotation (30 degrees)
+        theta = 0.5236
+
+        # New coordinates
+        y = y0 + (x[1] - y0)*cos(theta) - (x[2] - z0)*sin(theta)
+        z = z0 + (x[1] - y0)*sin(theta) + (x[2] - z0)*cos(theta)
+
+        # Clamp at right end
+        values[0] = 0.0
+        values[1] = y - x[1]
+        values[2] = z - x[2]
+
+    def value_shape(self):
+        return (3,)
+
+# Sub domain for rotation at right end
+def right(x, on_boundary):
+    return x[0] > 0.9 and on_boundary
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant((0.0, 0.0, 0.0))
+
+E  = 10.0
+nu = 0.3
+
+mu    = E / (2.0*(1.0 + nu))
+lmbda = E*nu / ((1.0 + nu)*(1.0 - 2.0*nu))
+
+def sigma(v):
+    return 2.0*mu*sym(grad(v)) + lmbda*tr(sym(grad(v)))*Identity(v.geometric_dimension())
+
+a = inner(sigma(u), grad(v))*dx
+L = inner(f, v)*dx
+
+# Set up boundary condition at left end
+c = Constant((0.0, 0.0, 0.0))
+bcl = DirichletBC(V, c, left)
+
+# Set up boundary condition at right end
+r = Rotation()
+bcr = DirichletBC(V, r, right)
+
+# Set up boundary conditions
+bcs = [bcl, bcr]
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bcs, solver_parameters={"symmetric": True})
+
+# Save solution to VTK format
+File("elasticity.pvd", "compressed") << u
+
+# Save colored mesh partitions in VTK format if running in parallel
+if MPI.size(mesh.mpi_comm()) > 1:
+    File("partitions.pvd") << CellFunction("size_t", mesh, \
+                                           MPI.rank(mesh.mpi_comm()))
+
+# Project and write stress field to post-processing file
+W = TensorFunctionSpace(mesh, "Discontinuous Lagrange", 0)
+stress = project(sigma(u), V=W)
+File("streess.pvd") << stress
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/undocumented/elastodynamics/cpp/CMakeLists.txt b/demo/undocumented/elastodynamics/cpp/CMakeLists.txt
new file mode 100644
index 0000000..f01126f
--- /dev/null
+++ b/demo/undocumented/elastodynamics/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_elastodynamics)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/elastodynamics/cpp/DG0_eps_xx.h b/demo/undocumented/elastodynamics/cpp/DG0_eps_xx.h
new file mode 100644
index 0000000..be6d529
--- /dev/null
+++ b/demo/undocumented/elastodynamics/cpp/DG0_eps_xx.h
@@ -0,0 +1,4411 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __DG0_EPS_XX_H
+#define __DG0_EPS_XX_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class dg0_eps_xx_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new dg0_eps_xx_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class dg0_eps_xx_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[3] = dof_values[4];
+    vertex_values[5] = dof_values[5];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new dg0_eps_xx_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new dg0_eps_xx_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new dg0_eps_xx_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class dg0_eps_xx_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new dg0_eps_xx_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class dg0_eps_xx_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new dg0_eps_xx_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class dg0_eps_xx_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new dg0_eps_xx_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new dg0_eps_xx_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new dg0_eps_xx_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class dg0_eps_xx_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[2][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new dg0_eps_xx_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class dg0_eps_xx_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 0
+    // Total number of operations (multiply-add pairs):                  3
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class dg0_eps_xx_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    6
+    // Number of operations (multiply-add pairs) for tensor contraction: 3
+    // Total number of operations (multiply-add pairs):                  12
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[0][0]*K[0]*(1.0);
+    const double G0_0_1 = det*w[0][0]*K[2]*(1.0);
+    const double G0_1_0 = det*w[0][1]*K[0]*(1.0);
+    const double G0_2_1 = det*w[0][2]*K[2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = -0.5*G0_0_0 - 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_2_1;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class dg0_eps_xx_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "0b6222e9d64850fc915071cc701bdf2bacbf2220b284578ced51b9d141af65fac69252ee0eb41fde5b5c04a59d9bf8e88257e5d91691d1b5ed17a393e6b94980";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new dg0_eps_xx_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new dg0_eps_xx_finite_element_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new dg0_eps_xx_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new dg0_eps_xx_dofmap_2();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new dg0_eps_xx_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class dg0_eps_xx_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  dg0_eps_xx_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~dg0_eps_xx_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "5334dfa14c1f724b7d5411acc3b989e38616f70c69a320605e8feceecf53b59dad3a43f7fd17264e5aeb9e1e754b9ca5578253db1ff5a44f160f8fbf602f8d7c";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new dg0_eps_xx_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new dg0_eps_xx_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new dg0_eps_xx_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new dg0_eps_xx_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new dg0_eps_xx_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace DG0_eps_xx
+{
+
+class CoefficientSpace_u: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new dg0_eps_xx_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new dg0_eps_xx_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new dg0_eps_xx_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new dg0_eps_xx_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new dg0_eps_xx_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new dg0_eps_xx_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = *u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new dg0_eps_xx_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new dg0_eps_xx_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new dg0_eps_xx_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = *u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new dg0_eps_xx_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_u;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/elastodynamics/cpp/DG0_eps_xx.ufl b/demo/undocumented/elastodynamics/cpp/DG0_eps_xx.ufl
new file mode 100644
index 0000000..07dd55e
--- /dev/null
+++ b/demo/undocumented/elastodynamics/cpp/DG0_eps_xx.ufl
@@ -0,0 +1,34 @@
+# Copyright (C) 2009 Mirko Maraldi and Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-01-22
+# Last changed: 2011-03-09
+#
+# Projection
+#
+# Compile this form with FFC: ffc -l dolfin DG0_eps-xx.ufl
+
+vector   = VectorElement("Lagrange", triangle, 1)
+constant = FiniteElement("Discontinuous Lagrange", triangle, 0)
+
+eps = TrialFunction(constant)
+v   = TestFunction(constant)
+u   = Coefficient(vector)
+
+a = eps*v*dx
+L = u[0].dx(0)*v*dx
+
diff --git a/demo/undocumented/elastodynamics/cpp/ElastoDynamics.h b/demo/undocumented/elastodynamics/cpp/ElastoDynamics.h
new file mode 100644
index 0000000..3f37f7e
--- /dev/null
+++ b/demo/undocumented/elastodynamics/cpp/ElastoDynamics.h
@@ -0,0 +1,6405 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ELASTODYNAMICS_H
+#define __ELASTODYNAMICS_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class elastodynamics_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elastodynamics_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    
+    // Get coordinates and map to the reference (FIAT) element
+    
+    // Reset values
+    *values = 0.0;
+    
+    // Array of basisvalues
+    double basisvalues[1] = {0.0};
+    
+    // Declare helper variables
+    
+    // Compute basisvalues
+    basisvalues[0] = 1.0;
+    
+    // Table(s) of coefficients
+    static const double coefficients0[1] = \
+    {1.0};
+    
+    // Compute value(s)
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      *values += coefficients0[r]*basisvalues[r];
+    } // end loop over 'r'
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis.
+    _evaluate_basis(0, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 0)
+    {
+    return ;
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Element is constant, calling evaluate_basis_derivatives.
+    _evaluate_basis_derivatives(0, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[0];
+    vertex_values[2] = dof_values[0];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elastodynamics_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elastodynamics_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elastodynamics_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elastodynamics_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class elastodynamics_finite_element_2: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  elastodynamics_finite_element_2() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_finite_element_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        values[1] += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[num_derivatives + r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 4:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    case 5:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[1];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[3] = vals[1];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[4] = vals[1];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[1];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[2] = dof_values[1];
+    vertex_values[4] = dof_values[2];
+    // Evaluate function and change variables
+    vertex_values[1] = dof_values[3];
+    vertex_values[3] = dof_values[4];
+    vertex_values[5] = dof_values[5];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 2;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elastodynamics_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new elastodynamics_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new elastodynamics_finite_element_2();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elastodynamics_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elastodynamics_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2)), 0, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 0;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[2][0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 0;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[0][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elastodynamics_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elastodynamics_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elastodynamics_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elastodynamics_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class elastodynamics_dofmap_2: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  elastodynamics_dofmap_2() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_dofmap_2()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for VectorElement('Lagrange', Domain(Cell('triangle', 2)), 1, 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 2*num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[0][0];
+    dofs[4] = offset + c.entity_indices[0][1];
+    dofs[5] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 4;
+      dofs[3] = 5;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+        dofs[1] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+        dofs[1] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = vertex_coordinates[0];
+    dof_coordinates[3][1] = vertex_coordinates[1];
+    dof_coordinates[4][0] = vertex_coordinates[2];
+    dof_coordinates[4][1] = vertex_coordinates[3];
+    dof_coordinates[5][0] = vertex_coordinates[4];
+    dof_coordinates[5][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 2;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elastodynamics_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new elastodynamics_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new elastodynamics_dofmap_2();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elastodynamics_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elastodynamics_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true, true, true, true, true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.166666666666667, 0.166666666666667, 0.166666666666667};
+    // Quadrature points on the UFC reference element: (0.166666666666667, 0.166666666666667), (0.166666666666667, 0.666666666666667), (0.666666666666667, 0.166666666666667)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0[3][3] = \
+    {{0.666666666666667, 0.166666666666667, 0.166666666666667},
+    {0.166666666666667, 0.166666666666667, 0.666666666666667},
+    {0.166666666666667, 0.666666666666667, 0.166666666666667}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[3] = {0, 1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[3] = {3, 4, 5};
+    
+    static const double FE1_C0_D01[3][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {3, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 137.
+    double G[11];
+    G[0] = (K[2]*K[2]*det*(w[2][0] + 2.0*w[3][0] + w[5][0]*( - w[2][0]-2.0*w[3][0])) + K[3]*K[3]*det*w[3][0]*(1.0 - w[5][0]));
+    G[1] = (K[0]*K[2]*det*(w[2][0] + 2.0*w[3][0] + w[5][0]*( - w[2][0]-2.0*w[3][0])) + K[1]*K[3]*det*w[3][0]*(1.0 - w[5][0]));
+    G[2] = K[2]*K[3]*det*(w[2][0] + w[3][0] - w[5][0]*(w[2][0] + w[3][0]));
+    G[3] = det*(K[0]*K[3]*w[3][0]*(1.0 - w[5][0]) + K[1]*K[2]*w[2][0]*(1.0 - w[5][0]));
+    G[4] = (K[0]*K[0]*det*(w[2][0] + 2.0*w[3][0] + w[5][0]*( - w[2][0]-2.0*w[3][0])) + K[1]*K[1]*det*w[3][0]*(1.0 - w[5][0]));
+    G[5] = det*(K[0]*K[3]*w[2][0]*(1.0 - w[5][0]) + K[1]*K[2]*w[3][0]*(1.0 - w[5][0]));
+    G[6] = K[0]*K[1]*det*(w[2][0] + w[3][0] - w[5][0]*(w[2][0] + w[3][0]));
+    G[7] = (K[2]*K[2]*det*w[3][0]*(1.0 - w[5][0]) + K[3]*K[3]*det*(w[2][0] + 2.0*w[3][0] + w[5][0]*( - w[2][0]-2.0*w[3][0])));
+    G[8] = (K[0]*K[2]*det*w[3][0]*(1.0 - w[5][0]) + K[1]*K[3]*det*(w[2][0] + 2.0*w[3][0] + w[5][0]*( - w[2][0]-2.0*w[3][0])));
+    G[9] = (K[0]*K[0]*det*w[3][0]*(1.0 - w[5][0]) + K[1]*K[1]*det*(w[2][0] + 2.0*w[3][0] + w[5][0]*( - w[2][0]-2.0*w[3][0])));
+    G[10] = det*((w[1][0]*w[7][0] - w[1][0]*w[5][0]*w[7][0])/(w[6][0]*w[8][0]) + (w[0][0] - w[0][0]*w[4][0])/(w[6][0]*w[8][0]*w[8][0]));
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 771
+    for (unsigned int ip = 0; ip < 3; ip++)
+    {
+      
+      // Number of operations to compute ip constants: 11
+      double I[11];
+      // Number of operations: 1
+      I[0] = G[0]*W3[ip];
+      
+      // Number of operations: 1
+      I[1] = G[1]*W3[ip];
+      
+      // Number of operations: 1
+      I[2] = G[2]*W3[ip];
+      
+      // Number of operations: 1
+      I[3] = G[3]*W3[ip];
+      
+      // Number of operations: 1
+      I[4] = G[4]*W3[ip];
+      
+      // Number of operations: 1
+      I[5] = G[5]*W3[ip];
+      
+      // Number of operations: 1
+      I[6] = G[6]*W3[ip];
+      
+      // Number of operations: 1
+      I[7] = G[7]*W3[ip];
+      
+      // Number of operations: 1
+      I[8] = G[8]*W3[ip];
+      
+      // Number of operations: 1
+      I[9] = G[9]*W3[ip];
+      
+      // Number of operations: 1
+      I[10] = G[10]*W3[ip];
+      
+      
+      // Number of operations for primary indices: 54
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        for (unsigned int k = 0; k < 3; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc0[j]*6 + nzc0[k]] += FE1_C0[ip][j]*FE1_C0[ip][k]*I[10];
+          // Number of operations to compute entry: 3
+          A[nzc3[j]*6 + nzc3[k]] += FE1_C0[ip][j]*FE1_C0[ip][k]*I[10];
+        } // end loop over 'k'
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 192
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        for (unsigned int k = 0; k < 2; k++)
+        {
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc1[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[0];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc2[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc4[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc1[j]*6 + nzc5[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc1[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[1];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc2[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[4];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc4[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[5];
+          // Number of operations to compute entry: 3
+          A[nzc2[j]*6 + nzc5[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[6];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc1[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[2];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc2[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[5];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc4[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[7];
+          // Number of operations to compute entry: 3
+          A[nzc4[j]*6 + nzc5[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[8];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc1[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[3];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc2[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[6];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc4[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[8];
+          // Number of operations to compute entry: 3
+          A[nzc5[j]*6 + nzc5[k]] += FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[9];
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class elastodynamics_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  elastodynamics_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, true, true, false, true, false, true, true, true, true, true, true, true, true, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.166666666666667, 0.166666666666667, 0.166666666666667};
+    // Quadrature points on the UFC reference element: (0.166666666666667, 0.166666666666667), (0.166666666666667, 0.666666666666667), (0.666666666666667, 0.166666666666667)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0[3][3] = \
+    {{0.666666666666667, 0.166666666666667, 0.166666666666667},
+    {0.166666666666667, 0.166666666666667, 0.666666666666667},
+    {0.166666666666667, 0.666666666666667, 0.166666666666667}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[3] = {0, 1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc3[3] = {3, 4, 5};
+    
+    static const double FE1_C0_D01[3][2] = \
+    {{-1.0, 1.0},
+    {-1.0, 1.0},
+    {-1.0, 1.0}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc5[2] = {3, 4};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc4[2] = {3, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 122.
+    double G[13];
+    G[0] = det*w[11][0]*(K[0]*K[2]*( - w[8][0]-2.0*w[9][0]) - K[1]*K[3]*w[9][0]);
+    G[1] = det*w[11][0]*(K[2]*K[2]*( - w[8][0]-2.0*w[9][0]) - K[3]*K[3]*w[9][0]);
+    G[2] =  - det*w[11][0]*(K[0]*K[3]*w[9][0] + K[1]*K[2]*w[8][0]);
+    G[3] =  - K[2]*K[3]*det*w[11][0]*(w[8][0] + w[9][0]);
+    G[4] = det*w[11][0]*(K[0]*K[0]*( - w[8][0]-2.0*w[9][0]) - K[1]*K[1]*w[9][0]);
+    G[5] =  - K[0]*K[1]*det*w[11][0]*(w[8][0] + w[9][0]);
+    G[6] =  - det*w[11][0]*(K[0]*K[3]*w[8][0] + K[1]*K[2]*w[9][0]);
+    G[7] = det*w[11][0]*(K[1]*K[3]*( - w[8][0]-2.0*w[9][0]) - K[0]*K[2]*w[9][0]);
+    G[8] = det*w[11][0]*(K[3]*K[3]*( - w[8][0]-2.0*w[9][0]) - K[2]*K[2]*w[9][0]);
+    G[9] = det*w[11][0]*(K[1]*K[1]*( - w[8][0]-2.0*w[9][0]) - K[0]*K[0]*w[9][0]);
+    G[10] = det*(w[14][0]*w[7][0]*(w[11][0]-1.0) + (0.5*w[13][0]*w[14][0]*w[7][0] + 0.5*w[6][0]-0.5*w[10][0]*w[6][0]-0.5*w[11][0]*w[13][0]*w[14][0]*w[7][0])/w[12][0] - w[6][0]);
+    G[11] = det*((w[13][0]*w[7][0] - w[11][0]*w[13][0]*w[7][0])/(w[12][0]*w[14][0]) + (w[6][0] - w[10][0]*w[6][0])/(w[12][0]*w[14][0]*w[14][0]));
+    G[12] = det*(w[7][0]*((w[13][0] - w[11][0]*w[13][0])/w[12][0]-1.0) + (w[6][0] - w[10][0]*w[6][0])/(w[12][0]*w[14][0]));
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 420
+    for (unsigned int ip = 0; ip < 3; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      double F3 = 0.0;
+      double F4 = 0.0;
+      double F5 = 0.0;
+      double F6 = 0.0;
+      double F7 = 0.0;
+      double F8 = 0.0;
+      double F9 = 0.0;
+      double F10 = 0.0;
+      double F11 = 0.0;
+      
+      // Total number of operations to compute function values = 16
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        F0 += FE1_C0_D01[ip][r]*w[0][nzc2[r]];
+        F1 += FE1_C0_D01[ip][r]*w[0][nzc1[r]];
+        F2 += FE1_C0_D01[ip][r]*w[0][nzc5[r]];
+        F3 += FE1_C0_D01[ip][r]*w[0][nzc4[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 48
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        F4 += FE1_C0[ip][r]*w[2][nzc0[r]];
+        F5 += FE1_C0[ip][r]*w[2][nzc3[r]];
+        F6 += FE1_C0[ip][r]*w[0][nzc0[r]];
+        F7 += FE1_C0[ip][r]*w[0][nzc3[r]];
+        F8 += FE1_C0[ip][r]*w[1][nzc0[r]];
+        F9 += FE1_C0[ip][r]*w[1][nzc3[r]];
+        F10 += FE1_C0[ip][r]*w[4][nzc0[r]];
+        F11 += FE1_C0[ip][r]*w[4][nzc3[r]];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 48
+      double I[6];
+      // Number of operations: 8
+      I[0] = W3[ip]*(F0*G[0] + F1*G[1] + F2*G[2] + F3*G[3]);
+      
+      // Number of operations: 8
+      I[1] = W3[ip]*(F0*G[4] + F1*G[0] + F2*G[5] + F3*G[6]);
+      
+      // Number of operations: 8
+      I[2] = W3[ip]*(F0*G[6] + F1*G[3] + F2*G[7] + F3*G[8]);
+      
+      // Number of operations: 8
+      I[3] = W3[ip]*(F0*G[5] + F1*G[2] + F2*G[9] + F3*G[7]);
+      
+      // Number of operations: 8
+      I[4] = W3[ip]*(F10*det + F4*G[10] + F6*G[11] + F8*G[12]);
+      
+      // Number of operations: 8
+      I[5] = W3[ip]*(F11*det + F5*G[10] + F7*G[11] + F9*G[12]);
+      
+      
+      // Number of operations for primary indices: 12
+      for (unsigned int j = 0; j < 3; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc0[j]] += FE1_C0[ip][j]*I[4];
+        // Number of operations to compute entry: 2
+        A[nzc3[j]] += FE1_C0[ip][j]*I[5];
+      } // end loop over 'j'
+      
+      // Number of operations for primary indices: 16
+      for (unsigned int j = 0; j < 2; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[nzc1[j]] += FE1_C0_D01[ip][j]*I[0];
+        // Number of operations to compute entry: 2
+        A[nzc2[j]] += FE1_C0_D01[ip][j]*I[1];
+        // Number of operations to compute entry: 2
+        A[nzc4[j]] += FE1_C0_D01[ip][j]*I[2];
+        // Number of operations to compute entry: 2
+        A[nzc5[j]] += FE1_C0_D01[ip][j]*I[3];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class elastodynamics_exterior_facet_integral_1_3: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  elastodynamics_exterior_facet_integral_1_3() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_exterior_facet_integral_1_3()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, false, false, true, false, true, false, false, false, false, false, true, false, false, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    24
+    // Number of operations (multiply-add pairs) for tensor contraction: 66
+    // Total number of operations (multiply-add pairs):                  100
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*w[11][0]*w[3][0]*(1.0);
+    const double G0_0_1 = det*w[11][0]*w[3][1]*(1.0);
+    const double G0_0_2 = det*w[11][0]*w[3][2]*(1.0);
+    const double G0_0_3 = det*w[11][0]*w[3][3]*(1.0);
+    const double G0_0_4 = det*w[11][0]*w[3][4]*(1.0);
+    const double G0_0_5 = det*w[11][0]*w[3][5]*(1.0);
+    const double G1_0 = det*w[5][0]*(1.0);
+    const double G1_1 = det*w[5][1]*(1.0);
+    const double G1_2 = det*w[5][2]*(1.0);
+    const double G1_3 = det*w[5][3]*(1.0);
+    const double G1_4 = det*w[5][4]*(1.0);
+    const double G1_5 = det*w[5][5]*(1.0);
+    const double G2_0_0 = det*w[5][0]*w[11][0]*(1.0);
+    const double G2_1_0 = det*w[5][1]*w[11][0]*(1.0);
+    const double G2_2_0 = det*w[5][2]*w[11][0]*(1.0);
+    const double G2_3_0 = det*w[5][3]*w[11][0]*(1.0);
+    const double G2_4_0 = det*w[5][4]*w[11][0]*(1.0);
+    const double G2_5_0 = det*w[5][5]*w[11][0]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.333333333333333*G0_0_1 + 0.166666666666667*G0_0_2 + 0.333333333333333*G1_1 + 0.166666666666667*G1_2 - 0.333333333333333*G2_1_0 - 0.166666666666667*G2_2_0;
+      A[2] = 0.166666666666667*G0_0_1 + 0.333333333333333*G0_0_2 + 0.166666666666667*G1_1 + 0.333333333333333*G1_2 - 0.166666666666667*G2_1_0 - 0.333333333333333*G2_2_0;
+      A[3] = 0.0;
+      A[4] = 0.333333333333333*G0_0_4 + 0.166666666666667*G0_0_5 + 0.333333333333333*G1_4 + 0.166666666666667*G1_5 - 0.333333333333333*G2_4_0 - 0.166666666666667*G2_5_0;
+      A[5] = 0.166666666666667*G0_0_4 + 0.333333333333333*G0_0_5 + 0.166666666666667*G1_4 + 0.333333333333333*G1_5 - 0.166666666666667*G2_4_0 - 0.333333333333333*G2_5_0;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.333333333333333*G0_0_0 + 0.166666666666667*G0_0_2 + 0.333333333333333*G1_0 + 0.166666666666667*G1_2 - 0.333333333333333*G2_0_0 - 0.166666666666667*G2_2_0;
+      A[1] = 0.0;
+      A[2] = 0.166666666666667*G0_0_0 + 0.333333333333333*G0_0_2 + 0.166666666666667*G1_0 + 0.333333333333333*G1_2 - 0.166666666666667*G2_0_0 - 0.333333333333333*G2_2_0;
+      A[3] = 0.333333333333333*G0_0_3 + 0.166666666666667*G0_0_5 + 0.333333333333333*G1_3 + 0.166666666666667*G1_5 - 0.333333333333333*G2_3_0 - 0.166666666666667*G2_5_0;
+      A[4] = 0.0;
+      A[5] = 0.166666666666667*G0_0_3 + 0.333333333333333*G0_0_5 + 0.166666666666667*G1_3 + 0.333333333333333*G1_5 - 0.166666666666667*G2_3_0 - 0.333333333333333*G2_5_0;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.333333333333333*G0_0_0 + 0.166666666666667*G0_0_1 + 0.333333333333333*G1_0 + 0.166666666666667*G1_1 - 0.333333333333333*G2_0_0 - 0.166666666666667*G2_1_0;
+      A[1] = 0.166666666666667*G0_0_0 + 0.333333333333333*G0_0_1 + 0.166666666666667*G1_0 + 0.333333333333333*G1_1 - 0.166666666666667*G2_0_0 - 0.333333333333333*G2_1_0;
+      A[2] = 0.0;
+      A[3] = 0.333333333333333*G0_0_3 + 0.166666666666667*G0_0_4 + 0.333333333333333*G1_3 + 0.166666666666667*G1_4 - 0.333333333333333*G2_3_0 - 0.166666666666667*G2_4_0;
+      A[4] = 0.166666666666667*G0_0_3 + 0.333333333333333*G0_0_4 + 0.166666666666667*G1_3 + 0.333333333333333*G1_4 - 0.166666666666667*G2_3_0 - 0.333333333333333*G2_4_0;
+      A[5] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elastodynamics_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  elastodynamics_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "2b90ed81a87c75fd30bc586eaa8d1f67b4b60bdfcc4131a1a0a0eca0945066fcda00bb31d4379c8ede465c7449f4237297ee03ac0bf1f5c8d17ba805ecf617f5";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 9;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 3:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 4:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 5:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 6:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 7:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 8:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 9:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 10:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 3:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 4:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 5:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 6:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 7:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 8:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 9:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 10:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elastodynamics_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class elastodynamics_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  elastodynamics_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~elastodynamics_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "83670c41a0910123d77f470d3a3df4f713e926246257ddd53982cb599f86da8098b3b0fae539e69000688b8e1f8024d6338ed480a01de3445486dce7c7083d14";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 15;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 4;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 1:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 2:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 3:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 4:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 5:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 6:
+      {
+        return new elastodynamics_finite_element_2();
+        break;
+      }
+    case 7:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 8:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 9:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 10:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 11:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 12:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 13:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 14:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    case 15:
+      {
+        return new elastodynamics_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 1:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 2:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 3:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 4:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 5:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 6:
+      {
+        return new elastodynamics_dofmap_2();
+        break;
+      }
+    case 7:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 8:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 9:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 10:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 11:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 12:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 13:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 14:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    case 15:
+      {
+        return new elastodynamics_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 3:
+      {
+        return new elastodynamics_exterior_facet_integral_1_3();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new elastodynamics_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace ElastoDynamics
+{
+
+class CoefficientSpace_a0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_a0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_a0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_a0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_a0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_a0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_a0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_a0()
+  {
+  }
+
+};
+
+class CoefficientSpace_alpha_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_alpha_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_alpha_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_alpha_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_alpha_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_alpha_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_alpha_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_alpha_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_alpha_m: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_alpha_m(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_alpha_m(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_alpha_m(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_alpha_m(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_alpha_m(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_alpha_m(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_alpha_m()
+  {
+  }
+
+};
+
+class CoefficientSpace_beta: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_beta(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_beta(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_beta(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_beta(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_beta(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_beta(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_beta()
+  {
+  }
+
+};
+
+class CoefficientSpace_dt: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_dt(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_dt(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_dt(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_dt(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_dt()
+  {
+  }
+
+};
+
+class CoefficientSpace_eta: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_eta(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_eta(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_eta(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_eta(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_eta(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_eta(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_eta()
+  {
+  }
+
+};
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_gamma: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_gamma(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_gamma(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_gamma(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_gamma(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_gamma(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_gamma(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_gamma()
+  {
+  }
+
+};
+
+class CoefficientSpace_lmbda: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_lmbda(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_lmbda(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_lmbda()
+  {
+  }
+
+};
+
+class CoefficientSpace_mu: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_mu(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_mu(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_mu(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_mu()
+  {
+  }
+
+};
+
+class CoefficientSpace_p: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_p(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_p(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_p()
+  {
+  }
+
+};
+
+class CoefficientSpace_p0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_p0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_p0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_p0()
+  {
+  }
+
+};
+
+class CoefficientSpace_rho: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_rho(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_rho(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_rho(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_rho(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_rho(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_rho(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_rho()
+  {
+  }
+
+};
+
+class CoefficientSpace_u0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u0()
+  {
+  }
+
+};
+
+class CoefficientSpace_v0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_v0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_v0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_v0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_v0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_v0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_v0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_v0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_rho Form_a_FunctionSpace_2;
+
+typedef CoefficientSpace_eta Form_a_FunctionSpace_3;
+
+typedef CoefficientSpace_lmbda Form_a_FunctionSpace_4;
+
+typedef CoefficientSpace_mu Form_a_FunctionSpace_5;
+
+typedef CoefficientSpace_alpha_m Form_a_FunctionSpace_6;
+
+typedef CoefficientSpace_alpha_f Form_a_FunctionSpace_7;
+
+typedef CoefficientSpace_beta Form_a_FunctionSpace_8;
+
+typedef CoefficientSpace_gamma Form_a_FunctionSpace_9;
+
+typedef CoefficientSpace_dt Form_a_FunctionSpace_10;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 9), rho(*this, 0), eta(*this, 1), lmbda(*this, 2), mu(*this, 3), alpha_m(*this, 4), alpha_f(*this, 5), beta(*this, 6), gamma(*this, 7), dt(*this, 8)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& rho, const dolfin::GenericFunction& eta, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& alpha_m, const dolfin::GenericFunction& alpha_f, const dolfin::GenericFunction& beta, const dolfin::GenericFunction& gamma, const dolfin::GenericFunction& dt):
+    dolfin::Form(2, 9), rho(*this, 0), eta(*this, 1), lmbda(*this, 2), mu(*this, 3), alpha_m(*this, 4), alpha_f(*this, 5), beta(*this, 6), gamma(*this, 7), dt(*this, 8)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->rho = rho;
+    this->eta = eta;
+    this->lmbda = lmbda;
+    this->mu = mu;
+    this->alpha_m = alpha_m;
+    this->alpha_f = alpha_f;
+    this->beta = beta;
+    this->gamma = gamma;
+    this->dt = dt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> rho, std::shared_ptr<const dolfin::GenericFunction> eta, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> alpha_m, std::shared_ptr<const dolfin::GenericFunction> alpha_f, std::shared_ptr<const dolfin::GenericFunction> beta, std::shared_ptr<const dolfin::GenericFunction> gamma, std::shared_ptr<const dolfin::GenericFunction> dt):
+    dolfin::Form(2, 9), rho(*this, 0), eta(*this, 1), lmbda(*this, 2), mu(*this, 3), alpha_m(*this, 4), alpha_f(*this, 5), beta(*this, 6), gamma(*this, 7), dt(*this, 8)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    this->rho = *rho;
+    this->eta = *eta;
+    this->lmbda = *lmbda;
+    this->mu = *mu;
+    this->alpha_m = *alpha_m;
+    this->alpha_f = *alpha_f;
+    this->beta = *beta;
+    this->gamma = *gamma;
+    this->dt = *dt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 9), rho(*this, 0), eta(*this, 1), lmbda(*this, 2), mu(*this, 3), alpha_m(*this, 4), alpha_f(*this, 5), beta(*this, 6), gamma(*this, 7), dt(*this, 8)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& rho, const dolfin::GenericFunction& eta, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& alpha_m, const dolfin::GenericFunction& alpha_f, const dolfin::GenericFunction& beta, const dolfin::GenericFunction& gamma, const dolfin::GenericFunction& dt):
+    dolfin::Form(2, 9), rho(*this, 0), eta(*this, 1), lmbda(*this, 2), mu(*this, 3), alpha_m(*this, 4), alpha_f(*this, 5), beta(*this, 6), gamma(*this, 7), dt(*this, 8)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->rho = rho;
+    this->eta = eta;
+    this->lmbda = lmbda;
+    this->mu = mu;
+    this->alpha_m = alpha_m;
+    this->alpha_f = alpha_f;
+    this->beta = beta;
+    this->gamma = gamma;
+    this->dt = dt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> rho, std::shared_ptr<const dolfin::GenericFunction> eta, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> alpha_m, std::shared_ptr<const dolfin::GenericFunction> alpha_f, std::shared_ptr<const dolfin::GenericFunction> beta, std::shared_ptr<const dolfin::GenericFunction> gamma, std::shared_ptr<const dolfin::GenericFunction> dt):
+    dolfin::Form(2, 9), rho(*this, 0), eta(*this, 1), lmbda(*this, 2), mu(*this, 3), alpha_m(*this, 4), alpha_f(*this, 5), beta(*this, 6), gamma(*this, 7), dt(*this, 8)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    this->rho = *rho;
+    this->eta = *eta;
+    this->lmbda = *lmbda;
+    this->mu = *mu;
+    this->alpha_m = *alpha_m;
+    this->alpha_f = *alpha_f;
+    this->beta = *beta;
+    this->gamma = *gamma;
+    this->dt = *dt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "rho")
+      return 0;
+    else if (name == "eta")
+      return 1;
+    else if (name == "lmbda")
+      return 2;
+    else if (name == "mu")
+      return 3;
+    else if (name == "alpha_m")
+      return 4;
+    else if (name == "alpha_f")
+      return 5;
+    else if (name == "beta")
+      return 6;
+    else if (name == "gamma")
+      return 7;
+    else if (name == "dt")
+      return 8;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "rho";
+    case 1:
+      return "eta";
+    case 2:
+      return "lmbda";
+    case 3:
+      return "mu";
+    case 4:
+      return "alpha_m";
+    case 5:
+      return "alpha_f";
+    case 6:
+      return "beta";
+    case 7:
+      return "gamma";
+    case 8:
+      return "dt";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+  typedef Form_a_FunctionSpace_2 CoefficientSpace_rho;
+  typedef Form_a_FunctionSpace_3 CoefficientSpace_eta;
+  typedef Form_a_FunctionSpace_4 CoefficientSpace_lmbda;
+  typedef Form_a_FunctionSpace_5 CoefficientSpace_mu;
+  typedef Form_a_FunctionSpace_6 CoefficientSpace_alpha_m;
+  typedef Form_a_FunctionSpace_7 CoefficientSpace_alpha_f;
+  typedef Form_a_FunctionSpace_8 CoefficientSpace_beta;
+  typedef Form_a_FunctionSpace_9 CoefficientSpace_gamma;
+  typedef Form_a_FunctionSpace_10 CoefficientSpace_dt;
+
+  // Coefficients
+  dolfin::CoefficientAssigner rho;
+  dolfin::CoefficientAssigner eta;
+  dolfin::CoefficientAssigner lmbda;
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner alpha_m;
+  dolfin::CoefficientAssigner alpha_f;
+  dolfin::CoefficientAssigner beta;
+  dolfin::CoefficientAssigner gamma;
+  dolfin::CoefficientAssigner dt;
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new elastodynamics_finite_element_2()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new elastodynamics_dofmap_2()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u0 Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_v0 Form_L_FunctionSpace_2;
+
+typedef CoefficientSpace_a0 Form_L_FunctionSpace_3;
+
+typedef CoefficientSpace_p0 Form_L_FunctionSpace_4;
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_5;
+
+typedef CoefficientSpace_p Form_L_FunctionSpace_6;
+
+typedef CoefficientSpace_rho Form_L_FunctionSpace_7;
+
+typedef CoefficientSpace_eta Form_L_FunctionSpace_8;
+
+typedef CoefficientSpace_lmbda Form_L_FunctionSpace_9;
+
+typedef CoefficientSpace_mu Form_L_FunctionSpace_10;
+
+typedef CoefficientSpace_alpha_m Form_L_FunctionSpace_11;
+
+typedef CoefficientSpace_alpha_f Form_L_FunctionSpace_12;
+
+typedef CoefficientSpace_beta Form_L_FunctionSpace_13;
+
+typedef CoefficientSpace_gamma Form_L_FunctionSpace_14;
+
+typedef CoefficientSpace_dt Form_L_FunctionSpace_15;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 15), u0(*this, 0), v0(*this, 1), a0(*this, 2), p0(*this, 3), f(*this, 4), p(*this, 5), rho(*this, 6), eta(*this, 7), lmbda(*this, 8), mu(*this, 9), alpha_m(*this, 10), alpha_f(*this, 11), beta(*this, 12), gamma(*this, 13), dt(*this, 14)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& v0, const dolfin::GenericFunction& a0, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& p, const dolfin::GenericFunction& rho, const dolfin::GenericFunction& eta, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& alpha_m, const dolfin::GenericFunction& alpha_f, const dolfin::GenericFunction& beta, const dolfin::GenericFunction& gamma, const dolfin::GenericFunction& dt):
+    dolfin::Form(1, 15), u0(*this, 0), v0(*this, 1), a0(*this, 2), p0(*this, 3), f(*this, 4), p(*this, 5), rho(*this, 6), eta(*this, 7), lmbda(*this, 8), mu(*this, 9), alpha_m(*this, 10), alpha_f(*this, 11), beta(*this, 12), gamma(*this, 13), dt(*this, 14)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u0 = u0;
+    this->v0 = v0;
+    this->a0 = a0;
+    this->p0 = p0;
+    this->f = f;
+    this->p = p;
+    this->rho = rho;
+    this->eta = eta;
+    this->lmbda = lmbda;
+    this->mu = mu;
+    this->alpha_m = alpha_m;
+    this->alpha_f = alpha_f;
+    this->beta = beta;
+    this->gamma = gamma;
+    this->dt = dt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> v0, std::shared_ptr<const dolfin::GenericFunction> a0, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> p, std::shared_ptr<const dolfin::GenericFunction> rho, std::shared_ptr<const dolfin::GenericFunction> eta, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> alpha_m, std::shared_ptr<const dolfin::GenericFunction> alpha_f, std::shared_ptr<const dolfin::GenericFunction> beta, std::shared_ptr<const dolfin::GenericFunction> gamma, std::shared_ptr<const dolfin::GenericFunction> dt):
+    dolfin::Form(1, 15), u0(*this, 0), v0(*this, 1), a0(*this, 2), p0(*this, 3), f(*this, 4), p(*this, 5), rho(*this, 6), eta(*this, 7), lmbda(*this, 8), mu(*this, 9), alpha_m(*this, 10), alpha_f(*this, 11), beta(*this, 12), gamma(*this, 13), dt(*this, 14)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u0 = *u0;
+    this->v0 = *v0;
+    this->a0 = *a0;
+    this->p0 = *p0;
+    this->f = *f;
+    this->p = *p;
+    this->rho = *rho;
+    this->eta = *eta;
+    this->lmbda = *lmbda;
+    this->mu = *mu;
+    this->alpha_m = *alpha_m;
+    this->alpha_f = *alpha_f;
+    this->beta = *beta;
+    this->gamma = *gamma;
+    this->dt = *dt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 15), u0(*this, 0), v0(*this, 1), a0(*this, 2), p0(*this, 3), f(*this, 4), p(*this, 5), rho(*this, 6), eta(*this, 7), lmbda(*this, 8), mu(*this, 9), alpha_m(*this, 10), alpha_f(*this, 11), beta(*this, 12), gamma(*this, 13), dt(*this, 14)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u0, const dolfin::GenericFunction& v0, const dolfin::GenericFunction& a0, const dolfin::GenericFunction& p0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& p, const dolfin::GenericFunction& rho, const dolfin::GenericFunction& eta, const dolfin::GenericFunction& lmbda, const dolfin::GenericFunction& mu, const dolfin::GenericFunction& alpha_m, const dolfin::GenericFunction& alpha_f, const dolfin::GenericFunction& beta, const dolfin::GenericFunction& gamma, const dolfin::GenericFunction& dt):
+    dolfin::Form(1, 15), u0(*this, 0), v0(*this, 1), a0(*this, 2), p0(*this, 3), f(*this, 4), p(*this, 5), rho(*this, 6), eta(*this, 7), lmbda(*this, 8), mu(*this, 9), alpha_m(*this, 10), alpha_f(*this, 11), beta(*this, 12), gamma(*this, 13), dt(*this, 14)
+  {
+    _function_spaces[0] = V0;
+
+    this->u0 = u0;
+    this->v0 = v0;
+    this->a0 = a0;
+    this->p0 = p0;
+    this->f = f;
+    this->p = p;
+    this->rho = rho;
+    this->eta = eta;
+    this->lmbda = lmbda;
+    this->mu = mu;
+    this->alpha_m = alpha_m;
+    this->alpha_f = alpha_f;
+    this->beta = beta;
+    this->gamma = gamma;
+    this->dt = dt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u0, std::shared_ptr<const dolfin::GenericFunction> v0, std::shared_ptr<const dolfin::GenericFunction> a0, std::shared_ptr<const dolfin::GenericFunction> p0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> p, std::shared_ptr<const dolfin::GenericFunction> rho, std::shared_ptr<const dolfin::GenericFunction> eta, std::shared_ptr<const dolfin::GenericFunction> lmbda, std::shared_ptr<const dolfin::GenericFunction> mu, std::shared_ptr<const dolfin::GenericFunction> alpha_m, std::shared_ptr<const dolfin::GenericFunction> alpha_f, std::shared_ptr<const dolfin::GenericFunction> beta, std::shared_ptr<const dolfin::GenericFunction> gamma, std::shared_ptr<const dolfin::GenericFunction> dt):
+    dolfin::Form(1, 15), u0(*this, 0), v0(*this, 1), a0(*this, 2), p0(*this, 3), f(*this, 4), p(*this, 5), rho(*this, 6), eta(*this, 7), lmbda(*this, 8), mu(*this, 9), alpha_m(*this, 10), alpha_f(*this, 11), beta(*this, 12), gamma(*this, 13), dt(*this, 14)
+  {
+    _function_spaces[0] = V0;
+
+    this->u0 = *u0;
+    this->v0 = *v0;
+    this->a0 = *a0;
+    this->p0 = *p0;
+    this->f = *f;
+    this->p = *p;
+    this->rho = *rho;
+    this->eta = *eta;
+    this->lmbda = *lmbda;
+    this->mu = *mu;
+    this->alpha_m = *alpha_m;
+    this->alpha_f = *alpha_f;
+    this->beta = *beta;
+    this->gamma = *gamma;
+    this->dt = *dt;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new elastodynamics_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u0")
+      return 0;
+    else if (name == "v0")
+      return 1;
+    else if (name == "a0")
+      return 2;
+    else if (name == "p0")
+      return 3;
+    else if (name == "f")
+      return 4;
+    else if (name == "p")
+      return 5;
+    else if (name == "rho")
+      return 6;
+    else if (name == "eta")
+      return 7;
+    else if (name == "lmbda")
+      return 8;
+    else if (name == "mu")
+      return 9;
+    else if (name == "alpha_m")
+      return 10;
+    else if (name == "alpha_f")
+      return 11;
+    else if (name == "beta")
+      return 12;
+    else if (name == "gamma")
+      return 13;
+    else if (name == "dt")
+      return 14;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u0";
+    case 1:
+      return "v0";
+    case 2:
+      return "a0";
+    case 3:
+      return "p0";
+    case 4:
+      return "f";
+    case 5:
+      return "p";
+    case 6:
+      return "rho";
+    case 7:
+      return "eta";
+    case 8:
+      return "lmbda";
+    case 9:
+      return "mu";
+    case 10:
+      return "alpha_m";
+    case 11:
+      return "alpha_f";
+    case 12:
+      return "beta";
+    case 13:
+      return "gamma";
+    case 14:
+      return "dt";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_u0;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_v0;
+  typedef Form_L_FunctionSpace_3 CoefficientSpace_a0;
+  typedef Form_L_FunctionSpace_4 CoefficientSpace_p0;
+  typedef Form_L_FunctionSpace_5 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_6 CoefficientSpace_p;
+  typedef Form_L_FunctionSpace_7 CoefficientSpace_rho;
+  typedef Form_L_FunctionSpace_8 CoefficientSpace_eta;
+  typedef Form_L_FunctionSpace_9 CoefficientSpace_lmbda;
+  typedef Form_L_FunctionSpace_10 CoefficientSpace_mu;
+  typedef Form_L_FunctionSpace_11 CoefficientSpace_alpha_m;
+  typedef Form_L_FunctionSpace_12 CoefficientSpace_alpha_f;
+  typedef Form_L_FunctionSpace_13 CoefficientSpace_beta;
+  typedef Form_L_FunctionSpace_14 CoefficientSpace_gamma;
+  typedef Form_L_FunctionSpace_15 CoefficientSpace_dt;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u0;
+  dolfin::CoefficientAssigner v0;
+  dolfin::CoefficientAssigner a0;
+  dolfin::CoefficientAssigner p0;
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner p;
+  dolfin::CoefficientAssigner rho;
+  dolfin::CoefficientAssigner eta;
+  dolfin::CoefficientAssigner lmbda;
+  dolfin::CoefficientAssigner mu;
+  dolfin::CoefficientAssigner alpha_m;
+  dolfin::CoefficientAssigner alpha_f;
+  dolfin::CoefficientAssigner beta;
+  dolfin::CoefficientAssigner gamma;
+  dolfin::CoefficientAssigner dt;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/elastodynamics/cpp/ElastoDynamics.ufl b/demo/undocumented/elastodynamics/cpp/ElastoDynamics.ufl
new file mode 100644
index 0000000..d7b9f08
--- /dev/null
+++ b/demo/undocumented/elastodynamics/cpp/ElastoDynamics.ufl
@@ -0,0 +1,77 @@
+# Copyright (c) 2009 Mirko Maraldi and Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-01-22
+# Last changed: 2009-01-27
+#
+# The bilinear form and linear form for linear elastodynamics
+# using the generalised-alpha method
+#
+# Compile this form with FFC: ffc -l dolfin ElastoDynamics.ufl.
+
+element = VectorElement("Lagrange", triangle, 1)
+DG0     = FiniteElement("Discontinuous Lagrange", triangle, 0)
+
+# Test and trial functions
+r = TestFunction(element)
+u = TrialFunction(element)
+
+# Fields from previous time step
+u0      = Coefficient(element)   # displacement
+v0      = Coefficient(element)   # velocity
+a0      = Coefficient(element)   # acceleration
+p0      = Coefficient(element)   # external load
+
+# External forces
+f       = Coefficient(element)  # body forces
+p       = Coefficient(element)   # externally applied loads
+
+# Material parameters
+rho     = Coefficient(DG0)  # mass density
+eta     = Coefficient(DG0)  # damping coefficient
+lmbda   = Coefficient(DG0)  # Lame coefficient
+mu      = Coefficient(DG0)  # Lame coefficient
+
+# Time stepping parameters
+alpha_m = Coefficient(DG0)
+alpha_f = Coefficient(DG0)
+beta    = Coefficient(DG0)
+gamma   = Coefficient(DG0)
+dt      = Coefficient(DG0)
+
+factor_m1  = rho*(1.0-alpha_m)/(beta*dt*dt)
+factor_m2  = rho*(1.0-alpha_m)/(beta*dt)
+factor_m3  = rho*(1.0-alpha_m-2.0*beta)/(2.0*beta)
+
+factor_d1  = eta*(1.0-alpha_f)*gamma/(beta*dt)
+factor_d2  = eta*((1.0-alpha_f)*gamma-beta)/beta
+factor_d3  = eta*(gamma-2.0*beta)*(1.0-alpha_f)*dt/(2.0*beta)
+
+# Stress tensor
+def sigma(r):
+    return 2.0*mu*sym(grad(r)) + lmbda*tr(sym(grad(r)))*Identity(r.geometric_dimension())
+
+# Forms
+a = factor_m1*inner(r, u)*dx  \
+   +factor_d1*inner(r, u)*dx \
+   +(1.0-alpha_f)*inner(grad(r), sigma(u))*dx
+
+L =  factor_m1*inner(r, u0)*dx + factor_m2*inner(r, v0)*dx + factor_m3*inner(r, a0)*dx  \
+   + factor_d1*inner(r, u0)*dx + factor_d2*inner(r, v0)*dx + factor_d3*inner(r, a0)*dx  \
+   - alpha_f*inner(grad(r), sigma(u0))*dx \
+   + inner(r, f)*dx + (1.0-alpha_f)*inner(r, p)*ds(3) + alpha_f*inner(r, p0)*ds(3)
+
diff --git a/demo/undocumented/elastodynamics/cpp/compile.log b/demo/undocumented/elastodynamics/cpp/compile.log
new file mode 100644
index 0000000..7ebb6dc
--- /dev/null
+++ b/demo/undocumented/elastodynamics/cpp/compile.log
@@ -0,0 +1,1260 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form DG0_eps_xx
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, eps]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'DG0(?)'
+  Unique sub elements:    'DG0(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[u]'
+  Unique elements:        'DG0(?), Vector<2 x CG1(?)>'
+  Unique sub elements:    'DG0(?), Vector<2 x CG1(?)>, CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0185711 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  1 entries computed in 0.000473 seconds
+  Shape of reference tensor: (1, 1)
+  Primary multi index:   rank = 2 dims = [1, 1] indices = [[0, 0]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  12 entries computed in 0.00127 seconds
+  Shape of reference tensor: (1, 6, 2)
+  Primary multi index:   rank = 1 dims = [1] indices = [[0]]
+  Secondary multi index: rank = 2 dims = [6, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [6, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1], [2, 0], [2, 1], [3, 0], [3, 1], [4, 0], [4, 1], [5, 0], [5, 1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00963116 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000253201 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.136804 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000684977 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./DG0_eps_xx.h.
+  
+Compiler stage 5 finished in 0.000957012 seconds.
+
+FFC finished in 0.167263 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form ElastoDynamics
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[r, u]'
+  Number of coefficients: 9
+  Coefficients:           '[w_6, w_7, w_8, w_9, w_{10}, w_{11}, w_{12}, w_{13}, w_{1
+                          4}]'
+  Coefficient names:      '[rho, eta, lmbda, mu, alpha_m, alpha_f, beta, gamma, dt]'
+  Unique elements:        'Vector<2 x CG1(?)>, DG0(?)'
+  Unique sub elements:    'Vector<2 x CG1(?)>, DG0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Identity.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                                'L'
+  Geometric dimension:                 2
+  Number of exterior_facet subdomains: 4
+  Rank:                                1
+  Arguments:                           '[v_0]'
+  Argument names:                      '[r]'
+  Number of coefficients:              15
+  Coefficients:                        '[w_0, w_1, w_2, w_3, w_4, w_5, w_6, w_7, w_8
+                                       , w_9, w_{10}, w_{11}, w_{12}, w_{13}, w_{14}
+                                       ]'
+  Coefficient names:                   '[u0, v0, a0, p0, f, p, rho, eta, lmbda, mu, 
+                                       alpha_m, alpha_f, beta, gamma, dt]'
+  Unique elements:                     'Vector<2 x CG1(?)>, DG0(?)'
+  Unique sub elements:                 'Vector<2 x CG1(?)>, DG0(?), CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal Identity.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0543108 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 3 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 3 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}, FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 0.99999999999999989, 0.99999999999999989]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667],
+         [ 0.16666667,  0.16666667,  0.66666667],
+         [ 0.16666667,  0.66666667,  0.16666667]]), 'FE0': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE1_C0': ('FE1_C0', (0, [0, 1, 2]), False, False), 'FE1_C1': ('FE1_C0', (3, [3, 4, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (5, [3, 4]), False, False), 'FE0': ('FE0', (), False, True), 'FE1_C1_D01': ('FE1_C0_D01', (4, [3, 5]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (2, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   1.11022302e-16,   1.11022302e-16],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.00000000e+00,   1.00000000e+00,   1.00000000e+00],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [ -1.00000000e+00,  -1.00000000e+00,  -1.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  0.00000000e+00,   1.11022302e-16,   1.11022302e-16]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.00000000e+00,   1.00000000e+00,   1.00000000e+00]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.66666667,  0.16666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.16666667,  0.66666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.16666667,  0.66666667,  0.16666667],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.66666667,  0.16666667,  0.16666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.16666667,  0.66666667]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.16666667,  0.66666667,  0.16666667]]])}}}, FiniteElement('Discontinuous Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 0, quad_scheme=None): {None: {None: {(0, 0): array([[1.0, 0.99999999999999989, 0.99999999999999989]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.16666667,  0.66666667,  0.        ,  0.        ,
+           0.        ],
+         [ 0.16666667,  0.66666667,  0.16666667,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.66666667,  0.16666667,
+           0.16666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.16666667,
+           0.66666667],
+         [ 0.        ,  0.        ,  0.        ,  0.16666667,  0.66666667,
+           0.16666667]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE1_C1_D01': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   0.00000000e+00,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+           -1.00000000e+00,   1.11022302e-16,   1.00000000e+00]]), 'FE1_C0_D01': array([[ -1.00000000e+00,   0.00000000e+00,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [ -1.00000000e+00,   1.11022302e-16,   1.00000000e+00,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[ 0.66666667,  0.16666667,  0.16666667],
+         [ 0.16666667,  0.16666667,  0.66666667],
+         [ 0.16666667,  0.66666667,  0.16666667]]), 'FE0': array([[1.0],
+         [0.99999999999999989],
+         [0.99999999999999989]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE1_C0': ('FE1_C0', (0, [0, 1, 2]), False, False), 'FE1_C1': ('FE1_C0', (3, [3, 4, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (5, [3, 4]), False, False), 'FE0': ('FE0', (), False, True), 'FE1_C1_D01': ('FE1_C0_D01', (4, [3, 5]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (2, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  36 entries computed in 0.00216 seconds
+  Shape of reference tensor: (6, 1, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 2 dims = [1, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 2 dims = [1, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.00161 seconds
+  Shape of reference tensor: (6, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  36 entries computed in 0.00203 seconds
+  Shape of reference tensor: (6, 6, 1)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 2 dims = [6, 1] indices = [[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [5, 0]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 2 dims = [6, 1] indices = [[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [5, 0]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  36 entries computed in 0.00194 seconds
+  Shape of reference tensor: (6, 1, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 2 dims = [1, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 2 dims = [1, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.00168 seconds
+  Shape of reference tensor: (6, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  36 entries computed in 0.00191 seconds
+  Shape of reference tensor: (6, 6, 1)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 2 dims = [6, 1] indices = [[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [5, 0]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 2 dims = [6, 1] indices = [[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [5, 0]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  36 entries computed in 0.00189 seconds
+  Shape of reference tensor: (6, 1, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 2 dims = [1, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 2 dims = [1, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.0015 seconds
+  Shape of reference tensor: (6, 6)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  36 entries computed in 0.00219 seconds
+  Shape of reference tensor: (6, 6, 1)
+  Primary multi index:   rank = 1 dims = [6] indices = [[0], [1], [2], [3], [4], [5]]
+  Secondary multi index: rank = 2 dims = [6, 1] indices = [[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [5, 0]]
+  Internal multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 2 dims = [6, 1] indices = [[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [5, 0]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.20273 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  Optimising expressions for cell integral
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.0432949 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 3 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp0
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: Y
+  Removing unused variable: X
+  Removing unused variable: C1
+  Removing unused variable: C0
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 3 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.180326 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00246692 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./ElastoDynamics.h.
+  
+Compiler stage 5 finished in 0.00210595 seconds.
+
+FFC finished in 0.485807 seconds.
diff --git a/demo/undocumented/elastodynamics/cpp/main.cpp b/demo/undocumented/elastodynamics/cpp/main.cpp
new file mode 100644
index 0000000..e35142a
--- /dev/null
+++ b/demo/undocumented/elastodynamics/cpp/main.cpp
@@ -0,0 +1,233 @@
+// Copyright (C) 2009 Mirko Maraldi and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011
+//
+// First added:  2009-01-22
+// Last changed: 2011-06-28
+
+#include <dolfin.h>
+#include "ElastoDynamics.h"
+#include "DG0_eps_xx.h"
+
+using namespace dolfin;
+
+// External load
+class Pressure : public Expression
+{
+public:
+
+  Pressure(const double& t, const double& dt, bool old)
+    : Expression(2), t(t), dt(dt), old(old) {}
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    double time = t;
+    if(old && time > 0.0)
+      time -= dt;
+
+    const double cutoff_time = 10.0*1.0/32.0;
+    if (time < cutoff_time)
+    {
+      values[0] = 1.0*time/cutoff_time;
+      values[1] = 0.0;
+    }
+    else
+    {
+      values[0] = 1.0;
+      values[1] = 0.0;
+    }
+  }
+
+private:
+
+  const double& t;
+  const double& dt;
+  const bool old;
+};
+
+// Right boundary
+class RightBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    if (1.0 - x[0] < DOLFIN_EPS && on_boundary)
+      return true;
+    else
+      return false;
+  }
+};
+
+class LeftBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    if (x[0] < DOLFIN_EPS)
+      return true;
+    else
+      return false;
+  }
+};
+
+// Acceleration update
+void update_a(Function& a, const Function& u, const Function& a0,
+              const Function& v0,  const Function& u0,
+              double beta, double dt)
+{
+  // a = 1/(2*beta)*((u - u0 - v0*dt)/(0.5*dt*dt) - (1-2*beta)*a0)
+  *a.vector()  = *u.vector();
+  *a.vector() -= *u0.vector();
+  *a.vector() *= 1.0/dt;
+  *a.vector() -= *v0.vector();
+  *a.vector() *= 1.0/((0.5-beta)*dt);
+  *a.vector() -= *a0.vector();
+  *a.vector() *= (0.5-beta)/beta;
+}
+
+// Velocity update
+void update_v(Function& v, const Function& a, const Function& a0,
+              const Function& v0, double gamma, double dt)
+{
+  // v = dt * ((1-gamma)*a0 + gamma*a) + v0
+  *v.vector()  = *a0.vector();
+  *v.vector() *= (1.0-gamma)/gamma;
+  *v.vector() += *a.vector();
+  *v.vector() *= dt*gamma;
+  *v.vector() += *v0.vector();
+}
+
+int main(int argc, char* argv[])
+{
+  init(argc, argv);
+
+  // Create mesh
+  Mesh mesh("../dolfin_fine.xml.gz");
+
+  // Create function space
+  ElastoDynamics::FunctionSpace V(mesh);
+
+  // Material parameters
+  Constant rho(1.0);                           // mass density
+  Constant eta(0.25);                          // damping coefficient
+  double E  = 1.0;                             // Youngs modulus
+  double nu = 0.0;                             // Poisson ratio
+  Constant lambda((nu*E)/((1.0 + nu)*(1.0 - nu))); // Lame coefficient
+  Constant mu(E/(2.0*(1.0 + nu)));               // Lame coefficient
+
+  // Time stepping parameters
+  Constant alpha_m(0.2);
+  Constant alpha_f(0.4);
+  Constant beta(0.36);
+  Constant gamma(0.7);
+  Constant dt(1.0/32.0);    // time step
+  double t = 0.0;           // initial time
+  double T = 200*dt;        // final time
+
+  // Body force
+  Constant f(0.0, 0.0);
+
+  // External load
+  RightBoundary right_boundary;
+  MeshFunction<std::size_t> right_boundary_function(mesh, 1);
+  right_boundary.mark(right_boundary_function, 3);
+  Pressure p(t, dt, false), p0(t, dt, true);
+
+  // Dirichlet boundary conditions
+  LeftBoundary left_boundary;
+  Constant zero(0.0, 0.0);
+  DirichletBC bc0(V, zero, left_boundary);
+  std::vector<const DirichletBC*> bc;
+  bc.push_back(&bc0);
+
+  // Define solution vectors
+  Function u(V), u0(V);  // displacement
+  Function v(V), v0(V);  // velocity
+  Function a(V), a0(V);  // acceleration
+
+  // Set initial conditions and initialise acceleration function
+  u0.vector()->zero();
+  v0.vector()->zero();
+  a0.vector()->zero();
+
+  // Create forms
+  ElastoDynamics::BilinearForm a_form(V, V);
+  ElastoDynamics::LinearForm L(V);
+
+  // Attach functions
+  a_form.lmbda = lambda; a_form.mu = mu; a_form.rho = rho;
+  a_form.eta = eta;
+  a_form.beta = beta;
+  a_form.gamma = gamma;
+  a_form.dt = dt;
+  a_form.alpha_m = alpha_m;
+  a_form.alpha_f = alpha_f;
+
+  L.lmbda = lambda; L.mu = mu; L.rho = rho;
+  L.eta = eta;
+  L.beta = beta;
+  L.gamma = gamma;
+  L.dt = dt;
+  L.alpha_m = alpha_m;
+  L.alpha_f = alpha_f;
+  L.u0 = u0; L.v0 = v0; L.a0 = a0;
+  L.f = f;
+  L.p = p;
+  L.p0 = p0;
+
+  // Attach subdomains
+  a_form.ds = right_boundary_function;
+  L.ds = right_boundary_function;
+
+  // Create projection to compute the normal strain eps_xx
+  DG0_eps_xx::FunctionSpace Vdg(mesh);
+  DG0_eps_xx::BilinearForm a_eps(Vdg, Vdg);
+  DG0_eps_xx::LinearForm L_eps(Vdg);
+  L_eps.u = u;
+  Function eps_xx(Vdg);
+
+  // Create output files
+  File file_u("u.pvd", "compressed");
+  File file_eps("eps_xx.pvd", "compressed");
+
+  // Start time stepping
+  std::size_t step = 0;
+  while (t < T)
+  {
+    // Update for next time step
+    t += dt;
+    cout << "Time: " << t << endl;
+
+    // Solve
+    solve(a_form == L, u, bc);
+    solve(a_eps == L_eps, eps_xx);
+
+    // Update velocity and acceleration
+    update_a(a, u, a0, v0, u0, beta, dt);
+    update_v(v, a, a0, v0, gamma, dt);
+    u0 = u; v0 = v; a0 = a;
+
+    // Save solutions to file
+    if (step % 2 == 0)
+    {
+      file_u << u;
+      file_eps << eps_xx;
+    }
+    ++step;
+  }
+
+  return 0;
+}
diff --git a/demo/undocumented/elastodynamics/dolfin_fine.xml.gz b/demo/undocumented/elastodynamics/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/undocumented/elastodynamics/python/demo_elastodynamics.py b/demo/undocumented/elastodynamics/python/demo_elastodynamics.py
new file mode 100644
index 0000000..afdc675
--- /dev/null
+++ b/demo/undocumented/elastodynamics/python/demo_elastodynamics.py
@@ -0,0 +1,177 @@
+"""This demo program solves an elastodynamics problem."""
+
+# Copyright (C) 2010 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2008-2011
+#
+# First added:  2010-04-30
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Form compiler options
+parameters["form_compiler"]["cpp_optimize"] = True
+parameters["form_compiler"]["optimize"] = True
+
+def update(u, u0, v0, a0, beta, gamma, dt):
+    """Update fields at the end of each time step."""
+
+    # Get vectors (references)
+    u_vec, u0_vec  = u.vector(), u0.vector()
+    v0_vec, a0_vec = v0.vector(), a0.vector()
+
+    # Update acceleration and velocity
+
+    # a = 1/(2*beta)*((u - u0 - v0*dt)/(0.5*dt*dt) - (1-2*beta)*a0)
+    a_vec = (1.0/(2.0*beta))*( (u_vec - u0_vec - v0_vec*dt)/(0.5*dt*dt) - (1.0-2.0*beta)*a0_vec )
+
+    # v = dt * ((1-gamma)*a0 + gamma*a) + v0
+    v_vec = dt*((1.0-gamma)*a0_vec + gamma*a_vec) + v0_vec
+
+    # Update (u0 <- u0)
+    v0.vector()[:], a0.vector()[:] = v_vec, a_vec
+    u0.vector()[:] = u.vector()
+
+# External load
+class Traction(Expression):
+
+    def __init__(self, dt, t, old):
+        self.t   = t
+        self.dt  = dt
+        self.old = old
+
+    def eval(self, values, x):
+
+        # 'Shift' time for n-1 values
+        t_tmp = self.t
+        if self.old and t > 0.0:
+            t_tmp -= self.dt
+
+        cutoff_t = 10.0*1.0/32.0;
+        weight = t_tmp/cutoff_t if t_tmp < cutoff_t else 1.0
+
+        values[0] = 1.0*weight
+        values[1] = 0.0
+
+    def value_shape(self):
+        return (2,)
+
+# Sub domain for clamp at left end
+def left(x, on_boundary):
+    return x[0] < 0.001 and on_boundary
+
+# Sub domain for rotation at right end
+def right(x, on_boundary):
+    return x[0] > 0.99 and on_boundary
+
+# Load mesh and define function space
+mesh = Mesh("../dolfin_fine.xml.gz")
+
+# Define function space
+V = VectorFunctionSpace(mesh, "CG", 1)
+
+# Test and trial functions
+u = TrialFunction(V)
+r = TestFunction(V)
+
+E  = 1.0
+nu = 0.0
+mu    = E / (2.0*(1.0 + nu))
+lmbda = E*nu / ((1.0 + nu)*(1.0 - 2.0*nu))
+
+# Mass density andviscous damping coefficient
+rho = 1.0
+eta = 0.25
+
+# Time stepping parameters
+alpha_m = 0.2
+alpha_f = 0.4
+beta    = 0.36
+gamma   = 0.7
+dt      = 1.0/32.0
+t       = 0.0
+T       = 10*dt
+
+# Some useful factors
+factor_m1  = rho*(1.0-alpha_m)/(beta*dt*dt)
+factor_m2  = rho*(1.0-alpha_m)/(beta*dt)
+factor_m3  = rho*(1.0-alpha_m-2.0*beta)/(2.0*beta)
+
+factor_d1  = eta*(1.0-alpha_f)*gamma/(beta*dt)
+factor_d2  = eta*((1.0-alpha_f)*gamma-beta)/beta
+factor_d3  = eta*(gamma-2.0*beta)*(1.0-alpha_f)*dt/(2.0*beta)
+
+# Fields from previous time step (displacement, velocity, acceleration)
+u0 = Function(V)
+v0 = Function(V)
+a0 = Function(V)
+
+# External forces (body and applied tractions
+f  = Constant((0.0, 0.0))
+p  = Traction(dt, t, False)
+p0 = Traction(dt, t, True)
+
+# Create mesh function over the cell facets
+boundary_subdomains = MeshFunction("size_t", mesh, mesh.topology().dim() - 1)
+boundary_subdomains.set_all(0)
+force_boundary = AutoSubDomain(right)
+force_boundary.mark(boundary_subdomains, 3)
+
+# Define measure for boundary condition integral
+dss = ds[boundary_subdomains]
+
+# Stress tensor
+def sigma(r):
+    return 2.0*mu*sym(grad(r)) + lmbda*tr(sym(grad(r)))*Identity(r.geometric_dimension())
+
+# Forms
+a = factor_m1*inner(u, r)*dx + factor_d1*inner(u, r)*dx \
+   +(1.0-alpha_f)*inner(sigma(u), grad(r))*dx
+
+L =  factor_m1*inner(r, u0)*dx + factor_m2*inner(r, v0)*dx \
+   + factor_m3*inner(r, a0)*dx \
+   + factor_d1*inner(r, u0)*dx + factor_d2*inner(r, v0)*dx \
+   + factor_d3*inner(r, a0)*dx \
+   - alpha_f*inner(grad(r), sigma(u0))*dx \
+   + inner(r, f)*dx + (1.0-alpha_f)*inner(r, p)*dss(3) + alpha_f*inner(r, p0)*dss(3)
+
+# Set up boundary condition at left end
+zero = Constant((0.0, 0.0))
+bc = DirichletBC(V, zero, left)
+
+# FIXME: This demo needs some improved commenting
+
+# Time-stepping
+u = Function(V)
+vtk_file = File("elasticity.pvd")
+while t <= T:
+
+    t += dt
+    print "Time: ", t
+
+    p.t = t
+    p0.t = t
+
+    solve(a == L, u, bc)
+    update(u, u0, v0, a0, beta, gamma, dt)
+
+    # Save solution to VTK format
+    vtk_file << u
+
+# Plot solution
+plot(u, mode="displacement", interactive=True)
diff --git a/demo/undocumented/elementplot/python/demo_elementplot.py b/demo/undocumented/elementplot/python/demo_elementplot.py
new file mode 100644
index 0000000..785b89d
--- /dev/null
+++ b/demo/undocumented/elementplot/python/demo_elementplot.py
@@ -0,0 +1,26 @@
+"This demo illustrates how to plot a finite element."
+
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-12-08
+# Last changed: 2010-12-08
+
+from dolfin import *
+
+element = FiniteElement("Brezzi-Douglas-Marini", tetrahedron, 3)
+plot(element)
diff --git a/demo/undocumented/eval/cpp/CMakeLists.txt b/demo/undocumented/eval/cpp/CMakeLists.txt
new file mode 100644
index 0000000..b9111a8
--- /dev/null
+++ b/demo/undocumented/eval/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_eval)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/eval/cpp/Projection.h b/demo/undocumented/eval/cpp/Projection.h
new file mode 100644
index 0000000..d45e52b
--- /dev/null
+++ b/demo/undocumented/eval/cpp/Projection.h
@@ -0,0 +1,4575 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __PROJECTION_H
+#define __PROJECTION_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class projection_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  projection_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new projection_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class projection_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  projection_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new projection_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class projection_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  projection_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 50
+    // Total number of operations (multiply-add pairs):                  53
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.00238095238095238*G0_;
+    A[1] = 0.000396825396825396*G0_;
+    A[2] = 0.000396825396825396*G0_;
+    A[3] = 0.000396825396825396*G0_;
+    A[4] = -0.00238095238095238*G0_;
+    A[5] = -0.00238095238095238*G0_;
+    A[6] = -0.00238095238095238*G0_;
+    A[7] = -0.00158730158730159*G0_;
+    A[8] = -0.00158730158730158*G0_;
+    A[9] = -0.00158730158730159*G0_;
+    A[10] = 0.000396825396825396*G0_;
+    A[11] = 0.00238095238095238*G0_;
+    A[12] = 0.000396825396825395*G0_;
+    A[13] = 0.000396825396825396*G0_;
+    A[14] = -0.00238095238095238*G0_;
+    A[15] = -0.00158730158730158*G0_;
+    A[16] = -0.00158730158730158*G0_;
+    A[17] = -0.00238095238095238*G0_;
+    A[18] = -0.00238095238095238*G0_;
+    A[19] = -0.00158730158730158*G0_;
+    A[20] = 0.000396825396825396*G0_;
+    A[21] = 0.000396825396825395*G0_;
+    A[22] = 0.00238095238095238*G0_;
+    A[23] = 0.000396825396825396*G0_;
+    A[24] = -0.00158730158730159*G0_;
+    A[25] = -0.00238095238095238*G0_;
+    A[26] = -0.00158730158730158*G0_;
+    A[27] = -0.00238095238095238*G0_;
+    A[28] = -0.00158730158730159*G0_;
+    A[29] = -0.00238095238095238*G0_;
+    A[30] = 0.000396825396825396*G0_;
+    A[31] = 0.000396825396825396*G0_;
+    A[32] = 0.000396825396825396*G0_;
+    A[33] = 0.00238095238095238*G0_;
+    A[34] = -0.00158730158730159*G0_;
+    A[35] = -0.00158730158730159*G0_;
+    A[36] = -0.00238095238095238*G0_;
+    A[37] = -0.00158730158730159*G0_;
+    A[38] = -0.00238095238095238*G0_;
+    A[39] = -0.00238095238095238*G0_;
+    A[40] = -0.00238095238095238*G0_;
+    A[41] = -0.00238095238095238*G0_;
+    A[42] = -0.00158730158730159*G0_;
+    A[43] = -0.00158730158730159*G0_;
+    A[44] = 0.0126984126984127*G0_;
+    A[45] = 0.00634920634920635*G0_;
+    A[46] = 0.00634920634920635*G0_;
+    A[47] = 0.00634920634920635*G0_;
+    A[48] = 0.00634920634920634*G0_;
+    A[49] = 0.00317460317460317*G0_;
+    A[50] = -0.00238095238095238*G0_;
+    A[51] = -0.00158730158730158*G0_;
+    A[52] = -0.00238095238095238*G0_;
+    A[53] = -0.00158730158730159*G0_;
+    A[54] = 0.00634920634920635*G0_;
+    A[55] = 0.0126984126984127*G0_;
+    A[56] = 0.00634920634920635*G0_;
+    A[57] = 0.00634920634920635*G0_;
+    A[58] = 0.00317460317460317*G0_;
+    A[59] = 0.00634920634920635*G0_;
+    A[60] = -0.00238095238095238*G0_;
+    A[61] = -0.00158730158730158*G0_;
+    A[62] = -0.00158730158730158*G0_;
+    A[63] = -0.00238095238095238*G0_;
+    A[64] = 0.00634920634920635*G0_;
+    A[65] = 0.00634920634920635*G0_;
+    A[66] = 0.0126984126984127*G0_;
+    A[67] = 0.00317460317460317*G0_;
+    A[68] = 0.00634920634920634*G0_;
+    A[69] = 0.00634920634920635*G0_;
+    A[70] = -0.00158730158730159*G0_;
+    A[71] = -0.00238095238095238*G0_;
+    A[72] = -0.00238095238095238*G0_;
+    A[73] = -0.00158730158730159*G0_;
+    A[74] = 0.00634920634920635*G0_;
+    A[75] = 0.00634920634920635*G0_;
+    A[76] = 0.00317460317460317*G0_;
+    A[77] = 0.0126984126984127*G0_;
+    A[78] = 0.00634920634920635*G0_;
+    A[79] = 0.00634920634920635*G0_;
+    A[80] = -0.00158730158730158*G0_;
+    A[81] = -0.00238095238095238*G0_;
+    A[82] = -0.00158730158730159*G0_;
+    A[83] = -0.00238095238095238*G0_;
+    A[84] = 0.00634920634920634*G0_;
+    A[85] = 0.00317460317460317*G0_;
+    A[86] = 0.00634920634920634*G0_;
+    A[87] = 0.00634920634920635*G0_;
+    A[88] = 0.0126984126984127*G0_;
+    A[89] = 0.00634920634920634*G0_;
+    A[90] = -0.00158730158730159*G0_;
+    A[91] = -0.00158730158730158*G0_;
+    A[92] = -0.00238095238095238*G0_;
+    A[93] = -0.00238095238095238*G0_;
+    A[94] = 0.00317460317460317*G0_;
+    A[95] = 0.00634920634920635*G0_;
+    A[96] = 0.00634920634920635*G0_;
+    A[97] = 0.00634920634920635*G0_;
+    A[98] = 0.00634920634920634*G0_;
+    A[99] = 0.0126984126984127*G0_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class projection_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  projection_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    10
+    // Number of operations (multiply-add pairs) for tensor contraction: 95
+    // Total number of operations (multiply-add pairs):                  108
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00238095238095238*G0_0 + 0.000396825396825396*G0_1 + 0.000396825396825396*G0_2 + 0.000396825396825396*G0_3 - 0.00238095238095238*G0_4 - 0.00238095238095238*G0_5 - 0.00238095238095238*G0_6 - 0.00158730158730159*G0_7 - 0.00158730158730158*G0_8 - 0.00158730158730159*G0_9;
+    A[1] = 0.000396825396825396*G0_0 + 0.00238095238095238*G0_1 + 0.000396825396825395*G0_2 + 0.000396825396825396*G0_3 - 0.00238095238095238*G0_4 - 0.00158730158730158*G0_5 - 0.00158730158730158*G0_6 - 0.00238095238095238*G0_7 - 0.00238095238095238*G0_8 - 0.00158730158730158*G0_9;
+    A[2] = 0.000396825396825396*G0_0 + 0.000396825396825395*G0_1 + 0.00238095238095238*G0_2 + 0.000396825396825396*G0_3 - 0.00158730158730159*G0_4 - 0.00238095238095238*G0_5 - 0.00158730158730158*G0_6 - 0.00238095238095238*G0_7 - 0.00158730158730159*G0_8 - 0.00238095238095238*G0_9;
+    A[3] = 0.000396825396825396*G0_0 + 0.000396825396825396*G0_1 + 0.000396825396825396*G0_2 + 0.00238095238095238*G0_3 - 0.00158730158730159*G0_4 - 0.00158730158730159*G0_5 - 0.00238095238095238*G0_6 - 0.00158730158730159*G0_7 - 0.00238095238095238*G0_8 - 0.00238095238095238*G0_9;
+    A[4] = -0.00238095238095238*G0_0 - 0.00238095238095238*G0_1 - 0.00158730158730159*G0_2 - 0.00158730158730159*G0_3 + 0.0126984126984127*G0_4 + 0.00634920634920635*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00634920634920634*G0_8 + 0.00317460317460317*G0_9;
+    A[5] = -0.00238095238095238*G0_0 - 0.00158730158730158*G0_1 - 0.00238095238095238*G0_2 - 0.00158730158730159*G0_3 + 0.00634920634920635*G0_4 + 0.0126984126984127*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00317460317460317*G0_8 + 0.00634920634920635*G0_9;
+    A[6] = -0.00238095238095238*G0_0 - 0.00158730158730158*G0_1 - 0.00158730158730158*G0_2 - 0.00238095238095238*G0_3 + 0.00634920634920635*G0_4 + 0.00634920634920635*G0_5 + 0.0126984126984127*G0_6 + 0.00317460317460317*G0_7 + 0.00634920634920634*G0_8 + 0.00634920634920635*G0_9;
+    A[7] = -0.00158730158730159*G0_0 - 0.00238095238095238*G0_1 - 0.00238095238095238*G0_2 - 0.00158730158730159*G0_3 + 0.00634920634920635*G0_4 + 0.00634920634920635*G0_5 + 0.00317460317460317*G0_6 + 0.0126984126984127*G0_7 + 0.00634920634920635*G0_8 + 0.00634920634920635*G0_9;
+    A[8] = -0.00158730158730158*G0_0 - 0.00238095238095238*G0_1 - 0.00158730158730159*G0_2 - 0.00238095238095238*G0_3 + 0.00634920634920634*G0_4 + 0.00317460317460317*G0_5 + 0.00634920634920634*G0_6 + 0.00634920634920635*G0_7 + 0.0126984126984127*G0_8 + 0.00634920634920634*G0_9;
+    A[9] = -0.00158730158730159*G0_0 - 0.00158730158730158*G0_1 - 0.00238095238095238*G0_2 - 0.00238095238095238*G0_3 + 0.00317460317460317*G0_4 + 0.00634920634920635*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00634920634920634*G0_8 + 0.0126984126984127*G0_9;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class projection_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  projection_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "3b167d47d86e6d08a9afe04ee5d4a2f17cae4ae856ed1b48eb7abc1cebd69e58d89332adfd41113b9a7753b87b0e8d966a7855db051c30750af570be0f38418e";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new projection_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class projection_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  projection_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "43145964686b6b70399e810d68d5808ce481de0ab7937b15e48b40c9c4e3f124b2b0cfc9e3998c7c2f4200754bde07ead6b75338da5888fb3b177a9b17db6f81";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new projection_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Projection
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/eval/cpp/Projection.ufl b/demo/undocumented/eval/cpp/Projection.ufl
new file mode 100644
index 0000000..1c8425e
--- /dev/null
+++ b/demo/undocumented/eval/cpp/Projection.ufl
@@ -0,0 +1,33 @@
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-03-17
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# projection onto piecewise quadratics.
+#
+# Compile this form with FFC: ffc -l dolfin Projection.ufl
+
+element = FiniteElement("Lagrange", tetrahedron, 2)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+f = Coefficient(element)
+
+a = u*v*dx
+L = f*v*dx
diff --git a/demo/undocumented/eval/cpp/compile.log b/demo/undocumented/eval/cpp/compile.log
new file mode 100644
index 0000000..9bd297e
--- /dev/null
+++ b/demo/undocumented/eval/cpp/compile.log
@@ -0,0 +1,242 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Projection
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0324008 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  100 entries computed in 0.00135 seconds
+  Shape of reference tensor: (10, 10)
+  Primary multi index:   rank = 2 dims = [10, 10] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  100 entries computed in 0.00117 seconds
+  Shape of reference tensor: (10, 10)
+  Primary multi index:   rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0102029 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000281096 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.288702 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000645161 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Projection.h.
+  
+Compiler stage 5 finished in 0.000889063 seconds.
+
+FFC finished in 0.333495 seconds.
diff --git a/demo/undocumented/eval/cpp/main.cpp b/demo/undocumented/eval/cpp/main.cpp
new file mode 100644
index 0000000..68be26b
--- /dev/null
+++ b/demo/undocumented/eval/cpp/main.cpp
@@ -0,0 +1,76 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-03-11
+// Last changed: 2012-11-12
+//
+// Demonstrating function evaluation at arbitrary points.
+
+#include <boost/assign/list_of.hpp>
+#include <dolfin.h>
+#include "Projection.h"
+
+using namespace dolfin;
+
+#ifdef HAS_CGAL
+
+class F : public Expression
+{
+public:
+
+  F() {}
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2]);
+  }
+
+};
+
+int main()
+{
+  // Create mesh and a point in the mesh
+  UnitCubeMesh mesh(8, 8, 8);
+  Point x(0.31, 0.32, 0.33);
+
+  // A user-defined function
+  F f;
+
+  // Project to a discrete function
+  Projection::FunctionSpace V(mesh);
+  Projection::BilinearForm a(V, V);
+  Projection::LinearForm L(V);
+  L.f = f;
+  Function g(V);
+  solve(a == L, g);
+
+  // Evaluate user-defined function f
+  info("f(x) = %g", f(x));
+
+  // Evaluate discrete function g (projection of f)
+  info("g(x) = %g", g(x));
+}
+
+#else
+
+int main()
+{
+  info("DOLFIN must be compiled with CGAL to run this demo.");
+  return 0;
+}
+
+#endif
diff --git a/demo/undocumented/eval/python/demo_eval.py b/demo/undocumented/eval/python/demo_eval.py
new file mode 100644
index 0000000..0d2ae9f
--- /dev/null
+++ b/demo/undocumented/eval/python/demo_eval.py
@@ -0,0 +1,52 @@
+"Demonstrating function evaluation at arbitrary points."
+
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johan Hake, 2009
+#
+# First added:  2008-03-17
+# Last changed: 2012-11-12
+
+from dolfin import *
+from numpy import array
+
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+# Create mesh and a point in the mesh
+mesh = UnitCubeMesh(8, 8, 8);
+x = (0.31, 0.32, 0.33)
+
+# A user-defined function
+Vs = FunctionSpace(mesh, "CG", 2)
+Vv = VectorFunctionSpace(mesh, "CG", 2)
+fs = Expression("sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])", degree=2)
+fv = Expression(("sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])",
+               "1.0 + 3.0*x[0] + 4.0*x[1] + 0.5*x[2]","2"), element = Vv.ufl_element())
+
+# Project to a discrete function
+g = project(fs, V=Vs)
+
+print """
+Evaluate user-defined scalar function fs
+fs(x) = %f
+Evaluate discrete function g (projection of fs)
+g(x) = %f
+Evaluate user-defined vector valued function fv
+fs(x) = %s"""%(fs(x),g(x),str(fv(x)))
diff --git a/demo/undocumented/extrapolation/cpp/CMakeLists.txt b/demo/undocumented/extrapolation/cpp/CMakeLists.txt
new file mode 100644
index 0000000..2c9a258
--- /dev/null
+++ b/demo/undocumented/extrapolation/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_extrapolation)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/extrapolation/cpp/P1.h b/demo/undocumented/extrapolation/cpp/P1.h
new file mode 100644
index 0000000..b0a5d74
--- /dev/null
+++ b/demo/undocumented/extrapolation/cpp/P1.h
@@ -0,0 +1,1267 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __P1_H
+#define __P1_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class p1_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  p1_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new p1_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class p1_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  p1_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new p1_dofmap_0();
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace P1
+{
+
+class FunctionSpace: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  FunctionSpace(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~FunctionSpace()
+  {
+  }
+
+};
+
+}
+
+#endif
diff --git a/demo/undocumented/extrapolation/cpp/P1.ufl b/demo/undocumented/extrapolation/cpp/P1.ufl
new file mode 100644
index 0000000..0f55fe5
--- /dev/null
+++ b/demo/undocumented/extrapolation/cpp/P1.ufl
@@ -0,0 +1 @@
+element = FiniteElement("Lagrange", triangle, 1)
diff --git a/demo/undocumented/extrapolation/cpp/P2.h b/demo/undocumented/extrapolation/cpp/P2.h
new file mode 100644
index 0000000..bca40c0
--- /dev/null
+++ b/demo/undocumented/extrapolation/cpp/P2.h
@@ -0,0 +1,1986 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __P2_H
+#define __P2_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class p2_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  p2_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p2_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new p2_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class p2_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  p2_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p2_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new p2_dofmap_0();
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace P2
+{
+
+class FunctionSpace: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p2_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p2_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p2_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p2_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  FunctionSpace(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p2_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p2_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p2_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~FunctionSpace()
+  {
+  }
+
+};
+
+}
+
+#endif
diff --git a/demo/undocumented/extrapolation/cpp/P2.ufl b/demo/undocumented/extrapolation/cpp/P2.ufl
new file mode 100644
index 0000000..c90e03d
--- /dev/null
+++ b/demo/undocumented/extrapolation/cpp/P2.ufl
@@ -0,0 +1 @@
+element = FiniteElement("Lagrange", triangle, 2)
diff --git a/demo/undocumented/extrapolation/cpp/compile.log b/demo/undocumented/extrapolation/cpp/compile.log
new file mode 100644
index 0000000..e693e5c
--- /dev/null
+++ b/demo/undocumented/extrapolation/cpp/compile.log
@@ -0,0 +1,216 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling element P2
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+Compiler stage 1 finished in 0.000301123 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.010932 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  
+Compiler stage 3 finished in 0.000138998 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.117043 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000291109 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./P2.h.
+  
+Compiler stage 5 finished in 0.000712872 seconds.
+
+FFC finished in 0.129814 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling element P1
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+Compiler stage 1 finished in 0.00018692 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0077641 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  
+Compiler stage 3 finished in 0.0001719 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.064481 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000527859 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./P1.h.
+  
+Compiler stage 5 finished in 0.000749826 seconds.
+
+FFC finished in 0.074317 seconds.
diff --git a/demo/undocumented/extrapolation/cpp/main.cpp b/demo/undocumented/extrapolation/cpp/main.cpp
new file mode 100644
index 0000000..ed08440
--- /dev/null
+++ b/demo/undocumented/extrapolation/cpp/main.cpp
@@ -0,0 +1,67 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-02-08
+// Last changed: 2012-07-05
+//
+// This program demonstrates extrapolation of a P1 function to a P2
+// function on the same mesh. This is useful for postprocessing a
+// computed dual approximation for use in an error estimate.
+
+#include <dolfin.h>
+#include "P1.h"
+#include "P2.h"
+
+using namespace dolfin;
+
+class Dual : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = sin(5.0*x[0])*sin(5.0*x[1]);
+  }
+
+};
+
+int main()
+{
+  // Create mesh and function spaces
+  UnitSquareMesh mesh(8, 8);
+  P1::FunctionSpace P1(mesh);
+  P2::FunctionSpace P2(mesh);
+
+  // Create exact dual
+  Dual dual;
+
+  // Create P1 approximation of exact dual
+  Function z1(P1);
+  z1.interpolate(dual);
+
+  // Create P2 approximation from P1 approximation
+  Function z2(P2);
+  z2.extrapolate(z1);
+
+  // Plot approximations
+  plot(z1, "z1");
+  plot(z2, "z2");
+  interactive();
+
+
+  return 0;
+}
diff --git a/demo/undocumented/extrapolation/python/demo_extrapolation.py b/demo/undocumented/extrapolation/python/demo_extrapolation.py
new file mode 100644
index 0000000..b77daef
--- /dev/null
+++ b/demo/undocumented/extrapolation/python/demo_extrapolation.py
@@ -0,0 +1,42 @@
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-02-08
+# Last changed: 2010-02-09
+
+from dolfin import *
+
+# Create mesh and function spaces
+mesh = UnitSquareMesh(8, 8)
+P1 = FunctionSpace(mesh, "CG", 1)
+P2 = FunctionSpace(mesh, "CG", 2)
+
+# Create exact dual
+dual = Expression("sin(5.0*x[0])*sin(5.0*x[1])")
+
+# Create P1 approximation of exact dual
+z1 = Function(P1)
+z1.interpolate(dual)
+
+# Create P2 approximation from P1 approximation
+z2 = Function(P2)
+z2.extrapolate(z1)
+
+# Plot approximations
+plot(z1, title="z1")
+plot(z2, title="z2")
+interactive()
diff --git a/demo/undocumented/functional/cpp/CMakeLists.txt b/demo/undocumented/functional/cpp/CMakeLists.txt
new file mode 100644
index 0000000..ef1d05b
--- /dev/null
+++ b/demo/undocumented/functional/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_functional)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/functional/cpp/EnergyNorm.h b/demo/undocumented/functional/cpp/EnergyNorm.h
new file mode 100644
index 0000000..b318bd5
--- /dev/null
+++ b/demo/undocumented/functional/cpp/EnergyNorm.h
@@ -0,0 +1,2424 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __ENERGYNORM_H
+#define __ENERGYNORM_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class energynorm_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  energynorm_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~energynorm_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new energynorm_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class energynorm_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  energynorm_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~energynorm_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new energynorm_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class energynorm_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  energynorm_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~energynorm_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W6[6] = {0.054975871827661, 0.054975871827661, 0.054975871827661, 0.111690794839005, 0.111690794839005, 0.111690794839005};
+    // Quadrature points on the UFC reference element: (0.816847572980459, 0.091576213509771), (0.091576213509771, 0.816847572980459), (0.091576213509771, 0.091576213509771), (0.10810301816807, 0.445948490915965), (0.445948490915965, 0.10810301816807), (0.445948490915965, 0.445948490915965)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[6][6] = \
+    {{-0.074803807748196, 0.517632341987673, -0.0748038077481966, 0.299215230992787, 0.0335448115231483, 0.299215230992784},
+    {-0.074803807748196, -0.0748038077481966, 0.517632341987674, 0.299215230992787, 0.299215230992784, 0.0335448115231483},
+    {0.517632341987671, -0.0748038077481966, -0.0748038077481966, 0.0335448115231487, 0.299215230992787, 0.299215230992787},
+    {-0.0482083778155119, -0.0847304930939778, -0.0482083778155119, 0.192833511262048, 0.795480226200906, 0.192833511262048},
+    {-0.0482083778155119, -0.048208377815512, -0.0847304930939778, 0.192833511262048, 0.192833511262048, 0.795480226200906},
+    {-0.0847304930939778, -0.048208377815512, -0.0482083778155119, 0.795480226200906, 0.192833511262048, 0.192833511262048}};
+    
+    static const double FE0_D01[6][5] = \
+    {{0.633695145960921, -0.633695145960916, 3.26739029192183, 0.0, -3.26739029192184},
+    {0.63369514596092, 2.26739029192184, 0.366304854039083, -2.90108543788276, -0.366304854039083},
+    {-2.26739029192183, -0.633695145960916, 0.366304854039083, 2.90108543788275, -0.366304854039083},
+    {-0.78379396366386, 0.78379396366386, 0.432412072672279, 0.0, -0.432412072672279},
+    {-0.783793963663859, -0.567587927327719, 1.78379396366386, 1.35138189099158, -1.78379396366386},
+    {0.567587927327721, 0.78379396366386, 1.78379396366386, -1.35138189099158, -1.78379396366386}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[5] = {0, 2, 3, 4, 5};
+    
+    static const double FE0_D10[6][5] = \
+    {{0.63369514596092, 2.26739029192184, 0.366304854039083, -0.366304854039083, -2.90108543788276},
+    {0.633695145960921, -0.633695145960916, 3.26739029192183, -3.26739029192183, 0.0},
+    {-2.26739029192183, -0.633695145960916, 0.366304854039083, -0.366304854039083, 2.90108543788275},
+    {-0.78379396366386, -0.56758792732772, 1.78379396366386, -1.78379396366386, 1.35138189099158},
+    {-0.78379396366386, 0.78379396366386, 0.432412072672279, -0.432412072672279, 0.0},
+    {0.56758792732772, 0.78379396366386, 1.78379396366386, -1.78379396366386, -1.35138189099158}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[5] = {0, 1, 3, 4, 5};
+    
+    // Reset values in the element tensor.
+    A[0] = 0.0;
+    // Number of operations to compute geometry constants: 13.
+    double G[3];
+    G[0] = det*(K[0]*K[0] + K[1]*K[1]);
+    G[1] = 2.0*det*(K[0]*K[2] + K[1]*K[3]);
+    G[2] = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 264
+    for (unsigned int ip = 0; ip < 6; ip++)
+    {
+      
+      // Coefficient declarations.
+      double F0 = 0.0;
+      double F1 = 0.0;
+      double F2 = 0.0;
+      
+      // Total number of operations to compute function values = 20
+      for (unsigned int r = 0; r < 5; r++)
+      {
+        F0 += FE0_D10[ip][r]*w[0][nzc1[r]];
+        F1 += FE0_D01[ip][r]*w[0][nzc0[r]];
+      } // end loop over 'r'
+      
+      // Total number of operations to compute function values = 12
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        F2 += FE0[ip][r]*w[0][r];
+      } // end loop over 'r'
+      
+      // Number of operations to compute ip constants: 11
+      double I[1];
+      // Number of operations: 11
+      I[0] = W6[ip]*(F0*F0*G[0] + F1*(F0*G[1] + F1*G[2]) + F2*F2*det);
+      
+      
+      // Number of operations for primary indices: 1
+      // Number of operations to compute entry: 1
+      A[0] += I[0];
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class energynorm_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  energynorm_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~energynorm_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "0dfd02d62d6d8945b65768d880c6f92821097a1b9d0bc75f4f0a0cf0bcdbd257bbe2cad5401378a9dfb6e8fa63365373ddbbd17cb32517470b6d465580e6edf2";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 0;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new energynorm_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new energynorm_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new energynorm_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace EnergyNorm
+{
+
+class CoefficientSpace_v: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_v(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new energynorm_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new energynorm_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_v(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new energynorm_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new energynorm_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_v(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new energynorm_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new energynorm_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_v(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new energynorm_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new energynorm_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_v(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new energynorm_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new energynorm_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_v(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new energynorm_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new energynorm_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_v()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_v Form_M_FunctionSpace_0;
+
+class Form_M: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_M(const dolfin::Mesh& mesh):
+    dolfin::Form(0, 1), v(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _ufc_form = std::shared_ptr<const ufc::form>(new energynorm_form_0());
+  }
+
+  // Constructor
+  Form_M(const dolfin::Mesh& mesh, const dolfin::GenericFunction& v):
+    dolfin::Form(0, 1), v(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->v = v;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new energynorm_form_0());
+  }
+
+  // Constructor
+  Form_M(const dolfin::Mesh& mesh, std::shared_ptr<const dolfin::GenericFunction> v):
+    dolfin::Form(0, 1), v(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->v = *v;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new energynorm_form_0());
+  }
+
+  // Constructor
+  Form_M(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::Form(0, 1), v(*this, 0)
+  {
+    _mesh = mesh;
+    _ufc_form = std::shared_ptr<const ufc::form>(new energynorm_form_0());
+  }
+
+  // Constructor
+  Form_M(std::shared_ptr<const dolfin::Mesh> mesh, const dolfin::GenericFunction& v):
+    dolfin::Form(0, 1), v(*this, 0)
+  {
+    _mesh = mesh;
+    this->v = v;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new energynorm_form_0());
+  }
+
+  // Constructor
+  Form_M(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::GenericFunction> v):
+    dolfin::Form(0, 1), v(*this, 0)
+  {
+    _mesh = mesh;
+    this->v = *v;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new energynorm_form_0());
+  }
+
+  // Destructor
+  ~Form_M()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "v")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "v";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_M_FunctionSpace_0 CoefficientSpace_v;
+
+  // Coefficients
+  dolfin::CoefficientAssigner v;
+};
+
+// Class typedefs
+typedef Form_M Functional;
+
+}
+
+#endif
diff --git a/demo/undocumented/functional/cpp/EnergyNorm.ufl b/demo/undocumented/functional/cpp/EnergyNorm.ufl
new file mode 100644
index 0000000..51b12fa
--- /dev/null
+++ b/demo/undocumented/functional/cpp/EnergyNorm.ufl
@@ -0,0 +1,26 @@
+# Copyright (C) 2005-2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# This example demonstrates how to define a functional, here
+# the energy norm (squared) for a reaction-diffusion problem.
+#
+# Compile this form with FFC: ffc -l dolfin EnergyNorm.ufl
+
+element = FiniteElement("Lagrange", triangle, 2)
+
+v = Coefficient(element)
+M = (v*v + dot(grad(v), grad(v)))*dx
diff --git a/demo/undocumented/functional/cpp/compile.log b/demo/undocumented/functional/cpp/compile.log
new file mode 100644
index 0000000..f7cc963
--- /dev/null
+++ b/demo/undocumented/functional/cpp/compile.log
@@ -0,0 +1,481 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form EnergyNorm
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'M'
+  Geometric dimension:    2
+  Rank:                   0
+  Arguments:              '[]'
+  Argument names:         '[]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[v]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.021379 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {6: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {None: {(0, 1): array([[0.63369514596092058, 0.63369514596092025, -2.2673902919218314,
+          -0.78379396366385989, -0.78379396366385934, 0.56758792732772056],
+         [2.7755575615628914e-16, -2.2204460492503131e-16,
+          -5.5511151231257827e-17, 4.8572257327350599e-17,
+          -1.1102230246251565e-16, 1.3183898417423734e-16],
+         [-0.63369514596091581, 2.2673902919218358, -0.63369514596091603,
+          0.78379396366385989, -0.56758792732771934, 0.78379396366385978],
+         [3.2673902919218341, 0.36630485403908319, 0.36630485403908319,
+          0.4324120726722791, 1.7837939636638593, 1.7837939636638589],
+         [-3.7747582837255322e-15, -2.9010854378827551, 2.9010854378827475,
+          -2.4980018054066022e-16, 1.3513818909915796, -1.3513818909915798],
+         [-3.2673902919218358, -0.36630485403908342, -0.36630485403908297,
+          -0.43241207267227899, -1.78379396366386, -1.7837939636638598]], dtype=object), (1, 0): array([[0.63369514596092014, 0.63369514596092069, -2.2673902919218323,
+          -0.78379396366385989, -0.78379396366385967, 0.56758792732772034],
+         [2.2673902919218358, -0.63369514596091625, -0.63369514596091647,
+          -0.56758792732772045, 0.78379396366386023, 0.78379396366385978],
+         [0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
+         [0.36630485403908286, 3.2673902919218336, 0.36630485403908286,
+          1.7837939636638591, 0.43241207267227894, 1.7837939636638591],
+         [-0.36630485403908286, -3.2673902919218336, -0.36630485403908286,
+          -1.7837939636638591, -0.43241207267227894, -1.7837939636638591],
+         [-2.901085437882756, -4.9296699827375906e-15, 2.9010854378827484,
+          1.35138189099158, -7.6450782352261042e-16, -1.3513818909915805]], dtype=object), (0, 0): array([[-0.074803807748196033, -0.074803807748195991, 0.51763234198767138,
+          -0.048208377815511877, -0.048208377815511919, -0.084730493093977774],
+         [0.51763234198767349, -0.074803807748196616, -0.07480380774819663,
+          -0.084730493093977816, -0.048208377815511967, -0.048208377815512009],
+         [-0.074803807748196643, 0.51763234198767361, -0.074803807748196643,
+          -0.048208377815511891, -0.084730493093977843, -0.048208377815511891],
+         [0.29921523099278691, 0.29921523099278691, 0.033544811523148657,
+          0.19283351126204784, 0.19283351126204781, 0.79548022620090597],
+         [0.033544811523148282, 0.2992152309927838, 0.29921523099278657,
+          0.79548022620090597, 0.19283351126204779, 0.19283351126204784],
+         [0.2992152309927838, 0.033544811523148269, 0.29921523099278663,
+          0.19283351126204784, 0.79548022620090619, 0.19283351126204784]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_D10': array([[0.63369514596092014, 2.2673902919218358, 0.0, 0.36630485403908286,
+          -0.36630485403908286, -2.901085437882756],
+         [0.63369514596092069, -0.63369514596091625, 0.0, 3.2673902919218336,
+          -3.2673902919218336, -4.9296699827375906e-15],
+         [-2.2673902919218323, -0.63369514596091647, 0.0,
+          0.36630485403908286, -0.36630485403908286, 2.9010854378827484],
+         [-0.78379396366385989, -0.56758792732772045, 0.0,
+          1.7837939636638591, -1.7837939636638591, 1.35138189099158],
+         [-0.78379396366385967, 0.78379396366386023, 0.0,
+          0.43241207267227894, -0.43241207267227894, -7.6450782352261042e-16],
+         [0.56758792732772034, 0.78379396366385978, 0.0, 1.7837939636638591,
+          -1.7837939636638591, -1.3513818909915805]], dtype=object), 'FE0_D01': array([[0.63369514596092058, 2.7755575615628914e-16, -0.63369514596091581,
+          3.2673902919218341, -3.7747582837255322e-15, -3.2673902919218358],
+         [0.63369514596092025, -2.2204460492503131e-16, 2.2673902919218358,
+          0.36630485403908319, -2.9010854378827551, -0.36630485403908342],
+         [-2.2673902919218314, -5.5511151231257827e-17, -0.63369514596091603,
+          0.36630485403908319, 2.9010854378827475, -0.36630485403908297],
+         [-0.78379396366385989, 4.8572257327350599e-17, 0.78379396366385989,
+          0.4324120726722791, -2.4980018054066022e-16, -0.43241207267227899],
+         [-0.78379396366385934, -1.1102230246251565e-16,
+          -0.56758792732771934, 1.7837939636638593, 1.3513818909915796,
+          -1.78379396366386],
+         [0.56758792732772056, 1.3183898417423734e-16, 0.78379396366385978,
+          1.7837939636638589, -1.3513818909915798, -1.7837939636638598]], dtype=object), 'FE1_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[-0.074803807748196033, 0.51763234198767349, -0.074803807748196643,
+          0.29921523099278691, 0.033544811523148282, 0.2992152309927838],
+         [-0.074803807748195991, -0.074803807748196616, 0.51763234198767361,
+          0.29921523099278691, 0.2992152309927838, 0.033544811523148269],
+         [0.51763234198767138, -0.07480380774819663, -0.074803807748196643,
+          0.033544811523148657, 0.29921523099278657, 0.29921523099278663],
+         [-0.048208377815511877, -0.084730493093977816,
+          -0.048208377815511891, 0.19283351126204784, 0.79548022620090597,
+          0.19283351126204784],
+         [-0.048208377815511919, -0.048208377815511967,
+          -0.084730493093977843, 0.19283351126204781, 0.19283351126204779,
+          0.79548022620090619],
+         [-0.084730493093977774, -0.048208377815512009,
+          -0.048208377815511891, 0.79548022620090597, 0.19283351126204784,
+          0.19283351126204784]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE0_D10': array([[0.63369514596092014, 2.2673902919218358, 0.0, 0.36630485403908286,
+          -0.36630485403908286, -2.901085437882756],
+         [0.63369514596092069, -0.63369514596091625, 0.0, 3.2673902919218336,
+          -3.2673902919218336, -4.9296699827375906e-15],
+         [-2.2673902919218323, -0.63369514596091647, 0.0,
+          0.36630485403908286, -0.36630485403908286, 2.9010854378827484],
+         [-0.78379396366385989, -0.56758792732772045, 0.0,
+          1.7837939636638591, -1.7837939636638591, 1.35138189099158],
+         [-0.78379396366385967, 0.78379396366386023, 0.0,
+          0.43241207267227894, -0.43241207267227894, -7.6450782352261042e-16],
+         [0.56758792732772034, 0.78379396366385978, 0.0, 1.7837939636638591,
+          -1.7837939636638591, -1.3513818909915805]], dtype=object), 'FE0_D01': array([[0.63369514596092058, 2.7755575615628914e-16, -0.63369514596091581,
+          3.2673902919218341, -3.7747582837255322e-15, -3.2673902919218358],
+         [0.63369514596092025, -2.2204460492503131e-16, 2.2673902919218358,
+          0.36630485403908319, -2.9010854378827551, -0.36630485403908342],
+         [-2.2673902919218314, -5.5511151231257827e-17, -0.63369514596091603,
+          0.36630485403908319, 2.9010854378827475, -0.36630485403908297],
+         [-0.78379396366385989, 4.8572257327350599e-17, 0.78379396366385989,
+          0.4324120726722791, -2.4980018054066022e-16, -0.43241207267227899],
+         [-0.78379396366385934, -1.1102230246251565e-16,
+          -0.56758792732771934, 1.7837939636638593, 1.3513818909915796,
+          -1.78379396366386],
+         [0.56758792732772056, 1.3183898417423734e-16, 0.78379396366385978,
+          1.7837939636638589, -1.3513818909915798, -1.7837939636638598]], dtype=object), 'FE1_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[-0.074803807748196033, 0.51763234198767349, -0.074803807748196643,
+          0.29921523099278691, 0.033544811523148282, 0.2992152309927838],
+         [-0.074803807748195991, -0.074803807748196616, 0.51763234198767361,
+          0.29921523099278691, 0.2992152309927838, 0.033544811523148269],
+         [0.51763234198767138, -0.07480380774819663, -0.074803807748196643,
+          0.033544811523148657, 0.29921523099278657, 0.29921523099278663],
+         [-0.048208377815511877, -0.084730493093977816,
+          -0.048208377815511891, 0.19283351126204784, 0.79548022620090597,
+          0.19283351126204784],
+         [-0.048208377815511919, -0.048208377815511967,
+          -0.084730493093977843, 0.19283351126204781, 0.19283351126204779,
+          0.79548022620090619],
+         [-0.084730493093977774, -0.048208377815512009,
+          -0.048208377815511891, 0.79548022620090597, 0.19283351126204784,
+          0.19283351126204784]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_D10': 'FE0_D10', 'FE0_D01': 'FE0_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_D10': array([[0.63369514596092014, 2.2673902919218358, 0.36630485403908286,
+          -0.36630485403908286, -2.901085437882756],
+         [0.63369514596092069, -0.63369514596091625, 3.2673902919218336,
+          -3.2673902919218336, 0],
+         [-2.2673902919218323, -0.63369514596091647, 0.36630485403908286,
+          -0.36630485403908286, 2.9010854378827484],
+         [-0.78379396366385989, -0.56758792732772045, 1.7837939636638591,
+          -1.7837939636638591, 1.35138189099158],
+         [-0.78379396366385967, 0.78379396366386023, 0.43241207267227894,
+          -0.43241207267227894, 0],
+         [0.56758792732772034, 0.78379396366385978, 1.7837939636638591,
+          -1.7837939636638591, -1.3513818909915805]], dtype=object), 'FE0_D01': array([[0.63369514596092058, -0.63369514596091581, 3.2673902919218341, 0,
+          -3.2673902919218358],
+         [0.63369514596092025, 2.2673902919218358, 0.36630485403908319,
+          -2.9010854378827551, -0.36630485403908342],
+         [-2.2673902919218314, -0.63369514596091603, 0.36630485403908319,
+          2.9010854378827475, -0.36630485403908297],
+         [-0.78379396366385989, 0.78379396366385989, 0.4324120726722791, 0,
+          -0.43241207267227899],
+         [-0.78379396366385934, -0.56758792732771934, 1.7837939636638593,
+          1.3513818909915796, -1.78379396366386],
+         [0.56758792732772056, 0.78379396366385978, 1.7837939636638589,
+          -1.3513818909915798, -1.7837939636638598]], dtype=object), 'FE1_C0': array([[ 0.09157621,  0.81684757,  0.09157621],
+         [ 0.09157621,  0.09157621,  0.81684757],
+         [ 0.81684757,  0.09157621,  0.09157621],
+         [ 0.44594849,  0.10810302,  0.44594849],
+         [ 0.44594849,  0.44594849,  0.10810302],
+         [ 0.10810302,  0.44594849,  0.44594849]]), 'FE0': array([[-0.074803807748196033, 0.51763234198767349, -0.074803807748196643,
+          0.29921523099278691, 0.033544811523148282, 0.2992152309927838],
+         [-0.074803807748195991, -0.074803807748196616, 0.51763234198767361,
+          0.29921523099278691, 0.2992152309927838, 0.033544811523148269],
+         [0.51763234198767138, -0.07480380774819663, -0.074803807748196643,
+          0.033544811523148657, 0.29921523099278657, 0.29921523099278663],
+         [-0.048208377815511877, -0.084730493093977816,
+          -0.048208377815511891, 0.19283351126204784, 0.79548022620090597,
+          0.19283351126204784],
+         [-0.048208377815511919, -0.048208377815511967,
+          -0.084730493093977843, 0.19283351126204781, 0.19283351126204779,
+          0.79548022620090619],
+         [-0.084730493093977774, -0.048208377815512009,
+          -0.048208377815511891, 0.79548022620090597, 0.19283351126204784,
+          0.19283351126204784]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_D10': ('FE0_D10', (1, [0, 1, 3, 4, 5]), False, False), 'FE0_D01': ('FE0_D01', (0, [0, 2, 3, 4, 5]), False, False), 'FE1_C0': ('FE1_C0', (2, [0, 1, 2]), False, False), 'FE1_C1': ('FE1_C0', (5, [3, 4, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (7, [3, 4]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (6, [3, 5]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (3, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (4, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.08008 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  
+Compiler stage 3 finished in 0.00134087 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0867798 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000380039 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./EnergyNorm.h.
+  
+Compiler stage 5 finished in 0.00061202 seconds.
+
+FFC finished in 0.190918 seconds.
diff --git a/demo/undocumented/functional/cpp/main.cpp b/demo/undocumented/functional/cpp/main.cpp
new file mode 100644
index 0000000..908e6be
--- /dev/null
+++ b/demo/undocumented/functional/cpp/main.cpp
@@ -0,0 +1,65 @@
+// Copyright (C) 2006-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-09-19
+// Last changed: 2012-11-12
+//
+// This demo program computes the value of the functional
+//
+//     M(v) = int v^2 + (grad v)^2 dx
+//
+// on the unit square for v = sin(x) + cos(y). The exact
+// value of the functional is M(v) = 2 + 2*sin(1)*(1-cos(1))
+//
+// The functional M corresponds to the energy norm for a
+// simple reaction-diffusion equation.
+
+#include <dolfin.h>
+#include "EnergyNorm.h"
+
+using namespace dolfin;
+
+int main()
+{
+  // The function v
+  class MyFunction : public Expression
+  {
+  public:
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      values[0] = sin(x[0]) + cos(x[1]);
+    }
+
+  };
+
+  // Define functional
+  UnitSquareMesh mesh(16, 16);
+  MyFunction v;
+  EnergyNorm::Functional M(mesh, v);
+
+  // Evaluate functional
+  double approximate_value = assemble(M);
+
+  // Compute exact value
+  double exact_value = 2.0 + 2.0*sin(1.0)*(1.0 - cos(1.0));
+
+  info("The energy norm of v is: %.15g", approximate_value);
+  info("It should be:            %.15g", exact_value);
+
+  return 0;
+}
diff --git a/demo/undocumented/functional/python/demo_functional.py b/demo/undocumented/functional/python/demo_functional.py
new file mode 100644
index 0000000..1e25a9a
--- /dev/null
+++ b/demo/undocumented/functional/python/demo_functional.py
@@ -0,0 +1,50 @@
+"""This demo program computes the value of the functional
+
+    M(v) = int v^2 + (grad v)^2 dx
+
+on the unit square for v = sin(x) + cos(y). The exact
+value of the functional is M(v) = 2 + 2*sin(1)*(1 - cos(1))
+
+The functional M corresponds to the energy norm for a
+simple reaction-diffusion equation."""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+#
+# First added:  2007-11-14
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(16, 16)
+V = FunctionSpace(mesh, "CG", 2)
+
+# Define the function v
+v = Expression("sin(x[0]) + cos(x[1])", element=FiniteElement("CG", triangle, 2))
+
+# Define functional
+M = (v*v + dot(grad(v), grad(v)))*dx(mesh)
+
+# Evaluate functional
+value = assemble(M)
+
+exact_value = 2.0 + 2.0*sin(1.0)*(1.0 - cos(1.0))
+print "The energy norm of v is: %.15g" % value
+print "It should be:            %.15g" % exact_value
diff --git a/demo/undocumented/interpolation/cpp/CMakeLists.txt b/demo/undocumented/interpolation/cpp/CMakeLists.txt
new file mode 100644
index 0000000..6ccad3a
--- /dev/null
+++ b/demo/undocumented/interpolation/cpp/CMakeLists.txt
@@ -0,0 +1,39 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+project(demo_interpolation)
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Add special DOLFIN compiler flags
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${DOLFIN_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+
+
+# Target libraries
+NOT_SET
diff --git a/demo/undocumented/interpolation/cpp/README b/demo/undocumented/interpolation/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/undocumented/interpolation/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/interpolation/python/demo_interpolation.py b/demo/undocumented/interpolation/python/demo_interpolation.py
new file mode 100644
index 0000000..0eaba94
--- /dev/null
+++ b/demo/undocumented/interpolation/python/demo_interpolation.py
@@ -0,0 +1,63 @@
+"""
+This program demonstrates interpolation onto a mesh which is not
+completely covered by the original mesh. This situation may arise
+during mesh refinement as a result of round-off errors.
+
+When interpolating, DOLFIN tries to locate each point in the original
+mesh. If that fails, the closest cell is found and the values
+extrapolated from there.
+"""
+
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-03-22
+# Last changed: 2013-01-23
+
+from dolfin import *
+
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+# Set option to allow extrapolation
+parameters["allow_extrapolation"] = True
+
+# Create mesh and function space
+mesh = UnitSquareMesh(16, 16)
+V = FunctionSpace(mesh, "CG", 1)
+
+# Create a function on the original mesh
+f = Expression("sin(5.0*x[0])*sin(5.0*x[1])")
+v = interpolate(f, V)
+
+# FIXME: We would like to do refined_mesh = refine(mesh) here
+# FIXME: but that breaks in parallel
+
+# Refine mesh and create a new function space
+refined_mesh = refine(mesh)
+W = FunctionSpace(refined_mesh, "CG", 1)
+
+# Displace mesh slightly
+x = mesh.coordinates()
+x += 0.1
+
+# Interpolate to the new mesh
+w = interpolate(v, W)
+
+# Plot function
+plot(w, interactive=True)
diff --git a/demo/undocumented/lift-drag/cpp/CMakeLists.txt b/demo/undocumented/lift-drag/cpp/CMakeLists.txt
new file mode 100644
index 0000000..ade3f74
--- /dev/null
+++ b/demo/undocumented/lift-drag/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_lift-drag)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/lift-drag/cpp/Functionals.h b/demo/undocumented/lift-drag/cpp/Functionals.h
new file mode 100644
index 0000000..2c57d4d
--- /dev/null
+++ b/demo/undocumented/lift-drag/cpp/Functionals.h
@@ -0,0 +1,2270 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __FUNCTIONALS_H
+#define __FUNCTIONALS_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class functionals_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  functionals_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~functionals_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new functionals_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class functionals_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  functionals_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~functionals_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new functionals_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class functionals_exterior_facet_integral_0_1: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  functionals_exterior_facet_integral_0_1() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~functionals_exterior_facet_integral_0_1()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates[2*facet] - vertex_coordinates[2*v0]) - dx0*(vertex_coordinates[2*facet + 1] - vertex_coordinates[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n0 = direction ? dx1 / det : -dx1 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 1.0;
+    // Quadrature points on the UFC reference element: (0.5)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[1][2] = \
+    {{0.5, 0.5}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    A[0] = 0.0;
+    // Number of operations to compute geometry constants: 2.
+    double G[1];
+    G[0] =  - W1*det*n0;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 6
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 6
+      for (unsigned int ip = 0; ip < 1; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[0][r]*w[0][nzc0[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 1
+        double I[1];
+        // Number of operations: 1
+        I[0] = F0*G[0];
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 6
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 6
+      for (unsigned int ip = 0; ip < 1; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[0][r]*w[0][nzc1[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 1
+        double I[1];
+        // Number of operations: 1
+        I[0] = F0*G[0];
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 6
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 6
+      for (unsigned int ip = 0; ip < 1; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[0][r]*w[0][nzc2[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 1
+        double I[1];
+        // Number of operations: 1
+        I[0] = F0*G[0];
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class functionals_exterior_facet_integral_1_1: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  functionals_exterior_facet_integral_1_1() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~functionals_exterior_facet_integral_1_1()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    const bool direction = dx1*(vertex_coordinates[2*facet] - vertex_coordinates[2*v0]) - dx0*(vertex_coordinates[2*facet + 1] - vertex_coordinates[2*v0 + 1]) < 0;
+    // Compute facet normals from the facet scale factor constants
+    const double n1 = direction ? -dx0 / det : dx0 / det;
+    
+    // Facet area
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W1 = 1.0;
+    // Quadrature points on the UFC reference element: (0.5)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[1][2] = \
+    {{0.5, 0.5}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[2] = {1, 2};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[2] = {0, 1};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[2] = {0, 2};
+    
+    // Reset values in the element tensor.
+    A[0] = 0.0;
+    // Number of operations to compute geometry constants: 2.
+    double G[1];
+    G[0] = W1*det*n1;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 6
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 6
+      for (unsigned int ip = 0; ip < 1; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[0][r]*w[0][nzc0[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 1
+        double I[1];
+        // Number of operations: 1
+        I[0] = F0*G[0];
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 6
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 6
+      for (unsigned int ip = 0; ip < 1; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[0][r]*w[0][nzc1[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 1
+        double I[1];
+        // Number of operations: 1
+        I[0] = F0*G[0];
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 6
+      
+      // Loop quadrature points for integral.
+      // Number of operations to compute element tensor for following IP loop = 6
+      for (unsigned int ip = 0; ip < 1; ip++)
+      {
+        
+        // Coefficient declarations.
+        double F0 = 0.0;
+        
+        // Total number of operations to compute function values = 4
+        for (unsigned int r = 0; r < 2; r++)
+        {
+          F0 += FE0_f0[0][r]*w[0][nzc2[r]];
+        } // end loop over 'r'
+        
+        // Number of operations to compute ip constants: 1
+        double I[1];
+        // Number of operations: 1
+        I[0] = F0*G[0];
+        
+        
+        // Number of operations for primary indices: 1
+        // Number of operations to compute entry: 1
+        A[0] += I[0];
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class functionals_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  functionals_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~functionals_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "43f62dcff972d676b9a68681d6ca948f010e7eee7f0da1efb1bccf0c9fd374d9b3395444ac68d974db6e30cab7d4349e86cfb8b164d1909531dedb8a3ec840f2";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 0;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 2;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new functionals_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new functionals_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 1:
+      {
+        return new functionals_exterior_facet_integral_0_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class functionals_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  functionals_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~functionals_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "78d2aff93fc6c92aff8c037d121244a311b4ec198ada6f38ed1937d97a775689e0464ad4c68bf2f0239506f24d4cf0ac8bf9252e2f1578e1aacc4f476a6408e2";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 0;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 2;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new functionals_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new functionals_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 1:
+      {
+        return new functionals_exterior_facet_integral_1_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Functionals
+{
+
+class CoefficientSpace_p: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new functionals_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new functionals_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new functionals_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new functionals_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_p(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new functionals_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new functionals_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_p(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new functionals_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new functionals_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_p(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new functionals_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new functionals_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_p(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new functionals_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new functionals_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_p()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_p Form_drag_FunctionSpace_0;
+
+class Form_drag: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_drag(const dolfin::Mesh& mesh):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_0());
+  }
+
+  // Constructor
+  Form_drag(const dolfin::Mesh& mesh, const dolfin::GenericFunction& p):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->p = p;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_0());
+  }
+
+  // Constructor
+  Form_drag(const dolfin::Mesh& mesh, std::shared_ptr<const dolfin::GenericFunction> p):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->p = *p;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_0());
+  }
+
+  // Constructor
+  Form_drag(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = mesh;
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_0());
+  }
+
+  // Constructor
+  Form_drag(std::shared_ptr<const dolfin::Mesh> mesh, const dolfin::GenericFunction& p):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = mesh;
+    this->p = p;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_0());
+  }
+
+  // Constructor
+  Form_drag(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::GenericFunction> p):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = mesh;
+    this->p = *p;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_0());
+  }
+
+  // Destructor
+  ~Form_drag()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "p")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "p";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_drag_FunctionSpace_0 CoefficientSpace_p;
+
+  // Coefficients
+  dolfin::CoefficientAssigner p;
+};
+
+typedef CoefficientSpace_p Form_lift_FunctionSpace_0;
+
+class Form_lift: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_lift(const dolfin::Mesh& mesh):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_1());
+  }
+
+  // Constructor
+  Form_lift(const dolfin::Mesh& mesh, const dolfin::GenericFunction& p):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->p = p;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_1());
+  }
+
+  // Constructor
+  Form_lift(const dolfin::Mesh& mesh, std::shared_ptr<const dolfin::GenericFunction> p):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = reference_to_no_delete_pointer(mesh);
+    this->p = *p;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_1());
+  }
+
+  // Constructor
+  Form_lift(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = mesh;
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_1());
+  }
+
+  // Constructor
+  Form_lift(std::shared_ptr<const dolfin::Mesh> mesh, const dolfin::GenericFunction& p):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = mesh;
+    this->p = p;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_1());
+  }
+
+  // Constructor
+  Form_lift(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::GenericFunction> p):
+    dolfin::Form(0, 1), p(*this, 0)
+  {
+    _mesh = mesh;
+    this->p = *p;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new functionals_form_1());
+  }
+
+  // Destructor
+  ~Form_lift()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "p")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "p";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_lift_FunctionSpace_0 CoefficientSpace_p;
+
+  // Coefficients
+  dolfin::CoefficientAssigner p;
+};
+
+
+}
+
+#endif
diff --git a/demo/undocumented/lift-drag/cpp/Functionals.ufl b/demo/undocumented/lift-drag/cpp/Functionals.ufl
new file mode 100644
index 0000000..dee90a8
--- /dev/null
+++ b/demo/undocumented/lift-drag/cpp/Functionals.ufl
@@ -0,0 +1,36 @@
+# Copyright (C) 2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Martin S. Alnæs, 2012
+#
+# First added:  2007-05-14
+# Last changed: 2012-08-31
+#
+# This form defines the functional for computing the
+# drag on a body.
+#
+# Compile this form with FFC: ffc -l dolfin Functionals.ufl
+
+cell = triangle
+element = FiniteElement("Lagrange", cell, 1)
+
+n = FacetNormal(cell)
+p = Coefficient(element)
+drag = -p*n[0]*ds(1)
+lift = p*n[1]*ds(1)
+
+forms = [drag, lift]
diff --git a/demo/undocumented/lift-drag/cpp/README b/demo/undocumented/lift-drag/cpp/README
new file mode 100644
index 0000000..229d1d0
--- /dev/null
+++ b/demo/undocumented/lift-drag/cpp/README
@@ -0,0 +1 @@
+Alternative version placing both lift and drag functional in the same ufl file.
diff --git a/demo/undocumented/lift-drag/cpp/compile.log b/demo/undocumented/lift-drag/cpp/compile.log
new file mode 100644
index 0000000..a34229a
--- /dev/null
+++ b/demo/undocumented/lift-drag/cpp/compile.log
@@ -0,0 +1,539 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Functionals
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                                'drag'
+  Geometric dimension:                 2
+  Number of exterior_facet subdomains: 2
+  Rank:                                0
+  Arguments:                           '[]'
+  Argument names:                      '[]'
+  Number of coefficients:              1
+  Coefficients:                        '[w_0]'
+  Coefficient names:                   '[p]'
+  Unique elements:                     'CG1(?)'
+  Unique sub elements:                 'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 1
+  quadrature_degree: auto --> 1
+  quadrature_rule:   auto --> default
+  
+  Name:                                'lift'
+  Geometric dimension:                 2
+  Number of exterior_facet subdomains: 2
+  Rank:                                0
+  Arguments:                           '[]'
+  Argument names:                      '[]'
+  Number of coefficients:              1
+  Coefficients:                        '[w_0]'
+  Coefficient names:                   '[p]'
+  Unique elements:                     'CG1(?)'
+  Unique sub elements:                 'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal FacetNormal.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 1
+  quadrature_degree: auto --> 1
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0119359 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 0): array([[4.163336342344337e-17],
+         [0.5],
+         [0.5]], dtype=object)}, 1: {(0, 0): array([[0.5],
+         [4.163336342344337e-17],
+         [0.5]], dtype=object)}, 2: {(0, 0): array([[0.5],
+         [0.5],
+         [0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[  4.16333634e-17],
+          [  0.00000000e+00]],
+  
+         [[  5.00000000e-01],
+          [  0.00000000e+00]],
+  
+         [[  5.00000000e-01],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  4.16333634e-17]],
+  
+         [[  0.00000000e+00],
+          [  5.00000000e-01]],
+  
+         [[  0.00000000e+00],
+          [  5.00000000e-01]]])}, 1: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[  5.00000000e-01],
+          [  0.00000000e+00]],
+  
+         [[  4.16333634e-17],
+          [  0.00000000e+00]],
+  
+         [[  5.00000000e-01],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  5.00000000e-01]],
+  
+         [[  0.00000000e+00],
+          [  4.16333634e-17]],
+  
+         [[  0.00000000e+00],
+          [  5.00000000e-01]]])}, 2: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.5],
+          [ 0. ]],
+  
+         [[ 0.5],
+          [ 0. ]],
+  
+         [[ 0. ],
+          [ 0. ]],
+  
+         [[ 0. ],
+          [ 0.5]],
+  
+         [[ 0. ],
+          [ 0.5]],
+  
+         [[ 0. ],
+          [ 0. ]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE0_f0': array([[4.163336342344337e-17, 0.5, 0.5]], dtype=object), 'FE0_f1': array([[0.5, 4.163336342344337e-17, 0.5]], dtype=object), 'FE0_f2': array([[0.5, 0.5, 0.0]], dtype=object), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01]]), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f2_C0': array([[ 0.5,  0.5,  0. ,  0. ,  0. ,  0. ]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1': array([[ 0. ,  0. ,  0. ,  0.5,  0.5,  0. ]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0': array([[  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[4.163336342344337e-17, 0.5, 0.5]], dtype=object), 'FE0_f1': array([[0.5, 4.163336342344337e-17, 0.5]], dtype=object), 'FE0_f2': array([[0.5, 0.5, 0.0]], dtype=object), 'FE1_f0_C0': array([[  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01]]), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0': array([[ 0.5,  0.5,  0. ,  0. ,  0. ,  0. ]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01]]), 'FE1_f2_C1': array([[ 0. ,  0. ,  0. ,  0.5,  0.5,  0. ]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0': array([[  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C0': 'FE1_f1_C0', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1': 'FE1_f2_C1', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.5, 0.5]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE1_f1_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (2, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (3, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (6, [4, 5]), False, False), 'FE1_f2_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f2_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f1_C0': ('FE0_f0', (9, [0, 2]), False, False), 'FE1_f2_C0': ('FE0_f0', (11, [0, 1]), False, False), 'FE1_f0_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f0_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1': ('FE0_f0', (10, [3, 5]), False, False), 'FE1_f1_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f2_C1': ('FE0_f0', (12, [3, 4]), False, False), 'FE1_f2_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f0_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f0_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f2_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (1, [0, 2]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {1: {FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, quad_scheme=None): {None: {0: {(0, 0): array([[4.163336342344337e-17],
+         [0.5],
+         [0.5]], dtype=object)}, 1: {(0, 0): array([[0.5],
+         [4.163336342344337e-17],
+         [0.5]], dtype=object)}, 2: {(0, 0): array([[0.5],
+         [0.5],
+         [0.0]], dtype=object)}}}, VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[  4.16333634e-17],
+          [  0.00000000e+00]],
+  
+         [[  5.00000000e-01],
+          [  0.00000000e+00]],
+  
+         [[  5.00000000e-01],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  4.16333634e-17]],
+  
+         [[  0.00000000e+00],
+          [  5.00000000e-01]],
+  
+         [[  0.00000000e+00],
+          [  5.00000000e-01]]])}, 1: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[  5.00000000e-01],
+          [  0.00000000e+00]],
+  
+         [[  4.16333634e-17],
+          [  0.00000000e+00]],
+  
+         [[  5.00000000e-01],
+          [  0.00000000e+00]],
+  
+         [[  0.00000000e+00],
+          [  5.00000000e-01]],
+  
+         [[  0.00000000e+00],
+          [  4.16333634e-17]],
+  
+         [[  0.00000000e+00],
+          [  5.00000000e-01]]])}, 2: {(0, 1): array([[[-1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 1.]]]), (1, 0): array([[[-1.],
+          [ 0.]],
+  
+         [[ 1.],
+          [ 0.]],
+  
+         [[ 0.],
+          [ 0.]],
+  
+         [[ 0.],
+          [-1.]],
+  
+         [[ 0.],
+          [ 1.]],
+  
+         [[ 0.],
+          [ 0.]]]), (0, 0): array([[[ 0.5],
+          [ 0. ]],
+  
+         [[ 0.5],
+          [ 0. ]],
+  
+         [[ 0. ],
+          [ 0. ]],
+  
+         [[ 0. ],
+          [ 0.5]],
+  
+         [[ 0. ],
+          [ 0.5]],
+  
+         [[ 0. ],
+          [ 0. ]]])}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE0_f0': array([[4.163336342344337e-17, 0.5, 0.5]], dtype=object), 'FE0_f1': array([[0.5, 4.163336342344337e-17, 0.5]], dtype=object), 'FE0_f2': array([[0.5, 0.5, 0.0]], dtype=object), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01]]), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f2_C0': array([[ 0.5,  0.5,  0. ,  0. ,  0. ,  0. ]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1': array([[ 0. ,  0. ,  0. ,  0.5,  0.5,  0. ]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0': array([[  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[4.163336342344337e-17, 0.5, 0.5]], dtype=object), 'FE0_f1': array([[0.5, 4.163336342344337e-17, 0.5]], dtype=object), 'FE0_f2': array([[0.5, 0.5, 0.0]], dtype=object), 'FE1_f0_C0': array([[  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01]]), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0': array([[ 0.5,  0.5,  0. ,  0. ,  0. ,  0. ]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01]]), 'FE1_f2_C1': array([[ 0. ,  0. ,  0. ,  0.5,  0.5,  0. ]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0': array([[  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C0': 'FE1_f1_C0', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1': 'FE1_f2_C1', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.5, 0.5]], dtype=object), 'FE1_f0_C0_D01': array([[-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2]), False, False), 'FE1_f1_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (2, [0, 1]), False, False), 'FE1_f1_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f0_C0': ('FE0_f0', (3, [1, 2]), False, False), 'FE1_f0_C1': ('FE0_f0', (6, [4, 5]), False, False), 'FE1_f2_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f2_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f1_C0': ('FE0_f0', (9, [0, 2]), False, False), 'FE1_f2_C0': ('FE0_f0', (11, [0, 1]), False, False), 'FE1_f0_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f0_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1': ('FE0_f0', (10, [3, 5]), False, False), 'FE1_f1_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f2_C1': ('FE0_f0', (12, [3, 4]), False, False), 'FE1_f2_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f0_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f0_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f2_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (1, [0, 2]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.289391 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  
+Compiler stage 3 finished in 0.00133705 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Removing unused variable: n1
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Removing unused variable: n0
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.082114 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00114512 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Functionals.h.
+  
+Compiler stage 5 finished in 0.001472 seconds.
+
+FFC finished in 0.388001 seconds.
diff --git a/demo/undocumented/lift-drag/cpp/main.cpp b/demo/undocumented/lift-drag/cpp/main.cpp
new file mode 100644
index 0000000..dc7fb97
--- /dev/null
+++ b/demo/undocumented/lift-drag/cpp/main.cpp
@@ -0,0 +1,78 @@
+// Copyright (C) 2007-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2009
+// Modified by Martin S. Alnæs, 2012
+//
+// First added:  2007-05-14
+// Last changed: 2012-08-31
+//
+// This demo demonstrates how to compute functionals (or forms in
+// general) over subsets of the mesh. The two functionals lift and
+// drag are computed for the pressure field around a dolphin. Here, we
+// use the pressure field obtained from solving the Stokes equations
+// (see demo program in the sub directory
+// src/demo/pde/stokes/taylor-hood).
+//
+// The calculation only includes the pressure contribution (not shear
+// forces).
+
+#include <dolfin.h>
+#include "Functionals.h"
+
+using namespace dolfin;
+
+// Define sub domain for the dolphin
+class Fish : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return (x[0] > DOLFIN_EPS && x[0] < (1.0 - DOLFIN_EPS) &&
+            x[1] > DOLFIN_EPS && x[1] < (1.0 - DOLFIN_EPS) &&
+            on_boundary);
+  }
+};
+
+int main()
+{
+  // Read mesh from file
+  Mesh mesh("../dolfin_fine.xml.gz");
+
+  // Read velocity field from file
+  Functionals::CoefficientSpace_p Vp(mesh);
+  Function p(Vp, "../dolfin_fine_pressure.xml.gz");
+
+  // Mark 'fish'
+  FacetFunction<std::size_t> markers(mesh, 1);
+  Fish fish;
+  fish.mark(markers, 1);
+
+  // Functionals for lift and drag
+  Functionals::Form_lift L(mesh, p);
+  Functionals::Form_drag D(mesh, p);
+
+  // Attach markers to functionals
+  L.ds = markers;
+  D.ds = markers;
+
+  // Assemble functionals over sub domain
+  const double lift = assemble(L);
+  const double drag = assemble(D);
+
+  info("Lift: %f", lift);
+  info("Drag: %f", drag);
+}
diff --git a/demo/undocumented/lift-drag/dolfin_fine.xml.gz b/demo/undocumented/lift-drag/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/undocumented/lift-drag/dolfin_fine_pressure.xml.gz b/demo/undocumented/lift-drag/dolfin_fine_pressure.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..7e047fc3832351929f9c7f23bb43f9f70f6851e5
GIT binary patch
literal 49720
zcmV)5K*_%!iwFQ7^h!|x1B{j3ZsI@;h41?mQSKRRk3F_4XdeY3es)>WPysE~KK;78
z6-kqeotr3-<kQUYIcFBnA1}w|eRsYbPTjJ_1nu+F!(w|n?hjoP&$`RwzaPu?=k@yf
zIG^8cx3u4Nht1{neEPN9T+`|NqkVd4n#KOD+gt;*+ODtb=5qMGTef7y{yvT8+ta=|
zblcs>vW2#JUmxG%1+i2tBZHH$nF6-WW_LWUzTU(v@byo8zv{oAPpNpP7EEp^**Uw2
z7~}~RYpFC`tFnm|HY|qf_MMt*k-0}gVvYT0r5yW*F%q?w$#*7m63m%Ufs0F?NQ$}C
zQsqvil1yXMC`CRm6Dm=)q~%VXp(S@J!2^mL9%IdGp*nzKVsiT2Ke>{8M^d$>)+1x|
zP7qGAZ~*CK_SH-uGR>vrk{tj{(0St0YAp7Vnt6gq4T(Y~Py`<dfc1&OZ`7io1jRIR
z6}RKnmU?a<s+lGYJ&DaRE>^sZ$Aw(Y?UOZwr~n2FB0{JP<78E*75iw-atf<zv_}*h
z1$=A+%JmcLvo(`cR3K(W5{`BBk+yPQ{r|CLh-H<iS9YeTEgEA9xH?{_Llp?!oZT$!
z;4%)adUe6zAY)P5EFAWVA{1pBX;57+ILH{qQbjeF0-0f41<2LoA{gqbjv9eQ1nNV2
z_dqps5HF0AKyu8fM8DwlASA6X0~*8&J!QqP7a^564~CBYLwUK~N)UrEw4)Kv0R1<%
zp4F8yLq0CsfJG7?<9y#L=9}<Amm*@hz(EiKL0WQYjtwB2E~y&>rNTq45X{<hOU9}j
zE*3(?u*EkEo=3*oeAJB=Q(mg@KvAqyQ^$!V8>^BFQ$p|Cg<!1~gg$0fHdLv%t%wcD
zBv7YDl_bq)-CTuTtZ4#E!T(5rR<L}&3zQzW$`{(zJ#d&u8`Z{x>gI|SdqChQ^}6Tm
zo|?bDZm1YgdEVh?C@e0W)x~3`R3EB(ab$o<4R4Y<FPHXElq+FTBuaVcu>o^_qy7>t
zV$>?wT&y>18mE-5w<gxVAo~|CwZGDm`7_1)_(4geRq98cNZ9;V^F6EpPi4kZZ5J>v
z09s8l1REL+%j$Tj`8R-?Xa$Bux9&w{+u?srerqaW^*I(*c9_P{n;eq(R+MND5*w3b
z+9mO^a-_4jquY3kn03jD6@eey;ZXj;qSjziEPZ?g;C(v(YV#{?I3@Z&XBwkfw_*K{
z`wu1Na^+A6!_ba6HvZCoV<R$)7}z)s`0x_R(sg5K9P3FEQR2?IO?5vN;nf~n+(c_2
znz8g2*0WzbpI2X{#ZD9>nHdg^fA?SF=e7ilj;W!He!hHZ&L>LxNovJW<RIXjxw%5#
z)z?3NSn(90qQ(?}#3Y$dlk9(fF%>Do*(7)Om-T$Uw|A5kTM>xLu}mdVe&bH4KKWVk
z6wSe45>OgAUGt8T_DDa92_c@aQXtX1Gf%mHP>Ji?@!I&P>2c`~BF#fi!GI@Nm6!5+
zrfIiGTZc)V_j;bJ9}7Gj)gJ3Lp`iUuk%HI8{j)+9ZS#ALs2J#aD17KQ{QgyKNqNnv
z9Q3iL0V3qNCbm85a+F9(HU;%#_dh+VT}@n1)`66GqV9)2*EEQ&Eh?`Fl>@K~dL&GJ
zXuto`;wS)Q#6C&{x!xxqVQbH<38lj(sy_O+Yvzm4(HB%fsN655bg^7E{pPYChJGDo
zG4>5v;nZ0Bm~ySDel?G;pL`CJ-J<YU0ZQf#dwIR|k1}gJk{AYI9c8e282WGQ<oz)*
zdpBGIOmL8p#2-admadQS+6krmGM;xnH)i`^t%E4zXJ=iXi5d{2Ul^rdHs$GtL7lSu
zXI3dGb+pHS9aJfvHE4pPb-Rdy{{F8zkWxkeJ3WD-`f&f%zxU<&vfTb+%$4reA=2)^
zugz2Iy{7Qz!TVvW$g}=?CO|<*IOHBtz(U~-?o^KZq5nY?T}AqFnbWUDqWxn2x;{<x
zAhdOzd715h6rH)~0{rlI7nF_6YG$J?znwE>km?TGJVuE!M_<^u<eFp0g5#4pL4Mz|
zu3b}e`vyHP3KM2ZC2#__xB0>?mmQGED-7xz%Asno_JI3=jL{=-$CHI1YjxB`)Zgyz
z8QnTHV#3ryE>*$Uzw7zIjW8x)VsCD{0C`)Ig6I=m93%<W#^9Y=>x8+NV(k05bEKGj
z>f;!Gax6E38!Iq~{v$+=$v1NbW3o1oNUII&U-&p5%|sZx6C8)nwL<gOKSPDQuaOQ>
zj=5zg=6feMq3}bgbsR|$gTRcYa5Chd*fsmOLgIr0SXRY=+6hHRF6tmia}2EPgmx-H
zTwme&%q;+PtneZ%=(F5|&{z1r&JN&WLA3>5jt<`;FZIV@=VWI)vEyrRF|U4%w~@&`
z=Vj`{JV0TC^i}EHKP(gFz$|R?jXfajE>(lGAIMVLF@u7{UAV9fD=dV25bPn9mfQu4
zc*n^AIJj7=*Y#33Et!B%jNuTbpi>a21#kMs6jKg+_ZLPNeh!i@vp#vyKISlGIR%|E
zC+IH-nri)Q`taSdNdfU^g7%Wixa0ZR56^xce!_BG2I_)A^J33wU-$pi{J&BgABdmm
zp5O_0hA>~|)~~b!ql?YeQK-yACdqud=o?!bPinwdt5BhS2lzD7H?WEfl1f%h<@!Z0
zE1fN{am!vc?|G=IcaA^|Hp7ABH=B8BY;n|ya4h^?@%{TR9yt5y{Asw!m{$U!EoY_v
zRlxIb)pS|p-C{a!1#Azy#p^ICeX?sjcL;N>IO_ax+I_f{Iw669D{`kFnRfkAYDPH{
zgdh;T(MCWN?|-qa+Mhw0Wc32XwgIW){TFg==KttWG%{9~6Ql5P57TJdoH}k(hM;+W
z!PM4$cU9TEI!sza=5RZ`@9_{a)s-5NDuPdn>9bg>_amnyhC&oc1<9qn03BAO*ZrSL
z5QPT?T@%g(re7-Hful(j1tblASDPNKBQL!QrH8O1TPq0YGTP*(QYxWz-v$y&;apLN
zbs_)QrHpafAHqg9?I6HOE1E)$_EUO11l^p#j!MOJjA>x5GQHTnYbS}N_zSzDy9N|4
zH<w3)wFjzBHaDoz402(0mB(N_99H*L$fR5hzEbDB`H-@ir$E#8)|9p7?&s)ozXX#F
zsc6W7<}oMHr}OLm;Zlz+uy<dmu2m>Kv4@k6?WBs=T4^$S4SL_Q6H>9rmJ-txB$i3R
zY2@Vsk|W5al@TdvibwVv1%4m)Q(B=v?tvmeQ7Kho8DH<SHGvf|f1tKHHw}|bwm9Ms
z5NKj60ySXPA&`7=+ftzQ`Ec4#ZB4`7dO#Qj2F{sf*DvK}b|XOy0?~|Gz5tVdVq5Ib
z(55Xx0*Ll-*PEXUS+mn$&Nj7y;)((;jf1y&%%VHaVqxdPtc^*tVTxTE^~-#KInH8^
zhwa?H(7if;XsuE(>vD{rE@-iXOmNYtwypwY?Aq5u(<T@rqUhslv?M=pIMl)_7YeL(
zZyAG4%?$`g-mZGo8gDu`0!$3G?Qv5s^jk+<AkUh@7>hZpE9hDI$aTa8wr}H&u*nF*
zY<{6Ud9%YSIv8MR*tKtw#K$cR$qu{NMlfqPnnN)w_8^vUK5`v+q5S;MooJ1C0{DE^
zu)^PN4)%i3dBkqML}yJXOb0LeVm)G&3$;;p0QsrsH}DsJVO9~bYUDki-_Hf3`>G$U
zeBYwGlvPM~zH3=|ez-fFqMdi}e9k$5B79Lk#T+tmS}AOE4w4AI<nz)o5y6+jZ^TzC
zyWq<^l*ew<$UKsGOu8{If0SE6j>Iqs`_ZTgA;AAXwx%n!A@mRqb1bSl0UO8us;W_*
z@Q1NKS>v6P7f#cAvRwlvj7Lm#H;w1ZCMpC{uB9x<0w9e^Xt;I0?S{wm!LwK&gdH)(
z=?!0)zG*uxkZ1`=F)tVH)i5JJLPV8R4uwnt>+rRg+@hI$I_IXEwzwa}oJ0fECx$P`
zZX$YID9eE~bTB4-)Z6|fDMiG+P<TNL{ek3(+sLu@^&Cz*&;PZ>1~I^%1jvp~09aV^
z*7Sm0BP%Bx=rIEEzkzrp12j7F9En#u#7~E~X0L=3hF4C+K?=fxUeOOi%{^B9Lhp04
zU4Zz-GNIsP;%dc3++QQ{lV>__2o2G~iB%Hq3nJ}bIQ4H~h-nnWC+U>`>sL$h+Vi5D
z9F9Lwc)Ddbg&@xXQ+b!}?_|NHdrqm#c_-+M=HjjxHRc_>U%c9RPN!+O(Zw_zzLto4
zR}&+ht?;(G>Y>>7#$^142=Bvo6vSJ#uuHjUJ?_dMW3iAcYZkk!`C$d-_7@GGK*IUi
zT3i!`g_5TM7RWtek0Ixek}JxUAOvAIG6<+}|BF4k$;+bdhs*&cjw4V@%eR;p*2+7<
z7C9^8E5QD31D*DMXnhx&OWYrnW*i1Pi({dRCCP+STc7T;2`;F1dab<xJd$W)G&HX$
z4p>CUkDV1MxK>k$aa$`=4hk9ZI<c1(wjfn7ZZc%5IS&T-I2mCttaWo3a-{MANKwgt
zj4+UQS5WsHU?A`#AI5{p2(r#!Hr~5qoKzDN)(C+VqoaX;NxtMg)pAlz%zz#JBgNpU
za9Um};dh^9QcZ9JUj@4ztLl08H7fX*zY(VJ9YmHj&|%6KIV|tNz)3LCn?%y;NQeRK
zZsetvolQloF)+PAsAuDB6bl#jH3|O|7@QRBnlYbeb`>^YZ8iyVv>Y%aVq8SUyVIDq
zrjyMXA8wH$*1Y*!lEQm^zb-(D6Nd=;h7%gS|EsK)AUFlkaB=kYFCx(1!8a$hg!P8m
z2o?}=jiG+cNAQB@KCu!F9=Q?c0H!VnsegiRdVg=KVBX^MY1(JObp5i*YPY#ADhgZ6
z&}HKUbMI6W{|hGmD7k_o2VxM`(G3T-vHNfAq~vi1KDYs9XTu69NPNv+zf9U214DS=
zvM22Cbu}3#CIcvhf;F>B*bmL+!Agh*A{atR8qjNIiuh1BMi5OH7hFJ@OgJ7)7@8at
z=fh?}<D{zF)t|PiDby=2GSFCVIVIlj0gYZHC)uFAx{TTXx7;XNV!cetu2FX7LwCPu
zq=uA<=3AgZiU<6m=!m&{wiVD(Z5H~{uQ`K80;n!toWMix{Le<eW(mo2F$TI-zp00x
z$xHGaWb>16%=U{uQfW%a^QsZmffgT{`$N@mF9}$Bn8Q0H@l|;C51B~Nozv-<`5>T{
z{@1<@NiU-W>u#v7<t`Y8z`^ux`wZhUN-XG3peLh<Y}x7+csS-_fnq=zOq8XnFXz(w
z?Rq&S=D`HmPzD1}32{`GcYP*sStSl;02kSm8(irZZ*qUjrWRLB+qQ1w&|1YcHO|93
zxW29*p<#?(Oy4y(EPZxy-=7dnmI1A~Ofh4NBh}i@u|G<#ElFSygq>(R_=0->i*3@`
z*&_BsF2GnT7$nKxd;5Q@L5ZVIG)4H_`4RU#Y!9X`NU$-0H2d6{V~K;{ohXD%fsTD>
zJh`!#?TNJp-MkEH=ui)Iqqk_HiSvFG$XdRhlZpid6Gx4S%I%mERQeXQRQPGnD^%Gx
z_WU|@REZmLt%>mNYD@)-jcj6T-J}b!rIPX9i_Os-yVGgiPQ#jK4w2m>LTdtT(T6HQ
zJgAN-F*%$78ba+?lbt<POX3_jOn8yyXv1jow!K8Y<i`VhEAfmO<O0njfC;p3L#m;P
zuq)Az`~Y0vrW62|ZR~y?wl0R3lMfk{5O(h44oj@|&9ExhBeg`wY4}@F4wZP%a2$zy
zTm{zwPL%<z-y?R1RuXG{6U-DCmh?HCuG#cM{*kab)5V~ZlO$kml&{T0=v=B&9ZBM+
zUP2)?)+@+`56{zae&3Gu4&$g6?PgKivMUjDF2!4cwKz_s>0wytIXk!NqOod#uyjyV
zn=Lk6J@NUvP>@hv1^>R0+OsED!jw-JQ9a479fj}#UJ-JQ01SR9IkzJVLJ){Xv{S+;
zO8$v$_k5vL-I4_SP~JA@=dpX&<^I)M9U1(boZo-WX;5J(-=CloTmjNT`cIVt^HPH@
z0}p064eiV#Utp#A?zk6BX#`dXXHakgBw9;@qIJ({(jeU6Qa7OzjYQeB1M?PQp=}&Z
z{`F8+uZXdBdTe2$V=;H3-h@%%#hSNu4ju{y8-W%6z^d9H1qGFXrukc;_ln30L@iwE
zYW$+@E&0J)s175u!XIi8M@K>6<m#Ov=3WD&LAPNO-o<$qs_#B5<9g@4ZOy)8kdVDQ
z@j8+hK?=qdWE<Vdtw5y#OMr{zCZRBc38Ia^_mNkSWJNgP)VzpaP?qc5ShZXP8)%nV
z)vmKRs@%f92;!3rEVG6#A+_PH0P75*4OAQmPY7SQ3TJxM6SZ@13PG~*DoI012SZaJ
z35>H^0WB(9UT7)<hWicA^IG%$sX?`2WPnb@^nqf`X9hwSKD{>8hCKSc7kcqTGSNZ+
zTl?(L;bPX=iJp_AdwPbhn87GkA0&+<HBbp~ejnU>!rBwqt8iZ7kpH{Gf6C4!hhY!~
zqBp8c%*Vd}#X6I2!0y7RQo2KkfPai%jw*LO=(Ke-@^&J83<hS-WDYLEBeU2X%QFu{
z&|~fRV$2g^)*s$fQzaRxoplY{;}YjNC<XDB_UT2jzz@(m`xNHt_$_1~sc=}|RUUhT
zksJ71EQl4pi&B)Q*5F|;S~&T`x-0P57pw!RJJ!IGnDt`N#MxW~P2qK=d&!H-GoNv)
zloMd7{}8+DgT{(HybXK9ZKU>u3m4#)kf_6WCl|r3ggn$o^}WW+u&q%~vEaJX5_r9)
zp}R(d038^963Z8RDk3wa&R5<f8t~eqy^W?O#O|fAP~?JIeS8<BA&>is35bqK60?g%
z*y6$u0->j4x8h;ClH#;q%(kCbvlB)TXBM^~2Ag$@t-D4;-lW4iiv`y6S*Wv7byI1$
zkm!Jj1+Q$d+cZKg>e2^2bQ<e}Er36S><Qnl^|k_)LkFci0z&Yx^cLqj>K;}PnMS9H
zZTxDB>5REt9f>ZxPKU%n8DGk-Ek}Y71m38lB8d0D*jDxYV3Ta*0?stbyC_JD&1fJM
zj`#hs0cE(j%BLYQB009_Z4>vD4iZ2bn;c3m$mV_1FJ!GP2tiI5GrQh04Y6`2k}AA{
ze#}+bGKDQ53#BF)*xZF<&$%k+wt)^KBYFFdj9rj|MFVcI-`enFkZ@|!NkPE^Qe!bw
zMoi(zVg}9P7r|(SV?$Z~1)g(XRDb!el8O~9Vt{H$d%7;dq&HVOBz@3(!aj*m4T5gv
zNAZgHkYCt6a!mqSV-8Xg)7>_XHm83p1#c7Z8XSs5Xom>dpcBo%!Q5PhW1|xz4v?I6
zP~NGYn92%{A!0V*a`E*X?%#+JW}c8OT$!F3Ey8X@v_#r{>v8w+8VR@!dDuiU79$ZF
z^h}57g&h>@V9`|JPA(2Ut$bl#xG;}sODDSnsd;Q_at-&b6p17k?QNwr^1ULj{U*u<
z!5-^El!4cp!pdP!>q73IfSi2nbhJi>2bVOObuZKa+Yo<@1gee0ExPisz?g-NArf(s
zY<Nv4l+|<n)c((F{wTYGB!NK?_M+{mAl3hWY?JN<We@NHr=t|agydXS53H6Z2Szza
zZA+tTOuh{hFLXg2B~C~qun-JULO(AWAcxe&gNPMAK@1{*_r0UAx9<N!3xfQ@`#0*C
z2L8^w3h}i(q9(*sIX8hFw&2V$3qCjE`SM6x!-S(woJa^Mu@Yil?82VU;z*Ff@wvBD
zn-zR%TqmXvEd+(q*P8=cBVZKyO>q2;ADU>j{>SB1{b!tR6e7&4U94vkR%?7ZkjU;=
zD}1l|0aJ3%sM3OKbARt=*}{oAiWF@s2P(tlYex%#unT57Y6q-D;QmXDWTOYQ{`{)0
z6+=&seAwCPE_68|YL^ubY@PI=7k7k4wyeC-0wiC@^y<cNT0%~14`6s+9#jrv5nS$(
zz^DXgVcJJpVbSi{;#57Fn?@xPm5pbi=FS6R-h4jZ%h2US*jDn~PVxK=qP9ZXQ77Rd
z$i9q%pO|NGpv|WTEIKkW`*v{HZ25TvaTJa%kA7n#I*=7ney?5FGhZI(@r$9VkT1;I
zyQ5am&Z89Kr7k|vD%@xZ0Xbv6U&_uUxq%o2qBn9$LJac#FBYCt<sgxTSk2BQ&j%W4
zy1%LHDI9mjlEG_7xI7N*M;^0|LUK6FMtBd_8i?ba2&~Yc3Oo)QOxjU+wyx5X@W69F
zu#-UK@Pq?**ujB^Z<Tk?PI&jD1=$=&<b@^f$85*WzR$Z*kp?1%HTbA~;t!#IO+m48
z))^J19N`RQp{g;l(Q|5f|JFVSSfr2AU<j<tZ)}CmPhfJuX~G*A!C)pASsn0xQA+}u
zLk-cvkKEX7x>6fhSK+u})-1?bPDps{v1>l<J@kkMB+qNoSw_)y$UiGpg$g<<aiE}$
zRmAXQI4y5i7EWt>RfY$Pe@(R468gHov$iQx5A)o>=5G75PxyXg_d(HQ6Z>8)L4s<Z
zkzEJ10F-Q_(+iXUPdi?ht`xwu&{(uh*VA$5Vr{ce$p7ams1<&8Td!1b9s3lF^3MI2
z`+yL*9EN&~heL+Vej_qls30pOwwZhT|5u!?=C5(kS)LcbVqkOh<&Vs9y<y<kvQ9*y
zh7M#7daJ8{hGS-$B^c#CH~dg`E=Lf9FbwTz2QZ(|e`71<gsmKK1I%tFAtILa>@af>
z9WyDBumwYTXw6GWyv<KLN2PO&tW5k`s8LBU-!JL{EBO0R_b*{%i3**G!N}?6;0Glf
z8L;wdETfE>y~KR*Fm!Aj`Pam5i>IM}5Y8>}zHvPqkO)j#cVg4KWFha@TqgjbP#?YO
zw(dT})UXqPS7+%czo$0h!&ss$bK-=sJxv`1@nQ!ji?x}=0TXcFT^x#gR5JMn5qhzV
zCb7@%>O+PcjzWKu1fkrL`&fmY;F9OZA^V^?`+<sncKi&Q_>vNw9TRuhSY!!UoZs9x
z^qaGGFcnGYTbqhl>4`flT00;;=^<t(uPl4N%Zjz5vhjcN`bI)Q;wA{zjxsnQ$5tXo
z=fvGA#tx21>y#pcnn2#!-aZwHe+lUhX++DI@PqGT!QDGM`2B>A-|>>1Vk$5Jk@eON
zoJ8>e7^(E*qaffOd3!iJc6lZJVtp{KWRVJz`%_~t7P2)g_+gT{YrpILNud|-_~rDH
zno|qqO#?fB%B}>5VHkw{s3L@1|Nq$RPTEM>r0{`=HVH>C_Wwm4bM8ff_m02HDNb3j
zi<!`-?!J44JHUP*r;lTtv4rsNhU}nDn5asFuZ{XW-4fQ$2N5lf0*OMAbVS0Ggtf~P
zNn=?QV6AuDu@RLu&RJNk?2R#5)b61Mwgo!%g!1=3a7mOKl5bSrPk9wRkF~agJKzfh
z^)4|DCNbS831h2Ik|$NSlnwnAhq`M*1l*xJsM<(j2}NAM=KOfAKJV$9gLf>Bb)#5D
z6jSolJ&7%vCd_p~?7G>m*5G?>`+-pGiDidtH4RFkSB@G9rGWy{XG-GS?&8IU1mO+y
ziGoY5ChT4QwU($qWc0m|$TRS5&hxi$^8gQu7$JFQd>mhqg3q3v-w02}f%u4BBlQ=)
zzl4F9#G<<0U224J)jA?PuO<A<M#n)We6oU~!VTjvEpfU$v_lpW8ai+Gt}MF5#2?rn
z6Z@bdqs&pBdu55RpgR+y5TQOP-4KZ*O5#|3uUB2f=iS~A#lnh&YUlJp=71e~ad1sJ
zX@szN|9}@|SC(8s2m){PDhPt!|6-v{Rf6&nxPdi;$kIzZYa?+5T*tN#7@X_iim_!&
z3zkN}@-2f15h;IZ#U|~nWm`XP0C#Nh_STz5LWa_e&SS23cfwIfim)KxaPN?85U<)e
z?KMgS1_$oQkh{pJKfl(E<4W9Gz?oKI@MqxQ?mVQdUkHwJh@^V{7#qsEw0*B{0)#J=
zqF1#383@1}%jU0*R2$VfU=IStQH=eF(_Fn?dGIx^AD(700>+vt&CweEq{91NhA4Y|
zG4u~l{%gBh|EvMpfkntN1(6Y>#Feav8VbSkNOKTiN#5zv9=XwP)QZu_#9)8BfEkff
zcdU0XQ;*pI?O6UWcp(Q#Edlv5wdM5@rO34un-CloVE$J2uHZ(GC-bhtJ>w4V%9-gE
znH=?}AwoO8J`*HHnNZtgzrVQ-mqv)$<+U+?P?}f}zim^UAte#p0c&9~sO~B>cr)2x
zH6r0+Uy3m(!+@5~Oz3KKc>&(R$hJofaS@zi(sgJ&k@I0+9%zF=1}UfT|A|81lwH}4
z#UKo<Xi)+_NdJxPOrEsQ;QcTSM2LX#F~|3_(d(|UeLy}BrGR$O+d=fwHBnS!uVavj
zn>rH*`zos#9HrCQN3dO7s{SxWX$}e{(~{GT%CiYz?se{=1YCz1Kl?mLKl^L)wGYVa
zkUt5q4o9tkyxWA{rUQX7RgDKHU@loLa*d7zY0B4!^KY#OKWhO1vz_iHsGqeb#Glls
zRuW(xA7e(j@f@JIyOOVy*QNHv7Qt+aWfP+L%pobYw}W<KbU|s?t9XLdjwfB%QMa6t
zsLpW<-o=~GBA&0E*Q^I!KU;0?_`kYy#-@@B#(IQ}kd8(=FXHpWoxRf0s!tfj7St5Q
z!hI<2mvFw67?USE>)XsqP}$5mJ(Er9q0m;bQPN_V)ce!~=NJc>cYt&J=v&}Z;2c$c
z_jJLu&cu{}=eQ>h7cM8gTJ+Xbh&^@kg7`9R)|&`jq%a8H@{g!-J<Rw*#YBu{y+{G-
zyu0oP%Z(P}jVxy;OX%uEu<z@wAFybx(k2B}ka!a{)swqS9p5AY(lL8O@kJ6EBe?Ex
z(y#-+l$}YE#4rd1zog9w{r_V_YA#3|S{(Z7aJVhZl2rY?=mB&vq-AP>n4yFYc;d@A
z4^8^Id8w^+aBrK;%*&;Rrm?VPP&-gsiy~u*ywmX<0y2fWn>2d|qW;T#UrQbi=nzB%
zzOn^HFa*DYS0dCpo&(_%At=%Xw}dVfAnSdGIrM<0@P929Y%zYEC9WmEU$$Surk@4!
zhOloGHcjL*dQ@R{t{{-CV3H_NP)lOI;E|4sM2F>G7z}R-m|$N0es&$x@v$#w)dI78
zS}0*xEYaz3SO=$!iV3iV%q~iMCZ2+NPo#m1;3)rD&Hbk(KD!6hF|EWUPbRs)duc0i
z$kr)LZ?6ERnlPVtpn2bF8y@Pgvc|Hc1qg2Ubsw;I;l<&I4(;r`qb9RxfrrhQ#GUq|
z0#U`5V6!qkm_e1qKx`eIM4eNSnG$TgHR6u%D`>+}9dv59*+BzWmS7{0xLd!8$pEAX
zfu{9a1LaH9;TP1=;chBAp*N|W_}VV-3TDBjkj|3QOOM3<JDoecUI!*ihzZ!wDv&?Q
z&L~M@5CozpT1zp2-v46T?H7ivEph?MafoS1^Gr&4)%&yB?<#B~X?Zh&tnQgFwd!F5
zC6ON&v_p0omz;0DkorqOBd-H-+1?mu{w{k^v@Q=cxH@olPv7UlF<m%j{#dTn<6c8z
zI0%LdJG5f9Gj{I7diAnk2)QNDv_?acr8A)()*{{%A_=t#>Stkd<}GV?J!%Azjz)^x
z#$!ScaMH>jwl<;?S2Hrf99g^jAEW;t68FO54B|33)YsYBlnG_AtijfyPg^p0Ew-#V
zJr_-ND~<+Z$B#GscJ`EsvLf5>t-b1bFs@PzrKs|yvt07!>oz}xotHBWhxjJX?#P2=
zKG+{N_lYP@{QsO~f{d3;RTr<15o;uOjNXn|ehg3W&Yt4>=LHScj;+ny3D@ZJ+#&j=
zY1c=(blhYdw&xZqe(Ni*wmu=G<6`4*RFGU^2wTq|0zPc*ZJ)A3Xhu1L{C$gisk<69
z*gBNPPub6;teIIXbNZqlcU*l{PT$RE@N|6led=GHH8?wv2MZZHmmdT|W>5VmzkVsZ
zq8tlC5O$-DBcOQyi!C*I3CIszU@}oeDy4ltOMYpI7$Q-iKvUvVYMoXpGw`QuzYqax
zi?B~VyNxSy#;%x!f$D9L&Sc<G&j^m)p)jxzA~>$l(*4%V+9(rdG;7AggjFCY8#PlK
z8d0mh5;tInK}2Q<cyJzHn2l@4aXbk2I9D}sKyE~{ty?|BD9o`yM;U!VnDr)k`MMRh
zIEDusfSw=GfHj7d`uQ!maXmPO2bAvYdiZXa*bqqq{8FF&7NS5{h4wSX8}0H*BaV$!
zLmblhn9!}zfjT5VPt>{g67)N+Ycp&i?2dZ}F1XI!7RT<e__AaG*5iQIe3Gq@#=^R3
zOsJeGTqB`$$Iq|s(fFwPR_=mi$5|KZX_n#Ijp#a2rI=BNGKkw}rAM_g-W9LiG5^4=
zg?r$)vA(JQUf;0SdIf~iwQb+lms=S1_LzA06^xF443WwM59E{?>uyxy2p$K>;r0mS
zdPJNA(d!A9pED*43B@Y07eY2tEk~9j3jAp($DrlNKKAuv%PVTm>}#DkEOOT`SN&6V
z21yKrAQ1dfYE?w{{~rr&<$#idd|)eO6d7z7R}jDd?3paCfzq_7hlasKM3mhcLYf^=
z%gM;UPStS#&3F5ywx24frmb!$P_!o@^!ir#5U6dF)pjq&XQ7_R!Z);|EZ7S#5AE^B
zt>b<eTleNGCLk9IPJ_Bic+6{(2#XHyc;zD<v0%%qf09s5+_?_$7<ky@U5~R54>}<z
z-iI#-d6e-{%a0afjCpnBYwv@tgFGhO->kIHnj))DoOzg7TX)EWt-#br#<d1F?2%d8
z=@W6W#MbmVosJSj^t^|Mx}!X_1Cm){`z*(=SfMD1bEaOB;h@R9zqTy(!htA>-|IM!
z&cn#8w%$4-I+FNg^=YjMrop(!2cwL08&pZi28VgPl+_AG4pT{MLx<aa0lz!YgTZ{o
zB7%i*+Xbhi=6&+%AP=0@Cv!A;XQ5p`n59T!6YL&+wyR2Ec88t~i7inC^^6Css;s(d
z1%N!swEHvb7>~)g9g{^J|Cv8-3yFW~^_MvAPIL$js>`Qz9*Jo913bQzUCWgOAPDPd
zpE@Yee`8C$49Fay0S|tVKuEsH97ryhHlUQy)~|r0cZeZpXtx^%`N+sdy$uJ@%`2uy
zP;5CuYfF-LtKR^AJY_dp!@#(2@!&Ly;2cHl7gX$k!<ACIvHk!Yv4f$C&MIeF;!ZQu
z2s=06c*gpbsD&({ZEAwH+6Y*V+A)D?=Iyz!+bDmR{WR`?c%l<Bc_tXaie0kY8mqrq
zFV=xM>T9>LFe38)hmCh2BNTrT2Ou>Bamp8X)X&Q?I}ly2Issq9=K1!6xUPb-WrgWs
zg7~c^FdGHnq=!?_IVDi1HcUUS9q`bsSE3D=5S&*Ge(``{o(02PrJW5$>@BgBXjmC=
zanKKluMH^fh#g1%u7w;FRkuCfH1|FmyAUkVK`ftG*TUkQS;ncptOTJ3<XU9E&G@|b
z)s3H4g5Z=6RCCrqhMW=@ZDa)+*i#l`A)ZM9A4!u@8rarRJJ4GoTlZjm1;TNXh(q;V
zaO{qQfe29H?GI;o`(#2={lpx>1E!K2K0K`8`Rp`^H-F5y{!?~tITnL34Bb&h+G4`~
zH#Rmu7f4468;B}Y$OCiyZ`^mmgh8|helC+wFfDBdyLW+h;1buaJ5L1n8q`zypqQPb
zswhr+f>)#+3SCXfpW=PVWTFB+lDL!_r!xH9e5=rxr(%rQs;o|2vgkcO9LOeSkw;_O
ztidM>MV>Vu7q96*0h7q13BJ!|eFuB$>oMYe5ZC6rL6}Mpsdiic%?f@};5Q$4xqoJA
zK~bBF8)2IG<mFi?3wnxu{xG{4wqIf7V+X77E|YbE(WTwqeZ)LJ_r#>{U^6ZuAwORF
z4tAo!q^=w+EM}Pb&ANV|ftYeaVV8G3L)jRmaH*_4nojrI^Fe*lAoPY?fGjBmLMxVk
z9f7ir6Nkm7i7v6jf$RVSjG5YD{VG*f9D3EZQ#<Scu#DN21+u7e=P#=@2#<v9!1M^V
zh^Q)i+%czTHV+tcd-8`ZY*A4$9}EnJ@Fm!_+n%?#z%1|3u)Yl@w!E@Eu=w&@Y!Y{9
zpvvu4Ss=iJj?7A)fPmSQrCr9p`IUW4g})ytzWm0uSwkgItM2t#*`PK5qwL&rBnUw$
zx}vFciz4oSW5enBLFr^<0~JH0<Z(G<l<56uElRij*_95O)Z?WTffderY!+i}hWnR4
zjmZWD41`8)2L*&Fer=Ub+m}66_pTeH9Wp!&H#Y#q^|z<Hi7;~CBiEqru>P=6sgXJL
znLGM&ulUlS?pW=aAFQw$y28{E(}It+eIV1F%M)Nqs<~|;uT`+Zo|3uOvW`MVKY`Fv
zcyNQd<A;G39@_?*v*)J8+wN=Cy6HPmVz4P%sDety7F)r(7S*sQ{|J{o#Qicxd@rKX
zNbt}{KZY1{3G*CjlJ?%wg1TeP2Xgc4Z#pxh1=f8DOt<YU%d<#GcU-R~c`mVV+7<~x
z+*e^01?!SC#-tE4Z|V;9TjnQa1hLO_6IQ_pJ<_7OG13B)l_7ys+;EQ;&>-%hOYBKg
z^XzF251R5;`hpEM(i<EImVl{FOJS%KqFdSHMda~=aRzJWQ7eDODDYq;&wz144?PPX
zt-#vWAn)+xTp?Hc9|2`}&vKkXY}fbNJ&&X*S?P&n(|?f-zm#1;jsPJD`_X1l1o{8R
zmYUrJhB?Rw%!E;dTH3H^U{KKyn_?<&EY(q{DBexo?*q;nRNjuB))c^aG3mKK3!Kq=
z!_<Ke=z`a-w1FiE=ex{~n$Ls0P&Fp>-p)}tRg9RAz@YYcJiJyb(MELTWm_c+z{kYc
zdYSNQ)S~>-$iaOMPvV+s?rCJg*#k)-txDr~^wcpo8jZhZ5mAA!6nQO*(y_Y8KaF))
zDjS($s^guNe{(4t`TqG?0?$JYOwa+4`8<^sP`Gh|1I>dMnD^o-e69!6gzppFfj(9u
z1*7!v%Y1qwB(^HU)QE0AYk~ye`H>56!W!^TV0l1w1&%_HUYW(M$dmB>trJKd<o&}k
zFPH^7pda$Jqw%qtoCqKp<+lTFh!6i<ZKScN<w2gt@TLdjzFjF=s}Y6l&?5Vvq4egY
z_~y9ZUV-GX!TT~a=VVAX#pd-s0@<O(gMf@+Fz`|;Py7v>A{w-SQntqi6t)XkL!A)J
z1lbvQmA<BZ`Dx4j5Q-!@k24L9miNfp{H^;-*|i*541=(WHiLhF`)_PfE)Sa=paBn)
zU@#ygH-pRj!J*J151586G%AwBJ$cFB1qbt(0+8B7$~9weH&}&o#A~zgvq4QKp!HD+
z31?`*xsLuKSptJLx8<FW&8bd>|K*A@Y-FLix?dTU6?h6)A<oF5f&@acwJaiv%yCC>
z&BIpN!9BL+F@bul6{zheCiUA{FPwU!Jp>q%7f^REUlcBa1ACyMvI$#QmK`~wvn;*m
zpI=^`MX{P^)=#Lsu1H@%`Bhc+@+=VlZrdJp3MRb(q-h0FZT6Ut^~`2<jvY(b+6_Z_
zE|@E4d9E154oIDbCCxm9fF0zcw+CiI-gJT-H*PKGpSE&v+z%8pYhYk%S1LL~o@;;|
z>I1Cty;~V6?;Vc8h6-H@ZO72meincviU!E-3VBb^E05vpk`)azuyW;(94FTTzlb8~
z9}3lONS`=&`o1_6gvIJ7L96*bm-C1s_K1&8R+B+I74sa8K+wE*Il#xCJm40Eka8b`
zHhr)O7R)_l#=uKPZQA?3%@AnvFbe*s?8=cK2tnYFrbZNz|9@<0H$j;IYIB2Gk*kjj
z@v-c(E&Jb~W)YS|g-AH1JQik^77of$o{jP*67v@G0BL&%u4-IG=drufgFeQ?DCrm)
z8L05XuB?z99Oy%k9VVo5rd`|qu_!83_a5}o9zvgsDImj4<4)&=)t<wA^bI+0W6Qc&
zDho|c{!sSd429+3u5E|htz-T{bbt?m-Y~Fbe>f-ypm9FH9Nfclqc&_z8&+`k5rSN0
zp=;6ub1&TBtOYs)M-mPdI-C>lL4RRfNJR6DwMYI1llK^UsM4PLz?~xQ`3s~O@m?+K
z8JMtwscPNh$GLfQu)K8a&#g_i09J*YTXfTS3+HxEu~rh;Q`q6Fg(APVJjYrtyA~^!
zms&a=%0Yc24=R$EPnP+xUnhGqTW|?1T!ne~-C9!)-35YqQ*<!Pw`Jl$A8T1iSi&Id
zpx!Nl7I><KPkVC62nz@3PVk6Vj7H(=s&l+uAgVU>ds_hQesJ^rJUNgbFt8sATDSm6
z5ZeCyd{G?sqrX;z*!vCpz5b!{{-f+ljvxkMSVtK!heH32t(4h^iSsZWco=YGN5{zT
z7vZQMol`HtBH9qS=-tZeL3}D|+Y@g=P{dhJ6tfTQ&_T7`?^KBJAZ4*+Nj0MUyq5vI
zu}A5bnYg@5_UW-X=5KD@_xLxz=vt>JS0Z}6<hdVk+z%ofxsbCl+(Su2ALc~)&fuLr
z#x;2YkQ`jL4sk%82dBIH-4CU#%N$_78SeSl;JF_xwR9c|2kfb6zjtrU@2lXrA2;7_
zAzEDWHRd24sB7b(+AVsl=_kf|ym?m8`?UPH2Orr&oNppbYxM0F-oiX6b|>Sv-k=<q
z7It=bp3)3^Ip;{2H+kVkjWY9*-vPm=ws4F#dGRQq#oo^04S942+r`i}Iq>rPh>36s
z4ocnji>!7L+{sF6L|cHF|J4uMA>)#UMsCS17=PIT^zflA9Hjr;;9e|hmh+{0#)m1T
zqCM`FF-#->D;jO52FtFFgYJju&+=O;IIc&LZQ~>MBBC(?{h-y&PdV^r9y-<{H^5cd
zy%Bhp`K#rvJnDV@C_95AhC&dCc9ao8!TuWy>j~u_uz^e_5kYwDqP!RLr_RVD0eavv
zln;0j3+COAEp!|{5?Fnnr+l<MRN<n)eirP5{Ha5?8tq!pV`fw{P(QO2Vf=J#4}K9u
zBoqg*Sl99lR_ZY(hX!0X+q?t%w$yU<RX@FQx=C2uSg1ew=4}~B4_~&&{zN0%gwBLT
zX$D#A;TxC_FKZ!<IgFs!Hq*?d4(VthKGym*#{V@uem&_XA?61YJ`KbN+RWCbUpAi2
z{d?<2iB!KA0`j2@;zO}K(Shn@UC4*z5Rs3~p?j>Y-3uETC3!gwcI4f;+pOp{(_Jvv
z@kNy*lPOxPjTZRsOvrM5IG~aESg`yQEJCV+4!vg%4@WmDd-zL_u(dguH5<k~Jo5tY
z0o1|c7OK9`hs^JrhffWaBE~MOlW`YGpII+H1L)yDsy|;~FEbiSrF0)~ohQ=3dO-ER
z!NLo?mR~g4T)Q4%<49!_lF?oEdQx_V()vXcU=K+48Fu2^fQbCa`hxYbi;kmM>~L6T
zgBP8Ab(yaa`%`vp#}<Piu%eTZ0HXajcG-NPm^-9_os1ep-N%2pbBS!8K5cS)SsP+$
z*5pJNr!#Kgdvv-KDNZ!uAfB^&Nlw=jZ@3h3C-Tr?gm*&_nM?*}9rlhwQ$iM>|4zMu
zjbiESREOmS7ViAG!EMNe-|J!>bTKnE?~;a)!8bU0|C5}g9&flBaeb!zcN!gr-+Z{j
zuEX}Y!r=Th5jf<<owLzT`!Ec)h6-S8ZH(R}-`v(g*N%}HdRT-{jl696!#dcGWcKJw
z2jt<oVbnTqpnQM~=w*H2?d8U6$sTE?^`Q-v54pXoftcHy4+Ue~l7FMral_prL$s&_
zeW8y;Vv9c^GF4b!_zvdZWZ>Km&WRw$46--e<*CfzJBkdpXaCt1$MsTU@vTfQAvN&A
z6^-+L-%dI{EQV+VCl_?*&37Hx3?`wHwt6WKypJC-D5p#)IUsKBC*L|~H0Sm{A1;H?
z1Nyq{X?v*Gut@uuNa0eN2-pP^EETb1KIIE=pnd${CGMpi@;v`&wVhp6|J<140vl~X
z6rG=?y=}7H_^3X%F~!9Pp~)X**OqKC2*Os>PDMrC|Hf{@{lU^RgBzfZm6wKOvOh&a
zBeUtd2+;$(J3DtJnWwT4t)k&>>623Fm*KW8cnRrANZ?3O(eO5(H`~2g3I!>8e>GL$
zx2LUqSn%Kvn?3I&*5aLD33Lqd92~LX?KTqXXfxzI{5Nc`=EJUoe_V>NOQ8kyr*MiI
zioAoG$>Be)cJt}jM7}uI9kQCNd^mRikPD@wRMuh~Cz&Ho)Z|mU!+*f+B4IB3-c?3q
zHkJG#bMOzCt&F!KQgyZdv0BX^Gl&1c_9F8jJ|ZlvMym3FG0J<fS9Rfwx1bmiF|yl`
zF7@Czcnk=R!@{v;c2^D=g;C*y<*HvU?=kVE!8h+n99up+wO@wECXj4IZU{YwxQbK<
z2Y$SKYP$ztHTd3%o=V@sod-^_5yTDa|0%dz=7&gKetW0GfpAh*r<lGX6*$6QlbScX
z$xfiPo=+$DnDC19J#^WggY|lMYXqH9T@Zh7w!l4C@>ZR%{j)Rh`Wmezsa4+iOFgjb
ze2tva+yZ-&BV9+Bx~!5n?2E{Lla^L_NlNjU=oNpIUBR&hAqeZ}52Apt|Hgi@Cy@&_
zklB$H5J(8?1E0+4#TFvvy1&A9)PW=SK5(Soq)TwciPeJnvWKrdmqjDxrLf_*qD-nN
z{*(v1{Zcj4s0feSYaVr9$ZW@oeU5_2{F`v;hBvG4yXouF{}oORkodz*TL8oZNcp0;
zdnbKVJ?UWV^aS_kaOHi;MV75T?o88?gGnTPE>$INNi%;q*`xr1I1s#LY*kmTM)b=~
z`<Mfni0*J?$ni)F+@(Di4~Kg+sg1mRE^;N2uQtEedN|vY&PgK7LI575z!iz&K4z}#
z!%pxoGE{F>&Jou4;^zPeyf|GSIoI4FR15oURF$Oi7*r4Ca`REeBZurh>`1WOgZB}p
zr{00g`_;Csno$kr8_Yq*jXL`^fSo2llw2sT<M|?b8NTd;t_xJCc}#;>=>X~9f;0kx
z6L92p$n#}bNt=HUKY?G?+Pt%zRfsYs+6T>R0NH|q`8ldl``%^`xI5#L1f?=rxT;b7
z<$JT<=|5#xl*3R6!fv#PpyK^6Hu^r6S+)c((7eP40@5}z7Kk-bEhbiE{V&i)m<tlJ
zz9YkClax_EFg?R-Kb9`o`H|G~dOc{hGpcx$G6V8+iJVZsY*iT+ibx=oaNe#TmKtL&
zSmQzohhOLGn1eBai1o;{u2WAgIvKQ?gH*+QW0Q-6S_yPPwrb|%-}UUO6j+e~!P&E|
zxjdGOquR$BtN50vx1$(n@<Z#R3~RI^yfC_ri#AW|E^65Cr4NbTLm|g%kJnlH*823z
z?WC09LE55KoN7G!l6qJjLLX7YM*B4du136K_)~e{AL!}f5?w*W6q*?}aj{mfvB<<_
z!mI#7GSZTnV*MS*N#G+Yfel(tSKjLvyGT}th0A#LxM3r>+LojsQ@;hszy&UECJRP-
zT(%6kK-~vh!k->SR$FPw!7jpTw8LqoKf<=4MO#ml!unZ}e@j&DzGT`S%!|L6Ka76J
zieZWhFDnPZjm?qj|LSMS<4xI_;0O$YQ1nI<i)_9B#fIO>BqD8s7ci++WcfV)2M&P=
zfb04)7>N5RPnUeL5MvDCi+qRbztUa47L^nd#OdLu-1Z^}7VUc%E7Rkz@j&A1!N;r*
z0n@=Lu%xgAEEh0{IG+W0bP#GJqDPo4XuclVeHj?XcChN!s2MvuQ6eTQxt9a;sw3?{
z>}Xh)u!N$;5*%c7^h)|Pf&h{jR<^Vk>%pp9_ZX7sQzM4uqMhj<EzKG#Hb^m$&9KTN
zqP|$bSDptU<R(&!Eg&hLOW(q-G>?ff-gpWWaHf*Y>DMTHo!Wxo-~*$pZ?H%9TkuM6
z{91LLip1e!pb!@RP#CUix4ds<)pJiC!Evz&WVo1^gWI)eJEovzTNy_Ih>TJN>nHr(
z68heuLSc!RH6GjAjn-fF%4mr2)bYR2y<e#0-oFZqutNcoN6{mERkGowSGT{jmVi0o
zXFyGe5r<ka{Rf$sMb@Dh+ky6w8@?vZ%5^#TVUnP>;1*m8l33Lv-F+W!WqHugxSmXZ
zY%By5dqU&$q4}lkT9PFQLD-F^dQg7%zt|&g1{+_MT!2NlB7u+`!fFn?4s0av07!fw
zBsGqg<**n{c_7Xx<H~9|H$H*qpvYTe2@qR#iu-b-#hoY}5V=N^FkswR4_UEEyZ^L_
z(*X$wC|&95@$<pLyb*Sj<ercn2`IyLt-8}Cu}$xu6`Nu_1+=&FD%@YN?B4P$#nnhL
zkW1$I_C&vr$y>~4sE$DpEqEgYZeV2FUB|F!K?7xSX+bv5tLa<OSfU8jNa3Y0YE&Dx
zcQi2G8Sxy@JWQ(_gGAdqg#vFl==oZG6TgjC{3hbTAL!i)2q#k3-y5@|#NcoW=o#5c
zmY0{7N!QT@<-f3$rRfHAKp$}7ht$SqBM&70Mub(v6xFdKL<c_neb!3!4dcj$5F%#+
zA>NCcaihDN*c*lyoFcz+yyCz~?_bs^j<Se{e*k1u0@JE;ApzXq+Qi%tNL5MzWr=E5
zoDP`oKI|sp5y2)HO_N}0Rkp7hr`EIN?iaFIaAk$=U#Vj5!M#75JFSnn4WMlJk7@Oz
z?f+4BML86MAnZmj0#4=r7kk#9p=3$DKogldgwpb$;e`F5dkHFHg<gY|%%0?7-xD^I
zjn(a({{t9LX-?=H4{ICI=9!PAYBP<4a(ZsdbRM@xu8m`Q(sg+?XIg>O!Q(z53@{>v
zO_*U^>`XU=$86EQXsK!%#`LWv3X}4n?*TK1B8Xxnvka}trbGBzj0d(xFR(;vxWSRc
zcuM5j#qRPrOy40;;Na~;Jj>D_mxkTQ8s&#f7RDE)rb_R)0F^C`!P9o`uj*zg0Q|lZ
z-Q}z?xUyb!S%^#c0*}kCzCAyQK%1|3OYH-GYsqFg2EBtNlf5QrkGNh$HJH+-Dm;(U
zK2i84nFkWaiSk^;etfUUE~4$<OX5)iuOcmpZ=QMJQJgUR<H7@PBBAhKDexpt6u#`?
zff#Y3_(fcHt(kerpvIx&tRzcQ{!WNAi1MfG+HL>_LEuJ4#Ru%aSUJD2Xo3q6Vk-|h
z?!ZM~Ds~E{IN7xlkF?cpf+WajXs#TCN24A}xb<S!{OzfuN(5ggfZ3xSR$}7*ilv7J
z(Vsd@c>M?7xd%eU#bMeY>JyWt1sw+Qv>&eKxLtEaQd_i38ioOqq{GOD<90WYdWO)@
zQiLzSZio}V2p{k!fkKHVbVWdM{}=B$rih!fzvlz+tn{WO$X~2?JRHD&$F%YWX__2b
zv4`60FMc8@5f;J3^y@GZ_jOvcnYAa!BG>3%a;wB)CPEvT6Kg$79eT1PCD1nBd=)DP
zU$C;HDIG7$-4Xnk8IP<65s?!}mzcmWi|MtGG^e<K@weFvhJiR&JR!6tRLibdjDIu(
zivT%J#f){4*XDXadOz5u4H}X&X`fplH00jB;@NLQMhN(8^>D#J<*|np_tadmgqK8!
znPu(C#%Y}*?(48-xiJAAx29|Xqc>kok(Nl$6Wh*xdc4g;*JzLtq|qR2{)T9xUNnzI
zf2c|gG@?mb>l00@u2v3G*yHlGKFY2wxndB6?xp|jC=rPJ-&i^M=m^AK+yFyjL?q|&
z5_Z8xfKT%LTOq~hFFS(wgRp(|x==gW?d)PJ;e%7y15V9c021H)qws)Mf-|W|=KUY^
zfdL|+Q(y`P6lUbh)&RLcM!!Q2kGg>I&43D5#){HiZ^GFr%?S8#5SD<(A18yBgPR5i
zP#;*mq8ChXvJhK6sz>!%yt{!oe5Wx|oxwLbfcmTof-y`jq9f?wa>Fy?4+UB{T}G1Y
zsMmrO8-f1{ogO5%ygI(r`&sciP6SmqmSH^?7n=IbmK8rez*lN(zc@4fm*_6$<&kIb
zD<AzHEhCTksyAH0=>*I-tFj|Q=G#H40Vxao0>+bkMG=YmJxK!S2u{I+7X6gJPwL>=
z)s+>P#v*3d*uHW77<7OLhURUv(;C;hyiD~SCDTQPzJslhy;Gsju)|HJ+I&&%n4b$o
z?eue=yO`bOY3B&Y{PIHLJ{U#@UlY3Q)-v>=U=(WqE>pjqp3Mn@SJJqB&6K`=DZ7Fs
zh(Qqcqn#G5!v8<EiF+xiv-kmqQWVrAtc?cP`K5~0)F${=%cJ6~KXHfVAm%E>$7Yx!
zyYCM*O32&hqhIt@G+&~60G`XB3!zb2?9usmTI-S0(GBa0oOn%{-Gv}BIye$R6i2v8
z!Y^N@G*CJUl}H}S5laFizwuN9pW{JdQMCS&7FDV9jz%_z;Dkj2|KeZerC7`hTJSW;
z)sI6)MVmcgH4faZUMz%i$%rkl$|jcMQXyg&TGs;(RS(V;RDxEf?)oGToT3FOJveQn
zU#pz>{$GY<=dIJTFtWHfi>mQyX7OHsU|5~u=hjk{FLYSFlQP0Vkx@4@2>xR;z?R6@
z>Ph28@?;cy3tHIcl7glUg_hurE7qEP^1k&fXmv1X(Gs!F+B^v|zkuJ077PPNx(vZN
zGV}DWyF05T2BD9M2yLNPZ~6Aks?UW|Z$bpixPF;*7xPVwxus@9pSuv-S=vkiKe*g9
zFCK#w`^8|~MMkJ({zCc<iMT&E0mGCqK#I}Em$EBMb{Ga>H_CvGm)!qiPkQ|*4)GNC
z0E|O1W)WiX<arg$g&`5)Ch~aFLyTYs2YOwY&|2qMB8-94lrM__vfr=b_nFL#1V5yW
zRV2xQ;>Pk=?9V==FRBx<u_Bm*jg8o|&gX|J4iQ1}I_`KvFsFqB&<U|yE!2hBlq5=I
zQiij6?zYK;<W&4F6Xb^oW=5kDWX2f^kpsEDVps%@X0V@hN08X42RiTt!$MwHfvXXO
zAR(!-e4Ri=e9aJH2eQN|-1VfjBswVD<GTHKWKo7l<6-ZY5#TmX1mDY?5*Zg89-MlI
zdVju;0zoT<1rpGTAM>za3pEdo`B0WRY<~N9<Z>f%dQt~jJ&;;FI)*hJsDVUPDKyho
z2M*bHA?m<W-k}6!B=+q4*f{Vt4jaLJtDJS4+;KD`uC4Zid!|ce9<Kt);1G*xoQ2kT
z@}DiG`8o>1Bx#0Fw<o{`TkZOL28%Ur;VE2?(IuMLiF$pPx!1-Xl_9KWzcO}H-tdUq
zBfG113FG}~Bw53Y{ygzK@Hn2&;^O5c$*Xd=*l(H3QU54Aw;X{%5Q?s78j**(|BVgT
zpFx=>Wdo#X<xx3sqfI)53?RWH1MBP7ec#95`@n8CINC#uk!bYT-7S)wN#WoIN@Hzs
z5KT~pcu8Vi`*(~1qdC#8dxM$oSJBgrN@0qZS|B-o8m?!tDTC3)2lJVlK!rdSaE`W5
zn3s*L7?VZ2b$!5<UJt~G>9X&VL8lwfNXNfV{AxF}!ydu1eW?3RDB|5GqVgW1r{S*z
zDo4g6^Pa0vHu0I%{9|E>zqDZ~0~g9BK3P8_MI9zOGXr0UHF2>8tg6{Wb6hzK=d?mn
zyHE}{=Y<$`(tB9EQ=!fcEQfgcJaA<>{i}K9n8=G!vHRy~0$iOj+76{Q&D-0h5E&xU
z(e{u9DiIH5KpXCn#zH6$OvliNJ^ezx(1VL)oS~9=0@Tshqr)9x60TiaCaXswo(HZ2
z@&I7Kp`l|*pPMQ%LC&@qk_1MLI?(+za6_wL_-c%KI%|s6sm34p*H^2jtIY}RFAT?M
zN<M`UCa0tEp11*7td@6Q6^^c)*c5!v08TBnU&^j6M`9R+ooFiZg5>@eTRT5XLPr`d
zfU1^)NsRqd+^=up+`IyCqEVXx+}ICq;cL|YAFXn0mR`I<Rm&B3J1tRkz2?PZLIHtJ
zFH4E~6p5+Ft6n_Z3^F_{4}&6QC==BiPF9keP#}?Gn0kU2ttN_s<91X`s(qEQHFQV6
z4a%D&q81NsrckVZQ$`E}P_RC)iElRiddL>J?Mvy{HG_uZN<=*@yU@zeGzz}l2zz)f
zlVFbCVZfw9zT;LaTH)TXtVG3i{0=qlOwtSvz<f#|#<$F|h2wW<eQ0hp_XIeDBAg|V
z`8fI+rV4Zi<+aJ|Q7<)7Y#hZy2a)+~`<k;y-KK=#BI3GVtv?HOhFT4EzBn3GO=N=}
zJH*_}wkA4=pu=9SB}Qw<^Z>p=sllYqN>)m6N*I~!)vKkkIPj5e1_jbY&<i?B;ma*+
z$_rOB0n0tz16{rG#;=iAcbl+kqKxTbRo=*4uXNo6CJk$TRT7ZYkv=|#Ns3dN?Ky({
z!Ydb6VnTDwj}J8)cx18V%vwx_SMFQ=qwI=~7z#nyN`eZy|6)!260O&=0B2u85JK`Y
z9Oh_TPo0a66;6ChsLaf#h{I~GQKBZrb6&5g(2V!)C=e+`aj%^$^@}JkV>HgI8##Pt
z^`$*<f?zyRkL^ehuI3fed$y&8{+r?S<qJC!L>h`Q8{`WdcB2a{(`oUDtipXOu8NDS
z)<5ui&(rpZ*BTt8qH^$ChSDUFD?Q??h=*O2dHrnbwvs5Dg3bwn3ucY#Wuw;lTj%6y
zb!US|szmT2!i+pFmw&k>5_^<7856mT%~w@?;cGtE6VIMq>I6}S^HwBvrTq0N4<L#2
zj>t#YIWXYXvVD<lpNT3uU_*q<0s_B9fpe{kNFo7`h`UE_;K1H$I~n<`WUNNam5|J2
z!X>7kZO4+B^z7Ui6lk`!1dY<>tP~Qj)Dc6>TO%Kv*eyibGbv|87I<Y_MXkyeV2Qgc
zFk_IC(3LH*(YyR%^?A}rQSE$};^pV%bO4pa@1GHIHBc^7z)#2zb27*#{;hdXRKs0S
zI<EyUn*C6AZO0abAgm=3MCiY<OZMvu;~Z&#$vP_!f#jFjE81Di;z^Koy>KaCt)3jZ
zkrF`V)vKbqj7Em<lB|O2amV*pdSdAm>Ao`B$PlIuuaU9QhH*VMa2WJv)7CW0LS2op
z=qK^a*NMZJLd4sWcD2CT0an-%BxHM`eC^~%?ngY}xEpH7@vAoCdUu92(hbALm^%2P
z3P~|HtfryH`1*~W<jyqs^PP;1Xr%k)3XLun6Me9H#d=IyMfkQb9(flyoC*_}Hqag_
zT~R4S=u;#eb5QP|HtHK1hfG)4H0<{ver5mtzEmAn^*n_YKnW7yJZqQ!om7|T-yFy%
zF~=K{jVo}^Q76tu;~esOOL(t9Hp+zm9G!DWgTut}JAk8*<-zI=D`hfx5X;h<V!JN5
zyjPAy>7IQehR|!@rOU|;r$A|b7|N!2Qc}rft~Ib0E_hnu!t0)L<JFQ#GSa9ZK=M=`
zE#G4p{ZV#B#}b4ftfd73vH!*%x%U^=xuXF_84*O1h_g{~PeAwe2aMCzYNvxgI0lj2
zp3#X{c`QEz{7%}&$8GRIBto%ODFIB#x?8>-T(rW_F+4+0J#o91`fCu}?2?WNSam-!
z@S=F8gLxexA(LYQvcHVYP&XTtw4xkac;=w3*qD%WaAaA?q^fK=ahTP}R0cL#XaRF7
zu3>FL)CW#wr3Kmb&Zr`>72bpUN;$N2VQ>xn0zaS~u2xxULBOlv+p~F92UeTZf<gRn
zt%k~rHCgQ8Z1~{cF@>*e9sFwxi<mqDwP26cQTjR<wiFgI@!V01J;t*hri1#BMNI1W
z15frmp5L*F*QIh~0Yvx_o$bxpoVb89mu!o2ZtEluiWinKQ3pK9e78oQ4hmV;F_BYy
zS5R@S?@PUIpYs+bo~kYsrc!+cXkD!`n#`eQwNtzF(yI&p?fy}AZAk)yAnZnt51{4#
z7hB@)2TGll3ox`J@-PV>cK52#nsCc!G~#}kM3+Q0aH+9}TO^?B61O&m{Xm%Q;LUZP
z`X`Eb3hRMD|0FwFJKQ)^yEtfv)PfJE0rh*pOn2f;;%GT!2gn^(%uMX6KKm$2GryI+
zQHUN`>5knyaZz^H#J%l+9jryLBnlYQI(AMH-OI_g=3pJr?CzC-eQH=g5{3o$r0Uij
zutOj;Gaj-!iyF3izZd=<|H49Z0mw^-GFga?3$^BxRbCaV5eQVxX)Iz3e>ag5c#*6Y
z7U&gJOO7o<k}|!g19tFRtdY?H+BV+aBPl1*CGsL$4Q4I)^^?86+f9U-Lw1<AGC+BI
zpjgpA&O+j@b;u6$7Lq6pz$~;nA<`07#e4fU@LTL0%wfz8+2?52X@BA|1q!$raD?R8
zDRUB>^k>2I#4~3+bBIL$i=Q5yRqt%CjEJ@@Ci^CuPiIe79jHUgtmYwI-r2Hm7*S_>
zdk^aP<x$CO#a}B+L-;1H1z9x*te=x!p)V|d{Ei>Wt}WMM5CrbXps1DoZ|u(8p97L6
zWdn^d6$hM02pKM{SHnD+`8c}KjIO;teD!s;(I01-poyU-_8xl9RrtZYjfbqZ86%11
zE_x5#SkVeV!CQIAXbc#jF}9}Um>~sVAIv;PTZ+qt*-TUW2es4d&Yqz7TIdr*(VEyD
zPN==I0~SfUGEuw)o0|r5g^xbbAD)JfK+3XG9?z-VH&3JiGumV_Hbrk{o)*+1Jy?2R
zt)znsAZ?0w(O$T79g|};zERM5L<T9Ki8OTzMaD5Xr0uiEGZ|~oxGT$Zj>3iG$sCQw
zoX;5euvnL@tE?>ecfyRtOC~j|IAS?QsSpj`yQ6cMH6uDeox&lbz0C&)=huBWe!Wy)
z5Z(iQoR#cY3XFs99X>=zAe&TQ>?FYGl_9MobJ!$#j3)|M0kHXg1<}fb*oi54D6`Z9
z<9661555Y}&apWR5Z6e`V|*={fA=A-yxKTE2mS`;!#^sFf0B_PdF9>-StpbgqA3F`
zw|SSGLP$Cryr>b7fAKEe`BEkSGWYnS>{@aqhC$ekswPk%_rKV)TRja;TB&Sii6VxC
zPmTR=b>ajTvXwHOKd9PU;ilaLPw?#S1Q$C8b~Y2XR(udS5*(pxou%l5Op_EaI4uD?
zjDHwHS@4TeVO^vfh4YS^V3!-$fmtn3IAG3{1qOmPZjxQ-oxF9qG*@R0%R<~HXon9{
z)a(=iBgMtq>{#LcCUA%MjatrwUr5oM=qCX8+k11DJ?W=&2bvucx6Y`v%Kc674i_p`
zT>x%-YN-p@<(2^+Z6ix1a;1_FYdWo0222Uz0q2^-BI;X|WDi4|%Ak4V)oA4O6X>N(
zn7Yt*sux;_4D#6Ih@Big&aY1MmH18u+Iq%#Y*g2x7CFMf+LyETH>;^VBW+!i!O!Ph
z;av(R*Mi;ORTC$_VgzSmF(MY(i;~^nRa2CZjsh|i&t~YdLM4UiN>4ZsMS;V`7QDDr
zc3j#?(aL$#9AuL~+;%^CF2=F?*9vwmtIN2vMC+)U+81e=SEETFZ!-eok=o^uzA753
zSDc#%AxgZ22bzfsWBY;Q;q|<E65>c{c*-m|)`pw^C_AHEi$M^GuIM#&P|*Ev>@j{}
z=}pQ83~AI3co;s!`)l0*dh}~d(Frnf=vn8Dg5L)M=%KWT>}y+`yUfeIWZxY^8v^NJ
zTvt08IHTKpinoxlBf=hbxx%yV2hfCL_@0-}ti&7i<Gh4sAMASaTp|zTL}8yr<bzU=
zR%RQdNX~18H$DX91K`Nt#okEQ4(lZcybIBu3X)L4O|t-ul(Du#wCAjH<y<K3NY#+<
zzQ(@hSq<4RKi@dkbB2=^DucjjKw!HBPqXtEf5XD_Ap-HiTVc`Efse9j=t1G<3mo00
zwi*r8`A<tbRw{cS5Fc`R`lK9;MZcaq-Hg3Jy&zB@lhak$7d~lEpG`zsp-PMZe)ziP
z!jAn6x=-$-4xj}K0^pb`A#DqOQp~xfu&>G<v#6kD4Hn$sqQ9pZE2GfQj=+EX-Tq&v
z;g*W*%2STG;5CJFe2Xi6F76r1qI}9VoPyMg7>Ivjxyf1%)2XS}(h30w3d9AO|IPTQ
z%Ko9AkY;Ixi%jB?V+o5a%<}s!Q!B4W<Dar~%dsE?f#{AVii)uRjSc0`g{DoK4H)AS
zu{d>YcLZl$TVdQRh}4lMjw*-bh!G?nC-Brgnb_wCidM$KMUY^y@lvRoq`!;<SNa<h
zBewh-pj*k5?e_=vrL#Mxjh853q9ffuy^w{a5s}^aSMD~fAmOJWD16Y-h|q4aa}3^m
znz+@yG6oOehi$P1CKeD9pL%<3*JmF$`1;riqAgLjXCY>qG0{JlZC^$u4W-zT3x7!D
zWFcZ#CNk%!%b&8+o4s(aIaP=NM4)XPencaA-an(V5}Yt(!~D@6JbcQ}HMRSSz`4#@
z;4%VnakLh8>T-_E3x`7Rash+DPII^)+K%8<E8i-M%qK-QEr42Cr@aL!TclKu-RVt}
z#3l}%M)?oupYsES?bh&$lzh~f>d{QLjJ_<WrO4?+>@hLUK0^YoWq=?RO0UW3Lj-7w
zzAYlbfA~rS<JU*vbsW6J(JoB5!oq`oX1Da!3im{?cKIU+$l=`ClAH0aWV4(;L_i5s
zrG3ELoGRj0f#^j)g~&f;SCSh+2m}9;dm^xnP5=L6agmE@CsIn9GaAt>WmC(?5ilOF
zsly2vy{KSjH)?c{91Sb{KMyanMaB?Fa#g7`da)SLVVO3Ybvyy6SKV$274o-L_H?wK
z-pkjB<?A)1Oed0_!qsIw-tg06X1M0Oz$zP_HGrtP`%}Uonp!Sbn-?ZoI-r)F@k>(d
zVn)_0K3wvKLsS*I=*^;n@FftxinsY3G8Sy8&Hk0m{^$R_;?5NgkT4T8>BW#cv4jg<
zB#SJAY9W4H-g?`Rc*d3L0fHh6CCte0rzfWVtzjXYJH@Z^4Q#dC%JazsSnL-ENaEJ;
zy6<wa3Esmz3(wspxoX5@#JEEI6cUCw`o7*oU4)cH3V-AiHm1it%n<(l)|~`FOOZk#
ziQLZsgto`nJGA9Q+CxC9!Xa^_EF~5K88XZ7Xd%_cjBC}43Ro3sD|souB^`@7-V1>w
zBr6Pvgls1MYsxMsPWM6|afDPWRBcE=w^nO1mVy%3jziA@v=rQNHXHM2F(~bF1o?te
z2vU&&BkgzfGMQEOT$!{`HvzLkJNZr773B&Hg0LGcii+(17kllNyx@2ruNPR1nNXm#
z<sC0!IB16+$kk>H;7Yd8zHeCR?Hp<#7bm&E>tWTheJFR3*dvAv*Jn^V%eh`(m8gUV
zk=P?fdj<Yp4%p*&RlwguqCeOp0Dq_j=%Kq;jgZ!bUf;nVxgV!yAXTU2Q~ec$n)6_g
z#C4-=nPF6buhSJ%&U^MsUd{xSv#Jc0^3^zbDdP!aPaLadfRNa-G)Q|j#5S@JWwa|i
z6V98(K^kggM6v<s;Qf0GUD#5!`;;Lb+*GH(kAJ5C?#fv$^Qln8(m08(7`qIgx4?X|
z#2;bnkQTi_)6xH!E-a-bnfN0}6G4Sow(5~W?{8OQ3FLlD{1Hb|GwMPBr33#Kt%aow
z;S+zv{UQmFUb^mHIo(4bWLVY+aT*m58gm6z=IVmIa=(!$gRCoX<!#eZta8hQh@J=}
zHm<eF$aXH-d*O9&VWDWWBdGyIKP*m)a#d}zxs(s*ksIn_M4dTNdF^UHvi|Sj{%#2T
ze%D!H0`Bgh4`T5c_{tXkP<Cy%7Q-NHqpAc5>HdpdoG(&zuIdF)6k1-f&A;a@HRJ_Y
zSvIne0>r|jCN9X_Lt)cEz!FYFzJ#KMe6aiT9{fl_v9Wvk@iw+O<+NE*U|XVGvl`h>
zYbEa>4qIqz4`jc=F$FKU6O}X=y9GsJ7eo+;o8W$%oT)IQYArC50M+nTML>h7MaL=;
zEO9M3lE9c2e41rh_OAZB5rVNQN6Ur*3Fb&+n)HP<P6RZqKoZAIJlR{ua<R6&Zcui$
z_EuT-BUEP3h7s+1Y)=5EwE#&nVPtTK^cj`|n!gjAJ&awi(>~zKAhi!v*xerqiDemD
zuq0_XkDBN7I|4gMKN<e{NyO0zg#;EPXQrFhS6VOTD$d3&dzO%;4;tC_Am9WALJO$G
z=e2;^&mTl=_O*_~2)hMV;#s5(2rI=N5kzOr5>aBD>cnszsI7QV?w&Kk?l_jML1aB!
zj2qOAcer#yzFiBn1k2&nH-Fgr+}<a1yCuVA=t1cRa6;B7vj<^f{Hq07;(nnh!Hd=~
zk**8>3H9(t*_q`?48lP4L>&dpV(x#jsX}UvgEP{U)ZZvg!0}Rk{;oS7P1Mav$Mac6
zB1+%FF3ebyr*3C<7I<0wwSSPR|9n_~aLYHdioHfNarXqOqXkJxr@KDknM^WXd&!h_
z;e-W2i6L@hotvn!yQB(^K$x<iCo!B`7+=bcoXO6UCZMePd&}BQAT663sgbPd+*Scv
zV?j+)7tABx6ctg+>r3dS>}`uW=f-OblQXct$=NX>Ft!L6;Y@Mg<MHsbta%r}yk?IN
z8wbd&0aqU`aPG6|LaNh(qU6(H#tPB7_%xPtPQns$W)>7BSe1x%_R|mY++L*4!uGC*
z<G|_a^!X6TkJMVxmAe*1C7*pBmXY#_gO=w}jwM`-peos&K|ExOa><!KKPJ=(E$B*!
z+Mvs@U?95HWO4*=B*I1tVV@0u-{F-byf}*>F2q8SHgaFvjbt-s+Z3|%c?HKe0!Qqs
zFgu9dI&-V1iF9SvXP$&YZ32EOX%J`8xGL}LF}#|y)^TvjvSCv4)M#|UIs{e8XRw>P
z(Y@hN5`W2k3+_mZ`TueenaDnEAH#nryV@KJLJ)SMouCXj-2Y-r{e_ZEwiht(IexTQ
z+WRyU0yGp&N%A0+irmZr*86e@VuFjNWWfnr;nEnN!RD-`B@oA1)s*B7kC^GXzujmV
z-Y&$pD4G)ZxbKoT1n|+^M1yG8)*>nS8S5G7EKiz=M8dDvb%=4Trcvl_^@RLI#@8~^
zjX8FzsstjrJRd<|;I(l3co5sz)+K8c(Ci8Sl^Zz_7}CxM08bE|d_<%@T`|GBTJ$85
z2N~*-EB6AbB(0SE{|85{t|N{_th|V~^3ZxsM+iZm7B$HSnN@<lW%(~;w56*Ifj?|V
z<^#D$Bs~?q)jC9=jvk&P^NE~NbY6M0a3BJ))X!)%GdMB9{qv?0!F(^Pu`HU)Jz?H5
zyt{T^pJ0BiS3tH+A9M6vy05f`K_}!t>IZ&&cLyF~S<n;HfRhkVuWCq=u&x*C;TJa6
ztA*N6YT!6h81gg#p|G$%4+Ma`Vr20Ck<5L(-rPkQ)_&y3pmzEqnZ{z=sTq@@!Rt)7
z5ZpSEtie~yq4<04{!(^sNfv`35Z%$O2#UJ@jScP0hrmtM^ae;u4G#l-s#T339W+h&
zDHsLLD#Spl-Vhn-pMeB=1FS2hoFa@~Rhm4XGe-_mQJ3Nnm}R}kv*B&~QBtejYR2R=
za|RFxO7#tno8`S~#Fa&87s0vuy;kVH+*!<>2)LnJ1V~{hY=~?v5=5H_jd!caK3e1G
zNk60;+y8;byc%v{5e5R-Jd<2m9DNf9_G%aL*9EX!Tb~C#SpH&v)rfyJoHSOaZx;qX
z`YOuv#7S5Y()1wz^mx1WQ<@>a;*?(PMobeVR>zTo$l};SXtQY|$Uq@Rn>$)9sJX^$
zS*XjrenhJ1Ul@ozMRJ8udD0bNXb@Bw)BOR;l9DhRp}L}1w}@xrUX8i40U>a-3TIJ*
zTCIsCV+*&$(;qOcvcQN+C&6SI#`DE1>Q&U@i7^dLEE#aX3|tN{6pQ98@u?-64903a
zXab5}8@?E`J;dEJeF=F`Eee2)8_O^mcN9YmZ4yOxmPqh})`-`TxRf_cAGW{WM?aKZ
zTdoBm2-^~9eeHi^hu*I%%_On`Vi+jkNc$ge3Zve+#hR8auGF+K=Y!Et7wlVC$w;vg
zoo#gE8nu=9I#)%HE-7k543NhkRIomb;u4by#C39$QBMc5k^JmdTv{@nrMGb=i?*-}
zVTBjYnkbF!@RG%*j$?&9fTc<n<uMwNW?6!>@RS9HEYU;$?au$S4_WYObqG)N-!JN;
z0E3DHMCF2;(=m^2S(qpgaKo0E1?luw23dH;vzd#ZccG(oxyYY|6#<y&TujQ|z;Y!=
zd!IqzLKc1^UK{yb6bMGaZkB4|jsw9P`FX{A5l0q~af>hjx%hK4Qwf5kAhUT)GJ%SY
zWv>`bJpA1JA1gYfDPCO#t0T(@1qhPH#YNzt@~tGf0$#z!HfKQr2wYNY9PWy*EkIZa
z*DY4Lz}qQ$?GK#spLUO^2=Tf4oJ${i7LI#q$owd~wi}3H5Vp}N<&l*A7dyNC38g0;
z3n0{zgom+jDt-#YEh&p3t1)}C4f%mAnU6NIL!$Z$OXX~cC)fu3fLUs7A{)R3!^Uvw
zsW!}NGV83sgtER|>M8y<-df30Xa^S+k;e)9GUJ&V9377nE5C)HfcDd=dQuh*)H@!}
zG%XZn$<%z9wU^ehnrQizHKP&hBF~R-i%tJ~+iutoUmucWQ2|HSsJ~636TOL*U;PY1
zDySq;W?9~#el$(I{7UUf?z<t(D$c6WpRf)85vZVtBX&_O2%IkMi3UQ>HUvnp_v3S%
zLft(b6*C!)?~sMyg*0TWO7$hTZy-QSbN?Qh@-$w)u_{ud0f@4M05JsGa0CNNl(Lc5
zK*yP8%5cJGRe2=V{DU(5r>~hJ3nv$MFZ-2MQ~lN3pLR1zRwxQ5oHj4baBT?gS)voU
zCN3AT8BSbfw~oem*DUYIjJe>cQ2yXa7~n_4YTl9I&hEig7I`LOvy+I}4%s)4Te|0(
zbXT^{)$mpmCm$8Xoe*M_faO)Y_~XBnok0%8AP7WnWE27M{uld<E0p}CBwd@vRvcw`
zd>xkqW(af!T!fxlmN(l{IY0&92Q{4_{P{{S$j8JBqr&11&JS)1@`-DFn9eNS-BLyA
z^2N#W?Hmx8$)|TcCvs0AiUsG#sb$Ai-G=<K)B|HwG+8iy_zQP{vh|oLdUBLgMezpb
zhfM%bz+@v-8tmi?E7+_!I6n+&Na#}kZfMGxIG~l?Jvu*plaRwA7c_pgoq%kGSSEK$
z8vK{#KiUu;8BkxD-y0py0Gz?0PH&a979d6}a*v8qH`FYzr5`Zof8X`q(~LF%qcUeg
z4HfF``Eq>>B#zNV*AQ{u8K{gJz~KP0PhVm#Ary$<cMfLdzuh6=Y+Wuu7@W$vGb*|O
zI_F^gaPjEJN}T>WxH74C9vAvRbM$>6Q$k7#Orc0ml_nK67JMJlaKY%(u`i&2R!Wpq
z?nNU*gxk4ZGJpK&lS=)xa`XxAk3CK!2t!{!LMHviFI3h<WQbTpR}hA43(b+=I7XxL
z-89Cr(NStHU?t3*=i$@){wO;G90@`Y2>xiYDuVO>k6pKWxkHJGe1NzPtD;5sZ(Q5t
z{|jpLfel_;jGNeqb(N&!f<ws60-=z=Bt=&}I@A$`0CkV|qdk#go9zs~Q$Y#HE3)^-
z&E_-%o9_%8E0ATx-}}X2k5TK=#9xrLv@88L5BQtcL~?oZ<AdeK2<l*In=IoF|0ga;
zZBsJPi7D{uFi37`0yh+oe_*^6j+dca81!Pa$63(DWyFNU5_<=~YVGUnCeDr?0HGTQ
zYG0o9F%RJnmKp6>qT;O7>)a)3z3_E9Ms*nDn4)fM_QTOWa>zCF2H_oNkhKlb+JsAb
zy>LW1Ms>KbJ(LOIven{6h$Y_U#Q`9rJk~o83iLDT!LqbvDnG}6*m&3!j<}|8^lwQB
zDv9Gi24!pQB~F2%25Zeklb|^IV<5R2b-PIBv#WSNh-Q{A$A6fz|KlTcBtxwe?x0(y
zo^%9A9}ltShE0Kv9pUmyGw-Jk0O>4$Dcy@z48J*SkELcZcWpVNsOZ$`tP-47N<x`m
z-sRE}XM{>`=Z5?Z_3sa5=XPX42m;ZJZUG8n{)sK^{@}1vdr5$D9wJJ6+8Ry*Gs!=E
z146Per)?O019E$fdL20~J0!48A{9-!8rP|3l7BcX3I`D9QIZQ6y0<s3HO{2}fXI6j
zOduoSj5+JQlExg~SJ6mt#uZ#`j2BX<;SDUp+}Q*p{@D#Z)B-2F<Q&#cBk8i7p)+6{
zJH{ejxN~Bi7m*gV4@kql<xrr+zi_{M9qnxh3fH=LeplAAuuB5~rI+IjtPf$BJ&EQY
z8m@*KMw1qVJ^=4U;{A1Eu8di;PT-7sG>&>HN}K`T3NF14(N5rz;k7Z@&`#jPvs=%=
z+)y_vUB-nBm2a#=n-|q@XJ(DScL^CgiE{;n%TB^NqrFL3Q9ff^J*}>p4Jw+_gM$^n
z?g9<W_1Ttbm~CoSg-|TTQI07NOvke-)zO&}w-bg7p)z;(F}`46y+uu`kd4z<Ox(z2
z$MXFtAZ}dz)}#tS%j;O(1AU4H>nM%YMqJ7MiW>>u8LZZNx@`^Jzb0wOj>;4+D*(d{
z<g)@O{qL*&P<Cxe41*x>Mj0cbaQ};yH9sKDOt=7bC{!x@@Nqpl<XU*v23wy;)>ERp
zlHcGrvvJvNCnKwbKy0=U*fpA7V+$c@w|vY$l5^ije-4&27nV>u?ZX<iyi=sgdBqEC
z*&MNK78wl`;#?4wFHXHt(6k)bky)&d=~Euw;yR#6zW_#UR$?0kPkB>U$Zz)=##><+
zLNt9q{OG*c3hX;}P!TxF;fm;wk9b-p70TBkMbK@a#_>|!g5hWRN@0n@-S5<%-F+h{
zdE`g8zv+FA8)dK<?z14Orxl76R@dC)t!CZ37`g*W*+sj+fakuVlQ`VYV1C~21UG1f
zsB*kH4I6Y8z`686i}E$I8pZ|8yDFf$wxkxWR5&fQbPHRr0VI;{H7!JqP8fE2YlX2z
zj}m>jpaQ@YJ>}u_B^J@DHz`;Y>dON}z-0naA3tq9i;GoqFv3IWglG`{wI>sSyYTA9
z6g5-{%6Ln7$%$>61y&3PaEL|i1R?Kn%SoTEtd==|L#Fku3_v&phBJ1!A7xjNY%vJJ
zZq)gTLAn3MKI!I(v@>P-7SB4iN{Eoe*%pG1MC8b%hgW}W%|1_qS$JP@hf$l$vj=k9
z=Nc3m^f4m0zijd<kj~uMp|7B0f>0Zxm)-g>lRW?rW)e~ux5wu6;Sr(JMj@Lsps)&Z
z+?$ZuC(3P-zl2ek?KmxxD6<F2T(K5{`9PShQvA)Re1QJRu;g`I-6f7@ms@?3MX-r;
z6RUh<zkN33R<%?bG8=Uw)2UF{5nE}9jEk<QfBw$YvFOP)6>6oh6^4xF(Ah(oKgr}l
zl<NC+HLwH5<#^l&?4Cl%*=VB`n7>=hTx8*gCp(?0LFY+R0nOOKA{jPiB^pVVeC1hi
z@WEaZa+x-3{&yNXop`1fm||eZip#h1q;IFJnfv~wlKUdM$*XumLvmkIt8YOC8;1~x
z2L-Ijjw7s3ZdtFhjYT0O#B9*I6RFG9DhVHUJEzWKRfmc!V0i#`s8ALNHiiDP&0B1R
zzDX(PTLtS%1cMn*p?rbCP6ldMWCyDE+M|EUt_8PZ7=)c@Rmdy(-2Y;;qiG{ymFjnZ
zsET+2gR%cP+4e3TQW+kd+2}@)J6OW&5Xd24z>^>E_&J`QPadOm6T&U9L+Cn$godl&
zkcyp)@xnLZ@hSqBpWI?cH~>^SnNu&s#2%0J7!}pl^b6>WNyJYx5ut#L>L7U2NHf4?
zQ0*$q#|qU*+eA}sP;{Nn5r$Gadl?C-t!<*I9H<rgz?71wbqfA%bGPT9Cnh&Z*)7hR
zBTDTMI3hUtN6>TNgF7R5yts<TlY?w3m9z+b47EBZ+2<6yC||r0viOgy+%O-N8x!Xu
znNaQY=*U|~q4YfBqM2oz9YN;R16QP9_u^?f=dH!sS?^TA``ZIo#QQ~g2tdo_^EI;x
zm5@22#SFLfP@f@!k(F{!x(jx49@rv2FVX{+@8}w)oIP}51JDCsq!~5n8wE<2YTJq3
zm0Jj?&6k`54Js<WI*SwwoGc#^x6yC1vUd(Fl+Dh%;H>V^VFn4~zPYT%v_G>;ov;z@
zBjUCTh<M^{xU2n%H~z}|3q6d$7;$7|F5}$Zmdkt+%WT5)yEr4?lwC`*!ypX1Q3s4a
z`2H7rRyGggW~Sb>J5MG7e}s_!yEG76$ZQiA?vQuBnIwtr$hpy26Ts-QA!efp?Nr-b
zA8Pm<@n>4sLg#ri{s^|03DiBb5ZN1fEcwesCIiWbaffeuon9L|?O==;JW$+WdSTN^
zM#+zje10%S44xuzaYEMzhnbrzF&aC~lfc}L$_DmOJnY<6Z@n?U9-NV_pZIVwz&__n
zQmz47Ln%`{6ODBdfB^!`eTx)Hr$s$DBY3~jN#aa2e!Z**>l{v;9y9v`kcfoA<=(5*
z_YT^Ba7GLq48f8{#;K?dH-u@#uieIIoMKUod-WQ1R&Pf8ImYg>hOHay@7Pj^UtoXC
zD-iwNrO~4XWT+=w1P2o_#Y3@dco9@;IMV5<8-hcW8M~I@A*S?Gx_OOD$y*Y9x)^~p
z22K5vb{p6G_27yi@<c`#$o|^20>oJZD$&7dT#5I%(U%IMS0?vt1Wsccln4e#zXt<W
zUsYfFt6%JE>{Q+$|M1-6GzKZ~7l*#rz;@cxF>0nj(h+nN#Qme}3X&iOLD-Kvii-IE
zk1eqmkj{=A_S&&-4G1A|yPWxsjj0nqh4wrKYG^GCjkkWE__Cpn5ay-v`g-KB(J^4$
z2V^$n5$r<+No{V+*q~#655HW!`*p{qLh+1fe4GwRJeO=ozrdakwgGy#iq=+%1}0lo
z5$K~M5_89#Xh={?VsE=$Er?n5HJ|z*j*J9G7~+VaV6^li4+9?!ZSgWFiS@EgN)*&l
zb6AKMK^~nGN-%7ABW*m=HH(6{Ss5P|hzVmhuI{YWT_>W}XEg80EY=(}P5#kuhn_ns
zwUNA;I1*M}1ih<*exqz@*0Vx;pO-QDDQuAn^R!XNnWfK!^B>dEXKRYXAa(cX-N}ip
zm&uDAfV=t%Xhwp|Nbm&MFh(jrL=g1TXsPfJz;U(&m|Mn3eKfiY6wyI(k49NN^DQ`=
zd4Rb_3B`v%$We&TJa)RwZ1shb3%!#d9&Hk+K)#_Z@NtC&fy5M@CG(N3V*(6(y|P`-
zqKZ!<qBY;t)*l@7;GuWckpKN<Kg!NF*MSg(qC1*cMHu(Lv2y0ednj#EHei~m%7>SG
z(yIHs+9L7yV3}p6cLDIAK{8?<)j4Dn4KJkNQ`0>w>yC(y8-9RQV71_vcE-tq-GPp+
zT;p|^SmtS-=1aGrH`cLpt{Ih<C-n4|8)bz^8Kfg>SN8x6CjbU~;`UfUj-f$3qH?uG
zcKv`xM;di7sqEc5maPqPTw?&4cf4}|s32$7ARmExE?%1X22(GF*H38FZ{IfvNNil@
z5n1$>M}&U11+37{(I6l(N(w4r%z#_(=aY?9vfUsc0jW5IXNpODOYNLj!NggEgv7st
zKFALq`RB?Mwt`Km1_=q!O8>GRo2}iR<>cz8aGOQ2%(`A)Th2akC_Eitty05_9?}$e
zX>I=h^M8vL!jJ6wev%X4VvB+NYz16M`DG7leh@t8AD}AahhO`3)qMt=)~2;*bpA9R
zx59A<`Vpa<^;i<n)SDl=PKE6i6ePkt98fo*0d76#V};`|H>Nx}9(D%{SMzgjt#H}Q
zjVN!_u8Nuy%F?-Q3v=@tH6-wm@IBNwWmk5?Pzb{&>Jvu@VgJQy(;rA$saXIaj+~CY
zC@~s7nI&q+dSFPJkRp5=nzqSt)*mVR&vQ5?vD>paE>I}gAvIua6Pd(;Az8?KHZ2{(
zT-e)?R7!$1Ur%ZgCDQ@t(arjP5Wbt8Fy*JDOv9~_T5^xRlrSqh66H<303>XxSz!@U
z5tGGhOK4x}fggDl@<8@J5sECN!#y1FOz7C^sVei}Pw+*w-Mb9FJyCkos}k8d7bGy!
zsLmG$P!oPa9o;Izkj8;`^$^*SASBZpJt87x>%c+uO*QGgZ~}6vH-3biFo@8R5mRm`
zSf13v7lH&?SwSX@*mu<kl${BQXLSgYEmzNTASXz)J(;V!fm>L)?2ZjJ%0q(n^?UqU
z`QjN_&xDacR5FKGT3rckZgm1P(kG>XVAwqtBNLoDeHpe>kf#sn)%;cyzW8Dpfs==m
zur5~S3^Qg4({OT(R7$~=$!YAR5!<{hv)gg2;RscRO8qoPT_9a+=5QU@AJ0H1E5{~Y
zuruL=4%o<RFy19CC>aYWU}WE<-QJX4TMon^2t3g?^$FhpVmo7hu+&5@U<^?NoX6>@
zU7SF187ikEtj@d>=m>njcUdej#>@@a8I7Wxv)LVpuYr#AL`h6Mq&NL4OYxwIK=!q6
zGbFta)J}r}%JSyw<UkZOufDKov>F~#j$_{Ak-$r=3oeqv&q9P1wRhymZFYAW4041)
zzya2bUaOHg?YQ)Tu0j_>d30-&)5-$PLtRpe<T3*v(W~&^Bhk-SOZND>0B5Hg^oZhG
zNTG=f^ZD(rg+%g>!H;wrt&-o1!jICHUQjO35bIc|t^8=LgOJIb4iHMaRSkMX>&0;Z
zZUZ8LO3EQmBmJO3k935AkRK|_p>=aAF@b)?U`KknC?Sxh9bFqIp1a!^l*Plg(L_;E
z^3Kxw-Dw9>x<QWgOfO$*ms4po$<eyo{Wd!)t8|joGN`KMMyH?A-LBg$vm_%o;*mg+
zJvE8nHzINtWZ~@;nes6D7;L)K5U8CDc%)LRj~acIQ->~I4I_{wt=<StXOs^yA=91^
z^cjfFx?&I{zlqwT;l_h<a0(Nj_QT7<f6A^X$AS=q-Doq4TD||pw)O1?4*L>G=9>^^
z2Ba414HsYIyH*D?_b!w4SsW?2Z(-qCB<*KIPdc1Q5i{UANGRmuISSm+E}|usTt>s9
z(Dh6hZbyu@Vq2;%6WX5BE<FAk<9-13LmaTdPs8Gc#fKDr?eXwPeOZzWf`Ik6w8_5`
z+F#v;cNev?ftTKwC>ifgK5>Hw#~xww(U?seCNf;?xcMqG4j&f)HnhHC3O9>}d!lZ_
z(MOow2P?d;EOnv^bTBMS*eypbvdRWSGB@vXjKr7}9D9UilgBbK=$mv0N+6FX@C-Qi
zNS~WaB<@Jnp3r!vPW%+*7_*s8kdc;_)8Bx7SIaoued3W+@TlzEs_@_Nof+<n1{{Ti
znP(|g_PxrluaGN|fDz$1B#eb={sB@^5$q7Ra3<`|BgPOnP;??~O1!cAHN@-aT=prV
z?yfV=`XRv-h2xRXFaxWn_h;6S(UADoyh;t@t4c36a@Vb99A-*n2*)Mi&$0OCiiRL|
zRtwCRgjw@4Di8Zw7ELK3wWyZxl>1XK{<tK+lwDB{#UKc~l0yf0|BJoW<Rv)1x&s))
zHZ0iEe}TN&nw-FX-W@}cHH4F>`qTihK9sYQDv9d59rl81F6^Qt&qPYZKjFdodrivZ
z!hWOPJtlo87Y*lPH;FZHg%XI{s)p&3g=pZ&Xs^zc4e#p30L+u5li=x=C$F;Kd8ylI
z(3~tcHlop7<{v@S6@^psQa`vj5bUK%ZwIW8fYJ)9WRcBi)Y=?u(qN@<ff0pN0^m*&
z>Eg5uK%ZuNBK&WKQo_vw)odCpB{hlP4y7w^?H*yr@-|7pv@ah_iGbg8EsoNYS6tS<
z1A%fF^X6@#@(y}X(lG8DfDl&AIum_Pgcf;)mS)Yddzuo2UDx$YQX_NFx4SW{1VghZ
zToSTc^Nhabo=L;~T*C?-<tSVdVs$@0NMm#Kd>c!e%DPq|wF6SmNwZhpg*48`BgCOj
zi^M0lj3s>zVC|M~Qd;;D0N{5Xi~Vo2-uV?8F|jUT8_G5S1_TGYZsx4{D)GIb<S_|A
z)#k*MtJf^Tfms+OgL#2-z>blK7h30!vTI9{7zBYgN*NKs`(JEne*!Yu3KyUp$M9^r
z|GSA-!|Dlek&O_*aiA_s6k`PfT=AqN*H$t!*EnfQ%bXCH0=1NI2yAWck7BpOm2x4#
z6_>_7w3%UhxrA}n%KR*=bmSg{fGyXV%IGVPG>0u1rKm1!DfKQ5`5ZDxp&i9h4I8^9
zT?y$(a%Pp^AC#dO6bAMInyaKUVW`A4hbXa!u+T5Fd<=}7BMWnAC0ICA2|xr3bT62l
z_g!I~*IQtl77k>{GR>Z>G4G|B#jUUkA`Vw#^$H1;IV>38&vwz1{TJStgOyml(t%G$
z>vQ~2aMDUu;ZP;$JwWoq@~74|#pCHD3-y&(tXY?3rP!ckI5hrn+E=Rq!UZC`&VXl(
z#AT<II~aa93IGbs&MkXd2|fHU(S5PY@wC`0fD~KHqW~?eSBS%t5aa{I{xJk$)kIpP
z1)3>waFR|JiU^Effj2ufd+tip*MUj;0QwLR-wmr-A1?RxDFk6rkmvxz)^*58Bh6NE
zW)evLC-+5&YhaSeoq^XalRwI?C|P0<gx%<kttfc^i@n7Cq0*h%T!3+1EkQ!^7Wi@1
z2zu$iP4Deh0H4wZNPLo@ENN@D*mts7zBs~FOMDW*^wpf1C-y-23DYmZRMWE($--)T
z;OFB86YALc*eSsO#3+e@qP3xJ1=PVmSKf(2=xTZ*l*IK%>hz)*3(BBsktJvmdZLtY
zSdOqaSP#z1mkd+lMlM%?M~s4(_x+-it|a2bC*foP@D1`M08aGwOW1F#jfXx0wFpVf
zroMeC+PcyR$#jyA?KO|B!g1X%9tuhxelSW<!gH{irtGK*{fDq$*PA<TKxTWgkM-cF
z$7~302c9V<oNeQKEDi(F<k>YAG|l~?M#71kvFK<;<Fq=Hsk9!m9tk!A$#@RFybNlP
zS6OHwa6*#E@+jf~P=hqgUZs_U>=v0SX_P=hrGl(!HcwopoZpq<-qp9V-85X}%8wHi
z9XvbObQ=CqzZsR;)_pwV3XesJQNp-`Z%^g~)O99Naa8m~Dj8ImrBM3zCckR$yiH{%
zdM3y@KM+)Lj==<1mMp~mT)2PAt^hY;7=*p3RYID^{QqOKGfksqla3EWX-a^AvG=-k
zJd77ipZFrY@Q3zc<sib1qu-gXQC;KP^O`B^E6lO1fGar!;nHAc_niQzzCxwX6mTVn
zI`Zb&Gh^$QP4wqp6ejXkK$UR2Z9^z-Zg|`yy$AUj1s5D}C5IYK3PYL}0^Qo1f!hiU
zwurzIKLvu3I^8wqded5?Aohg_E5Ru+D$Q&OSmMdhDnyltuo6E-T&bLg*&pLk>f98X
z@`$h!QMB|SUf9c<s>*NlUEyw^J$h~uh0#E%!_jhw<u0r{<GSCtQE?hyD>)w&a#ci7
zN!xf##UMI;OUX&^g=JUVZj%Zk(<um?n+m^$RtTb)O&48_E#5Vmu;pX0!hZcx;^IG>
zCam?ax1TJC<e)zX0hpXkDRb#5`<^!c{PBj!NFrs>p#g)*7q_hsR{eLc_Bh!#6-k*<
zua^E-;hsey8}X5^t&~K^FcPE>g>e%EJc+MUH7ya3ne^FGRi^-ZMu3xWT}Dvf^)gz5
zc@j3NSi&9a>7q9rV)?`D=@d|~glD%+jqWyv)Ig$reNlF{xfX*U5ZzJZ2b6LD8+%Oe
zACxwEY`~amL2)?qjB16s?x-zp*Xh?F+~>7I3iu=RowfDU&<T6d<ab`617Jgu*tJMi
z^-VW>0vxu&?ivSc>nE$CndzC#3RxW+ip1EkVA3h-T#_A_E3=)kETBFo@%yE)kesw&
zg-{#RBe+@Bq9>55*_~L!Rv_#mh)2N31R|p8zC`QQ6lzvszM(o|gwia6A~<L&mTBb-
z62&9SzXNMe{xR_M@c(1JpW`A{UF>NG5k6W;KfmuN_~IaFM||DD9@0th8eT3FtzgEC
zARd9oa?iUgB70_6Ib)*~UY{{HfTaIv%7=YcPc@m2797tp$FYIgv!Q-u8p+HQg>F&=
z@rYdf$0)t)i+!IhnT{56Wh9bZbOiMr=~HIkXUdfY8w3RTh+G8Ok<&^nyYyVfD8#c!
zB=M6Y*GsL_EGnUj?gDrKK||u#?8ZE?STt!!qJc3h>xSL3us>`mk3PB4@6~kWbKG^<
zHma@RF&%i3*%cmxaCq8KZb?TMLnh3^zUu;ilwD1(gCPjKQNt5Oxc|i-;|e8BI*V?J
z@hb>AKRxc>vtV!w*0DouP4p(3rvf91bB{5=YC6UvZ$+B~EW-<oBp|glj%;Gc!tVuv
z5tXu_NWwli*=CL>Am;VTPUs_hfswdoW&|XN;eoE+zZ(<x6158(Q=nao%Jbe(8*$_7
z1x4a#%7*yfY-;RIfN;G4NV53q2A&9SnWn$&z}Kj89YF!;|IvBhoeNG>hJqeh85YDr
zAeFM`9c@}=W~vGu8J}$Jp<4x3ms*#OClakdN7m8WnmNGc9}JY`wq9l*w5~S~cTk~+
zqE0pwEoNFP01~`oW>^`=YNNA`2H{@m>#;!u84tAhcDxgC0bjQZB4k+{de*!5k!nO0
zTemK<;T=<fL7diw!HBkDJ>#0o&IA@XugWj}ieKYK^~}wDFfhTl;2HDXUjka@1wP_1
zfPhLK&`>bqc}I8R?b+>?wG(KKS*AuG1%pVnDoB!NrEK&)*#dS!5(4P%cB@B1;}QLh
zu67|E!~|5uNHQv{$+B~lf6C4%NkSL|qBlwz0s-!Sv8A1lLDAab0x2t+0Mfk1RQ#Qn
z-iVT0?mNJ+d7hKYREc%c{=KiBa)O+6a@@FHy(=5PFScH6lb~qEgsMh1QrNH5XjoY$
zk-&6jMfvU+RfbntVQ_bj@D)V@%rcrZrv=(9H@Y+!38onV1j}Fu{<lIg%+(d8@yI$a
zY#~h75bzclDgD7f>UG&GjU2qO?GjmzKXA?;cj9&BB>C52=pjTQ7?rUV!=MhS)RKsV
ze8fjF!KR!az~sM-?AKMlhi=WG#758}`{^!mr&%|GP?C@=8JOfk9mo>#qO?7<^SqjO
zA<D~0%?}u%Js8n?BO^%?64e1yyoi}%4%UbKV21I!u3!I|#kK<dxuP~I3jGG9$FhjT
z(O05a`anl)6{=_hzhFs3qK3>&!0#oL#fA1L*4T(7B4Hl5l_NEyk11<;agBqVR3xn9
znDdl*fT;gaTQxqkBqHHR&f=}b(?-;=qYeahqES+jFo8GBdqEdSR0dyHr_q>1Byx^y
zL>_6#c&N0>sr5l<?%PEP2j3`zyU{%+`yXXjb}K;$!#aB6PSSs4&*o>tF%oG2u~{I7
z@ew#Ab;*tb_`z+3jd@&z6#<p5>cT`ucgy7GG?jKJ;sb;M^%N4Ey@`n!QqVJY@6R52
zr#BBI(S)c9n>?_t`yD8N9?SztCQ=P7*x7$B?2*XIwYm(98{6Q2Hu7%xUwh!-wG~TZ
zMunDc{rI#b0R^pE-{zY6NW`FqJ)$A<QP}ZDOs7#PPex*f{N(reIa}u=X@5Wqs3`@?
z)U59U<r-NEx@Me`;7uN<>|r+7Dtyk?mQiKUG6ZeCp8lur=a)Igh~erk!%&7w_M+_#
z*ivNN-zKYt0wdgk2KIxTX?>dB??C1lBLGg6zSHQDY>`t$5P*4>7R4wp*nMD=<coo%
zr52cP^K7+7Su$WP;At*rDrBS%uAc#j;I}eVJ2j^N%0r^uXB~!5s>8Sh(O3$#T*$0F
zFs}HgCq7B@GiD;m?$FLw3DjY+{?VRrUIOjvbQaqGw@4k#18LwqdO+otP=|v87tj&_
z;Xoe0m=CcLJ`B*sfmBvIy`UcV@jqqfmP0WJ0?{2cD)^ZFZ|pMOA1rNBHb9K=1rBHa
zaqHm)GWpBM`K7owtY0MJy8R{_&u^!h5{etCDGBKeoNz=aAfgJvQeitJ^pnxbYg|2e
zA#Aat8}zgV_h1wHeVx^VYd0Wl1tLDCmarfmosVA!d}2r}zZTJHt61+ZJ=B^Q?+GE<
zy01ayZI6bY_8#ep$OnexZ`NR`Yh!C)tiL2C;%L?u5PH)I9`50LR1&{zXh*ZQrBjsM
zvI?aErLz)P4>%EtrGjgVi0mCbq=gAag6aV$BUyUc$uI~srjc+cWXy!Y9K4LATytN@
z#6A`cT_8x<dcr%}u<mX7&uEnsd>?G$y6|>31r!)s$VJo0JF_YwAwfG!|E&D;Wa#bg
zI-`kH7*0SUlnG<mqoLSEtfA2P*y{Qk*EO@*4D4@}4GD>QA|#}yZ~~HY5#d1$Y^TyA
zTDi=USh-F>Vh4jg8;I88_U*AlJAvVY_*&#7JAD-X?1M@Y{V?Fyz@A2~gg=p$N5-ti
zEu45fI0ea?7cG=&+R<9A2$l^AS_+(k1eRUZja^<p%FZZ>VGsnOS5g#}`(LbV`qPzm
zrh5S<LzLhK-!`BeDucTTas4yyQ_5j+|F&u35#gqUU2MOZ)f{F-wojedGG(1@Vw=Fs
z=5!G0%qpj;3$N|apAet$)?UDS+(oA=tM@V?g(f@DK-K?^TY#p-H9eBccOf;|lH7M2
zrxLYOZnG^5OwW(U<@FB>tzTJ~Mse-UN4A-*L(w6XujL$U`L)_(e`oHMceI4CY^)78
zWkbh%_CLw}nFMYk!AXH~ih?#Oo>O>Q>LD@Gn2BxKkR1PVlTCPDg8t`z&Q~*Y7q2g_
zD<Pol;$wOQz?5v!2R;)m5An4$OkuOlU|x0}vkhWwz9z4=K?v-`vI~%Tatk}mA$K_t
z3NE_gJd6C$BO92X{l5Pq7{!FM8i^me)ADfC>M(*Ja)z@OiDHu<HQdm+ciWVb%VH$%
zNkZG|1-1|Z*d?5?S{neN+-FeuZoxqiik!h(r#%<$e64ZI4Z?&{I8XY+xFbsqEIx~v
zQ&z!?vMaH1AP8X{MJzB6{Wo@aB3;;UImHd2Rg?h(#{MVjn}xmOAk1Mt`i;xt$EZcT
zP9Z_#im~zavSa%lL=xD1-rRjNH)bOYlhkdyE0Yqr@kSfTz%HP_+1kxnoT!q8H4<?Y
zAshs3ENR-*lps9CyuYt$Sr%|Ny!{VkLm;uj92w&X%w>Z%mq~Z!3SqwY^~A<}WXVae
zWRgH^bT?CCjU9zMGAy%gBD)0}&LItj1hJ=z!X3%D&_FObBtU7^VKGy(LLEr}?f8cY
zOu840+P-kQ`WQDVgY_5)NT8&dc1J2Aj~CiV_(Rt~#?6$C74G{%oDlo*D729boQ*J!
zs3BW6N7r*CDn#LpOjxY|>cgelx+J|SF&tVq_fgr`xy@Gm9BnO3>=>g;kJvF=!3x`<
zD%Qr*&V28v3aX9~ZzAbT587nrh-Xn)BXb|Cq^xG9u<mGAxJ*M;SR+dxnaZK!tvE|)
zo}1xJ+)~%Fzg}21Z`{nT-nSEiCQ(=;*M6EpLf;){T;0Htcol^;ayh`50!M?AW1SjG
zRN^OV<cG3z$#ocnq3DhxFc8E3H}-sp)L8Yagom9lh;Z@e_}-6sq3{(t+um{bp$Qv-
z<)9JNQwzeDbL{o(KqqDTZw?x<AijBh#B#@u67qMZm&y7aG-9t1eFm673W^@1IB_4Q
z&mgZ>1dJ8qgYT_QP2l*;AtUv++iUSlzlp3YK5mJRtKI>eF7$1sYeD8G9NROO!3A5h
zH@;g)SS@nT=xVw$#jy9W!5IdyPFVD9_ffF@I@d!Zdjg~bRAA6Q4{vdzobb9M<FcPy
z53h_7U1w%Ot7|!MWPe`#&N}#QAbm3POYddF5W!wA3%9mc|MkGt=;yiJ3qe=G-3BKK
zX+cwKW&U!!m(7KEhut#TWKvg@@Xpk04jyTsw^pfX(~4Wik<|9jbJY*ZaTT+Bz<feO
zMzS)^ZU>K$qOO9RE`pJ5MZtzl*VOSNEPpU_R`ykDWWV%$AC-p9dv3jCFixWFvZ60n
zKPNICJn@~|vE15FzbYddO6$4L;NwE}BBx3jBo@W}9|P=pu3{&}5hNg-Ky_tL8f$#q
z&MiBnID%x>Yd6ZMgjn=^zV9DpSCAw@2*Q3eg{X-C|JWuy7io5D<pYd0wh$#G|MW%w
zj62UeEWUvOI87RfWlH+J8I#JvAldW7=OOBRBKwF-Iv8G9Z*ct;Y5)k$wbx2_Zo9YZ
zK-?gOY)F;fr<?dn)LXk}m#G{K5+sPtR+Rx+;r9|1+wND}f~poS-0a~hwdfN+$L`m9
zutx?*sV9v$>GHHwN6_!tPl&4_Ne%~USmX+4n_IshkW*>FHR>^^;8@gV2P8`{dSSt5
zc?10K3P8OYP*ge;O|+18+Np-zpXWU`Ua@ys#BNu1&f-iE06J$M_I?XOcdP7MoMrPS
z<Q_M&-4iyOyAao-V9wJ}Q5?DV<7vNFa6r`9VWa)Ckw215+O`!=+Dm!_H#GpLuhjqh
z#jF*g2G$6^SfDRbwA#onw^qoGCu>ALKFN>;G{c7F7rsh%JXj;BmTXl`x+sjE(Z5Tf
zN}TE=itH$lsM_dVdLI0!{15YFCvm7~(v54-Co{2=D*I+Hdsl0uKA}WNf=_!D%CN2w
z*g5N9W3g6bob#)9zz=2Df-5ly0&iq2BG~(1>@jXq1=E*u0pe~&0q64;*x|ISYqc#g
z2<o>@KY0PZuK0F`gDnc`Ily_xB&I~Vwd!fERz9%`c;zwOG_lQ^*V3}iwZfrU>OmT%
z#G$+6Mqq#qM>0?ZulNt#-*r4Js<+jy+NP%-1m-@#1YV==vk_}62PDb{U`lkrzBI85
zHp~drZFo+*D}zQ6N64xz@x}HFt=w~x&TUw6dWcutnmEWd(1;YUz%ihokAbnkp+u3l
zJJ%Gpa~uvv-S+G$a>|mp(t_rQT?Gm%;?l8sI7NwD-62MPq7ASZp`{A*U(~my2E>Tf
zcn}qUhU}5JiF%1WFWb6mh;Q2c8zD*KN_;Md7U^J#+WBJXL|5#9Iq|U^SVRhHQDLa9
z#4#ahCTe&5X(qI6++f{(%=0vHFR<rjgN+P3(7uLjPt?q6)kU4AsES@SJ~c~C%mCO+
z`m}yEB2cH}<E>;mb@s`H!E1+D-|7^esEIt-5F%D_6#RUd#>sIkHWGipjt;?8x8e<d
z;Qen+;{PZ+w;YE-7>e$wN`k?7{~N0hA03P}RlNZeq2Rag`P85bdCmc+5qPE6JYckp
zQ0#@P4SX7w=*NO6y4P(#eC@xdO1N4Clo5+EIcH?7QUKZJL&iW!K*+{cb2SyjDxqQz
zl*0}h7aF`G5u2!Em2*QkZ8bO0gzpqV##sm|#2wp|NS`m@!0JCQs)d>-FDmzIVf6`J
z>4i$5ad4WNSuo-wsQIkx_2>h<swDy5f_K~oMMRNVbTjiXQ=0b=Y*x;F_GYEqZ(f5k
zq?qlvRIXuvYSb$H?IP=YB@|yPgkQVHNJ9-C1uBY}S(w0PAq)*FBd<vfv#klmJMAaw
z@B2QmEOyLyXRfDv4C${f6C|I?xw`KWp?U!-S(_kV@+4S&A+p(JMnI{zAzd+%mnArh
zYN5EYtBgQ0^Ni$1dqhUA4O%6W)acn7sU&QNKLv?TELL!BdLJk=rRAen>i1ZsYoO7w
zO*Y`DFWvL})=F}!Ex2K%m=!F^neTNeWRWT%H}$NXoe_^n&#A}fdn4^l*|ptB5QDIe
zMoA{&(SKuybN9jHR$3ZB(S`wsHFk=6!cke_H%2gk&ACO5-s2b|x38nC^OaMt#Hmh?
zV2)bXwCU>R?%XNCl5QMV{4@;nY{R4Q1gkq=M;q1A5k#1O|668Qt5Tifa%W882_j=Y
zYG18=&SY7e(Q_jcBr+e_fd0gyvs4zx+_RCmvf^pUUeU<2nhK3fkVJii=_h9TyE>S`
z1*Z`>l8diZ(;sUp(^VUFMxxSzHL(RmI@Z)LD9azChAAUt^~VqciI8%wR)LKYE`iBU
z*W+ef9>>ncvZsMTB+MAC?;0cpgF*jsFjMWESAAfJ23T<HSK2GM;1F#zNsW^Imbnmu
zfu&G}=G1sj=}e<LyGgdks^sC4u0~bRmE;fY&ajCfZ+5F4qfx{>HAJ6<9UOSaZ1_0q
z7cRq}?#xj`*orQkv94Sgq&5p;>QqP14dI7CmXgEgg?*$Hf4ELy^2RZTt*yTpI@4Ph
z>Q3jE@L$_7Y|dD5xkRB#I%$At???l5j^&H3Ka^cT62u?~`%wq13jY6Nn{@X;OLs=D
zJvdGa7%)vvgvClD*Fx!yb~JztYLw{am6W$MyVxHIX*8oT5;%CHd<{nBMX7wB-1I$b
zgFzAhYM`YzwJMUT2BKvaR*vwI>ePmX$>o01Dfdf`N(7Jd;6F*cjcVt!Q7d$-Dsd#z
z3CNHQZDmyv6{&o)af8o`Jqdj`^m$lXWzl&bHvMpuClavAzLZAOC@C@zPMsG(Jt~W*
zK57*>02&A(6F`I_b+q0VCQ3pgriF!9RNvxVB?X=vJuR{$+J63O;DpSR2E!M7(E7`d
z;;w}k5m+JEZ*NA<7$W!dM1?2-G7Y4VMca5_bJTJUVDqwtj0l_%@5jI=ldJQ!E|T;O
z3h5iIXoQ|x<mx&Rv+iv7?^_6m8r>GWGb!-gQYehVs)5Ph54Jlfje}0JFD19Yn$y4t
znRFRIxmi^A8kushQfMYLP(tt?5Cmiv7&##$&u>O09#+f>oIMByREBR4w2>A6HXL{%
zHs}-H8!~NPc-m7I?++RDP7N{So1+b;7FXVI53S0FvTHrg7zSYz^$zfR|HUf#Pa*Vc
z!vY*<$1)~D`ZuomggGOQ7q(j8Q!)To@WF9I$cR=-(oq>lMoTa$g$3@Oz|F~PrS8z;
ztoU=*r*dCd7*-n#fdM*3d6o2dFFYyKQA239OikNCsd4~iI&)T8hvk>IH%c7iqM#39
zn(jD->)5=<8p>X~5^8MeJe5W(FzHz#>~jkZcG>S&eG&CjuAUWwdTi0y@-ne{GKPN7
zg+^En-Q7cT$8%4`%zCy`IKz$^^0g^@CmguFn(f(Oth5k;@rW~w9b*rDBE4U{!mW^U
zkB<t9iA=iH{`^Gx%U$<l!o!bupd^`OhKyz{{rjn`Zx{^S2N-EM5*whArE3aM)`C18
z3I{qFk|%Q{7u1Eui#mb`zzmSP4)ulxs?4-)Ix86mI{)TuKK2c7*G#Ql6_o73lYWdz
zf+j`vB-;T?f%~aFc+$@+Xmm&>e74~V^hE8!DFaw@1+-gd2kH4Uzg6NkAD7KN>IBQ7
zFMaZyE>wNp^NZ&u1BXt5_#%>Hh>E>S_?xmb$&nZaq3Dew2za{x#o8~mXkx0RW}8K1
zc>s+6@cD6z6hlSj7Gll^t#^<{3T2;1_6)Z{oXyA16rSY@dm#WvOBx|(jz*+J<vA0O
ztx)wvUmCmiSl7OrD6(uS>9wj*rbcHPbTM0(z6%~GIC<f$up^>3%_PfHH9UqwXS(Qx
zb&Jk4>$(kT`L%$ouZ&~2LhB`3(>#*QyU>}vp|p}5dPd>m60K>_du#5P@aY$oq-lk9
zi`F!gcU<$fCt;4Wp<%r;3+-jlGXN*raJb_sJZRw*2k6KyQP<uK2vfsE$&b!b!24*x
zju0moQqMQGxY^`zjLPmkB(t!~a~eDupM;21VZd*-WB6IHFuLY_)}_#V2;h;`uYG#=
zr-?v;WY?QQQ(XgkWQ|KEx>k1IZeJ7?w9-8c@DVQF2$>3+;?Uqu1Fu4w59krD-8+`8
zhDhkl2F~oj!jC<ostm`0HuM3@ONu-NE|K;(T<ejO#&%(yCt0QNvaJC?@=OGn6d3~J
zU;IDg{c|FIkDQ~mk3mht%k9oKHI<VQ@FPxFPJbx7qGX9d5OyO+1u5SDVvlq`7E5>L
z<pK_4#X^Wld^x<S!q{#9W8I(eelt#c(~jN+p-Q#hW>Aep9uXi?x1>Vc>r?A<OD5bz
zACcYQC<+poXmRu=XxHO9)Q&Z(^+;r>V(yBo&q-h~*U5`q0yrvK*;zG02cZ@l3+qAm
zfFlXs6y2`rWr8KdPCNuy<A}kjbM-Rcp2TnHppnF_ZU&A+d^xRiJfhl3ED{tC{s|O9
zsiiAqw!pImN306y3{t$+io_Rj<0KNvf^<6^lJU^;s{U0@aBqj7otuqm(3^>kDEMKV
zU836Yac-~OE;><DZ+Xrg2f?u$ei~*w==io&)~>QBOcozhlGuqYFuc*;3lt>`&UX+=
zVp&+cM3rv6a+Qq0Uow+q_^lNLH$t><Po4vD$g;>t)K3ck>^Kqq#alKSLL!9|lOzf#
z$TJ8YTMG0spSS~2HY6s=UJXsLn0wSuQryT#@5IfUt!b_X`bfXMm0m1G-|>uJ5oetd
zYbY8P21Az?yRk*w=UHXM8Y0DH8yuBc`=Cz_|50{@xf+8Y>_&?siroKVuiY>F*h}OB
z#<+=4N_)5NX(=j7c!9&h*{5iYLfsb0Bm>9Gc~eCpKSlz-D>zBuk}P>>izYs|vm8q0
zwn!m+@<Tw2Xe9me8l}b4@6dPU!yU+^VZ%xj71_E!y2gd*8-+&nK?QI4f!U?@)HRk$
zn>z}PAn|p5Cjt#y{s8(a0WAuRuvIwJI|ttPN8q_W25HCZCX@QfR4U_`Yyx2J&1*#h
zndCLwMW)W-*(TZlvP)rJLjsosS9wpP0jeTCtd%jC0{24#p@b*_;s6`5&3Ydf5#rx-
z2z`J-Vmh@;l$AwKC1C-Xloltl5hAut_5nBvVp;vHu;0j)#8swTDyRPO7q`q~E39iL
zOJgE$ZZE_4*TbrC28Zuj!@I_sg8a2#)?wuU{IG~a`m{O)*3J7zjJ#hr(n;Dw^Ikd{
zG%7XZbnjk}mt?iLurcqaz7Z0r1SV@?y9Xk<5x@qo+T_S+!pzhQ+Z}Pco$l^x2s{L*
zQn^y#0Z9}Yp`|D<nmb<Ok-ZZyM9cpuyP9N;K@fJMj)FgU|BJoEZ}G6SGo_0z8OBmX
z49UOU?j2?;8Gi!XMRzS@OMn^0K}z5)Mec<|3PJz0mRS<M9{PreERymr5~0VeTM}SK
zsmHdqP(S`ao%o9*dLR=G$F8QNUqWqG2k}7i!S0*Ca+HxqJ$6o`J}JTes^rgxk4h4S
zB(eiuVo@Q?G~=-NhE5@IEMk{<`UvwaiC(feIEmV|r`>VJtjOyRiba`3=>R3Vv+rhN
zEjVMuN+)Hvdxs|p;HY^??&{EX$n3-pP=Xbffem=~l4<u&1(Bew5C<qRy~b9jToXYd
z;mTMOmxST~CDyM-$>oWM&BHr`R!dZ<B8MWBtyv})cnLD*y@1MG3W-CN7%J3G;hSdE
ze$>0+M~7eS9+Y)NVb(^uN?u}(4-5QiSB?c99jS5?@bsW3(=4+Nj*pcsYHUAkPgd73
z$}<v&P4PN4q+C}e&7dKMXFSX&ki_DJYS>IB$Q8#`Sy6<|M&`o}Z?_^228a8oCi38L
z#_;suQPyl!lp*hiMtnjhBHX>(A7$5eYe5JCE4mv5MCre=%Xof7v&qr`F-DNbFhlxS
zQ~;20>eQ|fT%a4^L_4C7L-f7t9CyA`ShVNFJEGyp5y;~CI;wzkT3VRpabg|`KaNTW
z9bdPT&tz7j`oTOx*t{}#x|i&|Vl|Wdg!{*>VtG)mvRDceW7e#`Mhbag!J_gt->#gt
zXNo6_TLJWiPvK=Nv<_Lb9@Gr)05)SZnjdc9^{knz&LhuLK^$urtkWv4o47{+9q3RA
zFsNf)&L9P|X-k`WgxdHh*y$9R>IKvm@A5R^w<unql1++s(b@c`0=W%uNRmH5fW|<t
z!ECWPoKU{P{x@$(66i=`QiwK&3{*n%i$dkAWl2ZIBHlo9$`K+j%d^rO*w7@4GgTZ7
zPf#^?mk;9MuXcMzJ1F{+;l_4uB{tSVp}E0H94H{^GZLMqHrek-T=?KOIEjzPCwfG*
zD0<HUmRD{!>t@qpMCkFoH~A)^{%Uwrtif3K_XBJE@F$ynrN6f;*2L|CtFE=*llUNT
z{dU$3NWv4j>C!=R^I>;kyw3km*|p>_5Q5MfO)Lt^{V!IYn+i-5*>q_pR*}#9+<xxw
zzL7n`07zQ4yMJOeSU9-{j)eHJ12*jf18<g_d!rX}h66^@xAeXOPY?Cub+-+F7iMR8
z-T)g=INVv19tStG(0mbh*Q{)vz?pT>4>LKl@VUoLTMsS4U{H9BOsZ9`oCY^<Q=mr%
z^!N8*DC)-)-uTn8M&Y&u-bEX8z37`3rfqaO)-V(uARTMjqPCS)nhWQ5I^3288oZZt
zc5r(5VjuplOI|R;HrPr`nIo#=aizm|!bqT>+n}|+EJEZK$&||O4)?X){;^NPfF-K!
zX@TNKPKu;GR-*})?Lsepu!V4bqDUZ|(gi59?Rc2HiwaHpphW_8Ncav5<@u6Uc42wb
zR`3xwJW@vPmuVq195@n%MdgP;=t6hn1>;*#p`g{giPNxT+G={J8D!U~LdJLCNYECr
zXBZ+lOr29iFJSd4z)0+(>1+^+%=FiTId!ve_jN1S>+oZv7|03(b6P<xa(m}l$`Bt3
zzDCk~DZ92@i$M^$qT8To9rnMm%lL(*Cn*~+23yf_9vpNYgBts%$ToHSQh=Ys-iK1x
z_ZjoH2JfNCa3CZkeW`3fB5^hHk=0Loa`zN?xLRex=fCE6VQe(g+tQQ$zt9WwwK!iA
zpNLx-O_h?WtAe)#4v7~Sv|DQ%|JN)BX;K-u#X|Tewk14sA*YC}f>&S<G?Kr)nK96e
zVERkgc?HG@G!iDw@=IWB56#h^-n5k}j5u4+`h>4|eu5g=RH*O|+mYkjiRN_%1P^4)
z!78s}mV$h}4mV@@vfjp4r4onBIEA{#xDQ~AB>I%X#$$)vhLWzym|1F<Q}R}UPTvEE
z1Pl?`8ACF0>)X!ry&J0>(7#_U7oQ#>eojyNpn|uu#<ZGs(Z+fXa+T;A_GD$CGT$Db
z6c)gDD{9SWYVulGIF%ER9Aq6ENS#eqJ+caA2-h~h4*I24bwBX~FB_T_<~t+nofdKY
z-~2$LEyp4ikTVT562-+m$M3FmWRq+ar<H|Uaa^Ooq>rK7NAn5zYGvUNE6iA(f6C77
zMq(HQfE}FzB(~|lv14){XTq)&8bFp4^JXCDYam2QH;rDM1N)92An8vnDE>GpH+(fB
zER)1bATP<xF0`JqF>E$61h#dPOuST>QsMS741AP^TzRjAZEGl*%<~^)4QVT~<JHQG
zuLrh$C+L(2S=Mp}FKT^T8ktnv`bpxz6w(LkU0K&Si{Q=`XO<+GfE$<}rlYpTHM(3)
zGEVaJYeXb_h?W)7jRpdfyhJ<xGzG1?h+CfJ%tjj3<WUKTcyol)9_ptC7$Ti($eT0<
zX|AwHY{o1vx$)VymJ;(HCRj$;$Sa)TN+^->-b*vhn7hjs^E|@Fw<nu$Hjb+~?hb+T
zPJioJ*`f{2uGz#vj{%}#sHFPdItR|+)_c^1nHwp9hmO!(a$79Q0yguHUr)%K*J3m6
z-{UdZ2|KHLz^)B@tTPXOo{Pexv-+XTn>U`C=DN00-@o05`oX**H3R?Qvna$kw_<=A
z>c(<e8+xLj5de%2N}+MHCJ(VdAD!ljVt)RL{lAo5OR@wZ2)ofM6%oDv#U61pAl);v
z>RlIw9}q%v=L7O>ZGpz-5{wnhn+1Ed*4IcX>(&AyWA`mifJ5T9-EUh0IA=`*DEnBO
zh?E9D0xZ2=;%clQVWbE2f8u8Jyd)ZQH1vRy<biOwX27^a4*f3zB96rn8w!GSGr^Ed
z<Yh+n?t;jAhs0T^z;MRH%T=Oq7=R9J91d_x9JNEaMg}Hr7`(XS?7Aj=dnng{Qj|bs
z(4r7?&9JahZ-*eAJ`aIz{SbM76Qq0nD>>b0y~PNVAiYP<qD+2n5G0x`&_G9Jt9@$<
z8Mp3zvw}P&iN^C$@NBJ6tUTj-=8b7!BopE-0$PC0IKbtGljPMAVucz2Kb5lakyS3N
zef_JG&j#AEVqim8FB0d~me~%LaO)53DOEP7+d~9S*lUp_Aex#`u&DYB#MzFaB9V$%
zBnc)G1%uVB-^rn*(-P6$14%HxG^RjAZ${u6uZ$~9QL-R)8oHXaAR#>?-Bh9+N9+od
z8rm>_28GztTI9|Ckv#lUb}cp*!ys&<Q&I?|`!9C5Pr8E0NzV(Qs12Whv5VotaW|ki
zBN)Bz(HfH=>mv+XhSdX)vw_w3b#-ipFm^qwM@Qtjz-;ym1bPf6&>6DI9soMx13wV@
z#+{XqIdI|K!q)YA<^ZoN{EfGXjA2FA*EMnzF7Z81%XmzkZnLhxKAA|+8E9P{6{3Ey
zvQLVoTHv<8R@wTJ?#zdfT<@UAhXEO8hh2Y$xn~Ja66b~3*NFPzUR&FikP<oolHeqt
zElPD4P^S6pq~}5uCsrJ8M=-n4jEjQ(P@E9dP?8WO&{fA8!-$j=VYDq$I`e={h!QBp
zqSvrNfp2r(t+P%zvK8hn7r>#mUUEQ`Y^Lr>h!QtI?jm(!oF}edo%dh6RpA#;mWZB_
zmbEF{d}M~cHeC9WSgCy`IHo>&!;=_EOG1^X<E;hl4R9hJ;F8RFUzgMM17M9pX2Jas
zfvKF4a3wH2p`9FI4UB9D!_0|apHob;!il2*GIS>!D9V^Ck*I(+5asbSoXevw>$F}%
zT?zQyFJ<SFBQXd=!5g6%J3#J#v2jJcaAG2jx4np32^fEh_kMe0wC+_LfG$#ZNACO<
z@Fk6G30Dbyg&|neXYLjh?v807OV-&Gu|HoB9v^zj)U=YF1hQoLo?DFGgcY~BVLJ-Z
zJ)k8Eg9zFih9c&Xluvp^qC_8Pi8i|5TrfV8rnnT8p7mvQ<7<p*)<EMeWtEk-$qO$*
z4H0WROtABzTo{@@L`uBanB2HAhFSeTui^9WzIu~>mf}<8pDl&SN?;FgN%s_(!2%{i
z=Ji0X<g73T2y}^>Z#FsooIjz&EDc!-J*fbfsQ7{GDU{co3SR&IYF5C*G_WOl3!jJw
z9pB4CvY}xm;|Xj@M^q7YSnZd8xlKpa3MYMlOXO;v=CIEMqr~j;Qi)~(FA*;V4(7(f
zbSMw>Rzagg170GYTTjH&?3R~F{g?`(5a1F)Umi4<UpG==`v-r%hZ!3^6F`%3w3l+(
z1gbLXj&?V_5yzlMc^@OuC0h%|&j&x;rKmJd2<6kp*z`CGPqyfJqfIeWMW2Lgpc_u1
z;1+1n^X9fk8`pisXC8l)om&pYAP7WvbR#d7{cr3#{SvWB*#M!5T9jdqWs7Pr#N~Z*
z2z0pa!@#h1%EI+ZU<rhp6>zO#q-=ayZr^2@n$S0JiFM!zZw}Q`2y6k=1E)<WDM?cI
zi3<Q&J@7X!27lCb?M!2eTv-oMt-Q`i9+2ufC!pIX<QiMu=o<s6I?@~HoyYi^tcQL-
zP{5ewwiDy+g|TzpgeADhk{OI@7|-JQe{A2+9o>{AQ-2-E^i}Dgibzqp5S4eS+{$t-
zgo)vKms1BLg%=*(xi^e4B!)W&V0o9@Pyu$S6doxX&awyk!YwoShze38-E<}Ea<MA%
z29$vaOo=a%tq^(JYd=w_n&vZUoDC)me`KW~pPYRTm`AL$msvj0B3`qdQMOH33;2kZ
zE$=ET&7)BvdJd2PkC``dAzN-CEb5Vt{?pJ){aZP7IQHSX!2qRqrBnMmsj!QgkI86U
zSujs{VlBMTkJU|70>F|9Dqmb<hiAreC0pI0jB0qDe~6boyBJX%ocdFCZnqV~Fbv)3
z!m+4C-hZ)*?vHg9pydKVkoY0XhvXj*_R~r47v0awH=4cVHH6DO99+pApGn`XAf=n<
z?bbyUcmm9-=ALv_ak@0$%?(pn%4Xfx_Rpe^NK<MGfn%6;n%P7S2Xd3GJ1dL>tCP%$
z<Wi&jbWhYJbc$dV-D1)n8@~BvTA;-vAc8os61L1@<Lc&jcvEt?Ag9E^mAHN8*5h4I
zF1g;_sOLR|2OnKYrc33~Dj2@z=$Na}g2IWGj6AFuFPvEUcXP8P0N^;t5|D(?U2@S4
z6L`s?7d#$dB@!S9E<wRXtGjlLH$i8NlPt-_ocFwIkae|qNy-S}g^QCbFGTXV7GpP!
zdN_ixM50)5Q3wdaMi1eY-tH78Gs@-L2u3G5814O%h%2BVK(Ut0jh(b0!L8M-=`55l
zQDSe18O<jv63>dS|2sjriUOI;?QNE4_?>OtwTc3+fD<wycr`#}KeM=BiW0#`4hLmI
zBODHhJGY{1r!s$ecM7%637Oaj?CS*GXYsAOh=21@Ka`zO4#Xe`1+P>ULGORDb=)76
zZn9i}CM{N!#~Y#!k6!LuFo;5#v49)ln<@F6#>7_LyE&-fKfy`f!}1CKnmCb(HHwlZ
z##~FYm}kWjE6!<5){C(1&4I{o{o5n-F|jb5#>8ZmXY*^5``|@g{&*2T<N7`T8WXFS
zC*$W74?>APx_GA&1^BWSTw%M`_OdP#sn!qwgs!lnt!!y^*gqvvSohPg+&FEP_H-Ko
zyr7v(vs0g{%)QzA|K2TzE}5wJHHm;ZZ}=od;%-UAJ%!5CxX|Dds^7C-n)qZ+Trwt{
zPSjjOxCakDdNpAKBYKSBFzq#<hJTI7f(E)L0@uSGbe&zrc-#|dTP@MT5j`kVXcUYY
zr;Q)0e_-f-#y!*}B*J{CDQnm(63`Iw+LCo9#JRH?!ps>h2})w@SiH8x7!biTc{}2~
zI4{*qVDq#sMmuPT;N1A8ug-k9!$8@jbh`6%m%;afOYCoY5V;`~F&MC_b`9R@mO0Hk
zZHWR=<bFUYr^@qU{hde&CoX{+O)lt%vU5w0AOxZ4ijoqgBkX@;;rJy(rz&iq%W>@H
z;pN;2B3mF>{>KLC&lS)6!4p6EhstR9dhsT2bnAB#bQ!wLSaW<WrPAPM<FT5Aj@UyT
z!q<42?3PZwwUeMLD*6RdoV5LulGJ!FcJg%-3N6r*+iLpYt>ciV1CB>9Lv&hY8V!J&
zZcFWY^2_~1ZoS8wNkZd&+nz2hFiQD}{O-V8O2Dv28DJw%Dl#V##gHs3;kc2Ln55;x
ziSnaifAKOHjp=K(Ob3!P2MQbHDVFEn*@bm;&fpwJSR=Ys@2W;pa;Zutoei{Bn0y0a
z`rO?{N_~q;{5w{O_2uK(HWeGBhM%!sqLRt1mo0@SAiET>+Q>+5P05Tp(;VvwT0C_V
zR_BP>je}I~<N4$YfZtMLX=i({JMK7QsQNG!MO#uuJDm>YB`f(7kOT~JPuj{QCutZK
zsef`Nk6;J5h`u<<G}=a<G+YLLpA0G@a*1r-z(wh$Dse2MWi#*<X_OS3gw?6JJ;9UX
zA2W>Y2K<0JkHe4qrR>^rAO=C;jW!^nc>jwn)BZ?l6S)8}_~13p92?dkv9tz&8lZNX
z3Cw1d$85)y0I!0RrVPR76yXbb!wxEOtG;O+MDQI#UVLEpbF~%}<@-gr<H^pT6xj+a
zUwy48RPV=^+_P;Z#@utGN)!MIer!FB?D!gxvvet#<%d2RVY2{bvkVM7-Z7>4>&<Ic
zut17&juU7a6xJ(oOxjThF&fHgo>{=LDMdXu;J-V>bu6O~*DSa}qjw292A-eKC-Yz7
zHCKw%$sW}};d;pi=G#!Q8^>)nQNBZP<ArUM3*2e?0FnrU?-~#tddc)w<&?z~vf0Ey
zWDFXzPNXTnJi!#lA<zUKBH(+=|Ah)vT*_exfL6NQlH{2H{=5UF9QEA%Ng%I@%(GrS
zQlS1^twcAVF%9ft%R<qkFbYxLv6Afv<&9||#C#&23q_#r{3Hz!6|^IHavH%(K`~GR
zIf>mQMywrJhkVzlvS%|GhM<yHfRIN>EYGXpg+FE2vcoV8!oFw|AtjIh|FPM<3`!=A
zOOFvs12F__-$eo>ZTDCRClph=s7mFJc>u{Lex#5%4Dhoxve0m$Hf`z=<Qu8aA`kJ{
zYbH%0mCCv;Sd2d=7e2r^?V$BoIlZoz<OK{V++YAF9Jeb!X=-8J?i!)S#p?8=@+IQV
z%<9ux*^5vgAtOHDqc>Zu@=R<YuDf;;gKxmhq0Pv0dY}X<JR6&ank03-aUJt@Y$fL?
z42zqFiX=J5a1#SYQTirp4j1kV-%`@ZR6=qJVHZp)mq}&W9UvbGItIX`d}->x1&9B$
zE9((SlG$q@(e9kd%Gj(Be0*OC;dH~^-Xrq|)z$*!^K2y?#)qd-2x?RN<}Z7HF5JVy
zdu;j|`Hs^dR^g8KbR~>DGASdk_bk9OR8}Hdw_xpHTa8i1;91{0Y6JgVH70CinCT>Z
zUXnf73P&McZ=JRpLHa>yw@c-WMJ$P=S4d@L^J%XZ=%K7f@~w$<h4V}+*D<6(tYU$x
zgwiRjA5*0$m1L#RL2Xye*=E1*c%?+bhq7zSffxjVH)>Es@ctKDreAc?L@q!GwaR0d
zxe=c}n*G*n7^o~=z!>GGf5q&VddqWCnZ|yj=f<fO7{w*RNC=CR08U^@d?QUsg@L04
z7>Pne5(}U1GIEvl4)<O$JpVQ{!AnNSC7G@~K8E5$p=@3xFBV)lw3!6SD0pm<uTc%W
zR*FWt?G8oZg%4m7YY)GNK|Rcyg%B&O`$+_o=)1De$dgIZVOch$;&1?yfZP^M2T0oa
z1(6p`dgT~LG>Lo63V|AdwnLJUX|Mj~wPB9C@@UI?0tDvgHgY;yz`sa<lW0eY0sSt+
z_$E;bTBX(sXcD*U6${h>ruJ>mhzkE*fRoJisFzx8xLL*byK(p!2>sY4!pLGOVKO8)
z`r${z7DvX5I}qBSzn-102CzrNEB?=z^bQa{2mq?%Cd4Ph0an7Eu|v%aG;{1pN}?va
z|8N0QGU&nO;L*iB!D;qb2tojqFuk;bs_%fiXLx-tARZ(jN)QB{=pRCM*D`lP;YSXD
zk`99Wh8VCvbDY~}Kg!N1$zd3Tp(pB&jbj_%|6-N;1;P8F3wT<_Aq1qyb&mD#!2w-P
zGwi0nc2nH=E`S9$zzl*CTAOg0xw@6`>x=H=2>BrhN<R3!AWjQ^*B3=ml{;iYQ5kV1
z<BwAeQlAe3v<nDa=<!5F$%BXDL8*%5fRo?60Hp)I6GM57NlEoUJ{za%2ZVS1PSo->
zD0ZMUY*%1_lFOo)<PgzDyf}-Vr(m;=G7kw_5>ybY@1Nd-;kh`brgCuVme}UPRwM`{
z;aXp}r9|Sz<02#$xo7l?Le2#H=iCVogrq?EOlwv~A||M*XVjChOVAG@(bsB~=IK)j
zLxOP;62;mYY2!keY0CG@PFuMb;U~Y<&PYII?V-}$@ni|$zEV8LNHC`&1G*_=h9D^+
zM-4@Ta|KNIi=<>8<zP#^s5#i8BI9<|5Sub0@{w&9sMZ$?)@p|}0pC77J#ua&I6hn$
zeUr#3LxG?x;RJ(7E+^KK6=iKh2$hNF4kfW4#HMzRT&gEP$UdH&IJm=h=vClFzPK*R
zFaA<?ZAT2lAZ(+YA3)9iixs&)V3J-~py#950VJe9CtgAPZJWPaEdhpD&WTxxvHCv`
zn^`2&J{w3jeRJZcP-wV!d&+LFg}oF#8{&-0gwD}RcwGW5bOKtmvPOjzBy3m%4yWM3
zHzE+`)=e503JEV-0#v8t7u!#IC}SCgKzJa|O5xT)akN6XXS|`15ni*T?*&%)iOl3`
zYrRXM{BzV2m^C7%+nob@U+4Fz;Ht=uT%v4U99GF-96^-rWkz9@j5XLQE*e4@D$W}h
zIjWTHj$WdW2(t4+IO}6~`sTpzFPwOaNrOicg0b{BdOn<I-)FA`ib=a<;|<Uq$}MN1
z9gsjVAs8m0OU7n*-u4;=?urD8Nxwj>vi=2Y{`|%#_c6MMAlHJzJ(Te{jl{VC`AXoJ
zU{3@~-88o$&iOc0paE&oE`Ve$IET$~3T<<Nc_u9iaslK7B~vr--J2AmaL6YJZ_QNU
zvl$Sogg_7deY?PxWIXiMVV{1sM*~yn3hpU$@~j+%cR@fd`BHXmIS_;(>_!HGLB0RQ
zmijX?%x;zo5JOOTl=cP-3K-d#fO(XjyTAoFrXBc_1>Sii)`FoqrH5>eiW?5pq=1^j
zzqA4QbG>pUAQeyONiC@GE#&UhUx?I=Dv(>*fianT2?sDwaAU5Q&DF|P>tQkg1wCGF
zU9XqnOQ(t_Mi4;+)CSFE!b)MPU33&;BCt(@<QCjkUKnv+8)B^l#X2FcP$1q_hG(l;
z$&?FpTox!xsQF>R00L*cXlWE?4i+d&u4d>H04YBct462Fc{!Zdqm1^Di+eup|8;<I
z1W-b&@$xJeNqcUh6(}%_<Nvnj4T$2j$MF8me|5t#6=?o4h<|WnG7ZXtR(w?qpM6R%
z=%Eeex$gvg?wL<kZpMK!5s+ak1h{}#wx<YUp>uBs#ALRP)-Ukz;wjq7T7{J;yRREJ
z0Xe+qP(*vXJ;hm}O=$sT!jPdQ=-KE^m-bUF?5o-S*c$T3VM1{|56cQr5DOR+utmWv
z);4EW(le?UmZ*EpTOmp`ZG-k+@q(T#p^MOX0JEBXD7&^J2tp9n(T%P=wExB~`4e$x
zmIfS;LzYKKPP~E^*tKm#m^?z^RqAvIH@fp>3xQ#Sm^{W#E%$$?cZ&R;@YDim!#0e`
zz*nAFg@wvb37zu~W_Ue!?(?C=aV`SRP;V(hdZEy?$XSBgiWM8-So217RtV`E%tTOF
z5M@qwZLVeIg0R5UVLQ;Ik6$P1m5YB}Zkm6E5=-K9TliEU8d85X<qjo7jBqT%IXsvw
z{F(T<kda8_n4ARFHvWd5|FyzvlPIV-`XKU3r^pu*yk6GAW$_aFqEw04m%F~68YbPe
z0Fsf$2zg1$ta5PJ<>s0@xqT3LHMKk4E1tW;3Nvy%Zs-wAke@{Nf{Sec6Ju$?4%9%X
zL|SqdSx<$w+%|y8nm?a(hiUBerG9dO_}MgeN!TKRb)O{}NKlxySl}w5>~+IK<6y64
zq(&hp)2OCsRCMajtRbV~3mquc*eY^(E?K@3>`Dt%(iT`sCJJuYRVbKnPS3BbtFNa<
z;ZoGBA|&=SPbRp`75<c6K@tNY2>Ve-MFIc+v6A)zMW@RL9M{n`!I0dSK%);jJXHuj
zroa8byAXTGE9xc*g-D1K*0agphUFOX_Oa%GoI)t4^%Tgklam-CC59&`+T`b<3%1b7
z&Q4I$Uns<~A@d3Hu21ZtuEV;F;Mc-LVJkBX;v9+s6-wm<C1@Y(2!6+2zza(jI2KL>
zdoNd1Kt$1|s7(%16)KoSF^2*P4cijNtG?EP`$6OGb;jaF4_geH54#z68;MSE0pB=5
z36k0knex^xkPsXsI|b0-18^qpwb3@=(2-;UQ~}dYRiX+B458V$39PjF$x>Vg{;7^Y
zCul!(<c<ChFue{sqD!o82>4PXSTV;57KV+rkqOHw8i-O!uv7{!6%w0Er+s{fZ(qyt
z??RQOjg@~p5{kSjWWHp0URsCPVM>^)K+1FQX(@oc=uo0-fTMR@Z|OmIRS0HOlqfet
z!9(odlh>glqhJXy+k|LqG`xKXW?qQG-^?pYCYWF|uC|P5tdwQ23R+^;{-*5Qk{k#@
zD7vFA#V7mU*l;@YAx)<$Y`|EFkt^JXBLX2dFr=oXj1cFgiRhcToyBA)wv!RRkPRTe
zd=Xz4ZfEY+vbS(w9V^-q<~F($GqHnEvZ3sZ1u@q?ZU=IhCIlVx;FFL)MvUoFtoGN-
zb0u+~9dr`vMcoqvMDSIZ;c2GFd9X<+7yVALLiD!YPH+NB9c&US7qIytmQRF`&jObj
zupC^HZ6H<du1m2;ke!UD>s`V?VyerU0+GmntYqL~wgiJ~9!wG@V^BbDse!%ZgQ7z+
zuffx(gh`V?9BtZgiF%rNW~#Ack_h6o21kYDkQd2j;z~QIB!~((_Roe^1CFW*Ppj#e
zB;zWB&@E;`F&k?oTJ-9hBwUYLC`I)xPciX-JB>=DT?(nu(C?_vrp~UJ?RuLMGB8PS
zDiSCBGc$E`J|%h~R~}$rd?xD;`~9-+a#kfBBK$|IIb(K8;#XV6cOz|0yXOtFjU7*J
zN$l49Zy}dnIAR+*c`=u1iG`c@>429agt*2r|CYqE-8VVysxgo{y3!;0qwL(0ECxX!
zx}zz@2eAK*4egf%tt%U#QYJov-KT$2@vl|KhqbSW2ZLC0J}^wLRi|5SScQ8N)a@_x
z_ga?SglP5;YeU$P{dh2AWu8~O<C@Uf8_HGMOX|<HtT%EGv`L_&>9N<FK=W}eZWwHD
z7XWr@oM$C*#m2RI+EQH)3y4vS%+o~KZJts6WBa?5Qb+0EA3;rY(YbmLx9w$Z(DJZo
zJUJ!4giS)Cj2u1yatWO+)&9cCy%zSpNCeE<5(MORWISg^ckYs+VrO(r;5k7rm2j;;
z69ep^306-)FJfE|zd;_ZPwWKAfOE8U{6`v6BoRxZuzJixTd;kIbPfx8g672Jus}lS
zoXHAUJ;>@4QV-q~Bx6PYv<^%xZeAlGDRJCma*E_SsK95@;e8BVp@b!Z$@u{6Q?q@z
zAe-fIfTD!djLE^1?bGcn(2~bnkd{a&XYxJ(Th);$34{MZ2Bn$8+XhFgA*W(*uE@9b
zn`jR(d3XXeRWK=1?0yH~<v(TDf-5ly0#Ec36)SlEi@lj9n@Fj<asfhGMLsjbw|{01
z>`fttVmD#6|5jbv8l7H3!|nkSXY*01C1G|2k06g$ZYsj-UhiGL&+_Md8m23Hgo2>t
zN)3u5H#xAn_0|iNusc+_^CiOQTS8P)MZDy9zr+yM+l=tYR2W;pBZ!Z<_jhn)<2&Fc
zaLW>xSG-0!`^24`U8+@{IK2J7V|AE_OO94y;(CcTCF8I<`BLPNNY0JY@GolvO9C^X
z3x<S>t9aN*t{~j-WkFg(|3nuM2}RXMV@-k}DKFwZEz#`M1w`_Pl)4o-i(|oDN+JX*
zVYj-lGv+<PBGp(<I3`=OKAS|HQb%JWITnMG@zyhK6h)`8r5P~qRWb*yd!h~J70CEV
zkcvd6#Kl-4BrwaNcroD?uX^I`*6eT}p($4{Q;XRmXD;!q^@rr0QGp40PK!r36Megv
zyhB=Q71ykeD0x>CZGk?$j1w2S4di9lvwGLW20p!tb5^)(fq<<(k3Q|z?B|mGQ+91R
z5QHG?MjKy<-v46T?tH8SCXoveV;n3_9}l%`;fA0lbJsvg`cD|WDcp?38}qf8ev0GZ
zh(EJu>KXt^6E^<5;?tAE4G9IFih+;wXAeNTA+0x6Ul(h9?r;NFn$=Jm<)xE7!OmAP
zD$>a(oW7L0d*5vmO-yW>+u}61&=rDkZ%Np#>cJu5J^<?CrUd8*n)Y{^W{$6wkTzVk
zSnlL=Z=m!{6rRP-KYWqibX)a^B-a1F7B&-GCyP^*mK@$1mG*^+!e(NlXXVC`*sDbn
zlMGTn<8DZ)se_zWMiq=;k28hGiTbcq;qZ!XA1Ic4rUTo^n=)w_Tn0+(@Ozwj<vSy9
z_6H4(e>4k_-=2XKI`KW*$Qz1nfct1o5%`q%kr*?l%~9k#i8OrD+|YJGlYCvUc`8}I
zQ!$wH-Rd1B`K|ClCmG6+WCs7xTFq;K6Y0QukV&MVQQ#_Kz$k%rpjJpAse@1=joKhV
zO9T3yKB)5Xv%W6e&-AK_F`n7k65z=M|6kSeBms7aP)pM<W#^UyAqYd!70m<zTiO4{
zrib~dRuZ}aB#KaO@8c<=><NXnIzGu5u%~B21RaMOpx>78r_&psgo3i8f-d&U^*{>C
ztcH7@8;BV-wbZdAkXlam^2qN+G{gXt>?mWxz=<+KZ{}NqpDjcRokrCGu-|_Tj!go2
z!1fy})(f!Ni+e`mt2uiT0W@puLj{g!P+tA>$+ics-nz$*PLV$Q03xAleq`2}w<kHj
zdQ29kbm&D9QqEL9KK7=8t{1*rhfndMSV$DCj!=RVx=gb$^t$KEbw1%@q>fS21g;e~
z?hDHY338^yf#C=xtxPBe`6Ll4ZAT)s9M(y0t|<dhfbL$eO$Ezx;BoU{K-{O)*>v^7
z#VFzRrjAiEkege9Z4aA5gP@7d;2Pt&6YD`e*(ho_I9no0T^*mqwswLYNDslmvX65o
zQ*$}+!z{s$d8<rpCw?&=P5jA@PVzbM9soAOoZ0T5@yC!vKg&@{K9#gip#?{8zPwa_
zi8x<%tP<voph@fmwW;sTc=;|IN{KS04X#|ahH>D392`H&t~SSl5QN?61w<LV|HYQR
z{jm~oGhCoCj-!0Ft$miR$aW$_{m*k{2(?VrBvCA_W4zB@CJ=#z2mxlX=Fvbl3U<MQ
zkLQONQ~Z)nvNU{?je=b;3{gE>1m&;ryB<#mI4HatK?@u$4t<#NPrVwza<Z~eNMnDT
z6*aZOFxVQv2SLC*8V31fL0x9@i=oUb>S@nSAM^V{Aq2Q`({Rqt{+>NJ_2q(U2{+8t
z%xKiDEzFpFgUjLD;14uCZ(`OfY^+uyz*awJo}O0|nH}IA$Cw!WlV3{Vi<IDodXAV3
z{=odiLms~;cFw?G-;~C&4d=gtKyPsVsptKNdR=SOFDLjHdDIS<(X_FRpCL?`OmIXz
zTxGb<=7X>sdoaVm)n*&t1deARDBYOkGLB7w1+oR=J}&etr6K-jtdYO`;3@}`E;nVh
zAs}ZQ%9Z~9psb1*xNsO1=^WlLVY2*<5cp~;x@B1myaODV+?d9MZGxdyROA^A;B&&n
z(|Xh?J*XUTtxbZ*Ws3Mi*|{W341!Q}N3UYQi2L8z<0KP_v04_;3~VF619xS&M6K)2
zgoIQiC+BsA38>3Pz=YzTr-ub)85r{^m`Vt;*+`h!AE<^=ue?}#ckVzuOT!v@Cgg@H
zx^lBv@H6+kZ8(-IjS*7-19ZyE#(%f8dxeMHf2+hiOyo=-N5X3c$fQ4-mBnth`aQ;+
zxxjJERLBkenb64#6_Lyt^uW9VS|2=>HqQko1~+ZMOim<y{eAaWuCn@g-m931bVkg?
zkM@*?C{{y$b`IDRlVmoKChEyyKiISCA6=7=wnL(mY~z{|PryCi6HrB|T0XV{B_4<Y
zHc?hVo<{|wQ}$rXPDy5IxQ0rE^v3wOhm&RVjF*OEIN7zaO+z1;?ibRvG}=PM<0iRl
zH@rRx1thFm=utCva`jpu9e2Q^rP&wMMSA675G>w@L*5_5F^$n=?F~gB&$1>WUJ`pN
zEg&XfJh)5xL?7Qo;)ZGPZN=mNPS?gg@$u2kk;E|su!|k*p3+mme`^(1ON75SWAabg
zwIy2!!murYEv4>%V>jXFo(Rs^4RjpTK1iDUmttxsP-p!*io_PMk#vE-=Q1!t|B!Jy
zhk_qly5Mlgx<qr(lG;I>&I*cb>4L*?B1X%``_pI1JhmjSkE`%Ew;1NVWC=C|wbbgk
zfN+H0E;`4Ku`T197mCmi)dXQ1KCk5%K|j}>&vjP<i+u8o8*L6{cu#8GR-i%W5bPVj
zFD5voGiv5O16x5=B$aGJK!C1vB);17#o7FRd7sKQF|^V~V^1oqe2V+}yvkPY$-yPo
z+RV0GS?Qu4bd#Gi?2>J1a}&&}lw#$ZkiL$v^i<i{ZC1J05y=uHV6=9IcRAZ(e6xbY
zWd6`i5^Wz16)_|CAcVRVqRI#$x+P9OVhjNnYMjq6D;Td~yKJxGXfblroFw)HTp8Y!
zYl7Oo%(R1oV!OX@Awh&GUzc8OqmdSW-~ng=m;bQz!o5+r60w3(<vio&hXss6?F=b#
zW4Tk)k{AEp{;5^&q(Z36-6s-z<AP;=IfvJ%`op1-H1bT``k$~YxxtqrZ1mGg^O8$4
h^Yh|U5=#>8xNP)O@^jKM^X#|)0{}^GTB}OX0{~%}`X2xQ

literal 0
HcmV?d00001

diff --git a/demo/undocumented/lift-drag/python/demo_lift-drag.py b/demo/undocumented/lift-drag/python/demo_lift-drag.py
new file mode 100644
index 0000000..bd52360
--- /dev/null
+++ b/demo/undocumented/lift-drag/python/demo_lift-drag.py
@@ -0,0 +1,64 @@
+"""This demo demonstrates how to compute functionals (or forms in
+general) over subsets of the mesh. The two functionals lift and
+drag are computed for the pressure field around a dolphin. Here, we
+use the pressure field obtained from solving the Stokes equations
+(see demo program in the sub directory
+src/demo/pde/stokes/taylor-hood).
+
+The calculation only includes the pressure contribution (not shear
+forces).
+"""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+# Modified by Garth N. Wells, 2009.
+#
+# First added:  2007-11-14
+# Last changed: 2008-12-27
+
+from dolfin import *
+
+# Read the mesh from file
+mesh =  Mesh("../dolfin_fine.xml.gz")
+
+# Create FunctionSpace for pressure field
+Vp = FunctionSpace(mesh, "CG", 1)
+p = Function(Vp, "../dolfin_fine_pressure.xml.gz")
+
+# Define sub domain for the dolphin
+class Fish(SubDomain):
+    def inside(self, x, on_boundary):
+        return x[0] > DOLFIN_EPS and x[0] < (1.0 - DOLFIN_EPS) and \
+               x[1] > DOLFIN_EPS and x[1] < (1.0 - DOLFIN_EPS)
+
+markers = FacetFunctionSizet(mesh, 1)
+Fish().mark(markers, 1);
+
+# Define functionals for drag and lift
+ds = ds[markers]
+n = FacetNormal(mesh)
+D = -p*n[0]*ds(1)
+L = p*n[1]*ds(1)
+
+# Assemble functionals over sub domain
+drag = assemble(D)
+lift = assemble(L)
+
+print "Lift: %f" % lift
+print "Drag: %f" % drag
diff --git a/demo/undocumented/mesh-quality/cpp/CMakeLists.txt b/demo/undocumented/mesh-quality/cpp/CMakeLists.txt
new file mode 100644
index 0000000..a1204c3
--- /dev/null
+++ b/demo/undocumented/mesh-quality/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_mesh-quality)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/mesh-quality/cpp/main.cpp b/demo/undocumented/mesh-quality/cpp/main.cpp
new file mode 100644
index 0000000..53eb661
--- /dev/null
+++ b/demo/undocumented/mesh-quality/cpp/main.cpp
@@ -0,0 +1,67 @@
+// Copyright (C) 2013 Jan Blechta
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-11-20
+// Last changed:
+//
+// This demo illustrates basic inspection of mesh quality.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  // The output needs to be deterministic so that it can be piped to python
+  parameters["std_out_all_processes"] = false;
+
+  // Read mesh from file
+  Mesh mesh("../dolfin_fine.xml.gz");
+
+  // Print minimal and maximal radius ratio
+  const std::pair<double, double> qminmax
+    = MeshQuality::radius_ratio_min_max(mesh);
+  if (dolfin::MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    std::cout << "# Minimal radius ratio: " << qminmax.first  << std::endl;
+    std::cout << "# Maximal radius ratio: " << qminmax.second << std::endl;
+    std::cout <<                                                 std::endl;
+  }
+
+  // Print matplotlib code for generation of histogram
+  const std::string hist = MeshQuality::radius_ratio_matplotlib_histogram(mesh);
+  if (dolfin::MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    std::cout << "# Execute following commands in python" << std::endl;
+    std::cout << "# to get histogram of radius ratios:"   << std::endl;
+    std::cout <<                                             std::endl;
+    std::cout << "# ------------------------------------" << std::endl;
+    std::cout << "# ------------------------------------" << std::endl;
+    std::cout << hist                                     << std::endl;
+    std::cout << "# ------------------------------------" << std::endl;
+    std::cout << "# ------------------------------------" << std::endl;
+    std::cout << "# or pass output of this program"       << std::endl;
+    std::cout << "# to python, i.e.:"                     << std::endl;
+    std::cout << "# $> ./demo_mesh-quality | python"      << std::endl;
+  }
+
+  // Show mesh
+  plot(mesh);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/mesh-quality/dolfin_fine.xml.gz b/demo/undocumented/mesh-quality/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/undocumented/mesh-quality/python/demo_mesh-quality.py b/demo/undocumented/mesh-quality/python/demo_mesh-quality.py
new file mode 100644
index 0000000..63c5f92
--- /dev/null
+++ b/demo/undocumented/mesh-quality/python/demo_mesh-quality.py
@@ -0,0 +1,42 @@
+"This demo illustrates basic inspection of mesh quality."
+
+# Copyright (C) 2013 Jan Blechta
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-11-19
+# Last changed:
+
+from dolfin import *
+
+# Read mesh from file
+mesh = Mesh("../dolfin_fine.xml.gz")
+
+# Print minimal and maximal radius ratio
+qmin, qmax = MeshQuality.radius_ratio_min_max(mesh)
+print 'Minimal radius ratio:', qmin
+print 'Maximal radius ratio:', qmax
+
+# Show histogram using matplotlib
+hist = MeshQuality.radius_ratio_matplotlib_histogram(mesh)
+hist = hist.replace('import pylab', 'import matplotlib\n    matplotlib.use(\'Agg\')\n    import pylab')
+hist = hist.replace('pylab.show()', 'pylab.savefig("mesh-quality.pdf")')
+print hist
+exec(hist)
+
+# Show mesh
+plot(mesh)
+interactive()
diff --git a/demo/undocumented/meshfunction-refinement/cpp/CMakeLists.txt b/demo/undocumented/meshfunction-refinement/cpp/CMakeLists.txt
new file mode 100644
index 0000000..83f2cfc
--- /dev/null
+++ b/demo/undocumented/meshfunction-refinement/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_meshfunction-refinement)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/meshfunction-refinement/cpp/main.cpp b/demo/undocumented/meshfunction-refinement/cpp/main.cpp
new file mode 100644
index 0000000..5566200
--- /dev/null
+++ b/demo/undocumented/meshfunction-refinement/cpp/main.cpp
@@ -0,0 +1,75 @@
+// Copyright (C) 2011 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Last changed: 2011-03-12
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  // Sub domain for right part of mesh
+  class Right : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] <= 0.5;
+    }
+  };
+
+  // Sub domain for inflow (right)
+  class Inflow : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] > 1.0 - DOLFIN_EPS && on_boundary;
+    }
+  };
+
+  UnitSquareMesh mesh(5, 5);
+
+  // Create MeshFunction over cells
+  MeshFunction<std::size_t> right_cells(mesh, mesh.topology().dim(), 0);
+  Right right;
+  right.mark(right_cells, 1);
+
+  // Create MeshFunction over facets
+  MeshFunction<std::size_t> inflow_facets(mesh, mesh.topology().dim() - 1, 0);
+  Inflow inflow;
+  inflow.mark(inflow_facets, 1);
+
+  // Mark cells for refinement
+  MeshFunction<bool> cell_markers(mesh, mesh.topology().dim(), false);
+  Point p(1.0, 0.0);
+  for (CellIterator c(mesh); !c.end(); ++c)
+  {
+    if (c->midpoint().distance(p) < 0.5)
+      cell_markers[*c] = true;
+  }
+
+  // Refine mesh
+  adapt(mesh, cell_markers);
+
+  // Adapt cell function to refined mesh
+  adapt(right_cells, mesh.child_shared_ptr());
+
+  // Adapt facet function to refined mesh
+  adapt(inflow_facets, mesh.child_shared_ptr());
+
+  return 0;
+}
diff --git a/demo/undocumented/mixed-poisson-sphere/python/demo_mixed-poisson-sphere.py b/demo/undocumented/mixed-poisson-sphere/python/demo_mixed-poisson-sphere.py
new file mode 100644
index 0000000..e2034f7
--- /dev/null
+++ b/demo/undocumented/mixed-poisson-sphere/python/demo_mixed-poisson-sphere.py
@@ -0,0 +1,76 @@
+"""This demo demonstrates how to solve a mixed Poisson type equation
+defined over a sphere (the surface of a ball in 3D) including how to
+create a cell_orientation map, needed for some forms defined over
+manifolds."""
+
+# Copyright (C) 2012 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-12-09
+# Last changed: 2012-12-09
+
+# Begin demo
+
+from dolfin import *
+import numpy
+
+# Read mesh
+mesh = Mesh("../sphere_16.xml.gz")
+
+# Define global normal
+global_normal = Expression(("x[0]", "x[1]", "x[2]"))
+mesh.init_cell_orientations(global_normal)
+
+# Define function spaces and basis functions
+V = FunctionSpace(mesh, "RT", 1)
+Q = FunctionSpace(mesh, "DG", 0)
+R = FunctionSpace(mesh, "R", 0)
+W = MixedFunctionSpace((V, Q, R))
+
+(sigma, u, r) = TrialFunctions(W)
+(tau, v, t) = TestFunctions(W)
+
+g = Expression("sin(0.5*pi*x[2])")
+
+# Define forms
+a = (inner(sigma, tau) + div(sigma)*v + div(tau)*u + r*v + t*u)*dx
+L = g*v*dx
+
+# Set PETSc MUMPS paramter (this is required to prevent a memory error
+# when using MUMPS LU solver, which is probably due to the Real
+# space).
+if has_petsc():
+    PETScOptions.set("mat_mumps_icntl_14", 40.0)
+
+# Solve problem
+w = Function(W)
+solve(a == L, w)
+(sigma, u, r) = w.split()
+
+# Plot CG1 representation of solutions
+sigma_cg = project(sigma, VectorFunctionSpace(mesh, "CG", 1))
+u_cg = project(u, FunctionSpace(mesh, "CG", 1))
+plot(sigma_cg, interactive=True)
+plot(u_cg)
+
+# Store solutions
+file = File("sigma.pvd")
+file << sigma
+file = File("u.pvd")
+file << u
+
+interactive()
diff --git a/demo/undocumented/mixed-poisson-sphere/sphere_16.xml.gz b/demo/undocumented/mixed-poisson-sphere/sphere_16.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..09ca59dbc7f5fa9b9029475e1750cc52f572391c
GIT binary patch
literal 34606
zcmV(uK<mFBiwFQB^h!|x1B8{^Zrex@MBnoj1m898p1ucG@+}LSNwlzK!x9!wzJ80k
z@+A@k$gqYpXS%w&`1t+v^=0^P`q*vWw(F4_jo-h0d3=6*`LWp!SljNt9{*X7zxMn0
zuMZDDrtRiw_x|zr@AR~9Zy!I$Z(oMt@pan$8lI+?m;LYeX+7>gHvepYzD(orym?)Z
za(D=j0kz*eO}k;Y`Gdz?`)TF0Hhm78?ep}x9%&r#y~?IaBBtro#U-W{^>O&U9-~nR
zcdx>)UCpq<<M0Qkwla<g5@yaG{kZb*7ZM*y)=VOLc(@RG`i10;%vj7ttrrJhNYS!b
zxRObQz`9N92a+|%)k<)b<C>z&lGFpgrf~)ySe6uCR-PHa+ylu0)LSSyBw|)Aly=+%
z&<dUQ$fQ{xHSKgERWlV64e#Dlf^L)aK;mX)VK~zXJ*B#msxkG{K7YDXoMb(aB7?}1
zOTs$yZIYd8q9E=R3YiRlmo*iRF%cE?gK1flmK$0-iz+?tko;`D;12g-Yfy^zD+)^<
z<_VpWqU2hX&YClnEi_5>+`_-1;*4TYToa}xg{`ls-jc-TqEW4xT&vPn<fdL8g4sy9
zjmjgcS|{n5st)5S=Tbl@SHNJXyz*=^prn~$B|8^aW#w&DovR}BLxYte1_tGVf=Y?Y
z;}RWKSB?v5B~7paChE8eoN))mmz)S!L`4x4!I`{ZL0h-fQcH9*udLn}GhMFGR|!LZ
zhjmH{O#SQ#oz27$<?2C<wz7$18c1;oU9zNO1S*M;Sh&y~)-fv}p)#UnPKzE=wkXSr
z&<ThbND-q&vrv>q!7EZJ6?aI-ut4@$D6ZG%PhXI%Wguf=Gz2b&H5a7p=&(8B5BJM^
zq+?ik!{j<L9dm+sI?w5WgigSd4F8ENNd_H=GGW6G?e7_ok72RW){%1X1opxnc6A_{
z=yUX-hsg*)jm2D{N8OkL<BdqUlNNl63u(n@Z3e1K@3ffVIlX1JXCYS+8@#9soppFc
z3w6i64CFYoIvN%5Ivj{sUtiWWXDY%z@tu%t!IJrfD0s)r`(|JKPk5OmISj&3^hRA8
z7{vWA)=v(0ltsec<&V&x_=)v04E(#XU5zmfbJb$)p0^7-tz&}0*p=;Epppd`q@u1<
z1h38ZK5W5S(pHkhZ!F9%3@s3Yks0G}ECp-iz-$Z7oLFeG=gNy{Hjzpf`<#nY_|iuF
z1!W+rJK+@GB*RP)*f##JSh}@^Y!D>w!~`hm!J=AVj9F492NC@oONC$@mf^kDA&AXx
zsO3<1ELIjcUiGHQ521zN{i>^Oi?|X=-x|1DJA{_`-WCULi@;KYyi%bEW=R3_zm!;=
zilAa!Xdef7Z00Ley9rO;Qp*VVp%jc(u(;GKoM>+p7c1oqIl`sLt7uO_{0i0Y9;hi0
z#app9G+itgJDr(Z%)kV-adOvTj!R?v;ip}V+nxw?j>k$I6KGy|(X&=eOqDv*Kb(-J
zg#eOHWX(81&F#7QDF@7<T8lT^Axz?9JvN+N^WyICb#+pK><k@t;Ck$K+ZP6{fn%V@
z@kXNLD4M>GebvDau0y1B;uwR@dg{?@LxFQu88m8ZN`b;bkoF>SLv{ArWRxBaCD<We
z(ti)-vXP7wG48+yg*vpBrkIpvA+gety_iKH1H6$1&Yp$puqxNRDsl9Szr(ex{MDEm
z&yb0o`f5X@)QkC-IwPZ5C1D~53A=49tbn^PbY<M+s=f0%Mdy7bnIo%WAwWvx)%Y>w
zLuk3*%`=ex$j;iZhw@0kf0{ct1l^hVicWi&k@TlAaf1ZgX|DEQ(LE=c%G4rqA1wAo
zQHh>84Kt!RZYMe&w$t9|CNtWB8~w)W$e1?{!KKSaFIbwdNwnP|sMXLiUYi_%Q(Q03
zdzD|YUXFobkon4==o8dPsZWy2)UgcOU_MAI7L?(sHFKl+n0~PS2{9KV!9f^?w#3I^
zDDAr6CqlAj=4NRi24YK3{(mjsJ<o>#I|dn)Yyk*q0MrywAUa}ZsR!dX3@!7UDmT;k
z-+KNL4L}k+7eru#wA2x`5T7nAlp$Mb(TvqcXd1820n;rMf3ajxfoX-EC%!u)W$+<f
z)7Miy(flb!HWFpysj!EH;}VP0+Z$NYRMb+|?xP;VJoK(p>_=4SU#$X~qB2AyTY>hX
zQI_9(5!n^b=x*3#9`~9AW`=gisfVWs*0A_ocjKomLjJ2(*?B*Av=D}Lv@IP7&p($N
zBSdu`oc648gp!b<lJ4aRKg!4;7m;Kj*>kpUTLN%%Y8tbM3`fZOYw3`cRkEy$9C;~a
zd$&+<cPuYudbfvM$J}{dgv1eesT6Mo=%Up0gsbx}O=xWo^5jQV;%5ewdoMvVlDd;<
zlDS&VK?{c>OOZSQ8HN*GO7%Tk2t0S{pav+}kHAkBNeWfQ&00IWi}NYTW)*Y0K(+Zh
z$8P8@b4jR<Kw}D#?n6r@_#@fxwfI^1w+^6<1Y>zAwHFzv8e=jQe`xkrVqis-@EUDy
zFcv$kivw~l=UN@;x$I1AzO_Vt2nHvmlz9NPF4oPC`41F0bOunUHJT;)T2D7iZd)>B
zP;?*RRMOCD3=4D%007^UPx^T;Vi=_gZG|A-?4;%0g`^l#5U<X~K&1#!rtq_bQkg8e
z$zZUV`88c7U7oO&T}o`MB`R%(7Dg<j2;MF`WEA3l29^X!X{1_UuaqtX+UjmXbk3!@
z9bx!B_-|!d+OlcuX>ew3kwCR~<xOF0K<LIa&ECdf?v-z8CEU(y1StA~m`HEapCz}j
z_*5#&xU{mT*=3Gf`$9kHnK*w}`p*^z*|qVsm1z4X{i{}iKa;t(8KwC7w|)pS*W3tV
z5C-3<$`g|NU#y>}lPysz@q49Z!o%3+Z!9}a*aaD5q0|f(co7X|K>S%y$<Vg&E;_eA
zpQlQf1T*I08IyV;w5EEouix3~lndk%*<pls>p|KviKsL{l6P;<GPvFz1T1LkLSKs%
z&Oksx36i&A8O1%w@bx8wKrTiXWMnuvk1`=YY;I{*DA^p5>N?_lu%|2QFc|Mr3#eky
zrP5KU@owc^k7VK5-NxWovx~t)b6FESiEfDuo@r!fA(&x|4eFY7h1Fw5HWL*m^F<UR
zk{N_DS(QaCX=+z2B$|9}ZMBwV(2kD*1)DM}poFL>kFj)TfPBEI_85Ccz>vplio;l@
z*klJV`huko2L~C;=-kOIucGcYMbph9Vz3ucgW}^;=bR+g;TRP`4SXX)s(m{5Cl(K-
z_zQl<=j=-#vpr=LL03^jGhu`_Ke1?YazssJBF9(|8U_od{v5n6-)X>PlvwB_-<j3x
zMGTYVW>l0Zs9M-1bbx9BbwYu-R9rMOpj>k8MRs?3nDJxLpn?axrw$qT78;SC*k!b+
zyp93k2p$azLOCRnORicHYn^wogQ1dODB&*Y-$9{5F_);0u9P8`3Are9>0+XZ;<Ej+
zYO*BMl_|7)1YL&cap>5PMa(<G2Fq%(dj_*Y$fOOuysa^mI9Ve!wH1q@{9%JAVX*Qu
zc~2<X94OR%vdxi(s_(1dTN}KQw%ZX4wb6d?g5|CTSaEI14B(}@dW@1ZhPQK>X|Br)
zY(lrW;N8iQ-tYl_=Z~AW78`@1Q&OoFD>-Ql?<W?E6;eXx5t8OtW6b_QhK>vDc@GUQ
ztcD`<ETn6u7JQso<ZcOVWX11&l?xeJL3yI-(ow@5L#7o>W63!!{ty5BCe+Mw8;M~c
zdZU4MQTM;tyi&VmDnLRY$d6%D8_8OD#p*AO1i&w&w$Z5g@|DQ)h(zqDLuT2_Y83Wv
zdNqlnU4w=^PtgEs!Q8;E<QIqNJre_YN;Ru>JB5xOb9%H@xkx4?7sQ%xtdaE22Gy;J
zU0-?z$Y4OXDF2ZE>Gnk%m+l05U8HpWyYNnX?~8R)RryEfZ9bFxKfTP!y2VYhdmAu6
zC|`jg(SuTrF#KF^^OC^CGP!%ITlYv!E*b~KjgaKUTZEEJ*7h$s_7WVSr4N1rT7n}5
zlPLp^nJ5|Pp<E_qt4K-qZrZ5Zd!uvlbc0uD`BR_x8E7Qvxp6nQ_nw8w;NwknY<OuL
zP(uUCB9ma@072PT12xXDJ{G$VH8f&EZKdH#gQ$L265?dQ>I`$#B<=NBA(6Fgk+I10
zxvH-4B><E{PiGr06s^B&E@Vlvj(Ul;PbdzFY9<YDNxHsXAZ<&t7@0nOw1+2)Rcv`r
z@;_*xL8#-HfFp&2q_yTXE_IyjCFl4A=-Afq3IiFhNdysSI%u@7Q!=>sBu$-`vJP_D
zbfL(4U~5Zq(D)J))lbb<R1+Q3cuNrL;Ec4VdqAR{G-{WnD|pHo&#f<Q1YN%}jVvTO
zvIbQmjloXM04x-F)s1@NX)Cy3$Ry%JGVct^JQ@S=&TMgw@>;?~J`yN&0Wieb172ro
zE*8o5q>s#0*Csg)TI3RW7i23dh_%wYFHIl8e_?r)JM&yfl90qMZZzj{?MpHTKvKgd
zr9@R@of)py_iO>{qlns-VALia#cWW<(miXS)eOn-Sq7|lUJ$Gt_YRaH|3qsY`O;f?
z6Z|P@Sw*^(8h~(-v@>RE2M+xjte#+CC*DPeDs$ESg1m}GbE6J%XqPL*W$_h_Sb?s~
z&z=1z)Xb79gn=l!BP$6R_rEdEfd@8LX?`s=1bVpB@5AcN$lXxPQUE2uc3!o8l|98t
zx2tJY=~AHN>@G*wG6@F&-yGFG;84ek!3KQEj`K&|wcP5dEwd62fPUoUAiF~XuMxII
z*Q?*?x~hU7hRxoPmp7QD|IK&_pl(G{PUmr<q_;bFgJX?b7Sc!WO(l-^SYP>!Lt)f?
zO~233%w5-9A?Xk*x1BY<9vu`w+w^xjs6EDM>>}Y4KP-oQu0?OWm(zZjLqNY-m1{i%
zQAg7}7woVdHLhjgpJFVxrL9xkDwV&PYiJ^YNI&KDccLpjERRV9(_rFJ^tHY<DEN`G
z>R~Cq=&Ko*0n~SP<hjdqrCZxD1!jL`+1@%{=85y4+R>3up}&B6UYd{PGF_)2TmC!i
z4s|JKGBk`}{yhCviS(;O2o&Jkim2CkP&qMW66Wmgb=xPJ$gJ6J(4-tM=D>_snid2&
zCBj(@LG1~CpU&JxPaq|q4iot|kltiw&-lUmmwdKf)h%^+&8S7u4BZoxs=HuZy2TAg
zbx~k9I}maPLWBjwbDj?&(~O7FdAviKfgLw?q76@UJ3|alULi=P&tJ&5q{)6}Y%o+(
zunbS>Ad8H2o7GHrhdoS1b>C0$F{56HG#g5#B3H}x#Z;#I{FJ|-M|15Cn?E7VR!*;M
zfCkoh6(i`3EBJ3I|5zYwwo4?+hLU$tvb3H&o)O5Jx?8`m99w#UbD8s|qA8a4GB;pn
zJc_~9a;cU7wb>^VN*Q!2yLDAx)z*-CQJJBVs+^=m;88U5Aw+c=&EBe&IX|HdniYu4
zAg(D6{QhOMOSMg_cf{>n&w!1p6rD{y?mk(*trQ?po)A^avCUM%z09vWq;%}^=+P@b
zYv$x0)cvRMzX>;kB*{S-2>xipU<301Kem}no0bnVoHu4^8-c1y=|9$5&<0I&NP<KY
z<a<pIt9Xhq-t0avuvRL07^_~2xb2fIY(v(%IKB2amRH~8Hb>pd5qGc7ui&o#OfsE1
z4~}Ttshm<4xM3|;1P*6y#M$yW>y=AZsAq_5CNFU+?{6A+N0&Ok-L2La3Lw?Yjn4&i
z)(3L=;mYKX4gW?+b|v}IZJqqaOCx`5pKPod;%H7fW7?iHhjlVxkVvajn51&FD`8HR
zZfeE-bH&4KQd9ihj1$*43y%u+1<^q`_8HByKu-A)!Fs<A*dDV75Y=Mx-h-Fo6f|dU
zj&O`Z1QMg&FHWSZw7ChmV`G;Kl)9YD{6fRQhU;Y&SB&vboNLTcLk8H*v^zdWU81qs
zg5KquyCGTxPcZD|db3!L=Q+S^opt`LeNoFP#qgRf`q-|vl2T!ouC5IM;_NoDNk#{4
z`kH!wOJDDe&2JJ5(YDE3`GBHw2Iv{iY?-3$dM&0dJZ*UM6PlC&cOKLe!EW-m+qJGW
zxg6o#gI~(Nq)oF7R5X|*)96}WgG;k%ik}savVDmU#Bt#MDe=jKj`S(T<t*=>m%36u
zvUfS8Z29Lfp^BZ1`=FwIYEVggUG$l@i~hp9<y7$B4(GC|N!vEPIt<=p?9SK+6~)NW
z_KQQlu;;c6rBarvd$!CEW0G|#j<~r^sr$0%j^CGhSWzsMjPrd6KqnzQggfqe4yKSl
zQc4<ZBBkr}`D*(Y_)KIC!jx$U%~r=d52Lw-_(?l@mWvo+sd6q*j*02f?n{b?7Ck4<
za;q6}4(*+j7K3#YM?^+TF`w!Z8)`m{YunZPhZZ$XHie|nc!HX44R#9|+=oaYTCrX^
zQ8c2ZpZ_P^T(TpEK_GaeJYk{V{V$d-%~*q0?2{*ZjG%#PQ(39$HLkC3ZBJGnvLT51
z2w!X4kS5!%?JbHEMbZnIp30sv*j8WX8u%D#+{V;h83EyF+p{tC6^Gk%c@CCDD)aX3
za4I7S!Y?aY^>3X)IH~ZOPc7Y5B|07f-r`yr=>t3PQSq){xn)Nk#i7`h<f}fxt6ID2
z7yV$Pvvxr2%S^$I#P_DZDA_X1>M^jf3!5-QQ}Q#aDPDS!ye7l)CmNM7U`dZC&FC`g
zd#9glyzi!#9Hk9Qq;9Ci`lU_<GIef5dD(SZhd<XfYk<gEZT<qInEez7jpphBRJs5a
zRhZs(VO#6Gz~{6H8(A3XBK*?GUoU!tlS<LRUT@Y&SxjautAfcG(}RnA*bpbi6^wJ1
zso)nH#eYIN#A>2+71sn3Km!#pF}qaro6DMjH&25>Hp|}4kDG0g>aiNAN%7g^K;2;I
zz^^DJ7b=ZEhXo;xprs-C<wjv|l{wh6C_OSjj0lcW6%$xMY6}^kV3k-w^x^;Tmi~^v
z-eq9PQY=dg*L(7;qJwcsc}W*;h4O;QmuT(4oV{jeoz8_8)$uPBY^Wnn?~#Zgma1ho
zVi(Qs11wXQ4H_dm>tvD5R_kkFO+Dgs>kd~{T<quiET4Vq^F2$7Lv5PgOdXkLkfr&t
zs66W8`g|NxXxP=UZ^u#}J|U38OsD?YKqgRrRM{;(?AY2Q9n_-^Xe)MJ5m-U@C{HL1
zA=xaF*`!p3lb)omG+({^Xd^pfcvWy0c>nljfTaUqMTN^f9tO1sf-Aiv(U7GpKZ8?{
zv&|Q%2Pyq(Y>8|b%f(!;`(@<pFp=D~-1Kej2c6@sGKMLtqqBq?{n<<CSJvZ~{!hr6
zB}Wj#F!V+#mS#IzZXZ1cX!9}g0cNN+U`w{db)yUO5i!)#%A$<_m9!-xWn)UfGls6N
z9KY`G2OcA($Efu55p3U7hclIreV`>5E|!x$K=rv}f-iy-mexkHdIQ#Aq_h`WM@C#d
zGGz!Yc|F=CB1M}rEp&<^WxgjPSZ$1*@h7rx)v6$-wF$SGzRo|2TSdw=83~V0zao;2
z{k!8(#!Ll~7K^>s8lBEj(eVh?lkmlIEU{DQM*p+HC5l-~sX<#vGZ;U@u>IhSY?0ze
zi_=TMTSb}>)iUTvV|FyJF(dLaz?~4+H5Vpp>x*H~3guJXQ{VQ7A%I|@SuuBHYcEoc
z7uv#Oi=z3Gxhr4OzbZJLy6-FQXEFNXz$#2h*Ow`~Ds4>ZiWa>L5Xv1DNBo@Q`^RG(
ztrn=S6g(**S==3{+>kXT=wPOC$no&j3j_g@s!M6>mUskU2iBsTmBKCg%d=OhqoXR&
z?T)clB)0lRuBXC%Un?%)t?DeILpUDtx9!i;oK1*~`a9rT9xYu3(ET%UtyeSa?wRUJ
zR-hO?mh+0jOo>&T1+O%!v5~L+Vx%sVSae84Iy^+R<fIRgLUAkL0p+w$5nx#m7(^7o
zMZd?w<)f>|>lQs)Tlc6|2@4ZZ5-CS_eP`b(k<!176W!fUPpT+9YLa4iN!gN<vR}N^
z(edG8O}#Za96&7v{kP-=6`ByUt`=64=0fher?m<p?KSO|>Z9%SsXAxEi$|){VY!MJ
z<YR`OJ@Cr&5|k!H@;V+>-!SKIb}@|hN=TIEcRID&_Z_FYqAyMmv-?iK8Q2Pn1)d4e
zy{5%tQBH+IpuJ1^wTsO%1`VD432nl$5`JIob*>=VqL(d5mbw|RkDvZW$eA2D48uS$
zBNy)@|HM3vl4$VZLI7)8YlygdX3?{=x>A?uCZ?0|y%Oz)lw@NN<je;urBPL6D+7X~
zA=tj2Op#-xqRHpHOdIM&wPiIkh}DDj@O(A(YPi%Rne{;L>l)~oagA;j)B|H&qu>sV
zGJx1<8>47^!BV!3ivdf80j?!E6&el*+q6bjo?e-ZtO>kWu_p)*JL6KdV!PSS9ty{s
zepGYwA!U_b+<%ckZ5XB$61%=<6d?0AFU=^Ts<{R1eyMU7dQm0LM%Q`i>rk*LR=cfr
zBUCXzY$+J)uo<`hY!uIJ58buw1$7%GuufkrwuCI0l9thFih}VJ9}RN?<;_em?CYhr
zWs5TK#!|%Z<hpHXCZnK?`Xzj_Lwvw!4GIt}BmDH9DI#3PgiT`V=J^3-h>oe$?lHZU
zU%XUNj2%a{q|Y?=+PNfHJN=x{{bl&c^Tv9C46Xt?!h!RAs}G17S_9P{s%boL*YG16
za52iAUXEtn8cZ^DSv^bf|5hXEi4S!rxl|L1pq=-70@5=G+*ASJXyEa|p-Ig*j0OYp
z=%}M*QR_iUVr`z2FW`u1NQ*+>;)0{2wV@n9yg}I&9d#@@P*^B(kuQ(#UuT+U-F^D%
zHa$A+`uLc&6RkV|ckI<tUjhS2ys?Akle4dZ)#Yy9F-6AmMkD)!hYtef&XT4_QMgXm
zLTiNgN719@>8JNhqVd3CAKTkizoo+JkM(ZpBfNmu5x+Gi*6emvW7Oom9tNBc2;uDG
zAob7UZ_*}Wr?zW|zvcDw<tXOSrUzhh-rQjT|N6ZqURbGIhb?TFu)R^qb(rt}hrR0-
zv(`ask6>Y3qACisRn^xbBy<!Zwm}$Ip{Sg*<?yU`SF2MqIFJdPQ~ok?W=WF6AP~J#
zhlI6WZB9S=sInS;(Fbtg1tTDrONxQqXL-ZhW{GG4vU2u6?IWnoV(k-4bHYM=w%WDC
zRBs3U0+$+9m16O^Fwua%!d7^vB&U76d|<$tIe>Qwoz(v*H`R}5rdcC;wy3ZbJuKQ|
z+;!3ebH9aSDcyIWA~FnLEBu0zMNI=Ti06VqFkZnT4{}$_+ym;DV#;OC+v@ZfGl<~U
z4-^UIJlnN3;_nO*i2k9%t?ezN5!RPsY5;3{lOZ(s7n%tjz!3o^sIb0Yv_(kf-0E(m
zJLi4ud=|cgz`DBs8I~)^1qS;|Sd(^~ApU*GEiBUqv!CY7^n1Niiz;b_yjL&-=r<`%
z1y=F(B3Y@&Lq%nBGkJF1U(d9d^-xT4P3)TBK>nh{WVyCuBgMs<sa<@5;e&3az_mZb
zn%`L7jgsyLxKl#)ePEq~V`Co`3!)}<;y}gM0cL4Ox_{Rlvnl0U)%(C!=hDuoJQVn0
z9Z~buOHur>*&4obOuyJ$IdG7CIK@!3gg=b5adDcLuQ4y%z~Lr!A1KB$POz1?;{eiJ
zUh-Ud8CU6e9z6qd2N*(e@N<+4;J~nmOk>qx&86?>+OQUUM*zX_2J_{1yHuta-|4;5
z&?#+3=44^ztV%bK4s=T@LDbLM4+|G}{J_%a+S?m2Aw0qdZbD|mRE`u5O$J^&AeT0y
zWfmvKa3dbgnf^!Eflxn{qvD~N?JuqTO5t?d&7nV2Wxw=J9qBYPWOu1T2!=rn;Pt};
zw)BhjH&}6_$A%f@T%k@OH9&=2Q8xFlBJ&M~RBWJbfgM>^7VPDiR!9^Z)_ApuAZa$L
zt-6J((y`TxJgZ*>M>#ccbmM7y9K%r^5p(?~<lJ%`2w@<2CEg78zu3AufiaO*{*EFv
z31dvVyORDi7%pBn>h>cc$&q`@J~TGT)oO-?UJ$PJhT$l_9ezu-RfjjD!71dC;oZ0a
zqaE9Y)D4XQ3CeJHoM6j@1_Lk{;coduEOS{ITsx7ReIsDoLaIG}rxrqd^G@F5;I`wV
z!0M=uw8y+Yp)*oDkT`wmSd%l4hIE3Wh}O!-#SM;#gw=y7#^Yj`!1cxm4jRr?rW)65
z2o-j>j8L@YAV={I;^ntLdfqrI`D6f~6aX7PT9`(5cBo4&h}POtDI?a-T{~BMllmPR
zUjP6&UdY&Ao8F#ul4l{z8);$X>n^3DSHRGCA_<OP-EYIw)EIR#&iA@X{lqbu3uB3h
z7TaxymGlf87_(HnVN9hfXUrMhhHHPdn0*UOqwE*qVjJ-Tn0m?rrqS4CWW{H;7&+KG
zTkmGTw#USfx0n@#`(rbHID4(SY1YzQcI=~cOz8{tNuDaLHlYGxwQC<Zig2;x^AO7_
zrI8ZT0Ph51(@fE72_4=lA9og}EW{k+CtJr<f`N%l38~omlDY9+*e6ALoV{(yZ~cM$
zHEYK8=28FWbRMyk2?h>-9A?k-L>&5&lGJUJFY$}nu7|a1#SIKgRD-v<6ePM;-zsMV
z22L+2DvDO<Wp3Y5hi`!30v@uIupM~4rQ`yzM`g6-tEp08j*Pf%?~6g&1ZJ#NEQlxG
zjoVxL0929K(Fn3MZ(mu&O|UcLsvei~Ua~}&8={Bk>{8m%r*wpXb{@Whh?bb@2MIl@
zFCc?Pk{f(uE?FbPV)>d&c`k-(*bceDc#07{$$IEpp%uOGai(L9`KSF7)}@bdtv|xf
zEVp482BJ4AwAhk(|BH1Vy@V_p=(|9L)(J@sXP(;|Z=nmT&%&tt<H`ZdH<$}+iM2|1
zZn~(s-P+ccL)xBI3)B?H&=Q)l)X9)JDu$dw#5*GC^@)ekV1Pxo&E<BNBBKxX&Wjmi
z2Gf>`il?7dk1$(?-lG4lnt=YUNnmvwMryaa)NoU~F6bnVY+O;>fM)E0<r1D2?UdBK
zW^MJ_t(@5UBX*qT3?8+6jYcIpjj&`b0#=%VTPRYf(=f0J6O_-D@cU8qK1$OoKKBkk
za*dRK*5_X%iNm4V#To9enYyBkOb4{|&GM-AH%@zyZq-EyvgA0DqmR9^3Y5w^_LUU(
zgXO}`iHxyr2gUy8X^|{}GNb8^aAol>VBq-*V||Jx16xsJfZ}a@RJW%cZ*J1<VY;qN
zOhAe64{?&-fo;pyO#D~}li0j!_t>5GB;yEMdX`naEQ-MPLs5oD$rG(-bXBX3n(7)T
z#q->ycUyl72lJACoA<vtQg`;eza|A1nr93$V$)$DZNM(-_NZs<(9=S-C>py<EF5gU
ze0_xowT_Y;@N9HD7-*)*-M9Irk;21etxyo`SA6G)YEuVQ2SDAjw4xsXj2{5R)>ag_
zt)+0TYK2m)+dpiYFmkXk01T~1r8zS7O2fI0KVNf#ZO=MNFwIsRqWW;p^g<ABpL`q8
zJlGGUWeyO?4$A=5c7Iy^Y=dj}ri?4GC;PE#EJ+sRiGF4pBsg3|b|Pon<bQjdrTqsl
z2`sBR-8PrrYf-@F7Ux|Yc~Ql?LNwpwzdXiH1a7yrlx#Wz1NLg}AgNaAE5~$vG&CYh
z_sr|=L?QmXM&|oj&$WffKc>S9PAX@v^(VJ08wrdkDmepT%Mo9loZ$aw{StO2#tp+T
z5NwGb`1Idcu#iZB<H?|a3@yh3@!T!Gvv$>zjh9_9ECNcrO7+LlPynCQbTc)%UvWT!
z$Bg*<hf7)+L-NzWGA`vR)nQODjvz_60x-Ij25$k;#SEWo>?H<(g7quqkB>0#QA8S*
zA0j}SmzX5;YO=~f5G1F_zFXQ}n4ouNL$pcKGF>iUjW-Rmr1VVB$L(FfhY!UZM@INu
zJMR#~J?eF7?b6}SY6&SPAq+xp^3R3+s6P&sDUmw2$RQ2t%{vM`R;-}c3$_3&>fN@8
zAToSL%28Otv+W0payQux57V5ZU8;=8FV<zF4qQNVGy$pWYB&#TqeGj^5)=Q=fR;Db
za1*>VH?09A5a6(C=5=p|!%PNI1Q?n`e#!C*OFI@<jj{A0*q!hNd`yMp#rgnPXP0yA
zpw;1Nshk-gMegn*+mYXGqt&d|X!D2?Hb7yAdw??!4)26uO??)%)G}yv_%+JWDGnIY
ztju^BU}aYk%#^e~(%|<}6wg^kj9Lu)Xy8Xd@s*Y`VU`6L-ne7SS7Hwvl7ChzUX_3`
zQ*5w6g;658eUZI7LG+T%;OUqXO&>e--Ll;s6HB2>-8zGPV4@3$Wr{}XMLuB%(p8pM
zHSV!;bvr0Z&=!x6PkTU=Hn|t;_C*Pm95X(RFo=_U*qpBEVmF^8b4+@HK2Xu(qwr|3
zq{B<>)s=!G8MdFrybkkc7nuRQ$m4vtANDx_HbN^peCq!XJKc_iF#*pmor`=?c{NCB
zohv5b9@!t(klnG8teP?;I_z{ilC43pl}1{7Wv{Rk<NTl>q&w#eGIlgT9b$t|kMtd-
zA88m{HIO|fu&(_|2DCcX1Shc;Pk$?3Dy|u+V5-okuKs=gW9(jXTZdsN3~%XLk|lfp
z8>>F1cBnz2JL#Z6AjGk0KF<01$6>ED4A^7_j+=O5VTi#31cA@Ku$pan=zJ_^LFV66
z>`H&Jga1sr7#1(fxYA|3>}5Ej8^VWlERCGOx={-4imu4+wEmqUo#Ec^0Y}a*VGt!M
zP=l~L2?l~XYA#|R@gGB^hgLc)Ae(755$?S8k~#qt{Rrnggh*~-w$JZ8U#GF6XgibW
zPs@XS2GKJZ)}`knDJc4u<%EuWX@+rH&WfA=W8ZY{k1(u5quH})D3HDumm{0Lzc6wO
zUc*O3ZFT6_&Ln=7rFJ0+1@zgmHzSv{u(M1Om=|Tushav@M5pxL4ZF+uLc}g9a~-@3
z<;=SD85|I}4yyIc+Ejj=HrvdX(OJG-@xKo%uM4SZMJjDIXY$nVjvNR*jh26@{{Rr@
z3mp)YHe`2Led8kWRCOO-ykmK?UU77qq2@w5L`R#csn$j4UACS3M_4-ZBaaCcI%w3H
zwP;>tE^kau$1>XSbI#bIEpybmy^QBeA8wV0bVd(KnMDn(5i%bJLXMX6MY(CaLX=MH
zyiEwklY8Jn+f{JW(3k8&>Ys%vY=;DWi-!@(JP040o!hJUBp;tuPh?GqP<J}ZJHMW2
z(K8IMDtP9!2q0mi*sh3r9dX0Jb=Kn)PCW%hN)F}-zVw50GT$Bt@HiRmi2mK~u-6es
z=xLZ?Ds;E9Xa;QmyWut4Sr&Ygs&qbsOs9R{biSVOQEk(>n4NvREWW~63<}x<Otk=&
zy8kjSXb0`WVj`DHXDloM_-pwr(<Q*`I|wC<!RoTuu<%Wed%HjES6M0<Q<$3j%G7gD
ztc>ts+qE*&;ALy5ucQBSv>(FGEn8v`1cF;q;sf`;u}g6i2fkRq9499c1)6F|AJtOd
zM7}zThWuzR2`39IesH0b*-`r>*fF&vh@#AdRKQ5lFKOYJZ@4L0TC%eGQc2R(uQ=lw
ziPV7aDzZ0k?^a9A+g_x%qP%6U)`>u2{~qgx$qao@4s6RpAvpMlY^VG%t{~leC_c-K
zPeYuo;&O&R#z6h?L}<CX^99S<F;H0?iCzE@W`A7zaNN<J?)HceEV=Wx>6r;Mi@Z<S
z=Q=9Zq39KdxpkaVT;!EI$fbC=X^;I4L^Lr$>KMRM!`Y~7s&J?`Y5-MVj?zM*mw?fh
zvK+s;ZE}V9!q7u9rgwZ|p>&sP--Fpsp%pvaPIV>@o0|_i8<t*0lnyp~u#K95T3V~N
z@|Beeg9y}5)S0Y_@J$!ufN>7k^>^O%foKbqTS}U^9Qom26*U=hsCF{C+}XK|XdK{q
zNxL$j6DweFcV(znyXr8|z|Nnv%{ek_9`7r{iACQzHMP~@+Hmp-u>VTeFXzWSZuTp|
zvQFDfSU?Ku_^c{wx;(*1$Ak$b>JU0BtHW1YYWsF_kFkhNk{=hdO9DcC`!-;&pVo6!
zoQOgQa%=8tt*>0l-D|qMoEB6v2e7SWp>lV!lYgn=EwB8~0HWNrFSg8}&)22x^8Y0w
zNxw4p*J{R@p$IR6_~vaC*v7QYN0|`5U$xk^q~^&i3X@~nPqP_;FokAsu7N;Vx6KHK
zjUd*<RV=HDAm``)HZX*C$H-@&SmNG<F=BIfw}oKpJs}EHq{54)>JmKd29N<97<*sY
zZ3U?e4G><~@SFG!gIqq{NE7CG9(~HS`UN#u9=6m^668(sx{a;(fFwW#F(BXm2s;Dh
z2tp7Den~`D{r|^ev(dw=N_ardY;L3A3_Uc~gs1@JlvdKUPSb+HdHv$T$i3Oc;C65{
z3B-)s$1yHQ^F-b?k4zZZT3czsO~1bV20*&Y&1G$%73=VmxYRH5CejkIs#CJ03N2e|
z=^g~W>QROXZo4NpIUbnK?qXky!E6I@1d*|4i`hx;QJ?#V-xiCv>JgO>^#|1caw8+r
z<1th>;EU;B@%hyWDl#bWtI5w@QXC2q$~xh25j>BzP&%DGCD+K;+FFYdE<`9!_kXDC
z@(ry5dlfxl*nuCvd>h{Kkvb+>EbG|Uz=#o$0BK#P+?oVHIdh=?&?}e?wg|?nA>Qa@
z4>nH}4Ce<Kid?~2wA`D!OAX^5toBe;Q7@B8fQ_eQCyUB~ALG1&%Sxu_b4Rmb+h$5a
z7;|pd1$Sd$so;-%3x$8zIu{;TU#Y_orD9P9;Mg#!bWiaPrde@H)T&uKGea%gepNO@
z3^@(n)<nja>;6*MI6Pu;Uib+?HxrdNWBJLSYnw|4t`{ZK-ir2XEhg4lbrQG6yfj1@
zpd}>SuJ+9`vXRQ6h>;jO)@KP#&(&hCt+m4ECpJg>S4{d~9E-+a6%d*|nSBO8aT6Kx
zZ`CJK-?}@pZ1|{Qc<onxjNSyrqXaGJ@3pqY15{yih|2ofhTY)2`40XQ)m0-5zB7+y
zKH`PjAY1Fqv<UN#MLe2Ut|$&{K|0{mJReQ!wc9Ikm<_;4DVa-A<**0e%H7tXUP_M>
z-JNQ5or}yvYH+|~Y9Y&a9p$JxS%IUnbDenCd|c4{g^UW)z~MJhA7=^I=p>l>SUKZZ
z@D8&)=WPyqa4KWUqTn79G&t~kY*MSET|1wD;16MEk|aS0LeVR!sObGK);_v4Va2v0
zGAc&}{&eYe6G0=bQO`LL((a(c=x$2J9ayrro)}mS6Ff!<Q@o!o92eMW@as}<RB1PE
z7NiCh?X;+<;QIqGhfF}N8t~FIc%*{31cgENTC~@#V8;c^$4<U|d9%ZUvDhlfhu$Ud
zw$U9i<N%l6BYj#=%reanoz?^Y?c!SJbD6ZrjVKGLG1S3Mj(AqsWZ4SUF1G`rIp#EY
zC+V*4!U#8677mQfRNz|_(x&m91wP0;M5TQxEf_ML54K_ytKUojkef*hx_sJ_?%u=m
zgkb<H<w4u&%b}MlU~B-4NuekOEg=RMXC(mw7&YJ!{JfEHLH)@17Se8lB#Lni<Uu4?
z*eQwm1amx3|D1aX5-ylR9fk5aSkvp;*NTS{6wx-CUG>$*WZJciGBU!8*csNJofUt8
zjYo18&Hg$SV|Ku87sxB>zOZF0!$c(nL(tbz7U)(XJneiqCGzTxT8h~KlKAVN7&Dy0
zUd?>BOAG#F<ldRTJrRi6+)}=T`-u~;k}u!AQ4_c`bE31mF|6^T4>fdl&;<ggrtO1#
z1qai@&Vr+525B&#4?|zXl5>5g%8LwU_*32N97g)Y`tP~`=(+z;q}uQ*o&U6@xv{L3
z@~Pk~dPXrPI`{azTG>MX_@o%t?n+5{E^r3c;3D|8@Gaoe8ul-R=hBIT9lfUiHSeyx
z;qXvHp$+%sW?&j6&zTvN2l|w@VxtuW@LOriEEiib!FU;V)KbrS?-1fye+xvBm?Wi$
zXNlA^*X``T-ogPViI|OvCa^}ou-+yD`vsI4%*o8&Mr~!QnTMCiBX&R&F;t~;`(qnx
z@vVTvr&j$V>`ZVY24N_AqY4NFI9hLCzds3>kt!cx#3TXZ<uB9sEn(~c2EqC#g;8o_
zO6@~~O|p`7JVsc%1mlV9uP5;*{qC@32)~HUj|Jxaf3dukaq!b^^o{N1Tpm0HOkGy+
zGUWD)4Se>H$IkNBixzu_D`@z2R0R_{ori~?WbJ@Kayid=Vz#sGVapGIN!IW+zQP?+
zvBeOO4>V81K&aY~xye1oAsR-b#UckHg-BFKi!Ik`h)NW1Ohl`HG+YWS$p%i1T5tO<
zR&s)6DqrR($*J47`l5oh@L?P4urom+$<j9D)4{V`$3XoCxmdA(!d5Pj{kiIPuI^UM
zrh<e^I;iSw1n!Orccy!(bU7uF37{+>smN%x<##`-_^X(O6nB$ZxB_J)*dTrp#}>hn
z2dUix!8N=#A6#jXRaS-e44d}y5&t8fWi=t@k)AI$Wh&6&5O6q4xI^Y51ld0aem(o9
zi2pwD9>B;T;fn7F@G<cqpcqKZn4&P;(iVfzVdAsgIUlADDlh6BIQ#W8<<^^}+d?}x
ztXkSarQ=bFRw0AQ#Zi1%pdi7kgmUWv@0dR*Z2+LULDPoEy1iUlG_piUpR#({@ygCF
zs!wQ@Lg_okrk2%}L7Pu7|LB~x#e^$UV)bO};{$SDi#16+gZS+XYklJls2{YH%I1o?
z0`2XTLQ=QghH1m-u6pLyl8j6ypR}xZcu-T8&_So7Nj-e9rFTr4j>r!K0uSed2~6dW
zZ8xoDpH`7G=bJn|^P}KEFI*{4V-+5Li|s!36h#Y#fIZt`IfnmbQk_oYC5H{*w)2k;
zQUC=Mi#)e4T;L>78z!lq9W)bUI0j8>JY&MOmd#Vvv;of=%|i9NKf=z$Mqm&If-OM|
z23ou7&*KP!Pdd2*l!(XQ&hFO?0Tp+OHx2?*oFRK|D+@CF%-ZVGKN-F@M{E1k;q9D4
zroogYvqn^gg3CD`4JafmUt1$RWP7%hZ-aZs)C$Sw43q|%RS1E*v%sUzxm~2saN$r%
ztH8P`9xev&q(c_8MWZ-`@e0TPK_3>dSN56}ZsA6EA+1K}&R*a*6FU`m<eafl%U0lN
zw793mhJ>wO{UN*NO#WX?4iZh=9UZ6hHUpjSL70gS0`raW<rH>VG5sS<LbG1BL-Z(V
zZKpZN5SyIqoS~;CxNDdJ5E7Tu@>5!O;J>IWKq$%9I{6E)CVF*}gNsw9uYpTtAN0>A
z>CFHg9H#DtBN^C8^fYPFF0J+Y4Ar|X`_^kn9$Hyz1Yi26_#d3rGQjLa>#mim%UKEt
z%vvt~kJ_ck+()NdF%MS$=l$zkqT*vHy3((jM?F3r;a!L!rb>)XJ1UGyU3sp6<atd_
z3yKVYmf33S%*&!*evnLKUpeo6*Z`O*5YLABcc|zvqS3vcFL~c|oWXQY^9QlMppLzJ
z_>g8Sd9Wk~ra?5xa9S4eI(bue#Kv}ODee{T0mytU={_1OF^*j=AgS~YyirCsJ1BNk
z@HopXV`c1Ki$Ek@u6^qvS;Ab2>2dA|DkFa?V-w1j_#;@;#bg(CP;FPl9F8y!t5KXQ
zJUxq^V9+A<_YNqoNJ?YI(Y`VPVqm9sk9IfKZ5vdG0624%hz&u#@6}KL=q&sgyKaiS
z%F9Q{KU#zXS9ZS7zZD%l5YzF!5payqd$P5TWeZJi^xN3zt}?<1=5(bFwVQxBq@>D&
zQ?V``lGb&`E}ZHwVdsJ*F$e<D8*NF5iub?R`pCwCt(xKjlleG`bo1H_TgCoQ4U@E4
z;o;~2PZ0U~3Qh=uZ#;uR?yhCkJ>T{R^BveH_8GFWFCAtHPOytswnXCbxLn0_$Z~0<
z(z#Bj1);#JCy+VO6A8a`GL%fGAO>+vC-q`+l~0D&*GC;(>3*#ahVP=^BGH`NJ&cgS
z!u|<Eev&iUtzq@TvaNDB)K1ToU--t(OLsS=gELIc<O#}{#m+M>&`!MPzI!vwQ|<S5
zXvcy97uk}b1sVVNvJJJ}p7T3p6$)SM<WsL|en#z#v~bM(iubg%6hMkeQ3w_zPgx>(
z(9Ly|v~H@`s#LUBrFE7Ghz8D<k&8Fy^$%`dYX)B=7<fFO(2z-$t!lT|TYCNUr>Txh
ze;xa)4=s>GzmE?bXSZfyVmc}I8vAX0Y^UEJb_5q|4ojMz!kDkMc!@mn8mR0)^EN6O
z)8*jJ%S!RJmtp|g=kG=9nle8b2*D%3@x_)i?<8Ci%ePM(M;vu6f3yQk$A!WR`qrl@
z#|JaG59@P}ieeJ59{f1_U$Ng%x%3YLs1aBqOdf0E0z*jMpO!G+#@#$d6)L?8JbhFj
zRbqv%LjXdihk;7Q<Y*S2H5t_4Tp7-B4vP^ngYr`0E0=fZbz)lhz0`ZZ-IB+S`WSVe
z3$Lh#9O%8Zh(pX!|4F8+9`<%UKt349It{QDr;>@kb4Va%cTbdAdvHjkEl7Dd|Cvis
z<nIUMK~7K73l<s^m7PbZM2;OGLhP+1zYeRG;ret<87m%CaHP9PTpAdG*QE$li5TLk
zXi(es1*5NH#Qy%U(==_E<XU%)w6~TR@bm>(jpQEnxZmHN7(H<n$X(${bo~-`F2)su
zFc7RLZ-l{o`fn^++1OGhi5du*XN-k(x3`Bb9nK4>#}cunUnDt=YY)<{3hZ)Shso+`
zw2RELP}gpHP(_iF!#UL*HP8CX*ry1etjo8a$LHz^3=le9GM8Vyg{9oN^viO9N=K+4
z66t7ebDN=Mx(+WVLD(p!lRylS)dK5{wibP0s2Tu|E!Ppli_hT&uYmNzusxWL(Ijl^
z>@({NG<jqmX8h6m7W<4Nlzf?$1Ys<KoR`bA7qes%KH>GqqBxqAheB-V;!2u~&#tP*
zpO_eJv5Cg)6s^9Op31~xA2stkwU=8e-~b6MZ6}!5>-K*)#lXFdlPG{6SRVZbknlU1
zY0T_`)a1!{V)##mIc@kB_(r5d9CU97Xs;Q#d6pVZzFMd5%T{~sw6vNIo=oo{DS4oP
z9-uAEj$cEN52Qe}PcUqHRtC3QUCN!SH{+q2rR0Y)vQW1YxHwLyn<dd3t_{h|mO%1<
z)3n{{QWOsQ&eR4AVZCkoOYPBM*yx|*pXgo+gtZ449OA<VYWnwDyY0cy4XnmAzj%B0
zhwg4P{0EHE$`2VPSHiA`h>uVx-HZ=>kQ6{YeJOJ|#$5%6`dk1kwbH!w&9EWM-m+<^
zk&!L7?!(Hg{d(=frr3QM4272bdVL)TPK>}_J%II@59+azneSTJ0kzA}f(6@S3B|zp
z@X_Ju<E8H6i-Bs_2zJPc<TG1q8(WMrVcBxf*4~y!{|G_1*dob13#f1X9u2H!zyk8a
zqwJ6;DTs*K#IS&tPgp0Ks9!UI;@r<#t7vs>u_Mz8=WMB6cUV>)IV&f4!5R{+g?XlB
z?@n1USrxzth<h7%W^3(c$Cdm_$CDm%I5!Nkr8T&TOC5xmrZ}!KW)-Nge-~hUGj?Xz
z4Z|=H>?lt>MfTrVFdK^kJ`$t?SvC#gSj_r|onZ?fZ4*op)Ge=yuscj;5PdSAlveBr
zF0c;kXV*4+);yY7rM@&jYw2NWcWPBf;oMGw&joO*=oB;*nVH2?Kh)AecN*{3N+H)y
z+$j7RDq~-~ey`=_o&c&DnL(BtJ$=-J4?`_2Z+pr-hxB3$2XLnd8@$Wy9LO1`4N-j7
z3qSn*QBTkS@(+6(T3HL)H?kV$hh3JnE4r94Gq7|H_l4}TtWUFpX4VbJosP`(#ftvd
zINYM%a*lV<8API|pLm}Yhu<G{ENNL;lvWNW*jhtxTV9S<JtD#P;fcdZ@(Vj^Wn|_4
zz)HEzhaf|fyVogm_!PX3RfB9m6u%jPLxG&F#UM}L>-0$J7H#R+0jUjlGA61!(Dm4+
zjF12{ifme!?1Q9n_oFSPj|*)ckvK>me+qFs6TP=x*y066AC^z}DKmCYk70c|>5Uem
z9W0ztcWBwu;N#caG|ATR1SNb1VKcB_(9<wqpRi#`wv{4~Cs=xHJ|2pmgt!#<$Tg#W
z5G*YXw14!%dOfWUT;W;9x;88tzlcHN$T)@KD2)5cmtL16+KFE20Xds+K(g#8YF&EY
zp<*e5GBM7?eju>Y?R)KvUj~M&`)>oa{?V684x=73V=hVspCZzp;=5vkyH=nL;Y()s
z%0=3?()6ZXZv%pzbhKqqA;PO|=rpW2W33kXe7Dk+K}plcoveQJ_PWwei969WkjOi%
zBANwarql#0N=%{a+X=Gwt7)y?+i90t*^H44TTj?6gaISlsFGIPy9J9q5=8aHS;xq(
z=hlv(gnup@>3jG_dK03d$Z%spSn(`C_(NNYqY^-6--Mk3j>I4cMNhOFtw8nu7h4{k
zI+$$23G8&NLHPf_|Cf?C$BwRN0L>KK@u8g6*aMRSsN2CjN7@T>5WDrN5{PB&vSXl-
zeX?Y|dj5`&D78DoDDE*N<mC`0lGS;EA@MHPvNupsc}6t8#MG{|loAu_yOdzZ%rXHO
zZs>8C^k8qSmfAji08XG$njb$;2+F$_Vt2g#H<m~p2V)xe#$ed(*O^(ZwZp@(Pc7=w
zV7%qL<LHtNEbx<_L2g}2NG5@6)ecbkN=%9Shg!uDw5>z+X$X)2KqBu*Gg_~;uV6DE
zqT;?%EGAzYZF`J}sIq5HocG^M*ajK#7e&zF{~##{+byp1Dk)uL%R2<}@Zcx{r+Bmk
z2%lmAHn8U8^xPFBLAe?3ms2s3cR))g*6;ORWZu$yPR|9Yjg^oHw$<&>H8li`IGyHQ
z!9_$iXu(eggA)N%M{=K(bSjv7etc+4lKbh!0RE!|Dp6OJ$S$(Oj(G>z6a2i^?D4}+
zh`#3;NB1KDg*Qu8jDYRd@(u3XAOEV2&1B=!o-#H3o`6V_@r3V>T$R%AHV`L(gh3}&
zYwg*rZ$YB68d}N>KG5ICOcJ6cx>RXrV1)v!$q6b|msCEwQhpaGGYzR$&*?baE(YKs
z-WFL+xpPUxB56|CE9=i|t2-v-4mbpydpT2%RA7X6O56jg&s-|{VL0#b9uR9(9lo*$
zEP}~8dfRpY9T-<C+*2a~V{LfL6TQ|Mru&H_=!L7lOt&%&i8)EfKy@V3Z!zZbb#<uU
zEfdt{?~3sX6NPJ(V=B=tPA50e0Loz>ka_Y&;_GXq<()o1Txt=H%H6NLrhkN`KLNyq
zAxu=L*@;r+AoA^Ylcl9I-<=2C2(M(lKJZ5!e}tV|vV<@QM7NZeM3;7Ve>vzNOw|<M
zex%fdG|+Tci@B?$VAS3jrdxM!W;nlY-B`+`1+J9|x?+tFW*+(||Cxsmb2gxK20{0D
zp&NT{*bbjIpc#F^H)fQGiu0^XS%NrR0I0)0p}`CjrLSxwjOv^MqLbpRq<5o|fY83_
zi&vZf@Gk95<<t9v<2z#r*+%(9pBpAsp6P-nt{7-C`?AYd+kQtcDx?GFVnrH>*>vIP
zAcz@YhMbs90zB{JFI3yh)m%KxTqjUHZaA`JNo=a<m<J)z7mYZ~+n$0m5abvYBW)cY
z)pR<p8irwxzaw>jAEz&*Q0@+-#I@*f;SUFKy;Yh3gg|@0o9m&MB5A=4qfz`7*~Win
z=)P0g(16uuDqzBfV1y0L+iHJ^i+I4nHT7RUrbLx39IYVMk7m5B*g3^I4sx%iI<x$Q
z;vyb+ML>QO9K~C_rZw2&ur8Rut&~bY=bZ>5p+;P>6PCE};Mf;4iwlSvjlp?hLO=93
zcI@DrU6WqjVsrKVEZ1^dT7_@Oa^a0}&Wzv)^rTM>_}NmGWiV%j3l5&lC9Zn7r3&E$
zkslkW$BrnqSx^|bXe25C8Iim~8mvbGAG^NGm@l5UaGsGmg+agiHw-4|;}<ZGc$p0o
zw8cwnzvbNDYdHXc&wwhOW?ok`E3|AENKLY=Us>YyqPIFqU^D|)z3bf|P8g^oLLjWM
zV=<jBh32!EZRnL1S+h8tXsFkX!-=WDseB5i4S~36eGEx5#5A<&!YSfH&1s)Gatsr1
z)5{%S<6^OgTT11Q-Y3e|=tHH&<hF!?nuRT4svR+TI4!$=_4Ix(_A)$ZMj^$hXZlR3
zrXmC=v(!$<4l(hcuyet27=(f7jaCr5eC~g-^>YHjl`5ZrCTWPVXWmp&AMhq49YkiA
zt+fs=-LtSzR*<<cjv*XoHIIwk(HXnp!LM@=+;|-$zn7BLcBacjfoi96nWsqt)U6%J
zr;}49D36tCM5BVEh{#^%zC5+;9QM00eqtmzcSMf5g@J^UhZP)Fg{WEryO5Cg?7H5h
z1vH3YE6S`rd@el-KphvVA!C|WpC`y7m;Iy~JM9bq<5AIeEW6V^!!WqP?rhEjoHsS^
zT8qIMV@%P7gvRuV^{tbsJ~+4gSYEu&gF+d$bM$hD@bxpQWiV#Pq|$uypIzB2@$g+<
z+yog%NYX}eunj!ZE2gNCLPb@IR3q&LZ)xeoZ`LQ|B?Q?aCX3NM-7=*&5K2Y2f6<pF
z(>~i2M|sJVG)s$k63uyK3UZY`1VOj2d-joC&}}3f?lZyYWUJNf(X6O!X&fHs)H_Ys
zju3@57WQQcU;_fk+(eC3EtA~qSgF=DqpCB-0d$=-k8+7iIZz|s0an+R^9ckM7=lAm
z6~x#y4=O%d0L;j{hORU64R>@Q5<1;}w!a|`Eqo<D+VW?nYYVPQa-(aAKl+tL$JkG9
zG|!oUAU;?tIKwgYOSV}(@>2aH604CSX{VQsyL@~L19=no%Ilzj2KFoq$iVi29@)ob
z9K3X;4)ezIh$-5z{)D!oLYUF7|Gs_H8Jl1zO`^bbEMYo-wpqyl_dt#SbGF)(XJW5=
zJqrTrE$~V%Oomr6v&Gi5mV9d9epZ&ssL^8Om^%jfFdoB|F`j9_t)Ud>@7Y}C;<UY+
z*kgza5-nE6i+&P}IN!#HW>0O>t~gv^KNp*OV%r_5MNHe&63I=3l9qqM?&Ppy5C#Hh
zOE?$<{WlgKiTUV|Pyyb+BWacjPV#S${#Q-bCJ_-@@M*DY#TBYiQ_~`^Eoktv*{U|(
z!w57Gb2u-kzG2FGa#Ohb3VUMrbI<TG5HL6#WIRjXj_))DxjckNSoCzAwbLQe-}Z+(
zbMjH>ivlc|R*hNRl2UKM&rVpnKPxiG5m>z()3IZ;22fO3pxsf*I4u@f4d$;W29k4@
zxg5_JV)toE_DeFoMr~j*zS9Fcmfcl<P7!zk6L4-7d-j8oso3V}eSTxl`^NAC`Ntsl
z?si+8u9#kv%j=x&L|xTDGZgad^YK%xOHj_?8ckOu=PrC2dqSmws340vg`<%SPx8Dy
ze;+}9f2A#M>dVX0NqmA<f}v73KEvAz)4zK<XF+)MuE(eNF)uZhn0~p_vOJ7z2mXOT
zDl?}DcjhKDe3gWEqS}?Tg!#N<$4`^zH-^u?8m867RekdOgXJt@`a_=~f%MddF6ml6
zb7;DLfy{z?;M%3JlN-u}Ag-w4EsP2r#UEA7-)p^oVz4kVtAn=ZJzJH;j;?Q9iq_t~
zR_-&J9ZDLj9e{pG`D1jS_%s311GGiW38t05BV9?_OKIhfyoEAVM8_Lj*6FYSQ^qQo
zrECcGaR~#L%m~USZ_vsPle>wv+)mL_C9R1qeTCc=wtV#tXRuiq<N0wR_s@*twIG^?
z-<4_=ly3iX70Syn#Z@q!7`N3)OX7#m^<BftsTe3h3>(bJ$3wB?>CRT~!?0NeX1pDZ
z+9`z-86cWl6lp%0f0JgM|I%@jt>#Da4Nv==dX*enWAKcLBYtcTX%dQ5DG8!#j%gz$
zt>KH7)HQqO<7r;sgq>lU!ypJmuM{z$-v46Dqlv}+Q7*84?KT8q=1op`n0N}jhG0UK
zaUF4B7DQ2Q$KLH%4|Lnh7w>g~)=pyC&?6WLWgQtS@GV9X!o_Lmsz{d#P+@i2=6WF8
zpAr(kdH2&%PIdvJ4+KE#U!I^wH->QWYUO8p6XQ_Zgb>jHzskW!VPXOLg`48ca;E{|
zmaGoKK`M8KZmB7Hz47s2%$8;2UNghKFe8lAu8d5@{pjr<;Ye04%(U&{srQ#8$7&D&
z&KHbf0KpT={&8ulAXixSTL5A2iXozHM?L|R13BB-6R#{-V5tN%6|8zoy-r-+V@kl#
zq-*)}u$Q&rMUQg7_#s$UsFP-hrF>eLv$MlRSfhnVj!8y!)K@Xa;2K6<jvIKDPNcnx
z->BPDtKPjnTx_JNBbHy~4{?4$i;-c@cVVmN{2-)!?Dg^dPt{a}$^Kwp&0e=OCu`gM
zV<G$#*;hvyaO}#U9SlTr-iNNVo(L1C7mtCGr9X_8U#H1-#~I5_sw&|<dSHP%Www!g
z>fQI1<=jC3sf%8rM=xuY?CQbgi$!0HEZ94>r(PCdxP$8#OQUthjJRZBY8z!!tHU-F
z=mNq+B%FbT&V$<cJB^{`(w?8^8$N`R0gL3S`j^Qo7en^bab5G;Pnp{6t`vm~o_y{A
z`6vn7x;K1xFF}j?=uL4~vk^kN)S=a7Gqg9R5mt=wCp}@pjEfi2WE%0Y1O95MM86ED
z5x!61o|+s<Sl}o`Eh3t1%}nA(iZLPz8f<0xxwhK$!Y1SWpv2>n(`bZ3iExUEtQ-N&
z$ZIiPPY{>Y`&l+l41~O(ts<{M4=u8{W}kCb4$2@A#qSopVfivDwU{Q7>F9riom+Cm
zFbD*%BpIQ{{Vx`pjb-@aJE_`QuPh0e>A}J`fL+fhd#07`5eXD}f#|_R4mLY8jc2x2
zF2dV3eaJq?=fgf9NhOO6jDDOWx<?Xx0HPr=a=W*)_$YaUp6Fu(G3|IvgS3w;6SXn<
zFhm0^i5j>`&WL?&y9$&n50$s$0S*{xr#BZ*)ZQbLKlsR%P^YvRI%0Q0a3}wK7Asyp
zmHNWV$nc4jqm@D?Ijn6JZ0v=4l9`;mQ!C{OMO)RlK;<Kep%r!4gRRFMhb};r)blgf
z|8VNL2~3Ag-t$goS&GR80f9T*+clRm(zModmphsoJ(^L3LMA!TA%-Vqc_g7{+6g^{
zo2;qx%yOr&=w1*;K$^V?zu4G@Iknp4FUWMz)_4%lK`D@Q)8@X(Y1w6mg=mWd??0e;
z{#-x88!%~i>_(s3&RNwyBa97D60k;m6fMEnP#)rjb5wl&hQ0enW6yw5Ni0XgYrv&o
z{2^py24S^8pJU%5@2@?l{HO~8nl8Tqehj!Xg+1Yeqi8*N8xmlHY$CFR-I!OY7InOi
z+TkHZ51KTM$Cp4;g*Zyl&oP=v+~lpoGa$*XYzd4npO!m0j6?>&;Yz=NJf7h#Hk#?F
zz=T~z=?<x6R^AL9ck6hX4;JX!*;Q)BY8LA;Kqux&Ezvjaoxu--l2=aE4Ab$3TLU`m
zfGfN!kUK`hWfwv|=8)8vwSQ$?3<{n4sQR$+b;EGJp?pz$W*Jigi<_6p9@Uu12x7a_
z>C8?h?cnl9y8~MU13qfDnrcTyCeBx4Xg$$P<85?v%lm1GLG4suY+g!~|N1UT87lD<
zQ)0Q%05@{ll9ikRjKCg$kcL*LGg8w(!p<<=br1xiTZ%>??tf#CGp)J!<JA@PYiokQ
z%$d)0JAb1`%N+)bUa#2-kmSsBo$8yt8{H@0SeY@Wd|DeTpSD5H06~p!y-L!Ca+#oj
zvXi)KKrI$hl@z&_o)ZVzzEaZ(2pg#n9r~8OB+_6W`usbGKig!My=y-I*$Sdyx&36_
zv9Hv0Am>-HpGYwJw$FDZOk`JxD|EBevOJ|=cG;#*2j7+<Upm>W_~f@)vrR9<HWOS*
zAhNGK?x~3^Lk`%`r;qAuAVAnqmobOEY%k5qyy0iie4<o&cB)sCF&4}BXMy+Y5wq8i
zpD%#>nOZH3Xq(4SFQd*><?Eb$u|xb#tjAb(o`5K3t6jm79)jV~??iP@4o;$isL?D|
zzlo?NxBMt^GSZkW{@_3*ioV@2a$lunlHvM*ZsMZgHGFgmxR+HsFPHC+`~Q!6_q5s2
z=|WF7$5Y&l4h_x$YY2rOb<W`ova&rBPhM^8ubHf^oF^<>+I{r#=f3$M%^A*wV3BmV
z`w$(iFhJs~A91s0&r9(i^gj=2$#HE-jHGV?cm$l_acuy?E1LHBAYG4>2b*u?7%M8W
zroGk2OCvnGA_8hUxRl!RnJ}DpC_nLJd@^5FeBv4$!bHBaN81*DEuVqF73_d7>Ydc2
zk?#y++EJrxzUYHUNIyOWRL#|6#S%N)W(jt@?}o0C9WGjP94^PX_L7$dp*LtZm7m*v
z%PX81Wr#w~YvkMq+n)7~G@%=X*@@L|{$haSQ^WQdEP~2Bb}H$bj*OLYRUG9l1TOid
z@Vn#b@MVi5l|y`Eq7R~G-;s|=1bCxx_sZ3vX0sy(h;_s?*jHQ{ie3t+>mf2y4OV5|
ziU`8EZTE6CI<*>qo{|TDzoY&Uc4oN^!!QuNQ6b9OeE*A;ZxY!Q(1PDZ!8VR1ayW~Z
z+T2nkXnvdnxz8FeX1`N>KtKT7WOo<!Tp(-+!a0DibiXnllmqU8KmSgUjU5UQ7L<6d
zdZF<VR&R{iKvjE@;xJ8P?qj`jlYs}W&p`N)M2(d)&5C#gY}6we7+pMqYjTXLCHwTg
zolA9U%VQR0Oc~Mf%@pp@gb1`qfj583{9u7wjaCxt`97cRERtz0Dt$mHcQhv<Z3;=P
zf*#uOpUF20!wc(g;L!iY-sLQMEi9xf%)Ns)OQ*pe3I=k3AI6UlMx?TXsvy}<9@&>%
z%D$t5&=e_5uOs7uaT-rs?2ThB7D^0MtS;nnoz;5G2S4t2ga<Y20dcz-`+R_h1%aK`
zk-CdV*^o=8m2?I1c$VTEMrX#9FprJ{Su1vnq$BijM)`eHrv{_zlk=UG+Qbf4MFJCy
z%g>I)1;cu|>XEg`4P!;@uhxyoN<n;CvGMJs7KdR&@>{O94hlRWB!$cl1-nIZfBCWs
zZ7G8ytF?O$(y$b5hT@@~)KcDsi_VQN>WfUlZIt8#Pes4OvV(p;dfGx;LpnT!&l>wS
znN#yH@e&Can2!Mr+32E4d1+~_I}n=q1xyvE1*aiQ6W5Xin+<(XbD_9_@sA-AAZa!|
ztaq`}&=MI=vaJ52FC}YNfQcJ+a*0SiNc+b>7ZaPTmTiU+mpFv_!K4-QG5nHI(yrgv
z{)dc1^FJ}|uiEw36t!IY+>pg^B|pW#*!t+(o{AKOgFO_Ig?iK?rS@X*EV-Pvzow;h
zqR_PPt)27WLl(QSnK816jx;p@Ei!uXTktC^-2gwXrL??=#sI0~A%(K4^7?@8&<;jb
zP~#&U*htb5{8{RkuroVw7=(dnOITc1|BWqg5?GWUHL!8A7+s?`*GFwrTI|z-2C<Lp
z0ZF+o2I30E%=|${^Ooa4Lv5Mzsr$QUvNXs$K2e|>qoD~vHq=ol{4MPH(W5{?%SD<3
z^ZI*=6}3QR8ebzm*AS{>5429Ww=fq_Xys7`9zaQ~d=JFKm}OK$scJRI#Mv$(BkqQR
zH7>%<l?>4cz&}1sv)`i#BU3`t@yMy=PDi^GObtQ8xckhamv><nfElEGt?qjht|6=i
zV6)!JACJ>@_}J}c(n!H|y9nd5P?*&rEYIHNub$KagR^%uz@P*)Utg70b-6yTaOu<U
zl?AXVB&B0L-kaw1Zs&A>1Hp=uuoNT~gB*L3)-%=g<3@lWqDWs&18D_;>}@{CQg!th
zpY+<i`TZ-x%BMj_U**%Jv6Cg*oHDlJe`i@H;JaF>_&4(S`es4@&M-`XRAaBK-{*s-
zuWN&!Hfj1Z?qxVGa;7rIChH~PqvAunha<O*;D$6LKcf{+3DMHJ*|#lihdm*k8FRgI
z173(9ZAco}hFt-ZB@9FsMefPj-SO3v3Qb!OtyQ3p7DU_pJ<**(Yxte~f};Qji_QC+
zS;cnWhSq2hkjhv3lQX)hNdqJsx#{JJ=Glc3fc;vZ>1X*#rq-k3-?z?nDfg5Q)I1Ek
zb=cad&z(!DR|LujX>f8)jdJKepqs~#K}xT|>>Raoe~8P~?zt?@A|Uka#!tW|mVMZ>
zhY;MY^0CC)ao(K=*aJYq7>ic3V7k<}+~msjW~{fdd8Ihn;Z?{YKy(D9GFmAUO?mdx
zKP%n#&8E1L0j#4Ou}r=<wv<#FS(fWoC~N<wz@IGf6?{k#u3(e}gGjCnB1F~DO8g`2
z+>#@PK_GY~JuHOpf3eWSvLTf!zVo5otSup!>G^lDPtUQ?Qt-wCz6#t%0#lt*PMw=0
z7AAUO+bOrzvqQ_ZzKA$vu8SU|eZ;AW(_qIukzF)hV`e<_AJ`~_$%1^W#6Hqq7d~z!
z(2X89JCiY<E3<pJ7^&v@+n$~R!Hm7{ik>T<niN6fO=lIcV9Q1wrx}a|R%BiY<&30@
z4(fJ>Lvc};cE+=?06U!y@-bEl7~v6xcYy_ek4O=v&xCQ5P4TMoBc#2x2VbXqBDYSB
zW(97bbU}PnhP@_j!WeWqxkYnS{t|iAq)NsXcDLs9%CV!S-)E_U0-q0*+8rn(V0z)(
zl?n<dkC@bMr*_ubC3(97H`vuLQrmC^DHdBzifv4OIvw=PuU0Mf0*~!0+7>_xJQaL|
zr7Ht0h%!W6k0^qqUvT|eRqatNzt;Tb&f-Qz4>A$W?&pnak&D`laZ-aU3n~Z*=dIrI
z`;nr93IV#wxVK9xbCebsQ={9B#F0%&=&`+KlWu>7dy{_p9dHo@N(26)D6yw8H1L$;
zJ>va~&?b5#u%Q+eM0L9K<E32)qrl2dl}I;&WwA*M!fLO#L_QRSfZO1JJXT!+IZ9Fz
z{b(Dn4ccV&_7~zTkk>bI!IU-DVe3Gr9Uhoot)`z*0X(%8-Wz>fi=1z;Jg$zQwURO&
zkk8^r@x1v}KKA#E!n6a6;F-%olxd<v)2pe={rgL5e2lx`8_5q;PirYw8%Nv$b%MJ3
zrb85dGy4nSdkgTu1<O9&CD=@CF*_<S!xhis_+()WXB!n1P4mQYwqwq=svDY;+%Z-M
za}MpCMR`)S-eepfKHV;4b#(5eT}k*uQU=*h(_Jg^pXib+GO>RMJGa~hLKuqfs3MpF
zy#I~W#|XwmYW<rkMG7;1-bd}P<M7{y$x*mRbbEje$3T8YRG77yAmO0sYP%pZR*zcp
zwig03FiCH0_br1pgu<86w`=sb%*DQnPom_jUQ}j0F7_`({Orb_qd0^~mNi2RF`{su
z{RLihaecNbEv7MOj%beokm>o29UdGmu6z?DY;=fo^04r}gL<wS1py&z&c0Oo<Vnxk
zGY>&y2yG1(RWr_V96Ugw2+T69KE%2)9QFirXq-;7pKyEAvVTKyp)ZPd48Y8O@v-Kt
z(Jy+=gEKV6EO_oLi`6aRfpvjrU)1CEl0l(_8BB~2NvTmAjnC2Z$3i*v{OIz!!wr|&
zvR}!n&|7A!E#h@S`t1q5pOvhZmpxR%RM0H5$nIO9;$m+<8GFo2U#?IdsPmd5w-3@H
zg(VaAKJu#L#gnS5@jNSZ1Z+(Iacvjy8wx4(@=ak74ZIr-zqGiQH*O%SQh`3qx$w1T
zp)+u_VyFS;Ef|e`3u0#}Q?@Vd;>KDfXiwtPF546)IdCK_5$K4@Bwn9bEOe))j04o=
zpwKNeA+804@)K>=^~Z-~RsgdoZgOq=?3rM<Sa`cu(=GoU*7sr6$0TS-u(dAXFqYm-
z0Npq)l!+hfA;8Td;DFg!7U<;&hkcgZ7(jFe;}<WOvba0nq>RWSEJaz`G2bSBWM>_3
zC&kTftv;SnBIF&kf>&*W>um9%M=H#fhM*6m@7Lk4;EF>tIs6%p35-H;P~di)ZsnQ_
zfE=K7(^fOTw%)e%4-h<NCHBvVh%s*9%mV(isS5#I@-7oy0a6|m!tBD1W@$rB;Dcfl
zoAb*GRGCdJKyC}LW-fWuU%u@iwSgFh!thl}FVL}N$u{&dB@87Hx@bxlJ$*g#?~r!!
zRw0nbSn{Xw1QH+9c>E^!`1i%1JN@g+ajElZzw-XHUoO|D>-lFNu0~zY_ceWep5H#+
zFZ){6Xu$V2U()#Oc*)~{c&y@oBF%)&M41U!i98cA6Llt<O4v+vR<+GYN-9%k=J=*|
z3mKuJLQcpD1)-`!L8uYxbZt|iIzz{E=Mg%d32z}&p+=|>azdd(olqsz2z9xuKrkd2
z6ii!K7|>vFFzF!y!VqDQFli!z!cb9AQKX6livo)Riy~PhTohasTomad0iyt;0K+AW
zgbYW9Bg3VP1PzCVL&GJFgbl}rW5cD5jE%rXU?ZfBjE%rXU?cRs0vnkg=G8-eEo=m$
z0#PAFWo!hZDx#_sm9Y`5u(DrO?pMYJjjuGL>SjQru3IN%Rb3V|DrGgwYPu|FGzO(H
zC`}HEL8CD!jX`O0Pz)N47B)7y%Rw<{bOxo<_%0i7>nveVI)l>Xpx8Q1=zOR1T_0P}
zsO)m5uC(dG)`7C6b>QU{e5~!4?=r9rAO>OJN+mIn?!Q>2Hb?bp-vgk$;lTdCg-xL-
zObWd`5ShBB&I`Pde2z0?%^&uH=wcE<(1^g(?P4n^+!TsJyE?kC(9v;rZ|&lcOx>Z*
z3!L<Uz=go&1?KaP$0D~ZyLhVqFL^BA7KmBJdrW@W$?FnxMjvc%%eF2tGe3ew_+*in
zn4CCAU$zf)0JDj7o5^oG`2?6vtlKD*RhSo<!%hf=@(Mvlv__yUJHsTjiW!O-%FZzB
zX(zv1FAI0}^B4xl&^PputwAPfj5qTHnWQmEW70OJxH8FyCIZtorhq1yVR6^Wnq~n_
zfoXwhSxjqFIDZ~sTK?Z-j0sE&Oxt2w`F7cS+$qedk=RIVFR@=;&8MC^ubbG`)e3i_
zj=U5;F!kkzMVvisyA};Ka}y7M9}9S|=X>Ap{M1>y|6;_9k^}@{7<#1|LE8IYY-g3n
z4t~TvKu2jqdC5RD$zzc`_h}n55KRsW8GiaBvTA}~EiOh`)r@O5HTN_B)cMwo-SHlU
z*vg7+yq>2uiLz1~^}hJUHT26ZSv9!PTbfUy)mkDN5K17F!ge&Z8wjF+u>H&_88JXb
zqtJFH-@bX3S*2y?d!!FR{NM>OFY=K&K|zS}gqSN>;e-&PJRv4)COU-|g?{z~ECfJW
z36PI~YKlgGArL8$kAdoVH%FY&<6hyW!99U{^0-&%M#%I;rl*x@v1)>)7&ONNU-jKd
z3gD9mzT$m47h%#HpF$PFIoB7NzbC~al{;2%(D-RJUI?c#Mo>{66`y9tgzcx2?tBDU
zF{RUp5F3l5`J^b2PU9vwPT4+^#5WNC(+WK<_V<$zqaa50k4n}K$S9Ce9vN?+yglOT
zsG$3>FW{S{SUi~eM}u(RbGHiGl&8%f%FF;aVh{#`U&`9O5dQzMs=drc;-sa0fCU(1
z*0b-Y^mEM9k(5D}n=;;=|N1^8ty+wKt}@3HkoWlsPDkd%0(uLHTS(l>5?8X$q1_D%
zXl%}T7to{%5V<uriKTv~uY@W%a}~gSS7upblUV*O@r(FM#wM|L26!cdy=J8=2rx*o
zV2YKYqJY2!RxG$;Ww0oN;Klpc2tk2@xkw~(Wr-|caQQi3T*#Gu2?JppE|hELnSu#h
z&NCp@++=laJ-W`nwVv{9#S58UGy4tj;osry9Z8GL8e1^pFE7bvv&I&f*l~8U@*x4m
zjRxrhH*3@GfW;P*eKe7|>;T4(wtG6r#@2d$Oa$KTCb4K{AM+$|lUQ0$E&psEo4sCS
zc48CWji9qRE68!<&o%~aXNOj>V>be7y|ccT*|Fzr%ZWUT$nbc+*sRygnS~!Wvq3W(
zbe;_aL2guKmo3=4XulaX1KWmS7znOZ@gh6>PgWH5F@TNoJAjZ_q9oqE{u+4|5M|Ly
z2UM6LFE2-~&&c_-)FYR2r!0i3u$*?!)}CchVP-vlx_}I}3CXr9`S-T_87a#!v&`BZ
zZ~L1<355JuTEDiYeFz~LS0>Zhc!%R59pCrF%Gn{zj>pftpEIog-9qZ*eQgpOXJ%i%
z)X7>}O!5g){=O4CuX5ykd8w2UgAjuV7^G813_=VdV31O|`f<eeJNNvZT4fAB*p}U%
z%TBF~9mT5$&UL3&uD&vRH3J46`?e_St2IiP+QZLuUvAIJW3C|8GS}gQFA|uaB&=4;
zwxbA81c1^lqp(MuA>fR58F2=2hJZ5)W=_A;w+76Q4c6He<Q_8#A@Gcjxx6$>^GD#4
zmdu~Lr~mC-2yL04s}hJt&HQZk=fm>s7}Pb9ga{<0XnqE$yu)frUp6x6o6?#no4*+~
z0~`in7zTc+Y0L)y|JbBWXGA9w9uSq%K<cwkRm+hy>dUa1Ktk>u$=;-k=G}bnE~OA>
zCf|4B{g!NYsg<YTQ03k%xm|-H=^J7lLkXZWF^Ko}C<PHP=VWFkk}n&{XXq@95j{h|
z0d-#EZ`n*~pmVwhP<+`azQeAlE9tvN@qwN5;P*p*CTn*j%$*H4oOx_gbcYrMn51ts
zn#%2O#JjS2x3}J?8lee%J}tocu#g7A#MkhW_4j4^Y_<5NunwUOM??9(h9CA-SH|L$
z=v=doutA^Kgjj=+=UB&=upbnouGA$kB<v?ev*NaPELNwYP6UFUVfqf4)`EB%JbOf+
zdu&c}ztgpf<|L1+jbO{Vu@R=hGxJiUM-+7nfS%{(O14=`>FIniltM^pHSJ^c4DJ^4
zRJE*~pyxFRsak^1@b&q%xRCmj;2*}#0Eb}^hJjz&j8WPDKQ>L;c`DVCJ^(=>q{-QA
zBS}7_t>=+Gs+p7Kox)o)JA2e47pidfhmoT>lh@{Q9=9mDAkSB^&2{sxpy!<%xfUX&
z{Jqe=h1Go2H##=tUB7aT3j};NTBJu7Tb~H<IS6O0>`#5apwGe)WNbFB8+d`AFWlO0
zj%01-yxZXu`uy_|PC~X0Am}p=4?Byk4-@(v?ffpv6a0CN&27^V6@j0vxGv0M>nk1n
z{8)R+YZ5g08KFP&`Dk3`q0e)#3hGx9iffrl#MF3pGbQ*rHQvnrG*LkHOp9q?jB6O9
z;ODC`rAh7Z=hty2a&F!-K%dQ5I$t@P8OJ|^iR*VE3Vo(+Gr+*Jc|$SJ&1qu2ZfX_w
ze6fVPd5seG{0()IY`3jRKKu}ZR+~r%JxAb+dS1Kd6!QG@CLOorB!xV4k{=P^O}QE1
zI0(Z)@Jq$nn(+URokTT@8Y-K6Kx9aaamKr!-Kp7FK%V8Yp5#E*1rPR&eaW~onsvH~
zjOMdKY4&`~^)i#q{^V`kHlJlW^cg?MU?AOnmeA+>rB;ol$@H0TWH4Ip3ZCgRG0#w+
znDuL>bw4{R{j^O?+8>fu@JiLZGN8|A&vLG0?4eqI5mq(pzvU<23%Ir#LY*NifBPiW
z6fWSieQlgb<K@bG{dqsqn+5DS;N5yTW}OAF=k1cx@GGgwYM4DE95rKCQ!UM&FMFqB
z*5&eI&mKY$vu3LSd)Bc`_|%x*K+j{5N2*qE$DV5s!&pc)Sq-D-jqZ8lFl#^>yLE?b
zELvX8#zuI2`_f!1YfVf5o^5J+`8?|E0Xz>g5w3d;+nBLxMSLKQ=W#6gs_P}|tTT7!
zf`G(bO}7qq-i*2*4i#hOZ?ko?JAaIvQF6o}3`4IJkl7^nzgR!or_4GXn*%TlSwirW
z<Oz4aeKNBFYFGUPJA0<P+z0CHtovpjZi1cfnZ(a-s!(U)i<3WGHLspfXJr0x!Cza(
zCeZn}jvXjc8wIW1&eurpQFY5qc4wQ-8pL4a{P%nOjm<m}ELdS6(nhUbPIz;0ng;>e
zs1vjk-W-HepE9QQeaUX;CplynRvl{vI14lp-snwo_i+60OvbpV-DWa!mK9SH{7vlF
z$eEFg^L5oKfPl{5Z95vUC4e(^jN}Fdb<Ehr`D1SL+4}P6u-oTMwZS@?VELU;<Koh@
znoTeqHfG?-z<Lin#2H5mV13o%flQpyzJuMf>Niv4Wf;2*^P3EP{NILTjAoT9p9OJl
zodp^$y6kxOD(jsGaUS+pyRSnnk_h7bJRif@?)h+QzLjL*=8C55b|y?Vuckl2+b$Mc
z?h=8VU)?;uE(AZ6oY@frAq+!X3JB-uzp;E|p2#?fO$uPxgI&av>@VY#s<K_BvzmcE
zaB&!U_=VJ8^ajot*hi*}=4YV=pJlB<1a7t_^pv$G6u5cet;Fz@&B%|nL#jV&-6LIo
z7`shvr*cmWRA|G|1Z*BoH<Iy)=8Zs`edvCH>;BL!)8@NU7;1IRI9NT`@n4El#?7gL
zQbP-6+I+K3=2%Jn(=u&VGAp7s%mr+ItC~HFRBFTKY?#MvMvko0<dOAlI_%6A9eAEm
zd!7O}yL*;rte+3C8OLFqZO=bjWi(EgR<6;}?kd!Dfg!58pAG+kX1PL}k(0xis8LKi
z=X^^g&`q{T(B`)uB=g9G7PNU;zL=@2nUjqR`!Pt6M{Uo_w3!`fEu+nP!J0Rdp*j}a
z5!p=M&TezH*Oc3ua~$Qi1aB4@A(0V^My>;#jY6K3oY4`(APhrSYAPJc{)_dar^g+%
zHk}{|IAA}^a?q-HBA1s}*1~|u+t9i(T^a7uI}uU-qab!(Nl{g?O|3Iwz-Q+9-PAg7
zL0epWcl$NDStt#K*m*jPyv{-o+B{o9aWri%d^E@^J1dl*dnV4<hxuLekpRJ)-8%>a
zs>qcAf;a2>^Sp#NZ}UM#*FomZc5yp2_yRUNhxvfOgB+%BQ>MXuYJQ3!blxm~3gwnM
z%?dAUV@vW=1m28viwW=oiFEQGhk=!C(TWvv!wb=c>yjwy5)<cr3Mz61gp8cSWkR^D
zjl9XGsdZkuE0K!|1aqD->&q_}tIEt7AGJdVC*iNr>3crU;=s(gp^T(X$Q2MWbv8Dl
z6e_5Zp)-9T{^+|{*Rk?Hcx>S-IM)1Go(O1_vE8-ls17*{9vgTM(6cD+1as%+5&3wq
zCEqslP01PHFbKmi@Jn6ml=1(MO`7C`6)EW+fX1LS$<_AlN-aE}y{nj|(K@5$wO%9g
zywPFsEDvC!yDYxUlO5<k9p^yn?9a=t^T=&b!|3^vM$Y%vv8O=K50`VX^hD5xU&)E)
zG!NDzXv5!03|>i|<!AED!kY}Jc~Y{$vz1Bs%L)yI8vPIKaQa?nex(bTk7(uHAfkA%
z$M1vPttDzp4(hIxNk-4qJ(|3nHOS;yFAht5Wv<#0LCO&JNzb0&EIAvlm_fzN(?n$S
zjFq4>qvi)R0zF@C-nlg=2>2YU87^iK1d7|#jMOHv$l<DxJ6{r!W6Rqp!{;9QFS<a6
z&vw`k$6yr>MfJAUA&y##<Wls`Zf99~MNlew4Uh1Kc`=J$9IK-(_8e_8e!eO6Y1Z;Z
zYy3>jRO5f<`)q&cRohl5gv_5kU?3eW;E2qh(S7ZTMAXlPTz`*dK9rqn4udcZgReAJ
zyNvr^Y`<)#REx_25T!~Vah#70<r?Ev7WHA<X@6bASepemPlfR={RH%)?sGRtf>!zb
zQ1Zq;lY$iJ1<>9XOklS&A6oPw{aL$@#u=vO{DYqlF(>WW2vmUw($PLD##`5y0BDx-
zY+$3gFf%;pCgoYnt>H=_;rWNlaBO)vfeONO78HmMz|v@;9i6>h5U9V3@XaR>mobZN
zYu5w}sn4%x4J?3zM|JGsj|^|TD(>rMGxSf|>O4o)@xuJvkc}lV4d;)M&8`U0zMU{y
z<9F>;^@0wgMX6--^xTHgvKX^zJ+AjfLgKT7mX?tFiZpnZ9y&MwhTIGMR4;_8;QR!j
z`HFAm-e@I1!yY~v92w3_1DuVh_8PmwJKukSr6Ky}s4en_=Y;J``ZKl4c+XH5w_nQ6
zC<|c_27*_TvZ3w$FXoTCR1h{EAkX@&DH)dOC;k1Hh@r<qn8LOY{u|pI+IUtlOH|MX
z{L^YGCyj2}_^zw_qzKN}N>~|}apIRnYd2nWoX1M(5c^~;NT1n7B#l4z`@A50=HC)*
z&}P#EN;;2fm=dP2O&Tpapu=42nEJ^I%AlyTe5cxhFc{{X9N;+*5@dAdQY|z<U8b`9
ze$|9IISz7X1;O<l%@9rQtl=`Lzk#qbZ&!86J^TZ)b0roF%|NEVD(c)bb-5THB-xly
zrP=R?!1JW-GADIF@~rLQn!5$Wo#(ue`ANFkx&0Td1i5oidlJeV?l-VN?#ws@0|q9V
z4N~XI2v<*vn8y#Xv*bzgp_%!K)VUWPxpf+$a}zb>QsOq3O6bgmY-y@AA9)Y0IeDHs
z1f6xTqnmG@_uZSab30-XhJj#9esDnlmF4T!Gj<{=1@Hs$SXrG`U!Lq+c4r~-IF=yt
z&csKV)rvDpBJb>F0_!hS+;SCpXX__OXDeAH0(Z7k8bg%gCZ_N^FQ8w`_KVOn^904K
zR*lN1ZICk=xRJ^8X%kM8N-}zOH~YOxi8BG7eeF%x1xedfeP72_8{HI%=OrZKTgJb3
zV`oYjUqW}>Xw#z3?p<+Adh&Yi4OCX?hD@C==YFcqJt25*{}m!KbjESmOOQ%9HW-cv
z!^Isa!JHX=cuF=;4HoCPz{47tEI%Uhj9kIH{$esFGv{~f&)qF~J4fcn^Nfm_nvTeG
zN57Vw5d_Z|AfH;FO)%$epfMS@&`La`1{$UOjUdi#JC%v{PX^BVOOdKMemRH}dyTL=
zA4ZQPTq4#1n#Z%QDY5j(z<DBf9wl#^%$p6W=eRzUozW45AP_@a!efKje`EKRpvxV>
z0vH@!!F`5=^}62KiJU8&(jb>;rUq*N9XIJ>#fG;tFLkROfz;0DGwaht(IJlX$9#Le
zB67ajfb3}oLF63zy6f6}%$$+ty!}@(bIKm!eEB5BoHbH=$l9C*p{|S7Bi>_nA1R)%
zS7wTcYdTd_wo*SJ!80+Mkn{Q*9|{SaLexH{WQm+>w5gL>zm{@#=5NHt9j~on2&8xJ
zCAr=-b8Cs5M<YCX88dQnHtcl^|ANR_;U+~FyRIMkYveQI)hu`f&LIi$z^Utz?Qi2{
z*bRoca}EzO$1Nbi^D{r)ywDOmXFY+DVnSMH3I^jkw#492U|@U7{!E?A)mb`2Y&H}U
zI!_*7F1mBrI+t|t&YUd+VKXR8f^LslLxh{BXf30sgm81qdK5z#zLcHo5rZ%cgID4u
zL-t>+za)cuSYd!%OY3tI@mT`(=3Cw`dq_W^3enEzx7b%uZ`Ne1JUQIe=`1H73bAfK
zNNbIXLWTRp`mQ3Wk}v_MS9Km4bCbW2t20&HE$uw|=M?Hp2zdHLA$JXlK8y}E>$bP2
zH2x~M_ENH|Bxh4UlAPCKSz!h#A<|jwRd)5h3?w<THzyt2n<hb$v*>_Cq0GvwQ1%DQ
zAk0ppG{JNE#_u6T=f5kPDO$nKnIJs)ZTs#%p1YUKz1{CKDk>&lXY-~E6rGWf^fg7i
zW4z`h8wwayoj(EzP^6&dr?Rv6)lSt}M;I}{J<tS-&b+csowb6BvuM*v{2}D%oI!h-
zYLu~TZ~okN<^K3LFeMX&#O64P4VBqtgJQE(8{IB@l{#eT%p?AOs-yS8#cAnWN3rkR
z&5yD(Mq(HSf#8=cMY`Dk|5zpk%UDhTb!jMqY#9z%ep)i)&QYpV1=6vgefm+FdQn@}
zdD%<VWA$IG62v=$ZqaxHb?d98C0&Z&4w=^Mmq&4IO0+mXxVlMAMkY3Q7&QL;Bp%X&
zKAOZY$-@p`!%+RrCmIvq+T!GG!)wV(``Joasa$SumI<GBobli647uA~V43iY*_L9P
z;InA;PAp%4)cB<6Aehb%#VCoKWs38wF`v;(b$WH(kp=KaX5v^nHMpFQ(pZpSY>Yh}
zUl5(G=|&}{ssL=9%gTiWQ!3<U(dTZ;M4TiF#d))tUoJSGd+>Xi;LK8E$E+monQIbV
zwj}Se;Dx*^uB-^e1_Af1VZ8-nqdkYp;+q}DhSyfu6&#=DSTPCXBKVEJ?<^E_uE$ZD
zau-PF>yFk<w0t>X<NM=7*|}vw2*NOQOCr-C``_67OyaQ&ZC!u|UnnH$?IZaaQ#hfZ
zv&!{~m0D0cLD!ZdffM2b=OkAPa6!$v9rNYtN6iG~m&=8|k~=$hJwmfD9#v<uG=Bre
z$!bV)o(`m##4T`#oW1?nXEJ18+WqQ9j~@sXXRbr4*C@Qk=@OVp(<qn+V%7@HVPn^i
z!m<&$;gWY?CG`$en=g9@uLqQn$HHApj%-^BO`I17Hf)5%c>?9;KfJbh>kR769C6e@
zGQffYzyHqhe~W_ijW}+l`gBNdc9HR<yaH64Pcc!C5;+<R$Jvx!h}}m>Y_^yBKZZ8!
z%`y9uUcXSdSsO&T<#9$C5}WCkcg~T-x5V8;P?A=wtp}twb9L8;?rn0maDX187=qZ!
z!SHAw<991P@_JTjHCf-$H2G3?MmY|HFc7^`31GwhFShE(JSw8K;Q&@Dl7juPXTE{+
z<;lj6jXwnXo0oKrpPeJZ&5}MsSUHP({%H<Mq@hf-xvN++u?c&UM`D9g@8%|r4(HPD
zI-Cs?LEmJDlY3noq|I|1wrV|z#00Kh<^*FKuE0zw;eKMxdLz%8M~qj8{^r44ay>h{
z(A9Y9cP3W{25iQ_=`_O^Z2mFNsQU7f1?n$fP~FNT$BAIGGLZrqPbz3=Ggg3<T?x~e
zyE4KkN6H9>u*TY-`Dcbzg^M_M&b~&Z$B|{5Nkpa~5m0lGv-P|E*+I@I22xkV;%g3e
z#!h>XIVCHk`*v+WlLZ=apl!RssZXa1JA=s4FN*g(7j?!1Ll2B=ME}t1qvCQw!+2en
zk6_!J`O-*b&wi&n>tJW{ytDQq$3<{mlC&e)2!}c^HN3V&5&tMVx9o;t5QuKcjx46x
z|Hk??SBcyLUH~VK9}-+fLmD}^`_s+2#2i6(TUWx76C;^A50a5)i$xe~yy98;C9rd#
zkRL6-K!Kgb<e#%u4h!t;9?OT&EPwZqIWL=KM#1Ix7VLadp1fKecj2vZw{6Q?tulB1
zWBO&DvB}(d*?>~L6|1|+^E$7mmg$6;C3r_;xtKwa=bv*c6^fw^GJA%LT&+X2GJ1~l
z*(@EIJUcK@*5=OxYv*G(m@8(3Y8h*cO-xs)Qe^Uc&3M+R7uL=~l^e}S?I(BNtuBHF
zdJR$_r-*q4rt#iQ+c3e;F^&Mw$J~t|ioXeXUUR0emKsxl=i3mDLK`Wg=k-aiUR%DQ
zfS%og_|Vi9S3CDe_UbA!{!;*s>T30cbG<wt#qVLU;g{V{B#NaHxie-CoC_+F()ml-
zx#chngFx^~dD-jS|6=`OTww+90g%$FRbUx*nc(eDZ3~(!UO&jhXQangq>}{iJpH<C
z<q;!wLVaeG;(RV?*s$1G5AU+d=5DyF2fS+DUA|_4F5I2ZV-Gph#GMaknv{)F7;KO@
z&igBA4d9(w3Qf=3_-QfNSPn1~c}<<wSKB)m)gnS;qo0jZCPH66LF!DNwSCkjZ64;%
z5WT$M@8o-xtK?|7#ZrY}o;#6FXDMb+7;F#?S*<h~deBu|rRX}D3QZyD#95&=(C@ov
z>LIPj>RlU75TRezyiaL0C`4%XSU6h6G>w3s$Fo~0@Agi(XfniWxITEEC&o)2Y3YHA
z!Bql!#_Xxr2vVU!_f0le_-qL9%yhCCY!KKp(O&Sb+2?#*y78Yj7ysf-h$eh!Ci?s+
zI~N=XK^TZ$sS4WR{ukS1lMYg1TMy8X&0>_teBwFx2CFaVBI>B%X)*FtQt0j3Os;#C
zn&*=j{!-G(DmgU1Ra__~&xGx>jyvA$gUxVj;n9(N=&@CBDsgId7A1wA>4wHF6XMBu
zXFF)JI4?Ocj(4AXPbSp``#!*KyzvJ7<fX+)#?;+T_L0P`K*S;8KD2~{!D_+H*VN<i
z6Nq>1Fk&H{Y;KaLx5V!Q>E08^-<eHbt5m5<Xu*W%se5gu1X_rCD%`4T;>}8xd<ugk
zdh3lo<Ch;;FK7~nlTT+XU&W??zK>p<^clUKTPOwqAd99GSfu0x2Gcg^bS<U#!$|b~
z&HssGHC<Fwh{1Sg(?(QlDnJTtaMoUY*}pN?@V40n6yLjHB4};^ly2|wU*SjDxg{YC
z!!Ynl&4VEBe=$D5o2fI{<^UbT5Yj}JS9dShEQ!}L3ED$J)<`OPL}t|%p*|gcbTw+m
z`<)5UtHb`YnlTbh2+;hs?8jWObzWGXk9$JmV3sM+?046zL>3Zs=flDr-%Nz}+4?P8
z)r}XyaPC85uVR{>AUosF-59O-J7RrCq#yt~Sp<X&Qj?^BtmeZ<Ar=E}1>D)%+H7_$
z`LItvL2f#70v?qq&>!At`|?H$hdh}Aecd9UdpvF`)aRphKVnrxralu^W9z&nZxE6N
z;SFB3sRGU6m=M(-mP~wxe?3YbcA4~iII_|QmxqxQNdUt3YzhvfxdflD>9rpkuZe;q
zY|o@9jAv<TM;q|m|9!IkieX*xMM$X6N7H}CHw2+RA4agmY%A2~J>OP~wG@D7JH@tA
zPKhu-bJ8NZ^S;>Ml%3HL!ypVpS1Jiy#Qux*OOMuRu`_@#*Cv3G?WcR>72ysbrAP8B
z6;aE;BlmS7LEBjWY%k#>g}dN#=u)Y)D67xs2)g4)HofI87>8l@x}(sZUCcaqoBM`0
z0o?czxnG;KKs!5xxpMX-G9nYIu4%IVJe>Vhn?Gdz8N&b{C#@x)!TfHYHcz4@7gM|i
zdE#JJXunJr-`Tmy%G8p`<DXGd@<vdfS<|BigcZPz2JD^6^!{VF`pf}e<W=f|FV8FK
zwGG<hb0^_?)$TI@H_&9uku$hPFx7JIEB8{E9IUoZ3&69xc&g=7342_hnN|RkC!V*i
zSvJ}If~Es{jU1|k7!tq@bPa4{lN4x4&kq|LWbOF|b8N}RZta<Dq&h<^MbKeqd?UHG
zP3#Hg)5sR4kE>&Rnx7UIZ_2JL*<lcdU5Pah-Tz|mqm^i#4ss6Q>4ZAL2raMOwk9k4
zErwwvD@U-e6{FoS{ugEl0cn~I45+s8XL4A}NZHOU;?KNVBx|<1|73-x&06FwAXIjZ
zBj-w#n*>buzUQumd^ae<m?h_)fpQDDxUSU43q+rF>`PH8AO>{#j(0b9ppeJ&jxVn%
zasuSLF%d{AX7q-TXI&&{^geI4*dEV#Ci}ofo_jz@O|UnJJbxT&R<csJUjz+y5Y>5Y
zi98E(qGF_*UavhQba6{C3rpDfmm`~b$Qg*tUFnN3zj*~q>M6m<ncV_{&+~aD=V#?+
zB?W7!2!Y^R4r<o6#dz*2p=~pjJb~fq+6sS`r&iZ)a{eI5>6!2dM?}}NZG@B@!JXzc
zk?{tp(?f!YVJhDp#H2q(Rh%&cw7>6ALZQ~b>i#J^8&rv55D1^C)wG%WUu@xlUte9;
zm;*>5DF(;+`Cm8Rbr)=ZTbzyFg@}+>g~r=;Z+_B#3NUJzOMyN+l9)p+O|Z-oi@6Im
z2;+^hM{yG1bF2f7FwQ;e@k@67h?~89Q3&{)O~MyX5bS3xw28*`#qlW1Y@3d<@*K}(
zFePgymmKELnMHXuQZ5n(zw%ob3ljlA5B6rW<vu9b&-d;pX+CIw&X!O~IB#J46I&Yh
z#Q~-E1JliFluMqs7k(biJJFXh$>>#%+=05{Oc61tH!@ofLK^w$8aQ;;>qr4VlgS)&
zf89g^e0H(RK3cG>pguq2Opn?tsLv0{4cDmpCm>yL9($5SJ?VmX%7kCN2?0OboO@1H
zy0Yz<VR~4v>ID28N<f2kwiu!C-w1RSth2t8fS*0Y7k`YH4`pYR10e_l(JQeoD0Bad
z?bkdL$U5}^27`cQI(;oTVubw656t1#cZ4y=<}pEE4P%~LM+V>AjxayhKbbVX?Of<;
z<(&fZ`C96&gF8XEpB>{}B~qR+Kd*?rkV+8dXX-196^pX`ytSeVI8j|&`Et>7FRRbp
zhb$s;aIy;k$N91+yl60Zj(2T2g#PTENltR4sdWHt8Tr6X{LIeP?S1xI_hIn-O~5_#
z+$b@Q1b_pNo0B`CL#fc8DOE#J3DYwX4=s-2<NAiT9a|c7mXg|92^^o+YEsNx+v9RI
z>EVF3{@m5xVfBUnykVfyJxW`P<zi-9n4fQMyeYcjXovSqQhU^ZP6EQ=A#Z}h^QKl`
zZRM?%uogmo1}sXRCd4C_pUreTDy<Hrt@MIeBrF1p&%^~b@jO<)|0p}RTZus!h_-|=
z3DAFI*FPQ>>%uq%93df=Rm?n$o3Z$ODY>qs{Ul20Jb`Sr-W`&LLbvL&yp{S<2@3aD
z|BULM9G{JUF|r-2*XW{f5c*x>BUZWBU>W*u{bF$XlYTJ+`zDx0K)@i_2p7qZfQ)U>
zJk?ndb+{Dda3Ihh!^gV`)ldoOvl?*77D+v}%imw94fS_0k9}A#CxflpVh4I2eg3^r
zhz8oYcmHriija1499G{Tv_QGOK|{xG9ePkR)ySpdqiF5;dl;$2b19fbm+vU<qu|}I
zlbqf)jBelRUJTX!%Fd?27zr<!53(nsJjiiC_aKrZki%HnCY>a$<N?OWz9(EN426x6
zBSbY}u1KPq423Bbas8S^eKNh!6)dj=mEi62`Mc0XYY_X@k%~MvQiD(Cd2{*j@<-W~
z-B1jJu$6L<YyZU_KR7B?pJ4#2kxDKT+og-o1cdiBslg6wR=WzoPUin5LZNm&JJSg-
zg>6xYA}kP}AT5IZnf=O+Ur{J1BFPR|@W6gME`AI$Rc|OE><(etPF7LzxjYGIf6mp*
z-EFcjig?3SsPEYMO2*fdXYx8pq4OEx3w=i+vj(|@BWJ^}$o&$V)?g)xH*Ag9@9^6j
zJgsGrA_QCAtlt4Tt&&v<j5Q(=p}y*Dz}<DvuW=olHDImN-$cd}o}AT?>QtfAL9g)!
zg|3&K@(EEC3bm&F$+c({dAz4-oguNSp3%*9%Fa8p#mu!7T3wiZvt~;ZGGL>whm`bJ
z`@=>fssmLZ0>14e3SIajm2d3z$|I+vIBsq>+sci;Udb3OMQ*n|MAATil$~3$gD?z3
zw-f^*Wd9p$KB_~nZ#yyz&<qa;VnvqTP&IE%aGWLQp=c1;&!UJIFmJfYJ#d|-DC~1Q
zMvB7L;s3{iF;D0=@W8G1DvgaSC^qDJrJ9@G+_o7Sn^Pin2)kn)@bKW!nD+KCB{;5>
zBG`|!q;y!&`PW=7M$MHj+SO8K-NELpnNkv&jedZX*D$XJ8;?8A?JBM|=<JCOpqIkU
z7nE9JY!3B`yVd^lyxMgaVzi^FWt5S_=GH2lwoY*B?FEJ&+SkQSwwJqLr6NR1EV54t
zRrRe8Bc;zlBSXmr+s&=c0hR`7`7N;})k)(8-IEnoA7@Fpx1b8c#BZ00bMr|PwJju~
z61VS|RMN=*DED`pBSAMNz%7*Vj{eMEaY1JiGEjs@$PfX={ZA}!+;bN+l4$u(=xGL-
zE2-)S8G*eAhJIM1ePwrEl$}u$gFpyFuhh2-uD$=o`bDhR4(tIk*3se;Lh=o@^qm@#
z0+&#K*a*^v9)D7VE20nyt)mn!>mtvz&@wghDE>4^X{|h9Ig%D-pP;!trX{W@$D&6-
zT5Df>CJ!L7^-Hz8{ev~}mk@chvPD3OYu}7pfS|ceBIf>8kK9{dWwe5>9Bcp9a&Pr;
z&QyUf6Q80&1l4UJ`1ffonI;6)Emg6c9!n(YqPBVyMv(QiT;a7lT})dT3Y(wFOT32K
z-Arr)>1pN7ue|5#R`n|BslIwF7_y%p+sN}io)o8F0@G1xgs5<Oai2kSKMq+nlDi^a
zhwig@0c8LZqNk~mdeILd4Yo=s-r81y;JMZMc`GOuX39|L2E{_K+*h}0E$ILR$$emZ
zssj+o{fJ!r88!T&>|Bx%hG7_bB}AH*-2Y;*@iR5U$T@(fUF74)vUG#45>gC@<&c?w
zSck=r)2s$KZtdRUSb-$x)`pHBn~c%puoN8k7qPC^)Z7P3o&puiXvx(jyr|dOhC&34
zGGaQX`{7rCro7ccqhZ3pO#7?z@vi_d(^?X?AY6-AQ>7s?5hEbCD=w0txsxdDUgPOY
zt-V1F33YbuGui_<c<xXe9=&0AY5pye9G@?&sTp*}PGXuJhc|T;EQ*3<xXl_gca9xn
zyL*_!`z#4%8_4I6mv*$WOv6vXa#L`p1HAiaHAvfl&e9ti+>NI>_b~|xML=7jBxKsh
z+*Ixeq8lATs#o2DSa(_H!gk86-|JDI<nfHMk2m5Hi4Ma+%DpyGYiG7m8#+oK0Xp@@
zlD{cC*CPgD7zVEtx#YF~V*OKzBS7U0po1QPCZ8?&NqMYzM@L*MWyNG{E8E2w9&|&5
zJKvIXufkf~6BPuwO$f2l`O2yduEUAB75~yx5#oR%L+Z^s<RFVOLq@qp89J%{+*p`b
zih|n}igRnKsb(;DvmC^^KN<ryveI^w&XkoI7@EA$H<2^Qx!a!q9w6oJyA=qWz1s_!
zG}bkMkXr+Ff9uG=e2{Q+*=LC{#JBs}YH4rvxGF_u4zmnMw|gv4B#OIaTa~PDyR(d%
zx6c@cnzA?mbG!u&n9wYMbX(0-X=#+Q_F?6v+#k)coHM<Y1^|8*l%w~5<`qIS6s4r!
z#q3mqaGS1-Y-TN@)az>|T2Z_Eo$ciX^-8$_<|gL|v29gY6ioJ%2lJ)ujB*%+VHkR)
z#qFTI|Hbx0UPRE8Z~&{*Rv4uA^G&*wbT*k(rof1-cQ`bYC5~*jYr=$sn+92MJG)vm
zKWOis=SC2$^|A=YWPhKtt09SiiLjNJ|5y6~nh4I&>xwDn@B$`6`Rwd2=`U>28+kOP
z(5xAeEVW7;P2fbrD15fEUMA++&J3f?qe$kPH118iK-BBcJMT)mHD>i4`9Au*1B#d+
zT3>(r*0VDyc-BX{V^@hA38dqE2WmB8-~IrKUQH?XZKS+hmQu^7puVb#cNqC#d&G3Q
z#}+a9U_0`voDG)J`N&J0T`3N3rM8tKcWR<v(Jz^Apf`#e%Q%xX;+(2}9FIu4Ypgxo
z)*$8vP;j+aDkd-^#N0SBJBo`u9Nasfsh3hX>3EEHS2`Yh*wZZ8Kk%dM+L9oKLC~4B
zO*Hqv*nWZAbUK&=Fnz}c5nfO<+aMyO_DdMinUmfoM_sWHqN;-4rW6GPREpOS<TjO5
z$=<7asQD5~L@W8w9Nczk0gJj4?>;5m<><qR5V4Xna1r~Git`c-s?+nDHl^+QRuXP}
z=V`rpH3zqSEgDWxv@0GfMck-yBe|xjYn?lk3ONal4SKEi3FjwND2#m2yO_GB*=vV-
z*^iL)%`TJ%T6ty(Y(D*U!qIX8HJ^Lm&9S<O*fevRki<HM!o-;N&{sBV6$ow)@7$bV
z5L~{4;ASf-M;D1Im*e=L(BI~BNYquy0KZ+)ymW_AML8%a!52r}quLS`zkL|%Vjhfh
z*sQ<AM8A35Pvl>!okDVwo4IW$R732ogUiy^s~(rSNAc9=)7EH8B>$GyXQ1#;xU^cL
u-F<^~t(uK~a%xUaF^FTMpPO2oVaH{opOT-GmYHYA1sDK!<)V^WFaiL7zyxCe

literal 0
HcmV?d00001

diff --git a/demo/undocumented/multistage-solver/cpp/README b/demo/undocumented/multistage-solver/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/undocumented/multistage-solver/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/multistage-solver/dolfin_fine.xml.gz b/demo/undocumented/multistage-solver/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/undocumented/multistage-solver/dolfin_fine_subdomains.xml.gz b/demo/undocumented/multistage-solver/dolfin_fine_subdomains.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..2a350b80234ffa631d882d23022732043901d2f6
GIT binary patch
literal 42459
zcmeG_dt8)d)@2!968vc`KPy2iG_UNMn-^|r@@-+JpQU0VBdx7=F}x)r$fT6ky5CZ`
z%9<C{F1G0knT07ZBDG5P6SeKr#pLoSk*hewBrwh}^PTgY=b3rmmv`Qof%$&x=Z=5C
z>&)|<=RD^*_j8_?&~;sIVgKy!pP&85k(ZNZUrNhbJ^Hr%V(aeE$M&tgzsp_cf0ucG
z=eI_@oK?L0`K6ZogGc=K=#sEE|33EFE?@p-cJkc6eQanAw_nJ${d~x7TdOypiLup|
z>zmKj#@Mdc8?1Hqh5~y_PE0F&Zcd4@pU<^li)l65YmFI}WPR)982c`Rd9(fc+8Fy!
z&Gzf%_Qo8$CCFgEthXLFSapV00C1?PwLYe`MrS`)Wj~|0n2h%8rped!_VspSjKyeg
z*rm6WR@rUg`s?3@+FA`3SfeJ_){tUoZ8~JImFsQhTzk{e82hz?s@4mk_DgkkOR~WN
z2<7G4uQV=dy>_|4-Wp^!AGKOyYElgLQrJwh-fD`m)#$C~lMNXF(bj0uw|rY=uPN8J
zUeMX=4E6xKO@A%La2~#`8hWvIWNNFuOqW-7{DpG^8}sXXr=D$EQPK2P<ja-`iCNhN
z-+n&%ViJ7Q@L5sr=PU0IIv4%U+PwM;``N&^BGVVdJcS=E$URnirpe^|*dY1XB0hdO
zZA{GX%76T6<!fUyqcX>(eKOy8(zL$m4<W(PF)!wrcC#nLOF5=e`fNdt=^Q>~eDVqm
zG|`6(b4=Zv*@uhZ!w2v&I%Y|ZDS|y2mYy+9gr}HUTXY96n?FeVkF4&wx`RXRtE~Qc
zS;nQkbval2L=8{(^vO0dCCae0{KrK#riqfL2>k4)x~btCul8M$acSGB3r7Gjz{jVC
z?Y*`=bL73RVFnw==6e4W!`3Jtc_R1HRgSgIbim@+5`QwpA53{DeP}@L@vXXps^8jA
z!#DGOKG0zP;1G~P`IH8Pn)h={T}@s2(kw>1;An%^)0({Phf}6hPkaclTEsW+oN6C)
z{(|*%)O$zYC=VA;x}oO}B~N8ow50syMELomd>8r^W&t7Rs&kt7T6d5mw8l8=NbvBQ
zdvgHCP(h3*oB3Qgg~mI?G0i(z&Ng8WxoZBv63Guwe2QDk<p44+MFWZtuSjV5>U7be
zFhC2Rt(&fz2>+VePRkG7k{CW(|Dk{rJhAy|2!J4lXnvLL-nbAbnCGCJ&H=tyfIPj@
zaRQdHirL6GmmLHPE{qE>;&};p_MaOq?At0kuuzrQ`=#1uA|W1s!IuuEFmf~;)9@7d
zP&j+>wG&dtrQ({RMavgit*2*aY|TA5XKl*S@~rc<!G%$_Zvsy=*jmDuud;6HyQSvt
zMqS;g@Utc6ul`w7lw0%b#(B#Yt_d#Fmu$XRex>?OW43*DPFe0hO8O)Yw0AbHkNGsy
zWG*)jH&k!Hk<l@$b94>U%@0S6E)9$uAA8T>yZ&=k-}nFUwRzx{;I4mp{E679gHKO=
z=g(j7e)sEHzgRY9#o)ZvgOiOt&W?NH<Hw(l-8p#bwA2mLQq#631%&Ns{CH2}fA?87
zrDAZe8SfnY{l#h9^A@i<9G8D|t1fJM<-YvPo-?~PwY1*3X~Ud=I#br8;ZvUN3dr_-
z{cK!*=EGO|{XBhj-!0|(^`=f`Fk;^5pz*JUoh|9p?YBJ>X<QSI+Y-><(Cf;gd0p}o
zwjb^VTP%<5e*}J8p9`o;k2QDdyAhxVN3;MYJ)a#~5@-)R5;*>kVP|W`mIjW0hyVT)
z0$$ehAbj6^$CZBX&s-gK_0B~b=VV0~zW%iE`J{mUCwpD_$<n9Su#&(N3qxLyn+PkX
zM|ar)z~`MEH~+KSBSss}mRyeb#j>6&V9Xf+mW^ZcGp8&dWEW1%KRT-O>0u=yDH(Ss
zr>1P(QHj{rjq7p%CYPr6yk|I!Z%DXn1pW?R)=>ZIM#F)A`o*_Khra%2TrV>Cjcxe*
zO1}qZ17&Kyc<34Yt-DfvsOoaRD@cUL4<&4`C$Ps35!i0wgz_<*x+P$TiN1ckh)^y7
z6yHwkx~yepKtz|Xa^|eH0O~u#0n0U40OPIwt&3MR($xMoPS)1%U$gO#ZtV?wi0E?n
zpXq?Q3}AG8_LpqyZ)eih?|+i8f9Od(`{$D?XV3fb2x1pF{vMoAx%suRFvPU3Z+i2m
zft`MZbg=as`5bHxDBl~GD39H77yKToe`mVw!M|E3J-d8(w<28h?6}AOc6-|Q=4m5;
zIA1>YqrVZ@(Fk_iy73YC`$Xp3S%k=HMC3}p33D0b9S;!lgEkTJlVI>nTeQX8_s*vL
zC4dh+fJoTQ)pxHL0XWsAG<1uCv2~`1<!@|5P}VP&{aA)8>Rw)pADGO>b%{F$0@(D7
zfV`9IVby3u<_sDWIDYbgvlmX}tr(F!^Xxe3XUz})%rU~LKu%l*cE-l!#sm>a{&}6L
zJeEL%q`;y_x9%9YgwO$zK{)05XpSHMASr<1qyP-m2ZWIA+3xZ)0pF$rrrq1VIkcpk
z2107{kW4mCCI*Pfu_|^RAp;`D2rS#cqPiJTn+k@q&!TK;eZ9t!2*y;)TomxAO+y%r
znn)SN)i)?6qZASw5wV-+?q!67GsFk6alQ(2uqyG>dedMNotYR_hlif_eV-L0q+BCE
zq&7=v;Sbv8yY;EZLFXa&o$DcGE$xkR+Sf#_AU@O&Uy%trU%NFkDn0r8?TpK9k<0Nj
z6qUkp$W3NzU?qK(5s=Jw2m&yQ092LSOC&Q^_aK2P7hlB$v001e{a8kjJ>b<gWDqoD
z@{<+u*yJDX@Orm07+eNXyG;IJSa-QxdPF=KI7A6Gz{&MrFj~nZPkT2GZ6I3}bo91w
zh?Fv+bH{tCf)D)riWmH=0z+(pX(YxLXvAG>HrZa#RJL6{>Z<kQfu@abFiqE<ZM8&P
zl0fYsW?WXwjn#dDe?yi9GWAZDAy8NbZV37o;$edu7FcX<HM{y2q(ztuqY_UBNS%Up
zrn-^{4a(+%tV*UcRi`yx`y{|=aM~p%S8O}NKxt3b-~guPQkZUV0i#^Hvbqd#zG*rD
z{CibG!ZyspG%NEt@LaTHuY=^0?U-paMn3dMqb#eXwnL^JG`A-cEjn4*sdzM5K@ulw
z9Z<I5=Y#^)rT&s3Gf3$B0HN=16Asj^TufSC<7OlMQHPjB*2=#n-e;#lfV`nsv_6DD
z%TAiHNr)Dkc&_A8nV8r%)P>Xw`Do`Jg-g<g<06>}?!d9qREU25SypHXyjw-pU`W+e
z`5IHqrLU@DBKKsOv}0JY?Hl3-g}(QmpKrJW0K<Tc8g=D9764>|D^8!VAZ>GbMYM2@
zV!VG4M*?n*jDEoA)^>6slLo@c2fU(0%mbcKSI0LjS{NHa)<Y663B9aPt#Zy+>=H$Q
z!Zs7rcV6fT^=N`g7HZ-4V59K6m`rsPEz}Jk_G#=2x;`i(AgyJro<*7v8)W$AA+@15
zI$)?v2CC?$c2E?JVS3wmxIGlT@zKJJk@0~J#vmBSm?=v4UUe(vMMC`(Dp7zs+bhIM
z>Ig=Y!zy?A&=t3=l<7_nR1_1gTs7g+in<k2h4HZ!T|Wq((J0Je5i|S5@l`t?Bu-Me
zmMiUf1jP=vgMKPMU*^}e8!c2LKOA~dCm}vlPo3Kx)yo*7?LH}!+D_j|Wv}h#Wu`)c
zeW=+wDC<02@(o(x6OC%)CE+K`UFygK#Rp88u;5$f`nOw^6Gq;|9;#}^j~3?p-NoKQ
z)!)q20zW7*W89Pvt4sg8b9hBvL4I|t#d?qJa9tgH>IYB3pWtT$;ORH)X(&9Uu%{95
zw2M8BhNm;^DH@&v_Th{P@H7gZW=-$4_~Fh$6+O3@S3Murf6UVjJBJPF`rW40!3$<S
z(WU&Z!uiMJ#;1MA1~xtnSnSK5vVG9<QyVwD-epqBy3hAKxO9HE#QiWe_UVT0J%07>
z>VO5uPFWA{%kKF;4I4ni=Dxs&?Rb(_SoAJi;m2=jg`Kp*;9s*9dVV};`N=iUOe)EI
z<jWT`=FEKJ*mpGS6B@RYhMoK?t+13<`1?zQ$Q)Xs$7Z&|v9otY&VTIKht=cmo%%>j
z{+<WFe3=lLN5h_=VINh{3TJ7BibohCZx_%CM`(o!uXGF9-+u{ibjRk<`02f-jv|U2
zqG8oEY-BPal13}k(h6@@(F%52q1R}ndI@gy&J#gHhji_~h2cBDhK2?1Vl@B#Xrjnh
zw8HSGO6<R}oS6k{pN4N{!14W)k2r>)COic+o3NPC>>>dgM1Y<f!vLK;PJre<#SZV8
zC4}l0LbaZ7I97)=dvq7jtk+ni*@UG;v-fD&psftmk1o*)Q)q>E#}duHqZRhi3SYj8
zG|NMpt=ft->lHyX`v(m>NyGLpBSZ>lg|BFZH?PtPDYU}rh|ZyBiXTrKSbd@5*6@n_
zZ1yAg1>^07^Go9r-!JOju(QXI)OVVmI=t?YJr`puB0L$eFZ*<5*X1WSHl3ge^nc*+
zKOvmY_q@M9r4w@a2MB)HkU{lZUqj(ws~(Sw18hKwrn0sCp!~G@zhH*^>>0pr=?M|l
zvG-0Nfj=4tGd7Gb+s!DR6qbifd}_^xLdKA82N1^wRh+K;LWP6d!TkR^P(Ac-n28!{
zLg_7D^V|sbG>M?MgG^{Zg}U*Ba;H!8vqvfUegNnD&7AL(1>Zk`iWvA_dw_)R*#x=f
zZpVQ#{<^tA<yAx&Dv!v_;_*rMs~N)DN-e7yumBD-a=zh3W8oPZR~q!Fni&nB-q>11
zmNsX%s>Kxxm43GojCAJb`%_+Fe4w>_@PaWDRdwCKy)^ezwDckSb)ThFzC?z-W&rag
zls>@Z1o8!huIP>089Zh2dnS1Ui#MVNk=eAn>BPC+!x-P16Qqv9sf<sujd>jUUd3<j
zaV%bcOzLBR|1(kH|D>?R4e@2o<Pk00ScpSV7KXD$M^CI|`1Y8bU?gez^x|yp8_{Ii
z?YLPL5z_z1-g_cj_J1KPjupiBr88-%`rsj{sogp4UPLU$S*E4c)fdt3TM{@%YKmHD
zMx_ka4wZOZk@F{})zPl_VOqY5ORVC|`Nb1+HN3Rifp5utxrOV|lWeo;Stpo+c7=xE
zAu)<Ejc^aQw|-n?3Q=XkhTEnvk~b7{+RNl=-RE04=7Oi#p-YhCJSArFWo5*{SdAE5
zAV)6jBhPfcisz0lE}c7ZW*gsDws!2S=p5G`a6tWx`mN3RL{QGUA;kuE&cFrcM9wSC
z3a%Dho{>##T|3|%h9rtGm%UQj<ADMavT3)HaMj6<rD@%UbW7}fx!lQjzotAa6t>-R
zVA<iLc}<To>VsxEZ+tL_O#`Ow&*dYUg$}LHg;l*&8g~Z-6Px=f#>AJcWd^4vVlRCI
z@|I$_l}%))&Nm!1>Ma^K)ciIJL$)v^z%wIkFmh&8#SPfkPoThI6z9xWdNIj}OmJ$-
zwX(otZSI3if>CiKkrY{n3}UKSXv&;4PI?FqnX=(W5VF@v;zWeshFt(?vi=tGAER^9
zQ92yXY~z=5Z>25UHwA2GJD1_>Qs-&}SB$j^V)*fMGqYUB4@;pz*EDnbstVoCVYy7@
zGc6P~RLx{Lb|@rE3o|+vP(j2v-l#DJS?HXZEsW~K)U{Bq3Ov$}$_T&a<HN+sjRW3n
zOK!BVk&KsBt!AuJx2Y-}G#t1_=$SwaDDK1`R$}Ho7fA||!eV%^Z6->@mpSBx(96$8
z*>g@MH9*Fd3%HO3t|7dMuv@0Z0fOjyk(6nJ0BI&<Hp;kmXOH@=g!OTzT!SjW(GgPR
zP^GfS-V>D3L~*;vIc}})1FbVrUqKuV<5`)u^@dP#ghTeDO5F}hn(tfcS-7&lYK$vX
z2ihl2S`D$$&X#Z#nVXaruTBh^-PX*(AWx8`BTm)A-i_!3lOwqn)kC@`zKs2tOok&a
zgOud-#;2K8$<NLe%+7Q><eqjh;p8A7DP>kVF*H*l?4IvaoEF-2TB`#)rK!jlv_auU
zcykyZbxW5x*Gx1Wb}o&1T5ia#z+d=T3<oDTho2<Z<)ykLo0_wNxd9bQqqh-F?u8tV
z*ty(+66!_O+d>(j<9A_#)K^fWty{FzCbjY6NMnE{kRFKO7l%SfA1>iYA<xPq0>z&V
zUd++YZcE&s6vloSgyIk5fq1xZrY3S(&<R<<shEe&;j%ze$ugm(O7~sZY-VeTb5gL9
z=Vlreq=`1>`6S`|%k>hAREQ)#5pp78yLTp#L?NdW6RhqzPbu^`GCrNPPZ+=0dmE{y
zE`7pS-~qwr<Q@<v8jza{1UEDN0h%2s%8Wy@Fb*R6Mi5w~sA2*^L_!fS*3vwl9|zm1
zmg}fS9>p1QfoJ-aZO}I&L?rQv2oVu|B0_X>J`o{0YoCaalsnXQx%!zYG`de1Yh^}Q
zo?&~@(+x@WtAp!JLuNMYgpc&qK74}ea{X2)63;hck@#dKRRNoL6)=VBjDP`_p<y8I
zeZG;ZfN8r}Nwk6rh&c7+8km^*$o>>8c)A`2M(=fZD?q^$;E%hvA_5DZ`@KX&zCy_U
z9k7G#J?dG(Q-ZI280usksJT^pXuZxj2lj>t)&+R56Ex=I+tP}!jnsmQ?2aPSZCb;C
z6WtR5sRdQ+la<&z;C3g-u&&P=sdWRgMS6nee$ek(F9l$U8B#--_o>=&kR?aJOyHLo
z9<1Y5A)Gruh3W%zdoEf+Ut@)9QfbbzGbB}I85fUK-sp)`^>#W{3BEI<eo$b(Jvat5
z#5V-3YFA2&m*}4b%kq4l`xcJ89k4joR^|L}h?~uwpVST9E21P7)u~xChV}rmoQUBJ
z5k9ys;d*`uzH_X2g~#*QP2F@e*6?HX|MCQ(lW4sx_yy&iSMbX{b6FTLi97eBxYu9F
z<6<@k;{^2qPDTAaO_*0km27pl6s%2w;Z{jvMV*ouw=O|s)w$5=Kq{(8YDqhc5VcV9
z!s+#c@;t$MqtPlU3~R+$JOgGXmY3IzOXGM|c}QvwHv-xND70j($|iUeYC?I}wt`ob
zYhRS{o-@@;>v~|R9cE3n*n%MxE0lt(td>l4QBzT~s(w(OTh1GeR%<q}(x<e=G>9vC
zR_?`Yz9@%@Vwal%PG6rUc*Lq&=@Sea{Gi;mkNL^YqEdC&LZ(YGO&O}x_wH)FaTy}W
z6=HxO+SYs_r|zqIIh5Xg$o3sB5fWw5bdv&5(A0Y|$B2lC=o1q}`pOHtrS3nnOtbgN
z2{i@AGR;hTdSw1p?KDS{6>B=oSn*|(LAlFXtK~&q=!${vM}F5JS1`Dvwy9r#m~{;C
znlSh)#RlrbgI=S*f=2;eO&|bT#WomN#Hqm>fRyz(_bohXPRKg!G0LOUZ_^dTyMuye
z0LMWm1-3qXM(j*|amrHQMp>6+;{MvVsPkOZL`A)pDyN>7rA3`p(at7-v0X`uzr3OW
zf!H}c^~+(;mS#UmW8V8TOEjtRHYjl>*sNybj-|rERFAb19j$A87RoG9Fgdvwa}->t
zfn+1e(6$2<(24#!QHqtfHaSTsNDbS*HjJ8>M6;LZ2NRtw>ZfsvAD#pxZ>p3pDaM_0
z1I}3%j?P$5Ra|Hl)sbur+{+)RcD(M9En%)|#&H?cv@PaJN@SjAG1oX2bUb{@OU_(9
zOPVr|e<#<gF62#~^*cV<Wm}$*6~V_mZjd$a1TRSaA9-?1^a-=*5ZQ+)<`6N>=tCwO
z3KnHWAVxZni|}OLA(+5#D=B|#_BbIZ-jG>T(o8jR<v!%u1nfz)Z}<~KUeH;PPAD{L
zsP=iUkGwcuwTNXU+hJf(K;*C#EwQR<RxBjsG%3u0DL-f&%F@**Q|M5~tH5hM<ppFA
z<}}e(L}MPCR*jk@yrN;iF&9N<XtH6=WiYOaq)mY1K3<P`Wdw|?AP`Fz11BdiBzF#D
zJ7nDov^sZMK&)t{TwpwDK66`5=G$<X7-e&*l>eFa1P2SMENcElc!i>uS!h7D!4kyM
z(|*Hft?i;|o&L#;?<!M+T&Q~K4n*q(?+;nKNG1D$E~M<>TsS_3U8&$CcE=@9-VDn6
zk(*fiy@SN+`*cApnKolOrK2hAmBoV>S~^38FX*M<^p+RxhwEmrYshhM4cV7ZGaH+_
z-}E)f8?{u8m0(trXZM-i7VkBS;n*PH<B~Vt>j78MbqQLt4v&^rt>qwc<bBvM;n7^>
zj+4T$TrA14Zebr_1nr`JOf#GVEY_;q&8v889@U<mPSkK_BD~SxU@oX)m}}qM5Beb3
zg(!!^yhQaflt+m^S>rV-JF1s+tJVGh_1_3o%}U;6&~Bo!)H|J_!a)`0#Jh4uhtH61
zElc=+&qXim$j}l)uC=%b&0T)rFbYq-Ar|;%vbz>eN#Yj-HLSWT??h&I(UjiYpx9l<
zyya?*y%-)OQy^6+A`wp_5U6aby7OATnR)>Sm4)|Qp{hT90xBsiS+4#?(HL*31*Cgf
zS?1+xNpehH5w00ZrD+kZcp(`W7Ew7{#?I==LTyR7`9ZZaEKrb*Czas!3~I8Z%9A|4
zPymv2_})mMpsxt8@jCm8ye=n0i-o-2OraPOE=4N~=eZL1gVLfECQdK&bmUrgy&cO0
z-?uwbl*OXXd)~NA(~LnKJ5eV%<vRdC)z%y7POTS0<&rZL$p}py3nGBk3#kaSx4xX8
z9V8(TVkiB-n<Ri1lK)1aN-dm->`e+}=(Jxbpr9+5HhL9B2*q8BnnwG4Y#){=ZzNFs
z0<rXNC2?%2yP`6veHV3UMqnoC{t~gvY^ltF!+3;L4wMV@MQ@NMSj_8yn*M}J;eiUB
zRFKswQn0e5<zCgd1;~U1l~1S#ISkFk$ldi#t=NYgMpuSqq3<q!g@D~Uc3v5#0yXwj
zySa5N*{N2wS;hgHE<BSZmD{tLlSHMbt#Z6E?kTt7uv`x~Og2feGahR)S!%cQBeTJ*
z-NJ3pucEBr+U+-Yu$NI1QEIj^c*I!oW#Qnd$l5JDyf+M8cZw^=ynIZh5?0%3_bp(X
zKJJUn)4K2L)cr`-+~>FH8)n~k_V?po=y4@OpY>m*j~c&D-gsrwqi?VOYTN6wTa}mx
z@Zq&WKPcxLXSCSqCMG+0Mwk?;lf2+Gl==3c|M?XIvv|QNl`x@mPkR7S5;HHJ)I2@N
z=l{z<)!Xy44b~a_Eg^b&k<{UTM|+{sXUX2jCJO<X&(QvohctHfgYv+Fu4}rsq0rt5
z>W2C~v*F_L%CPQ<`}6WH1{W7+!z+W&%xLVc)0M%!<jX_MZ{+38Ex`%aBWGCs_<CGM
z&1H69d1aWP;o63w%TK{HUCZ^jUlh)VY2oP%99>hzyQbmr%4J`bDB*sB>kGGFKE1g~
z3$L>CRfV$HhZmXs<nrK*o%g;wPA>i4mDnwq>$rGa8b^7BH5($i9Y_`J*Wxw;#a{7c
zq8(cV%F<*I230=H1o$x2?r<xwGd%NMgYgpIwLOpVyr)rShZK%JMhEwKVc|4tx)`$r
zN)m_ak&Q>;o=?~+DQq%eV_hP7<Cf^f7QrzNz*u-2qX5VP3%Q{7#o{GMsj^@Pl0=da
zn8mTa3xbyTE;JkCyMS?v?^xm~-?0Q8n=HCj4^$QTBn8i*zwg6DgoHO-q$|`5$nuPs
zPuPlI6t+uW?XLX>Yv6J10nT{%Mk@IEvGP^}VMgO7Jwaam)$i?#f3Twu`>P$ET_SE%
z^%Zqv>LKe`2~wt~{Gc?O-Tk!k+Dh_!!!eTg>av^0_`+S`x(k<`>K^<mvg-llD54+7
zi;mK)gTit2$ng3>d655-r2PG4cUNiz9!7^*8pzVCS3w+vvo5@R;oZ9#;Oz9F3Ep4A
zP{;yCFMd#N-yY+*ujZ$fJ6e^-6=S$xE_rjVj)$!L!sPTuQO=?pXGvjh29U+YP>3eT
zEU<#1J&NT0pfqwLDiNrk?Cz>_NnusM<g(&bGEdmhOK(Bvi}&b)%4KiIbu++OyrKzO
zWkGp-?jp3u;*}qi=dVuj)5;yKr~oTVTV{z~9<KAPB31tYyU7|~=4OC1l}!^oDW7RI
z_Oo1-AC%*-@AzreQD(p@Y)fajYio}`1b<LiQD^l@*_JA9_>y5A{N31&y++x2H#OLY
zuTX}LNngG8I2~Tr;Hx)S`^n|O89Q%Lcbr`I1PhiNrJ0>}7HLJ5*O}P4kqUIq5X4{i
z^(ecBIsBWn?n^aTnXli@B5iz`w6=%-`3+Q{b9Pnx>%Q)i9?rbnO<MPjXD@5EeIa=%
zuKH`9#bsPx-o@7|s$b`ou$L$AZ+4%sV3+*;pj-t1^18mCR-VL_O<B_$n+=w8xwfBj
zVyt#^sIBE(p22o0%WgSSWwYfS*Xvr%cAL%kUX}f-KEraYT;H0}+WQ|%FP^gn1l{t#
D$Qv7;

literal 0
HcmV?d00001

diff --git a/demo/undocumented/multistage-solver/dolfin_fine_velocity.xml.gz b/demo/undocumented/multistage-solver/dolfin_fine_velocity.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..9ad54aff3ebf0e7bf514fde3bfe610cc79cb8374
GIT binary patch
literal 375382
zcmV)MK)AmjiwFQA^h!|x1B{eGZi6roMfW*{<pY3c446ca90egTEfqBpkP!9srD>}!
zszHB;nbDK={bq{G<9$$fKh6CZN==c`m-C@$$D!+k+G=4weIH8wx-8dI9Ixvdbw2dX
ze4WNO-z?EMz3B5nsiM1uX4ybhTQ9Ym`ww4gW_J86Zw>9(sXny+QEH>ry&i7<`PKMg
zsD27$)89W^d-c~I|A){Hgir`e5Q`G5cnyal5)nZ*Lm{aMVTR+#BuIWl5l%udoJTGp
zV8U_74H!bQrnsa#mS#AG<xnYsDYB}t?IgO&77tc*H8nX55nW}Iz_ya8t2@G@N20L!
zA|hGY1P+#s{5mj$WY_T7VbNIU@Z~HDYjgN<Sl+INVTin4ZGvAVlPMM+V-}T7VeR?L
z*iXvqzzAXx1fpn5AuPu0zp*rs@BC}PQGDR~eaZXsJ3+JKXIrD$=#4a*^_SBqc9j;}
zEY=4K2HV@0gvDOEiyOhN+ZXnb2;!@PV*R_*hgh(ETH_)6w0^$AWOeHV$wrF}ijAI*
zVX=QW35)f4D=2n!>*V35c=^I2*!p=TDE2OWJ;M{$&-y9OY<i7Dj2(X*6uWc}&*97E
zOENqi^%@)rQvUD9Vh=lcDKVoP1Y#J5PIRbEIVT;6{Z{~f4us_Bv4B-2ua1)+4bN-f
zTyb_O7OTiR?BolAW>Z?+WQCs@7<~E7Yv2i}F393G%R-y{C4Ti<@7)fnG`S#om;JGT
zYglS|-b%}C;di7bHgH)pnlH#zEU_D-mQ9f5b+x<}4_j%0#a}o-v>x*oao3P)y%x6>
zV?K_{tgj)@>*Sqx@w1zEUcR-Lzj$q2sj?LRq0uCTjU!lj+vT&hJjGbzY@7~%$x?IS
z#Ufv(`=rbaP8f(`AlQ=R3&GoeV}ZOvV8o~aBl+g!)$V^O{wcZxvHoIN+s4m_u(<U`
zQ+g;xH<ZH?**n*)ZoNwzWLDD_X4cE>AhLc13KLuY(;%?X6E?`}+ZWQs+SbPb#pb~x
z-8jPzv^a)`tY4P92Cd*nWEWHWEUuSrFK-!tZ8mJl2NZRA%UrZHSzn&sDH8K7aVU1~
zB3T<Yv&}IN7qhsS7h7>Y(&Aw3l>e7{@DzUe{ZMK~IS_*&5Ixau1V!Zj7hBQ~YudmL
zJ;0O@P?+aGnZyR8LNxJ$RuD-@1I{jEJmx>Z51E*d&4Nf=y^N0>#My|8=QoCATtJu!
zCF6oh0(S9MiYXb7f=bNEte|2s$HY|<P}U1?0Pf=bv~O?LNSo@=?mO)sh7NND)#X!H
zmg<t>!+{K4wr%EZ_2cDmAT<|WSHSH3%GT!HwR_ja&$olKxv+^34^x%fkS_g|2`Qvl
zPOG3@AJ1jpk@~!-3gON;Tz-a2IBuka&mjpe<Y5&`;>sE-Y=s&o+$N%tJWRtU;u!6b
z7Gg<!JiL2iyhr0lsktRt2*N;gO9^@Je`AyTV;LN%#BZxbY_PiyeeYcW-|G9}0{Cp8
za!EIXV@!5#Q2oE}h4Jw~<pNFmemPS<@7v`}`LNHl@XYyekk;f<Ec<r3kiNlD(=+PB
z!9Vf>`vm*-=|cN-pi*|{+&RMxh|-M^@`RiB+U*LL-I)!8*|Q!l&$;>t4_4a?3;u+8
zIV(f9Np!}KaQ`qAYRyC{sG8#bd&FldWYEO4gd!3Ub4VMQMpjhXr=q{Yw1gsFsb&J<
ziwxG&@t(W;A5Tjt5{V!a<HbvfKEi!uh%fG#!V1Kcl9u7c(-nKl(19yTE+X^HZfWB%
z$}9H3<%1EQ8-x!I-Ky7kMQK?G_Rt(>=pKv*t}W|KLNj5JS*R1>{^IK&lJrNp86;N_
zf<W|2fFOAPi{(ug`9YJaaWy*%k#4%x`S(d|$5{<e5eh4O4gkl+h)V4ec1_cT6Ru@G
z_P}-_VYA_E35sy0`=G?9l((DL!3}2tTO}BSY!a5(H!t7cee18g(eLX-^n5-fHl~~k
zHZI~en3-85u|e4+>pgJTMc{5fWT3)DF*Pe`m`%**`?vnuFIESuUm??x^SF<F>n@Ho
zvf<7GDu;Ppuwm{$9R5M+dohp=cm|_`jKLI&^>FYZ`QHPi8uCn5QVj(mQlpMy<c0Jo
z?R_D^Y{M;)@;Kb1y?^kd)u1ObsQ_JExUqte_915%1Xm4wQi9EM$2~HQz)2qe%Dj)<
zrW`plk6<?HJ$*;DU5w?5tr$!op*alA_M!IA-S7Lr4SnK|iJoQ?E`mDuxoqqG(`l{j
zIg>Q&KvZQsL^}7`JoO^&hC#u&q5+pBVlYSShgcW?TXY15BLwMXdRlx#_QmsjT@8L{
zH8oT~j55~)B!1yGS3_S-*6I#*#`uGkJuWh~E-uj7A^z-~yPl_cy_3Hvx1t*hKoGVP
zpn&YZ*p>HjFW}`O3lM{pwkZDwt^zYqQ411t8Kco%{bE3TQK08)Cx5l?oRNV?8untK
zT0*OGB{>-v#>&Nd8(M3ym{XZAD<Rzsfakie$>tfP!YiesS$c+!WoB347@W8c-VC@)
zm94M{OubpG_y6V`9e231gFKUjNas|2e<Ttr$U8ZJO_hvx&#9FAhyVAz9csv9<Q6&&
zH-~HNsqpvjenQpStsFeU-l00aQv3H;)nI|E3eIftsg5`F7ra<c#5+8M3hoT7!Ken$
z32(Z*J_8$MSgTubc$=f(Q`B28H5ugBia-XOp{>YG$hDWlAPWU@P??}Vm_(F?@VZ9`
z@0(q8s=du~g7=}leIL^6)9)a1#hiR>m_ZprW@*QqyuW`4SDS|vgyj$+cd#$hblw%c
zaK#)*4hCc&FmxW<`p(*5Gf}GW27o!G6$C}jRl207_rUdyX$9}kYmJAR_uHEsxK2|d
zNqM95tZbT>MSq{M2{)mMex_hLm@?=!zaCfqetrF++zhT52tg>=lA?n4-&ls60_K1X
zus-C=A6EZIj!u)-iSk$)X;@TruDAVAZ^>w~LEb@NrnYt;*=0TijxN(UJ4C0tJUErF
zM*7f}`iYz{a8?s)9+)A$j$^I2Xpt7vOsNeZ?>iCOn$=hTHzv{}Gz~Bjl3Gg!o-o(k
zY!8utruuB3*f9eY+<BXh{B~^D<3`LQ4ft(X-Bsu|AXC#r<cN8L?g4%Pip17_dBS>g
zk|@89+r(~S^Vzv6dB{=^o3v-dr6MRb**N4&dk=dTwFliPZO<L@*((EY{T{H$PMW43
zd>oHTboOh>-RvRu3H8>ttS?FX2T1cD=&ipiZ)w>SGpugIr#Sm^vQobsB=LTQ<FvOZ
zs+NQ|A4X=xsYi~J7P4XDcZD_!=bX#t<>8fm6d(Yi2R>EMj9iRsgi{Y3_1ADhbiL*S
zEu;VCCD)(e$_N7VV5W270l<Z8_C4!A9VOnfFkk_q19SYDhh`@*&qFRO{uSF;3;K(C
zZCp0)drP<)IKv(~Vb{bDyNlGv@1?L0CD)SVPzVCABnpD}zu0tVGeH)S3s|ox=pQ6M
zUq0C~_yi(DeTGVm;zb$_r&)OpSOzMt#ROc+lBv-aDpy;8PzT^>lT%7tXyc31>=8TR
z^hThgY1sYFS>BOIbI!6H6*wR5g7TL|Km+krvsMPvPZ%>5lUcX0?-}*fyvU=<8gc^K
zVn-3-9*r93MP4`~1r!8ksy1>%cWU;0fK9L}_zxmnYPQfgxtN+p&zU|B5FZRXaIVOE
zX>>(ip)(^}z%>jGyh8zt^FAOpu4Uw57y|m^`o9D?yYaB(-MlD+A&4v!v9jrI{6ClF
z$>Zf1gAijzc8am~#uu;efPtphn4~jexEzBuVirqd7oW{325v>jD6-zA@wqu>nFr;a
zpQDQZ>(6hc@cL{Tx-G75z9uRQa=V8^-hYWPEh|nJ=(i0`sC0WZ$+CBfz7AKwL_m1-
zs%-VTMV7|HSJDEnhf;2!k1sDw`hNdA^Wh2zgCGo!hiAXHE7~YTK3f6y2Jbe>8!N1i
zMwz)kO3om;f)E6vS5g$w`(G@NzY6kGk=?8;OQC6+9{*lgey0YQ2JPnR#08=oA_}XH
zcyHV359Pxo`C`xe08*l3Ww1?vOnj=TJrk?K17i{`D_q<9^ro96xvx#%9cdB`D*&az
zAZ)6qbOQJN{`85gXym0XoBOUH^nLc0RMU6ti53<zxi44Im(FGTmUs&R5vv?qB$erP
zIf`5}Mj?Kqf#v9A)#c*6o-Df+{``<=U{S6T0s+lj@a->pLSe_T$^n<O(6qW|@twf(
z-5n*-z_OfF>6}W@pcPLZY<mwjyV8z+(YpdCnJdjo3$bRwJny~?cS|)IGfQKj_f(GV
zl|DWJyj@CP?Izg;i@R7zIcRiuZCB6WC~vb(<q)EGg;1bwo&opMo?UpY@a|jmuD~i!
zGx(G#gjnw4Y486`O0=#(d(MCb8>i7$O6J`PFV#gs#b*;#V=o?aT1vWt=)a?$IiOgc
zc0R8-`xci9BfQJDV#f}QN1ayzVp-38M~U0E0ygX+Lnm7&I`pPK|G>l#CD)QHK?uTb
z^a=$<?tihD%xZ*L$fCCv)pnZ?k?)mrKY^)Q<s24*Qi&clthSU~q1kVgN9@n<oxf#k
z*#0TFvJME9DVXF~(=tzaXH_Y)!k-R2MFs&+i*mNc!gn(PZ($!uW`>u+mP@Yk9hL6b
z3MyV$&lKd!z}<=tZMYMW%*;XY1w67zNG<H@ePZgogDXP3UqB8MYQ}1HH~g?Wxgvw`
z;b0Y{Z`qrFzZx{}+zJbx+(Ls+vdpb!!%q30vp|cK6Z60^!Qb(e_*|n!7^#^saMUYm
zbv9RO<gX#^!n0o-L9<`n!NxrY^BN%XJ*MH0LUA*Ayr{&;WTO}#?=TXnl@~i`hM`=b
z_9+e1csEs4Qa1s|y%GQMz40PJ-oy7Up-TGymSauPJ=sW!%8^AHV^>pf69}@Pbr+@S
z4yy-U<AvNI7G9({=JS)TEEeIkM$O4x(XAYj4ubE)>s7_~;i7kl#X&X=NAmjYWO141
z`_x30J3O{k*;YZpdQQn7?e|!SrX&mCDIjg=<S}1qSuy<jyZ<S<g5w5Y5Vn#H#>V?E
z7O9W6z~#;?z$FBOBt*Uhj`s?r3~M@f30^lK_CBvQ8d-b*v(Ul}HmQJ%`4hj#jXo9{
zWA$PL0u$}A>NerN2acNNrhSES-bFH2^+5W2;ON=}?gRuk=0dbon~p{*65DfB0zn2)
zfaM}?lti?#P|6!_8_)d5X_`mWZ3K>@rh$$v=aO*$`6z!2;x_USRZT#zg$f&v*KzL6
zrPg?L(Zk|^$5Q|e4aGh4(y<XWJvlK}8IrrLHeze^%m4nB3DAOS*c9E6kX_XN_kU;8
z=w9LN&Y%c#xZlpq>D}|E(YwNP4Ivw6@!qm6*2X}RWE@-6gwTw)%~d(bX#|cBPSAER
zK`8^U5oZOUF*l-h<&dQF!jEHadbMjde!95613f@jL!p5~N(OH4wj+(!mBY2q8oa?1
zmAw7&#(%P(WG<a!<12{rB(XpgZ~So4uc?mq;*Jh<xU;cxHTXU?<R-f~;H4fB;J}li
zPb0z6vU1cFOiU<?sa2Zr)FVEWol6n~AqYdSr1*pTUu=@zOw-xOb{5u@Hkimm|0Mi7
z=<vgV2!vyT=oZN4{$j8(EH`#Bk{uRd5K!zw1{dzw&oy%>K+0lDS0946?^&4Re5PrH
zuiy>>vpi*BuIv5Cd7}&Ld{93P`OTHcpZ7Pfj}NbcFg6Q1UdJkmaIHLKaB?rqVq>1O
zbq>4TS85+Gd~f-DWlaK)u%Gzs!Xz25!Xpr$Ye71sD^`ER*eu6O7wG+5WL|}H+*^k^
zBl0iifA7Le4_RRnta$*Y=P*(VEB7;zaTS=Or|S`a_Wv^0n{2rqHOHMJ8DIxxuCOWU
zr|@U<Jv;`%OFpbkI2t(?^Hx~4Pe%|u9V9DsEA*>SZBcm8B9kfzU}rz@fUi4BUf)MX
z237FgB8qvK*$CkYh3C7la(TBqB%?RGDR$Q?zujL&F*2wED<91_r4{SNS~9;MID;xk
z3rNlcjDiIgwMd15d)7aOs9Ojap1O(mT7?ZdgDQc*I)o?|0qL$SO!rCR1FDd354I)t
zxkSWU;oY6}qvQ;ZC<s9q+LFk!xcxWw6aNXgKm(5Bh=9B#DuU2^A$5pRR-)yFm(>@5
zXk=9gTO$^)#+?@=e;Qjqjamx4ZD^j6L7aoqv}}K_qLEeEXl}1)g^OBA90S$0MpVVb
zDW2q)m3x&B>_Os49xLmiTggXCjEaX`sSG~CBC2vYEynY1ijvKCkplMzj~ZbWp)tc^
z3PpugwL8|IerWVqS-uERif_str95umpv!$j;NfT%oy)Lxm2yw^8=N23pFAgxNDemN
zwZ2SMBdu~dc{~q@x<hL4D}Zr7d%S6cM^O|CLAN8PQiHp%n$twAkm(bu``v99>p44v
zEuTOzp|xc?!d3PsC+PmPUn8(`E|?&6!9a>G<c<xR@(ip{7S0;zx<BLro(^^#ffcMp
zNzL=TBx`fU)<4}yt1Me&5sf4;&Z8J6eSK0+Bd$VO)Qg9li1D!kR18Y1NUJ>mQJ5e=
zuxt?|_G3A^tz5kz-U#Ybr1%i{VA)7Qli)&6=kyuD9n7QcK5?ZHSNTzPEmsbNFsvnG
zgMt1VTWR)?jK~2ukVibmUrCH)zQ?EIG9nczSCFHMH(tdYbvxQmRK;yHI}q0QN#l)H
zp%)kl+^8*s92Grrp&=Kgl@2d6{I>W0gXI{7r16HUAh+>S5Su#I4{b^-<a|+D;aNEn
zG!)0&ODJ%#aOBseYl-RtmD+xS#F3J+u$d9O3SzG(38hp(8$;*tSy)~!fo4*U$jMvw
zwhmZA6f%;)RoX*|rYjG0ABV`?J^D4iAKoB)axvB6)1j^RJhw@^@JOQ|R+vOdL);Ea
zbl3ammC9H!D<1zBoAk_&=*I^VcyDLHtQd@t$kLt<E9zL=6=JerR#09}4oEvpF@8vw
z?0bev>^EWz@#di=2GtaX=F`HsMj$H`kur9V=*^?$G3LIP{SQH{aA?kg-sYlPAA5v?
z(``YFakIoen&<~I=F}Ybq51pK5aL#7W^`mdTGu8oz2FyuT3IvDBRI=9ILWycEcmjJ
zVDax4&N{evw0Y=(&4MYm(rZy?CI@e*5&Ic6<~^OeoBdICZAT1%AZ#T?K;3__CVsSs
z^g|Z#)Ki{GxM<f?DC9<Mv|lakJ9_AS?B#`7LCgYMPXOd5nKJdn-l2rrBz7|iaHCb$
zQ=Gmt$o;<Vh%_$5vUn4=;ho)blj(gd>aDp#z7;;Uz<upRAsAM;<5*xhfNtbAcp0u4
z%Or)-w!!_8;%~%?Z~o|+`V@sZrV*|}t?up}aU#nWsh;Or*zql|Io&C1hih&bl3$q5
z8{sOj(R=wgY;FeRsTuSxCae*#GD(sXI6fkRM$!T+3>1!ZAe<lRKVDi}I7=2Ad7sN0
z;VR@9AsLa04`TC=L+ynv$Dg-gC-le?`0x~Ljlw|Uh*%*A{YV~Qb=Hwr5;1u<LJ_h;
z7@-}$XJ?5s)c~Zh<(Tv-Y%u}jM%mrW!S}+#v8|xE1wjaali2Vyey8w^*M%fdM|w&;
zUTX<{UD)o9V51H{*WAc0PPLo$UZ2;9Sve%#Zfpdt`Nu64##Tqv3UPz@8xs#hC23Ud
z!m^PPWR%DwX%1nwB|SSUn4d3Z<wM!IB|8j*Fmy|P5bW-MV^?D4wgcn?Hqdb$2c!5%
z{twEd|7_7!%L11?!1X5=n3a#3B-3+;E_tb#jk)l6CWX4$6T~R#XrXNE9v)l4pOuSU
zlsqZca!weTjpgRU{q%!<3BNcuMx3yUUC)$~6>il)T|<FqnyY503nH*y+B~_U^O{OO
z7R;FM>llr-yhC#PWC9w|uJOAS`s<0V57?tCN(^mNRvQeQh|*mbk>ayf*23F(Xw<ko
z2#J%d+8A;OJHjkKX0usPPTAT&Zez^iJ#Opamj&8kU-A>4y7gQ<yrOfH(nMX}1T}Ne
zc)gAF@Cqa;^sa@i(qS5#*v4uLy(ahQV+NDYd`Zl!w<{i9K?{UucPB4RU;=cCiEE75
zAEQs}U^hKS_e4&i4nT<KR!AGM!kvMZb7lgf5mYS!T%qvfm!XT2oS6-2^qQVrp)ZlP
zyp6hy@utJP`pw4T;g$RFj-z2%0i(5|7OQ_f74b>#`rthl$`8%wn!6z$BfWwW!5FYf
zZ}825>-7!fORxM<c1Ae@gCG#S(MAQ--v44dWA<Z#AGko%SPByv9)F$KIrKg>;gZ~)
z=j>_y$-d^jD`bI`$8luOnAGRcR9!odePbv>dh+sU#%+XzcSl1Ge^)8n&PhqF{%ibq
zuFN0ghO5*llT^QS;nt|3-ncSxrb1&Ep3i=COz-ufD-Fh#!Bqi-m(tRml*(yjHS@p+
z8ls`%5ewufBni~W!xm=G51ZU%Nv_Sgyhs(Rmr!%V=L;oN2=p1;T^7!vKKQBLwepd@
zuUs0BSe<De_|y%LYC&VJeIeC^e$`AivegI)4}6es;;m&OMU0(d?P%l6`Gy{?s^6Py
zKg7=_yjuN@y>Eq<ipc>kl;txL`Rmk~jOu+Wo9poi4p@j{o0$Mw|9IZFLL>K~d6&%<
zjmEk9S||0C6(T>CeR<SQ=)m;XS>w{tgH{L@S;mTwLYkGUHA-`EuJE#kO@9KUlhL@|
zFV)Cd*|Zuz_c;r6JmS$gV^4jshq@lfL3nhgXf@Q22dylEP-VTf6lNI;+mP_yxq^Hq
zbA7**UCR{&AqZ<pM-=J5u}!=Idw>S!%})rB1iIr=xD@}1y7W~%aphk8YeZJa&|6b6
zYIWg<XaJa$Eidva7NT4pqc`%i23Z1%f{W5%9QHwyZ%N~hLuIFLGY8#Eu4&@r)kzTI
zxhrQ<A;%}?*fEKVzlK~;Jbi_>cw4EDGy7vRw>t0Q#0rdN2b;lSd<kqfQmJ1S1i*<>
zAL--SiN<QCal28HFv$z1wC}U5RhbRo>Ip38+M>32)0=ao%_>?~hRby*Q=ZrZAs$dA
z_a}H5>lY5=yF+7f4h3~c)b?3@{3?;Xg36AAc?up*bo6iZtO9q%P!urtBT%4nPG7D8
zfjoCb>E9<@;%l3RT~X3D8bc4yU0L{KdoC(>NF_{hV%BA^;>jzlZ{IdC90kq8;@Rk^
zc&inX69EzJJoVt8ywrFX*Sq4<*g&7%-t!la=&F8Q3yX(<*PnSN+Y_l7W{rdAi7OL;
z1f@AwX?*}33C!1ZgA#Zvh(PwXejwmWUh!mgZ%(mbE;i_vu<iR%b}mU4g&+*wl3vBn
z{x{Y+_N0X#;N%UdS6)RTNf_8@mZ-DN2X1b><!1bl4jxl|;u(49-`%_w7}r?Y2qrLN
zC4k+$#IN79m0qk-X%4(rmS@mCH1BS+m7`eJCu7W$a6(XUKcIfcT3ISJ@!KuOT-9QE
zoDb|Q#?S%t5=}|?kAGV}ao(Jj$=HEylvo8c=GQp?T5QERjG?Mk+5X$QiVkBdAK3dm
zXw@gc5$BnZkiYyTVz<YN&@U|JcG`m$N<z!m6?RirbZaO!zN*@9ZH7NQ@^SB%l_}tW
zN6s;k2(MS|q48nGF*dRDsb|z&@1dN32<r$d6^-~<h>cpbk=psVo-KxalB7IwW!yWI
z-4AQ*=$hYA?G6Pm7OlDMVISX@9)mRdY0FnET!W}R|72`8V+Fd3kdcbbrQEhW!7WcW
zvOkoSLvIs4|CWB4#L)fyk>3<IVWlkL1R(^51PVuY-;^KiA+j5lP^xyY&cWu(%^J8c
z4@>O)#r8Kal0Y9F$duZI`LuZxRyO_#s*q_X{7`l!Nf3h|@Jotf^#325Zs!DefYh9=
zDMJLL7gXMX(Ul*3s0FNCPb2D<;D29p2ah1k$FT*ha4Lwpp0dXHbRt$PPrcH<Et3+_
z%gmwDB{ofk9kv;dkD$-xO=(*v@Qw02Y#}QsVTF^%iQgwD5`yy`uR6>MN@KdUD!Mc-
zAJ7T;Ew-qYE!48<mx_PZL+GHeuw%jAk^EuENf@*3Jj7PTNs1vBD5kYYYwr;OQply^
zSg;&V;ABJpNAtme%FmNDRovX1hs4rJilzpj#x9f<PHu%h+CvBwpAUt~uNNZOR-0D_
zbc}15pdO7^$V*OZg@O-*m=)3~L&BT+L6BO&3iZ_cLLc4njh%<kT;5e)hx0)H3o|y<
zvV3{rR=SWuEM{d>JmK&{k4{>l&Fh*c<EsU&AQF(AQTtI|tvxPd3+Ir<tk79~;2fh?
zg?JYRVl49O+HVi<jDognl4~5a=4Kw<uEUwZGT7FhC}ed7PaK(A*ksFv#Y4!o(zix}
zDfQP13)`%>>6p+c8vUc}46YysK_J?aih$|Av1QynERX{<ke8<sfqZ5-chYHT<AV#s
zK@)KT0&8gZ#+F{WmgXJK9uf<&tYv+N=^{l?-#ZVjkjfo|x!l}La68TVzdZKT3duv5
zSAkiw<oO+~`>XK|f__$;LUY#E;bbIF>*5dWMOTQSCxuQEZPe)rV{W{$?{30HY(QUZ
z5fmVjmR<cwdu(M`2vX3LwipD#$K+^Ke{fKL&>Jr;r-#C7j&6;(xr1*45}}E{#j{47
zBy6m3FbA?wu6*zbizd#WMx%iA=!ykQ1Rg;{T~hJSjf6g!1HrQ%|EVltc@eYwqi+gN
z_IDmZT->f{Avr8BPS^Fl^YDsbc<0DkKM(C#gfy<{;1C4$TBvs%x=sfvY}Uh@S6u<s
z4v%2Hb4--Ac<KS!^DBUDERz=`EHW~EEsZq}g`Ubrb8PG@(v*tc&LVqAT1g?fB5+Th
zY5wEXVJY?i3p(@!0Y2z4Yxa4bjl<^&mJMrFJ9m~A?CUO?Y>n#g91s?Ou$UN^4`t_)
zWI+f5!7C{(qW8bpkZ&^qY-HaH!}bGMRO+7jMb8@9X%w(rJS+T=rsK%xy4?S(k%sI9
zLEq{p8!aGyr+&r%;Qd)aql85;Mf=X0&^o@-q3|BXMgfa&Eu?v#Qu}E?rRdRCV@<^B
zrVrS6pAXqQ_8zqy+nC{~V425bE8@ZpktqxF-Zyl#T^S@czxF}3QGDDQe=UI%{63<c
z`=CCT$~UmanHlvfa;e5b=RyP_H8_4>5>dZGo7jNy1fxt#>t}<CtI2!Cz@Ustnm1;Z
znaI1EP@{kaXdTLS^R!nan?N)w^ijS7o(%4pVNH<Z*LM|<MobX&LezK)-l#+rtp%~8
zanMo{0cPTq^>7<UnkD1tJ8>FeBj4)df4|0hIEhQ~ZG8O<tF>(CYwx@Sjmi}dS|?9!
z@<ToBT4ZW$jcC0Bio(_yCNOgHfE$^46t2*@>~le11}^2L*WumVMw4=7t>qE-1OvZ#
zO~?=P@9H^C;uW6*TJZe`&XesVZX@kD8C4=b7h4aC_P^VefBZ+;xnx-kf>3Zv2IFu4
z8*9pb6CeZF0G?yS02Y`3*P22gXvr1zG%lS1#oJ<c_$j3P7F>DJ?$=~iy-vf+fIjS}
zuoZq($(BxT0M#uLiu0rJ?Y!jCBWUsT^NObZK{Y3TQ&@CGgKabph1a$<eTz{clyKaN
zkSftg!6pp9!3DEcJ^GA8qC`PV;#3tqE%|-0)CxsRjiz2*@M{8E9)%qiT2arKw7qVK
z#}@K0T`XTTc48}hxhql0M5Y<!s#d|Hz1Rw>42)Ahgqmx7Kx28+PExZA(~|Tw(|R67
zrSjLjC0AxgzU)HM!nF~KyLr}sSajv32&91^jm$f~`L6;9V$qc@hzB(q=B{*CsMw@W
z#<b`P0-!X&@@j)j?haC`1<Q_I*&3wk!9!L&PFK@K-@Ik9o;{~p<(2#P5%?q_kE6}z
z+k(0}payi(kiHIms)fC9{<maks-%%|N5;hKVC{Svb~<?F(#(*ipIrXaT49%MhKKIj
zRXPH&i2Ulz+qFNw(@q~(3KXlqD*7K~XOILj2m-+`Ni?JR|Hqczy{wP}et=4uU=W*`
z|9|zWM_%CoA}?IfBr==`;|99w111Xm3Ti=MtMs~GY&z^fPFewA!O@wcKh6I>5-?T2
z*wik%LW1CeW{}=`X&$$O$a~qTHE|WWS?dvnFs#=%W?4X{{h*)+3d{e2mI1wbVq1VV
zd-pRL^81JrrM0m7rKxs?rFA3}5X47Fpk+<Ps~%Y4_1(-qAeiIF-xsyUdSY7uH^p=b
z{zLw!(@3Ix^<B=QKP9U6NNl6Bm7e+Ffy0Q9Z<-$U{>~L-!J`B94qYMn2GRt+VO(_8
z(*SQhsdtD)R27r&!ow=h`5(-IYNuGHL3l5D4d)+7OIIv);7z;sihpRhq5vXkt&uB?
zgTMjYG)yYcMF-W-K7r4{TI|I1Y`2CO$nsU0nf*TqtZ38;g8c2^P$<UaTlHSLc8*1K
z%RM<*4bPNh0Ddqtt{r4~+IW5?K30{fsvUKROjnqU<>G$`%(7=AmsJP7wWBPwMCcZB
zRsW&vT#_URK_Gf1OAAWxf3e{?n+7&;0lR_@HNpJY6__Va^&)#F3;vzZ^f#GZV`PJ(
z#uxiXJs8smzqmQyJ+iEzfx|tKWznyXjbrsmQeJd>^>w{iNN)13-6Mo_jP(9rH-S*k
zV;OUzYPy{R25AW&HY(vMWE<lnGL#UI<=~D6R9;aVJK<J7xFD?9=yXob;JsqY;Y52#
zw%L-1Hw{;JUET(Q8JXRwP~PA8!A}DjdKwGoF@qdz8{Sw5t$S?fFNuZ0w{=dou%U}@
zrYS%@;!y*Gg@{Mn(ccZ#UODTsJ|R+1VL>+!sF>eD(wpjAzy04}cLbnBghfD1=1bSN
zT<~47z7+cS4Vlfss`jIe8hfy*|1(bO|IdmpKkI3LSWjRP+;TY`tbtUGPa$;<od))b
zsDW2}cwPjH8P3nfU*|`h%W(01)r26E54F))S%OAr5N0#c&!H8HRE7E*x_S!BM${!T
z>Hpz)$I(J#KTC+Fggz(MKN1v^u8yZOXYmY{kI&@2Ld1%FhcJJXo!gB7AqYiVQW;VE
zZ)`bkvK!z>8kl6zs9f$N_-hra>>ryKE4=1}*xDx5e*tsy{wqSn`gNG-XQp_9ch$HC
z0~S(1K$@1F@RCTI1v60f1eS&x)Q(}co88>W4Rox+@is%7hl$d_dwrqv&Y0mWl;Z@W
zIOZ+ZP50e%M1l2c?_17uSgZ#|c?_-aN?Aq<HhwRM=djpujJL}~kfkFL77AcUaAAQm
zeUQA}l-!J~S8Cw|3%uu>Y}<3|NDA$Gm-DEnur%`E5AntuTmA&!oOjNYdKOFDSYZw#
zO{{O~8dX#KeUzi>hU$Xf`UgW_E}Jfn;0lYk0#E3}F88}>8_5|%c44>qs}K0Y7Vmbb
zD<fH>6_)RW#F&N_L~q1IjyRr$v&d6fP@1%^zbUSouD<=w=v7Z;5xinM$i-1Y3X;Ww
z7QQ?}neBfkm-hO%4E)<}?=|*BmdUu6<iI85p`ZMwe}BPwE(`awmHCc-cV<m9?t1_7
z4A?0uB(Zn+H#2#&7sBS%d$Ev*YL#dJI6st~!4U)@2n18Q)fF}W#E!muIrxACtgS5-
zfuRSchu#-f_~a=jqkfz{Ss#8LqE@E$ye`5{O$!!ueNM!0ogJr@$UIxxPEm^|r?kJ@
z^l!UXsPk9|6F(vBem<TsG=CfQ9V1_%8lpfJPslK-?#v=RVfHq^FBHf^&4wv2i2MOl
zm|wMv<<G(coO*0~*F_*(D6*Wg777+{Fn{9BCyeywFQGM5BI2<L+Jv#+LT^1U9I_>?
z^?`yMyB}Uz;c?gt{g5Ri3x0Ka6xnc^BZLILXMSaowY;7Nf`I-zj>M%4p--4BANoT~
zIl~CO73}j~CMIq|6e7`Eu5I*eVjm~3a<(lXGPLACO|c*w@fltSCa1u~?@sCq9R(_v
zbSOs_atGnEY_h%%6$xlYbW|?<jI-uqNN0xmVL<^OT8H^%1pvtW*xU_n>JC7JywcFN
zl5TO3TmG13I3#vD^XpC_A^v0$qqUp&SRpan+S<dmf=CTuxm`#kg)MPLzK0=>FJ)(P
z1W^bA(UjZ}%|Ef>S#v@D0TY;V{K(pL!$of?{tEMuypL0lY_W&2I#kW}<}7dgfJWqp
zIC=>Qp&19h#eyE`Ky*cU5Vd-2i}`#jB6acscO6>-yT=1oL_NG^?Xx8VeF)A!WcW3|
z0<Rw50%r&^@q9~ZD`I`}h${8?7E1*h+NS0%%#Vf{k?aTan3tFb9M<iiMI|uQ_J`U}
zJ-}t2t)!#eaHt$Zx2QZ^^YY7_u)Z-w-K|TF_0D*(=u1*)(n6Ff?6^k8jQnn-dU%W7
zvKef*&;_e$n9;VG?|W)><A!Rdwc;I??Gl%VCExbc>b1O}b0DrF=lxM&=hJ1q7+M5(
zPto3yhU_05org0!rgvz=3S!fpE@co;&0B>Bw*W2EP36E8d_^~x=Q~l4Zn0x_U_Jsl
zbct+$BmcX;?_%b5U;*%1N1UtumAt?3;1;1O85RN$U)@I;JRffPB1dBR6!gV1lOB=V
zBL6}>x}^^tilAqMmn6h&$#>24g14BRq1)UFONRj~vgP5#|F`#}?2K|42tgovr7EoG
z{V!IYP1*?kz@*>X%|>K^VdlGz%Q%2m5oKipF!hqsdXT`ylSbP@P~L+&$KJSj=U`+h
z_Hm}uf$v1Za&<nqo%|Nh6mu(mHC7o@f~t3+EYe%dASTf>ViKN!fYouLo%EJA6pEe5
zl9ooF>*9Vpxh*KO`p;p8Bf32B>!VI%u#?=<=iCBc{w1D2Qrsw0m!B-bM^?5qJqx2S
zCDUek{gqF43pytb5FH5YiGz)-$63FYPksxdc4~LD)LQJa_j=dN0=Wf4R_!}T_=mhD
zS<k5_y~WWRM6KbskRt*4GYgh_SHJ?p1>-HR{k*Vzko-#N?}CbA5?32MU3-WiE|Vy~
z^&zF53>SR#D5|G!zl@m;PFMZOfm;1)LYLiWx3`p7<?1+x9a_pWDr{h4!UCf80MtV>
zf+?bxelK`@8O7DlvIcG$cf1#PNPb%CU}(E|-LTbwU--lLlcqyv2G)c6q`9o^Wy$`*
zoWG{*?@QEATNG+R$QY)pELNiOz^HyC^iA2BB|!{=K=evRB<TGwHnj5-S*q{?U5O!X
zJQ_B|<r=Cx$+d>Bq1C-seZCk5E?e&(?pSDp;~ac$7LpTnX(+@XCj9~7B<9Z6H*sMs
z;29P6xNl(a<PJKlgPmev7j*YV3C0p0V)t59&t(XkGau}Ax*lidWNQICFXH$FU7Cg%
z(yDOJny6}+&f&5?#wY5cV(8)67m5x>^GEiJJ@^N8*{+;O$qD#p+<ZEN(t7etPSOQP
zCyiac^>*Eb2Mb?)ierOz>S<xy4q)Z;fJd);M$3u2po2QYSA7YZb9lH@>XXsQyAUy&
zW^mJqPFm36vz|8+({X5^jqKRo(Y^bt@cQ5PVO^T_la28DCzknuElwu7^~hwNOr}TM
zgiNKU4--|0Wh#`a)HOyvEKx~ICc~*rw4P-uZ#uXkp^?c*CPQ_NnZ6KRe4#vciR&_w
z#qN)iGd4m1hGF1JA&^+we=!OQ3V5HqfG#J$C0F@`eX4@!KK_1OPBO^uw+#c8XXA`=
z8N^rlHr8p38B7W3JuA<tLU{K;L`~S`TU|}`zH(!P_~uU$!kfDyBzNC|N=I%Eoj7<`
zE`sDb-yw18uECJ23CuiQgyatDRpye;Bg%X+<UL}(7xFQCH{RxhHj=vshm;ZAI~b7<
zw@5B>*_X<hGoyP48(>6tP||K9_t%&=C1zj)Fbu-5mw*<^{(o#27=;HS6udMHRN9O;
zt&4D9xVD%D;eC2vXyeqag$jpmp3r4-;4XC;#@DKJ8OHbKVwz@VY+>;?$jB;=0GH`|
zawJ%PsM}+(_v$hTaMr>X2Keb$Z2JW8!Wsnl-i0&Buii1+x$(Z#!^)A~qX%bjaj@1^
zIDSjN%sYnepdU9KoWF~=AcoSbV;2Lx-(pSNdt3h^gVQ&2Av64M;Awu!%)kgh7=(c<
zi4d>uznBAf&m{}=Z2CZg|6`b6|CRb$uH@_6wOq-sgXYv0jDkjf$5*!z-=O!lIN<yB
z*xY(6&~^!Juis;u;jKVjw!Y=dJ8XRe7c<PRpRCU?y5*xg9NQkhX%4e{`LlYom?59u
zd6sAqD1-R=`<ycjuPQiZ32p(tV&m(}D_)ibU&6V~=S98zUhrFk*f-pM2}o?g{jsKn
z-8*<A-t+n{@uTdFZXgC>7`jU*C|pU>{THj?kM?ZY3q%MaC*;-Ts6i&ZX@nu!Yluv+
z&Oxsy7_x;C1UJ5?e%gewbsYp1!EA=c5XyGxbHE~)?eE{eP#7|IC|zeTX*2Q{gSM^@
z-wJa!osSj9Y*~8VVajH-&IGa<H^?O7YwRsX6?(x>f+~z{AziO=&M<FR=~ScKL@{;Y
z#fYtb`o<LbxWR}5Q`fon5zKZORbaOqw-M`ow44sPuS?p{(A{&qJo#tzR?~p?_4y6s
z>alx{bFMY+Z1ch2_O?Yml%3HH#2^eqS0cbsy#HcHKcgzfUcgEl11XQtqpVvkw;XRo
zd#^tp58CXXbBOUX7RlUlj5AEnQ?wO$|2+1+_16d)maraiZa2QZ3w>6|&BnLv4c*A-
zj^T_!pIePDBP51CC)J=ZjLoPT6oyeB5K?Gt-4IYXbyL@zFuGwh5E7uOppjE?LsucB
z(1?YAmZhuI>xRw&KtSQ#x=QI?y*>t^gsbZ+gmD{*uC2R_M3b6F-V;EL2xA*6gtF*~
zCX7)3dPa>1qo|Spl%3I$1R)4SbGZlrMKu4!j-Ee6w=e<9!5IX1`}Hx(_0@gI%EmHc
zZ!n?w;?K#D)6HK!@MaUFq66%O4qxYV*wpXCR}{2%xN^a$Ou=?eC?nQ~O^H?|1h5R7
zG=V8aI(K_}*r=!_hj7!gFu-EmRV-GIx`|oMM(5!H#9-2u+Q<6+{EBMU?lU)dqDn~h
z-Z9lX^cA(NgA}kfUo!;o2{6F*ThJA?tlD5BMsPeAwV7;!>a+Qh%_YH~woh-!I<F)Y
zS`YcvABDbNi|#*bGS_SLCQxO-Mr5+KKIlNLKAfy_3B1V!8hqC~ku2kp{(W0t@1{>3
z0;~p2a9(p4d#YHM^+tIrgf6OJ#)3$f6LH$^TVUQ8o=t{-qhosWZiSxX7B*s_JrkG}
zysUJxgcy<fHPDLUR9ZlF!1&Opt;1+@I<am`j#w~-90jifpkpb;;~^FC6eA#FyjU4H
zF*^nNp&^T+RGJ^(pndoxGEEA^)5LUJaD;-vif(=qHs}r0RNCq9pR#jFau|ex=#}_N
zaQ};?yRt}0f*G;OPDO0%19rboFL`;|81fKJj7rag_&1-;R+KuCZmOGlKHW8TN6pt*
z%U)+TqfXEQNe_;V$F6W$@o-&??u2V}(Sf^nI0ebyJu6Hdf^LHzq<s|Zv18<iz*d;L
zl>}(zbBAFe0QvH-VYgMLN~PmC(qo`#l*sBh9k1M0JY5l5Md@l<TU7~{BLDr{wz||V
zLMj>^Ec?&O^{=qE_1eVydfU!{LPSG4kF|T)N8Vp9w}+|O2~gX>G&hhB^^0;%?B_23
zdp>>QehX5qbQ29%gx7G>cvt-AoB79cI>wi@hJeV}MT>wM0O$|1p(U#q`t5GkEEMs%
zdVqXAY)hTqwA1>WMhSFQsi8Zxm7naL+_X^rPp1FEG(v2v$9p_%a-7~2dy&n-o>bK`
zHEPuJft`m|R~o}k9*EMMst2#md}K#jK!YqaAQt?RjvHVZ`N)oP*(!%9jHrbu)DlIq
z`Ep?C>IH?CGz;u_v`IVA=Kq_2Ka`z`Z3Qt1L@P>U@JT`GzlF@K^rbb#5pKZpq6Nm+
zo7c#4rTP!4ytCAc$QqS7M_cY*6SF&w>##ygp+*PYB9}@avGkf3V-BV+7`UP3uBUKY
z;`Z%n#tv%2KCW0%P}NA-smLE2+SpUA(@nn5x*A;vTC5Kjp>R&gsE|qrBU(JyX_=aK
z3dZ?mOFpg6NAx4FH>ZOI85c~-g*{@Z)0^`3{32v$q;uD3Or-XpL!rdfyx8uXE~)6>
zIf-3>%FskRI8E5)6sjHt9NMw0+9Pu{Uj?Q^CKQ7GFmxe2v4=y`{G})R=cVn1(B66I
zXjAwFxFJ_~Bo?iXR=!>BKy-X}L((e&32jQ)M$r5bsqH}YLU~;tqG83HBk}pqp-<s(
z{fhVyfwYs!ZWTRq@)wTmeXW3s<ADV)+IDv9D{<BLFl9$XFZ8iPWkro3DmSd}^5?JS
znCK6WvO+GGhb9)h12q3k+}>dH_Dx4kuKFn%6?yUV<pZsDG3|Es2KN)zU&_t^2VxKe
zf?rarMgIS>+qKChLcN0zm_`K`tUGp;u`BV%eCnF)-*@jsd1rRQZN%pgx-E5D?1&G#
zct-#AZaC3aJii-miQ~l@oMT;)S@c4gS%;<6wD=$LYV6G+B86B1A_`e@JHBUpSL%;f
z7KsX2P2BJY07fJ>@zN-^Umnla=U2xXmt$)D>&k$l5poo?SAuA4{!Cn$si~_VdoMv%
zMWO^0SqqGO`f3w2g?*5MGX>!!NFBCHnen!?idE{o;(_{Ig|P==#Am}CR4Avq&@Pc&
zFz-E|m}V1OouC;=X%>T3U$}hX$#|gLdli7A3bipEz?x&mh4sn<N7!tsgclVu5L%;o
zc22w$ti?K*)5w;cH^D-dtN$PPI2oq50i`(*Acz#kjcXVt9`}-5vj2tDkQ$Kv=b|3G
zz|s>V@6bks$fQXw(FdNM``Sr9&d0sOgvc9(&?Y#pIXCbgZxmqU{nB}oF}+Y;M6kM)
z)G`}-zjdBvuJx<;VjzEG@I%?PAWIB_uq*jNl>1+7lXm9K1GYQm0**z+fNApg{8ky-
zN{ol6VS-?}C~^<#1fv#nmLPslnz^;X{wqjR^$a-(`FO``Qr?r4di(Vww-i3y^X1M4
znnewC9p9L0b|KYt@dscwLC)PaD6p3Ts)eKF*&MW2qpB=&uOxTTeku#)oAK=AAd$;W
zcT9qddlX_E9>Qp1XKey;(Y`%xu1b{sOBj}HD{i2J`7TMc&t90ad1ed3fF)!rxn*X{
zDI}Rl=n%W@@z||Sjp|bfvgdQmLCg70s|%wl@JJ?-g(>@&Fp`FFIxa^Fl{|7`D|=1{
z01r_b3TRn6M#3iV`3@M_9lygJOzWXdf8cbp75;T30m*wthyn`<%Ccs$Uo|TE%*&J0
zSOrDy+NgJ0mc#$brFz^MUL+DpUG)epauybGyqNRj$iW?;U+~iSEHEt_msX--!FK>S
zZ!Dv$_BtsUSpiRZ2FO&MY6K5Jn6fgptbnFwxao*lanobRVbY2E^kw7^W!IJjF$lu0
zq~fF8|6-eTe~P%B%>^813Iv)+e&2ahfzXM#6;wG4b2+z*0Dn;iGU&!sILaWg`$)7)
z6&m6w1HshI-wTWEe0R^<K;`6+f%HW$W8H?w2Mv#Pp=#L6Q#zr>Z^DmCMqt^!u-CJ+
zMu8=J+lwMxaATm!<#V1zWToY<N<HW=4@RpC=frK}l&Vd`?YQ68GDEJM+%|C%--*l%
zRiL*_L06$-MOjBDG;-<qMT@P3IA%grZX3rNITGLl>I=$b%6=2Fe-m~rnx;;^K)Kez
zF|;a?FgKm8quVp!4L~A$=q#biMsWwaUW{qeX;3>4UiCwmf#S+>-WS-*nDf(}M^TQB
z?IbNd(R2WZftE8*142cJTgS<7&_Rb=^j8kLBAi<{|6APoHvJ*Jk)d7qfKdlBYNcT>
zkc{4wiPmiYzfk&Gu0Io{(X)4O+qNG_UM1+F48$kf26uiv_bl0Qp%g!5ARo%E7|DSU
zhJ6VZjN$(uJBccY>`m0A@-VEi1yU?TMpGX^A+aiPiLTh_LI2D(NCTnEfN@lu!m>tX
z<QG@BVbq>a#Yd%$ZajcAJ!r~vorrX@U>yb+vjvU*fH3++q8b@6PFoFJ+{pHg%xu?U
zjZ62a=jRUw?p*L}OEF_ODJ$X+#?5WoOhQiWd5w$^@yCO!6+-q&+t@FEwj2gD7xf3N
zgeR&35F`C^v^x)@nvIi6L&%bJWUsV7yk6j*VxZBXtU%2<d(u)EziugYTgKJxb11{+
zNpP`3pWB*eBDVNJGxr*Mo@{WSe|DUnNrBL{XlF;3Xu0_IORvyH`O2;3GLl*ZBikP>
zJME89igR`4#+}erjIyyG0G>z{8m3(wb{YWgefmQ)AeAUY05E|9lgW&Np$FP|g%N?s
zq`5S(TA}kywvs=n`d-(3l5sc=Y{aNUordW*gKad<ROJ<C@V7E^V|ks4WgseVWczCr
zA>Q^8C>y&!8KJwnJtY1pyS5|-LJ)Q(K~cQ_#hSEV!a7|pz+kt$19|=QFnhzhxdz1p
zSAD6z0FK_Y_AuDy){P+*fsG;ANzJ|~1+Beygzc)L1~L`n(3srDR5Jgi3c=V<3tJu0
zc#SV9&fK~a_PHW@1kw0jbC9(SK0EOnk5-rfowq9*Nu3aWNJr&nDQa4wqzx#MHI#W2
zTXEb!N^oDRM4$6~MPqIFMa@DyXL^Ypui(!-vbGtDWkJHKoqLG-LiAPZ)AG2|Gm&3<
zr>mQ(|0{(b<bI#N(na2Zqg(oF#KE)Q+Y(;A(%ZRTt$)0)dKD9*7?QhAqCQcGNe*VT
zLgF7#CB&o?H@7=Y*t6(@(+Qvw4pt^&uM_a&c{nD8xlKTo5JYHPcvMtbZO1QWg$TJ<
z>0aek!NA0Z!i11P5^d|ll%|px1rW)A!PuT`$qTV)`v2`0r6oW}$csgc4l4KGf<;Ue
zdqH#{WJ8hStlI_ISnkH_`&(o3q3qg@EeJtaOQML-e`7b<zlF1RqyYvQ9zlahB9SPd
zG(@9eQ`+Q8^rzN|Mj}t{;;1LL0heC@!Wvp9HWz@{;=GkRy0=sA5gYxFj65VWgR?h^
zYB8ql$`cz6wJi^Z`190;a!<~6p_1JHWGXUFHc7y<p|Am{48PL*(<bkDlwesy?R4jO
zQl%buOp<^lz$!m<Sc^N*XPuQ94Yehay7<~)Wap7AT+01@yD5^W{&NsNh|mE`AKOSF
z^3TU-4edVpl8u{9ku(>hLBbP@$0{$l%Nu7*@nuLjJDejD%x86e<uqic_)_wTP}Km^
z9gY>HW$jos^CjU*2wS!7yDX!PhR&&L<K-?A{5e6=isy}{yODs?zI#9lU{Pq!)yjas
zVHY9rCHqY(8So7*VV7g%)&8g(4NK3&?LWG>+jR$^$v)-DOdF6_W@_bB*uC3E<2Bd5
zQ2JBwyVxO{Ln<HnBQ*2AbxK39zV8vq9|aCv_IO@ql{BpU#Ni)h*OtRT2m-IPJk;g>
z7wgP6X}S;-`Dyw^tW_9r27Y$g8qYZ~ouhPb&3T14yqM<l<WgE(*pe7_qMz7We%B@k
zB0h3Y01FR(%hyn~VLFv2=bEe+Ijf(gBg3@Lq9aA2Z!15bO{Dr!C7X@^(6X2fM~=N@
z<hg@2cs5v`@}`zt4t(WK)+^GdDuZ!tU`|Vy@L}&T56Aht?L->6U37XWaMFs!+$mnM
z16kMBZ~~lsjH0xa<;6J)joTUsXg|)O(G6TAH5K9E0+OP)=SXNhS>g7_ugnJzAU|ZI
z2q8M7I^;$iN%QXEM`a<6hFb`7YvN!>wx&z?3qSz1KuW)Waq|Jq>OgO8P{PHpA}1l=
zgo!^tN}sF-<3{`~832OEy*4LJf|-A|+{h9B$4NXzTwgcBo*Q6>m&D&Y@W?I0I=Fmz
zdm&9CJEBhRu^&4Tojo0`smoh4GmB=}P6i$k?n?_t!O#22ilnjjz)}eHb`f(AEn#Au
z%eqC<V0$VV$rIv)^bciMa0EdJ!dlW55c_ZJlAHSg>&(%B>!?70kmZDODO0VEA)FXD
zfz-_4(Z!Z)$vRgDQt8OqGF*<59M0BDX`xCdP-w=O&ZaCZ*hDE<v9q^qIQ08}FB-oa
z$1=&HL`4Bp;BGnJQ($nzq>{o29U~$b2Qrbrj&bH6^G?^bH8-IKKS1UYr!VppU<09P
zPVR75LUyBK|Lgf<Ch5BJy=p0)dk<!|CI>K(**<u;r=S||>@QNeCQG0QH*6GpiN3E}
zzO5YPM7AKKpb!k@v8BvRNvC`eStf>ut8C#=QuC#2-YFnNmWeNFEa-SBqb8%MGB%n|
zGxALQ80i$SHYWcslI#sHX=yg#Y``3)!<jD~2yHw%OUz^y*^C!HPwf)OX@G^uGC@K?
zlF)a{MAey6F&g+k>Wm<bm2Irku)gZWtxM;eJxYP{_KYp6O%<A~LNq(4apF0{{{UQ@
z!?eAO;Wn7tGxAFilGmDNP{NRUQblC66Nn<eggxs6M2!p%`~F4!4`pYT<1h@v&>Iz2
z<VC*!#Y$#=B5MMa$bXZ1)AmF^M?;vwtVj|h^cu-yro`f>Uw)gxjGQ2nMTBub3#PxI
zULl-FnK@x681JBOhz0tY4DLg)OY0z-=_Ll%TO*QHyF-;Pe!rqmD9TyZBr(4W(;Z_P
z`;?C{p{{C~H=zf?KH(McTzhE}z62`5)?x5SQj&;`{!f0ulnimEO~$5ir34U;o?V<1
zS88-wk%W3Oi_Pw&uA`dLAvl5=KZ%87m@E?h_o%_QD>b7`p9E94hy-Eq@CGZRp_ru%
zpG2E?$z`wutSU|lw;(g(N~>-LD-sAZ<DwCn=L`xNl+2#M1L6f}6u#wfm)3+S?7&Q(
zu-Wj2B-S-ZgPxG7QohaL3Cjf=K@uT^X<pm3gguzK6Zf&<&$8^XnO!U@)xtMtDU;;`
z4nbgfz@ukZ<B2N@Gni2nLQWJ6-B^6rE{T&VAjp>0O$LI|4$reu;K@(pF@?STWK-;e
zW#%wP*dWy6_yI_NJB%`yLf@+Y2}Mzo<Qd$4DZ7Fsh(Qqcr4_N*|9@-~dy2F(vJY?=
zR!e{oo|SkNM=0LJqnU2ZzX+BSk}XiNo3c^}2RW($3=3SIB!;6>n^LJ0ytzes=QKDk
z#@+?1RI-(*(tT+L4$`tn71+HIg<M2=D!vx=3^z)nS{^Jp*F<gh+s1cR|La<CHqWDZ
zp(tufQ?Xd`-rNHmJu8QMc;V!2hOU#kh1=oXUNW=N$r1u%EbQHb5v6$wfra{wDMy79
zOp~CKVeqBE<Q1D$mK<5#J-e^Y-IeBvy)d_JN>Jh6+3Ok8bkDkduS<14PgbQ9mdOEP
z;b!(HvdtAgZ*LHPp&NdK?A!y<i%*L+0J5XY?eLQ_HSNIOuXB}^GN{Cjkj+g4eMA<n
zJO9p^(o#6n^qV7)w*w|70$M-UNNv`1#l|30Zg4RG;C|YKF$%Q+Q!x~n+Squ-8+=&t
z;^kSfSOF;hA@iH8x!Z9Ie2*rD`=$gIcp<2f7t}(Tx&BmWGMds?029p^0+FZAy(m&3
zCz~=?@F7CryXb|O?N8aY;4l<|uq!=L1nz&aQI{+M_7b_kn_+%RTkEb^d^83e=@#64
zRQRlQKnKgD$bITFKwH?BarO0xg6uz0f(>?qm?TQe56%)s2+woy?M3{+TQ#C@1-3g!
z9*PG_xQ1q(ZsU5)Y55swBHoVVipD=XGb5T-<T-(i<^aaAZ9c9W4jzh8C=+rkWD%h7
zT_DD25Z08UQ2fZ72Bp#e)@l~qjUWb!t`(l3{2X{rV3;DmE$hs<2tO5~nc~?R`Qw7+
zMgRa&T7Qrl5W|B*yL7Cp5za*^426L5*J4>-n4+BjefsF_%h9s}=H3QccXEhZ?=|aa
z3_4m?_7ra+y!k`!?yySkG&Z{ESV0(q@N_8PXl_-;T03KoPjeux3Bv4RLMUa{b~;;V
zw5*tKo0xF)HDFg|pi_<515VuZJs?yNjFPpT-5GN}0dXf%9MB_)r_|Xx(=IGR5!46q
zyAEY!Ts?~W`sGN$@acQ(QFF*qoDZuZDALTD!}cnJdr*BwIZ!&)_}N!JlwI461ThF}
zDS<ruZ|v;7FXBC&+`wox%YXr6|Gwv&sDOv|5}dLNBybXR)lr%B+6Z3qHCp@VuF}9=
zRY!%HAJKLbs4zl)^D;JFQMoICjvq3>$B0D7Mqx}IqUxw1EP~(lB^9zY)eSOYqw1*e
zSObY@1L2~fKPqWq#Pj2jgR-5-&i&)QBh2q<?AhZn$pM-JFgRq&qBg0!fD?7K2W%7s
z?|Aq?bWGhE8TolU9*dXzL<-_i*k5`oL!mP&y@h9!)a(M{Xjjkdhe7j-`K%%kZ+jql
zpcrmZcnITSJ*toj|F**uV^n}tjl!=T=AUmPD=gqH2?dL6(>p|!q8T-%vRyV$*r_<a
zxGR^gcsrA{%5?!;Br#*<<PlxU6|A9=7M1I=d1}0Xbb}s$(r<@@WF9{qX8TUI0C`)f
z(uxLsB3?rsgvO@t1E<4BCb-i9=am5y0J-?&d9*ua{2s%I=gNOUUF~Sq_UhTk>m@mz
zw_MpTc&%q6>=spCuj*$tV~$qYFGv}*B&EJx9OZ<eA^+#mKa`zoZUiw1gRhh@lh^$(
zR=)gb1yrl`1xBlE0tSp7KK-Q1815E8)R9MpqJrFmMfwY#Q|O~Kf7oNMY7-}f=SY9?
z=e+#d8C8YX^*Qj*Dct5re;JHTAbPHL94Hm|EX<&7COI)gESXQ?@>g1+Ly%3inOqw2
z!$7#v|Gt03)s&PnlYHN1R~TsSh3s2_jBpx}|Kbs}JB(q8p;>7x3Y$I_$uAVG2>ZOS
zsdM{w38WfZA4H&!0J9>|rJt8=Ay#kf^wMZoz8l95kbXRKuwjZKZSFQG@jVh<=%$W-
zRf@eze`>cu2=7r?<+??Hu^f5sQ6xbXSw~CU7cvG$9B`m&<QWQlTRGdYQZ>+|^4n`Q
zM=MwCMB7=WiH_Xb6;#MSSvclMesP4w)Zxle{Uy!cNr@1IBlV>pe`{^ym3!Du&tFzf
zB2r&E0`7jahRKgrw}2@;lSq9T8xHY${U&>ceX8`hkozO`WiZ~leq9d&bXDO}Xe37J
z3v3rm<se7hkx9N8-_)r;l$~pi!!QVhujCj%@cl2ge2KbSpeq&izhxz<8HVx9Yh{l&
zWk5kKp-Gu7uUy%)@A<4WST`x;r}sRolnSk?!H9jS6%CxJW?QLWD3m%cd?De%K#Dw(
z57||<;1<$@@P#-m13`dJf+~^^bfI4e!k1<c3!m+YE;`fVtFq_7eBSNCwmln+O>(PU
z5OQ^I%d)w$s3?mOVx`IZtT3Nm{c;*QE+te#pk0zXQ2|t(V4X?CDK=9&^ocg{D;L<U
zpne$?7(wN~;DIA|T~LzrclFD4I}x6<Zqt*Nh)<c7$L#Dhacb@8b;#`<IqtA<>Yw9x
zygNT3mopupyKu)!yz~VFCB?|%^#12_`8x-#ta}Ayg!q@ZUT#q&%r(9*t>T3*L^j($
z5{TSzs|la77EC0?3ttw|D+~t4F&Hb^<+1WKLIJd1?2eTr;64q=`}bkfmw4d|musxs
zvy<7d;`xxWUD@*rp1ATj8mvoVEh)?f#H(IZwv|2w#XxxG(QRdA4T_9OBB)`n)AH-P
z{-wizD7&^CiD3|SqfrQtB=^7A;C}2D=t$)PsA>Z>!Pt+XPZ~-2kuVad+IrQO;>yx^
zYD#m5ft!o5=xi~5(Lnr+OUX+Jo2~FT*`uNiZ4^1aGhgU~t5huE;tIo7J#n4Df%(b8
zYT%TDJy9J68gy~KGhaL~^iMz&m$7PDmeUCwSNj|^@`m*d7W*jg12z0jILWqneZ!E_
zplx-s{>g0IXmQeP*<Nf6&bF9HjlzTF-FX?Y{loe+W|X=V1NbadsExG`j@%b8Qyc=E
ztB0@M@HL=#8#!`c9Bl!%V4GCN!vLn?F~oQ73qccpTnd0^{zH|&4=9bWA^X@HRU{4q
zTS@B1Uv-Au^D5y<0;2%CWE)dp>%8EYdny7AAI271H43oCjWW+{!G*$$E*qk1RgbCh
zQ@s;k9BnyLz8uNOw6;6iU>9-Zy+Csa+M|0zX;5CsjQ@P#IB<8kr37(&>>p9JEgFr;
z8F+%xJ#aU79t7eW2QHFc1j3_^XCZCBDuqiMVqeT5@dyxOVxilJis-^a*e_-0dc-gc
z!r+zSfM5GBR=)f*BzM&Uy*3Rt5<>d?*!x@{Si}jzZh3nNCKTL(>=e8#ZjkO^;kZ;^
ztYejjd=%d`qG<tJ8%|95J{5Y4Q|%IPf$7B#B)RY$Dzv9?XeP^+NjppC44|YYUUY#`
zwPe}S9{HrPzB?hnvp=H1$=P=xkU;xeGG`h6fno?bqAY5Dw^D4$n`JasGUF_Z7sOU8
z+b>%v3(t95PKaT2-%gTOe#?YOq@C)PIZ+i)9~k%e3;q{66;D7fS_z`e`^2WVn7u9m
zG@a@e1U~SFH^Ziv?n*GWvaD{2{$${%dp+E5@j_8P`Ai8Sai^2a9k<geL(YCH|6nRP
zXFdjn8sE4Qzt)9=A{n@#EDroJnCy&JoU2XXl+Aas5Q~D@0Yuox_u>P037thxbc^j7
zcL;PqD?u|`c+x2-h@dB^tiJop*=B-4tDX85!_H<yD1)g-O#=~XCAqn<FHFja!(8Mz
zmo2QdTmSS&T7UfTA7$raYcUAJ(3JxDK=)tl#XRXsII7evfLhu@LT#VlC{B+mz*EeJ
zwQz-{3T!Mt6x-qm&4(h~Rh0cXyFp`6QnDbwDnDT4+Z&XqrIKh=n51NZJ`IuPIT_h9
zRgX?1R!{vEp4@;Y=&f6k6TUA%sll;ay8M4i-q(2zBH<YV@=>n(WT?1yy8O7q$4<WV
zHnii&X|0@x#>mVok8^q_g1qz*48CZv&b07>1mROp-Z&hj6~onehIarb4y};OfEIrl
zi}aq(HOHM8I{g^U;V<&Rl9-0}NEr=;KQ-H*qlx4IrjSN4NL(NU(!=~@r*(clkdj^p
zCN7X6=XAo@pM~%&FGeGuUx^C@%Z1Ic9Faj<G<w$Q^_dIg<CwPK{9QQt|3EW(9r}*m
zj3aWE{0_IF_%1tK<9#Mr5X{O0dgKjVvRAxDqXi>ekYq_UL8C<6_W6&+O;}@Sr`SCt
z0%JlnH$bUum(E-VC8*|7Y757M*@<}VLmDgIqP<Vxq4mJY%8t^M#&|sg`J?RIvLpsU
zD7dAL7z6v?SW`})nGWcgumL|51$o?BEFHuGp^6Pv<TXfUB`L>($Bqyo-)Tm3I7T;;
zbc|MTtC1okyrllqA*~L;^$A62yLQkDB-Nz&7J@@fYg@sv16hd44sA^N3kmQfv#|sM
zY}b|$#PILyhSalfi>1K6U?Tx7G?U0oOaKsHP>YVrL7pL8yr^8vU(R1~`d7iXa2q38
z=un**BERM5nSR*gsGMR%=D|T~bL3IoA7o!pNaU!-DB%L0Jf%EV?5RRPrg!O1H)f;I
zE<df{4`_V5{ji`74=#^R1_m1}jbn@gq+M)F^lF7k6tUn2FF_@_<7gM<w^k|4S|obu
z$s0;5BYETmtE`ky18!)Jrk=jL)UUI2POm(25jWHaQ|*I{;cMhs(n9yQ1l&;b0N1^@
z2T2g0vyynFiQ%s7@@j6={<Dyo4`|Pp-foCSS{NNfa8jj7jFVc$_U>K~<zOA)V!=UQ
z|D)43>-MkamYMNoXdddQ`n#FYGM}w^Q+7qS7KI>eB|%iq{)@fV`z1URS%4S?p$hH8
zCR@9!=ve_vS&$l1{{+~f30&7lELjR+VL@n!?Qp1*2l*;Tdcg96-80-c1nrCO%WNN(
zhlscuKA<1}U#+uQi2V@%aGn<o-zAu5fjZsVl@ZsZvVnfOB>$TALtzcHk)=2blMdF-
z+(imM)Hhoa3z$94AnQAhF*)OiP6Q|_TOMsaE&6IX6q21J#ttmQ;2)XF;XRj|ghG-O
z^h*fA0C(N<vJ1{2k%$^a32xf8KHz9ggI&F1I*1I-L0L^y?m{0)IHsV6YN1;N=O`rp
zr)+~~q5&(NV@PNOb3o^=6RXa-vT!kkhLy%{G2JtCvJ32Vj1|8Qz^?V##_pe^AW#mO
zLYya|p{>fIj!el;y2Q#@ShYr>g-MF)j>28nkI5$f_ZPkjElLgTY`ly-=x~^fc4t90
z!-Ce(mbwz0A)y@!*V8{%!E}_?>l{YLw&-twI0nx3@%xXmb4_9x1cC6C6j18@FILw6
z0@_aY0!+q4!{c-JTkPtsw`45{(5Zh(sV4K(KTQ}uGo8nAiVK5Z_}@XK?OpjqB5Y}@
zyiOc%vUco0FwK?EADhUbq-;L)4KymP+sM+kta6x-_|Hh;d8KL9OvvFu49V6Dpf!!_
zMf5o=E3-r~q*v-wBfNH94+8PC45}QpqYhu(p%db*6%sqddgS{FQE@}RK6b-4pIw5A
zcwt$YWyfDhK4w!8mg$)~Q3GUF1*YGzzTmnK0IAxCAOJthtP12rA^ANFL+ExtUk3AS
zWMvk3r9x2#)0;KBwhoaE7iE_CQAY^}AOb2iU1*j#$uhkH2N;JQUMz}h_vSss2->V(
z5*ko^R+#ljzc95X5jkHH+Slq8CQFgLbf0x5Z7I?$7;G!Dtay(ijaVhb_AJ9IfR_|B
zNTm60?TM9$o6!~UQLyQ~66Osd*h~qQ(G@V1j>Zq{On1LNCdB5>=*ohsZ{&xu1LK(P
zrpV87<u_$#mK!k)!_X^@7s>JcFIF-rT1Z5J67wGfiDQWx`tke9f6BcPP9Io(Dok@f
z%vOYQJ_^zqPNP<BD#R&FMx*mEjH;XIw8hn=f?b&Z8B^+=-xPo!x4cpDt4RfYY+{=~
zA0~s#?A@vM&7y+Fk8`vbOrnrXq%@qFJ6ge`@_3k0jGr9H+u=OpieRB7n#b`u4j2Nh
zNCOJBqoc?eRGXJZw5wL2F!r>DV41jGqNeg<Pg;7Y*=Sj+apk=IIxdM;T7W{io$Ef8
z=1*V~)&%i|Qy|G}IcvGnI9V>RC??}oRHbi&U%y)b(OTqK(F^)Oa)>51(#LnTu`nr#
zFbq1bu|>=KbK19xU^#EF6{(KoUZymL&ZM;(S!U3D22F>@!m(7ZcaCIgK9+@+f(zzz
zd30R4G0un55G<T1pxC{R<43dUhw}<64RABZ{7JG>;>d=S);;&0lTY|wqTs|7;>_T)
z#W9Sa%z=o+C!_;U!veailLa*jA__H?x$#p!!T9f@`=ad3ju?hPDA<xDql5k%3#&gM
zo`eP%kBxP}W1mI#LYA#4ZvZcj2D)kfb~bu@8Nq&Nob&W!M^41;U%11CKhUdK)b8lO
z<*uqC<EU3b>@Qx#avlntklAcUISDd2q)?&V0Z83%hib}(*&d#_psy4!U^$yYb(_~G
zu_sI9QQ1$teucqDJA52k#B*e}(kz@ey?kXZ+pEy8z@P6~W?Lx-1WzK$7Jcn@<z6cr
zQ&qBA16*BD=<BpiWj`6~QOIVmU9mM&vHgUvWT%;A%38_h;7O!i!PVLaWR5p}!ClY}
zh!?J4W=*M<Arr2Z^AE7)>ofath4onQb$i7O=cUMnCG<oj{OvVBCB=;(zURVRr35ew
zR<OMxm!g1{_w7n<tYEjo;%67&K?5e`bLE~Iz$}fP2<JrwfRk>(l|F9(v-GPE(mt_!
z$Ys<~$!A}75t?Rn`>w(@MJ|{!h?lHPtg1lvz!}7q=nv<h*T?}%eVVPx%EaP+B;VRA
zk^MQ8V)Bvey4yx7s_yTz=^x6@C<$T^grQf`BB=Mj*b@GLc4l({r(>%kO<q1mmV&#+
zrPzS^LV;A);2}Jrs{|7v4P#swkr9v5+O-d{y0d`AuMuFisxJvJL)w`_P$yQ_ufRzL
z<gj>cgpkID?P30IW&H}2ZeG{<365;;c3eHiOh+c-!Wo0C=QGv|2JSUS@$;E)nGUG;
z=P`NaeBr+Qza?qLvjCHf)h8!fm7Tn_iIKCX;lN9F{i_yeEju5H8M!!yt_?K&E*w<t
zP<fOYIVWKbVDe9R;NT~&nMZ_tQ?stc2it=D5_DTfmlT>2BWr>C`{dpg>S1Yx-7@Bx
z%U#gloNxQ+F6!*fYl2><qr{`&Mk~`!MCUZ?6A|sInbD$NkWZMOMzB;mEs9wwxflha
z3`lS<W2^^4{=c?0^I7%|A+iQI+D>b25Y~Dv*+h!ehw0aN-{@xBo+t4yMzi!~BPdpZ
zUb@nVTt-+WG|OI~gIwXh2y#zfCB)mysuxkPIsKL+h(KI_@e)5r&X>UzZBYM~;Z*Nk
z9zSe;l$~o1!ypWUufzx;<^C62oc+Str1=7<0@~)`d={4G1|Vv5f#7R*;E>P%a|vgE
zA_r`DkI3ui>n{`XpU-^1fP2DX3oZu>H3+T~gmQ$$NXqPW;lq(3n055GptkZ`@PhK(
zfh87duBSB?g<Za-F2Exl{9OU&?os&`MjHLrxq#vTzp?U8m~6Q%#J4`l3K|^>;N@U8
zX+4Aynm&GOTmXy=fLmev(8U;ExB2JF<PP?r35LP27^{h_9-#y8lNu6M*BR608R>SP
zk(aRY{Q??nngU}63tS_{0ts%RP6kDJYy&P{pE6*_?<yyFN1-K<%YfX9McgKdOn7D+
z%x}#E7Id{$Ky7|ej<7O$qoBkF7R>Yd0(N=?5`!Bx;A_ro?Be-FCmIR2j#MytHP+aW
zBId4)?!2k&2Bm_Qn^7(_3oQhe^$A5lCl$;Cn+gX)xe^IJL1Bo<Nd;q>8K3ePnKO3(
z><dvSsbF?x5|}s-5NX>p3%{yc1p}Gfgg44T-zVOboox=pAP7XS)K;;2|BEfp{m}rs
zN#_EMv3`I&W=iEiD85>xU_1nx<GTw{{I9N%!g@{+3{;nY-dDx#1FzmFLROU^7<w|V
zftUJ0r`CEg=D%M~{zN-LF?v<$Z7h1=Cd@`saKT~3r{u<!r*_*3MN*3x3^R=Rg>kLS
zRi!$Gpdeu|4N?pio#Jr?AcTiYix><S$w4{r#Ne!8Fl{NTE~<5sxPs(esDPHcdkAWQ
z7QvY1Q`<b}rpdindzt`?S;S)IR&K@G#(y9pqdCKTUzoS#PDJs?5B_#i{;ur=!uyd$
zFoxW<(*Wex3EBt6e_B`>mTp19B15OZM}L;Gpx^>!5sl&T)(>~gyeLkTeIh(*TSQ~_
ziwWc-%+wEmDJA2MXpG0Wz4g($uju<OFu@WO(k-GfeTRugSFjOvTrZs1{*F1iL{Hr1
zJ2Y=!Ir&*iiW$)u95Q|4FW)5xlEmfIS5|ZMYQVUv(=D_y{~Xc1ugY6;CPL(RO&n^+
zBTDsn3=0E}T+D~EGsqGc1YzivYAvAmzt|8KGY_(v+`!igB8L1oGOjo1y5}qgPP*VZ
zXI&Tb01g75Lm=;B8pSVRyA6AnviHfd3!II`+=Ex?mke1<9;SK7Wro8z=Etp2L8oV3
z7L)6BI4R$a8$Gp;LKt4QE{iG0uDIZwl^%<*%YuHz2AZf)9$@jTaAGPf;r#2mnEZ3c
z@U&Ky#@P&S6pH;WjDa*8?^g$On#(+ArO@cYm<7iG_|m|kkv&IDAVphDTtimQ4=yRl
zNCZ`Qlr{GwFmkhi`R0g5=Se-GIO@t6LrM-fK4clnGpi<;{8|h^pKpZWdGGs88-iDW
z*4t3V+yXZ`z7gI8=g5L`oOET(LHs!ckwBX;TwZ_`S`1+tEdIW7L}Fa1FlcFA7jyFp
zu|eC-yz_@!`)v;>U!oVFxa?pAE&o%N`lN~xWNFq_F_94xt8)I`Og@Ms?2E37iOg{r
z`OAeD1&BJ9Li7z)Okvt96Xl-caX&#}VqFyz4ypG=GY0n0gva!Mr{*8Z&NVk;7zDyM
zs%(ds?|-o}Xnz#wu9gc}Q4(V?A2Yr(W&gE}>t={5(K(g2xs&gg=Wn5Y;g1S}Ky|k(
za@~Vdsz|wb)`C8xA>FrS72woK+LfsoLM7!X^K$@GYh#24<8_>=7!rYpIAL(ecVR1g
z24o=@!y*Nf4a1x3Wp(%482F`dree_ACJY1sl(iP;Yz_8crea<;>K;7w0V-S1sezIu
zXDY^^93)_|yt>pD^>rYX%9)C>nDio#(4G~Xb^*_m4EHAGYR}}r?{MfDv_o4bEtJ1d
z%>IG>5me)$UR}5Lq!V!^uj=`XZ3*zZeLETm2XV$>`0=QT+98xo+SQJp$)9Y6-jtBD
z^pJ#6!y1exF+bxle1a*2<MQ@1tGhLP|28D!FoG8B6X1J@^6(c%a&K2IenpH)y>Mh(
z+RiB&FvF5@n1kC-uY`_5`Kjhb1IYzh#iIQ#44#5H<(_Bg-~vW63<G-6z!XNipq5et
znIFk03}!h92Nec9&p&m^WM#=u4DU(Uym`8@Zf~l6d>6lzUD>U~FbHhP7h|XY#+LDZ
z0sEdZ4Omu0FvlF}<Q>V>)S^3${y!}nMDC$Pa%3h=5^*U2OBM2xljnM0FQX;LhS@-g
zX)otSK31S5p(mr1J2vxR_U_NBo|`b0L&U*cHPS^90FsidCZZ#pJfe?>Uzu9zMo4y<
zHwdd%L?Fzw{C&c8Y~UMJmR^F?FrrlvSHp+HYl<1av!?s=%HiGPMvy3n!Hr2(cN3U!
z=+P|2|2N7mZ~L0QXH5VI2M3qF=><zaMv0T%3)aB|`#<y(YYPuH3R*WWSqcqRxo`OK
zJb*7cak3*RA7ThVKScbCH<IS{K7GA++hqj&zIsEFdO7TID1=Fy^If*@TkxAi1i+9>
zKmk(RVk?gjg(4YA<%I?rMkp6ew~ND+0C7OHDQeXI@DEMd;$FUkkme)y#oJ!Ggdd{2
zYm2&+kVqRpkgDf7Xx%(93YJ+pIs&jC&pj}^24qiRPfcNdfe3wB6Qr9^vXNq=b%CaY
zTLNHv`Rxy>XNqCt#{%@<XYWJV8680kf<UyTs3_WhW5@HpkT??>aB_*KD?WDp$R2&c
zO1QF}E~*5f+e9;;(4#LEH*4JynN=n96C~b6^YMJ0Qi~n6?c0q=x%bS#?HHJp7n5-E
zl82xP=ZSHo6md?Ne*-(2(a1U>y_-MlZS#Bd8>_~rq{8dKzS?Q48?NjGsjt|Pr3rv!
zc<99z4Eqs8d$&TB;XJELW+wZ3XUA_42EFav@Ke_(pzh(J7h*@r6%vd?G?cYogL-f8
z*+VZhPlHgJDk9V&Y*2{`(eTg<3V>#iN;CY7cTpLk?4cJEE4_Eq7;Q_JXoQoPb#kaq
zUFf0qJlhQ?pjL_9&qFT@)@p1J&%}Ae9TVl2;h~p>nMhf>HWysu`kB~TJ@is$Au-wx
zW%61gN_Y+o54{vyeW%z5#G$KyiD$n)vG;<3_qVY-y;%C~iLWF38^3MKVJC;(Lv~bX
zmnQxt9(frs4cMgv;1!9UEr}V|5Ac&BC!s6?+4g*iI={UOkGw2_?5j$nWjh^e_3a|~
zN7=dLSPa5I@Jiul;QkjIS2P>jiu8Jy6^cjz+myRM$BnCxuzViGT4;<cUr!J+un4?x
zA?_=~Giy3e(;FY5R&5b?foVt7a!>=Urf)-l<SZ${(0JL=lYfv#&Hu$6LQb-hL#Cfh
zJ{|k<t*Gzn)hmQAE7d!>5Ez}=UZ)sO2>X3ff`Jc44390NhT==8qgn!9=H_C<aM-h_
z>ShV1tQLtEE)Xd*z<F4;d)<Q7vPI&>bB76hw_D>*yxMyUHNK<-(@~5>^a_@=|MbqE
zBhQ3lcm$4tkG&$)mG&3%)rh=w>?}~+@#7E1uh>}%+gwCm{4lvR{=K%OwMTDDBgf;f
z+e=RRWKVxC6D@d>TV`JP?R<`Rzx14zJnbmoFrI+NGjCk`=6tP(epxGDBPZqs$&Z8V
zwI{8ktd%Rc%G*vB?Fa8^keb?Xvy|925-*KPxW}1BB$o?ZiVmYi-o*o2+<Gq(kE6;O
z4FQI-$h&kjOpz$*Xm!r)1gN}mTz<an$Sg@BX0DvI_75liQFbO-48tG{y;3{`+xNd%
z^|Pv>ehu3$s2_0%gOJ`CwtY*zkppz_7^{aJkd;8T+YWb;Yas;awV;^UUx*GKudx?z
zphdz)FDp0U>8%7pz?_JY61n@K9nzmDHv2@QTvx);-<TJb@aRM8&Mpc#PmPe!$1^8j
zgen)riTb^bs9#hQ&T#rgw9W3$SE{g8;j6!dT?hG`Mp?pP2YizKg);K#YD}-8f*65f
zBzZn$o&TM2wCp5QnrzZIQvTUIkPUcg!X5kaJ8SQhXL<>tYPnxvp^j%BZrQCZeW1pI
z`Y|@eGtp?e-P^0_)j<JX0V%8^_nD}&cf5<iBn{;PNK$>e?FGu}WO>KCsK{<iN>F92
zs!~F4C-DRw-lbj>&Q4R911TORpozN2;a$q}1Sczi>;7@(L=bf>FvbpK9ph<AMa)EI
zYU@~F>S~B643?i`*Jva-Ol@a@nWpljA-hDO7Uohv{d}~%P5$5sQ~*_pqVOC5XPJw!
z&HXwgk^}JhC^LqPM7p)Mu^(9{Rhq0SYyR@Xhq5!uk{ASm;FUs*LGORDrJUUlo5{X#
z0mf%WRHVCptHFi*Ik$(uYx%9luf^pgI~;zUiHE>`2sI2yU1SVfy_xokpZyrx1lTb;
z^%sV1rUpKR@}~>ZXy9pa&~1CemdKfT7D5Y03>`9SFGAnVQqibzgmK{-UD!{=y{E?o
z!m?jk#U;WIk>28jLuKt=GFCktb+^K(_e~H(?Rmt_=W@>$&|jJGkArs6VDajXEM~dJ
zYTH@idC|oIrjs=$0F!}1Le~RQs|<RI6nWsRxhRP}$)|f^e|6hWp|rl<Kyy45L4CGD
zSlbc@Nq>NW{=BvAVGC<}Z+mGNaPaJWprFf1!wZ487eG|2*CNbEX41u1xM8~>k8oH(
z20H0)pBce>w#tzI0j&7@&BFz7gkxC8Cc^1IXu6EOP?&Tf92wpi2q%#LcguZog~&sI
zPe#Qvk^`EASCJp5RVdPU3k|TfaqK)jPe<X4oeFZFH-Pc+aRW+*cwYFUNy7^gl1OQI
z6vuVvuU7j**|}Uv41+*0myJLlOGx=Awv^{Gz-2lCJw4gj2#W46URn4;d;u>lBRRq<
z<&sAS^&YyvRSeLd;O|+nMS+)TuMHw1qPPbYftMzX6<MTQhG#yWX#4sI<(Hzp2_u7+
z6kae1+Rc|I!|K%?ZVP*kjdsSA`ULlV=wlR(?yDR}Ds!#}r%b>1LU$A~=022N-&kH>
zsFC@y2z=$pP_~>fmjOF*QRw*uO-#ClNj8g=i~lk(<2DEie~wkyOGw$GzzcN>+*?Sg
zZtcej%@K?GF7&B^Xc&azCt5%WAq1no%X-=MiOW27iyVS?E6*>F)?$;4%F@gA=Lnq2
zY3%HR3!~ip5^3+KKz=y{V$ve);&JV_1OyeJp{pF=6=t|B86DwN={Y9b+r9GDLphMh
zn$cpwLJ6()I;UfTJDxq+cg0gorrRI%g7fQfgmSe-+U4;JlgHq>NO+V^!%^0a-M;N_
zF^CRzvSGFN*@d%6z7G>XpnZgx3%h-!mE&~7TI1{it-ElW?SKE2UD2@wAqZ<pR0R8P
z>=EA=FgtT;;KtJhf`+8rl@UNLb6sS~8=?eC^sXN*uFOW~*S-PiN!&HBt9Sm;_kM1M
z6>2f`x1QetgnHU|Cee&#vJ2jRRnaj)XT8A<CuEH+lU?G>7DzuASJvK#RS9J;%XF6r
z>VUG2iuE)|>OM1>uFzffYi$H~If1ll61~)#KY^z)>s!Tv8`2k1MV={V*TpC9u(X8R
zz+GwdApy6f1%(Uq&ozr7My7O+e7vF)vGyG>H80a!=JpNspDlAlSoGw>{Bn*rVC2YY
z5P2J?R%t>++%mZ(K6<>@gXlWU^oR9+o?g*23pjw`L)gOp&nA|pf%xQ#&(VeF`vm(0
zW2r4cFzrZYx7gF+jzTI=K(&Q2AslDL=O~Kv@Uvkh87Em$g%cLDmf0=9LCEfyv6{D;
zcMCJzZ<*eLnUM(U<NNV_S_BRPf@gLMWHmrVoeDkQ*^iJYrJ3ELSM9)+LM9woo7_I3
z;$^4kDPg$5prR0|?p2RJ%C7AOVi1O{MCpOU{)=7Qui^-)UH~E5yd8T_XPqYU4sXe8
zruk8uaZGB9%nuKJ{5$rIT5_3@Z|eqrMT6IIbUU_%GO<s1?pbC>J=pL^5Nh456jp`;
z4)`Lf2^!xILaCHh1Ic1Cjt({pYm4OjE5Gn9+AB2FTk!(3sQ9q4^##GMG^*bWicleL
zdB8BHqu8M<oT{*lV_6hBUz-NmBNVtorj~eGc71)g?(x_iG`)i40%=tg#4BaK6N-1#
z3h_1T;rbt=OrM>Ixs$XIFqeh$qTAw*mV$1b$%$ZAGIa>{Q#xZ%!>mi3Mlg<J7TFC>
z9mLUshM`RX0i-mLER*Eijd=M2c7ee(4}qj)cK^FGW=+EWTji{9=95Cga#6I3Bm#MB
zZeUk>ZsTakB)AhqGt)_s7`WcrI5`Bo#f*_ei<zK9L%8#|3Mh>0?aZR7i*=O>{xX;=
z@WQ01pEiV)vDBXMsEqw7JJ;igK^O>ElpC<XmJ3S%Ekqyp$4KLuYy&#LhhD69d2nF)
zg>PBW+Pv<B!L-;ol_bLgRq?5v%J$#Gln_UsfRp0`WMM}1T=`~{Wxqc;$?D4HUmx9s
zahdA@FX8h5M2^w}b@aGaxmhZBmj}KCyT<eAV6^3qLLoV57p4NQ2fzfwWU2!=3=<+*
znwv(XV0phxZOJdjFT^=87EwhF1&&`&C=<9=X#|0X4993Cr*c89%^x_EuWg>VX9UAY
zHt&i%Rd_o+K}{Mu_LreV!W`wO$$<&BZC`g(cXNizT}RVPZ+ZyV!&?q-C^FuiF;8UN
zYft?YY|rG>EbM({$3X#PCNLK=Qs3bw@&6u6-S7_QHu4Bf?}FVF+#;R#ZcJFaTNy2O
z;a$Xcv`M6nXI%dQ!jM8Kmt;a7;XBv_tz*E-v>+i;$aSQkWaOD?1z|!53jmo^;Sv@A
zsNR$KW#gEa;&Gey54*1`-T{{bi3Q}2{Wz>(BU})g^F*{_vCbnx7fhDtQNQ05Ebr2n
z7mfp}(eX#wxgA*ygD|wE_=QFPjV-!gYxJcCGMNlG7{t-0ZcpCXNblx2l=ML$jQwNm
z$;k6_BBN0sPEsmDtQN69y;utvk<lQV6>4?8s{1+t^8G-9;Rc6SgF=pC)`3SWxGM7%
z@@E_yuLdQ+M!=vw_?L>q41;ul*+kEmyIO1TTZE$cJ|pU01qyKl-0$b|)6~lcj1mE}
zd46r$T(FR(@whl59Os=M)faCyoQFgR?$GGb;#H$mMicOt$wl^5mZ`xg#(ba;Ro)Hy
zFV(+lEbVq0x&X`<bX51n3I@(-Wk=~aRm^<k&eWK*-ARtr)j?-C4{pxuWK_fsLX|(s
zylHqC;Z>nr>XIv&@1i_(NVEDgyt}cQ^Yh+SZvMs@p<?Q7%&M`v_xe3a#BJUiS8XYc
z-`}f5p*sc}YIIE8x~B_c=M}5%8)U^=1zzyyCt7M4WDPW{p*%PQOoK9c=#!27YgR*(
zcGU!~F|&1KWXR#stcEH}e!Sm0?a#PEOgH!m_%B5HqwI{1AO=Aw*pi-zr2oc_^$&@2
zM*~a-6UDH+$NY>42P^g`l5KlFqq2gr4ZacF>8Tc9!qjefwZOSXjwqNHL>))8;j!0~
zdA>r&$PN$%3e0eIqR34IrY$K%j(zYpTAKjG&{av$<u&px9T7z_Zr}KU`=;-kQ+C%W
zR09!3F^W)B-cdTp0F)L6YAvED%P+6KPJn_;d>*+d2u+(rtv^r1RD@&SW}$6W0>>lJ
zKaOo-G*`<b_*(dJY!VJZc;dFbq<Ndq=Pew8Vo^<zHIs%^s`S4SaSa?se*Ag|MLZV*
zQ~J9ox<!rr38sL8ClX!-W2Q~Hazl&!iJy2K`SHet^h#zEtI+MTD7UhvzhVr;F@SIR
z?q`*3#P1HDXD_xG!lWgBDvnm}evwJB39~++;g~)A%Ld^ZIXVpCr_&MU+ddhoZ(TqS
zEHWwd!#j4$bX9dGpiv9^+u<;T6B3POtlFL|4O)=Qu}G!(8w>(Fw1JOg)UHx;MK0yR
z(@K@!QQOh*%yWTTGyPI_W>*ZtFc54Bd|;{n#<D}cWWh_+0O8rObuil91m0CP!2cMw
zA!$h03SX`*Vku*GCgQZzZosbX50S#xcitS=FI~r|R=Ljym-qsIZxKrY3sl<K?vcKc
z_<Qq0H5I9pd57x*Q#I{ln&n$(A*x0yr7M_VmIxy-My{wTB}AlBx}x5t?Hdj0-$XT7
zLB7NymBQ7DI1%F+)WiE3EPO1p2&J%be3n<$i4<uns4Ay>lU$h~0Nv3N?0L>?7DOK`
zVku}8AM}_9_T>o;dt8mTcaB_2!=Veu36(!b5`n7p{5HuIr&$i0%ZO3Rj2_qG^~sy)
zpYD7_MoxtmOJ}<x^lDLb#lF@UO=nz}Xzp@V?$9+iF<qy3){>O&DCnBnin%8Px*akX
z|F-l$UX{0v67LYN_beM$v-^GTh5Tjhf}4XuQk(|qVgF-7^7`Z${YaN@&(@2xouXes
zlE@;xq94-H>xVX<Ofgqcg;YG!EA&zO>B>EqO1~p}8(U#HqU4Ixgu>8j!WbvG+I|Jr
z4`tV~1ThH0ehD8a{Qr+_(mesYGv(A<$FVjB4M})&{Q0QmQGhZ7_lh>6;pAyi;6i^2
zMsFOFmnsrEoh>TLTbw_LF>T`VyvX%M6ztzI7tdQ-LDF^Qjso|ywKS6FEiVl=@3zI~
zt>3Q!o>APwK-|S-tH&~6SC`4gh8^WCK)m^!8r?6w&6oY!&^=g+7!n$V>J%jd)#@47
zn2xA;IhfsV&ypyM;tb9WO^SKSnH|{qm~VnYZRwB0sK$y;o-6cb00%%tMU7IS&DsFy
z=(&RG!I&i@ck-~f^gJ}Wfh~Hj(ANNSeCT31>;Jtw7uueDkDN3BFh?)-as{|Mn3R%+
z?g2#{laKA0z^u;Fh^lDR4Z|n6Eq%Ugxbf+Hzmzis_++ouVCLD6sOR@s=P73hs4omh
zTI?$<8>~y`&B^r$XhD;2ERAcmaFzE3l}qxS#w4Sv#F!7yiuFaL_TMol3hE%GsHx?!
zHMTe)%5IE#r#*$2@A7mVomEpmJF}rFj}r7#X$4|d^>-m1@I%>|;7AOEK=4aGAP)ck
z*is&8R+x=8d>|T;iOtbe{~L`sg!g-!X0W2mlgv~o@JlS}U~YeRqN1PcN-|Y<6`~RE
z!O?E7rMA#n6A`jiVi7G*KA!Uv!k?x7sudO<ECN>=yIt#6KRVW5>&%7kFCtfV?V#Hd
zNKXZf6+Ex)a2kTeii<0jSuO7bkHUka>4MknuzfC?`Qw!d&f|ll2(7~%QPA5kS5lf$
z*w3_nK>q}hn7_Qiq&&~|dnFnNg+(VD(w^Y9$u#i%$Ms(L)rSZTF}NqU9H6tWtk^Bs
zli0~&0bjBG)MP*meG%)&fE<;eVmicPME{+CesQ{mXha2!e~w<TP7+&M8mWg?K%7`q
zz)+K1ZL$`6kK7Zs0^r1=0>*Q&CGZtlz?M|{tb#e9jpG9JLm9t_2|_RF#I4}lYEcFw
z+tT5p!|H*N{HYW!lgMOYC<7=|hkDK-nc`fyS|gKXLSY+t%&;_;`q)w^w=FVRK=asE
z&&|=6zS`)0d~)26<v{BD*DBN8kdXgSb|y&>gCG>WQZ!E7|6<K^)ksp6zsrhBC5WJZ
z;13QVvPJD1obqn$)dt=G$<$uR=Lm&qbou66AihZ}o2?6ig_f*`eCEMJ3e}f{U7bpM
z8=)|m;>?CUJXNk_U1Xuvh)|fxpzXD&LRWkcd=-RbEJ9(hNyM|edD5+tkOOmELgdJg
z_5Pl_I*jKLvp5MB<x)aNin?*=3cGTjW~bz+O4=QZ(03?Aaj`<pDzzpkZ&<{_P?Eey
z0^rTvSn86BlF$(gvsFEP_g@umb}n{8=NzFhOn|Jx?G0ziL!&n(ayhQnI)9aWHOs;X
zLlAGY2!*LE?7M9J>6Qf-gv^LQ7_KkTMe>P?$1BT34Iy+CCqtvo<D$xi{Dgh@%&#Bg
zT>wz15$&M%VRAj1Pf!aF;!N!m-Y@o@uqk}{1*6b?G3WIrOxNw8_SJn3>^p_mpZme4
zR9JBBVD|y_xaY>%`ndY(t=~fTL-ZEyHF$XyE5ftG7YviFA9sHg_`VRBod1OCA7$s7
z!!QiO;43vR65sz~!`UxDmFf#j)wU8KpY1>8Aj~`O4lKe370H3co0BV-?_}7jWWG)5
zD~%p3V_*MLk|WsJWJ_?hL2_X6y6bKHYV7F8ET_F-g@s7FObQZCr>(%^-Afk#35*pY
z?Xnn-%(w|^Y*3zg35p;@+GSFUWqwZ3BefcX4M9YQm1#47gBcaP=c#AC;Qs(iYZh;a
z=T%r2oAf29Nf1dF8VPO2T9cTskw^j^jtIK=!SIi-7_7ks41fS`A%iZPJ{62k;rw65
zQXyLpmV`#$V0n$)-04{vm+&ah9Cw_YIvz$1@*Sye^uk>`BIvTuJWMWP5|@t$Wz8bo
zn<0WOXW>QycOS>SN)=(hvVybZ_{T$vauTl_z5Jb_4380XF|NoOe?qP-N-;7)dW#6U
z*y@cYcRr5YYxmq$Ji<*rBI!c2@!fBflkpfm9|F(bzK)&Lesl&mZY2*txzLls)+w?s
z-cX#z)Eg#dJ>!$x>+3VemynKsM3-6kdlK{hC_9rI24WZnwzP-swfb)?8vi8b!v=z2
z;X|}WWG;^3{O8$X0cYN;WN)0nWHDDXwn{Z>Vc6&cwGLtuMLj-_5Ua#XYJl8^si#vo
zF6H}UIKNyQ4cEw$lUd7!zlv-^!v`iR^Kzbi$+2L*ZEXqlaCS;#UU1f+KZz^IP#V~|
zw;S{F3>u$1?<?9E@@8SgH$+8V7AMBbKr?`xc+?K(b*~~X<ROt$dRE>Pkr$3;sL%`a
z*37Fg5C8GJIu~n92}gxqHu4#x7$)uiy!;w-39;MAQSd>4Jr>~&(vmYi^Vf{^sGKSI
zbH@mfAH!K1yFHXaoH0Leqs@Aa<VfkpydWYWfEX6Oq<8%~O@V0l;QK-TWEnz+gWlbS
zM5)LNt!tPUh6}c4s~S~Z1zvcVW!U`~$#3c68{fFnE)%!YE9>Vh>z){zo?=L<M!TfY
zBc&!+9<Zvc3+FIuw97aak)X@?w+rZaJ36r9E?8MCW<S`1x4526gU*bKyD;>S0+9Un
zA7xjPBQXpDzl4dg;r}0NDlN4H%t&y{$wFD|g46;>gn|er)AdMrk-ZNvhVOC?{R>fU
zO`MM`GG2VsaGWpxW`N|E@qS;>%M|%8atyEXB7Gw%bIH5U9brm*7vKy(TMuHdg(}DD
z4r-2k7w^-IF1C9IGUWkk-v^K>@m<7TO&;{_P`c$KupgkpL`n5d$WTKc55_||0(DYz
z8pXgP2qql3TGhyz2lqJ&j~r$&G-LY4_LTm$508B1IEvBN1z{^Z5sa#XzYJ<lPMnHd
zB_xVoD9m?b<$r6oG)h~L-GaXhfpeBX_A8F2FAF)KeqI|UCRG0h^y^*8h!ZX{m~C7j
z(fp0<LA`Mj!^ouerNLpo)v~8AC}fJ3FAQizejgt7j;gxgZynSeB}b4M`SOV4`Xk5*
z2f|?K`1$c8Xihf3_$n$5vB?8WKl;Fg0>OhG-|;GHo;<>vVz2GBq4t+~A@?!2RAPgr
zQv%9a*!8`Q7soJ#*!T49GC&T@ww>~|t3R5hw{`{};E(b0q3jHBBnDv^_$As<X#W4P
z_3WN>M{-?}4<OW%U=qjvu|#jM@~Jxv09fL(9fg%w${FM>A^c%jJjD$cvgb;7(M!b{
z;Bi5&!5~j8>ld<T5PX?$V!#3Y{7%>3-3nL9U$zTV-i8RA-j-%@rpqcH;tKL%T>pCN
z^pDy?(pV_$ckTL3a=cU6M~N#zIiH35dZoG`f}jvFa#6=#E*TD1zDH>LxzIS>L<TH-
z0?o%=$jyQ5qFpPl@kd0qJ+(N_Linv@7iI=@vtEdMSkLa%vvBAF*#%Z~L$F4l<Ty5V
z{PZm%)dh`De~Z@nKdk6|1r=Hjs}04#`%Iwg)0){~Gd!-mmS7YoHV_=r$r$OS=Cg1z
z0@dY)EePgnj4S3|gcbhZ2*n+0T_9$KOk$JzEaW*06Ax&VPoa$SCNCx1gaS$o?n7GA
zOu>Q+_~l#WxyO~)#=DSw>qwLsftUj2>;*i~gYh0`q7793?e~%TZQ-XquS^$IfY9;7
zeNJaORV#fKaMwz8;YM+{KJ>Mf?kuTY?hq(nl$}|M12GIluM{t`t@~eW^ztzv2?9m_
zO;C5+CApUWrC0Vd$G8-nfeg8FmA3E%Gu0*V7PbPsGWQz;QpY7%S=vgT7P3vE?FU1e
zUTEP^DFH;$>)=`!J2V&EeYaEobb+BxdW6phdwxuBmh{5#AroN6!XIKWeebe|qYMak
zX#y>Nb78v_JzHx6mF6dtUjh=qOPGYiyjtTY6e3e!usVlQGbeY^bq2G9j>^jCcZhKL
zJP6lh$5hdg2{q1qnE5&QQ9=lVwbLaa!mC`^F!9wa(uaw0?e31Q3}Gzk-UAXm$f<Zb
zjb{IT6(DL!`%aKHVJjp*cAd>#%EHNaiR6~Rc;ukK$gg<r2^hw5*g7)g#kBIC(Kt3r
zg>%&U#R~7Cp)l{5>j}GkX2NXT3S!Y~(`#25&9QK(o*eNUz2D{5D_~bAWBOAT&Wa<Z
zX>Lq%aZ0QUZ>16?iD<)F<|yH!pkH|jNUktp{HuB-+hG!H+KM6I+EX&t(H_Uf$&H#f
zfyVtUllr6VTyPkMK^S_aHvioJV&i4fHb9l;9Uy8e1~xc2oIIY5F@#fmjl-zD8H`<Z
zow0rluqGfNFMGM_+o6+q*fYJj(8BSe7h_Qd<B?3<<oL|U6oNWKud`r7)!AtBwdDRF
zHlfOS$;-vOx-!a`$hB8)i6}?=LdWjL<19aBUa+(j-s>eVHzR8UD3%@A!4<pq0z37B
z7o1t>eX~Hc%$b*Z37OpsUM}3Z8Mj|tgpKpbA(W!vOT--=zQ*pxyix;hDn%nW6OGmy
zMkE#htGA?D7sh5@?XnE@4D{;Le%XS!Zy{C24KD*|NG!A9EYoSB9rB}gLC8M1Ah*io
zx=SQ^Lx_qWsY@~?xrMlWHX>5GYhJ{HsMT=4J;xDl?DTxfdj{}m^`)ST0sW_q144oc
zwnRo`=`|V`8m+U{{127(<I%x8b{XT`j1bCqTK7p^LK^oH7GrG}fOj7&)_ldj3lJoD
z5>1X~u-olVa3>Foy_JXdWo^}3JKJrm@u_kU*^9Dk!C@E#p;r=6(feO)JeO<(x<oEu
zT1ye|ef-je6VroOFlQ8qR4EKkc1~c0Hp_!p(7%E}ypENUWY}{d8|+}BZXMl*wuAMD
znS}H+Zo64pg1}#gP3A&8_Z%Lp5YQ3H!VtHG^V)>oQ)Eg|B|GlGnq`n$<cLA*%KK5d
zNB2;c1__2?r?I7vF}7{VjBQb2L-eohTA_&kwJ(YXOd<CMuOedL1Xw1Ve|st$?*~N`
ze2N&BYJjRwXuf3r0Omj$zgfG7T`_r>%JJ-Dt3BH>m5wz+zX$0v1(Tv9A_HMg$RTK+
z3f$)#@-USKb6cy-q00$xj6@kKbgdK|itHzlVeOP6ROf@qW~+S05ez)HTGuimb29R^
zvsPA)*L7e|!A}RUp!M+7tFX3u?xXECXx<Q|f4B)Opc1Hs22L^3?+T#zSCQ-!dP;?r
z_kW+f`yZM-G=%{}x6Vf_>)N5502x$xbq`LlS_eZ0Aj96~F2Tr^3y<vO$bfMKzg7-A
zF(W-3)%Zo(l_W6?!mux4vxWbEtP+RLVAE;T-YHG+iY)!x^GQdB3Wd`#Od|U1nZH7?
z=KxPZ4#-OknB4QMnK{(n&qrhFU~{B*=4?fw!L2OD*oCFXZ_!)<&SxhY#i?xUo8y$y
zoY}bxHHDpM6yzbuCwbRb+sf^F{HAgm!c9QKA=|-@1R)74VS>Xs@hC`~sA`1zlAwl6
zN8|Rs=U_pEsFnS-fy2Bq-(oAm%7F}?bZpHXm9g7}22k-89!k1J4MBg16c`y|1xHzg
zXZ=&L*_9Y^0#P`kOZwi8k?)sCFSv#ih{BZ@`4~uDmHXc2%3q(c?yQrHX4Xk&nHoAv
z2*&}3Qk*Yk3<Axt|6E-tzS4srCfUO&n}kofz*5bGeb<m@k{FAPInF9(o(e1P0o+*I
zLc5PVAcQHwKC(1N5sbP9U3A-kpUQbIvpgUrJ&?0UIZ@McH0mJ+<5DD67j}Innsh=a
zXpzSvWaq%tm2x5I5Y5F45=ww<iMVuE^nKJH%C78If)IwaL<r&Nzp=I1FOq%Ia|0tZ
zTqg1Hk3qkp1k#^?kSU&<r|$D69CDtc7)a_EH=MAhUs)5XHI~d*uo4Y$3jpp0jTQ5b
zsf_yd;iR)J%i;hu0I&tnD<^7lUunx|wixsJw&%Yg5L7LhuTW(Qn03#Qs*VkTJZZ^%
zB`B#}M6}C#5j;#+zWma{4v80xzruz*yDCiuc=%FM$bDs^4eo$mbBkM7hWyf^agUuv
zmruK7)pAG+jB6X&0BIcNmf$H$>(Ekd6VB+DkV1greEQP!`Iji$1-SSUQo{Y<KBRVF
zv7?mZOcjhfQW_X@7?$xxeX5!N??M0d>6eo-*;=JSiWz37tZ1LY9KN&^Dy6VVHoITD
z{$`<?6G<J54T863j{#&;g5rD$uboJNe9mT1yQP5DihZvO6BsEEg;LXvyO91gg(K%v
z`5SLdlh!PONo3<<mh~JaZ0|@;fb3EY?CfdQ3)mNUMV2CofQ<<9nW4mPV`eNZWih8}
z3k_v}7je7J{q0(OC_AHEi$M^GZV5rr?tf#C>CX-DOgbAd)>J?^40&!dbGz3y-{L|f
zFI)-`hxguIE_17{4&W1}&5HyQr04`f`{&oL`^%dX{?to-JPtIL94G|E{ph1{h|{op
zVbPd%W^OBbfild`g0e(^ni9QGBhx1uZsIkLVRhzz@i9>pA6bY611VPoo4|^ooA-R#
z_4PmscX`4$N4z%RG`xY;%3K6LcW8#$;XQvzMC+M00bBYk6b<GJF4QL%v%k!n*p68J
zprQJ}^EM2Wc)DcT1f|b#Gnl_=m^amOKT2e1GH)V|7#pI}Fag#^6AVIt7w_b28S1;5
z0|2?4Q-l8N1YYuXvo<Lv!mVV)L>|+KWVQjx3&&7@`5^>{HTJaz$9#JBPU>hGjt8Kk
zqrOk9T!barh37JlMW>qK<IjhMZ+kukSw^4qk_kQ8$NK0prYe{9Q!ug8(E}4E5Ttd#
z2*gRB;;<&9LL`je_@nI1jvIzyAlecM9-{hhEO_!q0+7mh8_>|S0O8o<YJG#sn-ab2
z{fpI<q2EeGf%36?geX2UVXoFGOkEP#q#EeB#+VT@Nk&%)FIj||_;FXUHBg6aUKC~&
zi}!m%@UGVY6L<_YLQ5zn3rtL~8deWwfRI`vw8VM`TEde@>xVKxAidTIEdj^($T!|_
z`}c})2st}KODc8~OcrR}cRBXegoK!&B?IO7r@^znPs3*uny~vdz?7lKox%&XS%Vn=
zsHA2%2FDhDd#ngCn8$Vm`H!pY!?vaTVF^Y8%^Xt*!`tMVhee2xaHA-SCk94@yb)9g
znMkWFx$lJN@;(uoq~A5%#!U*lDA_ClPGH?bWAH-Ezi~U?)xN(ED+$tt^Bba&cJ+Fg
z$A0fY{9%ax9jZT`nb0H_;M8rUBak{QLQblubg#(Ev%HvlH`0X%$3=i2mF*KutzSLG
z|5C;4UBplvD7&rc!ALc|`(q5@#EBbT8v1SpVMus)c6jm+Wml9eF$lu0qyekm|6)tJ
z`|*UgJIw_g>L5@E$y1xJ6h7Rz_T=QY*(hkPC7hfdAz{ko7KsdMZ<(iKdsMiL?*K35
z!+)Sko_9HLqDtD}vhX02AEQmp#CXn29B20=6NB*38D143ew2Bs3q~W8buWs6gz*u_
zR>>L7w_tQ8fL_!DWBYY%|EEJCAc2s?el8MqgM6{(%`;WfP;NSD{lu>nNu&4<h=`sK
zj{bVr>48NKifH~(BPhRWvk6Ae<Q@!;L|flwV6D^y^dl1U3AKrQaf^)o;Z?B9Xo`oV
zp*MN1+MP3aEoFQR0hNb8aFg7!=|Z~>NI=S{`@+%O2)?gGRLc|-&#s7fPUS(K0e14r
zoJ!~l;{=y1knfUkL<(?Ym+C|bm#4zdH7OWCPSow)%EX{cC!e%?H+uo4To^VAi>oR5
z_=KCRF(PSNJZlm?7J&5>NHcK4O`^JtdTLG*&6Q1W6Q+SUu_jT=M@`we=nz(yJ!Jn`
zxxOenmm>&55QwIv;5YxomgfzaJ&*upIiohvbjQdyD1bf*df0geablgIS6V)zp|K{*
zFtq`0B)ro$e=hoOWY6%j7s~z)io3S#q>ZN)M67|~bvJ#a{`5l<>KUi98(wwqG`um9
z+_A?b?Zzr(qM}}QNS>DjwB0>2^Pv?O$D+Y)SzzyujoQb~m))v-LGLoz$w(K<2n+dv
zL}lKU&~D}%XAR^!83FrH-K$(1o?^nx_e4tt)5e`GfLkH3Z*C7ulGIX;E|6Gr*|spU
zFOgwF!b^N|zm%!ZLK{y!#ROaE^V&jZ-8g7>D%ZXzm{7fEtcI38{u@!z=vE?o4}{Su
zguIc_4~mc$8pSe#@}51c&#LzVoO5%#vgV+BxgMz(<CLA{a8{w-D4t-#c=A$1;&v2O
z^Yhv(Yu;hVh&xU<J=l@^MwO!-_$78WKm;f^gKzU0)I#V8J|_SM3lS(Asd+LBG%uO|
z!DlN->&Oh?b5cYY%zTcXUD@yVZ26C}YfFL{1YuXQB9GqxVoU57vdqW@7>A1G5t736
zvBvX2Pe>q7zxER7jXY?1Y&yiHyjaC+@AcV|Gq1HyD<OhP6idX0$&4s?ROmwRy|f&Y
zPwYQ<9$;Q!|6vk)=4uqH5mh3X%<)GkW|Wb=!y1`D#FhAe+U72>4GU9gy!LiH9V74k
zCW?TTd$F36j80<2k#=1LsTLO4nesGvbsB|oC?61*I?=u&DACOeG4krn5oq%IZNn4i
z*V(WolfPl33XV{dEiE(%%ex*eiA%$%ai`^|0teb|erOf+sOiGdrRB)`jHwWSl#K4C
z-npYR9RpGEDw8}y?vq4yY})AUMC{309)#khgm|8j@urO_!;HuiUbuG?g#=d1lJ)_2
z?naD4FwhTA=kTU*Dg)mJB5g)Gl%<e&g_wY+UNkRGT>0Wq02&LuUXZwgyX`_*sI(iQ
zm77b07(Db|D~}sbl$PUM51OX330HaW+4b(U5+gDNe2M-l^G2|ac_mm}o;X6kJiH+N
zs}oGvS*HF+*}3Ib48lNkO9V&^``=jSq*5#6AmQJBAZ``RV9z6=tE;xm`Dp2&{ptfl
z;d=1j*skoUmDsMRTIl$d4-e3*%)}VL7NwmETqBQmzQzqlOK*4W4N)e-2!sI0ls+=l
zXQF6${)%13p9Z$;MIS@xyeAAY>Jk8SjR9X+r=;IC1Z5>Kqo=P7c$Ru#;}4@RFg{xo
zT7c^5E4s)9BAf6i>e&GEXQIw|=ai=BS^Z^3^#At7U)4xpTu)}f`x;+c^fKh@wS&Ck
z?aKZP-hI5J3qk%5(nSW+E!jU*P(pt}`}QGTNLYebZ=Irb1&kUFJi1owD9n1hY41EM
zC{Tv3DWN6;$!sOg)Wn`W45c(f9eZMuY|Hd^JhesNo83%!o=zt%^jEKvS=x6&1?O%|
z^L4cdbj2*4L~qA)Tgp42MH6wOBf>Rz*>>V&@5wDS^V9qC67EA+UW5BOYb^4KgFM5;
zk3=knL^P0s8BJy`w@_QKCqfViZh3|sEWF+GGVpsX)(xw?@`T><4`t_q<1h>Y(JOgE
zW1Rb6th`3r6{eNK1&HO?n9nf7A#1pwjBKH}7e*r!iOjtQ7uEpl9~svY9vH0tXVy6a
z#PZ^)f&I3OYl&di(S2Z4Eu!U;_%%qRZPWW%(iP9r3!w2?^5C^PYu@w@h~Vgy#3!tr
zJ8S$x+h8phf}~Io)A1_YjKdq7k;^Y1*KmMhM(eH8J~k3;%fJ>Fy(6cR2(9Lq!?7Bs
zbL(M13Png8uD%|Q(>lM<H%<d)rySJGT-qJ7S?3q#TZsA!ITXMrm3qTn7kg|vU&AwA
zR8a+v+z-j<2PA*LENg6ym{@XHTvIhz_C~qEv?-2gOcxX=V}3y&>bZ+HW!Bk<yh*yb
ziWQo_8r>38)*JyMYInH2{K<lU+T9el;L-;AwVak(2`|*y<vgbV)<Hr*HPTBjj4IaH
z<hf7gz)={9a5!hT!m8Z>I#`Cj01TX(PT2o19rVW+rN)vo(>kt>-jPkNcV&7|XE!#%
zp9{J#22+OD(|q>;p6<qxF5m&`+4QFD400d{K_K`h1s(nW$Ch$WfRhZDJrXl3(n`}k
z@J*ZhG7|qC#Yqp%KTKtL*HhgyYbF&M@Y3VWZ>a&N4qn#rL1XYWuD|%H=rN8#e@ByZ
zZ)>fxWdHuM?X0)$W(CWVJ42*W<S==M+b~|I<H5c#?v2(e-^0(BKmD&Rh@@~f723T}
zx;+O5sPP<z7%i&Hwkznwi>JY~eYzVPjl6Y1{T0O(3D!So!6C1WVfjv^)Te?9Bsg!;
za9)gz*w6T~<k!GK54s`hXW*G9P))bi_Wdp_o&|H<;}DhN=Bo3{ANaat4@D8GAm!m$
z&kH%D5ZFsR9NihKhUi^nMr^A{2#JJNAjJ+V>WO(%F0rd{jCvN##DZ*~7OslvVzyE(
z0FG$>BWqY@w&%1OGjX+mkt8%BFij&_7JcZ1>qg~E`%(y_%kmP^!`9o$QAk41gRyM~
zui2o1Fvpx2(*<Q{@jMs`iadtyaG=anYy}3sXdH7mmWUR&Yc#{XIsv}K{ZV#CM-0Ot
z3|+}K4mkTSR$l&q=2{l;_1qW`2uUIhhOJ&kmIDO|_E3L&e!m_ZSukdgpD_wCa_UX|
zKRS_}446H(9i}IM%~=I_8VEL$U>u<++yQ)&J<^pKU?(8$gase(`r&W;x@Mu=T4QTe
zcH)BKzKjr?@>0G8jn1bLr+{8Lqo0Tjo!*sS(^)l=<ou(?RE^SWNd3u;Iwo2Fm|wy{
z%k>^>7i6^>1wmxQFwXY$Du?hnt%~1wt|D6h&~sdhrRvNW#Ts2eNxnY_&3GI_v){J;
zrTqPRa`N4}mzP_#uMNai`it8dpWOAXuPL2lEcw;*wwEIv8&VQSgF_;b_`<3x+xi1L
z8m%jGoyQh=FUtm2mYz4pc$B*G(7lm4BJTwWcz?o<D9K4*HVHb#eI&l<<!N*=Az|0K
zG@`aN%8JN)VdGQP)7_b9OqYOZo$H7R4@-Jwp&X=Yl{L}$3nTBvvDsLUW6GvMP-yuL
zzXVB+KSretfpYp~mpCkqaz#Isol%a&FbG4h)RZ)#_rKWs&3*wHX}CZYRU}|Ab}Tuu
zXb1dYd}D`BMnmq(BJaf))QOh?rV>=1%ym%kN>g{Ng(eLFdcsANs?*kqtQTj|$T4A1
zB|0*Pxl;-4L_EXuPo+JqsIo{p8}KQzUX<e8Cq4-%RTtaoe_N)XKOL{%iz^=~?*cT`
z5mI9|Zpi~k|Mt1{cydb)(u|!m&$Qfs3#1}(v1S3*oogLwFVhvjh=08-RFqDUbq*X^
zFIz|q6|||C-UZ;is}mVJwJ#>tqwvK2sonwBii|jNhf7Kk`>?S%4w2C)-XiIRE+TS)
zjw#)B5V>t^(^(|F><?WPF?-~tN{`t(6-%VOAXULe8CEu<>L>2ic=RLdh3d^%Ezvz*
zb>r>sh_+bby^KvUYcQJTQ}Rhe65A5-MU~6NxrL$*1eLebcge&T<tM#$i*~>$*z9fS
zcbTVas3IA;&NV)^1V8<buZNCxs8BTqfPx2l>JI6(^Z0wPoJ5XF07`-3!fCZRGQW)=
z{wTY)BM3qe){+lI>A$f{`~$q1rGWDsS0zYDUL!l#Nm_9uR`tVIl7}4EDm-wRt3cfP
zDl%0{US;(aDRA1Rxf0;KMpBKm0hwuM6wr~4xW=MLBt>=Y$JZ-B0&@jGmYf@jyA(Xg
z*<|IS^HdnNuqtg8D8{NSmtqRX#8Y92Hk2LSl$C3_Ev;8*6y^+H8-5Gyg|%Q;;bWZ(
z4}G2sa}3#Ur@r}hEXZKL@&!ZdyCG~(a!cqAr)tSYrx0T;b|2xg0K`R{6;ewd$NT%>
z5{!lJ;})Sa{y}$o&M&wyO0X5;Qz9jh8$iJA0f=gQg^@>Wbz-mVKsY@;8^G>e8F~gK
zdF1kPm8Oiv%j{PAon9)@SO}>g<sy)*Fcjp}yHGZlsPzIQ(@yJ$)ELRM*imrXm7w;r
z$UY_*Bbts{#b;D@h%d-v>z!*kHF23lZpqq(37=S0BiCJclCt~S+x7DAltV$D4MQ6V
z%UsN76QU_h+H1nllX4DP0nkZCGwxX5FDLPmFvKy34fhlW82*U=C_5M2h(Q>LUI~L2
z$o(%?zpT_<o3zqg0HGu%V>}-g?!v+ulioirV#@6;w9Z0%p$fAd%p&OzO<6QTxE~(v
zn-DJQR<dEE;u!=I2I|K_Do~}|3L-@>8%Pw}Mmy)NCS2Kh=EU?32REAID^AoC`o}>c
z)OO*-1n!t{|F2j3c!>O$$nocvOYG3zvF(Lv)_VAfx2Ak_Sr8xV8gp1wL-Txt!k%;L
z5bRdm<r;D0*ZKa0(k_IUn+)2KthWbzw@s+*LWtp-cpAf8+VAr?5}tA&8JurovmhW%
zuNZnO8%}l<478gQWM~h(O+iZL-(;BBF1;}pHa#lvL7*(m7riGmikVhC;Ti4gs@FYB
zAUk*_!UT%NJ3ipVMhAZmWP}s0L=Ua?M&_L?X>S#YZXy58GY`hldqIImba|f2!a&qZ
z>=5R>STGP*vv-|#2=`N7GKcOUrh70kKh^Mi?JT^$k$S-~iB=|p(t4#oz69B+k6d-P
zi8|o0AK~!UXA{;<WfxCnKw1s3kKgIn$M!?nwd6nyg3v2fd{w#s#fIl*0%%f_>1Gy<
zX`v##&vn7q=iu@V)XZE%?97&wEwq4lM|Vj_J6`%ASSiHA;3sh6_0Asp!ihec(6)hW
zV~<GY(ZVzK3NVBul6dq^olU+NLR^=u!SdItW7=4#ywAb<wa_1cN50TcheLN!{AF4H
z4c0<F2a6#Z&Ntir`=VdS;RO~V&Ldw2g*X|@9Fpt!^a8JU_M>-ffr~{=zjkP%Jq3O*
z5QNZ#Vk+dESm}AtSSw&BfG`Z~_RnIEf3&gkrdrVRLr{UC&s?Xx?3Oght1gTKfj|Nz
zGQG(wM7br3_9}q65D+jH$oAo&Py&fzu@2Wtedqx&bPp54-7P{|o{p}9GafwtW!jp%
zUG`-Le`#l(g-i@KLp10l8Gi1Tc6MDVq)RXwvND6*p1~e)?q)2htl7^as6R0+xj|X(
z1NpQt?uW<0fI>`Lr;+1b<WqKmUH}h-!5BKV^At~c>ZGQHLM<MwhT7J=CSdw)dV-l$
zBF~Qof0SKq4#gk{yOK_ZdjE^P);|ldC9fAS#t$r5TB?gWEpZ48%9*}R8F?juyV@~>
z8weuBH@OSrMrKR{j9L3s_gCfI3>P*qGGp)@;I>c}Zei^D;dlw!I~JKS(*YO}JgDBX
zt7~HKLeH#4Y7COt=D^Q%5N@^Ua0q`&7O63aoqz^DjGT?q2`5OcS#l#XQq!>#EJwY`
zI|vRhmfVP(mh<g2|I%;1L=K@>+oB>2yU73#u*P$|IJ3OZ`g7=+>H~{eit{_AXb1MC
z>|ja-krMM;mlp;|y*ydMTlj5HG?j9|ObUeT=b`u|bNBY5F)tj2NQde4r0VQ{-{ao>
zKVz!TS*H#NswjJBX?b3y`AzV7wn&D-_8GOb{3aoG*9bH(VQ5QQf#=d~z~;yB<~d_R
z)Qo%>x~d{40n8sPofHiwf#znJ5Q8N)*2@;ju;q_mIvX?1nW$(IH~XlD3|-K(vzfY(
zI>p8vv6Lm>`uCvRxk!jP-5P*$g9)bBfrS*}p~L(rJGUH(K^O>L2?j&({V%qz?8h#4
zB28ZaA><H0nyz0BR;06$aN*~$YP(3tTXrJutwyzd3xpqVgH3q0Zl@ZiW3Cnf9T830
zQ?d50oW`k0V>zDjI|-c?(|;jz*{_H&rAj@OFT>+Di&VuIhP<tMj0;ypQobxA7XWPU
zeU}D?2`Ng}z0iciyJ#{c|7y#xhp{tABnn(}cyVQXVag$&BlnG!8p2@QBS&#BaHZ9m
za7J-0AUbPnS=A*9_$fOLUp{E81`zxB-b$G#*lF8o_cAc*hSGw&u@}I#3tn9239bHV
z4l)~YY4xTaN~M0vUU;}lp9S-xHA+Xsg?KwvFFYuTpF{lgyAdMa&`DocPG}?KRh)<M
z<ksr^UO46}L6aKIp?h?QHCfegDZ!DLeY0I;sP{zfs@#q)_^DZvy)Xr*`7|~MlZ}GE
zUw0<OOWTY3-;pN9Pw&B-OlV!qBzj@ez(d8zX7|jn5dn}g|4ClhGm^3Eiaf2~ys`(t
zS{L^G_Z|LFc11@NgCJ}rMX|d7VlQbw-U;@uS-@)*HDE}dMWp;Luq?3WoC#P6L_80S
zm(G`Kq`s4;6?5c#Y+b^P?2H#5n2L)oUI2<MMYVAFd*HhmZ5pt>f#EQ8PEbu5`qjs;
zRza!G1H;8A?u9SAD4%>_xGW{o!qtb}OnWsJDOqP3A1p}U{(h&p;MBBAt36V$5B94j
z$esC4aiMAtS%@~N3e<A%`1d-N?;Mv_3xyDHCbzn>^NI^<V!pFn=vD5<QZlP@{lgc(
zj{Ax;g@n<AyAhc(RLC5|PUP*{1h+^JA}^H4MDm6Fhz}!KtHFx0Ug5f<5(_fY*~w`{
z1Sfg!rA*3x-|^*&LEHe4Eg=gl%A)Pt&W&<^^WxQUQ2u_}P`-}66I&{a^mk2jj&?9j
zw4w|hNS?G59wbT*K+jBDD@q(&XtKqv#`gBkrlX{JDr60ALGug?wHV*XsJ$Q9BFcOO
zx!t=A3;f3H^w1bA9QnK43jimpWR!bBlpMB<@N(^cip!6(bIYL^1fk%TP^7l|-`Him
zUqYM628b~}Ko4jB(lwetY`~XVdhWD73b%BSxsViMM}04;Qhwko6ebpQF227fJlM7#
zX7gijmrCrAds3p2R457gctPc!7it!?E{*?u#rU(Kv3ijK7tW{P`l5Wfc+%~A@xejk
zIT`oYoM?}HR9XnSXIq|q%#%@nM&1)p!56|1fzYmh%gbF;h&^KUGcdsE>_<R6@u{eC
z_-VKz>GI;&$S2yad4Q7s3>=C<1DM8M9N^QkBULZ>%9sYk=0dvSoTzfm{28TES$}sZ
zfBe8-wxA2(9mm}Z9$mJpV9;dBoU}mLzjZb(z(PJU0*@0H1Eb#;z*lbil7eE~b}5Wp
zo<pPFo?eH7gRm2p`Dg5a<P>}q?OF(@H`RZu#MWRS1>}`iVQqe&C6l0nbG+?p7!bY4
z(3ImU!z~Mcp%#EhLbb_r2dsj8`t@E39kehw72*vy{5ETu;asT$0usrucANB7+v+RM
zi*FQ0z1uO(hI0*vlhAaSl7{x9?A&e`2w@=DODZ@Z2Gf6I@sKYJk+K~i?f^e#*Fw;+
z(=c&!v`7;>*h9$;B^N}JwzDvB$B}P50}tnR{v5)B6A3dLzK=ea8D=@NPvwVBC=7KI
zZc~(_qnrbQicmt?Sr`W2#F}aCmzzHR5da=bER54T;Vi~8lfCC$$?kR#rZLhZ)(Z8G
zkm`tU9^n-3Bn*zA5X}?o*h?otDIg>eX40U-p0F`}`qX_1O>RprF}}1LYhcv41UFSM
zYBWn|D87{q1z#T*<H|<~ZhAtp7d6%?zS50OJN^F`?5RK+;RWsZcg4}|Fyj-pV&`D6
zrGk=TETHuxGZ*L#+cB6mfwFr<zaB3@{&>Q{P81A78>)@31@bL3Qa;_DD%u)IjdiU1
z={YKBAuLTrvPnZFBF913|5EK2E{&dqND<yeC<I?q{Nhnjg`hN1FtG^}FEp;tdJ#kj
zwWi+`jAF%WI|YNrCT@XN3;Mizf)2v_Ke7QDmD2ZOVZ5K6*Vl)#YdeA<1Ys@tVv+tE
zJK}x`+{~r{$MFFXL-Kvffdb=4VZq4?&yz0`{yXkX{T%8EZ@tBcRhWedGjtGy>E@6E
zErpH*tRMst5nh8Dwy#D9Z^uJLO8!KHtlSKkBN#l;46+yGVp<MsN{oG9IOz+Gp}Jvc
znW<sItVUp+^?@=0M1!`&xg?6(m=}+R!VL0<Zxy1wMZ3tsRFiHFOglo4K!%S)3(Yne
zgZcN^p(<mj?Sfq@5XMevT8tSxcyr28mp+Cpw)5d5;9=mwI9PEsi<sAoKQKa}Uv5>H
z4vi9X2z^j~k@=WUi<=zNAVuLDsL)brOB0NnjX*9pJqA(q0nh@w%SORfBtp|okZI6;
z_vE?Z@;s_`Sz)FfN-_Xj6B-N<fU;sIndQE3Bgn|p&ouaG&#YQzh=XlGn8Khit+0yn
z_f=5>V~T<n#IZew7(^r%xZW%KtrHnHxFf-p478IDsgcSIRSCFZGc7l?`aL?y8d7wE
z5i9cE$sc9sb|W|lL(z(M1R*x0py|Jb^<lnj6De*0MFjBcK3H0QaQqeCS}WyH7XJO0
z8yuAc?1_C+us>_uc=C<|0Ht8cAs#ma!;Dy?z<eXipkUJ}9yIf3IcpJj0-4Fwr>nrZ
zlW3YW_vm85Txv;t`>y2u!8B<+7IA4|>LS5O-M|6|Q9Wqpw%d4*!AMJ6a%sK_G!gZH
z83B$(LOi=gM>$v<w!+e}BJ2-dOjeI;OJ}YC#!(NLvHQ*7+9DSQ9GS=73Q%12h#6w;
zR9aQo@%H!&r7*hI7W64P;BU@{Wv{t*tBfnu17<9-QML0dTli>x`smk{13k$~ShZC3
z+L}4J;A~phkD%QvAi(WKwH@i}gB#52CwqAcfv$(5nOc^5P~a|zYN*H0Ak$=F1>F)#
z?R>urPltN^4ER}H+nWkE(Ze<TKJU~Z5(6v6PRO(K>*T|}W@SG{U{!%?07<fTb@#<%
z^mS=Z*kvDXW(b`KpN1a=4Knq(nz_1A=+pAYaAtnl>DQ(Gi~{x0iwUr$33^bdJ9Gp8
zQ+7r<5`-WWyppzxc>jwn<@_vSC(Q*&XLJ<d@#;OacdRe?$!ncDn@YQEy_wh_-a>Th
zs@viW#eJB_x6qjl;(HW}E_-KE+*aYz{z&+yiPzLHG(Y-J2`n}CgPueOM7*X3jIbp&
z_&M$e>G}fYdky^@Q$Qe&lmQZZI$f6W`#VFtsD_Ij(?0qu{Q_QV3EL6zq8dwUn7ey)
zca`e}+MM~VeaDcSypcf;JFcU-WhSt{6R|)*;ZJR-NTf_A{x4oq!{oWZBEm@eG;L^!
zUV?Z%4J2W^yc!i=?ydFVi(e!AE3snEgK;w8?WhsUluqR|j^Q9(vqRZhEn0;=i8_`X
z-Z8S^yedyN%F}UoB=VYrp#)(I()1`lexa|=mrUS;p`=J2DJJ)>;|q!IHL!D#u}sWf
z001N^;LR}Ho=6Y8gG`}NW4i(>d+fSp4h?T11Kh5%ZWM$<Wnv_RDDq!FQ)%2#zuN4b
zb69s|^2X*Jd^gR_PEZN%_=#t%c+m_4=N+(EshevaHpKX&><n@k3PB)xB~--k{V!I=
zE*ij}bhcfXpDHLgz9I6x26``Kw0Mqy-D|c>a1bZ+te8QxnSx?J^(j5?Nfd5LF9V1I
zYQc>f90$@eHuHbP=FIjz1m{q!H%}JDeVjnvm?m)OX~mw>3Mj`5(2@v0O&!zT&ub<R
zAKYMEk~0x0Q8Ob04rX!;4<4KA!bBv(MOQRq-9zxc#42m48#8Q*LLen@$X!oG6RgE7
z>Kzf!(%`@C`|B?>e$)|S+0AI<>B-Ymk*{blAj(xQgR-}%mq88N{YUTvZrU;-$ln(A
zGM+KKobLjM!sCNcCXm<wXVP|W+#Np0`fy#&iiAYOvWJqW95?bYTA9O65c_N<YK5ny
z!|Pkev+ExS%j+k{JBtZP66oK(7p2{mu=_f0?8`_4dKvA}sjW^Qv1=!-jNx_<n>O%J
zrF*^!r%j7enP&P`BjJ_%7WwO=--fpIz5)&=ik`XxJYR<<>h1)NIad_j*Bp9|1>dv@
znt&y4%<!sP^+VaYT?r6^FtjB{d1(KQE%6U<&u$u+4+jzDlEeufWlVSJ{TRC#%fyV{
zXA_Hj1naejDJFAY%hZhBv(Vy372)BJcX?uT(=s(9kP3+<nb18Q9X(itzLynl1~X)l
z^sf1lb=By@gr4WWs6*YL$Qc`bKSGZvmNGUINeYDE5Ol^{bT9>f_El2Ddq2*qc`eTR
z=}i<IMNS68bVFdR5z*HNdl-)t^TMrR?pvS>0bgtX+fDb^@8*(JpeqEKJ(NjRoSQKG
zv*N3ycfJ|M9daJp8`FutN&#tB6ira40V~;~*%!0OnWOmzd=4Td`PdB%pVVp;kS0n+
zw3=@J!&fi-36(_4AdP$$IS$gpOZRNqUzsbccW_jokRW($Y+pXiMkyNF--*2)Wf)A)
zA9M%Nq_zywED()wtB-7C)tOca#@aGO14Rc#x5hB?FuFY!5gfaSXs`GtCaHZdn;kSD
z)E6x?G%()6gFmF@aEw>OkxjJoGDHK$U>+EoVzNY<_U?a&VSXq(w_FE85Dah0O9yoS
z8#{cyG=Otb(syD~Wzhe2Dtmy!PGIBN%QiKNgcPn(=yje!gB2OZ#soy_%ps(e*H%xU
zLD+h{*^oOt*+6p?#Ixf0Gd9^hM5pqbIrgUl1bOnzJZid)^yv9yqR1>beu$^e*bqu&
z2ks|2M*?eRfypMGIKzG0y4)r(%m$fD-zdzZo;YI{Z>x$ij*`!vd}b=2?m(L%U<Bm=
zW}<6cu$lq`SiIAW-By|vZIE&RBQKGeg@YJqGuH8KWNe4FrM+EzPzxYJu$!TWqCGv%
zO#R|WS?Q-c3JfQz6*)53ky*#Rvg}M|6TnH^B{I^ZgjB%OU^j#E=CQqkN*-W#|FG(p
z(i$9R)+XHrcRaf@&(_lPSok9~7|tj(Ilcj)kRvl5N5S$^TM*#enOTZRdky{R)Vvn<
z!>Q0^vHb<bS{Fm2Q7G*X<N~#UW}scZ-q-)dD!djBqKeKO2G%rl2vQ+QK!e+i&AY1~
zqvM4l{9@o;*?56hx*qFKyB|r6BxK!I{YTju-B=95K(HkOA%^}NyB&V=Fyw?Aun<a&
z4eQzS$PR?@aABp^LTzoUI~>6sShdr5V^9fOnrW|^Pez}=BF_SvLBLK!{m<+7M#CF;
zEwoudgY1G_r|%B$qSX(t2O?+J6{$Tejal=4FNNNDBW{=TIzym3=5TTCZfiXj_^4<3
z3>gr|FvZ4V^$ex_8QS%T4Lu*Xu=Rc1eSen7HhcWx1N_d^=I0GCwp>qOr=8ggIaGDF
zP8h5GgxvAD=D9dkCwoH#w+ba~lSo@2^n731V3@+U#rk;%!3vyNo=0=x+o~e9+FOkN
zOB?xGvol(%%FSu$h|JPjiUs!B`7Cu6GKKlj1UzM#&<f0**esjDN~d!MDDw|{sAZc2
z|F>h&6lk%`mML~#pF&DWfza;70wk}}KAuy%1H4B<J2uokEaE#r+Hx(ALxGzK%Z?1i
z%#bp)+9lpD@+vh8C{@kTXb{M$lx9RkJwaJ=o<&0Y^Kjha(Iz65+wge;v48Y4too0#
zbHT9~1fl4b>_epPe`CWj^D-mYq-?;L)*o;=myQ^cK<GMJu0751zQ|{RMdP33v+M=*
zHzG($ib7q)0*uCYB*iW~5ny~D_DwHLTw=c{;EOiR?q(LV38j-S&}c}-n$iO?<OXPx
z_GDqZ2O5pdo3+im2}p1P-4u|>CZYAosJD2;PMnbs?8=<O#i#`Qf(@u1@{p|{ny?*3
z18wi72T|ZSXE%oe<i>VUjUw&@SU*e_ustok!fmjFXv8n63ws3IlSX=<7CK2SXlgiC
zF=B@{s8{-jt>6@B|3oz{wU|_<DB%GOecD$qc0(g~?iE&9(9ifgXe?Cdh1CCWfJ$L&
z1pN%01a!s?ODcMc$D4^i4n7_~trVDu)<Z@{+e(ij?QEIlSUHD#hy%e2_ddD)vQy8o
zvFmZ<;Cem%Sw+<p?WknrtrgrNO#_0>Z|P+TNWJ%?2i{mA4%}rk)QR!(U=d4l0skw8
zzZrPH@_cJ}U}A_{aPp0Z!;s3*->vsU*|{c341z%TN=Ag%`(JEncYmy4s=@`BOln4X
zbbtKacuGcE6U@ocY)*^{hDd01`)>WOZGcz*68QC@!+po~a<q-Ij+hy&B?Y?!G_1TP
zkKFdUJt7Ly{96hx9-P{losv&KpJ}=DA}iaaR^eR-B;w+VPXC0#E?6FAHB^4rfeWk#
z3SW)HnK?3xpg{UWV9j_%wL7nTC0)LFwqFA$95=-xWD1(d4Psk3L@fLtJ#!|ol?Hsu
z^7M<3{WW%I%}`$2JnOPak?zI(T!|gjq}cmfxXyOvcB52|>{CI*d9V3F!cn+re_D=R
zxC+f;=bzXIWloo~gI=(D;grxcl|gEuE_yF}E+u3Xidj45q;nTn+!>`&bAZCE40ei1
z7u!gbZ<*y5SV6E0oMKWc6Neb{g)DF^EWpNp@eJ3wb~0=IrtCc<pYD-gpSYhYbdv8q
zwWCNi^&x(->7OGXt9XgddB7DuG!S39frZm9=x12N`}b&Gb&n^N+@oNI2Lk_a89LU^
z@h^xw$&kVy%C78)p%4VN<cZjSW7#!70W~8jfMH%xLHGERv>gGL1t=z0?Rg&oYl+l`
zQ$HNskc1e-^2A5GCajK>tSC6Nr9va&1Jy0id06yJL(|`>y2(e7U551iOE}~Vy`;&~
z5IQm*4)4I9r;goA>TIR3q83l6_<HC)2QE%u5?!g_kLyTyzPK7*16$xs&15?y&21Um
zZ~J|uNwUZpBuh1sDVPEJI2^43xy@mrGrHC^Mhcu#y07eW=<5fubS4yW!*)cBr{9{3
zM7mM6Jc@}4ZlM?IZaR~5Bww@qmdhn(D?X*OO7w*vbPa8nU*}m(A=W{Qm4j4Vpo5tn
zyhfj+#6Gg7jbX2mTM}o_q!f>(n=)<Z<dAfrHF6G3gG_R2!wf#9?gbqXHX9Z?!>m)I
zWo}xq+VR2xxrTOZ3XJyzh%{bT9<+KT@Z4sBGu%7!Y?TKgJqh;Efz!(3X4XuI!tNDa
z^%3eHC~FIw$((<9kF>;t<i#268ra^1HsZi$!|w}j`wje|>|Bo+2tgp+k|HYf-&k0G
z1;m-70p?<2c-+TsF0A+r90<0fTZLusqhEF1@j__v$P98Ij6v|8sd3V`6%4|~6Eh0s
zC<eZuR@%>mjIM+xk50m7)3OTpJ?R$c7zJYqX|5b?gk?G__jz#gqBq?jdq!q2NMV^}
z3V57t<@p8HO65xo7ER|AmV)TBGVGQ*s+@GROJhs1m@6&J2Q^vOScTyJCiY=1_Z&^E
zPQRz{dA0it9VRprn>8@SR16;yg0d1@!?G7C-qg1N)r%OK3yr<}aWmH(`uiMSdUU4%
zyD?EEfe%lbs=^ae)D&zAaWMPz`}WN(+>Qvzz~2GbDD@>Rv8Es`oJUB3)<)Q0oPt_T
zrqEQN)g-t#S)bj{&q1(G@#UGHfqeqR!WamDIK@u7jkc(88as5DmP0I8!LNCZFR;S%
zk$wIHtziE_YeHQ(vHK}q3~xryM>QN6m9@p=3kC5C>=79&%hzD*V4<$x64j(an<*ZW
z>F_^<UOmGb{72cD-9QY&K(wVbN0{{A*!pFEHg+Q61}sD%_?RQxycUi|i|l&OVIXKw
z%s=Q4wStqNf@Kq(VRRt-yZ~ieXr$NBK^J&+a#4Sxnq|Y1Q3)K7Y8Mbh$RExKV^pD<
zS3t;obc)uq7eOaGk|!U9sfq$f#xJ-I`gDHueCgR)xpJlzolrbvg9~%EGvDyaj)d97
zG4OBjpPm0F%<}xIz?0QoVP;&0tPGCnMm^|x7Sf|TK<1eK9Z{?WPtY^L-U<{w-Qh8~
z7B?E^bRqIa7mjof%7;)^3|~x7&L1Abf*XbI(3oS|VkGPPFfa}uI~||b(D$~?yar4D
zgNEXjm1M0zEL3!A!ZjOX5z@sdKw6l#=?@rl89*)2O@2)%V?X&s7j&K!Jemx-q|O-G
zgl(qnK&M_~2dLWky@g&-^s!R?)Au<|3KmW50d|hv&$K{yo;$(cmYvWsc-Lc2iq%T)
zn-?gp3X(Go<30+kWzgdDvJ2X&3Wymh0OUCq+|#IDHno#Ye<?e&9EL#{3SKEJ26O+5
z)kD<}Y%0YUKvhcO?fK2`U?-SCj0%AVQci@-Gtf$$?Y5fgwkI5moxK(DFfBnFRBt%5
zTB|7Vl}7BPz(~0AsngI@pzv$KsT1+L6xY<|?~m3CYtZ82WWyxnr>U&TX=r-EE@(%A
z@m$D`ttX<F)6iH2U~x+nG|Ch2$alZ*_1TUp3ey<tyw3Leyo~J=_s_{_3hp1BL8N}!
zvBz#?!X8GQhz2OESZz<W@kH;EHs8+`RNVWBNlvfbf<X&@aV^uZavGY7;KyE;NA{@9
zbqq2YnG?`(+3eG#>}>bgz>`cgclw#Skz*6X{WYThfL-d$^EgXI3%mj_5(9yLk<2H&
zNY$a52A^+sMO7~*KX!EDN}uu>EClWEV;Ff0UI|8#p7NRPZ;GcJ%Ck$lm#Gy`@eK7G
z%sab!TH>T^B;+l6N@q&h>wnmV4hb2^Qxe^)Q#Vt{P-U*lD)Eh_m(Y2t12);Wf54mV
zJZO2N3IBWW*{!Ki1r^)PjR1_Tj}K*Mm%}g&!r&{lB|pvmFE+ku(j*h4@U%BJ(<%XG
z>`G`gY--FrZf=2h_dZu%4%wwJyeHXq>tT4cIiD?yy3`34$2*+T9!wha32q{{B=Sth
zqnjW-3nKf2=0^i66nF@23dM8WqA=qv8wD-|iP<;O8FvA<rDNd&ZZYVEN)G{@y<Ptd
zg+u|kP_q}sCJW5dj~NT9FHZrubbY8`zh7#e(MJWh_ChvfN2#+X&b@}bP82n_LN?y)
zVOasVEXf;1s`t|aotH5FwR7BJzl22#M%!)J4aZMOQRlGLdugDL#oziI;DMsv&Qqbr
zOI$BZ73h+p8A~gqLfo(~#PTmcZ@sIVw_FFkkcp;oCto%O<I=xKW*#`rM9<!=UO+83
z71HDr*Og|vJv|DTMW?Vctn#RML4}fh6d;Rv1cOFAtOjyW2XWIZEOkP+uSO1PD36lM
z=6N2(OzA>}bwN0XjzjtR`;8yU&M@0T5Cp<o!lab_Z|w2){uJs>HsFad1z})*EWLu_
zL2QxFMOJnXs!0cjpD4&LzdjIe5{B2H%tvk5FKm?5KNnq^{Eh^fa!*E>F|kMAkT6}M
z5FD02*ej%%?!h2Q#dup;0*7mC#-urw)IMtG@tt4^G+JERed{G;&MST0u^wRwKtdoW
z$m{qP`oo64twEL~frq{FtKy%0+zq>s7qyT5f!lbPtc&IQ;h=@NE(Pfu4+NW@yu!u-
zJ=><61jj|A8g)?G#3qk|lCZqSOqSX`2i5mXCIgESXlS?}q^SR57dp*tB7KuU<9+6s
z835A={;J>SV~0`#jhKwoRu!I#BVKIho0n+B6Q?)Bl&14GDeou1=xd%w!tmh44)r&d
zs(8@V>#R()Z+Uq&C?M^q=tq;f^Iu}3Q@0-}+Jl{PgL-xvoEtS&MG>`sFTFzK!A|-2
zzGpp4r)n!mt_~$AO&}7^+(F&RJqeV=iSEiry!c1iwdFt%g0L%%;EVfTY^lj+V_7qD
z0X{ktEm+#EG7TNQ2`y@V3PBqdzhX<kL3x06V5I_UEM}v=*F9pv9MbR3+VB+AgDZSb
z0I`!u2pzCqUS%1dUPOQ&ahUrMY{Kh$`F_kl845iC#I6K$?qJnBD%eT=iRHZKktUpy
zi{Un$edfR@p}ki=VIdUy0CCl5-u7YxJO%;Yb4w#x3Ix!zVO_63zg44e-I>6GUf<Na
ze@p|xd!kaJ%mfx>Dp>F)WKGs>I&Uf;v7mXsAl?lDb$)k*2*3msbkzwg5lo%F4x~$6
zR6as6xXbPxs)GmWFukdKgo1~RrbrgV#tozyVTSW0;5f&^CwL@98$p2zie~;7Sc}pV
zNsvpjX7RHI5@^3KmUUowa!im*@?|NdVf%P3X(}(2NP=3DCySTuSj1LuzD9iXkp#6Q
zOBN)yJldr$>0y}bOM+UGAxkl&gJMh$31T?kB|$BfJ(7x_?;x1SM3eWrM=U;+om&#b
zAP5Anlz{lS|HYQ}FR)g^1*}~v=qSw)gr(AD53%jXsAqDXCsGK;QCdntS_Zy^T>$?B
z-3~fgT1r7$2EgQ|)~xiLjemTJ6oh4<OPJ${b+9csjcm+Q(3KG`*<F+UHrh$shjov!
zcxKxkouz}Um<h#_f}{*w2_{xXXV^9Qd=qV1kd%Qc>1;TD0ttxFl?FpdK~z4O5)oG=
zI9Z!tYBkllq#!GwK#4FYaWVl8?0J0g`Z>lT@Xk#@6`T6qaE&j&_!x?ieReSo&$#7d
zMUsxpg0QsXqlpwmq(u)-Dkczb7#R2Wbx(ghFe5H(T=M#s2n^aXC0r1Z0UBw_OGy{K
zy6wL3_mz*a2qJQJYF-T=#}%sxQjm}qd~h*tV$K<ll=-+Uh)9ba=AK<`b)HQ6dSCV!
zhi97ML~(B%472?8Vc}ySf`Dw+r!m2ZJC>%NPAv$?;I-l(!x%WNEVlQRrUYw2RR*gS
z@RO#rYJn>1kFqm5f*1sWXiHHdf&LpimOqzs60QK}!X)~TWij5}r9qXtxjc+`i}6Lm
zOHfMEA`PZg@_2ZV01Uhu?`s~zu)8~~_+1OxmD}^a>M;U)E1f$=7sffC*;_T<Z-ii1
zFvmWDDu!k=^`BV*jX3DO@KB8TxsYFZkr_(^C6%qGEzZqbVeRLv!;uC@>bZ>F;7Da*
z<S>jGc326|a#Jl0jC`n&9o%%oo){!~72iQ=U?d4d;9nF70_hRD2utm~fsv#TnR2I<
zEA%1$;SV1}K^G)hx52mwcyN>oximPEG$S(`5#mz_5JBhPhn0_^SbX1L5HG?$eqF_!
zOBx)>ni0wJ!i`o0H@<w421l}FL}fU<C{w8?<swQNB>B)0w<6P0%v6jWea!;w(qKta
zl0Zut=dwC1)~clSdo*k}v`s-_&X>e^$v*;`23^{*(k%^^B;Ck(P#~ETzPqqZ<j=Ul
zlE$R~H_I8`5M+<{b>q2zl$}wM!!QU#ujB+_<NIH1k#|30h-X6&;Av^nK8PgV&qWlF
zF#r~R{c<idBUnoTCM}FeR??o*6fGL}RZD>-EeuFjuhN&9^h$s51(>uEL;i=qVKgV|
zp4YudfhKoF34J01R3&2Q%qln(U@~Y*=yvhG%^V@Tk(pmkK2>8Ln>G}%afat^M!e}1
z<(p|wR(=%7F~~~%*I@Yf1X>xjEx+XdXCFWOQT&JkF+QXuYh2p75=M;j>XwE8C=laA
zOR_LuS5Dqs(wbXR_Cf&}A5xM(iIQ;U#7xDP#Z@RUV^ETKGt3<t?1%@I9~S)xg=&P@
zg==u9ASZA`TTY@VkYrpN#D~#F&l?vgCmjhslccmg0_9fTwnLV4@y3_MV{$rpH-JyS
zB2<lGL@)jceC9}LVPBAp+kruQ6UV(AK!HLjWV_@*q^5=sevRBo2LvtD0=v(${iY;%
zx6SCs2sqF}G4>l!I8HVvc7LS?2wJE`;7G>s&_s6`(@9dJjb13m_@V4vZy<(27`#%G
zlGpx=9bfNP9ifH=xWiHcp~jZ$5-D8-xLIc6q}1=&Aspem&3YpFjl)lYWYmC8*M9ko
z^W<ZV6C3Agio^+~YUnz8yK69bPyS$(dy!&h1EIw3=k_m_{favii3{I&4iDKMr7VPi
zwlgpjXvpbW<woKJ`f2&QfPF;{!4PR7w)bv?9sM`&Z4zxO0Y}%-fOlYi7c{&S_QJUm
zXo&DLUd`yMPJh3fokR}N&`~7U*Mc>Gj?B`~?MlF*jO2#CJIl-7r`LnP5gJt&y73n>
zE?_?DZqL?sox>qqlFJ)a)HfdIkzS_SY_xI?hmuLIN6KnoJ$)26L?i4bTS+9Y-?EMB
z=r^NX%pi5^vL^CwN;9)HAIU{V$KP?oy!D~hC+dZDJHo9dV30l%8wo5>=46Fzi+m?w
z5dX<%LBX3Fbnn(ye%hS?LMD=Yb;pQppaR=ZB1dQ_k7Pi~Vfa+0SM)cz{zuul-arh4
zFnFb=2^`sfvE$31(>aP-7N8Z%!+>KGrhp{X;>QyseDZW}usu|l)Cx$l>s^<JdM>xo
z1C+BhXsv)Hg-Mbnu;u6S^npaXP28-2C51_{ICn_LWyytK(~HQ*bO=eAzDry7X0a-}
z=g7xw2%7X<$)FXqN$*{C*a~Q}OJ8zu3PlU-(Yuc~p^y2H`wrJo3&$8Mwrb7_AW-=w
z=$$T8Dc<+&-pN)#hALn(Z+w|i-C7d@eQj?AWGDm^T<;tc7L;1=jRR~2Y$ya13j7(J
zy)v;yjOWP5bm-t4J=u=cR8Iu==AVz*(BS~&2jCmL=&e4o0yG@whi(NJC?X}ntLDXj
ziI4f_ie?2EC=w;ipo5`&N6*uAUw8opibe@qx9}4XrE9j0MZ5q5g;N5@2vNujQOvP*
zBfNkDMWEy&&$$?|EVHSXlNT_cvP{~Ae=H(LjN+c-o>Cz!6Izs*H04fn%Y^Ht=LKMB
ze+`tD`(Q4m$?nKl{sMm~JEJ6rK^TT!DJHQ3_rKU$=}&E!$?5{0si%+!NY<yYz=fXg
zFV~_0mb#c(p9LULq3633=f}>8u<^g}mZ=2+4a;1TY2z}`WKFShGuS~uLoY*PEx5vf
zYY>Ir%WhkdSKj^jQaF(5wmGiW3V{o~zQ9En7W1C$Gms+H6`-&vOyUSSji>$N@yIrF
ztU!gRp14>Q({2`?^`RO95~4oIJ$rHN66R*(Kk;bWUYzyOHyDMcPFfky?m!lp@JnlQ
zyjR)&^t94Acy{p0mN;BrVIi;|w!w7}Zu^Rc<cUIDZ0f=f0W}29+p9<*AYD<B;8<52
ziGxlVKhuC80?}m^NnkkVl+e6Gnki)koV!a10kuO1b5Y^|i?;a*G?x`5R077=c7XYU
zbG?_{wjsw4ET(Lp9K&tQa<5|n1d_`F66W+qZ%&TvT3zc60q(MX<oRk%DhCGhSQ{q^
zY**wXv{N#{(#?4Z-r|J?w)@tP{84rVNf3h|>`QA=ga7~75_@VKrsV_d4z)EvNbb!m
zu=L}sDR7@=83k+y6?~<EUPO$@QFd#^g95gLGLZ=xxiEHdcxs27K>^)FePeheUDtKe
zv7L@>Yhv4;Xkr_aNhY>!OzdQ0+jcUsZQIG)_w(cXe(qDdu0CDWU3Jc0d#&Zp3nL6Z
z-r7VmYL})PTts!Nl9=ar5G0J=3MOSYMRoK}2;D%F%acqLj-uUT?uhTfT>k2L%t5N>
zt=bCHd$z`N{ka>PMP*8pY-wa)>obLiTrdMDR>KQ7dP3bZyZo4c7X@FWjSqVLTEs51
zJ=1Lv0bgw8t&1rw-SO1^9Qg^p=-xIT0tmt&MgNyagWJ^6el`gTe*lo0r6J!;%QOBC
z7l3W2sFE`(p6?HP&HStBlu~3T^_Fh3ZqsY1Zuynq2e{WEOBT-P<UBEAJ^x&29yt-x
z;6rf*2Z=eNCwvHsE9PwO37pxbwyPW|e@Uq63cD)_%B;h0)~+BgR-qWp@$+XLP&M_^
zH5!~lqR`|D?j%Hc&LwUe#opX2d%^fHE>XBkzNon}wSWhapmwU>1cG4s<Yv27hDACc
z$(cBi!02!*SZ;<QoyJ)xfPtlM-1)MF`JTcuLH%YD3Kteh-GnVC+$B`3II39?^8Sv*
z{AlC{gH95}kVe_B^X;R)AJOSOWDO*dIl4uGF3Z)Cld%rMfJm0Yi{>L{XOV-!i-JsY
zhuW~wiWihnE*~AGBc4m_@Mb~L3!;|U9Xo}5h!6_DG?9@+r_&fqGXn|zi>~8DZ-nrT
zrQf&qr2bEH;p#2XLWh>;U2Pa}f==o#P~V*GSIb-Vj5oe5$G8rvXpx@%x}l?mqtRIg
zOa9HQ)ahm!RPzm79EFI}QugHm5$^1uY{423_5}N*C^^b06nxGDxjmTF<7cjAWKv##
z1ww&2qyIn(Ol^vmt06kp?ATP#pRd+2o=f|UT8V*raH%}Zj>^?PHWytriOb{x&S||`
zxhT?tS4Ycy{Gy4{&BIRXXUyGIOL2n=7+W33AMBrEfeaj<0U=af&u_Wjs;*Q#$o(v+
z?+HkD`(Hww3<sz!xV`;0$N`m>R@#%N%*5BbHgbDZZUG;&v+eLo0+@6xBPsO)G0q}&
zm3=1Vz&f$9fiNKwv-gsdz2(H$Z|{l>!mfLw(#}=6g9BpdU+WZOUO%ANxrX3h&nF0L
z1F&u2AGav<Wi8^Ata4~dYh4*~YXff49i;Jphj!w8G|P!yJ*C7tR2iIcwGbPJ^0m@O
z7%+q}--HOeX3p~m4-w`{9(v9Ve=1v3<N*s9>7++q<k4cFpo$++7dO&0bTb~(B?^G*
zX{%ydlzSC;8F!Efc~9H=Ge*`Z>DK`o?Cj=S$-M0(QykkNb&6G#&`dE&Hrr4xi?O@2
z2&(eh<h5}a3~-6ZQVMOrhUGc<zUD?nH&22E0Z;jk+@Wm6IH-TqHCVib;~a?a*5_7`
zdBs#dWV!od-+djPm$BIP+P*2@YQpL}qW*R3BpGRYtu<Z<$6x_ha5|Oo>;S6kEP>dl
z>G_%9HSkv<Ao52(Lx>2fE2WFyPf#<;$?#@STQb76SA*qD+&iL|ycA8dVxH>lAL&q#
z&m;m4<7sqF-BF(d^{MgKUN#$AI%%etk-<vo0h*N4$BT{iQufHd<&n}Q4*Q5|zjv~4
zkVksmzkb9=qm{^XfV~HNj!>#Lf=P3SdhS6VYDf<$ejeRTQ`qKsp=8J?%^}3GU5oL$
zOh~x#jI&-h90T&_OA{FqP4J=DLm}WVq}Dm%d#)l$|9wjFRIzB_AI;TP8okZ_`f&=i
z{xk{0`iqe!Qik{s@My(+QR4w{TYtBsA?$-a9_i7hP&(hppM?pv-Hag|B)CnX#f_R&
zW$SFv<IM-Yf2#}ReRfg$lx=p3En6n8QMkDYWvsKMpciif?6XIQz^ywDn>Aakq|{-N
zY%y^H9Q*!RpR+~7BY%?Ivl733?>54KU=X`nnSnc$06MPNONvFX5IXa?mh2sF(HMS1
zc#2C}Az$&OffC5(j?C^dLM0V(wLFGWUvR6<7W1u{&H#BYIN=2OA1C+7gn_sPr&2}V
zS+yd4-;AK<LSP8ZKOI7yNzvju*R|Rkb`rdlc~6I9!wLzK;9#zj2CZ8x%G>I)1<DN^
zWM<Ou2;KG9qpw3bYiu)^#R8@>Z(zj(*5h+m=ziYM8;Pw}$kY->+QAcRM0L4qQh?c|
z#4P^^%eB4?T%v3+`N3s7bf3|WF`eCv0r+N$43pfi@3s@>%|<}o@IKJ`@m-PRkB7G}
zp{pJR+S-2817VUdZ8cR{(7@KyxE}w?q)|XoM`qzqb`hRe5D-j`jm}Wy#IG)sIdC!&
zFJ2ku`1lg#z5Z_rG9DDO#dz4_`x-g7;+dsF7F$Ka<oL0bU>KSE>Gegv+3#Y=7uT-%
z$_S^|163e0^;iDt8A!Z~oLF9aKi-NoO*I{11tuvVS}HiEvlH&*jB)-nmI1ed2`+HG
zcS9?OgFmY`B);-a_>CVbFZU<~=r!*~yX4X<q{D=jFZ7~m5BMM5>0bn_{#UeK-II=%
zLoPTBVX_}<eBaD)diC7|K4H_gIt0t5b)wFja5Im0EOb)jD_NcL9PW3`(D6ti8HjNx
z|9FKJg!P}cfy#9P@O!b)yYLmLJ-BU?l?Tp=$!5WMC@SM>#``|C!+DLd@v9UoW*sqo
z6pj*1-ws6+nw#JLthjU{_wT<t4>hp9fnjc_@Xnf~Z5^6#TCJve+dgGn7XS{<X#Zv<
zXl$eg8tePZxT`E7y0mR591}cQGlUNcVyv~d0KrdmRp%GOcz+QGPq)h|K=r01Dw&;|
z%pb{X{GNPP`A%dz{Ua0@+@=yv^Mh$YBqcMQw7@=rm9jMQxR}1lp(|gOO|i_=bjE~f
zWP5$pM6G%4$A@n7s3Gn3d@t_)VZxy_QXH_oY(opw@W>aL?KELBUWEDJB%-li)iR3J
z99Z`_-KFf(j2LBi^Wyhz0Fk+|Y_l@?_cFCt4Nqul4lQg*zjS87xydc&qv(9S3J0WU
z*QRPr6!HNq7w@Y1L(l<6J!6az=iR+TvCnO6FtXm|VG%C|1c2`6?)MSPuv9NQ?9Uq>
z(Sl`rk{vr`JtBo8wXXMvDL6bFo<%>hTRburw7Bm@Cp@AMV%-+a&c@Io;oPrH_Gwg=
zJqg~^{<x;?K?Fu0{zW3P3aL5c=<L3laYw%p5i#`M(ul@cvh0ly=&~T#Sbmiz=iNQr
zYP@N2$=6j-vc7o#RzM6R9M(57QFKS{W+c56bwGQpqujgR`JnwViq7W16<I@EY@kdw
z)rMenL`ku^sSPPbo$Wsq{jtVDM!{k5vaAc|4a_8i<(LWut#;aa9+*?&e#cAASp{Zt
z=#bYS4nkAS>%A-+FtWaE9E52_s8O6u2U4ZeBr=eq|5k#v^O4r8nC|*QJ7OS3lM}8~
zS#cq7!CRvs_P#r_7N>apRme`jG%jm+I}5jfqZ6WzK9q$5S+1<Ik_1PoeSqg1*ZNs-
z4j%)e8*9mt(b<E3=(|eX=7r#k67i*RhM!Tlsker_&S86qRt$gk)bKj|F>G*tfy?qv
z#c?`ufD32!cn|q(U-i14qB4sq?encH_sIpk81g)XmP{G1nC!WEu90RUaQ}pqbh@BG
zIFzfG2yi)pBH&@zqJxiPO$x!`s~b7<hg{m@odcNPFOX)kX_efge1f`<YAnHdrj$M8
zYsoG}_xE-D-9#F|i1gA&xY@RBV1>$6EY%UVXXzIhC|>50`o5#-bVwlh{gYd`e%O#c
zayz{5bv%uszZVp+yU!vJ^F1CFNASB{{L9KM_Bf=^ih}Unw<eQ!FG3)5Q?LmNzFd5s
z=)AbAg>5^3YLqjfov3P#Wf#!ZaV8n}jy*~<qVOmIk24GC=m-~&`z&Q`Gc(a^XlAw8
zyf*#@0pn1Y7>4`CTW|sB(@n4;1cDvhPFr}+6u?@VpWPVpe7w+aPECH5NX4ZkEr^J>
zg0WuhqGfKzMR8tvJ;m11OB;ezDGcbKRKC7y(SD<wFM0K7`~XoZ%@?e&DNzp<iNFJg
zwo~}_4kitvy>z4JI~R-dtD&JRFrmkCgmV>zhIuJTiY=lm%8lrIV1DZ1b>h5ozocKX
z?kaby;0kLOGSP#x{w|gt$Rj$*c@3ayT+WB=J4bno6iyUSsjqt0t;v<7o{W{CoY|kk
zm<>5J6nT7nfc)UQblP3J{D&qaNm7qJjggEu1xwNDEWRr?Sieg^+#~pMDgsB6-XLKN
zG=PX0Q`VmSGfC%9p4cKyJRZ8LLWx~g2n*UsE24w*ScKCKJ=bI9H{kd){7wiHtzelN
zM$Ug@KvZT0Xk1dn!=j~1nL~<gIyGxvdFe!pqdBeT?6MgbNlDm9MD--`i9srGqWN!V
z61%vhaRF2XS;V8j;$(gle&g25{c@BkI`D^kPfL<`^<&Wr9h(SquG<Hb1RH_z2}5&Z
zy%8Jo8^l92v2Re>r;>a*O1}ZsWD*Eqjc_~)Foz65MqiPGbj$sitEMZouO^Tq9>Ya*
z@vgJ2tD>>rr>Wthm7|^*&`4o%zXgSZ+3kLZQo$oU9=YF#b7{E*!K(wMq=Ey`c${m{
zRtntK#7y3V@9EJ82dGnNhlAyh>e8@IZik^H>FZa;a53kM<B9=cD%0<%e)1Di6?`db
zKeZ_bjIN^)CEiM=p|Lt$!r$p2F$$okN3NS~a1}vJDS6|}2vq5)w#(tg{|@*{TdkoA
zv2?l;xE4)s>k(OpBYJF;dgXx~wp9p4e6<VD-%e9MGNFDG4?Ul_*g5swUa@eJk7MP)
z5$FA7;WXJfm;7yOSq8Cd14bykH^<3Y@TBqN>=oJ9P(u?ET1<%=*0oDmn-;<;W965)
zAqz)wFb<%4V(EVQakTv%vO?51nj{Cra)C;V$WAX1t)XjJKcWwi%Tt|doIv-J`T%l2
zH>8l(VB)cf)oA*Kus0M{ox`>T(sm_f&BphDY*K$jFrohg`P_L3g&s$9^l(#1QjB*g
z?7Mw=w1N4^5R46{xN3rH_#fkmVic9Rr4G?P-(O-IVudx4R(mInxVhw3qUa6?92#3u
z3v%d_T;&S6Uw2@IVTC22cDv7I4d0P;ZBM2MlLC#Jab36`6B1?DQs&8+QRz_+NT~R6
zZxa40+^n~Rc}+-i&sr{h_+?-Bd0Oe;d25H#z>*$^rB%mb?Ij{M>G*5;g9czTg(UI_
zWaNpsE5Ry+QJ&8fVYF@%y;ZvxYYO5bgnKT1z$vk_L{lbllt6Rtenmy$?^wpdpVN3X
z?;PeBnB;o4I_)lIY;uopjDw4g)))hZ@fD;~G3^q8oOW(IJ+4njl}^IHb%5qGXk0P&
zg7clQX5~{_sapAlQ71kxQy=Yh2H!~4740<%B~u~}Y849GDonI!oB+uh-$lva)qhZX
zKjZYeSaJ?*(xVS>35YZddW4H^d(8V)G-5C=ii872-q*J^{*^lU94)==yE*v(<e${V
zB|yGil$USdi(Hf7rwy(_B&0I*q2x<aF!I{NSBC0!7(4!X@uItL+i>$3YN0e^?Z3M&
zB?%w}khR1RtzQ;^im)h%(U|BBVEFfuES|6Puu5)*mW6Sdo!7D^--MjXT@^qHlf~>8
zS`s>9CF|wOZJho*Z=F8my38E25`{uO>)VzsKhCZ;uU{YjWNM_i$Ml1(WS64d{ev8k
z{}m6{UmhYNAe<vhLpH&Df5}E3G#4!C3R^XJDEUxj@bK2c1WuC}1q-=C4V^leSbLtZ
z2wRPC@q~cZw=7D|TDUVc6kouPb6HA3+P5l7PA{H20=wUgy5;-+3m_Qdi;UrqMgCFn
zgD=M(AwRtFNt|2T($x2t{EgcmfBCSHSR9G%LFuoaV?HKn70Z0TEoKeSmp_*jqk@#*
zV3)A{W{eTX`cH`8YUN&bGGrK7n=nZYj)wsb88(z7Ro~m-+6c>qq|irt%(e5^F}vY&
zc<o);)m{@+l|<Bov%MSnj9kbU`i3lE2~NCAl^Zbg!Ke^6ghUyLRN59pTG1sQsS!|{
zHwy?T5c4$c`MJqHTZhhq_+bJ@Is?Q*B56s!D1X$F8cmqQg!~XK059wl2rux}E8Npf
zM|GVA3y3Tt%f-UGoYDO*=(;z(D^c3gbs|>tgt~#a^sj0Mb}@J;El#E8*9+iq4wt9{
zgwzQ>N0Cde3nIpl-6ph%)G%@U5z=w8Ly2f%Oj3RYz|IFt-bwlL#yn%T*Rsq#Mvj%(
z4<w<YGIvnC|1QUORe70@K8A5pxuoaggz#Wy_CW>s<Yf>KShKGu-;7q8%^OiJ1KW5+
zD@YSet2lT^F_`_kW{zROAqb^|gQxHlwk$*sC6uK5r8|LP?_y-f9i?99lF!g<*WH!?
z@5hN1j&7Hr>&O^X@!)DppY@;2Rs%uj_!%GYhhns_5!YKRzWzbyeEsHhBHc5sc3-Iu
z|Nc~x@9_83pTB{~j^W6lvY0Hq))|O%I`F|Svb7JWD8M2cqL9RvI^Gi;-c;p<SJAbH
zTYlo5b<C#cbT1uX+o!u_#Xsa|wwzMtDLsPZ5m)T#N=7j@NEu~+jr_OByi4R<+r;;W
zU8!4_P2fyo-Gr)b4f(nQt~BaTQ3e4u>Xt0>PD|2KkpE<o>ch0ez6sN!>o7vGrJR}U
zm=u#vpS~EOUQoYkc5v?14t3v|9EpsD;2g|%;hPHelrOxxcSP^8A)%jSaK1={mla3`
z8kD!VS!({*esDCc|0G7@ZCqsgc3mVsRr+AWvNjOmeD=)j=n3&xuOFx?Sng2_OkV~5
zsE-}y6^E}62y|7lCvxw2=Jh|YzT4=l)`wH{qf2WU9A7it1^nS0jzXg6Zg>c?3+DL?
zyRGj~dOR;UgWYc0*V31n67~;WDl#sRCS!a8E)?#^3OUjmNuTr-;hQ8Fr4gGEz54*o
zCyM1qoJGe9kV==Tg8M=$(S15+@OOWZ5{`n_i?S;v$e51hTuvAh;_FL`(tao}P^ptO
zDghneW~GzZEaZMH5A3;xQISHy&>1@(M~^_({q}~di%5FAc2Hl=l{OEyonpgD2q;Gk
zj*H)2JO<Dx@vL25puDA4ZmLrB=wb3z1`r)phu_1wrG$%~Q*~qA-q+6dM|rLTHLe*j
zGF03C?yzhy4hwAk7bohkFpB15!hPS<q=>f#pJuBq3vg>>(U2stK$gn|&v74v;aWaY
zlu;4NHdM;p8K1cQOO|x<!vWjMBD@FDEgKFW7m6D7!W@H(PtbU$#J&P-#V=|U0&W(o
zo9Z9iwl-BXzP;*PTEn$#?IjwVkh6&=iPGj`Qo+yqEe!N*qdq*0)33L>p=a*QD|$w^
zknjP|2!1{F`CI);ufD#c1?gH<N{e~Bz9_Xo@qFkGI2pZ;_01tVGuI>xC%k2T>F2K*
zKdJCXyA5Ss25(4{y?1((@Z{TmCG6OLe$Jo{*=$QPu6Rj~7g%k=%OXiKSqQrf_l%!Q
z6i?og6QvbjyG%YwSu1EDG*JA<zuGpC_F}~?lr+&S7&}!hxYf!L*%=>%wYytgy0gGo
z5TFAACl8KFQ!jj%Z1<D#{(|})^$%nia7GlP>QVMB#SQGAp`0q18#p6-dT{pl+o@R+
z(l;Xp;SN8I^qGiKH2WoK<2yz-KRIwlwo%XC-!i_^4qnXOh%@B55>)?G?=Q$HT*w(6
z$_RR-gd^o?ShKD0M}D0)zlrVJWQWEuU`!F{a{Z-W3T;`^J(dfSP%N4_O(-}-M?0=+
z=z>fdSD}zwyf#7-^o#XdOub$-xyXwA=Dzue{*nT3r%YxLGWAe!A*bu50N+EN3q{Sw
zQPkZ^r*e8id;1N4VO<A}oW%@X8|HnO6%-F)mO3UTge<%-zqI#&B?E|mCW55^hN8qn
z)K@1*eN*pXyd;nt)Fqwzg6+sEPmW|+|9CzND?zo_Gh&5t<j|SfyWM4jRRD&vDb)J-
zO#$?|taV6w0A)BF=LFp$Q?Yd^s}<1(IX^o8{}`qT4A3GZZIlxFppI~{Bby+bWCjxT
zLNZrOB@3Wk|DYxu?vY8d0)q9jtfOlU>6ap_9efnM&wfFk@4iQL5*`scLwZMWk-~yw
zfn|5+j>~=einSpw#PVN1nZ;!!Qc4eEZ!r!TvS??ozae&bwzD1o<%9zoc7k!c8(B_B
zZV)31K&-Qp#YFHNTd5VwUvJerD76l>v;5QV&Tx+-<BsmIUUDN=rY6U5nyB%dF(Fdn
z>oZmsT(a^8a8>|%J7L%Qros>rsGJR&kQwwut(gm&Mh*_lT&jBwegYe+CRian=je?Y
zztKr(yYo4mb%gK}&8iWV{-S_y&bt08p>x1%2|4Q~d|73T;cxexJBu#?_)3_2f09Co
z)VnpKLZ0V19;j%Rc=Nt&*L=df@H?}%eHjF9NFm~a4W?C2CB!~fCi0x#VFC%XY!=v-
z;(T32lT3EO7X^nyFZN2ByQoafoa1*K;SG*Oo_?-H;8EecSM!;H&=GqsOi-=f&Pu||
z7PPgU`UGDR$0M=Egu%67>LaiqR$3+R@FBGaM_^Iv_5;)WC6UQLiug>H^J>a#1qF+P
zDT|k7K42uATKk?9z#3AueYdte5Tg51&UPrVy=N`Xqlq0<VYt*-s1bo_%lb=746F{9
zeAvxtcuQH8WoU*(xsEiBql5Z7N2xI%bAoL?QJoW{s>B2j6=usi2s~%|6)G3&iqjzo
zQSm``?!@Rd_x_FK9$7pU5iY9X1pX2i4^z&uR_rB1YSv;{LGyZQrd~fB(~E7MT@}xs
zulzyeb5dj5mz>ywXy5O!iGEHQ>-{jkSrgpYLlQok*bQSZy}eq<gb8edYYg0O{O}cy
zUV2C!>J8~339~Ek2P^xDKy}3mIn*7}Lju(tosJir8_95#ldia6mE_X|v7D7?Vqo`L
zcnlpBAMyhQR-|QkZyhUHm}_eBokmY;c40oMk3Nnqib8w&$ne57q<oNlcT;^2xDwEZ
z-f*18>b6y;F+Ae`3olx$V1gE&RG*|S&`dq&%KNoJLB9@n$}oAy#h@*=FXa1-52+|3
zwrXbVh-R>iT~ZuNLJ|lanu|!@^N894BvI=_m7fTi*LO`ue`lP=(`Up6c_5|<Za%7&
z-Axt?4i};L-&kTSG`U7oG8lC3a2-ah4hUJXY@(*%0H)zLk70_n%JwJ9QeXFR$2A??
z2sn7Lf~m2grIY+i{&xbiHxW94;aL2XJN4(`_v?`Edyz*9Gqf`y+zOq(+XZ~0Oc_;Z
zHl0Z$Yut8C1GkAWvdr$gnB!ztF;mQYp?MRHq58PZ-@vJ3gjwA<FqK$smF!3S2NIf8
zf)qQ|{|&GvkmU`t6&h<?v)f=|3WH9G3Y=$4>RIqP&MP8;&nK!k&LXf*Bq>ucV1WB?
zj`m}-a1dE`G2s(vY<ePC;wTei%Y4R|*k|&t7W_a8uK5BD>C4Xa6|U*)FoPPb_j48c
zIvNua(*=s62U)GI*Ol(x&gMU9#OHc<)SS1`S!|C&V^cKYMyQban%24HH=jUyW&?@6
zC|y7EnX!oROJ51xslgy>Q=L#(RQFV*jD_$aa=&S>zBTx42tKnz`1408&XRG6g^H~T
zQO?^RAPrCQ*nqywu{JLCks%JGd9?3A8*+E&B$u4P6Ji|vUCFO1_TbW{>|d2}kuq7*
z_scilm(1l$@aZF~;=e68zl={)X;(oXl@V!6B9G6bi1gf?0~RH>56B;Hz#_dRczY4`
zbp2jg7eE<WmmC8ybUUII7!&a<Q->1gqAjiow(@DtAgs%lgc46JV*nD;$Tklz$ZiF;
ztT9iCV@q+u$m##_VWxHlcQGT29L$0g3gz?ZYa^D}tTL$b>)-K*9{Aq;=8Wl{5#9Px
zX7O4flF+L0O_09Da-<|Q#6NY#uRP{yip<Xx3IploGb_(9HBa6k+?YD=dvH%>WjJGt
z8O@v~Ktp(587yk2-o6H_f-Py3ewlu|Og5IFXwC_A2_xn8!!ta$O$lt%6@Cn{Rc<He
zg?8M6ya9iLya7o(iXxyMK7nhv-4P9=igjBGDX;;E9m5@ce#{O$yxNQlV^mt??F2DU
z5uFHS*rK9#3<wQ~)0SCS1pCOYM9^NXm=plU{`yQPA9+e=lH>yjPq?A~2L6~uFTSL-
zB(CxTjX^OAD+2vfOJKk1dZ^wc>3)dzM1b?`a_u35M>UB(#xt%@g}R7_Klg+voprlT
zu7#WVIRn!gSs}WhF|z=;fA)^{Xh0b2GHeNNZa4n~+&$tnpN8xANmwo_&Dj(n6DT3H
zA=u7wfVauoU24HosmG!vb;y8P*=yIUXV3;;*U-8phiglR^Qf&4_PWfa2yEe6>{|2>
zPD1{adCh|?1t)m<PRVZYL;oa4m4fx?*Xv`6!s1gU9YwH`liXSs&bvdOj$@g6J3P;h
z+WNmod=_L!)O?LGe9&p}i-w${7R;*bQtOYy7DAJ88OZCX<5|5)hute8BOLV=P*c&w
zii?}3sy1rie|NO!0o1tj01|BH&2Dv5fLcGOO=>n8j1;smLe~`r`S#*mA#gMQ17kIH
zQ3>Jta~L?2c&~oP&us2KiKK)y%MsCq6%+I9JwoT9Z|`O;O;IgB;evbEHhRY7u5<Sd
zAC2PhU?-rLk~LXd+8)O`tf*-#RE<cjrJH*-bfj5V{1V<xvt=dfD%YKOcasgRj2=>s
zCo@G%rgXp#GfQPjv}YAjdW5Uk*g6JZ!osvF7Yp&3u5jdW60{hS7vJT*@4M6T@n}r`
z`ao(%3J3WzkwP!S=O#FLYg(q+Nn^HvZ6PfV`Om1gYuG<KgdLpZ79l+O_B)Rd6aOsO
zmd69~Km-qz%vscDIw2_`Yp;A8Fr<T;UBwY@=MU<lq_EcQ;D4-?a+?FBb~Cl9{Gvi0
z55b7^oj^QMx|!Mzp$`=gM{wimA$;kaE;sXx@S2pg<qX@kmb64iAuLk1Px~pY-um1G
z4TTfM-+f^@>0GcKMUiq)l5r(O!U+4!>KW!W8B!D~cDpr4q{cd>%;i?F95n`HNEd-*
zVZJJ=(RwzBi~+SJQ)wH6+LATVeP=*c9kI;iBD?hI3l%hC5_6(+ol=j3in@u^_qzR(
z^~1IlGe^aPWYNr6=Z(hQEUda1RfHyLCbZHuPgXbhb1uYdEa0MCLd21i{O*lhvB)+Z
zQj{J1Atl{2PlXvGlna8&P781przgw~%xHi<^pjgqaml>jK}-xXIndr%38%b4z+X(@
z1&Yt0{f3pzkfb75R<e)G)a`cMwE0+vEjJvh$o~%u9B%d-;I|BkH=g)2-8qGq*pQ@m
zJanEG&dL&Jf5Mf2Y06%%t%6(7aq;x6^{*}_{t#VBoRVs|MAQckV4m90c3hUoBei5z
zxWyA=NT2Y&>e|@zsGfviasLwE1uSPzMF8>*%oCFlM!wk`aXo#zK<ILp4I?%KIw$F=
z6;qbIwA2JP_LDQ(Q(7dFm+F_+dJqzBayb^UbFI%A_^&b}+K0`9g4o1s*ja;=$PO|G
z6nkT&@r-BvbqFOaO{Ww21yYo}uwuQ+=OlP1ERYR&6`V;waYFBdL2R7RSQQQEZUk){
zM~mVgd;&cS4G>O2uZj!hW=KRCWCC+0%stBbF*zdAU4?BEIu2;6lg;Pe8l;>2ZS(+X
zM<f1fiGC66?^Qo_G1<^UGpF~mV2}S^hPE(MEveSPi6~{%Z<fz(o5fW$QsD;cihCfW
z>d;!QwnWA6i1(5~YA2Wpw_b{igiXekZleZB+wXW5kh6MbE}04dpWHCw*ZVRQ*b*yH
zF5Rm9c8ToCaKE_STu26Jb8tBg-aKpIWO&i$U+!;%UU2=k`0rTpt+J#$c?vY1<Q|f`
zUTl7l62JWIee3K!otHnf{zC_~hDu?VQoNZJ*ltc>-Ejrlxl5wTN4^gzTw!yU>lMuw
zZQ}(P#K?V}Z8PY0nz)&*N-UdDi9V1YIKoyBbV{CpLOjunz45}b(}pW_H}_4zzj@`i
z5ewVgf4D+Un*K`RGg@yn{SR?t%M3OR(!IQpe<<U#sVH(dd=Dk4Rp6&c!{)IMA{L$@
zGoK-B=-^w_Flr~jv8Qo6K9)N>2`}GE{!<@-HX?a05;nvD`8;{7Vn7#GsXvVP=bG9r
z@|7eXA;9FTi?aMy7QkQf7r~gdwcFtrCzN;{mf+9$)Ou;bckYJz@vUD{MdlHUUJa=$
z>=IHH%vZI`odC@3t}o;^Gnz@05wl}N$K$6?PHvvS55=Pjl*BfHn1_1YZ)|DgvgWB|
z9}Q?JyWf}aCeS9$f$yu|9@C3QmZLK9{}<m{mr0LEZ3a1O1oGskgsxmUP{SCyN#A~7
z$D2oMynl%t7H?dE2TI{n=kyY)jB{P6d_+G->ipQ#!%u>C7pLtB#$8KIPPbg$xWhR{
z%Ssnn=!v2!YGff@RAGcrTx@jr#9L(_Y-Cv$ZhyrkwLe>3VaK8RqsOFK06u($rMg{R
zq{Np1_<?7UJLgP#;ORb&3vhC6-EOSrN_~Np*vx3o%tLu|Puj?hrQy*LC!_Z6XhtpX
zUJgY93s1<SoFWt}?2IIO00dV+`-_iG0~V>f@HCC;Oe8q$QZGSIri&1et#}^2o<8z<
z_j2@0IRv^k*!R5egkiA`a!NOw@!jf`=d%x32nnbmeGaS+<GPL4k9~fRHP@8{00&l<
zDkJx=S*b>_!oT5&=)!JSo2B;lqzW;tT{Tpq($@#g@5joN^~Mc^#~%&%jU-!FF_#CT
z7?^`E6;2o!ugY*t&UQ9EQ>n&HNt>9I0n#LpseQ9swcZw#$R|`krAeN#*{ErGd0M+R
zirRjOj=*&m)t8xv9Me=Cz0UnxDoNq{4Xqe2GjP)np}`PO27oli#qh)#yEJC)Ac7;b
zAQOb+pwN!ejups0qfiw$^mv##m5lsN)`M~&P1DLeHP~)bv1?H9g)?pxz=1{%Xulgn
zKOth-N&YA;i9(b$UN8nZl*k$}EmEcTICE|_1lH4`U4sX=Ix06Tof@auITrd;k_nQq
z01r_Z_ULyqLfop7VPE_Z+ufEfle6!K7v@Cl$o3)F&P6d9B81wWc>7=b`<j1_ltz9v
zo#?qjX&g&Nef2z)fGm|k<VBFB^3Mnmi`3}qieyR}LS9kI|Jlv6o1k|pxS~@Bf`Pqb
zc#|tnY23&kmcIYJTxG*WX0;OVD0bm>37>@WajJt?UwS;o!Y9?v!X!$}WgCKIvnw||
zAl|P*=Ixa?Q+GYF{cR=_LOAI{=+j4orjenTPjdfA3uPjuLXl2cV!p2oztDG;N)mOC
zP}eY`G}v@_D=t@_&qs&HNh@y#eihs34}6JOw{UY*`Ao?H>?$@@n(a$7?4;VIDnbW3
z(!Ug#95i<eRz$n^Hdt@nIBGCnNF|Pg4Ux~VX9O*@jb7L;_K<KGgw?<6KY%r4crRji
zcHSjiz54Cz!GiXCPYeJGW1`+aOZ$96cvvlDZ3WTPKFOPpZoBq;zn7qD!l0dj4A#6P
zRQg&{*;X`h5*#$T@4FBZZLK#;V?NWWhLIK6xX0Px2Eh?r)$D4zg~CAXi!&-3ZyY+v
zQXPF7y^nKuc)~*SJ&DP1Ap2&UwuUDr7<qZ{lMqE=pY(NXUA@8-DzyJ~_$r*G=+E5E
zFZhF-54GN3`+%sb+vJ`qmfAlEfdK<yjWY<M${Wc>^(O*Gg1U?&QOn++Q0_+4tw}|j
zUc=BuBy7eanXsd{B4k00V>j2h7T__$%p*~!y6dVcg616N;L$av`wF$1C(2~*hYRv$
znyC1-*aYZN*t$^OHFO_ikI3j&Rz?#DsJ^Z-AQT-28&XQX@4AGboPGX4WDQBG0U?2$
zs+U-0(g?$@$px9mKx=c?Nql_$wx7s%5~ZuALt?KZn40-JA7xRq)1%RT*N+qc-iN(*
zi$1=*OuUD)vYu*>iPAT%879_n%r;Ft)7Oc;4KET?#?sU@$SpDONI2E|um`J&>Rbb3
z^vr1lm)q^2@|cS~&7t2lme+#SJkQadfwiII5%=`n%w!6IZ=`B0q#X`KmoW@O#ZWF7
zYSF})?ufV$xI!l{115w}TA$o`KAv^K`5_`|Ma<7HvQl?Y514b?p)des`(6XXV=uSs
zdOz9gfxA_f2jc~dYU?VD&js_BqVtG&5O%+us;p4}>i<M5$M_`~VMnVQ49j{`t5+U^
zen7xbJ7~J_9+#<OtkS0*7vK|Fg3{JC8M?eA;WS*o+!&)1%ONS)%1j}zqx>;hOHU|s
z!DP1;rcDX{ePM&(JABG_FrNKe%-1HecIYS(>QmUjqV*ZaLT<_mof>DefvNWE<SZ;{
zm1v5XAWa0<x+oU!wW)Hsx$Pce#k594i}8^J4A5J%YQBGbE9eJ8!;6X7%B>>!guW7+
z2wXSzJF9t8kaZvew1y3RQn1iL8Kl<tb$SOt+F#}vOd<SCBd18>eOinZ#+kRfryv0Y
z0#b9NK5U3OwJW-qDGNZ5k3EeF9qS8+-#k^{;=iB=1i>wQvpZbpsC)<%r|R)MpMa&6
zZw`TDT`GkN7>mr;NjUI=2$hbdv_zwGe`<XEO9mKzj7YY6yZYXf-nvNS-$QzfbyxeB
zk$nzAa%{k{LU#u#kq=%ri;1p7(rsWFh7>8iw#jo2=Bxgry#=B7vUUG?O6Y+9hp8!e
z8AxZvBd{=H;ZssP*;dei9|@bxHLYq6G3&5|-i*X(k5z3H4;_zfPU+Ny+=u}rPjssP
zjc871yXdfl+>Au8C`xvfUWFx5a{(B+``svpXG~1%%qDR27k?IEvREeh?Q}v<(T#9k
z#jT00+c52-l1NNs!Q=^!1QT2A1B9b=)2#?xti?lUB*t55dis47DM^8fDQmk)iaO3v
zkic{{^ZomT++m);l&2_wU!*v0KT2?9v|8rj9__8&WORSs;}X6o7P0|xqn@8bJWc;7
z!%ikP$uj}5L5<%gnG!U;o7UDM-*bP=fAv{{5ES3;jZKwR0keF+RWdR2CPvjUG|bZ`
zfq_mzhgj8VZfeIrE>9SOY`Q(#@kC-M9JnERkT;&_XNv)>5mK&*-lHnyQ@9o?qkNL!
zZW2EcW8fr}r{#F#=ku5TORz^&G~+Fc@#A&2LUD3v<t}CIC@EY&GA$Q;N@(1U*p0`V
zJ7F3pt7Upi`HJe;+RdqBZ)+s^k7jfxApzRVIe8iM*pngQi2hgXyG+<wFnorX76(YE
zyc;@be9DIoT!9G{L(h>-`E04ONUA8M@Sqzk|9qVNt#KD0z#idIh4^iS>91m$7_O^s
z#d|tZwLtfIVGRX;PO~khaO%-$kDJN1d1u+e%m7<bfOdp6W`VHsKL44mjF=j2T2ZOR
zXwM>XN6htaoA+HW9rzTgQ!BQpVm|I|Rxb*HVO=mOdN1S#L|X(eYnyaq8Ynpoz1}Yo
zqhyB=+vmXIG=!RQgg!_9H0M=?FbSQQR<L${r;vhSnRLYD$2Of8cKlC7WGcdzerrC#
z45tG??p*`!s++Z75<z@+brLA7NdJl_H1Ou#ENvyj0@JGzWt(tuoOR}a{W$?8e5B3J
z4I%*AW-aKxnK@vBWl>LRm8Gq-F9+cjhNDQTUbCxAr^nlQlM*2R9lA@129(|<;Zoor
zrYN0V&JMR~J+TA3;P@q`#@dB{+qqj{ZX4&0J61ogOtIe?^4>|UU=gYy2Gk^r*X({q
z3iJ`*b_9ZtxhE~=lD3L*UGFNS)>d!e8Mlbyb|t<;<NMvL&ws;7OWeitNIW#~g<#Dt
z$H;tanD|!ld-5`Oy@q2Yo{?OUu~||7d1h3r!N{tPTzlw`oH8USI;2ac>b?{whpL&O
zUxnb^o%g8bAN&w1JSbyJJgtE&DiP&y1g8TmuD|`un{5@I0n3FkLOjKiRQWiG56f#(
zAScoUATHOrJjbmGBJ+!ZugRq!yirb>Rx>P4Z|jRNxV$r|vq`TC-cShztm0nUCjEeS
z6}OKEs)adXkCxK}1$i%0EN1iojyAVu7Sr7G)pqqxe11H3U^sze-MaNmL@YwQ!AkD9
zw;6a8ec`2`Kx@*Ov<f+8h|^*>ELnrF49~PnVQD;iU^rag_Mq?=U2w~^?!X7ioVlZ%
zn0C_Q+eDCV6?(tb00gk*MW=WtE?<Sne08zcc3ITxRZw$%X=Jcy#O5ulkrJ|e&`WOc
zzsbC(A^k>rRdKcBLhUE9Ejk1b{s8jvJxN#=)__G=iXq}mSj6I$;F@7_s4^s&w4}I^
z(O*uKQKSwd;L(C)jjdsUh?7j}iwdo-BIJXd59G%AqpeA!l^rkD?NZ@QWyC5Hx#18^
zB=&BPcLItHT|kl1X3}1x+v=`buY1YNSWV&7(1YKihxgC!y}(-d{xZ5tcuPcA@@`fA
zYYB#+x}1=Af7KY+q7|V2b@0%8Z!`<R@3@6-)7IQh<9KlPuZb+6Awrq@pAj6W1FW+Q
zKyF2Zpd!Dg9AdRfoP4dq*9aEyN2(8VbIc>ccnQ11tJLNSNFYd!WTu@xr^|4^t0f`A
zUoI>x^~V6zC}!jUF!dYx@YEfd%6Ra>Uih#EnFCm$mrm$G7G42~t#SM#*;q1Xbp6v~
zt+Eqlkb><G^nQrndWm-xVPnAu1zf)(ov(C_dBgIE?Fs{`!Uri?*A;0*gIyI%o|8d`
zjgbz`5WR!4a5d^K`fg|OZ;<AZwZs*`m^i1C69VeOCyzin4-~AJ0U##=ADDqR1BM1Z
z0@b>a6xlojaN>sQcm%@gjg;Csl1(Cpt&ZA>u-fV+vKc{3WWIS!2vdxQ0Gu@pvTxIi
zITb(7wBZ~T=H-lemk;{Ft_B>0VgamKzyYmCzcj{J=99u=eyuK#{;dF4(b;Oq_MKc0
z2JrmwMKk5Z$_&x7c%H;Y0nl-igYASmc?GgsXP+9chmh3%unXg~!epHTB4Q{U>b4Oh
zlB7Ac4C`b%6jz6?YhxT$<Kn_-nOQ-vHUF@wNTc(2Tlr=q-Bpn|O+Y4w-MAbi^L5|x
zUzG>X8qbGd-_V-e@_%;b{u@T}@^H$E^KwQEOk;(pFZG`7S5OUL2jZPLlIJZ_c(yM|
zTFC8YHsE979;{J}n_N3(WeJc1A4la}UYK;zaGUa=CisqvD6k`OAgjC-5d>^%OS!;u
z=c}>N_Rm(fx8^8U?sSMuj0aVm>x^JtIIod}#|MOgh`J6)bQDCqAvAmYCw0GH`TFp4
z=@Vil)Vf(>-bX@b`yg%@NS3{i<zALCCjsRDv^QKK8X=CoAxRT#7*Lx!;^Gu3xe;Q6
zL8xrJCa~jbj6i5ENP6+d-mR~>CWB&KaRS2_5rie+dyX&cdh7LF4DgehuQ#lx|H`6|
z;XZ_f*Mnu1p8Kn%o2ZK8$q!eJaTkQ6C=jM?l~G1eei=BjX8TO&_;)iU;0E3Fs0JE?
z<`;v_OzuF(A6G)+<Rg+>Cj4wPF#}n{Olb6wmKzi*<x-1*B%KCrI6t!dO|lzKBNyXr
zH1<kqeGy%=A^~cr=2k6vo)XbnGxOK%0yGC_5Y8V~$WlOz$uAm%0XtuB1Zhh<#@mhT
zHtl3ajaq8aA7@f2M9*b+6x*HJ6P}F}2u$4FiO!=VoKA(KM!&PgQTWz=4Y1d1v>edm
z^T!mxFK+bF<nT~N=mf2M6dQsO$1<G3c|jt!5WN&}`A2;?v9T=S|7xwh?nN-{NzGl7
zk$^)|5tW9gx+r80!{@(+_pk5)g%D47$_ME7q=&66v66hBm#_}ajZD=V1RxZGam5I<
zo&F)~2I={QU#{dSWc~K97ysH65z;^Cz8<J_?f$`U_7A^`FWP`qNW24m2pI)I<SIJk
za*D1@)GG|~4X1x%8R159rRlF%yv7Jhyd_B>&X5Q5c@^j)Y`Tyy59`AI#;ZVScXgPR
zuLc6dDV~Ry>HIhS)Y+mk%F;yx!XUqJ`hRhXo%=2k^}Af;UN;f<HlzARNM7d}q9&xu
zg8y^pL99l=qBq2s(p6VG02IDy^sl?smpRruMPoyFdXS2OrUgy;Xfjh?3rRfLui4{#
z>UCQEf<1Lp>LG*I0Z3DWE2|V`k=gqst!E2{L{oX#LO4TtCFXbGrR}f^f<{7w5&l7e
z%7$uNcFU7Amm6@>0;JVQY)K{fPSif855vBtlx4@(-x5<Wwr2mFi_HgCg+ibe&O<96
zcH9gbQn#<7Ph<PJQl*)PGB*sw0kninn&vm$AveO?!6FW*qqmk2(r7*s9tS_8KG5Nm
zTh${eRkT`4@|AYjg$!q}Ly6ffzgXYzm)>i>NUXGO%OVCS|B}NJB7E$w9d=5PL7hxw
z>funoz=~NPw|q9pX$rsKFCIDJCO}_?dqRD{nNSZU3=O)SgaPUD(&7*W7=2d`9qu%|
zb8b_j{3~UM*V#$TQPM<p79_VEavac;R#lRB$v0GixE19U6%<-?K{6|k7VgTx)E6X|
z7Frr==%~X$@$Pt1h4xFj<$p0tzC)Y0I$m~2pl6?;xB%o_@aK0w`TI&bP@ibj&`%6h
zA?jK<1uQPAd~{^8Q&OBqg+x&;J@A9zh1Ba8Wt85DbBy2F^!H!piyP%)$wgq?3`2VO
z3aL`zS6<903t}wAtEIQg*sDg>*%|S%v)5%n9e5z^V-NeVWrH{ec4&`cwQ=H3@veR=
z-U|*=ju);LD$0aecC%zDo6%h!QQ*m*oHSOIrJa2^m95~s2}|xDbvXIGacW-FrJ%`B
z55ytSC{|!4%sIRLqM<0I2O{*gfvJb1G(S8wgW$XvOVYLwRxB%DpM&&MP;aOQtogkW
z{x2?4VU+x>;49D{<U-mH6*7SK#3O7!XL)uLxU0_yr-l9I80Y`_`=D7%96t)I5L*aP
zc5cJOh`mjOZO6i7ut@CXR<+Vq`HmM|00~?00KP4@m{_0^7cmPR_;1-x8wut10Fyy_
z&@%8O*E&e?*u@HyF;0--k0DWP)z5-C^R^)xLqP^S!))_yf3C4B(KLLhu}}$!2{Fzx
zHm9N|>a7#Z9%Ag!zGuaw-EP|^`=U_5Q$I2U;<xBg^<0TH$p}gCHzODdt2|)=%w?Nm
zpVd1Xj(ljBofQF_t9*{6qUvg}j~YwA-Wcjmc9oz#I)PrmLw`Ovbk{P<2}>oZotMtb
zH@uru2_Pn`GG#&a{X4w%Wg3*2g$2Y0S+>YNWDVGRjWb>p%a-W7O94fqiONj)>}Q_`
z=z&cQ?=s$S6rjjo+<QGn>$gso+B;I<_Xf&Fd}?fX`q`U|K&3Mi4nrG0mV^8?ezLgd
zJ_nWOR+G^775eB!x6CNO#f&XXMg=2aj9>d7jg<fz<khHOR>8pg)UAd4rY4Tj>Q`%8
zM6$=fxf&sGHJKf|qs74jBItg+<^0}5R^ARHu{Puvm@BOHjO`nL;)td-6i5BW(q;5|
z{5qO_8#|wkNkbNfmv))1*qM_MitYZg;NedeP#Tao`w8}8I0A5RpAJ@aQt6e~VS;nw
zUFqeb&&fyo&f;@U#7lK6P-vQZr9qNH^4Cx@1NYv-xQP}Xz5|_s4ktbKsq;C%d~3vs
zDJcTmUL?4upGn-mDTUY%s6|=B?d|91qgU~0pv&kLH5f2T7#9vakiW3rF`-Gh3H<r@
z3@hQWR>nD)ZGIOlU+ueWftc6k<d;kyd?Sk=YL=m$E0tb$q?wX`*eUSqMsmCKNC`g!
zy+K$=M7<kPl;vYwS;-~ERktTEmpRRv99*o-0B^C%)hkLOauCdWre`xNRgd;Jwjs^&
z__jkD5K_OtwAor)M9VOb<gdZ;QuQI!gp`2OdWC0{1i$;XdU6^`m!I606L?U7?@go^
zEno8wI8mGs*9JUMoZV0SwX~0xR4{ZaFw#Rbh?wcn(>SBK!SAUj3q8ZhX<Z$>jzx=d
zo-T8J34XaGS_WQFX$pX$3VZuwbVSUF#Z=X>=IxD^4!(zU;ao$`?iS?VPR!@3%G&v4
z=<gU4i@+MDlWNlRyT!=(SoUn8E)nY+fW(?qeWa6;67x(VJYTJT({9^XjSGFIVGhYm
zV#n>=+_uCtl;%pu1e`z4u?$4;DxbBAwZGYT;&vh^!Kaj(C`yx4g6Sd!jvtNz{fB(e
zJq0S0Bm2>w7$TRSI4j$-^vV?JxRrW<LV%&~iTH|Z>TH4cjs5Z5Pw}Vmz@r1#H#4Ha
zHgd%{8L)H_7OL}&=1`~F46j<qOvtZy=D>m33S?9RtW`qn*-XDgFe!a|1wUy&zffRy
zI_qGVP+p@V_59lTZ=(>xf}09fvtMfB=(l#rK31n}DXF@B264KRFD-aG+j9pUi#xC>
z(hTKrU~q@aKz+StS$l1ZwvXGb4w$&(I}7(0Raa;k^gt5K&V&N#`%fT#_6p=Ip7|_D
zTt=b|>)>vS-u*;_7^?=JMM5m)4lF_Q^?gH`wHmE)EckPrh)b_qW(AUYY|Kw}Lf;_v
ztBL>Hz8SGMR*ttoWre*uN67@aSfSe<u;ZXditf|&Tie8eJLy&F%~L+g-uTc08^%=G
z$dYX-Ga$%lQv{)s5I&!uHpqrcC{f|59#I62q4p$oILNSJUyjlCM%_t9)L8=~zIx^Q
zl6mB&)H2lDT;2HyoD_DPlS^oJ>O-RzOK?%#oj*+C@vn_-qi;n5KEil%nCJK)l~-Ot
z$he;)fOkLtiyY{4Sv{7PmKteSdP}jZ&tBV#VvHbuH_o}tiQ!b8zHEi^D5n->ksd12
z*`CVaP6o?%OsM~q6!Du7@-Z-7g$S+>r?Xm{8%oF<mw6)4kb3%}W~P6Mp<{q@Qd}3m
z-PhedG&uXSEZ&Qb+^;9nSdDx7LilqZCFKID`dCMBS1i^`u;YCYxsPP@Zx)^HnP7!0
zc@8qOZ&}kJef4aY#lU!DHw{rY2)ssuB!z|gp(>*JA9(F7gkVF46eqwxskS{yf7|{M
z{1f8Py5NbeZ?qP@)p3&fITx04XQQr-iHz8Jhbq=wZ%sk|RI`6dV78yEyE!lGsci$N
zZ07q-gGnc~ht~1agM;$nwi9uSC`y~6oaoXw-wzDB1Hz{PtV-ra3dpoT5?0EAaqbxx
z^WuH7`;&43$ncnsR=R56j<%`DnG&;Ks1#8;^4!LKf(lu36VjraJn-nT&xFJ>9`22!
zAcRenAS2j^m99u_bkzA_VK~Z-bKJ56VNG`Nd%;IQO3*+eSp2Z#L7r5aO4u{COc?*o
zuarj`4up^d$wDe?nGt>`SiSb)@ge?{?_>;Oa-v5(Y^u%Pid=~o67LebvQ$Bv>5=!i
zhxdDgz;ITzc4w1@%6jh#ZP8^O26QRv<OZq~Xt+u`9rRU2fdItiN9ejr+B3R)R?=O|
zD`gm|HG5a|(+VB*-6{WgBL2j44pj~_xH&CQ`jk_AQ$eMwGJfOuFzIV5$$yL4Q4mfV
z@FO9t`oqE2vRkr6V-%W34&z?}#F5p)#+vY&8PR$riHDacy6takBbpd|3hxxUmelFA
zD0JJBDd{eDIn!NT9UBg_r3AlrH6)X=@OZTP9bc}qD9^0i_QS4V*SP^{drzsy8&DaR
zw1g-G7doF~_h%BiKByMW!xLrp+RLhFE>dksQBCP@R6;Q1W}<Z1vs<9lZ7Rc}btk<V
zV%tv2pG&-}AA1G)59K4-j9>d86i<OtMau?Rn*KGsI+|y-)Ia|_y5$l<oDLb*#4>Iz
z`rEuZy5;W(BX|bhvRHbbWrGuxylVV90!fn=)0ddDPUw2XWXP4QpE%<bzgXafRDR7r
zpguPdf*gC4p$WnkVZJBL=vO6dx2YlblN|Sjn&DAbE*};o^t4^RI*nsf&y<=~D@2zo
zDsS*$Lt~9J3m8QgU68_^D55JbWhpQnYBXfC$XUmdKh<KWKPh3=PnyfnSVu9nBvpm>
zEPZg(bKHw-S=uW7m5fzQhCFh)iW}c9x%sd71ln@fBtxn=ehtc=D+PN{BRCRWg@XfF
zIVXf84{Y?oJlKyl$>V#1&{08p<NCH+y6BLJHMIkGq{AjbI^IJj>OCfSE_@kA55Iu1
zYDyv1p^AUA5PrxIx;~GOpoBOWsEApI*@~8w+R+v#3+VN@<Ee^$aY1fyVZwcAd)0Zn
zNXsJ`;YNmIH{?iloj?_q4F4ZZ*BD({6KrE!H_nZdiESGbPi))C#I~JG>||zQ+nm_8
zZR_3dz4d-ppYA%Rf1K6TReSHUqp%Dy;U#q5Oo}E}1M~7q9mf6^z$*|{L{m<SMd-2B
zeZB}$I*0v3cY&PdwFb>l_Ahw|Le1s=kYVe;`{OVna6XRPT0}QKL^C|G_w3_$9oTU_
z)FuZ;9(Y!}>U<Yw1TCo3-xv(K!m-q1Fu{U{@m$=jvF4}Vh=2eS;HdB>Jmzh%wlO&(
zz|h2S#4tscrEvcy;%lCy1&jbvEUY2eC(>@;wlxc=8xR{vDmFxXeeu>;dOZp~ZE2BZ
zJjLwl28^}fwDScp21xR)VL=LTDOT`btwTe3GW)s=ql%g5ttNg6<20Bpz6S4P@!|N=
z@GY5!i=ZJm$RIt`f>4)&S9uU8NcI8l5iC;tsHj|U{DSX4Auic&uK@Wh*CrKrrZkA_
z==+SVB!F@j+yS&CWCdZ|<~mLNH|RP<PnilnO?3H6b1FT{?jCm*rbrzw(c5eHw~h`b
zz%t`LCEogR0yy$NTOzAKU9k2X{ejpbyqME8+Ot(A#|?cJHllFtd2yI&)g45o=3vES
zLz=)X9^1$CFWqpr*<I=xM})Mavlfi~1!Y+G**<EgA{-wiG69SAL<Ow}50q4#7VF`H
zKt35AQUS7Ruh~%9J9&<s*MIJ+DY#8X2YwaN>VN6J>(}Q5ZNK?xS7UvySo$+&w>d5d
zK*WErR{jas)3oxZC$zA@Smu$Q!WgP7(=)sQB#CgTyhlFY2}Mr)sIpMeJit~lLgE@D
zdr;Caj<FO-79Fg&7|NE1LXQU_j7pSVme}sk@u;dbG4ii**-(qmtN`jOHdI5FvLksP
zeaURd4Y}?{sh!pkkthRiERz*>IN!d`CAl#tM^jl_^~P0i&%gN6cR|9`a-d>G;BguT
ziy-KZcar>qVXU_fR={i>%>Kbf%t$Ss{fD$1j>rk>)MCO$f23&)9{Z@u1in)8Lbg3<
z%YD1qn^BDl@guxbv|san4MlxcFA9qocC|L9+Z!XS8Qh5yzo_!rx>}y;E+%;H0SN38
z@24T}+d%pi)k1VPa>$s@^fhv$-jLs6a36A@C%(vuPrCJ&^8go4G%cQxz1o*_&L$Tw
zx^U@*Bqd%{R{tGhht5EqET^4E;|d?AmgxDs91AQS;)n?2MILw4>pTL>d|Y~QfqP~x
z6K`&f@*dfae^;1b8eZDMvBnq7R+kR>!grNHg2a+59zbd2O@Psj2NIjVp(!hB!BAZA
zLrZqc$ILX5jkDag-s$EGFws|v6c8jfk2qP12JV2xwra7e>E{WO!iL`Wp@1b5P!#c*
zjW90lu7&2*bhs_Ahdh8ED`ltJ`o2%Syv}xVPQy*o;Hx*v;1Uz+H=KfF=&V@)Cwp<T
zEHT7=$F)%tmRI@b3`p(Sj6f*L6+9vtv>+wsk{NKfJH>O$ZWPBq6yRfSQg%DNX967E
z=(GtL>66o8t$P|<;wxcRlh7F6VnhOxJP}98a^X}M$q<n*?yRa#!4$=HcVZgk{*_@%
zvou4Lm=(P_{INRu%uL0B_@k}#ZNU2u#mi2LVo#!2fgV`e)QiQGza-)au199<Z5C04
z8CQ%yKBKXg8Cz%@8!1bg=Gi~w0nJz=lhKy0nB=*0Qv-@uowzS99L6DG2x)Oe)EOz%
zdcgMl0uZ(}LI(Y@k@~6^V)<iknjg^b^Z9H@WTbI2%@9@Ny`LVJ2QdKsMxm8+zr8Hd
zPMDAm(eK$9W7o(-b3yeZv3+Z_(=8;H@H~03_$ddUnPjmLEPO_AG`Av{=;j}9@y`<B
zaD9egeQ8I0tw(-ho>NL_?t3phdMm!)_QtSfddk9L$cGFWHPHpso#nYc?^r#|4RIpQ
zmSwAjJ+ZS@(TPGD{aGHysBP!o<UzFI(Z7Ym^yy9fGdm0MJE_0^Yh((#-!0FQ27#FU
zp_D@4yD{v-<`GGQ=l#rkZGU`DCF|mPhY<Qdz=eAB3MBRl7@=uSLUPbfL}@bS1-T3@
zn&N6*${rz+$p&_#+lKYUX?KLfs5b%d1<Vh*?7|jNipD_)YfWO8GMue|S+E>h!N?s7
zsr@hD`^#rBIIoFMQYF%Uw(wfE>%5&fem>g}b)=uKjFD&%US?SryKouR*EIYmaYw@T
zl-^+?$Y1e@Fh2CZ0wce-7*FM=`Dp3*n`itEeO$G}Z-28v{u2p<-;*y$kET@qOzVUE
zg;Hy+d~g>I7AgFi`0p{XSk<=M9RnW@Hoh#RtE4lM$b|zUrC0^)e&J;;U{nC>R;9zN
z`~A4B-1}U-!#7_LiN2gkWL2F?64GJlx)?e1B<R$DKgK~<P4JQI70?Gl4syqTKPJ^k
zjo<K4rN=~K!6Hp)|Cd?Dj&`i@q$qN<Up*9i_F=O<Ae~f;;_X+pgPbM(gARyX{4ACT
zq6fk7fI88E6m*1wR^JTH@7f?&#b>Kx3#?)B%q=q>vCrwWPSENFPFF2~gQj_=r)7uw
zn5cX0g^V`;*%Z44VPE2M?vc)r)R*^P<Qyv~1BnqnFMi1EAU%pfYdfdV3q=M>Ey#%r
zS5UKPM>QWu%M0`xn9S%`mgCYF`3qwQor$uFz{A3Talbh8Q|bN7)Lm0#_Mg<?9D&2e
zDLzPoW4$8=GcBqp5v2(ZVm^1~CG^^mQxaDcu20CVi&9?Qi}@CiQyZfL`0W@%@z-b5
z!A3%2iTm~8MPy%cFLG|}@-5)4WDGEFNDnmh!9FT-`t{(gNog_E{DKDaIy*P%Q(Of3
zbhF0%e96NtFR!sSX-)(Qbk4?T>)nS}q}KgR?WmHUF%rvu4XrVQkym5O)(oHPqM`?~
z@cDR8&q0Se*cNjxi14Y>ky;}_JdDQ_8S5W!pb3<JM(K%`qdgc8{$7>zU;W>RhdG(+
z*v?FQrFza31BF^)CK9<Axn#$&1htAH1H~su784YoAwgARA?-MQMZ1N6&bK6H6B}Z;
zLZunHH`NWdSW?925PrMhV+`~R8F&hsswP?{yz)Y4u+gZv`zXZU3`ts^GmEjW45DD5
zNFn*V^Zj_8%Qa@&Xn}mWieEJ7T@&CbTLb$m`fRP_%<Rs7(uWPnRC3nJ^p{j5_f;CT
zbdMf42DqHb=24ZkffMu5M)r$&#$>ql1?h3w+R{(O15neUaL63&_jaG2MuHHGfAI^~
zu>QBs_!wYvBQY`6qaMnj*3r8|06j`VPN}>^YH3HoGiu}&pB9^2$qj9v?}yRW&(-<C
zC|VzChfTZ0f>VhJbx-*)Iq=2Jf&DQ>_MIMwZV8y?4vy{Ib+%3j6K_0sM9f7tf#1|0
z-P;FkgZQOH{~d6{EKG{u?(02S#@`ac(~=NIb_x}+R0o(kz#j}-&lfeq;IhN%X|;Ru
z2JuS<37y{Xf18R)7@xTaI%#Nx8?EDWgw!F%Cq3zRnGGqVjlF!rCOExYhNFE0C}d%(
ztaw~&Tg$!}@Cc^l$T<%Hk;JQ^4(A-dq9x)hLUvOcvu=Yj``C6#8|N(!=uSp;DfwV-
z7VwqJtDy+Ia^xTb7e{0A6Qka;4aJz;j3y@{ZDLUhQOCOMLYG?ebBF6o92I}W2*?H$
zq_?qC<XJ|YH-6J5{z=(0EvI)LF~n|VgTEE8nWGAUw6;KLfOLLQX4Kx<#~}qzZ=0^c
z*!2yEg;ru?xEw=%d41qK$P)%<Ip#Tr!Aurd0BB`S>_`@AI6|mHp$wRo)BVO1D*M$R
zoWk$72ZiYsiMWxb3+{#lpC=UL4S`VY$-*m`G*5~j7rwKv5roh=Ub5m8*nga97sH*_
zKqnHae`w5=P}j<svb8$-T625m?lDyyNq1VhT@x1C%|zFIDcS9d!V*?=GA$};8U=-|
z&zi0fkM9mM_9@EpcE7REtDc+QYFE%JGY%cMDX9nl?fzT3s#6WQY_PRj#W_u{y`K_N
zsa<_xW_cFtS?3g8uf6^gtF*O1@e>l<A<BIx#`&QelXN<rB+Mge4B_S1D#d@~T`nY$
zD7EhI8}ia8g9_d+8QB2K0Q^wQ5sOf=y*7PI_b_MpuzI1KIk<2H!~Gvja3Aouz4Uez
z)Bx<7k-z#lVN!QK)TGnE1*QM9S&<+Rl+BvxzkYy6iyF@MzSs{!Otp{Se=}5ulRpK>
zT85d&vN)&fL9^ceNnfyfGoFGaFq2jbG!Qk!2!%-PIrW^^fcAj5lHuaE;b_Io;1a5M
zd%W)0me5TD)6Qvk&}|lG61gPX<j5wn{ad|0qXKTAqLTEH$;11X%!*qK+ULeOJ=8GT
z@x;?;JL9P^fJy(d4y{#_p-ID}>X(qxpZ`|hl54^A)GxIhzzbk+502@<z*={6c6HKB
z?t+&<bU?L68wLD`euFY>dJmL?_PB8dobUR*J^LEU-xzHybzaA&2`H8vXQ;>0e<*{4
z*o@FyI*?8sz~SVaG6ZA>rk}NPzlcbYT%D}16zRGz!qVH<%N+VCSoODByQ?6uJX^;$
z<_Q2#Gm2n#K0%6tpZ=h1xFkp=BZy(}c>|;%@O%W3tyln#Rj`~;bFNFyRUK0L+iqLf
zX51x605~@T@!*_QQU`;#)e7Y)oV{(9UzTc8%%W|3gLw{K8<ZZ4`mZMtPVOD2KKmK{
z0E&r-z{#33JIV4#Qa*kJcE>jC9Q9{|)H0g=G}MA{#kLu%aB;=y2Xnhml+RcgcE|Bg
zgO!;5go3Lh)qNdK(DQ4FAd^gD>`0Vd1`&>g1BHAl&3NKyN$<f{k05KH`t@vv9E2z>
zSxJ~K#VP}xhtY$B(P&xf_0Q0Y?v|w^w+GbH(#L63wWyY&Bp~WY=I3X~RnIdtxt_sy
zjD7H0XTZ44z1=1AUSs~iUHWlr+TVbT?qD{5>qy+bw0zVNol9pLn;+iqi{JszjQqVs
z3C)WV{Y`uM3SWH)y`N~$X_3wIp+^hFKXql?Nk|Iy>y^IG2X0)Tx7`!}B*FkfuE5M_
z)pE~E{zCsGNe+Y>5^j1q(R%UPz2Zf9y*-Jn{#^sBxP~l=H{8yf-8S6_`XBy38Hlb7
z(g8!B(jrY|TzQC+{mO{g?|&m5;7!=@hN*lBlRaEvBJ=-d#KKA+9^Npwm2vfBUy;_h
z*Q~3H>19P8*C{tz96BseJROl7?<5eK6S45LGlIX1jHJ_-JAfLE)|-{c2n!bmLyyt5
zSx0C5L4Q5~m7^hmIpNs(23xAq-8M{*vCT5j5O@JL_%mY_i|T`_G)5f}4AP34h8XSn
z-1w7i0%-=KTexs+uo>mWA>YEfP;cO)!+!_<o{K$?HDh#lj5mj%A%HRA*y+Y3q)hyN
z(7p8iAaw>&n{d2t0t;=c&dw|)7^eps!;TTtZ!I|4*UQ{SEB1|0p>V=X<#vBedCT;|
zXX1$`n~*bI0L|Mt)5phP!bSnXdY}VSmUvyuH(e-{=a!}%-PimXH(zz7_y=2ctg;e$
z?)!6F6k^K^Ki6%&0D?84x((b<le?aqoHINvMC*Y%>I;i^bcIXL@;n@7NYKlDAl<O<
z?d11zw2rh|4v!y-PZ0R*RONsgA0TFF96bmUn~^l~{7<O1<U@N$n-X4$JkCpvKSvnp
zSZkjw_zJo;c*8Ef{<A%E?v#bWjBTBIWZ}fkSgr=~-XKxV6VAo1ty%LAy$qqwa;dh4
z?YlJlCZ-n6+wQDcx4t&ryD8g@k40@rdI*EZ;C-_pdKGGIHP4MW4tt#=B*(T))hF6p
zX0ppkKkHD+pkFsZr>8cAdcH-i+=n)%PmR-M+(>m^V)ct-SMYNx27a;TJ)aG{ZlIUw
ztmu?;rZ&UG2kG@i7APq=1e=cciqXCh-qVcYdccU=P_S$J?;L|QQOW5vg?hShh|ih(
zn^C1gKEge{J9wIAX=I$4Y`(vU0fjWQ*K3=hL)aLLxP0VPr8b0G{%P*=Dp<oW8G72a
z)=N?l+t<Rk(Q36<CeHR!!}I0PhI8`laS8^u-7rhSj{02DMLS3}|Fmk2uV($<KWh{I
z<7g;3;i=4YyI5miX&u{+fo{fvCf!j)spq;%72BBR@RsIJ7icETBh$%!TPR{CnNJ$N
zA_5Sv4xtH4%rP6JaXlnNEvz33qcl)=Lr&}g5^vQN-wypqqo-CH;wt%6#Mh>SV9G+r
zGHS&0@SmvTs6+P_QV_h$G`IT1eVABRazgh&zo|hyLwFunaY9B0I01~nzoD%igp#V{
zwG`}<U9xV*js%N(y8O-q<#H3vWB3!tG+lyUY%5#CqM}>I9PMQEj(?<WYV{`zlb^Ff
zCGD)NO8iYO<sgJ-?_*p}snZ1K3;nrB{AWix-)eO1gH@_tY1{`r9W^n2C8CDfeIa5X
zkVyAqb()!WI;0(_bxGj5(*Cb3*B_b1BC;vB0?btesLQ^@&oz)u*=*e;Y|FC^t3Dyw
zFD^`ex$D5$HL6Ga@>vGyKPVvR^!(%$8~>}4<VVxkrP%)56&I$>ci7%@3;?Rxd_O)8
z1TWilq*n0HB|lxEgU>m96bSrZ09`gSl1lmS^Du=*r1_Cvc%Mm-Ii^HkI)7VtfdARv
ziciKqqZ}rn?Pg|KO<<I!A-(?vv3<>X(Ed~AOp;x{^sn7{AYrC(2A?e`O3_CA$-7tJ
zyo&7ow9>`R)A73PJp2!u-9n2AK^pttiRY2r56zuz?Fdw~F|V0=-(hV+n9&%*{O;5_
z`(=3U5w9JR+|CY`Yx-i02(wPt7*$dvV|3bEC9boOF(H+Pn0)c(4^o4qL$Q+z?6mtr
zBEjPzZkdgmSCD2DUdQnX>XIciv)!0Sd6s*hf>7@My$cgDFN1NqvT#J&m9qywsVv0G
zN>sCXXg;J<3?PR*xZyHz<`up<H#8e^WsNVf%9D54R&V2}1hj$nM@twPQ&`M=k25Ve
z9<*VP6B?Mco>yC`-+T1Mgb^kk%nw*7aIQ#rPKj8|>1G|kc1h<20L=W`Nmjie-w<M}
ziQcrzF-+UurB;t_+>I#OcAwiXqA&g*3hg^kO*J$%5cB9X<O+*@a^-R&ZRPKrXaMrS
z{I1N<XQ<i+fRDh;caxR1OSz2(yhY=nam!*p-iGSz@HQ*DipmF&(7W`1Lhsw@^1`to
zF!Jmry!4;_OvqH$DCr@qI9|;cCJ$d)Hoyq{EtD{S8<tMcHu2Ed08KvT0AEMLMmG#u
zDQ9){dKO&`=73Iz=7UvZVx^D|jgEahXbA?rKK`u?K85ASlF0g0FI*HGVHtfO>v~eX
zU*IsXcTWNUXd7xc5+G1`fQS|87)DGw*2x>gLG%euc|fFxi6mx9%dG5ZtT1gisX9Pl
zhS4g3jH>0gM|Q-#U8xH&MyvMM;=UNovn?fmqD2J4+`IxJ&~tRMGVUwr{Cn@56*@o7
z3~3#}?Fd4CCoYY8N|fn;^<5n{Rby_}Po=jy>CagqdINuQ;S0x7W!@K8Ckjc4bp&b;
zYZ%4k6npCj7ct{+9wNaq7JEENN>?P0<Q2_yMzw-FpR;!?_o(h`c^vJKI~=h;U)Xkd
zE>86E!5(lN%e-$64KDP7CL3JCb76r2oC~#=Q%YNJuq4SVL~dztydgzx{EqIdl{+EK
zH`{||7&yFMpc$kV{>%0CI^n_u9>@MMgz*Rc3#^ycKjgoKf(Qn^P<;Iz-KoLPce?`(
zSE;Qr#0FM7M-yZe5kjGaJ&np6g<Rg=*v9Dhd4+^`k1F#7_oH{8NKlh%rPb-ffs?9M
z$ynPc5xeO;9(-LdD7KEOGzgBc;x}WrG|x}fidS5jva$yd>)>0v08iy_M-u(rN<OzK
zIM7XyU5!kik8m_)J@F~oFNQ05iEuD-Z||FJ30-Ly>6JZh!fIVg;oH!YimLkTtcQ~b
zrm*4%hz?TAVct!#bac~|!tTO+wuhY~4!u#HUrG5F>OekVlo9v80dy{H)89D{|GD7%
z?6CoOr6g0bO2&oa7^8oE>9J$)9>ZFYCz=$5YKo&HRhAo_6*-V_8A*~7CZ2&!PJ7GJ
zyk+FZbXN4Z_4IO{O8#yLw7(PJ^VSM{041!a@GUZtH%Skoiy%(Gl_BaU=vOnv3ClO<
zr$n=GIhc3(GA%rK6_8tH+CjDibDuHAn}YwzMD-%X8F=_nbR0_-7Ylzj80z9j{9smH
z{R9Z0Y;>G<uT9<d6)O;T1wg}G0sF=5r$%EJbM~Vuu|{|i?`Z7><0&&zxT~qBX+8sb
zMfPtYn1ED1sB~kH;A-|(u66B^P}U6;bpFPR>~Q;l^^ys%=+8nE;y5A7#1{W!JZLzW
z|0DDgMKv|+Qf-PN6=VlhqC;U5)k2&uD{g^;*s^YBs=;S+sZgUBs5C@kRF#Bh_7V8H
zW>{>cOG?mT*#$mACo#gyWq#tEi+Ie2PjIrl-!OVCd7GOHoeoP&gOtm<3)^houujO>
z!ass(C}@6aPT<Sp#|J7fx$HP}a|Ae@-G_UA43cOvdnQ=)G_<bG@U!9e6Ap-N+c5gT
z-|rm+)H(ug9Zr^Mmib5645zukCy3ySavN~Wdk;l&p-s5v97IAsIM!(J0&#4K_qCV_
z@Tl!^``z4K$`~|jKt6l3|HXA4E9=?vH8UV`qGpP?T0NM6*O5Y9fS~D2DERG&R85r~
zs9IyLAvou_SlrBNE|!1s1{wuYn%yHn4Y>X{|0>K*IV|CLt9b5l38>STfk^46X<Bvt
zdiyH8gepuZ<z|26LKKe+A_^8qiD8QGl>`4H=VH1k)f*>5h6p2ApXYh~c&Oxq{gQ&b
z(MF<VdFF?|XwmvZPh8N9yw31g;1MFKN_$E1@D)3Tn4-?GO_B50{r4F-*4qq3VU{|>
zR}~5E_7v2YR(udW5k06c9}W6quOx*W&|_@cyWJ|u%N)E&;xJVN1|UZqqO0@$HLNOS
z9Ed|tA>I#-M7Ep!_yyB70m*16k;8J`KBCO@)}#w9Xilcz`+UT-Q{%?jir^y~+DLPG
zyZ|_fgdH6aumz{m?syTmg%xG<>kz_F7LH8(x_vM<uvX}3J`6Gtj%<1$D`1bH<MS2x
z{#2)X9f!vE?<_7zBV?JX`ix`wi94mh!%9JG0peQ&@FudgL9wC>t5S6tf~=uta=Ow1
zt=YqKv_9WZgcN59Z{tsO-jL5vdoS$gjELp4ZJyH9(H)iywu=c1)F@EJ^mxb^4JL>|
zq=sbL-{ffLEJmacSrb0UH1I*8;(UYA+H3Q3jN&`GHZGNYkO=AKMWG!${M$YjZ*Z`+
z95aonE&WsV45TW;ODBt>J|-H%i^We`RI{q9%dGd59KdVmTKBHwNtUp}h`GIp02+Jb
zM7Yb9?^2?nLIhW{<F4Hn(_75SAqgN%Fr^D6Vr%O=zLhNnOj#Ynqa<}X<}L$c>bvGz
zY!z^f*j!6g$16N~6kXMVeaFegKf@H>?gW|9pt6{KzUqev?n3y#=GyB|9Gz}LZe%jx
zY77E%U=G@q175<RReDpX)YIuz!L1uRe_t;#ewaW@^?{aOxepQYO1?*kI;o;0sPHat
zIo4`4&{ca)KjuZE#{+*J;t`H$XTeU<S5hTF%tcv)$=ZIDs0L)~ak5JWQ0s~6Dfo9v
zNf)4DZUpL0h4(GhUPED%nVg=R%71i~QFkGQ;*>FlQlYxKL!zT2cAv>HC>YdP&p#IT
zh@%3+;nPBKe%33jri}v8$`7V(e5ABMVUwg3NJ1XV_5@0~`fDg|f&}BJ7@SJXSlqM2
z7oM<@fm_tYW|h=u|1BTlUteJpbiE_^#4L&b)%`ehN~qmx8VhWc<m8ddev>M=nUV5Z
zAJk@_Q=JZLStG<qUtx_IP5;px-OF(J0of%B`ivX^0t^k;j%YnWUtExijJ^{@X?#*M
zk9)GN7jCS<!6B|n4T${+wzK-n2xOo~(C#3FGM+46mu>cd&JC5|iH`E`6ou4ErfBY|
zt0^}NB>IDd#JP~I&9HCylhs>y_npL+OF5o4Vxg32JFZ|YJ?gC_T^~$KbM4P}wJ^)<
zLk}Jn05=ZKcij%S`-8*q_$I?dvja8IciWv&D$VzMTeTD)6dXWI_7%pC!M<j^z)TEw
zWbB8mFJ)0VwVRNc&2pAZ{uA1LE1agV|5=U$D@~)@R}Ddu$6dw0z8p>>k6u3dV|xxU
z#u$g<kr+Sp1xv=sf)sO&;}Af?JD*0^EQrtnAFYyhSb|{ZDkL+<I+l0a?R*U?TW|A%
z%GPv|t7TuG0G+eCeMm+;0JDQafuYq`HDQ%Op1CjK9G|XvG-4PgoEi><yhu|isrX?$
zRQwX-c{tN!gnvd7E~o81jeT5DGPIY^m}<9&6>$tY`I0F#9U>G5pd7M?n|f48{=MP8
zc>~Ui@of5BtK3HRayEcr*|aBFYtfu?)K?Qf<BG=;%a)ZnC{&EVOIAbLi+Q${4m4p-
z3*UtUz2NXbqdWB+x(vxfQqCl{9^QNa!>;L0ZJ9BEThZD|uURQq7gebB;7-|bM>xT4
zrr%W+Y5yxj!b|yjC*Y_t8>zjeFviTQPEDdW95Q!_j126GtO#3<cx+=O2o)BhIyCeu
z&x&x*^6MZKF@f<~d;ZHi;&{AjHmg0L8^k9Um5Z6h2qSLBZ`tk#pRz&cNYa3=)Accz
zWQC?f@z5VjQ3*XAcM~2~+<JH8dN-VzUY^3bd#Ux~nS#DQ@MJ(s4_2N$oDr72s0<>4
z<p)X8CO8;Gr$V<V*X#*jvtan9@#x+SLDJ6p`t?NDxv-!ELqKdI{MbBDFXfKVJ?7qi
zcA(re$LV-Sx@?P*UXND0Z@RdEzA&XB;h#Y%ky_t)!PC5^-EJp`)a#@)$y+M<kUxBa
z3e-x3rxXmu_W5Q5&8oZgau9<BWyPT((+rqT>Q-b%ZIoWssxy5%uzZj`FH95%X2)k-
zdEVO@?yt2A3~&7`;q`_=zY0ztdqn0esoCh&>3m!YUw9=LGV<?D#HVpxJ#nA4W9}$4
z%>em$+Zcbv+XrMD^ch#p)|$AezRT~O^h_N=9f~O`BO1EBw*IKx#JGme?D09~CRtS0
z%8$#Id-cP8RFB$8N)2ex%E>Y=fs;^B5_DzH8-QU6rZd;Nc_kHjnO2=K9>X&scR@+o
znj2ZN=GJnncE@PYvdFQF>^_7#5YwxQ9ygO~gB+qm|5gS6FZ@+E{o%$O{+p;^JBehM
zx=AbGcVuV(VlKzq%zj?J&+)IbAU&(?9H?fELLFw1f3_7fj;dl=gONNN_K7R;qT@Qf
zX+pK<F?Z)$$(yI<8?hC<eQBg%;cK~@A>6yKc;th*Ad^wu!w5+lQlhexSB-Wcc2R36
z=Gu@m-+kNT(vZY~iBMhZ0TD$a28+;IHXt?rBZ4f&$FlTje{9~5T|YlU`o7)p!;@Pq
zb2Bv_>KQ^poSo%|>uY;QC%x2_uo|tBxH#rUFB8HwyzQK=j0AK{#DEU~BW&Jnd=3E8
zv>%49Esvz!(8YlVO6C!N6kh(uoVnUf{%j0ozb(7eZw6vp@J9X8N71-EpA!@`0Vt6r
zoimD`^kRsyxmy83<2xg&CLaX0Vh#Yw7k_9hr;q(es|wwq-z1{GBsNUQDM~qMO-ANn
zvo}%%nn<G*cQ@2yN*Wrynm1;kUw+v#!QuM7uJ*j)ia~>CChHL|3i3Kh+=>_`LCA=!
zG$F=YTk<`>I)0RfKhorjQ<$|IE}o3B{Mnb?*Z8As7#UH*S97BsseC}0+hZ@AhmSGA
zR9;x>AwaBhdk2F2%13IJwnEAnegzkQbk0HJ;ZHDSJHIS{fm)4>p@aa>)5V)Wf%PzP
zZMcSGPNGg3?9gD{00!ol`z-pyfBK1$*T3gEZQ>*f#!k4y8MmiN9_8BMTznoi-BA!{
zBCFe85}hvz)P-}DCqm;$J3WoYhlx+#>H$g?YAz=gTzkwDW1bxqFT`$Se_EB8tD<=y
zK}5KeL{@|@iU?~)!dY}p?zpvD0fZ_F%a?DJg6E`7+_c_|xuT5hPES_wYwy#{C)}=>
zFB#Fx4;^>a(S}&&zH}{$qy)8BZZ`(dGE9CELI3H<?v|}u_KV0SDlNFumR-t88jX^N
z911s7lY$E!gS5Re8LB*g@p6WPEtVe}0}A2^xW$f}T<c^Q@H-rv64jKMsYI|`3ZnBE
zK5-<x?MN01w$&kIVikWUp6E@r8QH#y)8Ix4W89lQan0IrW2e45kRkYyMWji7Hr*L3
zZ!zgt{y3N3CY~0-c+1qWY|ymZl574izd-ITh@U@W8{mk}*G~e?hfcwXR6-Sz5sL8n
zdYhCR>iWL4OJb&xqALQ|r!YSmh5sPj`Gqa(LE<awOAZ)0uPM(bWwA^qZ=~w_DyobQ
zQH3WY2}^T9)2Fq5jAaf5F?9bMs8)?m$niPRbfwgls5xs_dQJ5sGiI{Z&jW*3Mdvml
zCr@{+uQ;s#THwm_D{SGzy$mtj;2<bp!l|J|NBxONu6ou&l{ufUv<Q960-QXLkaUk;
zTIu|^H8M=SZ^ECwplp=#LM;^?e<=MN)k8pp&HK~F`V3rB@7a+)O`P&DgQcVWAj06c
zDnW|!EA}%Bg~DMdRYYT2Ul>`NF!_!SgkrqbUuC1m9Zg$gH7|+^x$R??wtB0Tzh#9m
zl4D_X$Ew1F0%5_I6P5z=tw^*<G$ZcL<NZgHm>Y($J!~Hkuefo(49@h4bxWp+b0fui
z!X*7OkD2nx!H^7xGSM{`lu?~r&N1LN#91yuRiiA!(AO-ujy-bRuJRC!jS7p<_bj*$
zbm&{!tSe`hM+v|E9;P&CvM^w%mRDG&#&rMGLzc<W80RHkv-Bz?C_4&tnwx~0^ab3)
zzovuez-j-{foI8ncYY1(&u)+y<xm6ii6nt!6kptCP=^~VKkx?Q27G)iij{<u&LZU5
z7R3sw-1a?NstFIFTbd_FEMF(GaxuiwS-fFLp+Tw8(PQng;5nW2S(t7ol8nvI2RIaE
zZROza+P8ReIP6l)qQRx#Yt^QH>N3n876EyK(D_OVr`fI4GX^_tvDl^1jtwaO-IeTT
zMkwnm5sK{koqRW`ig8;~nRGMsI*Sfa)ccV0Zacxd4L^Y(zC#O>$J+(l>pk2VN<7&x
z@P_OE<aE8Uw1PT8#)Gy)^H~0eO-VVH)+yV=bAUY{f>vralyx${`cd#BBq#{hhc+@O
zev);&1OEYQ9U2<7rP{p`Sr0}xo7&It=Ucbth4tp<cSK1=b4>{mE66T(+heUh$W8R`
zb78HsI1QZJa>J4#kxN(yF2ji{m2|n!G!x`y3u2p%$5GTJMG*NS(GP3(zcHAPvdmX7
z(-_O`z(hjsR3LKz<V(OJ65LHsC{nPs1tG*-e$qR(q<hdEkCFu`NcdjXdX^GI_&O*t
z5dDvwO=OJOW449SrZin)jfd(((5IdY(Y5gbyyqk;kRbeoHnr<p6FW?NvD2X8#mX88
zn+9m4KGu8kMs!Xz8PAQEkW#UAm`P2_6r3yBVvfR>EZfpU9ytH**+?*UI^_Vbfrw!3
z>6(?w?->RSAee8~c#G~CzsUXt8%+r9rhKF5?`Gi6Z2kqi2nuHl{a|zs&U&#{P`_iH
z{t2j8Qk!zEa4AcNC-F8E%zHoGAVu<_sO=fAqDsfV0mHGxsWU`EFnzqdYS~SWcMr5E
z_#rT-MQdi_$9gm`vTjGE&Ptsnl7QAh*#6a#kHC&tx%w**BJTuS;rAWzoD=;_Vs{&@
zU&@q!G2ZW*6PqngU}(@X(tPsvyIP=G0k!Uy7^(^K{ivVkw*-2u1vXB`*Y~i(-lV$-
z1RBK3(_evXEQdG!-Zx17pg6w(m={<cytHAX=tv~7SxVl=LtTyT@5R(%L@d5(x+k~N
zN-2jH#Ox~ffw2neFnh=?6ddDb2ALw!jKNOv_`QIq_Y0!<bh|;X3abe$LqF@J`_;As
zLNMJSMDLIkUleE#D>x0qKWS=w!*<JxDpC(YfNEQKO{B0~wH<5ZpjIIqqhyf~6|thQ
z{DYXxrWDmpEp;JWCxSi14%!4Mx)|^3(vBa2L-O{p1$v)jbZ{C1o?i$eI{lmeT13aV
zL`w8dA?)L3jc|(#BSJ)#Vwh=ABoXi@>sXe5G(>K63|_EnpofmdT?r2c9k-@tN_1@j
zT|qr8(IXdnbLF<7QKDFXbnL6h2NrD1!96r03eF<6oHYld;C=fvhC*t!A-j=p5@aJd
z?~gC+t!6T&#q&f_mp@FZzuo8IbkZgogH}SM5Rf6JE!TYxKQSHV5zH}(W!M#^*ig7k
zs5~FZnChK|SJ<eAoxEOfO&elI#%#q!HZ_3T;I5qNIZHl(I+kBaJ4*i&2i*L-#J^>T
zdSJyWlR=p)uZPKG{&nlc>?^WIa#bNs-xL1!xTNqx;`pKL&N%uXhJPdJ0@n45z$Q+>
zBQ(Ry2ogm)NEqemGv~bb;<W(k7}37?DTB+43|~JzmwAtEETu?S!Oy_qw}oXUoWIjK
z-fB2Ts0-x|d_iu0U}a-O45hk_xQ&O5hiEyh<?`A`jgbwHNrT*Gf;f8zO;b~wQV4w=
z2hM49GD*=)yxrko_XIqXN4qKodaRS>Nq;sV!K~f5A34i0OeucKb|b4UHW{(hbZ>AJ
z#Kt;oQ72JeP*1rR8%zH0`DD$3{X(Z(0Q5DNVE3<x(5-x?;7XeceOFx=W_Sy@hwT^z
z_W>$LDE%-NzV7PI`DC_;Th3QO8lU#RlL)jsNCm{%wHh8u>)J+!Peze5nvs@-2KjZn
z_SLni2g-Y@7?WtHwRoAtRI6_Ff5_K={O58x=D`v=5aaXvlN@#8f8Q`6FNc%0VzyE(
z@l3IUTtJ*zn=<t-kNd4^%!k_uxgb0fsa+4N4USQ=RbIwJtQ^)H_Y#i4vhou@!+***
zDzwbZkuDD?zSv1d?0?v5Sa)4=9#aQ|5}|1;`G>atH56uJAU>Ih%uGxld~<V|rz>8I
z<g!<jYnM&Ux@<#!`whTEhgWT#KgqVYv?jT1_N_2JrrT@1_m-4>EY>g(p<qS|#>US<
z5m%VpQ9**Pn5@fBbs4gCk%ZF$&W!w)m4NA6S@p7pouA>l47vXHcguzZqr#MKHQ1$K
z1617ts93UJPT!xN*UkXdtwZYjW{hM6pVxV(8F(c1-xS|8Xhe#H!ypYT<qnZl)roLC
zF!3K)gb7^vCp(9S4?F|83Y3ZWeEUtnenw=ct+RTA2AB}>*tHyETc^&`?sP%Rxnba@
zFJfhcs0qmY<q<-S=Z6djchLiTIf+^cX_QFWqfC6x5}pw4AM6?`IhcMbZ9R%wFA_Kx
z7`+tJr9>%{1lPf<5m0Ybj<!?*M$qsNSbSs{x5b=2?NSI{Ao@j$c*9s+6>m*(YeV@G
zHEiN`aUsPZ3da#~ZL>|uZ>?dAI3<S~_-r&2Jg76s06-M{5|%<&{~AU<iXyC+|LDQY
zNPQrxHarwDNP6yJI+Z06Bvqg+5pa#yE#pBn-(+WKV&RNz*k7)8245NMlMusjG?LN1
zJgpNQ-pXj?o-mczTcZA(0BF_}i#p|N7k$BuCI0zm`{St~h;he2X>EL7?GV!2%@klH
zDEkc92gjQPNhv_U%<RxG>=+~ro4f{PCXlD{pxBCvb_1t|mZSHsan4V6`PKyaUn)8H
z3F|S!=_;maVApIF;qV$-6Z3^=rm~J7bC<I)ZJ6SRlyE~cG3^ccoxGE#Sw@0c3|m6-
zaf-)T3>&F!k#04SkObQ?Q;s>1dItK&Fj;h;lDDMrJ`k+muJ@Npm!0Q7JEX|Tt;IJ5
zNlg+gjMBbBlyHzPE5r4CM2CQ=ee){6Z4R5>1$({V@q+nbRF|G>s^`TsG1CkF*A^?3
zp=}%|(2(lLk{Q9>C&gu^E!3=7Qg*_hq{C!|u|lk?nXwQECeM9)dCW7=>ED7ArHnr5
z>!P8=5u&n1nl(SBplm{uv=su0N3<R&!SxBd%H;?4g3gV{Yd1NQUE2WM#(R!<uTXqS
zJ(#`#r-;{j(r4$1e{me|xGA;F$KXwIN>=g3D!T(T*lZZ)eFix+h!U37ZPCoOm<@3<
zH1$u?0c#|ssaF=uR5W5nXc@8VgaRzq>28W<paF8Dc@0edzS<4nGd2P<4aq*BS~#2G
zJ3)Ku6^VkM?;(Fw<aiX)Ika)ps_OUt9bqkbs-(wCxNC1rzEi_~W}a!@pSPGf9+xWP
z)r;ZD23wNEL*kIcAbF?4Zt<3f7~%dDVOU}+vMW(X@X!UX8N4Q_f7+}bGh#epOcMd!
z*|us@cvxc8A&v;{oPTmt=9tlxU<Rj^XQ1Qa?Dh02@jk)5;!@v*FKi3#eBv<zBt7p5
zlQSkbBQO9gqfyUn9gry^EHq;GFha?tvSwbU8L-FKN^Oq~P(`OSc62=hXnPtkg8{i~
z_cGiQieIj`XHR2hmXMz8oEP>-Amlx{ozSo-u@#Q2g<o3~Iw!^518UTZvO7#GP7pKb
zv`|Yp`{a7`CVWrF`F=cLWP%^K+bJNiE;zGy!jbUMivC0nh)Tmn!saU4MfbL)<iU=3
z0foRJ!c4dC#_w2fN0R$fKjWGjR+JjFwja&e7?dvDifPT;98r&<4h7R~vC1Do%RM7^
zEa)Vwb(lOCl}98oAbqPH#-;AO&U0-zwMhxA;%0Z!HA;Up&b=;2ff}sP3>&x`#fJKF
z9(n!#)^nR0Mk}xt5=g*){Kpd-$M6N@PiWAnyXSL0qY3+kj(}k_aJt-a;CVOuZ*2|O
zm`1~ZhbKGf)X(nrSNN_&&+d7px&cSJ8||6q_?wu%$wY5bXRLj2x}I&10XUsDL<DJX
zN;xE<Y+veA*ZdC6c#th2CqJyaa=p1afmN+*gO%{#7RqD7{bzs>0`DqeI0=u|Cl=#|
z-Pc74rIqQatOzR+nLx2W0?!MIAB3J?PSv7}WHaeSsHEeH^yY1AlKa(MacQ{UsqSt)
zB!N|Qj@?m-locNynP!#)209H5TK%95?f(O2Q`JvCm>xYpv6V1oo{D>|VR0?g*8@aa
zeR~tWYIRLrb*6Kdh%E~MUIDj-!BJ0FBKsSFC31vDvtV$Zv;vFO73hi`c$OBqz31WY
zdM`9lhzK{UVtAI){eCMR*oARru!+rd$98(Sua?at@*h(FBt?Mw0;FM^&(2<<P^@fJ
zOmG8#sRw9EYhwxAk4sIHY(>cRg9DJPb8?3G9(Bm;O%cg%@S#lUx7oMl(ZBRpitVw~
zb~&U+_-TsPj9_z5NQ6s)nAI4~q{$SuSFeZe7TN<42{!{7Yu{cJH2yszaqfQrZ#jwl
z2p$jo*;_FMF2}#<MnJC|LW0{ujxOwlqY;@2lJAgpd=US4@|xAP;%@_rH_iK>#3YC<
z-_${v&c)=PAp57dvR9YEYQPl+ZFC~y_L!;(%u$^H>SCyjYyl9xx>sk^nQok%N`53>
z7b{-_ID{Kw6$`Guw{gd%5ul%oYXY7B4xPthIp=y0px9l&G&#PkID?T*2davw?30)s
zrGX9$h+aCaMMzgrFT~1f=<}3TFo{I&nEvVaKSN0A4^)@k&@?3_Q`NxE4u&vrs`4xs
zZ__4JCj+`2y@Cs7W~|T<4+Z2BU`Ge-At7O{AGG>xh`e7_NkV-d9LjQ@#bC!+|Em}H
zK@~V2TSesg3}?o$pHM?`&>zGRT*UPyWAq*h&CGZl$4mSGmi`7Z(<XC+L)#<<unmrF
zW5a6tv>vX#iyR(x=)(3->LDMvyUarW)z^~nX{aNQl1?;Qv_%e0!=APJfu5EJ>pZgV
z!*jq6flm|o+_)e86>f8Wo%wReFr_(%p>!_Or%YgA)g}a60o0xW#-k|vQel2b5HyS`
zrG1snjcTF`BMqrTV67=nL<O>}RM#RMbWcl|iR@7~1JXn`t9QAiNOg#bELWJ-nOl$v
z<%CuV8151_CuxGv;svAdi@*>=IkrPU;$-Mur~FEmqZ|{j3Ruivt{y||y{27cS4oR1
z36W|K)R^1N;n82gKj-KU-itLraGQEUI8ihN{oi`Mpzh{0Um+}shzW5Qw`dhVqkT$!
zF$c8<s2WPF9!M`AqNk!2`8efGF3Ch9nGz{_0Za9ek}!+`8EuK@Ap`OlSdIdGhRlHt
zd#%3~&;NeB9EMbJ^BJ1|VmA2w`Czy9jP}BLG;s2L?dV?@_SPcQ9!MsPU3W<1W(nif
zhDI=CgNBqYI~JoWDtf7Z?S>;xQdEPRphTTOo(f4-j=n?&g1%~39f(5&y?7#J&f&Ws
zQUUV5&9O=w^gS7VfGN&p7ytA;u;AD*Q|TJ5T4irt+A^aa7AAaYh@6^p8s}#ll)CN$
z_I9_`mr`J86EWi;r3m&CXu>OV$u#%^&<pG<7F19=I=0HpuZnt}#rFP2*-N)n4?pzi
z%}%Co()k!(vs8<li&(u5j>=bU>yIMGEP|zB@teI^;h#(XmnBkC`1De>`z9lhg&Hf&
zLG@l=)WE->&A{?SG+aN-*CgOm2I5=Qq>9z(@_FF*kqXj>WGGc#JrX4PSTng9swQ?J
z0Z@O5v;UZ=A$)BS@jqT2&fhyg*YHSoVa~ljkSJn3ci!CC<F`^c*{y7ov3q2<H_;bV
zA>Ze``^(3vFEpWOlID8Zsk~5#>1}2%{87*-+?EW{!@U0eF&^n^hJ+^i8)S5pkawR7
zA@HUQ02-)6_g8Klo6uU8Hmew*KKr7Ao>S1_tM;x-&HdQl<65(EH2fQ_6J)s{#0@)=
z-u4t8W(@Y0lT>0bAW)G<_4LX0n{3cmzq43(z^<&Nibx|*7dmq7eaBQN>nbvx7g?U_
zr{*O|#N5vqDKNypfr<R;hehivC*N+-V^1Rin~=$iR#hfaVvv^XQXT4f)rM=SpZNvg
z?AZu*_HHO|1178b5%8MfXF8DNdG9*>UU_qjlE>hCj^8DrGZWKg&5vKMWowCRke5t#
zXQ<kH@V%0J3D21Nat%GA4a}EE2X2_n7|oxKVfg!hjMJRynhWxLE84Q4D&PuKWbO!M
zq9@qPDi9~a#A=1}f$BTew+t>?p3eKXKg0$5tl}=&iW1C>)}aCc{u87}*F0B!#GSf}
z2o%?@<KElhyS1zstc0EZ%fk4N@2)&VlU;oO-}=~4h&wlIL6%@)adcR??k{gGA6z)=
zbB~KCesX+#XS2&e)JfX0;j<mQyrsX1{#BCpq7W`(;F9Sw7n<>5JG#Go@DKxj^7_VA
zmbv-mp{9-kxQE%eJMsko2-u2U-4(FDh)T6W2DJRL=f@(#PjfMQG*i<5^w|JY?2EV5
zoJ?IwM^$3R-kJLXEMQoQNmh+_89oxMH@0RUoqm6qVNRs0XL1!su<s+#Uw2ELK}$R<
z4Jz34R&=)0{d@TK-v|5L6!M`HF%O^1P{Oja@3$o~`GkwI{PCUOIlHr=XqE5chI$TZ
zdj3Sy1de4B$S@`|;SMh6mvQ<klr*s6%h+!&vyuE@34z>S2+Os!oa302n-=1HmX9be
z2>)J$zW=GpMEqRrBbls(h3U?2d-59J;h}lSDRm4a-J6RJ^k*FSw<w&aipqGdJ>D9#
z?pQ;I$&_B!-ulOb58=Oq8^rVauVZlr)cBWBlhqSe;g7@J#6l&b0GW6kgMZdw%L07*
zqPDz_snd}z{Odp&u`!t{p|<{7vAz*{wd;lawsuouCW(ZjT_wW^f6GTZLUvlk$-NN@
zSJ_ip>=Enhb%89s&oB{IYA`qKy%B4)4ZSITj2n#*s;J!I3gz~7H0N)4p8VOMJ+mfo
zs=>4tG}SGHUI-0Fk?Pf`q<Pi{>i^tW5~yO626Bihf^OT@R}S`zi3HFHwCZ*SzX{ge
zwk8<Ih9r`nz;9~1y22J$F_IXoB7alIIEXdMzQd4g)UQ#dscy5fEEZS%h!+bsz9fJc
zLh|7HHJClJ0AEDf#0eEMXdl#5j;EOQFlQN2dG5Z$4{I5V#Q4w|=OSjW^$E$aU#en_
znPv66e_cr@ZBdX}I~oErb=ay3v=|hv?j1f2ph`dguxcfZ<a|ObCk@DG2EUSPuNKf>
z`9ZEE+^T@Z5Ppt)*kW;oNFqkR1%h-#9j6g<-77tIA?<EX-GETC_B3H4ppK%OfggbO
zY(KpqvQTKtgQk>#T5Q+{{5D1bWi-!2xxuEDI+&rz#!<0#0u0zIGm*A>aZ{;mm8oj-
z0+Xt<Yky&RFLiG}lZqR(r>J0!oMU>H6_#+VuA#?G>3PvJTuxxH$%z<+HuGf&Z=2U7
zBBnXNJ^rhl0BbY`{$U%+37cGc<u%i<Y3sf@xfBN2qfmuk*#BHyM<{l#v!<CfraVQ!
zQO>sOzF`(cNEU)O-XF_p-&(ndj7D^KhJ>`*Z(TRMf8wn&(i7|wQ6m&y=;R{RV;gB=
zwdX-><zJ@&%mQoRx9$lEi6=)QqefKq@7a*g^h_&e_i1mjkqmyODUNq)--dJ&85|}G
z_doIfuu82>>oSk6?+RgW^ZJMAN@I3YJ3fjt=M&*0(SNn(XW>>sBhfM<w@-)fw}krB
zTr7k%>|D5e3*O50Aq60@^|vS~n(#Enl0ue2(Q{@IUovtFTRZkCyS#D#xCLl1*-##b
z-hAsW+N1kL%LKxF(2oXz6m2wS-48$_60<K>+ioGc0l;(Ud9t(fqFgthYwc8GGhX<R
zR?Sg4A|eW6zVp?hn_gMq_#mx*W|Q_RW-kSyVtd3}D^Al5;rJeloB>yyDi@xARVabW
zHlxDVR6Sc22{|=B51ofdWk_I85p;!w@rf+hxLG?3IRmvBWB|DpfD0TCK<C~|{rxMq
zo|q{|vjH=~sa89ECI8x{33u<arSiM*kVG~lo({FF%nlki&_W}Km654ct`+X?m(kr9
zvF=dAUmdBwLvrd&`oH$*2to!>Xut3Vr{V9LHQk~)=~kPGin)U?Z#*e8>C5cFzw#S3
zN%jsYdX~PRK6D1QSb)jr!@AbttuLwh{?R|0$9dei$dnT91&D9jrCr6;H(28XJ$%gv
z?dh1Y7X{=9$lbypt&g&kM_-8GFwb&JKKyMTB)y%SdMma1zkpSD()+fsZ<dJE<eZ^K
zQ7w~fiS?BpK@IX^Hj58ZgY8Eu@hXI8syf%9vzQ-&x)PTLi3VHSp!hXtPYF(RhT-L4
z<-?(ZFv}HU9^QU?ar%$pl~khB0FXnQp!FqKJNv05caT+=nR)^J4~sV7HmtvJNrFcg
zg7NTEF3aq;bu9wfZ&O&iRuAlQHdqa(r>_SOwPQ)5Hs{2?7lkM&{4wVymC4~ghO}^F
zH&p|vYiOwRgCarE=24xgj_q}o?6I|Y(dRW#^Kbe`c)w+X*i_!!JfK;BzR$iN<;{_~
zM*}}d1L8#!am@o`lEJIQQlg2ICeWuMbga-1?#}D+Z9hY3GwqIQHpGbce8o+c{3))y
zMtX5#O`6VqIdb4c1OreA>;q5YN>aD|+Ykyx;V~!A@6j)k!<CdfIICY%HWcbas&7TP
zSafu@W67i=1<v5Ly@B?3=5E2U0bpn4EjCtfvMz8rvQ+q@x2(kK(Ca^Kclf;+dx?(t
z-fIDMEoBPdfM~z)tR@=(V`Rl!PM-cPF@zeR7k<#;V|)Eg=0?IA=1CKY@5^l$Md@Z*
zZ1_mL_1K*LsKoY#-^FYgoeV?z^C8hs)g2ntMhI9ziA@B8j;{?6Y<GNE1q3Uy2unL3
z=eXa&n{?Q%^Zj+n*m5gI=jrU8v=`hZ2RvYC1jr=b8gnMn253E-2o#wkfm3Ozbd^3q
zKCLT#AD89zhRVPy(U;aFp2y(kd*!JBOQc5zE*2nG#agd1IhZ0!CDzbjp!r6%Fm^Eh
z^hA_GmtkW6ZJ76RY#ona45b8+VR}vni*2!EU#Y18hy}Pt-isdK%62Qe7**tv`R5Kz
zPTqEmUTIdRk~SeK%_O~O?m7OM<65i3if#wPDjFDbs%Un?F<dnR+ksGu=>TBi>@%vG
z5f~ckd+jj>48CmmIf3Izeg_Dr`}qtVo??BYxtf5s%vg_ud18a*QKBLEX0ifpi2I9C
zKDptuM&V>sxeEngXynYdi<EE<e=6C$i{cXd?uqZT8$hz9-$ukS&*#Rt4M8JsFNH<0
z(k@W`Es;q!dJ0;JdrLQ)1A(*Re|S2}sJNOYTEoELPH=a(;1=B73GS`|26uN!aECw$
z?(S~E-QC@tJMVYby+6BW&RIR2#p$l9UHj?#%_KbxRL1?w{B+x*f2ucGUSIJ!U-t>t
z?*Gs2X`>`j9}8T!8?6(HcExOgu+}bvLSm0^{%8@SD=u##85_UmpfTE(bfp79Dvev8
z=ju@ye#cy@uwS@TYh{FIXyY}7EP}r~=!grOpD(*rg>-bT(ZxJEmvJ+;u*Kpm<bBy9
z!-C&?*lQVv<=pa4PsDkzlPiGVT3B;H7gQ=!Lr3m-;emV2fa&@!?q2J}oYy!on*tH?
z4|O#)f5)uCA{~na+D}g0y$@uZXM;ug+Bz+3zzGTa%4L0Ij^4mH84>c&DF!oP%0(Zc
zjP8oRCFQb&_iu)<L(YXsxVs8}!tc5+qq7z(K&xk`Tp~43(L-&$z>CP%qSBErbE^D!
zCNf5W+0!8fbzY`ryRcOVyhNbQqJ;FFbO86Hhc&I1a;cIeO=1=w#+AJbUoQaYKiN5l
z9Z%k6Ve0+i(Bt-MQYE>|&WW+5z^x%tLr8&P()EonHc{BcU|(W;y>5#7K4Tj8yA)vD
zb2J+J%M~@dJ7F`_7hHJOLpm0_C#}Am2d7Vj)8OHIIdI`l2JA(5B}?fH4L-#d-8Kl9
zCm|}Q$7H~e#Ov=Rt|g@9Ur*)SyrRi#Lmd?Cg(BViAwJhXW7(3~R<8*SL=%QAR|c!E
z_p3w6edEf!<l^=0KX;60k{EM=nSc#>(|izzTIXo0Wr)iUyU;2vjOLtT8r7}N!Q*g$
z`smzC{5jm_o>+|koI2r3KQ<O0m2{>9g;3Z&Ks}2nos)IakVaO<IrT57G6U}sw~$n*
z-3F^4|H^^_MpE*vPzmCM2fqFN6JR&<#Q{l9X9;!=svyu2+v#UuS-l~<k%eE@C9+Rl
zK&G@M@DCJoqz&>I{;%YAy|=M^Vj@IZ!!H`7M#!VG2Fx5m$7NFzTi@9UZPhmlItRM^
z<O4Lnp1_0Rf~VSWlAxK7%7z+3@|PaeQGvD)YqF9#ASkTPHX?&PQ(q1=<|u=ZF`3ec
zoU#qqOYjw|IA3Re;YsjBok?icj4aFxH<x&&SJ6c&V|pw|*_&~qIZ&PLc`f5`aa%0%
zc^rVzA4kJMXdw-h2vP6cp#E3D0{0R`Uv(u6+_n@)Z<uay?K+0+Zz}etod>9pRpX(0
zqfzv+WSWCQi=G=!e35Z{FJ?2GoDMn?9BZ&(v7}`$p6n&g*9E!Cj!SRIX>Qo?o#zWC
z2kJRioe%qI@$2{i=*8P4%{2L~1E#klaQBxF4%-6l;A#tVHuKz)7GAfO=&JHwp}(P)
zBF>E&&Ku~|6-WE7q*iM7ZL7|)78MPOKod7@mSi-?t;0zjJ{aRBh?sl%vWcvY8=<(0
zL|JSjjtJ_<UI)Qpt(*Sxs@++4A+ITlwx}7LyV;qZ)?--7-${bJQ)FvYRyR#a!?rl{
zh+Z+P1a!AB7(BSq;3Btur(fUSSgD2=ps<Ag&04yxI}t()F`zsQ8zl@v_RoyW!p1K@
zsv*;gM#gH5F_pA7HZ8~2N#eRfFd3P6N)GIv9wIVqAln4g`+yFMVV#7;dq0B_u6}$a
zJ%Ks-!TKP^>XX?qOB@bgVakAWW*~+RvQ?ZyWAetDF0n5D6x{@Kid5pj0XDcR_=MIM
zoN;pW<1*s!K|~Yd*0xd6kdye`j8t`I4U^*ic9mm$$$3ME$pr7s75YIRb!ccl@JC)e
zYAo2QgYEF~EL^Tk?x*)!e~Y9D@gbRkT;nm$e-nG-EgyUbT$iF5G=v7b#O&9RFZiN|
zZ>`y9)F5h{;i7*fo>MKZxCV0-RjOO2)S7y1-(1=gJtQVXmrTh`rkx3dbFZ)*n*h`}
zQ&eAdn`w2jY8p(%J8_19AQ?$XlmsELf_u>MCTaIY<JW__`vzs6$BXCaXIr~Ure0ow
zw8QaFbfL{v4{^K9l7{)vIkG0|z%NynR*<tVUdN)l<ODKGTJL$m#r-QpkqXR4dS*>q
z=~TUsV(RW#JH+gXjqMW*A6ldm?i-;aK)y5Ua{c8CBx2Lt)lU#4vNwI_$SoYyjA`k&
zWN;rAr3$<ht5fgL8&1L#*2Av|X?wgV)Zl{k@qEEute=STJQ!8wbo9e<yvHL&!++Gp
zKgk{YVW8%t&B*Lu+9f{z>$rmev%8j(o)C_^YN|iroh9*&zEYk5C-%7r{{7QC!4%>#
zZKLp#kP~&h&`jl37)HT#EELteDMDw0A2=>&ModEH%px~Wi_4?R=gFQgVzyy7>NNP|
znhZH`)l7XB4&DP%mrOmuU?$Ce*S~5uLS@zGS)DvcN6U^o5p7!_H%+zcEXz+q%Wj(v
zwa47tz(s6wLx21gxqf6)yV@wPOMwJi&OPZp+UMX>qZNr-zFdI)x{7$Ih*99u)B=%G
zYbIdB;5ghK<ufkfUXM=y8vBaun2qBc--3IAn}0pFx7T^G_dE<gf9%2B$WaZGmv}yh
zvROlEc6haD)1oHlSR3yAogRL@1yld&nS?ZXL60}KMVfXp`)EcpwUI*>;`UrCQK@Aq
zoq4N>RF1sG09kurbNG*)M_qKJ7<s{0i)0LpY~`GZv)aM=B{K4XZ~XA{h{+*$t`<1^
zK@i$2uty?Jg{74Bf7sg~PD8ov5hVRemFVH0kI$H|A_r|q1gC5kOrB}^oAkns(IOn^
z22qDUxIw%Xa|jfhF!v-H{e!0L<8KJQ^1~}DtWGe^{TcbpJj5a2sKvRheQg`Z-N%~m
zM*UkMM7cYo{Y58%)ILE*!GaM!@=}COf1qaB90t%h6~@0aY$>mA2ofQ$9U;G5mQ~-w
z>jmT|UhTMtAB^ejn{)BAlUo4^@$py^8u^NQa3zlLQ2``BYZO+$YW((7VBh=h(!<a_
zCGBCY_uC4A!iRfLWX+U*M<k+;aRT@P(<#(PjETPLN87nctLfp{n6s!08F<q8THSk%
zTI%{Kxj_Mh#$RSZflhIBL&|xRePaa6>M~PDyK}|%&*`~T*^&To4ff6PDoZ10&>J*=
zdE_AHBmhXQ&Q->Z3wvX9FDw^y{~FU@o)HESkSR+e4~$eH+*H<q`%K|1JiJTEZDrIz
zWt@3^zOT}lz7nSy21LIhjtg4HaI1r9P?L+<8w%wS@|a887=<!QvUrxq$Ddf~0$NKh
zYN;#XauPCWA~{$cz<11SjV95l0P6xB{?itqttUmHg3H*<G`BABH3;0o=EIbY#k_*h
zKXhJ~B<m4X4v|?Ke|=RG$`Bylt&ViW$(VRGl=oi{%nhlu)Xn<qb28|MHx(i>L}nsu
z6q@)s35HF3JR*w9rS>vWkC1+&!3mnkG`xabwGaANS05+7ZpzXQL$qLOXRrF;ljOTu
z#KMu<)Cn;esA}eoRny=$_<0+8bhClu4KUZZ@s@6k4fa@JR!`;bTEY%xZ03X%n~T?4
z4?Vj%z+qE>X8-L{T|)_a5q0ytm4n5I{e6n;;&LWw0BX2-K_SzQ;b#V-)b|b2E0upD
z$A1V3tTetMf34Tl)4Q!L^W2L5vhAJ0scTELZCiKn_ofSvH#Oas+``C-LWaTMwzJtn
z$gFLOb1&kH`30NWv&U!Hq<Q^C5PI&cp8~GMjKKE|dT$~GS_I867pW0=a{}LUFg4=O
z^2ac*kt|3xo|lmQF-8*#0Db3;gDF#o0(u+tujbX7XzEB`n>u%%y>nQUeuWP4I;^Ur
z?<#)Nf&)zn82N!yPY(ZUhHOuYiU)%pb!{Fk1KGe^1}x2ri7tn&U;Y=QMXxdeK+C08
ztbmchkey)*%Z5P7gI|fjAvsAMS?9$(tRUxUxjhvadTm^_rKNRT9;C=!aj!}-S$N7>
zJCGAt&H{z{z;2@i2B-CkPGW}uwvo-qHk1Bi+W*L&VYo<*3jXjMk?0x@{h1%!iJ~AO
zq#Xam@)&KW{Yulc_NDj^jsZR33jg_6>_KbW>DT@ueF6dZcm^wj8BW`PbnW%P?ip?K
z0Vs={$g0E&q)>iN*I0&t`5odk%N<)Y1~F@wE;hlbG*Q(=CH5m$mRnoNT+-O+5XP!#
z^w+O3C;hToLisM=6~w>AEnV+7`JfKeW1ps@lUPowrF8og?3aQ)--LEWT{(yNcU5?k
zartOYYSE*hf8@7+tg%v|AKX1pycG1UdKIkMgI*fXdCYMzCcF%f4pIK?ahv;60&+Xo
zbqw<yYUI@^qbswS4(>(!zTb`kqQ~#AW}s~Qb-!5?e}vbv^ZnNmX(gvJW%U_LH2EsJ
zi^S1wE{%et2Z}s%e@DpkqbD9sIWHVofDXI8!>Js`DykNNQW5>n#FG1Jj2+?m#hlMQ
zPfWpxXZdcQ4Z4Bc-naVRIv;F`8KaMx%ZA}MPufBZrt1w}P}y%c{}||Kn_zbZ^n2nX
zx$rWi;<gIeBJ-j>r=YCgyZw1jYoJQAv-KrM^&Ja8?D^Fw;9OeHRJ&Uym&Y?1l;7fT
zIpZtx_fTFEFyx7iWI0P%BEBM}iuxRu4^P-sXOtk2JR&h}NAmd#I_{Pc7m8UQR|Ul1
zdh$JwGjLY`G3+m*mzQROR~d;L#ed_$JjNJLevMCxDI##x0lp&`fSWT;M@ExnTG_ny
z?R8;Q6Bu+J^w=FOGO)%^r$E}$_`P-PbKTkPneA`}dgsOtcYt~!4>1eK_fvY$_M6Y+
zqi7D!7v0bwI#7v@hT)cda}&Z#rL=huxK%b_|6Hz^JX)g)DuhOI{0Q%VA*noN0@o`Z
z48xnT!h2u_bIcDW@V?zjwIB4KAkF#BW;=ZthPoJ^Xq44OG)IKtoJ!0)&nP2fLMP9F
zY~9Lu;NZ91d)&kafgIx6X<29>=sJ$)VV26AkeT7CunOB^i2AyOFW5SD_|GkNJ!>zV
z83_lT%s)8-D<D2*J*#%>>+_OIGSBiP;?Zm>iViN(PxXInDQZLhUIm(@UqujS-}E?i
z4AmkE8e;T~zOt~%w*~Mrv(0(iK1<kn{CS#B;R(Q68qj(aoz!=7!vDbgaWqj2XnQ&_
zc$o!VB$!YX-U1$<m<$>=8b?_v@uOJ%tvaJBgqaO$Q<47-7e8q@c6~c+h4@zSOyv!k
zCLede$zP}c{FS+RaZK*6Hc)28!COEYk0JrQx({D-mY4=Q6m&CCX;H9>$46IbYM4sO
zRNk#d*%9!{dBFGtG!ePJ`o;!KGSA>bAm9mF?p1PDGJUxonLa8rYGLVl1-`nM8jnM$
zJl`W8?Uwejq;}HGWL(V-Fk<rqO?}{Za9}>JoK(MZdJ#XMEd6(!P3k9w16KVqQg8np
zNSRphf!M9o3#g5eoRaG55-K!+4>RQ_Sd3m~llU3D)P|?hg-$kFFu#}VW`63%boD0j
zu1RUy*caK0aU(i$izwhfE&SfjU&?hdW*g)24a@1HVEfGWO%>Yt!%7JRH4T_DY)3h;
zVd?aP49X8>Cn^KpbXr*j!PbTEfKVc?r1F~zA68Ya@ar(6?P`2g6mgbbcZygwD<E6z
zYdx0ylsG(?5*{Uj=d}-2v9$J|8zaCqX9cN*UZZ)DONGUGc5!h;J0Eye+}H0)t|UZA
zeKKq35m1rGkfl*HUq$x>a6<385skkrBA&Pp=sF*?(5?xV2W$)kqR^vs>Q7Fmx!W>p
zlPue)i7X7fnndYJ3j|#!QtdTz<&}LrkbDrh^J9KsTPS!XIPg2Jyv;<b=Z(ujbk}>2
ztOf-83CL9;{PMiU$DPVWeTfXUHkf>U5#YA!d4QvN2&`ET$V)u=3$X0;gpU~j8ngB&
zD_0dQPxYqxVhT(OG=@Mz8;~IOkc>`HErYq61-hyP{;!)$g}xM|3&}EJza%iA?NNjn
z4HxZJx4<aiLB}62#=h07jv!>1upfC;mOn%zy-yW+dhfd@LyO}JQ~X%H?}N?*4s)P$
zq8_Jri%f!`P#OGqcQp{U<rpJOL$gVH`XUX}97UMoKKxbRW-sQkP@ew2VgQ9tA{4Xx
zg7-67%I`v3-$wY|nN)dLhr;urVTm<gM8A`}9Ew_b#*^^|hJ`10GCpM897MNNK<mxP
zUacAzu|!kV$WOp7)tVg1gU16b83rfc3NGWPN^TktP6^Hw8ITbOOIQKlIxQ&MjjKqz
z3+w*%RK^fquL}1PR3eK~WNM<c`<ED|P}Nv0!c0qZE?l;Zrg$8rZk6{<8@^Z(j&Lt^
z<Ej=s=QMXm8BPSi{^OS7*C%rxxcrNlfti~~M6Po~NO=46zvVvx?XY%Ojqe-laWgUB
zK-$-cu!EWkkqCXN?@vmSy#zTz&3_K+&ax^Jw>vSA+_j(O4pILxz%j}GXCXltC4vTL
zAhWhu`q;H(`X;vWTdzCK#(cosX*(-K7;?ALPoSThkaAB<ir|=qZn(nAKYiivjZUV0
ziQR8nqqTX<IY6V&*mS#{ps+YXx!XNfL$uUF3mJJm-0Rn?)tGq{;)!ZMW2qxli7a49
zo0&?N@B`Jc{2)WFGq9sbn8dEKH`WfSc`Pe|9%2nkpEb?!*xR}7<4%o2p+)$6Y8>_D
zou^Iv;L~;LX&2%zHwm0^8*aCh-s9>_bzj_PxA%)+Y~xi^u>;CoU(3K+W+L}4{Xwxu
zM8mQ6AmBu60V0ec-K7d~(V5>>0glztj7sq7VMn-q@Qo0$W;JPS0sMg|kw^W(pjVTR
z7{k;QmICXZ=6lH!k7Tds3qH{Liy$lICY=Ffr@ub0u6kbDsXOTuOwjk=U*8ZC5A_lx
zrB*36t<er)Z~s|se&0%CXf@i>Gd9%`y36v#eZ1H07eW(gb>#IyVUAC#XHp)=5@aRT
zD_6q^Qc-)h?}8xEy6S%W&-Xo21UGEMN`i*6`<<oH`6EgBZzqIk$vIE(`&)QBflVmI
zSMU5qw0h_CqFu)wz-(wLdCAnKu&Bka8H#1J$Zz8>r2fo*MBrjoy`i}bID%lJI{n4q
z^Am|!Jt(2w)3)8FP)|E^BtZGw=T~)C);1M#4!K)ta``<FGr&Zr@yRw+L1<gOS|}J#
z+(?K0T){R$oRF!hB!6LR(v>~*3abjDOkq%T%8dIQCfERoK~_Pi{Ov{W3+jsS4{ay!
zdcHO{%wdNSVq6X`C>0aoChNz4=>Lt=AZ}g-&PaGk$TVMplnLuef~+F1Qd*b@-0H76
z@PY|Utet;v<t0iuljdIgMytFh{Co4{iO<YZS#OgD$&Xe{ia=l;!*)kdOGPewKI~V-
z!Nb$)w2Az&eHVYVh%VXkm;fc(AjsTls!(sZqC_G#STuA-g26PHs7>fr-SV~1z#k<l
zT0+cr&0@5%@<GdoTj0OXcsE~ggi(+jb&s8dW2pbN4<$^Gx=^{#@~x1$Wdel=xJ1Fw
zVDuL($LurJw30WQ=Qk;71oH+z{rBv@5H~5DI`5^pkk^uORl1x)yr84)%J<}T=Gro=
zv!zGEr{dgIO-Bh*pCIt<W+dV^=dn1A606#>FmxW6@WZ~GV$#5&({A7Ts+SlaEI_^m
zg8uP($={5L?VV=0Pyl8nZ<S`0-c)krbwn)n*wJ=LF0SbAh7L83Jn5NfV{KtfsJUj>
zoy5NiAS{T1eW1Rg%szXt0gO6PyIeY}^EfMQcdH?TU44D?XP>@2w;r5*<HFBaMR>uX
zN9C=>67S*s$r@3y9XZ{+I8}&c47_&uM=PJ%)dP*CDV!(OD8)R-W}69x#BDXOKk%TK
zht=Q4sm2=1Z@lSm$Psy%zOOkfk<+&y)e?ve$b9h4)fVZ}Wru<a<3cApI(U_s;KVs8
z9PiG%<4D-W`pjkl)6<5bk<Q(z0nfVw;ok9jC2?ON*{@a)ikBu+oHky-$HVCHZli4^
zKp$sG76Y?7Yops%2R07qp0Kv_&v4>CxOhhk`=7<NR;hFa_;HM#k(5O01#nnl-SIl&
z@aBYo9?pspXt=s6n*c~{Qt#1C7r79?*AI5jY{yU?QhKBI{=1LBF~Cy)5A;VKkl~N6
zTRM3S#Cuau5qltvYdiw362%v$c;rZs%Asx`<a!|hrm31t0Po?z%x)q2RY$lGnB?K6
zSQOaw$1d!$^UIV~;M}%*nUnO*geSVDk}(xNQ?SS@Yohm{Hh1E8Y4K`d(X@#Q_INI^
z(*hZy3fP^scc6E#%D)B9dtCHp725F8OAs1EfZt9Va<Y8nUE1lqTV%oCZp4I$;VPZe
zlcZr9sVs2>e-V564;I?LjE?xQrk-;21Hm`1eRH5>9rY!}wzeC99AE6f8~y3-pUkHT
zpsjKjgDKO#H9&Qt#GkF;M7@0IrFIIZx_>3<5rKJcgH^uj*JAM`g0@NQ2~Jk8aivgu
z5y36EU2g2}Ue@Gh-mo_Yn#@@Llqi?U2yft4_x(LngZ-cq;xg{BGGTj(uqz23vki?M
z7{K}eB8ovf^%qCRwhuBs3LxR3Gd?S0e8oD@ubAxS?bfE^1hO7+Op4`oCYU;Iqywnu
z7DEPK&w_nE#`t1g`F)mWrupEN5+eGg$n_X4jS<J-sE@8i39{P8kaTo}{q%*(%8)T|
zGjy>NiOxncH)fak6^>D41U!z&n8(ZS<O&-N02x2mv$sDK-ClF`=WcP^72kaaSRq#V
z8jsKN!vs3%d;+A$F_yl2oFj@CX!$czFz!U4$thcI&$HAeOI_;EX+J_c9538BJ3h(f
z!VF!xr{Rl8qPaOTk#y9QOx}6fqF@>Yk;t;8knZ=^8Fjnpdm#0g){0>01|>(EBVhat
z$ZthgP?FgQ-T%ogfKYsLa%F8-ipGBZH`i#tSI)@hCtB4k&7~ZR;rDM|eNA1HwJ?i1
zh7M=Soej`TIG4TK=gA~h8hbN`v9G*|wjS_Eb1Ev|4zw1Eso#5Vod5Y67nF8s1lOje
zH*Fn=i*8}DCUIGb!?Bdbfa@$YREg+}q`3d;)AAUA6+BWJ#s1)gc?9?$q#}eV>Y{5&
z&c{%=<0p_OUNZte>D1NgZd1IlK&eF;Pw~cItD8UsK8(>Caz{$>1)HZG&Q~_VvS&C&
zvio9CvBu(3V#}1T9h+<68Diy!ZPS~}7pIs%-A-_@hqfng9ohyP!9c=YI@b41ptBv>
zJS{R;MUZx-jT41#`TO1ccZyIZ2ufr>MzxS8pFMB0mTQfvI*rMIeAA^9A}saKB>Zm<
zki?!J(aPpNaBc&{rtrQjqPd+0tYS8_e|Z864c*Y&BD`fo|8xmtITnd-6}0=xIzzhM
zPklbj3vwdIj6!fH#;0GsPx8$5(*Xl!pH;3AJtk%il>?}C$fKv9s+Dws>3ZiqZ`j>O
zWLS<jl57<%q(94YAo}n;$PX*TyD%($u*`nUV;ZGFel;No)FSZw2NYQB>+9Q6OT7Zd
zKJtUmpVMOZ^(RRv3miQg?poE9Yv;HBZ3eQz9pXC`_`cx)`#E=@F*XZBe)(`LX6*u)
z5%yB8weM|p@5bQI-@s=m$}kZyxMhU40Q{cXe-5W)-v=lTY3sTAz6#zPI(Fu4c-7Sc
zH(K2vN3?B#d*$M{a=HDZRj~W!EQcun8zWYQPzPu%G08Y$1=L|wuo&<sA3+!ldl@Fb
zgae#3@A!h*#381cHyRJ<wIC*B>pP`)m5r3EVT(R<6NM}(Iw99gmt;WcrFdPoz^!ue
z)3Kd6Jc}GhH5-;&J!OgMmx8@pMk=`@i0uOs3V+|8u@^9wB_<xHIo$=d9HK7S%9pI!
z>8ba0Z|KhFUMpZ(mZQrlq$8lTN6u;_%MqAWQGN=X;h+dQ!JEvFT%*7d*NPIg`G60{
z>Hg+E_IVL>pu-LDRu;cM7AP4jtITU<z8%}nvu|#Ey1Ol9II0|bBmXn>Fab$AJr<`r
zr9b_)Bhd%^_PE!-V`Jb3T*vyy5}me=Trv_WugKmASkYv@MTF2|nd#)iFQ0xM8qTdl
zM_(#?2AO+7EU|E-1M4fmSPU4XU`!0233*L-hCF+!3`5YN>?64SZciF)aeXJNQ_%a)
z!sTPZ)tw+cV{4)o74h^jpPhU#jOJpUXCEnscoa?rN6S*U`QTlx=S7hxe2*J_G+xqo
z2onXfoDzhOp<eE>d^ZJ#J;II^ald_oBa(VQHk>wn@W6N3N8W^>Xf-b+WQ=f0+LeT|
zm+OR-RMycS^sXnLjNTswTiL*b(h9ypw4p2*k0Rhh=pdlsB2P?3z_Kahs6@RXLofm1
zkS+iUXGkkpEu`}hQ%O7+18LG`SEcvk0&Ms)*&Y}`3Kwd)_Nf=*@f5#iHvS#!pweRc
zUyR&e`8FY3&M+dU?1~KC_MaDq+eD#a&b>n(my=E{k@L<`AkxMXzNz{j4dznS{)Vhy
zCx)m)6S(Y7rsgxgwc8y`6T^bhx$Wh_%w=R^K)ySR`zlS2!@&>be-*s0zkH8ZVyvf-
z7K`>igOM1<0*LWbY`4OC_9df7O&Mc*MfwtZ^s0T*@HujTf3$qAYdleNW^(Kh#IQ~?
zw*UC5>n{ZM^{pHrg_HR6Tf=AE-z3%CMJQlaoLV@>o^A_t?vI%Qql%wY@KI@EpBb<c
zh1oj}X{4sx9fV)y!9I}<o=NUi_n~Q#$~*21Yq1ZqV$g(B+tx)+;Md&=&+cB1!s>Ne
ziNS3q?tefyW{0f9VhAxVDq`{^J9wwRIW%x}&(pLRsJ`SajwAaaSH9emU~M09yOk!N
zC1#`OWHo?b+|8`qZ#`5HNpZq~iK|ninnp((gb0$L*h=ynd|xwX2sze+vVL)%^CKki
zF_S6x;9sn8AC@p|H-$>en~J&>#wSD*x<cn5Nq%~}h=z0~mVTm}Qm}^aBMJq-LR|jE
ztI3S9RZUS7zi4T@6cBo3eRx%f8HA6jm@?5s{^*u9=F+dGMn-DYMddaH0Yn*4pxCcH
z1JC0m^ce>*(ZK7$J%Sp_a1GL6)=Cs|??W+O$nS|ozAAk8;KnElOYRkZ<r(h?I&>1?
zlew}SkTtGH*i~HNpLD31R-F28JVA=SM=SVdr<J(w08Yg+^CE$DnH{QdX(6wM<$fFL
zjlm)A`rom3*b}ZZ{r9I}yYNYH+YEdM!#mm_8nGNh@t(Bu3lt%9(m;oR1<iIW7_J=i
z45I|!1(p4CtC*>tAbTB4j&lJ|hc6y280D<(R9yO7I8G|OC2d5}ct<pOMfckK&s+rB
zh~;|6=%Hb4kp`C0Fmc{ifyoRT@a*GTzTf8`^G+T<y&(Bs_p<R4mBJlg5DX#qWm$Wc
zUewGHaoi4suQiPJqquv}%*%Bk0Da?J?*KY2QS77~#a8&hhh1L&$>^Z4Yi!(ku_FtE
z%*D~CF%8oFQ8-$=HDU2N^jBnfcBS|r;hS%1V;eAxe&YM&OgX!G4<Koat)gfI<pt^j
zpDgta6d5?Pp2DSAUw^7xNyq_)9t4-n)gw*k%Exg=cm!I5YYSX`k1DoHy7ipG(Y6}6
zKxs-=?g-FQ>xR!yT4g^8QCd8Luu^35@O!D&c5K$J9U?a6Z7cXi{-(HFsrYTiBR*$j
zna2vu7QxiY^bH{t2AV{$T3Id$TucR4?V(PC#pA;nSgcrTc3##5VF=jqKA()?r!uu=
zraKR{v_xm9eVxpqlVVJpf6P@F-}&%Nyb$vY;eVu!wLP&-H+BuP^Z-t^+6lu_FxPBW
z^^lRYSHKmeD(N%XTBry^O`#vHKKL(g3)}&piKKlK0}T$o_%HUeo|H&sMuFxt7!eo@
z1HFJWtss_}<%HyO%iY<ec-g>lh8~<_P*I94{7aG2*W~?%1RAhO!X9G#J`tvoOqksU
z;7+TZb#UU2G=nze<IKVzamsMHCtco;$YOa(Fx3D&yq-y0mPT6WU5)R&ufIl+NlP6h
zmDb^#CqDxuCukNXFr0T&`;;hw0F(7wNr!sF$?Y7Hk7s?7L-M!Q1+f%3GwGzU`4<RH
zGt9@!L*dSw7H6SsYtB%WsIq%P8O#U}`q#Z_pr=X?E?PR*VY)$VxK@mqq^B);7(wRq
zv=&Njh;`X&S=Fa(Y)Gpqq9j{m;6ep-9c6~{N*~GkgXV;U1Ctp{594vk4L-ij>PlnI
zzZY<(ye$wnB;QDG%sBYf(N6H0omzDbLNqWSeyH8_NYu_Ljp{Efu%FPVZII8j8gQYB
zQbu`yx)pd|B>~U=85WwPq&~z!e;{Vf^e_LI9j7<0BsM?y^cCg&?`7+lu@)SE0T;~N
z?8OHbt4HgvGlXv4$dxp%n0n-BN`*ZOhAjswdQ&T>S<a0Qk`47a;93Qtc3Nk>v2)B1
zp3FTRNOy*CAq<N!Z($|a%!IeZ^6s`|G5p|@IZUtkZV&5h8vO`_0uGBr-&Z2IJT0bK
zWrTL!$QfJ|L@bWFqlCNJEW=b*xO!inIcO-y6whUX(7f&-@zq_Wd@w;+`diG)0~uoi
z9kt``d)RsDa|XSW!+;lI<E^+E>Mh59Z9JlJSg5#@&8~AijYj;%+&84RMh9#Rku-8#
zA1lM!Ss%n6IrYA+-cbMgdN~(w91|Qc;xTs7OkIS{O#VI)z^_$6I@nZx8Je5>Ajv{C
z*`mxG8I*=B;NIKz_*&tcd3(AdA%f%sBgC~m^>XA7j`c?VV{>YKRfg{T9MF{YkLpP8
z!EsUz4?^1EMQ!rl4w}W-rM6>EEiTfu`5uY0)WXBW_U1lZMI&E293s>B<*2243Rmlq
z*>W*kg_>&9mTt?%IG?Q&;cOD)S*1hsmcAD8nP>h_$hw7Zi)%<uqX~kMfw%w?CRus*
z-x00elrO{Wa2~ie755dp`zZf1@mCQ?A_8!CMPJg@BcI#>_o94?=X7800+!_Uv+HJ#
zXdyz;ec7@x^aLT-ftB)wg~DG3kE7X|{y_i2MmrN!AO`+s)oIQwvw({kCNKJahIR@p
z08gaz(?&hGuX<8Vnn2RVaG4nC0wU_R9DMbl{S*f1gqp&#LIyd$ks}`g{^I^&KM0)V
z|GB059C>sO%wbiujEU>X0GYUI6BfqxzE(CT3v%#I{vq##e|tHfn1$Ol*^%@51?6bi
z@2emNF{_j}=2DiM<k*KL+zaQLHqWa7hw+E##;%DjAO!u1^_>^bd~c}r$Nhxk@)PF(
zc)u`j0ekXaNh&dNxq;0ahnj^3phrqR;S})06TUy8CIOXegy4QE;y7~UP2s-uBCdQ_
zCHl%TnzBB)isHo?xCg%gIyS45Y#UlIC+#|39$D#6M_ai<Ya9*>++SgT`+lx=%kH4V
zoX>On7l<N2IvxA>_`?e6$B%Noet+9rdK_GHkV<R+4ljGdy96xk*QfSpc9FiUC33tl
zyDbS-A7N+-vUpr%cavy4+?P@@?5AE`%|V<Z24Qj{aKt*e=uuGd)N$MrLcweR=WoT%
zlRnYUXzhWiyVuJaOhmQgvR2#Q>WgohMJ$J7r3`PT9Q2m_-)bUS*COX<v6+?{Ricv9
z@hgY0msw-Fg91H}tg>fHFFRb}hokgOLFm}I)|_P}8*-@ugcl(QqkUXz4}WBIj#)Vc
zlFvy8NQ()6Ay9rj^%84i8z)*|-JJi^C7bXP=)3G5Dq}X-9UtL#W%2#Qhi)DB2*oA_
zA<1crzI~ycQJ)+`;zs&alo)WtM$*RcjyNo2u9aX5Hd?6+p&$nvNQkWmCP{yElC`sZ
zIsXECZf&)S*mj6vkJgtv1spsIWozz~{2Az;aD(WO5qr!jT|Ku|(f=;JA*xuntyK8l
z#VNqrV=VRz&?k)*!8iTMRxZQV6F25e=QN1EK{i!J>X*qSS>BXZ=jvgOBtPyX;gD@R
z%_pZ8$mOLEmU*K#8dsavS;U)O6Y(iXp=N0Ibbeniieye_u2#Lo64QlsTqE4b;aDg_
z{gU=Kb%@mHb+xG=C?4t#$REq!{BS~Ufb1Q*9pgrd!()av%u0_bKuX;sdXba}h(tob
zlh(mnWvbup;a3IrF)MeFCI+(qXnH0{p?gYm>M*i&mUFW2oo!KpVNgxoH*r5Y3rE7o
zD~Vv72ALT-tnXyU8{^;_qK&Xtbj%ZyAPzsDcnm43?dY1W5|{!-M?Q$$es4)J^#~SE
z@?voTN_%&KJh2|oA7y4tFikT3QZh{1lF_Nd-3W!jT4l*6@rD7j5y37QMw=N#(wT=A
zR{G%Q;3@`w4w_!1{{`2!m#72c*rbwzb}gz7`BjU|ol&xr9MC`}lEVld6jwSsDIcu$
zgG0y?o=&6_8AuL^M5J2uTaIWr>OKR&W+O$ZnQ#k?!jB%dqj~m;#WJHpL9XnWH2)j!
z7k1sn)Zs;qp^KhI+EN|nuI0&^RXF_sE*0uNNra%UlumLwYqwL2Vlk!De@WdC)(|^c
z;02Qa&5>X6&@5YdAd}q`vV726Ash?j2Wd@ur20G^7=ja31GrUagT19Tbu_q?@6zq0
zAveVHk!TE#%;*9)vTl9!5ER!<9SQ}G?Vr?6ROT@nwX08vUDO=?@vZ*&Gi`~ch$38B
z{2bFRESk4utz6g?HB4P^6qP>QvW9)0?<c2-_vIfhNxvTW{X)@VyxPaNIRJ24IWvpM
zJr)Oi+hQOiQ0-Pw;n-EArpWeJ)fZ^-1Fn71V9&xG(y2`|-<J+y?k=Xy%&)Q+^Q#@m
zF!YA^S&v&%ia3>jXb8ApscquiY}{2^ZXpr@OET-Jf&nZ3remBWZBI*qFc+*g0CGYB
z6&TYC)*W@&ZQ?pd6MzY`sYrAjw}3<g(XoSDkO^}Rofv6p!!pajChkksl^gE@jZb5Q
z{Is*#P{`xY)b6w~?Tsr)=voHV?80Il`B$6AnYj=er7sXd2dn%SJg=pc<aN1T_z{x_
z3Z!}=)8LYGr^9c)eR^q{IRn0#B$2Wz+nLm-$a7*S7ASYn6%71Y^HWAf5Fo_iB0K;V
z?ZjI$WJiXHiNS_|syFS)LPb3_;_K$G_sku3ORHUAB#9ujAAD)cODlf#7ibL?=w|J|
zY{zBuauU`9N~Op<1wJcMirO8dQqw3AUz5YonZo_Q(14~b)ux*&8>ux6B{jrfT1n#`
z#6cGU?$xvem(XpslnY||cvPfKj!`WFRK-3G%TSgGnP7UNt!@OUPhSU9(t9JLAh{Jj
z?~XG3Dsm@3{bdw?ybfYql7`We&~N#ASl-th`KU6jO6`mGY(?_s@7=_7=C$-^NEG=h
zd(l2Q|NkmQ5&z3_l>VnzPO*HH`X$aR3|9olH||lq9)SB`-w5eRZs$_E?4O2ywKA+U
z9Aa(O|EBmD4msh(20`Eok`}y+Fkedt3GKEX_7l`760zKE{Ah-Ns}378RX0NWnWFmj
zDBH($>E6>kcl!CelndqfZ@W-F;WH-5kmFFs22s`A*~)ltuJe}m9lM;FWv~6Ox!ge=
zKF~`Y=D-zJ1t(Gv1ofo1>C#xM9T(%&@ZZf&&(6DL<Z#Fq1yEvd<^|1=5o4+_N2&EU
z42G^k<&>l~ZBSp$1%9oG3NS=8W5AW2$m&}R#_V45jOb#?Z__GS$SB7eRr%lgrp^)Q
zFB7(p6reu!Cyo%A6Q6v(J*m8^5lJXr<zgF31G!qmKA?7|xx~7wU^}cZncyoQ@<XgO
z3n`c+f|Zaw1$WKT7`zxbXdwZv@>k*~RW5&f-oK5t<|bvpVkJSl&+8Xm+jfF?iWo!a
zn7*<By9?DYDc_KZ0TgCQd~d-5z$7BL|AYjFNEV+2h(qyfqSp)6kfTPD1lFzo>`xEu
zVN+!GWg1u1cbsIIG?=%D9CH?lAD);`87QAjJ0!GsGic3~B77JL);|mIMt$1novWSX
zsw3ft=eTWqi@xePvkO6*iHhq9URu;-T4ctA5$qr)NCBceSCAJbAJEAaHlVtac<z`8
za@_h}SE2A3l&uQ|<%QWMTWe5}%R<a8<DOU2&q9)#9g;ZCO)X*FqqCLW#$DFo2ORI)
z367%G@rIpNj@=#1L~nEjF9#j68huRDhtGQW{Y2As1@B?}z7E`4jWN?mO9K);PZU^C
zL&^K>ZYO8&H@g>wavg02dIus#!Jr7~&5+I_Q+6x*IWgOSvc-tVUsDH~N*#Y^kggFR
znu%bRows!P1n$G|^YRR>JURq#9R4l3dRTLn0dcSE5k!I@nGv%gylej&lWI&X*I1MX
zY0z}%SZ-W_RuCZiPd@4>aueP)mt#!MO0lRhoEebPq~VYM`vn|SXQQ=Ly1j)3wutXw
z50xYe7-L+oB1&6UaLO-vEw_S@?*Z5zW7$J)mGj{kejye%xV^Ncd6%ll{X3`GfzcJ&
zqS7!?EF*P&%1gA^GX>KCvO(%w`@Bu=!uuk~<yPN@Z7@1tsD%t!Fr}MA9*S$mi_|~Y
zK6zzGVhnaJI%4KYo~t%7uLtLm?(eerko*w{WkZ9`=jBkw2=gL6i+LQXrhy?ez5<PO
zFaz3VGNP<H(akZK^}?jBC2h!MnmHucOC5ovjqHJY4J{ZVu0;Y_Rp+jT3<EEUc+2LC
z^g(=)kQ9``1#@+OrdqcJ?!@Mx9F*b3PMa|ba^(RB^i646lLwR$c%tXJ`r4ZVnfE75
z9jPtp`1_dGtu6t^xv>u!LRC7A2$bnXP)SSVU^hr_&&+3LpgoYlootTP*sm(`e4?pd
zb$>TwAU>+@Zo}t~Y5)G%6F#yGbqIdzl@t=ILxx^U{xGzPSfr&D+orJ$A<O(Xka&W9
zA~M#Xpzgz*O)ek#2ElMU3E0UO+=m?&#6(654_1nQzhFSKkcQ%g74+<_&G&(%iI}<#
zq0@K0hF#63*M1)iK<}dW#Yd0d;1K!7Fgq$89OJC^!b56rJ!=oN$L}+I2L?EZ_A}?S
z8{ft=S7-gTYJ;U=_64VU_zTScPF*MzSDY2!ISczJpUXNTy*#>|L&B$4w@1@B3Jdf7
z_NkeBgl?Zol{POu%~Y~yln#2ifR)F{aKAo^-Op4xhxfFPtGASJq|bHO(N;Z?+vJ<5
zIO4!RZ@_FBFXZ-NF3=RyT3dc9<!*>y)L%?S+n*n*8EZ9FgePl@F?URSnDb|Bkgo1e
zVy%s~bYxU7JZ@q*Kt_8v#n=X4o}!kB&W5KO($#vf>-3Z@5d`l8UzvyBjSo)+zFIA~
z-*T3zv;iZFNSbGPK#jZ3nJ6J)eD~^AL0)=!K#cqDK>}}@fVq<?gfi>wB#_`0-wO9V
zp=r*_o+aO0OKDC0hyoGr0db{h{mX}9C{DJM2<PoMh#z$<NB5lP;{CrJ0scQ=x%Kb)
zVsOvI{&O9eWrm0rrfHT}!nf)NP>s#O+-+^_2j~tyaFU_}7qMiT<1Ch~>2-|!v`||D
z50qQY)s5$Ta7(b#Hs@!TmlzOnif6hL-%&*ZAN2*(6;4ZF6k5;Ey>%uIZFvMTVXEZ@
z1(dmS8a)uoZ%)X#?L{R>H<O%JAp?P`p2!$Vpp2oFd5?g>J)h3dJ}8H?4t>6)TItir
z)1<1qxjy?XHelVu*W*dNPME$;u{|eZ@47SPU^gKF$hs|8RC@ScSxnRO`2r%mRjsbi
z%WW3Z!<T_x(!^3*1g%T=6Ljo|4Neo=Zjl)wh_(-6hdbS;d%s`92ArgPAw_O`?VT``
zN!G%>M(}e<dbw@0&rvFZond~f;sH%;&jjJtCV?0FRO*GGi0`0a>U*G3T8(dXM2O87
z4Q-IRHdLxw?-K$WJZWaUQbaKcf+~gS^NAZNX4ts5O6vQP{OaR(M7tY&4|_%uRQ~l@
zS!=mz0@xdHOI;E)8=PnlgG4MkIAY6ZXFx0KwMbd`a((+t>Sw&~Thd3v0c3?deV=R6
z$c#P@w#N;|7MJOAr99I}b#h@OD=ox6)s?-+c0B<N|D#WtW@n6VjEweAr9weL&n_Xt
zo3W)oY0$mMAqI`iSE}`gOP}r{d$CsDg<G{0LiJQ};Q$ST_T__rtD<FEW;uQYFSv=M
z3fr5R2ifoTM(N|-L4yP$8K5HGMpZ5D*IV;FQ(+5_%3^yex}4}7S{ZQ!ddL2`9c4`7
z_w&^(s}KOHA>cIZqaA#<GN^sfIR~H^wyzG>Gt1u?cZrhw8h!<`9jtTJ8kw)Wbe$#T
zFV`~<vpF``WFlR-(evphAu$=94y@XzNEA3rH8IUQ?2lwIOS3sP<trr<ozKYyqO58d
zK<ct=I0VOUQX~ELWfW{fuMVidxolM7m+~+fdTw9I9zPD6y0#z))F0M>=)aaPjX>P;
zYVpN%I4Xb4>u^6&WVqVj2btrQ5c1EGyp4P(QwwDIug8=W9;{;uGW>ys_4!#-<RVrh
z8|R&`>OdYL7N5G3rw~@a<-dNTP3ousaWEfkzgI?MJhsYz<Bj0sZNbve0~km;w|X+0
z*uqo_*lKW`lK7sG8Pb!1RqhIat}?Kjg|@@ghzr$!!G3vYvCGP2qu$|2JHP)DOoMjY
zDr1jdJ3YFUT%c0Ml3z8p?Tc1nR;6LrM6oK#Vn81M_`dYiQfC4ZlX`x{czK!Yl&%=I
zr$#OxXdh}}rz*K>T@~K8Ry#g4t|#aqi!5&*v8S)K53nqoBZF+B5Yb&!aF}J)5G5XF
zyQHi-dNu#$Rr4=(ctDkcb@M7-{<j`W(>C|7{+e=1-5wEYksn%BjXjU86mj)?s$RSV
zb@0F1ygHC~t!4Y1{8*1EoXAt-*YULN4y#o=j<b5OYyta~2F_4UshK##Fn1X_;0VL?
zMI~fZMR@t6yq8z06+WfSYXsRoMUxe7keQkm6JyxzK8ip+Q8R#5P|wOBODVeqvwbhD
zG&o=2nHBO!iW&9`IAqupM*Gix@!W{vKLv-2CQsUMBToMm`tui!#V$5-hxUG}fMa|C
zO~F7?Ea^o~fP*%8r2@6Hlq<+Mw2PcKYaRg?A0wBeX{LI3-}op-p`eIPOZb(r$36`M
z0o$#TCI2X!ri)iRERq`S0)OaJEDT1I<JIbnjJ{fN7ssPSa;tRbc|948(x?76itY;#
z!WX53i=syE1YClzMrOB@1mrx4{>*tB6wM_kw{IWzU-CQdMdPsM!CG46B)4z&Sx{-P
zv=zRPCs87z!8=&&pPITJ{&gRMAb#9RW*^2+0@7X(`*i*S%yC_J;yO^26#0?&?`9+W
z`6$jk6Zd<t;0{e`dpZ-PDZwC2w!U`)RF;grZl3I-0{RL2qIe<VvOy9H*3t|ox!vH^
z6XS#Egd-kqes@YGx=Ei=^hJMPx?u<Z{Rmkj{G11^&RI2JT>?WM5l<~-salY{U!`g!
zk$ak8mL}Zpj4S$^6`j#!y2=+UkAH6AOXDp6-=hY;qXiryJRC^DX{8ee6u>D`3f$4A
zR1nF?AaZEKS3ZL<G6%}>PhsqB#eK7R*#6G835uU-c-iN1Tm(@n%Ae#&wDqkJbzk76
zfLKcvul_yK)&3>4C|?097MM0gyRi3s@Ugg~RnrSDAUdevJD<NvaE<x-8#%1{n^^y-
z`j827to$<`R`FxaJ<@Q&{0S?Z*fD>=b9>t%l3dRM0zCzKLr*CmdCR8FkQ5bv>Cp$_
zJ>&lQYoE<KBS9cXmiE}1p_#(odUi|)pwF92(`XCU&|Jan0)1f859V(nO#8)Tl2NGb
zb;J(U)N5EnlofK+3<lE?%wKxDwa-jJm_%>#Q(sBRn6b{$vnD7j!e`FI+fVd`zO~7h
zI2iBFBqPVNzE$;iyeKy8)I70HrO-R|ReAX?k66tbq6C(}O&ujdtEfn0k-7!mij8b;
z%zdjkugLreeS&4xT#+Kn0zwpr*=J$(3*Xc{A&UZ16po?@9yT3<!VTUwmthjHiiwgH
z4$#wehNvDh3if|+eF*7c;@y`lQigU-dtM~UjDis-)f8P8#h%{Ewd^JO#=TGpjo6;J
z-{*vl|BbKDQW8ZF=8kw3&kcsxf@-a1TE63|CRI7|!gD?CTT7umhuZp$F^h0gv82pn
zCrA~w6OwfdO>MCU`TJJF>xzuv0}M0rDWb9?1De1B!K_p`57S@1v>uaMr={!1bx-&V
zCws+_U&AorW*X9{d+atrG<uns?4fNM37`86+@N@dqu!|%9fOfXA!~F{9yRW8!?WuX
zSN?(@8#W#I<I1a%1m3;4teZK!-^<XS%??%sv>4@2Xy)zi^*6ly7|?sI`SuHpVtFYB
zQ=Io(U6{bxu*RBmi`C_mp&@!yczK!=s%7h9m?oyiw8jP&h1><_pTE2|!u*|OswSJ+
zeO)7>#TZH%M4hWDuMU-E(Gtp@Xn&CjTL8c9593Ah$*<jh@aNIOT|(40*ZJHH+@%BK
zaO*!3iVa0VXy^sv>jT-dXyhvV%MB(cS<Ee6p+w*S(<#^@iU0Ar)=*0#Il9po)RaAL
zjb8BMJ%~}Hwf(#65jRGk2TpZ`P5#94Bb`80>mC&g_O~YN%HR)A!2q%@DR51^*nIAJ
z4~ott2qgnkNY_C@IK#WxuXe1W(umg-o$?Qv)bt5MOb^S|MoB1c=XoMvgnZ9Y<o=Q{
zfk-`BRdaY@LYTyF<b2oQiMCIG|Epn9!i2OcNY@0hl)jDeZuyFHRD~UCP5>_U+2T)l
zlRN!Z8xx((_BtqTGS7<XSs@PL%0W(6)emE*RuTg2x%eyWzX=`!c0HM=O30Ltjb{;H
ze<M|1Y#>UpFy^(@`@q%w;cuPYvL$!_^iKPu==IgdXk@O!DvtVmJ>v~mZnjbN2#EsO
z>l450v-HdhG$?xIHYTnmVFPmjTf}r^A0-P`_X;+F-Ajht-S6%W8s8dkWLHg>-Gj0g
zg-1Qq2H8L#`<f=0HJ@J-L^qV<j>V3FiZ3cr4sJbJ$%k^`d?jF%jlbi+_*&bMWK!rr
ztt4zA@P<$|IxrTHF>KP<KNZpaMdK4C|7BbJ;ZOJM2w7xrx2dgHkr{?FGavf8_rJug
zKaIrA*yvuAKgz%4E^yB-s=?YJBe2wJ{TM1Iq2_?Uu)RIP*9aO6*-vV0WFV6cdR-A{
zg$c#^L2Nnqv!@mZ_Wypv1gLIXm?p~~Q6dZeMo^Tx2!otci^`*$l2_yosg1Ooevp4w
zkE}PFkBg*o0)|aKQ)E!7z9G`49-F9XgrWp4-p}ATu_Y>m40K9cTAJt-G?FAbT?2W;
z^=$$%4hF<f<;WH~$3LBX{hyA;Bo}Vm+JDI&KovqVtTwt^HTlAWI-uv#>dTRv`?(Kd
z5P2c=<r#j&c`8*;sXYY-(+{E)brd;C4e<Sx1m8grISiFv?iWoXJ@b(_eWtd}nPLY)
zwI6Gn)<IM~W%k6n><Fp;OJtQ&?^~z+X%;Z5epCRTop7_(!Zk{fa`5M~&D4Y3=$Fs+
zKgBRi@#8B*ip5wa<b&c_mADW70G`2lj9MyiLqs!`^xS_Pbbt3Oubi13x_1-I?DFY8
z*6*hx1DBO#-HjDcJ#CK9D+_01?J@&0j5FQ^Y@|@H7P-db3zB<2i}f4YObqAj{+scz
zJ0iGny;}22NF6X081@p6kNp}Bo&RX$mMPu~`L+TR@o!aZw|CKz_4gBH!vixhmy=Sg
z_Up*7tv);AWq~nNa9R{xHbtHhw)rH~L&NeF-M5z=f+AymLmw8{0y=!V6L+_k`|PM3
z9S?#yp5cn!Rl69ylE>bFBG@zA=m&hb8FKZPN^V-tx;rky>*9#QwNRGdrRm+pupu_l
z2lzThzo&UWSTU@wB}uF@ttv&_l<OZbKU#4p{@w*B+fVBS|2^I28;be;%`}|@wd7%w
zFtcFmFKKZDhps-fELgM=Oa27BFhFCsYBPV>W_-9gI=z&6zrde1C$^RRp-3Z4?6Xd(
zV+&yvSX_C+9b%Fm+SG%qTC5(36*S}aI2YHH4;P9!T-7nHEi3D&>FJpT`pLr_)t=lO
z!Pxw90uCWkO#gdBG38tR1&i>N-`QHG(xwPVi(ep3JWKjJDwnc}L5j2#$Wn~c)Cw<r
z*Z4dCIMx?rUbc_NYVDbB?yreR(v6%^tTo1V8iu(!+fxs&X1B&f3>wTU7Y*wb+rvCq
zkmE1Xd*P=@pIfy=H}9?-@Ie9)iU`Nmmv6r`eX;trifjd!@)ae?l9*JoJ&~>R>8X_D
zxV4Mp&rH)vpwmC<*SR7_9guV4R?9;=5rTx9^RnNL@-kWRV5U#TZ6mnn;H*j74Q;4;
zmnx`ic7rJcbBrZmiA;j$V;@#pt1?1FqDV=Q-wHFfMncatEp5aAbCP^g$p43=bBvCx
z>$Y%gR*a5q+eybxcWm3XZL?$BPRF)wqhssV``w>spItSoYK+=vVXkLZix<W8BurYI
zW>ExK3{apk(oKCesRFdbb5;;x6|>5{?Adbr#iXD#ns^%U0C^nXUFX$#q|T)grhX_x
zt+rLtyN`X<RZ2fC>uWP1AeifSoG;fxh0tadDuX(SL9GUies7PfhXrxE{MAZyapxqn
zw>hlujSuavzO$nA$UF(6@tqj;`3`Eg6IA*90yjgs1m+R+69NCtLqwu3ZUe!*6W(Mm
zTnUIb!ko%NO87beyz=l9WOTQYZ;@rY0ZKQqL^+(E(>V$HDxB)S;S{~bInE^@TvLh~
zYe+I|0TiS|!+|9vJ+_d2TCULLQ4}CYMdqSKoPv`yvx3XeifHL9H0$9zcrD&cx~bG@
zCkklsEO6`L<oaTQr%5*8pSq}B-35Q-T7jCQsBFfS&9n|Zv^thMYbf3|S$rIu+A0;f
zyz$Y7e2#P3=iD#hc*0KDT`X!2OoZ)D#vW}I4qJH;!3^;z5yP_}f-5*xcF=c<Ktv@&
zi|2f_0;@bSq1;K9C{>T!%z0=+&d|7;vIQ4K)o#QNEG!8|U>H4}4$EPF33tak`@F(Q
z9q>XjR8sL=Bgr`PPguH_KSLa+`z%W(>xq0LW~-3#&DjcP`j=DwWDJe^9K>uEHir)P
z_Oi~d2*(t&97y+QT|U|%L-Nl^V##)9Z^seN0jOpo25kQL9~_%nav)uHo-vFCb&sWz
z4@*-s|Cw|h5upSDGYCU?=W9P^4=Y3KG>W4U1=+gP03=pTe>c|7V=z6pFY-DsFUMoJ
zQ+cx<POUz^ZiK1HB{BF_d9y#%XvR>Z=H&R|+a*RmveDOf@-zjGf(-_cH^o+k=HO`q
zr=wXW&pjA7D;4^M>9IU<JgpYzToK)$7$bp&1^~E7n63T$h{9_BK1^7=C-4L4OHfl=
z8D{Q?Zkchynd5(G)Sv`EU3W|KC==YMGb}iiRJW;26>U=@7Fb<DgXvS1xNy$8X)a@0
zn+jJqqMO3zOZAb~uPo^e&NK{c+uFqUTIthQoopzb&1i|bGAssK1RDq1-m_cTxM91e
zMkjfFi~xXLHe9pj!rl#MS)*UBK?laz+8u)uN>w0)Hj_bmLGJ;72PN$iz(yM_qNQv5
z3vBRF{Qh;QgC4y8LjMbA(Hi*v*l=i!F7#)D<>hBt%2}AZD-#^HT|%wHYmE)}mO-FZ
zmH#a!C>|9OR`8k{Nj{}&ue)I4R9J)4m;=!L<}{_hlo==j*q2~~Ul0#UTT>6`a)$g{
z^9GL@s-aB*1#mzjCBEk~0v}L6rowheH6LaNu*`^ZJb57fa7T8V?A(w$JE$;m64(<Y
z_7#TYIrwB#fMG#i)At@yDc-1ut}Wp#j;nmS7c&?qchQvK^muj_VYd-h+I%t`l9jJm
z%<3;4zV}C*?grB@*Pen>%qRPm1Z{nJt7B?m^N{<#_3aWT^E6pbH;Sk;>#2{SMn;^@
zr^CwY3*(B5$e?anhX>ov)|%ggB0k|GCZsMcLgUe7s!2Ej?LCdOT6*^T?7;RV!#8&c
z9k57kN7Ic=E+t7Gw;Zpi?>BHFD*gU$<1BSb7PpLYxn-h$k+Dm!BuHtTNNIJ`g#AS8
zee>}RksL{8oM>jX96TS32&T(4l$bSNia1BVqXkQ?`&5N1Hi;oMnh{fN;7t2Oe>Yzb
zh22bMJHV&2K$GlG-%WpUr?wZIw>F;-f>OaC9#T~7q4L&d>Zi~c`VVDM`WbQqRXP(G
zxW-=!0UryrYlXs2-%&n)vT_a5X*NwviY3v--X16BiSgd(>xth+T&Xg;Goi`lZo>K*
z@aOW<q*>SYp<PBeu`>$ZGEO&dq2!KH&&#Y9eA=L{iu@d6QHIkS{9L;GiZFHQ1#CJ`
z>Hd!Cz<x`+#I~Hdb&2<IjKzyh7>^lkxuC>pbwV{;;%V=D=5{yyv!WAe9PXvb%*E$l
zh?#LgiBMpo151|}XnIcB3^}*ARjCUN1e|9b2DQDfrPVaH%gy0h?sf7A4aF#FzOZ8p
z`|iCP-=nJ;!WZ-0Z8%FT*?S`u4P%c|EEiXZ{*`;a&E(H~$w{)?MkDJwpS4Tc_r^08
z@eKBDmO+~5dDtj=u|ExANLsM6^8b_3f^@>Mbz=22L05?8?T*>y;@d)9X9-d{z!W;2
zV{vr;VXdOSq#Z41ExK(bpjA@2EtU|7H0~#KS{QSbq-B;fVFRbCgjHbWz4obS=}9rb
zj@0j<5DMZo0)>6=oOPMzfD*5m?#YwE)kw$qbnKV&C9&3=u80uSn{sDS1#Cs%)A2De
z=fMX9d&rM`-x4Rxa?ee;H~zXlL{R-C*?(35r2-s7*HW`R>~mDGZ{r@!4(ES<fkO(j
zHJkei-YzWvVjA6~$b4n?hywzJe)zD5*QSVUh=OE9Gh<>Gfmretiht8*>iOgN(-$h$
zG3aLszgH8E+T{s1D7*Feid{#kJI=C={HhDn*j|`|PdBx;+UV`JDO)x_joOv~U3O=g
zB7LjS8!QzrYjrq2%@XF|LB!nh#y=T$&Mfq|<X}N$E|d!Pwb8Q^Lfr-Xx^d17p{J14
z>@c^6V=FK67vjqrey}8%vcfZX`t&AJ79#p1+gP<AvCGSZW`fj{Ilx<hQNkXqe*boZ
zNezOhP<#e#)9oUV6rqc$P=jRIu%i#(*XtrZj3?bCroET^D`y+^rx?$GSK=`blLTe*
z;F!WcHIoX${ov91m&geAC|47@RKFoIIxzjbnPYc+V~y)+b0=TNAY;mO!vL9X=AHRp
zh(yW^1Kvj~>^=mXkaIQhg8~OEPqu~-#XFj}`b7$ceO+D;cE9VK9+X903r-)krJFuf
z!}Wo2amZK#GBaz1YIcj-UJ;Bz39{JPdHzAL6G`?vHrA*B{7cT+O3cm5?usbeuEx#j
z{N<J`WHEkei`psjXYrc00w3r5xV=q&Potu|EOr2K_;?i;AB*#of=@gD&NIOjdVl$;
z$KtspH5U<s?C00$twDjQu}gy>vag|5uV1#UX;>YQWmWCb%mJSfi!zEWuTQ3+o|a$A
ze$F{l=)~B~=NHScy9<}bN!wvf{?2NG_%U{dglhB6KxW@UQo?$B{n<+jJ&0oC^6^5_
z!m-qdtj3WoCP<lvc@niEdPQWdgG?K&H-5dBsOpr$fh$I9MF>SMdLE^j$^G4xfYU+M
z(j<@{N_!e@orzRhlcU?$SPy|jG+kAjpU>1CH9-|x+O`!e5c}#tfYrv5@N)7@acS|I
z-4LpJ$GG{2sZR$Qe>Y1*Eh)L#{Q9hFSh~VxV;D$6iH;=#CJ^gD-KTjpkcD#a3Vj~U
zR(F7%jL0zYXgc^5^(sGhFu|ERY)TJ{yYIqIv{HK~5H{1RnYolm#pwZ$$7a;Lp6FmR
zw{907r{^FSiJ)8LmQp{|p-+h&%URzS6u8$O(;rY3M&2hJ7=h@MS-Uldz_e9X*hGdc
zSy#^t)_+|<wGg~ACCL=5Zy1z_ze3t6pD-|r_~0=0Mb@M8TMtK9g6I7l@rhcXt5@71
z+Nx>l_OccJ976O43=jND1=aW?jqh$th|sMF+DTU1?Xtud+u5u2{2(+KYKZ!??%huj
zhB2!tWtTwLz$o9$I+~kqcqgXE4#_Cc%RK^-JKNa&)=bLUD5#jckH2etSRS6o-M~<R
zk=8!Y3n7BvY&BeMI}EQpZ_7W|b@0NP>j0VI;#6=u#!!h|SV%l(6$bN4p+u>>XF#B)
zGsGBV=3=4tV{H|)f=rrA*G5zZj~%k=dVGDLB9VxT)V$9juP<6MGvxD}pdwM9>)`Vf
zIIc(r?D~Z2O4T>#0F|uwn~cdd{qS6vSNgs2ZOthqL`WCGt$MpZY#+gnC$9vlH-8ZX
zGeEI`3d=J1PnVc2%wgcaMIT-Ph7Q3_-IwJ8O!`MX2d0`<HhcaW?ptuSX=b&=m`M+X
zJhs`NLq@;Z7~2<LNufy#u1^K}==GNEsB$u#CnHVJVt+$$*Xe>#&vYp%30?FvnHy)G
zZ9YN9-fiN2AVWI&^QBw-KxC-IiXoZl4#1jWrG8U;OD#4@{X!U}=v=*RlCZPi>N68!
zxXC@)2BD&Mqn+>cIR@ShzpkDqvi-3!SE9+tMg01eWYePLGe!!>+Ek(fD7xZnW1H#j
z>yB}tc<35_hw>mpW|*Sg*iCD-KF&~u4Q8jSW&7IcaEvSBSq(&R-oC<ruj^WVscYy{
z{fUi{d_;o@(%WVGT-U(=S$q3wrkpLn-uhrxHKJO604cn!`kR#%-cNj;RoUgz8M%oa
z1KnAGzLrB^(#f7DN}g+C)3#Km>F9Ad%mY(?1QO7_6BshSP5)kaIq3)-L7{Rleqk?R
z1s+n01XIwuWZt0Y34^8{=+MA&ZBqmbh8jqk(IIThnpz2u!)D5Ft|xy3{|RJx`)Y_v
zd3-k$j9BLFzMOZl{+_cLJ2}E1iM7LoZ(pbHYrmJ(bfeGNoYb=HabqBAku5*W@_EZ*
zS>2k;^Kf_Ao83jbmY01zDoCevG$M?|QV_6*k;@UEBwUKxt(5n@y`78SPd}|=FL>rR
zQ&PAj!Sxc6NMFt{1|-~Mc|$Y43s2?YU30!wa#H?fI&;aYkLXN1A+&h-(v~Rv8|A@Y
zbhGK*<_RA7$zQ}1v6bS&6&(hE_9H~Gyr6A@cQeMAR!?{kUmx9XNZc!AE%6w-aV%AO
z6Szo?uHGx8ZQ%N-B|}1Yt@6>xZP()>{SKKl?bT&d!&k}*dLtp2z|9_pP`LhLQQvYa
zVcf5WHM>v8XD40yi2IE|sAm9WK{d@ACk6sLtqHySlaAvmn#79PGAUuES!YTIt8bOA
zFG3+BJQL0%$xi;vvsmF9kgYdf0}>X166_--tnm3gvYbe_Mr?Wq+Tail8Tq-ci{1hS
zQqo9jP6}IeqT7^#IgQX2N<vEIL=O767=t56BE?0sOfXs>NjCeZgCdstMUmVN!@{dX
z-k;w^4qs?{3=&A2JC8Xk6x`(b7UkE$&s_3EY)beE&{x=sE=;VGJ`-ACTxG<T%j@RE
zf^JW?)^v4Tt6v@2%)d%f*j(WFF@}rrmah4NxrVu(>2EwW(U!m}qNIY}EBtQ(g2Kvo
zGkiT9@YFSRl5@5Y=Iopu`?n7+XVf~`XGW1NU=069n4McvjegZS>O&42=s5n5QU`q#
zT~Gmw$Kks<(ra+;wxtN7^5nb&cl*X1f0Nkg0TVDxS04mpMryT|I06sCu@FOWEHa^K
zaCOx{(u`gOd6|k`3T%Xlp|mPngk0Yy(tUMWE2V?v#A#eEUeJ7e)G%k+VD?>J$S@gu
zYXJ7Rk^|S*HAv+Ro0{^qHKETw^p6*R3KMNPZrf)!u%Dlb4&#EnKzRU_j0pCB(AQyX
zVDL(xQcK?F;TXV2DGwu}@_CQ55g7^bIKVEj@%`5Dbm7&xvb=(bb#$}32TJz(8PZi=
zt>b4;u?*vC!)ld)(NIFweaq>p9MnZ*K>0_rL1Z4im^0`Q1Q8H9X+#Fy8PEFjcFNp*
z<HQ)DB;Big431hQc_%tbgE;cS2c`5msu;N8b&Bb*5d1LCzO<21=C7?JT^>uf`zu~{
z_aB|t3b0U}s3>$F9HKX<)#KNehYOWj{g?o7keAzpy2{_Zb+nfDnK?5Ej;CRDJzJ>^
z#<I_br^|Sj?1BuRl9Q0Xh)OPW%c2(Okv71-qu0PBLDOrfdh7dc_5&(PpGlQgF-DKi
z;nfFbh;(^lCW)x)ux5`V0ofBD{f1n_A3_vW!WgT^ktF!vthqTE1fw7tpv}D;YUq1;
z|1vtK+*L4z;jEp0BF4V1RPX3193;vG@6*&xEnzwREU{(k8Gxa&2*+GK)+FNeMGCv|
z;Q8h*`__JO;U)P*cYMzOucGn4&Zt^sJj8#*jcq~n%6>??3Fv}o{<dFhkC*(mhj<#k
z2V4#aMfS`E%Gzjnrw(K1cy58^yIRvT`>*9IrPL3_Rb|OzHa)1<W%D+2oB$NPiAeB`
zU!pcX7YscX_9Ns`c8Z8ymq|FSX_Y*BRm?;ll$k*VVqt#ojnC}~>n~u!-OhK<S>!(~
zihM2JxbR;gQ{tG5ypRHvqU_ftZ5nRG3I7a}XpTULKPgq6i(4kSaJIE6{dSgS`dwZL
z3XulsTxfno`X#Ylnc`a!0K9f7Tumz<nS0Dc$14GaOrz`Yh^CqUp|#bXF{2=t3q@vS
z`+$5o!0@njTRkrnD6_nABRB>9w+CNh#s>*c%zn%<Yp))ZnbOUlXsEfd?<%#b1r@ym
zY7Ktiv|=S@B(tieJug7)4zHCVUUJA`1H?@xbz|^zHAFFdBOT+IW?tV7_?G%vY>Hf;
zQ*`B7eirX-FLz_u#1Kd;i1L)nAKO>r+sTleixTLSL{W<!LeQhIi2niPY$0HTsn!$6
zss7VaIsjqgtCHY@OiY3M?a&K}slG}S$jzK`q-TA^*Dgt93I<|t8zONh<9Ia15UacU
z!kj`ORkvk3L=H$eD&W)hWq7u;bX0@uppgl;hOg)F$es0sI<>tXvBE20J@z8XKvjUM
zgQdtH)y@B13XMV)4rCP8V|A)2oQixVvpnL;oO}H;??sD>PR0?RYbUE_G_AG0!Bw7>
zI%?#q@l(<MUhi)2LtarwB^|{9#j76_$d-X9+f7WHQz7HP>&Fw7NLbXh-uXySL#lsl
zfa8f_tz!9Ot>@EFX5_psN|51)hFur71@khfr*lIyiYuDO{NNO}GYnI;K~4+^9J6HI
zsC@9hq5|b=GfoS3N-|U&$1UK01G}*uV}Q+YtP|I$emnJ{ode(eZ{bSKfR{nCWm$ej
z6V$Tx@aLsg2C3MPuXM|G$<77YZ6Q0~j)CTrXyNaTsJ)HMPklr~{!OB<Sn`XFOgq9l
zI?c$@ZhKhDQ3gWUnc6p?sqEH&J?bWM7sa*znnLd)%n4AVAro+?K)m#iRfjt1{Hmqi
zVp<PaAGvTsq<0XgXHS1S)05y_5Gy0_P4hyqY;lOD`$wj}rQy(4;_XDN(Wr|%z;h;i
zoDQ9f>pNcilQyZADA;O@oQ7zFLt61$%_BngX%~mdRL7IjxGXf5Ie!RHL#K!F+jyR-
zUcku%)>|eNYdJo`Y9R%wat8owj5cWNt|Rwps+4M*6)>*x-?hF<>l_Z*0~SU^Xg@?f
zp03Kk5S^;RjZ!`U(H7Q_v#Y2C6~x2|V&)Xp8Wl!V4{g6YGRdyTBp!PcTv1l0w|DO+
z`z1G=BnlY!USF;JgTd-QvzxSs^%WBGI>=}-ykl~9SL><?<%y&z>wqMRKAbSM#ZkWw
z<<vWZZ1)Jv$qNgy7Z3>*ssP^rCURliu$2WEy$QOd<;h7LZe{U;_IuAvxN{SWe|cD6
zFQaHMPVUTzTj$y@Lyw`kPieg?#xKgF;R8q|<-jwEN&-j(FHlp)k@&Aiz4BfU9|Ob+
zV4LE~P*r$RG_t_q9s|nQxY!$dEfp|NeWfnJToHcZ%0lew%ZVAd`C%;v#<#oEAYLhb
zWKjeO$eF%EHapzP;y!e(_P*q8vyI5@s?_i&nKJ#xMpWf*@W0Mfi-$<V5mTI#H5Jup
zWif1n^%-wEnOk)sUFTpju$F>bpb_FzC|p~NyS;#}cLghjw>;Q~v{{_R?8ZrTwpU2V
znjHytxB0Tj$J2Ism%WOpw-q5o+oyb`L#*&QIqjIxV)I2Wnlyp(@YSph^|><hrt;&=
zkAuB!E!YBi;%FKj*Hm;o2P3-g%3P~Eoo^<TEpf|NDE$ikj2aq1V+P-(OZ;{LP5il0
zMm~Cj-O-YDk?XmlcL_!T-=dV;mlFOgHiE=Qy$Y#_X;WAwP`+n{iD0hm4a^js_BYt$
z*6F4^7p2K@Dls9Z$X~<_rj|PDG`PK3B<Re6ox2#38l*UvH74r^iU(#=TDH2I8|$h+
zYwc>vh1=LC!0{`||3GECX}_vQzrKxlbF#vJ?=^99nka^Gu|4C!KEB7;9z_DCGcGNg
zK{#5s^uTGOc?~{}QZv8dU>vpbiNKSOS;>P^be@BG74_pc;3@$neTs<!%x2^!PLMF|
z)paxpJdpsR<<uLqg?c-OhW-!|1A1ZDF?MiQbfUu+FY6mlgde8suwiCrf3XBot_ZSP
z=`0zzx_|MSDJd)R(lWhcNz_@TdA`B&(1J|U>)U2?<V(A^Q|6=i`r^F5;XaeE`C;eO
zuS&}0oC$+E*n&EWzFX)U=g9J(!7{-`J4MCg*-ckNEe8C%pBQa@4Nt~%gA6C=k*a)L
zR*+Km&(_M@l!RU|fYZ*>knt>v0XyCVJ1#NsEIgvlF?r0Q8|z=G?rqmt&nzY^I?T-t
z{8&VSoNxCSC7t7m!gPNNdNkR+h=yoIjIm#nNWSAc`J<!A+h-MYa9ZqjmVCKJp^U=&
zZ_ZoH3gr6U=JHrCw5Mml-yd9cv23vSJ)X}+`212gOAuJ!00*kb=IAv76rcar?>!g+
zsO5~oWe;A2y0Rw@ZVItcxbl`Jt%`VPmwxBB>+T*cSD}w1;<sNq;;lnY+9Kq=#3c3R
z?$DL9vQa>irwL2Eu5tQ(MgUV(25lnH^Yi!5d{FK*9ZS{&Z=3-!Y6$HR(-z=DN<~F0
zu8aObZqxIimHsq&mh_M~?#1lvktg#!;%qya3bm#)ABQqs%Ql`%kT}EGFUvN8<?;mc
zEGZWa%bQX5cIiDjyWwin0yG-&Lq3oBLz)n6OzEtd2-a~8>-Wf<<^4fvylb77E0QL*
zP-DFqb9c7m=RB?Y)#p?;apRd^w?ad(D<_33yl|h~MCA@#iD58sWEAqX`{W$~yekQs
zVF}Pb6@$neFt&mbH``+ejf>vc+Nu{~wd$r*IfjiDRL$s|iI_cyrWWC2e+L!U@a{sz
zQQvSMFcZ4BqH(C7WRh{M@+!8q1^jZ)f3vBZW|y+x7kcKBcP|);s!9(yIZHClEq__w
zm;z1ITFSqT`z*Yaw#J4rSe2Flz+L`Tx2cdO7fNvkfiE68;vR_|9Ndy>xW2VlX|tfb
zA}^Y@Ioiovi$4>LC{<7pO`8MU+UI`pwi-cOEVBoD#SGC@f~rpocokL-3!AeM=h+U?
zOHaAD>?+$VlJu^qKP;UDbW?eCTAa9Z-AiVBV6+NTlr5B6e0WE`!h7@HkN>rB9`93V
zgDWqs1k{epYMU03lXvPANpP3dn2QK*slp*)w6$k%Ns_0g4cFD4xbh#wOCgEr(h|B&
zBX*G?+15<YNsrJa->4**;%!=rNNx?bTh0z=%d0$)9UZEY?5@<k{515KWt)eO)1%-x
z6!W0)jY+4DwpNfP<_{BORT7E7J7OE>S)mr@XHVt06hkDpO<zDqJ&A?2{SaRNi57T%
zd}!PDt(GjU%E;3+RA<NRP=!x~XEhNZQhkYlB}Y|}WpsqCOFkNVdQXso3)(Y0AhjiV
z79Qc~ri;9kL9w_#CAF1zesIxYPFi0(0{jYJx?`LsX34bw`z!oLy}0x<iW|r>Cb1;h
zNs5Q9_AIymrxx{LbQ{I%axQ(43Q^w;xr!(br)-^5@q^dpIhM>>zISUiA?lXy-L+ZT
zV9qR2sHHW$Q)#k~I#Zyn%Gxn8o(I$|DA$7;EG~5{rgVEy;HU^P7q8+G8m_u-pA()k
z-%ZmT@A;y5Sg78usrp)9<fbV+FYv6wd7;V8>4Fy4(hGhNFO7Hl#D|X5$0<8TOdjlZ
z*kUyDM<N%IQA7^PuLSp?5F{V%r=TU|tY@<Pa*;wLG8L^$Yz9OaQAf1*^d!z-<&buK
zTF;OpZ!TA4={NLm3J$yhobP!h$(^es*$@aAXq2*I2wWcr3{TXQpk4#dpW_f1KX1$$
zM<~i}==JUV@iDJN^_q?HcEkis#7d=TaQzp52#?GRU1M?Pm;5@;$3Y`W!3{RuJE6I|
zB~)<wHRNjf@3sozjD*u6ZpIFGkLvDBH_x*6`t1_%CR+-M6pP7e?oKSW1@uNYAlSW8
z;Erp9-4j>xB?SUrDY#KWh)}xc)$BXIhcZtp93;uk*qK`-i61MsT?-iH7qC?f+32~i
zo}d7;=4uKvsEgtG&O}iLTXJ5oK3dJCCsd5Y<zO=i^{E3D;IoqpPRY83Ycu0QE4P4`
zCqhr#Se@+U<m2rZ)k^$v8=(vB3qxgVoS5+mP8SIz9Bd&ImmkhI7(FR;mIt7l5KYrd
zXimf4YhlOqAz}WAr2oGF)vhBLtwbHk7*M;h7fJk_-5k4Y4-;DxmV>lgzwQ%zz+o;i
z5WCgaD+P9UdCtx4oUbaazYv%G#D*Y*t1v2@Wq@6BhU3!Sgi1n2<XjWAkGKLL4A1jq
zLc$?XBvn%wnVakT0R`iE<<b?>Q={qKLe>PRcEDdC(dYF59kSQaF6F|4B3j^t76g6*
zD~2eKj$fVMd&;SD26|wL+Z|l;`8h}gOLmqW0>GEA&EVa$eHn}BXVEbR*h!swaDgSj
zQL1fI@BX&Q2Vc#jpLAfuCTAs@qV5jqsea21OTt#3T6qEr%900xg0eZ<5Pv10%=>OW
zH*!4z{?b`8242Gz&%x`y)k6;3Zli4AOiv;+lym!H-U+PRE41$)6e7~AMS2*&iGwP@
z?WL^G<3rg&c7Uvtt1Cyy&hIhZ;y^Ze)2KA|(c=NZ^BsMFE~TB|?Dugkkw*!ZOTYJq
zFBuon-vEOL4HyBF7NW)A@0O6Fa`+3N<KAXnyr`W+a1XsSyi(;MX?(S{kHJeNEV3<L
z2v>o(#&yUL4dW-yLk&eCN*L%*Gq1hRHVU)Z&Oiv_STw!EUSC2cZC(5)2n85!6=NoM
z;p}4^c+#jWW?>AG>11EC7cQdR7e`>P-c|hx>r%Vkf8@rbZyX@LhWWrnc8eMPGv{LQ
zr&HF=Sc_5|xL*|+a$+Xe**=>=qK$A2sjJ(WaajsAok2ur^-p-=yej&5aG!c-W>L!3
zDXL-AfTnZ2BcCa>?%+pPoDi;kdQ@f1_4dv`yQx3^xg*#a4Yj$H2&&izQ^>Z;DDF}<
z(jWn&F~0AuuiH3epq%W22|;8o;*W9GY-T{mH(cC7E(L^|0Vw(w4|~7_F%(i#49hL3
zLQ598XtTv>HMYTLfduCFD}=QfOAr;Lb2Ah;QnQN!I-jduDSL~csNKwPv*r43fwE4R
zPf|T!kx=cjes4fV$VhaAf)o_j|6gaYX(GR*`QA&Hv|@@yP;rrJTwm9_m$-H3nh|@t
z?9QU?S}aNCC$jtufUi~qkG)+)k;j%?e4=}hkKg^9e^xA8M7WCw0FOnVo%Lkdt=g2z
zi^sPrP771`w+V)?2@VlfVBseR&JEEf@M`3<O*5B-7`AHEuJN()22vw{_PZ)?{A>vS
zurdd|Pdux3M(=J~OE_saDhPY)Bd-o$CXq!O6s1~?b9y|J=@C)2Lw$aa8l|8)th+47
z$lRCOnX1999X{OrNB#uWB`>sQv<%r<KRWgtE**EC6<?4gIGHAxp|sI8TSO}U!9h?1
zd!Zq+ksUj%Jq<>e*mxNoEw5d>Xn=5aUxFyJcUM@=oeJ28ByhuPPwIDajxZpI3Fc>Q
zG6d@X96a#I#}F<%3~6vdU-`Z^A_;x_L`NlJxCALf5J*lPhJ&04T3`1-U$$6VTECDc
zY$v}IU@B&eZh5Hf%h;(LhlPHPb7iS<RUcW~eg5e9me%mpp3QyhF0+CovqX%<7szrE
zu7cY(Ks|=1vP6V0)4yignTHyv%xvtwmr6ctt4+z582*VF;u0WH4VohQjiv#AAP{DP
zVE65mUey7C?_D~2;Nos-ZFhZ;_D{j%{1%}NdFQ0WUbR=L5`qGR$g-}3Lp9TsdbjMc
za^x1q!%OI9;ZzXwAXhn0{6Z~up?lc~l3qQlMY<E--0Ty08oQm+)-$*|Yo#+7lRG@4
zzdPZuo#w?kmbmrAc9ufml58@!PtzK?pTrUk-eOy1r$Lu3PG^9SLs~ZVBy-UlnRz`D
zD`4!BIWFj5KC^jIL5ej&%^~uev$7Z{WWMqB5JSo~^@wr)xAB$up}ymZ4KsL5S+-z|
z?HFj-tHb=i9J-*u_B$rzVg-s^0ykZB@=h_-z~H+?;GQ{SlZkHfB0bELGoPzE)?k35
zTWTk6Br9KSHeoAP-)IQSIjjH;aC7D-lgu2eU)W@iDr53$n87)kzf?m+Pos^dkqhx^
z9+d&BWbUF>Jbn_y5rDEP-3^Kq<GS6-aYQuFduDUlJrwNP*yGOO7=*UI`Z>|$1CWh~
zWib<MlPoB5cd$ByqHLOLU$2<kMHca{3S(g<cB^7!h}ql~t3OWT5~V!NKwJ{IqH@{6
z!O8JgX(8Sbh|1X(uMTs22_CKIG09p2wVaH1GC1cP-AnkGFpL;4^b)k}$6w^ppBM=9
zau%6Y@AQJg=)_~L)hDN!!R)l1MdjxU@++rPvUT2p4~~_;6#3cP<@((NxEp;l934fJ
zf3ecp1`NOBO-Y;ZnCkhdp&3q`|FYcuPO;59HVra#a0&|EZ{W$m9R;^0_6iT)*Cf{i
z7V-YWv<7P3p?U*jA~&9A+Okq(@L$rXvj|gGyz$dNO2o5DXUDJP!qh4or$Ng>r|TZi
z2S`~*a2EK^7dY0>K`d4~c)c1vr5oI*C|{284n`0kB@|X#spF2XrPdLn%RzVR9*?Up
zjA<J_MYqmlfZ~mhQESlNI&LmG5ys67kQDQ#467tH5EkoLg~DGmjDIt!1?I)iFo>Sk
z(-c&MW)=A;GIy5c;EN7w>BM<ecN2qPGCRZSK;D;o8nAU)_atc+FB18#Wpke#gcq3Z
zVreY9M5{0t0v`DO5Y}Ky7RZB(O2GRZdB3YHpJGbp6?#xEALVpX4B0lsph4gLS?P6l
z|1)YOB)xvDAmfj3HNcL}k|U*?Uzsg$`nTTuf&JP275!#gBWj>3dua{KTP>?5rw)OK
z%yeQ|way-qNZqD`1r3qip~oae>uC7Sf<GJNIOmEQd=kSzWV)-~#}Sp%U&%bz5$%fj
z^o@NQ`laUhfzfU}tN9biWKaVMBC;lDRD9N}lKK{V7z5+8ItowpXIsj~{PORrOz%@b
z5Q6NaZ)_ds`ZWG%BON9!ujTe1hP76?&8CP~ojRp#P?r%WmSzwqkbk!jI{bZHjDkqj
z5t)*Q>exq--H}gr$5jF<rzVHDC^|cuoj_p?lp1fzm)sw{?-+Dv>S77ghX<;Rb#Hla
zftskxEw3r6I`0kQR$y@*Ci#z6WZGhFGZ?jpu&Eo<j_ir|wh&)~aewDP6+OgY4UFiS
zrgwgi_WD7%m|6UNUq_%@?<z+g0tIKgraR8&tn>d<R+3dY)vL7ek0#(roYHyRi3j-<
z)Igbip2hkR;!P6W+;(WruN>4wc?!!6@4D?*qrrE*QN{tf^jcaP_>QjHc-Ear3dvSD
z#QoUa?Esdbr~r{c1!`2uxpA0(Q+W+83l$jcwO>eN4^vO>s{dD64G+uYbvCn@EBnPD
z=f((q{h#HvKakc!O3Zlkz|znu4A6fjpPt&?;OcKZtM6980nj5+4HEHo56mBZtaCo5
zSRYQEKlafLR5<cb$Kqfhk{%;%`mCzPBS1LPSl6PypFD2!(?A22Jq!+8+4woK+Ur{%
zEunqKHZ7b^Q8HnZmKF|`4po49<PTV4d|r~*kW~A5*O?qtk!KwicF`zb2D|-1vk$#6
zE($U@7QpRz44Ydv>5fs3Kg^5;EF9fciJK6{j|k(kEuH#)9^nT&1FQsmr!g<6UgV*)
zLE{x79f`|~U>M@F?oXlPL2I#oY%vyb{$|)0<rn$|{(hMIX<Qgg{a&k0VP$}R@ePU5
zywQ5Jc!8?q6hofi9v0$He~13>oD5p<>N5w|Udte@Chx!g2f=zz@j^R;ah=8rsIbAp
z4KLp314;p15rlSQPwecjGmV(u%zo~5biK?8l8iz8FY24-P6w|tyJ)BBqeW><H8Sg)
zHdA^rtBg14|8>V!fXG6fF}bpXFDx%-MnOBm#b|gor9yPNqp<FFHAqHTN$jVB>FIKk
zItku8<TfFc!@qEuL)Xh(pkD<#8Z|8F2;{__TEAhugr(+%yf~P0j0=5qeTh%6g2^B`
zB_yjvc*dY3n0@Lg?=wC7=1_&D_T51yRb2O0wjnxiZlH<B`poCg&Pk1wAL+5lM3Rsh
zbFOoawCs|oMN}@ATqS-)B!)WiUcN&?ABx1o@&H=8lcH3x$yc~N2;pH}W)rBks6Mfo
zsrUtUh!~$qQ3hmeuyq`#SQDh`72%$uW^b5#1zqx6wl#b+$@qWj+DcN1uJ_qWSoMQN
z9qsT_r!yLoG9(0Ikg#p{cxmUG+2kZ%JHHp{hlZE71V@LGnnL*;%t)N9V|p|<BR5NV
z1vP5=prksd9u-sDXmINtORk3WW(AYGZfNFUy_?-Yd9=U%@y&i9FmmwxcVboo+l9gs
zv>wb)H&7lfnD#PZ4<xch{pXS^rgaw-4xE*Z_8QX_?*>->s~Cuo;`Am0{H3ImG|wR}
z5GG068@)Hh_dQD3c>nNmrBGZ@K#`QO%ruHR9U&POwUp~h`pcBD(OYn|dUZgX8;xhd
z(g6ISD`ExxBzKjU+kf}+S)kuiLC3C}#sr+oW}@vjd~)b2{s!^zJ&n0N=r2F%@|*?f
zM3nNcnqdPF{iBwW_x}_r_4XKqcWY574MeAuQ#@0B&MDbiu1JCa0wDv@CgJ@7Xvso(
z@2M`(zy-&obwC$CfxNJ{1^@&W<vAIO3>1;4qBPg{F%ulm)|&8d1bzQdXoBmS4>cQ=
zOfnMDbJIPqwq?3Q&Sw#x&_7qBkB8rv3Mi8S=>8HUuhp1=JXDQ;BKHjW;=!>C2`TV#
ztAz+^IYziaZdFoq^goPzcNb2bx3b%XEcHJK<*&ess?M(NeCVM8;KTK8MqppoyW$~I
zzb-gogY8rc+hjx@Ym)_du{g7Es3QE9s0e|jW?&~6SZdbP!SMW!N->*vj#?en`y0Og
z8yerVr_U?PXEPk`OzH5-((8wg&4NK;{^mlEA4>r5!_4pW*)_aacf<EqBtB2by?YRv
zG>AYCMTO%DMl0Gy%(*?J*a(PV4||20B(9CK??q*MyWi^l9~D>D;TvnMLq$l>&X(5n
zv-TFSLp^)x6o+Sg*7;<9$lMWKIw*GY5h0=a0i{;1N%2c~v4(-Ui80Hu%DPj!Y1xC@
z43BnUn{DtUf=dA9AjUqqOrf8#&W4nt8Ov_c`D||@(@F_k(^9|jZLa4hoIiD*bwyef
zzT)NkxqPrj++yyl#J*YBCdeseBp)J-a(>B-I-~Q>Il$ERUCJ0P+5$=3qJrQi!9sk6
z<iT%;cgRp_V2OzH^5kb2TI9ypgQyA>Tk?%l3)2V6;ERchrDzg-^%oIQHAFXj7;N%}
zc7i6*T=nX~0>8_Np1h_!0bnlsYg7+B%1?!5Aqhc$Aa-It2E;v7Ty3Qgf{B2Z#EPW<
zJ{d9By^F+T#~`Vs(}qS?(J;q-8dYvf8PsQ+BO1jf+Wjz|x8#o$T4i?koY|QySAX9b
z7{KRy$(fS~KNDozlz;w+`WzQZzHSr*)aNXij<iob6)p2eZbAr5ca8L7ZOq+%$maip
zZhj(5bZv%0MT;hK&ElsC6Wh4iN5fyXCLVx)l?b|03v4LS^=9$xd#zkwVd5(2f%BE#
zj8GsbQh>`CPX*n942;S-r8rXfD}yq-cqVI&wtzlhATKg*tF;M0XVY<^z;J-Y%*rV|
z(-%(P%{!xE?bA^qieaj8IUx?qkJG4qd_GUY4|<vBu|VOOyHXX4+_er7m>=$X&Pl@!
z6__q`3Wkm|0}qIO`=M>p3}Gy%CK72sH(1S4`R0lC%r*a2yd@OLq8Co8jwc*K)={QX
zppKXGPjPd}ak^(=y#KUxGsi5!yft(0yzZxO3O%UE!nqEIhc|p?iy;gnu-l;VO>-v-
z1hyz4{MXsSfL--7N@Ew~G|#pMmnAqa=wEwhkszU{Ld54fnMx*OyZtK!IRaO<8|6*z
zs2%cK_Y(k=y+#qJ@{(=~7H8>_fV&J>cC}9vE80+mRq_Rnn<j3tN`OY&$Px}bk>6c(
z#ubSpf}OK;TY0l4!M-Zops^hc_YBkt+pQe0pq=OLQkKc&s(t$!SaI|O`@WOl_yrC+
zbqrMG8~A;aLHwKYv@Nxw;`*HvjK792g|^AYn_TT2Xk^OIi7pmvVg8z1a(m$^WIuU%
z#siVYQpF))QzQWC`vVoZ9Gshmjqu4Fqm=MMffRxVT&akc?x%!kX)z-_L;y}>v}n0d
zv%e56NRbVC=5BO`X?2j>>8U@0w(HfMdLWdk=O{aGenzI&=$tIfMHgJAesnwe2HCD&
ziKDx;2<c<F(GW-#&TSHp|F;P%HB7>ybGqS8byZ!|pBRd)Ihiu8n%~rb0#}77sH824
zhyUs_!13??S=wd{y#LzkZH=t7nx*X^gw?q5FE8R)=ryLEq81K;zRa`<@To&#sLqV{
zN=O&?D!gvpb;xVmVtyYig%L+>NCLLRSpTebPpT;;cm75d+gUvUEE`|SqeR4deTk=V
z4NWjbF8*0ZO}!D<wZ~i26M1u`!cda^924lqU<UOLnOmJl6Iz!aXMsicSH_m3?~;Qq
z9Txj%`TR+7vvA&qR+Z{LyfId37-XR90VWTJ=NbunLq&!R|ARkRhHJz$<@G2CxL`d>
zO;K0Cl&Dg}Di4WCzYJeUT}LET=ojL%96o{CpAyseMDefygd%M~Kw+5j!G+nAG(1Pq
zgbfh_nh^19(5QZmlA-Va8{-bY>Q}lmsTYQH7$}iOlT;d=MYBJgIID`bBJ^N^#4@%H
z;%5dug)p|ZcA4jrj<FoaY)u54h8=To)R~@W;*y>!gwmjM7yj)Vngp!4ByTbyfX(5#
zkO?CKtB~Vwq;eou4Osg48mLzFe7d?!ZGGB((m@~@JA=NONp5K49|>N@yvM48W-V;y
zw&XYR$6=Wup!zJ|ZD6n_#PzRgROZa(=)fB?uD#h!4g`905&~fRgV4jx!zT*_JN)|x
zwF>MYAZw^PRrf4t-c&LziRw#M1|K6wsvclAha*Rl_XrfL064404XvngKWh?x%3-O|
zSrmI>^*pPr9!T;!l~f$cTLQ!$$TqAdjw`CZkOndC07{q`d}3Y<*KW@blv#4#3^@i8
zO4G8j2CwYfp64ODQm#JR2A{V|R9I#_nPE7c{J=jFX&vEWESqc72q=V2b+t61Fc8Tm
zuCP#Geg6DUjM}(UJtPeW0XhW`<zuex>pS`1%y+x}{<Fi0LbI9P_?D{>>0={wq3mjG
zoO!luhxUOJhlO=12MEw2st|1>o=qs`6biZkVH3DXdqn!bSsQ<#rXGN^7ykjDgqn)O
zBfWsJO4T!lm;$c7tRYnV(UtE(P3shT@3^r6=+nU6hn`pG^}o%vi>em7d&NDNyQ%e!
zxHC$ZRfMLW9`(i}wl*ddWy<a!if(Fw$m)v)(52jcDS-=#>St1duwImfbIg_z&#*6O
z*~vxf!B$TprRkliSt)LvzAAE5H$^JQ5B1hGZFdT@8TR^_O%Ot`(^;i(k2pogOkWV3
zHL$*b@q7}Q-b6({hS5auib~w-ZezJI00=o(EUX<4cd9U~+PfIE4BE_JrZkIFuCYc^
zfC++J7aG<corS-wKVC7fFm=u@Ykn6+FQMzQx%w22Rg`8WgH!b2@aGRfA4QK%s$r`D
zAlu6?5I=Cc4SC9b5s>i8ST}boh7gmg&o7LWVH9`)AwiXIRG4C};w&lrx<t@AbNvZH
zW5G0gcE%CdmkV(L`$tjafa)`kljEBG)SgUT!5)b>^?};+T0}sJt=<`e-G`cYfDD8L
z1x^n(A2=JiabIgJfn^@uOuqEob(L#|DkZi@p=#ZBW>bpEkIm|-BdwS*=o&>AI%yh`
zJRP`U!B}D!)lyA@hC3{$6Kh&W#h+b*2AZBN#^Q_@ETOc4A3O%}Pf9x%=DH#G4W~QV
zepW7dmp|ep-M>dE(-aHn+l3TO+24t_FlQZKE(;@9aQ9*Q-a&c%ElQ)^hfdztWTel7
zdTVnX?%P$<j!@_u5i#;+_|~!2;{}Mk&kTjbO*skJxqvlI<YLds9|6){aft??C*%h$
zN=sPt@L|O1o{YLPdVrodf6APKqJr?sDev<siKOp>c+X&G6IPEClsIBg7k=Ot1$LSQ
zI+L}y7(W}pfgn(!FGTHKWKQLlp0wCW888W{9_FAW?6@YftuykMy*E1|rAU!zZ*Ty>
zl;fEe>WB_JzUE+y5}gIHwxNFax<JKw92USLB|hYuC8vz0`7DH=VxXC$W;6c^I2&^B
zY6PCzu4F(t`CRfOvH6{X_0l$Dz~nDVp$r@$wTm&GF!vEIhDrKI&&>Lr8-!uVX@G5F
z0{P%@mT}R-3mae=YeOON6JFKND2HymBD#^8l6k<aKoo?dkKt7cbUGN(I`DbzPh-NA
zW)g!6=xQ((mH}Eja~Fvb6VBc;q%m57YEi<Nfj&I`gzSlEBLuwNhI5-57uza47wcvq
zNKoL=#xZnJTN20W$m>U`zi;j5qmf;q3xzsNS<XP{=U|RQk5G7jn+`|cscl7km{U2-
zKk7?*+0a#&0F;mkq8#U(nYhj2LRUBL)c0<2T-ALg_#*0P8Bi^KLE-}0ih93!!sY&p
ztRhB;7qkMTqMIFuouI>>`i3p|RE`2!xN@({a}&*vGWB#JvwldU#G3oZ041n?e%6J-
z4lICuJ}eo9SmfB&5ew*4a2b5QS#KhFk_N{}0uoceWH1a9&R3-8tk#9+>&=MLY8p`U
zgpf!F1r)`S8;Jk`$kwOUC5n^Cm6uc#W&Q%0&q`r(#~LsbtxgE`?VOkkkTck~<i{2}
zOozjcPxUl2$_pDxVK#1pj3j&!NMbn=XMv(oHvk^1=dfejmA_z5OE=RwKXG8mbUUt<
z?bt3~4BdHgFax&1AM@HOts{^W;9#g?-~hhsT%E8G|B9j&;fg47s3;Cjo7|y5&d*xc
zJ>f9$XQTYZ;F!o`dK3R4g>ziYY#sKuCxb~zkyZ`T<4Old8TK9iqhs&ZGD%RK&#$?`
zwlX$f;au1_YbzD?P^40Db4N$1JPWLiN=%H}Zc3(8dP^|3Dh4s1FQYcFa<=m266Ndq
zi@hx`5l+mXd3<{-)wIXJcu@#qHeW``JvF#M%1sQQICQ7JNpen2%BwtET%FHqs%~%w
zF0egKac6E)^4sv$$nQsjrApcmDoY0diqP5zqggP%wY$=Pj49Bz@g}7)V*>i5<o5|+
zUVTUvT2r}N57Kr%3NN)AfImGDSLO%P{2jxdLf~9TApvD~9yJ(l=yBn<;UHJulzx%2
zA|cj_AsuLBOlS#^B8ozYvT1eeR8>a0Ju!J-yOEhejUfADA^seTHlwV?-SzTL7g0vP
z2YO%!MNzAaM7a2w!CcTJreDP^e`n&2+be)>x?gT|Hs=lxIw|x;*f}W-@Ft?`NK_(@
zdog+en{vI)Cwmc6cP8(dHo(cmAc+h`b}FPO;1`6drvM^lHb>8ky~M*#3Djkrw^Pf7
zqh+_G2<)lDdP(M<MwaOVzWVk93JW!hS2*^L=Eu7%-s$TS#6*y>bzvUV7|p#x)B(SU
z#UNo5_)mS5N6K0b_Q?alMU0bv!7ZHSifg~*$CAV1q7;+_Z;vnKYG#Zp91w$oizFw{
za_n+jk^S&Y78TMo3?CHv&g*<3dQXuL1y-=cg!)S<HwmM@7h4-0SA!`*#KY|YNG7;m
z3mCH!&pHdWpb;8zR#FvJZ9q#^nJ$G1_hd3)#;=4KLIfk$Y79dS9O=zEyU1USfE;9o
zmq2HLE=>*e9F_&__3T+(hY+9pavDHFBudalaJYK8T!DSpP4dD4S{0?D=>?#-UJcPk
z6iO8Itcw$g=-4vCccZWLj<FU-+GAr!(mU@F0;%SK+xK60UP4FRFu@Z86`Di}av)O^
z{u-yKgX$at5?i#H>tieq-6#iNz6{^E>iZ@rq82pJ`YO{(BEYc*SxZugCVRbUZtHzk
zUrgWF&LIU!cyO~wTdb_H;c0K;yZ+)QqR&cfW4W;Qv=Qn4v~NxmC@P7oC19*){OfV}
z+BDK|xY`Kv`!1coA2|2_DU?5zc&P|aN2WJQ`T~ucMPCoLwi@F^=q8+^w@a!jMCdVz
z(FZW{x#Llk%Gg#51bZ7bstHGwhQ!plgEgr=m66L8?>>$^1+q$`7Ce~iG#Fq^jN@Sb
z{I&)%4MWY7ww#4`4c|r~OMABgg1hO@s`M$i0v@`u1jPI?AnUPX>2HK?|2b;?zZ-;9
zp%_qLHZD_2h<!N<+L2UW=0EWdna9EDsaU~KDauXTs^wEWevoo8Xz^Ymb7}7eB^j$q
zBd9v9EtoGT*mA+QHcnjyWg+5z>t5o9ez4I)C={uTI#ID(iBas1ZJC=9y|N__D;uRm
zX@)w#q@1N*yXjYFw(zxUfm!nE=cKwry>c@50SJ!++eD%jT*3I|y_u(&LY|w|6*q;k
zU<(nOm5i7~a&S*91A3Bp(%+481=ZC+FqZt<LO&`B;^`;6t?2=N3>oCkO;1F&crxPB
z!aoKqwLEol0jPeE=eEQTPnG-w#{IAdHcMaay=6iGY5sE@3d8h34$r=r2c(`3N|C9*
zNUM+`G3Uk%W=&|jTaNCY5t{9bv#GBgrCnNqu#bd~EMz=od??|+nwaJN-J<r+D8N9=
znGS5*H#>846v5`b_7qr_qPFUojtIn@3;ORblctLV3%@a!SAIN5pv?=N=eQtX-yI%g
zN6OEmK5+1)YW&iI`BZd;;sOBk|Bu9)yqoX1A6GVxoTHgn$g&jC;DI)egJQTm{e{+O
zibONZJVdm%ejFRicqeZ}<5n%px3T{EZFuyRUq6&}3BQ=hq%^om-+Om)Ue48uCy8!&
zdKkbl$<HnBmd_Gm1Jnud=#<6MdLP_dmO;Ua*pp&~RhYY#3JNH!elR5r|Js3=1~)8&
z03TK3!0AQ$l@G5cw3m%aT=AP_87Cf6%(0iL7zUboR4WY)A`tXY0d<_Apsj+K)OF^k
zmpGCC2eoKD6nU9Y4NgX*-~Ddfbv9#QRA3|VTw~Av6#N<{D3oL8r}<7L>(*Nm@{<)L
zf}&FqbCRJB>e1=no5QQ{A9#jnn_X5XQ>f(eyni;GX7P3p!T*6ZRD1`FUXAgY6$C}t
zVIodD(o)bv@Q*b5$Ojwxhr_(A(zp*v?>g~qoCx{xwHVATDq$N__02eRPHMua#!^<m
zqNJ(==${T|KM7&O^pD(2GR3ecP@EC0tG6vTfHkkv@&8Qy=q(C_-|Vd0dl=DY48aFQ
z(NTee9@e?bS4vb=S>OR+<4Tr_q@BAnN^v3yv2=*H-Sebd6ZBZgJm<_*g0Kc4f_#pN
zl>$7*+<|$`FF~Wh;xJ|K%0G1Csefrnp5u|A^_5xv&0A8^(e#)#RC^!PN?=*ladb$k
zDd3^<bcuBMxlLc+k=L!Hvmp0#r)o|u$;Obf$@?RU0EJ^Pu@7mYj+`!mlYyZ;1b!&d
z*58yW6lUD7Q*_=9o-}tty^j-BOHxO+JSqChwc!etj!+ZnMmeur=Lt*m5B`aoj4KQ#
zu~6JtcovJd_I;<bXGn~I=}ppZR}rC-X~*lSaXs#b#}M)R7dF=P4QnMx>YNV4WKC*!
zMP}(<!albW&%n1U4v~~9c*WtLlU?S8p3*O&*8G;g*0<#5wmzP>Xg;7N$P?EI*7Z@J
zu<K<W!-Ro7xep~AH8CagFM*#4lpn(BGg#XbQNiIqhDu{VVB<^QnHRnc(Vawd3a+y6
z`Ge%^KY=)Jac-0#BJ{3#OiKfxYQrS+61o6Z*B=|#N0nee&>2&_gMZMV^6$T=IoR$A
z7uUA%dAPTBQiWcJN`@x~zFiteL`B^!$<ycq8mo})8c&)gJjL*~Kh#a_o_S9Oe3KSa
zP<DIr724S*Cdj7??&?O{EC4)w@2j8})z|Zd|KsQy10!j+Xl&c&#<p$S+$0-soQ-YU
zwr$(CZCh`?_p_#JYPzSobndz5xEa!#n*DP!EbrLGr{50wK*Haqe7F<E6*|O1$E^sA
z^cFTP?+Qt0u>#+eDHVeE%57VFX1<m5g$JFI9F{o+)thWiNrAOvH>3>cunF3x5T*2}
zpVKkIlsyw$3C5=?khM9=t<Zg%i*0T{1~to+Wx!+!5F%l8b#d1I5aK>QURkv@eFqL&
zgYJ|ImP0z6nF0fb9PTOIT=P3T=Hl%SqQ1UB&U^#wngwLIQ-yHG?7#G<B9s@Px}`+B
z!^9|S29S+_4vmi=LB>~n46m4FUXe6F;dBffG&q>yskMIz8Z;nNM8im{8N{-wLm(jv
z#P(VTyzv`zEX{5NQ6%0^!F(M7V$@_(|JNcj3!?)lc@O+$%T)(xkp=2`qp-5P!CaAh
zyc$hQe^zA#2%}ORNihb<$&T+Bd|-UhKRUpO{Lp0ZC^Iq<S*n}SF&06CRT45oBn@J9
z1t5F*wYjwH`0yOZQ^cx*Y_7SRU>_sdG_XC%oh}qg%|cM~Bj4s$v0umDChtPiM$x&^
zMg>?u%3};YSRd0V^^S+|pKeDE?}Lpn(vZ{j2**G;TmB8If*wsl^oymq)$7O2$)&C<
z?3fXU2KX-d^ze{Vw;TnT`D&UsSfResPt!&&cI96M5WQ`R@khJ6c@h4bjxJ--@XMHm
zMtdg1<QD#wQo-V>mwX|atCib&%guZ%?-QhPY&J>iC!D>nY!6dvTB)wau;EH3IQpPd
zZl6y|(7=1%;vE47)?^W}CR5j6fU7-QY`Eq?>W~SkkTm|m*`V<#=I@RE(Fn_T06t?N
z<9xex1|gQgC5v}QSN=E}fa_&s3CUtB{6qNkA1L;R2|!lD?<!SG{LgatU2SkX5ndL@
z1iRPBe)i9TpvGYP_<$eYx@bDot^QrVTgP0m8q`YB7h`j2*zGkNL*z$Hcpg|b(HyCx
z1qs!}aU2(wN7LF)|EZCnd|>C4Nsx->XJ~+2C!|9-g%wVXr&gmw@D}gDiRG_sXOdI*
ztq7q7c9nk_A5zD8Ve<nQ`pNPDF^Z@4Co;_?(Yrlo22^xfy$$tP_+UakX%bDl{uICW
z5;d9D_Dv=pL(2Ro+d<<Y&bG`%Y{G+>-WrLj3=^_$+3|+RNE#qYHvj=Slxu&;0^Xr!
zkzv+u=aP-Fb9t%1Ijos=@>^Pp^}Q3QSV!BibI9?wzy1n67xnUKv1d_$Cg(T^w4Qu|
zPCpXtFW(ZwrG^%Gg^+FIKR++N{kuS$#ZNU_f~JLWdTQwDbWi1VDZ;fTNBj7c_}wJJ
zKmVdRYg&3=R2k3v|2FK?7KZ4=5+O5q8Tk%|rb9k3HTeL0f0*0#)?YUsZT~Vx;{+`k
zUkf<Qsi)ztCjv8~3#$(YU^!toC!(2g5LheVpjZP#jhDqKv=?N4^TTVEXXJ7584OS1
zibxR*1dV~w$-R^h3+hP>)@wejX0eNy2Q9C)beB}nL)&G<<r7ly=kbEb8>EP1LH+kN
zcP_S}WYv-1e+}JKZ@>LXCP!J#4Y~Z}o09@M*J{)zK8MqiLtJWTwr{Y1L6e*5#U+IM
z&~pJR9GCYYyeLl72i-L7B2p-tmJAT-mcB(RC)L<YFSf~mh`DgX75O^-`&YKU!a9$+
z(9)Gn4|@a@#|<$Zw;iB0tA|3=^kCG@W+gOcxBt5MFq;CFdFh0ekIECDxXKhpawqdC
zp&+?n&MB1G<cgSzriWt4_I1!RRzjoN(|cahh22xVIb%j1L2#tjF#eY60^(05Xw8kn
zP8nMJ5zxid>W-8GP4ss%wa5?>l2GQEyZ$TMbU&3z@<!VPF^^sTkq`J)5B-2L&{2ke
zTa76gtz=g|4f0hq%OH~WrU<~G6bcA$rjoHwCjmb=0T3zar2s1dzzFEm7vRZ`o83Vq
zzvqIXmnsAtWE+z8dkAZY25c;XwVvMLfvb7Ld}_hi-lg4~8qC)S<zSC2l+j%uZb1D-
zZnr8xzVBcD)s|B_<uIeQ#NIY03;DsBY8KaJK}IXzD3(mq{f1QqS5EHgB&sIk$T>o{
zMB48<c=`gn#Vz8;Gf$p*%&Jhh{SC6D5Ad2}E?WEF68bhl)<du|*m~J<ef;ZJ%uChU
zE1oVVefi+Q6G3|?5@ARu7KakWc+&PVJb`8E_(JjtzegD@-b{?Y{i_oZ>%f+B#YlPR
zAQngZl4m29I>cuoCMv(AW>W+{_D6>HdorTPatcc9J5XyUgI7lo_xH1$s>dO--u*`O
z!8+_(V3l<x2O5p2<5|<FFB9gT6ly0>ZLp?YHPXyLmV&>&tIOR6x}iqp8Ajvf(EbwV
z<^ARkb-@%`KLZbAlrvOHH1g-5(zy^zba4bAnSW((^8H{Qr5p7`ElV&=pM=ndwcTde
za{*IQf+=81+M|&J`vjZ_f@iFmC5!v7t7s>P;Jb@IO7Dt%=jl4V9XCN;1qm8w9KPtm
z6K(r6)5ctDZt{GmY08rRtAIu0*&=7C&*^F!N(N2@FN=A4;QjO}(m@>OJlKLZEAOvF
zuE3W7gFR4A266Opu|wWx+y_g)!M?F=Y0lS$)=U2ig^m82db!!4@=RA%dt=W~mwsRU
z8?Ko2qorxbSh2rr&?L9)<q^N9%=8MRJzJX5pM1vOspD!YdI<Iu-GWhoz<mLyy0;k|
z@*`!)K;fVG0fk+~>&=Ew<ij-P?L}W?n~vs8;KWRZRHl*C3mv$<o4v`kWi2qJXYNh|
zcvyGkmkU`OUV!zf@PM5{5kYG~&}WsAH4-*cu@WDM4Y@>q(B~H-OYt9K4S`gqV@u2Z
z&$h1^i&d17m+BzXs%H+WNA>~X7lX9&x5n3t=>a;?KHLjC+~mm*CpsXZTJ-$DO~<Zn
zLeiDYe_VhZgHv!mIyx%TP+t1gx|8L<nQ#ATcH;&M5qXeTK&%0v{Q4Oi0WdPue?Y?n
zlC+^_WmO}VTN7|zbVnDD8!VUrw|Dsdeqx9UHJpVT-4e4JR^##zA@@wW%DEH?sS-Bn
z)LI{lSrsDov0BQz^ZEM@P^>~D3nyma@=s{3@l1M6P;d}W2uo@qw6htOXO+xe@ych!
zr98HCn3#`r^z;<^Q879La)M<lcHT`P`z6H2diU$GX`9}#5M0h0fy3t#hAhIFDnCji
z@Hhl!RimSsQ`e$|OL$Ib*ieWE7?32XI5#x=`!4w)>zG#h_^85gY-s`SYZ7Ho&<gWT
z|H#ex^?-eC-eEV;9+%<Ce!@umQd?6V;r5+v!I~_l0$OV$)$3X6v0uUqxIio|)x<iU
z;My{4S@UWAgz!#jM#55iwt^U92t5{(9-!JT{gdwbP;CTvq?0~o?^gylk4=85y+g$#
z4wWGFoxoZ=Cda`QHr?JMAmQ&rxNO7IX<RotK)tJ!qO<#1W4QLMf6e7JvrqjRXy<?I
zCL`)uWRtPLjBb;xmUaRAqL>*URqh(y-ZdjX)zC2kiJl?udh^@7fhyg9X?k>TOW=#)
z<xI5!U-$kKRMDv?C5N<z>WNWn-M~7tu$D6qd0HNie+12WJ@y~}xf{A5S{g)qPsK_a
z{1I4#|2aM>vyr+-7n~%R4>}&IA0*`RoEK3A!ttasW_h-*6h0mm7x}d-Yq}^)`$NRW
zn0P~}ruZvY_Hgmiyi1YwCA=qISOXZEq{LkKL`VN%gW>Gk@m7bEqyQo*X89$-<k*4I
zqYQ{CP9eZGXr*n3bvQ{LS+zHnipFG=wt6~sDZ_<lLN_Q#MKwvwO~2tT(ak@_)ET&Y
zS!CQ^R+on2nv*?#k)|?(fL%g=Yg3<lUFKmiG!f<&or^8;8AYLhmo}N!N)4+=Odeh(
z43`_?TayJ?4?UL2(aL(uduK#SfB9p~L|urXKulh4BmmKm(w0qHTnJn)0)vYU%N{P^
zX-3*I3ri(7+agYxWw3UQXQwsRSoZ!Mmiha?(*XwHbg&hl-_-sSHN_`K;Z7wt{xfI^
zMRH3Y@>9T3%m5~Ejuj|Krx;F-guL{}YPCA@#|Zn+!9<^3cgvj_S}_CbyLCl5Vb9yr
z;y3fWUAn>_ccw=t-C;1Id=F|l@Cx`bLCibuPEtSn(m$lDDMeN(_~eaB3L`T17?Tke
zuX0t+OA#vS(aaZMzx&wR;VLR&<QBG1YI|qt?v}FYSu~p~QrFcymWV*50AHA}^60?1
zxK1PidgSC|=+k1XDOc*>z^sbRNMtUBM9Bny$jA9A;a6jt?vs>xTq1R7><O270bk2h
zu7|ouCit?tu-OgMXp*gfNIi>OdXePZ*<}91$HcCoQrI*~<l0X(F_VcV=wUCV$^sE}
z1h}Kl>|lqRe)OOhG>_4j-@Tog#fa}?v|65SQ9^KU`b2Busg_B4FfIXFP2Szd&_w?3
z{cs<@702j@F6IJOc>CyTy+TmncVxC*3$FNL<P~8jQO(gxlj700M4PuWX|4te3~a7G
zI3NN-m9WKDa>mL|W_|$35iUU29;Ugll;(M7mFask&)SjI5H3z{cBHeV$N-eNE6%}8
z5|<|%-mHDv**}g*-_c}4%w>WH&cxwmZy_BjbY|E%>aD+BNCrN(Y;WEU_%0py;y9em
zSzZ5vJ*3qn>-EZ`e-cNXkr->3u^X(V?7b&hu@mMuu;;E%bkderPi5Fo8(ueRR}8#d
zx!7-_K!sZ>(dZ3aJ*NUFB6D9DACy(7JCIBSL-RS3J8$gGd5Tix{U?sc!(A1?wxZAN
zJOM~5G-XFK#}8Kd<bc&YF(OP^2m#4{2h5$j2Fm+~OcT+Olg?S+@hbB)TN)Z9o(g?^
zj%l6>K|G?D6f%TC>6hCXyd7U_piSt_Oy{2KnP}N=5{C<KC4y0UjVArMo*rc?{Cu>M
zp>B_okJg6W*YMIm@?3aF-`_~wLNgZ`_ymL6s2$Ipl*KcqS5hzdNq_!pL5+iKw_dq^
zhN4#dTl?L4g&!Ak8vf57)2QS&dMp@<aOZxphS6epT}QdnI9V*xect6}G!-ClusV;P
z^SHBW_9fy#!P;vI0udTAG+<!``M%9X3rGw}^Ue}SEU0^3wbrsdE4tuVsByh|Vn@|l
z*oNY~f<=$yr_jWhM?fK|*F}q39+QRNOdXB7;*47Mos+KrumVreg;or9W1pJ863&Ik
zmDTP}^=_a0D^()D%+$nP`GN@1h606fcaF=mza&lRLZ<W2AV~!zo><?r05u32rWSqx
zUSC3?6G4DlxAFzkBJ_Be31lH`(yh|;T}hN)akohH00KHb2(J;R0u93F1%vlES8QH1
z`Yu1iSO{3lFHJwnG!j}m*ljIpDOr`sbfkJtH<iLMa%F3FMT=)ez0t{)3<`UnjRV8>
z6G*8-2<S(Tuq(|_E);TEHUciS74}uecO71?$A3M-ewDNkbrF{{zC$1#Iy}e?8e!v=
zyAnwg^@2bePENq9by^M|z0w8OOa|$~j3*8P0bHK#2ikI?oYEF#1#_e3grAjjysAj;
zIy2otu4)p@LAVnn#A~KUSmk$-Rc#CYf)9X#9P%Hiq+{jfdkr9#94IhIC)5KAmtshS
zq}@n)4stSxe9CTA0-xtDhp`jMQy%Phfh}<E+3v|~t|V^t@-sW~a<6iM(WEqBg?*D`
zu;wr2W60o2=Rypfh81=>sbXrWOUwQ}b9XI(u8Z7n<5<PTc5F7-uKk+#C(rVg*eBbp
zjM{1VC9i|{bP$$ts`E358xfJl(^;wH@rLqDr>D>^l#1>{r}zM;KhH{>rNrJqAsCS*
zYm<=MkEO;nr_0_@3`}0@m!ZJ`g&_gb?Y0gdKMn3IAsz&h-bQgq7hbZpI+Je_);jI}
z0&UNhXQ#w_RSYd1nUb&95SSV>8#a7o$${Sf1@bY_yw4?50!<ta5Xx!d$gi*w4wjiF
zk4MU<%60)|Fd|{xF3fv%SmvJ7b$YpGi!>UF4Y!t4j0GEBwcxNveT{vcRp7Ga9+<TQ
z$L`?q>R~WqHsR+8RM-_=xo^yvcCz>lW=lWnOy4Eyc?T$003BG?S1$O+q*^fGUWxl8
zX00Lr$0bxz=AHdS)yejuQfVUVRg44?UN|+HV7NVMLf7O*)?aSw&9`3m)aqO!@Q4+4
zyQ{_ZbP!r<ovg#~I*{>S5w@M3$|VKg))sdgV{<58Y5Fq%MMup)n*)`Q+lYkNmZxl!
zyd3oj)QJ-QJ-;Sm8yM+|-@6SK`)-vLs`sItFNYhjTPh0zu|kgA&U<LiUi@pfH(%|&
z*@3OkftbMYZ+Qk>#qBZ_6}|9Wj`mB$a8_U$b7_NXEG5}0%OI)kr7^P}Xyiur?2`cC
zx+hR(`I*Ok=fS&v09k(i$R_Q1@82~~nN`WB_F^#SV7JMs`o`h__7HcT)8UYO0r>s3
z&M6!arTDLHY^yJyUK;|JhB9UcEe|>)$AsNOi=*^J|M(c=Aj_SdhdESk0}~uZbIo=7
z-vWJ~5{^Id|B$8Y^tzI!JQB1)|3n7P^9$L04zP>o$oz(m9+AX)*RGg~gjcQU^(GCN
z3|#*H)!d$*j#-ze?Y~8V^I-K!)sbup&|Y#O*HL{0uxA68ZtJou%~R^}Y><Q<{mfIy
zX=V4uLtG*Y8%Dv6;H|0~O3`u0mglgy7<yN-_|<dp+Lcou`jHGH!@;%S-^n+j?!TKi
zMe*<Cbc0)o%7t<+ZUgRpXCOrAi2V42#CR%17HeWxeKB!xlXYVgiAGwq${QoYT+{}4
z7-m=C9nQ|wk@?01xr65J(OzA+X*Z6k?9}^-&FM5EsGWtt186tI<FSnm_n+$Pv%X;}
z*hwNp1B8_LZ>u6@u7k)o9N~`%iaYH%20aYyYkYPbT5p?Ithr?f&-f<ei`E2LAvg&5
zm0Gv%EYSKZi`F8y550ib<1*nrK)S2jHr@{uWgL=ouwU|#OggGkq!Ai~eAB#wtFbZ3
z1WPwOsDrzfAn=Yct}KUEvQp*ki~QWe=j7Z;D1y%XTcO-xDgDVwwKYXZtU>fbYm*H@
zJFHAukl^k55W-;J@fN>czd^hZw$tTo)IeN_wZCrvtp9KV-hL$nP{7-7w|E-u57@Yx
zeQF~o9Dx)zsSAd1yzE$GE{s|+tTE2iU#0<u>}F$x<zTxY4|!=?gTQ7P_!3wcXh&*s
zzLv$LFin7OQ3W&#<gQjY9`f-Lj=B)Nfw2MRMw;~kT<lAYafujF$sE`bXtc2iC@=9y
zU%kP|E5=9rrmKRd9Fk~l#P3SDeJ~*4%>X-1iE5c!5ug(*qYl4??9XH1A8FJ_Bu+}o
z?ggi`KTZ`8bpQMb{EzjiDie|3-|NY&`by*rWAu0zxKEo(qf+quc*`he3EU!nXA}O+
zKH6tmZ<|j0f)zk_Lh8S#-BnER50-O8i#00uK=fRh-dwAuDNt6Gm$^b;GoU6Sat6aY
zZ>!tR;pr9_dC4jA?;^7oQF~P+ZQ~K09=xG^wbOp6h-qP|Pt-Q9d;8CZi5?}gHqR%6
zb8!fd|Er}413O4!?ewdiV&=reWetF4g=}wG*SBzFAHhrGF`?YWv;V}|__vHLbD`p9
zl>;daG7TJ3>xZyjH<44%B5jNXmbaS}Np=3kpw9kPX2`t<5-A6aoD<Q;RJa##HHdIP
z#2&lemUKB8%+oIApG%x=%mR$vSZ$`YR1w0j>7PgJg*fT?=r-gbf!>^dC7ONZ^E{kQ
zm5o0bydiOvhCMKBT$b9a9f~?zir)atIZrj5cNBFsqSoQ?lCowC6O!1xLoAPi>xVka
z$TdGrozM&&llvHTRpQJO8b#N!C_gphTlLz68ul(Bq_Vy0uDeHIgHGiAm5g`X$K*f(
zg<XGO6}z9h<j1_QN%H+WEV1$$opDIE>H@?AOG%Z~FFjU|*@W$<bMMZjJhg5h9Y`)T
z<C-;9VhUESX;F)G$%IT2wSK{hww!W|Anw*HJLW>ZP}aGwg(wvrhoW;O+@UHAV}?G9
z8eY8gstjJ-gvZGkr4{;ZX<C+>Ni7e=p}@9dr>tM57I(1hcO^^#Tmx$Im%sN=5GBeP
z65=FiCy!F$il=vNcis14@Bkt~lS!QBR}<0>f#D(m#(h<E5g$Vi1Oyl2$2s@^BiQDM
zLa5Y3<~G|a3Y}68Fv(w4i%RFp)HAjQlWRgT^KRIzr-^+CWEhp1ZDI*{m|07_G%^f%
zCquJMOau(l`-#K~=&?p9a?Y6`9l8l}08)TVKCL5FBC@1afc6u5(3^bVb3XIrjd6n$
z<CoZmE`&@eT<n|=_b|zXjVi5{XDH)yi9-_t{7d+f$I+ZKa+4g%n(ay;nzqe;+gVc-
zK&+gB*$6$pAsLjtWXzNyLnIZ0*$FKcMOa<@rk<R)wGs-?&Ls)$=8<nw+Bee$lbg8T
z#uo6}<i_j8JoR<Y@}9z(v<(`LnP|&Nm5B>+u?}?4&aEOA(nE3{T)@Qdg(ztUhWdt3
z@b4g65Tp2gY_$f7%l?sdm!M((ROH-r<;+iV+sB`bN*SOMQtr|s+M`Ic^JGDXN;$Bt
zp&}Un>m2^TDD-yvd5$!OA=HVzmu=O2&6F`HPLM2ABNT*MxqV#^`RUEU<Q<JqpRk-s
zeelBV#7yw|`(=*C(?VNaP|4_9(Z!Yv1JEOz$~3R*0P*Pi-z4Wz*1lNtbfqEO?j91^
z#*pO$n&U?tVG_C@d)wI~Ml#TwEs;sk2$!hQ#H2o0#D^)XDVe9gYRfF_=57S#c~*0p
zfVPA*{NOj$0!x-Pdxf_&@N;=if7R`!_pdj7u6=XnB?3HWppiMA;rB<P$yC}~U3Y-n
z1FCT{g45EUR2NvJT@rO+XYrkuRvVeW)+-66cY6K~%=7~6*mjg>vpcz4+UwG_eJ^vT
zDSjC(^?#u0(_PsU;`Nf1HiSw0d*!1II>jH7-?PnBOJaPi)rT%UnV-DY-w*@K`*WvI
zZSbpdiuEa6gk)0+vM8RQkV7d{`N~OL-sJvV+&tu_|4V9Y&@yu)v7G*@y~fdO5m5h?
zO^1$##xM-IX6?(9Td@qWoBT8=crJR>cuN4KhexoSE<@pzYCaE;i?Qy=gQG`>be+uN
zN_s|le{QHT&438VTfONkl;-Pf1uq3{kGJ7IVXCWXk1;2F`)*&8AR>;o9^jnqokuf&
z=#H~q^b-K=TBQJ~F8MmlU?gjRE?Mvil@B`inMg%oU<mPX$s*@Kr2P|Lf6Fx5cQr9z
zqW60YK29N%BdlX)J#nrV+v0dVcU!cWuK!=vcw{F0v9Ec3)LUbpAfz_ZV>v=)AKq+`
zHA_D?6K>3^9VkTVe-)18MEeG)nQ?Z{rXUv#5lRnb=VQej!D(lBT)qO~nSICIt6yBQ
z4h~Kj5X}^MKmOu^H%?*T%9H=KMuT#|I_#^u>k7NYAp+9lWRFbmwk*J%^r$Q@1qPW7
zG6_IS8>gBpn>em{{wmjOcpUca5Cg+--x4vAViSY+sdu#Y#!Sh5^J&?9Vq>@dtG?}~
zIrF+!C?Gg|++bUX`O;79JvC^i9MpcE6vCkil+MMD%oToC_--1S4S4twy_wCG<6VcV
zd=q2!qRRg&6mjlJ^}9>(vz~@la)aAFUi?Yk*A=J5Zv$TxE2G@1b!?Ai5%lU_6d-j>
zd|8+;NzkWaPtX`0+=on*tDD-kC|e0K4%m;q6LeU#y9Rm(2w*u90Spw~$R+0b0Aw)g
z7uX?F&fa+Vg4c7a>%5wucK4o`u#<>+vKp|cTsFU@iDP5Xp<A@boD8|tf@@2EFU%Wb
zlO<bz7iE$qz5Kv`8VF(5e~~3yH&8^@e)T~~ss5?yuIu}p=UAD}W2?8B11q7gch8wW
zg!Tz+UW`1DIsGGCyu&FBrK4r}GtF})bGotnaE`0T$pB4F)bdd285Wdlm#?Z*f9sSx
z=g!9vzzW<Ov9fI+qL>rHKHA664fjtjWCWG?g6nprySM0ol;YO)u0G?Aw%epqW6I;Y
zaA3COZZFFEl@0+-T~rj5&{!_^X`X}7*p}1M|4&0#4rW|B(Z$e&{qU|c=-G-z1H=Na
z(6Y=<uGd5zV>t~Sc~4OHu}4M()tk)<WaP_v%WO-a8@fCsNm~DdMbXeIHh0~>s3~;3
zsPrO`=%!4_e8xvQ;_VR#2hJ{eq?;vIh&<GZmDN@%JR>AFS^3XC>&q}*9@YSvEmzs?
z?-OF(S+E9%13*ahND|3k(MhH`fB&0<J@Y*+H&v4ROu@KZTCfxGgjmgQp>GLWWx^xO
z(`#J+3GGqQY`vKi1<wx^eNMy?Vpn&A3acJrBk1HpMpZOsv`-A2Z0bF@;lx25wbSFy
z7mvrJ^a*M?=4oC+RR;xq?!du<Z+G|33l2Wq#=o9He|&gdWfwiFf-25%30l9)jW*gD
z(mFB7ouH>=b_H_&`Op5%bm)XS7riK(P(_N|i1@9wg~bmkJr*suQp+(r<CUysZD$o9
zqunf6gf1@>B#FKjROmRRnM*ZyT=B_cU|sOx;Y|H0jOin5-)M3f?obqsw3w*WyUyW;
z`r|M5W@KD@{>k}V`KgrI7KRy8``lGQ@5`<F(VNd(6s`3FJK7EOYU-4GOw(d8d>wXl
z+$Ii-Fi@YEaMTlI?l=Vw^o;5)N0fk7E>Kr+x!dBQ0=qzYsW^i_6_8Mx|CK9Np(xl~
zMtj)`EoYY&2P^eQ2-cOYg!GE0@0-srN=_#BIn4Vn68Y~Fk7j+20r>+Ov7`X+hn_+Z
z_Rk*^nYI+*v%;~>V?l0Fu)Olu-PlA7_o%a$k^bQx9VSWKLhI;KT&H1Q8LWYTf?jXS
zfW#?x_rxr^UW=s~u^|nP>+{f7ceref7%|Cq%(jZYoMWiAJ{ZXt=HB7Mwq4s;HqGhG
zL~9~XzHeuTA|P|ifRjmNdr(2T?}rZ4d<oBw_BbPwbqJJs#htsxSJhoro7ya{d>h6~
z%F38~LQL4xMj@%=LQ|HZ9eU|tR|{f}0(fcW-{cv5j26%50cGdiN(JUI((F#<ybpgv
zBo3y079e)CP-Y<-3WC@Y46!kjR06JPNt<kD-?juj-?rLe4Ri*aXq7p7Q~FomP8{?z
zV{gg?#pjcli6Z#=&uH~OOtrUVM=Tmg3>fqkY>AA+V=WnT$$@PcdG8aV>i99T?lBi?
z46@QoOHzDO;Iz+Q_Ws=Fko(&(_6-NO79c!qBEi_$N01xa)D};G;k&$y6!rsbFm1RB
z3T9ZRDj>SauVohOy1#?g0ZfhNHUJij1i)e&TYsYX<ac6lX#oOEg?%K12rMz@G@1Md
zQY?VHJD854c4$fB--||~OiwZL|M*}Hx|$+y`TYc#OZ|8J^fh&sLmS?1@)$U!S4O2X
z-M4Kmz}DP~cG;k6LVXz$=Dn=?h#g#5PEI><!#)+41UfYOa5Xa7$_yk)dKav-R==FY
z$Qs%<{GWj1`|iG(V8+Pv{~%F3dPa+hYgXt7!<H4<5r=*cz}xiuubx~T2wR1%;=EdQ
zNvJYn$Bz<d8-;0_k@5l(`r-L;WftwKYDFrM^$zl;*!vrVmQaEfXeyEZh_1k03Jo)O
zyoef%z`zdT%&`gUHCTiL;gS=VD%(raD&Q_8OMrT%N$p?se-T>REDo%Hh%UC_&Jyu4
zeW8cOEe}@|{pm-!DPq%sJ{Wu~5pfY4nvNhe^Djv`#DXmod&ai1BVbx!u=s&R4MDs9
z32kxU;0PX@d}J0^qpAG$XK+K2jiV<A4LOrv0nP`1U)<?{eT6h|n?mRAYmhbMRbnlT
z{J#{0M`<O?6u>fJaZhe6*9v5oMiucz#CqlMJ&nIS=@SnR_sbI+2B&%fzC+D|Vr0ZG
z<%Gc?(tu;A58GpWO(16<5>#qtAln{ts;sYKuK<U|vYsdZ!j1xif3v@cVLD`iYMzYm
z)%f$BucQO0!d&xNkyrfIF)g=!Z&>0k+Bj;NVq!PrY$Lh#PAMJ7xw(Zb+*h#9Pc)n?
z`p)i|2^O?;Jz9)X(JAyHb|#ZOJ4n}L_aAC6r^{9p@A74~71C3`(Big?afRzvRMv|=
z+cr&8=GDq?5V4SjE#7n-OXCqEZBfaih_j1wS43!xfe$y4kliW);Czux2wN%gubK4U
z(BECz_TBsDZI)pDsYXmQ@CYU#_93kx2(oAk$q>E_KTkW4HcK7X#abW#wybME(R96_
zT?hc>waaX2iX<Qpds7tb_zXgDn0GEFk)Lr%-?ZN2IvTsvZmOkgILYkYtwPGpo9fQJ
zSG6yuRUG><UPRgcC+;oyKOC=scr_<n01;OAobsPLho6Y38FC#l-EnZq0xHEH32|01
z0E-^aum6t&N9ig_zkD~30xocNPbkxbZ*=gA_PqC!OqZY-rVf_M@fX$Ky5`?`Ee1C2
zOQ>(6>zBYkdUmmbQ&|oipePAUb&D>m7j>Z4|I!>d@awotsgbjsO*1!VJK(679a@D)
z4OK%9)^Y;3tDYh|<^q?EKnZQMo>p{x4;UJ-<nifwN)?>ji=FqO7(a`!9_-S=u7XtN
zMY>@o8iD!@BK^?7Na?h=GY}^HzsVk55PySG6WMd0oacIfdar)McW(6!(SVlB&MOM)
zU(W;87=-%;4R~?6Lo6z->zoK~l`p^IrlqsyE_?A&`^`IsY!zbu)X$Pol|5ZJJ~Jq4
znJ-Qa{k`xD(1EZy#k&!-VR}~LZq7BSUSryhUQd|asOhFv#%^KLGs}j`ob>}?9I!P+
zj@Mu3WP>wXX+qeX7yl67$c)j&&y5;rlL0++EDPq3^d91BjI=H7?}_W7{FGa3BWD7*
zuRF;^h5LQkRpR+*Cr$>!Gs>3h7roSJZ1b@fP6=%ngHFooe}g-;i5^eQbCWval4-5i
zp~J2_u2tG$C9rXF1YhziDWeS@p|o*$&)r4iRzkhO4|@l}BGoe4eX>_&)$PPvbW(q=
z-X#+_qn5$;1phlcG(oF1JJ^byEe$WY{B7FEM<>{uOmIXaqvcf~W6qZgZrLWf4gV6f
z3?<qTnH%{bcQ#U8VDYLQm(l$KS(bhB&`hMAGTPDRP=Te%V$A0nJXlmj*b$A_iq02K
zCpNOge%218ALlCa$)$_Z+}gt&uTtX+C<n-HaqO#hMqK~(LaU{zw@r*Zoluv>#9aI?
zel(fErDZpLkzt05JNiV1T{WAl>S5?$Hxi{dxl;nFmTcRjarG-dF7Z)V))P{qk8?Ef
zrhS`0O)xVyoaWP4OpFK;z}%}%a1G__AitUMFVv+~RKkbFEg`_N9YgPfnXN~)B`RSy
z&#@u<mey8GoRMrj`-Sz+9(+}6{N4Vo>|!ecptGXMm5F7{0dQCO8_ZC(cpx(-J}P^{
zli3^U#vKOjB#}{-RSz?fB#;7KzFqNmi5ua7b?){{jmsbv$UAS04=QXZr>4sd+#r*W
zq+u}a5O?<N+lRIYKKZ(xQ}iudLyIOE^XaTxMWT_4k<HN0kEtHj_++>n*h4oj|0Tvp
z;apy-NL_ILV-twTCk`!0qk9?AfrZ%-r&oPs23AQ+$rDr6GLSq2zWrcqBTqWg)vO!R
zaAzON@{tWql-vYEqF?1w4F-xZiZLyDX#*y1M31*JL_^?3KsH86Oh+$T5yYKKH}YPx
zqfmv7Lwr2Msf~x&T1do-3|0l|&zDnRxu`keUzRHWee!2Ou}c8|MViL%qrwtB5u_2^
z^wsz2&QPm+xZ1A`MjH6sk7Kg>($=qt!}aJ<Z5DbKgBLvmfBBoL6f1@nKPW<}|HEm#
z_IPysF@*nyBTvD=8L6qxymy@7g9IvD$5I;{86>Knoy6YfiN-5F^WD4n<v&{>!T+xd
z6;w%pb;12RkChseC<-0YD05D-lNj2)gl>}!#S)$-6v={YJ913XK`A6smUsw;1Z*9V
z?G92er7w5svf8eaNH{knC$S)(gkhay?N;Y>r6#(Rv$IrOUdldW(KG}NshF^})xPC{
zcBaCG<`fsu*zTqbe%K~acwJ8SyNwXS{#2pR+*z%)S3Zvua5tHg(hGXa#R4DdN9R6<
zqM(17j)csZz07SvjZfG|^LU(7fNO-{Gkz<+>6o%$N`ND2gmGBnp2T*GB8?<&DHzK6
z@zck*uK<n55S^eeplDb-W35&@*_Ke-)Sn&E;6;ndTj%b1FzU=EP?^i08)w1dQ;`SO
z3LpDE#oFTk?kk=j^#d46Xb_Dx<C4ahvu1c#Dw@@|3l?Tl%>ppDj*2$5wLXmhRtGK*
zIq9GPf6m4y5vi;$u2)Rs;Zg=V8k7@WO{nFs56kewf%G*G%xkBRCA0)!wj(80|An!1
zG+(BB8^#+fg@+k&D5-1IrZ4Iae=<KIr01e=;kzF~oqYnA0!|hFUZ+Z&*jO~*xHoo2
zJ@JT<+i&*zEj>Yo<Bi_2LZK2UT|KTY#`)P5@HL3yV`CR?-CEuFS@2M!?x=wWwtkbq
zk@Yn~d6Avw(D<WUP_IfV=*>>b6)WJbRBIL!XMNTJq3A_xHW;8`(~Q!HWcl8j%HapP
z$16gs-;9cfZ1^Zy$72rEf(7@a<>KPUvm^sD-vlkWc80P|Ve@8u&_+&`W=(=ZLA{A1
zEZlH@;OfX8{u)C5y@?@jb9B)%14OS0g~rOg^kyx4qkX|Z+TUUDpF?!J$@LrdrU?+m
z0j^1h<q075)(|RxEeB~e3|9`mtT4z>BeB`xwQK_km5d?-8&iY3@deFSS+OvC*S%$V
zSoEm{$B#LJFhmMX{HPqH$;#4Txe<rk*+m$w1+t^_swv-sz$KaFW%p=&{fJK4rvUCu
z7n50En7p@Cb?*^=l4&Q&^neyP(KBoeb>~9pYqJ0lb<YNetB_mV4*+e_LizuemFd;+
z2ltPyIX}cub}g_xLRfBbEBL@H0)unK4D`H+!Dn%?P4{s@T>aF$UO;`K1x>`xB9=6&
zXcSGu&47ElA)gasYnoVX?Z}+?HPBlzw3YCSGOjPgF8!SlwSYL{PYA#H;D93dZbrGy
z!0W-&b(w;UmqU7a^M(aFtP(ysW6L5~Twcr)=%&9_U4J;aRxQ~LO<cT<2i6&;M+jHI
zMhw_ho@W(2i>2E>u)?srcPF&hzw<Vz)xN(NGHpwJUQoKIjUm@f?2{uftRl7}9<bXc
z`=Td9>?DW~NgAQ*3{Y7X(Gkn$`mbJ^3@usujI<TdWFjwCxaOsEVf7Zr7Jd0rpYit|
zxRxMyC;bWa;O27axqOdeb}Fs1wur8}-$02y!TkJ9J9+-tLTFN3e@I_nQRF5sY%~wl
z^DAxC6HA4vQTYI6APX4K@Q1r%AJkV>fD`rcI~&P`%YC_s|9;|Ww7$)QE~)I{ZgSEc
z#Wgi%MAc$cnJ=9a&m{UV+>4WF)*V1o`oHN(@m5+54G<X8G5-O}NQ8|YUWR#1eZk;q
zm4@c)lB>Gw4SGlWuqks@^k=Y6``mpxJQMEN1Q!g-cEqKZglIn*TUsn4qf#V$4BVU*
zG8>0ti#<tl7lJ{9h7ZRTFR-{^5~=&W9S$BIXv@cC<(5bFI+G@T;0jEf*C#iw@E1<-
zOr0T6`)x(lSMqeMRfy;?X$zv9_vL83UeIG!#c=?xjy5ta6<so;4oI$6#U6BV_hztK
zAN|q$t+eN-j1J0{F>jD{MWuWDNM`p9qZM*T*9fSlh2PZR{TDbz0G|<Wc=oulE;4BN
zgsoQ4?1}hc11j02_oeQ?$?7}<%tKivu~r#8{~)6jnI|<Oe$CtX_@j~h8YnYt4eMv}
z=Zn9TImQO?Kly#f{Ap`Fu$<65;2f+4T9khhS<doc2O(i?l@FI>EoyqquFWRUVi7SW
z3n^ff3eo;N#UXCJ@%?TwBrl5TDJ6!(bKX(lYNMVds|<1wn;GHlct!&=+4$#yZh^Ag
z?;VJCUF4+mANn`;|Clw3(j6dXJ>cL?l3rfxtB4^)Fwc4|{EpdI^S&B_{$-*-P6-Mc
z0sDxwh4On_2YcMNVka>#AbE*$uBHTm&-)IRUky8XDJI{*XMg(u^Z5`4&#LKh;od_S
z|Bl2eNNt)3zWud$8};|LD=h|MC|SHy7ZsX(NxETgE#$s=oK$aV8^q(LPNU3L4pBla
z<e~Z4b7oi(axCKaw8YGJ7eOt)gNi035O+5-3#)<`*}evRmKcgV6V-sPT(%#P(1;<=
zesQdLwIA>T+rH<hydv%@Lfc)c=Gre!oT9DHM6d#~Mn2(|C50|u-XzM)h)dDTGCyrl
z{|)x?#<JI?hhwr+c<Yd@-t6gOnHkqz&eRZa3QnlXV285nyI%N?YIHA59w|of)L{v=
z<43s36N{h13?Y|(g)?u;pe^26XBgm<`{%^e_7=!jbIT3BC9LWbLTj5GvL3NO$WQY&
zK{GKjrIiTAgp4GzO;xbnTB#Vyr7>ZVwp7>tEU<ChS*>5zvGzfm;ps#lG4(8M@kD_}
z7SeKcP=L(a&odd5Qh=%zA&{MB{EtB5v70kaOjja*J$mW~DKyxx5?7OMs3cU`Usc=L
z_8?>~Ra5}W@q<_Px-y&)BCOoNi9UNl2=5GoUEC0@)N4N}M@Bp<y;4XP)%t!@g+$=)
zw$A-26~a22HJFh4kTRexU4+1d*p<^{x5}e}I(d%fooxfHtoyVc(IOp^9A?#n;pYp>
zlp%K2zcl#D!Z*)EeH<W_f4_X~yN%^J;k5;+|FY@`VB}_1aH5x+Z$&*3E#5nkex!i`
z4nm#AgW|Xuol|Uo`8LgnAgVd>Xh7*eSp>^0NG^u&FXY;r2H}TkU@OM@Ca*aT{BGM}
zcK#{SG{3@RfvfK9bujlLYd9bMkw^ftg>r<S+3UPHYEbnm50o=Ro&_-!xKttV>pCl!
zCqnq=gsiMu$<NQ*57egD<aXdb`zto?<)<15Sg*-rBHao%O^zS~X9tRL_UO?L=Ys9l
zlghkfPjFX%$?mm2I4Z5z`YAvHVstaTHWM&DuAu%y$LY$#kUs3JxxDGZS>}Nfh<}m1
z+}R!ehCdJ3P4PYHfbr7(=Y7~W+pW;KyFlvZ?N3<^%L+L#%|vb`^aF;@DTJnhI8E(x
z&c-N>`u;PncX{CYF@lc<Q@KfWzPX*7NS?ZX4$RH?1xdsL76Q_e7-!F+!Qi(LyU_^x
z5da{nVZNuvc8_N&QddP==C*O6;5nfSJoeI71e{(d_hht=Fg!zX(HNisAydzJn)&-x
z?_b#pBCiGa-PAP$uI`*{^+C>pY*4_vsro9)&CV<xI3_*;fu9JSnqscwK|{3DcdJ;V
zb(m|A8C?8DeNBuWavr~*^@EM>pI^O!hPLYPP?U#ERoKySJ6}KY7?>?FE14j;jLKFL
z{P@>FG%IPpv1H<StU1<Bo`tjM2)NllHPcXU_gSn6*_Z*klvep6hfeF<9Y!=5SXB^h
z@{6K+;xXuby=RwtGP9Fpn)~Ij8$HY-^sKk{;5RMM%}pMX2)!kk16aD~*)5lC-#icA
ziCISVgG5jPHHGQ`*HHi)^Q#Va)%^%0O`fLALijt##eMH;V4)y!8-Zsru+L3f3gH0<
zX9dFfaxkvf6T0HMF&=MJ>deV*Bw9G1$3en^oQvm1|3^DXNEc<t$^WU6=y#3@2fLg$
z7h9@++p>%xVo626CEu^+MM-&qHC?-0y;ku)6%x^tXqrntZ7EIXlB7dM5+7z^@w+CK
zdzl-!uUBL{OjCbL?7wOM1{S(|p}%X>GsURZg1S^_%m-8A3=wHY=Rj`U;$Y^2Ne9_l
z;u$;TF}aH_qOc#J9`D@7aZgKfe3uTOmNV)WG?s~Z^#E?5rca!Do~`qZkVD)ohl=!J
zUfD|r7S4YvY8oZru6`4R1jyTGXZe!KTJ@fd-5tWUj3C*7cz9Uof+wLC5I7<KJ{_5{
zpixR?*?BR`aA68@%`)Vp8SQI|43{ImmRa5_+sRR;#pG7whSc5MpSu}x&a&^Krx}|o
ziVP267g^`!b?$#{ucRumdpbm@Caor^jtzWpew(GH!vXjsPyRn=y`4Nn(CuSK^Y5pK
zY>Kt7bQxSakKnyfCNYzN!yC;%=f<|XVG;}7JskdpH!6FTDjVUl&Y%xY3U6s<gJBVY
zpxL?TxsO%@rgj4di53wbYEB^?utQms_gh*pgV`sF+Y=1&C;OZ-;<ry<!6Qg*#Ht{>
z?OX@NUAH6aP_q*<1|;$-JNZ3On@I51+3GfTbf_qdJI?cxH$5!Nx#X*z+nHa1+wdh$
zUw(q8AF7HUUt)_Sc#yw-<rkpVu5CQ{qosx{x4fwq-#VRl;nA43L4P^Fk`O_9>g4bd
zIH5Zg9#JXc*d+AaJ<M6-?5-#0IS{lfrUF_(gQw^>gdI-Ql^>z9Hogqc79<)1X3&%#
z1gV<Ke}{khd3%rDgJo_&-{yK;K@fk!?Np3v@zkf;&YqC)TeUDz$@jqFUaPMkLNM@(
zS*{Nq>Z3r$;qMj>T|7KcqFOY;Rdo3H>LWu3Yd@AdooU+6+)4Zu9?8u=8iL1=cs}J4
zZp-r?pEgSzg7*Unc_*>9b|ekhRk_J%4gtayE^i)$6jXB3%rnJ#>j9H*T*=WAb9sun
zwv2>29?wuKv}lLh!EthP=l%Y*mCNA1YsMvT43oi?=~M}*9Wdom5v-Y%2<vvuPB8gv
z$25i-rh8614ugJ-liE8N-W5(ePO973ZXyL#3Fb1>#=vMF#Rc)z=eule%j7H7!o1C5
zka#AdTNK9}RcBrpg}K9xlD&PoajdE&OM^9NImzB$R$I3&2<2qk8=KI*XlMx-XB@Ax
zFh2GD*<(11{^fHdKfy>Ec8e(_Pm70a7=?fil2x_QxDkm|3d*)o5%REz^I{nr^{~ZZ
zF3Du51Jc)7Ui65xvlaL7!1-Hu0xKh-JBT5|<ZN|telXE*H?*2xd@IBr&0op(Re!s&
zLaMz(iw6o$j2=02S&QaN!@Wa0uW0&>YR9@U2kx}yUrdjGXe*GI*Bx)8A($fBM*NhD
zT=GM};rCDmi-d&D5dbRb{gf|Jdx(c2NQ7ehDYY_i$NFP@#&C2OQ~#F_1>h24FQX(R
z^%I3}a6N+0Z(ayIOa&5b_A=u{0xdhpVOOv*JCqPf-w}tk(*V`%r(TtG*SY}B3UW34
zXvslx2Y)+V?i~x!XiGPY65xm7ZZ|0Mr(mp?Y*YF;FkYhHsZw4k%lM%~NvkG01q-e*
z6u>TIFCX!Fn3u|C^Ohu$mPn2ACh4)#D}wX1gCm?_TrM7^BAu@=z*@sICILQORK6rc
z^V1rJ>00_vzVv|4T3W@R9HTUogC}d0E@3oLu+xt{qgSE(E=JTP4cmSb)6%G0f2nb2
z$1CAV6eE?(9&C&s*$1LgAJ94`J`=mQ8t=CVCL6m-NNpbFG9ExWcQ)R0vn)+}d-LA&
zGhZxn3iJR)LHBWrXhH9bJI>&pHgp|LPMekW>4K1M7}au@aQe8d?k{gMw2O4^gD|M$
zkvhA8J8D53JGIQ*1zlvAcG*M=<uHj2N-_x5#W#g&zRe~Uzm53d660R4!M6XqZOuiN
zysYkeYTC!w+%w>SLG~Xmek&6up7md_NXHYo?w9UMuXZ3<pi%JO1;R@MxSY(+eXDdX
z;7F`r&|O#h@??S~zr<V%0HbfWX9w1Qu)YYde7GC=*{mYg_ZJQ?c{1IRA{z!)N)pKP
zD=kie3Z>&kczNA8RA7kNwUP4=ekOMu2>x7@FPBJ7470>qhIH7HSXC*`Yd+Q<T&Ryr
zWonxIVf-GFEyiD>o|A~`uljh!)#dPVp|*FMQDXKy=+A#lUNGJ0Y6~aah2IfmLWJyf
zDAW>8B2x4eIxkPxlK_9q0ukMY$09IPV~-~Ag0Vs6LUmPm*J}jbNGW;fUt58V&FZ>Q
zmo>fNx}A(xLV;u`xdThFZDKDc)qb_0wc&x598)KlGXK<P1<k$yKL*D?0{Q}n2P~XC
z)!0QMN2_B6zD(2~kP3VV?UhL6MXp+Y^lE$QsQEFW?qg(jxzVP;@9>Y~xjcfE#dq&I
zQ_P$vZczQ-lv=T`Mh$2fH8{s$AVjme?-UzkxtVP%^U9jc_SADsJ<X^eU^p1`Td95j
z)MYs!;tF!aKgvSc0LP`hVWMuN{91q14?-#y6Gi`$Pn2}7XBW1x&}soD3$x;Aj$x|P
zgj4-B*hWv>d%umv4>5@F=N9Edq$)zb?p$*i#dp(^!x~478lnwA879J#Pt<QQ2q5bR
z6W(Vz?3ohyYv7@_S&bWxwMIDG(9$kLN@~>J>i*?F*09zWM|6A{sN58uFz-9o-PnK2
z&++gMhNdyJbzV?2{D5M#=JIAq(b?Scj)&(6rdoD0&ylnJm8m$iBmpA<=TcPgB<CfY
z`%euHsUTTOG3iz&jTi?yuqGVXm`F*ZUL()<%Wc%#MW(+Re<{~(FH$sU;<q9*WvVwy
zF&!}}FU5)tCEq}7sthWWZqo)EqI1nkY_TE@WwI|=tXfuQ;vxfS)$<w&&Gz==Swq7H
zTjz)9UpZu*$KP`&9D5C7B5H*QndoH@Iwwhc1tZslhs+T1b24W!&0&8@k}z5v%0-hN
z5I}!-U?eDmxK_Bdm?Lj0Zs`}sW-1FL>ghxe62WySLxU~?oEO(GN2)_qt&V||#AJ-I
z1fu7IyjPNW;(XlJdy$qb$WyzBB7;=^a6+w#J~_b2518O#3>MkjM#cYg-e1Y06<T<k
z3_3Lp)Oi*Gvf|;Rn%-UA1$Us%)Giog%5wBEnM|k%_wPiLuR^Xrc%-=8lHdG2(y=oj
z5t#NYQ_2M{=Wc90qE9`lzSo&fKY>pEBWG!w&_fCPuE1GS4C&b@+ZxOd27udJF?Pgp
zq7<F<>cHF+h;<Zw`YqWm@p*P6juk5?OYZ$+QTFOZZEvePuP+QBt_`+?6<}DdckYwv
zO$dyCL|K%Pc=JCf@WzdL&?G43jw;3#YG%3Eh>KTGi3QqbxOJ5CBDf1EIID1!di*Kh
zWVDrm*|-aWKW+d)&w;?mj{^W=e`LSI0gmPXAy2Xur?-ZAm}4(4m(Wu4+WeWjb`=jU
zWF*9U=j0;RTf2trRb3E+0jR()C%Z3Z(_^7kucQBdm)0X(gqG8`w9?+CAdLwDJ9m$0
zcH#o61W5f&uBOp1`Wa3>n4!-PV-<|d=fyME6+zTR5)`HxDB4Nme+!XV%-yyyf{kpD
zrQZXnOf{I!)#gbrFX!FRbg1pLsHpPmvsU|CU(dE)^S_}46rBsP#p-JJ0gh*Q;Ja#!
zS)tklst?QhbV(Sa+k{(-!C`&MPq{cy=T}EWKVUsQTtmsLRyipMgUnNW5NMbg7;eVq
zYM5-){I^1z+V^)089&(agLH^xN@-9;6SG&GI|Lc^&|BI`K};sm(mFVN#mBar(W1V0
zrRl~JzX8eTgKlq7(fV0#<$UGEj8l=m5Zn}B<F{ix>-lD+-~@}~T>$^ZTgx22LI`_J
zF|#`VlCYOrvSRBc5i9N;u5e#$985McWAePl3fRALKD))3(r~6>!rz)GsGaN6J+C@E
zBW&-yi&mV|m%sr?ZIR#eF&X6a2^ePM0qh-wR1!TL#Q?W-<$=Zp+U|UC+8SE~y1PS9
zs3<<SfNcAMA*BP+!R1HGB?2K(g@1W8;@>np8axsS3}z?sWB_)-9F66h5I}!mk1Io*
zRk*n;mvoR>C_$FcBLm`iz3DvuMBQAVkja-KS%mZtL0Rm?_@XVqy@Q8=HUxrWXdWFH
z`;4FjAEouV4h<)><~}!iPQJpM-X5s9G6pSKWb+6;NV7N_pcruBsJT=c{7+{9B_t(T
z1O*hUwN3IU9e0XD8fbqe4@lOALRs71K`nPg_rt>~<OzyZSfDWd5#^*AlQsat?`Qto
zFHGXdW7Ptf5xruyI11jwiZEVFjK)y|;1<F7*eIL+-S=mO5Iv)vBWk{x+}AT%YT%%l
zcIc_Db}Z|!pV29GMh3NO^x^?((t6A63f&yX1E|f>3ZE@Hz%?FWQcJ-he83_BJ#&cj
z^iv%{R$E~WEd>0@5(;f}%tfHo6V6*N(emt+mrUbuH~o9es0-A>VvUuPG%7GnwyG#X
z;1iT!;BP}zzR3T0`sV03n?K%UW2dogr?G7(jh(cy8rw-@+qO2gZQDs>+r9h#?mhR<
zne)u-oU^;n%zQsePtvFLd!@W$j7^bEOxZg54qZ@uGUjs;uy=3S#*RB5#z4l<xH}*V
zW3=pOiMGH<jx=8;vngW&A}?=z16}hZbR!BR|GREqDJg^G*lCE8;9V#tFjgs03l5%O
z{>-SXa@#wXTdO0#8dHnVjU$_y7PEBQ!@c#S<wjOcG5bH9HT;HTr1J=LSfZ!V^k;0O
zH&+|D&v9BO8nrS+#pq_+zA2wf3!=zpV#y}%l&hw!BUI0wE<pr;7{{}NeSpCqP}jT<
zzn%$W5+iitOXznNLZbI|fbz|>4rr#N$1zhMRS7fP;YVSkhPbWPW3l>qQAq7}54d#G
z%AXL_>A@inn#1Lb{DXV7z}R`6d)n1@9g?`VAO)Fr_oL_fv@Q4g<7Mpt#A-l{Au2q*
znR8yRhHUK=z!{`z)mwk>J)5eqgU-0VgAnDXwlI6U*n{EneK`H;r!mcz9Pz`kb`DbI
z7Y?r(D+2dmqBFD4jhokt;uI1k`1V5^;s*YbSHp?Ww~vWZOv!?2^^3;Sbx}DI(x*Tw
za?VtCo4!W}p~?nGG!xv{MLlOsNI0&x_cK$`jA|C7p>r6np(k#EwJtL;skSqzHB3S|
z)WEtFVP)XIVWQh}(yJ`?UhXS>FgTeL;d~E(Hq>k@6Yi0ILm!Q*C5f<5-QLzy@v-13
zs3WZZ0X1gsds6_p5w7^KmmYG1*gs;$s*<w{ebCQh1?EGkpwA<JG|&<8dYJZ#A?vxW
z>=ftb+Y4bF@8qwk4)%a=#GR_4Rvh(MM4cmlHCy0;D2aHERYU^_Atm0%&-$i*+b#rJ
zMz;hLGuzj6rLiwHBu0aOvdUMWd2i}wKUBY`b<@M*NQC3*1ArF)cn&Q0=HWZvdGIBO
zqEp>siZ8<R#mN3SS~2O3@;)K%s$QWMtUAoBl7<Xos#}FZga!&B6Tc_p5;1@}%Gnz!
z;YcPV);mL{%k|(-DIG1{J4`&4R=enQnSTq-FpSV(^1i(9nVl8yq>2K<^zbr$%6eBY
zp5tM37(fbXk!{_4><NcB&^}EHY6hsm=Zc-(V4U+iZUQoz7sS2^n)rz5xvx^r$bu`N
zq?Wb4+CVe@Y-K-s5{0+Gd$h#i6X#nK^|ky${`k*%QujaSNlF!VP&{Vr!FwB7Ivf%=
zZeShBMR$k36H+EJb*QmwXk<>uYks(q=kz>HW0b}Pvj;;hG*NZ9(b<b79^N`jolYFn
z++29rN=yJJ8*|`Ukl>}Qg+g%0jtbtrMZiUGUc%=f*5ZCfnDk|5kUYc99Rj1$tiTc^
zjmx<5KWDjx{?qT`KCcZ_q6wOz^UKCL5O`w=y+m-zXUX|*SUiUuP4-rM%;r5hKY0ch
zpB4FlGH(K*q#0qwintYmCyFvEv#U|wMSd;eo+gN9lvKaSvYd9h->0Y)@hcP{NHmOo
zlnoXLCQ{w`^WsXdadvc|$7Fo#rBXNqxWHn5`RmUjRpyZkd7yFfn9Dz_`_bv@2Cu%K
zQOr;Bs19uRuUfBG(QfIb-Ra|cV3i{NlF1`6@t=jo=yl_i{>f5`2=&=9)E$BoFuA*@
zgf25_DW*_lk)naNngG^fU9il3Y?UP8^HZ(b*{*O?aULD+E~}FDU!^=L!ffkFOQB)U
zo6XjLo;6bcIThH_N|KiR8;&_%3Gk#wVu?}F=&!f_UAf+MX#N;z@q+?9ZXYZ`af>60
z(naM)4gjhVP%OxF6?(i6UB2VGxp9koZ>sV(2wu$1dA8^h=teec`O@}0H{g7yNf361
zd!C)XLv^WO-U>(@-H>=z=84_aVA@t6&q}2LKkY+;PyLaj@Ssh-Y#R^BWM$NhME*T(
z`%d2KeWJG`@f(H}4ocP2;AvSBqZPQ!Zp!fr`&(r#C{r1~Dj}P~XyV>ld0R{+0fCzU
zP&x}|G1qI0FJ?`nVUW5_9pE-H-C$kU-bsA)+x?*`MjxQb-!ojn#OJQXjop}E8oey;
zi5$rBaLBS}$ICx+oV_d#jt*(fVkqvEROQU*+i6KA1T&SPi)ckp_+{7Oi{<%@+hv7R
ze@!<f45gOT44XarmE)v#f=aVQE3oN_=H6kpqqr!Tq-cbnGJlj=7S8?&*+kPQ{H^U1
z5B?vnTgTz-I<acNQbj7fki9R?2eHV1xSk9M*TdLSl`7l?5i|+z*+|Oa@$<^APSo3C
z{h9_W42NAAG(sil^N}X|hvWjk$_qPthe}Cp1!H3yzyJZZ<XHu&bhO&GXQ|`0`qo*U
zdN|W41M9j8>IT9AsL&E=^JWa3LoPi&w4cjOp@XU&7;D;Y4hySCzUH@pLH7zIPh$Q&
zuMO?WF)meqoSEiR$Vd{{0UUG6;3{pfbR#`e;TSx`bvLCb{2FaAT%<!TiOvyxZbfTg
z9R|xVn=R9!y0Yzs-m;lvSQ2Qu0wlCm3Fzp{6-R1j%>U+VY;!ZXPt(A$uP!<VAiI}L
z)w#Twj#nURQ=Yc_L*`hTDh$N_Tz$NmjGc#~&?3!1YLUId){XJ4k)WM~;$M)=yWyA2
zv{^Ym=)$NY5f|mq-z~7Mw1`RU0p2KLk>yjx^Sen2PF25N{BJh4usf>rNmp9#nq1kQ
zuVo^F-~TYDSHk|GBQ(gtYt{AZS`8#eYSx<>?v?K<Sob_#rrRePT^MQ-_~-rz1r^8{
zU;;s+M@_4Bs3VYVhk>6w^kQ%~7%LNol}fT`kAL7`Tc5y6yj(_q&*m)c0~8j;_|zbU
zunbv{-Nuyaa-VPwJs-TW3!5O4$njL&xe>`2mK7dW)YL?`89o<WIRbVXg)WVADQV4#
zja6~)$Z422zS7E89Y!~w<Br@_<vCWGc(+0!GV2Lkn6)iQRgJC@+AHT&Y#}yh*rMX8
z4&0_vfSN9uPDlhhp6w%jd?}Nj5!xDO3?#Y$LKPb6eyS+36ye`O7STtfsZ_+qS{J_u
z>_Ww4x*0RBPiFQt8!VtNecVrkA?CcDSfj747F((!WGJ){>t2S10K~*p<w}O4MMj_k
z*<}ge6`c+pige6W@Zvu?ih4T>vgayxp`7PBC~Z|W{qa7E1iO-4vBvW@#z&w>PW6UK
zrnJ?(ux>WP_x1a**5GCA!WiaqmdQ-TK`EE&>@(hPR0%rl(AB{QzXhQ!HH2&FdDA|C
zb~UnD2PEjXi_fd3FxC{utn~Rx)=!12-n4uT_|PV(Va<mS#1A`K?(}~lGR5T}Xzqp)
zLyeE{bt(!t1*pcq_r2Iq8{LqsEh=)oTB;>A9c7O8C=ROGlzqRj1Qlyy&5M+_A^&+$
zjaad8+CtD_;h#QZ&Ov$-8z^hA*ngY&5=(`AeDLxJ)8C*Z3}J`l-}xRSUkdl}RKc;q
z#FhowB(~zIJGS(EhuT48li61F{Su=zFz>g+YWR9@gYCL02ds5PUFvTrMX=V=^*RRQ
zkuK7kxZ+y+Lb#;IpZJo^vSX}_|Kz~vGK962nt`$A?jdQiYw;20OOWGFt|u?MbDfrM
z+fmvI!d2$$N!zoSMp)|C-Ca~SOOeZ3bX!#e1qTa3gGF%ej~N_LYs~Lm(ACy4yGp6T
znlp{xQjkfmwMs%WT#2Os`T|R#U$>#Q+-WXQ_h1UU)<Rb#*NCSl3j9}*nkSI$MB?}%
z%@Hlk-CzP16IOsW<btW-V*N{(QKEBrv$qU?Y@TKe6-h}dko~Rg@|-Nd;IJ<58`V?_
zFH!2vzkH#jY~A_+5=5~UaRQP}5G#%Mp^$%avvuLi3MY{ybNtQ^pJ&3RJ<)PlwbEdJ
ztGd1pql_Or8A)=noW%IpaJd~}kpZgJI&Q6qi+e<3net#a+~|lfHuDmKodGJ%N@eNh
z>{MR#;uhn0dSgh?Zqr-9beZrD1N)boB6e99*ObMIiH2BYH?p#+p7;F|V=pkMEYzWp
zTY||<;F~qFtN%|Jb)?lYE;+BXJUu^%dEZfRG6tt}K}#r|LWJLopWKzmaeH|cr>kU`
zls=nQEJGKBPnP5pbk6A3TkPEQ>6Nkfo-j1OpQ=>M;?#9$-i;=Kw!Pr%I)@zckhLLR
zBYaI<ts}zB9HcNpk|lHojxG!~3{YCuaVyR?M>MolqtREF|CHpwr|}j!cGS-!byChp
z-9}4GP1C`Ps~XrpPXJw9u?8K0V2*R^x|>P5J;y5pd9SlQ6JpJ-2*uN)8fO$X@R>g3
zI$3=kR%hoA%Kn70mFGCfRwIqo*$^qWc6g@0vF{gr*l#%TZQ`8|q~^WEOn(30?~>N&
z2grqf+`0#q4GG(bH;EylLypr*leX98a8>yz&D$+3A|srIE+pNIVr`WG@#cfrVbRVN
zR^I|L-n4;a1<Z>p>e~DD2d#79w`zr2Mf&F-u`Wi}1mr@0$yIIYhWqe6acAtG&+J8o
zFr|xDg{vOeTn=tpeXVX7o%0dI6Q+!W{eTxvb^JWJIot0NX_HfSJzVm#-Evwsgo4AO
zk>ULKQdIW3Vrfb*0uTBpBYMx(!i}cwMkgDNk@2FD=_0r;;KT@Q$7V2u;j;Nd;t@z*
zT{;aLh_%<=^s0=`fuleXt}6a!?iZjZpU+<%u=7zMtN3t(G1`=BFQONeWtVsi(i4=g
z^6qw(do@KJQ`q7!U8E4v$uu959)Vs15gDfDYRe9)qh*6-w*}XiB`EP|#LVFdz&T7i
zi|<6MW}H`~ZNtKn=5?!9J?BeY9DrLQCfcwS5;s5f@#U?hXch`GoB;nL#n#m#-j@i7
zSgs?C8rl3VhJ8&6YsgOhM(pcN)6q;3CIXTN!!3_|GB*#_LY>OD3744CnoJ!KueA9f
zgxF#fNBRE7Qi=1LSnq?`-X<Wlc#`H1RYCQNJYK#aXT>z=ccIUCf5bf8-f!cGgfT~s
z|3IWnw}$Vxyxq(wKCpCF_^W;|4K2X<Q3bn+_xAe+*`I%u63#jQ0Ll)Dje`neca|2V
zwb?(=PKUoGRHGf`)0gi$$_~f^|7Nyk%wNnGUd^U7!&$yH8`6B3&e2S+!)z;+zJ;Dn
z*2r?|VHVwN+G*s3gIPsR+bueBKZuucFsth`FAjH!{~&iudSev>9c1IB8}E_2{j3pz
z1-lz{bD;k!MjZ6BSQ8wN6w*17l3t!oslG#H_Se9@RhqsDRKbJgrG5|CGuQ4Fj5OwY
zt*uU#p0x_<uK_iyCj;ji&0nrN@>IY;N4$U^LF9-HNW-po6hSypx9os&=!aJFzl+<X
zSBvu)Z%uih78S0W-~A;hznKB5LrS;%@;4Qkxg|Ro!N0a|NEpBJ+%NiUh+7Vh3FGZ%
zLHjq&A5m23K+Ob9$SXhK%AQZMi3zhX;@o=w#ntoWjr0`cu?c<a^7ZYIb-4MH&|vbV
z*K?^lOVZ0XD)Ih1;VCWsgy?K>B4Tb0pBX&jJ7FY`k?7x@JJnF&ooM@}$y2gtA}f<D
zBl1Kum*@avkE~(Oe=>dnpTyk=&#A?RErs?CLlobk8Vcu;rC{NF>c&gt2hoj|GtI71
z{quwQwQ}l!(}fNIp3y<Up96HHd&$%`vxY{65n(@vJ3@oUHF9cb<+8Q&H9Z~p1Zv)!
zv2&^|3A9-&v}S%_{&u8<>|7tsK$uB^|H+#o&dQKoR+Jfpl*+$67A8JIgsu2vKDrVJ
zXG<3PDU~)zwq<2f>Z7^NB&zaan|!CYQd+zd(Rge{mD<SJ-4s(jlb@;>X8RY2w}Hs-
zII2`9Dd0#UJ8Jv4F9WCuBk_71D&V^Z*H+E1#m3Tm)+_n6PivLGh=x=PV+~z1H_^OH
zhEB(j^#b8uRq|t8MLSgF)&qTMM~&l2e3|S&KfpM#|NH>ym%d?w%1|?_J>OVqE3f3m
zekdO!Y1pss?T^yIO=ETVA(i1L4#`SQXYP%zz;ZpmOuys88@b<xp}R`~_Cp%#_96++
zzy2`t%$#NkyYDgBob=}3r5MTD7W?9U;Gw%@SDerOLPV^z4s@gihb<(U3Pk8iht75l
z5?~g&72V{ukqcIqrcZ7Vfj}c*_7<YaPuys9k0P?@ir;kyB3Qd4XUL*ecb|Vu%&zoo
z&-_7IT8&+&V=gs9gp0x6{|H@Es=4`<d?Uf~j7Hn*vBEGNh5gvL8Ba1F?xVw>xJsjp
zopT6S<|KH-vs}qU@|*GYrG%9>DczRfG>R(^A$9u(SKIwuu5p2fU#<6=sKLkC<8`wV
zE<Q_;xLT~KUE$d-my>BlhJ7*2p-&GEt-mWVE6+>th81^&w=kLCs7gqY6ZBl2Gs@<r
zRwfG(-%qJXyqVW1W7N5d$(aJ>Nt@DTV|w<8@kG|QUeIP&{2-j0eKg0YbHZx<4pQFP
z;XoVHw98S0K|ntlRtY{7_M_4ofaO!@@f`^grMS+qdoQ}P{PXUc)`uZk0^0D(n9pj@
z^&ZQ`!;NYbx7py82$xgSk6!wzJQ?!%drv``YSo&<s#|(r1`vdhko?0KsR!nCVcq#5
zmNgobJb_1-aOWtDpsuVxHXe;#-qr0Gij7S-jHQt>HRMGcJvmwcz?v3pNM80=CD2SQ
zk8>byikO<%P2+WeLx0;zd$ix+a`faE7k^qzS-4_uL%agkm41t;Jf*aw1`IrI)6ysV
zi>tXNC@4(qgaLC5+EmG5x??YSzeQfzC0kEA<B>}Xzk!k!N=~$zvb24(?U#MlucvGC
z%LBSh+_^kE2yXrF)Y>PIbA<lUF9m>)x1EC>@}T33Kj;IEr|(DQ<NdkSTwRgW6duGi
z(DJder6@_Jld|>IjJkV6IOSyvu2X!y!+qT=M)RdTsfZ6=reJAkem&QzoD)`C5{Jxo
zZMgKpP9}6j-lSM6XIHh<yt=mGDJzdp*Y4?|{}pj08(4UH{f|)&x@cqA(gudl`<YJM
zT8pru;~C*72>%syJP}Qfc>%?4JTFR+k)HeDBh-$;8JZ@M5B$;Be(c)E)Da$BdFjjZ
zU?Yx*pL23QVyOF|*tf1T5t;92p8Jv`60U}#%bBzxz9`3I%B#+{JNmB~?1ImK!Ad?N
z=xcZmKvzQRhL(D}x=aaJ<mV5<XmwAx;gG%>CCfo7V}7E1I1dzW#P<}8AcZbD_Jq|h
zTUHquzAD~az1ofg^4gf@mq{Ywqu6dYDiaa?=zXPp*a#HQLMj%6G8U<GhCx;i;G%{z
zKX@f`0W!&Oc8B;*@qR^ru^Mcf@~+hQd{@q!3NOwtI9tdu7a>(@6{XKAPt;r#u*<85
zop=g@D#5UDLQ~;%$P@|l{D#YiUnrcO2n#f>Sm*H{{m#GXnTlm$YvNJDy^f~+BP+By
zRt#a2O=h2i@EWJ*mvie>J+*$>q91JLxm;E%B1gYvTwx&5kradw<>jh4<LvYUvGRT4
zg-rs;UI@p#*y_Uzgcuz-{h3d%Kc`#B*8xX2nZ40>*!>ly*u^(0TQ+?N$5Ev}mu1|p
zW%Q93d?KHtEOz%xTPR8EF3>2S_8Y1nWD1AHC%c^x^J<F!C5#9mpUnjHjR3v~iw+r1
zHw8oNFXxS2))#Mq+u@Oy=FlU%#{i-(kYT4jwy!V}I=qJI+ZPRZr8XQ=W{z005<20p
zok5NZ+1KQ_y0He!D(|gk9(jt!PaMd@_tT;vg@uVLU(CU#Po~<W*^#k(OW2#T)*+M(
zckl;UVXr{TS4Mh`(at09f|f7JywAB6kl%od`pdLik1kwOI)9<$$$rLX2K4Le6aYSd
zXSvCIadm8v;!y^>7zPi6(%FU=hr{Ka4m(tPy&DmriU!W(da!P0j<hZAP+c4xrSO-9
zv3SDR(rJyq-+tB}_!N~93XH_Gn{)^Mc*cLwtvX+$Zkkyoq7TfAsy==bqNH%-HCuM@
z2pYMr*YWO<_3raU3g_xO$<#HZHi7U$#2O3vECnS*aQwe-q8gOoOO#tl_Ey5s{)?a#
zub1MZfqIIo`lh~d5?A%4aH?De>>yH?jXL|lEcm9sCLy#-4Kb&;4!Z+XpQKls>WUAF
ziY87*!{hHd;aExK9_f0d+TowqaW!|ztHHuf6Rv7cGu@TlKC($#3q$5{62+iaDmI>9
zbpF+cu&1`UU^Y4<Rg@is{&h|J%>><(+XD{?3a$aIF3tKtZu7tso6C5y5LU5<lbuse
z(LWEXdSO?!d++zN{+nKRkCMgS{Almb@2w6$eN6mx;lAZ!(M6Y0IJ4dKpS`T^YABFg
zh?bmo(riQ+r#?*~l2T#>-s$0KcgLD;S-7n|mL@5~j;mRwsp})bT;5&3><rGr3E%#}
ztIQAXF4du1@B{I27c`iWIhy-WsPZhZF+9L!PavAO7dMM12l}N?kOu7W-<$~q;-UTW
z*2g}F9$wrD(C5WG=oG-K)49UL<oqv#uatA7f`~Gb2D;}ia(zuM1{p8I*|o6O{8;7Q
z<A(f2K>&qr!q9)I1sJ82XCSf-&os7G1t?~gjt>6efY&B6ff?nl#=x^MVi6f3P1^ID
zco6zBF+XleGz=yQB~D-j2_BAOtR|ho!ZK1}Eu?_*Hxacj4qE~7rYAd0^FV^Kuw2|<
zSDcFqIlfjNlsMk?4ulDjX(Whe*ImXnkO4|_&z2E?mUt@m+FUSStv?Iy6NP@BAedSd
zs<ovXLDP8(0qurz@sW0|y29UIhvssU4&m}!3A`DT^YF)Y8U=hlFGQ#khZR<5W-jAL
zzeqk15v!DPcNv|@#w13gSVcubR(1;Iy)UUARwOV<*|^(Zi5`mhEe5Vrtpjb!pjg#P
z#VSd`BlzBoxu_ja3gi#|#P%Hs+YD?&e5%5A=aZR*G8N)-Hq7#&h)&5WBRBP$$!34e
zLBWq;af$FOc9c<>7;N8~4%-<`6v7SXZ>u*Wp|8U0V=$s@ytg+|_>MSY-$6E%+b-Gs
ziJ=!UU)=vXEQP+7A;t9o+otW~`Qhw`*1x;_A48V61}8YcNUj$b@skUy`W~H>ABbm^
z_G}}w+r<ag;Zb+4De6+zbAl+CcRm~zKk+Jd@&|2Qcx%ZkV>eY7w^s)wWM5SCuz^mE
zm^iv$N;yJw;mzkx8Zo<208*RAr6DrC{Mu`g?UE2O4%a2gmCSU?&S@8)+bGBlqn2t2
zQzO}dJ5Oygd<H!LzQ3BDZcwN5A%XVS8O0ZnO)zD}QCwT2WZff3?8Ju4DBQ6;MXcG%
z9Y*;Owce0>b^HWV9GV?&@+=#M{I?AkKeueFg*!WIcqE7W&&*W4trjzNP@?pvdu<Xb
zyOmw2ZAEZuYK)6UY;Oo!fux6Bi9;2(GV=FaR~!e=eS~Tl^E&K;N`ty0k+R}oJyoJi
z;J@g!V*tID*nBHmK<VAAyu`jzz0o=6JCUrk=pR~?snxteDD)%c1NhMzw6>zVQN*ND
z^)u?%_S_6x(S6$3$<-W~;OTm&>aL`n6yJ>|DKqYtU1*=FFYAmh#w?34>&Ww?M07U5
zGGr;|SFXn0pL!?0K#<9eg&b?%+!wxX%sUVv1J}}@HRC4idCz1gA5m{r{rQx%3&@fR
zS*jvwq4fB={jWl2eS;nDF^i6zJV_G6f0l!Gh<E3h;ptpt*@%qS;X6*z`nwX!BQ~E(
zZ{Y0$n{kJ5KaRGBK_i89`u9K;huYOR&UZZ4gpCWC{n`ka8LhM45F#tHYM-?@NJ_O%
zUZhd))tqtMahc6jsB=s^rn=_fWP{q~!xBhC)u8VR0pMY20O4#$G_4(g*AK2YCg;w{
zDO<K+s<5;(WA=x6_wrR-!OY4VNKI9NuoA#<BX0bTVN$9~F2}ca=u>B#MC~?#*E3#P
zIN3r^lIY7T1-Y$O3H@3h^rQT<e0EXrI8l*9+ie14xhkF$G419KX78;knJqAWw4;2y
z&78BeP@|L2z}_qB{2f72l#(_QZQXy|J8|#YZ2<|p#uZWv@@qGCVyPVG%j}O!=D+bj
zT=s~htrE#pZLN6PW!9=XsFyFVnMx*vhc3nd6GxdmxkifzmQ_)O>43yl)luU8Gf>3g
zAq!$ZNFQv34|wj;^3eX#&yBY25)y~N3UU96B7ojtCpAeZ@VonVjCx!;jDHGBP{83k
zy&I<0ADIA<y-0I|B^|PZks1w-KreVWw|b?b%V@*e+ebhy<*d7v=z*mR*E1DePRnj8
z7(U^1j@O5YAcWOk^>?#_pAGG+rxV3+P~|+5NXTa_s=?w*F(V68ySZ#`FiX$v00Q_M
z6zLH-pNh*QJRdlVkPWsNFOfcUTO0GmDh^JB$_^(V_xcWw_zJ6iLyQ0y3eAAz0**9`
z_zr!A`~y1Hg4zM8AD7~(NtfCXIfZpw;bvuhRp<(;u3QUEc`|<(ltD?IHe_l`Kha6x
z@pCNnEKN5N-ygBB9x_TI{=Tw#<Xe}v1ycR&Enz~6$Eb~HSSVCb)R7Ubus(y^u}10d
z(%)IkBOq5nb~$?z<$mM+J&6`<Ybgq4bM|B`b{t-}6}p@m(4#Rt4eVQVv2~0RD1v#d
z-J8w*dlEymQE9Tqw;T&Ltv?a@-$sE3inj@E`3au_inrOj=MP{<$2Y>GZF?|;z2s9*
zbI|{(t3$PIYI(8(ahqKsP;Z0j$DJ;NhS1%#56&5+SnHyPM1o1Fq)*dMWMuk0+|VOD
zWXZ3sjxjnxX6$qC#@yJ8-synWq1?tlTtX{XiZ2Pa;Pc%P1JP_K$YwPrz(NO>v1P!4
zEBYg4ghUg<Xo#wqBlGOHA4b?5S>Ho{eVDqVsk~>x01bvX+?y>rSxNFb0**$47-QD(
zWj4;DS$mV#!v2Qy<|5Qry?YuGd#J+wNQ^NBOEh3ii+@tmOp~F$3I`0pk01PB$NaF}
zTzEImKIBT@K0Xx8k2(4ZSwPYG#s_bDEIfwktt?009rU{Gr->nOnpb%j2b2w|dP1}d
zyv3CdJpqhpb^e%Yv_zl%3J#tV4E600?EHZQxg|4VT}!k%{6+a-O@smsJv$rVX|un^
z4*&3LP76o9<@E-dE8B4LECeF_A2y7as{;Z$(gB-mKC(rx|IQ3X^HNYxVLZ>>e>Xdj
zrwYybd<Bi^zi7r0p>OEvfH2a5cgMETZcDG$YH{wbMPH)@spuaG4y$~3C9M0b<e!TP
zi@069dv$KRNR?nu3YC{e#qhp8!2_;!_#p;4V9?2aC}%^1j*Z-_3PJaEX+ir{o0c(f
zeq9H4<5o2fs+IyF_P)78qsX1KDQDWhdUz4e!;T_PDl49`6!CwSe#g>RoqdvLkctf2
z5*9OI&6CLbmA`qO_*t!ra2V0&9}9=JJGkFeb`Tx-L%wgAwrK^<FD+bD^3$mB!R7JK
zyTO6PjRNVJ)8gx#l};i#0?hU}C6I~fOe!kTI!TDp0Wo(xWl*Dq`vGZ{7q47sb)u+e
ztov-RaCa0ILynn+KBpd?bTZ!_=fu(FCde{J#>nTJuTN`xjG&KOCoB~Y@>n=(^MJjT
zxr7&3XVBS$bRGpTiIMLOngJ->uVT!QirvR$%Y6~8UXUW~xV<9ViS@A-{?cS>U*SP1
zhu%vbO;x%p9{hTiTkq7D4B8z|QWpPcJof<ixW^s>*lF=ekaVCriSg5ZqyEghEGD?<
z989v|{THdzG&_(8ep+v|1A>JYx}L4cBT&ds2;m4+C`EEoPJJbD_)O{fOlh4rzb6<e
zO*lskAjG5V4>K~V1!hs?crkpH7-NS)y*44y1tn21;YId}SQ{j&G=0vSeKJf^^i5(#
z_ReJ>ijWhu{scvn1pCU4I=ZsoBjC>07(o`<%gmMz89Ssc05C>=dqLu<ChRIj4(u`r
zT&L+Sd>J}H?PPPSGeZBlWlp5-+8U{D@rF^%DxbJ5I!UVFgo;+#&+Ltjw1{^obE@4!
z**){TI)hZuVt9e(W<+bymn*x~4CJTw1VncAm0PGLNAv2`@t}=73hgR*pda5tFmgap
zm@h<#o!8>6n#crFY%(sE^a_<6f?0b=Xvzl8ZZK|^7>P%9VF+HV&u9G-3G~>AG(Ek)
zDbS4`8Q(bD$L0}<xx{jSkS??pPqcZyVk3tGShu9%D@KMU$2I3=LV7HMLP{RR)|&py
zuIx?0&?*GQ9n`#vjzzQgvP6Ajd4ECQa1))(k3Un)(+<hPoD)ApLYr>sly$LQm{&{+
zr{re>(yl5iSH-92s}E}<%TZi*>~8iOG6UYCAjvHQ`y!^0Dx6UhhO#4JSJ=+qb&)fP
zF^*W2N55x5OmPG0jZbQ;1dfhKcebOt{Y@>9;OEh_C#bleAG$Fvp#vQo#izHwYrQ-t
zvJmCxdpO*nVdsu)%tl3*w#5s)Jme8P+tb~+XBsoW1QaYj^FbXmh@4Ao@dqV$>PDE+
z6jajw&R-tc@U8KYXd8#Z;gE~-+`Hv0^3psLqi4K`;icB<x>@H~AKL&*IHrB>W=TGN
z*;Dc_n;kKDqmj$@6<Css;D$=AcM^$WwCAPhC%F_rxo1U-9C!A3?~LLL0;qZYFLdle
zfT<u}5WvreuD&`{lFgE~LID*_k5L47I21@Ko9Ua?pQAORe=&0pG`1PP<MR5|r^CWY
zSvGK!qwIvNOMxjXXT=Pvw;sX<f&@jh`GJbZxvMvCp{pQ~JPf?bA@e=eoq6+t>^CHN
z@4?P>b+&AEgbU+HQO@Au8)4e(6kdaXU2FVFv-)0loMa^NtnJ`0S*hT)s@L7@g$(B&
zi@Q4wghgZg%x}@D99hb@`*yEk*y|5eX5_G^Oxq@b9aixAM$hZ3cH-0A8qa}1JwYZY
z&svGRseVRq^f(xtnZ2PR&_5I_fb(fLE2wcGL-6QmqFMN=3AQmnC5WV6NFeTTazw%_
z|Dm8@<HiOdj!W{dS`9*%C&aq@)~)@*TkK|0Z-_6RF(+ZlT$V{?7eTTs`WrprH?swx
zF)F9-_QzpTj3`$$4Sq9^(BQdoMb?{C0G~}}0+KKQ_b3s@?)lGbNKI*`Zuv~}jCg<B
zDL8l;R3K=9NF**c6&rd!gw2OKMlb7j@FDX%?*q{KtWZqOU9b(>!dL-A@A%>@j$2~b
zG_6?1oRi=OpEt{Jb5wu+_rM;Bqq#Ak;EG6sl0A2+-}p3?=6{MVT{<6wCeY68kl~RI
z%L#fVm0*f@=KfoScf$9U{N{7_D>m9yhTcJ}n5Bi)z)t1wz%farv8}1lueS=TgJ`0R
zv$UW8PBMC0L-rf3*5d+Ke|(TKTifpo{+fWV7ny_>Fb8kqck8KBP7fqbaw9;G@sFNx
zRZ9l2{eTa*NaFvPgh?uKhQ|oYhbO_m7X$8nmgEa^Rx<r4A+bBazh2JmBND;gUxHs$
zsK&w1`~2ddItVwlXgCwK)gk3{n#SknY@2vNu?3+_lyWFB#kMa26E4C&&*Iv<!4<V8
zk)a6W_dvE%<A84!m<CS2*U5tS@geB*7f&!pGb0K(%Zf<(#s)MZbjyms^&kY(MnVpb
zX8+#TVYhdJ)$~>COnM1~bM_u;7}-}yeRbP8l-cU#>GU0`($|OX9C0bt%3~K!b!H+|
zDL=AsChtjKe>OgQrnosVKg9MSjMqByUfi5VvS^IwBdB`@6EuR`E!;~<U*v!mTf<uy
zsuTxvBtt6a4t#>L@TTEw`40<%H5j8AJOoLCdEcQ-lJ)#$ac?DN9G<2OA_E#B_%Knc
zimppBk}}WwGN#W9w}$`zHK$7T7ll!H)Kh?2xN;7zAL@Agsezs17rXSptX9Uju?IZW
zKDpF<7ZqG;u^e;U@IO)6)u);^YLK4H$01hGF4Z?4xD$^iM7&rwaU*MorMyB=Rkl4t
z_r_}TU8Cx~*5z(wzp-Nhs03;6iPr??FpAW`Cn)$7e15%m2?#FgE&D>MqN-PzTiID)
z=YcT*JpnVA6v=1lcoUeJuA={dbK8*Rv@~=}<Q$FoB5kod--_Ej&^%Kaa?0|9F3lMu
zH)Rtrn8P?Yz&KWVMD6&%uS=-|TF40*w%4QcSs9bel?*%)WEGG?IS1@SVY78RR{BR7
zlHT~`2Am~PjcB<g=W`X|zbia4ASqlked*a_UvjO`>aXhX%LbtkvlkP#UZvE?g**zy
zvAa*@<?qGQvAV?ta;red1${Lj4KDaJg{B5hDhbGu4=l^!M-l%zP8kq}6`f;T`evW~
zpNq;roOH?VOw@xPAip!B10Co|8q_1n!Flg7_pNK4&ZwQS<YM78d=wNK`4N^@b_??{
z`L5nne3fD72+Y8SfjUwP^ZcDVRmj!erbi9S@RZ$;wm*V1av%dGl;~>`$Cc6dO;@z_
zZBeP)J-g5eW+G<GTEUsb9I{U67vQ4MC*BD-g_i(4{+)&5Uu<qY6#iU08v}aOBaA){
zUxe$t;W9{r=BFx6l1W+<Yo;m_UOlGmzZVP-=TcGT!24UH$tgHY4-^4}$`~~@A_1Rg
z8TXE>M9fzAh*i9}>$oGPw;-DmgWY}5VAP3^@6dRw#xy+P#|s!ue^v{y#cGx0M3}sg
znLutqK#n+}rpENrkCrYvEG=Iv73j^G7Pp@btZ7PgngL9uSigElzSpoEp|54i1u&MH
zsZ5AGLnY&Vx4>${UM9%r*v?|4=f6J^fm<%?HD7?xIrzu9<7Ho*%68m+B06l1vK?ZG
z#GI!hKP?4#eHr0-R{^<W{#WnbO2F)!{*Tw>M-`TxgcMhjT)Fx#-E_Sri3b>thJhkQ
zeQiT1!+zzEKhTTx$Q>x=iwlH@XWE#wSyoavggflW{5uYUVLvhu#Kg7B{uH>;S3z|p
zTrzQf{q?7u{39r!#H=$*zlMeQS796T4wF`gaf6(|TFAxpaJ3iiQN(YmRnz*<JQQp=
z20rHEY1Es++b(V`6fi*|H2S$UH>Fh|8&aTz_6LF$Wh5j%@k1)Yw<kfZj99K>;#^+%
zd}twI>Qv8!nI)Y#5$(ejy@m~Oq&mfmgSsd98w^~|m(>@Z{D#(J(mE*wPs&KdOhqQ7
zB(*dQ%l@UnixCrzBtH&$F!dBxwF+H-%J^0%4#Z-r^)O@mGr`BaLBcs0o>7(kS$4-%
zj9x`ihR|4tsBz?i1F7IQ-DgX}YdDpOBqh=UkB&nGF2=Ah8@VvDUn*-qd16n&<KR_^
zBRez9LT3_t%y*oMcm5nR`Rh|G=f#Shu`P>yXN(D)9+9j&aPy{$wMAPtlYxFOzS#Uv
z=19_BY#qFO0aC}0dFPkV{ikyj>Gjn!AbA_riHT~S6JQmxzOS1N*<Nte9*>NqZLiKR
zv5()0$@yFVfQu}->`w3lIUXT=+J@Ghv<>m-!Bxkcxk@r;$w2|`H_nTz*XK19a{Tv_
zqdB5>kWuMOeKqMF;8_Y+ec@Z^A&~j&@%P7>DA80|2GQ$V=$C08oRYP^v`4daPIC+^
z0gB5UkNr?1Hve;y2nXSwD7XQc)LP4|eJQW0)lrY3QlrEi?bn;ZGzP5P_#KD)%hu@H
zdZAgfy=mX1l6F_<N>&UeHu+lXU`vr^o~R}GvUmtZ6($Mcr2fP_f;>(28Asx8B6+iB
zr=4K{rfj#ob?5;)j?W1P%DT0Ikti+59Ngn`2IlyB<vE#24}hz2uo6}{X9=)tH2;u0
zS+O^$E9qocDw>tzqe=4!fGb9<Y$JO$9gqz%QrHpg$v#7@%<s<JzeNlQRyz@GHee`R
zBxA4d>j@Ve+q=M=e+;SyDNQ#Ma6lmk?Zr5l=U-gQUhA<Mv*~r<R0j~Gn<K>Rg{R_N
zs4lhd5mC)Kd6;Vv)#=1}PPC}RUS77U())(_9<8)^ZbsBqHfYlOgg3hx(}P&Q1uu`y
zu+ay}oOUz5-+Y+FX`Kzb6;g*unAM03O1%b>J`F&B>{HE`dmM|apIsEdcj5iU-Iy&s
z|DJ`{0}p<-5WeTiJqy>Kz_WzMzdE6C$?~421jxnmfLi`>W)Nksd{hbI-}eQ7hpD!t
z`Ec`H!;cim4Hm4q=j}1-%nK?#tVO2Tyn_5Tu3?1aSM_2hYRLLYohEx^#1RJtBW7k{
z>;tm@7e6!NAa<(caaKX3EWV?7xOL`cvmam&sjOyly$_`xl|9PisE|%a2cM#OF6=FB
z00OM>{GgW_ek4(G^8OPLQ3rjx3R`8eq_buVrJXUENNq1(Fy4~$S@uv71EeBqvQ5a6
zkw(5aq^>fG3Bln5q{>*<4<vEtp8<1e3*`9NyvAY{^fl0r@wL0dwrtzi=t`#`t1Su<
z)IgR8*-sH05Jo+gnH{EHpP{XSQ4K4buz0gcR)ANCSxV!U@?g~-cXd>b2XYCEO48<V
z9OG;h?c$qR5^j^<0G#VBlVbVH3dSydK#dFc;}&XKLA-@uX0Mo%?zt7-g5NGAm>+5M
z(s__nu$o(*+jz8PKMmfBiXw?~)JZ<y`t1e6lEA(2xFx{=X>5;L%8Bp^pvK<a=}GeW
z!z9X|e)bzQG5aMt>-W-ophn)Ew-F|A6GG6xi(7eg$RF+h$QBHQ&&$Bf8ax%%iMHWD
zy5gZEW9Qrm->aT+vV3FNM@&PaYaKcO433YeW(ET1$6R&{RoR;E9ou1wY1pKG-Ww;-
zMmm9aEd^;UPLR;MVXPmXZ%Bw7)WMu(;M>|fIH})L*qcEqYoRQ1z-E?poS=MP8_ROC
z^1?suEqigOjBH<e{6$ez4aR*Q&@TC>2CK>QcTj3^w$}DAukuQ3-v@^vMb=}7uN1v|
z*I7F9%O0~ce*?2+h{YdHl_4_zfm%@hN((vY$Q03BB<Yy=U&YlgkgtP%7Y7D)(x=f?
zd9nd;DbLuww##QbEBoI0rTex~<25?`3q^F{Ii_gI0!lE`)ms6(mp{%KsrE@MV<$u)
z)?r>52LHMguQXA^c%`GL;3eCBBHDop1ZSiEZM0s=>yF*Oi*({vE+JS_GG4$+R)euC
zAq+KiM6Ls<C<=_y8qoak@Uq>8JKkvS<y8Y)^?$vYHp2s(JCrqoq862KM{4l@;LjO>
zna7xi;>`rK4l99ap;C0unLT|q0g4sC^~k-)x?H2K#QILgsAu2@*)DG~@G<=b`?TOY
zU9BGBAz3fMG9SUh**|(^sF?L=Jjm}@UXr<qvtAwuL~E7PK{IZLzXYQ!C5|VN7byz@
zT93N=j&6Ij5z;<p=67m_2=yQ!(JHdcPwqIzaMj9)`C5m~nTRERBZFzA1+{|)G@5l)
zzDpVAxVYj-AT&}!IYg7zwi=KE(I(u41N4i)YVylTMLYlA-??eMX{LbKWU2ohTf+=w
z3W1ORv0gRE(<&UmvCCjrbN>~)&7M}v<mOY(V*K&<hH<b;t?dJmt?;FovM%;Hsa7Sd
zrrabE%7tEpI0!l+!KJ4u;S&U1^)xa>{~_}*_btpZ89L>+H=7j#@>jGBQ+%TzwrN~p
zAr39&h)F#t+<6^IGVu#DCu&^1WJ|=j(Za_9Y~m<S5$%}*lHQu1Hi9-b8%F;iIAPMo
zVWAk1vAP_a^HQg1W8t#<6foWWzHHHV=2UqayyG#yq!9^!PaE}|rWhw0u=`}|F&wRY
zNk;!5yFBBN)(wgqN^Bm2C+%aJuhCaaE7hVX8%s$hW}SuejBn3f)oLENGy=4u5NZbM
z7ZIAPRh<pB62(<9oDUsy?xh!BO?GMG#-?R1c@HUyag)IL#=90NRAa~;+=f+r1Ed*Y
zTaK)OF_?e#jXDrukX}P}NGo=l-MrJXlfF6%%CDh6kn!B&A<1*vw47wD^AGaQ?eG@T
zFl^w2vVj;i4jzG>MTC}WER2EQ|IB+^`#DX6&aep#tpA;1Wzc%J{|#p(`l72Cj*+O1
z%l;5-%k>Mo7A!7VQ~0^{B<80_KcdU1T&SnkLo*w49r|MyV6A2(*;e8ke~9zE5QJVb
zx>nI*=oswpq&c$Pt7=XuT?)0F9P5BTPGw~^kRgfPTLR!2muj6F`A1Mdvo?h_a^(GT
zK1Ne<%gHMwH~5z1im*sS+{alPEyK@fRk4O(itFAYkRbEJyqoOzD3nxS8x6ffjkowZ
zf7CBve*oH<FNg(yq#|%2VeTE3+uAHjjlHUu<G?vr)cM_1Wz)Gw5n#W<kJqf7BwO1j
za{g(MCyrpl)bfx>OtBCGgYX?sZC6yak>U*cT`Ilc$vnpxvrJF0--bZ*b@@s<Iszg&
zCwM!%x5#)wg)1R5HE?CKlM8<A7vy@HmNQG>8d_+7q&jxZzi(FP(PU-;N*BoL+!Sgj
z{Sp~@oN<v^0cid82sHWu<VSE;2a`b<^xS<7`!o+%t?mWltcs#ya$wDh?zZ%(vsqu)
za%-5B+K7R5^ySt5Aj$yM*9C-gi5|&-mV$_k1G%cQA-ja<{T-_>#R=fR(!nJ&`#xFa
z_wT+1($v5Y`NCMF=0_HdqnG64G=wN@9~->O{X>smQ9(biV0|KaURE7?>#OufZWN7u
z0=fyE5DM4hw%}IFPiJtZ{B{B9Z?5>BVBb*&9N87s5+U{T)SMC!-&&a8`jr2g{|RBb
zDfiIFD21p~u^<7aKsW~6+k|@D5mdo-<D1<<J-2gY$)~yM2TfrhEP^hw0n!Rx7r(+E
zL(y)tcN}VOL&u88$J8GZ|5Cd6(kBG!D2f$MY4}ZtrzNMv?bO--{v(;m^MuYr?MeU6
z$VQ2I;^)${jAC!|c1S4UOPLzjtdP1wdFE=}hwW`vPnsN9qmU{TusT%59pV)87vah!
zdFyq+{-?{9t^B=_n2&h(ZPs<Q2$@(2%tXKKRTjwf={nOo?$7@H<&n>!veHwj04Rk+
zeBhkh#Lh-tl4lWl7Ao-Rlf(J1nQ5rXK8LD-gWBt-ifauQ;s6P%!5A~_wjc2BQR$a_
zaa}L1EUb~!W^u2v_Z&{U)0uq>PZAc^5ks0-{z&x=WZh>x!(F5QR?tq~U8;OC^TgK|
zTrS{YEzxAEZixP(ktxAjj9z%AckT&soJER~O<=j-AQS2}V`__8Du2vV_->%{TITX_
z#r^%dxMM9N5atz0UrVq-xX$?E?y;eu8W-1<+2{|j+vrdG@dMeF?IGVqPwgSbuDQ-n
z2)O-YshltH*nY8V5~u-T;t{avW;eaq=e9A=NOWZ}Rd4jY=S2+!FI%k1d`Lij0c=#D
z6QB!z_8=>+;k5q^MSPz^2-9`&f?^exH+M9Ij`}lxP>NIlDgr6xCqgmQW`2p@AS)w-
zqc%#!z;-BO8eh&!%|<we))%;;q;1u`fU^D3cwlYZD`4bEgj}9Gfs26m`5yY+-bk0=
zO(FKQ=0vJCnct1H8aij{t`I8(5x?|T%Umi}R<%v=6pelEpdnj`<h8X6V^!XoOoQb{
zCB`$yf!NyG78ppd<xW|Rb@~;VTx$<Y^$UC*^@s0O%v_?aZ~5QE27&S6?@$vH!sL0f
z0{?IXJxy)qT7*^e2t`on%@CkGGd<IyB{oY%Z#U(c6Gni&q6^lAzhHx~9hXSM3u^;~
z`YnGfmllTD{S}Vt1RyE25UNy(i_DwX%XL$7cmyz&5LqnXm6_jB=h@GkC?O{FC;QlL
zMy;)_feyRI{LMVYy|@cNOIZ=MSMir}D$`0G_#)OvBYarolZkbtI*q`p6o93?z^YjU
z2~!yN>KQL+h1t$1P5EFAp1-vy*~S<Sgs=@DP@41A1+eK5U&O!C1wGeur6Nz7n2ej&
zeW>lV0^&=EY#=&3z=<qS8ZNgS{%hL~IJjy{hD+v--jCeO;TlLms8cPYK0RG}Mg7xj
zRply*-cp*(!%CKKxuzOMNIipY7U^74C0Jk7a1mcF$KbYX53se<BC)xB;Y1iocd~kS
z{>j;@aL|^ut4v+KLuj<2x?6m@Y4(A&m}2QyFjLMeZ1z!nq31vjZA{`>jLLGp`OoCB
zP?bK4{8F!16d8{tedb&dS1Q3|(m3wS;f;2?3Q9kNdU<Lpj~zDEd3gE05tquDU*HIl
z`i}75PqKuF99WqC>5e`@i@2Z(mM6WTdZ<~&#?0+jXy&D=$0z;Mm6#%}1(;GJo4PhM
z>|&@@MQASin9QE)IjhR2T(FI?-QfZnPSzginqxl@@A4?zbwOHG`1J2=-b`2ut;GWW
ztsNfi-=FLWly)N(P@ie$^9sTkG?=B#|5zi{5pFW1xwMquBE*qN9xBKIomY*SlH+h*
zafg+n9zsw<N!L}Gp*vFELopr0kKSr8F87z3%SwhTrK|@OL5of{HX_V_`A$Q{10J7<
zi~<`@Jd)DEeA$Xy<7M`XUaCf;3f2HGQxsI)_6D}ZnLoj`=Fq`E6Q-s}81NRxP7Nq^
z<wZ6R`CgAanIcVBp-scGXUGE^$K0M2oHMm;hAKAQKXM4au~?Pvh}#x@YUMx8_@Nyc
z{`zmszoS3(_w7KEU=UeA{NS_)__$}9D<9_ou?)*Pya%0yhhNnh<LJ3vJU}5Vs;aHL
zukn+<>nC`ahx;%Ei*d3<#J5`GzH_Cjv~>Z7SYWN&;l1^N3@dQN>|?Rg_cw%x3x$2{
zHYuEs@HZuG4kM_NfocNuDYTO4WVrLaEQnXn-|>KQPW56b5n*2x!qF9?0JXfhr6_eq
z^mdRI`u+x~s7ud^afCh6J;JL4H*y)thsm<JuAh%$5iC+(;G+b{GlsY$)z77FC~DZ_
z$*>VtE?~#;gBFJCHyrBX;(&e0pVI75b<#Y&rz~uevT~SR7EJ{kLLngFOqo`C_uK5@
zqmM2OKOBw=aTm<0WyKd)Ro#lpT}|~-YHQ1R)%G%mA|Ur8AXH8%zLpwz$=&PuxPECu
z5Ly8)ne7S0Pgif!kFB`3YfJ^LRm)cl3^mUagL_Eu4KeO<v2u%LBsGw!_(-4I06=8g
z&Mn<UTe6Acv8>ibWCUITvxm`+IFauTN96<m@o&m6Nq-G#hy_-cmL2<|XSLzJo8$)_
zLLMFEZ)9SiL*25`6;HQDK+^$}p0KD=Pak*?r^(xm{1zGwLm0wR$L5W3(ukwrR#Uu@
zv4~z7spxo4jY(o>;C7;|C270707R+6_8g}bwvs$ZjOSmU6GVPV4Cvt#!|GP|Jx4~6
zEHfFIh}gWLUfaT?h{xmRP7Aoy8bbZeAu<r?suDCXrQysWHu%gNZlrk%_z8tP-QPZg
z@jg~`a+nXyV_rOQ4C+s+Ra=Z(9WO36{3?VZng(i;u@RvAoKI;QKn3K3I`a59fXggr
zV>S#lh}A=>lIt(?8^Y`|EV@w9`5r{be?!vF_@|92Wpg;;(Zufg33$>YHi>4hwYxEh
z>_Z?Bq<Hx<h`88(<H^YNaE?Y`XD5jz9LR7Se=c>g5b!}xAs~nUh>q`#e=rc~u*eAx
zlCXrZl5tO#YJg4;nJ3lxt<XpJeYPj#Ct_6~{476`xyd6n+Z|#%#Y6r7+AuGJ=Vxm&
zt-Akw4na(&@&5~t{-{d%w720_y!#$FMelbnLG^=i)r;w0sIQJs2ja+ji-eO7c>myn
zSdIC<A)l$qr_L}*f#n>8DFwHH%XfmPq(2cZf4iRiO`;)7N`=S>x`##q!4XU6PciA9
zS}Wmfk5Ydcv=l2vtK@t8YR{|e$%F(Ydhq3dTxpo+04ltHE`f_`rTu+bs;M-VuVNvi
z;S1~54mhZTluyy+juib;fnEzoz%M`&RB!7h?4iO%sSV#Z<cfM|oH4}ApzJZ$r-kvS
z1<)%Gs+W*wac?Md_iRxq(Zp^Y&zTq49FeI{8J~DXtqyc4(rLfm#b-gA&AAfIl2~Hp
z3@@0+TM%pZBHM_e)S#Ef?V3&d<H-GmCZETtS(DPC%N(5>Ll8O<1KC>IfpJ`+C0%bj
zthFiwo6X(mMmpVON8U!z-WtwF!S~xDvLV3Q-CLjL<aL}-({+Dw`xp0P4G5iF=6;%k
zBT*jmd2Zoc7cFF}RO@f*msj?p%eiQAZCQ01%+JpKRJiHcddUYd1qi}KXmsXkK5+iz
z=Uw)M{N*N2_h(FpjtdHG`+YTl?e?zn_E1ipRsj8MCPM>w%nUUh>Ap24UB9z^e}NxD
zPi>A&t#8^WGNiZ?WsI=@lYn|%-q1}N5a0$j*z>E8Dmi#mG5b-0(qb;}Z<^xw&#I@V
z&D?MXY8Tgo<5sR@f83hc&;j2IoBdGNNqmFt(O}DDq7%_RCOF1C&nu+=L)1A3SMt2!
zKDO<g*xJ~(vEjxxHnwfswr$(CHXCbW-t+xc-FyF;s_s5BXKHF{y8C_K=krif4)u?P
z>~`-w7C+Ut<$9`uAU%6U1$}@)X{qnIe%ybJK?w^bszRbFWso~ZzwPfPC-H2tb|zGX
zB3`*2eOwftSskNI4dZUtKgVyQOlpJ4r3DWw5%Xm^shGdt2@bLQQpqEPN?5LcxAo=K
z%Tg3jEkoCoW-o6LIt9O~v?me57VKZ*x{8ZrmFG%`5@2Vfaas0xmS?YH#)=t_2TQVx
z2Il~}Up^J7F;<o=Y}Cf&j94^L5n{;;l++{(NxtC!d2}(A;qbbWH|!HcK%M$1R&QX#
zQx_;M`%TuK!U5BAH6}EXz;6=jO_}&<668JoPa%W?UYd#sO@v3-!0>mXl)Ax`<AK80
zcYQ6RwNqkzYBzg<#`(|kPqI$kkkb=tR=S@}*0_2p@q^dAg+L>)<P6uqq)&3mILoS1
z!7G4l+Jq-qj&JWACBs?}7pEP>?H^uu5-{Gt=vS%v^o8)>oTdT+3i5}Zxtoh8gzn+#
z44N(^BAvoYNvjx|)3sNiQ>?)X8lS#sY-K?#Xy7JiLPjER@|EYOEc+?KIIxusI2@S%
z*o7xAJT`ylHfgWxGdRs~Pgbwq%>g<1f#y0|*%pN`_-rr%&+-^J`6vk^KQ*R(gum{;
z-$tm$E2Iewm;G(&blBLFm~#MSPYz|sU=3>_h60=6LCo5xOFv(w$SN?g&UQaBMq2U7
zVoe~>v5V(#stzNw;$eVB%R>S$2)v)Rwe1t=AA+on6y?p>X(E@)l;`-Rogus=zoN-c
zcTz<J8+uDDHi3L5S)jjlfJWp%%)9>OLhoyMek%XZf3jK;5XpKVTFP=cQMQ~yWJk4t
zNGCxIzQHaPFBFO3@gQ~#WP*UBAquN|=<oaO;SEL>FO-hKIu+&%1fd&=`uLVSl_)Op
z*?ugqq0@^^6l_iAGyDOwRou-VeCqH#7Va>Av--Q5o%&M|d?ErSZ`e8JnH+z)EdEF@
z0C5P*Orqs#CE-%`>WN4qEQZ7zvY(~VA=b4IydjFnb&6~k|0xInsX|CxuP{i)(54KW
zu9>Z$h}6Km-O38=ZCke%)5=54+P~5RJv$Xu^l7juth}IE3YV$+=RGU14jTyi6m+J$
z%xeMhTSxFT<uB!|Yl2T8WD5N}cdbFXWU~<2_;Mu@KLY^Xq+ZKqVR=_4M7!;Z4dE(g
zfd8H0$^P!?Ft_w`Z`@BL=r90YM0VE@-v_<(Qlw9Bj$k#lRR>bLFlq-d+=%=~7Dx(V
zs`{etDkO;fPw6Hu2CUo8{c~hWs<RIkj6zu5`UjcsMj2n`zA!dq)?;5RRzf})6kIiC
zyz(=48$E&Hblr6vGRa+tRAVhBs)xk+jk=l~&KkvsA_G?5;*-#=3su7vT$_~+>A*T5
z1;-#+FTkA7;S+>lD|&A&$zEmOqaTqxWP*N)`;}F1-D)jcxI`UG0E!a=O~WxL(ZIC%
zeF_rUm(R&v$yX;LQnSit(-;)%V8QnG3d)y3vaN5i(S9)52jHrkEg9JUMbP?dmA{+L
zrmY^Pf*Tw$O-y=pf#I%R8$gJH1H<!u=7{<h>mw5DP+Iv$-RIYTe1e3iz*Yo(Ar@ea
zL##qbYi6Uc8DaJS$SH3|@0e6#g-7l*j5N39qEh+Efs8$;*F7`?9Ny1Pmdaium;u`@
z)B%D1r6mys;oC({)d5lJ;4T=*OY6ldNR_!g!DuPA?%Bzj+q2|sM@%*87@HKY#zdb`
zG_o`##<d_k(cJN$W6%(={IPeL5@qyTkYl=7`gbDZFIO>4Q=CYa?@JqgS!QU@dw;Od
zGP#%J_!5wj;xn`kxnJ`JR1;<gTaMQ{tIh#JHbIvq9hKSq&$CpYC)E)pj4|g_o(%R;
z?sNu%tTK8>i_~)Qo-8dH(6N8fK<5d(!{O-M{ROxq|0ICL5L?6FCrTGckw8Ttz5aT`
zkxF148821>M+tzKdR#}2l@Y2N$<4C_l{5d63Wkgn_KwzNlhW?zJ&bE6e~KknhVY#B
z!({MZME4VehY|Zg9V#$&M5wRDaNus}f#))c-%nKz<B+>C`gf@Szb<i^5N;9%n%o?3
zF3{NX2=g;rI`Afv^1!Z92$=yS>DJuO!luO}qGk8b@WWF_3OBJvt%^~xxo=+jZm(1(
zc(en!-JTVjt1ad@<TM$F^aElA8%}DGX0IZ>J)wvw=M9<2mXjjbm`ho4H6+f*itRv8
zCN&e^ToVKa<Glo^d@n*0ClF~R_Mdt!wU&t)SXRXSiq1xc$dyq}zkl7>wFSG6^EFem
zu~S4;6WtMc=S$u{d?$;eFrUGIeC0znxscG0HpVP`BM1q{JlW*ibblAuuGQJ>{lG47
z^`~vC1wtk!&i9Yha;zO1npW&V^CX=u0%ibt{p^A?4ASSLR{?5w!CV!2zn!;3+w~67
z`1tC_<~e9rZBaq*wtGYsxzN&rv;i+d_v9Jqtc6->qJQy9KuFpz&|6<>XHJ(Ua+C>H
zIU;ey+E9s9BI~FCIka$chG=7Agz+I`3%wfe4;y<GGm5}MT-%g|P*8UA0KD0NlKDRJ
zn49$_0ZuyNKJ8Tr5r+Ha$kgg)`Cmy8W?bM{_prPh4iXndcV<*5qP>jzq?L8(aR?OE
zCMSPZ_DStDNDHgb)3J}^n=ZVG&8B7+%RaRuC`OQQ=@EHN@M!K5Pc3-LQbM&_#O1o?
z`CIwP1JKW3lMGNwZP2fu?peS7qa^(&LeTkf*RbwqyykK(8JO;fZxF4F{Q$DW5sdyN
zoKlR=yA|iQ!F|<hWopx3?m<`pKu0bn&spDyowv+D1-bZM9ki7H2?>$o@Bt(1f_V}Y
z6W?23{3qe=D$pfvCj=3w&lKzPjKT6pabf_0Rn%rav7%^y2>>{pFe;^gPRYPGZ&~xO
z_GV#>C2xDj&{?{+NZ}3y!@~hH;6mYnSmh9wy>d?+9p^65fw?}06e!D6-o>e-l}2P5
z^?yx)1=%{{zqh|*1pXmN^0hqGK|vTcBfkbZ_?>d08KW0YGal1Rc9~g+wYuqlk4nkp
zu264q#MsgX<}sB&cS%fg8AO<E%Wby8o0qz=-k->5MmtHMlA+aN<s+kbLx!awkWdMG
z--+`>XZZQ=GdZUjF9}hX2cB8fKl(xk4&9EV2sxm5D`Q}ZR;T<Gwxij!3XHoQlL1nO
zFC6;;2tjUV5IE>y?@a0uU#BBn+ztM5D0)z@OMU(c(G1!K@oUL2fYAZm18MP!-5bLP
z-WK&S4q(UXmq{U;vDTkPM=_a(PZq+(02Igbg+T{2X$kjCx`Hho3wVf*KPAU(FjFQP
zJf+6kD4EfNd{30F34kf`R^o^7F+48>Nd=zb2Vd(3{Vwui+hhdpSIP8s{)M)4gm_B|
zV_9Q#lHT1$*R~*6zifJ!J}0Dg%{k$`{Fbi|Za~QV+Q46E2skK~RCs3=iEV-Ccj5i`
zHmxxyXVd^6^BW%?8I#PEGVj=C$RC80PC%xdiE}zkpx-!^ixW)9zqwB%b%NP=y?dxq
z%0k8*!oYRITGWfnt3t+>xnpi2^Dw}ZWN#_HCz(R~yS)WI-nqBJ7_R9J2qEU+*cD*l
z-~tnC@~0e6;*J#Olf*6aRy=GI3L3hthxd&U7NNKZ-j~<&xx#L8op=sP4z5L(PB(49
z-j~jP297SY=Gi#d^{THgkYPa%CGuZZWxL~h#3(6F?AK&3$RB0}z2VZk1X#1tsk9P^
z5wpK&T&X6>;4+9V8bhjJMosm_18b<eKsSNbgCaD9tP+Zu=y2h^n@}I^M;4M@T2QBZ
ze?6Azs@-L%<bC6ZMMn3i(O;0d8EBl+Bp_#_FazO+AHi#+tAlh|y*L!>SoV9`B==Rl
z9)g^|pbJMJSP?Y#sX-^5JG7Ucm-0U<q-_$6S%-WC`ZXHr+Sp{67p$e3RXMcn`6+d3
zZ^DH(<fRL9+&$f*_}$4$P6o2>E^phlpJ_lxoVoLXM=cJc61bKo%MjEmeIsNDH1idh
z>XT(NDe~kg?9C@3kOf50zyXvGnD-a5R!jKpPytG@9BE!gG0a79Se4Xq2#cnym^3J2
z7FUcQm1Bxq8vLeUa!Xb^6D}G?%rYVvzFDxuXuEs32`9N*@pGnvI9XSLbEPq1{O}3$
zJBr(zN1y*IzAq7vD)}!&f2|0=x$(<?02+!V)Pzf%5Rk55d_S}v@P~dBl6m$LRp#Nx
zBX5Isrhb$I>OR+<WPMhHy`$GDOXrASYTNHbI0_8uLb>zhlwab7AfrrH<g&b53;Go|
zVBFMW%h_P9-+zznKIVu7L%qL^+>~h_+L^HAL7dyt4&eQLjU%Vc!A%U-8)w1JQP}|y
z%+Ftk1t2H65eXn%l~}E(=?ib}#KfSpNw+YGjK$0!ID?e+k_`F`F*mKLfBUV}Tp!>a
z*-Ne?ZAr9l<)#mx83mr}@iwqqA;X{B=FtEG3F4Fsufv-MtHgRP=|d3F#BqbrfW+u$
z30#Wp53A)&khBUNMJfhTyjlTr#hPubc!mV=LmY(!gw~Q$I5kjMbfLph%vYZefrNjq
zl~#zWA(eZBmR`nDAJiAD4^Rd*m7gK7V>jz%Nrr>Uy!X!>(Yb>fALvLgH5D1KVON?z
zzWb7OBM^syftE7>vdQ-dk|fnninv+$d^HN!g7xep0_2Ps37d0DGKu61d^bvLFncen
zAR!4toQRUl&2Lz5Pw@#4F~~0Hw=uX*|K15YFuyAiW07W@D|ut)qny-)c=Y!-*~t)p
z?JkrI6c;TH%z$i(KqY3|ptFCN%^@JRUAp98%}G_^i0co|^kG2{cH-0&LcDPyY8mhW
zZ~{>PKdne83WF`i>JqUvCPn||@~hICrDg{GygVVl?_aS}%XpUSMJ<~wwm2DZDF>6j
zGWFwLtD<Em`H1U>qMr4|<!I#hyLqbpo2L0yT$>VCy@)=8)QVQ@D^}XVD!Qwv?iztw
ze3s_*KM;La%b&+WHIo5Yic?^uuk{?G-TY4;iUxrQi)>Qf9;=Zt@{aBetrI9<P5ce%
zYPgPJMYVJ<=FJ`n5bJO4zfi$!lIo-aYWs`oVVSE;Rb%KtTlym6nM^gDO@v_vwN<cC
z-|R2L1v$fe6QDH5Mqtne1>20+w9eUac6jvY^)+&u<0kGTOD7KVOwHfnPP>#vpcV;S
z_5Fu4{HRKJ^g+F^^k|m?t;FMuojjpU)Bk4L^8K*>WAWD6c2F&xNYsOp$IOF`CaVJ<
zh{KO268$qY?`Qz7<p_IdjXkW0(gL33l+j2<`%51(xh*}@&@8G<iD)iB#?xJq)<RS1
z-Eqq2re8K|8U{)vzng}-d```CIS>a*{0TbqOUP6#0w#0j!zk0f)Og2+zbK=Kn`t((
zH@(*m=B8Uej7XAgThbe57#@#k**7>25)s*|Ym+w7>B&3jXXDuHAlNhLq1kl}I+@*H
zSX?v1nS*2&Jqtkhp~8uwM=vehIRK-ASm+0vIm=<9>bNQjLV@j5Oi)K8^wQ9s_xM4n
zdmmqg{o)sSH0snoP1{hHsW3}0DfV!Ydf{VloJb)d$1ogzV@R6lFn=({jFwimB77kc
zMu`-PoX76d|D(~BP|+rS;d^C&6u47ipp1f&7EaaHq-9WakTEKGN^Q~RKC{3r!HVij
zhhpIHlZ%L^Cm*ERct$x)vT6tX7Tp{jsf2^LSH4M<NF;{TLx`B<%yr%Dp_MP@rGPhL
za`#k4er9{dI4kE1&y8YK<9k)UlPEY8A4HAAlA3fIwIo-yQU}z<hhqf%&4`*Bx!`yE
z)R)`)=v0meENr7_osT}f0-47yQsnjc@f?cw;|cpR3N(<V2oX}KZa1u3#1KN|BtEP@
zx-HjBOnjCqrIhd61EUs@Kj1eUNC7=~@)ZS=Sq$Eoq#YyxWr0-<<YOG)Hn7j&@zSwz
zrB8=G`ln9vI{2Rs=<Ql_m*9h5qUR@32RbNZWUw|5J11U0qcjI_2SpI0anSS}gi%0u
zWsrUpDS;OCB6gx8@)$rNHoE=0!`Mds7ArFLb}@3Hs60~#yv7T-eL9*bXKZJP_Ga|*
zkbgw%Jd+EWzHBJD5avHG->wjTJqiMgHjkJQL>35Rj6VL$c!wtCg{C(PpK~@US?R5X
zS*II?7yV5QK{kIg=0a_<2Sb10vC#|o)C}rSXNq8bCp=Jx2oSMwzPH}V)tH005$hfl
z^Wvq#3y0FE7qOs3p<cB6nNRQStvR|-7%CO$PpW73gS!C|+u~7Heg8rX@5q$Wm3Aus
zqS7^to+z=G<<s5jS<ystU5TM*!58kwDa5x}?T@5;XlkQWb<4EaPsc|&2eIQy78)@S
z2O}Gdv-`#SqvwKICul)<f<2>GnC=8A0loq;&@XLwTs9$a$1Ay8>ES4aWxJxmo-yMn
zOu4GJcgr028CW`;D|6iO0=o4F{7he`aH>>{udpBek$C|I&n~1@XKfWhKWV^pGE`i9
zSw2pYh|w6XE|Pq9s~6Vmy2TWZOle~7q!_|<WrCmsyYkRq1F%cfh}v&|^+&e0!fu*_
zv5@M;5Bfs$Jj?v{fJEF+fC+c=jL-&at?ovl8v;GH@6Zg?BmI<^M(>2$T!^`u3J{r!
z%Nt8`9AaXe6a-Q{AX#7r=jkxjfVK4NC>lYFy=J`dd)-!usW1No70l8Mj)pCbs==zc
z%26~iW?Yl0kK!YE5e?~#F_I)KtX+%zlc~d%?D7RL_|eFkS6Wq?Wq&ukbQsogeX|$T
zWc*qzJc*2~9Xh$x_J*WzpvxSf07>AyK_d;(KDk6i>BgLa!emQ<&Qxj7;h(LirUL$A
zf<oCE2F$0Q|58tLJ$k<XQZu4yKm0dJsqE@!rLlzwc$5A}>IQc)rb~|QNE2nS)pfDV
zc4_O%MMn)+4GJ^1&+lsBamUC}Jyoh3x1eN*iAGOAB<sn5AYu|JqD3`c{?qih?B_=y
zvt!_1A+8~q!j4!H1cFBeWw_FujlqE1-7Z0{UU7c5Y$`~*#Z#S-U!iXxlMe`^n;-7m
zUBHW32{es#{|Prn9!RGJN7JwuiaEZje<v!tU?0L~Gscf;@~6y^>#SG=|BG!Gn87GB
zKiTA+)47rH&CK@>c9d+4olAxjO*atNouZ#rN8)_IHT?fJN02%)!_ZHA>!zQgcM2B%
zj%cXCM^5RfSJ*!!yBN6b*7i9m;fC~fjoc{PTh#g(y5bF1BK8mdF!=DvMu{KQrZKtJ
zZ4GsiOm2f>t7r7Om+rzYOWz%)$^@<Sf<yDcl`kQp3rn}%!^=ywht@9yibw>KsqlRT
zcO1LQ8x*%(T?--P?uRGKU#e8ZYv>{Uti%n-qB4rW?kdj^LzUEq;C~s{K_iGcTw&Z6
zzr-`F=;<iR?SGwrc#L|<9X2SIOW4dnAjFtJ4~{)Nqq^6mB~NjN&%ZxA$)wh>JICHd
zo=DuxY=Z7$3izh}on_H7E`^0?l?S>?&j$RE-AotB_=Eq01AWdq%PN~Ad}PNii_gvJ
zt^7+Q?Jqm|@%vdeUu+m$3GcaS^!E>*`+!n*VKh{x0Lvuv>PhOol`lMfxwR}yrT~^C
zi=Q?J;nH)rHHj|(fzM<!^Bh7~+i=?`p_6Qb<nht~;U|$SrT+IgA>llO<nX_FYI?k^
zd=4{>{4|LFd70Y*fC<-iG!qg^U{pZvdTL*)9TWpKSbxeUkb#sb%Huhx+Q3X)Zl*4&
zM6hquJIEVLsXq`tQw-ksIOoM`4-|7k&WCvTp<GPXU-meJMZLbf*WA|C1xV#FIjcMR
z8^Y3b3tSX<CE>W-JTG`4Xw+1B=nse*K#7~xzr*52lzb}H$3L)ivEnO7a?VC^Fbv|j
zCmh+W?HOO09L(iB6`)}CZ)sDgOK#nfw+<mgT6dk2xM*oCuPLIa9-FcZVj)vVnX6Sc
zl?b|Rrml@x)Sd+;`d)hF<d=-Y8^gKUg}y?aST9sHL&S>d;SLeXW3UoLfr&OH^oNhL
zs!gBA^!u2#$q_!oqyjstOfwy(Kvp6mOyU>GrHJpXGSU`BFN*h=AD#{=gb(92rVN}k
zBfzp#P{R??Ul2T6<jQse4BZ1_be`1sg_nWjw*-wOqoBd-fnnRQg`w&#(Jq?IO_k_k
z=YV3WbUf_}S}t!ko_mKWYvyC0*_#z$6wDbIlo?c40XkFaUnca%={0zofyRoklcpPp
zR{nq(L=sydIyXW_zE;H$Gz(#1JAHhS7=u^ZEl!P-%yQM!C8>N=N@=EiI{KWB>PTk~
z=mFQHGtTHQ0|itfV5@I?gZwzNO&2N)=&wtpNg7S9$F2!WO>?x(Qk)wsd!}YM_=&#d
zpuw1)L<WGYjR_N(!5DU1<abI~hrY(~$bDl8U;xK|Bt$=@QzCP{%WU;J$e4)ppJ)bQ
zHmn>;lmGW8X=A^Ji?!!1Vpo+Ro9*v99xgZkH@a&^zj?r$uVF5qMsLhlSmaD^BPED&
zO;$Dgz=Y6QJYS($e^-}?Rnmqms4=*f%zffu8^)8z1fPYgnNLR7&OO?GXDnbz*dtX=
zfD~=T_l0`j#Yd3vkN|QkVBfPt0ijNyw*+99(Wx=M6Bk91MwX^=V1Zi4HDHPH(Y^QX
zJ$!T=ephrEnMeU8yq*#nx&O)ZlsMasjNvv(<bT#`AtZWF{DG~9S?NEc0i91f+hm7v
zu$iRWr38CgSJDC(*S<AgaOER4GQ`AkrUNM)*BepdP_AMjJjtCAERj3fYo=Ze)-cpK
zogc;NS^mWE^q2!d{_h}2VTpj!>(|^>D?n_~<(b~sbbwnf<m85LLKBiCQQ(FQ-ZFb@
zZ*PNU^K2HLFX<q$djl-m{t`n}A^!qLbw#Jqti=B^Atz8xh?3r$b<$7=t@D3v1=tXh
z7_>`iEJtCQ68mioM=GjMm*1R<Xf+@`_?(c|;M5CvIX}jL9+Hn0M=9KpSJ`3HNe^50
z1$D#=oWI3Xc*|cz`s4pb>-xV+DJbu{-pMRiuog=PV%)MOs#1DE7X^@96&}-n7W?Nf
z*pBTA3qA0Q7PqAYGv@y)u9|*EOY0Z$3og!&7r`gope+?LOT~~ocU54h4m_5LOQf@s
z5cIgWi6{Tt@J@SL<Gl1AYqaA(?VL^{euK+5KKxi5Ikox(RJjJ94%E%QBFvgfL-6`b
zp}xZ%#png(Kp+ZB>v6sIE`x)JA8=wQQLI$2tDLm64zh?1ev5Sfn3VMaLsQ9Ty+)Ww
zP?ATDGeo7y5vTj`q(0CnP|N_DD5^fiX9E&Yt69)^Xb)NFITDv9Q_U)Ti-9EX9LqQZ
z<>lGPel3gNRV^V3%Z$Kw&aRj)Dmm<_D;dc=DSY5aXK@&%#D#OoC1*h#>|K|1)-y&I
zLRVww<(X8nII`gxvA5AAHhvzS36HWqUohm6YJfC*XN<=Cg*DDwy5(N{CKb>|V&_QR
zO-=m24t>m;TD4tfRG*m4p5XFmcbF;JtT2$GpHqv^a}>($e7=wdtQa65VQ84O!K2ac
zACcmsBZyH(?f1f`VlKE<H$^)IIBZ*e@8&(X_}m3xWKkZ-7>#atEFh<roC%81_SH`$
z7Hb9*(M+=|_5zfhueKZJR2gf(|JdA^@{#-^BkB(PB{Yz9c;;FIq5Jqf52RdbB|?zE
zh}p9pBx*W+M<H51jODAviG8DE>86e+-st<ioWIsT7f~O87Ui1TicFMxB`ZRU`)k-R
za~pVf9(`4hApI*KZDS6?GHrePl!o7%Fv{yvaJ@E>{_=;i7MXxD1>(@O2WS|g9^YWg
zVdST>&T8UDTw!TW2$p;{wRqNorI04mlI0`^>ztxTsfE|7lC-Z^U*10SSS*#rFT1#<
z+E@1ZlZKD%UARpNm1zASa3Mz}2VXu8w-RozO3NoeGK(x9Nn!!($j_2A=b?ew*30r#
z@5R(^E@EP^H3T2Fsuh9+1lI&$-szdJsr=}vSxpEqkYEz<kUs1M+~9k~V5LiA`6>#+
z{u@idCkWnIaP$VP%t*^7*fFi+pFa_GvLe@WWQtiJH8=0DDKX6Vv()eo%z`@+N-Mz>
zsZ0#(*(=g}%r)sH>t&gvfvZ`UFzk3GTId8Msm7q)3|}8XKCviqn@K9BbFKJB+3}73
z=W;dAj?@&_)-CJ$^SCp8pnapH5s==;iAOUZ;P4$~tHDNW45)emgF(d*w9x3=aLK3?
z^3zD$>h+=T-93k(kyI`UY`R8FaDV~1XyZ;0bEZwI!YT@d9%i`X>q@nj5v%^8I!&O0
zFVOV`yV}ZqEjAqa1M^!2m4x+ac<4S8fgFSf*s)v+7`RiS=i#JE4A)RD4s61Dds|h$
zv0vPRh?Gb;b#gWTjc^oIP~swGPA<eo`<o@)7G7gyWUDG9k5Ov52H;{hC^GcD>e#*Y
zZ^=<^5Oef!-j!u<1FQK)3Sftk!B{VpL%IzUc<pS{;}LQDv+RpHmU-o`oTB9tom9St
z8Wk1eHmtuI!H%-cl>_-aU8GuCY}}It0w>Rve#r$HsQv=IeFtNwQS=YXD@^izx;Mq0
zL_iI7r4BR0)!&&h7m{v|4w-m$HL7H^(nCHIuZ^Z2tryEV<;z3+KTFPpKLKer_jeEo
z;=m54#6yHII|&L7je{O2HRVgEz|PVtFZR6%dB&vu>Qn3kC-3ajzzrgU*IvaFAoM}n
zX#{{ERu??V1cWJ;C(Wew(^&r@6yL}P<*e%)BRpQU_k|Cjkm~l0xnQz(i_gov3~6Nh
zQUBFwldN;a-k(zbCird?AJaTh)D#D{A>|;;&j@cAA46LWiKNkPgbYr$K6IZ|K)j~O
zZ&xr)%Dh~U*{C=3dgj8WCd)yQnB&6ugYBoeG)q2k<<>1mDP3SwPM!DUbULQxCeh+w
z_=38>EjG8$G44#6^5=+JU0@v_JA9NVUU7M{6n!)dY)10g<BbiFWFgujHk$!9fYYWG
z8vyOtJ81~WL=I@uWz2+k_C<cd)m~w~?jMz~6B(l7Q>64kVZ|>OcgSO{!ifJ@D{Rq!
zGG7{s8Y+xEBoKt0^FS2Oy_}_h*Xx?gO+Fv{YcLTRFOfE`0cG=|?xdSz82mg;-6NXB
zg8sw%M4v6J2e>PUVaqXBZ@cAWFQ)0mNx1}l7OhH|CtbgQKtIOx{G!A$5M0i>PXc&q
zQV;*ey!U7^M{XxRmqhv~xI{<->a~E#vNHVtD2f!9c?^eHCtwO=+Cq4}-ui#v;-#Zj
zPZu%BhHC=5?E>Bdio@>=h~fB4=`r$W7~%!vFGIS+%W$#4PF`s?5y2Y4Bi06Y^{tb7
zPLMy*N3&Y&-#?d!-AmX#PoY1=nCKqn!H^*$4t@+t=PxWz9X)Up^g#k((1u3rugTTi
z7f{*i|JhM03CCxLQ#TevN?9z!QH3)Y2;Y)-DYc_ztnzU<?wj>!y?0VgWQF_X((n@!
zRl=W)W2KXg?}`yf*p7N!Owg<IwZ}VY;JMvu$L)t*Yxy*etnbnL?%bIWOj+DZF0ssF
z5e{e@WcDwnO$>C-#*1&|D%(WHyCp>}9N*>7pk%;SjT?Y5L$0!N^$UJDyseM&b90K1
zce`>zY=MnIJdFnj)2k|n8E|7W*ajE}nrMqbAohSvNb+m_)#*>~SNS($y?7$|8urG?
zYh@Y02KK(_qcsRg@roWmE)6B`_s<yfn*q`U_KVH{7`<;Ji!eliDJ7rCm;8z#tjYUF
zdievk{8x31KcOcMKszN)%<o%SAgFH~-2hdKDe*F+ojaRfS#nE*@~YHy$^b66KRle3
z+Nj0CSr!UhqgW^rxP=N|>aGvoHk`g)*j?4voAZs1(C7impj5W>n7I@bw(%7nNii$0
zgovkZzie92Uyxr{dH@P0#fE~#>}nS#ywwm=qN}%C1zRLvDwAnTs0I{5c!%{2*fX2`
z4a2*`xXbOV2^(qF;0zTmN+$rK6WpsCOWmj<C^U5Md@Zwip}7=*<!RjqBx#<DwbjZ<
zyg?fU=;HjL9nY_+8l~zU-JX^sH2HbP=5~&G1&E`G_QuUMY_Vf6;^Gm%gq#X&bmCua
zLFv=OK~-~$UZ3`wS}4o(u*soVeP5EBj4z;eLs96FjcD`mkCo|AVKXwI*6x#nSvQZT
zV-8+R0-44&>(0-(6#z6bL>G|^!jzvvF6&8TP2IiOUl_lcQfStzU_r4LrQe;NR5k5n
zG6-+ssEk&%Q(`~7hi-;rfy<>+DFYyyok2XJ9Jv4DyOEvmng<y&a1NlK@>8a<Yw6UE
zWy?x&IPJ+L)k9-R;5xRdtGY$OLm6{l3*Pfpv~BW=zzd)EBY-|!s)n8WbidxmNS^*K
z*u%0{60s}B^b@4Pzw|}oF?Kp9r7{uLKJyJ?+9*vmWD%vIE%Xt=E#?lvCjS_w^`Uio
zs+F8We>rj`PWfsy7S$}1g#Md!wH0ywfXgF#Azd9GsfNTNEi^xyXNcdRUBCvBAydPW
zmcxJ0HfPG4=#=X86sdkm)n|VbNjA?HUP7PC&X(y4QV?7&{Tm@uzqF;WH`p$bK!G(t
z_z@W~G6RHw>Ov)6zxf!O?Sg+>bdwX7nBVJx0YPsA-CEj!oH08_Ul2Yld2%`oi&BPm
z^aA^6t(>d)m+Ufb(dir=ZCE`y$QW!dUzGE0KbJWU=Q6zc5$BxSd9-1)li^DTf-XB0
z1t=G<8`O))LH(`bJ7P>*)7h5c^){|Wij8$svG1o*j=r2e_`T>x1|cj;pb%Thoe<mi
zaO&SLdZLy@5L0d`)_JyTOw!XFOL49A{Nnm91CS9uw@@Gd<dEKtWIU$Oy0rt`9jy4v
z5d?so>)A)s*@er?u5Z{_h}>QB&N>3L&{~ouPbJ6+!C?E7Oap_ykb_vNkCaRpwbm_8
z4H7qB>hokSy$PNb+0})rSL<~yYQLjm360vn#6)G+$*eAWh<w+D7(*MvoqF|C0HGW-
z$dtWkBZ}@u;G}*aMI-bQX#4$EJj$~STu<%Ojho^1cPVhi|NNwdAQe$izgTn?M*(mp
z(GwrN&p;SpL2U@T9AL|LA#qtKH(w`OFl(yu<Z=Pg=NlWHhXbQv01_E`GJ112nS#<2
zsg{{9|K{f@5DH<>H7-;~JavUwcEz=NNx|hunQt`1rNM)u$oi`7D){^sm}^vy@;L6E
zua_=xMTX6f!p<~gg<27l*cEGY-jRbgYSE7@=1)^GFT7o01U@p(D|2uBX|&RCgbCz4
zW)QGkbJgEfA=e2b{8MO1&mUtC$foAb;Qx6&rK&;feBpQDexuAtgAY^F?IXqYSwGc;
z5Onw-iE@#{aG#XJ@`ZTj%<QwmsIXXBbGuIH$?0qKGzfWcItt|^_Pn*8XDNCW#7I%B
zS<-f4dd7irg03iSb$at|kysH+VO~bjn1EFl=$VtfAUOVI(PDC~G`1>~dBDLt6r@Dm
zuAj;qbX<vu?=rM_`$e{IkYRGbxwQ849Xor%u_`8Mz!Y`9@JfuU?F!iseKxwEL1a;s
z+x;nxOG=QV&@br98d6K-6=_5nthzwYT{Odi@Una~W)sO$OI9sf&rOv|gpn3eOlrA{
ze>5GUNpx)Wd6-j2m{Du_a^%{!XpCbNFIN6XDb2;dHi|vhAv!zCLXbp!IGhUmm;^uo
zt};{m0q5?7IBHJI!|4hvR=6Eb<|E9Y7B;=<=D<HR%$&3>z`B$6KhGUOwtoZ8r0HHQ
zF>Fpt2)k4wTGHd_XeNk{Mp-QrHjZK)1*l_g96mcJOb|@PX-c-zw*|o0fG6*!=SA7o
zl@lb88AT6vIPkhJ{rOcL4pujx1oPc%o95R=YV<c|MTiW^0F=?3nD3pvoOM;Ca!n4-
zF87eAjXxV=vP|-<FwGb%)sI?WxS4KXPF<~WXmUwW&R+3qV*{h~y)TEuUoT3PYO%1a
zz_PweABCZj?AIq_L^BsW4NHakk#|cJRb_#LOnpH5*!I44YKi~wnC_gMz0cLaJ~CWI
z+t={cG75d6UZG!Zb24>0btMU0jF3hLZGt^N0yNvOuFHlpUW1dF=U)^>u_a*y7gc+R
z9oZLbbUCsUL++eDd_3||&Bw@pgAgR)9%@Ki&}I{V{ua@&^pV2|U*<rUM~~{Q3+0Yv
zpd;2w9zSUK2r1)Sy?Fy#gU-Y{AL9u+ux~vHw}V#Vt0@+*hQ)?{OZ;&>Zb%U8P>{1H
zJe*n@NR&0K&=Ozd$>m9y;3tAs$;I|B@dVqIC(7968Ai5qW_k+(0XPHbmi~&1Ji8OP
zZ+Wbb@!`Iy@UqzQE+v)Y@`zZ0EhkLwv7FaTND2VA5MlpwfM1L>0P<g^?tGOkRXBw3
z#PtZx^yJ0{W>#LVx}|@lJ{~h@4>%JPsq7*_#B=n%r81TNnQ<oAuIGS(1<Ukg&8SD9
z%YO8(F7!}3EW(eziwLV83>b!6@w7h%5sl%av4_hh!7Jbjx<;q4Uf<jD!RmvYMTt?$
zuE=3vd+yKj7{`5ut0ut<;3`ja4UkR>t2OUVz41^cgOgmJ(Fw)C*pe`xWI#!@Q2Uwa
zRpa~Vn0FogmmNz}l&zAM#*<@82f~`D@v(ap%sN~GW;U>Dl-Ek}%ytr07;cyd?~W56
zA&%$P_dN4ujG92QT3N%qkWYehvS+v%qn9T!H4p)7a5wc#mQfk5)*P9L)_IF*tCK@I
zM%&<VKD?s<_tyOnBF{(tzo>(?q}U!(wlwq^b*!W~awP!#LU?Nj-{#ei0XnyR*NdpL
zw%@S^Sy2Nxnrgnt*|L6io$;MSn)uhrTIgJ7D~ZjT`MdLBg^3=HJgA@vEGFc+8slK7
zmf(!@?raY77C-`onIurPg<&&s+As4R6XN0<9ZXpWIx0%=n?LojC{4(|TyiD)uQO(r
zg9y62ixgN-fhiBidd;A?q)b<5jWR%ZT&b?RKtk+MTRHuguve?>VMW;)X}D0Vfnas*
z#c73`-{@<<iUx=cr|~F9ASW;A@%-zgipFWn(4s-{;>B7;-W;~e;L14oi)oio%S!&X
z)UCjBlpP};Y<0S*Y(4!;Q?Gvn3`dS$=Rsk?Q8#KIq<lNXohW~!nS%w099mPZB8oYh
z36js0-LS7rlLag>!=}Y<p8xMt9XGP-PL~(jl5Yj-ueL6i(W^@t)0ltQFq08GS5pU;
zyFUYhby^ClPoQe0hU;JrM7Kuo`AbvPNpdoFJ%+06;4a>=nrdRrSP!NjW=UpHF)sk$
zn2A58{J^Io#@7jy8+6~Iv2<v%Re2k`UBZei)nqd>0fL0$iqm$w2UJnjDlDMEzj`8<
z(5BHIJ@Mn4Kp^q0UC^3s-=x|H6<>Lcyj%OBNiX`RByIPAo`A08%s?q=DjTiEcTCOL
zPMo;21fIc<;c>FCsXWW6LQ(|IcnYHO3%9sl$OoliFwSMs$XQhd441D4@IdOusLlN=
zdhfr~9==Sa_Oo_bp$;S1DU`fd{NKv~4?|#_AqwU>6uOYd+{wSu#!=}VRR4m~I3Uy1
z!2Y)9i6_<EFCDa|i{E^JlKeCBu(IYt7JsVRe{r{Ual0G<uuH(#`d7qSf|@MbsrX2a
zGPKnit*2v#gp`x#8V(AYf@7K0PLpjXlO3n>9(8c>TCa=$6+m0W(LFM>7ww-I)m&pu
zX7S-d!LfQE8vtx;9-Bcq8m>HL&PtV~;Q;T(sVK1b3NL_;8(ZHLg4}4Bl=Gk1^m|Z;
zP-XN%SHgey>$J2=X(Z;`SbJT-N*I3J$dEPRk5}D5duc(-R9e^DIzFQ*qf=S)M=|qR
z5^!qQKcgwel19U&cyH<tAyNcscYjlP9`JVmw@k0>Ovt3UAJIZu@|gZN|5?`A1#Clq
zjMKN<u`6csW!@R_WG#7wAx^Ll&8|Pt&Nsnnh>~@oKtu5Yja-O&Pts3!{OP<58|?H?
z1jOQ2Mhzq#-c%;Ob=@nk8!Fi48-f7#?KWo-&0nq~-JCwg_usdFU81Mgc#V-!W5O2U
zkVv_<HPyFob3h*a`V|MvvG%lu{#CaZj4-~VFOAzp+7%n18~5JG$tyr{H4`*zav3Q)
zI5iCInLSF_Qq}k=C1I10`Ws{I%(vJF@^Cj^JrqWwPOH;L*`c^o8=u}y=(dT#T!C?!
zZOj<C6}E(Q=3S$V2-5f)+w61Ig2?`HQld%0uGXc8w<lPWo5*!!!yA#?4WZ?9Ejz%P
z_Aw^?0q=leV+<T_Ux^&d`}6AZEV6VYl9Ls}IoqIq^c!h)UtD<~>{{Y_%U=N3TxFW%
zuQ+@;{+1Z{G$m9R>5%$DflI;iOl8(P#WH6MOptBQKMPRjrgNaoYQ3?2VMls;G_R<y
z*F}A2e%wQWyqx{L*(hcVa(<>0ANoLa@u*zTBF{%`*KaHrNO<i41waH?$bS6?c-`Gq
zk}C!k2|x88$}hF0B{i1KWs>Sd!gqlp+KF*1QZ&wqe8n*eEAmQ5>W)eE7-IY}0+*q9
z=u+!)C$HbrYEO2whxppI@aCk=1qzwhAV=GH-D0sZccbhmVG9N)V4Oi|6(Aj|M)<zi
zb@V%*XU~JPee0}n)%(dDd{Ahp(XJR<0)E3H@hgOesgy||%5;amCkOTB;DV05Oba!h
zAkhaJ1HTH;r@)YW;-L(U5oV$~Abc)2RK2iT*_T~b1f9(hA%){>k^~1>;U*$8*d#YH
z+lWaPoWQl71irm@r>oZT_Yuoba(}=-q1Xb3RqPs586t%wz(Sj;hBV@A8({QH)O+7>
zg`EQLz9Oe;eTq<oaEOi1(Ht|IkkL@^6LmjI&uc*cbi25=@uINjbCP#G$>UB#7o-Pb
z3;+ueqGWbyCB%)#QK{GCPf(b_c_fUqILF&b{$;6#+4+Elbbx_wa64#sow5Qg{U+@7
z^uZS|*JV_0@1lq=KF^(BR)J*~f20rwff$ZrA$eesqh%{DM<{;$S!#j0nVjaNgB<P9
zwvfxq(S%^Mp-L=F50(dw@=!i)MeIAaj5*MR3Pz%yA%P{fX{New&_2<0Ttp#CV>L6;
zA9LWs24J-mkNpqY%UeO@=Ep?}2QnKJE+?5(KTfbf-QKMX{?4K0rNp0xEz+8sr1CvI
zOEPxcEJ-AsLhZ+&<ZszkWBVZ-zl5IVoy3UA_Wz7Cuq2@PF%<!+C$0_P_%7KYyOhO>
zY4qGMXT3C3QK;Uj@+eurGk!u@p}p(X4QxyAU-><0-;!3()g-NE2|~V$E7Bj{zPK3w
zp0!#R_|&|;q`=E0&Y1~wWokS?84elpb?BiK4h&q|fbl9wE9tvYxMkrUPz_Am7&njG
za!T?$b;0v&i+5>+vAgG6Q68Ghc=y{Ei^!qikS|H_`toUt`(-Mb+D})Y;O?MSfLPqY
ziT~UfrWsfp%o7m7ZCOz158vHFxrO#YCfBQUISh#SvG;Gae$k_f0w7+V9`ya+WQ`IG
zK#`YD9-0trDA~!wbheiA&lDM``pdpcFijMmMP39}?oZQ*>RLWM2{A=-iY~Pm+`IA)
zbId6+NTPjLH)oe01eZ;EBqT@C4OWReeL*eBSPe~(Y~Rb2Q;5vKgvu|MG#J<~{QC3)
z+YC>AFI$||q^pU_m0VK(w(mJ{R6&JpTF`dgh(E`!&JvVmzLxq=`Lx=bqBrMg+ia7u
z@eaH(EjRCHDu4AXM#p?Ux2IV%=n}O7+r-QKC0va2+WL!u8xFbQO5?)}<Z#>-7{0b1
zm%ENXjK(fRul$~_-cl+u<}s6Pxy9~1k?~%r5}2LiYo4n^P^dKRDH!iKdB70j_Id@v
zR++P@IOJfQv;$oZh|nu4JkWYl@InbR)wrvF)Od(7k&o?&h+C1L_Oi?mgF|245`PNB
zYd<FH4|8$|(pyo3)_|~mhF-)A==RuSe2NHs3XBM$fyq(GilTFTVo#*+jI0r+aavej
zTo19Mf=7WMG&&7EeS0Xx;VRe8#G?N8-2bOgqZJwa$9VnR5NbqM0XZ^BPII?oCNwFY
zKYSF6qhs7j#Cm<f=>AT2XZ`ruxF5)9pA`5nufTB<0x~YWyeO<%qm}quDlY1JoZy~l
z+_|^mqgk{TPX#RV5+va&@6V@lINLu(dU|Fjw&)eM7ws6k=6s9=`ws~c6G&K^c}Ro$
zZVbsq8uLQP#26@88Z9u$f!LbcwLMMW4~hd+s9=HI3$J5s%TQ@J0{l<hstxnaCDP}j
zsd04re~=|YA<BsU4vJWcL5Xx2$DH4tC^~Gk?n~x2$<5Xi^5jhYI&9;T?20)aZRdJ2
zh^IzQ^N`+AR@34c^i-K%PtIo42^cR7cn?Lv!@rP}<g4FDT?eA9_)<=1J$ASkAgmY=
ztz|*O3kAVB^a-Jg41d49ac)pDb?>J>Y&Huon%WAWA}id?nhyLtE3rIchYhb!N(jhx
za~qJ|_@m~@E_-8ed9qc{8Jg!R6}-tNXRnZMYFfq!SsSirZXG=(>gI3Eypn0>B#^AT
zh1w5*(W!vL+V*Rp{6xP~z}n}F<g<}7=!`E`w?WjPWx?oFF7CLI+FpKGAi=9>jX?bA
zIQ?cTx!nf#9cC+{@_`(I^>RR&x~(aY%kxX(d^gDuvqsS4-{0#i5v#}f{PU_DqyWrc
z6UQy3LS=?T*5rY~c<qsQbi#S9U}qta0W?Mfws4;Kf9cM1u9oEU3PfFo^NcC;NzZN*
zxJu%6g3gzh9Bq?pkWf4DU(M-m_158<aLF-#CghpB<SoE|ptc6u=n-V_MkZCM!s?1x
zy<zOojYF*wl<4Xm=zYl1ngnDHs>dVh-=MnO!U6sJ8sRJ0=eNSsRX*bVJ0a3m;g&I4
z7q|KuIbm0PcNfhCTd;VhFwKmA(b)8b&i944<aNfkfcM0xS_ZK4pcy_*);?=(Y2+go
z41KbnKPOH&Fr7iJ!s`ccfSaXk)$DLnk(c$>L4OT*y{Kj$iPH9Mw6pj)heOnukaE55
zg?lr;!zVliimtNLkO+W>e43V<l-AMCNN!~O5kd)6x|ON93IvuSDb0E#L`MAbryRvf
zlkCwyEfG5BQk3AIVRlJFECx{(&3%->yjCC4u4R*aOa)UyZ1BWq<m>wZ?OMJ2P!-U8
z^}COVsKE(ZZ_&C7-e=lV^E8qOkafa{>2j=lx<t^Rg8w;k7Qbk#Gw`yRLH69Dj8!q?
zk3T^PojL#2nFD5ks0G4F*rfebqn7WA{=!8NHD9W(Tj>&2)U>tGQvy;iT0LLtf_KL(
zG9a;B_2b!81FK(N0UYgo$>UkUO^X=1SSvO~$p}r1IyTm8m5dn>ML@9p-fZ#SiN6;t
zfE1n*^jD)&{r7RrM$Hf4=#&05q(5d^Mj%OlstZUgsmIxLI`R(!0*{(acuju;Qgu&o
zt<HJmF9$}KT5&LHl!nDDY<sKhF!-F6oe3T#{F(=-=ke%0{$8Y+4FxCz!bEJ$%F&_%
z*vj}JPbpCKFwHahylu40Q8+0S^H2zxqLkhFh^^97C-UHEje<BWojds%d2E4#jbD9l
zZJ|KKWf6Jkf2<%HS{5MUlCEyaH{XQP3zW*Z#-HB)TNXZnh1HJK(MsbOAgQLmS~Wy9
zoIc$iad|)ZS|O^FBc3NCr1qlu<7YdyW&<L#*T|v>_4r~|_`r*koP>`p!AK}fnpNs9
zpy`-9%#7P)%hnP!cVEk!_0GP72Slk8<-LTqADz$I{_qzL%;<}&)AMJBls}bw>h3UO
z9(YE?5+426scN}t<9+B8YLndj?B(_tLsq}(ZFN^fRPym#e;N4N_|+b@11?{c-J#h<
zpER7(An-q*A2rKAnQtvej1gVB-_OesCknGBP~?VQjwFnfvQbDdOjc%wiOrdR5{@jk
z{4NDv(LqN~{m3oaof!n>=?V&UAJz^&6x9le{b=o^W*w<uy*}hCl#uCEB{U<lQrVxX
zonje7jhj!Vk2>j!MhrmJUP4pBk&`eV&=l08{p?8hgOX2XAyg0aV@sF34~%0#LxZLp
zRcKY*MUQzl6NK}2<R|SUmV4-DbYO#)BS-Kl+QubtmXKdXff%?=WrMf;#^>eB6)fP&
zv+=i-3E1yx*P(VV&%bs@j=4;l?`k>_=5pQ3GVSsz2T0$>Whucb#SI=zVVV%%(Rd(>
z-YASi40bGgQoa*jMK%ii`%2ZnK7tR@P&u~RuWIxo=^PFkVcXyCqoTJA%Wm><S?^(%
zD?zW(Q5Ce=ugao6L*w({s_vCr%E2I&OKxssWjtydvg#MkM+AS1Zvy1U;EG_#ytF3u
zMUaL1n6tjy2Y<n`ToQQ?igiBY;IE3OW*J;*AN3`dLm2B*LDRIHOYZ5Tmevi_$dW5&
zWMkT=f~cd{g(Ba2UZPDbO>MA+Bq5X|U1S=BX9E(e(wYosp-hl%wEa?t5&$MuVLO@(
zxKJuJE|x7h5WA+aBfM}fM};`y%YQP-$JfvAI946`r@O<7nxOtYK-6iOmR_ti%zLDi
zzVXBLbkX`Go=DEG**(`Q+5*cAWHN(oE^ovZ(3IPGgv%24iLLWYO8~#Lf}$7)Cl%`Y
zGzWn>(v28kj#Qi%FQk6wVQ>BA_AxpFgVTTn%lKCJ*J-DZq>u$ej)DTOa~m4Hp+|iT
zKePvoHa|Z|AfX6VW7ycHCK2RUSdsFd1!7TPJ8Uz$R}&}j%<*xl9DQSmZezZxB}q!r
z9CtdHZeRKsxz3oifAu!UqX-SRWG${>???DrgD}1mP1hW>m_fG{I-9%)A^sG}e5`He
zrijDnd;~$^r}(-upw6Z@2u(-Y0Z=0E;P{H9J1(Fo{+N?!fNsSa-}ni7+iO_6UexL;
zT@U-GfulwV7%mTinj;D0+cTWoL?|9DfBCgH{?>fzrh+CWZVRPSC9JllvF;KdK@TfX
zaJ<4g>_I;h`wkkJvX6F-ZKC>hisVRrBG!AMbG%03oI>;UxKwLMmtEZ`P#h;F;PcBi
zGVyQA7haY2H`=r9Fp-Y&J5CAjbU$zNXS;U<-&F%UBEJqq9^i5IjpFtqos(BQ%k_cc
z^&}o>LUTIoVG~1`=!LjRl)1cgU?)9K`=^1Ox<k}7>w`Ts<E!j)JC*?oh{vC*0fIA%
zzegFT1eMK;1NetoP!D}S*rm&9$0lnm;mZ3MPmPcz%o0%qVpDXMyq(X28J}x=ZrG^=
zzUi7u4fkOpU;_%DO|Br{ItA6i4`UlrkLYSd+R7@K-iN@NBs3BE!krUc-=IEyEwo@G
z_O=`LbNIN%rqG*r^C=(-aqn<GJSoVG^{wUAdR)tP&sn3$Vp3?sYRV!iMWc1@l(!`r
zeZSLmb!lN4N+6N(MZiCg1a*3b__N7}lhq4V(y_C%v@ZuT3HtjWUUt|;(L80~TiFF_
zFvQ3|VxQ3ul#Zm9+dFT+yJJY={hMRtOKD-bOCX2v20btzTLxtWY{G+!7uE3)J;y3a
zCI9dj_W|}?9T9Q&#6Ju0FC!M+;Dx1Oh#7{(X1X~T(jDby?w}Z8PaTlntTawAZu%x?
zIpc#b7f9nyf_P^LOjzCCfKOqy3fs^67!74Xr@?lkO2PZDReQ%+3~?zz=jD)WjuM|X
zBJ7@i8c_MpumM!Q+e(KVP5>Q+BA(%kSxv!Xjam3I(^*L{DmDA)KU}Ahlri9)`oh_0
zij4mCG9iM<t1E9cUCdV${@&Nfet6cRN&LACej35AZHM8q__3=5XtcokUiml?)K|3+
zN?TD<CT*~=XcZ1bdhVsOvGVsdS)kuA;SFTNv*(GLw>EGwTBr}_c1;PQO*pK^x5&|A
z%kICHcKTF($xN2*laM-Y=4Z=13ObY!4e!dfw7@{sVmmJv6YV3J^Juu(bP<&aA1_q4
z0{uX%<d!*5cdZU};U|q6<(%eJ<V#ZB;INmn4aZ0zs=wo+(yUU!vmDXlL=!eyh#%a4
z40FHC$n?>AVGtnS5fAtgbD>ui-&+Tqj1okTLUsg9beJz{Nd@pMg`DI&Z8PPysWY*<
z?DAcX=iPzS>@?*UbC>O-x0QK*QYVY#&mO<wD`EMTXUGb~6*AJWQGB?%=jc!kV{G)L
z{{uupyS~*BJwlKTCXVx-oJW|8sQx~jK;qCqy%Se2Lx_K)*mVi1f0UhDuEQV<M7I<O
zHn9JVT_5g8Wnv_}fl=kQ@j&Krfc7L+Su9jiBd-6?n)TQTd*a-aYgVn_gII309_S7B
zaU@%ahS7FAGryH}5IwLH-pASY5Dl5+03g}aAkC*H%#X8esy5yN;QekiVg@5gJXU?6
z4NdR_&2l%!U9a3gA3t^9ZpU;$1&J<v^bY#8XWCX&BUs4`rrs4n@PSS&1FxsS@@NM;
zoB@qXmvRGr8i?1^42)Y3{tYsdKNKfn)|_5VLtUHj{!KdZz`^e$LEXKYMvXKX^B+jb
z4JY^#6U)G>X+(6nrW;16peZDTK2F-lf7`Ytn{@@mza@A+CH9PL@!#VeMv(?Jo4wyb
zA7`yzxm1YmRpWj%Fnxd%3(Tu)NGu%6=6y)K2!0<uF=_9En&i&g83`i%ej|@+qEvnQ
z92=7JWVPiHWTU}9F|l?xfz1j>6J9j@q@+LG#A4LqJ1~uX&?|wIGT?g&*XmSPp;#)?
zV>{6qMJ;-Rdm6GA*We1)S{^#1Fwp29W#^K^Fbo3GD<veh;r<sZFI|C&6c+8$il`Ns
zGM{{OLk(+@Tmun{jT{_xwc`EXP{Z0BaUtg;FMlS>M0v5*xgmzNIpcb3(FvCh+s*!@
zp@g*=R*0<C1rtj=9d=5WG=#7g*){k1m}mR-@DaG!j7viZYmr?;*0i96^{b(U3!5~A
zuol@h-eZ{{sq)lweL48894iHU0|c;1b0l!@Puv&`BD2QFbjRcb@8PRr_UY)?VqD4Y
z&VN7RE630R1T@sO7Kt?{dSjpQhELMm>HVP_?RzDd$j<skN>4Dzx1(R{5e@iBKYr-g
z{^r;RrG`k=Qb3d;wmtB(P_~GByJ{rMTjbR+MxUgo;BtiV#Q1Xd>!nVMM4!Mg^tk}J
z1-Na9Yb^ytVP1By%vi7^i;6V5Y$Dcx#t+af=%QH3HPoaQi8T|Nvw!>><wEh)jZPbh
zHS^)dBB>M=Ex=YoO=_BiPsr{tD49Zf)>e>)n$$Ew#6L-v(NvB->7YEiD#(wrGfH9@
z1cB(4f|@G#zgT(pqa|WTE<hZk$m%XTL;KxGhdX>Et@J2kNlpows`>^tf^kekayR<d
z$op^L?L0sHp=hnklg^FX*IJ_|^soBxhq3~U-d8tvaDo1{Bt)v}Th~}VZ7k;5jHs<_
zl9Eu8swdY}J7UYcg)~H~!Q0=R0EnJk!|jp{7G1#46~{Ml;(XDE9M~50d}%0MY5>F&
zmh$S!H3A1=l-_8PwqE!qJmvL4t+@<t4*Z+3vtDO8ad3HJ4aecM&Bb%C^^?HcsqlM{
z@{v9QhBs=^p06Y%wd#pA0$UExBI(!a&r=en@9JqaVw-H-uWInQF)K%7j(?!wEA8s^
zZg~d-4=Tt2S)9v&3GKn5SeoNqzqQfVY^RyP4jW#0f?GXv;gdB^0`Dio*QK`Y_=klO
z5+3Wa2ha7z1m6pu!a(~`IxzSlDp|E(;b;b9l*|}C8pM#Z%nyv{2I5>zET2Y<zwZ?^
zQtaI@x1A%wB0ksr65B(<fyoGAn@EH<|A>Cyl$~3$#2^SncXTUa6y5*EE+_Ldh^dhc
zbft_u?S>7uuL%|TSK}$ps{8v4`}I#Q#2O^w1r05I?mI%)#F2dQYOWKY_itQ=e47&<
zEQx{ac*S9<axNeS+{e7mIw?!xYJDDm;|a73whwxixUiTM8|ku1FV028VEd-%Wi=qW
zdrOPTjQg47T<r_?(iKH83%iZg0-I#+T=5IGAJ{gZO*|c%nbkqDMRhLu1>2Fk(V%uF
zKdPEdY>qn<Ns424ThXmLFR9NSjSX}rmWYdg3?LZOidX%p0)7L(9<{jW$0v77o(Ecm
z4K1Z-!jxyz*bgksizc+%<%`*^W}=j=BTf6GI5D#<BQ6pZ%|w@PK27;!nd8k_Gvhj#
zjAs15EbUR~7vqM!TQ~PZGk#S3iqgthd4V|6HuAD9^!p9*Dht*!HA|iE&n%MP!0-3N
zcV<wASc+ueOoEHUT|_f3+p}pdXf)58;cSdEiM~%WKD+vCbW%_f#@p<{8a3lotFy-1
z8s#xmzr|YqDZ2t3h(QqcC8wzP|BoFdms~`=tREnYxC&a@JnS`vt?u<w(P`DK)zCj$
z)!)F^6b36OnB3dxSf_UsbDgWqAa(G98hF#2KA}}sZ^^D^usWDQL7$<(=*Rto67u6@
z&^ow536#lQYaSF2c@z4c%KfUeySpkJeyn0htO4s}5IZnxe0-t81H*Pp!pTzxv7;H3
zf)5INiYB199Ura?WbdRJ+ale{>Tcy}>$*-PQ3kblRt+Sg#GnMsuFNpKDpR#fkTeCE
z6GFY1HcKAFl{pe5SSF%7!sYP*UY*CUGU&RqY8oC?tp{_9wv`ZNRftU(STzNbU%1-*
zPNW>M8Q_*c03T?ST;boU?PN_D?3VDFU*U{2Am}8?*l|?`3MI&zJ`OSsJ3M0=y*EEb
z?ETsXuOkCS6)<Z!|4Ig9gI$zZA_v4LpxCV?`Q;gm-N`j;SRxy&fDFc4(%UQstAbXI
z^-N&aST3udJ#S)PmwTtzto~p=3=c-y&tCdA<^7@TT5=_ZLD-cN$fw-@Vh{5c6_jX#
zG;1`X1t;LzdE^lbUXLZ<G3_Vgo=T;`dV0-Z^FLd9cqMtRBA@dSN)lxQ(vE^=PiElv
z-oJ<)yi8$5!rEOM1Z9(qRA3?K*Fc<WYnw8so#b#L6<C;I!M}0+m`h=JB%-}(>|;*6
zSCqCAvk=(R#G{hBsX&gGvC+dCq2?ja&5|rFrE(1kZcz==$a>PmbV`58_)IE*=J_@Z
zW;LV5PN?A~8Lxm&P_r?^5ZlIUKjE9m=bTLcUGKn93YK}q*+NY!aOU-FIyM@zu<e11
zWs>a*oUOQF-0<Xs(Qf;W#-##go^_*l5q+s?!c13j?e1TnE60B>HK3BbFnwouv3@JQ
z0+pV3L;8MbEkgXe_ucMdA9LcVH<;34yN!YQc)kl=seo{>kwOa@%y40~t$eI_ZWR>v
z^qX#+bHc0rugv*7^6^Oq`pqKynrY2VuRP8hxq_2{eFG*)Bkh7XQGF-HY3%cJd@J&g
zva3y^7>0mXBJz3vi#_Z8Y0#OvfXTF2LUxTaRBKi(ywMdLiI+U7?e{O@L~FF<2E}tH
zTm(|oDi^9?<x@lIi=p>p9=GhJK{AaXl#-`zLKX13H*OfSMKDogG|JK4D&Vr+i^Tz5
zCq_q2JJL)FRlw!3abu{6cb2rlMG9iG#CQb*9y>Q?T+6_}{LLP6GMB4dO6~4Wt{#nU
z4{kl<xhweMl%pmTb<~-`w$fHh(o!W=JMpNADNr;0o~}QWJ{f=iD9f)LYIp+#`d&S5
z-wRc;wG)pLs2i`1J`IdNF*|W3TRZhA(4#?JUE`?H{$%>~qd4&>u<;DR;9h+td1NSD
z!Ghz_aT|Bv0O>=r&>~!cgX4<UVGsM8_6dp!I}-T{SJLWnLW^1rV-PN)VZ;d?jc_F&
zp6+FnjeU3`787<{;Yv!pH*&O&fLPQKlkK8N3nky*%ft8`q02T@Wns9WD4ZCtB;0dr
zEwa|GXoNwCH^U~ga3$TITWS%?S5w<}+z_B$c=+OvvNPOa7zBavD|ukGzW<Ajvso6v
zCL{ZQF|Hm^>Bm>SVv1{psm$iU{OpkIJxl4co1>6;!-H?E7AEFJI>*FY5`GXbSS~#J
z#!ituO*-SbZ_fL&D&lbzD#&T(HK^@SZZ1-374bM9oSdjlY}2;zkM#SF`}2AAzTZ7`
z*@&9Mx=~s872nnmixqp`+tNd*5UGd<1kP+kacm^}j&dp660NAa0}A$e%h=@Y9QdVI
zg#Gbk_aAx4!<MXfZueHXD&paKq>=f~5p|YuNtQ0y3PSsi6|FQ`20A1*+)?@U5e!ru
zY;uV5wa;N9mddOwIz-M64s)CwPJd;{xk|-O5aOm)+hC6dQ=v6ZN2lT^zM-dWb~-rK
zae@zbR@aK5_?Dg>BkVVBHkHo<hFZ1aDHw4^J+a8sqJ$|QJ|9u7n2K-fu@GTp&{JSF
z&B_%=@rWF7vM8_n&9&|WeMeO)dlG6+OM*BbhDguV{?mR-KH)JrxEBWhMUs+7R{pu*
zhq7}$Vi<&B@Jb;zf$YCn{qfJ3UaJK-j$ru_A^kp)tdfIP98XH$xGRla7bG+V3Ga<;
zH{egT2ls(K>$8UA;$P1@Q+sF&8S61JeV)_(R#0}6%7JPJpPE5J(H=AF%B~Z)CmJ_=
zW_k3&yXm@V1-~=5hlh`7rVU#}i1(kRzwdfv?lVj&)a={oBP#H{xlN7bOc@Oo|I81C
ztSO~truK{|1tX(@Cd03K97<x?baIvr2*mhn##K3-h>{kvP)?sWUYAJLGFGX{(v_r;
zm2#rJY>e-sf{3WEvwCv{v@^x0FG>hp8`xCUx7l2Q?ac7Ojh8onFs|)=5BpXCFcW<6
zg_*ck;AlM#5$Ov4Wqwbjcf@iG1@PPIi6{V-={@oBP#;6*4L$IB16{$9joou$QE3!Z
zbNy&2Yb)`-3+7x=m5fOEGrF8Z_vcDfZsZ=U<vd_D@=YIyGSh{5TieM!Z3gTI4!A-0
zujj2qd?xoi%-QfkMe@h%pH}Na#D6F|gCvMS5D0!rRMh<cW1+o)rYc<bU|9x;VVfE8
zaF5Dh%*F!SzR>FPXXWn`>Cu-37`SgK@XPC0GquE{Jqu=>uaIh$WL)kfnyDoo?Lq9n
zqiep9T3P3l)J!e$XwQ1K7BSPU*p{D7Jk8XS;6X*yO@^cF9#!SC?@TobqB&Sl3EI0)
znPVNJ&rLJcB&g;TP~)u;!zag?@tUb7p6$WL58A};4us0tzsrn!N%W!Go_mT0C=(;+
zzB3sgq;qH%3-BkGh*Kl0W#+O(LtdgpfNGPy8|vk}M<(Yz-D9DRkO>?M0%B**XJ)m;
z^F8oil+oR(zO|?`16AVro=GQZEbiSEtKt4<?e8;L!Rq4yLPTa`UMy@{X6i|TgwC`d
zP)M;T@8y!0Bf-gt=X(%}9kA(bi@jf-Wu{gIn<}uIx&7=cRO-LAzxVCk0Ms^X$v0N-
zy`C&f%gk6wpnE3&8g;;WEV?f-n5lz-?m-iJY)hDecDnpo`}<6MUNY|k&9cf%*_Gu=
z48pK0VZzq?Uu<lo(NiFOntaSJsv0IZ)JrQpxP;B<py2sEeP3woGUz+ujZQK`D2yYr
zk&tKbM;zP2wKF~TNUdsX%7;r1WpWL<{yP~}5suiZ%6B|PGvhM&W#QLCo}pEh``1>P
z>{CG+q-Eqv@bsQ80Pz%#3r(>G_rZ`+EMXo*SdmOkw0cRI?*^NZEWy)z*k9SstESf8
zZ3fSsX;epWm3m2orubU#_L`CYz!QA*d0rS$w7Ax8rGaJCKkx*fRfd$!ie-Ifknms`
zF%3MyhcJ-CFsG2Zwt4LH%i6EEnBHPX+B5D!){z@!1@IxG(}8FFbj~*%D+M5Ci^lkj
zOb4Fvvt-W2og*8czJh&{k-NZiew2X6V+<ma_YuIgjM@d>WoL6*6k6WP_zRo=cjebg
zdXpVCS7{@}5h3a+SD3bCbTsfTJA72seN993Q-j@|(YoNsuObN287#AsQg35_%V=HT
z`9884FcXDx=nM@indv5;?(?v%@`&v6oRL`Pekb1wd?-7&8;D^L2)1P4?8N;ycFg@@
zh%PjMqR21o-JMsp@1r)lTh1ijw-(BiyK^v!Vjno&bUD-8_-ki@dRhB%3`Vuj1)LMZ
zk{{QQQ0DLMtb$SOGri|SFf)9T+$)<xt>bo)sP$P&1RX&xpjNFIC!LjQA9iQxN)Yl0
zi%YYzV|9^zfW|+#4G6~sr|_=!<0y$DA7ZtLy)~S9Gc(<-V|I~4<3j`@xFYe!cxAa}
z$Lk_7duRCgP<Zjsh2~X^?vC9>V)_mt9gAMacQY~q^8fCvurYvVvYLQp0iPnpe%7(1
zXw>)ctbl5t%iU1`U#w#r(UWZD8#A<}34~<lRj_01&;xC?@Su5b=Ce{{zN`KGPhupU
zBGp1}4=H*U|9f`6``j%7{-QP+6?wxtwh@iuo*#Tly^j)Nl`>h=-Xj^Q9p@$ZNFK{k
zhNu;4s*Wc`V>l0y(PV`ENGevmV01hwdLXa-q_&}Jk`H2)I<8~y&_mrbxTW{GuilXm
zRhq9L{<tu{l$}`)!ypVquLO>v<o*}yy!4|oixf-!9z||&49pVI>%?5|h6tz=9o<*a
zfoDV*7AZa&J-PWCKdR}q!LAwXsD6f9-e?^KFNNhj^o-=dBFD#En>4I<`8C@-ccx!O
zhL1hACOmrMJ%59ITs@K9BUCs;y<n5u)`Kd~s1U49yGsO7L({i)!be|WA3I8&w9nUL
zf!#F4YBROWRi05eSe;`&3UP`yo~Vzd6M9DAV3FISU7uFHW-EQ?xhK9C>`X(6+@4?h
zDE>M)-K?|y7W-K5$nJr3gEt^Yj#yHTH`vE_(56^c0%|MsAfx!ECYe5H)3v2aUASX`
z?0j!(GBVE{Cs|aG1VJKl^Unr5(_v!{)^Jq?V@l*l`UbtiKL3|-U2<}#ua1iCyYS5|
z_PHig)`xb*2#Nb+Yq!=UBlxh{zDHHTUAf#Kuc6VN5l+}--*X$8QW(0b(SGa=^s(O8
zq$bg_)X3Qer>1??`g%r^VUgvd9iZk-{lgF_>n2;)Gl~rR(|o>^UE6WMAPidxj0mv*
zVwGq=YE16p1$-O<1dbkmoW5FQ+^@DNpH$%zel7mGR6NfIJJq3dMHnj0D-JvZJ?(HN
zkics$V$YZZUn;+k+WQg^Em!Lb&@BBj9~s#393PoR^||ebYQvYp@9WQFC2^wa9mV3$
zCC3XH1&Miz&(hx#QQ#E1`x`KQ)Xw19LGkIbDAt31Y!`?)?hGz?ijT|$i3xnYRz-`%
z+ge87VV>f%_!*(g>yDhYZ?#{)C7iLAZK9TpF}bv3lNTA~i2Y~yDDgr)JNc$OH)<R*
z;tqp1xa*~f119hKPj%mC!#lq6Hqrz$y!c!iV6a4E+C01G;nN8^Y!z9$0vu$-DCW66
z;6BITGeJfnx8;$MqL}CQ$O)1YG6%6{l-v5qoT-Ox&uH5PP`AsQR16t0iuHqW$L*q4
zOp&`)G{i?njbcYA)~Ir*Aq1<Z85<kO=uzzC_S8q23EVYRHVxs}&InTM@a<9fqH?>J
znrqRl5E(&=b+;k+A07}GW{J88Y<k}hW!H8DK?uTHauG%QZ|sQo1+p`n20Vvbc_!iW
z!7)6#%R@7|9bJr@v7`(WMMi+7KbV_AVaG#zK@C@iC?X@k(x0^elvYS(UXp^^84oq0
z_^ao8o~U}M;2-rY?#%d+v7<ST*f%tSTQ4FQ!$6U^7V9*82I|Sxo{zVF^{Z(!79?24
zw6j6DaDEH}Mbc_4I4DTrVg|p8TX)7FvAMGz^o!4GQLnJ?x5#i?B;t7lL)8s@mj6Jp
znnyd6t<EGmIUrBtr=K2U;aC}Ni$p*VP+5lw>ZOzv9eQObC=vlZ9uQVLqkZ)0`nR*+
z|IFCmf!2ESF#8<Al)H@VlQDRBl;E@3@P}!7GcJ_jw@A|K0iFzMg3$B5D;kD_B9<Di
zNEMJ)cAM9(it^-FL#ItyiebWbQ(!h^#h1+l8cQz{Q*ysDy2S-*Tp4zYSklj$o?~~c
zG=u{EeQzbkh?3wuidFAhJ!z0u==CVWoRJ9U+3P=9-Dc9)eKHek>_^$T<uDL}P;^Tp
zI*R+>SUrA~N0YJvGjS9I?!&s)o$8Kzjv{G%FH}e~vYbQDA{Q|9yaFNNU{^>pvK;7D
z9@Y1H*R`xXsL*D_B6&8p1ShCMMcj!#z^Kq>#3Fh2mA`JlDI(WrR5&xD?mjB>ChCKA
zGETA~l_+9?Jg3$WXf1e#lOtnPtq@zpB6%JRg!PowOenhc023OcQc^o84|he89_jO(
zpm+o;tQk>XMIu$r6r1K^Y>&K^Na9?x1_Cd8v@2E?cBI0Z5ewuY?9EB<<<Xw#Q>1JE
z-tBFfE$1gH9SodJ<5+T37&)?CQ%5io?)$m3q4;QcD^KFxygw>%Zp?}`ajYK|wvRX<
z4}(3qTv_A?lKrj(K?~%$Mf-#kw&3O@-(3lU7RqxqfKac5$efL8D{LRJP#z?V`n{2=
zGLvpYh3z8_%EL?cBymi%pc7@QS0drJUe7-Z{k-57xr1WIW<aw@u^LZvC7^C6{(&@4
zyO^W7;#1)){h{n^a2N(bD10T`r?TGvV&iL;Y=}$B1qj(JAikf+ABrMwXZoK7sT4Vl
zopN-qP?8jJI|le;0y&s?u;#;Dp(JU=?Of~-Pi*FV2z!?I_#1l>mJ|#>na_S-W593Z
zqw<R^+8=QE{LbNZy0IkBeYZk)QpD}BTb(CZJ*?k1g{eYGQd_)Tb+13ifxcbNx>q8{
z#yHH=Hi{~ub}90xM2=si`Rz-i4WwMAc87abf=6#x99p~zdh0!#vP){OaBma=J1Aaz
zi{TCbb!^=IdWCzV2-v}m+)uS%BX5pl?z$E3jUr%2ozcdJ9Fz}tlSsvgNQ=i7w&8wN
zx9&H{WJ}m9tR5{6Ti&w#Bp{9scP(dKA@*pM<MD|S%|^qId*rk$wd4n{)1CzSTkaw_
zhxv%rb;C4R*_5|e2tr!GIcRV|p}%-@%<RryAqXjgb6#xl*{9k>&nxe5DyBw?;2ey0
zPU<L@57%a)RUscKf^z^3^Fn|7HC&s0g%vi4`hauZlwARi1R)6fl7gu7|BoGYlgok3
zW%~i+pd(dU`n#3`_i7)wJ)rvC@n(+G<f(<6AmCT(vObD^Vobb8T1x{p)N^8+MeDS3
z?Dv>NTP*>Z$f55vEe;MQ1;oZXr%Ep-0P0o2n{i}PNfi#qyV%!{^{0U9jM7Ub)HpiW
zny>*Hc)>1ay_iTxoN9jd1A4V_%<qcdhDltBmm_%ba3BdwCYY4mGiNea;^p*t%&Zs4
zBD2_jOyWwc9PvE@F_wY%TvZGhM<z|(cRq!g)gVOZ1v!k7sA=lHgHo*H$=wY7lJEbW
zk*I0p<xIe)+3;|I&YE{j7$KQz>L>vJ3h=@{6g2&2?Dxft%4J9Y&+ZOZ2a-+^6JgeJ
zr;RfFjDlp(ugewlhf%=kA9harW}w$uj^qzw;0VKv9W4;<3k)Nr(@4cR^<3X|NZo7S
zpU>p3NW@X}g++BrZLgyI!06~S5^?-i)zRI^QMFV=97c|&k%)sr$y}%3we|l8{-Nv&
zk{|{_*q2r)TK@mBO`N?TbhdneajZnBA^CTVuR{QR)8TN`?B=?QRd;|oa&dT*qoYP4
z$qHv=d6qKx^U4nabUL~5InaDdQTm(U&u9BSbcE?;0z^XpwU!jn(YazGA%}B1_crO0
zh3NTi>`dwDLC7K1O1R~G&MZp!&bXUebbzINiqUg&Y*D5Zx`Wgfvhw1w_TOLNydNF3
zv%>-Xb~Xn%CKtQ&V$~g#ib^|tpr-1#;#OQ_xTNIi%ynsG<dE1#T{lv!M)6y#GkT?V
zj6}+QvqQpDZ@Q??I-^%=M_vjgMfnQ5NG3|5J1Cf(w2TZqdh6;e7-5~kD~(D!gE7Zc
zN9FpNdDWeCk2*Wp1OO{;97jtm{wDGx1V)t|Alx+i+8NUFlh3ww#<?`A?3mz2@GYLn
z(T-FIm$9GM9T{>+y2V*@;V*$z#O{DpWaT&t-Lc;t*_~$97wh=y=nVZM(gpi5T{whs
zrNABdJ1n%8(U^rs3cD}JAM!l{ekr?x9DqR(_N57;@c)mEdIL3)4-mo}6)ffB$jBkA
zy~ev5cD#S>&GtPYaYh*+%%~#Qrs~adCAE$;)`7;rO4~r4UHM8XgJK*xIUg3xLSL1<
zp3!gElksaz5-n$<jkt7!9nj_>-j&=Mi8+ps&@Nn4I_SW(7u$EgBQXaYw27&J4*tQL
z-&ep%Dm&0yBqC^B%|jPMD${cui8&qDc*X6Zbx`5y#r8cWBMEad*4IG9_3NiZRRNr+
zvm@*6b)tmA0-p`cq%z^gk)7lA2pe}Dcx-e%e9H=)MRtxslSQC}gZ}>BXpqW;8*BP8
z;j&wYdfYgy-IdB18b^B08nm(@K!$dx&!jSi#)+YWo0>sKN<XMhKiR$qB|So_|2B$l
zou``lV)=SZG;g;9<cQbW4)uGRK`QfYtceHEuxQMhGBxEF%XhCwWDv5u?I)X-0?#4V
z6|jul95RU15NP-2HO_vxTLml=J7;u=fg!u%2)_A!kBKFn{mzi#HTx;Mwj_o@5O^h{
zfad-eD@(t4I1?^FnT;tL_c0NeIr1{;%;J!$#fk)hzXhKY%0b)QQO_;U&oP^Q(Vlgc
zPkIVeI^)vwa~KYIu%+AD_|8UBW$o+J43Sz7ZtV$ILwe#)(U9EH&n-{SnXrfCqeBhJ
zyHdQCovGvLInxrO4i1~<D)XuKbrE`c4(n0j1#wO{eu&7;aCfGTx7uM?l_FYjAE-mq
zcMa}n^Ooo9AOPq<Lh|m13vpgq`;JM-OgF{z#J71#Yzgkj{%Az|)}co;Bn2Nz>OAhK
z{%8dA)}<wfMbfN%&gqEr$a8fFx9T!s2?l0m-cNPpc{D;Wv#x8he?Rl`KVNFowYJ~C
z>X<|ZmA&fpeye@QB+yt1Hq}$6i6RS3RtJ-?f87glVq0LYmD97z+V{S_(nH4^Bi&Ma
zUWI<0JCa2j!N~*W4-ZTw^arHCggVbMu*>0NCT0`KXMF4XiixM|2oj}r>%GlDWfyoi
z1|@mA4y<ya9@g#^6)rIO*Zxs<X1NW+Fc7^`Ws;6`|BIE+1%gsy(ad)ML#88%%Pb$R
zdvmtK5M*TnOCIap#=Mn<*NqvLhae1u{GriQ4uxy!6|qAHePvB)cis&5Y(Az?{P~91
z$=sFBab!SZ9qhtTXq>*eXW{Sr!XW{L;w~4wrn2s;eMQR~p57Jqc(NbQUdqC22R5rR
zbilGoBW*k5t<XfhqIevVFXB#_p)79-c@uz~UQs+~#xV)b<Q{+6^NLqEs9sS#&X=Tt
zx9ssxIM=OQYMaDPUN`wF6MTt(^4!1UQ9H0dI9#r>`D(lkLZNedMesac%AC3k-bYiP
zDV$5M@;c~0-;Yua&RpHPl>@fQ>)<YpBjV*uUz-$Dp+$O?*I|-lfLilNnRaT{heC_=
zDz7tuBII_*%*DQ}iHUN)Rvgcmk@+hWuPmV&L}V!LT)x40G7<ykA`l!vH)k7GVMqFg
z<6(M<KjvfJ$SC0aA1dcyh4MhW^t^f&F73Yr|K875Sd3ngJisFf?64Vjc254|8GciC
zEy)gpFzia0$PL{8VwKXxi!pf<ue$T3fB_qQV&vHGIV9VxZ{~1Yelhn7(-0BI!`)TA
z>Bb-1A%49=HpH<w_DtSxM81^1cgEUyg=~mLWCyYfo`R4{0wFQfyh1j_g5%+mc7cPK
zKV0YiXn9mBdrFkqIR;CT3kf&5%jU?HtdGc^Zo-aU=cSB2H*;CZORUZyO**S$p!Xz+
z=oN=9L>Db%ji!E#h<krx@Bc=AJT0S#mUW&t49o5Nn7f^%LXkvt(Gsw3NOMi5BfHbG
z!jJ?O&a&%Od&;oBjf{Wu3PTcDnmwX6sr|qr^Ru~SRv404pgkhSD0j}TwoFRN3Pln(
zU{8A!==mF?N&01Vq1r=cjT`w|uMi?}L-DjXfgZmyYUmh52W6EmnBvR;6|b-#;p>}6
zAH4ROl)L?9?8lYsYsMKT-nc)0bOC-9`*}<dX0EG*Hamr8wUI6z71Abdn4KR#@f2f6
zrbl2wkZS?2G%jwaoh$g@NHifnnqHYU!S!FhlwDi0#UKdVQms+T{x^0B_vfH=rrAKp
zu_z#Ud|vs6+VQrCYRSAkz1t|xvy!RChNfd;y~7J-^#|WR{{B1j=;LXFN^Ty6lw~e@
zJB4wIxz(tgzOnW6uC#TW!J=fsAM_4CeR-au#|3R<iDkF*qEqrp#_!PCiX_=i5-O@u
zs>0_)2JldMm!9RcS&7%h_T}TRah?%8p~po@@ZpzhaXuB+B{o?duWF21(zkJNQ)Kel
zlyzqn58va_7QM|lP&kjLLg>WYnOTzp5PtZ>t?h_$h0uu%;(07gfxW3FlNQCgl?yS$
zc<f)RkzPHX$qV3zLh3|D@z5KuPnMFS5i4+9Dhj6)Yjb<$j$agk>322HS2&&6tg<Xv
z(D4Asitp%V6iz2r&oV~l$I`dO<D}efr3hYGdM;cJ7iaI4irY}wqR0@QMZ0HTHg5AU
zyv{mR;dEky@L1F*=B+fb=;s@Q!s$eY@C1~JwyYq!sThGMq)u!Q9$wwJ>?Yc^pJG?z
zjf?q5*}3I741-W~OR)<v-v7qRNk2MZDh(U3tSG$9ebi^i6$o?8UTfi9zKXij;bKaJ
z@L*e_Ud~>_{MyAnzr&XlOMFR>mm6Hu_NK7t3Ok%ei3lEKWeotq&5ojYMeA@HB_epx
ztayY&^;N&fcc_Pw%(8rvW^a8zo~*?f(%~LTQrNMl0#AzCGA;hWPTLkyJm6e$OXor7
z(f>Qn?qt|xmNh0m7X$4p)Kv99XaD{tku*8k_97KNrkw%bN!_-Sv?tng#?XG0gbtxm
zcA{zBklzRwtNi7(LkyG%-Z2OSz;rK9vsaNwI>bOp;2liKChgRuIv4luB)|yX(Fu4F
zJ2HhNa|UFGUndd0<2^lEe`CPewNva~JG3~7=p8mpo=H4&)9;)jbmiGU19B(VkB|Bi
zI4QIn&wF>0YeetxmoOar#Nbuo6j;;_>rNti2QtX^ff)PSbrrK^hju3kz2hA>`vdRS
z)|b%vJ-HF>n$SA~)f$g$0diDD<?fvQCo12RommpZAP7XSq)}Y%f3e}^4>48K7oaR-
z5U>{tOzeZ&WX|7P_Hr<VUuGo`wF&|%h%rBmv{T@!1dcC~zT)bwI?o8r(!o}^WmXPG
z2;vHO6^u4-kT=Eb%p!P)1i0W4c&_R#%OILUU9$+@nI8Os*F*T*L}oW--SLLR)V|_B
zIKVSq_M|K8KI|ls5B0*5fyufMAQV!ZMexo>UeRlLuc7e%&b_L_in9pbS(6>#@C2Fl
zTw)7J%IYBvS)m1Y2v20#9D6FUqX3qdPcVC4zWBOS+zKnsB6f%JZ=#OG;YM8GpV*&g
zFk*Kw=`G0KdD+u1Rt~0c?kr+=Iy%Ar%K-I%?}mS3f3G|Km%OET53<(A`#k;gLt))n
zJ+vXM(fHLDHlM%cP?&KRu{)kh{Ic<l8s4v7EUbn?V6%Esn*H>(_vyF6-Ab{QJouDT
zRuw00TvqC3x0Os4kvm=j?g1QsdWrnx*}zaZW_IZBpqpHfpYTL@aW5DO4a^So4wGoS
z-0^dmhh*!IvTMs>AOwL|@&&s0zgQXj(eP-~*#nS`5d@vbjm=b(;jeif7z6^QGR~71
zn<*txd<SrLY>)PVDt-bpxjup_r1cI~{?;{0#c-C^nqdve2p+G%hTADQfE8^;N;0$|
z8Nr1ISSG!$;{D{FTNwh5jBxb|4JA7(yM2X_k}@<I@z9;V1@_r!UG=HT6vH+V58Q#@
zg3Vug<T@}H|IH-j46<}6PT&tbwjDFGLK(7&%ph!T?Y0df2Y6`B7;$A7Au@ya@}-Yk
z2ir%_ftjR?>O0oB&bRLUSk+H6c^TAq*4-hy*`z)Tb7W;`72;7lXaMn^jaGB_OrBJR
zSRo#@vs&Ahk}xn3=z#nc`)lvuF*^%yPMDw$CivV3ma)ICiAU`~X$x#5ILgfe<EjiL
zL;`BZ4$6hAb!dpqogy=3%A<DhvI>yGfJjB6kSjy15Rckf{XR!+y%$MEkz$Ay;!!(I
zLFR)^ZwE&qBmI?OKgf#aAJ&XO!u8-;<P?AY14Zzn?A($V20<vgrA7;p{co%se>y16
z$OfpBMqas(J@`^BnOPM%R7BGgG?P|H3bJ@);co4(pI2eEmUKN89)Uzn9-l%Ws~Vtu
zZjar>KEEq*(et4Z#1yK*U`t|Gl6REk!A%^a803oj_q~aH{4W=DPeX3dvy`#?lDktM
zpU8sl!B@$XE5MMyv)Mm#rRK;gs_er8I85Z4$4%t(nImzscNiwqBL01o38%t*ki{Tt
z+NU88<G&*Nw5k>6gG4<ZYI|qQ@oB*l3wN!s6C^rhc_ZaV*U!|#OD=nboFEa_1MN^~
ziUlk8{S%H>NCXm5JxFQ#m~DPf$+gM3EBQ5odKxQZAnl_Wb_RA6`*<azBo7`7h#o(K
zjpJ6{EA#}3fF5=Yen%VH94%{kdS&&c%Lhu>105%g2Ro~6?yFEAB*J;TjtyKoC`8}H
z-C8U31c`W_fgawJ{PkYV8$!K_eSRhp;5xhqV#;n0CRtnLN&<{v9-S581^>}VC2|w{
z{QgBQv;8PLmn4fp5Q=U|4G8XkW9><gP*U}%%o!L0NbZL{x7&E3C7NVOr36MW4<HKG
zB^^QXWy$wm8R!o%&w~DCU^MniyO+kZLa0zX#3a#*owx)D!U<QFR45f1!92T={F_AY
zUi&&YU9l_mH7fF8{UHxlf!xlL3zSrTTtr14>kr<E!u-&)t%g(v?+E8veUg8+pDw2D
zKJQ9jh;W|W*@Xom<{wDoT@|)M1yMVGiqObd?b_;z{Q0a<LG*z0_-gwt0?J(Sj9(&u
zzsY0I)6r9NdYX+a11o(Yf_e6B(w+T)V!da{iB$SR1oO~%7a6kCWiWqVu`7My0P|q-
z^;*0(1ZtBksZ{R>=3y_71_d&3&#+%2f1kD-zS+!{t2G<K<bB1i)NVgivb<xbyT8ZY
z6U4);P(jp>@fF#RHAxY(o0*=*{>*Ma*01|(Y+NX{F>Bq0szL@)|0aXX3K>MB{0?s9
zJGKK8(C7BInH4UGM*NN_<|4ECcy)`D(~Z^ikFqm6Vi<&hXiLV11^RC+dd`<XOri!f
zHir;mj~}tUrofnQqu(YE1ZJ=*GTC&l_39kui$*P*gtIbSh33&aHzJ^2R<C`@^Y=fo
zkLztNQs)=qB=#@(3<b4Wh6d5*(rm>$4Gps?6yN@eeg1AOrvO<R?f3hE<i5quWYa}^
z2Pz<#&H`Q_+Jc#E>d`xO*yR*Z@c?`n-19ONi008dbPwStiL<c<J14_{kjL-T=WPMn
zHIF9X4n<XlrJ!qpx$?vh)%`V8-0Qv!NkLwL=dmosyF23TL(!NdvY<SKr`1=j-EQty
ztp=XO$`By5_+?EiO`x#xR%XZhzQ8jK2ze9_#47eY9!{1~f&s6Y*jhYZZlG8dvBv<#
z6UIJIW?!Ihy-@X$YNHo@)y!lL$4)AUzR@`sW^?=cZkZuDI}n6{j^F4JJ5U4>#2FM$
zBj}T77$EY9onotu2ak@MU$4Q~CX%%lxt#%a6VErKAg-Vq%g{^YAv+(+&MXIl5Co!E
zns!0F|HX#qA4n(71&l#uv#KypijuHh6*{b{-xh!0d3c6x0<zMRrf5r^%BmcvmseH`
z1z;u`q7cbxYQ-oL5;PjaXTF*xC3hiHVXuhC>{xkjJ0HzT4X_h;AtSqD63?7O%wH!T
z_(aMi_ExAd@&wUHD+$)Zp`Llm$>NnD7UpI_NZ=<N)2tivD;55Vgt=L~P5OP7TQUw=
zzpVXw!#!@NEjvt#(ld|tUbzxwJZcBsB!>CXV3?~X7O6xTueq~eAuSy!s!UBv#|kq>
zyylL1E7@k|DZq4oW8WLExY+>Sp=+zKjuj2l#1&R}AmXt*&+%Wjd3X;aX)0Fe8WL1@
zrh=OQVnc<Ryq$_i3937Qav@UDj31Y|D})URz#SwqEN7tgrI$#oROlMwVLJ#i(c^;i
zwX?ss3SC1yYzH(@Lq*fF_$kTvL}iYX^ng1zk4;H78Q?s>to-V`yF=3Tb{Yaqc*s;-
zrNS|h?y+<V!)e1Emmcz-KV@fjBvA-L(UhLeVw-<r!+G;1VpWp>Ww{{eU2dW8^RZdk
zA&o%$Yc@`~8t-sdT;^_Jq|c-{!OL_NWA0?A9kKILFu5Ix&ed?l?j)!ku`}`L1&Icy
zQT&(4*Zq<Fvs92~iAo2}q?7gP9pZ}bc%4`CbHp)>10QR7PIf2pX%ZH|+EifAJ1#QC
z#_nXk9kWB5H{#U9(D8mK`sxmM#S>^}M)UiPEP|-a_!Pa^dOE9VNwWrxcG@Q6qxJ~h
zNv#R86Xl=2;?~$=KGmdjns!a5%RJK=x3G`GMaw(P8{ZK-JVjwV0$O=WaVK=xF|NrV
zB-Rqy(pOVm3&?qg9^(nJ1Fmo>Fid_7e~EmZZcA@FphVXg5oL-OOWDb=mVP~=nm6nR
z(EKfaJyz$bVF&F*o4S<Ajuu4i6#n!MsmGIz))Fjr<b|Tj{1!{u$=}IF>)**O8l3qV
z1zDp*yzykC1(}gb9IbY2*3WTw(yXQ0)tqlg5uAOC-t5MX`J?O#av%sn*q6jnkpF*d
zDSJXRkz~%qFbX0qJ==~-1QT@j2`CdNs+(o0@K<;n#)F%sT8JTGJVU1=FBJj{Z^L*9
z1U_11WsW)IdozCB;1RfE8xYNk1?CX743v@zJBA~4htv|~vNGu#|JV6syAlU^Q$rsZ
z!JudZ>*3WzD)LSop*tjiaCZ#ga$d!g?Q0;6&>dVb8$mz@M85pyDivN2N9fM@ETgF%
zPX?j%WV;fqB6tT#_U<ee%*)OI1gS_zaRl!`F?pclIXy?bt^4lpcrr<Sc9=Oui4Ph~
zQXwSqCa47_h$Ufl;nJj0BNbUHmQ9ZtOgO>NQrnJ)`2|uTJ8?wspo3wB)bKN8b(H3n
zS0Z?X@1UWD_No<4Q)Qlx{i?WSY$}V6^6!XScK<p2&PslW0G<w>67;DSaPKKURM=D;
z;X77a;wCZWTeFY;V)^cnm@iuw`vJ{EZT3cmq{R`s)70`jwAV2Y3g3J&eqXk3S}zS)
zBNxy+sKrTz0p>45Kg!O<HeeV8qAU3e_Wp~Nmr7MJu@n|S4gyT@9rwSB-8_=FiN8nx
zX8U?>kKQ4y*CR>=eXaH#qa<^udH9ZXQewXgs11=qu?}YFW#ZvGgD3L6?9_m1=NHR&
zmv}z2ncOV5-H>2oY-jEq58i3gD{6v>@7DE_>lxabc<>I-A<a5L0G%2a7-)vICLX(^
zT)?0PI+Ut-=uBz#Qd+EMe^iX1-_&S1Q~K7iRC%-DhlQr*>-Lf}na3QD<f&BZZD(#z
z&YzYulr`DMxW~MqsE%9hT5ZM%$#B2K19_NFS;qq|99=Yt0?nG?f61YvRo1k=elXg#
z+B&3svVP4;59eVV!#Zfj7_+>Lr8PqW6OZR1*MX*?)`4H5T->Ym`_Yf7kAT(a139-5
zWSBG~-6O|39z>3<0|fmwBwEf?R}bf5zeNWfr@#Bo+ZWq+hxn_~Lc>by7;uE<{9^g$
z4=o2n%l;SYMDDkh9^)@jxwRbomz!GuYG2ZsYrceE;%`CyDxPMy`bPh8GC%oC`5(&8
zC5d4W1jAQ~G>W<Z#meWV17as^yI>qc0)_wa3q2~w_I!}*gFF;w$@m>_k+l-}4vwk}
z2C$D`ptANR_W44B=!bnqtRsPx*pqdiR!D1l1&phe8g^#`lZ}=n_N=6ze;o&&OQ>8=
zN!slSX-&NpkKM;$I)E{OY}Vsip{%JF;$f+eS1^jYi#EB%E)*Q~upXIof4Es%kC2!;
zrLm7W5@0<y>KN9wc5BmQk1Ul_2f`#kW$XhXIkh*D&u8`{o-V9&;8fhNPJGO}0Oo1v
z2}ozdg@WJyGFAwD>J@mbQ3cv$*MG~{Tuih=-_xMK11kos=fe2!do!(&?6gHwJG*Sb
z=u|SuXd3(c7`>@ohbUy#ytgID{k(~New3b?g-Wr2hrSTTO75gm3_Owt94e-vmM!)_
zVJ5LF<sf)x33?s?1ev8}u`8eK;GG3(>OoI)VLFrSE{tC^V0pUzw7}L@&DxF|&<f2?
zC5(0^eKx>fVXCpW+kd%mU&^i|2Z9g;e#t?w+W&uSC~pFtG`BgCNyh-CwWQ)9ZPM2T
zM|-61QH7nRO-Bodo6AG4!(<E^ar-K+&^uZ<1REapxz4%pQ0Qs-aSI($8E!6*ZpvkR
z3WL8=;ZCcPu(CR`(YXh`2Y<!3(@~TmP<hUH+>3OzU0A}Sqbb8p<`HFFE#;VwrvzUr
zzc#8FZd{EzdLC{gI4k~kr&G<q9ylKyM%%XnBIxRTkr30PLf!Qln5k~30fyKtKGu4-
zI8SoOl{@WkhS$l-@EgWg{OnlSq~e_(HA7s8%F%lX?Xh;&8JET1&q#<1q1Pf=CS$C8
z`Z`KA%<u@JwwROR-$X4%OQ54A!_DULMop5&@$q6L+?Ud?XD^U>$nhV%XCPsyy4~r>
z%Mj^2pyvtW@_Z%9gUmX6YasIosGy=J3~l|3ji)1BLm=~z?C>1G=fJ683ZWA}gh1vI
zal|wZPwi1#UrN6o?wiabw%PU=Y)qt(=U7K_2Mx)ujy(R9T}iG5AqYH^+E94^i#^Jp
zzYsK$Z7)a%2T*J91FDT_&^(ltV)F%&Wk2+S76)Cv(Ox3oQ@xi+`XmXhyKTs+L{<oQ
zkO&yyJ%IOr-Upt{)lgx@LBgt}Y9t>jnzU|s34P6p#5D;zZG6;Z(}T?}DvUcwU{CVi
z^3OjNmLpe+LXh8~4+i*B+37@=vt8laVTbW}F33LgSu$tK6<7<vJ?to+PS`V>5>-$1
zVUwyb`4B)nN=AscuIv$DZ?W%_WUrFza(KDbg4@&~c%>>tQ!Tz&`@U++gfy$R9D`r~
ze8=(dgRa9Qvp(N`{5qODjHk8M=`l8aMDry~g(HaIr!~c>vP}C?!NG*|82p}*V0Q<u
zM*3+jcwo**r6>dtPoLD+*Up#P1L6=B0wMy4hf;%-)1-4i-U2HeLF^D7Kf0?e3As*-
z>J+(B6m|fQEcOj80Cfopqyk*w-XW;(_|8YG#l<=vPm%ALo&oPcpJcF6BMT{)gnxG2
zkFqPskr)PHUkXjSCjbA~+L@77fpk@lb3swc00G;)I(C5X@T@H7FHJnvFL`JD@#F!(
zGX#elrarOFpLV$LO3DcU9xdTiYm`o646*r<Q{l%U0C@Or?_VAzgLivp{P|i!{i+qr
zJUi2wCw)Csn0G+nYcWfL*WURao-@l@qe8s{0$hM~yu_uL;5BZ^u2SLNVaM?3w{+9i
z#+NxP=}#YxKW2si<GB|-)6G80TR9L`xP91RJQ}jl!_`cO3Y2%oA5ZQ<0i?IJ3Ri{Z
z!Br}`!GkiE(f9Zv8MrP#1eFSH5Icy6F9mwGmeNb9DeL>7!WzU5;z9FU;E!7ZZPx+d
zSs@L=!@7_)*Vj^Q2E)9p3l-8JeB*63X<yN(s@R+!DvUwwD4s6SOLawg=`-UmD~v&S
zz`HV-u<Ge;jX!hru5bpi!+83H;>gex;5zjODx5*=K%S*0;`){*q-3&O`LECLs$?b}
z5=4RcA^EZ^|HpvivHOF!76txKF5_R*F}D6vb}qRN!ypvhQXD&g_rI}n(m@60Nsmr4
zLze4+A@}nOoqI~)4G*J6xeGs7?GW%Z`)MiX<ib!(Mp1D(1U!up9<<Gdt@+H?bLh;h
z)|u)?1kY>T&5RLP=emk@ck)QY?|5ZLI&Gs~ij2*9PC9vHXZs#cA<G~BEA;oZL&4Le
z$b;0NY{mxr)cw#7|4t)-XJL&ic$ayP!${^ovHz-(79l*?bG?qrUb0s8A+f{1vk2nR
z>r2{)c;Zd*`A_af7jIFINBDT?7b+w|eBX=McW2!Z>Pk&m+;o_&74w)5{mvqeXL23!
z#p8Ie&U;#i#b!y22Z=iIR$<|0bneH~iJX7~10#j&WozxC^Xt&eEMj=fyH#C#B4Hxq
zJlWcbY)P#cm^GGM1FFJNBs(NCizpuSgVc}R<LRkV0o4x4%o2*n4>PVna^cHYjHfyl
zOg55k9UyCgY64>K$RyUGuvx_M;41BJouH*L%h;VvlC*iybf9-)KZ?kmcRgWwfJMr_
z%|4W!ZL)<h2t&7IKj@A7-`L~$>rv{AY=G$~1gc5sVqH)I5>+&2id-H@6w4g@*yl#4
zOtCBFzB%(OIJ*#lhrv{{6uVOJZR5Ej82U{#n$0o;L>0-C+NPnrxIFnB#V?BaE%tkQ
zZ)N$oLOBRp)1A2v$JnopGO~FP46)Xi-eBocriz$Kk;~Jm(oV~{uEUWF-@X)yJjhJ$
zNkuNqxDRzxLBL4l5e9i|JZ+Eq_;BtD0>)KZj!aPIF@{>o0H}(NN|DBMKbHi|Bl@!l
zCmp+@cT%MBw8j;cO$X3|Q-)LoN!t8)uxjh9=95GBIy{jIMs0pP9Tm~^Dav1H`xN;-
z{h}L>gDJPu#ZHzrzC?bl#s3r@mZ=Vu%))-Aof4!1t7GesYvBK3-rapx%kWf@BWY|F
zSxAxWnN)1$)T@AMB=F!DE*AZ<RN~Shtt;>p89d#*Me?{8TIT$XTNOQ$HWm**#eFoj
zp9AYbTdRs9Ns-6XP$PAJCKG#&JpXCa4gFDeEw~kgAn;0lSe?E9#mdk$FNjS$7a$uH
zWOY7&#6HA7C_uC0GGkph1W>H5kWoCI4~`Ag_$Gb4L{=J9M)CN71`3VRdvn~fJp?%v
zWEju#IRQo)!Zs>r4GPf-8O8JPR<e!dCD~W2tEjZT4B_ExQzuf-_jN}FdO=|!!47$W
zL3=_Y%#{?inh~W(*&#3Bvo=%GZT>Uz?_Ztkkq_<^i(R0S)g`vl{W5@Oac&~-iNc!~
z#|J398yxmo?AkoOC^fa~9#OjAA;lBZq|uGfJ|x#qWTp4nc|3aOc=sM_ps-h<uvhS$
zE|Z`I)f*a>mH7{azk-b3v1a}gIVk={6XUu=6#fb_d}l|YzeeJNU7R4HuuSmGbBDm&
zGCbeyqSy|FvVn}>`L@Fit>O{tv?aDu>lwd8JQEGK!`*ZD`s1OHHgF(#f*3fb^?38V
ztff+s8No9{E@SX!vH8$&iLKORM(|L%nBDJPF;QLetyJX?fai;{Gs<BYgkk8F+Cr&&
z|BKD9(xin@Y5CnpgkVkyv7Ijyp<%@162U0iw1{27W#sSB7VMX6Y9FOby^PC>K0(v`
zEE-Ce>r>n__6060`UH(2m_#^sAs+QbZB>0#<O%vE@Hlj%-_#$cg<LXK=JaU9am*LZ
zpoijhw!GpB*hg$d?r{9E4(WS(WmQG<pvc_0httQ!`z<Wg#Y;d%^Pn+J13{zVuhlr<
zO{7|^q8(7A?ri?WVX?@8$C%Hsg7b;H<BaDb9nJOgWRyZzU_Kk~I3z}+JZGO7EESN?
zzB?#iaKXE86xaWRe*I5Rq@8`hWg3uy&UWkzBo@R2iliM>y53`EkUB%9W2}e=6d5~s
z9N`+aJqBmF5xI>0zUql^&Nz2p@Ys^R<z-j0-o)5B+DTJixMr^!2&zaE6d5}P%gME#
zu5Vj7gsGxTP$cZQcoga*vNj|B+CQ=1_xqj(TRDS3SMJo1sqw3dGC`59W3>D0fPCJ`
zTiL}+6=8xRVTS=j2ZYYUb?Wjg`-ieK%7GXJf#{XmwZ-B77h9fxh?^`IFow23@j27k
zcOL72N}$-{vFTAG(n;GH*8$$1%UXBXb$CY_*U6;q81fU<i@SSxR30Yfo!bN2RCksQ
zkiF4l8@zmtb*CgKsVrmpjQYMIuy6`VrzB|RsdGF>+Hc1De%N)VCS+bGnpI|K2yy#5
zLMY+x5dPA3HwzV30}&wNB_tgTUpukG^NZ>p32@Y!(1Gx^0Xv3{08^cb9F%J2?m+n3
zkR6L(rfWf>SXh3_F}petzBb(*!{;@=cJ2wHx1fI(|M^*FX6MG!<QmaCEQyG+awoZZ
zYFn2Ox9N_y)$UReI+(oNat9w3VFIIJqF5I0B)`n+JOlj~*sagOgkBwzU76HjI)Xd~
z+`&mUR~?dFn|IdW<~RaD?k9^4b#MUNKqS9&&#ca%gn=|*I{cinh<Db`tj_aBL+A`(
z=JEfr!-IQfb)peLLD(^@m``QRk88g_*Um(%-$K|z7usGGv((=}_?NOXxPll2p<qi9
zqLKa^TgIEf9%z8aO9Dn1KF9XG97OcsfO`DStFubm|NXuRx`mhu-D;aibf=qShc&mG
z*I}vEq5qDCS8<c<0NZx+I`29&(P*7Lm9*{dP}LSxcNBpVg!(-0tGZ=}s<tPJVEKQs
zoTfE&L-xCoPwXakm`!KMlRYfMzr`oN%&%iS3PvK<;;D*suq9UjzXl;-H?w0DEoBq)
z?!OdIypyeNX2)1xj+)J)bWwCtzuob>sJKoVS<fic$xGXRBlCuK$S2I~>KbI)WVw@L
zM-Xu}rAfvZ>Z`MO+Sc*<3$z;>CWn9GXkBL89hBVyva@9)Rmx&&#D3G6)<M}V?9%d6
za#K8FY)vI^7~36|-NG&{B``frb5|P0LEoX-Ehz9HHtHEm$9fU!Oi8wbvzvs*<XJR%
zc9@A4KM@_|+-`8^1+!$99tD)0MRH2pf5Y-t-~lN#zdsF_4@m*vf!R$0C@>ejPDSu?
zR-bn#!`|Eu10;S<{wO<}T!}##249H=0{H$HdogcOk)+aOH>+q=%1`KLdoWFAr?o4K
z;7#t(n@&#*fzIBNDPIB3;oNtq5$c0+qz^+ZL+uK3j+@=-40Re**lm4A@&=*+IKXFV
z+2C&b?_?q+dEOP|9L|7;A5IygMQ{8>l)fuiI2^vSDFtq1NrZyZ{!8u8<@*MBCRMeB
z(s-5BX58c}$T@C+NA2i&l5p%e+Y^z=t^~fIyZhJYVDi*Hkd{v#cx4%MPCQMSRZRfN
zI;oa$*1JNr!&&iAohr{<$~~#IWIQYDmAB$iYh10@ZZhX<Vf~h_ELYBpXYn#~Dd#0+
zU~$K+fbAI0Vn7+Hcap{=DD8FyYlk!Ap}Ukde|EgJZC6)3Bv-h0+$4_-o{nkA2pi5g
z?NQ;{;Yc2)H;(`Op(j}Hqe8XAaXi8s2+_lN&De9NwLce>;XRhE{}Z}XT9Y{vy*?_`
zJY2FCJ%$NRk?_>1@o1G+{~pcd=KZ1{**xkY(HISzR{wr7?t>+*c~20D{dn)f{wO=Q
zT#G>vicZP5GXIHPR&R0=K@<7x4{0dkqszU2p(CBvcxw%v&-m4f^RtK?zG$Qy8mdR1
zQGi>ttK~Bi>4e>Af9TlcOlh`yN=T#)?nDp7UaE*9gEZ$uJ|cZ^Cwj6DNQyict@GL6
zVqYuJDDogmtLv1kb6V>2CGxfUjICB>v>=iXr%^qKBoQcIjIkD7s^J2m%eOV<CG`Eh
zr%`|_4ND1F&eeR8L}msf$n)=%lxwLSw=v(nBf!5HK^~MjvhD&$`!>cep|3?^ZMEP>
zGm?xWO=n_u41LY^Fc5)$L)70A#<NQfDTz!wMv*6LBl+$a3?PO468fH!Y9v@$YK{-*
z*4h@I@5rPxj146;Bhq0-XU*yfQi)uHkX?~yv;<zq351rR|Mw!1I|VY#1~ajg)y*pa
ztUoiA$ejY&$sT@&t~>!$CtRaXc%*ypXip#C{qBw_!3R^l#J*R`HZD0ZE&B2-zx#o`
zmdK3-+2Ni7+k<mJlXPfRm-`BTl$~1+10f6puf#%u`2H7bX8%a2)La0qRy<-DJ3mG~
zS#;X|`GMn0(xvxpmQ=RElkUN%HC;kA3j2{?cU18!D8M~1zueX@n?02d6-$9mwr7yI
zvlo8^)-zA-3iz*+?OCppo=G=bubVF}L{-p#1-QqBJjsTXn6xv`8*GKo*9rH$y(J!2
zJujE-^5K>BzJp!Mcm*&VKkE{Pt_nr35XQ4<K<PEbXVRVBa@k!0>2=aQ^n`UKJiL%#
z!Oy&#R9Jdh%Ku<v6%CJ8KGG^My{yNh*w7*E%|y8z#l50iEhN2ig)BgQBH}X9rwXdC
zlkp*WxqH>UiHdnHVx)rV>tuY|qMP;8d1}Opa{2Je!Vj&ruw39#qPfw!c(PS#3Ly(w
zS%_DcXj7!%>c7E%)@=dwfv4&OeNR^_E`HJqs@M!<NnLt%ym^7aiIY!=QMt$qsE=*q
z@|x_Q*)FjIs+brQXdhQn*wtNJ`WDdJW$?<57-%0r%IEbgeH!<K<DbFvZ~0PoCbkj8
zAQWwB@J;`Xh36<z@FAH37LAY>1OCTf@TH-hTV%mC(pr`F7W{fz7LzTg)98SY`2_K8
zI3<k`F!Ueb=X(is|H{Qr3vup@0;W|#*$-XhPS9nj<mnuw47(W3hjS5`;XTSnamTO{
zl1j~b&?wRfOGG`&2c!wy_tC9mOY#!=^40VQE^@{V0%%B0GWLADUu5!mgimQ&3-d?i
zhTK(zG{8QQ&m(*a(uvl-Hk4vcy=#Dd^6O0FJPX0?qR3;z<zWgb63MpT^Q1{%fb7$I
zI~2VDwMD+gRSVNx*7Ut6%ljeUITCwu3>ip8+c~kJK~MQEk=VX_g*s<{boLH?v(Gz5
zzGvI>wgfdYpr1h0cmA;k7%m_s9U^3!9b1VOmZOJeCqQvQ(Z>xU4GW8g0!W)X$1Qe`
z#P+-`K*6{yLU1034QYVnV!uucUeHG1#sier@e;UR1ADmv9OgNI9lq^WSWBcxd0-E(
z**!C2rz&HIX=#lVDG%%+8QG@EQh^X`yQv?_&L~HM5Co!E8fl^B{uf)GUyC@&Z~<bv
zr35Xi9@h>?Woi#M0!VA3at7tDuDb&y<8Ww>9{7Xv=^k0S#O?seI6RseM8Qdgn%KR(
z%6Y@G0blye&0K=K7ly(0+1a&&QIZ5e;&Y()h)&j9?{u{TBmY@FW49jBH%0fZ@9n)p
zJ18RAb`n()4cOztq%uKVJ0OxdJ+VV#XS|AelxY3X9SAu*wW6fvdQoP?zs-`nc9LB(
zCmk=6fn3Xi3R^z5b#h%2D}7A#Z4IgaaZzz`>!kW2#$zzEmS94#W*sGR>!i9I3|L4e
zaaPT(I9ktj>!kWY=`nQtTw)W-=fbG>h7LdT=y{xofka2YkfDp;*8LSlGNorkvS1&L
zf|A~9H0$6<ru0M^57&KetDRXA$2vgr94W~`04)X<UtMztM-E3VQNl*Qj#BDRk-z`N
zd_W2VVQW8&GmBeecOWWrd2~dn%3D4S->SCvZXJ-yOr9so%3;s;3!WF*H~(oa;*YX(
z$&nxiVd$0eAq9Q^i;Z22kpi^TzCaeK#2E4l{@0Gwdg~BY`9zGdiyL-Dq7ugg8+_j3
zkPpk-O+nNZk-9k^vpwIc{ABy-=0dt6Qa8y1C(LQ-gJXyhD65ZhMWk+!2jLNi(&(YW
zx)PTwm;DBLm@<*Y3LL^ujAp-;)aFKc;Dp&LmQxx|QzLOjNG!ElMmBcX1nEKc>(xfN
zA|(mqfi+|M(FhJUs!WM1_dPK@*al=CtdJo7B7gE<7XQB6WrWY%Gh*S0@22@>yZG05
zlOY~+WKL`X%nV{Siz`x<CTk&(EgU}x_d<|=YRS(Ptx6ovc>nw1%L~U))(9VpTBXri
zPK<)%f#8f|TfIG@s8vFFASKT1`f%UNNeM-(Zjgs9Z}36i^o-nb{g|PMRbqJ{D4Wa*
zJL8!*HZv5pN-WPLxw0O3SmRA9ODmF+SRN!!W_;v>(60I(9EzeOmWMr|_=w;Kd(tr)
zq4<-V<=LE7z^*);27T&gD{6J4JWMA4C_A@fi9r~KwgiR*+<#-&ho4;xJ9E{5CxM{&
zA*8xUsjod3WjvqCkx$NA?B7I)+8FVlS=Cg!#XFU!(kE_?UXgtiem;>EEZLbnv3K#T
zhAIy|q;o}F!IC$1T_0w^7556i*mAmXxuBNhtVM-mjXRD;+x7Sry8=^h=A$!Xi%&3W
zsf)v^y8={6p@$h3$@hcj7!!*lxB^s3qlY;~9cXJza_{pSbfxx7Dm@Us;ujyQ12^^3
zB5(x-lTJ_M+*poLm$=0%TsBn6+Ok#;(`8yGShSoBzFX*@Swz<Ad6*d1#lG(246VR-
zvez0>4l}P<#mdD>%3T5QB-VqTY2%W1ByRJJtYGX;=fUI`X;TC->*eOKyMnPhou`9V
z+_j36Q@j5!_V1k>$&Un1YKv8|afo2JD;T?Td5|_}%V~Ap`n`PGt~_-*l?XF<qr9y6
z6r@wxOHlwkad}8F;gvKiC?~dj2c?&yz-%V-7*xzitzb&oJVGldo5?&Yjpg5C7@B>r
z${%HCnCw6Z!r&`G#Z~WrvBziMAHkg|7hpQpjS)lgU%Y~{GlWqJ?sy#nAY-J;6%-6g
zp6y6YuJ`!L_<pJVx>16X2hua1ZR(`-*Lo^mfvTY7!4Y`jN5!4Kr<pkusX$dw@-#BL
z{J5OF14!bUCQ?DGpyX-h#~B7pL|NpgfP3-xH4iDV<drh-H}_W*yJ03$!NL`Vb{uCs
zXZe~x$r8gvDv%YFJboGr>F~~xvBk}Qs8(PlD0$2ed*6?XOT=ZD7X<Z8&4qgj-Pqm9
zL$7uzUIDBXye56Y+vfM5+@Lnm3SgbKJ&YHaUslGzE$Q;BD{yt{dWhh_z#I(UGrp;I
z1+Z3df5jbyc?(-jSN<}!f+?r2$H@sIIOf6olfX(Vc(P)82n#w0u9vJjyw`qXntIB5
zoFDV(Hx`bh^QX%FwelH7>HKvfknZOEcw9cn0tl)cPnP;LzhUmT_`dSqo0Y<6?j3o3
zBo#BEn7BhhL{InbB$->g+?8N3xoqlp5&a)!*LH+348vCPBTdr%7sK)g5WCzV2JrRT
z$d4dPPqE8r3AILzGPxqNUOlf8JbFw~b&!unYDZ_XKGMja$i_rIp=g-OqVu+$6}Wvy
zf<=!)c97MezMS$}FyFp9Vh9pF;CQy(F*Uhl3AVmUIfNk5BY05_-55h8KqG6n4wK-}
z<5yh6@2O*gx4ia4gJ}#LPd*P=F*lO-#ujLUjWKxC%0mYUdt-$I9_<fro57@(>mF!e
zTn<a*rYt+e8AKLFkEEJs%m{{CiT>11bPQS;J<u|d3A>DL!aKwntQS6y#m9>gex^x#
z!;CXn*RmXvlK(LK)^w3;u^Frvp&o~iZJZ65GOgQt`f~>CR(e)!t)hcUT_^c3_|MvF
zRe1mkbO!&{y}Ezl5NA@!Db)iVrz;-aux&P4CUGW{6o;*8xM^IVo5YmR3%fI!q|kbx
zxP%3t0c6Kfc{t!qHu>W9B(431sTBS<-eW>7uH`C*$E;Rn%51>nmB*P`U5;u9LuA%B
zx#vaMx#ds@gFtjkLZQ|DZ|s7(A4(aM*}&0|q4Y5=f0gG`CYoOS6_vh;I^$#(Eo;g%
zpMbDAJgw5#UK|*^vApd)G5e4!Pw716xX;!Yx3Rq4Jx6xZ^iZSaDc5YWld&7isC%$8
z8!lLGoNOK(I~Y%}lm~lah3bB{w^-S$c#jE_oo|1S#h4O#lS>fmL&9Wdb@;3!ZB$V$
zZFFUg@dQihxOJQOVrI2+TGhpb$;^kxr(8LS&o)^&A!vPogaMuK5)4DR;O{H~^YG+U
zjC7R&g9L(9neaT^HU-q36=KXl7^UK42t!f)Lpu}*tC`WVeQ0@7pc6;A+nm85EN3Pw
z9LiY-6K98N_HN%3bD)^D9mX&y<@}@U4sIBRVIT;$lt>hh?!U2o^UxaD1_*(iqXhWj
zyTixC^q^<8!w!Qk)#v7UnKEI9DqjaZC#pZld5;-a^LoC0W8ylzop-4NEiSZ8;2S|7
zlZ!^r>-y_zE`*|w+K7#!OC1MAyK$lC{u<BCo=r}}ocEaaggt*u-h-TbnLg*`wNa`=
z=vm!gd3kV*D#Qyq+uVd<&?a6%&}BRaJ(pRl!=9a=Vb6aLyC0=yU<5D-0<o0@+Y0+H
z)&&}_S>O*bz~lKt2YJ3tdDZ6e{+K)$;v8-0DdagrT^M&~H7)9}KQuCfeZJMXkmtu#
zdk@>7Nlyp2RU^Y@;|fz=%{;4knC3L5r6>2Sgt$A0+Ee-rnN~MnJa|lHH1C5;%+p+x
zflecYNFNmsFNFK+#{mlsj^mUO;uj7jgG?J^mkWt56%F&8D$6xgsuDt;`#*&*WoB>#
zFbu-Lm5Qm_u>WHH^m|CRfR(_-aY&_>0By=#Nb@nNE`>N>MuqL!Rfqk#$LO#>n`uId
zr*)(1gETvtC2dR@AvR}oEhkK~QK`iV%^6LW5w_7;tXW-NS$I};=JY(uHp21wRV{m$
z1*x4K&f(^yhV!$TKc|ss17b7LCeEi3X!H0=GtZZ4RwK@1+_{nF$1R7$vvF1a7ra%k
z&hqs7g+9v8AO}DY27+IbLN)&XW5#%%mHEI1NGaVN6ZeF;IUDO<fecR7R+$Wzu>{3n
z@HAO?F&TV+&S8WWyIi%g6xNxFPIORh><Xc}(FtbI3EjLPb3lv-*DxKC@n9Y1j&%q)
zR84mX?1owqyFn!rXo`7HnGb#`%Dxbm^r>XHqDu`foknPL(o6`el}`A6L+J$KZLS#e
z!CFd(0iha#m=8{sOawmoJBmM)oyiS=Fbo7+!p`CJUm3>(!edvO23A3g96JNbFGmB7
zmZN<N!$<Q>4zg1l!buE98bR35dYtbjIl4fz=Q1N9DP&d<k{t7S9qC%N9t?C0S?0iw
z@T>)45JQ;85GHx=Mi3UtF&zitSsTJ$WFItwu%jHKR0uy>5H5m`_Jc7IJ{o7#M=diH
z5`2sxB;qr*APls98ACXNj6B8=PL$L4-wejlu70<kn?}A{i(fEF!M?lQld?0*kr)P{
z;EkfN8GQeX4KFSAIG`B`^*?fZUqaP4Fg_!X+}hl^SG47ILYNGk^9k|79cZ4+f}oCW
z<+V{o_^ToSHMoP}R05cf>Sf(zaP7i#(tZ1ez)F=XbBTO1+}_!?`G+5(OJw1B*IqGb
zJh_Yf304mf-6KE~Y(<ty=yz`44*R4&tw+MxO1&nb3tr7c0&YOdHr!1BOff3<-`o3`
zJUGkwe0ixZWmsPnde|mw&`A%L%F53T1RT16|4ZX<v5Z2WgN^~OTCx^e%^IT3ChM0}
zP`<&q_T=3Nx6EsnQIl1`AqA8p%N}}0J)@1Pqonas_ArBv+;gF5NCBU`lgs&Hn*GDT
z`pB99EV`*u$VQRhBTqcrE}n1DU3)9?C^Vmwa!#9B4>06Hs@1AvlFuL|sn!Va9dLRj
ze~p#FldA}!*V@OQJj|^@hk)vLmA@yEi#T{eJp!l-24b}QI`YYpT+V0O3vNXPz(K-{
zIx7Rn?n&%ob_#*j7sl=F9<|{7|7S!$lwCm*10e|eQAY(?{Qt+AcoH~q>5*YvC0I$4
zWBZ%;^mE5B7QVywqARdkwJ#BChi)_*XI+D|Q*~@+=aEbju@;3zDTVi4dmYQmy*iO+
zQr`h&0SjoXdiloXdAJjM1p=uL^&zG-UZSW{{*tFN?k$m5JLsZ3gvvWcYD@t#o2|^V
zrPFrW(hJAB*_0J#ZRej%3B+0sRpH`x0S%|8sGMmlazx3o)ULk-A4m(dYikF-%_)_w
z-GPOa)U}ec?pDt4nWVRlA?^8{DjI9v+S$(q?uTAsh`QNAwW@lZs|ApeNJ}SGp<>#)
zZEvPUpH`dmzGMGrhl9m1rDRJntd<VYL=LU6(Z!xt6cQBIvNOE38WL&Z6m6i@29Odh
zWv0-cR@Tv$6d*;tL8tY&78MTZOvOtQ$u|Qw;ukd^jaUx7XDjO{IdLU|u;qXQQhQZt
zRcraOX#lO}c<&gyG}vEfj8G&T!$Xd;0k`O)T9DB@lOhro@)3+O!a^|>T!6|~Y#o=V
zkB|NdYm95ma!NaLJ^qxPOOga32t;qxq5QP&f3YEZF;l>7@&blop(K>PtZg=Csjcip
z3sA!kIJ6cWpvkl))v8d%J;$t(QVMUIZYhUaj0!Hqlgv~JS$!gxciGOI(3Of0l7|`G
zi=euv%kExOGOS>Had-2S3X!?|IbAi0Q=hOjYVs(>`44ld^-oAsHNpFL|3`CJ;LG4r
z8Pg`pA12Q>CVoZ+ikM82&%XW)+0Hz))AyZ#57gs=6|;ggHfBvt`h7_t;{)iP?>VZV
zJ&jz;H1YI(Zvgz=T;W{ME7Mht`RA%$r0Is$DEbND1BLYN3KMhQWT{IW5deVP#JeV?
zMlQ8t7F-+C4VWhAu&<-8FsK*O3l#3ota3HembUsfs07~V_ZpcD;rg9o45nEfpiBiu
zGadahT6b;{!Csu`4r=VW2?fe7<bto`GV-hmQ{H;36Jh(k@a!~0Z^JRRS6s~CvAPyB
zpi&O(k=HORV$xPLzRLmlIdhjUw9|X|QO9&Nn(swl$n&T__UE<myBV4982Urm*&Q(q
zgD`la_WW0y4AlKss6<~3JZXVkj@SlaqA!sh$aP>B%g7zgYh);s#xuI#x8YzY=yAFY
zXVY<f0O`@GcZ0f=@BLv4U{m2K!dZEEa=$0c1fd=ad1keu$)#|g^l182_C*xyKH0oT
zsce$*JzYp~?y*upK&+R(x^hHaV;IjH0f15_eStXcHovdT7Eu=ViMx>_1l%&a)Bda6
z=qNuK&wE${3Y1Q_YY<+HY*liBa_>3s@r}20tjQrnHaHdTx*jPUkwt+m2$ex+JKh=P
z&Dfh#*+jd0oG2WRz|l$dT#BYCjf>4_c;CrGKv@15jf%OD*4_#28pnkb-7;{Z7W1jD
zt&ez@xalA`hW8CCBx^0{rEj5#@*U}gutyp}mT+uIf@ZV(#(pyYKyJ?Y$vQ(y1s3<B
zqij$ztYzNk%yqTY4ZkN%Ae|ZH&pBogGKI=<l%a@eK`i1x8uZv@Hm_}VsZ5O~_XH22
z(!=UAC$^UjBVDN711fZ?WxBPE^Ax(E<Xq|I(qf&8ya2gq&8I9%XT|@}{ZV!WM-Idw
ztR-x-UekYLCv6@Hu#Zy;U^0#kLJ;Zyp>tUbTAuhOaRY$e?%uVf*y%CGr^CI0QE97W
zZD&BbAg92x4gAaDL+radEf0yl&+_&Zqb79PWbk)W3cV!WCX3snoF9IuAWmY^>-19j
z)>+zqQYUZ(&wIXDI8SA>aTQ_v#h&2MMH~sXAGMO5B6Fxz`d@UR1=5KMoYtk3^R!(v
zC_V_7ijs&6;=O~GBL6<dX%vOuT>qf>{EHu!5;-r}u)9UAr87r#scY>t?xGm|5tBqZ
z1)^+B#ZVUbS0n<Jo|HgLlLEEYUyFo5e*f8z-*7zkK%7~6HIxcv8tRs6BESqyLyW@#
zB)@hTl8l>|B^y>3<PEwyj??*dWuwk5b2p@@(Vo)&^UPH@5KRf3xf}WporffI-s<Ku
zs3cR*iuT;Lp$af*jAPwdUg5GlZ{47hp(H+%&eL9;tZylFHkY8Eav<gfSTkymtF(%4
zrB%H7`cSse2iUggvmNPMe_!GsWmj?p0SLlcas?0iZ)_9y1$;IQI1VC5$dD)f$(9HO
z>QkJCxvScf!tnBu{vyvt1A3pVO!OR}cwgRT4@<)mYd;mKXbQ2C?|l-6ddNyM#10P2
zZ}&X~aPmaEp%gFjAvZYtu|{}MSo@w?Hz-YE;=sMBUDzf&OEX6q?jMvhgx3+Vx9>KD
z`3YA3fBMREqn8v1X%)9Q$T7)566ppBk%^0ds#mdtJER+@@^l!ANb)}hmt}Wa)|ReZ
zfEzMxNC}+7xI(;9K!)^=k@>QytcmLd2bO(uB*neLx8ahW%ROEw`1YEeJ)lI8!nh$S
zd2FI7xB>Gt-&Vjq&ui=nE^`V7N8zY6n(DDD0|>8-8#c~}BgCH2)AYHQDQ6cn_2cjq
zs?khBwyo%sjxJ~_y2cGdO+OSFYf4%Qq0!3{`$gad)xx2sXmmfh(p#1kY1CfCuVlev
zqhWC&`Cu7vEcA_GlrJR{soh(_;=FFKUwBMz_9r!~0t-s2DeLQ<%6W*WY$g#=8V~aq
z6Tg&QOOgd42)ogg@=>|}#fG?QWEPVPbk*~L0TRi7zdfJugNKa5BE<b2<}>uA>64Ig
zy@o)3ZOP0WO}j^ZT)S65>;tmqQds4vnZHmUg!B*?lV-)5KWLq%Wei5AU{!jP-TBV=
zKx>N4`<*ThW{zXJDg!1XAQ8tyb}?@vIEKwMtw1S&NP)-sIcN~xLTXTHQ}j0jA*gE$
zkO4!vegjg65|8d$PM$X2IN9sXAdHI2z8f!4{w0VBT+;S6eR&&5=GHFq8@&cEp)LtR
zuMkd{HI!E5H=alUYAw%qX*Y*kjF82?OERE9&#;J<3Eiq3Wgfy<72g;f9$+?-cSy|r
z%G4M*|L)NEQ3xa#IM<BjZiA-OhacIEW8#EjVYQxs@h7k<y14*=#eEB|=6#gKT>sy#
z8`s7TG9Je^%|F<qL7hdEw-jP0+n@oWZgvqW6&GIMP%&Yj*Pq(7S<O+cc~RULXy>e!
z470b@s%jO60W_~@h#X1i$nx%N^Ok-}rJtAd+XL>jF@Gt$avX+X81|#Wv31!0|5(XP
zmDPo7fTV?D-DHTU;qwM-OAWtQ|BG-UItfg&n{}i_&I-ACsb?_sI(Us;;NFk)=%}qT
zg?NG!im}Z*e?p0#UNRt>7K*J8ii>AcLzgm?S7HWf0>NjZ1?{D-N$tL$iiscVSit3p
z%e^_3iY+SEhFZ(a_`J^7d7n9H6chz}N<BG>3L`!|v%zH**RDt#ROF9m!kUX{vc7Ou
z+$8Sh{vco=;C;C|K|tAMTSeNST+CQ6L=ADR&+NCdh_VZ6gZ}Cu`=zs|7@cgSS-a#x
zG|D*;N%v-=y%+G(>BuT@i@&@mkP4$`XIYwL>Z&}5cs~i#W)rtgpHfRx*{Hg_ygQ6D
zH=j2=Iiwz|!fcTL$l2Sk(5Ri$`$DBMC^(x*oivmN=w<i%Lwiv^b72K%!@Vtj>s8at
zd#N)OOo{z|Hs!OJx3^OSc{7ge8;qcwyR1Zg>V+fy8>P}Zq0kjFmsN}n+>AgNJ17}P
zXJaVG?n~Jj<VXyIK=4a;3^x4#V@u7RfD_W3N0AbPp{rrb%Myk-B(5KJ4A-8)oq$sE
zvKM2~z>AX@3Cmk99AOUfim0!cnb?X-_q2QRW}jU?g~*-}q$4OrmD!iljdVH7W(;Gi
z{C7<Od0Jc3Ci4r#Qhx?vm9_65b;Z^yflktvl^f|#I*Y1M+2&}?S~-#vGh?$@fdJ>W
zXi1(HmL@|^#H94Xm=fXqqCD2t3!BXK5X%CFdz8i-hq-k0^!VtX^HJO^Lv)%P*G{){
zjWi4^rr{`)-QL;+Df3ke<xw8bj18D8&VFv}k!-rYI*B0}u>lp(e}?!6y|wyq^7R$O
z1{eH(ikSpH!`fv3$u%J}Hj2&TMpOpL{n`#|*Ga<lOuYGm!aDGa(h{zZG@ZoQFefoW
zcDz9f#LDR1(Gw@!jYV(Vs;`{aL5FXYVG?13mLGS6cy$q3=^oU(>8QQtB`e}TcwaoU
z$CEej^hf~pGEZaQ<ET&qbX0469my?uj17D!BS2W^t<uOK=LGywb}h*ggdprjQwojf
z{Vz62uO2vymkU^y9}JMh{|{Z%!t*e#ef=(;y9H{>q@%EG_#1YfjjbItW9T_oDx%&P
zRV;iK%^eoNSj>HQv6Z@2G$R|*UzTImcny#cbT)!1a>D2|8(KagT)(3IA4W%8ns=eQ
z5jWxC+6WYB*Csy7xaCpw&2Iid&hIR5_A-K!>&K`K3wHKw0r%SYwT-ULI?Dk`-f^0u
zFiv-*C#~{sO4G5O5E6$kd-PYBf6;7hf=y2x4PXI)hrDIk%0gFu%^3WJ8b~i`yKsOJ
zyw}{6OFo;8#z8;@NT6ys=DaGKDUDriH0EMcpT!TO?(|v|g*z6NW<#Se#E;jp>Re`K
zk}+6RYa4!HPVU$s(`Gy!Be;T4qf%`6CQ>nhV2y0xss~9_{-_+AbvAp$xd0e3>z)qy
zk<MSKo%*ZRdp&c^p9_vDI3Z@cjudpcA+NIze77{=Cda^d!EP3^BfG6(meL~%D>WP2
zbfY7yFmb4_TEbEqsqy!7lh2p3bIEoXgkk8Gz#ky{-`JD#P6ybTXw+FwN)7mPrIKbs
z`p;?rhhHbKT)MdmUc(tJf|`QG@iEU)7~iaL&3yl|6PF@muVStCD4<kY+#2d*&W=64
z&X~PnC}q`odD#rSFgE%?hC?r_CS?t2v5QdAY2bp8rg+CAYU(5%*M+U2KMIN%RQ>oN
zKa8NBBQ43PoD`nRCOBKbI9Tg+PU#J0p=%s>0D+*_GABNy$;!?tgbm4iLkeOjIDFTE
zh7^H?ufe;zQx-&p*S79IqddB(hiULbeLtm(Pva(*Vk(yfuo;W=dJqNN)Ux-%zVhrS
z@BN(3Nj5^|S<RhoOG{FSH~vRlAT?Wo&(XlhAuUPSl`GDssPNSy%_hY?(jiy?8-#XH
z6zP<4ZtGJ~W#e3YO|q>J`HxmxyVz4Hc+;=a(NLD*>Lmy`JC_hrHFM!L?8G6-M%6)O
z$!ds(q8rQG-G=67*pkB$(q2z(r8AUa_iW0@FKwFn(om=hlcn0=;%jh%&xJfE7kTrZ
zG5jV<f0SKI7Q`S3yV1M~#n1gOHi?@l(#2%kg^yQJj3n{Dk+XW(Y)eB)Fd3sX%-yA+
zvtn_wGmM<05EB2Rnj0wFb>i9h*al<>o-UyESBDgJ!i{u@nLSutdZoFURMZpG#!0$2
zy6quRY}S)VlY&l_5%mQioh6atk8<JZO4B5w7DneIM1UPN>Zvd)B2s0<?vL!_S%LKU
zs&g<Y>a64+jg9klt?;*tNoiz1+Qg_^Z8bW-S;=YX@SfQ=+pKROpJUlP8$BTbjyP<l
zw)+v!2=_L8JA+ml1d$0h`@;f~Y=F{tLFdY9Npu^U5)T~4umZ6wd6hd$BPYHM#-k>b
zav-9OS`MWtOne)_F}o%o2p#n3IlIJC+V#8)Y3<8y%#2RCeVs%J+a=BoPQ3I;cix!2
zn6KYbd3nC?^Wi1xKwbdDJYF6C?RZMw^@IOC0X<Lx7C`NFdS|*~=oS5_h*;j#$I`!~
zR|?sZcD(1aK%d}MCzbGgp2ueq!(UQXXKx!!p?xVkqZ|f85QyHWaZwQOf3Y(5r$Cct
zl74SD)+(bj52(>$7v5Jx<<vVTy%_7!oMQuQzJDb6=cKggcR!&QLK2}B<JZD>R9=`-
z?_6>iX0ZrH)g<r{G-e+I)6nd=i8U0kNR&!2a@MmwW#ap~^M2?9$ZF`@DZW~$i@Gk^
zQckT6DR_Hs?xhyJ%(P3E8&oZJ(OY6*kJoaVD#S9^CLR`2%UnVQw0tGi1y*+o@8jG<
zPY9M1k8fvWXHcV@PEdUU9UuRdGu&6RA5mkG{Wb;y`vnC9Y}nz()M$9|Qm@#z5RO13
zuSG_bn$IUYR|XvXp*~fASb3-xkD8D+xVSxf^IK?P(9St2-I?t+FdaGAwegYVou<$1
zEZK1Lfc}453oH<Xx&mOVUg|SXJwK2{FeacoRlRax!g!huHw!V)Sf^ormaaZ!F#c9e
zhMUi!?DhM)JS~VJl=>`&n;8XZtfQBDQA2IiKAV9yvTu_bu<773X%|wHn$(`jFt;Z>
zhS=t|o}d2r)^EzL;6`8=gsnuH0?q!5osD!l5$@v!qAE=S7~8a^TVjgp>LFXwN-%e0
zDatM%y9~^cekDQ*((2Kj`=rj_S)E!!>N987Qo}m9oQf#cyOj<7<Zz_P<3Bd>*i^Wj
ze)h#M#B;J30m>0?RJ6+B=%b<#u=eM4^?9nXeRC-!82R|+{}iQeNc>K^cHhEjsq@$U
zY=Yjk!OQvm*;@R5vtpd-ooVCLzT?$E>4_^dG$bLRrJZTB+1QB}`BF`c7{NuE_vMXg
zL&v8AkjcZ^(_zpRR5SX}sExvcmi!im2Yb$!QQ~-5FAqyENY@e^k4dXmy0_7(HVi1X
zi{kYlOPj1nWv`=CZRor}jS*4P0o1sXF~!BRS*XBEM;F6nc1gS3y%t|eKFJOz1UFrS
zj<j^I4GB3S5u;Rf+34h)Puh&U{ALyn(kKT)X^?k4v`mTNVZA)WRiTf=p<I99R+-Xg
z_X068NmhI8<sJRUPET06jgYF@ZPdaV@64GgjlxWe&a}aKUP%O*UPV4KvHe5Yxm_^~
zgD`ZZ8avqDf3b4&2joW!<WTB|z(SG|GKzcK57CT3Olx4E(#m}0!u8@Jbz>3m;urN1
ziaFi7L5h22Kbbg5F|r7>zU!Z;fL<>iQjT!Tj>;t<HA8>()Kg~ZJrQjThbJCZe~5Q~
z9D34GoryLyO*gg+5p^6-t+-VlguUq51kl3-Vc_j&qnV?bl<b?MzO=2tkWoN)Hm3rc
zJgeDYcnEW4VZX6I<c^eA7f);(v-`RU#!?xlUNDSPD<3YK(cn`%;y&i50kWYqY}{tX
z)fjXE%V?`~@lz=s#VUgzz1BRAl7n?jrhNJ-x+>@33uFw1_TjuM?MBN@8`>0<<pu}I
zYOeQ`!p^j}1JiOljI7yJGq0kn>cu$<lbvJ!&IC2%#%WT}xB7p@5_#WjpO?wrH;wY1
z=rdJ}M#7^Ix`X62l%vc-dM4T+sCsCB><cNYD+WtJTkgzG1}zt~x7{tI9;Kh)*+L45
z`$fEz(x-J$r7QhU*_qu&48uUQmsBA0vfY1U;c$TjB==_;5CpAOJp4E_9HcVhLNi!O
zgm=^T47eSGvOyh#9y`RUPiESaykuI{p}k@>1H>14`#(?fM|3jJQwMBrXisL~fm0up
zF4mh$MH!u@8EAh)v`Ws|Or2AiNJDH61miKjuV6)WZJN0s-9W04F9Ydd;?tm2sn0KA
z!!SdkJZ71thI_2ngIT!Y;LoF|`md^UWmybUuU;c;4mJ#pnX-v{WlJYh=iEPJ$df_D
z0A9swU+xC8vJY#_1LLSnf@>IU;owZOI;`8AW`<jHdB7;{vzKOKmko6{460<+c`Gzl
zbtin(4Vj|gXy4qq^%vaHVx^Q?d)b^`m0=6O+4IGlggNiQ*<||kmSB!RZDmJ-EN_@c
zwOdIQ{eh{%tfVb=(LvemMq_OpNqfff>m%N^!Y(sj7+u!}54Jm$ek8VyWiW$j(F~;w
zHl&#%K(j+*e?OuQy8R`+D7p)gS8b{Wi&LlEdpLq$?Gdk;sg<}xY2)XYvNOuE5C&oB
zmb6mn+yBOf>zBaKWCK0gDh&`4VeKgL-N@+Qfdql=A>S=E_`Ps#oU}UeN5V43kA{(~
zg!T&6W@og9kH$@o=+EdpC|_Np+F-gyf6-8(ox}V~8oKvFwYe~uOw6|uVEVNtGwr7g
zwt6AkaB=~7dV)-*SK^L@LA)f5nTuv#jd5c})=|?6WirkE`y;NmJ9FnXmiVSS#x3dk
zDomRTuU-V8Hg>YJ3};Gb${W)rvr!yscLpVkm?rT@dhAwCg{@{lk&O4V*_y8+E#5|m
z$zK*Gg<)N@>0|rxua(QsxRBezs5{&zt4WGXg>AzO%tjdtuxEn>PNz*-x~7W+Cj=Q@
zzqd1eq?Ajb=-Xgo{Os2x(;gpXGKFsM(Z+{=0G@?R`T?}}lK3U9Z7m%DI>DFnGZ~i|
zWR)*3>ZBA-UGS#Jk;ZJYl9yM38-|T|>|j%dTG)|Ju>FVBKG+GwM*JDWkhjuc^h&ug
z20h@GAVPe_JVa@uKM?hgvU542AOwM6O0FN&{1bb$H=y2O60odYQIw$vb2MI@E(hb9
z83ni%q=qHH4Pq%8U<mzf)dEqO^NIZ!xYfYBcm(hK9;5_#Fp$C)$Y<)?D9o^RD)CJj
zIRg55Ux#r&aXy)qFCuNF!9fcAu>V3oS&XhO+>P=DMj1K?-)Q0jZwWZ3LU#QwCVi0@
zh}hQHBS`p+zv=)Z4V^0efS&Q-@c;SELSxulS|Z7D7!A%a$ULj?smGMI(}=f$+IJ6~
z<#$?M)+U|e5pF|*fUUzTS$*YExhoy<7Bn{<XdfgYqdBUKJfw<7)Z73@#Nl)-|JYWf
zty8KE1h&n<LKS)80w$La+pT@*SkEAv!H4>IPGgnpcoeCZ1-#97;q}?WdI3%TihGC>
zFF|qR*<JIjsZkmL`BN<Dv{~<@BEI<e^i9KaHZGGcw^4F~6DfXcXFV5=oH0o^mm9;d
z`K6_^UpHX?IXPWQC1bY)<?rpuOMF4noLAl_l#x?o)B$hS$E$IaXgUA1UO&pt<cMJy
zgrY6U)&lOovG6>(0KWVNG>L@}h`)R<ohKRmVyc&@s8Qc)q~4`0okgb1+zi8OnEY+5
zt(3i%5I3(EAA|qMK(TraX&=%aroz-nfpK0iF6Xtd<qsvBT1MSK;hAgQ7)V7i(hF)S
zK=PfqAQ~Yh>g#-fl$BE566R*Sr2UN-A9`<%zke?&K(cAghP4C4B>qmbT35ybc4ZaR
zhne;(uI*qoYTc_qkSzH}%?<w`a??1>7HhAsg-4dQLH+|Od9+0^Rhqe-OW$K=jXFwo
zP^c5h_=f49N_Z3lsl|W`zhOK*_voN3<(L=D&Gg7tu_&)te<#2^!BtMoRrD8eRg4gH
zh+VyLKGH@eZT^kL^>&zqaliDlsAQ)Cxj_QYFy6sm_i3t4l39plg&XYc=HE@QRSA#M
zz*s@tjC0M1jtx<&BUh9n(h}YVcL;YTijk^UyKbLbTDiEJ#wI!v9T9xi5o&%(-=i=U
z&&`v~LALtp*cAosWm(*2MsIYu6j98Loc*KhTyhwOK_Ggi*f=4%|HaDlq7@LSnjXLl
z0u<x<)LVwqK?>jo*X20|t4Lm+Tjoh4NCw>SSOgPcV4iZm#9BJq^Bfs{Df;w8K)#bR
z#xbOj+*$wsn&w+-+n@fZJ*3ZA)WKtt!dVB8=gL)ylo3|dZrSA&34<tnj2+ISsR+4L
z=9XU+k<S1nzc%c5_B)Jp_RI<$4)E7uvAo>74&`qktJ*}Ek2^ZW0Qt}v+IUJSXBWbv
zK`du$bN|fGzDqqNt1WL&r?EPX{Nvu(_CZp5Bp@nuKY(=xtgf3298)?vJt-m@6k~#I
z3z3cqSIV$JZKBsjBCm}j{>f#2?=MOjT9KF9-k87`H<qe3YK5-uD^I9qGeUv0XZ#we
z{8m=Jp5$yI6btpt?dx><n-r=N>{UG#Bjrv55Qr*8{g6r_R=f>+733YB=Oy=^sgz5`
z+idSZzu2DwJZ}@(t*~soAZ{>NyI8wD1H$E~0#id03HOx+rf`x5wE~T-kxRy3LG}-2
zXLckp3<A-VJQh00Ke6R$Yd(Pa=>$|R+ej_wBQKp>H)zM!#gW5TtMo@&x#pab{1s>q
z9AZD(;X~T6Ei0xBg8@S*giC$z!726LoNWS(T{+eV+m0V*no3n>!VS)h@!S-SU7=|6
zyj0L?iIRF4P2qoWV+Z=zlz?Bcw^=wbkk5L#LY2RwtXqSJ38@OuM+=z9nL3eImM)o!
zhI^1*4++@Zt=^U2Z)S&Lq*K==oGIXF)0kJ85bPW%WpVZz-m^5GM+*ddCH3r{wV}F>
z<9s&bw0(QRom4hy*6(rYcrTnpZeGVRODf2eDisH0Aouk!A7Gx;BNCMNkyEASKMk7s
z#@J2sAgx;*7zxx~cm@P08GR2qN+*9O)=k_9&egca?lJu1omU~f>a1ZzwP(0!`rIvT
zQ#l_K?S?OC6N1!n9N%lFR$;U6%(}rkXQTaa-^@0uhEeMA71GU1Ca?!cBlfx3K}pY?
zd>0Rt+!<G0E@8XlYYDn%hZ_uS30|OSVc)LPA7y8NTQLa3&?~hN2;Bc-%VX023Yj$d
z0#(%lF^*%W7PRs`JQYSvbL^S)S~*b*ovOHNxM#4sCmNHukOoS#I*z4$kfgbZI!IGH
z$_rFRRdh-K`?9#{G-0~!ez?>E_@uMcZ>Wkb>@=o%-d(KIo8;T?NpxdT5gFBsD-H7w
zH@1<mWU{$ocBiugG2eO%w3&*FiC;c9zsXN=i-9MzipZw4K+-Vr9B~;y&PmlOQAZN#
z<O!lOzGFrT4-0TrPC;TqlFv<Cl49{e^TCb3MQhkx3BmQt=?0+?d{&_MR$f}M$nurr
z-QXj~Ku<h(DT(;VD38v2(GSmwu<of*C9cQ;J-ggAS~2?+#KuTMks3DXFJ8mM3+p$O
z^4t6TE09Qfc)m0`S|pkhvCl^xU^J!S?^%08h`~Y_!-#ctVOi2vzoa+DhU~ay5m{c5
zlSbua@eQBB<2UYeZrAjnrsz#P>u+olH*h4n<9i-`V2E;F=VYl)AY1nyXKFj1x%UeE
zcLe{3vNO7}7zBZ6OA17>|HhVKzkv5M4R8_@6=9rPVpsjm&R$()eV|~BeTH&zz18z3
zRwj!TH9jxOsy;SIxzzgCG&qV@G>VHjP1`^+$7@l8QhiYq6^w1h(kpf}=&9CBQQ<@i
z94Fj_#Qaye23DIIlUuL;#>|Q2T`hLA2`~SsYRfBo<d;ieB<_)1${?a}!%_UFo@Lh`
z<@ePyY&p!uCa)qKLDUCqmFe+;<54DX$y9;bN^86WyvUf1&UBKz0j2<mfoB$ofDWo&
z=Y%omByWT%6cvCkRb14tp^1J><PKik28>+%>epn5A+{{)JJx$s@RmTr5b2Wi9*2HH
zjdqpc2;i;Y&Oq%m@23g%k5m~B;+_jEgM;Ae!={0X-9+M8_E0rb^wP&;b91Il#sh)z
z&8p=3al3yrr!cQd9EsmLCwU^Je<eDLiCs&ol1l&Bde^lno8Q9Z@ZRii9!@py9Dpd(
z9=cmKP|vN^xeeA_FmOPtv=<PS(QtU>Oks_J$0oSuF(~hkvTMtc7zSZi3IQ_Y{uf)^
zm1YHWKYW2IN+?fbcN<|i!=qwxc2=YyS4&ITt|JsMd>bK68eGtd%OX#PcB?L?+Y*)g
z2B?z*ZA6Q-ZJ+i*nMaxZV|Pffd>($a&;E^Zsg?L<*@ob_#ILUO;874^+BmTrW%zT`
z%K#Vu(<S{jY8l_Oo8lV?m-DUic<YT?g0Z_@YsW{<Ci6Y>sqCvkow>%vtYPv6LH&qf
zlFm%hsH?Un!3)kTP+~~dG&3|VDl|4M4qAK`Cw<>aI|&_Q8Aj74Di{ae37EbE7-@Rv
zyGMe}c)kk9!N?mDS&t@?>kIi3b?~TEn-LJGKM3vjjo69#EgJ>Sx$^i_kbfcedLP#_
zchVp^;8x309lgXe32+!2tn@b<ia9Vr%qXr;%?swsH8}dmfnR{!yLsO#qyEXteY4@F
z!L^);R7}*Jx>Mh-dsI-|f;0?Pd)5TO%4SNi=qgi+3H`?)O#~R!Omrw8s7)4C0Ipid
zw(oh{FZ*Yx^h4Q|Bry!aurGzhVE+HHTJE7EoF3E%Fd0gWt!VkP_+`Gap}{#B6`ojH
zp|Wjh*YEtd13#??2*0&T9PAR+#mNe1rHv!pJkPdMJR1}<0q3x(_!lRJJbd$R6?u6S
zR+tk#CoZxcCCU-L+G}5F3LVzT3<r9dWQCm=flu*>8`=;_?3|h0U?deE`{_1*qHAfR
zNy#yhm=M451xN0U?$RAhaZ{kcMkPV~HukyHRYgeZWQEfkJnaDFOvJOlq?}8qg8^0$
z&7w~2I3cU1x|jm6`o+uX@KZ!~M~Wg^old1*o2_t~ub6k?ta}hfRgfa(vF+h>hKb6Q
zu8Q`e_*aZQob#qeoaiW~<3V=cShY!03}u`-ImlOznK$|z(0J_y3Q!OX=HyJsF%c!R
z5N1_YR(S7DHaKx~E&1c!Ec&UJhn6;*NUP|uVK$FMYw!F1P@}B7u1P(w0myO^Z!Q5W
z(ngb#1BC;+Ok`T^YBDKx!sLU~PfRs&pX1Zx7zMf*(r9Y@CdLamx1p@I4`t_eB{2-b
z(3avy4DP?N<<5Qq`B4Rvlfgk)LV8EL%aQIak{l=geN-F|xj!v3#ud4{pL`5woXdwL
zU{t&<j6k~BI#sT^CsEGi13Deyv?y`~eIz-~faSf0{D0bNF)7khH{aB#4U#a<Z;iYX
zC`S=o_{m5$I_}RKZlHJn^468G%_-C){M|l*oi3?aeSK0w!9|sGqfpQnVdOZwN!(Sm
z0Df9;glq#zZtFIJQgN4Ejwn15SO{Uc?He*pn!~IJRt;|YVwFFAb(yVFgH{|H2g$P+
zSNoT2jK;=Fu-$4*aZGrd4Hp~`8|YIwQ@0u&P78o=p98m@3a^zJ&+-5XLS6B?**KWp
z({pLXZAG*CteB?bLl{3YnmT7~<xrLos_2V&COL^cZ{LBESWUOoApfI}@v_`4p>hxD
znLW1}Gb2xvZH6|FD(5`g;Sk9Sh>QU&@Y%<_p~$N|JL2FybRDpYnYMKvR>EajnzLZR
zm^j{e*B{FCc|N})f0SJb4#O}A`%<ok<o_QV?xd~+ER7FXTbe*1wqe+2BqN%)g0Wl$
z!*jg>Kq}cR>(_X*E(D?pNLL;4C$&Q?J*R?pfzUc@<X>4coYi%(b8Z<27Wx*wyUuX$
zsdtovor6b-dckx@Q?YnTY-)GgQB-&|5KX}tt+rQjt(KiCOf5YJVxk2J*Cl;=O=9W-
zZ@D>Iec>Y_>Xo9`*6pgt%w>2VCaMF1cdftX(4gI%Z<pq=O!Tt^9h{i*?Ntg2N%8KD
znPa()9YBE*)Wj^_KI(6@$&+j{fyx-<fH*TD=cp}el(&_7zdGnSS~yPd0frU|#SdE6
zdu`@izCChIN8m_TAQWhFps1z7frJ6I=xV`n7X3kyh>qiIit|6peo<)L@<bXR4pb>n
zl>InPqsttUN;ptwKs|#p=-=uygTwc8zfwSSKg+xD{7`acM-asz3~MPs&i)&F4XoHv
z1D=d63}5-LgE+^}FX~wcd7ei-=rs;qAry%8eMTl4gG^$9M6Yp-4g#G@W;TUrCO(>q
zp2{FZT0IAWR_-9pxs^^wv%xUApoft`nxC1i<aQn=@~oy-P5UI${FKX!m%Ayk<ZHuh
zo#b0Xg?<~CRqRM}nq%x0!n{>n6})qdOtL@6P*{xfR&!B^vs&)8K1$5M27(v{VJr1j
z$ldL~*iYa{ULdN73$$#_N}%Drn=#xqq9X7j(2wdGm)&{HoUl3fn%0}&LZV5*Fw$oX
ziD9Hub)qmss?ev)ATtM{o}+e#RI7l`y9jMeC<t}O=u?LJF)!w?8`MUkBGiddsK~VH
ztK|m$)Yw^(=xgk?Tsn?P`La!q`U~jNJJi#u?9(bYW+~AI#94^`%*uv)^lR?w5Yd0i
z&fo@M5Qc%fbb<!8IPAYz)d4QjEr7rriJd-r{eO-&3k`D)w<Bg+-Pj%urj*WbF!MS#
zCqvaXHZuJfor6fL8lB>yf_bUo5?w~+48ic28WaXv1?TXTqm<BWrIiZ`^Q@A580RuL
zhoj*(rL~#o+w}OZ!A=>Xdkvw*DAb6wnkY2`{gzs2nA<6&n~k&*ng@4kH=GR>KWF$L
zVhYD$&#}zIIK{S}8{tREx!nK=!!U5AG<|0O#Xv~>VT)V9g2W1uujNC>_&G_xO6SmQ
z-z<|vZzN<KjfPOUt%H1hG%Q?5MlaHVdaq5L0ApnsTnJ`RhM|Q6B$F8i7k>WCO$(X4
z<1`{9UA@tZ>9k{_$B~u>l<$_&L;7^0BOQHEb&R1&*P9vAq{<o=RuUP5S4er9*`i6;
zH7k7XJp9+0X08?y(r)gkK;|$9(vf!V$j=5BjztXp;=+qkGq?d5gkj)HBm~s`C+oXX
zebOxuMT!k3$Ir!M`e}gQ%NQdA!%_+YV0e}}fEpGZsv-E$q56TyVXWG)=THKo-JPie
z0Ngk}Bg5Jzab#pz>RtwBIK~)&49Dm&6T@nwpM7BKZ|cB*JL3ythN>UHD<=5@GCW3y
zfDFgzFcU+SR)H5@BSXN2*Ni>W!n$Vc1BqjqI$6$-ssn6AjXlfx^U{4OJC`I0LJ$gG
zNmM@G|6;?d9iTJAvNuLmwF(jXGXEUsJ)K(}>-(^<^K~LH-+u$H%L@R%KtR9Td@HIN
z+MRmF;cB%po1L?ePe52c-)7g&mcY?@xS^g~6QIfLBB5538-lrDQEg){c5pArDjKcb
zYFiR7-^=tkpTpk3@Xhz{wKa5Pt-%=sL<rb~1z671njR4)gPimHGNaxi6>JK%`ejZe
z88AqEbOo_CPY!8Kju_1afRsL4$N&(ru;Dv<q-3^}?oYWf;DM+quhaR|znpN&>}*u;
z6HcPeMjnE<pww;TTYRD69KJ%sFQwR?Lnlg%DRgy!x#}^>eh1>#>xTq9Xw%;DL2e^J
zbl5+3wD)66CP=~*vwantEU9Rv+yDO_JaW_qZp5<K@>eMCrdz-A9ylX^L0eT3vq?)T
zmbbHrC6d(OSMv1$JNB?s1FW|K_k3<02|NhfJJew{)h3<qkwUj#NO{AVi<-AC2Ci0D
zr}KxhD@w8$1YuXAXp7wcVw-gK2dTT03ph@d1l}`Ab;F~DKP6m~PAgq7m&(33i&235
zb1`BBm&Cmh>Qum|I^qLxCRlpV3opNPeoC!Z%`NTl@TJ%5i#ocwd?;`nHC>bmkNH}_
zn>97>7loYn9JRkdbpuA2MLw+~pGl`!G`9e~J1*K-(Q?0ijaypzk2y)<&#JIBX2tWs
zP#JTKULIe+xg7Uc6}Co80ieXhMV>EEw<o;HzI{tE05BT~W&Dby{$2XK?HbR-(2N^3
z!Z=rN@l480dj4zKrCxiLVEd6islrTV*7ov!q!W|g)t{G%s<Whv#d=w8-FtkS@^Bj~
zSCi0{mj{M5CWU4*#dN8YT$SC>q6YKpZzfk-&yZCvYgTeIF6!W)c+6S`l`;!t4G5(J
z24@!!_hy>v(r}cU&C4^Gf?%Myg$Apq*emyUbF&A-1dwv!9BG5zBS;jM*wwO+vp#4E
zIb)x@T$;Obld#h$aQskqMY$4$AnZz_f_ndpy>>s|W?<Z;7cfKwib{);IYxY?JHAR{
z%F0QSaP#4fq&K82FE%Ui`2Ifr+8ta2`t0PfxjF5<H^-AJ@#Rtw+Bs>SoQlxnBijr}
z?72ViAs{qs&&Z?LC@D1&c7U#Rc3QC8TA5T|;f}J25_Ed$50nQ%OYHUNlt^L3@QCIw
z1Le||j7(0snEY_wKB_l`5U(kFa-XZ|iixg#<+@w*jH})cnjpAllgy{|E8dl*6T_#U
zy_dm7lsQI{%s3$=?<ay!YOMqrK6$^ndv(8L`7_*r{)0cRkjM^lds#b#G+~z2KG8E1
zHQ`*1US+F<?@---%n2)y+!70Y5AqnHL8fe|7q-y8U9mBRR+|>23z<%(R;0ANy7HuI
zHZ$`Y{B@}0jRNYHd8A(#zi&&fZcH<%`Z&;$Ii9BS2gxi8?gITY=PX_wMAbr2@{J``
zL7S5tQj@n!<5X@>#q6Yk?GvZiS@6(j{6oz@%FYHiq7VeaCu*aB4?R%te}yupNmp1m
znF|ot^~sMg-~TyTjP2y|piD9xxBE1$s?4&Oh2L8f-p&qR_g1oh^Q{&I4dZF`EI-tt
zkQ815spaEASx`ViEc*7$!asE749bvEL+W=s=`jFvDWYKAAc1LB(}uZoB$X+V3adlt
z#~}xux}+GxA37bFe7Z|=XQ1PnVAe?l7fd0MGqx8qZ+|tTEq{>1`i4|Raw1iLn0dSF
z+Os<c&Cz|i^p!Dy!c<LrQjKq0hzGAs*3fEMxy+1hJ#$On3XZM|>TX3rirJ6k$0D7G
z9}-Sj^bgLFwuG^Lya$BoHhm#no2Wn*UqkK3%ZK(rNq>lec5eVW^q;Rv0c64(^+YLI
zOE*U(QttYRFzID~)r;3}5IF$zQB3ICnswomx!d%tnneC?0}YlD4#!_wI9tppvUEGa
zV-dlFxdSeu`5XR3V@#hUhj3>NG;>24qE>zV7E1k6c5c}bgdh;zk|-d(|BVgh*8puY
zY`|k2w0TtOzAhauB@#>z60|+1z=b^<DRjb{V}kjhK;G(wn`cs)9``!ixo<krRbaul
z?VxgD@u+10*jij#s*L+O-?p1e{C;?<Ao!}&to62a4mR-qRDe`4m?irul%K34u%f^I
z@4Qo6MK^eV%^<w@u+@R9kpFt_C@e@K0T=zrQxN*QTp`-4)2F8>Ie|g+1}Xc&c)dza
zI$~auRLL38ZGJ`6%dJKA4tGARL31*MAvZaVTmoq=H$S;`*a`6ml98uFn_=Q#ds44J
zg8RP1XaF+Pqn05L=z_%Tbec(`<Lw4@UNJ7@<z=(}zw&*{ar_2q<u>qXZLJqTXlKu1
z`o@nRrFua>6xNAl<yKS&x}SkEf|40IL8)kGM~6Yd5S|AlNgGy-C!x!iyff(|jj&Cd
zs{VS;176~6+df-woCcuS0J9BalL^$p56Z7=Xhczp9EOg8kF_@avf=x}QTp{vRuI?7
zKP4!ea%kMo;zQY$<VXyJupf<5)B^ec$HrD)nxc{!tEC(f>agSBgXrvmWKE!0So6WT
zZ>7{)$py)#L8c-0j~-=Bt&~|AjDp}Fq;N9wbAK)~{wexd=g4mmH7%@SA$eInyWcM*
zAtp2m{+vlLJf{?198js2eQyP!GknFbF(JGF870wMBN&e8ej|iVQgz#o-s=hgyZOr(
zdP<<rz!M{b%SBKm9*3G+N>2WE&_z)(&r?uUbGJuAbBD4O$ErjIfB8<NDU*o}RkAMb
zvic&@$^L;TewLd&%1H*nJCKco{KBJU%I>sz@+eqmL*wjg_5-a#m-bna2!{ro)bLzE
zKHO4Yb|ngY-y!&EjT|*M18$!?HMJ=ah87vmjC?j&v<~FTC>f%;5^f_8R_?(@D_Hix
z<I4u(h=+VuJ0&(kqlgaX8p6s+@hPo46X*oRJM1pF>snVtwT`94g;+WN;OE?{BTd&y
zd+*BZF*2l?=jJ*1aI%K(l-DM`#E%>PQg%hj6@(z{N{Fj2_rF*ZKRN~aI?V+f$8~`~
zOuoIS@N=V%UnfuibPp2cDb~p1?epeK6qmFd3U9|DUA?T`?&}JlZjy4?C#(LfQXe`C
zw^KLU-?`)9Ncx_Yg!G4?!cl7WB++i0*5^jICYn}u(up+p{Hd^jSdZI9U3rTOt?RFG
zl)Dh=uVW2}Fz*0JF{+P~Z|No^hiC+zL4&}#&$WT8TUKCsoSdK*H5$h~X=`1YrCr}j
zLzzgkXCm$4L{{aMDGQf@oUNCpVJLZsVurQ;moooxvo;nU<_`hQqJLc*jGMA}DJsd+
zn&EV$xs=;Fx)222+$|d>@WoBgf&{UjW06|F$5u8z%i45dKIHk5#@QUAwzPH`G2lb8
zONxz8K(fYi_|*~q^P#NFK?II@P-ODS#M9VXLs>ZG!Hb~n;?Z|`i_VIMkh^7w7i@6S
z6vR=4HCx7|yhQcSQWFYU*sTl_=(|lCBcc(d``aS`rC;Nfn6i*jH_<7vZg*(=f2H_E
z*|{W141+NAN-_8oA8GD?fswqKiWo1n>E5|WQZ_O?fNRTGFOGMFvK<RbC9B;|x0Glh
zF9o8UF+Ik<Px*|t@M@0XR-^m-GF{V~r2gq%gHvbq1uUoDHQG0y_cD;uIYSfwk$Phe
z2cZuEQyvB-I)1R3HRv&$Wwh5j?rxw=(1WVxet_c6w-@~4bu3iovg3$krm#b~)Uol?
z>53BZDBcUF6gYhG(RNV){V_60Ay5iV$jy4tc^uMEQq(b8GU?+~mvF=<6xYg9tS~Hp
z6#2cD?Z#YY;#glx0dPmuMttsj#GY0jC<HQ~f`ZEt7DBC%K|M3Va209)3^i)j`?y9~
zy7ke7!pu_v^1^9Oc;%8_asokdZ_x2?>)87`TR5_qYah~qq;NgKjoU#8wvyx>+T3%U
zd~kVu=e{38t*{Lt#5Tu?Gl^Fr{czS+1{0RkTXH&0EdUsf$IP_)ZQf1%ZmfrJcVDE^
z$NuYG^z%#EwH-+egRqt`#wPB+v6Hg1A1f}mM*|sxL&QTe@4)ILOjEVt5pgT;HgcU8
z_xs!HKb!rDX~Es4I51R5gK87~B3g;gOp%uEytjZll^dfnB3nKY*(yqV<fzPhgZcV@
zp8agMvMt%jw#ZEmxN=)hW2EL$X9YmG!Nq{{y2ke>KiV9ns$&U_vM5PTt2*9}_}oLW
z&gPXjD=%}MBGc?#!|E;+6(fyup$yGEkzUoK?8v4)LfA&bE@Yc1vq%V9WskG9+#-PI
z8!yAnympN;ZnT!!vY;}~;3{>vgYDVklFm@cBLxHEY@iFG{pI)XI<053|G0InW8ou5
zv(py!CD$<k<;ccHVuGM6YTDVsy7d`teiAr>lert}zsPMm<&m;fP_!f&eZG(nyB4(_
zzpg2aATzSwH``WGNaWF(Ub&D|5V_1M@I}lsz4YW)=XWeuqrhMe7!eV4c~)p`Ia}e+
zSj%xWv$3oxFw%0j1RCs({X^N6BuNayurCqt0{{QmNSRa1o$9zMXNrIq*;w{rns@D?
zFs_A$U7R0;npLn+<-w=7{bJY8YYY557i*8100K6sWn;6GK!`&3VY81rS#`Fit2!Vq
z1bf1qaZY*+gk%*TcDj1Z_*BQm0fhK)i41G1s&|woR3QPpV1yBkAY#vY)*U<=!fQ3=
z?KW_}+p3e&uUM^(7etCH02)15+-u?3%+_T}nuYW`*gp6^2+J4inyu?hiBkA72UU-W
z@UI4domPEQTB!`jIj4~oz%uoMWIE5*GlYeQOWcr@v)R?cUU1MJSC;w}0O>1ixWl8F
z4v=3Rc=SBNqSM!W&J=DdDc}E;=W9g%-r)0}FC}PiCJW(j*R=hD!uGtfiInByh;A~%
zfaR)UcZ|Ojv)l#8>^<Va`KOgy-HF&Tie7VI{7CjO+SMX;jDLO-7Vc_fBiwP)VC$K5
zBt)M1d>jCq#T4R+!iBIFXiDkw5D*Y}E5B*MW!pc4lRwI?D9ND^gxzRIL=o?Qu}$9W
zM}@jA7hvogD*=-58v4FkV^==xeY3{f1=#mEQDTQOZ%kZQ!yR)^Q{GYW)9s$iJek`Z
zn8Lir4o*d&-aQm~dro8L+nK0ZGPxV2G1Ez7Y4m`aw20VCJPW<Fgtbl{3;%9n$Qn*0
zXPS;($rr&<rER*=;k*w6G^+fxRQBE%dQ>*R_a6OI2&<-`Y#ZxubpOG&^7`XX`;>>%
z<aiSRBbp|glee;~duRy*Hl>>xIXv`|ON8ADV%z8Jj^0=#TMr~9v(!S=(&+A=-5?bw
zupZn}CIKs;A3iRdDM@u!I$|JcE^^I<gF9Y}RMd>pg*dIixOhVl9Dy@OzSLvbE4WFL
z9R#dxG<3_ME04qWQ|7=-Nv|m<-64rSDo^n~Xq$K%0QDMBgt&bX_I6-xCufri1mFhL
zrru{(A{1_&zHTM?>58<wr^phMnA$5kTRq4sj~$q?kBn=vW-{a`EW7G@P*qf(35F{t
zIKPx#TdqVQ2;0%gU==<4-`H*a5}8RZ8z4q`TMBZf(@U3p#yWwl>3`_bmXLX=z_8M7
zoPiE6y3$Hl;h2drQ4$=6@I*f*1opf6Q4@G|eM*XPMmgwrm!(`+{ywt9w9*Tn*2kRN
z#Cx-x);Ikha(};H7zAQ=q4a8q%=2!5ScM@1=faf7h6u8S|70G3yOOE!*1!T>+G!b#
zm(&UhPPIm#r4#?&Oj!BAg9TfIEJ4f=_6=rim7iExu(fHzCW^YN^)Hl46*vU~N`*mH
zQ`<|pu<0$Ic~;IGjIHgo!ba~y?M&R7Tk$+6NaYdK${eoJFb%o%3dtePRV|P3hcA6)
zXHo^vSnkTt63*o<&+xg#(oH{4QyWQgDIm2lbjRv-i1V6pd1m(6%ChK&bHU4_A+s^n
zl7JLC6&vOi$syX=q&r)#sak4Y%C0J0-3VY6>;X@xEkT{LTjzY0ZX*)U3VZIX8C4>E
z@^w@|N4U@`G{Uv}+-<Y<<iWeru_NQUC>caE1is@RWoMY<PzVCy8*NrWg!^A?XZ+Cy
z>C2W2n8rR3aOP7!*jHNr;&rD!sLiCv+eIs&&aCxSC#Mij=M~O}gXxg2rgrND`OHos
zAzQ<ZHR38Xz>k9W$FwA=>RhzzvMHndqIBoh3UWzDA1iMk=p*-}uOhzKjpyH-CM^<l
zNBg8#W8Lbm-5FMiq#=uN<R84GprN}Ws5--K$q*LA+F^h#L*lFw6zzbTCF@(J2f0~F
z7UQsT&`JmYDp}qlD70eW<8T}#H8*KzRw@^O1yM-P9#x^}U9DX3?M{_=savRsaHObp
z=F>Gf_12E8M%PfIzz)5v&6=D#QLcIJ!tiF57{5r{bv7a$oQ3E`u0{KBW|HJi&F^p)
z&uh<%Q%~;WcIqw5iy_)tILSCsg^gqTLd9TJq@=sG*Y9}rpX0oydYnYGh*cRqEdrNl
zb`ep3!k5gBe5PJsbZ*=wAz4t1>7ItN*WWVlmqwtI`4W$180i%VmyKwt%zo(*VMS9X
zh@%#J&0~?T;1pfMzf*!g%Ff`(f)E6vDUHI2=AYQ|oXZFHLIRd$p+eJihm|v_`iK{T
z1LWG~8D)T@1By$KXknNN;h(h;3oU4j%}(ScQ=oOlCg{1(BeNFtjb5ZgQ=nl-XyU&g
zqpHST=Qoe0K=kevkyQBzH!)!!oh|<siHxSA>UzW;JT6M$b<*k}%>rDG@`mExv-0R#
z2eXu*%raCj2)e-*N7?c0v^^y<UT_bQJBsATt<_v*cRupu2js_$u&oV`klL4&USynT
zL1AdPzxMU_N}|`H07)dg49qg%|7^8gbI8$wv?Wqr{C*p{PHbB=v&1^O5E2P5ax)vm
z682#@C#N;16M2#Ef-};KWH%7lQ{U2#6oIT%DZ*$ZAh#8rTkS}QNu;`<JLro({)Kq*
zTRnYtCxeVcm&sTvGq23wFa5`8rnT+ZnAqs|>5HLQLHT8L-n&S0nU^M_NDnf=R#KYX
z+H?F54cN+yEjgEyUdor&W13hls3rRC<Q@W%=AiBzND^s5{{)=WOAP*iTx0xEb|pCw
zgD~t%qyYl||Jc~vOr}zE9*L<~vO0E2HP}P^VFa7>9GHIMjHTY6UAcVW%2#n}6G+Js
zPJ4V%1b$yw9AYChmQ_M>72g3(rS<3`JV~tO5kSykuU9J8lr}=#Ar@P0o-yt}kFb|a
zbm$vI5Q8UA#koVKd3)MkiNO@{LS3r4!#Py3GF90ub;Uy6p_8F%kn(+u%;)oz$`h&`
zL<ycoD5CSHp5bwo+o94y$d}24#>y!}vb5J;xzNh&0%wX-+<iB~=Ixea8I`uYE3?aD
z-)iF=afmCkw~fjOfh#BmQJ&31&~pl?iMgX>r&Ue}J{<YhKJp2zf1uxcUsoH2ovNT?
zSu`d?=_OX~w4h-a<x-kvQzXOg%6DZ--j~XCb#{ml`;Y0%KIEM5J0UfiKnk?UtI6&K
zZu331+A1zZurbVy7ehV*y>2rarAnIsV@SfXkH`htyGND?sZ@Rh7h}d5f3_^l9_t?t
z?|ogJv7LtGo~->OY{=HAg0OJmcY$-IyT$*(VEiaMgB%G$5Q<(26w3Dg7aKl{=>Xl6
z`MX+?iV+2b|7-#*oeIxun+!l%7-&B0akW0p#DLFt>ydHLB|Wlx^fix*(7Ba9O-1Mk
zL?lry^$&{AOoi>XybuC9aX`Of!6$!~GJIQp<<M!`DE&-vv&D!@Se18C*(rYMU<~Qt
z=Me|9RcV(Egvx_S(G4lR5fw1}Z<D4`ErPb&mD6-HOk$p_t?`9U{Bi^{0uHIUj?<1&
zbTz5B;89@Z6ml`>67D@d%$;J=`qfh0EbhUukHBWAOH)hI`mp61`a)w9>edur=<fJ1
z*83DZYCpi@VXJtr4GOij{}8WcKm}H*Lkic6jS(RzLb_QwVN6$Tm&m4|@#c~Gq>9{_
zC1<>(O1os|{IP72#LVG%Gc?9@<yVFq0NfXOo4tp!e|N)WmZQ-tJ##BSfJN^=eDAyA
zHWC=eg<}fF<72)jFNQpBl|H1vZ#W>yG65OBsAaC6=g?zAVLR@s*JPS+rj(Q;BtMj0
zTapAJ2)mLfDBk~KOWZGDrfPBl%CfO}g(S)L2?#wDi)!%7`p4idB+c%@mZ@@|eCqCE
zx72GXLyAZ@_Ob99^z6E-&qrp<uf_}Wi^>D<KN@)~z%>^knvI&7Uj)2ck(cfGjHiVZ
zXYA%-VU(}BA<ttA<KNnBv`L*g4Jn{75!Y=|P`EYfG|Fz`8#L5bk<XlKkkxHvCKCnc
zSEYtEs1ufVXHYDb2i#Y+uBxnzm*uepc#<Neg@eVnYqC_EI(A7v&m-v@!-rK?>BHc_
zw6MTjEQZ1;27~`Xg_*gCNs2NH46qgeh-{CP**lpEvmT+D1V$bs*%j>6&5A=c23nvQ
zGJ`a3J|%BE;Mr{mA|_~O(9FCFWy@<fYAUaYNu%yLLuPEpnIrK88`74p_{jY3SD8v+
ziQ3TXQrDJ_pG93qCi<LDVGT$Qv(>SUl;xzE;$X@I-V<&34-5fJWL=&+M}p_45dzO_
zS-ua-?{2a@CS*0SgR$%C>HMjl`lIaJau|j|Ab2Im#;^Ndtc<08U{a}j0aT^ICa~;$
z;|8fr^|NS9uP;1No)>2v1<7rfP{t57ZYG&*XJ@6S^bcO7B6cOX_>QGYDqy-YHn3;|
zQ;#R-LSSYLYMws~fq#d#*wIE#(Agy4AWRebUFnuv^ngJx4<zHj3G;R!y({H+Ut3Fc
zc?wmkm?tZ>Ofev~XaYlL9&$OIx{SG%&b*+OVS<jm`T#OnEx&tG<ghuxEOU-J%pXQg
zo;6B_2cb+Wtzp52#`w)Ib4!uqWY8x2Vt!;|O;JmJ8bgU)FAEUHO=kjxl;f}1KVOdM
z6Z7C&0`jHfL6}o<NslCs>8YkYg@Em?dEWraHi=y(F}q9z`Ai5=)ut2Gq}Z`GUCplm
z1H{R7o@82G!6aFL85KUMytH9+-P11FuT`mpj5MPOgne)9bJpzy-W6nk^{D0ckK@%a
z<eNKp0=raA2bPha(WCjrg|)$EP5fpk45bHcfo6n`o8HNx9lSK_6d8v_m=O{<uMZ3W
z#JD^CvwSGKf+Gk*5Z02MAliRpNBjZ1Gn*@bhqpqIkT9o_nn4N72Yydfvu6BaRMVZj
zj0DsWg$Lm^r0*tZgNbaJa|l{UBqhVT%_oic_sH4t!NCdv2P%p{mn}6$ZA^<IOdPIR
z07tnF*-aDk3@Y}{JX(m&z-{$zM6@9Sqf4Z#D$pzT&sRW<0}_~>{oznvqx&dn34-VX
zuI}2c+A_ey^ELDdeU7o>S4%A;`>bAGM{ydy<6hWZ&#y^|Nuxz2M(~uou8bwR<t6|^
zz1qDS98u$fA_;?L8)Or~DjoDYYPO)hgk1bw55U|d_XifO(nISo*Tc&o0^%wY<MZEe
zKMyk$VS?u!ilqWa#(8JE4+b<0`Ch$vYr-%XOKI_K_-H+rZKlWCg{dY`ws#SOl~6NA
zVG#7L8liwkGvH`+%==es)uuvM(ZU7H2&d*1f!cvE&N-S%GI)fy2?5;5qYrS@n6!~d
zGJ(qD-wU7+eb%bff=RtSXVDnIqJW7o0@Xid=XS+F2m;ZT&_#j%8w=wfvU^UZ0h0J2
zsKea-@>(iPwc*#(pus^k4=Q8W)0#el8t1DN%`KS45f*pzi(%YjwTfimgDCq!Y2I4t
zw@@49aw^o*E|y~vvptCg(@d}NY0Tuz53htH9RA?q8n9LF5`sk~pz0NqMYzh5@!(~q
z3CEm4NNAPC2#~>!t5CSjSpyv`M%ScO7c<~Dn{#&B1Lh0rhpC6+^C5y^JZRjEhc%((
z4SfbWe;V9Ulv)v1^?sh&7Y6L8Wp~@X)P=x>I?B9&OJ<*0VVUj*e_$ftcG!6~_0!?K
z^DNS)jUl<Mn{=f4_dg&im(1=jXhz1+Y~7?Ih<o8_I5HLI=(PGfsBeC|r8&50D^B;E
z+LVTu+D!Di2_NXY&{>Mc(%uuh#hBQQzmluv*q-nFh%WKvf>*n=+%krIudoBoVb?!6
zA>XmfA@Go@T^vv^>3{(p)NER%jz0nV(_FAH?m8i(LYFh(kFs;gVHgI1=#^q)NPPc`
zbzXM{MGBin-5@LBXEUBb9Mu+@EF2$2`H(IDJ_*zSt_L#oH2>&Jf6yFwwSDl(C>YV4
zbc+Wi&I-ouxOS31;+Dj|wQ^!csj#M#&dWaakF=2ow7#`79*jWpy{Jxm<l_uUxu2R_
zrQQG3reGCfT%Bbn2E(Df#O6w@3^NzXn@sPlJ8|`bXi+@_JQSW!sJ3@jooc0XbzeDT
z&;QlfLjBRv)9?hA(Mtwz$S~n~v;!#TGA-v$wUPr}Pys3s`V$}24Bkzro#9~ctsgZH
zQ4DunB#R`eDT7!{Da2qp`l1^4Zaamf-}-(IP)3=1k0Pzt;q~(@l%&iWs>3Qd<XNxr
z-uaT#vJ1i|0vMW&bfH3D9S$&`Srl-`8XG9E9;+yRMaOgs%Jrvqc@#ZV`O4JP(S7%X
zrCC#U;c?mO*sN$?L`SXO=c`oNyjosyhM-Z*fmowNG_2@ybmqODuro7e+?<GA+!wP-
zecl<$x@BcRWofY6^JcJ8yO3o2N7)%AF%W_<^h(PLqW8a86F)=klnXG9D+mkb{kAO)
z!xbme5uBV=^wB#*=P}d`5kP`4M^bHaZhfcNnUaVhZkWV8BQC{}CoeA^yp>W85z{7B
z$_~JMn@%gw4v!!Nti&dWkzLQnp|z>dF+AlKKv){c$ef_@GA!TO=sPLUTZNY>%)sX;
zsYOjDlAkI(vvrKOPIc}?rm>6=&8ijDDFFnaL{`Fqc8}a|9h~{<A$QxNFoQi>SS}ne
zZAJCIj_Es+dUnL$!>>BNZmoS3pIRrOU`ON4C>KO0-Bc*j3Z%!>2tfd=@*w_p3Le2C
zA%VqZyqU%3QD^i&7JfIb%?S7`H|iNoDT)AbN3|_{>0c$pb+a8DREwIu_0GgrWp!j%
zlrN(q)y#huezh$Or2}-dL)yibXI*zEuFH4~f1se&Nmg1c=ZkE6>ubt<j8XKQ0z0Vb
zahq1AXvefF*(0p8*M>v>l*gG<4)}+%bHR-m27&06>=3}Y|HaC<RV%=0I~PD`7sq_Y
zk3US8V;LDC^nj7QMe#lUwaDPzb^#tjuK}G5I&EF`C6wD%HgtsDh(G&O^LI^wQ+}6o
zISfyNmtqU#36x<%{h6y-kD?n04$zoHYa5S>!P+>T3kWcYn+jD#cbvJv%Pu9%39%a%
z_^&B`NJJUW?RBNZ6s5c@S?3-#-m>>pRS-XAw+!V4bX)9Aa<uAO#0_JTEXz}hi3X;d
zM3(Wh1?IbF%!IQ2GNWJ$)2xPx&)NW0?paZkdWX3x)f=&l`2~^~9Yw_@-fnM3R;Wn~
zb7L7V4ush9!!%4E=J!Y<ZAc#?E5PgXIBcyk$LL_xvrJpBjk*~R!0VmQ#*_$22m=(x
zf-p1!ZO+4cT4JcJ2^xb}2gr{>yPy3ExtN#u>IJn8t2VZhzqOl>KEGQ|&={~8WPgRl
zyCzMTos^oeF}DDgzn2k3Y#b=R%wSs+IR-)_5TR}a_0>U|U!Tnn%FZa)fe?hETWUoV
z_P?>m@#huEB*O+sV+Xw`ocl6zN<t7;@l{XQ2VT9_TjFIWn&J2`7XZl>phBH$@7w_-
zqa=!_LmY7|JgQLaxOS^0l;H|RfXAF;AyuCXT6LLyGrxnzO~!M4Rm%z)o%Bx7n88$l
z;e$z=?0m7x&v73Mz^}ICpyi>6O#>($-ui*sT_js8^o6MKvC&d?lDX_aErFc7Uj`Yc
zf{j9aWtBeGX+~4KM<Q%FPKhRKRCCnUxo>$&5IPvQ_j4YSXvvMv_LfL7Ap``_XOzSn
zPo8pIca}PVVnWD4f5PWAB(aoAy92M%go;s_P$KE}o4mis3oifjZ%&MRv*Y^Yv@9-v
zMbCeZ{Co64`<J<7#a6Gic3Q3X&}^wBV^iOF6gJc9Unrf{X7y`0DKc=z4uW$|1(3}S
znO`qj3_R`ak>7*U<VE1;<;cUjerBJsy!~o@^^=yE^9!05Rb(8fv?c6&m~XXiW$zA|
z5rQ021-!n)ulf)EN7=b1F%W_<_)0!7;{7jHVt=u8XPOH*TZ<1QeEDMNg;WQvJrvW8
znI%1WYO%a4s|62RCDs^0>3jTuRY9<(jGS8{;;fE^9a);&n13Mo-^ZOPh2Y~^Z}jsZ
zOu4}Rr!sQ(RXWFfJ1Ib|%2%OiOp$$+KpTOJJDt5Mg>AVqa^j`M&Bv}OHut=87AnL$
zBsB~LQ|=KKF%@2$EllYhLKegDb?fpC*eEzr*NGH!sXwrfD^>Sy^fs%l7Q*W-vbPfP
z@N`XSJZPV{PesIu?5*UnEwDn{h*%$geDCW_^z3W4$(4w_6+o+%owb#bXLcWB6)yfj
z3LEQ9d`aJ&)}J3{*k|2vUe&iq3FhRr6qgO>yZgD#>|O~YN-!s{C1ZJ=l)ej>sE~Xq
zmb3VUU@5lvgT45z(%ZWf%=r)`mTuFhZ`+ST#8h%iWbMlUUAw>4h&`WjdIhzGtbMWA
zI`^iNhw-veZv9GcC$jV<rXg}4ij3Akb-RbO*Ja_$<sq7XD7yk1hG7u)QV4`3|35a|
zNt*yonjfgDmVgPy4lrY2zx3S}CZ=cRqHPJd7+p4O!lldmJ2M&f%6c(-)W*TP0@tB2
zpeGa9h4&(05C{B6DIeXbSr}&tFSHkpk^(}mDsDMi5^=^5!)H-2-0&~NA{Z1uyRi=S
z=yV`glq+l?M(RV+tr9Ye3GH+o4T}dRj*4r&p*@UbzGo5)%1dOt0s4zKnU~3&^vr-!
zc+&t)`v$MD;R8k&!!_N=IKG7F^=QSrC#NiC{^hF4EHXf;`L!tuslg@_LVb^PFFJPs
z{{?8H*rJg?3?qNPbG9IaO?I3T0|Q`oZ5k#yW%5gua3~@H?SRzU?VOk+u31srL6yVc
z*uW_4=4aHSPZm9h@PJ<3#m#)>KT?<}vth7NJTQv(^Pb%2ITe#QG8ZO#x2tPIA8~zw
z^XF4ASj?olRxD^PMl82h$fzu8WlJ~0VLZ1I!=#(FG1_`w<YUgG8$F;#f0~LR<6i4U
zJO)Jg_;2IH+t+Q(^+%KSqU_v`AO=Aw+ENS=N&k&4$Nks^lNo7%aWoNu`}hkSn=>6&
zz__Lti>y|@6=Hy1$$zkUd1bimqSlZrmeK*n|4(H2g|9&2uT`SERpvArAu{+>c=hJH
z58f}Q?h5}xBRs}ei}=ITB~$BbN~s)SLdW=Spby;q5N8cw8-kASvE##(Tq2WJYft7N
zqjdKta12cDo5r!>v#~s=`&p?kl6VX<lnhJ<KyuqMTYq16GM`5_%<BLEq30^(q@#3{
zab|%LuX+t?)c8C5@g7*?!0muq1jJO=srL_QzqQlR^2{iTZV)WT$PKFslTxE@jQ`&X
z*Om!ZHm8)*LpSQi++G9;jqYx;D){|fR6C)Aa7;tk-<NHSP32+8TRA>$iOJ1;5H`1v
z6;o)d%;{C5uSECIgQ^kx<F$WK(LT^99V7nQ=qD6HET&heMdjt6urb%6Q#jhw;e$bO
zuN`9aJHvA7kokG67=T+!iw=!axJ2R=mdDkHwsA#vN&{NPlgi+|r_k9lpx(adkPl^N
zU@Jig0@0T6P>}u`JH|`?50XuG8Xy~^3*zwRZQN=)h~bSekX@oTGZ%HEsN5L1q~ow;
z-6)^?WqMFcaXBmnMBfl>8vwZ?%~Oaug<hrEz!j}IG0~FMf0O1KGoNG?9V1yFgu>&*
z^RFq=(G^TpS_Cs_bbzG*M}_Eqc*Y23tO#awU;q(DR^gvME;yOjSu27Wz!IlS-FPc&
zYr)_etf*!53<6*n6dn_OPK&|cSW(NsZBQ}hB*5m|t8adeTxf=C=dx#ohYOL-cClwD
z3s%%Ju&Y*R4HWsx`_5omY(*_I1;tn9gTrXkS3d90kw;~r#{N|@<B(on`13qRzSP>e
z&Uvm~A(Z$2>Kn|y+n2q>kW7dU;JU1CO=Aqs(5lH&mPnam!P3mTVKlzLV#H;(FMElA
zSVXes7-#bPh7RgvV%v2k$|Qh}`aTauZTB%r{8G{6zaLJkHvF{lo8vLHN%qxG2e3!r
zllreP`1@w&FI_=03YhZrOfd$h&Mt~$4r53SJ-(EkK@!6t2t}_HMT6e|V&&Nt&`iU0
z?>IIJDF6MrZ7l?v-`!u?mOc;d3PgHmNR%*wKFpSgt*hh++gpI%4ff~piN*1(zi^j(
zp0(SJ6A`)aa-sGoX4qb-^4uQggwlB70J_(e{HH3P^mbIkInOgYeiKNJ;x&539`@c2
zwY}jDs)ZMk<e^-euM3B0CD85g9De<{WUHJTfic5PN8^S~Y1d7!lBF+h2mJrU{)cuV
zxJJ1drLa*nFlNSevVYr%REIyH5UVn_OH7frPug>=I<&(&YDcu9kXF}2b5R@8ySxwQ
zvFA29sSNGCu(z!=IvoN*l)JP-I8^Vpq_V)X4CqcvdZY;4l{#EKR|fJY{;+mRH_7eA
zy^?&WYolqXf2=672@iR-8qedpP-qF!aj3y{W2{6r(yKIOw-E<vE<XzY9I>PVrdMyg
zMCOl5T!fbSm~>Qd#OiIAxG%;CXkkX#b62pm%Fr$FFZIimrjc6`Ew@*qiU!}MVM(6t
z68s~37K!U$E5;9HXLM^Z2*c2o8Uh&hU+l&GOVTSnFHoTh0)%5becDS7+`KV2UYFRq
z1-PQxgcX-<!T}F>BK=q_YfHZ)-42;XPu7?o+ttfxC@dQiOG5x74oIMSXU@J>jx;%t
z11}k)GA_e9tvy+|qH{;eTynzbPs|H!r@F6Zaw${_tTbtud`A5Tm6{(O+e(cdIsY>b
zq00unv{vUYTmk4Y63#|fX{z$5Ew6oJn6g`?z$GIcG3}fcC8GM6<4EJp7sJa4j#nMz
zd<t)#6^cR+qeM>Fb9T(<OQ^eRGZh*U8KH?9w9V<`3O)_>I;zzEOwc$phXyf6Mu4_X
z%6XJkm;su_1x|f>Yyh{P?_9CjL;+|v$^45K2zZ)1KNKHVWQ1lBoAFqShnLZh5Jus|
z3r}qtD&UCXMd{~>y?hzUI}1FuX=Z#cN;K6yA6T~^Y0ODkxJT4dI&k<K(KY@NmGOJb
zWi67-IV2O!PH*Btu`ELNkBOW2T+Vi6Tx%=YA?33m+s809n7xR&0>r%bAL;IYlwI2q
z!ypV>iGabd|6-N$XPe$d3*=H#ux#}B_TZIA={Px9S19Ey<H4@PJ$j<hOf2)J@Xcr&
z|LJ7<|LC0}bD1jBn4xqjwXWDXcqY-ju8a=UzzBeX!jut>M;grofW(f7?gDLG0D{uO
zS-Qh#a2wO9I$ef7WHtYPa8Eo8CaVD8p$1fU(5WrQNbz5O@Y2}mzRDL={?itELpm9u
zi5tWQc6MdMDmdCgZ@4+^wuVyZc;#YuHWZnYTTt3NFAnMEgkOV$IveYoGQac4rQtox
zXsB5PWO<#HiA3bl;9x#<;{fPb%nvC$ML9Ymlg1dVFj)|(JiP?CDK$JYX|TxTWu9l!
z`s|X$t{ffn2@1*AAaF6?kAOGtLPcKZvj_e6qSRuO+UI)~g{0ya<T-(9H;!nGhCWtY
zvXxpGDKx`)8$uaBDq?YfJJK7^ln>rt@45!4f045&tU(V9n#OH{_Ipza!Q$n4WUS!3
zn7-6_*)*BT3(PQjq3*hpvgtEQorulR6#XbW7u*P95QbhU-*M*t7b~VxD<CVaFMw9r
zNdm<99geS~wc>oQB-6=QhNHfAaBL2rw3V|`MJa(NHECEAbqh)%%&hC7TmVmeuOKC9
z(?r9n<^GiSEM@Qn(Pd^G7aNiE;T_W=EqbNc;R(NSx^94$@S}FErquEXQW_%o2vniR
z{5jPyL7{OVC}~L9oL0Y4(l+V<*p%wpprj$Xji$N7&XJvo3()>Sq~SeFH{e5~JC~i1
zRwCjE?O2|+dmgJRcF{8TEk%wvLMv1(^KjJREUzq3>@E;JXO`84?npr{dwEk{im)3&
zM#J$vrbwW5*~OPZx?~f7X*!U-(+{nHouH^ufYc+ko7;y?*7;Xk{{>dQWW=fvJn$!d
z`TBbS3M-OvAi;TUKU&;n`#NuuE2#MMBFC9~OxHIaf19mMQmLsFNlaXgP9lX>-WOjO
zNGWvWFga<??pM;pPOS?2D}8mbD)iL+^k3iVQ^knNMHneegYtO?yAn6oz6yQ+)jyP7
z+l|052wN#M55oS7ot>YP%jHxSh$7nXG&Yac^$L{D!7LXp+TNtnUTPZ%=ZuXQ)BxG@
zY@277R0&lg!DJ6f+(>=FJ%#6kF8%$+GO{QC^EjI9&u`81-+k}rN<~O1Z>o0U6?e<o
zXn5tND0arknL{C}n4FYlnwZi*r%Z?V=eQC+sNFp5i{ks;9s=n`(cR*#+;{>Kd1;Wm
z71Dj?AC1h+Gb6&h!kXa1K4XRqV>3*-?JV4~OHFQJpCJ|4Ks@0iq@CkKv*2nCh0RRV
zC>HDz&W#^36)L?_s3>e^kpFVRA+bcx{jX8chj8Ve!KwUo@T54|Mxrw<WsAx`bGBme
z1pSFc(AD~|D0;W`iwJ6+bf44NXlV-4SIO22VWYHi3nD*Pn(BE)Y1&`>Gh`r$P3Mdl
zkb2y`vgG87pXrU;zMPyP3y*{}_R9X^ZmI-B$}N%;k@aD{dp;GCyRGs}4>ebfDGm4F
z62yI0Zmh{DF_SO_f-ASRQy{Dzt?8&EAKmcKy;Bk*dAvWsRX>!S3l0Mz2t=<0e&PNX
zD`S%;fZLV}7_+MgIKKHZbhxHCz%<Ll0K4BgFqM9xZ_Zd|fG2_H1dkSc*RAqAus;kT
z*=0<(k0w!psI9U#c0$M>mM|h}R<X@Wt}9+V!)z6sZES&*G^GZW^IOOh5YYy-B8c}+
z4}E(@Rwdqx$qFiq&z3S095xehS}S*_;t@1>Z@y;J4s+X_n{x#;BHoHgaKDcCmf%84
z3Q1ZK&x;q%01kFYkh+w1n)a+fBqT~_0A1mYg}tLOkXF<N!m%g>$Yo6%8f1_JET+<@
zUS8AD&|I>DLM|q{v*P_H!G)<??QJQq9Qe)1y3EoC2@Wu}1&^77B2kZMXsrzF#WQGb
zL%A%+b~KA;Dls~kFueh|V_`v~soQ^lj_0AhhE4FK4pPBpId#s%m`fqgNoYDxPzMQI
z=lPem>Uq+R2L%y;BJUvJVp7&o3QW!O*w(OhJLdsAU&w`2nX_+>;u@K(4A605$X!)i
z&m%9Nq{EPwtZ=2ypQGhP*%>8C41z%PN>PZC`(JE$`Iuc`QWY*>StbHDboamduJr-q
zJ)}Q<V1~986Y=64+QAzwSup`_Lta<JMO7|&VU+!RB*~+9^SFnSgt}gtpxK?auO%lY
zGOcmT1%c=KV|Qd#E$Yw!u(4k(a_k&04*PlGM7=-po`duYOKat>;kM3CB9cMarFiV>
zui|u!js%xUY~LGB?TbmgQD~#HBXwqy#DYC?&_MM9byTmepXc$sbZ8vjf}9@m@Wb`n
zQ|1EB*;zU?4td$$GAYE<U9))yFEt5R4azpGI90SzEIOvvCZRg@u)&Bl?i|M|e)XL^
zuAw@;PDq!^><iw`m%iBY<0)&J>%K*g0BZKYpQBKUcc-+`WLb~r7it6x6^{z>S|@x&
zHJam=K=LR()a%nxc_E#Kq$TSnsKAKBBfs@GQ}wNzq_yqHIRt(5w}#$X#^1S_4be)w
zVUlKghCvi?sscflYkqY?s)pVnb8IJ87@lHgIq1$E*TBKwi$Nv-q1T0Yaz<<3LMk81
zt}RDk5CmSSRz<k~#dgO1S)kcuF3^|?A~=uVFQ-&I*9$nVkI?wIpeh-&^RR{zvy+51
z1jzgV2P=!-|9HY2rIhSUY#NT_pv8()0=AWHWtQp1n(2)f=NvXICQgh-5>h@~l8%-r
z#5X#HGdo9ADS$<J=9%jn{}S|Bo!CxD8)oIIu@I%}@=rf5{`*LAc8U~_le4`C&Ayu~
zmcrKazp$AK?NL4xnJ-2TYmCeMh(=*0C0qyw%SraqHu0hQYc#1iY^PF_vf2znma6y^
z-XR^n#)8saW`xYu2qxUu0~N0}4+<a1vk}v~%&>!;Jkal_^EN~J8zt#*b+dUb;#O16
zd!<FE7Lau5$0)6fHf>eTzO>*}<2a`a0x(g9XA^<PQLh|82_VA>3B@)y<+VN>{)TdY
zGjH_RAn<jg;*T~yQeINriV-i7sLv$9!K|WOr}BvBMQjEw1F5F0ARFgf?O8*bd7Z-P
zrD`6k@Fqv2ja!fMjEAiFq3jHjECxX!dL@a9aQ}-9?XKm|qA!q2r8E)pcuiGQ!eO((
zg(EDduMma6406o?yqVa7jxgKx_K1~<v0&BAOaQ;0XMUfzh#cu*&?w=kk6xAVYkZB8
zIZC2mkY~nl$ea#9$uTqV{yCO9+UIG8+U1kSihzTrnP#NgolG+W!#cUI>F-$Gefw3a
zH0ek+1ML_{lPUl$Ub9_D*Co-+XSMIV3hWKnYXkbX)Y;)!ri1Z={E!%*Jz?8oE6<r3
z8EDa}5FAK~%O5qL@`)uz29wwTF6-bK{stXxsTIXRP3wS<srxp-m#u>qifuXAF|#mo
zwJvmGr^{NVOPA(eXq~>`0z<}6c4hmPUUZDfY?~Jcgnn-9w!>4q>wgcQQn!|{nA*#=
zjVH)#^oIQFf1ricz+6lfj$u_oTb?&qC6sBzcw{n|&qPP0_61}^jfPZS^RG-MP&ZY1
za}XlbUdYlHgsB)%$lC$i49EmqC8-$BgQ=Kx7w{cdwKjnvsVe^{I~N>=K^TT!sZbcn
z{Vz6~O52jG+I)csF<3sh&*q8igvx#mbS0F=czHr1%S>5yYWX(mYN1*}{u^0HEp;YQ
z6hma}ur0=&90V6FkHWIEgq0y@bZj^@MG+;hnqre{9+KZdoc!+C+#c2APS_BSvKX46
z5FBN;L7sUuxits>hmPrw<v3!~EWCO<nDR}EN2bhVpGIudy1KQp(L)IxC8BL>`1oKl
z9z{oB(ryHeXeU@_Qp#TWI$w9$ZsX3xeRS+^C$4_=92wWpl_e)X>~UGUb{>){UqtXj
z3BD49iBK*q8%OU=+<x6d=_j=G*Mt(rC&ycp4^(B@P1$X~ogOL{wEn4u$%E2EiPNG&
zcpm&p8TpPBwREhM*Hn+PmlJ0dd4Ie5tuL@yg+}Quy1t--zxWzN3Rx+tY)G*ax{1Wk
zg-h%wn%^R9P%c9t#_%D_Xpqr6g-rfC?){46r@1V%aDC~l&WTI*8*=Gzgx9@GM32sa
zu4=gz>q>t1W>3nl<%(ethOLws2x$MsYSBxPn}Zf;n?7Tk==WB=;TZhjemzaY$<x4L
z29y6Fn-j$u_ttLeRG*GHK0;2|WKe5<1CukWM%{rj5n|a(RR)Pki|=a69J?Kl3xq;<
zS*T==jxT+vG+5`OPi`5(wOktVX-2E2Fb=o|iB+OuFT+-XgnSfG&~eYe52-~Pw-XPI
zIL{O&^Kr5c*k%;SwGu-S$Ey?i^OD8bsfb-=jz8A3zYi^Et_o4*BGZ&He`E~xYRK*+
zZKA!Ra*hxOLQA<Ck=gC&z7ZWQP6vmAc)M`Z%H<1-j#K@XM!g)_A(~{B<%N~X-(2Mf
z<F@};|2ti_4gKM?QJ~vwE}^}u+8tYBh{p>-2=qPVvxm*%!n>U4Ih-ah{N-6_!M;nZ
zxn8M;RVz!HP0o#64>x_{ss6Cxfca<=rQ7G~i+bIMB60QPvX070RLNy|(w~eMOiJ_h
zj^Y%G@KmnszO-_RFGKq{;2+A)?Z#pl1fne^<`L+>v1Qnw1vXM>09`rPHiqF$##v>m
zO{Wr@k$?%jSg?bJ75BZ#%9~CFcuIhCVU56Wn(Ui%(?{`2d|{T%vJEDPlW}gV+=5%r
zTo^|fDAO*zf<mjnT5l;uhckN;d<`!4=G9h2DzO9ObcHMd^s{?ptGc@Uxlwszc|q1^
zBy&@vZ5z`(FG>|4_Y(MphUs)vw9O=q7o|$v2AFlp`4OK3ZMG3<djY<P#5)NC6F0P$
zvy{2Pu6hH$#5MCod{{M3D{j+GYAB_709wCD<irof(_?<Y&Fw3te1hTV=VV|A<^6-n
z%zNa*#YSON(`*1*)9IYLDN_~V%dID?x=^m1o-WX}`p*@|B+6mX-vO?vL9<n=P+%`7
z()r66!Z{+f4=eE=_wW8=g5Om<$Q8b~|M-h7mbhqGNMZX0i|^Qe(|qpP;FP^+SWuD%
z(gfu?n|{l-krQ|^Ov0d2I<R64vEy=OmCzK#3yCqvZ*f$JD1G?7?{T?-Ddp%7WoMJc
zFbD$SD@jy@`(Lb#tB#o0l5Vnc;Y<0E@tf@&zWsqtieJTs$(1K}_=s2Z!C?PqCq-!$
zTXI+BTf5s_O_5{4E<K%EDpPJ(Mq)eYfD!Vsc6M97?#TOQGX-=GP_y7K5HIU&+pTiB
z)>+1atCL;hH)OjTopGar^l;X(j7>gxaM0hS=af>h%kU)!UoO%sp!bo$b9*5bVZAf$
zrK31{qV-y^5KKu$E93@e-phz`6tXJJMEa1wDB<r*vt?53HJs0313a^WQz}uKl`P_$
z)e<pv_UEk5TWQEdS{7j8wk4*SURa&BDrXYpnFM!vzyy#X6ZHPN?)z4JCqmtGAf3>`
zVdk4$o+?EF$yl^Oa1$ke+ns*K6jXw#aVZ*Q9*z#;`*6vp>J=om8?y&T$1@-SSm_F^
zt<uU=ibmgte$dd;YBGP((%CZUSSDn|h6{4=$zG`;tcZr4XfLy43ILi;TWX2%c-@Wn
zmB0UhQQ>xo0Hc{x$?oi>n87lZ1{R)s#3VokqS!shyubUl4`tVqEI|muuH-1vaQ}-<
z!e$=wx=NP4vAQfj35MkF*hh~$i-8)kcFHD^Qv}y~CbOfbk1`}5jNGJ4<>@|X)|!)C
zqM?)+n~=`c?14R>zNN(q{R|NVt)K}lHoC6ji#<C@te%WtfWk1(;K)>wO#dgyr*qeO
zQkAWca$r)!JGaJhbWT0bs!p0vQDF~=`qVD^*)i|&l$XS(Z=h-0U;vZWu6mIY`abkd
zr;|Ro$oY(d{ZtgiCandc>2!)y+S#9hYq6lb*6VkQO=6TY)*fIr*2n%_nI^vfb0UXK
z%`=)I=wz<0T|_RtkDTe@23H0H7lwUQeBk$73q&*7(}NRXId21bp}6xrnm(g5axx*r
zH#;(^+>>2zfd;!+BdJ>=+ld&@U8F3G`wGe$N!fxe2A&1z?_;m3<(rMSwKcM|MZ>0(
zO~9t75u7x3_8KEsX5!FiyqKz#ILy`rXZOz;a0YlomRQZnYyI(a1UNrY#H4Jy){+|4
zK<2|HY;H7!C49yvsl9eXJ0p8GMv4dyp8KOf=pP*YQg#J448tJorG-Ee{(o$CHE9FX
zsXTzHC<OzK{UC0Xd!gq$Cty>7YYMHQkvkDM6u`?RgNDM3ShuYBw4t+#(1G<b=0u}u
zCS!l8>i^>2e{v{)hJ?BJ4ui_DH7g$<ozPJVo5Sr*sU%UA+7HgoZH`(mRB)YWj)@(|
z*|npP&Ot|umVNzzT$o>sxMITUov)69^yDi6`g4i3q|TJ=v`!?8y(kU9@E__vRwvxv
z`NN~$%Zuy(Nogz2+lCjc>z(_T1YcMOIl!amG)j0bgsWAqlHv=%5j#(0CZlOtarpDj
zc_)Sp+HWeKq0pM|N^g|bJ;}aFd@xT5BPx(vx!j$Mnh7$?*yaPHYbgRYJ0(2vV_e81
z6{c!xz?T)OdFwoqBIx13^vpx^34P$Tb|3h+DDv?cO_KodKo7r=wy89ouZOM<@CcL{
z68sO45=EeqO<r|m)w<PTV>nDd&T}YX#R76#Ct*j&qy@N$ZbkWaZtVwv^giy$PgR`i
zCgTEPWoFe_fg`jek6w9Gb}l#!gdh;TlCD3z|HaDNZPEa-SuS7=U4_A62304<u-lO6
zn3TDhnlsWxml4Il1v>Nxe6-Bh(OhQiOMy0wph|Umy$Hy8*ETa!<zXGNJA$TREGU(9
zEulugJO%Z%VB3P*>(y6FYUyP=2VZ|s{U>*cc(!D4mQi~tkK8Y47Ok=9sgkNAJ(WhQ
zQydj3*4ywG^)5ZJ>+W>W<{Y{rD1gU{pkkDYh!=esPxY(lXit3ZUYH*qL*lqJ3dE7<
zf<iy>g7-p3Eps3pmj?Nfb-VTwmuPL>RwgFhNpvyg3?_ekpFBISq+;T7BYrIv9V6Q6
zp|iddGZwnGZJ#RASPJXr)@xhi6a7Rohtm2dp$jdy!9$0|A48JK=#Ei?g}ug<Y3hnC
zQP}pCS=*`;E(VC{kWKn;FRXoz3tQ<I-k9N`$q+$L(Wl-k13HG4rC=t0-cIGe`I3LG
z-{&pcSqT^^l}c4K`G#iiu9?j1lwkCyG<OZ*#db-&S!<CD+#Oa8t>EfhX};ac%ll8L
zKa`zO4uvoX1g}JEDfRvrd!7CPnkN@f(`W$Mo&9?x0h!&ARGO}yBc-lYIuLKjg@cBK
zVh#GJJb;y+*}{Ij36>NkwKji=t<s99-|90WSOYLDQ?C!np6|~bW3KVQ3UGrvk&9d9
zGn^r9eiyApw>Ox)GC;glO3Vy8(}nTJ1VZiTJ?nO6rS1kqOxx{KN71!x*_SNb_ou!>
zY}_~uXW)`?IDd2&zhBsUbcNsQW300?nwc<M8NIx|2GXJKwt5#9^1+gUTPm-#m)8t*
zB+ZCR!>y4zJ}sTJ|AWJR3;YAW79K*0N-eOL*8nQpLpggFGt+$5l?KGiYj!OJxsP8G
zX;AVY71%Zit$en@5HtMp#Jb<9j?c;(!^>-spzTpZ4({hklr5!ecOPyb1cRZV7|AlH
zrG<l6*I>$-2lUD;6Y18yGS~SuB^cj`1#}nMJJDQP<(2kXN*$Ru(a!r0a3&K;q0&?b
zP|Pu=>4gt}CSXVDx;}8;aFD?Q5!&e=WoM8BF$lxJFBMoI{QqO?skDbQs<giKgw(1D
zPU6`A_`1D+j3f;TnVx+&Wsg%COkv%#I~%#Mfge~k^)d)n<U8%4ED|H=ugXO)je$qi
zTlqL?Bi{80ofHvya<K*~Qo{Oswra!IoZ=@DX>?aNmi;yw=lUm#L{)d{@5H2`E4>#&
zV8}8=t6qvuz-8+sw&9yV3f%6Ji%+)>POBAzVK0i?3XPa$a&fv77nw-|?TVJwEuplE
zII&asyz9YO?bZilW~fvUrb0Dd;IJSSg`M+VPgWzmnDwHr&E`<a3g<Y%n;0_!nVcuU
zxzIr^xPCajsYIB$`Te)25fG?otDfQ9M2Rp%^|V;;+6ug=Lxkm&If*aRF??jxp<^r7
z|8fF-Klw2)L`idEvA{UFc10ajpA}*7efcO~2z|rqE0Sf)$(&gdX6ib^Y82OksN<{c
z+@M(y2CnN?cH?F6fGJtX0ruG_X<k@|ureI839dYwU4~`gXxF1Dio-4Y4^2<;6At`R
zcDA<`gdh;@<y8QRsQowg7=K-4H`!^x5ThU;&iScG5oW90bclEkqF6j|SPDvOGQE41
zt5@iVtz%#?uKSm=<-65aNfdvx;OrqO;j74CGc`KRxFm02M;UasJ$zqvA=J|8Iy$8C
zIxs$%_tDbxC4T+J(&;)nenXBp36R99^9(A?Xn<y67#B#yK@u(O_Xo3$*^zbe$Xk=x
z6fhW`>RrlMo$H}-3pKpRIOy>CL7Dc|X3Ydoa0Q^1ZV$cnZH&dL7hcT#VAR1Ql`3q(
zTo}zY7(hPGR)^1j_#eY$XsQ>vtj|c%;+?eORF{*tjaoVd#&8|B3_*8zO?Wn;N&|t-
z6wIM9Y2Z_Jy$Nxhx+)o%G@%N%1?9PIR)=aAWAVK7#vG&QATss&frt6NZVri&Ni8(j
z7Zfc^yVsb)pXwbF8<d6Yp!mw`V>8Kw=J6TSw_?HOaSuTvFT&Hz(a6&?<8YA26nr+3
z(rufa@f?Yk6e%k>iXD@xP;e@dh1luV|NbdEm+XdN7zSQRUsJmO#mZ4PCD{#L_Ksd+
z(X==K{sOAQ9wt7#2^sZ~wUpZ<#w9g~e1s;3ZDHMlN=XWFNxoHJ*+2=K)u5Akr8R$P
zV2Xohf6Xt0+1%y{MoY7&yd=9^o1D0YtUC8gXDWSOfM*Dh@{R^|f)S&h`KKoR);E}Z
zA7c1WIh|AOSWVEHc#9k4zPMOoXmHPe!=Eb^rWtVVMfGoBrTbLAcJwJNI`Z7e3cmR=
zlv<e%ZiW5qDJh9GWNcTk>R6c+QBL6dOaxm)fV7RQUMn_;%F%64IZ5rQ2%uKKRc#Gy
zD>w8^0NZ_nEMURPp<n3_jDx`sa2K{}Sue->rYtxH=|0yPqFq6E>nyWLcSa1-Jv^<>
zZ*0`4Clg!Q-79H*kMBaVOvxQBn!S0HRYzuK8<`|tH0A>l%Uk|ZTBV50_@(_B%Pf-)
z@2jOl>6IcegLGx=>tzF1u=2X1ywOHnhB#sWE~-DpDbHp;1-t8smcgwA7RNt>CNdxI
zmn;8Jb}mU0gdh;Tl8X4b|HUS=rZzzL#N@I!9R{U*G<p27=mdm1ST5>9_NF=hJ^Ozp
zp_wTfa<UpP+{RPQ6os@R1?x#GvpFm3?tY)qqeV=5n&M5PR>pWyd~Fbd?NyO}rf_-H
zy(JO>QievU8EjLaaYJ!V9_6I$ePe4ur$B%GgM0qf8Xm=@9D~LOUfcAj#eXd2Bf6zl
zz(a*2N(@e^Elnq`R2NYybBW5qnHlU;wp)fvx^hnw0W_QpO&Tgb<-Uaiubjk)pW*Et
zxu2+(k=RsWnR0ay05sSat?>Z4{Z4_;YgT+|0MJY(=npKW?^c-|S8}EaL1SdaE-Y>i
ztH|i4gqFadnTJ{9Jwzq%+9f(nu|}MuG#O?6A$BZQT03W@%9=x`FQ49s{&vF0a>25d
z2p$+T9Qk|r2zy}a7waB#f5{lJ&v!NA9T8*uT2@D49mPRMnapV1c!=S4kbl&f^+P#?
zQ6__*9VQtIA@M^u(%sU&i^@?p3K=2jPVrZ%X_e=N9%V8}rHPZai`4gxd_R<(OOnGd
z2t=<GtPj%tFE%`81&S(Wn*~ML#Qd7>A3om=?}&r&W^*}v&KnTK)owz_JfriQc*&7J
zNLmSvh>wA<5KZ}RZEO3Y>#CJjD8ggtH&H*b<W0eJ>~KoE5KUJV9dS1{TNX6uMRjFK
zEfFF!m={<=v6Nx~-Cj-b?xsiNtN!=~nA<myzlZK&r83Y&h-iK20)>e<^m<|V?sFtW
zv`&+=H*|E7eaHj)%KA{EmQq^;<Kr3J`om*FBc+!ZZhq-2n0Bm5nZ7d}h*r+(Bp_uN
z9J6vlxayHFIZI2XLproaA%4g&UY;EjUacgT2%mui3ij~HL2B3YlUMS(MV(O6%Cg+0
z<7v4W`c%de5k1qz#Vb|XBRew%%+l~6VrO(BpgSkZ-j>3T4P2=eis%{G&8VU+?#9TP
zg}XEvTp9}+a~ZHJXV%9Mz0zQ<mBM)=2yJe|^m%N_M(Hu{7;}TwET>0K*d#B!zM76;
z8fb}}s?`25l+yXDRGQKJgK7RKyS5yOVGwqugggrOzu4OQu@cbHtS^A7v?Um9^XIt5
z?QRQ~_+?4c9$KnN6Pae6=lse{==W^5ABPk<IU_o*tIbSG1#~lMU9QwKiA+Q3Fsd)Q
zHf`^kS?QD$CZx3#2`RuU&1pOo>g7znGm|}^OF0w$@x56`D;I3Coxz6y^m!Lad}CCz
zj&Lb(o)``;edWIcu)jy2Hc5vOr2yj!C>r5Xc-4q5iuTkpi3TZd(l>$W<auGUDZ_Oe
zr6MH<1$o2SiG4bSW+|cV^Ii`nOy<iVN3cWu&>s^Sq3sEn3N6`2(GXssR^;PLjN&g9
zc_^_@)q^@9CKn2hHx7UTU#%`vng`jKjs`ne;x^jzP-54{s1p`Xnh}wbQ!_?Lv5QSU
z5LM8l2qoi<-4w~LpkvFd83Le1!+E?&l(?;<d$xdKtq^C}JwaJO?o;hwnldT0!kghp
zlM;_jXZU_kDLQ*AycxW~6`T{&>eT-g`tws~$prq$;N%{q?0#M9{AKX=L)n>JF%W|=
zv?UvFasQ2lpIicD4r+imkFhbEq-Z-#?Kh#>-z&O|l{RiEn+6sZXMitxSVo=PcBLFU
zO7p~eg7m`FG!fkJ*Sm@?Zs~xWXStOwo#1B~PwCfZqQearA)8q6qm_R@73`}eW|<EC
z{dKEo^UjL=R|e;nm}Nfon8Cc}C3e-HyUG;8BC`xd*#)jeuK9=C&y+|XiDk@#0;Iys
z3_Nuys0M*Y-A%{2yx#{l;N};Ok=-GEa~#XRI;|0R#5uh{JQM;xvy^aNPX*i`2!&Pv
zqO!MbfmR0OC_*I{A;`KRe-)g#h0PfHwLo216`BP_)D+C5S-gpBQ1DHEVlSk(Rkv9=
z&`F)?d`63F66xsBl?X3I%aLv(s5sc8&OB9@t4+zY<@|#EXV?$!`h#v<l268?zMPVA
z|7^qLI4lL?ku`JOeG8bc*GSfCRd5yCiQ#u_R6RU@^}x0YvbDD+IUp&<ul1(v46-Z+
zK_GY~B@*)Qf3cxl{23&(=nLc}8bP70MgkL=DjqNdr&Y}w(j=7%i*18qmdcGr?-*_+
z@?4c`nCB!cWj^`xzfk5c+g*5W^<Uz&lNpsBFhZu6fmUX5RkOkC+V~5ui>%deK1)w7
z1x^qTRFQq_+*(qaL&2lifsD!6kQ=`V6mJ4@IuFu{z`+jprHI>cl`-l=-GX+7vfch8
zf@z+B%DS#@OEdC_bbq!t;A+B=DSdn#2+fS=j;;OlPP&{!+PGE03-lcvpJ@=Sj<}y=
zN=u|tDNr0c3NG|TS0`yGtNIYU3_L98w4);&FW$aFaoQ>$X60B%z{dIja%sb@bj{4|
zf8St5GiX)fvhNlk_z&9P_VWEoB(55lotEy+?;=li(+XF939r39cY|t-;aQxZl1I6o
zY!wJYmoxJZcgi-9vrXDm$`h3cgR0W+&7XWS3N_KlQqIhk2xA!RxjkVN(OWc@f<_U#
z0C^tZEmpoc%#U_SH<T0ESL*UZ*}2{z5W_Hdr6xVvyZsj<-~Drggv<a@DKt;p=?y|F
zVkoeMeYC;mp8=?&72n$`IF^br1#<8os4LKI`v1ZD_ESx>X`9~+NL3ecaKtxL!7T%Z
z5RSM^v)%E`-L3nOhgZo2lx_Hb<=IxR{=+)81U{OXteCEp5J*6b_CI!z;<;2yd%*+0
zk*Gqswuu!w&w5FHmu%#GKrv5<+vhmQyO2jUGth+Ol98P6@p?LS(jGDqVnkie8IP1#
zuN<92E5wE9zu4&uR=>B09!Etr_dx_)Z*%v<5Tx<QhU4V+!F;It>0z@uvezvLTHPDP
zx1g~b2=Mb>s-8TP*$As=p)xS6<*6`OpYrhMlx$lLRq-tYgvWJLpT&!QZCB!8UsEwI
z1Nph6L9`yE^IL`Pz%o-oE(y#Gjv5S^)9{*>;kJR79Fe@dqD=m1wm6xhfLzcxK&GS4
ze9ybR@^nru5SIkN#z=(eLUae>Y%VX;N(YQr0P!jtpo!XS;g6^OQg%j35`-WOy^?6#
z>isXaJii86t2!637)NP>A&D!ukWcq8pgGV68UK^@l(I2!Tq<&#h}%tiTPKT6Ds=<J
z#X24)442~$^(o-{!m$stu~gYKC9rHZ(UJbaaX92Ym`^bvX>cXdC09fa>S49y7jb&b
zr88Pr68E|(_6PM4j&YR!c&XqZz|(4e5T44EYdx%%D&9gbW^MRt_7B^AUpY2CQ6_Bo
zius<GnrOk@lzYDF(FxwP5lHk|#=R(nrMhA>1`~Dch2}zHqvrQ<<#0!<B}2Xv?M9N6
zrOJtesl<J4#=J%8YplpH!*0tQ#v)xjQq`zrxxjES^eAkA0=GGJO3hNMaz&DvA*I{7
zzhh;{Cb15Fos~}Hr!dM|iSkSa{P&OQ<KNUQ8}y@{{o&`gV5Q_0C*6TDF+6o#RI|pd
z@}}N`n-XWh5s=q(oyhyQ!0(&VB5K2&0{QwEfvJ{fKcr20?pz!x#(R_VRl<n{<{xF(
zal<eS16LA@RrX&jJRu*E7T{aJP#lZ(3iR$R{vx<7_|TQn$lMXrdI1#=Mut)LNEP*9
zAm!Fh3^gn<;a{V&Wis-YrHoLLCGd)Dy1z#t#11Pj3Msu{lk1%2Vbmq;v`PYVbj$|%
z;U1}`m<i})j;JRv794<O-r$4qGMi>FUMAPQ9rfcqbpX+sY<LGmf~zF!e3-Bzi9p){
zZjWdkw|}lm-e!Qomar)x#}9|CN%Z`qv_-1SF3(PTr09*KmxHr(d>hdblq9ay8_zYQ
z1A*pSN;|S-J~(xg<(|om84#K#UoyB`qTFr3t<*%`m3ekXtUM7W1qzO`lR`#PFkf8q
zLK+L~x@g5A?A41GlIUP=vtDl;L!+=0p91!qV}$?(O7)lBC=+fq4Kmk=@(2<<ee+J|
zml4PP;3q!_l}D80Yr!wr>uqLY`GHeu5Ss>0utDG3>!TSz4Lg7;(EPwC9lYmW1VcMx
z0%Cf-Z2vLIkFs++k{AYoU`m$IGylYn_Rki`-rGq)Wy=VG8JgdgvBdO*dT5hAmFtk3
zSA`sFNsw|Qx=>g%ci|jKRLWAmn58LzICf~EmmNO`+Eje6#dwjL51aw;cEgSYsw#zY
zvzVKqjdwHHD3tnf8%s{jV(G4Uj_PI#c;SO}|9Bl`I}$3QGa+JZi1<L?&qR1AHk?E&
zegn}L*<oWtFg_|lN=J!B(F((e3Phj6^y~64du&L?y`!1Xqqu7y(?7+ve{vbGyAtUw
zXz$_NEx6%XL8$z=v^4H$(AVqsx9-Hd{J-$~1IH2q#|06{qAT>F@S&_6Pb2d1NeJ(r
zr2F-nTUnLOco&RGul_}!Qk8X5>w%vv&rug+Q+t+Jm8zhXEg@NGZyZRt?&R=nu2L?K
zL}c;R(C^#2C8-Yzm8JxNEma3RZHG8LQ6#jdTAd;+vVMr7-J%);NZRh>3@4Nw?<vHj
zO#-Sp!O+7LH$^XL5zXS~*DVErZY`I^h5sl!gJg+85QttW5k+(Vi+x_Q8DvuPdoxQb
zWd;LC_hUzt<Zb5|fnFN%FLv6rewFO?PzEb453U@K<s4jU4*F8lG=<}4d2odU1K=wK
zS*+gwwf6gS`)iNqRN8zt@(rCobm#?k)K_V*OOKeN5GzosnF}SXm1$_Dn{0VdrHzSU
zC(d|-#Y=okN2h0sSi5N?jt+Jl`}F6jt(=F%8Z^u}G5{`A*q2G)=52JvFfWaqc94%(
zWt(E?VHsWo9kt!?ipVBvBgm9{MceR27*KVbXb*sg73Hktw7wb2BObs4|8V@A_SY!g
z8(B7H!BdA)kBY1pC~a3_aibS41TpP)$e49#)1-uXqZfH!m;o7-*R$k>eM#Gqc(*v8
zUGcL{?xc$3Un)}5;0lTrbcqNP;`M&{&MJq~{ES5mQ75|pD6HGqWr>OlmCesU^ji^f
zO_F=yR^>WE>X1xJFl3Abq85(qz#h@}&wYMhIeX_qMwm27B5J<0UKDc$OU5i1oA@7P
z=aK_448qVWrTLQkUu<}hMk7iqjdxvDRg!`M$94#YExBjzyoHLKK#T50n?4ca;enz+
zLifrbutonOI3JyR*w~1rIBil22%HtnBjM7a2<>a0{m!K~2mc~M9cb4N$;?orDFf#g
z87sbT4x|m0vXaFWnp9^8%F0!a$-r=c-G5%*-}5ZBBqLwN!zZ$|FfFavUu*IH#euIv
zN-q@MWv+Z*bxMDCpsQfGfMXi+b#-Sua;39waokYw5Lq5M=FxLn$(Caj>9gN)Xi>y}
z+Kr)7k-~#}>!@+$47HU@?#=G?;H0P;#!zIfe|%8iUwx|vx!jKRQm6krleC=FWe8F%
zV|R2%4BJ^p=vgjHITJyNWk3(|!spypeCVB3#T%jpDHi6i;{<(wnh*RGQ{X_*VwuHr
zZMBLIZ@&@{wJoi54?v@Odh+1ZkuJI(jB*up6y;bJ!t7ULz0=9-QX4UnRUB<mR(iIE
z9&1^IUHKKGAd3gL0mI(vQIg5^wkb97whv`zl*2#>0?{kEE~wo9Vx6%c?MOCRzMB}s
zT0n$(|K=cvox>b6mS+dL?$Vi-07(BiIrU9pGJj#{r*%!+R}lXA{$dx|5F_&VTcv;6
zq<w`A$kb~fDv6^rekK})T8}Bx$a%r^;fCxPUNyIJRrai!)qJYGiFs#LCRJmi(k*NU
z(TJ#m4MJV14jh%nHdApH_<c6`jkZ=8C*WUf`Pmxd+;TUT8aD(WW#w^KmR6b(ry^nO
zIr_p+?Tta6mp+tPcEy<aVsJeB)K2lz!PD8<4ZOnN+$Ng|U(lH!_pG8U4S|Z3t3lHC
zBnk9P5UjGcHoGuju^R_j#yU6cm9nU*EKB2i9V}vtl)taq(Sf@vycL)Vvmh)XuHcq3
zJ51hN>LY4VGKqvlT&^aAjL-gql>HX2_zw|g!J#807qJ!_zOI}gM9JDi5`;l*X)0(m
zKbaPzB4lKOG;&J+6B^<ZnL=Xt;6mV)Z>S&#BnYv`0T5;QcAU&naeJ!XVnj;@by4}u
zxH874koKBtx7?c>jQc$6N>{qbDxvv9*|{YN41z%LN<Kj2{V%q(`?E-_4HvMi7zJ_Y
z`FH5*>y5yl(HBh^9pAplee8Bv=II7`kAXQ_h~+gyHW$xs(N!>Pw2a^Odkg95tf^@q
zaS>9ivcAny$q>w+mYKC4mU$Mwgl5Xh4gcicXG%Zf-Hit9FR^GaERx07rgwkv``A7<
zLR^)Bl)UXS?}smPAKJgqFX~|pVjxBJu#lNbirlp^nPyV)+L&f{WZec>sM(@nb7ot2
z9|s5T<@1+m*dxR)^Nc568PhkgRIt~Xv<lV_L*HlZF}cfrF*xiKGqe|GV9A_DP8%b5
z8DWi$tBi!>xo4UJ#A#z>@y1JBfu#^zpK3;2F8yyDw7hGs-4$$k?}|ME85p*7XWw84
zCyv_|tkkx5xO6_LIXn9XOP@FW-;TPchQp%gme6^MHJxO2vR!2YxU?kd5#j|g1t?Q{
zAYq_#sxMNq%q?6_Sq#R3I_NgG(O=Z2nX;XDX-vT)0i(6;MjBzfn$hIT!E}KSK6s%m
zw58ATL)n=nK?s9D^h!e{Cf@&I!{e_-tK<SPr6IEPGVXKE&bRa%Fq^Y(XJldP<OEhD
z*4f&*gd_?8w4x^_CF_$K;rq%GksBr2C<PKfT~OJp)t(Tc7eq})I(^f9J?aUx&Xw&F
zl5yuzXkEBEpVbMVGhlI-klc&9CEi0is(jn@>(Wzv{^)xovj&&)D*BU7w%?aFWqzK?
z=0h0afyXpDNMD~~sxnZT8n~CmBkp3*9iW7Z=F2!RhEDR4?Hc80r_bvGoEeyKMDB&E
zb!@(5>1M5$AuUrZT9SW)Y+NBQ%+?1~!IycZ+XsX2`H0`|<aUCiu?<TMa1}tgRc$jm
z1+y3%G2aBNoz+&6Z0?MzT|hLp!Jm5M3d8U%sFBjyvS4T|{s>^Hz%fLO7aT)xWsSk8
zHY3omxA+~^G09q0mKqxYnuV(v36odM?=?EVa#4SY9MW>Iw*edY12w-BhN}JoJ%FC3
zL4^Ai%X4e#zqshX#KFVoI+DFj8D6T+&nd#6vNJk@7zBZ6OK23a|Hi`dw?St@1CGZ<
z1zq08$lPh$;i4gi*L6LZz?aA}L%C@J&zw+|LU%q7+jJ!!R2iBdE-GOkJ_B3#=YPD<
zn$b&e{uAKI75BZVkFk<^kcdWBz~p;)E?9m>Y$dGGVE#*s{y;Nd98+hChgG)IFa8BW
z34vhFcC*8psbn8afDu$&OJJ;`DD{&WWCdtFm;r-3SESY+lx5$(m7_)NebTfTH+UB4
zN!&v;e|eR)$TFG-FiHdXW+nsbp`|F3h{m@%z>FXnlqXNPa!ElNn&w3pK4U++6xr$i
zVS9KVnHWq8I5NoLp81~cOA7;&ga-1}Iag4rkgca=slve@jD7KRap3|%{S<GRb6zTM
zNk#L(qt{D0h4xPN59Z4~7@U*Nwj{Vtvwux1SEW657^~RerYj!gP;~zZ@qJ)6fbYl}
z1H824`A62d4^0_q57icAeJEV@@MTo;8CKNv4J$XeR{9UvJ6Bn~k{Z~DK?sbbHnXt2
zPU1UyA9^Xfl4OfP5O^h(LAn3Mes^|4Qtz|Pg0d(Pj6M8Zc4TxdJtrv|jJ#Ck{>~YC
z3%)F&n<7Q`58Z&v(a}-i)5tQ{l&<lI(?WhlCI59cV0=q}N-Iu!Fg!9W#A%U@B-EL|
z14z-(Y{<dGbMUWE%;F5!tH4O|*NA%59?3wh3PaHm#@DzhPBD#bm5iIQb~Qq7ZHgPy
z=7tV4sA8ui&*x>UbOw#v+=#eF7ZQ)j<T;v^_xEn4B$ALF)p}@r>lnVu^GbB~ppEp5
zzxf6*#CRh@C-8sd<U96Vgmi}{HxCyKbn%xvt*lP)`<Llilayp^^6mb1R(JHd>;}~+
z4Rs%pcS6Jqe0O(l%r+9S9$zpjp}*`|pzfVNKz5^Qs91@uw|H4TQfl&a<|VsPH47^x
zBzVwkvLgRqSN$D2b1X1?*je<Mv=_dYw^Ds~#Rw(F1D$tfPCfRXbpqc7iB7)w(qMF%
zk}4t9S#yHbAQ3)^=R)t=E-y9HDfXG(Fi<A`N7=O<F${ySl?pM&-hZ)5?iY~s!UCK_
z4CWz(&_CgA<RpI)-a2_ALW2<+oGStxPCM63pmR$Sw1z|F2u6Qo-m5IKlomUjMRplu
z%YBiE+Yp~!yDDXMWJjnQ93S&U+9Pgftp{}m`Ye*m99n2+zAuY3#<@r5t&0+@(xwum
z$5tA>YlhhP>^usRCZ7mIBaa3<Yz0rEEoK>u2pjkhjxPI9mT$EF$qvo8MTia0tv@;#
zI>TIz>?lMNX)oIhTwCs&&8U**j?S4Q>XeMV>$8!O4pQCO8+|+<J3f)nGag|2LF9RM
zvl*~s?umTnbh-vni*mQoK*rV4N!$=`*T+degTMjiUP+V8I<nI{Iaz9uIZasw$nj+d
zOJ@;bBgjk@A8rdtQ)MjQtw>5E=FRadSwZCnHF=}zXTcHh21m^x&Cb54lHXa&_g!gA
z{3aoqvp-M}@vB2eW08(#tdo#BDMVpSH&?GETjQb*c6T=H1|CG@jpS!_q%HAW72qVX
zI>eU#Z~y6+vU9Ov7=(f7N{xg0?7vw3qDql%qQ(oLs09P&?%v;_TS!2#9UbHRKy{O;
zEtQc&@ES-sn<7d8X?sH!eIB_-il)_TTQM@O4As05R90e0qtVMfX_I@f%CnHJG^=Nb
z9JbB2AF}Kah{a*PAfi5x9oT{PV~>SayI=VN=_pdMcWad1*aTt6J%N+mHRBHSsub)X
zyg|cBK)l#Jl0I;1WK@{M8ihCbUK$drer(!Xv(hC|FT6QFs5|XM(mOBmiKnQQ`>EI6
zz~-~R5cWnND_gOT%FBi}jnG4!6QCyKlY{T1^w~~!W4A}eQ?jrWZfdJm%9PXH5I@1Y
zJj9=+skBxgvFcPeGD(Qy#Mfj)tvW01DD|ov+hG>O$v*p!-yCQjl{Mp3H$qAfB&$ms
zv+283L|N)oH^Ole=ifR&-EU@I<y!4jH-g3$3k=z6$vaWn)1&HU@dPm%PQ~?tKJxs%
z&Lez+?E=F}z)>oB6+M=E#SNKt_<|=LW7+)1rEl(@m?B@w&LxLo5C)=GN&xe@|HV3w
zMJwY*ikI0$C;?-`^US=q;a2G-F2Ky%_P~v@FkDzM3IDkpfA#${3;V!r#^hUq0;<w@
zWe)oMW_P`)QC+0z2D2Ru95W+!v<=O?9K_9S!ul^ZXF`U<Z3>#ofU`yOIbQQ<kt8lI
z&EYnvgku@jw4+>6qHAPW3Of{Qwsa(_Ml@H(Uzmz>2X0d#+a{{Oz)e9KBIA5#-fd|r
zT=Z*iQ(X@$q)R<DLmY3@=;mV3bdjvc^`{QAJZ_`y8N)XObrz+6J5R1t|Iufs3e2zx
z1tr2331}Os+2?qhxuD;aSr1LXm~`BwXHIU0Pfm?C(~cFOVrqRe>c=lKjy^@~JCyq(
z2Wz35aAo*=^S}+a=g6NC`}!SOo{Y?g9lVXvynbQBsY1YllzPqdliT6B)RoC_pTxBi
z1*5$&#CRUK9p%wjcps>YhLH)c&IHzRRE%{sC3)H#Rc_4a1$(DT=;13ytU(m_>a5!w
z;t%MWnuGI@>r_oMaKOX?Axh1Jzxko;T#pzAVHmtp06Uod7pufSW7?}0$mK!+Kjcq8
zpS=p3*J!woTskWK5P6-l<s+AH2*;sJay_vx;c}TNr(hga999iEz=@C~E)q`#QRs10
zaaf9*gkVv>e6hGtf~Xir!PdDkv6!8DUHhZ3_5HQ&?5mT`k9?67q<P*9OA0D8)28A7
zdpHQ`qd-YRF%I-B$7wi8u+Lcx=KR!U8I?_W0B&Y%3%(6v_ff`(L#pFsISxm?a1pbX
zJfAvT7hQVo+~OdRpQLP3T5lzNMQ7kykArgr&!o-5v{}Ek^6zCej<bi<*&C#lSvmjQ
zlpsFaFWDjhBWCP{EaV);3(d1S$LOKOPtq1L=~B#hsRxm@IfIw`WEyP@jmz9#Q&a$1
znqy22kWR+753ESDS6an4W7yVMq~`>Ec&Y)5f)etCxak%Mq)35SG_<?SJ}5nz?8rnJ
zIKpp3For<;h@*zoq*@1A1K)whggu^i4l=rej(aoVhFW~&=KLR#K*lA@6Jp^v8#G~&
z+J~}h%YhgKfmaey(EDF(XPWE>Qj>B4Vyw!e^T3O`A5xFLkiaVhbBq2=Y8*CDF9tP~
zeq8rGwjLboiSLNk7bh=4*`y*{Xl+F8S~|Sar3G8=XTr5g+<Eum&`O*`^1HDd6(*7)
zS<2Z;hasBM)8O)P8fp|Y$REr~+Zt*6N=G513J)r=p8C0pEw&x#8(d=wg(5E7MN6&u
zV_o|>_<_H9=9^5d>@he@PG_y~g4%(<A>))D#)DvKOCZ5j0o$3JcsP`#=yNG<CRu}F
zmk!DSzu6nRvIyd%FqVHImfV*eW~f5y0MaYk{_bz@QRM~(WgGt6A3|+C)aW#iO%t5u
zmDo}4jU#ZuA)(yhl5A+&E1^A3XmP%&P>zB%YrR#7_a@;=nmdgbXemEPAv>v@x=Z^J
z6~L(y$srEXx4-;x=oL<#^{a(irJ1!JsEXQ9)RJA)RI(!Lsu+4(4~ft53^_4-oV3gg
z<8EVCVr!&s+9p_?!&#jl)_mWM|GoQBb|y&@gD?>MlCgz=|9`BNj=l)d6H_PO2nUNc
zMCJE#l4uCN$MRXJJJY0z&e`C6Ek5N(-1csUlnuPK*T7Mx{d7<)JhaO%X_MtXRF7jg
zkas|JY*mqtsr+`n!HB$s^7n(9%c|vXQ+|473pXOoM5HgA!Bc$IqonknL~XeG9m6KE
zX?zb;t!%xdYQr+!bWfOB{|D6d_o(R*5+%{a?$2xT%iFo85E6Z-J@p>*K+O?_<ijIY
zWp`|}r+JSzeI=hi&a@J5Y`iDfKHv>vYrwF(cfA2+<O~sw!yV?-BK_g!@2ZaKmX<Qd
zr4jQso=~hXef5F10*mn-_7qmB^RAFm{(&TQDRKs$VNY#zv`MKa@vi)^lFD(ktTBZu
zx4$K&2ue#NvxL;!t!=ci23>Q8p9xn`pbv^4*m`T)i1UIxfDc060xMER{>eCOO_Aht
z%lC(Haw6?pNJY;>6RSd}^rT*MHF&MW`>zOYRoIej#*TqPC$2}P7=ilLOC{!SCASY{
zXK=+Z48qV|IsvhRV)kFG$TvfB&;ovau0u>D^y|`3rNnTqeozaxP6o%E%8nGMsIm0l
z;X%AqPdQSe(oir^JJ^z6Oh~J&&ITyz4gB-^DK(ab_B8SkfDs?Ly%zoUG8LjG3hs%c
zIW*hm2CTSx=Gst_(NKs_40z()+4h0H#A=O@w&j#1NK2w>z;qz*NiFZc{QIvvd^9YK
zar-1Mx`GtPRKAqsaMA1!*~W&6WYp$IG-=`E)tA?zb@5uB&oCX+Ep1af$m?_!&3voU
zx04Uy3%*6_CQd6&-b87&b&`%(6U3Bo0l=!dNw|{lF+y}`pj7;EK9L(%vUY+L)_OU5
ziVzMI{XQm#y=l8;)6yBgN)!N4#-W(lMJ6f5gAP!TniUk8(6h5*P?g2-$2*L`q{WMX
zpGT5x!DnNSdnGX?@D(V7!?_?0_PJSizR$a$>`IwJF@0xg$_`*|lI->L#Z9?57GsUm
z|ITCwmhW-*ZBhKIKqX>O6WWj)rv1n7PuaEQKn#MwD=8}I{V%o*`_TY)vmBtLNwLZ}
zkGSm=N=s&aGyZo?H=VP3R&Q2Tz61sT)D7M8rw=_OhF|g9@0BTLglwHFkfOG!&)dSU
z05*YL)8YJ~W5$NP{e`_bTBQvGy+)sABm)kDAA7>tsNz4y;)g}SNBnZf^yr>Ztcnc}
ziys%40qt`l+HvRX!BuKP3HLV;6534nNEm)bz`s|HuKY)23A{kg?1?Q)C6HIVzZ4@!
zz+A6&!0mq#7hg;7;0112$bogM>`UfZ<ua8$ug09|pkD$F{L<S*rP}1*Tl)@ov`v3j
zE2{%qX*%${8bY$iF|Hm)(bRqw2+q@Ly6!i~>0D;ooeeIjV)(|MRs$j0APcY4(@6xZ
zE80yCyc&?p#d5EiIYBqISN1Tf&ii8{3%s3qfx@ZQ*j~;*hVEccdg#~WT)Bd-cv21Q
zKIcNd!k&~QZmq%uVo#~*@Xg1ii=Njw(c()JUog1YxW-wlLp`GB?i}3E-j?ErvNKA8
z7zAPHmBiYj_rKUC?iXNZnhP*pU0RU%atxkqGMtbw^iG{_kHxNYN(T%HdP4}(q&Dwv
z+Xt<V<&+jDL2s~u1c{=*v9%6LlCA(LpD3-dK`*xljkXb!TN@~;+KKj2Mo0y6673*6
zz%ox%wld-u`$KNN(Z}uJ=_;+pjM96Ss(39?u{bM4txIZ;D6L^}Lyac6fCLifT@*6i
zleUIg&N_iS!&$){$5GvTY)e<P+a&)J)dKJ2<pT#nD(jJTL+m>>)dT^Jc0k>%ro@h)
z#>?+*n~tQf^X98}C31p;FZ95O(Ej|sgWN%h{i?2!5X9aJZE7PvX<dP$VU=;^P@d5f
zd(x0_cyXgGwGY4j{h5=I_oO-OWg7{Vp_WUT>UdPvU<qhVh{PaMWPK@<UL#waU+lIS
ze}*meJG?uUv9L$CDAdr*jD63Ri(QT<l{>s{VXD}v!x(L#T<5jeL&57x>@Za{-Yi0O
zKw8*gKrnA<NusEYrf|lRbkOJ{KK75YYsq3D1YuWF{Gj*0SQEQw5jVMjZ=RzFAtYzJ
zO<8+HW*6QrL}nr_W#l5j6!gjK)mEfJQRh$q>ZA3;ntuB&E$-1tW+Mnu%n+~a=*gyK
zOG{sUMH2A_+u~HbZ+S*t>2`U&5S&f37Nlddo?+zN+Exq;+)DhN)FO6HWEUiSkF%mQ
zJv?gLV0A_+gq2NBT`dnZWGSoL?LJ`}Rl#|9A4d^8rGzYtP5(|dE0WaNsU|TVfQa<z
z;ev8f2PFYTJNH3Fa%5@Jw#O^lS=>=U%#0XXuB8<lT(@{f5mJ!e*jmR><e{LWK#Cq|
zI2@=ZOO5)<v)OGLr)VL$U1-keH0NvV+#nNPxngo9ABjwy!dhd}7{)uPIQg(B!Mt5C
zD;uYH^N(R>AwelqtChpjE}#`(PfC@eW||2fHpQ{T11E=$Ijoizv#XMNH%oCn^}xuX
zUik5{S<S{Ck0Ypr+d#-UK22<pu~7Y*tp+}XR3HR84kdbRGL7mq&3t^caw!8J=MW6A
zA)BJe51SSHA6EHLb~Z^CgCG#T(UbuRdjE?J&1$-cHL`h2%km}sn2+xN|3q?Ig!nHW
zJxpf!sMm?D-h)l1ka_G)ZF#7Tl%&}qeVkw%Q%G7pGpW1r@kOP>{yMQZQ`4Rgk`gGv
zt1VIIRU{S%nH`ET8s+!=C^lOkJ$wpV{5)&LPb8W$+-e<|&;O!0KY%4H%C*-puJSRt
zGdf)_!8y>^kH9B+EwXQ{a?V>OTPYpb^BX<306&+TEuWWu$(a;zW1Kbo=bsA2Nh^4e
zz>Ud9X}mF%0lB?$Y1?66osFgT#*kaYC9rmd!C&4wkIhc4fZ-6G)_{G)jZ^D!X*QOM
z^N43z4C54$jQzq?@4WIuv2-|^1dl2TPBC(G(&we=Erj3?d|W)ON$Wk%Xq|_0R006I
z(-=y%+^WiK;08`QH&Z4UV6@p!9q5;il$sNtGa*$0aVAaY%a5$p3DQL97^>fiYR^&_
zq%Pg5QHjyf<j-*(8d1sR#=!8rFujM-ZA7n~0^h!>L4b4w+T7UTZD4{2N_#qfDLbPa
z06`drUI|bb-2Y;>_*KBfUVs<_V{F~)AxvKmC?y1Ub5l)3#|yksbE$u_gU{a~up6=x
z2y7zmsHem3sMgYY4$}l<(aR=Q_m*y*6mgciu#;=2yd~piS<OkE)<X#A=0g5PjV_)p
zcf^6e?d&<h+^`$pUt^Iz_5{qTtP101vK={j)i_R(|GD#hFD=u;9f64V_h18k&q#}-
zmI?8cV)9i<Ul@pZc^k|wEm=#8MvlxD>LL>3$Nk5j?{i_5;o$fMISGS91gl{}b%^qz
z5}b>oXjW*_G$cCsLOM}HML5_ScqFrXNsIXPqa7Jb#L~~8SqUzhK_iK=vj&_k9Sgd@
zv3=BN)`8@1r*k^TP{lW_sN%kw1vs*+x2aRB*0iu~a9-$H+h3YSI~*7%NmsTF#~))}
z>;!xr3gp#!!>ItLAS#VXQ%kIYZYx{AL>vC(6CqGHWT$NxqKCud36<X<@YP&0^1Oz%
z4<iNDIgl#9d6j&O)$HQcKR@K~)emLolEW|z0?{kQp9K5<7c0;0W{e{hby*3eDi#nA
z^L~+)?}q!9H_e0fskq>qssn<TYD?$ieT{#3^&E2VNrjdH5kz14+GAlGxihgcc4VfA
zsfyMU4aCxw9eigpsW(JA&TIiAX1QZML6e?Jyp5z$CM5diN2b-o7HY=W+*EqgFA@e|
zT4CBh{EL~oxQTCU4FRl@JtrZ-l@XiRMwo)p3TNDZd<o|zV?1aozv<R+mx2<;wL`2j
znR2e;8}`9H@wj`qcctXfGx$BO+AtbW$5F=3=ouBvHFedkx*M-rH?KD_{%O&uX=d1@
zrm7pDF0g!O_YAa?GhiyV5;WM9>Ff)k>^T&#jLV)WY^vYOXy1?-_qZ}TGsXs{tf}RI
zN7DzABI3(SikV}|ngY5$r$_Laz#HNJq$Y2%hq9&?@W`XG*KP5lA+s?$RC+^8j2#14
z(=~31cr{KO^&z%46_>{WRMqeTjgY#YdFrOFN6i}?jGFl7kbN`r&@wO<U^zY{fm5kl
z)%{R*t~U&XFbrO)JPw@w7i&KLg<Pd(0aS4moY=9C%&AqDj`54jm^|4J{-F6GP-Q#T
zl~8J4c{v7I#D27Yw&VBGQ3Z#g3v?@);4cq)udJ*~#DRx5vqFyHGm<R*TLPu%ko7@Y
zyfK%s7n*e!h!;gU4i>+DiHHfJote2^q0bc6I9%1X;4noOBSVGKmfUI_2fsK9wSl#M
z{)`n{M@5etssQ;#y&1+yUj3CyS214dLkfycE$Zic&f9pgq&rcJmpaqtv>_>H(9b7~
zQ{lALE^V9%d4<uKL_0tJ*p%NtJo5a88~*I}Fn2Q2F|k!TC6VdhByM42%_x}i8`dkf
zkqSmP!$H}^wa;J3Hd8vAsX+cI2ywdBnMgVVeJew#%JhwTY@{B4`iWnu!;y4F?aJ-f
zV<s`(dp)$nca9XXN{3cKeRJH%y$tua%VCaQKH*bYdd6W@FF5>s81`HV^i_x>1=$UO
zSXgAAuIIju7c2H73W^)5ep(d+gN1u1Mnw>(BewZcc5X=)gCG#yQZ%5r|BVgD`N&00
zRoDPU-3N`(bU%v>G2|JBLt;IC#w`>27Z!1Xf+dJS7Pz)?R5SPzO{FSoH(Ee)&RBL>
z%&>~>US>D<q+)ty6B*m&CZnKck!0iVW>ggvs&zdXw)CEf9cMS=GQ1)bM^HV)PSw(=
zeAA|VAzFBdvu{H<E2*@D^4rCo@qp9x&!!CP{mhQlqUg;O0CL#k07+rZe@OW~bnH+$
z78OWRb{!@xHTNY(`wUMN{V8mqcU<A#E|aw_H(3C=BdvCm_U#|@9y_{&8-D3<6AIoA
zdkwJ+xX3cR!S={gH=cXrgKNZl;N`Wbh)SbJti5fUMay_3Sk$~hw69HdeeZ$mUQ<hE
zM_>{OsQ}D16*T;PR1YG1xx`nSH%N6l#H-&>`Qowl9$FXvVw1ai_GsXHudowAYDPiQ
zRxuo}Pc+@0Jx=O}!Ds5H(w7r=TGff@Jf|Psv&S|qgJpquQ>N3oS97SRb#Ep!n*x*g
zc+{&^@5|WQLB9O0+kcdu>yf}92!vbm5fJ-t>{#yp2xczZ0OJq|i1_WB>DNWeNrnSR
zd4{~I>iPnKem8t@;oQ~1nSnNn7QqWf`p!;Wsj(L>bTP)=F2ka;6Bh+0`8A_QqK3Q(
zc-eLC#;A2CF^!ISUw1YpC2s+5Oz|gD-gpj$mQcgBQvG!^P%)D;CZTt+e#J@!&goz1
zC+{myEDj75L)W{9O7W%Op?scL91t-8o@oOgRL?XI<?@|WtQ)ALc)|yg$i?MM#3xdY
z7nXi5?U-5^nhUBvCsVv8P!480vAeZ-;+duEvMJLUT(yQk+4_O<RM{w0`yxSdb{uY^
zzpuVqYHx%Yd$okgc_cuBUiL&s@qbL%yWu3IVM`Wv4${r#c+)7`XH<fdG4Swu<40)q
zSSF0Olg5q2(^{aQ(C(@Y9VWwTlG6Z*u7@P0Y5j~$Z!W=c#xo%z?q!uHn5xXf{R0yn
zXMk60apML-&Rs*2iS|Ut8O_tM+eWhpH=O;$!vEa;L)p3ASPa5Iw50??F#R{SKKZ)X
zMA~TpAp&M_=5ZK1oymc8Z~{&ORGs#qH1WO7+7}WQxcxnjX9a5t^}=_4&KnpNr8Tfn
zzYq6<V!Y#f^pstWW`mzVC>CnxS!&|Wlo}q3g46jJl*39oQ$|i|stHL8Yb86zs$EKa
zqW`dSuA*I$W|^%UC;nFfm7;_cb5oOco2N5~87A*Mw4cv`L~6=8@g#0s_A1~87!XCN
z|7YsoqqooHHO0Qscki2vl01;rL0aym;VBj7lqtpUbBa%VHoVaeFH)s#;VB-R+!rI%
zAaKE~{2nDo({}?L*n2R}TaU%El7)3%@9(kGp(C#frmo$+ntUqn=$(Ya9f-p)@U&(2
z*JIMaNnkvY8yO)7vw0<!DY8pn#Um~N2RSy}ChH)LmS(<+cG1CR_YCm+9Ek0TqQY19
ziEFV(76hHibyfalnj#hQmAW}Mksa-dvVY=h4aIuclMPP1G~VbHw#!R}{ay4w%FgY^
zp%4b56>W6E5O6{1zlHT-f7TeJxB=@b;boXPbM?C3zudcv=`zMTUK90mkc~^K_`jK1
zUnqiSvyFW;p5Er?Co)Mg1j^}gI1kBvD8#u!lNRTFW=-)x91OtHI)i3;;l?*U`g`ro
zUW}L&{;t@`=_KLJz+3g%r|3iS9u!`H)n%6@5_FxZUiRJnFT9A;S*eHXmy#*IA;wp8
z#||O-?s0eTnbNZD?pC*Ary475FWme|OZ2_^_~>x_J>+e}UVpxluHL`fJwl2SMT?H6
zYLP?w^vslgZzl<B!4`A@S6@9?az^GCaWfOo8i6`QWz3kRd#-)|a5pt&c}38>K<)~c
zbk>HXeiU^NH%n3vK?vt(7~6@JP@P7HcTPK<*a%sU@$gKYvE{3i=(Mu>4Af90Cq}Vc
z2DGS7p(9uYi4{Y5*5iex)XV^JxSSO!%o`%)-~+xog`H7{%OL@+6OLw0`XLV)++e1(
z+bqG74&G&lEhUkpS2C17b+8=da%zhc@msAOm=L#r@t3kIIRY32fh{G79Q`*I)*p&9
zp#feZ*B)i$bc_U}_Hm9m7Y*{UTVQF0P6R8E*bN|wsE6{)=kXpml}NB^BWI#}m=lYf
zqbce1Q%=tYosR$74NDQJ9!N(()U!m+Ac`LZ+j5-mtsu~J9v^MU0EKqHPFwyKr&@5Q
ze|5@m@)$&7^h1yNF0uMQ<gk0}yvUg#W-1gjM*-2P2}}3bGg~a<$`rGR=(6e6<BRI_
zI@zF#A)ll!tdEEun;h$GTRaQnKy(u55ws1!)*O|FI$czj#=&|LH*yCiR11HHjyRiV
zxDMmEIic_zHB7k>W$&bXhU*aME^xC4gk%;+CTSe@eC*suN2&^F(_HbEI+ZK~b_nuJ
z(LGKw(t|QhoeijuOn!{_tV&BOaw%N=aY(zz-W=lq28sz@h0Vqvp~!pWxigmpD3uuc
z>?uTBd$A>zc3fzI^D~wA%=OM6l>j@?zJqTb_{XG0Nzhj4R3o8b$ZPxla$&bJsFgB_
zglw;kkFs+~Vi*L$@RedD818?u^0kXr&`wx%*I}Fl4dDOqjtLi#m9_Aa*tQKVvmgg5
z=>Ue6`{c}bsl3BU7N>by@I&fd^Xy$p)tSuBjUDC0=AQyTNcwr?1gY#r3G5EIMQS=&
z_kxmA>1QTo9O`#ZJwK`;E%j$Ow0-EA-GMZTAF1%qGFC!LgMeRcoYZ3!PR{_z8Slv%
z*XRB{JT!5oD`JQ?J5;p`=E<N?Z-6f{!JxE1BIo#`3q9Th30w3=l>+sezl3l}#S`$7
z{`H>yOLW|>dbX`<<S>1gZ#-37q_I_EpW*gZ7_5wrcS|;))`|q81z-*!YT??$yZdjT
zzi^2CvV&z6PL19vj)A1*;tsR4O9CthQz_4QkaD2)7Z{OJ@G!vfiXVmW51uGJ@VnHF
z22>8>C-^IRGXT~oS9(&)lpuLbsb>^vUb4%A99HpGv;fQLrYFv0>gP09A?Fh$)HZm8
z<uo)3>HWRyxU)r$N-1~%<}g)-1azP~em{7d{+}0RXOJX82m-+`X{)XL|6@yf6YQ9+
zh&g-cK@>@<K2|;s#!C3nLnv>(HTIg)w6Q}Zr{K^BW3U0h5#QpZjd`f#;J*Pj<HauT
zw(|m9NFU@B=xEy^40L~y^s>9G5`ZU{1F+@?f>)0NvFS^fURipc1py{Ocyd#K^$U-z
zJR=6%Dr3gab1c1YPqDdC)1=ToPfJweY5ihHR&ql^$t8iysf@vUj@^=S&*l1L(&9C!
z&tPZYJ)QU^<u>P`gm>U_yc+ca$^Xnc{h)t;lXBk+2Z+_MuY0$^Cp!HpN|akqU~-W1
z-Ie1o22Jfh^w#&<!H{F%yw2f(Ny{Zk2{Ts~M04h<69s5Qruw?kThd1f(~sDy^w%%j
z!!Ia3*Bwm?!60<}c<nfSLo!}j6QbP|Em#Yv4ubDbLH6FZQEVENUCQM<z&bcF!r4#s
z5pj^uPufaCiL{Paz5Zk94e!o+>E<g>I_rrDMFj=Io~`&M%E7284q8BX(3VCcj9ycx
z)s#3z;ic=3vNOA37zV-cO1=`q{)?5*eW@W<!ve^%NI3i->Oee&GhZwr5M1q2U&KBi
z+)+OUEWO4mZNT)6mp(GZ&7*jbfkS%)T#S0P@OEn|wj+L6F`h6eFxj-h??Jgfm5dH6
zAnf`(%y8shLO;<<Dq9>_U|5E<foiS*3qkb0Xe1l<nR%^H=N2Fs0b9#itXY=(RqW%r
zwK|Z4{j<>4>=nmepDQEPzG>Sp+zS0-5~Icva9LNX<U2zvOb)IATy|PxSR<$;wV=`+
zCt#C_efxIPh+xJX%!se*2IE1bzO!t$Nwda%orTV%_vU7`#t|!Por~7`j&O4h?Rb)`
z0`H|z6<@_uWGq$j?Uf)^jG}N2jMNmsMjgt02?667AlR9Pb;0{(*eDLW0~iBvIpfrn
zICZxK1ob<5{GNLe0%f9yHlBXoJr&$RcSOMLD4%Kx2+UGbp&jDYK647D-40~Qhgz(e
z;Jb4N{xO1=wB@#Sa6Sbe{@Z$tyyNQ1%{!LG9=w`;#j5^<X47<teO$hNC_A?#hCvXD
z?x^D{KK8${dQ3kelv*~x%q1pKgnPb)iDsC+eQr_eu+k~@n@>vgh?l$8d_lTO2~uLw
z=GZRr!>l}e#P6m#{Gb2|u&_!<k_Vd{+IP#G`P!Af06+A}wVIECZRL-4oc4lBw753?
zt`X^G%H&Fi;N##jb*-}oT|cs`Dtq!#tml<o;`i1YhTbu@s5JPfbAEP7-w`<JW=LTG
z2xm)OlX#>zxnUl0<oWr+A+o7n%;L(2*mMGuy&^NP^AHq<e8q|@BSUV2D2rc<6EbR*
zhKP=gBt^dgsEEHkHHuh|k?n*$eR0lVOzi?g6<6yyUoBRJ9<cCe7eBIjYV6CH=`$#J
zi2FmixWWKg%*4^U0aYc(>dJ<k_6Gz%_dD}w6X1f#Y5(TQhdA(Y@kg<WI@JjJ%BZ<=
z(yZ0cT>5uIxX45T_Ggel(-F67OW%>Gh53wL=^GAz0b)(vZ_3W-h+z<hp(_E#3GBaE
z{qj}p(BcKS;DaD6Ar)Dp8F@c325(jnKprH-?n~j4r3x+3>tQ9i!;}C|XQCeB8ZM6+
ziyfBuPpkhc%v3#mvjyo(f23#jBMxh9rYh3?*oqv_J{<x(USKltQC>D4_T)_qmRv8-
z{Zdugv-c?kDYt)AGj+g(3+dIt=OHtHAMggsLAEdo1_bk9>>tygzBg&NH`+EARwj{`
zO##bAIfG2334{|C$ZuH*iJJ5kSyo#JN|b@vg&;UurI2O!*^8|bRZ?KCw4V&UFNbfa
z*f}~dDZZ^5r9{<W23z*NSD~cl?{=FM?wGckFLc2NU-)DG?v#U^A_}}=E?*-blfjqX
z&xXz*-g;OEj~3r>qyT1jJFt?u!0!#q+!q_G6vA8`ZK^hW3n~H$1h#(Y48qj)095QP
z?6NmHRCTC!3SsIRO>D?*VtZ5{3zvg|x7E;<pNH{6`g-3(MgHfbf7Rkc*_GHp41=(h
zt~5N|f3d@<PCY<r%K}J23OK>oDQ<k!LD|Qk=(W>evND-!flkhY2EWq;izI;*q1ubs
z>wIt`h=}cjydIepg^~{9OpF<9!@$83K4zTZ+}47doSjaOxs-nD9c?cnuX7O*=zfY>
z3{dt9y|@EGIYLl7Jm&o4*2@O-Chj^FlFh+sTKZso#1*!*AZTL9K=H(jg=cz708~%K
zMmmyojZ9)Y`I}ns)A%OzO-9m09xHGRCgRkvDGjiNK_g4X-w)6rB9uK4<Z`{E4g~!t
z$vlU-IliQy3P^P`jN9zAXnG92K7Cv>oKOgp3Gq%?2dN$WDe>AtL(BUUzJ_?{bKIM3
z#Cr!yF4h*I*7d1UFD>M$5qZK^3<5RY{x0dZU*Hbz)Y$hN6nfhe!6ef7Iqo_a8s~Ti
zF%*ojQRj8jvRVkWaA%^yfED1cRY(*<m$Vcj>cCE2!cJ<z&gc^bXebKxcJ+Qz2}bk+
zcYY~5vm}RM5QtvMMl1KfSa`}$fN_nf%C|};S{l)G|BM~jp&gomq8|2@F7sV~m5&e9
zP^92^Bf}_G(jhD*%o*4&9b%{@yVLMcoA1Vc4v0_scsd>!m$Hs`-gy<w8C;_5hQ_~0
zjwIpuf86JIc$&-IaUi6d+ESB!y_xcJI6TLNY-C;bn*(!`%w(-ZBeX5qAJ+_VcEEiq
zsYwZRdUgwhN};#y1UjYdQo@{(+ybRij<%BBB_m=usld+t_}U^Rkhz20#bKJ*${kDF
zAIqTxGlLw>fRLc<44j+dL0rL^L5^lYjj;{AAXBPD_NSDfW{{&9uwiZD^H4(W>&3L6
z1LFBBf-{z#&PvXgwWg#3H9dQ!uai5?#h%X2uu?*rUWR7jDov}wVckfq!%GQh1{E6o
zuKR75^gSs;rUG0AXll@gS_Zp$HEXg*Zoz0J@ToHr6L{{!D64BM#<mjnblepShQ%5^
z%8e;;bcd}3!`TMgiLazkN@8}UGHe?7L)jT6M-YNQ^hzQ+>isVko~e8YH50jjwe+|G
z+H`+Hu@0e#fg}B_6$SBmvF;lXQjSr<$pgBzdnkU7U}$g;gcLbV2MUuG1yi;XX>Xab
zQw|R(t6GrwZ8)+?)Pd5Pg5n&8;GF9WjF)W#<u|fs(0G4E*Hr9o@?muJ%(k~ySz&)^
zDtLd>se`*QOUw{|;}Ov^;d=sSVUSi~wnCo0S^EPM&)=NZk=gGZ19yZ#)zOwhW%*&J
zZC~?1^_QT`tckKy#M8yNpk1gukqE=b%v7EtjxE+!!Ay0cueIV<&Xk@aUW!e~Bv7W9
zp$cWbJ{e40+s8aQ&AT1<((Gt%|F8W4idSMokhwD-FSICEi@&21vS2gBaiZkeD3WnA
zptvLmOH(VCeTZe;Ed7DW>qEPaRQR5-iLDk?g9)c4Y`B>Te|h3X-?AhI>=Vh~nkhlW
z5n8Ml=~_{$l{viFqGk$EsZMIG?=JY)Qn2~|_FoJ?lwCm*#2^U!l9VX+{~ue@*^97l
z<pazVs|HNMNjd_<#m_pw_edzZ`^b+*dY96naTQ5H8PoWhW(Se?=?HsonqS(!hMh94
z+#5ivWF&08Nm?C$x`!N_xazHxk!|sZR{DO66bbhBI{BoOMrJjC<@>`^A7w5!`(xYc
zwWXW{|C50&VG|{ssX?t^oNwsJg)M;SS%M1E)b(9`(7wf?8|)gKMR2``-haHVElym6
z=36{==yP@yd!LZl;-q`EV=b=T$df@)!JC2GB5Z2OS3@m$5Bw)1VYAV`e@vl6yJ~9M
zqXa=0e;B$LHatZnF!4SLZl8=rrhq}=ZC9S0S@nn#^jyqg{Lf>hr$YK^ljLQH67UQp
z7e6m3c$%C%`c*M3u`9q6;nEx3E55r^+ovigq4ybqM3-|~hZ}c}YAPa70-gxEp=Ssc
z`+Iz;%?vhFfaf~TiHeOzb%I^lD-0#jx#zh2i1VTBjB*$VK_GgiRRQ(>7b|0vCLOxX
zPWo?BTi}T!^Y6=3gEKPf4Ccy#UPiHhGX*g3r@@#6lPqX~0U7Y*B;sD=8zvDZ30g*`
z%k%TYlepU7nL?PxLnjtIt6{s9S-wA6`hHKGPI(REsq*NXweQD_JChi*C|WL%8m@G<
z*Q&2TCP`WnBM=K~9N~V+5E5g4t6I=mX&B~<0nH`LONhymmIRA=&ItJ*?2O#50451q
zt}OrUEup>u0lXhB5vH?_IujYjM+NRVF-)pISp9xeNZAq%jn08&Y|eUp1v+U8OfHMd
zE$BHQm@Hc&A*bIWr%T95^IjUP+&f|qab3j2u0UsSowNMBr9EqxOy?4Gl9(lf5$z!B
zo+llKH<yr;q%4^#@J4$#3}5DVw+e0sdru&>^=V--Y9?|CIK$aiAPZld0I4rdB-|tm
zrjF~=y(a{4QJ*Hdf}G^Ql*jUo%g(h%o3)kvS^7oU8Kp4@!Z7$sh_vASFSZ1qmTrFL
z0=l84e<e-dEr^buU_Zk>So_C}*|4ZnW-v8`Gz-bG&4v*)`t~{4DPAwA8`?Ja3!Z+K
zt|W^(XYsY~jicA;F0OL8u$WVPUK*YL2kpO+tk|z5`8youRE-NKwFGO<;OFscy}9_q
znn*f4!36^;oP7>`mhv(jV4ND0sELzi++)n+#f2Y!wQ4+RB!L}}vf6r35EemxOJCRt
zbppb$By*^<MmYHREql3zTZu<Gkqe75B`kUr)yoy^CvQ9##yz51yg17t7B9Hh;#dzh
z--pgf4+kFC|5iSW6vfAd&COQ_kTXzNYrnYm|35FWH)z~B`|ecjb%#y|7ngRWpV&k>
z_zZ<cHTp`67FFj$oC76tMA=bf>}jE*I=Ika1VIw~xRa{%NQV{GzvV*3+312o-O^DU
z2GW8>oy3&u+&=b5E>Ts*X#u3DU$(n9itd9aQBmH&bO2JsFL-z;I6st~+Y!Sc3<O)U
zc^uGxW6}C6NMRf`pfR$+2S~RMN80qW-UFW#;;dUbpf&7+P1Mw}{4JMK0&=-lhu&B`
zP4f4!c~eF}?v*b$?wSDCuZQ>=%|}z|@c%)YQ*X$+13*KVjwuPb<Cm~$zicjIG0icf
zUqmtra<gr@xa$MmaYGG=+Egh4xpS9jGUc$`(($V^Q7Qcxd|SBY2ISebMti5*ozvlt
zL#ZRN9Wt>)rI<3>v3%FR{1N9q#@RJ!zws(YQLizZ|AG@Tv0O*^pp<&R>hZp#JVryd
zq(zH9jm#q+4>>hb@1i?}MvJ<p6x~@hQe)qn7;Fv|cqA2*uV{m$nHl?D)(Ks^a_)qg
z>TKcLoT+>qv7VZ#;XBxMW20Ls80I$G?=zGTd&O0;uqkT5i}<1S`5yQ@cvr(>+6iOO
zX3BaYsmdR*j|th(NOY)GTmYA;G{q~!ab@zc*N`neKr!2i;%^o_5nSXCWmj}$K?uTH
zS`m%*-`El7euUe5FAX>Y<4Ryd@*yF9yK>Pcih7BiZq&u-`jPUHwE-Jt)6P~I-4!#3
z3Qft#>)!=5Dg2~0zoU<JQ0j8qEaW#dDgIQqK)p*Nhaj5$Y653U`03{Y0^`wy=Am$V
zk>-H{^(@g>2oN}#rVCdg-a-L-mgp;SGPS1pQ!LIe3Q!QRo>^9lATo^tv^Y}F<Xdzp
zA9=n>WI3O{y5)5wbSWKaz&WSWw0F#ts&YSENyqD+9$bojCLP<wVK>FABKAUVgG=Gx
zHE!|&p6q5H0>*NOhZ26)8ao^0RLZ2~v{!3kDJMJ8H!S+iPBzk_PeXp^6;yW9S$M+&
zPEqpokE^E4?d+zraD5Ma-gdmgbw3Ld0=#uv4kRCbKD)TfrGO{^@aD3ND0e;TM?Bdi
z!sY%R5+=N<EW_Q{TP=)zJSx68`aK_Mj7e*G5|!Gp-<IP#TS0~I5-s=#0sc^SZdVM$
zAPilpjbG~ii<Rqs^Z-p#7T`G8js=#bA8~xG23vYzK=z_7`p*b2zCIXnPR=8`{oM10
zz!gN;y!jtirLbTnz){+BB}nMSSq{sC+E~-d?IUyORtXUX;>yI59xZJ<^Hx)~<0vG=
z%d<Q;HTHo(W&2t$UBtaeM+=CkbNR}vNP~lkEUgkE>^<&{m*(hOs4n}<ssadmG?RZ!
zXifY@QX^g^h<Hw9Q3(!q#~7nNz^7q?-11VWfWa;o7}qv&B?A-mKJ3MZJLB7fH#W8k
zEGoh&e+>9M6@kAppljGX*}kCWNIr@cAn5IkteC-ksq16aeINHc8^Oz{?Y1X#2h}H4
z`zj&9Kwp8{w2cmJ<WbN=6&N^9TPP~Qz~MTQNE@#$gf#G%OG}}I0uxgOzTkeF0jWZY
zc3-OCz!3@3mg$MsrX3n{q+Y5@I54QN7;-qUB}Ymw4Y~pXg9^(QDeC))jGfad+4nH;
zP1(8SNDRV2@J6E$f*<$4*tq>QHp?n~0i>V^3S+8&hOQnKT!cEF{|B@o7q5-Xpqezn
zts?<o8Oqj(gYOt<6s*;#B6K~-L_|AI3ik%{M$uZ0D#BI)?*^_nAUtj$Xbh}X3(H&!
zh3o+xiTz<+r1<S@VKEBUs)Z%xw9ky+%$|PQFoxCS`25ExFl)XQL7gtPi90J(+YC}*
zR*fsrY+SLBBfCQKxp?<hGGzACk}^M<mmuhdg;~OVS28<AXSx|T<Fs|BZQc|$pf{r*
zr=`hPkoSTpOT15rwW3eCGkm7iI|iT2$W0W{Mmpb&{m-n_%khEN?Pxm4Zs9j0pJ$}q
z#UaCYib8>~r{Oq5ZF<B?rzlOeCY&yTA2p6J`LKPw82bG2C8idRA4v>cD5SJ%oimW8
zC8YL=^>zw6@5kB|sZLRvU1em?7hwaXK-vFaiqU$!(1eZey3t=1xVEYBo#C_|E`(JW
znMkqW$G)+(-#G<uU&^j1i(wFiUCAk0xc|kLxSt8ymK`9k53PnZBtexjrPtge!ddSZ
z(C3<X!#};y;)=97GcCiX3CoZ-uS!9GsMRiEvOUer^cnl6C_Y(;Iq^C>Xt4SI0{UDO
zPdXWcj*Cmwu&y3D!wfY<DBwJ*{0u~eT&#AA8>)p=G0M4g6h_#VSK!B*m{0z)DTpc*
z4UQh9&6eSw=3mT8FTGB^CQj=x%WEm_X*Fd3jKQW)u|H*mK~T$3#D9UxGtA9H`XL2=
zqG0N4rNG-_Hg{_2da&om59eK{7OIDi#4=RT&X-_{Dq3*86}0`8Ny8)pVU<#3an+wN
zN1Y`{|EO(ex}D*Qs{(}?P2h0Yw>XNt{r?vDSdq5o261S4aI8)1&;9QW_UDNG@d`F+
z^eeokwjz3*CwO9WsX@3JN8x42adZp9sx9_SQQ9i1?b8;S;RwZxQ@1Is=ciuZKyZG_
zi1^Qc*JzEg#lCs!?()z9PsJ{CJ%&7je<?c`B!)o{h~B6p5I@}iVr6YR9i^sl0Vdge
zToHJGp5<D^GP!_e5d_^9ek1ffmJ6xUH(M?ffC-RFy8?l4BpK&n^^&^%b=5=HJm6Yp
z=*;VTN?J*{I@zjN7=wB%NK#FErBLj%0$U*q=x*1`EOsPOM<n=Bm9>&ZrC}FaFo*l9
z?lhfB&4?lk@6HStkiXT8kvVh<M81(^*##=2pND}nqscXk#6ByspXxQj&^NUo6nQKn
zm6nmDxdtkw4+oG#v2QMXccWusry2d6t^HUDdgjXAkcc52z{H8tMR!ji`ppA9W4%fy
z%O||%Jwb7sBSZylxt`rx5++V~9SVp_V6|nID<F}f&}RXd&jO5;0N<}}JTP|?ObUAk
z29g*)Cp9Nj#T7Uc7mB8Cx2~CQ6!T*MFu=n<FzK37VB7GSHAKatbOk?NJ>R2b6xcp8
z+aip2)rQ$cXFn-LW)VIwb`dnold>~9LKuc&=tdl_nxxr(F{Hvru?bf#;45un<iysy
z1e%#+rGZ^m>KY-;`o}@D0I9w^sMlh|y9OCQxagK_L#$tbbDD?56pAw$?wXx1=%#Qm
zEJ(I10;NC_Q0;B?vNS9b3$pJDKO5InmxLIF1>vw#fO2WB-Wq5@v}&vo7C;3^JB~?l
za!bp}TBo!3qOU*Y$etk7KD}v<o*TMuXGgf<&xW%^+PB|IoYpf<=VBt+--*2Z`B%G@
z_L$6&@2RJG&f@>b=ngOim%f$bK|v`l;S(nbZ;qS6*KZ|RuE=v#=herd*^3g|QBr#%
zR_?6+b!8-odP7ko7TpAYz(N+v1gTYJd-5^m;LT+#z-(E%jv`w(tAs@_L9$)xtk~Md
zzX^Gx@0H(c0Zfo>SJWD}u`E<7?z0q~4#Wh>cSUVtl<C?ao%x|YxFyJP<BFPZKDJ;~
zl{KYVBCTaSy7Wocq`an;bLiU&?M2xcWl;!%Ky*u~DYmh<{>SAHDUWP`iljyyW{A8h
zj?u@gT!O*IgUFkV_>$8y!|V<FPF*o0F6I<y>$g9ByN&!g;FZ4oKr&7y%~M*~5ETus
zThT{i$F!u}O<MP3b~F_1*uR^**HP^6l!%w-VcT!Aw`hgO*clMlzkhovKa=JeEK^_D
zkc!GJ4n^^`r6AlwVX0G!*+^rZCRae(8B>!szHw&C#H4w~ikUtrz_i(yw{@Fp*sXFa
z$cmcFWRsWNX3*dwxWd^9BTNuWtJH(Yn}n=tn!4+Tx-b!bnn$<2$;bjUdx7SUsvYVg
z64yiq3l0ei)(^gua><|vI}d_y^0Fzp6dv@17SwD__XEyJ9AhdOCzIwagqVL|)E?7y
z%n9Tm^!M}2rs7ilxkXZ?m&tre)#|8B+=uUC230PSDsW&?w14!&UgP0>N!gdQMNtK-
z6;Vu4b@kqHin62(Ozd?3_owWPawG;}7<!`>#HAtkzu025A4Afv#uq>+Ef5mp_o1Mg
zH>n;xpw`sus#6k8KhHSIA!ChccEv;4OM;rf)B6NgE<j=`-(`O{_IpT9WB1$Je%Cfg
z8=s@D6eacaQ&kq78>h2J=nv-WT>_h6o+K~!CvM`9*OfX0g}Q__K~lDW{&3XeG`Idx
ze^$UINXnK@QJKY{Y@yZOe3#HBn0Vhkq&)Le$ATa1bfs-~3zh~SF1!lM1QjDRj1M>>
zU~C7KGep9fU?!HHb7Pu31&yek^4m#B6C^bYH;xq*daqKVU8k-joJr5JE`E(Dmd-t@
zjldUU{}Yzva)fQCN5|XnS!)3j-vmj|61JHs7je$MqF#O%B?~?EEPZ`n-=@)o?ba0|
zVNMY54F!p6g40{2jd9Vxn)!f{bC%J!3fBZl&T?(`4~;Qz>!TJ^CD;jKyhlLFI+K?Q
zi(_QFt_9;GA5jX|1mW*9l#<Io-O4XzSAfJY2*SQ3Ek*tR$41=kcEI$O4{(*%5;P>A
zsSVI4ypY-h35g1cC<~K2NvHHB(}H2u2~b<#KLI#3Qdb&2f3t<P?EZ1cLYbIo+apfO
zu|!+qO6yxP+8Y`u8`kt1lYxC<qufcfg##35?Af}Lxa8Y)9wYCUpGYZ+!9xRU<gzzq
zB?j-z@<T)C%_6*r{Gr$B;~#+!`8e#YPAz|=vIt5k-u?r*{c2!8nB^y772j;$hZ}rm
zXLWrM%A7={?K8ljMok2ihFMGRjV9WyUKQzt@gvblK=CJ2_%7+V!9uBjfJtTGu(>9c
zfmo*o;6;c0<0X>CnS?PP(Zn`+ruP!Jtp@1Vbu#5XqLLMAL5INHJJiD~z@RKiG}28R
z%02Lw1?XBfPC2$PNr{S>qhS~UstXWsEZ+p>N1_L&31vv4Q9K2#a@evMYD2lIWeiC)
zX{X?rz>y&Y@GlJ5&3)__Wmk~HFbu+eG%dj--Tyx}++G$~s`}Jh)S@B`G4_Mczu}ok
z_9IAIDb9*;bl&&Iqe3^uegsJ_r4Q?v9Dq~D%WG1Y6oEY~l<Y>3cqRc{adPqoiSCtZ
zq<D^?@2i(&F@mIz^6^u#_8hTHs}n8BWCW`|N+dpgOu5(1ZO|G31sSgTD0Jg(v>oRl
zxfiRBCYg+2l}Mp+z@<Cyg!PYJdmj?ZTLf$tj7xE!!3)HExPlceE!Is+m<Q4ixG)`m
ziiHFqZGY)4S&bl3O`_3{jBxT0Bh=msU{t(Dkf|mC#mMcW!a_7XqqHNE0}1RV?Ih4>
zN8Swb*;;fqEjpV~dj`dC1gk;{7Xd*6x{=aj{@~<&0I<i5lD7!(n`0E<9?>$AKKn-b
zO%=GfFiILXt>4}_yYn$0oO|=-OLCo>1e|bFaeow<wWj!g;FnJFy2O7Ek5uS()X}`;
z{sAn->`U1hB}oi|K=ew{pwatZZ2Ha56tZUJ0+vNIwt)TqA87x*y3ZhBk3@19liQex
z&!9fcxuIO6YNe9Mrs(kmzkrfLeV8o-Ey(sdBN{J(X80MT@E>O0h=?9-9@2N{uraBU
z!GBour`rInrW@tJA0-Oh6#m27KJAgBeVA({DY~0i&2viPK4bmKWN07e`bbLuz9p5y
z#rZS}k`(O2To;KZs(pr&jdhruM?>$U;R<Zusw;i<T5;E3pDZKx7Go43yVP5`PR;u{
z82Ke2`vWaS_AqCG!Y<R~z*1@>$GTC5>tU{igp{DfDU=MTH9^v(xE|&@NJxpb3DStS
zeEn$B`*<t>9~~F^t(D4ERmwVOoDA5*Jiw=1n7`7tUHdO}|2FVTK>Vc*#BiB#J|)`k
zlacrFSfB+}r>6Euxd&e}?vIS->usq(NJZcYQ>a254Ez$0eGg@d4PxEDf72lcn6xVf
zIDW;omXUkj9ObH@CNQ6;#6R77_)vC6SrmdG5ZzKJ1@3=iG5#UhaW=r~nJC&YcN6*N
z|Bt0@4=R#2RYuQA;O%%MC5fOr*91;32H|#@3`_xNk|W0&57VR==bCg>0hk<7B#wf2
zl)Sh^kFD?Mk$*;`FTUjX>KyOYdi+F*&A>u5i%LWQiIQ1kBCE$i=${eE2RR4qJSwiJ
zfvUKcVuh%!r#M5xT=SccSE{NoxDd7do=2fU)D|?zbsMZ}W50j;#|00?2GOh_!4w;C
zv5A=_)ml~<Hi%~Z2<+qyTyl8I_jVL|KPG!Pk5DKO^_DAlut2(x>BhAtGQ$E<Pvs?2
z*rZ=DvU%#A6vYBj-(QhX+z<6Tzaei8t3pGMx0kM42K=E}Bhq?gCg$sakosdmpsGp#
z$t<dx^u=evu$2SD>iQuSVn`pF#UNr4w!>Tp-)(CLJ;nOatOc3fz&K+x2i)}NvG+rg
zwIHwzjquRUUXRxU_%{LMrR<E3AO=Aw*b=Bn?7y+&<qt?Q_Zr}4$VI{6?px?lzSKmY
zH1CB>ssZsa@JB*sjtt2kFbEUYjejD)r=x&Qz}{BSJ)wu#{n&)@jjRef8FxY!rnI8O
z?pGNo3&~33A_J)R3ld8(L{DFRnM&|uUW5{ZtTZozfAEAGC|ZoG<E@l(g{+fMvJu;H
z70}g22YxA|3NgutCYZB~)j~a*x!LgJO36a(V^)MRgP0Va!Uc>_q}8KT?Nt+_1~Ew+
z8@{#yqh{XTVM+^PX>cT-K3d~=2jtp~OG8OPOe|wDQQ~N9a#2T}-UKjC5R+YnvB30f
zQ($!0ACW)Okvh3K2H**}RTv9IUl}M(h)HwJIb;Yn<0o3=!Q`XNk$`!N0TB1SyQ@<v
zONdpt$&syk9H+zcVE~*Gg;<^~84Cj-(R<w&4_joS3^dJ~9`IN<ecB%h1C%GkG;ezV
z-y<JUT%WF-P)ZeIT77dkdy8HUu+{b)OVRbC?2L{e20<X&QWP=Te`Ck<>%{0t1B@Yt
zthnr+6Egqw7!OE;ZZs|@pPSf+jO-gJA*&E|A|@CEYK8dG6%g;6R1vQb^)5Xel~F<+
zJ;8ht`SASR(RecRZxm82q1P=DfrdJ3n%F-DYr{4Im-RX|Vnd>nq)Ec_#lC5)bJE^)
z5qF=EJatp7LfaAFj%Fx|-Yoc#45x8v0HAexG=+}M%Jz=<kf`_Rc{z_U<J!@TTwmiG
zN{K_Am6N$Z-_K85?Lbq=j6`QP3jWm$L^GQ!@=@<vBr7x1>p|bxGSVxkc}+?SC1pPr
z7qTPK>;xDL9MN5~;yi>Aee4MEoFz|C&LC)FG*HS#;QgW}CQ3H^@^-XI3uCm)nj@wm
zD*xXfV>pWYEG|G-arZAw_MFO)Lx@UoYDxyNTH~(0`rR6_2T?~q$uI|P0~io0Fe-0i
z9~NERz(PW|i@`xfa$req1jLCqs4FQAQSmG*ujSK)<44)q-2e=NKzJpUKiz+^a=syL
zBMXp*XgLwT`~K|1VjTDdyq6q}({OmjgF{a22@E6*FVzO|P2lf!#&Og2ZSL-cb91?G
zB7Y_$jHdW@17dM@{Ec-c%4@H<a7g5xpgI${Td?(Q8TV0g=8!m`VvO6A)eJ_9!l`Fi
zvgVM}t;b6q);1A@c<!22oH>Lgk>eIDurW<BnDip{Pg2eqOj-WP7|zYtL9-;fA{B+K
z<3LPHCh&!MqgO;%WTFt5$uN9YkO28A^iM)oj1414L-%`u88mNVf2Jf%tqj*E%})^U
zmg_H_<%+3@1Re^Y-_5oOHnC=2Tgg&H!W4^3{eAAi<O08R5lfCD5`idQyu8Hf@Lki9
zmb4=)k}Kj+hKDuu=sfsf${8t1t~kkpH#Z${XZ4jmUQ$w0VS$GNgp{XR{m)G;DW!_h
zhy)hO=-~WIQ-$cai?~0@2*w8;Y$`7`wo{#RQ4)8uPHvgvl{D0|yqpOu&Lg5NV+iMb
zC_AGhi9ryEUMZ-kbN`DiFCSZlL`yC}F-$ZKbh=w-?t|-Gxd^^5%0g~|0cc0PN{1Ox
zuQK14#j{)3Q&)!WMG)`~p)<&DVYjeTl-Iu0Ktr1skq=3?g@S^5Fq>9;8GJ~CWb8q7
zp|>FIYrV1^ny2fBFmcK=L=Oy?ltYL*hKnd$#dp{>YM5$g3_{egTNo?WHU}ngqefy`
z${|Giq7OFsbdh#mm_Y}8kn!<QFO`A{iPB$8`^V@-`$g=1t-bY+L1}DVVV)X9jlF!v
zYD2wx3W8Mw^U5;0L9RmY>+NYSEbI!kMwhvK+;=HB=6rt;=I4-1dsbA!U6;XPPB+DJ
z;xi*!4H}u4atew$-IVgEH2@taJ;Ql%YMwILP$!!rqVj@{W=~+?PGk%=)JdiYv<W*X
zO|+J$U&KAs!m(Xm`547o$zY9LBR4tki!qn|L`5OYS}vZFUkIH+VF$8H%C<unZ4^5c
z^=ECYz53vFJ~v4oe*gcm`=jiNau^Ch*p(Cn@%|SZHCeI;&qcnMkOdXXv$S737v1wr
z1f4fd8?6GnlIxGaUV;@Sh2)z#r?&*YqFjpk@qnibJKAVjErlwE8xnkfI`lg5PD5a}
zC+i9-d2WbBO<Epvv3Ip&3F%Gf^Kx2bJ}87uy&pHPO6hr?DxMo+$LUup`D;j!McK0)
zV|7d}1Axw(;KvjMpC6jQ<7>9D*)VzODroDhi$W!@4p{+hg30b17n4X^8tW$bIRoL~
z3HYLLVD%Nm>kr51704CnFAg}p<%XuiG;o~yMeILmi53U2XAsPWLznd?^f@WNw;p>D
zZMz5oe@p(?6*TwY!?5?1-8Rp2!uIVZ@}GP>#v7nctI*MBM_eyOr~(r;sHfn0bQ0d8
zhr#`)r7c(hiW;1MHbvL_)}}NSKifs{V^%bH|2Q}jjFK!zxc!CRMI{RlZQ(|AWQ5P%
zrm_WgV{EOYWt_{0mNF3TzOm(SyrUXArgA>v7Xa}?*|lX$41%yNDJbgxH+GYLUBJ#M
z8(=!AMV`q&>tVo}!vp(phfN<H=k)eg1%pVG$$<(Em^P&F%RZR?0n1MEahs!%3~)7H
zE2{*`2}Hn1VR7*KlVC;5g*egPnO3Bv0%F~_CU6mM+nvhsaH9E0RKi5-fs377cwEaE
zB>YZ}=v4lGAcj`%NV0}O7dmsma!Qc+%FAf1JdoiH`Hszu$thtHW@2!$0&_e&IkQuh
zUn)u=7RXmtgKy^iD)K))8XGoJ5(=>}CW9a2<_EPF5GtgGjg-Vgth+350t=G8J^Usu
zo9-1%+;Hf?eX^-wwT!w0=Y!>UMBI=}-xH2>u+WO*s9y}fq7mp=$nAl!V6jkj+1`<g
zn25czu}Dcc#KKezQfhXi`;>``d!(<VO9=t5wxx~gg7&Z=omBmkiY$pa9Uw+?Orsh+
z-nPpr))FM<YZ;wYI<A0>T-lM5B8iFXMku9!jQqf=mJE*y8m<|!NvT6Yr*q~d<iA+{
zqwL&{C<Z|w+EPT_NdJvpmOmgj6B=+b7zKIkd9y~~FyG3CMaryk5J|s$^nYsvsTK?1
z&M}`#LFyr;^;9}=5`^{`l4MlK$hq`klt)@*5`_Mk>AQCyUUax;wMQ%Z%!DAYay(q0
z16iI!I?xkjJkU00Xdw&-30e8o4{N_zB)tkb<u~muyP4RXUzYxFk#H0@7j-Tog<<MG
zc0$n^6QRnP@0*f7sIWI_VNozo#20R78WDF<MYyB|ML`g7nN$?KsCx>kr`50SM4~I4
zMIpD3G<Um~p8k(kY`WrMv>$qKu7mK<Q;&HoG+mNqK&j77y)%2YmDICzfGAigP2)+x
zF{$6j{+#t;?H8LQ{n}|)lO0CV0-!a2*+QZqHqNkA!{MjPTn+NDzI1>nh)pvVjc(Sx
z8AHx2q9ZLF3KB|4Y3j3vf*ogf*~k_T1+i^r$mP{M2T|sk59!cQ5PN1gt<GYeYnj#h
ztF!<qh!`PvJV&?dd=`)1!lNKDgzWytkFqn$k{ASm;FS^;bnbt#rQH1iGFiC*<0B)Y
zwq2kaF6$Y#>sSn4=}UuXh9?=I3IzE~Do_>jh&s&-92<mvxM_dpIEws|YIjB0ZTbm%
zPd??tS1dJr;-+FpR$%pX{vP?}VOM%SZ~oG)y}3K$qybtrRge;MM8#{^_WMHwO4D`*
z<7n6~DG9c?Ygoa<TNDqxnFn6!`+{-?vn&<``w{NI^Smi_enC3JJ_fjUxAAYa+)41S
zS&6nVgQGXx7+^N##<Bt@(P#@}bJ1#|d~8`6auE0>CBdHp9+_g$|FAbGVM)~KW*XiO
z%G2O|$sPk&`aYGY8nI2C-hUQ;|Hgeug}=1t8IQ=cB&!|;{+<c{h=LXv6d7t*N${6e
zfsv>NyWBMvLJ<gJ8T;Hy#1Qow8r#cY(8P90v_JfxE1lW&OXG&%0c>u`RKAs9Av&Ws
zll2N#vM&Yxk`F^l01=(uulm9V3`^1_8o{!y!Vb~tPEj`i!m_b==qrhG`WX8Dq3jH<
zAO=Aw*wTuM(tl&i<c7vPX@CP81(xrhb4JcvixeY7qa_SGUl=cnv}JB?U6MhBX!L}^
zVY?ToVfcsIRp^f|A{@SEn4;i@-3zaz=1uH#N}`tqVjLfEd9m5sK67RGAUeX~6D$+i
zNU~+FdKLPdlBk;T8Zry_hR<AmmnTUI8KMz0guq><G#@ic**%9PLk!WVr156jBUZnV
zM#s}_T!j8eNhpI%xISp{K)%w7UBy19WbsGi{mrw+up!%@LK%pN&Xw%k1tD1Dx_hbL
zDX@sHA{rl!=za_Elb1igQ)CfcL^K1if_N3Tftq=n7BgfKT~su%RexM1#dsRB|Cp&3
zasdu`H{vrAd`gP>zSU3BM${txi?yd8*77KgUk+xbgS0R*K916;Rx$4GH-XO?u@!^q
zpGQaZZ?(*u$met{%f;XLJt{802yG|ZNrpb6wy3(jN%NyVs`QFe)=lh>l=O4WO?8gJ
zPo^P}7=!0^>OWkpU4P2XC`Vur1fo}hs>R;_V#{+sHfZh21*XZQBFMl1ok<*npvL3e
z=r)w$9rF@6Qm=(UQPar5yy|=|hEQL^Mk*zZhD3$#p=wtr#n!3WD`Q4tQBhO+?P&sg
z)|>rJV}Ai}`LHOb@!(8~PSe&PrJrEy7JHhgp!32oMN<m#1w7+VVltJ6o_bW#vA^wE
zU)WRjBqo!qiej8A4BwP?2EC^wT#94Qg~vLTu`y>x)(jtU%$}?EYE^N|t7{88Wldr-
zIjXQQo*DpE>3xE{r=w5Cu0%MYQW9GQ8X30|i=rC8rV0j0jRtOi4uJP`XuJshY~#l2
ze+EW*&k^>PkV$BB8DpK|$DJ?C$cg;aqRNJW6R-6BfY)DT<iEflbj0~z@<vlntI_<e
z@0%$r6N@4nPpTP^;rZLo%?s5vLrB~L)rETtPj^piPJllM37ZZn=<owD%n+V?jUP2d
z$mG2~mcdeMcnFa-qP7en;Vc$3OthYz4!vK(UM4a9q3qmpC<Z|wx}_GiWB0$YJH!1#
zY9bpT4XGlpIk@A5n<Q6E^iFj%b7(A)O%MibOsJ!$YxP9h?fJ6{&r(DY8m3B9<Y||;
zu_McSheR0~Fla%t2MoN=q3OLp;<l4dI@2~UsovMxW(9GAC_-b(xOfiDOF|zXjgmiN
zPmyW)D}AZ1ZN7G5dGC(MrWNy6uO6+SJPZ=)?wb{lVA+sl>a1Z&rgYst&de;iB+6^w
zUTspIIHZkrW_<6J1x;(+g}ZrukJ0n&R0V~CwvcK6oi5XSA#d=M;+AkIXiE+C(he6~
z>1(!mW_;_F2uT`J>S1VCiq6oUew7Mq1#$RBjct{mrlxz|TnjJ3RuIQ;7;E^3zs1y(
zZtc1XWhMR!R%nu*?u<AS!~P=Q(RSs@+O{jeR)VddVc}-!s0{wm&-D=kO0X3~g&Jd)
zXsUh>WsCXJtH4$eHEK+KKDd%OdWIlc3ATc$Qo{svysCISs$%7|uEbwK)TwE{pDX<l
zM}DO)h8pWX%C04ep%8>!Nk#nJ|6)zpA@z-Hx+~+vhen0u84|BkgN2T7wrjKLT4H5g
z%7bNkof@<9#eu-|-$WuLDW2L7&8X5Bc-au^+KsU@JhgjCZgz_BzHpi}MmQp+Tv(<z
zSE9LVCA+SZj`2lbV&5TgO;MBr!Yoqni*oW|CNo6Uc`He)Y-^|W>*9*{68Qs=?FU^N
zb?>pk;A9uEPSI378WWK<Y$3r%QcDX^XK1R{!w7q`eH^(o0Evc5vXnE+)OL0Y$mR@g
zrBTFw8Tbb#a=f%sV*+g03Z3FqX2_}@{u9i9v81Vi-K4x(rmwldxr<JJQf08p^Cj{f
z4)?~d?3thwb+vUWpphY}UZ!UC$*xc&4UUfOA?^nlt}>i<R=~M{ci4r<OXxcq-UFr!
zC4;dQNM(s<TvRg@b@(eBD_H3Zzbp-p<4!Tu;p^Y%0<*D*AmgpQUS5J<LGiUVIN4#F
znFVxg=%2gEjAP66#Wwh_3NXRyiVr+)>nX>UA7y8B<S+;W(O&NVZY*IWC@B56kX_$T
zgmA`60SsY`w1BkF?Tpj5K5*I{w3qJkXxd+vB-%#Jj$;`&3}e+QqAI)=x8;oy!PLb6
zIWsNaY?T-;ZcC%SvQCl!8l;?4pACM$B(Yz^aH69pD)BhE0<MB^af|I5oi%Wjl=K34
zH1hq51m_xr5@+kWsL=X9uSZF-1~!u-o7;gy64bC*&$F%w)=+hWz(?h$yqBZ3m^>Ky
z%X)n3Rl0FpW~uDD+33C!=EZ&K*U-yexv@CBZ~B`moEKl<Ou|xm2s7jwJvNnwCD4m6
zd?xykvWuYi%fR{B;P<QIp(B1OJA6-Chi-CNh5h2ezJ|mQ{08<rAJFrpONuoZ*g)bS
zJF2snT9OzkabG;bn&?Z#f);EWlMKSr3iriF%#f4SdxJ<0r1vvl$(7JA9{Ek!hB%<&
zyJ=!=(_dGDzxYQX&iv!$0>0{F@KF=`<n^0QOcnTx-$R_V#Ch@6y@psmvOd}csgX^b
zE~(U|^alT(H(Ah6G~a1`rqDEg-jtnDlEfegM6aYVS>XN`Tb_Ty%vAaUQ<f7Eq3I`V
zLb(<*tI61rHzNKs@#2?%Y|E*<$up9l+Q4(*p}5eNt>ly5EETEJa>LyD;ON0aN+{#|
z6u-oPu~TMq<)H|gCBDU8?Pw?r7&~<~j09bI#ZGWhnUA%kS0ce!k=kr!8f%`|B9G?y
zA<<wgilZr>A1DX_r}m?w&|oZ1H1EQudo#aSc`H>*I2enw$@oWkeLFK^&i!iHKenW>
zF0PFFdnnQaXYKZ(C<$bgQ~2Z)AitBf#a?|nNFu`6slXXbG*PVv!}EOTt4Tx{FRnH?
zJ@9@3dv7i1DM%PEmNxjK(Ob$ta`*1y#czMz6F<REa78AjM{}*NHdMGRK2~Y0am}n}
zI)+U>=1JTZAEyE?9~e&t6uKFdZCi>Uv0S`b+^md)jC<{A_7Boj1?J+_;U=$v2|sfW
z>YBB3oWyhSYH>q7m8LY_g5&NA014>gqqH1j-N-GFkhWzD37`K{b_Q7%gCG#RQY0B|
z?|-qO+=($?mf7&~I#B_Ey7trEQjiq|<P%rWorQ9F*iy@qq{uK<G!vf&^VK{UA3%bY
z6m2QSie~B)W!9w07=#GpZ{7A<N|ih268=2&fdubsX3<0$O`bS#8Q`~#BJStF@P{C=
zIvgBIE4ARNzc?dG2{Ip!{`_=bfX)BomDOY!=8EP598wFF9(j*#Jv2Wu{h>)%e!%&F
zR`w1(V9_MQT~XOD!4zjjGxUkuqDxdJG^^Li8}7ea7-&;`>tyU76C|FOEMW$|BC|-=
zEWW$h)BS_$$n=LIk^I!4rW)uZ(m`j|_o{>j4Yne1QWU(tT#{tSF0ufy7p*YEogt02
zoU*c%EOq`-Zn{u!XqyE2{lxZOln^G?G5$hi5X#Gye+C^RTj<)p5Jh{a`v`Vq`$Lof
zM5NEUgF&v1#@2WaWFRlP;|*h#yW2Q7G~XXs-oJLJx^V~0#Ws)x1KCr482_j2+;SL(
zK_GY~zcBdz7wc}MwhF|NQPp2$ktV?|%)DRBd)H0jOk~5$3y~>D3?)rQ@?wE`L%vW~
z!M7eoe#yyjcxS<)i4DNhutdO6%JO0XdeaF9)}m8;eYop0)mZlcV%m`>QSKK<;UxA;
zR$PI~w{D$ABd-2c%dfHbNpX9}vZ|_J3q}xlYzNMmUhLkCgDn9yc(|ri_RQEGl5)M+
zaAj-P&Z$7G-gtD_PJ(Z<GOA|<F3QDGI9RZ^wv6n>hM(V{d>3m*#`R&yB4v9q$G_n#
z6E!6XA#04I(EE%Gmu`Z4uK&Bs-v|E-ovHquGpZBsM|a)jn`mJ_ol?G-cSg}_vKn^l
zcp%C=3%<{ZXQNIYb)lLd+VtU&A!B{9;o+!M>yUEa7fr?Cmy)u+*d2p|MOVeAHjZXX
zwX^8k#JIj3PE{%AF6QN-3t7*IU(9vpu<KYTn(3%MEt~|bRMjbaL}N-JW8$I2CVYOd
z<dzu#YZ-%#eVcGTl$}A21tADTucYt=y#K|9n#J!-p_69a2{E)ND#d&H9cOwr9sQuU
zRYbG25Hhj2G&N7X8W6gh6bVNQDiez?adI9nyrW=dpIUEs$TG1g6f@1q9Rc?&>f!Z`
zss)#c#cldg1gtJ7!<JdgueY`wL$L_@i{v(*A3l#d@N2u1zA`#0e<ZSp9D6$a(6L~*
zGFanK%q0&Zm;AHCUEkQgI)%tl&;cNUb>!VvWPKehP8bI#a1n-<*}1+Rq`)mOP8i4M
zLi|iaot&;J8*HI*!Z<$XfJhcfD7=5yv3HVKD$W^Dtd2lFwG{-YH^%>QjPq>y)ippG
zHpBFd?Ymou_MJ<L=1vc-x*Yl#cQ`pgWGTRF0hrZ1b6Z6nNsE;ePCOfMwghV44b|T}
z<5#aZ)dWD^mlFjSf@>Cscd}S&j57sCZD{Owt!iu0bHeq$1-BAb|9i(Xb8sKr?&x^R
z1HYC#`KsTw{w*R-xKY96M(wEK28s#w2g^T{UD2@wAqZ<}5ftpdu_NBcJLIh+4KOaN
zOvI2Jzdg=Sfp$ZWGUl@!I;IN86|WuB*ipr72=2Ll<b(kd^dk5nDRYb7K<gnineETQ
z^ced!Es=hMy01{~^b2VtmYkIeEZz7w1X+BBDi;{tsWrzX10J(Y&i}zxbU@U!O}h;K
zo|WG>$By}8g=%d_Z(wKNaK(Pdf)377?jaD@FanT7p15SlWA@u+_00_%K_2G8=RZ5J
zgi|d@aDYKNbeTQP%xK|?7mryW!}+Qmf!VU>-m5W}e0a<v7jB5dYIw-%!elq0-?I_U
zBShSn@u3J_m!7oj3OJ48H@aTAeM_riur}|!5;P689D-e{f;{S1|B-%S1v>^#4(t*-
zY?{;$yYfZc!-6AIT&a0=as&ojan7Zw0_&o`RKxs(Ky;b9WyfVMIonvYmumV<`gVq(
zla#k!3DiY*sU?vn&1)gtt42;q1=B?~j^8ajCp=+fVxwOKJ|raSGs+UMU!rJJZkBvV
zM^tD0P<CcX4#OZ2y;3Z+_5Cjv-pm)mPMHf3N{R$By%?$r5XQYp-!~<_(9Y?A;b;#=
zY#_m?j(Hm^jhG@5=ki>~oLx-H`pU6Y$vYaHGX7s0{<sCZ^(yq^M(Pm5xgf>;aaY^E
z)|<%B3vv!Q{MBhoo96FYsl-%_XmrAG<ToBhR$h45fLib(_>VO?9*Ce2g$JkqZo)=e
z$%sY~g~KhvsLgk@wG*Uj6(1T!mnjB4^MlV4RBn3__{VY_TH>7c&P?`N_9o@$#RzgZ
z^rwAzBLYxlrH?jNaiLKV!|_+W-y(cLo#5kAIWPIrD9GX10D;Jx%a2VadRobqMnMn9
zJg8=)pGPGxRj`UFje;5uaz<@h1G0J}Y;7e|8U-~RY?TCe6cWU|S&v>xdWNK7d|^cG
z)gT}6UP?I-jJ<dCzn!1@&4=1lVoJ_2ibhki^>0fC!1laOE50#`Hd7nEE8Hp6Uv7>{
zr6*IgnVK6@ma&k0&HD9L@{LiD!GXE9p@MuM6U=-J@4CG&W!HjZK?uUGq~Ztef3a=d
z<n2RtCUOBnnn4SL?PKKcD(t^)=%ndZivkFea*eSju78>PYhGhJIK^6-DLlI4)n)Mk
zH;yJ8dXd{?Tx0BTo#JRsX+@)|<09@08qVm3qh0Rr0u`xuDZilM$`Bt0_d<ASjrI@F
z8K&n1aFCVJAyT%ey2Ye5g@=3R&(&O1cc*k$sdu3t@o=tFe7Y^%Kv%kmhQJyA=sc&2
ztu-kx0kk_6GS)@tXE>bc6y^QsX~0R@oc$*7GZ^AZg-@`QKb^;HXT}+)7?XbZ^>HU|
zf*Q;bCg_r~iZO9D2sQ&QO;u#UWgE_<lu?ZN#Tzh<CQKTa;fVW<lCg?0IhsWJ%Ay-@
zO6#SVc8WU6K}uy&)D(0^OSwz?1rqn37)WpNU&X<6?iWkOD8{-Mg`<TAT73=*b;XoZ
z)X~Y`R4(bFS>XubPnhfzIK%F`FT#d99F@JOJ$)1RC1LkagD=6+VO7~`DI<cB8M#^a
zg;+WoW~$xR^8MNUP<Cy(7K9*dODgza{~J5hlbf3!ACa&5Ba`Y3MWOu*9pR12-=SIa
zbmCQ(KQ=2EVvfq$&~Z?-QH?Tp^h@Y79_;%j(4Rv-tg=*D5$72r&6|u9G0!JOARMR<
zaW7a9CB+?Kmj*ft55N2p`iRAk#Z>nnzhWu@!=jrdj1Wg|teHZgUb}fMTQ-*K5;C1J
zR=mM59fU`{+$fs$CGr^%*6|0A8J>I146abi{)jL~?zGXAAW()fT>jh5Z-Fmxu*DRr
zdd0C4lug=8<TD&3cY|R!#~RufXj56xh%iT%yKzpSwRSP|q{&0v3m7D<p-#_z5e3II
zxjwz}1r4I4PQg<3vckz@+U@8Fb0o2wg5oN-Qf42?G6E<eM;jxp8w?Z<IQvd(=Jpo)
zh)1J)#Fj>>xqrveWHDTqh@*`)N{GW#6|Qq;o2V@oh7xkLvBt%r7^s+ner!%9B0e<6
z)>7DS7$=ktvC*f<mzU;*IM3?gAm{0;z63rm;`c-RP<BSS4#OZ2yiyB^ZSH@u$M{K=
zFivEC`(Z^irGS^&AMRZIlN)59_i}4*SaG1S#aapliua4~{BLOo2fsY>Dg>ul7B=>v
zuBKU7#U#cS1r0YaOsu?p<Ml}0a>*se7I!Jd8eRTx-)%D=EZM|Z5Yfm~uX=&nz2<G{
z_fo0y0_4WC{_wQH3LyHq{8E>yydbLiHkz%@b}zQ$XGcFrBTP%LPoHbgU=!Qs=t`Xz
zbT%Ne*(URXto5UFU!oEI5^*eqQe-F;PtJV~#cF<v{Xz!}_sObqt+>KiUl_%nLz~_L
z$=~CW^K_}oi#AhSndwxh=t$aOEg8dDRM)^Dm`-fd-7<ZLl^QQ9Yt&2W;jafg!_Dfc
zmP}!6L^vucl}lL207`yx@^d&M`fcJyyx4<RXIZ0Cv5Bz=x?xCjDf2;?aGUH=s`Mh|
zMuCCMJz`I!vdPq?QZGVouEshlIOqXMJ%^-H>qW@Td|GMfZW&(Xkd%tO2)SW1_3J%o
zL;PXy5B*2k86{f`f-rPTwH7V=-`LA(zl6DcvH_<PQK69JKR|r7w}DU$|LPeU$defr
zpBVQR_wg0f#OXbUU&$xNJ%}+{dp)akVW&EyWE0~-@#fOw<xM+?q+w4>SF*@pEu{xs
zXOW*;DE{VNK*=b^J#_T1hjM`1dm~xMaF>$Fb;gDoRJSU09lKl4Ygf|Ab;gD+Go(MX
z0(5Y;mi_=`RS?(dAGG5Yd{?9Z^^#eP2e})?Bbqd)(vbmYBHr5o073u01-}?O!k7)a
zH>i$u3$%Mi-QQlZjCp_2F9u8Jm?(U8L6Wt&d&M)xj^H|lr=hA*Rnbh>L!3`BepPS@
zgbWkj{PEOoUY6Y$d&N3Ns|URe<&~Z1L02Lb$j+C40272#i9+ObX?vX+bgQ5ehHapR
z+rt8E$5W|pEdGH?BurrkH?dV7cDJ1m{{Ur~5H}*xrooGBJ)QeefyCE|QN;I96Ca(-
z*fy5_4an+1HF3E`DfOgRKT{@Hv5%pVww}#F$6T)to!%p7CtD6Of0UgKuEZb+gs)UZ
z{JH<dmam(<7s}Si0d`_=tANAIANE5`+=?0|!x;^4KWgiYg^YoVYx*s#p30?-L_#C<
z%q-iPh4;c!55wDHm)jBYX3?&a96aPPemT*Ch+oZ2ZKQANEW3f}H`h2EDG7TQ!*x#_
zkjOYwt)S{v4sbWIaMp})9~d*?X|2T$Xu^EOe!Se+0IY|GndZ$F(gWo8MLXUN);Wug
zEoxtAXPrR5ZlL4cAjW-n{JP!2{l}_HA|8%+qt}4mYIT1tv&6P-#*4+E{e*^Pt4JN7
zB3{SQqBrqysVjpS<*Q+jRaE#`5>_mFc_AE%RAG|mcI9nH(3^;K-w$9OVG2*wq?q*t
z`#mIHjS9Ia&Qz#^Ys8(*B!J$2%I<PIl$vGiNDS)%@FpPM3=SQFVP!k!og-Etno9n}
zt5eZXRHV2uJd9ig&18O_fCB}tqq~P)PmijYqN&7B9x9E)a^gw*1yhzY?Dv@XXUAG0
z7BGhkl_O*en#ud*q3e&p(M|8<kMa-vq3jHn7z9EX`b)KJ5dZ(j%JYU)N3K2WbeLsH
zAd=gI9|CguSOa#N?=>U1zN^+W!hBXTG7f{&p!%fm(B|oypuTEFg?Ky37*hGO_Z%;d
zeh5j0s`>gw)<{%`-teSGn6IjEFgiaxYhyyP*!rKIAik=@LCvV0e$;|;94}734@c4A
zd?T;5*g+?ZF#5B)PvWuav;%5~!%Kp)o-Pw0S(G?TXW(~&e>F&^5sWM{oG**XVFFl=
zzB~9n5~`^}xm}rVr>Ax6Fld4!s|sg>V6dV(wq`458sW%w0jQRjBOk$l4)i;BjKWci
zV$zFH1eyqMAKLf?p<Z{~Bz-}&wtP7bXsuD?Bao^~Rm2&Ow+`>YF0}R$O4U|}=@eT#
zH~jrsDsDc3sj8mEA%!LP#hV=E(u<=XLQ)2gEEPY8v1&_X%|{^hBE;Ea$K@swyE1zk
z0PzV(tx6nPx%pds$fSrK=@F2u3vZ}3Xo^^q5Nb=1%qKuHpWYv3XLM^Z2*c2oD4_}L
zzu2?$@uUQLMHWDa7IJ7EJ4~ArFwZ4_m>jb%hW_ys<L?f-O?kLH-jYL~p_WiGTHVm7
z5v7ZcU(a)B3D*irMynf8^=O{i_%hFVUy>3@Mxz@NHSK`easD2JlUgE4jUC0qJ(t`b
zZydII1tfzc=K&<3I8Gc>EI9k5OC%W;IgVtF=Kjt0s2kA|NJfVndNd3Lxw~0Iu8ms3
z$mDKAtrqhQ*`7OOOWhMKabz;LSv)`njbA7AMD1$u?<Gkdje`k5EWy)wOV2Q=6`0KK
zHcQ<pgimubs}(K5WK!mc5`0l|ruKOd!fFX8lQIWujhFkS4H756Z=4EJTKuGnqCWW_
z+^D3NwsS)XD=jtpbH7iJA1Yeg<=tALzZgN~+i~?SIIj3Y_KTr^Ogr8ky{X-;be3Nu
zZ^r(9mYM_jP}iB>rhV(iw+aE8r61J|+$W^sb@=>gCH{*d9brBVP7z#~T&3M_#{OQA
zuqlOR<#d>!0O-Ho{84r#I1s`h@JlUih5r9zJL6`vQml~=5JR*baE?pu4F2;R9lRUF
zQc?(srM@b?Z;5$c05jF`O=1|shac&sn!<qQrT%B|?N95uqD##nK=V5P$!v1U+UIH9
zQ(u&RXowF?HEwX2$7Oo=&s0<B(i3&)*4u{&@xxsGt(s=ArDy5Tj2h!3z^jm~^P=!W
zI~G9|(9YmVj%zI1?%mhkx5K+qwMwIjCLC2u^f7LlftKC_2WJSHU4>hQPHMKisJ(BB
zcfl!mVxmi<dEI}n@K}1=leuKz=)sLJ5HW_n8dva|0he<P-w-OzxF84E?g5i%3SN3M
z9N;Hhx+r`wApT~@r73{v?QqEAqM>BP%XnBgqcQ-~Gj+PqmsT6MelnuqUsL$f^K_`2
z2h^dNZi}Q%O@YfLm`a&Ehl`TDZ%!cL{>^~PC78;DE;jttOLbUOS!oJhE=(QFH(VWc
zdJIpCl;KSL%c#XEj?ZI68F*dB4GS_6|MJzOUX+8z4g8>v6}NtzLiPbLAIi?fMq&^K
zqAdj+g6Y4p^CQyT8dwfDFtQv1{?071T`ozw{_dlfxxEw-e|ZZypBoscH^9i(u4&~U
zp!@;@nj>$xYnO&k_shceFYd+@Zn4AeJBBa{@j_l)d@bY)_bb9rKuw3d0G*G~?0}#Q
z9F4AGq;PU0XQW;GFCRc}Jfa?(Lq`;aFp!)ee|Ly4>ePbxQYU_D_xutBBxdYV_C=jX
z7&S$)oMH3nKa5Ds7`89!(6TDo5<PV7%8}XMUE-;5ERA_ICvpxB_ynCJ9&t=K3J*0c
zF{RKj9qfp>j6pjpoN5MNs7KlNTu=i=v}Jf)UA?HW8b-ya{56q&fhFRNVe6RXZcWs;
zYC6E(_+sdHTuk^VsvF~@6_ArLShsRaVMr~W5lGfga5wh45LIiITVPm3E@@^+ifGAD
zSaE|K!q$Y{nH9l}1$H2cOl}+p@e$(oMz$vl_J)X-jA8qo<5JKpW@DAmea3zwX3IeQ
zWx+@ny;3`PN6;Iy{kUrFW0RdU%2NN2ChQMo=aR%Q2*c1T@eTO?7posx8HY6PvI|c~
z6h;PFdMkcjO4~Fx?wt~94lY9d@i8Kp*tW6gCyU~ty-aBz3cny?+s3@?E7M96bg!i|
z#PX~jhmmxpi9^Zuz#Yir5#f1Okwfkp>BZc^Ga37-_8F3Tj4!S;MC`T@sw?9Mmlc3A
zACBe-wc8S?F8#0Zrbg4R%+XVh5WU+XsCpl_R<{!jTGFTDXH1MH4&@=yKWK(X2Hnp)
zi4Z(vgp)2kGcZSjGNtZSG7=(qR)NzBuNovF$?U@`5G6$MtOSR2LWU=se&5|RvqT7<
z)!$Tn`<3Nog}mHpxPME({Ai=V>Ey}dR)EE@e}0t+39|~EHT8twRa^GR<wNE3Dq00j
zBh3`IYdqZjjiH1{*cLs-6c}S1jRf2WuMCM0u|0W;M-yVoxmIz*juN6`&1J%ocbE_l
z^*a52tRYOg^{mvTBwb#&%o8FJs%NA)Fw><!!Q0~cQuhUqdoTVdyA~UZVGy=bz9j6w
z*x5Nf-2tyvSO7&Nr3Q@oXkn5t3CqHIcua{jh4c&+2aupKGA*vrX_1t#8K5^T8*Y>}
z=3<{@#WlcPQ#fy0I$R|Kos*esw0&dv(Hql|Q~C5@xRQwTML1hC2-4DUDuM^T6{O7o
zz9SZxG=(7j@~Od@yS5Od7RME0=*z%7zkZ5amW~{zOm4Y}UP(bczkaGI>7SeDuYW1$
ztL^9OG%^5!93Poi!&UZgku?MLtTYb86Pf5F%}Er4(G<|L;y7GAEqk_7!+NEzDcon2
zaZc{9WSum;!AN`34DJ)F)rh!6p)M8@x?I?Oc7@T!;d9$^R2A8VxjOQ*H{7zRHh6`|
zpmF>fXB9@tKt8u^iqd6=HH7HLVZnW2`^6`A@>qF;>{^nTq`d^=8E7Wcb<_|+C{2Pd
ze$5@7k}AF#b)51m_Q7rj(gcYeo>5Z3Pr@=dPA8Gg%n^9;HQG@!*w2x15CA)Q|Kt<(
zQ<uCj{^A$MSw-qk{a0kB{PX-DoBpBf3X&iOLD-j2S%v?9Y>79ZI&$nK(^8eFkX+D@
zfmyz06`S^s%hB1De-XJt|AN!hLMCefg>75Qzq3RDz1ft_pe?3kt2bmz^bPzR5~m7a
zk1|Dn2siV`&#W*&??7ead()CRV4(5>e2K`>g6bRS{Pn@M*mjItpw?2CNXm*#70S1Q
zpEzobNpU5wo3%b*Um_3;#i2#L_GXE6$qV#3Ccc%*b_0;~w^=w<Qa~!4&)ZKy3I?|U
zm?=2)To2Iacu25f6o}pR2JwQXB$SrC3g?s1{coA8?>4G7P|l(+;FnhqcH$uLTfYR8
zbL25tB7G8?|Dno511Zv|)yjjgLi>CL4%+!p^Gz^j;h#QXU!oFcrtQ;VT-+z6I#{L>
z_w!{qgub;&0zs^)@u-%m!u=$giQ5n~mPR|_e?+@P(nMn~Ixc0VE!a_1fLn#2xdNQA
z8}L}L08+NI=T@R;>ZKfQfEcJ{L?gqg{E%DeL{9&dT~U(7APBosr4;r47u&@5W!QG)
z0%-?}1`Ek9Ts1kQ8mQHSV_+G(Li~2298h3mCshFZ&I176O1y8E%5n0thcYN*jTnp*
z?Dvp7lI#35el|%-bJ1Ic^G!)c1mt4AthU{p>8(WhqydK}FQC_S7Z1B~MeVIb`J@Gh
zbK^KE@eCYldBDJ1h4o1X4(0xB-3Cnlxj({w4U36b&dsi&hq3AWLztsdVSOfIITx!P
z3f_0Op97+z7kHnkSPpiR5%?H6>N48_@<&iqDTh)`lLZ3rkj~!wBPwcLJeFS`4`Mt<
zPlkd^3k3$%%^rnQkP1?W;y!@>2ug@Z=f%!j79ef*6p^UBbr<Ae^jME&T=P%fN9naC
zGkM8MQ6+4$OL6Z6{Cz1UHNlGMK>;F5WeSBZkU?vbmu}|Ek%K+imY1@^1x<u<ZkpE&
zRAd9JEo<$0#Z?91nwQ<ZW3TOO5x&!6j!IBoU5mY9q5`1(LWcx)V&6b1ja=D2ia*M(
z?TBF*gsp@z#%BM;ihS1}(e%OsTtW<yc}UO3pB+Geb!XDJBO*4pmk$@6_jf9wWg<lw
zf@wyhChKVVgz##fi4CH6xf&hyP(;fo6osH>8q4PJ43$+J-cVFY+x&mT#TOYQk6vAf
zu#Tom{tb!u7*Pnp;p6D`mfX})RY~I%hq#X21r$A}Zns!NRwZq78!}U=1Y|BuYBR_>
zx++VRtE~ZMn5A>fA@RoavrniGd2q@dJ-4~*(ycY5Rj{|gJx(y}<!@K?PE)?H{l_QH
zYXAx{%d>&0Ms>Khyh2qTC?LiqkrUyeV{2%)q-83!Zrs^5krc!XVw9?bw&0}(L;6gD
z`5nPkrxh1#2LMi?VvO81;SH^4u%Y-1<Ihh{BRhHeW?n=N1e{h?F*j{NK$_YS=$E@(
zA!4&tOXu1Ffi$&)Wn}P+*v1Z!)>4nQVBn-u&o}^q3!+Lt^!iLYKyXrgf?)5Qaf_OM
zUReI~*mSq_Ox3_9i7_*i*U<kO|4?==$q|Dv6g*L;3=+Qs<^ETQnk+I%<CL|TrOJbi
zXyEDT+3R!wORL$|jV1779B~E8fS~vzSp2OP6$iAF@R2h#C9Wo!YhX%b2ci3e$oHeI
z=hQ?jhP46r%ww)6p>M}pUA0yDm31+Lq=!tHp(`icvG2pSsI%blSfk&!))ZYi<xa;N
zW%VslSQ2xUWB|xXcLu_b+B!CHeFZJ6N(z9qx#0F!xQN3*yTor>QUG)s>2OrsY*)%p
z7?2G6oHjZ%ZKCoK`->8^J1QyiIlEceQozZY5sFRtpk!4^k&n9iM@pdz<ur6Wiz!Mn
z<a65S&{|{b1#k(NIv&Noe{iSZ+1_;%ttdyk-t$`}Lno(z$JR1xmTWX^qh`-uAB4Vt
zm0rMOxr9O>T3H*Ng(G@N9euTPhq)_d=Rosj@GSAlQ!?b^^*ctf4RPe8$<Vw$eB&wf
zd6V$8SG9~yV{Ggb=J%KP*icD<&!OSDc9%!XC2DlSg6TtNsHZuRdA+zvw7D<y&zbVS
z$e+jKhq5cmbr=R=H=0Bs3Ecl;53`>~Xs7T!33a3ihB|hH&KncnRs-`u2#P^Np{!*G
z^ZX<7$R|FzvO##%{1<x4cMJ9`I^S_`y0;&OI|N|0?)(<;SqEo8bTRB}1eUjF<PPe|
zK3AynUT?tiL4A10cx(K1(0Tk{u)={4lx3@5b+|SD%ECInj1H&>3Vh3<eNoRA?jW|T
zt>ZZ%(3UYqA${2NEy#BGUHLIJZ0~8|##Ad?2Us1BS7>#FziL{8uR{NLY&$Fu9S)ib
zS}eJW{JM~d#Y4C)<={ty)ORkTbkN$)1Un7(?+WL+x`xuiYKg)_80ISOYC}(F-2{Hm
zMfPDGrciE!MACSe7fT1LW%`c8680`(!j1}x)Or#6M?UgB5KK*GIMrZYdK39QA&GWQ
zUSmK9gyX?1neO1U>~&?hBdZ(0m8qW9(wa~0#Bnu$-Mj?}-!8ri{GJQTboRB`U<wI|
z`1;Hp^rzYW5kqdwq@c%D>7p$kkCCjd1{6{zWCOivr*zu=QFca26oMcW-I79)?tf#C
z)7K-ikqs~oks#tdYtu`AMA+4JG@9KWU#Jr1j&TLyAtOpZ-b(Xk$oY>Avmf3#mKQ4}
zP=}2FKhC<H>Ykm~%^yscRuxW%3=5XM{PH3J(Qtc<vQm9FuE(O`+n`m~_1ZDK_QnJC
z=+(=8b1+HVIT9*mV<cKJM@d)T4~_jr_WdX^IwUf!c>l>ihdkwJeaG_BA#qX%75w{(
z#%NjOMOO;O8KeN*zwoQkwnc(gH!Od+BWM9Mh5$Tk-<qhpwdfCjL=kdCBPTCneZR0g
z*-;^XNF37vx6K!vw8vkre@f^NdC26T-Oux8Set1CvPAxn2h9pVLPx!7dTM=1fR!pV
zj_9aw`2G#y1ac<IAyTSB<A@FiLmI!@kXW`o+bfr7(8yuWGhU&2Z6`fXw^i68+TtTf
z9@uk<cQP`Pg0I9D(IAl{!p;Pm-7{9oR3);Awg^B*#2U>A&V)S&Uj;3qEkZiHa`vL`
zN7)%AF${uG@JcEqn)_d@tY3X4>4Xb7sfmgdb|KVFLh12h=s)wJmJZ4R0N?Gza*hc~
zauI7v=K%WwZZPgxDeqA+i&)bvDlF8veN%HV^9E89i<qdZI{nRb)Wk2z4H6}*h>5x?
zHl#t*CbeuW`#HQK6)_Q4b?PqS^N7F(Vt9Uml~~le+z2Byja!w0eP3g|8TfHFgpcFU
z*Lnoev5$_M4w{Nl#DtIIn-f04ryVo1O1$I~F{#aQ(xoWyuEqxSZs_Ov5M|Zw-l9km
zvsC)*j>>FE&!Z2Pwy!g;-oJ1MFX=u^_&9NtqJnlKt2xrgd{!R#d;R$?^1%ppPKx=~
zi;@4lzV8(XW`Mt-E{sz1dNc6jTnHZr@k9gHZzKk97GNQEG__Tc)rfPYH)I?+<|yen
zOmtQBQ&H5oWoGN<h+UP3mZ%gwaKD^5Y2Fm5mXsVelu&hSWXlm(*qMnwUXpT{*s46@
zf1pe;*SS%tBIGa;Rrz^sA0?E2KXX}6Ny+h{?Cf$agh3#@B?bDo|BYR~lk;#XM^h5x
zBQdBgLx&j+K2<cmE;!v&VZEP)eon^RG$B#!hH}$ZzhxJ|wu&o<Zp52T2dPhHD6b!K
z4puVd(8#>;eX65hYXi^s{DoAEGc?j}?Dn0O-q#rOo+p7{9$GeSPwXLlnI5Z+{E?Kb
zGgL!g#u#n%5)Y@3mdlQcbA|?$oEt50z^CE}CI@j}(h;=cV5-r*L7dO#(IdZP<Nx32
z>&9Y^%`sNvaA@CXD~22z1acY_&o!sE<yX)DOQ{G85;<)`PiyFIifNMdv63B!Mxu>y
z5(Lagq}uXvQ^k%$BhdzCI}IjdG_D=QeNIQD*$BHW0MVc`+ezfdY-}_eFOqycbx^xF
z8p*|D#fw8XmJM^Nj<)+mM(-X6kzW#Gn-hY3=1lw!#WTOfQk@s{al8;~$i@4$G!f=2
zW*i#$HF8ZENaQH~d3F%@B^v=7;=<WQeB%;J0Ip=hq0y#lV6W@=&4IGEAFPRr2ZsiJ
zjpJlv01>$5pI?4|-^hQIol%m-AP5AnWP)P6|HYQ}56QmDTp*RAL{Nw6Z{bMt8l1+~
z<zsV#PS^Y{@i%N7Y1l^8!$=kyy_cU>8px528+rR~S3@T{>n1Jrk6BnVb{*{3<QzV|
z+|elP4a>eb6!jbbYs}YP9>^s2hGkU^uc=o=gv<KqZE6XSTD_57<D$hz6X|ZSe9N*{
z=o^+LHBKbrWCe{Rw$>snl;|6lMK#O_;nu*Eairv@-~JJjtg2beJVn05GJK+%*N-b*
zr2lK&*d^A6B{!UQZC+mF$!c>|@O+n88<y>G@E+;70B^GWxsnyuhWWw1VN@mdjmhZm
zOJJq8(KGxe&TcnEplA<fWxaHXwP9I0g9wTTQ-5$1s1;VBZCF;$aECG%M&hvB$EQ#K
z2+4uJY0pNYJ)jio1g*r|Fh6)3>=vk4w+^zZ?G@gJc}~FIw<|oLm%F`atR&us9aO4D
z^KT2sa-P9o#<C>lhRws#7_l68SKE!bhDGTivk%T6WoL8*F$e<DmJArt{u?`<f2fy{
zD}eEK5+%v9k7y5&_I^6($>N(LZfNw;@IFX6F1@uTA^2w5AClB{reu;|8HXz~kz=i%
zX(Vk)sq)shVPqwD%;c)}hbnDZxvSEZu&0@Dc~kqpDi)JZmD%&rt&_aIR?c*j!A?_1
zJoW9>7cFzz^QQENATb-q@0*t`cG$}R(zvPpSCANwGYH7R+V(<;?3>#(!`#r|sVOdT
zt)z$eV|sha*7v2*7#d79&vcn~Fut-m+cIPfjfR@~x|seqI-kp*i@G1{4ewB&0Z<40
zu(iW1ZH8W<!D8c;@giXKld?_Lq|g-_95#g8u~t7hp~S5sXYdl*<2~qCnP`FTWT0#9
zqV$K(J*YuCODD8;&H%34QU(E`AqYqP*Ti>ICK!udRsOH^l7$0}YT`Va9lZM~1cU~M
zjf`nxB0)v?HoC1k(?SJ@4f%>Np2eTghuCIuNMRr}f~fpapSgC?idX6&NT$gdb?b$v
z9o9Q|J6s@J=^tfhbObO6!qAmOW2O5qR>B|B_GAIBhgwC$%kO7Lvqo*sIHiW7W#dhh
z+#p7j*mPTm%jL&5K~_FgR@@-Qrm-PA3iQ;5IA-S{^iN7OmIrL#?ru~=Q__AC`#UAk
z07v;&Lga>(qdD1y!wn(>hy1T0PI}gsG~^|h2}A%6;kf=F#YdQzLqf@90&Tm$v8sU1
zJyc7{%P_7=LgIRy<aAxME2DHQfA%V+B$_qe-A0dIjTlYWN#yT@#N|lZuJ&m=f^?*B
z)=E0!TGT;K$^=;~$d@-IiwQ*bO{ZYY-I2)s%kMBH*9k=Q4ezrqf_#U~l>YMXyDKS)
z@>4tfT9pL9n@keXigg1b_l6zREHoyZ$$Sv_JJS(*V~fRA-}FKg$#q@HxB(mUMwG2N
zv$11`ZD=XDR5G%G8!0NdZ4}8%)3ew=Nx=@nZEU_}=cb*d^5iaALm=vHEZ??8UUK<n
zmgaWF8Uj&qGaM13+#hM;a1!|^C7}i5q3qm}BnUwucqK)A-Tz`s`iE>!$OViE+G&fn
zsMI|O?*-v9LMxgAL#Q*|6zj^_*`_B+S}Qk|L^E6n^;{}zdYO_Vt6{}3qZAfG<@!G^
z&H~Jl2X`F`l8|QV({D^o?vC}L%@J+pDRzTiOezdydLqp202?nWe?CJWe8W91u7?RH
zW5sEu47)*n@J-_rg_1?Z6kZhADR_hW;2WZPCU^yaJ1u@tNbwug=iamv8BigF?iTKm
zGVliVnKuF}M9-||E@8Mdg>F!9ykV%w&T_#8GXIHo*(q5jzHPKNwA1<vQx5SdW>i^o
zU89l~imR?qd+|N3{9TY%{Wu%(Q9_7ajhGBg@gUUOZe+}3oMH%ch24=6Wj^J`ek_v4
z<VQ7iwjLJ#QH-l)l#W-M8Z(ytwDxy3`gK=O4h4sZkzV4fIwQ$^!i}5^1_2Kwvh-o$
z9|gHIYLP{vYz4j%d(jjVLOq$v-qG6x6BM`2ZNaredIkxh4oqbS>=JU8?A)ERtovfL
ze-I)5C_4ir2SN}CehC#&|NpVf?4{}s$>x?1P#YqM3ez{X1DZ;vqZB}98qz6qa|WYT
zfDjtcRN{g&UE}1V^Q+G#VkI7gY8*}Myo(b~V2!uH=l`~E|49v3sYpxiIE*r1OX^gx
z3JXFt^uSR^Qi!0#I>{%0D}f+XBfyx1AY?4;U~8u_P%BX&H1^)0_T9?d#L4=UMXZ8>
z(9nECO)@^qPd>!%o)<`|+>2-`r*OW^%OP!Le~gkpc0{hh!^ljCmzJN^tU`d$h^87B
zxnfNtuxmcDeD4p7W5VR8@Hjx-|M|r5tv8~u&E^#x<&g<7&c`mR5Fyk;AaX}^B7E2t
z_#s?MwO&xQX?tyALMJ=yBz<zF)U(+CW=^G&VV5vt{^U}v7dmfHP7h+Ik)FoyWa3xD
z_r92iDhx6QHW;>7w^X27g#@90+io7%`SRlrI%?n2*;>vkgl=aer<I@&>QPgwQ>zof
zj5UndZg~w?s=L^C!zWd8f3b`S>D3(6r2_9ztr@KU*ZNUy_Cqi2McKLKKoEjJ@JgeC
zkNaP2E%#$1tP{BaF^oE>P1h;-IV<~%;xZVdYoI!om`0!vQg<QvT-W&R)KZ#Wgndbd
z8t+0pXk}LEPpW_R{0Q?wcGb;8R{|!Q*#GiEk}qPv4BVJ5)@Q6r1MjWmx6lyxL3Ya;
zv{|6r*h-5RzG;N}AiHBt=4}ppTfsPbTm(L6WY^r}`SG~0U<M+%xf%31A<evG%qj+f
zM#s?1HP~we`yg#^%z#~lw4}_GNWBRBl92tj23FfZLRHeQk@7Y2IUV~MaRA5~nafAO
z)-KhN>aLkrMUcqYO7-MAU^IkdkX>h!=FZnBH|Xs3OjC`(7{pMh#yr6-ms0d(wYkGq
z2*)6XLNzLlAV?)^cb1<TVlhZF9;ozWe|zAChE|u8NFCO#g}*FT`?KKZ#qWNh8$Cm!
zVzFRNq0644Uk&`66+@z$(;NGQymVm0Eu2W9XDC$jf2;H8JRWS|`@i2!sMa$WDyBD<
ziv{YEZyweg*29OgGeB|}gkj*907Jq5|JZrcncmsHX5tUH83%||8R<`PM-`1NTPw&h
zf&9n96|m>VZV+BB^9TdxM9KCCm2dj7J;}JfVL-nr|4@Na%)^Y{Hb|m^F3|Q!d$I!k
zPP{FJWjOqW`<8iul#pL=w&~+cI4;t_-nk(q;HN>(;P?=35eTj>>A5S|PraVOQns$(
zrqNU%mA+|77#6p!h@}CSv1Ym!xhla7GtAyFL95HYI+q>qgTglt?Z1)2SOrR}Xiw);
zDUxBv3@SUJjPm2RBEPmApVAfFr-3gT0mEVuTT9#u6B#QdGRzP_MRgDZz7@6*k3OpY
zy(@n727en;qjenw!SpT*=x>GL8*8_`g$=deNNc+k$*}zR4fZ97=0n~b@;s^Czt(np
zQX09pmm%kAJ834X63MXq_zhrHvEDko%*>iffeg!!-+<8$j!>vEBmcWRq|_3(D?5%q
zI?xK_m92_aCF^0e09|zwIM6ZBd5s5!ZyMr#Pa8dE`s<7hG5MkF+L9m!LD-cF8m#xf
z*b?_k7<c6YOefP;ggpLNKEn~(R&V3yB7fPm$MW}%3LZQE#!neaFe$|6BvCF(pAm@^
zoFSA-a>F*X-Bdmz5-2!+gn7rHO7TXTVpM`7u=8*H;1Z6DxSQ9!-$p4p0)c-sy{0kr
zq8o!N)6%4r907@{VrFHL&hk}J?v+Ock$tQ~0hoAsqdL5|49Q!mZ6Q((Y%SRV(F^{n
z_7AxCn<NKverX?Ap`Q7cS_+TAPQek5Fdki=6=u0dtE5LDq)-XXBT3R^*tNbFmCulb
z3@Y(k6f?yby3`tON*@6U2~<MQl;*uWcLtWxuEbJ6_c3cX+B{Bug~HmIW=5r03g~VS
z-o-CX{^JJ41=$Y>rC17RFz@$YD#PdaT|WA@{OD4FC7AbfE<lH6o@7rp*g+|u0wINJ
z+0QDqPNcC-xvPE#W&~=44Y~;X3qG<BG%5)d2%H@H8~Tr?(;8dzT%eWuz}*Z-yR^O}
zaokVK@5la7c5X=$gCG>$(hwfn``_4j{1Z*LY=E*zQn?`9^D`x@7Y=A@1%uXU8SnSr
z75IfGFPui3t$AmRcQ>Z;68yrG8_sm@#7qUVr)^izOY93z04l@pL~(=mrl)*YgkZu?
zapR^ceJ*7mG<^wt;fX(G=!k#~88RVpH^JYt5(x|tA6%iasj|aeTm^pN2|(5Lk(nCW
zj3Rjq&rA3VPXwwyy=&TpEXv_BL`#xTlYjqEDbM6S<5abO_7zdMdgDlpSEN6E{+CrR
z0>5WuHOCR2VKDy_>>T9C71g$S<BX#3GeWYD*jbyCi_l*Vtx0@S#k0^h>XKa$mY^4I
zD{p*M3Ve%f2SXRy&Rr3kmNt(SyHI#bF@9%u75ht0mX$}C6c|DVcX75?+FH_@*4Ca0
ztGjI^8xzjG`(FWSxb+lTWxOY#I{x+zE-wK!+}2hP9wIn`F-aabhkj3pr%n%}%@KW6
zf6Q*?)<cD<;j2x~bmxPJ!s^aJ3|62T|CF6e4#Xe~L$B0Q4C(zZHhJs<Wkgo9i$)eS
z&IcQr=m>UIw{b!kz%S=7<*Ol0ORP-v4GV?R=j~W!Ts5Tm*<)>YWzc*xlCy)*e*l>V
zl*8{2)nWg_mgQild^MzyB!#MF2Xg;i?Lw8Y){w$|q@~7S%XndQz3bmj5lmT(&5Kxk
z6j_PUN#s2s@jBw<dGq`SS(LS>mT}imo0+R<P1R2C>sk0n%3eclS{HC4(nvw*QtK@C
z7LqpkYp_JfXa`?rThDfeT}Im}c}e3*eb|j)jQbpf{sT$KkzO;=d-UvEo~O5y$a_E(
z<%hjOc+gWqm2*8J8D80<uraICovN(ZN1jQUZm5MNR-A?%4QH#WrJe-dqY>$<Jhjl&
z=x?>J0b<5=LveS9_s1y0LK%z_q#eZGBQi<mV5VEq8?dolavcTVq7npi%E&V~r}V-9
z7ECgnHR$CO?&I*Wxb9v)(qoFU2DzNukZY};570%|S?E0;HSAF1a%L}^B~xSmN7=b0
zI}n0EbW8KFmAn6qg=4;e%&lPqq{=BttIcT&cjRgS<y;dlg`dB4>|u%XMdg21BN@uQ
zJMkzqxM`?uuccK3B?pHT3TLaFI{%|i>V^U)$NPuja^3=J{?H07r5Y$XH<UhKeKNpZ
zE!1A!lByPYj*|$<Yrq&Rd%Tmlp-jjzh9t;obA@)iD*e11k&v?wO1@uihBfQau@$-@
zi`c5ceWF1v5fjK+xpzW06gW8$-OtS-^TMmnm#P)Iq2Sno<TyYWEWo?Pf6$8Dkj>=b
zgfBb!fvcj-)k)ourC}>J%O5FiXGx<{D|ADaZ~$wYj0Tsi6@aQ%?uL?S=fva&FY>~c
zR%>@;YEGjvsJP4ZP0cM<D;`79u|veI|K}d}w&d2f*U86FbnK8xDaaYuCgi><{rnxH
zV`uQ>>oOJe(NS5VY9(YSS#|(YuCI4p#pTwC$WU_ZEMCJ6ZSBgb3J|rVWMbt|agzV*
zM}oQD)qY%%4`pX?1wjbH(3TW5j{P^bgc~xmPqqLLaUBt3est{!26+g)Z|_!*<o{o#
znA}H#96K#`w6h&jU#{Lt6pp!%+sO88C3jBU5PmcCmm-LU9R}D=0*j?F)I6(QC?yg7
zI;!vrgrPI@#nC@2wIoiz4h9&|VH>*@J9#2kNfJG%Lu0@Sc8^8LiaZrX!mE#`*^(iD
z$%*h+BmWU3K7Cy5w-d#^^u<$HqI@6_spuVHXoT$1TMk5>70?F)lZp|m`{{(aQs_L1
zyQD{8;=pP?TkSmmOAgPRCC~@j;WGDT9AT!W$I89;3g`p<GwOJjpdN_k9DhtBy!#?D
ziVfhK!9NuUBr56B8ZW7A<C^Khq=E}U;82NrIG;S-e$b0?|ELkphqEtRa6};RnP#eZ
zORx~cR2<s{y>SZV>(BJrufRfZaHt4kC$h(bs;)-<qsNNre}h?co!`#nk}JVN&=2FP
z$L&DqNA&30G>uvjWPdM?yME@6vUACmAOxZ4mP+xV?tf#=F>iuc6`AyqR7e`Hct8Jz
zHVTe)bJ|}+RK)P;%_qJ$V6(v?mtYi<_K;J?*^oe?y7}Ocbj9X)@yjB@NCkwbcfzsD
zPhV)?P{0$`nW=yf^+q`4&|~B_8o%+-%jAP--7Mk^r`us&?JfkJd0dqKXo&8dbaaR$
z?bU-#K`I|aJ@2N#ARQ>eU_M05m5B&Z&%0SV3phhfAUej+)>KRU<9?agZ$dJ&8TfZo
z`L!Xkaa7CVIkB03YG_9Wf=W0AZS>hm_^>98mx)wNh<egZd7!D*g+b$<K9v)qo^pfH
zgq`OMfZ7h|C6g1Po^jK7E9=O?Y(i_hDE!e5?@C23o}qoi`-Ywm4M{;zmqAtfRBTj+
zFrY%=3;=ZrR0M6v^0_Lb^qaaL%^1Eg8svdd?L073Q{f}(jBrr@Lm)+C+YW;%lRcu&
z1_#&F0q{bB82H?&;1O+GBq|zXLTzne%T3|eUU&x_EQX|^FXI_o!v?mOA7y8B1R)3m
z(U#E20{u63dHltAj%k2%G9ux!yRTA=h$i+LY(3`I3+1^}i9@0&upxS1i1i?W&U`a2
zaYz&uHds{s+9?<dEg8})91=x!4JkFqg4D@j%G1;mheRO*r*-}{_G8vtCx7Z}TPtx$
z6y-ICSHo}-oT!fSX<Olt=(?L5y~Xv9lbwAeb9aeCqNuLfHjp)O8YAfb^w9qc5>jy5
z8XNmUrsCDCCu>;+LZX<1GYJ5jlGf1}0N976UrJ(e(`bW7ko%8JZ0jWeiF%ZX<69s}
z3txy|ZS#(-bg4Z`-q_}I?ezJ@nA|?B{ZbU&{1s#^_*Y~H*yLMcg%YBkA~}W~4BfqP
zNALAv?Ux6?&Go&<Atc!dlug}a2@;|xvLVBbAZ-}mXM5N?m3}gcY|g>)=r1_qvlLxW
zf`lkaZ2WM9CpLf%&6x*&B}j;LYgCDHU_0^)4`0AaI~n0r2N#$NyQ;q=ITHPG>6enk
zY;hyz31arpy6nr!xgbBv&cKFY7zBbV;kppK|6=_|s#HT0nFUZp;(+bv{u@~fIzzCr
ziw$W#;_X<FSc2s6?i!zla-xFgWb+{QLq^iZQLxTYfk_!CY?YS5i6xm0mJHSM1It|q
zUC$M`V{u|hW<$@0w+8mZ2+6q)V&A7EJ5x=*M)E`zPrvGEY{%-vc1#YfjHvHIRd`Vm
zQ`H0B>H>FCPJDz533mx8^T~tXzt5eOL-(HHNOdS!wCYPbRw|aPsi-Daag+;o^<Lj+
zs}tOLIpSoL3?YouI3@Q!34WiIeQ|PDaPpAB>Eu&|v>ihgOUxW1Tt?78WUN2;mfmXF
z5;I3Qix^7Ukp1V-osKObbH<D@Y}9%*$>ol?WvF6_n1foWJZy;3(p86hT8=7~h&ge$
zd(Fk_P{B$aLlsN79I{UrJ3`|H&q?Hmj3i!;zBu|wKuoaz>(Xf*D<)nJwop{6P5cE>
zldY7Vj;V@y8bGFXG&;cx-4FZN>mc?+TG9maq6r;6ur##S<0SZfR({vzhq80Kkr)P{
zXiI)zWBPAwIr$n)W;HZ`BIIDe7Y_Yrh{>bxA$_H5t&$5~0-R2QG7sFs_9DP3VO4gZ
zRdt!V*^i*ejFYP?>6*n3&%=luql2%_gB2z8$quM0hNuM62aNl)nX|+_*%oU`VjrW@
zexHdXXH-%(iv^`JyRx2HJ3sDe%I=ghHM>Tr`WCl(8V|ECp|6yy*}5Qz)1DJ|yy(r1
zm<q3DTj=qC+A;PVvubbUJFG-(*-?9g!bCQgx+&U?Uq1UEmjqp^`(gvgJ@bIkyAMf)
z*Rn0hQhDni2y|I2oon|JtwmcP0C>^l*}VGk0BM%uM+w!U?ek}p?*3rTn2iohWZtF=
z$)C2*ztR0GofaK4aOvs41ZvTsx?vd>%Rd)0lNpP%N~jhMvKv^z8=M6yxR=IJh18-!
zbu-;ABvCWZCQmLsN~jhMs+-B{oo6<xM`g+{hQE6wZm#l3>efwAds(KQtO^81TLc_a
zD-3BKt3g_3T~>($qwQLM{8Srb0;O|@=imIr_#b6wltVEH0>LYZwPNpovA6U7keZYW
zkOtcd=<b}eV$uHiLC1aJD5=il%JTdQ3&t(l9}jgc7Z?EUB)w=@N-!9==*yv^Pw)4G
z&`AY}eF=Te$%e-<eMvx{fB@u~K!pb5(J4noJ03Yqj_wy&^<Cn@cr?oy*njHBhoiuo
z_e6;Y<Iyaq>!Z|i-iF{Q4FD@R7>`CdsAK-Fj#^KZ!1<xQl#qA=veY<&I3l)<Z?Vq_
zdA30Vs#k{xs}C@(W1&{{?UK%F0}H6Tuca;QOXPDxHlG|vO#9y-7fR1GWGF#ld^5^v
z>VrEP7OIqHEk}PUNx60qJKZUc)7YNBsN73z81EZEu9;!5H!0ShG43zH&xwgAlX@);
zqYqV5>Ob~<cvj#r-lOs#j1_uGt}tf{_*sI(c#n6+ZML;wV(DGa*1Yer&nXG}CB~FP
zMFbimbr8Eoa8|%G-Xla#)hZK)j^(eXGv-+W&v;;0HM9`jxV_79LMql~2|VN5l^y;h
z<A33s@ul5)F)P*UkFqmJmKX$q=#@-F)carT^IUyoV##(E)D#kJu<iaw*(n!s4jJ&@
zAp}1N`Jlc&!c1FJUNgOVdVugilDRViv@<SU2C&xVFWPBv+OV?#mCL=K(UjXvcO;!M
zteIwd!z{XV-S3q(WjE8SCkTv+f!dhs!BdYFm%*&wvq}vR@ED27DhjtZp${pUo--kf
zzuUNJpHHlk6k_#kowqFU#f}l<8%iXDRy|qAc4p<b^}wfH#Qjc&Z1){y`Q1HS`5LN>
zR>Ybyo#|3T^tp^4aC&3%brb#Y=l7EltrJ^F{I+L_8Bd|gO%+ETOj~tHby^9<EiVHs
zJ#D89S|x^;s35#@5&4jlO#@k5fzW`4ob4<j-x=^HzL7-r3WtCfODt&@kq`fRZYH^y
z8zBE~+sQh_ZlZrKW%GR`<%g<meYr;nRg!^zZ95pP#e2{~=-A0gy$JoCleT@DqT~V@
zIqPhO-o*aSh#Rv~)<F1*U$chpLo<#vy=@<*<pZvwvJCPAoIQV(ok0@BAP5A%WMTs5
z{~uf0%hnESN-B2_L}8GDDFMIV%{UF6ZDvM%s#qt}6>KJ~oyNA`0Mqkb>W?&=m4stl
zcsr3A$nxD=q@Qu^8DIZR=|nP1LoYHac(AeBu7I;!F6KSgcQLQ@pz*R{dhHVvn!q(8
z4E6v%aZs3*+p@lNipkZal#GknCWTQ~*jq(E#!YVK5g(0Z4&%66{+lJpW|}k~LhTa(
z%S<~>R+6W2Q!R3IS1-C1H_f3GW-9_UE;3i_bQlLbgw7Js?35B{6ADj54wPNoHmgd{
zQKbaiMCgjPGDNH>hr?w@HeP{l!s3ZP$#i|3ady$3Tee@^B1{1fbUy~q4)&Frdo{iE
zNh0x(FC!J-jZI|f_0=jOHLfI{sah63>C8g<xn+Fql|<s{lxu8<=_3Q?l17aSi3cGC
z!mP8P60&$Y<`rBhES}bn=Q;xl@oqes-5bVV+#+j{kr}3nAmldNvb}bTh<YH4)}htX
zI#Y=CtNQYx>`HPVhC$eu+AKi+|FN-q8`C97J)?+1Fs;E~K9SrcJLr=9i$2<p<(ET;
zETfH}5)9iPg4$%ff((Vj!?kG$ZIlNta=r<Z5_}UD4_h|WWk5p`Ye#NQDw;AbES`hx
z9qwa6w~6Q6GX5Nd!sNMzAue5b&hzK#Tq|kIxR80y5$FiLPsBHndGdNiUB-pV!{vrZ
z64uUWZNu=3PyQ2gk|&N>LHo>YkLe3gMf}Bu$1^!?&zS&fLX0%GW+n9(|L5@>{O5uI
zKX9LPQjK>G{_-v*JKLiARcGB??)l^u1Q(K>okV7C&+qNXqI6agY4If-JAS7JBByjx
zxPsb>MvE^Y*m0)H*>F<#b8c9EIdoIb;ao9rbT*4AZz=$2^|UAjUA-Bn*s?CQm6TL`
zNm6oYY+vZh8!y~F<Ig^kf(d7%Kyc|2buDhJS0IqcV6oP7uF9yC(Qo?AlB9|+shS+^
z2D&obv!~gP>1VG9phe^jTqwbvc7Ah#e*vH$W#@w1Knw!WD|!7L-~VFeIZ|6gB83ZB
zE5e2W*7L5jou2L12wLf}Ka;2LFAn|~5Z#_S$Fm)W#$gKUk3#o*bV8u$w$v%LE$l{F
zcbOiaU!43g)GEGMYM4C1A=J`jys7g$^W4o%3Kw@_>8GrTs8Rl;h$<?6Hhbnvnq;?C
zhZY9y8Ssh92!mzI6fSlY?&ZanErmW&nSOTAUN*JNmO~GoVUy^FVKF-pT;;~;JLrfM
znM4kU^)jzq1sHo*ydXPMWD<Fc9V)T4nVTuX3^7S)6g{qBZam_M#-aqp$IfUJIny0z
zm&bpJr18$tGX*BmQ~lUL>~Yzl*A_CcWg_BgCYd)6#Txw<Ud<GkM2?7MN{~q>%5d&C
zYv>f2M2?EZAOb>cpRgFc_{nfd<d|4|0HFh2nBaHf8{bng@%3^5Yq5Axdt&3A;*!WQ
zv1tFeQ@*(3>kl58h+LaY94Q*K)s1U@6c8ySiR!g8fsnB}9}unD<Ik8;RjU7YnPc`J
z%FZo|K^O$0TdH~D{x?=``qPm%Cv1QdV^omKOl$m=nRWe!c$N$qI}#JhhtkKN#gE&d
z*{dH!-fTye(D2<Ddw6kaucJk8_T!r@=*B@G_$hmCdxbx;8Ltx)xCh+HQ?=VqhJV~+
zV>e}WVgmO-fegC3i^~j{{zy5Un6N$76B6VCFf#nXNso-ti3!;Qo$ue64&VKYkV)B`
zn2<e7B4?t+Q@slA@r{~F0tM_TjX@N@60)>X<6X>TfK?RBF=Dz0r9)>x={|_OS#%M7
zLd2|SxH9z}(U6Q0iB)0J>7{!O38ghdZJlx<F(G`)KsSP6u-o?|0zMh55UVOj$B^wB
z{<`ca?q<oNM&|_>t;)%8$kk5*|G#~z!Gln=e*wBRWCfpRF5?kmD#C+aHvltYjaPgI
zQx+knB0TIcKqIhI8Apr$zaPr=_!(Sk33TIQ;7p#UT+c-B8;xN<%vKKKZWgTa0^}MK
zPunHq68AZihqZ^Jj=#=~22PKjOXI}9<4xJQ9Xk-hFtjC}#`NFV<#0a|<LnM@z_X(S
zqcO7dRoU9oCE^VxhR!+p?HdUtcxXE!bqF%qj^aoqJs=Sp)~x<~QOEx<G3IsUs`Lva
z<21KefFSgj;?oW!6yu>r&%>@s=}Ow<Y|VAj2n}oB=dhzEhUx155gk_w1$d}Y@-$q9
zGqiVdUOdtv8fF}Ldc)_N((sWVUmc-g#(<{-1aGMWtF+<>UMRjpjgDu1G@dQJaTd#u
zyCp=!td0k5XC8ZHZK9%Z2R*{Wtca(wpEU^oNrW%?KXr(RSs717(O$Ep)$gkleS{J`
z)Jk~RH5_a#r`n58DU(Qqhgt#8VqsHP^W*x`k*-R=0CM<Ywbk`XWsF;=-qn7DM9j6w
zDkCmRfIUvEBOx9t*}8pKBHelD$leM@LKz+^HcLm=-NJl1FZP)3N<X7v2C4<?N%p3M
zInznUA_*QU=gT7&Y`_i9dQtfWj>8D6CRVsNfnXd|Z;C$yV%8;_Vv?-7`(OLC)IZA3
zD92(DgrZxr+9KWm#)e}uAGfqGvH{YdRY17s-*hF46tvYqJfI=o#rc%m!%GYgHyK+-
z7lTJ$q?1zjYzg4uCMn`cmCzt^MN*s3(+a=Cr`(DJVk6?4_)|vDr^i*Q6$;d90pfY)
z@pH}OZ<+q|$5fim5@V(Vzguc1u7E*&Dq*gJ>V@TJph5GtD@CZnw1NeKNZ7#~H@1%*
z+u#0>ERo5`!TKS)|FVje09CP8%@0z1U^iDgwk-c}$W(g5ebc(xc@*3<{p}CsTCF0U
z!D{Oxi6vPD3*v&cicQzn?1wFhi4D8o-VmtONuLsW_QX=-<rlBSkb<>ZwJ^jMQE{{v
zKbK-ip;}RCb2?=s!FZX(w-U9(wH*i97)QaZU5s02+m#qnyK%;W=E2<<N1LhkQKELZ
zKQhH|2#P>)Ky|ac@hWlN6KVzLCN|9kOLOK8Qi}5)nmTcDk@CkS5b5aNXa877eOMf5
zx=(A!mR?y4)+%%j_dm+c=m=sE1fng)7!~?&?0DW6a^|D~CWA>}aoP3Pij0<ry*P03
zMs&9BDaQ?2s5mTW8PY&=4MyA1gYUDVD~YwByNg>T7w8elWNbIYE9@YA@SudKj3w(q
z;Fp|K|K(UgzoCNKvDUaHnQ_MuU4+bGeydeR!O1CRJJpxz0vdtngGJ1*0Kosq`*ZY=
z5tCbO4elLUJL{K|amNr(!(mZ$s#zkS6crqM$}mGb4`-4#uuH{wA}nU4{4&Jp>)aO>
z(N;6BT86|yYQ`=@FF!{GW-uaS;j10Q-6lhwxQ-<l+v&+1s;!>{F5AEkFAAd102o1u
zFCJja<f6L%h6zhY6{C*39>jggg}cZ==#WX7B2zPt9{D93zBXFt1pkSWD`Rb)G9DRv
zEgBx>dJM%pI5V~%?_5viV;S7opF>9(I*D3mvG)n_lN%(Btx<hw6<X|`GCmpV`8HN)
zam2$<U8J{z!25)FzKvm*LeYg`@<V;Sr))CR(`^d1cHSN#tQcoEfb9=u*LDO!2*O%Y
z*%i}&V@Ldp+}%h6j?4N87?SINDBXtX%f4{~W3MkwizTBBDB))79|pi~R9Txh1OJYP
zzG;9O`o@fIkiU^GmjaqZKY{9OixpIguxDOv$<P8ywxN_*>_THlH&S0-#m@o<(Z-!6
zU#2pViuz2{fs&^MR8%L>M+b@SaSe|*=NsND^M)EHM$S*O0;)7vF144eC!nf2hOG*`
z275T$lMq?SdIE>6&NM3Y57L?<IxEM!0QaEgSB)}5oqkMQfS&s|OZF2`RUK9%-CtUX
zkRX%)rB&vwdvZ(KQB;v%fUBYZO#9U*`L&fo8VTw7Xs!4-KqxnKmLYG2##NCVT#fu^
z(qcUqabPFW2n1~Q+zkAC^~q~L1^D<67b#iiv0CwOfY5EWDEN4Gx8|}h`@DpntewU7
zL5gJL*Kzfx?NY%wLbvG=+D#aZWu57>6$1na*M=#}jB7U_`$~n7l0^Z8X|vTHoK|bg
zEdkVuKLLbj)1MDz=Z<7C2m`?@@v|Sg|HXFN8wo)bN*xdYmIREZRgZN*gi0*a;zmxT
zai_GYc--_!57@hn8L33>wKkK-eSG0frAPQjGFjY7Z3xT*uKec^7v+#CfPi@y9j-ho
zVz&vlGKz>Z`~X`_bYA#vIFJ6Hob6)h^CAu}Jsn@`zD}RKJ3lugA17pZ(?=Ma1vSs8
zSZ;=dmEjVY$6hr&&iMMn9xE!FQd9!-+^f!vD1gqd8^P|zKF^6WVx`9kVXL+WQ0R64
zWtar!9CQE_KLu_$4eIe)B}F7KXP~3sWa#YN0KC>3Z}n0<0&@mBTE>dQq3UUx149VO
z&<M=wZ8~LR`waJL*=R&FzyNcK8|>;z*QV1t&W(^W1q?8!xZ$|Wo7Afq4z#h}41Jtw
zr?^oDfO7s88ooBdgbXggoZ^OejHfD0^Q^IHtV`hn%qeafC{@+e7&^3OcSE1&!$0$@
z;8k(JWu&T7R2A#snc8FV&B3@=(GU-oNPBrxX8yJq=X`WwSmb~XMhPwy!F2zRvNKAu
z7zBafl{6*+?tihR{d$D0ROSMfWt0qpJ+IS#J}_PjJIGxp9zA__N#9)lOwA7i-h>}Z
z+kT3`d9>UZ_of)7I4M96Pm;o^(40jF0UXom``t&IwxUETF=tUGwz;iu05L(%zBYvV
z!_Y6&KI+)MS<VBOyR%oPB=&xkzMBjnZo9fj%SM0pp`iEU{{1&X-ZvtXN1mSh)5tFi
za+RSMm8rnP;~M>jMFQ_fX}e*2oH_G}Z+o<MLxsB^rRyeB{FK+YFFBT^b9@>4Wj%^k
zHOy`(3b5v@Ukgd({iu{29BRjDBTo!~|8`~+^nO%I&YD-|pa*7?;odPe5`8}^BnL&7
z2R*}7N;c~PO2Y3)MdZK}&b7`D$`h{+!BqJBQ3*M@79_gVk1~PoLRbRuM+M{nJzs`t
z$cTCO=qEAwqvCP6B?qj4upid;pQ6qx8;8fsAm1>K_M`V4O8ot(bR4X@Qe@+ac;5f8
z_9Xm%R6Gu>6Z|mz*tN?Z{uF`sOUL=6?A($h2tgotC0`A4|BJ2Z{0y?wAr~+V+eR!Q
zi<r%;_Cu|z_2_;mDfqs5IF3M5m;Q8t%BXQ`r&6@(ZCb0eId*r+_GAuAlF86q84f<D
zP<?2D7#uq{L%%GEOIqnrpj@7|T#IE28AQHK_tr=c*1Ai>J%7R*Rf>;q(_J1xV6Ec-
z`bOz?HRYF&cp!1swpg2PZ2nkKwla8pJ9s$bSx3yQ@)3*lV&s?g@Fh50XP!o7u^RHi
zyczuWiX4>3HCf}m4k_`UKRuIFe!E*;jPrYr&dUljp%wj`phnhm1Psk^>g^!k6zrmD
zl1IRReKRfwf0_0nqSm@O(@pezSkw$k-kh0L<w}kmN&JsY9Ziws%~#sMF@eC{v0slI
zN6oO_&6nDY1{WKu<tQV{hMK~^o3FL$EASJQ1<ZL1-D8>|w3{!rAq?Rj3ur`61f8b%
z?B;<tePso3DKM;)h=tV*pM8C`asaf-?r7Sw<S21P?sJ+?uJz53ur1=(eLFw7$NJ7^
z|D)_&k{|{_AbKVIqW8bp@Z2F2OBdO8QJrW+pgTbO^+?@}cDTe?d=$*o7lHOJ;_LjS
za%CtKcWMgjvAq!DjgfQ1Tf<T@OYisU&R^g|$o@}=x%#MOsez2hMt_Of_l4V8fG)iy
z%-%0>4<Y+{q6Le?s3lz5TMSuWLLP2Nd#v*jA~Yjj{OXHxx<R|HH{}{!*uRBA@GIy~
zKDLIN<-<@rDl|#{Y<uH@kgeawGB^T8H&j!(0RHA<Yqt?zU;`h6>#Lv-gm`_MVY!C=
z3s6yR<N{&A%oj%dHR?=8L@Q(glVVJ}z&?<&Ss|0{<9B9{rg{VY%}IB|19{!dW`ycB
zG??gvBs(%>PMkug9i1d+tayS2?O)^rA6`;Jds=qCGfR;>=x;t;iE$|HZ}y!`OqS!R
z>_O|@HVW5<%ErfhC_-F+mg9@iI|IpHRm~EiBy{?tncm}u{h-E9k<}aG)!q_LWJseh
zzj%Rth`j7x1`L@<<F?Ea=y`?y`8J)(O(OFg^gdYNKg!N1*+LkEp<5ED(!2kSJx+h#
zP}GqPFitBrsUg{&4!q&TP6Sb^3*cMQrtz=yeXIMj99b3a_Tx$@XnJsFtJ~NCPnwV_
zehhJXMe77Bmm-sQX`v^bS%Ob!oy!%p!|ElzOA9>d<^ZQM$DE22#;g__E*<=|$!-GX
z2t6NEY|NU+=pCDMoK|)>%y>Jd!=5kyRQhpEEdSWRuu=zZn6Z^!_p$@ea-NmZj|kL!
zCAHTRp@q;aPiml`B6@-FI=^`ZI}pt>eGHyt%D4Mc-R&@4S_sWDdn6JH!F53RQOD$6
zS`f{AyQIaYZOFOy;a8r!1JP{eJKE*{FmN@Q$IbcM0%?|7^5la}LMj8g$CrnGUXXF*
z%D&ivudwBtqrHRBMrudYml*bvL?Kn;b6fg(L9+1;5ymG&JV6q!Aid*D?dK)Qamdjw
zSV>}da_-%z9ekD~IItzV80roLDCHlwYYU$x4G!@;csx2uiAQa7ZQ--5!BIm4fo}!V
zu6yA(aP~*p6&+Cwg0Pho1a$w!9^nsZ-<1V8j%zhwNJ`wa+YgV+tzbdWsV^EvEpV0@
zIJ{Sw0N|eCdZ5y5RU>a}_<1J^tu`nzmZUqFPsTN|An!-#nXn(M(-3MwzHDCwpC%47
zO+8|tBEOa+n^(<v8E~)%Aw{i7fjWp!@(9Pj52Os!!3XEu$IyQYvaW)}r1hKuA-_*)
z|0zjc*H{Cu#E|?J=7+pHfKo06DnIDFGw?fLZmt6tY5~ej!NGfmC<mLFo?>?}-z9sq
z9DzVFWlb8@8_=i)`6OGdV(UicjCE8g;?qVQT$WUC5PE?|z%vFIHEr#ros@4Jc_`TZ
zc<J#bzP4c0!hD)};#g58Jo8}WatH1JzQn%?uO_UQ5J6R;mZOFEG*iXB^IEVyhN0ZY
z(C^jA`@~zpyzyTLJ41zdZPWpL*{q5=+#g_f?q7)2d!_~WvQ-sJ80$GU^Z#+zeuG+&
zPxrmPZQe9HdN;TNmb^QVFH>;V3LhLuiVgcwc1Af6gCG#S(kfco`(JG5^$%$qN%os;
zsN#sjOddJ(UV?m)gEM|GWd<4~Gr1Z)M}AF6P`_y^93A%ugV2|uh*cn86u)uC*bys+
z{-4ufCCC@_Z&akQ2I;rw(6pVv@7V}UalglbL8}OHr;2J7$QPt<=-@cuM%S(*J(5}p
z@CD@?ZI;R9h_MX@_u5YA_iV(seuQ}iL9mn`mi=MfDwuCErfP^6A@{4ze#~nl@<&D@
zPQ@-kwS)E7ANoU90cMLU)j*$Co0H!h`66Q_WVX0cxpwm4*@xTt^-JwwD?zisy}6qK
zx7m;nNNXu46=W8eH`rq9#Jz3>x4c41u<Tr|;#4;dmLG#!{UO^GU>3+X2;T^Ubfh28
zE6ZHDl^SM|eKXqupmcaFuy)tWzg2))q~ECMot+6g<VR71*a-cR@7Tm?!l?dhsGA}r
zGj?LXrz9SZaQ=0|=%R$=P)>IRn?(T}{n<%hRkh?)k<ClH1kM5@hY2cuzCO&+s#ybn
zz^6ZDXOP7p3<A+BNrDpYf3eQQMN3G1vh0TXc#V#9_>=2~e>t2Hi!;a;YO<$&0_!FD
z6zn+obaD*Bp+4cGX=2t(@+nwyc;jF=1$VU|8Ah&Mkxw2Dq|KFfE=?+*y!qK%l23j`
zPooNxI_OR%0YTr?{@)Udgn6_CHz|^xG9SsbBA`4N0k}uS@E=Z8v!~XyB%lKRMqCFu
zuUt848_}Q@2_=DlGwB2}<KGX@d;%*l=5GkxSLuus?_q5^tK9ml$`2R)dmgza3F${C
zxBJMtuK<JRAUurvaL7+6zQ(WIw4<VPWP#wgN@plTTO)t00)j``xYH<;<HJ;*o_89p
zfP%mGCw{t2G<lm(#$z*7&|d1rx?+r%Q5m>!di~#A^g}=52!|RKFJMffvCVX-z?r{f
z;op!Y#@rRIAm*q5tB~d|SqwStpmf*9<gg49w+d+<wPi__W#XBf2lbife@+UhdDM>H
zI2t&FF!&4SWn-<Xu;x)b8US#{o6s|(J{jn*ivRCQWNzT(;0MSU4Ea!YE=dl9FciF!
ziID~Ozu3I?EHXl47g}YfP)dM@KCLSc^Yj95UZ!JU)qrl&V$3GWfz=8XUbZ6#$DsDy
zZU1^WrIW-fi;iJcqZ^nXvwvnPM6593!O<=WgR4nOGUk0;|6Gk;a>tAzM12|6v69(G
zj!qVs@KU<5B!}D=EXARhoNd^Bc1I}4;VEN{#ECwv?-+jcMJ&dVnr1@E><pF6)E+PJ
z;AJ|f)Io6aJPe7zeb6>czxX4jIHZ9`r&5}fV?I_3*mjw=m_2EXVA1KsXx$ydFN==b
zkSELm-+KCy-Wpa?WS@1sI6Yqn7uY#kT69H`{bk>5*m+rE#4$FCJlk-I#+EmoRrJ@n
zjI{x|H}BDRd4#50Nq<Gy%}sPAf(0*j%kZN&BJIZR=#@?nsYmy`=86J~yqlpvfSgS2
zZ|`Hv@{2e63NLl~t^03d(;5k~icE^-Hed+g9Zcr&X8OBZNy@~68$;L8(KF!Z&J?S$
zijw)(+x$>=ZbuM<AQWvWy8>$ejV;Ih5|WHGz&MNv5AWlT5`qATT9%;ze-QZP(EBR}
zzB7pK$waI&e=n6zqXlBW0$f4sMRL*BN;j~BZQ9k0uiM+*kBmH5XsI9A(KcV$ZWI$A
z4}HkbcdyhB?4mc`Eh3_hR3J2toa;(MAkj8l;JaNuaHH0iFLtHAN?4w<`3CZ^Y@t6h
z?U=MwVRx%3wYeB}y-iy(5FxfzDy#%5F?*|qET|$!dlLHP*Z~1IE;v-48w5wsVn5%L
z5fn$4rT2h{+HcNXDYF51<NpyvmU(EEJ`MsuCnO+mCTK4lo5cTqb`tq99U7FwX`@HS
z+0nkE-6W(^)O81mUp{ssapk{mUP_XsXtz>b*MJgl2)<x+;Ei?5PHNps#a(3=SrcPJ
zhPZI{v+7nU?z$~*&_``Bo-hZ=t&Ww7yKXe9zD5iP1<F>apM-wS$37(rcxdJq=;pa6
zu}a?%z&C0f)-SjC5OWgvB_CmNqmU|=BXPf3W!aCiGdhA81fgI{i5i~v-`KIaFC>`>
z4LCPm)D>YV5lPhF@NrD>>OfbahySrcBvF6k%YE?b>dS`4Q=f)@pOUD*p}4aTx<B3t
zIC;&Kc*kNsoKw8$BuTTHwA3rGW1A)QZ>qcqzGY9NDoSo2JBDo95|JRT370+0bp@qt
z>#@=3ZeZm0G|R<3Rzj(meA8g7(a1^#O!EFzLa89YK~&aA5+9e2nK9lfBo!J@A#pyb
zFkbkV+J|x9rz7;8@*5vj70b6MtzDxaD}`1Ri>UmY9(Qpu;-xH8lvUVIo2L<vk)P+f
z)k}GzOXL?@Po2|u(?QLuAC7xZD^+~l#058nk>A~Wr_A%p4tuG>l+k<BQR#M?R$^Gl
zZ;L81rM4m}?i@TZ`sMT?6HX<j+!AmO!kc#~LFZV=5Ty!L>OFX)5=3fKYfR1N2e{KU
zCHVH~SH90dXgJkD0|M#`DRfRSQH3Id>Bi}iN|-fBCr-u#l>jp2+H|LmA7$r~!!QT~
z(JO`T!2K^)zo;8b65&;M2$2GV8Qut+C$}$~GF3=Bu3=NH{(ZA7M|F!Elp^ABHQR93
zO7|PrUPPwhLDL`Ov7Qzy9#P@!pD3qx()Rn1tfU*vB$N{gm)oBQDWV=7>4uxcG4Q=n
zY}u<U3JFNZy0K$og^g!BI1bwFbgqcXbEun<GXXc9teDChxP!LeJMQA9xNph2;RJ*9
zx|5E-f6VDBs^FZ<04MYC9A6QoH=X^>w#0(?eK5Z%B=c7I4G>dPtCtdw6HXd_9}8Dc
zz3#9d3W)Qeo}h?+bU9Nt(c$%Q!8+~#Jr0`w7>{*3B)`N~R4_PwXZTAY{kY<9Y?hO3
zUh36)-artF$j9jpifXnB@l)=ose`6JI_<*W)bgwlHb+y>`)CJ*UiSE#)Y`2haRtw`
z3!8}2%Z`6TwXBf{ooy4ob`nX1+urkPxPcN#sE{e^q74+S0JfdSp^IK1cPnu!YERQ9
zLT&GPG2Cz)10Ko7sgADCPX8!717wFm5Qtt$Q)|inFZTD@>HH$rkqhh?Vj?8)_8=av
zJ-iH8<p%QVUSv55X!{$g{LK;X90z!`6~<i;lsED49C4r+;GT3QFIWm0WIOHlp0KH1
z*Z82XGr{8Dqy)2_-Z?KVZDVK;fL;6omw~q9wC%Oaa5FU1Sr*RS46|Lzu3n_#AFZOb
zTp`ejwD0=rwkZcXn=5y9q0Tx=+`?bLE8@4;+P|;8O|NI&Fg@7~>x<Yckig1I+W*g2
z1zt;k4N~!m?j{~R4F2Kopn^8g7&1tC3H!A4R-siH@Wt73L2*hz<uOU~+JKtz8(>DD
zooR0tK8+9SC1Jz4q_o9Xs|5O;#Ki|&)fSZz26)eMB>nqFPVQ2;j(2T8W74<Yac5_e
zyvsG%sNyghL?6BDT{o9S38=huCmL#n#l>L4f5Exa-7MHOfRo5zK{i~Ep-Il#mRYlF
z0Jq_l#s&c;92pWBq&&EOw`{WOM^(LFmFC5a*DMth=MRo&{Of{tqlEVp>p#lQC`n=v
z1fo~cQKNnTi!INOokB9HZ~>Acq<ji?{|C;%oimoQDqeez34!9;KQSLEw)5svT%bc_
zno0gJindZ*cWT_Uf>S9SMO3pwrj;SPL*nML7q(3iijQ4WVSQDK?Yzj%e({P5SKFQE
zu*fJycV6bEU}`Qbiny0iV*^bYzH5i2hP}9P<GfH%pRrDqB0N8NgIYbSG3wj%ZeCU?
z#`AVlb6c3$Be<JZVx?pd&l^s0dueS)H7l9=BJM*zmbc0^Sir)nY)gYzp?_z?{gTTH
zWZ=VFN4q&}Qik!I*_8c`y?+oavMvA3;jB{B*AFVCKIl0!Bp=swWys9W-JoyN7P}ct
zL1TYJ8O-rsQv>Z^=GJTJy~W*@Qj~Md-7tBIfRjcwT!^r$4CeT$8xEROK1lOi{kvv8
zMSl2@$1y6B9YQdCZX=yn!GGuEKvr2oxU52MtjNz(T4hM*7`xfxv4a-rXhD=VBhPM;
zoxBE`wAe;o-B=r4r0^vlSm%$jGdi{y1c7KvsEI=VjXh5Okn0<1fN?N{1z|VYexv@I
zpqId+3YlSD7(SnRpSuxVwApD(3i5_G#*Y^n=Wh64!!~LP-%ZOgSwTB*)PEaIp|$o{
zN3Jr*WC`trksBF~u0L<XjAZN1_Sq#dCOzZA<;M=-O3FMc6}YpBPBCQH46#Rhb}p`;
zhX3(Lj7PY>g<VK-z@1UNN(t-4p_?%lk3G#ge3fmtTmd?9<^~;_4ofcznAsmCl(Pv=
z3Az+!@Yl=Lk<ZQuTsL0)540mtSVOm|@1`pdCotXk|J2K;sYV+$x7k%nASaOBJglU#
zo$SHB#&cu%?2QnIP@Xvqap3o5vFwft#tB+e5J-LkF*a3Erg$z)|KpEPJWkK#FPu?}
zi5}U1*IFX5?{m`%=lx}V8ho$GkBh7zsJZEBh-#;Z<dM{7K6t6W71?eCHmZk7RWA$t
zQtyl(y%One{Oe$)qA}=64QVObE8s6mPRVGC#0!=E^a3G!yz)BQ*GBAbtfaO1N7>nA
zTL^<NcuPuaN%z08M|h)%-Xjx-46r|G3t#9|dDN#yv?%!|r8g|Fb8=Ec`|a8mf(|9$
z1bainii2L{n?2CuQ{*2R5qL4TFur<m999QRv=IEJ<eL*ll5@-)y20H8cO<2|zQyDP
zM(EUQ?k{nF<N_KvZ^&sVK`zp#(C@j}iu*>4j#!;z+RQTOIzm;dZ(;|h;X@o~*tK!)
zFOlD~0qt5OM0b$tcRn=rpvB%dHJZ96`?Tr5eHxFa;~u-CQ=w<a7_y#ooc9(Ft4B+x
zLUn4=9_g%n#MkSp*V3uVyP=)+{O>a7k*5C24t(Dr8{`rC5^!FjMS7}uM+?7ia4k4Y
zKf{#^Q|%2zi@$GLg)<`GYauVn-RtJt;qM!6t~YBMfq|iiS$*ywLcga(YjAR0dp@Sn
zd!&q$v!z(ogDPZuZs=f5)ltgV&_Vl~LT{YA?uv;`Ai=5{twr`Xh2GGyE)Tq{eHvAx
zwYdJKK2+q3?es#P>nitWcqIG(QFdlI5`-`ey%J!SaQ}<7%}0+yx<-{cKvc3IgeA|9
zk=^3B#O{z=c016XH<AAlWV)YbiNN)M2}&)@ab%}zR!6)kT@W-`r|2qWtT@{<C96Z;
zsKtEXG|F@FEy1eYQnmrjF>jQbj-w71&T~F{6Z=ULIOq+NwdwsAXQbLTc9c6&ucBPI
z)Gl7MSU?mTab#!8RTTeFoDq!)V42D`yovlQh^tk_x~0Tigl3QM5zANxz*BEzjm)eK
z@o7hoBV?xJ7#DC!uQz0dv7?8srOXIW{2sE)4Abgqy{;jtu8bVsuvn)d+#*%=M$f>S
zvy>SDiob#6;NaS|j=h>tFK=Q$3*u(uu>ckKdg1TF@f$c%u%ec$_rb9BX4h1f#95xH
zSaH9>5wb$5Ra@;J10++j;=<lcos4&N!%a21-=TL#k&AgVnXwziXgcNkk*{}3l70a(
zEA}z{m1!m7eB3EbhNmu9CRE+{$}cY@k&GPyoDmi4SN^FrRZk_N)hvVdhclu&gaUpa
z%FgIWf)E6vDGA7m`6qU?_XW&MNdnd^tI{gGhJJeJ`mz?<Unm|QhbID6v{6ZY$FmmN
zUt(>}MC+wbYh9Ce?l86v+FxR24qy<vUAuc;Tn}2Ih4z<NnKP%0Yy}up{%7{h*slR$
zPEaJ;c$G$T)~J^)9k{<l6Dr?I&ufRr8A#Tvp+7>BEE*3~XAz<7tmfSo++QO4#^<#Q
zc>m~uiLLd!XD1{Hn98^W<-=cIRlT?1{=$iv%BsVcjSp_WdN$>j?2ArR3PK(n&<LEr
zT{gdtaezc4Di?dMNMQ#AZ@7nzq$T@Okq!g<jlO07J(ipJtm7LXsYK`CW#%$Kw1`Xj
zkF|^gB$eo(TfvhoZW&ZaZiasSBO@2b6E5s3&}Gc|SlY1-5Sg*213esT!wtu7#{CFI
zP^tqq?Ks#mU>0?mw}e>);t)<61~?wb9%XKHlv%{#oLs(tuFX({do%DyG!oQ*O}2xZ
zKtWqw;vMl6aX7dr8wPVw>>ySn{i2=zD7yk2hCvYcB@w9j|BsDx$rhw-<O8H(Ob<Nn
z?qhF?IHpTpUA*_gWPhB*e*6_>XRTrY;HULmtgtj}sR;XX^q+$H4=qm#EZk+aO)E+J
z^QMVoAmp?raB08{zMlkt&Wdc>l9=t|*oI7P&%rCeZzJbm%h6kPnvl`&`L(Si^3NMR
z=Yl;5uU#Lk{4_ZU{+yLSVD+xX+udpM9X;<iO-1CNB{q=S2JXhoza6ZUaS-|?B{Mds
zx-^IgTU#^Vy<9?n8n^x%FucR3?$w!R{1pQM)@ZjegrR?coHHH7eNIQ9<`BfVp>K^j
zWp;+Ql63%Y)SM0pAJ`IJX8q>xUIBiQnbT<~+=~cJSQdY=l6?RNIh^)w56JH`2RXgv
z0x1E%poc?Zvkz3pzs!DNE0|A5oY^iHs<n_}`8A?sNx+en<L9a3IlU|1BIqU?70{>K
zh9hjECxQ0}y`6ljmOx*0qH0qNmN%gE^3a<Sslc=7L`AEkcFd-Dvl<71U%onu#(gL|
zw<L){5Q=U|B?|6;W5daO^bpFP&<mg}+Q&8ChvU>cT+O$SYh-{XC4d&_InCQWZ%175
zDZW=KT|sD(pM&ug-_L9!w7NII7sbEyWS*pERth1I$j50U$24vMNDM}P|Ei=A$kIsq
zbWor$EX)XU&PP@W@CE-H2F@L(k>iBh=^k&2pS!Z3qHaWaqIjSuiHlW&2qe;RgalG)
zK4wDJ`>WFDo<us1+z#afn?f6sS4t_0Kq4E5tlNR>Br|5uJnjnG(->Tgb)y=l%Z_aF
zUVW9o-opq-Af8+oR&lDYDxVt?NdSW&3?(mWkDe-5fL@^DK&0=!H~Y{3&1cG{l|l~W
zVS&@howncPj*rpY*V5;1gykrWM^`?sj70`@>PH3UJuPum;Sh}tk4>`-z)E2UV)2c`
zXEmu3H<vPPBBiVYiIzAM$}Wm-UoJECqk{7SA%_zX(#YT`bL9(qDd#`}A%`G8<W{~=
z_Uipj;d3wko`w^x3##DdH(gEh?jMx*L)jJJNDzXsFQGV!|Nq#vUN%|8*~kZoV@4@h
zS|9iO5aQNo0Mo!wz|$=V4qM9JKs^zspcq$9tCDma|K|+Eb0i%0*E#T6nX_Wt3<5Lv
zq(NRFXKJbYb)b2sJOb3_wq)A5(gscrq}`N7fNuO7+7watn`46Ikh3xnZ2C71pgW;p
z2nrVzURR;tcVt!{dver{eviPVb{G47OVrB-q8cY)S`y<up70DL+k|jR9jn>Y|H=R5
zBJ__f@lBgaXRp!L?6Hi9nle@a>XmRP&Nxw8bfj?;tGiN?r8NC@ZfUWMYRdwnlZ+E~
zC8O%EUJXYolK`DvJ4*8dQ|3v5n@tXf&uWDpskpC4G(WeLjX?7>91b&c@*PWFs{i2^
z&lm}`ZywG?oF9wyq?<xh4Kl59_gVOS&8*N%GqU?l^KGT+L2O&4)cu=d-3a}IAF5GN
z`bOn0_WOoBo5~?M3!?&|%aEwcZ5i)?CVdNz1Fnp}Wd09Fyrq`D2{f`t-HhZ^Go<xT
zWA=}-D>#B61Ys?S3(EH2*d=^!guR=k0ftf0fRKExTgP=z#`z%?RXuF$UB6t-T05Eo
zkqsx}lM`mL%BnQLf}SKej6#lp`SyELEk$0~{_S>>p5nx~h#^bgb3Hu1*7*k1)Py4!
zG9=dTsVnsG>)O#j(32o%z+GU!U`Jpbt00n=NP(s{9KePcYayuQgIUj^cRWw=i5pcm
zi~Gt(3wdGs&vvHpqyo?lOtSGF;({qnX6CJB$>9mdFV=xcJN(e;(@|JZ$>ABZu*Sb0
zFOogp(pOMP`6IjHC{W8ha*Q0E9eo8oJ90w9!Zw9L1NPKUu$IDtCbk?Rs<nM>R$NrI
zx-K2pXEF`|2*ZQ(loUmnFO2_jJ<<NJjYm0Rl;KpNNlOnwPvV>vJO+#0N6|x*6UvSn
zf}X@VI6I^_CjTiBY&qjCEd-q@K5->-_7o7-oa`&bdIzv%VJf`HY*lic@~cWjcuTTC
z5BeNK4opg@&=*;?ceNucpa*%51(S=%!~qUVT@YISP<BQ)5Q8ubovFnMbpORJ=Dti$
zr+NW|pp+yy&#xyfZdD{yv%Xp%Hl-4MJ*-eg+^T{P>x1n%W8GIflunc)W>whMGFJt)
zG4sW!e^z3s2UcZeG-_n`On=XGp#M-&PE^W715&!oV7wan&!j`O>30O%F6ubmJ<@cL
z|4>#=u$Qp@dKbxCKMvuvCOxGdb@L&;COsG3sM~rtfy2-vxLco+&RUi3^n1pN8-$j_
zUhfeZizeu^tKKa#KLnREZkApuMZ=Q~oxB_>KcM!-Y$M{nR+`p9oXdjp0|!lY(BpM(
zvGmiwyT@9Mp~~Q(yt`73i#4fZWQWNQ)#6lAmNaZx)FMaEZ7e1~REtBX53PEc?Pd2O
zSr(HYhd<R!lD3lG?Ymd$9NUR+4tuKHRX>Wt*hbm*(Sr0tIXQK&6RaJvQ7HYYbvXJ^
zdny7%@Wj{5c=jh#3#AV=sH$6`;+mw(Fndh<l30ZpMdg6yXVNt5+~7yt<k0jHT5A1J
zb_PihgCG$6k};t1{~ueMJs~C~*F8`v&FVmg=Cb<E0FTu+fA$njUz{Ch2A!Ef=jUb^
zmo;=o*!a;@*q!Qw`mpI#;~?_KL#rPkHIR{%{N}lO^w1yM=&nYyQcbZ#V@^m2G8lbv
zZk*cquv9_!mCbCRCk4?Lbr?CZ#^e9&q1MkrzpsY77_XUeDfz(Y8oG!w0DW;j9C<1w
zL8T#LCX{glQ>w{Baz<y8ppAs@7&}fvzpjS!;ow_P$}U(vpD4&O41IAf9FG5{G=uTs
zd$WZpLFQ~YdQH7_)9ph&XT;+)Bgh;j2T(>GjG~}3DdwO(CCHp9M~!Gs>l1fZ6l5ua
zzBo^gFs@A0U}hqlD<C7uoFPXm4erc{zopd8L#HI!!pAWnHp~+maasw%Gl+Xx@HliC
z0~{zfzFG~*Z3=QP3m*sTKXpEmjj8+2g1>I%!p8wfWDUIiHkxu+m5h4wmK>_KjBIB(
z4)w(FqNGsw(!EiYR}Y(@_9DTB62b02%FZnbVh{v^S5ib1?tihR{Uhp@T!5r}fjaj5
z`|Ho)Y7wT+3lK*5K)H$j=fA(#A2|J(X9elg23u~TpS$yk<|nOH-{#;=wb@E%xbzyd
zIWmo}pwW`XR#-`jCa+J-khS6hBa`N}vSBhXc@4Up&gg~&XdJQJMLzdq5a#&E>*(l_
zJ(>@4xe0x2kLXs#=?c^j&opAIxG#f~*C@^5xdK*y)w88;emYZ)1Z@r#Fd4xIG^D|+
z$bVWoIB{TT1F58VG5l^8kyJJEMqpLPA`aJ+(Kjz!GQ4+<`kXmUP;Y@`YwL7LRU=WN
zGuJ&Va-TtwR&PR|+ruJQ#d!bE{b}3q7BVb(wTP`Mkd)@TDjDm}E`@v70LT$iZpFO@
z`}HL^W@?d0$0^hAgqMO-db|$m3^`pR9fxzh=}zr?|1tC;@OgCD=i(7RFsmSPeF@(P
z9aG$N4SXC>+kh>+BSG)1lQDx$SBpRnj1drWQBpo_5$B|+=^Dj3ULgD^JEI&6VGxRL
zskESF{~H@mXFguR=Sbo=X)qd~mviyPkp-Gg3XclcTz6%Tvg8AwQ`ea2Mc{`c2LJ#?
z`&fV+>-pllL^ikGr3x+LDU(N$r>D1AC=;v&^*G?9$@VT~Up{ta&SI_a1h1)>=yjQx
zgQY&qM=2$HtvVp8AgH<is>i%JxK?taLD=CeR6!y#Pm8v$rIZBN@#)<e65-!_(~DK0
z>=uMNj#sTA1XUToq^y5qKO8&|kI%+x6@F3z9p+W=?=LfWIbt++RhhzN$B{xGm7I8#
z5MJLql>H72C2jGRkna{`I+M){y!u%0o9DaWUvm;<I$Q@{fA7UmSIJ#u1^I44rQ=+6
z&-OP5ZLeZK9DJYaEIu(NCfBDEEBFfW-Q=@kJ?N2GAzzk@d0VxFe76mg!z>3F*0Kz{
z+1V-q-)-aMC@qarH#F{;@-NUU`Pha!(%}m>XdP~Oo>)S%+s4VEEpV0%kaI|y>Uago
zZsL37(d}T$MbhJ;KO_H8cCJYbgCG#TQiM?9{ue82f4QU?xq#!)8hNbW9&B2!9l;Bq
zag_kZD|q2Xo@275t9e2I2#03#K@b})Y`SgcRlvb46nkC-UhUkY#Z9+ei*o}jJ)oJ%
z54Ju;S~>xtxnmZL7$=Lv%&Kl%S`neSBfuwF>jDs4@jKCiryDVHvY5OxU2x2L=d5dY
zvM562=yaH$!ZYIXv!!1`;-vSUibBuel69A%W^@4OCafjTvjXDhovEviy75k1#5O6;
z!l2AC^BODiyXfG@jR-jb;VmQ)c;gWtzICI6@iyh|YTjCsKPTP>RP)nlfxL}8tb8u}
z@ijvp<Kf_RZgldnf|$xtHbEK(*vi4$FB_*f9zYES=rCwG559Y&#oadjut~0FwT?P+
zjT6dWrIRu!c>`pmeW~sP1B9csU!vk{9qj06D|*7UXA~{|w(Zm$5Gbx2bWQ+hAHIW~
zykUpt;8l8lTcN#}upSr(OaG4vL33pMl+KcAd|aiM5$BBTFJ)(#D=`QH;VZQ&0{6ez
zoAD)^0J}~3-Gnq$E9&qKW5>D4ULBfk6E<MAvD{mXY)Q}@sw7a}W3#HmvN4pm5ZSWQ
z#Rr0uIf!bQ&cr1pozi4UY=ps-q?sSBSGA~gyoIrrq|&*L4>>Q`DO;+sI|W2k=^Ud#
z$|?7)6F=~h?ao4+L^{GjvJQOfo^Jv_jF5P~vv_7ir|p}JkvEZlW;!Z#kZ9xSB1Q<W
zQ0oHU!9hzhv$DNU_w#8x(y~SM77tpYnH4rPi@KeKdG43j_wFq6k(fg$sLs<tf(_+*
z75X9Hu^p1e(uZ=3C-qp$J7{HzURKkE1q2~kSQ@NOnpXJ`-K?hZ0us4Ew(qfX<WB7n
z&8!ywO<V1FA${p5^cDbFA~i=;iQ_i>N(PFxs|>%+;vS(nnE5&=sG*Uw)}o}v5|*7r
zb0m9nTQ<qwuHUh<{O)+*>WYuZ@uw{6Uxj{n?I@Zvf>$=#0spQWA##WID?4de2g!g&
za`Rn54_`z79wK|CBYCc3a|qRmpO^ll?2M8u1Ysa}B|#(P{ukRc?`uR^a)A^T1%?oM
zR*}EcVfv)HVAw&af3TaMKXwLEY`09t(AreEaFcI+_5$$~rP$QbDrR|z`3AG&Cy94r
zf2X9&g<*s{LTyv;pPd*y!zs4g)#s+1R(Tr{nYreKq>2Jf4wCriRPJn0I<__F?|d{V
z?!=nnHtr)ac%4IMlt`1>PR#B?zdDXZbtmp($g(veuFn>06HC;~kv&5ZHto?dK3!;p
z`2BwNApZtld_uj4jEJ$C()nF5Y~PCgose5W_>C9U__ae^ofDFgA<~{h(-Oz8h&+%^
zTcH;z5qM6aufEgWaryC5{i`X7qx2kVMRCjnf`_J@Bu)lUZ2frb=#cQ7bGx4tN7GY$
zV(UeRJ+?-}*}2bmdY%FlTUV47#!cLd9e($xf39Z`#nu(v!DPG}%~tIyJAoHNRyQl0
zbNjH2=54?vf-@*#Q!}edBP-5Dw7_3;eIW%CHf87#55OMoVP}2WWVVFaA7y8h12G5!
z(JNULl>1+789p`v(nc;o8rmw#W9A=wN0+wg;;lzlkyp}=N-+mU=UHf4VF@`HTDpk)
zkqnI<ZI&HaY*?*uYPHu=DCU6Z5ZM72BfM~d&v85A#2oP)7|-BH0Aj9MDrrlam;<3h
z&RiV#4ici9!0)M;u}8BV4YL{&EMCb*r_c-5RY2bvn*grJ=_2e$Dnf1gKxTvi(a7Me
z#I7C1V2+|W&mzGcwqi29Ec`9KVAj;+km2*o=o#2!=as)B>dTsJ0PM|;z2J@@6*tqC
zt}koy0f1?mZQ)j&Qd#(0vc8hA9NS_i^fSTUt<r+kj;yalEN7vVriEETt<T&k#3V8~
z5Kmrv!sC2f!t3w7TKR~lM6k6F04RYrLfNl6!oCub9Jn>xH|_J8Li-}{M?z9_!%?53
zwnJj%pp>Q^U0=yW&asaJHW9uy)!Vn0uCGKQ2edo7jRR^(aufLdHJ<d;xS(~xU|{cB
zg6~d75|3jWxAScSgUz+3`N#fIc6K)agCG!INf0UQzgRinkhGBnj5+^MxsNMFaz0Kd
zvJi8`Z7%i^x@q}SlAMeK?jnn!($?Icj%VAANKA7sj>6nRNTM{jQtH-cEkWkd?FeV^
zl!|5flthjeLs&B~CuSqTY|CKfj#-zDcO+R^l2C$Z;dn&pAiik&N0R)l5#ikf>Z9*@
za@Fl0Nsb&jn4vh9j-aGcDPZ6og0LQ}99aAY>}YY>V6Qir7D8ALSdQWhBhn3#q<a3g
z7{Z!yIRvWc&dwQQ)oM-NVF+tx<!lhzeD(wsm8+(|H96{6;i!pighBeL7E^Cggq4%6
zBSMB4&YhI#QU;PcdL&ba;Mo_97}>R^?V{x$Ig+VEFo3a>fEiH{aNeQ_E2mNbZW8ey
zo~`GSBJ=F1k-b&1!a)feASBpDyFXgwPezZyQ<&ulUj%h(bmG38kP~OjiaYrLKK8Nt
z_S@q8YA#wOhI~&XKRF&juDbm_hB+x`!FFdtG-1~)MMb?s`_-M3^HO#OI2MB-5WP~Z
zfO`LnEzeDU7Wvzh3m9Wt!8-HikK9bv-wUkdHu{&hy43syMh@2IwM#EVhg^Fryk859
z9C+KrI&w8-<9;#j!%7DZ0GA|O9?f+($%>W=O4uSHXYu^F5%taK(p<bso!KG8L2)Y!
ztCD|~v*qelX`l`r4o-}AL!Hr`X|rC8{V?&vgnZ$N?OxNor(E}|iU0p7qY}r@Uz<|T
zZ+tvJsjaLqf9+7>3_>W-t&&P4`SMFjjgCYZIcC!aw7+p8J3sac^4BC(M!ZVDS%yC6
ztdP@ElM{3}2&p(SX@_K(%wem<61J$r@%MuerGW?Z(v;G)Dkx!-P#hZs!?r^o)b1DK
zJ}gJftkT(Zwe2pLxpgW*giRuo+&3tG<C9mP3VH<~Y;pj}iHh{8DSorO%BA)u<W+TU
z%~gGm>oCI7u3BLVTga>GzUxh!Nc8*s@)?$}zZMxe{AyW%OkuG}nscQK(HOA0ok<uI
z2Nc>D13#>@oSQXfX-F44-0?h;e%w|+l$~1=Lm>!5x8#e6``=iJe?Z%j4LEnW=md<1
zr?2*%oOQv__V+FXMe`OfDFyGo;V>c&P9S7u<XBgPf&`E1om@yPf}J7b<cO4dL=xsY
z_TA{oA+Nq`&g+U=@b;UzITHYUJ<i9xIoKt+fEKMz&Cct^i!~ijpZ$B&c>j$Z(}HgM
zU2XlH-2@fPFTDMRMq`!D+1S__!hK4ZUw8)&2VH6-LfEn#$l)&O5bwabb~U=4SbJzz
z*cHStyak7lK}s^ZWq3)y9+v(S68JU|?>bm_ock8#ysZ5@Bs*eOXa|<-AhPm5?#c>3
z7zq8<N%KEhk#nl#Hc<&5j6lt?!;kIHW0}~;m%W3M&I#BY7Q8I0*=;!)r+zAEVgzaq
zXFSkQV1+^-D~qTSnHYhZBRUUr^9re!bEO0(hR5bCzMwW`sT}(_zpPzRJbsWBgN)7@
zphHCQu<)Oc_V<sLcOW6FndV7Wp9+!~o|n^Y%PgK%oMg4K5$u&n{Gseza3lypAbKUg
zAosu6RP}7KgW5(eK#YwoNb&fy?N239tE|!_z7(zF!Y#ri7M<HU*oVU029adFvwc|j
z%(6n}p`ChFKHAxp@z+o36*&Z6u#_hS#}fJbayLZS#4@HdlC$>UejJwaBv2Q&-*?4J
zauQspK3Z5KgzskAhdrrNcGLJLVXyi|uNr|LixcJKma*dgC75g)6hrW1aiW}D@MDE>
z4&(mU<sS{d?}kTp;4pGzjInci?G?5NR#}`NCpD^qRS`ST#W$xW6b3p`PU^M5KhlHu
z({{7y!-o83k_{(D$x7g``m}M6NDSyiIXK=`;d-59+P=9ULm{9O=5Qk((f}umj*aO^
zl;(6fwZQF=?vXaY7l9kghebQJD)|D1#RJ3+x}w=E!ao-C@;FxUNC{_hlU9*_h<_}e
zn?pbcF^nU1%j<MX3-OP|rYD_&IH8q7BE`Jd5%{r~d(kP>ANI^~zip97gviHYP8`SL
z4ChS4xizhoFb%~{UYwKbU{@9HF1E)0Dn37yol$bcFbG4hWQeK4{V!JJ>5oFTvs}Q#
zIK&XFJpHXb=$)YI96O`|rr)A}X%BlcF2Z_TJaQIQ%T{Krw=J1;W>AHWAHmXQ#icW9
zJFF*AWvD<WjA-n2xzYFi*-lQl$544r91Ds#2(Gj)I~#$Ip#q)y9H?`H*sSn=u{6OG
zV?B5PoS*p(`a|VQ&@l>HwQ_rt8)+N3$<*B6to=DbZvE|!MqJwu58u0%e!?imO0DKj
zKapU8aNvuDKL>3~Tadt2^_<z^`{ivMv>-4sA*abe5?aa%869;2jKWqM@*rQICb26#
z+EctIK`T&>cFooE61?wCzBS?q!_<R(vt(5(M!kh~;(Lxr!VpppsRc<fL>hGl{kYD_
zhWu#ri#kQBL87Zje6j97`vJ|o<o65Bu`2VPc{hOw!_@t_HiCdKjuEd8gU%5{7^W|x
zQ?*5MdQ@KbJIxV77y`<nSJ;8KUKb~!%~d2P1Yrm(XW=H44AtLI+|n;J2LRz;%FZa)
zVh{wPTdHWq?tf#C<GVjV+Q<e-gN6<`%n;jwROF5stQy>t^rBwT4^~gcu{&W6wQMQq
znNeg(J6Js*r(46j)^^DmdKmis5WP{(UN{-Jr-4<|-K&5EN5_FY^!(2$K<ue{tX|58
zU#EiTgB`TYt%e`VM@2bUommyk-DX&fWfo|liD_Gs4pwJZMb}~tzpOEKH+mBJ^%T4R
zE9$eku+Ws4+{C(9kq%bpR@Lz1wU`Jgw>}TzzGoxwaZuLZ!V6+)&VTZXD6#e^T4kjJ
zM%CP>DF>lHKHHB{S$Tb^)N9;&82kMg?<oJ&+Ru8dWm0oRmsq_#&MkPtOy<fB(UX(V
zA1Mh79m2~01&711YQB9X;N)33yiIQhp&>lW#>f@m<QX}jQ*3$-Uy97Ey0c2qX<V@z
z?RJK$R#j&nv6NJgH4t);e!}$pRtC%|*A?UxgmLs~)*2yNIy*v5^C0#|N`fZ<WAV9I
z1zXTL#!2w^oQ$AY%C^pZq5IT4g!-fG42&2CK`6SC8Y6Z8#mXbSwrFf+0WL>K1cCR>
zc!bz2Uco9|Oilnwh26d>x<k-r@o=2X4jZ+CrpGeD21CGRse_`UuoqU4KEJ3cqwz>~
zR!5Rt0r4S-{ZNSQ*#6-X-{R1(vDy#~djUt^GrshSN95?4jx1Jw@n@$GGeU$GPsk~@
zEJ82o!SeBj;U5p}@yAGLsHfqS-|?y<)MoJmIxu)a_Z_x8IH!LhYO@S@oK)ddB1XnM
z=#J&JLtODFj9WA<r_oWniM~ko=M=26x<^ZCZi&))Gt3quHj5Ln$|#a+@Rg%O_1-hR
z_Q!Y5s-Xc$6Z}N^Xji`tM^e9Y=xzuCtNIQb)o<Uhynf_1XdiQb$TqsED<Kd#T92fE
zZIC|Z&!j;^Z_NO5b;J1jMK&)FpfM+mQqmGUZ|?g-v}W<+IVJ$274N0{Hr>8QSk2;x
zbF?h&*;0qIbH>dP7|H<scuvy)v`t@WLPgVi$Mo7G;~sMFCXt<>rp;0KCk1>`b_Gcg
zgCOinAZvC1|FKP+y@1fs4`kX@CDj-_^awlq6T?LMx(%94_bUnL%{jdHNS~$9Th!+n
zc1_7QRxxRvCac~PYs5_$^cW%3QE9g2As(cO9RSyacwY`sb+wOF_CG#(<eCm|%3&Av
zhJh!~8rmKiOYM#J8zGWISzjQzsd%<LfE@dUkdIH567Ih6t}k?h9D>)J_z6jK^JL!y
zEK?&zztMl8l@%{qvaNxxsHV+9orAyd67G0VX)AkzFd}vn^96cMj5~vbrsOFk%^ddK
z%CO2!p7j_$qC>Er$ltMUXV5h%uA!B3BeyX(L3uKEgj^Eh`dKLx2Qb;q3@hN=kZ-i5
z>t@APe%yc=42x{p0KC$c!Ir~xRenSKkv(U~H61=>Rn{K~)0Ad^TJjZd)MX6I!E4yc
z=$uI-(;WMSlE=qDeI}+Qtzjs}n`ylOuUYYx66lRRX&E)rEP3)9l{v!>556O6L$}V<
z!87a^R)S&fN7=RHP!NK!D=FXz_rKVq?m&H!^(4fgBjsa@P&OAk5g*Dt7wcEISWBD_
z!}E6q6X+sn_%`bm6l*bHf_oMsg#={=Ijp>dGc6I6kJTR=Aju*<9hVB!G)|`lT>rG*
zC`f;?eBaMFtK&J2pw7c0ygQ@<1>>BKN1FzwVnvNqP7$qy1*5_h@Q!_kR+jRoc?SGq
z{JxW+7lNN15^J7Z(xI^H#w%zr4D2{QA-^64(RkY7aF^hqr819$Dh&J0)nAZoyF&1-
zabU-<*TrrNqR}BVUQAz?tt}CgL!E2l1uAvf84lcfuPmHW>B}MgdJ+i{=0ou5y|nb0
zT0%zg^H6VdV5IPE>DObZEyYc>50nxLqSTXLsN$DIPi_#-b7bZCe9nVgsN|LyH<56o
zgaX5zpG@C<5`RsI_1HvP)l;gzUn&)Xa!tcK%!XmhhKF_ZX#3B?6Gu6;7D0c`4NP|X
zW)?t@Msgj&*gY;Wl#hGc15b%bTqD1Z$kKd8Yh*&Nz(4*dJEJ6sK@f&ssji}U|BG$n
zUn+Lw0*phYL`z>Tf*-S@gdGZ6C<(k`p)l(RR&JTB=t*<hpm2Q_<<)N@f8<2Znb0P-
ztkJQ44;n;@f$lQL!z-C*%@m-7AV_+!4|^sl{S|x?mhYT#Mccm%{*jlVh3~{npf=a<
zYFp@$S+}-LepW;mqKfYOgmoPIW7$(@ANZlQEtaSCei{7uIF+$Ok2_A8*q~`m^cGJ@
zELX@5na&dmi;a21y~dHxIZ?*WkKiHx;zVcd5|zEDa-yZl8_fbiLE`YHfieVlSN|)H
zX7NAtLJu>K+S*K|M49C{RZ(*l(vpAmGWa<qQkb<F?Ft)>Wk%hqG6RTro$TSPHQKN*
z+MNZvJ4J|ho$bNFyD-(HeAfN=kV3?}j`q-JhZo-qLDYgBm|?`b4)@>%J}4o6l*=u+
zHb{Zo{pEu77!hFw`e&Imm%Tq^VDA3%!9up(CfPF`DYu)@=cg&mod?nZqHuXF;s90K
zh=czrJA*8SK@bXFDOEwd|HaC5huAz>bW3@}C=&i~9hTVqx)!pKX}%dO#6xMnsvzC1
z$3yeiUg7cfpI^RDtEHFX5>HJA6Pq&AQJ89RSTCj2u+IoqLCtI)8+w!uo>wx%ZV{{^
ze&19efGbm~&!%784z*ciy8>d6S<~y_b|rNi5uc3Te0qi3ePj3kgB+nUyVP?k;9c6}
znOBzoMk8`}nwg?2Q2OW(6}Jl3-2!;0!M9jU5*3ODH-=xF-n1c~PK+^(3_EWom5ePm
z`2c)|s}Ej4^trSB@*HF99TI)!WKhY|LpoSuyW804trIC_Ta>NR?X^O7x3QIFTbp!d
zGEjKfjpdhsY;1x4Kyv`IqR<?&-<7Otn}X$+h!4s}#;VMI_-I$cu-i5V%eN0d(a=Rq
zBn<gVQX;Wi?DTnloLqEZAQ#g8vI1i_+4>56#rwKO6-@tKj!FreZW2yQMk-ST_B7G|
zA-y~mY`RH2Dm`(Sbo7CwOx)wM>FD*BvU9tF7zCkUOX35y|HhWd*NP@b8el!FM!4Xx
z*j7i8w;Pz=DwTGq3`F4RV{P`agpeGHz$djEyC3^+tZRmT*AQ%KmAf^6_+xEPr>_?k
zP&6Ip+ER-RI7HL>1RD+ylMyX3P6rVpL}nklT$HfW0XnGEwk2p0c=}j6eZ+o-3MQwe
z_bbC6D_-iCIxF*XEgc3rb7lGUPt^aTXqOjfQBc79&h3{JVW$uMKZ~trUQpItC~hAv
zn-D#HsIImV1}w7DV&{C9)=DVaaSWb{Y^(^HXeWp0FM?(t4#HzOFt|Q)`DZ|4xiS9X
zmg(9!h;;0mn$SG-%J!>U9E3+Iqq~^aM^3z%jzm)q!9zA#%&ty-D4_Gk_`6RWgU6Q4
zQ_8FegQ9X}{M{+V0e&pjW+(FK>J&Xh5bdKoXdNR!2s0tX$RUIcLE49F`B945lb4Uo
zgp$KH52;|T=cm|h(P90}{>-7-tw&-u*YabhCtF;fnQ|j1X+4B$AOA$2A7y8B1ThFg
z!Iq*CgZ(#lZ|@H^8EJrVh$4{ZLIXvSR%u&RY2tol`Q0fawjlcTR|@kB(yw(ZW<c#e
z(RiTHg3VzBlB&IRC#GQP9#lWPKhy0)$CMAce#{I^-95gqbml@kxp6(R`?2P^;WO&>
z$AL2W+&6(d!#wvW{89R2Ale~h5zN=CGle~Ow<&0uobGUd89&(1*8bs|*pOxFbZ=B@
zs!iH@elqxT_i1(=m^p32Qdijb-tvc6VnY__Pc<#N-Nkm_Gu5e@q(22R<4q&47I*~f
z(le>ym^B74A9#*?w_?wk@pr$BsVU2267C{~oRrdzjKBINKzc5N7QpdQ7TW7rQ}GOA
z-6u+q&W}AnbpcoOGut0t2`3be=Z&n8@hOk5dX$z*5~Bb};Z^~d;hUWy<s0oq2IB5<
zmX=a2ehk3%dz35gVtFc&iwdCL22WwMWmHoz4s0==N#&vf2-#dWWUY2v-TbX@sbp)?
z04bv|<w&aA2wWT0RR-riCKV9QP_go(?A(qh20<X&QV@J>|BYSN`z4x;G{9s~6wGpv
z`HF=@$(iE0Bj|vL6y%e1Aq{f0y@*Qz-4TUAY;>6K_kKE-!w-TC(H%htq+*_8i67>E
z9OKgXhhr@0x|mWt#N$G&T-kniOI;<d6as;oa}sy=D9Qli@dT{_gOgGqFRCaVu^Zzb
zURkvU+#yOx|G!gTu8hCCWvrl<#y0xd*Uh%zy#&p0;}HgJktXfAOXd9WhW!OD#g2!B
z!3DzCw>G7KM5%AvB|~|K#1QrU(&ktPKhSNzFH)d)ND$Df7jf3-ifY59_17g8jkUQD
z>eGn;tcTkuLz0Jt5cS&AczO-~wL0W<Ra1^xGu^_rUBBe08|x>PdkR&Lb?g=csc?Ru
z7r)w1fn*uK^eCC|Tvsdgi}Kvr{&34!#U7J%Y|`1Ke#jTArM$B0^}I6TG;5At8M=pm
zBB4Wx1a(SY3up0CgMb^`?><=-K}wPu$ur$uKdwIe-6LfKHTypCV(3TN8RSq5f<W|2
zR@CbKFZOxnZ%}Ha>6#j>ILJ6ucmqxmJR-F}EF&m2(dU&}1;;<_#`t0AWr-}EW0d7w
z*R{*;vTfV8tuEWPZQHi3uBtBEw$WwV`p*4)@6WT7k(`laWbe#1*EQQqgrOJUeZ_NB
znTXp2?vo;lZss&Uv3;s>w07oFHf&qw<R!0!2dixJ7oiH8mk0p_i#8RT^0~yi7y<}8
z4kb^tER|L)JS6u~IwC>yGa-K^pf5>#m@>R6wD}Q&q!pV+#rbgiocx!O$2M&>FGX?4
zNOFb<3_jQJc_Pox#@k?vRW+ir1+>LtV$sLD@ZZ2$FHv(|OIs0oM(!gBd75rY^V=ZH
zmUdPXM{@{qjf&|<k(jk3+g;jmdt8(76WHxpvTnMLsEj_Fkog)JG`i0I^z(|*7wTob
zct$G}XzpW^%~2Y;D0LCs-;9TZT9i;p+;eftlOGH_!h-X2!N?YrRCxu(86X%Z9MJos
zB1l2=74}8>5@GU<IPra=BFO)ia0$cde-^E}8+~pgHPXz_bJWo7!lF1bi6S&Eh3bw)
zn)^*Cte*bs)cN0=hz3gl6HwMK)Qzp6s?1_D&a^<x`!Z2!iP-yE-VeaEKO**?0SyK?
zd5!gko=`3o`{V9g_q!YOghc}UU1bTWVYb?gGL=`?m!gPc{9QE&adJwv(tbbER<_kR
zp?n!T<yei$J8$vTCd_MVk~tz__j)ZWdXK2TW3||=cd;b0*L{1t>xyyn4`>pp?pLql
zQ$9aV&=bTHzPheJEeF|WegR*la@e-^D;jYw22kFwBOLk5bbc5T!S!;F)|H4H#Dy2E
zEv)`&#umD}uvur*5?MztIYPEz<p57ZjML9`#IW@l=9Fh=R)99mou-pCQn_V7JC@lk
z6-?}MUV#OMXsuTW2iY`;NzL9n>E{tnz<avW5DgZ&vz%5X9`kn%DJUnIz}Jg*gIEA8
zX-=r*A9ft%|2378IV3&Nzk6y$c`t{4SGhHebMDe<dw_k_!y`W)>LfTP#Jptp5i~F8
zm~@#rKJ9b*VSMmXJeViruV?q+7As}E)c#k$!2tkY=28A^2u9omdi~HW#n-d7FVBDz
zqjE9E5wP%TCx+qhh`vq|Mm?N0h=}P^zWsdg@Uix0`ecAYwT*}c=hvfPq%Z^d9EA6Q
z7t0q7rI-HAmuNx;-NO+IL1|@5C(wzlx>S`_j>Hik;)ECX4OxonDfMlA1pp>TkoG58
z|Bc08A$3%}%A;krJBli?9;V;NV@~!L?UChLyfwMvF25=ba2?!v)afWWw*J!GaMJB^
z9BnGvP5%eSt0KA`Nr_LlQ83=)O|O&afJIEK{kL}V0g?DOoiq$RiztUCxj3e~Me&Y;
zXT>4B2mDh9UI{bz=4ozmGbK8`RIv%}ql3OV7Mf0hlNc6t2PKo}?1b5#gh0IsI!-!i
z6td{hUh>GI{_Cr!;|Ns~nW1P*Q_*W4KAmSTjGoE_)GZj&Q|Lh)R{e3-iCw7)m`4+Q
z6bTEd-J|y7?|P7nRAvw#GkE-C9P3KYuyVuR8d|U7z1725pgpry3WRU-@$uow)m|p!
zLqjzAyXQ-QOmqd{P=yrH8IlV92M*5s(kNO_guo0J73_}B#Y?U*!X7ooO~VQ-`>Fef
zus1$W!_B*uiz#{sr=8N1BoyF{ZmCYoFw=PpupUQ6^inh^b|P^weX!c3q6;IEq4~c+
zA`)d8%QiS3hY2)tqNuriZs#Z4+yo?WUsih#)KmWJ6wu@R`zOpg!1hiffl#LD^?L{=
z_cW(vkc6*E83D7@y)gtWD)TS^V%(XN@#Iat@^KdoEeOVMGoMQKUu%V5>GMUecM=(i
zV6+ieeM<-02N@apeJ6uL)R-eIj4>};TVv2^Ph<-&c2bu(!2G>+E`QpVk|BAXkQhbj
z6ZVplWiRHZAUPX{pu>OeyX{7o0t!>~K`uoWp#(+;4i`Q02kmvXXmO2O(f3DrSRC%*
z!TfQeYVmD>1eYF7sk*3*;DJm|40D%MC|K}_LpI@`O5EG8uA(UWBnKgLR5g`oUufO>
zX)LOUf7zt|48yAdBGYKog$#rxXmUQuhqtaycx8KtDZzI;O}i=!{D3G6<RL;R(fW|0
z|M5o5Bv`4|O~o_;a*8_&d<kQP?5FI2XfmHTAoE^sAf*1fvcZ@@lVpg{PS(GjG_7W9
zGDAvz=!V|5x094~qL)=9le-(Q*-H`{8gRA<aAEbGZ1S>CPjhy7*!s%Q_)$p@EfRYC
zmYk3q<c?QzBp6o3%X2-Q@6uV@_${nAuVg6jAQ+(JK$pc0-mBC!%{Ne$$v<I`8b|p0
z@Tyrc5#3TDpoI?61sDPER$kU$%S=x~b<ZKtD{Jw7`~80I-U^(@fl&8|P&Oq6)jJ=+
z)*1879MFTkU1H$R%7VCW`Fvn$iJBe;F2paSWB9cEH?sbpvw~+}*8^QnvqE$9AE{UF
z>7vpnhoz$3)=vel?Gjp<9n^w>KK|;ICcLQ&LNPdt1oW9oN7LGbuR|+YxfQH5D&I?J
z^%aW8Y>L}+^Vc@L47>vYE&JCy2}_USJ~w4*Rb5e>gt>>_5Tc)!nBGe5%tyb$fT_H_
z19cz<96XA(D(|U-0v`X%v(N-g(=IXv$N)$rJFYoD{X7pEyI^TdJVchAPv1Y+?3ll~
zQP#~N4a|^~$l>z8)ErTla%GE^12xuRWB6<Oln0foZ;Dx|$zoEs`{-@uCsAwrJh<Cp
zE0jSr*WqpGz*W9$`=fX4&{AP0Cfp1X6Xyi-Km#9JF-TRV6;Jy?qq_L*=y3VJcG{z<
z(Fjwd1dYn*oFeuWA6-veD^d~^&48KmQ5qr5h+`_QwM&CSm|>xMIboiEF*FA+^{Sa{
z=^`VX#?x$EM+R=4b<%KBHU^x!{_6fG-Ie|k*bV(PYp&h;x4g=P6}N0-|5jB|+6YJp
zIX;|d#=GP<KLU+W>8$*ME{50*fSns4`}F(p28WT#-B4G?DhR_~;A<4-9gAu)gjT_n
zdm!s|Ka8%B;Da|c*BR_?;S8)R`qNcN_Q4)*NJKwNNKD`|0p_`pRqsj!g92p!*$<Dt
z5Ba$<uM<ut5qcCwJnHH9<&DfeqQGmd6*09Bo&PPJ7q|u=lwcQ1Pf7yb!&Lm#J^*h%
z9!U5fz8T^ZfK45AW)a!Mmh#eNs;~_d^8^wIDdnGQoL&hE^)6cQ3++LW_0FP@D*7jm
zFuIwDUZ^%)ZI)`qEZl9>rDm6aAcSQ%Tbw-EB53&Bd+iyiNMMd`;?KW%uOa%PU;KdN
zE?{Pk8uH{KL}H%_Q{Q`v_Uwk8tEre3Z$GB0B}d+4AR!s=4BPa?PCI86{$UXKh;u3;
zxfM%xpHP##)xPpOodo%x$_!(~y?oX*Hd(z}H8B$R5xBrFS*1MjKl}Aq!IBYj%RgTg
zn3@==Cdpjh5g3<HnN<oe^s2CII3H@=!2GfYKXywYG?=I`Ox`^>kNkvJi5mA+U8U=8
zX=Iw}k|8CYp$PAsJe#p#NmM5|hrWVc9Te-R%It4GulJLB2xwJVEPqRG8EZuox9c~V
zgnx1xB%Dv0aL+nSVHw^^LQeBhp4T*Raz9O;`AXBtkck7PyR$7DDK)EGro_gBa0~sX
zx8rU#-uEDhn=PHT1V4oQsQ{e{;f9D%dgBGB`vA{{W%;u)@g*|`AvLWwiXb1db{G_~
z9xg9yQGo|(BMq@!ZJ)egen#Z;;Cpua3xbkwpM`DihzAN-l6s<jb0NQhPXGCe0nx^K
za;>_OxlAO9Uts+ne9LR#p-l}XZYan!`oghJJCD$i!p=z2h!VLXZmVjXcm*Zr*r*TM
zC;$FJBks@jR4!9_uC1k>lHvsDKtwmkSi>X62)#ykNf9cPXskC#nPu~S+aJ?m8fA${
zLDVz!DXW@+)tweuV*y&7oe59@6#MJTVf8?Jg3^V6Q|q=@hBrLN9Z2CR8m*I2h!_Ya
z_<dX8gf#&bw6J&HC5V`N^Gn<7gmt@IOT9$yUVH=b?9?jN{Ory!PpNn)$gz56-RNY)
zK4G~eT_jRrU}9LuwDsjz8OaaJ({LSx*zSNm1Zmv|$u!->U(Cy(YFXnUibDy~yP<v>
z&kIKCqyzMMi_+Kg+3N7_ndgQEBu#Kf$DgF?+>3K<lkA!2`(cI_$oT;H4%QwwAZ6!K
znwT1(<E1wKP=Ig8>I7g4>sCzR_#7eRhr&gE(j<SKEf@^L|NS$3Rh~kM4e6xKhh}04
zGzOj5|3!W)Bg~u8E#FytM<yQZ>3*6X(y|u=_-+h-B4yB>K-XcxI`b1(eDzR>!PlTz
z&R%1X!rGsP>(<g<IhjcB&u{+cNo*WrrH;CP%x_UoDa3_AjZa~81UzRR+V8@%P0o^v
zcEeDM*N6M{?XvOvbTkL-pMs$pqmCJHPBg-wq=Fn+B+m$xl){zNz6DVP@`{wg99Zzf
z*^nN*>wdwuXJ48S<O1hH!OzAz!&{AkPjD)Hj(+{P>mQ##XSspu;QKh=%-)Y#TwVy2
zq?Fs-vd*6AUn*hl^oQv_Feb!XrBzygZi-F+Z{XO_LsL5zRJDsvUIoO19yQGe6`6nr
zrS;l8&a=W<zI2!YnX#YBiT#4?JHwaAqX@ES54csYV8W>Vng7N}fPk0K-zEba&59N1
z%l!$Q?DbH%9~@4ZoEIcQ>*rY?lVGBbEIbG?L|3YG0&q9@&f$-+q|D^t4$6%z>k}CU
zpYaWr-rnJq0;*PkRmV@0t+&Da!F>AhOcQBI174whoocgp;_(nrg%tt(c0FPJrY5E3
zt4mZPi(s@w9K}@B39D>`PmbX@6E{KSa$ZRp2y@T0S?2IsUoJd2EvHGDTN!}Za%SoP
zT}n#96Yxa!zB}Ym6u)nptK8zwZqjPNY&Ms6^7aT(HM7CQr*Q=LZ2@EJS){<Q-HJ9f
z!T)ZshQ)cP$**eDI!TUT(Fq66DX;7>*6c$m3-jK%*2-qB*pq}xc+Z-z$FD|G<|4G1
zys4cSD3S;01oCUW^<=W?&kIeOh<u;(0l<R0;0g|M_9TJn6z&73g}j{6CkRBrU`-s-
zY*tz!8Z@BJpIIb)qrU`bZg*O3_H!<gHM-KAp9n+u_h5yBV=b4|^Df;Hg3JkVeefcF
zlY5nD&Oqvc=!;*yxtok25h35Es}xoc2RC++V5WK;<D%M>VxIhE#QFeC)A&M&L5%HW
z1oO*)jNqOx3MUQ;(3!XiWJc1+X5I_=HRfcazxK<NK3-PpIwtH}@qjQA1%#CGD(2TK
z)wjTKWA$>jsMNlTI_l6}`B;K5ejs)90uSh)mwf>@(|mDD$y?b|NAz5UTZXBCL6yC5
z3)}$H77^_P*3_Wza+)>DdI`tOEaR;d@Y24*W-x7DeJvQHh?-UJD>zn{JcH~a6aWPY
z&K77S6(l_F#`sJlb_f4gf}?`TZ@~T}pIuE>4raf+Tm4d-Cj<v&uETe0s6o1%AxKd7
z0SO7iR8b9Ox~Ql<wXMHSoumUr%HKdS%;hwR&!bf7s+dn5a@x_W*wMS)?7bHCW&C$B
z%3oMcz0kpI9r&O-0I`w(y7m;nn=~9vOCLHi6(<Z7%3q92zj>G~%_k5Fwq`@53l%6{
z2RR3|z>Ptq=k^3uZXZxTg;-&G@<S^a=X>hj$NFYf?!!m*pw#P+XW^0OC4uKW-Rx?$
zM4vGamY*MQqW%A?EC5>A0LTT_p}TJk?Yxg=6lO9ELUd}&0$cd*A`v#oI|zP}t)=k1
zCQop`^L9pvRn{RXZrhr}1aD}+stpC7Xz_bt@Qztmi_c{Wm60uM9jl!raSuzW*a4bT
z=d79a121u{G5)p8GxvPi!XqLvFA3#M@vX&@usyU_D%t|U+|}1UAH5WcS=k?r)<;e%
zkQ+p)YH}&kt{{X|$fbF%F9IwF?bb_VUQ~R=^2L5A^TXgYybV8rfQ7@uX&99w#MAbC
z$10Ftp^!@?!<RcGIfPHCxtGYysKkhaCUC#>%_WlcyVDEyF)$+LMZ)HuZy!H@7ZfH1
zu3Rq*pX%HG_s7zqa3WTJMQ<$p8NDQx=mdie{na9s4V!c%n8ekn8yGqO9`!0(gw<)W
zentZ<ybm1u7pijKQ6Hm;UBdc%A7TGU6UZAU5lY<c-t*cB9J;Cnf&0%(tM^k4`aT(H
z#XtU?veA=>l{_T0?hsG_<)ZDsVh)rZRncoZAd`H?PfAjnzE7)ST`AnG8EARL(EE4C
zizsG&5f)zioiFu~-Q`m!^&dzosYpR{kfP1C-{~8P-(D@ibbKTWIiO?cJE*#AwQ6&g
z6^|*B&g6vm0ja=hUW<c!^(tpj0_~PjrwPOTJhvW?G4jqa1X(-*RDoAJq#9IwWJ|aQ
z;nhLJ1(g_J0mW-KmRRt&b)Xf9@z}G(BYBCIldc!R?3_G!BqGrk3TG|Tur5kkoPV>9
zBG}`@zOs<kYXpbcWsA|!+(WQA^^s#9iLy~nn-JRMO2%!6H_=K-i-AoaK<?@U4INox
zHIE#&2)Nd5nkUtChdV_ZV{=9F@>9~JCY}|f&f=!8FWbmoNN-0gmNQ|Hl-0j_)A)t0
z&89x$LPYCzCITp<sv4M2?}<85Dp<SqrOuq#W=6gekyrgYlmeH_#y!0(1oVxNRb61O
z4Tw3FGiKo{N!y900D>4NgQ7NQZ}t}$(D+^ypNMqZDLgr|?T_S_l3VNlr?4dz)IR_B
z+zYS+ugm=fveXhNW9|ujqNF}a#waNmxvUq$h0)&h0$Ppb82;h)Z~)=UW?lw#XSgXf
z^)Zi*Vs~)|*Knc;M!9~tgsBG{sBPb5VF(+=z`of0!=>pPA-WlwBFiok48!5w<0$=s
z8^W4$p+sY6FUnCMQX-7izCsfo9-B=PYEK|HXGU9UM|%<P?l~xDQ2w_my&;LVz<Eot
zTO5QJOWiWvL-F+vV!mY+ZJz?a=fRPWT$J8b`Snq2F(%m#eRvf;STbd)YZ$A2hhOu}
zt_W1Rq3_Eh5v8^hnVq%eT0|3jU~6g-4P)U`)dmdBkFm|f>YN+BPdiTYE72#Km49Oq
z*Po!2=6r%Dz-9m_tWDEinGCumT~k?o2e{>cwse!(+5T|!O`aNN?8Be2`R0-ROosI@
zkxHO{vdunEW&-kGmR~A#f8lv)m?_u%JHAZWPyNbl%$=?|WvBrIHmS-%Zw)gWKZ72>
zKTjwh;R#hJ5ZtqE8*M{2{M4%fF?j#y3I4q#3`pBKdNSsq1Xv*vMbIE~W_*Ix4d#S_
zoI(Vy<;HTU08=}y&j_~N81flo@4e|R6<P-JnSh>tf(rLxt9TnnA_4!AQ7RRvlA5Ga
zW~jp=G7yZK{=gXiUALbhOg5md=I@0&>Lq4q5=Ev{WV=h9bVMz5AR$PRkh<?+-kWR%
ztpOgIf6T`R5fqo~dfIaiQxkR1-;>*Y#Psc2{;)%Zp*8TE1ZLa~?dHsKS#h^hZ}>Yu
z5s7X{UV?YAc=Pe0`9`qXptaz}8A^vY4+z|2cX!xNQkr#7<og%pn#06okh;P0oaz2Z
z^G~FTR8h%F4Oq1}?$2vC$?X@I(m@E5HQHsfhj(F?;c+>B<Dm0Po|Rf4QgmB-M$~A2
zE_u;-_S{c0a;5;3(Z=>F$xqfVqFUBc%`t%`%KppO?`qb>#wHj^%~JtAX@{HzSc0)3
z8LnU72^nJ7qw(+v3sFyJvUc7yzk-fI%)8?X=b7Mnn!oqU6TbmT<#w21LO|`xKmsrN
zH9GG~N<4|0Kw?AeHwU5&SF?jRL!+pdCa$Rx6QEJu0#0bsI5z(r7uVxN1*}O?<yyu$
z5DzuC4&lT{zMxA8fMG7L`FQA78Ud^&An+N42PRyB;?0v|W`+Tl83n;F9a--F<~xkg
z#MtGA(zOe04FQbO2&pS1{IYT0_uCTzEDM34C&z5w?FzZ|S0t>@4v4k*cBbH*ij>6j
z#667ICCT^#BA;8ZiMj{UP`6ddkIdhV9InE0_^z>K%ogspiKdDnte9Sn?Cd%tr~$gh
z&GGqysypl8_SwsZNkk3SmrsrTf3pYPK^kMzbA%f%2=2<84qVjSv~5@@sUSMVPvZy5
z446=RJk~{3u%J4{&k?$D{n%ht7xm5~4>59wkQgH{hD)&*Y1~NPHA(ihl6ZmrWInp>
zg0A5L0cS(N1f+i-ym2+6^fSCe)q+1<p9Om;`CZ1ikI$Y%<wzq?RX^dNA7MB>RWR$g
zUjdj3bdZ6FVMW?mRI>oD*K>jett!jc{U|FKiB7@G)>;0KZ7K1Gt5V18FN#oCjMei&
z+o|E|3%PS`lkYLbZPRx|%YXS${mJV`qLrly*Ua7K9dY1M`EGEu#Sr8@a4x#MZzoN;
zt1iKogY&m9d^F$Yr^D)yec<lhLSDaSc&JJ`Jzf!#<+7l1veD6JC8=k>8-GuX$PQ)t
zR`6DTnQMJQCzrw?MnqmC-%%;6y5HRrbj+lL=;$z+AH^6v91?746b#$?*OT1KSWBx+
z(?LFfTyUIfHTl}QQsO_cbV&2<c!Dqz3HCVV`#{3VNNb;^1w+Rc)~M%=pezsG3!I4a
z<yN~P*NSswI>{KEjTdZ-Z40;@c_A$tI<t7O-llYIko2Va4@|7qUst`fkqzpl*M5YP
zrN+n&!|u+S$|&Euu6OviTaaYew6d#fJt^@O2e{b8${55I0{{MCvSNHpfl}VJRdl#E
zrukDWwS-Pa_1#f%qhBrnsm@|48IGC`=ilw46`+@rtNEXN2VS2N0K4;JBvO7X5koZ&
zT!9+ZF4*h8-VOQXF@d&C;b!D{f!uw38nSc>S*5M1TSM2%_OL2c*gAk^sY8>Fwo60x
z*r6xn6JKliR}#e_Io@VhdsF2&MA1UhSyc?*ipyIj?4mAt1|xt}IE=sl8^j|K&Rdrv
zv%Y*A)E83#x=6~^<b80PiPkgL?m1u~%^ZImap5V7$#R;)jYitLBaY;NK!D#|-UZ5+
z5*C$-*M&fHcP2#<B*Xx?R9&n+KqniFOhkHB5jZ4jQBZ8dKszqomE9S#q!6k?2^zi%
za(=Y~#G6!1W>o{s#oLZ$SD~O;b@ha2d~U&&9;ApkDNI%$F7%N_-p2oxY%YM?9pAO#
zq5RL|)cX#D^EK@)chrr|_Q@BSxWovJbHqDtOSv_&eA0U69YUMN+R&5Im&F)P_<P%N
z8yu5v@Hs}C-JZBtV5WnK*UyR2Lo`yco+qKH;zi=smBWP3tIgvU@2}^_th(jsr2ew%
zsc?m;zX16T3y%pgNU?zoynFE*2iDu4(yRpdcz_Y<u@PaLp&AF6R8D!%#WhYpV|b0%
zkfga{=1NXYdCMhrxl_#p?jj*x;Bp(CZxM!Tk|E5DXKTNd67_R(&%ddOR>4`x`fIZ#
zF(34R`jv~}+tYdDWyP>qx^ya-VfImr`LiXS6^jH<Co6b_UCdnlZbZ1D<F?R9gfxIb
z8fLaG`X-%F)RtCgDt@39eAY!<4}nyNn=L!E1~pqxjQ?b)IuNWa&TLWo$f#F0l;3=a
zMS_+d?=qwp{gp)~Y_3iZ)<lB8FE-q*KonFFW*+bx%q3D9w_B0rqcGp7<$@UU-+QpU
zwH6vg&q7jv%S937yGF(9ySzuPP++;1Vmv5vnfC{W4`Us}0l*tWqbEFRjV9eKp9-n#
z9|lriTSE%{Dv#2OgasTe#;odUJNYLebYxduu&q~;dMEq#q{Z73QF{Q01Wi52PT-3E
zo#`eIcF0Vo9%zo~dc8UC?0^>y3YgAFVTVu4(+}VPPWqpg%^H+7^~KQ2`%+DknFOn-
z0!M9e@+5UgK&7<aZ^VP;zTPEIn)*s-Dq3foNT+a$-3V)N)CgXGyQdo}^t0=gP3Jt{
zh*O~*33)>e7bL;K$Q7?SiCi7a`|7Rscp8HyfIb3;R7R#*$r>S2Z);rhR3WVQq->Lu
zYVkmiZ*WPC`EvW4@*7j4P(Qh-qX2$ty#i@ejBwneR6tcz@n`6*PlXh%$5ORMG~0a{
zOsom#{()?`BdJ=7hAo^L`n;Lt3_)ITvpfZ6V&^yFQaXO`zJeE7n}eDa+;2ow3HX4g
zH4Zb`u<<d?e}^BS;4M1y3DGM5+BvTGX=?X_!9y(dSVi1vr`#wA?zN%QZV<2)RoSf2
zT2c77yWj_V%gp#Sy&8Wluyb5^*Q#!agaY4zvHleWa=f5>TP}sSJ0IiXZ|E_8zGHue
zjE9Nb6~hFZwiHGV7w4EI{&}T%s%-w1JxRTlzI>v2`x0}iVh%?Jh-u(%yx2*`i@pNH
z)J`T+0%X&)rTf1>vA>30m_awh{oa!?yEk~F20!A~G?HV}N{HzuSl~0u5TgmUSGbR=
ztDn^OmK$y)hp1Sc`;c+Gk48AkOcRuMnv;lh_`_0(#<a-_UlPI<M^R2F4)kZ8)^rd_
z-2e*&>#zexza~+SH_VmHRKhf&-_zW?%=O<!pG^#E5q;byCjr070!xEQkeuLRc_T`#
zTb){#sIKL$^}WF|;|&*uxC?T5<Ugm$k+`#ZY@!cDniDosk+;_xT5>JGG5|aL@o5$`
zfElIOAHFx;Ud+UQB*g~yWm#==)sI`$Q$i<cbcvCxf~>WRY<M*c6~4DibSS3{>XvB@
zQT%ieCQAB83TD4C=_p+uX7K4CO>{5B37z#K@Kr7Ftr_p(AWu1T8n}o?-uP*n?wN)d
zL(t4EU@e_M+iSy{D$v;-h1P#(%uN@hGhgWkLt#9Pv6!CPX;X_^&KnkbknK8$kT>No
zu(-eeP!l86la`8LQ;b~rW&AF)arnDZO5zyzHi+N=V2Ou~8zzJjYcm1<1DK@`9Fs6A
zTN8gFid-NtoZy=u-(6--I&4v^X(#DEj#*l#!RCT_5gdzPgB8FE1i}U*Xl^QyitepG
z&jHGtBZ!19U*}y^Qle0w=j(!~#P6aY3i9hJ3c~&+raMgQp-6^CNN(w|Nu(fS>L-X{
zs#Yxli^Cm`&uNGR`ne(+`~6y>VdmYm_C2PjE=LW5f7eehYK_5lc#_CKcGXA0g+GE;
zKr^v7gK|Q?CC9rool@uqIt>bGd%gpZxO=#070c%42N%C9aOCSkZeNev1=pJ%QxVGi
z1-@(08<C3+vIjww@Kf%NHL~fiq>zOUvW-DZb+YW=?4dh1rS{^9c(P0dbjo-%_2nyb
z>=uX;g=QZTWl%W;kK_O?LDWcHU0i&K<Y0qufmvr^It)Y|U8SDf8@e@50@xVVn7-zX
zyUkbc<sT;(?rJO7u*(<B1SB?|GVuA~!?drZI#f7zO?X@}YpGpL)%pS+lQn;`@J9UP
z#uZ@xn;8zd;er7YDsa5<$v4Iai(cqJy>zM^2PH8PMDT8o`bS>4&~-UWM(9%)Xj*uv
zgUMfaD(_Omevws%vfg$RKzN-yeWIu%c=CRy^X!esl9ZFp?Pv_naMRAeo<So)s|rb0
zpGXNbx=QpXJaiH#dZLEVp=GR+%cNyTDJV%ZMPii*dpMf=3iNxtXL!l)Vu2Qt!QVAj
zOsyU_4HUc+wa~1-AgjsMFYp(5-|(Z0@0$`F@V8&l`#;-AVSXigLmY~XGIFixfjd&p
zh-Q9-p*n0LR~7YWb$;CNZ&2b{W~Q~m9>)haI|B`aNb7|<9^sD=%#~9-P;McH`M}dn
zvW@L^Q%o=D{&;?)$*L;1%`#f|l;{oUet3p60CKT;?s`IYsr|D{crSdsRcra#XnBR7
zOC!<pK>c8GPOaOwg1z<Nf_wd-#3+=BrtzJPvLlWHm*V=rVq>tTF_$wG>`793D6yo)
z{bFNLzfyMH_BE>$27B6;(^E_WiIPmx)0E(crkk|?WQ@ZIAxtPeOPLrOK*)udTo0Jj
zN(az|(JwELrH8BK%|kv%fnv9JAs8=qZSFN!+Z=+fpd0JJpY3RL$LP+wnybhvB<R=n
z#5&*0qkpsBNyB`}XMAEN;fb0<Bk<n3nwu<wZZZa{^<=l6&CddzO>b-B`%r9iuTI*k
z@pSJUP3@3W#h#x*W<#06CM*5**2&MJ@J;u>HO>yO%}0B|4b<5`jFS9lEw@1O;?%7L
zZYFjt@nj*n6g9BZByLKB4b;uP_dL7iyq|^iwZOvElF|wVls?3D3`l*&UDbRxtsK`<
zzj`>cGG>9Mt7r#ngN@XmKa7CX{9i6JLJOPzXk0Fobw~em!ahOiTALiscR$K_DayQt
z>hIzf&b6Tv@%J!jAjSvexkf$5wJrQ1y(&zN{ZlSB*TTYaJ-2q0_5~Z#JvUT#N!?V1
z&Y+ujDIF8rP7<yGv3?@ASy(!$@{XN3?lj?K_Ak23B09CM<{}Vp1W`d}#m-#xdxGVs
z^fJbY@_&8IAs|oR7~XjNddf9ndId}xj`LSF)tA0}slC&<fm{}l{yECL&g(gRp@-}v
zPZAvCXf;xD+tRajw9g}|WRk^*iq9Sn%#zM`J@^+^C>RNWQU%bhRj7cr!P;_^el{C|
zeG=t9&RVLnzaA>H6V-oS?hen{&TnJ99(wXxc@adNjBpp4HwdbmOie(jgMPsqk$U+l
zpWDj3Dw}m*K9a*4qdrQDcfW<yKmA_C7E^TK4uVyvY@^$kx%%4=6MZ8Ex}G^uHn|3O
z@#}PbsC}aB$z}*}?6rJpx2xsG7uB+h$CBsKDi1lH6wFe2?g_r5ipPsAn<awd47nH<
zVZZR)q(nQM$CIA%(*}1wuU;^3Tj>tZa|IGmC$WPkx7gx|8<_>(#biyAv9+9lAo}q!
z_WWBmSXQz73r<k*=v-ynym#ZL8rzWogGwij4__&tA@zL;SX@c*^WY7v>0^|hKF!E&
zaYVk^$PUzf-S0Sn8S*3zU_k;z16K<D0=VKAj$zp}{{p2F^DBnuo!AzdqDJ(M?<J-I
zBsFNI`dV{~165L1nHmuu;dl&&lm3@Ki!fvA<%4TCQg=al><!>YLWyOu?|h>181*NO
z&hYevS4F+f#^I{Oj~;hU_<1|kb9ZW^2E0*UiK*jl=zN)Ur0V;*)ph1KPzSo?Oz}o}
zDmI<6Q!{CCLH>tba&iYre@sw=f4hCbAz^mP8sX>B*4JR-2Gr?d3?jzrlC#bJs%~&(
z$)<a8?M^){oS6ITCscbBWK&XNw^9Rju8aF_UV&`mjw#t$+<t>Ke`$kV{rmM`xy$yw
z*sFrrrH`PMRjl9ZK&0z?Sd#11LZF7U6>fu|1-kuukjSNrQz#yd+-0`NH`O*<6zrN_
zevSm=91M2Dk!(4+kAUDxpC%cEe;}XYCXR&2s*96LVPy9Yl>2h)!R4`0iK?>`{w8JV
zp<&9?T+TP-w`7ETSs-`&l3Mq3ai9Hq1<H;&lpd2W81AXW4q#~{14ub4+)D!s9{IAj
zIjwx_mk_VI=1BcV9_1u2aw?i?X38Ap@wS9X1olVVo|vH7F!6d20u&}0KP+{->amO&
z*)nxX%fc2&@7g+=R3xU2d7b8r%t>~5xsi*kB;pQziPuI?r>u87zUE@t5#r2FX!0Pm
z!9O%Y@lUHOo7~+N9i?Y`xw+~ikD{wRwgpyBCpc03m@%Ag>-kgsnA~3cs<AAjdrsEB
z?2ahgcQLHAPO-9Cl2n3<Fv#AZogsd69%f&kM)A5W%othd_Oebhd|rH#Lg~HX;10b_
z-OG5$c!Cm%M+QAW``_9n1eJW3oJw~J))HklqwPjhs~P1T`@Rp5kt?O*!K}@r|7m=V
ztTAJEi2e4iJ@4lM{WBL?qYj->FQ%lv;pKLg0&|Q9Y!p6190G`EyP_nYd%wUvG9Ga$
zOM>RzafM>t`tMg`tDq)GBYx(zelnZQxk<LcsJ4QueSeb}GW54X4#!z8=mGp%To{-u
zu1&X-xQbVRXu&uRa31xmJ0V&81qj)<3MTGZ?m#DU)ojFX%<#TrD+Dy|wCrJY`4HbH
z3IuHU)4w!?Oa}QseX!qd+%3M~F(|M~aH{w~A7lH6w1Z#UVWYO;qitmU&|%Q*7dW+{
z@)<sgwc+~925z_Hu;FGO+5)SCi0s?lJ*hmMj=gGi&Lf7M*F;8eEMPF~DaOjvK7=<j
zz1C~%-6wAUU6H;OkRpynL9Xc5S%?=p+_@F`q@~$~g*y!AA`zj|?YJGNh6%3)+ouJ2
zR^YO<d+>DnDxL^2RDu!fug=ZM8g5@*zG`OhJAecn<MCs1V>WbNp=)T%rTmS;C$#m+
zpiP<Ds9hsTl{TwT9S^xJ0lHZU;I~(D*JFeq?ZFMZwKJccomn)s8ib+pqEOdRB$mgq
zntZ5e#oc)OZc@DUSah55;ib^#&j9h%6JY_7$4Lb0mp+9FF86)iQ2uZ8)D#|+Z@f~>
z<G!T|a$TSg(58^O+tDeU)(=X?cRGL$>_!MyXu(hqk`FTi_(BekpNb%DX6?IffYw8s
z`5J<+^M2*E1_jTvnnmW)Gt2OPzF8YFsB<EF`Gw}vHN~iEX=xO?nIpMXG5Wvll{OmY
zoYSC0=_O(^meAz-!6G~G^Pq5=$`dri^cg;HPwXg7<jXHf6otLzWEno01H#zXzXBAK
zCp(a{_2e^VPxs&z(R5A87Ft2d(ov3C80|Ky18wI>cge6QD44;jVGY65<+91)ieT9F
z4o`=hb;k$X0-IeolPO@$rG_FQ%qb=GjTCKrU%Wq5j20%>pASs7BhMj6x2}uWs5QKx
z1qoE&oJ6YacJ26~zYc~;gjUW`(IuzCd*0DHi<($LOx&~2C+|C!_9^d9k8Iu=iS4Sh
zsSR*<iLNE)dyfxo-VM>Gzd7IzzbV4#i$O}#n~%bC<_75Z`c6zKQo_FPHUcFW8&=#7
z$itg;`)TgaFJCRy^c~fVzJniv^Gv!(8(5J=FfEY1qh#7iPskEWFK*-j8if$te;NfE
z+GTH}@q@bs^8%1D?tFQm?@uy)3nM!H=Z7057VTHY{^6nK0C@^l^%E-{RVG`oZ)9eE
z#@F5c@{xYSiJv&E<(R@Xmz;z0lZ;L$^cTO=HeqT;l3P|buaY(o93M&8H;q3dW)=PD
zTP78K`y=`D=o%R>(Y;KA2y1w?iF&{OYEc;JaOA*^8gq>Nb~lX{^XW$+k=)0iNwG|q
zntpY-s5EpD&@)vZK23@>ki)1keQ5-1&$hfD3Z*;7&NzJWtVNOF3zbKJYgN*hU}=xt
zw&+hrc0%<+1DC|ia@6eG^4{(VIgnq);7w1p`{!6K?gCYDC&)i@+K$I3%d-cWgN5w9
z8x|BqfkAh@SCicMg~cpcDhAkft1dh`4Dq_s(Jef4GSD@G#5+)vI@K*#oqgNf)+FM~
zcty03#qB1`x^iD9cs|^uAixOv(4Q;IkiKFag?W~L^vr%bOK<eX#O<~%*>eOB_xY76
zeQ;1rli<^V`cxRWpZ}RrFBzeP=jq76m7aSWM;&)0lop|J446yMgVLRQgFcvZ2k}a>
zNu&jCX-bFs?eox}TlAfCbEa>;sUHt6WCsX&k^ZiaPL09mfK>|KW}iHvs0r@(z16uU
zAOrP!x&@8iZl%^MS>6x}n3L4z?Rg=ECn1^getn1k4%}_4f$OLx`pO96;K|Keu%WRI
zZWsmNvg3c&to%b2cYTPk8bs&z<NRF+>ZG9+cazwmupZ6#a;Y+QagEfq{)*w6kk7bY
zbs_j+yx%p_75WhmM{%SN`Y(OllGDWIkS)!I5@g83#`_I^tXIny#x~Qa%W8PsHIL+?
zoJ~AYzsA>?VA-ayTBwQOB)<->pOv;)?5F^xPqEew&aMl`ODo@>vcto7_eeB$!ISmV
zBsM>E4#s9!xTE=^y-C!0?^J=*MmNxBQM0qH?xD4Jnu0RM6cyo(;wK$#UbU)8JGg77
z2p7ZvkWs#;YuzxV1Nv=ZR7=OGqUFiA-{dm4uG%ibHPo@3oG<^ihuHjwbV-9F)wu%P
zg*yaNdtp#GV>sF-T9apD7&p`fy1NhvJ{kpH>z5bU(b6N2%Zk@+AgJ>dneWrr4+YOs
zO~$-eUbI;{P0x&#namO?MuZc$KrmB*I={xR_)Q_}A(SINw~zFwh6Z2vPk3dLJj-YF
zSZzx8nW?!2#x_A@r@n*I3*)K^4z#^LBrJA;M2B3j951p^#PTOmmkW=bn}PVGv}z{$
zX-qN1VkPG;Bed5a@3!|yR_~8b(Xw0fjBV}LGIK^8Zg)(JZBY+)L=o**lhxTr5hs2I
zgsFEW;6$Y32h;nR`JoM>n-A7*h@yx<$Qpt0{t%s9;;xX|uSC*7OwId8iy^bkJ%I9b
z5~&psEd-D3@<|st-YX)OFb1e^bS{ge6WWuCgy|Ns0F=ByJ^rMzhnUS=+E}}o7vd*2
zDb6+&bu2+_Z=QP@WMqY>QzMzhVQ#Olgz*-$K!hQqUTs$rw%0SvpHgPKNFveolhnbS
zS-(}8pIN|~)a^f8{Ct|M;?g&ccH9S<l{mHmvncoxzx@1cq~n~H_I9Y9u*19VBC@4F
zF8`Pth11d?d$|oO2q~#i9Xz24fn6t*N%2!|G-`VY>C|$6FqrY_%qI-)`|%Yiv0>dm
zLLb?*OM}Ea#n!V_66rl^`2KQNgKlIrf6(xC2!Ru_*>5N{ru@cOWV1AxQ_1|KTrLnZ
zqrbpbYES}K<gcE!oMMCp_Q4FaV_9R~Sl>Bml^*QXRzOBtSk!D6bnL{Sb<N}n%z{^H
zbYQw;3-w0+ho%EWga|o5*X4h^vu9X{LF!l}BmP35D#mRky_36@ob$vaEEixnGzj<a
z`971sN~j&fylW7o1NW#~uxC#bRL;PYm=Mf77>BE8UX*>oLEBWLfH%=F3%F*;*FSV6
z^t5uvB*euAlYa$ceR{#hQ`%g>AxRH<?9(Bhrc|qSLw_ft32<TQ_+>Dl>C6sDr$tP)
zrd^t^CNVb5KJ8DN@o5W7Z)!~#87dZ{{Y$bP?bK%yn5ZKhH$)8Uw&3A3NaU^f`5BPT
zi6Y8;-3TrR9ZC~Qvm4m8xAr(Qq3^7s&so}t8tn|3B@F08Px6Y_IZ;><#GvTk5%t%|
zzFjyYPq5Q%Rjmfd9+qAth+)zXj)?(w?6gG~uStnd;*UT7#D!HPuyb#9z2}wNXahM^
z!5rCI!wm%+JPl`{!a*BznAZuEqiu(JU_Cp^mb&jIaR(%*2WpCVV<2L${eIZ*SOksT
zKxmX1O%=?QgDRupeB`Knj9WpHAv@q?bVE=eow4;od-XGKYps%=Yfcn7jXQhDv*2a~
z4@q%tE5e<d>yN+5p9cqIgY$U9#pGJLkT~GxvJ&4%Y@kNAWVXn##%D<MSDI25-bXGW
zN8(aWLIk4uU9Qf>&(%!sL6g-wc|DJEVtedNA@Jn%48nPY3QrsAa=g1?z8Z-8mrD>=
z$J=!dGHlf^nfEG2nH0{<B1En(pV?Pasm^S`W)gCa<&YI?(AG}-mts8FL5w3{ov`Bh
z;<<i4kJ<i|BFYlN;V~blrj}*G1^V?r3IMuBh6Mj(PEm1Iy!2{Va43n&tW*|}n-CLZ
zj}E`DGhH;43q~$Ae@h6lZwD^n61hyuB6u;mxCygNzHy6_;+Q#qUp;r86+^1&Dz2<{
z6uHLnAecilNJMNgR|o0A>Ebp#TRaV!vjz|*)qIGi*neJvpkS~K10TgPo|D7Fq>_Z#
zH^LB3qhtsk4l}|eTwM)+9-UnkF(lMO<ygdm|KXa6Jme7v6|G=rtGRFt_nGh%5QbK;
z9(iEB=5m^UeZ6{Lf=bbjfr9EiSC>TK$4+n^y()|;$);s@T)^%!qy%rFJ5eJBnN8D#
zel$A0FCaHwen*1|i@IjG81=S7-`AX^{qbaS@l;fiD`SF*D})#7T(#VjfLdgh@zaCL
zMJSfq8*KL|%n_<JU8qXzqU8fiNfSE+H5CY^)po#B>{2BZPD!%^!GG3kTG0Ww#>@%R
zg`%SSLcb%%l98)MNB3S3gv06Nf0W^bQ~==m$^Prtzm);T82AxjZz)HLHB~=KKw%3u
zRLZ{gW>|x}1opxnfKvSM*@Tea$cP)xQ(1PNfF={!D{O*V$^#kCh-GnEdamDeH9o!d
zXCcI6tKbSNVY&x&IBtUTMdpc@EU%HbFjcgzp^t#7<fKLzgKs<GL1hd#F{hz~LZPDZ
zz;kKaL~yuM!bLXou>?yViucO~z6OBR1`0KDW=}buh~(id`uoa?t<YTLR|6g?@xqtY
zep@8(w<az(^N1Wd)>-s|Sn&RiPTLH1Sg|7;rwSKT`(`OQ?EQkYdvslGx@_jrTlVa!
ztV;tfVYlcN$g$q#{@g~swyeg#5L;bCVQ|6*(U!)t6vqi=iN_=a5}sZg^d>P{9X>Y}
zB2UywDZy5~I+{Ov@(RfN2BbiWng^~dOoI;4+5F-4anzO6XDgg}7#usL6IoKZZ?Tpc
z%>3=Egl5;iWc+lf;PsZucvx+)#RNdGpS{lh0CEvLK$jM6I|RiA#K6-pe(UtJn}U`w
zp@E09xIe-LW7zIS?7`-m!lfBN){o>F-4<Qdkw}jK=L7$V4Ef;#9Um^6Ddg)wmC09I
zg0p0DIzHUE{3{7&jFPqPDNek`bU*1d#dn4lN1zxkoc!mB?)5?cpF|GTHgS0nz4$)k
zY@g%)9AE6ALx(@?$qE7%8~A7_%1MHnko!Ox2Hd;K<*1nBM$RPCHgmGA6!(_YC8GIh
zyTe9K=R4l=`88S8pk=nvVNvgvf{LsTC!Kuxxwm5|-Piu@K-T`h0U5`>Yg~!vac5q*
zp3=4USCoSkg~U7zL;p33-pb!@4S$Bp^WjV|<lRJOhh!9C-ivaMi&=)WE;aH7gx8|>
zq$SK{%J2BIi24RR9jDo{Y^@8UHR_RMHdGKbM2}+U@ar|+$e-^Tg;EUv2!Db-G`X0h
z#}<aFmoqf#^MBbsl*ZXR4i}!+7@wZDJt<udn9kL&g|G`u%<Mq{LJ)$e{?@@}_!~)l
zpzz5cXF$4AjK%SZ_$rb^x1NDYdlmap4({KWS6bUNb8)Rwn~?`2^a=;>z)7iXrXWvN
z8V{R#d#`r3nWkO8%P}?5)9!Ua?6~}%k;U5W@(Wx)yEh>0da;#{fjj@*TY8b`Q;8_~
zb!c(Hn-$b;<+7CE9H*I+1HyjoM)va(j!ef^CzB<@)F9gF$syvid|E-29my%R=4!IO
z6+s|P;&>1TtX+fjZ;nI1Q)Nv(HV(V19HG8tx7=t+Unbe|aF;hv>%@G}9Yne2x&<LM
z(>`KHPlw=8=tW#*g+48)$BK2Sz32YAT-|<HnZ2wJ?&WuJVVO&xTJEg(EEHNB&fCv$
z;$Y7b>F)@^ojV)|q)OiPmR58kmhiDclCr)=Y(}2LjyFX;CL~)b9x9I-h+^5{`z3?l
zj_Vt_@|m7e@?VU9q9bJScFMgM%jnqGZC>mJ8v$3DQUY+5i`1>OZ6E*V(!%M_sDx!q
zjw=I-9`(QdYHbvY7J_NF!-CdFTdG<w#Ubfem>xg@t7V<lqz38X<fiIMLR~wOmnu<-
zF2VIVKzLLS2J>uKq^eMfuE15Kw!Y{yiIn-Edq0}Jsbg&iP9aqkS!Gd<sw2g26_8uf
zDikI`_tQa;rn{4zrgxY77r$}rNc9*w=c6TGPNfenXayXhLTK|rWVWd}&B`45&+@=+
zk<=4csJH7eJX${9)1Y>oLr!TldsNKGVk6=loHPqbPD_Z2O$90o9g*YdBP?CIJ{<-S
zEUh&kVqkB{fck3%YoF=nZ)>7t3i=eCYo-*FI`87FhP+K#iLkN1rTJ}cKmX6=gXxE8
zR9%JQZ7VArF`iA1wc`hTxqQ`JaAzs)I|U22F}{Wu^65g+pQDE;U!%F28qDdL%(4V}
z+q6^ldjb!F0<Z1r713D%aRJ{9z(uA5q&<ZcX%j~w0pe|rHNNIS<*97~G$>~s81(Px
zs7LBnq{2>8N!5kV2MeOp+9}L2UCtV+sA4%^Ss#9gYa0}1*ocK1n`#ktxCaxT#b1Nn
zZXn50gdboIm3?ovo)Bz$N#E+I3q3VM+-SG;frcE+YZB8cXis1yMbesJ6Yh?(W`H1S
z=j5`$E`sk+{ih$bctU7u5rwlvFCK`MfLP@+4bHA&AN}o@ONP6825%@X^Kqpfb-6qg
z#6?2mobRb$3|LdKmqb;JMN{(iIHXE)FU{281@NcL(ok_<+-VupABXr#@hbn8qP>eI
z2Yi_dA+M)B$2zug3=qWO$2c`=scFIs!ipk@|D`tnQF#oscg-XPYx#zsEk?GblN~+{
z6ElwI?Vb`VBl8l8R$;O+v{K<|VLxDesX+VRz%PMKKA{VYt{zP`vLKO8;(@uzmrYPF
zYdny!OGRn0a5u5R$MXpS-jWQ6*}mCoK+q)_z<tPgDKiZc^5bvw4=YwRt>}Hhc&Usw
zj%h}qhjIMxRoXotM{AXXz{HVT@uADaA>(0#c9fzern#AnXxK12Gm_@$;}c)1)Bq<_
zcKQ}<-vA*(E0&)$nIY>;yL1rWSiDf$q}d}ACGm)#I%hD%E_4Tj%%?R<t{@T<_Xd<~
zzIW)lUCoKw%o@VTsd=!#+OHiA_#*#w)Ufb)DdylA)A@qy&~KM+y8V=H!&4WPO0DYw
zE<tCq7qO<B7{G{OcF7c+v6b`D9&g8?4HcV}KiUTuu<d11WhBLK!DbBoaPVNqYvfFh
zK=@q&S?(`A3s%W(tF`K}czuCMLlEfS!%PbN9MRyx$!2VDUeMNyW~E*!(_ID`FAYcJ
zL(6o1WA2rTH1(B+bIEuxqJ;?yHnPdCGHGIjs&m=K$q*2fnwbr79lwjdEYd(~ZPg%Q
zsMaavP*_!|*e)=ZFq|z$V3^>wGV}`o&ccLY#{X7+WJ;HScL>d{9PCC{!)cn9KCy7P
zz-*iP`k1lSAN?4hoXMMd1BBEe#vG2-41SMSBVOn)|8*&tL4C5*a;mp4n2sJ#wA;cY
zREW5>3)En}(K?kK8ZaR;GB}5IP)TyOl?Braw6XjqxZ|tMr35!!KZhE7>B#$XsDk}h
zlS6km4i3RWz5Y+Cd-DQTHi!%Onv0L*F^<Weziw$6eiLD;tc;ecnQVO{7x1c0y1nCW
zWMg^6nj@c?Uf$r#{os~=3Qy4{@{-<AW$iYYUPW|qwEyV=uTUkK${&w~0~6gVe<~gR
zAOwcen4wVmndw1ntxh-5Pz?=$FHRzaz1&$p&6ep=Hr}S7GImWBkn(XcsihdJ8@Nu~
zr(^gf4=S9oPxq{*rdzm1U8_`lv34JRMfrTP0{70-WDeUc=ttt0SGfGe6vo%9iig0l
zXof5$MN6f>A8fh<$0s1DD&_lKIBF?MI*e&%q67Ntxbp#ECrqLRU<x|OioqNJ`0tH;
zDxd8~h>8>?p)3B+IG^uJsRQJ2tYslnhh;HzGPtxE7AA<j_9zLCvthjt<hM@>*Ly(k
zZwoS+MnCxYhTv~Z+FXT}49E-x(BIv?+w9%~!?6#4*Hte)8*o|*SLdlOmSKbA9zrod
zB@r4<(QbZr*jW;#W31Lq$rKsloDuaPR~ilPi{zzS=J9ZStUr2LJH&f@-113b=PEgH
zE$;+dH9us_riL;=vQ$zG13IB%*q+H=J?l1|*MBN#9)}{ZWXP;^0+FW9$-S9kc-khh
z68^3Km9nb_uEwu;dbevK69&HGoiqwit)aYtv(-@NYGUN&nXSSsXq_jeDr3NwvgOaI
z`bDel1_{rumahiYD*z!7KXJIRjISwZfCtc9jNvF}ZMED3<bVit1j%*9kOvZuKZ{b3
zqCSo@!9jC?-wB7)KG(uR=-{5Fox>|KPzqQgN9V>yNQqG&ro&y1|1UihkQiqrSnx9v
z_e4Q~4S=LD51IU48znHs2_*|H5R_WEG&|&x52t2aKrRMZ0*2M~$HXGfKKH><`4gZC
zE}jwhyqCQf-ZjOu0J0eo*S0Qw!p4LZxjYz_qHKh1Ce-grzq0m&X=B`S?(~t+UsAcT
zFQjshg<~w93f~stM@&qWotid3yM`HD3!~T(vf;T)iBf7}zu))zUUlfHCQD;!9mmpP
zJ|D~4gCdJjAxF>?`PCgof(e0&D6qTHeo*O#_Q^wsyYC+_A(kts=l_JmLlU}DECxG$
z4`yNb^s{grS~fH%j0f_K9(uMhcl)P=ESO#;`XD0mZ<PJf{{t~W&c6ICyBVTR87!F2
z?K4%V0r1%2tlc0AC_~$_xqGGpbmWI{IA>VoCi3S>u>g&EV7itD4q(x?Qo<<1*|GyP
zhEhx|3ym_Pw+xe|7$c81dyNcK%MR2SO7XL-Ov2}nXeikVc#Z2V&lNiBN7=d9Fbso0
zbfYT9pXT;otemS>Ef5qIK$c?%+uS|Ak(cSL#iG@2zc$u$+zEZT=WrxRuY~1-Rm14-
zQunTI;*$^V-j+NnR4yDz&MQ&5&<<}%>x*Q^b^3}%g~)}LT<J>4ELe?8pY*U&J;Eb)
z@Jd@@W+4H;j1tufR?Px-j-`7|M;lzfCn}>f!p|W~bYD?Y+k(|pNi{Iw7aq@bx%0J#
zs>FK(PiDnb8JcD>W(lUV!-E7yg>!|LR2fPrD*OvsHZrXd{Jcni3shPa7!?xCOBm?-
zTN%s?y+o&MKgOK!JyYW7my_U7FS7ffQ_$1B`lCY4f^=8kq{|<4y*l?^7&@7hVG3E;
z)l-(Hd%&F<6(Sd8I^zaa3wpBF^Gv%FIvKdxdDP$Ngz#$n43z$(0?fj%lBGX{4FPn$
zklaSXUZj7kps0|^Sym}o3OqMV-tXP#{1_x(l$}8m!ypU;zZ7Ca(EmSHi(YCVOm*m$
z$)q91k-Yj@Tq%`y+Ido`T-+<onD4;xYF{SiUBP2vvaZB4z+`R4FyFqmZW0^|GsuP0
zajh{`w%^ZHH*XB3cpf+|F7c}{8CQl5Nn21WZTAc)wbKrYxrD2NWq=Y>*6Z-@lmP^r
z7guOiu=Ih_qBO=9Lp0f5%Epc$(W+p`7jC_?apIuWPA^t?Rmj;%cf4MPVq%nr|6Ke1
z!gG9*4dXXsoax5f98Dgn+<7)?QY__n%TC|-h79crYzwn@g#y*!w2^ve8`F&h+=9=a
zO`?|4k;G8Ox+Imm0>wghuUv5iiXTX!<Xq*dJW5b3_#~tkvPYZ&WX{%Ty)R19J3w7r
z0!zX3egreGeC$c0>DIlj)J{J%a1uibiQ-adcIaQbTVDs_B&HOmTqMS3Q0R|8$~V?4
z1uBK?UWv2L^=;)Ug}|4!Ka`zW62u?~M6YCAQ0{-R>CT@FvFr<^Qj{zryuP<c+gC*<
zd27VE@zo&lX(dsQFfs<8C8p@1T64Sm_Tk6FI=gl1tie6Jq>F<J49mwM2Tmzb2T;o}
zgtqq)*r{omIEIp{$Dyc{AXmPt96dZ_oC79#Z>_6Oe_9|CS!yfBCCq|rV#}Vp6zY{n
zAPco*5g-eDf5no4H;H=XLE;E^eH4T+4<cN(WZ_1kRk<B{DN9Pt`+N!_4=$mU+IxwT
ziG`KSY==dJB{hxBLi8<@9B4|6{2Nlqzy}sfmxxxrD-`uYl{i9FNPbT2C^e(^fs^{+
zgrY7(*@v<?c>qyhR=&@hRBq0)53zck?dr?lCYb>Yh}iII2%(4{iDYh9NK<}bvvdjk
z<blmXJ}AoJ*>Qh^BP8ZkQgA@CaGA2bJ486UC7I-qpidqYi8^(f2Nkg>A((6-T!5f{
zl$}c!#UKbnw^Xga?0;jAIC(`ar`Z4lPHh0=<r%&CPKn=KPjj>PUi2s&DD>#qNi*xd
zyt-@PBLQAhk=S&|fFkC>>Y*Z$nlP?~r@)Q6!$hn<s``IyMaoAo{~waxj>Th1t5i+M
zY2^JfNdZ2=Ls{nPY${>3s<9sqfdXm52u352dSDM>srD1#(~44PR^OptMIu1KGg$1$
zLI83h)ULEcov-kp5Sd6Ib-Ug~LXELTmv`2gr=fic{+@zmb?sdnX=q#vZ2y)+f)yo4
zFo2YpQSc5D8g(;={v%IyOrL_k=3w!U(AHkrm)$IA4h5G2lEUI2$<|2si)4K|Uk+D5
zkmMY`DdWy$a#J&(LmX~I6iyZ3dosSEvlDmIh;7xv^(lCe^tN~st$FCzY^6Ay-SeU-
zJfg!V>Fvr}Ap(r?>7H*mkRud&6@slo&p<!Q&L}y85Coz(N--)f-v46h&etNYo4x?m
z<>&wkkFPozw``dc(mlStlDXi|s)3z=!V0sCKU2U|Vei!-Kb#`V{%x%1usA$43RtQz
zOP3$34Q6)i(npZ{)Xp=792I6e*~od7GuvFO)+)+f07r#gASy>g7nxglxL83-3}?gf
zEcX*GV4`6Aby4|9DkIma!|mGS1R;-6(Pu7DqF{SnR5nFrMx(Gb1P&2D0OpQWV;3}D
z%0rHZE*kSKKHPb4?1&2_Ne6JS3%n*6?-!YZn_?mR_IKhqatQnzUTbzZK0{iCcTYu<
z9%&hD++(I+ZM(7tGc!Jhvpb7W*xBnQn2P0X7#<ENG{>O-E962KpiD3wmk%eol{^55
zGvsD84k&d_sIA*eaVnW`!g7n?n=+y<M0eKzWBc=t%Y+l`0z`{srz{`GJs~-<1Ucc@
zXm(Tdw%WA1ClnW!_$ChrwX)91eknVb9EL#{h+ZlFLhgUDde}K2)RDUA$|3~k88R9B
z!5l3ZpQno4KDtrZF1W0&aB)gMij7?*B30VLN55{OKDr@C7%+B?2s-S+HbY?@C;m_5
z%b-8)Uq{rw>Pd57a-wZ%3xi7im_SdoG@t9`q{VI}62cHpFN70{aMm)=Ym_*r8?^zd
zC){2w2*WtLFiwnFy4JF-9=!S1?l*>c#$hTcep>sy27ZU;OA9tPyNnQqofmOP2*pn8
zaPtQOel!Z7cBqwv0%z~>Q&+8tqlJ6|=Tv(RFyyqBV5sqy5)SA4BL76bOi4>Gt-H1q
zizp(89F_!w<?eG*v0s_5S7KTHJxob5^X<=O3SL9bC1v%4O-~4e{g2a$rddY);6`$2
z3muHdP=(OTil&MRZ%LPP39sR<cM=zbFf~Q<HBlVs4!rA`^NrjBGi3J57ELG;Hwg&#
z=EH_s%+)MLkFkH0UE2-BFbG>I=N^>ozu4LNIEjW<Wq~Nl!zRR-_bYp*KRI4wMr$&Y
z!lqy~bci?$LPCbHN)?kbP*lttI%JvJ{KzH_dbi3rdDF%kTJOvx5E)Y0NGJSR0_T0s
z9S+WYeuzKr;7WX<McGjq=$w!&5m8tv^qi7U%_3Msi}Q1rpH++aU0+Dr&|>Bt&d&xX
z#GfgfOm3xob&6Bc3Ino4M1SIPRy95uJ{9Pr!`2T9k#eAi<-LZL#C&CuRi#s;H4Pm~
z&Hg6pP_K|hzMhUf#b@a7UbZ(ewe8i|Go&WpaS7hpyX<e`N+Pe;mSk1fyNTZ~`BgM>
zfPst?L{uO^pxSs39a7Dj5k5|NtV2aO)2s+T(P66x$%vu#-1T(xJc5_P#~?aKjO~x8
z9{hfRFF)EU3}y(*k%@R`v3(t4z4)0NzR*?Gl4H)Z0HhWnCN~qTw$7o-e2=Y0+>Q<*
z`a_DP<E<1U2}u~N$r0)ZLZ|(i^+(y29ZL*@u$Dr=2mLp;$R9h8BY8^$jN@PgHc0>3
ze*ApjNCLTlsW=<+s5d9K;0|m%nIDiq*^z)`HX6c;b+>?fg;^XhYAg7%CfLuC?GAFk
z@R$s4A*pX8Aw)GR^v%am>K8lEK~mpDLY5wjf`)%W3i&tNFAMiXCV0<+puAxT(azzL
zJ4m|X#M`Z)`&P>ZxM&j{+`+%lSb}!L!4MQO|HwB@+^Q+P;E&bWa)j%lh^)nZKX<V8
zFOLb*BC;$OBI5H*BPG)vc=E(113ZQ|#+}eGSQJy-fhR|7f@!!laYb#J*qxoE6Z1W(
z$yh?*{bmpc{ABp~FGe{aTd8IIpwrozPhm(W;zv0kbBlclBh44MsNAF#siPbai{*6!
zbvwLZW+#zOsNUgFLX~`8cpROY#wAMAFFPL2Bw4<=48<%by^?6dkQNL?DIfx2Ffm?p
z)42PP4hp<<rj&-B*QgE#FEFKTz4p;uDt=oB1ipPKAIi??2x1U~f-Q++qWw2^toL&$
zmkA9p4l$xn+4tQw-)NHs@w=bz)56FPqjsl2!~mE-ywjWKFQ}OU;E^T*ArYqvtO`r8
z{%cAL^+=Oy%P8&Tz>3E8Hu(RXcro;{OkcJbD*&7mi{CX<xjfOt4n9`T1qS%gUV>?o
zDqV9p5qki`;9h5)0nVgkD%W({%v=|Mh*e<Qf?;P4g;HGm4(@99F)wHq<4ks<CW^zE
zNP}kuIG5My!PQ@eHDs~3ohfG2bP=|j1vN;?$PBz~&Y2ao-0JJGb5aZD;LJq#*h{*t
zF_9?%K~;hRHdBf5@{CP!cs*9fFi1MHo?!M^><4+Km((aXc?P@R(s><o>(Oc36YL+1
ztT*+YRsh>{3@l@U^ma-8EE}Ssa?4uvUVse^@|&oJBAZTHd7H@UVU;$}I1>0D777;|
zXP3qf)%GA--$eeO6M49i$dHA;{@~6J9tFCWK3dRd+Y?+NKxDt6>0+R-|B}_M_$su>
zhq5b6vLFOuH=26N(t7`k4e{#<OxNTBG*zucw&YLSnc*v<b9`a#=g`<R=8f_E?baFP
zXVy12?6Y80Rb<yjE5Qd8wpU&?4pa^JbA2M8Z}M<spyZx^nGcRG2CKq*X`Xk+MEf-V
z;&JMZk~R1Xo6au7$Afb74JBCb*25kzaj$1%o`I62@)Kbd!5;G~sujE$Mjq6tUXC3F
zNm<WF5q9E%3S~}dswmE2QlUm!dNM6TA5;Hh`o(d-$ACb<Xb`OS!b@e&VAQ;3&K727
z!G7(wy)5mSQvfyZ4k4Cl7DT^6!2GFWQ4BXv7*FW86nHzZa*Mh|!4YTBFX{fAHP*3F
zI)|W2b4-|K-jM4eF5E&;#!6(#V>O;L*ea<&v(S5tUm5@-jo%Dx-Gedy0b`YdajuRg
zI)z!^gE2n>LRI8Iij|wXZeq>=mRQ#827^A5FGy(?(+tXp=f&iBIXg5o0@7#mGIuH!
zy0}%wjz~2%a&+{_VCR>zGrF}P1c7KvtEg!IjlDT}U#NGpG(e1s12_!Pat6PGuu83q
zG44~zGKuFG!!Ju-kvUa?UO3Wr5k9%w{&`1&s!DtQ$0ut?S~=QZ`^Z3UP*nM+<C*ru
z5lDDGnSNPx%nXO#d?@$mQBb!z-6jLLo1hA01H?Hgdek;gG#@F*-SkupGSxKRSg%$-
zTK~N<!7Z81X+mJ9cC#)eYR{l>8?kDy$4IFUpNFK)^Na15ZHZy4Qba}7#>je|>sZH$
zdIpNy)+DQYVik3tHf^-awxj^Ft!-GDqD|^6I!(J2ZajmRkyZ0JJvMH{vvh}DR-UP+
zmcXp3%(duz1M?DIfZj838F)2xP}2IX7qOLfNyR*si$+?F@d5Mbt}uS=Rw?rg7H@Nd
zrm`=J3c878sE6qcWcH1^-B+RcS+H5oI&emvN2ViW!rMj01MO1b(8V`1c--T^K29&^
z*TXc%r5NHF$m|g^JBo)kaL+UN_7r3WiVb9Qel9y<_<UdVA7y8B1ThE#(U#OGEd4ij
zZ03G2#0d>BIbv8m;PK(JiCh*x)5<9ozv@9AyLgsXG&8o>3>J#P)qIRt*=JMfTj{a8
zhFcoR3$}Z@Iq4YFk|Ikia)6aImjF)AXG0HK5#-o#L$W$2hQ(uvyZoE&gICtJ<8<n{
z!<5T@=9Q8hi)`Urxagbjv~d*c5n@r%;{&@THFS8)ppV?M<5?^3!8Vb+JXEw-HcY#x
ztgYX4$d#ZE7AoqfEee5=3F8Oa(*{j)OjHCc!dosAa&J|d8`km7_WPmJt<jCJ4(r?v
zIUl5nh0@=v8nI-urZMI%LP0WrSHw{dgBB>=OgC@~b(bYN($)X9naz4dXmwLV;mRwp
z!cU|};)9ab#_d6k`5&v7Truo9jy+#rMQh{spl;lMHO)`myk^o}iPFvYfOA<DG7dUo
zT1tR7KzsvxZL-22Dp|pS=#m<G|Hasd?!$d4gWTYSjJ)aQf0Ug;vcoV4L$4IuKh(Pa
z#me(v5!{T~b;WqnU{DZJ=`n;+23agNx-KwXid^XfW*B6A$c`K5Lb2*MPeQ*OIzmKm
z;=H%;I&BSQtsJ~ksgqNXp>&1zJ@nv_l%Q`_3SOkvFu{hC2DeMQv{t1|%}Dp|ixrAB
zj7<-oJ`AZ+re>sjd*L(Iocss!<oVo{GNm|9)Wo<2<7F~3zu&4{_lkSHi?E1b+FEov
zi~Tz_BjE<^%+cGhzR*?*UAg`hDj*7t@NoYijgp`zv0siImY!&5&<bQ)F#6`Ntla%U
z0|uM+L5u4zcAIt*_~p=XwbudG4TG39_#GNo<+4^RhYmcwgBB%s85^hjq@sn=6wUO2
zL8vlcjFq(E0jdOuqJz*SygsIbatJ+aC#L9ytFS*rVzk6(4N*vQ=#trbs-TvB#XSs9
zd+*u@-)}nd(r3}z&*-6SIzas3H3-rA+GLPb^jG@BSctWTr604_i$?xNX%*d+{*aFG
zNAiyehJ*h*&zCmAzm#3k5rr@a+vr^z3&s5xd!%1t(US!@u2KXVlGjs@y`mBmcPzl`
zx#cXaFsYzLJe*K$#s8eAcaX<O&IBd5BOs1sAj3-_Pl}qTR%nU21(9FILuJY;xSLrb
z!=)AO7Tke2WToWRJiqGPYZa|9uHYs~#P)y_3qr=3UFH|#&u1Q>I3!;3HjG<%1Q8|Q
zQ!0*Qdulher4Di0emS*b`WX+98hQ?k$U@V-obqalC>&~;Ct)!wUdBNxnR*8Uni>i6
z#qx{W8sG4^`p7pM?<pnm+A3a$F=}5(K=YPYXM&H=5=jcKz#RE`GJ>&-=9bWGM<T(Z
z6{-~6G>f>axTsc}mund(pqBVjfH=nCHl*ijPfsEnm_aL?Cctfob1uPB3Tm`0IrUa@
zJ5;cg8J*k#Cmf?E$*DqW0z`f_Ro=}(Jf9@^=+yR$;{g`Hr)2WSC`U!f)vWNP0D(Y*
z`!&-J$|p+SyKOBos30J9!0220oif;A?Qv51(Oj@Pf6C77IA9P4f-Mor63~BRVaZPb
z*@GI;Fc@<@j=lM4h#U5T$2!p76i`KWIt{cBcI=8BFB*aw3Hwi{86wlgK^vI+(3zm&
z8If6VH9EH0ZA@0gO~ZlLo6_$ea<%F3(u8CK79;0Z%&3>j9!So_jd96LZz_K@d0Vy8
zYWx?iTdNZEbw<y04~Hhw+A5adGHsRZru;|a59{h!$uhnEtuuo`n9;S(uEQ2b7$=HF
z-_PAb1_dJee#hY{6o{-GoALQ(F3(&7ANCwikw9b(J$eiRh}22IxAT(6GcXWYLyv~8
z5D>%8y_=ntGZM2V9*qIP4F{*AJW#Nk((gU8`Ey|7AYumCF?hM*86Jpi{v0jfnS}e@
z>4$1J#ox!t=Fj=zH~=<rufYM2XOJE8Z2w_p{-|RyWdx-513MR1|LFAP@Kw0$fbe3^
zP~j4EOGarH*iBK)N?m7?$H^q{6vacHGq;_f7vNh`w0Y3-jF5dqAcci~DLbPih(QpB
zUP(bw?|-pP{43hd<^rwLssW6T_kkua4gz?39Vq~_*K?4Ha`pN#NTt+gPo51|9xDhz
zAILs6|Lf`RpCEOG#xKI+po`b%<;Hm^^bbqcn`R3Ng(=J+tX={!8`6jAxl?jsPRg4t
zOinM0PZ7anz`@&yn+fFoagi5^H)8!m10}eKJ()I6?~yOsGFz$VDpqv*NwgtY7#dnu
z-)N1?ual(vNwnc?MtaNpvvb->EeVNQVwq@D!pFuqmxk!k&NHh}*d><QAn_O)8}lI5
z>m<*H0tK;1w0rOPpGeEeTsiY*2?}D7LQ+TEfk=tBPX@2Mo+DQjJV9<MIk&U%@PG)p
zbHi6~9(F)()?%O2AUy5TgEAE4hQ&yMP4&&FW-G^fndmMR4P)l&HOrky8R;ClY_AH?
z!y*+^5uvx;?TEIJ_Rpi=2mUnTu<vJh&@AOFo?X7VB)qAQ5+?dU5IssC(BL?ptq5;|
z-`MaUWoMRTF$hA@9d#*Dg8ScCbNqQ7<fWPom{bNCyqt?QXF~xcttU5L324Ds3DL1%
zQ0dpM<QzX;{N<U4aJgt{ZDgyb*h!9E!I4PN=V0VYpLqf*?>+g>E5Rb@bG&Z9cc8Eh
zg#FLbFHa?mKhp41_AK&=k(_o^xFmANT-EnNBYyfmaE{n&1sozT>KrYhJj9}JAhkf_
z(BxtUJ9!3`&D%o2-0BO43^?7iQ#Y<9#)m}7&NYFYY=4RInalhvUI`5rJ*xeeyYN77
z$Y4(#Q@Z;1Z_lDtE<_ID1oEEiOt31b53zIn*lQ2)V*XBNlGs;}84`#%4Y9sK=N{Mz
zC+c9WkS!!IaWD~<Me3!DbIp<5eW~dABi`vhO32x=`rRwf4CwRazkiYejpJ|C5R!YM
z*ez)aQ~(<C6!7?OgqR$NtWB>g&%j)PT*!K<D@UmadCGNw7GR<(-7EB!?W(1^<f+)%
znJhy)O+A`f(x0rLIOJ*D)S9iP>!$VTKaPy3mH4IX+>#guK`6STj`C9Xzp--jRg`9A
z0}NqQ48pm&^_ReGdh%+%IQ&S#u#25A4y(X8XculG_>LMK^cDEd_)FMh>kia^n_wDu
zL32XSZBt=%(65>kfBbjQ@K7TjUcb-wY*%V2%LQDHf_=BRJ+R5+q^$rtIG}Pw2tjeD
z$<oSYh0nnOmgA>uN6VZ0J#kdgjp@JZkXziK{CI6B((%fcp;Y{iJ>}037ouU4&j)vv
zlG~x5j-XUykQVgdBpbiN)ZjqLA>fYIzy$jFBvB%4@YbtigMf_mFX8mPutM12tyKq)
zOH<HAD@a50#`a6B;}ZyK=8!xQ$h2s(L`KE&IOYL%mEXMuVz+%IwhLK|`!;WdYBmsJ
zN-fJhT1jl&quQZoUcU`?<RCG*GW~a<#73Qt<~G0V`0oxX=SfUfB_>-XcH;jD%0_;9
zNYuxy!rS0YLTd1M0J#`+K+NUF_)A!}Imp4Hw)$v84{W4WkQ*Gjci25uXlp9k=aY?@
zgDbw2ozaoQAPhuXBCI3M{Wo@c$xn8WJyr_P#274umbX`-O(AeX!oVgRT7S`UirE^F
z-(%UVcZ8)@?jk6u_UYZBR>+t-nn32*+S6Pa&q80X9AoN;*O#j%3lh#viXrLrvSdgd
z1oMFv>xouse~+D1W}=-57HQ#5%!ySYP-)>dWTKrcD^E-&1dwLiV|G{@GQAGYD<Cm4
z`g=#XmVs|xp`}Q&SSFkGxwTOgWzkBLCf7MumXhqZ@jV|!vgr^)WO5y@mS@5G5npjv
zW1rQXJZ5N}SAO*VBuJxp06hzRGa|Ma4_uXUxJfpn5HNLM8#1{LP053nGA2L;2sAo4
z44GOd)7J6AMg`)K*0a#p^Uv+3R^SKx?Z_3&ywlc^F?G1FlldG_MLxiOqcu7l47prq
z0&kp=$skuuK{kmFsX}HzHTeML?;LaPoU7=7BqYOJQL~HQYW{J}CxLH9+7=@yVh%<|
zRQvZ1LPEyV$@(t85oo8`<iwM}H`C5Yt9pN-8V83_>z}eS%3&A=Vd#~Tn3CrH7aQ)r
zJd&ws`$iL83zQc-MXppAp>-&};uZs5^kYC8N-NqCP`fFfQ>58Mj7ojXG|p7i9iXUA
zC!uaJ*tx;;yZBj}Hx$%)7D4t%@LKnGp^tw$rF7`?$DV9FJ!(ED>lIN7{AlQ4UeO_t
z$fHR3=Ke0#0D*MAWAx}2ty4bD<Q3@%2%$qk2eOY1#47rmz<(~Iw5LWxb$Xo*uCO=h
zsMHpb&H;hMNHQHLT7MPzoM(k~3`B%UQZDX+bE+%C3s6I<F=M`s(Qb7*?QC8L-xaDH
z3h-EbqMDPYyl3wAN-__)pw*U}F$b~oWd7w9jR#!Ppc0{Y0I|3kcRSR(m+~Q}BBR#w
zdo_wIwU@Ea3DI+ri{|Z%PTs&q+Quu|6i{=jXqlpKGQNIlb4N<uqm&diW$Y_{xN&7L
zvT)8m^f@O#%Z_+{Q1qR+4Q9S?Dg|9R9+L2vu~h{fC3hFIG%~vMsYb3j`Y~#}wjB9f
z)IXG+3l0Mz2nDaCfWP}+td422L2a{KfS7I-(8s(>VAnG8G9!tS0l?(tBnh>Q)w^?u
zg1jaB=JR4T!oW~3;K?&_4IY)4`nwfo5lDr4`3^(;i%!7m<<dllAQf7-S!Mdggmk!`
zu4^?!tx#uBwTS&?hQPXTX5Y)YBSk~)+e`yyvXmpr-RO7|`_IDNo-}TrD%74LBIn5+
zsT#a+$B^w{xQ?-#>6^&E7wuI$#sqHf>sJTZaHg_I-QZ<A2E<}1_bQVlmpvIO9lUHu
znbhNnx_2<7XP+KHSZH&Pky&}e=Qbymhb;9(j^yB0ya~I_5)HGeg+4p~+#{5Py^B?b
z0f9?qUJ$$U_a31v>?J!=71Na=r9t()tUQv1y<kUX4lZarjkhs-6Zy}w$99dK+dN!n
zF)v>)k1cp4Q+fpt_N=3pH5N1u2;nvI?@!scv5#gLEaJ*Azo?!^Y=ju1eS><8nivo=
zWoYr-^AW6vI@nIKg@2)+g6%JtZ5g@<eWW`d%FZB5Vh{wPSBiq5_rF+E_GYRjnXt%~
z$1^GfDxZCNcH<5GyoD#(;FWOsBi%8_WIzS{1+vkzHeA7P$d7UdMMcb->T7tL>y7FA
z9X_40!+>;mfD~8OQLcbJgm62k{>Eh@d+3?2ccvfQrs|GP#P$wCZMV#JCGL<|CxQW(
z!$^(eQ@9;M60dMEgkU=Z^v(sr9x}m`3Y?n0-`ynM86c2Ax!mK_v{T>i72t-DbSG{S
zh&#gdIF;?J!=$F~UnDDcTz!ven{jk-pXgz{5*S#vGcl&X;v?HZl3mG~ltKf`cI?`1
z75vQ^o6wS%SqTj++Cg)(D`-AF5>CJDjqL}=DT~#(S_QnrjcYuU2(R!qg!DRS7RKIl
zflA80BCY>z-#V^L+rbYl&>uv~Y1t%9ukbdMSvzt;onoRmKI1HJq_!U%?>v42+!y4x
zs@J(stl~8ld*GIv58%MX-WYyxnI$`M3u3|!PX1WQa(KmQZhyp=2*l<<ccpL9OKuZB
zplww{taGeN`@0|?%FgVFVGxFbEdhQU?!U2Uoi8Dhu?h&o5Of*6)pzBU*|f7rvzIP#
zM$nQD+NYTzZ^+Yip5Rz`Vh0(2AN=c`IuS40ns_RJ3g&8C3z^`|kT>MVTur9HAge|k
zUJh<5Mc$B~b49idgkA{Ob?~nl@`ilV4uO4Kh$oo!6ic0%p<~E5?O2E$4e3CyG&j6i
z`S*Y6TXrl61H?gW4f;PUePuS?{mPdWW@4~0^GKsnrtlc5E`9BVNxdW`TEIlxtHpnx
zi7PBcJ4Sz=+MzBU?zb|h;u2Wdk1HfftI=k#$_#izu44!By4eh9{*#+ZVK?M4JN5bO
z&sYnHiShPjVvWb_*bTYOY{V<kDDgpLrqCN|8%u!HpjsMbWe&9ec-onO({_m#)o`KN
z0~qSzc4s77+J|Dne7V~F6vhW)>CA99v<<}~p(j?ZjwXM+Tl~+~w<cGsDy>K}%PEX+
ziH4a8YR!M}p|cP*tdOYd;J#Bq%>#FA$qI9gE{(C`?4TK793RTg=m=sEgn})pK#cu2
zc5MDo&yg#Db4&t=u<y9=5f|<!9P_Wp-Xd#K)iQT;8ilbuGv;R<{S#g5^*uxSP>HGn
z;}e{8=gq$K8_S1fM@<3G8ia{Ez}2heOsI^&ohA_V=<uR9{JF9G|J9!QciJbFA;9BW
zxmxsLJL1jAcba5U!H@C_t)*w!AsQ(=?*B?-BD)sbm3MoJ9HJ5jL72C59}AX~X_>XK
zkwJ&3M24#s%5|tCqK+kZ#t#p3p3Q1VW+(~OQ#R>Ih8?0hsntQb7>#DCvg_dPDV~VN
zo*o?#$x#hL-MDUyXCiX!>On$@n1JNvYnQeU3!enC7+|r&oF?i=s{_waKy>2obdU8N
zr$WoxqZ?0{Is|IyCP1wky=PiwY!fmw2oQ~(J%;7h5U79k%JBbpJhb*yK);pYFT}{#
zz0L&Uh~D|Cf}WX}|G^H|*E8S?)e&vij_fn{=BQW6jqU$CV&TK|Lyo*d!QQ#ode-Wl
zBtr3zvU5w4AOwNnmDEMi`(JEHzXqi{nhOv;J_gV-%YyrTImZ@UR46wk=;t%c4(SJ3
z86?2AX(B1#3or%k5U1|})&Wa?Tb<p<YZ+dLczw^>WL~%wYXvWl!_Y5N>4=e5({o_Q
zX6%7sT^##)K)knWw{*#UEoi-K<75~k(!IB<Vq=YG7t-ixiKMczqx96WEAEC=s|M!d
zn!%Td$Mjf>&2t_lnQ1@`*A%@(yu4=?5<Rua<P~<2Pr)At#i@HZVcRCD+>Ev;p=HP@
zau{P(lrolb@H7o<gfs&fk;4~@OZfr@T1h;?hR>wR6Vk(hy(Qtn)4hHAeSdl;q5a5w
z%9lVdlXoH_=^?>IP#R0HG%`u-K=SB*v1{{YJ*!RM`V{<SQ6G5oHR_)=lva7qaX$#r
z3{6DF@|7{<sme8c3q`77@aI84m^{`1_og_6A~?DF;0&rn4j>N+273U({dczD!!u$N
z`4RV&Pm!L7z^m)*m)rknLzA_7Fn9aA|0z4SB#S{1h;Au~sMq~(Z2F|;V?fHeY=E*%
zgvQ6|Z>PY&$r`9swZBSCSsgDSP%OfC>;XzIwK_2a+gEjkfnx3|PwSG@cYD3JUhd)+
zx>8-7Ggf1Bu6H!w(-X(ESpk$-1n=AnXwbk_Na7}2h?OKg1K-@RrsD-O!*9tsb_q{n
zk;fxV#_=Ba^Jj9_T!NEW#PJv$9(wrpF33H(R_G)aX*`|laEo!XYqzsM)98npY2Kim
zT>;6cYrRHoTkJ~payNQlOQ_Ne%;v`@=^`sc5&O6%lANu+ee^%OF2}fs=?Gw~=l(rx
z=IZ43AuA*i3kV)sNS@(n6)CMG6H+3Hn0L>*ZdiVEVzI0~IO!xSAQ21r9myxjN(0jd
zlsplC72Jn;{?3C3_qrrZCP^lVUCFiHKuf_#*FUHVyx7}Kf>*NbI+V#?($*_ru~y?j
ztu!?H_fBpfRWKa3EPg(Yf>qO07I@4tzKMPqyyx%ml3;X%<%L0cGROZEh9An#D2IU%
z1fo~M)d9W##mclzQ;{~yPe19#tnPsDW)B{?Sg<C%B6j7<Vf6EGMd|Eb7MG^?r&R)h
zA4sk!D@cy<-OO_*(4Xgw{vY5aEoe4}l@-n^cn<`pEEYfs3-ZXKi6fy^I2n+AdfBFH
z5$Y(;0iVxZp=4lh-60}_Dc$R9a3}E3^~TQIq5NB(5=>etX6mxS$Utz&YHTz#)e9`k
z9a^Nq$bbahdb#YQh28Ze!Y9vNDHK5h*Odc({s(k;SV_~URX7=txD)#lR*4#6pqkuL
zRG<@(s9qb3m9%D8Og+~HmDpi#(%)PaG+ps5#}e^c!Z;w<WObT((vyrB)8u_AoUUkr
z>#A?dh$+ML3~iOrf$Qq|83+6N@Z>$Q^|lho0Rg_ldIQzv;3Tgl<P58@91!R`;zx=H
z_UxUIpX*NO-<zmK3j$WZI6BygfU@LenWcpZdsML4!s073{3ltL%2B?z^N@<{f|*5E
z;U)k1v8+HH@agAyP<95m5`!QRz0y`h?ENpcJd@3j$ZyI8%!Vxt=rHp;+)?dPpO5jI
zn{SSOh{~R#?Dj1aAoKZ5PXTkQC`M>I(9>IckNFY@Na!&Y)d+1NLven9M#YqwIEPwA
z-$4Vhhn022Bvqjg*_)&P|IQ<?=V}N^`V^#i(4F~jl^c2uydKJj_{{1F3Q-}6c?B#2
zuZP?J#Y(!pJoc=1RfHt8g^m`SM1yc?*V%Y;_Cs6(iuMK3J_nkxC7*oh6}SjiTHa91
z)uOYVoGgl2Mf5>;YR`w&IqaR<#NzH053`c$gG#uI?blK{o$9G{Ec#kS_d$1ZkGB?c
zs@FwBMqwmPS4sOpCD<2uxx!Nrouodpn3v!}VwMh{sU|)?bY#it6}SklT2M2m|7{)Z
z-kz0!yA+tv>k7Rbix|9(-0yz+Ltw&#$#PT0L+NH+^eiwH`3jXiONTTeDiEAMiHCue
z^ea>XkPcolmMItxt7l+J5*E5E_dwt9i5!FMdB&uIqJK=EFJ)(!oG}PO(H(V+LcslR
ztRDK%5^d&V13Wk}{CGL{N4zodwVAZw2Lzv$2o{=*w!*4)B???~`aVA>@hkLUv(;jY
zcvb#5@IoItoOUJq|JC_iUxQK(C=iv4ANajifkCKjrgw<dg~=PU@x$%+QUxG+F4Tg3
zzba|aB%)iQs}LbHJ8glH7uKv%5W?)<zn4me&Q@EH3E7;0ve3ppSa2;JN}kiU@PRiF
zGtFZobqilf(30OX!;@EHF-@bb+k#gTbe8<E-nE(`{NC`7IQ<eUNmL(6)Yb*X$#4}e
zzkH|H(Ep#gKJ@DrQaM4n<_GGNl_(3E9l1K@${x$bz{0oCmHe6QxcW`|Nr!$JL>2!e
z_RFE9MK9Kl*rmI;p<Cn%U_rCwhb`_~Sj;#~v1ci-=>v1OdQORldOhGQt%7dQEcjU!
z?dmUA4dEyPJ`4TweI&xxfB@r2hAnK0x7d~Rkn}!d#B9~0nrMfqZ3(WR8Rj!PUTSxg
z`*J$%O5(XQqkz|A<oB~15Cs3G?Amf52tnA5Hoj22|HYR2B?B`_FF=ez5NJ!V%_N5T
zzCS%R^l<_A_!58l+CZ;dP$r1oNJdCOynGL6E(KHW1@)|Cn#O1y$n@v}Fnj?6sJ+M8
zD5G;APP@k{r*8g$9*y}#(udg06k7b+El8%IVlC#fn(-hRp#ynH_q5ThrnX<y)EPlI
zj23}BrF%e$vhas3O<6U(sRCsA_czV=ERJ@NMB~p)8KDEY;XOaN9kyr==$9o@GO6j0
zV>{Bb<-&c|aAC{i4wjh^?chEKr(kYvt_{iB9ZfS~ba^yE!{h-Jh88GA$_NF>dSpVY
zdAmJkkXTD{WU2w?kUoI@&w-i)Q~&s2l#vOLbtglRDo>B2f`XgfG!<0u6<fcCWr<^<
z3xP&d$XLpV1c<t=A=sBJMJrkX2`OF~Ccikvo^Bpzap@>9)dV4(ntl&`POt~Cr?w!H
zDG08~J7*%c!}bj9^6BSuilq?AWivt5VS6lhmoYKQ(2-T^sp<C{`BQcV*$#ss6y1`s
zg1G;UeQpN72PHkB^Dr<J)Lh;RaL?_6MK{2VXtbBHAM?*NSk}PlPOl>q^S9(pR=UB)
z_bjCNlmS`w!^U@m^#4F*m|twW(_xnA!`TstNRFL#8vMtqtWCQE4^!Xiprv?<xmjhJ
zUsl_vK_P~`wWkW7Y3%1z33w0C4P_J%41DlNm5Ne;1jU})eoMVVO=QfI{#%j?kX^E;
zaq9|MYNm%bj#ab*Bq;XWr<d+sQaQb!te};o0wjPwbQ>>)o`uSMOR^-Teik{OjtcfN
zW;Z{5p4nY#XA$uM{0FqfX#t-5dK3G{lGuhsOzduPqxPR9f1OH4Tf1NE^zuC#8j&V%
zB0ny-28*qJ<5a3hk!RKrR*@pmjrUp0>o#xkR^wc6LO(9Iw(aD|0PgU9?0Kl?Xt`B{
z2()eU&U~5kUFN)GBo261Q3}wA{B(gRy#}|Smi3*IP=H40r!z^(;0%87<MS%?bDBhP
z5WxM}`@oNENm8j+Wlh2@E2iEZsgq0pC_AGh3PBKxZb{M5_P?>m=?|edG1E8G6cOsZ
z981Tfcvr>*=ppy%(BQj06uV?z--7>nDt?#MVp@^muYjaCY1%5I0`x#_t($p3mVy&r
zaZHtprC+_=XR!Y}6@S27vB*};@!G}9j~laot+j&DnFz^u#lNoofZz3YTi?UH>2Pwp
zEADbVbv~BT_6J7!4nkvx!=W_#`-d5%K0-Ihk?sH%7Q42RdtDEykJS_=C84mIBU|!R
z?Ca`iTg_Hza7wTR*y4C5X;`VW-H+5_W9>03GIDk&_g$&9Zg@{)Z+LA6y>Qs4Un0N1
zPDk4!v#lBqTX8Q?xACK|)ItZ_B1bF%CmB9Oz6Abr(_SLWp$c&Ic3p|KK9BvHfa1L)
z!`2KJI4=Y<@ikVw>*|18gZC&40E1P*xU;=W?sAn=IIsY{HJ}_!vJDTVVlP)Y0C-c7
z4LxHrk~Me51Fnv_H6F<=P|EB~f0rEK>X2KEZhSECG=&M3a#wuXdJ?xf#NToEyU(Oy
zdqV#xyOJCTLJ;^RK}7oh9~;VK4v5{6%N&Vul%=iZ`j3p59s-%#=k4a9$EmZg@U%68
zdX^xxt>4)O9}ahAYS3M?$6y`<EyN*`_oPzMBAy4<qIe4OnN@p&mRW^Htr5&4K7x41
z44wdd-)<s*Y{zCt30B$z#Hu%xDg9OW+1k@o>6OYG2(Jb`FS=4^B7}$GckZ{vCt{h0
zV_m5Q5x&C=moQk^Pv`_3PF|@TM6n)bNP7}yC_jUA75eoyMyVcZctV|>X;^xAvI<FC
zH|MRTKgVDaN~UgFiJ`3<d<PQJV*%7b&&x1Ut8lbcq8Vj}d>aW6e8~^WD$Hk<?J1=5
z02K%f<-@0`3O8A!I?n(Kn|#g7H{vGn$5!hm65x4MAl2`e5#Nqe^h&mt4Nxa-`NKf;
z3nK4&6Z~W87LzK(QM`qM42$q#Un&VZiu8a-jnef%nPKQ%?DyLq5j!G(5<58fho(VF
z<3~j7K;qAnAP9>@2QL@9r-T0}JG<P7K^O>M2{!Qn_rF;ErIlKPw_0l-_RWe=f*CwN
z)P8L<+fEJ_nUW9%KdSxDs)S?fiwnlvo4c?;Jond%SX&!oXLRx+z7?lRt{p0JYFP}$
zGn%Bgg&U%7wkDOH6F56qzY2a0C~(f?MXBhX6`gt<8fZ;qnvLIyflIPy1>z2l0eqJJ
zaznpv=Y4lY^(>1_SH{>5-TjEwSF+v}$+Hy6t|GY!36otJDznOPL0byf=*=OY*&JP2
z?MiouIb4n{&0p(lT$AbRN2T9?l`)445eEi;a7B}Z`Mmb~CE4PeJF^gnePp#IwJV)R
zf#eE#b`g|#>B+}C*QC-L6q71fTTeh^U#FYctca?mm{i#uSzpA^kRO&jb7^-Cc0HJJ
zIlAOB!z_`X&5~MMn_Ula3k!zq4RJn$?iIDRMhwT(!{DSiEcc|(TZQ7J&9SHTpR_gy
zgY(z;`p-<Z^5h!}9bG(H;)dPv-IGnWbn!KIu_ZFD1-HWgPaI{X5kutl__1n!QFca0
z5Q88PZAml|?7y+&<$ezJGSYzKm_#(Yyrt24R1%9e4>VKNqOWIk(xEPr4lg?z_+>>j
z>ds%eh2ShHXOn(eka(8GH$+-*g%Q_QH>zbi=5<Qr8Xe`e$&>H5`K_DjYuCu|Y31pF
zuBeshXh&oJU-3xr@jCfzufUXO;#>-SrfXg!z^6kx_QK|uihIrcwp7c!MtTo6KEFu~
zj1N#3)@PZi#uf!jz*M(ivxJuRjR#Cq<=C$2((OlN|8V-(>a$KfQ!`^67s&KRxEM&m
zdNlIOv?oo(KTD|!>|K3JS!;c!(O)NrkB~HAf>+g6ZndSF{B<(;5Tf15m_&iDYq*+a
z+Wd9m_jq|2K63XXmTt9eO;zQ<?-A4|PHn(YH^>RgKm;`Udpe?g@f*FM)13|d|5b?w
zAND`5nuh(e$mRvVQ%e$=li*5WKLfwA&D|jbC(uaq5%WFeNtJz=OlM=iOgw&?zz~IB
zgJ@D488<@@&}i{#s8DzBqxg-=ezlPgW#^K_KnMcSE2$%(_rF-Wt!zLh6*k!<MU0;T
z47~n+z5)+WU*yB2p0X~~nH-5AcxwB{PVv?0^C%m`OOPItIJOd+Kx2`Q(kF{hhY#=F
z>sdh)m<Rhz^19$T7oXt?*JoA81lEG4!9F~nc80wZ+fT)|cbkk`SQEngnM=87mAC{J
z%6yJ?7PC+Mp0585`*ks`Ma}0;9b$aL==Yx_6()fNvJWq-o<q811l^NKk&1CIZNSaf
z<`7=Y>TOvomV*X6{F-5G7_w-RYMPd2d-*tm+%#hPFmAn1rB#N#gJqT;H)70_psfTV
zut4)63=t1N6|CXfNqApD5tx_dLfnlAWm26GNB&;OU9lW{C}*PpyNn5UpPZXYKfDE+
z4|7&V^<=$uP12H5KfHx1AJ&*4HrWUO@S=a&eqT-TqT||6s?VzFk!+PpN4#|}`K)j@
z47PAEC9B^rwZxl8`QSN)oB`=;la<k#R;6p*JjrKZKG@EL%{V1#Z@X-NC_AI%3PKPF
zUTIe}=>0Di+T;hN@-i2&s4ZOtnVt`Uuk5Q~aYE>vBG<fefKyS#dnWk+{(RggR=ZEt
zgq%`tI7mJWtujyLdy1ndVHG{RA0(gHJCS_igSf>df86cD*`?6)`CQv#wowi?E4&1!
zqPF(~<%7U-&nRucV<E4ZLkj)y1HwU``sddb`dC^?ZJFZ}7vzOYTvVJ^9egRVWs1)W
z-oRR1!nY>vT3ShL2f+ts+B=X2Me)5xaeSoQmWF+v1)veG;nr@?`xRCJ1b80y;qeQA
zA6S#G`&X!BHakp!8eX{l0ZHIR$)jlD-3}8VSgr{5?6Lb>OKNz}lRhsUaHh7v0~Fpx
zQ<1~F9VKRK!+b;$`y*ZXyz(DmXD>@a^-ZqtW8Fb3Strl>u;U<i#eH){&2y(qNe%CL
z+^2KJ<Vg+t#<v)aP~`BQ2Y$L?ywW$yK8|Lw0i~>Chu;YAfX2E}c^BzY(b{`P_5d29
z3yw^*JUIVt<b6|iW=Rl(AP~Kh8zT3=*!avB>ZHO2D9RA_ZXVg$%hts!46f_kR1e|$
zwfQ0DRF(M-PWOg>j^O&$Z~VY&P`K`b>`N2EB=jKu0uW%J3ZdrAsV>Q&g@R<09cV;<
ztxgkR)_BN{M9FRK2Vg*Z7))3RvQNTa6!(M73K4}QO2B&Q4@T$?)DiWRrZeeYlhc`Q
zUIvXJx&w7IJ%y#%vF<)Ycl%B4|4$+g*#%^AIv6OuN0p16L_)A+zks|Zj|uv+eDhP0
zAS|vKOYcsT0L!(!|LzvyI#9Rllj+yltYv4gAT72pqF<i6xoVqt=umV$h1#iiBm~O_
z>Pn#V8Xfyl&MtvP_zqP1wgd_X95YOlgZt+y`M+h0FDs|Np8pFYsotwy)Q-eS*%o8D
zB;D5ZQq?ZsGSn87oh1ZzYmV^BXy=<mqGb1pYp&b?DjYW$`DTKlVAg#THg~42>_T+W
z(*Pr}Y&*%tZdF}OFPVGT_C@xK+78i0)ii3EP7v>%ew3Zj5rrTO1X~gWkM!TzV|`zN
z=$Hl=CL)25+Y6RSCgZqfAE0V;Z>4_&G-lmy!j_^n$hZ5<J+6so#Zek%h))xLiHd(9
z!H@8Mk;3U^|CpI%<{Ewq^kV}}S~yJx-!hXFygiq0Gfx_+J2@wa$Vi3TsYmRh<k;{K
zh>Y(ogKN-Y&Q;l=Zsh^m?LAXk2G<}5?<s#}btg1^^9!{MO+gObLzxk>6YTR#L9j~(
zR3`7$HTMyk5$UpOf$64YU<&eHT_F9gG4mK#s2WT=bv4tfvOKYk>i@jZcg2KdcnXp)
z!h(SpPZuY;u`eS(FK%h69e0$cz^RVYzD@fjD$Co*1)rVXZye&bp)>hxvFZ{vDTC86
zkKX}H-BLgWElyo%JdhJpM79yFl~lSMi>hmG-wlL)vl?`@SccXh-|B+`f7}qWURC$M
zCzH{9qfeolL9(Pkb=a4YUjnieU%_o-tv3+5?PF(hj_>k0zy>1UoR`g$6U6yA_>ZzP
zN|G1^f#{V6Cjq(t#g>=-m_kV^T!6AnqygLRcmIjzsw#4<3~Z#`irn1+w9N83xD=N2
z-?mn(Y|;X>O!J{ljWZdoCBUHX7XI)tQ(H+dJh73Iab2Wsu{&s)IX?JxEAxlxQoIlF
zj#h(Zi!Nvcc)MUitfy_XD({FXm@mZG=ookp^wEJz<~}#^j+}xmu3dt$Q6O7%#y{7_
z$H@1eav}N9R2p*9fe=<y-yN+6^W|WohsdB&g`F?<qy;>lsIgx}76K`+d6E<h?;ww-
zDi&fk%38|QMBfCyKbD?I>sVq3EHF8i;ug1#eZL`T0xOW#qoNvDKVP)O9RZ8E7<XX?
z9`Vr)cceM@!=s(x`NGmJegYT%G??c{-vqzi@|h_<C`il$Rne&2ssTqwU}9#DPn2vz
z7X0!!p>QiKV?Qi>flP%<fbAxFgQNJxXJ_U4YzFdZB&(ALM^-qMdP~7#E<7J{tdnaG
z41~AP-dXo5ey4$LN2D>POS_GpKZ!y7QFca25JWH#y%LEb?tiiE_9wAQE|5_S3EJxz
z+|{y^oa0(PJ_fg!$d?{*LLZ73KEjPYWQjPIDbR#f?>ajbdlP;Xd(3+H$up!0bKYH)
z<dCGyD$6jeamS{ai#l_HAM8Ar-<Z)kO?$XGni-UZIl<4MLj~qOmCmFQ_Ltz7raN;W
zN<ft^sM5IR#!=Nw(?4e<Lv__`^e^b~^i(y~aAyr9sKW^rAXRD{yuoG$X<^R2ODF>s
z)VI8p9fv9|1D-JF-qn=)SmCiA#qn>!FCF8&f#@bzP*N<=Q9CRznLOwGyC~}|G^doR
zC*s0P!7Xf;{fMsDx}~E+?B!6&W$+fZtA1!XFp&5Ol;l3&USeMw?u4=(9ga*SoJQYU
z!~ZXh8{Y@ptGY0~1wC^*$I6g7Om>7pC#Xr6AFUqFIyIF*H@Xk4y&HbyMPpuo%@913
zLN~k*Pu%8MDH{b5-+8~pzV!EQJ3_!K`lDm+@cCz4%`<=w+ZjI<)$=+O=QF1;Gam>V
zKg!Mk$6^o!qE~8_+VTDuTb`RumP(Uy0rT@KC@{YHr>~1hXZ#+xed9a5oo*F^hI*J}
zPNus9?-*L9`@vZuXs8FCvv2AK)(``-LwiV;7#iwfY;tf?F0(P-Y4j~>Dg+JnFf{>U
zee=GFEpADgsxU4TH9tt!FZ@eI04Z6!lDwnpryGM;-z6x+diE(xxjU+UV7>XxN=vFe
zzApa$F&`>f=q;=2<h|sc11lT~Ma<6ue)a0ZuM#||N=mm1h(Zzc<GcEvOk#gY@kwLP
zDord|bZlP_o^URt4Vn<qXN7YiYY#j4b9xEI)y*$i$<W72N!B8#QUHu`M}zE~e9;O;
zLqYzt-Z^v-@d&QGeB1JO1$3c@Q5O&whP`k>&pX-Y71V{IQ<s<bp!|IKw&dpLm$lym
zG&*%5FUN9~J61;No+XfmqE#2AIBrx2M~x*1a)qR!pa7z|+`Pc@NP@ZkW#RX~B<O!U
zQPHd&3+{|##ul6v*oA@sXvysdF1qMDTGBYYtn|bGV)KWxGf1u=1cB(4MpV@MUo71w
z8-Xmk>aVFO{URW|{*8aI6r(#EC6@23i(VW5cQ2ndAYR12_&c_Y8ALL!TyJk15Xq~9
z&Fk<k*wNzjOzFelvuRiUcX6`k&h_RsS1!*N`}6UU(8!`kBEhiv<V9C5p%?r^{lDHx
zUjLj5Y`yq)DTSCp(j74&L!w(OThua6frY}<*z;wLP&s3cPTD4C%9Cm37JBGE6r*-h
z2`L(M^^~G*1@N#R`VW?a@`4D*nJrgkRhJ4{9-dQhNa1Mh>gcrsg?1Ev#P*08fmP(o
zHj!kto^i=Xfjn#vtY>3`I6~Zm|9o#n7^<)swudGJ?k4hkoPQ2}SJoB3>!FF3-GD56
zw00F;vT?<Id610mENB}wIzJzlTz~=|*dESkM}YfLqJtHR>aEG8`23ajq6cW~Ph&^I
z#c5^pivJ27Ld}p5I8~j@S6*_(w*(dtYvdEr%f}JtQ4}d$DpCX*5DCNtV8HXPlN7Cv
zGQz(j2?!aHQGbghmf=O^Mj7JYe_cX9l$~3S#2^d=uLOjLegBKCi=WjrM2auKM5Dxj
z-PQd+PbKfD5Pmbu0c&{%gf|fhRa{^P_TA)Od|LXwDz4wJvy(-O<Jz#R5sPOidlNSx
zP}{kabnkATp26&GNz)d`oA`k^z#yTzJbCIQy0mG_<lv!y8ZXUB^?C}mHxUX|LUbmb
z+YO&w{+LX`HA$nLgKjz7^f*J|Jj2?XH3cGgVcgng?vJH2)z(A+8A0a0k5K9EuO4^M
zQBO5+28cJ&3001<UU&Pjm&^8+V&YAtLT&picZ`FHlfA5-DYjw>RN}4@Wh>TzOuQ*Q
zGhDohClCVIsNmSK^yTx@+V5YG>Gp|-V_(mlan-%}-FYhG-ozFN`vfmUmGK>+#5oE;
zhUzz$@n>xLbt@kl{BRV4`DOX{$9EZkHVlH|sEaAxx=n90^u396XuBn?I)D|UdYx}g
zhLAT^4sCpqd|BAMqX=Xec5^xB;tIyZwi41+PM+FRq3$N)p%U8#y3)qLuRoU!DFw;z
z(eEE+=a%F!2m`?@0p{Vk|HW3#{zOJeSr<^b2ti0_raia^3pu+<Bbqq(OXf`1!@UcI
zSS=Js?exZ1N+5r``Jn<7eNjp8QH5aOB%_bN^&pzy-aKe^Ek&}I6pmhw16Ek%1;duR
z|9lm>evSNDh|*4kxXu(j?|kPbOyoH^3YdkyXjw36I~lKf6Z*$zdo&+U6ce`Pm;u>I
z8STA_L-QfQ6&Qln?$LttWTk$`&o<G;>#}|NfFrtsCQ(LsuQJ{2K28C);+%%P2BDP+
z?c|&EZ3n(mWz-h!5v5k-_FUBq>(77A;%SJgjH+Lb|J5f9SG!@M?CL>IRwk*bI{D_p
zU3oxVZ;1bn)y}B;<;;QFUH5c)8JC@a^Ihogt6jZ*vu$t0UM>9`zE{eq`sLVPb?%{N
zcoikoNMv;P@?%1vFk~0;+Bf<uh}|=>y?m4E*#0_KN01sMgpA5u&KGEpsag#&wt;JK
zo6V@T<)~lq#4I7tZ8ubccc6@(T7E!i6W*yeyB$vt+rmG}&LxRq7=)o$@;~AJ7c0+Q
zVMtn5*)bm5Q6LEE8#@D0mL3GNn>-B*(Gs{}hq0gENJ|f5K7t8I<dyHag5VhdY*wos
z6B!C0eRw2kB{TRe#`udXUGX-Z4Y>**IfEnZ@J|?8xL)|Nz^E4&I`g(SD{`O(ebt;2
zx=|bd1b#V1V=9dcORen5ZW#JSXK=)jf-0pp1Ql8lceEcF7%`ln))#)KxISRi5`@m6
zh+zaZ&9JrJo@DZK{1y25TX4{UFw+4=%9?!ympX$_h7i=5xL^iKD;x1*`*G;!8)7&?
z2<B<&LN%tx={g&&WX5mh@cUA*t_u}tD(z_98SLwa3N)%*+wDv1$!Oh~U&&&HfapE$
zRx)N7)xVG#<U2S)nw>E)te{<nmr##mzZ|8lBDdT_K|*w1;%|3mvRC@~KUUEi#k`v=
z-c=tOJcF#35>ytS0bIwou#W2t#=&29#d?3CKY(sWg-7N#JTu-amJx(+$68DCRn1tX
z`#bn!0QW=Lxg}W)f<Saj(fDHj8yk-Eh2X8Q0V;)tmvr}G+oZ@U^fZwEIr=uWn+dI!
z1_-*{XV;Z2zzp*~lQC_9)TpoP3F4LFFgda5`ysY=tP_t>E8A|5xF0eDG8M}K#3-?A
zAGzmro+2DJg^cY(hHs(xiavl=uR)!YfoqDD{;Ffb+EJliDB^EOCPcMUh;MBHZ0(!6
z*EfxA-y^Hl{nDiSZYl;i1ZR*XGl)v*hlF&0K@w;i$wT8e+xH82$bPAp+6MWd1~UEa
z&cHRLpCq%i2U_jCFwI6^o(WRj&RjRNq65F3u+s!zp4mhbtNg_%8)0{3xMm6BNd~Yf
zmJ6tCGDtW_G-i2y*4Xxs^Bh*CaH3-ZMbdhLOP;}Nidg`n?;lljLxUxtd^7#S-xjgS
zi(*5yqm|*}U<Ohthw4}7fvz)|LX}y*n7;ekF8*vHFkW#4*01H$dj_p3cJXJ^DawBv
z0&e~NV*BoGBmBj9uJpF{Zjlz7fmc$6w;==4K=Mb~nH@<Kf>1Q2=LV90V#9e~gVJ41
z0v2T{pxkANH{SjrSz>qCm9itzTBv!V(l<@5o?Xe(hiec5;*4O!hajKa{Z54eY7!|X
zIz4|Ij0)PpB<j*%M$iEo4^Va$Kiae3cy^rhDsk__RZ)P1Gs8^tNU2yx-!I;J7z7WL
zFf{2+D&$fNu3wF3WaCR78o^Hse~wyD5CP9gl%k~Xo#c`V`_qCD&=`~Pih%K#u6HJ>
zkTXrAt^4a>U`UE-_E@cuCoSjz;pW-;LfLpHSeAV0FWVhPAc)0y)Sk|*wWM{ZFego8
zjr5ca!*+ohOwM+NH)$Gcq?a0RM&8NfJ#WgF{<0(Ci>EO`0Kejog*AU%`(q|KRe&Jy
zA{n!%%yXKG!C+xa4rI?pTn-O3{B5!tJWAE(fcAKANi(Hg(Jhnb4!u%wBDe<{Qk#!r
z8rD~KEh~i~qI*1fa~q9fxq4D`MyW7Fe2=#~eAO9M{%(vbtVY}aZ>3*Gd8x*@Sk8F|
z{n8HqD7&^K2|^HdC4511|BEeQKXy^O3oel9Qjsu*kcQ>}ZAG?E(lAckFHu<<46aYm
zuEP?*%?u`C?BN+Zm99pOsvaL3kI|djrLEhVRPOF5>A`$mB2PC~qVahEE1iuR^*l>E
zbVAaEK{a#O?{`%c^DI2DG^6r!;s;XDuX`DlJjUbITLr+?_=K+Hg(%~Ji7zBncu$ql
zGRPkv9RiYJ><K0{JlHP>u#$74hKI@Ll1=zj!{}*bus=33yoSJHz>0W+NMoKyq>>h*
z`%g16f;MtvuJgtLOO2iy^g9@wx?lqd!SuP(m3$DiJ8+j2H~V6^pk2PXAevO#ynoQY
zY^2qAN&hwQ->~zkMu~Q75k}W1BF74+=ZqPxVE-eo8KAdKQ=(0bKAwfw$Y!Skj((RL
zNlWWHw=Nxlk<Ej@>TckLZce2j*YPpvGWvwI?h?*nf2>P%;Id-@YZ6TH<4XZq=oD27
zf*lkykkF!-W?32FkJbK*z#q!4APHg+gnbDWr2PM5OSn<&jvV&NIM_8PAqo9u-$~kd
zDMGjDkdfJ0b*2XxW{G`!c|jQXF824rv&fHM@w~)lSki`+MM3k%l&Ddb_*rN%O~2rY
z<IFmod7VK~qnE&sC|qFhj^xG2Q)6>y-C2Jt4m_CZ;(AcZ$;Pau(cqW5{er{MCRnW;
zlD#{jCHq3i(CLTWgf!?);6Is8*GH2FKbT7KI-o$u65S{<b|yI(q7(Vx|6Vh#opfX$
zcZ<#}X2KsjEm~U%$*NledL$Opc%W9-;2rGBbREC@%SK;0WH{(9_V>bH9$pxTf&sk)
zPsn-|)Rhi0CdLk9MjTHJ7=oHyPpRF(n?%`R2S{|Y6l#G}?m~Zmfr+yN*$_`PfusvI
zT}{dE;7wxfcnt&YoS4^6jLx;*#Qw9H>7{iKUC?zNuy0_ihskc?SyuD$z10yTt}Lu_
zirxXVmzqx~#e11;W7$J`6Z%h9vRtKSg`oz+TI;^u0?NeQfjlx?At?A)xyb%ec1A}K
zgCG!XDFTA_-`KJKf#fDMz}%U@5`C<Q+)>E@?!e}e;j+d0%r9ZzSArwcIu{zW<Fd!}
zDf0VLaME=&4R8kaj4Ad(wWGb9=bVX|%=LQ!@ES$7cl0-5I}_(LMiXS$EIv!MBfy+2
zof%Mu;Zple1x2DAHA_xD-c))&;$0do)?!mzTXGh$onzSffFYF4PtkE}N6sR&ql9E6
zOxk#pIf@F{lC#L|;O<gSCcx~Q$NCid^%a-6pTju52Zd?=MCT1=Xh$dmx`UZ)^}Yd(
zv5b8`OX~<_M0fVt^22G+xz*wh-O)11R_ngnIFZ~_3Xs@?cN9Ug**dTTIj_pL^;{}!
zodTQi9c<+=gSv(t;1#)3tP;EfNZ$VnuCOsH($b{$3P#&l^1f$dJ`>gtSL99+lw=x<
zZ)-Em?|C`7^WA3WS4aOI7z3^25)aF?f|asPg^m6_m_K@8V8~~b=Wf-kQ(+^!BQP^^
zX&FEqi0?x6XN31h*|i-(5Q4Cle6G-cV@LS8iLyJ=0Jr0u31Uow+RT@8HYbJVk9tmK
zSQ#)O_a4M&E*$tU{)z6IBm*Yo-BaC#0Ovk<JOy_Mk{a@mY^Tc{t$L~oJjG9rmkdzN
zP2%c?J+P1|TBFMk$pF>v+M}4+*=H9-I2c{Fo9Z9ChqvbAucVFD*5UF14MF0&NxB1(
zKkk+%9`9?kBpDEVI4lT^0A<jU;C*LY`h7ii$DW36dv^6?-l+4D3=pzo58`d5!`1~e
z(%>RNGFZiaJp-9c)wQ*5uXX;zGg!rLJ;U>SYQZB<IR5sV+V4A)&3X*G?MT+)jba^2
z(6LEs=)VPdb#RXX3Y<#==8+7@l7OcgE~?LaRQgGml4>(azJrt&43ppuElsW}zb*%f
zcM9V0hTraqJD8kUk|Bo0WH~UuM2bN1AL%!>-<O1Qy!0`c!YC7_alw#EGps}M9XRM1
zwpz#2blsNz`0PQ3yv37|q0^Q21hq4)^Ox`ZD7&H~ia`*zl4y&t|6-5uzChY53vgbm
zL?9-vo9nhDc0Ym5XaVusYQ{wV4$E!X1zPzq96V2?cJORR2U^{*u7}WtRF%B8S}~Eo
zb6MJ6mP6-d7(a`z-GQ^6uCU5hfuJ9V;c~I=4xT0c&cu718&YnD7o!+kXa{l<eP?=4
z0@k)VWEIt4$7ESY;_rZ(3;)Qup`&wz?!Z~{@Y*mq8t!;mH0rejW|Elac6+c24W`hr
zN~ABbpHGfNG4(&c!CMe~{>Kj5NK#VAJ6#kEV#NZTrHFPicO>tq*HAZf@mZ~0xWB}H
z*&-1p?WjZ40)lxJg;850XGy0LR%{HV5=?PZXc`?*h}<2*2nXF)OR`+FsA#k%07;0)
zb~eGQ7@XyGS{zLp9bC|7zCao1Wtl6oIIZ3g>^bFY6^rbkfQGT8U7MCGkb?cf-$K7E
zI~+l$4&#NBA~6+zu7d)Js{`jubfMwT!e0WvEPAIG`2$4_krxdIoKtud{iE#Mk}L*6
zAiAXxACdiUY&h2Zpu`(C&_xl9icR;=sNEH^F_d-TPBXoOx9wc6%=V({+m>}$p#WU&
z-P<z8e*JZbXY9ZM8dFTts?W|N?Gw1Xf{VW|6=9U(LH}h}4l(e=<|W>%tJ2)*ockc$
z)Nj~_toQ-u3V{v{{La95uy~$K;NH~${wc<-$W=*Hh9iUB7HqnJ=*&XU3*sKBr1ZmI
zZ=~vCk-fT6zJ{Vmqjmpun#sV@%V|h?=<G)GC=%pXQ<3Ys&U>3Q@S;_=mbN6uxK%uB
z$9{K6c6ZKBciU&vBr(OU;#oVwGZ6NqwU!<<bVBU+!tkseVUa_V#eATAgMQ7ol*M@g
z&ne!>7*7kfvBZeDf%}zM9%y>VjRu+_A@U(5j<_?XC4wD6?AEb6fZUQ8J~wE0akLGr
zA}!j-wC5RLpbugDSuBA+a{arkeGB{WDaTUY1?DMQV>+Vpu9=+p$z{7pTUlGg4>!mF
zJF)%BB=7uDc5XQqgdh;z(iNrA{cmhIeht2&Nq-YUt2`{L{sG548Tj5Qf@<|@>%1hf
zh}}v3x=?60xRP9~?x!RcmADdOA`In!A7s6Ej_?0wRN{i0P^=?hC><8YUoxb`?h#ee
z3}!&V8s1nw#6(B8{QyMyu(k<zzc#&(NTl2muEqTnWUf;e0eMO55=CaQtf@yl>y6<<
zJVNKFT2MUTZF^O_bNUdFHc)4yuO!L_k~XjHmn@%06-(`e{G@x!i|4LO>wC}hfN}l#
z;q6PrxU`xFe@R}l{J^`@yc)LbTi&B%^PGQad;dE}5D(3y6%N7A(v|6bOa=^(`^#4m
zwyL$YY4^xWeUb+*bi|38bz)w|#O=oTAuQoy(sz48>KH&mp4umQsUUL5myl(DA7e|H
zlon1ul@K{RUj6_s6;y4Y6KGd%AAV*mV+)#7-uG$cMfzMs$V+_^0X%Rn8VjVrq&Cx^
zEN$<DGD3I&O`)p<`@G#bzK=?gagM9JZ1T0;{wTYmBMU+h){+9E_TShM?+bBnE)6iw
z?pqR`Br&T8X9$Yv<=hN!9JnAL^ZhZIF~$>7-7fv;@mdXng`9JFRA=~)jZ0q<gTpq6
zzE+ucgdsmEg)8`;O#~1_(j)yph5vYw`JWzx-BC1k>u{faJPwAOTpK)XA@&HgCwN5t
z{V^zSmwed(I^df=bd{WK>B1o9xKi2SjJ?d4W1V(9`UwS?X^96!6G636*AR1Fp0_f1
znIgCp!9;@invQ$@`oSv&mnnfu;fLzGPk&@Jd{q8^Ajwpq?UR}zxCb7EJ}3i}*>@*C
zaX7d@@(P_or6$Ut+3;N3Wu5$Z^{ul4yi#zMleYvCNk0?!R;#5Mz)7|{K^<VSdOQW1
z%*QCA6yRLTJ3+dU8aAN%DJuwF8A$N^`Xf$m*h|BO?c>-?&-Q+aS<b!`Y)hBb%1qNv
zt~(uLc7W_Ls%!NvGJQ2W?zD+~ofZTT3ZGJ#X{*_B$9@-~&%#Zyi|n5^0zZ_U+YQAa
z3`18UkQVO#i(Q}o1!zSUh$_^)9eZmyBt{jh!;5u<mwP`k{QlET+FBK%Uc|4c+1DYX
zXTs^EtY!3kKs~MtKIjwEAD=xYke-6K(j(d^Dp}Xy<e9)106Ud=E;p~xq>Ysi!aNiA
zBHd1JK*H4=DCm{NSv(V&0$j&9IY*VRG&%T++%``Ys{yT}v;u;T-E5URu4qg1OlS&l
z9VD34GjR`sfVQtas;7$89&ebH7FE6bO=IKr(D?hSOvhR57Vt?1J)41=XM$=#>?kxT
zV8e0LVRH2o%O7tNlH=tM(?o;DY`dED)D~`1)Vldoo-wz|sJfYSdnO+&oI3z#satQ5
z^J~%SnVc}8b~^gM!+w>5xZh{S-``~fFrB)9t8i%2nx1FVl4aNmYy|H#nuAVaFUC6i
z$o9vF2lrH%WntS9>tf5ddQc{*jo_VBt`{_yLx16}Do(K@SU~Q`xIHUjHk5U2#`Gy}
z1e-Lq<n~^nh+q%3xl*tUIfDHuJA)*KK@b3bNgx{e|HsNEC)8=nq1V)diYV+ZO08~#
z^&cxp-;>MlPk$NsVj*C1Hx56hyS`AR0!NUUv>-GdSu>60f1MKH3c*0UrQ%4k$qPTK
zA1;o2DOK=9J*NkjhhgLihn_nrp%KKh(U}VWSe^K@O}0}+1&kn`gJ!?DB>_bnNz~y6
zvzMa%V$ho4U<MZIm@W6-CL<Lzf-L^5*a9!M!$}R&=_#~AN07yyMXk_7%65%EIlSQZ
zQs7Jg9&Rz={tgPf?!yyTg}or2;gL`-B4jw;r5&{*6^?;qeb$Y%!yI3Vk3&7QR9FL=
z?OBgc(1a@!o<sK}zE>iTCV>_#5lRz;R>U}p@A0^T8qj3WqUe{iES=40DEB4>slW!b
z<vN0aMn<@Bq;N?0oN81OA8nab$2}wa61@4j&6EmkK-;1u=r=e}jg+O2L&Plc05n5+
zT4b(f9F=7k5=eywpc%;%i48NmKeW#A&xgMZd1fxJG^d8eUYW}BWvdK1^@GH|7rS=+
z#&|mvK9pTsvc(_>+Y+W~b^jZ?iTycLdPg=uosJ@49tWYn7hSx!I%~_iz;#S1HRuB~
z)Ot7rErA^_<Hf@RkNs)5XZkc0-(W%(1YEatr}>es=E+d@;bA>2blMbQXv%IVI_fR8
z@ak!CrYv=fg}9>!GGYL5pq@2!y=+tsz(xen%J_yexa%%ut0Vq+t4nKnuX-{{18}e&
zwIFTWD(vspqQ~-#7yyc&zMABpu_UMMDkqWuIXAD~66#HdlwvEB>;9COA?yQg=p(6K
zK|DLNUkl(G8NxoCgBFviI&Qh^6!A`uLVs@)C&=>@Q>($@2X@t*k`V)dhxF9h<tO&w
zQpdJOGD-mOfF9)!7V}~_O4!+sVt?<F7o<lxIFZP?Lt3!x%$)$QF(Ao$y;@G0&jn3<
z#)(`+araN4*IIjQh<i{LXCw>&k49&D<;7rQp(%nneM-Ur9@eA8Cuml$Vq@>B4ke>v
z0FUcw#?#IeWs=e5O?edi`;T8Q1xc1t_rjNmk~{+_-;a*LA7y8d>@W<%&@06<aq#^w
z_Idd$O4<p_ZfGVG8xTTz@#wjHW!1!^us5cRL+^tBc=nmE6h&Jc6|!qveJh>RkZC<k
z5wEC>>2TJlr>Bz`GNp&{dtBXOg<y~KP2}&NU{>XsP^V#PEWq^#?7O4Apbs-GXQU%Q
z0%Pf-)~_A)1$~%lF>06w>>dAbJpeKt^YI9k^Cffa0e~K-XjNZajgA6?EDuT8(b94;
z-YK<UM}0w-vn7rg2nzY~r%Tp5NRpB&&o~f=Mv!)6h**zgM|?p^mFKugPC`fgbUaS<
zCiai#PADupx{#b`SI;MStt0Iq%R3_X1qHOR#;yZVZ?z1W(Gx${buYjkMTvEEG#zBA
zpFIBMpmr1}^9hsoR#q_2-X?Gz7>;0hdKKZi(J>s4;Q2&G`-F)ZE)q+%IO%9n=!4M1
zb|0csJC4t+n{pk)@ra$8N~|_mMiJnbeAmLeBXprNC(6s<NFTSs$*i?WOXos~&_lfq
zWztXt)~w%lBb)tEc1F1pgCG>$l7bc8|HdAtA1^~?CS?P}m{ve9=gOy`=S`p=YYhJ%
z11D<&Wa26<X~s(M2?+?E=0&hK2MQ#@s~t<)$O?TzqJ)RX?4gQO1K?;<Kb7zk5@kHi
z4-fC%J;mTOu8GuZ?b61?2@#v{G7xJpYkLN-&@Ch?c@Q3XZ!;K)xb#)z@0${ZJc6tH
zVqg6HI2EZCwuM9r5A4-tsBKK)MC>=Qzwh>Z$X!7_Hg5xA*!SehtAe+XAn3WBOg#Ax
zJSA-G^8~3dC?sfllwOjm!3zdZHb*k3ASfi5XpPSOj&BO7Y-S%|De(pb&oyw2?{lc<
z8cXICDsT%42p%u8SEJCx=_Ik|>Ls*=1WgaB1o0noa#5E(eC|@}jTj!?5Jwd!RYA*n
zl&lqShC~bx`YHJ0xAj-zx0}ZPvG5>x?YC<lvRAVNa@{Lf4tcm}sR4fT{4iVAq3%-Z
zwdWhiUX0@C&~YX8a0SdEc15pNqybo@izm0_uA~Cy5StN#a<!>U1q-%||B?PEJJ)0l
zA{dBniD1Zj?*8|1bNu>*QIidHDaOR(=)P)S#<F`0%z<04D7)32x|WE4hB&TAo9(Z$
zrR}z*EITiL6u*q;x^(5>tH9^OJJsDtO+xk@GM3qy(u~dkNmufF_WC0ce-8O2d%g%=
z+UXXn&m`gO*Ej7z56z4evX$e>+4PAqSFPi4?S9mLAHNmk$=HeDML|a9C*k)lS=X=N
z6E+7Y=8$&8P9o+X;us#Xg{(qm0%RW2^JG(xRA2}3q{#;f%oD$pbeN8jLOGoC0B$o@
z62$r>b6A(Zs9(lYoqQX%VpCvMGJ`+LzmDo^#*-+KY=YaUPs{tSBvLJ%6;H+N%t~e9
zoTrV$m_|z48l(m905;j7HMH%fO-J$fPFEM_W4p;BSUY25d=QTmHHY-@CR=zA@$hcA
zoMuv_tU0E~zQ$_Z-Z4qh{_MfN67s<iNA<u6H{u9}Er06a0!<=L7^2;0J>f_y*c@<=
z`$hZG^x+72R`?BXq?`{i=ktdB@1L@3%YhgKfmf;w*zWx=wv5SsOmG{y05Oz`$~=x&
zF327#0cSDN^V2B>RAV>V1uk`k%_hMkc<x(Q5#rhg{+kjgtS6J4U5>h}n7$coTSu+}
z3hVJ8Dkz%;?pdbs))K3LV0wZaKLpnFwy=7wqb31S=pjlYuiS$g#w6|3R7WSYSWhB<
z(`73CEafvl3H_1}@t(Z+^|EQ+c{lbrTlPzZsL2+m@VR^EQE+VFG1k$*fI@m`kxRb4
zn=c~XN$8i92x(+q8IZS;n_YPmyU}<cpdMR8csgPe|BAEF|FbQio`@Nq*FTc9!);R~
zPiNVJA0R?)Jv%-zy#6$wPGCh3WOV=p951Wf+T=T$2^fkWpa&aY!j{_C=AzS49>7q9
z9c9}{dd%bfRorE)BMyL}qRYWYf*=>(sg_zwq(idDxK&w=Ct>1@Npzkkkza~W6ke(S
zLyw@`rp6}Ioo#h|)X>s6cQ=}vZ}8F9;iyBvJjBmaO6;K@vDeD$Y)(HY&zG_@%5fNk
zf#{V|j|s{BFSdSJ^~0D}wbXA^5ikbLym?0j9~2K_ntW_-BON2Tl9C5QX;f+h0O_W>
z$*omDa<<k(M?Iq8T@NLpPIae%q-ZT9x^bLGF}$O1t;?fRKvJ$2DRev(^O!MJ$qv@?
zr^^;^2ucJ*d%PXT;ahf0$DuA;9(hg&6GL)swA}SM&^mr^*@7ED?*!KcKV>C5Y{&jG
zEvZ{Ypc`vXXy^Uf)a;I#Tq#-$hm(y#e4*_^nXF^@Rtnb|sMJo65_QGJvWiEoW6D-i
z@xZpe#kGmVPu~pPsZmM7<F7{-?1+!F;V*25{@mv%;Ra&6pA!yx^uoK7repY)M&>WT
z5yy3FbG!aJPu)sf9@6OUF$GwF2#d1iJ9cs<G7nK^cl=`3qnwo5+Od->VR@h|3tsyL
zm15Jbb`0fGIw1eONw9Y9NeuaA=+7&}S7O$|WtGiNeq8zA9Z$KEg6Dv|z^A?E^g3>*
z_GKOqP0oCwkaVt0bwWCxZ~4-$J`faQcsUvB$bXcbOR@tY2t~KliXYtn#vaEvNFgTG
z%rdgNh@vR>+{~=@G#-p0>0nf=@qi<TX`NA&%i*cjny?B1tIZWZJCpgmq1FR+X0ypg
z-xv*jGx(2~_&w4J4jzOj#5VgK*G)#4Egs49D44)$+l-x6@U@L`$>hJIg-5j_6kcFi
zdyDwx+EN8-KOi8G3qXgB{-JArhR!5F*TZ8Q0TSVYDJ*o;a8k>No5gkTbh<7}<v|;h
z=}SN~6%g+VJ1s+D1EV}PUnXHDy*egOTe`1Eh7CK{<wTNFHj8WOv2Wcod!i_x8l#<&
z9*b+~sgKnjv!IwM(LSnXw87%qd1$hs0ZU*P#qy(<R5ZMCI#Q?YrZTK(x?GNAWXIwg
zdA6@PU%r%=iugBXB)l??M-bF4qgXD1K7Y9g&8Tc;9F7E7Fcti+>NZn;HTd_CAEsI`
zD|@Th0)eKEMMzJjZx83ek8ap3>=u}7STf1m<9TfT|Lc6})1L8e=pRAxyQQKZoRl~m
ztYWKB{jLxGqwGv_7zSY|dZmOPFuDK5>c`IDO7Xf<8oBiV{zLZgu{8!nhv6^#A6?n2
zmqz1Fr^j2QPgBFkKrgc+IaF5o$J&H?Fk|w=YWLJsv*XxTp&x5RoZYej>z;+e|2+vx
zrGQ(+*|9`~Q*hyekW}zqx+1XMFyzLY-CH~)s3Rs7^06%DCPF%c&Cn9%N)Aya^092&
zQ34SJ^m#8y5S?4fl9jrmT#tNEHiT;1G*+O;4_aY2E8=?Kf4=itK-2b~LME-kK~}`|
zFsiM)6INqya=%uhAuHl~9`rohTzJ@PwB*GrO(?>8JpKcDT#zwpC*rP^sL0w-J-W@$
z+z>*&o@aQL3Kv-s)I(zSrKBU4sOKeHg)yw?v4!(2YHOZAYsxyKQmN#d!xnBF2GO2R
zo^Q|oAMv^Q#2R-T-mbw-C#U)fuUFA#%WEwBSVP@~<LvzM?EiIT#^jvnvW_LMac8^A
z3Tapo=ktIY=-wsJavW#&RC+|j_&jJodq@Dn`?n+^`8ehOC_A_0hG7tjZV3w<%lqG0
z?{PYlL86_o0X}R52;IkT@I2Sz=`eM*SFKUCEfS^GfHJ@*@QNN7BTSxP_TU{xvfm3r
zeLVI-$BSIqL8YTZ8}_8u!+J2>(IUlwpa|Wm;YqAVwfn>`!r3IxV!-Nfdp)c5+-$3^
zAh|KBD86>54&JdaJPs_CH0Hlit6S_&9n83%Q|BD&1^@H&T>FXKse&2O!(Iv`(t#y+
zp-??KEK|>b9yIeX4OVI^d*(Nh|2{TJrpKNccDf(_#;$DJhz^C-7o8p;Jd?$hX-p}Q
zARV4**n&^TRa8-tp{gE8u1=wf1n7aCeJR0>NxTpo86661Bs>q^Edvyb@y<|OVmlPm
zNPr#?#ip);fB3$_o1J&A$of13^-y)+xZ|8&)Tj=9HEhAAyN)}SysnY6_>V2?@UYh+
zcds^s-H*Xp-{;H@fi<!Tmp`3Svmj3-g~`R}a7@D%NxRANN9h;T!0%%JliaCMLI6;|
zL1hTN>LPffyhirm(vjp|uSxcYvNJo97=(dnN?2+P&Ofo$^Lz=InpFZ6g)yi_AFn~-
z|Hl6QHFF3T9FsXaVScg4o9%7FiXK!sgo{jDG{aK?)ckX8{2u)KnrC)T+zEKB1=z>W
zR(|+DM`h~i_q@p`h@CPBM`*j^-YU9HWqJ?EAN>=9<f9#~hmw?2nc>sph!sJVgICwX
zn{GvHsm$;Rv~Uwhq}QGF@L*CAEGkEF5rP~b3I^CbmV*^tp_V8vLgt)+=%~SUct$Ge
z3YB<1PO<jHoT+C|;I*PE)MDD>f}Yf3bC165z>1_$iRbe&j2}AHff@Ez+vBCx@a&di
zjT4E=ZEWUWR?#YIG3<$15A<i3Cdpy@dQ^^BTPj#Yt#nNS4f~<#Q&RmYg>X^$80K@1
z-R6c^E0RB1HkzERcL;2gMBT&AyGxT!lmeVJ0$K)ICo*uaAS#MKSth^+wwV{%&APUP
zZ!4v6Yl+~35QkN(1M%)X(b_74KP^^00V<<z;1SRunjY4>a<Y21(87J?!gQ+PQoj!E
zA6?rYW#@KeK?nlTl-7&*$Um{=So?7iXI2vEvMdx7y89N|Rj>^fmQ~mM%SilukQ8OE
zx)~qa?}Di<5^gKwXaLV#+TTMyH$X3|bXHpw!?WQ*)bWUrfStLaz1fy<?hq%lGUt%A
zB*m7i-fT+>x@WowZR2x^{k$d9VPlnD44VRK9I!LFrEcQ`R!%l*>|t-QPe9IO0B^KK
zq#++$?JiY`p7KZR=N;LMwg&y>(a{m3Y(4BrCckV}TecHIFLbGVi5?D0rlnXnt1ZkN
zrp0#S^R>y{(qA^lYi3zkTA@&9V?OBwp2=W-z^AmObwh&ee~QHaW4|oif4d6yeXwS@
znqnYkGMFFkQPei*Ea1OdCDhoGq2N_N+ry9yJmg_DHb!9)JCkKLeV!#jI^f*nr8~p_
zxnu}(Rk!@ekOB&S*l7R62GkM!ImUH+N;am(i@nE`{@*3~W2mS<pA7{TJg#}(^b>j}
zk!jsnDDaZ;#q1jHtPJ_?m$GY1Vi*L0S4sqw-2Y<Twf!hcGT{Q$v4)54L!<B3k3{5+
z`UdCTq)EvwTBGq6C0Ho`N?6sE5W%HH?o*3{WXFdy-7lN9;mOJ?^(O*-i0($opSB1*
z<F8^r>`JuWYIC@utD)O?7y5Qj7NCz#oB}#}>&Pto<(E|GgSr5H_~1V9-J?&l%#B(q
z1VUYKK75TFUz4okvVFdm5`|FzaXzmi-S2RK^<cIbWbhJ-l&ES*g)pc=qh}J#+`k&3
zgluf}y~66#AkxEpYE(yI%SN@D{wDUro{Ye7L7qOEWBxsO*RbckN+k;_Js1sm)!MvI
z{oXf$9~K?ESNsx%FAP(AHqulmgBm1y#1Fa=G*ouYRH@U@_a`|@^zga`rO{E^2-e@%
zU7;gtwB90+na2cCuPfm#NXf!kNA$tNABZ!J<^fxh<c<o}QKLl9sf`w{=mW+2UL7k`
zM_mPahS058`KaLgnkyA%k>{b#E;?2|QH%siDkV2zjW8ZNY1HDhv*@~T&OVe~*^$LC
z2x}=Z7?b`RTPgd+k)5Rh#*@eWB=Ku}QUxN6M|lj609fj$c*T6Rw!eci!gvra8^g`3
z4*q_ZVti6z5{idul|Sae9FMN2^sN&*rN)z6ynBxEnsi?3;MUP>!l%?I)kF3&6$JSw
zh&6CbnUEeeD)k`H_u<t`%<#PHRlmt33kIPcl<`}5TaK7U`Iq5uFNsP$X!*`oHaT#X
zyDlwdLV8rUcniT`oO+vX=8cz3IFIUS(c{E0+eX=GpFK%b9#*Yl2+CUw{oSQiaYZJq
zMD<8-Mqxh)4q?PM<F$<X)uhgYVUIeH)H7Ju)r=n#&ZB019wXdnAso-?&Jnf7|9JXJ
zw<i$QBn*=V->iBjluAwVJk*Gy1U<^pZFTJ+qXst0^Y9WDUcE>v$G30ZJxPNR#DlhV
z`$e%1xTjTySZn*cs67ezDz6UT-Vc&(vx1$lDmCGFE-KuZ61hPRT6M!oj!n8eiyKFB
zsNWkaU2sm4?2~Y>js$Du5)%E|`FJw^L)jS}IShkPuqCjJCHLRhvA!=r@t6h}jY1-L
z;jyn*Zj#{Yhv4T&KK6{<R4E;IrAZx3Ck+wSMp>aVItELVG?*@Pnzz^fz$v^R{Sy4;
zRz?yB$inO4`K?W|bnKg!h+ETJ5k0(WTWqtdN#5~TTG-KZpsCZKdYT{ggFHKN;{w<P
z5me^=0BuTO>jVycrT_FTcHC1a?^3%(rZq`h?YvEcu8t-+&Rs{+F;`mH&m-zV6>JOt
z#jRcbbu?+y^k}kk${_u)=AhJ?9do6nNuE>SBQQSYg_Ufo`xcni;wTS(Ja7x3u`aFW
zUY&EtujB)$^Nt%eaBTFtmUYwO7!Q*fURX`QhR0bG{O%k(?&$FgT4;3-s;LhDkB+_4
zG_gdyOz=06uH>3u0>9kHOd=zu99Y`a51VJcW8O4P7A`g-0R{Kx7?pH<3I1~Q^jt!l
zS^p}^ee1{QKl3}Hw*aXzpLziwEa~0xhFYBA@sfU^(=)tM6R?G(wLi+vEy;lpgrZv#
z5!>GX#)jj3Atn{RQ?V%22K7E7hzALiwpf>HD~DVuHa%YVD7P|x-0}AN`Dx%US&k@l
z|2yu}L$)kw-s=@EtM#Y>3!8s>p11AW`eo!VVaE#};5FME)%)6Zc?+p<O|74pI+&Ue
z!)Q#>$dy9Y507=!=zT*jEL$%0TdmMFtslGb-7P(DTli+=cS@`9eC!1BAex{sX4HRs
ze;WJaWNN(c5rL>V6d1Z6d2&`NwJaKLnIUe~(7~9S1(3$B6r6zLX%iV@j`D(<gk9o(
zOGz2W6Am~p)HVQ1X2`f!xTY3ex0+!6<Z+L_i3K?=B{HZ*<E<t>n|-fuR7lb~tZ+f?
z@ZA!hP+X?`>oMEy!gQ7jnyy3P6azk37f9({vQnu!0pHWQp%Dc2vGYKD3A|DsBEV-X
zh-@;w)kFz5cRm%mrbUR4KL0dUWVU5p3PgpjX%XSW>pK7f*b9DYxWrvLlSJ#Swqy}8
zE-~InWP2j5kU=e4Z*dNJ+B^OzyS5{UK@ixIf}r-_*s<IfhGe7xhKc7Pun(BPF;+eE
zCiq9{5_Rw4oMXR0Yj*6hoZin;%QFrWS%>Tjq&{F3_{_ahg@OrJ8w<jos6?1$?wiOT
zX-7Qz8goFiPy0-lj1{V>M2rudhOKbIx!jMFZ(_e6X9W2Wyo7pFi0vo%y9$q0BEknW
z<cR@?lSYzpa*4+((SnQBH&VVaNk@bgs;NW^E}oz|Th(_1+<g=IBkhA%$^Ob!NU8Va
z>Qq>)a=3EwpBo0<OwC{wv()g&Q8t@>WH9a(_}%1DTOrAc9EH=K$&hMYU@H<OsZ%NS
zSU4H`OAMGGew7UIDjZyq9oZafK@kl0j6;*qmD;8OT0j%Hp*A3+-1#Q(`v=j`W1?rZ
ze^|Tn^XV|h6=ts}MSM5jnhhVxpN0J<_WRWd0zNdbwIrwa^3G1NQZNJ3hpdyr-pJ?n
zlz<^hwzm?XKA1nNb8q2}&Ua~l9Hbt6duBA=kVG60Q|cdO=aL&R2m{e8g#=@`|HbOZ
zss^j-D0>z}FvgzG`zd;7%kDi5Oqc`jHSd0*up&veY~9mZ!=AJc{1%JNp3;UKi9heo
z{>JMmF7@{&Rw;64^J7G^0?;O{%@LJb(R!5h&UTphEU5Kyx58N{N8K(x*be_5Cawsw
z@l}Q>Qq;4GqS`!{vmb%lh#(>66dJ{H@jtfasAnGpc{Z2hWBuHddMR?)Jcr5R(PYHZ
z_-1Kee^rr#n`bST<JBI;GKE|5N>)VM=AJ`ek%AK#kD9PwzF?oCt2UpR`8eW`GMXCQ
z=6@Fc<5&L1OQL|0CpHYadeQKhQnxU(e%8VjI|`M6O?=p{v#+SZEwO%#2xI>sTp&3s
zmR3MBk$zye(7#_hQ@haCNOEn<&OLGH;|t`B%P`(+1&LLWYg@MNiT5kogZ*w`!d5J<
zz)!aBp%)S0ur)_pGjv~93IZJ&U4sb0cu+aEF;9W`Qh==;8C@MGf1JDG+G_1S^a=ze
z?$7fY)5`!(I+3lotCFJnhq7x+Vju)zS6T!??tih8?MDZt?Q#KT$5kVbB!6S4r!2<s
z@G?XPR*v^(hfX~`GoIrHCF8fVK>_&QDvBlL9*%74Rz<`yS*IBqx0u><^X0nmND074
zM{p2RvD}^edmH?@-R%aPCIN8kS@0k0vgMhsB0Az|8dM3+;2m`EoM+DXG@20m1%viH
z_ANsA++Df!O@0e(MERyjV>_hq>6VM)@T?{@1Yz;!=Qi)$<5|VWmckYst@=3%2P$rn
z!e^H883tiQ*1K?J#gsvZ7p_^x$6^o4g4G5Y6|PI%A#ZE8<yz3tw0J8AXc9=CPhx-F
z<eGiCR^+gOm>7hN>%3q(w8-IlZO}<*?K0-)Vr@<_GwzVXHP8NBLTFVjGzl3tw*Dme
zk58Z5s3jWIqUgFwH6ziXo@>_gK?*eB!hsnKSw)`W-uk7sX#g9;lz>4>@S={|^0L({
z!zZW|x3aLS7V9D%-n?#eK-Y*15lZMhKd|$O+`vzzY&4775~E`fxG!;-#*^T&CNIj)
zHrHYh1fpBAh}iCbV~=C<ejxUyY=AUM`I4D=vmX1-u@o(7YA?!`be~$myW7U-qsneL
z`cwp$Jk8e<D&00lAKtCp*ZUHMfO;z*d#`+Z+y$~{QVx0d_CNrYZEMB$1~zFAdrThF
zJucqgZ2vfxI2F3kQh_W8s>JJHd{jO>{+~k#<{dId=$8-PQb|PnLeN~T1Y!4vT1CDX
ze-AC&LeS{8h%Xxqeuq=34B|{SX%cUi86OTsF(dWNT0xIn*a-3}6lDnTRNm@0(`34m
zh9pWu!|B6c1cnWAhx?21_XC$W6nZ?M*t1~ip6=w}E0r`9>3y0P76R$=q5<ABzgB?h
zCS%XdH&jXu1c>I14=n-HZIkh$RpB|=%YRgfa-FCZ?6?JrACL-{->Rn~cm8>@U5Vuq
zlPB8Wey8q&ex12z)(QyQqKX$dg~p3|V=8ob$kz&(*?P>MHV{Bz^KGz7dpMN}m7m4^
zAUZ6xPbMm^Q!-_=R-n=r7lazbflIYn=IXcR7vuj?>yNT?OJW!Vq3D)sBsb~)H&%{c
zMQA5%fN>l_(EBK&$NLk34m-6#2#~S!(mTccTkGdZpg+spbPIqp_yk1e6vQFxkfpVu
zfnLk8&u0g;WQXOKYwJ*&wF83uxOxAE=`mAyaq>D9aBgIiA%M9Pn6(N)FYEAwH8-nv
z@7C65$9?&!8JVAH9Tu-FW~5!qkbEHLfF)|W)H+07MNAOI1WqiL7HEm(uR`mPd9~^O
zyliQ|(fk+&fyLT8&mW4oAiwB6s!tI<|D45KXdODQY(vxXz>L1DPi}?XxwYuLim0Fi
z9WjpF8*{AcFm|e7gamnSb*~RMI3mNIME<kvDEc#W^X`e!&*5b}Wq*e$tOyChS3#)f
z+@w*p->sq;F+oToqr!@mi>{(`>(G!DAwdSdc$vz<57Cpzzi-Q6=>-UIg2nJw!n~-T
zDR!sWMoTY-9#YdU2}ln)bf?q?K+ris6_b@TImJNLVmK=xf)1QP4`^n5qh!jrbqLN1
zfS~!I?2K|G2tg=#CGAGg`(JD+_hW-No8bb+m~KJf)oXY{i}(|n+xoku|JiozY=Wg&
z4~#E5*Xc+q+G&lZUc+E8Fo!`{N()yaLmUK}9^l11;ZY`W?Q$TMxG*ATopFO@lb6Fy
z%W_@&^IvnYejZFFx_=_u#XhfH2?_`4#~(Tq9HVSO*d@CvDW~;7{rK|QaG`B*=H5$U
zU(rsh9#aPsZ*u5rp1!U;(jX;6S`9-%12ahls)&Lu7nh|Xp4KoE1cG6r@0^_!?y~L5
z-5uyZ)E_#0B`jXs<raKPmv?~wAX8YjCiZnUJk+OPS&>ew#_majk4I67{?e15A{FJd
z2L6xlcXfo*_{xn;?2wAGSp)xvgBY*!X6F~mQMjUP)`0&JHf!`C!FkFz3xEDA<1mm?
z(cDlZK|_?kzly3^qm`H9c(S&{f`-!NL@HfPjr5-_mtj!U_YSNveSj6ov_}4qCznQ*
zN&x}cdM-P!+_DD(2qcB)#}k((yHri3RDrO=ydD0H{Mw+m{+Go5P<BR15`!QRy^>B4
z&HXR7Jm+JE;BIYSz)GbQM7kfJ)s+~Vq(IKgO#G6I7CYelva}KflNJb9J(JBSqR_k5
zuU4X9k^+s<;7Ufih@9+)@=~%k`(un(d#fTlbhU$|#uRh2=P_Q^-|D%G*TDm#(G&-=
zugA$;QC&tli#uB@)>2da$G#rJ59q-3ZP)OE&N9U!>>2+P8-qDMn{hqL22pIbp4mU>
z{2*xieSv$e=|=IxdSd@XBI{_MH@Ua1R?p0ku7XJcgns?9&6AB2bLfyLj#y6uAmS=R
zsv2mkgPO}EOROgi&};GFL&q3(UR_y<Pe}k2r59>&qs&>S7K37l^@RP2aK}_Ft_)CK
zYd%oyu%1SD*~=m}MZG#9t&GE0OYtdFe_E8+JvO0}5oW0s6uYWt;ZNU%3B!MRiK$yp
ziA}fXm4Rr`pPye{p+8st{lH|&&juKP;RjfGh#^wxo)kaK4(~8h=Zs@sHCCp0U_I%5
zB1q3oc8w&4vZd_3f4NkDC_9rJhG7tjUdea}@%=AWKiUm8je^uQvXE0S{NWc`9o$FQ
z;!s+|^znjI*Gy<fEa|wHtu_{FR|{r<SElz<Z`!5Ex=e`JsPdoPLWZHL&a{h(4mvsI
ztG*W`J2TMLP2~sMin)5rAq*IUbob1;Hw`ZNDl~#<3DDGG?1y~20gtS<4;!<JaOzPW
zGrU?Yn`e8$mvi-KgVDdd3H@;BdvoHRz)!)QL_7Wrsa74n2h;P0f(gKKIWwK81?u2E
z)&uKYAAAR6`X=!IY>4|DjibMsr)EL}K{oEpp`Dn>ssQjBZd+~DccCAS?e#=TL;nQ$
zc(|>-GSD~`Zv|Ze%dH<5MWP!rGdXePv76QL`X3ocG6&DF3?)^?uRvx2yrSSVwFJ$G
zmQ+$al|-<~fLzl$rtN3&OtslCJrh&kff_kZxh=>_rrvCjp4rfSR6rnh#mAfA|I<>-
zF13QgUA2e%89GyN>gG&>7x~q?n)}*$#WnLn(CXbS&5s-f*$-vcc5E>S0(-d?7*sI*
zH+FYD9}Y?~p#jG60iyfpQ?luZohdltDVRbxPJ#rfFK`~76e-o5)(_EvLX~9Px!0q@
zikzu8PUwfwCemg3r@V;ruYq5N?2UqykVEXTa<A9m6**IDyi=D7MfVBgy;{_XWoVry
zo2@0L7&A=GjPoNQ!|F7z@bhytLN2Kk1CI7|CbMq(KBClLq%<v>$QHbdWVnmA8FdlA
zLxUrwo?PGp)-nV@tFoC+mPwK7^OhOB5N9ZWw&8b3J|7r)$1U@gla|&p96;M7e$b(6
zrw%n`WwF!kOYr9;<uN@~u>~u-rbf}>pjKwMdR8|%JZi^|OHqtV{}lOU*xqo~C?<Ce
zvKL37QxFG#OeY@DLv%NtPso|1(#O$YXGn&&;d!uH=tG85!4tJ77<ndLd4-=s6C%n}
zD$XYk(E0h9Ap+V4=Rw{UqCFMsNv_2B68w2VJ)8#@hv^<VaM`45+L6UGEJO1yUi7h5
z%n6R@ob~o4_VZ@(CSGh8>U{d5#E%4<<^KDp?AnqT20`GJstsc9f3fb;FNAcu7hoI`
zQE(r^!gF64jSf}d_Gq^KEu}jPJAXwjHlO@Sl_&*E;V=3D<w2iL6)61OIDwj(i9%uY
zL*0kNoDtv>8h+HnO(6n$M)FMRF_Ib)epuH(k)P9j0C{G(X%ZyuYc@bQg$3wY-3NU-
zZr+<VRdZSWkV^f|-dz{1If&$0BdmFAvXwe`ICpXGkA`G$O3HamUAR&Q?NG&|m(=%}
zg-vm@a-|Mt_b#kFX55tL5BZ?7F%>?VpXxqFophX;cH^$xJWwi(G0*BgNHYN@<{SN#
z*ExhKtSdj<yI#Bkp|7Nyjg`R4jz65caI>d>(#C;2?h4*(V?Xc9B<;f|LP`%BA8pGV
z-4wo+CuJW}6T(kw@Go3Vrloc`iTki0iGLeC>z*~TQb`hw=e?*);^DIODvaDV@Q)>5
z*(Nt=khpiV*>2LI6sbejhoFC>UOa#9CbUwc5`<?2=Zru%Z1OUBHGyCCq3qg{7zRP$
zmDB{6-v46VwLe8^C*%N3CP4(<2Lp$bSE*ZfaZY7}b$;kdZHnNX1rBIaCnap7POS#3
zaFh_hJM0#OW^%QGua?kdtVB^lwC|EYuVmYA!Gl`z-j%8s;5*#Ybvnu&mLn@hk|33f
zCqw{GpUX5;vKS5HtkzbcKLOY74lCbk{Y{a5j+WRe{3JvrpLNC~Q5^aF^fPj$@&y$i
zv63_%a1375t>bf7$VouN3UJv#K2rRne2zZeD%>PQ6(1q21qBqlNAqxh68lefdo+0)
zOO}O`{k$(bI^sO|?;MO1rBnu0wAGIEZ1GfhPw=*}`<7XQmZq-XlUFa@68VOCWu~!b
zkcCno35vohyeIhXJlpO|u521cK9}=b@JgZG^n3&du_?46`(sD4@+*~g)AP|8!4f-Y
zlWB_NvsB9Arsu=mojY4+vW(>;jwiwY{L#5t32;l3UX|oy@p>5jXR1d*AFd)Te^%Su
zB+PasV})o1_ig%<W3FEq=*gjvm5dnS-)r<u*_Gu=5Q4xPz2Ji2{V(>aI++jD?#Ka#
zbO?etwfs?8rW+3tMO6-$*bIlu7C$f2w#cr+q+`wRZ85{)vgqgazz|8P9*+g)-WD?q
zE{n206~9I?4jMztfz6>Q{+2~mA1pbYu#HL+^-V=dGwdykupXsb3o(5pYf~`(Cicf?
z#}^+gme_R$k@RYN4Q4ud)bl~*DYd)`-;&FetJv@L9lg9B%~)>Xg<R($d%iP$d@cvG
zb4)Zk9f=(#P=;V-0o_Bu8|rRSpS$b{Npx@z&>j-mdUbCVM@J8fcFjCEdc^h^)d!US
z%%hRpA@<CC_M+uX|2w*e6CkrcA8UpK<+5lw)60;cL&ta<H<3Rw68V(qP&BZajUK&Q
zZ_O~EJlJ<htEHifpg5@hyUUs!W4|66mlaBYnJ|cmtL<Pqp&5pi2W*cJOsfs&=DA$R
zUF?s1F9s!8;Yrw}zw10G@@s~_<+7-Qpld(mRor|U#==$b_na?2Uf3_SBRA3sBbtZA
zBqoEGRXJ9v`63wSMxN|1)IVisc0?fzLeZAYD(Szm$H|XFz&FwWW@1>PcX@)3OmGYI
z;h)iV$dSiM?+H9Jfep$B;|4qg3W*<WNQN9M7UeTHc4%pv)O`uiG9yE<5{vQ~D53YQ
zC4&}IP^|9MIkA?s2s)#0tyLEKx?gyvITTB)giE9?Vren#{)lACw}tp1YfY<_dI5#-
z)hffU5{vNBYg$FQcs9L$uAo?D2v&07d+tu+G+jERpD&T$-=lT$LNuEetkcg5B4-M$
z1^4ivE<4M){kijzAwY=*_bj+Ly2Y(%Tl0DkVd(dSJdC_pGUy&n^iupw%oIOs<3;bS
zdi(^M(iI($o?7;_(n||a81{%*o-99fXP8w|9WWgikq%+l8M2KGu}Z8`kKTm&qBNOL
z7^v!(*nf`pVHLzs+zNmFZpTX;8Pb*<C?AH0iL{VrBLlsEmznB!pnQOWXvqB?xzykb
zVNVUmR;Q=826|)b3eUg?Vq|z*VvW4Cu?u3WnxJh4TE$`Pz3?Ap=awWf2tv^<83kqb
zzp>%?C(@~~0V-{Z&PDDcF97vG3coJF{|0kg+pbPB@4Ze%7G@#Gi(Qn1SEN4<>{s$a
zwFJL|b<b#XJ;-xxn;6}PUJ;&IaPHyq0eU*GwvCU)fA`P`2?%o&Wqg|V{=eF@qHD90
z=Y#aZ{45;8a*>~$cnN?9o=@MNW#0IhMJAE4T2ake;Q4g)(-R*IdP%<(|9#?ez}Ouq
zPJ#_w_@qB8vN@9z$YT004LS}x!M`u1Urt<3myPM;Hd{6Pkdw!*e0~nY9+Yuy3vY3d
zT3-skJao8>U2s`;DtxoFF)QCT2?mtvu<aq_=)u|k{yWst;2>edgt*ZsxmAN7aDA35
zqCY!{K9Igeo*iB6X!&NVYf1KJdSzga)z&sc)@&(QQT~|*lUTH&h7%=A>6^u`74e^G
zFbOeoD!b#+p^W#J!L3%5bQTyt80axX$UwxB7>a8tPSVamFZTcQL6`x%XC@<CMXG0k
z^V1!WcZ`K8+>`s1SFzqdW#@LoFbqP`mEt%7y#He5_zy#*vH*%&o0sn+1&>C1Uf&QE
zrgzpie|9I8N5Id7L9D#F%(WjLQtVE)jes8n(infP!A7F!Z9B{~i<lpuA7l+PuN~ao
zoVPmkF^dvD)0+ufsCfAytah^<2AM?-pSf437)zk<rvJtMuAGO258Km$8>1hSVs`70
z$V}#;ih;5qVu1e9`IK~0ibR^%<<-t_jn7z1Q{WB{%jEDrz{^m!q`l5!Guxp`+2Q6j
z9xl#+_EDM1y&a~M$)R)SN!!CuPT^I&c<bFdB2nm0lot)OaO55NvpbpO@bf|(WIjys
zsGQ``okSAdyu5_~m*}@#?u<I?@Qq9pxl72{z;LGh6Z!jx);n4NKU)xj%ngS&UB(XQ
z$fAYUjr9XnOaQSKeQbwxWC!er0z*L<fGUgDUR#aN;opT$>4p&cjQmzVN+&}_=#K|n
zwDu?}lv`@G*1s7RK*$~7UW}B756Hz6V}~+j5&HvJ_($2bB}oi|z$+yx*xvtQLtFDP
zAe#*rpe#cHl74JcWUgQBk$g^U70MI>_J^RQL2LWguC0M{Mz7RC@8flCl{<oeER4<I
z$=FjNO#xo7nL9CRW_E&Qvo2pDO#xo7d2W3jI?A0ky;3qaLqPrzu+IOClv3g2>Ihyb
zg#q|u#Y6}5WJ}(qN3X!p5THNQ8dLhmD!~AW2%wZ`Q$WP7(`E+CiXx59j@Xq_j_6Bk
z2{^5Bu3IRnzTO0XICv0n?i2}{_au%+&)Ah>julPrscoWENF16Va#30VuehkS93hvC
z^w;!SD!sx(e=eI*IM{0+n3-L#l=xl<o?gT;(DQ&>)uwoN^uNETll4)mIWGR0u^x?+
zsU{UN8JwY))!4yI?3Cp|R<tUu!pZvV4rc>PYqwQ_@h<ekjr=yyK|XA|_F_V^KlT;A
z7o4!q;06`jyQY6pAODAbNR!|0DVBq4-v(t>PMVrjsAO>1A0Y;S+htlu4@qvMvR7UX
z|I?WrcG(Jh$J!g{L)o<*F${ySm4Y9*?7vtg|FjsIh6Oku2`^hh(IthlX_pt;<A?^g
zbPSX8k>Q&|f7i@`$ru@(<zcoj-K&r7UOBXT(!|iZkfgTI`iO={#juM;Lc+CEeT=lM
z<o}oz(=HmRVu-1Dp`4ALT(p%`<jg^T&^!n#+<x%3SG25^L%Uey$~z&V=t_3!%?j(y
z+(I9+TRBRhWm_;Dvvq~@W^SR+=!Ekl6xpm<OY%n{qncakGxkyv@;rq^#w5loP-l}<
z@sg_7h<piJKw4qanRsLYyudB>sEI8>^J|4mXX23sXrIV=ld*KHCx&mF;R#-RLmrcw
zi1A)mD?~bTC?DSc3&lzszU=kT^v$8wuN&jd5BK0t?i+e$`)7oEkk5<zJ&cfoP05mA
zyOK-;%!ke<gPYv6<lL2fdcb@r`-2IG3g6n|46hYBogFZr-F-B4WLwcXSgvHfV~vk)
zjt6H|syrm#t~A-!j!qS61pgsphA8;NC;!swo3d*=Vi*QtD}_g}z5ilG{^%7$b729F
zqp`p)l0tBadW%FDaxj)%h38)x`yq2Zp6Iv7y!aGioI`gYJ6dxw6lS(R6i$!6iTsds
zRA?s0Sr{eQUfoZjJIx^O`FIKTg9GEX@I#FM#_o{yR@n5B{Z}iL%<T4qnU7?Ls<*<P
z55rFxdx$m$cJIcU(Ep1q(GeP21T=V|Ps+Qr|07^r^bs$L`mJ5z7e%v3yweq;nh*RM
z7wqfdxs*Q=YBhzZ<%5f(k7W?1n|$SpbZ|Sa_y{~Y=Ix~hA61KLcX0cZ@!7%{7uFO_
zt6#E%+i}0gd)dNOb;2&HaO<!RNpGDxJ`Sq1MKQc#-bLOWY?XPCFeaYTAUDQRq}{<k
z31^bQ`x9K2XlnlaIv5oUxuAPBw-E?7c=P+5wYYgpqXjfvAbo&`p)zUaLt2MDxAb^#
z-5y`?L4w|0rjA&L;kNW>l8zugND(~v?)<Ms8T+9sdZ><pN$BXUr10v<W$ECQ9$p5*
zHuOW;xm`;LgHW_3qlAQdZvQ=8cD@FKE@^-@69EmJ$HB4>gKYa0{N<;|fvcZ6rhx+w
zkIR#B%ft#h&m>6SF~L1gVCt6i?h1d-WJaH*zAV)+<7!tDy3(m6h&5wVVapK?vh{v-
zs<6<khr&c9((gPJ4yN9F3Re15u;PNKfH9^rZte0d^z%#j2I;Y-Tip(JM1E5}_T#Q}
z!HDQ-Oa2BI8Xf&?Um`!Jc2w}8lOTqQY`>2EK~_3!gz}syuTNcE22JD<wd5gY{ifB-
zMoy+*qvqT}30mRLSv2D^G%l6V91xH%fnUx#6y((w98>y_2<Lm?=hFyE&E7-MmmX;J
zUC9f$Ld>&>;(@dT1AhYRvgEs=!kx2-;t_VKf_)fHMM)beapx?ecmQ~GyqLY*TLQ__
z3U$sRjE5aIaQ$(~U>lU=U!`s9Z8zyDZ4?a*(UE{2w8Cz)2<H)F4-P9zu@BroA1VYl
z(}=HIYDvfuczMp`232CXS&;H!ZY0c}{U2Duvs^y3fB%%7Q4Yi)2t=>csztf~#g^Co
z64_+u0*$eVEzBGKUiaGX1(yBxvQD2Tljt^2Y98ucSP%gyud4K=;BCI^dA@U)8<mZ?
zhQ}=4r2=^POafTC%kh_Ocpoh*VqCc!b~_(<U*nR;h_M&W;ieFDp8R||T97L~?q5Kv
zs8S6n*UmJC9Z>P*(fW8@#E+*d**1;jA{6f@;&Aa(WyQWI>2@E<)!qRFH|}xc^!zmi
zr1O0qSEE7e=-~`cl48RZkiqAUj*#yl86t_>(P}Y;r1P24k%$p?`l_mp5=ZANk(LzF
zDZt*#`*E=;5S_17g2jIab=kch|L4KKH#+(FFvFCQaFN2}rY<@n3Zdso%`@=De;6!_
z-1CfUC4H}aB0CcO#t(6yqgc0;!gnoCznP?H5!sC~zGsqE5Ix_8JRR(08cG{FmBne7
z5_ppG-~mrBjfQ@kRe&oAJS%w`({$pv;|KAaf*4aUI?q}jlmc<wFTO?(P}F`?ZXe3d
zB}sx11fo~+S6JNtV#9M*BGn<gUS%7WqDYb%Kzkw&WeYTdYR7jo7<VSXIwDUY&EcV*
zVNV#%=h!n*R(;pVzhfhNtG;q#XF{PmvYl`<R34D=LX%)(QsK}!bQ!#@bconCHB+MX
zk_n0G=yp%Rofzp``_WI$oe=#y0_;{@a2#=_8mPXlmi*%o%CvXsuIOWfUwpMO2#&=z
z>xrI;jk~4~-YH|E_&BHigX$gnkMHVeu@#-LzN)fNde5W(z6Yz>Oz*VVZh38g&}M7+
zv;^Rq0e7rB3k5PeN|>!hS@V4h7T~Uwi8g4Vio5gz59peKc02X84@srU);fiwGsejM
zD=qN8J$gQ5L&#b@66kow@bwek^>+<R_-9`h=sn;%%6)$q;QL0k;K&_xF#Fnr+jGK>
z4fLI8fOrP78QN>$U?cbKV?b|3O`#Gibfeo!4_>qGyT^duUTWXcaBZ^9S+vOw@b`Sw
zoqA^x#Zr_;p`!%_bs3puvQvKS;$zF4Tw?V%oY)_S#UEwodILcS0^yc?<M!X!@%iV1
zvKuMj2=R=wz%b*7Hlof=t8qbErFSiA&w_mPP}-J#r@zKT0Ac6h{f{G(wlNFJ1%9W#
zf>74aq$Lu#+huM{>JwJS;+P}4p+C-Jt2mdSSJE@r*D5=Q9RY{DNmSCY&b4XQbC#RP
zA2-`>TrRo!jNf}l=Iyx({(dHw_(Ri1KPS-S=udavs0gN&ZRL_VZb9X2P1y2H?Dtc#
z+@B6Xg3j|)&}j}EN+Nh^sXx8JC1A3i;ES9^R>16y;B~i{rsJO2GITTrhD6Y~Y-X2<
zem=&Lr8=s;ZtRc5H}a3@HAEAXzW&Lo91_7w%l<)V7`_3^ziZrk6Z_+;Sh4{QGg`z|
z!PCO|w2}x`ZgyUcO@rB3<c8)fH?cnwf2`OPa}MllwAw!-M_{;GH)zB_J0r10Wt}&n
z->*qEV40EP8I=Y0o}Jf9B4BA$e)Ky^27Ye|E$uVu2%H&-pPH7D{G|Ik$8c_T1knEM
zpC4uCk_0gb0?{i)@k8!^vEex@!KA{>o=Qb+0yf?MQ*$wjy4b=@ct$MABpt{8DRvg;
zEZE-}9v<FxDl>Tc4^o7S%35Lf#^9OE;M9E(=q|HOSu}$~Z%;GmEv^}a(;#z34An?@
zZq4AUckwb<WsXkZ0rltsGc<#NPTdE;a5(lB*-HHRE%-B*cpI--n`Pr7lnhto+n=L9
zZkFb5P;4<3$8-AQa$3*~#x^G*Yqf}#m;?R9cn7W-9Ngr6pmD(^<R8XUhGu|j)AqsQ
zdo`BO`03?K;FlLYoCd4??1AmjU|fG##taNPZ6C-p`19Vit~-wQCHTt@+;2|q#!Q~2
zcj}SD=b&a#)_Hg_R|5+O+0l7@i~ao0cV!<MGi8k-FmipUwKW6bPT0pnTIrx@Ar!;w
zn2R+7vyKH+v4LMD$;3|b@Z_m4a4+nGGdccxRb&n4hwyg>#k=p(4tnBTcJ%-Je~6v|
z^6p2XFWVDX;6abl7(0XG&dZBbuPRc1l$~3W!!QU0uY{cl#QiU}wDu#5M7GQYR4LgR
zFpnNkYF9Ni<}D!~TZNV}QM&Kbumdi_zPFToY$aN_L5y3D<%v+dG~SW&;row=EvMMA
zYEc>YR=S*rgD45HvVn5}4o*jX$vcrkw`R&scl|{ZXw}AwhuTV-HP6wm1%(NWaQyZS
z4ju4LI7$Xz%i(@Zy<ONwKMw8$jD-1FO+M%mEI$<F5A}|sr^%p5Qh>6K2z4w*KRNiH
zyVf0Zic18@BTU_kC)v^S%=r;MeXyNURu8?H$oGz(>&6rzERVO?xS(Pl-4m0J;AWpM
zfnS9+V|)q`@tz$0{hw*MbrM+xxMYj$lLEzY<t801w+s}CL?~j#ivk>Mn=@@O>8N=|
z{?M3V2qr!ZN&Zi@HED_YHXI~SnIVf{W<LA`Lz#5c*7oj+zkM<9ClFODZl<NTf5AVG
zPWt+n%$OfxxgBGoJ5nJ`ROfMeN4jkbn4wycAQ}!MHw>5Jk~`vRTfh`XU?TEd3JFC&
z@A402SC(xt2*S1`4h8nVu}6IOLvc8=fwYI#CYBhk@Rus9$F~Jzr6JqcqF1#jp*{Yw
z_HNWy>Y3x31->cd^{?;|h8WX+UVtw5>HG#rsD+uIxKct3X?=_lzL7GobCXTnr(Bo+
zL@@^);e^2vlwN=?HE^;u^^tOdtWJB8H+^DG5q=pAK<NeOa--}uaLJX?mSb+qAylRa
zQHfWm)S7*Z6%#tkCI*=)!Y0n`10O3It7;dK++Lv1OWE0daI&Ef#4&+qMX68V$CB$r
zgB3d{d-FbmJxn)6iIAX9B-l(bnOM)Im;43zQj#(Uw^z(NF!kGel#5*2gP%)My#uOX
zQf#i6kU^ViAxsf^)eHYoi2u}W84;5yu&E)TVUxnb6d}MdsOJUf^0eI2gRI5r9|Vx#
zp9np{pUW^y(9b?;Ff`aUP|zY<(E~h9-o9h6G2F&TU=jW{C62H(P4PVV=UfFRYGBBs
zpONH`vTMnqAOvAolKMgJf3Zj1p*}OLW=9B-6b5L6@saU7%5woE@}{;B$#=h4ez?6a
zr}s`uEB|_HdoIGMXvXhI%}lK3=>`9gnas0Yk(n|6O1_zjK`cJWYM_mmP$c!#PqyW+
z?X4YbB+oGp!$5-lGrpDy!QB5H4vMeyXU(|ib*NY>ED;EyS}8|3NqsH#lkLA@k+S!i
zj#FMqQ&CaRS+XKgABa3kPL!0JQB`Ceoh->z55{@4rI3u50r&`ZFs-Ej?-$lLMW)b@
zsK3>Dp)TZhfLxkBNGc{hZnd!w@j~2Ry1$QeOI(3WP&ORwG&#IWv(h-WKb|yd#`*&X
zQBy&PnYSi9Tpl*hJ-wtgTE<O#xS7FIi3>O^soL<Kmm){NnPeF>#Vg5r%1Laa8`75<
z8N;pILYYC%xNAe@Js#C8IgEB`%#p&*xNPH3-y5;DTT+^gi{n4a&h3hU5CozvMZm}Q
z-&h!b5|KkP4Y<1`cmZJ?lvPeQdqGtZ=UGVgMlwz}g&}jeSId7*NOpN}Jlf~J-E!%|
zER~l{$_9aNZdgnb`;OCB(r`V6i6123&D#F<j)@da!a<?9e>B*j#O%yB2x3SZNroy6
z_O)_73d1UKQel@j1#_jEMQF-!_`9j*pM{F|{KlCrPd-sJ9ypXv%09|qSP!*F&;B88
z13wtoDd1F!!Fs67J;*o2L+YIs-2VV&FsX;yBOZkbUL0iLx}1NOE^NI{(G@gtK%Cp%
z&hEEn@T&#al)`W5l-UA!9{gg61d|x|=BNyRL#IrG^wz$^RFIBeOEc88Si|&mVtM3b
z-FdXKxKA0}S><sQeu6sAPQh`9$Kx5`(Bw54`UG_xd3G4t-OxQdfSbzf>sHh-mC6e(
zHmQk!`Wh2Mg)Je(uYvYAWmk{{F$luGR0Yxg|6`kYTERMU*el~wOQ1mFth*EvIXW_3
z_~Es>xxg8KP)|NCf?SHL{(ZFF!%NkLPUngOS{&n%HovLFyhl=y<mO>e0kpx*Gt!~L
z>oK}%29l!ERp%(M4r-QiDf-6x!8NX%#}*9<K$&)r*hAF}Q2BWnJXJ2y4i08KyU3v_
zwDJQnh0%x<=~ELU+(*s8l^=*PvWg<1dP(O`ovs_}hoie*1I1~yytBn;fy<_A2DAP-
za&8PAPPu;DEaTzca}&OmQm<@(zBKkMYRCBds6s2*9Ib3FMg|OR6;iG*QUTJDpdRTr
zhQA%+bggh&ArTmVl*o!PP%}tt2Po83eY#3nu_`GXI5#rJMHgh?dL_SkX15y&R}&Q}
zH<l01U3GJix>hpasB&2BxikLlk?!?GfZlyJ)dxkZ0|aO$JFqZ-Mye#F<icH<U7$;q
zr*_CfHC3K=uf~diqsrYCE|SJ`{wTYGB#1!}_NA(z`2UY>(mfU2&gRmi(_z#AhQyRK
z=1FQnhHo6u81(r#2m~)v@`FTa;S4s4wQXZkWa#kcu3&7|yTLtVl&1)!2&jU}v33Oo
z6QiY*W*!FQ#^$al<qAr@u~}RKq?P<vjYovSz_$=?O&nb+&=Q>mHHFPheJF&XD9|id
z&@NF~kfYKiq-~_<u@BdVO9+^VEELHjlP3a~b?b+)C^(f^EV$}|rnHoP-7)`J`uC4V
z%bTtPaz`WeWF7iYE;VTruLU`y8$b70bPb9Ef=T6u1Nj6k3b^&=|1A9y6w7|@o#y2?
z5#ySNpeV>#crJVpr;!&0U`cnbaZw=VjpyPLn#4+0X#+*_pkN{=+UuCqatUIdRF_5%
z@r&Z~c1^EKEBNxHximg);c6O#t?@&H(xu8d%i3_{Jg8@Z>T{g%MM1Cq(*AU*)=UaE
z^ep7NG>Vhf>d8|SH`<fd^0h4dP<94M5Q88P{1Tu>{r|_7$sTqEV`WacQ5J;}lbNPY
zd_;n3H<vHN+|YT@lTrK&4XBzb1x7PPhcULxWDe97RC7CtFf3C>*$vC=45C7p*;9bp
zdUaI{XNSr<7uZD|RCE0V+Cabpk!g5xb_-|Dsa4{lfIZ+3s#k^PH!?-QFbVyrfMtCv
z{XO#=4H3hsu*j#mn)kTPvp#M(*nAWGuyk7;Rt1Lgq4L#V=HM5z^3abKQxtM9V{Qa}
z46MTBv=NyXy-5pG%q#kf21+sH^68$*uqjN!Ww3(0);i|&Y=ADEqEndkpa(Ggsf5D}
z&zI4k^D=^d#@`&UK>39T*6bX8GI^O{pJN1}_ZMwmS@**LB<x?`@+Q!80#t*sR>6QS
zu<T=2ZAt)xi?Dxv%bP%lWrj@#L2?7H&ie`3)EEPYFkM?s98s_a_?-&Yw0xta=n$p>
za;nhef*y#IFk_nb(Vr9Z+j}3%&gce$5CozvtthhBe`Ck+bs#Y}4VVpCWR&p{t3SHl
z*xwMCZuQ9o#>yZ74~AD)!Bv5rk4KH7Pe?JjV5%3;uRAzG=et*92o!QNxlp_bk*AEG
z_8P5tRUFj4^DCLEcXPQIRpBJvxuCJ2p!mS#+F903sSwNpkMp88;NbJ!xQPH$J>^p3
zY*P^^d4|!$n4RpRZLOvWV4Dg-$}^3HhlEq4(>@HsLoz=`u?0_sao96?pC$=2Dl93>
zeA5Ij-{tI@Z^Ifgqhv)jx%iGV(KgbU8GNkGh>BU%Ca8P^SA`4ZxrsQXDsCPZ3S%NO
zC*HticVJf0@oQqh2#7p03b$liU2uOe{`wegXAHzdGB)N}Xe44%t$titHCA{AV<O4)
z;`I)UTmyz`oP7rdVIs-%f&vF_@Ys=x|15m@ArkKJaq$PMCEi&a=pUodB~oxPekS&>
z-FVlq{hZoFnyJvgo|i9WXLOuF2m;}Xk~tAX3rhbjg!Sd3@;liEoEuLCl>K&k2(|)w
zCn&jR17@efv#xPZBOU56)PYjsIFlGEimZlF1x_Z8bTjhJMCtCGs#5imb9O55Yu&|g
zQQ62;{44N`$LLJt*Y(xU)vzFRZp2Jy$8c6;Yk+y6KKDor&8PiTGR0J+{mY0c-#Sb6
z3U1DT<lyJ)fU-KnS`oc8cv4^$SuCNR$cdrvk26D_msRx+%|s_%_uT}C6sy3iWQtsd
zsv>qN?mBY;DYh%uVc!L_0-O#bk-sqn6|wD^5B7=AG;pZU1s*opKA2_~vGs}*KICH>
z)*(D4#{|P?5xb<Fqfnn|>qDv)9~$Q}%DkkA8C2P8o5f74unmfR9J8Es2QU~JvCB52
zkS?+sJ#`o+flATd-o<xdCb%svEj99NkHQcj^-}#m1AqQ$ZRHcjqB7{lnwNx%pO5`<
zHV%@DIa&|3;QBvZ5=`veyIMfqEm4tIX}^@6+Yv({2t->_qCEO<EUbTW(UAt2J0yze
zau%0v$+9R_PmVPYwT=unSQB1m$)c`QJ-#iwQcKG51<!zV;WZ8KdvVh8R=_jFmlr%M
zHI7ltLcqW&sC$^4&i-wcS{cPGFt;KQ^*f}FiLtv>Xft#ZvskH3lE_Z-1`#Scc*a_S
zLYE4-hUC)DS*c|1R!x05HlT3A!abh&w8FokUAMBRNnro*0y)1#KCjwcwbG^QnsxK@
zDlj<q6#Sf#8Q}iD&-{jg?ASh<Q>~D7Xvea^Gh2Y#5a<>;`R-C--gPYCn0Un`_3hYb
zd_q?$rvzX&j(yg=jLe?AZEK0xL&2p<;o&SlPYYxPkHL?>rM4gvg((l313wr_PcmL9
z*Fnb8z>etyVvsfN@)G-;mPlv8ObWX6HW@=@Z=Zfi%x*b~+e2L8U>^5FpwJ2(h%RuJ
zG|(jlbC*;o@CV*^@f>TE{!iH%<yZ`YP;^TwT5<myo1P}~@xYqi4H#lYsKB{j7JuJ>
zA6Mj!(2V*IVxv~FzbH}P=V1$^s2|ZR=owtxqs>TyO8!(z(D!w)QwsVK#6r~s&9diB
zx8&IlS5QJN3NH<cqR#~c<k!Be{eH@RQ7jY|u1UfT&~MGnF;nu1pu2>SZDSziHr+Rk
zJFd`$+B$iflmvvf6(#{k?@Ymsm9qc^F4O{vg=`W@t~(jvc{d+mg)P*gxRUXwSoj++
z_fJ{ftgeK;6(@?gA37aJGdDW8Lb_=|Sc#!E-a#rw%$YY_xPL8lt)Rtakoy*#^_da+
zE)i?2yl0*+!D*~y{usc^VT|DH+NNE>(^#>Cp+hn>ObRu_FPN;L7S=bX>{9HEZ<qBB
z@K=L6-{~2fUsgYSui$_9UG;}<Yds(0saSppb9G8P96jw(*?1Hsvhtn(6J!1;JG&cz
zK@bS9R5^e5U#wi;L~FbS3^4+y!pEJFha4xNXAl@G-+jOpHZPy0FM>e<&mf(gYDh-T
zXrr&g11?56YHp*M6b=k#!V0pny$0a$#?4HTuFzYM4!KO?sUYxFh6g`Rl%pD<*Dk?T
z;i(|igPA6o*<wR*t!xML@c-E2^9q&)DT+p-+c_+?m%(?`MKCEe6{NuPtE5~sPOwP1
zw0yJnf3&igyogR9IG5EOx2FGZx~2I97s`ZIIg0JE%?VcW&5T`PQ9a@00~st$S(BN<
zU4db)IAkenV-$D4dp2&ZgmKG(;|9{hzuiVD8^e|GYvtfDQuv(<Qb_({A1!m)=&;Qm
zC;`}lkaUS&n@3E)a5g>~w42orw)aRQcSlF59sF5ae?Pmz1wklE`KAR>_c5<-3d6g?
z^8o%o=eor207BOf2|k$!{N^dDT&+EC@Jrd5Bry!aK=4b3!GQn&v8cHu2trv`A5<<D
ziDl^djh+2NE9mtPDZlMbks@>uO=d>J9-!Bb9ZTuj^<AhAOemI%ZD(zlWm5~SYxCog
zLNLiv(3IZRE;w}|ncT#VlmQ(op+ZS{_AW}rawbZ3+n9q4T>mnXl;tc^P?%v>fxb;|
zA|HnHd~W&lhnsL7DHUzbpcUG3I4ue!AvJZBF1uP1ftsis7Mmfci5z_e1)r@2@3AV*
zy8#v{OHPdfnxWcPjCsCvn`7w1j~D+u0zX1%aF9#azKc}6S&Nbyw&}=}*fZX5BL5$9
zvsY2(N~u=lEh8zVSHb_ciSv_h@TGaHgPLs@JyKsCoTb6AcnXHkjeFMmCitOU=Ba2)
zQcEgDP*KY!heik|a$ZG4Nt5v%@2eiXhv+7n(JWcR2G=^3Rl#QVMCc}(!7TVNr)0f&
z<KVq4W+LzrIVKB~tYN8*0$bO5avs5h$U#|fPG#ELtW>LhW_~C;gCvMS5D0!Lh#>y|
zW6R{Uh^FL_t7Q?xXoQ}_;2!~(70wHYmcK|;`Q@u)tAIUNJ_NCs1W`f<5JF2YY68EH
zX|paWf+(><41S$h&WOUWyv^+;NtC4*4<u919Rvog-c9@*6<vP6sILcH`Lm(Wb~AcK
z6O|TzE^xmvu=0=5HYdXp--DML7N2@o7>6*@V9I?JxCiUnk^bJ{fnH}Vl_gq<?7<7D
zMNnwb0NnHW^DaSEWHPc^sCPKuzOZ4+>fTE-x%d&mTM8nHG8xwcldI9sFEbQQs{qvN
zIZD8l-^8S%lEIG1kDX}RgsCnr!taLu2+9o8h8ycpV2wC$gnQ|58@-4~afR<|aKd;!
zH$_;5eZqm-;*my88BD9%?CoaYb37um1)ihiTR+kPJFlyu&jE?&#m0b7coLbf&uh}K
z3a^F7$A3~O9hpb?01dr=(}iFRKREX%DM1DO!XvgV_(rllhUZDVM=POV_^-(2`B8Q*
zNf3h|5WUe<r2XLiFE+HZ8NsB&CQB=247LcbKZS|y(MD~;H1w;H@8@IN8T;=n$I4J;
z0d9!W84e7_!zDz^)NR0<3)w$LU0{oM03|NmjDpe4XnMe;uAOQ5<uneQ5gq#fuK~O>
zV}-u$+lZ}Xn!=`Fvl#++RdSbBhsEIrv85!3L$b`3vZ6-sxHN)cHG^b<L$a7aC+4aP
zVHs^4rX_Xlr>;#_$f_w~(b;12At%^Ug2qu==pcGkq3?O8b7q{FjHFRVi(m_fEpkOg
zAW~_HE(6^KYPTJh2sdK<XB;{sXXZu>lzGt{yYe|tAwQ!ET=ffq%1zkgIfRIr5ScPu
z6*y#zGJOeI0fkr4?ako#>tuRI+iSJx+KEvMdDvl>$zWUH-G~OMc0Bx>sAm32-i&^~
zSRUMnG)0AhtAQy@9;zu|7Q@P+fHFgc!A@=|3*N?$*lL9RA4h(e0pH0-M_*H5l~nIn
zZ~ZVQbN8vDN4QL3i*bppN<9H*zLZ@{vI8LqyirOVRObE{OSf6PhcKzI$d<AQ@)?`%
zCzq&GCc<ceB8h-ge#c6_*H`Ff)XNf)wGz%=6i(-}i~eH!(ckJ3F`aY|td=C?lXw$H
z<=7sJy>(Y^cp6SgHV{+WkAJ0ld`u^Lh3-abmDo2`sAkk-W5{faAM;b2*{jZ+rDJ=|
zhR+y>$(&e;rdeWLm7{+F$CRjSw3*uq;tD<$*OVM%!Ln73=+=$ciQd#Q=}4X}xq+1#
zT)z;uSc$Pl|6^lbU2usp$df&6CBapwtLmUK(zn1UdOM?>YmBW5U5$#@hu$g><e{BW
z3f)TdHR^?k`b}ltMImJ5&nTX274{lEh+7((Lfkhp2csvuR?KcoN+B`BVi57{7vB<B
zvYcrZP8;=j8VWfhRPL>g8SGYSi5%T1E;c3$Zg01dg-NBD$g#|BeFz&EOv&r|&GvJo
zcp4XO!IA`Xm#{G{w!0M`7d?P9gd1E+jw5M_^q-ZeU9=x6VU#Q$<TRaB3H!@=Z_3Uj
z$zl+Op;t;kVYvUrTB0}K#!2B-cCM5Q@PK&!GXCxs)0`Qa!%%hJYn*Bzkjt=LP+UUV
z7_TnXxvh&=8(7ao6vunva%o-H!T<WD6Vo3qH+!>Q>*7q1iK$NB{@<A}<FqwU5z07A
zXX~?>&K%)xpb;}iCVEwUSk}3LCaBMpQ+~In;9!i54-;P@U-vbhp^?ChGg^d2X@Ty-
z%B$}yd}KPCs7~a@px!1okq{ia=}dsI=od(^&U3djI53gi%dL?L4_0NP2k#n9rAP1;
z2;7~iz~JaFMU%w4g8iste~g$xw4i>Ji79Xjs@a4BP-~KgXxH-!dRZB63Y^HM6=91W
zxiP~2jTAWrUS$J4Pb%sla6cXzfA@+BlI<1}e(K6u;DKPTWCF02*+`1;bX^2r>yZjh
zY`=TOQD0c-H`%^}#zcms0=U`HtPi`S6vC60z#*yFYgIRuC&%R4VNt}|KR8e`lonXk
z4Q&^!By+B*zDKsrkN;72u1O4oAP~M$CmKL<|BH3k{wYc_;Q~y@l*cN3MB^blqK4ol
zkf`x?FS(KQl2rWPf%IY5yf?_uadvLw*+Ww$t4p}PQN<5uzbU^&LjCdzv_&Egh7?Y!
z99W)B`{Rx6hXap(3E9ZLDn-z4Eh!niB>FVuN0fl5D`i$|mZ+QxZAO-bNCcR{?N8o@
zj17I|6+nzE+mJeOt;T}*obO5Pjq&>fUm9;n+2{tLg8*=~L_SscFrv#_Kg@HS4qBTR
zio5?*$SV?%F+?aEcYisDAd;tu3Nl3kFb1_5DYgogb{$z-D?w9a*@JWq_FvA0BpeV;
ztXEQx#+mxLbb@r+PAb-Bxso437Y@f+&DgVnKsYv+uP{O+LS#;u#d*Ma?2zk?;d^(F
zOOYrG{5S4?B)i_d0t^vbne>h*=*lG_JsYF1;6h~Wz7dvGjZ+z<o4ql8|L=Q1$9M@v
zA}cyZW~e6dxxvj7xn4n$h^>zs<o)p*Qut<GQqo}CY9w{G>M<rAU&^lR2%->#wWKQ^
z^xxPL{{(bi8ekk1ISfhZ@rOehiV_)jH8Q10Lu7bycT8Fi^SusMnP8iFnjMo2#(BXb
zv&IH&Bs)NrT@NOi+|qRmrt`E4U5y_=6zwPRA}B*aBC|b~NmW_X%a2)^f=&c_ozj!-
zWWv!y^GGRz4mlt+&B`dN0?l_YeO{79GNI?d(BOByqtT;vmPBS-Db5Z#P&DSOYQY~`
zlR882QHroboZ1nzChO=r(S#Uy5u$x2YOeA)IjY0xX<@8ZwH(Tdk+E^5i6byUIPk*Y
zZ%`Z1<5I``V*7r2>*ZxsL|=Ypek(74gb{#?*ep_p5JbG3k;SrJ8>nmTrX>=MN>PG{
z1J9s2w*b}!Nki5T&CTEU=EQgR3Ru3qkXBzO2gu|j>lM$aoMCxyYqAGgEqU*oZZ|HJ
zNgDL!ZC}x+f6C4+$$=1rqC1+BR($M#W5em>BZ!>}8=%xuLA{>)inRGT@E(AtaO258
zB;E|Vq;1+5zWLjM1qId3y{f+if1YGJ8fM)zzr~-;UJtv3r0S7RHq0NdR&oOytg!B}
z-I;1+L&flRGN=?_!5&~>D??mq>-i7GG0>O(yEO*N$5Q+ST*c0`;bw1T;4RJD8Nr-s
zycu_p#*x=?jQyqIPN$8RIa?=xcj`EdZX)lim&J6R`-dIW<Z8c!eVobaG%@@cw`5c}
z-Ajqr5-S67(c+b(m_N^17qG5+Sb&;pwo{IBu*aUUT3OK!86<^_(G3{`B%eDh2B(*}
zEA`BfxXTp0b7y%OAD1}wMkcVkO6gE-yIN5!a@aCPYNTDkX}Q$aVzn}0w!;oRGfj5Y
zCU@YtQK4IC^Dy&fs?nbdkr`o$sW0u(pkk#sGAd<P6&JPL(+b&3MyQK292xcIM(BtY
zjT*k4S5&?oV?Pgwcy*c`KLI{BWXl?@?N$aYqu%aF1Y8N$c6=h!5c$10|0z48BZxr|
zh_-YQQRu(1+w~76PH2G1pb-Rl`^|EX?>DAXZ-?3d8LrwZG#HJj8J2q&1skW7C2B#b
z?TfoZ&tXiXv&C^j$!S?CUp+%JW8glBNPsnLzmu4jn!fDqP}LM&m1KggSFz$WUI||j
zJj02|)&vLCKqyGcASLjOM(~VKm0;>z;vmvLnSS+2iy10OuZp`0j=*7wthHCDGrCb{
zj3d6tLW~Rdv)}peR6@-rgM@RN3u=R9@C1#W8o#)_Z(>_4_Y%Cq7x_t)Y@_6L4aI8w
zI|%O7s>!6byaLS8wvFK<fo@K{Ov;5EmMihBZ3tgny4mzX;@XFPv3&7I?9n4%csNBT
zM&v=V2`gcz#dmDBnt+4-ttY|bc?E8x;iU|xv>uM-ig678ljZjf7$3^u9*!tBIYvMh
z#OV^LT);FEX}UUV6xiZUYTB8)R+u~*Ws=r=2&O)Z1#wC_dkNE{@u^HF+iOhxI0(eE
ze>DE?72OCHP0iS4>@!g{^gE{KPuUqHQ4E4G^h#Pq+xuVa=ea}uj;y+494ZDBlG(No
z%h3WkH2s?8@5b`MC*8x^t5VOPn&TYbEIR_nzIg`ZVg53WnWuhZ`QYu(Z}1_so(Fk%
z-`p@n_<yV(Zg5HndVQY^BSK6F!L`SPQ@b+$*98+r4aL90CmC~srEcOd0={(;rB>~s
z5J&8)@$#|$y$JZ$dT?+EXzRp?NE2hz8ig+k$Q8yzBtTaE7zNa=4M}RFQs3N?MM!|m
zb;nfbYgKp98Dn`DcM+_0%`wRL2nUrmHQpuG1R=zwW1f%(GVDV0C>p3j^wlL1u=RvA
zr7H#IEtkP~dpBSks_~}gnA8gdgE>(`KF=nDk8tUjO<EIVz(tr+^RrBEe-XMH^Sv>d
z5w(s4n6`MkvV3sKtTln4ZG!nNKPxTL-uT~*;>DDdLL!o)Ll3>fzGm+cq8{^FN-Fk|
z%2T1E&q6W1wR~8%SBuwQ>={O3E*e&MN6^so)8v<GmqH9i%J~N4N7)%=0SJOX@JcD6
zasP|u_=i$YE<im~5L;)7ohexxp2nc}UK6M<Cy~D=$pWV_D0XNPL2Qi2oJIc}?zU`H
z<>Fv&x)Vlw_Y4q7TXlUBW`B*lU?lb+bf$teaVHo;ZAUys@(w;_s_L|5RZ4;N*nnXM
z<~o*P>S$XCZoD`qD%wTsN#vh-;w9dID-0PNwi!WNdiT_r_*?m-MH<aC)MtaX7Ub?s
zxm=8wXlJHF%Xr8YmH7<#M!kAwq+Ak7K~>YYn=O_B$fy_3=u_q9^ukaj*uM2iF=Vv6
zYKaeNM|k|;Wqcon{`{66Pcumzg{yvDQS9$q%M3(D|HL#Yh>Ut8CVo<)OC1Zb_JC7q
z8HkK}A10aJ*%cR<A_3LbQnVNKPE7a1>FU_zjeM%RTr0zRQKzn%7RCi1Qqfr^`bq4c
z8RsE2kQ9(Emx3%T81GcO*li;~UUcVmEXO@`rt&%)CipKEunxbCt?hZ~lr8g8c6LVq
zf-nqT3B>ZV|6=CTrviF*0gkI+(>5f}(i5FqShyjAkWup7v=ky5E!K~ZixSFLliw0P
zWrEczXTS=Z!yL(1o@*m?*Q(%>L5nH&XXW?vHd!!X!>Rn8Yt#R^{95`wBGps;QSt_(
z3Vv)7ctniF9KlAAqX{`4CEqmYO{_zu-R#JeQC_8E$ed$Wlt#2(%+qcPLl0eSS~e)|
zEjJ}1^<qw<hRHz({&rlhZPV_INU_*(kMw!=dID0l>0`BR9T9yKbN)=XY&xh3!`-y`
zm=T>28xEj0^x5#=ImbF-tD!&XtW1NA3Bz>N(gi=hb=#4@>99$-0-vycn}boBuBaxY
zLSn-=bkI!^vPqfCdFFq6{|Jre0$>_cGEa8<8uLgV7@i7%)BIpofSSc-&mpFW*Q$Yx
zEZB=yhKiZT;c8kvkYj4{rK9T7o^=Ed#oMg3KWo26yQawy8}OS`<82&0hRv;Sk*$BE
z$B@QJO=WiZ<;^c9a&Y06O!Fv+T$G*b4Fe$zgID5p3GBaEZGKcDq}90tAVh&Ahx7UE
zEJrvlxKlgNVX@Y2-eNF`bYj83>0t><Ur!9p2AO+TFJ<n*^rA7i<IbkUC3`TjC9V3|
zd&mwa><J<jS%6)ut{_nCkmeu__BslZ>xq<a-dLa|QBbUe2S?_?Ye%u9rc)RwcA7k)
zS{z8O9T9k&1Ftt@|K2L~><F&2Ppr9jT5%<kGgnG6t5>5FxtLDTTuIO{OQEY+?a{5s
zDFtXo9C{MZ6vT?v(460le!Gs+1_@Ondh{+W`Ux7QNdv3Bff!J(!>Qm~te$SZtj^0u
z=6GxM&B%WyeM-dfqsi8wJi?P)O(Mfs^oOdbOWCSlc5iSZrBTo@R)4cjmxOAuXa?1h
zPLj&%oB5iZMkVeBSq?_tFOLJEv1DJ%6jqA`S<ZG99gaKjVfWqr|0(gT{rP(1Q(E8v
zlcF#3Fsj$eb1$wEx7vB=P#4iq+?jk>@@S&4Q|v3h`A~KSNfv`35WSKHM7;mShPGyt
zmi&^+o=QvvB=jSBelLX)BGX`=<8pn_W89LdOsfJ*F=Ep+jQX}I4}QM`|E@RIzdZyE
zeS+|LC>pw3Y-GQ?_wSW?cijMp(Hz*d-A<b1(-mTh(I6;^Bc22Df{H~y$#bg$Ix#s!
z8&gqeiBvkG;hBzAcp>&~yxCh>!&P90(UXkoTqR(L5u^q{tp$N*d^26`%J%mQC3sXM
z9pR454AWga*^w2OFC+m50A}EAj!0LNa8;p(n9L(PK<z@|v8Ue||FP!IS(AWefvoSW
z16RNvCR|Mgmljp+DI@#W<D~<WvM4yb3nX@N0kM1Tp-P0&_XgGefQTp-r)rTa)87kD
z4LK6=Tpb+azW${(WW5r0Xl9gP@=AEEU1jY_bA*?UOUjzYfdg0TXhimez_BXu5L41L
zBI7`DIFfjuEeV<>dWb307tuQHfJ0b3!??ToA8SK8eYC_zq#k{vE>7c>NUEH#ZY8v~
zKgzD?3Stn1t<<Ve*nhE0yq}8NCkybXRU#5X&*E!2vHh_w9@m8p(!dOozssUJkx@QT
zx#B(0x+p*&PVPsx_pV2>4j`0#Ucsg*RM(zDOh#EnB{mw@n}SEkzSQiVUC-cXkg_3S
zV1qxbWg&l91jmd3iiROlRQ7Gih1u^x!Q(~ZkdZ-AiOt8IvePIP+Uktcp28yu<GNXB
z7esgbPx7p1&ohuD5lU+xYVW;8Xi;A9C*^uj3pd`0*cHk?jm0g%Q-C*;ci8A)#0~-6
zm0IUlpNx)+2Ko-*nZ0B<NhCkp{J@(LNKySz*zgnp=|~Ddh+^3Z*A-)9!)Uu+86_0e
zk;+>7hd)#RHIMn~+Vp;7ggH{w1uXKv3&p`A8`Jw0ks#*beGoO(>Ykay{~D-zv?dyj
zBZ;ksW6sC<Gvgnwzn^%dQPI5h2u^CNOtv$qGt7|^K)>7sd!!6Ho$|HmkDvKIha!L)
z1XePsS<*jpd%q;ZBq>CVQX4!sr^4I9?;mAnb_78P0@0L45s&;6Tb_S-Y)Jx?#UPDN
z+Z{nOXCx)Iy>VZwvum}t(D#%$u1-PK+CUhTm$u!aUt-@=;`XKR>!w3U<GlYJN-%=L
zP6;R39N)!;2DQ_hZWxJcZX~pOef3RQbwgjW-ChF!Nr->t(E$PlcQKzlWIKZF%|E}=
zER*nn$=k7+M6kDcy*GhC!3(>5`l)KMBk<KWE8+sdM9|O8hu9JH@`h7M2hcl;jes@~
z9&!=_w1vDwE%27pwv8V2vT?tRtb9FbBHDqe#$Yyi34P!43!O*t@gCjKn9J!sD-nf_
zy3l!M+qQ2x)x^q6<Uh++$HRhEt<!W?cAY)ss3WU(dQ}5q0?dgRAarlADTFzW&x5|i
zhs=-Fwsv`nd@sQ6l?j9+Un^pp=TO`cm5}PZrYH;Rs#7gH)lD<jLPr|6WAbGCfcQdK
zJCT&fOW=E^J&(usOktXUP?t7rj|h2G$Kpx+Wv*OnSld>434B`ekFsmckuU^dSMmWO
z_rKUucYbVFoyY}<A<RHOO8bfYw?o3tMqv{feG<;qd!94>fJAg~FgD>Tt+@NsLv^Hp
z9+7wyLn~Iy4tb%+XWy&ZS;+$!3@8B#7JGeUni!FHur@?Wnsi)ozJ>mh5Hdftu8x7b
z_hzj>MZTwld~TrE6PT=E<zR<#I3qw}MBae`lq}2iSq_xCbLi`{jkr5C{z+pLnIKO<
zLS&EanP)flr-9!{ADAlZsYEg-WJa<&zZ#H%F5zo1bdQ};2{B^wU~8c`GLLe{!mhrA
z{*rBGx;k`~y<u$aJO0fmkQj4#0<_zb4>nxb_#q=Tm2I}Yfxrn0+$2Eccnp5e$s~$y
zjApn=cGbD#_Ka|f5r3zOl-U#rHQ=5c9-U~rMg*P!kAi#7wT>F68p!}XBmNHb2IIfg
zCLHU08_Y7&CPr3Nk>$P?3o)2QN0+@DWE4V-yr_!fe9QwPK%ckE{-L31DkJo1XU1GM
z%KBL60m_Oz1;3VG{r8iEm@LSs0m~Mw`JwELav%mlAbO=1u-N-wY<d0Jplq{TfEYvp
zWoB06SH~+0SpdY|5tefxlv2dW)$+<h7XV}wZt~N->S{XVBfc=~P_rV67FWtRi)<#|
zT6h)-k5UymS`dMwy1P4>QnElQ7<^u}BVbhiG5kABk``4oGI52tKHu9~<lqjmi6<p0
z)PsRuqU$uTqd1nWJeh>3G`3Kvc_Ov}h5WVb7nfMZ=NjslW`<5&Q9E=9Sv-&S3{Y7&
zTgH3CHtS#8esM~wT<LiwdbArAg`z?2kfyjKPzYlo2c@x8ID*>ri@!6uj+;dAjhlq2
zTbOi6O+1hJQ1C>cKrVlMF~qNye=l0|-=xs!!7mLt{B|TelqS9o_(b$kwmzIDv&d)K
z%EHTp54kMro!C!3%Qw*$XNo5oDq--~AYU8jwa>YR?M{|gOG=iC{J_Cq#XPFuww6=U
zgDa{u01w@d=ge=mI|YQMmz{^3VAw!9dlxCJO}}_MzqpDGritc_?C18OwepgDC_9%N
z2tp8uUTIMAbN`DC&sm{Nr`h&`7&ToWMb-1Fy-2Hp*x;2!81Ie_GK0ZhS4Z*6>$^^v
zeMY;T!eH-7Wi@4;1z@1=>o>sHOes7(v!@!a%a-A^RfoWkL3q#XX%z<8X0Fh+2x4b|
z*b{pi>;&zoLTp{m@+S7fjvqtJc8BpVE5b9uz3`0W$?&Wm3<N9kQMAlz@MO|bXn9KS
z*v&?2mf<H$tL|n<Mp9**jGpb{AjspQl+)hCez=Fe8=`CCCxb=lrv*QijPA+sj2_w)
zGE3Lqt#G(EJcDbV%_Ep>+P6;6Y{{F*|2ISrv$*Z3s{CpK!V31(nPnF*fm#X;&~6!u
zPJI*k{|(gYUEC}A!&0dFB`BjZ$|S>EQYlFfG&><fUUw4FQo!Sdcgm0Vz8YSz*Z(^s
zdNRD~4!#mBoF)h_Y{5yUD$CQ7s$1@3>4{=aYSr6)ni*Jg+B;V5h%&MONiaOi3^q9S
zjv!it1>M~9072+?(D0?~+>#&$K_GagJXFm6FSa!MH7nVY3s9CZ3e?c^4K3Oo*yFTF
zu}8;WdHI$Vc!&vir{7`yHBiRzd$yg>?_W~1JigHs4fCA0=b1f;UAehM%hO|=%5QCE
zgY8`3%3kU>ik1fmqMb~sdZ9KGtwRYWV&eyf6?yldk@R?ivZR9*n24#CXM)2vfSg{s
ztwi=b_Mc7BIZB#S^NEo>hyd4C@b_I&6UPP$2J1h6)_PA4c;!JG>ft#0?bW<LY8P`>
z$*z>@G}A;jjG(%oL+Cqmy}v6!5wj(aZH>yIwM4B};fa{KSox|OZqHz)*4wq0dZqSb
zt?DTn`bC<K*H+}$Bcei{>p0^@z_GQhYpy(IBICiqHaH#k_k27%q5o`$w0h`~`gx`a
zaU4mtP@=7vFnAc|@L%SRUeA@(eihh?34sUgTNsL9@ctahuU;zsOr0AKK$6Ujc@5w8
zmi@jZg5dGkfyD)*k=?A7r+tcK03a~MFhZ^5SXV|xY)bdl^BV)-VpIxo5q&5-lPn2B
z5QttWoe=MTvF5u&$?9ZNON&SPB$y)pJ^9@k%}1I^t_RVIFo1NMoxvmOmnv(wyaxJY
z#GQh#n4xf)Iu2H_j`$`q*l=J_d5{z&aU(pe81>437$||L>2i67AZF^p7}@EMcSFb0
zYQH@$Dd6BadHSr7?~bjgzJlsNhJI#xMjmv22<{79QiB;_NdbrD+3Bc9qjKCzBp^ZQ
zEn&D9#zL`bAms~fi3SY@NyYYcu$!wTAog-AwPOuDo{8;V7^@GE2wWiaxjvozeo?$C
zmLVt>W|i5BC+Ngy_-Ce@=PC5N7%VolX1{^AQ^>*3^Ax+_G`O}>!t>4SA1*m&UJLK8
zU2m}E6&NzaHglbd0|vV{qedHdQ$$kOVXdRVz$3-faot>2_fwUK@cJC9m4+%6Rc2(i
zNBMH}tGD$z#m7<jY6xOOMjL!f%^2?2Lu%da3>Lw9lOW9&O_|=jV6~9-t<EB`2367w
z&5e4wtXeH;rPmJ?jl3WHN7=a@Q4E4mu%(DE(tl%@&HX}2MjBuoVg&TC9PAYJvK|2(
z2G!bPvDEu))gLZ#B7*0h(elh;HOSZ#?+iUhy{yMRqM&x|Tqj+@Hknt-CtgB8<1p-V
z3pnsK<jDBDPdvfS@&-|64z%*<D>mbaBtre<EMcA+!`jNz!M0hJjAcJKt2ay4V2A@I
z-@jzdSoS|97*HMkZd~zdkZWcLH0rfI7cUA8aJZ_SD8Wye;>766<r(Ja4iXe?T<}_y
z!Nh1;=15k`*a7_UuTMHL{=UV_(niUhOo6V>n|zROroc4n^*vUdF=WIR58W;(0y9_|
z_4=NU@|x#iVbDk**P0`>a343}s?*C$qc-rHedU?Bx!`&jWK!XAS(-9NaA7|)wXv>K
zv<e+4cH*iX=`zoj{_Yqj^s%45cBX|2okc-AM+VoUPUlld7*ON%{}uI-=?|y4e72w=
z2fayozdIxokiE#~w!PQQ-*&VxGinz*&QwhHA|F`pXn7l>&4Z_|`5Kacl$}eG#UKbp
zw-kaOvj2@WCp|&{96{s0c`2D@Kv|@ekJm$LJ8aD%9dPCK@JM1Ny7~%u$fC*z3<=_Q
zL0k1)dw0-EK{*P2T8EXyj4z}oiT197BC@FT0h=&Q-g$*`&BQ5{8v%=AAI~(EJJAlt
za<sFB|NfmC=D*S;?1T0X)RBG9S13dlgg(B@wX-$7l;vgRk?9Yggnilgi^@2(e+lto
zxspu;nU8oFZZBh3Xssu{*3zQGwxm&i-{S&8x|iJ*YLe-U-hfZd)7TfDBqydn79C|i
zOkhTMXD{esF9a)CBZ~wd!KR{9AEbtfw<}>j@_PVRPM(zCqu>3+@NbVqi4VwbPp*Vu
zteFD7!Zfld@$saG32uILd&KOAwm%lW%<y?^HbgC6d1jLA5--Wx!XRk=4IUT|7sq}A
zRs#GoUQ2Mw^h%BQns#LR!zWQqpd5S%wG=HxQaxCyq+cXHWUt+$oO;HllE`o>EGAp1
zJzZ#l`vK<R*s{A~E9DSK1pX*Hqilyk5QuK6MiJQm#yVr)$3sa@*Z`*`Dnl|}{zs=q
zhKT)ZBF;DACDM~g_;figzV^jxM3bEA!3yWeqSFUQ;Z)}_E~}B%H?i;2A{!xu2vy{o
zw**9wwOFArncQM0^FR;T9nq`W@yF?{=P0vtNmqDF7HmCuX6S{nTiWXW&J(+YTe1z!
zvjB9$(K_h6Gc{77E!k%5LHj|)4LO1m$xZ(z_`^?+dvVbFg@kZ$SC`Mr==aYv+^<9_
z;8d-yB!DGtUj-Cp!Q9h-5Iy=FIiNMkcu6`0cMlOd#@R0v^CJ<(6#|vTp<2Ql5@P(^
zfHwPG=!c&jhZfl4M4HjwnC+g@i;a1Zv*se*TU&nHY>`()&)mpaL#2~>L-U<_q6I5-
zD+?AMG<>|i?!0R_t~2G80w3%>9AJsg4Ef+Uhn^fNr2-$^JuK@Sqt}Vevojl&@;iOM
zCE*tm%?U@U`(tbsR+Pn=S}Zc+JgEp-`<ybcm1t3>ZR2&jcZZr9j-Dh0|5A2tNf3h|
z5WG?}W`X-(Z0YPrO3<xv0V<^id<;Fm;FTICfoaF%;&t;x<<wv6a)@3jJ`zm~&h911
zYrBuVW;?8P^gjbL;>Xi}3LVMDh28P1@Y{cX()zGvAb+3MxO&Vx&306(n*>t&1$<rZ
z`^R*p*(wYpo!z#$Uh`}_Zl|p5{<Mz$XT&4Ic_=%n*5%`S<t)By6-JWEOtiZoFM*`e
zr}^v&TuHMUpp%0&av;p%<v%ZzN|Mzr%x)cMzuq*qaRG+*SwmB5`A4iI?3vDk`i27_
zZOOQ}FIGh*u}=D)-f_4;y-XT{tQ@*REYeBdgJIRJ5JXF`Xjy6{Vv%ZKg5ZRR(DTT*
zqU*@}iIln1>H_!Rr(&-&`46d(kTiI0p<y<BtNnngi_n!^J<ED11Ra627XzF~7ei7>
zcNShkd{GM~_kJ#w-rfb@kGBQvD~LQA7YtmUWd>TSu!YoOiS(hyyzoX5_+ezciN0Tk
z7HTAZ2+|<$1N8hXW_AB$`K9dKk{t$N7`i1MxdrWiW7nto=tR&o-hd|K7z{?1cJNjs
z>%j{V^bn1Y?bruAvtP?~U*qcD;GVGK*6{@UCN5_51G_>8rk7l%HetyW1exw@6kkO;
z!Vg}7Gu1#Q`Kp0v(tN$+-JU?-M8x#d<9c&6x<~zdSA2y2Em347AEqPXM<Vg{S2y$b
zHKPioa#JKz8bB&;>O<?V;q%U#-0UREe5Sb>h&EXq<7vf|wJT6FT0Oc_dJ2wJJr1lW
zdg7DQpMc-Q#n=NAac7z(LuH|Y)Qnt@%yKL4zER$zJVa1XP+0OVBYdM`jw4atW6`{#
zCbT-&nDh*^twkn5Cn}2l6dN<>BLgizP`*co@f>VX6xN!M5vWnM<7$+Hxb0zJ+G)CO
zQYEvq>Pqdwb&FwB1S?K46~lgIzT8&lJeaQRo%fK@H>ol*;AXi6Zb8j})BLh+XS7&k
z#2)NX#>57ooTU5T(BD_4@p>w)(a1l{BX%Ujn$cs?mDcl5*|{A_5Q0!NmyN&&isYZz
zdi<F}?XD&P$8u~$yqwEox2#%A!&6wk4E?fC_Q#M)cNi>O4xaM_jzCi^yE4z9nlZmk
zUZKuuN2n&|h&^yIu>vv3-Is#*b?E06DVsAT#eiIC?8Teylndnu*~B(MPr?~WFl2-{
zq?a;MEuqQ#mym@?N8Q+z_x(#mj1W$&c;Q{*S~8=!P{>ThE-N32w;tb<r0QyZS-7!&
zi7OGDhk0pF!dw8mQNfZzFDXR`=wYSr-n28r7c%?7CF1Bc$`PoCIfhRn9U?^*^mix|
z&n*)PxEsW0PM$|EMQwkscqH8J3?E*N3g$F}b@?>*^FH_59(0H^VSy{HGH!!M!mXF~
zaP97c?t8lE(zmf+Chohtmi?&CGoQwq^Ph}BH_S79WNFkp__bf!^E&YJ_IAP^ywECm
zpk~X$=qzPMfE(tuJ?JM%nES}>7Rn_Q%AK|cB;~xK>HNic3gt_tAA)(9)Ay|NVcoi=
z%+KdCcI1$7@}5dx_1q((luFy*KV@f>#4rc~(JK`NmHS_;tY6(qGI9aNAuxc!w-<(A
zJmS1r7Q=AE<P)KtT;plwD%}a;6SHaq#nA-x;G>PG07zU3K#6ssWspO63?^rYRBDd$
z1}vJY@!8vOr;<=^`q|g|n~$I%;wcTD8)&z)B2*wDPJ2CL)B0OvI?!>+4;L*>4z$=4
zHlc6<fx>7|EQ#w<on$#KC;^N5mZeQv%?g0Tm9kOs=d2IOsM1oQgSb*ETI6=$Ov}ia
zd1v~?8~kWwf;-u<ge_3wJfp8teHq%L`}Yc7aN-gnxr^0O^|e0^L4)*GOlUejP45o=
z>=jnvf_yf5SjZ`9J9_U5GsRhdE6&>i%Zw=80WLSTUwlH-W%vWNVB(&mB@e}N<Ig_f
z1s{MRhpniUb`Y4P!g_Jz?bnG-wLYOB*pmpX@L1fKn!ex<hcssNuBSgLSQ9sfrhBx+
z;1NU}Tl3EJ%XcJZkC{j`4QN|i0`is$cf@I}2j4LAF<Mt(lGdGR9Q#Yz86-gngFx_0
z8%;p||FNZWL(r1T9w{qk6TqS8A@&F+LO5FQ3dFDYnUB^Eb;N?KXPdvCdU?<*SvuE&
zUmp65+j?E(I@l2xf}zm?nphzAU};7JiG<-d@*vdc;6W?^d$1m)9f;NNtQzzk%!UOq
z594Nscp5d}o)(!-2Uuazcnc9duBl#IGO3;FgAV(_B$kleUY?4eZ#r^ctwVmWDCZeU
z-*xGBSjo14b?oQe7X>}1;Cc7kAI*Jl=l@Ix{9rdykKx|QI6vK_FM(g4I+A)O=GqWA
z=ge*07Ei)7S{MkHmx^8Zv9c<9bZ`<DQ9Wqt_}R0u>s#oT1qlV@MJ{X@NKY+hLF?Gh
zOCrHiPMC!7D!?;gzYJ2{+W}Qrblp0J7kHj5FtsF7EqCX{zA1Qc4)U^BlrHJ47QAz^
zM%%65R;Zm|N$~{GT-dar4|Y@WEIIi61h9vi?AxP1zt2eR0mK5YjA3sr&esn2!6LQ?
zal7vod<U#J1EsYjq3f!D%FZU)VHkwLS2Fc4_rKWFm$zt%-A>qM!DJi<ge@ffk@z0z
z4{GQr?7J{iaH8whh2!a)7QzgNVwMqR@D=VvdKD^x+AUmJcdA!LIKkJ5k)i3DsxZ32
zhkLn{yn){|d(cS{B)-sP-v>A>BXHosc&l81N6T@YRE?KEiv44s_+1xwVKfDP0GMna
zGb2LapXOUn0)1cKNaT5`D`S9%mc5nTGtDxB1|DfV48F~Ob2BZ$p%~0mp@}4(O0#Rk
z9~?;?mN!!kJl=i4tQjOc;l3s?wr%N*UV?k%xT*kDJwpi%JhB0ujG%!Bk)DEIM#sNO
zNPG72B=V2-zDY4RC3`L?VMMpxqg>%L`P$<MB~nWr&hMa99=>KKs|M>WD>&alXR7n9
zxbP1AJf&I*##=_CwAz|{%6{73o(UcNL?G1(Q?51oIGw{MCdjP>g&t-}yW*>@Y`cER
zG4QusV&%r=;S6-CBcs*R?moP>WnMc_ULB7gJw;CY;JamsDQqhx`W8$>kpjv4aUz|^
z(0`O&(Xj*}2x|$rRiyvMUUK(^@OFj*)^S{oAR&1_HY$>GNX{5x2rc04Y4-J?4_hVk
zc&I9(Uohd_-mUgC89QsEJ0eMTsTzaICSxD8G^@y^G7!jr4Ofm+@}WL73|g91GLMH|
z9Hf=7>bp<fBt98AUzGTm4|8PrSMwk}6Bx-19_oW4x(O0$RT>uXnczq!@F-a}3s*rP
zvMj1r8WR}F{2gVl`!SYNc4d>q2u5yI9;`L(N`uMur*_<FOkhN_xle4$Kpw!~Zrs#0
zCNQFY3H#CYJSdGIb*U!@J<IV>Z{Q$xM1Zy*H>rVYOiubG$Ae6X*^?9JY<Z1!CjE^n
zmmbfejyon!cDpxDP5tQq?vza5p)H#S?Q-ZB)09<Wf>LH#18M!Nm9e{#)7968Nspt7
z<>2+hoy{L=BDJO*69BZ!M+DGEXFwJ@8}FcY?3cfpt()27#4;pqgcZ$lPvF(^TPw>5
ziy{MvrmBfZJM_!6{qk0!shYEybjxYxJpu1O%FZB*VGsnOR|3?i_rF+Y><ZB~EW5FJ
z31ReQ_~Q*b*q1PB27LvapMLm^kQvNWv5jL#SQGYSMtop<we+<Dy=AAM1S_Lmc?u(9
zJ1m|NouZ!MJLwq1ff9dl;2)V}WXCyn2%jQ?i=II86vO>C$!LSO?9gktpw|%S5w*c2
zqYXZG%NQ>~7=nK7r2iMb*N6|@GWzuB=w!H0dw0=4isbQFZQ@~U5Xv0N&m^O0&aH#r
zZMpW0v0HL@h$VGHJRF@SBRUL;evO^PB%_tiuVaL$8I#RQsdc_t_<qqoaEpWir8D4R
zK*SS7*d(K5-mudr4*sN^l`$k<bw+FI#(Je|j)|)T#+QD0(KCWj@2C&U40)<-*d6N?
zO^%bZeKHy{z9X6b@BBGySQ4kC6@=RLP|2A#TDNhmFE0)Mz}(VkPc+T+(H*;k^AY+6
z=Osrw5Kt^L=&7<rYju8Zo4E1VXCEepOfy~D`*fCF8(T{3$yWS9c)>N(rrV~9{4j)C
zLDAHDc$_$0eJH!4B!@x}cBKUo_5K%I;vYym%>{gp#Q-)W#M*_Xvq0;Ic^CB7n**mn
zFVl2@+}9oh^AydzkP3r(nW%&GZe|fCk!YS5BNYnvGEFDiUBPT>RI055vI^B5%-l!f
zzmy&I^#QSeclU<@)gr`$3CVS5Y{&LSkwckDO!+HHJh54U;c9$BtSRIB)juCh9chm0
z4DP4{W}ViAB9jy{V+S3^wSa+^UsFU0lM=kp%<m{tw309woz0;zIPQ;P9bUXZs<!iD
z3IpSwujU4;6#~Zh8_kIvCQv*JqHj!igPS)X{PqH^GAW`6@x-r)S*If)B6t&o%Ak0W
z;fe5r96(e}3!`E0v8XT+?p_`Srk}Y5^2_Ue(p6=0glAdws3ao5qk-SY8v9aJrY_Fh
zodMx38+yTf&fnJl5-Vi{M6NaHh^ym`Ww9!gBQkqOV9=y)(ZoaE>$kN(Z#>g?pqdJQ
zGxQ@Hb;WvCXMlW_%qfQPuN~cR?6TQ;!NPyat{{hj5Cnc{1+DV`k9CG7O+>m~E<F;%
z)&XP~?rrZ4k!3KsNVIG4{(&k|!NMTK!_A^j6kVKfoXNQ>U^qkMH0tys0qXF(_9v!q
zKIYb<<ifN8Ky;BTl>}5OP`k5uP@fnoKOuqV%67MlR^Twucv$Bkmlzb2L~3z@ik33w
zAjI?P6h?-1Lw1<7{6s5YyY1a#d)x`S_+@^ZxTRH2zFOGiz~uzOyPv$rXa#9^bsiFU
z1}jwK;A--Yq@{P075D?)WxsrNizHC1rH7N9$TOVmKiGr+2#_AeD={Jvc@WyVE1iyy
z%=>@KH$DmKl1RfD(rk#o$e!n}goqU`=QO!ElHGjdGx@8OlKmjlV^oUwDW8sf<(!HW
zt;C2GdnCA=lYE}b<ss)2<G;PWEA=oLAFO}44c#)(szjij-qT32V}}IAo5~~0zdddt
za3bs=heJk7c2Dv-E78qD$>~Z?iv|8jTHB(fc7XLbW6P&+;9=v=!1l=a*DG(zt^`S9
z5CncH%@NK2Ken_}Tf0Oi6+YlNC;_#PZE(*Xb6CaAsZ?RU-%e<!EN6WlHu}7trvK6D
zMYFG+(wX5s=7jLY@x-p>O)GE4eu#MX#<TTU%EKmc`o(fyt%zqh0kt+&`3L5V{&|Z^
zgTxDDg&s5BPsCP~buYVbl@5>h!*TjAzi!k|ogcflq91SYc!8|hBRrsBuE&8tYqrOc
zzb+;+$_In;(Zqj6TW<5+v>#%U3n%x;<Y|ITl-*NJ8a!U$xE0Qe{J}Zm7j#2#NQcM^
zWW63I{wDSab6+=6F6r=ifsFFu#apC3eGwvsP((yK5y^Q;8NtC<o}m@;q#XMpCaI$x
z!iQ0EvLlN|l{<}I0ywg_uF@<kDvuv~3)G<U0!WZ_4ruIU7Xq)CbEnSZrqmNn3GsYF
zdnJ?otymh2Ti~YD<Mcj>Qh!F{79W*jEzj1}Z!TP}l%2!HCTNaVV}IS?NG~WCCrgJp
z+M5<P2MxL~fUL$GhvW!`lL}v0FiV5c3;cq8eki-PBM3qe*3yaKqyNS(@$Ls@cccNv
zab1EKlE2;n4mS#X{*_B=_Xs^Rp*OvOHR{M|2@SM|B{LUWij(TW@2(%V!f7lJaMC3+
z7F&vw>S0bqvJ&LjaXxWd286}Y2@tPpT~?d4r~O>Te%=r-(X$L9I_>8hReFxl83^|B
zJbW9)DM9goY%)*XqA>Q$UVEAkA2rDAYaF!?if_x{q}W!M$WQKq7PUdc+A@eEzJ#Ut
z0;(Qlz!rA$ECULj=A(u3YFM?herPw5U$%Q}4xR=$pdXygW6n=312~@IBXt?jmu|?g
z!)_u!AMH(*htwomG~uqJwOoaM+z-$2sQ}+XL)`{Yh@QPIgJhoJL#I$SeQ-ge?N)$f
zmO`@X+ddp~CZmslbLjGjWx%GYk4#sAK3k>SZg7pao?5nTG_yGXIef7L+yoomQ(x1|
z4zNU<)LZXj(ZVw@>4-kc-o|8qt%>M)x-%f@MR~~V!SN89x(E7UVd$6r*qoh>T5BAv
zY}C^CS?WvK6(BJTg0L@Drr`enu_bP|4Y8hlfb*&~AW2|!&7fJmmu@Ws-7nMgdO8xP
zGMtIJ#BxS6$mMN#DEj1>OG0_jlZvKlM`ywV<Pf3?@^=dA<4MyDYB`n<%}J2s748=M
zTt}fd%XS>Q%JTd@t@OES#%rp+n^-=D15|LG_B#BR7tu3t`|rbZ5@@r`*;PQ;Gz55?
zL~zv%Y<oTru6pE3g`?#=0A;ar8FX!v90YKU1EE*Dtksjq_h-V>c?es=VNMh#EtEZ?
z83>%&JWQcE0Din8o<!a(dwN-wuETTDYK!@<X7JB*d62y*t06w}F91q2AmaUY%J@Z)
z@bW!19=!~RIKLexy0qG$VDhRbaW`Mt@mo=3(ZS3*HTjFCn5NLl+wGA2jAE8UtA7pT
zZ)D3LlV|Smb11tItv+L`z%qEEv$-;92NaMRPPN4enPQoXe`4-DP+b`%Aa=1a7FV9R
zKPT=^MgBtF0Fr3=%$0pncCJ|vf*=&$lJpSW|Hg*T`B5Ux#0EH>vMcC){H^`GNUHl4
ztBv^9ns*r1uO9n(jZA(!TuN|#M}|>5m)1ZtU|n6#r0s=Yo}pqQ9=z=gTF<N<)(x}1
zJ@qX*@v58w)S0tG(gVj5I70MjkI@vQI>R0NUto4(X)6)wKvSn<-gBoPoW|{igyRLI
zG=tYJK?|eSLv4y9TYC#Sy^J(k9AyU@6Z+zfT$VE+OJu~+;u5rQR@g}>Jgn;r;$=5Y
zVYeskK-=k@LfIsDzODZFJsodH8zO5%t1-5e^(r|d?H0$|`9?LMz#h9q09Y9Xw&>ic
zDr8ZdGVlYW>sg9tP~1^>sy6r%c#B(SFK<f!_@XYAz^3U^_HquZrr@S6qrw(P+(DmZ
zLxHUsYXVBZO3lcyWhU-mhu4M(tTU3XaqnUA=e5{eD#32^E%qvddK7G(8I`xVXf10_
za7OL0c)7S<-%AG1XY$TQ{7^-GY@5*9O=M)=GBbDZ1H{Y$(!_P}aj*QL?Anqb20_@B
zD)=b(zt|H0Qt3`}0jGmnK=KfdAvtR`Tpt@NFXg!VdF_>-E!%3LRoH^L^PcAxD*sv5
z-U0Fo8;9I>Y7Lq~9&fC?18iOv-Ov+(--w^NC!{xhmfp#11O6h+C5E58HHn+vf>f2W
zP;Gf|VTiG+!d_vfw;;(6-y-Vp1lpEB{$=U+hy-bVz+2ZGFC$SfI6@jkgp>SYHhn!)
z0W2j}6%ZvQ#6vW4%?07oOo{!pJ+zQg0>O0pz`I!<kI{V<#!L0u?;&9-^OfB~ma#xX
zdNIFKlmJ@L)N!GYzJNXlG3?vYe?r1{5^vXi&v!Ey_X0Gps0=jH;K{ZjFC~KQ+d24H
zS;#YXF}5}9hAY#$`GCu85fkN+#~7l6LD)pQy{CEAIho3bGejp_O1Rzw^c%gX8x%IZ
zF-8ZV^DL(@p}t$;NNN(D-Wa1}P?VqB{sPF{;+!b62z!`ntudfa2Y25FyPKoPRLJ`F
zu+`cs0EVh$Q+>{I>H}N<N7=O=XApwGijvXA*A<lhTL|mq#|L8OXn=D(1<`$cMxU-X
z?!3usRBD%YoE<WZdK4><1<hEX=03D-@R23Mr-w!9Y-<<YmV6(jUF)mZ_n&ECI%O-a
z_RYg)zjiD`$&mG7kUDe&(}Fg(?bQr~f5X`KUs=r?<RnUmJjy|5ko9ih|ICUr)nbcT
z=&rix-x>@ZnQ3X)8-GcW|4}WHReL7B(>H?eYY9dvnNeDux}seTy``6K$8wU7B}3AO
zmEi%sKn9c6BkLS=rqX=M@W}U{YS1nT?J4;AIzZ-<Vbi19MzRpGSy{r0?!-}#Lva}W
zzNEd87HQ4el4#^k=fYr7X9|wR=uo;qTa7_s8*M{Q;HG3a_HZ^@YY^G5vrbCFkYL(V
zY1`Ro4Q<`I-}M_*aS2jjCUILAEo^n(M+^O?t^3Fs0zaIE7L5%^w$<|qHC>O3BuNqY
zVJ);oXMA=Zs}`81o>#%InFUTtQpWZ^1|d6`2*PIy1C}?6<P!sdg<Z4EIq8|~3THxz
z_Dk8d9Z3wru$I8G3H0CCS-Gzh-kWs;43mH`Mvpv%>1@p|-n{9G=r{xz<eh{;%7Z*n
ziYv~YTZWE|-yq$d!7w*I#Sq%hH$#73E|45`&ztsd()%;YAKJlPK%GYi_?Q8T9&Hz&
zr31TgU5tk=uagN<5h&)~!9|459r;%i7N5j{bK5>(wn}km79|M@+uuM+RLijgyAZ+F
zCQWoOi!*PQMHSRh#T#UoZZ@qPuWcUX#9HX1BV9LP@bDrBK5!(m?<+{J9QyM&cS&uI
z!9)nM+t<3<OX!H=&HrxEw~a@0hsCF)qAu#_*3E@}ZdvN*m{i@bbqi(C5w4p<Tgj6S
zsuY8cLb;BPxZGTf2qsx|+l^irm#r~6>Th$|pVWe6nIAK<8r{V)+R=ZTaC@@E<w+V$
zj64*au5U*FXC*$Gwwz<edJ{VLJ@XE3xrVCKt(Oi8Z;^3>Vn<$XE~n^2j(e7JdBh#^
z8Sl^1L6#Vr>B@kx0X7b2A?Zg)1#TgUu|JfZTdu?)2!^-Rf<WE>#tvVf4(d#XWS)ts
z4j26|_p6)y-m3UC|1J9GEv?8Of(GUml85GrEhlzJ;9`q9Gla^VVL<Q7!S_QuRBfr?
zA0F3Gum$OH#rP@omv6GD5j<J;{Em_T{@rI?TSRTKwScN-BW;l*sq4P(PD)%fe7MQa
z&N+W@LbrjaL!}m5i|3<At0FBEcDh2)RySw$vX<fo!+e5&Ii2uM!u5JxJ03^KBbOcs
z*34gGe_nX8-9pZi2Nb_v5Bj}&c8JtcY_|*rlL^!vA-0_ue+>O)+5aa{dvY9SY@RR-
z=04qah}2SmKsGfCeIV4AwR0YJvekSRERX^toB)ABz*+7)*{Kl4c`Ls?0E3{FxDRTu
z+95hiaoz&r77lZPXS_qh++hog7fd=1%kX)PG`q`HXot@$UVZSg*Bp*?%H@09PTr2f
z*_s1{&Xw(b$l>`;JLFQS5FlRe5VgDWAe^MOwZs3EiU5*4)94rhxEKdzMD0*Or5JA+
z=ptbg)n6ZjHS`~4XOsjn2*S`SX;6yyzt|G@3vqYK1)PpkDcHQE0%;-yZ&3zCIhU8$
zX)Om>Nd<L8l>Shvq(Y8kupP{`ufjSa3V+7e)j%2BtTx}Q{JVx6xm)IM_Qoi=_@!i5
zI7&P*mr}Qp0pmonP*y5HB7)?HEFSk6yt0*73;*7ZsQ1~vmh|nWPXsbEC>0(N7WD-_
zLv7Yn{ltvR(v>P=F_V&En#Ak9^^?nKtN?=uaa-L78?SgwT`-z3qykmp1z{ta5O+Ga
z(jju(x||BthamN#IK<3+)SjRxcz#DJH6)0A2Bi!1ke12Znak3Z8WJ6P_>*zYzJGi*
zN$0$Rfg!r{_;;3_Fns{%$(KKk6%q`GIgigd&zQay%0QaS{auCDLiFb09d+}4X@n?|
z=P@lE_H|sydjCt~#zw{FC16x43>VfBD&kW%{rjowyJU4r1+~Hvy~TeKy2~Gfir=mM
zXIBo41dzp}qrK-ljS38fH6tIagIy^fem$3)Sbe3Q`A~L-xe|mR48D?zqvQQA_W1nq
zHYl5HFF=f8fUzz84<05~|K5iWBopZFZjp*Sss+jqi`^G{%C>=I0&@@PM=wx*z|9|;
zq~A+Pd=X4hUbVQDr&Z7+yy=Qpt1L%^5@@BI#zzl~^KBjT{ucY|omiy&piK9f*hi^3
zs3=!kP$W_oDL<$O@oA@D)|thAmDtBeiPQ8zn2nWblHE&*9T`7Rr(te^0*vIs71fbN
z!cSu<ePzM@!;8RuZpDPLS|t3~rY4d<=qQp5S5!?F7xNU}K>L6P3dpdMlQ$)JTsZK6
z7U2o-7S_7lH*QMo73FkvA`~_oRKG(D#mZ`Q#6!i(#uX2qA!&*@$Z9<SqrJ+z<I?6y
zliasbQUc+JrAvLi54P<e?&l}4^2yg|7mIA4L$6kFZSTLt{`z`pHLweOdRUb3F|jth
zy=YBQ@K~V#c!v1@0wcGd&=Rmn(eGGf|1bp(UI9B>Y!f<%B7w1byt>Y<(+0PI|9#h3
zMFC@n5tnzg`A6B=<uDAwF!)Lo^Hc7BvE}1oQc5~4ubUL16ik!aPE~8LL9f8=Gz|XZ
zX*zEn3^Q+olx-mqz)413BS-$BPu#eK$7&-OsHTkmMUMF+6jIYNVpsxJpP@5o;&?xG
z8<;Ri99>gTpk>r4@&mZ+7Mu1X70KkD57wOlllstjF~f8Zv9qjWTK`Y*_dCto^OOPa
zq~Jfb3y5G7X7q-t4~pzPaF)gJ#&EWtfRz!~$P<5rE`hQJ7v(EDn;E?Fv>(GLq;>Sb
zwt3*0l?-6j<+|t)|Lm!9L-e3;mr=q<#f7#lvO#4be*Gu#`#y0VJy^|IIefDNOEAAq
zDH)8sM^DGHZB;7)Eip6bqGxn4a#Of$$yV>sr?zC59&|WTLKr<vddP)36Qb;OIcP*=
z^eXaPADj=CmBgzfr#nUNN(olvnLYzq<SdQ1e7*u4$1<ZTkth1#A9nRU&{HUl&)69Z
z_dFlg&Aa`@{KpY|i%(6Ll&ATO?X+vzhBF&DvMZx2k*E0#ZI;69_6H_L-}CdK><p3^
z3PBiprK%u$|BIE-6^I>~?z+f#tm3aelYiRxhI`Nl;#&(=m$e!vXJ@5w$>C$U0NaDk
z-T)vMCE}H(%^Ub20t~*1I$XG&-CbE40^>s#lF$$eJX6@La_?hA%7>Qi$8xtU`s7`r
zayes=d!0qvCc|tNm3*IDG*r2sG04H}4JM?Z*gz+p!j&pZ!IGKa@Ylz(8@frOD}~VW
zJvc-KfCqP#iPV8ZyHcw{LKkpNm^kWS+exxZs(qh10q)_c9}9Le2k%3>QU?RrBl^um
z(t_D%oX8WE;sZx;^`SP|U=6SpbVygqAiF~nxHRg+cy&S=T|1;JwIta3^aTzaJKyKd
zI#n(s3=Vs-^815^Q<!W%N~x#agcPI~XdSUYZGKX|555&V@1-NUM8K}~q^m0hkay75
zHy-$+O)XXQqI_?5F!$NIl*vcCN#MY~lYw0+tuxq&fcAz1IRf3KZGI8I|CZj}$0BIv
zngDr$Iewm+{-x~PvLpmyAi5?^5ZTzQe{%CzhW3~Zq&YNF0qXHGF`|rK@Dnh(%SN_t
zR2}Vy39Ba>6HYlez#b!Tv2>c=kx!U9{7hIk6UPja7iy!qt^G3NPeLrDFIIYbj@zn3
z@8FJ5d-#CZyQ3!zY%8GC5oVYWd&qC{7%tDy$q}|MwO`iB11&EsW#Y7b4$^RI@eb;!
z#}DD5<jTelex+CXm)gGv{_yxY(J%5AxM&OOao#(k4|{n0kZK&mi-ltO1D}fjUWe-O
zL&Po@KgZ0MhfVPgtf|8f*Cq!RR#=A~yV@OOQ<l$I+!PEyog;l+;vIxgj!&iw%)m7i
zAEOc+y`%LoCHcfA5?>Du;Uw_+OXZh8QYd%pa*X=#bfuj2+v#XXOjtgKKpah`@gi9M
z#E#0tgye(bB`^m`?P*1tvMv03HiY7X`}IYzrQd{lZf2u(JFR{`2*=k=P9DLE^&syZ
zX^N?x4;+^`I>jy+h*?p%qf0Th^TF>aX?#9>Z0<_EBTLB(=f8i-&M3=a5QL&zN(yS&
z|HjIt^D!trr)+=^Vo;Iy?tiutj<ddhLRUKicWU30#g}*ZY9n<85Lu+UQ=PJ>4-EPs
zR`VLAXLn6of)q)%K7h9aw>dm5MdVK1%QHSPcL+FQ;^ig9%I;LYJmTY5f4maM<vEwa
z3r0Iy6tQg4%(SQf>i(Zrs8H<)Q6yXXtPn&2XtcY!n01sQl01FnbBLN30+gaTr7c>Z
z*v_qdKpzNrMLZ#nPuWqSh;8N}3#n!Jf%>|)A}g&HY{qZ-vGV5S&o{9TDs=r6{cC;A
z04_$H2jx}QSX$KAjub^~bExFj=EpbsUqx?CThKtU418v2aPTzB*mSX48WmQPw-4Yp
z{O?|DE{A)(ws3)ZZL@dSz=YxtYrW%K+)=n_9`eBnVS2WWY0A4=gR>J`GFLJr;+)mE
zDf|}u>xa~hy#=ZXj$+6cPL;K`Xn~r?eBcWVW>;-#<p!u7k&9lN|DBCFyu^a=okdcf
zPUzf!odKb^)?CluBl(-Mb4y|v1fl4b61{4&|BaPnKRPH)%LW+77!<gVAAuis+trlg
zK-BT-tuXA`*&@ntT;vfx_8;0IL>McO(o}}wBJaD^rwVPg>Uxww+Ds`sJUKxh9wSg>
z+Z><;Uopd;kwf>?xfR2XSi=W%|JySJ8aaGVnQZL~^MMg&)(nA0-gN7n&3R<4Cm42%
zoXM-FzbBFJvg#KS6llc#63*~vboK=uEKGiYX^j$8k{JSxJi2Ep1za$<$_MTB37knG
z&T|XEBYGz{LNgoaSQ+k&ysFPY725JD)Z6<A-V7Oni@c<d1q623?R0PmgRhvWtW`V?
zmM)`JI84rJfaOz$K%=tw8$e?~1oU{DIQ@?NJ&P>Bo&tNi(~Z7y^$OOV$s-G}$KLT=
zKKBV+Isn;*!5?<q%|k4s+JX@~vTcbrJd>rIoKHcjo$(7m-lO~%`eE7bifrdQI#h`o
zJa;nWA1#=k3z>QPUATAGy`;>rf8?cnS{K-|qv^uYeeZLBqyM}pJEI(lK^TT!X=qJ>
z`(JEr`ZEa`Y5iRZAw)w0_DeZ-1o`l{>95H^UuH3HCj>@}&-J=u*OtT;%w{+SAf(n?
z8}_26<%{X%DsGS*4-md}J^vZ#_dlMHJ<`6b{UWzrmx|}y&rVQH#2zuY<?mxHCjLdS
zz*bbfQ={02nTTHEhCtBg%pI>1qKt<@x-rF8VW8~$P?NzjD<SH5xYkq57@oc?rHZoM
z>STqe<I(#TYmO-*>d{*WjtdHj)x$W=ESqJ=6!lK9!E;rduo^mWT|?J%owWhf8vYpA
z34D>&vt<+ab}VvLKE*b10$)V+@SG9-Pv{k?8PEOgxPE{{Pw!G-v<Z<6i^JD({UC~X
znxv8fsOxU3og+J8F9>+_EOBiY$6_8;P1*^13DI*sdOKW8i!$zNwVhCvAUzD!Q#RqD
zY@}#5537d}l8UE2YQ*@A_s-}X+%f$isd%J<X);xQ_`?@3S(fPs8POx6DAc=7n1_B)
zUEsKW@TKF~llr6V%(5d0K`6Q<Qv&M#Hx{n>X&gGm1~_%FM8r4z7wBH}G)!524|~Bz
zy#EhSwtQlyDn%_GmAS$3f!4C!zB0rii9$R~J)sGLPw~CDm(r9QlB`NRUh4+x$*>d;
zM$nSsCCR46Qvkr|gRV`Hcfr4`WZZ`x2=qK1Cd~Dam`q8H(49i3_wWGz@G!fp!XAU)
zv%a8rJmvluTlY4#njY|UErUdrpvUury;Z@ysM>B_A{n}tSY(Fy#h^|{!p=E1-h}>=
zl86oP7H1-swa9U#lVO92MQlJ}mTjP!c>Fok)RxM&F4le?7nrN}f%_06!v&KCwxh_U
zb0NUdr5+BN3>!>r;ZY9yD1<V-a-Sv*DK{sv<&0#~1*HrXL2a*M-xD6q)V+^DA=fXG
z-L`F+A+bq|2m!pC(3F@DLVH3o6gFuK^1M&WSn-AxU4!k~n_-zr#OzqrF}#7|$VI&A
zRqXphM#zqTIE+|M#tQGGzY2a`$rfdrv57$UVhWxfF4Z3dxnIi8Ey-dK1fp9q-j0&}
zZ)`aCkKjyAZ@{t=6oh{K<Ez}iR}As7c3J)LR%TrdIHiG2cHgCwAz%Jm@gO9<G*;f#
z(Pfk6u<cY0xGo%0v3H4#kLZ8SNd#4j2Q$eVv7F~X=8;2HQ`FI;P#wk;VXTfNv}~YM
zKsp1J#4H7;=H6>|nvfh4oZ{tMK<gs%@MR@+&}2KV{l~@&F$?g|CdJHqWS!Pw=3(`8
ziWm=S4j8ON)_?oczqgZKDoTgQ%Y}uM_uji}0LWqQDPD;&(+Y%O&AhJGAp{*FoC;KD
zf<McmOiTxRliVSysls%gyrL<{Za{$TFFHgrRpTvYf;aIFDXTB++)l-I3#x187L=m%
zk+8dUfgGZj3Pxw(qKmCHD)rZacP)#Hr7FWSI4$`sz}`@Z3-#5V%dhJ2e6@>_T7qmc
z4{ncg2w5ubTUm*H+fTgD;~CeX7wizSRP46~gA#lqt_8oT$F_6apNgGBmTfX<;}N_L
z2hu7gpI4Gx`}(2m+>$5;K^VFvMdM@t8@rzVq25l}K!%}KC{4mZ+s#qA*nlb`^{N|5
zCqtxR`?95Zl$<N_OWbp#JL3RqxH*r01|7Jgls57l_M-IdS?rDeg#9;cCC3QBXtkmj
zC}K;|Jg_YixB2qU@O@N7xtFP&A__I7-LVdr9Ai?heu=t-GUESyjMZFbOn%s}n{>%{
zjRdaUNDXJhjDR$^GjK(q+rA8R;`C*#WNdkU0)NShE0n9*Da}@{)o$Be715~4v2;ue
z+GMaWU@O`e=$Ejk$3`>p{8U*t)^WeyvH#T_<!w);EJ35e)8=+h1qy?*_mQl4@-}q{
zi~W-ANN+5^cZ+G1JvOH6kgOJ^9pEDpw`*S;M21z38TKQK9$&Cu@?HHxE4GVstE@hy
z^~=MYk-+^TuBYf2-@QGJTgGQ7<GUgY@0P*f5;x3qBA|#+O`fmAT-D&v@quk8+guT$
zn!FiL!IL}ldX|)C`G)<H7GE(9s>gFyM)DfcA7xjTWHAT=ucS!3-2Y-jJ0Guzm<ku@
zvWN*1dwBuBZWhnmvChMsduGDe`KlkIHZmGGI6IzNwrd@UOtq{pxG#$qPxGKZZ&_1n
z#Q~gYmo9#bn}cT(nxOQ#z5w5!q08PPosR506;wUa7?G0f!Dnyn(3)+`#wq(eWFjNk
zgHPTPY5Ru;{c(Cb3zBKVo~ScNXM3j&#|RYv$Y|amu1(4qw1{DPk_Kr6A@s{*d?Zxb
zYFQQ?6i6P>nNH@scle)=gb99D%kQ7+4>{9oocB(lB0~yqW@kk}^9Zr;yYCUUWn)6O
zD(kiZ&<H)#Y<$=j*FAYArtm*dMk1xwgD386qX}Mx_fFm3w}roy#l@@7W;5SExE{A3
z$Or+^d>8?_0Ss2Kf&^+TWTb#-?&L~&4Qa_X_SGPa04c#9JYz>EV{jJpQC2_ek!dlW
zt)ui=7HzQCy|nrT`MyCsUx)7XVk3@yNlFWHL1XZ1LG%$wK#F-`m??PqcCP$W7yF~^
zN^&HILEx9XP+tE3v7tQb1BOIF>Pugc<v2J%Ex*_nu!DaeUG`r~n_nWoEW2N{49!vN
zIH<{JZjOo!g%K97qu;!u1w6DU+sxbhOYE12Y2gBV-8o@nTd;Upk~sMDu8fNbbDFxn
z45Eqs2X}^l2@BfMg;5|?cu?93(o{og;dUU|>SU>^drtIK6g_hfiy4QIh)_=faRwUx
zgl8^Gn1RToI9Op5c2);h2?IZ$6N}fO|2ZXK_8AI9tIk}+R(6N@1JJLRs`DbjX0O!3
zyJh-oxkrQ-al|bs5;DwDT!vcfxKWl#*Ira_1&R!J6qlpc8b|a}j#5GMDjZ?(=M#P*
zdGx<bx&u*cw0TSkGTc;H{T=%2Y<&Us+T1gEo*DKiuq;_ui!#mYoAR;!Tj-ZPv6dl=
z4B*XTQmWtW%*A8<v`CxckJ-DIpsSIgU&6w7z{YN)Iya)}0x~2?T+%yoxZ;C@vre;a
z_tIxrlCTJ#Lh%F5-Yfvu^sV$1NfP54i~Lb`uDKF}AQaw`wMFdyH+K1&N$#Mene%%R
zVy23K=h1LPcAfwxFI{_dCC6s%9V~jI*?DB}=09=bHT28EN4B|UwibUmDp2SPZ`ZLx
zleDC~gA6FV<tV@(R{FIe;7nmNT88j+H$+UM3}^baOZA#UXtXT86QA-^-qWg8v6WQi
z+3L>lUW4pDxbpTbuFww6Q-cY3AhIC+10obfY$c_5Uo=&sgW`!lekrbFg?MP$TkCpE
zGI$~O``!a9`D6j`&``F9askMgV$n)E@nq%`oBJ4`@nJglVv8sTJ|lWCn529iOkb~~
zh^?H-jOd9B)$Tqf8hzs|<~@>cmt{mxT#~bS2e#q$nUn?`o)0B$$&4==Ta8zMedS6r
znOPC*q-H)bkZZ?T9ZG4wF&DYI*w!PCJz|L%Wo$WCAx+vM!1JMfJu|jK4&5Z$q|L=+
z-Ei89%8j&i6{bF>@FwjW-1AGImv!bFG7<_SS1|7J33n+rQ&^Jrt-JF}AeQ+@*|{A-
z41!R!C47LU|HhV+Kat%X8elR;0r5V*L^|qWNA?AJ9w4llq@xNcQV;ZwH>ZH49yE<E
zFWfZlkKKEsca$gV2AX78LJZ1-e_fGaq$PbnV}ahppU1NBmAVqFv`~LW!VHx1p4lU?
zmL?ei#UsP7V}^`R_X}|P@s-*YU_7sY!1ir|dW9w9^9o&5gWe9aR?Gq*H1?e|+FE*M
z4uU&=f8?JE=D00;;H$7vHR$cgtA4N`7z0;M%43C&ssYR6tG)3|S=6$b9@0vgd3IEs
zZX0DV)S*Ya)l{^?^wcL9sGE0{4ewn)Q{$dDmYAL<5{-8J{2MUww(tVHs#t}QX+d}g
z9S(hQJ)XYDJ(#vu`t;M5z#dOxvoo^K49&E{^)v|;a=)_8HgF7s0(<S33gOe_aE4uL
za^3cRp5uDYcq@EQ6Fr=(QP36dV&{HmNmppCgtk*PV`FrT>Euc_xK#q5h#pk;(Y0T#
zXT3;;>}dz0$G=ptc=9~!Yn?5}zm)Q!>|CxO20<uV6ABpnZ)~{P5y_m;0E<Kr;eAr*
zWD~M*#1QP$=gpG-68g2$dIt0$=Qw3W$AZ-N5xG&RJo{>a=0Wqsn2t)3GaZ_zOS(4|
zs{lq`3umzPCGvZ!OWukgNX`;|$JxG$^4j5edKTWnC{nOk9g#Is48A(#OwZCgtSZz8
zCiTUzu0ziBWU4jsbc+jqVx_)|2BpKEbV=EW0>?H0(zh|y8M;$JB;)HQkJGrv$Bf{`
z2eH->N$EHcF^h`IepOH6zjgSBo)A2SD2GPoU_CNUg9B^v4?Q7xOa<oz-oR0!PQ~*&
z_G=YMARc<y_>bWJ<DASQcBif;91k=cVzS|8Fu%Tp{_{!F?Z_?)m3D@hqZqk%sEwYW
zJcbm98gCLv5ycnjRMw}J7Jw<cJMX>bY0qaJilC1N6n%PJW4BqU0((6QV232=3C<He
zF$^W-A<%6u`tA-%(8qpkSyptHFk{#+9L1!=wDW}LiHLsf1tCJQ`#Q>YhaTq%(4*_-
z)aty{ew3X7Zp0uA1iy3vv%vp9Rwk9MGA3300qb-L*pS^>?isH)rJomN^(0roV+QYh
zJ=25cA!EFg%hIX^s1z-7LLZ3RYsPt}YMwRS2eYbvNrtg>W-Hm0Jf*BLhu$#90l?ET
z203{x&+6-~a_++l77J$<yHoOf0LqPvgsbrf2>KSzSj<%2TGToOlf-FYgGP;qv5dn^
zo07*0ciXE^8V1<-5Hlt-ZBm|s=pX(mDS+3z+RqKaOL?qdl35e+2dBm1`Z;4_lb7;T
zBzx<OaCf*~-&FqRXKx=STj|L01wj3Z+{Kph$Z1Q^QWvl!gb3>GpeD<h<g_Jd^+FuO
z#9TW2AxWa8TynCFtXyHGsgct~*h6S$8JC>AnrEHVH7+1^Mml?_oY|+$9VI7Wzle+n
zH&ur>JhM-kPn<+)BapkA2N?9R^z&QjlsqJaGi2U~;sda`W!!gau1x~>Ww`8pT2uz6
ztaoaDa=pKdqjqiU?+zoNGR8YO5YM$50h&F-A{=z$3I?_x%FgYEp%8|lD{*-k*nhFc
z`6G!cc>#oIflFfh{2e%uKqy1FEM$<{SWH?uUPBg-J;^?&@Xe0Y2Y}*VLy+(Auh)6C
zZ_*}Lz80XE%<$@WSii8Nk7eCkP$Zz3%n)OEY{WCW-IbH#{9@k9DH39MY(!g^&FtCL
ziQ7(tD+ftP;n@xwu`fNER!{C5Lh(J}WoUh8&3#zw;zgMkT-ohG#KSf%+vCfAP{wnn
zTLFr92zWWLL{T|v@|K-iDBd9;=w3bLgBe+O7tAFn4jjBOJd?O{2g<XoHi~&Gdou*_
zP~AzLJC&o^TMET@f>**b7&k~yqK7u+w*nOB2@rBzM_=|y;!M86dI!aNf`HGm>3Y}N
z9)qJW*h4Xh;KgSxC*FWun%g#t^;Wj!8^kl|&cBQUr2?)M^Hw(I8^kl)bg2}WsPVO8
zy%nDYcF?1fx7ZKA;MoRA6IZMjc-dKNP$_mgPg>hM`Nr&0$vD8XI#GG{6!{Lr4pKR$
z9z3nekFs;IVHgI1=t>E3u)Y6c<+W1P3r-alKoxS&;N0h1T>hCnjWQp{?Bmu}U8$f|
zSI#RIAh^KoJqG1`3M*O;m;5Ynk<AhzZ{MHP{nHN-H}e?SvD6?iKJ(MOqP1|b=Gg{n
znNO%w^rS6XT|q%L=Yd@k0|XA-SZhA3eSZMeod<)!7;B-ept4G(D*&tX9p1O!Tp2PO
zA-|^D6@b+UtrH&Bh#`?Ev;{3>S^NH&s5_6v%E!mxMnr+F`dvY9HRpjANt&t!5blX|
z?Ip>AkA9(~#sGoHw*Ne${V#prk)ii+YdE6>KutSV5Lmf$E)1U$yES(tbJeyjkfij5
zQaySm@dW*y8@KUBn!8fD(8Qz1pqa1_6M54UZda5LE-6|@N)(?&V*U0-_Lo<b3a+#s
zYj&Raar^YPT6HQ?1)rCD5(ie^1~8?_R^MJx6u5GF;yO431aXLpLzsVc1zeTT6RR2C
z@(8vL92xCN?fbu^@_Awo#N(2%wb(|oAj~Uj1y?o?D*Xe0)EOJYi?VY|k{AS`=$4ET
z3H#sJaC$yw1Ugl0fU=AT#QR9(r!w+O)<k*NjR33nDz+&NDJMHb2n|pk6C7x$z{@1T
zgm#CjpaI8Y)Ntkz=Ix!~A7${byP~Iu7QQqS&=d*``6lTw6?6m{$weo=JUAyXU#~4s
zCq3nPP;JLm2Nz1Yc5w!+vv3Jpg3{qfl55RO11)2}?Dr0YFy72?sChWzIW;>R3ms>%
z!~sLl6!LEE&NR8*;aKQ_=J9BLu+1AxaP+C8>JTh+obInYf7)Y4`pja@o!1LJu{`*!
znSZZ2@oy~ly3=>-q0Zy^xE|j8Zk&AcsvBiNuV8Bj$XR%_MnNwpPKOqv0nCFh{XM8;
z{}7{pk);zk6iWFx!1_RGm6UE7`{g@^fzsPQzqlVk+$!s#*TKJk$kVcC`04O=$D3Li
z#ow<Ep+!$T4?a{t=y7TAa+K4iQx>iuw`|a|)h9C)fQvtC9Y%|uqC7)*h4+RED&;Kv
z4t9%mqBH)4RUe0;Q3~o=d5HR@hWt==wOI^<AnZ!jRa5VOu_f$Rirp(0;BCwyU_M@c
z^zKd}k_Vl7_G2TM5?*12zz{v`(xNe5Bb;z@Mn+{}0)zC3p~<0?e|ioLQcg&PszM1t
zf2M@Y5+wwN;1T##V(Prlc`!CR(F!31ro|(R(WTpPg@3^2`&Y`T<9C`wDA)+I%i#dI
zSuIxB5OCWp?Q^u(5oF+!s!|SKsi^LorFX-t2l<QB(-@nqluD{QXEmNTY5m|lM}B;t
z6(R)OH%opK(x7GO_=FJ1o7jIowl7@88T`?ug>=m&wL*h{EAmL_N5tBwPspIXSs_8d
z1$l<%ynuMMrOj))dMgwN+>Ep?W+Fy0*<u_cznE1R5O5zYp27k444=Sitj!Uxa1`K1
zT89|Ba$*(`Sc0<sP4GWw<#t7aQ?SHh4!u*hm(d@qp+kC@W_i1}7;|`;<)l~2p+kDu
zx_1um>?TA%$;{wcAwa+pJ&dZ6QtFSwzGmF(tWY3u-u)&INk)XgL!#AhBR~I|U&_wy
z2x1U~qAjUG(f%7-j{8L<nb3e^j3VHD+#o%`y%ufxQZ_vL+vtyf^M>iEJgzpYC<X3W
zP={pL8!FGn1mQq0)AR;f8$za5)6mHX_C+Rai+}s*7~<Hv_G_M<zmbaB;(>Ka>VOB;
z`g{HzgJ)v4gYRH8w53e#B2y{r%gE2ucIcgAv19A2+jY}nt&LBEKmJIM-?7>epLnX8
z>pFD}M}{1u4#3l<)ptThKfo;qK`(RDH~>$>gKsTVc(5V-HuTGiIAH->4yhC~%eF`f
zfJYg6jCMz6UWgVTO+<DrC$w{9I4tT>JQYEqW?3YsvIm{*42MN;Zd$lNDh4lhC}$1Q
z22FKGJdCFyY>hQKG9uBVdxj*V9>vrDqRUp8v)-qs{m8In)Pr~+O&9u5wqGpYI~$@I
znv6On9!dp7WRZzRbv{^=OoSbtG>MK4IN)vXb{w7zB}5Mdk1dFOHwQ<eS!cqD*WsDK
zYdU`JmhsenrVAP3hI$zuwM<*)w9IevFn+tzf0UhDuEZb+hPPzLBC`LD4WDz86O?I&
z$G(t;R#Esb9=pQZ&>+L(x4w0T7eR~q3|v|80l&lCdWxUsJ=t?6H;@WtLq}|~3NsEM
z4F879k8!^*^=P2Q^K~tin2azvN|sI<)OY+Wc0;U33}7Crv7^E=(ICC^LIu=htwtU5
zm%!iCp&OnKr%*%Aa82@0jiynduxQZUK@DEftrlMLN(N08o{8$lnDi5re@H~iO%fbn
zg=nG?w$ms6x}GYbduG4Ie)vl^KW5OV6GMgRKVh<LD%;;~sRgvwWMSU^yhOI(mHjUY
z@HEO#SGp~B-C2XULT1q@z|)qWrPp;+QgeC}j0&MeqXG|(>i~{m3WAP40p}qY-an{S
za9FxY@L)BAXrOtaOp0)YEu&F@rvVRSh5+M4>|}wZ!5>~c!UeoW%H0v#^ShKK!7Ceh
zgz$9QjIZfe9-36iVX#7%(TL#b5Kiuoqr#oF151P%jSwDsyA6SgWipdY6Rejq9--(c
z?KNQZ6a3Vflzgv!Q+8#!7K0#kOOAm1-`L}Le;z}dlJuK2s3>}dhtO6^5(V+{c!d&0
z(=_x;PX2G2P{dl}=RQPPk5*y%uoLMSXj{3%oNn#l07DfP4m*XOTd#(0ZCX<MiJA^n
zA>#0HcIkKzI(U1ZBXMh>3KNGNjAy_W18-S8qg(`4$TDm}JQF$=@U6t{L665{u5en|
z3-g?TBcYZsJ*~93YjTCx!cLe6HbbHX=>P_o*uiqi^@)#JmV-KQhT6I9s4mVG$_yW|
z))?sIm$sLn_q7<hQUs47H8)6SFyI-~#z{u9QUj$~Tpc*ktkYW;C9rk;DR_SjZjB1A
zo8uv!D|%LG$)6XBpjZ%3pSsqUe!zhVB?;e^*wd5xaNW3YAf)*v@=Lz0Nx=dLn0{Cl
z$p&+m^6hw(*Jx*HTirHju`5KUN>ZHgGQ0+5L*kI(%qCxgzvRWeiqKWrBmmJzvgWz+
z<Mt{RJ0&f`J1!h<<4loCY;zTRft|Ql2U$rX;46*&oRi-ED7&^KhCvW`r36&){uk@6
zAMKzt6An;@At?~uN3>?*J&2MT<~BxB@WOcTD9nTRno5kbQ9|&iFZT^yp;mds@*rcS
zcg^I{`ba4DY4C@lY<hN1P@qyPh9<g6^t+P!ej`FwCE6igb5nm4`XTWil@*C=S__+z
z*mmYEmAs>^4;~|(9E=pd*5Ac`NZdBx)rKt*UnMtUAEUlPIP-|-X>BY6MwFuuO?r5R
zapn=uLl6?xEifXeivBM4|B^&B4}OggEG*hwXU9x}SB8(op~)f>HZG18<1BZjg9kJZ
zQF|;2Z-yzxnq*yRvJw~B&Wjfks3&bL&W*4_W^-wqg#%gT!<J1+_L@}sp!7J8_2StN
zrX|08&UsuSv$<?`v9k{>Cp`ZaKaXgvLS}P`|4K|7nt_rSkg*4?LJ9K?;&Uw}xP_7C
zKHHP%m1ZToz9cmR>3P{PPW?OpvXaY>N8hbmRoTK-jL@|t^-9CqoVV_!|AWm48(i`@
zON+Qh`qt>Yg#J)=CN>g-FcfWx2}ex-jqQJtRwIKm!VOr27;NAlAcH&iKcA!EuZifD
zdI~mBTq~=y>OqocIBn*YdM0`gnvL?9)&;{(ZL?0Q=Q0eH)T40MX6-2Q`-BY7OvGnr
zAh!9{+xte&?A}hPNBzUiTSilF)@rnFQfG(i<?K*#XDXEA(TOKR!?P9GqZ~msp*%b6
z-fCu;a<<xTsUDO879BiMFzyUs!4})CqDi8^M`bJsovAt-tjEUSRu-ZAqsZ^sx59cb
zvM50HRgKHeLAf(*Hd|0VfKEPB)e^8Y2CLilnxV8=^Ia^*scXQ`Vg2k0p5e4v^IhyL
z`f!7G(XYUgJB<A!Q5-BC93M{u122&l#Lg5nhxOsD6xSiO$FuE;Qd70eA$>IH3KCuI
zw*eGB8uWV-dZ>>|Jcha*+s-R66}~epKkMEnR!g$t+BtC+-j`*D=4TG+(_7~uK&RJ=
zBS#QAvv+szAA-N0R*g~{=BAy5e*cpW>7$ldNBHMZ*=y94{Kx*I?AneX20>s;iYTQ2
z#*X#AQ0^w%fN|6y!aiQ^WG?$aIZz;H5>EzjQSO;DH^V&5)d5q2AW$T+v#9klJU^c&
z7B->@S}+YX>S|q>0DdU;=-8z;jp*CpKQZ16{%1p<Q*CV{?9Jjkj~9#1#PIC91+CL1
z_=NkKMe&{?%y~llKvf&j71B3QdAX8UhA-zC>;p^TINYNvdTNE*q%oX1Kkz;gH6nZ1
zovGG~7bZhL^Q_nt+0O!AL~u&_GmF8Qh?N09YCF-4967eKV9^-EK=bUoHQ<d5uu@E1
zh8FXtVpbOIQGtXJEP%Cjov()e8M2liX#}KcL?abyg*$>V1T<gS(%H8RV&4Ytt6FcW
zPMvMHrY+w+J2+^I+<!eoZ}TkL)4uH9xG&=$@?KoY486?{_>X{wJ3!};oBbY{308Jg
zWCy&UkhMY4xJdAos-a}>tqxu(YF0o#-qlBj+~&!73m4C`Hp?1k`I<CCKXY5zpc`#3
zG#a}+g~?et_V)ySC_9^E31JWjUum5D!Tm4x`tvQOh-k^eZ5O36K+@f$;4x>eb$S~s
z<bMy6OY>0Cq}fLNal?(glhwH*zAnL0DrYz5k8%%|Q46OAtbr2v$|k;1e~!l7$By97
zUqatUZu<xzSlak>VdOYpVc)LsZS)p3zUntu_|1}I*@{@tBJZceQ=H80#bM%#T**9<
z^`l~$3E)FJp?cw@5HAV!EYg0^NGU~d%JJ!QX6TjtV4DRcGa#M#F-}=YqgfHunXMiD
z+f`p+fcnj>1yl5gH)C-`8Ju`KJ1)F(lh`XcB0BhdTrY-E4C5RHlI-La#hz{SAG~Zw
z`?f<RMY~wPtcqUGf`Jd)lr~8fZhGr}90_?YMZf<+J(jf#?hm7=CN#0-mn>9~1DdyZ
z?hEIa212!5e}#O%Ry?LotsQlndbnjvx`>Ke&wRhl<RnsmrnSrtI>mknJRSt`MX@b4
z<hrlIe)yL0+GIh#m^d?!-*xT}x{`i8mb61{53_p_X=JBY^G*KwqwGp<AP8YtFIxc+
zj=2BEHs-S;WJi<N{33*goOb*(e!fi02@5yY2!+gR3FbW+1|z&E7pYBPR*sGOyVKef
zixI^=Pp;dCRmqL3sx-)&Geko;AP}WegzI?;)Vr@`W-On<lk(`@N^nw*SJ3&$aQJZI
zfV$=Ws|^cooPPH=mLINr_&kW(XI(8Dl6v2WW==gF&QiFNcMl-61i8x8)WKcoB%*5+
zu1SIgp`c@v;qjrU$951FUI@61^pRGEY=;78eD6T!E-YEs&c2lrqe6ABbG6pSVCT>Z
z=1bIWWr%#J=hI~4gR+)vrbg`Am0|Lso^f+$o)+=P28Yi#rXMcl2%F|o*lV&%$f8gU
z=nt{=`q#Rfp@{T`&0w7z9Rxp%WbS3S6j2Fu7h<oPzB2uA^0OhN=4N-L!Y16UU9mD8
zM4Uh%`&aht-il@_-~|6l#)~^BP_t88;YJ=dHIy%}mEj=5L4jni#DaZ@JP2%O{P>~O
zHQ8jg2m~!EH9B_2*|z%mQg&@g4ul}^O2z@P?|-qS{h1(StGED38SS9-<7;HF&h6ft
zPRFg4ojI(dK}7WR*(yr^B+gQH_K2{K1QEg3hh#CDpg5HK;V*j5jtCJUsOv<@=p)Ls
zxKXeeIwC~OODt`ZV5q)LP(3bpBz?G&x+d+-H~&kO57@;Q@0`gismps!>P(a$vXXmb
zS^77|-ZUUko#_igzW*|0c6dkChZzI(I9mUlbf=RllS+3Ee4qd+CFI^GA1Y*#j8>NZ
zy(obKL>>0S;S4Qvo}!cONcs>cKz?!MrJM7O_2w?Ug*!+R=s$$*k9Q6*?<D9ppVztr
zC4v7#*ArWZW6hCgUXPBJ4}tz86sm#4&Pkh#+zhsqd<X;}9Tb^R59b%3ugH<Nb_b>c
z1&C?b>RazTpK3OOFH8Tk`*t)KT@w^G8y$Fx{=1{&!^HstgtZ+^jJ(H$B^@0fWZaL|
z!<4{1IMOWkNe2Tj4$$#W+w|m`d*z?9gHaO529W1$5Mk0{w&$>pWDOF?21eLs!m-02
z-uII~%FgY`VHkv>E!mR5(0^mg@s9_iWJ3c?h6oJOeLSH%ePq3;Ur6c=Zcm+C_8Pm>
zO0rc~jNF)1$6sk~UQ4pmNU}}Wgi5g-q8-mN^%LAOc=Bx1rN}N0#U4bERC*Vsb=Yve
zUNwouFH%f#zBgut)*-`rmimE>AkhJ@TZ;86kvr9%;XmN*Ee?sYLCtCkWF5kqXQ7|i
zft^=7fm2okcPc&0{9Guh4*}vPrkhN6N<D#pfZYOE(mC$ovZlII>IwV9`int2MniJc
zH+pOFraY<q0H?&2G}>Q`X~&PTKYk-62~^@`xe!diA9roC-Dy$Ds0#?xfkw70Zl}vY
zvJL$uB`*oQ8Ea}xf2d47z>Oz%r~AD?KgWVYF>s0-H~qCn?{vU~`a$n9W*&837|%^o
zI-D%epr2SE=fo&IPIfV?unuF&6XfSyasrc$Q;8z<<~MgbR08~r$b?=xG<H;#`iO2F
z;*lqPAF?a>=)~yiGJgsD`S2yM&%iTJl$jF8zuHF5f9`hvC_8r~iD3|kUTG}J7To`0
z%TtD6gU%*WP1zU_^yfM|SI7xuGx9jPj?ISK6uOju8Mkg`Q6J-q5MkIoY$dZMtj~it
zA^Iwiqnj<1DU2phP#=`O$63r1C-q<@KP8yYgP<I~8b@fqGz$us$&<bhm4!+JjeB;h
zXH&RLzO&ZWH#X4k2#_@z>mpO=MxOP3z9R{7*qE$vY6B&CXL-i>M3&fbaYo^Xxqpp5
zh0Ej_<+G`Z*o31^;`OH2p8fw9nFW48udexm7>-}%T`D9g-<Pi})F`&)(X4ifRberC
z2KhWcvbEb0dus%oP2w?mw&psR(sv&Z>>^-g3em`uF&A?Op7Xnq67FI|nsg;&F3RFW
z8EYXETmQ6@`;sXak_|h0F#Kw<6st!oxzF;T6?$Rxe87<3w|R+5_PZ2)j&=(MJ;)$8
zorprK@ynA7A9_5}e?IC!(G=o~U$~xmY^N4hH$+M;z6$TfFIdlkHOGbeV<I}LpsOjw
z7q<&_H{b$2<C}k!UCE8WFbHgkIL3kg8(Sv%EXPVa4WKCEvOR~qf+{^Y(@CtzZC#Lq
zeqK=Qx`&mOA$oWQ_1sWBcoYeU>$;xc4AaB2s1IcK6$-`CO=JKg8AJ8(tmzZA9>4tP
zce~Su8N-+Gtmq?(>+ExF!5f+Prvzj85?-9SqWSFy<QK<v#_+qD!Ys~Qk(97mi=$Ii
zy$-RN(#)DZ3K94iV*rpH8H$JDGkCV<+ABH~c9NJmXSgOdhS1>InhP(W7sNW_{G<b>
z#~40?XK${T;DA9E`4?;E|6>0&(14gKmH`5b13j^Md&f^2L6%sO&AH$_yd8*Ai@)8{
zn_x;Tk>UarhsYS1H`d_Y^{|X!N-W7>9)WSHqK&^?{}%Z$k#~_&(SxZ5dzv)}G#SAO
zh~NbY3uN$z(bx?tU<4uHGfn*catHx&bZ$76Y5!<vLKh&9VLdU}=p3-Ohx~IYxeJm9
zsM^@oAY(e&n;1hlfHY#NONi6~W_zpcL0G{E$^k5lvz(!<I4!`X@WDfNkNrd06(v~=
zg0L$U6{`2Y*e3oVzMbX*P6urOO~RvmxE;?RY%TZDaTFsZ;)0%m%}kz~@*>B-Bsh3+
zB$<ks0W0@>U4oDVJ4@%l({jEADFc=sd3F&w`}iMm&gZ4c@g{}(oC<{O*~y<k+PSQ)
zplc%VbkdjUq|&H#^>0i66YZpd#t!mQl-&1WQR`z@pxb7SHgIImu=G`)g{CXGZK<E+
zncnsd96<bB;^E3RCh`vb+ffcr>cqxHcrjf`3W>a9^ru?%Y#Dr4xGb%tglyvz-u+>u
z$-D*%mR#maQb_Ebj;4t|ZuI@7Q-1wyB`F*(J|kB5J-m%QL*2<xaJ3!Acgt++s(DB7
zT#D{c(61erJQT~4%gD>dFAM+vAG3##H8$DCvIl3d21EhBle#l_7ucz@9F(<IXbq{n
zOxzuO_&aG*HE;~uW%}?830$**&!W^9d&%5DZD&D~P|!88cMMg7p^)M`pIhldLcza&
zq(~ZOZ!tuBFI)K)0RJdEw;PK=7>KsS!(iyYvGqy548E(l0Tdw^n=qVtM(zh}wFtoy
zl}8IvdpR>Q<s-UCH>h}3WZH7sH~(|Zj8GjJT^qKG?HV%vAS&Dwo>8hJqstl+NOw4+
zVR8r4lF=%k(FHK6Y&(p+(ct&kn$aq6;d!EJE93)tXs(~e{%7y(;}Ea#)dwql23G)@
z(ZP%3gMp$F5;=NM)3jzj{N(rmi?y1=g|I}kk`cp$<YV7Du)sF4bskhT%?OG|`M|)L
z#Tssb$KQep&uEJG@nDgpFYX*K%MC(ano$++<AGc_VBd*pb>OyHnh_Q6<e~D&(+Ao)
zDtI@uG@~ir$kQ+lK<%=H-bBBQ{JW?*j8Efs9O#qq_v`xgpc$$16dyQ!gIRu4AoR=7
zzdzd9cra+Zya3`dqy4@zd(u;UtRTQ1s$&*%8t!eA5m;yB0h&^*3oN7?NA0nu4)DW+
zLPT&MDZS>to>r}uk!~N?)jD9UN#_I2=N74zQP*)isDw$^|0p|yBnv_ihF+=r(<<Em
zV#Dh{8<eS<T!4jzF+dC#uW(-VCbj~An}^RbnA-BV;w$Glf-4BP@9UyE9?xrj6<rbU
z3IvXARLO@;hUT{+racnH6$q?io{a4lN!PO8Nxs~i_)zX;(ehBm!!gI}_kDngE8tp}
zb$zYC4C|51^W#Zy1zM|nPpruTOQ&%>qe~J60;_pXUYCX4G;At)Tb!{KEUD%_#=s&X
z&xz09NA`ts-{;sin}D|-98EL>#kiylsjuW<X$t#$(B(JtmQcW?s(A)qw3fXShV#yZ
zf+SVTlhhJjvC)CJKmQB;H*VK`T|71PG;Tza)|`ieQEPi8ANJ7k!})I3LwZO}wN25J
zq#=ui*KN@|En_I~w>IYi>?g5f7+L&z!yQ7wzbffLz=*H>LwEO-Nrr+^n`h6$26e7U
z8+|qeFcg%kdY%MoJdcxVJ7&DI$w39Cs&S8HA^9<uetqcwH^;5O)T+&%tZYz&@g<}Y
z9sWlCq3jBhAO=C$m#S5S|9@<gp0<D;IqWrKT|_`gPEAn#5ZHJ~co9zZprU72#RWRb
z9*Vi)8bg5D@C7SCSDcjN>$w}XPgx!i#Ho=eB?aGm6ZOQfYp`*Gk1g#^z$;$RX>}pY
zVfPd=`6i4B#|ilU-&D^Id-JF4%+Ma2x^wjXzPQ)QM>mr*_Bte)4za7^XLY`+-izmQ
zc4ovQZc4=w>i@y)R9405w5K6m0&v9%y1pKE>A|!)VapO&NV4s!_(9j#BM4tPk~9!I
z^wAUWiX(J=Jrk)PX_olNCCG{U3HaU!9a|5XfcTU!MXViSZ%xptb&(^1>S}OR!_wnZ
zapA7B2Nw=j$GLin$F&pakA=HZtm51tVFf&e4w7xD+z;kB2gnphrXKRS!gRvzW3A%H
zon#l|Sa!jhQtMab4E@7g#4nz;(nT73O2LN$N)Er@`1NLxnTRDATrG-DizTbCTtwy{
zOW-7DA25!Ge=(lZR(j<z&kaKT5vH&<B`KWR-;l(QvNKAKAOxY{l~$Bd?tih+?oSXm
zSuQ|XjyR}~e*ccWMgJ~}Hx#DIQ;%ihsuj8<q(z}m2Xi^KBi-`NAXVg6=r?#@G5%Ir
zP!9CX$lnbODYjN(NBgdc0o$|hd;8^e$_gC^+z7^3Ohdi_A=-Ce{Vw*$mC~Zv2QdqM
zq1*7Xugk}rm4P2}AK1-^Sm~yjdEBcKI%?HBW-?Ik{1=+EeOBmb@W_FwMd|u%z%p+|
z`D)1u9St7a4qGF^UY_%bzVb2I3QY$fxuUBudIA6eG$yARkxITtk<Xa$SMUYfV!6CT
zq>}FkuV-zJ_25p~SK+ceC6$DazFn<DUZR}!jF(G2E|r9D2k1_{qMZ$3oQ!;TYEnt~
z!?vsIKquTDxKVmpf|Z<%upWpEs6^h@EJH67UdhTx>p|4FCNg2(buSN%CY8i&5km=n
z#{ZerKuDp!3;uZ@Y<9q%gj1nTz`U2{2J4l)mjkEu;8gr@27+t-x<s#Jesu5hfTIgk
zEi}Wo<JI3%{vXP&<OpIAhP4#HT>Uq;68nj5!r%rp9uj<jkSw^~pp=TNop!D~B-`Y}
zh}i_qv`pxHBS6h7gzcCvGh#LYY|*l%7?@=RP5#fbi9C|GvN;mU%f=Ahx=8Kg4*akz
zrnRkfb!DaCTi5QNkj)ZFi&np<<o>X$<<0W;XN=@U!vaE{q$x6z3)!aQ2KulprmN*Z
zUPnXA|FY*iV}JfF<*|xMO|b0!?<MK5BkBB20J;G>1ZfQ02PSZ#<6@gMR`*{nQW*^C
zhr|wSlS#WVK8egX;NRa)Y4)^4J<hcFVLf|gu~{NjM``x7|AieUO^o1Uw^c?c?54EV
zO3sxe(^Lm7IvsYTo+-^9T2w7f0?e-4a~g@%8|B(n6EAi<I+RZN2mc`@Qf$i90!fY3
z0z}VKlso9}#TF$-u-+RE5(r3qbjXn+CQ2NHg_o`s6a5s8SsZkv5Gc8xJV_})g~5!x
zV-?KE)0Cv-dQe!fhwyh(ZKL^1o-OoYsg*Yn8Xc+65@BgS%FgK6Vh{wPEs3Ir{u_HN
z`66&<-Zo$y;~?T5*6JING1QA_ZlSe8mi>g+U0rG>jwY`zoP+4CdtVt*Jz5y#MUqpO
zzHO9W9Br>=Ihg2_Bt9T<X4KZ;d(}KRC{rAir1J4;!)g|_9#1!<SrH~WC6N!b<T^dW
z5j;qju*dKyk`z9{!#}WMfH`~F9t<%exls>lurT~P{wsH7XpG@HB*}YVY6~j<KEAIT
zF`qH)g(Q6s9M3oG8_x!%^S_~gZ;x!!1;b(7+6`d9t#8oAz!$PVQUb7C8;q>UZE{G4
zzmP2NK{HJFHYwV6&pK-+gj9bn4cRodp*BY&14&30_jqEnBZpjbM;WG!%|wwiGH5kC
zj`-|7oQ$S_f-#hYWO)xBEs;}tB63mZE(sJvNyy2^<MHffjfsZI^?Jt;5^_?ux}a{f
zaPw9)C@is$AsOU+8l^*25$l3))Z>7m0pxs;XP>hFzv$`IJ+vO`-k9}0em&nIBtR)p
zEAP?|{zuul;6@C>K=ev=2w>m;V)dhyRt`kkxquZB7%<G|6-`DZs3%CxY!|s7v3Yo~
zP^1htDnZ>H$$h}<YjzqH1x-ff+$HkUjqsjphm_+`v<x=Ovg8S~;lJ1MD7?O@{QfU%
zGFNWs%L2FEkO}rFsNhs#_#|=@zOcy5<B(DxibBE)zX#1u?g-qT!Q|ZvD;QPjJ;S{t
z@a-sN{oaUzp{OJ5LGPI>ia6RuTfHNRqF=D5Sx=rvX6yVyIL+HwD-r{HhH`NmhZ5x{
zKl}E>m?$tcD=|HoB9I&JIEaQrkr-HY>xoIv3#E+{#CN6N7fmtjxv&_@bvO`$`{7Wc
zs29wuo!y0+1G&Xm0m@rx1x1Qu4-DpP*0X&7GqHFSR#tlP>oF)AV_wr%2+CphNf$a^
z{p@HR*Cw36dYT~$Tf?4NT)|lc-Vooulj1^=Mp*Ui;o1x(e4cgaB)7^6NO{pZW4*NK
zlN|@6eYh1FfRzj`9O3?@IsS<O{}fgbs#1EgHT|XR+>RUwVIY_i2$o0wiFtbch0tAD
z31AAtN`f8@5>{31`a8?*K)f>=fO-NwT7!Yo9`ypsu6sc;A1DX(V6C{uoJc~o#qR@|
zkpNT&^r$v~n}8L9!JhZ2%!mN$cCFFBT2`JVMhV^}GN^vtE>3clp@5@uxUO<vSguq`
zau{%t%HmYZ)A)`Uhl~)QI+*8Cv4`G%Dw53>ElTFZpY3`S+sTR*$OdgxgUW2Bu81AV
zqf|=8Lf20y4%b^Vw=+V6>Oh_bafcJn28#`@H8NTQa~@nx>69{BjO5L3&^9GCuoL7d
z@cLTsfyZ{h2WON9c5*!B)pa!G5A-inQg~0?GJ_v=rM31de`xi!0w2|#kp$QY@&FAf
znoWCILHlj&e-`{X)!^D^omQEA76VEsqX{qv@@SV(vSIiBj2-R5o|?I1dD^Rb-rT^B
z^4rY+OeO4W+*4`t(s8YXE)9ZmM$KT(feV(uVL8<yzJt;sBWN&Z!G#k$^$2%6PYV*|
zjH1C#q{kSMibT0#`%rd8w-Uo3Y@&N2E}_XlZ~qkz=jSdEoyr0zA}Ybu*r#r`ve1BC
zxrdKhSAX3)$Q(K(r84nGi&A%7Zl^CM{R;IEeO6As6YWSl?2Cfy$onupnX`2Ay{BEC
zT=co{GOl?*tx{Q;KnsKcZ{g^d={R#*v}^ln{U3!6Yyt1UDO+<>+bF7-eT`5bg$^Xx
z#uX2eg&af3)l%$At!;rT(5Nucmfx;Q8rrK=Rs(=&`)u3^H+B5ouhU(YN*03gvqK+B
zHFr{v(NAZu6fK0_)*BYi@a&?Wop7j<!dJ=`uFyJra^xOM0c&KpV3o=O0uW8|{F%Ec
z*-Y`~h=k6uf8_o1g|<H|A-yq_YQOsbI;5pi6tUCpIFO){utR?b0H-Uh)U8P9p?&S}
zb9X8~rKD6i{78OWbbP-#a3tBu#GXX|k@EPJdToK{hP(5YV^`|dF6qM}JE<uFBDvg_
zt5hiP*ff0zW=+(gE&tA2zRU^(9-AYVW6t$Y-bnPx`~E5w0z5WPE*csR&;*uzxX)1K
zP1zac2n>Qy@JfhK-TPl`9kWS;*kri?AFY7G@OVvEqDqg|Aeedxmmxj*O@)2e!1lDi
zmM&~?8+!Q~mFKJmwrB4;cwi^RMpo4Ou>E<k1KiW7CA*+r-+bibQHg+2%7<RngPb+D
zEV*Q!3RJIA$w!&LQuv$Z^5oxGiBM6;hkC?>P@e+9cUrC>^%_NdKwp{qWy)%{)CV-F
zAoUtWe3Sx>v!HDJ*!hGtsUY<lC4Bn20Ip2ts4@-BmMh^SfITezF{J9)QIU}llL}6+
z0qp53!>nsPil3~h%_pxy(`!I`;MHu;6ApcauwTQK_z}P!)XhP@V8iDvnpQ}9wbK)w
zl_u=+lkDRaj9x8vENy*;3HiG#9LaLU5B;e4ps>G58Svkf0V<5U`cd#<9&9<wmQKm#
z@4NBuc<Oq-p1Af*G_iYL)@xD$=+%!IOZami>vG15@p&;`ado$&5XR!+mDK5zSUTJl
z2wkIoPiKAaq<x9X^vDVQe~|buWoMLwFbsm>cQ0edI#?6qRm`F>Sz@*qy}$f5CJw5R
z3-HhtI^g5yZF}>>IsmXJeJ`oD1`_>a`}@ngS;YnR9Q{zFegkwD{h>rci9viIqz9q>
z5xZr@n~nq%qu!&x3xYBj2HQOIlv9MhCIk4ub&5tSb<3eE4cn1;!ksCY!XqIdrB874
zydxonO+Kml0r<nZ&z;lguVI8_ChqN!Z!JKm%R*js^cOJ#GZVXXlCS_sAo`iJ3t187
znAl7|L&Bjp=nJ|sjkh?09TS^^j~a&-rG8S#AQ$l;HG&?~2kS$S^6yZTVGPPjD;19L
z!L-%$!I)AmFKi+EyApBFjhGK6I&!YAsRz=?6(W2vi7EJCMM?*hqX?(Q;}#)=NnER>
vfb#)_ms+v*7sq?pUmwf)KCjE^GTo=+?y$eCx9hwdch3O;rS(y9*@YeeFK0EH

literal 0
HcmV?d00001

diff --git a/demo/undocumented/multistage-solver/python/demo_multi-stage-solver.py b/demo/undocumented/multistage-solver/python/demo_multi-stage-solver.py
new file mode 100644
index 0000000..878ab4c
--- /dev/null
+++ b/demo/undocumented/multistage-solver/python/demo_multi-stage-solver.py
@@ -0,0 +1,100 @@
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008
+# Modified by Johan Hake, 2008
+# Modified by Garth N. Wells, 2009
+# Modified by Johan Hake, 2013
+#
+# First added:  2007-11-14
+# Last changed: 2013-04-05
+#
+# This demo solves the time-dependent convection-diffusion equation by
+# a SUPG stabilized method. The velocity field used
+# in the simulation is the output from the Stokes (Taylor-Hood) demo.
+# The sub domains for the different boundary conditions are computed
+# by the demo program in src/demo/subdomains.
+#
+# FIXME: Add shock capturing term and then revert back to the Stokes
+#        velocity
+# FIXME: This demo showcase experimental features of a RKSolver (time integrator)
+# FIXME: using a MultiStageScheme. It could be removed or changed anytime.
+
+from dolfin import *
+
+print "RKSolver is temporarily unavailable"
+exit(0)
+
+# Load mesh and subdomains
+mesh = Mesh("../dolfin_fine.xml.gz")
+sub_domains = MeshFunction("size_t", mesh, "../dolfin_fine_subdomains.xml.gz");
+h = CellSize(mesh)
+
+# Create FunctionSpaces
+Q = FunctionSpace(mesh, "CG", 1)
+V = VectorFunctionSpace(mesh, "CG", 2)
+
+# Create velocity Function from file
+velocity = Function(V);
+File("../dolfin_fine_velocity.xml.gz") >> velocity
+
+# Initialise source function and previous solution function
+f  = Constant(0.0)
+u0 = Function(Q)
+
+# Parameters
+T = 5.0
+dt = 0.1
+t = Constant(0.0)
+c = 0.00005
+
+# Test and trial functions
+u, v = Function(Q), TestFunction(Q)
+
+# Residual
+r = dot(velocity, grad(u)) - c*div(grad(u)) - f
+
+# Galerkin variational problem (rhs)
+F = -(v*dot(velocity, grad(u)) + c*dot(grad(v), grad(u)))*dx
+
+# Add SUPG stabilisation terms
+vnorm = sqrt(dot(velocity, velocity))
+F -= h/(2.0*vnorm)*dot(velocity, grad(v))*r*dx
+
+# Set up boundary condition
+g = Expression("(t<=ramp_stop) ? t : 1.0", t=t, ramp_stop=1.0) 
+bc = DirichletBC(Q, g, sub_domains, 1)
+
+# Output file
+out_file = File("results/temperature.pvd")
+
+scheme = BDF1(F, u, t, [bc])
+solver = RKSolver(scheme)
+
+# Time-stepping
+while float(scheme.t()) < T:
+
+    solver.step(dt)
+    
+    # Plot solution
+    plot(u)
+
+    # Save the solution to file
+    out_file << (u, float(scheme.t()))
+
+# Hold plot
+#interactive()
diff --git a/demo/undocumented/nonmatching-interpolation/cpp/CMakeLists.txt b/demo/undocumented/nonmatching-interpolation/cpp/CMakeLists.txt
new file mode 100644
index 0000000..dcb4afa
--- /dev/null
+++ b/demo/undocumented/nonmatching-interpolation/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_nonmatching-interpolation)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/nonmatching-interpolation/cpp/P1.h b/demo/undocumented/nonmatching-interpolation/cpp/P1.h
new file mode 100644
index 0000000..b0a5d74
--- /dev/null
+++ b/demo/undocumented/nonmatching-interpolation/cpp/P1.h
@@ -0,0 +1,1267 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __P1_H
+#define __P1_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class p1_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  p1_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new p1_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class p1_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  p1_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new p1_dofmap_0();
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace P1
+{
+
+class FunctionSpace: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  FunctionSpace(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~FunctionSpace()
+  {
+  }
+
+};
+
+}
+
+#endif
diff --git a/demo/undocumented/nonmatching-interpolation/cpp/P1.ufl b/demo/undocumented/nonmatching-interpolation/cpp/P1.ufl
new file mode 100644
index 0000000..9d92788
--- /dev/null
+++ b/demo/undocumented/nonmatching-interpolation/cpp/P1.ufl
@@ -0,0 +1,27 @@
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-06-18
+# Last changed: 
+#
+# The bilinear form a(v, u) and linear form L(v) for
+# projection onto piecewise quadratics.
+#
+# Compile this form with FFC: ffc -l dolfin P1.ufl
+
+element = FiniteElement("Lagrange", triangle, 1)
+
diff --git a/demo/undocumented/nonmatching-interpolation/cpp/P3.h b/demo/undocumented/nonmatching-interpolation/cpp/P3.h
new file mode 100644
index 0000000..c4e6704
--- /dev/null
+++ b/demo/undocumented/nonmatching-interpolation/cpp/P3.h
@@ -0,0 +1,3126 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __P3_H
+#define __P3_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class p3_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  p3_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p3_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new p3_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class p3_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  p3_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p3_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + 2*num_global_entities[1] + num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new p3_dofmap_0();
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace P3
+{
+
+class FunctionSpace: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  FunctionSpace(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~FunctionSpace()
+  {
+  }
+
+};
+
+}
+
+#endif
diff --git a/demo/undocumented/nonmatching-interpolation/cpp/P3.ufl b/demo/undocumented/nonmatching-interpolation/cpp/P3.ufl
new file mode 100644
index 0000000..a4839ec
--- /dev/null
+++ b/demo/undocumented/nonmatching-interpolation/cpp/P3.ufl
@@ -0,0 +1,27 @@
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-06-18
+# Last changed: 
+#
+# The bilinear form a(v, u) and linear form L(v) for
+# projection onto piecewise quadratics.
+#
+# Compile this form with FFC: ffc -l dolfin P3.ufl
+
+element = FiniteElement("Lagrange", triangle, 3)
+
diff --git a/demo/undocumented/nonmatching-interpolation/cpp/compile.log b/demo/undocumented/nonmatching-interpolation/cpp/compile.log
new file mode 100644
index 0000000..d25941c
--- /dev/null
+++ b/demo/undocumented/nonmatching-interpolation/cpp/compile.log
@@ -0,0 +1,264 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling element P3
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+Compiler stage 1 finished in 0.000183821 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.015722 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  
+Compiler stage 3 finished in 0.000133991 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.162461 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000262022 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./P3.h.
+  
+Compiler stage 5 finished in 0.000683069 seconds.
+
+FFC finished in 0.179769 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling element P1
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+Compiler stage 1 finished in 0.000183105 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00594521 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  
+Compiler stage 3 finished in 0.000135899 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0428491 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000223875 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./P1.h.
+  
+Compiler stage 5 finished in 0.000524998 seconds.
+
+FFC finished in 0.0501709 seconds.
diff --git a/demo/undocumented/nonmatching-interpolation/cpp/main.cpp b/demo/undocumented/nonmatching-interpolation/cpp/main.cpp
new file mode 100644
index 0000000..d6b72a3
--- /dev/null
+++ b/demo/undocumented/nonmatching-interpolation/cpp/main.cpp
@@ -0,0 +1,82 @@
+// Copyright (C) 2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-06-17
+// Last changed: 2012-07-05
+
+//
+// This program demonstrates the interpolation of functions on non-matching
+// meshes.
+//
+
+#include <dolfin.h>
+#include "P1.h"
+#include "P3.h"
+
+using namespace dolfin;
+
+#ifdef HAS_CGAL
+
+class MyExpression : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = sin(10.0*x[0])*sin(10.0*x[1]);
+  }
+
+};
+
+int main()
+{
+  // Create meshes
+  UnitSquareMesh mesh0(16, 16);
+  UnitSquareMesh mesh1(64, 64);
+
+  // Create function spaces
+  P3::FunctionSpace V0(mesh0);
+  P1::FunctionSpace V1(mesh1);
+
+  // Create functions
+  Function f0(V0);
+  Function f1(V1);
+
+  // Interpolate expression into V0
+  MyExpression e;
+  f0.interpolate(e);
+
+  // Interpolate V0 function (coarse mesh) into V1 function space (fine mesh)
+  f1.interpolate(f0);
+
+  // Plot results
+  plot(f0);
+  plot(f1);
+  interactive();
+
+  return 0;
+}
+
+#else
+
+int main()
+{
+  info("DOLFIN must be compiled with CGAL to run this demo.");
+  return 0;
+}
+
+#endif
diff --git a/demo/undocumented/nonmatching-interpolation/python/demo_nonmatching-interpolation.py b/demo/undocumented/nonmatching-interpolation/python/demo_nonmatching-interpolation.py
new file mode 100644
index 0000000..3fb30a1
--- /dev/null
+++ b/demo/undocumented/nonmatching-interpolation/python/demo_nonmatching-interpolation.py
@@ -0,0 +1,46 @@
+"""This script demonstrates how to interpolate functions between different
+finite element spaces on non-matching meshes."""
+
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-05-19
+# Last changed: 2009-05-19
+
+from dolfin import *
+
+# Create mesh and define function spaces
+mesh0 = UnitSquareMesh(16, 16)
+mesh1 = UnitSquareMesh(64, 64)
+
+P1 = FunctionSpace(mesh1, "CG", 1)
+P3 = FunctionSpace(mesh0, "CG", 3)
+
+# Define function
+v0 = Expression("sin(10.0*x[0])*sin(10.0*x[1])", element=FiniteElement('CG', triangle, 3))
+v1 = Function(P1)
+
+# Interpolate
+v1.interpolate(v0)
+
+# Plot functions
+plot(v0, mesh=mesh0, title="v0")
+plot(v1, title="v1")
+interactive()
+
+print norm(v0, mesh = mesh1)
+print norm(v1)
diff --git a/demo/undocumented/nonmatching-projection/cpp/CMakeLists.txt b/demo/undocumented/nonmatching-projection/cpp/CMakeLists.txt
new file mode 100644
index 0000000..e1638dd
--- /dev/null
+++ b/demo/undocumented/nonmatching-projection/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_nonmatching-projection)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/nonmatching-projection/cpp/P1_projection.h b/demo/undocumented/nonmatching-projection/cpp/P1_projection.h
new file mode 100644
index 0000000..11843b2
--- /dev/null
+++ b/demo/undocumented/nonmatching-projection/cpp/P1_projection.h
@@ -0,0 +1,5210 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __P1_PROJECTION_H
+#define __P1_PROJECTION_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class p1_projection_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  p1_projection_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_projection_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new p1_projection_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a finite element.
+
+class p1_projection_finite_element_1: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  p1_projection_finite_element_1() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_projection_finite_element_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new p1_projection_finite_element_1();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class p1_projection_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  p1_projection_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_projection_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + 2*num_global_entities[1] + num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new p1_projection_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class p1_projection_dofmap_1: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  p1_projection_dofmap_1() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_projection_dofmap_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new p1_projection_dofmap_1();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class p1_projection_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  p1_projection_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_projection_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 4
+    // Total number of operations (multiply-add pairs):                  7
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_;
+    A[1] = 0.0416666666666667*G0_;
+    A[2] = 0.0416666666666667*G0_;
+    A[3] = 0.0416666666666667*G0_;
+    A[4] = 0.0833333333333333*G0_;
+    A[5] = 0.0416666666666666*G0_;
+    A[6] = 0.0416666666666667*G0_;
+    A[7] = 0.0416666666666666*G0_;
+    A[8] = 0.0833333333333333*G0_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class p1_projection_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  p1_projection_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_projection_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    10
+    // Number of operations (multiply-add pairs) for tensor contraction: 16
+    // Total number of operations (multiply-add pairs):                  29
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00833333333333326*G0_0 + 0.00416666666666666*G0_1 + 0.00416666666666666*G0_2 + 0.0375000000000001*G0_5 + 0.0375*G0_7 + 0.0749999999999998*G0_9;
+    A[1] = 0.00416666666666664*G0_0 + 0.00833333333333342*G0_1 + 0.00416666666666668*G0_2 + 0.0375000000000002*G0_3 + 0.0374999999999999*G0_8 + 0.0749999999999998*G0_9;
+    A[2] = 0.00416666666666665*G0_0 + 0.00416666666666669*G0_1 + 0.00833333333333341*G0_2 + 0.0375000000000001*G0_4 + 0.0374999999999999*G0_6 + 0.0749999999999997*G0_9;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class p1_projection_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  p1_projection_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_projection_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "e070dec8a6b4373dfa344ad7bfad8b639b98aad8754e0c26f64b544a88bb9709bfe3c9bdb825ce0db112da30044958b8f17e505a3980f82d89a189a55e5f6047";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new p1_projection_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new p1_projection_finite_element_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new p1_projection_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new p1_projection_dofmap_1();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new p1_projection_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class p1_projection_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  p1_projection_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p1_projection_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "16f151414c02a04ae8ba11424c868bfc5c6ba9597b573473d5632f1f41fd452cfd8427e58a4430ed1a1ba1227ad1312087b429b1eb15c305f62cfe9e490045f0";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new p1_projection_finite_element_1();
+        break;
+      }
+    case 1:
+      {
+        return new p1_projection_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new p1_projection_dofmap_1();
+        break;
+      }
+    case 1:
+      {
+        return new p1_projection_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new p1_projection_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace P1_projection
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new p1_projection_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new p1_projection_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p1_projection_finite_element_1()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p1_projection_dofmap_1()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new p1_projection_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new p1_projection_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new p1_projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new p1_projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new p1_projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new p1_projection_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/nonmatching-projection/cpp/P1_projection.ufl b/demo/undocumented/nonmatching-projection/cpp/P1_projection.ufl
new file mode 100644
index 0000000..90453d0
--- /dev/null
+++ b/demo/undocumented/nonmatching-projection/cpp/P1_projection.ufl
@@ -0,0 +1,34 @@
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-10-10
+# Last changed:
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# projection onto piecewise linears.
+#
+# Compile this form with FFC: ffc -l dolfin P1_projection.ufl
+
+P3 = FiniteElement("Lagrange", triangle, 3)
+P1 = FiniteElement("Lagrange", triangle, 1)
+
+u = TrialFunction(P1)
+v = TestFunction(P1)
+f = Coefficient(P3)
+
+a = u*v*dx
+L = f*v*dx
diff --git a/demo/undocumented/nonmatching-projection/cpp/P3.h b/demo/undocumented/nonmatching-projection/cpp/P3.h
new file mode 100644
index 0000000..c4e6704
--- /dev/null
+++ b/demo/undocumented/nonmatching-projection/cpp/P3.h
@@ -0,0 +1,3126 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __P3_H
+#define __P3_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class p3_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  p3_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p3_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, -0.0288675134594813, -0.0166666666666666, 0.0782460796435952, 0.0606091526731326, 0.0349927106111883, -0.0601337794302955, -0.0508223195384204, -0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791032, 0.0288675134594813, -0.0166666666666666, 0.0782460796435952, -0.0606091526731327, 0.0349927106111883, 0.0601337794302955, -0.0508223195384204, 0.0393667994375868, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0471404520791031, 0.0, 0.0333333333333333, 0.0, 0.0, 0.104978131833565, 0.0, 0.0, 0.0, 0.0909137290096989};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, 0.117369119465393, 0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, -0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, 0.151522881682832, 0.0262445329583912, 0.0, 0.0, 0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, 0.117369119465393, -0.0606091526731326, -0.0787335988751736, 0.0, 0.101644639076841, 0.131222664791956, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.0, 0.3, 0.0, -0.151522881682832, 0.0262445329583912, 0.0, 0.0, -0.131222664791956, -0.136370593514548};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, -0.259807621135332, -0.15, -0.0782460796435952, 0.090913729009699, 0.0962299541807677, 0.180401338290886, 0.0508223195384204, -0.0131222664791956, -0.0227284322524247};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.106066017177982, 0.259807621135332, -0.15, -0.0782460796435952, -0.090913729009699, 0.0962299541807678, -0.180401338290886, 0.0508223195384204, 0.0131222664791956, -0.0227284322524248};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.636396103067893, 0.0, 0.0, -0.234738238930785, 0.0, -0.262445329583912, 0.0, -0.203289278153682, 0.0, 0.090913729009699};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[8];
+      for (unsigned int r = 0; r < 8; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[8];
+    for (unsigned int r = 0; r < 8; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+      y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+      y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    y[1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    y[1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new p3_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class p3_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  p3_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~p3_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + 2*num_global_entities[1] + num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 2;
+        break;
+      }
+    case 2:
+      {
+        return 1;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + 2*c.entity_indices[1][0];
+    dofs[4] = offset + 2*c.entity_indices[1][0] + 1;
+    dofs[5] = offset + 2*c.entity_indices[1][1];
+    dofs[6] = offset + 2*c.entity_indices[1][1] + 1;
+    dofs[7] = offset + 2*c.entity_indices[1][2];
+    dofs[8] = offset + 2*c.entity_indices[1][2] + 1;
+    offset += 2*num_global_entities[1];
+    dofs[9] = offset + c.entity_indices[2][0];
+    offset += num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 5;
+      dofs[3] = 6;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 7;
+      dofs[3] = 8;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+        dofs[1] = 6;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 7;
+        dofs[1] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.666666666666667*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.666666666666667*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.333333333333333*vertex_coordinates[2] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.333333333333333*vertex_coordinates[3] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[5][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[5];
+    dof_coordinates[6][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[4];
+    dof_coordinates[6][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[5];
+    dof_coordinates[7][0] = 0.666666666666667*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2];
+    dof_coordinates[7][1] = 0.666666666666667*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3];
+    dof_coordinates[8][0] = 0.333333333333333*vertex_coordinates[0] + 0.666666666666667*vertex_coordinates[2];
+    dof_coordinates[8][1] = 0.333333333333333*vertex_coordinates[1] + 0.666666666666667*vertex_coordinates[3];
+    dof_coordinates[9][0] = 0.333333333333333*vertex_coordinates[0] + 0.333333333333333*vertex_coordinates[2] + 0.333333333333333*vertex_coordinates[4];
+    dof_coordinates[9][1] = 0.333333333333333*vertex_coordinates[1] + 0.333333333333333*vertex_coordinates[3] + 0.333333333333333*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new p3_dofmap_0();
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace P3
+{
+
+class FunctionSpace: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  FunctionSpace(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  FunctionSpace(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  FunctionSpace(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new p3_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new p3_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~FunctionSpace()
+  {
+  }
+
+};
+
+}
+
+#endif
diff --git a/demo/undocumented/nonmatching-projection/cpp/P3.ufl b/demo/undocumented/nonmatching-projection/cpp/P3.ufl
new file mode 100644
index 0000000..a4839ec
--- /dev/null
+++ b/demo/undocumented/nonmatching-projection/cpp/P3.ufl
@@ -0,0 +1,27 @@
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-06-18
+# Last changed: 
+#
+# The bilinear form a(v, u) and linear form L(v) for
+# projection onto piecewise quadratics.
+#
+# Compile this form with FFC: ffc -l dolfin P3.ufl
+
+element = FiniteElement("Lagrange", triangle, 3)
+
diff --git a/demo/undocumented/nonmatching-projection/cpp/compile.log b/demo/undocumented/nonmatching-projection/cpp/compile.log
new file mode 100644
index 0000000..78867db
--- /dev/null
+++ b/demo/undocumented/nonmatching-projection/cpp/compile.log
@@ -0,0 +1,462 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling element P3
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+Compiler stage 1 finished in 0.000194073 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.017621 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  
+Compiler stage 3 finished in 0.000138998 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.192676 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00026989 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./P3.h.
+  
+Compiler stage 5 finished in 0.000909805 seconds.
+
+FFC finished in 0.212154 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form P1_projection
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG1(?), CG3(?)'
+  Unique sub elements:    'CG1(?), CG3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0265701 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 2 elements
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 2 dofmaps
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000659 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  Reusing element from cache
+  30 entries computed in 0.00182 seconds
+  Shape of reference tensor: (3, 10)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0104382 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000371933 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 2 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 2 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.219914 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000550985 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./P1_projection.h.
+  
+Compiler stage 5 finished in 0.000821114 seconds.
+
+FFC finished in 0.259049 seconds.
diff --git a/demo/undocumented/nonmatching-projection/cpp/main.cpp b/demo/undocumented/nonmatching-projection/cpp/main.cpp
new file mode 100644
index 0000000..fd7e0f1
--- /dev/null
+++ b/demo/undocumented/nonmatching-projection/cpp/main.cpp
@@ -0,0 +1,84 @@
+// Copyright (C) 2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011.
+//
+// First added:  2009-10-10
+// Last changed: 2012-11-12
+//
+// This program demonstrates the L2 projection of a function onto a
+// non-matching mesh.
+
+#include <dolfin.h>
+#include "P1_projection.h"
+#include "P3.h"
+
+using namespace dolfin;
+
+#ifdef HAS_CGAL
+
+class MyExpression : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = sin(10.0*x[0])*sin(10.0*x[1]);
+  }
+
+};
+
+int main()
+{
+  // Create meshes
+  UnitSquareMesh mesh0(16, 16);
+  UnitSquareMesh mesh1(64, 64);
+
+  // Create P3 function space
+  P3::FunctionSpace V0(mesh0);
+
+  // Interpolate expression into V0
+  MyExpression e;
+  Function f0(V0);
+  f0.interpolate(e);
+
+  // Define variational problem
+  P1_projection::FunctionSpace V1(mesh1);
+  P1_projection::BilinearForm a(V1, V1);
+  P1_projection::LinearForm L(V1, f0);
+
+  // Compute solution
+  Function f1(V1);
+  solve(a == L, f1);
+
+  // Plot results
+  plot(f0);
+  plot(f1);
+  interactive();
+
+  return 0;
+}
+
+#else
+
+int main()
+{
+  info("DOLFIN must be compiled with CGAL to run this demo.");
+  return 0;
+}
+
+#endif
diff --git a/demo/undocumented/nonmatching-projection/python/demo_nonmatching-projection.py b/demo/undocumented/nonmatching-projection/python/demo_nonmatching-projection.py
new file mode 100644
index 0000000..51a50f9
--- /dev/null
+++ b/demo/undocumented/nonmatching-projection/python/demo_nonmatching-projection.py
@@ -0,0 +1,51 @@
+"""This script demonstrates the L2 projection of a function onto a
+non-matching mesh."""
+
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2009-10-10
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh and define function spaces
+mesh0 = UnitSquareMesh(16, 16)
+mesh1 = UnitSquareMesh(64, 64)
+
+# Create expression on P3
+u0 = Expression("sin(10.0*x[0])*sin(10.0*x[1])", degree=3)
+
+# Define projection space
+P1 = FunctionSpace(mesh1, "CG", 1)
+
+# Define projection variation problem
+v  = TestFunction(P1)
+u1 = TrialFunction(P1)
+a  = v*u1*dx
+L  = v*u0*dx
+
+# Compute solution
+u1 = Function(P1)
+solve(a == L, u1)
+
+# Plot functions
+plot(u0, mesh=mesh0, title="u0")
+plot(u1, title="u1")
+interactive()
diff --git a/demo/undocumented/optimization/python/demo_optimization.py b/demo/undocumented/optimization/python/demo_optimization.py
new file mode 100644
index 0000000..7b47938
--- /dev/null
+++ b/demo/undocumented/optimization/python/demo_optimization.py
@@ -0,0 +1,98 @@
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-10-17
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh
+mesh = UnitSquareMesh(16, 16)
+
+# Define function spaces
+P1 = FunctionSpace(mesh, "CG", 1)
+P0 = FunctionSpace(mesh, "DG", 0)
+
+# Define test and trial functions
+v1 = TestFunction(P1)
+w1 = TrialFunction(P1)
+w0 = TestFunction(P0)
+
+# Define functions
+u  = Function(P1)
+z  = Function(P1)
+f  = Constant(1.0)
+p  = Function(P0)
+u0 = Expression("x[0]*(1.0 - x[0])*x[1]*(1.0 - x[1])")
+
+# Dirichlet boundary
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary
+
+# Boundary condition
+bc = DirichletBC(P1, u0, DirichletBoundary())
+
+# Goal functional
+J = (u - u0)*(u - u0)*dx(mesh)
+
+# Forward problem
+problem = (inner(grad(v1), p*grad(w1))*dx, v1*f*dx)
+
+# Adjoint problem
+adjoint = (inner(grad(w1), p*grad(v1))*dx, -2*v1*(u - u0)*dx)
+
+# Update of parameter
+gradient = -inner(grad(z), w0*grad(u))*dx
+px = p.vector()
+
+# Set initial value for parameter
+px[:] = 1.0
+
+# Iterate until convergence
+for i in range(100):
+
+    # Solve forward problem
+    A = assemble(problem[0])
+    b = assemble(problem[1])
+    bc.apply(A, b)
+    solve(A, u.vector(), b)
+
+    # Solve adjoint problem
+    A = assemble(adjoint[0])
+    b = assemble(adjoint[1])
+    bc.apply(A, b)
+    solve(A, z.vector(), b)
+
+    # Update parameter
+    dp = assemble(gradient)
+    dp *= 100.0
+    px -= dp
+
+    # Print value of functional
+    jval = assemble(J)
+    print "J = ", jval
+    print u.vector().max()
+
+# Plot solution and parameter
+plot(u,  title="Solution",  rescale=True)
+plot(z,  title="Adjoint",   rescale=True)
+plot(p,  title="Parameter", rescale=True)
+plot(u0, mesh=mesh, title="Target", rescale=True)
+
+# Hold plot
+interactive()
diff --git a/demo/undocumented/overlapping-regions/cpp/README b/demo/undocumented/overlapping-regions/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/undocumented/overlapping-regions/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/overlapping-regions/python/README b/demo/undocumented/overlapping-regions/python/README
new file mode 100644
index 0000000..0b449da
--- /dev/null
+++ b/demo/undocumented/overlapping-regions/python/README
@@ -0,0 +1,2 @@
+There is as yet no Python version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/overlapping-regions/python/demo_overlapping-regions.py b/demo/undocumented/overlapping-regions/python/demo_overlapping-regions.py
new file mode 100644
index 0000000..d825d53
--- /dev/null
+++ b/demo/undocumented/overlapping-regions/python/demo_overlapping-regions.py
@@ -0,0 +1,75 @@
+# Copyright (C) 2011-2013 Marie E. Rognes, Martin S. Alnaes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-11-09
+# Last changed: 2013-01-29
+
+# Begin demo
+
+#
+# NB! This demo is work in progress and will be updated as we get further in the multidomain features implementation.
+#
+from dolfin import *
+
+class Left(SubDomain):
+    def inside(self, x, on_boundary):
+        return (x[0] <= 0.25+DOLFIN_EPS)
+
+class Mid(SubDomain):
+    def inside(self, x, on_boundary):
+        return (x[0] >= 0.375-DOLFIN_EPS) and (x[0] <= 0.625+DOLFIN_EPS)
+
+class Right(SubDomain):
+    def inside(self, x, on_boundary):
+        return (x[0] >= 0.75-DOLFIN_EPS)
+
+# Define mesh and subdomains
+mesh = UnitSquareMesh(64, 64)
+domains = CellFunction("size_t", mesh)
+domains.set_all(0)
+Left().mark(domains, 1)
+Mid().mark(domains, 2)
+Right().mark(domains, 3)
+
+# Define input data
+alpha = Constant(1e-3)
+f = Constant(3.0)
+g = Constant(5.0)
+
+# Define function space and basis functions
+V = FunctionSpace(mesh, "CG", 2)
+u = TrialFunction(V)
+v = TestFunction(V)
+
+# Define regions as tuples of subdomain labels
+DL, DM, DR = (1,2), (2,), (2,3) # ***
+
+# Define new measures associated with the interior domains
+dx = Measure("dx")[domains]
+
+# Make forms for equation
+a = u*v*dx() + alpha*dot(grad(u), grad(v))*dx() # ***
+L = f*v*dx(DR) + g*v*dx(DL) - (f+g)/2*v*dx(DM) # ***
+
+# Solve problem
+u = Function(V)
+solve(a == L, u)
+
+# Plot solution and gradient
+plot(domains, title='domains')
+plot(u, title="u")
+interactive()
diff --git a/demo/undocumented/parallel-refinement/cpp/CMakeLists.txt b/demo/undocumented/parallel-refinement/cpp/CMakeLists.txt
new file mode 100644
index 0000000..fb067c5
--- /dev/null
+++ b/demo/undocumented/parallel-refinement/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_parallel-refinement)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/parallel-refinement/cpp/main.cpp b/demo/undocumented/parallel-refinement/cpp/main.cpp
new file mode 100644
index 0000000..99e4fae
--- /dev/null
+++ b/demo/undocumented/parallel-refinement/cpp/main.cpp
@@ -0,0 +1,59 @@
+// Copyright (C) 2013 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-26
+// Last changed: 2013-04-26
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  // Create mesh
+  UnitSquareMesh mesh(20, 20);
+
+  // Create MeshFunction to hold cell process rank
+  CellFunction<std::size_t>
+    processes0(mesh, dolfin::MPI::rank(mesh.mpi_comm()));
+
+  // Output cell distribution to VTK file
+  File file("processes.pvd");
+  file << processes0;
+
+  // Mark all cells on process 0 for refinement
+  const CellFunction<bool>
+    marker(mesh, (dolfin::MPI::rank(mesh.mpi_comm()) == 0));
+
+  // Refine mesh, but keep all new cells on parent process
+  Mesh mesh0 = refine(mesh, marker, false);
+
+  // Create MeshFunction to hold cell process rank
+  const CellFunction<std::size_t>
+    processes1(mesh0, dolfin::MPI::rank(mesh.mpi_comm()));
+  file << processes1;
+
+  // Refine mesh, but this time repartition the mesh after refinement
+  Mesh mesh1 = refine(mesh, marker, true);
+
+  // Create MeshFunction to hold cell process rank
+  CellFunction<std::size_t>
+    processes2(mesh1, dolfin::MPI::rank(mesh.mpi_comm()));
+  file << processes2;
+
+  return 0;
+}
diff --git a/demo/undocumented/parallel-refinement/python/demo_parallel-refinement.py b/demo/undocumented/parallel-refinement/python/demo_parallel-refinement.py
new file mode 100644
index 0000000..06602ba
--- /dev/null
+++ b/demo/undocumented/parallel-refinement/python/demo_parallel-refinement.py
@@ -0,0 +1,48 @@
+# Copyright (C) 2013 Chris N. Richardson
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-04-26
+# Last changed: 2013-04-26
+
+from dolfin import *
+
+# Create mesh
+mesh = UnitSquareMesh(20, 20)
+
+# Create MeshFunction to hold cell process rank
+processes = CellFunction('size_t', mesh, MPI.rank(mesh.mpi_comm()))
+
+# Output cell distribution to VTK file
+file = File("processes.pvd")
+file << processes
+
+# Mark all cells on process 0 for refinement
+marker = CellFunction('bool', mesh, (MPI.rank(mesh.mpi_comm()) == 0))
+
+# Refine mesh, but keep all news cells on parent process
+mesh0 = refine(mesh, marker, False)
+
+# Create MeshFunction to hold cell process rank for refined mesh
+processes1 = CellFunction('size_t', mesh0, MPI.rank(mesh.mpi_comm()))
+file << processes1
+
+# Refine mesh, but this time repartition the mesh after refinement
+mesh1 = refine(mesh, marker, True)
+
+# Create MeshFunction to hold cell process rank for refined mesh
+processes2 = CellFunction('size_t', mesh1, MPI.rank(mesh.mpi_comm()))
+file << processes2
diff --git a/demo/undocumented/parameters/cpp/CMakeLists.txt b/demo/undocumented/parameters/cpp/CMakeLists.txt
new file mode 100644
index 0000000..9776e19
--- /dev/null
+++ b/demo/undocumented/parameters/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_parameters)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/parameters/cpp/main.cpp b/demo/undocumented/parameters/cpp/main.cpp
new file mode 100644
index 0000000..aa1fde6
--- /dev/null
+++ b/demo/undocumented/parameters/cpp/main.cpp
@@ -0,0 +1,119 @@
+// Copyright (C) 2009 Johan Hake and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-05
+// Last changed: 2009-09-14
+//
+// This demo demonstrates the DOLFIN parameter system.
+//
+// Try running this demo with
+//
+// ./demo --bar 1 --solver_parameters.max_iterations 1000
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main(int argc, char* argv[])
+{
+  //--- Demo of global DOLFIN parameters ---
+
+  // Set some global DOLFIN parameters
+  parameters["linear_algebra_backend"] = "uBLAS";
+
+  // Print global DOLFIN parameters
+  info(parameters, true);
+  cout << endl;
+
+  // Read parameters from file
+  File file("parameters.xml");
+  file >> parameters;
+  info(parameters, true);
+  cout << endl;
+
+  //--- Demo of nested parameter sets ---
+
+  // Create an application parameter set
+  Parameters application_parameters("application_parameters");
+
+  // Create application parameters
+  application_parameters.add("foo", 1.0);
+  application_parameters.add("bar", 100);
+  application_parameters.add("baz", false);
+  application_parameters.add("pc", "amg");
+
+  // Create a solver parameter set
+  Parameters solver_parameters("solver_parameters");
+
+  // Create solver parameters
+  solver_parameters.add("max_iterations", 100);
+  solver_parameters.add("tolerance", 1e-16);
+  solver_parameters.add("relative_tolerance", 1e-16, 1e-16, 1.0);
+
+  // Set range for parameter
+  solver_parameters["max_iterations"].set_range(0, 1000);
+
+  // Set some parameter values
+  solver_parameters["max_iterations"] = 500;
+  solver_parameters["relative_tolerance"] = 0.1;
+
+  // Set solver parameters as nested parameters of application parameters
+  application_parameters.add(solver_parameters);
+
+  // Parse command-line options
+  application_parameters.parse(argc, argv);
+
+  // Access parameter values
+  double foo = application_parameters["foo"];
+  int bar = application_parameters["bar"];
+  double tol = application_parameters("solver_parameters")["tolerance"];
+
+  // Print parameter values
+  cout << "foo = " << foo << endl;
+  cout << "bar = " << bar << endl;
+  cout << "tol = " << tol << endl;
+  cout << endl;
+
+  // Print application parameters
+  info(application_parameters, true);
+  cout << endl;
+
+  //--- Demo of Krylov solver parameters ---
+
+  // Set a parameter for the Krylov solver
+  KrylovSolver solver;
+  solver.parameters["relative_tolerance"] = 1e-20;
+
+  // Print Krylov solver parameters
+  info(solver.parameters, true);
+  cout << endl;
+
+  //--- Demo of updating a parameter set ---
+
+  // Create a subset of the application parameter set
+  Parameters parameter_subset("parameter_subset");
+  parameter_subset.add("foo", 3.0);
+  Parameters nested_subset("solver_parameters");
+  nested_subset.add("max_iterations", 850);
+  parameter_subset.add(nested_subset);
+
+  // Update application parameters
+  application_parameters.update(parameter_subset);
+  info(application_parameters, true);
+
+  return 0;
+}
diff --git a/demo/undocumented/parameters/cpp/parameters.xml b/demo/undocumented/parameters/cpp/parameters.xml
new file mode 100644
index 0000000..ec50ab5
--- /dev/null
+++ b/demo/undocumented/parameters/cpp/parameters.xml
@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+
+<dolfin xmlns:dolfin="http://fenicsproject.org/">
+  <parameters name="parameters">
+    <parameter key="linear_algebra_backend" type="string" value="uBLAS"/>
+    <parameter key="optimize" type="bool" value="false"/>
+  </parameters>
+</dolfin>
diff --git a/demo/undocumented/parameters/python/demo_parameters.py b/demo/undocumented/parameters/python/demo_parameters.py
new file mode 100644
index 0000000..62dc005
--- /dev/null
+++ b/demo/undocumented/parameters/python/demo_parameters.py
@@ -0,0 +1,161 @@
+"""This demo demonstrates the DOLFIN parameter system.
+
+Try running this demo with
+
+  python demo.py --bar 1 --solver_parameters.max_iterations 1000
+"""
+
+# Copyright (C) 2009 Johan Hake and Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-09-06
+# Last changed: 2009-12-08
+
+from dolfin import *
+
+#--- Demo of global DOLFIN parameters ---
+
+# Set some global DOLFIN parameters
+parameters["linear_algebra_backend"] = "uBLAS"
+
+# Print global DOLFIN parameters
+info(parameters, True)
+print
+
+# Read parameters from file
+file = File("parameters.xml")
+parameters = Parameters("parameters")
+file >> parameters
+info(parameters, True)
+print
+
+#--- Demo of nested parameter sets ---
+
+# Create an application parameter set
+application_parameters = Parameters("application_parameters")
+
+# Create application parameters
+application_parameters.add("foo", 1.0)
+application_parameters.add("bar", 100)
+application_parameters.add("baz", False)
+application_parameters.add("pc", "amg")
+
+# Create a solver parameter set
+solver_parameters = Parameters("solver_parameters")
+
+# Create solver parameters
+solver_parameters.add("max_iterations", 100)
+solver_parameters.add("tolerance", 1e-16)
+solver_parameters.add("relative_tolerance", 1e-16, 1e-16, 1.0)
+
+# Set range for parameter
+solver_parameters.set_range("max_iterations", 0, 1000)
+
+# Set some parameter values
+solver_parameters["max_iterations"] = 500
+solver_parameters["relative_tolerance"] = 0.1
+
+# Can also access parameter values like this
+solver_parameters.max_iterations = 500
+solver_parameters.relative_tolerance = 0.1
+
+# Set solver parameters as nested parameters of application parameters
+application_parameters.add(solver_parameters)
+
+# Parse command-line options
+application_parameters.parse()
+
+# Access parameter values
+foo = application_parameters["foo"]
+bar = application_parameters["bar"]
+tol = application_parameters["solver_parameters"]["tolerance"]
+
+# Can also access parameter values like this
+foo = application_parameters.foo
+bar = application_parameters.bar
+tol = application_parameters.solver_parameters.tolerance
+
+# Print parameter values
+print "foo =", foo
+print "bar =", bar
+print "tol =", tol
+print
+
+# Print application parameters
+info(application_parameters, True)
+print
+
+#--- Demo of Krylov solver parameters ---
+
+# Set a parameter for the Krylov solver
+solver = KrylovSolver()
+solver.parameters["relative_tolerance"] = 1e-20
+
+# Print Krylov solver parameters
+info(solver.parameters, True)
+print
+
+#--- Demo of updating a parameter set ---
+
+# Create a subset of the application parameter set
+parameter_subset = Parameters("parameter_subset")
+parameter_subset.add("foo", 3.0)
+nested_subset = Parameters("solver_parameters")
+nested_subset.add("max_iterations", 850)
+parameter_subset.add(nested_subset)
+
+# Update application parameters
+application_parameters.update(parameter_subset)
+info(application_parameters, True)
+
+# Can also update using a dictionary
+parameter_subset = dict(foo = 1.5, solver_parameters = dict(max_iterations = 50))
+application_parameters.update(parameter_subset)
+
+# Or like this
+parameter_subset = {"foo": 1.5, "solver_parameters": {"max_iterations": 50}}
+application_parameters.update(parameter_subset)
+
+# Print command-line option string
+print "\nCommand-line option string"
+print application_parameters.option_string()
+
+# Demostrate access to full info of parameters
+def print_data(par, indent=""):
+    print "\n" + indent + "Content of:", par.name()
+    for key, par_info in par.iterdata():
+        if isinstance(par_info,Parameters):
+            print_data(par_info, indent + "    ")
+        else:
+            print indent + key, par_info
+
+print_data(application_parameters)
+
+# Direct creation of application parameter set
+new_application_parameters = Parameters(
+    "application_parameters",
+    foo = 1.0,
+    bar = 100,
+    pc = "amg",
+    solver_parameters = Parameters(
+        "solver",
+        max_iterations = 100,
+        tolerance = 1e-16,
+        relative_tolerance = (1e-16, 1e-16, 1.0),
+        pcs = ("ilu", ["ilu","amg","icc","sor"])
+        )
+    )
diff --git a/demo/undocumented/parameters/python/parameters.xml b/demo/undocumented/parameters/python/parameters.xml
new file mode 100644
index 0000000..0b35004
--- /dev/null
+++ b/demo/undocumented/parameters/python/parameters.xml
@@ -0,0 +1,14 @@
+<?xml version="1.0" encoding="UTF-8"?>
+
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <parameters name="parameters">
+    <parameter key="floating_point_precision" type="int" value="64"/>
+    <parameter key="linear_algebra_backend" type="string" value="uBLAS"/>
+    <parameter key="optimize" type="bool" value="false"/>
+    <parameter key="optimize_form" type="bool" value="false"/>
+    <parameter key="optimize_use_dof_map_cache" type="bool" value="false"/>
+    <parameter key="optimize_use_tensor_cache" type="bool" value="false"/>
+    <parameter key="plot_filename_prefix" type="string" value="dolfin_plot_data"/>
+    <parameter key="timer_prefix" type="string" value=""/>
+  </parameters>
+</dolfin>
diff --git a/demo/undocumented/petsc4py/python/demo_petsc4py.py b/demo/undocumented/petsc4py/python/demo_petsc4py.py
new file mode 100644
index 0000000..4449f7c
--- /dev/null
+++ b/demo/undocumented/petsc4py/python/demo_petsc4py.py
@@ -0,0 +1,101 @@
+"""This demo program solves Poisson's equation
+
+    - div grad u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+    f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+
+and boundary conditions given by
+
+    u(x, y) = 0        for x = 0 or x = 1
+du/dn(x, y) = sin(5*x) for y = 0 or y = 1
+
+It demonstrates how to extract petsc4py objects from dolfin objects
+and use them in a petsc4py Krylov solver.
+
+Based on "demo/pde/poisson/python/demo_poisson.py"
+"""
+
+# Copyright (C) 2007-2011, 2013 Anders Logg, Lawrence Mitchell
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+
+# Begin demo
+
+from dolfin import *
+try:
+    from petsc4py import PETSc
+except:
+    print "*** You need to have petsc4py installed for this demo to run",
+    print "Exiting."
+    exit()
+
+if not has_petsc4py():
+    print "*** DOLFIN has not been compiled with petsc4py support",
+    print "Exiting."
+    exit()
+
+parameters["linear_algebra_backend"] = "PETSc"
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(32, 32)
+V = FunctionSpace(mesh, "Lagrange", 1)
+
+# Define Dirichlet boundary (x = 0 or x = 1)
+def boundary(x):
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+g = Expression("sin(5*x[0])")
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
+
+# Compute solution
+u = Function(V)
+
+A, b = assemble_system(a, L, bc)
+
+# Fetch underlying PETSc objects
+A_petsc = as_backend_type(A).mat()
+b_petsc = as_backend_type(b).vec()
+x_petsc = as_backend_type(u.vector()).vec()
+
+# Create solver, apply preconditioner and solve system
+ksp = PETSc.KSP().create()
+ksp.setOperators(A_petsc)
+
+pc = PETSc.PC().create()
+pc.setOperators(A_petsc)
+pc.setType(pc.Type.JACOBI)
+ksp.setPC(pc)
+
+ksp.solve(b_petsc, x_petsc)
+
+# Plot solution
+plot(u, interactive=True)
+
+# Save solution to file
+file = File("poisson.pvd")
+file << u
diff --git a/demo/undocumented/plot-qt/cpp/BoundaryMeshFunction.cpp b/demo/undocumented/plot-qt/cpp/BoundaryMeshFunction.cpp
new file mode 100644
index 0000000..bad3ddd
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/BoundaryMeshFunction.cpp
@@ -0,0 +1,37 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-14
+// Last changed: 2012-09-18
+
+#include "BoundaryMeshFunction.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+BoundaryMeshFunction::BoundaryMeshFunction(const Mesh& mesh)
+  : _bmesh(mesh, "exterior")
+{
+  MeshFunction<bool>::init(_bmesh, _bmesh.topology().dim());
+  set_all(false);
+}
+//----------------------------------------------------------------------------
+void BoundaryMeshFunction::toggleCell(int id)
+{
+  (*this)[id] = !(*this)[id];
+}
+//----------------------------------------------------------------------------
diff --git a/demo/undocumented/plot-qt/cpp/BoundaryMeshFunction.h b/demo/undocumented/plot-qt/cpp/BoundaryMeshFunction.h
new file mode 100644
index 0000000..8482eb8
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/BoundaryMeshFunction.h
@@ -0,0 +1,48 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-18
+// Last changed: 2012-09-18
+
+#ifndef __BOUNDARY_MESH_FUNCTION_H
+#define __BOUNDARY_MESH_FUNCTION_H
+
+#include <dolfin.h>
+#include <QObject>
+
+class BoundaryMeshFunction : public QObject, public dolfin::MeshFunction<bool>
+{
+  Q_OBJECT
+
+  /// A MeshFunction<bool> on the boundary of a Mesh. The purpose of this class
+  /// is to acceps a toggle signal, which changes the value of a single cell.
+
+public:
+
+  BoundaryMeshFunction(const dolfin::Mesh&);
+
+public slots:
+
+  void toggleCell(int);
+
+private:
+
+  dolfin::BoundaryMesh _bmesh;
+
+};
+
+#endif
diff --git a/demo/undocumented/plot-qt/cpp/CMakeLists.txt b/demo/undocumented/plot-qt/cpp/CMakeLists.txt
new file mode 100644
index 0000000..418802f
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/CMakeLists.txt
@@ -0,0 +1,102 @@
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+project(demo_plot-qt)
+
+set(SOURCES main.cpp Plotter.cpp PlotWidget.cpp CoordLabel.cpp BoundaryMeshFunction.cpp)
+set(HEADERS Plotter.h PlotWidget.h CoordLabel.h BoundaryMeshFunction.h)
+
+# Ignore whitespace in library paths
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN REQUIRED)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Add special DOLFIN compiler flags
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${DOLFIN_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Qt
+find_package(Qt4)
+if (QT_FOUND)
+  include(${QT_USE_FILE})
+  add_definitions(${QT_DEFINITIONS})
+endif()
+
+# VTK
+find_package(VTK NO_MODULE)
+if (VTK_FOUND)
+  include(${VTK_USE_FILE})
+  if ("${VTK_MAJOR_VERSION}" STREQUAL "5")
+    find_library(lib_QVTK QVTK HINTS ${VTK_LIBRARY_DIRS} NO_DEFAULT_PATH)
+    find_library(lib_QVTK QVTK HINTS ${VTK_LIBRARY_DIRS})
+    list(APPEND VTK_LIBRARIES "${lib_QVTK}")
+  endif()
+endif()
+
+# If built stand-alone (in demo directory), DOLFIN_ENABLE_FOO are not set. We
+# have to parse the definitions to see if qvtk is enabled in DOLFIN.
+get_directory_property(cmake_defs COMPILE_DEFINITIONS)
+foreach(d ${cmake_defs})
+  if (${d} STREQUAL HAS_QVTK)
+    set(QVTK_ENABLED 1)
+  endif()
+endforeach()
+
+if (QT_FOUND AND VTK_FOUND AND QVTK_ENABLED)
+
+  # Define headers to run moc on. The OPTIONS ... works around a problem with moc+boost (QT bug #22829).
+  qt4_wrap_cpp(HEADERS_MOC ${HEADERS} OPTIONS   -DBOOST_TT_HAS_OPERATOR_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_BIT_AND_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_BIT_AND_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_BIT_OR_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_BIT_OR_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_BIT_XOR_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_BIT_XOR_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_DIVIDES_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_DIVIDES_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_EQUAL_TO_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_GREATER_EQUAL_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_GREATER_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_LEFT_SHIFT_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_LEFT_SHIFT_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_LESS_EQUAL_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_LESS_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_LOGICAL_AND_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_LOGICAL_OR_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_MINUS_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_MINUS_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_MODULUS_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_MODULUS_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_MULTIPLIES_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_MULTIPLIES_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_NOT_EQUAL_TO_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_PLUS_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_PLUS_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_RIGHT_SHIFT_ASSIGN_HPP_INCLUDED
+                                                -DBOOST_TT_HAS_RIGHT_SHIFT_HPP_INCLUDED
+                                                )
+
+  # Executable
+  add_executable(${PROJECT_NAME} ${SOURCES} ${HEADERS_MOC})
+
+  # Target libraries
+  target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES} ${QT_LIBRARIES} ${VTK_LIBRARIES})
+
+else()
+
+  message(STATUS "QT not found, or QT/VTK not enabled in DOLFIN. Not building " ${PROJECT_NAME})
+
+endif()
diff --git a/demo/undocumented/plot-qt/cpp/CoordLabel.cpp b/demo/undocumented/plot-qt/cpp/CoordLabel.cpp
new file mode 100644
index 0000000..639589f
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/CoordLabel.cpp
@@ -0,0 +1,49 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-14
+// Last changed: 2012-09-18
+
+#include "CoordLabel.h"
+
+//----------------------------------------------------------------------------
+CoordLabel::CoordLabel(const char *format, QWidget *parent)
+  : QLabel(parent), _format(format)
+{
+}
+//----------------------------------------------------------------------------
+void CoordLabel::setNum(int x)
+{
+  QString txt;
+  txt.sprintf(_format, x);
+  setText(txt);
+}
+//----------------------------------------------------------------------------
+void CoordLabel::setNum(int x, int y)
+{
+  QString txt;
+  txt.sprintf(_format, x, y);
+  setText(txt);
+}
+//----------------------------------------------------------------------------
+void CoordLabel::setNum(double x, double y, double z)
+{
+  QString txt;
+  txt.sprintf(_format, x, y, z);
+  setText(txt);
+}
+//----------------------------------------------------------------------------
diff --git a/demo/undocumented/plot-qt/cpp/CoordLabel.h b/demo/undocumented/plot-qt/cpp/CoordLabel.h
new file mode 100644
index 0000000..3acad5c
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/CoordLabel.h
@@ -0,0 +1,49 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-18
+// Last changed: 2012-09-18
+
+#ifndef __COORD_LABEL_H
+#define __COORD_LABEL_H
+
+#include <QLabel>
+
+class CoordLabel : public QLabel
+{
+  Q_OBJECT
+
+  /// A simple wrapper around QLabel, to create simple gui elements for
+  /// formatted display of numbers. Add setNum() slots as required.
+
+public:
+
+  CoordLabel(const char *format, QWidget *parent=NULL);
+
+public slots:
+
+  void setNum(int);
+  void setNum(int,int);
+  void setNum(double,double,double);
+
+private:
+
+  const char *_format;
+
+};
+
+#endif
diff --git a/demo/undocumented/plot-qt/cpp/PlotWidget.cpp b/demo/undocumented/plot-qt/cpp/PlotWidget.cpp
new file mode 100644
index 0000000..dda4bb5
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/PlotWidget.cpp
@@ -0,0 +1,53 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-14
+// Last changed: 2012-09-18
+
+#include "PlotWidget.h"
+#include <QMouseEvent>
+
+//----------------------------------------------------------------------------
+PlotWidget::PlotWidget(QWidget *parent)
+  : QVTKWidget(parent)
+{
+  setMouseTracking(true);
+}
+//----------------------------------------------------------------------------
+void PlotWidget::mouseMoveEvent(QMouseEvent *event)
+{
+  emit mouseMoved(event->x(), event->y());
+  button1_click_in_progress = false;
+  QVTKWidget::mouseMoveEvent(event);
+}
+//----------------------------------------------------------------------------
+void PlotWidget::mousePressEvent(QMouseEvent *event)
+{
+  button1_click_in_progress = (event->buttons() == Qt::LeftButton);
+  QVTKWidget::mousePressEvent(event);
+}
+//----------------------------------------------------------------------------
+void PlotWidget::mouseReleaseEvent(QMouseEvent *event)
+{
+  if (button1_click_in_progress && event->buttons() == Qt::NoButton)
+  {
+    emit mouseClick(event->x(), event->y());
+  }
+  QVTKWidget::mouseReleaseEvent(event);
+}
+//----------------------------------------------------------------------------
+
diff --git a/demo/undocumented/plot-qt/cpp/PlotWidget.h b/demo/undocumented/plot-qt/cpp/PlotWidget.h
new file mode 100644
index 0000000..6f87b6f
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/PlotWidget.h
@@ -0,0 +1,57 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-14
+// Last changed: 2012-09-18
+
+#ifndef __PLOT_WIDGET_H
+#define __PLOT_WIDGET_H
+
+#include <QVTKWidget.h>
+
+class PlotWidget : public QVTKWidget
+{
+  Q_OBJECT
+
+  /// Extends QVTKWidget to send signals on mouse move and click.
+
+public:
+
+  PlotWidget(QWidget *parent=NULL);
+
+protected:
+
+  virtual void mouseMoveEvent(QMouseEvent *);
+
+  virtual void mousePressEvent(QMouseEvent *);
+
+  virtual void mouseReleaseEvent(QMouseEvent *);
+
+signals:
+
+  void mouseMoved(int x, int y);
+
+  void mouseClick(int x, int y);
+
+private:
+
+  // Used to decide which mouse event is a click
+  bool button1_click_in_progress;
+
+};
+
+#endif
diff --git a/demo/undocumented/plot-qt/cpp/Plotter.cpp b/demo/undocumented/plot-qt/cpp/Plotter.cpp
new file mode 100644
index 0000000..6905244
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/Plotter.cpp
@@ -0,0 +1,108 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-14
+// Last changed: 2012-09-18
+
+#include <vtkCellPicker.h>
+#include <vtkRenderer.h>
+
+#include <dolfin/plot/VTKWindowOutputStage.h>
+
+#include "Plotter.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+Plotter::Plotter(std::shared_ptr<const Variable> obj, QWidget *parent)
+  : VTKPlotter(obj, new PlotWidget(parent))
+{
+  init();
+}
+//----------------------------------------------------------------------------
+Plotter::Plotter(std::shared_ptr<const Expression> e, std::shared_ptr<const Mesh> m, QWidget *parent)
+  : VTKPlotter(e, m, new PlotWidget(parent))
+{
+  init();
+}
+//----------------------------------------------------------------------------
+bool Plotter::key_pressed(int modifiers, char key, std::string keysym)
+{
+  switch (modifiers + key)
+  {
+    case CONTROL + 'w':
+      // Close window; ignore (or pass to parent widget?)
+      return true;
+  }
+
+  return VTKPlotter::key_pressed(modifiers, key, keysym);
+}
+//----------------------------------------------------------------------------
+void Plotter::init()
+{
+  cur_cell = -1;
+
+  // Use a cell picker (default is prop picker)
+  //vtk_pipeline->get_interactor()->SetPicker(vtkSmartPointer<vtkCellPicker>::New());
+
+  // Receive cursor-position signals
+  get_widget()->setMouseTracking(true);
+  connect(get_widget(), SIGNAL(mouseMoved(int,int)), SLOT(receiveMouseMoved(int,int)));
+  connect(get_widget(), SIGNAL(mouseClick(int,int)), SLOT(receiveMousePress(int,int)));
+
+  // Prevent window move/resize
+  parameters["tile_windows"] = false;
+}
+//----------------------------------------------------------------------------
+void Plotter::receiveMouseMoved(int x, int y)
+{
+  const QSize size = get_widget()->size();
+
+  vtkSmartPointer<vtkCellPicker> picker = vtkSmartPointer<vtkCellPicker>::New();
+  if (picker->Pick(x, size.height()-y-1, 0, vtk_pipeline->get_renderer()))
+  {
+    cur_cell = picker->GetCellId();
+    double *c = picker->GetMapperPosition();
+    emit worldPos(c[0], c[1], c[2]);
+  }
+  else
+  {
+    cur_cell = -1;
+  }
+
+  emit cellId(cur_cell);
+}
+//----------------------------------------------------------------------------
+void Plotter::receiveMousePress(int x, int y)
+{
+  if (cur_cell >= 0)
+  {
+    emit cellPicked(cur_cell);
+  }
+}
+//----------------------------------------------------------------------------
+void Plotter::toggleMesh()
+{
+  // FIXME: Lazy + ugly
+  VTKPlotter::key_pressed(0, 'm', "m");
+}
+//----------------------------------------------------------------------------
+void Plotter::update()
+{
+  VTKPlotter::plot();
+}
+//----------------------------------------------------------------------------
diff --git a/demo/undocumented/plot-qt/cpp/Plotter.h b/demo/undocumented/plot-qt/cpp/Plotter.h
new file mode 100644
index 0000000..c4d26ec
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/Plotter.h
@@ -0,0 +1,73 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-14
+// Last changed: 2012-09-18
+
+#ifndef __DEMO_PLOTTER_H
+#define __DEMO_PLOTTER_H
+
+#include <QObject>
+#include <QVTKWidget.h>
+#include <dolfin/plot/VTKPlotter.h>
+#include "PlotWidget.h"
+
+class Plotter : public QObject, public dolfin::VTKPlotter
+{
+  Q_OBJECT
+
+  /// Extends VTKPlotter with signals and slots. Additionally adds a cell
+  /// picker interface.
+
+public:
+
+  Plotter(std::shared_ptr<const Variable> obj,
+          QWidget *parent=NULL);
+
+  Plotter(std::shared_ptr<const dolfin::Expression> e,
+          std::shared_ptr<const dolfin::Mesh> m,
+          QWidget *parent=NULL);
+
+  virtual bool key_pressed(int modifiers, char key, std::string keysym);
+
+private slots:
+
+  void receiveMouseMoved(int x, int y);
+  void receiveMousePress(int x, int y);
+
+public slots:
+
+  void toggleMesh();
+
+  void update();
+
+signals:
+
+  void cellId(int);
+
+  void cellPicked(int);
+
+  void worldPos(double,double,double);
+
+private:
+
+  void init();
+
+  int cur_cell;
+};
+
+#endif
diff --git a/demo/undocumented/plot-qt/cpp/main.cpp b/demo/undocumented/plot-qt/cpp/main.cpp
new file mode 100644
index 0000000..48994a2
--- /dev/null
+++ b/demo/undocumented/plot-qt/cpp/main.cpp
@@ -0,0 +1,96 @@
+// Copyright (C) 2012 Joachim Berdal Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-14
+// Last changed: 2012-09-18
+//
+// This demo illustrates embedding the plot window in a Qt application.
+
+#include <QtGui>
+
+#include <dolfin.h>
+
+#include "CoordLabel.h"
+#include "BoundaryMeshFunction.h"
+#include "Plotter.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+int main(int argc, char *argv[])
+{
+  if (getenv("DOLFIN_NOPLOT"))
+  {
+    warning("DOLFIN_NOPLOT is set; not running %s", argv[0]);
+    return 0;
+  }
+
+  // Create application and top-level window
+  QApplication app(argc, argv);
+  QWidget window;
+  window.setWindowTitle("Qt embedded plot window demo");
+
+  // Create plotter
+  UnitCubeMesh unit_cube(4, 4, 4);
+  BoundaryMeshFunction meshfunc(unit_cube);
+  Plotter plotter(reference_to_no_delete_pointer(meshfunc));
+  plotter.parameters["range_min"] = 0.0;
+  plotter.parameters["range_max"] = 1.0;
+  plotter.parameters["scalarbar"] = false;
+
+  // All keyboard events are handled by the plotter
+  plotter.get_widget()->grabKeyboard();
+
+  // Create bottom row of labels/buttons
+  CoordLabel *pixel_x_label = new CoordLabel("Pixel: (%d,%d)");
+  CoordLabel *cell_label    = new CoordLabel("Cell: %d");
+  CoordLabel *world_x_label = new CoordLabel("Coordinate: (%.2f,%.2f,%.2f)");
+  QPushButton *toggle       = new QPushButton("Toggle mesh");
+
+  QBoxLayout *sublayout = new QHBoxLayout();
+  sublayout->addWidget(pixel_x_label);
+  sublayout->addWidget(cell_label);
+  sublayout->addWidget(world_x_label);
+  sublayout->addWidget(toggle);
+
+  // Create main layout (the plot window above the row of labels/buttons)
+  QBoxLayout *layout = new QVBoxLayout();
+  layout->addWidget(plotter.get_widget());
+  layout->addLayout(sublayout);
+  window.setLayout(layout);
+
+  // Connect the plotter with the labels and buttons
+  QObject::connect(plotter.get_widget(), SIGNAL(mouseMoved(int,int)), pixel_x_label, SLOT(setNum(int,int)));
+  QObject::connect(&plotter, SIGNAL(cellId(int)), cell_label, SLOT(setNum(int)));
+  QObject::connect(&plotter, SIGNAL(worldPos(double,double,double)), world_x_label, SLOT(setNum(double,double,double)));
+  QObject::connect(toggle, SIGNAL(pressed()), &plotter, SLOT(toggleMesh()));
+
+  // Connect the cell-pick signal to the plotted object and renderer
+  QObject::connect(&plotter, SIGNAL(cellPicked(int)), &meshfunc, SLOT(toggleCell(int)));
+  QObject::connect(&plotter, SIGNAL(cellPicked(int)), &plotter, SLOT(update()));
+
+  // Set window size and show window
+  // FIXME: The plot window isn't correctly sized unless plot() has been called
+  // before resize().
+  plotter.plot();
+  window.resize(700,500);
+  window.show();
+
+  // Enter main event loop
+  return app.exec();
+}
+//----------------------------------------------------------------------------
diff --git a/demo/undocumented/plot/cpp/CMakeLists.txt b/demo/undocumented/plot/cpp/CMakeLists.txt
new file mode 100644
index 0000000..d8d8dbc
--- /dev/null
+++ b/demo/undocumented/plot/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_plot)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/plot/cpp/main.cpp b/demo/undocumented/plot/cpp/main.cpp
new file mode 100644
index 0000000..50b37c9
--- /dev/null
+++ b/demo/undocumented/plot/cpp/main.cpp
@@ -0,0 +1,129 @@
+// Copyright (C) 2006-2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet 2012
+//
+// First added:  2007-05-29
+// Last changed: 2012-11-12
+//
+// This demo illustrates basic plotting.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+class ScalarExpression : public Expression
+{
+public:
+
+  ScalarExpression() : Expression(), t(0) {}
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = t*100*exp(-10.0*(pow(x[0] - t, 2) + pow(x[1] - t, 2)));
+  }
+
+  double t;
+
+};
+
+class VectorExpression : public Expression
+{
+public:
+
+  VectorExpression() : Expression(2), t(0) {}
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = -(x[1] - t)*exp(-10.0*(pow(x[0] - t, 2) + pow(x[1] - t, 2)));
+    values[1] =  (x[0] - t)*exp(-10.0*(pow(x[0] - t, 2) + pow(x[1] - t, 2)));
+  }
+
+  double t;
+
+};
+
+int main()
+{
+  // Read mesh from file
+  Mesh mesh("../dolfin_fine.xml.gz");
+
+  // Have some fun with the mesh
+  const double R = 0.15;
+  const double H = 0.025;
+  double X = 0.3;
+  double Y = 0.4;
+  double dX = H;
+  double dY = 1.5*H;
+  std::vector<double>& coordinates = mesh.coordinates();
+  const std::vector<double> original = coordinates;
+
+  for (std::size_t i = 0; i < 200; i++)
+  {
+    if (X < H || X > 1.0 - H)
+      dX = -dX;
+
+    if (Y < H || Y > 1.0 - H)
+      dY = -dY;
+
+    X += dX;
+    Y += dY;
+
+    for (std::size_t j = 0; j < mesh.num_vertices(); ++j)
+    {
+      const double x = coordinates[2*j];
+      const double y = coordinates[2*j + 1];
+      const double r = std::sqrt((x - X)*(x - X) + (y - Y)*(y - Y));
+      if (r < R)
+      {
+        coordinates[2*j]     = X + (r/R)*(r/R)*(x - X);
+        coordinates[2*j + 1] = Y + (r/R)*(r/R)*(y - Y);
+      }
+    }
+
+    plot(mesh, "Plotting mesh");
+
+    coordinates = original;
+  }
+
+  // Plot scalar function
+  Parameters p;
+  p.add("rescale", true);
+  p.add("title", "Plotting scalar function");
+
+  ScalarExpression f_scalar;
+
+  for (std::size_t i = 0; i < 100; i++)
+  {
+    f_scalar.t += 0.01;
+    plot(f_scalar, mesh, p);
+  }
+
+  // Plot vector function
+  UnitSquareMesh unit_square(16, 16);
+  VectorExpression f_vector;
+  for (std::size_t i = 0; i < 200; i++)
+  {
+    f_vector.t += 0.005;
+    plot(f_vector, unit_square, "Plotting vector function");
+  }
+
+  // Make plot windows interactive
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/plot/dolfin_fine.xml.gz b/demo/undocumented/plot/dolfin_fine.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6f071e4bdc5c7c4478a746fdd0baaafe3c08b3ef
GIT binary patch
literal 88283
zcmV)RK(oIeiwFQ7^h!|x1B{i;P8%^4h4(zg$onR~|JR7Xu20ZDK$Q%1q%c7wD$u8|
zDY<47kJv=A#$V=KpW`z(cdw88;m`PdoDTCQ!78U=oVSPFG(T+8&mZ5vdAhs3y1LmN
z_V?2~)ZO#(`eU(4zfY&9>-GBO<z;n0&eQg|Iy^tDKc24B?bR^cJdVfT!*<;7Pj64-
zCY_$AU-QF$Ov7$^+$8+Jscx$ZPSbWg4#(+l-G;7yesq2~z7Es88(%l6Dt!N432{M6
z!`u6UP_t25cNho;vN8q(3`M&Po*7mJlrw{cvSXK_U`Uxg7zfPKWjL5zSQ}$f(7KGA
z8B#Chlc~dbm(gIP3i{e>ED#5v633R2pmZ5;;|L>s&7KkrWCsg|grM(eZttn$nl>(u
zeM<ovlymcx#EiKQMG(luxCKs~@`Aib0%36rhp5yb^pgM)1uP~xV#@U|bRpW21+0^6
z$YWE11$o*aAq|%VIYU1{U`?L8G|13-VW!9fff<Fjnpt4Mrw9a*6^nz=s?_^o#oR7M
zE|~+W*2)3|mu`}lBK;G`76>UKks`xdCjAs4T~b#QC1nBP7QIXyhi6)|*Y_6X(ycW`
zw|;S9Ylo7><HU`@q#p>hcAYpkn+$6WEzHyk0-17~DH|_z7q*6A!_S#Ag7%w;T19w%
zw<e&v?7xXxMOaY?bJe{p^cQ`8E8N>RNvpfo4>{4LnN$ndg1q*%KquiZLUO5JYgv@^
zkMVLzVi*Qt=#`B5-~VDI3zRNwCi^lb;vv*)iJeAk$}EEnxEHAj)3e8zhAF`y$|s}0
zNRxOtv+#$g2*7Y6i**N2;14y*-72X1TKDdRPSUBk56dL`gt&@{4n=Qv@G?EL$5V6w
z4WiKmso9ph;|X983Y@dr`6<^3aNs0S49Ro27Xo{b%s=a|s^OF3xJrwss3v(@TD^}|
zUu$^$4gjqws3};;(p$cbRhtD}bzTjZwpL<juUV+yd0<8>pHy%yY8dqIp=vebE}S+D
z8g*M+I0=zGbk{JH)bS>c+PxvLHVY*dq!Z`qCTXK!=Cn~{lmkE7DAbK)LWWWj9-?vM
zU|AOO1}`n{?nRA5-Dbscu8T=~c&Tx4BAg`7$~kxAGDb}>hQz*yq-za>Z>2Z03d>z@
zYZ#m}4Ut;e<F2<g3@()<(cH5jg9?5u+V$|Dcc4Arj(-*uG(>94qjpqu+>3l+vMU5a
zP>K&ljf0halYMK?8wac9X8YJ4WB-<ze|!n<;3)ua{|K>`WC=nLb|w5F-2Y-P*1QRB
z%v5isv}1%M_@g)Co84g@<HDi<#ot9ve;yoTKm6bR@Zoc(Z)LmVT4wKM|9AdlS=hDg
zy=gEz7`>0UkbA$rVABUyvuZHQ-@rvR{o6Pj`q;aMw+ec<dK0+gcP|cJD@?^K{@58c
z&mynk2dXj)@S%310*IEQicFY_pa59C(PbVSMdm;~2sub;hjs#8{0<$c2k~BKB_b`i
zC@Q~*aW{E70P&_n(lC0KwCm99f(}W;h|_WUVWf#Umh_7dT%#VWiT9eT@+T^xF{PQ!
za*OBVcroE9vce>{&W(Hs(j~ot0|M6U*_SvR$uM)!X~PVsaN5nt28bH_vH_UHR3TJj
zB+`%0`il1ED&4RO5b%^};?@q8zSxx@G?E;{P)15Nt7^H^*oV79qcQ|^BSst;*4af>
z(ZZ{-z-+Cp{%cpzI*2?(mAgW|+C<KB&%39oy((!u8kbHOno?kRWsSg^o&=Os++f&<
zro@!UTXzwjwh9{~vz7f(9kW%~nEkYruMY&}x2QVI_#?~=k{AYI82F<OHYC9RKUOg%
zB0f~UFH>raBZ;3qYgSL3SC#WN#*J{CMs0K#G=|DuDGF8vX`N~<a#g2hvCApTVcBE}
zX&azAXgl$_?((#bZ@^sUD(F}tkj#%#9Oh?g;8KbjGIYe>YV0RWD49ajIY4_9O2rFW
zQ<RXgV^rGM-w-AA;~wVusg(ta3Nm-RSL8ikt6bHBoq-8@UUO_kLH`%AF<{rq>kVj5
zwZU-=GEE-jLKmvum^?0@|Jop?uGk=>$E&%w*DFX9uHSa{_~454K#JM0Q$~(eLAF4O
zrrLQTM}{EpK&p!MK#Dt8gA4eG-r6zYLyFd5HaHX0U<?FDO7g;{Bn@3kQtziE=X6T)
ztDTa307}W{s#!|TK#DVBX6Gqs;U6i|LzNU+L**6O!f7h<3LT=zJ9M2Qd+20Et~2@)
zYDQTOg&+*wk_syBe`Ag3lra66`2Va`0h5cg$tpYMkD*o>x7yE_B8!ury(>c^vv;*g
zQ1-51iO1emF`?MI(k2OeS8w94X}G}X8ZP5jEnD)hX(viu!|18Gm|trbxrY>T6Z=B~
z*75u7<Uq#{(O~IBU>M}|xd@+FB4)_IAPn1C9JNEWqB9-CPmdCLrzyEc2<8EWl9zc{
zD1zUK!Ep7=YUfO4g-F4y)d{0C93}BKE%Md4sgiGpVyH!BT)-nVs<n2BqKJ!xWcctD
z<2;vzh-?VnlQ8baL1(M5AVGuIU3_)X?!yDIEHX56vjT~TEOl0dXnuQq^>P5-U(Ln1
zFle;JQPH-VtJ<owlLbxL?d(x_6boak%4c&mRdrTd6bOM2kefll3+exd1`RnC3&z-o
zdtrzSC6fu$kW73}f^2ccCJ57(UFOMAQ^f^gT3kNJCNp+Z**ns-HO&c6)>t9h6rDT`
zYr5T*ZyEHVQlCJr--l!Q2Vo?(dho&rIjHkH&nl3cTdiuB88-s@-fwpQKPXr_-9LPq
zTapAJ2n4UhLs0L3vBlV!s{X3)38NjQfld;s$-GmY`Y$RbdJHtOSCklb1)$oq;ez|C
zBf=t#lN3*c#e5Q`a!~-)-oUF!X4}R5GXT}1BhLZoa^?SksadD3^;sk?E5OvIA~>e?
zFPKDi4CCbe@xfopo$Ptl5pJej#|~Gyr}|%qpVf)-7`Z#t4u7HXc+lZYv&zK5gQ@L`
zOPOrCfl#&<M)1{vOWw!SG(7;-Y#I~tv2=H}!=!|^!N=x8Ox?1Rw`Ks~-L{mgz+2Nc
z1=Y!mBGUw^+DkS0F<L}u0IFqA6tS+xm5(|Eco&(lrw=oA@W8EiS`*qzHAz_Lb-=A2
zPDtxYaf)DMEGj{r-KHKzQz!NzIo(T%!GLPD-0_}FIZ_5&u*aB60LoIO>_jlNa)=hw
zIJ7ePK-A{V-zX*h-WainD&HH_La1^vhYqTIY1ufvb4*?@<*izYSg*+*VuSf%@BvZt
zIl_W*N0Pyxr11O3kxJG4j&JRwiyt9EL^3MuI7jUBgL>AY&b~J1<sl7J7=1mR*X38;
zR7kZ76ycQr-`5}CW|SmB2*S`SHMWY}|6&_=Yaa8nIRIss(2&IN_kvWeo^bU&g2Vjz
z`yBHiJ8<=t%89$!+g=5f<Qm}<40Nt}?0<`F4-)10Qy8VzVW9Cq#;Zr*9Rrv$SLPpX
zNpI%BO`?G?4d5EcdrE51WHd##L9Amo$f#(`)a}163OD%t`uPQOY@bE~RDxHh>uUF=
z;E@AQ<>9$6b~+3GKpGUBsR!a2Ar@t#sEy2^y~k8RIVUttBXh*pZCI}{@?oi$GWdnX
z{aG{(aY4?yrQw<evZCn0!(2Th(>S395@V{XVTDo}mz(@8Hwp+AIzc?Hcu^kj>;6kn
z3B;NpgyMMK=$(W$99zKecUDdAqSS*O?#J-A^4D{Q%QTL&yCWuRcD2{-ys!KJvHV@b
zN401&myH5s+{z%w^X?y+C>W~%11LzyDcqI;zQ2gkJyaQfjodeO?~rKV!;aS_^Ck-G
zpXv@L@qG6cvi^_42`VxI4iYP!_N-5BXkbo6!gVU#6*g(zGrzV5_Uo1!Agw9b4u4<E
zxid!F|MabJ)>Y*|Yuo=Wp+jcXTyQzgUL4S9Wa2H6QFj(vhR_M~<cDuFI+7%WVQ5OW
zp)us2*veOT(tT_x0BU-=!ImEKs=H0bwa7jp5<Vu8U%qsU1V8a(^pUUIkg*c|%vuCH
zFc{^8M$5CV45hg4XK+iAenK&Qgo{1dV)F_~KS#N$xuW!&v~(#z2ye>*1<_$uvhXMR
zq>{pOpKKO!XTV~xBhPkna#!>dTRi@AChcnc{eDZrO^VPNc*O`$$I^&M<Z`dD)yFlY
zg~R1Uje>-k6!E7l(=F1^jn2B&Ou~s1!q1KKLfUdBg=wmjqJ;MfrsF`CQ~t!CJH`ld
z)ZuOCbBRA8aF=My`K+gY8a7%_YB!!!G|CgM{A3EzBg*})qmh|Ml8HTN52P}M@5T{<
zZ`b;t2GF{h9K&vZ?mQBJ;)(uzy1!9Yv?DVR6&h9+$ru9v+#(i?t?+qG1k$Xb`dpo&
z_9&$3e(B$~$g$CziYr{`aS?w)VkIxPPTSEi($Ai~Dxn*nx#nA;+Y*RJrWZ$jxd)^%
zN!Xdv9m};(Nco9c#4n5k64$LF{amM8Lx%XqW)<n@Ak)-X0*tvC7$p5Xr;6fkCg7GE
zXr#!vk$m$F<%C-D!^ah5I}pO4D`}z`z5m5N>3@aUl<s|_R+B)$-=k8>wkx^{N!EnV
zB>Q>Wqag$Qlhe&`tAsD={OTMhZA-DA=PCgK!A7|mviCj^X@h&%o?0`C<!3|?E*vD5
za_bV)HP#kD1|&4=BK?U=Nl9VhMjF9czUWUxLgKUyh~aFj!B*82(KU8CS!R;{ocAi3
zAW*vkIYZ|5qX01O-p=Sr0`!iCw>-Q+h{jS%3UtQX0)3khHKW)x8KplNKq`(KrS^MG
z@)@UTKesNWlbGyN&kRF#B{|TxV93zCP)cqyii)-VQ7SRc<2EBze*#uhDgi`eph=Pg
zMbLawT7=^eSEi`0m%sw3*L7Nw9Owfy!jb_nz(#p;pwSc_?<6p#U6-CdKu!vE#+=tL
zNrJ{|^CtoFy4USI8}MtsgyWH6B)cgE<9exEXJNKx4@rX}8eVeN?QIJ8EryM?iWjAA
z_0xTeghp*WzA@_KtNuMoQsj@p^ozMx8YNAV20j07(QkhJSVDh~;@KEu@F|uS445uR
zN)?Gn#<Ot?#jiPsq(K|Pvo+R^6}K4_sgE{d>jjSG%7(3@fn+Z62p0DI@o{BW62l;@
zCEMVu|HfA2?MnVx72ruG<`6<)PIdLGf)Q$rZQqbAXo<k{m4LaAAr=%MlCFG!SB&61
z$btg>Znfc2wc2MfYyf!CQL5dt%q5csMTI9#0xo13p?{DEh4E_o6oF@7x2@qk{eqC{
zq;P{dMIhQxB&VFR%=-T|4;o;&$?gtvo`oplLHF0?|J$09PJbVoeMX5Q#^7d}agJDG
zyYB8%#`NR9Jb6(3_NQO{MF4kQ_rKUy+xcv`DGuAcp_b{iWU5>xsWFE%+cI<rkbJsK
zNg5PB*-5M))JDd3NrS?*w6EsoNte7xgI4Q^7GFJ(<~D$+c5RbrXyWF~vZNpnitxON
zURQPg+$ly40F?Fg@SOZ9Gzfj?Afg1WF$_<T21PzyWReGh)pd{JqJ+6MVFl;!?vA&D
z2I9JwdtK}P<U!+^vjr|RCP)$#v3?E-l2&(214+=F_*aa&qvp!ZDcZ%ET6R;)9|zVR
z4QLbWg2TAVRddvML#dcbz~~;O?HLd4QrOp(LXQMAHGjQfn%#X2%{;ZEX}C7RB`#?|
zXM0fcDjA<SMYgL39_d<Rt}osF@Noq>62l<uOGzLQ{{OLsN{hLSk8?muJ5?~Y@vo{u
zgTBCaWxWoP%7cySw*`yken`57G!L3!67rbkkHxBx$|m4=q;k(#6`F}Xm>G63WkSG%
znr*Z@GdlebBGj*fK8-_92*003gSDGC2>T9U1l?*#Yf2=<9t#9{S$3KTwIGYPg7xYI
zcxPmHD8U&DBD4rKfm)zsJkh~~#zm&a=c6E1&4s$RoKek=%um`>Xuh(sUF{N!J(fbG
zJ%Y5ba-WkbEEMR-Vocm7EWWDUJEeTIw3~OFu@gGjzW@*_QxXYbYA$r!CvN?}!+kHS
zigEKomkefCQy4*?IGlyIWN%W{9*vsmkoa^jF}NzI&=^bO?`!I$s;SU-UsvU9zKF!A
z8x1AVZZmRH{uNTyd{@q(h>FP0KpKi7&T$!bgHL`Xhn*0{E+6Vim=dg}O@&4dMLJOY
zVc}*?g+>KH^>Za|WvOFLg&tW*fQlTZ*j>|HXvMAqtoe3A@#w)`!SD)IBqlv!e;bw)
zRA1NmpR)+I1DZVh0RX^<5`R}Usj+naUzf;n+El2o1cT^8?|f+JkB@6Tk}w2ey<7t)
z2tN96>|k#u@z16J=5t+C2uZ$0;XUc8J-U+}E*FSf!}jK+!CRvyqV8iD^so|#{1&j#
zvz&C=mcy&xMJ%+=Q&1#O7r96%V4+qypJc2mygLAe`s-7i|1H?}sNkm@{Zpm13y>@T
zg}M)W1POVRY2IWR8Uq<`O)ye6g_|6xV{BZdrXv7_*85NLnO9%E)Sryh$jNSURmmt?
z>i`s5{Wwvws!5f(ZBW>qZs%b$DR?p-M(DbSyRl^&28#_lysv9J<O*rnaZeJGKauKN
zxHam1#j9K)%CI8<h1OOCT{+KH4M4;rV4R4u>b=zK1t`?(aG@P)z|58PC30f~1&sS1
zWh@-PLg$ACiV9$cD%gO9u1Y)r-o040LSUi3k`$i0yp`Z5fQ4@F?w#5Kwei%PS2;x4
zqYZNvm9*y~a(#}RY6k5e>mkRC*KQ90MHEntVb?h{T(Xo;vb$PW`FPX_U^oDU)|q^U
z8beu~2awQC1>8_|j9oa9#CnEn8(fH{pAF@v>SSpX##_7XphVQ9KV#D2(|WEcqR17F
zLBITLj_uFyA75vb?LY{^&@GJ!i2L8zgZGj6(=5Q#+KwQXkoma^>MqLyk?#jNMBmj(
zLcNlud?!Gmw|2Tg)_o%H<Oa1bjKim|@3HwwRj`4Dj<FuWb;mWa=s}@f*u~RMR$q`P
zbU*I`h;ntfNJ4KI#HVF_eng}J2_023>;GNK2GBu5ZJd&v9Ujpm^Ftj^QWR!g;)VJx
z5HmXMu;R6`{1U53yy_9+hs^#2p<O?L;qUps#ghvbIwLCiDC(6>f|G?#nLr#r*I%&;
z-IJVZ2v$>ZL?6V#LhU^FlNh!pLLp#icBr}RcDZWEJ78$<r0A#EF-@Tc!qBcRaGyN6
z)!P-EiqLwnM(^sHTE$yvEh?waKZX6hip1+_$lG`eigN-OI&&Q~)9pG@h&BAuQ+Qdi
zAGbsO%a?B|8L2<+T}w?{IYps4=9;wYbCrcS6JL|PIWfHz4FL?b!(MV1eCqfEh4#Zh
zWH>X-Vog$V!5rCpva3D`xn$8~(#J+yxrZ0WA1>fTN3>FxLMlT0W<sr-eaZ|Y=rb9a
zObeE3JTpGpj$Uf`CM%ROIVTAHo~~6C>xDnQuHf2X7=*248>^W87yHly;?S=Fcuks^
zfRMzGAS0oE(NcC@rEx<8p>CH}4&{j{C_Gq%$QPpuoK!yNl*IddGj<iRB8t7q0C>*}
zMbbtCq4nkG6=pvxKo_jho7jhVoIOEUM<b!7y9vrpmonW1Z6@7VshK9nW0Nmj2BLh*
zCJpe7t3|-5y9A^O0-=TC5&Ew^2O_G0&@WN5=W(&F`Yl@1=ZR{7cP-^5iUvY6rNc&-
zq2^YgBtDZ%pXBF?w1&n(i<so>g47lmkP+(PK^FAeTSd`E!^XY~4<!>q!=Ra-f|{w?
zQzKpsD&p;OypvTx2(kbUA#$TkFmLLrmyj^%v6#yd)KnexncQV0(#44@*%@dw8F+7Q
zK@n%`koLFFa9G$1W55}6HGlL<3AJ4b4TE|%CWk=nH!=PnwTGUDzAOkO9|vXeap=gj
zKki3Gb(K*Xp9Y|#;5ZS*q~Se(`eX+y`ZO5H!g~j$6ZffAYDU-MEcN=&h^vldqoA1+
z4^7LmzIp1dxD0EbX2-=^=IR-@jPVAOT7HjQbk(?Hu7>8+)PQJS;U8bumLx$4!mcDX
zLA?LP7WRW!wY53G)Y!JR5cBx+D+1(L_MnBz!VOM5qt3-CpiC597!35>HUysvJ`~c8
z!9W}IWW2{(ri!k?Ksz{VgnPAKOy;SO^Oux%RO_&=ns<s%+NpwR9m>KPPSav%dPJ48
z+tqWiGg)S|RsPjO{Ga(k4AgmdT8D`M@G%f*)h3Jf8_KZ|l*GFc0PS8w9g(25Uv5fB
z)+dKI0O&=qK<)vGH#`7ntqL1N-7-~x637LuEi&kReM#@9M)=BGxgQ%GSN}x|H>1XS
zw@sfof$-#GvE=Gl5^*a5YT~2yqth<9QcNP=R3vudpHks~R8Z85CAnDV0R`0s*n{3x
z$GcS}Nh)Z6-lq$S^$ENh1VHUl8dJk{0X~6}_?Di<BeMR~#Lr<;<pQs{HkAGe1AzLm
zJ)gpCMvd6~1V9&^ZNd}*0)v0%UQRoQ+9aw@J0uC89FvN3j=EjId4!Bf03;&SQw;#x
zIc6m8)&SMXf7rBE1wYT_DhCAvfO_l4rqs1m-Zr2lJ`YKqSvy8fJY^@gFYmZQu_o|P
zK@YjlQET@v<?n~DGf8471cB(498vFou|O6)7D+F&u<C1&p{41v>VeT%UP;ejr>grC
z0rfnRse6$vh-aOB;TFsdKg$z(f!^&zKrQV3qHv~Unf5IcRt}Wz`_*#&ziQ#2;E&ib
zxh)t;)AH|HPm0Q28Z_2oSi;>)#UPqNm!JGVw^X0t{e|m#%`YR@t<>j5JB_Kk1^gM(
zgjobdZ?^crgg=ipT=k7#V$nb+ZjPcdbX2DMcunK&Ge85mE1JjOLAjyHtRM6<NZb(c
zhSE6LXzYwbAs%|YU7bZixo9nR2i%q6(h2JEw}bburJ#ZWfcD13P51D^V_5t7&g$W~
zE0wuM#Y%VfclNbdlc6N~F(+t$6RC-Tf9^87B<R6HZLcBX-MNlIA`#R5Ea6XkZ56{E
z)09>rq2#U{)-|?jd^XxZ-@G||H0GTgbr#sg>)EFktR%H7hCUv6er_XM=@rrj8XQ<e
z4v*4}vjjg+luA5D`0Wvf0r=_G)X+753f8d%KLbtA5@@{9pITLf7zYY}&9=x{tuW%h
zZZ<Jf#Q`xG@&1X0WHJ7Sk`G^3kR(9}!oFmyMEL*57WP26Odep(bg3XAB(;iN)*%XL
zihYkE2O2j9eC$wr9DL^nr7e~#_8l7i%)*O9S$Rs-P!>24Ur2RNB4?6SmY#zIx-UVv
zD~*M*$H^Gx*@3r|6KI#LrLFX+o_R(89h>8e?j1gBj7EJ{SFCyVFX!5FkHs}1`1wjd
zuTh=QzeUeB7&&0!TR`w233LUTAn-EoigF7ifu2RoG%wfZ%1*U|Mi|?XrI)Az6w%Lf
zvDlA<ng9g{;?L)_4|-C+0F8cTh2b_DcPiaA`g!sYc0G99T>e3}-_N0|#54711>w*2
z2)7_>0P)Pg8H!BICf|P2{Fc`5rH$NW?pC%^X!O&nED2idLD|w?wpowSfMJE|^n)DG
z$>z?m7|NKI<M8&aMFDJA9B?%LSsKc;DT@n%6XH@vxcn^}qbU_vv8vO_{Wr*HS*wb|
zzgKlS*~7$Q9}jht$pMW=qF*L|xyj`D`DRNO5~G1JpX@!br?u3Z!T8b`ox2*A6eCuk
zztDCc9r$+zxdo(vK76ztC~}L~E@RLzs_2|j3H!b3kFP7su^0wnS1KfN!u>Bc@T9?f
z`2dyLD4Sg`AO*UXG1;cBQ0fgqGLs~C;uJ*{f)uF7oe9`S4Iyi9EP9=+cyh)!1Dfdg
z8rw#tMgYx#?jm;@J(U?rykRq-iM^x!)t;a=RBtxDNcW>t`hz?f=!Q=~#~3Yn-cbRH
zZT+t*cYEcN21fKaCq`Ags*dg^K-XQnFKcBsQKjf4Ko5PRmG>iZQULyc2Q#KCvD?&O
zPylNF4S=k4$Y3LQbxVLdjojkdhZNsAY(#Wb>5OJT^C_wxtC3f2)|7x&lFc~BL!pyq
zKoejGz0$>Iie*9#sLd?)oEi%4vKZX1kBC&?a^$HSze6l}U4<8b6zKU`d)wsy1aS%)
z;@3~O@Q>nM#b<&dP`mbMzHwKh@z??S(3H!zt*BkFSp4(-$d2EmZia6N{n*{T^LvFv
z2z12%l$kv@e9O^b$n+Yu)d&-^Y%~d4`OB9g(CP*ePmL_M6C)`h)Z8Emn&A45erT1v
z0g6CNs>i3^5(Z{488pwUmUQKuRI*}_1^q?EkkFL8OYj;Ri|gxch4KFQI-?tbK^TUv
z1O(!;|6&I{9gq8{2Z&l#G$c-JgMzk}D5TGD_NIx?xT5f=v<!<pIB2Ze_$*AVzuGNl
z=D|U?)AiNk&F+Aq`LA~cb_r+an-jXp3yA|Kna!O92Oam&ue|p4Ur~Y)znXXInwrkv
zOfceOQj^DCXPzdiad_i&D4|vjKp~LOEm^>vyN}|Yb)}7VsH5v6J;Ox}R>4T~>)!1q
ziK<*zN{8IuhjWS&hU43qyCVMV<Tr#lQe%ZgTM2)dAf~M|uaWxG%+je?1g)i_QlWI`
zi9OI&yk1)!#W{2dzwwm-xV(PJr{7UDC>QrG^cKzEQ73Dxn&hFo9>V}$s_c$;>{09{
zgANe-Y&d?>3bn_5!PB0^OPu{X@72B@YQiH<r6KFYAk4;d0(QRwdginPgq8*ZwaGhX
zUaboV?Y&YMPG?pojFHw2#~i6`xZ6a*hEL$rm2;gJgK$Qgqh0c^&8Z{{AXJKzXQGFr
zatS(o<i%f@R(Mwpo$0``NZa_u{9E{q*O<B|yQXQ-MTgIh?%qr0{*H>vPL0BFonzB8
zY*Vuz!mc34ff$5+DU(1<{{OKBX@xnty+^HR6u<_%4;@xQwRa~1KirWn<zKT82*K>4
zfzYhT7pFn8Y7ulM4kt9S{dq(4XsKT~2-lz^9b(I9+~L_iwp8~0RNz6e?if~4uCh3{
z;oZg@(}SoA!DaZf9W(Wd<s}$B3-$sh;=={n1>;axeLCC4ry|%u=!r!Q(sF%J!7$zo
z8*@VCFe~m8bwP2rllj}q_W?$<>zNOs1gKy%M7|E1_{-)=(Q2?+Wi+s!p*ZR-v|;j0
zzl}2IyDIQQLc=?A?XoNq-$fvF2-IZ5r8q{=TfJmhK6+oOywEUcK55*AtsEq}3=jq_
zrBVVRp)B9v!%&ToYu50tO0I@MJ^y4H?0&U4B~J0l@S(f+$=(EnK?7mqDU{Xtm;`kn
z8&;*)B~I~X9A{q0dR{=}xU?-;M%HReF)TC=nu&pSJ2m7XHqCLFPKb492nD%|MnSz8
zaUQw~en#V<UNkTrOO(G18V0oiOq?Ij=Ow8YW96x&SjD}#bU87C>igBux;WJZsK2oZ
z`_>NiU;W>UKfccB$blGyp&i{2uNQFtjUD8}kDsUjCK=m{K^D^AMtrncs;Zs|rk(59
z<<L41U}0PkberXz?^UyK!5n;#*}^SaaxDNsV;ev9kueyy+IX*Oz*>Cy_#*Wf=NclN
zDmTFb^)@L6vfgqnZoa7G=In4a=xW_B1ey-q`dA30FhD>LepK~c37L}s|FreoIoL`T
zCd7vV3TUf_-(>N~VaG_U)a)}{K+^>>7CGE+M!UMd)Xv{gaJs$>_}fG(L%+Zl>G)yU
ztLRl13HWD@*7)%y*qi|ew8}Zk$QHm*e-M5~RdzQjTJl*$p%v=`PpfTI9Y2Dgb)HaS
zYExAebxVu^NmTYwA|invsJUNYthw-l{SXIou)+4L%1}M{2P5#+hg_z`Yqr$FA58WR
zxN{#T)%1@s`1fE`>Pul&us|&r`f_zh)CwkqQ>df9>`~P_a-emSTt;l&|0X)L98>Tw
z(gWTu)*+&xXKXyfJzYIXrj6or1;c4=%_*WrzdDMv+69rS)5c};@Cvt=0zcD+mD<pk
z=>aztH7*l}GEpZ(;8khkGO5<<pRcRIbua{BSMmp>-v43~lTnwv*8`AmVFqf2mLxn}
zMX{OOjjGy)8BkGNLrTr-%0`6fCn)xFrn`(&Q@M-Ni~hh2CL`y^x(H%Bv0n5-bSVdj
zVn1y<#SssrL{mSIE_;ioFl{$fE}T*a^oWZl9VyTWKZzsP!I4|#;z6IB%T6zaP@gLF
zxr`F$>puR8s6wB4ZQ_PXSIhmNFZ_%sB)QJLNpvod{~Xuc^&1sS;A4#O3M#Wec~eDW
z5NHJDB~$%P+>Sy1GbJwvODF^s!XVH9b?n!4wI_-3EIU*4=@fY-B94du?1TSuTPlMr
z832`0x6%>7;|&i^O!#TDVq_na6{B&A!DW?soZ&g?mvvONtvUXJgnkw6{}1BGPCSN)
zCf^lM%%|PQJ?dYCcmzT*pLXh*QPO*>u}5$Q)SQwpek+EE3JyzcP+uZxaS>Go<K&Rg
zM1AMEs=D#;O-0$mXj5QZoLx<=ae%bvnj~gd^Co7OQMBhz<;)cXu_unAJuR0*>1f=P
zzXqrQx_eL_GL?!%3XLR2Jg0r``0#ZmIS#`x5d4xhlkNY1Y(xX2QZ9WDkwB5ntrvH3
z!GDrPo-&3p*LI<cuo{f?ZqJXcd&hXOXmj=?@ckBQsQX__(_84wJY%0TmRu#UXM*r{
zM)AH({LC~=I3ew~5{#Q&)!8Ue!7*WBhBYS@?Ds73+SA5Fn$|)OstBbH2M+#y-7h>6
zJMUm6v!CYXvhXGU*=T-t3UaPX0{ht>%}aq{xuOZ|XDd%ac6<)tqxgaNCB5o$ud@Kg
z6*Mw4!^{W-`@Nt97dUkqNfaUfS%gTUtn``yf9_AR@O)yKJ&6Jo*Z9zx|8`f7kuKQp
z>vPjO@=#7FTgZR@MD6B(xziA$d=r50uw(+Av1b<AnZa?o&RC#7cQFi4ujg<DKj_c)
zg77QlT34W939k#qRnD;P$|v4>Yh6?HT&~&z{aN+Qwe)bnVBv){TF>h=<dO*rpsfd!
zyV1;eMrZQ*l;0O#BZbd2Q750|%yI2JoVbL}=ySh#<K)P17Gk0Vit7nTHwA<-*HD+Q
z$+%=9a&;F4ZSj*0_>T%_<f+RJsYT<v;@c1WQFgXT41zEay^^4yd;g2oPD$d<w7b*)
zkHHTJ`o!dCtIyDAS;RwhFbGwFZ)wi@YADc?P_;@dqnXdG3I(BR(O>Sewo(YR5vpE0
zmZr@7*9zSU-4vSjB-R`eXl76IXoho-=I_NGt-TKxElprhJcOb}GcSopv+#pQ_bdZ!
z(Sy+@(7^|w(8;Hz(33BgLNC4r3I*R-fu`b{9&J1b720`dD|F`xqtMz<F!9)dIMt8o
z2yy2pFT&ROkbrP>KF}b<oDW|J8|Q-}Lc#e^i|}qffFop^UltIC%`Y|xt>%|7q)Qw9
z?xE`OOjRKll~VG4`^g8P15la9kuGg}e{-t3P+eu#M^za=|7nG<eO=Y+McEnPIt+s_
z^hzNFDEGhEZ&nSbQs?|0;E8Bs?PQ4kM3tP@binXsia}(nI!jP%#~Z3Y){+fXKVP3d
zTU9IBf3+-0?M}&tDpN^$Q_HJXz}mFUFa^?4C8^!1*ie<oC2wj~Z>Sh7OS-Y~c8>N)
z#fB1m%eW!kyD%@x9Q~1s4TataXtX2D$N)aac%=G<vO1w-y?<J_v+gZj?N0fI`u2u2
z!%n-6vl^q|1twlAF*&1<oKTSAUr@Fr2IJmh1dHQN>=Vwx9SjnBB%?Yk&YEMR<6x!$
zS>oDE;lgA76G=rVSkW3J!;@k|!n9>U2zS$U${Os1zKnw4t00sKh}Q6=a-|7xY0%*{
zV344pL?lZj>zq&M+VwFWT$9T>p)8rEVuK7M6YGTYdVkFq&bODcTCnLj5b<czl?eZd
zg~BVk_bZSqGcC!*SrXZw{#m8}&A{@0G>iXINQHH)^ZEQ>*!gfjaxsgrD@*yJ{`fi*
z+lXNp2)3lxB>QhHqJz^gKyC{lWazi{`>zVwLId93DGC-_{8LQgKxy{qik%*Yq{SCw
zJf*>QkgStALk^rVw`yxZcV77I<fEhLL!2d(rf0w)if0}Mq#Gr5IdhOyTLh@s12}tb
zms3?eC4>g___YW4UIe1M0wHmlxu}jOe*Q5A*@k)+4kLfw0w~i$865?*!ZSXk6Z=*^
z%2Avpml3Uf4oo#%&<Zms#A$1)h2o?k#8cHyDp4XXt?*^G-Xc>81p%wj{VxCXAu{!S
z<uJiTXle>*Tvp-As7em5J%w^MNY+Whcobr$n($uerlm7dJ|Z?lMAdDg7dtzKKu-cv
zVFdckd4BlRgeO=h%?%Kl?PjW~crkRc$@dz9&=H8L&%M&YT;ACB?^V!1y2HLbi+ZUl
zXdnUQWM-C}m>P(x$Fp`tPqyj}gbPt(P11)^eIZ%WeRF>ruZHnkRd1-ObL!DpSJJOv
z|D}&;q_nj~h(d3zWT?zth|h|c&>OPq6h;Cxbmew(%I>S-nTt-eo^lfE?LHv>sq$O(
zL)jJJNC<?mFTsp5!~Z{au!-$%;??+o#)zoUf%YF1I+W$fMJ_i{Z4?U3MtkL8zqc+H
zGWMW0_89p1W;K07#)E<k$&=Trpp`4P8+9hvD;T9*atz*^Pg5!4v;aLg0Buu=e7J#~
ztOof7iq^p^AVc(dECR$1_Bg30R-KNZ0Sgwlu=NB(hUCWgqi1HO3?jKNADr|^3mtnB
z9Bt6WMX<e8Iu5&q#S;vs<My>Y+TPSEAQ&^W)&_PigeU<6HwsSfuQkU0hnj>@?Wfgr
zki=7Uif)5B@>%t{Tz&hXSi#~Jww_?fkyt1{+|H$PpU&e|ih_IaHpG(GN`^mzrnE<#
z>S`cJ`}gjQ;}P=Cz>xmJ<`eA7kt$-j+MV^L4fWKhJh?3fPiJ$d$`Kmx*yggURa=}g
zB(xHy4X&kJqH+UE+7scBku@nkQ>aDFninX}qZ)bK{(emfqbAfF*g?yLT;ODTv0fC8
zJ=b)>)+-oJzN$q-5t#J{ohq}cLj0rbjBX@`K_J=^IEIb;Z|q>D<N0f(EdV7>42Chx
z{41>-#D3nYW=x%hXz<uUDc~$qyasLvksqg_@I8t^<%_Y61Oh~!Rer7`zX)h)YkSXc
zJ1KLKO)hd}g3UrHv(CXwy>fRWXzkeQX#<!xiSk6BriW8Y8^m-uOqp57noFy>%I=a3
zxPRHBRyL4n{oMrz=vNz4nN8Q3Wgx5*pI12z4T-s+q4yqySNkz80AvpsT%O=EAjCEB
z@QWG1>3XKBZc#mX)F8=|^_mY+{FPZQjFf!~G`{9b$?Ld5Nm)_k5D;YdxEtVUUTPj;
zsjZ;D_IGfQ=(#buG}Ql+Hm#`aHKZBCQVy|qe^t4WA*Kw=i!DZPtwc^?KL%R!9vLB%
z8B0+7dYF!@%w#u3%s}$pKB+vLvFzr(n}E=hYHEuxm)(rJfwp0~+Wv#0?jSoZf88>L
z92B*Y4Xn1hY;Xfb%}6LT_D2`kz^IYVJML7sS8m{_`#sM^Pn#(}KLd64+UFwpm+2W$
z>OBfxIfg9Ena?gi!D=bCF1LYFn^A}k+d4nukFPUEq8J2$=#|)r2=~9($HrxTv0WO*
zF+qdiTcjCjh%;UYp#PyvrpC7)jng6TmZv;I+Q+cTGnu*Cd`M~c;#&0nTr#N60oIMI
zc^s8CYcsYU9?WIjm8V>bIn_K>9PLx`)@?T0vgC^fqa$;<vUA8{8-ba9bX+mhs$T3u
zmioL_1TQy3|5*Ez+xW<=g3|q$Hg@$UUuxCw?Ew}$m&x<t%dI*<8I+5g$nW-&tKLBw
ziNmWuCC%t1!R~hLpOE{1(M#YTiMiVHRL|x;9fIdrZ;&AZFIS$cPxj1QH6{U!Wf^nh
zce_27l^Ip&ieOrgmZIzd7%|MEh(!k{GOGo`+huG6zuLJV&6t5-LxtfA6wA4>I8#GK
z&6SWRKz#dT`W^xp>c0USg*zX#1XA1v1PE~V`G4SWVUX{i1)3AQ`*1bE)Z9QxWc%J;
zz6*+;ZL^^Xa_Ev*J6n$SjXD=g{sDC<0U*ZR>pXd{BUC#%fE>5kW;HV+QqGNA2~Lnv
zT?*`KvtSz=Ceiw7Ejb#Cc+3ypzD56m(~q!oxq=`BfnZ94ikg37D|@imOK$+Y85QwI
zHNRFH<`jY6JK96-{|%bkP61qxZTXMj-1aR1^juO2q?r|-dl>}ek*c(20Nq)A;f3<M
zGK6vxh;AEE=1sGsh7F{<$KvriYp=_%ksPu%$p%Xw63wF^?mS;FeUD@BrZsyKnt6Fs
zqwP3JJB)S~;MmISIf+LF>Rl-c-Z_fqR1v95iJPOEMuBrbh(_NdKy)>?;k%PDV#AfW
zM9Qq!#f@#+kRI7tZJc!@HHp+%Q|0IM7!dMb<p5z8b!lU24{1aci2!Wg)2HmkT^^SY
zg{|yJ4}tS;@9yWGA40YZ%-e(X!5f!N#(qHWUK2iM@>t5O1Q90~XCP8mJows1jo4ik
z#JgsI2d$Oeh{clsNG|)@#$m5b8R&q$QzfIAc_?>;_r5<FsF*LMR(s9J3Gh-0?zT;C
zeqg@G4796!D&4xf^uDBkRBXYjse_G8@(+C%Ge0t7QS>}9LOOCR>5=57_T8X+|C$v#
zWtSWTldqNbZdyN-T|tt=FbMln2r-8Le{7-cN<Qpprw?FKr;d>YNXxU19a-}AQ|@v~
z(QK}8)sfj@;NtI~P(&vudH8^5ZMgJB6qxviC6KbHF<Dpp5j3miqH9GT#V!F8Xx2{n
z4u+%wcFNrknzdHZk0UblITHS7nEw}sa!oF#`RH#(=0fnSby*-i?Y`toc)%I(`9kB+
z0NyHvatOR{7N}sQFV)a(#wqZ1^cH1=M4p@iKU5C)>@&48x}ZOO^9oW%+tp75&zf;n
z@M)ugufkB$+xubTj`S!r1JBx9b5U$FQ^HR0tmZEfZ)gO#+*sgQ2XC>Z?v@G{W}F0f
zBZX7rL9ad<@T`$vg(YU(liX)7^OpB6x}n><Eb^(ljQfQM1JfFvZ&`P-F_>3jRFT+M
zoKkK&3|awe2L@yY3QAIic0f<DGhjEomWhp)==a6@T3$NS(+|iSEC3vjW|dr89RGH)
z6?)0TC)pX0#<uG*evl7K4u-|yo9nUU(tt+lr5E{IW0nq%y&CKh+rVdiG^oDjNoF)i
zc>pV}-3O%F$3?@a2EE9K;r?dTe<-`6TZus!wo-5@CHpUSNp-UMd49S9Tm(%^aDx38
zj3=6v7tLvMwEdfd$@?WX<2Y-|)51i?-#nXSow(C|Yf{Fn2XJ58t=(q_V>Ys49CDC&
z{Afx?9;tb(e-~2u$WmI}RxU1(L6)_CL|Z~~+1?BeCYSUS@f>L8$H8!%mVba9MLijx
zMPC`SbDOGah~<lQh3n{muEOt-4RqiY*fy}mz3nHMqU6fsE5%L=W0d4QDGS|{)@5Pp
zA9;p4np&gKt>jSFx}=<go|}a+Yu(@<xza?qA34;@3aEl!A=ia`1Czq;tBU`fTAOmY
z*pgRJUtMMcNqeYo2fNj88%rTs=M_8Jk}>IGMi}nm;s80;d~cV@12r9g43ez7a%qlL
zL%|jGK$5j(frhL}SGv6(Bw4f8ZYr<teq;w@h|D>r3~%1He*<GXYa*CPKDEucO$sDg
zyTHvl=dM@psyu*HPcD_vyZL3>(Ri@I>)^qcopwcNDfJvGRm1a;AjO(B7aq??mk#XA
z*oKB3x4gW@upiBF-T#Cw1N#tm1x5~oFl?n*m;n1P_Bd@N{_bBLz()%K8zIRRCcS@O
zB6E*v+qS%XK;PuqE{@UMUx=%$A;tfkdQzIzNX>=`A8A4DZe$Pl?giOs&c~(mbB;LY
zu0T`o+Z?Pui{(0O7)AeO1}t&>wd~fG>i<_5zJ*El-*h04f_LqYT%r^AqmkWH)%+hu
zpmpIWTX%w*!-kRbT!0$A6L&Ij5Hb!z>kMgR=5P}EfC#Nu>LKK6>HNY1BDCVxt*y!h
zM-D@(1KGW}09RRQ+tCi~1o$}Ds-1(Kl0!QI-Zl!(w^>Sz*1c4OsIoSI%Nuzx<GVc6
zZY*0i5os-dJr**(`2TJ+QCjzAQAx6QtUVJ5weEsMT=i<U=H3h-PHUS`-Y9CJ4WsLS
z-tsqyvQBqj387ZJZ0kN@>Ff;y#9Fa0&f>xX&Q!L#Uvada94&hfKP8j@Eo7~oJBK?>
z8v4O|meXcm0h@t^wvLd@xz$shiwZ%z7gzf(-j~~M1Y7q}j&{JG!-?4-uyx?(4S3%@
znvKdoquQ4!RU}WPq>9{bZ9=VUFFUDkQT<cx?DJ}q(SImAqvHre5D2%VprZXZ7BI=K
zdD+Yrz}$>K2lxpKp91sFDQ|l~t-Thr!A0^I<&6lewHnOeA*~dtg%wz96<EL)V@=tK
zU|_Aq>8K<evR}>~$xWMRjc=~sZ;hIp{*f7mu&($clFfFRY`Am1&Ca=;CAXq<BW$(c
zkF6~|BzXBfMh_WMPWbMR`3=XjAAai*())p0?cEE1TX)r0+YBQ1G(EJCeYXbGniV}K
z#WJOC86bgL^F%)}L#kOD12(5b*42rCwC=bJ4ARz0w<FD{ROM_a7`5eDnk^0waR_b}
zuToCJ<?EZWc=PCHbpvY6(x1KAbD6A0Kw3}u9MAshr5=?Gr1h_v{bz=nHUBd#KC|?c
zSq-T54C`Fo*q2N8a~_Ijc-6~9;Igm=YQ2&@4F0;w*Ulr}OO@Nq`CZoIV67Rn0u7Zl
z&m)s4SZj^a<Ej_6zgSrzj_mntvaU;}JQ2i^nrFb1O$&7(4$_*%j5QAKs<B<CglPLN
zxqjpr`&KobgR_=U3mAUIA@zdjjrHm}lbCO8)r02Xtm(s)cenKZCu4l^bw#%l!ys&>
z1}B8<zu1Gm3g_eG0Z^-4kAN}ukFZ|T%RF@5p~sIrN2jJatrMzNF!_=_)hm>UJ8)B<
zNRNH<76x?<T`rQNVOFoLY3p~KPze%LD~;<84G$f~o+juS?U`Z~%nFiO^X~2LF!IV!
z6hM&7I*s$<^6pmc0!U^BNH5L5-Bi>VjLXW*ujD_LJ`(P7zG|@_mr_cO4K&Vb!Jra{
zP(O8}tT)?pog?{w7?%ckYmSVpC{#rU`m&!(EhF1s<!hf|*Nz_hnJANL^-JH*M1(J+
z1~>9)WIHd~1x3BGIuWB<k<%A9D}^CXghE!f8&N!EkD`*n#bbS(N+9;O03wV&h!a6I
zgejjDB)?iuv(I{KNfAauye%$`q8zD27#)hnqLp!JO)AI%G%3P4J<onUnAFGL5G&?>
zxDH<ZulllR(f;iIjLYy|^;{s0buDWY?3A8@d{{%QEB{|XSD!KEi7<uiha8-e=TK3d
zLb9lJ%KModIieBP%r$=L=PfCrfJRuY%yrq&OgVEwBdk_sCspmXoPwYcRv-UD0ADR~
zmg=zaA*_FVolBAgAqWMpB;xn}7aORKAzi&?FNkWZ6hR^1R{~!jJL@l10j$>nYi4H^
ziNq|E9(=$ZX}50bW7RDg8`Syg8g>g;(lZ8<PpepU`$1%Po9trtI$w>?Zm&Rvl2<VY
zuo}^0HQVK_rCg#ARwJwCG`C%e+3<;~m5rx(AvNHX8J(QZR<rGk<%L;C7i?9lMdVUS
zASnAhYiyS-JDksuOMBu-8o1vb??mp0fL8lc%+&W(*{eUw?SqT@nM@UFR!Q$TPS3h0
z4n&!uaODUPPd6FE09(y-ScZ14+-n|W!1R(~-|;b2)1oh0CdRG6bAO_B%B%{E&OvrJ
zH$-U#z{pS~iswocj)M$H5gm>yno@u?2N{rxFbBzFMHvmV#XP<!r=-M|G=mw?)`Nmt
z&E%gfM-py?0{mq<IRqMzZG>>)`cYRW{y+mdo_uBQrWV@+4frvC{@ZV5&;&DJ&rKtF
z@A87vfd(8uWKg!{5(OG?41m=7{Sao<pe;yT@oG$6<~h)S$Y_uxPW5B?MrifL)vc94
zBV|=nWItsp;UM>wLxbi$nEm!OmHiQRMoAKbAP~J0D41~ni>+pB^7z>4JpeUjl4%j)
z_4g>C0Y~uL)P&13_Kin#P3kG9<w5<k-}>t5lxpKA<C0kn(16)onxBgk_4t7Xq|HHh
zsi*wY01b#~uWGIQXNLkBkYgla4^BXY0hVw~yyt<Q$`{Z+61oYtgr(eUK(X$fp7iH{
zz17-)2E+~dXzk2GCL}-uvfZ5=tqb{UBqU}RLUPNbsa04lo3Z&V$GT@V!{$Oryh<j7
z)n+&cq=DmStD+XH4aT~+j+8vrgA7>XYU7b-0!4-4+C1FQA1k><HDthOo~rBdf&3a4
z4H<CHx9qu0H{}J*tcOsK?`z3svamM8Nzwn{N7SJ$Xl9+(=Y!K-t_=kIXm5L`=dPmo
zM%FBRgiChdhppzF+XmgU^n<(*Nd~6(H!|ePD3IKZ>a?Vzy2o2%jh(l=iA7#6`?LaL
z!2C_~K9_(BGZp{?&fPCV#WvNh5e*nn&1E4|3UW|m-A75%nB}t07t~liP}VK~Lq8FK
z0R=E%i?g|08^8cyk;kF>?=j9F%B~~_Vi<&dDFIr@|35aR(%76lng>K(g0dJd-%*r;
zcX-K2##nL~Yh)#Zx1W=pEUjS};3OQjVS{3F1PuesE%|L3s-Y1y3|N~WTE`|{@@YoL
zj2h<7DJ#-^XrG}Qa(`b#3>(fP*N_OSRGl3*Xo|xKy&0YIhv4qJixCvw)2S-U80}mm
zAorOwbwLSZ-rpLrwRXv^K8#Y|S|g4#^jhbX`o8I`l&Gpd0-UuydLZmB=_voUsJ^~;
zdEnPpFWp%ULym7ZU4h|T&sLx+3pi^Zkbyi`6UyaFGVd`rHs9>MMpZwZSx*OKklb!^
z)&R729yuP?*A-RAz**~V(+Uuf<LFsCl=k^FY*X+^0A_9ZAx>J^3$FSy!mN2OuHxyE
zBpty7Ne3t3sYa<$3c#%0P{So^-){nm7zQ2Z+9WpG4|#k5XKhbRx|gO#bptqS`@zA^
z*p^GtVgP5YvO}`1<&g_3aMrG@KZb!h^4!Qbvs6RY2w>J~{V^m;DNknrS*z|nn$jUV
zw*io~Jelg-E>H>_34pA*le(I;a#@c|ioaG{ZGR}cqGX9d5OyWCQQ-a;d(z!U_{z*4
zfU(`JC?O>OJM><IRPJw9@q>D<wr$DpxOv5+_H~{Y^5iX$^;Q<6kOxZ#0~yBItB>66
zx5K$jA@LxGHA(5tu%+Nqki)uzOi%ZBQc#2yLou4|maj}kDvTu7hog4sM>yp}(!6LH
z6>dX{o`NW={SvjQ9ZPb{z0Sx!EDB`ZX$VrCQ9KgT1@!`s(@G%gUe(b<fvi3)K(i!-
ze8w6E&l-WK=M4EBQ!wD8q5nNGLW**Ow(&T0(a0K4(Q{$clsIQo;78Bd!Kf0y*oVpq
zDg|kwK-L%rs`aEDnOuzw#cf1O?`z6C3`wlV9#UdV|JTN0@P?M&<P5o%x2R}S#Yf&n
z3S+$q(yLnYSVJi<fO-Mh)Tz~8-Bb}pPvjs^BC80QjSFM-Hj0z#RSM5SL9F@lw@KJ%
z$PG%hfCvuIPU%*8ql)ExZ<<wgrEZ42oE5@qsc&09$b5BtMOaldww(j~iPg!~oQ9CU
zgati@2uzKeE>#x_g|P0_UTI-ch6p6Fo-yj6S@ZStWY`~JSAZlj2!p<)QLO&|V`uCx
zcylw{1DJMOHzgSG4@}0ZGT6UH#!^}s-4bPLhd)Q492wC7l|X90vGp+r-*)62iK`-1
zST~W76En9+?Jbh7&MPV=hx2T2q7l}R3=rv^v$v?UfLW`i0#>+)nZB-3_=gHdI)EG(
z1O?X8GwOo1e_D|2G@;zy-O5e}l6kYJy+$59YGIAAwj}rGjy)WV{miRteFfmzEebly
z_e!ZsQ`m4Yx@p=Otff(IxLOQ~t1I4r&&R1)V%e+7yct@=y;L}L4^&rIfA^<9o5YTD
zg4*hOLmI!UYS_gHimSh2@gGb?q%2Z{{S@7tA*ijcBkr;8Jk$R)%{b$V>Dixnx7mey
zdGZu>z3D`CgPzd*Dvk>NrMQQE85r#}={P5$-Xz(vPSnejHz=;IesV+%j5P%5P1HdX
z;W|7}Tur)5*1s`*T3FQ)CYrrGel+(2uAqQ<9Wq&}lMbMqfQ-NAB1!wdL$Qj)(<Q;I
z$9;AY(#=|2#<dDJ>VPXIV5yr&3x6@mW@GBe-In=G4yGsxfP+@Mw!l9|wKL_1uPZv1
zAOvA8sTk4z8+))bM|eLez`0x36%rsJFiGPFmGh&h)qwqNyz5Tcj0&T3-lQI7{9mc=
zgCbYsolWk4d@_0&-QVwE<M%KexvVk~`wD(F^e`2-4I`dOm#rG5%zIodt5B0U5Z~LF
zif;zV)zy-UGj(4nid}UFh5XK#M{mh%==D)lcu4Jg6ulbf|2{SrWldBqt5Xv9LGvTV
zRu~WLV)gULFlEo0+R5TqeHmvkBQw78!`XB-+N~sKaMh6k>IB4XXB>*xieK2Q_I}LQ
z59OIu_d)Ti=}<=Pib!5f?j#L-F^SjCld{^_Ecb3Y_y+2A1w{cyn?*G<Pd^@YO2B9{
ztkoBul-dUvZ5|CIPd2BjokR;aY@GT~n0nn{*81358c=-?`D~y}=Ri|jko}iH)1|qK
zN*N|qh)^8sP3QTllf}>JXS)<nb6QG!@=R(OaSb&nEN2tcA^9g0aGN_cRF?`G#rl}Z
z*h)25wXEq|oynHeVe*h1dbK)dbt65wGEN<eNqpD$FLDGBRvTF)>&(le{^am2(MFN1
zD>JN`>Dzbx5q5345d$IYN|^x$a{r4Jny#HnmHW4=RkF%t9$*_IH!gsz!!cq9@=No}
z0g!dC@w7!IRqK+^1|a?vTZnrsDR>B41>8nWWa)Cn$QKUJ@lUU#pod6Sa6bMEAMRFi
z43V59X0PUZw=~xdpsag8j&wh~sJYDSfwJ}u*dcA0H+d)$WnF~E$DK%#hXIr|I@xpj
zVrgD9Xv;cglZ$pvX>uU3k@R9_)$<roskaT7weuNDDM!gC2a;X^hoYD@wFUCeFh{B!
zGqTr$%Z-Fm*89Z+?&-p+ray4j-cs0AbE@lQ#!)oNTR66@F4;ghil#JKFZjVqJ{iuM
z80QHr?7USmX4EgEJX%L>sdf&)tmzlMRPvug<EC*@66N0O((f85Yxx5YeE5B-8VsVW
zoqutP*f%&PE;F)Mg^;|bv9#n43R#DGrM;dmT8WpC)egqL16V!&RI*NEL8mR;+VTZ3
zAUO^M+53x(5dgFf@QkQwRK@bqZc_CIh;XEbszmGnXYF7*i>2{X=cF#91Ne0H#pxTe
zMco0`+8>$QOz^2MGonpNwe$S&$7=iH>xzyj24T=jjaJnC7ki<1FXW2>Jge0h34)r{
zS@XydAUBg$PKHETF(&k+n^bz&3@X*{jmGvob|Q-rPw;Z6?iG%1h^M`*k^e)^X<R#z
z&9U_zI-<5q<56I1?lh=6K}oymnuRnTBwTu^;pJu|nk<b3HZsR>Q47%o(3B1ydQG^W
zEwB~ul!0@GrDca!apbZ-T-=3Ykwt`v0qu#{&VBya-t>&~ZSs=zAFvZyYlOlMtBF~<
zhzx<Pm*lMKEo`wKLo)IEJVM~;@a~#L6B?-7*P?Ec``trNeUH4Tym|-<Yt8UAWb?#l
zDYjXykrTSupMX`fL7}aA9g+b4$?vssq|ny!nZ(sX&P>#PWHAFW(Gnw`7YN&10cp7@
zRc0fw?p9>MtrP;1uO`>O>rG77J8vs~S&>3CCTqsh=EY{kogw3^%+ZEOP}kvMm`%E9
zRXpaI;Q)C^la=)l3H8k5ds}h?{)*}Uy=Hw(Fhw4jODx4@D?}))H3wNoMo=EYE#rb(
zK|HcltM|M%W;G(~kk4!0YOKpN1htZ@DP>6u^g%>c+NAslyMhCUVGy<w!M1SrU+kdQ
zL%ehYxJhV&u@F-Cm@S~#o*>ft8htd%$`EoHX^NZPXkMn_>J=f<>K_};zxao38Ih(b
z21iy3g_9c;t*^3<zC+FCQKv)D`YO*B?7o!sgp3IJ@M|cb<!@{m5lYh-nsib$Zgo5a
z1p{Ky?ZDk-uLl$i$n?gqW|euRTGlfYeg<Tn@7yDAl7a!YduHgl)xcNFHl5&apQ4_8
zL1jXqU_hoV%JrO&f|yt~fL1fAQCKKA9u2gXN^@@-eq|FKXLR<4AxS0#8Ge$Thp2&9
zLr}#L6dqZ$9?N^U^2tDS#DlZokm7n6Fza#dYq?peZWIW!o}np`m725zL&L05JZ_RY
z{>dXCKY)Ci%#R^cBvID<T8CYIg+wi*NZv1;|E&+)WK~C$HPhYze*7F6e~Qz9gLcJh
zRRc;Om$i659mvx5RDT=EtPxM|Y`d)Y)T-|NUZW9qUQ8d@8fA?tM;btW@hVa(8fA?P
zWDuUh(pNj==~6&y#}38SLZhsa)zujiwObZH4YRKLUSCeFKws^0*=5T(D}-;!`oq^1
zWibqbuqzd<VDEpig>EnLXZhO?ueL*k7{VVjmcBS$SRhtIwQd7!DUYOJ?zf@eno%+!
z<}nFA>|C{!V!%Lttl8{+$?eQEk3@oZE#d90Zdnc1Q25{dW+TcvBh(Fu^UgM3rC`=|
zAKFZ>7^bl*2@Xacy+$$Y8bvcY_?~b9yFzJg&f|azFCUUZS@YR!kwJoCVIP95J&2c1
zj1<N;Stmi(>>wUm<8n8n`AF7T`W21d*!U<p)*-S4ep+NarN)Z1N0;Z@gKk7v@#%}6
zznht1AI1=}a`AXV;<OyeC?Dxbz)B+)Tkp!5DTKUY1SIWSUSwT@&r)pXZY6i1XAxrU
zDLU#+?XYUihEN}I6=xGUA7`c*G8RKWl2=PiEkdktrFqOtye?OY7BSY&tjL7wp{ovu
zFJi2DXz%t;xUAKo$0|OyU7l**O9@@)gxfxdHShY$3jN+{Ihl--OaPK~W@fEV;IPD!
zPC(1K$ro=&*e}ThpvDzTG}HD0mSh5ucWW*V0;PizOXzA}u`pG_QDI$JRMyHM+>b*$
z!hXn~cYOG|k{bv@7}gTXfrtJZTY|K4UM?US2^b*8N6qfI&qbMXs4{x7W>WW4Ix)3I
zNM-#jhnIv&krxJ))tv$9>nPSZ8eF|2;(h15?Y#Usjor)>u>Sk&tr`UoS}hgkp(bAc
zn*>)4!|Q8p_4*3q88hto%J)T=@sL@(13txtEZZcz(azlNT+4+;Y_(3mLFD!&%Rbs~
zF-P3KkoqY!wrZ6x+(UAk6h&G<W2<%slkyIU!cx%Ks?iP3N?xkY3Ljo0e8qca<7$P_
zi}jR%iZ8_SDh)!b7AN?y9G_f|PI>P@0LsNro`X&!iM?RMSw>BDL#t_oUtWlStm*}l
zXLoala?n-VV?(PEBgho;!4^T6&ErW2#gn>hAgff38=l{?DC<3>0@soV5fsvoV6?>T
zrb&j^GaYPXoDh*0pH+S=XFyXk_(~NfM}%&@!A<pEf26Awf~Snf9(lY=k%JH<I-B!r
zcL#wS6817+9$FT|OH?(m>T951C5DA8;~s+3&_>0<%Ky57)d~p<QV4V-i3V2hb)2yc
zCF%I%u|LAD06BsXgnemIH2VLK6}DGGXFBNv935TOBw+Y^m^0BudwowHr8bhCt}xhW
zJ|b6kF~w?@&PG3!G_aJz8r`L-WFW+U&W%t6tSZXbRu5KC(rS>$)vPtH$zhvGyx=JH
zB|mqm>QI!lx`39m+FNl@(2Di?ZV$Fz)*yyaeW!=ku(!#R80F2qo)>n&JIU{w6>Fdo
z-fLUhR)AKl;8`bGP{rw>6YG8^u}Iz^a*f4!(^-%ZX3N(}*v!yeTIK{0dE~HCR@d7Z
z;)gyR&ALih&89K5)LuvOAR4jSuTZlq87PfdBeIK>BVVMbub57(Su|j+)Ap1b!n(5v
zujXH@Cu7;!xGdI>!<I;pMyzA-h6;eFF*OKR!9-W^Ojj}@N>|M{b}Z<%N7iD1y6Sdk
z@84lE)F`V)l<*eKCPQ+v!3aG>#?l!TrK-;S_tfWjgIcQnINs)ZtlijpiOk?xYegN<
zM~Rj=T{oL_xPJ5+DVxpii@gWr8tW(Glid_zT33QSN?7%Ki6LW0q}u{$5^%orP#+-+
z@?{dPeGzsBSrUUF5WSL$V0r(G4fMRGT+FN4^@e9UF-pqfLwNUQnR;1W<Y;7mZx4T&
z_v%izvTB*(QQM1ri0aM0+-dG3(#3=-F*>cST3nKjtQv)?2S9N(fA;EQE|nrmtKqEh
zGC#66`gx>PBgdm=r%aeAts;1)UtnN$U<FF6)o_D3e8^fkP+F~Iyf1RQJRJt5)pC9J
zeatsjv3fB$M~+X9X3$~ng0F3w6ZwRiT4-t2*F(FoG9Sv(;sJp8L)4b077Tv)j!iaU
zwPe03tS!#x;}K~eurE2<{WEO+6Gm9TqQkJP+%l+90ropRzp|iQM?h3SQLWgCH2?BZ
zVN}nIN2vL|EK^Ukz#3JO(3@{=qv~T6lk!>YKKd)*<B}H{Ovbq+lr>SMF_^5C*my9+
z9~YVkqhI9uqC4nFqAglrMeb2lSY3Bm!J-e|cjGdvJ)#op&=M=E4MWg~Dn$e=0`f>4
zsf|ZHwN_YtkO6{f-J|AlE3BD(6M2C<haQX^Rws867a=DkIjkA=_^I{TE68CTdv{q<
zm48Bp5wbaXEb+tFwOv^b!myTj8ASh$jh&g5*dG<Z$&D`<Tal$I{q4>o!kRnl%3~YD
zW)T9cxv?~;l6|^^D?os?BF^ntCQYvR1R>U}VIGa18VGUWC&XH?DKV{VZ2bwH8kFd5
zDj(diw=W^qlC|MAdP?@oK5fh8Huy0E{mUt4*?DJRmFk+k4j=mJoaaeCw)lkTs{suP
zWji}up9cxC-aWeJTe?-Rz>Bh8LjG~*vGHF5N3yw->TU~rYKXFy5GaYL)$}<64VDtg
zQ2f`lrchYQBVES^C5z&YsQ9Z{`)GEgjdkrZ=8*_}(7;Eham&bG?HAHY?#-GcLj2YF
z37`KPu-MaaoI#j1GxCvNZN8}E{eduRWHrr@w7V?shLEE3uWiKNvatOq2(#9$@s7?~
zIe&z7Hs|J#EcNbTpB55}(Z|$vSF`_{_^YGIvo?zbHzx||1oZEI;lqxPKQEirLIvSR
z8a1n~v_LmIlvC}Bi=#l+hAF{?JU0&a1VPrK?@1M6HERlp$M7oT4qbdV2P)!myei8R
z8GKmfG;9^ES3*fUTiRvc?HK{zQejz{lK=nPeh534B!)p4hF*zJ4D$UiR@_dJrVDkK
zjTcD>5Me$2l--_@vqs%-yOdx%lS>Ed`*Z&40f3zn*unY?HmseEt~C#W9jv8&CVzj!
zsSnuF<xKa^>>d}6E3}rWh#dOou?{Z~6tG$opntbyPl(crpqsv|==R=3A_;LgR&Jjw
zyAla<iNkTsZp$QMf`H)uCj}C0Vcj#p>F)XS0`93^Oa?@kFW5ejB!-A7V0A|2j&O06
z*1eN6P(e7IKnns{S0iAimLa=K0JEMU%$*s_{<V=5u;tc1P*+n$*Hw^0SNv<cxnSm1
zNOWQKkvCgLPt9a^bP0=2{=^kqD=d#g>--tmjVpvE(P<1W)1iI-$wL$_+i2a&I4Q=w
z(TLZ`<w*2k7i*XB_p>EmR@oA*6^+J+9O+Jaz%JG^-QA(JvRmQ^uGU(SLc~GuusyRN
zk+m>`oRTB_BOwPZhveD4n@LO=69l>>({(>0NeU=725Ca!#U?=oNGhz`{3I~}St>r^
zh8DP%6k5+E1VPc<n@$m0_u53F)C+WFp8@hB>`aavh+!C*l5Pq4C${2LS<M$V0G7u#
zb&vx#KI<gJby0&H`;ad|dS7B)TmFsky9$L%8t_uJUk!ax<AqJ&+gybx`mBMYOT(Mh
zH8F+ZmFD80*%qU#l13$xwlv(w&8enZlIUUM?7i)=CNKea!BBj~3y$N$n3bsIT?Z9H
zMEj5(*K&MWVj;LbpAskF)}xHLOp9qyg0e~{4b)gKJE3G9v%J+dB1zo;hLUxJisKh{
z_avt$6H3<kO=AB(O_p1v*JurR6Hwe36mww>nBv)+Om5BQWaBz=>pSKOs&)KSOH`Vb
zW_4|jyhiKZXAZ7D-jh@fH=|uk#=W?5NKjd0{Q2d`3fYefd$n&Tv4W52Vm1nCU?X=M
zvLsQxHfzWU==0TLi9kw1*3Z!C#~NJCH7taX^*$H!#=b1HODI{#8jM_NSx+u?ikh^s
zhS<y13rdDpB}szU=Q(Y{a1bc?x!k(QHu{9&)jc^M?Wp~8t5YXMN`1nIu8+@Q!oU{o
zA`p4Q0Vssw)%_hi&eF0o_yWl~4jz@GS|Y3Hv#vgI1{otviv9?@wj>Ec5OyV70p<P|
zThqHs_?gTBD6OtWUP%yU^@xn8+8mC~k9x71AnVOy7Ns>5C@-lJFdixfIxw)(%t-fV
zPvz#SlA4qRv))ivX(u)x%0HxmS@$gd6ky%TXNYBukyT@Zu_!&%dYq}U>xL@VX2i0-
z+IIh^nS__7lQLm*@H9BAGOKyb^D=r%dsHs}&FZp3v5u(J<E}5+h<OZ#b|O=rM%Kid
z+);_WC(1>=(R;ndJPvY>`bnzG3Z5H9A^auh3$x88M^H!_q7Cx2>W!=haP&2F6s<n%
zEvsWwktsta$U$yi1FA!!M-^UKeb#d;QQ~(Nq|}w!q-r1sHVfjc@{)^Y#J7W|E3J%c
zBRQ|!CYeUbE-R*1*3vV@3eL9js;w9T-9O|9A$(+W$IUT`O3i4Yrg2Q;mADaR$qjgX
zBcXC7y@oOY%T6@4i>X@ixv7wM=xlTA6~$RiR@|!89q!kc6WrWH#V=M2^9v3ksT1)0
z&fNY^J3FLV;YV%`PaYNal*mg411UG|-FofFl9@}du4gw8@+XO~AHL4@x}g|^!7E|>
z-hZ(|lk)jbHGp$`iERW3@wW_}07u*;Nx~9-q7x8~V>~iFQh)9qdM9j@Niy7#Z!3h>
zo-l!Y-Ij<PJ=Pqxv}w7}Asa#gNi{@&ZccfWQ3}X@&q<$>6rs52u?D;?M7|?Vl4%4e
zt>J*je)<b!JOroJd>2ad6zx&26sdst3m>AzkQL*5a5saOE4c{Lag%5D0bemTsZ#Ox
zwx<@mp3B{2q<uLghpDh0cvRk-O0y<ZqIp7=UG7Eud!x@B#&`K_T_k%)<HKx9<6k6u
z7p0;632pq1ARJYGPlBejJ~^~QGBW33NJm;p)_4@3;WG)?{=aK+fQlD?KFsM7uMpI1
zH$#-h)_l52nxKNjvS%U*oPUqERkRBH&i^Y3B0#d|h|;c>4K}%HLdj`DOD(JD*Vd-U
zIl43m!=6*Ep`86bF3k@&AX&uBMr%thD@0<S5blc+jv6iPW^{7;HZX#zL{oCKs(xjN
zc>9)}b8aXGM4Y@h$o<GoA{j96Gj(s;n(B-^iPi<hbc`;ZW4Fq)_AGjJT+M3o)2ixg
zYy1#)ZC4V7Agm<>0qwuBh1nhASGEApo$-M&#$*(IS%)tINUGVB2z~|b6)n1B%|OPR
zji5VpF(<{QDj|i!Tedp+ZMJ9@L`DWnzP=Qs^M7box989nrp%I0WoXt;sGngw?eWik
zq~g}s@(~cyT|;Gv)*S+j+)h9Izs<GpsoK48XtQ9Wt#B@Kh$AgJ{f#vXyskump}7bD
zk%^b}$c^t<yUiAW!nAi^7^>_z$)+SEt^H_k_=i=sf(^i<X$^S%)LxLZ+(FbT&)IS}
zEy}tCqE^+M3*16ldT294Ogau=g%`HaW&=qQtX+0k0vqk2T5H%0d~i|&02KoydDy-J
z$jt0l#UAewBrO)IS%>yNeDdrLNa))NVROq+N<6^-xL;*+YXh{VDl8E`<T+^u)QTrg
zg+wpiHlS(U&<{GbtZuMAq{Xi&{A=29FZ~u?*hD-5UH|M+khEqyz#<Qiajhzlv{t|A
zlm3>pAVAU@XX-(9jw;)0plH2;Ak<pq%E|!*t&JtnkFw}WbEN1koBOiDG|cGab1?og
zeI^SwKUH4n*9NoN@rx>==Z{$b;p<wm9ST9%mJpH8{x?=>`^X)<X4Z+vUVlK0$&Y5p
zSp@^x<49vYbOV}0jLT7xL%;3d4Q@g;P?$cA${?-Q&I1T+wP;`)q}5uKc{tWL`!_m}
zut&Q|;E1Q)pNBRpa5@yS@~vUYz70rgEeJ5=HVd|E25D`z9fS2ogtPI7Bx~84Y0E`5
zf>j{NS|PJXqc6hP+Jf`dJ%SVSCP9}ZBw0TcmFX>&O*e!C+Q|#F+rw)VC<mCyV10g1
zK6?H@IY6x(y)|sdngK?u2gj=)&9grlP*XIZ|E8ui{edRytrP}XG})U5dx)~0kIBwA
zvp9=ZL=a^S$D>DEd(ovlVCzj<9gMP)bT$DHWlhB~**l$<L=a`Iw{hX$kcd$HVZhex
z+kM3~?%H$$618OxttRqqT}_%z0emx=38kGj(SVbnD;6{#+Wq0MkxbAPcOi20y)$j5
z58mNGyOzi4ftL@r2?HCalCQ}GJAOS}YlL}C-&O}Vg0L;Hn`<4~8ETt?29JlbN8at<
zHO<@~OibC%_6_s{ZV;b5!6P=Un}M~q*Svx*y8p+KUwoZGmc$?kM6V=-pxpmrL*-3V
zu4>r}UJ|tx5Ptoe5zOkwYqLOEtopV|wr<c8IsUmrxlTozkzcdjA)}0KSksD@=E>Xb
zIP!l}ytldf{Myq9c`B04T9*KHAL6Ra)Yk=PMTN!e<$3hCkut%%rS{3?aYKFpfEJ{X
ztdwhn{DAg>7)Y5bWF+cPsjTzNto1v}<chJZHJox(U%RTZ;u6^p{oM{W1oWZJC^xb4
zTu0(k;f68U3M^vMEL@JrOL2=u_GXx(4nX^2p0<e&1ItTPOGAo|5!fMT^<5zca!TVt
z{i4!(Db;Q_;#r@~p4tcUGh%7kWLrBbzo@g-K9m}f$+jkh-D!4QuE@!@Zq)zHkd!H9
z9XGo;@lnhqD_LJRBPO0_y`wls4hR)V{KAR!rj%;dCfS;A%_j0SR7tDpo=DJ)X3HvZ
zLj-ZHdBtECkQW-Ulo`8zGl}joKk8wuX!Tp!qJOEN!C2869Zt>_Vy0@k{=g2ur@hRO
zI}oz+CFza47fb}|-O7r+6Zr(qTwWO%;Q@u9VTQkyAV8Z@t<~A`;-ChpS@TP-6<~xv
zzOF3WVi1IFNt8jC_ICfodrJ7q0;pA6hXj&u+OoQwg~9qNTyd`6j2?Zqd|%j8CabH)
zJZvNv%s5+tho-44Yi+?tph4YtIWV@1N+GRjb^sRfxYJbx3av>dO{jh9qOBEavv$kt
z*x?LUlm*GF34}adBj^uMP-_-_fuc)KWjc}tl0-7A#eThvW)fBxn|st9jcaD6$}hkC
zd&vPr@*aAPVOs*IHGX%hzt8+2*#8Eo^_34na8I4KhB~Yi`hhT-G9W>Kw%*MKJfd$g
z+FE@j`YiA&Y%q>U6kkcKXrk{-rE*H4tyv9))B>kw<WmZ5y_-97_~U+_?20G_w<b@c
zO&np-1+Vbd+qK<VGiJ(@X;w7>Zr<~#=%N4tffSYNL@wiq1Ofub0wU4(g&9X75D-Wq
zo|^9TLt*pQ1O%eBW@FOr&5*X}r{%iL;C(AhUZ;ae_sJXyrx-B#0YBOd<9(~U&G9C@
zp$R^*FaWLxMRd;xorO7^Yc_IJL+4p+ND6Sh&xgoam<!!a9bS6oNdK3YAWp*SSkh1O
z_s?UHm_R`w)#9)#>ND>9C+u947zRNge5HU<@ctL8rc*!qquT>8i3!7Fh27s~w7+qa
zr{;#>)YC>$;6qsalA<ea;H|UBIQyoMQBDHhTCn`(k7n|(!JpS6OPX>STo2sZazF&R
zTFaDmLa^33kqB6&p3ZIuZr!g){4sgEVT`sWZEPPQ`_Y57j#Vl__uQLytTNc@z3l6G
z-12GY3cR7Xj~cwm!WE*{2=eHvc3u86=F#3-l%K{@LVX6*np**)=<i7{hNm^7Q_Amx
zLFLf{wcfMPHt&zB-VySEEMm0T<z0`#9k7KXxyF5p6Jd5T%{3rK+oO^xPu3CIWz?(X
zhD(&$aglpv3`YMSVKQMB4Cr+zAZ1cZ*d+$V|Fah%4>k*FGr2H(lc*LWtr62pP*sZ;
zZp^fnt9RcDTIzGa91uNQk<^&duMWx@ZdtnDKOYj5)uZgs*>i6p%sTrrK$vakG!+fz
zsC4WN3V<Oa|D+a~X+?o4B!qcz))h(H7l@<JHcNTd@hw*?_U;#i;1^BQ-otQZWsG$+
zBS5MJqGk2s>x{A`20<9QC5+nY{x|ky=8c!HEP&J2+JYe@D%Zk$VlRu0>%y$3d|725
zrzw>SL+<&(Q#_f6M%_jVG~=JRcwO=*rd^TJ`W=kaX3NcnL0F6;T$>_bb|n{o$U>Nl
z*Y>9sFrU9l$NynjESs>4v!=q#rp!tQQ5V)AV=`5k3^qr8(8XD^$SuIi?(XQNi?iks
zx+rs-1%uUK8nH>vioE_Fk@Ed26#ZVCtsvFPEY?CLI-d60djyLg?5*VC+RqJEYdR0#
zpJciL*{hLlvbj%K*oB1FI!DQfn$Gr2QY!}4w}snNmd?FxXswZgZ9fgF^Nl)WSI}B}
zNp7)QY<rWVsGgwIcMdDvE(zWOIB1<Sy*<?EVyz>X*E>H1Te0dwtt*v$J9<}^L?spL
zXPD>b{M4I$GNgRFiW&CVpKkv{YE7Z6t1xj&U01{lQfmru2<58nRs>G#M;e+bv&Z4O
z>M#~do9$gbsE8{T?UI~XbF1G$;~UM86w|Re8z-y}_xQ&#eVfftIAKk(vDV3PVJ}8Y
zZxVJAhRxZiv<@U-<{x2aVB=5-!_bxZh7j0)u_LsNQ>pR|fT$?&N#Z<vQ)Y(em}NmP
z%1gzAPj-}mkk%7ZXNt-8R`@A^^neJv7}RuCQv&G$eq-@Zhj%=()v!@;C&W?r*7R&f
zCJRN+BLFaRAt#-%H_7UesFgp`i+n26m*X7IDQ9Dk&7@~&U}g2+Mts1lP5(Wc#0y2+
zAl-m_nQf?cLV#Xa<}1;PhFjPb!&0s|R!hC8E`!79A5X60iJTQO{<d*vNpI6J<lMya
zdtqPn&CDjY?()iFf;9ku#H);@moaY<FJj#g{Hg>KGQk>Pxvb3vFkU{!nP9b7lJ?WQ
z{-^{3sAvsDVlj-C$s$xmtD&F{<(GFB3!9z$F<`c;Faa821-6PkkB~A<&<SfbhOp1p
z>%r&hpgFal=v+onnO<GNBVkB+qG!1ve2UBxWN(*ehUkD`E-*MWsS^Ux0X;g{3Z748
z!BEfvyD$KDhaAO+$SNeArUOxGSyy|C`|U-Vh+&<2Pa}NlB7DRsa*RL))acSJ8laTb
zw?CZipM&PyA&u$&Va<Q;kUzrCFgs!p1j1KR*eKrrVwJRykN)WN0KDu*B{DEG6~-v*
z4kloI$q5`QeD#$rsU(ubExBrtYt{~$JFhm{-(ifh=HID9^Xwt>YT>JCvw)%4dPyxJ
z3<g&E&lGr>ZpSLDHp%_8ci$mpvtt&YCQ(-HO^>{ssIUiBZzj%tOW$0xLRfFU8Q|i#
zpp@lPuuHs;6TDTa2qTevw@7~)j&sVpc!8{uHGs9&t-Qn($a+seGYeeXRKw8<WDV~;
z`J+Lm0$DxX%pR6a(!>latT_VZq<<LKh80#y`E6Ev$zmDhfaA06t$F0b(7Q5(lUy2B
zm@&wDw+LF`+x5*8;ed65?_u7R<?Cm3<TGb9R){)mj&MNYxeLCdt5JF%G-@_3Q#<F1
zmkKjlSKf?2<S(q6H(hj#{~RGXIS#^lVmGmYqonZ7(P#bTEN(-;4j5P?5Td>(Mj<|4
z0P9^b<5-(4UmbPU(G@gD=3^Ds{GZ`SrWlKQABYC{WE>z_9zqW-)vfAbX%<zO!=n^T
zZy2Hh8)f2~Vr7TkC&<|Yn0u4nvt?Lw<@E8z*R^F?41%yNDG_b=zp(*lN|>K4fOF5a
z)N07%H2Jyu_Ja6o?5fO$$t)qclC<z0OdZ-wT8$Zqug3GO>%xwk(4$(5_^Nrq2buWi
zvZ}{Uv>%&GVelw;75>s_GWl}q5Q%?O)+$RVS1u%}thnIk-vw4$A>VOK5!-nfiQB70
z+)(K1@i7Ml8j_<3<1BA6H#dVx)L8^%vaTyG`jC-mYPtN4?EEr>Z0aKn3SQmu0x_(}
zZl<d!EA%YeiBWZ14jfVNYD(#e`ivvz<|ueI+5J@(Pumpv31E`E)3bBE&m&u_@YTJp
zn6EIVSDlYh2<y%{K@<PT890crj`MIMUpDoB<3{3>PD_?ja#eQPSctRpE09%XoaVtv
zzlra>%Q6mXsPvj}*(2n!rXG-JuH=7%G*%yP{jqpKmpbKwG*+C^+*l-_g+f@PSJ3RM
zZK+Eo$YTBF&XWykYCmo)*1=$~=nz+AbCAWF%3_jVO=aE~7Nx#+Xjyex-KvaI-?7oW
z2URTORpEUrxm#>{ylnEL;dIPvCg&#uV^sGOVSP4Zfz#0U<8u7)b#BQOgdh;z(g+H=
z|BVH5lR17Qy#PwenNq-h{2gYH2+=6W_QY0y2{YDxHtqR{WpcF%k391dqn`4vM>QaF
z@ZGALQcOojHlQs=AfV(?8U>DQKvVhnxn`tH^708E<LZ3XGl;)4)@HgxPzvcCZ4QXF
z_7O@*j5%Z&=%UBTvATBka_IPA#pk^IDagZRtAP)ePo~w4t{if;2?Phz%SNIoTBS2)
zo%zfw$w$4xIts0GV1v>Vi6eJ1A>`v%(L7UGS_dk=c~N<MDgVS4y?~H!pbb}qOcK=q
zw+rmw0*NX~R0Eb#TbMk47_+tl^(I4!Bydcysx}0&-_R4e+S}N)y8~fWvB@wX0dv@O
z+em>dzf7<W{_b^<pC!YPAK8a8X6++SWK6K~1ayRW<kN)Xf|Yyo(HfAT!f?T=+L}wM
z--=a|xM0<_1ZuW^7<t;gbJi+~ofoD3J<k+jjuphkP;EH2O!A$x_P8H~vM||@GH0#+
z4lGkx%43T;tA9)>f9-=p78lG}ZDa9Odn#oF9nFBM=iUZvx61T?Nq+HlZZ{OeAPik8
z;SrMk7rW3aVZJ;-)T&JjIOgyz8~xz7)t|aFJ3rS49C(S_pv^daBoF=IUD@PzROYu;
z$gFu+UD;QAFb%(uS+k7l^7n3`J$ee6b%l0=K%I-winL``t$^4`+B2a#4u}CY{u?e3
zqt;CwLhGK&*10qR1v4P;5fqEeG=jc0?2)A%qpJ0nnTZX|fa<CRN9VIqkY(uPd>6|s
zge7T)QCNj2Xx6}~-U7Bv(b*mNle|M6p9W}v<t_wA=St8=G6oC8kp5-URc#;fEK)Fh
z!hO?w?2P1IF!YZwim%utw4#kLGl%u)bHvQWd{2=6W3!LcAhu=|1d2uIX8q>|u~jiw
zqvksbT?MUGUPr|6M{5)tTI(I-d4h7CYyeu<phMq7VSole>jqdZqwf{E>Hw-fP~aJT
znfhj}v}&=UW0X<MgJysRj0(k<(<4>G7_4=pt0>O`h1qaSFe%*7dt0;Q=r(Sp^}L0m
z*$Xa0uLkspE6(dFQ^;Ur-IeYGVizo}Fwj}I`x*{F>Si+7Sj%6FK)>lhgUL9sS^xjz
zkFayG5g3GF=t>j<P4-{xNPFc)I>|RcM9ViA$9|a;$~pIC9RFsK1!+wvsL6f=L-Pr+
zbv5O%)~$oaKLsuy9@eHhd~LvpM;>mb29j!QKn-X?W0&-#eX@s-DKw%aTKgPUJ%VI_
zLyYl0<r}A=7_b&4TRzeoK!suMyOW<Y*r_ih`|)feD}@8g98o-aD^%7fIIBrMyaBUX
zk6!o$|1?%$*47KsH&qG06`=LPxHT8N%Brm(t%y#|1f5h+FDk33M?Ltd3ZrDA2c@ZZ
z3^|Pp(E9q6e6Qy&zma?uh53BF3fUGgYojoD-`&=djd9MbMTNEBdS5*-YgUU|FTyWs
zp&7a(-ng9an}ZxQv{|o-dQ>`a$ytmx>)yBF$?e^;$uPueMgtvRx0wvXO)ti|b|ng}
zAT2|i)sdLr*CI)sGF-6Yjv^Pcrb0Ok7c5^FIc|c3YF*=kwSNsg#ngmSqm2ueSH{)j
z<*CA=d?dxG$!ir+MJeDtJ`Uqe9`q1dqdO#!;R@n2gaY;lLg(1?Os0Zhtl>Op@36nG
zJU@J$QI-QC2n4UBV>`<IFSauK)?$D90K6oV1f+%Pe_>2Jk23$dw=<J@1Sy~oY_!wQ
z!Im{h0j)s_c=GYsH(3BiliZ&!z4p}r7-`@OmPjG{1#n=UlTN5x$IG;JDfGH1%mqui
z5*q6{o)xB+$F~TXwU^#7xsf&_uTd5q19kRu%`{=G=gm^-za29dRtBCsqV7qaP8`wV
z+IJTz@_p<TqE@khZj|3s@~nV>%-RcfM~QB;VRtwnLN8$}oTegV*0zJ)j*m*}!g^sG
zuEOecX3me0Sz9X#g1x`eW+YyNYp=Y~bE$RLMPJnF6*iG<_I%4g(>V(^E8pOO^-4@`
zX8Yj&qj+GQ{uAcl$wszDp|Sohxc(XLS~9ngSjP;c!I3KiCJc!+DL7?L`mw4T5^JLF
zSeS0UYG0A{lc!mjPP=IrM(aD*?eoql#@-evXnk+ZUgz!FGgHv`7FWFU$>g8oi*+9>
zL+al0Mpt58X>bG<I=W*==}N4pU2Zo+CR*J#^-&J3SVt%~0nC>@TS52sJ5H&rsl$c+
z{ziWIy0#<<LJ)Q(c`4riVhg=BhOZoe>X~j8NkaHwlvn1}t(R2{0VQiY1SBR-T&4pF
zh*|5aIUc6e1~3*(M=qqqUr&{?u(w94G=FO(J{Kbr1>>S`px0~epv8GSfOY4;o5F7%
z{66%J<S=D=kaH!;BQ)$KnmofedAItRguyK!fQ@K2yv3qqaOcC#CWS66m<81S0q0m>
zZPTZr$yak=rH3A@0aw=AUl+WbxYMV>nC4s<fovC+GXgWPT(SP`bYaQDFx^)q0mJto
zAr>}t0dO~O=^8r^1We5~A1o{_VgqW{CQk<E>+GTx3O3IHU~1phl7$VX=IY>lY3Fl1
zl(l{#AVuZ#{sJIt&y&sJ_sekLfHCVbPyDqO0I{&4cpeOY^ET{geIRT5(2w2r-GoS3
zLUQ5?ho!F9S=h@pmA;2DlTqjJfH7+&YIt)r0mfd5K|4~1FbFn2ULgz<Czg)&A4Zp?
z!2|q`ZkI~MPJg5i3;cz4FAAxL;UMufn#9gxTE#F}fQMk1-fd|N3p==3jP}pkZI^yF
z__AI>M!a_9kFayWjUa?!=#^kd_}u?u1y(!HQdRc=(Xt~5#Bpr<-x#i06I+s9(z==<
zUzl}2U)M`I?5Az)&NeV>5vtrd3t@kaC&}@XAuOEYW&*U9fxE)4jO_gz@ZxU;^r}^j
zZo_E#Ub8qPo{J5m=i63e{<c}DDUl3_i`=~8;m%$8$q+Aj<c#O_MmJF;k}-u&nRetN
zL0b1M2nlWPPRIF4kk+#$MTFN9%2Hggx}X8W8@?t;Yh2hK%|ZLx6&I|}iTy6}af7=F
z)Ov=%k)h7%z@G$att}~<=dyy{3DkPXHKIB`t6d}jNtarC%`7%-$=-s#wu=qBOGGrF
z76Bh@TO&m?pw}u|qG4}RL<4sEsiK|STz4oD4cMhT?6v%-{OZ!w3p!uD_>|BEB6%JL
z7t69wd3C`WMFtlw=QB}d-9^<DvPAWtMER@(DZn;uas_K`t%!H=?Qs7cCVbX}2X#6d
z_Lc%`jRv&d>QO#%VWg5;yX01Tw_$=6AK}jL8m)6p0<|84*&(`X_9X+<y36^cU*z}M
z{^9G~jw}XY7}^pq8|c5W#dl|N^rZqk$p9fnHb)u;Q}O3b`oZD4(}M%4bqmC(%%it`
z+JVo6z0Rx(nhm4$yCefDhPm7BAO~c>V2NLPX!orn;LRbJw-|Qb4#nR$0Ybp=2kuX7
zjk;+kHry6i7_eF2P{P}2)3!^;p*8--RL-7_f>E<3T}F3Xr`R~O2ecJOc%8>SjsAeU
zNR#`x&Cd4aCA)wJYa~q=bk?^@INkT3--`*uyETLD?&X!P*c{+l7k6yx_vlpo5IXCC
z<g$N+UK2%1@;>u{0O3<|g|p62II82GJ-1yddm(rE%MslU|0kujAuj0U6lGtMjpXj6
zA0eB~Er7G04&r&2QJoq86gX>_+j?(xx(ZQ3XI)deA9{TaE=+Fg!AZ&MeSuT(teq>y
zCE~dWNc7gy!LXe34B2eh2~4Eq46pxZ<9D-IlleZjW=HbdNy?aW<BMnE?FpW>jBvTW
zzN|HEf@dx18fQ-LLXZfqLq32vhwk8zLT6oxF-DQ_h6@`&UB8rkSDk6QsQ)$c$Je!G
zSqy@(Eumu6{cmi<J0*N&0i2#%i-37N4l~ViR**?mloyH_g%175CIu7^u%E#6_h#}!
z5IJu3P4%z9+^Qihs2yO9HQKwPQ&F6e1jUAxwQTJ{?Enj#W7<@xd<-hH-eWp3JgaT#
zQUNNn{?J4J*<i|12Rir1q>xll5Fx`x*^N|gI7ixxgDzOrOJ>=S$_>b2>$r&&r#KGj
zg)H0&R!sL}Do`16)_NP)Q+$fhRmqA@dd*>j?ptC-k)zg-`YBdEO9CH2JgYfpZ?_MY
zxqx`q_8QPHUzyZC!l1zOKG`xOC{k+mDa?A`C6C@vNRTT+K&zjzC|nYboGNVcGTf6n
zdOIU&ZwCTegLai+EucRtjJ<E17*tnjLw*3#Yj%-z4bw;Uvkh937>c)VmsmjLs5NBN
zveVnvTmeszqt>-Xk=TywDD`emyT#+=cLXv-J}pbu`v5C0$r5M>&RUEA^Rljk=>I%O
zFt}l^x*BlOddtSv3v)$gRvKX0^St_&|CLfAjIK4sCM4{iU9Kaojoc6S$eyY_!6aaD
z@~ZRh{}Tn%A7AH|B{2vB(JdJtp!?t0grtYdPig_2v}rY1!maNxT*BjL7Bxl{FdI^9
z^zRhHxz4kYTJQIWZ+9R&)FMS{wZhIA;esf~md%{euyU2w(J9{~F5&lqH|PJF@@CZ*
z(7bhWyBi?~%duq>R`f>ZAF#$y4NivCdVFN=e=j_jX?04iAvVxV>!vzv45>Ay1+Iiw
zms1j{HMk4pTJg14Vch=q0=o5Sa*`mmcC1=F$VM`%7%l=+aEnS`6_zP$sC#6(OZu6Z
z!9=^yTfG43lt62#w9bC$@$lzTMTH$&-dn-nNqNdrXq{mrT1vJg6UQ8ukt6*C3UA6V
zSVp_&7jcHuvRc|0VEJqG`)l61j=G^XEU<PP9pF;eNg5Vd_7VZo$Xu;8r_|`_VEZ51
z9P$u_(Aqk7G7ryMz7Z_2W??B@ayvj~z1k@#k%ztU9fkqcp*$&MJek;`vfim&fsy)_
z&mw1i^_4`cG#NI^O4|@4kKXAv)r!Sl#{+JoCddY?7;w*gT9XA^wlSPoXtU3eTaJxg
z<e)pd_iq8`kFayS5f}zx@Ji%S2>UN~<W9=RFW&&DqG=Os9P=9n^xgh3M!qUo`80;4
z8Ez*rO`3CiG9+zmHr9ED+<g+gVj51L^Pe*VO>5e29KzP6E;MU=cs8%^?&B(qdZa$Y
z)6{4x=+&(L(RSIc^J1KUxi^Oh>9yyNW34@EkH%-oi#d)vYq}4Z!Ie5QzL5N$?xB7=
z$&3datBrPzzW}Y;`U8&DCLSrZl}Xp6u;v90&r#4cRl7Ja4JaUkg0R+FQ4fJ>z;#n$
zwF@5}6$Y-^TxhG(Btz!LSJEhp%I$NR+Y<+@Gn(1JSx4qZ-!}(lCpqOf+OQ@LnD3|A
z_g0XIdK7Eyy)a(RqkvvKinY)QGe54nMyb5wQLO94JQPe49>zc#kT_&rgrn9BinZRr
z#8Q1qb|f$jC}`5Ev+W9a1+D@48RiRhOoj}j7RljFb>d6rb|8$L8@Si5PrgX5gxhK}
z(_Pw61uW|wEACC3s@hip%UaM5W4Wq-mB=WdS#Lh%w%lacYMr64l`&H_l%mnBgJ#)1
zL`~*K)Avui_`}y39We~TFmxpX7{mUH)#R>y>W>ECoP=PEkfm?;T(c9<;XSY3Ig73_
z>_ftP7Ua3A+-_4VoYtAR(7dhoHX3?phojesY!0zVIIVNT&7Qs4JPxH*M_mZbEmC2$
z?#_kkctKY)OuE9kPpX-=GJ=T()@b53*Pd`k*hHYUqhdPRu#Q8CKI?^Lpn-I&tC#|_
zo<lia#khme5}0+(Y?8KY?_vV8#+(>X*2CKm3CvoHRHD^!$jvq|YbPO8D4$xV2t7ZC
z%I?K8&9EWEpcv)*t<10qR|^aIQN>o+Xu=E-6}3u{?tGZwtoLvZp&)wNX!K#7C2bdH
zFFTArto<um>oqMnk}z6tn}Sf|tzvM(XuZ8GLRPmP7a2kfI1Se4wk_`&LJT<TZ;`tF
zH`r_@+RNiAv)gz3C6c*>Pu6`ohzr(RIf{0GoormNrnnAWVGA1!T7a4shqWTe5dD#d
z8;z&ipFbc4RAIM-C}(&2)kH@`_;n{7?4QW9Mxv@-&uCpx5_#6EkiBK9|Dt{PIs+Sr
zLKueb(h1-PFxh{xl3yLRbdm>%uHxDt9OwC8SxERNookhK?5gCZAuqMelx|WF(pjV2
zq2ipfeRWA@>mzIO8QqpavWmJO0Oqv+wtLm=y#}F4%jHgBaiBNnMOM{zt5cl;I-VaU
z9PReLr%V|w&w$K0VS$AJEzcm;?0iVO1&XV&MyZG_L$g;6`K(2^qBCF(+ac*@ZG#@<
z4*#mBnYBqmH7exVef@<Spjmni(;uX0tQ}(SvJ2O^D(ia#ax~E`uOC-stzj_)L6Xjy
zfh)7d9;;D{9O29O_TAhtt2j#g(k40Jv?4OZw?&YE;DB>M(F2(8dWtEdE&d0l{`+HI
z4InvSCbw{R>(+Dvk^{!uyYJZ7+8#i1zzX_AkumJ?E5es8GHiShk_6wxlpUaSqk1Hb
z0XwH~d#2OWk(AJaoabu)zD#mk2PDkU<|>19))A5FL31mo5ISqh@mFZ3Jrb@?Om6d>
zGqn~Ykj{Eu$!e5)toTDZYpv7rr`@c*6r{7BUmF|Ac||#a<TU!vm#=fpfe?g&@RdM7
zr}w|uQa8)jADcNqqY|w!oyQq!U`V%D%1S4MJ8Rt7)a;kX!L!0UU_T5!QsZ(*HXWRG
zW>VvU-ogu9)j-jr)sE1bEj#lX-Go8x--bm4L=sl|T^*o1GF8Tvfuc2HrtYx&YLSE$
z`^d0}2D8RVA_*&Q;@qCr?Mz7pXN`#i(q%=^>iut3nrpe`@8Bc-F5YIB4O3NzJt9Pi
zBXvE~m7(U04h`hhZ<wlu5q_a_46o%8L0DgC>37g;*6c?m2<sw9J1t}#h#-L0If&i5
zG_75^09sRJjbD6sbQ*!PrfX7_w>r+7z*+Ye95Mf{a>M`?I_qG<KeDN~g#>5aALS^D
zQwysLoVBk3JR2|f+?0W#^;MKS-F|DZS)*eO{p<yiU6F@5Lo0KJ*O}0i6&l*0A!l5a
zy&5#Mf!|CTFWZJZ3RSWEwKIRwy^#lJ-CHJRO1T$uCrcHB))$gJ4(^tPtWgr6p;+vb
zi|@z~TAyzU+V3XqVM7pFSJZo4enkovk4o}2n{ZW6X~;~b=ZCK|$&C;OqUcp3E)d&z
zC`;imQ42*awXz5ii<~|#Gt`I0U$Xev7M81ct|8M%Q8_uQo~)KzrUj_j@jn8Jx3Gsc
zNxDU%!;{tG>qgovK_YY}sTT3Zo8<^J!b$}q4h#MF5~~|9dT?12y{(ZL0dz$0bSt|E
zmuP%M15JR&P`B=+tZlRsP{wenMCiE~VUm&)9nDOQOOPYk6OD<?OpTTH@XB<FC^@*k
zvfFc?gnD%bSv4ixs8*&(R}y6CIZGOC=9|S>2td{ZIl|2lB)T?(tOY8$1P(q0D65PX
z2;zCtr~qYc-ag1^tvvzE8mxOn??%j2hR|$dm7FU5Xl7?Zh{hcPE#W9uGoS*BEIHDK
z%#s0)IOsn-(ob!Wwe5W?o?j#FZYtOVD+eomS}Uu*BS2Zb;Zk*BShTGGWpy=XNZF-J
zvqMDxENqUH1Pegc;w&(r&GFpCAMYx9KIUbAe$21e^0qwx=4nXUGUR;w@6Yq|`|C9y
z?{D9Bb<?1>VfE9{8#t_C8oa;kiMz~iGCeR<)**M7T?;_nWnq&AwR?RybzAn~648yj
z?ij6Xs@u=tT@^P~PefB)2<{MGi>Tj)X%p6Cb&3b~)deEUUG~q|ndL?d!!YzNJwaqU
zO?>~0wWde|9-&0P=8MqwtW3P+3uj+pZ@n3(z3ca-?{DG5Y|31uYQ8R)FQb!}dASFy
zomakm3a5$?Dgt%qr`Sr#i3)z<=8(+A79n#@=2(PyFBe}Bmen8;A1;hRd}l8xLedh1
z?Ah_%)=}buTl$tRFr5ZZ&r_yFNnUWCDnVQGcL|zT5*h5=ff8GPSVTJj$xJV(oonGm
zM{KZyf+*+uPlPDvu=OA}xaAm1Y#4^kak+xDO^(o+vD4$6ZDJ>s*mWt$e-hgS&-&k-
zVeZa0k4ep<RIj10n9|EJ{B2ts@xeMw;u8Y>@fL+oJiAW~MR~cl*o4o#cMnj0))ot+
zBtEo=RT{W@*^b)Y$^c9GF~eV!q~{jt_&PMxbG*Zp-cNekq_eryn@^4IO436knw>Q;
zXOX>USewKLTT{}e#$~Ll$c>Wt=n01jAZFHe*G_z}KLTx1m5lRvWD(vH64-SJjY9j7
z>x8H8yy62;8DqF%+0}cPR!m^fRmVVoRY}o<Tj}VlRnDs1|2V=`a*&?ErjA!`>Kr?R
z?2IPeX3h?*(S8^?7aM^=7>2IIH-Y^ZI~~o7M0>JsfCvbV?NDgM<wQp&Ro3!=cNSnR
z=+^5X;uARl>$|efLj(~BbfAw~TduOn$$}lSnpD?a?c;EiprQnzymvX(1z4HtC~3-y
z0_zCq7`*)asQHmtxg)bc9~4$VXPe^48OVWjJU#AxOX?GcIc^gMh`=owXC`o{<FYcT
zTh+!yvM~S2<y8vS1UG9ZR4t(@N3>g9kEVvYZdHymfHPTS%OP9Yayu|Qg}ORln?qgY
zn2?SGa?;bMTBIRZ3nO_xmp$n*RUTF$Rz$LAWS4f(@H_Jz*veAqv5p@kJ?DP#<0QKr
z62A;#wciJD;RhuOEbvns^kFq!i`q-GdzI((>OYGFJ&5vfDp}5R(MT}QY<Z;48BRH=
z{CpmXj#Y7h(~j4utmm<3G(E}&IIIKhoFlr(jSOt?V|qxO^0_xIA_F=`;JMU(0+;k<
zKJLzLfw+4A8U7PDMMGcYR0B98y^iOYE)P1~A%Q`CBv{*@4Z#m%=b9@a2t(m56%c6m
zzp+Vxug<+BC-Yw-*3+JcMsp<wog2b9uf-L}XWV_2=#hlw#`wU3te-9JtCUK>K~G0S
zTB^@37eZQTC+!uyRrREUo*3y}C{UM8;^aD~M|?5`igc6SuK>(IGr!=Yl3>W7W&Azg
z{@&7_b3+yf>@=`rNRMKsknRUN6B9ZU0Yk1s>|pEY<VTvbIKX)c%Tkv=s-yv7;q2G(
ztdyrbz`;naR|7XvWyTh$9nzh$zFNHbO79hi#h_bW_mHbpX3-I!TxCn|+N5_4^iELO
z<j7J?)@R;nRQ9rjYaHy*R}(cDvOD5HCo+XhdmdfJg2<hg`jhygbScfZ3;0r4OIVQ!
z=qxhl4&2i`xksja#@qpTDU^EX&B9vN(`O}z=*-OyfF^Eozo@!7*7bJB<qGC6u3-Hm
zaDf)BRA1vO(^K<*2}UJ8mD;sfpg<T}n8}zDKm^MVJLOh}E)B^t)U%$EA4jMc*4t|5
zT-IREY}t8&(ck23m*+#+8Rj4if-&?;mN9|*UrYsF7qeLZOMqFReIMC=wM0Jf9n8{*
zuwFWU)l5b-*@7)I(&i}9A9<wh+t<x1*;*mW4LP;&+3RY>UX?92#q^kDs@N`-I8W$u
zWuo&0p=qu#V0&0x-3O)~xzjBnf?6|oEq@x4w@eo2edO&6qY@y@^UIoZv?dERx;sIb
z8#$(7V5BH_0CRO9ZT?%1GxzBO%vfq%J}o~ZJLf&#^|`T~ETfK$nVo{H-CS&fGC#{r
ze`k!rf-*M}^t$1>RG+t6FtfZ#`_S!KMu%%$Y<{R{MB61eGjXQd1GQYngEPz2*L&vq
zXO?V4IE&{cq5Pjf3o9qeaQ=?kI~?4J2sr(>qVwa~`e~jd%r7QdftlUoIC!q5#2x|7
zGHJe8THZ4&>VY+PS5`~*Bd}(f{28Wxzryj}vff(y<WzKQz-F;D=bQ89qs{v}tXZtD
z;c$}qolKhtB-S<35%mLYo)^njmlj@>`sepAM$Q1aVGss_UqS*L^#6}FV|S0%>74rj
z4+bCNv`2C?dP}vypYzb>kU?m&GhVX*=bUQa`u?1LP!%8~L^BoX#RqlnZ73mA&*+nD
zuyfEbECn6uYY^Z$1Y?daQ<HvBk>~G0OO5L6etC&Xr3Fet`W0Gt-EyM5TM7RpPWphx
z5U<p*dragxxNAYS{}Am1p0DocOuf5Ux4*!Ef|QapDQNkZr3g)4wrQ5OAOM~Nn^{c@
zJMF>>Jk$JDZXV;ONfE*n7ap^092lVIzrz44S>b1Jcg22Nzd{HI!dl8%fB!4V=dBVH
zq=3IEPVSZl2L$^3{qXhZ*i!I!Sr8HKt2RWmDQ&=@gF9EHCa_sn8ZVt>crQ+eNXzB|
z44qTVQ}E&8u!lomTl}1;4tw9Kh(ohm-h&Rgf2)R<3K8~Sq3am_lh)0j##DU%U{F{4
z5HCgEU)qb!q7iSO{}V4T`e)R4h=2P*r6YWea7lW50*xM6#xF+B1UG^Z27+J04a4#O
zk0n}d7tu!Q<N;_j8L*pjWot2CZu!Ijq>%+0=T!M(W+vU`Jt#`q?s=(ql2dizj#aJv
zt`;~3K-(d%l(&+}bmux)3m}!#7<Ag*5U!L-pW*baDwuA6R2ASf<&#@LtYasHBIRIx
z#z&a1+UI|1-gsJz56akQ=D=V+Jv@o6$F#4WT*?mH2nj&9mgRS~MdnKuicHG{#Ekl9
zGbN|QkSr+m5hNb>IF>RsMyu`=qv2O%?@^!f(bb)z_h?8hlku~lzELG?xIid9HY{qy
zE36Eur>zcA?3E+345>X`rR<*U1UAAEO%3a<&-|ipYA%3#O`u<XsAptID6gMLd~4xx
zCzw=srk!FClyzMhR`<?Q59mt~gUGnr2krHbR&Q7xWlh6sJ#g;3bVRY#v|4B(?amKo
zUh0sItM~BK9l4E+thMPc2D0C$HGi7*`x1ORcvNAHtvjQ(;;W98pX#p0pGo_Ru`|GJ
z7=~fsml8^j<NtqbT{oVK3?TLZBdMcE^odGIy|D=)Owq;CJw%byim~+=coOJDtr=rU
zdK^mMXVL%A6hW?qoA$!VKl5*ORuaV@R5hagLK;tDMh^Y{|Hib^wT(A!&||(wHjn=X
zQ<FuT5bn;q^c35t01a7f%k27ebz4Ok#uKp$gS{&h(*Spb6f(T-t?+r{a?3`B*TQpl
z6z9F1U7*(!*@4)(bAdCz{+yU#8Yq_x6YTfb=zks!DPrZ=H^LqV{vo`QGhz;Hh;0bT
zP)Y2j$q>5{SeM22OIYNk03@^-cBeDf41?@C(4llV&uDv8Q{vcP+WA+WV=&4tbJJHc
z+=Vq?wf^c*WPT3*#)oEFdlUm(d3*xvv>)qg93j!JFXQZ{+VnmM&Adx)>DSIJ^k7!r
zCFIh?#58eR<)sd$iK`4cbH@oaZ3p#Y0D}fsB-6r0ZHLGGF&Gu^7auhp*0rsWu}3eU
zw(-na$1WK$mJGG)`r_MMj4Om;AlOnQ`GfjzESY3(&4bBRU@*c$%bvPpF_5qJ@gJQ_
zqLNWyfMsX-6xFVUFw8(+;h)WZv0_@X<zFeVJrI7TY?koKMnbmr!QYd2)mNd=b_x1M
z9<SbiwF9>|f)eLarLDrn0H^&Oe7JbWITy7=K^&%TVRNqWbbcfOw<Q57zFl!3f?Dz%
ze$DlW+M$8}%w)FmMYv^dY^4I*N(m{vea`K3BKa`^znXyvox%5F==LotfxhFf7P^gP
z@<k%7tgf2SZA~>j=@sp-x8Bg=M6GQ3?eWfN9B0v15qw()VZ<%q<x_?0GyQadZhiPE
zg|`DaGY&8Iueb2_-+=OK$RVux-R)QVALI%A+XCHI6Tc4o@{d$>`<C<L|H@^z2-R9=
zQBV9jzhwQpLB0@#wiE9)_}d@8M}W44XL^%LEWfCJk?0I-hH;+}%<EZ0%`xvar-W-a
z+!hQP>2I{3i+(e51~>?WFcAFGl>);5KW3uY=|yzo0|*yAxOO`2BGUGw5cYMt!ASQ$
zwH4VeSC^~Evzgrv1)e5;zfj3PUlwGFSpHSOyH?t@SN^vr=A*zrj??zP?39NnnUIE`
z*Ki%TRK@;8-~fU?d@QyJv4yos5qtBS?oU&bQ)ct%EcLpQHHEs%w$dc(^{qDnGu`sY
z6xGh)tHe9M!ap$b^<+{4GT7xGxI4?mFCD*Au4UO^qF)p1MwN-J(367OB^yu<AD7>B
zeF!oUc!A!KNx|(@BTqE$hGEMb$$XF7(lY#PcXrMAAlSH|iZ;*7XlKEq;OnwW^EbB*
zn}=ldqrd;bne%=64Etyd`yl*m-H#)fXLwG0<j<V&c2_r9OdQ^9{?DP>2D_?3Di)9=
zc$?aGcC2iF=7hIzjbSooVl=-LkpxCfsbt#BDTTMcRau6uEoS?|kqW=sTTOWTT|#>j
zb}lvygD?=C3EO<K|6-L|`5Be=7yy+JAn@*dZ6BLf5-9zs{TwA!p-VzVBFRZDwE?g6
znoGR>{vZ3#6gKK8FHO_pPt$>Yedw*pxU~_Gf^8<Gchrdh+1?HJwyxti^72n`fVI-y
z^sm~tu08<rT37c3+<OHu%T=E3oFI@*v~xr|Ir|H6*RwK(<(1kA0|9h2OqqS^4kwkw
zLtxZ_n@o{#5I2UM;A$ND>q;UBoO*(iv@z51YCkA%QC2D)(n7&nV?%7zg6gKAr0j4k
zxUa;ho`^d#rLB#p*rFWah|@NPV@L0$aoF4jj)^sO)4anKd>|miq)6lOA4{6#z8>rF
zHGvQ=3nvlxFY#Cl<(`OpKMeC)b*5b+?!YY+7)zF{MRa`IRq4$zO?|i|E+p-B%@BCH
zENFKaHyffO#=1`afpKs6c7ktp)7+X?Wm~Z3F2giWvR>+&PF2dSi4G4wIghM-dhvBG
zI1+;}482lI5}^0L*lIq0ph4>cAlgnyg6()hAott8@>7`={q3^GDuIA|Qv@c*)h|5?
z-L>h>?aArw$fd~~u8(1%+&h1a6v2vr0{;+k7wx*4@+$wpiYDmTDV6fu*wii6g$_0g
z*NWT2VIiQqU(AT%KXRAfb^b3LYW}JM*ew;~>wi9Va(qS<+`WrL>B0R2FERIGkb_<A
z$r(h`k|V-N`QB&1nLq<G4AsNGtLEBNtv;^7Uns=CtD<R;V3ILV-y(u{v$Qkh82)!f
z(A^n+=ho04zpE-8yIzDuH2;}so49b$ae4QQ5aylardl?RR-6?Ay^GR}z`yyyixBFa
zNRI141z{=Kn8$!gF51s#H8kBhXnjyJ_=E`Xee!6-nq<ZVYC2pXtNT62$pTYceY-UQ
zEyblR_}Ui@tVXDEsgcK){&w`>Q$rt7OHE@>4TdAzQbND%_kFO)DpYfewzlso^gA)C
zD6qWw%i8=ga&A`)!ypV@$$;Y6`!CinL>p2i190NJ{E)=Gl;WC(oHWyPM_{D>eehtl
zs?X%%3D5sNyWZpNn@BEw!-uDo(-PAY$6}UDuNj*;N=Aoh%ud-Xht$CD+*R3igwd@y
zhD~LP5~PoOSvTe4xh#!Nq2a6qO|m3_ByI2NZI^t=K{L)8v_kIDK>7Q|_11<t$RDAn
z7F^3?>sPuupQ9qrdceDv#w)Z3QvW_Px#@*Z(#=kw{!P&AI5{iHXe^3F!UdT>P3U_q
z775zD+R#_clN`0USViTQe+_vgU*A5}6W0Tt&1Pki%w!M;*1X-bA_?+iO8MI|sYfP>
zVd%;m=qwFdlclMC2TP-R?&O9CRKF|pLBY~wk2Bmm&y}vb>jB3vgJ-Yuzx8m@!Xja>
zz{T*MGohmg=_A5tXF?Y)S<XwYk|z37awbjqYAP1agZ+oGGrD0Ign{Tvi8&DLzgU0j
zXB4Vy20#e`Ec4F3{2sc_rJ<0_2N#@4GVVw558w2pgx@1DOw5vq2-~lsgx~lafor@b
zEex<XOE@;672nk`21vmlt@XB)UrE0A+aIyJ`}ZYPB6eej;cxYVd|&K`DzmnFo|1g;
zW!B8qriDuKy$$8|*L_%`xErhJK+y<qYYq8UbqbOK`@K(bH;gFA*}LCN7?rGIx<r@Z
z=lXEPp1`H)eYi#1ovTX2RrKX&nmC|762krPIa+dWMYUQ}0sm)d<|*fKPiTJVIz<Um
zc6$>O;Ct(J)hh{I)ONQLCD7#j4leM$4#D*H*5iQh!PSw2K8N>7*9rMcG4h|OpG6Ae
zRgr=ceBWeR7xwJ3GOYmL+Y9rVe98~_rcqnluMhlFX*-$6Q)Sz{G_HrA)lzv#dMEm1
zOGKBlH<<poCiiZo=4BQU&7ZmC-myLPJJk<iXOsjX2*c1TY3T~w|6;p8ePP6n2VhXD
z(~_iVgwGm<dpB^j=+f-_T^~A_)SuuF7=l+qCIH>$AGq&J)lKAsGw!x2FkBHnHbtVq
zK2E019KOO6?48iypveA!3-+#b(-+@eTcio}mYfc?m&K(L(0gf)Bq{rAT)#U4E~X&i
z^Gzqq(VC;~NRNJCVgfpPz^eIqHQCV$0PssF=F4DQOvG=A8nY;U0(!%~oV=^oA|;mE
z4_zED!!-)@UOz*Q$<H1E^rpm13F-YEWo#7_{gG$-{~XkNQDex0%zlW2p6_d`N%P~6
z>Dqe4>J}K`FOcBgz_LMt^xo`Qxc5qp5uBG@=YLl1W$DD}mX=OUFz~-RW+vQt7a@m_
zt3=-lj+WZs%yzHTLP8E}Cy_JvS{MR7{8DNrY~BDY$Mj390!PGpVeZhTKj8<l05!<V
zuIQM4+kY85qa=wz5QtuBgl%>1f3f`;9;q?alLJ^W2_i!C{H&Zdf9r?Id|zyMJ__E|
zneQ8wjZK;hq)D^7Xn61<R-yjBr0TmW;U}Eu83%E)MLP+uNf0zODoOqpADx=ed_>+*
zrN6JpgYHugJG8pu>dwm5B&xInp}u`zTo+yuDgfNOMa>wnb;1H{0`@IAeJ-1s)xa^m
z&+x_W8fxwLrnZYN-`hUg@5{1Tk6gbh_r2i1%!2F0-2SPh{jPmEM%C3qR!=0f-<J;e
z<~#YPR%(D&4Y8%`$IyK;8k!MnmkrwQ8%1c?08tRRk(f;+tkcSKRN3!D>X>8?m#uj!
z5Lg23;Kqb$^+W<~LLB`DTprs``0rHqH1xoKCTOPQ#b*B;>%U=}aApuk91Z`j>$}Zk
zP%!mv9*TX^Ziu7Pzv~SshY8!0pb~2uRM3;FjqHST9G#DiHMJi&F(zEotJ~x4eE%6c
zqa+4F7>Hg;fsJ_oi}fonjJ8V;(4hmU$;)Pw0DJ`!6}{NANdUg;46rQrmkI4RyVNSb
zw;_mn{1$BaDXW5jFM=(y$mzFfzQv@}Ol^y((0-%Mq|>u?D`FA^oO2D5vaq5cB>}&Z
z<h96TyM;~4lmuK+<9dbE(XZMc^QYPnU#rbe^VL)iQ#|Rnt;8r9_@GjI!Q=dhHo?Hr
zwbcl-<MM}-BLfDp54gzN+6#XZZd0SG*DVPV47}_t&_IP%yeJv?0B49OWcr8;@i*B<
zFlOVhI72XSux0r@Zr&0YoGk2d{KX!{u*gN}i+hp}*2>@n&U)5xI(wUvfk!qhw+52i
z1Tdmyjwk1+C&zEoe5oWCfu%p3yiL>u$6`@#S4I4tQoPct+scLlu`Uu}T;~se4KX+&
zuTrmJeD-MY?@n+tiG|P2|4q$6Ah<=75k5P@!TY}7y@6IGsrcdtM?Z^21H#0cm`Sso
z!yc=C7(25ZhCv{PUWp|G$^9?Z{`d_lk?8><Wg%c59?#FEYCp=Qq%XALHIoo{9~mi>
z)eH7DfxxkE_x4|mci{X6z7)#QyETyn5IlX!8MI>=Rm{F~8)(ttS+C8b#)9KBkb<O>
zB~O;=(Em7s;DhP~{_}Pno|Tr8+4fALX?Wd_^P3@&yNzxQ@-d&?B%E7(JN$8ezto>i
zOYMWWlb)8DjAF3gRS>+VK^{gmtwkaP!B<B=!ru#t8<QpVA&jPaxZ&7~18HjL*X4V!
zN};Z>cttA+{<hinjn_gDe2p$=g7Fkk5PS_pWcK&NANM!FKgiB|Yz9OKf-j})n5lgx
zND%3*8tpc)*B|!j*>X}Eq|6Mhu)`k+UPzwchA%IgfZz!Kx|EvQApr#EG-l>8gEiL0
zgJ|M}0yx&aEX`DJ8oD;#uuXCZLGURF{#`+sC9G5%g<1k^#@ggG-)3b9g0EnKBWAll
z8iL?e0x?^D)emE5fFmIc!@w_*22A<?$8L9}Oe&CkJfJF}h!*3F|H%f=X9Gj0NcvL2
zRq_?dyVQ612@U)y+W(4nLyPTQ^d8PzDSx@=trO-4lB=P9W#%nqF}B&9cVFrC@KayS
zX|t7vp~I!!mj&G$LleSS+IO(<e@9Qsr-lzTFAcoy$qg8^FhxQ4UO3y`zhGB2?!5$`
zp_Dp(xV>&5sK_N_*3XJ*w|My6-_u9Uqku2|`tizNFBI^_#N9*fssi`kx*;H6H9rXd
zcdt#;y{w-}?f*vF<<InPcUF}GzSg?EGOUYO%4m4n@ycPZL9jCaO+gIoR*uksd|Leg
zSmVN1dfv!%5!uPOzS5`v8`a(WzXklHkHKwqxA&;z?+Ot^Hs9@kIiY=L!}~CT*ggW4
z_??p+*EY}EMlO~3t$KRLfz)$^pS8BP@+^+-FFg-GYnhoYBHFR+#^s0BbA;3*)^yr4
zuo8?89h=|s{}?-?8-_s`h^|C}eIffV){i!K2&X3osDi*zjQ#rjYu)=p9fgz>WZC^T
z-Bt2(Z%JOD;&;`<hV8%ODSjjPCj>eT(EL-+#g23|<-qnb28vH64}ahC@PozgsX?4u
zNCtwyK(BrnABZe|Pf8CFur?$Jfb&Kb8Jj<?8Xe7g?tYu@)!Zfy%1am^^NFxfF4(7r
z1i;zA5mD;zHpsK$$@0b7Pe%5NCo?2`LaLFKg54!;w;}NqzmwZEq)+#$H)mFcW@ZV+
z_6xpNc3h6e@Yf6h;BTTLoAxAYOhW9j<v0TU-V<)XH^)|ILG#JW=&Z2q1>l7lkn_+6
zBK_VxoRd^t`0NmDrLb+p66>&tJxG90JnFF}BnJs_z3O~w`V{Y}e@~=B$|~s>JeIku
z^UQ+gL!!DYbvU-}f~);EXr@mrpZd4pLt!MI@xizL{bB6fjvR(z7}!$IF+r;T#_r3Y
zVmdo1Kw~9-NCKC@H!1@c$#y=O{zwdT$PjqWWW6}}x5j;GKD+ILx0k8!$wv%y=+eJ;
zJJ$0jJ62^)^UW|Fhp&3BS?O{Y8e+RD$5@!?aB-Ov-c_S*ZsT6iPgs}!{pUvDUg?6j
zm-VJ*GM=!5zq)hC4<hQ{s<`+0>1f`7uc~`vOZjQyXdYSr-k6!5Fupmq{eCd_4c_S0
zNZ9H8&A?t&UHbRlU+7~4D?ZD$IV&hmz2lG(tz%}#v=<cq!}k7e+{Rffj4sOhw=4f@
z1cg^RyPs^#jMYv)aajL;0w%>na|V8N5D`zf21DyJeqf)r*7{_AbNz<=rq%DJO6_CJ
zF*#`j+_Z2s2Z)vQwEF!JFBN!K^JUWVn(*oh&YOo0E6d&?R`Af6rGI~gu{4n{O?v!9
zN8x|Q&L{~&5Qd>w5(ESHzu3-x^pz1e?g1DSw9qt7a%kWK(I-`@2iDUbRtf;TheT;D
z5K_JIhXMfa1ht7i$Fy0F3XzFag>v|?Sg8U4f6_eky{ZBMr-0eXUZ<^AshF1DKKxMb
z;M~<PI-eFs5eAp}qaP_f>zC=eQ@7eEe;MB?4K5q;Fl8Y8zK+|_G83p8e(2mq-`E_R
zy$TFmZL_uN{%gYEGV+ZIBegb5q7oQ*<{QaTwnwDUK!JYPQ=`;oIRXQpnOh;!X!UgT
zzyep!>R0&MdpJ2bUY3cBj<8nJxYT|UI9z70Uy3vqzf2o(cQx^{?}`Mt=3Y1T5iyYP
z6C&V&TBs*I3M70XDMPM!d0=8w60$kzUS@4Sd9c;%J1UUywWbX}&Z7Q0X`O>b2x2;Y
zFg<nO*DD?Dd_)W+yel^c=1cbvjG+91$a;rxU}p^^Jf-Ruy*bOvP$1#!AxQ}TUh_VT
zo$C$6APj?7>hXx_{)^qOd_k>hF+ju>ju4Dvo6z<&RW8JI`Dp?Pr;#UmKk^7vBH^QS
zyt|G>RRs-vBYrWePvIcp8!hQN>H!i+`1XTIFvEW<s?E^*M}^w#4-I?^Eh35iBVu#O
zR!6v~bze&)5}wXKVxP+onNSmzPteqO`?3@mycU&*!LYYpl@1Cm?NkH4F;{cGk=Az9
zouwH@W7==l;((WUa?yqT3}<3ml;9U{ivCDX7(DW7)h3-H@)x><!6)_BO=$P)iV(`e
z5JV{DTF74rfN!FdFf%NvLkNH;m%AbN)%x(GjwhM57^&ea+JwQ2LB6l6A2q(GDf~VU
zz1sxKa>a)xI54>%l~A;=qYDPd&$fYi`Ye$!_`vC+cy-+$uF$|+I*LP$^Hp?$;BysQ
z5{DRHMkEM6MJNaQ<sk`;@6OzxeLWTO-|&p@;F@mP4l4O?+;GPFGj>Kf4umiay;29Z
zINbkYTdB(PsI1)m>kndv4hb=~(;I!|Wzwl81Io)e!zA$MY4=?DU!~<`2Q}P%M`j2K
zClqjnWj}{VQI<h)0yrGE6|V)=Aoyx1Z`|Alc8rG&g7?wAWcqB3!9d`Ub{AJxxz(ni
zfLr|Lv)0Z-`IZ>!vTElC)~EhwS|J-{41xmwV`a;t$$Z>54T0a;<F-1FNrTpxZYge+
zcdkC6fKvzRvHqn+5I!hgCTd>g!W9ZQETIXrPPv$){pBD1R=&VnP{0vziu=SY;1mYn
zI{Jd^$_uO`D`V23D=%=J;(cZv`BghGZP@N4xollqje)PGE{-SOpZR8^8UvrV<^uNP
z8F46*ULq-bZeDq4bL1YpE0VCx94IK@hBB<A{4y&RseSILmeag`<yrg4)QHc(<9B5C
zVnG5&PBRG-d*=u4130pDfkx-#S|))bx&tfCo+Jec9GTQjm#aMV{WbkEcCJYbf-n%i
z5(I?x{uk>Hn@>jV+5<3lgc`Eh$Cn3iNVT(8O{)@AV&ENjr^y-i29v7o4i+Iqvom}p
z20pmEcZ@^*tXGMFud)m3hV|)C9k(1n&@FEeti-@)TB^k$Gv3!oRVFHV{Oc*%sD5dF
zn-I3(vmTyGD4bB9YNYLs1P}ZaqA@9(esgd_!76V8WlYPZQexnPRLPD5h37shG4O#0
zb7PFz?YK*cfj?gSn_o%{=1#l8@h|=jBTy;Vh_7h=pA-72V2&dH)cxL*ae=XyH6;eV
z0a5KRq`Q@wC^7KPfMSkQOlkKuG4Mgp(2@FidYy>DTu>?o6faNh*H8G-xgYX!dxl|y
zFNI_KuW*2YFRuyE$2QD@4PNO$Pe<6|mu9HymKi)4AXfi#_q)81?#Q3uUM|U1Q3ImB
z#i#@qJZB8iXd->ug)l;aa7M<)i~3E8fUis0RZE5y2zXYUU`!l7d{A(~pX340u;qua
zYfEAn1VUFz))&41#rg$gtR)9<Y+{PavY?@JC)Ju$^^j-fKF4_Knlc5PQCtTy;6r=5
z%vq~{@+a~6+m~KFn)zVt$W+Z?P#KxXfX_=jtGa9N*v1AKp|BJKkBm)LAP4^Zv+|3`
zakn4`F8IC-F8T02#vZNIq*Gomzn5+U6n<6N74Xipa+lL7!f!XviM=z?AxDU2r62)*
z>hwdbq=N*w&XwIU1NjU+6{kwrhXi9U?}+@j<^5e121KnH$bX-;p>c~7|E;=)qhpa_
z$u=kgemUqP>eeCt``C|=*JkaC)FE~Y`5q`66zS^RQdTW54v*im?1Jjj$kc%N??=(e
z29xnw$$uZx4sS%cFvx)0W30PE9K8{++ODh{%R}S3k^z6D#W_v5=Vz5@Kz_Tr-`C4f
z0#gZ?M4o3w2V{d{pFCk&_S*#+@F6WXL^L5^A=i&T6AUo<mI4WyB(_uy9@hMR89SpK
z2SONzUWpb3?E7DA_Xh_N<Z=MiQOYpEnCI)z&w0BgW`e?OnPdZ(+bnYWTL2t{L6H|K
zw*S>mL}5^LOBT|oJWmaXvcK<%%kX6y)msrykPa*jd>^VMeE6X_U4#*Q3I>5NC>tPn
zJ^_Nkb^^V(Oi6pJ2WjA!cvAR}Ity|a8G>o=USMh9d)u$=vOQ5jhG0qq?-?`W%M=B@
zC3`>M%QQ;Dt^h*t8&}TrRgX+Z@cVnB+WXb2h5uF7IozN8w_GClwwOu<^m!x{2Bk|u
zkucotSDi})-%YgfggT{I;J2Frc9mc&lvK9<L`kKL;MF$sLy%w_=alH`n>c)hXSHO@
zS!dfziiDDTGBtW^zQR1Ol#P5~d)&nv4qUBt_@Rp9ky|0ptgM<rhXeO(6H^42;4j-F
zt?iLAf?s&0U+W^IMDUDr`0t1Q7&`+LiD4K9eyKQVbNc_s78X1zmqV8agl)5KV&t)W
zLS_gr6#Fb0dat}qE45I>7~Vl}XzqVNZ~=l_FG5$yJ~cuFAGSdB(zwIefscKlnxZhQ
zf<r+Fu~-_38)1g>I!v#lMm81bE@O+ht`uc8wFo{jBV3fHb>|(X856+5HRgP*wFqt;
zYF;|Rq0}Py)9Ga~R;O}*t^mR9e(O6YlIsElN438l{xKgGAoyPmig*6i+UX2iPREeI
z4}5`sIsBvSqd`ff>s<rs{fV^#0fPIZ^YHMPHwh7ZxXi$x^W>##TY5PV^A2}3^#fO-
zD%Z+8-0gGnycq7Bn83?2xN#C5I117N1b0^rTDD>qE>FbVEvJ>w;knbh^g(Flcb&g=
ziQ5mHLt@?=;E%W8l@FMf!QWkQ<ERTxfZ)!X;KuZm-xYcnM<B$&l~4bc!Qb<C>uBDt
zzAHYAor?{_APhuTB0y}s|6;8w`5Bew)Bz$0A$-o~=avafAKiX|K$O>pNEzHa2*gaG
z=o<DLDT5ai!fKP$*9LgtjIh`7GIXm`Fp>4L1`=g+u`t3is1o-HN+mKfrScPa!MAf0
z-kGM~75DCaxU!qRao`2tmNkyj^41(Fg`0yIu554V1rM}viW+;_$n~-Y5@myjUVp(u
z10)Io4#%uHmwwmW>982xUI7{Tzor)MAmW_@az6Ah*_pM<u0D0EIh#=6y&_&RDIq9|
z>2(TcHg(<M1f^2y*Vvl1zcf+{w*fjMu#ro-H9(?}kOL?9-C_M`p2G2yG(Jw#mlYR9
zd9>R;K!Q_0(PtU;<%;M(tSI(Z-O&JvLhQ<_RXv+h3%{|Bwc<Zd-Qo4kFt=LPWVTd*
z1cwT18&Fn$*LB+DyvkR|>A$XLuUpenRchh;{yM1YtsfoFH4-!qG0?(UhauwkdB(0@
zjGX}zgD?mLzXVJZ<^Lb6)0V~B&cz2XnuJ8W+#O$`<7(kQ6H%G|(ls9(!dj~vr4vQA
zC3yViu&!X>gP;7Ld13vzqAzA&Z-cFw1_QAK@5O<{WxDonOK=K3ev!1nPQnMb9xG>)
zMt;D;ySE6`G0lBX_}~!M5W<C)E@fMyH0L;OagMXF@PYI+d(-WDnm`E1rtZYN2!#+H
zzuBY<c(8ChNU^~^YD6`|ZZN{p*5LjXQ?j_+3Jssg{(u)^$ZEok)|jvYTac{%VcjrB
zIl)!%8280<5kG;=!C7{hQf`HapV{;5A9+H3I$VG4_=(g@?|3)68qL3smy%bSj{Tz<
zXS}u;Z(jN?1>QABtj?=~#s8Vx?u+#;TzrEe#obQqi#38Bjve~e;t1EdQOLMs1-7A6
zaMNp4(D+F95&voKi@74NDt2%UHXe)d&Z~}OYdc?gBlYQkYt``K{m%0i&-;j_gF%Z>
z;uf*dt?==gPsYyeSb`7)qA3BQ-pN0)yFVN(rwS$jYe(c|FKzRBF`5gr$vMVFk7`2v
zdgB{Bm2wbg{1b6TB_MK&Sl&an*KUPk=0nP%ub)l$21bsGhq>l-WAn)<u+kN!TUle~
z7hBUUnZI@T8bXH&S>$kg9SZh$seYR<eyXF{Z@5*o=$7&pW7T$MT>Ox-kxx=KzqNX6
z*=$Rfw0f<*=|Y1uYSxaot_)+zR{JDqxsa~7&ZyU+A8`4KCt1z--KCAK(9g_?eoEPF
z&S+mMFQ?qlZ1#(M5Br6KQ@;fMTl>6xgYxU6ww22zexhT2Q$JAwG>09&K>2HSxQc^J
zQMy4ebk#A)^!QO0=EoMv@hki}<7n4s6u|jOo`^G=-8ZjGU{5y}s#;-B1?c?A|K`>w
zLYYcn=ZpNDLO!#}&yHW^pt8X-tZg+RathC8(0Y6Q%>kdsY|?|JrqmfH(DS3=&q_9$
zwTwh@y5j$goq?^xFbG6fib-tf{)@H$t2`pN;yM6Q9AgaU;{dc5UwnNgNDkuJN1O!E
zeK5=ljMg8*cI_`CXzGiXk(X^oD=5|__7UP1Obp$*xo5E6=%WUFa!%2xmO){QqDmBs
ze*DxP{2qL`6;>2<;^ZfezSyGy^wVojj-!BdZeNPQDNa5}dQwfzknWfv);mA`Gex(F
ztS+(iq~u063z&->2U(SBL&d9>$Te2%r2hh9Oq50mrZXAHZ;S1n3NZcFk5S9*udzha
z@3wHzM0JyJ`eM+@<blz}uX6M-2sk)Z-*`9<G{zyAlv9}q8a{XOXE^H>DLVoyw^;;`
zDFqq>rq1;lAUP%iyGNtZeD;Uv3&WhiZfAdZp_o7FoxQ%f-y>93;MBxfw!J?Ga$?}r
zwMSR)lZmW<*JKypeC<TTxvrmxhVKb$|Lg#yvPO{<`~8Jzj%^eXPMn2c>`$ggM%w)+
zKlEhm3Tzk#Vc1KU&_MrxY}2$j2sYCLtac@3#c^zjrGNckH<+`YuHS{=*Jo^+8tA$T
zg1ysn!fA-04H{8yETaI`kw+uF*9FBsS%>q_w;mW3a_m#*+#d;o-q^Osh9_3n^L_2u
z_7ofYRXVb!_`B<O@b2rV>A2EnUDxDI@f4$|MhZI*YZRaC6zI?~_aiqGSd<@jb=g!d
z8jIc9$sbue0hzx^bz4iUX{@P6c-PpVu3Bp4xxSk51`Sv!mvmA{E_15CgO^KsZN_gM
zu1obfMTG3$dp$g73SY46NXnr$gb9mjrX6J3Ig?<>OmDruv|*XBInQvoZe6m(Yr%Mw
zB@P7BK1ZaH+OWetx7`gcYO)VqlVsW%3(IlC+U0P~H@<MTC4^JLt8EDZu*+<lz}o8J
z_m2OjHQM1AAk!XuPBo4+o9R7=OnYK^*w+d50JZ2mrdZmAOy83)#?B}SLJ)?bS0YkH
z?|-q~4^3EPQx3q00~Sov*Xh{JSZe)!5|r9Iy6m|`mj$*MImh~6@crWNCZ7N5f_!=a
z+r;$A=SDK;_Llh7HX)hwIU)?2P~Us9H@L6JFrcWCWSqe!olMLt<amt%6>o*VtttE<
znx(U<(p!7@@JywB29t^8xiN6lwo+t~^~<YXo%IDC@eP^*I@5U=DLt1gP#X@i4xHvY
zG=ImM_6fBmZ+i{S(JqDRn>61YVh8uX>Sp||5~D?9#S!)gN=#}U+ET3p5L84NBx${<
zmtWnO0HpZgU&;IK@3Ct|7Po}?>rxTm$g5s>baoV)V^kEITnMSNcj|FnLRSGXK}_?)
z;B_w$*23Ui8m+6v?`PW72~If}*bkr9$D_2Xg+rr25!sv{`yNCUrnT5B?VwX#b^;#y
zkz5FgEf?OJ-+s)0em{(zQ4+%-2t==>9g2GYi?u(zor#H?128re71syKHZKWMUm@Fb
zY?RWTsk`d-s(S5jTgeso&555!nsL|jTN!Z{3VKrgKy1Jhq?y0G;fXDU2%l+UL&Ump
zFQF#Jwv=|^z7XJH64AWjLfb1YwD(flGbpCl|7#M$QrZ)0Jv5Kp_l~VmQ|8NEAFX}r
zUY`Sw*#~ny-&GHD2raRFfU{1;hVe6PT%c&Rr$iWA9)D5Kb}=94*eJ364kZech?dx{
zoS|`-5+)JlMNgq|UAE^#*~qJ{@{Rl&UyXh4vmcqgti<-w5hvm1XEVQf?Y(q4{F?Q-
z#CEW{PggCG$)0CFAzSBs1B#vV4fSPVmS?nfT-BFoO*3q4Q?RK=+c~Tz%N1#z$kt)T
z&F7~N!Ymt*?CRP&G_LU#@UeP1^1VjaL~Gw5vzTX3t@dN=jIu2RK`1(<I7wdTKe5-x
zb>qu*p#iWmQ^Ugs=Jf`6;)-BqzL*D#D$sB;nF=R%z=-;`5!xumd_JL^Mnv)|u5;1h
zlTCCmSEI0<kwNiwiFUQ>edl3i;nV@v6o<xC+AoN9XUtxxnkelY8qO~ALWv#EhE=!4
z=T*Zh69rxf%?pSy?`Um8X(w+W<|=Pl^$qj>aO!&QAPJ?NHAz2g<^8a4+x7qfWoLT_
z0_yPJJ!$fe*rutpFXbo~0I}z`eFvw)$tj-ud8EKBm%+TBw&@tjJm<=!P}+?(89(k^
zsnb;2m%SgEmq$KVrXBW*+T+ET&&{^ktGeaiE{Fd)ZJZ6yBhE5^)YV?{N<7D(WY;cx
z1%_0-Z{OK+d&ib*D(x3_TPSTQ_u~8ROgnYNi`)<i_!w^^o|}^@f@uetWGCc;sHV=|
zjTjrgRUgHO&)t?dcX3Km`}|&Be~g_04#Xe`1i#d-<?#Ohv1`&eG^YU{K#UZXF3U3V
zvTLh-`L<njO4uF|P^h0Dv*@(tu%=Lc;p8*@T$c8T-?n{Tm&oYFHzKMaT+%gUdA&;Q
zm`Q}#=JjTw{=&;G>XFuSKR3<mqNx8VY}>!Dn0_QLPSF6`eN3NLP=G!E6%>^A6-O<n
zJZk{$C*!}UD|m4^ql5l>jBr(PNumKmvY|-oisK8TJ$R4&qFA0x3Kf`@ifQq1gS5Zs
zK(<E*(xs$ioFlQi+Dz#=_9y`wNc&4hAi~*;b#3xh%y%miQM6zP=N2@iA|VV-^q@~b
zfjEo(!aeTjsq-v&5gXsx&)TC-$^K`iy~>~;<<~Pv`%(iw-|s-$mz0m3HmN|`gFZn#
z=jC+`q}?g6d(cyRv0s}jN8hc1c&7%^{z&FL2ohIpFKkC#aR#GH%DwPapQ|DIF?L2r
z48tG{T`8tD;QbeCfAZkU6*2(l#<7VigrFKSJnyNo>scj5^eUZfR3-We7fZBE!+uLt
zaQeHT4879Q_O1hnRVK?oG6VyBhFIh=NDz0d+usH3VNz@mGW~hJnRbKrviS3RhIeE&
zc0VI?L^)UFt3)CV&wFYtd(}%W1*V<5A2MJa;H0e@OP(CyB(nD8bo6@UbhHFnJ0y~(
zd87Tg!ZV#pSxBe)IR)R?-RyH;VVCNfp1x&gShvi;GQRshV1}D%&&CK4L2KBn)8xA0
zF8KBTH`}n!zUs^`e;Ql!6_Q#Tu$f~}9P5%}`<^m^YL6bPE2<&=JM#V8S-ru)HsHFO
zYR@Kem<$Y<0jeF`{-&B~eU)6?o1U@(*Lmp}#NS@}QI$)OwR4Zc7{Lcjcvg*#KDa*D
zA!|=Y5ZJ$b7(1inh(Q>JUa6oZX77Ko_Qz7DW@HY)5E8O0KP#evgkRKe_ddL4f1hb<
z=bn@UYBw5*w)WS4Ubka;{0!mq(AkmxT_9{1d}fDzdz<KFminQY5@?=p{$6F=-wb6%
zd8;Q9wzK@5YplEa7YW;g+B@_vcuk0(Szs(f<r)}^gzZ6Fdk}hu?>Hl2yU+-;9A|ha
z3fkI_h@x39_tmUe#rr0aus!H-;~5}xch|h@ynMb-bFV7CQj_lS^YU;}r3?(|cE2YX
ztgdS&>I>hk24OqhCa?O)YeFP!f7M4!3J8xUL0kK)?#5l+4cgkJk+j}u)_eFLRKu%T
zZ<Jb6?y23ZcUK#K+}Ze%u>I_E@$)8Zmt*9!RCj;<*zsQ@F;IAh*P>v6jI;_haQNmg
zPPl#Dp?V~4R}HJ+LVq;b-`MiG#3K#tbsd<qKFaa4n<kfE#?AnTfe-|OU#hNG@c$oc
z(zuJMDfj@wwR*5OBK$FB8WajL3%B{!=!a~NsTGB6M^_qD->Hy<d4UW_+qcx+L#pJ@
z45dM(U!C825w6rgMv~AZuZkuTAZ_2rT;poYb%SP(s_a9(cD(1yE7&edXi^NGAKwD+
zL#gNswo)oMqE)oq&Bv5A#Mn_N;>d4a3kb~9R!fxEAcC~rbg?7~b37+s812mZxV7!S
z7vL?{H?QY|X#3{3U#bn!cGaf42$bhVTNs+!{>ZQ2+OkCEIXa4ae)0>#_6U;ZVO#uF
zes;R+cb)Da*uL3D)X0A>Vf%XTr-o;=oJ@kGeeDX<%%xGp3u1OsE8WX#`K;j881-l9
zsa*{{Z6IXdTV6bOEiXXGzPy^+>5n3;lCblFQ)s|fe&z%6^+}gY)XYK;k*%}F!z_vb
zif3J$h@wQ_eKW_*AXaCZ)#1e~bP$>P*U^WuGeD9Mgn{6f9HJoq|JYS|JI&p?oA`hf
zlqiNF>5-YKzwV*={@vSMHPti4H99vnhoMKW<($QiWIf%->R}R(#w_N0d>ga1DzyJ!
z&?erYYDKN3cXHzxs{<>4kD#sla{;Au^^B*X_=?aMMDJFS-F~92w`UFN0U+j2?Eb7l
zJx05m2px~?w-f-^DKXso!bTV48W7`u>zJ6@SHrpr)Tz^nR@(An%ouOXp?0hzL=+Pq
z@9x|*L0$NlG?rRD0C;$u^}IefEThZU*r%3@dA{)jhjFfV;$Eb@Wh5-3FUtY4;>$WU
zjWuflHVhxGic<H0x(*V5!&rGM!~@tcuh5Clwp#I^{6+~HoR>$r`W{x$<)g>xLILe6
z=Ia(yA}6a;JYjE9zFOhruL83hR?jW$2v;`kIj<llMK2z7MdqstbDimuY89zJ_M@1K
za518yjV~;m%i`#=f!>P$^GxbpdZCX{r0&u_4mwwh{5|xCu`|GR7zSbJl|sVSaQ}<#
z>#KfLtp+;)YMV5HIL5w&3NFwH>lABE%ke@B=4rraP0#-lXg+bnGLeeR>r1Z{w9}-T
z{`!p>?=aML-UyxQqGmw4Aamu}gF3poz;$$Bbh*EUc}ERvy5Mrn&8a6f&v`3D{rdo0
zT}Qjn@`>o&P(f^sWV#QO8?%uHY3tEESLse`2j11_zINZzvr#Q}`Ps1`CCM(Fl^bmX
z2P;={4@}f+4-0ca<tAuxdp>p5q4Q~WfG5OmVyU07SfE_2NmmXlJzKNr6mI4RoLrl6
z_P==(iTlwR`N}VCUiWw`^>YD4%}#L;a?K1!tkn!|e3O2#x(0EW=z8QUDJ}J90*zmO
z29`~;GXae!3pU$k>UjYfzhG<c-*7ok|IvN_2`y?+!i9{3gK+2=%?RIxiov)36^qNz
zqY!y({-s&4S!_4298VLXw1KF1wT1pQ$yv88e|zKm!`K;RIShhObW19<(fx01K4$LI
zo@RJi0H-vG2p4_SwuC0sUiKvDUgNwB<>6$t+I3oeMmZzCpVZbGt`|YvTy2mFbzSl&
zRDAGu7irfrQ4J=3Tw9S&c$#zqCQiMtEvK1HQb7FgDa~ugnEEpYho3Uv@$ANEg2PWy
z<xoC7Yg@pR)@+ky?Q!1B6d_Pt!`MbO($jcMD*jb<8!4R>3Wo>Ir-p#1z*2=-Gk;Y3
z9IJI|p_>mF3O?u+N?oa*tJzZ$>V1nphkmsVO)&5-4cNxb)^5gfq$JdvCdH^$H_iGK
z2|t?G?OF3W#loqt)Gc_K@Un$nsIRuab%=n24<RSDt!oIAl20c_aOh;2G(_6zWLsmG
z+s4`X2|^|p2iMzt4Ja_u(A0q9Ro9=X1Lio(-OOb&Lk%9~m4r}{3BHi<!`WTl8*gtY
zQ;ISf+x)N0s0XL_1ci4txA`0Le;7Lh90y_$27YNt*_QnOV<+|MLG9k*J^-oBqQn?u
zewUYxk!q%-ZtX?8!2H@jhO3w}3=>=Lh_vo4|C{eJcyOx6-fuEfafzb*^2)3*ugrtZ
zMl=kVmN%QL5<z(j7KvRh_V%wWe3+M}ZPHbY!DOTXq{zv|717{`na4{=a84M*wOM|b
zNXaRxP_l)2-dahnjHoZ`RT1DPwL)7j%tutm)$<H;%A|08`b$+y4(6U|!hduBvR&Kg
z?Nju3sFPDlrETCDJ4Z!!_O}V6%1Y>ONsUU-BaBl-*8OTmd46YPnc}|%fooIRn?Ny4
zHzIW(8c*~T{T-0*f=YYt|0F9%1s+~Q-0L-xJ;qYRDf?-59p=A^01sGqTE)v?7Wi)s
z6m88=#Jrd|lAWX2bhB{%xgl_j)x{(TtbWyA=7hxx2n+0k&uX5z{pqUsU^3m9DyG<P
znNIJ6ESytc)OV|8ApVS6=0q<3gt9-3U5O3DFbG@;h_4CzFIFk?ohzq>4uJfCc@7Ns
zqANjm)T9(8<p=~rTa6h)*!Lo(6gDF&V8=tHDW}nGm?lnstn^aUnG_KF295G(60#O1
z5c`%URVziu(d?MQL`W=&t!6ZQWeoR{UpbT`9t|xu6ZCGF4XJZv@I8i0`TI4X3-_NB
zn7!#>3<BQ{Jse5X)ohs3q~Tkpqt=&1*xMO4rU}wQb5=o1=Ofa!TD^e4x0A0)r!?zN
zCD3$HzMG-_*3kk8d<V<u=P25kgJnxv$r3}OrM+uB7-8EDyZU+FrO+j<Z+x92>0*AZ
zD`}r#<vMM%?D6ERbYfj)jgSLQ2GMZbU9d`0>?4j$4T+i&M-Twcvc*(Ah;^5IZabcH
zEMs~`B`qB%%G8xgrq@5Y5dxWb+Dqctl$1mGH(x=zP{;bCFEmzEO~-90t2dfuV}so<
z`xA8s@o#7Bn=(An*Z|dp>!Qw;I{nJqH)H3P!ypU;!7DXR4CVe8tBSG{1l76+@DGU}
z887z5mMgVA%C7KbS2BS``?2R(r1OA^j3)rzG9R&~d6Ji6;5hDF<s5T<hqYCl+9BCH
zkjp;{lcl24R2@O#=I@0Vcq|WE-siPvImmjdQ5)|Ef3|}Xs-ueHZ2j9K2g)Yd2Hz<P
z4-y4$EaqkRdE1I)AP_zvyh9@PGjv*81OyadIId?v2@3zEc_{LTU^uP(xg7D2UVZ|@
z1=8QK|0e@WvGC3wwoaK_jKELEoMX$#|5Kf1ZTn3_CW?L(ZYvai73s+dMiDNUyuz%f
zwg0rR+#dZAxsPvpC8}`p0P4PCaYZuT{Ic;JR#x2Ngk%bh@TX1q|HV^CJdk$;9jIcU
zT{3e;{f0S*Fy`<YYs*R^C4$$Y4PFhLfbmtq^;J3g&%BLWmY+-CV^VW#tCwChRuRI?
zisz5uc%w0Sf%!$A7ang1MK+?wC{h7B@dGI(=R1m^3?To8@egC?V#6>D0@0Nm*N2n+
z7i-muhpI+g2Z)@+KX@GQnO_2hruLYUkS`331+H6t;6qj2oD#>F%9nX(s+-f|a+b%}
zBXUvQoZ`EyG9G&2onYh`HV4m2=2@IR_QJp+H%EG6@`ElPBEWRIaWi%|nO{uaWsIUt
zhg$v>PUGq`lT@ul>)Fk?{TwAN&u|*{y~|}(vhoL<M(jY7k0@aIsuPD*)iZA;EmsEA
zUTcX{!!QUcu4IV+_)i@sU^&ZTa%5b?d~AGG3E!-z?cNpxJ@F<1e&Za&%8A(od8T8U
zQB#dM$Is3)-JO-VymU(?QSWt2f|hT32cyV|KH*y6axT9ab?NrM3SN#=jv(JTZt(Iv
z-!6hw4!9r}2ZpiRO>;US7e{G(1SnveH^w~2I>A0ypQ|KFn%@>=?bj5|L(x$eg+6;8
z9OLHZBM{!h@1Uf4CK61c4^x<N(fAH}2{FCBogI+#66TM(Mc#AtWbE9MB?dttx+RsH
zPTc>-?#B!VOKTttpyC6gG~Mvq)^9%gY8fGYQ9(=X+RwcaR45OS1$OStDNeohV#N1$
zbSKx()rt+`M<p(i$<yS?ZRe@Y;^^kpg#~S#rb{E#1o;zC;O7KUu|bwc7IOUDK(>r@
z*I%BqQn&MY;kHGmRP~d;;vrbBuTsDEUgOYbdr^U1An2ZH2$pfnCEkKN9-L6m7CgoF
zJXy*3!Y!yW=D<B6W6tWABj{s^M*_XbM+|}<whARe?i6F35Cl#!i!s}#6#RDMeIXST
zEkk+zwHZvye3czT52jjwC)txD=-~DSlHH2&-lrOexsGC;97-V52AQvz=-gV4E!{_2
zUgTPaL&XA<$j=q(f<FEriX@v;__2*$v*B)B$g||=`J(oi?|w0W=gU-)3bx{_*FM!7
z5ohr@aO`|V;P`B=ZIs=oEe!pfiKP#A{?FLi;5rP#F!)ORlx)5K#isX!zf?ntcL3DV
z5<-k)|BdB<-7)~obd~d@TF^10`nR>M#$N5%Qj_6aPgmgijXXo{PxWN4abSN6o*K0X
zLFXfpmOMk5RUzp7L93oWK6M=<ub+Am0v(l^q-v-km-#iXQ-q&BplRM%M<{*aH?X;}
zCJe#m&z^$p(XAi5+9_9)+Anp$Bc+l7-{@ti83-ZV`~kqdDF?cFE*{xP7r--}W=R2^
zvoN@TZFR*KizAfsEV{+r2xNt@^EtD$?a<!LD{GTde!sbxUv9P{lj|h3RaD2;H7&>9
zU)-Oq-a0nBry2{R9Pk0=ayMR3fjKC83kmxT6A8fQ@Gg2JtXuyg;B%Vk8XUoH>JY)_
z&tjfDViIm(v7ilS;frSOU<3F(FM?o{83V`&mX*F$%74!qTnfSGSRM2<a5Yv3A^1EE
zdM6@RF4qe_=U%cC`Q7-0#f!dk;N(R?UbhB?;Pb3+#~%A(>`ZJOhG7`GQhZd7_h0Oz
zhaQ9WL(Bj|ocM@D(d4_*En_o1-x@P(a+>Et<rJqtuvWdUP+Czdi3GjZgpo-2d<LfA
z*d!coj#64W^({W6>eqU9v03!VM+(2Ls2zVI;q$JWRO6;;bRf2}wD)gv{{jGA=OpEE
zHy}|0=#w@hGV9G)N`%x_AdSnY-rxx5{NblHF>_4p<GbzFr8qH6Y$jLARQMkm7pee8
z=Mrz{+I%;qAMT)(xsA5!tmUWz$?_y|x6RrxY?VND<##VM<4PL)AJYITLDjxlImg!T
zi}Few;8VJrQh(<}(r0FbpAzd0T$(Y@?>Ras?YlW+H*MriLx@I{`F8`RGe_zibOU3c
zzH*5r-!QNZ>MIw9+i`OriGr@!aj#v!P+u9;k0<T=I`du$rYm+b=CfwItOV01=Ooq+
zZ5`&hxvml~YRJ34`tfBfcR%@ul0J`Np38Z~`3xi;&Acxr*|{di#b@`q_x}hx16+wg
z5QtvMss+9O#eVV=9-C^I1DLg2D=;$*#ac+3^bJemuhnbUk(=e6^NO>vPY9FPUFY78
z8a;EBl&;j^f<Gwp_L1kbnsWER(<cfcf1y`jvFC_`7&N?eGVfY&=HThq0qWv;5mI5?
z$GERP#h#<D7`e@+loaAGN0r{_0mNESRNelp<E{hV?n}I*{mq{Z{{gGnSqE09KI)mb
z*Y=g(FM0dmck4a(OB{p_t7R{aGTpOwCJxpuSl)4Mja+nQhrD=4!0Ji<ajqWqUtt1_
zV1Oo1VVvLrtxswkgMzRv_PoA#UE^$wT7cq#t`9_?SdRP;4X@TBPKOT2F$ulSb3E1Q
ze1nWC5#AvVyl%*g7_ZXA{S3e!7Argbs_MQd4}^WBM=4B?iDMNA`#p4v$F<Y>pJ|&W
z_8ei*a0SB{&rH0cbu`_htrZakj~1Nae<F9ycRK2H<Q0Qz|LYj>$JiO*KnTJ>@Jk?Y
zi~s-FB_^F3(Uu1oQH#j#c3h6NsxlRq^|K`-Mq+2LaJq+{)H3;WzPm^FU`BGa)_hEF
zEKsqU5WLkFS9y9HP4bRJXt#NPvgDWKbC7uYEhmm^8MofcboTq@B0ML{Sm%=+6_-}Z
z<S&jI5bnT~`jF$PYdZToS2a29@w`>FxQQ57r0MMV{<maCixnh|{v@Y(<9}R_;{}??
zz9_p>R#TJ0AmxzQ_X61hzjN*(A~ohGfi|&tg~-18o+Y;Z^@AkEe<XnC$MU>>^>d4G
z0ja}dk4GI}4`nN<AV;^jL)`WpVu5a<klS?bdR)jRv3qEMX0m=HrzQJhcDOG=aSwqI
z*m)^ehsh={M+Ej8Iv2qz*@%%(XULAgiX&h`Uq{<(-ej0OAk`(Bag@DihS1j;^6*qg
zJo!Xk!GfQ&>^bQooWABO5+g#0>wm`11PMVHhN4$$XzNe!e=%ot`XVX`2k3wTUH;n8
zwfA-}I$9fC-&Ej|?nOt77;_j%3o~YJW)?B#9I;2hwt1qUfYxyj7;wbMmH67w`r!CR
zMBmYKXNjDUG9Yf6>5H%sZD^hLwWw*ZV(lWx<sYwIEb}1iopuP`<l^wQfps+$Z{#)>
zYE${OYQd};drnY%1t;F>Qc>vB!=VwSDEa$Hm<uzUabzsQtrT%Ch|HnIj$9k4MYA6J
zKfZ&aZb}P!8Te#!&pDN+)vqZREB3o<oSVoz`t5SPoYwpXd!xx{7TX#?^?g~Rukj@X
zPsc(6Qd@%-a#l~sf5Upnpzg(3q%h2K9wb6~&)(QjF{i8DBk>(j{lj|)u$IrR-i{xV
zH<XmQ6Tmm9J`Yk>I0^Zq_`Qf0f<y=hg6CuBwO_D^1#m$1KSGPqi~m{I&R5Ib3*I0B
zLjuhzreZ806)WIdp7mtx+^!e~VHmm+7($%=7wb=bO_Nsc033QK@k5rx+h0<xg`^&E
z!Zp*SQy&!^^^LznZ?1(N9+-MIt7G8qrHcg*OnvdBrlE<kqu4hxAbtdfRBE(hZG@{M
z^;s#n(0@^1cMLLd#HFRp-p`w-Q*Q^=f^Oj)ua^d%2gOQ9D-TFLM;CM#*7R7*fz%n(
zT0Tot9CJYGtMT?BdYWED4YQ|V3u8Q8FE~u~FHn9jt}{&a^tKr}nkvo;idDj6M9Csr
z0jY0pYN(8>b3PyAw0ZqEPIDmjZQoRp>+1|*ogV$zXi|DDgms*82F35vFr=s7IhhPc
z*unzE15)3!FA-K-Y<NKGTP9<KKS%MK$%1L^!M=LD<bkR0YumqT*S%6n6Xk;D=vcla
zn>6hVbx-Bc*0;6XXWjMsKvU|3=Ztmw+lRJJDqGafmsZU?p!)XhLo3levrqd?&9ov7
z&hhLs&d)yM#n>4jAq>Jm@Jmt%z5f4W&Nya+RTCb-)Yc4y&E@ic?YQ?2a+_;c-d-lh
z>K0i$rN`@0Ja^t(;%37lHb<a>t5eqMA=|x*@BAZchgcOyw{!K$#HQ_xUvTxs5Gekm
z{CxrIOXf{H=N<O~tj}<Ph|))~wtq=}xh+`km>~!2tK4wx$qf}o=+Sy;n`ern^#R^H
z2dP<cJ2E5-$c3S(#guh9T%XKoK9Gc#znQE(EUJj-Vt-~lC?))kt4T5BP~iX*GDq#H
z{pEb!sPS?xv|`4yoUeBn!x4L3Udog6b)zr5(d0H&d@GMD24XafgbNd5&3Wr?c-eSu
z$?xQZebA3?aAP}*=jz**3)yaQ>vqDvt{r=pUcv!pgmeHIO)eP}h#mWiPMP;C_6;0h
zTz2p_3O?Q~Ch1xvRvwcVu~B$K3JE(m_Tvmgh~j-Mk!BV#31wee!-<W&aw8mIBCn%Z
zYoDDyPsYyZhG7r}qAR5k$a(+8+8;loCgnN+YDJ7N=jZc%t!~~7v}6qPrbB1PPo-6p
z_P!3H)Y&^_(}_`*nPnyrb_&eBd_zraq|RO{VJn+C^F9(tC~ZPKyR}ys#lTP$x52&8
z_w`R{eCMLAq=G%BA(VEoumf(Ph51J0SHuS8HOcI=e*3c;uMr6tChySBR3}s176?1J
z_hb_1G%*Rnp7Gpz=2vZ+Hyv7gp_xnyHmyxct^G<zmo~YN3^FL(U_b^NXFpE!pHpX0
zwMD^LxwRQrw7u1A@Wb3?skW~UY@kEtPARqh?sjF`NQBys7BtA~=02XI)OOZVQ`Fui
zFHqZSuNYrvP~$*tU(WCO9}*gj5q-i*U*>m-s{m65`P~<)gE^uLLsz2-&0f*UCE^Mx
zcc14(s_pAJA}1VXuXIQDkN@md0)(9k!HJWh%-U4j*TGg`_m^3lwZTMSKhY#+qCbA$
zH)CgZ<S-1w(3YYja?pQcnSAge6VHNMfJc@OiUdKx*K!U%sp;&+nBNg_d;JS@*bt_>
z=b{>eGn|+4y8M2D+xa%WMj|t>Q-l1<3VYUX%il8;cH)MO5%p-+ErmV)Umc$*&3<*m
zH>O82V*V^s*ue@+;LGQr<_O~}8S4`icJ{m0KSy5#-i`*<0UJ>h>k4l_8v-rbb89sF
zectm);$&_g32hkPa}hV@?)F>tATjp9tvOe-U+Tegt5a6S`ZV?XAFW}mAg>GF4$g3B
z@m)EORpISdbz!HKj$ZlPmnrPlCnHyBVjUEAWT_YWb1U;81m12RD$6(K8dm18TLG2&
zH`f|k_-PZ{$$=ZoIW0y68LQYH*J++J5)3$u(NDQ{vu@>A=ImE3IY-8Vv>$)>yp%^V
z1>WuvBh(b7X5D$`S7X7P+ug!ybYVz^j_C)th}Z5P{glDzcqgEu!rQ+`Z83Ds=ir;M
zGeBYxgn{6fEJ(ur|6}cRhK(aO=>s|<M!@UdMd<Awy@kVWSIo2Df6IE+3cG-o-tJ3d
zY_|5_X0v!kx|3!;{v^$W-adKv<BU|)GePTE1dZU9BM0lW^maQ40_VB~Yo^gR8|R4T
zp~aZj`3jq^p)(w3aox3E@y%|mv6h3!0%d=J#InQ|B}rgRaQnz+Jx9$n=5PAGdog6~
z;pJ?hd3cxzTu1gkX7mcqOCxahp#C9FayO+SaGj$W{BX~KBH2T<6?0X*g3*aIJRRZ7
z$V(Er{o)7Vev8jRv%TLiTWF48$oy9b*cX6He>(SkL&`Zf7s~D)iO)1gdxm_P0opH9
z#Um<i*B{D?a?aIBdD~%lf**?A*J%rZK_4Rb%oQ1-wqJtf0^l#kJT}VvZ2wW-qAlsx
zeE4&wD~1fz4!6~#S#tg+Ahuuf`}otjICvwr1H``ow+bL$#I5%?W9MSSFbD(Dm5f6g
zy#HdYs`4%>t<3;dAVPeO;~fk>KAZb%VzhPAz^hVd8-w8OdC#W!>`^QVQ)_>q<v7ts
zXR%M2TKhHcoc#h4cNP1E!C6p9A3}kn_|0>&LYo|V)|lVz$GHC1dJ)+Z;9}%O!oA$9
zS}6V?Uqm;}U;PAHJ6@HpMD5~iG`04wz4JWl`=dBV%GWM*gT7nTE_f@)*IwYQBKn$m
z5PP1HKx<bmexf32A#k<}%hToN%@<JE>p$=*1$rf<wbN$3JuS2=w03I!me7***9}}u
z7ygLpIeqi$W^H|*&#I7m3SPDTO-z)dzNZ^eH?;PfTl?H{YrEMG9N)3U*8f~Gz0b|k
zammW_;y*L4lq$n`PW30ZskPr7=0ZhTUON`cHQt<_-u=2wt^JOuYFnr%H{sW5v(juv
z-e0Wkq{=jQS3UCn5?^|ZB}M0K`PgX3nnQ4GCGfbRwbSPF$=H<`F$}`6mB3&~_Ft^M
zUM<lhl^Gxx9-9zZk|~v+$(VibqBD*x<G-FXKb&j2hkDWb8(90|JW7s?yiHnxUCdJ3
zuSd0gD;05tzA}aF1oV6ZYbRHwQh8K$4hGh~?k}xJ^;&`3KFGg7<Ke1v!P;(l>PLJN
zE7o_OT07!vf4Wj`ZT|XEo4@z7fwkkt@AzAA)B77(`?HQt=R#oZYfTb&Gg&9M0<8T>
zgV*$X8|?UC%R`H~<lJb$uCAS%({yYE*1oFYt|K*^6=3b;i#5(y?-BiCcEyu-9UFnQ
zJ9Gf-0eN>Flfc@S`X2eq$(ZMVZjL9h0jz!DUE-|sWXuouE1Y$%*Q$fdFz~Mdo$}Q4
z4Xk|z5M<*9j+=ZJ0&8FSQ^;S}F$r!v_ZK!|HuO5PrKy9<kJ`dW#*Dav<_WU2lEenE
z_6Kf`XJg*EqSPA?o%?;O4Ys)RzZg3MB!poQ2!4qq4GsVQn2sY$r>WorI;KPsj^plQ
zyO=)f=#~41SuE1!zkEm9p9K^1D9^StW7l8I*!Q#j&QuZ5@_FWO3$vXGyHa`E$fFFi
zJu1RjcAWXYKFoHBta1D$EZYTU`-R2C?XKd?=dMt|l)T7RSesI9n1v8_aldvqvNI%2
zO!I7|8_KY79$S{*FHn0!dLNYGC@Kb+?Np*hg=8&{70h;~s6*n8^7}=cJ@(jPx7sK^
z*U_t3q79}>&$|VO+MhbBRdjR?wd;gAsZ0io?$@z)^}Nwhsp`GxtPp3PA*ct7si<Nd
zYaeXHglk!@HP8jD-Sb9=RojoE0*2Xssmx%gO8&m*_`Ri-d%1pX<Zhl0O!p-JZUnPE
z*d{Plq==Q?H-A?!`ihD_yiIp+Vr@mN5)o}JIx7d;$D>hOe&%4d%Rap=s%J;rFN}hQ
zAZBsqwRM9d%tAd@FUHOQhk+0Tf?pD}T>byY+B9V_)q_5OXihz0U3Twc`+fJpEGi8o
zWH?83lxxm3(+0CWUg!C@n-=5R@A?MQdlo2?qwRw;XyI5`&G}FbhL~nCuJ0?Du@~8-
z6}bv3GUK4;SL7<#oX)->_0J-kM4Wv=RJnhPI|UV)gQ#>aa-c1k?R)ou755-IG7IC2
zaf_T`;z$`fGIRhH=NBEB#UMfcGDy%C;_RCMMxoZI4YZv(+X$9Ry1s(bDd;2`P}*~(
zKpbty**MgDM;^GThuR}3YBP`Zq<!#_f$A)M-ctc;U&?j;OQA#ssGT1y^m57R<th%f
zpIsSR9(&!==|A>EX)F#UUnwStQ@MbliUaN9O&a>>n1kh|f;iCL0r;`4dhd+<OF7WK
zdbvQl%1a}0pnYxJg}nI8cO;~C-&IPpqV`eD*>{!MMyR#?;Ya}5ml8Bqw;0#2z(_;6
zitKpoUyPj#4#OY}L(i1($$I~bZJL?~8mhAcM5QeRVq$xXWecR7Ycz@#GZM4YoXww&
z9!E31C0GLOGs_$ISm2ZXzX0v5z|{!YhJN1!+DEp>+}Yai+$&?zWry5_3H8)R4RelG
z#4Z477P0-%&L_iaXLGj%+IK~1{*k^!wFKIOX8J&IC!!cLrQm?P=MWx>@BBK~5t+SM
zzv!|DYk@I$T~=8F?E|0==SI`kjc(1J;h3o}6)l1GF_wllqAHi3&k3~8Bx!hG?_1=J
z)}N0lR}}9%PQRV_%Wvmq=syrVw8^*|P3@ciH4X8_?t3=1j~9-(UOe~N|LtoqqhbNt
zx7hy(0AFsw&k=SqCqtLqhKS4tZFC48#hBaqohe^+32FfC93>qh&1J=y0oo^JBp|(p
zo~_R_Z{Ww`MQqM1AeBaG6uJbp1ll{o)Pb;36#HNT?So6UAWxd>+@4VTP7Xn@TwbKS
z2|EKE2tgPKe#sUD{r|@<A$ICXvV8#I)T6+(yLAJ#?}iSmibal%1Wso!V+}Tq2`o^1
zi^^rke9HS>%)5!_$BCe{nm24}Beme!cdod;8b$30ERDXAx=wU$&(CjW9UY*_yBK?I
zz4E{!a}?hfbD}`rU_RGoTh9ksXVJC`m8XsygL6Bg6a)`doD9_7&J?A@yxQ8+4b(m|
z@k`%1E5?4?$*-iqvyOC1!veLRdEUtLb1$BEd=cRUnOSkS8uQ;=*BUf++{MuAvmH5p
z+^$=XyJZ_x-}Gp`>(`8j%*%_3zq2MA7Nq^<Q9!L{bq$5Ia}AwPky#wgg0!DO%p7}o
z*Y%oikamvzjqu!c9fJjF@06F%40Ww|-tk$!PU8*NmH2M7K}{bvJk6TUXc(kDeSYxU
z(QPc;C~M#KXsbVl8jDx^%#0-Axd2eqwWppG^?=rsx?O0y4r;{7{#^PSLE5t?Qd-p(
zFega+%Lg^DgGG3LNc)emGeBYxgn{6f%%On)|5%+)vteqR_<#(ehLGd#xLQeCXGB(`
zfG9xP(Sr|KNh@*zUi(HK#g$h@S-?ZaOWB-ZIaz!ns^Er2U&Q9G*@5=%G+>2Q&rwVl
zS~~)s5oweY84Ox`sQ$J`P7t!Q{k{0HPz=f(XCJsZbfcma1r%0$C?pZI%p!|mwWAhp
zu<6Gvo_YKS>$-|(o?k1DaLB!~w}^F+0jXk(bKkt8$Z_^g_1yvM^2^>o(w8gN_xr<{
zHSfhYjr6t3*mj@9p2eu`riGzZIPyPI_{S`wPFk{RTt97whu=7X$whw>{xL9I_VDIR
z<yn#g?K@)9!FJGc287_WFFGkQAz$Z&Tl+F!xT$$dCfn}wjdAn$>`;66S|t26B`ace
z=ceizH&tAL3iN!0ZF+uEEui*AchHE<zb{ZbaO#dX$;{yi0k!|~f6AFA0%~708snKp
zL-@z=%yFBBTAqV;yQ;Fk7&{l+h+!Cp&U8%NIQuVFpr{@L#7B7mBZw{eLsHbS$=s@-
z_J^-0_wJe5W&yQ7#?CEIP^qBy(;YEfvyj<Hp=r0L(dDr@p3$^>to>p$>nr?Yd<p^+
zs2hu>og74w*C<?MO*_gOPVPnxB+&~8kC2c5w}}m)E4;wH=VYo(2fc7mF`!bJSv?^`
z?ZCK~J=k(CplM&!4$P6yl;gYqv6SDh0%|8Vrs0^onX963sAENiq$5)rDyaRcI*Y%m
z${k-5$(nY@GoHS=c25PhuRLyNRsssB-E<eKja)A*t^8wtwt6N=1+@=ia$fd|ZoXR-
z4j#rgo*8$3H>;rbW&7jqf6sRwvA1WcOy{D%1bLKi-ZIqw_F<aM4cMA?=P&b|m7W4>
z_Zqo<`DoU+_A9!L&4=hC&lONR`-VGGDO0c-pSLF&kHO~7F!c7+A6s6tQbFy{vH#!w
zW$avV7=&RMdZo=J{oMazli1=^3pgC0qM%ZO?YtH|{@=Md=bkgkG-3=wTUIbj(z8X6
zhTb<UuPdIBwzORhOFcM~HQ{;{W9L1uZoP{+d(U8;5fO9NRvBDs-#GE)FhNHdKwdj-
zw!y#d!e&FKg~M-ISlvY}+S|W%G?@@zDCT_R*azRE;$O0x=)cqI2AFE!;x%~I;Q>nR
zIc{=7^yJu?pEK{b*e5&r$F7+*3SS!31Gv`SLwlZ#Ug^#QP-{Q(33^N0A#kmo`tdJx
z`n6$-u`Tg{*{`H|z`#iSV`G|L^N)dXVL96~%Nf+#FIeD9$9gcxsr6??J|BvdC|qkl
z7PV)pNJWn`#=7Nup=s3&)Y_v44#r;b9dxaI_ZGt1FRqKU$3{A}s2OICUiILJ>viQ?
zyM@9?mSL~%m+R_aw2o)36t$Ua?R#vCbJo@`<^`uV*5o<o4`XM5g)j`l&?|K?+j0Mk
z>C^G)YZW{IZ*F!YO+xy+mgz3u-v)11;C3=(z8GVzsCBaa0S30nnJ#d<9c#|z2vcp*
zQ%rW-7JVUSfyI~_jI*Jlwz%JO=O~zjE7k^V`;={uJl~7jz8bFMY~nlvRfN3uu=8SZ
zv!a*TwP<ugev}mU8i8#G6AtHs-e$(6R)cL<>~Z8S=Y3G)bktjRYN*CXaaCVc!Ky?D
z&CPL&t$j-42VGh5i_g`={|E$}?-mqWyYKezz><%tcI35vm%BPDdCP0ZzH>(D&edvl
zwtb$;KL4A_R@nAwl3f0qBv;bfJu>pOr$u+ljqMtTqk<+UQ+&QQFt)qNML1pY9o3T7
zI=X6+%8OAn@1W{zdp}4qHPA+`IIFYm?#a8*tcDg>?aMUF9nbRlRu#2lorD=06Tihj
zbS?I_7iQ-v=Uk2+wyUVD49lMsT>FGW**6z&KKU_`x!kbD?wIb$*qPuk48lP0OVkD@
z{QqN>Dltw&y6yuka&Ru|@pr6kDFBS#A_c&g);`v`*<i4JARscfZyuLq)M}mHZCeAO
zdVWA2GBy+&w|HjJuZj#ShaYp<cQe!V;vdcZnUBACzUJ^_9%^Y6nTqbzmSFFkJ|wNR
zyKm_d)OfH{>ral>j+ZDn`*wY2<!J4Bv(J7(v-r)E)t(&xtfis<FIxMHu}`}Z#dlt-
zV9s^vor>apH{Vq<wVU?z_|n?1=`h3=I|j7&#}qC7zDsKlR#5JKZ4_f4e$1ua_Frn4
zFRgt9?hAYYM=PFrIb^VjM&zom`!lTeM@GC}7kb?1jfq#R>9c|_t^LIv-5gn8t!Ve$
z>r&7+&Z2M3TdYALHrM7UhafZYs<2ZDt%*8XJFMB>vR@UkcGFZYS=kz`YYssMJ*J`a
z6%0im)UY)CxLMa+_h+>BG^wE<kKgGqZ^q8`2x1Tf!Y!TREB!ZiKkoQ&VunotPNE{p
zvMj%`<J{kivQRN!{1u8SBgTq#2D`%NV9zDT>CLhB{XT+&nCCNXpvd5{V5c9I;C+~5
z?N3_5OY9M}_8EL4`eEd`eFJOXN=xXml=Ev01(^rla}hoVTKh%39-M+E=1b3A{yDUh
zb0(oV)(*YAeBzhIXV)P<v(=%C={nTTbfJAzA;D%2wfBqQi0u_pv*u8HLB4GQmzP`=
z#T;s%2<A+$-m7_wmTJ@P6!BtFg_Cd5gedB+Jt*QsgjNo<LtG|#E5s&k^0?wL+2T^j
z50L}yPhoQt#yszGSASjN7jjqTK>OaD7~)1wi?xMSU945qhU69r(0<mVRUw>g0PU<5
zy7sk;OAxVk>d`s@d(S~WqcLjK!mO9IFb2>bNz}!|TR6#uv!Xc@$?76bevsPh*%V3y
zM-H?Pf5g^?Z8Q-`!fM~fMzgWpCVxQtm$5UzVHkvA;Fk)RGXDRuO_Oq|+R51i5G|x7
zF|mE&-?afC+KQOmh(0z7Ixa&z;b8>Oe&s512o^E9F&a$H;P^8^LOv$rYNSbF@xFJm
zL>GMFSpd)byd^oGxXO8pXO6aZ3Rq?FTO{opr4Rl&jGevMqX4hCbb0|$6b-6Eterw5
z3(0~*CxG^7V9Xk&(1{j(?a)aly)|<bkNh|Ubs%lxd!}`Oh-SjTy#B6BAnnvQNn>3e
ziB%x&i$2kX<i_#|gYZSY`0n+;eD}H#khu_P@ZoqB+q=zC<}pz<NI2x|c)3o0XDobC
z`Q@}TnHGMXQ$i;BN`$jV=>^jMgVJ57daCI@Z$B98Ykh&V(@%gl{g=dH$Hu*&;;t)E
z`eK#W6ZJyq<1C&yq6$O>7w0c6!H$in!tG?`+xqH8fwW)A;C%VR?=G&WbhhSNb>Ho!
z{)nncSI+X)x;jocRQfyJY<yJF)gA};o3S&&kr0M~;Fo3{=ivVz+ZDoPhG^S7AcBY-
zxLt1l<f<|&=G%8F7NZ_3o*NWHP?HxlZWqQa$Ig8$^h9y88>bb!h)dsE@y^HIfoHzz
zz+;Zmo+NM1SO3&GO8edo{ltsq*ti8FReeFlFP!PUwWn8XnuD1RBORq3qPCBuaf^5E
zyRR<K)j!_eSXUEjl8U9`R%mmpw8-w@pW+++Z^&?>oO0~(toS{059-W<C)G~KO&6@8
zgEGgd{g#o;$`XC%gwj45w?5`VR@|Ua?WxqE#G3wT_fXnzS;dx=s9w)d?F2`ktkTdl
zko(vvZ@%v;<~tuj=-)nK|E}Wu#=7DzqiyDizR9u2PI}_yt%EWTrTy-?yxw^(d&f%@
zVk_5%CTkq3{g&w-?=szv((ajYPM>IfUZJ!PRBMEhrmHiZuBfTfrvRl*V7ya>gLuW>
zAG)iIhtfU?=rU_OG>zaW?Q4CrCcliG3$BDP3<J*uF%<59vG);-(Za?Ypkf8vG<BTG
zVZ3SA(k;O^BIbk+00EFOAjp8ekk{dAe}L>&ua*l|yZ1hol+bCRm2L_45o-fiS1T1~
zrW#W@3cyLBwBx&?)A4t0c<%b0L0sWBcq;7+H)lJw1H4g4?ZTOUp@f9@ynnA|2KTX$
z+C^6ivUT-t6OF0)&Alr?13;hIxPETGj|M<dK#2S|D%`DxKBgm1zAseBCvmlVFWBWB
z^2t+dFFS}~@mEj^#siaKc?VFHUG2mxa<d9KA*^-__1jA*s1Vy7bIe;0_cFWMQ8#M5
z^Gyn|-OObi1=Tx7gxLNlAop<+SG$3+oJV0!gSO>9<6(bSW)ouj<vj9p`*R<${ql{7
zS0N|d9(<y>o<oe?_Io9Ce%FPgQ*0*(KBj)pN42C~JAHJP%uIFrua>lH=No+0?u$R5
z=nrFOlmsCN!_X@!64Co#Y=7XDK~47n9kF(>Bx!K5Orw%3`q;xO;_JQs2m1}_rK9OK
zR?Bny)hnel05*2i73PgWOw{B|cfTkZAXAc_keg8_<7Jd)3F0=u_WGiLN=!kup+BYv
zZn5Uu$D+KtcrJ=~PlgIzI}RlcjG}tXO#^KgE;1WxqUv!op=+Ns@em?=vSySF=Y!C!
z-rYoD*B+*V#Ck$gxX8RIg8Z3X18tv;mv4-hlRTr4p|9f~T0LH;fws>RY2hlE#15Q+
z-t3yxHS)1zzam#c${^pX2(*3b`Kd|Yw+mf+r~#ukj%3Yx#`1lSBv<D`9Cx44KL}jy
z?Kv67_sw#3eG3v!k8cRW_FzP)tLD$40&l1HZtTxjlIMb=@5Dusz1?G*D&^ZC*Wc7#
zR9>7P%YV*~!mxdsqKkQ$<bAa&RJT21eO-aKPgoEWr86%2W9(dV7zSY=dZi{XK<<CB
zcEcM~keyvOQAJ{Y<LB||*%?=+wIA<CHGX#d-(gMEk5BTR*$186=l&b(Dk=x`s=Y(6
zL}ygHn%OY6CI5TxK!Rz{c)S?4FBwgvW^p`Ez1?+3uA-|w8LxKVx$@3;PIN|Hv;qSO
z$#`d6p+CD)Ie{58_4b2X<(+i-R(W=J&ic-sQ}wgwG?_;+tRh@w(CaGis>jvFLT^VW
z^jt`~d~53ME1k~T9ybCIdOK&r3lbvf@+}P8O>2|$QcMvGvi)&24cYx<&A~;+_cFAR
z^jY>nLejuV5*m|{!7R_kG%cBe$n6)L8Z2Sb<Xcm2?||*Jzx@4*Lj$>ecxfl?95X>e
zZugSI)}1sLm%(-)z4=5jPb9$hW%?2t$#G-K?Tw-qOujM(N`URYma(Pu7+#jfUVKpA
z6(0z{c3;apjpB5-8aRU>fhko!vaw&r&M3#B5Qc$g+6upL|C9BLakNzNI{+$e0|aMc
z+StEq`Es?YaFxVF#-RbLGAo;cYiIQ?K321`DXZ;F8Ru55FlGJcw%l71-s#p++q)s~
zerE_Q)b<9Ln_~*!ci$O9y<?zcu-#+VyZ#X2A=7-O`G041QmE~yDvL~1A-k%p%h^Ox
zg;Nl)ol49?eGZSL>8R}w+m*O=hc0IUwtH;ZBRBk3&&6#~iBZVRP}`fYujf3+M(ukn
z@f@<c;#oKd45Qw2zmqmhA6uRGjk)S9UPf(4s5!*>IKr>p1QlyPc)bg?z0H|zGQ<^r
z?eLFy6MbsN#0A>UoIl(KD;)brZU5aMGRN~Ku25vChSuDEAk=n~Th8j{<`UVk-Q*TW
zcgRFBZ2#q<8qy8W_Ew=s6`hq_9ksoCY|;=Dl-#4X_p$388K9%KQy_R8&NJwuFJotx
z1R)3m(JKLB1NXn!{0uLau@VkIA-E7by)5LY+#*Y|ODfT&h)|R)cf4;AfxAr!7z?xA
z#v1iGrsUo*+doMZ;a&*~nMXsjpP9^yU{sE>ZhIAjv4YxuF)!7m;)+n^@|Kg#8#l^T
z9GRh>k{PtY_Ca|iD*hz(PaAAkXDl@FF_XO-9*pHP83QsZ(<K(!>)VrkUhf9b4M{ag
z-W1gK5AZp=W-QxHx&V<WQNsza-PUXRz4$m%_40WGfmd?P&PuJ9d1j?1OGovoQi?%Q
z8Q2cV+{o=KS+7$L_EpbHQPueh<M=BQ+TS=J9P2>Q&L6vCb0S$fsu51wS-7|?9d$p>
z#T*XeS7BrA1BHm_Nh+=;1=jxY)1CM!X=CkAhcEh0CAsF?3)=dbpiS-L7#wF#KLTs#
z(>|y+lC%c3>HBPqt;xLm82mAIMmG$DFc4iS1UTsai}j0VB#<uyR4v3Q$Ft8yT`^43
z<@Z!!qEX|<@tZS#RSaGn-H~(76`^45Si&3i2qW(npvBt9WxZy2rWR|zb&?o)9im|E
zTW&uflG&>@92G@4N(?H@V*}QH>2^1YSuciE)=RE?<h7H6wO@dn8N8{*+6A19?g%rN
zlcI}E_-V@fEhnj#I0uK3b*&z`GN{Td=6jcYo;sIF4t5&J(E1tAkw?v+(PHhpx%2sE
z?o=D+XCo%_BeX%U*yrc~*Gy~x+wo~d2Pq?gf$iJ#B_{J4M$ttkZoiQW&2PWz@A>W%
zS2>;3g6*if9)DMPX^#2@GSqL7L9q6#wahG+WAHhlicxh@+FmfE63%X`W&%}YLgRP*
z=19@yU{f?~--acz&qmeJM27YDP?JX0E!G~d!gf0{(u~q}@?C$%&h3gp7>1!MmC)K|
z|Hb;#TyY4s7$66mycAhcRG!biG#Ha?Pflf-I$4>RS+0m#`S#>wK(@1$VQxR_V`84;
z>aAr%l6up>wMtdU*FeHRDhjMa9%mj)3dnX0;NEO0Y2f4}+jG-}auMczzPQLBPtQZA
zqrQ(O*?w-z-0#V{z(wZd=aN8R6Y~vhXKeJP-@r#^s1~a4ntb#BT&S1Hx7I#lE89%W
z#}#f!HtpcXB-_u10fH)h%ym<9-k;T+qc{#0^EV$t21(m#3w$mE>-0D(5(=1tGO(@~
zSIl1^Lk;t<fL8-p2fW%%zPYYB^-LZYlWZ3x<Y8nB3FRZhZ&t|tQa8DFZDmsCn0LeC
zxZa>2x<y+CUBR{M<gD&B#1~vUs(9V(uD%8vypF22`0SN|Ig@Np6pSVBIM+7TAt~QE
zlkd$o_-p%R>}+r>1VR{mCDHYDxc|j=WBiJ76L<$8gYzeJp#8HQzIVO3@=AYt(Ej>l
zzK`#!qu;;%3b6e!rBawvf1qQM!S;s+CORHN<+A|WpW_}L_v~%&eMRzHCn0+5N<i)L
z_V*GYZ7r>hnzjvp>)zYa-G#d*Ki&p+5m@5IDf#W@8r<bc@E)?tt@=GI0Co~F=YQEh
z6bp2HM`*|$d)edEGHnczNvzG1YCUKqW9x2wwT#piwzRhQHey9(htI)bcG1opS<$->
z{sgQ};X#)6R3CCGTnqE#tUkW04N?5><SH)QKBW+#I%{KQolCQ)wRE4npVJ(y4n0Bw
zQfHouq;Z-j1M0<tTW7r2<`jr}n7-4}oY_Z=0#FaGvt@jF`wXM9o4CzL2SPDe(!q5w
zX5D6kyRKC5-{ygt^amX*ouVvR3v}yKOj-NX!sC`t8y+kKkj_Q8yfQ;xD+`~ZWp4?j
z=%YjxK}-?ToZrc<%Ce{TJ^IVo8Ra$%!!YzpmYtf-{V%o-7+(Uk75A4P0gi0P3Qdu}
zcDhbekiybpEqTbe+Xa<x8AG2a{KE}?y>7pAjG<3@&5(kvpnNN1=;lK{O%$jjMf!+C
zwhzi`RbPq=&r>f7d|QIruF!^|@A+UU2G=whKmQ!t?^xsKlUS75UQd0djGy0QsX+Ss
z5g9*s5&xu48{t@osXh?Q)z!fiGKFV^=f_(hNbL%@Q)9ZdaBB*lEkc2P`+Mql4axz!
z^w*tWQ?Tk7Ax(&*!E(I_?)|(z#y2s>vxgb=sP``1;)5Du&H40sWp?b@8yLut`9g+f
zabT?;gOV}xX^i4zyfs6Xyp~YABy{u_sWM`IZ#drnlTH^Fr{yCSGmcP9fS1$KGH=Io
z7%@e-J$y`Ls32pkjbg`NhH-Hp{a>UYrhB&<vaXdP{V(UPzgqBzM-TsMukQtXP#6*3
zrgW4YK&hdNMnL5^3jcLW)=%xGJBu!KxT)iFA@jr7xg|FY!!YnlX3_-G{V$fEF6br=
z;RA3+e#j<QAlR{b-*>vU@19Pcs09%(?U2V<lHRiNQ^7nh*9I`8B4(&To+3FBC$cWy
zqV`#LGj?}`%tTQp<p0F3kk~@VJ-TD{biqJE0OTBfo?PmVuwd#sau`o=)Fa$rPY0|I
zuZ!D!$RsP#$p_rIR<rO=M&mZ*JB@>w7i`m)(?B#|>}+%)$oL)MLAimu>Jefo>sa&l
zZ~X|lUK_0Yx9&!euwR!U0S>Qf58iphg2g$&-@xe|ieC>gJ&ld)meUaX`#SM0wJUoa
z>A9}&&AAoOgw0;4CA(vE4z$w?TKlr2PSrfyOYm?$-+FcqK0g^~czHynT!-Gmf_*03
z7EiVwN()AK?m;<slJE+4Is%5%kED(auoM(dq9?hO40r($PEEHF`Bl(=3Ji{%*|r4<
zBJTap<kmGNw;<p@<%zVgn+k5|>!=TNe{Y*VhxISUuISid7=*3#z~))rf3f~l;%et0
z18}6SlM@1@r&zx^m~28dd9}sh*WgOjM~puS^b=dUp18>xr$4JWqgu-XWWbFzj+m6a
znn?Qpi678VuQdudAPMd+FgyviqK?#<IqPKx)_Wch3!W7YN#*)Ig=|Xs)wii@*wCdQ
z3vOha_R9Lc38nfJE1Vrk=hcTK8k{IXE|$A47(g1F$_U6N1M0y4s#VZDE_neC$K*bD
zSQCoVQZ?SSZ6OkzIn(Q;MzZh+sSWvA)Xg=x{hB&qrQKJP)lVQB?|>{Mm!3WtD?w#_
z31v*GzjdmmGSTFX+srNAIaopREn27^k_H*k<b7BK6{}DepAZr5LjCCsTwf^H<nOpP
z1{x^^q<Tv#N2Fy)eN@BFia{ObntKGP@K9StzTVah@qkpgbLL-iV7o?Y81pdt!pbIH
zeH&#-D&g=j0Rn4cY3sn(=le@Pgq=~2gFp;J@3JQ#0~F`}7b{xnxs@v7KYm7$Mj-^p
zvHufmJV<q-|85vKJ+E=eZlw0}UXX_Fr*KRC9CgkmQ1Gvl+;1>AkU?<U<k@<)wiFhq
z$-<J075V#VZeJ{r4kU3$^N--n+z~K%u}fub=KCKqgk|On{Mc-N^$I~j!L5#N2(bc$
zsN;H`z6O|9;NZm~RYOzinN%tB#~t-k*#ZMbb|JMU`{6te`cSeqI^+Y%4bW_;Er9TS
z_v_<q4E7TO3olxD`Lk7_1v>2&>98n<R#1YMv2edY-VCa+u_AkrE_<zmBi6ZxTfUw%
zd9G2Xeop$$JHpZC695{*)T`%RQ2~V)%~!L35vU6S3U{Z-9&iOwWEl#lPL!STDi{k0
zD16ZcHEJh4Pn!i0zB~xB1Z8bA;Y|SH1v#Y6YuZ9b4GzAbem3muo}pH~?2=47aX24d
z;f6^is(9C@5{Iayl2yewPhW$Vye=<!dLro=YEV(vRex{B&Lz2G5C(!*LNY1D{V$fc
znZ_0SX|nT%av6gdTEEAl;Lz$hR|$sagmV%4FpRui*SG%@!yF&$rGXLaxaWaIX%?cz
zGf(rQ-oz~0VriPkaaEgJkAV377J>h^cU2dK&~bCm$qmF<C?WATlWGz~OHBL{@QP4`
z`{$|Oxnklsj}TL3Oe08q(0&X;SLUtq|B7$~ZK5KLpgCpGpTSwfY$8GNi&-WQ==0PY
zs-n%zpw$z9=rUv1^AB;zFY~>U=0NJ4XbZEdM8;>ZBJs1Ej=?23{wCo1g+ZveIO?9q
z+L)K-cL!xZ#X{qE3C3l@2y@Ul(-cQX_2mI;qoZV(N%0C(h@u3?gUahu)l9>*?JeQ)
zP<j}W#@e{U$MMoL)W{1F^1GKFS<~z5Ek+(%7M1LQ{tCYd66d5JM2n1mWd05B%KwFT
zZQ=1y{3xj*yN?#!)MCNUNR5y%MW(m#cn~Z?F8I$cVP}-&FbKoYE5!y9bpMO>OOMWG
zYahTvp#fxBSfg2Ams+e@Iy&!B2l{lPQTw=oC3iDdzhv<u@wO_m8I?58k;e$K9@G5z
zw}Bnorbd1;LmsA$Bkd|4SxdHMhTQTYj95GMkW7$stOeF+-8HM2@050u(yltzhZFW@
zi{IQlTNmb{d=(d!_NzuhGEF{Q<%x`Qzt=m~Jo)r75fd~spJrU&ceMUrekT}rt-cc-
zSpK2Fnl`?|Ui7p)hGc03crsg_H{cx9n9aGEfOFQ0`R-aWF8FdV*jg}@b%v^3FKoc)
zTvPl?U=-CChTZj(cjfc<zQlPpnlAcEU=*a^<nLWgtQpP;Dj_GRWnQ8I3&uP9Xo<3k
zjW^<?P&Jy^{5{>qAXEdhzQn-FaA?<67@0D+=Jvr_C7PS$Sc{@<AfHg3Y08Yb`?Nks
zQBeaLVJy1Yx!ea&H0!kA#)Rn8>Ks)j%@Zo%LMWC$PO1-M=XM)03<JTIOz7q9zp;D-
z90sQYHw6f?4NIg(OKy&xcV><PwlA_*V)KbS8BfF5J*m;e_lhGbX~NoO-f^)zD1uo9
zQ1cgQb6!Lm;I5?RgZ%>MxfuN+M#;^iDj6#5_Ll^r%lV%$lpBWWhpG9czw7y5e^*Tu
z2PAS)3%8#)$$2@0P8ARCmoA-GGBK(Syk^mtr|7vnRG%JQD8cz6$#@r~HOq{pT_UG8
z4#uXpl{#|1`%|itoTobU5Uxkh;k3@JFbWh#{lC0$`oIwh0hfB!jX>u)ulUH18H%AO
z*Ats8(3lttdVaXyLlk99GL`(ivZBEzXRgKtKcAJk=Gf5-xwNmHYEy*KFWlYa>1&#|
zB~Q<{r7|H**`N}kXRuD9Y$}7bvD7Ad)h0E~UxE1dZa^RAq<Wr@mUMx2TRi5O0qEEm
zVu2XOK2ZSl5;!4%lzHTF*QNnyP5c6&|32~$W9NdyFbu-bD}}UO!u>C{ZW52G*>Del
zl4kiZW1H_pdB4OP6ac!#GEYh}R#!8fMxqD+G10SKWMX410zgu9g$M+Ge&K>0kGNny
z{3d_8v?OU_KZ2ekYkNJDwK;rp8llj*$v$MxGPeKAYSdjZX?Yx%Ou$ki2b&0|03jTe
zWD|oPizYO4&YEZH0i5@6!^p?SYN?|KZr-DaN>@u0v@D<V{<YRpCnkPaUkI3>h9VUL
zHJ{Lylki+`3AYM{tG_mJbB2ZUTt6Sa-6G96?7|Mp12>ON;Yq=)w?u&E>nh3Vl0Z>@
zO%qn}U);Hy(ghB;F0qN7+FsgzfB|%|On#RN*dwXH*3wvox=|Xslo-t!YpXd5$Gvo4
z-dclh7sq{CRwIu(76t+>L$h*Qrq*ZdzLbA<C^)?irRTz6%0OY|dEXk|DtT8p^`Dm*
zcT~)O5gV8k#b)~2*bk42H)CgjgfI*O!7our()$08>FBV;Q4b%$Skpk7<G6c|rL_lq
zN8U~e8-^YBn_w~z{feNNZ>?L_N;111vHl6|mY_lNyIH3=Y|YuuU2L9w!RbY1)x(Qn
z386b83}x};L#JRu=);&hn1wm&6vQzU9jE|Y(ifnxgwRhb(}glHICbpp)BXzxugSrL
z&<BK%$w#NQ4h!=y$W(w#>Hq5>Q{*6HMjA7D#3tBjj7$_RJanl;b%mk8>IfY=1rtHv
zyZWI1qltwwmA9b9SfF_mn-F>lPh7>T(OUz<(3$~8kyOh#gh4r9SUer}mkD)PV(5E^
z1g6*2r5(di^j93JmrwnA(O-e<yTJWdvo$abP01J!EMmg+Izu~WQqPK>)|4E0=UeX?
z*fMmPOcZ@kCMTUYZD|#Ti226X3iegAR(bEM%SEwNX7kK>46>h3@Tpr<t`K3_dL*pX
zrJp&0^p~W_^J5*Grm^%pLWBi4F043azhm!=or?{_APhuT!az*ef3a4T{2V2buLB?w
zKK`7K^Kb09R~mgJa9NwW`NGGeCL~NOGAx7)o)0j@*_i&MA7blPeSZ;RSul4Q>SEeE
z$<vx8Q&UX4A6F0xhq{8vK~JyGu@WXHko1Eid4_74om<QsCBFq)#9A$}y$G@lqB@@N
z)foPF?7UHqt&!jiaRtHBkz{d9otyY(8iwLh5I~=5ttk5;LBQEq!X1I8LoZE8d<%1x
zXgcX@x^An_bHM4>mmEnHsOJSvzqru-rwh%7p@3_QUE+UJ#N2tXjvmHY?=Q+MmmVVY
zkv{5hBLMYlZODn*#W#l=jNTT8{D*B}>H<*jDNjKy%+xvuVg-}118#Sb;RL8Yolu1g
zr|u&?+G<ZC2vPe{@6n=FT4!F^k0NshRHr)IxJN@|uyhQ43(bZYJMW-McCl5U3bb_I
z%qJjYhxp&HSM(4;fT54GJ{!L@`9s(l;2;o#K=4bYoIU#gk7-O8F5bC3pwZY`VCfFu
zyPcGQQe*9AkK*n+0JhbX3kd5MQwZYi*0GF<p-i%zz$#`_E(G8o=tu?4YGPSR>n|n^
zbFQW~viRU(`lCamS(`m&ur|z>vDL)=KoCXf2B<Lf(I{R^F~abqHz`u;>(^_8Y_bXa
zyh|@_lCaQSbqMVEydCV&;rcu8afb;Kj+(zwO6-=YS@77$UpjeCh5Z4&V!JubU|Z5z
zXh9T=rqD=@{YV&_E%dfnT0>%BC}R^QbdY)I+iJ_UvOXFc-UbbLJdNJ{Rw=YQ#%aJW
zdVIlWZAL-7SqrPglFb1(r1r;V-l5lKG3Y;t5F7IGryB(Gg7O3%-e}hP|9s!Igk%Hi
z9qgBy$UK_Q<*xD@?L$|u2Eru>C-mTlgoe4L(0(D>Ru8_}+uvT`E@$Izww6|4_PEYk
zDo>-O%6>9Bv)Ia-S>R^&(D{Eec5X)ugD?<mDTj<7{Wq5Uuwo36Q~-l90vp}2Dw!2b
zBBl(uCXt*B7m~~4swwh)5*L&T6=zr4#>HVw+K}<F?6l;W&p@qBUe&co(@r|R<ECSu
z8kgTl!^9SeU(4rzr|}U`c+@Ap53ecyEfOAe7r9gu#7%hAH#&Sv9+`;h(4>!&m~Lvv
z!d^N{AZio&^$GbzT0d4W)mFp8Rg8+ZAyHo?w~uM0*Jn1fuYqKOp4GDB*x|Te((8U^
z1u$f1ynwt$sBzvU?c0-nsop_Aa!*jn*BYkFMDDW^xzA+BDyp-`^<=#LWdmsa_G&co
z0)%hA73AZPgm6BMS2ZzTBfZ}Eqxv|LJ)2*yC8K_FbG#>;)$w_&u1&5K$8&^Fom>~S
zg>@&JIzIKuObMMLmTd&%95oQkt>Oy|CTfIkzxVMRQ6toAq5^{I!!+?_?A($Z24Nt0
zr3l$3x&OsBKWb5nGvfnLm^W_Ch+k!|U2Xm$a%%dj<`q_tgA3W|#;E31s|a|Ke3+e`
zROh&LvH!(e|HMTr)puonOj9;?W7>RVOv`|;qXdZA_3C*AUx!y^-;Fe%3$*HsYNEqM
z=9^2s&?(Oc`=l$2dVzY;{2k`_Exx|4BaUwKH+8=M&&lXSZmzFBN^zmb2)X*LqDHS@
z_<F}rmbi_nm*<BrvX^uI>Nr)v*Y|kQ7@EyT@%4mPbr>?k)O+qOKH94pYQWbQ{{%{p
z)N=#AzVOKTj7LWC_1mNqY1&)+6%T#BvRz2JpW*8_q0`IsbMf`I(~U=Vx^Ky$sJ>pk
zXx0~VT0SzTW$2_YdUT7fXD7`&I>@X?cgj3xrmyDj=-4o~XXtw0a@xpeRzlJB^+aLE
z*~RjIjGb*7gdhlnuM~qB-v45|e|+8T13CZ?nguxw!=LR$*Bb-`#;ID5e7|8=5j*y4
zd8C`@`VW`xSXm)IqwtKJQuuA>zgVNnTvP)s_-lvsL=~g;{Cx&qXB@H?|F6h`$iDov
zlp{9Ki~U}s71_7+J5HKShImpL>44We69H)L*@|x;2KyXaYvO!Wyc^?2LN8wFx47MD
zzbuKIV$Bn^YU~$$Vkkc&v|o5uooqC!XGJw|R;fIewqjvRe<_`~%qQAMvF11v0HsB?
zD*TQ|+lo9W@bz25W8}7$Ng$2fR@WNH;_q&`Ew@2<rF?_C7k=AwBcXDnK--N>6}c?G
z?F%mZzStW3yPJk4#J<|-`>Qs37o$Rn&V$y9A`1#8yK~nkI_Hx{T}Z)Dr8=kz963%P
zFm~1~xC;gAUohE`kVQM+!V6n}yf=USCQ<Uk*tys^5W+yTrR?zUzp*HH;yDT%PYSRA
z!LH$XY`<*x?TTjRWE1{%I!|qPG;q@W6A5m+%$#o|eDgO6pMdPVGaB^R1gI6ALy1C0
zRj*;@j2Dco4)%BCUtko2i9c*q^~%pPN_OHegZf${kGcva`;ABG`7K8jPp21zLfSpe
zdh4maN4t=}eFbXAR`7D=j6tAw)+^XmyUe)bWRvwbHmS|p-^(pxTg<rYJDY4d_Y&39
z-@1MkT3Y3MRIYF7<ySFIq3FO9kzbyx(X~-~3B1UWoXgnOQw2|Ld~>Wo?Tsu4Fn!N4
zy`q&Uk3mvhwamD?B^K@|3Np`Wws(FW=LZ*+yb)c|M(vGi2`j=dX3q6-%4k6<GPbzE
zNHp4R!QdEe)ZW1&;5HfDrj6R~<elBPeHx1L%L!TdGMCAX+BG6q9O-X0>!k}MwMRp~
zJM#SnwRcb*kM3nIqW`G<$=DfPISj%;u%)mBu={T;$%jU~vrp>^La>bFWwiRmGdKXE
zN`IL(pI4!Plv2Yu3aR}DqishmFA9`>F)*A#<*!<R5>opnP0nX%s7C*r_LXB_%~>~y
zEAcUiQA+*ctdQCVLpAWrQ|(RBHAsV`U#6|NGG}1YA2Io6q>?Kc252a8g-~Fc3>8xQ
zKrUy%Q9I0;6H<GQkLr)cM|Dk{Kmm?(Y^FIirmo;V2wx3`3ZXsRG(bw5TXB@^thi^#
zP7VJFUzl60+pKtA^B7|4X?7|~E9!*-40oD$C}j3U|M%=PpPJGNjD2g%pmc8aKI08@
zgDQ7Zmf;PvVZZAcBCQbG8&*=AQ&HUzt;O}tf#)4L!TsO&zg{@sQn8M!5Za~W@DhZr
zpD#i?aWxSL&9$Jw*!f&%R?_#xGy5E870;JzvSzNyguD7C6Tl4D*S<=j{k(X4E|ZIL
z;%Fi+;3B5hIB2_x-~BLlE;tOsAPl|I0{M*lUu@bY9@Wx84q)}8v;oI9F=BG%vJFAT
zzPl5fR@e1CkdzEY#7iq$U-H$dt+dCx%D+J;+HcxsDWsP2WQ=Vm;0zLX6<BWt3BC)$
z>^;so#on0ZIiM?QXNYzVQVcDh<#I_e>=E<|g!Ng`D?qfzC@mygh0$IRvNJ6E5f+wK
zVEcc+Krd=58~@j2FZMwv+P`6ypL=e!+{J&=2w|XqrH0j_h5#W!-oACBeR{@?46l!5
z7IdnSjXfEGgp?@n_0@^?v8Y2k_Lp2%r;oN{BS-6*W63f0nvPM$qd@wqLM(F0Z(YUH
z5|KuCLncA_wBxrU6Dp*c?+OadehF)$Lz%^OZ}QgHQQo>LkukR^c9LUl7nRFVoSZ6=
zF(m#ehXa}u&l+O(z>ZUFYLI9-R`-d=c4n?ni1v#egnQ1N3L0Ye!1hz@+^sXdCSQ!5
z>k-2s41-q+mIGn`#rmVQoGXdU0KN<41>&<bGzf?g+7rMZ6jQIGn5+Lxh<1>o$1G~+
zd(!~)pBqWEbET4&sKt1#t+m+_GIgyfl3u?Hw2a~FJNH6%0rQp99($ZN>=b;s=7?Z@
z#o@Eob?rlXvhShvpzC_t&G6jFTQT0b){Z?M9yr#164D}?tN|@!ZnfC!ML`JdgJH1W
zxMBMRmdV=qTv0%>?8$2SxeB3uB$rMOaA+YGA+-1SY#7hUtZ5fA&@zUSN^cYhiv<J7
zh|*+^iw#3@k1iFlQq1#w=h6#;3AA44CZ&<Oa!mvvg!U239P2y`>3VYnGVM2)D&KRd
z0-5#)3nbSY9HjX=&*#_=?Ou%cTxgNJW=)#FADq*YQqlL9?(3wVoN+;A?X^ZOke)y>
zS97Jz_*`k808hE4oaZ3LK8&4F5`-`aL$9<IYP<Kp*nailST^(kjE*A35R!kfO?jRc
zvFzZ$szYJe^<3W;(C)Ao{SGxhU9W=Ejs^p*sOukgTR{7hl|!3ToGEbHQw72zb_ipd
zSv;%6eWagBP1yq4+i2S`#ETX<IPGC)NKR@H*nrwIL-i{5+U>7HVN%!jd*{c*x9}}u
z7kCA0a+1%p$Vp60!!3d#n`=<T;IuzfK-oFcpo-m6*}sUL`_2MfgyKxW$u!wnC`bVY
zr#-bd*R>AKm`Ch&m>VOp#<er$QXBS`nY;Ma=tUnpd{?&ooH4a+bft=^-|xU7Fdzze
zDpzsO>~=+sWk6RwD+bOXF&X+v#dTNTZZIFiSV|8FY=Q0hJ?ok?+s^6fXPh1bY-iBj
z;hAYe12b6d^j951L3dqq(2PlU6<@jWW9$rU7zSY=xKc2N#``Z;sS@X?A@2-;5>Yq6
zbN>Gy3n0^R2H~<=3-z5a(~BcXhArvZfNCGfY~?%aH59S^(v@PbLdSY1%yb)Arspc~
zB7)*axGosA9_>;3vRTLsp}?!+To&+r%iqo>{guVu462>l2xP)2)<LLtYJ*H*JBoE7
z=G{l|eCH$BagE9SWW3~nd%DJCBqTLCi`rP$wCg`;hJ<YToZ?Gt-+8tTz4vxPO?P=(
zpW?YV9`n7*=V~d}q1ux%Wv)VBcKhL~@6Ytu@eJh+?QiGDywUXZ&X2R0E4<V4A{7Wx
zuVs$hp4}m<CV%9$91G9~OvEL7Xf4RwaqsJdFV`L}zU21Fg%?o;<{C(Fxb{u7YP8~=
zi4BCuMKT{+_IA8u;H`u8H*|lcFS&i+!J~iQHt&7t=es_1M{eJE)D<2*-tZ9R``q!(
zcsg5s89Ub-hCvtzuhilLl>Ha$FFqrYo*BSuLo69z?y+iDUvbV4_|@ZG)`dg+#%tG|
za!8H73i=ANXDe#k|3o|=%o+l2=l%91FnYXQZ@l)n$~z3T?y?e#=N+dVHiW+Ftmdf~
zo_Bg-!E1l@)Ae%!Ui((t?!0)l@OJUpYJ$m3e}5J+r<-5nfK=fB^TOLV0u_7c<M&WS
zxLV&=5Zi^9CrY@2Fs6mK?-}Z7En4xs<Mh*Ic6%I2M4d8^M$;WhT){p_PtNqzEY50?
z8NQ@ZOb91lha-sX>3+y=HHuk=hfLzYi4%_Ecbg-(`f~<vhgJ|t#*d;_=N+lv`PwSe
zPSYbc?mS|Z9x`X-?@&=YjU~N`cLb>qY?GaR`0q!;Lk0oCCkbPI|JB0Vhfv?5ql@Cc
zLE33YFhM^@(a+?aZb_WXZja@v{}?;B;|hTohPJdU!iN4E%SWQaox8-Q01v~yElcvg
z`peFD{<4DDPQGx`V&S}+|2_Wi3>!5WNf6tq(;eXaSFIQp9x~)9`+b*1Grx4vHC@}8
z^ER4DpH?2JnNT*fMmJ=%{nOzY2~RV-0R@@U8Ly8~S43pAoy!+i-j=l^rwq1-8LD%m
z2)lQ`tCgLe@7#m+#B7guhUGHYo)oNujo*kfWw8A)$Ug_>-(zoL{b)aVs8A^1n@a%$
znU5sp0L-a3QI3^`NTN}LW=ahD{x-s3QPtW#8EQ|Suz^&u(JcsGyE*Z5z%d=s#G2QR
zt!?JbBy3`jHRUGN@4m~b606E-bE8U8=9hMF?zEz4G!HV=E+Br!d5c;SDnsqzXW10p
z5LMf?>d8Qcl)Gka38?+ie5T&LK<ziY$o$S)UnxWFmT8=Mvw)jOtqk$`jv+39c3ACk
zUx3|6#o7a#GxBOiinHqXyFZMb+YQ7Z3<O&O;)SFC#!mO)Av%yv0a29jvIp<_7ixb9
zx|3&puj(ijNl;31@H%LJ8%uxg8p+r^s3pdo0>Eb7|MPRFv@i$lXXQ}55*)Ojo592@
zAJG0XzMvUQEMPZ4JH<7lE<IYDG|#>(TE?BC#juY#s$t?V#X);p0sB%*v}A5jf6Vu?
zOV;@O6!tOeM45Csh%bLs4$UMu1><l~*vI(zHiFRh#PdoH+TRU|0A@4!Ufb30BsbZ6
z_21`q02h;1sB+NWJBn_MTr38_DkD;*Bx6KxLFNYW;E4Bj0oq?m8cY!5L|=gRqoO<h
z&kov0BUNBtjTkPfqMYaC=0Y+lCX$2p&U~h*wpqM><)FQLt#+e$sws}0RrO~;Q6E5E
ziQ$ACw08<rml7^9Y*ron1+3j&zzWblY1mVFZ%v-{=!#syhzKo)UTS4?82}z9E(2Ny
zGE0&68}ct<XO!bW48qVeg~Z9u{V&!^6^~VCivRk9lD2^mW6a04_rZXGoLTHiASX^=
zSWwLG7&}mcFl0|9(7wqxAgIQ2d!{hR_pMmh17-qfPi2HyOusQg{EBwOZtn}sLVfJ^
z@6R(pdks{B$Y2JlDS`G)P6$CJ3~^Er+aHEVot~g7#M)1F;E8x;*3Ed8#Epnu@!71q
ze%=c)One4tzZZVrpZYU7_kGY8xk~@$7PC+XgaYn`F!@FT?K>cS5ZjGFwGwC_5M-+G
z>ueKf*F_TmzF_2Hg@Vkgfq92lcYmG}XrJWXvwWe)MFi0P$9YB)^z?mYS|}4Cy3EUY
z53^^)k7-;`6&B3zoCO@n%Ln4sF@6NGox=VEt1|^0CD6X{--X=d>ifI2uEw^1?du6>
zM=ikoM+vlNo8*7bH>+|BCQblpqc3txAPjWv5?|%^%K)5u-w<yuW2?LE`Re<7F?J?N
z6oN1iy^^4fx&O)j-{gf-OxU@}0;Cu^J$%-V$9=zDVZ@&|ZiRacNo?)repK8;2|`^4
z{^WZ`xW`0o+Y1Yl!|Z~XPSC>tE1zeF+2`7rtD=^sAWf9WK+YS+8s|4T)r$8Vr1r*s
z(}EP6?->}iPqh$<a(qIN+9#vCdoP4T;Ovmvtwn7yUd}*-aG0$ZHp0R|W-^zL#%=z8
zagc#{aRuorZ|ci&_GpqR0swON89CBEi;k{6(UCyfr`j+gEylYbAG0R&#;xvmwBQAb
zTh%(!?!v!5TAaQ4+Hj<O9h6dx*WO}9?THoTNV_0;8;)~Uyp8O5lO~V7umll=I@J;#
zS>Rp-p-%2?+H-FcNITdD;=SH;(V*;gx5Cu3pE+Smj<xqV2P3kwI0wPn!D4NMz%t)A
zNJ3o@O^TRJfwhO|XxN_UNRZkWZ+&~bZ+?uOQ4+%-2t=<GwXAagi?u&2PBp**oX{C-
z;<CK`UrT}vaqDaP+PG$#+Bt*+lBbfW1z{BGCA>$Ido#6m-a+9#)VS{}uC?D{RO9~w
z2{PN-QHx*|MMMNmYQE4!QKPU42{N6@z8+#853&li_LK7Sdv3U|U|ReB+)wSfaIKv>
zJvF2e>uq?BVF~f`D%Q*K9F$tfs!?h|Q~RbL)6f(5tU#@u-?5Nl03IGh2Jz(g&iDPS
zS<Ne=&Lw+8Pt#<p5$j-DJ3mGJDwxb!z@+wTt1P~*qxHit&Dp)gFO4>iqi(g@Q3sRS
zcc^EpK|MiM`=EcA9<v@F&!DIM3NdZ*T6+zuXF<9TKdE`0dGE89_YQj6mF)pSx)M|m
zOllX-qY;eV6Wk6=YQN7N#5J4LzPDkNZJ4BH+gCiUlz={cYY%)GJC`GdK^Tbkk_s@N
zHT2(Da?yhsh{P=y#s)heubx&mw*IfP7&W+OOW_c0@Fh9?QW$0J%S?99$MKX89<>8v
zE4VH`YDE0@)ty@kraL@L+ut^@YG2%9+nrmiK-!N^v%z)q));0+NWM}hly-dM3R&`?
zNw%<%LABQO<BsmR?X3sOUF!i&q@5FGi3t6_FJA4-397piD`6qS7MrFLq+q^dFR$!(
z<&~l>Dt^F|kQqK_CXn{NDecej)k%T0gYb{Zd-)kFnbN*u%l!^p7GCYgk_G?WKxtn%
zLdXpTV^P}E)|$A~V6EPLt>%3FJ;#*xH$z{LNqK`~0SlSM^OcNbFkdWWpi`?*Rf2Uk
zrTsB`A%x8w08oNxU!aeAhY`xe_H}HzvoRH7``)MQ_sf4oCbkQguEJJVf}q{R_A?aV
zN3rctF$fl$f=ARpU&hV=*I^Kbp;!9Q)zJH2Y?}1*f>ac9fN2F0LL58(|1AyYKN`;F
z!4KH}PTjrNMYjTMA2cKdr(GuWwNXky$E^Vh1=zkN1=LLqL26$bR=mvWqFaFNp&IHf
znmFC4vc&|M00}1@t6?7AfweCtu;8gzZ5pJ&+E>9Z%e~Ae!xNp<>uj?rZ~|*jP7lN1
zy397GDJr3#qI+{~j8<`5>ren|UwHV*VXF5TTU3T+Jy-s39Y%q*?+s+@Y?Q3_%%Jy~
z`K*TCBB_2RlG30UOe_{FNK>Q)*1n%YY`*!arV!Wr4A#DN9jVvLw05%o0QWK?M@>4;
zOl*cvFwNBt*1i>1*RcTBF8Dy4D>KYc^M3QonVl@N-Z)qE$y>TSm})S2?fI(voT)<u
z);_qe1Sj64GHg-Pe1Pm*w-)qlXrk@R_(uV?t0A!>d~Xx_K<&SC{blTok{ASGAbKT1
zVe$SKtJ5hjj5?eC^(SM2h+%n2e$Qp9k}v3#+E+Yv2T%1bIi>a$T_&L=`3j!*E1YX{
ztjMW;iICct{%DNX%k&+oo&5DP);F_#!TE5jB;coh%#xnPc>NWfrqr%NO;Dno?zbyZ
zKW2oef?xU1k+$j(;?3LcPjs1Z!$*VyYY)tf=a!z#Rl7%K)PJf;EhQnfk4PUl$p}rx
ztGg}bt*>9nc=0Rn8rG<IJXJ{Ti|z5J?UdSI>kxarTm?jC`iAi5;kS07wS$+JXanF8
z8KJd@Eh1rRi(k<~fKyrVrv*)|9ow(PMB)?M?(p(tp7k8>_zz82VC{ixvgi1_1);Ua
zdqil~{0UZ+Yo`H7A&vD&-e0tK>U)VA)y1PZ0&54yrEX1?7m!6?RQ@w{#cE65{lMBI
z9VU=VzebgQyPbZ!q+0l+mB8AUkg$CiJJ%zIVGsuI(g{k6tz`ej`iqa;rH49zFAv)o
z$wF{0n0MAB#h>E_vi6IZL&_f?^Sv}#>Sj1JhnWdvecnUS@9ZC=BHK49f5L9$oK6a|
zz2}JQ>NS&ff^0{~+ivaipK4KikL|BDW7ktWMaD35b^0Z0fBz?H7ozstSaz?;auBs6
z+6sgWIg7=FTRX1W+D&fEQKP8#-CPa;CuX6xaBD9Im}3Jp_GzA5s|u(00N{jKkwvwu
zFG5Ke%;8&1d(z*f>;7WCl~6J5`{Gbw6Bz?VCCiEg36K&qNKxuJmZdRY{HmDtTfjMc
z^O|?Aq@C$Kf+WXm{6+UlI`8#?VuBUsF#w!JZOEE+&w^^dHE<U|(mWS1xB-LMnuHlk
z%^*P%@N3K_RaE<}9*x^QU1ltYAhlfyfHm`5RC}D=EQJI(&HU0_qRrd*UbFSr^=PI6
z^=z7H2>Td}&{7R>&exZ*E69N$1YuvA!5ymq|JWWj6tg<T2asqKg+hz8z29vMF@6Np
zK64%t^41@>OTL8medoQ3K;>bwUkFCRpOs^EopG!{{TNoO6W2s5_PYtL7!VfkWMJ)k
zo`&{8U*9VxN2YtWfa^b@vpee&dd=AICH#yp0V>FF`aAgj7JNel*8V%0pDov1_(EXq
zv-l#*T^dhC_O+*NI}>gMC!^*7ke;HCI;=~vcJd`y!!axN+t)!l?QD<^s35cDTIlob
z*TMnFUhN{R3#@&%<$jCzIk0wPBAJ4MrfVALZS9Gt59+!Eh_$CsG(%u}iZws0E$?Iz
zdI#1%_41Ci)%UrRFF{o!Y9n~@P7-UMIw*KIideLd*XgE}CIbR&2RUiZq|A$df7~iP
z(mptpGLh~G0w<$R<@wb2(!RjH_D|LZZKDnLW$cV{C<Z|wc%_Q1uJ^y#`*JYR2OfZ^
zO*ObK!!h>Td1h`hjrZ>q+gB+5xP#(%I-?$e`pJ5MALFj^eH07z9kG3Jnqeu3b2Ck`
z{RFm8$Wy}CzB|6mVppD=Aww<AaM*K;W9$Cb&3QGF^@epg7RP=&uY>DvN#;zwgr7M)
z9zDsN`L8;4*-+<V(M%5pWFBJJgEbp>?6L1%4S<{>;{fA+2QU_5`_fT)+;vnI44D_|
zTxoZ;7AnXL*m^iOT21CWouasEsbROC?7_l)kjDjNvmW2~1w&@xbs&0M@~sZ6k9x;$
z)D+umbF;ROo2+;2kCOaX@ts{p?fgsaJadlob^&W&V(m88A~<fmUKlcmh6y$HBM7nG
zJy7I?HO?o6*uMCu%AJ2o?rh(ju~y@pP}cu*QIh5o!r6Z8F23)<A7kg1#4rfMz$-Q3
zCGLN*ezB&7v3&r~ga8vqNXt*{JP)i#?$B8<WH$R_&)FY^v;A^FP<%;Mz}io@c0}h?
zAvb923ihM_&n{r?%l`NlzTLq^4Jz#~uefnhg1n-T+c*1T&DkG?+<vuA`g;($eZvqd
zhapy(9>Un)NA(iKd2&G<ExG-cAc*=p7&2rm`(#b}<_(#%9UmeZMVY~P>rvY+sS%9V
zakd9Z4WYMRsjvS0qPJ69=m`U2thgNYVuA`-TUvViu0NZ_+<#^mGFy5Gvx;vhQhN@~
z9Nu#PwpYU>g9(a%$?9uvf+MrlGDksA*s8~1^xreq_N}(%_>D5X{T65o=4hO3>^B#N
z)6&}q`ef(3KSoeH&x7)syOc(7WMsr=;|ls~W9jXK^w6Mx4wx)LZ~xFUnC|WLDqqIV
z1qWgf1fo~kwJPKNFSeg#A7*L51CZ8=6oz5^+FlvgJKrPp+MNqbyy`{H|HIpfvG2^+
zZHsrFvHfdj?O!?GPOR&$Nmx8radg33xOuKJS2o3ye=G2IdLjl!p<<8h8T$+4Oh-}H
z;%Le`)2ozS!IoUK=h&ve+v!<%YMh?qlLBwwY~eoVmrKYM+kIkjoJ}kW9hr?BOATB6
z%YJzK&h_T(KMLQ#uka0GyA^Q*ynQ3OIQc4nXLMwi*C|et$^A+#^cJ0hQRL6y?RVoe
zg>Qhj-)dbJ>m7e}Xyam;*7KgVG&619V!f7;WAk$)H2Uaw%QZHO^{!~kw<_{yE=Pp`
zIi~kC^F0D@2P-fq<`sGDYLR5#&-AgiZt^Q|!lEv7a(g5M_Ep%9XlrL=LV>q$+>Z;}
zJm2^{<i*$-T`>&8FmNTOjcK(1V(m}Qyp+le;0GZj2yr%lHA6IGb^S6n&%F%#3%`Al
zeLws+DC)>eyb3&n*T4$&6+R&z)aB=-f^+9!?dE*npTi2ceU+@?fnMRaPcY%J2NNpN
zfr!mmk?CA>quOo8igl1PdVu`q9s%LE1E?qUX4C5&h3?4<iFe&3F9^7Of`Jn@!1uXo
zwl6rSXxd%q_Q#%X*YT^{*@rfD*Tv<ii{dEhb)6_ALu{V4*LeBZ@xLB;dS6ud?NhtF
z-)x?j%e&AyT!od{^jY^lC+AkpJrTlhUow!s&-m?AZ0zxqs+#S!hBBZ1dL-cX#eQLQ
z?VjIs<<e%%jnTB5CW*i&hzYoT$(#B23*0`%jy+aQ`0aStS-hy%b)u5YRF@l=-|ITz
zw-cN7-|+sVfZIRw;LX^%-7pZsK(M8Vm$Ush7UhEh3ACmFlpHd5W<6fdwe^jWQ$6`B
zVlt9=uGO(yey`Bm(Q_~;Dv_Lh@OI{{tYO_TlINv9IJ@tmMO*TZ=U0%5bu7}<tAv_r
z`|e1}8z(uvj7Hto#^c&%DH$J;IJVPvSk}$iXR*RZhP|p}3`uogIJU2L$K|^2Ghj8U
z&M0o&1|vE7tvknAACdUTl;sq^h$5d|wK#vbywOO)M`n9oPD1jQWHjoH!0<}0I&sCg
zURu0{ClLkReo>#3b}8Z6ekBroJogLD@Oh&dgptgplRa_dS3gxzXz$^x?3!x(PEkO(
zev^HMW?-MW9Yyl>Wi;wmO^G)zHlem(GXCLP%Y=~(v`UOMU(v@TYWp^uG2YtYG|Jgx
z%~?n?!l}0J-3zF|zB(xA_Dj`j_$s@g+fnNO6K#KtozW46APfXsdZLn~|Hj@|7Dg~<
z0Sp5~#m(iCw>q)j{0bhpx1!j#5NBkIan7{f`kjMo`zBi^h)kev-;f|-HxTxFSGx4t
zDl?$%6W!<^=|<A_K^U*8t$Dpy&~{47Z(L})xJ}ws(PuICetLw_u~&J71+=}9r6V@F
zcov}TsrYQ8>w?$nx-h6HKi#8}U4%wLhCW^!ghpL_6u@?bi2WSR-RgP$c>f$(ouChl
zWVWsybvXN3HKeP<Ibr)gK`+*OuVdp|az7Hb8{!-X)`_MIfw+B}OcCq#0(^<9na4WT
zK0>qDI5Rl$T+fS>%mh?9Ujh1}grfB$h?5LLHJXStuSKenuzgOHQ)nrE%M!L5VkD=)
z#80tT&!#x7apiY)MjI#^j1}wkwYZFD;S%#^Tp{}Mu~+ByXYAUNAO=C$l@L+!{uf(+
z8am5v<N%r0*1;t5AXpQ0l6gs3ElJpeZNyNel+Yy1cEp?*n@wxkO&+uT{oGzMa!myL
z3NZ&o1Z!N@3pogL63HrST-G~TVcO!@XJ4VUuj7K=sgY|U&deO;*qyPhWCWSOY=0Rt
zRx)G`wlOn@f2*cRE}$5PCj}jB&vIdxM!B0{Kx&-(NEGJ-=?-=<$?hDBa}X2>h8rI$
zcd%$zyK@4S^L+)g9q&A&7}hWA-Tz~qcmADK*q~DWf3-1Lc6qLT%cB7b%;k{@%=R7h
zIgEP#f7Munz{@+2jMY+eK@**sde0K|Hc?93d2CnDoIy*R!9+LV42{R<{)1nw62CI(
zx$_l@Vf_*(VYWZX!0NdC<(%PQJGtx*UiV?_igGA~LD-cx#W%SB#oiKaF>x0E{2|*M
zgIZZx+u9R9r>)*!lI=HJ|Af7#E$|hO;K-w|!xh=~CCn+7>rWWVajh74;a2Sv6tzaS
z9dg8*^M99{4jb0rQ)p?sDafGL3$~pa7@J!{Z=HV0w(psa_^ys(&JciPT5v)_KXhof
zMH=*vX^?FDGKCiV>+f*V3z);&_EpF!U=G;!puPh840kQbWDRWlK<#s<NLbgk&(rqu
zt6-y-j=IbFq|YGP_M~L8XXwyj18n;>)svn~5e&Ua6q8}IU_*@Uy2yOm!m;uqEjfzT
zwPS&9A1L|?P*CB;_QI_wWqdCSC{_!%0y)XP7*XIOQtjXgZkBpX5bY6^p=fMH*|baj
z*uIPLH5(pjCUzRbryzzH2scrD7=dRWPSs{M5g4HpFL?G~(%w>8p|V8+?DVLEUsXqe
z7C^LLPI%t4+Kc;Lf5y%wM`92LqF15<nV9=utkEd-V9~OBmkmn7$C!uhqOm8{B#&-v
z0ia@#tP#G05c>{(Y<X83wLb*)oZXfGu~GZg_QHqp=b7xQ@jJD|C64A6E>iC07`8{F
zL;~ThtuW8P_DQ8aWNe@6y|>@HEge7H^5tOIe%-{29W{yyKL^_G7$`N{=k-*4^gFlI
zQEB@_@hrb07|pyr7^Mf9n5Wnn%-aJIO(BA-o=<A?cEzF2djF)(x*B_Kv5qx-BGh>D
zt~PNGWHg&Y)zk{oVB$VWE0<l_^~bq|4-A(_iQ2JJv5T6x2X)Z7s8gPrHkyfhAUS%D
zQa-0m+=KEP60S~hA~bQA&{?Dqt449GGjfmqt!-`qjNGH+pE>_%J>?xenOP*mQ=wa<
z@Hx!fgF;2ko48uBi<`N>%kO_Dj-B~b^p?$*J%8z9h>OFhp?jeEO~$i&;Q;{MDdCJf
z<a)}jmZ7^ON^c=WKMJ~H>VE0C1=dfo^+U$)(^nMJwqxdyQb2b+@YB$KYx`mB+>#^+
zK_GY~O5JX}|HXD<b}H?kfjt0WKTssa;$i#otTYfpjAqvhmW<pL$!B&0ZOyXeY{|@h
z=b6E*I%QeWl9{^#<6z+E26i|M+FW4VXt2MGy=FoCk8RW&51G1)-Q_!UJBVMkG2u`&
zobUo)Yb7ihyKmZCaX(yj=d&ea_oVya#CFyjQyIH|O#Xx=XrPjfv7Kul)dFg`=4^}?
zs%~86<v*>)K}_D0!n2!l^SeeJGI>vufae?6zGd>BCZuN~Ud<Cb8j_<~+hxz@_c|6H
zT&U~*m(K5!v3qi)`pnVlRma#p!G*y+lW0~fWA}lO<hbFK_4)IXx%)T;26+H!y&IOn
zdmhyh2+OVsivaHwkUU^TG!KnikvcH$-HmJYTBiRP<Se7{ER**{HuqG_sOA+K_!cu*
z95twkg+}js^lYQqd0o=@GB$Y#cEfZY)=y(=m__stpVuo!?H*?D?@!}2p8D-(HW|Jr
zx2DAbwrYML!}o1EyPZpaYkm03*ty_F41-YcO2(hq-2Y;&)O|y$M6d@yaUvkR0ozzY
z9=QEsvgBC=alm&Ji;5j<t+176?MOWRtHa5s0pDZuG8-9Yt}9LO-I@jke*YHG%9%R{
z^qos4@3zH*RcCDkZ6}6%{=(3AKXD}0`07}xX~ORx<^ESmtJE6BPl;)FE>pPK<}%#i
z?;C;F_*$*_T3a4X_;VF#(ONb5yUJ3IcXBVjGnn+e@V`7`t#B+Yd7&Hf<JhNhY3d-9
zHsU{@(4Qv$-eV@?L^G-=l?33=^_-hoMcNU7Kh|FsT|5_}wI5Bteeygj{(iK{?Ix58
zOPIrW;T3tt5`RD1dgbc8`Bk`vigz_QT}sw-A!`@7L5W@Eq!)pE0UP{9#TK^u2kzhn
z<n<y91mArHFq}}V!d9BFBSjUs`Bah#zMtrCsCF)@eGYJ!|NrY!6zi2YT`@z+rbjDm
zsjSws3>|sE3%nm@bc|lR<-K<MaQ7d^&Mmot7zBb>0?7|?|BGd-oN1gm#pKUFl<cjs
zgnC%e>GKLE&zPOQ6nH-zyl-Qs!YnNJ`OyfQuD33Bb9Lqy(?%oBKSA96RJT%x$(l?O
z?*81LBUI8ntOrlJdotetHN@za;_mtEiC#@9jHU(NUv~HJ+wZI`xI4uO{TjnP=2&s}
zZ#lj?q;Z(c;5`N24^HsuBHI~5r?~s!+-B%_n&P4ayGvT7%&JUAcgWb=Eex^+^Nl4e
z=Hb%M;`(G_*|Pr9m3hkAvI<ln`+4S~33A6NTzV%qm!U{P?njr5w^e6JiMJO7c|nlp
z`3qO96ougy8%pTbm7*}O7pcuMsf}=Z(d#}`YM!xYH43*^!0IqIBF(zG1<EojRppmC
z6vWz#I}v0u9hq#_ULPi~gTP|#6{u0^&7S`QfOhIPeiZkN!3)qH?b1og^W?!RR-%G=
z$Hq(9W?i-^334IGc|gW(1=|!>3Lw_pmsfBCN|5V|urtb$AOwNvm87Jza{r6XW-|4h
zj|m*WXd6I$MWgFu|I>xlk2PzjJO4)+eaBV}i?&_)ztrG7h-VKQ?HiyG?w2*6ex$7m
z`FACnbq-_8K4b{%*3Z>;Wl2HVxgJ<H9_lCrWA~Td$E2h0znn5-FWzer%8$;lV&W9v
z>ZG~XxfMhycK9K(_CGGjc)dh~BjH|s!Y$+Va_(BL5wD)y>caK&Lj&pE$9TQst{5a3
z!@Ss&utmZ}ulY(41+ed?C~pr=V89+LuVrw8_2P>J1O@Cl?Tyu^y)t00eW4&@*D#hq
zRh&aua}N|HL_sLX_ft*18yT<{l`4y!UK$qt$Hd76<8Z;~Jqf^$Qk}%A9AXuK{h=7)
zV3?<;8QK(!f->FwCZY#Ug0FARz=RJBVbXm4tY2JznAfHSy^-&|(Lain+SD;z>6Ts;
zYjCEGZQ;fWlHdNOFC+F45$|vc4mIl97#Fz;1+p;|$jXfU<Gt@?f27P8VP}-%FbD(D
zE8)R0;r<ufty(`SrLzC}gAypg!}AzkznVT{lUcAblI&hrsK^P1PhnTjk3{U-nOhia
zhBZ%R*_w|$Xg$mTb^`+m$B1gpE&#i6iKiB`qptIkGqp%`1rZ{ek0}Yed0s_g9Q9{c
zv*v-=aTE<P(#_YDi2XioksVF?Rtec{;5DDf@7c)j3v1tcn$_x^zAn5B1G~z=u2RS1
zWb8L8_}g$+M^g}c)|u=DuC6CE4tGnhiaAS%*FZ%Ob`H__hB3`BCt}E*%FYDazMGaT
zSXdEfAX=j7FG<1p!6usrCu3NrNE^ObyZV%v-Oioi9M@-!|5{1fP1Id*m!GNTF$&yQ
z`r%}%!(rgRnnzqBYU^5S1zEw93dwwi)mNSWH_k=t;<c%!x2F6_N!&k)f%oD;pBudt
zM{J=1>}Y^mj0e^}{$@w?coR%<yNi@02dr6r(3uPBu2Ww_N~J!Z*p<}X7Jh~ejM`0n
z!R|h|A@8*<|6}Y7au|j|AowK%wuArwu|{eca)_X}UaZP(0^acgai*^K40oSd!-1dK
zuV&8#FBY#wa;jY`8sPopqdm~@wOd93?+j5B3eLnEK@E7%iJ+60YBow9$GZYN=0pnA
z<!Tz_{g}T<f%=ca@lFZIvvRWzBRJj{@1tYHZmyyf$NOM7r(%iFCI$t1m&L)!aTj=f
zt)n!V$?5j#Tx;@7(08G%P!15{G$IxJo<<JNK38-0q03BwaG}eLT#b$h056;FV}r8b
z(PT$V?*r?a5WTdCUJ2pl#ZOf~nTPC%vw{AB_osTxxZZVVUS8zo=9^KA=S9=kk2M&c
zTd+Ylg3+KRFg&QqAjH<Fp8)Y98<v2Sm{;>_5xO{)(>_${7NGZH#|W0)aL->IZKno}
z7XuhMDc$RoZb9SkB$I@hC{QDH1IIrK=lrj}!_xxC|3=1shfu}+{iqp;VScxfNrpP1
z)hv$GXdr>jv2WMf+92`<jG&#E>{{qr5cv;dXOP1%2m`?{VKxN(|Btm7k0Z6RbL#~`
zL}I(+UD)JgLH1OWJwfEDB=9zTf6aRAA;~y3Ol-2(dLIGh7ffISV4JZ<<(1wD3dZ`}
z)bC&*D#1&*gzIZUFQxpQt{V3{SR+Cg^7qLmb9t?4G&AD{3l0*xY_D6F3OH{@i)vB*
ztgD$eASx*abEGxqNEx>1Ap4=w@LHlF19D~H;$*LNHE&1!Y2@J4Jci$DNUp^5J0S=)
zYP0IZ^LH96Fm%*XVS(ot8OAYXc(ZCqR{}+vkXDl}amxGfl!KDnns+Mz{UPQ(J&N@{
zA%KTCKiqG1y(aj)CF(}fZL?W4y+ovj<CP>$DSzh}2wFdLG@p{dT=yTxUOh2%9%iIN
z<T!PDK>fb1pUBb78r9Z~I?~_89OX-eFOs}sO<qCyzA>+gv1%rccm)kGigByGoC+@Q
zBnE_G)(FD{mbZ~#0!Gl;JaFW~LmdybwYrTVsQmE{V`p|FK?noUl*ZT`oquBc#jDn6
z<k|obeE`Ofa>0k@p?hstB7Hy453JX}FkD`O?5lt6(MO8Qv&-5KM_guX6eWg;Li3;9
z&aV&kdSLUaz%3jC4))Tg%>TJg4nu`aAlq$rb|86bB8y#g^*BG#y;C6=#Z2gv_(b;}
za(==T`}CM6(Y=4rKE$Nwo}K2TCYrf`muMJoue?xxe9*xT>6XmMx?KL@#P=-%GHve`
zt2kG~;wO4H(aK4Fs1x!9Yc>&SvVUJc3KUFR)+{8JgNQUtM4CdU4?UB{_Y5+{=8vS3
zg;cViQA^`X`az^mCbwL2a}X|;n}g{YI6sJLBs^h~mZftaD%dt*%|v3sdF~qp$&Jwy
z%mmH{`Zg}nj4~4vIKPlfr*1em=@M{WmTK?IBKqhAoX^r-^0#MWfRVs?mV)52wU{Oz
zZ>5N&@+4}@Bx=C<L1Umx80eB)BTT@UUu9P9Kf=!ShG7^4!Yi3aG2VZ%_DB5@sTB-R
zr6JhHcgJzT`BS{pqs?)6WhiSZc?GG~9;r6K`I-*9aNQdOlm<BOI1VY!)6;U^AY6E>
zMNQb~WstV3n$JH&xch)*B^XUH&;qM>-m@%vk!aKWtG&IN0nZ1d0=D%MLyiE?mnW;?
zI%Gq=m{j$pnj<@>>rdhH<-q|Z;k{7Zvd+lGqPivWYk>6<3>D`9g@PUg=LSMAD9)L+
zA>NCUEvsD`mha}a45}GB9FkrdG+3+Q(g#HU7(Wp;(6_JPPN7`YUc)ZboBrB`=s)R+
zLlm@V3`IK5Gz(Bb*?D!?c@MH?{&v!*mP3+&(l5MeG$5gSTGY-DimFhmLp#2m5_GLU
za?;_I&kuF}T#;?C9grSl8(}cF^n<zGFGw$r@+SGr*#lM%N^b;gQ?~B@Gdn1~(vHYH
zVtMr}p@Y&du0@Q45wqdRY+)enL91!V@Z-QarA7m@BBy|D_<<rB3E20jdNX!*IS9ir
z48BtH(?aimF%Zx%lMpd)yhQ7^QfH3i{0yeZ2vlv#8heTd#ttiN$GudD_Y$Ihl#FIn
zg;E6DS1vSi|A(*%QIF~B=L~+^YltgT!@l7O!pSSdQi)H^VC;OJ%Ifpi?t{+`!xhAx
zd8|U+nO4n-i+W6;DY^B*G$&GZGaP+wihD*Q0d4Ml82MeiDl8{)V8Axr`pHn45cXbq
zK0>W2mR*GXal84f;eF-)U*)JI!1iEo#}Lcr3?r*ph^<zLU_5f8`lOh*qVAbWBj)&q
zld(;4&m{VEuwotIA>K2beeiv<C~>SUmJLd>Ndk^ETs*K6O27)^0bzYglDO8?cxA^g
z$NM^X9^T&Qx^V1Nd<dXB#Jx@C2@IM-MN3Y?-IvMNrO!mfCW#dK4ibYU5(C(KDu!2R
zw?6hb*LaN$W`e?8V%3F_pfh>F5_tjEHATULH72m;(D!~pcFb6_mwRWHDUxBhv5_A2
zS3U&({RKJ?!p;B(VHk#iUusvcg#UjGA+$?HE9U`dCC%1xcFb?e4C&72B1<?WQoYCD
z@h<urhJV8ygA+3RZxi9IpSXAe;8}#J3vYeoND$KSRTX<~rh`Sz_8p=$L8Fr*4Uei`
zSS2u;24>`#MZFTW(%6iAOrKsS0_0OyUX(-s0J>2fbx5!E`;;KRrDREOdP|*dFc`f#
zpi#rqD3M?z9pXBR3*TGP3Ds&<wdN-OuO4XMU4+>5IK*xiTO9vkzm0RX73b=M@l$JU
zoQy>*j2?=AWoB0pepy5`C@KD{9c%~w*#*UK+)jgKkK!vQ#mBJOIiU(|T2TBEnShTE
z*(X8?ir*QO6M12}ie=ADBwid3MZF$Ak*QrwLUoVcM5qloM|jQUfuZJmyY8Z>`_Dq~
zM~+cqGF9>F1i|n9B**)0dR?0jV3FgCRX?v?`~}6Dj_fN9zn>@HgYU~PzyC0HCP)mz
zAQZh)h!ErbFV>E2A6gy02gtZZ0)K(e120J2;Z42fO?^c)fdOlYhudSlQQ{o-RviS;
z)|+Rq@g%tG<OlfPfHjz)Y%anN@I8GFzuDVf$<&552fk;rO7BdP={30Ov;U9KFnZCO
zILtxs57auDfM|5+^pl5Xroi8M{&MYaWKYbTox_YGQ4!3Ge&Qqu5R20+Yc~^c>Ldj4
zzO@`<L(m-Jnb}{IoI&&o5xo+;M?FoNYQ0u4I^cZ(<S+!*rik^auMch;NH_!}40xXm
z4-O0y4h-LD9XM{%f%;2<-D8@2|55a)+Qfx12O(q#6h%YSoG9#_v<<DPh5AweUyK;W
zzTW#H7H=@06a|!ivo8H2!TXU~g!W8M5P<g$_eV#sA{=)Cc%M|UL9<xxXNZHu9@+q!
zW!7L{v@~U>lOnq^h}({fIr7jQK`kB^<%e@N`y$@<dU5<3?jozJifAd);gmyE?58~W
zMc5hLKn%h#bfpp!uI#_q{XHWUIRl`mPzczLa~aGLCIQ)@{P0VK`Az0U;IsT#2yVR4
z-c2Qi-_9kGJw1abl{(Y!$O5~61=o?OqMFDFjx9_VYuwR9Rsou-M}RfFXs(6`ZlGwY
z!k6cz3he&j**bUuHuz@YgaeOv7;wzylQ$m5bOWFx=HqXUCFowQgdSCK_{g+)J*=iN
zk8F++A@@KNCuiU{GswL-gF!)7Q*>9-+Rwb0;rLY!6=;jzW>0xIrb6`gyx74tE5-kn
z`$FS2v;BTKz(ecew?)XXq>yn@yW-z*CBJ!Y%L_nec|fM7Qslna!}!?-xgYRh$%`s|
z`E5=4mi#V4nI^JShC1;{7rv=TVTq#~@2PcZ1}}hFn&lw^izY>a-3R$Ka4v||e6ucL
z{M#hwHuC-uh=K068w_~AxNGkXIo=!wIlfvK);YW~yfQv&()crWZn+V|Fbup>tt>73
z{uk?4hYRdN>;VD<i60U*qMTpMX}4Z(MC(t}!f?T&-jfQhi^OqfUoD~DZ*HoC&Uw=Z
zqx!foNj<iu3=g|HWUB|lnHyf)E6flW&f9bDEX(&yCwT`P=hwCay?@mkmpPwdCh_a%
zi&xaVND%PrxX{9W4vPc<UnCfMfM91c5#f;IK1o8jL`O=-4A~fjyurCeNcfFY)gjnE
zA*o^tEK+(?66?9|P@wqC`K@A(bGjtuOOmC{v8`}ygW^BXq>a|lv(_L){6+6z0Z@e2
z1#OqNX`0~VJ>ld<#3%7y1vHW_jLj%1+W0mTig!o_|3v&+jNHcNxwOJ-I}Gy&yZ@sM
z1&S|(X(7%iJxmz(d~-jZHx($p@!KNh4{m5`0~GK*2vU0n9M$Gn*;V)w_FV22DE^Bs
z#Er?to>44;;$IdCW}8(ZYi}o#cF2IB2+1>Aer^A%&NS68V`q@tFbo61FUh1yN&o*?
zgR~kNZNbeg7r_aj$gAOU`MsEALNIR-wilQ9&5#PJ#m~N+Ubj|I4s9lZo)Jm$F{{SS
zos6PO^o5fE=I0TBM%mUx**4botFiuaa&Nsi*#uU6tE@gQMj>uhm6Y?)LNtx_SptC-
zKWKb#V5^G_R#yCi4ak`ka;9iLCJF{MzwK=8Vst)5y@iQli7Q#re9nSr3QPZzgy!!m
z_%Ia5#n*=BC%0$%m|ma6;xpOWj|#H{lBBo{9-421DbWx-Qv~nO{2v4A`^gx{QV0XA
z_{LeVQJz~UPjLRE969Me6$2MzS36N<xX@+acb*40zlP*&?DS&#Lln-ZnCb8tk<by~
z{GdXg>}@esH^KRVo>?42tH+iJ&QFHc47|Ie2U=M;pRiJ=z%P8PSzi2k|24t(3@^d?
zLD%dCJ#H6^D>0|0O)|E%4;{`?I}Eu!dAIjsC=brJd(^+`JXxrU9RK-P?X&cm1n1w6
z+<qEd?2E87$zd3VVc?e{C#CHFf2<4Ik<k|7t(Txl5N{)rYNsK6aQ-X@0pjqdfTz8d
z4~)(X2b~#?ej*V#|8`b~P0sxN3aby!pKP`xNe^{*jaH|eNT|8gixd^NUk~V}N;h|1
zX@#I#;=|`M?~85ztROq=8i)C34w9<HhAICvp9qfIQ7#iU+kGOgwq*PHN1@%%U|Vz!
zwj7LdM&7MWiH}+k{%1Trg69jsvItyX?wPOexS&Dw)-cgqs&IRidY5N5Q~svJPc+B4
ziQF^8!q~!b{(by1Z+re6ZK%$Lsm^Iss9ezo)Xsh3S@3*OR7?g&nw1Kk9~TN19Q3o_
z7YLru7A_Lbk-d&Y@O-S8L8H%?3!}Z5i2I7fys&Fr{pWd>*Mp=LmiFwACpwFTRbO-t
zRee!W@O%-PN`J&K4H5;<PwF;_L@N8R1Htp@6gq-|5oTb(^Q*+R&>XH_-6?o}B5S8*
zZ<vf3!Sg4QGJwG_z(8-Fe`oBBavTPM7<#245X1dXw%U(AM^!ZL0Z>Dl1n}5z{x`=6
z<3+)IggH|&qPVxfX{@jdTZmzgm@&tbuu7umZ+BK7JYl_OQOjJ4O~<sNV_LuG{pk7E
z{V6wHBFCf?2GgeMwigbcQ?D@VcHHAY5F^vmAB=>aFZeb^8~e}&Nzm>G%?H`S1>mcY
z^QS{Sl%DqvQzq_#R6*~it5*2s`@0G;gppT0)Iv9L4?euaJ!W_~AIy8Gnux7|c`xMr
zI`f4D7_OSM8VcS-sSQ9rA?Md|V`%2wXFz37J__FCZ;pfQ$*-5dN54kOOfYU3R=AKB
zk+JvNQ4=n^#}x=qe%bPK)~|!fbU&I)v%vN?Ct=DzZy2<2zx;rK5+!{f0uZvAU-iP8
z?7zDP>u_kFsFpKK*<c+L=P=KN#)3l4A5`j}fq?$KK+T^NAr{I`NE67^`^!;;{hQNV
zcIMmTZku|LNbJnVc1Vko^}VqFF?Mb_62l-6ywb!&0N?*&`;}_69zhO(5?jv0?V|gC
zEn@yx!Pxe$CBQ}I17{U7{~CtO0y8xu#5=6t6GKBTjB%6o#E%2!Us!_~!G=SFjXz@k
zD*Q5*DLH&D9x;C{qNwhRuCrkq`H1;TEyjV}Ui2cbr+&de;Wmx?y^EWtkP1k12!X-c
z&=K>~I3dH@aLB%N`RagO*BG3kcpr3q<*WMJ-k-w{+1S8Z&nCFU{0s4qa~B`BR9oaU
zw~Z=3xO@5j9-dLv8m#|NNzB(9jQ-{UU~$C!VnkHvmwtt9#aRhRqkn8r|HS6&MN%AU
zhT;V5SD+2N<RFFZeK2K}qie?;V)Hq7Hnc<Q;e_~zsaQXfY=>fjhfElFz4eGdAm$gJ
zK#zB*d5Fzd8V-N0L&`xQ=HDFJB(hMhVYWf15u~c6<L-;&@Ea}hK{-sAqG9eIK3T(<
zk;0&mjjn*fWGgPMFrKRXW9-~+7=~dOxKiSmoc$N;-%)@KssjYIQyC73BguGrfjLm~
z)onL+{QIz&3PpDUPy355lz<PlIPmQjl}Uk|KhcOcj+b4GCvtwrMwXio{g5E%H-34N
zN;dt+V<6|NEG1Vg6c6vS{sRTC01N^-UnY!9C-^<L=Lm<*ZT9|1BIgUdnS8faL(&8u
z_6xz{_nd-t;$qq>_B@Vy%v`-#ESn5q`DIe#sQ;gl^HUKSfI)%31akgR*;BF$`tyvO
zze0&q6U;OG!{6yOgvgj4;S1#ayll?%>(4WCe&U6=+zZ$!kn@Ksi0~{ImcQsiTc3+x
zuvqpu++5k5>4yY4e>D*qFKB}wPvQAY*!PIM_7f&NA7E$>y)b{O6pb$;4FgEg85ar9
ze=mh|{)Hjus|tizvQ~g}ft=qt7>h9RRoock0)`PkH@!w2;Q1d>Y{W@61Bw0!JEL5S
zK@f;;>6I3c{cr4ky!4ET4J^Q<Ra6*<ng79{t)lG!J=SnbLeIwq+OX)e!J;pL^F<ii
z=&3Ob<_s$hW}RdB?8Q45TauL7V+fL0C%?X!*ZpMs-=TZAOHuYQ0-EpsVT3j;v)keQ
z=BSB#4-zMEeuRiO#7Hl>obs<#Yv<PH*q`}=^OYEEI=+33xB`s9Ak2fZcDnQpX)5KO
zyN7#D^!$<(dGM$>tTW6*R9}kTrs{E}1kYcP1Qr?d>Ve*T@qD9s#PE->XIN*^^C_Q;
zOscNov(Gkf2a@-pxB<_11dZyJYH}YW;fIIY-k#K#7~uKOx<1S+`z`t6`G!)3@nU3y
zqEQ0q7rNZGIP-^^3_#yYOT~U3%4g~9&~4-Jd56ZROd<?^7J#cgHVn3tFwSeh;J%xA
zA8ly6b#Fi0qUTF;bQAdRgGBUv<Z^cR%i*6%!^Au^+S8{A%fppADCpw)F?L2t62c%5
zy;4jZ!24fpe|BDHH&gT+Af=^Ipwm3e13N+HJG{7$7_#SY6ZhtK<m0Syo*pB(rb)L;
zJ1nqRan5gUyF?No&{1MMriiU|bW-e#`yGZqpSJpm8*UmyTjI}O{PcrTGE5yRNgt_~
zLGRaNL@6Zw&>Twsp2p~&8fKf~l>$38iM~+zq@ID(GkT|Iinb#{B6Vn(KnHE-UY~H3
z=F0PsdUs21|Fn_xMfKjH4`%Uwv{D37(jbKMku!`dlU5iOZ*I69nwzlLn})7L(%;4d
zP{f+)6^Wz|8RQQMv(F5W^y8NGhV9vx&xNE9J!>v9z}4p@HGox!noR3SzqJcRKVEXu
z5!?Huw@~zh^U$F5HXz>`+F<kO)iw;5LebX%U`+C^^{z&o{Pk^Y#^@L4|HgnT_?#om
zYktEHv36Yp^WZRR-@dTdV$vHvr|d<NLeOXY*u(%cjeDkk1^pkw&M3!W7zCnMav(MI
z{uitI;WzB2f&*A-ss!Tk%;Q^l@r4DZvfiGR2>O@@ub^K<AD+u2=-b5+u;WPc>7MV0
z8F(WY48Z0@(BJ#|L3<vqyfIADY$yeLC<O@mZ^zH(q-}gye4K|%1oe~uFz@?C3b%7w
zyBURKh~cJ*cqqdp#KXQj=MnUC@qmeQF_Z!$!WNp*L}%|mNYb#jN|C}~y7sVG=4p8z
zUw9s)UyK$e!2mmmPggz<n0igXCyE&U?6Z;dQ#)<bYxdA<(DMrgy@X!+*ZJuA2IJc9
z#YC(gjhnLP3k<?H#W0;S(eq!p2P><mf1O<@bI>z@LB5Ay?c$R#3OSh3NQOEhP(H_V
zZw|c&n|n&mCy`(0Aq<Q6Beqhf%@032{^xvZoNH*#E|fVlklER+9*>*;nCW)~d*@;B
zPYRVU769AdA<mG<`I{q*nuX}^8986@m>P`g-wWh?$G2E#_w=>kz8}MmstWg~<bMb|
zw`2uE7>I6(X&4jtzp?wFoS@!HFMz_rA%vzMzk^ZX!tQ#KQTObz?F7!B7^ws#J|or1
za@*lfb?SWj9eKd{%*>rC%o&N>PEb5AA}5V|b8b9e#8&IZJkUJbWa0T7?StlVnC9{3
zkYr0v_=D4YVdUQ8+a+ifGPH^;dOlgdgPDh$d6N$-PB8b2xy<!9H=h5F^?c<oF7g-6
zU&R+T^pD!6uO#640l*S8k6}8`1JB1{az9l`JzkLD`G-{d(6;xh4W7Rck5D}oJ#3la
z`LSP5gn6nA(<#C8$rcrKU@fzsvD;bu-CCGI={DVV;rZZygTZ5&1uG334Io!C<CmS-
z?M$HB2TiX#Vjl#PmfVKewCgg1X~XterL|b?o~@bS`N76Gtrz+l7QY&{fS+J|8!{?$
zjn9)X*680bGN@s=WWZ3BA(`gJ^EIj45NoyE&*qe@0*GXKOf$G{l57lgduy20j_+W;
zk8I_BV?=(d+y4kVw=9QY5Qc845Z8wNZ*0DN)j6F(3&?RE4hDgwUjhj8-j?+(gF6R!
z#@ORk2@4}`AD-D{y%k?BV4qal`8zYBAB%R=Z7b%QMIQ=0e-i-lS<iGUQ%YV9=R|Hh
zjofyD=hJ(R1JL1)8}R(INoXJkgsIyvo}VE#WKN7UIZ5G(MO8)2HzMH$oUfRlBnD{?
zj0@*yBxDL=ff4AfRtV##qM&=`v5J!Ot^Nym%ZBJ!g7bI$!IGSJXA{C+2se-n?Ro04
z<a{d{2h-}c%`=ne%PJEF+%fn}gH-?kZmPkZ=C%RDf^&|#eVMu)IR8=WSr^ZUL0>pO
zpNGi^5Ysh(ss_&g2n8@{k6HM#aA9fz;}jh02Q~-MW?ha*3XC^#_w8<4#<!vyvN_$#
zBw=)X4$XGMb8OK3C65GlcFsJs2F*XjkwB`^sP?zC^BJ-KG;7NF;{M`x7IWLi>8XM9
zmmEBhs;F7RrGfM7r5DCX?*Dbs4`XMPgD?!k&?~XFu=xHL;{)lrFcj|qktl1Y&T*bU
z#durkofPAS!Br~<-x^`RS#tY7>{ypL>0;in!gEH>UjSnZ+;;Ukhm6}XJZl>t32O$o
zGhKY%n>`W!e9sKRa2|o-EC=6C_m0^ly;LFO{AGG79=_^Z-Wtbmrs+|Tw*q=q!|rK{
z;XH=9Dh)>~yO`%Z!<r2}WP8$ht`*j7xs|KX;zp8+2_~f(@WO@i3I_v!J~5qN**0O#
zm?{ph`FU?bQ~2}CuOWQf)wkz_o<A_p6xQpIXCdqPr+Ib+UiQ9iIrw%sN#l7BhNpQ!
zPk%*d_uCUezfjVKXv6ldGEGAdx%1)}pS_<=_UC(tZG)xZXWLZq_!BQ0itB<E-XeL<
zux36aF_ILYHi4L}4Y$Mggh>|?Eo4ETkm5ZKqd!%~?Ku3FNgwrJ-a^pdQm}3G>{~{%
zpzoLdmYmxkjO7RrP8H3)dNXzgxDCTF4E$2;K(+b*j|~{GlbRUf9#B+C9oM1AQ-4%f
z3i?2-DtpzG&A;SIaO>xPL^~nq=SbEGF>!|Zsq`cxjg8Q29MFpEHCC)n1M0syupS~w
z-Dr4sui*)Ue!y6(6Ohb@?^lQ;(ZFU*f)Mm|(Mq`RWb|z^MLg|BU!x8C=Q*-vq=VDF
zU!Dm1`-nX>Wv3W64irCAHs`P`o9>=L0IKlwIjqB>n!Q#lfIFo@N7PaMOTP~M{JMwr
z*NmXQak>kOsoMZC=qI4J;#2!a5<$NN4vUGUUnB_npA01wWURT{>*;{`ioKW{wx1sR
zYS1^kCxZS!=zxth4c<ry`Vh(|graE(MOx!E8nI?6`mz^I$rO4An!H(I81y%xteRHr
z7s<*YGjV`Vo3gX*P2h$jvuS$^gML!k#ZgMVeNZdWz*wDtOd4~m7A+%8Y4P{wK22Qv
z*An`}*csqR41!SfO4unV_rKU~HaqV-v4J^&X-%!d=kfh7B|P!w^-i*6KFtQ`{+&Z_
zu5osyZuY*-lc8IM)nZ=rsujS*bI0^!BtJ%zSK+zy!Y7iuA+G3NTYZv5`XFu1-4KbO
zpIi6{4%`Im0QzZKp7C8XSuXTe2}?-hR}<-@=!d$pNE4dI(o7X4d2J&7Y$E+r(f=?L
zt>=uQFIV;?>dm@LmZ><5!SsVQ@O7r_&F_asjCzqs(Z`|EpbssY!ExMAjpJ<B>zDxg
zy23n{=3H+>DEb(1U6YFDY)%Xm{TbtdxUA;vhN6GV_?lBP%2U$Kz*{L?54egl0CW?e
zuM?L3xf*+P1JIv}TQ_F1dF%T$3Rjj;rWkH-N&gS=dE>w&H{J|pfpMkT4k%bXm<2|4
z&kUs3n$NrrPTojv>JIha!H_$YQn$wXsOLObVDbZi(2sI2a6{6c8{SX%@vOh|xK2QU
z0?Ou-`@`6|;5ZDzK=ewE!BFmhu}a<L4OJsM2Z%}{GI59b++WNNqsFZx%E-fh!Y+!k
z79$C#-jT99VVlx_aZEOm$<J0iFJu)La{**+>%|W<=j(8fCdxd~IPB7#&jtg*%yTT*
zjJ|UY>w|G-tbExp`iq=gUmW`sSOB9>X7-mVH-9f+^p}qtM?<mf-<~YvY3Fu`Fe&tv
z4SW;`&-`MhFh)2-C!e<uhbch+NG0}1Zm=-_-C?JdEQc^L`og~>0=ihXOl<Qe0y>8<
zDfH)EPfUK#F#6IDp6<^4o;Rca@BH}aL@^e;3e1PmSNq6mGSBgEGx|=mgwv+$y%iTT
zg^~MUuwgcG3~Q3N@(%;OQEo&FYlI2tts4E2?<K6sh|98v>RO6TB3%VY!YPIoQ-um~
z4=397sJba^Gx|>cpp)t3QGfxA{=frbh$F1{!V;h_iNa(gnZ@?($XjLC8AxDe{<$GQ
z--vWSqx*B{h0*`xeBX?n0S*Eo3<ST_0)_McA2TsJYvQHr11`$ZTVR>C`R;c2K>+(8
z!O?$cp6PFBAHIn&;G4Kikbt*dEbb6((<ljuK6UBFMuxW0FdY3wH??A|DzhiS(N~80
zHv`?zGl+f=B#YhSGP}oO8%E>fL=1BGu??bMbXlMj)hM&kFEz?ymE=A&!;BdXqmES~
z`Wa@-cooEUavz#u#!Q42%p_E<d-&t%zY91g6`@~iRrc#Mi2mW1FU+0GOqCFQ@;ejC
zAhUmAIQoYSl0-@D!|Mm#PENp?{U@o8xZ)eQaj#{@EJT0Yfb!;TgSUqM_Wp~quMnay
z>E&=U&EW<|9~5O!mu{4ip(DN(CE<HsCP;+nW6CELWcmcB3LJf%ZfK`F&gw;9i2hWX
zkqqiy3_$dkjz)Ar-=m+ZqZ;Q#7#9&`4rL(vYbe>9LVm`qz|oJq%PcTcCBKy<ka_+p
z8&+|+Gs0t@Bx%k&ruWI%86-Ij!a(p#9*k`A|Bvl%ZMlboYm{3qRAOQfYBZy5FhqY-
zK9fJI$!?Z;E6)svo6XtNCHg4B@KF8zlvmX<tkBE<ocA!7=&v`iPo8aD^atOJJJPrs
z1n3fdddrH<K+R?V(ce0JaiCFi8iMExb<{jLlgwtq%v(PUzDbSpghBMr%i4OvP4jx<
zqJN<?ztC}9EAL@$i3^n4Peb|jq$RH8!RMDpDTuz+j=KmX&-O#~$3!<>tg340wuyfE
zn|bCYyP-y3kju&K^IUmJn&`8tif~g+xOs^F7(nI)Ov|;kB`kN2&zo%U$b+A*-pp5_
zd#PBwT{;Mo*e2p?JhH2Ci6Z@Z5Mi-Uz193`8i7D}aP=J7)w2ZAw~+S+KK^-4#lZwg
zta5LBN$%)gU9yQjB9H}3%e@s#578gPVjl`CDyNddb4M0<Lbr4ClhQ`?of%P=8?S&%
z0#;D3IoS(xvxJfel76+h4#+mBB@=y8$^RS1AHvQk2SOMGqE`|sUGIOgHF15@jb`|l
zq}Z0y=`dWz(;M&fslgb?zzcI$1Zfx-_vAvC&91s3{bSQ}0Q+JzF2k!(l@YOX`q&vD
z`fL3OqmE{#)J{?^!-w<uOx%e6`JsH?@wvRQszBgL(H+rOfmEQmQwLFq)7e*9p2mYq
zLSj5=N93mpL|+Rm2_%_~&jl?P_8~~GSI0b!CEhA&O{U6&J0XsKGS5imW)t)Cc<PKV
zjgXpQ!*3<#uO%dYo`vXZ*yMk{sG$Nx{}?jnhxtdg7{Xie8IFPP8&CnFFP*iu>40Bh
zLw!KRCZ>+Jnql*16ryXgJbkJj;^>P52$Yu1#sJYzQuVoU!)Su%cnDVfX-+i860FFV
z!e<{nZ$$q$*z4ZTlV+0`fauTAt%^L~<1?|ps5&idC7(&DB`!#B0?KD|JcH<OgCF*h
zv0vLl^i_Yt@!T5ECsQ7n*mo?b_%e1bISj)f5WP|W`IGx!td*j^L2?A$byLZ9Yzq&=
z14V!H49)EhnmJ>vAbNDt0bZvA3`HN3v(tg|`>USwxQ?a+nch{;8R*VE<;0tRp}&Tq
z=-+B!2REn5xSJGxg%v4X-^`gEhQyNVjOsgVNDbRBrQ*%7A=7agz>xNN)khLVKX4fU
zCiWUkJWS9Xd0<fV<7yV{gzf~2eqGcs3`PGE`Y^$j>R}6_PYNUhsOt-GqE(Q&2?XkB
zF2J9n@9;7Gsa<?HfX%RfJ8W{QsOtCC97z;?N<4jSWa3&eFnRRxF=xbOvtaA6oCgtL
zG~uHl`s5M<jk$(y4+EmFWNHurM(rB1C7uADULwGVdd@)fL&OSN*0+E5(@mVf#PxT^
zqp!XeLB>6rM_KadvtWde(Zrr>oV8UXA{v92;nBZ03x+5kP56kSFNRER1X6DjpgT)6
z`qXv4K9Wm$?>7Q#{hc>=7(l7uQTF&XKa8Ex5yK!1LstTu1ib%Z?N6WSk&`okuc0A9
zkz`pELss}a&7PX9?RfM9Bj4^<*N^1#Gb?B#sEc3bl;o`1qg?b3%elCgZsK?+@AYK#
zJ+;B{&ac^5YDWFR?5Q8gbq)e?K%5sKZe^d5J)}tMHAnUtaoIFActH)p=rgqMuSrR-
zIkF3c?FozL1&G6=AD~_bK6*g`!srJoh6CcfK!7m%4Lh*|AH6_;F#0!;d5_vH)|}1?
z{xIO<DBxqJ?quREW+xq4cJ;`Rb6^EcN>h_*hDX0mjJXu+IqH}F7=2^zp546kZ>_{y
zOYaU+7YJ}@8qc8gNl3Q=0vsAXT1(BSJ%n5qmwg>#>frlXCuDw$IVFcbbng|nYMy>2
zKKpg+-?w;yJ%jXX*vDBE$1(6_AUNrfLYG15-y<^{*(6aE<K6Kz{-9QApS>leztRMQ
zbfW={5u=}W_ua9sZxxjOhp{tCk{ASm=#^$#(B%FX+xeN-PPqj+fR)lH0ydAA>96>n
zjlxx=^oOyF_?|JE1w-LVTtz4K?)6#Z^v84!2|KJ?u<H;<Om4|p=ShT0-;d^dky3r0
z$>}fb_C-*3HLEQ=eV(oZ-?Qdarp(dbAeZ+eDridM5IfPsy}@gyWIv2w1w|pUnX?Ox
zJecj7^$vr(GjJ;=8P~c>^E3Fn!{+U~iV*nKd>I=?eE|3`)%dRz9R0WBXN>-8EXlAs
zj0KzdOdY0yr*Ba2CM~OX7%Khu^x*s1o2JG%YlSwQY4hbc>IQeDXftPQn1#6z1!|aI
z3YESaa_m^-X3py<+1^#X^{Lu&`s*K<X*1{hP{alPc1=P}k<-uV=Tyqn>xfR|^n(Rk
zT(LDsFcmruMliT0m8Y!IhoUeE2kVwEsqhYqL%diwfKP>EN$zJ*(2ep@;aC#k5B_%D
z06rD#bSto7`HTGiW9*D>9EM>Sx>8G6cJ`m_zV1<g1F-`XE)*wbm?!G~u@ePM!JMBG
z1xk4O_3;sllnS>bl)fMznI5kSlDVwIz)5(9Jz;wiq`ytL;sKu71C)dG-GPE#JCB|(
znbODKW&nI5AJshl{en$~f}z8VO)~Q!Fj~UXFOHi-Tf;o(p#-JBKBhgN-x?|erC;Cu
z(v2|}%#^+lcc|VoQ@z^Xi)3z)R=6>?l|Bd!mR3^wc>0T#`)k5{o%gz8WO^?0Ty0bO
zG|qHNf8Hc}U+L^cwJXR+JpJ<C#`g@YyrA^SGgV<-21rYd(tlp&dCb?@l)hJPz~=n7
z@$?tMm3iig_7s#pDMuo!S0|iRQ2J}VwH=0)-SEvb3<Ve(zJ;gXdLml4cqrJulFB<0
zH*ZgS`ozdERy^@^a_){{Jn+~G3h<b4^~w}1C_p^@@{<JLv*s_~!qeCP7tue)&M1pv
z5Cno(vY?XO|6={>EO|*G2k<3n6>%9CTgbHy$!CZ7F!d*c6>a7=zB}~ly1-@i4~C|X
zvy%nK!KjNMCQ4sG9Y>>Rjz&LCA0NTX)tBa<B7{+jr7woXY~C8eRSBT(%{0pyN#8i!
zETx{!V2t#WZEb>g>Ti~$zvM_d-T_Mnq@QZn2{WiyB#{1=7d}aE!zdU=`dd?*yfvCw
zfTVBgRhWE!n{P&}7*DiQ^JK&dN;jK(a1APDNctOfht2~QP4Gn0Pee$9I?B22GSZje
zO6pnr|1U?<pP%*6Jm9Pc+nq&8bcEG|g;wxn5dQ|P@G)-}`!iax>cNN=0L2^Jvu^IV
ze5kD?kr&!2j%F|rHDM^&o}*TGd??WmsxS7+*>1Ty<6`2U+pU&i+ePV91Iev4>(@ro
zpKw-t#=E<Jj-)SeobJiC>#fR>^ruATlkKK1OFEMN)Y&_k)BRZ(U&hYphG7r}qAN8x
zfV=-<?MM60RU%&pKnP-j^=$6GgXhI14D0200%+EZ(7D?53*9lFiU@liH+k#s2NPlH
z6_t#_GHZS^Gv66yC!@g-L(Mzm#(KVwZIJ$aNET}Rhe-mYe*$P0?iNN<D%7Sw?gXj&
z2m|S>!>i(LGnkh~kjtvI)_-SN<I;h>I2cAFDM0$0%pgfCvQH~w=qVdqiOaorx0nIa
zUx4*RvENh{1Ejx*uuUqp`(l59^p^_Xq>pwm5k_}JRW|8k8>EkC>W|-`S@U_(+NhlZ
z{gDLePu*2KyD@DB0n*=xOeqNxlU9KAr6X8NH)hRweMKjhc9@xUOR{0d{tv_jNMF(s
z$;@eH2I)_7&rQ>1Z@4<+yuOyKz_mY;AbokVVf!+&Z>|lHzM8ZW5ZBv*%mC@DI9LXU
z*)VQNn(?abY5yky>2HuhvfF9$ZIJ#fs(PP;@nY<Zk{AX-AbO^TMCko5)_%REQ-}2c
z8AC&LdE$EIZIa~8-Zg&=Hv4OCG>u2LC<3n6SqU5<{Z4D+%y%L{`rOddQSaQb8IKOL
zsq9~8oH!oA3Lb`B8dwoB-f73^L^@2&>mSgxGkEh73(_w@T)~NJ=EMQgZ-Azup*gpO
z^tCw%d^B7smX1qG>ECB`CzdkowLwGk4+he2byX{k=9oeH>J;eRP9|n(1+F~_xipn~
zEX`rBP1!$By-TYkY6yx~rc40ow+^p%K)}ST_ORSku_k8bFh=hEH}l9K{hQ^c-%vY$
zXOKQ-&_5NO8JRf@$(-B)HQ%83eV7ab<E0ef%m4$VFUQDky=Y#W43lI=0UF=N0O_l(
zxA5w9VjZNPxi(7Q#7u@^|4`UjIa!hKe_7Eq$vkhDbeIH99_p~t#`nE34>KcQAI8pL
zg+UkyqIZ8L#U3(+;Lo&{3aK9ae`tGon?uO-rU!|OarZGvX8E6U$7^F8Gm?I@<lZoe
z85unc!9mD)G6aaEpTP=R(OFm*IV?vqxcmt;X!_xd+|rPVS$yXhne1seOfkd2N4yXm
zxT5LDwjmnAeXqt<5=}qO5ep8p56^hpse={cn9=m36BDiIER&$=3lBp<LozgkrY{zO
zX+`HBjw;D(<HF^t<Sk~{+$pgpW@Z=%a_Q;joCL3E`if-GY@s3MlJ0A*=kKPZ_j<mT
WsienIpWD7np8){LIOir%Oa}lg=cDcb

literal 0
HcmV?d00001

diff --git a/demo/undocumented/plot/python/demo_plot.py b/demo/undocumented/plot/python/demo_plot.py
new file mode 100644
index 0000000..03b405e
--- /dev/null
+++ b/demo/undocumented/plot/python/demo_plot.py
@@ -0,0 +1,101 @@
+"This demo illustrates basic plotting."
+
+# Copyright (C) 2007-2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Fredrik Valdmanis 2012
+# Modified by Benjamin Kehlet 2012
+# Modified by Joachim B Haga 2012
+#
+# First added:  2007-05-29
+# Last changed: 2012-11-12
+
+from dolfin import *
+from math import sqrt
+import numpy
+
+import sys
+
+# Read mesh from file
+mesh = Mesh("../dolfin_fine.xml.gz")
+
+# Decide which demos to run
+demos = map(int, sys.argv[1:]) or [0, 1, 2]
+
+# Have some fun with the mesh
+if 0 in demos:
+
+    R = 0.15
+    H = 0.025
+    X = 0.3
+    Y = 0.4
+    dX = 0.5*H
+    dY = 0.75*H
+    coordinates = mesh.coordinates()
+    original = coordinates.copy()
+
+    for i in xrange(200):
+
+        if X < H or X > 1.0 - H:
+            dX = -dX
+        if Y < H or Y > 1.0 - H:
+            dY = -dY
+        X += dX
+        Y += dY
+
+
+        if 0:
+            # Straight-forward (slow) loop implementation
+            for j in xrange(mesh.num_vertices()):
+                x, y = coordinates[j]
+                r = sqrt((x - X)**2 + (y - Y)**2)
+                if r < R:
+                    coordinates[j] = [X + (r/R)**2*(x - X), Y + (r/R)**2*(y - Y)]
+        else:
+            # numpy (fast) vectorised implementation
+            translated = coordinates - [X,Y]
+            r = numpy.sqrt(numpy.sum(translated**2, axis=1))
+            r2 = (r/R)**2
+            translated[:,0] *= r2
+            translated[:,1] *= r2
+            newcoords = [X,Y] + translated
+            coordinates[r<R] = newcoords[r<R]
+
+        plot(mesh, title="Plotting mesh")
+
+        coordinates[:] = original
+
+# Plot scalar function
+if 1 in demos:
+    V = FunctionSpace(mesh, "CG", 1)
+    f = Expression("t * 100 * exp(-10.0 * (pow(x[0] - t, 2) + pow(x[1] - t, 2)))", element=V.ufl_element(), t=0.0)
+    for i in range(100):
+        f.t += 0.01
+        plot(f, mesh=mesh, rescale=True, title="Plotting scalar function")
+
+# Plot vector function
+if 2 in demos:
+    mesh = UnitSquareMesh(16, 16)
+    V = VectorFunctionSpace(mesh, "CG", 1)
+    f = Expression(("-(x[1] - t)*exp(-10.0*(pow(x[0] - t, 2) + pow(x[1] - t, 2)))",\
+                  " (x[0] - t)*exp(-10.0*(pow(x[0] - t, 2) + pow(x[1] - t, 2)))"), \
+                   element=V.ufl_element(), t=0.0)
+    for i in range(200):
+        f.t += 0.005
+        plot(f, mesh=mesh, rescale=True, title="Plotting vector function")
+
+interactive()
diff --git a/demo/undocumented/poisson1D-in-2D/cpp/CMakeLists.txt b/demo/undocumented/poisson1D-in-2D/cpp/CMakeLists.txt
new file mode 100644
index 0000000..c675c5d
--- /dev/null
+++ b/demo/undocumented/poisson1D-in-2D/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_poisson1D-in-2D)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/poisson1D-in-2D/cpp/Poisson.h b/demo/undocumented/poisson1D-in-2D/cpp/Poisson.h
new file mode 100644
index 0000000..53423e7
--- /dev/null
+++ b/demo/undocumented/poisson1D-in-2D/cpp/Poisson.h
@@ -0,0 +1,2148 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('interval', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::interval;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[2];
+    compute_jacobian_interval_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[2];
+    double detJ;
+    compute_jacobian_inverse_interval_2d(K, detJ, J);
+    
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = 2*(std::sqrt(std::pow(x[0] - vertex_coordinates[0], 2) + std::pow(x[1] - vertex_coordinates[1], 2)) / detJ) - 1.0;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, -0.408248290463863};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, 0.408248290463863};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives_t = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives_t *= 1;
+    } // end loop over 'r'
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives_g = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives_g *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives_g; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[2];
+    compute_jacobian_interval_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[2];
+    double detJ;
+    compute_jacobian_inverse_interval_2d(K, detJ, J);
+    
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = 2*(std::sqrt(std::pow(x[0] - vertex_coordinates[0], 2) + std::pow(x[1] - vertex_coordinates[1], 2)) / detJ) - 1.0;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations_t[1][1];
+    for (unsigned int row = 0; row < 1; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations_t[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives_t; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations_t[row][col] + 1 > 0)
+            combinations_t[row][col] = 0;
+          else
+          {
+            combinations_t[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations_g[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations_g[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives_g; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations_g[row][col] + 1 > 1)
+            combinations_g[row][col] = 0;
+          else
+          {
+            combinations_g[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[1][2] = {{K[0], K[1]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][1];
+    for (unsigned int j = 0; j < num_derivatives_g; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives_t; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives_g; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives_t; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations_t[col][k]][combinations_g[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, -0.408248290463863};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[2][2] = \
+      {{0.0, 0.0},
+      {3.46410161513775, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[1];
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives_t; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 2; t++)
+        {
+          for (unsigned int u = 0; u < 2; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations_t[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              for (unsigned int tu = 0; tu < 2; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 2; s++)
+        {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives_g; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives_t; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, 0.408248290463863};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[2][2] = \
+      {{0.0, 0.0},
+      {3.46410161513775, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[1];
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives_t; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 2; t++)
+        {
+          for (unsigned int u = 0; u < 2; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations_t[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              for (unsigned int tu = 0; tu < 2; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 2; s++)
+        {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives_g; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives_t; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives_g = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives_g *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives_g; s++)
+      {
+        values[r*num_derivatives_g + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives_g; s++)
+      {
+        values[r*num_derivatives_g + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('interval', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 0;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 1)
+    {
+    throw std::runtime_error("d is larger than dimension (1)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 1)
+      {
+      throw std::runtime_error("i is larger than number of entities (1)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    2
+    // Number of operations (multiply-add pairs) for tensor contraction: 0
+    // Total number of operations (multiply-add pairs):                  5
+    
+    // Compute Jacobian
+    double J[2];
+    compute_jacobian_interval_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[2];
+    double detJ;
+    compute_jacobian_inverse_interval_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    
+    // Compute element tensor
+    A[0] = G0_0_0;
+    A[1] = -G0_0_0;
+    A[2] = -G0_0_0;
+    A[3] = G0_0_0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    2
+    // Number of operations (multiply-add pairs) for tensor contraction: 3
+    // Total number of operations (multiply-add pairs):                  8
+    
+    // Compute Jacobian
+    double J[2];
+    compute_jacobian_interval_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[2];
+    double detJ;
+    compute_jacobian_inverse_interval_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.333333333333333*G0_0 + 0.166666666666666*G0_1;
+    A[1] = 0.166666666666666*G0_0 + 0.333333333333333*G0_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_1_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_1_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    2
+    // Number of operations (multiply-add pairs) for tensor contraction: 0
+    // Total number of operations (multiply-add pairs):                  5
+    
+    // Compute Jacobian
+    double J[2];
+    compute_jacobian_interval_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[2];
+    double detJ;
+    compute_jacobian_inverse_interval_2d(K, detJ, J);
+    
+    // Facet determinant 1D in 2D (vertex)
+    const double det = 1.0;
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = G0_0;
+      A[1] = 0.0;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.0;
+      A[1] = G0_1;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "7c727730505e8a6c0e2ec7c7525b510c5cb8e03b95a8f057a227818d80c475d016a66c9490d1c09b3fb08ce93d88b8835e611ed8b7e5523279c9cbd2ebb5e514";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "67bad4d392c483a83beb463a64568c00fa2fc3fe629814727ba9786851e1b910d290937d4615f7c47bfb100c9676f41cd9a7c4f3d1e7f9e2d42a7996b1ee98c9";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new poisson_exterior_facet_integral_1_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_L_FunctionSpace_2;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/poisson1D-in-2D/cpp/Poisson.ufl b/demo/undocumented/poisson1D-in-2D/cpp/Poisson.ufl
new file mode 100644
index 0000000..b1a3249
--- /dev/null
+++ b/demo/undocumented/poisson1D-in-2D/cpp/Poisson.ufl
@@ -0,0 +1,38 @@
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by David Ham 2012
+#
+# First added:  2007-11-23
+# Last changed: 2012-12-04
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation in 1D embedded in 2D space.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl
+domain = Cell("interval", geometric_dimension=2)
+
+element = FiniteElement("Lagrange", domain, 1)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+
+f = Coefficient(element)
+g = Coefficient(element)
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
diff --git a/demo/undocumented/poisson1D-in-2D/cpp/compile.log b/demo/undocumented/poisson1D-in-2D/cpp/compile.log
new file mode 100644
index 0000000..ec84acd
--- /dev/null
+++ b/demo/undocumented/poisson1D-in-2D/cpp/compile.log
@@ -0,0 +1,180 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, g]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0180261 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.000931 seconds
+  Shape of reference tensor: (2, 2, 1, 1)
+  Primary multi index:   rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Secondary multi index: rank = 2 dims = [1, 1] indices = [[0, 0]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [1, 1] indices = [[0, 0]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.000782 seconds
+  Shape of reference tensor: (2, 2)
+  Primary multi index:   rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.000807 seconds
+  Shape of reference tensor: (2, 2)
+  Primary multi index:   rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.000909 seconds
+  Shape of reference tensor: (2, 2)
+  Primary multi index:   rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0144341 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.00094986 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0290511 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000664949 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000671864 seconds.
+
+FFC finished in 0.0642431 seconds.
diff --git a/demo/undocumented/poisson1D-in-2D/cpp/main.cpp b/demo/undocumented/poisson1D-in-2D/cpp/main.cpp
new file mode 100644
index 0000000..15043f7
--- /dev/null
+++ b/demo/undocumented/poisson1D-in-2D/cpp/main.cpp
@@ -0,0 +1,140 @@
+// Copyright (C) 2012 Imperial College London and others.
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by David Ham 2012
+//
+// First added:  2012-12-04
+// Last changed: 2012-12-04
+//
+// This demo program solves Poisson's equation
+//
+//     - div grad u(xi) = f(xi)
+//
+// on a unit interval embedded in 2D and rotated pi/4 radians
+// anticlockwise from the x axis, where xi is the distance along the
+// interval (ie the domain is 0<xi<1).  The source f is given by
+//
+//     f(xi) = 9*pi^2*sin(3*pi*xi)
+//
+// The boundary conditions are given by
+//
+//     u(xi) = 0 for xi = 0
+//     du/dxi = 0 for xi = 1
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+#define THETA DOLFIN_PI/4.0
+
+// Map the point x back to the horizontal line
+double to_interval(const Array<double>& x)
+{
+  return (x[0]*cos(THETA) + x[1]*sin(THETA));
+}
+
+// Rotate the mesh through theta
+void rotate(Mesh & mesh)
+{
+  std::vector<double>& x = mesh.coordinates();
+  double tmpx;
+  for (std::size_t i = 0; i < mesh.num_vertices(); i++)
+  {
+    tmpx = x[2*i]*cos(THETA) - x[2*i+1]*sin(THETA);
+
+    x[2*i+1] = x[2*i]*sin(THETA) + x[2*i+1]*cos(THETA);
+    x[2*i]   = tmpx;
+  }
+}
+
+// Subdomain to extract the bottom boundary of the mesh.
+class BottomEdge : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  { return (std::abs(x[1]) < DOLFIN_EPS); }
+};
+
+// Boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  { return (std::abs(to_interval(x)) < DOLFIN_EPS); }
+};
+
+// Source term
+class Source : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  { values[0] = 9.0*DOLFIN_PI*DOLFIN_PI*sin(3.0*DOLFIN_PI*to_interval(x)); }
+
+};
+
+// Neumann boundary condition
+class Flux : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  { values[0] = 3.0*DOLFIN_PI*cos(3.0*DOLFIN_PI*to_interval(x)); }
+
+};
+
+int main()
+{
+  // Create original square mesh
+  UnitSquareMesh squaremesh(50, 2);
+
+  // Grab the surface of the mesh
+  BoundaryMesh boundarymesh(squaremesh, "exterior");
+
+  // The actual mesh is just the bottom.
+  SubMesh mesh(boundarymesh, BottomEdge());
+
+  // Rotate mesh coordinates.
+  rotate(mesh);
+
+  // Create function space
+  Poisson::FunctionSpace V(mesh);
+
+  // Set up BCs
+  Constant zero(0.0);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, zero, boundary);
+
+  // Create source and flux terms
+  Source f;
+  Flux g;
+
+  // Define variational problem
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  L.f = f;
+  L.g = g;
+
+  // Solve PDE
+  Function u(V);
+  solve(a == L, u, bc);
+
+  // Save solution in VTK format
+  File file_u("poisson.pvd");
+  file_u << u;
+
+  return 0;
+}
diff --git a/demo/undocumented/poisson1D-in-2D/python/demo_poisson1D-in-2D.py b/demo/undocumented/poisson1D-in-2D/python/demo_poisson1D-in-2D.py
new file mode 100644
index 0000000..c504e4d
--- /dev/null
+++ b/demo/undocumented/poisson1D-in-2D/python/demo_poisson1D-in-2D.py
@@ -0,0 +1,114 @@
+"""This demo program solves Poisson's equation
+
+    - div grad u(xi) = f(xi)
+
+on a unit interval embedded in 2D and rotated pi/4 radians
+anticlockwise from the x axis, where xi is the distance along the
+interval (ie the domain is 0<xi<1).  The source f is given by
+
+    f(xi) = 9*pi^2*sin(3*pi*xi)
+
+The boundary conditions are given by
+
+    u(xi) = 0 for xi = 0
+    du/dxi = 0 for xi = 1
+"""
+
+# Copyright (C) 2012 Imperial College London and others.
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by David Ham 2012
+#
+# First added:  2012-12-04
+# Last changed: 2012-12-04
+
+from dolfin import *
+import numpy
+
+# Create mesh and function space
+squaremesh = UnitSquareMesh(50,2)
+
+boundarymesh = BoundaryMesh(squaremesh, "exterior")
+
+# Subdomain to extract bottom boundary.
+class BottomEdge(SubDomain):
+    def inside(self, x, on_boundary):
+        return near(x[1], 0.0)
+
+mesh = SubMesh(boundarymesh, BottomEdge())
+
+V = FunctionSpace(mesh, "CG", 1)
+
+class Rotation(object):
+    """Class implementing rotations of a unit interval through the angle theta."""
+    def __init__(self, theta):
+        self.theta = theta
+        self.mat = self._mat(theta)
+        self.invmat = self._mat(-theta)
+
+    def _mat(self, theta):
+        return numpy.matrix([[numpy.cos(theta), -numpy.sin(theta)],
+                             [numpy.sin(theta),  numpy.cos(theta)]])
+
+    def to_interval(self, x):
+        """Map the point x back to the horizontal line."""
+        return numpy.dot(self.invmat[0,:], x)
+
+    def to_interval_c(self):
+        """Return a c expression mapping x back to the line."""
+        return "(x[0]*"+`numpy.cos(self.theta)` \
+            +   "+ x[1]*"+`numpy.sin(self.theta)`+')'
+
+    def rotate(self, mesh):
+        """Rotate mesh through theta."""
+
+        mesh.coordinates()[:,:] = \
+            numpy.dot(mesh.coordinates()[:,:], self.mat.T)
+
+rotation = Rotation(numpy.pi/4)
+
+rotation.rotate(mesh)
+
+# Sub domain for Dirichlet boundary condition
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary and rotation.to_interval(x) < DOLFIN_EPS
+
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Expression("9.0*pi*pi*sin(3.0*pi*%s)"% rotation.to_interval_c())
+g = Expression("3.0*pi*cos(3.0*pi*%s)"% rotation.to_interval_c())
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, DirichletBoundary())
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Save solution to file
+file = File("poisson.pvd")
+file << u
+
+# Plot solution
+#plot(u, interactive=True)
diff --git a/demo/undocumented/poisson1D/cpp/CMakeLists.txt b/demo/undocumented/poisson1D/cpp/CMakeLists.txt
new file mode 100644
index 0000000..0fd62d5
--- /dev/null
+++ b/demo/undocumented/poisson1D/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_poisson1D)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/poisson1D/cpp/Poisson.h b/demo/undocumented/poisson1D/cpp/Poisson.h
new file mode 100644
index 0000000..6826cfc
--- /dev/null
+++ b/demo/undocumented/poisson1D/cpp/Poisson.h
@@ -0,0 +1,2108 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('interval', 1)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::interval;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[1];
+    compute_jacobian_interval_1d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[1];
+    double detJ;
+    compute_jacobian_inverse_interval_1d(K, detJ, J);
+    
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (2.0*x[0] - vertex_coordinates[0] - vertex_coordinates[1]) / J[0];
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, -0.408248290463863};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, 0.408248290463863};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 1;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[1];
+    compute_jacobian_interval_1d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[1];
+    double detJ;
+    compute_jacobian_inverse_interval_1d(K, detJ, J);
+    
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (2.0*x[0] - vertex_coordinates[0] - vertex_coordinates[1]) / J[0];
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[1][1];
+    for (unsigned int row = 0; row < 1; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 0)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[1][1] = {{K[0]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[1][1];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, -0.408248290463863};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[2][2] = \
+      {{0.0, 0.0},
+      {3.46410161513775, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[1];
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 2; t++)
+        {
+          for (unsigned int u = 0; u < 2; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              for (unsigned int tu = 0; tu < 2; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 2; s++)
+        {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, 0.408248290463863};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[2][2] = \
+      {{0.0, 0.0},
+      {3.46410161513775, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[1];
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 2; t++)
+        {
+          for (unsigned int u = 0; u < 2; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              for (unsigned int tu = 0; tu < 2; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 2; s++)
+        {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 1;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[1];
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[1];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[1];
+    y[0] = vertex_coordinates[0];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('interval', 1)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 0;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 1)
+    {
+    throw std::runtime_error("d is larger than dimension (1)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 1)
+      {
+      throw std::runtime_error("i is larger than number of entities (1)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[1][0] = vertex_coordinates[1];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    1
+    // Number of operations (multiply-add pairs) for tensor contraction: 0
+    // Total number of operations (multiply-add pairs):                  4
+    
+    // Compute Jacobian
+    double J[1];
+    compute_jacobian_interval_1d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[1];
+    double detJ;
+    compute_jacobian_inverse_interval_1d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*K[0]*K[0];
+    
+    // Compute element tensor
+    A[0] = G0_0_0;
+    A[1] = -G0_0_0;
+    A[2] = -G0_0_0;
+    A[3] = G0_0_0;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    2
+    // Number of operations (multiply-add pairs) for tensor contraction: 3
+    // Total number of operations (multiply-add pairs):                  8
+    
+    // Compute Jacobian
+    double J[1];
+    compute_jacobian_interval_1d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[1];
+    double detJ;
+    compute_jacobian_inverse_interval_1d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.333333333333333*G0_0 + 0.166666666666666*G0_1;
+    A[1] = 0.166666666666666*G0_0 + 0.333333333333333*G0_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_1_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_1_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    2
+    // Number of operations (multiply-add pairs) for tensor contraction: 0
+    // Total number of operations (multiply-add pairs):                  5
+    
+    // Compute Jacobian
+    double J[1];
+    compute_jacobian_interval_1d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[1];
+    double detJ;
+    compute_jacobian_inverse_interval_1d(K, detJ, J);
+    
+    // Facet determinant 1D (vertex)
+    const double det = 1.0;
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = G0_0;
+      A[1] = 0.0;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.0;
+      A[1] = G0_1;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "1a5a1881f4f2c241200b43adbdac1c99b80dbd5ef5a755749f7a9036d32b52e5a1183e66b0be7fd9cb5d8fef78af31b13ba96c391b53fd166cf85b3d0f571f70";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "f041725ef8a836c16a72dfcc9c9239c6406f6800d04f832faf63e37dd8bddd01c37e1308bc03a85d65d45efc1b07cd1015761f47631f7d9dabf523ac12e4f2b8";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new poisson_exterior_facet_integral_1_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_L_FunctionSpace_2;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/poisson1D/cpp/Poisson.ufl b/demo/undocumented/poisson1D/cpp/Poisson.ufl
new file mode 100644
index 0000000..64b6b29
--- /dev/null
+++ b/demo/undocumented/poisson1D/cpp/Poisson.ufl
@@ -0,0 +1,35 @@
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2007-11-23
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl
+
+element = FiniteElement("Lagrange", interval, 1)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+
+f = Coefficient(element)
+g = Coefficient(element)
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
diff --git a/demo/undocumented/poisson1D/cpp/compile.log b/demo/undocumented/poisson1D/cpp/compile.log
new file mode 100644
index 0000000..0d961af
--- /dev/null
+++ b/demo/undocumented/poisson1D/cpp/compile.log
@@ -0,0 +1,180 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    1
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    1
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, g]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0185039 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.000738 seconds
+  Shape of reference tensor: (2, 2, 1, 1)
+  Primary multi index:   rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Secondary multi index: rank = 2 dims = [1, 1] indices = [[0, 0]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [1, 1] indices = [[0, 0]]
+  External multi index:  rank = 1 dims = [1] indices = [[0]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.000606 seconds
+  Shape of reference tensor: (2, 2)
+  Primary multi index:   rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.000382 seconds
+  Shape of reference tensor: (2, 2)
+  Primary multi index:   rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.00037 seconds
+  Shape of reference tensor: (2, 2)
+  Primary multi index:   rank = 1 dims = [2] indices = [[0], [1]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [2] indices = [[0], [1]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00898981 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000364065 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0211 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000571966 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000585794 seconds.
+
+FFC finished in 0.0504749 seconds.
diff --git a/demo/undocumented/poisson1D/cpp/main.cpp b/demo/undocumented/poisson1D/cpp/main.cpp
new file mode 100644
index 0000000..ff47627
--- /dev/null
+++ b/demo/undocumented/poisson1D/cpp/main.cpp
@@ -0,0 +1,109 @@
+// Copyright (C) 2007 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011
+//
+// First added:  2007-11-23
+// Last changed: 2012-11-12
+//
+// This demo program solves Poisson's equation,
+//
+//     - div grad u(x) = f(x)
+//
+// on the unit interval with source f given by
+//
+//     f(x) = 9.0*DOLFIN_PI*DOLFIN_PI*sin(3.0*DOLFIN_PI*x[0]);
+//
+// and boundary conditions given by
+//
+//     u(x) = 0 for x = 0,
+//    du/dx = 0 for x = 1.
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+// Boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return (std::abs(x[0]) < DOLFIN_EPS);
+  }
+};
+
+// Source term
+class Source : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = 9.0*DOLFIN_PI*DOLFIN_PI*sin(3.0*DOLFIN_PI*x[0]);
+  }
+
+};
+
+// Neumann boundary condition
+class Flux : public Expression
+{
+public:
+
+  void eval(Array<double>& values, const Array<double>& x) const
+  {
+    values[0] = 3.0*DOLFIN_PI*cos(3.0*DOLFIN_PI*x[0]);
+  }
+};
+
+int main()
+{
+  // Create mesh
+  UnitIntervalMesh mesh(50);
+
+  // Create function space
+  Poisson::FunctionSpace V(mesh);
+
+  // Set up BCs
+  Constant zero(0.0);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, zero, boundary);
+
+  // Create source and flux terms
+  Source f;
+  Flux g;
+
+  // Define variational problem
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  L.f = f;
+  L.g = g;
+
+  // Solve PDE
+  Function u(V);
+  solve(a == L, u, bc);
+
+  // Save solution in VTK format
+  File file_u("poisson.pvd");
+  file_u << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/poisson1D/python/demo_poisson1D.py b/demo/undocumented/poisson1D/python/demo_poisson1D.py
new file mode 100644
index 0000000..1b12d08
--- /dev/null
+++ b/demo/undocumented/poisson1D/python/demo_poisson1D.py
@@ -0,0 +1,70 @@
+"""This demo program solves Poisson's equation
+
+    - div grad u(x) = f(x)
+
+on the unit interval with source f given by
+
+    f(x) = 9*pi^2*sin(3*pi*x[0])
+
+and boundary conditions given by
+
+    u(x) = 0 for x = 0
+    du/dx = 0 for x = 1
+"""
+
+# Copyright (C) 2007 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2007-11-28
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh and function space
+mesh = UnitIntervalMesh(50)
+V = FunctionSpace(mesh, "CG", 1)
+
+# Sub domain for Dirichlet boundary condition
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary and x[0] < DOLFIN_EPS
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Expression("9.0*pi*pi*sin(3.0*pi*x[0])")
+g = Expression("3.0*pi*cos(3.0*pi*x[0])")
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, DirichletBoundary())
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Save solution to file
+file = File("poisson.pvd")
+file << u
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/undocumented/projection-interpolation/cpp/CMakeLists.txt b/demo/undocumented/projection-interpolation/cpp/CMakeLists.txt
new file mode 100644
index 0000000..c969664
--- /dev/null
+++ b/demo/undocumented/projection-interpolation/cpp/CMakeLists.txt
@@ -0,0 +1,39 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+project(demo_projection-interpolation)
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Add special DOLFIN compiler flags
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${DOLFIN_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+
+
+# Target libraries
+NOT_SET
diff --git a/demo/undocumented/projection-interpolation/cpp/README b/demo/undocumented/projection-interpolation/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/undocumented/projection-interpolation/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/projection-interpolation/python/demo_projection-interpolation.py b/demo/undocumented/projection-interpolation/python/demo_projection-interpolation.py
new file mode 100644
index 0000000..c536000
--- /dev/null
+++ b/demo/undocumented/projection-interpolation/python/demo_projection-interpolation.py
@@ -0,0 +1,44 @@
+"""This script demonstrate how to project and interpolate functions
+between different finite element spaces."""
+
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-10-06
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh and define function spaces
+mesh = UnitSquareMesh(64, 64)
+P1 = FunctionSpace(mesh, "CG", 1)
+
+# Define function
+v = Expression("sin(10.0*x[0])*sin(10.0*x[1])", degree=2)
+
+# Compute projection (L2-projection)
+Pv = project(v, V=P1)
+
+# Compute interpolation (evaluating dofs)
+PIv = Function(P1)
+PIv.interpolate(v)
+
+# Plot functions
+plot(v, mesh=mesh,  title="v")
+plot(Pv,  title="Pv")
+plot(PIv, title="PI v")
+interactive()
diff --git a/demo/undocumented/refinement/cpp/CMakeLists.txt b/demo/undocumented/refinement/cpp/CMakeLists.txt
new file mode 100644
index 0000000..c00f2b7
--- /dev/null
+++ b/demo/undocumented/refinement/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_refinement)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/refinement/cpp/main.cpp b/demo/undocumented/refinement/cpp/main.cpp
new file mode 100644
index 0000000..1e277b5
--- /dev/null
+++ b/demo/undocumented/refinement/cpp/main.cpp
@@ -0,0 +1,61 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman, 2006.
+//
+// First added:  2006-10-26
+// Last changed: 2012-11-12
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  File file("mesh.pvd");
+
+  // Create mesh of unit square
+  UnitSquareMesh unit_square(5, 5);
+  Mesh mesh(unit_square);
+  file << mesh;
+
+  // Uniform refinement
+  mesh = refine(mesh);
+  file << mesh;
+
+  // Refine mesh close to x = (0.5, 0.5)
+  Point p(0.5, 0.5);
+  for (unsigned int i = 0; i < 5; i++)
+  {
+    // Mark cells for refinement
+    MeshFunction<bool> cell_markers(mesh, mesh.topology().dim(), false);
+    for (CellIterator c(mesh); !c.end(); ++c)
+    {
+      if (c->midpoint().distance(p) < 0.1)
+        cell_markers[*c] = true;
+    }
+
+    // Refine mesh
+    mesh = refine(mesh, cell_markers);
+
+    file << mesh;
+    plot(mesh);
+    interactive();
+  }
+
+  return 0;
+}
diff --git a/demo/undocumented/refinement/python/demo_refinement.py b/demo/undocumented/refinement/python/demo_refinement.py
new file mode 100644
index 0000000..76afa97
--- /dev/null
+++ b/demo/undocumented/refinement/python/demo_refinement.py
@@ -0,0 +1,66 @@
+"This demo illustrates mesh refinement."
+
+# Copyright (C) 2007-2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2007-06-01
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh of unit square
+mesh = UnitSquareMesh(8, 8)
+plot(mesh)
+
+info(mesh)
+print
+
+# Uniform refinement
+mesh = refine(mesh)
+plot(mesh)
+
+info(mesh)
+print
+
+# Uniform refinement
+mesh = refine(mesh)
+plot(mesh)
+
+info(mesh)
+print
+
+# Refine mesh close to x = (0.5, 0.5)
+p = Point(0.5, 0.5)
+for i in range(5):
+
+    print "marking for refinement"
+
+    # Mark cells for refinement
+    cell_markers = CellFunction("bool", mesh)
+    for c in cells(mesh):
+        if c.midpoint().distance(p) < 0.1:
+            cell_markers[c] = True
+        else:
+            cell_markers[c] = False
+
+    # Refine mesh
+    mesh = refine(mesh, cell_markers)
+
+    # Plot mesh
+    plot(mesh)
+
+interactive()
diff --git a/demo/undocumented/restriction/cpp/CMakeLists.txt b/demo/undocumented/restriction/cpp/CMakeLists.txt
new file mode 100644
index 0000000..3b2c2fb
--- /dev/null
+++ b/demo/undocumented/restriction/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_restriction)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/restriction/cpp/Poisson.h b/demo/undocumented/restriction/cpp/Poisson.h
new file mode 100644
index 0000000..5a05f51
--- /dev/null
+++ b/demo/undocumented/restriction/cpp/Poisson.h
@@ -0,0 +1,2213 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d29669d54e80ba045b9f6aeb94d0d33237447c2de5977853d51a949f2f7e7c2b30871cf2fd1dd173fdabb4daf7908a96678f21eb4086c6ed052d173bfb7ea232";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/restriction/cpp/Poisson.ufl b/demo/undocumented/restriction/cpp/Poisson.ufl
new file mode 100644
index 0000000..dd777ba
--- /dev/null
+++ b/demo/undocumented/restriction/cpp/Poisson.ufl
@@ -0,0 +1,33 @@
+# Copyright (C) 2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-10-12
+# Last changed: 2012-10-12
+#
+# Simple Poisson problem, used for demonstration of function spaces
+# restricted to a subdomain of the mesh.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl.
+
+V = FiniteElement("Lagrange", triangle, 1)
+
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Coefficient(V)
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx
diff --git a/demo/undocumented/restriction/cpp/compile.log b/demo/undocumented/restriction/cpp/compile.log
new file mode 100644
index 0000000..c4e2ae0
--- /dev/null
+++ b/demo/undocumented/restriction/cpp/compile.log
@@ -0,0 +1,170 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0262549 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000793 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000667 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0084188 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000277042 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.046005 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000625134 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000656843 seconds.
+
+FFC finished in 0.0825949 seconds.
diff --git a/demo/undocumented/restriction/cpp/main.cpp b/demo/undocumented/restriction/cpp/main.cpp
new file mode 100644
index 0000000..c27f9f7
--- /dev/null
+++ b/demo/undocumented/restriction/cpp/main.cpp
@@ -0,0 +1,81 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-10-12
+// Last changed: 2012-12-27
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+// Subdomain for domain (restriction)
+class Domain : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return (x[0] > 0.25 - DOLFIN_EPS &&
+            x[0] < 0.75 + DOLFIN_EPS &&
+            x[1] > 0.25 - DOLFIN_EPS &&
+            x[1] < 0.75 + DOLFIN_EPS);
+  }
+};
+
+// Subdomain for boundary (left part of restriction)
+class Boundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return (std::abs(x[0] - 0.25) < DOLFIN_EPS &&
+            x[1] > 0.25 - DOLFIN_EPS &&
+            x[1] < 0.75 + DOLFIN_EPS);
+  }
+};
+
+int main()
+{
+  // Create mesh
+  UnitSquareMesh mesh(32, 32);
+
+  // Define restriction
+  Domain domain;
+  Restriction restriction(mesh, domain);
+
+  // Create restricted function space
+  Poisson::FunctionSpace V(restriction);
+
+  // Create forms and attach coefficients
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  Constant f(100.0);
+  L.f = f;
+
+  // Define boundary condition
+  Constant zero(0.0);
+  Boundary boundary;
+  DirichletBC bc(V, zero, boundary);
+
+  // Compute solution
+  Function u(V);
+  solve(a == L, u, bc);
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/restriction/python/README b/demo/undocumented/restriction/python/README
new file mode 100644
index 0000000..0b449da
--- /dev/null
+++ b/demo/undocumented/restriction/python/README
@@ -0,0 +1,2 @@
+There is as yet no Python version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/restriction/python/demo_restriction.py b/demo/undocumented/restriction/python/demo_restriction.py
new file mode 100644
index 0000000..4f95e5d
--- /dev/null
+++ b/demo/undocumented/restriction/python/demo_restriction.py
@@ -0,0 +1,79 @@
+"""This demo program solves a Poisson problem on a function space that
+lives on a subset of the mesh."""
+
+# Copyright (C) 2013 Martin S. Alnaes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-04-03
+# Last changed: 2013-04-03
+
+from dolfin import *
+
+# Note that the interface to restricted function spaces is
+# experimental and likely to change somewhat in future dolfin
+# versions.
+
+class Domain (SubDomain):
+    def inside(self, x, on_boundary):
+        return (x[0] > 0.25 - DOLFIN_EPS and
+                x[0] < 0.75 + DOLFIN_EPS and
+                x[1] > 0.25 - DOLFIN_EPS and
+                x[1] < 0.75 + DOLFIN_EPS)
+
+class Boundary(SubDomain):
+   def inside(self, x, on_boundary):
+       return (abs(x[0] - 0.25) < DOLFIN_EPS and
+               x[1] > 0.25 - DOLFIN_EPS and
+               x[1] < 0.75 + DOLFIN_EPS)
+
+mesh = UnitSquareMesh(32, 32)
+domain = Domain()
+
+markers = CellFunction("size_t", mesh)
+markers.set_all(1)
+domain.mark(markers, 0)
+
+dx = dx[markers]
+
+# Two ways of defining a Restriction
+#restriction = Restriction(mesh, domain)
+restriction = Restriction(markers, 0)
+
+V = FunctionSpace(restriction, "CG", 1)
+
+# Define functions
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(100.0)
+
+# Define forms
+a = dot(grad(u),grad(v))*dx()
+L = f*v*dx()
+
+# Define boundary condition
+zero = Constant(0.0)
+boundary = Boundary()
+bc = DirichletBC(V, zero, boundary)
+
+# Solve system
+u = Function(V)
+solve(a == L, u, bc)
+
+# Plot solution, note that the restricted function is zero-extended,
+# this may change in future versions
+plot(u)
+interactive()
diff --git a/demo/undocumented/smoothing/cpp/CMakeLists.txt b/demo/undocumented/smoothing/cpp/CMakeLists.txt
new file mode 100644
index 0000000..f7c35ca
--- /dev/null
+++ b/demo/undocumented/smoothing/cpp/CMakeLists.txt
@@ -0,0 +1,39 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+project(demo_smoothing)
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Add special DOLFIN compiler flags
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${DOLFIN_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+
+
+# Target libraries
+NOT_SET
diff --git a/demo/undocumented/smoothing/cpp/README b/demo/undocumented/smoothing/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/undocumented/smoothing/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/smoothing/python/demo_smoothing.py b/demo/undocumented/smoothing/python/demo_smoothing.py
new file mode 100644
index 0000000..281db14
--- /dev/null
+++ b/demo/undocumented/smoothing/python/demo_smoothing.py
@@ -0,0 +1,72 @@
+"This demo program demonstrates various algorithms for mesh smoothing."
+
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-03-02
+# Last changed: 2010-05-11
+
+from dolfin import *
+
+# Create rectangular mesh
+mesh = RectangleMesh(0.0, 0.0, 2.4, 0.4, 60, 10)
+
+# Define a circular hole
+center = Point(0.2, 0.2)
+radius = 0.05
+class Hole(SubDomain):
+
+    def inside(self, x, on_boundary):
+        r = sqrt((x[0] - center[0])**2 + (x[1] - center[0])**2)
+        return r < 1.5*radius # slightly larger
+
+    def snap(self, x):
+        r = sqrt((x[0] - center[0])**2 + (x[1] - center[1])**2)
+        if r < 1.5*radius:
+            x[0] = center[0] + (radius / r)*(x[0] - center[0])
+            x[1] = center[1] + (radius / r)*(x[1] - center[1])
+
+# Mark hole and extract submesh
+hole = Hole()
+sub_domains = MeshFunction("size_t", mesh, mesh.topology().dim())
+sub_domains.set_all(0)
+hole.mark(sub_domains, 1)
+mesh = SubMesh(mesh, sub_domains, 0)
+mesh.snap_boundary(hole)
+
+# Refine and snap mesh
+plot(mesh, title="Mesh 0")
+num_refinements = 3
+for i in range(num_refinements):
+
+    # Mark cells for refinement
+    markers = MeshFunction("bool", mesh, mesh.topology().dim())
+    markers.set_all(False)
+    for cell in cells(mesh):
+        if cell.midpoint().distance(center) < 2*radius:
+            markers[cell.index()] = True
+
+    # Refine mesh
+    mesh = refine(mesh, markers)
+
+    # Snap boundary
+    mesh.snap_boundary(hole)
+
+    # Plot mesh
+    plot(mesh, title=("Mesh %d" % (i + 1)))
+
+interactive()
diff --git a/demo/undocumented/spatial-coordinates/cpp/CMakeLists.txt b/demo/undocumented/spatial-coordinates/cpp/CMakeLists.txt
new file mode 100644
index 0000000..554cd1f
--- /dev/null
+++ b/demo/undocumented/spatial-coordinates/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_spatial-coordinates)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/spatial-coordinates/cpp/SpatialCoordinates.h b/demo/undocumented/spatial-coordinates/cpp/SpatialCoordinates.h
new file mode 100644
index 0000000..e85c994
--- /dev/null
+++ b/demo/undocumented/spatial-coordinates/cpp/SpatialCoordinates.h
@@ -0,0 +1,3091 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __SPATIALCOORDINATES_H
+#define __SPATIALCOORDINATES_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class spatialcoordinates_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  spatialcoordinates_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~spatialcoordinates_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 6; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[4][2];
+    for (unsigned int row = 0; row < 4; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[4][4];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, -0.173205080756888, -0.1, 0.121716123890037, 0.0942809041582063, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.173205080756888, -0.1, 0.121716123890037, -0.0942809041582064, 0.0544331053951818};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.0, 0.0, 0.2, 0.0, 0.0, 0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.23094010767585, 0.133333333333333, 0.0, 0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, -0.23094010767585, 0.133333333333333, 0.0, -0.188561808316413, -0.163299316185545};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[6] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[3] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[6] = \
+      {0.471404520791032, 0.0, -0.266666666666667, -0.243432247780074, 0.0, 0.0544331053951817};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050514, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[6][6] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175278, 0.0, 0.0, 0.0},
+      {2.0, 6.12372435695795, 3.53553390593274, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[4];
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[6][6] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 6; t++)
+        {
+          for (unsigned int u = 0; u < 6; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            for (unsigned int u = 0; u < 6; u++)
+            {
+              for (unsigned int tu = 0; tu < 6; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 6; s++)
+        {
+          for (unsigned int t = 0; t < 6; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[4];
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new spatialcoordinates_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class spatialcoordinates_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  spatialcoordinates_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~spatialcoordinates_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    offset += num_global_entities[0];
+    dofs[3] = offset + c.entity_indices[1][0];
+    dofs[4] = offset + c.entity_indices[1][1];
+    dofs[5] = offset + c.entity_indices[1][2];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 4;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 5;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+    dof_coordinates[3][0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    dof_coordinates[3][1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new spatialcoordinates_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class spatialcoordinates_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  spatialcoordinates_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~spatialcoordinates_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 49
+    // Total number of operations (multiply-add pairs):                  60
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_1_0;
+    A[2] = 0.166666666666667*G0_0_1 + 0.166666666666667*G0_1_1;
+    A[3] = 0.0;
+    A[4] = -0.666666666666667*G0_0_1 - 0.666666666666667*G0_1_1;
+    A[5] = -0.666666666666667*G0_0_0 - 0.666666666666667*G0_1_0;
+    A[6] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1;
+    A[7] = 0.5*G0_0_0;
+    A[8] = -0.166666666666667*G0_0_1;
+    A[9] = 0.666666666666666*G0_0_1;
+    A[10] = 0.0;
+    A[11] = -0.666666666666667*G0_0_0 - 0.666666666666666*G0_0_1;
+    A[12] = 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1;
+    A[13] = -0.166666666666667*G0_1_0;
+    A[14] = 0.5*G0_1_1;
+    A[15] = 0.666666666666666*G0_1_0;
+    A[16] = -0.666666666666666*G0_1_0 - 0.666666666666666*G0_1_1;
+    A[17] = 0.0;
+    A[18] = 0.0;
+    A[19] = 0.666666666666666*G0_1_0;
+    A[20] = 0.666666666666666*G0_0_1;
+    A[21] = 1.33333333333333*G0_0_0 + 0.666666666666665*G0_0_1 + 0.666666666666665*G0_1_0 + 1.33333333333333*G0_1_1;
+    A[22] = -1.33333333333333*G0_0_0 - 0.666666666666666*G0_0_1 - 0.666666666666665*G0_1_0;
+    A[23] = -0.666666666666665*G0_0_1 - 0.666666666666667*G0_1_0 - 1.33333333333333*G0_1_1;
+    A[24] = -0.666666666666667*G0_1_0 - 0.666666666666667*G0_1_1;
+    A[25] = 0.0;
+    A[26] = -0.666666666666666*G0_0_1 - 0.666666666666666*G0_1_1;
+    A[27] = -1.33333333333333*G0_0_0 - 0.666666666666665*G0_0_1 - 0.666666666666666*G0_1_0;
+    A[28] = 1.33333333333333*G0_0_0 + 0.666666666666666*G0_0_1 + 0.666666666666666*G0_1_0 + 1.33333333333333*G0_1_1;
+    A[29] = 0.666666666666665*G0_0_1 + 0.666666666666667*G0_1_0;
+    A[30] = -0.666666666666667*G0_0_0 - 0.666666666666667*G0_0_1;
+    A[31] = -0.666666666666667*G0_0_0 - 0.666666666666666*G0_1_0;
+    A[32] = 0.0;
+    A[33] = -0.666666666666667*G0_0_1 - 0.666666666666665*G0_1_0 - 1.33333333333333*G0_1_1;
+    A[34] = 0.666666666666667*G0_0_1 + 0.666666666666665*G0_1_0;
+    A[35] = 1.33333333333333*G0_0_0 + 0.666666666666667*G0_0_1 + 0.666666666666667*G0_1_0 + 1.33333333333333*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class spatialcoordinates_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  spatialcoordinates_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~spatialcoordinates_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W12[12] = {0.0254224531851035, 0.0254224531851035, 0.0254224531851035, 0.0583931378631895, 0.0583931378631895, 0.0583931378631895, 0.041425537809187, 0.041425537809187, 0.041425537809187, 0.041425537809187, 0.041425537809187, 0.041425537809187};
+    // Quadrature points on the UFC reference element: (0.873821971016996, 0.063089014491502), (0.063089014491502, 0.873821971016996), (0.063089014491502, 0.063089014491502), (0.501426509658179, 0.24928674517091), (0.24928674517091, 0.501426509658179), (0.24928674517091, 0.24928674517091), (0.636502499121399, 0.310352451033785), (0.636502499121399, 0.053145049844816), (0.310352451033785, 0.636502499121399), (0.310352451033785, 0.053145049844816), (0.053145049844816, 0.636502499121399), (0.053145049844816, 0.310352451033785)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0[12][6] = \
+    {{-0.0551285669924841, 0.653307703047059, -0.0551285669924841, 0.220514267969936, 0.0159208949980358, 0.220514267969936},
+    {-0.055128566992484, -0.055128566992484, 0.65330770304706, 0.220514267969936, 0.220514267969936, 0.0159208949980358},
+    {0.65330770304706, -0.0551285669924841, -0.0551285669924841, 0.0159208949980358, 0.220514267969936, 0.220514267969936},
+    {-0.124998982535098, 0.00143057951778876, -0.124998982535098, 0.499995930140389, 0.248575525271626, 0.499995930140391},
+    {-0.124998982535098, -0.124998982535098, 0.00143057951778887, 0.499995930140389, 0.499995930140391, 0.248575525271626},
+    {0.00143057951778986, -0.124998982535098, -0.124998982535098, 0.248575525271625, 0.49999593014039, 0.49999593014039},
+    {-0.0474962571988001, 0.173768363654174, -0.117715163308429, 0.790160442765823, 0.0659747859186054, 0.135307828168627},
+    {-0.117715163308429, 0.173768363654174, -0.0474962571988, 0.135307828168627, 0.0659747859186052, 0.790160442765823},
+    {-0.0474962571988, -0.117715163308429, 0.173768363654174, 0.790160442765823, 0.135307828168627, 0.0659747859186053},
+    {0.173768363654174, -0.117715163308429, -0.0474962571988, 0.0659747859186052, 0.135307828168627, 0.790160442765823},
+    {-0.117715163308429, -0.0474962571988, 0.173768363654174, 0.135307828168627, 0.790160442765823, 0.0659747859186053},
+    {0.173768363654174, -0.0474962571988001, -0.117715163308429, 0.0659747859186054, 0.790160442765823, 0.135307828168627}};
+    
+    static const double FEA12_f0[12][3] = \
+    {{0.063089014491502, 0.873821971016996, 0.063089014491502},
+    {0.0630890144915021, 0.063089014491502, 0.873821971016996},
+    {0.873821971016996, 0.063089014491502, 0.063089014491502},
+    {0.249286745170911, 0.501426509658179, 0.24928674517091},
+    {0.249286745170911, 0.24928674517091, 0.501426509658179},
+    {0.50142650965818, 0.24928674517091, 0.24928674517091},
+    {0.053145049844816, 0.636502499121399, 0.310352451033785},
+    {0.310352451033785, 0.636502499121399, 0.053145049844816},
+    {0.0531450498448161, 0.310352451033785, 0.636502499121399},
+    {0.636502499121399, 0.310352451033785, 0.053145049844816},
+    {0.310352451033785, 0.053145049844816, 0.636502499121399},
+    {0.636502499121399, 0.053145049844816, 0.310352451033785}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 1.
+    double G[1];
+    G[0] = 10.0*det;
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    
+    // Declare array to hold physical coordinate of quadrature point.
+    double X12[2];
+    // Number of operations to compute element tensor for following IP loop = 396
+    for (unsigned int ip = 0; ip < 12; ip++)
+    {
+      
+      // Compute physical coordinate of quadrature point, operations: 10.
+      X12[0] = FEA12_f0[ip][0]*vertex_coordinates[0] +                  FEA12_f0[ip][1]*vertex_coordinates[2] + FEA12_f0[ip][2]*vertex_coordinates[4];
+      X12[1] = FEA12_f0[ip][0]*vertex_coordinates[1] +                  FEA12_f0[ip][1]*vertex_coordinates[3] + FEA12_f0[ip][2]*vertex_coordinates[5];
+      
+      // Number of operations to compute ip constants: 11
+      double I[1];
+      // Number of operations: 11
+      I[0] = G[0]*W12[ip]*std::exp( - ((X12[0]-0.5)*(X12[0]-0.5) + (X12[1]-0.5)*(X12[1]-0.5))/0.02);
+      
+      
+      // Number of operations for primary indices: 12
+      for (unsigned int j = 0; j < 6; j++)
+      {
+        // Number of operations to compute entry: 2
+        A[j] += FE0[ip][j]*I[0];
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class spatialcoordinates_exterior_facet_integral_1_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  spatialcoordinates_exterior_facet_integral_1_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~spatialcoordinates_exterior_facet_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute facet normals from the facet scale factor constants
+    
+    // Facet area
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W3[3] = {0.277777777777778, 0.444444444444444, 0.277777777777778};
+    // Quadrature points on the UFC reference element: (0.112701665379258), (0.5), (0.887298334620742)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE0_f0[3][3] = \
+    {{0.687298334620742, -0.0872983346207417, 0.4},
+    {0.0, 0.0, 1.0},
+    {-0.0872983346207416, 0.687298334620742, 0.4}};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc0[3] = {1, 2, 3};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc2[3] = {0, 1, 5};
+    
+    // Array of non-zero columns
+    static const unsigned int nzc1[3] = {0, 2, 4};
+    
+    static const double FEA3_f0[3][3] = \
+    {{0.0, 0.887298334620742, 0.112701665379258},
+    {0.0, 0.5, 0.5},
+    {0.0, 0.112701665379258, 0.887298334620742}};
+    
+    static const double FEA3_f1[3][3] = \
+    {{0.887298334620742, 0.0, 0.112701665379258},
+    {0.5, 0.0, 0.5},
+    {0.112701665379258, 0.0, 0.887298334620742}};
+    
+    static const double FEA3_f2[3][3] = \
+    {{0.887298334620742, 0.112701665379258, 0.0},
+    {0.5, 0.5, 0.0},
+    {0.112701665379258, 0.887298334620742, 0.0}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 6; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    switch (facet)
+    {
+    case 0:
+      {
+        // Total number of operations to compute element tensor (from this point): 60
+      
+      // Loop quadrature points for integral.
+      
+      // Declare array to hold physical coordinate of quadrature point.
+      double X3[2];
+      // Number of operations to compute element tensor for following IP loop = 60
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Compute physical coordinate of quadrature point, operations: 10.
+        X3[0] = FEA3_f0[ip][0]*vertex_coordinates[0] +                  FEA3_f0[ip][1]*vertex_coordinates[2] + FEA3_f0[ip][2]*vertex_coordinates[4];
+        X3[1] = FEA3_f0[ip][0]*vertex_coordinates[1] +                  FEA3_f0[ip][1]*vertex_coordinates[3] + FEA3_f0[ip][2]*vertex_coordinates[5];
+        
+        // Number of operations to compute ip constants: 4
+        double I[1];
+        // Number of operations: 4
+        I[0] =  - W3[ip]*det*std::sin(5.0*X3[0]);
+        
+        
+        // Number of operations for primary indices: 6
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc0[j]] += FE0_f0[ip][j]*I[0];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 1:
+      {
+        // Total number of operations to compute element tensor (from this point): 60
+      
+      // Loop quadrature points for integral.
+      
+      // Declare array to hold physical coordinate of quadrature point.
+      double X3[2];
+      // Number of operations to compute element tensor for following IP loop = 60
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Compute physical coordinate of quadrature point, operations: 10.
+        X3[0] = FEA3_f1[ip][0]*vertex_coordinates[0] +                  FEA3_f1[ip][1]*vertex_coordinates[2] + FEA3_f1[ip][2]*vertex_coordinates[4];
+        X3[1] = FEA3_f1[ip][0]*vertex_coordinates[1] +                  FEA3_f1[ip][1]*vertex_coordinates[3] + FEA3_f1[ip][2]*vertex_coordinates[5];
+        
+        // Number of operations to compute ip constants: 4
+        double I[1];
+        // Number of operations: 4
+        I[0] =  - W3[ip]*det*std::sin(5.0*X3[0]);
+        
+        
+        // Number of operations for primary indices: 6
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc1[j]] += FE0_f0[ip][j]*I[0];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    case 2:
+      {
+        // Total number of operations to compute element tensor (from this point): 60
+      
+      // Loop quadrature points for integral.
+      
+      // Declare array to hold physical coordinate of quadrature point.
+      double X3[2];
+      // Number of operations to compute element tensor for following IP loop = 60
+      for (unsigned int ip = 0; ip < 3; ip++)
+      {
+        
+        // Compute physical coordinate of quadrature point, operations: 10.
+        X3[0] = FEA3_f2[ip][0]*vertex_coordinates[0] +                  FEA3_f2[ip][1]*vertex_coordinates[2] + FEA3_f2[ip][2]*vertex_coordinates[4];
+        X3[1] = FEA3_f2[ip][0]*vertex_coordinates[1] +                  FEA3_f2[ip][1]*vertex_coordinates[3] + FEA3_f2[ip][2]*vertex_coordinates[5];
+        
+        // Number of operations to compute ip constants: 4
+        double I[1];
+        // Number of operations: 4
+        I[0] =  - W3[ip]*det*std::sin(5.0*X3[0]);
+        
+        
+        // Number of operations for primary indices: 6
+        for (unsigned int j = 0; j < 3; j++)
+        {
+          // Number of operations to compute entry: 2
+          A[nzc2[j]] += FE0_f0[ip][j]*I[0];
+        } // end loop over 'j'
+      } // end loop over 'ip'
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class spatialcoordinates_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  spatialcoordinates_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~spatialcoordinates_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "aae0a73595ace2836ec2cfac776b19ebe6bc264a8954a0a93986ca1a90118d4671958a14ba9141ef0d8adc0b7311a7d128634bedabdb1f15360fafef8ee30294";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new spatialcoordinates_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new spatialcoordinates_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new spatialcoordinates_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new spatialcoordinates_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new spatialcoordinates_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class spatialcoordinates_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  spatialcoordinates_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~spatialcoordinates_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "b8f5ce0ea265d46fa45a407c4c50b570c64e247a667949fe28c8edcfe8898e2da3c1701a096af871b7c1540d1179d813a78fd31efaced7a615d2110474bfdce7";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new spatialcoordinates_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new spatialcoordinates_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new spatialcoordinates_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new spatialcoordinates_exterior_facet_integral_1_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace SpatialCoordinates
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new spatialcoordinates_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new spatialcoordinates_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new spatialcoordinates_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new spatialcoordinates_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new spatialcoordinates_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new spatialcoordinates_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/spatial-coordinates/cpp/SpatialCoordinates.ufl b/demo/undocumented/spatial-coordinates/cpp/SpatialCoordinates.ufl
new file mode 100644
index 0000000..2e08267
--- /dev/null
+++ b/demo/undocumented/spatial-coordinates/cpp/SpatialCoordinates.ufl
@@ -0,0 +1,36 @@
+# Copyright (C) 2010 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation where spatial coordinates are used to define the source
+# and boundary flux terms.
+#
+# Compile this form with FFC: ffc -l dolfin SpatialCoordinates.ufl
+
+element = FiniteElement("Lagrange", triangle, 2)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+
+x = SpatialCoordinate(triangle)
+d_x = x[0] - 0.5
+d_y = x[1] - 0.5
+f = 10.0*exp(-(d_x*d_x + d_y*d_y) / 0.02)
+g = -sin(5.0*x[0])
+
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
diff --git a/demo/undocumented/spatial-coordinates/cpp/compile.log b/demo/undocumented/spatial-coordinates/cpp/compile.log
new file mode 100644
index 0000000..97c6155
--- /dev/null
+++ b/demo/undocumented/spatial-coordinates/cpp/compile.log
@@ -0,0 +1,926 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form SpatialCoordinates
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal SpatialCoordinate.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Monomial extraction failed: No handler defined for terminal SpatialCoordinate.
+  Estimated cost of tensor representation: -1
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 5
+  quadrature_degree: auto --> 5
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.022141 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.00224 seconds
+  Shape of reference tensor: (6, 6, 2, 2)
+  Primary multi index:   rank = 2 dims = [6, 6] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {12: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.06308901,  0.06308901,  0.87382197,  0.24928675,  0.24928675,
+            0.50142651,  0.05314505,  0.31035245,  0.05314505,  0.6365025 ,
+            0.31035245,  0.6365025 ],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.87382197,  0.06308901,  0.06308901,  0.50142651,  0.24928675,
+            0.24928675,  0.6365025 ,  0.6365025 ,  0.31035245,  0.31035245,
+            0.05314505,  0.05314505],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.06308901,  0.87382197,  0.06308901,  0.24928675,  0.50142651,
+            0.24928675,  0.31035245,  0.05314505,  0.6365025 ,  0.05314505,
+            0.6365025 ,  0.31035245],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.06308901,  0.06308901,  0.87382197,  0.24928675,  0.24928675,
+            0.50142651,  0.05314505,  0.31035245,  0.05314505,  0.6365025 ,
+            0.31035245,  0.6365025 ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.87382197,  0.06308901,  0.06308901,  0.50142651,  0.24928675,
+            0.24928675,  0.6365025 ,  0.6365025 ,  0.31035245,  0.31035245,
+            0.05314505,  0.05314505]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ,  0.        ],
+          [ 0.06308901,  0.87382197,  0.06308901,  0.24928675,  0.50142651,
+            0.24928675,  0.31035245,  0.05314505,  0.6365025 ,  0.05314505,
+            0.6365025 ,  0.31035245]]])}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {None: {(0, 0): array([[-0.05512856699248412, -0.055128566992484043, 0.65330770304705954,
+          -0.1249989825350975, -0.1249989825350975, 0.0014305795177898609,
+          -0.047496257198800081, -0.11771516330842913, -0.047496257198799997,
+          0.17376836365417414, -0.11771516330842907, 0.17376836365417411],
+         [0.65330770304705943, -0.055128566992484043, -0.055128566992484106,
+          0.0014305795177887645, -0.12499898253509756, -0.12499898253509753,
+          0.17376836365417397, 0.17376836365417411, -0.11771516330842918,
+          -0.11771516330842915, -0.047496257198800025, -0.047496257198800088],
+         [-0.055128566992484113, 0.65330770304705976, -0.055128566992484113,
+          -0.12499898253509753, 0.0014305795177888686, -0.12499898253509753,
+          -0.11771516330842913, -0.04749625719879999, 0.17376836365417414,
+          -0.04749625719879999, 0.17376836365417414, -0.11771516330842913],
+         [0.22051426796993645, 0.22051426796993634, 0.015920894998035798,
+          0.49999593014038918, 0.49999593014038912, 0.2485755252716248,
+          0.79016044276582287, 0.13530782816862674, 0.79016044276582298,
+          0.065974785918605214, 0.13530782816862677, 0.065974785918605353],
+         [0.015920894998035756, 0.22051426796993628, 0.22051426796993645,
+          0.24857552527162582, 0.49999593014039118, 0.49999593014039018,
+          0.065974785918605366, 0.0659747859186052, 0.13530782816862683,
+          0.13530782816862666, 0.79016044276582298, 0.79016044276582287],
+         [0.22051426796993645, 0.015920894998035798, 0.22051426796993645,
+          0.49999593014039118, 0.24857552527162582, 0.49999593014039018,
+          0.13530782816862685, 0.79016044276582309, 0.065974785918605255,
+          0.79016044276582309, 0.065974785918605255, 0.13530782816862685]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_C0': array([[ 0.06308901,  0.87382197,  0.06308901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.06308901,  0.06308901,  0.87382197,  0.        ,  0.        ,
+           0.        ],
+         [ 0.87382197,  0.06308901,  0.06308901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.24928675,  0.50142651,  0.24928675,  0.        ,  0.        ,
+           0.        ],
+         [ 0.24928675,  0.24928675,  0.50142651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.50142651,  0.24928675,  0.24928675,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05314505,  0.6365025 ,  0.31035245,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31035245,  0.6365025 ,  0.05314505,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05314505,  0.31035245,  0.6365025 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.6365025 ,  0.31035245,  0.05314505,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31035245,  0.05314505,  0.6365025 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.6365025 ,  0.05314505,  0.31035245,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.06308901,  0.87382197,
+           0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.06308901,  0.06308901,
+           0.87382197],
+         [ 0.        ,  0.        ,  0.        ,  0.87382197,  0.06308901,
+           0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.24928675,  0.50142651,
+           0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.24928675,  0.24928675,
+           0.50142651],
+         [ 0.        ,  0.        ,  0.        ,  0.50142651,  0.24928675,
+           0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.05314505,  0.6365025 ,
+           0.31035245],
+         [ 0.        ,  0.        ,  0.        ,  0.31035245,  0.6365025 ,
+           0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.05314505,  0.31035245,
+           0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.6365025 ,  0.31035245,
+           0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.31035245,  0.05314505,
+           0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.6365025 ,  0.05314505,
+           0.31035245]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[-0.05512856699248412, 0.65330770304705943, -0.055128566992484113,
+          0.22051426796993645, 0.015920894998035756, 0.22051426796993645],
+         [-0.055128566992484043, -0.055128566992484043, 0.65330770304705976,
+          0.22051426796993634, 0.22051426796993628, 0.015920894998035798],
+         [0.65330770304705954, -0.055128566992484106, -0.055128566992484113,
+          0.015920894998035798, 0.22051426796993645, 0.22051426796993645],
+         [-0.1249989825350975, 0.0014305795177887645, -0.12499898253509753,
+          0.49999593014038918, 0.24857552527162582, 0.49999593014039118],
+         [-0.1249989825350975, -0.12499898253509756, 0.0014305795177888686,
+          0.49999593014038912, 0.49999593014039118, 0.24857552527162582],
+         [0.0014305795177898609, -0.12499898253509753, -0.12499898253509753,
+          0.2485755252716248, 0.49999593014039018, 0.49999593014039018],
+         [-0.047496257198800081, 0.17376836365417397, -0.11771516330842913,
+          0.79016044276582287, 0.065974785918605366, 0.13530782816862685],
+         [-0.11771516330842913, 0.17376836365417411, -0.04749625719879999,
+          0.13530782816862674, 0.0659747859186052, 0.79016044276582309],
+         [-0.047496257198799997, -0.11771516330842918, 0.17376836365417414,
+          0.79016044276582298, 0.13530782816862683, 0.065974785918605255],
+         [0.17376836365417414, -0.11771516330842915, -0.04749625719879999,
+          0.065974785918605214, 0.13530782816862666, 0.79016044276582309],
+         [-0.11771516330842907, -0.047496257198800025, 0.17376836365417414,
+          0.13530782816862677, 0.79016044276582298, 0.065974785918605255],
+         [0.17376836365417411, -0.047496257198800088, -0.11771516330842913,
+          0.065974785918605353, 0.79016044276582287, 0.13530782816862685]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  tables: {'FE1_C0': array([[ 0.06308901,  0.87382197,  0.06308901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.06308901,  0.06308901,  0.87382197,  0.        ,  0.        ,
+           0.        ],
+         [ 0.87382197,  0.06308901,  0.06308901,  0.        ,  0.        ,
+           0.        ],
+         [ 0.24928675,  0.50142651,  0.24928675,  0.        ,  0.        ,
+           0.        ],
+         [ 0.24928675,  0.24928675,  0.50142651,  0.        ,  0.        ,
+           0.        ],
+         [ 0.50142651,  0.24928675,  0.24928675,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05314505,  0.6365025 ,  0.31035245,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31035245,  0.6365025 ,  0.05314505,  0.        ,  0.        ,
+           0.        ],
+         [ 0.05314505,  0.31035245,  0.6365025 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.6365025 ,  0.31035245,  0.05314505,  0.        ,  0.        ,
+           0.        ],
+         [ 0.31035245,  0.05314505,  0.6365025 ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.6365025 ,  0.05314505,  0.31035245,  0.        ,  0.        ,
+           0.        ]]), 'FE1_C1': array([[ 0.        ,  0.        ,  0.        ,  0.06308901,  0.87382197,
+           0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.06308901,  0.06308901,
+           0.87382197],
+         [ 0.        ,  0.        ,  0.        ,  0.87382197,  0.06308901,
+           0.06308901],
+         [ 0.        ,  0.        ,  0.        ,  0.24928675,  0.50142651,
+           0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.24928675,  0.24928675,
+           0.50142651],
+         [ 0.        ,  0.        ,  0.        ,  0.50142651,  0.24928675,
+           0.24928675],
+         [ 0.        ,  0.        ,  0.        ,  0.05314505,  0.6365025 ,
+           0.31035245],
+         [ 0.        ,  0.        ,  0.        ,  0.31035245,  0.6365025 ,
+           0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.05314505,  0.31035245,
+           0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.6365025 ,  0.31035245,
+           0.05314505],
+         [ 0.        ,  0.        ,  0.        ,  0.31035245,  0.05314505,
+           0.6365025 ],
+         [ 0.        ,  0.        ,  0.        ,  0.6365025 ,  0.05314505,
+           0.31035245]]), 'FE1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE0': array([[-0.05512856699248412, 0.65330770304705943, -0.055128566992484113,
+          0.22051426796993645, 0.015920894998035756, 0.22051426796993645],
+         [-0.055128566992484043, -0.055128566992484043, 0.65330770304705976,
+          0.22051426796993634, 0.22051426796993628, 0.015920894998035798],
+         [0.65330770304705954, -0.055128566992484106, -0.055128566992484113,
+          0.015920894998035798, 0.22051426796993645, 0.22051426796993645],
+         [-0.1249989825350975, 0.0014305795177887645, -0.12499898253509753,
+          0.49999593014038918, 0.24857552527162582, 0.49999593014039118],
+         [-0.1249989825350975, -0.12499898253509756, 0.0014305795177888686,
+          0.49999593014038912, 0.49999593014039118, 0.24857552527162582],
+         [0.0014305795177898609, -0.12499898253509753, -0.12499898253509753,
+          0.2485755252716248, 0.49999593014039018, 0.49999593014039018],
+         [-0.047496257198800081, 0.17376836365417397, -0.11771516330842913,
+          0.79016044276582287, 0.065974785918605366, 0.13530782816862685],
+         [-0.11771516330842913, 0.17376836365417411, -0.04749625719879999,
+          0.13530782816862674, 0.0659747859186052, 0.79016044276582309],
+         [-0.047496257198799997, -0.11771516330842918, 0.17376836365417414,
+          0.79016044276582298, 0.13530782816862683, 0.065974785918605255],
+         [0.17376836365417414, -0.11771516330842915, -0.04749625719879999,
+          0.065974785918605214, 0.13530782816862666, 0.79016044276582309],
+         [-0.11771516330842907, -0.047496257198800025, 0.17376836365417414,
+          0.13530782816862677, 0.79016044276582298, 0.065974785918605255],
+         [0.17376836365417411, -0.047496257198800088, -0.11771516330842913,
+          0.065974785918605353, 0.79016044276582287, 0.13530782816862685]], dtype=object), 'FE1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0': 'FE0', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[ 0.06308901,  0.87382197,  0.06308901],
+         [ 0.06308901,  0.06308901,  0.87382197],
+         [ 0.87382197,  0.06308901,  0.06308901],
+         [ 0.24928675,  0.50142651,  0.24928675],
+         [ 0.24928675,  0.24928675,  0.50142651],
+         [ 0.50142651,  0.24928675,  0.24928675],
+         [ 0.05314505,  0.6365025 ,  0.31035245],
+         [ 0.31035245,  0.6365025 ,  0.05314505],
+         [ 0.05314505,  0.31035245,  0.6365025 ],
+         [ 0.6365025 ,  0.31035245,  0.05314505],
+         [ 0.31035245,  0.05314505,  0.6365025 ],
+         [ 0.6365025 ,  0.05314505,  0.31035245]]), 'FE0': array([[-0.05512856699248412, 0.65330770304705943, -0.055128566992484113,
+          0.22051426796993645, 0.015920894998035756, 0.22051426796993645],
+         [-0.055128566992484043, -0.055128566992484043, 0.65330770304705976,
+          0.22051426796993634, 0.22051426796993628, 0.015920894998035798],
+         [0.65330770304705954, -0.055128566992484106, -0.055128566992484113,
+          0.015920894998035798, 0.22051426796993645, 0.22051426796993645],
+         [-0.1249989825350975, 0.0014305795177887645, -0.12499898253509753,
+          0.49999593014038918, 0.24857552527162582, 0.49999593014039118],
+         [-0.1249989825350975, -0.12499898253509756, 0.0014305795177888686,
+          0.49999593014038912, 0.49999593014039118, 0.24857552527162582],
+         [0.0014305795177898609, -0.12499898253509753, -0.12499898253509753,
+          0.2485755252716248, 0.49999593014039018, 0.49999593014039018],
+         [-0.047496257198800081, 0.17376836365417397, -0.11771516330842913,
+          0.79016044276582287, 0.065974785918605366, 0.13530782816862685],
+         [-0.11771516330842913, 0.17376836365417411, -0.04749625719879999,
+          0.13530782816862674, 0.0659747859186052, 0.79016044276582309],
+         [-0.047496257198799997, -0.11771516330842918, 0.17376836365417414,
+          0.79016044276582298, 0.13530782816862683, 0.065974785918605255],
+         [0.17376836365417414, -0.11771516330842915, -0.04749625719879999,
+          0.065974785918605214, 0.13530782816862666, 0.79016044276582309],
+         [-0.11771516330842907, -0.047496257198800025, 0.17376836365417414,
+          0.13530782816862677, 0.79016044276582298, 0.065974785918605255],
+         [0.17376836365417411, -0.047496257198800088, -0.11771516330842913,
+          0.065974785918605353, 0.79016044276582287, 0.13530782816862685]], dtype=object), 'FE1_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE1_C0': ('FE1_C0', (0, [0, 1, 2]), False, False), 'FE1_C1': ('FE1_C0', (3, [3, 4, 5]), False, False), 'FE1_C1_D10': ('FE1_C0_D01', (5, [3, 4]), False, False), 'FE0': ('FE0', (), False, False), 'FE1_C1_D01': ('FE1_C0_D01', (4, [3, 5]), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (1, [0, 2]), False, False), 'FE1_C0_D10': ('FE1_C0_D01', (2, [0, 1]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {3: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {0: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 1: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[  8.87298335e-01,   5.00000000e-01,   1.12701665e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  2.77555756e-17,   4.16333634e-17,   5.55111512e-17],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  1.12701665e-01,   5.00000000e-01,   8.87298335e-01],
+          [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  8.87298335e-01,   5.00000000e-01,   1.12701665e-01]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  2.77555756e-17,   4.16333634e-17,   5.55111512e-17]],
+  
+         [[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+          [  1.12701665e-01,   5.00000000e-01,   8.87298335e-01]]])}, 2: {(0, 1): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.],
+          [-1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.],
+          [ 0.,  0.,  0.]]]), (0, 0): array([[[ 0.88729833,  0.5       ,  0.11270167],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.11270167,  0.5       ,  0.88729833],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.88729833,  0.5       ,  0.11270167]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.11270167,  0.5       ,  0.88729833]],
+  
+         [[ 0.        ,  0.        ,  0.        ],
+          [ 0.        ,  0.        ,  0.        ]]])}}}, FiniteElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 2, quad_scheme=None): {None: {0: {(0, 0): array([[1.1275702593849246e-16, 4.163336342344337e-17,
+          4.163336342344337e-17],
+         [0.68729833462074186, -9.7144514654701197e-17, -0.08729833462074163],
+         [-0.087298334620741658, 8.3266726846886741e-17, 0.68729833462074186],
+         [0.39999999999999991, 0.99999999999999978, 0.3999999999999998],
+         [-4.8572257327350599e-17, 1.3877787807814457e-17,
+          5.5511151231257827e-17],
+         [-1.231653667943533e-16, 0.0, -6.9388939039072284e-17]], dtype=object)}, 1: {(0, 0): array([[0.68729833462074175, 8.3266726846886741e-17, -0.087298334620741616],
+         [9.3675067702747583e-17, 8.3266726846886741e-17,
+          9.7144514654701197e-17],
+         [-0.087298334620741658, 8.3266726846886741e-17, 0.68729833462074186],
+         [-2.7755575615628914e-17, 0.0, 0.0],
+         [0.39999999999999974, 0.99999999999999978, 0.39999999999999974],
+         [-1.231653667943533e-16, 0.0, -6.9388939039072284e-17]], dtype=object)}, 2: {(0, 0): array([[0.68729833462074175, 4.163336342344337e-17, -0.087298334620741685],
+         [-0.08729833462074163, 1.3877787807814457e-17, 0.68729833462074175],
+         [0.0, 0.0, 0.0],
+         [0.0, 0.0, 0.0],
+         [-2.7755575615628914e-17, -5.5511151231257827e-17,
+          -5.5511151231257827e-17],
+         [0.39999999999999991, 1.0, 0.39999999999999991]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE1_f2_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f2_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE0_f0': array([[1.1275702593849246e-16, 0.68729833462074186, -0.087298334620741658,
+          0.39999999999999991, -4.8572257327350599e-17,
+          -1.231653667943533e-16],
+         [4.163336342344337e-17, -9.7144514654701197e-17,
+          8.3266726846886741e-17, 0.99999999999999978,
+          1.3877787807814457e-17, 0.0],
+         [4.163336342344337e-17, -0.08729833462074163, 0.68729833462074186,
+          0.3999999999999998, 5.5511151231257827e-17, -6.9388939039072284e-17]], dtype=object), 'FE0_f1': array([[0.68729833462074175, 9.3675067702747583e-17, -0.087298334620741658,
+          -2.7755575615628914e-17, 0.39999999999999974,
+          -1.231653667943533e-16],
+         [8.3266726846886741e-17, 8.3266726846886741e-17,
+          8.3266726846886741e-17, 0.0, 0.99999999999999978, 0.0],
+         [-0.087298334620741616, 9.7144514654701197e-17, 0.68729833462074186,
+          0.0, 0.39999999999999974, -6.9388939039072284e-17]], dtype=object), 'FE0_f2': array([[0.68729833462074175, -0.08729833462074163, 0.0, 0.0,
+          -2.7755575615628914e-17, 0.39999999999999991],
+         [4.163336342344337e-17, 1.3877787807814457e-17, 0.0, 0.0,
+          -5.5511151231257827e-17, 1.0],
+         [-0.087298334620741685, 0.68729833462074175, 0.0, 0.0,
+          -5.5511151231257827e-17, 0.39999999999999991]], dtype=object), 'FE1_f1_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f1_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f2_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE1_f1_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE1_f1_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  tables: {'FE0_f0': array([[1.1275702593849246e-16, 0.68729833462074186, -0.087298334620741658,
+          0.39999999999999991, -4.8572257327350599e-17,
+          -1.231653667943533e-16],
+         [4.163336342344337e-17, -9.7144514654701197e-17,
+          8.3266726846886741e-17, 0.99999999999999978,
+          1.3877787807814457e-17, 0.0],
+         [4.163336342344337e-17, -0.08729833462074163, 0.68729833462074186,
+          0.3999999999999998, 5.5511151231257827e-17, -6.9388939039072284e-17]], dtype=object), 'FE0_f1': array([[0.68729833462074175, 9.3675067702747583e-17, -0.087298334620741658,
+          -2.7755575615628914e-17, 0.39999999999999974,
+          -1.231653667943533e-16],
+         [8.3266726846886741e-17, 8.3266726846886741e-17,
+          8.3266726846886741e-17, 0.0, 0.99999999999999978, 0.0],
+         [-0.087298334620741616, 9.7144514654701197e-17, 0.68729833462074186,
+          0.0, 0.39999999999999974, -6.9388939039072284e-17]], dtype=object), 'FE0_f2': array([[0.68729833462074175, -0.08729833462074163, 0.0, 0.0,
+          -2.7755575615628914e-17, 0.39999999999999991],
+         [4.163336342344337e-17, 1.3877787807814457e-17, 0.0, 0.0,
+          -5.5511151231257827e-17, 1.0],
+         [-0.087298334620741685, 0.68729833462074175, 0.0, 0.0,
+          -5.5511151231257827e-17, 0.39999999999999991]], dtype=object), 'FE1_f0_C0': array([[  2.77555756e-17,   8.87298335e-01,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  4.16333634e-17,   5.00000000e-01,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.55111512e-17,   1.12701665e-01,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]]), 'FE1_f0_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            2.77555756e-17,   8.87298335e-01,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            4.16333634e-17,   5.00000000e-01,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.55111512e-17,   1.12701665e-01,   8.87298335e-01]]), 'FE1_f0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_f2_C0': array([[ 0.88729833,  0.11270167,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.5       ,  0.5       ,  0.        ,  0.        ,  0.        ,
+           0.        ],
+         [ 0.11270167,  0.88729833,  0.        ,  0.        ,  0.        ,
+           0.        ]]), 'FE1_f0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_f1_C1': array([[  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            8.87298335e-01,   2.77555756e-17,   1.12701665e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            5.00000000e-01,   4.16333634e-17,   5.00000000e-01],
+         [  0.00000000e+00,   0.00000000e+00,   0.00000000e+00,
+            1.12701665e-01,   5.55111512e-17,   8.87298335e-01]]), 'FE1_f2_C1': array([[ 0.        ,  0.        ,  0.        ,  0.88729833,  0.11270167,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.5       ,  0.5       ,
+           0.        ],
+         [ 0.        ,  0.        ,  0.        ,  0.11270167,  0.88729833,
+           0.        ]]), 'FE1_f0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_f0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE1_f1_C0': array([[  8.87298335e-01,   2.77555756e-17,   1.12701665e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  5.00000000e-01,   4.16333634e-17,   5.00000000e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00],
+         [  1.12701665e-01,   5.55111512e-17,   8.87298335e-01,
+            0.00000000e+00,   0.00000000e+00,   0.00000000e+00]])}
+  
+  name_map: {'FE1_f0_C1_D10': ['FE1_f1_C1_D10', 'FE1_f2_C1_D10'], 'FE1_f0_C0_D01': ['FE1_f1_C0_D01', 'FE1_f2_C0_D01'], 'FE1_f0_C1_D01': ['FE1_f1_C1_D01', 'FE1_f2_C1_D01'], 'FE1_f0_C0_D10': ['FE1_f1_C0_D10', 'FE1_f2_C0_D10']}
+  
+  inv_name_map: {'FE0_f0': 'FE0_f0', 'FE1_f1_C0_D10': 'FE1_f0_C0_D10', 'FE0_f2': 'FE0_f2', 'FE1_f1_C0_D01': 'FE1_f0_C0_D01', 'FE1_f0_C0': 'FE1_f0_C0', 'FE1_f0_C1': 'FE1_f0_C1', 'FE1_f2_C1_D10': 'FE1_f0_C1_D10', 'FE1_f2_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1_D10': 'FE1_f0_C1_D10', 'FE1_f1_C0': 'FE1_f1_C0', 'FE1_f2_C0': 'FE1_f2_C0', 'FE1_f0_C1_D10': 'FE1_f0_C1_D10', 'FE1_f0_C1_D01': 'FE1_f0_C1_D01', 'FE1_f1_C1': 'FE1_f1_C1', 'FE1_f1_C1_D01': 'FE1_f0_C1_D01', 'FE1_f2_C1': 'FE1_f2_C1', 'FE1_f2_C0_D10': 'FE1_f0_C0_D10', 'FE1_f0_C0_D10': 'FE1_f0_C0_D10', 'FE1_f0_C0_D01': 'FE1_f0_C0_D01', 'FE1_f2_C0_D01': 'FE1_f0_C0_D01', 'FE0_f1': 'FE0_f1'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE0_f0': array([[0.68729833462074186, -0.087298334620741658, 0.39999999999999991],
+         [0, 0, 0.99999999999999978],
+         [-0.08729833462074163, 0.68729833462074186, 0.3999999999999998]], dtype=object), 'FE1_f0_C0': array([[ 0.88729833,  0.11270167],
+         [ 0.5       ,  0.5       ],
+         [ 0.11270167,  0.88729833]]), 'FE1_f0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_f0': ('FE0_f0', (0, [1, 2, 3]), False, False), 'FE1_f1_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE0_f2': ('FE0_f0', (2, [0, 1, 5]), False, False), 'FE1_f1_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f0_C0': ('FE1_f0_C0', (3, [1, 2]), False, False), 'FE1_f0_C1': ('FE1_f0_C0', (6, [4, 5]), False, False), 'FE1_f2_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f2_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f1_C0': ('FE1_f0_C0', (9, [0, 2]), False, False), 'FE1_f2_C0': ('FE1_f0_C0', (11, [0, 1]), False, False), 'FE1_f0_C1_D10': ('FE1_f0_C0_D01', (8, [3, 4]), False, False), 'FE1_f0_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f1_C1': ('FE1_f0_C0', (10, [3, 5]), False, False), 'FE1_f1_C1_D01': ('FE1_f0_C0_D01', (7, [3, 5]), False, False), 'FE1_f2_C1': ('FE1_f0_C0', (12, [3, 4]), False, False), 'FE1_f2_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f0_C0_D10': ('FE1_f0_C0_D01', (5, [0, 1]), False, False), 'FE1_f0_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE1_f2_C0_D01': ('FE1_f0_C0_D01', (4, [0, 2]), False, False), 'FE0_f1': ('FE0_f0', (1, [0, 2, 4]), False, False)}
+  Transforming exterior facet integral 0
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 1
+  Reusing element from cache
+  Reusing element from cache
+  Transforming exterior facet integral 2
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.357604 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  Optimising expressions for cell integral
+  Optimising expressions for facet integral 0
+  Optimising expressions for facet integral 1
+  Optimising expressions for facet integral 2
+  
+Compiler stage 3 finished in 0.00108409 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Removing unused variable: facet_area
+  Removing unused variable: n1
+  Removing unused variable: n0
+  Removing unused variable: direction
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.118894 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00059104 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./SpatialCoordinates.h.
+  
+Compiler stage 5 finished in 0.000897884 seconds.
+
+FFC finished in 0.501609 seconds.
diff --git a/demo/undocumented/spatial-coordinates/cpp/main.cpp b/demo/undocumented/spatial-coordinates/cpp/main.cpp
new file mode 100644
index 0000000..05f5f4e
--- /dev/null
+++ b/demo/undocumented/spatial-coordinates/cpp/main.cpp
@@ -0,0 +1,83 @@
+// Copyright (C) 2010 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-03-05
+// Last changed: 2012-11-12
+//
+// This demo program solves Poisson's equation
+//
+//     - div grad u(x, y) = f(x, y)
+//
+// on the unit square with source f given by
+//
+//     f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+//
+// and boundary conditions given by
+//
+//     u(x, y) = 0        for x = 0 or x = 1
+// du/dn(x, y) = -sin(5*x) for y = 0 or y = 1
+//
+// This demo is identical to the Poisson demo with the only difference that
+// the source and flux term is expressed using SpatialCoordinates in the
+// variational formulation.
+
+#include <dolfin.h>
+#include "SpatialCoordinates.h"
+
+using namespace dolfin;
+
+// Sub domain for Dirichlet boundary condition
+class DirichletBoundary : public SubDomain
+{
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS;
+  }
+};
+
+int main()
+{
+  // Create mesh and function space
+  UnitSquareMesh mesh(32, 32);
+  SpatialCoordinates::FunctionSpace V(mesh);
+
+  // Define boundary condition
+  Constant u0(0.0);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, u0, boundary);
+
+  // Define variational problem
+  SpatialCoordinates::BilinearForm a(V, V);
+  SpatialCoordinates::LinearForm L(V);
+  Function u(V);
+  LinearVariationalProblem problem(a, L, u, bc);
+
+  // Compute solution
+  LinearVariationalSolver solver(problem);
+  solver.parameters["linear_solver"] = "iterative";
+  solver.solve();
+
+  // Save solution in VTK format
+  File file("spatial-coordinates.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/spatial-coordinates/python/demo_spatial-coordinates.py b/demo/undocumented/spatial-coordinates/python/demo_spatial-coordinates.py
new file mode 100644
index 0000000..56a4fab
--- /dev/null
+++ b/demo/undocumented/spatial-coordinates/python/demo_spatial-coordinates.py
@@ -0,0 +1,79 @@
+"""This demo program solves Poisson's equation
+
+    - div grad u(x, y) = f(x, y)
+
+on the unit square with source f given by
+
+    f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02)
+
+and boundary conditions given by
+
+    u(x, y) = 0        for x = 0 or x = 1
+du/dn(x, y) = -sin(5*x) for y = 0 or y = 1
+
+This demo is identical to the Poisson demo with the only difference that
+the source and flux term is expressed using SpatialCoordinates in the
+variational formulation.
+"""
+
+# Copyright (C) 2010 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2010-03-05
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Form compiler options
+parameters["form_compiler"]["optimize"]     = True
+parameters["form_compiler"]["cpp_optimize"] = True
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(32, 32)
+V = FunctionSpace(mesh, "CG", 1)
+
+# Define Dirichlet boundary (x = 0 or x = 1)
+def boundary(x):
+    return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, boundary)
+
+# Define variational problem
+x = SpatialCoordinate(mesh)
+u = TrialFunction(V)
+v = TestFunction(V)
+d_x = x[0] - 0.5
+d_y = x[1] - 0.5
+f = 10.0*exp(-(d_x*d_x + d_y*d_y) / 0.02)
+g = -sin(5.0*x[0])
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Save solution in VTK format
+file = File("spatial-coordinates.pvd")
+file << u
+
+# Plot solution
+plot(u, interactive=True)
diff --git a/demo/undocumented/special-functions/python/demo_special_functions.py b/demo/undocumented/special-functions/python/demo_special_functions.py
new file mode 100644
index 0000000..dad8b61
--- /dev/null
+++ b/demo/undocumented/special-functions/python/demo_special_functions.py
@@ -0,0 +1,54 @@
+"""This demo program plots a bunch of nonlinear
+special functions that are available in UFL."""
+
+# Copyright (C) 2010 Martin S. Alnaes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-10-24
+# Last changed: 2011-10-24
+
+from dolfin import *
+
+# Form compiler options
+parameters["form_compiler"]["optimize"]     = True
+parameters["form_compiler"]["cpp_optimize"] = True
+
+# Create meshes
+n = 100
+eps = 1e-8
+mesh = Interval(n, -2.0, +2.0)
+mesh2 = Interval(n, 0.0+eps, 1.0-eps)
+x = SpatialCoordinate(interval)[0]
+
+k = 0
+def plotstrings(strings, mesh):
+    global k
+    for string in strings:
+        figure(k)
+        k += 1
+        expr = eval(string)
+        plot(expr, title=string, mesh=mesh)
+
+plotstrings(('cos(x)', 'sin(x)', 'tan(x)'), mesh)
+plotstrings(('acos(x)', 'asin(x)', 'atan(x)'), mesh2)
+plotstrings(('exp(x)', 'ln(x)', 'sqrt(x)', 'erf(x)'), mesh2)
+
+for nu in (0, 1):
+    plotstrings(['bessel_%s(%d, x)' % (c, nu) for c in ('J', 'Y', 'I', 'K')], mesh2)
+
+print "Note that you must press 'q' in the first plot window ('cos(x)') to quit."
+interactive()
diff --git a/demo/undocumented/sub-function-assignment/cpp/README b/demo/undocumented/sub-function-assignment/cpp/README
new file mode 100644
index 0000000..3a17715
--- /dev/null
+++ b/demo/undocumented/sub-function-assignment/cpp/README
@@ -0,0 +1,2 @@
+There is as yet no C++ version of this demo.
+Please consider contributing the missing code.
diff --git a/demo/undocumented/sub-function-assignment/python/demo_sub-function-assignment.py b/demo/undocumented/sub-function-assignment/python/demo_sub-function-assignment.py
new file mode 100644
index 0000000..4819c1d
--- /dev/null
+++ b/demo/undocumented/sub-function-assignment/python/demo_sub-function-assignment.py
@@ -0,0 +1,72 @@
+"""This script demonstrate how to use sub function assignment."""
+
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-11-08
+# Last changed: 2013-11-08
+
+from dolfin import *
+
+import time
+
+# Create mesh and define function spaces
+mesh = UnitSquareMesh(256, 256)
+V = FunctionSpace(mesh, "CG", 1)
+VV = VectorFunctionSpace(mesh, "CG", 1)
+
+# Define function
+v0 = Expression("sin(2*pi*x[0])*sin(2*pi*x[1])")
+v1 = Expression("cos(2*pi*x[0])*cos(2*pi*x[1])")
+
+vv1 = Function(VV)
+vv2 = Function(VV)
+vv3 = Function(VV)
+
+u0 = Function(V)
+u1 = Function(V)
+
+u0.interpolate(v0)
+u1.interpolate(v1)
+
+# Compute projection (L2-projection)
+t0 = time.time()
+vv0 = project(as_vector((u0, u1)), V=VV)
+tp = time.time() - t0
+
+# Compute interpolation (evaluating dofs)
+t0 = time.time()
+vv1.interpolate(Expression(("v0", "v1"), v0=v0, v1=v1))
+ti = time.time() - t0
+
+# Assign mixed function from two scalar functions
+t0 = time.time()
+assign(vv2, [u0, u1])
+ta0 = time.time() - t0
+
+# Assign mixed function from two scalar functions using FunctionAssigner
+assigner = FunctionAssigner(VV, [V, V])
+t0 = time.time()
+assigner.assign(vv3, [u0, u1])
+ta1 = time.time() - t0
+
+# Plot functions
+plot(vv0, title="Projection; time=%.3fs" % tp)
+plot(vv1, title="Interpolation; time=%.3fs" % ti)
+plot(vv2, title="Assignment; time=%.3fs" % ta0)
+plot(vv3, title="Assignment (cached); time=%.3fs" % ta1)
+interactive()
diff --git a/demo/undocumented/submesh/cpp/CMakeLists.txt b/demo/undocumented/submesh/cpp/CMakeLists.txt
new file mode 100644
index 0000000..31a94c2
--- /dev/null
+++ b/demo/undocumented/submesh/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_submesh)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/submesh/cpp/main.cpp b/demo/undocumented/submesh/cpp/main.cpp
new file mode 100644
index 0000000..cdc2081
--- /dev/null
+++ b/demo/undocumented/submesh/cpp/main.cpp
@@ -0,0 +1,73 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-02-11
+// Last changed: 2012-07-05
+//
+// This demo program demonstrates how to extract matching sub meshes
+// from a common mesh.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  // Structure sub domain
+  class Structure : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] > 1.4 - DOLFIN_EPS and x[0] < 1.6 + DOLFIN_EPS and x[1] < 0.6 + DOLFIN_EPS;
+    }
+  };
+
+  // Create mesh
+  RectangleMesh mesh(0.0, 0.0, 3.0, 1.0, 60, 20);
+
+  // Create sub domain markers and mark everything as 0
+  MeshFunction<std::size_t> sub_domains(mesh, mesh.topology().dim());
+  sub_domains = 0;
+
+  // Mark structure domain as 1
+  Structure structure;
+  structure.mark(sub_domains, 1);
+
+  // Extract sub meshes
+  SubMesh fluid_mesh(mesh, sub_domains, 0);
+  SubMesh structure_mesh(mesh, sub_domains, 1);
+
+  // Move structure mesh
+  MeshGeometry& geometry = structure_mesh.geometry();
+  for (VertexIterator v(structure_mesh); !v.end(); ++v)
+  {
+    const double* x = v->x();
+    geometry.x(v->index())[0] += 0.1*x[0]*x[1];
+  }
+
+  // Move fluid mesh according to structure mesh
+  fluid_mesh.move(structure_mesh);
+  fluid_mesh.smooth();
+
+  // Plot meshes
+  plot(fluid_mesh);
+  plot(structure_mesh);
+
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/submesh/python/demo_submesh.py b/demo/undocumented/submesh/python/demo_submesh.py
new file mode 100644
index 0000000..1f11c06
--- /dev/null
+++ b/demo/undocumented/submesh/python/demo_submesh.py
@@ -0,0 +1,62 @@
+"""This demo program demonstrates how to extract matching sub meshes
+from a common mesh."""
+
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-02-11
+# Last changed: 2009-03-02
+
+from dolfin import *
+
+# Structure sub domain
+class Structure(SubDomain):
+    def inside(self, x, on_boundary):
+        return x[0] > 1.4 - DOLFIN_EPS and x[0] < 1.6 \
+            + DOLFIN_EPS and x[1] < 0.6 + DOLFIN_EPS
+
+# Create mesh
+mesh = RectangleMesh(0.0, 0.0, 3.0, 1.0, 60, 20)
+
+# Create sub domain markers and mark everaything as 0
+sub_domains = MeshFunction("size_t", mesh, mesh.topology().dim())
+sub_domains.set_all(0)
+
+# Mark structure domain as 1
+structure = Structure()
+structure.mark(sub_domains, 1)
+
+# Extract sub meshes
+fluid_mesh = SubMesh(mesh, sub_domains, 0)
+structure_mesh = SubMesh(mesh, sub_domains, 1)
+
+# Move structure mesh
+for x in structure_mesh.coordinates():
+    x[0] += 0.1*x[0]*x[1]
+
+# Move fluid mesh according to structure mesh
+fluid_mesh.move(structure_mesh)
+fluid_mesh.smooth()
+
+# Plot meshes
+plot(fluid_mesh, title="Fluid")
+plot(structure_mesh, title="Structure")
+interactive()
+
+# Build mapping from structure to fluid mesh
+structure_to_fluid = compute_vertex_map(structure_mesh, fluid_mesh)
+print structure_to_fluid
diff --git a/demo/undocumented/sym-dirichlet-bc/cpp/CMakeLists.txt b/demo/undocumented/sym-dirichlet-bc/cpp/CMakeLists.txt
new file mode 100644
index 0000000..5cff2ec
--- /dev/null
+++ b/demo/undocumented/sym-dirichlet-bc/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_sym-dirichlet-bc)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/sym-dirichlet-bc/cpp/Poisson.h b/demo/undocumented/sym-dirichlet-bc/cpp/Poisson.h
new file mode 100644
index 0000000..7c28263
--- /dev/null
+++ b/demo/undocumented/sym-dirichlet-bc/cpp/Poisson.h
@@ -0,0 +1,2403 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON_H
+#define __POISSON_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true, false});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the
+/// exterior facet tensor corresponding to the local contribution to
+/// a form from the integral over an exterior facet.
+
+class poisson_exterior_facet_integral_1_otherwise: public ufc::exterior_facet_integral
+{
+public:
+
+  /// Constructor
+  poisson_exterior_facet_integral_1_otherwise() : ufc::exterior_facet_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_exterior_facet_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({false, true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local exterior facet
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               std::size_t facet,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      10
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 9
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Get vertices on edge
+    static unsigned int edge_vertices[3][2] = {{1, 2}, {0, 2}, {0, 1}};
+    const unsigned int v0 = edge_vertices[facet][0];
+    const unsigned int v1 = edge_vertices[facet][1];
+    
+    // Compute scale factor (length of edge scaled by length of reference interval)
+    const double dx0 = vertex_coordinates[2*v1 + 0] - vertex_coordinates[2*v0 + 0];
+    const double dx1 = vertex_coordinates[2*v1 + 1] - vertex_coordinates[2*v0 + 1];
+    const double det = std::sqrt(dx0*dx0 + dx1*dx1);
+    
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[1][0]*(1.0);
+    const double G0_1 = det*w[1][1]*(1.0);
+    const double G0_2 = det*w[1][2]*(1.0);
+    
+    // Compute element tensor
+    switch (facet)
+    {
+    case 0:
+      {
+        A[0] = 0.0;
+      A[1] = 0.333333333333333*G0_1 + 0.166666666666667*G0_2;
+      A[2] = 0.166666666666667*G0_1 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 1:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_2;
+      A[1] = 0.0;
+      A[2] = 0.166666666666667*G0_0 + 0.333333333333333*G0_2;
+        break;
+      }
+    case 2:
+      {
+        A[0] = 0.333333333333333*G0_0 + 0.166666666666667*G0_1;
+      A[1] = 0.166666666666667*G0_0 + 0.333333333333333*G0_1;
+      A[2] = 0.0;
+        break;
+      }
+    }
+    
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "5ee927682358c6c0426041ab22b70a08e5ed403f78f13005173589a5c00c41be670a70ca85fa21afd8fb8bcee737b704b4ee42ec7f4dfef9f5aa6cd90a5c4283";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 2;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    case 2:
+      {
+        return new poisson_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return new poisson_exterior_facet_integral_1_otherwise();
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class CoefficientSpace_g: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_g(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_g(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_g(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_g()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+typedef CoefficientSpace_g Form_L_FunctionSpace_2;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f, const dolfin::GenericFunction& g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+    this->g = g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f, std::shared_ptr<const dolfin::GenericFunction> g):
+    dolfin::Form(1, 2), f(*this, 0), g(*this, 1)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+    this->g = *g;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+    else if (name == "g")
+      return 1;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    case 1:
+      return "g";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+  typedef Form_L_FunctionSpace_2 CoefficientSpace_g;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+  dolfin::CoefficientAssigner g;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/sym-dirichlet-bc/cpp/Poisson.ufl b/demo/undocumented/sym-dirichlet-bc/cpp/Poisson.ufl
new file mode 100644
index 0000000..e952455
--- /dev/null
+++ b/demo/undocumented/sym-dirichlet-bc/cpp/Poisson.ufl
@@ -0,0 +1,34 @@
+# Copyright (C) 2005-2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005
+# Last changed: 2011-03-09
+#
+# The bilinear form a(u, v) and linear form L(v) for
+# Poisson's equation.
+#
+# Compile this form with FFC: ffc -l dolfin Poisson.ufl
+
+element = FiniteElement("Lagrange", triangle, 1)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+f = Coefficient(element)
+g = Coefficient(element)
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
diff --git a/demo/undocumented/sym-dirichlet-bc/cpp/compile.log b/demo/undocumented/sym-dirichlet-bc/cpp/compile.log
new file mode 100644
index 0000000..47036a0
--- /dev/null
+++ b/demo/undocumented/sym-dirichlet-bc/cpp/compile.log
@@ -0,0 +1,213 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 2
+  Coefficients:           '[w_0, w_1]'
+  Coefficient names:      '[f, g]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0208681 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000743 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000632 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000977 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000807 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000816 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0128219 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000298977 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0435271 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000696898 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson.h.
+  
+Compiler stage 5 finished in 0.000724077 seconds.
+
+FFC finished in 0.0792851 seconds.
diff --git a/demo/undocumented/sym-dirichlet-bc/cpp/main.cpp b/demo/undocumented/sym-dirichlet-bc/cpp/main.cpp
new file mode 100644
index 0000000..654eab5
--- /dev/null
+++ b/demo/undocumented/sym-dirichlet-bc/cpp/main.cpp
@@ -0,0 +1,142 @@
+// Copyright (C) 2006-2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2008.
+//
+// First added:  2006-02-07
+// Last changed: 2012-11-12
+//
+// This demo program solves Poisson's equation,
+//
+//     - div grad u(x, y) = f(x, y)
+//
+// on the unit square with source f given by
+//
+//     f(x, y) = 500*exp(-((x - 0.5)^2 + (y - 0.5)^2)/0.02)
+//
+// and boundary conditions given by
+//
+//     u(x, y)     = 0               for x = 0,
+//     du/dn(x, y) = 25 cos(5 pi y)  for x = 1,
+//     du/dn(x, y) = 0               otherwise.
+
+#include <dolfin.h>
+#include "Poisson.h"
+
+using namespace dolfin;
+
+int main()
+{
+  // Source term
+  class Source : public Expression
+  {
+  public:
+
+    Source() : Expression() {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      double dx = x[0] - 0.5;
+      double dy = x[1] - 0.5;
+      values[0] = 500.0*exp(-(dx*dx + dy*dy)/0.02);
+    }
+
+  };
+
+  // Neumann boundary condition
+  class Flux : public Expression
+  {
+  public:
+
+    Flux() : Expression() {}
+
+    void eval(Array<double>& values, const Array<double>& x) const
+    {
+      if (x[0] > (1.0 - DOLFIN_EPS))
+        values[0] = 25.0*cos(5.0*DOLFIN_PI*x[1]);
+      else
+        values[0] = 0.0;
+    }
+
+  };
+
+  // Sub domain for Dirichlet boundary condition
+  class DirichletBoundary : public SubDomain
+  {
+    bool inside(const Array<double>& x, bool on_boundary) const
+    {
+      return x[0] < DOLFIN_EPS;
+    }
+  };
+
+  // Create mesh
+  UnitSquareMesh mesh(300, 300);
+
+  // Create functions
+  Source f;
+  Flux g;
+
+  // Define forms and attach functions
+  Poisson::FunctionSpace V(mesh);
+  Poisson::BilinearForm a(V, V);
+  Poisson::LinearForm L(V);
+  L.f = f; L.g = g;
+
+  // Create boundary condition
+  Constant u0(0.0);
+  DirichletBoundary boundary;
+  DirichletBC bc(V, u0, boundary);
+
+  // Create function
+  Function u(V);
+
+  // Create table
+  Table table("Assembly and application of bcs");
+
+  // Matrix and vector to assemble
+  Matrix A;
+  Vector b;
+
+  // Assemble A and b separately
+  tic();
+  assemble(A, a);
+  assemble(b, L);
+  bc.apply(A, b);
+  table("Standard", "Assembly time") = toc();
+
+  // Assemble A and b together
+  tic();
+  assemble_system(A, b, a, L, bc);
+  table("Symmetric", "Assembly time") = toc();
+
+  // Display summary
+  info(table);
+
+  // Solve system
+  LUSolver solver;
+  solver.solve(A, *u.vector(), b);
+
+  // Save solution in VTK format
+  File file("poisson.pvd");
+  file << u;
+
+  // Plot solution
+  plot(u);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/sym-dirichlet-bc/python/demo_sym-dirichlet-bc.py b/demo/undocumented/sym-dirichlet-bc/python/demo_sym-dirichlet-bc.py
new file mode 100644
index 0000000..c7f259e
--- /dev/null
+++ b/demo/undocumented/sym-dirichlet-bc/python/demo_sym-dirichlet-bc.py
@@ -0,0 +1,75 @@
+"""This demo demonstrate how to assemble a linear system including
+boundary conditions."""
+
+# Copyright (C) 2008 Kent-Andre Mardal
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Kristian Oelgaard 2008
+# Modified by Anders Logg 2011
+#
+# First added:  2008-08-13
+# Last changed: 2012-11-12
+
+from dolfin import *
+
+# Create mesh and finite element
+mesh = UnitSquareMesh(32, 32)
+V = FunctionSpace(mesh, "CG", 1)
+
+# Source term
+class Source(Expression):
+    def eval(self, values, x):
+        dx = x[0] - 0.5
+        dy = x[1] - 0.5
+        values[0] = 500.0*exp(-(dx*dx + dy*dy)/0.02)
+
+# Neumann boundary condition
+class Flux(Expression):
+    def eval(self, values, x):
+        if x[0] > DOLFIN_EPS:
+            values[0] = 25.0*sin(5.0*DOLFIN_PI*x[1])
+        else:
+            values[0] = 0.0
+
+# Sub domain for Dirichlet boundary condition
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary and x[0] < DOLFIN_EPS
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Source()
+g = Flux()
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx + g*v*ds
+
+# Define boundary condition
+u0 = Constant(0.0)
+bc = DirichletBC(V, u0, DirichletBoundary())
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Save solution to file
+file = File("poisson.pvd")
+file << u
+
+# Plot solution
+plot(u)
+interactive()
diff --git a/demo/undocumented/time-series/cpp/CMakeLists.txt b/demo/undocumented/time-series/cpp/CMakeLists.txt
new file mode 100644
index 0000000..f718527
--- /dev/null
+++ b/demo/undocumented/time-series/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_time-series)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/time-series/cpp/main.cpp b/demo/undocumented/time-series/cpp/main.cpp
new file mode 100644
index 0000000..3b87475
--- /dev/null
+++ b/demo/undocumented/time-series/cpp/main.cpp
@@ -0,0 +1,71 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-11-11
+// Last changed: 2012-11-12
+//
+// This program demonstrates the use of the TimeSeries
+// class for storing a series of meshes and vectors.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+int main()
+{
+  // Create empty time series
+  TimeSeries series("primal");
+
+  // Create a mesh and a vector
+  UnitSquareMesh unit_square(2, 2);
+  Mesh mesh(unit_square);
+  //Vector x;
+
+  // Add a bunch of meshes and vectors to the series
+  double t = 0.0;
+  while (t < 1.0)
+  {
+    // Refine mesh and resize vector
+    mesh = refine(mesh);
+    Vector x(mesh.mpi_comm(), mesh.num_vertices());
+
+    // Set some vector values
+    std::vector<double> values(x.local_size());
+    const std::size_t offset = x.local_range().first;
+    for (std::size_t i = 0; i < x.local_size(); i++)
+      values[i] = (t + 1.0)*static_cast<double>(offset + i);
+    x.set_local(values);
+    x.apply("insert");
+
+    // Append to series
+    series.store(mesh, t);
+    series.store(x, t);
+
+    t += 0.2;
+  }
+
+  // Retrieve mesh and vector at some point in time
+  series.retrieve(mesh, 0.29);
+  Vector x;
+  series.retrieve(x, 0.31, false);
+
+  // Plot mesh
+  plot(mesh);
+  interactive();
+
+  return 0;
+}
diff --git a/demo/undocumented/time-series/python/demo_time-series.py b/demo/undocumented/time-series/python/demo_time-series.py
new file mode 100644
index 0000000..ad82b10
--- /dev/null
+++ b/demo/undocumented/time-series/python/demo_time-series.py
@@ -0,0 +1,54 @@
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-11-11
+# Last changed: 2012-11-12
+
+from dolfin import *
+from numpy import ones
+
+# Create empty time series
+series = TimeSeries("primal")
+
+# Create a mesh and a vector
+mesh = UnitSquareMesh(2, 2)
+x = Vector()
+
+# Add a bunch of meshes and vectors to the series
+t = 0.0
+while t < 1.0:
+
+    # Refine mesh
+    mesh = refine(mesh);
+
+    # Set some vector values
+    x = Vector(mesh.mpi_comm(), mesh.num_vertices());
+    x[:] = ones(x.size())
+
+    # Append to series
+    series.store(mesh, t)
+    series.store(x, t)
+
+    t += 0.2
+
+# Retrieve mesh and vector at some point in time
+series.retrieve(mesh, 0.29)
+x = Vector()
+series.retrieve(x, 0.31, False)
+
+# Plot mesh
+plot(mesh, interactive=True)
diff --git a/demo/undocumented/triangulate/cpp/CMakeLists.txt b/demo/undocumented/triangulate/cpp/CMakeLists.txt
new file mode 100644
index 0000000..ad26090
--- /dev/null
+++ b/demo/undocumented/triangulate/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_triangulate)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/triangulate/cpp/main.cpp b/demo/undocumented/triangulate/cpp/main.cpp
new file mode 100644
index 0000000..3a8f2f2
--- /dev/null
+++ b/demo/undocumented/triangulate/cpp/main.cpp
@@ -0,0 +1,60 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-02
+// Last changed: 2012-07-05
+//
+// This demo creates meshes from the triangulation of a collection of
+// random point.
+
+#include <dolfin.h>
+
+using namespace dolfin;
+
+#ifdef HAS_CGAL
+
+int main()
+{
+  // Generate collection of random points
+  const unsigned int num_points = 2000;
+  std::vector<Point> random_points;
+  for (unsigned int i = 0; i < num_points; ++i)
+    random_points.push_back(Point(dolfin::rand(), dolfin::rand(), dolfin::rand()));
+
+  // Create empty Mesh
+  Mesh mesh;
+
+  // Triangulate points in 2D and plot mesh
+  Triangulate::triangulate(mesh, random_points, 2);
+  plot(mesh);
+
+  // Triangulate points in 3D and plot mesh
+  Triangulate::triangulate(mesh, random_points, 3);
+  plot(mesh);
+
+  // Make plot windows interactive
+  interactive();
+}
+
+#else
+
+int main()
+{
+  info("DOLFIN must be compiled with CGAL to run this demo.");
+}
+
+#endif
diff --git a/demo/undocumented/triangulate/python/demo_triangulate.py b/demo/undocumented/triangulate/python/demo_triangulate.py
new file mode 100644
index 0000000..136d4e1
--- /dev/null
+++ b/demo/undocumented/triangulate/python/demo_triangulate.py
@@ -0,0 +1,43 @@
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-02-02
+# Last changed:
+#
+# This demo creates meshes from the triangulation of a collection of
+# random point.
+
+from dolfin import *
+
+if not has_cgal():
+    print "DOLFIN must be compiled with CGAL to run this demo."
+    exit(0)
+
+# Create list of random points
+num_points = 2000
+random_points = [Point(dolfin.rand(), dolfin.rand(), dolfin.rand()) for p in range(num_points)]
+
+# Create empty Mesh
+mesh = Mesh()
+
+# Triangulate points in 2D and plot mesh
+Triangulate.triangulate(mesh, random_points, 2)
+plot(mesh, interactive=True)
+
+# Triangulate points in 3D and plot mesh
+Triangulate.triangulate(mesh, random_points, 3)
+plot(mesh, interactive=True)
diff --git a/demo/undocumented/trilinos/python/demo_trilinos.py b/demo/undocumented/trilinos/python/demo_trilinos.py
new file mode 100644
index 0000000..0309115
--- /dev/null
+++ b/demo/undocumented/trilinos/python/demo_trilinos.py
@@ -0,0 +1,102 @@
+""" This demo implements a Poisson equations solver
+based on the demo "dolfin/demo/pde/poisson/python/demo.py"
+in Dolfin using Epetra matrices, the AztecOO CG solver and ML
+AMG preconditioner
+"""
+
+# Copyright (C) 2008 Kent-Andre Mardal
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-04-24
+# Last changed: 2008-04-24
+
+from dolfin import *
+
+# Test for Trilinos:
+try:
+    from PyTrilinos import Epetra, AztecOO, TriUtils, ML
+except:
+    print "You Need to have PyTrilinos with Epetra, AztecOO, TriUtils and ML installed for this demo to run",
+    print "Exiting."
+    exit()
+
+if not has_linear_algebra_backend("Epetra"):
+    print "*** Warning: Dolfin is not compiled with Trilinos linear algebra backend"
+    print "Exiting."
+    exit()
+
+parameters["linear_algebra_backend"] = "Epetra"
+
+# Create mesh and finite element
+mesh = UnitSquareMesh(20, 20)
+V = FunctionSpace(mesh, "CG", 1)
+
+# Sub domain for Dirichlet boundary condition
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary and x[0] < DOLFIN_EPS
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Expression("500.0 * exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+
+a = dot(grad(u), grad(v))*dx
+L = f*v*dx
+
+# Define boundary condition
+u0 = Constant(0)
+bc = DirichletBC(V, u0, DirichletBoundary())
+
+# Create linear system
+A, b = assemble_system(a, L, bc)
+
+# Solution
+U = Function(V)
+
+# Fetch underlying epetra objects
+A_epetra = as_backend_type(A).mat()
+b_epetra = as_backend_type(b).vec()
+x_epetra = as_backend_type(U.vector()).vec()
+
+# Sets up the parameters for ML using a python dictionary
+MLList = {"max levels"        : 3,
+          "output"            : 10,
+          "smoother: type"    : "ML symmetric Gauss-Seidel",
+          "aggregation: type" : "Uncoupled",
+          "ML validate parameter list" : False
+}
+
+# Create the preconditioner
+Prec = ML.MultiLevelPreconditioner(A_epetra, False)
+Prec.SetParameterList(MLList)
+Prec.ComputePreconditioner()
+
+# Create solver and solve system
+Solver = AztecOO.AztecOO(A_epetra, x_epetra, b_epetra)
+Solver.SetPrecOperator(Prec)
+Solver.SetAztecOption(AztecOO.AZ_solver, AztecOO.AZ_cg)
+Solver.SetAztecOption(AztecOO.AZ_output, 16)
+Solver.Iterate(1550, 1e-5)
+
+# Plot the solution
+plot(U)
+interactive()
+
+# Save solution to file
+file = File("poisson.pvd")
+file << U
diff --git a/demo/undocumented/waveguide/cpp/CMakeLists.txt b/demo/undocumented/waveguide/cpp/CMakeLists.txt
new file mode 100644
index 0000000..c7cc9ba
--- /dev/null
+++ b/demo/undocumented/waveguide/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME demo_waveguide)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(${PROJECT_NAME} main.cpp)
+
+# Target libraries
+target_link_libraries(${PROJECT_NAME} ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/demo/undocumented/waveguide/cpp/Forms.h b/demo/undocumented/waveguide/cpp/Forms.h
new file mode 100644
index 0000000..524a115
--- /dev/null
+++ b/demo/undocumented/waveguide/cpp/Forms.h
@@ -0,0 +1,6166 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __FORMS_H
+#define __FORMS_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class forms_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  forms_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~forms_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Nedelec 1st kind H(curl)', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return 2;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    values[0] = 0.0;
+    values[1] = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, -0.169533172561123, 0.0841793787126839, -0.116642368703961, 0.0, -0.146820034222104, 0.0729014804399753, -0.101015254455221};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.321678327423669, -0.134687005940295, 0.097201973919967, 0.260579710864614, -0.12987926104263, 0.0976879837895672, -0.0631345340345132};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.0782460796435955, -0.168358757425368, 0.349927106111882, 0.0, 0.067763092717894, -0.145802960879951, 0.303045763365662};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, -0.165186168136479, 0.235702260395516, -0.272165526975909, -0.120267558860591, 0.146820034222104, -0.224536559755125, 0.176776695296637};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, -0.0391230398217979, -0.0841793787126841, -0.349927106111882, 0.0, -0.0338815463589472, -0.0729014804399754, -0.303045763365663};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.0608580619450188, 0.0, 0.213844342623929, 0.0601337794302958, 0.0395284707521045, 0.112268279877563, -0.138895974875929};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.169533172561123, 0.0841793787126843, 0.116642368703961, 0.0, 0.146820034222104, 0.0729014804399757, 0.101015254455221};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.491211499984792, 0.218866384652979, 0.213844342623928, -0.260579710864614, 0.0169407731794736, -0.0247865033495918, 0.037880720420708};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, -0.0782460796435955, -0.168358757425368, -0.349927106111882, 0.0, -0.0677630927178941, -0.145802960879951, -0.303045763365663};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, -0.243432247780074, -0.404061017820885, -0.622092633087791, 0.120267558860591, 0.0790569415042094, 0.078733598875174, -0.126269068069027};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.0391230398217977, -0.0841793787126841, 0.349927106111882, 0.0, 0.033881546358947, -0.0729014804399754, 0.303045763365663};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.0999811017668155, -0.0841793787126837, 0.563771448735811, -0.0601337794302959, 0.0734100171110521, -0.185169760317538, 0.164149788489734};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.382536389368687, 0.303045763365664, 0.311046316543896, 0.0, -0.0903507902905254, -0.145802960879951, -0.202030508910442};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.169533172561123, 0.084179378712684, 0.116642368703961, 0.160356745147454, 0.0677630927178938, 0.0320766513935896, -0.0757614408414162};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, -0.765072778737375, 0.0, -0.155523158271948, 0.0, 0.18070158058105, 0.0, 0.101015254455221};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, -0.382536389368687, 0.0673435029701476, -0.0777615791359739, -0.320713490294909, 0.0903507902905255, -0.0641533027871787, 0.0505076272276108};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.382536389368687, -0.303045763365664, 0.311046316543896, 0.0, -0.0903507902905251, 0.145802960879951, -0.202030508910442};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.213003216807565, -0.21886638465298, 0.194403947839935, 0.160356745147455, -0.15811388300842, 0.177879612273541, -0.126269068069027};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {3.99999999999986, 0.0, 0.0, -0.368855556781646, -0.47619047619046, -1.64957219768459, 0.0, -0.319438282499959, -0.412393049421147, 0.571428571428549};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.614759261302742, 0.476190476190459, -0.549857399228196, 0.56694670951382, 0.15971914124998, -0.453632354363262, 0.357142857142845};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 3.99999999999986, 0.0, -0.677630927178916, 1.80795671491133, 0.0, 0.0, -0.586845597326945, -1.26269068069022, 0.0};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 1.05409255338942, 1.16642368703957, -0.336717514850725, 1.04154761224408, 0.684653196881435, -0.5808377131175, 0.218704441319918};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 3.99999999999986, 0.13041013273932, -0.841793787126812, 0.933138949631658, 0.0, 0.112938487863152, -0.729014804399729, -2.02030508910435};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, -0.34776035397152, 0.336717514850724, 1.3608276348795, -0.20044593143431, 0.621161683247339, 0.597792139607782, -0.883883476483157};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.0, 0.952380952380918, 0.0, 0.0, 0.0, 0.824786098842293, 0.0};
+      
+      static const double coefficients1[10] = \
+      {3.99999999999986, 0.0, 0.0, -1.59837407938713, 0.476190476190458, -0.549857399228198, 0.0, -0.63887656499992, 0.412393049421147, -0.142857142857137};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 1.35526185435783, 0.0, 0.0, 0.0, 1.17369119465389, 0.0, 0.0};
+      
+      static const double coefficients1[10] = \
+      {0.0, 3.99999999999986, 0.0, 0.677630927178915, -0.524890659167804, 0.0, -2.08309522448817, 0.586845597326945, -0.101015254455218, 0.0};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.0, 1.68358757425362, 0.0, 0.0, 0.0, 1.45802960879946, 0.0};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 3.99999999999986, 0.825930840682366, 0.841793787126812, -1.78851632012734, 0.0, -1.12938487863153, 0.729014804399729, -0.252538136138043};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        values[0] += coefficients0[r]*basisvalues[r];
+        values[1] += coefficients1[r]*basisvalues[r];
+      } // end loop over 'r'
+      
+      // Using covariant Piola transform to map values back to the physical element
+      const double tmp_ref0 = values[0];
+      const double tmp_ref1 = values[1];
+      values[0] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+      values[1] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values[2] = {0.0, 0.0};
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis(r, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2; s++)
+      {
+        values[r*2 + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < 2*num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[8][3];
+    for (unsigned int row = 0; row < 8; row++)
+    {
+      for (unsigned int col = 0; col < 3; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[8][8];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, -0.169533172561123, 0.0841793787126839, -0.116642368703961, 0.0, -0.146820034222104, 0.0729014804399753, -0.101015254455221};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.321678327423669, -0.134687005940295, 0.097201973919967, 0.260579710864614, -0.12987926104263, 0.0976879837895672, -0.0631345340345132};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.0782460796435955, -0.168358757425368, 0.349927106111882, 0.0, 0.067763092717894, -0.145802960879951, 0.303045763365662};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, -0.165186168136479, 0.235702260395516, -0.272165526975909, -0.120267558860591, 0.146820034222104, -0.224536559755125, 0.176776695296637};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, -0.0391230398217979, -0.0841793787126841, -0.349927106111882, 0.0, -0.0338815463589472, -0.0729014804399754, -0.303045763365663};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.0608580619450188, 0.0, 0.213844342623929, 0.0601337794302958, 0.0395284707521045, 0.112268279877563, -0.138895974875929};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.169533172561123, 0.0841793787126843, 0.116642368703961, 0.0, 0.146820034222104, 0.0729014804399757, 0.101015254455221};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.491211499984792, 0.218866384652979, 0.213844342623928, -0.260579710864614, 0.0169407731794736, -0.0247865033495918, 0.037880720420708};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, -0.0782460796435955, -0.168358757425368, -0.349927106111882, 0.0, -0.0677630927178941, -0.145802960879951, -0.303045763365663};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, -0.243432247780074, -0.404061017820885, -0.622092633087791, 0.120267558860591, 0.0790569415042094, 0.078733598875174, -0.126269068069027};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.0391230398217977, -0.0841793787126841, 0.349927106111882, 0.0, 0.033881546358947, -0.0729014804399754, 0.303045763365663};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.0999811017668155, -0.0841793787126837, 0.563771448735811, -0.0601337794302959, 0.0734100171110521, -0.185169760317538, 0.164149788489734};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.382536389368687, 0.303045763365664, 0.311046316543896, 0.0, -0.0903507902905254, -0.145802960879951, -0.202030508910442};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.169533172561123, 0.084179378712684, 0.116642368703961, 0.160356745147454, 0.0677630927178938, 0.0320766513935896, -0.0757614408414162};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, -0.765072778737375, 0.0, -0.155523158271948, 0.0, 0.18070158058105, 0.0, 0.101015254455221};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, -0.382536389368687, 0.0673435029701476, -0.0777615791359739, -0.320713490294909, 0.0903507902905255, -0.0641533027871787, 0.0505076272276108};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.382536389368687, -0.303045763365664, 0.311046316543896, 0.0, -0.0903507902905251, 0.145802960879951, -0.202030508910442};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.213003216807565, -0.21886638465298, 0.194403947839935, 0.160356745147455, -0.15811388300842, 0.177879612273541, -0.126269068069027};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {3.99999999999986, 0.0, 0.0, -0.368855556781646, -0.47619047619046, -1.64957219768459, 0.0, -0.319438282499959, -0.412393049421147, 0.571428571428549};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 0.614759261302742, 0.476190476190459, -0.549857399228196, 0.56694670951382, 0.15971914124998, -0.453632354363262, 0.357142857142845};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 10:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 3.99999999999986, 0.0, -0.677630927178916, 1.80795671491133, 0.0, 0.0, -0.586845597326945, -1.26269068069022, 0.0};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, 1.05409255338942, 1.16642368703957, -0.336717514850725, 1.04154761224408, 0.684653196881435, -0.5808377131175, 0.218704441319918};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 11:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 3.99999999999986, 0.13041013273932, -0.841793787126812, 0.933138949631658, 0.0, 0.112938487863152, -0.729014804399729, -2.02030508910435};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 0.0, -0.34776035397152, 0.336717514850724, 1.3608276348795, -0.20044593143431, 0.621161683247339, 0.597792139607782, -0.883883476483157};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 12:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.0, 0.952380952380918, 0.0, 0.0, 0.0, 0.824786098842293, 0.0};
+      
+      static const double coefficients1[10] = \
+      {3.99999999999986, 0.0, 0.0, -1.59837407938713, 0.476190476190458, -0.549857399228198, 0.0, -0.63887656499992, 0.412393049421147, -0.142857142857137};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 13:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 1.35526185435783, 0.0, 0.0, 0.0, 1.17369119465389, 0.0, 0.0};
+      
+      static const double coefficients1[10] = \
+      {0.0, 3.99999999999986, 0.0, 0.677630927178915, -0.524890659167804, 0.0, -2.08309522448817, 0.586845597326945, -0.101015254455218, 0.0};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 14:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      double tmp1 = (1.0 - Y)/2.0;
+      double tmp2 = tmp1*tmp1;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[3] = basisvalues[1]*1.5*tmp0 - basisvalues[0]*0.5*tmp2;
+      basisvalues[6] = basisvalues[3]*1.66666666666667*tmp0 - basisvalues[1]*0.666666666666667*tmp2;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[4] = basisvalues[1]*(1.5 + 2.5*Y);
+      basisvalues[7] = basisvalues[3]*(2.5 + 3.5*Y);
+      basisvalues[5] = basisvalues[2]*(0.111111111111111 + Y*1.66666666666667) - basisvalues[0]*0.555555555555556;
+      basisvalues[9] = basisvalues[5]*(0.05 + Y*1.75) - basisvalues[2]*0.7;
+      basisvalues[8] = basisvalues[4]*(0.54 + Y*2.1) - basisvalues[1]*0.56;
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[5] *= std::sqrt(1.5);
+      basisvalues[9] *= std::sqrt(2.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      basisvalues[4] *= std::sqrt(4.5);
+      basisvalues[8] *= std::sqrt(6.0);
+      basisvalues[3] *= std::sqrt(7.5);
+      basisvalues[7] *= std::sqrt(10.0);
+      basisvalues[6] *= std::sqrt(14.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.0, 0.0, 0.0, 0.0, 1.68358757425362, 0.0, 0.0, 0.0, 1.45802960879946, 0.0};
+      
+      static const double coefficients1[10] = \
+      {0.0, 0.0, 3.99999999999986, 0.825930840682366, 0.841793787126812, -1.78851632012734, 0.0, -1.12938487863153, 0.729014804399729, -0.252538136138043};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.89897948556635, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 9.48683298050513, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4, 0.0, 7.07106781186548, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.29150262212918, 0.0, -2.99332590941915, 13.6626010212795, 0.0, 0.611010092660778, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 4.38178046004133, 0.0, 0.0, 12.5219806739988, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.46410161513775, 0.0, 7.83836717690617, 0.0, 0.0, 8.4, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.58198889747161, 4.74341649025257, -0.912870929175277, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2, 6.12372435695794, 3.53553390593274, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.3094010767585, 0.0, 8.16496580927726, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.64575131106459, 5.18459255872628, -1.49666295470957, 6.83130051063973, -1.05830052442584, 0.305505046330389, 0.0, 0.0, 0.0, 0.0},
+      {2.23606797749979, 2.19089023002067, 2.52982212813471, 8.08290376865476, 6.26099033699941, -1.80739222823013, 0.0, 0.0, 0.0, 0.0},
+      {1.73205080756887, -5.09116882454314, 3.91918358845309, 0.0, 9.69948452238571, 4.2, 0.0, 0.0, 0.0, 0.0},
+      {5, 0.0, -2.82842712474619, 0.0, 0.0, 12.1243556529821, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare array of reference derivatives on physical element.
+      double derivatives_p[16];
+      for (unsigned int r = 0; r < 16; r++)
+      {
+        derivatives_p[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+            derivatives[num_derivatives + r] += coefficients1[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+        
+        // Using covariant Piola transform to map values back to the physical element
+        const double tmp_ref0 = derivatives[r];
+        const double tmp_ref1 = derivatives[num_derivatives + r];
+        derivatives_p[r] = (K[0]*tmp_ref0 + K[2]*tmp_ref1);
+        derivatives_p[num_derivatives + r] = (K[1]*tmp_ref0 + K[3]*tmp_ref1);
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives_p[s];
+          values[num_derivatives + r] += transform[r][s]*derivatives_p[num_derivatives + s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 3)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[16];
+    for (unsigned int r = 0; r < 16; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 15; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < 2*num_derivatives; s++)
+      {
+        values[r*2*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+      y[1] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[0]*vals[0] + J[2]*vals[1]) + (J[1]*vals[0] + J[3]*vals[1]);
+      return result;
+        break;
+      }
+    case 1:
+      {
+        y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[0]*vals[0] + J[2]*vals[1]) + (J[1]*vals[0] + J[3]*vals[1]);
+      return result;
+        break;
+      }
+    case 2:
+      {
+        y[0] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[4];
+      y[1] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (-1.0)*(J[0]*vals[0] + J[2]*vals[1]) + (J[1]*vals[0] + J[3]*vals[1]);
+      return result;
+        break;
+      }
+    case 3:
+      {
+        y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[4];
+      y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (J[1]*vals[0] + J[3]*vals[1]);
+      return result;
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (J[1]*vals[0] + J[3]*vals[1]);
+      return result;
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[4];
+      y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      result = (J[1]*vals[0] + J[3]*vals[1]);
+      return result;
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[2];
+      y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (J[0]*vals[0] + J[2]*vals[1]);
+      return result;
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (J[0]*vals[0] + J[2]*vals[1]);
+      return result;
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[2];
+      y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      result = (J[0]*vals[0] + J[2]*vals[1]);
+      return result;
+        break;
+      }
+    case 9:
+      {
+        result = 0.0;
+      double X_9[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+      int D_9[36][1] = {{0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}};
+      double W_9[36][1] = {{0.00821012828325}, {0.00821012828325}, {0.0119624829871}, {0.0056064144375}, {0.00144559962225}, {0.0125840795694}, {0.0179578758575}, {0.0172882391377}, {0.000529299521057}, {0.00111455709092}, {0.0172882391377}, {0.00266246789938}, {0.00852813657368}, {0.00922307258049}, {0.0163217665744}, {0.00727161547759}, {0.00266246789938}, {0.000529299521057}, {0.00111455709092}, {0.0056064144375}, {0.00438000703533}, {0.00727161547759}, {0.0179578758575}, {0.00597613827346}, {0.0163217665744}, {0.023291672331}, {0.0119624829871}, {0.0224231420448}, {0.023291672331}, {0.00922307258049}, {0.0125840795694}, {0.00438000703533}, {0.0224231420448}, {0.00597613827346}, {0.00144559962225}, {0.00852813657368}};
+      double copy_9[2];
+      // Loop over points
+      for (unsigned int r = 0; r < 36; r++)
+      {
+        // Evaluate basis functions for affine mapping
+        const double w0 = 1.0 - X_9[r][0] - X_9[r][1];
+        const double w1 = X_9[r][0];
+        const double w2 = X_9[r][1];
+        
+        // Compute affine mapping y = F(X)
+        y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+        y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+        // Evaluate function at physical point
+        f.evaluate(vals, y, c);
+        // Map function to reference element
+        copy_9[0] = J[0]*vals[0] + J[2]*vals[1];
+        copy_9[1] = J[1]*vals[0] + J[3]*vals[1];
+        // Loop over directions
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          result += copy_9[D_9[r][s]]*W_9[r][s];
+        } // end loop over 's'
+      } // end loop over 'r'
+      return result;
+        break;
+      }
+    case 10:
+      {
+        result = 0.0;
+      double X_10[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+      int D_10[36][1] = {{0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}};
+      double W_10[36][1] = {{0.0159756941744}, {-0.0159756941744}, {-0.00678703358623}, {-0.00209542400951}, {-6.17269708946e-05}, {0.0089949353583}, {0.0192838239128}, {-0.0238542037517}, {-8.83197279225e-05}, {0.000131875132445}, {0.0238542037517}, {-0.00140335236045}, {0.0129148084988}, {0.014499997977}, {0.00421027151037}, {-0.000980807938907}, {0.00140335236045}, {8.83197279225e-05}, {-0.000131875132445}, {0.00209542400951}, {-0.00971097319454}, {0.000980807938907}, {-0.0192838239128}, {-0.00602410954055}, {-0.00421027151037}, {-0.00902620543637}, {0.00678703358623}, {0.0111654692844}, {0.00902620543637}, {-0.014499997977}, {-0.0089949353583}, {0.00971097319454}, {-0.0111654692844}, {0.00602410954055}, {6.17269708946e-05}, {-0.0129148084988}};
+      double copy_10[2];
+      // Loop over points
+      for (unsigned int r = 0; r < 36; r++)
+      {
+        // Evaluate basis functions for affine mapping
+        const double w0 = 1.0 - X_10[r][0] - X_10[r][1];
+        const double w1 = X_10[r][0];
+        const double w2 = X_10[r][1];
+        
+        // Compute affine mapping y = F(X)
+        y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+        y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+        // Evaluate function at physical point
+        f.evaluate(vals, y, c);
+        // Map function to reference element
+        copy_10[0] = J[0]*vals[0] + J[2]*vals[1];
+        copy_10[1] = J[1]*vals[0] + J[3]*vals[1];
+        // Loop over directions
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          result += copy_10[D_10[r][s]]*W_10[r][s];
+        } // end loop over 's'
+      } // end loop over 'r'
+      return result;
+        break;
+      }
+    case 11:
+      {
+        result = 0.0;
+      double X_11[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+      int D_11[36][1] = {{0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}};
+      double W_11[36][1] = {{-0.00645290853773}, {-0.00645290853773}, {-0.015429623211}, {0.010368330848}, {0.00364071931307}, {0.0120307444266}, {0.000278192558146}, {-0.0135880247038}, {0.00133303229957}, {0.00280699404177}, {-0.0135880247038}, {0.00492388644484}, {0.000132112736967}, {-0.0118962371707}, {0.0156040814239}, {0.0134479025608}, {0.00492388644484}, {0.00133303229957}, {0.00280699404177}, {0.010368330848}, {-0.0056494841656}, {0.0134479025608}, {0.000278192558146}, {0.00571336122195}, {0.0156040814239}, {0.0003608205091}, {-0.015429623211}, {-0.0176239005959}, {0.0003608205091}, {-0.0118962371707}, {0.0120307444266}, {-0.0056494841656}, {-0.0176239005959}, {0.00571336122195}, {0.00364071931307}, {0.000132112736967}};
+      double copy_11[2];
+      // Loop over points
+      for (unsigned int r = 0; r < 36; r++)
+      {
+        // Evaluate basis functions for affine mapping
+        const double w0 = 1.0 - X_11[r][0] - X_11[r][1];
+        const double w1 = X_11[r][0];
+        const double w2 = X_11[r][1];
+        
+        // Compute affine mapping y = F(X)
+        y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+        y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+        // Evaluate function at physical point
+        f.evaluate(vals, y, c);
+        // Map function to reference element
+        copy_11[0] = J[0]*vals[0] + J[2]*vals[1];
+        copy_11[1] = J[1]*vals[0] + J[3]*vals[1];
+        // Loop over directions
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          result += copy_11[D_11[r][s]]*W_11[r][s];
+        } // end loop over 's'
+      } // end loop over 'r'
+      return result;
+        break;
+      }
+    case 12:
+      {
+        result = 0.0;
+      double X_12[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+      int D_12[36][1] = {{1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}};
+      double W_12[36][1] = {{0.00821012828325}, {0.00821012828325}, {0.0119624829871}, {0.0056064144375}, {0.00144559962225}, {0.0125840795694}, {0.0179578758575}, {0.0172882391377}, {0.000529299521057}, {0.00111455709092}, {0.0172882391377}, {0.00266246789938}, {0.00852813657368}, {0.00922307258049}, {0.0163217665744}, {0.00727161547759}, {0.00266246789938}, {0.000529299521057}, {0.00111455709092}, {0.0056064144375}, {0.00438000703533}, {0.00727161547759}, {0.0179578758575}, {0.00597613827346}, {0.0163217665744}, {0.023291672331}, {0.0119624829871}, {0.0224231420448}, {0.023291672331}, {0.00922307258049}, {0.0125840795694}, {0.00438000703533}, {0.0224231420448}, {0.00597613827346}, {0.00144559962225}, {0.00852813657368}};
+      double copy_12[2];
+      // Loop over points
+      for (unsigned int r = 0; r < 36; r++)
+      {
+        // Evaluate basis functions for affine mapping
+        const double w0 = 1.0 - X_12[r][0] - X_12[r][1];
+        const double w1 = X_12[r][0];
+        const double w2 = X_12[r][1];
+        
+        // Compute affine mapping y = F(X)
+        y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+        y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+        // Evaluate function at physical point
+        f.evaluate(vals, y, c);
+        // Map function to reference element
+        copy_12[0] = J[0]*vals[0] + J[2]*vals[1];
+        copy_12[1] = J[1]*vals[0] + J[3]*vals[1];
+        // Loop over directions
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          result += copy_12[D_12[r][s]]*W_12[r][s];
+        } // end loop over 's'
+      } // end loop over 'r'
+      return result;
+        break;
+      }
+    case 13:
+      {
+        result = 0.0;
+      double X_13[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+      int D_13[36][1] = {{1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}};
+      double W_13[36][1] = {{0.0159756941744}, {-0.0159756941744}, {-0.00678703358623}, {-0.00209542400951}, {-6.17269708946e-05}, {0.0089949353583}, {0.0192838239128}, {-0.0238542037517}, {-8.83197279225e-05}, {0.000131875132445}, {0.0238542037517}, {-0.00140335236045}, {0.0129148084988}, {0.014499997977}, {0.00421027151037}, {-0.000980807938907}, {0.00140335236045}, {8.83197279225e-05}, {-0.000131875132445}, {0.00209542400951}, {-0.00971097319454}, {0.000980807938907}, {-0.0192838239128}, {-0.00602410954055}, {-0.00421027151037}, {-0.00902620543637}, {0.00678703358623}, {0.0111654692844}, {0.00902620543637}, {-0.014499997977}, {-0.0089949353583}, {0.00971097319454}, {-0.0111654692844}, {0.00602410954055}, {6.17269708946e-05}, {-0.0129148084988}};
+      double copy_13[2];
+      // Loop over points
+      for (unsigned int r = 0; r < 36; r++)
+      {
+        // Evaluate basis functions for affine mapping
+        const double w0 = 1.0 - X_13[r][0] - X_13[r][1];
+        const double w1 = X_13[r][0];
+        const double w2 = X_13[r][1];
+        
+        // Compute affine mapping y = F(X)
+        y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+        y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+        // Evaluate function at physical point
+        f.evaluate(vals, y, c);
+        // Map function to reference element
+        copy_13[0] = J[0]*vals[0] + J[2]*vals[1];
+        copy_13[1] = J[1]*vals[0] + J[3]*vals[1];
+        // Loop over directions
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          result += copy_13[D_13[r][s]]*W_13[r][s];
+        } // end loop over 's'
+      } // end loop over 'r'
+      return result;
+        break;
+      }
+    case 14:
+      {
+        result = 0.0;
+      double X_14[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+      int D_14[36][1] = {{1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}};
+      double W_14[36][1] = {{-0.00645290853773}, {-0.00645290853773}, {-0.015429623211}, {0.010368330848}, {0.00364071931307}, {0.0120307444266}, {0.000278192558146}, {-0.0135880247038}, {0.00133303229957}, {0.00280699404177}, {-0.0135880247038}, {0.00492388644484}, {0.000132112736967}, {-0.0118962371707}, {0.0156040814239}, {0.0134479025608}, {0.00492388644484}, {0.00133303229957}, {0.00280699404177}, {0.010368330848}, {-0.0056494841656}, {0.0134479025608}, {0.000278192558146}, {0.00571336122195}, {0.0156040814239}, {0.0003608205091}, {-0.015429623211}, {-0.0176239005959}, {0.0003608205091}, {-0.0118962371707}, {0.0120307444266}, {-0.0056494841656}, {-0.0176239005959}, {0.00571336122195}, {0.00364071931307}, {0.000132112736967}};
+      double copy_14[2];
+      // Loop over points
+      for (unsigned int r = 0; r < 36; r++)
+      {
+        // Evaluate basis functions for affine mapping
+        const double w0 = 1.0 - X_14[r][0] - X_14[r][1];
+        const double w1 = X_14[r][0];
+        const double w2 = X_14[r][1];
+        
+        // Compute affine mapping y = F(X)
+        y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+        y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+        // Evaluate function at physical point
+        f.evaluate(vals, y, c);
+        // Map function to reference element
+        copy_14[0] = J[0]*vals[0] + J[2]*vals[1];
+        copy_14[1] = J[1]*vals[0] + J[3]*vals[1];
+        // Loop over directions
+        for (unsigned int s = 0; s < 1; s++)
+        {
+          result += copy_14[D_14[r][s]]*W_14[r][s];
+        } // end loop over 's'
+      } // end loop over 'r'
+      return result;
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[2];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    
+    double result;
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    y[0] = 0.75*vertex_coordinates[2] + 0.25*vertex_coordinates[4];
+    y[1] = 0.75*vertex_coordinates[3] + 0.25*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[0]*vals[0] + J[2]*vals[1]) + (J[1]*vals[0] + J[3]*vals[1]);
+    values[0] = result;
+    y[0] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[0]*vals[0] + J[2]*vals[1]) + (J[1]*vals[0] + J[3]*vals[1]);
+    values[1] = result;
+    y[0] = 0.25*vertex_coordinates[2] + 0.75*vertex_coordinates[4];
+    y[1] = 0.25*vertex_coordinates[3] + 0.75*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (-1.0)*(J[0]*vals[0] + J[2]*vals[1]) + (J[1]*vals[0] + J[3]*vals[1]);
+    values[2] = result;
+    y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[4];
+    y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (J[1]*vals[0] + J[3]*vals[1]);
+    values[3] = result;
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[4];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (J[1]*vals[0] + J[3]*vals[1]);
+    values[4] = result;
+    y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[4];
+    y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    result = (J[1]*vals[0] + J[3]*vals[1]);
+    values[5] = result;
+    y[0] = 0.75*vertex_coordinates[0] + 0.25*vertex_coordinates[2];
+    y[1] = 0.75*vertex_coordinates[1] + 0.25*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (J[0]*vals[0] + J[2]*vals[1]);
+    values[6] = result;
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[2];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (J[0]*vals[0] + J[2]*vals[1]);
+    values[7] = result;
+    y[0] = 0.25*vertex_coordinates[0] + 0.75*vertex_coordinates[2];
+    y[1] = 0.25*vertex_coordinates[1] + 0.75*vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    result = (J[0]*vals[0] + J[2]*vals[1]);
+    values[8] = result;
+    result = 0.0;
+    double X_9[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+    int D_9[36][1] = {{0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}};
+    double W_9[36][1] = {{0.00821012828325}, {0.00821012828325}, {0.0119624829871}, {0.0056064144375}, {0.00144559962225}, {0.0125840795694}, {0.0179578758575}, {0.0172882391377}, {0.000529299521057}, {0.00111455709092}, {0.0172882391377}, {0.00266246789938}, {0.00852813657368}, {0.00922307258049}, {0.0163217665744}, {0.00727161547759}, {0.00266246789938}, {0.000529299521057}, {0.00111455709092}, {0.0056064144375}, {0.00438000703533}, {0.00727161547759}, {0.0179578758575}, {0.00597613827346}, {0.0163217665744}, {0.023291672331}, {0.0119624829871}, {0.0224231420448}, {0.023291672331}, {0.00922307258049}, {0.0125840795694}, {0.00438000703533}, {0.0224231420448}, {0.00597613827346}, {0.00144559962225}, {0.00852813657368}};
+    double copy_9[2];
+    // Loop over points
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      // Evaluate basis functions for affine mapping
+      const double w0 = 1.0 - X_9[r][0] - X_9[r][1];
+      const double w1 = X_9[r][0];
+      const double w2 = X_9[r][1];
+      
+      // Compute affine mapping y = F(X)
+      y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+      y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+      // Evaluate function at physical point
+      f.evaluate(vals, y, c);
+      // Map function to reference element
+      copy_9[0] = J[0]*vals[0] + J[2]*vals[1];
+      copy_9[1] = J[1]*vals[0] + J[3]*vals[1];
+      // Loop over directions
+      for (unsigned int s = 0; s < 1; s++)
+      {
+        result += copy_9[D_9[r][s]]*W_9[r][s];
+      } // end loop over 's'
+    } // end loop over 'r'
+    values[9] = result;
+    result = 0.0;
+    double X_10[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+    int D_10[36][1] = {{0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}};
+    double W_10[36][1] = {{0.0159756941744}, {-0.0159756941744}, {-0.00678703358623}, {-0.00209542400951}, {-6.17269708946e-05}, {0.0089949353583}, {0.0192838239128}, {-0.0238542037517}, {-8.83197279225e-05}, {0.000131875132445}, {0.0238542037517}, {-0.00140335236045}, {0.0129148084988}, {0.014499997977}, {0.00421027151037}, {-0.000980807938907}, {0.00140335236045}, {8.83197279225e-05}, {-0.000131875132445}, {0.00209542400951}, {-0.00971097319454}, {0.000980807938907}, {-0.0192838239128}, {-0.00602410954055}, {-0.00421027151037}, {-0.00902620543637}, {0.00678703358623}, {0.0111654692844}, {0.00902620543637}, {-0.014499997977}, {-0.0089949353583}, {0.00971097319454}, {-0.0111654692844}, {0.00602410954055}, {6.17269708946e-05}, {-0.0129148084988}};
+    double copy_10[2];
+    // Loop over points
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      // Evaluate basis functions for affine mapping
+      const double w0 = 1.0 - X_10[r][0] - X_10[r][1];
+      const double w1 = X_10[r][0];
+      const double w2 = X_10[r][1];
+      
+      // Compute affine mapping y = F(X)
+      y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+      y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+      // Evaluate function at physical point
+      f.evaluate(vals, y, c);
+      // Map function to reference element
+      copy_10[0] = J[0]*vals[0] + J[2]*vals[1];
+      copy_10[1] = J[1]*vals[0] + J[3]*vals[1];
+      // Loop over directions
+      for (unsigned int s = 0; s < 1; s++)
+      {
+        result += copy_10[D_10[r][s]]*W_10[r][s];
+      } // end loop over 's'
+    } // end loop over 'r'
+    values[10] = result;
+    result = 0.0;
+    double X_11[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+    int D_11[36][1] = {{0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}};
+    double W_11[36][1] = {{-0.00645290853773}, {-0.00645290853773}, {-0.015429623211}, {0.010368330848}, {0.00364071931307}, {0.0120307444266}, {0.000278192558146}, {-0.0135880247038}, {0.00133303229957}, {0.00280699404177}, {-0.0135880247038}, {0.00492388644484}, {0.000132112736967}, {-0.0118962371707}, {0.0156040814239}, {0.0134479025608}, {0.00492388644484}, {0.00133303229957}, {0.00280699404177}, {0.010368330848}, {-0.0056494841656}, {0.0134479025608}, {0.000278192558146}, {0.00571336122195}, {0.0156040814239}, {0.0003608205091}, {-0.015429623211}, {-0.0176239005959}, {0.0003608205091}, {-0.0118962371707}, {0.0120307444266}, {-0.0056494841656}, {-0.0176239005959}, {0.00571336122195}, {0.00364071931307}, {0.000132112736967}};
+    double copy_11[2];
+    // Loop over points
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      // Evaluate basis functions for affine mapping
+      const double w0 = 1.0 - X_11[r][0] - X_11[r][1];
+      const double w1 = X_11[r][0];
+      const double w2 = X_11[r][1];
+      
+      // Compute affine mapping y = F(X)
+      y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+      y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+      // Evaluate function at physical point
+      f.evaluate(vals, y, c);
+      // Map function to reference element
+      copy_11[0] = J[0]*vals[0] + J[2]*vals[1];
+      copy_11[1] = J[1]*vals[0] + J[3]*vals[1];
+      // Loop over directions
+      for (unsigned int s = 0; s < 1; s++)
+      {
+        result += copy_11[D_11[r][s]]*W_11[r][s];
+      } // end loop over 's'
+    } // end loop over 'r'
+    values[11] = result;
+    result = 0.0;
+    double X_12[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+    int D_12[36][1] = {{1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}};
+    double W_12[36][1] = {{0.00821012828325}, {0.00821012828325}, {0.0119624829871}, {0.0056064144375}, {0.00144559962225}, {0.0125840795694}, {0.0179578758575}, {0.0172882391377}, {0.000529299521057}, {0.00111455709092}, {0.0172882391377}, {0.00266246789938}, {0.00852813657368}, {0.00922307258049}, {0.0163217665744}, {0.00727161547759}, {0.00266246789938}, {0.000529299521057}, {0.00111455709092}, {0.0056064144375}, {0.00438000703533}, {0.00727161547759}, {0.0179578758575}, {0.00597613827346}, {0.0163217665744}, {0.023291672331}, {0.0119624829871}, {0.0224231420448}, {0.023291672331}, {0.00922307258049}, {0.0125840795694}, {0.00438000703533}, {0.0224231420448}, {0.00597613827346}, {0.00144559962225}, {0.00852813657368}};
+    double copy_12[2];
+    // Loop over points
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      // Evaluate basis functions for affine mapping
+      const double w0 = 1.0 - X_12[r][0] - X_12[r][1];
+      const double w1 = X_12[r][0];
+      const double w2 = X_12[r][1];
+      
+      // Compute affine mapping y = F(X)
+      y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+      y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+      // Evaluate function at physical point
+      f.evaluate(vals, y, c);
+      // Map function to reference element
+      copy_12[0] = J[0]*vals[0] + J[2]*vals[1];
+      copy_12[1] = J[1]*vals[0] + J[3]*vals[1];
+      // Loop over directions
+      for (unsigned int s = 0; s < 1; s++)
+      {
+        result += copy_12[D_12[r][s]]*W_12[r][s];
+      } // end loop over 's'
+    } // end loop over 'r'
+    values[12] = result;
+    result = 0.0;
+    double X_13[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+    int D_13[36][1] = {{1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}};
+    double W_13[36][1] = {{0.0159756941744}, {-0.0159756941744}, {-0.00678703358623}, {-0.00209542400951}, {-6.17269708946e-05}, {0.0089949353583}, {0.0192838239128}, {-0.0238542037517}, {-8.83197279225e-05}, {0.000131875132445}, {0.0238542037517}, {-0.00140335236045}, {0.0129148084988}, {0.014499997977}, {0.00421027151037}, {-0.000980807938907}, {0.00140335236045}, {8.83197279225e-05}, {-0.000131875132445}, {0.00209542400951}, {-0.00971097319454}, {0.000980807938907}, {-0.0192838239128}, {-0.00602410954055}, {-0.00421027151037}, {-0.00902620543637}, {0.00678703358623}, {0.0111654692844}, {0.00902620543637}, {-0.014499997977}, {-0.0089949353583}, {0.00971097319454}, {-0.0111654692844}, {0.00602410954055}, {6.17269708946e-05}, {-0.0129148084988}};
+    double copy_13[2];
+    // Loop over points
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      // Evaluate basis functions for affine mapping
+      const double w0 = 1.0 - X_13[r][0] - X_13[r][1];
+      const double w1 = X_13[r][0];
+      const double w2 = X_13[r][1];
+      
+      // Compute affine mapping y = F(X)
+      y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+      y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+      // Evaluate function at physical point
+      f.evaluate(vals, y, c);
+      // Map function to reference element
+      copy_13[0] = J[0]*vals[0] + J[2]*vals[1];
+      copy_13[1] = J[1]*vals[0] + J[3]*vals[1];
+      // Loop over directions
+      for (unsigned int s = 0; s < 1; s++)
+      {
+        result += copy_13[D_13[r][s]]*W_13[r][s];
+      } // end loop over 's'
+    } // end loop over 'r'
+    values[13] = result;
+    result = 0.0;
+    double X_14[36][2] = {{0.823156067319, 0.148078599668}, {0.0287653330126, 0.148078599668}, {0.369529924372, 0.0293164271598}, {0.0390907007328, 0.76923386203}, {0.0278110821154, 0.92694567132}, {0.366569507766, 0.558671518772}, {0.550703627938, 0.336984690281}, {0.14431148695, 0.148078599668}, {0.00246669715267, 0.92694567132}, {0.0606792682628, 0.92694567132}, {0.707609913381, 0.148078599668}, {0.00779187470129, 0.76923386203}, {0.640628436741, 0.336984690281}, {0.806254331245, 0.0293164271598}, {0.273318962107, 0.558671518772}, {0.087850454976, 0.76923386203}, {0.222974263269, 0.76923386203}, {0.0705876315276, 0.92694567132}, {0.0123750604174, 0.92694567132}, {0.191675437237, 0.76923386203}, {0.0327753666145, 0.0293164271598}, {0.142915682994, 0.76923386203}, {0.112311681781, 0.336984690281}, {0.0149015633667, 0.558671518772}, {0.168009519121, 0.558671518772}, {0.252403568077, 0.336984690281}, {0.601153648468, 0.0293164271598}, {0.527603095743, 0.148078599668}, {0.410611741642, 0.336984690281}, {0.164429241595, 0.0293164271598}, {0.0747589734626, 0.558671518772}, {0.937908206226, 0.0293164271598}, {0.324318304589, 0.148078599668}, {0.426426917862, 0.558671518772}, {0.0452432465649, 0.92694567132}, {0.022386872978, 0.336984690281}};
+    int D_14[36][1] = {{1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}, {1}};
+    double W_14[36][1] = {{-0.00645290853773}, {-0.00645290853773}, {-0.015429623211}, {0.010368330848}, {0.00364071931307}, {0.0120307444266}, {0.000278192558146}, {-0.0135880247038}, {0.00133303229957}, {0.00280699404177}, {-0.0135880247038}, {0.00492388644484}, {0.000132112736967}, {-0.0118962371707}, {0.0156040814239}, {0.0134479025608}, {0.00492388644484}, {0.00133303229957}, {0.00280699404177}, {0.010368330848}, {-0.0056494841656}, {0.0134479025608}, {0.000278192558146}, {0.00571336122195}, {0.0156040814239}, {0.0003608205091}, {-0.015429623211}, {-0.0176239005959}, {0.0003608205091}, {-0.0118962371707}, {0.0120307444266}, {-0.0056494841656}, {-0.0176239005959}, {0.00571336122195}, {0.00364071931307}, {0.000132112736967}};
+    double copy_14[2];
+    // Loop over points
+    for (unsigned int r = 0; r < 36; r++)
+    {
+      // Evaluate basis functions for affine mapping
+      const double w0 = 1.0 - X_14[r][0] - X_14[r][1];
+      const double w1 = X_14[r][0];
+      const double w2 = X_14[r][1];
+      
+      // Compute affine mapping y = F(X)
+      y[0] = w0*vertex_coordinates[0] + w1*vertex_coordinates[2] + w2*vertex_coordinates[4];
+      y[1] = w0*vertex_coordinates[1] + w1*vertex_coordinates[3] + w2*vertex_coordinates[5];
+      // Evaluate function at physical point
+      f.evaluate(vals, y, c);
+      // Map function to reference element
+      copy_14[0] = J[0]*vals[0] + J[2]*vals[1];
+      copy_14[1] = J[1]*vals[0] + J[3]*vals[1];
+      // Loop over directions
+      for (unsigned int s = 0; s < 1; s++)
+      {
+        result += copy_14[D_14[r][s]]*W_14[r][s];
+      } // end loop over 's'
+    } // end loop over 'r'
+    values[14] = result;
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[3]*K[2]*3.0 + dof_values[4]*(K[2]*(-3.0)) + dof_values[5]*K[2] + dof_values[6]*K[0]*3.0 + dof_values[7]*(K[0]*(-3.0)) + dof_values[8]*K[0];
+    vertex_values[2] = dof_values[0]*K[2]*3.0 + dof_values[1]*(K[2]*(-3.0)) + dof_values[2]*K[2] + dof_values[6]*(K[0] + K[2]) + dof_values[7]*(K[0]*(-3.0) + K[2]*(-3.0)) + dof_values[8]*(K[0]*3.0 + K[2]*3.0) + dof_values[10]*(K[2]*(-1.88182802674e-14)) + dof_values[11]*(K[2]*(3.10862446895e-14)) + dof_values[12]*(K[2]*(1.8124390877e-14));
+    vertex_values[4] = dof_values[0]*(K[0]*(-1.0)) + dof_values[1]*K[0]*3.0 + dof_values[2]*(K[0]*(-3.0)) + dof_values[3]*(K[0] + K[2]) + dof_values[4]*(K[0]*(-3.0) + K[2]*(-3.0)) + dof_values[5]*(K[0]*3.0 + K[2]*3.0) + dof_values[9]*(K[0]*(-1.7763568394e-14)) + dof_values[10]*(K[0]*(-1.61647043285e-14)) + dof_values[11]*(K[0]*(2.30926389122e-14)) + dof_values[14]*(K[0]*(1.34149638901e-14));
+    vertex_values[1] = dof_values[3]*K[3]*3.0 + dof_values[4]*(K[3]*(-3.0)) + dof_values[5]*K[3] + dof_values[6]*K[1]*3.0 + dof_values[7]*(K[1]*(-3.0)) + dof_values[8]*K[1];
+    vertex_values[3] = dof_values[0]*K[3]*3.0 + dof_values[1]*(K[3]*(-3.0)) + dof_values[2]*K[3] + dof_values[6]*(K[1] + K[3]) + dof_values[7]*(K[1]*(-3.0) + K[3]*(-3.0)) + dof_values[8]*(K[1]*3.0 + K[3]*3.0) + dof_values[10]*(K[3]*(-1.88182802674e-14)) + dof_values[11]*(K[3]*(3.10862446895e-14)) + dof_values[12]*(K[3]*(1.8124390877e-14));
+    vertex_values[5] = dof_values[0]*(K[1]*(-1.0)) + dof_values[1]*K[1]*3.0 + dof_values[2]*(K[1]*(-3.0)) + dof_values[3]*(K[1] + K[3]) + dof_values[4]*(K[1]*(-3.0) + K[3]*(-3.0)) + dof_values[5]*(K[1]*3.0 + K[3]*3.0) + dof_values[9]*(K[1]*(-1.7763568394e-14)) + dof_values[10]*(K[1]*(-1.61647043285e-14)) + dof_values[11]*(K[1]*(2.30926389122e-14)) + dof_values[14]*(K[1]*(1.34149638901e-14));
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new forms_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class forms_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  forms_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~forms_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Nedelec 1st kind H(curl)', Domain(Cell('triangle', 2)), 3, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return false;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return true;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return 3*num_global_entities[1] + 6*num_global_entities[2];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 15;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 0;
+        break;
+      }
+    case 1:
+      {
+        return 3;
+        break;
+      }
+    case 2:
+      {
+        return 6;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + 3*c.entity_indices[1][0];
+    dofs[1] = offset + 3*c.entity_indices[1][0] + 1;
+    dofs[2] = offset + 3*c.entity_indices[1][0] + 2;
+    dofs[3] = offset + 3*c.entity_indices[1][1];
+    dofs[4] = offset + 3*c.entity_indices[1][1] + 1;
+    dofs[5] = offset + 3*c.entity_indices[1][1] + 2;
+    dofs[6] = offset + 3*c.entity_indices[1][2];
+    dofs[7] = offset + 3*c.entity_indices[1][2] + 1;
+    dofs[8] = offset + 3*c.entity_indices[1][2] + 2;
+    offset += 3*num_global_entities[1];
+    dofs[9] = offset + 6*c.entity_indices[2][0];
+    dofs[10] = offset + 6*c.entity_indices[2][0] + 1;
+    dofs[11] = offset + 6*c.entity_indices[2][0] + 2;
+    dofs[12] = offset + 6*c.entity_indices[2][0] + 3;
+    dofs[13] = offset + 6*c.entity_indices[2][0] + 4;
+    dofs[14] = offset + 6*c.entity_indices[2][0] + 5;
+    offset += 6*num_global_entities[2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 3;
+      dofs[1] = 4;
+      dofs[2] = 5;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 6;
+      dofs[1] = 7;
+      dofs[2] = 8;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        
+        break;
+      }
+    case 1:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+        dofs[1] = 1;
+        dofs[2] = 2;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 3;
+        dofs[1] = 4;
+        dofs[2] = 5;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+        dofs[1] = 7;
+        dofs[2] = 8;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        if (i > 0)
+      {
+      throw std::runtime_error("i is larger than number of entities (0)");
+      }
+      
+      dofs[0] = 9;
+      dofs[1] = 10;
+      dofs[2] = 11;
+      dofs[3] = 12;
+      dofs[4] = 13;
+      dofs[5] = 14;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    throw std::runtime_error("tabulate_coordinates is not defined for this element");
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new forms_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class forms_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  forms_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~forms_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute cell volume
+    
+    
+    // Compute circumradius of triangle in 2D
+    
+    
+    // Array of quadrature weights.
+    static const double W6[6] = {0.054975871827661, 0.054975871827661, 0.054975871827661, 0.111690794839005, 0.111690794839005, 0.111690794839005};
+    // Quadrature points on the UFC reference element: (0.816847572980459, 0.091576213509771), (0.091576213509771, 0.816847572980459), (0.091576213509771, 0.091576213509771), (0.10810301816807, 0.445948490915965), (0.445948490915965, 0.10810301816807), (0.445948490915965, 0.445948490915965)
+    
+    // Values of basis functions at quadrature points.
+    static const double FE1_C0_D01[6][15] = \
+    {{-2.84278477949181, 2.60133169408131, -0.632753871377705, 1.85982644165771, -0.635415018413118, 1.6157122092118, 2.32942687730164, -3.32302980327736, -5.80496552817115, 16.7566247559306, 28.2503375501112, -10.3125950058212, -5.5604520504506, 17.1175226659554, -9.82958337834062},
+    {-1.7907476897549, 5.75744296329207, -10.10108767901, 4.75292843843426, -11.6818044606508, 7.13890693033064, -0.0216896923939891, 0.104074179473846, -0.265803924839875, -16.8318933605097, 0.917612187043447, -25.9334825297501, 16.7566247559308, 3.45115998442162, 29.6218074867926},
+    {-0.730727158911739, 0.36974459894347, -1.15078897513993, 1.38159747240879, -1.67148522593757, 0.49991866164288, -11.562274986093, 6.68728943143579, -1.9235828994897, 14.953319808833, -30.970567403202, -19.4780023354878, 3.68187849877412, 6.76404271269084, 6.50870313497028},
+    {0.565452740291995, -0.671420571424332, 2.08901867938574, -1.60411004260619, 2.74873517605272, -1.05036137707154, 1.90640810299341, -0.306199418639675, 0.74806331668432, -1.03300141506714, 15.1714233065578, 29.9298875179392, -5.87553297436214, -4.8631776237649, -10.3865730231416},
+    {0.793731867204493, 0.0134168093131546, 0.0345065371732662, -0.976342443596821, 0.351804343471503, 0.148104039219062, -2.5655189125616, -1.543441746175, -2.01177024702697, 19.6926017532207, 9.2405576147594, -13.0772891857657, -1.03300141506717, -7.8286104696641, -1.82610576392324},
+    {-0.957138495883969, -2.14608846111385, -0.00427037407146003, 2.74910419187173, -1.43784293086167, -1.7876953219163, 3.34906346933698, -2.09584669297284, 1.09505522467392, -15.4312459652903, 2.32121430766122, 18.0366977074506, 10.1368887622926, 18.6226537852274, 17.919656959877}};
+    
+    static const double FE1_C1_D10[6][15] = \
+    {{10.10108767901, -5.7574429632921, 1.7907476897549, -0.0216896923939997, 0.104074179473851, -0.265803924839896, 4.75292843843424, -11.6818044606508, 7.13890693033065, 16.7566247559307, 27.3788177817851, -11.8221115243629, -16.8318933605095, -22.0002485858418, 13.761416729677},
+    {0.632753871377701, -2.60133169408131, 2.84278477949182, 2.32942687730165, -3.32302980327736, -5.80496552817115, 1.85982644165772, -0.63541501841312, 1.61571220921181, -5.56045205045061, 0.0460924187174605, 19.7390011677437, 16.7566247559306, 5.19419952107394, 29.6218074867924},
+    {1.15078897513993, -0.36974459894347, 0.730727158911739, -11.562274986093, 6.68728943143579, -1.9235828994897, 1.38159747240878, -1.67148522593756, 0.499918661642877, 3.6818784987741, 9.01872361692109, 2.60348125398813, 14.9533198088331, -32.353728539106, -17.0822969730473},
+    {-0.0345065371732606, -0.0134168093131614, -0.793731867204489, -2.56551891256161, -1.54344174617501, -2.01177024702696, -0.976342443596819, 0.351804343471497, 0.148104039219068, -1.03300141506717, -5.49575921638675, -5.86672266110032, 19.6926017532208, -6.70498584012892, 14.5412022323982},
+    {-2.08901867938574, 0.671420571424337, -0.565452740291994, 1.90640810299341, -0.306199418639674, 0.748063316684324, -1.60411004260618, 2.74873517605272, -1.05036137707154, -5.87553297436213, -11.4266249081852, 0.981651146274364, -1.03300141506718, 33.505754576225, -1.82610576392323},
+    {0.00427037407144766, 2.14608846111387, 0.957138495883957, 3.34906346933698, -2.09584669297285, 1.09505522467392, 2.74910419187172, -1.43784293086166, -1.78769532191632, 10.1368887622926, 24.8302050469698, 7.16786278395083, -15.4312459652903, 16.7808455688634, -7.00811829566277}};
+    
+    // Reset values in the element tensor.
+    for (unsigned int r = 0; r < 225; r++)
+    {
+      A[r] = 0.0;
+    } // end loop over 'r'
+    // Number of operations to compute geometry constants: 22.
+    double G[2];
+    G[0] = det*(K[0]*K[0]*K[3]*K[3] + K[1]*K[2]*(K[1]*K[2]-2.0*K[0]*K[3]));
+    G[1] = det*(K[1]*K[2]*(2.0*K[0]*K[3] - K[1]*K[2]) - K[0]*K[0]*K[3]*K[3]);
+    
+    // Compute element tensor using UFL quadrature representation
+    // Optimisations: ('eliminate zeros', True), ('ignore ones', True), ('ignore zero tables', True), ('optimisation', 'simplify_expressions'), ('remove zero terms', True)
+    
+    // Loop quadrature points for integral.
+    // Number of operations to compute element tensor for following IP loop = 16212
+    for (unsigned int ip = 0; ip < 6; ip++)
+    {
+      
+      // Number of operations to compute ip constants: 2
+      double I[2];
+      // Number of operations: 1
+      I[0] = G[0]*W6[ip];
+      
+      // Number of operations: 1
+      I[1] = G[1]*W6[ip];
+      
+      
+      // Number of operations for primary indices: 2700
+      for (unsigned int j = 0; j < 15; j++)
+      {
+        for (unsigned int k = 0; k < 15; k++)
+        {
+          // Number of operations to compute entry: 12
+          A[j*15 + k] += (FE1_C0_D01[ip][j]*FE1_C0_D01[ip][k]*I[0] + FE1_C0_D01[ip][j]*FE1_C1_D10[ip][k]*I[1] + FE1_C0_D01[ip][k]*FE1_C1_D10[ip][j]*I[1] + FE1_C1_D10[ip][j]*FE1_C1_D10[ip][k]*I[0]);
+        } // end loop over 'k'
+      } // end loop over 'j'
+    } // end loop over 'ip'
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class forms_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  forms_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~forms_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 777
+    // Total number of operations (multiply-add pairs):                  788
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.0216269841269843*G0_0_0 - 0.0111607142857143*G0_0_1 - 0.0111607142857143*G0_1_0 + 0.0573412698412703*G0_1_1;
+    A[1] = -0.0298611111111112*G0_0_0 + 0.0059523809523809*G0_0_1 + 0.00992063492063499*G0_1_0 - 0.0487103174603178*G0_1_1;
+    A[2] = 0.0176587301587301*G0_0_0 - 0.00471230158730157*G0_0_1 - 0.00471230158730158*G0_1_0 + 0.0176587301587302*G0_1_1;
+    A[3] = -0.0154265873015874*G0_0_0 - 0.0244791666666669*G0_0_1 + 0.00905257936507937*G0_1_0 + 0.0186011904761906*G0_1_1;
+    A[4] = 0.0174603174603174*G0_0_0 + 0.0216765873015872*G0_0_1 - 0.00570436507936504*G0_1_0 - 0.0119047619047618*G0_1_1;
+    A[5] = -0.023859126984127*G0_0_0 - 0.0326636904761906*G0_0_1 + 0.00682043650793654*G0_1_0 + 0.0111607142857141*G0_1_1;
+    A[6] = -0.0131448412698413*G0_0_0 - 0.00880456349206356*G0_0_1 + 0.0306795634920636*G0_1_0 + 0.0238591269841271*G0_1_1;
+    A[7] = 0.027777777777778*G0_0_0 + 0.0141369047619049*G0_0_1 - 0.0727678571428577*G0_1_0 - 0.0611111111111115*G0_1_1;
+    A[8] = -0.0205853174603176*G0_0_0 - 0.00706845238095235*G0_0_1 + 0.0582093253968256*G0_1_0 + 0.0511408730158734*G0_1_1;
+    A[9] = 0.0434926790015496*G0_0_0 - 0.0231493291459878*G0_0_1 - 0.0624330392119039*G0_1_0 + 0.0350747411302844*G0_1_1;
+    A[10] = 0.0652955661583499*G0_0_0 - 0.0515491311776441*G0_0_1 - 0.127154523571519*G0_1_0 + 0.0652955661583485*G0_1_1;
+    A[11] = -0.0168650793650805*G0_0_0 - 0.00744047619047573*G0_0_1 + 0.0719246031746001*G0_1_0 - 0.010912698412699*G0_1_1;
+    A[12] = 0.0350747411302842*G0_0_0 + 0.128373552536838*G0_0_1 - 0.0119254119842968*G0_1_0 - 0.12486607842381*G0_1_1;
+    A[13] = -0.100520805796406*G0_0_0 - 0.0631476856926133*G0_0_1 + 0.0708800553692599*G0_1_0 - 0.0850560664431109*G0_1_1;
+    A[14] = 0.0620039682539666*G0_0_0 + 0.0959821428571385*G0_0_1 - 0.0210813492063489*G0_1_0 + 0.0530753968253965*G0_1_1;
+    A[15] = -0.0298611111111112*G0_0_0 + 0.00992063492063499*G0_0_1 + 0.0059523809523809*G0_1_0 - 0.0487103174603178*G0_1_1;
+    A[16] = 0.0686507936507939*G0_0_0 - 0.0128968253968255*G0_0_1 - 0.0128968253968255*G0_1_0 + 0.0686507936507943*G0_1_1;
+    A[17] = -0.0487103174603175*G0_0_0 + 0.00595238095238091*G0_0_1 + 0.00992063492063498*G0_1_0 - 0.0298611111111114*G0_1_1;
+    A[18] = 0.0174603174603174*G0_0_0 + 0.0231646825396826*G0_0_1 - 0.00421626984126976*G0_1_0 - 0.0104166666666666*G0_1_1;
+    A[19] = -0.0438492063492063*G0_0_0 - 0.0532738095238096*G0_0_1 + 0.00942460317460317*G0_1_0 + 0.0178571428571428*G0_1_1;
+    A[20] = 0.0611111111111113*G0_0_0 + 0.0752480158730163*G0_0_1 - 0.0116567460317461*G0_1_0 - 0.0252976190476191*G0_1_1;
+    A[21] = 0.0104166666666667*G0_0_0 + 0.00421626984126979*G0_0_1 - 0.0231646825396825*G0_1_0 - 0.0174603174603175*G0_1_1;
+    A[22] = -0.017857142857143*G0_0_0 - 0.00942460317460322*G0_0_1 + 0.0532738095238099*G0_1_0 + 0.0438492063492066*G0_1_1;
+    A[23] = 0.0252976190476193*G0_0_0 + 0.0116567460317461*G0_0_1 - 0.0752480158730165*G0_1_0 - 0.0611111111111117*G0_1_1;
+    A[24] = -0.0785674201318346*G0_0_0 - 0.0098209275164796*G0_0_1 + 0.136089995585501*G0_1_0 + 0.070149482260569*G0_1_1;
+    A[25] = -0.0532674355502333*G0_0_0 - 0.00859152186294125*G0_0_1 + 0.183858567866929*G0_1_0 + 0.0841969142568198*G0_1_1;
+    A[26] = -0.00496031746031419*G0_0_0 + 0.0198412698412687*G0_0_1 - 0.162698412698406*G0_1_0 - 0.102182539682537*G0_1_1;
+    A[27] = -0.0701494822605686*G0_0_0 - 0.136089995585501*G0_0_1 + 0.00982092751647975*G0_1_0 + 0.0785674201318344*G0_1_1;
+    A[28] = 0.0463942180598789*G0_0_0 + 0.0489716746187604*G0_0_1 - 0.01288728279441*G0_1_0 + 0.0309294787065848*G0_1_1;
+    A[29] = -0.124007936507934*G0_0_0 - 0.240575396825388*G0_0_1 + 0.017361111111111*G0_1_0 + 0.0436507936507942*G0_1_1;
+    A[30] = 0.0176587301587301*G0_0_0 - 0.00471230158730158*G0_0_1 - 0.00471230158730157*G0_1_0 + 0.0176587301587302*G0_1_1;
+    A[31] = -0.0487103174603175*G0_0_0 + 0.00992063492063498*G0_0_1 + 0.00595238095238091*G0_1_0 - 0.0298611111111114*G0_1_1;
+    A[32] = 0.0573412698412702*G0_0_0 - 0.0111607142857143*G0_0_1 - 0.0111607142857143*G0_1_0 + 0.0216269841269844*G0_1_1;
+    A[33] = -0.0238591269841271*G0_0_0 - 0.0306795634920637*G0_0_1 + 0.00880456349206355*G0_1_0 + 0.0131448412698413*G0_1_1;
+    A[34] = 0.0611111111111115*G0_0_0 + 0.0727678571428577*G0_0_1 - 0.0141369047619049*G0_1_0 - 0.0277777777777779*G0_1_1;
+    A[35] = -0.0511408730158732*G0_0_0 - 0.0582093253968257*G0_0_1 + 0.00706845238095237*G0_1_0 + 0.0205853174603176*G0_1_1;
+    A[36] = -0.0186011904761907*G0_0_0 - 0.00905257936507942*G0_0_1 + 0.0244791666666668*G0_1_0 + 0.0154265873015875*G0_1_1;
+    A[37] = 0.011904761904762*G0_0_0 + 0.00570436507936508*G0_0_1 - 0.0216765873015873*G0_1_0 - 0.0174603174603175*G0_1_1;
+    A[38] = -0.0111607142857143*G0_0_0 - 0.00682043650793655*G0_0_1 + 0.0326636904761907*G0_1_0 + 0.0238591269841272*G0_1_1;
+    A[39] = 0.124866078423811*G0_0_0 + 0.0119254119842967*G0_0_1 - 0.128373552536838*G0_1_0 - 0.0350747411302846*G0_1_1;
+    A[40] = -0.00343660874517726*G0_0_0 - 0.0171830437258809*G0_0_1 - 0.0515491311776428*G0_1_0 - 0.00343660874517665*G0_1_1;
+    A[41] = 0.100198412698408*G0_0_0 - 0.0719246031746013*G0_0_1 + 0.102678571428568*G0_1_0 + 0.118055555555554*G0_1_1;
+    A[42] = -0.0350747411302846*G0_0_0 + 0.0624330392119044*G0_0_1 + 0.0231493291459878*G0_1_0 - 0.0434926790015495*G0_1_1;
+    A[43] = -0.0231971090299392*G0_0_0 + 0.00128872827944068*G0_0_1 + 0.0322182069860272*G0_1_0 - 0.0180421959121743*G0_1_1;
+    A[44] = -0.0620039682539675*G0_0_0 + 0.146081349206343*G0_0_1 + 0.0409226190476184*G0_1_0 - 0.0649801587301586*G0_1_1;
+    A[45] = -0.0154265873015874*G0_0_0 + 0.00905257936507937*G0_0_1 - 0.0244791666666669*G0_1_0 + 0.0186011904761906*G0_1_1;
+    A[46] = 0.0174603174603174*G0_0_0 - 0.00421626984126976*G0_0_1 + 0.0231646825396826*G0_1_0 - 0.0104166666666666*G0_1_1;
+    A[47] = -0.0238591269841271*G0_0_0 + 0.00880456349206355*G0_0_1 - 0.0306795634920637*G0_1_0 + 0.0131448412698413*G0_1_1;
+    A[48] = 0.0216269841269844*G0_0_0 + 0.0327876984126987*G0_0_1 + 0.0327876984126988*G0_1_0 + 0.101289682539683*G0_1_1;
+    A[49] = -0.0298611111111113*G0_0_0 - 0.0358134920634922*G0_0_1 - 0.0397817460317464*G0_1_0 - 0.094444444444445*G0_1_1;
+    A[50] = 0.0176587301587301*G0_0_0 + 0.0223710317460317*G0_0_1 + 0.0223710317460318*G0_1_0 + 0.0447420634920635*G0_1_1;
+    A[51] = 0.0205853174603176*G0_0_0 + 0.0135168650793652*G0_0_1 + 0.0787946428571433*G0_1_0 + 0.0205853174603176*G0_1_1;
+    A[52] = -0.027777777777778*G0_0_0 - 0.0136408730158731*G0_0_1 - 0.100545634920636*G0_1_0 - 0.0252976190476193*G0_1_1;
+    A[53] = 0.0131448412698413*G0_0_0 + 0.0043402777777777*G0_0_1 + 0.0438244047619049*G0_1_0 + 0.0111607142857143*G0_1_1;
+    A[54] = -0.0785674201318343*G0_0_0 + 0.0266568032590162*G0_0_1 - 0.152925871328036*G0_1_0 + 0.0420896893563413*G0_1_1;
+    A[55] = -0.035225239638056*G0_0_0 + 0.0794715772322013*G0_0_1 + 0.0210492285642031*G0_1_0 + 0.115985545149699*G0_1_1;
+    A[56] = -0.0451388888888868*G0_0_0 + 0.0434027777777768*G0_0_1 + 0.00570436507936464*G0_1_0 + 0.0520833333333314*G0_1_1;
+    A[57] = 0.0350747411302846*G0_0_0 - 0.0932988114065537*G0_0_1 + 0.0470001531145812*G0_1_0 - 0.206239477846068*G0_1_1;
+    A[58] = 0.100520805796406*G0_0_0 + 0.0373731201037927*G0_0_1 + 0.171400861165666*G0_1_0 + 0.193309241916163*G0_1_1;
+    A[59] = 0.0620039682539676*G0_0_0 - 0.0339781746031716*G0_0_1 + 0.0830853174603165*G0_1_0 + 0.0401785714285731*G0_1_1;
+    A[60] = 0.0174603174603174*G0_0_0 - 0.00570436507936504*G0_0_1 + 0.0216765873015872*G0_1_0 - 0.0119047619047618*G0_1_1;
+    A[61] = -0.0438492063492063*G0_0_0 + 0.00942460317460317*G0_0_1 - 0.0532738095238096*G0_1_0 + 0.0178571428571428*G0_1_1;
+    A[62] = 0.0611111111111115*G0_0_0 - 0.0141369047619049*G0_0_1 + 0.0727678571428577*G0_1_0 - 0.0277777777777779*G0_1_1;
+    A[63] = -0.0298611111111113*G0_0_0 - 0.0397817460317464*G0_0_1 - 0.0358134920634922*G0_1_0 - 0.094444444444445*G0_1_1;
+    A[64] = 0.0686507936507941*G0_0_0 + 0.0815476190476197*G0_0_1 + 0.0815476190476197*G0_1_0 + 0.163095238095239*G0_1_1;
+    A[65] = -0.0487103174603176*G0_0_0 - 0.0546626984126986*G0_0_1 - 0.0586309523809527*G0_1_0 - 0.0944444444444449*G0_1_1;
+    A[66] = -0.0252976190476193*G0_0_0 - 0.0136408730158731*G0_0_1 - 0.100545634920636*G0_1_0 - 0.027777777777778*G0_1_1;
+    A[67] = 0.017857142857143*G0_0_0 + 0.00843253968253969*G0_0_1 + 0.0711309523809525*G0_1_0 + 0.0178571428571429*G0_1_1;
+    A[68] = -0.0104166666666666*G0_0_0 - 0.0062003968253968*G0_0_1 - 0.033581349206349*G0_1_0 - 0.0119047619047618*G0_1_1;
+    A[69] = 0.148716902392404*G0_0_0 + 0.00280597929042272*G0_0_1 + 0.294627825494385*G0_1_0;
+    A[70] = -0.0068732174903545*G0_0_0 - 0.0472533702461734*G0_0_1 - 0.177844502562873*G0_1_0 - 0.103098262355288*G0_1_1;
+    A[71] = 0.128968253968249*G0_0_0 - 0.0917658730158708*G0_0_1 - 0.0163690476190464*G0_1_0 - 0.178571428571424*G0_1_1;
+    A[72] = -0.0701494822605691*G0_0_0 + 0.0659405133249323*G0_0_1 - 0.0799704097770486*G0_1_0 + 0.134687005940287*G0_1_1;
+    A[73] = -0.0463942180598792*G0_0_0 + 0.00257745655888092*G0_0_1 - 0.0592815008542891*G0_1_0 - 0.0412393049421138*G0_1_1;
+    A[74] = -0.124007936507935*G0_0_0 + 0.116567460317454*G0_0_1 - 0.141369047619046*G0_1_0 + 0.142857142857138*G0_1_1;
+    A[75] = -0.023859126984127*G0_0_0 + 0.00682043650793654*G0_0_1 - 0.0326636904761906*G0_1_0 + 0.0111607142857141*G0_1_1;
+    A[76] = 0.0611111111111113*G0_0_0 - 0.0116567460317461*G0_0_1 + 0.0752480158730163*G0_1_0 - 0.0252976190476191*G0_1_1;
+    A[77] = -0.0511408730158732*G0_0_0 + 0.00706845238095237*G0_0_1 - 0.0582093253968257*G0_1_0 + 0.0205853174603176*G0_1_1;
+    A[78] = 0.0176587301587301*G0_0_0 + 0.0223710317460318*G0_0_1 + 0.0223710317460317*G0_1_0 + 0.0447420634920635*G0_1_1;
+    A[79] = -0.0487103174603176*G0_0_0 - 0.0586309523809527*G0_0_1 - 0.0546626984126986*G0_1_0 - 0.0944444444444449*G0_1_1;
+    A[80] = 0.0573412698412701*G0_0_0 + 0.0685019841269845*G0_0_1 + 0.0685019841269845*G0_1_0 + 0.101289682539683*G0_1_1;
+    A[81] = 0.0111607142857143*G0_0_0 + 0.00434027777777774*G0_0_1 + 0.0438244047619049*G0_1_0 + 0.0131448412698413*G0_1_1;
+    A[82] = -0.011904761904762*G0_0_0 - 0.00620039682539682*G0_0_1 - 0.033581349206349*G0_1_0 - 0.0104166666666665*G0_1_1;
+    A[83] = 0.0186011904761907*G0_0_0 + 0.0095486111111112*G0_0_1 + 0.0430803571428573*G0_1_0 + 0.0186011904761905*G0_1_1;
+    A[84] = -0.0897913372935264*G0_0_0 - 0.0154328860973252*G0_0_1 - 0.195015560684377*G0_1_0 - 0.0420896893563414*G0_1_1;
+    A[85] = -0.0266337177751165*G0_0_0 - 0.0107394023286764*G0_0_1 - 0.00730279358350015*G0_1_0 - 0.0128872827944119*G0_1_1;
+    A[86] = -0.038194444444441*G0_0_0 + 0.0359623015873003*G0_0_1 + 0.105406746031745*G0_1_0 + 0.126488095238092*G0_1_1;
+    A[87] = -0.0350747411302842*G0_0_0 - 0.0975077803421885*G0_0_1 - 0.058224070276272*G0_1_0 - 0.164149788489726*G0_1_1;
+    A[88] = 0.023197109029939*G0_0_0 + 0.0244858373093799*G0_0_1 + 0.0554153160159659*G0_1_0 + 0.0747462402075819*G0_1_1;
+    A[89] = -0.0620039682539666*G0_0_0 - 0.208085317460309*G0_0_1 - 0.102926587301585*G0_1_0 - 0.313988095238087*G0_1_1;
+    A[90] = -0.0131448412698413*G0_0_0 + 0.0306795634920636*G0_0_1 - 0.00880456349206356*G0_1_0 + 0.0238591269841271*G0_1_1;
+    A[91] = 0.0104166666666667*G0_0_0 - 0.0231646825396826*G0_0_1 + 0.00421626984126979*G0_1_0 - 0.0174603174603175*G0_1_1;
+    A[92] = -0.0186011904761907*G0_0_0 + 0.0244791666666668*G0_0_1 - 0.00905257936507942*G0_1_0 + 0.0154265873015875*G0_1_1;
+    A[93] = 0.0205853174603176*G0_0_0 + 0.0787946428571433*G0_0_1 + 0.0135168650793652*G0_1_0 + 0.0205853174603176*G0_1_1;
+    A[94] = -0.0252976190476193*G0_0_0 - 0.100545634920636*G0_0_1 - 0.0136408730158731*G0_1_0 - 0.027777777777778*G0_1_1;
+    A[95] = 0.0111607142857143*G0_0_0 + 0.0438244047619049*G0_0_1 + 0.00434027777777773*G0_1_0 + 0.0131448412698413*G0_1_1;
+    A[96] = 0.101289682539683*G0_0_0 + 0.0327876984126987*G0_0_1 + 0.0327876984126987*G0_1_0 + 0.0216269841269843*G0_1_1;
+    A[97] = -0.0944444444444448*G0_0_0 - 0.0397817460317463*G0_0_1 - 0.0358134920634922*G0_1_0 - 0.0298611111111113*G0_1_1;
+    A[98] = 0.0447420634920634*G0_0_0 + 0.0223710317460318*G0_0_1 + 0.0223710317460317*G0_1_0 + 0.0176587301587302*G0_1_1;
+    A[99] = -0.206239477846068*G0_0_0 + 0.0470001531145811*G0_0_1 - 0.0932988114065536*G0_1_0 + 0.0350747411302843*G0_1_1;
+    A[100] = 0.131450284502994*G0_0_0 + 0.157654426184961*G0_0_1 - 0.0107394023286738*G0_1_0 + 0.103957414541582*G0_1_1;
+    A[101] = 0.147321428571423*G0_0_0 + 0.106894841269839*G0_0_1 + 0.0493551587301574*G0_1_0 + 0.0560515873015864*G0_1_1;
+    A[102] = 0.0420896893563413*G0_0_0 - 0.152925871328036*G0_0_1 + 0.0266568032590162*G0_1_0 - 0.0785674201318339*G0_1_1;
+    A[103] = 0.103098262355287*G0_0_0 + 0.015464739353292*G0_0_1 + 0.077323696766466*G0_1_0 - 0.0567040442954068*G0_1_1;
+    A[104] = 0.0744047619047609*G0_0_0 + 0.0153769841269828*G0_0_1 + 0.0471230158730152*G0_1_0 - 0.00793650793650776*G0_1_1;
+    A[105] = 0.027777777777778*G0_0_0 - 0.0727678571428577*G0_0_1 + 0.0141369047619049*G0_1_0 - 0.0611111111111115*G0_1_1;
+    A[106] = -0.017857142857143*G0_0_0 + 0.0532738095238099*G0_0_1 - 0.00942460317460321*G0_1_0 + 0.0438492063492066*G0_1_1;
+    A[107] = 0.011904761904762*G0_0_0 - 0.0216765873015873*G0_0_1 + 0.00570436507936508*G0_1_0 - 0.0174603174603175*G0_1_1;
+    A[108] = -0.027777777777778*G0_0_0 - 0.100545634920636*G0_0_1 - 0.0136408730158731*G0_1_0 - 0.0252976190476193*G0_1_1;
+    A[109] = 0.017857142857143*G0_0_0 + 0.0711309523809525*G0_0_1 + 0.00843253968253969*G0_1_0 + 0.0178571428571429*G0_1_1;
+    A[110] = -0.011904761904762*G0_0_0 - 0.033581349206349*G0_0_1 - 0.00620039682539683*G0_1_0 - 0.0104166666666665*G0_1_1;
+    A[111] = -0.0944444444444448*G0_0_0 - 0.0358134920634922*G0_0_1 - 0.0397817460317463*G0_1_0 - 0.0298611111111113*G0_1_1;
+    A[112] = 0.163095238095239*G0_0_0 + 0.0815476190476197*G0_0_1 + 0.0815476190476197*G0_1_0 + 0.0686507936507941*G0_1_1;
+    A[113] = -0.0944444444444449*G0_0_0 - 0.0586309523809528*G0_0_1 - 0.0546626984126986*G0_1_0 - 0.0487103174603177*G0_1_1;
+    A[114] = 0.134687005940287*G0_0_0 - 0.0799704097770483*G0_0_1 + 0.0659405133249319*G0_1_0 - 0.0701494822605687*G0_1_1;
+    A[115] = 0.103098262355288*G0_0_0 - 0.152069936974049*G0_0_1 + 0.102239110168991*G0_1_0 - 0.130591132316698*G0_1_1;
+    A[116] = -0.107142857142853*G0_0_0 + 0.0193452380952391*G0_0_1 - 0.0560515873015852*G0_1_0 + 0.0218253968253971*G0_1_1;
+    A[117] = 0.294627825494384*G0_0_1 + 0.0028059792904228*G0_1_0 + 0.148716902392403*G0_1_1;
+    A[118] = -0.206196524710575*G0_0_0 - 0.103098262355287*G0_0_1 - 0.103098262355288*G0_1_0 + 0.10825317547305*G0_1_1;
+    A[119] = -0.145833333333332*G0_0_1 + 0.00496031746031732*G0_1_0 - 0.070436507936508*G0_1_1;
+    A[120] = -0.0205853174603176*G0_0_0 + 0.0582093253968257*G0_0_1 - 0.00706845238095235*G0_1_0 + 0.0511408730158734*G0_1_1;
+    A[121] = 0.0252976190476193*G0_0_0 - 0.0752480158730165*G0_0_1 + 0.0116567460317461*G0_1_0 - 0.0611111111111117*G0_1_1;
+    A[122] = -0.0111607142857143*G0_0_0 + 0.0326636904761907*G0_0_1 - 0.00682043650793655*G0_1_0 + 0.0238591269841272*G0_1_1;
+    A[123] = 0.0131448412698413*G0_0_0 + 0.0438244047619049*G0_0_1 + 0.0043402777777777*G0_1_0 + 0.0111607142857143*G0_1_1;
+    A[124] = -0.0104166666666666*G0_0_0 - 0.033581349206349*G0_0_1 - 0.0062003968253968*G0_1_0 - 0.0119047619047618*G0_1_1;
+    A[125] = 0.0186011904761907*G0_0_0 + 0.0430803571428573*G0_0_1 + 0.00954861111111121*G0_1_0 + 0.0186011904761905*G0_1_1;
+    A[126] = 0.0447420634920634*G0_0_0 + 0.0223710317460317*G0_0_1 + 0.0223710317460318*G0_1_0 + 0.0176587301587302*G0_1_1;
+    A[127] = -0.0944444444444449*G0_0_0 - 0.0546626984126986*G0_0_1 - 0.0586309523809528*G0_1_0 - 0.0487103174603177*G0_1_1;
+    A[128] = 0.101289682539683*G0_0_0 + 0.0685019841269847*G0_0_1 + 0.0685019841269847*G0_1_0 + 0.0573412698412704*G0_1_1;
+    A[129] = -0.164149788489726*G0_0_0 - 0.0582240702762725*G0_0_1 - 0.0975077803421884*G0_1_0 - 0.0350747411302847*G0_1_1;
+    A[130] = -0.234548546858281*G0_0_0 - 0.0614293813200275*G0_0_1 - 0.167964252420488*G0_1_0 - 0.0420984571284106*G0_1_1;
+    A[131] = 0.221726190476184*G0_0_0 + 0.0994543650793629*G0_0_1 + 0.125248015873011*G0_1_0 + 0.0510912698412686*G0_1_1;
+    A[132] = -0.0420896893563415*G0_0_0 - 0.195015560684376*G0_0_1 - 0.0154328860973252*G0_1_0 - 0.0897913372935258*G0_1_1;
+    A[133] = 0.103098262355287*G0_0_0 + 0.0876335230019947*G0_0_1 + 0.0257745655888211*G0_1_0 - 0.0463942180598778*G0_1_1;
+    A[134] = -0.0744047619047606*G0_0_0 - 0.0590277777777774*G0_0_1 - 0.0272817460317457*G0_1_0 - 0.00396825396825447*G0_1_1;
+    A[135] = 0.0434926790015496*G0_0_0 - 0.0624330392119039*G0_0_1 - 0.0231493291459878*G0_1_0 + 0.0350747411302844*G0_1_1;
+    A[136] = -0.0785674201318346*G0_0_0 + 0.136089995585501*G0_0_1 - 0.0098209275164796*G0_1_0 + 0.070149482260569*G0_1_1;
+    A[137] = 0.124866078423811*G0_0_0 - 0.128373552536838*G0_0_1 + 0.0119254119842967*G0_1_0 - 0.0350747411302846*G0_1_1;
+    A[138] = -0.0785674201318343*G0_0_0 - 0.152925871328036*G0_0_1 + 0.0266568032590162*G0_1_0 + 0.0420896893563413*G0_1_1;
+    A[139] = 0.148716902392404*G0_0_0 + 0.294627825494385*G0_0_1 + 0.00280597929042272*G0_1_0;
+    A[140] = -0.0897913372935264*G0_0_0 - 0.195015560684377*G0_0_1 - 0.0154328860973252*G0_1_0 - 0.0420896893563414*G0_1_1;
+    A[141] = -0.206239477846068*G0_0_0 - 0.0932988114065536*G0_0_1 + 0.0470001531145811*G0_1_0 + 0.0350747411302843*G0_1_1;
+    A[142] = 0.134687005940287*G0_0_0 + 0.0659405133249319*G0_0_1 - 0.0799704097770483*G0_1_0 - 0.0701494822605687*G0_1_1;
+    A[143] = -0.164149788489726*G0_0_0 - 0.0975077803421885*G0_0_1 - 0.0582240702762725*G0_1_0 - 0.0350747411302847*G0_1_1;
+    A[144] = 4.92063492063456*G0_0_0 + 0.198412698412687*G0_0_1 + 0.198412698412687*G0_1_0 + 0.396825396825376*G0_1_1;
+    A[145] = 0.0243004934799667*G0_0_0 - 0.0607512336999668*G0_0_1 + 0.230854688059914*G0_1_0 + 0.607512336999764*G0_1_1;
+    A[146] = -0.519106168728166*G0_0_0 - 0.806719045996499*G0_0_1 - 0.301642773720431*G0_1_0 - 0.350747411302834*G0_1_1;
+    A[147] = -0.198412698412689*G0_0_0 + 4.30555555555523*G0_0_1 + 0.0198412698412685*G0_1_0 - 0.198412698412688*G0_1_1;
+    A[148] = -0.218704441319894*G0_0_0 - 0.0364507402199852*G0_0_1 + 0.255155181539902*G0_1_0 - 0.218704441319912*G0_1_1;
+    A[149] = -0.350747411302835*G0_0_0 + 0.540151013406351*G0_0_1 + 0.0350747411302833*G0_1_0 + 0.322687618398612*G0_1_1;
+    A[150] = 0.0652955661583499*G0_0_0 - 0.127154523571519*G0_0_1 - 0.0515491311776441*G0_1_0 + 0.0652955661583485*G0_1_1;
+    A[151] = -0.0532674355502333*G0_0_0 + 0.183858567866929*G0_0_1 - 0.00859152186294125*G0_1_0 + 0.0841969142568198*G0_1_1;
+    A[152] = -0.00343660874517726*G0_0_0 - 0.0515491311776428*G0_0_1 - 0.0171830437258809*G0_1_0 - 0.00343660874517665*G0_1_1;
+    A[153] = -0.035225239638056*G0_0_0 + 0.0210492285642031*G0_0_1 + 0.0794715772322013*G0_1_0 + 0.115985545149699*G0_1_1;
+    A[154] = -0.00687321749035451*G0_0_0 - 0.177844502562873*G0_0_1 - 0.0472533702461734*G0_1_0 - 0.103098262355288*G0_1_1;
+    A[155] = -0.0266337177751165*G0_0_0 - 0.00730279358350014*G0_0_1 - 0.0107394023286764*G0_1_0 - 0.0128872827944119*G0_1_1;
+    A[156] = 0.131450284502994*G0_0_0 - 0.0107394023286738*G0_0_1 + 0.157654426184961*G0_1_0 + 0.103957414541582*G0_1_1;
+    A[157] = 0.103098262355288*G0_0_0 + 0.102239110168991*G0_0_1 - 0.152069936974049*G0_1_0 - 0.130591132316698*G0_1_1;
+    A[158] = -0.234548546858281*G0_0_0 - 0.167964252420488*G0_0_1 - 0.0614293813200275*G0_1_0 - 0.0420984571284106*G0_1_1;
+    A[159] = 0.0243004934799664*G0_0_0 + 0.230854688059914*G0_0_1 - 0.0607512336999667*G0_1_0 + 0.607512336999764*G0_1_1;
+    A[160] = 5.41666666666634*G0_0_0 + 0.431547619047605*G0_0_1 + 0.431547619047605*G0_1_0 + 1.13095238095232*G0_1_1;
+    A[161] = -0.189013480984696*G0_0_0 - 0.0687321749035197*G0_0_1 - 0.274928699614086*G0_1_0 - 0.18901348098469*G0_1_1;
+    A[162] = 0.170103454359941*G0_0_0 + 0.44955912937981*G0_0_1 + 0.157953207619939*G0_1_0 - 0.413108389159829*G0_1_1;
+    A[163] = -0.401785714285695*G0_0_0 + 3.59374999999975*G0_0_1 + 0.558035714285685*G0_1_0 - 0.401785714285686*G0_1_1;
+    A[164] = 0.300703265202927*G0_0_0 + 0.176126198190279*G0_0_1 + 0.279224460545564*G0_1_0 + 0.300703265202922*G0_1_1;
+    A[165] = -0.0168650793650805*G0_0_0 + 0.0719246031746001*G0_0_1 - 0.00744047619047574*G0_1_0 - 0.010912698412699*G0_1_1;
+    A[166] = -0.00496031746031421*G0_0_0 - 0.162698412698406*G0_0_1 + 0.0198412698412687*G0_1_0 - 0.102182539682537*G0_1_1;
+    A[167] = 0.100198412698408*G0_0_0 + 0.102678571428568*G0_0_1 - 0.0719246031746013*G0_1_0 + 0.118055555555554*G0_1_1;
+    A[168] = -0.0451388888888868*G0_0_0 + 0.00570436507936466*G0_0_1 + 0.0434027777777768*G0_1_0 + 0.0520833333333315*G0_1_1;
+    A[169] = 0.128968253968249*G0_0_0 - 0.0163690476190464*G0_0_1 - 0.0917658730158708*G0_1_0 - 0.178571428571424*G0_1_1;
+    A[170] = -0.038194444444441*G0_0_0 + 0.105406746031745*G0_0_1 + 0.0359623015873003*G0_1_0 + 0.126488095238092*G0_1_1;
+    A[171] = 0.147321428571423*G0_0_0 + 0.0493551587301574*G0_0_1 + 0.106894841269839*G0_1_0 + 0.0560515873015864*G0_1_1;
+    A[172] = -0.107142857142853*G0_0_0 - 0.0560515873015852*G0_0_1 + 0.0193452380952391*G0_1_0 + 0.0218253968253971*G0_1_1;
+    A[173] = 0.221726190476184*G0_0_0 + 0.125248015873011*G0_0_1 + 0.0994543650793629*G0_1_0 + 0.0510912698412686*G0_1_1;
+    A[174] = -0.519106168728166*G0_0_0 - 0.301642773720431*G0_0_1 - 0.806719045996499*G0_1_0 - 0.350747411302834*G0_1_1;
+    A[175] = -0.189013480984695*G0_0_0 - 0.274928699614086*G0_0_1 - 0.0687321749035197*G0_1_0 - 0.18901348098469*G0_1_1;
+    A[176] = 5.55555555555519*G0_0_0 + 0.59027777777774*G0_0_1 + 0.59027777777774*G0_1_0 + 0.912698412698369*G0_1_1;
+    A[177] = -0.350747411302834*G0_0_0 - 0.301642773720424*G0_0_1 + 0.203433498555643*G0_1_0 - 0.0140298964520956*G0_1_1;
+    A[178] = 0.0773236967664676*G0_0_0 + 0.167534676327336*G0_0_1 + 0.0644364139720522*G0_1_0 + 0.0773236967664676*G0_1_1;
+    A[179] = -0.620039682539652*G0_0_0 + 3.39533730158706*G0_0_1 + 0.359623015872998*G0_1_0 - 0.620039682539661*G0_1_1;
+    A[180] = 0.0350747411302842*G0_0_0 - 0.0119254119842968*G0_0_1 + 0.128373552536838*G0_1_0 - 0.12486607842381*G0_1_1;
+    A[181] = -0.0701494822605686*G0_0_0 + 0.00982092751647975*G0_0_1 - 0.136089995585501*G0_1_0 + 0.0785674201318344*G0_1_1;
+    A[182] = -0.0350747411302846*G0_0_0 + 0.0231493291459878*G0_0_1 + 0.0624330392119044*G0_1_0 - 0.0434926790015495*G0_1_1;
+    A[183] = 0.0350747411302846*G0_0_0 + 0.0470001531145812*G0_0_1 - 0.0932988114065537*G0_1_0 - 0.206239477846068*G0_1_1;
+    A[184] = -0.0701494822605691*G0_0_0 - 0.0799704097770486*G0_0_1 + 0.0659405133249323*G0_1_0 + 0.134687005940287*G0_1_1;
+    A[185] = -0.0350747411302842*G0_0_0 - 0.058224070276272*G0_0_1 - 0.0975077803421885*G0_1_0 - 0.164149788489726*G0_1_1;
+    A[186] = 0.0420896893563413*G0_0_0 + 0.0266568032590162*G0_0_1 - 0.152925871328036*G0_1_0 - 0.0785674201318339*G0_1_1;
+    A[187] = 0.0028059792904228*G0_0_1 + 0.294627825494384*G0_1_0 + 0.148716902392403*G0_1_1;
+    A[188] = -0.0420896893563415*G0_0_0 - 0.0154328860973252*G0_0_1 - 0.195015560684376*G0_1_0 - 0.0897913372935258*G0_1_1;
+    A[189] = -0.198412698412689*G0_0_0 + 0.0198412698412685*G0_0_1 + 4.30555555555523*G0_1_0 - 0.198412698412688*G0_1_1;
+    A[190] = 0.170103454359941*G0_0_0 + 0.157953207619939*G0_0_1 + 0.44955912937981*G0_1_0 - 0.413108389159829*G0_1_1;
+    A[191] = -0.350747411302834*G0_0_0 + 0.203433498555643*G0_0_1 - 0.301642773720424*G0_1_0 - 0.0140298964520956*G0_1_1;
+    A[192] = 0.396825396825375*G0_0_0 + 0.198412698412687*G0_0_1 + 0.198412698412687*G0_1_0 + 4.92063492063457*G0_1_1;
+    A[193] = -0.145802960879936*G0_0_1 - 0.729014804399697*G0_1_0 - 0.437408882639821*G0_1_1;
+    A[194] = 0.701494822605664*G0_0_0 + 0.35074741130283*G0_0_1 + 0.350747411302829*G0_1_0 + 0.280597929042237*G0_1_1;
+    A[195] = -0.100520805796406*G0_0_0 + 0.0708800553692599*G0_0_1 - 0.0631476856926133*G0_1_0 - 0.0850560664431109*G0_1_1;
+    A[196] = 0.0463942180598789*G0_0_0 - 0.0128872827944101*G0_0_1 + 0.0489716746187603*G0_1_0 + 0.0309294787065848*G0_1_1;
+    A[197] = -0.0231971090299392*G0_0_0 + 0.0322182069860272*G0_0_1 + 0.00128872827944068*G0_1_0 - 0.0180421959121743*G0_1_1;
+    A[198] = 0.100520805796406*G0_0_0 + 0.171400861165666*G0_0_1 + 0.0373731201037927*G0_1_0 + 0.193309241916163*G0_1_1;
+    A[199] = -0.0463942180598792*G0_0_0 - 0.0592815008542891*G0_0_1 + 0.00257745655888091*G0_1_0 - 0.0412393049421138*G0_1_1;
+    A[200] = 0.023197109029939*G0_0_0 + 0.0554153160159659*G0_0_1 + 0.0244858373093799*G0_1_0 + 0.0747462402075819*G0_1_1;
+    A[201] = 0.103098262355287*G0_0_0 + 0.077323696766466*G0_0_1 + 0.015464739353292*G0_1_0 - 0.0567040442954068*G0_1_1;
+    A[202] = -0.206196524710575*G0_0_0 - 0.103098262355288*G0_0_1 - 0.103098262355287*G0_1_0 + 0.10825317547305*G0_1_1;
+    A[203] = 0.103098262355287*G0_0_0 + 0.0257745655888211*G0_0_1 + 0.0876335230019947*G0_1_0 - 0.0463942180598778*G0_1_1;
+    A[204] = -0.218704441319894*G0_0_0 + 0.255155181539902*G0_0_1 - 0.0364507402199852*G0_1_0 - 0.218704441319912*G0_1_1;
+    A[205] = -0.401785714285695*G0_0_0 + 0.558035714285685*G0_0_1 + 3.59374999999975*G0_1_0 - 0.401785714285686*G0_1_1;
+    A[206] = 0.0773236967664676*G0_0_0 + 0.0644364139720522*G0_0_1 + 0.167534676327336*G0_1_0 + 0.0773236967664676*G0_1_1;
+    A[207] = -0.729014804399697*G0_0_1 - 0.145802960879936*G0_1_0 - 0.437408882639821*G0_1_1;
+    A[208] = 0.803571428571388*G0_0_0 + 0.401785714285693*G0_0_1 + 0.401785714285693*G0_1_0 + 5.3571428571425*G0_1_1;
+    A[209] = -0.0515491311776324*G0_0_1 - 0.257745655888198*G0_1_0 - 0.154647393532917*G0_1_1;
+    A[210] = 0.0620039682539666*G0_0_0 - 0.0210813492063489*G0_0_1 + 0.0959821428571385*G0_1_0 + 0.0530753968253965*G0_1_1;
+    A[211] = -0.124007936507934*G0_0_0 + 0.017361111111111*G0_0_1 - 0.240575396825388*G0_1_0 + 0.0436507936507942*G0_1_1;
+    A[212] = -0.0620039682539675*G0_0_0 + 0.0409226190476184*G0_0_1 + 0.146081349206343*G0_1_0 - 0.0649801587301586*G0_1_1;
+    A[213] = 0.0620039682539676*G0_0_0 + 0.0830853174603165*G0_0_1 - 0.0339781746031716*G0_1_0 + 0.0401785714285732*G0_1_1;
+    A[214] = -0.124007936507935*G0_0_0 - 0.141369047619046*G0_0_1 + 0.116567460317454*G0_1_0 + 0.142857142857138*G0_1_1;
+    A[215] = -0.0620039682539666*G0_0_0 - 0.102926587301585*G0_0_1 - 0.208085317460309*G0_1_0 - 0.313988095238087*G0_1_1;
+    A[216] = 0.0744047619047609*G0_0_0 + 0.0471230158730152*G0_0_1 + 0.0153769841269828*G0_1_0 - 0.00793650793650778*G0_1_1;
+    A[217] = 0.00496031746031731*G0_0_1 - 0.145833333333332*G0_1_0 - 0.070436507936508*G0_1_1;
+    A[218] = -0.0744047619047606*G0_0_0 - 0.0272817460317457*G0_0_1 - 0.0590277777777774*G0_1_0 - 0.00396825396825447*G0_1_1;
+    A[219] = -0.350747411302835*G0_0_0 + 0.0350747411302833*G0_0_1 + 0.540151013406351*G0_1_0 + 0.322687618398612*G0_1_1;
+    A[220] = 0.300703265202927*G0_0_0 + 0.279224460545564*G0_0_1 + 0.176126198190279*G0_1_0 + 0.300703265202923*G0_1_1;
+    A[221] = -0.620039682539652*G0_0_0 + 0.359623015872998*G0_0_1 + 3.39533730158706*G0_1_0 - 0.620039682539661*G0_1_1;
+    A[222] = 0.701494822605664*G0_0_0 + 0.350747411302829*G0_0_1 + 0.35074741130283*G0_1_0 + 0.280597929042237*G0_1_1;
+    A[223] = -0.257745655888198*G0_0_1 - 0.0515491311776325*G0_1_0 - 0.154647393532917*G0_1_1;
+    A[224] = 1.2400793650793*G0_0_0 + 0.620039682539646*G0_0_1 + 0.620039682539646*G0_1_0 + 5.61507936507903*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class forms_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  forms_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~forms_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "ffa803179a5009c4f5acc025304c37aa9ba384919db339a256259a982cbf9e4a908a05501076706ba508ac0d64351f3a0fbf9e358ae62257ba04ce7d5e32c00e";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new forms_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new forms_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new forms_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new forms_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new forms_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class forms_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  forms_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~forms_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "76d82507e90d53c620c1245ab45dd5ef3926d3fc33b21f12877cb7da2d4d206d049ca9cef8ed9963bbb445e1bceb43163a731e06ad6acdaf73235620b72c03c3";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new forms_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new forms_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new forms_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new forms_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new forms_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Forms
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new forms_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new forms_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_L_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new forms_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new forms_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new forms_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new forms_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/demo/undocumented/waveguide/cpp/Forms.py b/demo/undocumented/waveguide/cpp/Forms.py
new file mode 100644
index 0000000..8d53959
--- /dev/null
+++ b/demo/undocumented/waveguide/cpp/Forms.py
@@ -0,0 +1,46 @@
+# Copyright (C) 2008 Evan Lezar
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Forms for solving the transverse magnetic (TM) cutoff modes of a waveguide
+#
+# Compile this form with FFC: ffc -l dolfin Forms.form
+
+from ufl import *
+from ufl.log import set_level
+from ffc.compiler.compiler import compile
+
+# Set debug level
+set_level(20)
+
+# Reserved variables for forms
+(a, L, M) = (None, None, None)
+
+# Reserved variable for element
+element = None
+
+element = FiniteElement("Nedelec 1st kind H(curl)", "triangle", 2)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+def curl_t(w):
+    return Dx(w[1], 0) - Dx(w[0], 1)
+
+a = curl_t(v)*curl_t(u)*dx
+L = inner(v, u)*dx
+
+compile([a, L, M, element], "Forms", {'log_level': 20, 'format': 'dolfin', 'form_postfix': True, 'quadrature_order': 'auto', 'precision': '15', 'cpp optimize': False, 'split_implementation': False, 'cache_dir': None, 'output_dir': '.', 'representation': 'auto', 'optimize': True}, globals())
diff --git a/demo/undocumented/waveguide/cpp/Forms.ufl b/demo/undocumented/waveguide/cpp/Forms.ufl
new file mode 100644
index 0000000..80c52b9
--- /dev/null
+++ b/demo/undocumented/waveguide/cpp/Forms.ufl
@@ -0,0 +1,31 @@
+# Copyright (C) 2008 Evan Lezar
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Forms for solving the transverse magnetic (TM) cutoff modes of a waveguide
+#
+# Compile this form with FFC: ffc -l dolfin Forms.form
+
+element = FiniteElement("Nedelec 1st kind H(curl)", triangle, 3)
+
+u = TrialFunction(element)
+v = TestFunction(element)
+
+def curl_t(w):
+    return Dx(w[1], 0) - Dx(w[0], 1)
+
+a = curl_t(u)*curl_t(v)*dx
+L = inner(u, v)*dx
diff --git a/demo/undocumented/waveguide/cpp/compile.log b/demo/undocumented/waveguide/cpp/compile.log
new file mode 100644
index 0000000..c7831a5
--- /dev/null
+++ b/demo/undocumented/waveguide/cpp/compile.log
@@ -0,0 +1,1249 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Forms
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'N1curl3(?)'
+  Unique sub elements:    'N1curl3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 4
+  representation:    auto --> quadrature
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'N1curl3(?)'
+  Unique sub elements:    'N1curl3(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 6
+  quadrature_degree: auto --> 6
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0654829 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing quadrature representation
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  
+  QG-utils, psi_tables:
+  {6: {VectorElement('Lagrange', Domain(Cell('triangle', 2), label=None, data=None), 1, dim=2, quad_scheme=None): {None: {None: {(0, 1): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]]]), (1, 0): array([[[-1., -1., -1., -1., -1., -1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 1.,  1.,  1.,  1.,  1.,  1.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [-1., -1., -1., -1., -1., -1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 1.,  1.,  1.,  1.,  1.,  1.]],
+  
+         [[ 0.,  0.,  0.,  0.,  0.,  0.],
+          [ 0.,  0.,  0.,  0.,  0.,  0.]]]), (0, 0): array([[[ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849],
+          [ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.09157621,  0.81684757,  0.44594849,  0.44594849,
+            0.10810302]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.81684757,  0.09157621,  0.09157621,  0.10810302,  0.44594849,
+            0.44594849]],
+  
+         [[ 0.        ,  0.        ,  0.        ,  0.        ,  0.        ,
+            0.        ],
+          [ 0.09157621,  0.81684757,  0.09157621,  0.44594849,  0.10810302,
+            0.44594849]]])}}}, FiniteElement('Nedelec 1st kind H(curl)', Domain(Cell('triangle', 2), label=None, data=None), 3, quad_scheme=None): {None: {None: {(0, 1): array([[[-2.8427847794918146, -1.7907476897548973, -0.73072715891173889,
+           0.56545274029199499, 0.79373186720449285, -0.95713849588396949],
+          [2.9621807486793523, 0.13283520973481244, -0.46492323407186542,
+           -0.18261057639232881, -0.3013233574694234, 1.0546317511429952]],
+  
+         [[2.6013316940813116, 5.7574429632920721, 0.36974459894346978,
+           -0.67142057142433176, 0.013416809313154587, -2.1460884611138527],
+          [5.9243614973586833, -0.92984646814372818, 0.26567041946964198,
+           -0.36522115278465861, 2.1092635022859976, -0.6026467149388548]],
+  
+         [[-0.63275387137770478, -10.10108767901, -1.1507889751399314,
+           2.0890186793857395, 0.034506537173266238, -0.0042703740714600258],
+          [-2.9621807486793381, 1.4611873070830139, -1.1290992827459641,
+           0.18261057639232903, -3.3145569321637232, 2.5612485384901498]],
+  
+         [[1.8598264416577144, 4.7529284384342585, 1.3815974724087905,
+           -1.6041100426061892, -0.9763424435968211, 2.7491041918717314],
+          [0.24411423244589453, 4.2530097767913579, -5.7573094579218278,
+           -0.55374866553464375, 0.81135287831948921, 2.6010001526526625]],
+  
+         [[-0.63541501841311776, -11.681804460650797, -1.6714852259375714,
+           2.7487351760527234, 0.3518043434715028, -1.437842930861672],
+          [-1.1768364061026659e-14, -10.010319234713194, 10.01031923471316,
+           3.3306690738754696e-15, 1.7896472743331635, -1.7896472743331682]],
+  
+         [[1.6157122092117984, 7.1389069303306414, 0.49991866164287968,
+           -1.0503613770715445, 0.14810403921906223, -1.7876953219163045],
+          [-0.24411423244589225, 5.7573094579218447, -4.2530097767913411,
+           0.55374866553464019, -2.6010001526526652, -0.81135287831948866]],
+  
+         [[2.3294268773016422, -0.021689692393989102, -11.562274986092966,
+           1.906408102993409, -2.5655189125616049, 3.3490634693369841],
+          [2.9621807486793457, 1.1290992827459692, -1.4611873070830113,
+           -0.18261057639232869, -2.5612485384901533, 3.3145569321637209]],
+  
+         [[-3.3230298032773584, 0.10407417947384556, 6.6872894314357882,
+           -0.30619941863967459, -1.5434417461750041, -2.0958466929728408],
+          [-5.9243614973586904, -0.26567041946963721, 0.92984646814373439,
+           0.36522115278465633, 0.60264671493885491, -2.109263502285998]],
+  
+         [[-5.8049655281711541, -0.26580392483987536, -1.9235828994896984,
+           0.74806331668432002, -2.0117702470269663, 1.0950552246739169],
+          [-2.9621807486793563, 0.46492323407186209, -0.13283520973482066,
+           0.18261057639233147, -1.0546317511429981, 0.30132335746942551]],
+  
+         [[16.756624755930606, -16.83189336050966, 14.95331980883304,
+           -1.0330014150671394, 19.692601753220746, -15.431245965290266],
+          [33.513249511861382, -1.8785735516764897, -1.8785735516764719,
+           -2.0660028301343281, 4.2613557879304711, 4.2613557879304658]],
+  
+         [[28.250337550111205, 0.91761218704344683, -30.970567403201986,
+           15.171423306557839, 9.2405576147593997, 2.3212143076612191],
+          [51.306475579148668, 2.3007733229476903, -8.0527066303168073,
+           -3.1629079631094097, -5.2190736464427525, 18.266757762549506]],
+  
+         [[-10.312595005821199, -25.933482529750144, -19.478002335487815,
+           29.929887517939225, -13.077289185765691, 18.036697707450578],
+          [-29.621807486792424, 10.626816778785221, -7.3059365354148227,
+           1.8261057639232279, -24.105868597553563, 16.57278466081808]],
+  
+         [[-5.5604520504505954, 16.756624755930776, 3.6818784987741173,
+           -5.8755329743621445, -1.0330014150671689, 10.136888762292593],
+          [-16.756624755930716, -1.8785735516765287, 3.7571471033529984,
+           1.0330014150671647, 4.2613557879305155, -8.5227115758609848]],
+  
+         [[17.117522665955445, 3.451159984421619, 6.7640427126908378,
+           -4.8631776237648996, -7.8286104696640955, 18.622653785227406],
+          [-23.010045610320027, 4.3226797527477281, 7.7738397371691734,
+           6.9077063614820471, 12.83857205328046, 5.0099615836164393]],
+  
+         [[-9.8295833783406206, 29.621807486792584, 6.5087031349702826,
+           -10.386573023141594, -1.8261057639232379, 17.919656959877031],
+          [19.389046892033374, 2.1736925672156486, 12.136333297326804,
+           8.3122868540072048, 34.289993391692498, 11.690741581485989]]], dtype=object), (1, 0): array([[[-1.4611873070830135, 2.9621807486793235, 1.1290992827459674,
+           3.3145569321637263, -0.18261057639232905, -2.5612485384901538],
+          [10.101087679010009, 0.632753871377701, 1.1507889751399325,
+           -0.03450653717326059, -2.0890186793857417, 0.0042703740714476607]],
+  
+         [[0.92984646814373506, -5.9243614973586851, -0.26567041946964393,
+           -2.1092635022860078, 0.36522115278465922, 0.60264671493886224],
+          [-5.7574429632921049, -2.6013316940813129, -0.36974459894346984,
+           -0.013416809313161443, 0.67142057142433664, 2.1460884611138731]],
+  
+         [[-0.13283520973482055, -2.9621807486793488, 0.46492323407187053,
+           0.30132335746943573, 0.18261057639232911, -1.0546317511430061],
+          [1.7907476897549031, 2.8427847794918213, 0.73072715891173945,
+           -0.79373186720448863, -0.56545274029199444, 0.95713849588395727]],
+  
+         [[1.1290992827459649, 2.9621807486793714, -1.4611873070830126,
+           -2.561248538490152, -0.18261057639232969, 3.314556932163724],
+          [-0.021689692393999725, 2.3294268773016489, -11.562274986092961,
+           -2.5655189125616067, 1.9064081029934079, 3.3490634693369845]],
+  
+         [[-0.2656704194696396, -5.9243614973587047, 0.92984646814373739,
+           0.60264671493886302, 0.36522115278465828, -2.1092635022860087],
+          [0.10407417947385125, -3.3230298032773646, 6.6872894314357927,
+           -1.5434417461750063, -0.30619941863967409, -2.0958466929728479]],
+  
+         [[0.46492323407186609, -2.9621807486793408, -0.13283520973482263,
+           -1.0546317511430037, 0.1826105763923295, 0.30132335746943029],
+          [-0.26580392483989607, -5.8049655281711541, -1.9235828994897004,
+           -2.0117702470269636, 0.74806331668432369, 1.0950552246739211]],
+  
+         [[4.2530097767913473, 0.24411423244590091, -5.7573094579218251,
+           0.81135287831949832, -0.55374866553464264, 2.601000152652658],
+          [4.7529284384342443, 1.8598264416577233, 1.3815974724087847,
+           -0.97634244359681943, -1.6041100426061845, 2.7491041918717243]],
+  
+         [[-10.010319234713181, 1.4535274179881872e-15, 10.010319234713164,
+           1.7896472743331697, 1.1830772254640687e-15, -1.7896472743331613],
+          [-11.681804460650792, -0.63541501841312042, -1.6714852259375645,
+           0.35180434347149725, 2.748735176052719, -1.4378429308616605]],
+  
+         [[5.7573094579218331, -0.24411423244590003, -4.2530097767913357,
+           -2.6010001526526674, 0.55374866553463986, -0.81135287831949876],
+          [7.138906930330652, 1.6157122092118068, 0.4999186616428769,
+           0.14810403921906834, -1.0503613770715436, -1.7876953219163214]],
+  
+         [[-1.8785735516764903, -16.756624755930773, 3.7571471033529735,
+           4.2613557879304809, 1.033001415067166, -8.5227115758609724],
+          [16.756624755930712, -5.5604520504506061, 3.6818784987741004,
+           -1.03300141506717, -5.8755329743621276, 10.136888762292616]],
+  
+         [[4.0438128596000427, 5.2863843585085775, 14.397292812864555,
+           36.11529139944647, 10.652504759854693, 12.62945999045416],
+          [27.378817781785102, 0.046092418717460504, 9.0187236169210934,
+           -5.4957592163867526, -11.42662490818517, 24.830205046969827]],
+  
+         [[2.6567041946962977, -29.621807486792413, 0.6641760486740762,
+           -6.0264671493883482, 1.826105763923227, -1.5066167873471024],
+          [-11.822111524362853, 19.739001167743737, 2.6034812539881287,
+           -5.866722661100324, 0.98165114627436445, 7.16786278395083]],
+  
+         [[-1.8785735516764914, 33.513249511861403, -1.8785735516764686,
+           4.2613557879304729, -2.0660028301343369, 4.2613557879304755],
+          [-16.831893360509522, 16.756624755930613, 14.953319808833053,
+           19.69260175322076, -1.0330014150671754, -15.43124596529028]],
+  
+         [[10.353479953264523, 1.7871399756601309e-13, -10.353479953264548,
+           -23.485831408992297, -2.0255612133378404e-15, 23.485831408992283],
+          [-22.000248585841845, 5.1941995210739442, -32.353728539106015,
+           -6.7049858401289226, 33.505754576225037, 16.780845568863352]],
+  
+         [[-3.3208802433703526, 59.243614973584883, -3.3208802433703704,
+           7.5330839367354319, -3.652211527846462, 7.5330839367354905],
+          [13.761416729676984, 29.621807486792356, -17.082296973047281,
+           14.541202232398234, -1.8261057639232343, -7.0081182956627668]]], dtype=object), (0, 0): array([[[-0.22572700066794837, -0.16128786333934439, -0.10530003423051545,
+           0.015661083139564554, 0.083751639946537754, 0.14291199833236701],
+          [0.60716808047250814, 0.12609448040868795, 0.24652144684612062,
+           0.13571724021440501, -0.37261621444437321, -0.24536529925157022]],
+  
+         [[0.33258764579152805, 0.59689270626796376, 0.091733712916662935,
+           -0.17581224710182836, 0.10346956020990222, -0.43031407748743383],
+          [-0.59689270626796598, -0.33258764579152861, -0.091733712916663074,
+           -0.10346956020990383, 0.17581224710183022, 0.43031407748743539]],
+  
+         [[-0.12609448040868837, -0.6071680804725077, -0.24652144684612076,
+           0.37261621444437226, -0.1357172402144039, 0.24536529925156972],
+          [0.1612878633393455, 0.22572700066794893, 0.1053000342305148,
+           -0.083751639946537046, -0.015661083139565025, -0.14291199833236792]],
+  
+         [[0.10530003423051591, 0.16128786333934764, 0.22572700066794749,
+           -0.14291199833236742, -0.083751639946537559, -0.015661083139564498],
+          [0.35182148107663441, 0.28738234374803584, 0.83289508114044597,
+           -0.38827729758393731, -0.45636785439090988, 0.12005615707484001]],
+  
+         [[-0.091733712916663199, -0.59689270626796964, -0.33258764579152772,
+           0.4303140774874345, -0.10346956020990272, 0.17581224710182863],
+          [-0.18346742583332418, -0.92948035205949608, -0.92948035205948654,
+           0.86062815497486922, 0.072342686891925939, 0.072342686891925079]],
+  
+         [[0.24652144684612071, 0.60716808047250459, 0.12609448040868845,
+           -0.2453652992515695, 0.13571724021440401, -0.37261621444437226],
+          [0.35182148107663369, 0.83289508114045119, 0.28738234374803107,
+           -0.38827729758393759, 0.12005615707484055, -0.45636785439090943]],
+  
+         [[0.28738234374803473, 0.35182148107663602, 0.83289508114044541,
+           -0.45636785439091054, -0.38827729758393714, 0.12005615707483971],
+          [0.16128786333934814, 0.10530003423051638, 0.2257270006679471,
+           -0.083751639946537421, -0.14291199833236723, -0.015661083139564921]],
+  
+         [[-0.92948035205949597, -0.18346742583332576, -0.92948035205948687,
+           0.072342686891925523, 0.86062815497486933, 0.072342686891926578],
+          [-0.59689270626797053, -0.09173371291666331, -0.33258764579152744,
+           -0.10346956020990319, 0.43031407748743505, 0.17581224710182911]],
+  
+         [[0.8328950811404503, 0.3518214810766363, 0.28738234374803129,
+           0.12005615707484055, -0.38827729758393725, -0.45636785439091127],
+          [0.60716808047250603, 0.24652144684612159, 0.12609448040868801,
+           0.13571724021440498, -0.24536529925157058, -0.37261621444437321]],
+  
+         [[2.2343700072011208, 0.87189441351102093, 1.553132210356081,
+           4.1759861457662701, 2.7363063850459128, 3.4561462654060917],
+          [1.5865780911283878e-14, -0.68123779684504515, 0.68123779684504027,
+           -9.0205620750793969e-16, -0.71983988036017388, 0.7198398803601761]],
+  
+         [[2.8959192737801374, 0.17797470189043602, -3.7914836168253734,
+           -4.2197173436554172, 0.55854620194017246, 4.0143794449943764],
+          [-0.17797470189041492, -0.59514595083247079, 1.4907102938777024,
+           -0.55854620194017512, -0.99935630278730037, 1.2046942014483473]],
+  
+         [[-1.8774672563591612, 6.2021058945578158, -3.081736920733444,
+           1.7913013441735806, -2.9218682633538329, 0.5187921922455988],
+          [-0.30826122613616835, 1.3777163039878508, 0.17344663961355347,
+           -0.96743040013500892, 0.81408241256416869, -0.45842673936381911]],
+  
+         [[-0.68123779684504371, 1.6671699198784318e-14, 0.68123779684504104,
+           -0.71983988036017554, 1.655219941516346e-15, 0.71983988036017366],
+          [0.87189441351102714, 2.2343700072011221, 1.553132210356083,
+           2.7363063850459195, 4.1759861457662666, 3.4561462654060913]],
+  
+         [[0.89556434304524446, -0.35594940378087159, 0.8955643430452398,
+           0.20533789866104202, -1.1170924038803507, 0.20533789866104202],
+          [5.4601686125934874, -0.17797470189043055, -4.5646042695482745,
+           -2.2511390416058537, -0.55854620194017346, 2.4564769402668953]],
+  
+         [[-1.2042696643742827, 3.0458070564197476e-14, 1.2042696643742832,
+           -1.2725091519279852, 1.2485855805667669e-16, 1.2725091519279812],
+          [-2.9469223342108184, 3.4466732865821634, -1.7426526698365508,
+           1.9446493317444236, -4.5500330884821736, 3.2171584836724074]]], dtype=object)}}}}}
+  
+  QG-utils, psi_tables, flat_tables:
+  {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[-0.22572700066794837, 0.33258764579152805, -0.12609448040868837,
+          0.10530003423051591, -0.091733712916663199, 0.24652144684612071,
+          0.28738234374803473, -0.92948035205949597, 0.8328950811404503,
+          2.2343700072011208, 2.8959192737801374, -1.8774672563591612,
+          -0.68123779684504371, 0.89556434304524446, -1.2042696643742827],
+         [-0.16128786333934439, 0.59689270626796376, -0.6071680804725077,
+          0.16128786333934764, -0.59689270626796964, 0.60716808047250459,
+          0.35182148107663602, -0.18346742583332576, 0.3518214810766363,
+          0.87189441351102093, 0.17797470189043602, 6.2021058945578158,
+          1.6671699198784318e-14, -0.35594940378087159,
+          3.0458070564197476e-14],
+         [-0.10530003423051545, 0.091733712916662935, -0.24652144684612076,
+          0.22572700066794749, -0.33258764579152772, 0.12609448040868845,
+          0.83289508114044541, -0.92948035205948687, 0.28738234374803129,
+          1.553132210356081, -3.7914836168253734, -3.081736920733444,
+          0.68123779684504104, 0.8955643430452398, 1.2042696643742832],
+         [0.015661083139564554, -0.17581224710182836, 0.37261621444437226,
+          -0.14291199833236742, 0.4303140774874345, -0.2453652992515695,
+          -0.45636785439091054, 0.072342686891925523, 0.12005615707484055,
+          4.1759861457662701, -4.2197173436554172, 1.7913013441735806,
+          -0.71983988036017554, 0.20533789866104202, -1.2725091519279852],
+         [0.083751639946537754, 0.10346956020990222, -0.1357172402144039,
+          -0.083751639946537559, -0.10346956020990272, 0.13571724021440401,
+          -0.38827729758393714, 0.86062815497486933, -0.38827729758393725,
+          2.7363063850459128, 0.55854620194017246, -2.9218682633538329,
+          1.655219941516346e-15, -1.1170924038803507, 1.2485855805667669e-16],
+         [0.14291199833236701, -0.43031407748743383, 0.24536529925156972,
+          -0.015661083139564498, 0.17581224710182863, -0.37261621444437226,
+          0.12005615707483971, 0.072342686891926578, -0.45636785439091127,
+          3.4561462654060917, 4.0143794449943764, 0.5187921922455988,
+          0.71983988036017366, 0.20533789866104202, 1.2725091519279812]], dtype=object), 'FE1_C1': array([[0.60716808047250814, -0.59689270626796598, 0.1612878633393455,
+          0.35182148107663441, -0.18346742583332418, 0.35182148107663369,
+          0.16128786333934814, -0.59689270626797053, 0.60716808047250603,
+          1.5865780911283878e-14, -0.17797470189041492, -0.30826122613616835,
+          0.87189441351102714, 5.4601686125934874, -2.9469223342108184],
+         [0.12609448040868795, -0.33258764579152861, 0.22572700066794893,
+          0.28738234374803584, -0.92948035205949608, 0.83289508114045119,
+          0.10530003423051638, -0.09173371291666331, 0.24652144684612159,
+          -0.68123779684504515, -0.59514595083247079, 1.3777163039878508,
+          2.2343700072011221, -0.17797470189043055, 3.4466732865821634],
+         [0.24652144684612062, -0.091733712916663074, 0.1053000342305148,
+          0.83289508114044597, -0.92948035205948654, 0.28738234374803107,
+          0.2257270006679471, -0.33258764579152744, 0.12609448040868801,
+          0.68123779684504027, 1.4907102938777024, 0.17344663961355347,
+          1.553132210356083, -4.5646042695482745, -1.7426526698365508],
+         [0.13571724021440501, -0.10346956020990383, -0.083751639946537046,
+          -0.38827729758393731, 0.86062815497486922, -0.38827729758393759,
+          -0.083751639946537421, -0.10346956020990319, 0.13571724021440498,
+          -9.0205620750793969e-16, -0.55854620194017512,
+          -0.96743040013500892, 2.7363063850459195, -2.2511390416058537,
+          1.9446493317444236],
+         [-0.37261621444437321, 0.17581224710183022, -0.015661083139565025,
+          -0.45636785439090988, 0.072342686891925939, 0.12005615707484055,
+          -0.14291199833236723, 0.43031407748743505, -0.24536529925157058,
+          -0.71983988036017388, -0.99935630278730037, 0.81408241256416869,
+          4.1759861457662666, -0.55854620194017346, -4.5500330884821736],
+         [-0.24536529925157022, 0.43031407748743539, -0.14291199833236792,
+          0.12005615707484001, 0.072342686891925079, -0.45636785439090943,
+          -0.015661083139564921, 0.17581224710182911, -0.37261621444437321,
+          0.7198398803601761, 1.2046942014483473, -0.45842673936381911,
+          3.4561462654060913, 2.4564769402668953, 3.2171584836724074]], dtype=object), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[10.101087679010009, -5.7574429632921049, 1.7907476897549031,
+          -0.021689692393999725, 0.10407417947385125, -0.26580392483989607,
+          4.7529284384342443, -11.681804460650792, 7.138906930330652,
+          16.756624755930712, 27.378817781785102, -11.822111524362853,
+          -16.831893360509522, -22.000248585841845, 13.761416729676984],
+         [0.632753871377701, -2.6013316940813129, 2.8427847794918213,
+          2.3294268773016489, -3.3230298032773646, -5.8049655281711541,
+          1.8598264416577233, -0.63541501841312042, 1.6157122092118068,
+          -5.5604520504506061, 0.046092418717460504, 19.739001167743737,
+          16.756624755930613, 5.1941995210739442, 29.621807486792356],
+         [1.1507889751399325, -0.36974459894346984, 0.73072715891173945,
+          -11.562274986092961, 6.6872894314357927, -1.9235828994897004,
+          1.3815974724087847, -1.6714852259375645, 0.4999186616428769,
+          3.6818784987741004, 9.0187236169210934, 2.6034812539881287,
+          14.953319808833053, -32.353728539106015, -17.082296973047281],
+         [-0.03450653717326059, -0.013416809313161443, -0.79373186720448863,
+          -2.5655189125616067, -1.5434417461750063, -2.0117702470269636,
+          -0.97634244359681943, 0.35180434347149725, 0.14810403921906834,
+          -1.03300141506717, -5.4957592163867526, -5.866722661100324,
+          19.69260175322076, -6.7049858401289226, 14.541202232398234],
+         [-2.0890186793857417, 0.67142057142433664, -0.56545274029199444,
+          1.9064081029934079, -0.30619941863967409, 0.74806331668432369,
+          -1.6041100426061845, 2.748735176052719, -1.0503613770715436,
+          -5.8755329743621276, -11.42662490818517, 0.98165114627436445,
+          -1.0330014150671754, 33.505754576225037, -1.8261057639232343],
+         [0.0042703740714476607, 2.1460884611138731, 0.95713849588395727,
+          3.3490634693369845, -2.0958466929728479, 1.0950552246739211,
+          2.7491041918717243, -1.4378429308616605, -1.7876953219163214,
+          10.136888762292616, 24.830205046969827, 7.16786278395083,
+          -15.43124596529028, 16.780845568863352, -7.0081182956627668]], dtype=object), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C1_D01': array([[2.9621807486793523, 5.9243614973586833, -2.9621807486793381,
+          0.24411423244589453, -1.1768364061026659e-14, -0.24411423244589225,
+          2.9621807486793457, -5.9243614973586904, -2.9621807486793563,
+          33.513249511861382, 51.306475579148668, -29.621807486792424,
+          -16.756624755930716, -23.010045610320027, 19.389046892033374],
+         [0.13283520973481244, -0.92984646814372818, 1.4611873070830139,
+          4.2530097767913579, -10.010319234713194, 5.7573094579218447,
+          1.1290992827459692, -0.26567041946963721, 0.46492323407186209,
+          -1.8785735516764897, 2.3007733229476903, 10.626816778785221,
+          -1.8785735516765287, 4.3226797527477281, 2.1736925672156486],
+         [-0.46492323407186542, 0.26567041946964198, -1.1290992827459641,
+          -5.7573094579218278, 10.01031923471316, -4.2530097767913411,
+          -1.4611873070830113, 0.92984646814373439, -0.13283520973482066,
+          -1.8785735516764719, -8.0527066303168073, -7.3059365354148227,
+          3.7571471033529984, 7.7738397371691734, 12.136333297326804],
+         [-0.18261057639232881, -0.36522115278465861, 0.18261057639232903,
+          -0.55374866553464375, 3.3306690738754696e-15, 0.55374866553464019,
+          -0.18261057639232869, 0.36522115278465633, 0.18261057639233147,
+          -2.0660028301343281, -3.1629079631094097, 1.8261057639232279,
+          1.0330014150671647, 6.9077063614820471, 8.3122868540072048],
+         [-0.3013233574694234, 2.1092635022859976, -3.3145569321637232,
+          0.81135287831948921, 1.7896472743331635, -2.6010001526526652,
+          -2.5612485384901533, 0.60264671493885491, -1.0546317511429981,
+          4.2613557879304711, -5.2190736464427525, -24.105868597553563,
+          4.2613557879305155, 12.83857205328046, 34.289993391692498],
+         [1.0546317511429952, -0.6026467149388548, 2.5612485384901498,
+          2.6010001526526625, -1.7896472743331682, -0.81135287831948866,
+          3.3145569321637209, -2.109263502285998, 0.30132335746942551,
+          4.2613557879304658, 18.266757762549506, 16.57278466081808,
+          -8.5227115758609848, 5.0099615836164393, 11.690741581485989]], dtype=object), 'FE1_C0_D01': array([[-2.8427847794918146, 2.6013316940813116, -0.63275387137770478,
+          1.8598264416577144, -0.63541501841311776, 1.6157122092117984,
+          2.3294268773016422, -3.3230298032773584, -5.8049655281711541,
+          16.756624755930606, 28.250337550111205, -10.312595005821199,
+          -5.5604520504505954, 17.117522665955445, -9.8295833783406206],
+         [-1.7907476897548973, 5.7574429632920721, -10.10108767901,
+          4.7529284384342585, -11.681804460650797, 7.1389069303306414,
+          -0.021689692393989102, 0.10407417947384556, -0.26580392483987536,
+          -16.83189336050966, 0.91761218704344683, -25.933482529750144,
+          16.756624755930776, 3.451159984421619, 29.621807486792584],
+         [-0.73072715891173889, 0.36974459894346978, -1.1507889751399314,
+          1.3815974724087905, -1.6714852259375714, 0.49991866164287968,
+          -11.562274986092966, 6.6872894314357882, -1.9235828994896984,
+          14.95331980883304, -30.970567403201986, -19.478002335487815,
+          3.6818784987741173, 6.7640427126908378, 6.5087031349702826],
+         [0.56545274029199499, -0.67142057142433176, 2.0890186793857395,
+          -1.6041100426061892, 2.7487351760527234, -1.0503613770715445,
+          1.906408102993409, -0.30619941863967459, 0.74806331668432002,
+          -1.0330014150671394, 15.171423306557839, 29.929887517939225,
+          -5.8755329743621445, -4.8631776237648996, -10.386573023141594],
+         [0.79373186720449285, 0.013416809313154587, 0.034506537173266238,
+          -0.9763424435968211, 0.3518043434715028, 0.14810403921906223,
+          -2.5655189125616049, -1.5434417461750041, -2.0117702470269663,
+          19.692601753220746, 9.2405576147593997, -13.077289185765691,
+          -1.0330014150671689, -7.8286104696640955, -1.8261057639232379],
+         [-0.95713849588396949, -2.1460884611138527, -0.0042703740714600258,
+          2.7491041918717314, -1.437842930861672, -1.7876953219163045,
+          3.3490634693369841, -2.0958466929728408, 1.0950552246739169,
+          -15.431245965290266, 2.3212143076612191, 18.036697707450578,
+          10.136888762292593, 18.622653785227406, 17.919656959877031]], dtype=object), 'FE1_C0_D10': array([[-1.4611873070830135, 0.92984646814373506, -0.13283520973482055,
+          1.1290992827459649, -0.2656704194696396, 0.46492323407186609,
+          4.2530097767913473, -10.010319234713181, 5.7573094579218331,
+          -1.8785735516764903, 4.0438128596000427, 2.6567041946962977,
+          -1.8785735516764914, 10.353479953264523, -3.3208802433703526],
+         [2.9621807486793235, -5.9243614973586851, -2.9621807486793488,
+          2.9621807486793714, -5.9243614973587047, -2.9621807486793408,
+          0.24411423244590091, 1.4535274179881872e-15, -0.24411423244590003,
+          -16.756624755930773, 5.2863843585085775, -29.621807486792413,
+          33.513249511861403, 1.7871399756601309e-13, 59.243614973584883],
+         [1.1290992827459674, -0.26567041946964393, 0.46492323407187053,
+          -1.4611873070830126, 0.92984646814373739, -0.13283520973482263,
+          -5.7573094579218251, 10.010319234713164, -4.2530097767913357,
+          3.7571471033529735, 14.397292812864555, 0.6641760486740762,
+          -1.8785735516764686, -10.353479953264548, -3.3208802433703704],
+         [3.3145569321637263, -2.1092635022860078, 0.30132335746943573,
+          -2.561248538490152, 0.60264671493886302, -1.0546317511430037,
+          0.81135287831949832, 1.7896472743331697, -2.6010001526526674,
+          4.2613557879304809, 36.11529139944647, -6.0264671493883482,
+          4.2613557879304729, -23.485831408992297, 7.5330839367354319],
+         [-0.18261057639232905, 0.36522115278465922, 0.18261057639232911,
+          -0.18261057639232969, 0.36522115278465828, 0.1826105763923295,
+          -0.55374866553464264, 1.1830772254640687e-15, 0.55374866553463986,
+          1.033001415067166, 10.652504759854693, 1.826105763923227,
+          -2.0660028301343369, -2.0255612133378404e-15, -3.652211527846462],
+         [-2.5612485384901538, 0.60264671493886224, -1.0546317511430061,
+          3.314556932163724, -2.1092635022860087, 0.30132335746943029,
+          2.601000152652658, -1.7896472743331613, -0.81135287831949876,
+          -8.5227115758609724, 12.62945999045416, -1.5066167873471024,
+          4.2613557879304755, 23.485831408992283, 7.5330839367354905]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]])}
+  
+  tables: {'FE0_C1_D01': array([[ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.],
+         [ 0.,  0.,  0., -1.,  0.,  1.]]), 'FE1_C0': array([[-0.22572700066794837, 0.33258764579152805, -0.12609448040868837,
+          0.10530003423051591, -0.091733712916663199, 0.24652144684612071,
+          0.28738234374803473, -0.92948035205949597, 0.8328950811404503,
+          2.2343700072011208, 2.8959192737801374, -1.8774672563591612,
+          -0.68123779684504371, 0.89556434304524446, -1.2042696643742827],
+         [-0.16128786333934439, 0.59689270626796376, -0.6071680804725077,
+          0.16128786333934764, -0.59689270626796964, 0.60716808047250459,
+          0.35182148107663602, -0.18346742583332576, 0.3518214810766363,
+          0.87189441351102093, 0.17797470189043602, 6.2021058945578158,
+          1.6671699198784318e-14, -0.35594940378087159,
+          3.0458070564197476e-14],
+         [-0.10530003423051545, 0.091733712916662935, -0.24652144684612076,
+          0.22572700066794749, -0.33258764579152772, 0.12609448040868845,
+          0.83289508114044541, -0.92948035205948687, 0.28738234374803129,
+          1.553132210356081, -3.7914836168253734, -3.081736920733444,
+          0.68123779684504104, 0.8955643430452398, 1.2042696643742832],
+         [0.015661083139564554, -0.17581224710182836, 0.37261621444437226,
+          -0.14291199833236742, 0.4303140774874345, -0.2453652992515695,
+          -0.45636785439091054, 0.072342686891925523, 0.12005615707484055,
+          4.1759861457662701, -4.2197173436554172, 1.7913013441735806,
+          -0.71983988036017554, 0.20533789866104202, -1.2725091519279852],
+         [0.083751639946537754, 0.10346956020990222, -0.1357172402144039,
+          -0.083751639946537559, -0.10346956020990272, 0.13571724021440401,
+          -0.38827729758393714, 0.86062815497486933, -0.38827729758393725,
+          2.7363063850459128, 0.55854620194017246, -2.9218682633538329,
+          1.655219941516346e-15, -1.1170924038803507, 1.2485855805667669e-16],
+         [0.14291199833236701, -0.43031407748743383, 0.24536529925156972,
+          -0.015661083139564498, 0.17581224710182863, -0.37261621444437226,
+          0.12005615707483971, 0.072342686891926578, -0.45636785439091127,
+          3.4561462654060917, 4.0143794449943764, 0.5187921922455988,
+          0.71983988036017366, 0.20533789866104202, 1.2725091519279812]], dtype=object), 'FE1_C1': array([[0.60716808047250814, -0.59689270626796598, 0.1612878633393455,
+          0.35182148107663441, -0.18346742583332418, 0.35182148107663369,
+          0.16128786333934814, -0.59689270626797053, 0.60716808047250603,
+          1.5865780911283878e-14, -0.17797470189041492, -0.30826122613616835,
+          0.87189441351102714, 5.4601686125934874, -2.9469223342108184],
+         [0.12609448040868795, -0.33258764579152861, 0.22572700066794893,
+          0.28738234374803584, -0.92948035205949608, 0.83289508114045119,
+          0.10530003423051638, -0.09173371291666331, 0.24652144684612159,
+          -0.68123779684504515, -0.59514595083247079, 1.3777163039878508,
+          2.2343700072011221, -0.17797470189043055, 3.4466732865821634],
+         [0.24652144684612062, -0.091733712916663074, 0.1053000342305148,
+          0.83289508114044597, -0.92948035205948654, 0.28738234374803107,
+          0.2257270006679471, -0.33258764579152744, 0.12609448040868801,
+          0.68123779684504027, 1.4907102938777024, 0.17344663961355347,
+          1.553132210356083, -4.5646042695482745, -1.7426526698365508],
+         [0.13571724021440501, -0.10346956020990383, -0.083751639946537046,
+          -0.38827729758393731, 0.86062815497486922, -0.38827729758393759,
+          -0.083751639946537421, -0.10346956020990319, 0.13571724021440498,
+          -9.0205620750793969e-16, -0.55854620194017512,
+          -0.96743040013500892, 2.7363063850459195, -2.2511390416058537,
+          1.9446493317444236],
+         [-0.37261621444437321, 0.17581224710183022, -0.015661083139565025,
+          -0.45636785439090988, 0.072342686891925939, 0.12005615707484055,
+          -0.14291199833236723, 0.43031407748743505, -0.24536529925157058,
+          -0.71983988036017388, -0.99935630278730037, 0.81408241256416869,
+          4.1759861457662666, -0.55854620194017346, -4.5500330884821736],
+         [-0.24536529925157022, 0.43031407748743539, -0.14291199833236792,
+          0.12005615707484001, 0.072342686891925079, -0.45636785439090943,
+          -0.015661083139564921, 0.17581224710182911, -0.37261621444437321,
+          0.7198398803601761, 1.2046942014483473, -0.45842673936381911,
+          3.4561462654060913, 2.4564769402668953, 3.2171584836724074]], dtype=object), 'FE0_C1_D10': array([[ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.],
+         [ 0.,  0.,  0., -1.,  1.,  0.]]), 'FE1_C1_D10': array([[10.101087679010009, -5.7574429632921049, 1.7907476897549031,
+          -0.021689692393999725, 0.10407417947385125, -0.26580392483989607,
+          4.7529284384342443, -11.681804460650792, 7.138906930330652,
+          16.756624755930712, 27.378817781785102, -11.822111524362853,
+          -16.831893360509522, -22.000248585841845, 13.761416729676984],
+         [0.632753871377701, -2.6013316940813129, 2.8427847794918213,
+          2.3294268773016489, -3.3230298032773646, -5.8049655281711541,
+          1.8598264416577233, -0.63541501841312042, 1.6157122092118068,
+          -5.5604520504506061, 0.046092418717460504, 19.739001167743737,
+          16.756624755930613, 5.1941995210739442, 29.621807486792356],
+         [1.1507889751399325, -0.36974459894346984, 0.73072715891173945,
+          -11.562274986092961, 6.6872894314357927, -1.9235828994897004,
+          1.3815974724087847, -1.6714852259375645, 0.4999186616428769,
+          3.6818784987741004, 9.0187236169210934, 2.6034812539881287,
+          14.953319808833053, -32.353728539106015, -17.082296973047281],
+         [-0.03450653717326059, -0.013416809313161443, -0.79373186720448863,
+          -2.5655189125616067, -1.5434417461750063, -2.0117702470269636,
+          -0.97634244359681943, 0.35180434347149725, 0.14810403921906834,
+          -1.03300141506717, -5.4957592163867526, -5.866722661100324,
+          19.69260175322076, -6.7049858401289226, 14.541202232398234],
+         [-2.0890186793857417, 0.67142057142433664, -0.56545274029199444,
+          1.9064081029934079, -0.30619941863967409, 0.74806331668432369,
+          -1.6041100426061845, 2.748735176052719, -1.0503613770715436,
+          -5.8755329743621276, -11.42662490818517, 0.98165114627436445,
+          -1.0330014150671754, 33.505754576225037, -1.8261057639232343],
+         [0.0042703740714476607, 2.1460884611138731, 0.95713849588395727,
+          3.3490634693369845, -2.0958466929728479, 1.0950552246739211,
+          2.7491041918717243, -1.4378429308616605, -1.7876953219163214,
+          10.136888762292616, 24.830205046969827, 7.16786278395083,
+          -15.43124596529028, 16.780845568863352, -7.0081182956627668]], dtype=object), 'FE0_C0_D10': array([[-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.],
+         [-1.,  1.,  0.,  0.,  0.,  0.]]), 'FE0_C0_D01': array([[-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.],
+         [-1.,  0.,  1.,  0.,  0.,  0.]]), 'FE1_C1_D01': array([[2.9621807486793523, 5.9243614973586833, -2.9621807486793381,
+          0.24411423244589453, -1.1768364061026659e-14, -0.24411423244589225,
+          2.9621807486793457, -5.9243614973586904, -2.9621807486793563,
+          33.513249511861382, 51.306475579148668, -29.621807486792424,
+          -16.756624755930716, -23.010045610320027, 19.389046892033374],
+         [0.13283520973481244, -0.92984646814372818, 1.4611873070830139,
+          4.2530097767913579, -10.010319234713194, 5.7573094579218447,
+          1.1290992827459692, -0.26567041946963721, 0.46492323407186209,
+          -1.8785735516764897, 2.3007733229476903, 10.626816778785221,
+          -1.8785735516765287, 4.3226797527477281, 2.1736925672156486],
+         [-0.46492323407186542, 0.26567041946964198, -1.1290992827459641,
+          -5.7573094579218278, 10.01031923471316, -4.2530097767913411,
+          -1.4611873070830113, 0.92984646814373439, -0.13283520973482066,
+          -1.8785735516764719, -8.0527066303168073, -7.3059365354148227,
+          3.7571471033529984, 7.7738397371691734, 12.136333297326804],
+         [-0.18261057639232881, -0.36522115278465861, 0.18261057639232903,
+          -0.55374866553464375, 3.3306690738754696e-15, 0.55374866553464019,
+          -0.18261057639232869, 0.36522115278465633, 0.18261057639233147,
+          -2.0660028301343281, -3.1629079631094097, 1.8261057639232279,
+          1.0330014150671647, 6.9077063614820471, 8.3122868540072048],
+         [-0.3013233574694234, 2.1092635022859976, -3.3145569321637232,
+          0.81135287831948921, 1.7896472743331635, -2.6010001526526652,
+          -2.5612485384901533, 0.60264671493885491, -1.0546317511429981,
+          4.2613557879304711, -5.2190736464427525, -24.105868597553563,
+          4.2613557879305155, 12.83857205328046, 34.289993391692498],
+         [1.0546317511429952, -0.6026467149388548, 2.5612485384901498,
+          2.6010001526526625, -1.7896472743331682, -0.81135287831948866,
+          3.3145569321637209, -2.109263502285998, 0.30132335746942551,
+          4.2613557879304658, 18.266757762549506, 16.57278466081808,
+          -8.5227115758609848, 5.0099615836164393, 11.690741581485989]], dtype=object), 'FE1_C0_D01': array([[-2.8427847794918146, 2.6013316940813116, -0.63275387137770478,
+          1.8598264416577144, -0.63541501841311776, 1.6157122092117984,
+          2.3294268773016422, -3.3230298032773584, -5.8049655281711541,
+          16.756624755930606, 28.250337550111205, -10.312595005821199,
+          -5.5604520504505954, 17.117522665955445, -9.8295833783406206],
+         [-1.7907476897548973, 5.7574429632920721, -10.10108767901,
+          4.7529284384342585, -11.681804460650797, 7.1389069303306414,
+          -0.021689692393989102, 0.10407417947384556, -0.26580392483987536,
+          -16.83189336050966, 0.91761218704344683, -25.933482529750144,
+          16.756624755930776, 3.451159984421619, 29.621807486792584],
+         [-0.73072715891173889, 0.36974459894346978, -1.1507889751399314,
+          1.3815974724087905, -1.6714852259375714, 0.49991866164287968,
+          -11.562274986092966, 6.6872894314357882, -1.9235828994896984,
+          14.95331980883304, -30.970567403201986, -19.478002335487815,
+          3.6818784987741173, 6.7640427126908378, 6.5087031349702826],
+         [0.56545274029199499, -0.67142057142433176, 2.0890186793857395,
+          -1.6041100426061892, 2.7487351760527234, -1.0503613770715445,
+          1.906408102993409, -0.30619941863967459, 0.74806331668432002,
+          -1.0330014150671394, 15.171423306557839, 29.929887517939225,
+          -5.8755329743621445, -4.8631776237648996, -10.386573023141594],
+         [0.79373186720449285, 0.013416809313154587, 0.034506537173266238,
+          -0.9763424435968211, 0.3518043434715028, 0.14810403921906223,
+          -2.5655189125616049, -1.5434417461750041, -2.0117702470269663,
+          19.692601753220746, 9.2405576147593997, -13.077289185765691,
+          -1.0330014150671689, -7.8286104696640955, -1.8261057639232379],
+         [-0.95713849588396949, -2.1460884611138527, -0.0042703740714600258,
+          2.7491041918717314, -1.437842930861672, -1.7876953219163045,
+          3.3490634693369841, -2.0958466929728408, 1.0950552246739169,
+          -15.431245965290266, 2.3212143076612191, 18.036697707450578,
+          10.136888762292593, 18.622653785227406, 17.919656959877031]], dtype=object), 'FE1_C0_D10': array([[-1.4611873070830135, 0.92984646814373506, -0.13283520973482055,
+          1.1290992827459649, -0.2656704194696396, 0.46492323407186609,
+          4.2530097767913473, -10.010319234713181, 5.7573094579218331,
+          -1.8785735516764903, 4.0438128596000427, 2.6567041946962977,
+          -1.8785735516764914, 10.353479953264523, -3.3208802433703526],
+         [2.9621807486793235, -5.9243614973586851, -2.9621807486793488,
+          2.9621807486793714, -5.9243614973587047, -2.9621807486793408,
+          0.24411423244590091, 1.4535274179881872e-15, -0.24411423244590003,
+          -16.756624755930773, 5.2863843585085775, -29.621807486792413,
+          33.513249511861403, 1.7871399756601309e-13, 59.243614973584883],
+         [1.1290992827459674, -0.26567041946964393, 0.46492323407187053,
+          -1.4611873070830126, 0.92984646814373739, -0.13283520973482263,
+          -5.7573094579218251, 10.010319234713164, -4.2530097767913357,
+          3.7571471033529735, 14.397292812864555, 0.6641760486740762,
+          -1.8785735516764686, -10.353479953264548, -3.3208802433703704],
+         [3.3145569321637263, -2.1092635022860078, 0.30132335746943573,
+          -2.561248538490152, 0.60264671493886302, -1.0546317511430037,
+          0.81135287831949832, 1.7896472743331697, -2.6010001526526674,
+          4.2613557879304809, 36.11529139944647, -6.0264671493883482,
+          4.2613557879304729, -23.485831408992297, 7.5330839367354319],
+         [-0.18261057639232905, 0.36522115278465922, 0.18261057639232911,
+          -0.18261057639232969, 0.36522115278465828, 0.1826105763923295,
+          -0.55374866553464264, 1.1830772254640687e-15, 0.55374866553463986,
+          1.033001415067166, 10.652504759854693, 1.826105763923227,
+          -2.0660028301343369, -2.0255612133378404e-15, -3.652211527846462],
+         [-2.5612485384901538, 0.60264671493886224, -1.0546317511430061,
+          3.314556932163724, -2.1092635022860087, 0.30132335746943029,
+          2.601000152652658, -1.7896472743331613, -0.81135287831949876,
+          -8.5227115758609724, 12.62945999045416, -1.5066167873471024,
+          4.2613557879304755, 23.485831408992283, 7.5330839367354905]], dtype=object), 'FE0_C1': array([[ 0.        ,  0.        ,  0.        ,  0.09157621,  0.81684757,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.09157621,  0.09157621,
+           0.81684757],
+         [ 0.        ,  0.        ,  0.        ,  0.81684757,  0.09157621,
+           0.09157621],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.10810302,
+           0.44594849],
+         [ 0.        ,  0.        ,  0.        ,  0.44594849,  0.44594849,
+           0.10810302],
+         [ 0.        ,  0.        ,  0.        ,  0.10810302,  0.44594849,
+           0.44594849]]), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.09157621,  0.09157621,  0.81684757,  0.        ,  0.        ,
+           0.        ],
+         [ 0.81684757,  0.09157621,  0.09157621,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.10810302,  0.44594849,  0.        ,  0.        ,
+           0.        ],
+         [ 0.44594849,  0.44594849,  0.10810302,  0.        ,  0.        ,
+           0.        ],
+         [ 0.10810302,  0.44594849,  0.44594849,  0.        ,  0.        ,
+           0.        ]])}
+  
+  name_map: {}
+  
+  inv_name_map: {'FE0_C1_D01': 'FE0_C1_D01', 'FE1_C0': 'FE1_C0', 'FE1_C1': 'FE1_C1', 'FE0_C1_D10': 'FE0_C1_D10', 'FE1_C1_D10': 'FE1_C1_D10', 'FE0_C0_D10': 'FE0_C0_D10', 'FE0_C0_D01': 'FE0_C0_D01', 'FE1_C1_D01': 'FE1_C1_D01', 'FE1_C0_D01': 'FE1_C0_D01', 'FE1_C0_D10': 'FE1_C0_D10', 'FE0_C1': 'FE0_C1', 'FE0_C0': 'FE0_C0'}
+  
+  QG-utils, psi_tables, unique_tables:
+  {'FE1_C0': array([[-0.22572700066794837, 0.33258764579152805, -0.12609448040868837,
+          0.10530003423051591, -0.091733712916663199, 0.24652144684612071,
+          0.28738234374803473, -0.92948035205949597, 0.8328950811404503,
+          2.2343700072011208, 2.8959192737801374, -1.8774672563591612,
+          -0.68123779684504371, 0.89556434304524446, -1.2042696643742827],
+         [-0.16128786333934439, 0.59689270626796376, -0.6071680804725077,
+          0.16128786333934764, -0.59689270626796964, 0.60716808047250459,
+          0.35182148107663602, -0.18346742583332576, 0.3518214810766363,
+          0.87189441351102093, 0.17797470189043602, 6.2021058945578158,
+          1.6671699198784318e-14, -0.35594940378087159,
+          3.0458070564197476e-14],
+         [-0.10530003423051545, 0.091733712916662935, -0.24652144684612076,
+          0.22572700066794749, -0.33258764579152772, 0.12609448040868845,
+          0.83289508114044541, -0.92948035205948687, 0.28738234374803129,
+          1.553132210356081, -3.7914836168253734, -3.081736920733444,
+          0.68123779684504104, 0.8955643430452398, 1.2042696643742832],
+         [0.015661083139564554, -0.17581224710182836, 0.37261621444437226,
+          -0.14291199833236742, 0.4303140774874345, -0.2453652992515695,
+          -0.45636785439091054, 0.072342686891925523, 0.12005615707484055,
+          4.1759861457662701, -4.2197173436554172, 1.7913013441735806,
+          -0.71983988036017554, 0.20533789866104202, -1.2725091519279852],
+         [0.083751639946537754, 0.10346956020990222, -0.1357172402144039,
+          -0.083751639946537559, -0.10346956020990272, 0.13571724021440401,
+          -0.38827729758393714, 0.86062815497486933, -0.38827729758393725,
+          2.7363063850459128, 0.55854620194017246, -2.9218682633538329, 0,
+          -1.1170924038803507, 0],
+         [0.14291199833236701, -0.43031407748743383, 0.24536529925156972,
+          -0.015661083139564498, 0.17581224710182863, -0.37261621444437226,
+          0.12005615707483971, 0.072342686891926578, -0.45636785439091127,
+          3.4561462654060917, 4.0143794449943764, 0.5187921922455988,
+          0.71983988036017366, 0.20533789866104202, 1.2725091519279812]], dtype=object), 'FE1_C1': array([[0.60716808047250814, -0.59689270626796598, 0.1612878633393455,
+          0.35182148107663441, -0.18346742583332418, 0.35182148107663369,
+          0.16128786333934814, -0.59689270626797053, 0.60716808047250603,
+          1.5865780911283878e-14, -0.17797470189041492, -0.30826122613616835,
+          0.87189441351102714, 5.4601686125934874, -2.9469223342108184],
+         [0.12609448040868795, -0.33258764579152861, 0.22572700066794893,
+          0.28738234374803584, -0.92948035205949608, 0.83289508114045119,
+          0.10530003423051638, -0.09173371291666331, 0.24652144684612159,
+          -0.68123779684504515, -0.59514595083247079, 1.3777163039878508,
+          2.2343700072011221, -0.17797470189043055, 3.4466732865821634],
+         [0.24652144684612062, -0.091733712916663074, 0.1053000342305148,
+          0.83289508114044597, -0.92948035205948654, 0.28738234374803107,
+          0.2257270006679471, -0.33258764579152744, 0.12609448040868801,
+          0.68123779684504027, 1.4907102938777024, 0.17344663961355347,
+          1.553132210356083, -4.5646042695482745, -1.7426526698365508],
+         [0.13571724021440501, -0.10346956020990383, -0.083751639946537046,
+          -0.38827729758393731, 0.86062815497486922, -0.38827729758393759,
+          -0.083751639946537421, -0.10346956020990319, 0.13571724021440498,
+          0, -0.55854620194017512, -0.96743040013500892, 2.7363063850459195,
+          -2.2511390416058537, 1.9446493317444236],
+         [-0.37261621444437321, 0.17581224710183022, -0.015661083139565025,
+          -0.45636785439090988, 0.072342686891925939, 0.12005615707484055,
+          -0.14291199833236723, 0.43031407748743505, -0.24536529925157058,
+          -0.71983988036017388, -0.99935630278730037, 0.81408241256416869,
+          4.1759861457662666, -0.55854620194017346, -4.5500330884821736],
+         [-0.24536529925157022, 0.43031407748743539, -0.14291199833236792,
+          0.12005615707484001, 0.072342686891925079, -0.45636785439090943,
+          -0.015661083139564921, 0.17581224710182911, -0.37261621444437321,
+          0.7198398803601761, 1.2046942014483473, -0.45842673936381911,
+          3.4561462654060913, 2.4564769402668953, 3.2171584836724074]], dtype=object), 'FE1_C1_D10': array([[10.101087679010009, -5.7574429632921049, 1.7907476897549031,
+          -0.021689692393999725, 0.10407417947385125, -0.26580392483989607,
+          4.7529284384342443, -11.681804460650792, 7.138906930330652,
+          16.756624755930712, 27.378817781785102, -11.822111524362853,
+          -16.831893360509522, -22.000248585841845, 13.761416729676984],
+         [0.632753871377701, -2.6013316940813129, 2.8427847794918213,
+          2.3294268773016489, -3.3230298032773646, -5.8049655281711541,
+          1.8598264416577233, -0.63541501841312042, 1.6157122092118068,
+          -5.5604520504506061, 0.046092418717460504, 19.739001167743737,
+          16.756624755930613, 5.1941995210739442, 29.621807486792356],
+         [1.1507889751399325, -0.36974459894346984, 0.73072715891173945,
+          -11.562274986092961, 6.6872894314357927, -1.9235828994897004,
+          1.3815974724087847, -1.6714852259375645, 0.4999186616428769,
+          3.6818784987741004, 9.0187236169210934, 2.6034812539881287,
+          14.953319808833053, -32.353728539106015, -17.082296973047281],
+         [-0.03450653717326059, -0.013416809313161443, -0.79373186720448863,
+          -2.5655189125616067, -1.5434417461750063, -2.0117702470269636,
+          -0.97634244359681943, 0.35180434347149725, 0.14810403921906834,
+          -1.03300141506717, -5.4957592163867526, -5.866722661100324,
+          19.69260175322076, -6.7049858401289226, 14.541202232398234],
+         [-2.0890186793857417, 0.67142057142433664, -0.56545274029199444,
+          1.9064081029934079, -0.30619941863967409, 0.74806331668432369,
+          -1.6041100426061845, 2.748735176052719, -1.0503613770715436,
+          -5.8755329743621276, -11.42662490818517, 0.98165114627436445,
+          -1.0330014150671754, 33.505754576225037, -1.8261057639232343],
+         [0.0042703740714476607, 2.1460884611138731, 0.95713849588395727,
+          3.3490634693369845, -2.0958466929728479, 1.0950552246739211,
+          2.7491041918717243, -1.4378429308616605, -1.7876953219163214,
+          10.136888762292616, 24.830205046969827, 7.16786278395083,
+          -15.43124596529028, 16.780845568863352, -7.0081182956627668]], dtype=object), 'FE0_C0_D01': array([[-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.],
+         [-1.,  1.]]), 'FE1_C1_D01': array([[2.9621807486793523, 5.9243614973586833, -2.9621807486793381,
+          0.24411423244589453, -1.1768364061026659e-14, -0.24411423244589225,
+          2.9621807486793457, -5.9243614973586904, -2.9621807486793563,
+          33.513249511861382, 51.306475579148668, -29.621807486792424,
+          -16.756624755930716, -23.010045610320027, 19.389046892033374],
+         [0.13283520973481244, -0.92984646814372818, 1.4611873070830139,
+          4.2530097767913579, -10.010319234713194, 5.7573094579218447,
+          1.1290992827459692, -0.26567041946963721, 0.46492323407186209,
+          -1.8785735516764897, 2.3007733229476903, 10.626816778785221,
+          -1.8785735516765287, 4.3226797527477281, 2.1736925672156486],
+         [-0.46492323407186542, 0.26567041946964198, -1.1290992827459641,
+          -5.7573094579218278, 10.01031923471316, -4.2530097767913411,
+          -1.4611873070830113, 0.92984646814373439, -0.13283520973482066,
+          -1.8785735516764719, -8.0527066303168073, -7.3059365354148227,
+          3.7571471033529984, 7.7738397371691734, 12.136333297326804],
+         [-0.18261057639232881, -0.36522115278465861, 0.18261057639232903,
+          -0.55374866553464375, 0, 0.55374866553464019, -0.18261057639232869,
+          0.36522115278465633, 0.18261057639233147, -2.0660028301343281,
+          -3.1629079631094097, 1.8261057639232279, 1.0330014150671647,
+          6.9077063614820471, 8.3122868540072048],
+         [-0.3013233574694234, 2.1092635022859976, -3.3145569321637232,
+          0.81135287831948921, 1.7896472743331635, -2.6010001526526652,
+          -2.5612485384901533, 0.60264671493885491, -1.0546317511429981,
+          4.2613557879304711, -5.2190736464427525, -24.105868597553563,
+          4.2613557879305155, 12.83857205328046, 34.289993391692498],
+         [1.0546317511429952, -0.6026467149388548, 2.5612485384901498,
+          2.6010001526526625, -1.7896472743331682, -0.81135287831948866,
+          3.3145569321637209, -2.109263502285998, 0.30132335746942551,
+          4.2613557879304658, 18.266757762549506, 16.57278466081808,
+          -8.5227115758609848, 5.0099615836164393, 11.690741581485989]], dtype=object), 'FE1_C0_D01': array([[-2.8427847794918146, 2.6013316940813116, -0.63275387137770478,
+          1.8598264416577144, -0.63541501841311776, 1.6157122092117984,
+          2.3294268773016422, -3.3230298032773584, -5.8049655281711541,
+          16.756624755930606, 28.250337550111205, -10.312595005821199,
+          -5.5604520504505954, 17.117522665955445, -9.8295833783406206],
+         [-1.7907476897548973, 5.7574429632920721, -10.10108767901,
+          4.7529284384342585, -11.681804460650797, 7.1389069303306414,
+          -0.021689692393989102, 0.10407417947384556, -0.26580392483987536,
+          -16.83189336050966, 0.91761218704344683, -25.933482529750144,
+          16.756624755930776, 3.451159984421619, 29.621807486792584],
+         [-0.73072715891173889, 0.36974459894346978, -1.1507889751399314,
+          1.3815974724087905, -1.6714852259375714, 0.49991866164287968,
+          -11.562274986092966, 6.6872894314357882, -1.9235828994896984,
+          14.95331980883304, -30.970567403201986, -19.478002335487815,
+          3.6818784987741173, 6.7640427126908378, 6.5087031349702826],
+         [0.56545274029199499, -0.67142057142433176, 2.0890186793857395,
+          -1.6041100426061892, 2.7487351760527234, -1.0503613770715445,
+          1.906408102993409, -0.30619941863967459, 0.74806331668432002,
+          -1.0330014150671394, 15.171423306557839, 29.929887517939225,
+          -5.8755329743621445, -4.8631776237648996, -10.386573023141594],
+         [0.79373186720449285, 0.013416809313154587, 0.034506537173266238,
+          -0.9763424435968211, 0.3518043434715028, 0.14810403921906223,
+          -2.5655189125616049, -1.5434417461750041, -2.0117702470269663,
+          19.692601753220746, 9.2405576147593997, -13.077289185765691,
+          -1.0330014150671689, -7.8286104696640955, -1.8261057639232379],
+         [-0.95713849588396949, -2.1460884611138527, -0.0042703740714600258,
+          2.7491041918717314, -1.437842930861672, -1.7876953219163045,
+          3.3490634693369841, -2.0958466929728408, 1.0950552246739169,
+          -15.431245965290266, 2.3212143076612191, 18.036697707450578,
+          10.136888762292593, 18.622653785227406, 17.919656959877031]], dtype=object), 'FE1_C0_D10': array([[-1.4611873070830135, 0.92984646814373506, -0.13283520973482055,
+          1.1290992827459649, -0.2656704194696396, 0.46492323407186609,
+          4.2530097767913473, -10.010319234713181, 5.7573094579218331,
+          -1.8785735516764903, 4.0438128596000427, 2.6567041946962977,
+          -1.8785735516764914, 10.353479953264523, -3.3208802433703526],
+         [2.9621807486793235, -5.9243614973586851, -2.9621807486793488,
+          2.9621807486793714, -5.9243614973587047, -2.9621807486793408,
+          0.24411423244590091, 0, -0.24411423244590003, -16.756624755930773,
+          5.2863843585085775, -29.621807486792413, 33.513249511861403,
+          1.7871399756601309e-13, 59.243614973584883],
+         [1.1290992827459674, -0.26567041946964393, 0.46492323407187053,
+          -1.4611873070830126, 0.92984646814373739, -0.13283520973482263,
+          -5.7573094579218251, 10.010319234713164, -4.2530097767913357,
+          3.7571471033529735, 14.397292812864555, 0.6641760486740762,
+          -1.8785735516764686, -10.353479953264548, -3.3208802433703704],
+         [3.3145569321637263, -2.1092635022860078, 0.30132335746943573,
+          -2.561248538490152, 0.60264671493886302, -1.0546317511430037,
+          0.81135287831949832, 1.7896472743331697, -2.6010001526526674,
+          4.2613557879304809, 36.11529139944647, -6.0264671493883482,
+          4.2613557879304729, -23.485831408992297, 7.5330839367354319],
+         [-0.18261057639232905, 0.36522115278465922, 0.18261057639232911,
+          -0.18261057639232969, 0.36522115278465828, 0.1826105763923295,
+          -0.55374866553464264, 0, 0.55374866553463986, 1.033001415067166,
+          10.652504759854693, 1.826105763923227, -2.0660028301343369, 0,
+          -3.652211527846462],
+         [-2.5612485384901538, 0.60264671493886224, -1.0546317511430061,
+          3.314556932163724, -2.1092635022860087, 0.30132335746943029,
+          2.601000152652658, -1.7896472743331613, -0.81135287831949876,
+          -8.5227115758609724, 12.62945999045416, -1.5066167873471024,
+          4.2613557879304755, 23.485831408992283, 7.5330839367354905]], dtype=object), 'FE0_C0': array([[ 0.09157621,  0.81684757,  0.09157621],
+         [ 0.09157621,  0.09157621,  0.81684757],
+         [ 0.81684757,  0.09157621,  0.09157621],
+         [ 0.44594849,  0.10810302,  0.44594849],
+         [ 0.44594849,  0.44594849,  0.10810302],
+         [ 0.10810302,  0.44594849,  0.44594849]])}
+  
+  QG-utils, psi_tables, name_map:
+  {'FE0_C1_D01': ('FE0_C0_D01', (4, [3, 5]), False, False), 'FE1_C0': ('FE1_C0', (), False, False), 'FE1_C1': ('FE1_C1', (), False, False), 'FE0_C1_D10': ('FE0_C0_D01', (5, [3, 4]), False, False), 'FE1_C1_D10': ('FE1_C1_D10', (), False, False), 'FE0_C0_D10': ('FE0_C0_D01', (2, [0, 1]), False, False), 'FE0_C0_D01': ('FE0_C0_D01', (1, [0, 2]), False, False), 'FE1_C1_D01': ('FE1_C1_D01', (), False, False), 'FE1_C0_D01': ('FE1_C0_D01', (), False, False), 'FE1_C0_D10': ('FE1_C0_D10', (), False, False), 'FE0_C1': ('FE0_C0', (3, [3, 4, 5]), False, False), 'FE0_C0': ('FE0_C0', (0, [0, 1, 2]), False, False)}
+  Transforming cell integral
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  900 entries computed in 0.00381 seconds
+  Shape of reference tensor: (15, 15, 2, 2)
+  Primary multi index:   rank = 2 dims = [15, 15] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [6, 14], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [7, 13], [7, 14], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [8, 10], [8, 11], [8, 12], [8, 13], [8, 14], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9], [9, 10], [9, 11], [9, 12], [9, 13], [9, 14], [10, 0], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 6], [10, 7], [10, 8], [10, 9], [10, 10], [10, 11], [10, 12], [10, 13], [10, 14], [11, 0], [11, 1], [11, 2], [11, 3], [11, 4], [11, 5], [11, 6], [11, 7], [11, 8], [11, 9], [11, 10], [11, 11], [11, 12], [11, 13], [11, 14], [12, 0], [12, 1], [12, 2], [12, 3], [12, 4], [12, 5], [12, 6], [12, 7], [12, 8], [12, 9], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [13, 0], [13, 1], [13, 2], [13, 3], [13, 4], [13, 5], [13, 6], [13, 7], [13, 8], [13, 9], [13, 10], [13, 11], [13, 12], [13, 13], [13, 14], [14, 0], [14, 1], [14, 2], [14, 3], [14, 4], [14, 5], [14, 6], [14, 7], [14, 8], [14, 9], [14, 10], [14, 11], [14, 12], [14, 13], [14, 14]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.133233 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  Optimising expressions for cell integral
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.00293708 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Removing unused variable: circumradius
+  Removing unused variable: v0v1
+  Removing unused variable: v0v2
+  Removing unused variable: v1v2
+  Removing unused variable: volume
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.351271 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00058794 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Forms.h.
+  
+Compiler stage 5 finished in 0.00120091 seconds.
+
+FFC finished in 0.55508 seconds.
diff --git a/demo/undocumented/waveguide/cpp/main.cpp b/demo/undocumented/waveguide/cpp/main.cpp
new file mode 100644
index 0000000..05a329c
--- /dev/null
+++ b/demo/undocumented/waveguide/cpp/main.cpp
@@ -0,0 +1,108 @@
+// Copyright (C) 2008 Evan Lezar
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008.
+//
+// First added:  2008-08-22
+// Last changed: 2009-09-08
+//
+// This demo demonstrates the calculation of a TM (Transverse Magnetic)
+// cutoff wavenumber of a rectangular waveguide with dimensions 1x0.5m.
+//
+// For more information regarding waveguides, see
+//
+//   http://www.ee.bilkent.edu.tr/~microwave/programs/magnetic/rect/info.htm
+//
+// See the pdf in the parent folder and the following reference:
+//
+//   The Finite Element in Electromagnetics (2nd Ed)
+//   Jianming Jin [7.2.1 - 7.2.2]
+
+#include <dolfin.h>
+#include "Forms.h"
+
+using namespace dolfin;
+
+#if defined(HAS_PETSC) && defined(HAS_SLEPC)
+
+int main()
+{
+  // Create mesh
+  double width = 1.0;
+  double height = 0.5;
+  RectangleMesh mesh(0, 0, width, height, 4, 2);
+
+  // Define the forms - gererates an generalized eigenproblem of the form
+  // [S]{h} = k_o^2[T]{h}
+  // with the eigenvalues k_o^2 representing the square of the cutoff wavenumber
+  // and the corresponding right-eigenvector giving the coefficients of the
+  // discrete system used to obtain the approximate field anywhere in the domain
+  Forms::FunctionSpace V(mesh);
+  Forms::Form_a s(V, V);
+  Forms::Form_L t(V, V);
+
+  // Assemble the system matrices stiffness (S) and mass matrices (T)
+  PETScMatrix S;
+  PETScMatrix T;
+  assemble(S, s);
+  assemble(T, t);
+
+  // Solve the eigen system
+  SLEPcEigenSolver esolver(S, T);
+  esolver.parameters["spectrum"] = "smallest real";
+  esolver.parameters["solver"] = "lapack";
+  esolver.solve();
+
+  // The result should have real eigenvalues but due to rounding errors, some of
+  // the resultant eigenvalues may be small complex values.
+  // only consider the real part
+
+  // Now, the system contains a number of zero eigenvalues (near zero due to
+  // rounding) which are eigenvalues corresponding to the null-space of the curl
+  // operator and are a mathematical construct and do not represent physically
+  // realizable modes.  These are called spurious modes.
+  // So, we need to identify the smallest, non-zero eigenvalue of the system -
+  // which corresponds with cutoff wavenumber of the the dominant cutoff mode.
+  double cutoff = -1.0;
+  double lr, lc;
+  for (std::size_t i = 0; i < S.size(1); i++)
+  {
+    esolver.get_eigenvalue(lr, lc, i);
+    if (lr > 1 && lc == 0)
+    {
+      cutoff = sqrt(lr);
+      break;
+    }
+  }
+
+  if (cutoff == -1.0)
+    info("Unable to find dominant mode.");
+  else
+    info("Cutoff frequency = %g", cutoff);
+
+  return 0;
+}
+
+#else
+
+int main()
+{
+  info("Sorry, this demo is only available when DOLFIN is compiled with PETSc and SLEPc.");
+  return 0;
+}
+
+#endif
diff --git a/demo/undocumented/waveguide/python/demo_waveguide.py b/demo/undocumented/waveguide/python/demo_waveguide.py
new file mode 100644
index 0000000..fc91884
--- /dev/null
+++ b/demo/undocumented/waveguide/python/demo_waveguide.py
@@ -0,0 +1,104 @@
+""" This demo demonstrates the calculation and visualization of a TM
+(Transverse Magnetic) cutoff mode of a rectangular waveguide.
+
+For more information regarding waveguides see
+
+http://www.ee.bilkent.edu.tr/~microwave/programs/magnetic/rect/info.htm
+
+See the pdf in the parent folder and the following reference
+
+The Finite Element in Electromagnetics (2nd Ed)
+Jianming Jin [7.2.1 - 7.2.2]
+
+"""
+# Copyright (C) 2008 Evan Lezar
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008.
+#
+# First added:  2008-08-22
+# Last changed: 2008-12-17
+
+from dolfin import *
+
+# Test for PETSc and SLEPc
+if not has_linear_algebra_backend("PETSc"):
+    print "DOLFIN has not been configured with PETSc. Exiting."
+    exit()
+
+if not has_slepc():
+    print "DOLFIN has not been configured with SLEPc. Exiting."
+    exit()
+
+# Make sure we use the PETSc backend
+parameters["linear_algebra_backend"] = "PETSc"
+
+# Create mesh
+width = 1.0
+height = 0.5
+mesh = RectangleMesh(0, 0, width, height, 4, 2)
+
+# Define the function space
+V = FunctionSpace(mesh, "Nedelec 1st kind H(curl)", 3)
+
+# Define the test and trial functions
+v = TestFunction(V)
+u = TrialFunction(V)
+
+# Define the forms - generates an generalized eigenproblem of the form
+# [S]{h} = k_o^2[T]{h}
+# with the eigenvalues k_o^2 representing the square of the cutoff wavenumber
+# and the corresponding right-eigenvector giving the coefficients of the
+# discrete system used to obtain the approximate field anywhere in the domain
+def curl_t(w):
+    return Dx(w[1], 0) - Dx(w[0], 1)
+s = curl_t(v)*curl_t(u)*dx
+t = inner(v, u)*dx
+
+# Assemble the stiffness matrix (S) and mass matrix (T)
+S = PETScMatrix()
+T = PETScMatrix()
+assemble(s, tensor=S)
+assemble(t, tensor=T)
+
+# Solve the eigensystem
+esolver = SLEPcEigenSolver(S, T)
+esolver.parameters["spectrum"] = "smallest real"
+esolver.parameters["solver"] = "lapack"
+esolver.solve()
+
+# The result should have real eigenvalues but due to rounding errors, some of
+# the resultant eigenvalues may be small complex values.
+# only consider the real part
+
+# Now, the system contains a number of zero eigenvalues (near zero due to
+# rounding) which are eigenvalues corresponding to the null-space of the curl
+# operator and are a mathematical construct and do not represent physically
+# realizable modes.  These are called spurious modes.
+# So, we need to identify the smallest, non-zero eigenvalue of the system -
+# which corresponds with cutoff wavenumber of the the dominant cutoff mode.
+cutoff = None
+for i in range(S.size(1)):
+    (lr, lc) = esolver.get_eigenvalue(i)
+    if lr > 1 and lc == 0:
+        cutoff = sqrt(lr)
+        break
+
+if cutoff is None:
+    print "Unable to find dominant mode"
+else:
+    print "Cutoff frequency:", cutoff
diff --git a/doc/CMakeLists.txt b/doc/CMakeLists.txt
new file mode 100644
index 0000000..f3825e6
--- /dev/null
+++ b/doc/CMakeLists.txt
@@ -0,0 +1,97 @@
+project(dolfin-doc)
+
+message(STATUS "Enabling generation of documentation.")
+
+# Copy most of doc directory to build directory
+file(COPY . DESTINATION ${CMAKE_CURRENT_BINARY_DIR}
+  FILES_MATCHING
+  PATTERN "*.rst"
+  PATTERN "*.py"
+  PATTERN "*.conf"
+  PATTERN "*.html"
+  PATTERN "*.png"
+  PATTERN "*.css*"
+  PATTERN "Makefile"
+  PATTERN "CMakeFiles" EXCLUDE)
+
+# Set directories for where sphinx projects and their source
+# directories are located
+set(DOLFIN_CPP_SPHINX_DIR "sphinx-cpp")
+set(DOLFIN_CPP_SPHINX_SOURCE_DIR "${DOLFIN_CPP_SPHINX_DIR}/source")
+set(DOLFIN_PYTHON_SPHINX_DIR "sphinx-python")
+set(DOLFIN_PYTHON_SPHINX_SOURCE_DIR "${DOLFIN_PYTHON_SPHINX_DIR}/source")
+
+# Initialize separate cpp and python projects
+message(STATUS "Initializing sphinx projects")
+
+file(COPY "${CMAKE_CURRENT_BINARY_DIR}/sphinx-common/"
+  DESTINATION "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_CPP_SPHINX_DIR}")
+file(COPY "${CMAKE_CURRENT_BINARY_DIR}/sphinx-common/"
+  DESTINATION "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_PYTHON_SPHINX_DIR}")
+
+configure_file("${CMAKE_CURRENT_BINARY_DIR}/quick_reference_python.rst"
+  "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_PYTHON_SPHINX_SOURCE_DIR}/quick_reference.rst" COPYONLY)
+configure_file("${CMAKE_CURRENT_BINARY_DIR}/quick_reference_cpp.rst"
+  "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_CPP_SPHINX_SOURCE_DIR}/quick_reference.rst" COPYONLY)
+
+execute_process(COMMAND ${PYTHON_EXECUTABLE} "${CMAKE_CURRENT_BINARY_DIR}/generate_main_index.py" "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_CPP_SPHINX_SOURCE_DIR}" "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_PYTHON_SPHINX_SOURCE_DIR}" "${DOLFIN_VERSION}")
+
+# Add target doc_api: generate reST files from code for cpp and
+# python. This takes a while.
+add_custom_target(doc_api
+  COMMAND ${PYTHON_EXECUTABLE} generate_api_doc.py
+    "${DOLFIN_SOURCE_DIR}" api "${DOLFIN_VERSION}"
+  COMMAND ${CMAKE_COMMAND} -E copy_directory
+    api/cpp/programmers-reference
+    "${DOLFIN_CPP_SPHINX_SOURCE_DIR}/programmers-reference"
+  COMMAND ${CMAKE_COMMAND} -E copy_directory
+    api/python/programmers-reference
+    "${DOLFIN_PYTHON_SPHINX_SOURCE_DIR}/programmers-reference"
+  WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}")
+
+# Add target doc_demo: copy demo code and doc files into sphinx
+# projects and add additional index files.
+add_custom_target(doc_demo
+  COMMAND ${PYTHON_EXECUTABLE} copy_and_split_demo_doc.py
+    "${DOLFIN_SOURCE_DIR}/demo"
+    "${DOLFIN_CPP_SPHINX_SOURCE_DIR}/demo"
+    "${DOLFIN_PYTHON_SPHINX_SOURCE_DIR}/demo"
+  WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}")
+
+# Add target doc_html_[cpp|python]: run sphinx in [cpp|python] sphinx
+# projects
+if (SPHINX_FOUND)
+  message(STATUS "Enabling generation of html-documentation")
+  add_custom_target(doc_html_cpp
+    COMMAND ${MAKE_PROGRAM} html
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_CPP_SPHINX_DIR}")
+
+  add_custom_target(doc_html_python
+    COMMAND ${MAKE_PROGRAM} html
+    WORKING_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_PYTHON_SPHINX_DIR}")
+
+  # Add target doc_html: run sphinx in both cpp and python
+  add_custom_target(doc_html)
+  add_dependencies(doc_html doc_html_cpp doc_html_python)
+
+  # Add target doc_generate_all: Generate all doc (api and demos)
+  add_custom_target(doc_generate_all)
+  add_dependencies(doc_generate_all doc_demo doc_api)
+
+  # FIXME: Want to run doc_generate_all before doc_html, but the order
+  # of the targets is necessarily respected here.
+  add_custom_target(doc)
+  add_dependencies(doc doc_generate_all doc_html)
+
+  # Add target: doc_install Copy generated sphinx projects to
+  # DOLFIN_DOC_DIR
+  add_custom_target(doc_install
+    COMMAND ${CMAKE_COMMAND} -E copy_directory
+      "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_CPP_SPHINX_DIR}"
+      "${CMAKE_INSTALL_PREFIX}/${DOLFIN_DOC_DIR}/${DOLFIN_CPP_SPHINX_DIR}"
+    COMMAND ${CMAKE_COMMAND} -E copy_directory
+      "${CMAKE_CURRENT_BINARY_DIR}/${DOLFIN_PYTHON_SPHINX_DIR}"
+      "${CMAKE_INSTALL_PREFIX}/${DOLFIN_DOC_DIR}/${DOLFIN_PYTHON_SPHINX_DIR}")
+  add_dependencies(doc_install doc)
+
+endif()
diff --git a/doc/README b/doc/README
new file mode 100644
index 0000000..3c7f197
--- /dev/null
+++ b/doc/README
@@ -0,0 +1,80 @@
+# Last changed: 2013-01-03
+
+This directory and its subdirectories contain (i) data and scripts for
+generating the DOLFIN library reference and consolidating the DOLFIN
+demo documentation and (ii) man pages for the scripts dolfin-convert,
+dolfin-order, dolfin-plot and dolfin-version.
+
+How to generate documentation:
+------------------------------
+
+In order to generate the documentation, Sphinx must be installed and
+enabled.
+
+To generate all .rst and .html documentation files for the DOLFIN
+library and the demos, follow these steps
+
+1. Build DOLFIN
+
+2. Make sure that the corresponding dolfin and dolfin_utils modules
+   are available
+
+3. Run
+
+   ./cmake/scripts/generate-swig-docstrings
+
+4. Run
+
+       make doc
+
+   in the build directory.
+
+The DOLFIN documentation will be generated in two Sphinx projects:
+
+    build/doc/sphinx-cpp
+    build/doc/sphinx-python
+
+providing documentation for the C++ library and demos, and the Python
+module and demos, respectively.
+
+The subdirectory sphinx-common acts as a template for these Sphinx
+projects.
+
+How to generate and install documentation:
+------------------------------------------
+
+To generate the documentation and install the generated Sphinx
+projects under /share/dolfin/doc, do
+
+       make doc_install
+
+
+What 'make doc' does:
+---------------------
+
+'make doc' will
+
+1. Copy sphinx-common into separate sphinx-cpp and sphinx-python
+
+2. Fill these Sphinx projects with suitable contents by running the
+   scripts
+
+   generate_api_doc.py ...
+
+       calls generate_[python|cpp]_api_documentation from
+       dolfin_utils.documentation with appropriate arguments
+
+   copy_and_split_demo_doc.py ...
+
+        copies documentation.rst from demo directories into the
+        suitable Sphinx projects and generates a .rst index file for
+        each tree
+
+   generate_main_index.py ...
+
+       generates a (version-dependent) main index.rst file for each
+       Sphinx project
+
+3. Use Sphinx to generate .html files from .rst files by running 'make
+   html' in the Sphinx projects
+
diff --git a/doc/copy_and_split_demo_doc.py b/doc/copy_and_split_demo_doc.py
new file mode 100644
index 0000000..35f6cbe
--- /dev/null
+++ b/doc/copy_and_split_demo_doc.py
@@ -0,0 +1,190 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Garth N. Wells, 2013
+#
+# Utility script for splitting the cpp and python demos into separate
+# directory trees. Ignores cmake files for python.
+
+import sys, os, shutil
+import subprocess
+
+index_template = """
+Collection of documented demos
+==============================
+
+.. toctree::
+   :glob:
+   :numbered:
+   :maxdepth: 1
+
+   */*/%s/documentation
+
+%s
+
+.. note::
+
+    You must have a working installation of FEniCS in order to run the
+    demos.
+
+"""
+
+
+run_cpp_demos = """
+To run the C++ demos, follow the below procedure:
+
+* Download the source files i.e., ``main.cpp`` and ``CMakeLists.txt``,
+  from the demo that you want to run. Some demos also contain UFL form
+  files, e.g., ``Poisson.ufl``. Note that there may be multiple form
+  files.
+
+* Compile the form files to generate code with DOLFIN wrappers::
+
+      $ ffc -l dolfin Poisson.ufl
+
+  Generated .h files are usually distributed with the demos so you may
+  choose to skip this step and use the provided header file directly,
+  in this case ``Poisson.h``.
+
+  If you wish to use optimized generated code, do::
+
+      $ ffc -O -l dolfin Poisson.ufl
+
+* Configure the demo build process::
+
+      $ cmake .
+
+* Compile the demo::
+
+      $ make
+
+* Run the created executable::
+
+    $ ./demo
+
+"""
+
+run_python_demos = """
+To run the Python demos, follow the below procedure:
+
+* Download the source file, e.g., ``demo_poisson.py``, for the demo that you
+  want to run.
+
+* Use the Python interpreter to run this file::
+
+      $ python demo.py
+
+"""
+
+run_instructions = {"cpp": run_cpp_demos, "python": run_python_demos}
+
+def generate_main_index_file(output_dir, language):
+
+    filename = os.path.join(output_dir, "index.rst")
+    file = open(filename, "w")
+    text = index_template % (language, run_instructions[language])
+    file.write(text)
+    file.close()
+
+
+def copy_split_demo_doc(input_dir, cpp_output_dir, python_output_dir):
+
+    # Get list of files in demo directories
+    try:
+
+        # Get root path of git repo
+        git_root  = subprocess.check_output(["git", "rev-parse", "--show-toplevel"]).splitlines()
+
+        # Get list of files tracked by git (relative to git root)
+        git_files = subprocess.check_output(["git", "ls-files", "--full-name", input_dir]).splitlines()
+
+        # Build list with full paths
+        git_files = [os.path.join(git_root[0],  f) for f in git_files]
+
+        if not git_files:
+            # Workaround for when we're not in a git repo
+            git_files = subprocess.check_output(["find", input_dir]).splitlines()
+    except:
+        git_files = None
+
+    def ignore_cpp(directory, contents):
+        if directory[-3:] == "cpp":
+            return contents
+        elif git_files is not None:
+            return [c for c in contents if not in_git(directory, c, git_files, ["cpp"]) ]
+        else:
+            return []
+
+    def ignore_python(directory, contents):
+        if directory[-6:] == "python":
+            return contents
+        elif git_files is not None:
+            return [c for c in contents if not in_git(directory, c, git_files, ["python"])]
+        else:
+            return []
+
+    # Copy demo tree to cpp_output_dir ignoring python demos
+    try:
+        shutil.rmtree(cpp_output_dir)
+    except:
+        pass
+    shutil.copytree(input_dir, cpp_output_dir, ignore=ignore_python)
+
+    # In addition, generate main index file for navigating demos
+    generate_main_index_file(cpp_output_dir, "cpp")
+
+    # Copy demo tree to python_output_dir ignoring cpp demos
+    try:
+        shutil.rmtree(python_output_dir)
+    except:
+        pass
+    shutil.copytree(input_dir, python_output_dir, ignore=ignore_cpp)
+
+    # In addition, generate main index file for navigating demos
+    generate_main_index_file(python_output_dir, "python")
+
+
+def in_git(directory, name, git_files, exclude_dirs=[]):
+    "Check whether file is version-controlled"
+
+    # Make sure we have the real path (remove symlinks)
+    directory = os.path.realpath(directory)
+
+    # Get file full path
+    f = os.path.join(directory, name)
+
+    # Return true if a directory (git doesn't track directories)
+    if os.path.isdir(f):
+        if name in exclude_dirs:
+            return False
+        else:
+            return True
+    return f in git_files
+
+
+if __name__ == "__main__":
+
+    args = sys.argv[1:]
+
+    if len(args) != 3:
+        usage= "Usage: python copy_and_split_demo_doc.py input_dir cpp_output_dir python_output_dir"
+        print usage
+        sys.exit(2)
+
+    copy_split_demo_doc(args[0], args[1], args[2])
diff --git a/doc/generate_api_doc.py b/doc/generate_api_doc.py
new file mode 100644
index 0000000..10e3700
--- /dev/null
+++ b/doc/generate_api_doc.py
@@ -0,0 +1,75 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Utility script for generating .rst documentation for DOLFIN
+
+import os, sys
+
+dolfin_import_error_msg = """
+Unable to import the %s module
+Error: %s
+Did you forget to update your PYTHONPATH variable?"""
+
+try:
+    import dolfin_utils
+except Exception as what:
+    raise ImportError(dolfin_import_error_msg % ("dolfin_utils", what))
+
+from dolfin_utils.documentation import generate_cpp_api_documentation
+from dolfin_utils.documentation import generate_python_api_documentation
+
+def generate_dolfin_doc(input_dir, output_dir, version=None):
+
+    if version is None:
+        version = "dev"
+
+    # Make output directory (or use current if existing)
+    try:
+        os.makedirs(output_dir)
+    except:
+        pass
+
+    # Generate .rst for C++ documentation
+    api_output_dir = os.path.join(output_dir, "cpp", "programmers-reference")
+    generate_cpp_api_documentation(input_dir, api_output_dir, version)
+
+    # Try to import DOLFIN Python module
+    module_name = "dolfin"
+    try:
+        exec("import %s" % module_name)
+        exec("module = %s" % module_name)
+    except Exception as what:
+        raise ImportError(dolfin_import_error_msg % (module_name, what))
+
+    # Generate .rst for Python documentation
+    api_output_dir = os.path.join(output_dir, "python", "programmers-reference")
+    generate_python_api_documentation(module, api_output_dir, version)
+
+    print "\nSuccessfully generated API documentation.\n"
+
+if __name__ == "__main__":
+
+    args = sys.argv[1:]
+
+    if len(args) != 3:
+        usage= "Usage: python generate_api_doc.py source_dir output_dir version"
+        print usage
+        sys.exit(2)
+
+    generate_dolfin_doc(args[0], args[1], args[2])
diff --git a/doc/generate_main_index.py b/doc/generate_main_index.py
new file mode 100644
index 0000000..e384ed2
--- /dev/null
+++ b/doc/generate_main_index.py
@@ -0,0 +1,85 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Utility script for creating main index.rst files in sphinx
+# documentation projects in DOLFIN.
+
+import os, sys
+
+index_template = """
+
+%(formatting)s
+%(title)s
+%(formatting)s
+
+%(body)s
+
+.. toctree::
+   :hidden:
+
+   programmers-reference/index
+   demo/index
+   quick_reference
+"""
+
+body = """
+The Demos
+=========
+
+:doc:`The demos <demo/index>` (Collection of documented demo programs)
+
+The Programmer's Reference
+==========================
+
+:ref:`Programmer's Reference Index <genindex>` (Classes, functions, terms)
+
+"""
+modules = """
+DOLFIN modules
+==================
+
+:ref:`DOLFIN Module Index <modindex>` (Modules)
+
+"""
+
+bodies = {"C++": body, "Python": (body + modules)}
+
+def generate_main_index_file(output_dir, language, version):
+
+    filename = os.path.join(output_dir, "index.rst")
+    file = open(filename, "w")
+    title = "Documentation for DOLFIN-%s (%s)" % (version, language)
+    text = index_template % {"title": title, "formatting": len(title)*"#",
+                             "body": bodies[language]}
+    file.write(text)
+    file.close()
+
+if __name__ == "__main__":
+
+    args = sys.argv[1:]
+
+    if len(args) != 3:
+        usage= "Usage: python generate_main_index.py cpp_output_dir python_output_dir version"
+        print usage
+        sys.exit(2)
+
+    generate_main_index_file(args[0], "C++", args[2])
+    generate_main_index_file(args[1], "Python", args[2])
+
+
diff --git a/doc/man/man1/dolfin-convert.1.gz b/doc/man/man1/dolfin-convert.1.gz
new file mode 100644
index 0000000000000000000000000000000000000000..a0bb17f439977c654847b1bedf7549715b290ec3
GIT binary patch
literal 789
zcmV+w1M2)AiwFo%-yll@17vS(W@&CMV{dMDWpZ>bF#wfS%Wm5+5WMRv7C96x5EE$*
zJrqR|$Iin=VjGrIw5WTaMM`2zkqRG){r6o;vZ*9)gI)wKcXqg3jYed74M*eI&E;e|
z7|o_%FBZ!qc%LLBy@u)V_99_g=0XiJtsb~>Fo03FavIt?_;z~(xi%GbZC(0(I-94H
zG$H5kv^@E-$|tk=ax$Byt9<bj2qA!5Le<`p4QTJeVvD(!s>3E^IZsyk`D##N>KK|O
z23*zwIu^E;bPFK{$2ShBV!$`Tkyt4Z*|oVRXwHrMNm}zv<XdR=yUiYjK0wj7e1M}(
zM3VVDNqt>w<2dVf?Z+MWrjp?zt3iLJ6}M%FgtwVDhAa23Uop^<y;9cgpO6paw4Dky
zQgE~93FwaFmNS7DE4bo@hA!7zoTkGV9)&AG*G_2FUc3l39Ys;?DXwsN4EU;TK%SBl
z$c5y)(d>_O!tT$+H57){<sqoew99tnX%qY%%tW5oH2b|9Nf(AY7+P{>sKjEyo|Vxx
zz4yC*hE4EV$;C!9Zzq#oV>nnr;j){#;rCt`Zb4<tS2cJiq;OlvjjmwI-DrHdAAcKm
zJZ-RlcmKnaI%-DaT|Z5LmpFU}RN^Fm@d;@2Qqt6LP}+fQG%Ywg23PLJj-rq<S#w~V
z`7DS!^cC{f=egK);(mjyB<eegJ!X3v>?tzldjjjptyll=GzzBA-ifcD&tpC+t`86_
zBKk6m7@T8-L`g*ekLkXAdVr074T3`GwHmb(5f8>iKoms;WL(Nah{kTu@2*;}O*vXc
zrmG4q#~#DI=Qe!%xLo@J3=cMDfxC=^|3GW<XHr;aiKJd-Wlb4T9DT3h9o{XkXN%|m
zl1FM$b)pc8O1XtcBb-C8LDv~7h86-hx+vh2#OIk6m6wz#{h45MSdOCBs5L~D^nqiq
z${Dft!M3m?${4D!aoeC)2=9ys|7_eb>Fk%lvPAc(sPafx(}FiW^&0u2OR5xpf(xOr
Tm0wM0o^<mE+~riELI(f<@{xS0

literal 0
HcmV?d00001

diff --git a/doc/man/man1/dolfin-order.1.gz b/doc/man/man1/dolfin-order.1.gz
new file mode 100644
index 0000000000000000000000000000000000000000..0cee65f7a94283a6b50ce8d723afe27687996250
GIT binary patch
literal 305
zcmV-10nYv(iwFpB-yll@17vS(W@&CMZ*pX1axO6dU68?U!Y~X#@A(R=hn<Esc19C0
zU@$R?+HydQLukD=Q{u2D72CdkEs@yRC61r$XUmw)A)3U?*<#g;lgTuRpf3cbb6AaD
zrlPR=O>xiG1=Y}l5G8~LFytzbdER2hC3p+IBG}9xLt)2UUXh_-Ot-6eoi0*=WB4l;
zxPYj0-QlOvJ1oEVk=R{m|3c3L?|;+R8$^si?1O*2d1~F+TBO7U<klEs?{49vA?KCl
z_IqebsOe~H?|^)c-Ogc^p;pd2)Ux5cI?4i>JO=M*lg;Dg`W7eY;8ZK`iQ(`CBW|IC
zr7cSs==L2tWg0D!?E^wqDF;S!BeginlKyu;+e$K%gQPpz;QgG|R|@e1#B^gQsQ~~0
Dgw>Yi

literal 0
HcmV?d00001

diff --git a/doc/man/man1/dolfin-plot.1.gz b/doc/man/man1/dolfin-plot.1.gz
new file mode 100644
index 0000000000000000000000000000000000000000..6dceec84e1f8c121105dd1f5037bc06487ddd19b
GIT binary patch
literal 321
zcmV-H0lxkpiwFp<2?k9917vS(W@&CMaBOdME-?UYkWFvGFbsz8`4tvtnvFZF0I>}u
z)>gC}CdwftZi$p8UE&J(_Y3PL4Q&_8*5mi}2QOAITBe(qbrNNpv>3sJF`lm=nZG?V
zX?3kk)M-l)fmdy(5stQPg^`g~2H}QCnPw2>?@5~F>zwfg{L->%i~dwAjWOeu`$KEd
zDt(P%Ds3y2iD56Xafk=lJ4=G_Y4Y%R_)l6!WpqN_4dc_SSf@#tUSzDS7Xg*^b_`$X
z&=+d9RKC;V3KB_#l_cB%5MBtvS%4QseDGWBUI()r1GwFdhWr>ldi12M32D_g;IOlf
zJRlu8ko{h8rj;kpwdl?9)CtKA{`k&!#VXz2efKOpoSh;<1JxDgMxyhuu}uS09pWrJ
Tzt@5r8*}yvavj%~wE+MCb-0zz

literal 0
HcmV?d00001

diff --git a/doc/man/man1/dolfin-version.1.gz b/doc/man/man1/dolfin-version.1.gz
new file mode 100644
index 0000000000000000000000000000000000000000..d4fefb9fc665d1479d6851acc52f4d716f7ba347
GIT binary patch
literal 236
zcmV<I02BWoiwFq90tQV217vS(W@&CMc4cyNX>V>WF#uhT!A`?45Jd0(idD~KCGH5d
z6{QJ+q^i?O9Gzro49+^(8>;?2Mkxoljr3-o2J0La57qNyQD(=@UKdrlfLo<d=TNR*
zHmdXP&2sidAzIInL1*LW%mt(;n1}ESc^VoD^H{%@)lL^$;TrxrX1+db6RUSh6L--1
zVIY=x1D_K`Nv#x{=>&mBA0z@viy;20S~?pgqB9e>{b)L55}duOL!DRq|F_R3!Z}zG
mVrVY#<a@)An-7A!_n(Y?%FEMWti$x>9@RHq!S4bY0RRAg;A<HG

literal 0
HcmV?d00001

diff --git a/doc/quick_reference_cpp.rst b/doc/quick_reference_cpp.rst
new file mode 100644
index 0000000..cc62477
--- /dev/null
+++ b/doc/quick_reference_cpp.rst
@@ -0,0 +1,50 @@
+
+.. title:: Quick Programmer's Reference (C++)
+
+##################################
+Quick Programmer's Reference (C++)
+##################################
+
+The complete :ref:`DOLFIN Programmer's Reference <genindex>` documents
+**all** the classes and functions in DOLFIN. As a **quicker**
+reference, here are some of the most commonly used classes and
+functions, organized by topic:
+
+.. tabularcolumns:: |c|c|c|c|
+
+.. list-table::
+    :widths: 20, 20, 20, 20
+    :header-rows: 1
+    :class: center
+
+    * - Finite elements
+      - Meshes
+      - Variational problems
+      - Linear systems
+
+    * - :cpp:class:`FunctionSpace`
+      - :cpp:class:`Mesh`
+      - :cpp:class:`LinearVariationalProblem`
+      - :cpp:func:`assemble`
+
+    * - :cpp:class:`Function`
+      - :cpp:class:`MeshFunction`
+      - :cpp:class:`LinearVariationalSolver`
+      - :cpp:class:`Vector`
+
+    * - :cpp:class:`Form`
+      - :cpp:class:`SubDomain`
+      - :cpp:class:`NonlinearVariationalProblem`
+      - :cpp:class:`Matrix`
+
+    * - :cpp:class:`Expression`
+      -
+      - :cpp:class:`NonlinearVariationalSolver`
+      - :cpp:class:`LUSolver`
+
+    * - :cpp:class:`DirichletBC`
+      -
+      - :cpp:func:`solve`
+      - :cpp:class:`KrylovSolver`
+
+
diff --git a/doc/quick_reference_python.rst b/doc/quick_reference_python.rst
new file mode 100644
index 0000000..f688eca
--- /dev/null
+++ b/doc/quick_reference_python.rst
@@ -0,0 +1,48 @@
+
+.. title:: Quick Programmer's Reference (Python)
+
+#####################################
+Quick Programmer's Reference (Python)
+#####################################
+
+The complete :ref:`DOLFIN Programmer's Reference <genindex>` documents
+**all** the classes and functions in DOLFIN. As a **quicker**
+reference, here are some of the most commonly used classes and
+functions, organized by topic:
+
+.. tabularcolumns:: |c|c|c|c|
+
+.. list-table::
+    :widths: 20, 20, 20, 20
+    :header-rows: 1
+    :class: center
+
+    * - Finite elements
+      - Meshes
+      - Variational problems
+      - Linear systems
+
+    * - :py:class:`FunctionSpace <dolfin.functions.functionspace.FunctionSpace>`
+      - :py:class:`Mesh <dolfin.cpp.mesh.Mesh>`
+      - :py:func:`solve <dolfin.fem.solving.solve>`
+      - :py:func:`assemble <dolfin.fem.assembling.assemble>`
+
+    * - :py:class:`TestFunction <dolfin.functions.function.TestFunction>`/:py:class:`TrialFunction <dolfin.functions.function.TrialFunction>`
+      - :py:class:`MeshFunction <dolfin.cpp.mesh.MeshFunction>`
+      - :py:class:`LinearVariationalProblem <dolfin.fem.solving.LinearVariationalProblem>`
+      - :py:class:`Vector <dolfin.cpp.la.Vector>`
+
+    * - :py:class:`Function <dolfin.functions.function.Function>`
+      - :py:class:`SubDomain <dolfin.cpp.mesh.SubDomain>`
+      - :py:class:`LinearVariationalSolver <dolfin.fem.solving.LinearVariationalSolver>`
+      - :py:class:`Matrix <dolfin.cpp.la.Matrix>`
+
+    * - :py:class:`Expression <dolfin.functions.expression.Expression>`
+      -
+      - :py:class:`NonlinearVariationalProblem <dolfin.fem.solving.NonlinearVariationalProblem>`
+      - :py:class:`LUSolver <dolfin.cpp.la.LUSolver>`
+
+    * - :py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>`
+      -
+      - :py:class:`NonlinearVariationalSolver <dolfin.fem.solving.NonlinearVariationalSolver>`
+      - :py:class:`KrylovSolver <dolfin.cpp.la.KrylovSolver>`
diff --git a/doc/sphinx-common/Makefile b/doc/sphinx-common/Makefile
new file mode 100644
index 0000000..61d9077
--- /dev/null
+++ b/doc/sphinx-common/Makefile
@@ -0,0 +1,130 @@
+# Makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+PAPER         =
+BUILDDIR      = build
+
+# Internal variables.
+PAPEROPT_a4     = -D latex_paper_size=a4
+PAPEROPT_letter = -D latex_paper_size=letter
+ALLSPHINXOPTS   = -d $(BUILDDIR)/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) source
+
+.PHONY: help clean html dirhtml singlehtml pickle json htmlhelp qthelp devhelp epub latex latexpdf text man changes linkcheck doctest
+
+help:
+	@echo "Please use \`make <target>' where <target> is one of"
+	@echo "  html       to make standalone HTML files"
+	@echo "  dirhtml    to make HTML files named index.html in directories"
+	@echo "  singlehtml to make a single large HTML file"
+	@echo "  pickle     to make pickle files"
+	@echo "  json       to make JSON files"
+	@echo "  htmlhelp   to make HTML files and a HTML help project"
+	@echo "  qthelp     to make HTML files and a qthelp project"
+	@echo "  devhelp    to make HTML files and a Devhelp project"
+	@echo "  epub       to make an epub"
+	@echo "  latex      to make LaTeX files, you can set PAPER=a4 or PAPER=letter"
+	@echo "  latexpdf   to make LaTeX files and run them through pdflatex"
+	@echo "  text       to make text files"
+	@echo "  man        to make manual pages"
+	@echo "  changes    to make an overview of all changed/added/deprecated items"
+	@echo "  linkcheck  to check all external links for integrity"
+	@echo "  doctest    to run all doctests embedded in the documentation (if enabled)"
+
+clean:
+	-rm -rf $(BUILDDIR)/*
+
+html:
+	$(SPHINXBUILD) -b html $(ALLSPHINXOPTS) $(BUILDDIR)/html
+	@echo
+	@echo "Build finished. The HTML pages are in $(BUILDDIR)/html."
+
+dirhtml:
+	$(SPHINXBUILD) -b dirhtml $(ALLSPHINXOPTS) $(BUILDDIR)/dirhtml
+	@echo
+	@echo "Build finished. The HTML pages are in $(BUILDDIR)/dirhtml."
+
+singlehtml:
+	$(SPHINXBUILD) -b singlehtml $(ALLSPHINXOPTS) $(BUILDDIR)/singlehtml
+	@echo
+	@echo "Build finished. The HTML page is in $(BUILDDIR)/singlehtml."
+
+pickle:
+	$(SPHINXBUILD) -b pickle $(ALLSPHINXOPTS) $(BUILDDIR)/pickle
+	@echo
+	@echo "Build finished; now you can process the pickle files."
+
+json:
+	$(SPHINXBUILD) -b json $(ALLSPHINXOPTS) $(BUILDDIR)/json
+	@echo
+	@echo "Build finished; now you can process the JSON files."
+
+htmlhelp:
+	$(SPHINXBUILD) -b htmlhelp $(ALLSPHINXOPTS) $(BUILDDIR)/htmlhelp
+	@echo
+	@echo "Build finished; now you can run HTML Help Workshop with the" \
+	      ".hhp project file in $(BUILDDIR)/htmlhelp."
+
+qthelp:
+	$(SPHINXBUILD) -b qthelp $(ALLSPHINXOPTS) $(BUILDDIR)/qthelp
+	@echo
+	@echo "Build finished; now you can run "qcollectiongenerator" with the" \
+	      ".qhcp project file in $(BUILDDIR)/qthelp, like this:"
+	@echo "# qcollectiongenerator $(BUILDDIR)/qthelp/DOLFIN.qhcp"
+	@echo "To view the help file:"
+	@echo "# assistant -collectionFile $(BUILDDIR)/qthelp/DOLFIN.qhc"
+
+devhelp:
+	$(SPHINXBUILD) -b devhelp $(ALLSPHINXOPTS) $(BUILDDIR)/devhelp
+	@echo
+	@echo "Build finished."
+	@echo "To view the help file:"
+	@echo "# mkdir -p $$HOME/.local/share/devhelp/DOLFIN"
+	@echo "# ln -s $(BUILDDIR)/devhelp $$HOME/.local/share/devhelp/DOLFIN"
+	@echo "# devhelp"
+
+epub:
+	$(SPHINXBUILD) -b epub $(ALLSPHINXOPTS) $(BUILDDIR)/epub
+	@echo
+	@echo "Build finished. The epub file is in $(BUILDDIR)/epub."
+
+latex:
+	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
+	@echo
+	@echo "Build finished; the LaTeX files are in $(BUILDDIR)/latex."
+	@echo "Run \`make' in that directory to run these through (pdf)latex" \
+	      "(use \`make latexpdf' here to do that automatically)."
+
+latexpdf:
+	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
+	@echo "Running LaTeX files through pdflatex..."
+	make -C $(BUILDDIR)/latex all-pdf
+	@echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex."
+
+text:
+	$(SPHINXBUILD) -b text $(ALLSPHINXOPTS) $(BUILDDIR)/text
+	@echo
+	@echo "Build finished. The text files are in $(BUILDDIR)/text."
+
+man:
+	$(SPHINXBUILD) -b man $(ALLSPHINXOPTS) $(BUILDDIR)/man
+	@echo
+	@echo "Build finished. The manual pages are in $(BUILDDIR)/man."
+
+changes:
+	$(SPHINXBUILD) -b changes $(ALLSPHINXOPTS) $(BUILDDIR)/changes
+	@echo
+	@echo "The overview file is in $(BUILDDIR)/changes."
+
+linkcheck:
+	$(SPHINXBUILD) -b linkcheck $(ALLSPHINXOPTS) $(BUILDDIR)/linkcheck
+	@echo
+	@echo "Link check complete; look for any errors in the above output " \
+	      "or in $(BUILDDIR)/linkcheck/output.txt."
+
+doctest:
+	$(SPHINXBUILD) -b doctest $(ALLSPHINXOPTS) $(BUILDDIR)/doctest
+	@echo "Testing of doctests in the sources finished, look at the " \
+	      "results in $(BUILDDIR)/doctest/output.txt."
diff --git a/doc/sphinx-common/README b/doc/sphinx-common/README
new file mode 100644
index 0000000..ea3c8a2
--- /dev/null
+++ b/doc/sphinx-common/README
@@ -0,0 +1,5 @@
+The contents of this directory were generated by sphinx-quickstart and
+then modified.
+
+To change the style of the generated html-documenation, modify
+./source/conf.py and/or ./source/_themes/...
diff --git a/doc/sphinx-common/source/conf.py b/doc/sphinx-common/source/conf.py
new file mode 100644
index 0000000..8bbb7ca
--- /dev/null
+++ b/doc/sphinx-common/source/conf.py
@@ -0,0 +1,230 @@
+# -*- coding: utf-8 -*-
+#
+# DOLFIN documentation build configuration file, created by
+# sphinx-quickstart on Tue May 24 22:58:54 2011.
+#
+# This file is execfile()d with the current directory set to its containing dir.
+#
+# Note that not all possible configuration values are present in this
+# autogenerated file.
+#
+# All configuration values have a default; values that are commented out
+# serve to show the default.
+
+import sys, os
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#sys.path.insert(0, os.path.abspath('.'))
+
+# -- General configuration -----------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+needs_sphinx = '1.1'
+
+# Add any Sphinx extension module names here, as strings. They can be extensions
+# coming with Sphinx (named 'sphinx.ext.*') or your custom ones.
+#extensions = ['sphinx.ext.autodoc', 'sphinx.ext.doctest', 'sphinx.ext.intersphinx',
+#              'sphinx.ext.pngmath']
+
+# Use mahjax maths
+extensions = ['sphinx.ext.autodoc', 'sphinx.ext.doctest', 'sphinx.ext.intersphinx',
+              'sphinx.ext.mathjax']
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix of source filenames.
+source_suffix = '.rst'
+
+# The encoding of source files.
+#source_encoding = 'utf-8-sig'
+
+# The master toctree document.
+master_doc = 'index'
+
+# General information about the project.
+project = u'DOLFIN'
+copyright = u'DOLFIN Core, https://launchpad.net/~dolfin-core'
+
+# The version info for the project you're documenting, acts as replacement for
+# |version| and |release|, also used in various other places throughout the
+# built documents.
+#
+# The short X.Y version.
+version = '0.9.11+'
+# The full version, including alpha/beta/rc tags.
+release = '0.9.11+'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#language = None
+
+# There are two options for replacing |today|: either, you set today to some
+# non-false value, then it is used:
+#today = ''
+# Else, today_fmt is used as the format for a strftime call.
+#today_fmt = '%B %d, %Y'
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+exclude_patterns = []
+
+# The reST default role (used for this markup: `text`) to use for all documents.
+#default_role = None
+
+# If true, '()' will be appended to :func: etc. cross-reference text.
+#add_function_parentheses = True
+
+# If true, the current module name will be prepended to all description
+# unit titles (such as .. function::).
+#add_module_names = True
+
+# If true, sectionauthor and moduleauthor directives will be shown in the
+# output. They are ignored by default.
+#show_authors = False
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+# A list of ignored prefixes for module index sorting.
+modindex_common_prefix = ["dolfin.", "dolfin.cpp."]
+
+# -- Options for HTML output ---------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+html_theme = 'nature'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#html_theme_options = {}
+
+# Add any paths that contain custom themes here, relative to this directory.
+html_theme_path = ["_themes"]
+
+# The name for this set of Sphinx documents.  If None, it defaults to
+# "<project> v<release> documentation".
+html_title = "FEniCS Project"
+
+# A shorter title for the navigation bar.  Default is the same as html_title.
+#html_short_title = None
+
+# The name of an image file (relative to this directory) to place at the top
+# of the sidebar.
+#html_logo = None
+
+# The name of an image file (within the static path) to use as favicon of the
+# docs.  This file should be a Windows icon file (.ico) being 16x16 or 32x32
+# pixels large.
+#html_favicon = None
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# If not '', a 'Last updated on:' timestamp is inserted at every page bottom,
+# using the given strftime format.
+#html_last_updated_fmt = '%b %d, %Y'
+
+# If true, SmartyPants will be used to convert quotes and dashes to
+# typographically correct entities.
+#html_use_smartypants = True
+
+# Custom sidebar templates, maps document names to template names.
+#html_sidebars = {}
+
+# Additional templates that should be rendered to pages, maps page names to
+# template names.
+#html_additional_pages = {}
+
+# If false, no module index is generated.
+#html_domain_indices = True
+
+# If false, no index is generated.
+#html_use_index = True
+
+# If true, the index is split into individual pages for each letter.
+html_split_index = False
+
+# If true, links to the reST sources are added to the pages.
+#html_show_sourcelink = True
+
+# If true, "Created using Sphinx" is shown in the HTML footer. Default is True.
+#html_show_sphinx = True
+
+# If true, "(C) Copyright ..." is shown in the HTML footer. Default is True.
+#html_show_copyright = True
+
+# If true, an OpenSearch description file will be output, and all pages will
+# contain a <link> tag referring to it.  The value of this option must be the
+# base URL from which the finished HTML is served.
+#html_use_opensearch = ''
+
+# This is the file name suffix for HTML files (e.g. ".xhtml").
+#html_file_suffix = None
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'DOLFINdoc'
+
+
+# -- Options for LaTeX output --------------------------------------------------
+
+# The paper size ('letter' or 'a4').
+#latex_paper_size = 'letter'
+
+# The font size ('10pt', '11pt' or '12pt').
+#latex_font_size = '10pt'
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title, author, documentclass [howto/manual]).
+latex_documents = [
+  ('index', 'DOLFIN.tex', u'DOLFIN Documentation',
+   u'DOLFIN Team', 'manual'),
+]
+
+# The name of an image file (relative to this directory) to place at the top of
+# the title page.
+#latex_logo = None
+
+# For "manual" documents, if this is true, then toplevel headings are parts,
+# not chapters.
+#latex_use_parts = False
+
+# If true, show page references after internal links.
+#latex_show_pagerefs = False
+
+# If true, show URL addresses after external links.
+#latex_show_urls = False
+
+# Additional stuff for the LaTeX preamble.
+#latex_preamble = ''
+
+# Documents to append as an appendix to all manuals.
+#latex_appendices = []
+
+# If false, no module index is generated.
+#latex_domain_indices = True
+
+# Parameters affecting the LaTeX PNGs in the HTML files
+pngmath_latex_preamble = r" \usepackage{stmaryrd} "
+
+# -- Options for manual page output --------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    ('index', 'dolfin', u'DOLFIN Documentation',
+     [u'DOLFIN Team'], 1)
+]
+
+
+# Example configuration for intersphinx: refer to the Python standard library.
+intersphinx_mapping = {'http://docs.python.org/': None}
+
+# Use docstrings both from __init__ and class when using autodoc for
+# Python classes
+autoclass_content = "both"
diff --git a/doc/sphinx-common/source/index.rst b/doc/sphinx-common/source/index.rst
new file mode 100644
index 0000000..e69de29
diff --git a/dolfin/CMakeLists.txt b/dolfin/CMakeLists.txt
new file mode 100644
index 0000000..cf6e90e
--- /dev/null
+++ b/dolfin/CMakeLists.txt
@@ -0,0 +1,423 @@
+set(DOLFIN_H dolfin.h)
+install(FILES ${DOLFIN_H} DESTINATION ${DOLFIN_INCLUDE_DIR} COMPONENT Development)
+
+#set(CMAKE_SKIP_BUILD_RPATH  FALSE)
+set(CMAKE_INSTALL_RPATH_USE_LINK_PATH TRUE)
+
+# Macros
+
+#------------------------------------------------------------------------------
+# DOLFIN source directories
+
+# All files and directories in this directory
+file(GLOB DOLFIN_CONTENT RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} *)
+
+# Initialize list
+set(DOLFIN_DIRS)
+
+# List of excluded files and directories
+set(EXCLUDES ${DOLFIN_H} swig CMakeLists.txt)
+
+# Iterate over all directories and files and append to DOLFIN_DIRS
+foreach(_DIR_NAME ${DOLFIN_CONTENT})
+  list(FIND EXCLUDES ${_DIR_NAME} INDEX_EXCLUDES)
+  if (${INDEX_EXCLUDES} LESS 0)
+    list(APPEND DOLFIN_DIRS ${_DIR_NAME})
+  endif()
+endforeach()
+
+#------------------------------------------------------------------------------
+# Install header files
+
+foreach(DIR ${DOLFIN_DIRS})
+  file(GLOB _HEADERS ${DIR}/*.h)
+  list(APPEND HEADERS ${_HEADERS})
+  install(FILES ${_HEADERS} DESTINATION ${DOLFIN_INCLUDE_DIR}/dolfin/${DIR} COMPONENT Development)
+
+  file(GLOB _SOURCES ${DIR}/*.cpp)
+  list(APPEND SOURCES ${_SOURCES})
+endforeach()
+
+#------------------------------------------------------------------------------
+# Add include directories and libs of required packages
+
+# NOTE: The include path for dependecies should be appended to
+#       DOLFIN_DEP_INCLUDE_DIRECTORIES, unless there are issues, such
+#       as unused variable that can cause build errors when using strict
+#       compiler flags, in which case the path should be appended to
+#       DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES
+
+# libXml2
+list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${LIBXML2_INCLUDE_DIR})
+list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${LIBXML2_LIBRARIES})
+list(APPEND DOLFIN_CXX_DEFINITIONS ${LIBXML2_DEFINITIONS})
+
+# UFC
+list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${UFC_INCLUDE_DIRS})
+
+# Eigen3
+list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${EIGEN3_INCLUDE_DIR})
+
+# Boost
+list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${Boost_INCLUDE_DIR})
+list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${Boost_LIBRARIES})
+list(APPEND APPEND DOLFIN_TARGET_LINK_LIBRARIES_DIRS ${Boost_LIBRARY_DIRS})
+
+#------------------------------------------------------------------------------
+
+# HDF5
+if (DOLFIN_ENABLE_HDF5 AND HDF5_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_HDF5")
+  list(APPEND DOLFIN_CXX_DEFINITIONS ${HDF5_DEFINITIONS})
+  list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${HDF5_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${HDF5_LIBRARIES})
+  list(APPEND DOLFIN_LINK_FLAGS ${HDF5_LINK_FLAGS})
+endif()
+
+# Trilinos
+if (DOLFIN_ENABLE_TRILINOS AND DOLFIN_TRILINOS_PACKAGES_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_TRILINOS")
+  list(APPEND DOLFIN_CXX_DEFINITIONS ${DOLFIN_TRILINOS_DEFINITIONS})
+  list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${Trilinos_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${DOLFIN_TRILINOS_LIBRARIES})
+endif()
+
+# SLEPC
+if (DOLFIN_ENABLE_PETSC AND DOLFIN_ENABLE_SLEPC AND SLEPC_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_SLEPC")
+  list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${SLEPC_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${SLEPC_LIBRARIES})
+endif()
+
+# PETSc
+if (DOLFIN_ENABLE_PETSC AND PETSC_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_PETSC")
+  list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${PETSC_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${PETSC_LIBRARIES})
+  if (PETSC_CUSP_FOUND)
+    list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_PETSC_CUSP")
+  endif()
+
+  if (PETSC_ENABLE_SNES)
+    list(APPEND DOLFIN_CXX_DEFINITIONS "-DENABLE_PETSC_SNES")
+  endif()
+
+  if (PETSC_ENABLE_TAO)
+    list(APPEND DOLFIN_CXX_DEFINITIONS "-DENABLE_PETSC_TAO")
+  endif()
+endif()
+
+# petsc4py
+if (DOLFIN_ENABLE_PETSC AND DOLFIN_ENABLE_PETSC4PY AND PETSC4PY_FOUND)
+  list(APPEND DOLFIN_PYTHON_DEFINITIONS "-DHAS_PETSC4PY")
+  list(APPEND PYTHON_INCLUDE_DIRS ${PETSC4PY_INCLUDE_DIRS})
+endif()
+
+# UMFPACK
+if (DOLFIN_ENABLE_UMFPACK AND UMFPACK_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_UMFPACK")
+  list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${UMFPACK_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${UMFPACK_LIBRARIES})
+endif()
+
+# CHOLMOD
+if (DOLFIN_ENABLE_CHOLMOD AND CHOLMOD_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_CHOLMOD")
+  list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${CHOLMOD_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${CHOLMOD_LIBRARIES})
+endif()
+
+# PaStiX
+if (DOLFIN_ENABLE_PASTIX AND PASTIX_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_PASTIX")
+  list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${PASTIX_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${PASTIX_LIBRARIES})
+endif()
+
+# SCOTCH
+if (DOLFIN_ENABLE_SCOTCH AND SCOTCH_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_SCOTCH")
+  list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${SCOTCH_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${SCOTCH_LIBRARIES})
+endif()
+
+# ParMETIS
+if (DOLFIN_ENABLE_PARMETIS AND PARMETIS_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_PARMETIS")
+  list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${PARMETIS_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${PARMETIS_LIBRARIES})
+endif()
+
+# CGAL
+if (DOLFIN_ENABLE_CGAL AND CGAL_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_CGAL")
+  list(APPEND DOLFIN_CXX_DEFINITIONS "${CGAL_DEFINITIONS}")
+  list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${CGAL_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${CGAL_LIBRARIES})
+
+  # Add necessary CGAL flags (usually related to floating point)
+  set(DOLFIN_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CGAL_CXX_FLAGS_INIT}")
+
+  # Add options that will allow valgrind to run
+  if (CGAL_DISABLE_ROUNDING_MATH_CHECK)
+    list(APPEND DOLFIN_CXX_DEFINITIONS "-DCGAL_DISABLE_ROUNDING_MATH_CHECK")
+  endif()
+
+endif()
+
+# ZLIB
+if (DOLFIN_ENABLE_ZLIB AND ZLIB_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_ZLIB")
+  list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${ZLIB_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${ZLIB_LIBRARIES})
+endif()
+
+# CppUnit
+if (DOLFIN_ENABLE_UNIT_TESTS AND CPPUNIT_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_CPPUNIT")
+  list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${CPPUNIT_INCLUDE_DIRS})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${CPPUNIT_LIBRARIES})
+endif()
+
+# MPI
+if (DOLFIN_ENABLE_MPI AND MPI_CXX_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_MPI")
+  list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${MPI_CXX_INCLUDE_PATH})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${MPI_CXX_LIBRARIES})
+  list(APPEND DOLFIN_DEP_INCLUDE_DIRECTORIES ${MPI_CXX_INCLUDE_PATH})
+  set(DOLFIN_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${MPI_CXX_COMPILE_FLAGS}")
+
+endif()
+
+# OpenMP
+if (DOLFIN_ENABLE_OPENMP AND OPENMP_FOUND)
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_OPENMP")
+  set(DOLFIN_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${OpenMP_CXX_FLAGS}")
+
+  if (MINGW)
+    list(APPEND DOLFIN_LINK_FLAGS "${OpenMP_CXX_FLAGS}")
+  endif()
+
+endif()
+
+# Qt4
+if (DOLFIN_ENABLE_QT AND QT_FOUND)
+  include(${QT_USE_FILE})
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_QT4")
+  list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${QT_INCLUDE_DIR})
+  list(APPEND DOLFIN_TARGET_LINK_LIBRARIES ${QT_LIBRARIES})
+endif()
+
+# VTK
+if (DOLFIN_ENABLE_VTK AND VTK_FOUND)
+  include(${VTK_USE_FILE})
+
+  # The Macports VTK library includes some deprecated gcc code
+  if (APPLE)
+    set(DOLFIN_CXX_FLAGS "${DOLFIN_CXX_FLAGS} -Wno-deprecated")
+  endif()
+
+  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_VTK")
+  list(APPEND DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES ${VTK_INCLUDE_DIRS})
+
+  foreach (lib ${VTK_LIBRARIES})
+    list(APPEND DOLFIN_VTK_LIBRARIES ${lib})
+  endforeach()
+
+  # Check if the QVTK library is found
+  if (DOLFIN_ENABLE_QT AND QT_FOUND)
+    if ("${VTK_MAJOR_VERSION}" STREQUAL "5")
+      find_library(VTK_LIB_QVTK QVTK HINTS ${VTK_LIBRARY_DIRS} NO_DEFAULT_PATH)
+      find_library(VTK_LIB_QVTK QVTK HINTS ${VTK_LIBRARY_DIRS})
+      if (VTK_LIB_QVTK)
+	list(APPEND DOLFIN_VTK_LIBRARIES ${VTK_LIB_QVTK})
+      endif()
+    else()
+      if (TARGET vtkGUISupportQt)
+	set(VTK_LIB_QVTK TRUE)
+      endif()
+    endif()
+
+    if (VTK_LIB_QVTK)
+      list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_QVTK")
+    else()
+      message(STATUS "QVTK not found, disabling QT for plotting")
+    endif()
+  endif()
+
+  # FIXME: This is a poor(no) test and leads to builds breaking on some
+  #  systems. VTK-Exodus support is therefore disabled. See
+  #  https://bitbucket.org/fenics-project/dolfin/issue/104.
+  # Check if the VTK-Exodus library is found.
+  #
+  # Normally, it should be included in libvtkParallel.so (check out the output
+  # of
+  #     $ nm -D /usr/lib/libvtkParallel.so | grep ExodusIIWriter
+  # but on some systems, this doesn't seem to be the case. Check if the
+  # appropriate header exists and store this information in HAS_VTK_EXODUS.
+  #include(CheckIncludeFileCXX)
+  #set(CMAKE_REQUIRED_INCLUDES "${VTK_INCLUDE_DIRS}")
+  #CHECK_INCLUDE_FILE_CXX(vtkExodusIIWriter.h  HAS_VTK_EXODUS)
+  #if (HAS_VTK_EXODUS)
+  #  list(APPEND DOLFIN_CXX_DEFINITIONS "-DHAS_VTK_EXODUS")
+  #else()
+  #  message(STATUS "vtkExodusIIWriter not found, disabling Exodus file writing")
+  #endif()
+
+  # Append to EXTRA libraries, so they are not linked with demos (this fails
+  # with VTK6 unless the vtk macros are also installed).
+  list(APPEND DOLFIN_EXTRA_TARGET_LINK_LIBRARIES ${DOLFIN_VTK_LIBRARIES})
+endif()
+
+#------------------------------------------------------------------------------
+# Set compiler flags, include directories and library dependencies
+
+# Add compiler include directories
+include_directories(${DOLFIN_SOURCE_DIR} ${DOLFIN_DEP_INCLUDE_DIRECTORIES})
+include_directories(SYSTEM ${DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES})
+
+# Add CXX definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+add_definitions(-DDOLFIN_VERSION="${DOLFIN_VERSION}"
+  -DDOLFIN_GIT_COMMIT_HASH="${GIT_COMMIT_HASH}")
+
+# Add flags
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${DOLFIN_CXX_FLAGS}")
+set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} ${DOLFIN_LINK_FLAGS}")
+set(CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} ${DOLFIN_LINK_FLAGS}")
+
+# Define libraries
+add_library(dolfin ${DOLFIN_H} ${HEADERS} ${SOURCES})
+set_target_properties(dolfin PROPERTIES ${DOLFIN_LIBRARY_PROPERTIES})
+
+# Strip leading and trailing whitespaces
+string(STRIP DOLFIN_TARGET_LINK_LIBRARIES "${DOLFIN_TARGET_LINK_LIBRARIES}")
+
+# Add DOLFIN target libraries
+target_link_libraries(dolfin ${DOLFIN_TARGET_LINK_LIBRARIES} ${DOLFIN_EXTRA_TARGET_LINK_LIBRARIES})
+#------------------------------------------------------------------------------
+# SWIG
+
+if (PYTHONINTERP_FOUND AND PYTHONLIBS_FOUND AND SWIG_FOUND)
+
+  # Make sure we can import the UFC module and that it is compiled with present
+  # version of SWIG
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} -c "from ufc import *; import sys; sys.stdout.write('.'.join([str(int(s)) for s in ufc.__swigversion__.split('.')]))"
+    OUTPUT_VARIABLE UFC_SWIGVERSION
+    RESULT_VARIABLE UFC_MODULE_NOT_FOUND
+    )
+
+  # Check that UFC can be imported
+  if (UFC_MODULE_NOT_FOUND)
+    message(WARNING "Unable to import UFC. Install latest UFC or check that PYTHONPATH is set appropriately. Python will be disabled.")
+  endif()
+
+  # Check that UFC was built with the version of SWIG that is being used
+  if (NOT UFC_MODULE_NOT_FOUND AND (NOT "${SWIG_VERSION}" STREQUAL "${UFC_SWIGVERSION}"))
+    message(WARNING "UFC compiled with different version of SWIG. Please install SWIG version ${UFC_SWIGVERSION} or recompile UFC with present SWIG.")
+  endif()
+
+  # If suitble UFC SWIG extension is found, add SWIG subdirectory
+  if (NOT UFC_MODULE_NOT_FOUND AND ("${SWIG_VERSION}" STREQUAL "${UFC_SWIGVERSION}"))
+    add_subdirectory(swig)
+  endif()
+
+endif()
+
+#------------------------------------------------------------------------------
+# Install
+
+install(TARGETS dolfin
+  RUNTIME DESTINATION ${DOLFIN_LIB_DIR} COMPONENT RuntimeExecutables
+  LIBRARY DESTINATION ${DOLFIN_LIB_DIR} COMPONENT RuntimeLibraries
+  ARCHIVE DESTINATION ${DOLFIN_LIB_DIR} COMPONENT Development
+  )
+
+#------------------------------------------------------------------------------
+# Generate pkg-config file and install it
+
+# Define packages that should be required by pkg-config file
+set(PKG_REQUIRES "")
+
+# Convert include dirs to -I<incdir> form
+foreach(_inc_dir ${DOLFIN_DEP_INCLUDE_DIRECTORIES})
+  set(PKG_INCLUDES "-I${_inc_dir} ${PKG_INCLUDES}")
+endforeach()
+
+foreach(_inc_dir ${DOLFIN_DEP_SYSTEM_INCLUDE_DIRECTORIES})
+  set(PKG_INCLUDES "-I${_inc_dir} ${PKG_INCLUDES}")
+endforeach()
+
+# Convert compiler flags and definitions into space separated strings
+string(REPLACE ";" " " PKG_CXXFLAGS "${CMAKE_CXX_FLAGS}")
+string(REPLACE ";" " " PKG_LINKFLAGS "${CMAKE_EXE_LINKER_FLAGS}")
+string(REPLACE ";" " " PKG_DEFINITIONS "${DOLFIN_CXX_DEFINITIONS}")
+
+# Convert libraries to -L<libdir> -l<lib> form
+foreach(_lib ${DOLFIN_TARGET_LINK_LIBRARIES})
+  # Add -Wl,option directives
+  if ("${_lib}" MATCHES "-Wl,[^ ]*")
+     set(PKG_LINKFLAGS "${_lib} ${PKG_LINKFLAGS}")
+  else()
+    string(REGEX REPLACE "(.?:?/[^ ]*)/lib([^ ]*)\\.(a|so|dylib|dll)" "-L\\1 -l\\2"
+      _linkflags
+      "${_lib}"
+      )
+
+    # Add libraries that matches the form -L<libdir> -l<lib>
+    if ("${_linkflags}" MATCHES "-L.+ -l.+")
+        set(PKG_LINKFLAGS "${_linkflags} ${PKG_LINKFLAGS}")
+    endif()
+  endif()
+endforeach()
+
+# Remove duplicated link flags
+separate_arguments(PKG_LINKFLAGS)
+list(REMOVE_DUPLICATES PKG_LINKFLAGS)
+string(REPLACE ";" " " PKG_LINKFLAGS "${PKG_LINKFLAGS}")
+
+# Add additional link flags
+foreach(_linkflag ${DOLFIN_LINK_FLAGS})
+  set(PKG_LINKFLAGS "${PKG_LINKFLAGS} ${_linkflag}")
+endforeach()
+
+# Configure and install pkg-config file
+configure_file(${DOLFIN_CMAKE_DIR}/templates/dolfin.pc.in ${CMAKE_BINARY_DIR}/dolfin.pc @ONLY)
+install(FILES ${CMAKE_BINARY_DIR}/dolfin.pc
+  DESTINATION ${DOLFIN_PKGCONFIG_DIR}
+  COMPONENT Development
+  )
+
+#------------------------------------------------------------------------------
+# Generate CMake config files (DOLFINConfig{,Version}.cmake)
+
+# Set library location
+get_target_property(DOLFIN_LIBRARY_LOCATION dolfin LOCATION)
+get_filename_component(DOLFIN_LIBRARY_FILENAME ${DOLFIN_LIBRARY_LOCATION} NAME)
+set(DOLFIN_LIBRARY "${CMAKE_INSTALL_PREFIX}/${DOLFIN_LIB_DIR}/${DOLFIN_LIBRARY_FILENAME}")
+
+configure_file(${DOLFIN_CMAKE_DIR}/templates/DOLFINConfig.cmake.in
+  ${CMAKE_BINARY_DIR}/dolfin/DOLFINConfig.cmake @ONLY)
+configure_file(${DOLFIN_CMAKE_DIR}/templates/DOLFINConfigVersion.cmake.in
+  ${CMAKE_BINARY_DIR}/dolfin/DOLFINConfigVersion.cmake @ONLY)
+# Keep dolfin-config{-version}.cmake for backwards compatability
+configure_file(${DOLFIN_CMAKE_DIR}/templates/dolfin-config.cmake.in
+  ${CMAKE_BINARY_DIR}/dolfin/dolfin-config.cmake @ONLY)
+configure_file(${DOLFIN_CMAKE_DIR}/templates/dolfin-config-version.cmake.in
+  ${CMAKE_BINARY_DIR}/dolfin/dolfin-config-version.cmake @ONLY)
+configure_file(${DOLFIN_CMAKE_DIR}/templates/UseDOLFIN.cmake.in
+  ${CMAKE_BINARY_DIR}/dolfin/UseDOLFIN.cmake @ONLY)
+
+install(
+  FILES
+    ${CMAKE_BINARY_DIR}/dolfin/DOLFINConfig.cmake
+    ${CMAKE_BINARY_DIR}/dolfin/DOLFINConfigVersion.cmake
+    ${CMAKE_BINARY_DIR}/dolfin/dolfin-config.cmake
+    ${CMAKE_BINARY_DIR}/dolfin/dolfin-config-version.cmake
+    ${CMAKE_BINARY_DIR}/dolfin/UseDOLFIN.cmake
+  DESTINATION ${DOLFIN_SHARE_DIR}/cmake
+  COMPONENT Development
+  )
+
+#------------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/AdaptiveLinearVariationalSolver.cpp b/dolfin/adaptivity/AdaptiveLinearVariationalSolver.cpp
new file mode 100644
index 0000000..1639037
--- /dev/null
+++ b/dolfin/adaptivity/AdaptiveLinearVariationalSolver.cpp
@@ -0,0 +1,133 @@
+// Copyright (C) 2010--2012 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2010-2011
+// Modified by Garth N. Wells 2011
+//
+// First added:  2010-08-19
+// Last changed: 2013-11-15
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/fem/LinearVariationalProblem.h>
+#include <dolfin/fem/LinearVariationalSolver.h>
+#include <dolfin/fem/assemble.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+
+#include "AdaptiveLinearVariationalSolver.h"
+#include "GoalFunctional.h"
+#include "adapt.h"
+
+using namespace dolfin;
+
+// ----------------------------------------------------------------------------
+AdaptiveLinearVariationalSolver::
+AdaptiveLinearVariationalSolver(LinearVariationalProblem& problem,
+                                GoalFunctional& goal)
+  : _problem(reference_to_no_delete_pointer(problem))
+{
+  init(reference_to_no_delete_pointer(problem),
+       reference_to_no_delete_pointer(goal));
+}
+// ----------------------------------------------------------------------------
+AdaptiveLinearVariationalSolver::
+AdaptiveLinearVariationalSolver(std::shared_ptr<LinearVariationalProblem> problem,
+                                std::shared_ptr<GoalFunctional> goal)
+  : _problem(problem)
+{
+  init(problem, goal);
+}
+// ----------------------------------------------------------------------------
+AdaptiveLinearVariationalSolver::
+AdaptiveLinearVariationalSolver(std::shared_ptr<LinearVariationalProblem> problem,
+                                std::shared_ptr<Form> goal,
+                                std::shared_ptr<ErrorControl> control)
+  : _problem(problem)
+{
+  this->goal = goal;
+  this->control = control;
+
+  // Set generic adaptive parameters
+  parameters = GenericAdaptiveVariationalSolver::default_parameters();
+
+  // Add parameters for linear variational solver
+  parameters.add(LinearVariationalSolver::default_parameters());
+}
+// ----------------------------------------------------------------------------
+void AdaptiveLinearVariationalSolver::
+init(std::shared_ptr<LinearVariationalProblem> problem,
+     std::shared_ptr<GoalFunctional> goal)
+{
+  dolfin_assert(goal);
+  this->goal = goal;
+
+  // Set generic adaptive parameters
+  parameters = GenericAdaptiveVariationalSolver::default_parameters();
+
+  // Add parameters for linear variational solver
+  parameters.add(LinearVariationalSolver::default_parameters());
+
+  // Extract error control from goal
+  std::shared_ptr<const Form> a = problem->bilinear_form();
+  std::shared_ptr<const Form> L = problem->linear_form();
+  dolfin_assert(a);
+  dolfin_assert(L);
+
+  // Extract and set error control from goal functional
+  goal->update_ec(*a, *L);
+  control = goal->_ec;
+}
+// ----------------------------------------------------------------------------
+std::shared_ptr<const Function>
+AdaptiveLinearVariationalSolver::solve_primal()
+{
+  LinearVariationalProblem& current = _problem->leaf_node();
+  LinearVariationalSolver solver(current);
+  solver.parameters.update(parameters("linear_variational_solver"));
+  solver.solve();
+  return current.solution();
+}
+// ----------------------------------------------------------------------------
+std::vector<std::shared_ptr<const DirichletBC> >
+AdaptiveLinearVariationalSolver::extract_bcs() const
+{
+  const LinearVariationalProblem& current = _problem->leaf_node();
+  return current.bcs();
+}
+// ----------------------------------------------------------------------------
+double AdaptiveLinearVariationalSolver::
+evaluate_goal(Form& M, std::shared_ptr<const Function> u) const
+{
+  dolfin_assert(M.num_coefficients() > 0);
+  M.set_coefficient(M.num_coefficients() - 1, u);
+  return assemble(M);
+}
+// ----------------------------------------------------------------------------
+void AdaptiveLinearVariationalSolver::
+adapt_problem(std::shared_ptr<const Mesh> mesh)
+{
+  const LinearVariationalProblem& current = _problem->leaf_node();
+  adapt(current, mesh);
+}
+// ----------------------------------------------------------------------------
+std::size_t AdaptiveLinearVariationalSolver::num_dofs_primal()
+{
+  const LinearVariationalProblem& current = _problem->leaf_node();
+  const FunctionSpace& V = *(current.trial_space());
+  return V.dim();
+}
+// ----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/AdaptiveLinearVariationalSolver.h b/dolfin/adaptivity/AdaptiveLinearVariationalSolver.h
new file mode 100644
index 0000000..2006034
--- /dev/null
+++ b/dolfin/adaptivity/AdaptiveLinearVariationalSolver.h
@@ -0,0 +1,168 @@
+// Copyright (C) 2010--2012 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010-2011.
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2010-08-19
+// Last changed: 2012-11-14
+
+#ifndef __ADAPTIVE_LINEAR_VARIATIONAL_SOLVER_H
+#define __ADAPTIVE_LINEAR_VARIATIONAL_SOLVER_H
+
+#include <memory>
+#include "GenericAdaptiveVariationalSolver.h"
+
+namespace dolfin
+{
+  // Forward declarations
+  class DirichletBC;
+  class Form;
+  class Function;
+  class LinearVariationalProblem;
+  class GoalFunctional;
+  class Mesh;
+
+  /// A class for goal-oriented adaptive solution of linear
+  /// variational problems.
+  ///
+  /// For a linear variational problem of the form: find u in V
+  /// satisfying
+  ///
+  ///     a(u, v) = L(v) for all v in :math:`\hat V`
+  ///
+  /// and a corresponding conforming discrete problem: find u_h in V_h
+  /// satisfying
+  ///
+  ///     a(u_h, v) = L(v) for all v in :math:`\hat V_h`
+  ///
+  /// and a given goal functional M and tolerance tol, the aim is to
+  /// find a V_H and a u_H in V_H satisfying the discrete problem such
+  /// that
+  ///
+  ///     \|M(u) - M(u_H)\| < tol
+  ///
+  /// This strategy is based on dual-weighted residual error
+  /// estimators designed and automatically generated for the primal
+  /// problem and subsequent h-adaptivity.
+
+  class AdaptiveLinearVariationalSolver
+    : public GenericAdaptiveVariationalSolver
+  {
+  public:
+
+    /// Create AdaptiveLinearVariationalSolver
+    ///
+    /// *Arguments*
+    ///     problem (_LinearVariationalProblem_)
+    ///         The primal problem
+    ///     goal (_GoalFunctional_)
+    ///         The goal functional
+    AdaptiveLinearVariationalSolver(LinearVariationalProblem& problem,
+                                    GoalFunctional& goal);
+
+    /// Create AdaptiveLinearVariationalSolver (shared ptr version)
+    ///
+    /// *Arguments*
+    ///     problem (_LinearVariationalProblem_)
+    ///         The primal problem
+    ///     goal (_GoalFunctional_)
+    ///         The goal functional
+    AdaptiveLinearVariationalSolver(std::shared_ptr<LinearVariationalProblem> problem,
+                                    std::shared_ptr<GoalFunctional> goal);
+
+    /// Create AdaptiveLinearVariationalSolver from variational
+    /// problem, goal form and error control instance
+    ///
+    /// *Arguments*
+    ///     problem (_LinearVariationalProblem_)
+    ///         The primal problem
+    ///     goal (_Form_)
+    ///         The goal functional
+    ///     control (_ErrorControl_)
+    ///         An error controller object
+    AdaptiveLinearVariationalSolver(std::shared_ptr<LinearVariationalProblem> problem,
+                                    std::shared_ptr<Form> goal,
+                                    std::shared_ptr<ErrorControl> control);
+
+    /// Destructor
+    ~AdaptiveLinearVariationalSolver() {}
+
+    /// Solve the primal problem.
+    ///
+    /// *Returns*
+    ///     _Function_
+    ///         The solution to the primal problem
+    virtual std::shared_ptr<const Function> solve_primal();
+
+    /// Extract the boundary conditions for the primal problem.
+    ///
+    /// *Returns*
+    ///     std::vector<_DirichletBC_>
+    ///         The primal boundary conditions
+    virtual std::vector<std::shared_ptr<const DirichletBC> >
+      extract_bcs() const;
+
+    /// Evaluate the goal functional.
+    ///
+    /// *Arguments*
+    ///    M (_Form_)
+    ///        The functional to be evaluated
+    ///    u (_Function_)
+    ///        The function at which to evaluate the functional
+    ///
+    /// *Returns*
+    ///     double
+    ///         The value of M evaluated at u
+    virtual double evaluate_goal(Form& M,
+                                 std::shared_ptr<const Function> u) const;
+
+    /// Adapt the problem to other mesh.
+    ///
+    /// *Arguments*
+    ///    mesh (_Mesh_)
+    ///        The other mesh
+    virtual void adapt_problem(std::shared_ptr<const Mesh> mesh);
+
+  protected:
+    /// Return the number of degrees of freedom for primal problem
+    ///
+    /// *Returns*
+    ///     _std::size_t_
+    ///         The number of degrees of freedom
+    virtual std::size_t num_dofs_primal();
+
+  private:
+
+    /// Helper function for instance initialization
+    ///
+    /// *Arguments*
+    ///    problem (_LinearVariationalProblem_)
+    ///        The primal problem
+    ///    u (_GoalFunctional_)
+    ///        The goal functional
+    void init(std::shared_ptr<LinearVariationalProblem> problem,
+              std::shared_ptr<GoalFunctional> goal);
+
+    // The primal problem
+    std::shared_ptr<LinearVariationalProblem> _problem;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.cpp b/dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.cpp
new file mode 100644
index 0000000..8691ae4
--- /dev/null
+++ b/dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.cpp
@@ -0,0 +1,130 @@
+// Copyright (C) 2010--2012 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2010-2011
+// Modified by Garth N. Wells 2011
+//
+// First added:  2010-08-19
+// Last changed: 2012-11-14
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/fem/NonlinearVariationalProblem.h>
+#include <dolfin/fem/NonlinearVariationalSolver.h>
+#include <dolfin/fem/assemble.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+
+#include "AdaptiveNonlinearVariationalSolver.h"
+#include "GoalFunctional.h"
+#include "adapt.h"
+
+using namespace dolfin;
+
+// ----------------------------------------------------------------------------
+AdaptiveNonlinearVariationalSolver::
+AdaptiveNonlinearVariationalSolver(NonlinearVariationalProblem& problem,
+                                   GoalFunctional& goal)
+  : _problem(reference_to_no_delete_pointer(problem))
+{
+  init(reference_to_no_delete_pointer(problem),
+       reference_to_no_delete_pointer(goal));
+}
+// ----------------------------------------------------------------------------
+AdaptiveNonlinearVariationalSolver::AdaptiveNonlinearVariationalSolver(
+  std::shared_ptr<NonlinearVariationalProblem> problem,
+  std::shared_ptr<GoalFunctional> goal)
+  : _problem(problem)
+{
+  init(problem, goal);
+}
+// ----------------------------------------------------------------------------
+AdaptiveNonlinearVariationalSolver::AdaptiveNonlinearVariationalSolver(
+  std::shared_ptr<NonlinearVariationalProblem> problem,
+  std::shared_ptr<Form> goal,
+  std::shared_ptr<ErrorControl> control)
+  : _problem(problem)
+{
+  this->goal = goal;
+  this->control = control;
+
+  // Set generic adaptive parameters
+  parameters = GenericAdaptiveVariationalSolver::default_parameters();
+
+  // Add parameters for non-linear variational solver
+  parameters.add(NonlinearVariationalSolver::default_parameters());
+}
+// ----------------------------------------------------------------------------
+void AdaptiveNonlinearVariationalSolver::init(
+  std::shared_ptr<NonlinearVariationalProblem> problem,
+  std::shared_ptr<GoalFunctional> goal)
+{
+  this->goal = goal;
+
+  // Set generic adaptive parameters
+  parameters = GenericAdaptiveVariationalSolver::default_parameters();
+
+  // Add parameters for nonlinear variational solver
+  parameters.add(NonlinearVariationalSolver::default_parameters());
+
+  // Extract error control from goal
+  std::shared_ptr<const Form> a = problem->jacobian_form();
+  std::shared_ptr<const Form> L = problem->residual_form();
+  dolfin_assert(a);
+  dolfin_assert(L);
+
+  // Extract error control from goal functional
+  goal->update_ec(*a, *L);
+  control = goal->_ec;
+}
+// ----------------------------------------------------------------------------
+std::shared_ptr<const Function>
+AdaptiveNonlinearVariationalSolver::solve_primal()
+{
+  NonlinearVariationalProblem& current = _problem->leaf_node();
+  NonlinearVariationalSolver solver(current);
+  solver.parameters.update(parameters("nonlinear_variational_solver"));
+  solver.solve();
+  return current.solution();
+}
+// ----------------------------------------------------------------------------
+std::vector<std::shared_ptr<const DirichletBC> >
+AdaptiveNonlinearVariationalSolver::extract_bcs() const
+{
+  const NonlinearVariationalProblem& current = _problem->leaf_node();
+  return current.bcs();
+}
+// ----------------------------------------------------------------------------
+double AdaptiveNonlinearVariationalSolver::evaluate_goal(Form& M,
+                                 std::shared_ptr<const Function> u) const
+{
+  return assemble(M);
+}
+// ----------------------------------------------------------------------------
+void AdaptiveNonlinearVariationalSolver::adapt_problem(
+  std::shared_ptr<const Mesh> mesh)
+{
+  const NonlinearVariationalProblem& current = _problem->leaf_node();
+  adapt(current, mesh);
+}
+// ----------------------------------------------------------------------------
+std::size_t AdaptiveNonlinearVariationalSolver::num_dofs_primal()
+{
+  const NonlinearVariationalProblem& current = _problem->leaf_node();
+  const FunctionSpace& V = *(current.trial_space());
+  return V.dim();
+}
+// ----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h b/dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h
new file mode 100644
index 0000000..6761294
--- /dev/null
+++ b/dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h
@@ -0,0 +1,169 @@
+// Copyright (C) 2010--2012 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010-2011.
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2010-08-19
+// Last changed: 2012-11-14
+
+#ifndef __ADAPTIVE_NONLINEAR_VARIATIONAL_SOLVER_H
+#define __ADAPTIVE_NONLINEAR_VARIATIONAL_SOLVER_H
+
+#include <memory>
+
+#include "GenericAdaptiveVariationalSolver.h"
+
+namespace dolfin
+{
+  // Forward declarations
+  class DirichletBC;
+  class Function;
+  class NonlinearVariationalProblem;
+  class GoalFunctional;
+  class Mesh;
+
+  /// A class for goal-oriented adaptive solution of nonlinear
+  /// variational problems.
+  ///
+  /// For a nonlinear variational problem of the form: find u in V
+  /// satisfying
+  ///
+  ///     F(u; v) = 0 for all v in :math:`\hat V`
+  ///
+  /// and a corresponding conforming discrete problem: find u_h in V_h
+  /// satisfying (at least approximately)
+  ///
+  ///     F(u_h; v) = 0 for all v in :math:`\hat V_h`
+  ///
+  /// and a given goal functional M and tolerance tol, the aim is to
+  /// find a V_H and a u_H in V_H satisfying the discrete problem such
+  /// that
+  ///
+  ///     \|M(u) - M(u_H)\| < tol
+  ///
+  /// This strategy is based on dual-weighted residual error
+  /// estimators designed and automatically generated for the primal
+  /// problem and subsequent h-adaptivity.
+
+  class AdaptiveNonlinearVariationalSolver
+    : public GenericAdaptiveVariationalSolver
+  {
+  public:
+
+    /// Create AdaptiveNonlinearVariationalSolver
+    ///
+    /// *Arguments*
+    ///     problem (_NonlinearVariationalProblem_)
+    ///         The primal problem
+    ///     goal (_GoalFunctional_)
+    ///         The goal functional
+    AdaptiveNonlinearVariationalSolver(NonlinearVariationalProblem& problem,
+                                       GoalFunctional& goal);
+
+    /// Create AdaptiveNonlinearVariationalSolver (shared ptr version)
+    ///
+    /// *Arguments*
+    ///     problem (_NonlinearVariationalProblem_)
+    ///         The primal problem
+    ///     goal (_GoalFunctional_)
+    ///         The goal functional
+    AdaptiveNonlinearVariationalSolver(std::shared_ptr<NonlinearVariationalProblem> problem,
+                                       std::shared_ptr<GoalFunctional> goal);
+
+    /// Create AdaptiveLinearVariationalSolver from variational
+    /// problem, goal form and error control instance
+    ///
+    /// *Arguments*
+    ///     problem (_NonlinearVariationalProblem_)
+    ///         The primal problem
+    ///     goal (_Form_)
+    ///         The goal functional
+    ///     control (_ErrorControl_)
+    ///         An error controller object
+    AdaptiveNonlinearVariationalSolver(std::shared_ptr<NonlinearVariationalProblem> problem,
+                                       std::shared_ptr<Form> goal,
+                                       std::shared_ptr<ErrorControl> control);
+
+
+    /// Destructor
+    ~AdaptiveNonlinearVariationalSolver() {}
+
+    /// Solve the primal problem.
+    ///
+    /// *Returns*
+    ///     _Function_
+    ///         The solution to the primal problem
+    virtual std::shared_ptr<const Function> solve_primal();
+
+    /// Extract the boundary conditions for the primal problem.
+    ///
+    /// *Returns*
+    ///     std::vector<_DirichletBC_>
+    ///         The primal boundary conditions
+    virtual std::vector<std::shared_ptr<const DirichletBC> >
+      extract_bcs() const;
+
+    /// Evaluate the goal functional.
+    ///
+    /// *Arguments*
+    ///    M (_Form_)
+    ///        The functional to be evaluated
+    ///    u (_Function_)
+    ///        The function at which to evaluate the functional
+    ///
+    /// *Returns*
+    ///     double
+    ///         The value of M evaluated at u
+    virtual double evaluate_goal(Form& M,
+                                 std::shared_ptr<const Function> u) const;
+
+    /// Adapt the problem to other mesh.
+    ///
+    /// *Arguments*
+    ///    mesh (_Mesh_)
+    ///        The other mesh
+    virtual void adapt_problem(std::shared_ptr<const Mesh> mesh);
+
+  protected:
+    /// Return the number of degrees of freedom for primal problem
+    ///
+    /// *Returns*
+    ///     _std::size_t_
+    ///         The number of degrees of freedom
+    virtual std::size_t num_dofs_primal();
+
+  private:
+
+    /// Helper function for instance initialization
+    ///
+    /// *Arguments*
+    ///    problem (_NonlinearVariationalProblem_)
+    ///        The primal problem
+    ///    u (_GoalFunctional_)
+    ///        The goal functional
+    void init(std::shared_ptr<NonlinearVariationalProblem> problem,
+              std::shared_ptr<GoalFunctional> goal);
+
+    // The problem
+    std::shared_ptr<NonlinearVariationalProblem> _problem;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/adaptivity/ErrorControl.cpp b/dolfin/adaptivity/ErrorControl.cpp
new file mode 100644
index 0000000..87beb84
--- /dev/null
+++ b/dolfin/adaptivity/ErrorControl.cpp
@@ -0,0 +1,501 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011.
+//
+// First added:  2010-09-16
+// Last changed: 2011-03-23
+
+#include <memory>
+#include <Eigen/Dense>
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/types.h>
+#include <dolfin/common/Hierarchical.h>
+#include <dolfin/fem/assemble.h>
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/fem/UFC.h>
+#include <dolfin/fem/LinearVariationalProblem.h>
+#include <dolfin/fem/LinearVariationalSolver.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/SubSpace.h>
+#include <dolfin/function/Constant.h>
+#include <dolfin/function/SpecialFacetFunction.h>
+#include <dolfin/la/Matrix.h>
+#include <dolfin/la/Vector.h>
+#include <dolfin/la/solve.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Facet.h>
+
+#include "LocalAssembler.h"
+#include "ErrorControl.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+ErrorControl::ErrorControl(std::shared_ptr<Form> a_star,
+                           std::shared_ptr<Form> L_star,
+                           std::shared_ptr<Form> residual,
+                           std::shared_ptr<Form> a_R_T,
+                           std::shared_ptr<Form> L_R_T,
+                           std::shared_ptr<Form> a_R_dT,
+                           std::shared_ptr<Form> L_R_dT,
+                           std::shared_ptr<Form> eta_T,
+                           bool is_linear)
+  : Hierarchical<ErrorControl>(*this)
+{
+  // Assign input
+  _a_star = a_star;
+  _L_star = L_star;
+  _residual = residual;
+  _a_R_T = a_R_T;
+  _L_R_T = L_R_T;
+  _a_R_dT = a_R_dT;
+  _L_R_dT = L_R_dT;
+  _eta_T = eta_T;
+  _is_linear = is_linear;
+
+  // Extract and store additional function spaces
+  const std::size_t improved_dual = _residual->num_coefficients() - 1;
+  const Function& e_tmp = dynamic_cast<const Function&>(*_residual->coefficient(improved_dual));
+  _extrapolation_space = e_tmp.function_space();
+
+  const Function& bubble = dynamic_cast<const Function&>(*_a_R_T->coefficient(0));
+  _bubble_space = bubble.function_space();
+  _cell_bubble.reset(new Function(_bubble_space));
+  dolfin_assert(_cell_bubble->vector());
+  *(_cell_bubble->vector()) = 1.0;
+
+  const Function& cone = dynamic_cast<const Function&>(*_a_R_dT->coefficient(0));
+  _cone_space = cone.function_space();
+  _cell_cone.reset(new Function(_cone_space));
+
+  // Set parameters
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+double ErrorControl::estimate_error(const Function& u,
+  const std::vector<std::shared_ptr<const DirichletBC> > bcs)
+{
+  // Compute discrete dual approximation
+  dolfin_assert(_a_star);
+  Function z_h(_a_star->function_space(1));
+  compute_dual(z_h, bcs);
+
+  // Compute extrapolation of discrete dual
+  compute_extrapolation(z_h, bcs);
+
+  // Extract number of coefficients in residual
+  dolfin_assert(_residual);
+  const std::size_t num_coeffs = _residual->num_coefficients();
+
+  // Attach improved dual approximation to residual
+  _residual->set_coefficient(num_coeffs - 1, _Ez_h);
+
+  // Attach primal approximation if linear problem (already attached
+  // otherwise).
+  if (_is_linear)
+  {
+    std::shared_ptr<const GenericFunction> _u(&u, NoDeleter());
+    _residual->set_coefficient(num_coeffs - 2, _u);
+  }
+
+  // Assemble error estimate
+  log(PROGRESS, "Assembling error estimate.");
+  const double error_estimate = assemble(*_residual);
+
+  // Return estimate
+  return error_estimate;
+}
+//-----------------------------------------------------------------------------
+void ErrorControl::compute_dual(Function& z,
+   const std::vector<std::shared_ptr<const DirichletBC> > bcs)
+{
+  log(PROGRESS, "Solving dual problem.");
+
+  // Create dual boundary conditions by homogenizing
+  std::vector<std::shared_ptr<const DirichletBC> > dual_bcs;
+  for (std::size_t i = 0; i < bcs.size(); i++)
+  {
+    dolfin_assert(bcs[i]);
+
+    // Create shared_ptr to boundary condition
+    std::shared_ptr<DirichletBC> dual_bc_ptr(new DirichletBC(*bcs[i]));
+
+    // Run homogenize
+    dual_bc_ptr->homogenize();
+
+    // Plug pointer into into vector
+    dual_bcs.push_back(dual_bc_ptr);
+  }
+
+  // Create shared_ptr to dual solution (FIXME: missing interface ...)
+  std::shared_ptr<Function> dual(reference_to_no_delete_pointer(z));
+
+  // Solve dual problem
+  LinearVariationalProblem dual_problem(_a_star, _L_star, dual, dual_bcs);
+  LinearVariationalSolver solver(dual_problem);
+  solver.parameters.update(parameters("dual_variational_solver"));
+  solver.solve();
+}
+//-----------------------------------------------------------------------------
+void ErrorControl::compute_extrapolation(const Function& z,
+   const std::vector<std::shared_ptr<const DirichletBC> > bcs)
+{
+  log(PROGRESS, "Extrapolating dual solution.");
+
+  // Extrapolate
+  dolfin_assert(_extrapolation_space);
+  _Ez_h.reset(new Function(_extrapolation_space));
+  _Ez_h->extrapolate(z);
+
+  // Apply appropriate boundary conditions to extrapolation
+  apply_bcs_to_extrapolation(bcs);
+}
+//-----------------------------------------------------------------------------
+void ErrorControl::compute_indicators(MeshFunction<double>& indicators,
+                                      const Function& u)
+{
+  // Create Function for the strong cell residual (R_T)
+  dolfin_assert(_a_R_T);
+  _R_T.reset(new Function(_a_R_T->function_space(1)));
+
+  // Create SpecialFacetFunction for the strong facet residual (R_dT)
+  dolfin_assert(_a_R_dT);
+  std::vector<Function> f_e;
+  for (std::size_t i = 0; i <= _R_T->geometric_dimension(); i++)
+    f_e.push_back(Function(_a_R_dT->function_space(1)));
+
+  if (f_e[0].value_rank() == 0)
+    _R_dT.reset(new SpecialFacetFunction(f_e));
+  else if (f_e[0].value_rank() == 1)
+    _R_dT.reset(new SpecialFacetFunction(f_e, f_e[0].value_dimension(0)));
+  else
+  {
+    _R_dT.reset(new SpecialFacetFunction(f_e, f_e[0].value_dimension(0)));
+    dolfin_error("ErrorControl.cpp",
+                 "compute error indicators",
+                 "Not implemented for tensor-valued functions");
+  }
+
+  // Compute residual representation
+  residual_representation(*_R_T, *_R_dT, u);
+
+  // Interpolate dual extrapolation into primal test (dual trial space)
+  dolfin_assert(_a_star);
+  dolfin_assert(_Ez_h);
+  _Pi_E_z_h.reset(new Function(_a_star->function_space(1)));
+  _Pi_E_z_h->interpolate(*_Ez_h);
+
+  // Attach coefficients to error indicator form
+  dolfin_assert(_eta_T);
+  _eta_T->set_coefficient(0, _Ez_h);
+  _eta_T->set_coefficient(1, _R_T);
+  _eta_T->set_coefficient(2, _R_dT);
+  _eta_T->set_coefficient(3, _Pi_E_z_h);
+
+  // Assemble error indicator form
+  Vector x(indicators.mesh()->mpi_comm(), indicators.mesh()->num_cells());
+  assemble(x, *_eta_T);
+
+  // Take absolute value of indicators
+  x.abs();
+
+  // Convert vector x to indicator mesh function
+  dolfin_assert(_eta_T->function_space(0));
+  dolfin_assert(_eta_T->function_space(0)->dofmap());
+  const GenericDofMap& dofmap(*_eta_T->function_space(0)->dofmap());
+  const Mesh& mesh= *indicators.mesh();
+
+  // Convert DG_0 vector to mesh function over cells
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    const std::vector<dolfin::la_index>& dofs = dofmap.cell_dofs(cell->index());
+    dolfin_assert(dofs.size() == 1);
+    indicators[cell->index()] = x[dofs[0]];
+  }
+}
+
+//-----------------------------------------------------------------------------
+void ErrorControl::residual_representation(Function& R_T,
+                                           SpecialFacetFunction& R_dT,
+                                           const Function& u)
+{
+  begin(PROGRESS, "Computing residual representation.");
+
+  // Compute cell residual
+  Timer timer("Computation of residual representation");
+  compute_cell_residual(R_T, u);
+
+  // Compute facet residual
+  compute_facet_residual(R_dT, u, R_T);
+  timer.stop();
+
+  end();
+}
+//-----------------------------------------------------------------------------
+void ErrorControl::compute_cell_residual(Function& R_T, const Function& u)
+{
+  begin(PROGRESS, "Computing cell residual representation.");
+
+  dolfin_assert(_a_R_T);
+  dolfin_assert(_L_R_T);
+  dolfin_assert(_cell_bubble);
+
+  // Attach cell bubble to _a_R_T and _L_R_T
+  const std::size_t num_coeffs = _L_R_T->num_coefficients();
+  _a_R_T->set_coefficient(0, _cell_bubble);
+  _L_R_T->set_coefficient(num_coeffs - 1, _cell_bubble);
+
+  // Attach primal approximation to left-hand side form (residual) if
+  // necessary.
+  if (_is_linear)
+  {
+    std::shared_ptr<const GenericFunction> _u(&u, NoDeleter());
+    _L_R_T->set_coefficient(num_coeffs - 2, _u);
+  }
+
+  // Create data structures for local assembly data
+  UFC ufc_lhs(*_a_R_T);
+  UFC ufc_rhs(*_L_R_T);
+
+  // Extract common space, mesh and dofmap
+  const FunctionSpace& V = *R_T.function_space();
+  dolfin_assert(V.mesh());
+  const Mesh& mesh(*V.mesh());
+  dolfin_assert(V.dofmap());
+  const GenericDofMap& dofmap = *V.dofmap();
+
+  // Define matrices for cell-residual problems
+  dolfin_assert(V.element());
+  const std::size_t N = V.element()->space_dimension();
+  Eigen::MatrixXd A(N, N), b(N, 1);
+  Eigen::VectorXd x(N);
+
+  // Extract cell_domains etc from right-hand side form
+  const MeshFunction<std::size_t>*
+    cell_domains = _L_R_T->cell_domains().get();
+  const MeshFunction<std::size_t>*
+    exterior_facet_domains = _L_R_T->exterior_facet_domains().get();
+  const MeshFunction<std::size_t>*
+    interior_facet_domains = _L_R_T->interior_facet_domains().get();
+
+  // Assemble and solve local linear systems
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Get cell vertices
+    cell->get_vertex_coordinates(vertex_coordinates);
+
+    // Assemble local linear system
+    LocalAssembler::assemble(A, ufc_lhs, vertex_coordinates,
+                             ufc_cell, *cell, cell_domains,
+                             exterior_facet_domains, interior_facet_domains);
+    LocalAssembler::assemble(b, ufc_rhs, vertex_coordinates, ufc_cell,
+                             *cell, cell_domains,
+                             exterior_facet_domains, interior_facet_domains);
+
+    // Solve linear system and convert result
+    x = A.partialPivLu().solve(b);
+
+    // Get local-to-global dof map for cell
+    const std::vector<dolfin::la_index>& dofs = dofmap.cell_dofs(cell->index());
+
+    // Plug local solution into global vector
+    dolfin_assert(R_T.vector());
+    R_T.vector()->set(x.data(), N, &dofs[0]);
+  }
+  end();
+}
+//-----------------------------------------------------------------------------
+void ErrorControl::compute_facet_residual(SpecialFacetFunction& R_dT,
+                                          const Function& u,
+                                          const Function& R_T)
+{
+  begin(PROGRESS, "Computing facet residual representation.");
+
+  // Extract function space for facet residual approximation
+  dolfin_assert(R_dT[0].function_space());
+  const FunctionSpace& V = *R_dT[0].function_space();
+  dolfin_assert(V.element());
+  const std::size_t N = V.element()->space_dimension();
+
+  // Extract mesh
+  dolfin_assert(V.mesh());
+  const Mesh& mesh = *V.mesh();
+  const int dim = mesh.topology().dim();
+
+  // Extract dimension of cell cone space (DG_{dim})
+  dolfin_assert(_cone_space->element());
+  const int local_cone_dim = _cone_space->element()->space_dimension();
+
+  // Extract number of coefficients on right-hand side (for use with
+  // attaching coefficients)
+  dolfin_assert(_L_R_dT);
+  const std::size_t L_R_dT_num_coefficients = _L_R_dT->num_coefficients();
+
+  // Attach primal approximation if linear (already attached
+  // otherwise).
+  if (_is_linear)
+  {
+    std::shared_ptr<const GenericFunction> _u(&u, NoDeleter());
+    _L_R_dT->set_coefficient(L_R_dT_num_coefficients - 3, _u);
+  }
+
+  // Attach cell residual to residual form
+  dolfin_assert(_R_T);
+  _L_R_dT->set_coefficient(L_R_dT_num_coefficients - 2, _R_T);
+
+  // Extract (common) dof map
+  dolfin_assert(V.dofmap());
+  const GenericDofMap& dofmap = *V.dofmap();
+
+  // Define matrices for facet-residual problems
+  Eigen::MatrixXd A(N, N), b(N, 1);
+  Eigen::VectorXd x(N);
+
+  // Variables to be used for the construction of the cone function
+  const std::size_t num_cells = mesh.num_cells();
+  const std::vector<double> ones(num_cells, 1.0);
+  std::vector<dolfin::la_index> facet_dofs(num_cells);
+
+  // Extract cell_domains etc from right-hand side form
+  dolfin_assert(_L_R_T);
+  const MeshFunction<std::size_t>*
+    cell_domains = _L_R_T->cell_domains().get();
+  const MeshFunction<std::size_t>*
+    exterior_facet_domains = _L_R_T->exterior_facet_domains().get();
+  const MeshFunction<std::size_t>*
+    interior_facet_domains = _L_R_T->interior_facet_domains().get();
+
+  dolfin_assert(_a_R_dT);
+  // Compute the facet residual for each local facet number
+  for (int local_facet = 0; local_facet <= dim; local_facet++)
+  {
+    // Construct "cone" function on this facet. NB: makes assumption
+    // on _local_ dof numbering for DG_dim.
+    dolfin_assert(_cell_cone->vector());
+    *(_cell_cone->vector()) = 0.0;
+    facet_dofs.clear();
+    const std::size_t local_facet_dof = local_cone_dim - (dim + 1)
+      + local_facet;
+    dolfin_assert(_cell_cone->function_space());
+    dolfin_assert(_cell_cone->function_space()->dofmap());
+    const GenericDofMap& cone_dofmap(*(_cell_cone->function_space()->dofmap()));
+    for (std::size_t k = 0; k < num_cells; k++)
+      facet_dofs.push_back(cone_dofmap.cell_dofs(k)[local_facet_dof]);
+    _cell_cone->vector()->set(&ones[0], num_cells, &facet_dofs[0]);
+    _cell_cone->vector()->apply("insert");
+
+    // Attach cell cone to _a_R_dT and _L_R_dT
+    _a_R_dT->set_coefficient(0, _cell_cone);
+    _L_R_dT->set_coefficient(L_R_dT_num_coefficients - 1, _cell_cone);
+
+    // Create data structures for local assembly data
+    UFC ufc_lhs(*_a_R_dT);
+    UFC ufc_rhs(*_L_R_dT);
+
+    // Assemble and solve local linear systems
+    ufc::cell ufc_cell;
+    std::vector<double> vertex_coordinates;
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      // Get cell vertex_coordinates
+      cell->get_vertex_coordinates(vertex_coordinates);
+
+      // Assemble linear system
+      LocalAssembler::assemble(A, ufc_lhs, vertex_coordinates,
+                               ufc_cell, *cell, cell_domains,
+                               exterior_facet_domains, interior_facet_domains);
+      LocalAssembler::assemble(b, ufc_rhs, vertex_coordinates,
+                               ufc_cell, *cell, cell_domains,
+                               exterior_facet_domains, interior_facet_domains);
+
+      // Non-singularize local matrix
+      for (std::size_t i = 0; i < N; ++i)
+      {
+        if (std::abs(A(i, i)) < 1.0e-10)
+        {
+          A(i, i) = 1.0;
+          b(i) = 0.0;
+        }
+      }
+
+      // Solve linear system and convert result
+      x = A.partialPivLu().solve(b);
+
+      // Get local-to-global dof map for cell
+      const std::vector<dolfin::la_index>& dofs
+        = dofmap.cell_dofs(cell->index());
+
+      // Plug local solution into global vector
+      dolfin_assert(R_dT[local_facet].vector());
+      R_dT[local_facet].vector()->set(x.data(), N, &dofs[0]);
+    }
+  }
+  end();
+}
+//-----------------------------------------------------------------------------
+void ErrorControl::apply_bcs_to_extrapolation(
+const std::vector<std::shared_ptr<const DirichletBC> > bcs)
+{
+  // Create boundary conditions for extrapolated dual, and apply
+  // these.
+  for (std::size_t i = 0; i < bcs.size(); i++)
+  {
+    dolfin_assert(bcs[i]);
+
+    // Extract SubSpace component
+    dolfin_assert(bcs[i]->function_space());
+    const std::vector<std::size_t> component = bcs[i]->function_space()->component();
+
+    // Extract sub-domain
+    std::shared_ptr<const SubDomain> sub_domain = bcs[i]->user_sub_domain();
+
+    // Create zero-valued boundary condition on extrapolation space.
+    // (Sub-spaces need special handling, and boundary conditions can
+    // be defined and handled in many different ways -- hence the
+    // level of logic.)
+    std::unique_ptr<DirichletBC> e_bc;
+    if (component.empty())
+    {
+      if (sub_domain)
+        e_bc.reset(new DirichletBC(_extrapolation_space, bcs[i]->value(), sub_domain, bcs[i]->method()));
+      else
+        e_bc.reset(new DirichletBC(_extrapolation_space, bcs[i]->value(), bcs[i]->markers(), bcs[i]->method()));
+    }
+    else
+    {
+      std::shared_ptr<SubSpace> S(new SubSpace(*_extrapolation_space, component));
+      if (sub_domain)
+        e_bc.reset(new DirichletBC(S, bcs[i]->value(), sub_domain, bcs[i]->method()));
+      else
+        e_bc.reset(new DirichletBC(S, bcs[i]->value(), bcs[i]->markers(), bcs[i]->method()));
+    }
+    e_bc->homogenize();
+
+    // Apply boundary condition
+    e_bc->apply(*_Ez_h->vector());
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/ErrorControl.h b/dolfin/adaptivity/ErrorControl.h
new file mode 100644
index 0000000..0fec115
--- /dev/null
+++ b/dolfin/adaptivity/ErrorControl.h
@@ -0,0 +1,244 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-08-19
+// Last changed: 2012-09-03
+
+#ifndef __ERROR_CONTROL_H
+#define __ERROR_CONTROL_H
+
+#include <vector>
+#include <memory>
+
+#include <dolfin/common/Hierarchical.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/fem/LinearVariationalSolver.h>
+#include "adapt.h"
+
+namespace dolfin
+{
+
+  class DirichletBC;
+  class Form;
+  class Function;
+  class FunctionSpace;
+  class SpecialFacetFunction;
+  class Vector;
+
+  template <typename T> class MeshFunction;
+
+  /// (Goal-oriented) Error Control class.
+
+  /// The notation used here follows the notation in "Automated
+  /// goal-oriented error control I: stationary variational problems",
+  /// ME Rognes and A Logg, 2010-2011.
+
+  class ErrorControl : public Hierarchical<ErrorControl>, public Variable
+  {
+  public:
+
+    /// Create error control object
+    ///
+    /// *Arguments*
+    ///     a_star (_Form_)
+    ///        the bilinear form for the dual problem
+    ///     L_star (_Form_)
+    ///        the linear form for the dual problem
+    ///     residual (_Form_)
+    ///        a functional for the residual (error estimate)
+    ///     a_R_T (_Form_)
+    ///        the bilinear form for the strong cell residual problem
+    ///     L_R_T (_Form_)
+    ///        the linear form for the strong cell residual problem
+    ///     a_R_dT (_Form_)
+    ///        the bilinear form for the strong facet residual problem
+    ///     L_R_dT (_Form_)
+    ///        the linear form for the strong facet residual problem
+    ///     eta_T (_Form_)
+    ///        a linear form over DG_0 for error indicators
+    ///     is_linear (bool)
+    ///        true iff primal problem is linear
+    ErrorControl(std::shared_ptr<Form> a_star,
+                 std::shared_ptr<Form> L_star,
+                 std::shared_ptr<Form> residual,
+                 std::shared_ptr<Form> a_R_T,
+                 std::shared_ptr<Form> L_R_T,
+                 std::shared_ptr<Form> a_R_dT,
+                 std::shared_ptr<Form> L_R_dT,
+                 std::shared_ptr<Form> eta_T,
+                 bool is_linear);
+
+    /// Destructor.
+    ~ErrorControl() {}
+
+    /// Default parameter values:
+    static Parameters default_parameters()
+    {
+      Parameters p("error_control");
+
+      // Set parameters for dual solver
+      Parameters p_dual(LinearVariationalSolver::default_parameters());
+      p_dual.rename("dual_variational_solver");
+      p.add(p_dual);
+
+      return p;
+    }
+
+
+    /// Estimate the error relative to the goal M of the discrete
+    /// approximation 'u' relative to the variational formulation by
+    /// evaluating the weak residual at an approximation to the dual
+    /// solution.
+    ///
+    /// *Arguments*
+    ///     u (_Function_)
+    ///        the primal approximation
+    ///
+    ///     bcs (std::vector<_DirichletBC_>)
+    ///         the primal boundary conditions
+    ///
+    /// *Returns*
+    ///     double
+    ///         error estimate
+    double estimate_error(const Function& u,
+           const std::vector<std::shared_ptr<const DirichletBC> > bcs);
+
+    /// Compute error indicators
+    ///
+    /// *Arguments*
+    ///     indicators (_MeshFunction_ <double>)
+    ///         the error indicators (to be computed)
+    ///
+    ///     u (_Function_)
+    ///         the primal approximation
+    void compute_indicators(MeshFunction<double>& indicators,
+                            const Function& u);
+
+    /// Compute strong representation (strong cell and facet
+    /// residuals) of the weak residual.
+    ///
+    /// *Arguments*
+    ///     R_T (_Function_)
+    ///         the strong cell residual (to be computed)
+    ///
+    ///     R_dT (_SpecialFacetFunction_)
+    ///         the strong facet residual (to be computed)
+    ///
+    ///     u (_Function_)
+    ///         the primal approximation
+    void residual_representation(Function& R_T,
+                                 SpecialFacetFunction& R_dT,
+                                 const Function& u);
+
+    /// Compute representation for the strong cell residual
+    /// from the weak residual
+    ///
+    /// *Arguments*
+    ///     R_T (_Function_)
+    ///         the strong cell residual (to be computed)
+    ///
+    ///     u (_Function_)
+    ///         the primal approximation
+    void compute_cell_residual(Function& R_T, const Function& u);
+
+    /// Compute representation for the strong facet residual from the
+    /// weak residual and the strong cell residual
+    ///
+    /// *Arguments*
+    ///     R_dT (_SpecialFacetFunction_)
+    ///         the strong facet residual (to be computed)
+    ///
+    ///     u (_Function_)
+    ///         the primal approximation
+    ///
+    ///     R_T (_Function_)
+    ///         the strong cell residual
+    void compute_facet_residual(SpecialFacetFunction& R_dT,
+                                const Function& u,
+                                const Function& R_T);
+
+    /// Compute dual approximation defined by dual variational
+    /// problem and dual boundary conditions given by homogenized primal
+    /// boundary conditions.
+    ///
+    /// *Arguments*
+    ///     z (_Function_)
+    ///         the dual approximation (to be computed)
+    ///
+    ///     bcs (std::vector<_DirichletBC_>)
+    ///         the primal boundary conditions
+    void compute_dual(Function& z,
+         const std::vector<std::shared_ptr<const DirichletBC> > bcs);
+
+    /// Compute extrapolation with boundary conditions
+    ///
+    /// *Arguments*
+    ///     z (_Function_)
+    ///         the extrapolated function (to be computed)
+    ///
+    ///     bcs (std::vector<_DirichletBC_>)
+    ///         the dual boundary conditions
+    void compute_extrapolation(const Function& z,
+         const std::vector<std::shared_ptr<const DirichletBC> > bcs);
+
+    friend const ErrorControl& adapt(const ErrorControl& ec,
+                                     std::shared_ptr<const Mesh> adapted_mesh,
+                                     bool adapt_coefficients);
+
+  private:
+
+    void apply_bcs_to_extrapolation(const std::vector<std::shared_ptr<const DirichletBC> > bcs);
+
+    // Bilinear and linear form for dual problem
+    std::shared_ptr<Form> _a_star;
+    std::shared_ptr<Form> _L_star;
+
+    // Functional for evaluating residual (error estimate)
+    std::shared_ptr<Form> _residual;
+
+    // Bilinear and linear form for computing cell residual R_T
+    std::shared_ptr<Form> _a_R_T;
+    std::shared_ptr<Form> _L_R_T;
+
+    // Bilinear and linear form for computing facet residual R_dT
+    std::shared_ptr<Form> _a_R_dT;
+    std::shared_ptr<Form> _L_R_dT;
+
+    // Linear form for computing error indicators
+    std::shared_ptr<Form> _eta_T;
+
+    // Computed extrapolation
+    std::shared_ptr<Function> _Ez_h;
+
+    bool _is_linear;
+
+    // Function spaces for extrapolation, cell bubble and cell cone:
+    std::shared_ptr<const FunctionSpace> _extrapolation_space;
+    std::shared_ptr<const FunctionSpace> _bubble_space;
+    std::shared_ptr<const FunctionSpace> _cone_space;
+
+    // Functions for cell bubble, cell cone, computed cell residual,
+    // computed facet residual, and interpolated extrapolated(!) dual:
+    std::shared_ptr<Function> _cell_bubble;
+    std::shared_ptr<Function> _cell_cone;
+    std::shared_ptr<Function> _R_T;
+    std::shared_ptr<SpecialFacetFunction> _R_dT;
+    std::shared_ptr<Function> _Pi_E_z_h;
+  };
+}
+
+#endif
diff --git a/dolfin/adaptivity/Extrapolation.cpp b/dolfin/adaptivity/Extrapolation.cpp
new file mode 100644
index 0000000..61b8590
--- /dev/null
+++ b/dolfin/adaptivity/Extrapolation.cpp
@@ -0,0 +1,299 @@
+// Copyright (C) 2009-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Marie E. Rognes, 2010
+// Modified by Garth N. Wells, 2010
+//
+// First added:  2009-12-08
+// Last changed: 2011-11-12
+//
+
+#include <vector>
+#include <Eigen/Dense>
+#include <ufc.h>
+
+#include <dolfin/common/Array.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/fem/BasisFunction.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/FacetCell.h>
+#include "Extrapolation.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void Extrapolation::extrapolate(Function& w, const Function& v)
+{
+  // Using set_local for simplicity here
+  not_working_in_parallel("Extrapolation of functions");
+
+  // Check that the meshes are the same
+  if (w.function_space()->mesh() != v.function_space()->mesh())
+  {
+    dolfin_error("Extrapolation.cpp",
+                 "compute extrapolation",
+                 "Extrapolation must be computed on the same mesh");
+  }
+
+  // Extract mesh and function spaces
+  const FunctionSpace& V = *v.function_space();
+  const FunctionSpace& W = *w.function_space();
+  dolfin_assert(V.mesh());
+  const Mesh& mesh = *V.mesh();
+
+  // Initialize cell-cell connectivity
+  const std::size_t D = mesh.topology().dim();
+  mesh.init(D, D);
+
+  // UFC cell view of center cell and vertex coordinate holder
+  ufc::cell c0;
+  std::vector<double> vertex_coordinates0;
+
+  // List of values for each dof of w (multivalued until we average)
+  std::vector<std::vector<double> > coefficients;
+  coefficients.resize(W.dim());
+
+  // Iterate over cells in mesh
+  dolfin_assert(W.dofmap());
+  for (CellIterator cell0(mesh); !cell0.end(); ++cell0)
+  {
+    // Update UFC view
+    cell0->get_vertex_coordinates(vertex_coordinates0);
+    cell0->get_cell_data(c0);
+
+    // Tabulate dofs for w on cell and store values
+    const std::vector<dolfin::la_index>& dofs
+      = W.dofmap()->cell_dofs(cell0->index());
+
+    // Compute coefficients on this cell
+    std::size_t offset = 0;
+    compute_coefficients(coefficients, v, V, W, *cell0, vertex_coordinates0,
+                         c0, dofs, offset);
+  }
+
+  // Average coefficients
+  average_coefficients(w, coefficients);
+}
+//-----------------------------------------------------------------------------
+void
+Extrapolation::compute_coefficients(std::vector<std::vector<double> >& coefficients,
+                                    const Function& v,
+                                    const FunctionSpace& V,
+                                    const FunctionSpace& W,
+                                    const Cell& cell0,
+                                    const std::vector<double>& vertex_coordinates0,
+                                    const ufc::cell& c0,
+                                    const std::vector<dolfin::la_index>& dofs,
+                                    std::size_t& offset)
+{
+  // Call recursively for mixed elements
+  dolfin_assert(V.element());
+  const std::size_t num_sub_spaces = V.element()->num_sub_elements();
+  if (num_sub_spaces > 0)
+  {
+    for (std::size_t k = 0; k < num_sub_spaces; k++)
+    {
+      compute_coefficients(coefficients, v[k], *V[k], *W[k], cell0,
+                           vertex_coordinates0, c0, dofs, offset);
+    }
+    return;
+  }
+
+  // Build data structures for keeping track of unique dofs
+  std::map<std::size_t, std::map<std::size_t, std::size_t> > cell2dof2row;
+  std::set<std::size_t> unique_dofs;
+  build_unique_dofs(unique_dofs, cell2dof2row, cell0, V);
+
+  // Compute size of linear system
+  dolfin_assert(W.element());
+  const std::size_t N = W.element()->space_dimension();
+  const std::size_t M = unique_dofs.size();
+
+  // Check size of system
+  if (M < N)
+  {
+    dolfin_error("Extrapolation.cpp",
+                 "compute extrapolation",
+                 "Not enough degrees of freedom on local patch to build extrapolation");
+  }
+
+  // Create matrix and vector for linear system
+  Eigen::MatrixXd A(M, N);
+  Eigen::VectorXd b(M);
+
+  // Add equations on cell and neighboring cells
+  add_cell_equations(A, b, cell0, cell0,
+                     vertex_coordinates0, vertex_coordinates0,
+                     c0, c0, V, W, v, cell2dof2row[cell0.index()]);
+  dolfin_assert(V.mesh());
+  ufc::cell c1;
+  std::vector<double> vertex_coordinates1;
+  for (CellIterator cell1(cell0); !cell1.end(); ++cell1)
+  {
+    if (cell2dof2row[cell1->index()].empty())
+      continue;
+
+    cell1->get_vertex_coordinates(vertex_coordinates1);
+    cell1->get_cell_data(c1);
+    add_cell_equations(A, b, cell0, *cell1,
+                       vertex_coordinates0, vertex_coordinates1,
+                       c0, c1, V, W, v,
+                       cell2dof2row[cell1->index()]);
+  }
+
+  // Solve least squares system
+  const Eigen::VectorXd x
+    = A.jacobiSvd(Eigen::ComputeThinU | Eigen::ComputeThinV).solve(b);
+
+  // Insert resulting coefficients into global coefficient vector
+  dolfin_assert(W.dofmap());
+  for (std::size_t i = 0; i < W.dofmap()->cell_dimension(cell0.index()); ++i)
+    coefficients[dofs[i + offset]].push_back(x[i]);
+
+  // Increase offset
+  offset += W.dofmap()->cell_dimension(cell0.index());
+}
+//-----------------------------------------------------------------------------
+void
+Extrapolation::build_unique_dofs(std::set<std::size_t>& unique_dofs,
+                                 std::map<std::size_t, std::map<std::size_t, std::size_t> >& cell2dof2row,
+                                 const Cell& cell0,
+                                 const FunctionSpace& V)
+{
+  // Counter for matrix row index
+  std::size_t row = 0;
+  dolfin_assert(V.mesh());
+
+  // Compute unique dofs on center cell
+  cell2dof2row[cell0.index()] = compute_unique_dofs(cell0, V, row, unique_dofs);
+
+  // Compute unique dofs on neighbouring cells
+  for (CellIterator cell1(cell0); !cell1.end(); ++cell1)
+  {
+    cell2dof2row[cell1->index()] = compute_unique_dofs(*cell1, V, row,
+                                                       unique_dofs);
+  }
+}
+//-----------------------------------------------------------------------------
+void
+Extrapolation::add_cell_equations(Eigen::MatrixXd& A,
+                                  Eigen::VectorXd& b,
+                                  const Cell& cell0,
+                                  const Cell& cell1,
+                                  const std::vector<double>& vertex_coordinates0,
+                                  const std::vector<double>& vertex_coordinates1,
+                                  const ufc::cell& c0,
+                                  const ufc::cell& c1,
+                                  const FunctionSpace& V,
+                                  const FunctionSpace& W,
+                                  const Function& v,
+                                  std::map<std::size_t, std::size_t>& dof2row)
+{
+  // Extract coefficents for v on patch cell
+  dolfin_assert(V.element());
+  std::vector<double> dof_values(V.element()->space_dimension());
+  v.restrict(&dof_values[0], *V.element(), cell1, vertex_coordinates1.data(),
+             c1);
+
+  // Iterate over given local dofs for V on patch cell
+  dolfin_assert(W.element());
+  for (std::map<std::size_t, std::size_t>::iterator it = dof2row.begin();
+       it!= dof2row.end(); it++)
+  {
+    const std::size_t i = it->first;
+    const std::size_t row = it->second;
+
+    // Iterate over basis functions for W on center cell
+    for (std::size_t j = 0; j < W.element()->space_dimension(); ++j)
+    {
+      // Create basis function
+      const BasisFunction phi(j, *W.element(), vertex_coordinates0);
+
+      // Evaluate dof on basis function
+      const double dof_value
+        = V.element()->evaluate_dof(i, phi,  vertex_coordinates1.data(),
+                                    c1.orientation, c1);
+
+      // Insert dof_value into matrix
+      A(row, j) = dof_value;
+    }
+
+    // Insert coefficient into vector
+    b[row] = dof_values[i];
+  }
+}
+//-----------------------------------------------------------------------------
+std::map<std::size_t, std::size_t>
+Extrapolation::compute_unique_dofs(const Cell& cell,
+                                   const FunctionSpace& V,
+                                   std::size_t& row,
+                                   std::set<std::size_t>& unique_dofs)
+{
+  dolfin_assert(V.dofmap());
+  const std::vector<dolfin::la_index>& dofs
+    = V.dofmap()->cell_dofs(cell.index());
+
+  // Data structure for current cell
+  std::map<std::size_t, std::size_t> dof2row;
+
+  for (std::size_t i = 0; i < V.dofmap()->cell_dimension(cell.index()); ++i)
+  {
+    // Ignore if this degree of freedom is already considered
+    if (unique_dofs.find(dofs[i]) != unique_dofs.end())
+      continue;
+
+    // Put global index into unique_dofs
+    unique_dofs.insert(dofs[i]);
+
+    // Map local dof index to current matrix row-index
+    dof2row[i] = row;
+
+    // Increase row index
+    row++;
+  }
+
+  return dof2row;
+}
+//-----------------------------------------------------------------------------
+void Extrapolation::average_coefficients(Function& w,
+                                         std::vector<std::vector<double> >& coefficients)
+{
+  const FunctionSpace& W = *w.function_space();
+  std::vector<double> dof_values(W.dim());
+
+  for (std::size_t i = 0; i < W.dim(); i++)
+  {
+    double s = 0.0;
+    for (std::size_t j = 0; j < coefficients[i].size(); ++j)
+      s += coefficients[i][j];
+
+    s /= static_cast<double>(coefficients[i].size());
+    dof_values[i] = s;
+  }
+
+  // Update dofs for w
+  dolfin_assert(w.vector());
+  w.vector()->set_local(dof_values);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/Extrapolation.h b/dolfin/adaptivity/Extrapolation.h
new file mode 100644
index 0000000..c171aa6
--- /dev/null
+++ b/dolfin/adaptivity/Extrapolation.h
@@ -0,0 +1,112 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Marie E. Rognes 2010.
+// Modified by Garth N. Wells 2010.
+//
+// First added:  2009-12-08
+// Last changed: 2010-12-28
+
+#ifndef __EXTRAPOLATION_H
+#define __EXTRAPOLATION_H
+
+#include <map>
+#include <set>
+#include <vector>
+#include <Eigen/Dense>
+
+#include <dolfin/common/types.h>
+
+namespace ufc
+{
+  class cell;
+}
+
+namespace dolfin
+{
+
+  class Cell;
+  class DirichletBC;
+  class Function;
+  class FunctionSpace;
+
+  /// This class implements an algorithm for extrapolating a function
+  /// on a given function space from an approximation of that function
+  /// on a possibly lower-order function space.
+  ///
+  /// This can be used to obtain a higher-order approximation of a
+  /// computed dual solution, which is necessary when the computed
+  /// dual approximation is in the test space of the primal problem,
+  /// thereby being orthogonal to the residual.
+  ///
+  /// It is assumed that the extrapolation is computed on the same
+  /// mesh as the original function.
+
+  class Extrapolation
+  {
+  public:
+
+    /// Compute extrapolation w from v
+    static void extrapolate(Function& w, const Function& v);
+
+  private:
+
+    // Build data structures for unique dofs on patch of given cell
+    static void build_unique_dofs(std::set<std::size_t>& unique_dofs,
+                        std::map<std::size_t, std::map<std::size_t, std::size_t> >& cell2dof2row,
+                                  const Cell& cell0,
+                                  const FunctionSpace& V);
+
+    // Compute unique dofs in given cell
+    static std::map<std::size_t, std::size_t>
+      compute_unique_dofs(const Cell& cell, const FunctionSpace& V,
+                          std::size_t& row, std::set<std::size_t>& unique_dofs);
+
+    // Compute coefficients on given cell
+    static void
+      compute_coefficients(std::vector<std::vector<double> >& coefficients,
+                           const Function&v, const FunctionSpace& V,
+                           const FunctionSpace& W, const Cell& cell0,
+                           const std::vector<double>& vertex_coordinates0,
+                           const ufc::cell& c0,
+                           const std::vector<dolfin::la_index>& dofs,
+                           std::size_t& offset);
+
+    // Add equations for current cell
+    static void add_cell_equations(Eigen::MatrixXd& A,
+                                 Eigen::VectorXd& b,
+                                 const Cell& cell0,
+                                 const Cell& cell1,
+                                 const std::vector<double>& vertex_coordinates0,
+                                 const std::vector<double>& vertex_coordinates1,
+                                 const ufc::cell& c0,
+                                 const ufc::cell& c1,
+                                 const FunctionSpace& V,
+                                 const FunctionSpace& W,
+                                 const Function& v,
+                                 std::map<std::size_t, std::size_t>& dof2row);
+
+    // Average coefficients
+    static void
+      average_coefficients(Function& w,
+                           std::vector<std::vector<double> >& coefficients);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/adaptivity/GenericAdaptiveVariationalSolver.cpp b/dolfin/adaptivity/GenericAdaptiveVariationalSolver.cpp
new file mode 100644
index 0000000..57ffea2
--- /dev/null
+++ b/dolfin/adaptivity/GenericAdaptiveVariationalSolver.cpp
@@ -0,0 +1,257 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2010-2013
+//
+// First added:  2010-08-19
+// Last changed: 2013-11-15
+
+#include <sstream>
+#include <stdio.h>
+#include <dolfin/log/Table.h>
+#include <dolfin/common/utils.h>
+#include <dolfin/common/Timer.h>
+
+#include <dolfin/parameter/Parameters.h>
+#include <dolfin/la/Vector.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/plot/plot.h>
+
+#include "GenericAdaptiveVariationalSolver.h"
+#include "GoalFunctional.h"
+#include "ErrorControl.h"
+#include "TimeSeries.h"
+#include "adapt.h"
+#include "marking.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+GenericAdaptiveVariationalSolver::~GenericAdaptiveVariationalSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void GenericAdaptiveVariationalSolver::solve(const double tol)
+{
+  log(INFO, "Solving variational problem adaptively");
+
+  // Check that goal functional has at least one coefficient (last one
+  // is the solution variable u)
+  if (goal->num_coefficients() == 0)
+  {
+    dolfin_error("AdaptiveLinearVariationalSolver.cpp",
+                 "adaptively solve variational problem",
+                 "The goal functional must have at least one coefficient. "
+                 "Check that it has been defined in terms of a Function, not a TrialFunction");
+  }
+
+  // Initialize storage of meshes and indicators
+  std::string label = parameters["data_label"];
+  TimeSeries series(label);
+
+  // Iterate over a series of meshes
+  Timer timer("Adaptive solve");
+  const std::size_t max_iterations = parameters["max_iterations"];
+  for (std::size_t i = 0; i < max_iterations; i++)
+  {
+    log(INFO, "Adaptive iteration %d", i );
+
+    // Check that num_dofs is not greater than than max dimension (and
+    // that that parameter is modified)
+    const std::size_t max_dimension = parameters["max_dimension"];
+    if (parameters["max_dimension"].change_count() > 0
+        && num_dofs_primal() > max_dimension)
+    {
+      info("Maximal number of dofs reached, finishing");
+      return;
+    }
+
+    // Initialize adaptive data
+    std::shared_ptr<Parameters> datum(new Parameters("adaptive_data"));
+    _adaptive_data.push_back(datum);
+    const int refinement_level = i;
+    datum->add("refinement_level", refinement_level);
+    datum->add("tolerance", tol);
+    if (parameters["reference"].change_count() > 0)
+    {
+      const double reference = parameters["reference"];
+      datum->add("reference", reference);
+    }
+
+    // Deal with goal and error control on current mesh
+    Form& M = goal->leaf_node();
+    ErrorControl& ec = control->leaf_node();
+    ec.parameters.update(parameters("error_control"));
+
+    //--- Stage 0: Solve primal problem
+    begin(PROGRESS, "Stage %d.0: Solving primal problem...", i);
+    timer.start();
+    std::shared_ptr<const Function> u = solve_primal();
+    datum->add("time_solve_primal", timer.stop());
+
+    // Extract views to primal trial space and mesh
+    dolfin_assert(u->function_space());
+    const FunctionSpace& V = *u->function_space();
+    dolfin_assert(V.mesh());
+    const Mesh& mesh = *V.mesh();
+
+    // Evaluate goal functional
+    log(PROGRESS, "Evaluating goal functional.");
+    const double functional_value = evaluate_goal(M, u);
+    info("Value of goal functional is %g.", functional_value);
+    end();
+
+    //--- Stage 1: Estimate error
+    begin(PROGRESS, "Stage %d.1: Computing error estimate...", i);
+    timer.start();
+    const double error_estimate = ec.estimate_error(*u, extract_bcs());
+    datum->add("time_estimate_error", timer.stop());
+    log(PROGRESS, "Error estimate is %g (tol = %g).", error_estimate, tol);
+    end();
+
+    const int num_cells = mesh.num_cells();
+    const int num_dofs = V.dim();
+    datum->add("num_cells", num_cells);
+    datum->add("num_dofs", num_dofs);
+    datum->add("error_estimate", error_estimate);
+    datum->add("functional_value", functional_value);
+
+    // Stop if error estimate is less than tolerance
+    if (std::abs(error_estimate) < tol)
+    {
+      info("Error estimate (%g) is less than tolerance (%g), returning.",
+           error_estimate, tol);
+      return;
+    }
+
+    //--- Stage 2: Compute error indicators
+    begin(PROGRESS, "Stage %d.2: Computing error indicators...", i);
+    timer.start();
+    MeshFunction<double> indicators(mesh, mesh.topology().dim());
+    dolfin_assert(u);
+    ec.compute_indicators(indicators, *u);
+    datum->add("time_compute_indicators", timer.stop());
+    if (parameters["save_data"])
+    {
+      //series.store(indicators, i); // No TimeSeries storage of MeshFunction
+      series.store(mesh, i);
+    }
+    end();
+
+    //--- Stage 3: Mark mesh for refinement ---
+    begin(PROGRESS, "Stage %d.3: Marking mesh for refinement...", i);
+    MeshFunction<bool> markers(mesh, mesh.topology().dim());
+    const std::string strategy = parameters["marking_strategy"];
+    const double fraction = parameters["marking_fraction"];
+    timer.start();
+    mark(markers, indicators, strategy, fraction);
+    datum->add("time_mark_mesh", timer.stop());
+    end();
+
+    //--- Stage 4: Refine mesh ---
+    begin(PROGRESS, "Stage %d.4: Refining mesh...", i);
+    timer.start();
+    adapt(mesh, markers);
+    datum->add("time_adapt_mesh", timer.stop());
+    if (parameters["plot_mesh"])
+      plot(mesh.child(), "Refined mesh");
+    end();
+
+    //--- Stage 5: Update forms ---
+    begin(PROGRESS, "Stage %d.5: Updating forms...", i);
+    timer.start();
+    adapt_problem(mesh.leaf_node_shared_ptr());
+    adapt(M, mesh.leaf_node_shared_ptr());
+    adapt(ec, mesh.leaf_node_shared_ptr(), false);
+    datum->add("time_adapt_forms", timer.stop());
+    end();
+  }
+
+  warning("Maximal number of iterations (%d) exceeded! Returning anyhow.",
+          max_iterations);
+}
+//-----------------------------------------------------------------------------
+std::vector<std::shared_ptr<Parameters> >
+GenericAdaptiveVariationalSolver::adaptive_data() const
+{
+  return _adaptive_data;
+}
+//-----------------------------------------------------------------------------
+void GenericAdaptiveVariationalSolver::summary()
+{
+  // Show parameters used
+  info("");
+  info("Parameters used for adaptive solve:");
+  info("");
+  info(parameters, false);
+
+  Table table("Level");
+  Table time_table("Level");
+
+  for (std::size_t i = 0; i < _adaptive_data.size(); i++)
+  {
+    std::stringstream s;
+    s << i;
+    const Parameters& datum = *_adaptive_data[i];
+
+    if (datum.has_key("reference"))
+      table(s.str(), "reference") = datum["reference"].value_str();
+    table(s.str(), "functional_value") = datum["functional_value"].value_str();
+    table(s.str(), "error_estimate") = datum["error_estimate"].value_str();
+    table(s.str(), "tolerance") = datum["tolerance"].value_str();
+    table(s.str(), "num_cells") = datum["num_cells"].value_str();
+    table(s.str(), "num_dofs") = datum["num_dofs"].value_str();
+
+    time_table(s.str(), "solve_primal")
+      = datum["time_solve_primal"].value_str();
+    time_table(s.str(), "estimate_error")
+      = datum["time_estimate_error"].value_str();
+    if (datum.has_key("time_compute_indicators"))
+      time_table(s.str(), "compute_indicators")
+        = datum["time_compute_indicators"].value_str();
+    else
+      time_table(s.str(), "compute_indicators") = 0.0;
+    if (datum.has_key("time_mark_mesh"))
+      time_table(s.str(), "mark_mesh") = datum["time_mark_mesh"].value_str();
+    else
+      time_table(s.str(), "mark_mesh") = 0.0;
+    if (datum.has_key("time_adapt_mesh"))
+      time_table(s.str(), "adapt_mesh") = datum["time_adapt_mesh"].value_str();
+    else
+      time_table(s.str(), "adapt_mesh") = 0.0;
+    if (datum.has_key("time_adapt_forms"))
+      time_table(s.str(), "update") = datum["time_adapt_forms"].value_str();
+    else
+      time_table(s.str(), "update") = 0.0;
+  }
+
+  // Show summary for all iterations
+  info("");
+  info("Summary of adaptive data:");
+  info("");
+  info(indent(table.str(true)));
+  info("");
+  info("Time spent for adaptive solve (in seconds):");
+  info("");
+  info(indent(time_table.str(true)));
+  info("");
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/GenericAdaptiveVariationalSolver.h b/dolfin/adaptivity/GenericAdaptiveVariationalSolver.h
new file mode 100644
index 0000000..d23422f
--- /dev/null
+++ b/dolfin/adaptivity/GenericAdaptiveVariationalSolver.h
@@ -0,0 +1,161 @@
+// Copyright (C) 2010--2012 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010-2011.
+//
+// First added:  2010-08-19
+// Last changed: 2012-11-14
+
+#ifndef __GENERIC_ADAPTIVE_VARIATIONAL_SOLVER_H
+#define __GENERIC_ADAPTIVE_VARIATIONAL_SOLVER_H
+
+#include <vector>
+#include <memory>
+#include <dolfin/common/Variable.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+
+namespace dolfin
+{
+  // Forward declarations
+  class DirichletBC;
+  class Form;
+  class Function;
+  class FunctionSpace;
+  class GoalFunctional;
+  class Mesh;
+  class Parameters;
+
+  /// An abstract class for goal-oriented adaptive solution of
+  /// variational problems.
+  ///
+  class GenericAdaptiveVariationalSolver : public Variable
+  {
+  public:
+
+    virtual ~GenericAdaptiveVariationalSolver();
+
+    /// Solve such that the functional error is less than the given
+    /// tolerance. Note that each call to solve is based on the
+    /// leaf-node of the variational problem
+    ///
+    /// *Arguments*
+    ///     tol  (double)
+    ///         The error tolerance
+    void solve(const double tol);
+
+    /// Solve the primal problem. Must be overloaded in subclass.
+    ///
+    /// *Returns*
+    ///     _Function_
+    ///         The solution to the primal problem
+    virtual std::shared_ptr<const Function> solve_primal() = 0;
+
+    /// Extract the boundary conditions for the primal problem. Must
+    /// be overloaded in subclass.
+    ///
+    /// *Returns*
+    ///     std::vector<_DirichletBC_>
+    ///         The primal boundary conditions
+    virtual std::vector<std::shared_ptr<const DirichletBC> >
+      extract_bcs() const = 0;
+
+    /// Evaluate the goal functional. Must be overloaded in subclass.
+    ///
+    /// *Arguments*
+    ///    M (_Form_)
+    ///        The functional to be evaluated
+    ///    u (_Function_)
+    ///        The function of which to evaluate the functional
+    ///
+    /// *Returns*
+    ///     double
+    ///         The value of M evaluated at u
+    virtual double evaluate_goal(Form& M,
+                                 std::shared_ptr<const Function> u) const = 0;
+
+    /// Adapt the problem to other mesh. Must be overloaded in subclass.
+    ///
+    /// *Arguments*
+    ///    mesh (_Mesh_)
+    ///        The other mesh
+    virtual void adapt_problem(std::shared_ptr<const Mesh> mesh) = 0;
+
+    /// Return stored adaptive data
+    ///
+    /// *Returns*
+    ///    std::vector<_Parameters_>
+    ///        The data stored in the adaptive loop
+    std::vector<std::shared_ptr<Parameters> > adaptive_data() const;
+
+    /// Default parameter values:
+    ///
+    ///     "max_iterations"     (int)
+    ///     "max_dimension"      (int)
+    ///     "plot_mesh"          (bool)
+    ///     "save_data"          (bool)
+    ///     "data_label"         (std::string)
+    ///     "reference"          (double)
+    ///     "marking_strategy"   (std::string)
+    ///     "marking_fraction"   (double)
+    static Parameters default_parameters()
+    {
+      Parameters p("adaptive_solver");
+
+      // Set default generic adaptive parameters
+      p.add("max_iterations", 50);
+      p.add("max_dimension", 0);
+      p.add("plot_mesh", false); // Useful for debugging
+      p.add("save_data", false);
+      p.add("data_label", "default/adaptivity");
+      p.add("reference", 0.0);
+      p.add("marking_strategy", "dorfler");
+      p.add("marking_fraction", 0.5, 0.0, 1.0);
+
+      // Set parameters for dual solver
+      Parameters ec_params(ErrorControl::default_parameters());
+      p.add(ec_params);
+
+      return p;
+    }
+
+    /// Present summary of all adaptive data and parameters
+    void summary();
+
+  protected:
+
+    // The goal functional
+    std::shared_ptr<Form> goal;
+
+    // Error control object
+    std::shared_ptr<ErrorControl> control;
+
+    // A list of adaptive data
+    std::vector<std::shared_ptr<Parameters> > _adaptive_data;
+
+    /// Return the number of degrees of freedom for primal problem
+    ///
+    /// *Returns*
+    ///     _std::size_t_
+    ///         The number of degrees of freedom
+    virtual std::size_t num_dofs_primal() = 0;
+
+  };
+}
+
+
+
+#endif
diff --git a/dolfin/adaptivity/GoalFunctional.cpp b/dolfin/adaptivity/GoalFunctional.cpp
new file mode 100644
index 0000000..a4120f4
--- /dev/null
+++ b/dolfin/adaptivity/GoalFunctional.cpp
@@ -0,0 +1,34 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010.
+//
+// First added:  2010-09-16
+// Last changed: 2010-12-02
+
+#include "GoalFunctional.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+GoalFunctional::GoalFunctional(std::size_t rank, std::size_t num_coefficients)
+  : Form(rank, num_coefficients)
+{
+  // Check that rank is 0
+  dolfin_assert(rank == 0);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/GoalFunctional.h b/dolfin/adaptivity/GoalFunctional.h
new file mode 100644
index 0000000..0c53ae1
--- /dev/null
+++ b/dolfin/adaptivity/GoalFunctional.h
@@ -0,0 +1,67 @@
+// Copyright (C) 2010--2012 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-09-16
+// Last changed: 2012-11-14
+
+#ifndef __GOAL_FUNCTIONAL_H
+#define __GOAL_FUNCTIONAL_H
+
+#include <memory>
+#include <dolfin/fem/Form.h>
+#include "ErrorControl.h"
+
+namespace dolfin
+{
+
+  /// A _GoalFunctional_ is a _Form_ of rank 0 with an associated
+  /// _ErrorControl_.
+
+  class GoalFunctional : public Form
+  {
+
+  public:
+
+    // FIXME: The rank argument is unnecessary, a GoalFunction should
+    // always have rank 0. The argument should be removed for that
+    // reason.
+
+    /// Create _GoalFunctional_
+    ///
+    /// *Arguments*
+    ///     rank (int)
+    ///         the rank of the functional (should be 0)
+    ///     num_coefficients (int)
+    ///         the number of coefficients in functional
+    GoalFunctional(std::size_t rank, std::size_t num_coefficients);
+
+    /// Update error control instance with given forms
+    ///
+    /// *Arguments*
+    ///     a (_Form_)
+    ///         a bilinear form
+    ///     L (_Form_)
+    ///         a linear form
+    virtual void update_ec(const Form& a, const Form& L) = 0;
+
+    // Pointer to _ErrorControl_ instance
+    std::shared_ptr<ErrorControl> _ec;
+
+  };
+
+}
+#endif
diff --git a/dolfin/adaptivity/LocalAssembler.cpp b/dolfin/adaptivity/LocalAssembler.cpp
new file mode 100644
index 0000000..6681726
--- /dev/null
+++ b/dolfin/adaptivity/LocalAssembler.cpp
@@ -0,0 +1,204 @@
+// Copyright (C) 2011 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2013
+//
+// First added:  2011-01-04
+// Last changed: 2013-01-10
+
+#include <Eigen/Dense>
+#include <dolfin/fem/UFC.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Facet.h>
+#include "LocalAssembler.h"
+
+using namespace dolfin;
+
+//------------------------------------------------------------------------------
+void
+LocalAssembler::assemble(Eigen::MatrixXd& A,
+                         UFC& ufc,
+                         const std::vector<double>& vertex_coordinates,
+                         ufc::cell& ufc_cell,
+                         const Cell& cell,
+                         const MeshFunction<std::size_t>* cell_domains,
+                         const MeshFunction<std::size_t>* exterior_facet_domains,
+                         const MeshFunction<std::size_t>* interior_facet_domains)
+{
+  // Clear tensor
+  A.setZero();
+
+  cell.get_cell_data(ufc_cell);
+
+  // Assemble contributions from cell integral
+  assemble_cell(A, ufc, vertex_coordinates, ufc_cell, cell, cell_domains);
+
+  // Assemble contributions from facet integrals
+  for (FacetIterator facet(cell); !facet.end(); ++facet)
+  {
+    ufc_cell.local_facet = facet.pos();
+    if (facet->num_entities(cell.dim()) == 2)
+    {
+      assemble_interior_facet(A, ufc, vertex_coordinates, ufc_cell, cell,
+                              *facet, facet.pos(), interior_facet_domains);
+    }
+    else
+    {
+      assemble_exterior_facet(A, ufc, vertex_coordinates, ufc_cell, cell,
+                              *facet, facet.pos(), exterior_facet_domains);
+    }
+  }
+}
+//------------------------------------------------------------------------------
+void LocalAssembler::assemble_cell(Eigen::MatrixXd& A,
+                                   UFC& ufc,
+                                   const std::vector<double>& vertex_coordinates,
+                                   const ufc::cell& ufc_cell,
+                                   const Cell& cell,
+                                   const MeshFunction<std::size_t>* domains)
+{
+  // Skip if there are no cell integrals
+  if (!ufc.form.has_cell_integrals())
+    return;
+
+  // Extract default cell integral
+  ufc::cell_integral* integral = ufc.default_cell_integral.get();
+
+  // Get integral for sub domain (if any)
+  if (domains && !domains->empty())
+    integral = ufc.get_cell_integral((*domains)[cell]);
+
+  // Skip integral if zero
+  if (!integral)
+    return;
+
+  // Update to current cell
+  ufc.update(cell, vertex_coordinates, ufc_cell,
+             integral->enabled_coefficients());
+
+  // Tabulate cell tensor
+  integral->tabulate_tensor(ufc.A.data(),
+                            ufc.w(),
+                            vertex_coordinates.data(),
+                            ufc_cell.orientation);
+
+  // Stuff a_ufc.A into A
+  const std::size_t M = A.rows();
+  const std::size_t N = A.cols();
+  for (std::size_t i = 0; i < M; i++)
+    for (std::size_t j = 0; j < N; j++)
+      A(i, j) += ufc.A[N*i + j];
+}
+//------------------------------------------------------------------------------
+void LocalAssembler::assemble_exterior_facet(Eigen::MatrixXd& A,
+                                  UFC& ufc,
+                                  const std::vector<double>& vertex_coordinates,
+                                  const ufc::cell& ufc_cell,
+                                  const Cell& cell,
+                                  const Facet& facet,
+                                  const std::size_t local_facet,
+                                  const MeshFunction<std::size_t>* domains)
+{
+  // Skip if there are no exterior facet integrals
+  if (!ufc.form.has_exterior_facet_integrals())
+    return;
+
+  // Extract default exterior facet integral
+  ufc::exterior_facet_integral* integral
+    = ufc.default_exterior_facet_integral.get();
+
+  // Get integral for sub domain (if any)
+  if (domains && !domains->empty())
+    integral = ufc.get_exterior_facet_integral((*domains)[facet]);
+
+  // Skip integral if zero
+  if (!integral)
+    return;
+
+  // Update to current cell
+  ufc.update(cell, vertex_coordinates, ufc_cell,
+             integral->enabled_coefficients());
+
+  // Tabulate exterior facet tensor
+  integral->tabulate_tensor(ufc.A.data(),
+                            ufc.w(),
+                            vertex_coordinates.data(),
+                            local_facet,
+                            ufc_cell.orientation);
+
+  // Stuff a_ufc.A into A
+  const std::size_t M = A.rows();
+  const std::size_t N = A.cols();
+  for (std::size_t i = 0; i < M; i++)
+    for (std::size_t j = 0; j < N; j++)
+      A(i, j) += ufc.A[N*i + j];
+}
+//------------------------------------------------------------------------------
+void LocalAssembler::assemble_interior_facet(Eigen::MatrixXd& A,
+                                  UFC& ufc,
+                                  const std::vector<double>& vertex_coordinates,
+                                  const ufc::cell& ufc_cell,
+                                  const Cell& cell,
+                                  const Facet& facet,
+                                  const std::size_t local_facet,
+                                  const MeshFunction<std::size_t>* domains)
+{
+  // Skip if there are no interior facet integrals
+  if (!ufc.form.has_interior_facet_integrals())
+    return;
+
+  // Extract default interior facet integral
+  ufc::interior_facet_integral* integral
+    = ufc.default_interior_facet_integral.get();
+
+  // Get integral for sub domain (if any)
+  if (domains && !domains->empty())
+    integral = ufc.get_interior_facet_integral((*domains)[facet]);
+
+  // Skip integral if zero
+  if (!integral)
+    return;
+
+  // Update to current pair of cells and facets
+  ufc.update(cell, vertex_coordinates, ufc_cell,
+             cell, vertex_coordinates, ufc_cell,
+             integral->enabled_coefficients());
+
+  // Tabulate interior facet tensor on macro element
+  integral->tabulate_tensor(ufc.macro_A.data(), ufc.macro_w(),
+                            vertex_coordinates.data(),
+                            vertex_coordinates.data(),
+                            local_facet, local_facet,
+                            ufc_cell.orientation,
+                            ufc_cell.orientation);
+
+  // Stuff upper left quadrant (corresponding to this cell) into A
+  const std::size_t M = A.rows();
+  const std::size_t N = A.cols();
+  if (N == 1)
+  {
+    for (std::size_t i = 0; i < M; i++)
+      A(i, 0) = ufc.macro_A[i];
+  }
+  else
+  {
+    for (std::size_t i = 0; i < M; i++)
+      for (std::size_t j = 0; j < N; j++)
+        A(i, j) += ufc.macro_A[2*N*i + j];
+  }
+}
+//------------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/LocalAssembler.h b/dolfin/adaptivity/LocalAssembler.h
new file mode 100644
index 0000000..631563a
--- /dev/null
+++ b/dolfin/adaptivity/LocalAssembler.h
@@ -0,0 +1,91 @@
+// Copyright (C) 2011 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-01-04
+// Last changed: 2011-01-13
+
+#ifndef __LOCAL_ASSEMBLER_H
+#define __LOCAL_ASSEMBLER_H
+
+#include <vector>
+#include <Eigen/Dense>
+#include <dolfin/common/types.h>
+
+namespace ufc
+{
+  class cell;
+}
+
+namespace dolfin
+{
+
+  class Cell;
+  class Facet;
+  class UFC;
+  template<typename T> class MeshFunction;
+
+  ///
+  class LocalAssembler
+  {
+
+  public:
+
+    ///
+    static void
+      assemble(Eigen::MatrixXd& A,
+               UFC& ufc,
+               const std::vector<double>& vertex_coordinates,
+               ufc::cell& ufc_cell,
+               const Cell& cell,
+               const MeshFunction<std::size_t>* cell_domains,
+               const MeshFunction<std::size_t>* exterior_facet_domains,
+               const MeshFunction<std::size_t>* interior_facet_domains);
+
+    ///
+    static void assemble_cell(Eigen::MatrixXd& A,
+                              UFC& ufc,
+                              const std::vector<double>& vertex_coordinates,
+                              const ufc::cell& ufc_cell,
+                              const Cell& cell,
+                              const MeshFunction<std::size_t>* domains);
+
+    ///
+    static void
+      assemble_exterior_facet(Eigen::MatrixXd& A,
+                              UFC& ufc,
+                              const std::vector<double>& vertex_coordinates,
+                              const ufc::cell& ufc_cell,
+                              const Cell& cell,
+                              const Facet& facet,
+                              const std::size_t local_facet,
+                              const MeshFunction<std::size_t>* domains);
+
+    ///
+    static void
+      assemble_interior_facet(Eigen::MatrixXd& A,
+                              UFC& ufc,
+                              const std::vector<double>& vertex_coordinates,
+                              const ufc::cell& ufc_cell,
+                              const Cell& cell,
+                              const Facet& facet,
+                              const std::size_t local_facet,
+                              const MeshFunction<std::size_t>* domains);
+  };
+
+}
+
+#endif
diff --git a/dolfin/adaptivity/TimeSeries.cpp b/dolfin/adaptivity/TimeSeries.cpp
new file mode 100644
index 0000000..f3115ca
--- /dev/null
+++ b/dolfin/adaptivity/TimeSeries.cpp
@@ -0,0 +1,404 @@
+// Copyright (C) 2009-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-11-11
+// Last changed: 2012-05-28
+
+#include <algorithm>
+#include <iostream>
+#include <memory>
+#include <sstream>
+
+#include <dolfin/log/LogStream.h>
+#include <dolfin/common/constants.h>
+#include <dolfin/io/File.h>
+#include <dolfin/io/BinaryFile.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/la/GenericLinearAlgebraFactory.h>
+#include "TimeSeries.h"
+
+using namespace dolfin;
+
+// Template function for storing objects
+template <typename T>
+void store_object(const T& object, double t,
+                  std::vector<double>& times,
+                  std::string series_name,
+                  std::string type_name,
+		  bool compressed,
+		  bool store_connectivity)
+{
+  // Write object
+  BinaryFile file_data(TimeSeries::filename_data(series_name, type_name,
+						 times.size(), compressed),
+                       store_connectivity);
+  file_data << object;
+
+  // Check that time values are strictly increasing
+  const std::size_t n = times.size();
+  if (n >= 2 and (times[n - 1] - times[n - 2])*(t - times[n - 1]) <= 0.0)
+  {
+    dolfin_error("TimeSeries.cpp",
+                 "store object to time series",
+                 "Sample points must be strictly monotone (t_0 = %g, t_1 = %g, t_2 = %g)",
+                 times[n - 2], times[n - 1], t);
+  }
+
+  // Add time
+  times.push_back(t);
+
+  // Store times
+  BinaryFile file_times(TimeSeries::filename_times(series_name, type_name,
+						   compressed));
+  file_times << times;
+}
+
+//-----------------------------------------------------------------------------
+TimeSeries::TimeSeries(std::string name, bool compressed,
+		       bool store_connectivity)
+  : _name(name), _cleared(false), _compressed(compressed),
+    _store_connectivity(store_connectivity)
+{
+  not_working_in_parallel("Storing of data to time series");
+
+  // Set default parameters
+  parameters = default_parameters();
+
+  // Read vector times if any
+  std::string filename_vector = TimeSeries::filename_times(_name,
+                                                           "vector",
+                                                           _compressed);
+  if (File::exists(filename_vector))
+  {
+    // Read from file
+    File file(filename_vector);
+    file >> _vector_times;
+    log(PROGRESS, "Found %d vector sample(s) in time series.",
+        _vector_times.size());
+    if (!monotone(_vector_times))
+    {
+      dolfin_error("TimeSeries.cpp",
+                   "read time series from file",
+                   "Sample points for vector data are not strictly monotone in series \"%s\"",
+                   name.c_str());
+    }
+  }
+  else
+    log(PROGRESS, "No vector samples found in time series.");
+
+  // Read mesh times if any
+  std::string filename_mesh = TimeSeries::filename_times(_name,
+                                                         "mesh",
+                                                         _compressed);
+  if (File::exists(filename_mesh))
+  {
+    // Read from file
+    File file(filename_mesh);
+    file >> _mesh_times;
+    log(PROGRESS, "Found %d mesh sample(s) in time series.",
+        _mesh_times.size());
+    if (!monotone(_mesh_times))
+    {
+      dolfin_error("TimeSeries.cpp",
+                   "read time series from file",
+                   "Sample points for mesh data are not strictly monotone in series \"%s\"",
+                   name.c_str());
+    }
+  }
+  else
+    log(PROGRESS, "No mesh samples found in time series.");
+
+  // Create subdirectories (should really be enough with just one call)
+  File::create_parent_path(filename_vector);
+  File::create_parent_path(filename_mesh);
+}
+//-----------------------------------------------------------------------------
+TimeSeries::~TimeSeries()
+{
+  // Do nothing (keep files)
+}
+//-----------------------------------------------------------------------------
+void TimeSeries::store(const GenericVector& vector, double t)
+{
+  // Clear earlier history first time we store a value
+  const bool clear_on_write = this->parameters["clear_on_write"];
+  if (!_cleared && clear_on_write)
+    clear();
+
+  // Store object
+  store_object(vector, t, _vector_times, _name, "vector", _compressed, false);
+}
+//-----------------------------------------------------------------------------
+void TimeSeries::store(const Mesh& mesh, double t)
+{
+  // Clear earlier history first time we store a value
+  const bool clear_on_write = this->parameters["clear_on_write"];
+  if (!_cleared && clear_on_write)
+    clear();
+
+  // Store object
+  store_object(mesh, t, _mesh_times, _name, "mesh", _compressed,
+	       _store_connectivity);
+}
+//-----------------------------------------------------------------------------
+void TimeSeries::retrieve(GenericVector& vector, double t,
+                          bool interpolate) const
+{
+  // Interpolate value
+  if (interpolate)
+  {
+    // Find closest pair
+    const std::pair<std::size_t, std::size_t> index_pair
+      = find_closest_pair(t, _vector_times, _name, "vector");
+    const std::size_t i0 = index_pair.first;
+    const std::size_t i1 = index_pair.second;
+
+    // Special case: same index
+    if (i0 == i1)
+    {
+      File f(filename_data(_name, "vector", i0, _compressed));
+      f >> vector;
+      log(PROGRESS, "Reading vector value at t = %g.", _vector_times[0]);
+      return;
+    }
+
+    log(PROGRESS, "Interpolating vector value at t = %g in interval [%g, %g].",
+        t, _vector_times[i0], _vector_times[i1]);
+
+    // Read vectors
+    GenericVector& x0(vector);
+    std::shared_ptr<GenericVector> x1 = x0.factory().create_vector();
+    File f0(filename_data(_name, "vector", i0, _compressed));
+    File f1(filename_data(_name, "vector", i1, _compressed));
+    f0 >> x0;
+    f1 >> *x1;
+
+    // Check that the vectors have the same size
+    if (x0.size() != x1->size())
+    {
+      dolfin_error("TimeSeries.cpp",
+                   "interpolate vector value in time series",
+                   "Vector sizes don't match (%d and %d)",
+                   x0.size(), x1->size());
+    }
+
+    // Compute weights for linear interpolation
+    const double dt = _vector_times[i1] - _vector_times[i0];
+    dolfin_assert(std::abs(dt) > DOLFIN_EPS);
+    const double w0 = (_vector_times[i1] - t) / dt;
+    const double w1 = 1.0 - w0;
+
+    // Interpolate
+    x0 *= w0;
+    x0.axpy(w1, *x1);
+  }
+
+  // Read closest value
+  else
+  {
+    // Find closest index
+    const std::size_t index = find_closest_index(t, _vector_times, _name,
+                                                 "vector");
+
+    log(PROGRESS, "Reading vector at t = %g (close to t = %g).",
+        _vector_times[index], t);
+
+    // Read vector
+    File file(filename_data(_name, "vector", index, _compressed));
+    file >> vector;
+  }
+}
+//-----------------------------------------------------------------------------
+void TimeSeries::retrieve(Mesh& mesh, double t) const
+{
+  // Get index closest to given time
+  const std::size_t index = find_closest_index(t, _mesh_times, _name, "mesh");
+
+  log(PROGRESS, "Reading mesh at t = %g (close to t = %g).",
+      _mesh_times[index], t);
+
+  // Read mesh
+  std::cout << "Mesh file name: "
+      << filename_data(_name, "mesh", index, _compressed) << std::endl;
+  File file(filename_data(_name, "mesh", index, _compressed));
+  file >> mesh;
+}
+//-----------------------------------------------------------------------------
+std::vector<double> TimeSeries::vector_times() const
+{
+  return _vector_times;
+}
+//-----------------------------------------------------------------------------
+std::vector<double> TimeSeries::mesh_times() const
+{
+  return _mesh_times;
+}
+//-----------------------------------------------------------------------------
+void TimeSeries::clear()
+{
+  _vector_times.clear();
+  _mesh_times.clear();
+  _cleared = true;
+}
+//-----------------------------------------------------------------------------
+std::string TimeSeries::filename_data(std::string series_name,
+                                      std::string type_name,
+                                      std::size_t index,
+				      bool compressed)
+{
+  std::stringstream s;
+  s << series_name << "_" << type_name << "_" << index << ".bin";
+  if (compressed)
+    s << ".gz";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string TimeSeries::filename_times(std::string series_name,
+                                       std::string type_name,
+				       bool compressed)
+{
+  std::stringstream s;
+  s << series_name << "_" << type_name << "_times" << ".bin";
+  if (compressed)
+    s << ".gz";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string TimeSeries::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    s << "Vectors:";
+    for (std::size_t i = 0; i < _vector_times.size(); ++i)
+      s << "  " << i << ": " << _vector_times[i];
+    s << std::endl;
+
+    s << "Meshes:";
+    for (std::size_t i = 0; i < _mesh_times.size(); ++i)
+      s << "  " << i << ": " << _mesh_times[i];
+    s << std::endl;
+  }
+  else
+  {
+    s << "<Time series with "
+      << _vector_times.size()
+      << " vector(s) and "
+      << _mesh_times.size()
+      << " mesh(es)>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+bool TimeSeries::monotone(const std::vector<double>& times)
+{
+  // If size of time series is 0 or 1 they are always monotone
+  if (times.size() < 2)
+    return true;
+
+  // If size is 2
+  if (times.size() == 2)
+    return times[0] < times[1];
+
+  for (std::size_t i = 0; i < times.size() - 2; i++)
+  {
+    if ((times[i + 2] - times[i + 1])*(times[i + 1] - times[i]) <= 0.0)
+      return false;
+  }
+  return true;
+}
+//-----------------------------------------------------------------------------
+std::size_t TimeSeries::find_closest_index(double t,
+                                           const std::vector<double>& times,
+                                           std::string series_name,
+                                           std::string type_name)
+{
+  // Get closest pair
+  const std::pair<std::size_t, std::size_t> index_pair
+    = find_closest_pair(t, times, series_name, type_name);
+  const std::size_t i0 = index_pair.first;
+  const std::size_t i1 = index_pair.second;
+
+  // Check which is closer
+  const std::size_t i = (std::abs(t - times[i0])
+                         < std::abs(t - times[i1]) ? i0 : i1);
+  dolfin_debug2("Using closest value t[%d] = %g", i, times[i]);
+
+  return i;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+TimeSeries::find_closest_pair(double t, const std::vector<double>& times,
+                              std::string series_name, std::string type_name)
+{
+  // Must have at least one value stored
+  if (times.empty())
+  {
+    dolfin_error("TimeSeries.cpp",
+                 "to retrieve data from time seris",
+                 "No %s stored in time series",
+                 type_name.c_str());
+  }
+
+  // Special case: just one value stored
+  if (times.size() == 1)
+  {
+    dolfin_debug("Series has just one value, returning index 0.");
+    return std::make_pair(0, 0);
+  }
+
+  // Check whether series is reversed
+  const bool reversed = times[0] > times[1];
+
+  // Find lower bound. Note that lower_bound() returns first item
+  // larger than t or end of vector if no such item exists.
+  std::vector<double>::const_iterator lower;
+  if (reversed)
+  {
+    lower = std::lower_bound(times.begin(), times.end(), t,
+                             std::greater<double>());
+  }
+  else
+  {
+    lower = std::lower_bound(times.begin(), times.end(), t,
+                             std::less<double>());
+  }
+
+  // Set indexlower and upper bound
+  std::size_t i0 = 0;
+  std::size_t i1 = 0;
+  if (lower == times.begin())
+    i0 = i1 = lower - times.begin();
+  else if (lower == times.end())
+    i0 = i1 = lower - times.begin() - 1;
+  else
+  {
+    i0 = lower - times.begin() - 1;
+    i1 = i0 + 1;
+  }
+
+  dolfin_debug1("Looking for value at time t = %g", t);
+  dolfin_debug4("Neighboring values are t[%d] = %g and t[%d] = %g",
+                i0, times[i0], i1, times[i1]);
+
+  return std::make_pair(i0, i1);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/TimeSeries.h b/dolfin/adaptivity/TimeSeries.h
new file mode 100644
index 0000000..cfd214e
--- /dev/null
+++ b/dolfin/adaptivity/TimeSeries.h
@@ -0,0 +1,206 @@
+// Copyright (C) 2009-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-11-11
+// Last changed: 2012-05-07
+
+#ifndef __TIME_SERIES_H
+#define __TIME_SERIES_H
+
+#include <string>
+#include <vector>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericVector;
+  class Mesh;
+
+  /// This class stores a time series of objects to file(s) in a
+  /// binary format which is efficient for reading and writing.
+  ///
+  /// When objects are retrieved, the object stored at the time
+  /// closest to the given time will be used.
+  ///
+  /// A new time series will check if values have been stored to
+  /// file before (for a series with the same name) and in that
+  /// case reuse those values. If new values are stored, old
+  /// values will be cleared.
+
+  class TimeSeries : public Variable
+  {
+  public:
+
+    /// Create empty time series
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The time series name
+    ///     compressed (bool)
+    ///         Use compressed file format (default false)
+    ///     store_connectivity (bool)
+    ///         Store all computed connectivity (default false)
+    TimeSeries(std::string name, bool compressed=false,
+	       bool store_connectivity=false);
+
+    /// Destructor
+    ~TimeSeries();
+
+    /// Store vector at given time
+    ///
+    /// *Arguments*
+    ///     vector (_GenericVector_)
+    ///         The vector to be stored.
+    ///     t (double)
+    ///         The time.
+    void store(const GenericVector& vector, double t);
+
+    /// Store mesh at given time
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to be stored.
+    ///     t (double)
+    ///         The time.
+    void store(const Mesh& mesh, double t);
+
+    /// Retrieve vector at given time
+    ///
+    /// *Arguments*
+    ///     vector (_GenericVector_)
+    ///         The vector (values to be retrieved).
+    ///     t (double)
+    ///         The time.
+    ///     interpolate (bool)
+    ///         Optional argument: If true (default), interpolate
+    ///         time samples closest to t if t is not present.
+    void retrieve(GenericVector& vector, double t,
+                  bool interpolate=true) const;
+
+    /// Retrieve mesh at given time
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh (values to be retrieved).
+    ///     t (double)
+    ///         The time.
+    void retrieve(Mesh& mesh, double t) const;
+
+    /// Return array of sample times for vectors
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         The times.
+    std::vector<double> vector_times() const;
+
+    /// Return array of sample times for meshes
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         The times.
+    std::vector<double> mesh_times() const;
+
+    /// Clear time series
+    void clear();
+
+    /// Return filename for data
+    ///
+    /// *Arguments*
+    ///     series_name (std::string)
+    ///         The time series name
+    ///     type_name (std::string)
+    ///         The type of data
+    ///     index (std::size_t)
+    ///         The index
+    ///     compressed (bool)
+    ///         True if compressed file format
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         The filename
+    static std::string filename_data(std::string series_name,
+                                     std::string type_name,
+                                     std::size_t index,
+				     bool compressed);
+
+    /// Return filename for times
+    ///
+    /// *Arguments*
+    ///     series_name (std::string)
+    ///         The time series name
+    ///     type_name (std::string)
+    ///         The type of data
+    ///     compressed (bool)
+    ///         True if compressed file format
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         The filename
+    static std::string filename_times(std::string series_name,
+                                      std::string type_name,
+				      bool compressed);
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("time_series");
+      p.add("clear_on_write", true);
+      return p;
+    }
+
+  private:
+
+    // Check if values are strictly increasing
+    static bool monotone(const std::vector<double>& times);
+
+    // Find index closest to given time
+    static std::size_t find_closest_index(double t,
+                                   const std::vector<double>& times,
+                                   std::string series_name,
+                                   std::string type_name);
+
+    // Find index pair closest to given time
+    static std::pair<std::size_t, std::size_t>
+      find_closest_pair(double t, const std::vector<double>& times,
+                        std::string series_name, std::string type_name);
+
+    // Name of series
+    std::string _name;
+
+    // List of times
+    std::vector<double> _vector_times;
+    std::vector<double> _mesh_times;
+
+    // True if series has been cleared
+    bool _cleared;
+
+    // True if storing using gzipped file
+    bool _compressed;
+
+    // True if all connectivity in a mesh should be stored
+    bool _store_connectivity;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/adaptivity/TimeSeriesHDF5.cpp b/dolfin/adaptivity/TimeSeriesHDF5.cpp
new file mode 100644
index 0000000..a9c1d37
--- /dev/null
+++ b/dolfin/adaptivity/TimeSeriesHDF5.cpp
@@ -0,0 +1,406 @@
+// Copyright (C) 2009-2013 Chris Richardson and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+#ifdef HAS_HDF5
+
+#include <algorithm>
+#include <iostream>
+#include <sstream>
+#include <boost/lexical_cast.hpp>
+
+#include <dolfin/log/LogStream.h>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/io/File.h>
+#include <dolfin/io/HDF5File.h>
+#include <dolfin/io/HDF5Interface.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/la/GenericLinearAlgebraFactory.h>
+#include <dolfin/mesh/Mesh.h>
+
+#include "TimeSeriesHDF5.h"
+
+using namespace dolfin;
+
+// Template function for storing objects
+template <typename T>
+void TimeSeriesHDF5::store_object(MPI_Comm comm, const T& object, double t,
+                                  std::vector<double>& times,
+                                  std::string series_name,
+                                  std::string group_name)
+{
+  // Write object
+
+  // Check for pre-existing file to append to
+  std::string mode = "w";
+  if(File::exists(series_name) &&
+     (_vector_times.size() > 0 || _mesh_times.size() > 0))
+    mode = "a";
+
+  // Get file handle for low level operations
+  HDF5File hdf5_file(comm, series_name, mode);
+  const hid_t fid = hdf5_file.hdf5_file_id;
+
+  // Find existing datasets (should be equal to number of times)
+  std::size_t nobjs = 0;
+  if(HDF5Interface::has_group(fid, group_name))
+    nobjs = HDF5Interface::num_datasets_in_group(fid, group_name);
+
+  dolfin_assert(nobjs == times.size());
+
+  // Write new dataset (mesh or vector)
+  std::string dataset_name = group_name + "/"
+    + boost::lexical_cast<std::string>(nobjs);
+  hdf5_file.write(object, dataset_name);
+
+  // Check that time values are strictly increasing
+  const std::size_t n = times.size();
+  if (n >= 2 && (times[n - 1] - times[n - 2])*(t - times[n - 1]) < 0.0)
+  {
+    dolfin_error("TimeSeries.cpp",
+                 "store object to time series",
+                 "Sample points must be strictly monotone (t_0 = %g, t_1 = %g, t_2 = %g)",
+                 times[n - 2], times[n - 1], t);
+  }
+
+  // Add time
+  times.push_back(t);
+
+  // Store time
+  HDF5Interface::add_attribute(fid, dataset_name, "time", t);
+}
+//-----------------------------------------------------------------------------
+TimeSeriesHDF5::TimeSeriesHDF5(MPI_Comm mpi_comm, std::string name)
+  : _name(name + ".h5"), _cleared(false)
+{
+  // Set default parameters
+  parameters = default_parameters();
+
+  if (File::exists(_name))
+  {
+    // Read from file
+    const hid_t hdf5_file_id
+      = HDF5Interface::open_file(mpi_comm, _name, "r", true);
+    if (HDF5Interface::has_group(hdf5_file_id, "/Vector"))
+    {
+      const unsigned int nvecs
+        = HDF5Interface::num_datasets_in_group(hdf5_file_id, "/Vector");
+      _vector_times.clear();
+      for (unsigned int i = 0; i != nvecs; ++i)
+      {
+        const std::string dataset_name
+          = "/Vector/" + boost::lexical_cast<std::string>(i);
+        double t;
+        HDF5Interface::get_attribute(hdf5_file_id, dataset_name, "time", t);
+        _vector_times.push_back(t);
+      }
+
+      log(PROGRESS, "Found %d vector sample(s) in time series.",
+          _vector_times.size());
+      if (!monotone(_vector_times))
+      {
+        dolfin_error("TimeSeriesHDF5.cpp",
+       "read time series from file",
+       "Sample points for vector data are not strictly monotone in series \"%s\"",
+                     name.c_str());
+      }
+    }
+
+    if (HDF5Interface::has_group(hdf5_file_id, "/Mesh"))
+    {
+      const unsigned int nmesh
+        = HDF5Interface::num_datasets_in_group(hdf5_file_id, "/Mesh");
+      _mesh_times.clear();
+      for (unsigned int i = 0; i != nmesh; ++i)
+      {
+        const std::string dataset_name
+          = "/Mesh/" + boost::lexical_cast<std::string>(i);
+        double t;
+        HDF5Interface::get_attribute(hdf5_file_id, dataset_name, "time", t);
+        _mesh_times.push_back(t);
+      }
+
+      log(PROGRESS, "Found %d mesh sample(s) in time series.",
+          _mesh_times.size());
+      if (!monotone(_mesh_times))
+      {
+        dolfin_error("TimeSeries.cpp",
+       "read time series from file",
+       "Sample points for mesh data are not strictly monotone in series \"%s\"",
+                     name.c_str());
+      }
+    }
+
+    HDF5Interface::close_file(hdf5_file_id);
+  }
+  else
+    log(PROGRESS, "No samples found in time series.");
+
+}
+//-----------------------------------------------------------------------------
+TimeSeriesHDF5::~TimeSeriesHDF5()
+{
+  // Do nothing (keep files)
+}
+//-----------------------------------------------------------------------------
+void TimeSeriesHDF5::store(const GenericVector& vector, double t)
+{
+  // Clear earlier history first time we store a value
+  const bool clear_on_write = this->parameters["clear_on_write"];
+  if (!_cleared && clear_on_write)
+    clear();
+
+  // Store object
+  store_object(vector.mpi_comm(), vector, t, _vector_times, _name, "/Vector");
+}
+//-----------------------------------------------------------------------------
+void TimeSeriesHDF5::store(const Mesh& mesh, double t)
+{
+  // Clear earlier history first time we store a value
+  const bool clear_on_write = this->parameters["clear_on_write"];
+  if (!_cleared && clear_on_write)
+    clear();
+
+  // Store object
+  store_object(mesh.mpi_comm(), mesh, t, _mesh_times, _name, "/Mesh");
+
+}
+//-----------------------------------------------------------------------------
+void TimeSeriesHDF5::retrieve(GenericVector& vector, double t,
+                              bool interpolate) const
+{
+  HDF5File hdf5_file(MPI_COMM_WORLD, _name, "r");
+
+  // Interpolate value
+  if (interpolate)
+  {
+    // Find closest pair
+    const std::pair<std::size_t, std::size_t> index_pair
+      = find_closest_pair(t, _vector_times, _name, "vector");
+    const std::size_t i0 = index_pair.first;
+    const std::size_t i1 = index_pair.second;
+
+    // Special case: same index
+    if (i0 == i1)
+    {
+      hdf5_file.read(vector, "/Vector/" + boost::lexical_cast<std::string>(i0), false);
+      log(PROGRESS, "Reading vector value at t = %g.", _vector_times[0]);
+      return;
+    }
+
+    log(PROGRESS, "Interpolating vector value at t = %g in interval [%g, %g].",
+        t, _vector_times[i0], _vector_times[i1]);
+
+    // Read vectors
+    GenericVector& x0(vector);
+    std::shared_ptr<GenericVector> x1 = x0.factory().create_vector();
+    hdf5_file.read(x0, "/Vector/" + boost::lexical_cast<std::string>(i0), false);
+    hdf5_file.read(*x1, "/Vector/" + boost::lexical_cast<std::string>(i1), false);
+
+    // Check that the vectors have the same size
+    if (x0.size() != x1->size())
+    {
+      dolfin_error("TimeSeries.cpp",
+                   "interpolate vector value in time series",
+                   "Vector sizes don't match (%d and %d)",
+                   x0.size(), x1->size());
+    }
+
+    // Compute weights for linear interpolation
+    const double dt = _vector_times[i1] - _vector_times[i0];
+    dolfin_assert(std::abs(dt) > DOLFIN_EPS);
+    const double w0 = (_vector_times[i1] - t) / dt;
+    const double w1 = 1.0 - w0;
+
+    // Interpolate
+    x0 *= w0;
+    x0.axpy(w1, *x1);
+  }
+
+  // Read closest value
+  else
+  {
+    // Find closest index
+    const std::size_t index = find_closest_index(t, _vector_times, _name,
+                                                 "vector");
+
+    log(PROGRESS, "Reading vector at t = %g (close to t = %g).",
+        _vector_times[index], t);
+
+    // Read vector
+    hdf5_file.read(vector, "/Vector/"
+                   + boost::lexical_cast<std::string>(index), false);
+  }
+}
+//-----------------------------------------------------------------------------
+void TimeSeriesHDF5::retrieve(Mesh& mesh, double t) const
+{
+  // Get index closest to given time
+  const std::size_t index = find_closest_index(t, _mesh_times, _name, "mesh");
+
+  log(PROGRESS, "Reading mesh at t = %g (close to t = %g).",
+      _mesh_times[index], t);
+
+  // Read mesh
+  HDF5File hdf5_file(MPI_COMM_WORLD, _name, "r");
+  hdf5_file.read(mesh, "/Mesh/" + boost::lexical_cast<std::string>(index),
+                 false);
+}
+//-----------------------------------------------------------------------------
+std::vector<double> TimeSeriesHDF5::vector_times() const
+{
+  return _vector_times;
+}
+//-----------------------------------------------------------------------------
+std::vector<double> TimeSeriesHDF5::mesh_times() const
+{
+  return _mesh_times;
+}
+//-----------------------------------------------------------------------------
+void TimeSeriesHDF5::clear()
+{
+  _vector_times.clear();
+  _mesh_times.clear();
+  _cleared = true;
+}
+//-----------------------------------------------------------------------------
+std::string TimeSeriesHDF5::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    s << "Vectors:";
+    for (std::size_t i = 0; i < _vector_times.size(); ++i)
+      s << "  " << i << ": " << _vector_times[i];
+    s << std::endl;
+
+    s << "Meshes:";
+    for (std::size_t i = 0; i < _mesh_times.size(); ++i)
+      s << "  " << i << ": " << _mesh_times[i];
+    s << std::endl;
+  }
+  else
+  {
+    s << "<Time series with "
+      << _vector_times.size()
+      << " vector(s) and "
+      << _mesh_times.size()
+      << " mesh(es)>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+bool TimeSeriesHDF5::monotone(const std::vector<double>& times)
+{
+  // If size of time series is 0 or 1 they are always monotone
+  if (times.size() < 2)
+    return true;
+
+  // If size is 2
+  if (times.size() == 2)
+    return times[0] < times[1];
+
+  for (std::size_t i = 0; i < times.size() - 2; i++)
+  {
+    if ((times[i + 2] - times[i + 1])*(times[i + 1] - times[i]) <= 0.0)
+      return false;
+  }
+  return true;
+}
+//-----------------------------------------------------------------------------
+std::size_t TimeSeriesHDF5::find_closest_index(double t,
+                                               const std::vector<double>& times,
+                                               std::string series_name,
+                                               std::string type_name)
+{
+  // Get closest pair
+  const std::pair<std::size_t, std::size_t> index_pair
+    = find_closest_pair(t, times, series_name, type_name);
+  const std::size_t i0 = index_pair.first;
+  const std::size_t i1 = index_pair.second;
+
+  // Check which is closer
+  const std::size_t i = (std::abs(t - times[i0])
+                         < std::abs(t - times[i1]) ? i0 : i1);
+  dolfin_debug2("Using closest value t[%d] = %g", i, times[i]);
+
+  return i;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+TimeSeriesHDF5::find_closest_pair(double t, const std::vector<double>& times,
+                                  std::string series_name,
+                                  std::string type_name)
+{
+  // Must have at least one value stored
+  if (times.empty())
+  {
+    dolfin_error("TimeSeries.cpp",
+                 "to retrieve data from time seris",
+                 "No %s stored in time series",
+                 type_name.c_str());
+  }
+
+  // Special case: just one value stored
+  if (times.size() == 1)
+  {
+    dolfin_debug("Series has just one value, returning index 0.");
+    return std::make_pair(0, 0);
+  }
+
+  // Check whether series is reversed
+  const bool reversed = times[0] > times[1];
+
+  // Find lower bound. Note that lower_bound() returns first item
+  // larger than t or end of vector if no such item exists.
+  std::vector<double>::const_iterator lower;
+  if (reversed)
+  {
+    lower = std::lower_bound(times.begin(), times.end(), t,
+                             std::greater<double>());
+  }
+  else
+  {
+    lower = std::lower_bound(times.begin(), times.end(), t,
+                             std::less<double>());
+  }
+
+  // Set indexlower and upper bound
+  std::size_t i0 = 0;
+  std::size_t i1 = 0;
+  if (lower == times.begin())
+    i0 = i1 = lower - times.begin();
+  else if (lower == times.end())
+    i0 = i1 = lower - times.begin() - 1;
+  else
+  {
+    i0 = lower - times.begin() - 1;
+    i1 = i0 + 1;
+  }
+
+  dolfin_debug1("Looking for value at time t = %g", t);
+  dolfin_debug4("Neighboring values are t[%d] = %g and t[%d] = %g",
+                i0, times[i0], i1, times[i1]);
+
+  return std::make_pair(i0, i1);
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/adaptivity/TimeSeriesHDF5.h b/dolfin/adaptivity/TimeSeriesHDF5.h
new file mode 100644
index 0000000..5ac078a
--- /dev/null
+++ b/dolfin/adaptivity/TimeSeriesHDF5.h
@@ -0,0 +1,165 @@
+// Copyright (C) 2009-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+#ifndef __TIME_SERIES_HDF5_H
+#define __TIME_SERIES_HDF5_H
+
+#ifdef HAS_HDF5
+
+#include <string>
+#include <vector>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericVector;
+  class Mesh;
+
+  /// This class stores a time series of objects to file(s) in a
+  /// binary format which is efficient for reading and writing.
+  ///
+  /// When objects are retrieved, the object stored at the time
+  /// closest to the given time will be used.
+  ///
+  /// A new time series will check if values have been stored to
+  /// file before (for a series with the same name) and in that
+  /// case reuse those values. If new values are stored, old
+  /// values will be cleared.
+
+  class TimeSeriesHDF5 : public Variable
+  {
+  public:
+
+    /// Create empty time series
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The time series name
+    TimeSeriesHDF5(MPI_Comm mpi_comm, std::string name);
+
+    /// Destructor
+    ~TimeSeriesHDF5();
+
+    /// Store vector at given time
+    ///
+    /// *Arguments*
+    ///     vector (_GenericVector_)
+    ///         The vector to be stored.
+    ///     t (double)
+    ///         The time.
+    void store(const GenericVector& vector, double t);
+
+    /// Store mesh at given time
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to be stored.
+    ///     t (double)
+    ///         The time.
+    void store(const Mesh& mesh, double t);
+
+    /// Retrieve vector at given time
+    ///
+    /// *Arguments*
+    ///     vector (_GenericVector_)
+    ///         The vector (values to be retrieved).
+    ///     t (double)
+    ///         The time.
+    ///     interpolate (bool)
+    ///         Optional argument: If true (default), interpolate
+    ///         time samples closest to t if t is not present.
+    void retrieve(GenericVector& vector, double t,
+                  bool interpolate=true) const;
+
+    /// Retrieve mesh at given time
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh (values to be retrieved).
+    ///     t (double)
+    ///         The time.
+    void retrieve(Mesh& mesh, double t) const;
+
+    /// Return array of sample times for vectors
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         The times.
+    std::vector<double> vector_times() const;
+
+    /// Return array of sample times for meshes
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         The times.
+    std::vector<double> mesh_times() const;
+
+    /// Clear time series
+    void clear();
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("time_series");
+      p.add("clear_on_write", true);
+      return p;
+    }
+
+  private:
+
+    template <typename T>
+      void store_object(MPI_Comm comm, const T& object, double t,
+                        std::vector<double>& times,
+                        std::string series_name,
+                        std::string group_name);
+
+    // Check if values are strictly increasing
+    static bool monotone(const std::vector<double>& times);
+
+    // Find index closest to given time
+    static std::size_t find_closest_index(double t,
+                                          const std::vector<double>& times,
+                                          std::string series_name,
+                                          std::string type_name);
+
+    // Find index pair closest to given time
+    static std::pair<std::size_t, std::size_t>
+      find_closest_pair(double t, const std::vector<double>& times,
+                        std::string series_name, std::string type_name);
+
+    // Name of series
+    std::string _name;
+
+    // List of times
+    std::vector<double> _vector_times;
+    std::vector<double> _mesh_times;
+
+    // True if series has been cleared
+    bool _cleared;
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/adaptivity/adapt.cpp b/dolfin/adaptivity/adapt.cpp
new file mode 100644
index 0000000..3ca615d
--- /dev/null
+++ b/dolfin/adaptivity/adapt.cpp
@@ -0,0 +1,630 @@
+// Copyright (C) 2010-2011 Anders Logg, Marie Rognes and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-02-10
+// Last changed: 2012-11-29
+
+#include <map>
+#include <memory>
+
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/fem/LinearVariationalProblem.h>
+#include <dolfin/fem/NonlinearVariationalProblem.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/SubSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/SpecialFacetFunction.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/refinement/LocalMeshRefinement.h>
+#include <dolfin/refinement/UniformMeshRefinement.h>
+#include "ErrorControl.h"
+#include "adapt.h"
+
+using namespace dolfin;
+
+// Common function for setting parent/child
+template <typename T>
+void set_parent_child(const T& parent, std::shared_ptr<T> child)
+{
+  // Use a const_cast so we can set the parent/child
+  T& _parent = const_cast<T&>(parent);
+
+  // Set parent/child
+  _parent.set_child(child);
+  child->set_parent(reference_to_no_delete_pointer(_parent));
+}
+//-----------------------------------------------------------------------------
+const Mesh& dolfin::adapt(const Mesh& mesh)
+{
+  // Skip refinement if already refined
+  if (mesh.has_child())
+  {
+    dolfin_debug("Mesh has already been refined, returning child mesh.");
+    return mesh.child();
+  }
+
+  // Refine uniformly
+  std::shared_ptr<Mesh> adapted_mesh(new Mesh());
+  UniformMeshRefinement::refine(*adapted_mesh, mesh);
+
+  // Initialize the entities initialized in mesh in adapted_mesh
+  for (std::size_t d = 0; d <= mesh.topology().dim(); ++d)
+    if (mesh.num_entities(d) != 0)
+      adapted_mesh->init(d);
+
+  // Set parent / child
+  set_parent_child(mesh, adapted_mesh);
+
+  return *adapted_mesh;
+}
+//-----------------------------------------------------------------------------
+const dolfin::Mesh& dolfin::adapt(const Mesh& mesh,
+                                  const MeshFunction<bool>& cell_markers)
+{
+  // Skip refinement if already refined
+  if (mesh.has_child())
+  {
+    dolfin_debug("Mesh has already been refined, returning child mesh.");
+    return mesh.child();
+  }
+
+  // Call refinement algorithm
+  std::shared_ptr<Mesh> adapted_mesh(new Mesh());
+  LocalMeshRefinement::refine(*adapted_mesh, mesh, cell_markers);
+
+  // Initialize the entities initialized in mesh in adapted_mesh
+  for (std::size_t d = 0; d <= mesh.topology().dim(); ++d)
+    if (mesh.num_entities(d) != 0)
+      adapted_mesh->init(d);
+
+  // Set parent / child
+  set_parent_child(mesh, adapted_mesh);
+
+  return *adapted_mesh;
+}
+//-----------------------------------------------------------------------------
+const dolfin::FunctionSpace& dolfin::adapt(const FunctionSpace& space)
+{
+  dolfin_assert(space.mesh());
+
+  // Refine mesh
+  adapt(*space.mesh());
+
+  // Refine space
+  adapt(space, space.mesh()->child_shared_ptr());
+
+  return space.child();
+}
+//-----------------------------------------------------------------------------
+const dolfin::FunctionSpace& dolfin::adapt(const FunctionSpace& space,
+                                           const MeshFunction<bool>& cell_markers)
+{
+  dolfin_assert(space.mesh());
+
+  // Refine mesh
+  adapt(*space.mesh(), cell_markers);
+
+  // Refine space
+  adapt(space, space.mesh()->child_shared_ptr());
+
+  return space.child();
+}
+//-----------------------------------------------------------------------------
+const dolfin::FunctionSpace& dolfin::adapt(const FunctionSpace& space,
+                                           std::shared_ptr<const Mesh> adapted_mesh)
+{
+
+  // Skip refinement if already refined and child's mesh is the same
+  // as requested
+  if (space.has_child()
+      && adapted_mesh.get() == space.child().mesh().get())
+  {
+    dolfin_debug("Function space has already been refined, returning child space.");
+    return space.child();
+  }
+
+  // Create DOLFIN finite element and dofmap
+  dolfin_assert(space.dofmap());
+  dolfin_assert(space.element());
+  std::shared_ptr<const FiniteElement>
+    refined_element(space.element()->create());
+  std::shared_ptr<const GenericDofMap>
+      refined_dofmap(space.dofmap()->create(*adapted_mesh));
+
+  // Create new function space
+  std::shared_ptr<FunctionSpace>
+    refined_space(new FunctionSpace(adapted_mesh, refined_element, refined_dofmap));
+
+  // Set parent / child
+  set_parent_child(space, refined_space);
+
+  return *refined_space;
+}
+//-----------------------------------------------------------------------------
+const dolfin::Function& dolfin::adapt(const Function& function,
+                                      std::shared_ptr<const Mesh> adapted_mesh,
+                                      bool interpolate)
+{
+  // Skip refinement if already refined and if child's mesh matches
+  // requested mesh
+  if (function.has_child()
+      && adapted_mesh.get() == function.child().function_space()->mesh().get())
+  {
+    dolfin_debug("Function has already been refined, returning child function.");
+    return function.child();
+  }
+
+  // Refine function space
+  std::shared_ptr<const FunctionSpace> space = function.function_space();
+  dolfin_assert(space);
+  adapt(*space, adapted_mesh);
+  std::shared_ptr<const FunctionSpace>
+    refined_space = space->child_shared_ptr();
+  dolfin_assert(refined_space);
+
+  // Create new function on refined space and interpolate
+  std::shared_ptr<Function> refined_function(new Function(refined_space));
+  if (interpolate)
+    refined_function->interpolate(function);
+
+  // Set parent / child
+  set_parent_child(function, refined_function);
+
+  return *refined_function;
+}
+//-----------------------------------------------------------------------------
+const dolfin::GenericFunction& dolfin::adapt(const GenericFunction& function,
+                                             std::shared_ptr<const Mesh> adapted_mesh)
+{
+  // Try casting to a function
+  const Function* f = dynamic_cast<const Function*>(&function);
+  if (f)
+    return adapt(*f, adapted_mesh);
+  else
+    return function;
+}
+//-----------------------------------------------------------------------------
+const dolfin::Form& dolfin::adapt(const Form& form,
+                                  std::shared_ptr<const Mesh> adapted_mesh,
+                                  bool adapt_coefficients)
+{
+  // Skip refinement if already refined
+  if (form.has_child())
+  {
+    dolfin_debug("Form has already been refined, returning child form.");
+    return form.child();
+  }
+
+  // Get data
+  std::vector<std::shared_ptr<const FunctionSpace> >
+    spaces = form.function_spaces();
+  std::vector<std::shared_ptr<const GenericFunction> >
+    coefficients = form.coefficients();
+  std::shared_ptr<const ufc::form> ufc_form = form.ufc_form();
+
+  // Refine function spaces
+  std::vector<std::shared_ptr<const FunctionSpace> > refined_spaces;
+  for (std::size_t i = 0; i < spaces.size(); i++)
+  {
+    const FunctionSpace& space = *spaces[i];
+    adapt(space, adapted_mesh);
+    refined_spaces.push_back(space.child_shared_ptr());
+  }
+
+  // Refine coefficients:
+  std::vector<std::shared_ptr<const GenericFunction> > refined_coefficients;
+  for (std::size_t i = 0; i < coefficients.size(); i++)
+  {
+    // Try casting to Function
+    const Function*
+      function = dynamic_cast<const Function*>(coefficients[i].get());
+
+    if (function)
+    {
+      adapt(*function, adapted_mesh, adapt_coefficients);
+      refined_coefficients.push_back(function->child_shared_ptr());
+    } else
+      refined_coefficients.push_back(coefficients[i]);
+  }
+
+  /// Create new form (constructor used from Python interface)
+  std::shared_ptr<Form> refined_form(new Form(ufc_form,
+                                                refined_spaces,
+                                                refined_coefficients));
+
+  /// Attach mesh
+  refined_form->set_mesh(adapted_mesh);
+
+  // Attached refined sub domains
+  const MeshFunction<std::size_t>* cell_domains = form.cell_domains().get();
+  if (cell_domains)
+  {
+    adapt(*cell_domains, adapted_mesh);
+    refined_form->dx = cell_domains->child_shared_ptr();
+  }
+  const MeshFunction<std::size_t>* exterior_domains = form.exterior_facet_domains().get();
+  if (exterior_domains)
+  {
+    adapt(*exterior_domains, adapted_mesh);
+    refined_form->ds = exterior_domains->child_shared_ptr();
+  }
+  const MeshFunction<std::size_t>* interior_domains = form.interior_facet_domains().get();
+  if (interior_domains)
+  {
+    adapt(*interior_domains, adapted_mesh);
+    refined_form->dS = interior_domains->child_shared_ptr();
+  }
+
+  // Set parent / child
+  set_parent_child(form, refined_form);
+
+  return *refined_form;
+}
+//-----------------------------------------------------------------------------
+const dolfin::LinearVariationalProblem&
+dolfin::adapt(const LinearVariationalProblem& problem,
+              std::shared_ptr<const Mesh> adapted_mesh)
+{
+  // Skip refinement if already refined
+  if (problem.has_child())
+  {
+    dolfin_debug("Linear variational problem has already been refined, returning child problem.");
+    return problem.child();
+  }
+
+  // Get data
+  std::shared_ptr<const Form> a = problem.bilinear_form();
+  std::shared_ptr<const Form> L = problem.linear_form();
+  std::shared_ptr<const Function> u = problem.solution();
+  std::vector<std::shared_ptr<const DirichletBC> > bcs = problem.bcs();
+
+  // Refine forms
+  dolfin_assert(a);
+  dolfin_assert(L);
+  adapt(*a, adapted_mesh);
+  adapt(*L, adapted_mesh);
+
+  // FIXME: Note const-cast here, don't know how to get around it
+
+  // Refine solution variable
+  dolfin_assert(u);
+  adapt(*u, adapted_mesh);
+  std::shared_ptr<Function> refined_u
+    = reference_to_no_delete_pointer(const_cast<Function&>(u->child()));
+
+  // Refine bcs
+  std::shared_ptr<const FunctionSpace> V(problem.trial_space());
+  std::vector<std::shared_ptr<const DirichletBC> > refined_bcs;
+  for (std::size_t i = 0; i < bcs.size(); i++)
+  {
+    if (bcs[i] != 0)
+    {
+      dolfin_assert(V);
+      adapt(*bcs[i], adapted_mesh, *V);
+      refined_bcs.push_back(bcs[i]->child_shared_ptr());
+    }
+    else
+    {
+      dolfin_error("adapt.cpp",
+                   "adapt linear variational problem",
+                   "Only implemented for Dirichlet boundary conditions");
+    }
+  }
+
+  // Create new problem
+  dolfin_assert(a);
+  dolfin_assert(L);
+  dolfin_assert(u);
+  std::shared_ptr<LinearVariationalProblem>
+    refined_problem(new LinearVariationalProblem(a->child_shared_ptr(),
+                                                 L->child_shared_ptr(),
+                                                 refined_u,
+                                                 refined_bcs));
+
+  // Set parent / child
+  set_parent_child(problem, refined_problem);
+
+  return *refined_problem;
+}
+//-----------------------------------------------------------------------------
+const dolfin::NonlinearVariationalProblem&
+dolfin::adapt(const NonlinearVariationalProblem& problem,
+              std::shared_ptr<const Mesh> adapted_mesh)
+{
+  // Skip refinement if already refined
+  if (problem.has_child())
+  {
+    dolfin_debug("Nonlinear variational problem has already been refined, returning child problem.");
+    return problem.child();
+  }
+
+  // Get data
+  std::shared_ptr<const Form> F = problem.residual_form();
+  std::shared_ptr<const Form> J = problem.jacobian_form();
+  std::shared_ptr<const Function> u = problem.solution();
+  std::vector<std::shared_ptr<const DirichletBC> > bcs = problem.bcs();
+
+  // Refine forms
+  dolfin_assert(F);
+  adapt(*F, adapted_mesh);
+  if (J)
+    adapt(*J, adapted_mesh);
+
+  // FIXME: Note const-cast here, don't know how to get around it
+
+  // Refine solution variable
+  dolfin_assert(u);
+  adapt(*u, adapted_mesh);
+  std::shared_ptr<Function> refined_u =
+    reference_to_no_delete_pointer(const_cast<Function&>(u->child()));
+
+  // Refine bcs
+  std::shared_ptr<const FunctionSpace> V(problem.trial_space());
+  std::vector<std::shared_ptr<const DirichletBC> > refined_bcs;
+  for (std::size_t i = 0; i < bcs.size(); i++)
+  {
+    dolfin_assert(bcs[i] != 0);
+    dolfin_assert(V);
+    adapt(*bcs[i], adapted_mesh, *V);
+    refined_bcs.push_back(bcs[i]->child_shared_ptr());
+  }
+
+  // Create new problem
+  dolfin_assert(F);
+  dolfin_assert(u);
+  std::shared_ptr<NonlinearVariationalProblem> refined_problem;
+  if (J)
+  {
+    refined_problem.reset(new NonlinearVariationalProblem(F->child_shared_ptr(),
+                                                          refined_u,
+                                                          refined_bcs,
+                                                          J->child_shared_ptr()));
+  }
+  else
+  {
+    refined_problem.reset(new NonlinearVariationalProblem(F->child_shared_ptr(),
+                                                          refined_u,
+                                                          refined_bcs));
+  }
+
+  // Set parent / child
+  set_parent_child(problem, refined_problem);
+
+  return *refined_problem;
+}
+//-----------------------------------------------------------------------------
+const dolfin::DirichletBC& dolfin::adapt(const DirichletBC& bc,
+                                    std::shared_ptr<const Mesh> adapted_mesh,
+                                    const FunctionSpace& S)
+{
+  dolfin_assert(adapted_mesh);
+
+  // Skip refinement if already refined and child's mesh is the same
+  // as requested
+  if (bc.has_child()
+      && adapted_mesh.get() == bc.child().function_space()->mesh().get())
+  {
+    dolfin_debug("DirichletBC has already been refined, returning child.");
+    return bc.child();
+  }
+
+  std::shared_ptr<const FunctionSpace> W = bc.function_space();
+  dolfin_assert(W);
+
+  // Refine function space
+  const std::vector<std::size_t> component = W->component();
+  std::shared_ptr<const FunctionSpace> V;
+  if (component.empty())
+  {
+    adapt(*W, adapted_mesh);
+    V = W->child_shared_ptr();
+  }
+  else
+  {
+    adapt(S, adapted_mesh);
+    V.reset(new SubSpace(S.child(), component));
+  }
+
+  // Get refined value
+  const GenericFunction& g = adapt(*(bc.value()), adapted_mesh);
+  std::shared_ptr<const GenericFunction> g_ptr(reference_to_no_delete_pointer(g));
+
+  // Extract user_sub_domain
+  std::shared_ptr<const SubDomain> user_sub_domain = bc.user_sub_domain();
+
+  // Create refined boundary condition
+  std::shared_ptr<DirichletBC> refined_bc;
+  if (user_sub_domain)
+  {
+    // Use user defined sub domain if defined
+    refined_bc.reset(new DirichletBC(V, g_ptr, user_sub_domain, bc.method()));
+  }
+  else
+  {
+    // Extract markers
+    const std::vector<std::size_t>& markers = bc.markers();
+
+    // Create refined markers
+    dolfin_assert(W->mesh());
+    std::vector<std::size_t> refined_markers;
+    adapt_markers(refined_markers, *adapted_mesh, markers, *W->mesh());
+
+    refined_bc.reset(new DirichletBC(V, g_ptr, refined_markers, bc.method()));
+  }
+
+  // Set parent / child
+  set_parent_child(bc, refined_bc);
+
+  return *refined_bc;
+}
+//-----------------------------------------------------------------------------
+const dolfin::ErrorControl& dolfin::adapt(const ErrorControl& ec,
+                                    std::shared_ptr<const Mesh> adapted_mesh,
+                                    bool adapt_coefficients)
+{
+  dolfin_assert(adapted_mesh);
+
+  // Skip refinement if already refined
+  if (ec.has_child())
+  {
+    dolfin_debug("ErrorControl has already been refined, returning child problem.");
+    return ec.child();
+  }
+
+  // Refine data
+  adapt(*ec._residual, adapted_mesh, adapt_coefficients);
+  adapt(*ec._L_star, adapted_mesh, adapt_coefficients);
+  adapt(*ec._a_star, adapted_mesh, adapt_coefficients);
+  adapt(*ec._a_R_T, adapted_mesh, adapt_coefficients);
+  adapt(*ec._L_R_T, adapted_mesh, adapt_coefficients);
+  adapt(*ec._a_R_dT, adapted_mesh, adapt_coefficients);
+  adapt(*ec._L_R_dT, adapted_mesh, adapt_coefficients);
+  adapt(*ec._eta_T, adapted_mesh, adapt_coefficients);
+
+  // Create refined error control
+  std::shared_ptr<ErrorControl>
+    refined_ec(new ErrorControl(ec._a_star->child_shared_ptr(),
+                                ec._L_star->child_shared_ptr(),
+                                ec._residual->child_shared_ptr(),
+                                ec._a_R_T->child_shared_ptr(),
+                                ec._L_R_T->child_shared_ptr(),
+                                ec._a_R_dT->child_shared_ptr(),
+                                ec._L_R_dT->child_shared_ptr(),
+                                ec._eta_T->child_shared_ptr(),
+                                ec._is_linear));
+
+  // Set parent / child
+  set_parent_child(ec, refined_ec);
+
+  return *refined_ec;
+}
+//-----------------------------------------------------------------------------
+const dolfin::MeshFunction<std::size_t>&
+  dolfin::adapt(const MeshFunction<std::size_t>& mesh_function,
+                std::shared_ptr<const Mesh> adapted_mesh)
+{
+  // Skip refinement if already refined
+  if (mesh_function.has_child())
+  {
+    dolfin_debug("MeshFunction has already been refined, returning child");
+    return mesh_function.child();
+  }
+
+  dolfin_assert(mesh_function.mesh());
+  const Mesh& mesh = *mesh_function.mesh();
+  const std::size_t dim = mesh.topology().dim();
+
+  // Extract parent map from data of refined mesh
+  const std::vector<std::size_t>* parent = NULL;
+  if (mesh_function.dim() == dim)
+  {
+    if (adapted_mesh->data().exists("parent_cell", dim))
+      parent = &(adapted_mesh->data().array("parent_cell", dim));
+  }
+  else if (mesh_function.dim() == (dim - 1))
+  {
+    if (adapted_mesh->data().exists("parent_facet", dim - 1))
+      parent = &(adapted_mesh->data().array("parent_facet", dim - 1));
+  }
+  else
+    dolfin_not_implemented();
+
+  // Check that parent map exists
+  if (!parent)
+  {
+    dolfin_error("adapt.cpp",
+                 "adapt mesh function",
+                 "Unable to extract information about parent mesh entites");
+  }
+
+  // Use very large value as 'undefined'
+  const std::size_t undefined = std::numeric_limits<std::size_t>::max();
+
+  // Map values of mesh function into refined mesh function
+  std::shared_ptr<MeshFunction<std::size_t> >
+    adapted_mesh_function(new MeshFunction<std::size_t>(*adapted_mesh,
+                                                        mesh_function.dim()));
+  for (std::size_t i = 0; i < adapted_mesh_function->size(); i++)
+  {
+    const std::size_t parent_index = (*parent)[i];
+    if (parent_index < mesh_function.size())
+      (*adapted_mesh_function)[i] = mesh_function[parent_index];
+    else
+      (*adapted_mesh_function)[i] = undefined;
+  }
+
+  // Set parent / child relations
+  set_parent_child(mesh_function, adapted_mesh_function);
+
+  // Return refined mesh function
+  return *adapted_mesh_function;
+}
+//-----------------------------------------------------------------------------
+void dolfin::adapt_markers(std::vector<std::size_t>& refined_markers,
+                           const Mesh& adapted_mesh,
+                           const std::vector<std::size_t>& markers,
+                           const Mesh& mesh)
+{
+  // Topological dimension
+  const std::size_t D = mesh.topology().dim();
+
+  // Check that parent maps exist
+  if (!adapted_mesh.data().exists("parent_facet", D - 1))
+  {
+    dolfin_error("adapt.cpp",
+                 "adapt markers",
+                 "Unable to extract information about parent mesh entites");
+  }
+
+  // Extract parent map from data of refined mesh
+  const std::vector<std::size_t>& parent_facets
+    = adapted_mesh.data().array("parent_facet", D - 1);
+
+  // Create map (parent_cell, parent_local_facet) -> [(child_cell,
+  // child_local_facet), ...] for boundary facets
+
+  std::map<std::size_t, std::vector<std::size_t> > children;
+  for (FacetIterator facet(adapted_mesh); !facet.end(); ++facet)
+  {
+    // Ignore interior facets
+    if (facet->num_entities(D) == 2)
+      continue;
+
+    // Extract index of parent facet
+    const std::size_t parent_facet_index = parent_facets[facet->index()];
+
+    children[parent_facet_index].push_back(facet->index());
+  }
+
+  // Use above map to construct refined markers
+  std::vector<std::size_t> child_facets;
+  std::vector<std::size_t>::const_iterator it;
+  for (it = markers.begin(); it != markers.end(); ++it)
+  {
+    child_facets = children[*it];
+    for (std::size_t k = 0; k < child_facets.size(); k++)
+      refined_markers.push_back(child_facets[k]);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/adapt.h b/dolfin/adaptivity/adapt.h
new file mode 100644
index 0000000..be9a1bd
--- /dev/null
+++ b/dolfin/adaptivity/adapt.h
@@ -0,0 +1,160 @@
+// Copyright (C) 2010-2011 Anders Logg, Marie Rognes and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-02-10
+// Last changed: 2011-10-11
+//
+// This file defines free functions for refinement/adaption of meshes,
+// function spaces, functions etc.
+
+#ifndef __DOLFIN_ADAPT_H
+#define __DOLFIN_ADAPT_H
+
+#include <vector>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class DirichletBC;
+  class ErrorControl;
+  class Form;
+  class Function;
+  class FunctionSpace;
+  class GenericFunction;
+  class LinearVariationalProblem;
+  class Mesh;
+  template <typename T> class MeshFunction;
+  class NonlinearVariationalProblem;
+
+  //--- Refinement of meshes ---
+
+  /// Refine mesh uniformly
+  const Mesh& adapt(const Mesh& mesh);
+
+  /// Refine mesh based on cell markers
+  const Mesh& adapt(const Mesh& mesh, const MeshFunction<bool>& cell_markers);
+
+  //--- Refinement of function spaces ---
+
+  /// Refine function space uniformly
+  const FunctionSpace& adapt(const FunctionSpace& space);
+
+  /// Refine function space based on cell markers
+  const FunctionSpace& adapt(const FunctionSpace& space,
+                             const MeshFunction<bool>& cell_markers);
+
+  /// Refine function space based on refined mesh
+  const FunctionSpace& adapt(const FunctionSpace& space,
+                             std::shared_ptr<const Mesh> adapted_mesh);
+
+  //--- Refinement of functions ---
+
+  /// Adapt Function based on adapted mesh
+  ///
+  /// *Arguments*
+  ///     function  (_Function_)
+  ///         The function that should be adapted
+  ///     adapted_mesh  (_Mesh_)
+  ///         The new mesh
+  ///     interpolate (bool)
+  ///         Optional argument, default is true. If false, the
+  ///         function's function space is adapted, but the values are
+  ///         not interpolated.
+  ///
+  /// *Returns*
+  ///     _Function__
+  ///         The adapted function
+  const Function& adapt(const Function& function,
+                        std::shared_ptr<const Mesh> adapted_mesh,
+                        bool interpolate=true);
+
+  /// Refine GenericFunction based on refined mesh
+  const GenericFunction& adapt(const GenericFunction& function,
+                               std::shared_ptr<const Mesh> adapted_mesh);
+
+  /// Refine mesh function<std::size_t> based on mesh
+  const MeshFunction<std::size_t>& adapt(const MeshFunction<std::size_t>& mesh_function,
+                                  std::shared_ptr<const Mesh> adapted_mesh);
+
+  //--- Refinement of boundary conditions ---
+
+  /// Refine Dirichlet bc based on refined mesh
+  const DirichletBC& adapt(const DirichletBC& bc,
+                           std::shared_ptr<const Mesh> adapted_mesh,
+                           const FunctionSpace& S);
+
+  /// Helper function for refinement of boundary conditions
+  void adapt_markers(std::vector<std::size_t>& refined_markers,
+                     const Mesh& adapted_mesh,
+                     const std::vector<std::size_t>& markers,
+                     const Mesh& mesh);
+
+  //--- Refinement of forms ---
+
+  /// Adapt form based on adapted mesh
+  ///
+  /// *Arguments*
+  ///     form  (_Form_)
+  ///         The form that should be adapted
+  ///     adapted_mesh  (_Mesh_)
+  ///         The new mesh
+  ///     adapt_coefficients (bool)
+  ///         Optional argument, default is true. If false, the form
+  ///         coefficients are not explictly adapted, but pre-adapted
+  ///         coefficients will be transferred.
+  ///
+  /// *Returns*
+  ///     _Form__
+  ///         The adapted form
+  const Form& adapt(const Form& form,
+                    std::shared_ptr<const Mesh> adapted_mesh,
+                    bool adapt_coefficients=true);
+
+  //--- Refinement of variational problems ---
+
+  /// Refine linear variational problem based on mesh
+  const LinearVariationalProblem& adapt(const LinearVariationalProblem& problem,
+                                        std::shared_ptr<const Mesh> adapted_mesh);
+
+  /// Refine nonlinear variational problem based on mesh
+  const NonlinearVariationalProblem& adapt(const NonlinearVariationalProblem& problem,
+                                           std::shared_ptr<const Mesh> adapted_mesh);
+
+  /// Adapt error control object based on adapted mesh
+  ///
+  /// *Arguments*
+  ///     ec  (_ErrorControl_)
+  ///         The error control object to be adapted
+  ///     adapted_mesh  (_Mesh_)
+  ///         The new mesh
+  ///     adapt_coefficients (bool)
+  ///         Optional argument, default is true. If false, any form
+  ///         coefficients are not explictly adapted, but pre-adapted
+  ///         coefficients will be transferred.
+  ///
+  /// *Returns*
+  ///     _ErrorControl__
+  ///         The adapted error control object
+  const ErrorControl& adapt(const ErrorControl& ec,
+                            std::shared_ptr<const Mesh> adapted_mesh,
+                            bool adapt_coefficients=true);
+
+
+}
+
+#endif
diff --git a/dolfin/adaptivity/adaptivesolve.cpp b/dolfin/adaptivity/adaptivesolve.cpp
new file mode 100644
index 0000000..bc8a30b
--- /dev/null
+++ b/dolfin/adaptivity/adaptivesolve.cpp
@@ -0,0 +1,119 @@
+// Copyright (C) 2011 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-30
+// Last changed: 2012-11-12
+
+#include <dolfin/fem/Equation.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/fem/LinearVariationalProblem.h>
+#include <dolfin/fem/NonlinearVariationalProblem.h>
+#include <dolfin/function/Function.h>
+
+#include "AdaptiveLinearVariationalSolver.h"
+#include "AdaptiveNonlinearVariationalSolver.h"
+#include "adaptivesolve.h"
+
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation, Function& u, const double tol,
+                   GoalFunctional& M)
+{
+  // Create empty list of boundary conditions
+  std::vector<const DirichletBC*> bcs;
+
+  // Call common adaptive solve function
+  solve(equation, u, bcs, tol, M);
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation, Function& u,
+                   const DirichletBC& bc, const double tol, GoalFunctional& M)
+{
+  // Create list containing single boundary condition
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bc);
+
+  // Call common adaptive solve function
+  solve(equation, u, bcs, tol, M);
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation, Function& u,
+                   std::vector<const DirichletBC*> bcs,
+                   const double tol, GoalFunctional& M)
+
+{
+  // Solve linear problem
+  if (equation.is_linear())
+  {
+    LinearVariationalProblem problem(*equation.lhs(), *equation.rhs(), u, bcs);
+    AdaptiveLinearVariationalSolver solver(problem, M);
+    solver.solve(tol);
+  }
+  else
+  {
+    // Raise error if the problem is nonlinear (for now)
+    dolfin_error("solve.cpp",
+                 "solve nonlinear variational problem adaptively",
+                 "Nonlinear adaptive solve not implemented without Jacobian");
+  }
+}
+//-----------------------------------------------------------------------------
+
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation, Function& u,  const Form& J,
+                   const double tol, GoalFunctional& M)
+{
+  // Create empty list of boundary conditions
+  std::vector<const DirichletBC*> bcs;
+
+  // Call common adaptive solve function with Jacobian
+  solve(equation, u, bcs, J, tol, M);
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation, Function& u,
+                   const DirichletBC& bc, const Form& J, const double tol,
+                   GoalFunctional& M)
+{
+  // Create list containing single boundary condition
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bc);
+
+  // Call common adaptive solve function with Jacobian
+  solve(equation, u, bcs, J, tol, M);
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation,
+                   Function& u,
+                   std::vector<const DirichletBC*> bcs,
+                   const Form& J,
+                   const double tol,
+                   GoalFunctional& M)
+
+{
+  // Raise error if problem is linear
+  if (equation.is_linear())
+    dolfin_error("solve.cpp",
+                 "solve nonlinear variational problem adaptively",
+                 "Variational problem is linear");
+
+  // Define nonlinear problem
+  NonlinearVariationalProblem problem(*equation.lhs(), u, bcs, J);
+
+  // Solve nonlinear problem adaptively
+  AdaptiveNonlinearVariationalSolver solver(problem, M);
+  solver.solve(tol);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/adaptivesolve.h b/dolfin/adaptivity/adaptivesolve.h
new file mode 100644
index 0000000..c3af5b6
--- /dev/null
+++ b/dolfin/adaptivity/adaptivesolve.h
@@ -0,0 +1,91 @@
+// Copyright (C) 2011 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-30
+// Last changed: 2011-06-30
+
+#ifndef __ADAPTIVE_SOLVE_H
+#define __ADAPTIVE_SOLVE_H
+
+#include <vector>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class DirichletBC;
+  class Equation;
+  class Form;
+  class Function;
+  class GoalFunctional;
+
+  //--- Adaptive solve of linear problems ---
+
+  /// Solve linear variational problem a(u, v) == L(v) without
+  /// essential boundary conditions
+  void solve(const Equation& equation,
+             Function& u,
+             const double tol,
+             GoalFunctional& M);
+
+  /// Solve linear variational problem a(u, v) == L(v) with single
+  /// boundary condition
+  void solve(const Equation& equation,
+             Function& u,
+             const DirichletBC& bc,
+             const double tol,
+             GoalFunctional& M);
+
+  /// Solve linear variational problem a(u, v) == L(v) with list of
+  /// boundary conditions
+  void solve(const Equation& equation,
+             Function& u,
+             std::vector<const DirichletBC*> bcs,
+             const double tol,
+             GoalFunctional& M);
+
+  //--- Adaptive solve of nonlinear problems ---
+
+  /// Solve nonlinear variational problem F(u; v) = 0 without
+  /// essential boundary conditions
+  void solve(const Equation& equation,
+             Function& u,
+             const Form& J,
+             const double tol,
+             GoalFunctional& M);
+
+  /// Solve linear variational problem F(u; v) = 0 with single
+  /// boundary condition
+  void solve(const Equation& equation,
+             Function& u,
+             const DirichletBC& bc,
+             const Form& J,
+             const double tol,
+             GoalFunctional& M);
+
+  /// Solve linear variational problem F(u; v) = 0 with list of
+  /// boundary conditions
+  void solve(const Equation& equation,
+             Function& u,
+             std::vector<const DirichletBC*> bcs,
+             const Form& J,
+             const double tol,
+             GoalFunctional& M);
+
+}
+
+#endif
diff --git a/dolfin/adaptivity/dolfin_adaptivity.h b/dolfin/adaptivity/dolfin_adaptivity.h
new file mode 100644
index 0000000..973abe8
--- /dev/null
+++ b/dolfin/adaptivity/dolfin_adaptivity.h
@@ -0,0 +1,20 @@
+#ifndef __DOLFIN_ADAPTIVITY_H
+#define __DOLFIN_ADAPTIVITY_H
+
+// DOLFIN adaptivity interface
+
+#include <dolfin/adaptivity/GenericAdaptiveVariationalSolver.h>
+#include <dolfin/adaptivity/AdaptiveLinearVariationalSolver.h>
+#include <dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/Extrapolation.h>
+#include <dolfin/adaptivity/LocalAssembler.h>
+#include <dolfin/adaptivity/TimeSeries.h>
+#include <dolfin/adaptivity/TimeSeriesHDF5.h>
+
+#include <dolfin/adaptivity/adapt.h>
+#include <dolfin/adaptivity/marking.h>
+#include <dolfin/adaptivity/adaptivesolve.h>
+
+#endif
diff --git a/dolfin/adaptivity/marking.cpp b/dolfin/adaptivity/marking.cpp
new file mode 100644
index 0000000..de9297b
--- /dev/null
+++ b/dolfin/adaptivity/marking.cpp
@@ -0,0 +1,93 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2010-10-11
+// Last changed: 2011-11-12
+
+#include <dolfin/la/Vector.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include "marking.h"
+
+//-----------------------------------------------------------------------------
+void dolfin::mark(dolfin::MeshFunction<bool>& markers,
+                  const dolfin::MeshFunction<double>& indicators,
+                  const std::string strategy,
+                  const double fraction)
+{
+  if (strategy == "dorfler")
+    dolfin::dorfler_mark(markers, indicators, fraction);
+  else
+  {
+    dolfin::dolfin_error("marking.cpp",
+                         "set refinement markers",
+                         "Unknown marking strategy (\"%s\")",
+                         strategy.c_str());
+  }
+
+  // Count number of marked cells
+  std::size_t num_marked = 0;
+  for(std::size_t i = 0; i < markers.size(); i++)
+  {
+    if (markers[i])
+      num_marked++;
+  }
+
+  // Report the number of marked cells
+  log(PROGRESS,
+      "Marking %d cells out of %d (%.1f%%) for refinement",
+      num_marked, markers.size(), 100.0*num_marked/markers.size());
+}
+//-----------------------------------------------------------------------------
+void dolfin::dorfler_mark(dolfin::MeshFunction<bool>& markers,
+                          const dolfin::MeshFunction<double>& indicators,
+                          const double fraction)
+{
+  // Extract mesh
+  const dolfin::Mesh& mesh = *markers.mesh();
+
+  // Initialize marker mesh function
+  markers.set_all(false);
+
+  // Sort cell indices by indicators and compute sum of error
+  // indicators
+  std::map<double, std::size_t> sorted_cells;
+  std::map<double, std::size_t>::reverse_iterator it;
+  double eta_T_H = 0;
+  for (std::size_t i = 0; i < mesh.num_cells(); i++)
+  {
+    const double value = indicators[i];
+    eta_T_H += value;
+    sorted_cells[value] = i;
+  }
+
+  // Determine stopping criterion for marking
+  const double stop = fraction*eta_T_H;
+
+  // Mark using Dorfler algorithm
+  double eta_A = 0.0;
+  for (it = sorted_cells.rbegin(); it != sorted_cells.rend(); it++) {
+    if (eta_A > stop)
+      return;
+
+    markers[it->second] = true;
+    eta_A += it->first;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/adaptivity/marking.h b/dolfin/adaptivity/marking.h
new file mode 100644
index 0000000..dd1818f
--- /dev/null
+++ b/dolfin/adaptivity/marking.h
@@ -0,0 +1,68 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-10-11
+// Last changed: 2012-09-03
+
+#ifndef __MARKING_H
+#define __MARKING_H
+
+#include <string>
+
+namespace dolfin
+{
+
+  class Vector;
+  template <typename T> class MeshFunction;
+
+  /// Mark cells based on indicators and given marking strategy
+  ///
+  /// *Arguments*
+  ///     markers (_MeshFunction_ <bool>)
+  ///         the cell markers (to be computed)
+  ///
+  ///     indicators (_MeshFunction_ <double>)
+  ///         error indicators (one per cell)
+  ///
+  ///     strategy (std::string)
+  ///         the marking strategy
+  ///
+  ///     fraction (double)
+  ///         the marking fraction
+  void mark(MeshFunction<bool>& markers,
+            const dolfin::MeshFunction<double>& indicators,
+            const std::string strategy,
+            const double fraction);
+
+  /// Mark cells using Dorfler marking
+  ///
+  /// *Arguments*
+  ///     markers (_MeshFunction_ <bool>)
+  ///         the cell markers (to be computed)
+  ///
+  ///     indicators (_MeshFunction_ <double>)
+  ///         error indicators (one per cell)
+  ///
+  ///     fraction (double)
+  ///         the marking fraction
+  void dorfler_mark(MeshFunction<bool>& markers,
+                    const dolfin::MeshFunction<double>& indicators,
+                    const double fraction);
+
+}
+
+#endif
diff --git a/dolfin/ale/ALE.cpp b/dolfin/ale/ALE.cpp
new file mode 100644
index 0000000..1a38c6b
--- /dev/null
+++ b/dolfin/ale/ALE.cpp
@@ -0,0 +1,136 @@
+// Copyright (C) 2008-2011 Solveig Bruvoll and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Jan Blechta 2013
+//
+// First added:  2008-05-02
+// Last changed: 2013-03-06
+
+#include <vector>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/mesh/Vertex.h>
+#include "HarmonicSmoothing.h"
+#include "ALE.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::shared_ptr<MeshDisplacement> ALE::move(Mesh& mesh,
+                                              const BoundaryMesh& new_boundary)
+{
+  return HarmonicSmoothing::move(mesh, new_boundary);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<MeshDisplacement> ALE::move(Mesh& mesh0, const Mesh& mesh1)
+{
+  // FIXME: Maybe this works in parallel but there is no obvious way to
+  //        test it as SubMesh::init does not work in parallel
+  not_working_in_parallel("Move coordinates of mesh0 according "
+                          "to mesh1 with common global vertices");
+
+  // Topological dimension
+  //const std::size_t D = mesh1.topology().dim();
+
+  // Extract boundary meshes
+  BoundaryMesh boundary0(mesh0, "exterior");
+  BoundaryMesh boundary1(mesh1, "exterior");
+
+  // Get vertex mappings
+  dolfin_assert(mesh0.data().exists("parent_vertex_indices", 0));
+  const std::vector<std::size_t>& local_to_global_0
+    = mesh0.data().array("parent_vertex_indices", 0);
+
+  dolfin_assert(mesh1.data().exists("parent_vertex_indices", 0));
+  const std::vector<std::size_t>& local_to_global_1
+    = mesh1.data().array("parent_vertex_indices", 0);
+
+  const MeshFunction<std::size_t>& boundary_to_mesh_0 = boundary0.entity_map(0);
+  const MeshFunction<std::size_t>& boundary_to_mesh_1 = boundary1.entity_map(0);
+
+  // Build global-to-local vertex mapping for mesh
+  std::map<std::size_t, std::size_t> global_to_local_0;
+  for (std::size_t i = 0; i < local_to_global_0.size(); i++)
+    global_to_local_0[local_to_global_0[i]] = i;
+
+  // Build mapping from mesh vertices to boundary vertices
+  std::map<std::size_t, std::size_t> mesh_to_boundary_0;
+  for (std::size_t i = 0; i < boundary_to_mesh_0.size(); i++)
+    mesh_to_boundary_0[boundary_to_mesh_0[i]] = i;
+
+  // Iterate over vertices in boundary1
+  const std::size_t dim = mesh0.geometry().dim();
+  for (VertexIterator v(boundary1); !v.end(); ++v)
+  {
+    // Get global vertex index (steps 1 and 2)
+    const std::size_t global_vertex_index
+      = local_to_global_1[boundary_to_mesh_1[v->index()]];
+
+    // Get local vertex index for mesh0 if possible (step 3)
+    std::map<std::size_t, std::size_t>::const_iterator it;
+    it = global_to_local_0.find(global_vertex_index);
+    if (it == global_to_local_0.end())
+      continue;
+    const std::size_t mesh_index_0 = it->second;
+
+    // Get vertex index on boundary0 (step 4)
+    it = mesh_to_boundary_0.find(mesh_index_0);
+    if (it == mesh_to_boundary_0.end())
+    {
+      dolfin_error("ALE.cpp",
+                   "move mesh using mesh smoothing",
+                   "Non-matching vertex mappings");
+    }
+    const std::size_t boundary_index_0 = it->second;
+
+    // Update vertex coordinate
+    double* x = boundary0.geometry().x(boundary_index_0);
+    for (std::size_t i = 0; i < dim; i++)
+      x[i] = v->x()[i];
+  }
+
+  // Move mesh
+  return HarmonicSmoothing::move(mesh0, boundary0);
+}
+//-----------------------------------------------------------------------------
+void ALE::move(Mesh& mesh, const GenericFunction& displacement)
+{
+  // Check dimensions
+  const std::size_t gdim = mesh.geometry().dim();
+  if (!((displacement.value_rank() == 0 && gdim == 1) ||
+        (displacement.value_rank() == 1
+         && gdim == displacement.value_dimension(0))))
+  {
+    dolfin_error("ALE.cpp",
+                 "move mesh using mesh smoothing",
+                 "Illegal value dimension of displacement function");
+  }
+
+  // Interpolate at vertices
+  const std::size_t N = mesh.num_vertices();
+  std::vector<double> vertex_values;
+  displacement.compute_vertex_values(vertex_values, mesh);
+
+  // Move vertex coordinates
+  std::vector<double>& x = mesh.geometry().x();
+  for (std::size_t d = 0; d < gdim; d++)
+  {
+    for (std::size_t i = 0; i < N; i++)
+      x[i*gdim + d] += vertex_values[d*N + i];
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/ale/ALE.h b/dolfin/ale/ALE.h
new file mode 100644
index 0000000..1e9435e
--- /dev/null
+++ b/dolfin/ale/ALE.h
@@ -0,0 +1,62 @@
+// Copyright (C) 2008-2009 Solveig Bruvoll and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Jan Blechta 2013
+//
+// First added:  2008-05-02
+// Last changed: 2013-03-06
+
+#ifndef __ALE_H
+#define __ALE_H
+
+#include <memory>
+#include "MeshDisplacement.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+  class BoundaryMesh;
+  class GenericFunction;
+
+  /// This class provides functionality useful for implementation of
+  /// ALE (Arbitrary Lagrangian-Eulerian) methods, in particular
+  /// moving the boundary vertices of a mesh and then interpolating
+  /// the new coordinates for the interior vertices accordingly.
+
+  class ALE
+  {
+  public:
+
+    /// Move coordinates of mesh according to new boundary coordinates.
+    /// Returns displacement (encapsulated in Expression subclass MeshDisplacement)
+    static std::shared_ptr<MeshDisplacement> move(Mesh& mesh,
+                                            const BoundaryMesh& new_boundary);
+
+    /// Move coordinates of mesh0 according to mesh1 with common global vertices.
+    /// Returns displacement (encapsulated in Expression subclass MeshDisplacement)
+    static std::shared_ptr<MeshDisplacement> move(Mesh& mesh0,
+                                                    const Mesh& mesh1);
+
+    /// Move coordinates of mesh according to displacement function
+    static void move(Mesh& mesh, const GenericFunction& displacement);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/ale/ALEType.h b/dolfin/ale/ALEType.h
new file mode 100644
index 0000000..1428fc9
--- /dev/null
+++ b/dolfin/ale/ALEType.h
@@ -0,0 +1,32 @@
+// Copyright (C) 2008 Solveig Bruvoll and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-05-02
+// Last changed: 2008-08-11
+
+#ifndef __ALE_TYPE_H
+#define __ALE_TYPE_H
+
+namespace dolfin
+{
+
+  /// List of available methods for ALE mesh movement
+  enum ALEType {lagrange, hermite, harmonic};
+
+}
+
+#endif
diff --git a/dolfin/ale/HarmonicSmoothing.cpp b/dolfin/ale/HarmonicSmoothing.cpp
new file mode 100644
index 0000000..55aacb3
--- /dev/null
+++ b/dolfin/ale/HarmonicSmoothing.cpp
@@ -0,0 +1,187 @@
+// Copyright (C) 2008-2011 Anders Logg, 2013 Jan Blechta
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-08-11
+// Last changed: 2013-12-02
+
+#include <dolfin/common/Array.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/fem/Assembler.h>
+#include <dolfin/fem/fem_utils.h>
+#include <dolfin/la/Matrix.h>
+#include <dolfin/la/solve.h>
+#include <dolfin/la/Vector.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/function/Function.h>
+#include "Poisson1D.h"
+#include "Poisson2D.h"
+#include "Poisson3D.h"
+#include "HarmonicSmoothing.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::shared_ptr<MeshDisplacement> HarmonicSmoothing::move(Mesh& mesh,
+                                            const BoundaryMesh& new_boundary)
+{
+  // Now this works regardless of reorder_dofs_serial value
+  const bool reorder_dofs_serial = parameters["reorder_dofs_serial"];
+  if (!reorder_dofs_serial)
+    warning("The function HarmonicSmoothing::move no longer needs "
+            "parameters[\"reorder_dofs_serial\"] = false");
+
+  const std::size_t D = mesh.topology().dim();
+  const std::size_t d = mesh.geometry().dim();
+
+  // Choose form and function space
+  std::shared_ptr<FunctionSpace> V;
+  std::shared_ptr<Form> form;
+  switch (D)
+  {
+  case 1:
+    V.reset(new Poisson1D::FunctionSpace(mesh));
+    form.reset(new Poisson1D::BilinearForm(V, V));
+    break;
+  case 2:
+    V.reset(new Poisson2D::FunctionSpace(mesh));
+    form.reset(new Poisson2D::BilinearForm(V, V));
+    break;
+  case 3:
+    V.reset(new Poisson3D::FunctionSpace(mesh));
+    form.reset(new Poisson3D::BilinearForm(V, V));
+    break;
+  default:
+    dolfin_error("HarmonicSmoothing.cpp",
+                 "move mesh using harmonic smoothing",
+                 "Illegal mesh dimension (%d)", D);
+  }
+
+  // Assemble matrix
+  Matrix A;
+  Assembler assembler;
+  assembler.assemble(A, *form);
+
+  const std::size_t num_vertices = mesh.num_vertices();
+
+  // Dof range
+  const dolfin::la_index n0 = V->dofmap()->ownership_range().first;
+  const dolfin::la_index n1 = V->dofmap()->ownership_range().second;
+  const dolfin::la_index num_dofs = n1 - n0;
+
+  // Mapping of new_boundary vertex numbers to mesh vertex numbers
+  const MeshFunction<std::size_t>& vertex_map_mesh_func =
+                                     new_boundary.entity_map(0);
+  const std::size_t num_boundary_vertices = vertex_map_mesh_func.size();
+  const std::vector<std::size_t> vertex_map(vertex_map_mesh_func.values(),
+                      vertex_map_mesh_func.values() + num_boundary_vertices);
+
+  // Mapping of mesh vertex numbers to dofs (including ghost dofs)
+  const std::vector<dolfin::la_index> vertex_to_dofs = vertex_to_dof_map(*V);
+
+  // Array of all dofs (including ghosts) with global numbering
+  std::vector<dolfin::la_index> all_global_dofs(num_vertices);
+  for (std::size_t i = 0; i < num_vertices; i++)
+    all_global_dofs[i] = vertex_to_dofs[i] + n0;
+
+  // Create arrays for setting bcs.
+  // Their indexing does not matter - same ordering does.
+  std::size_t num_boundary_dofs = 0;
+  std::vector<dolfin::la_index> boundary_dofs;
+  boundary_dofs.reserve(num_boundary_vertices);
+  std::vector<std::size_t> boundary_vertices;
+  boundary_vertices.reserve(num_boundary_vertices);
+  for (std::size_t vert = 0; vert < num_boundary_vertices; vert++)
+  {
+    const dolfin::la_index dof = vertex_to_dofs[vertex_map[vert]];
+
+    // Skip ghosts
+    if (dof >= 0 && dof < num_dofs)
+    {
+      // Global dof numbers
+      boundary_dofs.push_back(dof + n0);
+
+      // new_boundary vertex indices
+      boundary_vertices.push_back(vert);
+
+      num_boundary_dofs++;
+    }
+  }
+
+  // Modify matrix (insert 1 on diagonal)
+  A.ident(num_boundary_dofs, boundary_dofs.data());
+  A.apply("insert");
+
+  // Arrays for storing dirichlet condition and solution
+  std::vector<double> boundary_values(num_boundary_dofs);
+  std::vector<double> displacement;
+  displacement.reserve(d*num_vertices);
+
+  // Pick amg as preconditioner if available
+  const std::string prec(has_krylov_solver_preconditioner("amg")
+                         ? "amg" : "default");
+
+  // Displacement solution wrapped in Expression subclass MeshDisplacement
+  std::shared_ptr<MeshDisplacement> u(new MeshDisplacement(mesh));
+
+  // RHS vector
+  Vector b(*(*u)[0].vector());
+
+  // Solve system for each dimension
+  for (std::size_t dim = 0; dim < d; dim++)
+  {
+    // Get solution vector
+    std::shared_ptr<GenericVector> x = (*u)[dim].vector();
+
+    if (dim > 0)
+      b.zero();
+
+    // Store bc into RHS and solution so that CG solver can be used
+    for (std::size_t i = 0; i < num_boundary_dofs; i++)
+      boundary_values[i] = new_boundary.geometry().x(boundary_vertices[i], dim)
+                         - mesh.geometry().x(vertex_map[boundary_vertices[i]], dim);
+    b.set(boundary_values.data(), num_boundary_dofs, boundary_dofs.data());
+    b.apply("insert");
+    *x = b;
+
+    // Solve system
+    solve(A, *x, b, "cg", prec);
+
+    // Get displacement
+    std::vector<double> _displacement(num_vertices);
+    x->get_local(_displacement.data(), num_vertices, all_global_dofs.data());
+    displacement.insert(displacement.end(),
+                        _displacement.begin(),
+                        _displacement.end());
+  }
+
+  // Modify mesh coordinates
+  MeshGeometry& geometry = mesh.geometry();
+  std::vector<double> coord(d);
+  for (std::size_t i = 0; i < num_vertices; i++)
+  {
+    for (std::size_t dim = 0; dim < d; dim++)
+      coord[dim] = displacement[dim*num_vertices + i] + geometry.x(i, dim);
+    geometry.set(i, coord);
+  }
+
+  // Return calculated displacement
+  return u;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/ale/HarmonicSmoothing.h b/dolfin/ale/HarmonicSmoothing.h
new file mode 100644
index 0000000..72365da
--- /dev/null
+++ b/dolfin/ale/HarmonicSmoothing.h
@@ -0,0 +1,51 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-08-11
+// Last changed: 2013-03-06
+
+#ifndef __HARMONIC_SMOOTHING_H
+#define __HARMONIC_SMOOTHING_H
+
+#include <memory>
+#include "MeshDisplacement.h"
+
+namespace dolfin
+{
+
+  class BoundaryMesh;
+  class Mesh;
+
+  /// This class implements harmonic mesh smoothing. Poisson's equation
+  /// is solved with zero right-hand side (Laplace's equation) for each
+  /// coordinate direction to compute new coordinates for all vertices,
+  /// given new locations for the coordinates of the boundary.
+
+  class HarmonicSmoothing
+  {
+  public:
+
+    /// Move coordinates of mesh according to new boundary coordinates
+    /// and return the displacement
+    static std::shared_ptr<MeshDisplacement> move(Mesh& mesh, 
+                                        const BoundaryMesh& new_boundary);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/ale/MeshDisplacement.cpp b/dolfin/ale/MeshDisplacement.cpp
new file mode 100644
index 0000000..07e4919
--- /dev/null
+++ b/dolfin/ale/MeshDisplacement.cpp
@@ -0,0 +1,116 @@
+// Copyright (C) 2013 Jan Blechta
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-03-05
+// Last changed: 2013-03-05
+
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/mesh/Mesh.h>
+#include "Poisson1D.h"
+#include "Poisson2D.h"
+#include "Poisson3D.h"
+#include "MeshDisplacement.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshDisplacement::MeshDisplacement(const Mesh& mesh)
+  : Expression(mesh.geometry().dim()), _dim(mesh.geometry().dim())
+{
+  const std::size_t D = mesh.topology().dim();
+
+  // Choose form and function space
+  std::shared_ptr<FunctionSpace> V;
+  switch (D)
+  {
+  case 1:
+    V.reset(new Poisson1D::FunctionSpace(mesh));
+    break;
+  case 2:
+    V.reset(new Poisson2D::FunctionSpace(mesh));
+    break;
+  case 3:
+    V.reset(new Poisson3D::FunctionSpace(mesh));
+    break;
+  default:
+    dolfin_error("MeshDisplacement.cpp",
+                 "create instance if MeshDisplacement",
+                 "Illegal mesh dimension (%d)", D);
+  }
+
+  // Store displacement functions
+  _displacements = std::vector<Function> (_dim, Function(V));
+}
+//-----------------------------------------------------------------------------
+MeshDisplacement::MeshDisplacement(const MeshDisplacement& mesh_displacement)
+  : Expression(mesh_displacement._dim),
+    _dim(mesh_displacement._dim),
+    _displacements(mesh_displacement._displacements)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+MeshDisplacement::~MeshDisplacement()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Function& MeshDisplacement::operator[] (const std::size_t i)
+{
+  dolfin_assert(i < _dim);
+  return _displacements[i];
+}
+//-----------------------------------------------------------------------------
+const Function& MeshDisplacement::operator[] (const std::size_t i) const
+{
+  dolfin_assert(i < _dim);
+  return _displacements[i];
+}
+//-----------------------------------------------------------------------------
+void MeshDisplacement::eval(Array<double>& values, const Array<double>& x,
+                            const ufc::cell& cell) const
+{
+  for (std::size_t i = 0; i < _dim; i++)
+  {
+    Array<double> _values(1, &values[i]);
+    _displacements[i].eval(_values, x, cell);
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshDisplacement::compute_vertex_values(std::vector<double>& vertex_values,
+                                             const Mesh& mesh) const
+{
+  // TODO: implement also computation on current mesh by
+  //       _displacements[i].vector()->get_local(block, num_vertices, all_dofs)
+  //       which would be merely moving code from HarmonicSmoothing.cpp here.
+  //       This would save some computation performed by compute_vertex_values()
+
+  vertex_values.clear();
+
+  std::size_t num_vertices = mesh.num_vertices();
+  vertex_values.reserve(_dim*num_vertices);
+
+  for (std::size_t i = 0; i < _dim; i++)
+  {
+    std::vector<double> _vertex_values;
+    _displacements[i].compute_vertex_values(_vertex_values, mesh);
+    vertex_values.insert(vertex_values.end(),
+                         _vertex_values.begin(),
+                         _vertex_values.end());
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/ale/MeshDisplacement.h b/dolfin/ale/MeshDisplacement.h
new file mode 100644
index 0000000..8055ad9
--- /dev/null
+++ b/dolfin/ale/MeshDisplacement.h
@@ -0,0 +1,109 @@
+// Copyright (C) 2013 Jan Blechta
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-03-05
+// Last changed: 2013-03-05
+
+#ifndef __MESH_DISPLACEMENT_H
+#define __MESH_DISPLACEMENT_H
+
+#include <vector>
+#include <ufc.h>
+#include <dolfin/common/Array.h>
+#include <dolfin/function/Expression.h>
+#include <dolfin/function/Function.h>
+
+namespace dolfin
+{
+  class Mesh;
+
+  /// This class encapsulates the CG1 representation of the
+  /// displacement of a mesh as an Expression. This is particularly
+  /// useful for the displacement returned by mesh smoothers which can
+  /// subsequently be used in evaluating forms. The value rank is 1
+  /// and the value shape is equal to the geometric dimension of the
+  /// mesh.
+
+  class MeshDisplacement : public Expression
+  {
+  public:
+
+    /// Create MeshDisplacement of given mesh
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         Mesh to be displacement defined on.
+    MeshDisplacement(const Mesh& mesh);
+
+    /// Copy constructor
+    ///
+    /// *Arguments*
+    ///     mesh_displacement (_MeshDisplacement_)
+    ///         Object to be copied.
+    MeshDisplacement(const MeshDisplacement& mesh_displacement);
+
+    /// Destructor
+    virtual ~MeshDisplacement();
+
+    /// Extract subfunction
+    /// In python available as MeshDisplacement.sub(i)
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Index of subfunction.
+    Function& operator[] (const std::size_t i);
+
+    /// Extract subfunction. Const version
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Index of subfunction.
+    const Function& operator[] (const std::size_t i) const;
+
+    /// Evaluate at given point in given cell.
+    ///
+    /// *Arguments*
+    ///     values (_Array_ <double>)
+    ///         The values at the point.
+    ///     x (_Array_ <double>)
+    ///         The coordinates of the point.
+    ///     cell (ufc::cell)
+    ///         The cell which contains the given point.
+    virtual void eval(Array<double>& values,
+		      const Array<double>& x,
+                      const ufc::cell& cell) const;
+
+    /// Compute values at all mesh vertices.
+    ///
+    /// *Arguments*
+    ///     vertex_values (_Array_ <double>)
+    ///         The values at all vertices.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    virtual void compute_vertex_values(std::vector<double>& vertex_values,
+                                       const Mesh& mesh) const;
+
+  protected:
+
+    const std::size_t _dim;
+
+    std::vector<Function> _displacements;
+
+  };
+
+}
+#endif
diff --git a/dolfin/ale/Poisson1D.h b/dolfin/ale/Poisson1D.h
new file mode 100644
index 0000000..e175497
--- /dev/null
+++ b/dolfin/ale/Poisson1D.h
@@ -0,0 +1,1407 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON1D_H
+#define __POISSON1D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson1d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson1d_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson1d_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('interval', 1)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::interval;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[1];
+    compute_jacobian_interval_1d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[1];
+    double detJ;
+    compute_jacobian_inverse_interval_1d(K, detJ, J);
+    
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (2.0*x[0] - vertex_coordinates[0] - vertex_coordinates[1]) / J[0];
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, -0.408248290463863};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, 0.408248290463863};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 1;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[1];
+    compute_jacobian_interval_1d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[1];
+    double detJ;
+    compute_jacobian_inverse_interval_1d(K, detJ, J);
+    
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (2.0*x[0] - vertex_coordinates[0] - vertex_coordinates[1]) / J[0];
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[1][1];
+    for (unsigned int row = 0; row < 1; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 0)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[1][1] = {{K[0]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[1][1];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, -0.408248290463863};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[2][2] = \
+      {{0.0, 0.0},
+      {3.46410161513775, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[1];
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 2; t++)
+        {
+          for (unsigned int u = 0; u < 2; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              for (unsigned int tu = 0; tu < 2; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 2; s++)
+        {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[2] = {0.0, 0.0};
+      
+      // Declare helper variables
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = X;
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        basisvalues[r] *= std::sqrt((0.5 + r));
+      } // end loop over 'r'
+      
+      // Table(s) of coefficients
+      static const double coefficients0[2] = \
+      {0.707106781186547, 0.408248290463863};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[2][2] = \
+      {{0.0, 0.0},
+      {3.46410161513775, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[1];
+      for (unsigned int r = 0; r < 1; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[2][2] = \
+      {{1.0, 0.0},
+      {0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 2; t++)
+        {
+          for (unsigned int u = 0; u < 2; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            for (unsigned int u = 0; u < 2; u++)
+            {
+              for (unsigned int tu = 0; tu < 2; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 2; s++)
+        {
+          for (unsigned int t = 0; t < 2; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 1;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[1];
+    for (unsigned int r = 0; r < 1; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[1];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[1];
+    y[0] = vertex_coordinates[0];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson1d_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson1d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson1d_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson1d_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('interval', 1)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 1;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 1;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 0;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 1)
+    {
+    throw std::runtime_error("d is larger than dimension (1)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 1)
+      {
+      throw std::runtime_error("i is larger than number of entities (1)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[1][0] = vertex_coordinates[1];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson1d_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson1d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson1d_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson1d_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    1
+    // Number of operations (multiply-add pairs) for tensor contraction: 0
+    // Total number of operations (multiply-add pairs):                  4
+    
+    // Compute Jacobian
+    double J[1];
+    compute_jacobian_interval_1d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[1];
+    double detJ;
+    compute_jacobian_inverse_interval_1d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*K[0]*K[0];
+    
+    // Compute element tensor
+    A[0] = G0_0_0;
+    A[1] = -G0_0_0;
+    A[2] = -G0_0_0;
+    A[3] = G0_0_0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson1d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson1d_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson1d_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "1a5a1881f4f2c241200b43adbdac1c99b80dbd5ef5a755749f7a9036d32b52e5a1183e66b0be7fd9cb5d8fef78af31b13ba96c391b53fd166cf85b3d0f571f70";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson1d_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson1d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson1d_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson1d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson1d_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson1D
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson1d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson1d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson1d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson1d_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/dolfin/ale/Poisson1D.ufl b/dolfin/ale/Poisson1D.ufl
new file mode 100644
index 0000000..4787e32
--- /dev/null
+++ b/dolfin/ale/Poisson1D.ufl
@@ -0,0 +1,23 @@
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+element = FiniteElement("Lagrange", interval, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+a = inner(grad(v), grad(u))*dx
diff --git a/dolfin/ale/Poisson2D.h b/dolfin/ale/Poisson2D.h
new file mode 100644
index 0000000..0568f10
--- /dev/null
+++ b/dolfin/ale/Poisson2D.h
@@ -0,0 +1,1682 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON2D_H
+#define __POISSON2D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson2d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson2d_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2d_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson2d_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson2d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson2d_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2d_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson2d_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson2d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson2d_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2d_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 11
+    // Total number of operations (multiply-add pairs):                  22
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1;
+    A[4] = 0.5*G0_0_0;
+    A[5] = 0.5*G0_0_1;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1;
+    A[7] = 0.5*G0_1_0;
+    A[8] = 0.5*G0_1_1;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson2d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson2d_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson2d_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "996f902b81205976ede73587192186c9fd9b057164f0036bf925051e4ce236d3afa448345b6b3a7958f9c265483ba7f2701db77c9f0b497566f0fb97007140e6";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson2d_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson2d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson2d_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson2D
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson2d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson2d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson2d_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/dolfin/ale/Poisson2D.ufl b/dolfin/ale/Poisson2D.ufl
new file mode 100644
index 0000000..b3d1862
--- /dev/null
+++ b/dolfin/ale/Poisson2D.ufl
@@ -0,0 +1,23 @@
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+element = FiniteElement("Lagrange", triangle, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+a = inner(grad(v), grad(u))*dx
diff --git a/dolfin/ale/Poisson3D.h b/dolfin/ale/Poisson3D.h
new file mode 100644
index 0000000..4461991
--- /dev/null
+++ b/dolfin/ale/Poisson3D.h
@@ -0,0 +1,2051 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __POISSON3D_H
+#define __POISSON3D_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class poisson3d_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  poisson3d_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson3d_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 4; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[3][1];
+    for (unsigned int row = 0; row < 3; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[3][3];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, -0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.182574185835055, -0.105409255338946, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.210818510677892, -0.074535599249993};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[4] = {0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[1] *= std::sqrt(7.5);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[4] = \
+      {0.288675134594813, 0.0, 0.0, 0.223606797749979};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[4][4] = \
+      {{0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[3];
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[4][4] = \
+      {{1.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 4; t++)
+        {
+          for (unsigned int u = 0; u < 4; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            for (unsigned int u = 0; u < 4; u++)
+            {
+              for (unsigned int tu = 0; tu < 4; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 4; s++)
+        {
+          for (unsigned int t = 0; t < 4; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[3];
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 4; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new poisson3d_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class poisson3d_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  poisson3d_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson3d_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 4;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+    dofs[3] = c.entity_indices[0][3];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new poisson3d_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class poisson3d_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  poisson3d_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson3d_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    27
+    // Number of operations (multiply-add pairs) for tensor contraction: 28
+    // Total number of operations (multiply-add pairs):                  58
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1] + K[2]*K[2]);
+    const double G0_0_1 = det*(K[0]*K[3] + K[1]*K[4] + K[2]*K[5]);
+    const double G0_0_2 = det*(K[0]*K[6] + K[1]*K[7] + K[2]*K[8]);
+    const double G0_1_0 = det*(K[3]*K[0] + K[4]*K[1] + K[5]*K[2]);
+    const double G0_1_1 = det*(K[3]*K[3] + K[4]*K[4] + K[5]*K[5]);
+    const double G0_1_2 = det*(K[3]*K[6] + K[4]*K[7] + K[5]*K[8]);
+    const double G0_2_0 = det*(K[6]*K[0] + K[7]*K[1] + K[8]*K[2]);
+    const double G0_2_1 = det*(K[6]*K[3] + K[7]*K[4] + K[8]*K[5]);
+    const double G0_2_2 = det*(K[6]*K[6] + K[7]*K[7] + K[8]*K[8]);
+    
+    // Compute element tensor
+    A[0] = 0.166666666666667*G0_0_0 + 0.166666666666667*G0_0_1 + 0.166666666666667*G0_0_2 + 0.166666666666667*G0_1_0 + 0.166666666666667*G0_1_1 + 0.166666666666667*G0_1_2 + 0.166666666666667*G0_2_0 + 0.166666666666667*G0_2_1 + 0.166666666666667*G0_2_2;
+    A[1] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_1_0 - 0.166666666666667*G0_2_0;
+    A[2] = -0.166666666666667*G0_0_1 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_2_1;
+    A[3] = -0.166666666666667*G0_0_2 - 0.166666666666667*G0_1_2 - 0.166666666666667*G0_2_2;
+    A[4] = -0.166666666666667*G0_0_0 - 0.166666666666667*G0_0_1 - 0.166666666666667*G0_0_2;
+    A[5] = 0.166666666666667*G0_0_0;
+    A[6] = 0.166666666666667*G0_0_1;
+    A[7] = 0.166666666666667*G0_0_2;
+    A[8] = -0.166666666666667*G0_1_0 - 0.166666666666667*G0_1_1 - 0.166666666666667*G0_1_2;
+    A[9] = 0.166666666666667*G0_1_0;
+    A[10] = 0.166666666666667*G0_1_1;
+    A[11] = 0.166666666666667*G0_1_2;
+    A[12] = -0.166666666666667*G0_2_0 - 0.166666666666667*G0_2_1 - 0.166666666666667*G0_2_2;
+    A[13] = 0.166666666666667*G0_2_0;
+    A[14] = 0.166666666666667*G0_2_1;
+    A[15] = 0.166666666666667*G0_2_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class poisson3d_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  poisson3d_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~poisson3d_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "485ee4abc20119b82968409dcd30845bbd75cf8eb2d37865cd36ae609240e0096d0047eeab6075652c6e4268052caed39792496313b48a8a3cb2824bcd9e32aa";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new poisson3d_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new poisson3d_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new poisson3d_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Poisson3D
+{
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new poisson3d_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new poisson3d_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new poisson3d_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/dolfin/ale/Poisson3D.ufl b/dolfin/ale/Poisson3D.ufl
new file mode 100644
index 0000000..1d36167
--- /dev/null
+++ b/dolfin/ale/Poisson3D.ufl
@@ -0,0 +1,23 @@
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+element = FiniteElement("Lagrange", tetrahedron, 1)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+
+a = inner(grad(v), grad(u))*dx
diff --git a/dolfin/ale/compile.log b/dolfin/ale/compile.log
new file mode 100644
index 0000000..93aa895
--- /dev/null
+++ b/dolfin/ale/compile.log
@@ -0,0 +1,407 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson2D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0109921 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.000578 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00489497 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000160933 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0342638 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000432014 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson2D.h.
+  
+Compiler stage 5 finished in 0.00064683 seconds.
+
+FFC finished in 0.0516958 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson1D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    1
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0107741 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  4 entries computed in 0.000747 seconds
+  Shape of reference tensor: (2, 2, 1, 1)
+  Primary multi index:   rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Secondary multi index: rank = 2 dims = [1, 1] indices = [[0, 0]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [1, 1] indices = [[0, 0]]
+  External multi index:  rank = 1 dims = [1] indices = [[0]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00540686 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.0001719 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0196421 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000355005 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson1D.h.
+  
+Compiler stage 5 finished in 0.000517845 seconds.
+
+FFC finished in 0.037149 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Poisson3D
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 0
+  quadrature_degree: auto --> 0
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0160248 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  144 entries computed in 0.000636 seconds
+  Shape of reference tensor: (4, 4, 3, 3)
+  Primary multi index:   rank = 2 dims = [4, 4] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 0], [3, 1], [3, 2], [3, 3]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  External multi index:  rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.00613403 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000182152 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp4
+  Removing unused variable: tmp3
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0709651 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000633001 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Poisson3D.h.
+  
+Compiler stage 5 finished in 0.000993013 seconds.
+
+FFC finished in 0.0953782 seconds.
diff --git a/dolfin/ale/dolfin_ale.h b/dolfin/ale/dolfin_ale.h
new file mode 100644
index 0000000..99d755d
--- /dev/null
+++ b/dolfin/ale/dolfin_ale.h
@@ -0,0 +1,9 @@
+#ifndef __DOLFIN_ALE_H
+#define __DOLFIN_ALE_H
+
+// DOLFIN ALE interface
+
+#include <dolfin/ale/ALE.h>
+#include <dolfin/ale/MeshDisplacement.h>
+
+#endif
diff --git a/dolfin/common/Array.h b/dolfin/common/Array.h
new file mode 100644
index 0000000..f67677e
--- /dev/null
+++ b/dolfin/common/Array.h
@@ -0,0 +1,122 @@
+// Copyright (C) 2009-2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2010-2011
+// Modified by Joachim B Haga 2012
+//
+// First added:  2009-12-06
+// Last changed: 2012-03-12
+
+#ifndef __DOLFIN_ARRAY_H
+#define __DOLFIN_ARRAY_H
+
+#include <cstddef>
+#include <sstream>
+#include <string>
+
+#include <dolfin/common/constants.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  /// This class provides a simple wrapper for a pointer to an array. A
+  /// purpose of this class is to enable the simple and safe exchange
+  /// of data between C++ and Python.
+
+  template <typename T> class Array
+  {
+
+  public:
+
+    /// Create array of size N. Array has ownership.
+    explicit Array(std::size_t N) : _size(N), _x(new T[N]), _owner(true) {}
+
+    /// Construct array from a pointer. Array does not take ownership.
+    Array(std::size_t N, T* x) : _size(N), _x(x), _owner(false) {}
+
+    /// Destructor
+    ~Array()
+    {
+      if (_owner)
+        delete [] _x;
+    }
+
+    /// Return informal string representation (pretty-print).
+    /// Note that the Array class is not a subclass of Variable (for
+    /// efficiency) which means that one needs to call str() directly
+    /// instead of using the info() function on Array objects.
+    std::string str(bool verbose) const
+    {
+      std::stringstream s;
+
+      if (verbose)
+      {
+        s << str(false) << std::endl << std::endl;
+
+        for (std::size_t i = 0; i < size(); i++)
+          s << i << ": " << (*this)[i] << std::endl;
+      }
+      else
+        s << "<Array<T> of size " << size() << ">";
+
+      return s.str();
+    }
+
+    /// Return size of array
+    std::size_t size() const
+    { return _size; }
+
+    /// Access value of given entry (const version)
+    const T& operator[] (std::size_t i) const
+    { dolfin_assert(i < _size); return _x[i]; }
+
+    /// Access value of given entry (non-const version)
+    T& operator[] (std::size_t i)
+    { dolfin_assert(i < _size); return _x[i]; }
+
+    /// Return pointer to data (const version)
+    const T* data() const
+    { return _x; }
+
+    /// Return pointer to data (non-const version)
+    T* data()
+    { return _x; }
+
+   private:
+
+    /// Disable copy construction, to avoid unanticipated sharing or
+    /// copying of data. This means that an Array must always be passed as
+    /// reference, or as a (possibly shared) pointer.
+    Array(const Array& other) /* leave body undefined */;
+
+  private:
+
+    /// Length of array
+    const std::size_t _size;
+
+    /// Array data
+    T* _x;
+
+    /// True if instance is owner of data
+    bool _owner;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/Hierarchical.h b/dolfin/common/Hierarchical.h
new file mode 100644
index 0000000..c274bd9
--- /dev/null
+++ b/dolfin/common/Hierarchical.h
@@ -0,0 +1,282 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-01-30
+// Last changed: 2013-03-11
+
+#ifndef __HIERARCHICAL_H
+#define __HIERARCHICAL_H
+
+#include <memory>
+
+#include <dolfin/log/dolfin_log.h>
+#include "NoDeleter.h"
+
+namespace dolfin
+{
+
+  /// This class provides storage and data access for hierarchical
+  /// classes; that is, classes where an object may have a child
+  /// and a parent.
+  ///
+  /// Note to developers: each subclass of Hierarchical that
+  /// implements an assignment operator must call the base class
+  /// assignment operator at the *end* of the subclass assignment
+  /// operator. See the Mesh class for an example.
+
+  template <typename T>
+  class Hierarchical
+  {
+  public:
+
+    /// Constructor
+    Hierarchical(T& self) : _self(reference_to_no_delete_pointer(self)) {}
+
+    /// Destructor
+    virtual ~Hierarchical() {}
+
+    /// Return depth of the hierarchy; that is, the total number of
+    /// objects in the hierarchy linked to the current object via
+    /// child-parent relationships, including the object itself.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The depth of the hierarchy.
+    std::size_t depth() const
+    {
+      std::size_t d = 1;
+      for (std::shared_ptr<const T> it = root_node_shared_ptr();
+           it->_child; it = it->_child)
+        d++;
+      return d;
+    }
+
+    /// Check if the object has a parent.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         The return value is true iff the object has a parent.
+    bool has_parent() const
+    { return _parent ? true : false; }
+
+    /// Check if the object has a child.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         The return value is true iff the object has a child.
+    bool has_child() const
+    { return _child ? true : false; }
+
+    /// Return parent in hierarchy. An error is thrown if the object
+    /// has no parent.
+    ///
+    /// *Returns*
+    ///     _Object_
+    ///         The parent object.
+    T& parent()
+    {
+      if (!_parent)
+        dolfin_error("Hierarchical.h",
+                     "extract parent of hierarchical object",
+                     "Object has no parent in hierarchy");
+      return *_parent;
+    }
+
+    /// Return parent in hierarchy (const version).
+    const T& parent() const
+    {
+      if (!_parent)
+        dolfin_error("Hierarchical.h",
+                     "extract parent of hierarchical object",
+                     "Object has no parent in hierarchy");
+      return *_parent;
+    }
+
+    /// Return shared pointer to parent. A zero pointer is returned if
+    /// the object has no parent.
+    ///
+    /// *Returns*
+    ///     shared_ptr<T>
+    ///         The parent object.
+    std::shared_ptr<T> parent_shared_ptr()
+    { return _parent; }
+
+    /// Return shared pointer to parent (const version).
+    std::shared_ptr<const T> parent_shared_ptr() const
+    { return _parent; }
+
+    /// Return child in hierarchy. An error is thrown if the object
+    /// has no child.
+    ///
+    /// *Returns*
+    ///     _T_
+    ///         The child object.
+    T& child()
+    {
+      if (!_child)
+        dolfin_error("Hierarchical.h",
+                     "extract child of hierarchical object",
+                     "Object has no child in hierarchy");
+      return *_child;
+    }
+
+    /// Return child in hierarchy (const version).
+    const T& child() const
+    {
+      if (!_child)
+        dolfin_error("Hierarchical.h",
+                     "extract child of hierarchical object",
+                     "Object has no child in hierarchy");
+      return *_child;
+    }
+
+    /// Return shared pointer to child. A zero pointer is returned if
+    /// the object has no child.
+    ///
+    /// *Returns*
+    ///     shared_ptr<T>
+    ///         The child object.
+    std::shared_ptr<T> child_shared_ptr()
+    { return _child; }
+
+    /// Return shared pointer to child (const version).
+    std::shared_ptr<const T> child_shared_ptr() const
+    { return _child; }
+
+    /// Return root node object in hierarchy.
+    ///
+    /// *Returns*
+    ///     _T_
+    ///         The root node object.
+    T& root_node()
+    {
+      return *root_node_shared_ptr();
+    }
+
+    /// Return root node object in hierarchy (const version).
+    const T& root_node() const
+    {
+      return *root_node_shared_ptr();
+    }
+
+    /// Return shared pointer to root node object in hierarchy.
+    ///
+    /// *Returns*
+    ///     _T_
+    ///         The root node object.
+    std::shared_ptr<T> root_node_shared_ptr()
+    {
+      std::shared_ptr<T> it = _self;
+      for (; it->_parent; it = it->_parent);
+      return it;
+    }
+
+    /// Return shared pointer to root node object in hierarchy (const version).
+    std::shared_ptr<const T> root_node_shared_ptr() const
+    {
+      std::shared_ptr<const T> it = _self;
+      for (; it->_parent; it = it->_parent);
+      return it;
+    }
+
+    /// Return leaf node object in hierarchy.
+    ///
+    /// *Returns*
+    ///     _T_
+    ///         The leaf node object.
+    T& leaf_node()
+    {
+      return *leaf_node_shared_ptr();
+    }
+
+    /// Return leaf node object in hierarchy (const version).
+    const T& leaf_node() const
+    {
+      return *leaf_node_shared_ptr();
+    }
+
+    /// Return shared pointer to leaf node object in hierarchy.
+    ///
+    /// *Returns*
+    ///     _T_
+    ///         The leaf node object.
+    std::shared_ptr<T> leaf_node_shared_ptr()
+    {
+      std::shared_ptr<T> it = _self;
+      for (; it->_child; it = it->_child);
+      return it;
+    }
+
+    /// Return shared pointer to leaf node object in hierarchy (const version).
+    std::shared_ptr<const T> leaf_node_shared_ptr() const
+    {
+      std::shared_ptr<const T> it = _self;
+      for (; it->_child; it = it->_child);
+      return it;
+    }
+
+    /// Set parent
+    void set_parent(std::shared_ptr<T> parent)
+    { _parent = parent; }
+
+    /// Clear child
+    void clear_child()
+    {
+      _child.reset();
+    }
+
+    /// Set child
+    void set_child(std::shared_ptr<T> child)
+    { _child = child; }
+
+    /// Assignment operator
+    const Hierarchical& operator= (const Hierarchical& hierarchical)
+    {
+      // Destroy any previous parent-child relations
+      _parent.reset();
+      _child.reset();
+
+      return *this;
+    }
+
+    /// Function useful for debugging the hierarchy
+    void _debug() const
+    {
+      info("Debugging hierarchical object:");
+      cout << "  depth           = " << depth() << endl;
+      cout << "  has_parent()    = " << has_parent() << endl;
+      info("  _parent.get()   = %x", _parent.get());
+      info("  _parent.count() = %d", _parent.use_count());
+      cout << "  has_child()     = " << has_parent() << endl;
+      info("  _child.get()    = %x", _parent.get());
+      info("  _child.count()  = %d", _parent.use_count());
+    }
+
+  private:
+
+    // The object itself
+    std::shared_ptr<T> _self;
+
+    // Parent and child in hierarchy
+    std::shared_ptr<T> _parent;
+    std::shared_ptr<T> _child;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/IndexSet.h b/dolfin/common/IndexSet.h
new file mode 100644
index 0000000..806c0e2
--- /dev/null
+++ b/dolfin/common/IndexSet.h
@@ -0,0 +1,135 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-02-07
+// Last changed: 2011-08-28
+
+#ifndef __INDEX_SET_H
+#define __INDEX_SET_H
+
+#include <cstddef>
+#include <vector>
+
+namespace dolfin
+{
+
+  /// This class provides an efficient data structure for index sets.
+  /// The cost of checking whether a given index is in the set is O(1)
+  /// and very very fast (optimal) at the cost of extra storage.
+
+  class IndexSet
+  {
+  public:
+
+    /// Create index set of given size
+    IndexSet(std::size_t size) : _size(size), _has_index(size),
+                                 _positions(size)
+    {
+      _indices.reserve(size);
+      clear();
+    }
+
+    /// Destructor
+    ~IndexSet() {}
+
+    /// Return true if set is empty
+    bool empty() const
+    { return _indices.empty(); }
+
+    /// Return size of set
+    std::size_t size() const
+    { return _indices.size(); }
+
+    /// Check whether index is in set
+    bool has_index(std::size_t index) const
+    {
+      dolfin_assert(index < _size);
+      return _has_index[index];
+    }
+
+    /// Return position (if any) for given index
+    std::size_t find(std::size_t index) const
+    {
+      dolfin_assert(index < _size);
+      if (!_has_index[index])
+        dolfin_error("IndexSet.h",
+                     "locate position of index",
+                     "Index %d is not in index set", index);
+      return _positions[index];
+    }
+
+    /// Return given index
+    std::size_t& operator[] (std::size_t i)
+    {
+      dolfin_assert(i < _indices.size());
+      return _indices[i];
+    }
+
+    /// Return given index (const version)
+    const std::size_t& operator[] (std::size_t i) const
+    {
+      dolfin_assert(i < _indices.size());
+      return _indices[i];
+    }
+
+    /// Insert index into set
+    void insert(std::size_t index)
+    {
+      dolfin_assert(index < _size);
+      if (_has_index[index])
+        return;
+      _indices.push_back(index);
+      _has_index[index] = true;
+      _positions[index] = _indices.size() - 1;
+    }
+
+    /// Fill index set with indices 0, 1, 2, ..., size - 1
+    void fill()
+    {
+      _indices.clear();
+      for (std::size_t i = 0; i < _size; i++)
+        _indices.push_back(i);
+      std::fill(_has_index.begin(), _has_index.end(), true);
+    }
+
+    /// Clear set
+    void clear()
+    {
+      _indices.clear();
+      std::fill(_has_index.begin(), _has_index.end(), false);
+      std::fill(_positions.begin(), _positions.end(), 0);
+    }
+
+  private:
+
+    // Size (maximum index + 1)
+    std::size_t _size;
+
+    // Vector of indices
+    std::vector<std::size_t> _indices;
+
+    // Indicators for which indices are in the set
+    std::vector<std::size_t> _has_index;
+
+    // Mapping from indices to positions
+    std::vector<std::size_t> _positions;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/MPI.cpp b/dolfin/common/MPI.cpp
new file mode 100644
index 0000000..7e532a5
--- /dev/null
+++ b/dolfin/common/MPI.cpp
@@ -0,0 +1,197 @@
+// Copyright (C) 2007 Magnus Vikstrøm
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2007-20!2
+// Modified by Anders Logg 2007-2011
+// Modified by Ola Skavhaug 2008-2009
+// Modified by Niclas Jansson 2009
+// Modified by Joachim B Haga 2012
+
+#include <numeric>
+#include <dolfin/log/dolfin_log.h>
+#include "SubSystemsManager.h"
+#include "MPI.h"
+
+#ifdef HAS_MPI
+
+//-----------------------------------------------------------------------------
+dolfin::MPIInfo::MPIInfo()
+{
+  MPI_Info_create(&info);
+}
+//-----------------------------------------------------------------------------
+dolfin::MPIInfo::~MPIInfo()
+{
+  MPI_Info_free(&info);
+}
+//-----------------------------------------------------------------------------
+MPI_Info& dolfin::MPIInfo::operator*()
+{
+  return info;
+}
+//-----------------------------------------------------------------------------
+#endif
+//-----------------------------------------------------------------------------
+//-----------------------------------------------------------------------------
+unsigned int dolfin::MPI::process_number()
+{
+  deprecation("MPI::process_number",
+              "1.4", "1.5",
+              "MPI::process_number() has been replaced by MPI::rank(MPI_Comm).");
+
+#ifdef HAS_MPI
+  SubSystemsManager::init_mpi();
+  int rank;
+  MPI_Comm_rank(MPI_COMM_WORLD, &rank);
+  return rank;
+#else
+  return 0;
+#endif
+}
+//-----------------------------------------------------------------------------
+unsigned int dolfin::MPI::num_processes()
+{
+  deprecation("MPI::num_processes",
+              "1.4", "1.5",
+              "MPI::num_processes() has been replaced by MPI::size(MPI_Comm).");
+
+#ifdef HAS_MPI
+  SubSystemsManager::init_mpi();
+  int size;
+  MPI_Comm_size(MPI_COMM_WORLD, &size);
+  return size;
+#else
+  return 1;
+#endif
+}
+//-----------------------------------------------------------------------------
+unsigned int dolfin::MPI::rank(const MPI_Comm comm)
+{
+#ifdef HAS_MPI
+  SubSystemsManager::init_mpi();
+  int rank;
+  MPI_Comm_rank(comm, &rank);
+  return rank;
+#else
+  return 0;
+#endif
+}
+//-----------------------------------------------------------------------------
+unsigned int dolfin::MPI::size(const MPI_Comm comm)
+{
+#ifdef HAS_MPI
+  SubSystemsManager::init_mpi();
+  int size;
+  MPI_Comm_size(comm, &size);
+  return size;
+#else
+  return 1;
+#endif
+}
+//-----------------------------------------------------------------------------
+bool dolfin::MPI::is_broadcaster(const MPI_Comm comm)
+{
+  // Always broadcast from processor number 0
+  return size(comm) > 1 && rank(comm) == 0;
+}
+//-----------------------------------------------------------------------------
+bool dolfin::MPI::is_receiver(const MPI_Comm comm)
+{
+  // Always receive on processors with numbers > 0
+  return size(comm) > 1 && rank(comm) > 0;
+}
+//-----------------------------------------------------------------------------
+void dolfin::MPI::barrier(const MPI_Comm comm)
+{
+#ifdef HAS_MPI
+  MPI_Barrier(comm);
+#endif
+}
+//-----------------------------------------------------------------------------
+std::size_t dolfin::MPI::global_offset(const MPI_Comm comm,
+                                       std::size_t range, bool exclusive)
+{
+#ifdef HAS_MPI
+  // Compute inclusive or exclusive partial reduction
+  std::size_t offset = 0;
+  MPI_Scan(&range, &offset, 1, mpi_type<std::size_t>(), MPI_SUM, comm);
+  if (exclusive)
+    offset -= range;
+  return offset;
+#else
+  return 0;
+#endif
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+dolfin::MPI::local_range(const MPI_Comm comm, std::size_t N)
+{
+  return local_range(comm, rank(comm), N);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+dolfin::MPI::local_range(const MPI_Comm comm, unsigned int process,
+                         std::size_t N)
+{
+  return compute_local_range(process, N, size(comm));
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+dolfin::MPI::compute_local_range(unsigned int process,
+                                 std::size_t N,
+                                 unsigned int size)
+{
+  // Compute number of items per process and remainder
+  const std::size_t n = N / size;
+  const std::size_t r = N % size;
+
+  // Compute local range
+  std::pair<std::size_t, std::size_t> range;
+  if (process < r)
+  {
+    range.first = process*(n + 1);
+    range.second = range.first + n + 1;
+  }
+  else
+  {
+    range.first = process*n + r;
+    range.second = range.first + n;
+  }
+
+  return range;
+}
+//-----------------------------------------------------------------------------
+unsigned int dolfin::MPI::index_owner(const MPI_Comm comm,
+                                      std::size_t index, std::size_t N)
+{
+  dolfin_assert(index < N);
+
+  // Get number of processes
+  const unsigned int _size = size(comm);
+
+  // Compute number of items per process and remainder
+  const std::size_t n = N / _size;
+  const std::size_t r = N % _size;
+
+  // First r processes own n + 1 indices
+  if (index < r * (n + 1))
+    return index / (n + 1);
+
+  // Remaining processes own n indices
+  return r + (index - r * (n + 1)) / n;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/common/MPI.h b/dolfin/common/MPI.h
new file mode 100644
index 0000000..ca8fca4
--- /dev/null
+++ b/dolfin/common/MPI.h
@@ -0,0 +1,682 @@
+// Copyright (C) 2007-2014 Magnus Vikstrøm and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2008-2009
+// Modified by Anders Logg 2008-2011
+// Modified by Niclas Jansson 2009
+// Modified by Joachim B Haga 2012
+//
+
+#ifndef __MPI_DOLFIN_WRAPPER_H
+#define __MPI_DOLFIN_WRAPPER_H
+
+#include <iostream>
+
+#include <numeric>
+#include <type_traits>
+#include <utility>
+#include <vector>
+
+#ifdef HAS_MPI
+#define MPICH_IGNORE_CXX_SEEK 1
+#include <mpi.h>
+#endif
+
+#include <dolfin/log/dolfin_log.h>
+
+#ifndef HAS_MPI
+typedef int MPI_Comm;
+#define MPI_COMM_WORLD 2
+#define MPI_COMM_SELF 1
+#define MPI_COMM_NULL 0
+#endif
+
+namespace dolfin
+{
+
+  #ifdef HAS_MPI
+  class MPIInfo
+  {
+  public:
+    MPIInfo();
+    ~MPIInfo();
+    MPI_Info& operator*();
+  private:
+
+    MPI_Info info;
+
+  };
+  #endif
+
+  /// This class provides utility functions for easy communication
+  /// with MPI and handles cases when DOLFIN is not configured with
+  /// MPI.
+
+  class MPI
+  {
+  public:
+
+    /// Return process rank (uses MPI_COMM_WORLD)
+    /// Warning: This function is deprecated. Use dolfin::MPI::rank
+    static unsigned int process_number();
+
+    /// Return number of processes for MPI_COMM_WORLD.
+    /// Warning: This function is deprecated. Use dolfin::MPI::size.
+    static unsigned int num_processes();
+
+    /// Return process rank for the communicator
+    static unsigned int rank(const MPI_Comm comm);
+
+    /// Return size of the group (number of processes) associated with
+    /// the communicator
+    static unsigned int size(const MPI_Comm comm);
+
+    /// Determine whether we should broadcast (based on current
+    /// parallel policy)
+    static bool is_broadcaster(const MPI_Comm comm);
+
+    /// Determine whether we should receive (based on current parallel
+    /// policy)
+    static bool is_receiver(const MPI_Comm comm);
+
+    /// Set a barrier (synchronization point)
+    static void barrier(const MPI_Comm comm);
+
+    /// Send in_values[p0] to process p0 and receive values from
+    /// process p1 in out_values[p1]
+    template<typename T>
+      static void all_to_all(const MPI_Comm comm,
+                             std::vector<std::vector<T> >& in_values,
+                             std::vector<std::vector<T> >& out_values);
+
+    /// Broadcast vector of value from broadcaster to all processes
+    template<typename T>
+      static void broadcast(const MPI_Comm comm, std::vector<T>& value,
+                            unsigned int broadcaster=0);
+
+    /// Broadcast single primitive from broadcaster to all processes
+    template<typename T>
+      static void broadcast(const MPI_Comm comm, T& value,
+                            unsigned int broadcaster=0);
+
+    /// Scatter vector in_values[i] to process i
+    template<typename T>
+      static void scatter(const MPI_Comm comm,
+                          const std::vector<std::vector<T> >& in_values,
+                          std::vector<T>& out_value,
+                          unsigned int sending_process=0);
+
+    /// Scatter primitive in_values[i] to process i
+    template<typename T>
+      static void scatter(const MPI_Comm comm,
+                          const std::vector<T>& in_values,
+                          T& out_value, unsigned int sending_process=0);
+
+    /// Gather values on one process
+    template<typename T>
+      static void gather(const MPI_Comm comm, const std::vector<T>& in_values,
+                         std::vector<T>& out_values,
+                         unsigned int receiving_process=0);
+
+    /// Gather strings on one process
+    static void gather(const MPI_Comm comm, const std::string& in_values,
+                       std::vector<std::string>& out_values,
+                       unsigned int receiving_process=0);
+
+    /// Gather values from all proceses. Same data count from each
+    /// process (wrapper for MPI_Allgather)
+    template<typename T>
+      static void all_gather(const MPI_Comm comm,
+                             const std::vector<T>& in_values,
+                             std::vector<T>& out_values);
+
+    /// Gather values from each process (variable count per process)
+    template<typename T>
+      static void all_gather(const MPI_Comm comm,
+                             const std::vector<T>& in_values,
+                             std::vector<std::vector<T> >& out_values);
+
+    /// Gather values, one primitive from each process (MPI_Allgather)
+    template<typename T>
+      static void all_gather(const MPI_Comm comm, const T& in_value,
+                             std::vector<T>& out_values);
+
+    /// Return global max value
+    template<typename T> static T max(const MPI_Comm comm, const T& value);
+
+    /// Return global min value
+    template<typename T> static T min(const MPI_Comm comm, const T& value);
+
+    /// Sum values and return sum
+    template<typename T> static T sum(const MPI_Comm comm, const T& value);
+
+    /// All reduce
+    template<typename T, typename X> static
+      T all_reduce(const MPI_Comm comm, const T& value, X op);
+
+    /// Find global offset (index) (wrapper for MPI_(Ex)Scan with
+    /// MPI_SUM as reduction op)
+    static std::size_t global_offset(const MPI_Comm comm,
+                                     std::size_t range, bool exclusive);
+
+    /// Send-receive data between processes (blocking)
+    template<typename T>
+      static void send_recv(const MPI_Comm comm,
+                            const std::vector<T>& send_value,
+                            unsigned int dest, int send_tag,
+                            std::vector<T>& recv_value,
+                            unsigned int source, int recv_tag);
+
+    /// Send-receive data between processes
+    template<typename T>
+      static void send_recv(const MPI_Comm comm,
+                            const std::vector<T>& send_value, unsigned int dest,
+                            std::vector<T>& recv_value, unsigned int source);
+
+    /// Return local range for local process, splitting [0, N - 1] into
+    /// size() portions of almost equal size
+    static std::pair<std::size_t, std::size_t>
+      local_range(const MPI_Comm comm, std::size_t N);
+
+    /// Return local range for given process, splitting [0, N - 1] into
+    /// size() portions of almost equal size
+    static std::pair<std::size_t, std::size_t>
+      local_range(const MPI_Comm comm, unsigned int process,
+                  std::size_t N);
+
+    /// Return local range for given process, splitting [0, N - 1] into
+    /// size() portions of almost equal size
+    static std::pair<std::size_t, std::size_t>
+      compute_local_range(unsigned int process, std::size_t N,
+                          unsigned int size);
+
+    /// Return which process owns index (inverse of local_range)
+    static unsigned int index_owner(const MPI_Comm comm,
+                                    std::size_t index, std::size_t N);
+
+  private:
+
+    #ifndef HAS_MPI
+    static void error_no_mpi(const char *where)
+    {
+      dolfin_error("MPI.h",
+                   where,
+                   "DOLFIN has been configured without MPI support");
+    }
+    #endif
+
+    #ifdef HAS_MPI
+    // Return MPI data type
+    template<typename T>
+      struct dependent_false : std::false_type {};
+    template<typename T> static MPI_Datatype mpi_type()
+    {
+      static_assert(dependent_false<T>::value, "Unknown MPI type");
+      dolfin_error("MPI.h",
+                   "perform MPI operation",
+                   "MPI data type unknown");
+      return MPI_CHAR;
+    }
+    #endif
+
+  };
+
+  #ifdef HAS_MPI
+  // Specialisations for MPI_Datatypes
+  template<> inline MPI_Datatype MPI::mpi_type<float>() { return MPI_FLOAT; }
+  template<> inline MPI_Datatype MPI::mpi_type<double>() { return MPI_DOUBLE; }
+  template<> inline MPI_Datatype MPI::mpi_type<short int>()
+  { return MPI_SHORT; }
+  template<> inline MPI_Datatype MPI::mpi_type<int>() { return MPI_INT; }
+  template<> inline MPI_Datatype MPI::mpi_type<long int>() { return MPI_LONG; }
+  template<> inline MPI_Datatype MPI::mpi_type<unsigned int>()
+  { return MPI_UNSIGNED; }
+  template<> inline MPI_Datatype MPI::mpi_type<unsigned long int>()
+  { return MPI_UNSIGNED_LONG; }
+  template<> inline MPI_Datatype MPI::mpi_type<long long>()
+  { return MPI_LONG_LONG; }
+  #endif
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::broadcast(const MPI_Comm comm, std::vector<T>& value,
+                                unsigned int broadcaster)
+  {
+    #ifdef HAS_MPI
+    // Broadcast cast size
+    std::size_t bsize = value.size();
+    MPI_Bcast(&bsize, 1, mpi_type<std::size_t>(), broadcaster, comm);
+
+    // Broadcast
+    value.resize(bsize);
+    MPI_Bcast(const_cast<T*>(value.data()), bsize, mpi_type<T>(),
+              broadcaster, comm);
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::broadcast(const MPI_Comm comm, T& value,
+                                unsigned int broadcaster)
+  {
+    #ifdef HAS_MPI
+    MPI_Bcast(&value, 1, mpi_type<T>(), broadcaster, comm);
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::all_to_all(const MPI_Comm comm,
+                                 std::vector<std::vector<T> >& in_values,
+                                 std::vector<std::vector<T> >& out_values)
+  {
+    #ifdef HAS_MPI
+    const std::size_t comm_size = MPI::size(comm);
+
+    // Data size per destination
+    dolfin_assert(in_values.size() == comm_size);
+    std::vector<int> data_size_send(comm_size);
+    std::vector<int> data_offset_send(comm_size + 1, 0);
+    for (std::size_t p = 0; p < comm_size; ++p)
+    {
+      data_size_send[p] = in_values[p].size();
+      data_offset_send[p + 1] = data_offset_send[p] + data_size_send[p];
+    }
+
+    // Get received data sizes
+    std::vector<int> data_size_recv(comm_size);
+    MPI_Alltoall(data_size_send.data(), 1, mpi_type<int>(),
+                 data_size_recv.data(), 1, mpi_type<int>(),
+                 comm);
+
+    // Pack data and build receive offset
+    std::vector<int> data_offset_recv(comm_size + 1 ,0);
+    std::vector<T> data_send(data_offset_send[comm_size]);
+    for (std::size_t p = 0; p < comm_size; ++p)
+    {
+      data_offset_recv[p + 1] = data_offset_recv[p] + data_size_recv[p];
+      std::copy(in_values[p].begin(), in_values[p].end(),
+                data_send.begin() + data_offset_send[p]);
+    }
+
+    // Send/receive data
+    std::vector<T> data_recv(data_offset_recv[comm_size]);
+    MPI_Alltoallv(data_send.data(), data_size_send.data(),
+                  data_offset_send.data(), mpi_type<T>(),
+                  data_recv.data(), data_size_recv.data(),
+                  data_offset_recv.data(), mpi_type<T>(), comm);
+
+      // Repack data
+    out_values.resize(comm_size);
+    for (std::size_t p = 0; p < comm_size; ++p)
+    {
+      out_values[p].resize(data_size_recv[p]);
+      std::copy(data_recv.begin() + data_offset_recv[p],
+                data_recv.begin() + data_offset_recv[p + 1],
+                out_values[p].begin());
+    }
+    #else
+    dolfin_assert(in_values.size() == 1);
+    out_values = in_values;
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<> inline
+    void dolfin::MPI::all_to_all(const MPI_Comm comm,
+                                 std::vector<std::vector<bool> >& in_values,
+                                 std::vector<std::vector<bool> >& out_values)
+  {
+    #ifdef HAS_MPI
+    // Copy to short int
+    std::vector<std::vector<short int> > send(in_values.size());
+    for (std::size_t i = 0; i < in_values.size(); ++i)
+      send[i].assign(in_values[i].begin(), in_values[i].end());
+
+    // Communicate data
+    std::vector<std::vector<short int> > recv;
+    all_to_all(comm, send, recv);
+
+    // Copy back to bool
+    out_values.resize(recv.size());
+    for (std::size_t i = 0; i < recv.size(); ++i)
+      out_values[i].assign(recv[i].begin(), recv[i].end());
+    #else
+    dolfin_assert(in_values.size() == 1);
+    out_values = in_values;
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::scatter(const MPI_Comm comm,
+                              const std::vector<std::vector<T> >& in_values,
+                              std::vector<T>& out_value,
+                              unsigned int sending_process)
+  {
+    #ifdef HAS_MPI
+
+    // Scatter number of values to each process
+    const std::size_t comm_size = MPI::size(comm);
+    std::vector<int> all_num_values;
+    if (MPI::rank(comm) == sending_process)
+    {
+      dolfin_assert(in_values.size() == comm_size);
+      all_num_values.resize(comm_size);
+      for (std::size_t i = 0; i < comm_size; ++i)
+        all_num_values[i] = in_values[i].size();
+    }
+    int my_num_values = 0;
+    scatter(comm, all_num_values, my_num_values, sending_process);
+
+    // Prepare send buffer and offsets
+    std::vector<T> sendbuf;
+    std::vector<int> offsets;
+    if (MPI::rank(comm) == sending_process)
+    {
+      // Build offsets
+      offsets.resize(comm_size + 1, 0);
+      for (std::size_t i = 1; i <= comm_size; ++i)
+        offsets[i] = offsets[i - 1] + all_num_values[i - 1];
+
+      // Allocate send buffer and fill
+      const std::size_t n = std::accumulate(all_num_values.begin(),
+                                            all_num_values.end(), 0);
+      sendbuf.resize(n);
+      for (std::size_t p = 0; p < in_values.size(); ++p)
+      {
+        std::copy(in_values[p].begin(), in_values[p].end(),
+                  sendbuf.begin() + offsets[p]);
+        }
+    }
+
+    // Scatter
+    out_value.resize(my_num_values);
+    MPI_Scatterv(const_cast<T*>(sendbuf.data()), all_num_values.data(),
+                 offsets.data(), mpi_type<T>(),
+                 out_value.data(), my_num_values,
+                 mpi_type<T>(), sending_process, comm);
+    #else
+    dolfin_assert(sending_process == 0);
+    dolfin_assert(in_values.size() == 1);
+    out_value = in_values[0];
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<> inline
+    void dolfin::MPI::scatter(const MPI_Comm comm,
+                              const std::vector<std::vector<bool> >& in_values,
+                              std::vector<bool>& out_value,
+                              unsigned int sending_process)
+  {
+    #ifdef HAS_MPI
+    // Copy data
+    std::vector<std::vector<short int> > in(in_values.size());
+    for (std::size_t i = 0; i < in_values.size(); ++i)
+      in[i] = std::vector<short int>(in_values[i].begin(), in_values[i].end());
+
+    std::vector<short int> out;
+    scatter(comm, in, out, sending_process);
+
+    out_value.resize(out.size());
+    std::copy(out.begin(), out.end(), out_value.begin());
+    #else
+    dolfin_assert(sending_process == 0);
+    dolfin_assert(in_values.size() == 1);
+    out_value = in_values[0];
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::scatter(const MPI_Comm comm,
+                              const std::vector<T>& in_values,
+                              T& out_value, unsigned int sending_process)
+  {
+    #ifdef HAS_MPI
+    if (MPI::rank(comm) == sending_process)
+      dolfin_assert(in_values.size() == MPI::size(comm));
+
+    MPI_Scatter(const_cast<T*>(in_values.data()), 1, mpi_type<T>(),
+                 &out_value, 1, mpi_type<T>(), sending_process, comm);
+    #else
+    dolfin_assert(sending_process == 0);
+    dolfin_assert(in_values.size() == 1);
+    out_value = in_values[0];
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void dolfin::MPI::gather(const MPI_Comm comm,
+                           const std::vector<T>& in_values,
+                           std::vector<T>& out_values,
+                           unsigned int receiving_process)
+  {
+    #ifdef HAS_MPI
+    const std::size_t comm_size = MPI::size(comm);
+
+    // Get data size on each process
+    std::vector<int> pcounts(comm_size);
+    const int local_size = in_values.size();
+    MPI_Gather(const_cast<int*>(&local_size), 1, mpi_type<int>(),
+               pcounts.data(), 1, mpi_type<int>(),
+               receiving_process, comm);
+
+    // Build offsets
+    std::vector<int> offsets(comm_size + 1, 0);
+    for (std::size_t i = 1; i <= comm_size; ++i)
+      offsets[i] = offsets[i - 1] + pcounts[i - 1];
+
+    const std::size_t n = std::accumulate(pcounts.begin(), pcounts.end(), 0);
+    out_values.resize(n);
+    MPI_Gatherv(const_cast<T*>(in_values.data()), in_values.size(),
+                mpi_type<T>(),
+                out_values.data(), pcounts.data(), offsets.data(),
+                mpi_type<T>(), receiving_process, comm);
+    #else
+    out_values = in_values;
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  inline void dolfin::MPI::gather(const MPI_Comm comm,
+                                  const std::string& in_values,
+                                  std::vector<std::string>& out_values,
+                                  unsigned int receiving_process)
+  {
+    #ifdef HAS_MPI
+    const std::size_t comm_size = MPI::size(comm);
+
+    // Get data size on each process
+    std::vector<int> pcounts(comm_size);
+    int local_size = in_values.size();
+    MPI_Gather(&local_size, 1, MPI_INT,
+               pcounts.data(), 1,MPI_INT,
+               receiving_process, comm);
+
+    // Build offsets
+    std::vector<int> offsets(comm_size + 1, 0);
+    for (std::size_t i = 1; i <= comm_size; ++i)
+      offsets[i] = offsets[i - 1] + pcounts[i - 1];
+
+    // Gather
+    const std::size_t n = std::accumulate(pcounts.begin(), pcounts.end(), 0);
+    std::vector<char> _out(n);
+    MPI_Gatherv(const_cast<char*>(in_values.data()), in_values.size(),
+                MPI_CHAR,
+                _out.data(), pcounts.data(), offsets.data(),
+                MPI_CHAR, receiving_process, comm);
+
+    // Rebuild
+    out_values.resize(comm_size);
+    for (std::size_t p = 0; p < comm_size; ++p)
+    {
+      out_values[p] = std::string(_out.begin() + offsets[p],
+                                  _out.begin() + offsets[p + 1]);
+    }
+    #else
+    out_values.clear();
+    out_values.push_back(in_values);
+    #endif
+  }
+  //-------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::all_gather(const MPI_Comm comm,
+                                 const std::vector<T>& in_values,
+                                 std::vector<T>& out_values)
+  {
+    #ifdef HAS_MPI
+    out_values.resize(in_values.size()*MPI::size(comm));
+    MPI_Allgather(const_cast<T*>(in_values.data()), in_values.size(),
+                  mpi_type<T>(),
+                  out_values.data(), in_values.size(), mpi_type<T>(),
+                  comm);
+    #else
+    out_values = in_values;
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::all_gather(const MPI_Comm comm,
+                                 const std::vector<T>& in_values,
+                                 std::vector<std::vector<T> >& out_values)
+  {
+    #ifdef HAS_MPI
+    const std::size_t comm_size = MPI::size(comm);
+
+    // Get data size on each process
+    std::vector<int> pcounts;
+    const int local_size = in_values.size();
+    MPI::all_gather(comm, local_size, pcounts);
+    dolfin_assert(pcounts.size() == comm_size);
+
+    // Build offsets
+    std::vector<int> offsets(comm_size + 1, 0);
+    for (std::size_t i = 1; i <= comm_size; ++i)
+      offsets[i] = offsets[i - 1] + pcounts[i - 1];
+
+      // Gather data
+    const std::size_t n = std::accumulate(pcounts.begin(), pcounts.end(), 0);
+    std::vector<T> recvbuf(n);
+    MPI_Allgatherv(const_cast<T*>(in_values.data()), in_values.size(),
+                   mpi_type<T>(),
+                   recvbuf.data(), pcounts.data(), offsets.data(),
+                   mpi_type<T>(), comm);
+
+    // Repack data
+    out_values.resize(comm_size);
+    for (std::size_t p = 0; p < comm_size; ++p)
+    {
+      out_values[p].resize(pcounts[p]);
+      for (int i = 0; i < pcounts[p]; ++i)
+        out_values[p][i] = recvbuf[offsets[p] + i];
+    }
+    #else
+    out_values.clear();
+    out_values.push_back(in_values);
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::all_gather(const MPI_Comm comm, const T& in_value,
+                                 std::vector<T>& out_values)
+  {
+    #ifdef HAS_MPI
+    out_values.resize(MPI::size(comm));
+    MPI_Allgather(const_cast<T*>(&in_value), 1, mpi_type<T>(),
+                  out_values.data(), 1, mpi_type<T>(), comm);
+    #else
+    out_values.clear();
+    out_values.push_back(in_value);
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T, typename X>
+    T dolfin::MPI::all_reduce(const MPI_Comm comm, const T& value, X op)
+  {
+    #ifdef HAS_MPI
+    T out;
+    MPI_Allreduce(const_cast<T*>(&value), &out, 1, mpi_type<T>(), op, comm);
+    return out;
+    #else
+    dolfin_error("MPI.h",
+      "call MPI::all_reduce",
+      "DOLFIN has been configured without MPI support");
+    return T(0);
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T> T dolfin::MPI::max(const MPI_Comm comm, const T& value)
+  {
+    #ifdef HAS_MPI
+    return all_reduce(comm, value, MPI_MAX);
+    #else
+    return value;
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T> T dolfin::MPI::min(const MPI_Comm comm, const T& value)
+  {
+    #ifdef HAS_MPI
+    return all_reduce(comm, value, MPI_MIN);
+    #else
+    return value;
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T> T dolfin::MPI::sum(const MPI_Comm comm, const T& value)
+  {
+    #ifdef HAS_MPI
+    return all_reduce(comm, value, MPI_SUM);
+    #else
+    return value;
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::send_recv(const MPI_Comm comm,
+                                const std::vector<T>& send_value,
+                                unsigned int dest, int send_tag,
+                                std::vector<T>& recv_value,
+                                unsigned int source, int recv_tag)
+  {
+    #ifdef HAS_MPI
+    std::size_t send_size = send_value.size();
+    std::size_t recv_size = 0;
+    MPI_Status mpi_status;
+    MPI_Sendrecv(&send_size, 1, mpi_type<std::size_t>(), dest, send_tag,
+                 &recv_size, 1, mpi_type<std::size_t>(), source, recv_tag,
+                 comm, &mpi_status);
+
+    recv_value.resize(recv_size);
+    MPI_Sendrecv(const_cast<T*>(send_value.data()), send_value.size(),
+                 mpi_type<T>(), dest, send_tag,
+                 recv_value.data(), recv_size, mpi_type<T>(),
+                 source, recv_tag, comm, &mpi_status);
+    #else
+      dolfin_error("MPI.h",
+      "call MPI::send_recv",
+      "DOLFIN has been configured without MPI support");
+    #endif
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void dolfin::MPI::send_recv(const MPI_Comm comm,
+                                const std::vector<T>& send_value,
+                                unsigned int dest,
+                                std::vector<T>& recv_value,
+                                unsigned int source)
+  {
+    MPI::send_recv(comm, send_value, dest, 0, recv_value, source, 0);
+  }
+  //---------------------------------------------------------------------------
+}
+
+#endif
diff --git a/dolfin/common/NoDeleter.h b/dolfin/common/NoDeleter.h
new file mode 100644
index 0000000..dc014c5
--- /dev/null
+++ b/dolfin/common/NoDeleter.h
@@ -0,0 +1,49 @@
+// Copyright (C) 2008 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Martin Alnes, 2008.
+//
+// First added:  2008-09-11
+// Last changed: 2011-01-28
+
+#ifndef __NO_DELETER_H
+#define __NO_DELETER_H
+
+#include <memory>
+
+namespace dolfin
+{
+
+  /// NoDeleter is a customised deleter intended for use with smart pointers.
+
+  class NoDeleter
+  {
+  public:
+    void operator() (const void *) {}
+  };
+
+  /// Helper function to construct shared pointer with NoDeleter with cleaner syntax
+
+  template <typename T>
+  std::shared_ptr<T> reference_to_no_delete_pointer(T& r)
+  {
+    return std::shared_ptr<T>(&r, NoDeleter());
+  }
+
+}
+
+#endif
diff --git a/dolfin/common/RangedIndexSet.h b/dolfin/common/RangedIndexSet.h
new file mode 100644
index 0000000..b3945bc
--- /dev/null
+++ b/dolfin/common/RangedIndexSet.h
@@ -0,0 +1,108 @@
+// Copyright (C) 2012 Joachim B Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-03-02
+// Last changed: 2012-03-02
+
+#ifndef __RANGED_INDEX_SET_H
+#define __RANGED_INDEX_SET_H
+
+#include <cstddef>
+#include <vector>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  /// This class provides an special-purpose data structure for testing if a given
+  /// index within a range is set. It is very fast.
+  ///
+  /// The memory requirements are one bit per item in range, since it uses a
+  /// (packed) std::vector<bool> for storage.
+
+  class RangedIndexSet
+  {
+
+  public:
+
+    /// Create a ranged set with range given as a (lower, upper) pair.
+    RangedIndexSet(std::pair<std::size_t, std::size_t> range)
+      : _range(range), _is_set(range.second - range.first)
+    {
+      clear();
+    }
+
+    /// Create a ranged set with 0 as lower range
+    RangedIndexSet(std::size_t upper_range)
+      : _range(std::pair<std::size_t, std::size_t>(0, upper_range)), _is_set(upper_range)
+    {
+      clear();
+    }
+
+    /// Return true if a given index is within range, i.e., if it can be stored in the set.
+    bool in_range(std::size_t i) const
+    {
+      return (i >= _range.first && i < _range.second);
+    }
+
+    /// Check is the set contains the given index.
+    bool has_index(std::size_t i) const
+    {
+      dolfin_assert(in_range(i));
+      return _is_set[i - _range.first];
+    }
+
+    /// Insert a given index into the set. Returns true if the index was
+    /// inserted (i.e., the index was not already in the set).
+    bool insert(std::size_t i)
+    {
+      dolfin_assert(in_range(i));
+      std::vector<bool>::reference entry = _is_set[i - _range.first];
+      if (entry)
+      {
+        return false;
+      }
+      else
+      {
+        entry = true;
+        return true;
+      }
+    }
+
+    /// Erase an index from the set.
+    void erase(std::size_t i)
+    {
+      dolfin_assert(in_range(i));
+      _is_set[i - _range.first] = false;
+    }
+
+    /// Erase all indices from the set.
+    void clear()
+    {
+      std::fill(_is_set.begin(), _is_set.end(), false);
+    }
+
+  private:
+
+    const std::pair<std::size_t, std::size_t> _range;
+    std::vector<bool> _is_set;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/Set.h b/dolfin/common/Set.h
new file mode 100644
index 0000000..bc09389
--- /dev/null
+++ b/dolfin/common/Set.h
@@ -0,0 +1,133 @@
+// Copyright (C) 2009-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-08-09
+// Last changed: 2011-01-05
+
+#ifndef __DOLFIN_SET_H
+#define __DOLFIN_SET_H
+
+#include <algorithm>
+#include <cstddef>
+#include <vector>
+
+namespace dolfin
+{
+
+  /// This is a set-like data structure. It is not ordered and it is based
+  /// a std::vector. It uses linear search, and can be faster than std::set
+  // and boost::unordered_set in some cases.
+
+  template<typename T>
+  class Set
+  {
+  public:
+
+    typedef typename std::vector<T>::iterator iterator;
+    typedef typename std::vector<T>::const_iterator const_iterator;
+
+    /// Create empty set
+    Set() {}
+
+    /// Wrap std::vectpr as a set. Contents will be erased.
+    Set(std::vector<T>& x) : _x(x)
+    { _x.clear(); }
+
+    /// Copy constructor
+    Set(const dolfin::Set<T>& x) : _x(x._x) {}
+
+    /// Destructor
+    ~Set() {}
+
+    /// Find entry in set and return an iterator to the entry
+    iterator find(const T& x)
+    { return std::find(_x.begin(), _x.end(), x); }
+
+    /// Find entry in set and return an iterator to the entry (const)
+    const_iterator find(const T& x) const
+    { return std::find(_x.begin(), _x.end(), x); }
+
+    /// Insert entry
+    bool insert(const T& x)
+    {
+      if( find(x) == this->end() )
+      {
+        _x.push_back(x);
+        return true;
+      }
+      else
+        return false;
+    }
+
+    /// Insert entries
+    template <typename InputIt>
+    void insert(const InputIt first, const InputIt last)
+    {
+      for (InputIt position = first; position != last; ++position)
+      {
+        if (std::find(_x.begin(), _x.end(), *position) == _x.end())
+          _x.push_back(*position);
+      }
+    }
+
+    const_iterator begin() const
+    { return _x.begin(); }
+
+    const_iterator end() const
+    { return _x.end(); }
+
+    /// Set size
+    std::size_t size() const
+    { return _x.size(); }
+
+    /// Erase an entry
+    void erase(const T& x)
+    {
+      iterator p = find(x);
+      if (p != _x.end())
+        _x.erase(p);
+    }
+
+    /// Sort set
+    void sort()
+    { std::sort(_x.begin(), _x.end()); }
+
+    /// Clear set
+    void clear()
+    { _x.clear(); }
+
+    /// Index the nth entry in the set
+    T operator[](std::size_t n) const
+    { return _x[n]; }
+
+    /// Return the vector that stores the data in the Set
+    const std::vector<T>& set() const
+    { return _x; }
+
+    /// Return the vector that stores the data in the Set
+    std::vector<T>& set()
+    { return _x; }
+
+  private:
+
+    std::vector<T> _x;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/SubSystemsManager.cpp b/dolfin/common/SubSystemsManager.cpp
new file mode 100644
index 0000000..dfbb0a6
--- /dev/null
+++ b/dolfin/common/SubSystemsManager.cpp
@@ -0,0 +1,314 @@
+// Copyright (C) 2008 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2012
+//
+// First added:  2008-01-07
+// Last changed: 2013-02-03
+
+#ifdef HAS_MPI
+#define MPICH_IGNORE_CXX_SEEK 1
+#include <mpi.h>
+#include <iostream>
+#endif
+
+#ifdef HAS_PETSC
+#include <petsc.h>
+#endif
+
+#ifdef HAS_SLEPC
+#include <slepc.h>
+#endif
+
+#include <libxml/parser.h>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/log/dolfin_log.h>
+#include "SubSystemsManager.h"
+
+using namespace dolfin;
+
+// Return singleton instance. Do NOT make the singleton a global static
+// object; the method here ensures that the singleton is initialised
+// before use. (google "static initialization order fiasco" for full
+// explanation)
+
+SubSystemsManager& SubSystemsManager::singleton()
+{
+  static SubSystemsManager the_instance;
+  return the_instance;
+}
+//-----------------------------------------------------------------------------
+SubSystemsManager::SubSystemsManager() : petsc_initialized(false),
+                                         control_mpi(false)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+SubSystemsManager::SubSystemsManager(const SubSystemsManager& sub_sys_manager)
+{
+  dolfin_error("SubSystemsManager.cpp",
+               "create subsystems manager",
+               "Copy constructor should not be used");
+}
+//-----------------------------------------------------------------------------
+SubSystemsManager::~SubSystemsManager()
+{
+  finalize();
+}
+//-----------------------------------------------------------------------------
+void SubSystemsManager::init_mpi()
+{
+  #ifdef HAS_MPI
+  int mpi_initialized;
+  MPI_Initialized(&mpi_initialized);
+  if (mpi_initialized)
+    return;
+
+  // Init MPI with highest level of thread support and take responsibility
+  char* c;
+  SubSystemsManager::init_mpi(0, &c, MPI_THREAD_MULTIPLE);
+  singleton().control_mpi = true;
+  #else
+  // Do nothing
+  #endif
+}
+//-----------------------------------------------------------------------------
+int SubSystemsManager::init_mpi(int argc, char* argv[],
+                                int required_thread_level)
+{
+  Timer timer("Init MPI");
+
+  #ifdef HAS_MPI
+  int mpi_initialized;
+  MPI_Initialized(&mpi_initialized);
+  if (mpi_initialized)
+    return -100;
+
+  // Initialise MPI and take responsibility
+  int provided = -1;
+  MPI_Init_thread(&argc, &argv, required_thread_level, &provided);
+  singleton().control_mpi = true;
+
+  const bool print_thread_support
+    = dolfin::parameters["print_mpi_thread_support_level"];
+  if (print_thread_support)
+  {
+    switch (provided)
+      {
+      case MPI_THREAD_SINGLE:
+        printf("MPI_Init_thread level = MPI_THREAD_SINGLE\n");
+        break;
+      case MPI_THREAD_FUNNELED:
+        printf("MPI_Init_thread level = MPI_THREAD_FUNNELED\n");
+        break;
+      case MPI_THREAD_SERIALIZED:
+        printf("MPI_Init_thread level = MPI_THREAD_SERIALIZED\n");
+        break;
+      case MPI_THREAD_MULTIPLE:
+        printf("MPI_Init_thread level = MPI_THREAD_MULTIPLE\n");
+        break;
+      default:
+        printf("MPI_Init_thread level = unkown\n");
+      }
+  }
+
+  return provided;
+  #else
+  return -1;
+  #endif
+}
+//-----------------------------------------------------------------------------
+void SubSystemsManager::init_petsc()
+{
+  #ifdef HAS_PETSC
+  if (singleton().petsc_initialized )
+    return;
+
+  log(TRACE, "Initializing PETSc (ignoring command-line arguments).");
+
+  // Dummy command-line arguments for PETSc. This is needed since
+  // PetscInitializeNoArguments() does not seem to work.
+  int argc = 0;
+  char** argv = NULL;
+
+  // Initialize PETSc
+  init_petsc(argc, argv);
+  #else
+  dolfin_error("SubSystemsManager.cpp",
+               "initialize PETSc subsystem",
+               "DOLFIN has not been configured with PETSc support");
+  #endif
+}
+//-----------------------------------------------------------------------------
+void SubSystemsManager::init_petsc(int argc, char* argv[])
+{
+  Timer timer("Init PETSc");
+
+  #ifdef HAS_PETSC
+  if (singleton().petsc_initialized)
+    return;
+
+  // Initialized MPI (do it here rather than letting PETSc do it to make
+  // sure we MPI is intialized with thread suppport
+  init_mpi();
+
+  // Get status of MPI before PETSc initialisation
+  const bool mpi_init_status = mpi_initialized();
+
+  // Print message if PETSc is intialised with command line arguments
+  if (argc > 1)
+    log(TRACE, "Initializing PETSc with given command-line arguments.");
+
+  PetscBool is_initialized;
+  PetscInitialized(&is_initialized);
+
+  if (is_initialized)
+  {
+    PetscOptionsInsert(&argc, &argv, PETSC_NULL);
+  }
+  else
+  {
+    // Initialize PETSc
+    PetscInitialize(&argc, &argv, PETSC_NULL, PETSC_NULL);
+  }
+
+  #ifdef HAS_SLEPC
+  // Initialize SLEPc
+  SlepcInitialize(&argc, &argv, PETSC_NULL, PETSC_NULL);
+  #endif
+
+  // Avoid using default PETSc signal handler
+  const bool use_petsc_signal_handler = parameters["use_petsc_signal_handler"];
+  if (!use_petsc_signal_handler)
+    PetscPopSignalHandler();
+
+  // Remember that PETSc has been initialized
+  singleton().petsc_initialized = true;
+
+  // Determine if PETSc initialised MPI (and is therefore responsible for MPI finalization)
+  if (mpi_initialized() && !mpi_init_status)
+    singleton().control_mpi = false;
+
+  #else
+  dolfin_error("SubSystemsManager.cpp",
+               "initialize PETSc subsystem",
+               "DOLFIN has not been configured with PETSc support");
+  #endif
+}
+//-----------------------------------------------------------------------------
+void SubSystemsManager::finalize()
+{
+  // Finalize subsystems in the correct order
+  finalize_petsc();
+  finalize_mpi();
+
+  // Clean up libxml2 parser
+  xmlCleanupParser();
+}
+//-----------------------------------------------------------------------------
+bool SubSystemsManager::responsible_mpi()
+{
+  return singleton().control_mpi;
+}
+//-----------------------------------------------------------------------------
+bool SubSystemsManager::responsible_petsc()
+{
+  return singleton().petsc_initialized;
+}
+//-----------------------------------------------------------------------------
+void SubSystemsManager::finalize_mpi()
+{
+  #ifdef HAS_MPI
+  int mpi_initialized;
+  MPI_Initialized(&mpi_initialized);
+
+  // Finalise MPI if required
+  if (mpi_initialized && singleton().control_mpi)
+  {
+    // Check in MPI has already been finalised (possibly incorrectly by a
+    // 3rd party libary). Is it hasn't, finalise as normal.
+    int mpi_finalized;
+    MPI_Finalized(&mpi_finalized);
+    if (!mpi_finalized)
+      MPI_Finalize();
+    else
+    {
+      // Use std::cout since log system may fail because MPI has been shut down.
+      std::cout << "DOLFIN is responsible for MPI, but it has been finalized elsewhere prematurely." << std::endl;
+      std::cout << "This is usually due to a bug in a 3rd party library, and can lead to unpredictable behaviour."
+                << std::endl;
+      std::cout << "If using PyTrilinos, make sure that PyTrilinos modules are imported before the DOLFIN module."
+                << std::endl;
+    }
+
+    singleton().control_mpi = false;
+  }
+  #else
+  // Do nothing
+  #endif
+}
+//-----------------------------------------------------------------------------
+void SubSystemsManager::finalize_petsc()
+{
+  #ifdef HAS_PETSC
+  if (singleton().petsc_initialized)
+  {
+    if (!PetscFinalizeCalled)
+    {
+      PetscFinalize();
+    }
+    singleton().petsc_initialized = false;
+
+    #ifdef HAS_SLEPC
+    SlepcFinalize();
+    #endif
+  }
+  #else
+  // Do nothing
+  #endif
+}
+//-----------------------------------------------------------------------------
+bool SubSystemsManager::mpi_initialized()
+{
+  // This function not affected if MPI_Finalize has been called. It returns
+  // true if MPI_Init has been called at any point, even if MPI_Finalize has
+  // been called.
+
+  #ifdef HAS_MPI
+  int mpi_initialized;
+  MPI_Initialized(&mpi_initialized);
+  return mpi_initialized;
+  #else
+  // DOLFIN is not configured for MPI (it might be through PETSc)
+  return false;
+  #endif
+}
+//-----------------------------------------------------------------------------
+bool SubSystemsManager::mpi_finalized()
+{
+  #ifdef HAS_MPI
+  int mpi_finalized;
+  MPI_Finalized(&mpi_finalized);
+  return mpi_finalized;
+  #else
+  // DOLFIN is not configured for MPI (it might be through PETSc)
+  return false;
+  #endif
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/common/SubSystemsManager.h b/dolfin/common/SubSystemsManager.h
new file mode 100644
index 0000000..de10a0e
--- /dev/null
+++ b/dolfin/common/SubSystemsManager.h
@@ -0,0 +1,96 @@
+// Copyright (C) 2008-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-01-07
+// Last changed: 2011-01-23
+
+#ifndef __SUB_SYSTEMS_MANAGER_H
+#define __SUB_SYSTEMS_MANAGER_H
+
+namespace dolfin
+{
+
+  /// This is a singleton class which manages the initialisation and
+  /// finalisation of various sub systems, such as MPI and PETSc.
+
+  class SubSystemsManager
+  {
+  public:
+
+    /// Initialise MPI
+    static void init_mpi();
+
+    /// Initialise MPI with required level of thread support
+    static int init_mpi(int argc, char* argv[], int required_thread_level);
+
+    /// Initialize PETSc without command-line arguments
+    static void init_petsc();
+
+    /// Initialize PETSc with command-line arguments. Note that PETSc
+    /// command-line arguments may also be filtered and sent to PETSc
+    /// by parameters.parse(argc, argv).
+    static void init_petsc(int argc, char* argv[]);
+
+    /// Finalize subsytems. This will be called by the destructor, but in
+    /// special cases it may be necessary to call finalize() explicitly.
+    static void finalize();
+
+    /// Return true if DOLFIN intialised MPI (and is therefore responsible
+    /// for finalization)
+    static bool responsible_mpi();
+
+    /// Return true if DOLFIN intialised PETSc (and is therefore
+    /// responsible for finalization)
+    static bool responsible_petsc();
+
+    /// Check if MPI has been initialised (returns true if MPI has been
+    /// initialised, even if it is later finalised)
+    static bool mpi_initialized();
+
+    /// Check if MPI has been finalized (returns true if MPI has been
+    /// finalised)
+    static bool mpi_finalized();
+
+  private:
+
+    // Constructor (private)
+    SubSystemsManager();
+
+    // Copy constructor (private)
+    SubSystemsManager(const SubSystemsManager& sub_sys_manager);
+
+    // Destructor
+    ~SubSystemsManager();
+
+    // Finalize MPI
+    static void finalize_mpi();
+
+    // Finalize PETSc
+    static void finalize_petsc();
+
+    // Singleton instance
+    static SubSystemsManager& singleton();
+
+    // State variables
+    bool petsc_initialized;
+    bool control_mpi;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/Timer.cpp b/dolfin/common/Timer.cpp
new file mode 100644
index 0000000..e2a241a
--- /dev/null
+++ b/dolfin/common/Timer.cpp
@@ -0,0 +1,59 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-08
+// Last changed:
+
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/log/LogManager.h>
+#include "timing.h"
+#include "Timer.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Timer::Timer(std::string task) : _task(""), t(time()), stopped(false)
+{
+  const std::string prefix = parameters["timer_prefix"];
+  _task = prefix + task;
+}
+//-----------------------------------------------------------------------------
+Timer::~Timer()
+{
+ if (!stopped)
+   stop();
+}
+//-----------------------------------------------------------------------------
+void Timer::start()
+{
+  t = time();
+  stopped = false;
+}
+//-----------------------------------------------------------------------------
+double Timer::stop()
+{
+  t = time() - t;
+  LogManager::logger.register_timing(_task, t);
+  stopped = true;
+  return t;
+}
+//-----------------------------------------------------------------------------
+double Timer::value() const
+{
+  return t;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/common/Timer.h b/dolfin/common/Timer.h
new file mode 100644
index 0000000..4db2899
--- /dev/null
+++ b/dolfin/common/Timer.h
@@ -0,0 +1,79 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-06-13
+// Last changed: 2010-11-16
+
+#ifndef __TIMER_H
+#define __TIMER_H
+
+#include <string>
+
+namespace dolfin
+{
+
+  /// A timer can be used for timing tasks. The basic usage is
+  ///
+  ///   Timer timer("Assembling over cells");
+  ///
+  /// The timer is started at construction and timing ends
+  /// when the timer is destroyed (goes out of scope). It is
+  /// also possible to start and stop a timer explicitly by
+  ///
+  ///   timer.start();
+  ///   timer.stop();
+  ///
+  /// Timings are stored globally and a summary may be printed
+  /// by calling
+  ///
+  ///   list_timings();
+
+  class Timer
+  {
+  public:
+
+    /// Create timer
+    Timer(std::string task);
+
+    /// Destructor
+    ~Timer();
+
+    /// Start timer
+    void start();
+
+    /// Stop timer
+    double stop();
+
+    /// Return value of timer (or time at start if not stopped)
+    double value() const;
+
+  private:
+
+    // Name of task
+    std::string _task;
+
+    // Start time
+    double t;
+
+    // True if timer has been stopped
+    bool stopped;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/UniqueIdGenerator.cpp b/dolfin/common/UniqueIdGenerator.cpp
new file mode 100644
index 0000000..6c19c60
--- /dev/null
+++ b/dolfin/common/UniqueIdGenerator.cpp
@@ -0,0 +1,44 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-12-05
+// Last changed:
+
+#include "UniqueIdGenerator.h"
+
+using namespace dolfin;
+
+// Initialise static data
+dolfin::UniqueIdGenerator dolfin::UniqueIdGenerator::unique_id_generator;
+
+//-----------------------------------------------------------------------------
+UniqueIdGenerator::UniqueIdGenerator() : next_id(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t UniqueIdGenerator::id()
+{
+  // Get ID
+  const std::size_t _id = unique_id_generator.next_id;
+
+  // Increment ID
+  ++unique_id_generator.next_id;
+
+  return _id;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/common/UniqueIdGenerator.h b/dolfin/common/UniqueIdGenerator.h
new file mode 100644
index 0000000..531769c
--- /dev/null
+++ b/dolfin/common/UniqueIdGenerator.h
@@ -0,0 +1,55 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-12-05
+// Last changed:
+
+#ifndef __UNIQUE_ID_GENERATOR_H
+#define __UNIQUE_ID_GENERATOR_H
+
+#include <cstddef>
+
+namespace dolfin
+{
+
+  // FIXME: Make a base class that classes can inherit from
+
+  /// This is a singleton class that return IDs that are unique in the
+  /// lifetime of a program.
+
+  class UniqueIdGenerator
+  {
+  public:
+
+    UniqueIdGenerator();
+
+    /// Generate a unique ID
+    static std::size_t id();
+
+  private:
+
+    // Singleton instance
+    static UniqueIdGenerator unique_id_generator;
+
+    // Next ID to be returned
+    std::size_t next_id;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/Variable.cpp b/dolfin/common/Variable.cpp
new file mode 100644
index 0000000..262b387
--- /dev/null
+++ b/dolfin/common/Variable.cpp
@@ -0,0 +1,78 @@
+// Copyright (C) 2003-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2011
+//
+// First added:  2003-02-26
+// Last changed: 2011-09-24
+
+#include <sstream>
+#include <dolfin/parameter/Parameters.h>
+#include "UniqueIdGenerator.h"
+#include "Variable.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Variable::Variable()
+  : _name("x"), _label("unnamed data"), unique_id(UniqueIdGenerator::id())
+
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Variable::Variable(const std::string name, const std::string label)
+  : _name(name), _label(label), unique_id(UniqueIdGenerator::id())
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Variable::Variable(const Variable& variable) : _name(variable._name),
+  _label(variable._label), unique_id(UniqueIdGenerator::id())
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Variable::~Variable()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void Variable::rename(const std::string name, const std::string label)
+{
+  _name = name;
+  _label = label;
+}
+//-----------------------------------------------------------------------------
+std::string Variable::name() const
+{
+  return _name;
+}
+//-----------------------------------------------------------------------------
+std::string Variable::label() const
+{
+  return _label;
+}
+//-----------------------------------------------------------------------------
+std::string Variable::str(bool verbose) const
+{
+  std::stringstream s;
+  s << "<DOLFIN object "
+    << _name << " (" << _label << ")>";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/common/Variable.h b/dolfin/common/Variable.h
new file mode 100644
index 0000000..3bf93d8
--- /dev/null
+++ b/dolfin/common/Variable.h
@@ -0,0 +1,88 @@
+// Copyright (C) 2003-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2011
+//
+// First added:  2003-02-26
+// Last changed: 2011-09-24
+
+#ifndef __VARIABLE_H
+#define __VARIABLE_H
+
+#include <cstddef>
+#include <string>
+#include <dolfin/parameter/Parameters.h>
+
+namespace dolfin
+{
+
+  /// Common base class for DOLFIN variables.
+
+  class Variable
+  {
+  public:
+
+    /// Create unnamed variable
+    Variable();
+
+    /// Create variable with given name and label
+    Variable(const std::string name, const std::string label);
+
+    /// Copy constructor
+    Variable(const Variable& variable);
+
+    /// Destructor
+    virtual ~Variable();
+
+    /// Rename variable
+    void rename(const std::string name, const std::string label);
+
+    /// Return name
+    std::string name()  const;
+
+    /// Return label (description)
+    std::string label() const;
+
+    /// Get unique identifier.
+    ///
+    /// *Returns*
+    ///     _std::size_t_
+    ///         The unique integer identifier associated with the object.
+    std::size_t id() const { return unique_id; }
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    // Parameters
+    Parameters parameters;
+
+  private:
+
+    // Name
+    std::string _name;
+
+    // Label
+    std::string _label;
+
+    // Unique identifier
+    const std::size_t unique_id;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/common/constants.h b/dolfin/common/constants.h
new file mode 100644
index 0000000..b28296d
--- /dev/null
+++ b/dolfin/common/constants.h
@@ -0,0 +1,33 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-04-22
+// Last changed: 2013-12-09
+//
+// This file provides values for common constants.
+
+#ifndef __DOLFIN_CONSTANTS_H
+#define __DOLFIN_CONSTANTS_H
+
+#define DOLFIN_EPS           3.0e-16
+#define DOLFIN_EPS_LARGE     1e-14
+#define DOLFIN_SQRT_EPS      1.0e-8
+#define DOLFIN_PI            3.141592653589793238462
+#define DOLFIN_LINELENGTH    256
+#define DOLFIN_TERM_WIDTH    80
+
+#endif
diff --git a/dolfin/common/defines.cpp b/dolfin/common/defines.cpp
new file mode 100644
index 0000000..20e212f
--- /dev/null
+++ b/dolfin/common/defines.cpp
@@ -0,0 +1,170 @@
+// Copyright (C) 2009-2011 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011
+// Modified by Garth N. Wells, 2013
+//
+// First added:  2011-10-15
+// Last changed: 2013-11-01
+
+#include <dolfin/common/defines.h>
+
+//-------------------------------------------------------------------------
+std::string dolfin::dolfin_version()
+{
+  return std::string(DOLFIN_VERSION);
+}
+//-------------------------------------------------------------------------
+std::string dolfin::git_commit_hash()
+{
+  return std::string(DOLFIN_GIT_COMMIT_HASH);
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_openmp()
+{
+#ifdef HAS_OPENMP
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_mpi()
+{
+#ifdef HAS_MPI
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_petsc()
+{
+#ifdef HAS_PETSC
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_petsc_snes()
+{
+#ifdef ENABLE_PETSC_SNES
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_petsc_tao()
+{
+#ifdef ENABLE_PETSC_TAO
+  return true;
+#else
+  return false;
+#endif
+}//-------------------------------------------------------------------------
+bool dolfin::has_slepc()
+{
+#ifdef HAS_SLEPC
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_trilinos()
+{
+#ifdef HAS_TRILINOS
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_scotch()
+{
+#ifdef HAS_SCOTCH
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_cgal()
+{
+#ifdef HAS_CGAL
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_umfpack()
+{
+#ifdef HAS_UMFPACK
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_cholmod()
+{
+#ifdef HAS_CHOLMOD
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_parmetis()
+{
+#ifdef HAS_PARMETIS
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_zlib()
+{
+#ifdef HAS_ZLIB
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_hdf5()
+{
+#ifdef HAS_HDF5
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
+bool dolfin::has_exodus()
+{
+#ifdef HAS_VTK_EXODUS
+  return true;
+#else
+  return false;
+#endif
+}
+//-------------------------------------------------------------------------
diff --git a/dolfin/common/defines.h b/dolfin/common/defines.h
new file mode 100644
index 0000000..275e7a8
--- /dev/null
+++ b/dolfin/common/defines.h
@@ -0,0 +1,86 @@
+// Copyright (C) 2009-2011 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011
+// Modified by Garth N. Wells, 2013
+//
+// First added:  2009-09-03
+// Last changed: 2013-11-01
+
+#ifndef __DOLFIN_DEFINES_H
+#define __DOLFIN_DEFINES_H
+
+#include<string>
+
+namespace dolfin
+{
+
+  /// Return DOLFIN version string
+  std::string dolfin_version();
+
+  /// Return git changeset hash (returns "unknown" if changeset is
+  /// not known)
+  std::string git_commit_hash();
+
+  /// Return true if DOLFIN is compiled with OpenMP
+  bool has_openmp();
+
+  /// Return true if DOLFIN is compiled with MPI
+  bool has_mpi();
+
+  /// Return true if DOLFIN is compiled with PETSc
+  bool has_petsc();
+
+  /// Return true if PETSc SNES is enabled
+  bool has_petsc_snes();
+  
+  /// Return true if PETSc TAO is enabled
+  bool has_petsc_tao();
+  
+  /// Return true if DOLFIN is compiled with SLEPc
+  bool has_slepc();
+
+  /// Return true if DOLFIN is compiled with Trilinos
+  bool has_trilinos();
+
+  /// Return true if DOLFIN is compiled with Scotch
+  bool has_scotch();
+
+  /// Return true if DOLFIN is compiled with CGAL
+  bool has_cgal();
+
+  /// Return true if DOLFIN is compiled with Umfpack
+  bool has_umfpack();
+
+  /// Return true if DOLFIN is compiled with Cholmod
+  bool has_cholmod();
+
+  /// Return true if DOLFIN is compiled with ParMETIS
+  bool has_parmetis();
+
+  /// Return true if DOLFIN is compiled with ZLIB
+  bool has_zlib();
+
+  /// Return true if DOLFIN is compiled with HDF5
+  bool has_hdf5();
+
+  /// Return true if DOLFIN is compiled with Exodus
+  bool has_exodus();
+
+}
+
+#endif
diff --git a/dolfin/common/dolfin_common.h b/dolfin/common/dolfin_common.h
new file mode 100644
index 0000000..d8ffd5f
--- /dev/null
+++ b/dolfin/common/dolfin_common.h
@@ -0,0 +1,20 @@
+#ifndef __DOLFIN_COMMON_H
+#define __DOLFIN_COMMON_H
+
+// DOLFIN common
+
+#include <dolfin/common/init.h>
+#include <dolfin/common/defines.h>
+#include <dolfin/common/types.h>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/timing.h>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/IndexSet.h>
+#include <dolfin/common/Set.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/common/Hierarchical.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/SubSystemsManager.h>
+
+#endif
diff --git a/dolfin/common/dolfin_doc.h b/dolfin/common/dolfin_doc.h
new file mode 100644
index 0000000..c29b238
--- /dev/null
+++ b/dolfin/common/dolfin_doc.h
@@ -0,0 +1,32 @@
+// Copyright (C) 2003-2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2003-05-26
+// Last changed: 2006-03-01
+//
+// This file contains the contents of the index page
+// for the documentation generated by doxygen.
+
+/*! \mainpage DOLFIN Programmer's Reference
+ *
+ * This documentation is automatically generated each night for the current
+ * development version of DOLFIN.
+ *
+ * <p>
+ *
+ * A good starting point is the <a href="inherits.html">graphical class hierarchy</a>. <p>
+ */
diff --git a/dolfin/common/init.cpp b/dolfin/common/init.cpp
new file mode 100644
index 0000000..5d3cf80
--- /dev/null
+++ b/dolfin/common/init.cpp
@@ -0,0 +1,35 @@
+// Copyright (C) 2005-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2005-02-13
+// Last changed: 2011-03-17
+
+#include <dolfin/common/constants.h>
+#include <dolfin/log/dolfin_log.h>
+#include "SubSystemsManager.h"
+#include "init.h"
+
+//-----------------------------------------------------------------------------
+void dolfin::init(int argc, char* argv[])
+{
+  log(PROGRESS, "Initializing DOLFIN version %s.", DOLFIN_VERSION);
+
+  #ifdef HAS_PETSC
+  SubSystemsManager::init_petsc(argc, argv);
+  #endif
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/common/init.h b/dolfin/common/init.h
new file mode 100644
index 0000000..a62b043
--- /dev/null
+++ b/dolfin/common/init.h
@@ -0,0 +1,34 @@
+// Copyright (C) 2005-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2005-02-13
+// Last changed: 2011-01-24
+
+#ifndef __INIT_H
+#define __INIT_H
+
+namespace dolfin
+{
+
+  /// Initialize DOLFIN (and PETSc) with command-line arguments. This
+  /// should not be needed in most cases since the initialization is
+  /// otherwise handled automatically.
+  void init(int argc, char* argv[]);
+
+}
+
+#endif
diff --git a/dolfin/common/timing.cpp b/dolfin/common/timing.cpp
new file mode 100644
index 0000000..42e7bf8
--- /dev/null
+++ b/dolfin/common/timing.cpp
@@ -0,0 +1,113 @@
+// Copyright (C) 2003-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2003-12-21
+// Last changed: 2012-11-01
+
+// Uncomment this for testing std::clock
+//#define _WIN32
+
+#ifdef _WIN32
+#include <boost/timer.hpp>
+#else
+#include <sys/time.h>
+#endif
+
+#include "MPI.h"
+#include <dolfin/log/log.h>
+#include <dolfin/log/LogManager.h>
+#include "timing.h"
+
+// We use boost::timer (std::clock) on Windows and otherwise the
+// platform-dependent (but higher-precision) gettimeofday from
+// <sys/time.h>. Note that in the latter case, the timer is not
+// reset to zero at the start of the program so time() will not
+// report total CPU time, only the difference makes sense.
+
+namespace dolfin
+{
+#ifdef _WIN32
+  boost::timer __global_timer;
+  boost::timer __tic_timer;
+#else
+  double __tic_timer;
+#endif
+}
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------
+void dolfin::tic()
+{
+#ifdef _WIN32
+  dolfin::__tic_timer.restart();
+#else
+  dolfin::__tic_timer = time();
+#endif
+}
+//-----------------------------------------------------------------------------
+double dolfin::toc()
+{
+#ifdef _WIN32
+  return __tic_timer.elapsed();
+#else
+  return time() - __tic_timer;
+#endif
+}
+//-----------------------------------------------------------------------------
+double dolfin::time()
+{
+#ifdef _WIN32
+  return dolfin::__global_timer.elapsed();
+#else
+  struct timeval tv;
+  struct timezone tz;
+  if (gettimeofday(&tv, &tz) != 0)
+  {
+    dolfin_error("timing.cpp",
+                 "return current time",
+                 "Call to gettimeofday() failed");
+  }
+  return static_cast<double>(tv.tv_sec) + static_cast<double>(tv.tv_usec)*1e-6;
+#endif
+}
+//-----------------------------------------------------------------------------
+void dolfin::list_timings(bool reset)
+{
+  // Optimization
+  if (!LogManager::logger.is_active())
+    return;
+
+  LogManager::logger.list_timings(reset);
+}
+//-----------------------------------------------------------------------------
+Table dolfin::timings(bool reset)
+{
+  return LogManager::logger.timings(reset);
+}
+//-----------------------------------------------------------------------------
+void dolfin::summary(bool reset)
+{
+  warning("The summary() function is deprecated, use list_timings().");
+  list_timings(reset);
+}
+//-----------------------------------------------------------------------------
+double dolfin::timing(std::string task, bool reset)
+{
+  return LogManager::logger.timing(task, reset);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/common/timing.h b/dolfin/common/timing.h
new file mode 100644
index 0000000..563a50d
--- /dev/null
+++ b/dolfin/common/timing.h
@@ -0,0 +1,58 @@
+// Copyright (C) 2005-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2005-12-21
+// Last changed: 2012-11-01
+
+#ifndef __TIMING_H
+#define __TIMING_H
+
+#include <string>
+#include <dolfin/log/Table.h>
+
+namespace dolfin
+{
+
+  /// Timing functions measure CPU time as determined by clock(),
+  /// the precision of which seems to be 0.01 seconds.
+
+  /// Start timing (should not be used internally in DOLFIN!)
+  void tic();
+
+  /// Return elapsed CPU time (should not be used internally in DOLFIN!)
+  double toc();
+
+  /// Return current CPU time used by process
+  double time();
+
+  /// Return a summary of timings and tasks in a Table, optionally clearing
+  /// stored timings
+  Table timings(bool reset=false);
+
+  /// List a summary of timings and tasks, optionally clearing stored timings
+  void list_timings(bool reset=false);
+
+  /// This function is deprecated, use list_timings
+  void summary(bool reset=false);
+
+  /// Return timing (average) for given task, optionally clearing timing
+  /// for task
+  double timing(std::string task, bool reset=false);
+
+}
+
+#endif
diff --git a/dolfin/common/types.h b/dolfin/common/types.h
new file mode 100644
index 0000000..47112a1
--- /dev/null
+++ b/dolfin/common/types.h
@@ -0,0 +1,44 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2012
+//
+// First added:  2008-04-22
+// Last changed: 2013-05-28
+//
+// This file provides DOLFIN typedefs for basic types.
+
+#ifndef __DOLFIN_TYPES_H
+#define __DOLFIN_TYPES_H
+
+#ifdef HAS_PETSC
+#include <petscsys.h>
+#endif
+
+namespace dolfin
+{
+
+  /// Index type for compatibility with linear algebra backend(s)
+  #ifdef HAS_PETSC
+  typedef PetscInt la_index;
+  #else
+  typedef int la_index;
+  #endif
+
+}
+
+#endif
diff --git a/dolfin/common/unittest.h b/dolfin/common/unittest.h
new file mode 100644
index 0000000..72df69a
--- /dev/null
+++ b/dolfin/common/unittest.h
@@ -0,0 +1,40 @@
+// Copyright (C) 2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-05-14
+// Last changed: 2007-05-24
+//
+// Simple macro for DOLFIN unit tests (using cppunit). The macro
+// DOLFIN_TEST removes the need of repeating the same 8 lines of
+// code in every single unit test.
+
+#include <cppunit/extensions/HelperMacros.h>
+#include <cppunit/TestRunner.h>
+#include <cppunit/TestResult.h>
+#include <cppunit/TestResultCollector.h>
+#include <cppunit/CompilerOutputter.h>
+
+#define DOLFIN_TEST \
+CppUnit::TestResult result; \
+CppUnit::TestResultCollector collected_results; \
+result.addListener(&collected_results); \
+CppUnit::TestRunner runner; \
+runner.addTest(CppUnit::TestFactoryRegistry::getRegistry().makeTest()); \
+runner.run(result); \
+CppUnit::CompilerOutputter outputter(&collected_results, std::cerr); \
+outputter.write (); \
+return collected_results.wasSuccessful () ? 0 : 1;
diff --git a/dolfin/common/utils.cpp b/dolfin/common/utils.cpp
new file mode 100644
index 0000000..5ef2ccb
--- /dev/null
+++ b/dolfin/common/utils.cpp
@@ -0,0 +1,58 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-08-09
+// Last changed: 2010-11-18
+
+#include <cstdlib>
+#include <sstream>
+#include "utils.h"
+
+//-----------------------------------------------------------------------------
+std::string dolfin::indent(std::string block)
+{
+  std::string indentation("  ");
+  std::stringstream s;
+
+  s << indentation;
+  for (std::size_t i = 0; i < block.size(); ++i)
+  {
+    s << block[i];
+    if (block[i] == '\n' && i < block.size() - 1)
+      s << indentation;
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string dolfin::to_string(const double* x, std::size_t n)
+{
+  std::stringstream s;
+
+  s << "[";
+  for (std::size_t i = 0; i < n; i++)
+  {
+    s << x[i];
+    if (i < n - 1)
+      s << ", ";
+  }
+  s << "]";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+
diff --git a/dolfin/common/utils.h b/dolfin/common/utils.h
new file mode 100644
index 0000000..5f0e303
--- /dev/null
+++ b/dolfin/common/utils.h
@@ -0,0 +1,103 @@
+// Copyright (C) 2009-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B. Haga, 2012.
+// Modified by Garth N. Wells, 2013.
+//
+// First added:  2009-08-09
+// Last changed: 2013-01-03
+
+#ifndef __DOLFIN_UTILS_H
+#define __DOLFIN_UTILS_H
+
+#include <cstring>
+#include <limits>
+#include <string>
+#include <sstream>
+#include <vector>
+#include <boost/functional/hash.hpp>
+#include <dolfin/common/MPI.h>
+
+namespace dolfin
+{
+
+  /// Indent string block
+  std::string indent(std::string block);
+
+  /// Return string representation of int
+  template <class T>
+    std::string to_string(T x)
+  {
+    std::stringstream s;
+    s << x;
+    return s.str();
+  }
+
+  /// Return string representation of given array
+  std::string to_string(const double* x, std::size_t n);
+
+  /// Return a hash of a given object
+  template <class T>
+  std::size_t hash_local(const T& x)
+  {
+    boost::hash<T> hash;
+    return hash(x);
+  }
+
+  /// Return a hash for a distributed (MPI) object. A hash is computed
+  /// on each process, and the hash of the std::vector of all local hash
+  /// keys is returned. This function is collective.
+  template <class T>
+    std::size_t hash_global(const MPI_Comm mpi_comm, const T& x)
+  {
+    // Compute local hash
+    std::size_t local_hash = hash_local(x);
+
+    // Gather hash keys on root process
+    std::vector<std::size_t> all_hashes;
+    std::vector<std::size_t> local_hash_tmp(1, local_hash);
+    MPI::gather(mpi_comm, local_hash_tmp, all_hashes);
+
+    // Hash the received hash keys
+    boost::hash<std::vector<std::size_t> > hash;
+    std::size_t global_hash = hash(all_hashes);
+
+    // Broadcast hash key to all processes
+    MPI::broadcast(mpi_comm, global_hash);
+    return global_hash;
+  }
+
+  /// Fast zero-fill of numeric vectors/blocks.
+  template <class T>
+    void zerofill(T* arr, std::size_t n)
+  {
+    if (std::numeric_limits<T>::is_integer || std::numeric_limits<T>::is_iec559)
+      std::memset(arr, 0, n*sizeof(T));
+    else
+    {
+      // should never happen in practice
+      std::fill_n(arr, n, T(0));
+    }
+  }
+
+  template <class T>
+    void zerofill(std::vector<T>& vec)
+  { zerofill(&vec[0], vec.size()); }
+
+}
+
+#endif
diff --git a/dolfin/dolfin.h b/dolfin/dolfin.h
new file mode 100644
index 0000000..c0c93c3
--- /dev/null
+++ b/dolfin/dolfin.h
@@ -0,0 +1,39 @@
+#ifndef __DOLFIN_H
+#define __DOLFIN_H
+
+// DOLFIN interface
+// Autogeneration of SWIG interface is dependent on the comments about 
+// SWIG modules. The order of the modules and the internal submodules 
+// are important for the SWIG interface and 
+
+// SWIG module common 
+#include <dolfin/common/dolfin_common.h>
+#include <dolfin/parameter/dolfin_parameter.h>
+#include <dolfin/log/dolfin_log.h>
+
+// SWIG module mesh
+#include <dolfin/mesh/dolfin_mesh.h>
+#include <dolfin/generation/dolfin_generation.h>
+#include <dolfin/geometry/dolfin_geometry.h>
+#include <dolfin/refinement/dolfin_refinement.h>
+
+// SWIG module la
+#include <dolfin/la/dolfin_la.h>
+#include <dolfin/nls/dolfin_nls.h>
+
+// SWIG module function
+#include <dolfin/function/dolfin_function.h>
+#include <dolfin/math/dolfin_math.h>
+#include <dolfin/ale/dolfin_ale.h>
+#include <dolfin/graph/dolfin_graph.h>
+
+// SWIG module fem
+#include <dolfin/fem/dolfin_fem.h>
+#include <dolfin/multistage/dolfin_multistage.h>
+#include <dolfin/adaptivity/dolfin_adaptivity.h>
+
+// SWIG module io
+#include <dolfin/plot/dolfin_plot.h>
+#include <dolfin/io/dolfin_io.h>
+
+#endif
diff --git a/dolfin/fem/Assembler.cpp b/dolfin/fem/Assembler.cpp
new file mode 100644
index 0000000..dca9175
--- /dev/null
+++ b/dolfin/fem/Assembler.cpp
@@ -0,0 +1,428 @@
+// Copyright (C) 2007-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2007-2009
+// Modified by Ola Skavhaug 2007-2009
+// Modified by Kent-Andre Mardal 2008
+// Modified by Joachim B Haga 2012
+// Modified by Martin Alnaes 2013
+//
+// First added:  2007-01-17
+// Last changed: 2013-09-19
+
+
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/la/GenericTensor.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/MeshData.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/SubDomain.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/FunctionSpace.h>
+#include "GenericDofMap.h"
+#include "Form.h"
+#include "UFC.h"
+#include "FiniteElement.h"
+#include "OpenMpAssembler.h"
+#include "AssemblerBase.h"
+#include "Assembler.h"
+
+#include <dolfin/la/GenericMatrix.h>
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+void Assembler::assemble(GenericTensor& A, const Form& a)
+{
+  // All assembler functions above end up calling this function, which
+  // in turn calls the assembler functions below to assemble over
+  // cells, exterior and interior facets.
+
+  // Check whether we should call the multi-core assembler
+  #ifdef HAS_OPENMP
+  const std::size_t num_threads = parameters["num_threads"];
+  if (num_threads > 0)
+  {
+    OpenMpAssembler assembler;
+    assembler.add_values = add_values;
+    assembler.finalize_tensor = finalize_tensor;
+    assembler.keep_diagonal = keep_diagonal;
+    assembler.assemble(A, a);
+    return;
+  }
+  #endif
+
+  // Get cell domains
+  const MeshFunction<std::size_t>* cell_domains = a.cell_domains().get();
+
+  // Get exterior facet domains
+  const MeshFunction<std::size_t>* exterior_facet_domains
+      = a.exterior_facet_domains().get();
+
+  // Get interior facet domains
+  const MeshFunction<std::size_t>* interior_facet_domains
+      = a.interior_facet_domains().get();
+
+  // Check form
+  AssemblerBase::check(a);
+
+  // Create data structure for local assembly data
+  UFC ufc(a);
+
+  // Update off-process coefficients
+  const std::vector<std::shared_ptr<const GenericFunction> >
+    coefficients = a.coefficients();
+
+  // Initialize global tensor
+  init_global_tensor(A, a);
+
+  // Assemble over cells
+  assemble_cells(A, a, ufc, cell_domains, 0);
+
+  // Assemble over exterior facets
+  assemble_exterior_facets(A, a, ufc, exterior_facet_domains, 0);
+
+  // Assemble over interior facets
+  assemble_interior_facets(A, a, ufc, interior_facet_domains, 0);
+
+  // Finalize assembly of global tensor
+  if (finalize_tensor)
+    A.apply("add");
+}
+//-----------------------------------------------------------------------------
+void Assembler::assemble_cells(GenericTensor& A,
+                               const Form& a,
+                               UFC& ufc,
+                               const MeshFunction<std::size_t>* domains,
+                               std::vector<double>* values)
+{
+  // Skip assembly if there are no cell integrals
+  if (!ufc.form.has_cell_integrals())
+    return;
+
+  // Set timer
+  Timer timer("Assemble cells");
+
+  // Extract mesh
+  const Mesh& mesh = a.mesh();
+
+  // Form rank
+  const std::size_t form_rank = ufc.form.rank();
+
+  // Collect pointers to dof maps
+  std::vector<const GenericDofMap*> dofmaps;
+  for (std::size_t i = 0; i < form_rank; ++i)
+    dofmaps.push_back(a.function_space(i)->dofmap().get());
+
+  // Vector to hold dof map for a cell
+  std::vector<const std::vector<dolfin::la_index>* > dofs(form_rank);
+
+  // Cell integral
+  ufc::cell_integral* integral = ufc.default_cell_integral.get();
+
+  // Check whether integral is domain-dependent
+  bool use_domains = domains && !domains->empty();
+
+  // Assemble over cells
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  Progress p(AssemblerBase::progress_message(A.rank(), "cells"),
+             mesh.num_cells());
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Get integral for sub domain (if any)
+    if (use_domains)
+      integral = ufc.get_cell_integral((*domains)[*cell]);
+
+    // Skip if no integral on current domain
+    if (!integral)
+      continue;
+
+    // Update to current cell
+    cell->get_cell_data(ufc_cell);
+    cell->get_vertex_coordinates(vertex_coordinates);
+    ufc.update(*cell, vertex_coordinates, ufc_cell,
+               integral->enabled_coefficients());
+
+    // Get local-to-global dof maps for cell
+    bool empty_dofmap = false;
+    for (std::size_t i = 0; i < form_rank; ++i)
+    {
+      dofs[i] = &(dofmaps[i]->cell_dofs(cell->index()));
+      empty_dofmap = empty_dofmap || dofs[i]->size() == 0;
+    }
+
+    // Skip if at least one dofmap is empty
+    if (empty_dofmap)
+      continue;
+
+    // Tabulate cell tensor
+    integral->tabulate_tensor(ufc.A.data(), ufc.w(),
+                              vertex_coordinates.data(),
+                              ufc_cell.orientation);
+
+    // Add entries to global tensor. Either store values cell-by-cell
+    // (currently only available for functionals)
+    if (values && ufc.form.rank() == 0)
+      (*values)[cell->index()] = ufc.A[0];
+    else
+      add_to_global_tensor(A, ufc.A, dofs);
+
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
+void Assembler::assemble_exterior_facets(GenericTensor& A,
+                                         const Form& a,
+                                         UFC& ufc,
+                                         const MeshFunction<std::size_t>* domains,
+                                         std::vector<double>* values)
+{
+  // Skip assembly if there are no exterior facet integrals
+  if (!ufc.form.has_exterior_facet_integrals())
+    return;
+
+  // Set timer
+  Timer timer("Assemble exterior facets");
+
+  // Extract mesh
+  const Mesh& mesh = a.mesh();
+
+  // Form rank
+  const std::size_t form_rank = ufc.form.rank();
+
+  // Collect pointers to dof maps
+  std::vector<const GenericDofMap*> dofmaps;
+  for (std::size_t i = 0; i < form_rank; ++i)
+    dofmaps.push_back(a.function_space(i)->dofmap().get());
+
+  // Vector to hold dof map for a cell
+  std::vector<const std::vector<dolfin::la_index>* > dofs(form_rank);
+
+  // Exterior facet integral
+  const ufc::exterior_facet_integral* integral
+    = ufc.default_exterior_facet_integral.get();
+
+  // Check whether integral is domain-dependent
+  bool use_domains = domains && !domains->empty();
+
+  // Compute facets and facet - cell connectivity if not already computed
+  const std::size_t D = mesh.topology().dim();
+  mesh.init(D - 1);
+  mesh.init(D - 1, D);
+  dolfin_assert(mesh.ordered());
+
+  // Assemble over exterior facets (the cells of the boundary)
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  Progress p(AssemblerBase::progress_message(A.rank(), "exterior facets"),
+             mesh.num_facets());
+  for (FacetIterator facet(mesh); !facet.end(); ++facet)
+  {
+    // Only consider exterior facets
+    if (!facet->exterior())
+    {
+      p++;
+      continue;
+    }
+
+    // Get integral for sub domain (if any)
+    if (use_domains)
+      integral = ufc.get_exterior_facet_integral((*domains)[*facet]);
+
+    // Skip integral if zero
+    if (!integral)
+      continue;
+
+    // Get mesh cell to which mesh facet belongs (pick first, there is only one)
+    dolfin_assert(facet->num_entities(D) == 1);
+    Cell mesh_cell(mesh, facet->entities(D)[0]);
+
+    // Get local index of facet with respect to the cell
+    const std::size_t local_facet = mesh_cell.index(*facet);
+
+    // Update UFC cell
+    mesh_cell.get_cell_data(ufc_cell, local_facet);
+    mesh_cell.get_vertex_coordinates(vertex_coordinates);
+
+    // Update UFC object
+    ufc.update(mesh_cell, vertex_coordinates, ufc_cell,
+               integral->enabled_coefficients());
+
+    // Get local-to-global dof maps for cell
+    for (std::size_t i = 0; i < form_rank; ++i)
+      dofs[i] = &(dofmaps[i]->cell_dofs(mesh_cell.index()));
+
+    // Tabulate exterior facet tensor
+    integral->tabulate_tensor(ufc.A.data(),
+                              ufc.w(),
+                              vertex_coordinates.data(),
+                              local_facet,
+                              ufc_cell.orientation);
+
+    // Add entries to global tensor
+    add_to_global_tensor(A, ufc.A, dofs);
+
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
+void Assembler::assemble_interior_facets(GenericTensor& A, const Form& a,
+                                      UFC& ufc,
+                                      const MeshFunction<std::size_t>* domains,
+                                      std::vector<double>* values)
+{
+  // Skip assembly if there are no interior facet integrals
+  if (!ufc.form.has_interior_facet_integrals())
+    return;
+
+  not_working_in_parallel("Assembly over interior facets");
+
+  // Set timer
+  Timer timer("Assemble interior facets");
+
+  // Extract mesh and coefficients
+  const Mesh& mesh = a.mesh();
+
+  // Form rank
+  const std::size_t form_rank = ufc.form.rank();
+
+  // Collect pointers to dof maps
+  std::vector<const GenericDofMap*> dofmaps;
+  for (std::size_t i = 0; i < form_rank; ++i)
+    dofmaps.push_back(a.function_space(i)->dofmap().get());
+
+  // Vector to hold dofs for cells, and a vector holding pointers to same
+  std::vector<std::vector<dolfin::la_index> > macro_dofs(form_rank);
+  std::vector<const std::vector<dolfin::la_index>* > macro_dof_ptrs(form_rank);
+  for (std::size_t i = 0; i < form_rank; i++)
+    macro_dof_ptrs[i] = &macro_dofs[i];
+
+  // Interior facet integral
+  const ufc::interior_facet_integral* integral
+    = ufc.default_interior_facet_integral.get();
+
+  // Check whether integral is domain-dependent
+  bool use_domains = domains && !domains->empty();
+
+  // Compute facets and facet - cell connectivity if not already computed
+  const std::size_t D = mesh.topology().dim();
+  mesh.init(D - 1);
+  mesh.init(D - 1, D);
+  dolfin_assert(mesh.ordered());
+
+  // Get interior facet directions (if any)
+  const std::vector<std::size_t>* facet_orientation = NULL;
+  if (mesh.data().exists("facet_orientation", D - 1))
+    facet_orientation = &(mesh.data().array("facet_orientation", D - 1));
+
+  if (facet_orientation && facet_orientation->size() != mesh.num_facets())
+  {
+    dolfin_error("Assembler.cpp",
+                 "assemble form over interior facets",
+                 "Expecting facet orientation to be defined on facets");
+  }
+
+  // Assemble over interior facets (the facets of the mesh)
+  ufc::cell ufc_cell[2];
+  std::vector<double> vertex_coordinates[2];
+  Progress p(AssemblerBase::progress_message(A.rank(), "interior facets"),
+             mesh.num_facets());
+  for (FacetIterator facet(mesh); !facet.end(); ++facet)
+  {
+    // Only consider interior facets
+    if (facet->exterior())
+    {
+      p++;
+      continue;
+    }
+
+    // Get integral for sub domain (if any)
+    if (use_domains)
+      integral = ufc.get_interior_facet_integral((*domains)[*facet]);
+
+    // Skip integral if zero
+    if (!integral)
+      continue;
+
+    // Get cells incident with facet
+    std::pair<const Cell, const Cell>
+      cells = facet->adjacent_cells(facet_orientation);
+    const Cell& cell0 = cells.first;
+    const Cell& cell1 = cells.second;
+
+    // Get local index of facet with respect to each cell
+    std::size_t local_facet0 = cell0.index(*facet);
+    std::size_t local_facet1 = cell1.index(*facet);
+
+    // Update to current pair of cells
+    cell0.get_cell_data(ufc_cell[0], local_facet0);
+    cell0.get_vertex_coordinates(vertex_coordinates[0]);
+    cell1.get_cell_data(ufc_cell[1], local_facet1);
+    cell1.get_vertex_coordinates(vertex_coordinates[1]);
+
+    ufc.update(cell0, vertex_coordinates[0], ufc_cell[0],
+               cell1, vertex_coordinates[1], ufc_cell[1],
+               integral->enabled_coefficients());
+
+    // Tabulate dofs for each dimension on macro element
+    for (std::size_t i = 0; i < form_rank; i++)
+    {
+      // Get dofs for each cell
+      const std::vector<dolfin::la_index>& cell_dofs0
+        = dofmaps[i]->cell_dofs(cell0.index());
+      const std::vector<dolfin::la_index>& cell_dofs1
+        = dofmaps[i]->cell_dofs(cell1.index());
+
+      // Create space in macro dof vector
+      macro_dofs[i].resize(cell_dofs0.size() + cell_dofs1.size());
+
+      // Copy cell dofs into macro dof vector
+      std::copy(cell_dofs0.begin(), cell_dofs0.end(),
+                macro_dofs[i].begin());
+      std::copy(cell_dofs1.begin(), cell_dofs1.end(),
+                macro_dofs[i].begin() + cell_dofs0.size());
+    }
+
+    // Tabulate interior facet tensor on macro element
+    integral->tabulate_tensor(ufc.macro_A.data(),
+                              ufc.macro_w(),
+                              vertex_coordinates[0].data(),
+                              vertex_coordinates[1].data(),
+                              local_facet0,
+                              local_facet1,
+                              ufc_cell[0].orientation,
+                              ufc_cell[1].orientation);
+
+    // Add entries to global tensor
+    add_to_global_tensor(A, ufc.macro_A, macro_dof_ptrs);
+
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
+void Assembler::add_to_global_tensor(GenericTensor& A,
+                                     std::vector<double>& cell_tensor,
+                                     std::vector<const std::vector<dolfin::la_index>* >& dofs)
+{
+  A.add(&cell_tensor[0], dofs);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/Assembler.h b/dolfin/fem/Assembler.h
new file mode 100644
index 0000000..3e4f74e
--- /dev/null
+++ b/dolfin/fem/Assembler.h
@@ -0,0 +1,104 @@
+// Copyright (C) 2007-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2007-2008
+// Modified by Ola Skavhaug 2008
+// Modified by Joachim B Haga 2012
+//
+// First added:  2007-01-17
+// Last changed: 2013-09-19
+
+#ifndef __ASSEMBLER_H
+#define __ASSEMBLER_H
+
+#include <vector>
+#include "AssemblerBase.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericTensor;
+  class Form;
+  class UFC;
+  template<typename T> class MeshFunction;
+
+  /// This class provides automated assembly of linear systems, or
+  /// more generally, assembly of a sparse tensor from a given
+  /// variational form.
+  ///
+  /// Subdomains for cells and facets may be specified by assigning
+  /// subdomain indicators specified by _MeshFunction_ to the _Form_
+  /// being assembled:
+  ///
+  ///    .. code-block:: c++
+  ///
+  ///        form.dx = cell_domains
+  ///        form.ds = exterior_facet_domains
+  ///        form.dS = interior_facet_domains
+
+  class Assembler : public AssemblerBase
+  {
+  public:
+
+    /// Constructor
+    Assembler() {}
+
+    /// Assemble tensor from given form
+    ///
+    /// *Arguments*
+    ///     A (_GenericTensor_)
+    ///         The tensor to assemble.
+    ///     a (_Form_)
+    ///         The form to assemble the tensor from.
+    void assemble(GenericTensor& A, const Form& a);
+
+    /// Assemble tensor from given form over cells. This function is
+    /// provided for users who wish to build a customized assembler.
+    void assemble_cells(GenericTensor& A, const Form& a, UFC& ufc,
+                        const MeshFunction<std::size_t>* domains,
+                        std::vector<double>* values);
+
+    /// Assemble tensor from given form over exterior facets. This
+    /// function is provided for users who wish to build a customized
+    /// assembler.
+    void assemble_exterior_facets(GenericTensor& A, const Form& a,
+                                  UFC& ufc,
+                                  const MeshFunction<std::size_t>* domains,
+                                  std::vector<double>* values);
+
+    /// Assemble tensor from given form over interior facets. This
+    /// function is provided for users who wish to build a customized
+    /// assembler.
+    void assemble_interior_facets(GenericTensor& A, const Form& a,
+                                  UFC& ufc,
+                                  const MeshFunction<std::size_t>* domains,
+                                  std::vector<double>* values);
+
+  protected:
+
+    /// Add cell tensor to global tensor. Hook to allow the SymmetricAssembler
+    /// to split the cell tensor into symmetric/antisymmetric parts.
+    void add_to_global_tensor(GenericTensor& A,
+                              std::vector<double>& cell_tensor,
+                              std::vector<const std::vector<dolfin::la_index>* >& dofs);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/AssemblerBase.cpp b/dolfin/fem/AssemblerBase.cpp
new file mode 100644
index 0000000..0dcabdf
--- /dev/null
+++ b/dolfin/fem/AssemblerBase.cpp
@@ -0,0 +1,273 @@
+// Copyright (C) 2007-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2007-2010
+// Modified by Ola Skavhaug, 2007-2009
+// Modified by Kent-Andre Mardal, 2008
+// Modified by Johannes Ring, 2012
+//
+// First added:  2007-01-17
+// Last changed: 2013-09-19
+
+#include <memory>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/la/GenericMatrix.h>
+#include <dolfin/la/GenericTensor.h>
+#include <dolfin/la/SparsityPattern.h>
+#include <dolfin/la/GenericLinearAlgebraFactory.h>
+#include <dolfin/la/TensorLayout.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+
+#include "FiniteElement.h"
+#include "Form.h"
+#include "GenericDofMap.h"
+#include "SparsityPatternBuilder.h"
+#include "AssemblerBase.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void AssemblerBase::init_global_tensor(GenericTensor& A, const Form& a)
+{
+  dolfin_assert(a.ufc_form());
+
+  // Get dof maps
+  std::vector<const GenericDofMap*> dofmaps;
+  for (std::size_t i = 0; i < a.rank(); ++i)
+    dofmaps.push_back(a.function_space(i)->dofmap().get());
+
+  if (A.empty())
+  {
+    Timer t0("Build sparsity");
+
+    // Create layout for initialising tensor
+    std::shared_ptr<TensorLayout> tensor_layout;
+    tensor_layout = A.factory().create_layout(a.rank());
+    dolfin_assert(tensor_layout);
+
+    // Get dimensions
+    std::vector<std::size_t> global_dimensions;
+    std::vector<std::pair<std::size_t, std::size_t> > local_range;
+    std::vector<std::size_t> block_sizes;
+    for (std::size_t i = 0; i < a.rank(); i++)
+    {
+      dolfin_assert(dofmaps[i]);
+      global_dimensions.push_back(dofmaps[i]->global_dimension());
+      local_range.push_back(dofmaps[i]->ownership_range());
+      block_sizes.push_back(dofmaps[i]->block_size);
+    }
+
+    // Set block size for sparsity graphs
+    std::size_t block_size = 1;
+    if (a.rank() == 2)
+    {
+      const std::vector<std::size_t> _bs(a.rank(), dofmaps[0]->block_size);
+      block_size = (block_sizes == _bs) ? dofmaps[0]->block_size : 1;
+    }
+
+    // Initialise tensor layout
+    tensor_layout->init(a.mesh().mpi_comm(), global_dimensions, block_size,
+                        local_range);
+
+    // Build sparsity pattern if required
+    if (tensor_layout->sparsity_pattern())
+    {
+      GenericSparsityPattern& pattern = *tensor_layout->sparsity_pattern();
+      SparsityPatternBuilder::build(pattern,
+                                a.mesh(), dofmaps,
+                                a.ufc_form()->has_cell_integrals(),
+                                a.ufc_form()->has_interior_facet_integrals(),
+                                a.ufc_form()->has_exterior_facet_integrals(),
+                                keep_diagonal);
+    }
+    t0.stop();
+
+    // Initialize tensor
+    Timer t1("Init tensor");
+    A.init(*tensor_layout);
+    t1.stop();
+
+    // Insert zeros on the diagonal as diagonal entries may be prematurely
+    // optimised away by the linear algebra backend when calling
+    // GenericMatrix::apply, e.g. PETSc does this then errors when matrices
+    // have no diagonal entry inserted.
+    if (A.rank() == 2 && keep_diagonal)
+    {
+      // Down cast to GenericMatrix
+      GenericMatrix& _matA = A.down_cast<GenericMatrix>();
+
+      // Loop over rows and insert 0.0 on the diagonal
+      const double block = 0.0;
+      const std::pair<std::size_t, std::size_t> row_range = A.local_range(0);
+      const std::size_t range = std::min(row_range.second, A.size(1));
+      for (std::size_t i = row_range.first; i < range; i++)
+      {
+        dolfin::la_index _i = i;
+        _matA.set(&block, 1, &_i, 1, &_i);
+      }
+      A.apply("flush");
+    }
+
+    // Delete sparsity pattern
+    Timer t2("Delete sparsity");
+    t2.stop();
+  }
+  else
+  {
+    // If tensor is not reset, check that dimensions are correct
+    for (std::size_t i = 0; i < a.rank(); ++i)
+    {
+      if (A.size(i) != dofmaps[i]->global_dimension())
+      {
+        dolfin_error("AssemblerBase.cpp",
+                     "assemble form",
+                     "Reset of tensor in assembly not requested, but dim %d of tensor does not match form", i);
+      }
+    }
+  }
+
+  if (!add_values)
+    A.zero();
+}
+//-----------------------------------------------------------------------------
+void AssemblerBase::check(const Form& a)
+{
+  dolfin_assert(a.ufc_form());
+
+  // Check the form
+  a.check();
+
+  // Extract mesh and coefficients
+  const Mesh& mesh = a.mesh();
+  const std::vector<std::shared_ptr<const GenericFunction> >
+    coefficients = a.coefficients();
+
+  // Check that we get the correct number of coefficients
+  if (coefficients.size() != a.num_coefficients())
+  {
+    dolfin_error("AssemblerBase.cpp",
+                 "assemble form",
+                 "Incorrect number of coefficients (got %d but expecting %d)",
+                 coefficients.size(), a.num_coefficients());
+  }
+
+  // Check that all coefficients have valid value dimensions
+  for (std::size_t i = 0; i < coefficients.size(); ++i)
+  {
+    if (!coefficients[i])
+    {
+      dolfin_error("AssemblerBase.cpp",
+                   "assemble form",
+                   "Coefficient number %d (\"%s\") has not been set",
+                   i, a.coefficient_name(i).c_str());
+    }
+
+    // unique_ptr deletes its object when it exits its scope
+    std::unique_ptr<ufc::finite_element> fe(a.ufc_form()->create_finite_element(i + a.rank()));
+
+    // Checks out-commented since they only work for Functions, not Expressions
+    const std::size_t r = coefficients[i]->value_rank();
+    const std::size_t fe_r = fe->value_rank();
+    if (fe_r != r)
+    {
+      dolfin_error("AssemblerBase.cpp",
+                   "assemble form",
+                   "Invalid value rank for coefficient %d (got %d but expecting %d). \
+You might have forgotten to specify the value rank correctly in an Expression subclass", i, r, fe_r);
+    }
+
+    for (std::size_t j = 0; j < r; ++j)
+    {
+      const std::size_t dim = coefficients[i]->value_dimension(j);
+      const std::size_t fe_dim = fe->value_dimension(j);
+      if (dim != fe_dim)
+      {
+        dolfin_error("AssemblerBase.cpp",
+                     "assemble form",
+                     "Invalid value dimension %d for coefficient %d (got %d but expecting %d). \
+You might have forgotten to specify the value dimension correctly in an Expression subclass", j, i, dim, fe_dim);
+      }
+    }
+  }
+
+  // Check that the cell dimension matches the mesh dimension
+  if (a.rank() + a.ufc_form()->num_coefficients() > 0)
+  {
+    std::unique_ptr<ufc::finite_element> element(a.ufc_form()->create_finite_element(0));
+    dolfin_assert(element);
+    if (mesh.type().cell_type() == CellType::interval && element->cell_shape() != ufc::interval)
+    {
+      dolfin_error("AssemblerBase.cpp",
+                   "assemble form",
+                   "Mesh cell type (intervals) does not match cell type of form");
+    }
+    if (mesh.type().cell_type() == CellType::triangle && element->cell_shape() != ufc::triangle)
+    {
+      dolfin_error("AssemblerBase.cpp",
+                   "assemble form",
+                   "Mesh cell type (triangles) does not match cell type of form");
+    }
+    if (mesh.type().cell_type() == CellType::tetrahedron && element->cell_shape() != ufc::tetrahedron)
+    {
+      dolfin_error("AssemblerBase.cpp",
+                   "assemble form",
+                   "Mesh cell type (tetrahedra) does not match cell type of form");
+    }
+  }
+
+  // Check that the mesh is ordered
+  if (!mesh.ordered())
+  {
+    dolfin_error("AssemblerBase.cpp",
+                 "assemble form",
+                 "Mesh is not correctly ordered. Consider calling mesh.order()");
+  }
+}
+//-----------------------------------------------------------------------------
+std::string AssemblerBase::progress_message(std::size_t rank,
+                                            std::string integral_type)
+{
+  std::stringstream s;
+  s << "Assembling ";
+
+  switch (rank)
+  {
+  case 0:
+    s << "scalar value over ";
+    break;
+  case 1:
+    s << "vector over ";
+    break;
+  case 2:
+    s << "matrix over ";
+    break;
+  default:
+    s << "rank " << rank << " tensor over ";
+    break;
+  }
+
+  s << integral_type;
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/AssemblerBase.h b/dolfin/fem/AssemblerBase.h
new file mode 100644
index 0000000..349feb0
--- /dev/null
+++ b/dolfin/fem/AssemblerBase.h
@@ -0,0 +1,154 @@
+// Copyright (C) 2007-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2007-2008.
+// Modified by Ola Skavhaug, 2008.
+//
+// First added:  2007-01-17
+// Last changed: 2013-09-19
+
+#ifndef __ASSEMBLER_BASE_H
+#define __ASSEMBLER_BASE_H
+
+#include <string>
+#include <utility>
+#include <vector>
+#include <dolfin/common/types.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericTensor;
+  class Form;
+
+  /// This class provides type compatible with boolean used for announcing
+  /// deprecation warning for deprecated bool member variable
+
+  // TODO: Remove when not needed.
+  class bool_deprecated
+  {
+  public:
+
+    bool_deprecated(const bool& value, const std::string& what,
+                    const std::string& ver_deprecated,
+                    const std::string& ver_removed,
+                    const std::string& reason)
+      : _value(value), _what(what),
+        _ver_deprecated(ver_deprecated),
+        _ver_removed(ver_removed), _reason(reason)
+    { }
+
+    bool_deprecated(const bool_deprecated& that)
+      : _value(that._value), _what(that._what),
+        _ver_deprecated(that._ver_deprecated),
+        _ver_removed(that._ver_removed), _reason(that._reason)
+    { }
+
+    ~bool_deprecated() { }
+
+    bool_deprecated& operator=(const bool_deprecated& that)
+    { 
+      _value          = that._value;
+      _what           = that._what;
+      _ver_deprecated = that._ver_deprecated;
+      _ver_removed    = that._ver_removed;
+      _reason         = that._reason;
+      return *this;
+    }
+
+    bool_deprecated& operator=(const bool& value)
+    {
+      deprecation(_what,
+                  _ver_deprecated,
+                  _ver_removed,
+                  _reason);
+      _value = value;
+      return *this;
+    }
+
+    operator bool() const { return _value; }
+
+  private:
+
+    bool _value;
+
+    std::string _what;
+    std::string _ver_deprecated;
+    std::string _ver_removed;
+    std::string _reason;
+
+  };
+
+  /// This class provides some common functions used in
+  /// assembler classes.
+
+  class AssemblerBase
+  {
+  public:
+
+    // Check form
+    AssemblerBase() :
+      reset_sparsity(true, "Parameter reset_sparsity of assembler",
+                     "1.4", "1.5", "Parameter reset_sparsity of assembler"
+                     " is no longer used. Tensor is reset iff empty()."),
+      add_values(false),
+      finalize_tensor(true),
+      keep_diagonal(false) {}
+
+    /// reset_sparsity (bool)
+    ///     Deprecated. Sparsity pattern of the tensor is reset
+    ///     iff the tensor is empty().
+    bool_deprecated reset_sparsity;
+
+    /// add_values (bool)
+    ///     Default value is false.
+    ///     This controls whether values are added to the given
+    ///     tensor or if it is zeroed prior to assembly.
+    bool add_values;
+
+    /// finalize_tensor (bool)
+    ///     Default value is true.
+    ///     This controls whether the assembler finalizes the
+    ///     given tensor after assembly is completed by calling
+    ///     A.apply().
+    bool finalize_tensor;
+
+    /// keep_diagonal (bool)
+    ///     Default value is false.
+    ///     This controls whether the assembler enures that a diagonal
+    ///     entry exists in an assembled matrix. It may be removed
+    ///     if the matrix is finalised.
+    bool keep_diagonal;
+
+    // Initialize global tensor
+    void init_global_tensor(GenericTensor& A, const Form& a);
+
+  protected:
+
+    // Check form
+    static void check(const Form& a);
+
+    // Pretty-printing for progress bar
+    static std::string progress_message(std::size_t rank, std::string integral_type);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/BasisFunction.h b/dolfin/fem/BasisFunction.h
new file mode 100644
index 0000000..e4bcfc6
--- /dev/null
+++ b/dolfin/fem/BasisFunction.h
@@ -0,0 +1,124 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-01-01
+// Last changed: 2013-03-04
+
+#ifndef __BASIS_FUNCTION_H
+#define __BASIS_FUNCTION_H
+
+#include <ufc.h>
+#include <dolfin/common/types.h>
+#include <dolfin/fem/FiniteElement.h>
+
+namespace dolfin
+{
+
+  /// This class represents a finite element basis function. It can be
+  /// used for computation of basis function values and derivatives.
+  ///
+  /// Evaluation of basis functions is also possible through the use
+  /// of the functions ``evaluate_basis`` and ``evaluate_basis_derivatives``
+  /// available in the _FiniteElement_ class. The BasisFunction class
+  /// relies on these functions for evaluation but also implements the
+  /// ufc::function interface which allows evaluate_dof to be
+  /// evaluated for a basis function (on a possibly different
+  /// element).
+
+  class BasisFunction : public ufc::function
+  {
+  public:
+
+    /// Create basis function with given index on element on given cell
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The index of the basis function.
+    ///     element (_FiniteElement_)
+    ///         The element to create basis function on.
+    ///     cell (ufc::cell)
+    ///         The cell.
+    BasisFunction(std::size_t index, const FiniteElement& element,
+                  const std::vector<double>& vertex_coordinates)
+      : _index(index), _element(element),
+      _vertex_coordinates(vertex_coordinates) {}
+
+    /// Destructor
+    ~BasisFunction() {}
+
+    /// Evaluate basis function at given point
+    ///
+    /// *Arguments*
+    ///     values (double)
+    ///         The values of the function at the point.
+    ///     x (double)
+    ///         The coordinates of the point.
+    void eval(double* values, const double* x) const
+    {
+      // Note: assuming cell_orientation = 0
+      _element.evaluate_basis(_index, values, x, _vertex_coordinates.data(),
+                              0);
+    }
+
+    /// Evaluate all order n derivatives at given point
+    ///
+    /// *Arguments*
+    ///     values (double)
+    ///         The values of derivatives at the point.
+    ///     x (double)
+    ///         The coordinates of the point.
+    ///     n (std::size_t)
+    ///         The order of derivation.
+    void eval_derivatives(double* values, const double* x, std::size_t n) const
+    {
+      // Note: assuming cell_orientation = 0
+      _element.evaluate_basis_derivatives(_index, n, values, x,
+                                          _vertex_coordinates.data(), 0);
+    }
+
+    //--- Implementation of ufc::function interface ---
+
+    /// Evaluate function at given point in cell
+    ///
+    /// *Arguments*
+    ///     values (double)
+    ///         The values of the function at the point..
+    ///     coordinates (double)
+    ///         The coordinates of the point.
+    ///     cell (ufc::cell)
+    ///         The cell.
+    void evaluate(double* values,
+                  const double* coordinates,
+                  const ufc::cell& cell) const
+    { eval(values, coordinates); }
+
+  private:
+
+    // The index
+    std::size_t _index;
+
+    // The finite element
+    const FiniteElement& _element;
+
+    // Cell vertex coordinates
+    const std::vector<double> _vertex_coordinates;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/CCFEMAssembler.cpp b/dolfin/fem/CCFEMAssembler.cpp
new file mode 100644
index 0000000..fed2a61
--- /dev/null
+++ b/dolfin/fem/CCFEMAssembler.cpp
@@ -0,0 +1,195 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-12
+// Last changed: 2013-09-25
+
+#include <dolfin/function/CCFEMFunctionSpace.h>
+
+#include <dolfin/la/GenericTensor.h>
+#include <dolfin/la/GenericMatrix.h>
+#include <dolfin/la/GenericLinearAlgebraFactory.h>
+#include <dolfin/la/TensorLayout.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Mesh.h>
+
+#include "SparsityPatternBuilder.h"
+#include "UFC.h"
+#include "Form.h"
+#include "CCFEMForm.h"
+#include "CCFEMDofMap.h"
+#include "CCFEMAssembler.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CCFEMAssembler::CCFEMAssembler()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void CCFEMAssembler::assemble(GenericTensor& A, const CCFEMForm& a)
+{
+  begin(PROGRESS, "Assembling tensor over CCFEM function space.");
+
+  // Initialize global tensor
+  init_global_tensor(A, a);
+
+  // Assemble over cells
+  assemble_cells(A, a);
+
+  // Finalize assembly of global tensor
+  A.apply("add");
+
+  end();
+}
+//-----------------------------------------------------------------------------
+void CCFEMAssembler::assemble_cells(GenericTensor& A, const CCFEMForm& a)
+{
+  // Note: This implementation does not yet handle subdomains.
+
+  log(PROGRESS, "Assembling CCFEM form over cells.");
+
+  // Form rank
+  const std::size_t form_rank = a.rank();
+
+  // Vector to hold dof map for a cell
+  std::vector<const std::vector<dolfin::la_index>* > dofs(form_rank);
+
+  // Collect pointers to dof maps
+  std::vector<const CCFEMDofMap*> dofmaps;
+  for (std::size_t i = 0; i < form_rank; i++)
+    dofmaps.push_back(a.function_space(i)->dofmap().get());
+
+  // Iterate over parts
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  for (std::size_t part = 0; part < a.num_parts(); part++)
+  {
+    // Get form for current part
+    const Form& a_part = *a.part(part);
+
+    // Set current part for dofmaps
+    for (std::size_t i = 0; i < form_rank; i++)
+      dofmaps[i]->set_current_part(part);
+
+    // Create data structure for local assembly data
+    UFC ufc(a_part);
+
+    // Extract mesh
+    const Mesh& mesh = a_part.mesh();
+
+    // Skip assembly if there are no cell integrals
+    if (!ufc.form.has_cell_integrals())
+      return;
+
+    // Cell integral
+    ufc::cell_integral* integral = ufc.default_cell_integral.get();
+
+    // Iterate over cells
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      // Update to current cell
+      cell->get_vertex_coordinates(vertex_coordinates);
+      cell->get_cell_data(ufc_cell);
+      ufc.update(*cell, vertex_coordinates, ufc_cell,
+                 integral->enabled_coefficients());
+
+      // Get local-to-global dof maps for cell
+      for (std::size_t i = 0; i < form_rank; ++i)
+        dofs[i] = &(dofmaps[i]->cell_dofs(cell->index()));
+
+      // Tabulate cell tensor
+      integral->tabulate_tensor(ufc.A.data(), ufc.w(),
+                                vertex_coordinates.data(),
+                                ufc_cell.orientation);
+
+      // Add entries to global tensor
+      A.add(ufc.A.data(), dofs);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void CCFEMAssembler::init_global_tensor(GenericTensor& A, const CCFEMForm& a)
+{
+  log(PROGRESS, "Initializing global tensor.");
+
+  // This function initializes the big system matrix corresponding to
+  // all dofs (including inactive dofs) on all parts of the CCFEM
+  // function space.
+
+  // Create layout for initializing tensor
+  std::shared_ptr<TensorLayout> tensor_layout;
+  tensor_layout = A.factory().create_layout(a.rank());
+  dolfin_assert(tensor_layout);
+
+  // Get dimensions
+  std::vector<std::size_t> global_dimensions;
+  std::vector<std::pair<std::size_t, std::size_t> > local_ranges;
+  std::vector<std::size_t> block_sizes;
+  for (std::size_t i = 0; i < a.rank(); i++)
+  {
+    std::shared_ptr<const CCFEMFunctionSpace> V = a.function_space(i);
+    dolfin_assert(V);
+
+    global_dimensions.push_back(V->dim());
+    local_ranges.push_back(std::make_pair(0, V->dim())); // FIXME: not parallel
+  }
+
+  // Set block size
+  const std::size_t block_size = 1;
+
+  // Initialise tensor layout
+  tensor_layout->init(MPI_COMM_WORLD,
+                      global_dimensions, block_size, local_ranges);
+
+  // Build sparsity pattern if required
+  if (tensor_layout->sparsity_pattern())
+  {
+    GenericSparsityPattern& pattern = *tensor_layout->sparsity_pattern();
+    SparsityPatternBuilder::build_ccfem(pattern, a);
+  }
+
+  // Initialize tensor
+  A.init(*tensor_layout);
+
+  // Insert zeros on the diagonal as diagonal entries may be prematurely
+  // optimised away by the linear algebra backend when calling
+  // GenericMatrix::apply, e.g. PETSc does this then errors when matrices
+  // have no diagonal entry inserted.
+  if (A.rank() == 2)
+  {
+    // Down cast to GenericMatrix
+    GenericMatrix& _matA = A.down_cast<GenericMatrix>();
+
+    // Loop over rows and insert 0.0 on the diagonal
+    const double block = 0.0;
+    const std::pair<std::size_t, std::size_t> row_range = A.local_range(0);
+    const std::size_t range = std::min(row_range.second, A.size(1));
+    for (std::size_t i = row_range.first; i < range; i++)
+    {
+      dolfin::la_index _i = i;
+      _matA.set(&block, 1, &_i, 1, &_i);
+    }
+    A.apply("flush");
+  }
+
+  // Set tensor to zero
+  A.zero();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/CCFEMAssembler.h b/dolfin/fem/CCFEMAssembler.h
new file mode 100644
index 0000000..2cc31a1
--- /dev/null
+++ b/dolfin/fem/CCFEMAssembler.h
@@ -0,0 +1,65 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-12
+// Last changed: 2013-09-24
+
+#ifndef __CCFEM_ASSEMBLER_H
+#define __CCFEM_ASSEMBLER_H
+
+#include "AssemblerBase.h"
+#include "Assembler.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericTensor;
+  class CCFEMForm;
+
+  /// This class implements functionality for finite element assembly
+  /// over cut and composite finite element (CCFEM) function spaces.
+
+  class CCFEMAssembler
+  {
+  public:
+
+    /// Constructor
+    CCFEMAssembler();
+
+    /// Assemble tensor from given form
+    ///
+    /// *Arguments*
+    ///     A (_GenericTensor_)
+    ///         The tensor to assemble.
+    ///     a (_Form_)
+    ///         The form to assemble the tensor from.
+    void assemble(GenericTensor& A, const CCFEMForm& a);
+
+  private:
+
+    // Assemble over cells
+    void assemble_cells(GenericTensor& A, const CCFEMForm& a);
+
+    // Initialize global tensor
+    void init_global_tensor(GenericTensor& A, const CCFEMForm& a);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/CCFEMDofMap.cpp b/dolfin/fem/CCFEMDofMap.cpp
new file mode 100644
index 0000000..3c526f6
--- /dev/null
+++ b/dolfin/fem/CCFEMDofMap.cpp
@@ -0,0 +1,314 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-19
+// Last changed: 2014-02-03
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/CCFEMFunctionSpace.h>
+#include "CCFEMDofMap.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CCFEMDofMap::CCFEMDofMap()
+{
+  clear();
+}
+//-----------------------------------------------------------------------------
+CCFEMDofMap::CCFEMDofMap(const CCFEMDofMap& dofmap)
+{
+  _global_dimension = dofmap._global_dimension;
+  _dofmaps = dofmap._dofmaps;
+  _current_part = dofmap._current_part;
+}
+//-----------------------------------------------------------------------------
+CCFEMDofMap::~CCFEMDofMap()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMDofMap::num_parts() const
+{
+  return _dofmaps.size();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericDofMap> CCFEMDofMap::part(std::size_t i) const
+{
+  dolfin_assert(i < _dofmaps.size());
+  return _dofmaps[i];
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::set_current_part(std::size_t part) const
+{
+  dolfin_assert(part < num_parts());
+  _current_part = part; // mutable
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::add(std::shared_ptr<const GenericDofMap> dofmap)
+{
+  _dofmaps.push_back(dofmap);
+  log(PROGRESS, "Added dofmap to CCFEM dofmap; dofmap has %d part(s).",
+      _dofmaps.size());
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::add(const GenericDofMap& dofmap)
+{
+  add(reference_to_no_delete_pointer(dofmap));
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::build(const CCFEMFunctionSpace& function_space)
+{
+  // Compute global dimension
+  begin(PROGRESS, "Computing total dimension.");
+  _global_dimension = 0;
+  for (std::size_t i = 0; i < num_parts(); i++)
+  {
+    const std::size_t d = _dofmaps[i]->global_dimension();
+    _global_dimension += d;
+    log(PROGRESS, "dim(V_%d) = %d", i, d);
+  }
+  end();
+  log(PROGRESS, "Total global dimension is %d.", _global_dimension);
+
+  // For now, we build the simplest possible dofmap by reusing the
+  // dofmaps for each part and adding offsets in between.
+
+  // Build dofmap
+  _dofmap.clear();
+  dolfin::la_index offset = 0;
+  for (std::size_t part = 0; part < num_parts(); part++)
+  {
+    log(PROGRESS, "Computing dofs for part %d.", part);
+
+    dolfin_assert(_dofmaps[part]);
+    std::vector<std::vector<dolfin::la_index> > dofmap_part;
+
+    // Get mesh on current part
+    const Mesh& mesh = *function_space.part(part)->mesh();
+
+    // Add all dofs for current part with offset
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      // Get dofs from dofmap on part
+      const std::vector<dolfin::la_index>& dofs
+        = _dofmaps[part]->cell_dofs(cell->index());
+
+      // Compute new dofs by adding offset
+      std::vector<dolfin::la_index> new_dofs;
+      for (std::size_t i = 0; i < dofs.size(); i++)
+        new_dofs.push_back(dofs[i] + offset);
+
+      // Store dofs for cell
+      dofmap_part.push_back(new_dofs);
+    }
+
+    // Store dofs for part
+    _dofmap.push_back(dofmap_part);
+
+    // Increase offset
+    offset += _dofmaps[part]->global_dimension();
+  }
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::clear()
+{
+  _global_dimension = 0;
+  _dofmaps.clear();
+  _current_part = 0;
+  _dofmap.clear();
+}
+//-----------------------------------------------------------------------------
+// Implementation of the GenericDofMap interface
+//-----------------------------------------------------------------------------
+bool CCFEMDofMap::is_view() const
+{
+  return false;
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMDofMap::global_dimension() const
+{
+  return _global_dimension;
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMDofMap::cell_dimension(std::size_t index) const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->cell_dimension(index);
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMDofMap::max_cell_dimension() const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->max_cell_dimension();
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMDofMap::num_entity_dofs(std::size_t dim) const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->num_entity_dofs(dim);
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMDofMap::geometric_dimension() const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->geometric_dimension();
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMDofMap::num_facet_dofs() const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->num_facet_dofs();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Restriction> CCFEMDofMap::restriction() const
+{
+  // FIXME: Restrictions are unhandled but we need to return something
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->restriction();
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t> CCFEMDofMap::ownership_range() const
+{
+  // FIXME: Does not run in parallel
+  return std::make_pair<std::size_t, std::size_t>(0, global_dimension());
+}
+//-----------------------------------------------------------------------------
+const boost::unordered_map<std::size_t, unsigned int>&
+CCFEMDofMap::off_process_owner() const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->off_process_owner();
+}
+//-----------------------------------------------------------------------------
+const std::vector<dolfin::la_index>&
+CCFEMDofMap::cell_dofs(std::size_t cell_index) const
+{
+  dolfin_assert(cell_index < _dofmap[_current_part].size());
+  return _dofmap[_current_part][cell_index];
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::tabulate_facet_dofs(std::vector<std::size_t>& dofs,
+                                      std::size_t local_facet) const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->tabulate_facet_dofs(dofs, local_facet);
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::tabulate_entity_dofs(std::vector<std::size_t>& dofs,
+                                       std::size_t dim,
+                                       std::size_t local_entity) const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->tabulate_entity_dofs(dofs, dim, local_entity);
+}
+//-----------------------------------------------------------------------------
+void
+CCFEMDofMap::tabulate_coordinates(boost::multi_array<double, 2>& coordinates,
+                                  const std::vector<double>& vertex_coordinates,
+                                  const Cell& cell) const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  _dofmaps[_current_part]->tabulate_coordinates(coordinates, vertex_coordinates,
+                                                cell);
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+CCFEMDofMap::tabulate_all_coordinates(const Mesh& mesh) const
+{
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->tabulate_all_coordinates(mesh);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericDofMap> CCFEMDofMap::copy() const
+{
+  return std::shared_ptr<GenericDofMap>(new CCFEMDofMap(*this));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericDofMap>
+CCFEMDofMap::create(const Mesh& new_mesh) const
+{
+  dolfin_not_implemented();
+  return copy(); // need to return something
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericDofMap>
+CCFEMDofMap::extract_sub_dofmap(const std::vector<std::size_t>& component,
+                                const Mesh& mesh) const
+{
+  dolfin_not_implemented();
+  return copy(); // need to return something
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericDofMap>
+CCFEMDofMap::collapse(boost::unordered_map<std::size_t, std::size_t>& collapsed_map,
+                      const Mesh& mesh) const
+{
+  dolfin_not_implemented();
+  return copy(); // need to return something
+}
+//-----------------------------------------------------------------------------
+std::vector<dolfin::la_index> CCFEMDofMap::dofs() const
+{
+  dolfin_not_implemented();
+  return std::vector<dolfin::la_index>();
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::set(GenericVector& x, double value) const
+{
+  dolfin_not_implemented();
+}
+//-----------------------------------------------------------------------------
+void CCFEMDofMap::set_x(GenericVector& x, double value, std::size_t component,
+           const Mesh& mesh) const
+{
+  dolfin_not_implemented();
+}
+//-----------------------------------------------------------------------------
+const boost::unordered_map<std::size_t,
+                           std::vector<unsigned int> >& CCFEMDofMap::shared_dofs() const
+{
+  dolfin_not_implemented();
+
+  // Need to return a reference to something
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->shared_dofs();
+}
+//-----------------------------------------------------------------------------
+const std::set<std::size_t>& CCFEMDofMap::neighbours() const
+{
+  dolfin_not_implemented();
+
+  // Need to return a reference to something
+  dolfin_assert(_current_part < _dofmaps.size() && _dofmaps[_current_part]);
+  return _dofmaps[_current_part]->neighbours();
+}
+//-----------------------------------------------------------------------------
+std::string CCFEMDofMap::str(bool verbose) const
+{
+  std::stringstream s;
+  s << "<CCFEMDofMap with "
+    << num_parts()
+    << " parts and total global dimension "
+    << global_dimension()
+    << ">"
+    << std::endl;
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/CCFEMDofMap.h b/dolfin/fem/CCFEMDofMap.h
new file mode 100644
index 0000000..d0595a6
--- /dev/null
+++ b/dolfin/fem/CCFEMDofMap.h
@@ -0,0 +1,221 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-19
+// Last changed: 2013-10-22
+
+#ifndef __CCFEM_DOF_MAP_H
+#define __CCFEM_DOF_MAP_H
+
+#include "GenericDofMap.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class CCFEMFunctionSpace;
+
+  /// This class handles the mapping of degrees of freedom for CCFEM
+  /// function spaces.
+
+  class CCFEMDofMap : public GenericDofMap
+  {
+  public:
+
+    /// Constructor
+    CCFEMDofMap();
+
+    // Copy constructor
+    CCFEMDofMap(const CCFEMDofMap& dofmap);
+
+    /// Destructor
+    ~CCFEMDofMap();
+
+    /// Return the number dofmaps (parts) of the CCFEM dofmap
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The number of dofmaps (parts) of the CCFEM dofmap
+    std::size_t num_parts() const;
+
+    /// Return dofmap (part) number i
+    ///
+    /// *Returns*
+    ///     _GenericDofMap_
+    ///         Dofmap (part) number i
+    std::shared_ptr<const GenericDofMap> part(std::size_t i) const;
+
+    /// Set current part. This will make the CCFEM dofmap act as a
+    /// dofmap for the part of the CCFEM function space defined on the
+    /// current part (mesh).
+    ///
+    /// *Arguments*
+    ///     part (std::size_t)
+    ///         The number of the part.
+    void set_current_part(std::size_t part) const;
+
+    /// Add dofmap (shared pointer version)
+    ///
+    /// *Arguments*
+    ///     dofmap (_GenericDofMap_)
+    ///         The dofmap.
+    void add(std::shared_ptr<const GenericDofMap> dofmap);
+
+    /// Add dofmap (reference version)
+    ///
+    /// *Arguments*
+    ///     dofmap (_DofMap_)
+    ///         The dofmap.
+    void add(const GenericDofMap& dofmap);
+
+    /// Build CCFEM dofmap
+    void build(const CCFEMFunctionSpace& function_space);
+
+    /// Clear CCFEM dofmap
+    void clear();
+
+    //--- Implementation of GenericDofMap interface (incomplete) ---
+
+    /// True if dof map is a view into another map (is a sub-dofmap)
+    bool is_view() const;
+
+    /// Return the dimension of the global finite element function
+    /// space
+    std::size_t global_dimension() const;
+
+    /// Return the dimension of the local finite element function
+    /// space on a cell
+    std::size_t cell_dimension(std::size_t index) const;
+
+    /// Return the maximum dimension of the local finite element
+    /// function space
+    std::size_t max_cell_dimension() const;
+
+    /// Return the number of dofs for a given entity dimension
+    std::size_t num_entity_dofs(std::size_t dim) const;
+
+    /// Return the geometric dimension of the coordinates this dof map
+    // provides
+    std::size_t geometric_dimension() const;
+
+    /// Return number of facet dofs
+    std::size_t num_facet_dofs() const;
+
+    /// Restriction if any. If the dofmap is not restricted, a null
+    /// pointer is returned.
+    std::shared_ptr<const Restriction> restriction() const;
+
+    /// Return the ownership range (dofs in this range are owned by
+    /// this process)
+    std::pair<std::size_t, std::size_t> ownership_range() const;
+
+    /// Return map from nonlocal-dofs (that appear in local dof map)
+    /// to owning process
+    const boost::unordered_map<std::size_t, unsigned int>&
+      off_process_owner() const;
+
+    /// Local-to-global mapping of dofs on a cell
+    const std::vector<dolfin::la_index>&
+      cell_dofs(std::size_t cell_index) const;
+
+    /// Tabulate local-local facet dofs
+    void tabulate_facet_dofs(std::vector<std::size_t>& dofs,
+                                     std::size_t local_facet) const;
+
+    /// Tabulate the local-to-local mapping of dofs on entity
+    /// (dim, local_entity)
+    void tabulate_entity_dofs(std::vector<std::size_t>& dofs,
+				      std::size_t dim,
+                                      std::size_t local_entity) const;
+
+    /// Tabulate the coordinates of all dofs on a cell (UFC cell version)
+    void tabulate_coordinates(boost::multi_array<double, 2>& coordinates,
+                              const std::vector<double>& vertex_coordinates,
+                              const Cell& cell) const;
+
+    /// Tabulate the coordinates of all dofs owned by this
+    /// process. This function is typically used by preconditioners
+    /// that require the spatial coordinates of dofs, for example
+    /// for re-partitioning or nullspace computations. The format for
+    /// the return vector is [x0, y0, z0, x1, y1, z1, . . .].
+    std::vector<double>
+      tabulate_all_coordinates(const Mesh& mesh) const;
+
+    /// Create a copy of the dof map
+    std::shared_ptr<GenericDofMap> copy() const;
+
+    /// Create a new dof map on new mesh
+    std::shared_ptr<GenericDofMap>
+      create(const Mesh& new_mesh) const;
+
+    /// Extract sub dofmap component
+    std::shared_ptr<GenericDofMap>
+        extract_sub_dofmap(const std::vector<std::size_t>& component,
+                           const Mesh& mesh) const;
+
+    /// Create a "collapsed" a dofmap (collapses from a sub-dofmap view)
+    std::shared_ptr<GenericDofMap>
+        collapse(boost::unordered_map<std::size_t, std::size_t>& collapsed_map,
+                 const Mesh& mesh) const;
+
+    /// Return list of global dof indices on this process
+    std::vector<dolfin::la_index> dofs() const;
+
+    /// Set dof entries in vector to a specified value. Parallel
+    /// layout of vector must be consistent with dof map range. This
+    /// function is typically used to construct the null space of a
+    /// matrix operator
+    void set(GenericVector& x, double value) const;
+
+    /// Set dof entries in vector to the value*x[i], where x[i] is the
+    /// spatial coordinate of the dof. Parallel layout of vector must
+    /// be consistent with dof map range. This function is typically
+    /// used to construct the null space of a matrix operator, e.g. rigid
+    /// body rotations.
+    void set_x(GenericVector& x, double value, std::size_t component,
+                       const Mesh& mesh) const;
+
+    /// Return map from shared dofs to the processes (not including
+    /// the current process) that share it.
+    const boost::unordered_map<std::size_t,
+      std::vector<unsigned int> >& shared_dofs() const;
+
+    /// Return set of processes that share dofs with the this process
+    const std::set<std::size_t>& neighbours() const;
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+  private:
+
+    // Total global dimension (sum of parts)
+    std::size_t _global_dimension;
+
+    // List of dofmaps
+    std::vector<std::shared_ptr<const GenericDofMap> > _dofmaps;
+
+    // Current part (mesh)
+    mutable std::size_t _current_part;
+
+    // Local-to-global dof map for all parts
+    std::vector<std::vector<std::vector<dolfin::la_index> > > _dofmap;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/CCFEMForm.cpp b/dolfin/fem/CCFEMForm.cpp
new file mode 100644
index 0000000..a003f6d
--- /dev/null
+++ b/dolfin/fem/CCFEMForm.cpp
@@ -0,0 +1,124 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.~1e-20.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-12
+// Last changed: 2013-09-19
+
+#include <dolfin/log/log.h>
+#include <dolfin/common/NoDeleter.h>
+#include "Form.h"
+#include "CCFEMForm.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CCFEMForm::CCFEMForm(std::shared_ptr<const CCFEMFunctionSpace> function_space)
+  : _rank(0)
+{
+  _function_spaces.push_back(function_space);
+}
+//-----------------------------------------------------------------------------
+CCFEMForm::CCFEMForm(const CCFEMFunctionSpace& function_space)
+  : _rank(0)
+{
+  _function_spaces.push_back(reference_to_no_delete_pointer(function_space));
+}
+//-----------------------------------------------------------------------------
+CCFEMForm::CCFEMForm(std::shared_ptr<const CCFEMFunctionSpace> function_space_0,
+                     std::shared_ptr<const CCFEMFunctionSpace> function_space_1)
+  : _rank(0)
+{
+  _function_spaces.push_back(function_space_0);
+  _function_spaces.push_back(function_space_1);
+}
+//-----------------------------------------------------------------------------
+CCFEMForm::CCFEMForm(const CCFEMFunctionSpace& function_space_0,
+                     const CCFEMFunctionSpace& function_space_1)
+  : _rank(0)
+{
+  _function_spaces.push_back(reference_to_no_delete_pointer(function_space_0));
+  _function_spaces.push_back(reference_to_no_delete_pointer(function_space_1));
+}
+//-----------------------------------------------------------------------------
+CCFEMForm::~CCFEMForm()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMForm::rank() const
+{
+  return _rank;
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMForm::num_parts() const
+{
+  return _forms.size();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Form> CCFEMForm::part(std::size_t i) const
+{
+  dolfin_assert(i < _forms.size());
+  return _forms[i];
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const CCFEMFunctionSpace>
+CCFEMForm::function_space(std::size_t i) const
+{
+  dolfin_assert(i < _function_spaces.size());
+  return _function_spaces[i];
+}
+//-----------------------------------------------------------------------------
+void CCFEMForm::add(std::shared_ptr<const Form> form)
+{
+  _forms.push_back(form);
+  log(PROGRESS, "Added form to CCFEM form; form has %d part(s).",
+      _forms.size());
+}
+//-----------------------------------------------------------------------------
+void CCFEMForm::add(const Form& form)
+{
+  add(reference_to_no_delete_pointer(form));
+}
+//-----------------------------------------------------------------------------
+void CCFEMForm::build()
+{
+  log(PROGRESS, "Building CCFEM form.");
+
+  // Check rank
+  for (std::size_t i = 1; i < num_parts(); i++)
+  {
+    std::size_t r0 = _forms[i - 1]->rank();
+    std::size_t r1 = _forms[i]->rank();
+    if (r0 != r1)
+    {
+      dolfin_error("CCFEMForm.cpp",
+                   "build CCFEM form",
+                   "Non-matching ranks (%d and %d) for forms.", r0, r1);
+    }
+  }
+
+  // Set rank
+  _rank = _forms[0]->rank();
+}
+//-----------------------------------------------------------------------------
+void CCFEMForm::clear()
+{
+  _rank = 0;
+  _function_spaces.clear();
+  _forms.clear();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/CCFEMForm.h b/dolfin/fem/CCFEMForm.h
new file mode 100644
index 0000000..36fb114
--- /dev/null
+++ b/dolfin/fem/CCFEMForm.h
@@ -0,0 +1,130 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-12
+// Last changed: 2013-09-19
+
+#ifndef __CCFEM_FORM_H
+#define __CCFEM_FORM_H
+
+#include <vector>
+#include <memory>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class CCFEMFunctionSpace;
+  class Form;
+
+  /// This class represents a variational form on a cut and composite
+  /// finite element function space (CCFEM) defined on one or more
+  /// possibly intersecting meshes.
+  ///
+  /// FIXME: Document usage of class with add() followed by build()
+
+  class CCFEMForm
+  {
+  public:
+
+    /// Create empty linear CCFEM variational form (shared pointer version)
+    CCFEMForm(std::shared_ptr<const CCFEMFunctionSpace> function_space);
+
+    /// Create empty linear CCFEM variational form (reference version)
+    CCFEMForm(const CCFEMFunctionSpace& function_space);
+
+    /// Create empty bilinear CCFEM variational form (shared pointer version)
+    CCFEMForm(std::shared_ptr<const CCFEMFunctionSpace> function_space_0,
+              std::shared_ptr<const CCFEMFunctionSpace> function_space_1);
+
+    /// Create empty bilinear CCFEM variational form (reference version)
+    CCFEMForm(const CCFEMFunctionSpace& function_space_0,
+              const CCFEMFunctionSpace& function_space_1);
+
+    /// Destructor
+    ~CCFEMForm();
+
+    /// Return rank of form (bilinear form = 2, linear form = 1,
+    /// functional = 0, etc)
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The rank of the form.
+    std::size_t rank() const;
+
+    /// Return the number of forms (parts) of the CCFEM form
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The number of forms (parts) of the CCFEM form.
+    std::size_t num_parts() const;
+
+    /// Return form (part) number i
+    ///
+    /// *Returns*
+    ///     _Form_
+    ///         Form (part) number i.
+    std::shared_ptr<const Form> part(std::size_t i) const;
+
+    /// Return function space for given argument
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Index
+    ///
+    /// *Returns*
+    ///     _CCFEMFunctionSpace_
+    ///         Function space shared pointer.
+    std::shared_ptr<const CCFEMFunctionSpace> function_space(std::size_t i) const;
+
+    /// Add form (shared pointer version)
+    ///
+    /// *Arguments*
+    ///     form (_Form_)
+    ///         The form.
+    void add(std::shared_ptr<const Form> form);
+
+    /// Add form (reference version)
+    ///
+    /// *Arguments*
+    ///     form (_Form_)
+    ///         The form.
+    void add(const Form& form);
+
+    /// Build CCFEM form
+    void build();
+
+    /// Clear CCFEM form
+    void clear();
+
+  private:
+
+    // The rank of the form
+    std::size_t _rank;
+
+    // Function spaces (one for each argument)
+    std::vector<std::shared_ptr<const CCFEMFunctionSpace> > _function_spaces;
+
+    // List of forms (one for each part)
+    std::vector<std::shared_ptr<const Form> > _forms;
+
+  };
+
+}
+
+#endif
+
diff --git a/dolfin/fem/DirichletBC.cpp b/dolfin/fem/DirichletBC.cpp
new file mode 100644
index 0000000..a66036c
--- /dev/null
+++ b/dolfin/fem/DirichletBC.cpp
@@ -0,0 +1,1237 @@
+// Copyright (C) 2007-2011 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristian Oelgaard, 2008
+// Modified by Martin Sandve Alnes, 2008
+// Modified by Johan Hake, 2009
+// Modified by Joachim B. Haga, 2012
+// Modified by Mikael Mortensen, 2013
+//
+// First added:  2007-04-10
+// Last changed: 2014-01-23
+
+#include <map>
+#include <utility>
+#include <ufc.h>
+#include <boost/assign/list_of.hpp>
+
+#include <dolfin/common/Array.h>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/RangedIndexSet.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/function/Constant.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshData.h>
+#include <dolfin/mesh/MeshDomains.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/MeshValueCollection.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/mesh/SubDomain.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/la/GenericLinearAlgebraFactory.h>
+#include <dolfin/la/GenericMatrix.h>
+#include <dolfin/la/GenericVector.h>
+#include "FiniteElement.h"
+#include "GenericDofMap.h"
+#include "DirichletBC.h"
+
+using namespace dolfin;
+
+const std::set<std::string> DirichletBC::methods
+            = boost::assign::list_of("topological")("geometric")("pointwise");
+
+//-----------------------------------------------------------------------------
+DirichletBC::DirichletBC(const FunctionSpace& V,
+                         const GenericFunction& g,
+                         const SubDomain& sub_domain,
+                         std::string method,
+                         bool check_midpoint)
+  : Hierarchical<DirichletBC>(*this),
+    _function_space(reference_to_no_delete_pointer(V)),
+    _g(reference_to_no_delete_pointer(g)),
+    _method(method),
+    _user_sub_domain(reference_to_no_delete_pointer(sub_domain)),
+    _check_midpoint(check_midpoint)
+{
+  check();
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+DirichletBC::DirichletBC(std::shared_ptr<const FunctionSpace> V,
+                         std::shared_ptr<const GenericFunction> g,
+                         std::shared_ptr<const SubDomain> sub_domain,
+                         std::string method,
+                         bool check_midpoint)
+  : Hierarchical<DirichletBC>(*this),
+    _function_space(V),
+    _g(g), _method(method),
+    _user_sub_domain(sub_domain),
+    _check_midpoint(check_midpoint)
+{
+  check();
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+DirichletBC::DirichletBC(const FunctionSpace& V, const GenericFunction& g,
+                         const MeshFunction<std::size_t>& sub_domains,
+                         std::size_t sub_domain, std::string method)
+  : Hierarchical<DirichletBC>(*this),
+    _function_space(reference_to_no_delete_pointer(V)),
+    _g(reference_to_no_delete_pointer(g)),
+    _method(method),
+    _user_mesh_function(reference_to_no_delete_pointer(sub_domains)),
+    _user_sub_domain_marker(sub_domain),
+    _check_midpoint(true)
+{
+  check();
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+DirichletBC::DirichletBC(std::shared_ptr<const FunctionSpace> V,
+                         std::shared_ptr<const GenericFunction> g,
+                         std::shared_ptr<const MeshFunction<std::size_t> > sub_domains,
+                         std::size_t sub_domain,
+                         std::string method)
+  : Hierarchical<DirichletBC>(*this), _function_space(V), _g(g),
+    _method(method), _user_mesh_function(sub_domains),
+    _user_sub_domain_marker(sub_domain),
+    _check_midpoint(true)
+{
+  check();
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+DirichletBC::DirichletBC(const FunctionSpace& V, const GenericFunction& g,
+                         std::size_t sub_domain, std::string method)
+  : Hierarchical<DirichletBC>(*this),
+    _function_space(reference_to_no_delete_pointer(V)),
+    _g(reference_to_no_delete_pointer(g)), _method(method),
+    _user_sub_domain_marker(sub_domain),
+    _check_midpoint(true)
+{
+  check();
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+DirichletBC::DirichletBC(std::shared_ptr<const FunctionSpace> V,
+                         std::shared_ptr<const GenericFunction> g,
+                         std::size_t sub_domain, std::string method)
+  : Hierarchical<DirichletBC>(*this),
+    _function_space(V),
+    _g(g),
+    _method(method),
+    _user_sub_domain_marker(sub_domain),
+    _check_midpoint(true)
+{
+  check();
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+DirichletBC::DirichletBC(std::shared_ptr<const FunctionSpace> V,
+                         std::shared_ptr<const GenericFunction> g,
+                         const std::vector<std::size_t>& markers,
+                         std::string method)
+  : Hierarchical<DirichletBC>(*this),
+    _function_space(V),
+    _g(g),
+    _method(method),
+    _facets(markers),
+    _check_midpoint(true)
+{
+  check();
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+DirichletBC::DirichletBC(const DirichletBC& bc)
+  : Hierarchical<DirichletBC>(*this)
+{
+  // Set default parameters
+  parameters = default_parameters();
+
+  *this = bc;
+}
+//-----------------------------------------------------------------------------
+DirichletBC::~DirichletBC()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+const DirichletBC& DirichletBC::operator= (const DirichletBC& bc)
+{
+  _function_space = bc._function_space;
+  _g = bc._g;
+  _method = bc._method;
+  _user_sub_domain = bc._user_sub_domain;
+  _facets = bc._facets;
+
+  // Call assignment operator for base class
+  Hierarchical<DirichletBC>::operator=(bc);
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::apply(GenericMatrix& A) const
+{
+  apply(&A, 0, 0);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::apply(GenericVector& b) const
+{
+  apply(0, &b, 0);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::apply(GenericMatrix& A, GenericVector& b) const
+{
+  apply(&A, &b, 0);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::apply(GenericVector& b, const GenericVector& x) const
+{
+  apply(0, &b, &x);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::apply(GenericMatrix& A,
+                        GenericVector& b,
+                        const GenericVector& x) const
+{
+  apply(&A, &b, &x);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::gather(Map& boundary_values) const
+{
+  Timer timer("DirichletBC gather");
+
+  typedef boost::unordered_map<std::size_t, std::vector<unsigned int> >
+    shared_dof_type;
+  typedef shared_dof_type::const_iterator shared_dof_iterator;
+  typedef std::vector<unsigned int>::const_iterator proc_iterator;
+
+  dolfin_assert(_function_space->mesh());
+  MPI_Comm mpi_comm = _function_space->mesh()->mpi_comm();
+  std::size_t comm_size = MPI::size(mpi_comm);
+
+  // Get dofmap
+  dolfin_assert(_function_space->dofmap());
+  const GenericDofMap& dofmap = *_function_space->dofmap();
+  const shared_dof_type& shared_dofs = dofmap.shared_dofs();
+
+  // Create list of boundary values to send to each processor
+  std::vector<std::vector<std::size_t> > proc_map0(comm_size);
+  std::vector<std::vector<double> > proc_map1(comm_size);
+  for (Map::const_iterator bv = boundary_values.begin();
+       bv != boundary_values.end(); ++bv)
+  {
+    // If the boundary value is attached to a shared dof, add it to
+    // the list of boundary values for each of the processors that
+    // share it
+    shared_dof_iterator shared_dof = shared_dofs.find(bv->first);
+    if (shared_dof != shared_dofs.end())
+    {
+      for (proc_iterator proc = shared_dof->second.begin();
+           proc != shared_dof->second.end(); ++proc)
+      {
+        proc_map0[*proc].push_back(bv->first);
+        proc_map1[*proc].push_back(bv->second);
+      }
+    }
+  }
+
+  // Distribute the lists between neighbours
+  std::vector<std::vector<std::size_t> > received_bvc0;
+  std::vector<std::vector<double> > received_bvc1;
+  MPI::all_to_all(mpi_comm, proc_map0, received_bvc0);
+  MPI::all_to_all(mpi_comm, proc_map1, received_bvc1);
+
+  // Add the received boundary values to the local boundary values
+  for (std::size_t p = 0; p < comm_size; ++p)
+  {
+    dolfin_assert(received_bvc0[p].size() == received_bvc1[p].size());
+    std::vector<std::pair<std::size_t, double> > _vec(received_bvc0[p].size());
+    for (std::size_t i = 0; i < _vec.size(); ++i)
+    {
+      _vec[i].first  = received_bvc0[p][i];
+      _vec[i].second = received_bvc1[p][i];
+    }
+    boundary_values.insert(_vec.begin(), _vec.end());
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::get_boundary_values(Map& boundary_values,
+                                      std::string method) const
+{
+  // Create local data
+  LocalData data(*_function_space);
+
+  // Compute dofs and values
+  compute_bc(boundary_values, data, method);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::zero(GenericMatrix& A) const
+{
+  // A map to hold the mapping from boundary dofs to boundary values
+  Map boundary_values;
+
+  // Create local data for application of boundary conditions
+  LocalData data(*_function_space);
+
+  // Compute dofs and values
+  compute_bc(boundary_values, data, _method);
+
+  // Copy boundary value data to arrays
+  std::vector<dolfin::la_index> dofs(boundary_values.size());
+  Map::const_iterator bv;
+  std::size_t i = 0;
+  for (bv = boundary_values.begin(); bv != boundary_values.end(); ++bv)
+    dofs[i++] = bv->first;
+
+  // Modify linear system (A_ii = 1)
+  A.zero(boundary_values.size(), dofs.data());
+
+  // Finalise changes to A
+  A.apply("insert");
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::zero_columns(GenericMatrix& A,
+                               GenericVector& b,
+                               double diag_val) const
+{
+  Map bv_map;
+  get_boundary_values(bv_map, _method);
+
+  // Create lookup table of dofs
+  //const std::size_t nrows = A.size(0); // should be equal to b.size()
+  const std::size_t ncols = A.size(1); // should be equal to max possible dof+1
+
+  std::pair<std::size_t, std::size_t> rows = A.local_range(0);
+
+  std::vector<char> is_bc_dof(ncols);
+  std::vector<double> bc_dof_val(ncols);
+  for (Map::const_iterator bv = bv_map.begin();  bv != bv_map.end();  ++bv)
+  {
+    is_bc_dof[bv->first] = 1;
+    bc_dof_val[bv->first] = bv->second;
+  }
+
+  // Scan through all columns of all rows, setting to zero if
+  // is_bc_dof[column]. At the same time, we collect corrections to
+  // the RHS
+
+  std::vector<std::size_t> cols;
+  std::vector<double> vals;
+  std::vector<double> b_vals;
+  std::vector<dolfin::la_index> b_rows;
+
+  for (std::size_t row = rows.first; row < rows.second; row++)
+  {
+    // If diag_val is nonzero, the matrix is a diagonal block
+    // (nrows==ncols), and we can set the whole BC row
+    if (diag_val != 0.0 && is_bc_dof[row])
+    {
+      A.getrow(row, cols, vals);
+      for (std::size_t j = 0; j < cols.size(); j++)
+        vals[j] = (cols[j] == row)*diag_val;
+      A.setrow(row, cols, vals);
+      A.apply("insert");
+      b.setitem(row, bc_dof_val[row]*diag_val);
+    }
+    else // Otherwise, we scan the row for BC columns
+    {
+      A.getrow(row, cols, vals);
+      bool row_changed = false;
+      for (std::size_t j = 0; j < cols.size(); j++)
+      {
+        const std::size_t col = cols[j];
+
+        // Skip columns that aren't BC, and entries that are zero
+        if (!is_bc_dof[col] || vals[j] == 0.0)
+          continue;
+
+        // We're going to change the row, so make room for it
+        if (!row_changed)
+        {
+          row_changed = true;
+          b_rows.push_back(row);
+          b_vals.push_back(0.0);
+        }
+
+        b_vals.back() -= bc_dof_val[col]*vals[j];
+        vals[j] = 0.0;
+      }
+      if (row_changed)
+      {
+        A.setrow(row, cols, vals);
+        A.apply("insert");
+      }
+    }
+  }
+
+  b.add(&b_vals.front(), b_rows.size(), &b_rows.front());
+  b.apply("add");
+}
+//-----------------------------------------------------------------------------
+const std::vector<std::size_t>& DirichletBC::markers() const
+{
+  return _facets;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericFunction> DirichletBC::value() const
+{
+  return _g;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const SubDomain> DirichletBC::user_sub_domain() const
+{
+  return _user_sub_domain;
+}
+//-----------------------------------------------------------------------------
+bool DirichletBC::is_compatible(GenericFunction& v) const
+{
+  // This function only checks the values at vertices when it should
+  // really check that the dof functionals agree. The check here is
+  // neither necessary nor sufficient to guarantee compatible boundary
+  // boundary conditions but a more robust test requires access to the
+  // function space.
+
+  dolfin_error("DirichletBC.cpp",
+               "call is_compatible",
+               "This function has not been updated for the new Function class interface");
+
+  /*
+  // Compute value size
+  std::size_t size = 1;
+  const std::size_t rank = g->function_space().element()->value_rank();
+  for (std::size_t i = 0; i < rank ; i++)
+    size *= g->function_space().element()->value_dimension(i);
+  double* g_values = new double[size];
+  double* v_values = new double[size];
+
+  // Get mesh
+  const Mesh& mesh = _function_space->mesh();
+
+  // Iterate over facets
+  for (std::size_t f = 0; f < facets.size(); f++)
+  {
+    // Create cell and facet
+    std::size_t cell_number  = facets[f].first;
+    std::size_t facet_number = facets[f].second;
+    Cell cell(mesh, cell_number);
+    Facet facet(mesh, facet_number);
+
+    // Make cell and facet available to user-defined function
+    dolfin_error("DirichletBC.cpp",
+                 "add proper message here",
+                 "Does the new GenericFunction class need an 'update' function?");
+    //g->update(cell, facet_number);
+    //v.update(cell, facet_number);
+
+    // Iterate over facet vertices
+    for (VertexIterator vertex(facet); !vertex.end(); ++vertex)
+    {
+      // Evaluate g and v at vertex
+      g->eval(g_values, vertex->x());
+      v.eval(v_values, vertex->x());
+
+      // Check values
+      for (std::size_t i = 0; i < size; i++)
+      {
+        if (std::abs(g_values[i] - v_values[i]) > DOLFIN_EPS)
+        {
+          Point p(mesh.geometry().dim(), vertex->x());
+          cout << "Incompatible function value " << v_values[i] << " at x = " << p << ", should be " << g_values[i] << "." << endl;
+          delete [] g_values;
+          delete [] v_values;
+          return false;
+        }
+      }
+    }
+  }
+
+  delete [] g_values;
+  delete [] v_values;
+  */
+
+  return true;
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::set_value(const GenericFunction& g)
+{
+  _g = reference_to_no_delete_pointer(g);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::homogenize()
+{
+  const std::size_t value_rank = _g->value_rank();
+  if (!value_rank)
+  {
+    std::shared_ptr<Constant> zero(new Constant(0.0));
+    set_value(zero);
+  }
+  else if (value_rank == 1)
+  {
+    const std::size_t value_dim = _g->value_dimension(0);
+    std::vector<double> values(value_dim, 0.0);
+    std::shared_ptr<Constant> zero(new Constant(values));
+    set_value(zero);
+  }
+  else
+  {
+    std::vector<std::size_t> value_shape;
+    for (std::size_t i = 0; i < value_rank; i++)
+      value_shape.push_back(_g->value_dimension(i));
+    std::vector<double> values(_g->value_size(), 0.0);
+    std::shared_ptr<Constant> zero(new Constant(value_shape, values));
+    set_value(zero);
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::set_value(std::shared_ptr<const GenericFunction> g)
+{
+  _g = g;
+}
+//-----------------------------------------------------------------------------
+std::string DirichletBC::method() const
+{
+  return _method;
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::apply(GenericMatrix* A,
+                        GenericVector* b,
+                        const GenericVector* x) const
+{
+  Timer timer("DirichletBC apply");
+
+  // Check arguments
+  check_arguments(A, b, x);
+
+  // A map to hold the mapping from boundary dofs to boundary values
+  Map boundary_values;
+
+  // Create local data for application of boundary conditions
+  LocalData data(*_function_space);
+
+  // Compute dofs and values
+  compute_bc(boundary_values, data, _method);
+
+  // Copy boundary value data to arrays
+  const std::size_t size = boundary_values.size();
+  std::vector<dolfin::la_index> dofs(size);
+  std::vector<double> values(size);
+  Map::const_iterator bv;
+  std::size_t counter = 0;
+  for (bv = boundary_values.begin(); bv != boundary_values.end(); ++bv)
+  {
+    dofs[counter]     = bv->first;
+    values[counter++] = bv->second;
+  }
+
+  // Modify boundary values for nonlinear problems
+  if (x)
+  {
+    // Get values (these must reside in local portion (including ghost
+    // values) of the vector
+    std::vector<double> x_values(size);
+    x->get_local(x_values.data(), dofs.size(), dofs.data());
+
+    // Modify RHS entries
+    for (std::size_t i = 0; i < size; i++)
+      values[i] = x_values[i] - values[i];
+  }
+
+  log(PROGRESS, "Applying boundary conditions to linear system.");
+
+  // Modify RHS vector (b[i] = value) and apply changes
+  if (b)
+  {
+    b->set(values.data(), size, dofs.data());
+    b->apply("insert");
+  }
+
+  // Modify linear system (A_ii = 1) and apply changes
+  if (A)
+  {
+    const bool use_ident = parameters["use_ident"];
+    if (use_ident)
+      A->ident(size, dofs.data());
+    else
+    {
+      A->zero(size, dofs.data());
+      for (std::size_t i = 0; i < size; i++)
+      {
+        std::pair<std::size_t, std::size_t> ij(dofs[i], dofs[i]);
+        A->setitem(ij, 1.0);
+      }
+    }
+
+    // Apply changes
+    A->apply("insert");
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::check() const
+{
+  dolfin_assert(_g);
+  dolfin_assert(_function_space->element());
+
+  // Check for common errors, message below might be cryptic
+  if (_g->value_rank() == 0 && _function_space->element()->value_rank() == 1)
+  {
+    dolfin_error("DirichletBC.cpp",
+                 "create Dirichlet boundary condition",
+                 "Expecting a vector-valued boundary value but given function is scalar");
+  }
+  if (_g->value_rank() == 1 && _function_space->element()->value_rank() == 0)
+  {
+    dolfin_error("DirichletBC.cpp",
+                 "create Dirichlet boundary condition",
+                 "Expecting a scalar boundary value but given function is vector-valued");
+  }
+
+  // Check that value shape of boundary value
+  if (_g->value_rank() != _function_space->element()->value_rank())
+  {
+    dolfin_error("DirichletBC.cpp",
+                 "create Dirichlet boundary condition",
+                 "Illegal value rank (%d), expecting (%d)",
+                 _g->value_rank(), _function_space->element()->value_rank());
+  }
+  for (std::size_t i = 0; i < _g->value_rank(); i++)
+  {
+    if (_g->value_dimension(i) != _function_space->element()->value_dimension(i))
+    {
+      dolfin_error("DirichletBC.cpp",
+                   "create Dirichlet boundary condition",
+                   "Illegal value dimension (%d), expecting (%d)",
+                   _g->value_dimension(i),
+                   _function_space->element()->value_dimension(i));
+    }
+  }
+
+  // Check that boundary condition method is known
+  if (methods.count(_method) == 0)
+  {
+    dolfin_error("DirichletBC.cpp",
+                 "create Dirichlet boundary condition",
+                 "unknown method (\"%s\")", _method.c_str());
+  }
+
+  // Check that the mesh is ordered
+  dolfin_assert(_function_space->mesh());
+  if (!_function_space->mesh()->ordered())
+  {
+    dolfin_error("DirichletBC.cpp",
+                 "create Dirichlet boundary condition",
+                 "Mesh is not ordered according to the UFC numbering convention. Consider calling mesh.order()");
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::init_facets(const MPI_Comm mpi_comm) const
+{
+  Timer timer("DirichletBC init facets");
+
+  if (MPI::max(mpi_comm, _facets.size()) > 0)
+    return;
+
+  if (_user_sub_domain)
+    init_from_sub_domain(_user_sub_domain);
+  else if (_user_mesh_function)
+    init_from_mesh_function(*_user_mesh_function, _user_sub_domain_marker);
+  else
+    init_from_mesh(_user_sub_domain_marker);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::init_from_sub_domain(std::shared_ptr<const SubDomain>
+                                       sub_domain) const
+{
+  dolfin_assert(_facets.size() == 0);
+
+  // FIXME: This can be made more efficient, we should be able to
+  // FIXME: extract the facets without first creating a MeshFunction on
+  // FIXME: the entire mesh and then extracting the subset. This is done
+  // FIXME: mainly for convenience (we may reuse mark() in SubDomain).
+
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+
+  // Create mesh function for sub domain markers on facets
+  const std::size_t dim = mesh.topology().dim();
+  _function_space->mesh()->init(dim - 1);
+  MeshFunction<std::size_t> sub_domains(mesh, dim - 1);
+
+  // Set geometric dimension (needed for SWIG interface)
+  sub_domain->_geometric_dimension = mesh.geometry().dim();
+
+  // Mark everything as sub domain 1
+  sub_domains = 1;
+
+  // Mark the sub domain as sub domain 0
+  sub_domain->mark(sub_domains, 0, _check_midpoint);
+
+  // Initialize from mesh function
+  init_from_mesh_function(sub_domains, 0);
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::init_from_mesh_function(const MeshFunction<std::size_t>& sub_domains,
+                                          std::size_t sub_domain) const
+{
+  dolfin_assert(_facets.size() == 0);
+  dolfin_assert(_function_space->mesh());
+
+  // Get mesh
+  const Mesh& mesh = *_function_space->mesh();
+
+  // Make sure we have the facet - cell connectivity
+  const std::size_t D = mesh.topology().dim();
+  mesh.init(D - 1, D);
+
+  // Build set of boundary facets
+  for (FacetIterator facet(mesh); !facet.end(); ++facet)
+  {
+    if (sub_domains[*facet] == sub_domain)
+      _facets.push_back(facet->index());
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::init_from_mesh(std::size_t sub_domain) const
+{
+  dolfin_assert(_facets.size() == 0);
+
+  // For this to work, the mesh *needs* to be ordered according to
+  // the UFC ordering before it gets here. So reordering the mesh
+  // here will either have no effect (if the mesh is already ordered
+  // or it won't do anything good (since the markers are wrong anyway).
+  // In conclusion: we don't need to order the mesh here.
+
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+
+  // Assign domain numbers for each facet
+  const std::size_t D = mesh.topology().dim();
+  const std::map<std::size_t, std::size_t>& markers
+    = mesh.domains().markers(D - 1);
+
+  std::map<std::size_t, std::size_t>::const_iterator mark;
+  for (mark = markers.begin(); mark != markers.end(); ++mark)
+  {
+    if (mark->second == sub_domain)
+      _facets.push_back(mark->first);
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::compute_bc(Map& boundary_values, LocalData& data,
+                             std::string method) const
+{
+  Timer timer("DirichletBC compute bc");
+
+  // Set method if dafault
+  if (method == "default")
+    method = _method;
+
+  // Choose strategy
+  if (method == "topological")
+    compute_bc_topological(boundary_values, data);
+  else if (method == "geometric")
+    compute_bc_geometric(boundary_values, data);
+  else if (method == "pointwise")
+    compute_bc_pointwise(boundary_values, data);
+  else
+  {
+    dolfin_error("DirichletBC.cpp",
+                 "compute boundary conditions",
+                 "Unknown method for application of boundary conditions");
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::compute_bc_topological(Map& boundary_values,
+                                         LocalData& data) const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_g);
+
+  // Get mesh and dofmap
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+
+  // Extract the list of facets where the BC should be applied
+  init_facets(mesh.mpi_comm());
+
+  // Special case
+  if (_facets.empty())
+  {
+    if (MPI::size(mesh.mpi_comm()) == 1)
+      warning("Found no facets matching domain for boundary condition.");
+    return;
+  }
+
+  // Get dofmap
+  dolfin_assert(_function_space->dofmap());
+  const GenericDofMap& dofmap = *_function_space->dofmap();
+
+  // Topological dimension
+  const std::size_t D = mesh.topology().dim();
+
+  // Initialise facet-cell connectivity
+  mesh.init(D);
+  mesh.init(D - 1, D);
+
+  // Get restriction if any
+  std::shared_ptr<const Restriction> restriction
+    = _function_space->dofmap()->restriction();
+
+  // Create UFC cell
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+
+  // Iterate over marked
+  dolfin_assert(_function_space->element());
+  Progress p("Computing Dirichlet boundary values, topological search",
+             _facets.size());
+  for (std::size_t f = 0; f < _facets.size(); ++f)
+  {
+    // Create facet
+    const Facet facet(mesh, _facets[f]);
+
+    // Get cell to which facet belongs. If mesh is restricted, make
+    // sure we pick the right cell in case there are two.
+    dolfin_assert(facet.num_entities(D) > 0);
+    const unsigned int* cell_indices = facet.entities(D);
+    std::size_t cell_index = 0;
+    if (restriction && facet.num_entities(D) > 1)
+    {
+      if (restriction->contains(D, cell_indices[0]))
+        cell_index = cell_indices[0];
+      else if (restriction->contains(D, cell_indices[1]))
+        cell_index = cell_indices[1];
+      else
+      {
+        dolfin_error("DirichletBC.cpp",
+                     "create Dirichlet boundary condition",
+                     "Boundary facet is not adjacent to a cell inside the restriction.");
+      }
+    }
+    else
+      cell_index = facet.entities(D)[0];
+
+    // Create attached cell
+    const Cell cell(mesh, cell_index);
+
+    // Get local index of facet with respect to the cell
+    const size_t facet_local_index = cell.index(facet);
+
+    // Update UFC cell geometry data
+    cell.get_vertex_coordinates(vertex_coordinates);
+    cell.get_cell_data(ufc_cell, facet_local_index);
+
+    // Restrict coefficient to cell
+    _g->restrict(data.w.data(), *_function_space->element(), cell,
+                 vertex_coordinates.data(), ufc_cell);
+
+    // Tabulate dofs on cell
+    const std::vector<dolfin::la_index>& cell_dofs
+      = dofmap.cell_dofs(cell.index());
+
+    // Tabulate which dofs are on the facet
+    dofmap.tabulate_facet_dofs(data.facet_dofs, facet_local_index);
+
+    // Pick values for facet
+    for (std::size_t i = 0; i < dofmap.num_facet_dofs(); i++)
+    {
+      const std::size_t global_dof = cell_dofs[data.facet_dofs[i]];
+      const double value = data.w[data.facet_dofs[i]];
+      boundary_values[global_dof] = value;
+    }
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::compute_bc_geometric(Map& boundary_values,
+                                       LocalData& data) const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->element());
+  dolfin_assert(_g);
+
+  // Get mesh
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+
+  // Extract the list of facets where the BC *might* be applied
+  init_facets(mesh.mpi_comm());
+
+  // Special case
+  if (_facets.empty())
+  {
+    if (MPI::size(mesh.mpi_comm()) == 1)
+      warning("Found no facets matching domain for boundary condition.");
+    return;
+  }
+
+  // Get dofmap
+  dolfin_assert(_function_space->dofmap());
+  const GenericDofMap& dofmap = *_function_space->dofmap();
+
+  // Initialize facets, needed for geometric search
+  log(TRACE, "Computing facets, needed for geometric application of boundary conditions.");
+  mesh.init(mesh.topology().dim() - 1);
+
+  // Speed up the computations by only visiting (most) dofs once
+  RangedIndexSet already_visited(dofmap.is_view()
+                                 ? std::pair<std::size_t, std::size_t>(0, 0)
+                                 : dofmap.ownership_range());
+
+  const std::size_t D = mesh.topology().dim();
+
+  // Iterate over facets
+  Progress p("Computing Dirichlet boundary values, geometric search",
+             _facets.size());
+  for (std::size_t f = 0; f < _facets.size(); ++f)
+  {
+    // Create facet
+    const Facet facet(mesh, _facets[f]);
+
+    // Create cell (get first attached cell)
+    const Cell cell(mesh, facet.entities(D)[0]);
+
+    // Get local index of facet with respect to the cell
+    const std::size_t local_facet = cell.index(facet);
+
+    // Create UFC cell object and vertex coordinate holder
+    ufc::cell ufc_cell;
+    std::vector<double> vertex_coordinates;
+
+    // Loop the vertices associated with the facet
+    for (VertexIterator vertex(facet); !vertex.end(); ++vertex)
+    {
+      // Loop the cells associated with the vertex
+      for (CellIterator c(*vertex); !c.end(); ++c)
+      {
+        c->get_vertex_coordinates(vertex_coordinates);
+        c->get_cell_data(ufc_cell, local_facet);
+
+        bool tabulated = false;
+        bool interpolated = false;
+
+        // Tabulate dofs on cell
+        const std::vector<dolfin::la_index>& cell_dofs
+          = dofmap.cell_dofs(c->index());
+
+        // Loop over all dofs on cell
+        for (std::size_t i = 0; i < cell_dofs.size(); ++i)
+        {
+          const std::size_t global_dof = cell_dofs[i];
+
+          // Tabulate coordinates if not already done
+          if (!tabulated)
+          {
+            dofmap.tabulate_coordinates(data.coordinates, vertex_coordinates,
+                                        *c);
+            tabulated = true;
+          }
+
+          // Check if the coordinates are on current facet and thus on
+          // boundary
+          if (!on_facet(&(data.coordinates[i][0]), facet))
+            continue;
+
+          // Skip already checked dofs
+          if (already_visited.in_range(global_dof)
+              && !already_visited.insert(global_dof))
+          {
+            continue;
+          }
+
+          // Restrict if not already done
+          if (!interpolated)
+          {
+            _g->restrict(data.w.data(), *_function_space->element(), cell,
+                         vertex_coordinates.data(), ufc_cell);
+            interpolated = true;
+          }
+
+          // Set boundary value
+          const double value = data.w[i];
+          boundary_values[global_dof] = value;
+        }
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::compute_bc_pointwise(Map& boundary_values,
+                                       LocalData& data) const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->element());
+  dolfin_assert(_g);
+
+  if (!_user_sub_domain)
+  {
+    dolfin_error("DirichletBC.cpp",
+                 "computing Dirichlet boundary values, pointwise search",
+                 "A SubDomain is required for pointwise search");
+  }
+
+  // Get mesh and dofmap
+  dolfin_assert(_function_space->mesh());
+  dolfin_assert(_function_space->dofmap());
+  const Mesh& mesh = *_function_space->mesh();
+  const GenericDofMap& dofmap = *_function_space->dofmap();
+
+  // Geometric dim
+  const std::size_t gdim = mesh.geometry().dim();
+
+  // Create UFC cell object
+  ufc::cell ufc_cell;
+
+  // Speed up the computations by only visiting (most) dofs once
+  RangedIndexSet already_visited(dofmap.is_view()
+                                 ? std::pair<std::size_t, std::size_t>(0,0)
+                                 : dofmap.ownership_range());
+
+  // Iterate over cells
+  std::vector<double> vertex_coordinates;
+  if (MPI::max(mesh.mpi_comm(), _cells_to_localdofs.size()) == 0)
+  {
+    // First time around all cells must be iterated over.
+    // Create map from cells attached to boundary to local dofs.
+    Progress p("Computing Dirichlet boundary values, pointwise search",
+               mesh.num_cells());
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      // Update UFC cell
+      cell->get_vertex_coordinates(vertex_coordinates);
+      cell->get_cell_data(ufc_cell);
+
+      // Tabulate coordinates of dofs on cell
+      dofmap.tabulate_coordinates(data.coordinates, vertex_coordinates,
+                                  *cell);
+
+      // Tabulate dofs on cell
+      const std::vector<dolfin::la_index>& cell_dofs
+        = dofmap.cell_dofs(cell->index());
+
+      // Interpolate function only once and only on cells where necessary
+      bool already_interpolated = false;
+
+      std::vector<std::size_t> dofs;
+
+      // Loop all dofs on cell
+      for (std::size_t i = 0; i < dofmap.cell_dimension(cell->index()); ++i)
+      {
+        const std::size_t global_dof = cell_dofs[i];
+
+        // Skip already checked dofs
+        if (already_visited.in_range(global_dof)
+            && !already_visited.insert(global_dof))
+        {
+          continue;
+        }
+
+        // Check if the coordinates are part of the sub domain (calls
+        // user-defined 'inside' function)
+        Array<double> x(gdim, &data.coordinates[i][0]);
+        if (!_user_sub_domain->inside(x, false))
+          continue;
+
+        if (!already_interpolated)
+        {
+          already_interpolated = true;
+
+          // Restrict coefficient to cell
+          _g->restrict(data.w.data(), *_function_space->element(), *cell,
+                      vertex_coordinates.data(), ufc_cell);
+
+          // Put cell index in storage for next time function is called
+          _cells_to_localdofs.insert(std::make_pair(cell->index(), dofs));
+        }
+
+        // Add local dof to map
+        _cells_to_localdofs[cell->index()].push_back(i);
+
+        // Set boundary value
+        const double value = data.w[i];
+        boundary_values[global_dof] = value;
+      }
+      p++;
+    }
+  }
+  else
+  {
+    // Loop over cells that contain dofs on boundary.
+    std::map<std::size_t, std::vector<std::size_t> >::const_iterator it;
+    for (it = _cells_to_localdofs.begin(); it != _cells_to_localdofs.end(); ++it)
+    {
+      const Cell cell(mesh, it->first);
+      // Update UFC cell
+      cell.get_vertex_coordinates(vertex_coordinates);
+      cell.get_cell_data(ufc_cell);
+
+      // Tabulate coordinates of dofs on cell
+      dofmap.tabulate_coordinates(data.coordinates, vertex_coordinates,
+                                  cell);
+
+      // Restrict coefficient to cell
+      _g->restrict(data.w.data(), *_function_space->element(), cell,
+                    vertex_coordinates.data(), ufc_cell);
+
+      // Tabulate dofs on cell
+      const std::vector<dolfin::la_index>& cell_dofs
+        = dofmap.cell_dofs(cell.index());
+
+      // Loop dofs on boundary of cell
+      for (std::size_t i = 0; i < it->second.size(); ++i)
+      {
+        const std::size_t local_dof  = it->second[i];
+        const std::size_t global_dof = cell_dofs[local_dof];
+
+        // Set boundary value
+        const double value = data.w[local_dof];
+        boundary_values[global_dof] = value;
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+bool DirichletBC::on_facet(const double* coordinates, const Facet& facet) const
+{
+  // Check if the coordinates are on the same line as the line segment
+  if (facet.dim() == 1)
+  {
+    // Create points
+    Point p(coordinates[0], coordinates[1]);
+    const Point v0 = Vertex(facet.mesh(), facet.entities(0)[0]).point();
+    const Point v1 = Vertex(facet.mesh(), facet.entities(0)[1]).point();
+
+    // Create vectors
+    const Point v01 = v1 - v0;
+    const Point vp0 = v0 - p;
+    const Point vp1 = v1 - p;
+
+    // Check if the length of the sum of the two line segments vp0 and
+    // vp1 is equal to the total length of the facet
+    if ( std::abs(v01.norm() - vp0.norm() - vp1.norm()) < DOLFIN_EPS )
+      return true;
+    else
+      return false;
+  }
+  // Check if the coordinates are in the same plane as the triangular
+  // facet
+  else if (facet.dim() == 2)
+  {
+    // Create points
+    const Point p(coordinates[0], coordinates[1], coordinates[2]);
+    const Point v0 = Vertex(facet.mesh(), facet.entities(0)[0]).point();
+    const Point v1 = Vertex(facet.mesh(), facet.entities(0)[1]).point();
+    const Point v2 = Vertex(facet.mesh(), facet.entities(0)[2]).point();
+
+    // Create vectors
+    const Point v01 = v1 - v0;
+    const Point v02 = v2 - v0;
+    const Point vp0 = v0 - p;
+    const Point vp1 = v1 - p;
+    const Point vp2 = v2 - p;
+
+    // Check if the sum of the area of the sub triangles is equal to
+    // the total area of the facet
+    if (std::abs(v01.cross(v02).norm() - vp0.cross(vp1).norm()
+                 - vp1.cross(vp2).norm() - vp2.cross(vp0).norm()) < DOLFIN_EPS)
+    {
+      return true;
+    }
+    else
+      return false;
+  }
+
+  dolfin_error("DirichletBC.cpp",
+               "determine if given point is on facet",
+               "Not implemented for given facet dimension");
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+void DirichletBC::check_arguments(GenericMatrix* A, GenericVector* b,
+                                  const GenericVector* x) const
+{
+  dolfin_assert(_function_space);
+
+  // Check matrix and vector dimensions
+  if (A && x && A->size(0) != x->size())
+  {
+    dolfin_error("BoundaryCondition.cpp",
+                 "apply boundary condition",
+                 "Matrix dimension (%d rows) does not match vector dimension (%d) for application of boundary conditions",
+                 A->size(0), x->size());
+  }
+
+  if (A && b && A->size(0) != b->size())
+  {
+    dolfin_error("BoundaryCondition.cpp",
+                 "apply boundary condition",
+                 "Matrix dimension (%d rows) does not match vector dimension (%d) for application of boundary conditions",
+                 A->size(0), b->size());
+  }
+
+  if (x && b && x->size() != b->size())
+  {
+    dolfin_error("BoundaryCondition.cpp",
+                 "apply boundary condition",
+                 "Vector dimension (%d rows) does not match vector dimension (%d) for application of boundary conditions",
+                 x->size(), b->size());
+  }
+
+  // Check dimension of function space
+  if (A && A->size(0) < _function_space->dim())
+  {
+    dolfin_error("BoundaryCondition.cpp",
+                 "apply boundary condition",
+                 "Dimension of function space (%d) too large for application of boundary conditions to linear system (%d rows)",
+                 _function_space->dim(), A->size(0));
+  }
+
+  if (x && x->size() < _function_space->dim())
+  {
+    dolfin_error("BoundaryCondition.cpp",
+                 "apply boundary condition",
+                 "Dimension of function space (%d) too large for application to boundary conditions linear system (%d rows)",
+                 _function_space->dim(), x->size());
+  }
+
+  if (b && b->size() < _function_space->dim())
+  {
+    dolfin_error("BoundaryCondition.cpp",
+                 "apply boundary condition",
+                 "Dimension of function space (%d) too large for application to boundary conditions linear system (%d rows)",
+                 _function_space->dim(), b->size());
+  }
+
+  // FIXME: Check case A.size() > _function_space->dim() for subspaces
+}
+//-----------------------------------------------------------------------------
+DirichletBC::LocalData::LocalData(const FunctionSpace& V)
+  : w(V.dofmap()->max_cell_dimension(), 0.0),
+    facet_dofs(V.dofmap()->num_facet_dofs(), 0),
+    coordinates(boost::extents[V.dofmap()->max_cell_dimension()][V.mesh()->geometry().dim()])
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/DirichletBC.h b/dolfin/fem/DirichletBC.h
new file mode 100644
index 0000000..b8051fa
--- /dev/null
+++ b/dolfin/fem/DirichletBC.h
@@ -0,0 +1,545 @@
+// Copyright (C) 2007-2012 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristian Oelgaard, 2007
+// Modified by Johan Hake, 2009
+// Modified by Joachim B Haga, 2012
+// Modified by Mikael Mortensen, 2014
+//
+// First added:  2007-04-10
+// Last changed: 2014-01-23
+//
+// FIXME: This class needs some cleanup, in particular collecting
+//        all data from different representations into a common
+//        data structure (perhaps an std::vector<std::size_t> with
+//        facet indices).
+
+#ifndef __DIRICHLET_BC_H
+#define __DIRICHLET_BC_H
+
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <memory>
+#include <boost/unordered_map.hpp>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/Hierarchical.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  class GenericFunction;
+  class FunctionSpace;
+  class Facet;
+  class Restriction;
+  class GenericMatrix;
+  class GenericVector;
+  class SubDomain;
+  template<typename T> class MeshFunction;
+
+  /// This class specifies the interface for setting (strong)
+  /// Dirichlet boundary conditions for partial differential
+  /// equations,
+  ///
+  /// .. math::
+  ///
+  ///     u = g \hbox{ on } G,
+  ///
+  /// where :math:`u` is the solution to be computed, :math:`g` is a function
+  /// and :math:`G` is a sub domain of the mesh.
+  ///
+  /// A DirichletBC is specified by the function g, the function space
+  /// (trial space) and boundary indicators on (a subset of) the mesh
+  /// boundary.
+  ///
+  /// The boundary indicators may be specified in a number of
+  /// different ways.
+  ///
+  /// The simplest approach is to specify the boundary by a _SubDomain_
+  /// object, using the inside() function to specify on which facets
+  /// the boundary conditions should be applied. The boundary facets
+  /// will then be searched for and marked *only* on the first call to
+  /// apply. This means that the mesh could be moved after the first 
+  /// apply and the boundary markers would still remain intact.
+  ///
+  /// Alternatively, the boundary may be specified by a _MeshFunction_
+  /// labeling all mesh facets together with a number that specifies
+  /// which facets should be included in the boundary.
+  ///
+  /// The third option is to attach the boundary information to the
+  /// mesh. This is handled automatically when exporting a mesh from
+  /// for example VMTK.
+  ///
+  /// The 'method' variable may be used to specify the type of method
+  /// used to identify degrees of freedom on the boundary. Available
+  /// methods are: topological approach (default), geometric approach,
+  /// and pointwise approach. The topological approach is faster, but
+  /// will only identify degrees of freedom that are located on a
+  /// facet that is entirely on the boundary. In particular, the
+  /// topological approach will not identify degrees of freedom for
+  /// discontinuous elements (which are all internal to the cell). A
+  /// remedy for this is to use the geometric approach. In the
+  /// geometric approach, each dof on each facet that matches the
+  /// boundary condition will be checked. To apply pointwise boundary
+  /// conditions e.g. pointloads, one will have to use the pointwise
+  /// approach. The three possibilties are "topological", "geometric"
+  /// and "pointwise".
+  ///
+  /// The 'check_midpoint' variable can be used to decide whether or
+  /// not the midpoint of each facet should be checked when a
+  /// user-defined _SubDomain_ is used to define the domain of the
+  /// boundary condition. By default, midpoints are always checked.
+  /// Note that this variable may be of importance close to corners,
+  /// in which case it is sometimes important to check the midpoint to
+  /// avoid including facets "on the diagonal close" to a corner. This
+  /// variable is also of importance for curved boundaries (like on a
+  /// sphere or cylinder), in which case it is important *not* to
+  /// check the midpoint which will be located in the interior of a
+  /// domain defined relative to a radius.
+  class DirichletBC : public Hierarchical<DirichletBC>, public Variable
+  {
+
+  public:
+
+    typedef boost::unordered_map<std::size_t, double> Map;
+
+    /// Create boundary condition for subdomain
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     g (_GenericFunction_)
+    ///         The value.
+    ///     sub_domain (_SubDomain_)
+    ///         The subdomain.
+    ///     method (std::string)
+    ///         Optional argument: A string specifying
+    ///         the method to identify dofs.
+    DirichletBC(const FunctionSpace& V,
+                const GenericFunction& g,
+                const SubDomain& sub_domain,
+                std::string method="topological",
+                bool check_midpoint=true);
+
+    /// Create boundary condition for subdomain
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space
+    ///     g (_GenericFunction_)
+    ///         The value
+    ///     sub_domain (_SubDomain_)
+    ///         The subdomain
+    ///     method (std::string)
+    ///         Optional argument: A string specifying
+    ///         the method to identify dofs
+    DirichletBC(std::shared_ptr<const FunctionSpace> V,
+                std::shared_ptr<const GenericFunction> g,
+                std::shared_ptr<const SubDomain> sub_domain,
+                std::string method="topological",
+                bool check_midpoint=true);
+
+    /// Create boundary condition for subdomain specified by index
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     g (_GenericFunction_)
+    ///         The value.
+    ///     sub_domains (_MeshFunction_ <std::size_t>)
+    ///         Subdomain markers
+    ///     sub_domain (std::size_t)
+    ///         The subdomain index (number)
+    ///     method (std::string)
+    ///         Optional argument: A string specifying the
+    ///         method to identify dofs.
+    DirichletBC(const FunctionSpace& V,
+                const GenericFunction& g,
+                const MeshFunction<std::size_t>& sub_domains,
+                std::size_t sub_domain,
+                std::string method="topological");
+
+    /// Create boundary condition for subdomain specified by index
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     g (_GenericFunction_)
+    ///         The value.
+    ///     sub_domains (_MeshFunction_ <std::size_t>)
+    ///         Subdomain markers
+    ///     sub_domain (std::size_t)
+    ///         The subdomain index (number)
+    ///     method (std::string)
+    ///         Optional argument: A string specifying the
+    ///         method to identify dofs.
+    DirichletBC(std::shared_ptr<const FunctionSpace> V,
+                std::shared_ptr<const GenericFunction> g,
+                std::shared_ptr<const MeshFunction<std::size_t> > sub_domains,
+                std::size_t sub_domain,
+                std::string method="topological");
+
+    /// Create boundary condition for boundary data included in the mesh
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     g (_GenericFunction_)
+    ///         The value.
+    ///     sub_domain (std::size_t)
+    ///         The subdomain index (number)
+    ///     method (std::string)
+    ///         Optional argument: A string specifying the
+    ///         method to identify dofs.
+    DirichletBC(const FunctionSpace& V,
+                const GenericFunction& g,
+                std::size_t sub_domain,
+                std::string method="topological");
+
+    /// Create boundary condition for boundary data included in the mesh
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     g (_GenericFunction_)
+    ///         The value.
+    ///     sub_domain (std::size_t)
+    ///         The subdomain index (number)
+    ///     method (std::string)
+    ///         Optional argument: A string specifying the
+    ///         method to identify dofs.
+    DirichletBC(std::shared_ptr<const FunctionSpace> V,
+                std::shared_ptr<const GenericFunction> g,
+                std::size_t sub_domain,
+                std::string method="topological");
+
+    /// Create boundary condition for subdomain by boundary markers
+    /// (cells, local facet numbers)
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     g (_GenericFunction_)
+    ///         The value.
+    ///     markers (std::vector<std::size_t>)
+    ///         Subdomain markers (facet index local to process)
+    ///     method (std::string)
+    ///         Optional argument: A string specifying the
+    ///         method to identify dofs.
+    DirichletBC(std::shared_ptr<const FunctionSpace> V,
+                std::shared_ptr<const GenericFunction> g,
+                const std::vector<std::size_t>&
+                markers,
+                std::string method="topological");
+
+    /// Copy constructor
+    ///
+    /// *Arguments*
+    ///     bc (_DirichletBC_)
+    ///         The object to be copied.
+    DirichletBC(const DirichletBC& bc);
+
+    /// Destructor
+    ~DirichletBC();
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     bc (_DirichletBC_)
+    ///         Another DirichletBC object.
+    const DirichletBC& operator= (const DirichletBC& bc);
+
+    /// Apply boundary condition to a matrix
+    ///
+    /// *Arguments*
+    ///     A (_GenericMatrix_)
+    ///         The matrix to apply boundary condition to.
+    void apply(GenericMatrix& A) const;
+
+    /// Apply boundary condition to a vector
+    ///
+    /// *Arguments*
+    ///     b (_GenericVector_)
+    ///         The vector to apply boundary condition to.
+    void apply(GenericVector& b) const;
+
+    /// Apply boundary condition to a linear system
+    ///
+    /// *Arguments*
+    ///     A (_GenericMatrix_)
+    ///         The matrix to apply boundary condition to.
+    ///     b (_GenericVector_)
+    ///         The vector to apply boundary condition to.
+    void apply(GenericMatrix& A, GenericVector& b) const;
+
+    /// Apply boundary condition to vectors for a nonlinear problem
+    ///
+    /// *Arguments*
+    ///     b (_GenericVector_)
+    ///         The vector to apply boundary conditions to.
+    ///     x (_GenericVector_)
+    ///         Another vector (nonlinear problem).
+    void apply(GenericVector& b, const GenericVector& x) const;
+
+    /// Apply boundary condition to a linear system for a nonlinear problem
+    ///
+    /// *Arguments*
+    ///     A (_GenericMatrix_)
+    ///         The matrix to apply boundary conditions to.
+    ///     b (_GenericVector_)
+    ///         The vector to apply boundary conditions to.
+    ///     x (_GenericVector_)
+    ///         Another vector (nonlinear problem).
+    void apply(GenericMatrix& A, GenericVector& b,
+               const GenericVector& x) const;
+
+    /// Get Dirichlet dofs and values. If a method other than 'pointwise' is
+    /// used in parallel, the map may not be complete for local vertices since
+    /// a vertex can have a bc applied, but the partition might not have a
+    /// facet on the boundary. To ensure all local boundary dofs are marked,
+    /// it is necessary to call gather() on the returned boundary values.
+    ///
+    /// *Arguments*
+    ///     boundary_values (boost::unordered_map<std::size_t, double>)
+    ///         Map from dof to boundary value.
+    ///     method (std::string)
+    ///         Optional argument: A string specifying which
+    ///         method to use.
+    void get_boundary_values(Map& boundary_values,
+                             std::string method="default") const;
+
+    /// Get boundary values from neighbour processes. If a method other than
+    /// "pointwise" is used, this is necessary to ensure all boundary dofs are
+    /// marked on all processes.
+    ///
+    /// *Arguments*
+    ///     boundary_values (boost::unordered_map<std::size_t, double>)
+    ///         Map from dof to boundary value.
+    void gather(Map& boundary_values) const;
+
+    /// Make rows of matrix associated with boundary condition zero,
+    /// useful for non-diagonal matrices in a block matrix.
+    ///
+    /// *Arguments*
+    ///     A (_GenericMatrix_)
+    ///         The matrix
+    void zero(GenericMatrix& A) const;
+
+    /// Make columns of matrix associated with boundary condition
+    /// zero, and update a (right-hand side) vector to reflect the
+    /// changes. Useful for non-diagonals.
+    ///
+    /// *Arguments*
+    ///     A (_GenericMatrix_)
+    ///         The matrix
+    ///     b (_GenericVector_)
+    ///         The vector
+    ///     diag_val (double)
+    ///         This parameter would normally be -1, 0 or 1.
+    void zero_columns(GenericMatrix& A, GenericVector& b,
+                      double diag_val=0) const;
+
+    /// Return boundary markers
+    ///
+    /// *Returns*
+    ///     std::vector<std::pair<std::size_t, std::size_t> >
+    ///         Boundary markers (facets stored as pairs of cells and
+    ///         local facet numbers).
+    const std::vector<std::size_t>& markers() const;
+
+    /// Return function space V
+    ///
+    /// *Returns*
+    ///     _FunctionSPace_
+    ///         The function space to which boundary conditions are applied.
+    std::shared_ptr<const FunctionSpace> function_space() const
+    { return _function_space; }
+
+    /// Return boundary value g
+    ///
+    /// *Returns*
+    ///     _GenericFunction_
+    ///         The boundary values.
+    std::shared_ptr<const GenericFunction> value() const;
+
+    /// Return shared pointer to subdomain
+    ///
+    /// *Returns*
+    ///     _SubDomain_
+    ///         Shared pointer to subdomain.
+    std::shared_ptr<const SubDomain> user_sub_domain() const;
+
+    /// Check if given function is compatible with boundary condition
+    /// (checking only vertex values)
+    ///
+    /// *Arguments*
+    ///     v (_GenericFunction_)
+    ///         The function to check for compability
+    ///         with boundary condition.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if compatible.
+    bool is_compatible(GenericFunction& v) const;
+
+    /// Set value g for boundary condition, domain remains unchanged
+    ///
+    /// *Arguments*
+    ///     g (_GenericFunction_)
+    ///         The value.
+    void set_value(const GenericFunction& g);
+
+    /// Set value g for boundary condition, domain remains unchanged
+    ///
+    /// *Arguments*
+    ///     g (_GenericFunction_)
+    ///         The value.
+    void set_value(std::shared_ptr<const GenericFunction> g);
+
+    /// Set value to 0.0
+    void homogenize();
+
+    /// Return method used for computing Dirichet dofs
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         Method used for computing Dirichet dofs ("topological",
+    ///         "geometric" or "pointwise").
+    std::string method() const;
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("dirichlet_bc");
+      p.add("use_ident", true);
+      return p;
+    }
+
+  private:
+
+    class LocalData;
+
+    // Apply boundary conditions, common method
+    void apply(GenericMatrix* A, GenericVector* b,
+               const GenericVector* x) const;
+
+    // Check input data to constructor
+    void check() const;
+
+    // Initialize facets (from sub domain, mesh, etc)
+    void init_facets(const MPI_Comm mpi_comm) const;
+
+    // Initialize sub domain markers from sub domain
+    void
+      init_from_sub_domain(std::shared_ptr<const SubDomain> sub_domain) const;
+
+    // Initialize sub domain markers from MeshFunction
+    void init_from_mesh_function(const MeshFunction<std::size_t>& sub_domains,
+                                 std::size_t sub_domain) const;
+
+    // Initialize sub domain markers from mesh
+    void init_from_mesh(std::size_t sub_domain) const;
+
+    // Compute dofs and values for application of boundary conditions using
+    // given method
+    void compute_bc(Map& boundary_values, LocalData& data,
+                    std::string method) const;
+
+    // Compute boundary values for facet (topological approach)
+    void compute_bc_topological(Map& boundary_values,
+                                LocalData& data) const;
+
+    // Compute boundary values for facet (geometrical approach)
+    void compute_bc_geometric(Map& boundary_values,
+                              LocalData& data) const;
+
+    // Compute boundary values for facet (pointwise approach)
+    void compute_bc_pointwise(Map& boundary_values,
+                              LocalData& data) const;
+
+    // Check if the point is in the same plane as the given facet
+    bool on_facet(const double* coordinates, const Facet& facet) const;
+
+    // Check arguments
+    void check_arguments(GenericMatrix* A,
+                         GenericVector* b,
+                         const GenericVector* x) const;
+
+    // The function space (possibly a sub function space)
+    std::shared_ptr<const FunctionSpace> _function_space;
+
+    // The function
+    std::shared_ptr<const GenericFunction> _g;
+
+    // Search method
+    std::string _method;
+
+    // Possible search methods
+    static const std::set<std::string> methods;
+
+  public:
+
+    // User defined sub domain
+    std::shared_ptr<const SubDomain> _user_sub_domain;
+
+  private:
+
+    // Boundary facets, stored by facet index (local to process)
+    mutable std::vector<std::size_t> _facets;
+    
+    // Cells attached to boundary, stored by cell index with map to local dof number
+    mutable std::map<std::size_t, std::vector<std::size_t> > _cells_to_localdofs;
+
+    // User defined mesh function
+    std::shared_ptr<const MeshFunction<std::size_t> > _user_mesh_function;
+
+    // User defined sub domain marker for mesh or mesh function
+    std::size_t _user_sub_domain_marker;
+
+    // Flag for whether midpoints should be checked
+    bool _check_midpoint;
+
+    // Local data for application of boundary conditions
+    class LocalData
+    {
+    public:
+
+      // Constructor
+      LocalData(const FunctionSpace& V);
+
+      // Coefficients
+      std::vector<double> w;
+
+      // Facet dofs
+      std::vector<std::size_t> facet_dofs;
+
+      // Coordinates for dofs
+      boost::multi_array<double, 2> coordinates;
+
+    };
+
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/DofMap.cpp b/dolfin/fem/DofMap.cpp
new file mode 100644
index 0000000..61ad0df
--- /dev/null
+++ b/dolfin/fem/DofMap.cpp
@@ -0,0 +1,526 @@
+// Copyright (C) 2007-2013 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Martin Alnes, 2008, 2013
+// Modified by Kent-Andre Mardal, 2009
+// Modified by Ola Skavhaug, 2009
+// Modified by Niclas Jansson, 2009
+// Modified by Joachim B Haga, 2012
+// Modified by Mikael Mortensen, 2012
+// Modified by Jan Blechta, 2013
+//
+// First added:  2007-03-01
+// Last changed: 2013-09-19
+
+#include <boost/unordered_map.hpp>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/types.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/LogStream.h>
+#include <dolfin/mesh/PeriodicBoundaryComputation.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/mesh/Vertex.h>
+#include "DofMapBuilder.h"
+#include "DofMap.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+DofMap::DofMap(std::shared_ptr<const ufc::dofmap> ufc_dofmap,
+               const Mesh& mesh)
+  : _ufc_dofmap(ufc_dofmap), _is_view(false), _global_dimension(0),
+    _ufc_offset(0)
+{
+  dolfin_assert(_ufc_dofmap);
+
+  // Call dofmap builder
+  DofMapBuilder::build(*this, mesh, slave_master_mesh_entities, _restriction);
+}
+//-----------------------------------------------------------------------------
+DofMap::DofMap(std::shared_ptr<const ufc::dofmap> ufc_dofmap,
+               const Mesh& mesh,
+               std::shared_ptr<const SubDomain> constrained_domain)
+  : _ufc_dofmap(ufc_dofmap), _is_view(false), _global_dimension(0),
+    _ufc_offset(0)
+{
+  dolfin_assert(_ufc_dofmap);
+
+  this->constrained_domain = constrained_domain;
+
+  // Compute slave-master pairs
+  dolfin_assert(constrained_domain);
+  const std::size_t D = mesh.topology().dim();
+  slave_master_mesh_entities.reset(new std::map<unsigned int, std::map<unsigned int, std::pair<unsigned int, unsigned int> > >());
+  dolfin_assert(slave_master_mesh_entities);
+  for (std::size_t d = 0; d <= D; ++d)
+  {
+    if (_ufc_dofmap->needs_mesh_entities(d))
+    {
+      slave_master_mesh_entities->insert(std::make_pair(d,
+           PeriodicBoundaryComputation::compute_periodic_pairs(mesh, *constrained_domain,
+                                                               d)));
+    }
+  }
+
+  // Call dofmap builder
+  DofMapBuilder::build(*this, mesh, slave_master_mesh_entities, _restriction);
+}
+//-----------------------------------------------------------------------------
+DofMap::DofMap(std::shared_ptr<const ufc::dofmap> ufc_dofmap,
+               std::shared_ptr<const Restriction> restriction)
+  : _ufc_dofmap(ufc_dofmap), _restriction(restriction), _is_view(false),
+    _global_dimension(0), _ufc_offset(0)
+{
+  dolfin_assert(_ufc_dofmap);
+  dolfin_assert(_restriction);
+
+  // Get mesh
+  const dolfin::Mesh& mesh = restriction->mesh();
+
+  // Check that we get cell markers, extend later
+  if (restriction->dim() != mesh.topology().dim())
+  {
+    dolfin_error("DofMap.cpp",
+                 "create mapping of degrees of freedom",
+                 "Only cell-based restriction of function spaces are currently supported. ");
+  }
+
+  // Call dofmap builder
+  DofMapBuilder::build(*this, mesh, slave_master_mesh_entities, restriction);
+}
+//-----------------------------------------------------------------------------
+DofMap::DofMap(const DofMap& parent_dofmap,
+  const std::vector<std::size_t>& component, const Mesh& mesh)
+  : _is_view(true), _global_dimension(0), _ufc_offset(0),
+    _ownership_range(parent_dofmap._ownership_range)
+{
+
+  // Share slave-master map with parent
+  this->slave_master_mesh_entities = parent_dofmap.slave_master_mesh_entities;
+
+  // Build sub-dofmap
+  DofMapBuilder::build_sub_map(*this, parent_dofmap, component, mesh);
+}
+//-----------------------------------------------------------------------------
+DofMap::DofMap(boost::unordered_map<std::size_t, std::size_t>& collapsed_map,
+               const DofMap& dofmap_view, const Mesh& mesh)
+  :  _ufc_dofmap(dofmap_view._ufc_dofmap), _is_view(false),
+     _global_dimension(0), _ufc_offset(0)
+{
+  dolfin_assert(_ufc_dofmap);
+
+  // Check for dimensional consistency between the dofmap and mesh
+  check_dimensional_consistency(*_ufc_dofmap, mesh);
+
+  // Check that mesh has been ordered
+  if (!mesh.ordered())
+  {
+     dolfin_error("DofMap.cpp",
+                  "create mapping of degrees of freedom",
+                  "Mesh is not ordered according to the UFC numbering convention. "
+                  "Consider calling mesh.order()");
+  }
+
+  // Check dimensional consistency between UFC dofmap and the mesh
+  check_provided_entities(*_ufc_dofmap, mesh);
+
+  // Copy slave-master map (copy or share?)
+  if (dofmap_view.slave_master_mesh_entities)
+    slave_master_mesh_entities.reset(new std::map<unsigned int, std::map<unsigned int, std::pair<unsigned int, unsigned int> > >(*dofmap_view.slave_master_mesh_entities));
+
+  // Build new dof map
+  DofMapBuilder::build(*this, mesh, slave_master_mesh_entities, _restriction);
+
+  // Dimension sanity checks
+  dolfin_assert(dofmap_view._dofmap.size() == mesh.num_cells());
+  dolfin_assert(global_dimension() == dofmap_view.global_dimension());
+  dolfin_assert(_dofmap.size() == mesh.num_cells());
+
+  // FIXME: Could we use a std::vector instead of std::map if the
+  //        collapsed dof map is contiguous (0, . . . , n)?
+
+  // Build map from collapsed dof index to original dof index
+  collapsed_map.clear();
+  for (std::size_t i = 0; i < mesh.num_cells(); ++i)
+  {
+    const std::vector<dolfin::la_index>& view_cell_dofs
+      = dofmap_view._dofmap[i];
+    const std::vector<dolfin::la_index>& cell_dofs = _dofmap[i];
+    dolfin_assert(view_cell_dofs.size() == cell_dofs.size());
+
+    for (std::size_t j = 0; j < view_cell_dofs.size(); ++j)
+      collapsed_map[cell_dofs[j]] = view_cell_dofs[j];
+  }
+}
+//-----------------------------------------------------------------------------
+DofMap::DofMap(const DofMap& dofmap)
+{
+  // Copy data
+  _dofmap = dofmap._dofmap;
+  _ufc_dofmap = dofmap._ufc_dofmap;
+  ufc_map_to_dofmap = dofmap.ufc_map_to_dofmap;
+  _is_view = dofmap._is_view;
+  _global_dimension = dofmap._global_dimension;
+  _ufc_offset = dofmap._ufc_offset;
+  _ownership_range = dofmap._ownership_range;
+  _off_process_owner = dofmap._off_process_owner;
+  _shared_dofs = dofmap._shared_dofs;
+  _neighbours = dofmap._neighbours;
+  slave_master_mesh_entities = dofmap.slave_master_mesh_entities;
+}
+//-----------------------------------------------------------------------------
+DofMap::~DofMap()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t DofMap::global_dimension() const
+{
+  return _global_dimension;
+}
+//-----------------------------------------------------------------------------
+std::size_t DofMap::cell_dimension(std::size_t cell_index) const
+{
+  dolfin_assert(cell_index < _dofmap.size());
+  return _dofmap[cell_index].size();
+}
+//-----------------------------------------------------------------------------
+std::size_t DofMap::max_cell_dimension() const
+{
+  dolfin_assert(_ufc_dofmap);
+  return _ufc_dofmap->local_dimension();
+}
+//-----------------------------------------------------------------------------
+std::size_t DofMap::num_entity_dofs(std::size_t dim) const
+{
+  dolfin_assert(_ufc_dofmap);
+  return _ufc_dofmap->num_entity_dofs(dim);
+}
+//-----------------------------------------------------------------------------
+std::size_t DofMap::geometric_dimension() const
+{
+  dolfin_assert(_ufc_dofmap);
+  return _ufc_dofmap->geometric_dimension();
+}
+//-----------------------------------------------------------------------------
+std::size_t DofMap::num_facet_dofs() const
+{
+  dolfin_assert(_ufc_dofmap);
+  return _ufc_dofmap->num_facet_dofs();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const dolfin::Restriction> DofMap::restriction() const
+{
+  return _restriction;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t> DofMap::ownership_range() const
+{
+  return _ownership_range;
+}
+//-----------------------------------------------------------------------------
+const boost::unordered_map<std::size_t, unsigned int>&
+DofMap::off_process_owner() const
+{
+  return _off_process_owner;
+}
+//-----------------------------------------------------------------------------
+const boost::unordered_map<std::size_t, std::vector<unsigned int> >&
+DofMap::shared_dofs() const
+{
+  return _shared_dofs;
+}
+//-----------------------------------------------------------------------------
+const std::set<std::size_t>& DofMap::neighbours() const
+{
+  return _neighbours;
+}
+//-----------------------------------------------------------------------------
+void DofMap::tabulate_entity_dofs(std::vector<std::size_t>& dofs,
+				  std::size_t dim, std::size_t local_entity) const
+{
+  dolfin_assert(_ufc_dofmap);
+  if (_ufc_dofmap->num_entity_dofs(dim)==0)
+    return ;
+
+  dofs.resize(_ufc_dofmap->num_entity_dofs(dim));
+  _ufc_dofmap->tabulate_entity_dofs(&dofs[0], dim, local_entity);
+}
+//-----------------------------------------------------------------------------
+void DofMap::tabulate_facet_dofs(std::vector<std::size_t>& dofs,
+                                 std::size_t local_facet) const
+{
+  dolfin_assert(_ufc_dofmap);
+  dofs.resize(_ufc_dofmap->num_facet_dofs());
+  _ufc_dofmap->tabulate_facet_dofs(dofs.data(), local_facet);
+}
+//-----------------------------------------------------------------------------
+void DofMap::tabulate_coordinates(boost::multi_array<double, 2>& coordinates,
+                                  const std::vector<double>& vertex_coordinates,
+                                  const Cell& cell) const
+{
+  // FIXME: This is a hack because UFC wants a double pointer for coordinates
+  dolfin_assert(_ufc_dofmap);
+
+  // Check dimensions
+  if (coordinates.shape()[0] != cell_dimension(cell.index()) ||
+      coordinates.shape()[1] != _ufc_dofmap->geometric_dimension())
+  {
+    boost::multi_array<double, 2>::extent_gen extents;
+    const std::size_t cell_dim = cell_dimension(cell.index());
+    coordinates.resize(extents[cell_dim][_ufc_dofmap->geometric_dimension()]);
+  }
+
+  // Set vertex coordinates
+  const std::size_t num_points = coordinates.size();
+  std::vector<double*> coords(num_points);
+  for (std::size_t i = 0; i < num_points; ++i)
+    coords[i] = &(coordinates[i][0]);
+
+  // Tabulate coordinates
+  _ufc_dofmap->tabulate_coordinates(coords.data(), vertex_coordinates.data());
+}
+//-----------------------------------------------------------------------------
+std::vector<double> DofMap::tabulate_all_coordinates(const Mesh& mesh) const
+{
+  // Geometric dimension
+  const std::size_t gdim = _ufc_dofmap->geometric_dimension();
+  dolfin_assert(gdim == mesh.geometry().dim());
+
+  if (_is_view)
+  {
+    dolfin_error("DofMap.cpp",
+                 "tabulate_all_coordinates",
+                 "Cannot tabulate coordinates for a DofMap that is a view.");
+  }
+
+  // Local offset
+  const std::size_t offset = ownership_range().first;
+
+  // Number of local dofs (dofs owned by this process)
+  const std::size_t local_size
+    = ownership_range().second - ownership_range().first;
+
+  // Vector to hold coordinates and return
+  std::vector<double> x(gdim*local_size);
+
+  // Loop over cells and tabulate dofs
+  boost::multi_array<double, 2> coordinates;
+  std::vector<double> vertex_coordinates;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Update UFC cell
+    cell->get_vertex_coordinates(vertex_coordinates);
+
+    // Get local-to-global map
+    const std::vector<dolfin::la_index>& dofs = cell_dofs(cell->index());
+
+    // Tabulate dof coordinates on cell
+    tabulate_coordinates(coordinates, vertex_coordinates, *cell);
+
+    // Copy dof coordinates into vector
+    for (std::size_t i = 0; i < dofs.size(); ++i)
+    {
+      const std::size_t dof = dofs[i];
+      if (dof >=  _ownership_range.first && dof < _ownership_range.second)
+      {
+        const std::size_t local_index = dof - offset;
+        for (std::size_t j = 0; j < gdim; ++j)
+        {
+          dolfin_assert(gdim*local_index + j < x.size());
+          x[gdim*local_index + j] = coordinates[i][j];
+        }
+      }
+    }
+  }
+
+  return x;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericDofMap> DofMap::copy() const
+{
+  return std::shared_ptr<GenericDofMap>(new DofMap(*this));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericDofMap> DofMap::create(const Mesh& new_mesh) const
+{
+  // Get underlying UFC dof map
+  std::shared_ptr<const ufc::dofmap> ufc_dof_map(_ufc_dofmap);
+  return std::shared_ptr<GenericDofMap>(new DofMap(ufc_dof_map, new_mesh));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericDofMap>
+  DofMap::extract_sub_dofmap(const std::vector<std::size_t>& component,
+                             const Mesh& mesh) const
+{
+  return std::shared_ptr<GenericDofMap>(new DofMap(*this, component, mesh));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericDofMap>
+  DofMap::collapse(boost::unordered_map<std::size_t, std::size_t>&
+                   collapsed_map,
+                   const Mesh& mesh) const
+{
+  return std::shared_ptr<GenericDofMap>(new DofMap(collapsed_map,
+                                                     *this, mesh));
+}
+//-----------------------------------------------------------------------------
+std::vector<dolfin::la_index> DofMap::dofs() const
+{
+  // Ownership range
+  const std::size_t r0 = _ownership_range.first;
+  const std::size_t r1 = _ownership_range.second;
+
+  // Create vector to hold dofs
+  std::vector<la_index> _dofs;
+  _dofs.reserve(_dofmap.size()*max_cell_dimension());
+
+  // Insert all dofs into a vector (will contain duplicates)
+  std::vector<std::vector<dolfin::la_index> >::const_iterator cell_dofs;
+  for (cell_dofs = _dofmap.begin(); cell_dofs != _dofmap.end(); ++cell_dofs)
+  {
+    for (std::size_t i = 0; i < cell_dofs->size(); ++i)
+    {
+      const std::size_t dof = (*cell_dofs)[i];
+      if (dof >= r0 && dof < r1)
+        _dofs.push_back(dof);
+    }
+  }
+
+  // Sort dofs (required to later remove duplicates)
+  std::sort(_dofs.begin(), _dofs.end());
+
+  // Remove duplicates
+  _dofs.erase(std::unique(_dofs.begin(), _dofs.end() ), _dofs.end());
+
+  return _dofs;
+}
+//-----------------------------------------------------------------------------
+void DofMap::set(GenericVector& x, double value) const
+{
+  std::vector<double> _value;
+  std::vector<std::vector<dolfin::la_index> >::const_iterator cell_dofs;
+  for (cell_dofs = _dofmap.begin(); cell_dofs != _dofmap.end(); ++cell_dofs)
+  {
+    _value.resize(cell_dofs->size(), value);
+    x.set(_value.data(), cell_dofs->size(), cell_dofs->data());
+  }
+  x.apply("insert");
+}
+//-----------------------------------------------------------------------------
+void DofMap::set_x(GenericVector& x, double value, std::size_t component,
+                   const Mesh& mesh) const
+{
+  std::vector<double> x_values;
+  boost::multi_array<double, 2> coordinates;
+  std::vector<double> vertex_coordinates;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Update UFC cell
+    cell->get_vertex_coordinates(vertex_coordinates);
+
+    // Get local-to-global map
+    const std::vector<dolfin::la_index>& dofs = cell_dofs(cell->index());
+
+    // Tabulate dof coordinates
+    tabulate_coordinates(coordinates, vertex_coordinates, *cell);
+    dolfin_assert(coordinates.shape()[0] == dofs.size());
+    dolfin_assert(component < coordinates.shape()[1]);
+
+    // Copy coordinate (it may be possible to avoid this)
+    x_values.resize(dofs.size());
+    for (std::size_t i = 0; i < coordinates.shape()[0]; ++i)
+      x_values[i] = value*coordinates[i][component];
+
+    // Set x[component] values in vector
+    x.set(x_values.data(), dofs.size(), dofs.data());
+  }
+}
+//-----------------------------------------------------------------------------
+void DofMap::check_provided_entities(const ufc::dofmap& dofmap,
+                                     const Mesh& mesh)
+{
+  // Check that we have all mesh entities
+  for (std::size_t d = 0; d <= mesh.topology().dim(); ++d)
+  {
+    if (dofmap.needs_mesh_entities(d) && mesh.num_entities(d) == 0)
+    {
+      dolfin_error("DofMap.cpp",
+                   "initialize mapping of degrees of freedom",
+                   "Missing entities of dimension %d. Try calling mesh.init(%d)", d, d);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+std::string DofMap::str(bool verbose) const
+{
+  // TODO: Display information on parallel stuff
+
+  // Prefix with process number if running in parallel
+  std::stringstream prefix;
+  //if (MPI::size() > 1)
+  //  prefix << "Process " << MPI::rank() << ": ";
+
+  std::stringstream s;
+  s << prefix.str() << "<DofMap of global dimension " << global_dimension()
+    << ">" << std::endl;
+  if (verbose)
+  {
+    // Cell loop
+    for (std::size_t i = 0; i < _dofmap.size(); ++i)
+    {
+      s << prefix.str() << "Local cell index, cell dofmap dimension: " << i
+        << ", " << _dofmap[i].size() << std::endl;
+
+      // Local dof loop
+      for (std::size_t j = 0; j < _dofmap[i].size(); ++j)
+      {
+        s << prefix.str() <<  "  " << "Local, global dof indices: " << j
+          << ", " << _dofmap[i][j] << std::endl;
+      }
+    }
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void DofMap::check_dimensional_consistency(const ufc::dofmap& dofmap,
+                                            const Mesh& mesh)
+{
+  // Check geometric dimension
+  if (dofmap.geometric_dimension() != mesh.geometry().dim())
+  {
+    dolfin_error("DofMap.cpp",
+                 "create mapping of degrees of freedom",
+                 "Geometric dimension of the UFC dofmap (dim = %d) and the mesh (dim = %d) do not match",
+                 dofmap.geometric_dimension(),
+                 mesh.geometry().dim());
+  }
+
+  // Check topological dimension
+  if (dofmap.topological_dimension() != mesh.topology().dim())
+  {
+    dolfin_error("DofMap.cpp",
+                 "create mapping of degrees of freedom",
+                 "Topological dimension of the UFC dofmap (dim = %d) and the mesh (dim = %d) do not match",
+                 dofmap.topological_dimension(),
+                 mesh.topology().dim());
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/DofMap.h b/dolfin/fem/DofMap.h
new file mode 100644
index 0000000..9940c53
--- /dev/null
+++ b/dolfin/fem/DofMap.h
@@ -0,0 +1,454 @@
+// Copyright (C) 2007-2012 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Martin Alnes, 2008
+// Modified by Kent-Andre Mardal, 2009
+// Modified by Ola Skavhaug, 2009
+// Modified by Joachim B Haga, 2012
+// Modified by Mikael Mortensen, 2012
+// Modified by Jan Blechta, 2013
+//
+// First added:  2007-03-01
+// Last changed: 2013-09-19
+
+#ifndef __DOLFIN_DOF_MAP_H
+#define __DOLFIN_DOF_MAP_H
+
+#include <map>
+#include <memory>
+#include <utility>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <memory>
+#include <boost/unordered_map.hpp>
+#include <ufc.h>
+
+#include <dolfin/common/types.h>
+#include <dolfin/mesh/Cell.h>
+#include "GenericDofMap.h"
+
+namespace dolfin
+{
+
+  class GenericVector;
+  class Restriction;
+
+  /// This class handles the mapping of degrees of freedom. It builds
+  /// a dof map based on a ufc::dofmap on a specific mesh. It will
+  /// reorder the dofs when running in parallel. Sub-dofmaps, both
+  /// views and copies, are supported.
+
+  class DofMap : public GenericDofMap
+  {
+  public:
+
+    /// Create dof map on mesh (mesh is not stored)
+    ///
+    /// *Arguments*
+    ///     ufc_dofmap (ufc::dofmap)
+    ///         The ufc::dofmap.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    DofMap(std::shared_ptr<const ufc::dofmap> ufc_dofmap,
+           const Mesh& mesh);
+
+    /// Create a periodic dof map on mesh (mesh is not stored)
+    ///
+    /// *Arguments*
+    ///     ufc_dofmap (ufc::dofmap)
+    ///         The ufc::dofmap.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     conatrained_boundary (_SubDomain_)
+    ///         The subdomain marking the constrained (tied) boudaries.
+    DofMap(std::shared_ptr<const ufc::dofmap> ufc_dofmap,
+           const Mesh& mesh,
+           std::shared_ptr<const SubDomain> constrained_domain);
+
+    /// Create restricted dof map on mesh
+    ///
+    /// *Arguments*
+    ///     ufc_dofmap (ufc::dofmap)
+    ///         The ufc::dofmap.
+    ///     restriction (_Restriction_)
+    ///         The restriction.
+    DofMap(std::shared_ptr<const ufc::dofmap> ufc_dofmap,
+           std::shared_ptr<const Restriction> restriction);
+
+  private:
+
+    // Create a sub-dofmap (a view) from parent_dofmap
+    DofMap(const DofMap& parent_dofmap,
+           const std::vector<std::size_t>& component,
+           const Mesh& mesh);
+
+    // Create a collapsed dofmap from parent_dofmap
+    DofMap(boost::unordered_map<std::size_t, std::size_t>& collapsed_map,
+           const DofMap& dofmap_view, const Mesh& mesh);
+
+    // Copy constructor
+    DofMap(const DofMap& dofmap);
+
+  public:
+
+    /// Destructor
+    ~DofMap();
+
+    /// True iff dof map is a view into another map
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the dof map is a sub-dof map (a view into
+    ///         another map).
+    bool is_view() const
+    { return _is_view; }
+
+    /// True if dof map is restricted
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if dof map is restricted
+    bool is_restricted() const
+    { return static_cast<bool>(_restriction); }
+
+    /// Return the dimension of the global finite element function
+    /// space
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The dimension of the global finite element function space.
+    std::size_t global_dimension() const;
+
+    // FIXME: Rename this function, 'cell_dimension' sounds confusing
+
+    /// Return the dimension of the local finite element function
+    /// space on a cell
+    ///
+    /// *Arguments*
+    ///     cell_index (std::size_t)
+    ///         Index of cell
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Dimension of the local finite element function space.
+    std::size_t cell_dimension(std::size_t cell_index) const;
+
+    /// Return the maximum dimension of the local finite element
+    /// function space
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Maximum dimension of the local finite element function
+    ///         space.
+    std::size_t max_cell_dimension() const;
+
+    /// Return the number of dofs for a given entity dimension
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         Entity dimension
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of dofs associated with given entity dimension
+    virtual std::size_t num_entity_dofs(std::size_t dim) const;
+
+    /// Return the geometric dimension of the coordinates this dof map
+    /// provides
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The geometric dimension.
+    std::size_t geometric_dimension() const;
+
+    /// Return number of facet dofs
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The number of facet dofs.
+    std::size_t num_facet_dofs() const;
+
+    /// Restriction if any. If the dofmap is not restricted, a null
+    /// pointer is returned.
+    ///
+    /// *Returns*
+    ///     std::shared_ptr<const Restriction>
+    //          The restriction.
+    std::shared_ptr<const Restriction> restriction() const;
+
+    /// Return the ownership range (dofs in this range are owned by
+    /// this process)
+    ///
+    /// *Returns*
+    ///     std::pair<std::size_t, std::size_t>
+    ///         The ownership range.
+    std::pair<std::size_t, std::size_t> ownership_range() const;
+
+    /// Return map from nonlocal dofs that appear in local dof map to
+    /// owning process
+    ///
+    /// *Returns*
+    ///     boost::unordered_map<std::size_t, std::size_t>
+    ///         The map from non-local dofs.
+    const boost::unordered_map<std::size_t, unsigned int>&
+      off_process_owner() const;
+
+    /// Return map from all shared dofs to the sharing processes (not
+    /// including the current process) that share it.
+    ///
+    /// *Returns*
+    ///     boost::unordered_map<std::size_t, std::vector<unsigned int> >
+    ///         The map from dofs to list of processes
+    const boost::unordered_map<std::size_t, std::vector<unsigned int> >&
+      shared_dofs() const;
+
+    /// Return set of processes that share dofs with this process
+    ///
+    /// *Returns*
+    ///     std::set<std::size_t>
+    ///         The set of processes
+    const std::set<std::size_t>& neighbours() const;
+
+    /// Local-to-global mapping of dofs on a cell
+    ///
+    /// *Arguments*
+    ///     cell_index (std::size_t)
+    ///         The cell index.
+    ///
+    /// *Returns*
+    ///     std::vector<dolfin::la_index>
+    ///         Local-to-global mapping of dofs.
+    const std::vector<dolfin::la_index>& cell_dofs(std::size_t cell_index) const
+    {
+      dolfin_assert(cell_index < _dofmap.size());
+      return _dofmap[cell_index];
+    }
+
+    /// Tabulate local-local facet dofs
+    ///
+    /// *Arguments*
+    ///     dofs (std::size_t)
+    ///         Degrees of freedom.
+    ///     local_facet (std::size_t)
+    ///         The local facet.
+    void tabulate_facet_dofs(std::vector<std::size_t>& dofs,
+                             std::size_t local_facet) const;
+
+    /// Tabulate local-local mapping of dofs on entity (dim, local_entity)
+    ///
+    /// *Arguments*
+    ///     dofs (std::size_t)
+    ///         Degrees of freedom.
+    ///     dim (std::size_t)
+    ///         The entity dimension
+    ///     local_entity (std::size_t)
+    ///         The local entity index
+    void tabulate_entity_dofs(std::vector<std::size_t>& dofs,
+			      std::size_t dim, std::size_t local_entity) const;
+
+    /// Tabulate the coordinates of all dofs on a cell (UFC cell
+    /// version)
+    ///
+    /// *Arguments*
+    ///     coordinates (boost::multi_array<double, 2>)
+    ///         The coordinates of all dofs on a cell.
+    ///     vertex_coordinates (std::vector<double>)
+    ///         The cell vertex coordinates
+    ///     cell (Cell)
+    ///         The cell.
+    void tabulate_coordinates(boost::multi_array<double, 2>& coordinates,
+                              const std::vector<double>& vertex_coordinates,
+                              const Cell& cell) const;
+
+    /// Tabulate the coordinates of all dofs on this process. This
+    /// function is typically used by preconditioners that require the
+    /// spatial coordinates of dofs, for example for re-partitioning or
+    /// nullspace computations.
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         The dof coordinates (x0, y0, x1, y1, . . .)
+    std::vector<double> tabulate_all_coordinates(const Mesh& mesh) const;
+
+    /// Create a copy of the dof map
+    ///
+    /// *Returns*
+    ///     DofMap
+    ///         The Dofmap copy.
+    std::shared_ptr<GenericDofMap> copy() const;
+
+    /// Create a copy of the dof map on a new mesh
+    ///
+    /// *Arguments*
+    ///     new_mesh (_Mesh_)
+    ///         The new mesh to create the dof map on.
+    ///
+    /// *Returns*
+    ///     DofMap
+    ///         The new Dofmap copy.
+    std::shared_ptr<GenericDofMap> create(const Mesh& new_mesh) const;
+
+
+    /// Extract subdofmap component
+    ///
+    /// *Arguments*
+    ///     component (std::vector<std::size_t>)
+    ///         The component.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///
+    /// *Returns*
+    ///     DofMap
+    ///         The subdofmap component.
+    std::shared_ptr<GenericDofMap>
+        extract_sub_dofmap(const std::vector<std::size_t>& component,
+                           const Mesh& mesh) const;
+
+    /// Create a "collapsed" dofmap (collapses a sub-dofmap)
+    ///
+    /// *Arguments*
+    ///     collapsed_map (boost::unordered_map<std::size_t, std::size_t>)
+    ///         The "collapsed" map.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///
+    /// *Returns*
+    ///     DofMap
+    ///         The collapsed dofmap.
+    std::shared_ptr<GenericDofMap>
+          collapse(boost::unordered_map<std::size_t, std::size_t>&
+                   collapsed_map, const Mesh& mesh) const;
+
+    // FIXME: Document this function
+    std::vector<dolfin::la_index> dofs() const;
+
+    /// Set dof entries in vector to a specified value. Parallel layout
+    /// of vector must be consistent with dof map range. This
+    /// function is typically used to construct the null space of a
+    /// matrix operator.
+    ///
+    /// *Arguments*
+    ///     vector (_GenericVector_)
+    ///         The vector to set.
+    ///     value (double)
+    ///         The value to set.
+    void set(GenericVector& x, double value) const;
+
+    /// Set dof entries in vector to the x[i] coordinate of the dof
+    /// spatial coordinate. Parallel layout of vector must be consistent
+    /// with dof map range This function is typically used to
+    /// construct the null space of a matrix operator, e.g. rigid
+    /// body rotations.
+    ///
+    /// *Arguments*
+    ///     vector (_GenericVector_)
+    ///         The vector to set.
+    ///     value (double)
+    ///         The value to multiply to coordinate by.
+    ///     component (std::size_t)
+    ///         The coordinate index.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    void set_x(GenericVector& x, double value, std::size_t component,
+               const Mesh& mesh) const;
+
+    /// Return the underlying dof map data. Intended for internal library
+    /// use only.
+    ///
+    /// *Returns*
+    ///     std::vector<std::vector<dolfin::la_index> >
+    ///         The local-to-global map for each cell.
+    const std::vector<std::vector<dolfin::la_index> >& data() const
+    { return _dofmap; }
+
+    /// Return informal string representation (pretty-print)
+    ///
+    /// *Arguments*
+    ///     verbose (bool)
+    ///         Flag to turn on additional output.
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         An informal representation of the function space.
+    std::string str(bool verbose) const;
+
+  private:
+
+    // Friends
+    friend class DofMapBuilder;
+
+    // Check dimensional consistency between UFC dofmap and the mesh
+    static void check_dimensional_consistency(const ufc::dofmap& dofmap,
+                                              const Mesh& mesh);
+
+    // Check that mesh provides the entities needed by dofmap
+    static void check_provided_entities(const ufc::dofmap& dofmap,
+                                        const Mesh& mesh);
+
+    // Local-to-global dof map (dofs for cell dofmap[i])
+    std::vector<std::vector<dolfin::la_index> > _dofmap;
+
+    // UFC dof map
+    std::shared_ptr<const ufc::dofmap> _ufc_dofmap;
+
+    // Number global mesh entities. This is usually the same as what
+    // is reported by the mesh, but will differ for dofmaps constrained,
+    // e.g. dofmaps with periodoc bcs
+    std::vector<std::size_t> num_global_mesh_entities;
+
+    // Map from UFC dof numbering to renumbered dof (ufc_dof, actual_dof)
+    boost::unordered_map<std::size_t, std::size_t> ufc_map_to_dofmap;
+
+    // Restriction, pointer zero if not restricted
+    std::shared_ptr<const Restriction> _restriction;
+
+    // Flag to determine if the DofMap is a view
+    bool _is_view;
+
+    // Global dimension. Note that this may differ from the global
+    // dimension of the UFC dofmap if the function space is restricted
+    // or periodic.
+    std::size_t _global_dimension;
+
+    // UFC dof map offset
+    std::size_t _ufc_offset;
+
+    // Ownership range (dofs in this range are owned by this
+    // process). Set to (0, 0) if dofmap is a view
+    std::pair<std::size_t, std::size_t> _ownership_range;
+
+    // Map from dofs in local dof map are not owned by this process to
+    // the owner process
+    boost::unordered_map<std::size_t, unsigned int> _off_process_owner;
+
+    // List of processes that share a given dof
+    boost::unordered_map<std::size_t, std::vector<unsigned int> > _shared_dofs;
+
+    // Neighbours (processes that we share dofs with)
+    std::set<std::size_t> _neighbours;
+
+    // Map from slave to master mesh entities
+    std::shared_ptr<std::map<unsigned int, std::map<unsigned int,
+      std::pair<unsigned int, unsigned int> > > > slave_master_mesh_entities;
+  };
+}
+
+#endif
diff --git a/dolfin/fem/DofMapBuilder.cpp b/dolfin/fem/DofMapBuilder.cpp
new file mode 100644
index 0000000..e2a54ab
--- /dev/null
+++ b/dolfin/fem/DofMapBuilder.cpp
@@ -0,0 +1,1364 @@
+// Copyright (C) 2008-2013 Anders Logg, Ola Skavhaug and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson 2009
+// Modified by Garth N. Wells 2010-2012
+// Modified by Mikael Mortensen, 2012.
+// Modified by Joachim B Haga, 2012
+// Modified by Martin Alnaes, 2013
+//
+// First added:  2008-08-12
+// Last changed: 2013-01-08
+
+#include <ufc.h>
+#include <boost/random.hpp>
+#include <boost/unordered_map.hpp>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/graph/BoostGraphOrdering.h>
+#include <dolfin/graph/GraphBuilder.h>
+#include <dolfin/graph/SCOTCH.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/mesh/DistributedMeshTools.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/mesh/SubDomain.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include "DofMap.h"
+#include "DofMapBuilder.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void DofMapBuilder::build(
+  DofMap& dofmap,
+  const Mesh& mesh,
+  std::shared_ptr<const std::map<unsigned int, std::map<unsigned int,
+  std::pair<unsigned int, unsigned int> > > > slave_master_entities,
+  std::shared_ptr<const Restriction> restriction)
+{
+  // Start timer for dofmap initialization
+  Timer t0("Init dofmap");
+
+  // Check that mesh has been ordered
+  if (!mesh.ordered())
+  {
+     dolfin_error("DofMapBuiler.cpp",
+                  "create mapping of degrees of freedom",
+                  "Mesh is not ordered according to the UFC numbering convention. "
+                  "Consider calling mesh.order()");
+  }
+
+  // Build dofmap based on UFC-provided map. This function does not
+  // set local_range
+  map restricted_dofs_inverse;
+  build_ufc_dofmap(dofmap, restricted_dofs_inverse, mesh,
+                   slave_master_entities, restriction);
+
+  // Check if dofmap is distributed
+  const bool distributed = MPI::size(mesh.mpi_comm()) > 1;
+
+  // Build set of dofs that are not associated with a mesh entity
+  // (global dofs)
+  const std::set<std::size_t>  global_dofs = compute_global_dofs(dofmap);
+
+  // Determine and set dof block size
+  dolfin_assert(dofmap._ufc_dofmap);
+  const std::size_t block_size = compute_blocksize(*dofmap._ufc_dofmap);
+  dofmap.block_size = block_size;
+
+  // Re-order dofmap when distributed for process locality and set
+  // local_range
+  if (distributed)
+  {
+    reorder_distributed(dofmap, mesh, restriction, restricted_dofs_inverse,
+                        block_size, global_dofs);
+  }
+  else
+  {
+    // Optionally re-order local dofmap for spatial locality
+    const bool reorder = dolfin::parameters["reorder_dofs_serial"];
+    if (reorder)
+      reorder_local(dofmap, mesh, block_size, global_dofs);
+
+    // Set local dof ownbership range
+    dofmap._ownership_range = std::make_pair(0, dofmap.global_dimension());
+  }
+}
+//-----------------------------------------------------------------------------
+void DofMapBuilder::build_sub_map(DofMap& sub_dofmap,
+                                  const DofMap& parent_dofmap,
+                                  const std::vector<std::size_t>& component,
+                                  const Mesh& mesh)
+{
+  // Note: Ownership range is set to zero since dofmap is a view
+  dolfin_assert(!component.empty());
+
+  // Initialise offset from parent
+  std::size_t offset = parent_dofmap._ufc_offset;
+
+  // Extract ufc sub-dofmap from parent and get offset
+  dolfin_assert(parent_dofmap._ufc_dofmap);
+  sub_dofmap._ufc_dofmap
+    = extract_ufc_sub_dofmap(*(parent_dofmap._ufc_dofmap),
+                             offset, component,
+                             parent_dofmap.num_global_mesh_entities);
+  dolfin_assert(sub_dofmap._ufc_dofmap);
+
+  // Check for dimensional consistency between the dofmap and mesh
+  //check_dimensional_consistency(*_ufc_dofmap, mesh);
+
+  // Set UFC sub-dofmap offset
+  sub_dofmap._ufc_offset = offset;
+
+  // Check dimensional consistency between UFC dofmap and the mesh
+  //check_provided_entities(*_ufc_dofmap, mesh);
+
+  // Build UFC-based dof map for sub-dofmap
+  map restricted_dofs_inverse;
+  std::shared_ptr<const Restriction> restriction;
+  build_ufc_dofmap(sub_dofmap, restricted_dofs_inverse, mesh,
+                   parent_dofmap.slave_master_mesh_entities, restriction);
+
+  // Add offset to dofmap
+  for (std::size_t i = 0; i < sub_dofmap._dofmap.size(); ++i)
+    for (std::size_t j = 0; j < sub_dofmap._dofmap[i].size(); ++j)
+      sub_dofmap._dofmap[i][j] += offset;
+
+  // Correct dofmap for non-UFC numbering
+  sub_dofmap.ufc_map_to_dofmap.clear();
+  sub_dofmap._off_process_owner.clear();
+  sub_dofmap._shared_dofs.clear();
+  sub_dofmap._neighbours.clear();
+  if (!parent_dofmap.ufc_map_to_dofmap.empty())
+  {
+    boost::unordered_map<std::size_t, std::size_t>::const_iterator ufc_to_current_dof;
+    std::vector<std::vector<dolfin::la_index> >::iterator cell_map;
+    std::vector<dolfin::la_index>::iterator dof;
+    for (cell_map = sub_dofmap._dofmap.begin();
+        cell_map != sub_dofmap._dofmap.end(); ++cell_map)
+    {
+      for (dof = cell_map->begin(); dof != cell_map->end(); ++dof)
+      {
+        // Get dof index
+        ufc_to_current_dof = parent_dofmap.ufc_map_to_dofmap.find(*dof);
+        dolfin_assert(ufc_to_current_dof
+                      != parent_dofmap.ufc_map_to_dofmap.end());
+
+        // Add to ufc-to-current dof map
+        sub_dofmap.ufc_map_to_dofmap.insert(*ufc_to_current_dof);
+
+        // Set dof index
+        *dof = ufc_to_current_dof->second;
+
+        // Add to off-process dof owner map
+        boost::unordered_map<std::size_t, unsigned int>::const_iterator
+          parent_off_proc = parent_dofmap._off_process_owner.find(*dof);
+        if (parent_off_proc != parent_dofmap._off_process_owner.end())
+          sub_dofmap._off_process_owner.insert(*parent_off_proc);
+
+        // Add to shared-dof process map, and update the set of neighbours
+        boost::unordered_map<std::size_t, std::vector<unsigned int> >::const_iterator
+          parent_shared = parent_dofmap._shared_dofs.find(*dof);
+        if (parent_shared != parent_dofmap._shared_dofs.end())
+        {
+          sub_dofmap._shared_dofs.insert(*parent_shared);
+          sub_dofmap._neighbours.insert(parent_shared->second.begin(),
+                                        parent_shared->second.end());
+        }
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+std::size_t DofMapBuilder::build_constrained_vertex_indices(
+  const Mesh& mesh,
+  const std::map<unsigned int,
+  std::pair<unsigned int, unsigned int> >& slave_to_master_vertices,
+  std::vector<std::size_t>& modified_global_indices)
+{
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  // Get vertex sharing information (local index, [(sharing process p,
+  // local index on p)])
+  const boost::unordered_map<unsigned int, std::
+                             vector<std::pair<unsigned int, unsigned int> > >
+    shared_vertices = DistributedMeshTools::compute_shared_entities(mesh, 0);
+
+   // Mark shared vertices
+  std::vector<bool> vertex_shared(mesh.num_vertices(), false);
+  boost::unordered_map<unsigned int, std::vector<std::pair<unsigned int,
+      unsigned int> > >::const_iterator shared_vertex;
+  for (shared_vertex = shared_vertices.begin();
+       shared_vertex != shared_vertices.end(); ++shared_vertex)
+  {
+    dolfin_assert(shared_vertex->first < vertex_shared.size());
+    vertex_shared[shared_vertex->first] = true;
+  }
+
+  // Mark slave vertices
+  std::vector<bool> slave_vertex(mesh.num_vertices(), false);
+  std::map<unsigned int, std::pair<unsigned int,
+                                   unsigned int> >::const_iterator slave;
+  for (slave = slave_to_master_vertices.begin();
+       slave != slave_to_master_vertices.end(); ++slave)
+  {
+    dolfin_assert(slave->first < slave_vertex.size());
+    slave_vertex[slave->first] = true;
+  }
+
+  // MPI process number
+  const std::size_t proc_num = MPI::rank(mesh.mpi_comm());
+
+  // Communication data structures
+  std::vector<std::vector<std::size_t> >
+    new_shared_vertex_indices(MPI::size(mesh.mpi_comm()));
+
+  // Compute modified global vertex indices
+  std::size_t new_index = 0;
+  modified_global_indices
+    = std::vector<std::size_t>(mesh.num_vertices(),
+                               std::numeric_limits<std::size_t>::max());
+  for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+  {
+    const std::size_t local_index = vertex->index();
+    if (slave_vertex[local_index])
+    {
+      // Do nothing, will get new master index later
+    }
+    else if (vertex_shared[local_index])
+    {
+      // If shared, let lowest rank process number the vertex
+      boost::unordered_map<unsigned int, std::vector<std::pair<unsigned int, unsigned int> > >::const_iterator
+        it = shared_vertices.find(local_index);
+      dolfin_assert(it != shared_vertices.end());
+      const std::vector<std::pair<unsigned int, unsigned int> >& sharing_procs
+        = it->second;
+
+      // Figure out if this is the lowest rank process sharing the vertex
+      std::vector<std::pair<unsigned int, unsigned int> >::const_iterator
+       min_sharing_rank = std::min_element(sharing_procs.begin(),
+                                           sharing_procs.end());
+      std::size_t _min_sharing_rank = proc_num + 1;
+      if (min_sharing_rank != sharing_procs.end())
+        _min_sharing_rank = min_sharing_rank->first;
+
+      if (proc_num <= _min_sharing_rank)
+      {
+        // Re-number vertex
+        modified_global_indices[vertex->index()] = new_index;
+
+        // Add to list to communicate
+        std::vector<std::pair<unsigned int, unsigned int> >::const_iterator p;
+        for (p = sharing_procs.begin(); p != sharing_procs.end(); ++p)
+        {
+          dolfin_assert(p->first < new_shared_vertex_indices.size());
+
+          // Local index on remote process
+          new_shared_vertex_indices[p->first].push_back(p->second);
+
+          // Modified global index
+          new_shared_vertex_indices[p->first].push_back(new_index);
+        }
+
+        new_index++;
+      }
+    }
+    else
+      modified_global_indices[vertex->index()] = new_index++;
+  }
+
+  // Send number of owned entities to compute offeset
+  std::size_t offset = MPI::global_offset(mpi_comm, new_index, true);
+
+  // Add process offset to modified indices
+  for (std::size_t i = 0; i < modified_global_indices.size(); ++i)
+    modified_global_indices[i] += offset;
+
+  // Add process offset to shared vertex indices before sending
+  for (std::size_t p = 0; p < new_shared_vertex_indices.size(); ++p)
+    for (std::size_t i = 1; i < new_shared_vertex_indices[p].size(); i += 2)
+      new_shared_vertex_indices[p][i] += offset;
+
+  // Send/receive new indices for shared vertices
+  std::vector<std::vector<std::size_t> > received_vertex_data;
+  MPI::all_to_all(mesh.mpi_comm(), new_shared_vertex_indices,
+                  received_vertex_data);
+
+  // Set index for shared vertices that have been numbered by another
+  // process
+  for (std::size_t p = 0; p < received_vertex_data.size(); ++p)
+  {
+    const std::vector<std::size_t>& received_vertex_data_p
+      = received_vertex_data[p];
+    for (std::size_t i = 0; i < received_vertex_data_p.size(); i += 2)
+    {
+      const unsigned int local_index = received_vertex_data_p[i];
+      const std::size_t recv_new_index = received_vertex_data_p[i + 1];
+
+      dolfin_assert(local_index < modified_global_indices.size());
+      modified_global_indices[local_index] = recv_new_index;
+    }
+  }
+
+  // Request master vertex index from master owner
+  std::vector<std::vector<std::size_t> >
+    master_send_buffer(MPI::size(mpi_comm));
+  std::vector<std::vector<std::size_t> >
+    local_slave_index(MPI::size(mpi_comm));
+  std::map<unsigned int,
+           std::pair<unsigned int, unsigned int> >::const_iterator master;
+  for (master = slave_to_master_vertices.begin();
+       master != slave_to_master_vertices.end(); ++master)
+  {
+    const unsigned int local_index = master->first;
+    const unsigned int master_proc = master->second.first;
+    const unsigned int remote_master_local_index = master->second.second;
+    dolfin_assert(master_proc < local_slave_index.size());
+    dolfin_assert(master_proc < master_send_buffer.size());
+    local_slave_index[master_proc].push_back(local_index);
+    master_send_buffer[master_proc].push_back(remote_master_local_index);
+  }
+
+  // Send/receive master local indices for slave vertices
+  std::vector<std::vector<std::size_t> > received_slave_vertex_indices;
+  MPI::all_to_all(mpi_comm, master_send_buffer,
+                  received_slave_vertex_indices);
+
+  // Send back new master vertex index
+  std::vector<std::vector<std::size_t> >
+    master_vertex_indices(MPI::size(mpi_comm));
+  for (std::size_t p = 0; p < received_slave_vertex_indices.size(); ++p)
+  {
+    const std::vector<std::size_t>& local_master_indices
+      = received_slave_vertex_indices[p];
+    for (std::size_t i = 0; i < local_master_indices.size(); ++i)
+    {
+      std::size_t master_local_index = local_master_indices[i];
+      dolfin_assert(master_local_index < modified_global_indices.size());
+      master_vertex_indices[p].push_back(modified_global_indices[master_local_index]);
+    }
+  }
+
+  // Send/receive new global master indices for slave vertices
+  std::vector<std::vector<std::size_t> > received_new_slave_vertex_indices;
+  MPI::all_to_all(mpi_comm, master_vertex_indices,
+                  received_new_slave_vertex_indices);
+
+  // Set index for slave vertices
+  for (std::size_t p = 0; p < received_new_slave_vertex_indices.size(); ++p)
+  {
+    const std::vector<std::size_t>& new_indices
+      = received_new_slave_vertex_indices[p];
+    const std::vector<std::size_t>& local_indices = local_slave_index[p];
+    for (std::size_t i = 0; i < new_indices.size(); ++i)
+    {
+      const std::size_t local_index = local_indices[i];
+      const std::size_t new_global_index   = new_indices[i];
+
+      dolfin_assert(local_index < modified_global_indices.size());
+      modified_global_indices[local_index] = new_global_index;
+    }
+  }
+
+  // Send new indices to process that share a vertex but were not
+  // responsible for re-numbering
+  return MPI::sum(mpi_comm, new_index);
+}
+//-----------------------------------------------------------------------------
+void DofMapBuilder::reorder_local(DofMap& dofmap, const Mesh& mesh,
+                                  std::size_t block_size,
+				  const std::set<std::size_t>& global_dofs)
+{
+  // Global dimension
+  const std::size_t N = dofmap.global_dimension();
+
+  // Create empty graph
+  dolfin_assert(N % block_size == 0);
+  const std::size_t num_nodes = N/block_size;
+  Graph graph(num_nodes);
+
+  // Build local graph for blocks
+  std::vector<dolfin::la_index> dofs_tmp;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    const std::vector<dolfin::la_index>& dofs0
+      = dofmap.cell_dofs(cell->index());
+    const std::vector<dolfin::la_index>& dofs1
+      = dofmap.cell_dofs(cell->index());
+
+    dolfin_assert(dofs0.size() % block_size == 0);
+    const std::size_t nodes_per_cell = dofs0.size()/block_size;
+
+    // Build vector of graph 'edges'
+    dofs_tmp.resize(nodes_per_cell);
+    std::size_t dof_counter = 0;
+    for (std::size_t i = 0; i < nodes_per_cell; ++i)
+    {
+      if (global_dofs.find(dofs0[i]) == global_dofs.end())
+      {
+        if ((dofs0[i] % num_nodes) != (dofs1[i] % num_nodes))
+        {
+          dofs_tmp[i] = dofs1[i] % num_nodes;
+          ++dof_counter;
+        }
+      }
+    }
+
+    // Add graph 'edges'
+    for (std::size_t i = 0; i < nodes_per_cell; ++i)
+    {
+      if (global_dofs.find(dofs1[i]) == global_dofs.end())
+      {
+        graph[dofs0[i] % num_nodes].insert(dofs_tmp.begin(),
+                                           dofs_tmp.begin() + dof_counter);
+      }
+    }
+  }
+
+  // Reorder block graph
+  const std::string ordering_library
+    = dolfin::parameters["dof_ordering_library"];
+  std::vector<std::size_t> block_remap;
+  if (ordering_library == "Boost")
+    block_remap = BoostGraphOrdering::compute_cuthill_mckee(graph, true);
+  else if (ordering_library == "SCOTCH")
+    block_remap = SCOTCH::compute_gps(graph);
+  else if (ordering_library == "random")
+  {
+    // NOTE: Randomised dof ordering should only be used for
+    // testing/benchmarking
+    block_remap.resize(graph.size());
+    for (std::size_t i = 0; i < block_remap.size(); ++i)
+      block_remap[i] = i;
+    std::random_shuffle(block_remap.begin(), block_remap.end());
+  }
+  else
+  {
+    dolfin_error("DofMapBuilder.cpp",
+                 "reorder degrees of freedom",
+                 "The requested ordering library '%s' is unknown", ordering_library.c_str());
+  }
+
+  // Re-number dofs for each cell
+  std::vector<std::vector<dolfin::la_index> >::iterator cell_map;
+  std::vector<dolfin::la_index>::iterator dof;
+  for (cell_map = dofmap._dofmap.begin(); cell_map != dofmap._dofmap.end();
+       ++cell_map)
+  {
+    for (dof = cell_map->begin(); dof != cell_map->end(); ++dof)
+    {
+      const std::size_t old_node = (*dof) % num_nodes;
+      const std::size_t new_node = block_remap[old_node];
+      *dof = new_node*block_size + (*dof)/num_nodes;
+    }
+  }
+
+  // Store re-ordering map (from UFC dofmap)
+  dolfin_assert(dofmap.ufc_map_to_dofmap.empty());
+  for (std::size_t i = 0; i < dofmap.global_dimension(); ++i)
+  {
+    const std::size_t old_node = i % num_nodes;
+    const std::size_t new_node = block_remap[old_node];
+    dofmap.ufc_map_to_dofmap[i] = new_node*block_size + i/num_nodes;
+  }
+}
+//-----------------------------------------------------------------------------
+void DofMapBuilder::build_ufc_dofmap(
+  DofMap& dofmap,
+  DofMapBuilder::map& restricted_dofs_inverse,
+  const Mesh& mesh,
+  std::shared_ptr<const std::map<unsigned int, std::map<unsigned int,
+  std::pair<unsigned int, unsigned int> > > > slave_master_entities,
+  std::shared_ptr<const Restriction> restriction)
+{
+  // Start timer for dofmap initialization
+  Timer t0("Init dofmap from UFC dofmap");
+
+  // Sanity checks on UFC dofmap
+  dolfin_assert(dofmap._ufc_dofmap);
+  dolfin_assert(dofmap._ufc_dofmap->geometric_dimension()
+                == mesh.geometry().dim());
+  dolfin_assert(dofmap._ufc_dofmap->topological_dimension()
+                == mesh.topology().dim());
+
+  // Clear ufc-dofs-to-actual-dofs
+  dofmap.ufc_map_to_dofmap.clear();
+
+  // Global enity indices
+  std::vector<std::vector<std::size_t> >
+    global_entity_indices(mesh.topology().dim() + 1);
+
+  // Generate and number required mesh entities. Mesh indices are modified
+  // for periodic bcs
+  const std::size_t D = mesh.topology().dim();
+  dofmap.num_global_mesh_entities
+    = std::vector<std::size_t>(mesh.topology().dim() + 1, 0);
+  if (!slave_master_entities)
+  {
+    // Compute number of mesh entities
+    for (std::size_t d = 0; d <= D; ++d)
+    {
+      if (dofmap._ufc_dofmap->needs_mesh_entities(d))
+      {
+        // Number entities globally
+        DistributedMeshTools::number_entities(mesh, d);
+
+        // Store entity indices
+        global_entity_indices[d].resize(mesh.size(d));
+        for (MeshEntityIterator e(mesh, d); !e.end(); ++e)
+          global_entity_indices[d][e->index()] = e->global_index();
+
+        // Store number of global entities
+        dofmap.num_global_mesh_entities[d] = mesh.size_global(d);
+      }
+    }
+  }
+  else
+  {
+    // Compute number of mesh entities
+    for (std::size_t d = 0; d <= D; ++d)
+    {
+      if (dofmap._ufc_dofmap->needs_mesh_entities(d))
+      {
+        // Get master-slave map
+        dolfin_assert(slave_master_entities->find(d)
+                      != slave_master_entities->end());
+        const std::map<unsigned int, std::pair<unsigned int, unsigned int> >&
+          slave_to_master_entities = slave_master_entities->find(d)->second;
+
+        if (d == 0)
+        {
+          // Compute modified global vertex indices
+          const std::size_t num_vertices
+            = build_constrained_vertex_indices(mesh,
+                slave_to_master_entities, global_entity_indices[0]);
+          dofmap.num_global_mesh_entities[0] = num_vertices;
+        }
+        else
+        {
+          // Get number of entities
+          std::map<unsigned int, std::set<unsigned int> > shared_entities;
+          const std::size_t num_entities
+            = DistributedMeshTools::number_entities(mesh,
+                                                    slave_to_master_entities,
+                                                    global_entity_indices[d],
+                                                    shared_entities, d);
+          dofmap.num_global_mesh_entities[d] = num_entities;
+        }
+      }
+    }
+  }
+
+  // Allocate space for dof map
+  dofmap._dofmap.resize(mesh.num_cells());
+  dofmap._off_process_owner.clear();
+  dolfin_assert(dofmap._ufc_dofmap);
+
+  // Maps used to renumber dofs for restricted meshes
+  map restricted_dofs;         // map from old to new dof
+
+  // Holder for UFC 64-bit dofmap integers
+  std::vector<std::size_t> ufc_dofs;
+
+  // Get standard local element dimension
+  const std::size_t local_dim = dofmap._ufc_dofmap->local_dimension();
+
+  // Creat UFC cell and allocate memory
+  ufc::cell ufc_cell;
+  ufc_cell.entity_indices.resize(D + 1);
+
+  // Build dofmap from ufc::dofmap
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Skip cells not included in restriction
+    if (restriction && !restriction->contains(*cell))
+      continue;
+
+    ufc_cell.orientation = cell->mesh().cell_orientations()[cell->index()];
+    for (std::size_t d = 0; d < D; ++d)
+    {
+      if (!global_entity_indices[d].empty())
+      {
+        ufc_cell.entity_indices[d].resize(cell->num_entities(d));
+        for (std::size_t i = 0; i < cell->num_entities(d); ++i)
+        {
+          ufc_cell.entity_indices[d][i]
+            = global_entity_indices[d][cell->entities(d)[i]];
+        }
+      }
+    }
+
+    // FIXME: Check the below two for local vs global
+    ufc_cell.entity_indices[D].resize(1);
+    ufc_cell.entity_indices[D][0] = cell->index();
+    ufc_cell.index = cell->index();
+
+    // Get container for cell dofs
+    std::vector<dolfin::la_index>& cell_dofs = dofmap._dofmap[cell->index()];
+    cell_dofs.resize(local_dim);
+
+    // Tabulate standard UFC dof map
+    ufc_dofs.resize(local_dim);
+    dofmap._ufc_dofmap->tabulate_dofs(ufc_dofs.data(),
+                                      dofmap.num_global_mesh_entities,
+                                      ufc_cell);
+    std::copy(ufc_dofs.begin(), ufc_dofs.end(), cell_dofs.begin());
+
+    // Renumber dofs if mesh is restricted
+    if (restriction)
+    {
+      for (std::size_t i = 0; i < cell_dofs.size(); i++)
+      {
+        map_iterator it = restricted_dofs.find(cell_dofs[i]);
+        if (it == restricted_dofs.end())
+        {
+          const std::size_t dof = restricted_dofs.size();
+          restricted_dofs[cell_dofs[i]] = dof;
+          restricted_dofs_inverse[dof] = cell_dofs[i];
+          cell_dofs[i] = dof;
+        }
+        else
+          cell_dofs[i] = it->second;
+      }
+    }
+  }
+
+  // Set global dimension
+  if (restriction)
+    dofmap._global_dimension = restricted_dofs.size();
+  else
+  {
+    dofmap._global_dimension
+      = dofmap._ufc_dofmap->global_dimension(dofmap.num_global_mesh_entities);
+  }
+}
+//-----------------------------------------------------------------------------
+void DofMapBuilder::reorder_distributed(DofMap& dofmap,
+                            const Mesh& mesh,
+                            std::shared_ptr<const Restriction> restriction,
+                            const map& restricted_dofs_inverse,
+                            std::size_t block_size,
+                            const std::set<std::size_t>& global_dofs)
+{
+
+  // Allocate data structure to hold node ownership (multiple dofs can
+  // live at one node)
+  boost::array<DofMapBuilder::set, 3> node_ownership;
+
+  // Allocate map data structure from a shared node to the processes
+  // that share it
+  DofMapBuilder::vec_map shared_node_processes;
+
+  // Computed owned and shared nodes (and owned and un-owned)
+  compute_node_ownership(node_ownership, shared_node_processes, dofmap,
+                         global_dofs, mesh, restriction,
+                         restricted_dofs_inverse, block_size);
+
+  // Renumber owned dofs and receive new numbering for unowned shared
+  // dofs
+  parallel_renumber(node_ownership, shared_node_processes, dofmap, global_dofs,
+		    mesh, restriction, restricted_dofs_inverse, block_size);
+}
+//-----------------------------------------------------------------------------
+void DofMapBuilder::compute_node_ownership(boost::array<set, 3>& node_ownership,
+                              vec_map& shared_node_processes,
+                              DofMap& dofmap,
+                              const std::set<std::size_t>& global_dofs,
+                              const Mesh& mesh,
+                              std::shared_ptr<const Restriction> restriction,
+                              const map& restricted_nodes_inverse,
+                              std::size_t block_size)
+{
+  log(TRACE, "Determining dof ownership for parallel dof map");
+
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  const std::size_t N = dofmap.global_dimension();
+  dolfin_assert(N % block_size == 0);
+  const std::size_t num_nodes = N/block_size;
+
+  if (restriction)
+    dolfin_assert(block_size == 1);
+
+  // References to 'node' ownership sets
+  set& owned_nodes          = node_ownership[0];
+  set& shared_owned_nodes   = node_ownership[1];
+  set& shared_unowned_nodes = node_ownership[2];
+
+  // Clear data structures
+  owned_nodes.clear();
+  shared_owned_nodes.clear();
+  shared_unowned_nodes.clear();
+
+  // Data structures for computing ownership
+  boost::unordered_map<std::size_t, std::size_t> node_vote;
+  std::vector<std::size_t> facet_dofs(dofmap.num_facet_dofs());
+
+  // Communication buffer
+  std::vector<std::size_t> send_buffer;
+
+  // Extract the interior boundary
+  BoundaryMesh boundary(mesh, "local");
+
+  // Create a random number generator for ownership 'voting'
+  boost::mt19937 engine(MPI::rank(mpi_comm));
+  boost::uniform_int<> distribution(0, 100000000);
+  boost::variate_generator<boost::mt19937&, boost::uniform_int<> >
+    rng(engine, distribution);
+
+  // Build set of dofs on process boundary (first assuming that all
+  // are owned by this process)
+  const MeshFunction<std::size_t>& cell_map
+    = boundary.entity_map(boundary.topology().dim());
+  if (!cell_map.empty())
+  {
+    for (CellIterator _f(boundary); !_f.end(); ++_f)
+    {
+      // Create a vote per facet
+      const std::size_t facet_vote = rng();
+
+      // Get boundary facet
+      Facet f(mesh, cell_map[*_f]);
+
+      // Get cell to which facet belongs (pick first)
+      Cell c(mesh, f.entities(mesh.topology().dim())[0]);
+
+      // Skip cells not included in restriction
+      if (restriction && !restriction->contains(c))
+        continue;
+
+      // Tabulate dofs on cell
+      const std::vector<dolfin::la_index>& cell_dofs
+        = dofmap.cell_dofs(c.index());
+
+      // Tabulate which dofs are on the facet
+      dofmap.tabulate_facet_dofs(facet_dofs, c.index(f));
+
+      // Insert shared nodes into set and assign a 'vote'
+      dolfin_assert(dofmap.num_facet_dofs() % block_size == 0);
+      for (std::size_t i = 0; i < dofmap.num_facet_dofs(); ++i)
+      {
+        // Get facet node
+        size_t facet_node = cell_dofs[facet_dofs[i]] % num_nodes;
+
+        // Map back to original (and common) numbering for restricted
+        // space
+        if (restriction)
+        {
+          const map_iterator it = restricted_nodes_inverse.find(facet_node);
+          dolfin_assert(it != restricted_nodes_inverse.end());
+          facet_node = it->second;
+        }
+
+        // Add to list of shared nodes
+        if (shared_owned_nodes.find(facet_node) == shared_owned_nodes.end())
+        {
+          shared_owned_nodes.insert(facet_node);
+          node_vote[facet_node] = facet_vote;
+
+          send_buffer.push_back(facet_node);
+          send_buffer.push_back(node_vote[facet_node]);
+        }
+      }
+    }
+  }
+
+  // FIXME: The below algortihm can be improved (made more scalable)
+  //        by distributing (dof, process) pairs to 'owner' range owner,
+  //        then letting each process get the sharing process list. This
+  //        will avoid interleaving communication and computation.
+
+  // Decide ownership of shared nodes
+  const std::size_t num_prococesses = MPI::size(mpi_comm);
+  const std::size_t process_number = MPI::rank(mpi_comm);
+  std::vector<std::size_t> recv_buffer;
+  for (std::size_t k = 1; k < num_prococesses; ++k)
+  {
+    const std::size_t src
+      = (process_number - k + num_prococesses) % num_prococesses;
+    const std::size_t dest = (process_number + k) % num_prococesses;
+    MPI::send_recv(mpi_comm, send_buffer, dest, recv_buffer, src);
+    for (std::size_t i = 0; i < recv_buffer.size(); i += 2)
+    {
+      const std::size_t received_node = recv_buffer[i];
+      const std::size_t received_vote = recv_buffer[i + 1];
+
+      if (shared_owned_nodes.find(received_node) != shared_owned_nodes.end())
+      {
+        // Move dofs with higher ownership votes from shared to shared
+        // but not owned
+        if (received_vote < node_vote[received_node])
+        {
+          shared_unowned_nodes.insert(received_node);
+          shared_owned_nodes.erase(received_node);
+        }
+        else if (received_vote == node_vote[received_node]
+                 && process_number > src)
+        {
+          // If votes are equal, let lower rank process take ownership
+          shared_unowned_nodes.insert(received_node);
+          shared_owned_nodes.erase(received_node);
+        }
+
+        // Remember the sharing of the node
+        shared_node_processes[received_node].push_back(src);
+      }
+      else if (shared_unowned_nodes.find(received_node)
+               != shared_unowned_nodes.end())
+      {
+        // Remember the sharing of the node
+        shared_node_processes[received_node].push_back(src);
+      }
+    }
+  }
+
+  // Add/remove global dofs to/from relevant sets (last process owns
+  // global dofs)
+  if (process_number == num_prococesses - 1)
+  {
+    shared_owned_nodes.insert(global_dofs.begin(), global_dofs.end());
+    for (std::set<std::size_t>::const_iterator dof = global_dofs.begin();
+         dof != global_dofs.end(); ++dof)
+    {
+      set::const_iterator _dof = shared_unowned_nodes.find(*dof);
+      if (_dof != shared_unowned_nodes.end())
+        shared_unowned_nodes.erase(_dof);
+    }
+  }
+  else
+  {
+    shared_unowned_nodes.insert(global_dofs.begin(), global_dofs.end());
+    for (std::set<std::size_t>::const_iterator dof = global_dofs.begin();
+         dof != global_dofs.end(); ++dof)
+    {
+      set::const_iterator _dof = shared_owned_nodes.find(*dof);
+      if (_dof != shared_owned_nodes.end())
+        shared_owned_nodes.erase(_dof);
+    }
+  }
+
+  // Mark all shared-and-owned dofs as owned by the processes
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    const std::vector<dolfin::la_index>& cell_dofs
+      = dofmap.cell_dofs(cell->index());
+    for (std::size_t i = 0; i < cell_dofs.size(); ++i)
+    {
+      // Get cell node
+      size_t cell_node = cell_dofs[i] % num_nodes;
+
+      // Map back to original (and common) numbering for restricted
+      // space
+      if (restriction)
+      {
+        const map_iterator it = restricted_nodes_inverse.find(cell_node);
+        dolfin_assert(it != restricted_nodes_inverse.end());
+        cell_node = it->second;
+      }
+
+      // Mark dof as owned if not in unowned set
+      if (shared_unowned_nodes.find(cell_node) == shared_unowned_nodes.end())
+        owned_nodes.insert(cell_node);
+    }
+  }
+
+  // Check or set global dimension
+  if (restriction)
+  {
+    // Global dimension for restricted space needs to be computed here
+    // since it is not know by the UFC dof map.
+    const std::size_t _owned_dim = owned_nodes.size();
+    const std::size_t _global_dimension = block_size*MPI::sum(mpi_comm,
+                                                              _owned_dim);
+    dofmap._global_dimension = _global_dimension;
+  }
+  else
+  {
+    const std::size_t _owned_dim = owned_nodes.size();
+    dolfin_assert(block_size*MPI::sum(mpi_comm, _owned_dim)
+                  == dofmap.global_dimension());
+  }
+
+  log(TRACE, "Finished determining dof ownership for parallel dof map");
+}
+//-----------------------------------------------------------------------------
+void DofMapBuilder::parallel_renumber(
+  const boost::array<set, 3>& node_ownership,
+  const vec_map& shared_node_processes,
+  DofMap& dofmap,
+  const std::set<std::size_t>& global_dofs,
+  const Mesh& mesh,
+  std::shared_ptr<const Restriction> restriction,
+  const map& restricted_nodes_inverse,
+  std::size_t block_size)
+{
+  log(TRACE, "Renumber dofs for parallel dof map");
+
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  const std::size_t N = dofmap.global_dimension();
+  dolfin_assert(N % block_size == 0);
+  const std::size_t num_nodes = N/block_size;
+
+  // References to dof ownership sets
+  const set& owned_nodes          = node_ownership[0];
+  const set& shared_owned_nodes   = node_ownership[1];
+  const set& shared_unowned_nodes = node_ownership[2];
+
+  // FIXME: Handle double-renumbered dof map
+  if (!dofmap.ufc_map_to_dofmap.empty())
+  {
+    dolfin_error("DofMapBuilder.cpp",
+                 "compute parallel renumbering of degrees of freedom",
+                 "The degree of freedom mapping cannot be renumbered twice");
+  }
+
+  const std::vector<std::vector<dolfin::la_index> >& old_dofmap
+    = dofmap._dofmap;
+  std::vector<std::vector<dolfin::la_index> > new_dofmap(old_dofmap.size());
+  dolfin_assert(old_dofmap.size() == mesh.num_cells());
+
+  // Compute offset for owned and non-shared nodes
+  const std::size_t process_offset
+    = MPI::global_offset(mpi_comm, owned_nodes.size(), true);
+
+  // Clear some data
+  dofmap._off_process_owner.clear();
+
+  // Create graph
+  Graph graph(owned_nodes.size());
+
+  // Build graph for re-ordering. Below block is scoped to clear working
+  // data structures once graph is constructed.
+  {
+    // Create contiguous local numbering for locally owned dofs
+    std::size_t my_counter = 0;
+    boost::unordered_map<std::size_t, std::size_t> my_old_to_new_node_index;
+    for (set_iterator owned_node = owned_nodes.begin();
+          owned_node != owned_nodes.end(); ++owned_node, my_counter++)
+    {
+      my_old_to_new_node_index[*owned_node] = my_counter;
+    }
+
+    // Build local graph, based on old dof map, with contiguous numbering
+    for (std::size_t cell = 0; cell < old_dofmap.size(); ++cell)
+    {
+      // Cell dofmaps with old indices
+      const std::vector<dolfin::la_index>& dofs0 = dofmap.cell_dofs(cell);
+      const std::vector<dolfin::la_index>& dofs1 = dofmap.cell_dofs(cell);
+
+      dolfin_assert(dofs0.size() % block_size == 0);
+      const std::size_t nodes_per_cell = dofs0.size()/block_size;
+
+      // Loop over each node in dofs0
+      std::vector<dolfin::la_index>::const_iterator dof0, dof1;
+      for (std::size_t i = 0; i < nodes_per_cell; ++i)
+      {
+	if (global_dofs.find(dofs0[i]) != global_dofs.end())
+	  continue;
+
+        const std::size_t n0_old = dofs0[i] % num_nodes;
+
+        // Get new node index from contiguous map
+        boost::unordered_map<std::size_t, std::size_t>::const_iterator n0
+            = my_old_to_new_node_index.find(n0_old);
+        if (n0 != my_old_to_new_node_index.end())
+        {
+          const std::size_t n0_local = n0->second;
+          dolfin_assert(n0_local < graph.size());
+          for (std::size_t j = 0; j < nodes_per_cell; ++j)
+          {
+	    if (global_dofs.find(dofs0[j]) != global_dofs.end())
+	      continue;
+
+            const std::size_t n1_old = dofs1[j] % num_nodes;
+            boost::unordered_map<std::size_t, std::size_t>::const_iterator
+              n1 = my_old_to_new_node_index.find(n1_old);
+            if (n1 != my_old_to_new_node_index.end())
+            {
+              const std::size_t n1_local = n1->second;
+              if (n0_local != n1_local)
+                graph[n0_local].insert(n1_local);
+            }
+          }
+        }
+      }
+    }
+  }
+
+  // Reorder nodes locally
+  // Reorder block graph
+  const std::string ordering_library
+    = dolfin::parameters["dof_ordering_library"];
+  std::vector<std::size_t> node_remap;
+  if (ordering_library == "Boost")
+    node_remap = BoostGraphOrdering::compute_cuthill_mckee(graph, true);
+  else if (ordering_library == "SCOTCH")
+    node_remap = SCOTCH::compute_gps(graph);
+  else if (ordering_library == "random")
+  {
+    // NOTE: Randomised dof ordering should only be used for
+    // testing/benchmarking
+    node_remap.resize(graph.size());
+    for (std::size_t i = 0; i < node_remap.size(); ++i)
+      node_remap[i] = i;
+    std::random_shuffle(node_remap.begin(), node_remap.end());
+  }
+  else
+  {
+    dolfin_error("DofMapBuilder.cpp",
+                 "reorder degrees of freedom",
+                 "The requested ordering library '%s' is unknown",
+                 ordering_library.c_str());
+  }
+
+  // Map from old to new index for dofs
+  boost::unordered_map<std::size_t, std::size_t> old_to_new_node_index;
+
+  // Renumber owned dofs and buffer nodes that are owned but shared with
+  // another process
+  std::size_t counter = 0;
+  std::vector<std::size_t> send_buffer;
+  for (set_iterator owned_node = owned_nodes.begin();
+       owned_node != owned_nodes.end(); ++owned_node, counter++)
+  {
+    // Set new node number
+    old_to_new_node_index[*owned_node] = process_offset + node_remap[counter];
+
+    // Update UFC-to-renumbered map for new dof number
+    for (std::size_t i = 0; i < block_size; ++i)
+    {
+      std::size_t ufc_dof_index = *owned_node + i*num_nodes;
+      std::size_t new_dof_index = (process_offset
+                                   + node_remap[counter])*block_size + i;
+
+      dofmap.ufc_map_to_dofmap[ufc_dof_index] = new_dof_index;
+    }
+
+    // If this node is shared and owned, buffer old and new index for
+    // sending
+    if (shared_owned_nodes.find(*owned_node) != shared_owned_nodes.end())
+    {
+      send_buffer.push_back(*owned_node);
+      send_buffer.push_back(process_offset + node_remap[counter]);
+    }
+  }
+
+  // FIXME: The below algortihm can be improved (made more scalable)
+  //        by distributing (dof, process) pairs to 'owner' range owner,
+  //        then letting each process get the sharing process list. This
+  //        will avoid interleaving communication and computation.
+
+  // Exchange new node numbers for nodes that are shared
+  const std::size_t num_processes = MPI::size(mpi_comm);
+  const std::size_t process_number = MPI::rank(mpi_comm);
+  std::vector<std::size_t> recv_buffer;
+  for (std::size_t k = 1; k < num_processes; ++k)
+  {
+    const std::size_t src
+      = (process_number - k + num_processes) % num_processes;
+    const std::size_t dest = (process_number + k) % num_processes;
+    MPI::send_recv(mpi_comm, send_buffer, dest, recv_buffer, src);
+
+    // Add dofs renumbered by another process to the old-to-new map
+    for (std::size_t i = 0; i < recv_buffer.size(); i += 2)
+    {
+      const std::size_t received_old_node_index = recv_buffer[i];
+      const std::size_t received_new_node_index = recv_buffer[i + 1];
+
+      // Check if this process has shared dof (and is not the owner)
+      if (shared_unowned_nodes.find(received_old_node_index)
+          != shared_unowned_nodes.end())
+      {
+        // Add to old-to-new node map
+        old_to_new_node_index[received_old_node_index]
+          = received_new_node_index;
+
+        // Store map from off-process dof to owner and update
+        // UFC-to-renumbered map
+        for (std::size_t i = 0; i < block_size; ++i)
+        {
+          std::size_t ufc_dof_index = received_old_node_index + i*num_nodes;
+          std::size_t new_dof_index = received_new_node_index*block_size + i;
+          dofmap._off_process_owner[new_dof_index] = src;
+
+          // Update UFC-to-renumbered map
+          dofmap.ufc_map_to_dofmap[ufc_dof_index] = new_dof_index;
+        }
+      }
+    }
+  }
+
+  // FIXME: Should dofmap._shared_dofs be cleared?
+
+  // Insert the shared-dof-to-process mapping into the dofmap,
+  // renumbering as necessary
+  for (vec_map::const_iterator it = shared_node_processes.begin();
+       it != shared_node_processes.end(); ++it)
+  {
+    // Check for shared node in old_to_new_node_index map
+    boost::unordered_map<std::size_t, std::size_t>::const_iterator
+      new_index = old_to_new_node_index.find(it->first);
+
+    if (new_index == old_to_new_node_index.end())
+    {
+      for (std::size_t i = 0; i < block_size; ++i)
+      {
+        const std::size_t dof = it->first*block_size + i;
+        dofmap._shared_dofs.insert(std::make_pair(dof, it->second));
+      }
+    }
+    else
+    {
+      for (std::size_t i = 0; i < block_size; ++i)
+      {
+        const std::size_t dof = (new_index->second)*block_size + i;
+        dofmap._shared_dofs.insert(std::make_pair(dof, it->second));
+      }
+    }
+    dofmap._neighbours.insert(it->second.begin(), it->second.end());
+  }
+
+  // Build new dofmap
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Skip cells not included in restriction
+    if (restriction && !restriction->contains(*cell))
+      continue;
+
+    // Get cell index and dimension
+    const std::size_t cell_index = cell->index();
+    const std::size_t cell_dimension = dofmap.cell_dimension(cell_index);
+
+    // Resize cell map and insert dofs
+    new_dofmap[cell_index].resize(cell_dimension);
+    for (std::size_t i = 0; i < cell_dimension; ++i)
+    {
+      const std::size_t old_index = old_dofmap[cell_index][i];
+      const std::size_t old_node  = old_index % num_nodes;
+      const std::size_t new_node  = old_to_new_node_index[old_node];
+      new_dofmap[cell_index][i]   = new_node*block_size + old_index/num_nodes;
+    }
+  }
+
+  // Set new dof map
+  dofmap._dofmap = new_dofmap;
+
+  // Set ownership range
+  dofmap._ownership_range
+    = std::make_pair(block_size*process_offset,
+                     block_size*(process_offset + owned_nodes.size()));
+
+  log(TRACE, "Finished renumbering dofs for parallel dof map");
+}
+//-----------------------------------------------------------------------------
+std::set<std::size_t> DofMapBuilder::compute_global_dofs(const DofMap& dofmap)
+{
+  // Compute global dof indices
+  std::size_t offset = 0;
+  std::set<std::size_t> global_dof_indices;
+  compute_global_dofs(global_dof_indices, offset, dofmap._ufc_dofmap, dofmap);
+
+  return global_dof_indices;
+}
+//-----------------------------------------------------------------------------
+void DofMapBuilder::compute_global_dofs(std::set<std::size_t>& global_dofs,
+                          std::size_t& offset,
+                          std::shared_ptr<const ufc::dofmap> ufc_dofmap,
+                          const DofMap& dofmap)
+{
+  dolfin_assert(ufc_dofmap);
+
+  if (ufc_dofmap->num_sub_dofmaps() == 0)
+  {
+    // Check if dofmap is for global dofs
+    bool global_dof = true;
+    for (std::size_t d = 0; d < dofmap.num_global_mesh_entities.size(); ++d)
+    {
+      if (ufc_dofmap->needs_mesh_entities(d))
+      {
+        global_dof = false;
+        break;
+      }
+    }
+
+    if (global_dof)
+    {
+      // Check that we have just one dof
+      if (ufc_dofmap->global_dimension(dofmap.num_global_mesh_entities) != 1)
+      {
+        dolfin_error("DofMapBuilder.cpp",
+                     "compute global degrees of freedom",
+                     "Global degree of freedom has dimension != 1");
+      }
+
+      // Create dummy cell argument to tabulate single global dof
+      std::unique_ptr<ufc::cell> ufc_cell(new ufc::cell);
+      std::size_t dof = 0;
+      ufc_dofmap->tabulate_dofs(&dof, dofmap.num_global_mesh_entities,
+                                *ufc_cell);
+
+      // Insert global dof index
+      std::pair<std::set<std::size_t>::iterator, bool> ret
+        = global_dofs.insert(dof + offset);
+      if (!ret.second)
+      {
+        dolfin_error("DofMapBuilder.cpp",
+                     "compute global degrees of freedom",
+                     "Global degree of freedom already exists");
+      }
+    }
+  }
+  else
+  {
+    // Loop through sub-dofmap looking for global dofs
+    for (std::size_t i = 0; i < ufc_dofmap->num_sub_dofmaps(); ++i)
+    {
+      // Extract sub-dofmap and intialise
+      std::shared_ptr<ufc::dofmap>
+        sub_dofmap(ufc_dofmap->create_sub_dofmap(i));
+
+      compute_global_dofs(global_dofs, offset, sub_dofmap, dofmap);
+
+      // Get offset
+      if (sub_dofmap->num_sub_dofmaps() == 0)
+        offset += sub_dofmap->global_dimension(dofmap.num_global_mesh_entities);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<ufc::dofmap> DofMapBuilder::extract_ufc_sub_dofmap(
+  const ufc::dofmap& ufc_dofmap,
+  std::size_t& offset,
+  const std::vector<std::size_t>& component,
+  const std::vector<std::size_t>& num_global_mesh_entities)
+{
+  // Check if there are any sub systems
+  if (ufc_dofmap.num_sub_dofmaps() == 0)
+  {
+    dolfin_error("DofMap.cpp",
+                 "extract subsystem of degree of freedom mapping",
+                 "There are no subsystems");
+  }
+
+  // Check that a sub system has been specified
+  if (component.empty())
+  {
+    dolfin_error("DofMap.cpp",
+                 "extract subsystem of degree of freedom mapping",
+                 "No system was specified");
+  }
+
+  // Check the number of available sub systems
+  if (component[0] >= ufc_dofmap.num_sub_dofmaps())
+  {
+    dolfin_error("DofMap.cpp",
+                 "extract subsystem of degree of freedom mapping",
+                 "Requested subsystem (%d) out of range [0, %d)",
+                 component[0], ufc_dofmap.num_sub_dofmaps());
+  }
+
+  // Add to offset if necessary
+  for (std::size_t i = 0; i < component[0]; i++)
+  {
+    // Extract sub dofmap
+    std::unique_ptr<ufc::dofmap>
+      ufc_tmp_dofmap(ufc_dofmap.create_sub_dofmap(i));
+    dolfin_assert(ufc_tmp_dofmap);
+
+    // Check dimensional consistency between UFC dofmap and the mesh
+    //check_dimensional_consistency(ufc_dofmap, mesh);
+
+    // Get offset
+    offset += ufc_tmp_dofmap->global_dimension(num_global_mesh_entities);
+  }
+
+  // Create UFC sub-system
+  std::shared_ptr<ufc::dofmap>
+    sub_dofmap(ufc_dofmap.create_sub_dofmap(component[0]));
+  dolfin_assert(sub_dofmap);
+
+  // Return sub-system if sub-sub-system should not be extracted,
+  // otherwise recursively extract the sub sub system
+  if (component.size() == 1)
+    return sub_dofmap;
+  else
+  {
+    std::vector<std::size_t> sub_component;
+    for (std::size_t i = 1; i < component.size(); ++i)
+      sub_component.push_back(component[i]);
+
+    std::shared_ptr<ufc::dofmap> sub_sub_dofmap
+        = extract_ufc_sub_dofmap(*sub_dofmap, offset, sub_component,
+                                 num_global_mesh_entities);
+
+    return sub_sub_dofmap;
+  }
+}
+//-----------------------------------------------------------------------------
+std::size_t DofMapBuilder::compute_blocksize(const ufc::dofmap& ufc_dofmap)
+{
+  bool has_block_structure = false;
+  if (ufc_dofmap.num_sub_dofmaps() > 1)
+  {
+    // Create UFC first sub-dofmap
+    std::unique_ptr<ufc::dofmap>
+      ufc_sub_dofmap0(ufc_dofmap.create_sub_dofmap(0));
+    dolfin_assert(ufc_sub_dofmap0);
+
+    // Create UFC sub-dofmaps and check that all sub dofmaps have the
+    // same number of dofs per entity
+    if (ufc_sub_dofmap0->num_sub_dofmaps() != 0)
+      has_block_structure = false;
+    else
+    {
+      // Assume dof map has block structure, then check
+      has_block_structure = true;
+
+      // Create UFC sub-dofmaps and check that all sub dofmaps have the
+      // same number of dofs per entity
+      for (std::size_t i = 1; i < ufc_dofmap.num_sub_dofmaps(); ++i)
+      {
+        std::unique_ptr<ufc::dofmap>
+          ufc_sub_dofmap(ufc_dofmap.create_sub_dofmap(i));
+        dolfin_assert(ufc_sub_dofmap);
+        for (std::size_t d = 0; d <= ufc_dofmap.topological_dimension(); ++d)
+        {
+          if (ufc_sub_dofmap->num_entity_dofs(d)
+              != ufc_sub_dofmap0->num_entity_dofs(d))
+          {
+            has_block_structure = false;
+            break;
+          }
+        }
+      }
+    }
+  }
+
+  if (has_block_structure)
+    return ufc_dofmap.num_sub_dofmaps();
+  else
+    return 1;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/DofMapBuilder.h b/dolfin/fem/DofMapBuilder.h
new file mode 100644
index 0000000..e58814f
--- /dev/null
+++ b/dolfin/fem/DofMapBuilder.h
@@ -0,0 +1,176 @@
+// Copyright (C) 2008-2013 Anders Logg, Ola Skavhaug and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson 2009.
+// Modified by Garth Wells 2009-2012
+// Modified by Mikael Mortensen 2012.
+//
+// First added:  2008-08-12
+// Last changed: 2012-11-05
+
+#ifndef __DOF_MAP_BUILDER_H
+#define __DOF_MAP_BUILDER_H
+
+#include <map>
+#include <set>
+#include <boost/array.hpp>
+#include <memory>
+#include <boost/unordered_map.hpp>
+#include <boost/unordered_set.hpp>
+#include <dolfin/common/types.h>
+#include <dolfin/common/Set.h>
+
+namespace ufc
+{
+  class dofmap;
+}
+
+namespace dolfin
+{
+
+  class DofMap;
+  class Mesh;
+  class SubDomain;
+  class UFC;
+
+  /// Documentation of class
+
+  class DofMapBuilder
+  {
+
+    // FIXME: Test which 'map' is most efficient
+    typedef std::map<dolfin::la_index, dolfin::la_index> map;
+    typedef std::map<dolfin::la_index, dolfin::la_index>::const_iterator
+      map_iterator;
+    //typedef std::set<std::size_t> set;
+    //typedef std::set<std::size_t>::const_iterator set_iterator;
+
+    typedef boost::unordered_set<std::size_t> set;
+    typedef boost::unordered_set<std::size_t>::const_iterator set_iterator;
+    //typedef std::set<std::size_t> set;
+    //typedef std::set<std::size_t>::const_iterator set_iterator;
+
+    typedef std::vector<std::size_t>::const_iterator vector_it;
+    typedef boost::unordered_map<std::size_t, std::vector<unsigned int> >
+      vec_map;
+
+    typedef std::pair<std::size_t, std::size_t> facet_data;
+    typedef std::map<std::size_t, std::size_t> periodic_map;
+    typedef std::vector<facet_data> vector_of_pairs;
+    typedef periodic_map::iterator periodic_map_iterator;
+    typedef std::vector<std::pair<facet_data, facet_data> > facet_pair_type;
+
+  public:
+
+    /// Build dofmap. The restriction may be a null pointer, in which
+    /// case it is ignored.
+    static void build(DofMap& dofmap, const Mesh& dolfin_mesh,
+        std::shared_ptr<const std::map<unsigned int, std::map<unsigned int,
+          std::pair<unsigned int, unsigned int> > > > slave_master_entities,
+        std::shared_ptr<const Restriction> restriction);
+
+    /// Build sub-dofmap
+    static void build_sub_map(DofMap& sub_dofmap,
+                              const DofMap& parent_dofmap,
+                              const std::vector<std::size_t>& component,
+                              const Mesh& mesh);
+
+  private:
+
+    // Build UFC-based dofmap
+    static void build_ufc_dofmap(DofMap& dofmap, map& restricted_dofs_inverse,
+      const Mesh& mesh,
+      std::shared_ptr<const std::map<unsigned int, std::map<unsigned int,
+        std::pair<unsigned int, unsigned int> > > > slave_master_entities,
+      std::shared_ptr<const Restriction> restriction);
+
+    // Build modified global entity indices that account for periodic bcs
+    static std::size_t build_constrained_vertex_indices(const Mesh& mesh,
+        const std::map<unsigned int, std::pair<unsigned int, unsigned int> >& slave_to_master_vertices,
+        std::vector<std::size_t>& modified_global_indices);
+
+    // Re-order local dofmap for dof spatial locality. Re-ordering is
+    // optional, but re-ordering can make other algorithms (e.g.,
+    // matrix-vector products) significantly faster.
+    static void reorder_local(DofMap& dofmap, const Mesh& mesh,
+                              std::size_t block_size,
+                              const std::set<std::size_t>& global_dofs);
+
+    // Re-order distributed dof map for process locality
+    static void
+      reorder_distributed(DofMap& dofmap,
+                          const Mesh& mesh,
+                          std::shared_ptr<const Restriction> restriction,
+                          const map& restricted_dofs_inverse,
+                          std::size_t block_size,
+                          const std::set<std::size_t>& global_dofs);
+
+    // Compute which process 'owns' each node (point at which dofs live)
+    //   node_ownership[0] -> all dofs owned by this process (will
+    //   intersect dof_ownership[1])
+    //   node_ownership[1] -> dofs shared with other processes and
+    //   owned by this process
+    //   node_ownership[2] -> dofs shared with other processes and
+    //   owned by another process
+    static void
+      compute_node_ownership(boost::array<set, 3>& node_ownership,
+                             vec_map& shared_node_processes,
+                             DofMap& dofmap,
+                             const std::set<std::size_t>& global_dofs,
+                             const Mesh& mesh,
+                             std::shared_ptr<const Restriction> restriction,
+                             const map& restricted_dofs_inverse,
+                             std::size_t block_size);
+
+    // Re-order distributed dofmap for process locality based on
+    // ownership data
+    static void
+      parallel_renumber(const boost::array<set, 3>& node_ownership,
+                        const vec_map& shared_node_processes,
+                        DofMap& dofmap,
+                        const std::set<std::size_t>& global_dofs,
+                        const Mesh& mesh,
+                        std::shared_ptr<const Restriction> restriction,
+                        const map& restricted_dofs_inverse,
+                        std::size_t block_size);
+
+    // Compute set of global dofs (e.g. Reals associated with global
+    // Lagrange multipliers) based on UFC numbering. Global dofs are
+    // not associated with any mesh entity.
+    static std::set<std::size_t> compute_global_dofs(const DofMap& dofmap);
+
+    // Iterate recursively over all sub-dof maps to find global
+    // degrees of freedom
+    static void compute_global_dofs(std::set<std::size_t>& global_dofs,
+                                    std::size_t& offset,
+                            std::shared_ptr<const ufc::dofmap> ufc_dofmap,
+                            const DofMap& dofmap);
+
+    // Recursively extract UFC sub-dofmap and compute offset
+    static std::shared_ptr<ufc::dofmap>
+        extract_ufc_sub_dofmap(const ufc::dofmap& ufc_dofmap,
+                               std::size_t& offset,
+                               const std::vector<std::size_t>& component,
+                               const std::vector<std::size_t>& num_global_mesh_entities);
+
+    // Compute block size, e.g. in 3D elasticity block_size = 3
+    static std::size_t compute_blocksize(const ufc::dofmap& ufc_dofmap);
+
+  };
+}
+
+#endif
diff --git a/dolfin/fem/DomainAssigner.cpp b/dolfin/fem/DomainAssigner.cpp
new file mode 100644
index 0000000..3afeff2
--- /dev/null
+++ b/dolfin/fem/DomainAssigner.cpp
@@ -0,0 +1,69 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-03-09
+// Last changed: 2011-03-11
+
+#include <dolfin/common/NoDeleter.h>
+#include "Form.h"
+#include "DomainAssigner.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+const CellDomainAssigner&
+CellDomainAssigner::operator= (const MeshFunction<std::size_t>& domains)
+{
+  _form.set_cell_domains(reference_to_no_delete_pointer(domains));
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const CellDomainAssigner&
+CellDomainAssigner::operator= (std::shared_ptr<const MeshFunction<std::size_t> > domains)
+{
+  _form.set_cell_domains(domains);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const ExteriorFacetDomainAssigner&
+ExteriorFacetDomainAssigner::operator= (const MeshFunction<std::size_t>& domains)
+{
+  _form.set_exterior_facet_domains(reference_to_no_delete_pointer(domains));
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const ExteriorFacetDomainAssigner&
+ExteriorFacetDomainAssigner::operator= (std::shared_ptr<const MeshFunction<std::size_t> > domains)
+{
+  _form.set_exterior_facet_domains(domains);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const InteriorFacetDomainAssigner&
+InteriorFacetDomainAssigner::operator= (const MeshFunction<std::size_t>& domains)
+{
+  _form.set_interior_facet_domains(reference_to_no_delete_pointer(domains));
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const InteriorFacetDomainAssigner&
+InteriorFacetDomainAssigner::operator= (std::shared_ptr<const MeshFunction<std::size_t> > domains)
+{
+  _form.set_interior_facet_domains(domains);
+  return *this;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/DomainAssigner.h b/dolfin/fem/DomainAssigner.h
new file mode 100644
index 0000000..b751201
--- /dev/null
+++ b/dolfin/fem/DomainAssigner.h
@@ -0,0 +1,106 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-03-09
+// Last changed: 2011-06-01
+
+#ifndef __DOMAIN_ASSIGNER_H
+#define __DOMAIN_ASSIGNER_H
+
+#include <memory>
+
+namespace dolfin
+{
+
+  class Form;
+  template <typename T> class MeshFunction;
+
+  /// These classes are used for assignment of domains to forms:
+  ///
+  ///   a.dx = cell_domains
+  ///   a.ds = exterior_facet_domains
+  ///   a.dS = interior_facet_domains
+  ///
+  /// where the arguments can be either objects/references or
+  /// shared pointers to MeshFunctions.
+
+  /// Assignment of cell domains
+  class CellDomainAssigner
+  {
+  public:
+
+    // Constructor
+    CellDomainAssigner(Form& form) : _form(form) {}
+
+    // Assign reference
+    const CellDomainAssigner& operator= (const MeshFunction<std::size_t>& domains);
+
+    // Assign shared pointer
+    const CellDomainAssigner& operator= (std::shared_ptr<const MeshFunction<std::size_t> > domains);
+
+  private:
+
+    // The form
+    Form& _form;
+
+  };
+
+  /// Assignment of exterior facet domains
+  class ExteriorFacetDomainAssigner
+  {
+  public:
+
+    // Constructor
+    ExteriorFacetDomainAssigner(Form& form) : _form(form) {}
+
+    // Assign reference
+    const ExteriorFacetDomainAssigner& operator= (const MeshFunction<std::size_t>& domains);
+
+    // Assign shared pointer
+    const ExteriorFacetDomainAssigner& operator= (std::shared_ptr<const MeshFunction<std::size_t> > domains);
+
+  private:
+
+    // The form
+    Form& _form;
+
+  };
+
+  /// Assignment of interior facet domains
+  class InteriorFacetDomainAssigner
+  {
+  public:
+
+    // Constructor
+    InteriorFacetDomainAssigner(Form& form) : _form(form) {}
+
+    // Assign reference
+    const InteriorFacetDomainAssigner& operator= (const MeshFunction<std::size_t>& domains);
+
+    // Assign shared pointer
+    const InteriorFacetDomainAssigner& operator= (std::shared_ptr<const MeshFunction<std::size_t> > domains);
+
+  private:
+
+    // The form
+    Form& _form;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/Equation.cpp b/dolfin/fem/Equation.cpp
new file mode 100644
index 0000000..53f86fa
--- /dev/null
+++ b/dolfin/fem/Equation.cpp
@@ -0,0 +1,67 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-21
+// Last changed: 2011-06-22
+
+#include <dolfin/log/log.h>
+#include "Form.h"
+#include "Equation.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Equation::Equation(std::shared_ptr<const Form> a,
+                   std::shared_ptr<const Form> L)
+  : _lhs(a), _rhs(L), _rhs_int(0), _is_linear(true)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Equation::Equation(std::shared_ptr<const Form> F, int rhs)
+  : _lhs(F), _rhs_int(rhs), _is_linear(false)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Equation::~Equation()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+bool Equation::is_linear() const
+{
+  return _is_linear;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Form> Equation::lhs() const
+{
+  dolfin_assert(_lhs);
+  return _lhs;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Form> Equation::rhs() const
+{
+  dolfin_assert(_rhs);
+  return _rhs;
+}
+//-----------------------------------------------------------------------------
+int Equation::rhs_int() const
+{
+  return _rhs_int;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/Equation.h b/dolfin/fem/Equation.h
new file mode 100644
index 0000000..ad97ba6
--- /dev/null
+++ b/dolfin/fem/Equation.h
@@ -0,0 +1,84 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-21
+// Last changed: 2011-06-22
+
+#ifndef __EQUATION_H
+#define __EQUATION_H
+
+#include <memory>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Form;
+
+  /// This class represents a variational equation lhs == rhs.
+  /// The equation can be either linear or nonlinear:
+  ///
+  /// 1. Linear (a == L), in which case a must be a bilinear form
+  ///    and L must be a linear form.
+  ///
+  /// 2. Nonlinear (F == 0), in which case F must be a linear form.
+
+  class Equation
+  {
+  public:
+
+    /// Create equation a == L
+    Equation(std::shared_ptr<const Form> a,
+             std::shared_ptr<const Form> L);
+
+    /// Create equation F == 0
+    Equation(std::shared_ptr<const Form> F, int rhs);
+
+    /// Destructor
+    ~Equation();
+
+    /// Check whether equation is linear
+    bool is_linear() const;
+
+    /// Return form for left-hand side
+    std::shared_ptr<const Form> lhs() const;
+
+    /// Return form for right-hand side
+    std::shared_ptr<const Form> rhs() const;
+
+    /// Return value for right-hand side
+    int rhs_int() const;
+
+  private:
+
+    // Left-hand side form
+    std::shared_ptr<const Form> _lhs;
+
+    // Right-hand side form
+    std::shared_ptr<const Form> _rhs;
+
+    // Right-hand side value (should be zero)
+    int _rhs_int;
+
+    // Flag for whether equation is linear
+    bool _is_linear;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/FiniteElement.cpp b/dolfin/fem/FiniteElement.cpp
new file mode 100644
index 0000000..c99e100
--- /dev/null
+++ b/dolfin/fem/FiniteElement.cpp
@@ -0,0 +1,90 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-10-14
+// Last changed: 2011-11-14
+
+#include <dolfin/common/utils.h>
+#include <dolfin/log/log.h>
+#include "FiniteElement.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+FiniteElement::FiniteElement(std::shared_ptr<const ufc::finite_element> element)
+  : _ufc_element(element), _hash(dolfin::hash_local(signature()))
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FiniteElement> 
+FiniteElement::extract_sub_element(const std::vector<std::size_t>& component) const
+{
+  // Recursively extract sub element
+  std::shared_ptr<const FiniteElement> sub_finite_element = extract_sub_element(*this, component);
+  log(DBG, "Extracted finite element for sub system: %s", sub_finite_element->signature().c_str());
+
+  return sub_finite_element;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FiniteElement>
+FiniteElement::extract_sub_element(const FiniteElement& finite_element,
+                                   const std::vector<std::size_t>& component)
+{
+  // Check if there are any sub systems
+  if (finite_element.num_sub_elements() == 0)
+  {
+    dolfin_error("FiniteElement.cpp",
+                 "extract subsystem of finite element",
+                 "There are no subsystems");
+  }
+
+  // Check that a sub system has been specified
+  if (component.empty())
+  {
+    dolfin_error("FiniteElement.cpp",
+                 "extract subsystem of finite element",
+                 "No system was specified");
+  }
+
+  // Check the number of available sub systems
+  if (component[0] >= finite_element.num_sub_elements())
+  {
+    dolfin_error("FiniteElement.cpp",
+                 "extract subsystem of finite element",
+                 "Requested subsystem (%d) out of range [0, %d)",
+                 component[0], finite_element.num_sub_elements());
+  }
+
+  // Create sub system
+  std::shared_ptr<const FiniteElement> sub_element = finite_element.create_sub_element(component[0]);
+  dolfin_assert(sub_element);
+
+  // Return sub system if sub sub system should not be extracted
+  if (component.size() == 1)
+    return sub_element;
+
+  // Otherwise, recursively extract the sub sub system
+  std::vector<std::size_t> sub_component;
+  for (std::size_t i = 1; i < component.size(); i++)
+    sub_component.push_back(component[i]);
+  std::shared_ptr<const FiniteElement> sub_sub_element = extract_sub_element(*sub_element, sub_component);
+  //delete sub_element;
+
+  return sub_sub_element;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/FiniteElement.h b/dolfin/fem/FiniteElement.h
new file mode 100644
index 0000000..da92cc9
--- /dev/null
+++ b/dolfin/fem/FiniteElement.h
@@ -0,0 +1,284 @@
+// Copyright (C) 2008-2013 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-09-11
+// Last changed: 2013-03-01
+
+#ifndef __FINITE_ELEMENT_H
+#define __FINITE_ELEMENT_H
+
+#include <vector>
+#include <ufc.h>
+#include <memory>
+#include <dolfin/common/types.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  /// This is a wrapper for a UFC finite element (ufc::finite_element).
+
+  class FiniteElement
+  {
+  public:
+
+    /// Create finite element from UFC finite element (data may be shared)
+    FiniteElement(std::shared_ptr<const ufc::finite_element> element);
+
+    /// Destructor
+    virtual ~FiniteElement() {}
+
+    //--- Direct wrappers for ufc::finite_element ---
+
+    /// Return a string identifying the finite element
+    std::string signature() const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->signature();
+    }
+
+    /// Return the cell shape
+    ufc::shape cell_shape() const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->cell_shape();
+    }
+
+    // Return the topological dimension of the cell shape
+    std::size_t topological_dimension() const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->topological_dimension();
+    }
+
+    // Return the geometric dimension of the cell shape
+    virtual unsigned int geometric_dimension() const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->geometric_dimension();
+    }
+
+    /// Return the dimension of the finite element function space
+    std::size_t space_dimension() const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->space_dimension();
+    }
+
+    /// Return the rank of the value space
+    std::size_t value_rank() const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->value_rank();
+    }
+
+    /// Return the dimension of the value space for axis i
+    std::size_t value_dimension(std::size_t i) const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->value_dimension(i);
+    }
+
+    /// Evaluate basis function i at given point in cell
+    void evaluate_basis(std::size_t i, double* values, const double* x,
+                        const double* vertex_coordinates,
+                        int cell_orientation) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->evaluate_basis(i, values, x, vertex_coordinates,
+                                   cell_orientation);
+    }
+
+    /// Evaluate all basis functions at given point in cell
+    void evaluate_basis_all(double* values,
+                            const double* x,
+                            const double* vertex_coordinates,
+                            int cell_orientation) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->evaluate_basis_all(values, x, vertex_coordinates,
+                                       cell_orientation);
+    }
+
+    /// Evaluate order n derivatives of basis function i at given point in cell
+    void evaluate_basis_derivatives(unsigned int i,
+                                    unsigned int n,
+                                    double* values,
+                                    const double* x,
+                                    const double* vertex_coordinates,
+                                    int cell_orientation) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->evaluate_basis_derivatives(i, n, values, x,
+                                               vertex_coordinates,
+                                               cell_orientation);
+    }
+
+    /// Evaluate order n derivatives of all basis functions at given
+    /// point in cell
+    void evaluate_basis_derivatives_all(unsigned int n,
+                                        double* values,
+                                        const double* x,
+                                        const double* vertex_coordinates,
+                                        int cell_orientation) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->evaluate_basis_derivatives_all(n, values, x,
+                                                   vertex_coordinates,
+                                                   cell_orientation);
+    }
+
+    /// Evaluate linear functional for dof i on the function f
+    double evaluate_dof(std::size_t i,
+                        const ufc::function& function,
+                        const double* vertex_coordinates,
+                        int cell_orientation,
+                        const ufc::cell& c) const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->evaluate_dof(i, function, vertex_coordinates,
+                                        cell_orientation, c);
+    }
+
+    // FIXME: This is a temporary (?) shortcut.
+    // FIXME: Need to discuss the role of dolfin::FiniteElement vs
+    // FIXME: ufc::finite_element.
+
+    /// Evaluate linear functional for dof i on the function f
+    /*
+    double evaluate_dof(std::size_t i,
+                        const ufc::function& function,
+                        const ufc::cell& c) const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->evaluate_dof(i, function,
+                                        c.vertex_coordinates.data(), 0, c);
+    }
+    */
+
+    /// Evaluate linear functionals for all dofs on the function f
+    void evaluate_dofs(double* values,
+                       const ufc::function& f,
+                       const double* vertex_coordinates,
+                       int cell_orientation,
+                       const ufc::cell& c) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->evaluate_dofs(values, f, vertex_coordinates,
+                                  cell_orientation, c);
+    }
+
+    // FIXME: This is a temporary (?) shortcut.
+    // FIXME: Need to discuss the role of dolfin::FiniteElement vs
+    // FIXME: ufc::finite_element.
+
+    /// Evaluate linear functionals for all dofs on the function f
+    /*
+    void evaluate_dofs(double* values,
+                       const ufc::function& f,
+                       const ufc::cell& c) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->evaluate_dofs(values, f, c.vertex_coordinates.data(),
+                                  0, c);
+    }
+    */
+
+    /// Interpolate vertex values from dof values
+    void interpolate_vertex_values(double* vertex_values,
+                                   double* coefficients,
+                                   const double* vertex_coordinates,
+                                   int cell_orientation,
+                                   const ufc::cell& cell) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->interpolate_vertex_values(vertex_values, coefficients,
+                                              vertex_coordinates,
+                                              cell_orientation, cell);
+    }
+
+    /// Map coordinate xhat from reference cell to coordinate x in cell
+    void map_from_reference_cell(double* x, const double* xhat,
+                                 const ufc::cell& c) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->map_from_reference_cell(x, xhat, c);
+    }
+
+    /// Map from coordinate x in cell to coordinate xhat in reference cell
+    void map_to_reference_cell(double* xhat, const double* x,
+                               const ufc::cell& c) const
+    {
+      dolfin_assert(_ufc_element);
+      _ufc_element->map_to_reference_cell(xhat, x, c);
+    }
+
+    /// Return the number of sub elements (for a mixed element)
+    std::size_t num_sub_elements() const
+    {
+      dolfin_assert(_ufc_element);
+      return _ufc_element->num_sub_elements();
+    }
+
+    //--- DOLFIN-specific extensions of the interface ---
+
+    /// Return simple hash of the signature string
+    std::size_t hash() const
+    { return _hash; }
+
+    /// Create a new finite element for sub element i (for a mixed element)
+    std::shared_ptr<const FiniteElement>
+      create_sub_element(std::size_t i) const
+    {
+      dolfin_assert(_ufc_element);
+      std::shared_ptr<const ufc::finite_element>
+        ufc_element(_ufc_element->create_sub_element(i));
+      std::shared_ptr<const FiniteElement>
+        element(new const FiniteElement(ufc_element));
+      return element;
+    }
+
+    /// Create a new class instance
+    std::shared_ptr<const FiniteElement> create() const
+    {
+      dolfin_assert(_ufc_element);
+      std::shared_ptr<const ufc::finite_element>
+        ufc_element(_ufc_element->create());
+      return std::shared_ptr<const FiniteElement>(new FiniteElement(ufc_element));
+    }
+
+    /// Extract sub finite element for component
+    std::shared_ptr<const FiniteElement>
+      extract_sub_element(const std::vector<std::size_t>& component) const;
+
+  private:
+
+    // Recursively extract sub finite element
+    static std::shared_ptr<const FiniteElement>
+      extract_sub_element(const FiniteElement& finite_element,
+                          const std::vector<std::size_t>& component);
+
+    // UFC finite element
+    std::shared_ptr<const ufc::finite_element> _ufc_element;
+
+    // Simple hash of the signature string
+    std::size_t _hash;
+
+  };
+
+}
+#endif
diff --git a/dolfin/fem/Form.cpp b/dolfin/fem/Form.cpp
new file mode 100644
index 0000000..66b06f9
--- /dev/null
+++ b/dolfin/fem/Form.cpp
@@ -0,0 +1,394 @@
+// Copyright (C) 2007-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2014
+// Modified by Martin Alnes 2008
+//
+// First added:  2007-12-10
+// Last changed: 2014-02-14
+
+#include <memory>
+#include <string>
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/log/log.h>
+#include <dolfin/log/LogStream.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshData.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include "Form.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Form::Form(std::size_t rank, std::size_t num_coefficients)
+  : Hierarchical<Form>(*this),
+    dx(*this), ds(*this), dS(*this),
+    _function_spaces(rank), _coefficients(num_coefficients), _rank(rank)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Form::Form(std::shared_ptr<const ufc::form> ufc_form,
+           std::vector<std::shared_ptr<const FunctionSpace> > function_spaces,
+           std::vector<std::shared_ptr<const GenericFunction> > coefficients)
+  : Hierarchical<Form>(*this),
+    dx(*this), ds(*this), dS(*this), _ufc_form(ufc_form),
+    _function_spaces(function_spaces), _coefficients(coefficients),
+    _rank(ufc_form->rank())
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Form::~Form()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t Form::rank() const
+{
+  if (!_ufc_form)
+    return _rank;
+  else
+  {
+    dolfin_assert(_ufc_form->rank() == _rank);
+    return _rank;
+  }
+}
+//-----------------------------------------------------------------------------
+std::size_t Form::num_coefficients() const
+{
+  if (!_ufc_form)
+    return _coefficients.size();
+  else
+  {
+    dolfin_assert(_ufc_form->num_coefficients() == _coefficients.size());
+    return _coefficients.size();
+  }
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> Form::coloring(std::size_t entity_dim) const
+{
+  warning("Form::coloring does not properly consider form type.");
+
+  // Get mesh
+  const Mesh& mesh = this->mesh();
+  const std::size_t cell_dim = mesh.topology().dim();
+
+  std::vector<std::size_t> _coloring;
+  if (entity_dim == cell_dim)
+  {
+    _coloring.push_back(cell_dim);
+    _coloring.push_back(0);
+    _coloring.push_back(cell_dim);
+  }
+  else if (entity_dim == cell_dim - 1)
+  {
+    _coloring.push_back(cell_dim - 1);
+    _coloring.push_back(cell_dim);
+    _coloring.push_back(0);
+    _coloring.push_back(cell_dim);
+    _coloring.push_back(cell_dim - 1);
+  }
+  else
+  {
+    dolfin_error("Form.cpp",
+                 "color form for multicore computing",
+                 "Only cell and facet coloring are currently supported");
+  }
+
+  return _coloring;
+}
+//-----------------------------------------------------------------------------
+void Form::set_mesh(std::shared_ptr<const Mesh> mesh)
+{
+  _mesh = mesh;
+}
+//-----------------------------------------------------------------------------
+const Mesh& Form::mesh() const
+{
+  // In the case when there are no function spaces (in the case of a
+  // a functional) the (generated) subclass must set the mesh directly
+  // by calling set_mesh().
+
+  // Extract meshes from function spaces
+  std::vector<std::shared_ptr<const Mesh> > meshes;
+  for (std::size_t i = 0; i < _function_spaces.size(); i++)
+  {
+    if (_function_spaces[i])
+    {
+      dolfin_assert(_function_spaces[i]->mesh());
+      meshes.push_back(_function_spaces[i]->mesh());
+    }
+  }
+
+  // Add common mesh if any
+  if (_mesh)
+    meshes.push_back(_mesh);
+
+  // Extract meshes from markers if any
+  if (_cell_domains)
+    meshes.push_back(_cell_domains->mesh());
+  if (_exterior_facet_domains)
+    meshes.push_back(_exterior_facet_domains->mesh());
+  if (_interior_facet_domains)
+    meshes.push_back(_interior_facet_domains->mesh());
+
+  // Extract meshes from coefficients. Note that this is only done
+  // when we don't already have a mesh sine it may otherwise conflict
+  // with existing meshes (if coefficient is defined on another mesh).
+  if (meshes.empty())
+  {
+    for (std::size_t i = 0; i < _coefficients.size(); i++)
+    {
+      const Function* function = dynamic_cast<const Function*>(&*_coefficients[i]);
+      if (function && function->function_space()->mesh())
+        meshes.push_back(function->function_space()->mesh());
+    }
+  }
+
+  // Check that we have at least one mesh
+  if (meshes.empty())
+  {
+    dolfin_error("Form.cpp",
+                 "extract mesh from form",
+                 "No mesh was found. Try passing mesh to the assemble function");
+  }
+
+  // Check that all meshes are the same
+  for (std::size_t i = 1; i < meshes.size(); i++)
+  {
+    if (meshes[i] != meshes[i - 1])
+    {
+      dolfin_error("Form.cpp",
+                   "extract mesh from form",
+                   "Non-matching meshes for function spaces and/or measures");
+    }
+  }
+
+  // Return first mesh
+  dolfin_assert(meshes[0]);
+  return *meshes[0];
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const dolfin::Mesh> Form::mesh_shared_ptr() const
+{
+  return _mesh;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace> Form::function_space(std::size_t i) const
+{
+  dolfin_assert(i < _function_spaces.size());
+  return _function_spaces[i];
+}
+//-----------------------------------------------------------------------------
+std::vector<std::shared_ptr<const FunctionSpace> > Form::function_spaces() const
+{
+  return _function_spaces;
+}
+//-----------------------------------------------------------------------------
+void Form::set_coefficient(std::size_t i,
+                           std::shared_ptr<const GenericFunction> coefficient)
+{
+  dolfin_assert(i < _coefficients.size());
+  _coefficients[i] = coefficient;
+}
+//-----------------------------------------------------------------------------
+void Form::set_coefficient(std::string name,
+                           std::shared_ptr<const GenericFunction> coefficient)
+{
+  set_coefficient(coefficient_number(name), coefficient);
+}
+//-----------------------------------------------------------------------------
+void Form::set_coefficients(std::map<std::string, std::shared_ptr<const GenericFunction> > coefficients)
+{
+  for (auto it = coefficients.begin(); it != coefficients.end(); ++it)
+    set_coefficient(it->first, it->second);
+}
+//-----------------------------------------------------------------------------
+void Form::set_some_coefficients(std::map<std::string,
+                                 std::shared_ptr<const GenericFunction> > coefficients)
+{
+  // Build map of which coefficients has been set
+  std::map<std::string, bool> markers;
+  for (std::size_t i = 0; i < num_coefficients(); i++)
+    markers[coefficient_name(i)] = false;
+
+  // Set all coefficients that need to be set
+  for (auto it = coefficients.begin(); it != coefficients.end(); ++it)
+  {
+    auto name = it->first;
+    auto coefficient = it->second;
+    if (markers.find(name) != markers.end())
+    {
+      set_coefficient(name, coefficient);
+      markers[name] = true;
+    }
+  }
+
+  // Check which coefficients that have been set
+  std::stringstream s_set;
+  std::stringstream s_unset;
+  std::size_t num_set = 0;
+  for (auto it = markers.begin(); it != markers.end(); ++it)
+  {
+    if (it->second)
+    {
+      num_set++;
+      s_set << " " << it->first;
+    }
+    else
+      s_unset << " " << it->second;
+  }
+
+  // Report status of set coefficients
+  if (num_set == num_coefficients())
+    info("All coefficients attached to form:%s", s_set.str().c_str());
+  else
+  {
+    info("%d coefficient(s) attached to form:%s",
+         num_set, s_set.str().c_str());
+    info("%d coefficient(s) missing: %s",
+         num_coefficients() - num_set, s_unset.str().c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericFunction> Form::coefficient(std::size_t i) const
+{
+  dolfin_assert(i < _coefficients.size());
+  return _coefficients[i];
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericFunction> Form::coefficient(std::string name) const
+{
+  return coefficient(coefficient_number(name));
+}
+//-----------------------------------------------------------------------------
+std::vector<std::shared_ptr<const GenericFunction> > Form::coefficients() const
+{
+  return _coefficients;
+}
+//-----------------------------------------------------------------------------
+std::size_t Form::coefficient_number(const std::string & name) const
+{
+  // TODO: Dissect name, assuming "wi", and return i.
+  dolfin_not_implemented();
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::string Form::coefficient_name(std::size_t i) const
+{
+  // Create name like "w0", overloaded by Form subclasses generated by form compilers
+  std::ostringstream name;
+  name << "w" << i;
+  return name.str();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const MeshFunction<std::size_t> > Form::cell_domains() const
+{
+  return _cell_domains;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const MeshFunction<std::size_t> > Form::exterior_facet_domains() const
+{
+  return _exterior_facet_domains;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const MeshFunction<std::size_t> > Form::interior_facet_domains() const
+{
+  return _interior_facet_domains;
+}
+//-----------------------------------------------------------------------------
+void Form::set_cell_domains
+(std::shared_ptr<const MeshFunction<std::size_t> > cell_domains)
+{
+  _cell_domains = cell_domains;
+}
+//-----------------------------------------------------------------------------
+void Form::set_exterior_facet_domains
+(std::shared_ptr<const MeshFunction<std::size_t> > exterior_facet_domains)
+{
+  _exterior_facet_domains = exterior_facet_domains;
+}
+//-----------------------------------------------------------------------------
+void Form::set_interior_facet_domains
+(std::shared_ptr<const MeshFunction<std::size_t> > interior_facet_domains)
+{
+  _interior_facet_domains = interior_facet_domains;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const ufc::form> Form::ufc_form() const
+{
+  return _ufc_form;
+}
+//-----------------------------------------------------------------------------
+void Form::check() const
+{
+  dolfin_assert(_ufc_form);
+
+  // Check that the number of argument function spaces is correct
+  if (_ufc_form->rank() != _function_spaces.size())
+  {
+    dolfin_error("Form.cpp",
+                 "assemble form",
+                 "Expecting %d function spaces (not %d)",
+                 _ufc_form->rank(), _function_spaces.size());
+  }
+
+  // Check that the number of coefficient function spaces is correct
+  if (_ufc_form->num_coefficients() != _coefficients.size())
+  {
+   dolfin_error("Form.cpp",
+                "assemble form",
+                "Expecting %d coefficient (not %d)",
+                _ufc_form->num_coefficients(), _coefficients.size());
+  }
+
+  // Check argument function spaces
+  for (std::size_t i = 0; i < _function_spaces.size(); ++i)
+  {
+    std::unique_ptr<ufc::finite_element> element(_ufc_form->create_finite_element(i));
+    dolfin_assert(element);
+    dolfin_assert(_function_spaces[i]->element());
+    if (element->signature() != _function_spaces[i]->element()->signature())
+    {
+      log(ERROR, "Expected element: %s", element->signature());
+      log(ERROR, "Input element:    %s", _function_spaces[i]->element()->signature().c_str());
+      dolfin_error("Form.cpp",
+                   "assemble form",
+                   "Wrong type of function space for argument %d", i);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+Equation Form::operator==(const Form& rhs) const
+{
+  Equation equation(reference_to_no_delete_pointer(*this),
+                    reference_to_no_delete_pointer(rhs));
+  return equation;
+}
+//-----------------------------------------------------------------------------
+Equation Form::operator==(int rhs) const
+{
+  Equation equation(reference_to_no_delete_pointer(*this), 0);
+  return equation;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/Form.h b/dolfin/fem/Form.h
new file mode 100644
index 0000000..4036a5b
--- /dev/null
+++ b/dolfin/fem/Form.h
@@ -0,0 +1,374 @@
+// Copyright (C) 2007-2014 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2008-2011
+// Modified by Martin Alnes 2008
+//
+// First added:  2007-04-02
+// Last changed: 2014-02-14
+
+#ifndef __FORM_H
+#define __FORM_H
+
+#include <map>
+#include <vector>
+#include <memory>
+
+#include <dolfin/common/Hierarchical.h>
+#include <dolfin/common/types.h>
+#include "DomainAssigner.h"
+#include "Equation.h"
+
+// Forward declaration
+namespace ufc
+{
+  class form;
+}
+
+namespace dolfin
+{
+
+  class FunctionSpace;
+  class GenericFunction;
+  class Mesh;
+  template <typename T> class MeshFunction;
+
+  /// Base class for UFC code generated by FFC for DOLFIN with option -l.
+  ///
+  /// A note on the order of trial and test spaces: FEniCS numbers
+  /// argument spaces starting with the leading dimension of the
+  /// corresponding tensor (matrix). In other words, the test space is
+  /// numbered 0 and the trial space is numbered 1. However, in order
+  /// to have a notation that agrees with most existing finite element
+  /// literature, in particular
+  ///
+  ///     a = a(u, v)
+  ///
+  /// the spaces are numbered from right to
+  ///
+  ///     a: V_1 x V_0 -> R
+  ///
+  /// .. note::
+  ///
+  ///     Figure out how to write this in math mode without it getting
+  ///     messed up in the Python version.
+  ///
+  /// This is reflected in the ordering of the spaces that should be
+  /// supplied to generated subclasses. In particular, when a bilinear
+  /// form is initialized, it should be initialized as
+  ///
+  /// .. code-block:: c++
+  ///
+  ///     a(V_1, V_0) = ...
+  ///
+  /// where ``V_1`` is the trial space and ``V_0`` is the test space.
+  /// However, when a form is initialized by a list of argument spaces
+  /// (the variable ``function_spaces`` in the constructors below, the
+  /// list of spaces should start with space number 0 (the test space)
+  /// and then space number 1 (the trial space).
+
+  class Form : public Hierarchical<Form>
+  {
+  public:
+
+    /// Create form of given rank with given number of coefficients
+    ///
+    /// *Arguments*
+    ///     rank (std::size_t)
+    ///         The rank.
+    ///     num_coefficients (std::size_t)
+    ///         The number of coefficients.
+    Form(std::size_t rank, std::size_t num_coefficients);
+
+    /// Create form (shared data)
+    ///
+    /// *Arguments*
+    ///     ufc_form (ufc::form)
+    ///         The UFC form.
+    ///     function_spaces (std::vector<_FunctionSpace_>)
+    ///         Vector of function spaces.
+    ///     coefficients (std::vector<_GenericFunction_>)
+    ///         Vector of coefficients.
+    Form(std::shared_ptr<const ufc::form> ufc_form,
+         std::vector<std::shared_ptr<const FunctionSpace> > function_spaces,
+         std::vector<std::shared_ptr<const GenericFunction> > coefficients);
+
+    /// Destructor
+    virtual ~Form();
+
+    /// Return rank of form (bilinear form = 2, linear form = 1,
+    /// functional = 0, etc)
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The rank of the form.
+    std::size_t rank() const;
+
+    /// Return number of coefficients
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The number of coefficients.
+    std::size_t num_coefficients() const;
+
+    /// Return coloring type for colored (multi-threaded) assembly of form
+    /// over a mesh entity of a given dimension
+    ///
+    /// *Arguments*
+    ///     entity_dim (std::size_t)
+    ///         Dimension.
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         Coloring type.
+    std::vector<std::size_t> coloring(std::size_t entity_dim) const;
+
+    /// Set mesh, necessary for functionals when there are no function spaces
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    void set_mesh(std::shared_ptr<const Mesh> mesh);
+
+    /// Extract common mesh from form
+    ///
+    /// *Returns*
+    ///     _Mesh_
+    ///         The mesh.
+    const Mesh& mesh() const;
+
+    /// Return mesh shared pointer (if any)
+    ///
+    /// *Returns*
+    ///     _Mesh_
+    ///         The mesh shared pointer.
+    std::shared_ptr<const Mesh> mesh_shared_ptr() const;
+
+    /// Return function space for given argument
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Index
+    ///
+    /// *Returns*
+    ///     _FunctionSpace_
+    ///         Function space shared pointer.
+    std::shared_ptr<const FunctionSpace> function_space(std::size_t i) const;
+
+    /// Return function spaces for arguments
+    ///
+    /// *Returns*
+    ///     std::vector<_FunctionSpace_>
+    ///         Vector of function space shared pointers.
+    std::vector<std::shared_ptr<const FunctionSpace> > function_spaces() const;
+
+    /// Set coefficient with given number (shared pointer version)
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         The given number.
+    ///     coefficient (_GenericFunction_)
+    ///         The coefficient.
+    void set_coefficient(std::size_t i,
+                         std::shared_ptr<const GenericFunction> coefficient);
+
+    /// Set coefficient with given name (shared pointer version)
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name.
+    ///     coefficient (_GenericFunction_)
+    ///         The coefficient.
+    void set_coefficient(std::string name,
+                         std::shared_ptr<const GenericFunction> coefficient);
+
+    /// Set all coefficients in given map. All coefficients in the
+    /// given map, which may contain only a subset of the coefficients
+    /// of the form, will be set.
+    ///
+    /// *Arguments*
+    ///     coefficients (std::map<std::string, _GenericFunction_>)
+    ///         The map of coefficients.
+    void set_coefficients(std::map<std::string,
+                          std::shared_ptr<const GenericFunction> > coefficients);
+
+    /// Set some coefficients in given map. Each coefficient in the
+    /// given map will be set, if the name of the coefficient matches
+    /// the name of a coefficient in the form.
+    ///
+    /// This is useful when reusing the same coefficient map for
+    /// several forms, or when some part of the form has been
+    /// outcommented (for testing) in the UFL file, which means that
+    /// the coefficient and attaching it to the form does not need to
+    /// be outcommented in a C++ program using code from the generated
+    /// UFL file.
+    ///
+    /// *Arguments*
+    ///     coefficients (std::map<std::string, _GenericFunction_>)
+    ///         The map of coefficients.
+    void set_some_coefficients(std::map<std::string,
+                               std::shared_ptr<const GenericFunction> > coefficients);
+
+    /// Return coefficient with given number
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Index
+    ///
+    /// *Returns*
+    ///     _GenericFunction_
+    ///         The coefficient.
+    std::shared_ptr<const GenericFunction> coefficient(std::size_t i) const;
+
+    /// Return coefficient with given name
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name.
+    ///
+    /// *Returns*
+    ///     _GenericFunction_
+    ///         The coefficient.
+    std::shared_ptr<const GenericFunction> coefficient(std::string name) const;
+
+    /// Return all coefficients
+    ///
+    /// *Returns*
+    ///     std::vector<_GenericFunction_>
+    ///         All coefficients.
+    std::vector<std::shared_ptr<const GenericFunction> > coefficients() const;
+
+    /// Return the number of the coefficient with this name
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The number of the coefficient with the given name.
+    virtual std::size_t coefficient_number(const std::string & name) const;
+
+    /// Return the name of the coefficient with this number
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         The number
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         The name of the coefficient with the given number.
+    virtual std::string coefficient_name(std::size_t i) const;
+
+    /// Return cell domains (zero pointer if no domains have been
+    /// specified)
+    ///
+    /// *Returns*
+    ///     _MeshFunction_ <std::size_t>
+    ///         The cell domains.
+    std::shared_ptr<const MeshFunction<std::size_t> > cell_domains() const;
+
+    /// Return exterior facet domains (zero pointer if no domains have
+    /// been specified)
+    ///
+    /// *Returns*
+    ///     std::shared_ptr<_MeshFunction_ <std::size_t> >
+    ///         The exterior facet domains.
+    std::shared_ptr<const MeshFunction<std::size_t> > exterior_facet_domains() const;
+
+    /// Return interior facet domains (zero pointer if no domains have
+    /// been specified)
+    ///
+    /// *Returns*
+    ///     _MeshFunction_ <std::size_t>
+    ///         The interior facet domains.
+    std::shared_ptr<const MeshFunction<std::size_t> > interior_facet_domains() const;
+
+    /// Set cell domains
+    ///
+    /// *Arguments*
+    ///     cell_domains (_MeshFunction_ <std::size_t>)
+    ///         The cell domains.
+    void set_cell_domains(std::shared_ptr<const MeshFunction<std::size_t> > cell_domains);
+
+    /// Set exterior facet domains
+    ///
+    /// *Arguments*
+    ///     exterior_facet_domains (_MeshFunction_ <std::size_t>)
+    ///         The exterior facet domains.
+    void set_exterior_facet_domains(std::shared_ptr<const MeshFunction<std::size_t> > exterior_facet_domains);
+
+    /// Set interior facet domains
+    ///
+    /// *Arguments*
+    ///     interior_facet_domains (_MeshFunction_ <std::size_t>)
+    ///         The interior facet domains.
+    void set_interior_facet_domains(std::shared_ptr<const MeshFunction<std::size_t> > interior_facet_domains);
+
+    /// Return UFC form shared pointer
+    ///
+    /// *Returns*
+    ///     ufc::form
+    ///         The UFC form.
+    std::shared_ptr<const ufc::form> ufc_form() const;
+
+    /// Check function spaces and coefficients
+    void check() const;
+
+    /// Comparison operator, returning equation lhs == rhs
+    Equation operator==(const Form& rhs) const;
+
+    /// Comparison operator, returning equation lhs == 0
+    Equation operator==(int rhs) const;
+
+    // Assignment of domains
+    CellDomainAssigner dx;
+    ExteriorFacetDomainAssigner ds;
+    InteriorFacetDomainAssigner dS;
+
+  protected:
+
+    // The UFC form
+    std::shared_ptr<const ufc::form> _ufc_form;
+
+    // Function spaces (one for each argument)
+    std::vector<std::shared_ptr<const FunctionSpace> > _function_spaces;
+
+    // Coefficients
+    std::vector<std::shared_ptr<const GenericFunction> > _coefficients;
+
+    // The mesh (needed for functionals when we don't have any spaces)
+    std::shared_ptr<const Mesh> _mesh;
+
+    // Markers for cell domains
+    std::shared_ptr<const MeshFunction<std::size_t> > _cell_domains;
+
+    // Markers for exterior facet domains
+    std::shared_ptr<const MeshFunction<std::size_t> > _exterior_facet_domains;
+
+    // Markers for interior facet domains
+    std::shared_ptr<const MeshFunction<std::size_t> > _interior_facet_domains;
+
+  private:
+
+    const std::size_t _rank;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/GenericDofMap.h b/dolfin/fem/GenericDofMap.h
new file mode 100644
index 0000000..39f542c
--- /dev/null
+++ b/dolfin/fem/GenericDofMap.h
@@ -0,0 +1,183 @@
+// Copyright (C) 2010-2013 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga, 2012
+// Modified by Jan Blechta, 2013
+//
+// First added:  2010-05-26
+// Last changed: 2013-03-04
+
+#ifndef __GENERIC_DOF_MAP_H
+#define __GENERIC_DOF_MAP_H
+
+#include <map>
+#include <utility>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <memory>
+#include <boost/unordered_map.hpp>
+#include <boost/unordered_set.hpp>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/Variable.h>
+
+namespace ufc
+{
+  class cell;
+}
+
+namespace dolfin
+{
+
+  class Cell;
+  class GenericVector;
+  class Mesh;
+  class Restriction;
+  class SubDomain;
+
+  /// This class provides a generic interface for dof maps
+
+  class GenericDofMap : public Variable
+  {
+  public:
+
+    /// Constructor
+    GenericDofMap() : block_size(1) {}
+
+    /// True if dof map is a view into another map (is a sub-dofmap)
+    virtual bool is_view() const = 0;
+
+    /// Return the dimension of the global finite element function
+    /// space
+    virtual std::size_t global_dimension() const = 0;
+
+    /// Return the dimension of the local finite element function
+    /// space on a cell
+    virtual std::size_t cell_dimension(std::size_t index) const = 0;
+
+    /// Return the maximum dimension of the local finite element
+    /// function space
+    virtual std::size_t max_cell_dimension() const = 0;
+
+    /// Return the number of dofs for a given entity dimension
+    virtual std::size_t num_entity_dofs(std::size_t dim) const = 0;
+
+    /// Return the geometric dimension of the coordinates this dof map
+    // provides
+    virtual std::size_t geometric_dimension() const = 0;
+
+    /// Return number of facet dofs
+    virtual std::size_t num_facet_dofs() const = 0;
+
+    /// Restriction if any. If the dofmap is not restricted, a null
+    /// pointer is returned.
+    virtual std::shared_ptr<const Restriction> restriction() const = 0;
+
+    /// Return the ownership range (dofs in this range are owned by
+    /// this process)
+    virtual std::pair<std::size_t, std::size_t> ownership_range() const = 0;
+
+    /// Return map from nonlocal-dofs (that appear in local dof map)
+    /// to owning process
+    virtual const boost::unordered_map<std::size_t, unsigned int>&
+      off_process_owner() const = 0;
+
+    /// Local-to-global mapping of dofs on a cell
+    virtual const std::vector<dolfin::la_index>&
+      cell_dofs(std::size_t cell_index) const = 0;
+
+    /// Tabulate local-local facet dofs
+    virtual void tabulate_facet_dofs(std::vector<std::size_t>& dofs,
+                                     std::size_t local_facet) const = 0;
+
+    /// Tabulate the local-to-local mapping of dofs on entity
+    /// (dim, local_entity)
+    virtual void tabulate_entity_dofs(std::vector<std::size_t>& dofs,
+				      std::size_t dim,
+                                      std::size_t local_entity) const = 0;
+
+    /// Tabulate the coordinates of all dofs on a cell (UFC cell version)
+    virtual
+      void tabulate_coordinates(boost::multi_array<double, 2>& coordinates,
+                                const std::vector<double>& vertex_coordinates,
+                                const Cell& cell) const = 0;
+
+    /// Tabulate the coordinates of all dofs owned by this
+    /// process. This function is typically used by preconditioners
+    /// that require the spatial coordinates of dofs, for example
+    /// for re-partitioning or nullspace computations. The format for
+    /// the return vector is [x0, y0, z0, x1, y1, z1, . . .].
+    virtual std::vector<double>
+      tabulate_all_coordinates(const Mesh& mesh) const = 0;
+
+    /// Create a copy of the dof map
+    virtual std::shared_ptr<GenericDofMap> copy() const = 0;
+
+    /// Create a new dof map on new mesh
+    virtual std::shared_ptr<GenericDofMap>
+      create(const Mesh& new_mesh) const = 0;
+
+    /// Extract sub dofmap component
+    virtual std::shared_ptr<GenericDofMap>
+        extract_sub_dofmap(const std::vector<std::size_t>& component,
+                           const Mesh& mesh) const = 0;
+
+    /// Create a "collapsed" a dofmap (collapses from a sub-dofmap view)
+    virtual std::shared_ptr<GenericDofMap>
+        collapse(boost::unordered_map<std::size_t, std::size_t>& collapsed_map,
+                 const Mesh& mesh) const = 0;
+
+    /// Return list of global dof indices on this process
+    virtual std::vector<dolfin::la_index> dofs() const = 0;
+
+    /// Set dof entries in vector to a specified value. Parallel
+    /// layout of vector must be consistent with dof map range. This
+    /// function is typically used to construct the null space of a
+    /// matrix operator
+    virtual void set(GenericVector& x, double value) const = 0;
+
+    /// Set dof entries in vector to the value*x[i], where x[i] is the
+    /// spatial coordinate of the dof. Parallel layout of vector must
+    /// be consistent with dof map range. This function is typically
+    /// used to construct the null space of a matrix operator, e.g. rigid
+    /// body rotations.
+    virtual void set_x(GenericVector& x, double value, std::size_t component,
+                       const Mesh& mesh) const = 0;
+
+    /// Return map from shared dofs to the processes (not including
+    /// the current process) that share it.
+    virtual const boost::unordered_map<std::size_t,
+      std::vector<unsigned int> >& shared_dofs() const = 0;
+
+    /// Return set of processes that share dofs with the this process
+    virtual const std::set<std::size_t>& neighbours() const = 0;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const = 0;
+
+    /// Subdomain mapping constrained boundaries, e.g. periodic conditions
+    std::shared_ptr<const SubDomain> constrained_domain;
+
+    /// Dofmap block size, e.g. 3 for 3D elasticity with a suitable
+    // ordered dofmap
+    std::size_t block_size;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/LinearTimeDependentProblem.cpp b/dolfin/fem/LinearTimeDependentProblem.cpp
new file mode 100644
index 0000000..ffbf15b
--- /dev/null
+++ b/dolfin/fem/LinearTimeDependentProblem.cpp
@@ -0,0 +1,167 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-08-17
+// Last changed: 2012-08-20
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/function/Function.h>
+//#include "TensorProductForm.h"
+#include "LinearTimeDependentProblem.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+LinearTimeDependentProblem::
+LinearTimeDependentProblem(const TensorProductForm& a,
+                           const TensorProductForm& L,
+                           Function& u)
+  : Hierarchical<LinearTimeDependentProblem>(*this),
+    _a(reference_to_no_delete_pointer(a)),
+    _l(reference_to_no_delete_pointer(L)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+LinearTimeDependentProblem::
+LinearTimeDependentProblem(const TensorProductForm& a,
+                           const TensorProductForm& L,
+                           Function& u,
+                           const BoundaryCondition& bc)
+  : Hierarchical<LinearTimeDependentProblem>(*this),
+    _a(reference_to_no_delete_pointer(a)),
+    _l(reference_to_no_delete_pointer(L)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Store boundary condition
+  _bcs.push_back(reference_to_no_delete_pointer(bc));
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+LinearTimeDependentProblem::
+LinearTimeDependentProblem(const TensorProductForm& a,
+                           const TensorProductForm& L,
+                           Function& u,
+                           std::vector<const BoundaryCondition*> bcs)
+  : Hierarchical<LinearTimeDependentProblem>(*this),
+    _a(reference_to_no_delete_pointer(a)),
+    _l(reference_to_no_delete_pointer(L)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Store boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); ++i)
+    _bcs.push_back(reference_to_no_delete_pointer(*bcs[i]));
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+LinearTimeDependentProblem::
+LinearTimeDependentProblem(std::shared_ptr<const TensorProductForm> a,
+                           std::shared_ptr<const TensorProductForm> L,
+                           std::shared_ptr<Function> u,
+                           std::vector<std::shared_ptr<const BoundaryCondition> > bcs)
+  : Hierarchical<LinearTimeDependentProblem>(*this),
+    _a(a), _l(L), _u(u)
+{
+  // Store boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); ++i)
+    _bcs.push_back(bcs[i]);
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const TensorProductForm>
+LinearTimeDependentProblem::bilinear_form() const
+{
+  return _a;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const TensorProductForm>
+LinearTimeDependentProblem::linear_form() const
+{
+  return _l;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Function> LinearTimeDependentProblem::solution()
+{
+  return _u;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Function> LinearTimeDependentProblem::solution() const
+{
+  return _u;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::shared_ptr<const BoundaryCondition> >
+LinearTimeDependentProblem::bcs() const
+{
+  return _bcs;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace>
+LinearTimeDependentProblem::trial_space() const
+{
+  dolfin_assert(_u);
+  return _u->function_space();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace>
+LinearTimeDependentProblem::test_space() const
+{
+  dolfin_assert(_a);
+  return _a->function_space(0);
+}
+//-----------------------------------------------------------------------------
+void LinearTimeDependentProblem::check_forms() const
+{
+  // Check rank of bilinear form a
+  dolfin_assert(_a);
+  if (_a->rank() != 2)
+  {
+    dolfin_error("LinearTimeDependentProblem.cpp",
+                 "define linear variational problem a(u, v) == L(v) for all v",
+                 "Expecting the left-hand side to be a bilinear form (not rank %d)",
+                 _a->rank());
+  }
+
+  // Check rank of linear form L
+  dolfin_assert(_l);
+  if (_l->rank() != 1)
+  {
+    dolfin_error("LinearTimeDependentProblem.cpp",
+                 "define linear variational problem a(u, v) = L(v) for all v",
+                 "Expecting the right-hand side to be a linear form (not rank %d)",
+                 _l->rank());
+  }
+
+  // Check that function space of solution variable matches trial space
+  dolfin_assert(_a);
+  dolfin_assert(_u);
+  if (!_u->in(*_a->function_space(1)))
+  {
+    dolfin_error("LinearTimeDependentProblem.cpp",
+                 "define linear variational problem a(u, v) = L(v) for all v",
+                 "Expecting the solution variable u to be a member of the trial space");
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/LinearTimeDependentProblem.h b/dolfin/fem/LinearTimeDependentProblem.h
new file mode 100644
index 0000000..39c1d4e
--- /dev/null
+++ b/dolfin/fem/LinearTimeDependentProblem.h
@@ -0,0 +1,118 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-08-17
+// Last changed: 2012-08-20
+
+#ifndef __LINEAR_TIME_DEPENDENT_PROBLEM_H
+#define __LINEAR_TIME_DEPENDENT_PROBLEM_H
+
+#include <memory>
+#include <dolfin/common/Hierarchical.h>
+
+// FIXME: Temporary fix
+#include "Form.h"
+
+namespace dolfin
+{
+
+  // FIXME: Temporary fix
+  typedef Form TensorProductForm;
+
+  // Forward declarations
+  class BoundaryCondition;
+
+  /// This class represents a linear time-dependent variational problem:
+  ///
+  /// Find u in U = U_h (x) U_k such that
+  ///
+  ///     a(u, v) = L(v)  for all v in V = V_h (x) V_k,
+  ///
+  /// where U is a tensor-product trial space and V is a tensor-product
+  /// test space.
+
+  class LinearTimeDependentProblem : public Hierarchical<LinearTimeDependentProblem>
+  {
+  public:
+
+    /// Create linear variational problem without boundary conditions
+    LinearTimeDependentProblem(const TensorProductForm& a,
+                               const TensorProductForm& L,
+                               Function& u);
+
+    /// Create linear variational problem with a single boundary condition
+    LinearTimeDependentProblem(const TensorProductForm& a,
+                             const TensorProductForm& L,
+                             Function& u,
+                             const BoundaryCondition& bc);
+
+    /// Create linear variational problem with a list of boundary conditions
+    LinearTimeDependentProblem(const TensorProductForm& a,
+                             const TensorProductForm& L,
+                             Function& u,
+                             std::vector<const BoundaryCondition*> bcs);
+
+    /// Create linear variational problem with a list of boundary conditions
+    /// (shared pointer version)
+    LinearTimeDependentProblem(std::shared_ptr<const TensorProductForm> a,
+                               std::shared_ptr<const TensorProductForm> L,
+                               std::shared_ptr<Function> u,
+                               std::vector<std::shared_ptr<const BoundaryCondition> > bcs);
+
+    /// Return bilinear form
+    std::shared_ptr<const TensorProductForm> bilinear_form() const;
+
+    /// Return linear form
+    std::shared_ptr<const TensorProductForm> linear_form() const;
+
+    /// Return solution variable
+    std::shared_ptr<Function> solution();
+
+    /// Return solution variable (const version)
+    std::shared_ptr<const Function> solution() const;
+
+    /// Return boundary conditions
+    std::vector<std::shared_ptr<const BoundaryCondition> > bcs() const;
+
+    /// Return trial space
+    std::shared_ptr<const FunctionSpace> trial_space() const;
+
+    /// Return test space
+    std::shared_ptr<const FunctionSpace> test_space() const;
+
+  private:
+
+    // Check forms
+    void check_forms() const;
+
+    // The bilinear form
+    std::shared_ptr<const TensorProductForm> _a;
+
+    // The linear form
+    std::shared_ptr<const TensorProductForm> _l;
+
+    // The solution
+    std::shared_ptr<Function> _u;
+
+    // The boundary conditions
+    std::vector<std::shared_ptr<const BoundaryCondition> > _bcs;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/LinearVariationalProblem.cpp b/dolfin/fem/LinearVariationalProblem.cpp
new file mode 100644
index 0000000..3543344
--- /dev/null
+++ b/dolfin/fem/LinearVariationalProblem.cpp
@@ -0,0 +1,158 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-22
+// Last changed: 2012-08-17
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/function/Function.h>
+#include "Form.h"
+#include "LinearVariationalProblem.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+LinearVariationalProblem::LinearVariationalProblem(const Form& a,
+ const Form& L, Function& u) : Hierarchical<LinearVariationalProblem>(*this),
+  _a(reference_to_no_delete_pointer(a)), _l(reference_to_no_delete_pointer(L)),
+  _u(reference_to_no_delete_pointer(u))
+{
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+LinearVariationalProblem::LinearVariationalProblem(const Form& a,
+  const Form& L, Function& u, const DirichletBC& bc)
+  : Hierarchical<LinearVariationalProblem>(*this),
+    _a(reference_to_no_delete_pointer(a)),
+    _l(reference_to_no_delete_pointer(L)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Store boundary condition
+  _bcs.push_back(reference_to_no_delete_pointer(bc));
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+LinearVariationalProblem::
+LinearVariationalProblem(const Form& a,
+                         const Form& L,
+                         Function& u,
+                         std::vector<const DirichletBC*> bcs)
+  : Hierarchical<LinearVariationalProblem>(*this),
+    _a(reference_to_no_delete_pointer(a)),
+    _l(reference_to_no_delete_pointer(L)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Store boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); ++i)
+    _bcs.push_back(reference_to_no_delete_pointer(*bcs[i]));
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+LinearVariationalProblem::
+LinearVariationalProblem(std::shared_ptr<const Form> a,
+                         std::shared_ptr<const Form> L,
+                         std::shared_ptr<Function> u,
+                         std::vector<std::shared_ptr<const DirichletBC> > bcs)
+  : Hierarchical<LinearVariationalProblem>(*this),
+    _a(a), _l(L), _u(u)
+{
+  // Store boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); ++i)
+    _bcs.push_back(bcs[i]);
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Form> LinearVariationalProblem::bilinear_form() const
+{
+  return _a;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Form> LinearVariationalProblem::linear_form() const
+{
+  return _l;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Function> LinearVariationalProblem::solution()
+{
+  return _u;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Function> LinearVariationalProblem::solution() const
+{
+  return _u;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::shared_ptr<const DirichletBC> >
+  LinearVariationalProblem::bcs() const
+{
+  return _bcs;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace>
+  LinearVariationalProblem::trial_space() const
+{
+  dolfin_assert(_u);
+  return _u->function_space();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace>
+LinearVariationalProblem::test_space() const
+{
+  dolfin_assert(_a);
+  return _a->function_space(0);
+}
+//-----------------------------------------------------------------------------
+void LinearVariationalProblem::check_forms() const
+{
+  // Check rank of bilinear form a
+  dolfin_assert(_a);
+  if (_a->rank() != 2)
+  {
+    dolfin_error("LinearVariationalProblem.cpp",
+                 "define linear variational problem a(u, v) == L(v) for all v",
+                 "Expecting the left-hand side to be a bilinear form (not rank %d)",
+                 _a->rank());
+  }
+
+  // Check rank of linear form L
+  dolfin_assert(_l);
+  if (_l->rank() != 1)
+  {
+    dolfin_error("LinearVariationalProblem.cpp",
+                 "define linear variational problem a(u, v) = L(v) for all v",
+                 "Expecting the right-hand side to be a linear form (not rank %d)",
+                 _l->rank());
+  }
+
+  // Check that function space of solution variable matches trial space
+  dolfin_assert(_a);
+  dolfin_assert(_u);
+  if (!_u->in(*_a->function_space(1)))
+  {
+    dolfin_error("LinearVariationalProblem.cpp",
+                 "define linear variational problem a(u, v) = L(v) for all v",
+                 "Expecting the solution variable u to be a member of the trial space");
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/LinearVariationalProblem.h b/dolfin/fem/LinearVariationalProblem.h
new file mode 100644
index 0000000..0f6e47d
--- /dev/null
+++ b/dolfin/fem/LinearVariationalProblem.h
@@ -0,0 +1,114 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-22
+// Last changed: 2012-08-20
+
+#ifndef __LINEAR_VARIATIONAL_PROBLEM_H
+#define __LINEAR_VARIATIONAL_PROBLEM_H
+
+#include <memory>
+#include <dolfin/common/Hierarchical.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class DirichletBC;
+  class Form;
+  class Function;
+  class FunctionSpace;
+
+  /// This class represents a linear variational problem:
+  ///
+  /// Find u in V such that
+  ///
+  ///     a(u, v) = L(v)  for all v in V^,
+  ///
+  /// where V is the trial space and V^ is the test space.
+
+  class LinearVariationalProblem : public Hierarchical<LinearVariationalProblem>
+  {
+  public:
+
+    /// Create linear variational problem without boundary conditions
+    LinearVariationalProblem(const Form& a,
+                             const Form& L,
+                             Function& u);
+
+    /// Create linear variational problem with a single boundary condition
+    LinearVariationalProblem(const Form& a,
+                             const Form& L,
+                             Function& u,
+                             const DirichletBC& bc);
+
+    /// Create linear variational problem with a list of boundary conditions
+    LinearVariationalProblem(const Form& a,
+                             const Form& L,
+                             Function& u,
+                             std::vector<const DirichletBC*> bcs);
+
+    /// Create linear variational problem with a list of boundary conditions
+    /// (shared pointer version)
+    LinearVariationalProblem(std::shared_ptr<const Form> a,
+                             std::shared_ptr<const Form> L,
+                             std::shared_ptr<Function> u,
+                             std::vector<std::shared_ptr<const DirichletBC> > bcs);
+
+    /// Return bilinear form
+    std::shared_ptr<const Form> bilinear_form() const;
+
+    /// Return linear form
+    std::shared_ptr<const Form> linear_form() const;
+
+    /// Return solution variable
+    std::shared_ptr<Function> solution();
+
+    /// Return solution variable (const version)
+    std::shared_ptr<const Function> solution() const;
+
+    /// Return boundary conditions
+    std::vector<std::shared_ptr<const DirichletBC> > bcs() const;
+
+    /// Return trial space
+    std::shared_ptr<const FunctionSpace> trial_space() const;
+
+    /// Return test space
+    std::shared_ptr<const FunctionSpace> test_space() const;
+
+  private:
+
+    // Check forms
+    void check_forms() const;
+
+    // The bilinear form
+    std::shared_ptr<const Form> _a;
+
+    // The linear form
+    std::shared_ptr<const Form> _l;
+
+    // The solution
+    std::shared_ptr<Function> _u;
+
+    // The Dirichlet boundary conditions
+    std::vector<std::shared_ptr<const DirichletBC> > _bcs;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/LinearVariationalSolver.cpp b/dolfin/fem/LinearVariationalSolver.cpp
new file mode 100644
index 0000000..6f82afd
--- /dev/null
+++ b/dolfin/fem/LinearVariationalSolver.cpp
@@ -0,0 +1,211 @@
+// Copyright (C) 2008-2011 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Marie E. Rognes, 2011.
+//
+// First added:  2011-01-14 (2008-12-26 as VariationalProblem.cpp)
+// Last changed: 2012-07-30
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/la/GenericMatrix.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/la/GenericLinearAlgebraFactory.h>
+#include <dolfin/la/LinearSolver.h>
+#include "Assembler.h"
+#include "SystemAssembler.h"
+#include "assemble.h"
+#include "DirichletBC.h"
+#include "Form.h"
+#include "LinearVariationalProblem.h"
+#include "LinearVariationalSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+LinearVariationalSolver::
+LinearVariationalSolver(LinearVariationalProblem& problem)
+  : _problem(reference_to_no_delete_pointer(problem))
+{
+  // Set parameters
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+LinearVariationalSolver::
+LinearVariationalSolver(std::shared_ptr<LinearVariationalProblem> problem)
+  : _problem(problem)
+{
+  // Set parameters
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+void LinearVariationalSolver::solve()
+{
+  begin("Solving linear variational problem.");
+
+  // Get parameters
+  std::string solver_type   = parameters["linear_solver"];
+  const std::string pc_type = parameters["preconditioner"];
+  const bool print_rhs      = parameters["print_rhs"];
+  const bool symmetric      = parameters["symmetric"];
+  const bool print_matrix   = parameters["print_matrix"];
+
+  // Get problem data
+  dolfin_assert(_problem);
+  std::shared_ptr<const Form> a(_problem->bilinear_form());
+  std::shared_ptr<const Form> L(_problem->linear_form());
+  std::shared_ptr<Function> u(_problem->solution());
+  std::vector<std::shared_ptr<const DirichletBC> > bcs(_problem->bcs());
+
+  dolfin_assert(a);
+  dolfin_assert(L);
+  dolfin_assert(u);
+
+  // Create matrix and vector
+  dolfin_assert(u->vector());
+  std::shared_ptr<GenericMatrix> A = u->vector()->factory().create_matrix();
+  std::shared_ptr<GenericVector> b = u->vector()->factory().create_vector();
+
+  // Different assembly depending on whether or not the system is symmetric
+  if (symmetric)
+  {
+    // Check that rhs (L) is not empty
+    if (!L->ufc_form())
+    {
+      dolfin_error("LinearVariationalSolver.cpp",
+                   "symmetric assembly in linear variational solver",
+                   "Empty linear forms cannot be used with symmetric assmebly");
+    }
+
+    // Need to cast to DirichletBC to use assemble_system
+    std::vector<const DirichletBC*> _bcs;
+    for (std::size_t i = 0; i < bcs.size(); i++)
+    {
+      dolfin_assert(bcs[i]);
+      const DirichletBC* _bc = dynamic_cast<const DirichletBC*>(bcs[i].get());
+      if (!_bc)
+      {
+        dolfin_error("LinearVariationalSolver.cpp",
+                     "apply boundary condition in linear variational solver",
+                     "Only Dirichlet boundary conditions may be used for symmetric systems");
+      }
+      _bcs.push_back(_bc);
+    }
+
+    // Assemble linear system and apply boundary conditions
+    SystemAssembler assembler(a, L, _bcs);
+    assembler.assemble(*A, *b);
+  }
+  else
+  {
+    // Assemble linear system
+    assemble(*A, *a);
+    if (L->ufc_form())
+      assemble(*b, *L);
+    else
+    {
+      if (L->num_coefficients() != 0)
+      {
+        dolfin_error("LinearVariationalSolver.cpp",
+                     "assemble linear form in linear variational solver",
+                     "Empty linear forms cannot have coefficient");
+      }
+      A->init_vector(*b, 0);
+    }
+
+    // Apply boundary conditions
+    for (std::size_t i = 0; i < bcs.size(); i++)
+    {
+      dolfin_assert(bcs[i]);
+      bcs[i]->apply(*A, *b);
+    }
+  }
+
+  // Print vector/matrix
+  if (print_rhs)
+    info(*b, true);
+  if (print_matrix)
+    info(*A, true);
+
+  // Get list of available methods
+  std::vector<std::pair<std::string, std::string> >
+    lu_methods = u->vector()->factory().lu_solver_methods();
+  std::vector<std::pair<std::string, std::string> >
+    krylov_methods = u->vector()->factory().krylov_solver_methods();
+  std::vector<std::pair<std::string, std::string> >
+    preconditioners = u->vector()->factory().krylov_solver_preconditioners();
+
+  // Choose linear solver
+  if (solver_type == "direct" || solver_type == "lu"
+      || LinearSolver::in_list(solver_type, lu_methods))
+  {
+    std::string lu_method;
+
+    if (solver_type == "direct" || solver_type == "lu")
+    {
+      lu_method = "default";
+    }
+    else
+    {
+      lu_method = solver_type;
+    }
+
+    // Solve linear system
+    LUSolver solver(lu_method);
+    solver.parameters.update(parameters("lu_solver"));
+    solver.parameters["symmetric"] = (bool) parameters["symmetric"];
+    solver.solve(*A, *u->vector(), *b);
+  }
+  else
+  {
+    if (solver_type == "iterative" || solver_type == "krylov")
+    {
+      // Adjust iterative solver type
+      if (symmetric)
+        solver_type = "cg";
+      else
+        solver_type = "gmres";
+    }
+
+    if (!LinearSolver::in_list(solver_type, krylov_methods))
+    {
+      dolfin_error("LinearVariationalSolver.cpp",
+                   "solve linear system",
+                   "Unknown solver method \"%s\". "
+                   "Use list_linear_solver_methods() to list available methods",
+                   solver_type.c_str());
+    }
+
+    if (pc_type != "default"
+        && !LinearSolver::in_list(pc_type, preconditioners))
+    {
+      dolfin_error("LinearVariationalSolver.cpp",
+                   "solve linear system",
+                   "Unknown preconditioner method \"%s\". "
+                   "Use list_krylov_solver_preconditioners() to list available methods",
+                   pc_type.c_str());
+    }
+
+    // Solve linear system
+    KrylovSolver solver(solver_type, pc_type);
+    solver.parameters.update(parameters("krylov_solver"));
+    solver.solve(*A, *u->vector(), *b);
+  }
+
+  end();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/LinearVariationalSolver.h b/dolfin/fem/LinearVariationalSolver.h
new file mode 100644
index 0000000..0fbe91e
--- /dev/null
+++ b/dolfin/fem/LinearVariationalSolver.h
@@ -0,0 +1,79 @@
+// Copyright (C) 2008-2011 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Marie E. Rognes, 2011.
+//
+// First added:  2011-01-14 (2008-12-26 as VariationalProblem)
+// Last changed: 2011-10-20
+
+#ifndef __LINEAR_VARIATIONAL_SOLVER_H
+#define __LINEAR_VARIATIONAL_SOLVER_H
+
+#include <dolfin/common/Variable.h>
+#include <dolfin/la/LUSolver.h>
+#include <dolfin/la/KrylovSolver.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class LinearVariationalProblem;
+
+  /// This class implements a solver for linear variational problems.
+
+  class LinearVariationalSolver : public Variable
+  {
+  public:
+
+    /// Create linear variational solver for given problem
+    LinearVariationalSolver(LinearVariationalProblem& problem);
+
+    /// Create linear variational solver for given problem (shared
+    /// pointer version)
+    LinearVariationalSolver(std::shared_ptr<LinearVariationalProblem> problem);
+
+    /// Solve variational problem
+    void solve();
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("linear_variational_solver");
+
+      p.add("linear_solver", "default");
+      p.add("preconditioner", "default");
+      p.add("symmetric", false);
+
+      p.add("print_rhs", false);
+      p.add("print_matrix", false);
+
+      p.add(LUSolver::default_parameters());
+      p.add(KrylovSolver::default_parameters());
+
+      return p;
+    }
+
+  private:
+
+    // The linear problem
+    std::shared_ptr<LinearVariationalProblem> _problem;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/LocalSolver.cpp b/dolfin/fem/LocalSolver.cpp
new file mode 100644
index 0000000..d706774
--- /dev/null
+++ b/dolfin/fem/LocalSolver.cpp
@@ -0,0 +1,138 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-12
+// Last changed:
+
+#include <Eigen/Dense>
+
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/FunctionSpace.h>
+#include "GenericDofMap.h"
+#include "Form.h"
+#include "UFC.h"
+
+#include "LocalSolver.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+void LocalSolver::solve(GenericVector& x, const Form& a, const Form& L,
+                        bool symmetric) const
+{
+  UFC ufc_a(a);
+  UFC ufc_L(L);
+
+  // Set timer
+  Timer timer("Local solver");
+
+  // Extract mesh
+  const Mesh& mesh = a.mesh();
+
+  // Form ranks
+  const std::size_t rank_a = ufc_a.form.rank();
+  const std::size_t rank_L = ufc_L.form.rank();
+
+  // Check form ranks
+  dolfin_assert(rank_a == 2);
+  dolfin_assert(rank_L == 1);
+
+  // Collect pointers to dof maps
+  std::shared_ptr<const GenericDofMap> dofmap_a0
+    = a.function_space(0)->dofmap();
+  std::shared_ptr<const GenericDofMap> dofmap_a1
+    = a.function_space(1)->dofmap();
+  std::shared_ptr<const GenericDofMap> dofmap_L
+    = a.function_space(0)->dofmap();
+  dolfin_assert(dofmap_a0);
+  dolfin_assert(dofmap_a1);
+  dolfin_assert(dofmap_L);
+
+  // Initialise vector
+  if (x.empty())
+  {
+    std::pair<std::size_t, std::size_t> local_range
+      = dofmap_L->ownership_range();
+    x.init(mesh.mpi_comm(), local_range);
+  }
+
+  // Cell integrals
+  ufc::cell_integral* integral_a = ufc_a.default_cell_integral.get();
+  ufc::cell_integral* integral_L = ufc_L.default_cell_integral.get();
+
+  // Eigen data structures
+  Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor> A;
+  Eigen::VectorXd b, x_local;
+
+  // Assemble over cells
+  Progress p("Performing local (cell-wise) solve", mesh.num_cells());
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Update to current cell
+    cell->get_vertex_coordinates(vertex_coordinates);
+    cell->get_cell_data(ufc_cell);
+    ufc_a.update(*cell, vertex_coordinates, ufc_cell,
+                 integral_a->enabled_coefficients());
+    ufc_L.update(*cell, vertex_coordinates, ufc_cell,
+                 integral_L->enabled_coefficients());
+
+    // Get local-to-global dof maps for cell
+    const std::vector<dolfin::la_index>& dofs_a0
+      = dofmap_a0->cell_dofs(cell->index());
+    const std::vector<dolfin::la_index>& dofs_a1
+      = dofmap_a1->cell_dofs(cell->index());
+    const std::vector<dolfin::la_index>& dofs_L
+      = dofmap_L->cell_dofs(cell->index());
+
+    // Check that local problem is square and a and L match
+    dolfin_assert(dofs_a0.size() == dofs_a1.size());
+    dolfin_assert(dofs_a1.size() == dofs_L.size());
+
+    // Resize A and b
+    A.resize(dofs_a0.size(), dofs_a1.size());
+    b.resize(dofs_L.size());
+
+    // Tabulate A and b on cell
+    integral_a->tabulate_tensor(A.data(),
+                                ufc_a.w(),
+                                vertex_coordinates.data(),
+                                ufc_cell.orientation);
+    integral_L->tabulate_tensor(b.data(),
+                                ufc_L.w(),
+                                vertex_coordinates.data(),
+                                ufc_cell.orientation);
+
+    // Solve local problem
+    x_local = A.partialPivLu().solve(b);
+
+    // Set solution in global vector
+    x.set(x_local.data(), dofs_a0.size(), dofs_a0.data());
+
+    p++;
+  }
+
+  // Finalise vector
+  x.apply("insert");
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/LocalSolver.h b/dolfin/fem/LocalSolver.h
new file mode 100644
index 0000000..67263b0
--- /dev/null
+++ b/dolfin/fem/LocalSolver.h
@@ -0,0 +1,58 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-12
+// Last changed:
+
+#ifndef __LOCAL_SOLVER_H
+#define __LOCAL_SOLVER_H
+
+namespace dolfin
+{
+
+  /// This class solves problems cell-wise. It computes the local
+  /// left-hand side A_local and the local right-hand side b_local
+  /// (for one cell), and solves A_local x_local = b_local. The result
+  /// x_local is copied into the global vector x. The operator A_local
+  /// must be square.
+  ///
+  /// For forms with no coupling across cell edges, this function is
+  /// identical to a global solve. For problems with coupling across
+  /// cells it is not.
+  ///
+  /// This class can be used for post-processing solutions, e.g. computing
+  /// stress fields for visualisation, far more cheaply that using
+  /// global projections.
+
+  // Forward declarations
+  class GenericVector;
+  class Form;
+
+  class LocalSolver
+  {
+  public:
+
+    /// Solve local (cell-wise) problem and copy result into global
+    /// vector x.
+    void solve(GenericVector& x, const Form& a, const Form& L,
+               bool symmetric=false) const;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/NonlinearVariationalProblem.cpp b/dolfin/fem/NonlinearVariationalProblem.cpp
new file mode 100644
index 0000000..c4feb3a
--- /dev/null
+++ b/dolfin/fem/NonlinearVariationalProblem.cpp
@@ -0,0 +1,266 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Corrado Maurini, 2013.
+//
+// First added:  2011-06-22
+// Last changed: 2013-03-20
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/function/Function.h>
+#include "Form.h"
+#include "NonlinearVariationalProblem.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+NonlinearVariationalProblem::NonlinearVariationalProblem(const Form& F,
+                                                         Function& u)
+  : Hierarchical<NonlinearVariationalProblem>(*this),
+    _residual(reference_to_no_delete_pointer(F)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalProblem::NonlinearVariationalProblem(const Form& F,
+                                                         Function& u,
+                                                         const Form& J)
+  : Hierarchical<NonlinearVariationalProblem>(*this),
+    _residual(reference_to_no_delete_pointer(F)),
+    _jacobian(reference_to_no_delete_pointer(J)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalProblem::NonlinearVariationalProblem(const Form& F,
+                                                         Function& u,
+                                                         const DirichletBC& bc)
+  : Hierarchical<NonlinearVariationalProblem>(*this),
+    _residual(reference_to_no_delete_pointer(F)), _u(reference_to_no_delete_pointer(u))
+{
+  // Store boundary condition
+  _bcs.push_back(reference_to_no_delete_pointer(bc));
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalProblem::NonlinearVariationalProblem(const Form& F,
+                                                         Function& u,
+                                                         const DirichletBC& bc,
+                                                         const Form& J)
+  : Hierarchical<NonlinearVariationalProblem>(*this),
+    _residual(reference_to_no_delete_pointer(F)),
+    _jacobian(reference_to_no_delete_pointer(J)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Store boundary condition
+  _bcs.push_back(reference_to_no_delete_pointer(bc));
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalProblem::NonlinearVariationalProblem(const Form& F,
+                                                         Function& u,
+                                          std::vector<const DirichletBC*> bcs)
+  : Hierarchical<NonlinearVariationalProblem>(*this),
+    _residual(reference_to_no_delete_pointer(F)), _u(reference_to_no_delete_pointer(u))
+{
+  // Store boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); ++i)
+    _bcs.push_back(reference_to_no_delete_pointer(*bcs[i]));
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalProblem::NonlinearVariationalProblem(const Form& F,
+                                                         Function& u,
+                                          std::vector<const DirichletBC*> bcs,
+                                          const Form& J)
+  : Hierarchical<NonlinearVariationalProblem>(*this),
+    _residual(reference_to_no_delete_pointer(F)),
+    _jacobian(reference_to_no_delete_pointer(J)),
+    _u(reference_to_no_delete_pointer(u))
+{
+  // Store boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); ++i)
+    _bcs.push_back(reference_to_no_delete_pointer(*bcs[i]));
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalProblem::NonlinearVariationalProblem(
+  std::shared_ptr<const Form> F,
+  std::shared_ptr<Function> u,
+  std::vector<std::shared_ptr<const DirichletBC> > bcs)
+  : Hierarchical<NonlinearVariationalProblem>(*this), _residual(F), _u(u)
+{
+  // Store boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); ++i)
+    _bcs.push_back(bcs[i]);
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalProblem::NonlinearVariationalProblem(
+  std::shared_ptr<const Form> F,
+  std::shared_ptr<Function> u,
+  std::vector<std::shared_ptr<const DirichletBC> > bcs,
+  std::shared_ptr<const Form> J)
+  : Hierarchical<NonlinearVariationalProblem>(*this), _residual(F), _jacobian(J), _u(u)
+{
+  // Store boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); ++i)
+    _bcs.push_back(bcs[i]);
+
+  // Check forms
+  check_forms();
+}
+//-----------------------------------------------------------------------------
+void NonlinearVariationalProblem::set_bounds(
+  std::shared_ptr<const Function> lb_func,
+  std::shared_ptr<const Function> ub_func)
+{
+    set_bounds(*lb_func,*ub_func);
+}
+//-----------------------------------------------------------------------------
+void NonlinearVariationalProblem::set_bounds(const Function& lb_func,
+                                             const Function& ub_func)
+{
+    set_bounds(lb_func.vector(),ub_func.vector());
+}
+//-----------------------------------------------------------------------------
+void NonlinearVariationalProblem::set_bounds(const GenericVector& lb,
+                                             const GenericVector& ub)
+{
+    set_bounds(reference_to_no_delete_pointer(lb),
+               reference_to_no_delete_pointer(ub));
+}
+//-----------------------------------------------------------------------------
+void NonlinearVariationalProblem::set_bounds(
+  std::shared_ptr<const GenericVector> lb,
+  std::shared_ptr<const GenericVector> ub)
+{
+    this->_lb = lb;
+    this->_ub = ub;
+    dolfin_assert(_lb);
+    dolfin_assert(_ub);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Form> NonlinearVariationalProblem::residual_form() const
+{
+  return _residual;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Form> NonlinearVariationalProblem::jacobian_form() const
+{
+  return _jacobian;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Function> NonlinearVariationalProblem::solution()
+{
+  return _u;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Function> NonlinearVariationalProblem::solution() const
+{
+  return _u;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::shared_ptr<const DirichletBC> >
+NonlinearVariationalProblem::bcs() const
+{
+  return _bcs;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace>
+NonlinearVariationalProblem::trial_space() const
+{
+  dolfin_assert(_u);
+  return _u->function_space();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace>
+NonlinearVariationalProblem::test_space() const
+{
+  dolfin_assert(_residual);
+  return _residual->function_space(0);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericVector>
+NonlinearVariationalProblem::lower_bound() const
+{
+  dolfin_assert(_lb);
+  return _lb;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericVector>
+NonlinearVariationalProblem::upper_bound() const
+{
+  dolfin_assert(_ub);
+  return _ub;
+}
+//-----------------------------------------------------------------------------
+bool NonlinearVariationalProblem::has_jacobian() const
+{
+  return _jacobian ?  true : false;
+}
+//-----------------------------------------------------------------------------
+bool NonlinearVariationalProblem::has_lower_bound() const
+{
+  return _lb ?  true : false;
+}
+//-----------------------------------------------------------------------------
+bool NonlinearVariationalProblem::has_upper_bound() const
+{
+  return _ub ?  true : false;
+}
+//-----------------------------------------------------------------------------
+void NonlinearVariationalProblem::check_forms() const
+{
+  // Check rank of residual F
+  dolfin_assert(_residual);
+  if (_residual->rank() != 1)
+  {
+   dolfin_error("NonlinearVariationalProblem.cpp",
+                 "define nonlinear variational problem F(u; v) = 0 for all v",
+                 "Expecting the residual F to be a linear form (not rank %d)",
+                 _residual->rank());
+  }
+
+  // Check rank of Jacobian J
+  if (_jacobian && _jacobian->rank() != 2)
+  {
+    dolfin_error("NonlinearVariationalProblem.cpp",
+                 "define nonlinear variational problem F(u; v) = 0 for all v",
+                 "Expecting the Jacobian J to be a bilinear form (not rank %d)",
+                 _jacobian->rank());
+  }
+
+  // FIXME: Should we add a check here that matches the function space
+  // FIXME: of the solution variable u to a coefficient space for F?
+  dolfin_assert(_u);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/NonlinearVariationalProblem.h b/dolfin/fem/NonlinearVariationalProblem.h
new file mode 100644
index 0000000..f96a1e4
--- /dev/null
+++ b/dolfin/fem/NonlinearVariationalProblem.h
@@ -0,0 +1,185 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Corrado Maurini, 2013.
+//
+// First added:  2011-06-22
+// Last changed: 2013-03-20
+
+#ifndef __NONLINEAR_VARIATIONAL_PROBLEM_H
+#define __NONLINEAR_VARIATIONAL_PROBLEM_H
+
+#include <memory>
+#include <dolfin/common/Hierarchical.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Form;
+  class Function;
+  class FunctionSpace;
+  class DirichletBC;
+  class GenericVector;
+
+  /// This class represents a nonlinear variational problem:
+  ///
+  /// Find u in V such that
+  ///
+  ///     F(u; v) = 0  for all v in V^,
+  ///
+  /// where V is the trial space and V^ is the test space.
+
+  class NonlinearVariationalProblem
+    : public Hierarchical<NonlinearVariationalProblem>
+  {
+  public:
+
+    /// Create nonlinear variational problem without boundary
+    /// conditions.  The Jacobian form is not specified which requires
+    /// the use of a nonlinear solver that does not rely on the
+    /// Jacobian.
+    NonlinearVariationalProblem(const Form& F, Function& u);
+
+    /// Create nonlinear variational problem without boundary
+    /// conditions.  The Jacobian form is specified which allows the
+    /// use of a nonlinear solver that relies on the Jacobian (using
+    /// Newton's method).
+    NonlinearVariationalProblem(const Form& F, Function& u, const Form& J);
+
+    /// Create nonlinear variational problem with a single boundary
+    /// condition.  The Jacobian form is not specified which requires
+    /// the use of a nonlinear solver that does not rely on the
+    /// Jacobian.
+    NonlinearVariationalProblem(const Form& F, Function& u,
+                                const DirichletBC& bc);
+
+    /// Create nonlinear variational problem with a single boundary
+    /// condition.  The Jacobian form is specified which allows the
+    /// use of a nonlinear solver that relies on the Jacobian (using
+    /// Newton's method).
+    NonlinearVariationalProblem(const Form& F, Function& u,
+                                const DirichletBC& bc, const Form& J);
+
+    /// Create nonlinear variational problem with a list of boundary
+    /// conditions.  The Jacobian form is not specified which requires
+    /// the use of a nonlinear solver that does not rely on the
+    /// Jacobian.
+    NonlinearVariationalProblem(const Form& F, Function& u,
+                                std::vector<const DirichletBC*> bcs);
+
+    /// Create nonlinear variational problem with a list of boundary
+    /// conditions.  The Jacobian form is specified which allows the
+    /// use of a nonlinear solver that relies on the Jacobian (using
+    /// Newton's method).
+    NonlinearVariationalProblem(const Form& F, Function& u,
+                                std::vector<const DirichletBC*> bcs,
+                                const Form& J);
+
+    /// Create nonlinear variational problem, shared pointer version.
+    /// The Jacobian form is not specified which requires the use of a
+    /// nonlinear solver that does not rely on the Jacobian.
+    NonlinearVariationalProblem(std::shared_ptr<const Form> F,
+                                std::shared_ptr<Function> u,
+                                std::vector<std::shared_ptr<const DirichletBC> > bcs);
+
+    /// Create nonlinear variational problem, shared pointer version.
+    /// The Jacobian form is specified which allows the use of a
+    /// nonlinear solver that relies on the Jacobian (using Newton's
+    /// method).
+    NonlinearVariationalProblem(std::shared_ptr<const Form> F,
+                                std::shared_ptr<Function> u,
+                                std::vector<std::shared_ptr<const DirichletBC> > bcs,
+                                std::shared_ptr<const Form> J);
+
+    /// Set the bounds for bound constrained solver
+    void set_bounds(std::shared_ptr<const GenericVector> lb,
+                    std::shared_ptr<const GenericVector> ub);
+
+    /// Set the bounds for bound constrained solver
+    void set_bounds(const GenericVector& lb,
+                    const GenericVector& ub);
+
+    /// Set the bounds for bound constrained solver
+    void set_bounds(std::shared_ptr<const Function> lb_func,
+                    std::shared_ptr<const Function> ub_func);
+
+    /// Set the bounds for bound constrained solver
+    void set_bounds(const Function& lb_func,
+                    const Function& ub_func);
+
+    /// Return residual form
+    std::shared_ptr<const Form> residual_form() const;
+
+    /// Return Jacobian form
+    std::shared_ptr<const Form> jacobian_form() const;
+
+    /// Return solution variable
+    std::shared_ptr<Function> solution();
+
+    /// Return solution variable (const version)
+    std::shared_ptr<const Function> solution() const;
+
+    /// Return boundary conditions
+    std::vector<std::shared_ptr<const DirichletBC> > bcs() const;
+
+    /// Return trial space
+    std::shared_ptr<const FunctionSpace> trial_space() const;
+
+    /// Return test space
+    std::shared_ptr<const FunctionSpace> test_space() const;
+
+    /// Return lower bound
+    std::shared_ptr<const GenericVector> lower_bound() const;
+
+    /// Return upper bound
+    std::shared_ptr<const GenericVector> upper_bound() const;
+
+    /// Check whether Jacobian has been defined
+    bool has_jacobian() const;
+
+    /// Check whether lower bound has been defined
+    bool has_lower_bound() const;
+
+    /// Check whether upper bound have has defined
+    bool has_upper_bound() const;
+
+  private:
+
+    // Check forms
+    void check_forms() const;
+
+    // The residual form
+    std::shared_ptr<const Form> _residual;
+
+    // The Jacobian form (pointer may be zero if not provided)
+    std::shared_ptr<const Form> _jacobian;
+
+    // The solution
+    std::shared_ptr<Function> _u;
+
+    // The boundary conditions
+    std::vector<std::shared_ptr<const DirichletBC> > _bcs;
+
+    // The lower and upper bounds (pointers may be zero if not provided)
+    std::shared_ptr<const GenericVector> _lb;
+    std::shared_ptr<const GenericVector> _ub;
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/NonlinearVariationalSolver.cpp b/dolfin/fem/NonlinearVariationalSolver.cpp
new file mode 100644
index 0000000..909f078
--- /dev/null
+++ b/dolfin/fem/NonlinearVariationalSolver.cpp
@@ -0,0 +1,245 @@
+// Copyright (C) 2008-2011 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Marie E. Rognes 2011
+// Modified by Corrado Maurini 2013
+//
+// First added:  2011-01-14 (2008-12-26 as VariationalProblem.cpp)
+// Last changed: 2013-11-21
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/la/GenericMatrix.h>
+#include <dolfin/function/Function.h>
+#include "Assembler.h"
+#include "Form.h"
+#include "NonlinearVariationalProblem.h"
+#include "NonlinearVariationalSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+NonlinearVariationalSolver::
+NonlinearVariationalSolver(NonlinearVariationalProblem& problem)
+  : _problem(reference_to_no_delete_pointer(problem))
+{
+  // Set parameters
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalSolver::
+NonlinearVariationalSolver(std::shared_ptr<NonlinearVariationalProblem> problem)
+  : _problem(problem)
+{
+  // Set parameters
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, bool> NonlinearVariationalSolver::solve(const Function& lb,
+                                                               const Function& ub)
+{
+  return solve(lb.vector(), ub.vector());
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, bool> NonlinearVariationalSolver::solve(std::shared_ptr<const Function> lb,
+                                       std::shared_ptr<const Function> ub)
+{
+  return solve(*lb,*ub);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, bool> NonlinearVariationalSolver::solve(const GenericVector& lb,
+                                                               const GenericVector& ub)
+{
+  return solve(reference_to_no_delete_pointer(lb),reference_to_no_delete_pointer(ub));
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, bool> NonlinearVariationalSolver::solve(std::shared_ptr<const GenericVector> lb,
+                                       std::shared_ptr<const GenericVector> ub)
+{
+  // Set bounds and solve
+  this->_problem->set_bounds(lb,ub);
+  return solve();
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, bool> NonlinearVariationalSolver::solve()
+{
+  begin("Solving nonlinear variational problem.");
+
+  // Check that the Jacobian has been defined
+  dolfin_assert(_problem);
+  if (!_problem->has_jacobian())
+  {
+    dolfin_error("NonlinearVariationalSolver.cpp",
+                 "solve nonlinear variational problem",
+                 "The Jacobian form has not been defined");
+  }
+  // Check that the dolfin is configured with petsc is bounds are set
+#ifndef HAS_PETSC
+  if (_problem->has_lower_bound() || _problem->has_upper_bound())
+  {
+    dolfin_error("NonlinearVariationalSolver.cpp",
+                 "solve nonlinear variational problem",
+                 "Needs PETSc to solve bound constrained problems");
+  }
+#endif
+  // Get problem data
+  dolfin_assert(_problem);
+  std::shared_ptr<Function> u(_problem->solution());
+
+  // 'reset_jacobian' option is deprecated
+  if (parameters["reset_jacobian"].change_count() > 1)
+  {
+    deprecation("reset_jacobian parameter in NonlinearVariationalSolver",
+                "1.4.0", "1.5",
+                "reset_jacobian no longer has any effect.");
+  }
+
+  // Create nonlinear problem
+  if (!nonlinear_problem)
+  {
+    nonlinear_problem = std::shared_ptr<NonlinearDiscreteProblem>(new NonlinearDiscreteProblem(_problem,
+                                             reference_to_no_delete_pointer(*this)));
+  }
+
+  std::pair<std::size_t, bool> ret;
+  if (std::string(parameters["nonlinear_solver"]) == "newton")
+  {
+    if (_problem->has_lower_bound() && _problem->has_upper_bound())
+    {
+      dolfin_error("NonlinearVariationalSolver.cpp",
+                   "solve nonlinear variational problem",
+                   "Set the \"nonlinear_solver\" parameter to \"snes\" or remove bounds");
+    }
+    // Create Newton solver and set parameters
+    if (!newton_solver)
+      newton_solver = std::shared_ptr<NewtonSolver>(new NewtonSolver());
+
+    // Pass parameters to Newton solver
+    newton_solver->parameters.update(parameters("newton_solver"));
+
+    // Solve nonlinear problem using Newton's method
+    dolfin_assert(u->vector());
+    dolfin_assert(nonlinear_problem);
+    ret = newton_solver->solve(*nonlinear_problem, *u->vector());
+  }
+  #ifdef ENABLE_PETSC_SNES
+  else if (std::string(parameters["nonlinear_solver"]) == "snes")
+  {
+    // Create SNES solver and set parameters
+    if (!snes_solver)
+    {
+      // Create Newton solver and set parameters
+      snes_solver = std::shared_ptr<PETScSNESSolver>(new PETScSNESSolver());
+    }
+    snes_solver->parameters.update(parameters("snes_solver"));
+
+    // Solve nonlinear problem using PETSc's SNES
+    dolfin_assert(u->vector());
+    dolfin_assert(nonlinear_problem);
+    if (_problem->has_lower_bound() && _problem->has_upper_bound())
+    {
+      ret = snes_solver->solve(*nonlinear_problem, *u->vector(),
+                               *_problem->lower_bound(),
+                               *_problem->upper_bound());
+    }
+    else
+      ret = snes_solver->solve(*nonlinear_problem, *u->vector());
+  }
+  #endif
+  else
+  {
+    dolfin_error("NonlinearVariationalSolver.cpp",
+                 "solve nonlinear variational problem",
+                 "Unknown nonlinear solver type");
+  }
+
+  end();
+  return ret;
+}
+//-----------------------------------------------------------------------------
+// Implementation of NonlinearDiscreteProblem
+//-----------------------------------------------------------------------------
+NonlinearVariationalSolver::
+NonlinearDiscreteProblem::
+NonlinearDiscreteProblem(std::shared_ptr<NonlinearVariationalProblem> problem,
+                         std::shared_ptr<NonlinearVariationalSolver> solver)
+  : _problem(problem), _solver(solver)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+NonlinearVariationalSolver::
+NonlinearDiscreteProblem::~NonlinearDiscreteProblem()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void NonlinearVariationalSolver::
+NonlinearDiscreteProblem::F(GenericVector& b, const GenericVector& x)
+{
+  // Get problem data
+  dolfin_assert(_problem);
+  std::shared_ptr<const Form> F(_problem->residual_form());
+  std::vector<std::shared_ptr<const DirichletBC> > bcs(_problem->bcs());
+
+  // Assemble right-hand side
+  dolfin_assert(F);
+  Assembler assembler;
+  assembler.assemble(b, *F);
+
+  // Apply boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); i++)
+  {
+    dolfin_assert(bcs[i]);
+    bcs[i]->apply(b, x);
+  }
+
+  // Print vector
+  dolfin_assert(_solver);
+  const bool print_rhs = _solver->parameters["print_rhs"];
+  if (print_rhs)
+    info(b, true);
+}
+//-----------------------------------------------------------------------------
+void NonlinearVariationalSolver::NonlinearDiscreteProblem::J(GenericMatrix& A,
+                                                        const GenericVector& x)
+{
+  // Get problem data
+  dolfin_assert(_problem);
+  std::shared_ptr<const Form> J(_problem->jacobian_form());
+  std::vector<std::shared_ptr<const DirichletBC> > bcs(_problem->bcs());
+
+  // Assemble left-hand side
+  dolfin_assert(J);
+  Assembler assembler;
+  assembler.assemble(A, *J);
+
+  // Apply boundary conditions
+  for (std::size_t i = 0; i < bcs.size(); i++)
+  {
+    dolfin_assert(bcs[i]);
+    bcs[i]->apply(A);
+  }
+
+  // Print matrix
+  dolfin_assert(_solver);
+  const bool print_matrix = _solver->parameters["print_matrix"];
+  if (print_matrix)
+    info(A, true);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/NonlinearVariationalSolver.h b/dolfin/fem/NonlinearVariationalSolver.h
new file mode 100644
index 0000000..626b543
--- /dev/null
+++ b/dolfin/fem/NonlinearVariationalSolver.h
@@ -0,0 +1,192 @@
+// Copyright (C) 2008-2011 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Marie E. Rognes, 2011.
+// Modified by Corrado Maurini, 2013.
+//
+// First added:  2011-01-14 (2008-12-26 as VariationalProblem.h)
+// Last changed: 2013-11-20
+
+#ifndef __NONLINEAR_VARIATIONAL_SOLVER_H
+#define __NONLINEAR_VARIATIONAL_SOLVER_H
+
+#include <dolfin/nls/NonlinearProblem.h>
+#include <dolfin/nls/NewtonSolver.h>
+#include <dolfin/nls/PETScSNESSolver.h>
+#include "NonlinearVariationalProblem.h"
+
+namespace dolfin
+{
+
+  /// This class implements a solver for nonlinear variational problems.
+
+  class NonlinearVariationalSolver : public Variable
+  {
+  public:
+
+    /// Create nonlinear variational solver for given problem
+    NonlinearVariationalSolver(NonlinearVariationalProblem& problem);
+
+    /// Create nonlinear variational solver for given problem (shared
+    /// pointer version)
+    NonlinearVariationalSolver(std::shared_ptr<NonlinearVariationalProblem> problem);
+
+    /// Solve variational problem with bound constraints defined by
+    /// GenericVectors
+    ///
+    /// *Arguments*
+    ///     lb (_GenericVector_)
+    ///         The linear solver.
+    ///     ub (_GenericVector_)
+    ///         The factory.
+    /// *Returns*
+    ///     std::pair<std::size_t, bool>
+    ///         Pair of number of Newton iterations, and whether
+    ///         iteration converged)
+    std::pair<std::size_t, bool> solve(const GenericVector& lb,
+                                       const GenericVector& ub);
+
+    /// Solve variational problem with bound constraints defined by
+    /// GenericVectors (shared pointer version)
+    ///
+    /// *Arguments*
+    ///     lb (_std::shared_ptr<const GenericVector>_)
+    ///         The linear solver.
+    ///     ub (_std::shared_ptr<const GenericVector>_)
+    ///         The factory.
+    /// *Returns*
+    ///     std::pair<std::size_t, bool>
+    ///         Pair of number of Newton iterations, and whether
+    ///         iteration converged)
+    std::pair<std::size_t, bool>
+      solve(std::shared_ptr<const GenericVector> lb,
+            std::shared_ptr<const GenericVector> ub);
+
+    /// Solve variational problem with bound constraints defined by Functions
+    ///
+    /// *Arguments*
+    ///     lb (_Function_)
+    ///         The linear solver.
+    ///     ub (_Function_)
+    ///         The factory.
+    /// *Returns*
+    ///     std::pair<std::size_t, bool>
+    ///         Pair of number of Newton iterations, and whether
+    ///         iteration converged)
+    std::pair<std::size_t, bool> solve(const Function& lb,
+                                       const Function& ub);
+
+    /// Solve variational problem with bound constraints defined by
+    /// Functions (shared pointer version)
+    ///
+    /// *Arguments*
+    ///     lb (_std::shared_ptr<const Function>_)
+    ///         The linear solver.
+    ///     ub (_std::shared_ptr<const Function>_)
+    ///         The factory.
+    /// *Returns*
+    ///     std::pair<std::size_t, bool>
+    ///         Pair of number of Newton iterations, and whether
+    ///         iteration converged)
+    std::pair<std::size_t, bool> solve(std::shared_ptr<const Function> lb,
+                                       std::shared_ptr<const Function> ub);
+
+    /// Solve variational problem
+    ///
+    /// *Returns*
+    ///     std::pair<std::size_t, bool>
+    ///         Pair of number of Newton iterations, and whether
+    ///         iteration converged)
+    std::pair<std::size_t, bool> solve();
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("nonlinear_variational_solver");
+
+      p.add("symmetric", false);
+
+      // TODO: Remove in DOLFIN 1.5
+      p.add("reset_jacobian", false);
+
+      std::set<std::string> nonlinear_solvers;
+      nonlinear_solvers.insert("newton");
+      std::string default_nonlinear_solver = "newton";
+
+      p.add("print_rhs", false);
+      p.add("print_matrix", false);
+
+      p.add(NewtonSolver::default_parameters());
+
+      #ifdef ENABLE_PETSC_SNES
+      p.add(PETScSNESSolver::default_parameters());
+      nonlinear_solvers.insert("snes");
+      #endif
+
+      p.add("nonlinear_solver", default_nonlinear_solver, nonlinear_solvers);
+
+      return p;
+    }
+
+  private:
+
+    // Nonlinear (algebraic) problem
+    class NonlinearDiscreteProblem : public NonlinearProblem
+    {
+    public:
+
+      // Constructor
+      NonlinearDiscreteProblem(
+        std::shared_ptr<NonlinearVariationalProblem> problem,
+        std::shared_ptr<NonlinearVariationalSolver> solver);
+
+      // Destructor
+      ~NonlinearDiscreteProblem();
+
+      // Compute F at current point x
+      virtual void F(GenericVector& b, const GenericVector& x);
+
+      // Compute J = F' at current point x
+      virtual void J(GenericMatrix& A, const GenericVector& x);
+
+    private:
+
+      // Problem and solver objects
+      std::shared_ptr<NonlinearVariationalProblem> _problem;
+      std::shared_ptr<NonlinearVariationalSolver> _solver;
+
+    };
+
+    // The nonlinear problem
+    std::shared_ptr<NonlinearVariationalProblem> _problem;
+
+    // The nonlinear discrete problem
+    std::shared_ptr<NonlinearDiscreteProblem> nonlinear_problem;
+
+    // The Newton solver
+    std::shared_ptr<NewtonSolver> newton_solver;
+
+    #ifdef ENABLE_PETSC_SNES
+    // Or, alternatively, the SNES solver
+    std::shared_ptr<PETScSNESSolver> snes_solver;
+    #endif
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/OpenMpAssembler.cpp b/dolfin/fem/OpenMpAssembler.cpp
new file mode 100644
index 0000000..0e0dc18
--- /dev/null
+++ b/dolfin/fem/OpenMpAssembler.cpp
@@ -0,0 +1,631 @@
+// Copyright (C) 2010-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2007-2009
+// Modified by Ola Skavhaug 2007-2009
+// Modified by Kent-Andre Mardal 2008
+// Modified by Anders Logg 2010-2013
+//
+// First added:  2010-11-10
+// Last changed: 2013-02-26
+
+#ifdef HAS_OPENMP
+
+#include <algorithm>
+#include <map>
+#include <utility>
+#include <vector>
+#include <omp.h>
+
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/la/GenericTensor.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/MeshData.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/SubDomain.h>
+#include <dolfin/mesh/SubsetIterator.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/FunctionSpace.h>
+#include "GenericDofMap.h"
+#include "Form.h"
+#include "UFC.h"
+#include "FiniteElement.h"
+#include "OpenMpAssembler.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+void OpenMpAssembler::assemble(GenericTensor& A, const Form& a)
+{
+  // Get mesh
+  const Mesh& mesh = a.mesh();
+
+  if (MPI::size(mesh.mpi_comm()) > 1)
+  {
+    dolfin_error("OpenMPAssembler.cpp",
+                 "perform multithreaded assembly using OpenMP assembler",
+                 "The OpenMp assembler has not been tested in combination with MPI");
+  }
+
+   dolfin_assert(a.ufc_form());
+
+  // All assembler functions above end up calling this function, which
+  // in turn calls the assembler functions below to assemble over
+  // cells, exterior and interior facets. Note the importance of
+  // treating empty mesh functions as null pointers for the PyDOLFIN
+  // interface.
+
+  // Get cell domains
+  const MeshFunction<std::size_t>* cell_domains = a.cell_domains().get();
+
+  // Get exterior facet domains
+  const MeshFunction<std::size_t>* exterior_facet_domains
+    = a.exterior_facet_domains().get();
+
+  // Get interior facet domains
+  const MeshFunction<std::size_t>* interior_facet_domains
+    = a.interior_facet_domains().get();
+
+  // Check form
+  AssemblerBase::check(a);
+
+  // Create data structure for local assembly data
+  UFC ufc(a);
+
+  // Initialize global tensor
+  init_global_tensor(A, a);
+
+  // FIXME: The below selections should be made robust
+
+  if (a.ufc_form()->has_interior_facet_integrals())
+    assemble_interior_facets(A, a, ufc, interior_facet_domains, 0);
+
+  if (a.ufc_form()->has_exterior_facet_integrals())
+  {
+    assemble_cells_and_exterior_facets(A, a, ufc, cell_domains,
+                                       exterior_facet_domains, 0);
+  }
+  else
+    assemble_cells(A, a, ufc, cell_domains, 0);
+
+  // Finalize assembly of global tensor
+  if (finalize_tensor)
+    A.apply("add");
+}
+//-----------------------------------------------------------------------------
+void OpenMpAssembler::assemble_cells(GenericTensor& A, const Form& a,
+                                     UFC& _ufc,
+                                     const MeshFunction<std::size_t>* domains,
+                                     std::vector<double>* values)
+{
+  // Skip assembly if there are no cell integrals
+  if (!_ufc.form.has_cell_integrals())
+    return;
+
+  Timer timer("Assemble cells");
+
+  // Set number of OpenMP threads (from parameter systems)
+  const std::size_t num_threads = parameters["num_threads"];
+  omp_set_num_threads(num_threads);
+
+  // Extract mesh
+  const Mesh& mesh = a.mesh();
+
+  // FIXME: Check that UFC copy constructor is dealing with copying
+  // pointers correctly
+  // Dummy UFC object since each thread needs to created its own UFC object
+  UFC ufc(_ufc);
+
+  // Form rank
+  const std::size_t form_rank = ufc.form.rank();
+
+  // Cell integral
+  const ufc::cell_integral* integral = ufc.default_cell_integral.get();
+
+  // Check whether integral is domain-dependent
+  bool use_domains = domains && !domains->empty();
+
+  // Collect pointers to dof maps
+  std::vector<const GenericDofMap*> dofmaps;
+  for (std::size_t i = 0; i < form_rank; ++i)
+    dofmaps.push_back(a.function_space(i)->dofmap().get());
+
+  // Vector to hold dof map for a cell
+  std::vector<const std::vector<dolfin::la_index>* > dofs(form_rank);
+
+  // Color mesh
+  std::vector<std::size_t> coloring_type = a.coloring(mesh.topology().dim());
+  mesh.color(coloring_type);
+
+  // Get coloring data
+  std::map<const std::vector<std::size_t>,
+           std::pair<std::vector<std::size_t>, std::vector<std::vector<std::size_t> > > >::const_iterator mesh_coloring;
+  mesh_coloring = mesh.topology().coloring.find(coloring_type);
+  if (mesh_coloring == mesh.topology().coloring.end())
+  {
+    dolfin_error("OpenMPAssembler.cpp",
+                 "perform multithreaded assembly using OpenMP assembler",
+                 "Requested mesh coloring has not been computed");
+  }
+
+  // Get coloring data
+  const std::vector<std::vector<std::size_t> >& entities_of_color
+    = mesh_coloring->second.second;
+
+  // If assembling a scalar we need to ensure each threads assemble
+  // its own scalar
+  std::vector<double> scalars(num_threads, 0.0);
+
+  // Assemble over cells (loop over colours, then cells of same color)
+  const std::size_t num_colors = entities_of_color.size();
+  Progress p("Assembling cells (threaded)", num_colors);
+  for (std::size_t color = 0; color < num_colors; ++color)
+  {
+    // Get the array of cell indices of current color
+    const std::vector<std::size_t>& colored_cells = entities_of_color[color];
+
+    // Number of cells of current color
+    const int num_cells = colored_cells.size();
+
+    ufc::cell ufc_cell;
+    std::vector<double> vertex_coordinates;
+
+    // OpenMP test loop over cells of the same color
+#pragma omp parallel for schedule(guided, 20) firstprivate(ufc, ufc_cell, vertex_coordinates, dofs, integral)
+    for (int cell_index = 0; cell_index < num_cells; ++cell_index)
+    {
+      // Cell index
+      const std::size_t index = colored_cells[cell_index];
+
+      // Create cell
+      const Cell cell(mesh, index);
+
+      // Get integral for sub domain (if any)
+      if (use_domains)
+        integral = ufc.get_cell_integral((*domains)[cell]);
+
+      // Skip integral if zero
+      if (!integral)
+        continue;
+
+      // Update to current cell
+      cell.get_cell_data(ufc_cell);
+      cell.get_vertex_coordinates(vertex_coordinates);
+      ufc.update(cell, vertex_coordinates, ufc_cell,
+                 integral->enabled_coefficients());
+
+      // Get local-to-global dof maps for cell
+      for (std::size_t i = 0; i < form_rank; ++i)
+        dofs[i] = &(dofmaps[i]->cell_dofs(index));
+
+      // Tabulate cell tensor
+      integral->tabulate_tensor(ufc.A.data(),
+                                ufc.w(),
+                                vertex_coordinates.data(),
+                                ufc_cell.orientation);
+
+      // Add entries to global tensor
+      if (values && form_rank == 0)
+        (*values)[cell_index] = ufc.A[0];
+      else if (form_rank == 0)
+        scalars[omp_get_thread_num()] += ufc.A[0];
+      else
+        A.add(ufc.A.data(), dofs);
+    }
+    p++;
+  }
+
+  // If we assemble a scalar we need to sum the contributions from each thread
+  if (form_rank == 0)
+  {
+    const double scalar_sum = std::accumulate(scalars.begin(), scalars.end(),
+                                              0.0);
+    A.add(&scalar_sum, dofs);
+  }
+}
+//-----------------------------------------------------------------------------
+void OpenMpAssembler::assemble_cells_and_exterior_facets(GenericTensor& A,
+          const Form& a, UFC& _ufc,
+          const MeshFunction<std::size_t>* cell_domains,
+          const MeshFunction<std::size_t>* exterior_facet_domains,
+          std::vector<double>* values)
+{
+  Timer timer("Assemble cells and exterior facets");
+
+  // Set number of OpenMP threads (from parameter systems)
+  const int num_threads = parameters["num_threads"];
+  omp_set_num_threads(num_threads);
+
+  // Extract mesh
+  const Mesh& mesh = a.mesh();
+
+  // Compute facets and facet - cell connectivity if not already computed
+  const std::size_t D = mesh.topology().dim();
+  mesh.init(D - 1);
+  mesh.init(D - 1, D);
+  dolfin_assert(mesh.ordered());
+
+  // Get connectivity
+  const MeshConnectivity& connectivity = mesh.topology()(D, D - 1);
+  dolfin_assert(!connectivity.empty());
+
+  // Dummy UFC object since each thread needs to created its own UFC object
+  UFC ufc(_ufc);
+
+  // Form rank
+  const std::size_t form_rank = ufc.form.rank();
+
+  // Cell and facet integrals
+  ufc::cell_integral* cell_integral = ufc.default_cell_integral.get();
+  ufc::exterior_facet_integral* facet_integral
+    = ufc.default_exterior_facet_integral.get();
+
+  // Check whether integrals are domain-dependent
+  bool use_cell_domains = cell_domains && !cell_domains->empty();
+  bool use_exterior_facet_domains
+    = exterior_facet_domains && !exterior_facet_domains->empty();
+
+  // Collect pointers to dof maps
+  std::vector<const GenericDofMap*> dofmaps;
+  for (std::size_t i = 0; i < form_rank; ++i)
+    dofmaps.push_back(a.function_space(i)->dofmap().get());
+
+  // Vector to hold dof maps for a cell
+  std::vector<const std::vector<dolfin::la_index>* > dofs(form_rank);
+
+  // FIXME: Pass or determine coloring type
+  // Define graph type
+  std::vector<std::size_t> coloring_type = a.coloring(mesh.topology().dim());
+  mesh.color(coloring_type);
+
+  // Get coloring data
+  std::map<const std::vector<std::size_t>,
+           std::pair<std::vector<std::size_t>,
+                     std::vector<std::vector<std::size_t> > > >::const_iterator
+    mesh_coloring;
+  mesh_coloring = mesh.topology().coloring.find(coloring_type);
+  if (mesh_coloring == mesh.topology().coloring.end())
+  {
+    dolfin_error("OpenMPAssembler.cpp",
+                 "perform multithreaded assembly using OpenMP assembler",
+                 "Requested mesh coloring has not been computed");
+  }
+
+  // Get coloring data
+  const std::vector<std::vector<std::size_t> >& entities_of_color
+  = mesh_coloring->second.second;
+
+  // If assembling a scalar we need to ensure each threads assemble
+  // its own scalar
+  std::vector<double> scalars(num_threads, 0.0);
+
+  // UFC cell and vertex coordinates
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+
+  // Assemble over cells (loop over colors, then cells of same color)
+  const std::size_t num_colors = entities_of_color.size();
+  for (std::size_t color = 0; color < num_colors; ++color)
+  {
+    // Get the array of cell indices of current color
+    const std::vector<std::size_t>& colored_cells = entities_of_color[color];
+
+    // Number of cells of current color
+    const int num_cell_in_color = colored_cells.size();
+
+    // OpenMP test loop over cells of the same color
+    Progress p(AssemblerBase::progress_message(A.rank(), "cells"), num_colors);
+#pragma omp parallel for schedule(guided, 20) firstprivate(ufc, ufc_cell, vertex_coordinates, dofs, cell_integral, facet_integral)
+    for (int index = 0; index < num_cell_in_color; ++index)
+    {
+      // Cell index
+      const std::size_t cell_index = colored_cells[index];
+
+      // Create cell
+      const Cell cell(mesh, cell_index);
+
+      // Get integral for sub domain (if any)
+      if (use_cell_domains)
+        cell_integral = ufc.get_cell_integral((*cell_domains)[cell_index]);
+
+      // Update to current cell
+      cell.get_cell_data(ufc_cell);
+      cell.get_vertex_coordinates(vertex_coordinates);
+      ufc.update(cell, vertex_coordinates, ufc_cell,
+                 cell_integral->enabled_coefficients());
+
+      // Get local-to-global dof maps for cell
+      for (std::size_t i = 0; i < form_rank; ++i)
+        dofs[i] = &(dofmaps[i]->cell_dofs(cell_index));
+
+      // Get number of entries in cell tensor
+      std::size_t dim = 1;
+      for (std::size_t i = 0; i < form_rank; ++i)
+        dim *= dofs[i]->size();
+
+      // Tabulate cell tensor if we have a cell_integral
+      if (cell_integral)
+      {
+        cell_integral->tabulate_tensor(ufc.A.data(),
+                                       ufc.w(),
+                                       vertex_coordinates.data(),
+                                       ufc_cell.orientation);
+      }
+      else
+        std::fill(ufc.A.begin(), ufc.A.end(), 0.0);
+
+      // Assemble over external facet
+      for (FacetIterator facet(cell); !facet.end(); ++facet)
+      {
+        // Only consider exterior facets
+        if (!facet->exterior())
+        {
+          p++;
+          continue;
+        }
+
+        // Get local facet index
+        const std::size_t local_facet = cell.index(*facet);
+
+        // Get integral for sub domain (if any)
+        if (use_exterior_facet_domains)
+        {
+          // Get global facet index
+          const std::size_t facet_index = connectivity(cell_index)[local_facet];
+          facet_integral = ufc.get_exterior_facet_integral((*exterior_facet_domains)[facet_index]);
+        }
+
+        // Skip integral if zero
+        if (!facet_integral)
+          continue;
+
+        // FIXME: Do we really need an update version with the local
+        //        facet index?
+        // Update UFC object
+        ufc_cell.local_facet = local_facet;
+        ufc.update(cell, vertex_coordinates, ufc_cell,
+                  facet_integral->enabled_coefficients());
+
+        // Tabulate tensor
+        facet_integral->tabulate_tensor(ufc.A_facet.data(),
+                                        ufc.w(),
+                                        vertex_coordinates.data(),
+                                        local_facet,
+                                        ufc_cell.orientation);
+
+        // Add facet contribution
+        for (std::size_t i = 0; i < dim; ++i)
+          ufc.A[i] += ufc.A_facet[i];
+      }
+
+      // Add entries to global tensor
+      if (values && form_rank == 0)
+        (*values)[cell_index] = ufc.A[0];
+      else if (form_rank == 0)
+        scalars[omp_get_thread_num()] += ufc.A[0];
+      else
+        A.add(&ufc.A[0], dofs);
+    }
+
+    p++;
+  }
+
+  // If we assemble a scalar we need to sum the contributions from each thread
+  if (form_rank == 0)
+  {
+    const double scalar_sum = std::accumulate(scalars.begin(),
+                                              scalars.end(), 0.0);
+    A.add(&scalar_sum, dofs);
+  }
+}
+//-----------------------------------------------------------------------------
+void OpenMpAssembler::assemble_interior_facets(GenericTensor& A, const Form& a,
+                                               UFC& _ufc,
+                                       const MeshFunction<std::size_t>* domains,
+                                       std::vector<double>* values)
+{
+  warning("OpenMpAssembler::assemble_interior_facets is untested.");
+
+  // Extract mesh
+  const Mesh& mesh = a.mesh();
+
+  // Topological dimension
+  const std::size_t D = mesh.topology().dim();
+
+  dolfin_assert(!values);
+
+  // Skip assembly if there are no interior facet integrals
+  if (!_ufc.form.has_interior_facet_integrals())
+    return;
+
+  Timer timer("Assemble interior facets");
+
+  // Set number of OpenMP threads (from parameter systems)
+  omp_set_num_threads(parameters["num_threads"]);
+
+  // Get integral for sub domain (if any)
+
+  bool use_domains = domains && !domains->empty();
+  if (use_domains)
+  {
+    dolfin_error("OpenMPAssembler.cpp",
+                 "perform multithreaded assembly using OpenMP assembler",
+                 "Subdomains are not yet handled");
+  }
+
+  // Color mesh
+  std::vector<std::size_t> coloring_type = a.coloring(D - 1);
+  mesh.color(coloring_type);
+
+  // Dummy UFC object since each thread needs to created its own UFC object
+  UFC ufc(_ufc);
+
+  // Form rank
+  const std::size_t form_rank = ufc.form.rank();
+
+  // Collect pointers to dof maps
+  std::vector<const GenericDofMap*> dofmaps;
+  for (std::size_t i = 0; i < form_rank; ++i)
+    dofmaps.push_back(a.function_space(i)->dofmap().get());
+
+  // Vector to hold dofs for cells
+  std::vector<std::vector<dolfin::la_index> > macro_dofs(form_rank);
+
+  // Interior facet integral
+  const ufc::interior_facet_integral* integral
+    = ufc.default_interior_facet_integral.get();
+
+  // Compute facets and facet - cell connectivity if not already computed
+  mesh.init(D - 1);
+  mesh.init(D - 1, D);
+  dolfin_assert(mesh.ordered());
+
+  // Get interior facet directions (if any)
+  const std::vector<std::size_t>* facet_orientation = NULL;
+  if (mesh.data().exists("facet_orientation", D - 1))
+  {
+    facet_orientation = &(mesh.data().array("facet_orientation", D - 1));
+    if (facet_orientation->size() != mesh.num_facets())
+    {
+      dolfin_error("OpenMPAssembler.cpp",
+                   "perform multithreaded assembly using OpenMP assembler",
+                   "Expecting facet orientation to be defined on facets)");
+    }
+  }
+
+  // Get coloring data
+  std::map<const std::vector<std::size_t>,
+           std::pair<std::vector<std::size_t>,
+                     std::vector<std::vector<std::size_t> > > >::const_iterator
+    mesh_coloring;
+  mesh_coloring = mesh.topology().coloring.find(coloring_type);
+
+  // Check that requested coloring has been computed
+  if (mesh_coloring == mesh.topology().coloring.end())
+  {
+    dolfin_error("OpenMPAssembler.cpp",
+                 "perform multithreaded assembly using OpenMP assembler",
+                 "Requested mesh coloring has not been computed");
+  }
+
+  // Get coloring data
+  const std::vector<std::vector<std::size_t> >& entities_of_color
+    = mesh_coloring->second.second;
+
+  // UFC cells and vertex coordinates
+  ufc::cell ufc_cell0, ufc_cell1;
+  std::vector<double> vertex_coordinates0, vertex_coordinates1;
+
+  // Assemble over interior facets (loop over colours, then cells of same color)
+  const std::size_t num_colors = entities_of_color.size();
+  for (std::size_t color = 0; color < num_colors; ++color)
+  {
+    // Get the array of facet indices of current color
+    const std::vector<std::size_t>& colored_facets = entities_of_color[color];
+
+    // Number of facets of current color
+    const int num_facets = colored_facets.size();
+
+    // OpenMP test loop over cells of the same color
+    Progress p(AssemblerBase::progress_message(A.rank(), "interior facets"),
+               mesh.num_facets());
+#pragma omp parallel for schedule(guided, 20) firstprivate(ufc, ufc_cell0, ufc_cell1, vertex_coordinates0, vertex_coordinates1, macro_dofs, integral)
+    for (int facet_index = 0; facet_index < num_facets; ++facet_index)
+    {
+      // Facet index
+      const std::size_t index = colored_facets[facet_index];
+
+      // Create cell
+      const Facet facet(mesh, index);
+
+      // Only consider interior facets
+      if (facet.exterior())
+      {
+        p++;
+        continue;
+      }
+
+      // Get integral for sub domain (if any)
+      if (use_domains)
+        integral = ufc.get_interior_facet_integral((*domains)[facet]);
+
+      // Skip integral if zero
+      if (!integral)
+        continue;
+
+      // Get cells incident with facet
+      std::pair<const Cell, const Cell> cells
+        = facet.adjacent_cells(facet_orientation);
+      const Cell& cell0 = cells.first;
+      const Cell& cell1 = cells.second;
+
+      // Get local index of facet with respect to each cell
+      const std::size_t local_facet0 = cell0.index(facet);
+      const std::size_t local_facet1 = cell1.index(facet);
+
+      // Update UFC cell
+      cell0.get_vertex_coordinates(vertex_coordinates0);
+      cell0.get_cell_data(ufc_cell0, local_facet0);
+      cell1.get_vertex_coordinates(vertex_coordinates1);
+      cell1.get_cell_data(ufc_cell1, local_facet1);
+
+      // Update to current pair of cells
+      ufc.update(cell0, vertex_coordinates0, ufc_cell0,
+                 cell1, vertex_coordinates1, ufc_cell1,
+                 integral->enabled_coefficients());
+
+      // Tabulate dofs for each dimension on macro element
+      for (std::size_t i = 0; i < form_rank; i++)
+      {
+        // Get dofs for each cell
+        const std::vector<dolfin::la_index>& cell_dofs0
+          = dofmaps[i]->cell_dofs(cell0.index());
+        const std::vector<dolfin::la_index>& cell_dofs1
+          = dofmaps[i]->cell_dofs(cell1.index());
+
+        // Create space in macro dof vector
+        macro_dofs[i].resize(cell_dofs0.size() + cell_dofs1.size());
+
+        // Copy cell dofs into macro dof vector
+        std::copy(cell_dofs0.begin(), cell_dofs0.end(), macro_dofs[i].begin());
+        std::copy(cell_dofs1.begin(), cell_dofs1.end(),
+                  macro_dofs[i].begin() + cell_dofs0.size());
+      }
+
+      // Tabulate exterior interior facet tensor on macro element
+      integral->tabulate_tensor(ufc.macro_A.data(),
+                                ufc.macro_w(),
+                                vertex_coordinates0.data(),
+                                vertex_coordinates1.data(),
+                                local_facet0,
+                                local_facet1,
+                                ufc_cell0.orientation,
+                                ufc_cell1.orientation);
+
+      // Add entries to global tensor
+      A.add(ufc.macro_A.data(), macro_dofs);
+
+      p++;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/fem/OpenMpAssembler.h b/dolfin/fem/OpenMpAssembler.h
new file mode 100644
index 0000000..cf935e1
--- /dev/null
+++ b/dolfin/fem/OpenMpAssembler.h
@@ -0,0 +1,83 @@
+// Copyright (C) 2007-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2007-2008.
+// Modified by Ola Skavhaug, 2008.
+//
+// First added:  2007-01-17
+// Last changed: 2011-09-29
+
+#ifndef __OPENMP_ASSEMBLER_H
+#define __OPENMP_ASSEMBLER_H
+
+#ifdef HAS_OPENMP
+
+#include <vector>
+#include "AssemblerBase.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericTensor;
+  class Form;
+  class UFC;
+  template<typename T> class MeshFunction;
+
+  /// This class provides automated assembly of linear systems, or
+  /// more generally, assembly of a sparse tensor from a given
+  /// variational form.
+  ///
+  /// The MeshFunction arguments can be used to specify assembly over
+  /// subdomains of the mesh cells, exterior facets or interior
+  /// facets. Either a null pointer or an empty MeshFunction may be
+  /// used to specify that the tensor should be assembled over the
+  /// entire set of cells or facets.
+
+  class OpenMpAssembler : public AssemblerBase
+  {
+  public:
+
+    /// Constructor
+    OpenMpAssembler() {}
+
+    /// Assemble tensor from given form
+    void assemble(GenericTensor& A, const Form& a);
+
+  private:
+
+    // Assemble over cells
+    void assemble_cells(GenericTensor& A, const Form& a, UFC& ufc,
+                        const MeshFunction<std::size_t>* domains,
+                        std::vector<double>* values);
+
+    // Assemble over exterior facets
+    void assemble_cells_and_exterior_facets(GenericTensor& A,
+          const Form& a, UFC& ufc, const MeshFunction<std::size_t>* cell_domains,
+				  const MeshFunction<std::size_t>* exterior_facet_domains,
+				  std::vector<double>* values);
+
+    // Assemble over interior facets
+    void assemble_interior_facets(GenericTensor& A, const Form& a, UFC& ufc,
+          const MeshFunction<std::size_t>* domains, std::vector<double>* values);
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/fem/PointSource.cpp b/dolfin/fem/PointSource.cpp
new file mode 100644
index 0000000..d9248df
--- /dev/null
+++ b/dolfin/fem/PointSource.cpp
@@ -0,0 +1,143 @@
+// Copyright (C) 2011-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-04-13
+// Last changed: 2014-03-25
+
+#include <boost/scoped_array.hpp>
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/geometry/BoundingBoxTree.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Mesh.h>
+#include "FiniteElement.h"
+#include "GenericDofMap.h"
+#include "PointSource.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+PointSource::PointSource(const FunctionSpace& V,
+                         const Point& p,
+                         double magnitude)
+  : _function_space(reference_to_no_delete_pointer(V)), _p(p), _magnitude(magnitude)
+{
+  // Check that function space is scalar
+  check_is_scalar(V);
+}
+//-----------------------------------------------------------------------------
+PointSource::PointSource(std::shared_ptr<const FunctionSpace> V,
+                         const Point& p,
+                         double magnitude)
+  : _function_space(V), _p(p), _magnitude(magnitude)
+{
+  // Check that function space is scalar
+  check_is_scalar(*V);
+}
+//-----------------------------------------------------------------------------
+PointSource::~PointSource()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void PointSource::apply(GenericVector& b)
+{
+  dolfin_assert(_function_space);
+
+  log(PROGRESS, "Applying point source to right-hand side vector.");
+
+  // Find the cell containing the point (may be more than one cell but
+  // we only care about the first). Well-defined if the basis
+  // functions are continuous but may give unexpected results for DG.
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+  std::shared_ptr<BoundingBoxTree> tree = mesh.bounding_box_tree();
+  const unsigned int cell_index = tree->compute_first_entity_collision(_p);
+
+  // Check that we found the point on at least one processor
+  int num_found = 0;
+  if (cell_index == std::numeric_limits<unsigned int>::max())
+    num_found = MPI::sum(mesh.mpi_comm(), 0);
+  else
+    num_found = MPI::sum(mesh.mpi_comm(), 1);
+  if (MPI::rank(mesh.mpi_comm()) == 0 && num_found == 0)
+  {
+    dolfin_error("PointSource.cpp",
+                 "apply point source to vector",
+                 "The point is outside of the domain (%s)", _p.str().c_str());
+  }
+
+  // Return if point not found
+  if (cell_index == std::numeric_limits<unsigned int>::max())
+  {
+    b.apply("add");
+    return;
+  }
+
+  // Create cell
+  const Cell cell(mesh, static_cast<std::size_t>(cell_index));
+
+  // Vertex coordinates
+  const std::size_t gdim = mesh.geometry().dim();
+  const std::size_t num_vertices = cell.num_entities(0);
+  std::vector<double> vertex_coordinates(gdim* num_vertices);
+  const unsigned int* vertices = cell.entities(0);
+  for (std::size_t i = 0; i < num_vertices; i++)
+    for (std::size_t j = 0; j < gdim; j++)
+      vertex_coordinates[i*gdim + j] = mesh.geometry().x(vertices[i])[j];
+
+  // Evaluate all basis functions at the point()
+  dolfin_assert(_function_space->element());
+  dolfin_assert(_function_space->element()->value_rank() == 0);
+  std::vector<double> values(_function_space->element()->space_dimension());
+
+  ufc::cell ufc_cell;
+  cell.get_cell_data(ufc_cell);
+  _function_space->element()->evaluate_basis_all(values.data(),
+                                                 _p.coordinates(),
+                                                 vertex_coordinates.data(),
+                                                 ufc_cell.orientation);
+
+  // Scale by magnitude
+  for (std::size_t i = 0; i < _function_space->element()->space_dimension(); i++)
+    values[i] *= _magnitude;
+
+  // Compute local-to-global mapping
+  dolfin_assert(_function_space->dofmap());
+  const std::vector<dolfin::la_index>& dofs
+    = _function_space->dofmap()->cell_dofs(cell.index());
+
+  // Add values to vector
+  dolfin_assert(_function_space->element()->space_dimension()
+                == _function_space->dofmap()->cell_dimension(cell.index()));
+  b.add(values.data(), _function_space->element()->space_dimension(), dofs.data());
+  b.apply("add");
+}
+//-----------------------------------------------------------------------------
+void PointSource::check_is_scalar(const FunctionSpace& V)
+{
+  dolfin_assert(V.element());
+  if (V.element()->value_rank() != 0)
+  {
+    dolfin_error("PointSource.cpp",
+                 "create point source",
+                 "Function is not scalar");
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/PointSource.h b/dolfin/fem/PointSource.h
new file mode 100644
index 0000000..8db788f
--- /dev/null
+++ b/dolfin/fem/PointSource.h
@@ -0,0 +1,73 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-04-13
+// Last changed: 2013-06-23
+
+#include <memory>
+#include <dolfin/geometry/Point.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class FunctionSpace;
+  class GenericVector;
+
+  /// This class provides an easy mechanism for adding a point source
+  /// (Dirac delta function) to the right-hand side vector in a
+  /// variational problem. The associated function space must be
+  /// scalar in order for the inner product with the (scalar) Dirac
+  /// delta function to be well defined.
+
+  class PointSource
+  {
+  public:
+
+    /// Create point source at given point of given magnitude
+    PointSource(const FunctionSpace& V,
+                const Point& p,
+                double magnitude=1.0);
+
+    /// Create point source at given point of given magnitude
+    PointSource(std::shared_ptr<const FunctionSpace> V,
+                const Point& p,
+                double magnitude=1.0);
+
+    /// Destructor
+    ~PointSource();
+
+    /// Apply (add) point source to right-hand side vector
+    void apply(GenericVector& b);
+
+  private:
+
+    // Check that function space is scalar
+    void check_is_scalar(const FunctionSpace& V);
+
+    // The function space
+    std::shared_ptr<const FunctionSpace> _function_space;
+
+    // The point
+    Point _p;
+
+    // Magnitude
+    double _magnitude;
+
+  };
+
+}
diff --git a/dolfin/fem/SparsityPatternBuilder.cpp b/dolfin/fem/SparsityPatternBuilder.cpp
new file mode 100644
index 0000000..b19e5c4
--- /dev/null
+++ b/dolfin/fem/SparsityPatternBuilder.cpp
@@ -0,0 +1,226 @@
+// Copyright (C) 2007-2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2007
+// Modified by Anders Logg 2008-2013
+//
+// First added:  2007-05-24
+// Last changed: 2013-09-24
+
+#include <dolfin/common/timing.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/la/GenericSparsityPattern.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/CCFEMFunctionSpace.h>
+#include "CCFEMForm.h"
+#include "CCFEMDofMap.h"
+#include "SparsityPatternBuilder.h"
+
+#include <dolfin/log/dolfin_log.h>
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void SparsityPatternBuilder::build(GenericSparsityPattern& sparsity_pattern,
+                                   const Mesh& mesh,
+                                   const std::vector<const GenericDofMap*> dofmaps,
+                                   bool cells,
+                                   bool interior_facets,
+                                   bool exterior_facets,
+                                   bool diagonal,
+                                   bool init,
+                                   bool finalize)
+{
+  const std::size_t rank = dofmaps.size();
+
+  // Get global dimensions and local range
+  std::vector<std::size_t> global_dimensions(rank);
+  std::vector<std::pair<std::size_t, std::size_t> > local_range(rank);
+  std::vector<const boost::unordered_map<std::size_t, unsigned int>* > off_process_owner(rank);
+  for (std::size_t i = 0; i < rank; ++i)
+  {
+    global_dimensions[i] = dofmaps[i]->global_dimension();
+    local_range[i]       = dofmaps[i]->ownership_range();
+    off_process_owner[i] = &(dofmaps[i]->off_process_owner());
+  }
+
+  // Initialise sparsity pattern
+  if (init)
+  {
+    sparsity_pattern.init(mesh.mpi_comm(), global_dimensions, local_range,
+                          off_process_owner);
+  }
+
+  // Only build for rank >= 2 (matrices and higher order tensors) that
+  // require sparsity details
+  if (rank < 2)
+    return;
+
+  // Vector to store macro-dofs, if required (for interior facets)
+  std::vector<std::vector<dolfin::la_index> > macro_dofs(rank);
+
+  // Create vector to point to dofs
+  std::vector<const std::vector<dolfin::la_index>* > dofs(rank);
+
+  // FIXME: We iterate over the entire mesh even if the function space
+  // is restricted. This works out fine since the local dofmap
+  // returned on each cell will be an empty vector, but we might think
+  // about optimizing this further.
+
+  // Build sparsity pattern for cell integrals
+  if (cells)
+  {
+    Progress p("Building sparsity pattern over cells", mesh.num_cells());
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      // Tabulate dofs for each dimension and get local dimensions
+      for (std::size_t i = 0; i < rank; ++i)
+        dofs[i] = &dofmaps[i]->cell_dofs(cell->index());
+
+      // Insert non-zeroes in sparsity pattern
+      sparsity_pattern.insert(dofs);
+      p++;
+    }
+  }
+
+  // Note: no need to iterate over exterior facets since those dofs
+  //       are included when tabulating dofs on all cells
+
+  // Build sparsity pattern for interior/exterior facet integrals
+  const std::size_t D = mesh.topology().dim();
+  if (interior_facets || exterior_facets)
+  {
+    // Compute facets and facet - cell connectivity if not already computed
+    mesh.init(D - 1);
+    mesh.init(D - 1, D);
+    if (!mesh.ordered())
+    {
+      dolfin_error("SparsityPatternBuilder.cpp",
+                   "compute sparsity pattern",
+                   "Mesh is not ordered according to the UFC numbering convention. "
+                   "Consider calling mesh.order()");
+    }
+
+    Progress p("Building sparsity pattern over interior facets", mesh.num_facets());
+    for (FacetIterator facet(mesh); !facet.end(); ++facet)
+    {
+      bool exterior_facet = false;
+      if (facet->num_global_entities(D) == 1)
+        exterior_facet = true;
+
+      // Check facet type
+      if (exterior_facets && exterior_facet && !cells)
+      {
+        // Get cells incident with facet
+        dolfin_assert(facet->num_entities(D) == 1);
+        Cell cell(mesh, facet->entities(D)[0]);
+
+        // Tabulate dofs for each dimension and get local dimensions
+        for (std::size_t i = 0; i < rank; ++i)
+          dofs[i] = &dofmaps[i]->cell_dofs(cell.index());
+
+        // Insert dofs
+        sparsity_pattern.insert(dofs);
+      }
+      else if (interior_facets && !exterior_facet)
+      {
+        // Get cells incident with facet
+        Cell cell0(mesh, facet->entities(D)[0]);
+        Cell cell1(mesh, facet->entities(D)[1]);
+
+        // Tabulate dofs for each dimension on macro element
+        for (std::size_t i = 0; i < rank; i++)
+        {
+          // Get dofs for each cell
+          const std::vector<dolfin::la_index>& cell_dofs0 = dofmaps[i]->cell_dofs(cell0.index());
+          const std::vector<dolfin::la_index>& cell_dofs1 = dofmaps[i]->cell_dofs(cell1.index());
+
+          // Create space in macro dof vector
+          macro_dofs[i].resize(cell_dofs0.size() + cell_dofs1.size());
+
+          // Copy cell dofs into macro dof vector
+          std::copy(cell_dofs0.begin(), cell_dofs0.end(), macro_dofs[i].begin());
+          std::copy(cell_dofs1.begin(), cell_dofs1.end(), macro_dofs[i].begin() + cell_dofs0.size());
+
+          // Store pointer to macro dofs
+          dofs[i] = &macro_dofs[i];
+        }
+
+        // Insert dofs
+        sparsity_pattern.insert(dofs);
+      }
+
+      p++;
+    }
+  }
+
+  if (diagonal)
+  {
+    Progress p("Building sparsity pattern over diagonal", local_range[0].second-local_range[0].first);
+
+    std::vector<dolfin::la_index> diagonal_dof(1, 0);
+    for (std::size_t i = 0; i < rank; ++i)
+      dofs[i] = &diagonal_dof;
+
+    for (std::size_t j = local_range[0].first; j < local_range[0].second; j++)
+    {
+      diagonal_dof[0] = j;
+
+      // Insert diagonal non-zeroes in sparsity pattern
+      sparsity_pattern.insert(dofs);
+      p++;
+    }
+  }
+
+  // Finalize sparsity pattern (communicate off-process terms)
+  if (finalize)
+    sparsity_pattern.apply();
+}
+//-----------------------------------------------------------------------------
+void SparsityPatternBuilder::build_ccfem(GenericSparsityPattern& sparsity_pattern,
+                                         const CCFEMForm& form)
+{
+  // Build list of dofmaps
+  std::vector<const GenericDofMap*> dofmaps;
+  for (std::size_t i = 0; i < form.rank(); i++)
+    dofmaps.push_back(&*form.function_space(i)->dofmap());
+
+  // Iterate over each part
+  for (std::size_t part = 0; part < form.num_parts(); part++)
+  {
+    // Set current part for each dofmap. Note that these will be the
+    // same dofmaps as in the list created above but accessed here as
+    // CCFEMDofMaps and not GenericDofMaps.
+    for (std::size_t i = 0; i < form.rank(); i++)
+      form.function_space(i)->dofmap()->set_current_part(part);
+
+    // Get mesh on current part (assume it's the same for all arguments)
+    const Mesh& mesh = *form.function_space(0)->part(part)->mesh();
+
+    // Check whether to initialize or finalize sparsity pattern
+    const bool init = part == 0;
+    const bool finalize = part == form.num_parts() - 1;
+
+    // Build sparsity pattern for part
+    build(sparsity_pattern, mesh, dofmaps, true, false, false, true,
+          init, finalize);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/SparsityPatternBuilder.h b/dolfin/fem/SparsityPatternBuilder.h
new file mode 100644
index 0000000..5f03023
--- /dev/null
+++ b/dolfin/fem/SparsityPatternBuilder.h
@@ -0,0 +1,64 @@
+// Copyright (C) 2007 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2007.
+// Modified by Anders Logg 2008-2013
+//
+// First added:  2007-05-24
+// Last changed: 2013-09-24
+
+#ifndef __SPARSITY_PATTERN_BUILDER_H
+#define __SPARSITY_PATTERN_BUILDER_H
+
+#include <utility>
+#include <vector>
+#include "dolfin/common/types.h"
+
+namespace dolfin
+{
+
+  class GenericDofMap;
+  class GenericSparsityPattern;
+  class Mesh;
+  class CCFEMForm;
+
+  /// This class provides functions to compute the sparsity pattern.
+
+  class SparsityPatternBuilder
+  {
+  public:
+
+    /// Build sparsity pattern for assembly of given form
+    static void build(GenericSparsityPattern& sparsity_pattern,
+                      const Mesh& mesh,
+                      const std::vector<const GenericDofMap*> dofmaps,
+                      bool cells,
+                      bool interior_facets,
+                      bool exterior_facets,
+                      bool diagonal,
+                      bool init=true,
+                      bool finalize=true);
+
+    /// Build sparsity pattern for assembly of given CCFEM form
+    static void build_ccfem(GenericSparsityPattern& sparsity_pattern,
+                            const CCFEMForm& form);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/SystemAssembler.cpp b/dolfin/fem/SystemAssembler.cpp
new file mode 100644
index 0000000..a83c2a5
--- /dev/null
+++ b/dolfin/fem/SystemAssembler.cpp
@@ -0,0 +1,1001 @@
+// Copyright (C) 2008-2013 Kent-Andre Mardal and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2013
+// Modified by Joachim B Haga 2012
+// Modified by Jan Blechta 2013
+// Modified by Martin Alnaes 2013
+//
+// First added:  2009-06-22
+// Last changed: 2013-08-01
+
+#include <Eigen/Dense>
+#include <boost/array.hpp>
+#include <dolfin/common/Timer.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericMatrix.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/SubDomain.h>
+#include "AssemblerBase.h"
+#include "DirichletBC.h"
+#include "FiniteElement.h"
+#include "Form.h"
+#include "GenericDofMap.h"
+#include "UFC.h"
+#include "SystemAssembler.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+SystemAssembler::SystemAssembler(const Form& a, const Form& L)
+  : _a(reference_to_no_delete_pointer(a)),
+    _l(reference_to_no_delete_pointer(L))
+{
+  // Check arity of forms
+  check_arity(_a, _l);
+}
+//-----------------------------------------------------------------------------
+SystemAssembler::SystemAssembler(const Form& a, const Form& L,
+                                 const DirichletBC& bc)
+  : _a(reference_to_no_delete_pointer(a)),
+    _l(reference_to_no_delete_pointer(L))
+{
+  // Check arity of forms
+  check_arity(_a, _l);
+
+  // Store Dirichlet boundary condition
+  _bcs.push_back(&bc);
+}
+//-----------------------------------------------------------------------------
+SystemAssembler::SystemAssembler(const Form& a, const Form& L,
+                                 const std::vector<const DirichletBC*> bcs)
+  : _a(reference_to_no_delete_pointer(a)),
+    _l(reference_to_no_delete_pointer(L)), _bcs(bcs)
+{
+  // Check arity of forms
+  check_arity(_a, _l);
+}
+//-----------------------------------------------------------------------------
+SystemAssembler::SystemAssembler(std::shared_ptr<const Form> a,
+                                 std::shared_ptr<const Form> L)
+  : _a(a), _l(L)
+{
+  // Check arity of forms
+  check_arity(_a, _l);
+}
+//-----------------------------------------------------------------------------
+SystemAssembler::SystemAssembler(std::shared_ptr<const Form> a,
+                                 std::shared_ptr<const Form> L,
+                                 const DirichletBC& bc)
+  : _a(a), _l(L)
+{
+  // Check arity of forms
+  check_arity(_a, _l);
+
+  // Store Dirichlet boundary condition
+  _bcs.push_back(&bc);
+}
+//-----------------------------------------------------------------------------
+SystemAssembler::SystemAssembler(std::shared_ptr<const Form> a,
+                                 std::shared_ptr<const Form> L,
+                                 const std::vector<const DirichletBC*> bcs)
+  : _a(a), _l(L), _bcs(bcs)
+{
+  // Check arity of forms
+  check_arity(_a, _l);
+}
+//-----------------------------------------------------------------------------
+void SystemAssembler::assemble(GenericMatrix& A, GenericVector& b)
+{
+  assemble(&A, &b, NULL);
+}
+//-----------------------------------------------------------------------------
+void SystemAssembler::assemble(GenericMatrix& A)
+{
+  assemble(&A, NULL, NULL);
+}
+//-----------------------------------------------------------------------------
+void SystemAssembler::assemble(GenericVector& b)
+{
+  assemble(NULL, &b, NULL);
+}
+//-----------------------------------------------------------------------------
+void SystemAssembler::assemble(GenericMatrix& A, GenericVector& b,
+                               const GenericVector& x0)
+{
+  assemble(&A, &b, &x0);
+}
+//-----------------------------------------------------------------------------
+void SystemAssembler::assemble(GenericVector& b, const GenericVector& x0)
+{
+  assemble(NULL, &b, &x0);
+}
+//-----------------------------------------------------------------------------
+void SystemAssembler::check_arity(std::shared_ptr<const Form> a,
+                                  std::shared_ptr<const Form> L)
+{
+  // Check that a is a bilinear form
+  if (a)
+  {
+    if (a->rank() != 2)
+    {
+      dolfin_error("SystemAssembler.cpp",
+                   "assemble system",
+                   "expected a bilinear form for a");
+    }
+  }
+
+  // Check that a is a bilinear form
+  if (L)
+  {
+    if (L->rank() != 1)
+    {
+      dolfin_error("SystemAssembler.cpp",
+                   "assemble system",
+                   "expected a linear form for L");
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+const MeshFunction<std::size_t> * _pick_one_meshfunction(std::string name,
+                                                         const MeshFunction<std::size_t> * a,
+                                                         const MeshFunction<std::size_t> * b)
+{
+  if (a && b)
+  {
+      warning("Bilinear and linear forms do not have same %s subdomains \
+in SystemAssembler. Taking %s subdomains from bilinear form", name.c_str(), name.c_str());
+      return a;
+  }
+  return a ? a: b;
+}
+//-----------------------------------------------------------------------------
+void SystemAssembler::assemble(GenericMatrix* A, GenericVector* b,
+                               const GenericVector* x0)
+{
+  dolfin_assert(_a);
+  dolfin_assert(_l);
+
+  // Set timer
+  Timer timer("Assemble system");
+
+  // Get mesh
+  const Mesh& mesh = _a->mesh();
+  dolfin_assert(mesh.ordered());
+
+  // Get cell domains
+  const MeshFunction<std::size_t>* cell_domains
+    = _pick_one_meshfunction("cell_domains", _a->cell_domains().get(), _l->cell_domains().get());
+
+  // Get exterior facet domains
+  const MeshFunction<std::size_t>* exterior_facet_domains
+    = _pick_one_meshfunction("exterior_facet_domains", _a->exterior_facet_domains().get(), _l->exterior_facet_domains().get());
+
+  // Get interior facet domains
+  const MeshFunction<std::size_t>* interior_facet_domains
+    = _pick_one_meshfunction("interior_facet_domains", _a->interior_facet_domains().get(), _l->interior_facet_domains().get());
+
+  // Check forms
+  AssemblerBase::check(*_a);
+  AssemblerBase::check(*_l);
+
+  // Check that we have a bilinear and a linear form
+  dolfin_assert(_a->rank() == 2);
+  dolfin_assert(_l->rank() == 1);
+
+  // Check that forms share a function space
+  if (*_a->function_space(1) != *_l->function_space(0))
+  {
+    dolfin_error("SystemAssembler.cpp",
+                 "assemble system",
+                 "expected forms (a, L) to share a FunctionSpace");
+  }
+
+  // Create data structures for local assembly data
+  UFC A_ufc(*_a), b_ufc(*_l);
+
+  // Gather UFC  objects
+  boost::array<UFC*, 2> ufc = { { &A_ufc, &b_ufc} } ;
+
+  // Initialize global tensors
+  if (A)
+    init_global_tensor(*A, *_a);
+  if (b)
+    init_global_tensor(*b, *_l);
+
+  // Gather tensors
+  boost::array<GenericTensor*, 2> tensors = { {A, b} };
+
+  // Allocate data
+  Scratch data(*_a, *_l);
+
+  // Get Dirichlet dofs and values for local mesh
+  DirichletBC::Map boundary_values;
+  for (std::size_t i = 0; i < _bcs.size(); ++i)
+  {
+    _bcs[i]->get_boundary_values(boundary_values);
+    if (MPI::size(mesh.mpi_comm()) > 1 && _bcs[i]->method()
+        != "pointwise")
+    {
+      _bcs[i]->gather(boundary_values);
+    }
+  }
+
+  // Modify boundary values for incremental (typically nonlinear)
+  // problems
+  if (x0)
+  {
+    if (MPI::size(mesh.mpi_comm()) > 1)
+    {
+      warning("Parallel symmetric assembly over interior facets for nonlinear \
+problems is untested");
+    }
+    dolfin_assert(x0->size()==_a->function_space(1)->dofmap()->global_dimension());
+
+    const std::size_t num_bc_dofs = boundary_values.size();
+    std::vector<dolfin::la_index> bc_indices;
+    std::vector<double> bc_values;
+    bc_indices.reserve(num_bc_dofs);
+    bc_values.reserve(num_bc_dofs);
+
+    // Build list of boundary dofs and values
+    DirichletBC::Map::const_iterator bv;
+    for (bv = boundary_values.begin(); bv != boundary_values.end(); ++bv)
+    {
+      bc_indices.push_back(bv->first);
+      bc_values.push_back(bv->second);
+    }
+
+    // Modify bc values
+    std::vector<double> x0_values(num_bc_dofs);
+    x0->get_local(x0_values.data(), num_bc_dofs, bc_indices.data());
+    for (std::size_t i = 0; i < num_bc_dofs; i++)
+      boundary_values[bc_indices[i]] = x0_values[i] - bc_values[i];
+  }
+
+  // Check whether we should do cell-wise or facet-wise assembly
+  if (!ufc[0]->form.has_interior_facet_integrals()
+      && !ufc[1]->form.has_interior_facet_integrals())
+  {
+    // Assemble cell-wise (no interior facet integrals)
+    cell_wise_assembly(tensors, ufc, data, boundary_values,
+                       cell_domains, exterior_facet_domains);
+  }
+  else
+  {
+    // Facet-wise assembly is not working in parallel
+    not_working_in_parallel("System assembly over interior facets");
+
+    // Assemble facet-wise (including cell assembly)
+    facet_wise_assembly(tensors, ufc, data, boundary_values,
+                        cell_domains, exterior_facet_domains,
+                        interior_facet_domains);
+  }
+
+  // Finalise assembly
+  if (finalize_tensor)
+  {
+    if (A)
+      A->apply("add");
+    if (b)
+      b->apply("add");
+  }
+}
+//-----------------------------------------------------------------------------
+void
+SystemAssembler::cell_wise_assembly(boost::array<GenericTensor*, 2>& tensors,
+                                    boost::array<UFC*, 2>& ufc,
+                                    Scratch& data,
+                                    const DirichletBC::Map& boundary_values,
+                                    const MeshFunction<std::size_t>* cell_domains,
+                                    const MeshFunction<std::size_t>* exterior_facet_domains)
+{
+  // Extract mesh
+  const Mesh& mesh = ufc[0]->dolfin_form.mesh();
+
+  // Initialize entities if using external facet integrals
+  dolfin_assert(mesh.ordered());
+  bool has_exterior_facet_integrals=ufc[0]->form.has_exterior_facet_integrals()
+      || ufc[1]->form.has_exterior_facet_integrals();
+  if (has_exterior_facet_integrals)
+  {
+    // Compute facets and facet-cell connectivity if not already computed
+    const std::size_t D = mesh.topology().dim();
+    mesh.init(D - 1);
+    mesh.init(D - 1, D);
+  }
+
+  // Collect pointers to dof maps
+  boost::array<std::vector<const GenericDofMap*>, 2> dofmaps;
+  for (std::size_t i = 0; i < 2; ++i)
+    dofmaps[0].push_back(ufc[0]->dolfin_form.function_space(i)->dofmap().get());
+  dofmaps[1].push_back(ufc[1]->dolfin_form.function_space(0)->dofmap().get());
+
+  // Vector to hold dof map for a cell
+  boost::array<std::vector<const std::vector<dolfin::la_index>* >, 2> cell_dofs
+    = { {std::vector<const std::vector<dolfin::la_index>* >(2),
+         std::vector<const std::vector<dolfin::la_index>* >(1)} };
+
+  // Create pointers to hold integral objects
+  boost::array<const ufc::cell_integral*, 2> cell_integrals
+    = { {ufc[0]->default_cell_integral.get(), ufc[1]->default_cell_integral.get()} };
+
+  boost::array<const ufc::exterior_facet_integral*, 2> exterior_facet_integrals
+    = { { ufc[0]->default_exterior_facet_integral.get(),
+          ufc[1]->default_exterior_facet_integral.get()} };
+
+  // Check whether integrals are domain-dependent
+  bool use_cell_domains = cell_domains && !cell_domains->empty();
+  bool use_exterior_facet_domains
+    = exterior_facet_domains && !exterior_facet_domains->empty();
+
+  // Iterate over all cells
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  Progress p("Assembling system (cell-wise)", mesh.num_cells());
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Get cell vertex coordinates
+    cell->get_vertex_coordinates(vertex_coordinates);
+
+    // Loop over lhs and then rhs contributions
+    for (std::size_t form = 0; form < 2; ++form)
+    {
+      // Get rank (lhs=2, rhs=1)
+      const std::size_t rank = (form == 0) ? 2 : 1;
+
+      // Zero data
+      std::fill(data.Ae[form].begin(), data.Ae[form].end(), 0.0);
+
+      // Get cell integrals for sub domain (if any)
+      if (use_cell_domains)
+      {
+        const std::size_t domain = (*cell_domains)[*cell];
+        cell_integrals[form] = ufc[form]->get_cell_integral(domain);
+      }
+
+      // Get local-to-global dof maps for cell
+      for (std::size_t dim = 0; dim < rank; ++dim)
+        cell_dofs[form][dim] = &(dofmaps[form][dim]->cell_dofs(cell->index()));
+
+      // Compute cell tensor (if required)
+      bool tensor_required;
+      if (rank == 2) // form == 0
+      {
+        dolfin_assert(cell_dofs[form][1]);
+        tensor_required = cell_matrix_required(tensors[form], cell_integrals[form],
+                                               boundary_values,
+                                               *cell_dofs[form][1]);
+      }
+      else
+      {
+        tensor_required = tensors[form] && cell_integrals[form];
+      }
+
+      if (tensor_required)
+      {
+        // Update to current cell
+        cell->get_cell_data(ufc_cell);
+        ufc[form]->update(*cell, vertex_coordinates, ufc_cell,
+                          cell_integrals[form]->enabled_coefficients());
+
+        // Tabulate cell tensor
+        cell_integrals[form]->tabulate_tensor(ufc[form]->A.data(),
+                                              ufc[form]->w(),
+                                              vertex_coordinates.data(),
+                                              ufc_cell.orientation);
+        for (std::size_t i = 0; i < data.Ae[form].size(); ++i)
+          data.Ae[form][i] += ufc[form]->A[i];
+      }
+
+      // Compute exterior facet integral if present
+      if (has_exterior_facet_integrals)
+      {
+        for (FacetIterator facet(*cell); !facet.end(); ++facet)
+        {
+          // Only consider exterior facets
+          if (!facet->exterior())
+            continue;
+
+          // Get exterior facet integrals for sub domain (if any)
+          if (use_exterior_facet_domains)
+          {
+            const std::size_t domain = (*exterior_facet_domains)[*facet];
+            exterior_facet_integrals[form]
+              = ufc[form]->get_exterior_facet_integral(domain);
+          }
+
+          // Skip if there are no integrals
+          if (!exterior_facet_integrals[form])
+            continue;
+
+          // Extract local facet index
+          const std::size_t local_facet = cell->index(*facet);
+
+          // Determine if tensor needs to be computed
+          bool tensor_required;
+          if (rank == 2) // form == 0
+          {
+            dolfin_assert(cell_dofs[form][1]);
+            tensor_required = cell_matrix_required(tensors[form],
+                                                   exterior_facet_integrals[form],
+                                                   boundary_values,
+                                                   *cell_dofs[form][1]);
+          }
+          else
+          {
+            tensor_required = tensors[form];
+          }
+
+          // Add exterior facet tensor
+          if (tensor_required)
+          {
+            // Update to current cell
+            cell->get_cell_data(ufc_cell);
+            ufc[form]->update(*cell, vertex_coordinates, ufc_cell,
+                             exterior_facet_integrals[form]->enabled_coefficients());
+
+            // Tabulate exterior facet tensor
+            exterior_facet_integrals[form]->tabulate_tensor(ufc[form]->A.data(),
+                                                            ufc[form]->w(),
+                                                            vertex_coordinates.data(),
+                                                            local_facet,
+                                                            ufc_cell.orientation);
+            for (std::size_t i = 0; i < data.Ae[form].size(); i++)
+              data.Ae[form][i] += ufc[form]->A[i];
+          }
+        }
+      }
+    }
+
+    // Check dofmap is the same for LHS columns and RHS vector
+    dolfin_assert(cell_dofs[1][0] == cell_dofs[0][1]);
+
+    // Modify local matrix/element for Dirichlet boundary conditions
+    apply_bc(data.Ae[0].data(), data.Ae[1].data(), boundary_values,
+             *cell_dofs[0][0], *cell_dofs[0][1]);
+
+    // Add entries to global tensor
+    for (std::size_t form = 0; form < 2; ++form)
+    {
+      if (tensors[form])
+        tensors[form]->add(data.Ae[form].data(), cell_dofs[form]);
+    }
+
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
+void
+SystemAssembler::facet_wise_assembly(boost::array<GenericTensor*, 2>& tensors,
+                                     boost::array<UFC*, 2>& ufc,
+                                     Scratch& data,
+                                     const DirichletBC::Map& boundary_values,
+                      const MeshFunction<std::size_t>* cell_domains,
+                      const MeshFunction<std::size_t>* exterior_facet_domains,
+                      const MeshFunction<std::size_t>* interior_facet_domains)
+{
+  // Extract mesh
+  const Mesh& mesh = ufc[0]->dolfin_form.mesh();
+
+  // Compute facets and facet - cell connectivity if not already computed
+  const std::size_t D = mesh.topology().dim();
+  mesh.init(D - 1);
+  mesh.init(D - 1, D);
+
+  // Facet orientation not supported
+  if (mesh.data().exists("facet_orientation", D - 1))
+  {
+    dolfin_error("SystemAssembler.cpp",
+                 "assemble system",
+                 "User-defined facet orientation is not supported by system \
+assembler");
+  }
+
+  // Collect pointers to dof maps
+  boost::array<std::vector<const GenericDofMap*>, 2> dofmaps;
+  for (std::size_t i = 0; i < 2; ++i)
+    dofmaps[0].push_back(ufc[0]->dolfin_form.function_space(i)->dofmap().get());
+  dofmaps[1].push_back(ufc[1]->dolfin_form.function_space(0)->dofmap().get());
+
+  // Cell dofmaps [form][cell][form dim]
+  boost::array<boost::array<std::vector<const std::vector<dolfin::la_index>* >,
+                            2 >, 2> cell_dofs;
+  cell_dofs[0][0].resize(2);
+  cell_dofs[0][1].resize(2);
+  cell_dofs[1][0].resize(1);
+  cell_dofs[1][1].resize(1);
+
+  boost::array<Cell, 2> cell;
+  boost::array<std::size_t, 2> cell_index;
+  boost::array<std::size_t, 2> local_facet;
+
+  // Vectors to hold dofs for macro cells
+  boost::array<std::vector<std::vector<dolfin::la_index> >, 2> macro_dofs;
+  macro_dofs[0].resize(2);
+  macro_dofs[1].resize(1);
+
+  // Holder for number of dofs in macro-dofmap
+  std::vector<std::size_t> num_dofs(2);
+
+  // Holders for UFC integrals
+  boost::array<const ufc::cell_integral*, 2> cell_integrals =
+    { { ufc[0]->default_cell_integral.get(),
+        ufc[1]->default_cell_integral.get() } };
+  boost::array<const ufc::exterior_facet_integral*, 2> exterior_facet_integrals =
+    { { ufc[0]->default_exterior_facet_integral.get(),
+        ufc[1]->default_exterior_facet_integral.get() } };
+  boost::array<const ufc::interior_facet_integral*, 2> interior_facet_integrals =
+    { { ufc[0]->default_interior_facet_integral.get(),
+        ufc[1]->default_interior_facet_integral.get() } };
+
+  // Check whether integrals are domain-dependent
+  bool use_cell_domains = cell_domains && !cell_domains->empty();
+  bool use_exterior_facet_domains = exterior_facet_domains && !exterior_facet_domains->empty();
+  bool use_interior_facet_domains = interior_facet_domains && !interior_facet_domains->empty();
+
+  // Iterate over facets
+  ufc::cell ufc_cell[2];
+  std::vector<double> vertex_coordinates[2];
+  Progress p("Assembling system (facet-wise)", mesh.num_facets());
+  for (FacetIterator facet(mesh); !facet.end(); ++facet)
+  {
+    // Number of cells sharing facet
+    const std::size_t num_cells = facet->num_entities(mesh.topology().dim());
+
+    // Interior facet
+    if (num_cells == 2)
+    {
+      // Get cells incident with facet and assoiated data
+      for (std::size_t c = 0; c < 2; ++c)
+      {
+        cell[c] = Cell(mesh, facet->entities(mesh.topology().dim())[c]);
+        cell_index[c] = cell[c].index();
+        local_facet[c] = cell[c].index(*facet);
+        cell[c].get_vertex_coordinates(vertex_coordinates[c]);
+        cell[c].get_cell_data(ufc_cell[c], local_facet[c]);
+      }
+
+      // Loop over lhs and then rhs facet contributions
+      for (std::size_t form = 0; form < 2; ++form)
+      {
+        // Get rank (lhs=2, rhs=1)
+        const std::size_t rank = (form == 0) ? 2 : 1;
+
+        // Get integral for sub domain (if any)
+        if (use_interior_facet_domains)
+        {
+          const std::size_t domain = (*interior_facet_domains)[*facet];
+          interior_facet_integrals[form]
+            = ufc[form]->get_interior_facet_integral(domain);
+        }
+
+        // Reset some temp data
+        std::fill(ufc[form]->macro_A.begin(), ufc[form]->macro_A.end(), 0.0);
+
+        // Update UFC object
+        // TODO: Remove this? It seems to be unused, update is called
+        //       before each tabulate_tensor below...
+        //ufc[form]->update(cell[0], vertex_coordinates[0], ufc_cell[0],
+        //                 cell[1], vertex_coordinates[1], ufc_cell[1],
+        //                 interior_facet_integrals[form]->enabled_coefficients());
+
+        // Compute number of dofs in macro dofmap
+        std::fill(num_dofs.begin(), num_dofs.begin() + rank, 0);
+        for (std::size_t c = 0; c < num_cells; ++c)
+        {
+          for (std::size_t dim = 0; dim < rank; ++dim)
+          {
+            cell_dofs[form][c][dim]
+              = &(dofmaps[form][dim]->cell_dofs(cell_index[c]));
+            num_dofs[dim] += cell_dofs[form][c][dim]->size();
+          }
+        }
+
+        // Resize macro dof vector
+        for (std::size_t dim = 0; dim < rank; ++dim)
+          macro_dofs[form][dim].resize(num_dofs[dim]);
+
+        // Check if facet tensor is required
+        bool facet_tensor_required;
+        if (rank == 2) // form == 0
+        {
+          for (std::size_t c =0; c < 2; ++c)
+          {
+            dolfin_assert(cell_dofs[form][c][1]);
+            facet_tensor_required = cell_matrix_required(tensors[form],
+                                                        interior_facet_integrals[form],
+                                                        boundary_values,
+                                                        *cell_dofs[form][c][1]);
+            if (facet_tensor_required)
+              break;
+          }
+        }
+        else
+        {
+          facet_tensor_required = tensors[form] && interior_facet_integrals[form];
+        }
+
+        // Compute facet contribution to tensor, if required
+        if (facet_tensor_required)
+        {
+          // Update to current pair of cells
+          ufc[form]->update(cell[0], vertex_coordinates[0], ufc_cell[0],
+                            cell[1], vertex_coordinates[1], ufc_cell[1],
+                            interior_facet_integrals[form]->enabled_coefficients());
+          // Integrate over facet
+          interior_facet_integrals[form]->tabulate_tensor(ufc[form]->macro_A.data(),
+                                                   ufc[form]->macro_w(),
+                                                   vertex_coordinates[0].data(),
+                                                   vertex_coordinates[1].data(),
+                                                   local_facet[0],
+                                                   local_facet[1],
+                                                   ufc_cell[0].orientation,
+                                                   ufc_cell[1].orientation);
+        }
+
+        // If we have local facet 0 for cell[i], compute cell
+        // contribution
+        for (std::size_t c = 0; c < num_cells; ++c)
+        {
+          if (local_facet[c] == 0)
+          {
+            // Get cell integrals for sub domain (if any)
+            if (use_cell_domains)
+            {
+              const std::size_t domain = (*cell_domains)[cell[c]];
+              cell_integrals[form] = ufc[form]->get_cell_integral(domain);
+            }
+
+            // Check if facet tensor is required
+            bool cell_tensor_required;
+            if (rank == 2) // form == 0
+            {
+              dolfin_assert(cell_dofs[form][c][1]);
+              cell_tensor_required
+                = cell_matrix_required(tensors[form],
+                                       cell_integrals[form],
+                                       boundary_values,
+                                       *cell_dofs[form][c][1]);
+            }
+            else
+            {
+              cell_tensor_required = tensors[form] && cell_integrals[form];
+            }
+
+            // Compute cell tensor, if required
+            if (cell_tensor_required)
+            {
+              ufc[form]->update(cell[c], vertex_coordinates[c], ufc_cell[c],
+                                cell_integrals[form]->enabled_coefficients());
+              cell_integrals[form]->tabulate_tensor(ufc[form]->A.data(),
+                                                    ufc[form]->w(),
+                                                    vertex_coordinates[c].data(),
+                                                    ufc_cell[c].orientation);
+
+              // FIXME: Can the below two block be consolidated?
+              const std::size_t nn = cell_dofs[form][c][0]->size();
+              if (form == 0)
+              {
+                const std::size_t mm = cell_dofs[form][c][1]->size();
+                for (std::size_t i = 0; i < mm; i++)
+                {
+                  for (std::size_t j = 0; j < nn; j++)
+                  {
+                    ufc[form]->macro_A[2*nn*mm*c + num_cells*i*nn + nn*c + j]
+                      += ufc[form]->A[i*nn + j];
+                  }
+                }
+              }
+              else
+              {
+                for (std::size_t i = 0; i < cell_dofs[form][c][0]->size(); i++)
+                  ufc[form]->macro_A[nn*c + i] += ufc[form]->A[i];
+              }
+            }
+          }
+
+          // Tabulate dofs on macro element
+          for (std::size_t dim = 0; dim < rank; ++dim)
+          {
+            std::copy(cell_dofs[form][c][dim]->begin(), cell_dofs[form][c][dim]->end(),
+                      macro_dofs[form][dim].begin() + c*cell_dofs[form][0][dim]->size());
+          }
+        } // End loop over cells sharing facet (c)
+      } // End loop over form (form)
+
+      // Modify local tensor for bcs
+      apply_bc(ufc[0]->macro_A.data(), ufc[1]->macro_A.data(), boundary_values,
+               macro_dofs[0][0], macro_dofs[0][1]);
+
+      // Add entries to global tensor
+      for (std::size_t form = 0; form < 2; ++form)
+      {
+        bool add_macro_element = true;
+        if (form==0) // bilinear form
+          add_macro_element = ufc[0]->form.has_interior_facet_integrals();
+
+        if (tensors[form] && add_macro_element)
+        {
+          tensors[form]->add(ufc[form]->macro_A.data(), macro_dofs[form]);
+        }
+        else if (tensors[form] && !add_macro_element) // only true for the bilinear form
+        {
+          // the sparsity pattern may not support the macro element
+          // so instead extract back out the diagonal cell blocks and add them individually
+          for (std::size_t c = 0; c < num_cells; ++c)
+          {
+            if (local_facet[c] == 0)
+            {
+              // Get cell integrals for sub domain (if any)
+              if (use_cell_domains)
+              {
+                const std::size_t domain = (*cell_domains)[cell[c]];
+                cell_integrals[form] = ufc[form]->get_cell_integral(domain);
+              }
+
+              // Check if cell tensor was assembled - not necessary but saves inserting 0s
+              bool cell_tensor_required
+                = cell_matrix_required(tensors[form],
+                                       cell_integrals[form],
+                                       boundary_values,
+                                       *cell_dofs[form][c][1]);
+
+              // Add cell tensor, if required
+              if (cell_tensor_required)
+              {
+                data.zero_cell();
+                const std::size_t nn = cell_dofs[form][c][0]->size();
+                const std::size_t mm = cell_dofs[form][c][1]->size();
+                for (std::size_t i = 0; i < mm; i++)
+                {
+                  for (std::size_t j = 0; j < nn; j++)
+                  {
+                    data.Ae[form][i*nn + j]
+                       = ufc[form]->macro_A[2*nn*mm*c + num_cells*i*nn + nn*c +j];
+                  }
+                }
+                tensors[form]->add(data.Ae[form].data(), cell_dofs[form][c]);
+              }
+            }
+          } // End loop over cells sharing facet (c)
+        }
+      } // End loop over form (form)
+    }
+    else // Exterior facet
+    {
+      // Get mesh cell to which mesh facet belongs (pick first, there
+      // is only one)
+      Cell cell(mesh, facet->entities(mesh.topology().dim())[0]);
+
+      // Get local index of facet with respect to the cell
+      const std::size_t local_facet = cell.index(*facet);
+
+      // Get cell data
+      cell.get_vertex_coordinates(vertex_coordinates[0]);
+      cell.get_cell_data(ufc_cell[0], local_facet);
+
+      // Initialize macro element matrix/vector to zero
+      data.zero_cell();
+
+      // Loop over lhs and then rhs facet contributions
+      for (std::size_t form = 0; form < 2; ++form)
+      {
+        // Get rank (lhs=2, rhs=1)
+        const std::size_t rank = (form == 0) ? 2 : 1;
+
+        // Get local-to-global dof maps for cell
+        for (std::size_t dim = 0; dim < rank; ++dim)
+        {
+          cell_dofs[form][0][dim]
+            = &(dofmaps[form][dim]->cell_dofs(cell.index()));
+        }
+
+        // Reset some temp data
+        std::fill(ufc[form]->A.begin(), ufc[form]->A.end(), 0.0);
+
+        // Get exterior facet integrals for sub domain (if any)
+        if (use_exterior_facet_domains)
+        {
+          const std::size_t domain = (*exterior_facet_domains)[*facet];
+          exterior_facet_integrals[form]
+            = ufc[form]->get_exterior_facet_integral(domain);
+        }
+
+        // Check if facet tensor is required
+        bool facet_tensor_required;
+        if (rank == 2) // form == 0
+        {
+          dolfin_assert(cell_dofs[form][0][1]);
+          facet_tensor_required
+            = cell_matrix_required(tensors[form],
+                                   exterior_facet_integrals[form],
+                                   boundary_values,
+                                   *cell_dofs[form][0][1]);
+        }
+        else
+        {
+          facet_tensor_required = (tensors[form] && exterior_facet_integrals[form]);
+        }
+
+        // Compute facet integral,if required
+        if (facet_tensor_required)
+        {
+          // Update UFC object
+          ufc[form]->update(cell, vertex_coordinates[0], ufc_cell[0],
+                            exterior_facet_integrals[form]->enabled_coefficients());
+          exterior_facet_integrals[form]->tabulate_tensor(ufc[form]->A.data(),
+                                                          ufc[form]->w(),
+                                                          vertex_coordinates[0].data(),
+                                                          local_facet,
+                                                          ufc_cell[0].orientation);
+          for (std::size_t i = 0; i < data.Ae[form].size(); i++)
+            data.Ae[form][i] += ufc[form]->A[i];
+        }
+
+        // If we have local facet 0, assemble cell integral
+        if (local_facet == 0)
+        {
+          // Get cell integrals for sub domain (if any)
+          if (use_cell_domains)
+          {
+            const std::size_t domain = (*cell_domains)[cell];
+            cell_integrals[form] = ufc[form]->get_cell_integral(domain);
+          }
+
+          // Check if facet tensor is required
+          bool cell_tensor_required;
+          if (rank == 2)
+          {
+            dolfin_assert(cell_dofs[form][0][1]);
+            cell_tensor_required = cell_matrix_required(tensors[form],
+                                                        cell_integrals[form],
+                                                        boundary_values,
+                                                        *cell_dofs[form][0][1]);
+          }
+          else
+          {
+            cell_tensor_required = tensors[form] && cell_integrals[form];
+          }
+
+          // Compute cell integral, if required
+          if (cell_tensor_required)
+          {
+            ufc[form]->update(cell, vertex_coordinates[0], ufc_cell[0],
+                             cell_integrals[form]->enabled_coefficients());
+            cell_integrals[form]->tabulate_tensor(ufc[form]->A.data(),
+                                                  ufc[form]->w(),
+                                                  vertex_coordinates[0].data(),
+                                                  ufc_cell[0].orientation);
+            for (std::size_t i = 0; i < data.Ae[form].size(); i++)
+              data.Ae[form][i] += ufc[form]->A[i];
+          }
+        }
+      } // End loop over forms [form]
+
+      // Modify local matrix/element for Dirichlet boundary conditions
+      apply_bc(data.Ae[0].data(), data.Ae[1].data(), boundary_values,
+               *cell_dofs[0][0][0], *cell_dofs[0][0][1]);
+
+      // Add entries to global tensor
+      for (std::size_t form = 0; form < 2; ++form)
+      {
+        if (tensors[form])
+          tensors[form]->add(data.Ae[form].data(), cell_dofs[form][0]);
+      }
+    }
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
+inline void SystemAssembler::apply_bc(double* A, double* b,
+                                      const DirichletBC::Map& boundary_values,
+                                      const std::vector<dolfin::la_index>& global_dofs0,
+                                      const std::vector<dolfin::la_index>& global_dofs1)
+{
+  dolfin_assert(A);
+  dolfin_assert(b);
+  dolfin_assert(global_dofs0.size() == global_dofs1.size());
+
+  // Wrap matrix and vector using Eigen
+  Eigen::Map<Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic,
+                           Eigen::RowMajor> >
+    _matA(A, global_dofs0.size(), global_dofs1.size());
+  Eigen::Map<Eigen::VectorXd>
+    _b(b, global_dofs1.size());
+
+  // Loop over rows
+  //for (std::size_t i = 0; i < _matA.n_rows; ++i)
+  for (int i = 0; i < _matA.cols(); ++i)
+  {
+    const std::size_t ii = global_dofs1[i];
+    DirichletBC::Map::const_iterator bc_value = boundary_values.find(ii);
+    if (bc_value != boundary_values.end())
+    {
+      // Zero row
+      //_matA.unsafe_col(i).fill(0.0);
+      _matA.row(i).setZero();
+
+      // Modify RHS (subtract (bc_column(A))*bc_val from b)
+      //_b -= _matA.row(i)*bc_value->second;
+      _b -= _matA.col(i)*bc_value->second;
+
+      // Zero column
+      //_matA.row(i).fill(0.0);
+      _matA.col(i).setZero();
+
+      // Place 1 on diagonal and bc on RHS (i th row ).
+      _b(i)    = bc_value->second;
+      _matA(i, i) = 1.0;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+bool SystemAssembler::has_bc(const DirichletBC::Map& boundary_values,
+                             const std::vector<dolfin::la_index>& dofs)
+{
+  // Loop over dofs and check if bc is applied
+  std::vector<dolfin::la_index>::const_iterator dof;
+  for (dof = dofs.begin(); dof != dofs.end(); ++dof)
+  {
+    DirichletBC::Map::const_iterator bc_value = boundary_values.find(*dof);
+    if (bc_value != boundary_values.end())
+      return true;
+  }
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+inline bool SystemAssembler::cell_matrix_required(const GenericTensor* A,
+                                       const void* integral,
+                                       const DirichletBC::Map& boundary_values,
+                                       const std::vector<dolfin::la_index>& dofs)
+{
+  if (A && integral)
+    return true;
+  else if (integral && has_bc(boundary_values, dofs))
+    return true;
+  else
+    return false;
+}
+//-----------------------------------------------------------------------------
+SystemAssembler::Scratch::Scratch(const Form& a, const Form& L)
+{
+  std::size_t A_num_entries
+    = a.function_space(0)->dofmap()->max_cell_dimension();
+  A_num_entries *= a.function_space(1)->dofmap()->max_cell_dimension();
+  Ae[0].resize(A_num_entries);
+  Ae[1].resize(L.function_space(0)->dofmap()->max_cell_dimension());
+}
+//-----------------------------------------------------------------------------
+SystemAssembler::Scratch::~Scratch()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+inline void SystemAssembler::Scratch::zero_cell()
+{
+  std::fill(Ae[0].begin(), Ae[0].end(), 0.0);
+  std::fill(Ae[1].begin(), Ae[1].end(), 0.0);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/SystemAssembler.h b/dolfin/fem/SystemAssembler.h
new file mode 100644
index 0000000..4d062eb
--- /dev/null
+++ b/dolfin/fem/SystemAssembler.h
@@ -0,0 +1,172 @@
+// Copyright (C) 2008-2013 Kent-Andre Mardal and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2011
+//
+// First added:  2009-06-22
+// Last changed: 2013-04-23
+
+#ifndef __SYSTEM_ASSEMBLER_H
+#define __SYSTEM_ASSEMBLER_H
+
+#include <map>
+#include <vector>
+#include <boost/array.hpp>
+#include <memory>
+#include "DirichletBC.h"
+#include "AssemblerBase.h"
+
+namespace ufc
+{
+  class cell_integral;
+}
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Cell;
+  class Facet;
+  class Form;
+  class GenericMatrix;
+  class GenericVector;
+  template<typename T> class MeshFunction;
+  class UFC;
+
+  /// This class provides an assembler for systems of the form
+  /// Ax = b. It differs from the default DOLFIN assembler in that it
+  /// applies boundary conditions at the time of assembly, which
+  /// preserves any symmetries in A.
+
+  class SystemAssembler : public AssemblerBase
+  {
+  public:
+
+    /// Constructor
+    SystemAssembler(const Form& a, const Form& L);
+
+    /// Constructor
+    SystemAssembler(const Form& a, const Form& L, const DirichletBC& bc);
+
+    /// Constructor
+    SystemAssembler(const Form& a, const Form& L,
+                    const std::vector<const DirichletBC*> bcs);
+
+    /// Constructor
+    SystemAssembler(std::shared_ptr<const Form> a,
+                    std::shared_ptr<const Form> L);
+
+    /// Constructor
+    SystemAssembler(std::shared_ptr<const Form> a,
+                    std::shared_ptr<const Form> L,
+                    const DirichletBC& bc);
+
+    /// Constructor
+    SystemAssembler(std::shared_ptr<const Form> a,
+                    std::shared_ptr<const Form> L,
+                    const std::vector<const DirichletBC*> bcs);
+
+    /// Assemble system (A, b)
+    void assemble(GenericMatrix& A, GenericVector& b);
+
+    /// Assemble matrix A
+    void assemble(GenericMatrix& A);
+
+    /// Assemble vector b
+    void assemble(GenericVector& b);
+
+    /// Assemble system (A, b) for (negative) increment dx, where
+    /// x = x0 - dx is solution to system a == -L subject to bcs.
+    /// Suitable for use inside a (quasi-)Newton solver.
+    void assemble(GenericMatrix& A, GenericVector& b, const GenericVector& x0);
+
+    /// Assemble rhs vector b for (negative) increment dx, where
+    /// x = x0 - dx is solution to system a == -L subject to bcs.
+    /// Suitable for use inside a (quasi-)Newton solver.
+    void assemble(GenericVector& b, const GenericVector& x0);
+
+  private:
+
+    // Check form arity
+    static void check_arity(std::shared_ptr<const Form> a,
+                            std::shared_ptr<const Form> L);
+
+    // Assemble system
+    void assemble(GenericMatrix* A, GenericVector* b,
+                  const GenericVector* x0);
+
+    // Bilinear and linear forms
+    std::shared_ptr<const Form> _a, _l;
+
+    // Boundary conditions
+    std::vector<const DirichletBC*> _bcs;
+
+    class Scratch;
+
+    static void
+      cell_wise_assembly(boost::array<GenericTensor*, 2>& tensors,
+                         boost::array<UFC*, 2>& ufc,
+                         Scratch& data,
+                         const DirichletBC::Map& boundary_values,
+                         const MeshFunction<std::size_t>* cell_domains,
+                       const MeshFunction<std::size_t>* exterior_facet_domains);
+
+    static void
+    facet_wise_assembly(boost::array<GenericTensor*, 2>& tensors,
+                        boost::array<UFC*, 2>& ufc,
+                        Scratch& data,
+                        const DirichletBC::Map& boundary_values,
+                        const MeshFunction<std::size_t>* cell_domains,
+                        const MeshFunction<std::size_t>* exterior_facet_domains,
+                       const MeshFunction<std::size_t>* interior_facet_domains);
+
+    static void apply_bc(double* A, double* b,
+                         const DirichletBC::Map& boundary_values,
+                         const std::vector<dolfin::la_index>& global_dofs0,
+                         const std::vector<dolfin::la_index>& global_dofs1);
+
+    // Return true if cell has an Dirichlet/essential boundary
+    // condition applied
+    static bool has_bc(const DirichletBC::Map& boundary_values,
+                       const std::vector<dolfin::la_index>& dofs);
+
+    // Return true if element matrix is required
+    static bool cell_matrix_required(const GenericTensor* A,
+                                     const void* integral,
+                                     const DirichletBC::Map& boundary_values,
+                                     const std::vector<dolfin::la_index>& dofs);
+
+    // Class to hold temporary data
+    class Scratch
+    {
+    public:
+
+      Scratch(const Form& a, const Form& L);
+
+      ~Scratch();
+
+      void zero_cell();
+
+      boost::array<std::vector<double>, 2> Ae;
+
+    };
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/fem/UFC.cpp b/dolfin/fem/UFC.cpp
new file mode 100644
index 0000000..941abb6
--- /dev/null
+++ b/dolfin/fem/UFC.cpp
@@ -0,0 +1,194 @@
+// Copyright (C) 2007-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug, 2009
+// Modified by Garth N. Wells, 2010
+//
+// First added:  2007-01-17
+// Last changed: 2013-09-24
+
+#include <dolfin/common/types.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include "GenericDofMap.h"
+#include "FiniteElement.h"
+#include "Form.h"
+#include "UFC.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+UFC::UFC(const Form& a) : form(*a.ufc_form()), coefficients(a.coefficients()),
+                          dolfin_form(a)
+{
+  dolfin_assert(a.ufc_form());
+  init(a);
+}
+//-----------------------------------------------------------------------------
+UFC::UFC(const UFC& ufc) : form(ufc.form),
+                           coefficients(ufc.dolfin_form.coefficients()),
+                           dolfin_form(ufc.dolfin_form)
+{
+  this->init(ufc.dolfin_form);
+}
+//-----------------------------------------------------------------------------
+UFC::~UFC()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void UFC::init(const Form& a)
+{
+  // Get function spaces for arguments
+  std::vector<std::shared_ptr<const FunctionSpace> > V = a.function_spaces();
+
+  // Create finite elements for coefficients
+  for (std::size_t i = 0; i < form.num_coefficients(); i++)
+  {
+    std::shared_ptr<ufc::finite_element>
+      element(form.create_finite_element(form.rank() + i));
+    coefficient_elements.push_back(FiniteElement(element));
+  }
+
+  // Create cell integrals
+  default_cell_integral =
+    std::shared_ptr<ufc::cell_integral>(form.create_default_cell_integral());
+  for (std::size_t i = 0; i < form.num_cell_domains(); i++)
+    cell_integrals.push_back(std::shared_ptr<ufc::cell_integral>(form.create_cell_integral(i)));
+
+  // Create exterior facet integrals
+  default_exterior_facet_integral = std::shared_ptr<ufc::exterior_facet_integral>(form.create_default_exterior_facet_integral());
+  for (std::size_t i = 0; i < form.num_exterior_facet_domains(); i++)
+    exterior_facet_integrals.push_back(std::shared_ptr<ufc::exterior_facet_integral>(form.create_exterior_facet_integral(i)));
+
+  // Create interior facet integrals
+  default_interior_facet_integral = std::shared_ptr<ufc::interior_facet_integral>(form.create_default_interior_facet_integral());
+  for (std::size_t i = 0; i < form.num_interior_facet_domains(); i++)
+    interior_facet_integrals.push_back(std::shared_ptr<ufc::interior_facet_integral>(form.create_interior_facet_integral(i)));
+
+  // Create point integrals
+  default_point_integral = std::shared_ptr<ufc::point_integral>(this->form.create_default_point_integral());
+  for (std::size_t i = 0; i < this->form.num_point_domains(); i++)
+    point_integrals.push_back(std::shared_ptr<ufc::point_integral>(this->form.create_point_integral(i)));
+
+  // Get maximum local dimensions
+  std::vector<std::size_t> max_local_dimension;
+  std::vector<std::size_t> max_macro_local_dimension;
+  for (std::size_t i = 0; i < form.rank(); i++)
+  {
+    dolfin_assert(V[i]->dofmap());
+    max_local_dimension.push_back(V[i]->dofmap()->max_cell_dimension());
+    max_macro_local_dimension.push_back(2*V[i]->dofmap()->max_cell_dimension());
+  }
+
+  // Initialize local tensor
+  std::size_t num_entries = 1;
+  for (std::size_t i = 0; i < form.rank(); i++)
+    num_entries *= max_local_dimension[i];
+  A.resize(num_entries);
+  A_facet.resize(num_entries);
+
+  // Initialize local tensor for macro element
+  num_entries = 1;
+  for (std::size_t i = 0; i < form.rank(); i++)
+    num_entries *= max_macro_local_dimension[i];
+  macro_A.resize(num_entries);
+
+  // Initialize coefficients
+  _w.resize(form.num_coefficients());
+  w_pointer.resize(form.num_coefficients());
+  for (std::size_t i = 0; i < form.num_coefficients(); i++)
+  {
+    _w[i].resize(coefficient_elements[i].space_dimension());
+    w_pointer[i] = &_w[i][0];
+  }
+
+  // Initialize coefficients on macro element
+  _macro_w.resize(form.num_coefficients());
+  macro_w_pointer.resize(form.num_coefficients());
+  for (std::size_t i = 0; i < form.num_coefficients(); i++)
+  {
+    const std::size_t n = 2*coefficient_elements[i].space_dimension();
+    _macro_w[i].resize(n);
+    macro_w_pointer[i] = &_macro_w[i][0];
+  }
+}
+//-----------------------------------------------------------------------------
+void UFC::update(const Cell& c, const std::vector<double>& vertex_coordinates,
+                 const ufc::cell& ufc_cell,
+                 const std::vector<bool> & enabled_coefficients)
+{
+  // Restrict coefficients to facet
+  for (std::size_t i = 0; i < coefficients.size(); ++i)
+  {
+    if (!enabled_coefficients[i])
+      continue;
+    dolfin_assert(coefficients[i]);
+    coefficients[i]->restrict(&_w[i][0], coefficient_elements[i], c,
+                              vertex_coordinates.data(), ufc_cell);
+  }
+}
+//-----------------------------------------------------------------------------
+void UFC::update(const Cell& c0, const std::vector<double>& vertex_coordinates0,
+                 const ufc::cell& ufc_cell0,
+                 const Cell& c1, const std::vector<double>& vertex_coordinates1,
+                 const ufc::cell& ufc_cell1,
+                 const std::vector<bool> & enabled_coefficients)
+{
+  // Restrict coefficients to facet
+  for (std::size_t i = 0; i < coefficients.size(); ++i)
+  {
+    if (!enabled_coefficients[i])
+      continue;
+    dolfin_assert(coefficients[i]);
+    const std::size_t offset = coefficient_elements[i].space_dimension();
+    coefficients[i]->restrict(&_macro_w[i][0], coefficient_elements[i],
+                              c0, vertex_coordinates0.data(), ufc_cell0);
+    coefficients[i]->restrict(&_macro_w[i][0] + offset, coefficient_elements[i],
+                              c1, vertex_coordinates1.data(), ufc_cell1);
+  }
+}
+//-----------------------------------------------------------------------------
+void UFC::update(const Cell& c, const std::vector<double>& vertex_coordinates,
+                 const ufc::cell& ufc_cell)
+{
+  // Restrict coefficients to facet
+  for (std::size_t i = 0; i < coefficients.size(); ++i)
+  {
+    dolfin_assert(coefficients[i]);
+    coefficients[i]->restrict(&_w[i][0], coefficient_elements[i], c,
+                              vertex_coordinates.data(), ufc_cell);
+  }
+}
+//-----------------------------------------------------------------------------
+void UFC::update(const Cell& c0, const std::vector<double>& vertex_coordinates0,
+                 const ufc::cell& ufc_cell0,
+                 const Cell& c1, const std::vector<double>& vertex_coordinates1,
+                 const ufc::cell& ufc_cell1)
+{
+  // Restrict coefficients to facet
+  for (std::size_t i = 0; i < coefficients.size(); ++i)
+  {
+    dolfin_assert(coefficients[i]);
+    const std::size_t offset = coefficient_elements[i].space_dimension();
+    coefficients[i]->restrict(&_macro_w[i][0], coefficient_elements[i],
+                              c0, vertex_coordinates0.data(), ufc_cell0);
+    coefficients[i]->restrict(&_macro_w[i][0] + offset, coefficient_elements[i],
+                              c1, vertex_coordinates1.data(), ufc_cell1);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/UFC.h b/dolfin/fem/UFC.h
new file mode 100644
index 0000000..7f8bf54
--- /dev/null
+++ b/dolfin/fem/UFC.h
@@ -0,0 +1,244 @@
+// Copyright (C) 2007-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2009
+//
+// First added:  2007-01-17
+// Last changed: 2013-02-26
+
+#ifndef __UFC_DATA_H
+#define __UFC_DATA_H
+
+#include <vector>
+#include <memory>
+#include <ufc.h>
+
+namespace dolfin
+{
+
+  class Cell;
+  class FiniteElement;
+  class Form;
+  class FunctionSpace;
+  class GenericFunction;
+  class Mesh;
+
+  /// This class is a simple data structure that holds data used
+  /// during assembly of a given UFC form. Data is created for each
+  /// primary argument, that is, v_j for j < r. In addition, nodal
+  /// basis expansion coefficients and a finite element are created
+  /// for each coefficient function.
+
+  class UFC
+  {
+  public:
+
+    /// Constructor
+    UFC(const Form& form);
+
+    /// Copy constructor
+    UFC(const UFC& ufc);
+
+    /// Destructor
+    ~UFC();
+
+    /// Initialise memory
+    void init(const Form& form);
+
+    /// Update current cell
+    void update(const Cell& cell,
+                const std::vector<double>& vertex_coordinates0,
+                const ufc::cell& ufc_cell,
+                const std::vector<bool> & enabled_coefficients);
+
+    /// Update current pair of cells for macro element
+    void update(const Cell& cell0,
+                const std::vector<double>& vertex_coordinates0,
+                const ufc::cell& ufc_cell0,
+                const Cell& cell1,
+                const std::vector<double>& vertex_coordinates1,
+                const ufc::cell& ufc_cell1,
+                const std::vector<bool> & enabled_coefficients);
+
+    /// Update current cell (TODO: Remove this when PointIntegralSolver supports the version with enabled_coefficients)
+    void update(const Cell& cell,
+                const std::vector<double>& vertex_coordinates0,
+                const ufc::cell& ufc_cell);
+
+    /// Update current pair of cells for macro element (TODO: Remove this when PointIntegralSolver supports the version with enabled_coefficients)
+    void update(const Cell& cell0,
+                const std::vector<double>& vertex_coordinates0,
+                const ufc::cell& ufc_cell0,
+                const Cell& cell1,
+                const std::vector<double>& vertex_coordinates1,
+                const ufc::cell& ufc_cell1);
+
+    /// Pointer to coefficient data. Used to support UFC interface.
+    const double* const * w() const
+    { return &w_pointer[0]; }
+
+    /// Pointer to coefficient data. Used to support UFC
+    /// interface. None const version
+    double* * w()
+    { return &w_pointer[0]; }
+
+    /// Pointer to macro element coefficient data. Used to support UFC
+    /// interface.
+    const double* const * macro_w() const
+    { return &macro_w_pointer[0]; }
+
+  private:
+
+    // Finite elements for coefficients
+    std::vector<FiniteElement> coefficient_elements;
+
+    // Cell integrals (access through
+    // get_cell_integral to get proper fallback to default)
+    std::vector<std::shared_ptr<ufc::cell_integral> >
+      cell_integrals;
+
+    // Exterior facet integrals (access through
+    // get_exterior_facet_integral to get proper fallback to default)
+    std::vector<std::shared_ptr<ufc::exterior_facet_integral> >
+      exterior_facet_integrals;
+
+    // Interior facet integrals (access through
+    // get_interior_facet_integral to get proper fallback to default)
+    std::vector<std::shared_ptr<ufc::interior_facet_integral> >
+      interior_facet_integrals;
+
+    // Point integrals (access through
+    // get_point_integral to get proper fallback to default)
+    std::vector<std::shared_ptr<ufc::point_integral> >
+      point_integrals;
+
+  public:
+
+    // Default cell integral
+    std::shared_ptr<ufc::cell_integral>
+      default_cell_integral;
+
+    // Default exterior facet integral
+    std::shared_ptr<ufc::exterior_facet_integral>
+      default_exterior_facet_integral;
+
+    // Default interior facet integral
+    std::shared_ptr<ufc::interior_facet_integral>
+      default_interior_facet_integral;
+
+    // Default point integral
+    std::shared_ptr<ufc::point_integral>
+      default_point_integral;
+
+    /// Get cell integral over a given domain, falling back to the
+    /// default if necessary
+    ufc::cell_integral*
+      get_cell_integral(std::size_t domain)
+    {
+      if (domain < form.num_cell_domains())
+      {
+        ufc::cell_integral * integral
+          = cell_integrals[domain].get();
+        if (integral)
+          return integral;
+      }
+      return default_cell_integral.get();
+    }
+
+    /// Get exterior facet integral over a given domain, falling back
+    /// to the default if necessary
+    ufc::exterior_facet_integral*
+      get_exterior_facet_integral(std::size_t domain)
+    {
+      if (domain < form.num_exterior_facet_domains())
+      {
+        ufc::exterior_facet_integral* integral
+          = exterior_facet_integrals[domain].get();
+        if (integral)
+          return integral;
+      }
+      return default_exterior_facet_integral.get();
+    }
+
+    /// Get interior facet integral over a given domain, falling back
+    /// to the default if necessary
+    ufc::interior_facet_integral*
+      get_interior_facet_integral(std::size_t domain)
+    {
+      if (domain < form.num_interior_facet_domains())
+      {
+        ufc::interior_facet_integral* integral
+          = interior_facet_integrals[domain].get();
+        if (integral)
+          return integral;
+      }
+      return default_interior_facet_integral.get();
+    }
+
+    /// Get point integral over a given domain, falling back to the
+    /// default if necessary
+    ufc::point_integral*
+      get_point_integral(std::size_t domain)
+    {
+      if (domain < form.num_point_domains())
+      {
+        ufc::point_integral * integral
+          = point_integrals[domain].get();
+        if (integral)
+          return integral;
+      }
+      return default_point_integral.get();
+    }
+
+    // Form
+    const ufc::form& form;
+
+    // FIXME AL: Check which data is actually used and remove the rest
+
+    // Local tensor
+    std::vector<double> A;
+
+    // Local tensor
+    std::vector<double> A_facet;
+
+    // Local tensor for macro element
+    std::vector<double> macro_A;
+
+  private:
+
+    // Coefficients (std::vector<double*> is used to interface with
+    // UFC)
+    std::vector<std::vector<double> > _w;
+    std::vector<double*> w_pointer;
+
+    // Coefficients on macro element (std::vector<double*> is used to
+    // interface with UFC)
+    std::vector<std::vector<double> > _macro_w;
+    std::vector<double*> macro_w_pointer;
+
+    // Coefficient functions
+    const std::vector<std::shared_ptr<const GenericFunction> > coefficients;
+
+  public:
+
+    /// The form
+    const Form& dolfin_form;
+
+  };
+}
+
+#endif
diff --git a/dolfin/fem/assemble.cpp b/dolfin/fem/assemble.cpp
new file mode 100644
index 0000000..99c1e32
--- /dev/null
+++ b/dolfin/fem/assemble.cpp
@@ -0,0 +1,96 @@
+// Copyright (C) 2007-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2008-2013.
+// Modified by Johan Hake, 2009.
+// Modified by Joachim B. Haga, 2012.
+// Modified by Martin S. Alnaes, 2013.
+//
+// First added:  2007-01-17
+// Last changed: 2013-02-13
+
+#include <dolfin/la/Scalar.h>
+#include "Form.h"
+#include "Assembler.h"
+#include "SystemAssembler.h"
+#include "assemble.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void dolfin::assemble(GenericTensor& A, const Form& a)
+{
+  Assembler assembler;
+  assembler.assemble(A, a);
+}
+//-----------------------------------------------------------------------------
+void dolfin::assemble_system(GenericMatrix& A,
+                             GenericVector& b,
+                             const Form& a,
+                             const Form& L)
+{
+  SystemAssembler assembler(a, L);
+  assembler.assemble(A, b);
+}
+//-----------------------------------------------------------------------------
+void dolfin::assemble_system(GenericMatrix& A,
+                             GenericVector& b,
+                             const Form& a,
+                             const Form& L,
+                             const DirichletBC& bc)
+{
+  SystemAssembler assembler(a, L, bc);
+  assembler.assemble(A, b);
+}
+//-----------------------------------------------------------------------------
+void dolfin::assemble_system(GenericMatrix& A,
+                             GenericVector& b,
+                             const Form& a,
+                             const Form& L,
+                             const std::vector<const DirichletBC*> bcs)
+{
+  SystemAssembler assembler(a, L, bcs);
+  assembler.assemble(A, b);
+}
+//-----------------------------------------------------------------------------
+void dolfin::assemble_system(GenericMatrix& A,
+                             GenericVector& b,
+                             const Form& a,
+                             const Form& L,
+                             const std::vector<const DirichletBC*> bcs,
+                             const GenericVector& x0)
+{
+  SystemAssembler assembler(a, L, bcs);
+  assembler.assemble(A, b, x0);
+}
+//-----------------------------------------------------------------------------
+double dolfin::assemble(const Form& a)
+{
+  if (a.rank() != 0)
+  {
+    dolfin_error("assemble.cpp",
+                 "assemble form",
+                 "Expecting a scalar form but rank is %d",
+                 a.rank());
+  }
+
+  Scalar s;
+  Assembler assembler;
+  assembler.assemble(s, a);
+  return s;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/assemble.h b/dolfin/fem/assemble.h
new file mode 100644
index 0000000..c4820af
--- /dev/null
+++ b/dolfin/fem/assemble.h
@@ -0,0 +1,87 @@
+// Copyright (C) 2007-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2008-2013.
+// Modified by Johan Hake, 2009.
+// Modified by Joachim B. Haga, 2012.
+// Modified by Martin S. Alnaes, 2013.
+//
+// First added:  2007-01-17
+// Last changed: 2013-02-13
+//
+// This file duplicates the Assembler::assemble* and SystemAssembler::assemble*
+// functions in namespace dolfin, and adds special versions returning the value
+// directly for scalars. For documentation, refer to Assemble.h and
+// SystemAssemble.h
+
+#ifndef __ASSEMBLE_H
+#define __ASSEMBLE_H
+
+#include <vector>
+
+namespace dolfin
+{
+
+  class DirichletBC;
+  class Form;
+  class GenericMatrix;
+  class GenericTensor;
+  class GenericVector;
+  template<typename T> class MeshFunction;
+
+  //--- Copies of assembly functions in Assembler.h ---
+
+  /// Assemble tensor
+  void assemble(GenericTensor& A, const Form& a);
+
+  /// Assemble system (A, b)
+  void assemble_system(GenericMatrix& A,
+                       GenericVector& b,
+                       const Form& a,
+                       const Form& L);
+
+  /// Assemble system (A, b) and apply Dirichlet boundary condition
+  void assemble_system(GenericMatrix& A,
+                       GenericVector& b,
+                       const Form& a,
+                       const Form& L,
+                       const DirichletBC& bc);
+
+  /// Assemble system (A, b) and apply Dirichlet boundary conditions
+  void assemble_system(GenericMatrix& A,
+                       GenericVector& b,
+                       const Form& a,
+                       const Form& L,
+                       const std::vector<const DirichletBC*> bcs);
+
+  /// Assemble system (A, b) on sub domains and apply Dirichlet boundary
+  /// conditions
+  void assemble_system(GenericMatrix& A,
+                       GenericVector& b,
+                       const Form& a,
+                       const Form& L,
+                       const std::vector<const DirichletBC*> bcs,
+                       const GenericVector& x0);
+
+  //--- Specialized version for scalars ---
+
+  /// Assemble scalar
+  double assemble(const Form& a);
+
+}
+
+#endif
diff --git a/dolfin/fem/dolfin_fem.h b/dolfin/fem/dolfin_fem.h
new file mode 100644
index 0000000..de8d120
--- /dev/null
+++ b/dolfin/fem/dolfin_fem.h
@@ -0,0 +1,33 @@
+#ifndef __DOLFIN_FEM_H
+#define __DOLFIN_FEM_H
+
+// DOLFIN fem interface
+
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/fem_utils.h>
+#include <dolfin/fem/Equation.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/BasisFunction.h>
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/fem/PointSource.h>
+#include <dolfin/fem/assemble.h>
+#include <dolfin/fem/LocalSolver.h>
+#include <dolfin/fem/solve.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/fem/AssemblerBase.h>
+#include <dolfin/fem/Assembler.h>
+#include <dolfin/fem/SparsityPatternBuilder.h>
+#include <dolfin/fem/SystemAssembler.h>
+#include <dolfin/fem/LinearVariationalProblem.h>
+#include <dolfin/fem/LinearVariationalSolver.h>
+#include <dolfin/fem/NonlinearVariationalProblem.h>
+#include <dolfin/fem/NonlinearVariationalSolver.h>
+#include <dolfin/fem/CCFEMForm.h>
+#include <dolfin/fem/CCFEMDofMap.h>
+#include <dolfin/fem/CCFEMAssembler.h>
+
+// Move up when ready or merge with Assembler.h
+#include <dolfin/fem/OpenMpAssembler.h>
+
+#endif
diff --git a/dolfin/fem/fem_utils.cpp b/dolfin/fem/fem_utils.cpp
new file mode 100644
index 0000000..5864574
--- /dev/null
+++ b/dolfin/fem/fem_utils.cpp
@@ -0,0 +1,138 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-05
+// Last changed: 2013-11-07
+
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Vertex.h>
+
+#include "fem_utils.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> dolfin::dof_to_vertex_map(const FunctionSpace& space)
+{
+  const GenericDofMap& dofmap = *space.dofmap();
+
+  if (dofmap.is_view())
+  {
+    dolfin_error("fem_utils.cpp",
+                 "tabulate dof to vertex map",
+                 "Cannot tabulate dof_to_vertex_map for a subspace");
+  }
+
+  // Get dof to vertex map
+  const std::vector<dolfin::la_index> vertex_map = vertex_to_dof_map(space);
+
+  // Create return data structure
+  const dolfin::la_index num_dofs
+    = dofmap.ownership_range().second  -  dofmap.ownership_range().first;
+  std::vector<std::size_t> return_map(num_dofs);
+
+  // Invert dof_map
+  for (std::size_t i = 0; i < vertex_map.size(); i++)
+  {
+    const dolfin::la_index dof = vertex_map[i];
+
+    // Skip ghost dofs
+    if (dof >= 0 && dof < num_dofs)
+      return_map[dof] = i;
+  }
+
+  // Return the map
+  return return_map;
+}
+//-----------------------------------------------------------------------------
+std::vector<dolfin::la_index>
+dolfin::vertex_to_dof_map(const FunctionSpace& space)
+{
+  // Get the mesh
+  const Mesh& mesh = *space.mesh();
+  const GenericDofMap& dofmap = *space.dofmap();
+
+  if (dofmap.is_view())
+  {
+    dolfin_error("fem_utils.cpp",
+                 "tabulate vertex to dof map",
+                 "Cannot tabulate vertex_to_dof_map for a subspace");
+  }
+
+  // Initialize vertex to cell connections
+  const std::size_t top_dim = mesh.topology().dim();
+  mesh.init(0, top_dim);
+
+  // Num dofs per vertex
+  const std::size_t dofs_per_vertex = dofmap.num_entity_dofs(0);
+  const std::size_t vert_per_cell = mesh.topology()(top_dim, 0).size(0);
+  if (vert_per_cell*dofs_per_vertex != dofmap.max_cell_dimension())
+  {
+    dolfin_error("DofMap.cpp",
+                 "tabulate dof to vertex map",
+                 "Can only tabulate dofs on vertices");
+  }
+
+  // Allocate data for tabulating local to local map
+  std::vector<std::size_t> local_to_local_map(dofs_per_vertex);
+
+  // Offset of local to global dof numbering
+  const dolfin::la_index n0 = dofmap.ownership_range().first;
+
+  // Create return data structure
+  std::vector<dolfin::la_index> return_map(dofs_per_vertex*mesh.num_entities(0));
+
+  // Iterate over vertices
+  std::size_t local_vertex_ind = 0;
+  for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+  {
+    // Get the first cell connected to the vertex
+    const Cell cell(mesh, vertex->entities(top_dim)[0]);
+
+    // Find local vertex number
+    for (std::size_t i = 0; i < cell.num_entities(0); i++)
+    {
+      if (cell.entities(0)[i] == vertex->index())
+      {
+        local_vertex_ind = i;
+        break;
+      }
+    }
+
+    // Get all cell dofs
+    const std::vector<dolfin::la_index>& cell_dofs
+      = dofmap.cell_dofs(cell.index());
+
+    // Tabulate local to local map of dofs on local vertex
+    dofmap.tabulate_entity_dofs(local_to_local_map, 0,
+				local_vertex_ind);
+
+    // Fill local dofs for the vertex
+    for (std::size_t local_dof = 0; local_dof < dofs_per_vertex; local_dof++)
+    {
+      const dolfin::la_index global_dof
+        = cell_dofs[local_to_local_map[local_dof]];
+      return_map[dofs_per_vertex*vertex->index() + local_dof] = global_dof - n0;
+    }
+  }
+
+  // Return the map
+  return return_map;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/fem_utils.h b/dolfin/fem/fem_utils.h
new file mode 100644
index 0000000..7162cbd
--- /dev/null
+++ b/dolfin/fem/fem_utils.h
@@ -0,0 +1,66 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-05
+// Last changed: 2013-09-09
+
+#ifndef __FEM_UTILS_H
+#define __FEM_UTILS_H
+
+#include <vector>
+
+#include <dolfin/common/types.h>
+
+namespace dolfin
+{
+
+  class FunctionSpace;
+
+  /// Return a map between dofs indices and vertex indices
+  /// 
+  /// Only works for FunctionSpace with dofs exclusively on vertices.
+  /// For MixedFunctionSpaces vertex index is offset with the number
+  /// of dofs per vertex. In parallel the returned map only maps local
+  /// (to processor) dofs.
+  ///
+  /// *Arguments*
+  ///     space (_FunctionSpace_)
+  ///         The FunctionSpace for what the dof to vertex map should be computed for
+  ///
+  /// *Returns*
+  ///     std::vector<std::size_t>
+  ///         The dof to vertex map
+  std::vector<std::size_t> dof_to_vertex_map(const FunctionSpace& space);
+
+  /// Return a map between vertex indices and dofs indices
+  ///
+  /// Only works for FunctionSpace with dofs exclusively on vertices.
+  /// For MixedFunctionSpaces dof index is offset with the number of
+  /// dofs per vertex.
+  ///
+  /// *Arguments*
+  ///     space (_FunctionSpace_)
+  ///         The FunctionSpace for what the vertex to dof map should be computed for
+  ///
+  /// *Returns*
+  ///     std::vector<dolfin::la_index>
+  ///         The vertex to dof map
+  std::vector<dolfin::la_index> vertex_to_dof_map(const FunctionSpace& space);
+
+}
+
+#endif
diff --git a/dolfin/fem/solve.cpp b/dolfin/fem/solve.cpp
new file mode 100644
index 0000000..8283036
--- /dev/null
+++ b/dolfin/fem/solve.cpp
@@ -0,0 +1,120 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-22
+// Last changed: 2012-11-09
+
+#include "LinearVariationalProblem.h"
+#include "LinearVariationalSolver.h"
+#include "NonlinearVariationalProblem.h"
+#include "NonlinearVariationalSolver.h"
+#include "Equation.h"
+#include "solve.h"
+
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation,
+                   Function& u, Parameters parameters)
+{
+  // Create empty list of boundary conditions
+  std::vector<const DirichletBC*> bcs;
+
+  // Call common solve function
+  solve(equation, u, bcs, parameters);
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation,
+                   Function& u,
+                   const DirichletBC& bc,
+		   Parameters parameters)
+{
+  // Create list containing single boundary condition
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bc);
+
+  // Call common solve function
+  solve(equation, u, bcs, parameters);
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation,
+                   Function& u,
+                   std::vector<const DirichletBC*> bcs,
+		   Parameters parameters)
+{
+  // Solve linear problem
+  if (equation.is_linear())
+  {
+    LinearVariationalProblem problem(*equation.lhs(), *equation.rhs(), u, bcs);
+    LinearVariationalSolver solver(problem);
+    solver.parameters.update(parameters);
+    solver.solve();
+  }
+
+  // Solve nonlinear problem
+  else
+  {
+    NonlinearVariationalProblem problem(*equation.lhs(), u, bcs);
+    NonlinearVariationalSolver solver(problem);
+    solver.parameters.update(parameters);
+    solver.solve();
+  }
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation,
+                   Function& u,
+                   const Form& J,
+		   Parameters parameters)
+{
+  // Create empty list of boundary conditions
+  std::vector<const DirichletBC*> bcs;
+
+  // Call common solve function
+  solve(equation, u, bcs, J, parameters);
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation,
+                   Function& u,
+                   const DirichletBC& bc,
+                   const Form& J,
+                    Parameters parameters)
+{
+  // Create list containing single boundary condition
+  std::vector<const DirichletBC*> bcs;
+  bcs.push_back(&bc);
+
+  // Call common solve function
+  solve(equation, u, bcs, J, parameters);
+}
+//-----------------------------------------------------------------------------
+void dolfin::solve(const Equation& equation,
+                   Function& u,
+                   std::vector<const DirichletBC*> bcs,
+                   const Form& J,
+		   Parameters parameters)
+{
+  // Check that the problem is linear
+  if (equation.is_linear())
+    dolfin_error("solve.cpp",
+                 "solve nonlinear variational problem",
+                 "Variational problem is linear");
+
+  // Solve nonlinear problem
+  NonlinearVariationalProblem problem(*equation.lhs(), u, bcs, J);
+  NonlinearVariationalSolver solver(problem);
+  solver.parameters.update(parameters);
+  solver.solve();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/fem/solve.h b/dolfin/fem/solve.h
new file mode 100644
index 0000000..68f49be
--- /dev/null
+++ b/dolfin/fem/solve.h
@@ -0,0 +1,106 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-22
+// Last changed: 2012-11-09
+
+#ifndef __SOLVE_FEM_H
+#define __SOLVE_FEM_H
+
+#include <vector>
+#include <dolfin/parameter/Parameters.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Equation;
+  class Function;
+  class DirichletBC;
+  class Form;
+
+  //--- Linear / nonlinear problems (no Jacobian specified) ---
+
+  /// Solve linear variational problem a(u, v) == L(v) or nonlinear
+  /// variational problem F(u; v) = 0 without boundary conditions.
+  ///
+  /// Optional parameters can be passed to the LinearVariationalSolver
+  /// or NonlinearVariationalSolver classes.
+  void solve(const Equation& equation,
+             Function& u,
+             Parameters parameters=empty_parameters);
+
+  /// Solve linear variational problem a(u, v) == L(v) or nonlinear
+  /// variational problem F(u; v) = 0 with a single boundary condition.
+  ///
+  /// Optional parameters can be passed to the LinearVariationalSolver
+  /// or NonlinearVariationalSolver classes.
+  void solve(const Equation& equation,
+             Function& u,
+             const DirichletBC& bc,
+             Parameters parameters=empty_parameters);
+
+  /// Solve linear variational problem a(u, v) == L(v) or nonlinear
+  /// variational problem F(u; v) = 0 with a list of boundary conditions.
+  ///
+  /// Optional parameters can be passed to the LinearVariationalSolver
+  /// or NonlinearVariationalSolver classes.
+  void solve(const Equation& equation,
+             Function& u,
+             std::vector<const DirichletBC*> bcs,
+             Parameters parameters=empty_parameters);
+
+  //--- Nonlinear problems (Jacobian specified) ---
+
+  /// Solve nonlinear variational problem F(u; v) == 0 without boundary
+  /// conditions. The argument J should provide the Jacobian bilinear
+  /// form J = dF/du.
+  ///
+  /// Optional parameters can be passed to the LinearVariationalSolver
+  /// or NonlinearVariationalSolver classes.
+  void solve(const Equation& equation,
+             Function& u,
+             const Form& J,
+             Parameters parameters=empty_parameters);
+
+  /// Solve nonlinear variational problem F(u; v) == 0 with a single
+  /// boundary condition. The argument J should provide the Jacobian
+  /// bilinear form J = dF/du.
+  ///
+  /// Optional parameters can be passed to the LinearVariationalSolver
+  /// or NonlinearVariationalSolver classes.
+  void solve(const Equation& equation,
+             Function& u,
+             const DirichletBC& bc,
+             const Form& J,
+             Parameters parameters=empty_parameters);
+
+  /// Solve nonlinear variational problem F(u; v) == 0 with a list of
+  /// boundary conditions. The argument J should provide the Jacobian
+  /// bilinear form J = dF/du.
+  ///
+  /// Optional parameters can be passed to the LinearVariationalSolver
+  /// or NonlinearVariationalSolver classes.
+  void solve(const Equation& equation,
+             Function& u,
+             std::vector<const DirichletBC*> bcs,
+             const Form& J,
+             Parameters parameters=empty_parameters);
+
+}
+
+#endif
diff --git a/dolfin/function/CCFEMFunction.cpp b/dolfin/function/CCFEMFunction.cpp
new file mode 100644
index 0000000..0ae26f7
--- /dev/null
+++ b/dolfin/function/CCFEMFunction.cpp
@@ -0,0 +1,117 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-25
+// Last changed: 2013-10-22
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/la/DefaultFactory.h>
+#include <dolfin/fem/CCFEMDofMap.h>
+#include "Function.h"
+#include "CCFEMFunctionSpace.h"
+#include "CCFEMFunction.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CCFEMFunction::CCFEMFunction(const CCFEMFunctionSpace& V)
+  : _function_space(reference_to_no_delete_pointer(V))
+{
+  // Initialize vector
+  init_vector();
+}
+//-----------------------------------------------------------------------------
+CCFEMFunction::CCFEMFunction(std::shared_ptr<const CCFEMFunctionSpace> V)
+  : _function_space(V)
+{
+  // Initialize vector
+  init_vector();
+}
+//-----------------------------------------------------------------------------
+CCFEMFunction::~CCFEMFunction()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+const Function& CCFEMFunction::part(std::size_t i) const
+{
+  // FIXME
+
+  /*
+  // Check if sub-Function is in the cache, otherwise create and add to cache
+  boost::ptr_map<std::size_t, Function>::iterator sub_function
+    = sub_functions.find(i);
+  if (sub_function != sub_functions.end())
+    return *(sub_function->second);
+  else
+  {
+    // Extract function subspace
+    std::vector<std::size_t> component = boost::assign::list_of(i);
+    std::shared_ptr<const FunctionSpace>
+      sub_space(_function_space->extract_sub_space(component));
+
+    // Insert sub-Function into map and return reference
+    sub_functions.insert(i, new Function(sub_space, _vector));
+    return *(sub_functions.find(i)->second);
+  }
+  */
+
+  return *(_function_parts.find(0)->second);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> CCFEMFunction::vector()
+{
+  dolfin_assert(_vector);
+  return _vector;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericVector> CCFEMFunction::vector() const
+{
+  dolfin_assert(_vector);
+  return _vector;
+}
+//-----------------------------------------------------------------------------
+void CCFEMFunction::init_vector()
+{
+  // Get global size
+  //const std::size_t N = _function_space->dofmap()->global_dimension();
+
+  // Get local range
+  const std::pair<std::size_t, std::size_t> range
+    = _function_space->dofmap()->ownership_range();
+  //const std::size_t local_size = range.second - range.first;
+
+  // Determine ghost vertices if dof map is distributed
+  std::vector<la_index> ghost_indices;
+  // FIXME: Does not work in parallel
+  //if (N > local_size)
+  //  compute_ghost_indices(range, ghost_indices);
+
+  // Create vector of dofs
+  if (!_vector)
+  {
+    DefaultFactory factory;
+    _vector = factory.create_vector();
+  }
+  dolfin_assert(_vector);
+
+  // Initialize vector of dofs
+  _vector->init(MPI_COMM_WORLD, range, ghost_indices);
+  _vector->zero();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/CCFEMFunction.h b/dolfin/function/CCFEMFunction.h
new file mode 100644
index 0000000..18d1b01
--- /dev/null
+++ b/dolfin/function/CCFEMFunction.h
@@ -0,0 +1,106 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-25
+// Last changed: 2013-10-22
+
+#ifndef __CCFEM_FUNCTION_H
+#define __CCFEM_FUNCTION_H
+
+#include <memory>
+#include <boost/ptr_container/ptr_map.hpp>
+
+namespace dolfin
+{
+
+  // Forward declacations
+  class CCFEMFunctionSpace;
+  class GenericVector;
+  class Function;
+
+  /// This class represents a function on a cut and composite finite
+  /// element function space (CCFEM) defined on one or more possibly
+  /// intersecting meshes.
+
+  class CCFEMFunction
+  {
+  public:
+
+    /// Create CCFEM function on given CCFEM function space
+    ///
+    /// *Arguments*
+    ///     V (_CCFEMFunctionSpace_)
+    ///         The CCFEM function space.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         CCFEMFunction u(V);
+    ///
+    explicit CCFEMFunction(const CCFEMFunctionSpace& V);
+
+    /// Create CCFEM function on given CCFEM function space (shared
+    /// pointer version)
+    ///
+    /// *Arguments*
+    ///     V (_CCFEMFunctionSpace_)
+    ///         The CCFEM function space.
+    explicit CCFEMFunction(std::shared_ptr<const CCFEMFunctionSpace> V);
+
+    /// Destructor
+    virtual ~CCFEMFunction();
+
+    /// Return function (part) number i
+    ///
+    /// *Returns*
+    ///     _Function_
+    ///         Function (part) number i
+    const Function& part(std::size_t i) const;
+
+    /// Return vector of expansion coefficients (non-const version)
+    ///
+    /// *Returns*
+    ///     _GenericVector_
+    ///         The vector of expansion coefficients.
+    std::shared_ptr<GenericVector> vector();
+
+    /// Return vector of expansion coefficients (const version)
+    ///
+    /// *Returns*
+    ///     _GenericVector_
+    ///         The vector of expansion coefficients (const).
+    std::shared_ptr<const GenericVector> vector() const;
+
+  private:
+
+    // Initialize vector
+    void init_vector();
+
+    // The function space
+    std::shared_ptr<const CCFEMFunctionSpace> _function_space;
+
+    // The vector of expansion coefficients (local)
+    std::shared_ptr<GenericVector> _vector;
+
+    // Collection of functions for parts which share data
+    mutable boost::ptr_map<std::size_t, Function> _function_parts;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/CCFEMFunctionSpace.cpp b/dolfin/function/CCFEMFunctionSpace.cpp
new file mode 100644
index 0000000..78760de
--- /dev/null
+++ b/dolfin/function/CCFEMFunctionSpace.cpp
@@ -0,0 +1,358 @@
+// Copyright (C) 2013-2014 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-08-05
+// Last changed: 2014-03-03
+
+#include <dolfin/log/log.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/geometry/BoundingBoxTree.h>
+#include <dolfin/geometry/SimplexQuadrature.h>
+#include <dolfin/fem/CCFEMDofMap.h>
+#include "FunctionSpace.h"
+#include "CCFEMFunctionSpace.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CCFEMFunctionSpace::CCFEMFunctionSpace() : _dofmap(new CCFEMDofMap())
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+CCFEMFunctionSpace::~CCFEMFunctionSpace()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMFunctionSpace::dim() const
+{
+  dolfin_assert(_dofmap);
+  return _dofmap->global_dimension();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const CCFEMDofMap> CCFEMFunctionSpace::dofmap() const
+{
+  dolfin_assert(_dofmap);
+  return _dofmap;
+}
+//-----------------------------------------------------------------------------
+std::size_t CCFEMFunctionSpace::num_parts() const
+{
+  return _function_spaces.size();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace>
+CCFEMFunctionSpace::part(std::size_t i) const
+{
+  dolfin_assert(i < _function_spaces.size());
+  return _function_spaces[i];
+}
+//-----------------------------------------------------------------------------
+const std::vector<unsigned int>&
+CCFEMFunctionSpace::uncut_cells(std::size_t part) const
+{
+  dolfin_assert(part < num_parts());
+  return _uncut_cells[part];
+}
+//-----------------------------------------------------------------------------
+const std::vector<unsigned int>&
+CCFEMFunctionSpace::cut_cells(std::size_t part) const
+{
+  dolfin_assert(part < num_parts());
+  return _cut_cells[part];
+}
+//-----------------------------------------------------------------------------
+const std::vector<unsigned int>&
+CCFEMFunctionSpace::covered_cells(std::size_t part) const
+{
+  dolfin_assert(part < num_parts());
+  return _covered_cells[part];
+}
+//-----------------------------------------------------------------------------
+const std::map<unsigned int,
+               std::vector<std::pair<std::size_t, unsigned int> > >&
+CCFEMFunctionSpace::collision_map_cut_cells(std::size_t part) const
+{
+  dolfin_assert(part < num_parts());
+  return _collision_maps_cut_cells[part];
+}
+//-----------------------------------------------------------------------------
+const std::map<unsigned int,
+               std::pair<std::vector<double>, std::vector<double> > > &
+CCFEMFunctionSpace::quadrature_rule_cut_cells(std::size_t part) const
+
+{
+  dolfin_assert(part < num_parts());
+  return _quadrature_rules_cut_cells[part];
+}
+//-----------------------------------------------------------------------------
+void
+CCFEMFunctionSpace::add(std::shared_ptr<const FunctionSpace> function_space)
+{
+  _function_spaces.push_back(function_space);
+  log(PROGRESS, "Added function space to CCFEM space; space has %d part(s).",
+      _function_spaces.size());
+}
+//-----------------------------------------------------------------------------
+void CCFEMFunctionSpace::add(const FunctionSpace& function_space)
+{
+  add(reference_to_no_delete_pointer(function_space));
+}
+//-----------------------------------------------------------------------------
+void CCFEMFunctionSpace::build()
+{
+  begin(PROGRESS, "Building CCFEM function space.");
+
+  // Extract meshes
+  _meshes.clear();
+  for (std::size_t i = 0; i < num_parts(); i++)
+    _meshes.push_back(_function_spaces[i]->mesh());
+
+  // Build dofmap
+  _build_dofmap();
+
+  // Build boundary meshes
+  _build_boundary_meshes();
+
+  // Build bounding box trees
+  _build_bounding_box_trees();
+
+  // Build collision maps
+  _build_collision_maps();
+
+  // Build quadrature rules
+  _build_quadrature_rules();
+
+  end();
+}
+//-----------------------------------------------------------------------------
+void CCFEMFunctionSpace::_build_dofmap()
+{
+  begin(PROGRESS, "Building CCFEM dofmap.");
+
+  // Clear dofmap
+  dolfin_assert(_dofmap);
+  _dofmap->clear();
+
+  // Add dofmap for each part
+  for (std::size_t i = 0; i < num_parts(); i++)
+    _dofmap->add(_function_spaces[i]->dofmap());
+
+  // Call function to build dofmap
+  _dofmap->build(*this);
+
+  end();
+}
+//-----------------------------------------------------------------------------
+void CCFEMFunctionSpace::_build_boundary_meshes()
+{
+  begin(PROGRESS, "Building boundary meshes.");
+
+  // Clear boundary meshes
+  _boundary_meshes.clear();
+
+  // Build boundary mesh for each part
+  for (std::size_t i = 0; i < num_parts(); i++)
+  {
+    std::shared_ptr<BoundaryMesh>
+      boundary_mesh(new BoundaryMesh(*_meshes[i], "exterior"));
+    _boundary_meshes.push_back(boundary_mesh);
+  }
+
+  end();
+}
+//-----------------------------------------------------------------------------
+void CCFEMFunctionSpace::_build_bounding_box_trees()
+{
+  begin(PROGRESS, "Building bounding box trees for all meshes.");
+
+  // Clear bounding box trees
+  _trees.clear();
+  _boundary_trees.clear();
+
+  // Build trees for each part
+  for (std::size_t i = 0; i < num_parts(); i++)
+  {
+    // Build tree for mesh
+    std::shared_ptr<BoundingBoxTree> tree(new BoundingBoxTree());
+    tree->build(*_meshes[i]);
+    _trees.push_back(tree);
+
+    // Build tree for boundary mesh
+    std::shared_ptr<BoundingBoxTree> boundary_tree(new BoundingBoxTree());
+    boundary_tree->build(*_boundary_meshes[i]);
+    _boundary_trees.push_back(boundary_tree);
+  }
+
+  end();
+}
+//-----------------------------------------------------------------------------
+void CCFEMFunctionSpace::_build_collision_maps()
+{
+  begin(PROGRESS, "Building collision maps.");
+
+  // Clear collision maps
+  _uncut_cells.clear();
+  _cut_cells.clear();
+  _covered_cells.clear();
+  _collision_maps_cut_cells.clear();
+
+  // Iterate over all parts
+  for (std::size_t i = 0; i < num_parts(); i++)
+  {
+    // Collision map for cut cells in mesh `i`
+    std::map<unsigned int, std::vector<std::pair<std::size_t, unsigned int> > >
+      collision_map_cut_cells;
+
+    // Markers for collisions with domain
+    std::vector<bool> markers_domain(_meshes[i]->num_cells());
+    std::fill(markers_domain.begin(), markers_domain.end(), false);
+
+    // Iterate over covering parts (with higher part number)
+    for (std::size_t j = i + 1; j < num_parts(); j++)
+    {
+      log(PROGRESS, "Computing collisions for mesh %d overlapped by mesh %d.", i, j);
+
+      // Compute boundary collisions
+      auto boundary_collisions = _trees[i]->compute_collisions(*_boundary_trees[j]);
+
+      // Iterate over boundary collisions
+      for (auto it = boundary_collisions.first.begin();
+           it != boundary_collisions.first.end(); ++it)
+      {
+        // Add empty list of collisions into map if it does not exist
+        if (collision_map_cut_cells.find(*it) == collision_map_cut_cells.end())
+        {
+          std::vector<std::pair<std::size_t, unsigned int> > collisions;
+          collision_map_cut_cells[*it] = collisions;
+        }
+      }
+
+      // Compute domain collisions
+      auto domain_collisions = _trees[i]->compute_collisions(*_trees[j]);
+
+      // Iterate over domain collisions
+      dolfin_assert(domain_collisions.first.size() == domain_collisions.second.size());
+      for (std::size_t k = 0; k < domain_collisions.first.size(); k++)
+      {
+        // Get the two colliding cells
+        auto cell_i = domain_collisions.first[k];
+        auto cell_j = domain_collisions.second[k];
+
+        // Mark collision for first cell
+        markers_domain[cell_i] = true;
+
+        // Add to collision map if we find a cut cell
+        auto it = collision_map_cut_cells.find(cell_i);
+        if (it != collision_map_cut_cells.end())
+          it->second.push_back(std::make_pair(j, cell_j));
+      }
+    }
+
+    // Extract uncut, cut and covered cells:
+    //
+    // uncut   = cell not colliding with any other domain
+    // cut     = cell colliding with some other boundary
+    // covered = cell colliding with some other domain but no boundary
+
+    // Iterate over cells and check markers
+    std::vector<unsigned int> uncut_cells;
+    std::vector<unsigned int> cut_cells;
+    std::vector<unsigned int> covered_cells;
+    for (unsigned int c = 0; c < _meshes[i]->num_cells(); c++)
+    {
+      if (!markers_domain[c])
+        uncut_cells.push_back(c);
+      else if (collision_map_cut_cells.find(c) != collision_map_cut_cells.end())
+        cut_cells.push_back(c);
+      else
+        covered_cells.push_back(c);
+    }
+
+    // Store data for this mesh
+    _uncut_cells.push_back(uncut_cells);
+    _cut_cells.push_back(cut_cells);
+    _covered_cells.push_back(covered_cells);
+    _collision_maps_cut_cells.push_back(collision_map_cut_cells);
+
+    // Report results
+    log(PROGRESS, "Part %d has %d uncut cells, %d cut cells, and %d covered cells.",
+        i, uncut_cells.size(), cut_cells.size(), covered_cells.size());
+  }
+
+  end();
+}
+//-----------------------------------------------------------------------------
+void CCFEMFunctionSpace::_build_quadrature_rules()
+{
+  begin(PROGRESS, "Building quadrature rules.");
+
+  // FIXME: Make this a parameters
+  const std::size_t order = 1;
+
+  // Clear quadrature rules
+  _quadrature_rules_cut_cells.clear();
+  _quadrature_rules_cut_cells.resize(num_parts());
+
+  // Iterate over all parts
+  for (std::size_t cut_part = 0; cut_part < num_parts(); cut_part++)
+  {
+    // Iterate over cut cells for current part
+    const auto cmap = collision_map_cut_cells(cut_part);
+    for (auto it = cmap.begin(); it != cmap.end(); ++it)
+    {
+      // Get cut cell
+      const unsigned int cut_cell_index = it->first;
+      const Cell cut_cell(*(_meshes[cut_part]), cut_cell_index);
+
+      // Get dimensions
+      const std::size_t tdim = cut_cell.mesh().topology().dim();
+      const std::size_t gdim = cut_cell.mesh().geometry().dim();
+
+      // Iterate over cutting cells
+      auto cutting_cells = it->second;
+      for (auto jt = cutting_cells.begin(); jt != cutting_cells.end(); jt++)
+      {
+        // Get cutting part and cutting cell
+        const std::size_t cutting_part = jt->first;
+        const Cell cutting_cell(*(_meshes[cutting_part]), jt->second);
+
+        // Compute triangulation of intersection between cut and cutting cell
+        auto triangulation = cut_cell.triangulate_intersection(cutting_cell);
+
+        // Iterate over simplices in triangulation
+        const std::size_t offset = (tdim + 1)*gdim; // coordinates per simplex
+        const std::size_t num_intersections = triangulation.size() / offset;
+        for (std::size_t k = 0; k < num_intersections; k++)
+        {
+          // Get coordinates for current simplex in triangulation
+          const double* coordinates = &triangulation[0] + k*offset;
+
+          // Compute quadrature rule for simplex
+          _quadrature_rules_cut_cells[cut_part][cut_cell_index]
+            = SimplexQuadrature::compute_quadrature_rule(coordinates, tdim, gdim, order);
+        }
+      }
+    }
+  }
+
+  end();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/CCFEMFunctionSpace.h b/dolfin/function/CCFEMFunctionSpace.h
new file mode 100644
index 0000000..b1dbd07
--- /dev/null
+++ b/dolfin/function/CCFEMFunctionSpace.h
@@ -0,0 +1,303 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-08-05
+// Last changed: 2014-03-03
+
+#ifndef __CCFEM_FUNCTION_SPACE_H
+#define __CCFEM_FUNCTION_SPACE_H
+
+#include <vector>
+#include <map>
+#include <memory>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class FunctionSpace;
+  class CCFEMDofMap;
+  class Mesh;
+  class BoundingBoxTree;
+  class BoundaryMesh;
+
+  // FIXME: Consider moving many of the data structures from this
+  // class to a new class named CCFEMMesh (or similar), since many of
+  // them are related to meshes only and not a particular function
+  // space.
+
+  // FIXME: Consider renaming this class and related classes from
+  // CCFEM to something else, perhaps MultiMeshFunctionSpace?
+
+  /// This class represents a cut and composite finite element
+  /// function space (CCFEM) defined on one or more possibly
+  /// intersecting meshes.
+  ///
+  /// A CCFEM function space may be created from a set of standard
+  /// function spaces by repeatedly calling add(), followed by a call
+  /// to build(). Note that a CCFEM function space is not useful and
+  /// its data structures are empty until build() has been called.
+
+  class CCFEMFunctionSpace
+  {
+  public:
+
+    /// Create empty CCFEM function space
+    CCFEMFunctionSpace();
+
+    /// Destructor
+    ~CCFEMFunctionSpace();
+
+    /// Return dimension of the CCFEM function space
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The dimension of the CCFEM function space.
+    std::size_t dim() const;
+
+    /// Return CCFEM dofmap
+    ///
+    /// *Returns*
+    ///     _CCFEMDofMap_
+    ///         The dofmap.
+    std::shared_ptr<const CCFEMDofMap> dofmap() const;
+
+    /// Return the number function spaces (parts) of the CCFEM function space
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The number of function spaces (parts) of the CCFEM function space.
+    std::size_t num_parts() const;
+
+    /// Return function space (part) number i
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         The part number
+    ///
+    /// *Returns*
+    ///     _FunctionSpace_
+    ///         Function space (part) number i
+    std::shared_ptr<const FunctionSpace> part(std::size_t i) const;
+
+    /// Return the list of uncut cells for given part. The uncut cells
+    /// are defined as all cells that don't collide with any cells in
+    /// any other part with higher part number.
+    ///
+    /// *Arguments*
+    ///     part (std::size_t)
+    ///         The part number
+    ///
+    /// *Returns*
+    ///     std::vector<unsigned int>
+    ///         List of uncut cell indices for given part
+    const std::vector<unsigned int>& uncut_cells(std::size_t part) const;
+
+    /// Return the list of cut cells for given part. The cut cells are
+    /// defined as all cells that collide with the boundary of any
+    /// part with higher part number.
+    ///
+    /// FIXME: Figure out whether this makes sense; a cell may collide
+    /// with the boundary of part j but may still be covered
+    /// completely by the domain of part j + 1. Possible solution is
+    /// to for each part i check overlapping parts starting from the
+    /// top and working back down to i + 1.
+    ///
+    /// *Arguments*
+    ///     part (std::size_t)
+    ///         The part number
+    ///
+    /// *Returns*
+    ///     std::vector<unsigned int>
+    ///         List of cut cell indices for given part
+    const std::vector<unsigned int>& cut_cells(std::size_t part) const;
+
+    /// Return the list of covered cells for given part. The covered
+    /// cells are defined as all cells that collide with the domain of
+    /// any part with higher part number, but not with the boundary of
+    /// that part; in other words cells that are completely covered by
+    /// any other part (and which therefore are inactive).
+    ///
+    /// *Arguments*
+    ///     part (std::size_t)
+    ///         The part number
+    ///
+    /// *Returns*
+    ///     std::vector<unsigned int>
+    ///         List of covered cell indices for given part
+    const std::vector<unsigned int>& covered_cells(std::size_t part) const;
+
+    /// Return the collision map for cut cells of the given part
+    ///
+    /// *Arguments*
+    ///     part (std::size_t)
+    ///         The part number
+    ///
+    /// *Returns*
+    ///     std::map<unsigned int, std::vector<std::pair<std::size_t, unsigned int> > >
+    ///         A map from cell indices of cut cells to a list of
+    ///         cutting cells. Each cutting cell is represented as a
+    ///         pair (part_number, cutting_cell_index).
+    const std::map<unsigned int,
+                   std::vector<std::pair<std::size_t, unsigned int> > >&
+    collision_map_cut_cells(std::size_t part) const;
+
+    /// Return quadrature rules for cut cells of the given part
+    ///
+    /// *Arguments*
+    ///     part (std::size_t)
+    ///         The part number
+    ///
+    /// *Returns*
+    ///     std::map<unsigned int, std::pair<std::vector<double>, std::vector<double> > >
+    ///         A map from cell indices of cut cells to a quadrature
+    ///         rules. Each quadrature rule is represented as a pair
+    ///         of an array of quadrature weights and a corresponding
+    ///         flattened array of quadrature points.
+    const std::map<unsigned int, std::pair<std::vector<double>, std::vector<double> > > &
+    quadrature_rule_cut_cells(std::size_t part) const;
+
+    /// Add function space (shared pointer version)
+    ///
+    /// *Arguments*
+    ///     function_space (_FunctionSpace_)
+    ///         The function space.
+    void add(std::shared_ptr<const FunctionSpace> function_space);
+
+    /// Add function space (reference version)
+    ///
+    /// *Arguments*
+    ///     function_space (_FunctionSpace_)
+    ///         The function space.
+    void add(const FunctionSpace& function_space);
+
+    /// Build CCFEM function space
+    void build();
+
+  private:
+
+    // List of function spaces
+    std::vector<std::shared_ptr<const FunctionSpace> > _function_spaces;
+
+    // CCFEM dofmap
+    std::shared_ptr<CCFEMDofMap> _dofmap;
+
+    // List of meshes
+    std::vector<std::shared_ptr<const Mesh> > _meshes;
+
+    // List of boundary meshes
+    std::vector<std::shared_ptr<BoundaryMesh> > _boundary_meshes;
+
+    // List of bounding box trees for meshes
+    std::vector<std::shared_ptr<BoundingBoxTree> > _trees;
+
+    // List of bounding box trees for boundary meshes
+    std::vector<std::shared_ptr<BoundingBoxTree> > _boundary_trees;
+
+    // Cell indices for all uncut cells for all parts. Access data by
+    //
+    //     c = _uncut_cells[i][j]
+    //
+    // where
+    //
+    //     c = cell index for an uncut cell
+    //     i = the part (mesh) number
+    //     j = the cell number (in the list of uncut cells)
+    std::vector<std::vector<unsigned int> > _uncut_cells;
+
+    // Cell indices for all cut cells for all parts. Access data by
+    //
+    //     c = _cut_cells[i][j]
+    //
+    // where
+    //
+    //     c = cell index for a cut cell
+    //     i = the part (mesh) number
+    //     j = the cell number (in the list of cut cells)
+    std::vector<std::vector<unsigned int> > _cut_cells;
+
+    // Cell indices for all covered cells for all parts. Access data by
+    //
+    //     c = _covered_cells[i][j]
+    //
+    // where
+    //
+    //     c = cell index for a covered cell
+    //     i = the part (mesh) number
+    //     j = the cell number (in the list of covered cells)
+    std::vector<std::vector<unsigned int> > _covered_cells;
+
+    // Developer note 1: The data structures _collision_map_cut_cells
+    // and _quadrature_rules_cut_cells may be changed from maps to
+    // vectors and indexed by the number of the cut cell (in the list
+    // of cut cells), instead of indexed by the local cell index as
+    // here, if we find that this is important for performance.
+    //
+    // Developer note 2: Quadrature points are naturally a part of a
+    // form (or a term in a form) and not a part of a mesh or function
+    // space. However, for now we use a global (to the function space)
+    // quadrature rule for all cut cells, for simplicity.
+
+    // Collision map for cut cells. Access data by
+    //
+    //     c = _collision_map_cut_cells[i][j][k]
+    //
+    // where
+    //
+    //     c.first  = part number for the cutting mesh
+    //     c.second = cell index for the cutting cell
+    //            i = the part (mesh) number
+    //            j = the cell number (local cell index)
+    //            k = the collision number (in the list of cutting cells)
+    std::vector<std::map<unsigned int,
+                         std::vector<std::pair<std::size_t, unsigned int> > > >
+    _collision_maps_cut_cells;
+
+    // Quadrature rules for cut cells. Access data by
+    //
+    //     q = _quadrature_rules_cut_cells[i][j]
+    //
+    // where
+    //
+    //     q.first  = quadrature weights, array of length num_points
+    //     q.second = quadrature points, flattened num_points x gdim array
+    //            i = the part (mesh) number
+    //            j = the cell number (local cell index)
+    std::vector<std::map<unsigned int,
+                         std::pair<std::vector<double>, std::vector<double> > > >
+    _quadrature_rules_cut_cells;
+
+    // Build dofmap
+    void _build_dofmap();
+
+    // Build boundary meshes
+    void _build_boundary_meshes();
+
+    // Build bounding box trees
+    void _build_bounding_box_trees();
+
+    // Build collision maps
+    void _build_collision_maps();
+
+    // Build quadrature rules
+    void _build_quadrature_rules();
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/CoefficientAssigner.cpp b/dolfin/function/CoefficientAssigner.cpp
new file mode 100644
index 0000000..2f716d9
--- /dev/null
+++ b/dolfin/function/CoefficientAssigner.cpp
@@ -0,0 +1,47 @@
+// Copyright (C) 2008-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Martin Alnes, 2008.
+//
+// First added:  2008-10-28
+// Last changed: 2009-10-04
+
+#include <memory>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/fem/Form.h>
+#include "CoefficientAssigner.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CoefficientAssigner::CoefficientAssigner(Form& form, std::size_t number)
+  : _form(form), _number(number)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+CoefficientAssigner::~CoefficientAssigner()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void CoefficientAssigner::operator= (const GenericFunction& coefficient)
+{
+  std::shared_ptr<const GenericFunction> c(&coefficient, NoDeleter());
+  _form.set_coefficient(_number, c);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/CoefficientAssigner.h b/dolfin/function/CoefficientAssigner.h
new file mode 100644
index 0000000..72e058d
--- /dev/null
+++ b/dolfin/function/CoefficientAssigner.h
@@ -0,0 +1,66 @@
+// Copyright (C) 2008-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-10-28
+// Last changed: 2009-10-04
+
+#ifndef __COEFFICIENT_ASSIGNER_H
+#define __COEFFICIENT_ASSIGNER_H
+
+#include <cstddef>
+
+namespace dolfin
+{
+
+  class Form;
+  class GenericFunction;
+
+  /// This class is used for assignment of coefficients to
+  /// forms, which allows magic like
+  ///
+  ///   a.f = f
+  ///   a.g = g
+  ///
+  /// which will insert the coefficients f and g in the correct
+  /// positions in the list of coefficients for the form.
+
+  class CoefficientAssigner
+  {
+  public:
+
+    /// Create coefficient assigner for coefficient with given number
+    CoefficientAssigner(Form& form, std::size_t number);
+
+    /// Destructor
+    ~CoefficientAssigner();
+
+    /// Assign coefficient
+    void operator= (const GenericFunction& coefficient);
+
+  private:
+
+    // The form
+    Form& _form;
+
+    // The number of the coefficient
+    std::size_t _number;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/Constant.cpp b/dolfin/function/Constant.cpp
new file mode 100644
index 0000000..c7a2f7d
--- /dev/null
+++ b/dolfin/function/Constant.cpp
@@ -0,0 +1,131 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Martin Sandve Alnes 2008
+// Modified by Garth N. Wells 2009-2011
+//
+// First added:  2006-02-09
+// Last changed: 2011-11-14
+
+#include <dolfin/log/log.h>
+#include "Constant.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Constant::Constant(double value)
+{
+  _values.resize(1);
+  _values[0] = value;
+}
+//-----------------------------------------------------------------------------
+Constant::Constant(double value0, double value1)
+  : Expression(2)
+{
+  _values.resize(2);
+  _values[0] = value0;
+  _values[1] = value1;
+}
+//-----------------------------------------------------------------------------
+Constant::Constant(double value0, double value1, double value2)
+  : Expression(3)
+{
+  _values.resize(3);
+  _values[0] = value0;
+  _values[1] = value1;
+  _values[2] = value2;
+}
+//-----------------------------------------------------------------------------
+Constant::Constant(std::vector<double> values)
+  : Expression(values.size()), _values(values)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Constant::Constant(std::vector<std::size_t> value_shape,
+                   std::vector<double> values)
+  : Expression(value_shape), _values(values)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Constant::Constant(const Constant& constant)
+  : Expression(constant)
+{
+  *this = constant;
+}
+//-----------------------------------------------------------------------------
+Constant::~Constant()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+const Constant& Constant::operator= (const Constant& constant)
+{
+  // Check value shape
+  if (constant._value_shape != _value_shape)
+  {
+    dolfin_error("Constant.cpp",
+                 "assign value to constant",
+                 "Value shape mismatch");
+  }
+
+  // Assign values
+  _values = constant._values;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const Constant& Constant::operator= (double constant)
+{
+  // Check value shape
+  if (!_value_shape.empty())
+  {
+    dolfin_error("Constant.cpp",
+                 "assign scalar value to constant",
+                 "Constant is not a scalar");
+  }
+
+  // Assign value
+  dolfin_assert(_values.size() == 1);
+  _values[0] = constant;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+Constant::operator double() const
+{
+  // Check value shape
+  if (!_value_shape.empty())
+  {
+    dolfin_error("Constant.cpp",
+                 "convert constant to double",
+                 "Constant is not a scalar");
+  }
+
+  // Return value
+  dolfin_assert(_values.size() == 1);
+  return _values[0];
+}
+//-----------------------------------------------------------------------------
+void Constant::eval(Array<double>& values, const Array<double>& x) const
+{
+  // Copy values
+  for (std::size_t j = 0; j < _values.size(); j++)
+    values[j] = _values[j];
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/Constant.h b/dolfin/function/Constant.h
new file mode 100644
index 0000000..ae140e0
--- /dev/null
+++ b/dolfin/function/Constant.h
@@ -0,0 +1,147 @@
+// Copyright (C) 2006-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Martin Sandve Alnes, 2008.
+// Modified by Garth N. Wells, 2008-2011.
+//
+// First added:  2006-02-09
+// Last changed: 2011-05-15
+
+#ifndef __CONSTANT_H
+#define __CONSTANT_H
+
+#include <vector>
+#include "Expression.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class represents a constant-valued expression.
+
+  class Constant : public Expression
+  {
+  public:
+
+    /// Create scalar constant
+    ///
+    /// *Arguments*
+    ///     value (double)
+    ///         The scalar to create a Constant object from.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Constant c(1.0);
+    ///
+    explicit Constant(double value);
+
+    /// Create vector constant (dim = 2)
+    ///
+    /// *Arguments*
+    ///     value0 (double)
+    ///         The first vector element.
+    ///     value1 (double)
+    ///         The second vector element.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Constant B(0.0, 1.0);
+    ///
+    Constant(double value0, double value1);
+
+    /// Create vector constant (dim = 3)
+    ///
+    /// *Arguments*
+    ///     value0 (double)
+    ///         The first vector element.
+    ///     value1 (double)
+    ///         The second vector element.
+    ///     value2 (double)
+    ///         The third vector element.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Constant T(0.0, 1.0, 0.0);
+    ///
+    Constant(double value0, double value1, double value2);
+
+    /// Create vector-valued constant
+    ///
+    /// *Arguments*
+    ///     values (std::vector<double>)
+    ///         Values to create a vector-valued constant from.
+    explicit Constant(std::vector<double> values);
+
+    /// Create tensor-valued constant for flattened array of values
+    ///
+    /// *Arguments*
+    ///     value_shape (std::vector<std::size_t>)
+    ///         Shape of tensor.
+    ///     values (std::vector<double>)
+    ///         Values to create tensor-valued constant from.
+    Constant(std::vector<std::size_t> value_shape,
+             std::vector<double> values);
+
+    /// Copy constructor
+    ///
+    /// *Arguments*
+    ///     constant (_Constant_)
+    ///         Object to be copied.
+    Constant(const Constant& constant);
+
+    /// Destructor
+    ~Constant();
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     constant (_Constant_)
+    ///         Another constant.
+    const Constant& operator= (const Constant& constant);
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     constant (double)
+    ///         Another constant.
+    const Constant& operator= (double constant);
+
+    /// Cast to double (for scalar constants)
+    ///
+    /// *Returns*
+    ///     double
+    ///         The scalar value.
+    operator double() const;
+
+    //--- Implementation of Expression interface ---
+
+    void eval(Array<double>& values, const Array<double>& x) const;
+
+  private:
+
+    // Values of constant function
+    std::vector<double> _values;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/Expression.cpp b/dolfin/function/Expression.cpp
new file mode 100644
index 0000000..363d99b
--- /dev/null
+++ b/dolfin/function/Expression.cpp
@@ -0,0 +1,146 @@
+// Copyright (C) 2009-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hake, 2009.
+//
+// First added:  2009-09-28
+// Last changed: 2011-11-14
+
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Vertex.h>
+#include "Expression.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Expression::Expression()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Expression::Expression(std::size_t dim)
+{
+  _value_shape.resize(1);
+  _value_shape[0] = dim;
+}
+//-----------------------------------------------------------------------------
+Expression::Expression(std::size_t dim0, std::size_t dim1)
+{
+  _value_shape.resize(2);
+  _value_shape[0] = dim0;
+  _value_shape[1] = dim1;
+}
+//-----------------------------------------------------------------------------
+Expression::Expression(std::vector<std::size_t> value_shape)
+  : _value_shape(value_shape)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Expression::Expression(const Expression& expression)
+  : _value_shape(expression._value_shape)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Expression::~Expression()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void Expression::eval(Array<double>& values,
+                      const Array<double>& x,
+                      const ufc::cell& cell) const
+{
+  // Redirect to simple eval
+  eval(values, x);
+}
+//-----------------------------------------------------------------------------
+void Expression::eval(Array<double>& values, const Array<double>& x) const
+{
+  dolfin_error("Expression.cpp",
+               "evaluate expression",
+               "Missing eval() function (must be overloaded)");
+}
+//-----------------------------------------------------------------------------
+std::size_t Expression::value_rank() const
+{
+  return _value_shape.size();
+}
+//-----------------------------------------------------------------------------
+std::size_t Expression::value_dimension(std::size_t i) const
+{
+  if (i >= _value_shape.size())
+  {
+    dolfin_error("Expression.cpp",
+                 "evaluate expression",
+                 "Illegal axis %d for value dimension for value of rank %d",
+                 i, _value_shape.size());
+  }
+  return _value_shape[i];
+}
+//-----------------------------------------------------------------------------
+void Expression::restrict(double* w,
+                          const FiniteElement& element,
+                          const Cell& dolfin_cell,
+                          const double* vertex_coordinates,
+                          const ufc::cell& ufc_cell) const
+{
+  // Restrict as UFC function (by calling eval)
+  restrict_as_ufc_function(w, element, dolfin_cell, vertex_coordinates,
+                           ufc_cell);
+}
+//-----------------------------------------------------------------------------
+void Expression::compute_vertex_values(std::vector<double>& vertex_values,
+                                       const Mesh& mesh) const
+{
+  // Local data for vertex values
+  const std::size_t size = value_size();
+  Array<double> local_vertex_values(size);
+
+  // Resize vertex_values
+  vertex_values.resize(size*mesh.num_vertices());
+
+  // Iterate over cells, overwriting values when repeatedly visiting vertices
+  ufc::cell ufc_cell;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Update cell data
+    cell->get_cell_data(ufc_cell);
+
+    // Iterate over cell vertices
+    for (VertexIterator vertex(*cell); !vertex.end(); ++vertex)
+    {
+      // Wrap coordinate data
+      const Array<double> x(mesh.geometry().dim(),
+                            const_cast<double*>(vertex->x()));
+
+      // Evaluate at vertex
+      eval(local_vertex_values, x, ufc_cell);
+
+      // Copy to array
+      for (std::size_t i = 0; i < size; i++)
+      {
+        const std::size_t global_index = i*mesh.num_vertices() + vertex->index();
+        vertex_values[global_index] = local_vertex_values[i];
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/Expression.h b/dolfin/function/Expression.h
new file mode 100644
index 0000000..214f11f
--- /dev/null
+++ b/dolfin/function/Expression.h
@@ -0,0 +1,168 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-28
+// Last changed: 2011-08-15
+
+#ifndef __EXPRESSION_H
+#define __EXPRESSION_H
+
+#include <vector>
+#include <ufc.h>
+#include <dolfin/common/Array.h>
+#include "GenericFunction.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class represents a user-defined expression. Expressions can
+  /// be used as coefficients in variational forms or interpolated
+  /// into finite element spaces.
+  ///
+  /// An expression is defined by overloading the eval() method. Users
+  /// may choose to overload either a simple version of eval(), in the
+  /// case of expressions only depending on the coordinate x, or an
+  /// optional version for expressions depending on x and mesh data
+  /// like cell indices or facet normals.
+  ///
+  /// The geometric dimension (the size of x) and the value rank and
+  /// dimensions of an expression must supplied as arguments to the
+  /// constructor.
+
+  class Expression : public GenericFunction
+  {
+
+  public:
+
+    /// Create scalar expression.
+    Expression();
+
+    /// Create vector-valued expression with given dimension.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         Dimension of the vector-valued expression.
+    explicit Expression(std::size_t dim);
+
+    /// Create matrix-valued expression with given dimensions.
+    ///
+    /// *Arguments*
+    ///     dim0 (std::size_t)
+    ///         Dimension (rows).
+    ///     dim1 (std::size_t)
+    ///         Dimension (columns).
+    Expression(std::size_t dim0, std::size_t dim1);
+
+    /// Create tensor-valued expression with given shape.
+    ///
+    /// *Arguments*
+    ///     value_shape (std::vector<std::size_t>)
+    ///         Shape of expression.
+    explicit Expression(std::vector<std::size_t> value_shape);
+
+    /// Copy constructor
+    ///
+    /// *Arguments*
+    ///     expression (_Expression_)
+    ///         Object to be copied.
+    Expression(const Expression& expression);
+
+    /// Destructor
+    virtual ~Expression();
+
+    //--- Implementation of GenericFunction interface ---
+    /// Note: The reimplementation of eval is needed for the Python interface.
+
+    /// Evaluate at given point in given cell.
+    ///
+    /// *Arguments*
+    ///     values (_Array_ <double>)
+    ///         The values at the point.
+    ///     x (_Array_ <double>)
+    ///         The coordinates of the point.
+    ///     cell (ufc::cell)
+    ///         The cell which contains the given point.
+    virtual void eval(Array<double>& values,
+                      const Array<double>& x,
+                      const ufc::cell& cell) const;
+
+    /// Evaluate at given point.
+    ///
+    /// *Arguments*
+    ///     values (_Array_ <double>)
+    ///         The values at the point.
+    ///     x (_Array_ <double>)
+    ///         The coordinates of the point.
+    virtual void eval(Array<double>& values, const Array<double>& x) const;
+
+    /// Return value rank.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The value rank.
+    virtual std::size_t value_rank() const;
+
+    /// Return value dimension for given axis.
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Integer denoting the axis to use.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The value dimension (for the given axis).
+    virtual std::size_t value_dimension(std::size_t i) const;
+
+    /// Restrict function to local cell (compute expansion coefficients w).
+    ///
+    /// *Arguments*
+    ///     w (list of doubles)
+    ///         Expansion coefficients.
+    ///     element (_FiniteElement_)
+    ///         The element.
+    ///     dolfin_cell (_Cell_)
+    ///         The cell.
+    ///     ufc_cell (ufc::cell)
+    ///         The ufc::cell.
+    virtual void restrict(double* w,
+                          const FiniteElement& element,
+                          const Cell& dolfin_cell,
+                          const double* vertex_coordinates,
+                          const ufc::cell& ufc_cell) const;
+
+    /// Compute values at all mesh vertices.
+    ///
+    /// *Arguments*
+    ///     vertex_values (_Array_ <double>)
+    ///         The values at all vertices.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    virtual void compute_vertex_values(std::vector<double>& vertex_values,
+                                       const Mesh& mesh) const;
+
+  protected:
+
+    // Value shape
+    std::vector<std::size_t> _value_shape;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/Function.cpp b/dolfin/function/Function.cpp
new file mode 100644
index 0000000..f63b61c
--- /dev/null
+++ b/dolfin/function/Function.cpp
@@ -0,0 +1,765 @@
+// Copyright (C) 2003-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2005-2010
+// Modified by Martin Sandve Alnes 2008
+// Modified by Andre Massing 2009
+//
+// First added:  2003-11-28
+// Last changed: 2013-10-25
+
+#include <algorithm>
+#include <map>
+#include <utility>
+#include <vector>
+#include <boost/assign/list_of.hpp>
+
+#include <dolfin/adaptivity/Extrapolation.h>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/utils.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/io/File.h>
+#include <dolfin/io/XMLFile.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/la/DefaultFactory.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/geometry/BoundingBoxTree.h>
+#include "Expression.h"
+#include "FunctionSpace.h"
+#include "Function.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Function::Function(const FunctionSpace& V)
+  : Hierarchical<Function>(*this),
+    _function_space(reference_to_no_delete_pointer(V)),
+    allow_extrapolation(dolfin::parameters["allow_extrapolation"])
+{
+  // Check that we don't have a subspace
+  if (!V.component().empty())
+  {
+    dolfin_error("Function.cpp",
+                 "create function",
+                 "Cannot be created from subspace. Consider collapsing the function space");
+  }
+
+  // Initialize vector
+  init_vector();
+}
+//-----------------------------------------------------------------------------
+Function::Function(std::shared_ptr<const FunctionSpace> V)
+  : Hierarchical<Function>(*this), _function_space(V),
+    allow_extrapolation(dolfin::parameters["allow_extrapolation"])
+{
+  // Check that we don't have a subspace
+  if (!V->component().empty())
+  {
+    dolfin_error("Function.cpp",
+                 "create function",
+                 "Cannot be created from subspace. Consider collapsing the function space");
+  }
+
+  // Initialize vector
+  init_vector();
+}
+//-----------------------------------------------------------------------------
+Function::Function(std::shared_ptr<const FunctionSpace> V,
+                   std::shared_ptr<GenericVector> x)
+  : Hierarchical<Function>(*this), _function_space(V), _vector(x),
+    allow_extrapolation(dolfin::parameters["allow_extrapolation"])
+{
+  // We do not check for a subspace since this constructor is used for
+  // creating subfunctions
+
+  // Assertion uses '<=' to deal with sub-functions
+  dolfin_assert(V->dofmap());
+  dolfin_assert(V->dofmap()->global_dimension() <= x->size());
+}
+//-----------------------------------------------------------------------------
+Function::Function(const FunctionSpace& V, std::string filename)
+  : Hierarchical<Function>(*this),
+    _function_space(reference_to_no_delete_pointer(V)),
+    allow_extrapolation(dolfin::parameters["allow_extrapolation"])
+{
+  // Check that we don't have a subspace
+  if (!V.component().empty())
+  {
+    dolfin_error("Function.cpp",
+                 "create function",
+                 "Cannot be created from subspace. Consider collapsing the function space");
+  }
+
+  // Initialize vector
+  init_vector();
+
+  // Check size of vector
+  if (_vector->size() != _function_space->dim())
+  {
+    dolfin_error("Function.cpp",
+                 "read function from file",
+                 "The number of degrees of freedom (%d) does not match dimension of function space (%d)",
+                 _vector->size(), _function_space->dim());
+  }
+
+  // Read function data from file
+  File file(filename);
+  file >> *this;
+}
+//-----------------------------------------------------------------------------
+Function::Function(std::shared_ptr<const FunctionSpace> V,
+                   std::string filename)
+  : Hierarchical<Function>(*this), _function_space(V),
+    allow_extrapolation(dolfin::parameters["allow_extrapolation"])
+{
+  // Check that we don't have a subspace
+  if (!V->component().empty())
+  {
+    dolfin_error("Function.cpp",
+                 "create function",
+                 "Cannot be created from subspace. Consider collapsing the function space");
+  }
+
+  // Initialize vector
+  init_vector();
+
+  // Check size of vector
+  if (_vector->size() != _function_space->dim())
+  {
+    dolfin_error("Function.cpp",
+                 "read function from file",
+                 "The number of degrees of freedom (%d) does not match dimension of function space (%d)",
+                 _vector->size(), _function_space->dim());
+  }
+
+  // Read function data from file
+  File file(filename);
+  file >> *this;
+}
+//-----------------------------------------------------------------------------
+Function::Function(const Function& v)
+  : Hierarchical<Function>(*this),
+    allow_extrapolation(dolfin::parameters["allow_extrapolation"])
+{
+  // Assign data
+  *this = v;
+}
+//-----------------------------------------------------------------------------
+Function::Function(const Function& v, std::size_t i)
+  : Hierarchical<Function>(*this),
+    allow_extrapolation(dolfin::parameters["allow_extrapolation"])
+{
+  // Copy function space pointer
+  this->_function_space = v[i]._function_space;
+
+  // Copy vector pointer
+  this->_vector = v[i]._vector;
+}
+//-----------------------------------------------------------------------------
+Function::~Function()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+const Function& Function::operator= (const Function& v)
+{
+  dolfin_assert(v._vector);
+
+  // Make a copy of all the data, or if v is a sub-function, then we
+  // collapse the dof map and copy only the relevant entries from the
+  // vector of v.
+  if (v._vector->size() == v._function_space->dim())
+  {
+    // Copy function space
+    _function_space = v._function_space;
+
+    // Copy vector
+    _vector = v._vector->copy();
+
+    // Clear subfunction cache
+    sub_functions.clear();
+  }
+  else
+  {
+    // Create new collapsed FunctionSpace
+    boost::unordered_map<std::size_t, std::size_t> collapsed_map;
+    _function_space = v._function_space->collapse(collapsed_map);
+
+    // Get row indices of original and new vectors
+    boost::unordered_map<std::size_t, std::size_t>::const_iterator entry;
+    std::vector<dolfin::la_index> new_rows(collapsed_map.size());
+    std::vector<dolfin::la_index> old_rows(collapsed_map.size());
+    std::size_t i = 0;
+    for (entry = collapsed_map.begin(); entry != collapsed_map.end(); ++entry)
+    {
+      new_rows[i]   = entry->first;
+      old_rows[i++] = entry->second;
+    }
+
+    // Gather values into a vector
+    std::vector<double> gathered_values;
+    dolfin_assert(v.vector());
+    v.vector()->gather(gathered_values, old_rows);
+
+    // Initial new vector (global)
+    init_vector();
+    dolfin_assert(_function_space->dofmap());
+    dolfin_assert(_vector->size()
+                  == _function_space->dofmap()->global_dimension());
+
+    // Set values in vector
+    this->_vector->set(gathered_values.data(), collapsed_map.size(),
+                       new_rows.data());
+    this->_vector->apply("insert");
+  }
+
+  // Call assignment operator for base class
+  Hierarchical<Function>::operator=(v);
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const Function& Function::operator= (const Expression& v)
+{
+  interpolate(v);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+Function& Function::operator[] (std::size_t i) const
+{
+  // Check if sub-Function is in the cache, otherwise create and add
+  // to cache
+  boost::ptr_map<std::size_t, Function>::iterator sub_function
+    = sub_functions.find(i);
+  if (sub_function != sub_functions.end())
+    return *(sub_function->second);
+  else
+  {
+    // Extract function subspace
+    std::vector<std::size_t> component = boost::assign::list_of(i);
+    std::shared_ptr<const FunctionSpace>
+      sub_space(_function_space->extract_sub_space(component));
+
+    // Insert sub-Function into map and return reference
+    sub_functions.insert(i, new Function(sub_space, _vector));
+    return *(sub_functions.find(i)->second);
+  }
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY Function::operator+(const Function& other) const
+{
+  return FunctionAXPY(*this, other, FunctionAXPY::ADD_ADD);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY Function::operator+(const FunctionAXPY& axpy) const
+{
+  return FunctionAXPY(axpy, *this, FunctionAXPY::ADD_ADD);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY Function::operator-(const Function& other) const
+{
+  return FunctionAXPY(*this, other, FunctionAXPY::ADD_SUB);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY Function::operator-(const FunctionAXPY& axpy) const
+{
+  return FunctionAXPY(axpy, *this, FunctionAXPY::SUB_ADD);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY Function::operator*(double scalar) const
+{
+  return FunctionAXPY(*this, scalar);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY Function::operator/(double scalar) const
+{
+  return FunctionAXPY(*this, 1.0/scalar);
+}
+//-----------------------------------------------------------------------------
+void Function::operator=(const FunctionAXPY& axpy)
+{
+  if (axpy.pairs().size() == 0)
+  {
+    dolfin_error("Function.cpp",
+                 "assign function",
+                 "FunctionAXPY is empty.");
+  }
+
+  // Make an initial assign and scale
+  *this = *(axpy.pairs()[0].second);
+  if (axpy.pairs()[0].first != 1.0)
+    *_vector *= axpy.pairs()[0].first;
+
+  // Start from item 2 and axpy
+  std::vector<std::pair<double, const Function*> >::const_iterator it;
+  for (it = axpy.pairs().begin()+1; it != axpy.pairs().end(); it++)
+    _vector->axpy(it->first, *(it->second->vector()));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FunctionSpace> Function::function_space() const
+{
+  dolfin_assert(_function_space);
+  return _function_space;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> Function::vector()
+{
+  dolfin_assert(_vector);
+  dolfin_assert(_function_space->dofmap());
+
+  // Check that this is not a sub function.
+  if (_vector->size() != _function_space->dofmap()->global_dimension())
+  {
+    dolfin_error("Function.cpp",
+                 "access vector of degrees of freedom",
+                 "Cannot access a non-const vector from a subfunction");
+  }
+
+  return _vector;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericVector> Function::vector() const
+{
+  dolfin_assert(_vector);
+  return _vector;
+}
+//-----------------------------------------------------------------------------
+bool Function::in(const FunctionSpace& V) const
+{
+  dolfin_assert(_function_space);
+  return *_function_space == V;
+}
+//-----------------------------------------------------------------------------
+std::size_t Function::geometric_dimension() const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->mesh());
+  return _function_space->mesh()->geometry().dim();
+}
+//-----------------------------------------------------------------------------
+void Function::eval(Array<double>& values, const Array<double>& x) const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+
+  // Find the cell that contains x
+  const double* _x = x.data();
+  const Point point(mesh.geometry().dim(), _x);
+
+  // FIXME: Testing
+  int ID = 0;
+
+  // Get index of first cell containing point
+  unsigned int id
+    = mesh.bounding_box_tree()->compute_first_entity_collision(point);
+
+  // If not found, use the closest cell
+  if (id == std::numeric_limits<unsigned int>::max())
+  {
+    if (allow_extrapolation)
+    {
+      id = mesh.bounding_box_tree()->compute_closest_entity(point).first;
+      cout << "Extrapolating function value at x = " << point
+           << " (not inside domain)." << endl;
+    }
+    else
+    {
+      dolfin_error("Function.cpp",
+                   "evaluate function at point",
+                   "The point is not inside the domain. Consider setting \"allow_extrapolation\" to allow extrapolation");
+    }
+  }
+
+  ID = id;
+
+  // Create cell that contains point
+  const Cell cell(mesh, ID);
+  ufc::cell ufc_cell;
+  cell.get_cell_data(ufc_cell);
+
+  // Call evaluate function
+  eval(values, x, cell, ufc_cell);
+}
+//-----------------------------------------------------------------------------
+void Function::eval(Array<double>& values, const Array<double>& x,
+                    const Cell& dolfin_cell, const ufc::cell& ufc_cell) const
+{
+  // Developer note: work arrays/vectors are re-created each time this
+  //                 function is called for thread-safety
+
+  dolfin_assert(_function_space->element());
+  const FiniteElement& element = *_function_space->element();
+
+  // Compute in tensor (one for scalar function, . . .)
+  const std::size_t value_size_loc = value_size();
+
+  dolfin_assert(values.size() == value_size_loc);
+
+  // Create work vector for expansion coefficients
+  std::vector<double> coefficients(element.space_dimension());
+
+  // Cell vertices (re-allocated inside function for thread safety)
+  std::vector<double> vertex_coordinates;
+  dolfin_cell.get_vertex_coordinates(vertex_coordinates);
+
+  // Restrict function to cell
+  restrict(coefficients.data(), element, dolfin_cell,
+           vertex_coordinates.data(), ufc_cell);
+
+  // Create work vector for basis
+  std::vector<double> basis(value_size_loc);
+
+  // Initialise values
+  for (std::size_t j = 0; j < value_size_loc; ++j)
+    values[j] = 0.0;
+
+  // Compute linear combination
+  for (std::size_t i = 0; i < element.space_dimension(); ++i)
+  {
+    element.evaluate_basis(i, basis.data(), x.data(),
+                           vertex_coordinates.data(),
+                           ufc_cell.orientation);
+    for (std::size_t j = 0; j < value_size_loc; ++j)
+      values[j] += coefficients[i]*basis[j];
+  }
+}
+//-----------------------------------------------------------------------------
+void Function::interpolate(const GenericFunction& v)
+{
+  dolfin_assert(_vector);
+  dolfin_assert(_function_space);
+
+  // Interpolate
+  _function_space->interpolate(*_vector, v);
+}
+//-----------------------------------------------------------------------------
+void Function::extrapolate(const Function& v)
+{
+  Extrapolation::extrapolate(*this, v);
+}
+//-----------------------------------------------------------------------------
+std::size_t Function::value_rank() const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->element());
+  return _function_space->element()->value_rank();
+}
+//-----------------------------------------------------------------------------
+std::size_t Function::value_dimension(std::size_t i) const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->element());
+  return _function_space->element()->value_dimension(i);
+}
+//-----------------------------------------------------------------------------
+void Function::eval(Array<double>& values,
+                    const Array<double>& x,
+                    const ufc::cell& ufc_cell) const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+
+  // Check if UFC cell comes from mesh, otherwise redirect to
+  // evaluate on non-matching cell
+  dolfin_assert(ufc_cell.mesh_identifier >= 0);
+  if (ufc_cell.mesh_identifier == (int) mesh.id())
+  {
+    const Cell cell(mesh, ufc_cell.index);
+    eval(values, x, cell, ufc_cell);
+  }
+  else
+    non_matching_eval(values, x, ufc_cell);
+}
+//-----------------------------------------------------------------------------
+void Function::non_matching_eval(Array<double>& values,
+                                 const Array<double>& x,
+                                 const ufc::cell& ufc_cell) const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+
+  const double* _x = x.data();
+  const std::size_t gdim = mesh.geometry().dim();
+  const Point point(gdim, _x);
+
+  // FIXME: Testing
+  int ID = 0;
+
+  // Alternative 1: Find cell that point (x) intersects
+  unsigned int id
+    = mesh.bounding_box_tree()->compute_first_entity_collision(point);
+
+  // Check whether we are allowed to extrapolate to evaluate
+  if (id == std::numeric_limits<unsigned int>::max() && !allow_extrapolation)
+  {
+    dolfin_error("Function.cpp",
+                 "evaluate function at point",
+                 "The point is not inside the domain. Consider setting \"allow_extrapolation\" to allow extrapolation");
+  }
+
+  // Alternative 2: Compute closest cell to point (x)
+  if (id == std::numeric_limits<unsigned int>::max() && allow_extrapolation)
+    id = mesh.bounding_box_tree()->compute_closest_entity(point).first;
+
+  // Throw error if all alternatives failed
+  if (id == std::numeric_limits<unsigned int>::max())
+  {
+    dolfin_error("Function.cpp",
+                 "evaluate function at point",
+                 "No matching cell found");
+  }
+
+  ID = id;
+
+  // Create cell that contains point
+  const Cell cell(mesh, ID);
+  ufc::cell new_ufc_cell;
+  cell.get_cell_data(new_ufc_cell);
+
+  // Call evaluate function
+  eval(values, x, cell, new_ufc_cell);
+}
+//-----------------------------------------------------------------------------
+void Function::restrict(double* w, const FiniteElement& element,
+                        const Cell& dolfin_cell,
+                        const double* vertex_coordinates,
+                        const ufc::cell& ufc_cell) const
+{
+  dolfin_assert(w);
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->dofmap());
+
+  // Check if we are restricting to an element of this function space
+  if (_function_space->has_element(element)
+      && _function_space->has_cell(dolfin_cell))
+  {
+    // Get dofmap for cell
+    const GenericDofMap& dofmap = *_function_space->dofmap();
+    const std::vector<dolfin::la_index>& dofs
+      = dofmap.cell_dofs(dolfin_cell.index());
+
+    if (dofs.size() > 0)
+    {
+      // Note: We should have dofmap.max_cell_dimension() == dofs.size() here.
+      // Pick values from vector(s)
+      _vector->get_local(w, dofs.size(), dofs.data());
+    }
+    else
+    {
+      // Set dofs to zero (zero extension of function space on a Restriction)
+      memset(w, 0, sizeof(*w)*dofmap.max_cell_dimension());
+    }
+  }
+  else
+  {
+    // Restrict as UFC function (by calling eval)
+    restrict_as_ufc_function(w, element, dolfin_cell, vertex_coordinates,
+                             ufc_cell);
+  }
+}
+//-----------------------------------------------------------------------------
+void Function::compute_vertex_values(std::vector<double>& vertex_values,
+                                     const Mesh& mesh) const
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->mesh());
+
+  // Check that the mesh matches. Notice that the hash is only
+  // compared if the pointers are not matching.
+  if (&mesh != _function_space->mesh().get()
+      && mesh.hash() != _function_space->mesh()->hash())
+  {
+    dolfin_error("Function.cpp",
+                 "interpolate function values at vertices",
+                 "Non-matching mesh");
+  }
+
+  // Get finite element
+  dolfin_assert(_function_space->element());
+  const FiniteElement& element = *_function_space->element();
+
+  // Get restriction if any
+  std::shared_ptr<const Restriction> restriction
+    = _function_space->dofmap()->restriction();
+
+  // Local data for interpolation on each cell
+  const std::size_t num_cell_vertices
+    = mesh.type().num_vertices(mesh.topology().dim());
+
+  // Compute in tensor (one for scalar function, . . .)
+  const std::size_t value_size_loc = value_size();
+
+  // Resize Array for holding vertex values
+  vertex_values.resize(value_size_loc*(mesh.num_vertices()));
+
+  // Create vector to hold cell vertex values
+  std::vector<double> cell_vertex_values(value_size_loc*num_cell_vertices);
+
+  // Create vector for expansion coefficients
+  std::vector<double> coefficients(element.space_dimension());
+
+  // Interpolate vertex values on each cell (using last computed value
+  // if not continuous, e.g. discontinuous Galerkin methods)
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Skip cells not included in restriction
+    if (restriction && !restriction->contains(*cell))
+      continue;
+
+    // Update to current cell
+    cell->get_vertex_coordinates(vertex_coordinates);
+    cell->get_cell_data(ufc_cell);
+
+    // Pick values from global vector
+    restrict(coefficients.data(), element, *cell, vertex_coordinates.data(),
+             ufc_cell);
+
+    // Interpolate values at the vertices
+    element.interpolate_vertex_values(cell_vertex_values.data(),
+                                      coefficients.data(),
+                                      vertex_coordinates.data(),
+                                      ufc_cell.orientation,
+                                      ufc_cell);
+
+    // Copy values to array of vertex values
+    for (VertexIterator vertex(*cell); !vertex.end(); ++vertex)
+    {
+      for (std::size_t i = 0; i < value_size_loc; ++i)
+      {
+        const std::size_t local_index  = vertex.pos()*value_size_loc + i;
+        const std::size_t global_index = i*mesh.num_vertices()+vertex->index();
+        vertex_values[global_index] = cell_vertex_values[local_index];
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void Function::compute_vertex_values(std::vector<double>& vertex_values)
+{
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->mesh());
+  compute_vertex_values(vertex_values, *_function_space->mesh());
+}
+//-----------------------------------------------------------------------------
+void Function::update() const
+{
+  deprecation("Function::update()", "1.4", "1.5",
+              "Calling Function::update to update ghost values is no longer required.");
+}
+//-----------------------------------------------------------------------------
+void Function::init_vector()
+{
+  Timer timer("Init dof vector");
+
+  // Check that function space is not a subspace (view)
+  dolfin_assert(_function_space);
+  if (_function_space->dofmap()->is_view())
+  {
+    dolfin_error("Function.cpp",
+                 "initialize vector of degrees of freedom for function",
+                 "Cannot be created from subspace. Consider collapsing the function space");
+  }
+
+  // Get global size
+  const std::size_t N = _function_space->dofmap()->global_dimension();
+
+  // Get local range
+  const std::pair<std::size_t, std::size_t> range
+    = _function_space->dofmap()->ownership_range();
+  const std::size_t local_size = range.second - range.first;
+
+  // Determine ghost vertices if dof map is distributed
+  std::vector<la_index> ghost_indices;
+  if (N > local_size)
+    compute_ghost_indices(range, ghost_indices);
+
+  // Create vector of dofs
+  if (!_vector)
+  {
+    DefaultFactory factory;
+    _vector = factory.create_vector();
+  }
+  dolfin_assert(_vector);
+
+  // Initialize vector of dofs
+  dolfin_assert(_function_space->mesh());
+  if (_vector->empty())
+    _vector->init(_function_space->mesh()->mpi_comm(), range, ghost_indices);
+  else
+  {
+    dolfin_error("Function.cpp",
+                 "initialize vector of degrees of freedom for function",
+                 "Cannot re-initialize a non-empty vector. Consider creating a new function");
+
+  }
+  _vector->zero();
+}
+//-----------------------------------------------------------------------------
+void
+Function::compute_ghost_indices(std::pair<std::size_t, std::size_t> range,
+                                std::vector<la_index>& ghost_indices) const
+{
+  // Clear data
+  ghost_indices.clear();
+
+  // Get mesh
+  dolfin_assert(_function_space);
+  dolfin_assert(_function_space->mesh());
+  const Mesh& mesh = *_function_space->mesh();
+
+  // Get dof map
+  dolfin_assert(_function_space->dofmap());
+  const GenericDofMap& dofmap = *_function_space->dofmap();
+
+  // Get local range
+  const std::size_t n0 = range.first;
+  const std::size_t n1 = range.second;
+
+  // Iterate over local mesh and check which dofs are needed
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Get dofs on cell
+    const std::vector<dolfin::la_index>& dofs = dofmap.cell_dofs(cell->index());
+    for (std::size_t d = 0; d < dofs.size(); ++d)
+    {
+      const std::size_t dof = dofs[d];
+      if (dof < n0 || dof >= n1)
+      {
+        // FIXME: Could we use dolfin::Set here? Or unordered_set?
+        if (std::find(ghost_indices.begin(), ghost_indices.end(), dof)
+            == ghost_indices.end())
+        {
+          ghost_indices.push_back(dof);
+        }
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/Function.h b/dolfin/function/Function.h
new file mode 100644
index 0000000..5ea7918
--- /dev/null
+++ b/dolfin/function/Function.h
@@ -0,0 +1,409 @@
+// Copyright (C) 2003-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2005-2010.
+// Modified by Kristian B. Oelgaard, 2007.
+// Modified by Martin Sandve Alnes, 2008.
+// Modified by Andre Massing, 2009.
+//
+// First added:  2003-11-28
+// Last changed: 2013-10-22
+
+#ifndef __FUNCTION_H
+#define __FUNCTION_H
+
+#include <memory>
+#include <utility>
+#include <vector>
+#include <boost/ptr_container/ptr_map.hpp>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/Hierarchical.h>
+#include "GenericFunction.h"
+#include "FunctionAXPY.h"
+
+namespace ufc
+{
+  // Forward declarations
+  class cell;
+}
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class DirichletBC;
+  class Expression;
+  class FunctionSpace;
+  class GenericVector;
+  class SubDomain;
+  template<typename T> class Array;
+
+  /// This class represents a function :math:`u_h` in a finite
+  /// element function space :math:`V_h`, given by
+  ///
+  /// .. math::
+  ///
+  ///     u_h = \sum_{i=1}^{n} U_i \phi_i
+  ///
+  /// where :math:`\{\phi_i\}_{i=1}^{n}` is a basis for :math:`V_h`,
+  /// and :math:`U` is a vector of expansion coefficients for :math:`u_h`.
+
+  class Function : public GenericFunction, public Hierarchical<Function>
+  {
+  public:
+
+    /// Create function on given function space
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Function u(V);
+    ///
+    explicit Function(const FunctionSpace& V);
+
+    /// Create function on given function space (shared data)
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    explicit Function(std::shared_ptr<const FunctionSpace> V);
+
+    /// Create function on given function space with a given vector
+    /// (shared data)
+    ///
+    /// *Warning: This constructor is intended for internal library use only*
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     x (_GenericVector_)
+    ///         The vector.
+    Function(std::shared_ptr<const FunctionSpace> V,
+             std::shared_ptr<GenericVector> x);
+
+    /// Create function from vector of dofs stored to file
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     filename_vector (std::string)
+    ///         The name of the file containing the vector.
+    ///     filename_dofdata (std::string)
+    ///         The name of the file containing the dofmap data.
+    Function(const FunctionSpace& V, std::string filename);
+
+    /// Create function from vector of dofs stored to file (shared data)
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///     filename_dofdata (std::string)
+    ///         The name of the file containing the dofmap data.
+    Function(std::shared_ptr<const FunctionSpace> V,
+             std::string filename);
+
+    /// Copy constructor
+    ///
+    /// *Arguments*
+    ///     v (_Function_)
+    ///         The object to be copied.
+    Function(const Function& v);
+
+    /// Sub-function constructor with shallow copy of vector (used in Python
+    /// interface)
+    ///
+    /// *Arguments*
+    ///     v (_Function_)
+    ///         The function to be copied.
+    ///     i (std::size_t)
+    ///         Index of subfunction.
+    ///
+    Function(const Function& v, std::size_t i);
+
+    /// Destructor
+    virtual ~Function();
+
+    /// Assignment from function
+    ///
+    /// *Arguments*
+    ///     v (_Function_)
+    ///         Another function.
+    const Function& operator= (const Function& v);
+
+    /// Assignment from expression using interpolation
+    ///
+    /// *Arguments*
+    ///     v (_Expression_)
+    ///         The expression.
+    const Function& operator= (const Expression& v);
+
+    /// Assignment from linear combination of function
+    ///
+    /// *Arguments*
+    ///     v (_FunctionAXPY_)
+    ///         A linear combination of other Functions
+    void operator=(const FunctionAXPY& axpy);
+
+    /// Extract subfunction
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Index of subfunction.
+    /// *Returns*
+    ///     _Function_
+    ///         The subfunction.
+    Function& operator[] (std::size_t i) const;
+
+    /// Add operator with other function
+    ///
+    /// *Returns*
+    ///     _FunctionAXPY_
+    ///         Return a linear combination of Functions
+    FunctionAXPY operator+(const Function& other) const;
+
+    /// Add operator with other linear combination of functions
+    ///
+    /// *Returns*
+    ///     _FunctionAXPY_
+    ///         Return a linear combination of Functions
+    FunctionAXPY operator+(const FunctionAXPY& axpy) const;
+
+    /// Substraction operator with other function
+    ///
+    /// *Returns*
+    ///     _FunctionAXPY_
+    ///         Return a linear combination of Functions
+    FunctionAXPY operator-(const Function& other) const;
+
+    /// Substraction operator with other linear combination of functions
+    ///
+    /// *Returns*
+    ///     _FunctionAXPY_
+    ///         Return a linear combination of Functions
+    FunctionAXPY operator-(const FunctionAXPY& axpy) const;
+
+    /// Scale operator
+    ///
+    /// *Returns*
+    ///     _FunctionAXPY_
+    ///         Return a linear combination of Functions
+    FunctionAXPY operator*(double scalar) const;
+
+    /// Scale operator
+    ///
+    /// *Returns*
+    ///     _FunctionAXPY_
+    ///         Return a linear combination of Functions
+    FunctionAXPY operator/(double scalar) const;
+
+    /// Return shared pointer to function space
+    ///
+    /// *Returns*
+    ///     _FunctionSpace_
+    ///         Return the shared pointer.
+    std::shared_ptr<const FunctionSpace> function_space() const;
+
+    /// Return vector of expansion coefficients (non-const version)
+    ///
+    /// *Returns*
+    ///     _GenericVector_
+    ///         The vector of expansion coefficients.
+    std::shared_ptr<GenericVector> vector();
+
+    /// Return vector of expansion coefficients (const version)
+    ///
+    /// *Returns*
+    ///     _GenericVector_
+    ///         The vector of expansion coefficients (const).
+    std::shared_ptr<const GenericVector> vector() const;
+
+    /// Check if function is a member of the given function space
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The function space.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the function is in the function space.
+    bool in(const FunctionSpace& V) const;
+
+    /// Return geometric dimension
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The geometric dimension.
+    std::size_t geometric_dimension() const;
+
+    /// Evaluate function at given coordinates
+    ///
+    /// *Arguments*
+    ///     values (_Array_ <double>)
+    ///         The values.
+    ///     x (_Array_ <double>)
+    ///         The coordinates.
+    void eval(Array<double>& values, const Array<double>& x) const;
+
+    /// Evaluate function at given coordinates in given cell
+    ///
+    /// *Arguments*
+    ///     values (_Array_ <double>)
+    ///         The values.
+    ///     x (_Array_ <double>)
+    ///         The coordinates.
+    ///     dolfin_cell (_Cell_)
+    ///         The cell.
+    ///     ufc_cell (ufc::cell)
+    ///         The ufc::cell.
+    void eval(Array<double>& values,
+              const Array<double>& x,
+              const Cell& dolfin_cell,
+              const ufc::cell& ufc_cell) const;
+
+    /// Interpolate function (on possibly non-matching meshes)
+    ///
+    /// *Arguments*
+    ///     v (_GenericFunction_)
+    ///         The function to be interpolated.
+    void interpolate(const GenericFunction& v);
+
+    /// Extrapolate function (from a possibly lower-degree function space)
+    ///
+    /// *Arguments*
+    ///     v (_Function_)
+    ///         The function to be extrapolated.
+    void extrapolate(const Function& v);
+
+    //--- Implementation of GenericFunction interface ---
+
+    /// Return value rank
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The value rank.
+    virtual std::size_t value_rank() const;
+
+    /// Return value dimension for given axis
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         The index of the axis.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The value dimension.
+    virtual std::size_t value_dimension(std::size_t i) const;
+
+    /// Evaluate at given point in given cell
+    ///
+    /// *Arguments*
+    ///     values (_Array_ <double>)
+    ///         The values at the point.
+    ///     x (_Array_ <double>)
+    ///         The coordinates of the point.
+    ///     cell (ufc::cell)
+    ///         The cell which contains the given point.
+    virtual void eval(Array<double>& values, const Array<double>& x,
+                      const ufc::cell& cell) const;
+
+    /// Evaluate function for given data (non-matching meshes)
+    ///
+    /// *Arguments*
+    ///     values (_Array_ <double>)
+    ///         The values at the point.
+    ///     x (_Array_ <double>)
+    ///         The coordinates of the point.
+    ///     cell (ufc::cell)
+    ///         The cell.
+    void non_matching_eval(Array<double>& values, const Array<double>& x,
+                           const ufc::cell& ufc_cell) const;
+
+    /// Restrict function to local cell (compute expansion coefficients w)
+    ///
+    /// *Arguments*
+    ///     w (list of doubles)
+    ///         Expansion coefficients.
+    ///     element (_FiniteElement_)
+    ///         The element.
+    ///     dolfin_cell (_Cell_)
+    ///         The cell.
+    ///     ufc_cell (ufc::cell).
+    ///         The ufc::cell.
+    virtual void restrict(double* w,
+                          const FiniteElement& element,
+                          const Cell& dolfin_cell,
+                          const double* vertex_coordinates,
+                          const ufc::cell& ufc_cell) const;
+
+    /// Compute values at all mesh vertices
+    ///
+    /// *Arguments*
+    ///     vertex_values (_Array_ <double>)
+    ///         The values at all vertices.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    virtual void compute_vertex_values(std::vector<double>& vertex_values,
+                                       const Mesh& mesh) const;
+
+    /// Compute values at all mesh vertices
+    ///
+    /// *Arguments*
+    ///     vertex_values (_Array_ <double>)
+    ///         The values at all vertices.
+    void compute_vertex_values(std::vector<double>& vertex_values);
+
+    /// Update off-process ghost coefficients
+    virtual void update() const;
+
+  private:
+
+    // Friends
+    friend class FunctionSpace;
+    friend class FunctionAssigner;
+
+    // Collection of sub-functions which share data with the function
+    mutable boost::ptr_map<std::size_t, Function> sub_functions;
+
+    // Compute lists of off-process dofs
+    void compute_off_process_dofs() const;
+
+    // Initialize vector
+    void init_vector();
+
+    // Get coefficients from the vector(s)
+    void compute_ghost_indices(std::pair<std::size_t, std::size_t> range,
+                               std::vector<la_index>& ghost_indices) const;
+
+    // The function space
+    std::shared_ptr<const FunctionSpace> _function_space;
+
+    // The vector of expansion coefficients (local)
+    std::shared_ptr<GenericVector> _vector;
+
+    // True if extrapolation should be allowed
+    bool allow_extrapolation;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/FunctionAXPY.cpp b/dolfin/function/FunctionAXPY.cpp
new file mode 100644
index 0000000..16e5156
--- /dev/null
+++ b/dolfin/function/FunctionAXPY.cpp
@@ -0,0 +1,141 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-11
+// Last changed: 2013-02-15
+
+#include <dolfin/log/log.h>
+#include "Function.h"
+#include "FunctionSpace.h"
+#include "FunctionAXPY.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+FunctionAXPY::FunctionAXPY(const Function& func, double scalar) : _pairs()
+{
+  _pairs.push_back(std::make_pair(scalar, &func));
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY::FunctionAXPY(const FunctionAXPY& axpy, double scalar) : _pairs()
+{
+  _register(axpy, scalar);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY::FunctionAXPY(const Function& func0, const Function& func1,
+			   Direction direction) : _pairs()
+{
+  if (!func0.in(*func1.function_space()))
+  {
+    dolfin_error("FunctionAXPY.cpp",
+                 "Construct FunctionAXPY",
+                 "Expected Functions to be in the same FunctionSpace");
+  }
+
+  const double scale0 = direction % 2 == 0 ? 1.0 : -1.0;
+  _pairs.push_back(std::make_pair(scale0, &func0));
+
+  const double scale1 = direction < 2 ? 1.0 : -1.0;
+  _pairs.push_back(std::make_pair(scale1, &func1));
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY::FunctionAXPY(const FunctionAXPY& axpy, const Function& func,
+			   Direction direction) : _pairs()
+{
+  _register(axpy, direction % 2 == 0 ? 1.0 : -1.0);
+
+  if (_pairs.size()>0 && !_pairs[0].second->in(*func.function_space()))
+  {
+    dolfin_error("FunctionAXPY.cpp",
+                 "Construct FunctionAXPY",
+                 "Expected Functions to have the same FunctionSpace");
+  }
+
+  const double scale = direction < 2 ? 1.0 : -1.0;
+  _pairs.push_back(std::make_pair(scale, &func));
+
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY::FunctionAXPY(const FunctionAXPY& axpy0,
+                           const FunctionAXPY& axpy1,
+			   Direction direction) : _pairs()
+{
+  _register(axpy0, direction % 2 == 0 ? 1.0 : -1.0);
+  _register(axpy1, direction < 2 ? 1.0 : -1.0);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY::FunctionAXPY(const FunctionAXPY& axpy) :
+  _pairs(axpy._pairs)
+{}
+//-----------------------------------------------------------------------------
+FunctionAXPY::FunctionAXPY(std::vector<std::pair<double, const Function*> > pairs) :
+  _pairs(pairs)
+{}
+//-----------------------------------------------------------------------------
+FunctionAXPY FunctionAXPY::operator+(const Function& func) const
+{
+  return FunctionAXPY(*this, func, FunctionAXPY::ADD_ADD);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY FunctionAXPY::operator+(const FunctionAXPY& axpy) const
+{
+  return FunctionAXPY(*this, axpy, FunctionAXPY::ADD_ADD);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY FunctionAXPY::operator-(const Function& func) const
+{
+  return FunctionAXPY(*this, func, FunctionAXPY::ADD_SUB);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY FunctionAXPY::operator-(const FunctionAXPY& axpy) const
+{
+  return FunctionAXPY(*this, axpy, FunctionAXPY::ADD_SUB);
+}
+//-----------------------------------------------------------------------------
+const std::vector<std::pair<double, const Function*> >&
+FunctionAXPY::pairs() const
+{
+  return _pairs;
+}
+//-----------------------------------------------------------------------------
+void FunctionAXPY::_register(const FunctionAXPY& axpy, double scale)
+{
+  if (_pairs.size() > 0 && axpy._pairs.size() > 0
+      &&!_pairs[0].second->in(*axpy._pairs[0].second->function_space()))
+  {
+    dolfin_error("FunctionAXPY.cpp",
+                 "Construct FunctionAXPY",
+                 "Expected Functions to have the same FunctionSpace");
+  }
+
+  for (std::vector<std::pair<double, const Function*> >::const_iterator
+	 it=axpy.pairs().begin(); it!=axpy.pairs().end(); it++)
+  {
+    _pairs.push_back(std::make_pair(it->first*scale, it->second));
+  }
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY FunctionAXPY::operator*(double scale) const
+{
+  return FunctionAXPY(*this, scale);
+}
+//-----------------------------------------------------------------------------
+FunctionAXPY FunctionAXPY::operator/(double scale) const
+{
+  return FunctionAXPY(*this, 1.0/scale);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/FunctionAXPY.h b/dolfin/function/FunctionAXPY.h
new file mode 100644
index 0000000..b0c6767
--- /dev/null
+++ b/dolfin/function/FunctionAXPY.h
@@ -0,0 +1,105 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-11
+// Last changed: 2013-02-14
+
+#ifndef __FUNCTION_AXPY_H
+#define __FUNCTION_AXPY_H
+
+#include <utility>
+#include <vector>
+
+namespace dolfin
+{
+
+  class Function;
+
+  /// This class represents a linear combination of functions. It is
+  /// mostly used as an intermediate class for operations such as u =
+  /// 3*u0 + 4*u1; where the rhs generates an FunctionAXPY.
+  class FunctionAXPY
+  {
+
+  public:
+
+    /// Enum to decide what way AXPY is constructed
+    enum Direction
+    {
+      ADD_ADD = 0,
+      SUB_ADD = 1,
+      ADD_SUB = 2,
+      SUB_SUB = 3
+    };
+
+    /// Constructor
+    FunctionAXPY(const Function& func, double scalar);
+
+    /// Constructor
+    FunctionAXPY(const FunctionAXPY& axpy, double scalar);
+
+    /// Constructor
+    FunctionAXPY(const Function& func0, const Function& func1,
+                 Direction direction);
+
+    /// Constructor
+    FunctionAXPY(const FunctionAXPY& axpy, const Function& func,
+                 Direction direction);
+
+    /// Constructor
+    FunctionAXPY(const FunctionAXPY& axpy0, const FunctionAXPY& axpy1,
+                 Direction direction);
+
+    /// Constructor
+    FunctionAXPY(std::vector<std::pair<double, const Function*> > pairs);
+
+    /// Copy constructor
+    FunctionAXPY(const FunctionAXPY& axpy);
+
+    /// Addition operator
+    FunctionAXPY operator+(const Function& func) const;
+
+    /// Addition operator
+    FunctionAXPY operator+(const FunctionAXPY& axpy) const;
+
+    /// Substraction operator
+    FunctionAXPY operator-(const Function& func) const;
+
+    /// Substraction operator
+    FunctionAXPY operator-(const FunctionAXPY& axpy) const;
+
+    /// Scale operator
+    FunctionAXPY operator*(double scale) const;
+
+    /// Scale operator
+    FunctionAXPY operator/(double scale) const;
+
+    /// Return the scalar and Function pairs
+    const std::vector<std::pair<double, const Function*> >& pairs() const;
+
+  private:
+
+    /// Register another AXPY object
+    void _register(const FunctionAXPY& axpy0, double scale);
+
+    std::vector<std::pair<double, const Function*> > _pairs;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/FunctionAssigner.cpp b/dolfin/function/FunctionAssigner.cpp
new file mode 100644
index 0000000..132d2de
--- /dev/null
+++ b/dolfin/function/FunctionAssigner.cpp
@@ -0,0 +1,485 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-20
+// Last changed: 2014-02-28
+
+#include <utility>
+
+#include <map>
+#include <dolfin/common/types.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericVector.h>
+#include "FunctionAssigner.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+FunctionAssigner::FunctionAssigner(std::shared_ptr<const FunctionSpace> receiving_space,
+				   std::shared_ptr<const FunctionSpace> assigning_space)
+  : _receiving_spaces(1, receiving_space),_assigning_spaces(1, assigning_space),
+    _receiving_indices(1), _assigning_indices(1), _transfer(1)
+{
+  // Get mesh
+  const Mesh& mesh = _get_mesh();
+
+  // Build vectors of indices
+  _check_and_build_indices(mesh, _receiving_spaces, _assigning_spaces);
+}
+//-----------------------------------------------------------------------------
+FunctionAssigner::FunctionAssigner(std::vector<std::shared_ptr<const FunctionSpace> > receiving_spaces,
+	           std::shared_ptr<const FunctionSpace> assigning_space)
+  : _receiving_spaces(receiving_spaces), _assigning_spaces(1, assigning_space),
+    _receiving_indices(receiving_spaces.size()),
+    _assigning_indices(receiving_spaces.size()),
+    _transfer(receiving_spaces.size())
+{
+  // Get mesh
+  const Mesh& mesh = _get_mesh();
+
+  // Check that the number of assigning subspaces are the same as number
+  // of receiving spaces
+  const std::size_t N = _receiving_spaces.size();
+  dolfin_assert(_assigning_spaces[0]);
+  if (_assigning_spaces[0]->element()->num_sub_elements() != N)
+  {
+    dolfin_error("FunctionAssigner.cpp",
+		 "create function assigner",
+		 "Expected the same number of sub spaces in the assigning " \
+		 "FunctionSpace as the number of receiving FunctionSpaces");
+  }
+
+  // Collect assigning sub spaces
+  std::vector<std::shared_ptr<const FunctionSpace> > assigning_sub_spaces;
+  for (std::size_t sub_space_ind = 0; sub_space_ind < N; sub_space_ind++)
+    assigning_sub_spaces.push_back((*_assigning_spaces[0])[sub_space_ind]);
+
+  // Build vectors of indices
+  _check_and_build_indices(mesh, _receiving_spaces, assigning_sub_spaces);
+
+}
+//-----------------------------------------------------------------------------
+FunctionAssigner::FunctionAssigner(std::shared_ptr<const FunctionSpace> receiving_space,
+				   std::vector<std::shared_ptr<const FunctionSpace> > assigning_spaces)
+  :_receiving_spaces(1, receiving_space), _assigning_spaces(assigning_spaces),
+   _receiving_indices(assigning_spaces.size()),
+   _assigning_indices(assigning_spaces.size()),
+   _transfer(assigning_spaces.size())
+{
+  // Get mesh
+  const Mesh& mesh = _get_mesh();
+
+  // Check that the number of receiving subspaces are the same as number
+  // of assigning spaces
+  const std::size_t N = assigning_spaces.size();
+  dolfin_assert(_receiving_spaces[0]);
+  if (_receiving_spaces[0]->element()->num_sub_elements()!=N)
+  {
+    dolfin_error("FunctionAssigner.cpp",
+		 "create function assigner",
+		 "Expected the same number of sub spaces in the receiving "\
+		 "FunctionSpace as the number of assigning FunctionSpaces");
+  }
+
+  // Collect receiving sub spaces
+  std::vector<std::shared_ptr<const FunctionSpace> > receiving_sub_spaces;
+  for (std::size_t sub_space_ind = 0; sub_space_ind < N; sub_space_ind++)
+    receiving_sub_spaces.push_back((*_receiving_spaces[0])[sub_space_ind]);
+
+  // Build vectors of indices
+  _check_and_build_indices(mesh, receiving_sub_spaces, _assigning_spaces);
+}
+//-----------------------------------------------------------------------------
+FunctionAssigner::~FunctionAssigner()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void
+FunctionAssigner::assign(std::shared_ptr<Function> receiving_func,
+                         std::shared_ptr<const Function> assigning_func) const
+{
+  // Wrap functions
+  std::vector<std::shared_ptr<Function> > receiving_funcs(1, receiving_func);
+  std::vector<std::shared_ptr<const Function> >
+    assigning_funcs(1, assigning_func);
+
+  // Do the assignment
+  _assign(receiving_funcs, assigning_funcs);
+}
+//-----------------------------------------------------------------------------
+void FunctionAssigner::assign(std::shared_ptr<Function> receiving_func,
+      std::vector<std::shared_ptr<const Function> > assigning_funcs) const
+{
+  // Num assigning functions
+  const std::size_t N = assigning_funcs.size();
+  if (receiving_func->function_space()->element()->num_sub_elements() != N)
+  {
+    dolfin_error("FunctionAssigner.cpp",
+		 "assigning functions",
+		 "Expected the same number of sub functions in the receiving "\
+		 "Function as the number of assigning Functions");
+  }
+
+  // Collect receiving sub functions
+  std::vector<std::shared_ptr<Function> > receiving_funcs(0);
+  for (std::size_t i = 0; i < N; i++)
+  {
+    std::shared_ptr<Function>
+      func(reference_to_no_delete_pointer((*receiving_func)[i]));
+    receiving_funcs.push_back(func);
+  }
+
+  // Do the assignment
+  _assign(receiving_funcs, assigning_funcs);
+}
+//-----------------------------------------------------------------------------
+void FunctionAssigner::assign(std::vector<std::shared_ptr<Function> > receiving_funcs,
+			      std::shared_ptr<const Function> assigning_func) const
+{
+  // Num receiving functions
+  const std::size_t N = receiving_funcs.size();
+  if (assigning_func->function_space()->element()->num_sub_elements() != N)
+  {
+    dolfin_error("FunctionAssigner.cpp",
+		 "assigning functions",
+		 "Expected the same number of sub functions in the assigning "\
+		 "Function as the number of receiving Functions");
+  }
+
+  // Collect receiving sub functions
+  std::vector<std::shared_ptr<const Function> > assigning_funcs(0);
+  for (std::size_t i = 0; i < N; i++)
+  {
+    std::shared_ptr<const Function>
+      func(reference_to_no_delete_pointer((*assigning_func)[i]));
+    assigning_funcs.push_back(func);
+  }
+
+  // Do the assignment
+  _assign(receiving_funcs, assigning_funcs);
+}
+//-----------------------------------------------------------------------------
+void FunctionAssigner::_assign(std::vector<std::shared_ptr<Function> > receiving_funcs,
+			       std::vector<std::shared_ptr<const Function> > assigning_funcs) const
+{
+  // Num spaces
+  const std::size_t N = std::max(_assigning_spaces.size(),
+                                 _receiving_spaces.size());
+
+  if (assigning_funcs.size() != N)
+  {
+    dolfin_error("FunctionAssigner.cpp",
+		 "assign functions",
+		 "Expected the same number of assigning (sub)functions as "
+		 "the number of assigning (sub)spaces.");
+  }
+
+  if (receiving_funcs.size() != N)
+  {
+    dolfin_error("FunctionAssigner.cpp",
+		 "assign functions",
+		 "Expected the same number of receiving (sub)functions as "
+		 "the number of receiving (sub)spaces.");
+  }
+
+  // Flag to determine if the receiving vector is the same
+  bool same_receiving_vector = true;
+  const GenericVector* recieving_vector = receiving_funcs[0]->_vector.get();
+
+  // Iterate over the spaces and do the assignments
+  for (std::size_t i = 0; i < N; i++)
+  {
+    // Check that the functions are in the FunctionAssigner spaces
+    if (_receiving_spaces.size() == 1)
+    {
+
+      dolfin_assert(_receiving_spaces[0]);
+
+      // Check 1-1 assignment
+      if (_assigning_spaces.size() == 1)
+      {
+
+	dolfin_assert(receiving_funcs[0]);
+
+	if (!receiving_funcs[0]->in(*_receiving_spaces[0]))
+	{
+	  dolfin_error("FunctionAssigner.cpp",
+		       "assign functions",
+		       "The receiving Function is not in the receiving FunctionSpaces");
+	}
+      }
+
+      // Check N-1 assignment
+      else
+      {
+
+	dolfin_assert(receiving_funcs[i]);
+	dolfin_assert((*_receiving_spaces[0])[i]);
+
+	if (!receiving_funcs[i]->in(*(*_receiving_spaces[0])[i]))
+	{
+	  dolfin_error("FunctionAssigner.cpp",
+		       "assign functions",
+		       "The receiving sub Functions are not in the receiving sub FunctionSpaces");
+	}
+      }
+    }
+    else
+    {
+
+      // Check 1-N assignment
+      if (!receiving_funcs[i]->in(*_receiving_spaces[i]))
+      {
+	dolfin_error("FunctionAssigner.cpp",
+		     "assign functions",
+		     "The receiving Functions are not in the receiving FunctionSpaces");
+      }
+    }
+
+    if (_assigning_spaces.size() == 1)
+    {
+
+      dolfin_assert(_assigning_spaces[0]);
+
+      // Check 1-1 assignment
+      if (_receiving_spaces.size() == 1)
+      {
+
+	dolfin_assert(assigning_funcs[0]);
+
+	if (!assigning_funcs[0]->in(*_assigning_spaces[0]))
+	{
+	  dolfin_error("FunctionAssigner.cpp",
+		       "assign functions",
+		       "The assigning Function is not in the assigning FunctionSpaces");
+	}
+      }
+
+      // Check 1-N assignment
+      else
+      {
+
+	dolfin_assert(assigning_funcs[i]);
+	dolfin_assert((*_assigning_spaces[0])[i]);
+
+	if (!assigning_funcs[i]->in(*(*_assigning_spaces[0])[i]))
+	{
+	  dolfin_error("FunctionAssigner.cpp",
+		       "assign functions",
+		       "The assigning sub Functions are not in the assigning sub FunctionSpaces");
+	}
+      }
+    }
+    else
+    {
+
+      dolfin_assert(assigning_funcs[i]);
+      dolfin_assert(_assigning_spaces[i]);
+
+      // Check N-1 assignment
+      if (!assigning_funcs[i]->in(*_assigning_spaces[i]))
+      {
+	dolfin_error("FunctionAssigner.cpp",
+		     "assign function",
+		     "The assigning Functions are not in the assigning FunctionSpaces");
+      }
+    }
+
+    // Check if the receiving vector is the same
+    if (i != 0)
+    {
+      dolfin_assert(receiving_funcs[i]->_vector);
+      same_receiving_vector
+        = (recieving_vector!=receiving_funcs[i]->_vector.get())
+	&& same_receiving_vector;
+    }
+
+    // Get assigning values
+    assigning_funcs[i]->_vector->get_local(&_transfer[i][0],
+                                           _transfer[i].size(),
+					   &_assigning_indices[i][0]);
+
+    // Set receiving values
+    receiving_funcs[i]->_vector->set(&_transfer[i][0], _transfer[i].size(),
+                                     &_receiving_indices[i][0]);
+
+    // If not same receiving vector
+    if (!same_receiving_vector)
+      receiving_funcs[i]->_vector->apply("insert");
+  }
+
+  // If same receiving vector
+  if (same_receiving_vector)
+    receiving_funcs[0]->_vector->apply("insert");
+}
+//-----------------------------------------------------------------------------
+const Mesh& FunctionAssigner::_get_mesh() const
+{
+  // Check for empty space vectors
+  if (_assigning_spaces.size() == 0)
+  {
+   dolfin_error("FunctionAssigner.cpp",
+                 "create function assigner",
+                 "Expected at least one FunctionSpace for the assigning spaces");
+  }
+
+  if (_receiving_spaces.size()==0)
+  {
+    dolfin_error("FunctionAssigner.cpp",
+                 "create function assigner",
+                 "Expected at least one FunctionSpace for the receiving spaces");
+  }
+
+  // Get mesh
+  dolfin_assert(_assigning_spaces[0]);
+  dolfin_assert(_assigning_spaces[0]->mesh());
+  const Mesh& mesh = *_assigning_spaces[0]->mesh();
+
+  // Check that function spaces uses the same mesh.
+  for (std::size_t i = 1; i < _assigning_spaces.size(); i++)
+  {
+    // Compare pointers
+    dolfin_assert(_assigning_spaces[i]);
+    dolfin_assert(_assigning_spaces[i]->mesh());
+    if (&mesh != _assigning_spaces[i]->mesh().get())
+    {
+      dolfin_error("FunctionAssigner.cpp",
+		   "create function assigner",
+		   "Expected all FunctionSpaces to be defined over the same Mesh");
+    }
+  }
+
+  for (std::size_t i = 0; i < _receiving_spaces.size(); i++)
+  {
+    // Compare pointers
+    dolfin_assert(_receiving_spaces[i]);
+    dolfin_assert(_receiving_spaces[i]->mesh());
+    if (&mesh != _receiving_spaces[i]->mesh().get())
+    {
+      dolfin_error("FunctionAssigner.cpp",
+		   "create function assigner",
+		   "Expected all FunctionSpaces to be defined over the same Mesh");
+    }
+  }
+
+  // Return checked mesh
+  return mesh;
+}
+//-----------------------------------------------------------------------------
+void FunctionAssigner::_check_and_build_indices(const Mesh& mesh,
+	  const std::vector<std::shared_ptr<const FunctionSpace> >& receiving_spaces,
+	  const std::vector<std::shared_ptr<const FunctionSpace> >& assigning_spaces)
+{
+
+  // Num spaces
+  const std::size_t N = receiving_spaces.size();
+
+  // Check num entity dofs for the receiving and assigning spaces corresponds
+  for (std::size_t i = 0; i < N; i++)
+  {
+    // Iterate over all entity dimensions
+    for (std::size_t entity_dim=0; entity_dim < mesh.topology().dim();
+         entity_dim++)
+    {
+
+      // Check num entity dofs for assigning spaces
+      if (assigning_spaces[i]->dofmap()->num_entity_dofs(entity_dim)
+          != receiving_spaces[i]->dofmap()->num_entity_dofs(entity_dim))
+      {
+	dolfin_error("FunctionAssigner.cpp",
+		     "create function assigner",
+		     "The assigning and receiving FunctionSpaces have incompatible"
+		     " number of entity dofs for entity %d and space no: %d",
+		     entity_dim, i);
+      }
+    }
+  }
+
+  dolfin_assert(_receiving_indices.size()==N);
+  dolfin_assert(_assigning_indices.size()==N);
+
+  // Iterate over all spaces and collect dofs
+  for (std::size_t i = 0; i < N; i++)
+  {
+    // Get dofmaps
+    dolfin_assert(assigning_spaces[i]);
+    dolfin_assert(assigning_spaces[i]->dofmap());
+    const GenericDofMap& assigning_dofmap = *assigning_spaces[i]->dofmap();
+
+    dolfin_assert(receiving_spaces[i]);
+    dolfin_assert(receiving_spaces[i]->dofmap());
+    const GenericDofMap& receiving_dofmap = *receiving_spaces[i]->dofmap();
+
+    // Get on-process dof ranges
+    const std::size_t assigning_n0 = assigning_dofmap.ownership_range().first;
+    const std::size_t assigning_n1 = assigning_dofmap.ownership_range().second;
+    const std::size_t receiving_n0 = receiving_dofmap.ownership_range().first;
+    const std::size_t receiving_n1 = receiving_dofmap.ownership_range().second;
+
+    // Create a map between receiving and assigning dofs
+    std::map<std::size_t, std::size_t> receiving_assigning_map;
+
+    // Iterate over cells and collect cell dofs
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      // Get local cell dofs
+      const std::vector<dolfin::la_index>& assigning_cell_dofs
+        = assigning_dofmap.cell_dofs(cell->index());
+      const std::vector<dolfin::la_index>& receiving_cell_dofs
+        = receiving_dofmap.cell_dofs(cell->index());
+
+      // Check that both spaces have the same number of dofs
+      if (assigning_cell_dofs.size()!=receiving_cell_dofs.size())
+      {
+	dolfin_error("FunctionAssigner.cpp",
+		     "create function assigner",
+		     "The receiving and assigning spaces do not have the same "
+		     "number of dofs per cell");
+      }
+
+      // Iterate over the local dofs and collect on-process dofs
+      for (std::size_t j=0; j<assigning_cell_dofs.size(); j++)
+      {
+	const std::size_t assigning_dof = assigning_cell_dofs[j];
+	const std::size_t receiving_dof = receiving_cell_dofs[j];
+	if (assigning_dof >= assigning_n0 && assigning_dof < assigning_n1 &&
+	    receiving_dof >= receiving_n0 && receiving_dof < receiving_n1)
+	  receiving_assigning_map[receiving_dof] = assigning_dof;
+      }
+    }
+
+    // Transfer dofs to contiguous vectors
+    _assigning_indices[i].reserve(receiving_assigning_map.size());
+    _receiving_indices[i].reserve(receiving_assigning_map.size());
+
+    std::map<std::size_t, std::size_t>::const_iterator it;
+    for (it = receiving_assigning_map.begin(); it != receiving_assigning_map.end(); ++it)
+    {
+      _receiving_indices[i].push_back(it->first);
+      _assigning_indices[i].push_back(it->second);
+    }
+
+    // Resize transfer vector
+    _transfer[i].resize(_receiving_indices[i].size());
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/FunctionAssigner.h b/dolfin/function/FunctionAssigner.h
new file mode 100644
index 0000000..2dc29f2
--- /dev/null
+++ b/dolfin/function/FunctionAssigner.h
@@ -0,0 +1,161 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-09-20
+// Last changed: 2013-11-11
+
+#ifndef __DOLFIN_FUNCTION_ASSIGNER_H
+#define __DOLFIN_FUNCTION_ASSIGNER_H
+
+#include <vector>
+#include <memory>
+
+namespace dolfin
+{
+
+  class Function;
+  class FunctionSpace;
+  class Mesh;
+
+  /// This class facilitate assignments between Function and sub
+  /// Functions. It builds and caches maps between compatible
+  /// dofs. These maps are used in the assignment methods which
+  /// perform the actual assignment. Optionally can a MeshFunction be
+  /// passed together with a label, facilitating FunctionAssignment
+  /// over sub domains.
+  class FunctionAssigner
+  {
+  public:
+
+    /// Create a FunctionAssigner between functions residing in the
+    /// same type of FunctionSpace. One or both functions can be sub
+    /// functions.
+    ///
+    /// *Arguments*
+    ///     receiving_space (_FunctionSpace_)
+    ///         The function space of the receiving function
+    ///     assigning_space (_FunctionSpace_)
+    ///         The function space of the assigning function
+    FunctionAssigner(std::shared_ptr<const FunctionSpace> receiving_space,
+		     std::shared_ptr<const FunctionSpace> assigning_space);
+
+    /// Create a FunctionAssigner between one mixed function
+    /// (assigning) and several functions (receiving). The number of
+    /// receiving functions must sum up to the number of sub functions
+    /// in the assigning mixed function. The sub spaces of the
+    /// assigning mixed space must be of the same type ans size as the
+    /// receiving spaces.
+    ///
+    /// *Arguments*
+    ///     receiving_spaces (std::vector<_FunctionSpace_>)
+    ///         The recieving function spaces
+    ///     assigning_space (_FunctionSpace_)
+    ///         The assigning function space
+    FunctionAssigner(std::vector<std::shared_ptr<const FunctionSpace> > receiving_spaces,
+		     std::shared_ptr<const FunctionSpace> assigning_space);
+
+    /// Create a FunctionAssigner between several functions
+    /// (assigning) and one mixed function (receiving). The number of
+    /// sub functions in the assigning mixed function must sum up to
+    /// the number of receiving functions. The sub spaces of the
+    /// receiving mixed space must be of the same type ans size as the
+    /// assigning spaces.
+    ///
+    /// *Arguments*
+    ///     receiving_space (std::shared_ptr<_FunctionSpace_>)
+    ///         The recieving function space
+    ///     assigning_spaces (std::vector<std::shared_ptr<_FunctionSpace_> >)
+    ///         The assigning function spaces
+    FunctionAssigner(std::shared_ptr<const FunctionSpace> receiving_space,
+		     std::vector<std::shared_ptr<const FunctionSpace> > assigning_spaces);
+
+    /// Assign one function to another
+    ///
+    /// *Arguments*
+    ///     receiving_func (std::shared_ptr<_Function_>)
+    ///         The recieving function
+    ///     assigning_func (std::shared_ptr<_Function_>)
+    ///         The assigning function
+    void assign(std::shared_ptr<Function> receiving_func,
+		std::shared_ptr<const Function> assigning_func) const;
+
+    /// Assign several functions to sub functions of a mixed receiving
+    /// function
+    ///
+    /// *Arguments*
+    ///     receiving_func (std::shared_ptr<_Function_>)
+    ///         The recieving mixed function
+    ///     assigning_funcs (std::vector<std::shared_ptr<_Function_> >)
+    ///         The assigning functions
+    void assign(std::shared_ptr<Function> receiving_func,
+		std::vector<std::shared_ptr<const Function> > assigning_funcs) const;
+
+    /// Assign sub functions of a single mixed function to single
+    /// receiving functions
+    ///
+    /// *Arguments*
+    ///     receiving_funcs (std::vector<std::shared_ptr<_Function_> >)
+    ///         The recieving functions
+    ///     assigning_func (std::shared_ptr<_Function_>)
+    ///         The assigning mixed function
+    void assign(std::vector<std::shared_ptr<Function> > receiving_funcs,
+		std::shared_ptr<const Function> assigning_func) const;
+
+    /// Destructor
+    ~FunctionAssigner();
+
+    /// Return the number of assiging functions
+    inline std::size_t num_assigning_functions() const
+    { return _assigning_spaces.size(); }
+
+    /// Return the number of receiving functions
+    inline std::size_t num_receiving_functions() const
+    { return _receiving_spaces.size(); }
+
+  private:
+
+    // Utility function to actually do the assignment
+    void _assign(std::vector<std::shared_ptr<Function> > receiving_funcs,
+	std::vector<std::shared_ptr<const Function> > assigning_funcs) const;
+
+    // Check the compatability of the meshes and return a reference to
+    // the mesh
+    const Mesh& _get_mesh() const;
+
+    // Check the compatability of the arguments to the constructor and
+    // build indices for assignment
+    void _check_and_build_indices(const Mesh& mesh,
+	  const std::vector<std::shared_ptr<const FunctionSpace> >& receiving_spaces,
+	  const std::vector<std::shared_ptr<const FunctionSpace> >& assigning_spaces);
+
+    // Shared pointers to the original FunctionSpaces
+    std::vector<std::shared_ptr<const FunctionSpace> > _receiving_spaces;
+    std::vector<std::shared_ptr<const FunctionSpace> > _assigning_spaces;
+
+    // Indices for accessing values to receiving Functions
+    std::vector<std::vector<la_index> > _receiving_indices;
+
+    // Indices for accessing values from assigning Functions
+    std::vector<std::vector<la_index> > _assigning_indices;
+
+    // Vector for value transfer between assigning and receiving Function
+    mutable std::vector<std::vector<double> > _transfer;
+
+  };
+}
+
+#endif
diff --git a/dolfin/function/FunctionSpace.cpp b/dolfin/function/FunctionSpace.cpp
new file mode 100644
index 0000000..3a38548
--- /dev/null
+++ b/dolfin/function/FunctionSpace.cpp
@@ -0,0 +1,303 @@
+// Copyright (C) 2008-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristoffer Selim, 2008.
+// Modified by Martin Alnes, 2008.
+// Modified by Garth N. Wells, 2008-2011.
+// Modified by Kent-Andre Mardal, 2009.
+// Modified by Ola Skavhaug, 2009.
+//
+// First added:  2008-09-11
+// Last changed: 2011-05-15
+
+#include <vector>
+#include <dolfin/common/utils.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Mesh.h>
+#include "GenericFunction.h"
+#include "FunctionSpace.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+FunctionSpace::FunctionSpace(std::shared_ptr<const Mesh> mesh,
+                             std::shared_ptr<const FiniteElement> element,
+                             std::shared_ptr<const GenericDofMap> dofmap)
+  : Hierarchical<FunctionSpace>(*this),
+    _mesh(mesh), _element(element), _dofmap(dofmap)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+FunctionSpace::FunctionSpace(std::shared_ptr<const Mesh> mesh)
+  : Hierarchical<FunctionSpace>(*this), _mesh(mesh)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+FunctionSpace::FunctionSpace(const FunctionSpace& V)
+  : Hierarchical<FunctionSpace>(*this)
+{
+  // Assign data (will be shared)
+  *this = V;
+}
+//-----------------------------------------------------------------------------
+FunctionSpace::~FunctionSpace()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void FunctionSpace::attach(std::shared_ptr<const FiniteElement> element,
+                           std::shared_ptr<const GenericDofMap> dofmap)
+{
+  _element = element;
+  _dofmap  = dofmap;
+}
+//-----------------------------------------------------------------------------
+const FunctionSpace& FunctionSpace::operator=(const FunctionSpace& V)
+{
+  // Assign data (will be shared)
+  _mesh      = V._mesh;
+  _element   = V._element;
+  _dofmap    = V._dofmap;
+  _component = V._component;
+
+  // Call assignment operator for base class
+  Hierarchical<FunctionSpace>::operator=(V);
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+bool FunctionSpace::operator==(const FunctionSpace& V) const
+{
+  // Compare pointers to shared objects
+  return _element.get() == V._element.get() &&
+    _mesh.get() == V._mesh.get() &&
+    _dofmap.get() == V._dofmap.get();
+}
+//-----------------------------------------------------------------------------
+bool FunctionSpace::operator!=(const FunctionSpace& V) const
+{
+  // Compare pointers to shared objects
+  return !(*this == V);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Mesh> FunctionSpace::mesh() const
+{
+  return _mesh;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const FiniteElement> FunctionSpace::element() const
+{
+  return _element;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericDofMap> FunctionSpace::dofmap() const
+{
+  return _dofmap;
+}
+//-----------------------------------------------------------------------------
+std::size_t FunctionSpace::dim() const
+{
+  dolfin_assert(_dofmap);
+  return _dofmap->global_dimension();
+}
+//-----------------------------------------------------------------------------
+void FunctionSpace::interpolate(GenericVector& expansion_coefficients,
+                                const GenericFunction& v) const
+{
+  dolfin_assert(_mesh);
+  dolfin_assert(_element);
+  dolfin_assert(_dofmap);
+
+  // Check that function ranks match
+  if (_element->value_rank() != v.value_rank())
+  {
+    dolfin_error("FunctionSpace.cpp",
+                 "interpolate function into function space",
+                 "Rank of function (%d) does not match rank of function space (%d)",
+                 v.value_rank(), element()->value_rank());
+  }
+
+  // Check that function dims match
+  for (std::size_t i = 0; i < _element->value_rank(); ++i)
+  {
+    if (_element->value_dimension(i) != v.value_dimension(i))
+    {
+      dolfin_error("FunctionSpace.cpp",
+                   "interpolate function into function space",
+                   "Dimension %d of function (%d) does not match dimension %d of function space (%d)",
+                   i, v.value_dimension(i), i, element()->value_dimension(i));
+    }
+  }
+
+  // Initialize vector of expansion coefficients
+  if (expansion_coefficients.size() != _dofmap->global_dimension())
+  {
+    dolfin_error("FunctionSpace.cpp",
+                 "interpolate function into function space",
+                 "Wrong size of vector");
+  }
+  expansion_coefficients.zero();
+
+  // Initialize local arrays
+  std::vector<double> cell_coefficients(_dofmap->max_cell_dimension());
+
+  // Iterate over mesh and interpolate on each cell
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  for (CellIterator cell(*_mesh); !cell.end(); ++cell)
+  {
+    // Update to current cell
+    cell->get_vertex_coordinates(vertex_coordinates);
+    cell->get_cell_data(ufc_cell);
+
+    // Restrict function to cell
+    v.restrict(cell_coefficients.data(), *_element, *cell,
+               vertex_coordinates.data(), ufc_cell);
+
+    // Tabulate dofs
+    const std::vector<dolfin::la_index>& cell_dofs
+      = _dofmap->cell_dofs(cell->index());
+
+    // Copy dofs to vector
+    expansion_coefficients.set(cell_coefficients.data(),
+                               _dofmap->cell_dimension(cell->index()),
+                               cell_dofs.data());
+  }
+
+  // Finalise changes
+  expansion_coefficients.apply("insert");
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<FunctionSpace> FunctionSpace::operator[] (std::size_t i) const
+{
+  std::vector<std::size_t> component;
+  component.push_back(i);
+  return extract_sub_space(component);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<FunctionSpace>
+FunctionSpace::extract_sub_space(const std::vector<std::size_t>& component) const
+{
+  dolfin_assert(_mesh);
+  dolfin_assert(_element);
+  dolfin_assert(_dofmap);
+
+  // Check if sub space is already in the cache
+  std::map<std::vector<std::size_t>,
+           std::shared_ptr<FunctionSpace> >::const_iterator subspace;
+  subspace = subspaces.find(component);
+  if (subspace != subspaces.end())
+    return subspace->second;
+  else
+  {
+    // Extract sub element
+    std::shared_ptr<const FiniteElement>
+      element(_element->extract_sub_element(component));
+
+    // Extract sub dofmap
+    std::shared_ptr<GenericDofMap>
+      dofmap(_dofmap->extract_sub_dofmap(component, *_mesh));
+
+    // Create new sub space
+    std::shared_ptr<FunctionSpace>
+      new_sub_space(new FunctionSpace(_mesh, element, dofmap));
+
+    // Set component
+    new_sub_space->_component.resize(component.size());
+    for (std::size_t i = 0; i < component.size(); i++)
+      new_sub_space->_component[i] = component[i];
+
+    // Insert new sub space into cache
+    subspaces.insert(std::pair<std::vector<std::size_t>,
+                     std::shared_ptr<FunctionSpace> >(component,
+                                                        new_sub_space));
+
+    return new_sub_space;
+  }
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<FunctionSpace> FunctionSpace::collapse() const
+{
+  boost::unordered_map<std::size_t, std::size_t> collapsed_dofs;
+  return collapse(collapsed_dofs);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<FunctionSpace>FunctionSpace::collapse(
+  boost::unordered_map<std::size_t, std::size_t>& collapsed_dofs) const
+{
+  dolfin_assert(_mesh);
+
+  if (_component.empty())
+  {
+    dolfin_error("FunctionSpace.cpp",
+                 "collapse function space",
+                 "Function space is not a subspace");
+  }
+
+  // Create collapsed DofMap
+  std::shared_ptr<GenericDofMap>
+    collapsed_dofmap(_dofmap->collapse(collapsed_dofs, *_mesh));
+
+  // Create new FunctionsSpace and return
+  std::shared_ptr<FunctionSpace>
+    collapsed_sub_space(new FunctionSpace(_mesh, _element, collapsed_dofmap));
+  return collapsed_sub_space;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> FunctionSpace::component() const
+{
+  return _component;
+}
+//-----------------------------------------------------------------------------
+std::string FunctionSpace::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    // No verbose output implemented
+  }
+  else
+    s << "<FunctionSpace of dimension " << dim() << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void FunctionSpace::print_dofmap() const
+{
+  // Note: static_cast is used below to supoort types that cannot be
+  //       directed to dolfin::cout
+  dolfin_assert(_mesh);
+  for (CellIterator cell(*_mesh); !cell.end(); ++cell)
+  {
+    const std::vector<dolfin::la_index>& dofs
+      = _dofmap->cell_dofs(cell->index());
+    cout << cell->index() << ":";
+    for (std::size_t i = 0; i < dofs.size(); i++)
+      cout << " " << static_cast<std::size_t>(dofs[i]);
+    cout << endl;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/FunctionSpace.h b/dolfin/function/FunctionSpace.h
new file mode 100644
index 0000000..e789436
--- /dev/null
+++ b/dolfin/function/FunctionSpace.h
@@ -0,0 +1,279 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2008-2011
+// Modified by Kent-Andre Mardal 2009
+// Modified by Ola Skavhaug 2009
+//
+// First added:  2008-09-11
+// Last changed: 2013-09-19
+
+#ifndef __FUNCTION_SPACE_H
+#define __FUNCTION_SPACE_H
+
+#include <cstddef>
+#include <map>
+#include <vector>
+
+#include <memory>
+#include <boost/unordered_map.hpp>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/common/Hierarchical.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/mesh/Cell.h>
+
+namespace dolfin
+{
+
+  class Function;
+  class GenericDofMap;
+  class GenericFunction;
+  class GenericVector;
+  class Mesh;
+
+  /// This class represents a finite element function space defined by
+  /// a mesh, a finite element, and a local-to-global mapping of the
+  /// degrees of freedom (dofmap).
+
+  class FunctionSpace : public Variable, public Hierarchical<FunctionSpace>
+  {
+  public:
+
+    /// Create function space for given mesh, element and dofmap
+    /// (shared data)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     element (_FiniteElement_)
+    ///         The element.
+    ///     dofmap (_GenericDofMap_)
+    ///         The dofmap.
+    FunctionSpace(std::shared_ptr<const Mesh> mesh,
+                  std::shared_ptr<const FiniteElement> element,
+                  std::shared_ptr<const GenericDofMap> dofmap);
+
+  protected:
+
+    /// Create empty function space for later initialization. This
+    /// constructor is intended for use by any sub-classes which need
+    /// to construct objects before the initialisation of the base
+    /// class. Data can be attached to the base class using
+    /// FunctionSpace::attach(...).
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    explicit FunctionSpace(std::shared_ptr<const Mesh> mesh);
+
+  public:
+
+    /// Copy constructor
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         The object to be copied.
+    FunctionSpace(const FunctionSpace& V);
+
+    /// Destructor
+    virtual ~FunctionSpace();
+
+  protected:
+
+    /// Attach data to an empty function space
+    ///
+    /// *Arguments*
+    ///     element (_FiniteElement_)
+    ///         The element.
+    ///     dofmap (_GenericDofMap_)
+    ///         The dofmap.
+    void attach(std::shared_ptr<const FiniteElement> element,
+                std::shared_ptr<const GenericDofMap> dofmap);
+
+  public:
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         Another function space.
+    const FunctionSpace& operator= (const FunctionSpace& V);
+
+    /// Equality operator
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         Another function space.
+    bool operator== (const FunctionSpace& V) const;
+
+    /// Unequality operator
+    ///
+    /// *Arguments*
+    ///     V (_FunctionSpace_)
+    ///         Another function space.
+    bool operator!= (const FunctionSpace& V) const;
+
+    /// Return mesh
+    ///
+    /// *Returns*
+    ///     _Mesh_
+    ///         The mesh.
+    std::shared_ptr<const Mesh> mesh() const;
+
+    /// Return finite element
+    ///
+    /// *Returns*
+    ///     _FiniteElement_
+    ///         The finite element.
+    std::shared_ptr<const FiniteElement> element() const;
+
+    /// Return dofmap
+    ///
+    /// *Returns*
+    ///     _GenericDofMap_
+    ///         The dofmap.
+    std::shared_ptr<const GenericDofMap> dofmap() const;
+
+    /// Return dimension of function space
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The dimension of the function space.
+    std::size_t dim() const;
+
+    /// Interpolate function v into function space, returning the
+    /// vector of expansion coefficients
+    ///
+    /// *Arguments*
+    ///     expansion_coefficients (_GenericVector_)
+    ///         The expansion coefficients.
+    ///     v (_GenericFunction_)
+    ///         The function to be interpolated.
+    void interpolate(GenericVector& expansion_coefficients,
+                     const GenericFunction& v) const;
+
+    /// Extract subspace for component
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Index of the subspace.
+    /// *Returns*
+    ///     _FunctionSpace_
+    ///         The subspace.
+    std::shared_ptr<FunctionSpace> operator[] (std::size_t i) const;
+
+    /// Extract subspace for component
+    ///
+    /// *Arguments*
+    ///     component (std::vector<std::size_t>)
+    ///         The component.
+    ///
+    /// *Returns*
+    ///     _FunctionSpace_
+    ///         The subspace.
+    std::shared_ptr<FunctionSpace>
+    extract_sub_space(const std::vector<std::size_t>& component) const;
+
+    /// Collapse a subspace and return a new function space
+    ///
+    /// *Returns*
+    ///     _FunctionSpace_
+    ///         The new function space.
+    std::shared_ptr<FunctionSpace> collapse() const;
+
+    /// Collapse a subspace and return a new function space and a map
+    /// from new to old dofs
+    ///
+    /// *Arguments*
+    ///     collapsed_dofs (boost::unordered_map<std::size_t, std::size_t>)
+    ///         The map from new to old dofs.
+    ///
+    /// *Returns*
+    ///     _FunctionSpace_
+    ///       The new function space.
+    std::shared_ptr<FunctionSpace>
+    collapse(boost::unordered_map<std::size_t, std::size_t>& collapsed_dofs) const;
+
+    /// Check if function space has given cell
+    ///
+    /// *Arguments*
+    ///     cell (_Cell_)
+    ///         The cell.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the function space has the given cell.
+    bool has_cell(const Cell& cell) const
+    { return &cell.mesh() == &(*_mesh); }
+
+    /// Check if function space has given element
+    ///
+    /// *Arguments*
+    ///     element (_FiniteElement_)
+    ///         The finite element.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the function space has the given element.
+    bool has_element(const FiniteElement& element) const
+    { return element.hash() == _element->hash(); }
+
+    /// Return component
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         The component (relative to superspace).
+    std::vector<std::size_t> component() const;
+
+    /// Return informal string representation (pretty-print)
+    ///
+    /// *Arguments*
+    ///     verbose (bool)
+    ///         Flag to turn on additional output.
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         An informal representation of the function space.
+    std::string str(bool verbose) const;
+
+    /// Print dofmap (useful for debugging)
+    void print_dofmap() const;
+
+  private:
+
+    // The mesh
+    std::shared_ptr<const Mesh> _mesh;
+
+    // The finite element
+    std::shared_ptr<const FiniteElement> _element;
+
+    // The dofmap
+    std::shared_ptr<const GenericDofMap> _dofmap;
+
+    // The component (for sub spaces)
+    std::vector<std::size_t> _component;
+
+    // Cache of sub spaces
+    mutable std::map<std::vector<std::size_t>,
+      std::shared_ptr<FunctionSpace> > subspaces;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/GenericFunction.cpp b/dolfin/function/GenericFunction.cpp
new file mode 100644
index 0000000..8ab10bc
--- /dev/null
+++ b/dolfin/function/GenericFunction.cpp
@@ -0,0 +1,202 @@
+// Copyright (C) 2009-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-28
+// Last changed: 2014-03-25
+
+#include <string>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/geometry/Point.h>
+#include "GenericFunction.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+GenericFunction::GenericFunction() : Variable("u", "a function")
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+GenericFunction::~GenericFunction()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void GenericFunction::eval(Array<double>& values, const Array<double>& x,
+                           const ufc::cell& cell) const
+{
+  // Redirect to simple eval
+  eval(values, x);
+}
+//-----------------------------------------------------------------------------
+void GenericFunction::eval(Array<double>& values, const Array<double>& x) const
+{
+  dolfin_error("GenericFunction.cpp",
+               "evaluate function",
+               "Missing eval() function (must be overloaded)");
+}
+//-----------------------------------------------------------------------------
+double GenericFunction::operator() (double x)
+{
+  // Check that function is scalar
+  if (value_rank() != 0)
+  {
+    dolfin_error("GenericFunction.cpp",
+                 "evaluate function at point",
+                 "Function is not scalar");
+  }
+
+  // Set up Array arguments
+  Array<double> values(1);
+  const Array<double> _x(1, &x);
+
+  // Call eval
+  eval(values, _x);
+
+  // Return value
+  return values[0];
+}
+//-----------------------------------------------------------------------------
+double GenericFunction::operator() (double x, double y)
+{
+  // Check that function is scalar
+  if (value_rank() != 0)
+  {
+    dolfin_error("GenericFunction.cpp",
+                 "evaluate function at point",
+                 "Function is not scalar");
+  }
+
+  // Set up Array arguments
+  Array<double> values(1);
+  Array<double> _x(2);
+  _x[0] = x;
+  _x[1] = y;
+
+  // Call eval
+  eval(values, _x);
+
+  // Return value
+  return values[0];
+}
+//-----------------------------------------------------------------------------
+double GenericFunction::operator() (double x, double y, double z)
+{
+  // Check that function is scalar
+  if (value_rank() != 0)
+  {
+    dolfin_error("GenericFunction.cpp",
+                 "evaluate function at point",
+                 "Function is not scalar");
+  }
+
+  // Set up Array arguments
+  Array<double> values(1);
+  Array<double> _x(3);
+  _x[0] = x;
+  _x[1] = y;
+  _x[2] = z;
+
+  // Call eval
+  eval(values, _x);
+
+  // Return value
+  return values[0];
+}
+//-----------------------------------------------------------------------------
+double GenericFunction::operator() (const Point& p)
+{
+  return (*this)(p.x(), p.y(), p.z());
+}
+//-----------------------------------------------------------------------------
+void GenericFunction::operator() (Array<double>& values,
+                                  double x)
+{
+  // Set up Array argument
+  const Array<double> _x(1, &x);
+
+  // Call eval
+  eval(values, _x);
+}
+//-----------------------------------------------------------------------------
+void GenericFunction::operator() (Array<double>& values,
+                                  double x, double y)
+{
+  // Set up Array argument
+  Array<double> _x(2);
+  _x[0] = x;
+  _x[1] = y;
+
+  // Call eval
+  eval(values, _x);
+}
+//-----------------------------------------------------------------------------
+void GenericFunction::operator() (Array<double>& values,
+                                  double x, double y, double z)
+{
+  // Set up Array argument
+  Array<double> _x(3);
+  _x[0] = x;
+  _x[1] = y;
+  _x[2] = z;
+
+  // Call eval
+  eval(values, _x);
+}
+//-----------------------------------------------------------------------------
+void GenericFunction::operator() (Array<double>& values, const Point& p)
+{
+  (*this)(values, p.x(), p.y(), p.z());
+}
+//-----------------------------------------------------------------------------
+std::size_t GenericFunction::value_size() const
+{
+  std::size_t size = 1;
+  for (std::size_t i = 0; i < value_rank(); ++i)
+    size *= value_dimension(i);
+  return size;
+}
+//-----------------------------------------------------------------------------
+void GenericFunction::evaluate(double* values,
+                               const double* coordinates,
+                               const ufc::cell& cell) const
+{
+  dolfin_assert(values);
+  dolfin_assert(coordinates);
+
+  // Wrap data
+  Array<double> _values(value_size(), values);
+  const Array<double>
+    x(cell.geometric_dimension, const_cast<double*>(coordinates));
+
+  // Redirect to eval
+  eval(_values, x, cell);
+}
+//-----------------------------------------------------------------------------
+void GenericFunction::restrict_as_ufc_function(double* w,
+                                               const FiniteElement& element,
+                                               const Cell& dolfin_cell,
+                                               const double* vertex_coordinates,
+                                               const ufc::cell& ufc_cell) const
+{
+  dolfin_assert(w);
+
+  // Evaluate dofs to get the expansion coefficients
+  element.evaluate_dofs(w, *this, vertex_coordinates, ufc_cell.orientation,
+                        ufc_cell);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/GenericFunction.h b/dolfin/function/GenericFunction.h
new file mode 100644
index 0000000..e4024c8
--- /dev/null
+++ b/dolfin/function/GenericFunction.h
@@ -0,0 +1,141 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2009.
+//
+// First added:  2009-09-28
+// Last changed: 2011-01-19
+
+#ifndef __GENERIC_FUNCTION_H
+#define __GENERIC_FUNCTION_H
+
+#include <ufc.h>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  class Mesh;
+  class Cell;
+  class Point;
+  class FiniteElement;
+
+  /// This is a common base class for functions. Functions can be
+  /// evaluated at a given point and they can be restricted to a given
+  /// cell in a finite element mesh. This functionality is implemented
+  /// by sub-classes that implement the eval() and restrict() functions.
+  ///
+  /// DOLFIN provides two implementations of the GenericFunction
+  /// interface in the form of the classes Function and Expression.
+  ///
+  /// Sub-classes may optionally implement the update() function that
+  /// will be called prior to restriction when running in parallel.
+
+  class GenericFunction : public ufc::function, public Variable
+  {
+  public:
+
+    /// Constructor
+    GenericFunction();
+
+    /// Destructor
+    virtual ~GenericFunction();
+
+    //--- Functions that must be implemented by sub-classes ---
+
+    /// Return value rank
+    virtual std::size_t value_rank() const = 0;
+
+    /// Return value dimension for given axis
+    virtual std::size_t value_dimension(std::size_t i) const = 0;
+
+    /// Evaluate at given point in given cell
+    virtual void eval(Array<double>& values, const Array<double>& x,
+                      const ufc::cell& cell) const;
+
+    /// Evaluate at given point
+    virtual void eval(Array<double>& values, const Array<double>& x) const;
+
+    /// Restrict function to local cell (compute expansion coefficients w)
+    virtual void restrict(double* w,
+                          const FiniteElement& element,
+                          const Cell& dolfin_cell,
+                          const double* vertex_coordinates,
+                          const ufc::cell& ufc_cell) const = 0;
+
+    /// Compute values at all mesh vertices
+    virtual void compute_vertex_values(std::vector<double>& vertex_values,
+                                       const Mesh& mesh) const = 0;
+
+    //--- Optional functions to be implemented by sub-classes ---
+
+    /// Update off-process ghost coefficients
+    virtual void update() const {}
+
+    //--- Convenience functions ---
+
+    /// Evaluation at given point (scalar function)
+    double operator() (double x);
+
+    /// Evaluation at given point (scalar function)
+    double operator() (double x, double y);
+
+    /// Evaluation at given point (scalar function)
+    double operator() (double x, double y, double z);
+
+    /// Evaluation at given point (scalar function)
+    double operator() (const Point& p);
+
+    /// Evaluation at given point (vector-valued function)
+    void operator() (Array<double>& values, double x);
+
+    /// Evaluation at given point (vector-valued function)
+    void operator() (Array<double>& values, double x, double y);
+
+    /// Evaluation at given point (vector-valued function)
+    void operator() (Array<double>& values, double x, double y, double z);
+
+    /// Evaluation at given point (vector-valued function)
+    void operator() (Array<double>& values, const Point& p);
+
+    /// Evaluation at given point
+
+    /// Return value size (product of value dimensions)
+    std::size_t value_size() const;
+
+    //--- Implementation of ufc::function interface ---
+
+    /// Evaluate function at given point in cell
+    virtual void evaluate(double* values,
+                          const double* coordinates,
+                          const ufc::cell& cell) const;
+
+  protected:
+
+    // Restrict as UFC function (by calling eval)
+    void restrict_as_ufc_function(double* w,
+                                  const FiniteElement& element,
+                                  const Cell& dolfin_cell,
+                                  const double* vertex_coordinates,
+                                  const ufc::cell& ufc_cell) const;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/LagrangeInterpolator.cpp b/dolfin/function/LagrangeInterpolator.cpp
new file mode 100644
index 0000000..e8134b1
--- /dev/null
+++ b/dolfin/function/LagrangeInterpolator.cpp
@@ -0,0 +1,440 @@
+// Copyright (C) 2014 Mikael Mortensen
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First added:  2014-02-12
+// Last changed:
+
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/common/RangedIndexSet.h>
+#include "Expression.h"
+#include "Function.h"
+#include "FunctionSpace.h"
+#include "LagrangeInterpolator.h"
+
+using namespace dolfin;
+
+void LagrangeInterpolator::interpolate(Function& u, const Expression& u0) 
+{    
+  // Get function space and element interpolating to
+  dolfin_assert(u.function_space());
+  const FunctionSpace& V = *u.function_space();
+  dolfin_assert(V.element());
+  const FiniteElement& element = *V.element();
+
+  // Check that function ranks match
+  if (element.value_rank() != u0.value_rank())
+  {
+    dolfin_error("LagrangeInterpolator.cpp",
+                 "interpolate Expression into function space",
+                 "Rank of Expression (%d) does not match rank of function space (%d)",
+                 u0.value_rank(), element.value_rank());
+  }
+
+  // Check that function dims match
+  for (std::size_t i = 0; i < element.value_rank(); ++i)
+  {
+    if (element.value_dimension(i) != u0.value_dimension(i))
+    {
+      dolfin_error("LagrangeInterpolator.cpp",
+                   "interpolate Expression into function space",
+                   "Dimension %d of Expression (%d) does not match dimension %d of function space (%d)",
+                   i, u0.value_dimension(i), i, element.value_dimension(i));
+    }
+  }
+
+  // Get mesh and dimension of FunctionSpace interpolating to
+  dolfin_assert(V.mesh());
+  const Mesh& mesh = *V.mesh();
+  const std::size_t gdim = mesh.geometry().dim();
+
+  // Create arrays used to evaluate one point
+  std::vector<double> x(gdim);
+  std::vector<double> values(u0.value_size());
+  Array<double> _x(gdim, x.data());
+  Array<double> _values(u0.value_size(), values.data());
+
+  // Create vector to hold all local values of u 
+  std::vector<double> local_u_vector(u.vector()->local_size());
+
+  // Get dofmap of this Function
+  dolfin_assert(V.dofmap());
+  const GenericDofMap& dofmap = *V.dofmap();
+
+  // Get dof ownership range
+  std::pair<std::size_t, std::size_t> owner_range = dofmap.ownership_range();
+
+  // Create map from coordinates to dofs sharing that coordinate
+  std::map<std::vector<double>, std::vector<std::size_t>, lt_coordinate>
+    coords_to_dofs = tabulate_coordinates_to_dofs(dofmap, mesh);
+
+  // Get a map from global dofs to component number in mixed space
+  boost::unordered_map<std::size_t, std::size_t> dof_component_map;
+  int component = -1;
+  extract_dof_component_map(dof_component_map, V, &component);
+
+  // Evaluate all points
+  std::map<std::vector<double>, std::vector<std::size_t>, lt_coordinate>::const_iterator 
+    map_it;      
+  for (map_it = coords_to_dofs.begin(); map_it != coords_to_dofs.end(); map_it++)
+  {    
+    // Place interpolation point in x
+    std::copy(map_it->first.begin(), map_it->first.end(), x.begin());
+
+    u0.eval(_values, _x);
+    std::vector<std::size_t> dofs = map_it->second;
+    for (std::vector<std::size_t>::const_iterator d = dofs.begin(); d != dofs.end(); d++)
+      local_u_vector[*d-owner_range.first] = values[dof_component_map[*d]];
+  }    
+  // Finalize
+  u.vector()->set_local(local_u_vector);
+  u.vector()->apply("insert");
+}
+
+void LagrangeInterpolator::interpolate(Function& u, const Function& u0) 
+{
+  // Interpolate from Function u0 to Function u.
+  // This mesh of u0 may be different from that of u
+  //
+  // The algorithm is briefly
+  //
+  //   1) Create a map from all different coordinates of u's dofs to  
+  //      the dofs living on that coordinate. This is done such that
+  //      one only need to visit (and distribute) each interpolation 
+  //      point once.
+  //   2) Create a map from dof to component index in Mixed Space.
+  //   3) Create bounding boxes for the partitioned mesh of u0 and 
+  //      distribute to all processors.
+  //   4) Using bounding boxes, compute the processes that *may* own 
+  //      the dofs of u.
+  //   5) Distribute interpolation points to potential owners who 
+  //      subsequently tries to evaluate u0. If successful, return 
+  //      values of u0 to owner.
+
+  // Get function spaces of Functions interpolating to/from
+  dolfin_assert(u0.function_space());
+  dolfin_assert( u.function_space());
+  const FunctionSpace& V0 = *u0.function_space();
+  const FunctionSpace& V1 = *u .function_space();
+
+  // Get element interpolating to
+  dolfin_assert(V1.element());
+  const FiniteElement& element = *V1.element();
+
+  // Check that function ranks match
+  if (element.value_rank() != u0.value_rank())
+  {
+    dolfin_error("LagrangeInterpolator.cpp",
+                 "interpolate Function into function space",
+                 "Rank of Function (%d) does not match rank of function space (%d)",
+                 u0.value_rank(), element.value_rank());
+  }
+
+  // Check that function dims match
+  for (std::size_t i = 0; i < element.value_rank(); ++i)
+  {
+    if (element.value_dimension(i) != u0.value_dimension(i))
+    {
+      dolfin_error("LagrangeInterpolator.cpp",
+                   "interpolate Function into function space",
+                   "Dimension %d of Function (%d) does not match dimension %d of function space (%d)",
+                   i, u0.value_dimension(i), i, element.value_dimension(i));
+    }
+  }  
+
+  // Get mesh and dimension of FunctionSpace interpolating to/from
+  dolfin_assert(V0.mesh());
+  dolfin_assert(V1.mesh());
+  const Mesh& mesh0 = *V0.mesh();
+  const Mesh& mesh1 = *V1.mesh();
+  const std::size_t gdim0 = mesh0.geometry().dim();
+  const std::size_t gdim1 = mesh1.geometry().dim();
+
+  // Get communicator
+  const MPI_Comm mpi_comm = V1.mesh()->mpi_comm();
+
+  // Create bounding box of mesh0
+  std::vector<double> x_min_max(2*gdim0);
+  std::vector<double> coordinates = mesh0.coordinates();
+  for (std::size_t i=0; i<gdim0; i++)
+  {
+    for (std::vector<double>::const_iterator it=coordinates.begin()+i; 
+         it < coordinates.end(); it+=gdim0)
+    {
+      x_min_max[i]         = std::min(x_min_max[i], *it);
+      x_min_max[gdim0 + i] = std::max(x_min_max[gdim0 + i], *it);
+    }
+  }
+
+  // Communicate bounding boxes
+  std::vector<std::vector<double> > bounding_boxes;
+  MPI::all_gather(mpi_comm, x_min_max, bounding_boxes);
+
+  // Create arrays used to evaluate one point
+  std::vector<double> x(gdim0);
+  std::vector<double> values(u0.value_size());
+  Array<double> _x(gdim0, x.data());
+  Array<double> _values(u0.value_size(), values.data());
+
+  // Create vector to hold all local values of u
+  std::vector<double> local_u_vector(u.vector()->local_size());
+
+  // Get dofmap of u
+  dolfin_assert(V1.dofmap());
+  const GenericDofMap& dofmap = *V1.dofmap();
+
+  // Get dof ownership range
+  std::pair<std::size_t, std::size_t> owner_range = dofmap.ownership_range();
+
+  // Create map from coordinates to dofs sharing that coordinate
+  std::map<std::vector<double>, std::vector<std::size_t>, lt_coordinate>
+    coords_to_dofs = tabulate_coordinates_to_dofs(dofmap, mesh1);
+
+  // Get a map from global dofs to component number in mixed space
+  boost::unordered_map<std::size_t, std::size_t> dof_component_map;
+  int component = -1;
+  extract_dof_component_map(dof_component_map, V1, &component);
+
+  // Search this process first for all coordinates in u's local mesh
+  std::vector<double> points_not_found;          
+  std::map<std::vector<double>, std::vector<std::size_t>, 
+           lt_coordinate>::const_iterator map_it;
+  for (map_it = coords_to_dofs.begin(); map_it != coords_to_dofs.end();
+       map_it++)
+  {    
+    // Place interpolation point in x
+    std::copy(map_it->first.begin(), map_it->first.end(), x.begin());
+
+    try
+    { // Store values when point is found
+      u0.eval(_values, _x);
+      std::vector<std::size_t> dofs = map_it->second;
+      for (std::vector<std::size_t>::const_iterator d = dofs.begin(); 
+           d != dofs.end(); d++)
+        local_u_vector[*d-owner_range.first] = values[dof_component_map[*d]];
+    }
+    catch (std::exception &e)
+    { // If not found then it must be seached on the other processes
+      points_not_found.insert(points_not_found.end(), x.begin(), x.end());
+    }
+  }
+
+  // Get number of MPI processes
+  std::size_t num_processes = MPI::size(mpi_comm);
+
+  // Remaining interpolation points must be found through MPI communication
+  // Check first using bounding boxes which process may own the points
+  std::vector<std::vector<double> > potential_points(num_processes);
+  for (std::size_t i = 0; i < points_not_found.size(); i += gdim1)
+  {      
+    std::copy(points_not_found.begin()+i, 
+              points_not_found.begin()+i+gdim1, x.begin());
+
+    // Find potential owners
+    for (std::size_t p = 0; p < num_processes; p++)
+    {
+      if (p == MPI::rank(mpi_comm))
+        continue;
+
+      // Check if in bounding box          
+      if (in_bounding_box(x, bounding_boxes[p], 1e-12))
+        potential_points[p].insert(potential_points[p].end(), 
+                                   x.begin(), x.end());
+    }
+  }   
+
+  // Communicate all potential points
+  std::vector<std::vector<double> > potential_points_recv;
+  MPI::all_to_all(mpi_comm, potential_points, potential_points_recv);
+
+  // Now try to eval u0 for the received points
+  std::vector<std::vector<double> > coefficients_found(num_processes);
+  std::vector<std::vector<double> > points_found(num_processes);
+
+  for (std::size_t p = 0; p < num_processes; p++)
+  {
+    if (p == MPI::rank(mpi_comm))
+      continue;
+
+    std::vector<double> points = potential_points_recv[p];
+    for (std::size_t j = 0; j < points.size()/gdim1; j++)
+    {        
+      std::copy(points.begin()+j*gdim1, points.begin()+(j+1)*gdim1, x.begin());
+
+      try
+      { // push back when point is found
+        u0.eval(_values, _x);  
+        coefficients_found[p].insert(coefficients_found[p].end(), 
+                                     values.begin(), values.end());
+        points_found[p].insert(points_found[p].end(), x.begin(), x.end());
+      }
+      catch (std::exception &e)
+      { // If not found then do nothing          
+      }      
+    }
+  }
+
+  // Send back the found coefficients and points  
+  std::vector<std::vector<double> > coefficients_recv;
+  std::vector<std::vector<double> > points_recv;
+  MPI::all_to_all(mpi_comm, coefficients_found, coefficients_recv);
+  MPI::all_to_all(mpi_comm, points_found, points_recv);
+
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    if (p == MPI::rank(mpi_comm))
+      continue;
+
+    // Get the new values and points
+    std::vector<double> vals = coefficients_recv[p];
+    std::vector<double> pts = points_recv[p];
+
+    // Move all found coefficients into the local_u_vector
+    for (std::size_t j = 0; j < pts.size()/gdim1; j++)
+    {
+      std::copy(pts.begin()+j*gdim1, pts.begin()+(j+1)*gdim1, x.begin());
+
+      // Get the owned dofs sharing x 
+      std::vector<std::size_t> dofs = coords_to_dofs[x];
+
+      // Place result in local_u_vector
+      for (std::vector<std::size_t>::const_iterator d = dofs.begin(); 
+           d != dofs.end(); d++)
+        local_u_vector[*d-owner_range.first] = 
+          vals[j*u0.value_size()+dof_component_map[*d]];
+    }
+  }    
+  // Finalize
+  u.vector()->set_local(local_u_vector);
+  u.vector()->apply("insert");  
+}
+
+std::map<std::vector<double>, std::vector<std::size_t>, lt_coordinate> 
+LagrangeInterpolator::tabulate_coordinates_to_dofs(const GenericDofMap& dofmap, 
+                                                   const Mesh& mesh)
+{
+  std::map<std::vector<double>, std::vector<std::size_t>, lt_coordinate>
+  coords_to_dofs(lt_coordinate(1.0e-12));
+
+  // Geometric dimension
+  const std::size_t gdim = dofmap.geometric_dimension();
+  dolfin_assert(gdim == mesh.geometry().dim());
+
+  // Get dof ownership range
+  std::pair<std::size_t, std::size_t> owner_range = dofmap.ownership_range();
+
+  // Loop over cells and tabulate dofs
+  boost::multi_array<double, 2> coordinates;
+  std::vector<double> vertex_coordinates;
+  std::vector<double> coors(gdim);
+
+  // Speed up the computations by only visiting (most) dofs once
+  RangedIndexSet already_visited(owner_range);
+
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Update UFC cell
+    cell->get_vertex_coordinates(vertex_coordinates);
+
+    // Get local-to-global map
+    const std::vector<dolfin::la_index>& dofs = dofmap.cell_dofs(cell->index());
+
+    // Tabulate dof coordinates on cell
+    dofmap.tabulate_coordinates(coordinates, vertex_coordinates, *cell);
+
+    // Map dofs into coords_to_dofs
+    for (std::size_t i = 0; i < dofs.size(); ++i)
+    {
+      const std::size_t dof = dofs[i];
+
+      if (dof >=  owner_range.first && dof < owner_range.second)
+      {        
+        // Skip already checked dofs
+        if (!already_visited.insert(dof))
+          continue;
+
+        // Put coordinates in coors
+        std::copy(coordinates[i].begin(), coordinates[i].end(), coors.begin());
+
+        std::map<std::vector<double>, std::vector<std::size_t> >::const_iterator
+          it = coords_to_dofs.find(coors);        
+        if (it == coords_to_dofs.end())
+        { // Add coordinate and dof to map 
+          std::vector<std::size_t> dof_vec;
+          dof_vec.push_back(dof);  
+          coords_to_dofs[coors] = dof_vec;
+        }
+        else
+        { // Add dof to mapped coordinate
+          coords_to_dofs[coors].push_back(dof);
+        }
+      }
+    }
+  }
+  return coords_to_dofs;
+}
+
+void LagrangeInterpolator::extract_dof_component_map(boost::unordered_map<std::size_t, 
+                                                     std::size_t>& dof_component_map, 
+                                                     const FunctionSpace& V, 
+                                                     int* component)
+{ // Extract sub dofmaps recursively and store dof to component map
+  boost::unordered_map<std::size_t, std::size_t> collapsed_map;
+  boost::unordered_map<std::size_t, std::size_t>::const_iterator map_it;
+  std::vector<std::size_t> comp(1);
+
+  if (V.element()->num_sub_elements() == 0)
+  {
+    std::shared_ptr<GenericDofMap> dummy = 
+      V.dofmap()->collapse(collapsed_map, *V.mesh());
+    (*component)++;
+    for (map_it =collapsed_map.begin(); map_it!=collapsed_map.end(); ++map_it)
+      dof_component_map[map_it->second] = (*component);  
+  }
+  else
+  {
+    for (std::size_t i = 0; i < V.element()->num_sub_elements(); i++)
+    {
+      comp[0] = i;
+      std::shared_ptr<FunctionSpace> Vs = V.extract_sub_space(comp);
+      extract_dof_component_map(dof_component_map, *Vs, component);
+    }
+  }
+}
+
+bool LagrangeInterpolator::in_bounding_box(const std::vector<double>& point,
+                                           const std::vector<double>& bounding_box,
+                                           const double tol)
+{
+  // Return false if bounding box is empty
+  if (bounding_box.empty())
+    return false;
+  
+  const std::size_t gdim = point.size();
+  dolfin_assert(bounding_box.size() == 2*gdim);
+  for (std::size_t i = 0; i < gdim; ++i)
+  {
+    if (!(point[i] >= (bounding_box[i] - tol)
+      && point[i] <= (bounding_box[gdim + i] + tol)))
+    {
+      return false;
+    }
+  }
+  return true;
+}
diff --git a/dolfin/function/LagrangeInterpolator.h b/dolfin/function/LagrangeInterpolator.h
new file mode 100644
index 0000000..0a9ba46
--- /dev/null
+++ b/dolfin/function/LagrangeInterpolator.h
@@ -0,0 +1,109 @@
+// Copyright (C) 2014 Mikael Mortensen
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First added:  2014-02-12
+// Last changed: 
+
+#ifndef __LAGRANGE_INTERPOLATOR_H
+#define __LAGRANGE_INTERPOLATOR_H
+
+namespace dolfin
+{
+  // Comparison operator for hashing coordinates. Note that two
+  // coordinates are considered equal if equal to within specified
+  // tolerance.
+  struct lt_coordinate
+  {
+    lt_coordinate(double tolerance) : TOL(tolerance) {}
+
+    bool operator() (const std::vector<double>& x,
+                     const std::vector<double>& y) const
+    {
+      std::size_t n = std::max(x.size(), y.size());
+      for (std::size_t i = 0; i < n; ++i)
+      {
+        double xx = 0.0;
+        double yy = 0.0;
+        if (i < x.size())
+          xx = x[i];
+        if (i < y.size())
+          yy = y[i];
+
+        if (xx < (yy - TOL))
+          return true;
+        else if (xx > (yy + TOL))
+          return false;
+      }
+      return false;
+    }
+
+    // Tolerance
+    const double TOL;                  
+  };
+
+  class Expression;
+  class Function;
+  class GenericDofMap;
+  class Mesh;
+  class FunctionSpace;
+
+  /// This class interpolates efficiently from a GenericFunction
+  /// to a Lagrange Function 
+
+  class LagrangeInterpolator
+  {
+  public:
+
+    /// Interpolate Expression
+    ///
+    /// *Arguments*
+    ///     u  (_Function_)
+    ///         The resulting Function
+    ///     u0 (_Expression_)
+    ///         The Expression to be interpolated.
+    void interpolate(Function& u, const Expression& u0); 
+
+    /// Interpolate function (on possibly non-matching meshes)
+    ///
+    /// *Arguments*
+    ///     u  (_Function_)
+    ///         The resulting Function    
+    ///     u0 (_Function_)
+    ///         The Function to be interpolated.
+    void interpolate(Function& u, const Function& u0); 
+
+  private:
+
+    // Create a map from coordinates to a list of dofs that share the coordinate
+    std::map<std::vector<double>, std::vector<std::size_t>, lt_coordinate > 
+      tabulate_coordinates_to_dofs(const GenericDofMap& dofmap, const Mesh& mesh);
+
+    // Create a map from dof to its component index in Mixed Space
+    void extract_dof_component_map(boost::unordered_map<std::size_t, std::size_t>& 
+      dof_component_map, const FunctionSpace& V, int* component);
+
+    // Return true if point lies within bounding box
+    static bool in_bounding_box(const std::vector<double>& point,
+                                const std::vector<double>& bounding_box,
+                                const double tol);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/SpecialFacetFunction.cpp b/dolfin/function/SpecialFacetFunction.cpp
new file mode 100644
index 0000000..b151e06
--- /dev/null
+++ b/dolfin/function/SpecialFacetFunction.cpp
@@ -0,0 +1,53 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-10-13
+// Last changed: 2011-01-04
+
+#include <dolfin/common/Array.h>
+#include <dolfin/function/Function.h>
+#include "SpecialFacetFunction.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+SpecialFacetFunction::SpecialFacetFunction(std::vector<Function>& f_e, std::size_t dim)
+  : Expression(dim), _f_e(f_e)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+SpecialFacetFunction::SpecialFacetFunction(std::vector<Function>& f_e)
+  : Expression(), _f_e(f_e)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Function& SpecialFacetFunction::operator[] (std::size_t i) const
+{
+  dolfin_assert(i < _f_e.size());
+  return _f_e[i];
+}
+//-----------------------------------------------------------------------------
+void SpecialFacetFunction::eval(Array<double>& values, const Array<double>& x,
+                                const ufc::cell& cell) const
+{
+  values[0] = 0.0;
+  if (cell.local_facet >= 0)
+    _f_e[cell.local_facet].eval(values, x, cell);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/SpecialFacetFunction.h b/dolfin/function/SpecialFacetFunction.h
new file mode 100644
index 0000000..83508e6
--- /dev/null
+++ b/dolfin/function/SpecialFacetFunction.h
@@ -0,0 +1,85 @@
+// Copyright (C) 2010 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-10-13
+// Last changed: 2011-07-04
+
+#ifndef __SPECIAL_FACET_FUNCTION_H
+#define __SPECIAL_FACET_FUNCTION_H
+
+#include <vector>
+#include <dolfin/function/Expression.h>
+
+namespace ufc
+{
+  class cell;
+}
+
+namespace dolfin
+{
+
+  /// A _SpecialFacetFunction_ is a representation of a global
+  /// function that is in P(f) for each _Facet_ f in a _Mesh_
+  /// for some _FunctionSpace_ P
+
+  template <typename T> class Array;
+  class Function;
+
+  class SpecialFacetFunction : public Expression
+  {
+  public:
+
+    /// Create (scalar-valued) SpecialFacetFunction
+    ///
+    /// *Arguments*
+    ///     f_e (std::vector<_Function_>)
+    ///        Separate _Function_s for each facet
+    explicit SpecialFacetFunction(std::vector<Function>& f_e);
+
+    /// Create (vector-valued) SpecialFacetFunction
+    ///
+    /// *Arguments*
+    ///     f_e (std::vector<_Function_>)
+    ///        Separate _Function_s for each facet
+    ///
+    ///     dim (int)
+    ///         The value-dimension of the Functions
+    SpecialFacetFunction(std::vector<Function>& f_e, std::size_t dim);
+
+    /// Evaluate SpecialFacetFunction (cf _Expression_.eval)
+    /// Evaluate function for given cell
+    void eval(Array<double>& values, const Array<double>& x,
+              const ufc::cell& cell) const;
+
+    /// Extract sub-function i
+    ///
+    /// *Arguments*
+    ///     i (int)
+    ///        component
+    ///
+    /// *Returns*
+    ///     _Function_
+    Function& operator[] (std::size_t i) const;
+
+  private:
+
+    std::vector<Function>& _f_e;
+
+  };
+
+}
+#endif
diff --git a/dolfin/function/SpecialFunctions.cpp b/dolfin/function/SpecialFunctions.cpp
new file mode 100644
index 0000000..36c2d36
--- /dev/null
+++ b/dolfin/function/SpecialFunctions.cpp
@@ -0,0 +1,75 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristian B. Oelgaard, 2007, 2008.
+// Modified by Martin Sandve Alnes, 2008.
+// Modified by Garth N. Wells, 2008, 2009.
+//
+// First added:  2008-07-17
+// Last changed: 2011-11-16
+
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+#include "SpecialFunctions.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshCoordinates::MeshCoordinates(const Mesh& mesh)
+  : Expression(mesh.geometry().dim()), _mesh(mesh)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void MeshCoordinates::eval(Array<double>& values,
+                           const Array<double>& x,
+                           const ufc::cell& cell) const
+{
+  dolfin_assert(cell.geometric_dimension == _mesh.geometry().dim());
+  dolfin_assert(x.size() == _mesh.geometry().dim());
+
+  for (std::size_t i = 0; i < cell.geometric_dimension; ++i)
+    values[i] = x[i];
+}
+//-----------------------------------------------------------------------------
+FacetArea::FacetArea(const Mesh& mesh)
+  : _mesh(mesh),
+    not_on_boundary("*** Warning: evaluating special function FacetArea on a "
+                    "non-facet domain, returning zero.")
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void FacetArea::eval(Array<double>& values,
+                     const Array<double>& x,
+                     const ufc::cell& cell) const
+{
+  dolfin_assert(cell.geometric_dimension == _mesh.geometry().dim());
+
+  if (cell.local_facet >= 0)
+  {
+    Cell c(_mesh, cell.index);
+    values[0] = c.facet_area(cell.local_facet);
+  }
+  else
+  {
+    not_on_boundary();
+    values[0] = 0.0;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/SpecialFunctions.h b/dolfin/function/SpecialFunctions.h
new file mode 100644
index 0000000..c80f961
--- /dev/null
+++ b/dolfin/function/SpecialFunctions.h
@@ -0,0 +1,82 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristian B. Oelgaard 2007
+// Modified by Martin Sandve Alnes 2008
+// Modified by Garth N. Wells 2008
+//
+// First added:  2006-02-09
+// Last changed: 2011-11-16
+
+#ifndef __SPECIAL_FUNCTIONS_H
+#define __SPECIAL_FUNCTIONS_H
+
+#include <dolfin/log/Event.h>
+#include <dolfin/common/Array.h>
+#include "Expression.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This Function represents the mesh coordinates on a given mesh.
+  class MeshCoordinates : public Expression
+  {
+  public:
+
+    /// Constructor
+    explicit MeshCoordinates(const Mesh& mesh);
+
+    /// Evaluate function
+    void eval(Array<double>& values,
+              const Array<double>& x,
+              const ufc::cell& cell) const;
+
+  private:
+
+    // The mesh
+    const Mesh& _mesh;
+
+  };
+
+  /// This function represents the area/length of a cell facet on a given mesh.
+  class FacetArea : public Expression
+  {
+  public:
+
+    /// Constructor
+    explicit FacetArea(const Mesh& mesh);
+
+    /// Evaluate function
+    void eval(Array<double>& values,
+              const Array<double>& x,
+              const ufc::cell& cell) const;
+
+  private:
+
+    // The mesh
+    const Mesh& _mesh;
+
+    // Warning when evaluating on cells
+    mutable Event not_on_boundary;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/SubSpace.cpp b/dolfin/function/SubSpace.cpp
new file mode 100644
index 0000000..f06214a
--- /dev/null
+++ b/dolfin/function/SubSpace.cpp
@@ -0,0 +1,61 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2009.
+//
+// First added:  2008-11-03
+// Last changed: 2009-05-17
+
+#include <dolfin/common/NoDeleter.h>
+#include "SubSpace.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+SubSpace::SubSpace(const FunctionSpace& V, std::size_t component)
+  : FunctionSpace(V.mesh(), V.element(), V.dofmap())
+{
+  // Create array
+  std::vector<std::size_t> c;
+  c.push_back(component);
+
+  // Extract subspace and assign
+  std::shared_ptr<FunctionSpace> _function_space(V.extract_sub_space(c));
+  *static_cast<FunctionSpace*>(this) = *_function_space;
+}
+//-----------------------------------------------------------------------------
+SubSpace::SubSpace(const FunctionSpace& V, std::size_t component, std::size_t sub_component)
+  : FunctionSpace(V.mesh(), V.element(), V.dofmap())
+{
+  // Create array
+  std::vector<std::size_t> c;
+  c.push_back(component);
+  c.push_back(sub_component);
+
+  // Extract subspace and assign
+  std::shared_ptr<FunctionSpace> _function_space(V.extract_sub_space(c));
+  *static_cast<FunctionSpace*>(this) = *_function_space;
+}
+//-----------------------------------------------------------------------------
+SubSpace::SubSpace(const FunctionSpace& V, const std::vector<std::size_t>& component)
+  : FunctionSpace(V.mesh(), V.element(), V.dofmap())
+{
+  // Extract subspace and assign
+  std::shared_ptr<FunctionSpace> _function_space(V.extract_sub_space(component));
+  *static_cast<FunctionSpace*>(this) = *_function_space;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/SubSpace.h b/dolfin/function/SubSpace.h
new file mode 100644
index 0000000..6542e34
--- /dev/null
+++ b/dolfin/function/SubSpace.h
@@ -0,0 +1,61 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-11-03
+// Last changed: 2008-11-03
+
+#ifndef __SUB_SPACE_H
+#define __SUB_SPACE_H
+
+#include <vector>
+#include "FunctionSpace.h"
+
+namespace dolfin
+{
+
+  /// This class represents a subspace (component) of a function space.
+  ///
+  /// The subspace is specified by an array of indices. For example,
+  /// the array [3, 0, 2] specifies subspace 2 of subspace 0 of
+  /// subspace 3.
+  ///
+  /// A typical example is the function space W = V x P for Stokes.
+  /// Here, V = W[0] is the subspace for the velocity component and
+  /// P = W[1] is the subspace for the pressure component. Furthermore,
+  /// W[0][0] = V[0] is the first component of the velocity space etc.
+
+  class SubSpace : public FunctionSpace
+  {
+  public:
+
+    /// Create subspace for given component (one level)
+    SubSpace(const FunctionSpace& V,
+             std::size_t component);
+
+    /// Create subspace for given component (two levels)
+    SubSpace(const FunctionSpace& V,
+             std::size_t component, std::size_t sub_component);
+
+    /// Create subspace for given component (n levels)
+    SubSpace(const FunctionSpace& V,
+             const std::vector<std::size_t>& component);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/function/assign.cpp b/dolfin/function/assign.cpp
new file mode 100644
index 0000000..3e1619e
--- /dev/null
+++ b/dolfin/function/assign.cpp
@@ -0,0 +1,64 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-11-07
+// Last changed: 2013-11-07
+
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include "assign.h"
+#include "FunctionAssigner.h"
+
+//-----------------------------------------------------------------------------
+void dolfin::assign(std::shared_ptr<Function> receiving_func,
+		    std::shared_ptr<const Function> assigning_func)
+{
+  // Instantiate FunctionAssigner and call assign
+  const FunctionAssigner assigner(receiving_func->function_space(),
+				  assigning_func->function_space());
+  assigner.assign(receiving_func, assigning_func);
+}
+//-----------------------------------------------------------------------------
+void dolfin::assign(std::shared_ptr<Function> receiving_func,
+	      std::vector<std::shared_ptr<const Function> > assigning_funcs)
+{
+
+  // Instantiate FunctionAssigner and call assign
+  std::vector<std::shared_ptr<const FunctionSpace> > assigning_spaces;
+  for (std::size_t i = 0; i < assigning_funcs.size(); i++)
+    assigning_spaces.push_back(assigning_funcs[i]->function_space());
+
+  const FunctionAssigner assigner(receiving_func->function_space(),
+				  assigning_spaces);
+  assigner.assign(receiving_func, assigning_funcs);
+
+}
+//-----------------------------------------------------------------------------
+void dolfin::assign(std::vector<std::shared_ptr<Function> > receiving_funcs,
+		    std::shared_ptr<const Function> assigning_func)
+{
+  // Instantiate FunctionAssigner and call assign
+  std::vector<std::shared_ptr<const FunctionSpace> > receiving_spaces;
+
+  for (std::size_t i = 0; i < receiving_funcs.size(); i++)
+    receiving_spaces.push_back(receiving_funcs[i]->function_space());
+
+  const FunctionAssigner assigner(receiving_spaces,
+				  assigning_func->function_space());
+  assigner.assign(receiving_funcs, assigning_func);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/function/assign.h b/dolfin/function/assign.h
new file mode 100644
index 0000000..b837771
--- /dev/null
+++ b/dolfin/function/assign.h
@@ -0,0 +1,62 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-11-07
+// Last changed: 2013-11-11
+
+#ifndef __DOLFIN_ASSIGN_H
+#define __DOLFIN_ASSIGN_H
+
+#include <vector>
+#include <memory>
+
+namespace dolfin
+{
+  
+  class Function;
+
+  /// Assign one function to another. The functions must reside in the
+  /// same type of FunctionSpace. One or both functions can be sub
+  /// functions.
+  ///
+  /// *Arguments*
+  ///     receiving_func (std::shared_ptr<_Function_>)
+  ///         The recieving function 
+  ///     assigning_func (std::shared_ptr<_Function_>)
+  ///         The assigning function 
+  void assign(std::shared_ptr<Function> receiving_func,
+	      std::shared_ptr<const Function> assigning_func);
+
+  /// Assign several functions to sub functions of a mixed receiving
+  /// function. The number of receiving functions must sum up to the
+  /// number of sub functions in the assigning mixed function. The sub
+  /// spaces of the assigning mixed space must be of the same type ans
+  /// size as the receiving spaces.
+  void assign(std::shared_ptr<Function> receiving_func,
+	      std::vector<std::shared_ptr<const Function> > assigning_funcs);
+
+  /// Assign sub functions of a single mixed function to single
+  /// receiving functions. The number of sub functions in the
+  /// assigning mixed function must sum up to the number of receiving
+  /// functions. The sub spaces of the receiving mixed space must be
+  /// of the same type ans size as the assigning spaces.
+  void assign(std::vector<std::shared_ptr<Function> > receiving_funcs, 
+	      std::shared_ptr<const Function> assigning_func);
+
+}
+
+#endif
diff --git a/dolfin/function/dolfin_function.h b/dolfin/function/dolfin_function.h
new file mode 100644
index 0000000..6a07192
--- /dev/null
+++ b/dolfin/function/dolfin_function.h
@@ -0,0 +1,21 @@
+#ifndef __DOLFIN_FUNCTION_H
+#define __DOLFIN_FUNCTION_H
+
+// DOLFIN function interface
+
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/Expression.h>
+#include <dolfin/function/FunctionAXPY.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/SubSpace.h>
+#include <dolfin/function/Constant.h>
+#include <dolfin/function/SpecialFunctions.h>
+#include <dolfin/function/SpecialFacetFunction.h>
+#include <dolfin/function/CCFEMFunctionSpace.h>
+#include <dolfin/function/FunctionAssigner.h>
+#include <dolfin/function/assign.h>
+#include <dolfin/function/CCFEMFunction.h>
+#include <dolfin/function/LagrangeInterpolator.h>
+
+#endif
diff --git a/dolfin/generation/BoxMesh.cpp b/dolfin/generation/BoxMesh.cpp
new file mode 100644
index 0000000..959d95a
--- /dev/null
+++ b/dolfin/generation/BoxMesh.cpp
@@ -0,0 +1,158 @@
+// Copyright (C) 2005-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2007.
+// Modified by Nuno Lopes, 2008.
+//
+// First added:  2005-12-02
+// Last changed: 2014-02-06
+
+#include <dolfin/common/constants.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include "BoxMesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+BoxMesh::BoxMesh(double x0, double y0, double z0,
+                 double x1, double y1, double z1,
+                 std::size_t nx, std::size_t ny, std::size_t nz)
+  : Mesh(MPI_COMM_WORLD)
+{
+  build(x0, y0, z0, x1, y1, z1, nx, ny, nz);
+}
+//-----------------------------------------------------------------------------
+BoxMesh::BoxMesh(MPI_Comm comm,
+                 double x0, double y0, double z0,
+                 double x1, double y1, double z1,
+                 std::size_t nx, std::size_t ny, std::size_t nz)
+  : Mesh(comm)
+{
+  build(x0, y0, z0, x1, y1, z1, nx, ny, nz);
+}
+//-----------------------------------------------------------------------------
+void BoxMesh::build(double x0, double y0, double z0,
+                    double x1, double y1, double z1,
+                    std::size_t nx, std::size_t ny, std::size_t nz)
+{
+  Timer timer("Generate Box mesh");
+
+  // Receive mesh according to parallel policy
+  if (MPI::is_receiver(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+
+  const double a = x0;
+  const double b = x1;
+  const double c = y0;
+  const double d = y1;
+  const double e = z0;
+  const double f = z1;
+
+  if (std::abs(x0 - x1) < DOLFIN_EPS || std::abs(y0 - y1) < DOLFIN_EPS
+      || std::abs(z0 - z1) < DOLFIN_EPS )
+  {
+    dolfin_error("BoxMesh.cpp",
+                 "create box",
+                 "Box seems to have zero width, height or depth. Consider checking your dimensions");
+  }
+
+  if ( nx < 1 || ny < 1 || nz < 1 )
+  {
+    dolfin_error("BoxMesh.cpp",
+                 "create box",
+                 "BoxMesh has non-positive number of vertices in some dimension: number of vertices must be at least 1 in each dimension");
+  }
+
+  rename("mesh", "Mesh of the cuboid (a,b) x (c,d) x (e,f)");
+
+  // Open mesh for editing
+  MeshEditor editor;
+  editor.open(*this, CellType::tetrahedron, 3, 3);
+
+  // Storage for vertex coordinates
+  std::vector<double> x(3);
+
+  // Create vertices
+  editor.init_vertices_global((nx + 1)*(ny + 1)*(nz + 1), (nx + 1)*(ny + 1)*(nz + 1));
+  std::size_t vertex = 0;
+  for (std::size_t iz = 0; iz <= nz; iz++)
+  {
+    x[2] = e + (static_cast<double>(iz))*(f-e) / static_cast<double>(nz);
+    for (std::size_t iy = 0; iy <= ny; iy++)
+    {
+      x[1] = c + (static_cast<double>(iy))*(d-c) / static_cast<double>(ny);
+      for (std::size_t ix = 0; ix <= nx; ix++)
+      {
+        x[0] = a + (static_cast<double>(ix))*(b-a) / static_cast<double>(nx);
+        editor.add_vertex(vertex, x);
+        vertex++;
+      }
+    }
+  }
+
+  // Create tetrahedra
+  editor.init_cells_global(6*nx*ny*nz, 6*nx*ny*nz);
+  std::size_t cell = 0;
+  std::vector<std::vector<std::size_t> > cells(6, std::vector<std::size_t>(4));
+  for (std::size_t iz = 0; iz < nz; iz++)
+  {
+    for (std::size_t iy = 0; iy < ny; iy++)
+    {
+      for (std::size_t ix = 0; ix < nx; ix++)
+      {
+        const std::size_t v0 = iz*(nx + 1)*(ny + 1) + iy*(nx + 1) + ix;
+        const std::size_t v1 = v0 + 1;
+        const std::size_t v2 = v0 + (nx + 1);
+        const std::size_t v3 = v1 + (nx + 1);
+        const std::size_t v4 = v0 + (nx + 1)*(ny + 1);
+        const std::size_t v5 = v1 + (nx + 1)*(ny + 1);
+        const std::size_t v6 = v2 + (nx + 1)*(ny + 1);
+        const std::size_t v7 = v3 + (nx + 1)*(ny + 1);
+
+        // Note that v0 < v1 < v2 < v3 < vmid.
+        cells[0][0] = v0; cells[0][1] = v1; cells[0][2] = v3; cells[0][3] = v7;
+        cells[1][0] = v0; cells[1][1] = v1; cells[1][2] = v7; cells[1][3] = v5;
+        cells[2][0] = v0; cells[2][1] = v5; cells[2][2] = v7; cells[2][3] = v4;
+        cells[3][0] = v0; cells[3][1] = v3; cells[3][2] = v2; cells[3][3] = v7;
+        cells[4][0] = v0; cells[4][1] = v6; cells[4][2] = v4; cells[4][3] = v7;
+        cells[5][0] = v0; cells[5][1] = v2; cells[5][2] = v6; cells[5][3] = v7;
+
+        // Add cells
+        std::vector<std::vector<std::size_t> >::const_iterator _cell;
+        for (_cell = cells.begin(); _cell != cells.end(); ++_cell)
+          editor.add_cell(cell++, *_cell);
+      }
+    }
+  }
+
+  // Close mesh editor
+  editor.close();
+
+  // Broadcast mesh according to parallel policy
+  if (MPI::is_broadcaster(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/BoxMesh.h b/dolfin/generation/BoxMesh.h
new file mode 100644
index 0000000..db15466
--- /dev/null
+++ b/dolfin/generation/BoxMesh.h
@@ -0,0 +1,123 @@
+// Copyright (C) 2005-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Nuno Lopes, 2008.
+// Modified by Mikael Mortensen, 2014.
+//
+// First added:  2005-12-02
+// Last changed: 2014-02-17
+
+#ifndef __BOX_H
+#define __BOX_H
+
+#include <cstddef>
+#include <dolfin/common/MPI.h>
+#include <dolfin/mesh/Mesh.h>
+
+namespace dolfin
+{
+
+  /// Tetrahedral mesh of the 3D rectangular prism [x0, x1] x [y0, y1]
+  /// x [z0, z1].  Given the number of cells (nx, ny, nz) in each
+  /// direction, the total number of tetrahedra will be 6*nx*ny*nz and
+  /// the total number of vertices will be (nx + 1)*(ny + 1)*(nz + 1).
+
+  class BoxMesh : public Mesh
+  {
+  public:
+
+    /// Create a uniform finite element _Mesh_ over the rectangular prism
+    /// [x0, x1] x [y0, y1] x [z0, z1].
+    ///
+    /// *Arguments*
+    ///     x0 (double)
+    ///         :math:`x`-min.
+    ///     y0 (double)
+    ///         :math:`y`-min.
+    ///     z0 (double)
+    ///         :math:`z`-min.
+    ///     x1 (double)
+    ///         :math:`x`-max.
+    ///     y1 (double)
+    ///         :math:`y`-max.
+    ///     z1 (double)
+    ///         :math:`z`-max.
+    ///     xn (double)
+    ///         Number of cells in :math:`x`-direction.
+    ///     yn (double)
+    ///         Number of cells in :math:`y`-direction.
+    ///     zn (double)
+    ///         Number of cells in :math:`z`-direction.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Mesh with 6 cells in each direction on the
+    ///         // set [-1,2] x [-1,2] x [-1,2].
+    ///         BoxMesh mesh(-1, -1, -1, 2, 2, 2, 6, 6, 6);
+    ///
+    BoxMesh(double x0, double y0, double z0, double x1, double y1, double z1,
+            std::size_t nx, std::size_t ny, std::size_t nz);
+
+    /// Create a uniform finite element _Mesh_ over the rectangular prism
+    /// [x0, x1] x [y0, y1] x [z0, z1].
+    ///
+    /// *Arguments*
+    ///     comm (MPI_Comm)
+    ///         MPI communicator
+    ///     x0 (double)
+    ///         :math:`x`-min.
+    ///     y0 (double)
+    ///         :math:`y`-min.
+    ///     z0 (double)
+    ///         :math:`z`-min.
+    ///     x1 (double)
+    ///         :math:`x`-max.
+    ///     y1 (double)
+    ///         :math:`y`-max.
+    ///     z1 (double)
+    ///         :math:`z`-max.
+    ///     xn (double)
+    ///         Number of cells in :math:`x`-direction.
+    ///     yn (double)
+    ///         Number of cells in :math:`y`-direction.
+    ///     zn (double)
+    ///         Number of cells in :math:`z`-direction.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Mesh with 6 cells in each direction on the
+    ///         // set [-1,2] x [-1,2] x [-1,2].
+    ///         BoxMesh mesh(MPI_COMM_WORLD, -1, -1, -1, 2, 2, 
+    ///                      2, 6, 6, 6);
+    ///
+    BoxMesh(MPI_Comm comm,
+            double x0, double y0, double z0, double x1, double y1, double z1,
+            std::size_t nx, std::size_t ny, std::size_t nz);
+
+  private:
+
+    // Build mesh
+    void build(double x0, double y0, double z0, double x1, double y1, double z1,
+               std::size_t nx, std::size_t ny, std::size_t nz);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/CGALMeshBuilder.h b/dolfin/generation/CGALMeshBuilder.h
new file mode 100644
index 0000000..44f8148
--- /dev/null
+++ b/dolfin/generation/CGALMeshBuilder.h
@@ -0,0 +1,529 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-02-02
+// Last changed: 2014-02-06
+
+#ifndef __DOLFIN_CGALMESHBUILDER_H
+#define __DOLFIN_CGALMESHBUILDER_H
+
+#ifdef HAS_CGAL
+
+#include <vector>
+
+#include <CGAL/Constrained_Delaunay_triangulation_2.h>
+#include <CGAL/Triangulation_2.h>
+#include <CGAL/Triangulation_3.h>
+
+#include <dolfin/geometry/ImplicitSurface.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+
+// This file should not be indlued in any header files to avoid
+// polluting DOLFIN with CGAL code.
+
+namespace dolfin
+{
+
+  /// This class provides a function to build a DOLFIN Mesh from a
+  /// CGAL mesh or triangulation
+
+  class CGALMeshBuilder
+  {
+  public:
+
+    /// Build DOLFIN Mesh from a CGAL triangulation
+    template<typename T>
+    static void build(Mesh& mesh, T& triangulation);
+
+    /// Build DOLFIN Mesh from a CGAL mesh (C3t3)
+    template<typename T>
+    static void build_from_mesh(Mesh& mesh, T& cgal_mesh);
+
+    /// Build DOLFIN Mesh from a CGAL surface mesh (C2t3)
+    template<typename T>
+      static void build_surface_mesh_c3t3(Mesh& mesh, T& cgal_mesh,
+                                          const ImplicitSurface* surface=NULL);
+
+    /// Build DOLFIN Mesh from a CGAL surface mesh (C2t3)
+    template<typename T>
+      static void build_surface_mesh_c2t3(Mesh& mesh, T& cgal_mesh,
+                                          const ImplicitSurface* surface=NULL);
+
+    /// Build DOLFIN surface mesh from a CGAL polyhedron_3
+    template<typename T>
+    static void build_surface_mesh_poly(Mesh& mesh, T& polyhedron);
+
+  private:
+
+    // Get number of cells in triangulation (2D)
+    template<typename X, typename Y>
+    static std::size_t _num_cells(const CGAL::Triangulation_2<X, Y>& t)
+    { return t.number_of_faces(); }
+
+    // Get number of cells in Delaunay triangulation (2D)
+    template<typename X, typename Y>
+    static std::size_t
+      _num_cells(const CGAL::Constrained_Delaunay_triangulation_2<X, Y>& t)
+    {
+      std::size_t num_cells = 0;
+      typename CGAL::Constrained_Delaunay_triangulation_2<X, Y>::Finite_faces_iterator cgal_cell;
+      for (cgal_cell = t.finite_faces_begin();
+           cgal_cell != t.finite_faces_end(); ++cgal_cell)
+      {
+        if(cgal_cell->is_in_domain())
+          ++num_cells;
+      }
+      return num_cells;
+    }
+
+    // Get number of cells in triangulation (3D)
+    template<typename X, typename Y>
+    static std::size_t _num_cells(const CGAL::Triangulation_3<X, Y>& t)
+    { return t.number_of_cells(); }
+
+    // Add cells to mesh (default)
+    template<typename T, typename Y>
+    static void add_cells(MeshEditor& mesh_editor, const T& t)
+    {
+      dolfin_error("CGALMeshBuilder.h",
+                   "add CGAL cells to DOLFIN Mesh",
+                   "Cannot find suitable specialized template funtion");
+    }
+
+    // Add cells (from 2D CGAL triangulation)
+    template<typename X, typename Y>
+    static void add_cells(MeshEditor& mesh_editor,
+                          const CGAL::Triangulation_2<X, Y>& t)
+    {
+      std::size_t cell_index = 0;
+      typename CGAL::Triangulation_2<X, Y>::Finite_faces_iterator cgal_cell;
+      for (cgal_cell = t.finite_faces_begin();
+           cgal_cell != t.finite_faces_end(); ++cgal_cell)
+      {
+        std::vector<std::size_t> cell_data(3);
+        for (std::size_t i = 0; i < 3; ++i)
+          cell_data[i] = cgal_cell->vertex(i)->info();
+        mesh_editor.add_cell(cell_index++, cell_data);
+      }
+    }
+
+    // Add cells (from 2D CGAL constrained Delaunay triangulation)
+    template<typename X, typename Y>
+    static void add_cells(MeshEditor& mesh_editor,
+                          const CGAL::Constrained_Delaunay_triangulation_2<X, Y>& t)
+    {
+      std::size_t cell_index = 0;
+      typename CGAL::Constrained_Delaunay_triangulation_2<X, Y>::Finite_faces_iterator cgal_cell;
+      for (cgal_cell = t.finite_faces_begin();
+           cgal_cell != t.finite_faces_end(); ++cgal_cell)
+      {
+        // Add cell if it is in the domain
+        if(cgal_cell->is_in_domain())
+        {
+          std::vector<std::size_t> cell_data(3);
+          for (std::size_t i = 0; i < 3; ++i)
+            cell_data[i] = cgal_cell->vertex(i)->info();
+          mesh_editor.add_cell(cell_index++, cell_data);
+        }
+      }
+    }
+
+    // Add cells (from 3D CGAL triangulation)
+    template<typename X, typename Y>
+    static void add_cells(MeshEditor& mesh_editor,
+                          const CGAL::Triangulation_3<X, Y>& t)
+    {
+      std::size_t cell_index = 0;
+      typename CGAL::Triangulation_3<X, Y>::Finite_cells_iterator cgal_cell;
+      for (cgal_cell = t.finite_cells_begin();
+           cgal_cell != t.finite_cells_end(); ++cgal_cell)
+      {
+        std::vector<std::size_t> cell_data(4);
+        for (std::size_t i = 0; i < 4; ++i)
+          cell_data[i] = cgal_cell->vertex(i)->info();
+        mesh_editor.add_cell(cell_index++, cell_data);
+      }
+    }
+
+  };
+
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void CGALMeshBuilder::build(Mesh& mesh, T& triangulation)
+  {
+    // Clear mesh
+    mesh.clear();
+
+    // Get various dimensions
+    const std::size_t gdim
+      = triangulation.finite_vertices_begin()->point().dimension();
+    const std::size_t tdim = triangulation.dimension();
+    const std::size_t num_vertices = triangulation.number_of_vertices();
+    const std::size_t num_cells = _num_cells(triangulation);
+
+    // Create a MeshEditor and open
+    dolfin::MeshEditor mesh_editor;
+    mesh_editor.open(mesh, tdim, gdim);
+    mesh_editor.init_vertices_global(num_vertices, num_vertices);
+    mesh_editor.init_cells_global(num_cells, num_cells);
+
+    // Add vertices to mesh
+    std::size_t vertex_index = 0;
+    typename T::Finite_vertices_iterator cgal_vertex;
+    for (cgal_vertex = triangulation.finite_vertices_begin();
+         cgal_vertex != triangulation.finite_vertices_end(); ++cgal_vertex)
+    {
+      // Get vertex coordinates and add vertex to the mesh
+      Point p;
+      p[0] = cgal_vertex->point()[0];
+      p[1] = cgal_vertex->point()[1];
+      if (gdim == 3)
+        p[2] = cgal_vertex->point()[2];
+
+      // Add mesh vertex
+      mesh_editor.add_vertex(vertex_index, p);
+
+      // Attach index to vertex and increment
+      cgal_vertex->info() = vertex_index++;
+    }
+
+    // Add cells to mesh (calls specialized function because CGAL
+    // function names differ in 2D and 3D)
+    add_cells(mesh_editor, triangulation);
+
+    // Close mesh editor
+    mesh_editor.close();
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void CGALMeshBuilder::build_from_mesh(Mesh& mesh, T& cgal_mesh)
+  {
+    // Clear mesh
+    mesh.clear();
+
+    // CGAL triangulation
+    typename T::Triangulation t = cgal_mesh.triangulation();
+
+    // Get various dimensions
+    const std::size_t gdim = t.finite_vertices_begin()->point().dimension();
+    const std::size_t tdim = t.dimension();
+    const std::size_t num_vertices = t.number_of_vertices();
+    const std::size_t num_cells = cgal_mesh.number_of_cells();
+
+    // Create a MeshEditor and open
+    dolfin::MeshEditor mesh_editor;
+    mesh_editor.open(mesh, tdim, gdim);
+    mesh_editor.init_vertices_global(num_vertices, num_vertices);
+    mesh_editor.init_cells_global(num_cells, num_cells);
+
+    // Add vertices to mesh
+    std::size_t vertex_index = 0;
+    typename T::Triangulation::Finite_vertices_iterator v;
+    for (v = t.finite_vertices_begin(); v != t.finite_vertices_end(); ++v)
+    {
+      // Get vertex coordinates and add vertex to the mesh
+      Point p;
+      p[0] = v->point()[0];
+      p[1] = v->point()[1];
+      p[2] = v->point()[2];
+
+      // Add mesh vertex
+      mesh_editor.add_vertex(vertex_index, p);
+
+      // Attach index to vertex and increment
+      v->info() = vertex_index++;
+    }
+
+    // Sanity check on number of vertices
+    dolfin_assert(vertex_index == num_vertices);
+
+    // Iterate over all cell in triangulation
+    std::size_t cell_index = 0;
+    typename T::Triangulation::Finite_cells_iterator c;
+    for (c = t.finite_cells_begin(); c != t.finite_cells_end(); ++c)
+    {
+      // Add cell if in CGAL mesh, and increment index
+      if (cgal_mesh.is_in_complex(c))
+      {
+        std::vector<std::size_t> cell_data(4);
+        for (std::size_t i = 0; i < 4; ++i)
+          cell_data[i] = c->vertex(i)->info();
+        mesh_editor.add_cell(cell_index++, cell_data);
+      }
+    }
+
+    // Sanity check on number of cells
+    dolfin_assert(cell_index == num_cells);
+
+    // Close mesh editor
+    mesh_editor.close();
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void CGALMeshBuilder::build_surface_mesh_c3t3(Mesh& mesh, T& cgal_mesh,
+                                                  const ImplicitSurface* surface )
+  {
+    // Clear mesh
+    mesh.clear();
+
+    // CGAL triangulation
+    typename T::Triangulation t = cgal_mesh.triangulation();
+
+    // Get various dimensions
+    const std::size_t gdim = 3;
+    const std::size_t tdim = 2;
+    const std::size_t num_vertices = t.number_of_vertices();
+    const std::size_t num_cells = cgal_mesh.number_of_facets();
+
+    // Create a MeshEditor and open
+    dolfin::MeshEditor mesh_editor;
+    mesh_editor.open(mesh, tdim, gdim);
+    mesh_editor.init_vertices_global(num_vertices, num_vertices);
+    mesh_editor.init_cells_global(num_cells, num_cells);
+
+    // Set all vertex indices to -1
+    typename T::Facets_in_complex_iterator c;
+    for (c = cgal_mesh.facets_in_complex_begin();
+         c != cgal_mesh.facets_in_complex_end(); ++c)
+    {
+      c->first->vertex( (c->second + 1)%4 )->info() = -1;
+      c->first->vertex( (c->second + 2)%4 )->info() = -1;
+      c->first->vertex( (c->second + 3)%4 )->info() = -1;
+    }
+
+    // Iterate over facets
+    std::size_t cell_index = 0;
+    std::size_t vertex_index = 0;
+    for (c = cgal_mesh.facets_in_complex_begin();
+         c != cgal_mesh.facets_in_complex_end(); ++c)
+    {
+      // Notes:
+      // - c->first is the volume cell
+      // - c->second is the local facet index. Facet local index is same
+      //   loocal index of opposite vertex
+
+      typedef typename T::Triangulation::Point Point_3;
+      if (surface)
+      {
+        // Compute centroid of facet
+        Point p;
+        for (std::size_t i = 1; i < 4; ++i)
+        {
+          // Get the vertex point
+          const Point_3& _p = c->first->vertex((c->second + i)%4)->point();
+          p[0] += _p.x(); p[1] += _p.y(); p[2] += _p.z();
+        }
+        p[0] /= 3.0; p[1] /= 3.0; p[2] /= 3.0;
+
+        // Check if facet should be added. If not, continue
+        if (!surface->on_surface(p))
+          continue;
+      }
+
+      // Add vertex if not already added and increment index
+      for (std::size_t i = 1; i < 4; ++i)
+      {
+        // Get the ((c->second + i)%4) cell vertex info
+        const int v_index = c->first->vertex( (c->second + i)%4 )->info();
+
+        // In vertex index has not been set, set now and add to mesh
+        if (v_index < 0)
+        {
+          c->first->vertex((c->second + i)%4)->info() = vertex_index;
+
+          // Get vertex coordinates and add vertex to the mesh
+          Point p;
+          for (std::size_t j = 0; j < 3; ++j)
+            p[j] = c->first->vertex((c->second + i) % 4)->point()[j];
+          mesh_editor.add_vertex(vertex_index, p);
+          ++vertex_index;
+        }
+      }
+
+      // Get cell vertices and add to Mesh
+      std::vector<std::size_t> vertex_indices(3);
+      for (std::size_t i = 0; i < 3; ++i)
+        vertex_indices[i] = c->first->vertex( (c->second + i + 1)%4 )->info();
+      mesh_editor.add_cell(cell_index++, vertex_indices);
+    }
+
+    // Close mesh editor
+    mesh_editor.close();
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    void CGALMeshBuilder::build_surface_mesh_c2t3(Mesh& mesh, T& cgal_mesh,
+                                                  const ImplicitSurface* surface)
+  {
+    if (surface)
+      error("CGALMeshBuilder::build_surface_mesh_c2t3 does not yet support implicit surfaces");
+
+    // Clear mesh
+    mesh.clear();
+
+    // CGAL triangulation
+    typename T::Triangulation t = cgal_mesh.triangulation();
+
+    // Get various dimensions
+    const std::size_t gdim = 3;
+    const std::size_t tdim = 2;
+    const std::size_t num_vertices = t.number_of_vertices();
+    const std::size_t num_cells = cgal_mesh.number_of_facets();
+
+    // Create a MeshEditor and open
+    dolfin::MeshEditor mesh_editor;
+    mesh_editor.open(mesh, tdim, gdim);
+    mesh_editor.init_vertices_global(num_vertices, num_vertices);
+    mesh_editor.init_cells_global(num_cells, num_cells);
+
+    std::size_t vertex_index = 0;
+    typename T::Vertex_iterator v;
+    for (v = cgal_mesh.vertices_begin(); v != cgal_mesh.vertices_end(); ++v)
+      v->info() = -1;
+
+    std::size_t cell_index = 0;
+    typename T::Facet_iterator c;
+    for (c = cgal_mesh.facets_begin(); c != cgal_mesh.facets_end(); ++c)
+    {
+      // Add cell if in CGAL mesh, and increment index
+      if (cgal_mesh.is_in_complex(*c))
+      {
+        // Check that cell is on surface
+        typedef typename T::Triangulation::Point Point_3;
+        if (surface)
+        {
+          // Compute centroid of facet
+          Point p;
+          for (std::size_t i = 1; i < 4; ++i)
+          {
+            // Get the vertex point
+            const Point_3& _p = c->first->vertex((c->second + i)%4)->point();
+            p[0] += _p.x(); p[1] += _p.y(); p[2] += _p.z();
+          }
+          p[0] /= 3.0; p[1] /= 3.0; p[2] /= 3.0;
+
+          // Check if facet should be added. If not, continue
+          if (!surface->on_surface(p))
+            continue;
+        }
+
+        // Add vertex if not already added and increment index
+        for (std::size_t i = 1; i < 4; ++i)
+        {
+          // Get the ((c->second + i)%4) cell vertex info
+          const int v_index = c->first->vertex( (c->second + i)%4 )->info();
+
+          // In vertex index has not been set, set now and add to mesh
+          if (v_index < 0)
+          {
+            c->first->vertex((c->second + i)%4)->info() = vertex_index;
+
+            // Get vertex coordinates and add vertex to the mesh
+            Point p;
+            for (std::size_t j = 0; j < 3; ++j)
+              p[j] = c->first->vertex((c->second + i) % 4)->point()[j];
+            mesh_editor.add_vertex(vertex_index, p);
+            ++vertex_index;
+          }
+        }
+
+        // Get cell vertices and add to Mesh
+        std::vector<std::size_t> vertex_indices(3);
+        for (std::size_t i = 0; i < 3; ++i)
+          vertex_indices[i] = c->first->vertex( (c->second + i + 1)%4 )->info();
+        mesh_editor.add_cell(cell_index++, vertex_indices);
+      }
+    }
+
+    // Close mesh editor
+    mesh_editor.close();
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void CGALMeshBuilder::build_surface_mesh_poly(Mesh& mesh, T& poly)
+  {
+    // Clear mesh
+    mesh.clear();
+
+    // Get various dimensions
+    const std::size_t gdim = 3;
+    const std::size_t tdim = 2;
+    const std::size_t num_vertices = poly.size_of_vertices();
+    const std::size_t num_cells = poly.size_of_facets();
+
+    // The vertices have no info(), so make a separate point map (vertices
+    // aren't ordered)
+    std::map<typename T::Point_3, std::size_t> point_map;
+
+    // Create a MeshEditor and open
+    dolfin::MeshEditor mesh_editor;
+    mesh_editor.open(mesh, tdim, gdim);
+    mesh_editor.init_vertices_global(num_vertices, num_vertices);
+    mesh_editor.init_cells_global(num_cells, num_cells);
+
+    // Add vertices to mesh
+    std::size_t vertex_index = 0;
+    for (typename T::Vertex_iterator v = poly.vertices_begin();
+         v != poly.vertices_end(); ++v)
+    {
+      // Get vertex coordinates add vertex to the mesh
+      Point p;
+      p[0] = v->point()[0];
+      p[1] = v->point()[1];
+      p[2] = v->point()[2];
+
+      // Add mesh vertex
+      mesh_editor.add_vertex(vertex_index, p);
+
+      // Attach index to vertex and increment
+      point_map[v->point()] = vertex_index++;
+    }
+
+    std::size_t cell_index = 0;
+    for (typename T::Facet_iterator c = poly.facets_begin();
+         c != poly.facets_end(); c++)
+    {
+      std::vector<std::size_t> vertex_indices;
+      typename T::Facet::Halfedge_around_facet_circulator
+        halfedge(c->facet_begin());
+      do
+      {
+        vertex_indices.push_back(point_map[halfedge->vertex()->point()]);
+        halfedge++;
+      }
+      while (halfedge != c->facet_begin());
+
+      mesh_editor.add_cell(cell_index++, vertex_indices);
+    }
+
+    dolfin_assert(vertex_index == num_vertices);
+    dolfin_assert(cell_index == num_cells);
+
+    // Close mesh editor
+    mesh_editor.close();
+  }
+  //---------------------------------------------------------------------------
+
+}
+
+#endif
+#endif
diff --git a/dolfin/generation/CSGCGALDomain2D.cpp b/dolfin/generation/CSGCGALDomain2D.cpp
new file mode 100644
index 0000000..e4e3815
--- /dev/null
+++ b/dolfin/generation/CSGCGALDomain2D.cpp
@@ -0,0 +1,345 @@
+// Copyright (C) 2013 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-06-22
+// Last changed: 2013-08-06
+
+#include "CSGCGALDomain2D.h"
+
+#ifdef HAS_CGAL
+
+#include "CSGPrimitives2D.h"
+#include "CSGOperators.h"
+#include <dolfin/common/constants.h>
+#include <dolfin/log/LogStream.h>
+
+#include <CGAL/basic.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Boolean_set_operations_2.h>
+#include <CGAL/Polygon_set_2.h>
+
+#include <CGAL/Min_circle_2.h>
+#include <CGAL/Min_circle_2_traits_2.h>
+
+// Polygon typedefs
+typedef CGAL::Exact_predicates_exact_constructions_kernel Exact_Kernel;
+typedef Exact_Kernel::Point_2                             Point_2;
+typedef CGAL::Polygon_2<Exact_Kernel>                     Polygon_2;
+typedef Polygon_2::Vertex_const_iterator                  Vertex_const_iterator;
+typedef CGAL::Polygon_with_holes_2<Exact_Kernel>          Polygon_with_holes_2;
+typedef Polygon_with_holes_2::Hole_const_iterator         Hole_const_iterator;
+typedef CGAL::Polygon_set_2<Exact_Kernel>                 Polygon_set_2;
+
+// Min enclosing circle typedefs
+typedef CGAL::Min_circle_2_traits_2<Exact_Kernel>  Min_Circle_Traits;
+typedef CGAL::Min_circle_2<Min_Circle_Traits>      Min_circle;
+typedef CGAL::Circle_2<Exact_Kernel> CGAL_Circle;
+
+using namespace dolfin;
+
+struct CSGCGALDomain2DImpl
+{
+  Polygon_set_2 polygon_set;
+
+  CSGCGALDomain2DImpl(){}
+  CSGCGALDomain2DImpl(const Polygon_set_2& p)
+    : polygon_set(p) {}
+};
+//-----------------------------------------------------------------------------
+Polygon_2 make_circle(const Circle* c)
+{
+  std::vector<Point_2> pts;
+  pts.reserve(c->fragments());
+
+  for (std::size_t i = 0; i < c->fragments(); i++)
+  {
+    const double phi = (2*DOLFIN_PI*i) / c->fragments();
+    const double x = c->center().x() + c->radius()*cos(phi);
+    const double y = c->center().y() + c->radius()*sin(phi);
+    pts.push_back(Point_2(x, y));
+  }
+
+  return Polygon_2(pts.begin(), pts.end());
+}
+//-----------------------------------------------------------------------------
+Polygon_2 make_ellipse(const Ellipse* e)
+{
+  std::vector<Point_2> pts;
+
+  for (std::size_t i = 0; i < e->fragments(); i++)
+  {
+    const double phi = (2*DOLFIN_PI*i) / e->fragments();
+    const double x = e->center().x() + e->a()*cos(phi);
+    const double y = e->center().y() + e->b()*sin(phi);
+    pts.push_back(Point_2(x, y));
+  }
+
+  return Polygon_2(pts.begin(), pts.end());
+}
+//-----------------------------------------------------------------------------
+Polygon_2 make_rectangle(const Rectangle* r)
+{
+  const double x0 = std::min(r->first_corner().x(), r->second_corner().x());
+  const double y0 = std::min(r->first_corner().y(), r->second_corner().y());
+
+  const double x1 = std::max(r->first_corner().x(), r->second_corner().x());
+  const double y1 = std::max(r->first_corner().y(), r->second_corner().y());
+
+  std::vector<Point_2> pts;
+  pts.push_back(Point_2(x0, y0));
+  pts.push_back(Point_2(x1, y0));
+  pts.push_back(Point_2(x1, y1));
+  pts.push_back(Point_2(x0, y1));
+
+  Polygon_2 p(pts.begin(), pts.end());
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+Polygon_2 make_polygon(const Polygon* p)
+{
+  std::vector<Point_2> pts;
+  std::vector<Point>::const_iterator v;
+  for (v = p->vertices().begin(); v != p->vertices().end(); ++v)
+    pts.push_back(Point_2(v->x(), v->y()));
+
+  return Polygon_2(pts.begin(), pts.end());
+}
+//-----------------------------------------------------------------------------
+CSGCGALDomain2D::CSGCGALDomain2D()
+  : impl(new CSGCGALDomain2DImpl)
+{
+
+}
+//-----------------------------------------------------------------------------
+CSGCGALDomain2D::~CSGCGALDomain2D()
+{
+}
+//-----------------------------------------------------------------------------
+CSGCGALDomain2D::CSGCGALDomain2D(const CSGGeometry *geometry)
+: impl(new CSGCGALDomain2DImpl)
+{
+  switch (geometry->getType())
+  {
+    case CSGGeometry::Union:
+    {
+      const CSGUnion *u = dynamic_cast<const CSGUnion*>(geometry);
+      dolfin_assert(u);
+
+      CSGCGALDomain2D a(u->_g0.get());
+      CSGCGALDomain2D b(u->_g1.get());
+
+      impl.swap(a.impl);
+      impl->polygon_set.join(b.impl->polygon_set);
+      break;
+    }
+    case CSGGeometry::Intersection:
+    {
+      const CSGIntersection* u = dynamic_cast<const CSGIntersection*>(geometry);
+      dolfin_assert(u);
+
+      CSGCGALDomain2D a(u->_g0.get());
+      CSGCGALDomain2D b(u->_g1.get());
+
+      impl.swap(a.impl);
+      impl->polygon_set.intersection(b.impl->polygon_set);
+      break;
+    }
+    case CSGGeometry::Difference:
+    {
+      const CSGDifference* u = dynamic_cast<const CSGDifference*>(geometry);
+      dolfin_assert(u);
+      CSGCGALDomain2D a(u->_g0.get());
+      CSGCGALDomain2D b(u->_g1.get());
+
+      impl.swap(a.impl);
+      impl->polygon_set.difference(b.impl->polygon_set);
+      break;
+    }
+    case CSGGeometry::Circle:
+    {
+      const Circle* c = dynamic_cast<const Circle*>(geometry);
+      dolfin_assert(c);
+      impl->polygon_set.insert(make_circle(c));
+      break;
+    }
+    case CSGGeometry::Ellipse:
+    {
+      const Ellipse* c = dynamic_cast<const Ellipse*>(geometry);
+      dolfin_assert(c);
+      impl->polygon_set.insert(make_ellipse(c));
+      break;
+    }
+    case CSGGeometry::Rectangle:
+    {
+      const Rectangle* r = dynamic_cast<const Rectangle*>(geometry);
+      dolfin_assert(r);
+      impl->polygon_set.insert(make_rectangle(r));
+      break;
+    }
+    case CSGGeometry::Polygon:
+    {
+      const Polygon* p = dynamic_cast<const Polygon*>(geometry);
+      dolfin_assert(p);
+      impl->polygon_set.insert(make_polygon(p));
+      break;
+    }
+    default:
+      dolfin_error("CSGCGALMeshGenerator2D.cpp",
+                   "converting geometry to cgal polyhedron",
+                   "Unhandled primitive type");
+  }
+}
+//-----------------------------------------------------------------------------
+CSGCGALDomain2D::CSGCGALDomain2D(const CSGCGALDomain2D &other)
+ : impl(new CSGCGALDomain2DImpl(other.impl->polygon_set))
+{
+}
+//-----------------------------------------------------------------------------
+CSGCGALDomain2D &CSGCGALDomain2D::operator=(const CSGCGALDomain2D &other)
+{
+  std::unique_ptr<CSGCGALDomain2DImpl> tmp(new CSGCGALDomain2DImpl(other.impl->polygon_set));
+
+  impl.swap(tmp);
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+double CSGCGALDomain2D::compute_boundingcircle_radius() const
+{
+  std::list<Polygon_with_holes_2> polygon_list;
+  impl->polygon_set.polygons_with_holes(std::back_inserter(polygon_list));
+
+  std::vector<Point_2> points;
+
+  for (std::list<Polygon_with_holes_2>::const_iterator pit = polygon_list.begin();
+       pit != polygon_list.end(); ++pit)
+    for (Polygon_2::Vertex_const_iterator vit = pit->outer_boundary().vertices_begin();
+         vit != pit->outer_boundary().vertices_end(); ++vit)
+      points.push_back(*vit);
+
+  Min_circle min_circle (points.begin(),
+                         points.end(),
+                         true); //randomize point order
+
+  return sqrt(CGAL::to_double(min_circle.circle().squared_radius()));
+}
+//-----------------------------------------------------------------------------
+void CSGCGALDomain2D::join_inplace(const CSGCGALDomain2D& other)
+{
+  impl->polygon_set.join(other.impl->polygon_set);
+}
+//-----------------------------------------------------------------------------
+void CSGCGALDomain2D::difference_inplace(const CSGCGALDomain2D& other)
+{
+  impl->polygon_set.difference(other.impl->polygon_set);
+}
+//-----------------------------------------------------------------------------
+void CSGCGALDomain2D::intersect_inplace(const CSGCGALDomain2D &other)
+{
+  impl->polygon_set.intersection(other.impl->polygon_set);
+}
+//-----------------------------------------------------------------------------
+bool CSGCGALDomain2D::point_in_domain(Point p) const
+{
+  const Point_2 p_(p.x(), p.y());
+  return impl->polygon_set.oriented_side(p_) == CGAL::ON_POSITIVE_SIDE;
+}
+//-----------------------------------------------------------------------------
+void CSGCGALDomain2D::get_vertices(std::list<std::vector<Point> >& l,
+                                   double truncate_threshold) const
+{
+  l.clear();
+
+  truncate_threshold *= truncate_threshold;
+
+  std::list<Polygon_with_holes_2> polygon_list;
+  impl->polygon_set.polygons_with_holes(std::back_inserter(polygon_list));
+
+  std::list<Polygon_with_holes_2>::const_iterator pit;
+  for (pit = polygon_list.begin(); pit != polygon_list.end(); ++pit)
+  {
+    const Polygon_2 &outer = pit->outer_boundary();
+
+    l.push_back(std::vector<Point>());
+    std::vector<Point> &v = l.back();
+    v.reserve(outer.size());
+
+    Polygon_2::Vertex_const_iterator prev = outer.vertices_begin();
+    Polygon_2::Vertex_const_iterator current = prev;
+    ++current;
+    for (; current != outer.vertices_end(); ++current)
+    {
+      if ( (*current - *prev).squared_length() < truncate_threshold)
+        continue;
+
+      const double x = CGAL::to_double(current->x());
+      const double y = CGAL::to_double(current->y());
+      v.push_back(Point(x, y));
+
+      prev = current;
+    }
+
+    current = outer.vertices_begin();
+    if ( (*current - *prev).squared_length() > truncate_threshold)
+      v.push_back(Point(CGAL::to_double(current->x()),
+                        CGAL::to_double(current->y())));
+  }
+}
+//-----------------------------------------------------------------------------
+void CSGCGALDomain2D::get_holes(std::list<std::vector<Point> >& h,
+                                double truncate_threshold) const
+{
+  h.clear();
+
+  std::list<Polygon_with_holes_2> polygon_list;
+  impl->polygon_set.polygons_with_holes(std::back_inserter(polygon_list));
+
+  std::list<Polygon_with_holes_2>::const_iterator pit;
+  for (pit = polygon_list.begin(); pit != polygon_list.end(); ++pit)
+  {
+    Hole_const_iterator hit;
+    for (hit = pit->holes_begin(); hit != pit->holes_end(); ++hit)
+    {
+      h.push_back(std::vector<Point>());
+      std::vector<Point> &v = h.back();
+      v.reserve(hit->size());
+
+      Polygon_2::Vertex_const_iterator prev = hit->vertices_begin();
+      Polygon_2::Vertex_const_iterator current = prev;
+      ++current;
+
+      for (; current != hit->vertices_end(); ++current)
+      {
+        if ( (*current - *prev).squared_length() < truncate_threshold)
+          continue;
+
+        const double x = CGAL::to_double(current->x());
+        const double y = CGAL::to_double(current->y());
+        v.push_back(Point(x, y));
+
+        prev = current;
+      }
+      current = hit->vertices_begin();
+      if ( (*current - *prev).squared_length() > truncate_threshold)
+        v.push_back(Point(CGAL::to_double(current->x()),
+                          CGAL::to_double(current->y())));
+    }
+  }
+}
+
+#endif
diff --git a/dolfin/generation/CSGCGALDomain2D.h b/dolfin/generation/CSGCGALDomain2D.h
new file mode 100644
index 0000000..7f23624
--- /dev/null
+++ b/dolfin/generation/CSGCGALDomain2D.h
@@ -0,0 +1,72 @@
+// Copyright (C) 2013 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-06-22
+// Last changed: 2013-08-06
+
+#ifdef HAS_CGAL
+
+#include <memory>
+
+#include "CSGGeometry.h"
+#include <dolfin/geometry/Point.h>
+
+
+struct CSGCGALDomain2DImpl;
+
+namespace dolfin
+{
+
+class CSGCGALDomain2D
+{
+ public:
+  // Create empty polygon
+  CSGCGALDomain2D();
+
+  // Construct polygon from Dolfin CSG geometry
+  CSGCGALDomain2D(const CSGGeometry *csg);
+
+  // Destructor
+  ~CSGCGALDomain2D();
+
+  // Copy constructor
+  CSGCGALDomain2D(const CSGCGALDomain2D &other);
+  CSGCGALDomain2D &operator=(const CSGCGALDomain2D &other);
+
+  // Boolean operators
+  void join_inplace(const CSGCGALDomain2D& other);
+  void intersect_inplace(const CSGCGALDomain2D& other);
+  void difference_inplace(const CSGCGALDomain2D& other);
+
+  bool point_in_domain(Point p) const;
+  double compute_boundingcircle_radius() const ;
+
+  // TODO: Replace this with a more C++-ish
+  // implementation, ie, take an outputiterator as arugment
+  // or define iterator
+  void get_vertices(std::list<std::vector<Point> >& v,
+                    double truncate_threshold) const;
+
+  void get_holes(std::list<std::vector<Point> >& h,
+                 double truncate_threshold) const;
+
+  std::unique_ptr<CSGCGALDomain2DImpl> impl;
+
+};
+}
+
+#endif
diff --git a/dolfin/generation/CSGCGALMeshGenerator2D.cpp b/dolfin/generation/CSGCGALMeshGenerator2D.cpp
new file mode 100644
index 0000000..b0da071
--- /dev/null
+++ b/dolfin/generation/CSGCGALMeshGenerator2D.cpp
@@ -0,0 +1,459 @@
+// Copyright (C) 2012 Johannes Ring
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+// Modified by Benjamin Kehlet 2012-2013
+//
+// First added:  2012-05-10
+// Last changed: 2014-02-14
+
+#include <cmath>
+#include <limits>
+#include <vector>
+
+#include <dolfin/common/constants.h>
+#include <dolfin/math/basic.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/MeshDomains.h>
+#include <dolfin/mesh/MeshValueCollection.h>
+#include <dolfin/log/log.h>
+
+#include "CSGCGALMeshGenerator2D.h"
+#include "CSGGeometry.h"
+#include "CSGOperators.h"
+#include "CSGPrimitives2D.h"
+#include "CSGCGALDomain2D.h"
+
+#ifdef HAS_CGAL
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+#include <CGAL/Triangulation_vertex_base_with_info_2.h>
+#include <CGAL/Constrained_Delaunay_triangulation_2.h>
+#include <CGAL/Triangulation_face_base_with_info_2.h>
+#include <CGAL/Delaunay_mesher_2.h>
+#include <CGAL/Delaunay_mesh_face_base_2.h>
+#include <CGAL/Delaunay_mesh_size_criteria_2.h>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Inexact_Kernel;
+typedef CGAL::Triangulation_vertex_base_2<Inexact_Kernel>  Vertex_base;
+typedef CGAL::Delaunay_mesh_face_base_2<Inexact_Kernel> Face_base;
+
+template <class Gt, class Fb >
+class Enriched_face_base_2 : public Fb
+{
+ public:
+  typedef Gt Geom_traits;
+  typedef typename Fb::Vertex_handle Vertex_handle;
+  typedef typename Fb::Face_handle Face_handle;
+
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    typedef typename Fb::template Rebind_TDS<TDS2>::Other Fb2;
+    typedef Enriched_face_base_2<Gt,Fb2> Other;
+  };
+
+protected:
+  int c;
+
+public:
+  Enriched_face_base_2(): Fb(), c(-1) {}
+
+  Enriched_face_base_2(Vertex_handle v0, Vertex_handle v1, Vertex_handle v2)
+    : Fb(v0,v1,v2), c(-1) {}
+
+  Enriched_face_base_2(Vertex_handle v0, Vertex_handle v1, Vertex_handle v2,
+                       Face_handle n0, Face_handle n1, Face_handle n2)
+    : Fb(v0,v1,v2,n0,n1,n2), c(-1) {}
+
+  inline void set_counter(int i) { c = i; }
+  inline int counter() const { return c; }
+};
+
+typedef CGAL::Triangulation_vertex_base_2<Inexact_Kernel> Vb;
+typedef CGAL::Triangulation_vertex_base_with_info_2<std::size_t, Inexact_Kernel, Vb> Vbb;
+typedef Enriched_face_base_2<Inexact_Kernel, Face_base> Fb;
+typedef CGAL::Triangulation_data_structure_2<Vbb, Fb> TDS;
+typedef CGAL::Exact_predicates_tag Itag;
+typedef CGAL::Constrained_Delaunay_triangulation_2<Inexact_Kernel, TDS, Itag> CDT;
+typedef CGAL::Delaunay_mesh_size_criteria_2<CDT> Mesh_criteria_2;
+typedef CGAL::Delaunay_mesher_2<CDT, Mesh_criteria_2> CGAL_Mesher_2;
+
+typedef CDT::Vertex_handle Vertex_handle;
+typedef CDT::Face_handle Face_handle;
+typedef CDT::All_faces_iterator All_faces_iterator;
+
+typedef Inexact_Kernel::Point_2 Point_2;
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CSGCGALMeshGenerator2D::CSGCGALMeshGenerator2D(const CSGGeometry& geometry)
+  : geometry(geometry)
+{
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+CSGCGALMeshGenerator2D::~CSGCGALMeshGenerator2D() {}
+//-----------------------------------------------------------------------------
+void explore_subdomain(CDT &ct, CDT::Face_handle start,
+                       std::list<CDT::Face_handle>& other_domains)
+{
+  std::list<Face_handle> queue;
+  queue.push_back(start);
+
+  while (!queue.empty())
+  {
+    CDT::Face_handle face = queue.front();
+    queue.pop_front();
+
+    for(int i = 0; i < 3; i++)
+    {
+      Face_handle n = face->neighbor(i);
+      if (ct.is_infinite(n))
+        continue;
+
+      const CDT::Edge e(face,i);
+      if (n->counter() == -1)
+      {
+        if (ct.is_constrained(e))
+        {
+          // Reached a border
+          other_domains.push_back(n);
+        }
+        else
+        {
+          // Set neighbor interface to the same and push to queue
+          n->set_counter(face->counter());
+          queue.push_back(n);
+        }
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void explore_subdomains(CDT& cdt,
+                        const CSGCGALDomain2D& total_domain,
+                        const std::vector<std::pair<std::size_t,
+                        CSGCGALDomain2D> > &subdomain_geometries)
+{
+  // Set counter to -1 for all faces
+  for (CDT::Finite_faces_iterator it = cdt.finite_faces_begin();
+       it != cdt.finite_faces_end(); ++it)
+  {
+    it->set_counter(-1);
+  }
+
+  std::list<CDT::Face_handle> subdomains;
+  subdomains.push_back(cdt.finite_faces_begin());
+  while (!subdomains.empty())
+  {
+    const CDT::Face_handle f = subdomains.front();
+    subdomains.pop_front();
+
+    if (f->counter() < 0)
+    {
+      // Set default marker (0)
+      f->set_counter(0);
+
+      const Point_2 p0 = f->vertex(0)->point();
+      const Point_2 p1 = f->vertex(1)->point();
+      const Point_2 p2 = f->vertex(2)->point();
+
+      Point p( (p0[0] + p1[0] + p2[0]) / 3.0,
+               (p0[1] + p1[1] + p2[1]) / 3.0 );
+
+      for (int i = subdomain_geometries.size(); i > 0; --i)
+      {
+        if (subdomain_geometries[i-1].second.point_in_domain(p))
+        {
+          f->set_counter(subdomain_geometries[i-1].first);
+          break;
+        }
+      }
+      explore_subdomain(cdt, f, subdomains);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void add_subdomain(CDT& cdt, const CSGCGALDomain2D& cgal_geometry,
+                   double threshold)
+{
+  // Insert the outer boundaries of the domain
+  {
+    std::list<std::vector<Point> > v;
+    cgal_geometry.get_vertices(v, threshold);
+
+    for (std::list<std::vector<Point> >::const_iterator pit = v.begin();
+         pit != v.end(); ++pit)
+    {
+      std::vector<Point>::const_iterator it = pit->begin();
+      Vertex_handle first = cdt.insert(Point_2(it->x(), it->y()));
+      Vertex_handle prev = first;
+      ++it;
+
+      for (; it != pit->end(); ++it)
+      {
+        Vertex_handle current = cdt.insert(Point_2(it->x(), it->y()));
+        cdt.insert_constraint(prev, current);
+        prev = current;
+      }
+
+      cdt.insert_constraint(prev, first);
+    }
+  }
+
+  // Insert holes
+  {
+    std::list<std::vector<Point> > holes;
+    cgal_geometry.get_holes(holes, threshold);
+
+    for (std::list<std::vector<Point> >::const_iterator hit = holes.begin();
+         hit != holes.end(); ++hit)
+    {
+
+      std::vector<Point>::const_iterator pit = hit->begin();
+      Vertex_handle first = cdt.insert(Point_2(pit->x(), pit->y()));
+      Vertex_handle prev = first;
+      ++pit;
+
+      for(; pit != hit->end(); ++pit)
+      {
+        Vertex_handle current = cdt.insert(Point_2(pit->x(), pit->y()));
+        cdt.insert_constraint(prev, current);
+        prev = current;
+      }
+
+      cdt.insert_constraint(first, prev);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+double shortest_constrained_edge(const CDT &cdt)
+{
+  double min_length = std::numeric_limits<double>::max();
+  for (CDT::Finite_edges_iterator it = cdt.finite_edges_begin();
+       it != cdt.finite_edges_end(); it++)
+  {
+    if (!cdt.is_constrained(*it))
+      continue;
+
+    // An edge is an std::pair<Face_handle, int>
+    // see CGAL/Triangulation_data_structure_2.h
+    CDT::Face_handle f = it->first;
+    const int i = it->second;
+
+    CDT::Point p1 = f->vertex( (i+1)%3 )->point();
+    CDT::Point p2 = f->vertex( (i+2)%3 )->point();
+
+    min_length = std::min(CGAL::to_double((p1-p2).squared_length()),
+                          min_length);
+  }
+
+  return min_length;
+}
+//-----------------------------------------------------------------------------
+void CSGCGALMeshGenerator2D::generate(Mesh& mesh)
+{
+  // Create empty CGAL triangulation
+  CDT cdt;
+
+  // Convert the CSG geometry to a CGAL Polygon
+  log(TRACE, "Converting geometry to CGAL polygon");
+  CSGCGALDomain2D total_domain(&geometry);
+
+  add_subdomain(cdt, total_domain, parameters["edge_minimum"]);
+
+  // Empty polygon, will be populated when traversing the subdomains
+  CSGCGALDomain2D overlaying;
+
+  std::vector<std::pair<std::size_t, CSGCGALDomain2D> >
+    subdomain_geometries;
+
+  // Add the subdomains to the CDT. Traverse in reverse order to get
+  // the latest added subdomain on top
+  std::list<std::pair<std::size_t, std::shared_ptr<const CSGGeometry> > >::const_reverse_iterator it;
+
+  if (!geometry.subdomains.empty())
+    log(TRACE, "Processing subdomains");
+
+  for (it = geometry.subdomains.rbegin(); it != geometry.subdomains.rend();
+       ++it)
+  {
+    const std::size_t current_index = it->first;
+    std::shared_ptr<const CSGGeometry> current_subdomain = it->second;
+
+    CSGCGALDomain2D cgal_geometry(current_subdomain.get());
+    cgal_geometry.difference_inplace(overlaying);
+
+    subdomain_geometries.push_back(std::make_pair(current_index,
+                                                  cgal_geometry));
+    add_subdomain(cdt, cgal_geometry, parameters["edge_minimum"]);
+    overlaying.join_inplace(cgal_geometry);
+  }
+
+  explore_subdomains(cdt, total_domain, subdomain_geometries);
+
+  log(TRACE, "Refining mesh");
+
+  // Create mesher
+  CGAL_Mesher_2 mesher(cdt);
+
+  // Add seeds for all faces in the total domain
+  std::list<Point_2> list_of_seeds;
+  for(CDT::Finite_faces_iterator fit = cdt.finite_faces_begin();
+      fit != cdt.finite_faces_end(); ++fit)
+  {
+    // Calculate center of triangle and add to list of seeds
+    Point_2 p0 = fit->vertex(0)->point();
+    Point_2 p1 = fit->vertex(1)->point();
+    Point_2 p2 = fit->vertex(2)->point();
+    const double x = (p0[0] + p1[0] + p2[0]) / 3;
+    const double y = (p0[1] + p1[1] + p2[1]) / 3;
+
+    if (total_domain.point_in_domain(Point(x, y)))
+      list_of_seeds.push_back(Point_2(x, y));
+  }
+
+  mesher.set_seeds(list_of_seeds.begin(), list_of_seeds.end(), true);
+
+  // Set shape and size criteria
+  const int mesh_resolution = parameters["mesh_resolution"];
+  if (mesh_resolution > 0)
+  {
+    const double min_radius = total_domain.compute_boundingcircle_radius();
+    const double cell_size = 2.0*min_radius/mesh_resolution;
+    const double shape_bound = parameters["triangle_shape_bound"];
+    Mesh_criteria_2 criteria(shape_bound,
+                             cell_size);
+    mesher.set_criteria(criteria);
+  }
+  else
+  {
+    // Set shape and size criteria
+    Mesh_criteria_2 criteria(parameters["triangle_shape_bound"],
+                             parameters["cell_size"]);
+    mesher.set_criteria(criteria);
+  }
+
+  // Refine CGAL mesh/triangulation
+  mesher.refine_mesh();
+
+  // Make sure triangulation is valid
+  dolfin_assert(cdt.is_valid());
+
+  // Mark the subdomains
+  explore_subdomains(cdt, total_domain, subdomain_geometries);
+
+  // Clear mesh
+  mesh.clear();
+
+  const std::size_t gdim = cdt.finite_vertices_begin()->point().dimension();
+  const std::size_t tdim = cdt.dimension();
+  const std::size_t num_vertices = cdt.number_of_vertices();
+
+  // Count valid cells
+  std::size_t num_cells = 0;
+  CDT::Finite_faces_iterator cgal_cell;
+  for (cgal_cell = cdt.finite_faces_begin();
+       cgal_cell != cdt.finite_faces_end(); ++cgal_cell)
+  {
+    // Add cell if it is in the domain
+    if (cgal_cell->is_in_domain())
+       num_cells++;
+  }
+
+  // Create a MeshEditor and open
+  dolfin::MeshEditor mesh_editor;
+  mesh_editor.open(mesh, tdim, gdim);
+  mesh_editor.init_vertices_global(num_vertices, num_vertices);
+  mesh_editor.init_cells_global(num_cells, num_cells);
+
+  // Add vertices to mesh
+  std::size_t vertex_index = 0;
+  CDT::Finite_vertices_iterator cgal_vertex;
+  for (cgal_vertex = cdt.finite_vertices_begin();
+       cgal_vertex != cdt.finite_vertices_end(); ++cgal_vertex)
+  {
+    // Get vertex coordinates and add vertex to the mesh
+    Point p;
+    p[0] = cgal_vertex->point()[0];
+    p[1] = cgal_vertex->point()[1];
+
+    // Add mesh vertex
+    mesh_editor.add_vertex(vertex_index, p);
+
+    // Attach index to vertex and increment
+    cgal_vertex->info() = vertex_index++;
+  }
+
+  dolfin_assert(vertex_index == num_vertices);
+
+  // Add cells to mesh and build domain marker mesh function
+  MeshDomains &domain_markers = mesh.domains();
+  std::size_t cell_index = 0;
+  const bool mark_cells = geometry.has_subdomains();
+  for (cgal_cell = cdt.finite_faces_begin();
+       cgal_cell != cdt.finite_faces_end(); ++cgal_cell)
+  {
+    // Add cell if it is in the domain
+    if (cgal_cell->is_in_domain())
+    {
+      mesh_editor.add_cell(cell_index,
+                           cgal_cell->vertex(0)->info(),
+                           cgal_cell->vertex(1)->info(),
+                           cgal_cell->vertex(2)->info());
+
+      if (mark_cells)
+      {
+        domain_markers.set_marker(std::make_pair(cell_index,
+                                                 cgal_cell->counter()), 2);
+      }
+      ++cell_index;
+    }
+  }
+  dolfin_assert(cell_index == num_cells);
+
+  // Close mesh editor
+  mesh_editor.close();
+}
+
+#else
+namespace dolfin
+{
+  CSGCGALMeshGenerator2D::CSGCGALMeshGenerator2D(const CSGGeometry& geometry)
+  {
+    dolfin_error("CSGCGALMeshGenerator2D.cpp",
+                 "Create mesh generator",
+                 "Dolfin must be compiled with CGAL to use this feature.");
+  }
+  //---------------------------------------------------------------------------
+  CSGCGALMeshGenerator2D::~CSGCGALMeshGenerator2D()
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  void CSGCGALMeshGenerator2D::generate(Mesh& mesh)
+  {
+    // Do nothing
+  }
+}
+
+#endif
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/CSGCGALMeshGenerator2D.h b/dolfin/generation/CSGCGALMeshGenerator2D.h
new file mode 100644
index 0000000..b959f34
--- /dev/null
+++ b/dolfin/generation/CSGCGALMeshGenerator2D.h
@@ -0,0 +1,71 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2012
+//
+// First added:  2012-05-10
+// Last changed: 2013-04-05
+
+#ifndef __CSG_CGAL_MESH_GENERATOR2D_H
+#define __CSG_CGAL_MESH_GENERATOR2D_H
+
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  class CSGGeometry;
+
+  /// Mesh generator for Constructive Solid Geometry (CSG)
+  /// utilizing CGALs 2D Regularized Boolean Set-Operations
+  class CSGCGALMeshGenerator2D : public Variable
+  {
+  public :
+
+    CSGCGALMeshGenerator2D(const CSGGeometry& geometry);
+
+    ~CSGCGALMeshGenerator2D();
+
+    void generate(Mesh& mesh);
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("csg_cgal_meshgenerator");
+      p.add("mesh_resolution", 64);
+      p.add("triangle_shape_bound", 0.125);
+      p.add("cell_size", 0.25);
+
+      // shorter edges in the domain will be collapsed before meshing
+      p.add("edge_minimum", 10e-5);
+
+      return p;
+    }
+
+  private:
+
+    #ifdef HAS_CGAL
+    const CSGGeometry& geometry;
+    #endif
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/CSGCGALMeshGenerator3D.cpp b/dolfin/generation/CSGCGALMeshGenerator3D.cpp
new file mode 100644
index 0000000..531daec
--- /dev/null
+++ b/dolfin/generation/CSGCGALMeshGenerator3D.cpp
@@ -0,0 +1,238 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-05-10
+// Last changed: 2014-02-06
+
+
+#include <memory>
+
+#include "CSGCGALMeshGenerator3D.h"
+#include "CSGGeometry.h"
+#include "GeometryToCGALConverter.h"
+#include "PolyhedronUtils.h"
+#include <dolfin/log/LogStream.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+
+using namespace dolfin;
+
+#ifdef HAS_CGAL
+
+#include "cgal_csg3d.h"
+#include <dolfin/generation/cgal_triangulate_polyhedron.h>
+
+//-----------------------------------------------------------------------------
+static void build_dolfin_mesh(const csg::C3t3& c3t3, Mesh& mesh)
+{
+  typedef csg::C3t3 C3T3;
+  typedef C3T3::Triangulation Triangulation;
+  typedef Triangulation::Vertex_handle Vertex_handle;
+
+  // CGAL triangulation
+  const Triangulation& triangulation = c3t3.triangulation();
+
+  // Clear mesh
+  mesh.clear();
+
+  // Count cells in complex
+  std::size_t num_cells = 0;
+  for(csg::C3t3::Cells_in_complex_iterator cit = c3t3.cells_in_complex_begin();
+      cit != c3t3.cells_in_complex_end();
+      ++cit)
+  {
+    num_cells++;
+  }
+
+  // Create and initialize mesh editor
+  dolfin::MeshEditor mesh_editor;
+  mesh_editor.open(mesh, 3, 3);
+  mesh_editor.init_vertices_global(triangulation.number_of_vertices(),
+                                   triangulation.number_of_vertices());
+  mesh_editor.init_cells_global(num_cells, num_cells);
+
+  // Add vertices to mesh
+  std::size_t vertex_index = 0;
+  std::map<Vertex_handle, std::size_t> vertex_id_map;
+
+  for (Triangulation::Finite_vertices_iterator
+         cgal_vertex = triangulation.finite_vertices_begin();
+       cgal_vertex != triangulation.finite_vertices_end(); ++cgal_vertex)
+  {
+    vertex_id_map[cgal_vertex] = vertex_index;
+
+      // Get vertex coordinates and add vertex to the mesh
+    Point p(cgal_vertex->point()[0], cgal_vertex->point()[1], cgal_vertex->point()[2]);
+    mesh_editor.add_vertex(vertex_index, p);
+
+    ++vertex_index;
+  }
+
+  // Add cells to mesh
+  std::size_t cell_index = 0;
+  for(csg::C3t3::Cells_in_complex_iterator cit = c3t3.cells_in_complex_begin();
+      cit != c3t3.cells_in_complex_end();
+      ++cit)
+  {
+    mesh_editor.add_cell(cell_index,
+                         vertex_id_map[cit->vertex(0)],
+                         vertex_id_map[cit->vertex(1)],
+                         vertex_id_map[cit->vertex(2)],
+                         vertex_id_map[cit->vertex(3)]);
+
+    ++cell_index;
+  }
+
+  // Close mesh editor
+  mesh_editor.close();
+}
+//-----------------------------------------------------------------------------
+CSGCGALMeshGenerator3D::CSGCGALMeshGenerator3D(const CSGGeometry& geometry)
+{
+  std::shared_ptr<const CSGGeometry> tmp = reference_to_no_delete_pointer<const CSGGeometry>(geometry);
+  _geometry = tmp;
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+CSGCGALMeshGenerator3D::CSGCGALMeshGenerator3D(std::shared_ptr<const CSGGeometry> geometry)
+  : _geometry(geometry)
+{
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+CSGCGALMeshGenerator3D::~CSGCGALMeshGenerator3D() {}
+//-----------------------------------------------------------------------------
+void CSGCGALMeshGenerator3D::generate(Mesh& mesh) const
+{
+  csg::Polyhedron_3 p;
+
+  cout << "Converting geometry to cgal types." << endl;
+  GeometryToCGALConverter::convert(*_geometry, p, parameters["remove_degenerated"]);
+  dolfin_assert(p.is_pure_triangle());
+
+  csg::Mesh_domain domain(p);
+
+  if (parameters["detect_sharp_features"])
+  {
+    cout << "Detecting sharp features" << endl;
+    //const int feature_threshold = parameters["feature_threshold"];
+    domain.detect_features();
+  }
+
+  // Workaround, cgal segfaulted when assigning new mesh criterias
+  // within the if-else blocks.
+  std::unique_ptr<csg::Mesh_criteria> criteria;
+
+  int mesh_resolution = parameters["mesh_resolution"];
+  if (mesh_resolution > 0)
+  {
+    // Try to compute reasonable parameters
+    const double r = PolyhedronUtils::getBoundingSphereRadius(p);
+    //cout << "Radius of bounding sphere: " << r << endl;
+    //cout << "Mesh resolution" << mesh_resolution << endl;
+    const double cell_size = r/static_cast<double>(mesh_resolution)*2.0;
+    //cout << "Cell size: " << cell_size << endl;
+
+    criteria.reset(new csg::Mesh_criteria(CGAL::parameters::edge_size = cell_size, // ???
+                                          CGAL::parameters::facet_angle = 30.0,
+                                          CGAL::parameters::facet_size = cell_size,
+                                          CGAL::parameters::facet_distance = cell_size/10.0, // ???
+                                          CGAL::parameters::cell_radius_edge_ratio = 3.0,
+                                          CGAL::parameters::cell_size = cell_size));
+  }
+  else
+  {
+    // Mesh criteria
+    criteria.reset(new csg::Mesh_criteria(CGAL::parameters::edge_size = parameters["edge_size"],
+                                          CGAL::parameters::facet_angle = parameters["facet_angle"],
+                                          CGAL::parameters::facet_size = parameters["facet_size"],
+                                          CGAL::parameters::facet_distance = parameters["facet_distance"],
+                                          CGAL::parameters::cell_radius_edge_ratio = parameters["cell_radius_edge_ratio"],
+                                          CGAL::parameters::cell_size = parameters["cell_size"]));
+  }
+
+  // Mesh generation
+  cout << "Generating mesh" << endl;
+  csg::C3t3 c3t3 = CGAL::make_mesh_3<csg::C3t3>(domain, *criteria,
+                                                CGAL::parameters::no_perturb(),
+                                                CGAL::parameters::no_exude());
+
+  if (parameters["odt_optimize"])
+  {
+    cout << "Optimizing mesh by odt optimization" << endl;
+    odt_optimize_mesh_3(c3t3, domain);
+  }
+
+  if (parameters["lloyd_optimize"])
+  {
+    cout << "Optimizing mesh by lloyd optimization" << endl;
+    lloyd_optimize_mesh_3(c3t3, domain);
+  }
+
+  if (parameters["perturb_optimize"])
+  {
+    cout << "Optimizing mesh by perturbation" << endl;
+    // TODO: Set time limit
+    CGAL::perturb_mesh_3(c3t3, domain);
+  }
+
+  if (parameters["exude_optimize"])
+  {
+    cout << "Optimizing mesh by sliver exudation" << endl;
+    exude_mesh_3(c3t3);
+  }
+
+  build_dolfin_mesh(c3t3, mesh);
+}
+//-----------------------------------------------------------------------------
+void CSGCGALMeshGenerator3D::save_off(std::string filename) const
+{
+  csg::Polyhedron_3 p;
+
+  cout << "Converting geometry to cgal types." << endl;
+  GeometryToCGALConverter::convert(*_geometry, p);
+
+  cout << "Writing to file " << filename << endl;
+  std::ofstream outfile(filename.c_str());
+
+  outfile << p;
+  outfile.close();
+}
+
+#else
+CSGCGALMeshGenerator3D::CSGCGALMeshGenerator3D(const CSGGeometry& geometry)
+{
+  dolfin_error("CSGCGALMeshGenerator3D.cpp",
+	       "Create mesh generator",
+	       "Dolfin must be compiled with CGAL to use this feature.");
+}
+//-----------------------------------------------------------------------------
+CSGCGALMeshGenerator3D::CSGCGALMeshGenerator3D(std::shared_ptr<const CSGGeometry> geometry)
+{
+  dolfin_error("CSGCGALMeshGenerator3D.cpp",
+	       "Create mesh generator",
+	       "Dolfin must be compiled with CGAL to use this feature.");
+}
+CSGCGALMeshGenerator3D::~CSGCGALMeshGenerator3D(){}
+void CSGCGALMeshGenerator3D::generate(Mesh& mesh) const{}
+void CSGCGALMeshGenerator3D::save_off(std::string filename) const {}
+//-----------------------------------------------------------------------------
+
+
+#endif
diff --git a/dolfin/generation/CSGCGALMeshGenerator3D.h b/dolfin/generation/CSGCGALMeshGenerator3D.h
new file mode 100644
index 0000000..61a42a3
--- /dev/null
+++ b/dolfin/generation/CSGCGALMeshGenerator3D.h
@@ -0,0 +1,79 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-05-10
+// Last changed: 2012-09-06
+
+#ifndef __CSG_CGAL_MESH_GENERATOR3D_H
+#define __CSG_CGAL_MESH_GENERATOR3D_H
+
+#include <dolfin/common/Variable.h>
+#include <memory>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  class CSGGeometry;
+
+  /// Mesh generator for Constructive Solid Geometry (CSG)
+  /// utilizing CGALs boolean operation on Nef_polyhedrons.
+
+  class CSGCGALMeshGenerator3D : public Variable
+  {
+  public :
+    CSGCGALMeshGenerator3D(const CSGGeometry& geometry);
+
+    CSGCGALMeshGenerator3D(std::shared_ptr<const CSGGeometry> geometry);
+
+    ~CSGCGALMeshGenerator3D();
+
+    void generate(Mesh& mesh) const;
+
+    void save_off(std::string filename) const;
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("csg_cgal_meshgenerator");
+      p.add("mesh_resolution", 64);
+      p.add("perturb_optimize", false);
+      p.add("exude_optimize", false);
+      p.add("lloyd_optimize", false);
+      p.add("odt_optimize", false);
+      p.add("edge_size", 0.025);
+      p.add("facet_angle", 25.0);
+      p.add("facet_size", 0.05);
+      p.add("facet_distance", 0.005);
+      p.add("cell_radius_edge_ratio", 3.0);
+      p.add("cell_size", 0.05);
+      p.add("remove_degenerated", true);
+      p.add("detect_sharp_features", true);
+
+      return p;
+    }
+
+  private:
+    std::shared_ptr<const CSGGeometry> _geometry;
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/CSGGeometries3D.cpp b/dolfin/generation/CSGGeometries3D.cpp
new file mode 100644
index 0000000..d326a76
--- /dev/null
+++ b/dolfin/generation/CSGGeometries3D.cpp
@@ -0,0 +1,145 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2012
+//
+// First added:  2012-05-12
+// Last changed: 2012-12-20
+
+#include <cmath>
+
+#include "CSGGeometries3D.h"
+#include "CSGGeometry.h"
+#include "CSGPrimitives3D.h"
+#include "CSGOperators.h"
+
+using namespace dolfin;
+
+std::shared_ptr<CSGGeometry> CSGGeometries::lego(std::size_t n0,
+                                                   std::size_t n1,
+                                                   std::size_t n2,
+                                                   double x0,
+                                                   double x1,
+                                                   double x2 )
+{
+  // Standard dimensions for LEGO bricks / m
+  const double P = 8.0 * 0.001;
+  const double h = 3.2 * 0.001;
+  const double D = 5.0 * 0.001;
+  const double b = 1.7 * 0.001;
+  const double d = 0.2 * 0.001;
+
+  // Create brick
+  std::shared_ptr<CSGGeometry>
+    lego(new Box(x0 + 0.5*d, x1 + 0.5*d, x2,
+                 x0 + n0*P - 0.5*d, x1 + n1*P - 0.5*d, x2 + n2*h));
+
+  // Add knobs
+  for (std::size_t i = 0; i < n0; i++)
+  {
+    for (std::size_t j = 0; j < n1; j++)
+    {
+      const double x = x0 + (i + 0.5)*P;
+      const double y = x1 + (j + 0.5)*P;
+      const double z = x2;
+
+      std::shared_ptr<CSGGeometry>
+        knob(new Cone(Point(x, y, z), Point(x, y, z + n2*h + b), 0.5*D, 0.5*D));
+      lego = lego + knob;
+    }
+  }
+
+  return lego;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<CSGGeometry> CSGGeometries::propeller(double r, double R,
+                                                        double w, double h)
+{
+  // Parameters
+  //const double v = 30;     // initial rotation of blades
+  //const double u = 20;     // additional rotation of blades
+  const double l = 0.8*w;  // length of cone
+  const double a = h;      // radius of tip of cone
+
+  // // Create blades
+  std::shared_ptr<CSGGeometry>
+    blade_0(new Box(0.8*r, -0.5*h, -0.5*w, R, 0.5*h, 0.5*w));
+  std::shared_ptr<CSGGeometry>
+    blade_1(new Box(-R, -0.5*h, -0.5*w, -0.8*r, 0.5*h, 0.5*w));
+  std::shared_ptr<CSGGeometry>
+    blade_2(new Box(-0.5*h, 0.8*r, -0.5*w,  0.5*h, R, 0.5*w));
+  std::shared_ptr<CSGGeometry>
+    blade_3(new Box(-0.5*h, -R, -0.5*w, 0.5*h, -0.8*r, 0.5*w));
+
+  // // Rotate blades
+  // // blade_0.rotate(-v, 0);
+  // // blade_1.rotate(v, 0);
+  // // blade_2.rotate(v, 1);
+  // // blade_3.rotate(-v, 1);
+
+  // Create blade tips
+  std::shared_ptr<CSGGeometry>
+    blade_tip_0(new Cylinder(Point( R, -0.5*h, 0),
+                             Point( R, 0.5*h, 0), 0.5*w));
+  std::shared_ptr<CSGGeometry>
+    blade_tip_1(new Cylinder(Point(-R, -0.5*h, 0),
+                             Point(-R,0.5*h, 0), 0.5*w));
+  std::shared_ptr<CSGGeometry>
+    blade_tip_2(new Cylinder(Point(-0.5*h,  R, 0),
+                             Point( 0.5*h,  R, 0), 0.5*w));
+  std::shared_ptr<CSGGeometry>
+    blade_tip_3(new Cylinder(Point(-0.5*h, -R, 0),
+                             Point( 0.5*h, -R, 0), 0.5*w));
+
+  // // Rotate blade tips
+  // // blade_tip_0.rotate(-v, 0);
+  // // blade_tip_1.rotate(v, 0);
+  // // blade_tip_2.rotate(v, 1);
+  // // blade_tip_3.rotate(-v, 1);
+
+  // Add blade tips
+  blade_0 = blade_0 + blade_tip_0;
+  blade_1 = blade_1 + blade_tip_1;
+  blade_2 = blade_2 + blade_tip_2;
+  blade_3 = blade_3 + blade_tip_3;
+
+  // // Add blades
+  std::shared_ptr<CSGGeometry>
+    blades = blade_0 + blade_1 + blade_2 + blade_3;
+
+  // Create outer cylinder
+  std::shared_ptr<CSGGeometry>
+    cylinder_outer(new Cylinder(Point(0, 0, -0.5*w), Point(0, 0, 0.5*w), r));
+
+  // Create inner cylinder
+  std::shared_ptr<CSGGeometry>
+    cylinder_inner(new Cylinder(Point(0, 0, -0.5*w), Point(0, 0, 0.5*w),
+                                0.5*r));
+
+  // Create center cone
+  std::shared_ptr<CSGGeometry>
+    cone( new Cone(Point(0, 0, -0.5*w), Point(0, 0, -0.5*w - l), r, a));
+
+  // Create sphere for tip of cone
+  const double d = a*(r - a) / l;
+  std::shared_ptr<CSGGeometry>
+    tip(new Sphere(Point(0, 0, -0.5*w - l + d), sqrt(a*a + d*d)));
+
+  // Build propeller from parts
+  return cylinder_outer - cylinder_inner + cone + tip + blades;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/CSGGeometries3D.h b/dolfin/generation/CSGGeometries3D.h
new file mode 100644
index 0000000..a8f3027
--- /dev/null
+++ b/dolfin/generation/CSGGeometries3D.h
@@ -0,0 +1,52 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2012
+//
+// First added:  2012-05-12
+// Last changed: 2012-05-14
+
+#ifndef __CSG_GEOMETRIES_H
+#define __CSG_GEOMETRIES_H
+
+#include <memory>
+#include <dolfin/geometry/Point.h>
+#include "CSGGeometry.h"
+
+namespace dolfin
+{
+  class CSGGeometries
+  {
+  public:
+
+    // A standard LEGO brick starting at the point x with (n0, n1)
+    // knobs and height n2. The height should be 1 for a thin brick or 3
+    // for a regular brick.
+    static std::shared_ptr<CSGGeometry> lego(std::size_t n0, std::size_t n1,
+                                               std::size_t n2, double x0,
+                                               double x1, double x2);
+
+    // A simple propeller with parameters r - radius of center body, R - length of blades,
+    // w - width of blades and h - thicknes of blades
+    static std::shared_ptr<CSGGeometry> propeller(double r=0.125,
+                                                    double R=0.5,
+                                                    double w=0.3,
+                                                    double h=0.025 );
+  };
+}
+
+#endif
diff --git a/dolfin/generation/CSGGeometry.cpp b/dolfin/generation/CSGGeometry.cpp
new file mode 100644
index 0000000..e756e08
--- /dev/null
+++ b/dolfin/generation/CSGGeometry.cpp
@@ -0,0 +1,74 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2013
+//
+// First added:  2012-04-11
+// Last changed: 2013-04-18
+
+#include "CSGGeometry.h"
+#include <dolfin/common/NoDeleter.h>
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CSGGeometry::CSGGeometry()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+CSGGeometry::~CSGGeometry()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void CSGGeometry::set_subdomain(std::size_t i, std::shared_ptr<CSGGeometry> s)
+{
+  dolfin_assert(dim() == s->dim());
+
+  if (i == 0)
+  {
+    error("Setting reserved CSG subdomain (0)");
+  }
+
+  // Check if i already used
+  std::list<std::pair<std::size_t, std::shared_ptr<const CSGGeometry> > >::iterator it = subdomains.begin();
+  while (it != subdomains.end())
+  {
+    if (it->first == i)
+    {
+       warning("Double declaration of CSG subdomain with index %u.", i);
+
+       // Remove existing declaration
+       it = subdomains.erase(it);
+    }
+    else
+      ++it;
+  }
+
+  subdomains.push_back(std::make_pair(i, s));
+}
+//-----------------------------------------------------------------------------
+void CSGGeometry::set_subdomain(std::size_t i, CSGGeometry& s)
+{
+  set_subdomain(i, reference_to_no_delete_pointer(s));
+}
+//-----------------------------------------------------------------------------
+bool CSGGeometry::has_subdomains() const
+{
+  return subdomains.size() > 0;
+}
diff --git a/dolfin/generation/CSGGeometry.h b/dolfin/generation/CSGGeometry.h
new file mode 100644
index 0000000..b1d36f0
--- /dev/null
+++ b/dolfin/generation/CSGGeometry.h
@@ -0,0 +1,73 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012
+// Modified by Johannes Ring, 2012
+//
+// First added:  2012-04-11
+// Last changed: 2013-11-12
+
+#ifndef __CSG_GEOMETRY_H
+#define __CSG_GEOMETRY_H
+
+#include <cstddef>
+#include <vector>
+#include <list>
+#include <memory>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+
+  /// Geometry described by Constructive Solid Geometry (CSG)
+  class CSGGeometry : public Variable
+  {
+  public:
+
+    /// Constructor
+    CSGGeometry();
+
+    /// Destructor
+    virtual ~CSGGeometry();
+
+    /// Return dimension of geometry
+    virtual std::size_t dim() const = 0;
+
+    /// Informal string representation
+    virtual std::string str(bool verbose) const = 0;
+
+    /// Define subdomain. This feature is 2D only.
+    /// The subdomain is itself a CSGGeometry and the corresponding
+    /// cells in the resulting will be marked with i
+    /// If subdomains overlap, the latest added will take precedence.
+    void set_subdomain(std::size_t i, std::shared_ptr<CSGGeometry> s);
+    void set_subdomain(std::size_t i, CSGGeometry& s);
+    bool has_subdomains() const;
+
+    enum Type { Box, Sphere, Cone, Tetrahedron, Surface3D, Circle, Ellipse, Rectangle, Polygon, Union, Intersection, Difference };
+    virtual Type getType() const = 0;
+    virtual bool is_operator() const = 0;
+
+    std::list<std::pair<std::size_t, std::shared_ptr<const CSGGeometry> > > subdomains;
+  };
+
+  
+
+}
+
+#endif
diff --git a/dolfin/generation/CSGMeshGenerator.cpp b/dolfin/generation/CSGMeshGenerator.cpp
new file mode 100644
index 0000000..490219b
--- /dev/null
+++ b/dolfin/generation/CSGMeshGenerator.cpp
@@ -0,0 +1,103 @@
+// Copyright (C) 2012 Anders Logg, Benjamin Kehlet, Johannes Ring
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-01-01
+// Last changed: 2013-03-15
+
+
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include "CSGMeshGenerator.h"
+#include "CSGGeometry.h"
+#include "CSGCGALMeshGenerator2D.h"
+#include "CSGCGALMeshGenerator3D.h"
+
+using namespace dolfin;
+
+#ifdef HAS_CGAL
+
+//-----------------------------------------------------------------------------
+void CSGMeshGenerator::generate(Mesh& mesh,
+                                const CSGGeometry& geometry,
+                                std::size_t resolution)
+{
+  if (geometry.dim() == 2)
+  {
+    CSGCGALMeshGenerator2D generator(geometry);
+    generator.parameters["mesh_resolution"] = static_cast<int>(resolution);
+    generator.generate(mesh);
+  }
+  else if (geometry.dim() == 3)
+  {
+    CSGCGALMeshGenerator3D generator(geometry);
+    generator.parameters["mesh_resolution"] = static_cast<int>(resolution);
+    generator.generate(mesh);
+  }
+  else
+  {
+    dolfin_error("CSGMeshGenerator.cpp",
+                 "create mesh from CSG geometry",
+                 "Unhandled geometry dimension %d", geometry.dim());
+  }
+}
+//-----------------------------------------------------------------------------
+void CSGMeshGenerator::generate(BoundaryMesh& mesh,
+                                const CSGGeometry& geometry)
+{
+  if (geometry.dim() == 2)
+  {
+    // Generate boundary mesh directly from 2D CSGGeometry is not
+    // implemented. Instead, generate the full mesh and extract its boundary.
+    CSGCGALMeshGenerator2D generator(geometry);
+    Mesh full_mesh;
+    generator.generate(full_mesh);
+
+    mesh = BoundaryMesh(full_mesh, "exterior");
+  }
+  else if (geometry.dim() == 3)
+  {
+    CSGCGALMeshGenerator3D generator(geometry);
+    generator.generate(mesh);
+  }
+  else
+  {
+    dolfin_error("CSGMeshGenerator.cpp",
+                 "create boundary mesh from CSG geometry",
+                 "Unhandled geometry dimension %d", geometry.dim());
+  }
+}
+//-----------------------------------------------------------------------------
+#else
+void CSGMeshGenerator::generate(Mesh& mesh,
+                                const CSGGeometry& geometry,
+                                std::size_t resolution)
+{
+  dolfin_error("CSGMeshGenerator.cpp",
+	       "create mesh from CSG geometry",
+	       "Mesh generation not available. Dolfin has been compiled without CGAL.");
+}
+//-----------------------------------------------------------------------------
+void CSGMeshGenerator::generate(BoundaryMesh& mesh,
+                                const CSGGeometry& geometry)
+{
+  dolfin_error("CSGMeshGenerator.cpp",
+	       "create boundary mesh from CSG geometry",
+	       "Mesh generation not available. Dolfin has been compiled without CGAL.");
+}
+#endif
diff --git a/dolfin/generation/CSGMeshGenerator.h b/dolfin/generation/CSGMeshGenerator.h
new file mode 100644
index 0000000..705a468
--- /dev/null
+++ b/dolfin/generation/CSGMeshGenerator.h
@@ -0,0 +1,52 @@
+// Copyright (C) 2012 Anders Logg (and others, add authors)
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012
+// Modified by Joachim B Haga, 2012
+//
+// First added:  2012-04-13
+// Last changed: 2012-09-06
+
+#ifndef __CSG_MESH_GENERATOR_H
+#define __CSG_MESH_GENERATOR_H
+
+#include <memory>
+#include "CSGGeometry.h"
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  class BoundaryMesh;
+
+  /// Mesh generator for Constructive Solid Geometry (CSG)
+
+  class CSGMeshGenerator
+  {
+  public :
+
+    /// Generate mesh from CSG geometry
+    static void generate(Mesh& mesh, const CSGGeometry& geometry,
+                         std::size_t resolution);
+
+    /// Generate boundary mesh from the surface of a CSG geometry
+    static void generate(BoundaryMesh& mesh, const CSGGeometry& geometry);
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/CSGOperators.cpp b/dolfin/generation/CSGOperators.cpp
new file mode 100644
index 0000000..c20d23f
--- /dev/null
+++ b/dolfin/generation/CSGOperators.cpp
@@ -0,0 +1,167 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2012
+// Modified by Benjamin Kehlet, 2013
+//
+// First added:  2012-04-13
+// Last changed: 2013-06-24
+
+#include <sstream>
+
+#include <dolfin/common/utils.h>
+#include <dolfin/log/log.h>
+#include "CSGOperators.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+// CSGUnion
+//-----------------------------------------------------------------------------
+CSGUnion::CSGUnion(std::shared_ptr<CSGGeometry> g0,
+                   std::shared_ptr<CSGGeometry> g1)
+  : _g0(g0), _g1(g1)
+{
+  assert(g0);
+  assert(g1);
+
+  // Check dimensions
+  if (g0->dim() != g1->dim())
+  {
+    dolfin_error("CSGOperators.cpp",
+                 "create union of CSG geometries",
+                 "Dimensions of geomestries don't match (%d vs %d)",
+                 g0->dim(), g1->dim());
+  }
+
+  dim_ = g0->dim();
+}
+//-----------------------------------------------------------------------------
+std::string CSGUnion::str(bool verbose) const
+{
+  assert(_g0);
+  assert(_g1);
+
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Union>\n"
+      << "{\n"
+      << indent(_g0->str(true))
+      << "\n"
+      << indent(_g1->str(true))
+      << "\n}";
+  }
+  else
+  {
+    s << "(" << _g0->str(false) << " + " << _g1->str(false) << ")";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// CSGDifference
+//-----------------------------------------------------------------------------
+CSGDifference::CSGDifference(std::shared_ptr<CSGGeometry> g0,
+			     std::shared_ptr<CSGGeometry> g1)
+  : _g0(g0), _g1(g1)
+{
+  assert(g0);
+  assert(g1);
+
+  // Check dimensions
+  if (g0->dim() != g1->dim())
+  {
+    dolfin_error("CSGOperators.cpp",
+                 "create difference of CSG geometries",
+                 "Dimensions of geomestries don't match (%d vs %d)",
+                 g0->dim(), g1->dim());
+  }
+
+  dim_ = g0->dim();
+}
+//-----------------------------------------------------------------------------
+std::string CSGDifference::str(bool verbose) const
+{
+  assert(_g0);
+  assert(_g1);
+
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Difference>\n"
+      << "{\n"
+      << indent(_g0->str(true))
+      << "\n"
+      << indent(_g1->str(true))
+      << "\n}";
+  }
+  else
+  {
+    s << "(" << _g0->str(false) << " - " << _g1->str(false) << ")";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// CSGIntersection
+//-----------------------------------------------------------------------------
+CSGIntersection::CSGIntersection(std::shared_ptr<CSGGeometry> g0,
+                                 std::shared_ptr<CSGGeometry> g1)
+  : _g0(g0), _g1(g1)
+{
+  assert(g0);
+  assert(g1);
+
+  // Check dimensions
+  if (g0->dim() != g1->dim())
+  {
+    dolfin_error("CSGOperators.cpp",
+                 "create intersection of CSG geometries",
+                 "Dimensions of geomestries don't match (%d vs %d)",
+                 g0->dim(), g1->dim());
+  }
+
+  dim_ = g0->dim();
+}
+//-----------------------------------------------------------------------------
+std::string CSGIntersection::str(bool verbose) const
+{
+  assert(_g0);
+  assert(_g1);
+
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Intersection>\n"
+      << "{\n"
+      << indent(_g0->str(true))
+      << "\n"
+      << indent(_g1->str(true))
+      << "\n}";
+  }
+  else
+  {
+    s << "(" << _g0->str(false) << " * " << _g1->str(false) << ")";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/CSGOperators.h b/dolfin/generation/CSGOperators.h
new file mode 100644
index 0000000..7b5489d
--- /dev/null
+++ b/dolfin/generation/CSGOperators.h
@@ -0,0 +1,196 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012-2013
+//
+// First added:  2012-04-13
+// Last changed: 2013-06-24
+
+#ifndef __CSG_OPERATORS_H
+#define __CSG_OPERATORS_H
+
+#include <memory>
+
+#include <dolfin/common/NoDeleter.h>
+#include "CSGGeometry.h"
+
+namespace dolfin
+{
+
+  //--- Operator classes (nodes) ---
+  class CSGOperator : public CSGGeometry
+  {
+   public:
+    virtual bool is_operator() const { return true; }
+    std::size_t dim() const { return dim_;}
+
+   protected :
+    std::size_t dim_;
+  };
+
+  /// Union of CSG geometries
+  class CSGUnion : public CSGOperator
+  {
+  public:
+
+    /// Create union of two geometries
+    CSGUnion(std::shared_ptr<CSGGeometry> g0,
+             std::shared_ptr<CSGGeometry> g1);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const { return CSGGeometry::Union; }
+
+    std::shared_ptr<CSGGeometry> _g0;
+    std::shared_ptr<CSGGeometry> _g1;
+
+  };
+
+  /// Difference of CSG geometries
+  class CSGDifference : public CSGOperator
+  {
+  public:
+
+    /// Create union of two geometries
+    CSGDifference(std::shared_ptr<CSGGeometry> g0,
+             std::shared_ptr<CSGGeometry> g1);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const { return CSGGeometry::Difference; }
+
+    std::shared_ptr<CSGGeometry> _g0;
+    std::shared_ptr<CSGGeometry> _g1;
+
+  };
+
+
+  /// Intersection of CSG geometries
+  class CSGIntersection : public CSGOperator
+  {
+  public:
+
+    /// Create intersection of two geometries
+    CSGIntersection(std::shared_ptr<CSGGeometry> g0,
+                    std::shared_ptr<CSGGeometry> g1);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const { return CSGGeometry::Intersection; }
+
+    std::shared_ptr<CSGGeometry> _g0;
+    std::shared_ptr<CSGGeometry> _g1;
+
+  };
+
+  //--- Union operators ---
+
+  /// Create union of two geometries
+  inline std::shared_ptr<CSGUnion> operator+(std::shared_ptr<CSGGeometry> g0,
+                                        std::shared_ptr<CSGGeometry> g1)
+  {
+    return std::shared_ptr<CSGUnion>(new CSGUnion(g0, g1));
+  }
+
+  /// Create union of two geometries
+  inline std::shared_ptr<CSGUnion> operator+(CSGGeometry& g0,
+                                        std::shared_ptr<CSGGeometry> g1)
+  {
+    return reference_to_no_delete_pointer(g0) + g1;
+  }
+
+  /// Create union of two geometries
+  inline std::shared_ptr<CSGUnion> operator+(std::shared_ptr<CSGGeometry> g0,
+                                        CSGGeometry& g1)
+  {
+    return g0 + reference_to_no_delete_pointer(g1);
+  }
+
+  /// Create union of two geometries
+  inline std::shared_ptr<CSGUnion> operator+(CSGGeometry& g0,
+                                        CSGGeometry& g1)
+  {
+    return reference_to_no_delete_pointer(g0) + reference_to_no_delete_pointer(g1);
+  }
+
+  //--- Difference operators ---
+
+  /// Create difference of two geometries
+  inline  std::shared_ptr<CSGDifference> operator-(std::shared_ptr<CSGGeometry> g0,
+					     std::shared_ptr<CSGGeometry> g1)
+  {
+    return std::shared_ptr<CSGDifference>(new CSGDifference(g0, g1));
+  }
+
+  /// Create difference of two geometries
+  inline std::shared_ptr<CSGDifference> operator-(CSGGeometry& g0,
+					     std::shared_ptr<CSGGeometry> g1)
+  {
+    return reference_to_no_delete_pointer(g0) - g1;
+  }
+
+  /// Create union of two geometries
+  inline std::shared_ptr<CSGDifference> operator-(std::shared_ptr<CSGGeometry> g0,
+					     CSGGeometry& g1)
+  {
+    return g0 - reference_to_no_delete_pointer(g1);
+  }
+
+  /// Create difference of two geometries
+  inline std::shared_ptr<CSGDifference> operator-(CSGGeometry& g0,
+					     CSGGeometry& g1)
+  {
+    return reference_to_no_delete_pointer(g0) - reference_to_no_delete_pointer(g1);
+  }
+
+
+  //--- Intersection operators ---
+
+  /// Create intersection  of two geometries
+  inline std::shared_ptr<CSGIntersection> operator*(std::shared_ptr<CSGGeometry> g0,
+                                               std::shared_ptr<CSGGeometry> g1)
+  {
+    return std::shared_ptr<CSGIntersection>(new CSGIntersection(g0, g1));
+  }
+
+  /// Create intersection of two geometries
+  inline std::shared_ptr<CSGIntersection> operator*(CSGGeometry& g0,
+                                               std::shared_ptr<CSGGeometry> g1)
+  {
+    return reference_to_no_delete_pointer(g0) * g1;
+  }
+
+  /// Create intersection of two geometries
+  inline std::shared_ptr<CSGIntersection> operator*(std::shared_ptr<CSGGeometry> g0,
+                                               CSGGeometry& g1)
+  {
+    return g0 * reference_to_no_delete_pointer(g1);
+  }
+
+  /// Create intersection of two geometries
+  inline std::shared_ptr<CSGIntersection> operator*(CSGGeometry& g0,
+                                               CSGGeometry& g1)
+  {
+    return reference_to_no_delete_pointer(g0) * reference_to_no_delete_pointer(g1);
+  }
+
+}
+
+#endif
diff --git a/dolfin/generation/CSGPrimitive.h b/dolfin/generation/CSGPrimitive.h
new file mode 100644
index 0000000..3b02024
--- /dev/null
+++ b/dolfin/generation/CSGPrimitive.h
@@ -0,0 +1,42 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012-2013
+//
+// First added:  2012-04-11
+// Last changed: 2013-06-24
+
+#ifndef __CSG_PRIMITIVE_H
+#define __CSG_PRIMITIVE_H
+
+#include "CSGGeometry.h"
+
+namespace dolfin
+{
+
+  /// Base class for Constructive Solid Geometry (CSG) primitives.
+
+  class CSGPrimitive : public CSGGeometry
+  {
+  public:
+    virtual bool is_operator() const { return false; }
+    virtual std::size_t dim() const = 0;
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/CSGPrimitives2D.cpp b/dolfin/generation/CSGPrimitives2D.cpp
new file mode 100644
index 0000000..edd8ba0
--- /dev/null
+++ b/dolfin/generation/CSGPrimitives2D.cpp
@@ -0,0 +1,211 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2012
+// Modified by Benjamin Kehlet, 2012-2013
+//
+// First added:  2012-04-12
+// Last changed: 2013-03-13
+
+#include <sstream>
+#include <dolfin/math/basic.h>
+
+#include "CSGPrimitives2D.h"
+
+#include <limits>
+#include <algorithm>
+#include <dolfin/log/LogStream.h>
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+// Circle
+//-----------------------------------------------------------------------------
+Circle::Circle(double x0, double x1, double r, std::size_t fragments)
+  : _x0(x0), _x1(x1), _r(r), _fragments(fragments)
+{
+  if (_r < DOLFIN_EPS)
+  {
+    dolfin_error("CSGPrimitives2D.cpp",
+                 "create circle",
+                 "Circle with center (%f, %f) has zero or negative radius",
+                 _x0, _x1);
+  }
+  if (_fragments < 3)
+  {
+    dolfin_error("CSGPrimitives2D.cpp",
+                 "create circle",
+                 "Unable to create circle with less than 3 fragments");
+
+  }
+}
+//-----------------------------------------------------------------------------
+std::string Circle::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Circle at (" << _x0 << ", " << _x1 << ") with radius " << _r << ">";
+  }
+  else
+  {
+    s << "Circle("
+      << _x0 << ", " << _x1 << ", " << _r << ")";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// Ellipse
+//-----------------------------------------------------------------------------
+Ellipse::Ellipse(double x0, double x1, double a, double b,
+                 std::size_t fragments)
+  : _x0(x0), _x1(x1), _a(a), _b(b), _fragments(fragments)
+{
+  if (_a < DOLFIN_EPS || _b < DOLFIN_EPS)
+  {
+    dolfin_error("CSGPrimitives2D.cpp",
+                 "create ellipse",
+                 "Ellipse with center (%f, %f) has invalid semi-axis",
+                 _x0, _x1);
+  }
+  if (_fragments < 3)
+  {
+    dolfin_error("CSGPrimitives2D.cpp",
+                 "create ellipse",
+                 "Unable to create ellipse with less than 3 fragments");
+
+  }
+}
+//-----------------------------------------------------------------------------
+std::string Ellipse::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Ellipse at (" << _x0 << ", " << _x1 << ") with horizontal semi-axis "
+      << _a << " and vertical semi-axis " << _b << ">";
+  }
+  else
+  {
+    s << "Ellipse("
+      << _x0 << ", " << _x1 << ", " << _a << ", " << _b << ")";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// Rectangle
+//-----------------------------------------------------------------------------
+Rectangle::Rectangle(double x0, double x1, double y0, double y1)
+  : _x0(x0), _x1(x1), _y0(y0), _y1(y1)
+{
+  if (near(x0, y0) || near(x1, y1))
+  {
+    dolfin_error("CSGPrimitives2D.cpp",
+                 "create rectangle",
+                 "Rectangle with corner (%f, %f) and (%f, %f) degenerated",
+                 x0, x1, y0, y1);
+  }
+}
+//-----------------------------------------------------------------------------
+std::string Rectangle::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Rectangle with first corner at (" << _x0 << ", " << _x1 << ") "
+      << "and second corner at (" << _y0 << ", " << _y1 << ")>";
+  }
+  else
+  {
+    s << "Rectangle("
+      << _x0 << ", " << _x1 << ", " << _y0 << ", " << _y1 << ")";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// Polygon
+//-----------------------------------------------------------------------------
+Polygon::Polygon(const std::vector<Point>& vertices)
+  : _vertices(vertices.begin(), vertices.end())
+{
+  if (_vertices.size() < 3)
+  {
+    dolfin_error("CSGPrimitives2D.cpp",
+                 "create polygon",
+                 "Polygon should have at least three vertices");
+  }
+
+  if (!ccw())
+    dolfin_error("CSGPrimitives2D.cpp",
+                 "create polygon",
+                 "Polygonv vertices must be given in counter clockwise order");
+}
+//-----------------------------------------------------------------------------
+std::string Polygon::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Polygon with vertices ";
+    std::vector<Point>::const_iterator p;
+    for (p = _vertices.begin(); p != _vertices.end(); ++p)
+    {
+      s << "(" << p->x() << ", " << p->y() << ")";
+      if ((p != _vertices.end()) && (p + 1 != _vertices.end()))
+        s << ", ";
+    }
+    s << ">";
+  }
+  else
+  {
+    s << "Polygon(";
+    std::vector<Point>::const_iterator p;
+    for (p = _vertices.begin(); p != _vertices.end(); ++p)
+    {
+      s << "(" << p->x() << ", " << p->y() << ")";
+      if ((p != _vertices.end()) && (p + 1 != _vertices.end()))
+        s << ", ";
+    }
+    s << ")";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+bool Polygon::ccw() const
+{
+  double signed_area = 0.0;
+  
+  Point prev = _vertices.back();
+  for (std::vector<Point>::const_iterator it = _vertices.begin(),
+	 v_end = _vertices.end();
+       it != v_end;
+       ++it)
+  {
+    signed_area += (prev.x()*it->y())-(it->x()*prev.y());
+    prev = *it;
+  }
+
+  return signed_area > 0;
+}
diff --git a/dolfin/generation/CSGPrimitives2D.h b/dolfin/generation/CSGPrimitives2D.h
new file mode 100644
index 0000000..9242079
--- /dev/null
+++ b/dolfin/generation/CSGPrimitives2D.h
@@ -0,0 +1,198 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2012
+// Modified by Benjamin Kehlet, 2012-2013
+//
+// First added:  2012-04-11
+// Last changed: 2013-03-13
+
+#ifndef __CSG_PRIMITIVES_2D_H
+#define __CSG_PRIMITIVES_2D_H
+
+#include <vector>
+#include <dolfin/geometry/Point.h>
+#include "CSGPrimitive.h"
+
+namespace dolfin
+{
+
+  /// Base class for 2D primitives
+  class CSGPrimitive2D : public CSGPrimitive
+  {
+  public:
+
+    /// Return dimension of geometry
+    std::size_t dim() const { return 2; }
+
+  };
+
+  /// This class describes a 2D circle which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG).
+  class Circle : public CSGPrimitive2D
+  {
+  public:
+
+    /// Create circle at x = (x0, x1) with radius r.
+    ///
+    /// *Arguments*
+    ///     x0 (double)
+    ///         x0-coordinate of center.
+    ///     x1 (double)
+    ///         x1-coordinate of center.
+    ///     r (double)
+    ///         radius.
+    ///     fragments (std::size_t)
+    ///         number of fragments.
+    Circle(double x0, double x1, double r, std::size_t fragments=32);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+    Type getType() const { return CSGGeometry::Circle; }
+
+    /// Return center of circle
+    Point center() const { return Point(_x0, _x1); }
+
+    /// Return radius of circle
+    double radius() const { return _r; }
+
+    /// Return number of fragments around the circle
+    std::size_t fragments() const { return _fragments; }
+
+  private:
+
+    double _x0, _x1, _r;
+    const std::size_t _fragments;
+
+  };
+
+  /// This class describes a 2D ellipse which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG).
+  class Ellipse : public CSGPrimitive2D
+  {
+  public:
+
+    /// Create ellipse at x = (x0, x1) with horizontal semi-axis a and
+    /// vertical semi-axis b.
+    ///
+    /// *Arguments*
+    ///     x0 (double)
+    ///         x0-coordinate of center.
+    ///     x1 (double)
+    ///         x1-coordinate of center.
+    ///     a (double)
+    ///         horizontal semi-axis.
+    ///     b (double)
+    ///         vertical semi-axis.
+    ///     fragments (std::size_t)
+    ///         number of fragments.
+    Ellipse(double x0, double x1, double a, double b, std::size_t fragments=32);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+    Type getType() const { return CSGGeometry::Ellipse; }
+
+    /// Return center of ellipse
+    Point center() const { return Point(_x0, _x1); }
+
+    /// Return horizontal semi-axis
+    double a() const { return _a; }
+
+    /// Return vertical semi-axis
+    double b() const { return _b; }
+
+    /// Return number of fragments around the ellipse
+    std::size_t fragments() const { return _fragments; }
+
+  private:
+
+    double _x0, _x1, _a, _b;
+    const std::size_t _fragments;
+
+  };
+
+  /// This class describes a 2D rectangle which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG).
+  class Rectangle : public CSGPrimitive2D
+  {
+  public:
+
+    /// Create rectangle defined by two opposite corners
+    /// x = (x0, x1) and y = (y0, y1).
+    ///
+    /// *Arguments*
+    ///     x0 (double)
+    ///         x0-coordinate of first corner.
+    ///     x1 (double)
+    ///         x1-coordinate of first corner.
+    ///     y0 (double)
+    ///         y0-coordinate of second corner.
+    ///     y1 (double)
+    ///         y1-coordinate of second corner.
+    Rectangle(double x0, double x1, double y0, double y1);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const { return CSGGeometry::Rectangle; }
+
+    /// Return first corner
+    Point first_corner() const { return Point(_x0, _x1); }
+
+    /// Return second corner
+    Point second_corner() const { return Point(_y0, _y1); }
+
+  private:
+
+    double _x0, _x1, _y0, _y1;
+
+  };
+
+  /// This class describes a 2D polygon which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG).
+  class Polygon : public CSGPrimitive2D
+  {
+  public:
+
+    /// Create polygon defined by the given vertices.
+    ///
+    /// *Arguments*
+    ///     vertices (std::vector<_Point_>)
+    ///         A vector of _Point_ objects.
+    ///         The points must be given in counter-clockwise order
+    ///         (without repeating the first/last vertex) and the polygon
+    //          must not self intersect.
+    Polygon(const std::vector<Point>& vertices);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+    Type getType() const { return CSGGeometry::Polygon; }
+
+    // Check if vertices are counter clockwise oriented
+    bool ccw() const;
+
+    /// Return vertices in polygon
+    const std::vector<Point>& vertices() const { return _vertices; }
+
+  private:
+
+    const std::vector<Point> _vertices;
+
+  };
+}
+
+#endif
diff --git a/dolfin/generation/CSGPrimitives3D.cpp b/dolfin/generation/CSGPrimitives3D.cpp
new file mode 100644
index 0000000..acc5caa
--- /dev/null
+++ b/dolfin/generation/CSGPrimitives3D.cpp
@@ -0,0 +1,168 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012
+//
+// First added:  2012-04-12
+// Last changed: 2012-11-12
+
+#include <sstream>
+#include <dolfin/math/basic.h>
+#include <dolfin/log/LogStream.h>
+#include "CSGPrimitives3D.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+// Sphere
+//-----------------------------------------------------------------------------
+Sphere::Sphere(Point center, double radius, std::size_t slices)
+  : c(center), r(radius), _slices(slices)
+{
+  if (r < DOLFIN_EPS)
+  {
+    dolfin_error("CSGPrimitives3D.cpp",
+		   "Create sphere",
+		   "Sphere with center (%f, %f, %f) has zero or negative radius", c.x(), c.y(), c.z());
+  }
+
+  if (slices < 1)
+  {
+    dolfin_error("CSGPrimitives3D.cpp",
+		 "Create sphere",
+		 "Can't create sphere with zero slices");
+  }
+}
+//-----------------------------------------------------------------------------
+std::string Sphere::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Sphere at " << c << " "
+      << "with radius " << r << ">";
+  }
+  else
+    s << "Sphere(" << c << ", " << r << ")";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// Box
+//-----------------------------------------------------------------------------
+Box::Box(double x0, double x1, double x2,
+         double y0, double y1, double y2)
+  : _x0(x0), _x1(x1), _x2(x2), _y0(y0), _y1(y1), _y2(y2)
+{
+  // FIXME: Check validity of coordinates here
+  if (near(x0, y0) || near(x1, y2) || near(x2, y2))
+      dolfin_error("CSGPrimitives3D.cpp",
+		   "Create axis aligned box",
+		   "Box with corner (%f, %f, %f) and (%f, %f, %f) degenerated", x0, x1, x2, y0, y1, y2);
+}
+//-----------------------------------------------------------------------------
+std::string Box::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << "<Box with first corner at (" << _x0 << ", " << _x1 << ", " << _x2 << ") "
+      << "and second corner at (" << _y0 << ", " << _y1 << ", " << _y2 << ")>";
+  }
+  else
+  {
+    s << "Box("
+      << _x0 << ", " << _x1 << ", " << _x2 << ", "
+      << _y0 << ", " << _y1 << ", " << _y2 << ")";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// Cone
+//-----------------------------------------------------------------------------
+Cone::Cone(Point top, Point bottom, double top_radius, double bottom_radius,
+           std::size_t slices)
+  : _top(top), _bottom(bottom), _top_radius(top_radius),
+    _bottom_radius(bottom_radius), _slices(slices)
+{
+  if (near(top_radius, 0.0) && near(bottom_radius, 0.0))
+  {
+      dolfin_error("CSGPrimitives3D.cpp",
+		   "Create cone",
+		   "Cone with zero thickness");
+  }
+
+  if (top.distance(bottom) < DOLFIN_EPS)
+  {
+    dolfin_error("CSGPrimitives3D.cpp",
+		 "Create cone",
+		 "Cone with zero length");
+  }
+}
+//-----------------------------------------------------------------------------
+std::string Cone::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+  {
+    s << "<Cone with top at " << _top << ", top radius " << _top_radius
+      << " and bottom at " << _bottom << ", bottom radius "
+      << _bottom_radius << ", with " << _slices << " slices>";
+  }
+  else
+  {
+    s << "Cone( " << _top << ", " << _bottom << ", " << _top_radius
+      << ", " << _bottom_radius << " )";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+Tetrahedron::Tetrahedron(Point x0, Point x1, Point x2, Point x3)
+  : _x0(x0), _x1(x1), _x2(x2), _x3(x3)
+{}
+//-----------------------------------------------------------------------------
+/// Informal string representation
+std::string Tetrahedron::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+  {
+    s << "<Tetrahedron with point at " << _x0 << ", " << _x1 << ", "
+      << _x2 << ", " << _x3 << ">";
+  }
+  else
+  {
+    s << "Tetrahedron( " << _x0 << ", " << _x1 << ", " << _x2 << ", "
+      << _x3 << ")";
+  }
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+Surface3D::Surface3D(std::string filename) : _filename(filename)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::string Surface3D::str(bool verbose) const
+{
+  return std::string("Surface3D from file ") + _filename;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/CSGPrimitives3D.h b/dolfin/generation/CSGPrimitives3D.h
new file mode 100644
index 0000000..937ea87
--- /dev/null
+++ b/dolfin/generation/CSGPrimitives3D.h
@@ -0,0 +1,207 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012
+// Modified by Johannes Ring, 2012
+//
+// First added:  2012-04-11
+// Last changed: 2012-11-12
+
+#ifndef __CSG_PRIMITIVES_3D_H
+#define __CSG_PRIMITIVES_3D_H
+
+#include <cstddef>
+#include <dolfin/geometry/Point.h>
+#include "CSGPrimitive.h"
+
+namespace dolfin
+{
+
+  /// Base class for 3D primitives
+  class CSGPrimitive3D : public CSGPrimitive
+  {
+  public:
+
+    /// Return dimension of geometry
+    std::size_t dim() const { return 3; }
+
+  };
+
+  /// This class describes a 3D sphere which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG).
+  class Sphere : public CSGPrimitive3D
+  {
+  public:
+
+    /// Create sphere with center (x0, x1, x2) and radius r.
+    ///
+    /// *Arguments*
+    ///     center (Point)
+    ///         Center of sphere.
+    ///     r (double)
+    ///         radius.
+    Sphere(Point center, double radius, std::size_t slices=16);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const
+    { return CSGGeometry::Sphere; }
+
+    const Point c;
+    const double r;
+    const std::size_t _slices;
+
+  };
+
+  /// This class describes a 3D box which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG).
+  class Box : public CSGPrimitive3D
+  {
+  public:
+
+    /// Create box defined by two opposite corners
+    /// x = (x0, x1, x2) and y = (y0, y1, y2).
+    ///
+    /// *Arguments*
+    ///     x0 (double)
+    ///         x0-coordinate of first corner.
+    ///     x1 (double)
+    ///         x1-coordinate of first corner.
+    ///     x2 (double)
+    ///         x2-coordinate of first corner.
+    ///     y0 (double)
+    ///         y0-coordinate of second corner.
+    ///     y1 (double)
+    ///         y1-coordinate of second corner.
+    ///     y2 (double)
+    ///         y2-coordinate of second corner.
+    Box(double x0, double x1, double x2,
+        double y0, double y1, double y2);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const
+    { return CSGGeometry::Box; }
+
+    double _x0, _x1, _x2, _y0, _y1, _y2;
+  };
+
+  /// This class describes a 3D cone which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG).
+  class Cone : public CSGPrimitive3D
+  {
+  public:
+
+    /// Create cone defined by upper and lower center
+    /// and radius respectively.
+    ///
+    /// *Arguments*
+    ///     top (Point)
+    ///         Center at top of cone.
+    ///     top_radius(double)
+    ///         Radius bottom of cone.
+    ///     bottom(Point)
+    ///         Center at top of cone.
+    ///     bottom_radius (double)
+    ///         radius at top of cone.
+    ///     slices (std::size_t)
+    ///         number of faces on the side when generating a
+    ///         polyhedral approximation.
+    Cone(Point top, Point bottom, double top_radius, double bottom_radius,
+         std::size_t slices=32);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const
+    { return CSGGeometry::Cone; }
+
+    const Point _top, _bottom;
+    const double _top_radius, _bottom_radius;
+    const std::size_t _slices;
+  };
+
+  /// This class describes a 3D cylinder which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG). A cylinder
+  /// is here just a special case of a cone.
+  class Cylinder : public Cone
+  {
+  public:
+
+    /// Create cylinder defined by upper and lower center
+    /// and radius respectively.
+    ///
+    /// *Arguments*
+    ///     top (Point)
+    ///         Center at top of cylinder.
+    ///     bottom(Point)
+    ///         Center at bottom of cylinder.
+    ///     r (double)
+    ///         radius of cylinder.
+    ///     slices (std::size_t)
+    ///         number of faces on the side when generating a
+    ///         polyhedral approximation.
+    Cylinder(Point top, Point bottom, double r, std::size_t slices=32)
+      : Cone(top, bottom, r, r, slices) {}
+  };
+
+  /// This class describes a Tetrahedron which can be used to build
+  /// geometries using Constructive Solid Geometry (CSG).
+  class Tetrahedron : public CSGPrimitive3D
+  {
+  public:
+    /// Create tetrahedron defined by four corner points.
+    ///
+    /// *Arguments*
+    ///     x0 (Point)
+    ///         Point.
+    ///     x1 (Point)
+    ///         Point.
+    ///     x2 (Point)
+    ///         Point.
+    ///     x3 (Point)
+    ///         Point.
+    Tetrahedron(Point x0, Point x1, Point x2, Point x3);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const
+    { return CSGGeometry::Tetrahedron; }
+
+    Point _x0, _x1, _x2, _x3;
+  };
+
+  /// This class describes a 3D surface loaded from file.
+  /// The supported file types
+  class Surface3D : public CSGPrimitive3D
+  {
+  public:
+    Surface3D(std::string filename);
+
+    /// Informal string representation
+    std::string str(bool verbose) const;
+
+    Type getType() const
+    { return CSGGeometry::Surface3D; }
+
+    std::string _filename;
+  };
+}
+#endif
diff --git a/dolfin/generation/EllipseMesh.cpp b/dolfin/generation/EllipseMesh.cpp
new file mode 100644
index 0000000..1259c00
--- /dev/null
+++ b/dolfin/generation/EllipseMesh.cpp
@@ -0,0 +1,71 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-10-18
+// Last changed:
+
+#include <algorithm>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include "ImplicitDomainMeshGenerator.h"
+#include "PolygonalMeshGenerator.h"
+#include "EllipseMesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+EllipseMesh::EllipseMesh(Point center, std::vector<double> ellipse_dims,
+                         double cell_size)
+{
+  Timer timer("Generate ellipse mesh");
+
+  #ifdef HAS_CGAL
+  dolfin_assert(ellipse_dims.size() == 2);
+
+  // Estimate circumference
+  const double a = ellipse_dims[0];
+  const double b = ellipse_dims[1];
+
+  // Compute number of points to place on boundary
+  const double circumference = DOLFIN_PI*(3.0*(a + b)
+    - std::sqrt(10.0*a*b - 3.0*(a*a + b*b)));
+  const int num_points = 0.7*circumference/cell_size;
+
+  // Create polyhedral representation
+  std::vector<Point> polygon;
+  for (int i = 0; i < num_points; ++i)
+  {
+    const double dtheta = 2.0*DOLFIN_PI/static_cast<double>(num_points);
+    const double theta  = i*dtheta;
+    const double x = a*std::cos(theta) + center.x();
+    const double y = b*std::sin(theta) + center.y();
+    polygon.push_back(Point(x, y));
+  }
+  polygon.push_back(polygon.front());
+
+  // Generate mesh
+  PolygonalMeshGenerator::generate(*this, polygon, cell_size);
+
+  #else
+  dolfin_error("EllipseMesh.cpp",
+	       "generate ellipse mesh",
+	       "Generation of ellipse meshes requires DOLFIN to be configured with CGAL");
+  #endif
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/EllipseMesh.h b/dolfin/generation/EllipseMesh.h
new file mode 100644
index 0000000..7c11a84
--- /dev/null
+++ b/dolfin/generation/EllipseMesh.h
@@ -0,0 +1,90 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-10-18
+// Last changed:
+
+#ifndef __ELLIPSE_MESH_H
+#define __ELLIPSE_MESH_H
+
+#include <vector>
+#include <dolfin/mesh/Mesh.h>
+
+namespace dolfin
+{
+
+  class Point;
+
+  /// Triangular mesh of an ellipse. CGAL is used to generate the
+  /// mesh.
+
+  class EllipseMesh : public Mesh
+  {
+  public:
+
+    /// Create an unstructured _Mesh_ of an ellipse
+    ///
+    /// *Arguments*
+    ///     center (_Point))
+    ///         Center of the ellipsoid
+    ///     dims (std::vector<double>)
+    ///         Axes lengths
+    ///     cell_size (double)
+    ///         Cell size measure
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Create elliposid mesh
+    ///         std::vector<double> dims(2);
+    //          dims[0] = 1.0; dims[1] = 2.0;
+    ///         EllipsoidMesh mesh(Point(1.0, 2.0), dims, 0.2);
+    ///
+    EllipseMesh(Point p, std::vector<double> ellipse_dims,
+                double cell_size);
+
+  };
+
+  class CircleMesh : public EllipseMesh
+  {
+  public:
+
+    /// Create an unstructured _Mesh_ of a circle
+    ///
+    /// *Arguments*
+    ///     center (_Point_)
+    ///         Center of the ellipsoid
+    ///     radius (double)
+    ///         Axes lengths
+    ///     cell_size (double)
+    ///         Cell size measure
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Create sphere with center (1.0, 2.0) and
+    ///         // radius 3.0. Cell size is 0.2.
+    ///         SphereMesh mesh(Point(1.0, 2.0), 3.0, 0.2);
+    ///
+    CircleMesh(Point p, double radius, double cell_size)
+      : EllipseMesh(p, std::vector<double>(2, radius), cell_size) {}
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/EllipsoidMesh.cpp b/dolfin/generation/EllipsoidMesh.cpp
new file mode 100644
index 0000000..f01d675
--- /dev/null
+++ b/dolfin/generation/EllipsoidMesh.cpp
@@ -0,0 +1,75 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-10-18
+// Last changed:
+
+#include <algorithm>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/geometry/ImplicitSurface.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include "ImplicitDomainMeshGenerator.h"
+#include "EllipsoidMesh.h"
+
+using namespace dolfin;
+
+// Surface representation class
+class EllipsoidSurface : public dolfin::ImplicitSurface
+{
+public:
+
+  EllipsoidSurface(Point center, std::vector<double> dims)
+    : ImplicitSurface(Sphere(center, *std::max_element(dims.begin(),
+                                                       dims.end()) ),
+                      "manifold"), _center(center), _dims(dims) {}
+
+  double f0(const dolfin::Point& p) const
+  {
+    double d = 0.0;
+    for (int i = 0; i < 3; ++i)
+    {
+      const double x = p[i] - _center[i];
+      d += x*x/(_dims[i]*_dims[i]);
+    }
+    return d - 1.0;
+  }
+
+  const Point _center;
+  const std::vector<double> _dims;
+};
+
+//-----------------------------------------------------------------------------
+EllipsoidMesh::EllipsoidMesh(Point center, std::vector<double> ellipsoid_dims,
+                             double cell_size)
+{
+  Timer timer("Generate ellipsoid mesh");
+
+  // Create implicit representation of ellipsoid
+  EllipsoidSurface surface(center, ellipsoid_dims);
+
+  // Generate mesh
+  #ifdef HAS_CGAL
+  ImplicitDomainMeshGenerator::generate(*this, surface, cell_size) ;
+  #else
+  dolfin_error("EllipsoidMesh.cpp",
+	       "generate ellipsoid mesh",
+	       "Generation of ellipsoid meshes requires DOLFIN to be configured with CGAL");
+  #endif
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/EllipsoidMesh.h b/dolfin/generation/EllipsoidMesh.h
new file mode 100644
index 0000000..d066393
--- /dev/null
+++ b/dolfin/generation/EllipsoidMesh.h
@@ -0,0 +1,90 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-10-18
+// Last changed:
+
+#ifndef __ELLIPSOID_MESH_H
+#define __ELLIPSOID_MESH_H
+
+#include <vector>
+#include <dolfin/mesh/Mesh.h>
+
+namespace dolfin
+{
+
+  class Point;
+
+  /// Tetrahedral mesh of an ellipsoid. CGAL is used to generate the
+  /// mesh.
+
+  class EllipsoidMesh : public Mesh
+  {
+  public:
+
+    /// Create an unstructured _Mesh_ of an ellipsoid
+    ///
+    /// *Arguments*
+    ///     center (_Point))
+    ///         Center of the ellipsoid
+    ///     dims (std::vector<double>)
+    ///         Axes lengths
+    ///     cell_size (double)
+    ///         Cell size measure
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Create elliposid mesh
+    ///         std::vector<double> dims(3);
+    //          dims[0] = 1.0; dims[1] = 2.0; dims[2] = 1.5;
+    ///         EllipsoidMesh mesh(Point(1.0, 2.0, -1.0), dims, 0.2);
+    ///
+    EllipsoidMesh(Point p, std::vector<double> ellipsoid_dims,
+                  double cell_size);
+
+  };
+
+  class SphereMesh : public EllipsoidMesh
+  {
+  public:
+
+    /// Create an unstructured _Mesh_ of a sphere
+    ///
+    /// *Arguments*
+    ///     center (_Point_)
+    ///         Center of the ellipsoid
+    ///     radius (double)
+    ///         Axes lengths
+    ///     cell_size (double)
+    ///         Cell size measure
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Create sphere with center (1.0, 2.0, -1.0) and
+    ///         // radius 3.0. Cell size is 0.2.
+    ///         SphereMesh mesh(Point(1.0, 2.0, -1.0), 3.0, 0.2);
+    ///
+    SphereMesh(Point p, double radius, double cell_size)
+      : EllipsoidMesh(p, std::vector<double>(3, radius), cell_size) {}
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/GeometryToCGALConverter.cpp b/dolfin/generation/GeometryToCGALConverter.cpp
new file mode 100644
index 0000000..21f5d8f
--- /dev/null
+++ b/dolfin/generation/GeometryToCGALConverter.cpp
@@ -0,0 +1,738 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-05-10
+// Last changed: 2012-05-10
+
+// This class is capable of converting a 3D dolfin::CSGGeometry to a
+// CGAL::Polyhedron_3
+
+#ifdef HAS_CGAL
+
+#include <limits>
+#include <CGAL/Polyhedron_incremental_builder_3.h>
+
+#include "GeometryToCGALConverter.h"
+#include "CSGGeometry.h"
+#include "CSGOperators.h"
+#include "PolyhedronUtils.h"
+#include "CSGPrimitives3D.h"
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/LogStream.h>
+#include <dolfin/math/basic.h>
+#include "cgal_csg3d.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+// Taken from demo/Polyhedron/Scene_nef_polyhedron_item.cpp in the
+// CGAL source tree.
+// Quick hacks to convert polyhedra from exact to inexact and
+// vice-versa
+template <class Polyhedron_input, class Polyhedron_output>
+struct Copy_polyhedron_to
+  : public CGAL::Modifier_base<typename Polyhedron_output::HalfedgeDS>
+{
+  Copy_polyhedron_to(const Polyhedron_input& in_poly)
+    : _in_poly(in_poly) {}
+
+  void operator()(typename Polyhedron_output::HalfedgeDS& out_hds)
+  {
+    typedef typename Polyhedron_output::HalfedgeDS Output_HDS;
+
+    CGAL::Polyhedron_incremental_builder_3<Output_HDS> builder(out_hds);
+
+    typedef typename Polyhedron_input::Vertex_const_iterator Vertex_const_iterator;
+    typedef typename Polyhedron_input::Facet_const_iterator  Facet_const_iterator;
+    typedef typename Polyhedron_input::Halfedge_around_facet_const_circulator HFCC;
+
+    builder.begin_surface(_in_poly.size_of_vertices(),
+                          _in_poly.size_of_facets(),
+                          _in_poly.size_of_halfedges());
+
+    for(Vertex_const_iterator
+      vi = _in_poly.vertices_begin(), end = _in_poly.vertices_end();
+      vi != end ; ++vi)
+    {
+      typename Polyhedron_output::Point_3 p(::CGAL::to_double( vi->point().x()),
+	::CGAL::to_double( vi->point().y()),
+	::CGAL::to_double( vi->point().z()));
+      builder.add_vertex(p);
+    }
+
+    typedef CGAL::Inverse_index<Vertex_const_iterator> Index;
+    Index index(_in_poly.vertices_begin(), _in_poly.vertices_end());
+
+    for(Facet_const_iterator
+      fi = _in_poly.facets_begin(), end = _in_poly.facets_end();
+      fi != end; ++fi)
+    {
+      HFCC hc = fi->facet_begin();
+      HFCC hc_end = hc;
+      builder.begin_facet ();
+      do
+      {
+        builder.add_vertex_to_facet(index[hc->vertex()]);
+        ++hc;
+      } while( hc != hc_end);
+      builder.end_facet();
+    }
+    builder.end_surface();
+  } // end operator()(..)
+private:
+  const Polyhedron_input& _in_poly;
+}; // end Copy_polyhedron_to<>
+
+template <class Poly_A, class Poly_B>
+void copy_to(const Poly_A& poly_a, Poly_B& poly_b)
+{
+  Copy_polyhedron_to<Poly_A, Poly_B> modifier(poly_a);
+  poly_b.delegate(modifier);
+  CGAL_assertion(poly_b.is_valid());
+}
+//-----------------------------------------------------------------------------
+// Convenience routine to make debugging easier. Remove before releasing.
+static void add_facet(CGAL::Polyhedron_incremental_builder_3<csg::Exact_HalfedgeDS>& builder,
+		      std::vector<int>& vertices, bool print=false)
+{
+  static int facet_no = 0;
+
+  if (print)
+  {
+    cout << "Begin facet " << facet_no << endl;
+    if (!vertices.size())
+    {
+      cout << "No vertices in facet!" << endl;
+      return;
+    }
+
+    // Print vertices
+    for (std::vector<int>::iterator it=vertices.begin(); it != vertices.end(); it++)
+      cout << "Vertex: " << (*it) << endl;
+
+    if (builder.test_facet(vertices.begin(), vertices.end()))
+      cout << "Facet ok, size: " << vertices.size() << endl;
+    else
+      cout << "Facet not ok" << endl;
+  }
+
+  builder.begin_facet();
+  for (std::vector<int>::iterator it=vertices.begin(); it != vertices.end(); it++)
+    builder.add_vertex_to_facet(*it);
+  builder.end_facet();
+
+  if (print)
+    cout << "End facet" << endl;
+  facet_no++;
+}
+//-----------------------------------------------------------------------------
+static void add_vertex(CGAL::Polyhedron_incremental_builder_3<csg::Exact_HalfedgeDS>& builder,
+		       const csg::Exact_Point_3& point, bool print=false)
+{
+  static int vertex_no = 0;
+  if (print)
+    std::cout << "Adding vertex " << vertex_no << " at " << point << std::endl;
+
+  builder.add_vertex(point);
+  vertex_no++;
+}
+//-----------------------------------------------------------------------------
+// Sphere
+//-----------------------------------------------------------------------------
+class Build_sphere : public CGAL::Modifier_base<csg::Exact_HalfedgeDS>
+{
+ public:
+  Build_sphere(const Sphere& sphere) : _sphere(sphere) {}
+
+  void operator()( csg::Exact_HalfedgeDS& hds )
+  {
+    const std::size_t num_slices = _sphere._slices;
+    const std::size_t num_sectors = _sphere._slices*2 + 1;
+
+    const dolfin::Point top = _sphere.c + Point(_sphere.r, 0, 0);
+    const dolfin::Point bottom = _sphere.c - Point(_sphere.r, 0, 0);
+    const dolfin::Point axis = Point(1, 0, 0);
+
+    const int num_vertices = num_slices*num_sectors+2;
+    const int num_facets = num_sectors*2*num_slices;
+
+    CGAL::Polyhedron_incremental_builder_3<csg::Exact_HalfedgeDS> builder( hds, true );
+
+    builder.begin_surface(num_vertices, num_facets);
+
+    const Point slice_rotation_axis(0, 1, 0);
+
+    for (std::size_t i = 0; i < num_slices; i++)
+    {
+      const Point sliced = axis.rotate(slice_rotation_axis, (i+1)*DOLFIN_PI/(num_slices+1));
+      for (std::size_t j = 0; j < num_sectors; j++)
+      {
+        const Point direction = sliced.rotate(axis, j*2.0*DOLFIN_PI/num_sectors);
+        const Point v = _sphere.c + direction*_sphere.r;
+        add_vertex(builder, csg::Exact_Point_3 (v.x(), v.y(), v.z()));
+      }
+    }
+
+    // Add bottom has index num_vertices-1, top has index num_vertices-2
+    add_vertex(builder, csg::Exact_Point_3(top.x(), top.y(), top.z()));
+    add_vertex(builder, csg::Exact_Point_3(bottom.x(), bottom.y(), bottom.z()));
+
+    // Add the side facets
+    for (std::size_t i = 0; i < num_slices-1; i++)
+    {
+      for (std::size_t j = 0; j < num_sectors; j++)
+      {
+        const std::size_t offset1 = i*num_sectors;
+        const std::size_t offset2 = (i+1)*num_sectors;
+
+        {
+          std::vector<int> f;
+          f.push_back(offset1 + j);
+          f.push_back(offset1 + (j+1)%num_sectors);
+          f.push_back(offset2 + j);
+          add_facet(builder, f);
+        }
+
+        {
+          std::vector<int> f;
+          f.push_back(offset2 + (j+1)%num_sectors);
+          f.push_back(offset2 + j);
+          f.push_back(offset1 + (j+1)%num_sectors);
+          add_facet(builder, f);
+        }
+      }
+    }
+
+    // Add the top and bottom facets
+    const std::size_t top_offset = num_sectors*(num_slices-1);
+    for (std::size_t i = 0; i < num_sectors; i++)
+    {
+      {
+        // Bottom facet
+        std::vector<int> f;
+        f.push_back( num_vertices-2 );
+        f.push_back( (i+1)%num_sectors );
+        f.push_back(i);
+        add_facet(builder, f);
+      }
+
+      {
+        // Top facet
+        std::vector<int> f;
+        f.push_back( num_vertices-1 );
+        f.push_back( top_offset + (i%num_sectors) );
+        f.push_back( top_offset + (i+1)%num_sectors );
+        add_facet(builder, f);
+      }
+    }
+    builder.end_surface();
+  }
+
+  private:
+  const Sphere& _sphere;
+};
+//-----------------------------------------------------------------------------
+static void make_sphere(const Sphere* s, csg::Exact_Polyhedron_3& P)
+{
+  Build_sphere builder(*s);
+  P.delegate(builder);
+  dolfin_assert(P.is_valid());
+  dolfin_assert(P.is_closed());
+}
+//-----------------------------------------------------------------------------
+class Build_box : public CGAL::Modifier_base<csg::Exact_HalfedgeDS>
+{
+ public:
+  Build_box(const Box* box) : _box(box) {}
+
+  void operator()( csg::Exact_HalfedgeDS& hds )
+  {
+    CGAL::Polyhedron_incremental_builder_3<csg::Exact_HalfedgeDS> builder(hds, true);
+
+    builder.begin_surface(8, 12);
+
+    const double x0 = std::min(_box->_x0, _box->_y0);
+    const double y0 = std::max(_box->_x0, _box->_y0);
+
+    const double x1 = std::min(_box->_x1, _box->_y1);
+    const double y1 = std::max(_box->_x1, _box->_y1);
+
+    const double x2 = std::min(_box->_x2, _box->_y2);
+    const double y2 = std::max(_box->_x2, _box->_y2);
+
+    add_vertex(builder, csg::Exact_Point_3(y0, x1, x2));
+    add_vertex(builder, csg::Exact_Point_3(x0, x1, y2));
+    add_vertex(builder, csg::Exact_Point_3(x0, x1, x2));
+    add_vertex(builder, csg::Exact_Point_3(x0, y1, x2));
+    add_vertex(builder, csg::Exact_Point_3(y0, x1, y2));
+    add_vertex(builder, csg::Exact_Point_3(x0, y1, y2));
+    add_vertex(builder, csg::Exact_Point_3(y0, y1, x2));
+    add_vertex(builder, csg::Exact_Point_3(y0, y1, y2));
+
+    {
+      std::vector<int> f;
+      f.push_back(1);
+      f.push_back(2);
+      f.push_back(3);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(1);
+      f.push_back(3);
+      f.push_back(5);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(1);
+      f.push_back(5);
+      f.push_back(4);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(4);
+      f.push_back(5);
+      f.push_back(7);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(4);
+      f.push_back(7);
+      f.push_back(0);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(0);
+      f.push_back(7);
+      f.push_back(6);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(0);
+      f.push_back(6);
+      f.push_back(2);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(2);
+      f.push_back(6);
+      f.push_back(3);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(7);
+      f.push_back(5);
+      f.push_back(6);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(6);
+      f.push_back(5);
+      f.push_back(3);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(1);
+      f.push_back(4);
+      f.push_back(2);
+      add_facet(builder, f);
+    }
+
+    {
+      std::vector<int> f;
+      f.push_back(2);
+      f.push_back(4);
+      f.push_back(0);
+      add_facet(builder, f);
+    }
+
+    builder.end_surface();
+  }
+
+  const Box* _box;
+};
+//-----------------------------------------------------------------------------
+static void make_box(const Box* b, csg::Exact_Polyhedron_3& P)
+{
+  Build_box builder(b);
+  P.delegate(builder);
+  dolfin_assert(P.is_closed());
+  dolfin_assert(P.is_valid());
+}
+//-----------------------------------------------------------------------------
+static void make_tetrahedron(const Tetrahedron* b, csg::Exact_Polyhedron_3& P)
+{
+  P.make_tetrahedron(csg::Exact_Point_3(b->_x0.x(), b->_x0.y(), b->_x0.z()),
+                     csg::Exact_Point_3(b->_x1.x(), b->_x1.y(), b->_x1.z()),
+                     csg::Exact_Point_3(b->_x2.x(), b->_x2.y(), b->_x2.z()),
+                     csg::Exact_Point_3(b->_x3.x(), b->_x3.y(), b->_x3.z()));
+}
+//-----------------------------------------------------------------------------
+// Return some vector orthogonal to a
+static Point generate_orthogonal(const Point& a)
+{
+  const Point b(0, 1, 0);
+  const Point c(0, 0, 1);
+
+  // Find a vector not parallel to a.
+  const Point d = (fabs(a.dot(b)) < fabs(a.dot(c))) ? b : c;
+  return a.cross(d);
+}
+//-----------------------------------------------------------------------------
+class Build_cone : public CGAL::Modifier_base<csg::Exact_HalfedgeDS>
+{
+ public:
+  Build_cone(const Cone* cone) : _cone(cone) {}
+
+  void operator()(csg::Exact_HalfedgeDS& hds)
+  {
+    const dolfin::Point axis = (_cone->_top - _cone->_bottom)/(_cone->_top - _cone->_bottom).norm();
+    dolfin::Point initial = generate_orthogonal(axis);
+
+    CGAL::Polyhedron_incremental_builder_3<csg::Exact_HalfedgeDS> builder(hds, true);
+
+    const int num_sides = _cone->_slices;
+    const bool top_degenerate = near(_cone->_top_radius, 0.0);
+    const bool bottom_degenerate = near(_cone->_bottom_radius, 0.0);
+
+    const int num_vertices = (top_degenerate || bottom_degenerate) ? num_sides+2 : num_sides*2+2;
+
+    builder.begin_surface(num_vertices, num_sides*4);
+
+    const double delta_theta = 2.0 * DOLFIN_PI / num_sides;
+    for (int i = 0; i < num_sides; ++i)
+    {
+      const double theta = i*delta_theta;
+      const Point rotated = initial.rotate(axis, theta);
+      if (!bottom_degenerate)
+      {
+        const Point p = _cone->_bottom + rotated*_cone->_bottom_radius;
+        const csg::Exact_Point_3 p_(p.x(), p.y(), p.z());
+        add_vertex(builder, p_);
+      }
+      if (!top_degenerate)
+      {
+        const Point p = _cone->_top + rotated*_cone->_top_radius;
+        const csg::Exact_Point_3 p_(p.x(), p.y(), p.z());
+        add_vertex(builder, p_);
+      }
+    }
+
+    // The top and bottom vertices
+    add_vertex(builder, csg::Exact_Point_3(_cone->_bottom.x(), _cone->_bottom.y(),
+                                           _cone->_bottom.z()));
+    add_vertex(builder, csg::Exact_Point_3(_cone->_top.x(), _cone->_top.y(),
+                                           _cone->_top.z()));
+
+    // bottom vertex has index num_vertices-2, top vertex has index num_vertices-1
+
+    // Construct the facets on the side.
+    // Vertices must be sorted counter clockwise seen from inside.
+    for (int i = 0; i < num_sides; ++i)
+    {
+      if (top_degenerate)
+      {
+        std::vector<int> f;
+        f.push_back((i + 1)%num_sides);
+        f.push_back(i);
+        f.push_back(num_vertices - 1);
+        add_facet(builder, f);
+      }
+      else if (bottom_degenerate)
+      {
+        std::vector<int> f;
+        f.push_back( (i) );
+        f.push_back( (i + 1) % num_sides);
+        f.push_back(num_vertices - 1);
+        add_facet(builder, f);
+      }
+      else
+      {
+        //Draw the sides as triangles.
+        const int vertex_offset = i*2;
+
+        // First triangle
+        std::vector<int> f;
+        f.push_back(vertex_offset);
+        f.push_back(vertex_offset + 1);
+        f.push_back((vertex_offset + 2) % (num_sides*2));
+        add_facet(builder, f);
+
+        // Second triangle
+        std::vector<int> g;
+        g.push_back((vertex_offset + 3) % (num_sides*2));
+        g.push_back((vertex_offset + 2) % (num_sides*2));
+        g.push_back(vertex_offset + 1);
+        add_facet(builder, g);
+      }
+    }
+
+    // Construct the bottom facet.
+    if (!bottom_degenerate)
+    {
+      for (int i = num_sides-1; i >= 0; i -= 1)
+      {
+        std::vector<int> f;
+        if (!top_degenerate)
+        {
+          f.push_back(num_vertices-2);
+          f.push_back( i*2);
+          f.push_back( ( (i+1)*2) % (num_sides*2));
+        }
+        else
+        {
+          f.push_back(num_vertices-2);
+          f.push_back(i);
+          f.push_back( (i+1)%num_sides );
+        }
+        add_facet(builder, f);
+      }
+    }
+
+    // Construct the the top facet
+    if (!top_degenerate)
+    {
+      for (int i = 0; i < num_sides; i++)
+      {
+        if (!bottom_degenerate)
+        {
+          std::vector<int> f;
+          f.push_back(num_vertices-1);
+          f.push_back( ( (i+1)*2)%(num_sides*2) +1 );
+          f.push_back( i*2 + 1 );
+          add_facet(builder, f);
+        }
+        else
+        {
+          std::vector<int> f;
+          f.push_back(num_vertices-2);
+          f.push_back( (i+1)%num_sides);
+          f.push_back(i);
+          add_facet(builder, f);
+        }
+      }
+    }
+
+    builder.end_surface();
+  }
+private:
+  const Cone* _cone;
+};
+//-----------------------------------------------------------------------------
+static void make_cone(const Cone* c, csg::Exact_Polyhedron_3& P)
+{
+  Build_cone builder(c);
+  P.delegate(builder);
+  dolfin_assert(P.is_closed());
+  dolfin_assert(P.is_valid());
+}
+//-----------------------------------------------------------------------------
+static void make_surface3D(const Surface3D* s, csg::Exact_Polyhedron_3& P)
+{
+  dolfin_assert(s);
+  PolyhedronUtils::readSurfaceFile(s->_filename, P);
+}
+//-----------------------------------------------------------------------------
+static std::shared_ptr<csg::Nef_polyhedron_3>
+convertSubTree(const CSGGeometry *geometry)
+{
+  switch (geometry->getType())
+  {
+    case CSGGeometry::Union :
+    {
+      const CSGUnion* u = dynamic_cast<const CSGUnion*>(geometry);
+      dolfin_assert(u);
+      std::shared_ptr<csg::Nef_polyhedron_3> g0 = convertSubTree(u->_g0.get());
+      std::shared_ptr<csg::Nef_polyhedron_3> g1 = convertSubTree(u->_g1.get());
+      (*g0) += (*g1);
+      return g0;
+
+      break;
+    }
+    case CSGGeometry::Intersection :
+    {
+      const CSGIntersection* u = dynamic_cast<const CSGIntersection*>(geometry);
+      dolfin_assert(u);
+      std::shared_ptr<csg::Nef_polyhedron_3> g0 = convertSubTree(u->_g0.get());
+      std::shared_ptr<csg::Nef_polyhedron_3> g1 = convertSubTree(u->_g1.get());
+      (*g0) *= (*g1);
+      return g0;
+      break;
+    }
+    case CSGGeometry::Difference :
+    {
+      const CSGDifference* u = dynamic_cast<const CSGDifference*>(geometry);
+      dolfin_assert(u);
+      std::shared_ptr<csg::Nef_polyhedron_3> g0 = convertSubTree(u->_g0.get());
+      std::shared_ptr<csg::Nef_polyhedron_3> g1 = convertSubTree(u->_g1.get());
+      (*g0) -= (*g1);
+      return g0;
+      break;
+    }
+    case CSGGeometry::Cone :
+    {
+      const Cone* c = dynamic_cast<const Cone*>(geometry);
+      dolfin_assert(c);
+      csg::Exact_Polyhedron_3 P;
+      make_cone(c, P);
+      return std::shared_ptr<csg::Nef_polyhedron_3>(new csg::Nef_polyhedron_3(P));
+      break;
+    }
+    case CSGGeometry::Sphere :
+    {
+      const Sphere* s = dynamic_cast<const Sphere*>(geometry);
+      dolfin_assert(s);
+      csg::Exact_Polyhedron_3 P;
+      make_sphere(s, P);
+      return std::shared_ptr<csg::Nef_polyhedron_3>(new csg::Nef_polyhedron_3(P));
+      break;
+    }
+    case CSGGeometry::Box :
+    {
+      const Box* b = dynamic_cast<const Box*>(geometry);
+      dolfin_assert(b);
+      csg::Exact_Polyhedron_3 P;
+      make_box(b, P);
+      return std::shared_ptr<csg::Nef_polyhedron_3>(new csg::Nef_polyhedron_3(P));
+      break;
+    }
+
+    case CSGGeometry::Tetrahedron :
+    {
+      const Tetrahedron* b = dynamic_cast<const Tetrahedron*>(geometry);
+      dolfin_assert(b);
+      csg::Exact_Polyhedron_3 P;
+      make_tetrahedron(b, P);
+      return std::shared_ptr<csg::Nef_polyhedron_3>(new csg::Nef_polyhedron_3(P));
+      break;
+    }
+    case CSGGeometry::Surface3D :
+    {
+      const Surface3D* b = dynamic_cast<const Surface3D*>(geometry);
+      dolfin_assert(b);
+      csg::Exact_Polyhedron_3 P;
+      make_surface3D(b, P);
+      return std::shared_ptr<csg::Nef_polyhedron_3>(new csg::Nef_polyhedron_3(P));
+      break;
+    }
+    default:
+      dolfin_error("GeometryToCGALConverter.cpp",
+		   "converting geometry to cgal polyhedron",
+		   "Unhandled primitive type");
+  }
+
+  // Make compiler happy.
+  return std::shared_ptr<csg::Nef_polyhedron_3>(new csg::Nef_polyhedron_3);
+}
+//-----------------------------------------------------------------------------
+void GeometryToCGALConverter::convert(const CSGGeometry& geometry,
+                                      csg::Polyhedron_3 &p,
+                                      bool remove_degenerated)
+{
+  csg::Exact_Polyhedron_3 P;
+
+  // If the tree has only one node, we don't have to convert to Nef
+  // polyhedrons for csg manipulations
+  if (!geometry.is_operator())
+  {
+    switch (geometry.getType())
+    {
+
+    case CSGGeometry::Cone :
+    {
+      const Cone* c = dynamic_cast<const Cone*>(&geometry);
+      dolfin_assert(c);
+      make_cone(c, P);
+      break;
+    }
+    case CSGGeometry::Sphere :
+    {
+    const Sphere* s = dynamic_cast<const Sphere*>(&geometry);
+    dolfin_assert(s);
+    make_sphere(s, P);
+    break;
+    }
+    case CSGGeometry::Box :
+    {
+      const Box* b = dynamic_cast<const Box*>(&geometry);
+      dolfin_assert(b);
+      make_box(b, P);
+      break;
+    }
+
+    case CSGGeometry::Tetrahedron :
+    {
+      const Tetrahedron* b = dynamic_cast<const Tetrahedron*>(&geometry);
+      dolfin_assert(b);
+      make_tetrahedron(b, P);
+      break;
+    }
+    case CSGGeometry::Surface3D :
+    {
+      const Surface3D* b = dynamic_cast<const Surface3D*>(&geometry);
+      dolfin_assert(b);
+      make_surface3D(b, P);
+      break;
+    }
+    default:
+      dolfin_error("GeometryToCGALConverter.cpp",
+                   "converting geometry to cgal polyhedron",
+                   "Unhandled primitive type");
+    }
+  }
+  else
+  {
+    cout << "Convert to nef polyhedron" << endl;
+    std::shared_ptr<csg::Nef_polyhedron_3> cgal_geometry
+      = convertSubTree(&geometry);
+    dolfin_assert(cgal_geometry->is_valid());
+    dolfin_assert(cgal_geometry->is_simple());
+    cgal_geometry->convert_to_polyhedron(P);
+  }
+
+  if (remove_degenerated)
+  {
+    cout << "Removing degenerated facets" << endl;
+    PolyhedronUtils::remove_degenerate_facets(P, DOLFIN_SQRT_EPS);
+  }
+
+  copy_to(P, p);
+
+  cout << "Number of vertices: " << p.size_of_vertices() << endl;
+  cout << "Number of facets:   " << p.size_of_facets() << endl;
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/generation/GeometryToCGALConverter.h b/dolfin/generation/GeometryToCGALConverter.h
new file mode 100644
index 0000000..989829e
--- /dev/null
+++ b/dolfin/generation/GeometryToCGALConverter.h
@@ -0,0 +1,45 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-05-10
+// Last changed: 2012-05-10
+
+// This class is capable of converting a 3D dolfin::CSGGeometry to a
+// CGAL::Polyhedron_3
+
+#ifndef __CSG_GEOMETRY_TO_CGAL_CONVERTER_H
+#define __CSG_GEOMETRY_TO_CGAL_CONVERTER_H
+
+#ifdef HAS_CGAL
+
+#include "cgal_csg3d.h"
+
+namespace dolfin
+{
+  class CSGGeometry;
+
+  class GeometryToCGALConverter
+  {
+  public:
+    static void convert(const CSGGeometry& geometry, csg::Polyhedron_3& p,
+                        bool remove_degenerated=true);
+  };
+}
+
+#endif
+
+#endif
diff --git a/dolfin/generation/ImplicitDomainMeshGenerator.cpp b/dolfin/generation/ImplicitDomainMeshGenerator.cpp
new file mode 100644
index 0000000..00e2a24
--- /dev/null
+++ b/dolfin/generation/ImplicitDomainMeshGenerator.cpp
@@ -0,0 +1,215 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-03
+// Last changed: 2012-02-16
+
+#ifdef HAS_CGAL
+
+#include <vector>
+#include <boost/bind.hpp>
+#include <boost/function.hpp>
+
+#include <CGAL/version.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Mesh_triangulation_3.h>
+#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
+#include <CGAL/Mesh_criteria_3.h>
+#include <CGAL/Triangulation_vertex_base_with_info_3.h>
+#include <CGAL/Triangulation_cell_base_with_info_3.h>
+#include <CGAL/make_mesh_3.h>
+
+#if CGAL_VERSION_NR >= 1040301000
+#include <CGAL/Compact_mesh_cell_base_3.h>
+#endif
+
+#include <CGAL/Implicit_surface_3.h>
+#include <CGAL/Implicit_mesh_domain_3.h>
+#include <CGAL/Mesh_domain_with_polyline_features_3.h>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/geometry/ImplicitSurface.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include "CGALMeshBuilder.h"
+
+#include "ImplicitDomainMeshGenerator.h"
+
+// CGAL kernel typedefs
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+
+// Point
+typedef K::Point_3 Point_3;
+
+typedef CGAL::Robust_weighted_circumcenter_filtered_traits_3<K>
+Geom_traits;
+
+// Call-back function
+typedef boost::function<double (Point_3)> Function;
+
+// Mesh domain
+typedef CGAL::Implicit_mesh_domain_3<const Function, K> Mesh_domain0;
+typedef CGAL::Mesh_domain_with_polyline_features_3<Mesh_domain0> Mesh_domain;
+
+// CGAL 3D triangulation vertex typedefs
+typedef CGAL::Triangulation_vertex_base_3<Geom_traits> Tvb3_base;
+typedef CGAL::Triangulation_vertex_base_with_info_3<int, Geom_traits,
+                                             Tvb3_base> Tvb3;
+typedef CGAL::Mesh_vertex_base_3<Geom_traits, Mesh_domain,
+                                 Tvb3> Vertex_base;
+
+// CGAL 3D triangulation cell typedefs
+#if CGAL_VERSION_NR >= 1040301000
+typedef CGAL::Compact_mesh_cell_base_3<Geom_traits, Mesh_domain> Cb;
+typedef CGAL::Triangulation_cell_base_with_info_3<int, Geom_traits,
+                                                  Cb> Cell_base;
+#else
+typedef CGAL::Triangulation_cell_base_3<Geom_traits> Tcb3_base;
+typedef CGAL::Triangulation_cell_base_with_info_3<int, Geom_traits,
+                                            Tcb3_base> Tcb3;
+typedef CGAL::Mesh_cell_base_3<Geom_traits, Mesh_domain,
+                               Tcb3> Cell_base;
+#endif
+
+// CGAL 3D triangulation typedefs
+typedef CGAL::Triangulation_data_structure_3<Vertex_base, Cell_base>
+Tds_mesh;
+typedef CGAL::Regular_triangulation_3<Geom_traits, Tds_mesh> Tr;
+
+// Triangulation
+typedef CGAL::Mesh_complex_3_in_triangulation_3<Tr> C3t3;
+
+// Criteria
+typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
+
+
+using namespace dolfin;
+
+// Lightweight class for wrapping callback to ImplicitSurface::f0()
+class ImplicitSurfaceWrapper
+{
+public:
+  ImplicitSurfaceWrapper(const ImplicitSurface& surface) : _surface(surface) {}
+  ~ImplicitSurfaceWrapper() {}
+
+  double f(const Point_3& p)
+  {
+    _p[0] = p[0]; _p[1] = p[1]; _p[2] = p[2];
+    return _surface.f0(_p);
+  }
+
+private:
+  const ImplicitSurface& _surface;
+  Point _p;
+
+};
+
+//-----------------------------------------------------------------------------
+void ImplicitDomainMeshGenerator::generate(Mesh& mesh,
+                                           const ImplicitSurface& surface,
+                                           double cell_size)
+{
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Mesh criteria
+    Mesh_criteria criteria(CGAL::parameters::edge_size=cell_size,
+                           CGAL::parameters::facet_angle=30,
+                           CGAL::parameters::facet_size=cell_size,
+                           CGAL::parameters::cell_size=cell_size);
+
+    // Build CGAL mesh
+    C3t3 c3t3 = build_cgal_triangulation<C3t3>(surface, criteria);
+
+    // Build DOLFIN mesh from CGAL 3D mesh/triangulation
+    CGALMeshBuilder::build_from_mesh(mesh, c3t3);
+  }
+
+  // Build distributed mesh
+  MeshPartitioning::build_distributed_mesh(mesh);
+}
+//-----------------------------------------------------------------------------
+void
+ImplicitDomainMeshGenerator::generate_surface(Mesh& mesh,
+                                              const ImplicitSurface& surface,
+                                              double cell_size)
+
+{
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // CGAL mesh paramters
+    Mesh_criteria criteria(CGAL::parameters::edge_size=cell_size,
+                           CGAL::parameters::facet_angle=30,
+                           CGAL::parameters::facet_size=cell_size,
+                           CGAL::parameters::cell_size=0.0);
+
+    // Build CGAL mesh
+    C3t3 c3t3 = build_cgal_triangulation<C3t3>(surface, criteria);
+
+    // Build surface DOLFIN mesh from CGAL 3D mesh/triangulation
+    CGALMeshBuilder::build_surface_mesh_c3t3(mesh, c3t3, &surface);
+  }
+
+  // Build distributed mesh
+  MeshPartitioning::build_distributed_mesh(mesh);
+}
+//-----------------------------------------------------------------------------
+template<typename X, typename Y>
+X ImplicitDomainMeshGenerator::build_cgal_triangulation(
+  const ImplicitSurface& surface,
+  const Y& mesh_criteria)
+{
+  // Wrap implicit surface
+  ImplicitSurfaceWrapper surface_wrapper(surface);
+  boost::function<double (Point_3)> f(boost::bind(&ImplicitSurfaceWrapper::f,
+                                                  &surface_wrapper, _1));
+
+  // Create CGAL bounding sphere
+  const Point c = surface.sphere.c;
+  dolfin_assert(surface.sphere.r > 0.0);
+  K::Sphere_3 bounding_sphere(Point_3(c[0], c[1], c[2]),
+                              surface.sphere.r*surface.sphere.r);
+
+  // Create mesh domain
+  Mesh_domain domain(f, bounding_sphere, 1.0e-5);
+
+  // Add polylines (if any)
+  std::list<std::vector<Point_3> > cgal_polylines;
+  std::list<std::vector<Point> >::const_iterator polyline;
+  const std::list<std::vector<Point> >& polylines = surface.polylines;
+  for (polyline = polylines.begin(); polyline != polylines.end(); ++polyline)
+  {
+    std::vector<Point_3> _line;
+    _line.reserve(polyline->size());
+    std::vector<Point>::const_iterator p;
+    for (p = polyline->begin(); p != polyline->end(); ++p)
+      _line.push_back(Point_3(p->x(), p->y(), p->z()));
+
+    cgal_polylines.push_back(_line);
+  }
+
+  // Add polyline features
+  domain.add_features(cgal_polylines.begin(), cgal_polylines.end());
+
+  // Generate CGAL mesh
+  return CGAL::make_mesh_3<X>(domain, mesh_criteria);
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/generation/ImplicitDomainMeshGenerator.h b/dolfin/generation/ImplicitDomainMeshGenerator.h
new file mode 100644
index 0000000..f5ed3e8
--- /dev/null
+++ b/dolfin/generation/ImplicitDomainMeshGenerator.h
@@ -0,0 +1,65 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-07-07
+// Last changed:
+
+#ifndef __DOLFIN_IMPLICITDOMAINMESHGENERATOR_H
+#define __DOLFIN_IMPLICITDOMAINMESHGENERATOR_H
+
+#ifdef HAS_CGAL
+
+#include <string>
+#include <vector>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class ImplicitSurface;
+  class Mesh;
+
+  /// Generate surface or volume meshes from implicit representations
+  /// of a domain modelled by the abstract dolfin::ImplicitSurface
+  /// class. CGAL is used for the mesh generation.
+
+  class ImplicitDomainMeshGenerator
+  {
+  public:
+
+    /// Create volume mesh from implicit surface representation
+    static void generate(Mesh& mesh, const ImplicitSurface& surface,
+                         double cell_size);
+
+    /// Create surface mesh from implicit surface representation. This
+    /// function uses the CGAL 3D mesh genrator
+    static void generate_surface(Mesh& mesh, const ImplicitSurface& surface,
+                                 double cell_size);
+
+  private:
+
+    // Build CGAL triangulation
+    template<typename X, typename Y>
+      static X build_cgal_triangulation(const ImplicitSurface& surface,
+                                        const Y& mesh_criteria);
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/generation/IntervalMesh.cpp b/dolfin/generation/IntervalMesh.cpp
new file mode 100644
index 0000000..17a26e7
--- /dev/null
+++ b/dolfin/generation/IntervalMesh.cpp
@@ -0,0 +1,114 @@
+// Copyright (C) 2007 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by N. Lopes, 2008.
+// Modified by Mikael Mortensen, 2014.
+//
+// First added:  2007-11-23
+// Last changed: 2014-02-17
+
+#include "dolfin/common/constants.h"
+#include "dolfin/common/MPI.h"
+#include "dolfin/mesh/CellType.h"
+#include "dolfin/mesh/MeshEditor.h"
+#include "dolfin/mesh/MeshPartitioning.h"
+#include "IntervalMesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+IntervalMesh::IntervalMesh(std::size_t nx, double a, double b)
+  : Mesh(MPI_COMM_WORLD)
+{
+  build(nx, a, b);
+}
+//-----------------------------------------------------------------------------
+IntervalMesh::IntervalMesh(MPI_Comm comm, std::size_t nx, double a, double b)
+  : Mesh(comm)
+{
+  build(nx, a, b);
+}
+//-----------------------------------------------------------------------------
+void IntervalMesh::build(std::size_t nx, double a, double b)
+{
+  // Receive mesh according to parallel policy
+  if (MPI::is_receiver(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+
+  if (std::abs(a - b) < DOLFIN_EPS)
+  {
+    dolfin_error("Interval.cpp",
+                 "create interval",
+                 "Length of interval is zero. Consider checking your dimensions");
+  }
+
+  if (b < a)
+  {
+    dolfin_error("Interval.cpp",
+                 "create interval",
+                 "Length of interval is negative. Consider checking the order of your arguments");
+  }
+
+  if (nx < 1)
+  {
+    dolfin_error("Interval.cpp",
+                 "create interval",
+                 "Number of points on interval is (%d), it must be at least 1", nx);
+  }
+
+  rename("mesh", "Mesh of the interval (a, b)");
+
+  // Open mesh for editing
+  MeshEditor editor;
+  editor.open(*this, CellType::interval, 1, 1);
+
+  // Create vertices and cells:
+  editor.init_vertices_global((nx+1), (nx+1));
+  editor.init_cells_global(nx, nx);
+
+  // Create main vertices:
+  for (std::size_t ix = 0; ix <= nx; ix++)
+  {
+    const std::vector<double>
+      x(1, a + (static_cast<double>(ix)*(b - a)/static_cast<double>(nx)));
+    editor.add_vertex(ix, x);
+  }
+
+  // Create intervals
+  for (std::size_t ix = 0; ix < nx; ix++)
+  {
+    std::vector<std::size_t> cell(2);
+    cell[0] = ix; cell[1] = ix + 1;
+    editor.add_cell(ix, cell);
+  }
+
+  // Close mesh editor
+  editor.close();
+
+  // Broadcast mesh according to parallel policy
+  if (MPI::is_broadcaster(this->mpi_comm()))
+  {
+    std::cout << "Building mesh (dist 0a)" << std::endl;
+    MeshPartitioning::build_distributed_mesh(*this);
+    std::cout << "Building mesh (dist 1a)" << std::endl;
+    return;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/IntervalMesh.h b/dolfin/generation/IntervalMesh.h
new file mode 100644
index 0000000..58030ba
--- /dev/null
+++ b/dolfin/generation/IntervalMesh.h
@@ -0,0 +1,89 @@
+// Copyright (C) 2007 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by N. Lopes, 2008.
+// Modified by Mikael Mortensen, 2014.
+//
+// First added:  2007-11-23
+// Last changed: 2014-02-17
+
+#ifndef __INTERVAL_MESH_H
+#define __INTERVAL_MESH_H
+
+#include <cstddef>
+#include <dolfin/common/MPI.h>
+#include <dolfin/mesh/Mesh.h>
+
+namespace dolfin
+{
+
+  /// Interval mesh of the 1D line [a,b].  Given the number of cells
+  /// (nx) in the axial direction, the total number of intervals will
+  /// be nx and the total number of vertices will be (nx + 1).
+
+  class IntervalMesh : public Mesh
+  {
+  public:
+
+    /// Constructor
+    ///
+    /// *Arguments*
+    ///     nx (std::size_t)
+    ///         The number of cells.
+    ///     a (double)
+    ///         The minimum point (inclusive).
+    ///     b (double)
+    ///         The maximum point (inclusive).
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Create a mesh of 25 cells in the interval [-1,1]
+    ///         IntervalMesh mesh(25, -1.0, 1.0);
+    ///
+    IntervalMesh(std::size_t nx, double a, double b);
+
+    /// Constructor
+    ///
+    /// *Arguments*
+    ///     comm (MPI_Comm)
+    ///         MPI communicator
+    ///     nx (std::size_t)
+    ///         The number of cells.
+    ///     a (double)
+    ///         The minimum point (inclusive).
+    ///     b (double)
+    ///         The maximum point (inclusive).
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Create a mesh of 25 cells in the interval [-1,1]
+    ///         IntervalMesh mesh(MPI_COMM_WORLD, 25, -1.0, 1.0);
+    ///
+    IntervalMesh(MPI_Comm comm, std::size_t nx, double a, double b);
+
+  private:
+
+    // Build mesh
+    void build(std::size_t nx, double a, double b);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/PolygonalMeshGenerator.cpp b/dolfin/generation/PolygonalMeshGenerator.cpp
new file mode 100644
index 0000000..87c930a
--- /dev/null
+++ b/dolfin/generation/PolygonalMeshGenerator.cpp
@@ -0,0 +1,116 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-02
+// Last changed:
+
+#ifdef HAS_CGAL
+
+#include <vector>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Triangulation_vertex_base_with_info_2.h>
+#include <CGAL/Constrained_Delaunay_triangulation_2.h>
+#include <CGAL/Delaunay_mesher_2.h>
+#include <CGAL/Delaunay_mesh_face_base_2.h>
+#include <CGAL/Delaunay_mesh_size_criteria_2.h>
+#include <CGAL/Polygon_2.h>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include "CGALMeshBuilder.h"
+#include "PolygonalMeshGenerator.h"
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+
+typedef CGAL::Triangulation_vertex_base_2<K> Vbase;
+typedef CGAL::Triangulation_vertex_base_with_info_2<std::size_t, K, Vbase> Vb;
+typedef CGAL::Delaunay_mesh_face_base_2<K> Fb;
+typedef CGAL::Triangulation_data_structure_2<Vb, Fb> Tds;
+typedef CGAL::Constrained_Delaunay_triangulation_2<K, Tds> CDT;
+typedef CGAL::Delaunay_mesh_size_criteria_2<CDT> Criteria;
+typedef CGAL::Delaunay_mesher_2<CDT, Criteria> CGAL_Mesher;
+
+typedef CDT::Vertex_handle Vertex_handle;
+typedef CDT::Point CGAL_Point;
+
+typedef CGAL::Polygon_2<K> Polygon_2;
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void
+PolygonalMeshGenerator::generate(Mesh& mesh,
+                                 const std::vector<Point>& polygon_vertices,
+                                 double cell_size)
+{
+  // Generate CGAL mesh on root process
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Build list of CGAL points
+    std::vector<CGAL_Point> cgal_points;
+    std::vector<Point>::const_iterator p;
+    for (p = polygon_vertices.begin(); p != polygon_vertices.end(); ++p)
+      cgal_points.push_back(CGAL_Point(p->x(), p->y()));
+
+    // Create polygon
+    Polygon_2 polygon(cgal_points.begin(), cgal_points.end());
+
+    // Generate mesh::vet
+    generate(mesh, polygon, cell_size);
+  }
+
+  // Build distributed mesh
+  MeshPartitioning::build_distributed_mesh(mesh);
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void PolygonalMeshGenerator::generate(Mesh& mesh, const T& polygon,
+                                      double cell_size)
+{
+  // Create empty CGAL triangulation
+  CDT cdt;
+
+  // Add polygon edges as triangulation constraints
+  typename Polygon_2::Edge_const_iterator edge;
+  for (edge = polygon.edges_begin(); edge != polygon.edges_end(); ++edge)
+    cdt.insert_constraint(edge->point(0), edge->point(1));
+
+  // Create mesher
+  CGAL_Mesher mesher(cdt);
+
+  // Refine CGAL mesh/triangulation
+  mesher.set_criteria(Criteria(0.125, cell_size));
+  mesher.refine_mesh();
+
+  // Build DOLFIN mesh from CGAL triangulation
+  CGALMeshBuilder::build(mesh, cdt);
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+bool PolygonalMeshGenerator::is_convex(const std::vector<T>& vertices)
+{
+  // Create polygon and test for convexity
+  Polygon_2 polygon(vertices.begin(), vertices.end());
+  return polygon.is_convex();
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/generation/PolygonalMeshGenerator.h b/dolfin/generation/PolygonalMeshGenerator.h
new file mode 100644
index 0000000..21d7cae
--- /dev/null
+++ b/dolfin/generation/PolygonalMeshGenerator.h
@@ -0,0 +1,61 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2012
+//
+// First added:  2012-01-05
+// Last changed: 2012-05-03
+
+#ifndef __DOLFIN_POLYGONALMESHGENERATOR_H
+#define __DOLFIN_POLYGONALMESHGENERATOR_H
+
+#ifdef HAS_CGAL
+
+#include <vector>
+
+namespace dolfin
+{
+
+  class Mesh;
+  class Point;
+
+  /// Polygonal mesh generator that uses CGAL
+
+  class PolygonalMeshGenerator
+  {
+  public:
+
+    /// Generate mesh of a polygonal domain described by domain vertices
+    static void generate(Mesh& mesh, const std::vector<Point>& vertices,
+                         double cell_size);
+
+    /// Generate mesh of a domain described by a CGAL polygon
+    template <typename T>
+    static void generate(Mesh& mesh, const T& polygon, double cell_size);
+
+  private:
+
+    // Check that input polygon is convex
+    template <typename T>
+    static bool is_convex(const std::vector<T>& vertices);
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/generation/PolyhedralMeshGenerator.cpp b/dolfin/generation/PolyhedralMeshGenerator.cpp
new file mode 100644
index 0000000..72fbfa8
--- /dev/null
+++ b/dolfin/generation/PolyhedralMeshGenerator.cpp
@@ -0,0 +1,340 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-03
+// Last changed: 2012-02-16
+
+#ifdef HAS_CGAL
+
+#include <vector>
+#include <boost/function.hpp>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Mesh_triangulation_3.h>
+#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
+#include <CGAL/Mesh_criteria_3.h>
+#include <CGAL/Mesh_polyhedron_3.h>
+#include <CGAL/Polyhedral_mesh_domain_with_features_3.h>
+#include <CGAL/Triangulation_vertex_base_with_info_3.h>
+#include <CGAL/Triangulation_cell_base_with_info_3.h>
+#include <CGAL/make_mesh_3.h>
+
+#if CGAL_VERSION_NR >= 1040301000
+#include <CGAL/Compact_mesh_cell_base_3.h>
+#endif
+
+// The below two files are from the CGAL demos. Path can be changed
+// once they are included with the CGAL code.
+#include "cgal_triangulate_polyhedron.h"
+#include "compute_normal.h"
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/geometry/ImplicitSurface.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include "CGALMeshBuilder.h"
+#include "PolyhedralMeshGenerator.h"
+
+
+// CGAL kernel typedefs
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+
+typedef CGAL::Robust_weighted_circumcenter_filtered_traits_3<K> Geom_traits;
+
+// CGAL domain typedefs
+typedef CGAL::Polyhedral_mesh_domain_with_features_3<K> Mesh_domain;
+
+// CGAL 3D triangulation vertex typedefs
+typedef CGAL::Triangulation_vertex_base_3<Geom_traits> Tvb3_base;
+typedef CGAL::Triangulation_vertex_base_with_info_3<int, Geom_traits,
+                                                    Tvb3_base> Tvb3;
+typedef CGAL::Mesh_vertex_base_3<Geom_traits, Mesh_domain, Tvb3> Vertex_base;
+
+// CGAL 3D triangulation cell typedefs
+// CGAL 3D triangulation cell typedefs
+#if CGAL_VERSION_NR >= 1040301000
+typedef CGAL::Compact_mesh_cell_base_3<Geom_traits, Mesh_domain> Cb;
+typedef CGAL::Triangulation_cell_base_with_info_3<int, Geom_traits,
+                                                  Cb> Cell_base;
+#else
+typedef CGAL::Triangulation_cell_base_3<Geom_traits> Tcb3_base;
+typedef CGAL::Triangulation_cell_base_with_info_3<int, Geom_traits,
+                                            Tcb3_base> Tcb3;
+typedef CGAL::Mesh_cell_base_3<Geom_traits, Mesh_domain,
+                               Tcb3> Cell_base;
+#endif
+
+// CGAL 3D triangulation typedefs
+typedef CGAL::Triangulation_data_structure_3<Vertex_base, Cell_base> Tds_mesh;
+typedef CGAL::Regular_triangulation_3<Geom_traits, Tds_mesh> Tr;
+
+// CGAL 3D mesh typedef
+typedef CGAL::Mesh_complex_3_in_triangulation_3<
+  Tr, Mesh_domain::Corner_index, Mesh_domain::Curve_segment_index> C3t3;
+
+// Mesh criteria
+typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
+
+// Typedefs for building CGAL polyhedron from list of facets
+typedef CGAL::Mesh_polyhedron_3<K>::Type Polyhedron;
+typedef Polyhedron::Facet_iterator Facet_iterator;
+typedef Polyhedron::Halfedge_around_facet_circulator Halfedge_facet_circulator;
+typedef Polyhedron::HalfedgeDS HalfedgeDS;
+
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+template <class HDS>
+class BuildSurface : public CGAL::Modifier_base<HDS>
+{
+
+  // This class is used to build a CGAL polyhedron from a list of
+  // triangular facets. It requires defintion of the member function
+  //
+  //     void operator()(HDS& hds);
+
+public:
+
+  BuildSurface(const std::vector<Point>& vertices,
+               const std::vector<std::vector<std::size_t> >& facets)
+    : _vertices(vertices), _facets(facets)  {}
+
+  void operator()(HDS& hds)
+  {
+    // Check that hds is a valid polyhedral surface
+    CGAL::Polyhedron_incremental_builder_3<HDS> B(hds, true);
+
+    // Initialise polyhedron building
+    B.begin_surface(_vertices.size(), _facets.size(), 0);
+
+    typedef typename HDS::Vertex CVertex;
+    typedef typename CVertex::Point CPoint;
+
+    // Add vertices
+    std::vector<Point>::const_iterator p;
+    for (p = _vertices.begin(); p != _vertices.end(); ++p)
+      B.add_vertex(CPoint(p->x(), p->y(), p->z()));
+
+    // Add facets
+    std::vector<std::vector<std::size_t> >::const_iterator f;
+    for (f = _facets.begin(); f != _facets.end(); ++f)
+    {
+      // Add facet vertices
+      B.begin_facet();
+      for (std::size_t i = 0; i < f->size(); ++i)
+        B.add_vertex_to_facet((*f)[i]);
+      B.end_facet();
+    }
+
+    // Finalise
+    B.end_surface();
+  }
+private:
+
+  const std::vector<Point>& _vertices;
+  const std::vector<std::vector<std::size_t> >& _facets;
+};
+//-----------------------------------------------------------------------------
+void PolyhedralMeshGenerator::generate(Mesh& mesh,
+                                       const std::string off_file,
+                                       double cell_size,
+                                       bool detect_sharp_features)
+{
+  // Generate CGAL mesh on root process
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Create empty CGAL polyhedron
+    Polyhedron p;
+
+    // Read polyhedron from file
+    std::ifstream p_file(off_file.c_str());
+    if (!p_file)
+    {
+      dolfin_error("PolyhedralMeshGenerator.cpp",
+                   "open .off file to read 3D geometry",
+                   "Failed to open file");
+    }
+    p_file >> p;
+
+    // Generate mesh
+    cgal_generate(mesh, p, cell_size, detect_sharp_features);
+  }
+
+  // Build distributed mesh
+  MeshPartitioning::build_distributed_mesh(mesh);
+}
+//-----------------------------------------------------------------------------
+void PolyhedralMeshGenerator::generate(Mesh& mesh,
+                        const std::vector<Point>& vertices,
+                        const std::vector<std::vector<std::size_t> >& facets,
+                        double cell_size, bool detect_sharp_features)
+{
+  // Generate CGAL mesh on root process
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Create empty CGAL polyhedron
+    Polyhedron p;
+
+    // Build CGAL polyhedron
+    BuildSurface<HalfedgeDS> poly_builder(vertices, facets);
+    p.delegate(poly_builder);
+
+    // Generate mesh
+    cgal_generate(mesh, p, cell_size, detect_sharp_features);
+  }
+
+  // Build distributed mesh
+  MeshPartitioning::build_distributed_mesh(mesh);
+}
+//-----------------------------------------------------------------------------
+void PolyhedralMeshGenerator::generate_surface_mesh(Mesh& mesh,
+                         const std::vector<Point>& vertices,
+                         const std::vector<std::vector<std::size_t> >& facets,
+                         double cell_size, bool detect_sharp_features)
+{
+  // Generate CGAL mesh on root process
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Create empty CGAL polyhedron
+    Polyhedron p;
+
+    // Build CGAL polyhedron
+    BuildSurface<HalfedgeDS> poly_builder(vertices, facets);
+    p.delegate(poly_builder);
+
+    // Generate surface mesh
+    cgal_generate_surface_mesh(mesh, p, cell_size, detect_sharp_features);
+  }
+
+  // Build distributed mesh
+  MeshPartitioning::build_distributed_mesh(mesh);
+}
+//-----------------------------------------------------------------------------
+void PolyhedralMeshGenerator::generate_surface_mesh(Mesh& mesh,
+                                                    const std::string off_file,
+                                                    double cell_size,
+                                                    bool detect_sharp_features)
+{
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Create empty CGAL polyhedron
+    Polyhedron p;
+
+    // Read polyhedron from file
+    std::ifstream p_file(off_file.c_str());
+    if (!p_file)
+    {
+      dolfin_error("PolyhedralMeshGenerator.cpp",
+                   "open .off file to read 3D geometry",
+                   "Failed to open file");
+    }
+    p_file >> p;
+
+    // Generate mesh
+    cgal_generate_surface_mesh(mesh, p, cell_size, detect_sharp_features);
+  }
+
+  // Build distributed mesh
+  MeshPartitioning::build_distributed_mesh(mesh);
+}
+//-----------------------------------------------------------------------------
+template<typename T>
+void PolyhedralMeshGenerator::cgal_generate(Mesh& mesh, T& p,
+                                            double cell_size,
+                                            bool detect_sharp_features)
+{
+  // Check if any facets are not triangular and triangulate if
+  // necessary.  The CGAL mesh generation only supports polyhedra with
+  // triangular surface facets.
+
+  typename Polyhedron::Facet_iterator facet;
+  for (facet = p.facets_begin(); facet != p.facets_end(); ++facet)
+  {
+    // Check if there is a non-triangular facet
+    if (!facet->is_triangle())
+    {
+      CGAL::triangulate_polyhedron(p);
+      break;
+    }
+  }
+
+  // Create domain from polyhedron
+  Mesh_domain domain(p);
+
+  // Get sharp features
+  if (detect_sharp_features)
+    domain.detect_features();
+
+  const Mesh_criteria criteria(CGAL::parameters::facet_angle = 25,
+                               CGAL::parameters::facet_size = cell_size,
+                               CGAL::parameters::cell_radius_edge_ratio = 3.0,
+                               CGAL::parameters::edge_size = 0.6*cell_size,
+                               CGAL::parameters::cell_size = cell_size);
+
+  // Generate CGAL mesh
+  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria);
+
+  // Build DOLFIN mesh from CGAL mesh/triangulation
+  CGALMeshBuilder::build_from_mesh(mesh, c3t3);
+}
+//-----------------------------------------------------------------------------
+template<typename T>
+void PolyhedralMeshGenerator::cgal_generate_surface_mesh(Mesh& mesh, T& p,
+                                                    double cell_size,
+                                                    bool detect_sharp_features)
+{
+  // Check if any facets are not triangular and triangulate if
+  // necessary.  The CGAL mesh generation only supports polyhedra with
+  // triangular surface facets.
+  typename Polyhedron::Facet_iterator facet;
+  for (facet = p.facets_begin(); facet != p.facets_end(); ++facet)
+  {
+    // Check if there is a non-triangular facet
+    if (!facet->is_triangle())
+    {
+      CGAL::triangulate_polyhedron(p);
+      continue;
+    }
+  }
+
+  // Create domain from polyhedron
+  Mesh_domain domain(p);
+
+  // Get sharp features
+  if (detect_sharp_features)
+    domain.detect_features();
+
+  // Mesh criteria (produces no interior vertices)
+  const Mesh_criteria criteria(CGAL::parameters::facet_angle = 25,
+                               CGAL::parameters::facet_size = cell_size,
+                               CGAL::parameters::cell_radius_edge = 0,
+                               CGAL::parameters::edge_size = 0.5*cell_size,
+                               CGAL::parameters::cell_size=0);
+
+  // Generate CGAL mesh
+  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria);
+
+  // Build surface DOLFIN mesh from CGAL 3D mesh/triangulation
+  CGALMeshBuilder::build_surface_mesh_c3t3(mesh, c3t3);
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/generation/PolyhedralMeshGenerator.h b/dolfin/generation/PolyhedralMeshGenerator.h
new file mode 100644
index 0000000..26d56ce
--- /dev/null
+++ b/dolfin/generation/PolyhedralMeshGenerator.h
@@ -0,0 +1,79 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-03
+// Last changed: 2012-02-16
+
+#ifndef __DOLFIN_POLYHEDRALMESHGENERATOR_H
+#define __DOLFIN_POLYHEDRALMESHGENERATOR_H
+
+#ifdef HAS_CGAL
+
+#include <string>
+#include <vector>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+
+  /// Polyhedral mesh generator that uses CGAL. Volume and surfaces of
+  /// polyhedra (closed surface) can be generated from polyhedra
+  /// defined via polygonal facets.
+
+  class PolyhedralMeshGenerator
+  {
+  public:
+
+    /// Create volume mesh from Object File Format (.off) file
+    static void generate(Mesh& mesh, const std::string off_file,
+                         double cell_size, bool detect_sharp_features=true);
+
+    /// Create volume mesh from a collection of facets
+    static void generate(Mesh& mesh, const std::vector<Point>& vertices,
+                         const std::vector<std::vector<std::size_t> >& facets,
+                         double cell_size, bool detect_sharp_features=true);
+
+    /// Create surface mesh from a collection of facets
+    static void generate_surface_mesh(Mesh& mesh,
+                                      const std::vector<Point>& vertices,
+                         const std::vector<std::vector<std::size_t> >& facets,
+                         double cell_size, bool detect_sharp_features=true);
+
+    /// Create a surface mesh from Object File Format (.off) file
+    static void generate_surface_mesh(Mesh& mesh, const std::string off_file,
+                         double cell_size, bool detect_sharp_features=true);
+
+
+  private:
+
+    /// Create mesh from a CGAL polyhedron
+    template<typename T>
+    static void cgal_generate(Mesh& mesh, T& p, double cell_size,
+                              bool detect_sharp_features);
+
+    /// Create surface mesh from a CGAL polyhedron
+    template<typename T>
+    static void cgal_generate_surface_mesh(Mesh& mesh, T& p, double cell_size,
+                                           bool detect_sharp_features);
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/generation/PolyhedronUtils.cpp b/dolfin/generation/PolyhedronUtils.cpp
new file mode 100644
index 0000000..7acc746
--- /dev/null
+++ b/dolfin/generation/PolyhedronUtils.cpp
@@ -0,0 +1,635 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-10-31
+// Last changed: 2012-11-14
+
+#ifdef HAS_CGAL
+
+#include <fstream>
+#include <iostream>
+#include <sstream>
+#include <string>
+#include <algorithm>
+
+#include "PolyhedronUtils.h"
+#include <dolfin/common/constants.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+#include <dolfin/log/LogStream.h>
+
+#include <CGAL/Cartesian_d.h>
+#include <CGAL/Polyhedron_incremental_builder_3.h>
+#include <CGAL/Min_sphere_of_spheres_d.h>
+#include <CGAL/Min_sphere_of_spheres_d_traits_3.h>
+
+#define BOOST_FILESYSTEM_NO_DEPRECATED
+#include <boost/filesystem.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/tuple/tuple_comparison.hpp>
+#include <boost/tokenizer.hpp>
+#include <boost/algorithm/string.hpp>
+
+using namespace dolfin;
+
+static inline double strToDouble(const std::string& s, bool print=false)
+{
+  std::istringstream is(s);
+  double val;
+  is >> val;
+
+  if (print)
+    cout << "to_double " << s << " : " << val << endl;
+
+  return val;
+}
+
+dolfin::LogStream& operator << (dolfin::LogStream& stream,
+                                const boost::tuple<double,
+                                double, double>& obj)
+{
+  stream << obj.get<0>() << " " << obj.get<1>() << " " << obj.get<2>();
+  return stream;
+}
+
+template <class HDS>
+class BuildFromSTL : public CGAL::Modifier_base<HDS>
+{
+public:
+  BuildFromSTL(std::string filename) : _filename(filename){}
+  void operator()(HDS& hds)
+  {
+    cout << "Reading surface from " << _filename << endl;
+
+    CGAL::Polyhedron_incremental_builder_3<HDS> builder( hds, true);
+    builder.begin_surface(100000, 100000);
+
+    typedef boost::tokenizer<boost::char_separator<char> > tokenizer;
+
+    std::ifstream file(_filename.c_str());
+    if (!file.is_open())
+    {
+      dolfin_error("PolyhedronUtils.cpp",
+                   "open .stl file to read 3D surface",
+                   "Failed to open file");
+    }
+
+    std::size_t num_vertices = 0;
+    std::map<boost::tuple<double, double, double>, std::size_t> vertex_map;
+    std::vector<std::vector<std::size_t> > facets;
+    std::string line;
+    const boost::char_separator<char> sep(" ");
+
+    // Read the first line and trim away whitespaces
+    std::getline(file, line);
+    boost::algorithm::trim(line);
+
+    if (line.substr(0, 5) != "solid")
+    {
+      dolfin_error("PolyhedronUtils.cpp",
+                   "open .stl file to read 3D surface",
+                   "File does not start with \"solid\"");
+    }
+
+    // TODO: Read name of solid
+
+    std::getline(file, line);
+    boost::algorithm::trim(line);
+
+    while (file.good())
+    {
+      //bool has_normal = false;
+      //Point normal;
+
+      // Read the line "facet normal n1 n2 n3"
+      {
+        tokenizer tokens(line, sep);
+        tokenizer::iterator tok_iter = tokens.begin();
+
+        if (*tok_iter != "facet")
+          dolfin_error("PolyhedronUtils.cpp",
+                       "open .stl file to read 3D surface",
+                       "Expected keyword \"facet\"");
+        ++tok_iter;
+
+        // Check if a normal different from zero is given
+        if (tok_iter != tokens.end())
+        {
+          //cout << "Expecting normal" << endl;
+
+          if  (*tok_iter != "normal")
+            dolfin_error("PolyhedronUtils.cpp",
+                         "open .stl file to read 3D surface",
+                         "Expected keyword \"normal\"");
+          ++tok_iter;
+
+          //cout << "Read line: " << line << endl;
+
+          // for (std::size_t i = 0; i < 3; ++i)
+          // {
+          //   normal[i] = strToDouble(*tok_iter);
+          //   ++tok_iter;
+          // }
+
+
+          //cout << "Normal: " << normal << endl;
+          // if (normal.norm() > DOLFIN_EPS)
+          //   has_normal = true;
+
+          // if (tok_iter != tokens.end())
+          //   dolfin_error("PolyhedronUtils.cpp",
+          //                "open .stl file to read 3D surface",
+          //                "Expected end of line");
+        }
+      }
+
+      // Read "outer loop" line
+      std::getline(file, line);
+      boost::algorithm::trim(line);
+
+      if (line != "outer loop")
+        dolfin_error("PolyhedronUtils.cpp",
+                     "open .stl file to read 3D surface",
+                     "Expected key word outer loop");
+
+      std::vector<std::size_t> v_indices(3);
+
+      // Read lines with vertices
+      for (std::size_t i = 0; i < 3; ++i)
+      {
+        std::getline(file, line);
+        boost::algorithm::trim(line);
+
+        //cout << "read line: " << line << endl;
+
+        tokenizer tokens(line, sep);
+        tokenizer::iterator tok_iter = tokens.begin();
+
+        if (*tok_iter != "vertex")
+        {
+          dolfin_error("PolyhedronUtils.cpp",
+                       "open .stl file to read 3D surface",
+                       "Expected key word vertex");
+        }
+        ++tok_iter;
+
+        const double x = strToDouble(*tok_iter); ++tok_iter;
+        const double y = strToDouble(*tok_iter); ++tok_iter;
+        const double z = strToDouble(*tok_iter); ++tok_iter;
+
+        boost::tuple<double, double, double> v(x, y, z);
+
+        if (vertex_map.count(v) > 0)
+          v_indices[i] = vertex_map[v];
+        else
+        {
+          vertex_map[v] = num_vertices;
+          v_indices[i] = num_vertices;
+          builder.add_vertex(csg::Exact_Point_3(x, y, z));
+          num_vertices++;
+        }
+      }
+
+      // TODO
+      // if (has_normal)
+      // {
+      //   cout << "Has normal" << endl;
+      // }
+
+      builder.add_facet(v_indices.begin(), v_indices.end());
+
+      // Read 'endloop' line
+      std::getline(file, line);
+      boost::algorithm::trim(line);
+      if (line != "endloop")
+      {
+        dolfin_error("PolyhedronUtils.cpp",
+                     "open .stl file to read 3D surface",
+                     "Expected key word endloop");
+      }
+
+      std::getline(file, line);
+      boost::algorithm::trim(line);
+      if (line != "endfacet")
+      {
+        dolfin_error("PolyhedronUtils.cpp",
+                     "open .stl file to read 3D surface",
+                     "Expected key word endfacet");
+      }
+
+      std::getline(file, line);
+      boost::algorithm::trim(line);
+
+      if (line.substr(0, 5) != "facet")
+        break;
+    }
+
+    // Read the 'endsolid' line
+    tokenizer tokens(line, sep);
+    tokenizer::iterator tok_iter = tokens.begin();
+
+    if (*tok_iter != "endsolid")
+    {
+      dolfin_error("PolyhedronUtils.cpp",
+                   "open .stl file to read 3D surface",
+                   "Expected key word endsolid");
+    }
+    ++tok_iter;
+
+    builder.end_surface();
+
+    // TODO: Check name of solid
+
+    cout << "Done reading surface" << endl;
+  }
+    const std::string _filename;
+};
+//-----------------------------------------------------------------------------
+void PolyhedronUtils::readSurfaceFile(std::string filename,
+                                      csg::Exact_Polyhedron_3& p)
+{
+  boost::filesystem::path fpath(filename);
+  if (fpath.extension() == ".stl")
+  {
+    readSTLFile(filename, p);
+  }
+  else if(fpath.extension() == ".off")
+  {
+    // TODO: Let cgal parse the file
+  }
+  else
+  {
+    dolfin_error("PolyhedronUtils.cpp",
+                 "open file to read 3D surface",
+                 "Unknown file type");
+  }
+}
+//-----------------------------------------------------------------------------
+void PolyhedronUtils::readSTLFile(std::string filename,
+                                  csg::Exact_Polyhedron_3& p)
+{
+  BuildFromSTL<csg::Exact_HalfedgeDS> stl_builder(filename);
+  p.delegate(stl_builder);
+}
+//-----------------------------------------------------------------------------
+CGAL::Bbox_3 PolyhedronUtils::getBoundingBox(csg::Polyhedron_3& polyhedron)
+{
+  csg::Polyhedron_3::Vertex_iterator it = polyhedron.vertices_begin();
+
+  // Initialize bounding box with the first point
+  csg::Polyhedron_3::Point_3 p0 = it->point();
+  CGAL::Bbox_3 b(p0[0], p0[1], p0[2], p0[0], p0[1], p0[2]);
+  ++it;
+
+  for (; it != polyhedron.vertices_end(); ++it)
+  {
+    csg::Polyhedron_3::Point_3 p1 = it->point();
+    b = b + CGAL::Bbox_3(p1[0], p1[1], p1[2], p1[0], p1[1], p1[2]);
+  }
+
+  return b;
+}
+//-----------------------------------------------------------------------------
+double PolyhedronUtils::getBoundingSphereRadius(csg::Polyhedron_3& polyhedron)
+{
+  typedef double FT;
+  typedef CGAL::Cartesian_d<FT> K;
+  typedef CGAL::Min_sphere_of_spheres_d_traits_d<K, FT, 3> MinSphereTraits;
+  typedef CGAL::Min_sphere_of_spheres_d<MinSphereTraits> Min_sphere;
+  typedef MinSphereTraits::Sphere Sphere;
+  typedef K::Point_d Point_d;
+
+  std::vector<Sphere> S;
+  FT coord[3];
+
+  for (csg::Polyhedron_3::Vertex_iterator it=polyhedron.vertices_begin();
+       it != polyhedron.vertices_end(); ++it)
+  {
+    coord[0] = it->point().x();
+    coord[1] = it->point().y();
+    coord[2] = it->point().z();
+    Point_d p(3, coord,coord+3);
+    S.push_back(Sphere(p, 0.0));
+  }
+
+  Min_sphere ms(S.begin(), S.end());
+  CGAL_assertion(ms.is_valid());
+
+  return CGAL::to_double(ms.radius());
+}
+//-----------------------------------------------------------------------------
+template<typename Polyhedron>
+static inline double
+get_edge_length(typename Polyhedron::Halfedge::Halfedge_handle halfedge)
+{
+  return CGAL::to_double((halfedge->vertex()->point() -
+    halfedge->opposite()->vertex()->point()).squared_length());
+}
+//-----------------------------------------------------------------------------
+template <typename Polyhedron>
+static inline double get_triangle_area(typename Polyhedron::Facet_handle facet)
+{
+  const typename Polyhedron::Halfedge_handle edge = facet->halfedge();
+  const typename Polyhedron::Point_3 a = edge->vertex()->point();
+  const typename Polyhedron::Point_3 b = edge->next()->vertex()->point();
+  const typename Polyhedron::Point_3 c
+    = edge->next()->next()->vertex()->point();
+  return CGAL::to_double(CGAL::cross_product(b-a, c-a).squared_length());
+}
+//-----------------------------------------------------------------------------
+template<typename Polyhedron>
+static inline double
+get_min_edge_length(typename Polyhedron::Facet_handle facet)
+{
+  typename Polyhedron::Facet::Halfedge_around_facet_circulator half_edge
+    = facet->facet_begin();
+  double min_length = CGAL::to_double((half_edge->vertex()->point()
+      - half_edge->opposite()->vertex()->point()).squared_length());
+
+  half_edge++;
+  min_length = std::min(min_length, get_edge_length<Polyhedron>(half_edge));
+
+  half_edge++;
+  min_length = std::min(min_length, get_edge_length<Polyhedron>(half_edge));
+
+  return min_length;
+}
+//-----------------------------------------------------------------------------
+template<typename Polyhedron>
+bool facet_is_degenerate(typename Polyhedron::Facet_handle facet,
+                         const double threshold)
+{
+  return get_min_edge_length<Polyhedron>(facet) < threshold
+      || get_triangle_area<Polyhedron>(facet) < threshold;
+}
+//-----------------------------------------------------------------------------
+template<typename Polyhedron>
+static int number_of_degenerate_facets(Polyhedron& p, const double threshold)
+{
+  int count = 0;
+  for (typename Polyhedron::Facet_iterator facet = p.facets_begin();
+       facet != p.facets_end(); facet++)
+  {
+    dolfin_assert(facet->is_triangle());
+    if ( facet_is_degenerate<Polyhedron>(facet, threshold) )
+      count++;
+  }
+  return count;
+}
+//-----------------------------------------------------------------------------
+template <typename Polyhedron>
+static typename Polyhedron::Halfedge_handle
+get_longest_edge(typename Polyhedron::Facet_handle facet)
+{
+  typename Polyhedron::Halfedge_handle edge = facet->halfedge();
+  double length = get_edge_length<Polyhedron>(edge);
+
+  {
+    typename Polyhedron::Halfedge_handle e_tmp = edge->next();
+    if (get_edge_length<Polyhedron>(e_tmp) > length)
+    {
+      length = get_edge_length<Polyhedron>(e_tmp);
+      edge = e_tmp;
+    }
+  }
+
+  {
+    typename Polyhedron::Halfedge_handle e_tmp = edge->next()->next();
+    if ( get_edge_length<Polyhedron>(e_tmp) > length )
+    {
+      length = get_edge_length<Polyhedron>(e_tmp);
+      edge = e_tmp;
+    }
+  }
+
+  return edge;
+}
+//-----------------------------------------------------------------------------
+template <typename Polyhedron>
+double shortest_edge(Polyhedron& p)
+{
+  double shortest = std::numeric_limits<double>::max();
+  for (typename Polyhedron::Halfedge_iterator halfedge = p.halfedges_begin();
+       halfedge != p.halfedges_end(); halfedge++)
+  {
+    const double length = get_edge_length<Polyhedron>(halfedge);
+    shortest = std::min(shortest, length);
+  }
+
+  return shortest;
+}
+//-----------------------------------------------------------------------------
+template <typename Polyhedron>
+static void remove_edge(Polyhedron& p, typename
+                        Polyhedron::Halfedge_handle& edge)
+{
+
+  // // FIXME: Is it possible to do this in a smarter way than a linear scan
+  // for (csg::Polyhedron_3::Facet_iterator facet = p.facets_begin();
+  //      facet != p.facets_end(); facet++)
+  // {
+  //   if ( facet_is_degenerate<csg::Polyhedron_3>(facet, threshold) )
+  //   {
+  //     //print_facet(facet);
+
+  //     // Find a short edge
+  //     csg::Polyhedron_3::Halfedge::Halfedge_handle shortest_edge = facet->facet_begin();
+  //     csg::Polyhedron_3::Facet::Halfedge_around_facet_circulator current_edge = facet->facet_begin();
+  //     double min_length = get_edge_length(current_edge);
+
+  //     for (int i = 0; i < 2; i++)
+  //     {
+  // 	current_edge++;
+  // 	if (get_edge_length(current_edge) < min_length)
+  // 	{
+  // 	  shortest_edge = current_edge;
+  // 	  min_length = get_edge_length(current_edge);
+  // 	}
+  //     }
+
+  // Join small triangles with neighbor facets
+  edge = p.join_facet(edge->next());
+  p.join_facet(edge->opposite()->prev());
+
+  // The joined facets are now quads
+  // Join the two close vertices
+  p.join_vertex(edge);
+}
+//-----------------------------------------------------------------------------
+template <typename Polyhedron>
+static void remove_short_edges(Polyhedron& p, const double threshold)
+{
+  while (true)
+  {
+    bool removed = false;
+    for (typename Polyhedron::Halfedge_iterator halfedge = p.halfedges_begin();
+	 halfedge != p.halfedges_end(); halfedge++)
+    {
+      if (get_edge_length<Polyhedron>(halfedge) < threshold)
+      {
+	remove_edge<Polyhedron>(p, halfedge);
+	removed = true;
+	break;
+      }
+    }
+
+    if (!removed)
+      break;
+  }
+}
+//-----------------------------------------------------------------------------
+template <typename Polyhedron>
+static typename Polyhedron::Point_3
+facet_midpoint(typename Polyhedron::Facet_handle facet)
+{
+  typename Polyhedron::Point_3 p(CGAL::ORIGIN);
+
+  typename Polyhedron::Facet::Halfedge_around_facet_circulator half_edge
+    = facet->facet_begin();
+
+  for (std::size_t i = 0; i < facet->facet_degree(); i++)
+  {
+    p = p + (half_edge->vertex()->point() - CGAL::ORIGIN);
+    half_edge++;
+  }
+
+  p = CGAL::ORIGIN
+    + (p - CGAL::ORIGIN)/static_cast<double>(facet->facet_degree());
+
+  // std::cout << "Center coordinates computed: " << p << std::endl;
+
+  // half_edge = facet->facet_begin();
+  // for (std::size_t i = 0; i < facet->facet_degree(); i++)
+  // {
+  //   std::cout << "Distance to point << " << half_edge->vertex()->point() << " = " << (half_edge->vertex()->point() - p).squared_length() << std::endl;
+  //   half_edge++;
+  // }
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+template <typename Polyhedron>
+static void
+remove_triangle(Polyhedron& p, typename Polyhedron::Facet_handle facet)
+{
+  dolfin_assert(facet->is_triangle());
+
+  // cout << "Removing triangle" << endl;
+  // print_facet<Polyhedron>(facet);
+
+  // Find the longest edge
+  typename Polyhedron::Halfedge_handle edge
+    = get_longest_edge<Polyhedron>(facet);
+
+  // cout << "Longest edge" << endl;
+  // print_halfedge<Polyhedron>(edge);
+
+  // cout << "Opposite triangle" << endl;
+  // print_facet<Polyhedron>(edge->opposite()->facet());
+
+  edge = p.join_facet(edge);
+  // cout << "Edge after join: " << endl;
+  // print_halfedge<Polyhedron>(edge);
+
+  // cout << "Facet after join" << endl;
+  // print_facet<Polyhedron>(edge->facet());
+
+  typename Polyhedron::Point_3 new_center
+    = facet_midpoint<Polyhedron>(edge->facet());
+
+  edge = p.create_center_vertex(edge);
+
+  edge->vertex()->point() = new_center;
+
+  // std::cout << "Center vertex: " << edge->vertex()->point() << std::endl;
+
+  // for (std::size_t i=0; i < 4; i++)
+  // {
+  //   print_facet<Polyhedron>(edge->facet());
+  //   edge = edge->next()->opposite();
+  // }
+}
+//-----------------------------------------------------------------------------
+template<typename Polyhedron>
+static void remove_small_triangles(Polyhedron& p, const double threshold)
+{
+  int n = number_of_degenerate_facets(p, threshold);
+
+  while (n > 0)
+  {
+    for (typename Polyhedron::Facet_iterator facet = p.facets_begin();
+	 facet != p.facets_end(); facet++)
+    {
+      dolfin_assert(facet->is_triangle());
+
+      if (get_triangle_area<Polyhedron>(facet) < threshold)
+      {
+	// cout << "Small triangle detected" << endl;
+	// print_facet<Polyhedron>(facet);
+	remove_triangle<Polyhedron>(p, facet);
+	n = number_of_degenerate_facets<Polyhedron>(p, threshold);
+	break;
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void PolyhedronUtils::remove_degenerate_facets(csg::Exact_Polyhedron_3& p,
+                                               const double threshold)
+{
+  int degenerate_facets = number_of_degenerate_facets(p, threshold);
+
+  cout << "Number of degenerate facets: " << degenerate_facets << endl;
+  // FIXME: Use has_degenerate_facets() when debugging is done
+  if (degenerate_facets > 0)
+  {
+    dolfin_assert(p.is_pure_triangle());
+
+    shortest_edge(p);
+
+    cout << "Removing triangles with short edges" << endl;
+    remove_short_edges(p, threshold);
+
+    cout << "Number of degenerate facets: "
+         << number_of_degenerate_facets(p, threshold) << endl;
+
+    cout << "Removing small triangles" << endl;
+    remove_small_triangles(p, threshold);
+
+    cout << "Number of degenerate facets: "
+         << number_of_degenerate_facets(p, threshold) << endl;
+
+    // Removal of triangles should preserve the triangular structure
+    // of the polyhedron
+    dolfin_assert(p.is_pure_triangle());
+  }
+}
+//-----------------------------------------------------------------------------
+bool PolyhedronUtils::has_degenerate_facets(csg::Exact_Polyhedron_3& p,
+                                            double threshold)
+{
+  for (csg::Exact_Polyhedron_3::Facet_iterator facet = p.facets_begin();
+       facet != p.facets_end(); facet++)
+  {
+    dolfin_assert(facet->is_triangle());
+    if (facet_is_degenerate<csg::Exact_Polyhedron_3>(facet, threshold))
+      return true;
+  }
+  return false;
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/generation/PolyhedronUtils.h b/dolfin/generation/PolyhedronUtils.h
new file mode 100644
index 0000000..202c688
--- /dev/null
+++ b/dolfin/generation/PolyhedronUtils.h
@@ -0,0 +1,67 @@
+// Copyright (C) 2012 Benjamin Kehlet
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-10-31
+// Last changed: 2012-11-14
+
+// Some utilities for working with cgal polyhedrons
+
+
+#ifndef __POLYHEDRON_UTILS_H
+#define __POLYHEDRON_UTILS_H
+
+#ifdef HAS_CGAL
+
+#include "cgal_csg3d.h"
+#include "self_intersect.h"
+
+// This file should be be included in any other header files to avoid
+// CGAL leaking into the DOLFIN code.
+
+namespace dolfin
+{
+
+  class PolyhedronUtils
+  {
+  public:
+    static void readSurfaceFile(std::string filename,
+                                csg::Exact_Polyhedron_3& p);
+    static void readSTLFile(std::string filename, csg::Exact_Polyhedron_3& p);
+    static CGAL::Bbox_3 getBoundingBox(csg::Polyhedron_3& polyhedron);
+    static double getBoundingSphereRadius(csg::Polyhedron_3& polyhedron);
+    static bool has_degenerate_facets(csg::Exact_Polyhedron_3& p,
+                                      double threshold);
+    static void remove_degenerate_facets(csg::Exact_Polyhedron_3& p,
+                                         const double threshold);
+
+    template <typename Polyhedron>
+    bool has_self_intersections(Polyhedron& p)
+    {
+      typedef typename Polyhedron::Triangle_3 Triangle;
+      typedef typename std::back_insert_iterator<std::list<Triangle> > OutputIterator;
+
+      std::list<Triangle> triangles; // intersecting triangles
+      ::self_intersect<Polyhedron::Polyhedron_3, Polyhedron::Kernel,
+          OutputIterator>(p, std::back_inserter(triangles));
+
+      return triangles.size() > 0;
+    }
+  };
+}
+
+#endif
+#endif
diff --git a/dolfin/generation/RectangleMesh.cpp b/dolfin/generation/RectangleMesh.cpp
new file mode 100644
index 0000000..e3844c8
--- /dev/null
+++ b/dolfin/generation/RectangleMesh.cpp
@@ -0,0 +1,228 @@
+// Copyright (C) 2005-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2007.
+// Modified by Nuno Lopes 2008.
+// Modified by Kristian B. Oelgaard 2009.
+//
+// First added:  2005-12-02
+// Last changed: 2014-02-06
+
+#include <boost/assign.hpp>
+
+#include <dolfin/common/constants.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include "RectangleMesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+RectangleMesh::RectangleMesh(double x0, double y0, double x1, double y1,
+                             std::size_t nx, std::size_t ny,
+                             std::string diagonal) : Mesh(MPI_COMM_WORLD)
+{
+  build(x0, y0, x1, y1, nx, ny, diagonal);
+}
+//-----------------------------------------------------------------------------
+RectangleMesh::RectangleMesh(MPI_Comm comm,
+                             double x0, double y0, double x1, double y1,
+                             std::size_t nx, std::size_t ny,
+                             std::string diagonal) : Mesh(comm)
+{
+  build(x0, y0, x1, y1, nx, ny, diagonal);
+}
+//-----------------------------------------------------------------------------
+void RectangleMesh::build(double x0, double y0, double x1, double y1,
+                          std::size_t nx, std::size_t ny,
+                          std::string diagonal)
+{
+  // Receive mesh according to parallel policy
+  if (MPI::is_receiver(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+
+  // Check options
+  if (diagonal != "left" && diagonal != "right" && diagonal != "right/left"
+          && diagonal != "left/right" && diagonal != "crossed")
+  {
+    dolfin_error("RectangleMesh.cpp",
+                 "create rectangle",
+                 "Unknown mesh diagonal definition: allowed options are \"left\", \"right\", \"left/right\", \"right/left\" and \"crossed\"");
+  }
+
+  const double a = x0;
+  const double b = x1;
+  const double c = y0;
+  const double d = y1;
+
+  if (std::abs(x0 - x1) < DOLFIN_EPS || std::abs(y0 - y1) < DOLFIN_EPS)
+  {
+    dolfin_error("Rectangle.cpp",
+                 "create rectangle",
+                 "Rectangle seems to have zero width, height or depth. Consider checking your dimensions");
+  }
+
+  if (nx < 1 || ny < 1)
+  {
+    dolfin_error("RectangleMesh.cpp",
+                 "create rectangle",
+                 "Rectangle has non-positive number of vertices in some dimension: number of vertices must be at least 1 in each dimension");
+  }
+
+  rename("mesh", "Mesh of the unit square (a,b) x (c,d)");
+  // Open mesh for editing
+  MeshEditor editor;
+  editor.open(*this, CellType::triangle, 2, 2);
+
+  // Create vertices and cells:
+  if (diagonal == "crossed")
+  {
+    editor.init_vertices_global((nx + 1)*(ny + 1) + nx*ny, (nx + 1)*(ny + 1) + nx*ny);
+    editor.init_cells_global(4*nx*ny, 4*nx*ny);
+  }
+  else
+  {
+    editor.init_vertices_global((nx + 1)*(ny + 1), (nx + 1)*(ny + 1));
+    editor.init_cells_global(2*nx*ny, 2*nx*ny);
+  }
+
+  // Storage for vertices
+  std::vector<double> x(2);
+
+  // Create main vertices:
+  std::size_t vertex = 0;
+  for (std::size_t iy = 0; iy <= ny; iy++)
+  {
+    x[1] = c + ((static_cast<double>(iy))*(d - c)/static_cast<double>(ny));
+    for (std::size_t ix = 0; ix <= nx; ix++)
+    {
+      x[0] = a + ((static_cast<double>(ix))*(b - a)/static_cast<double>(nx));
+      editor.add_vertex(vertex, x);
+      vertex++;
+    }
+  }
+
+  // Create midpoint vertices if the mesh type is crossed
+  if (diagonal == "crossed")
+  {
+    for (std::size_t iy = 0; iy < ny; iy++)
+    {
+      x[1] = c +(static_cast<double>(iy) + 0.5)*(d - c)/ static_cast<double>(ny);
+      for (std::size_t ix = 0; ix < nx; ix++)
+      {
+        x[0] = a + (static_cast<double>(ix) + 0.5)*(b - a)/ static_cast<double>(nx);
+        editor.add_vertex(vertex, x);
+        vertex++;
+      }
+    }
+  }
+
+  // Create triangles
+  std::size_t cell = 0;
+  if (diagonal == "crossed")
+  {
+    std::vector<std::vector<std::size_t> >
+      cells(4, std::vector<std::size_t>(3));
+    for (std::size_t iy = 0; iy < ny; iy++)
+    {
+      for (std::size_t ix = 0; ix < nx; ix++)
+      {
+        const std::size_t v0 = iy*(nx + 1) + ix;
+        const std::size_t v1 = v0 + 1;
+        const std::size_t v2 = v0 + (nx + 1);
+        const std::size_t v3 = v1 + (nx + 1);
+        const std::size_t vmid = (nx + 1)*(ny + 1) + iy*nx + ix;
+
+        // Note that v0 < v1 < v2 < v3 < vmid.
+        cells[0][0] = v0; cells[0][1] = v1; cells[0][2] = vmid;
+        cells[1][0] = v0; cells[1][1] = v2; cells[1][2] = vmid;
+        cells[2][0] = v1; cells[2][1] = v3; cells[2][2] = vmid;
+        cells[3][0] = v2; cells[3][1] = v3; cells[3][2] = vmid;
+
+        // Add cells
+        std::vector<std::vector<std::size_t> >::const_iterator _cell;
+        for (_cell = cells.begin(); _cell != cells.end(); ++_cell)
+          editor.add_cell(cell++, *_cell);
+      }
+    }
+  }
+  else if (diagonal == "left" || diagonal == "right" || diagonal == "right/left" || diagonal == "left/right")
+  {
+    std::string local_diagonal = diagonal;
+    std::vector<std::vector<std::size_t> >
+      cells(2, std::vector<std::size_t>(3));
+    for (std::size_t iy = 0; iy < ny; iy++)
+    {
+      // Set up alternating diagonal
+      if (diagonal == "right/left")
+      {
+        if (iy % 2)
+          local_diagonal = "right";
+        else
+          local_diagonal = "left";
+      }
+      if (diagonal == "left/right")
+      {
+        if (iy % 2)
+          local_diagonal = "left";
+        else
+          local_diagonal = "right";
+      }
+
+      for (std::size_t ix = 0; ix < nx; ix++)
+      {
+        const std::size_t v0 = iy*(nx + 1) + ix;
+        const std::size_t v1 = v0 + 1;
+        const std::size_t v2 = v0 + (nx + 1);
+        const std::size_t v3 = v1 + (nx + 1);
+        std::vector<std::size_t> cell_data;
+
+        if(local_diagonal == "left")
+        {
+          cells[0][0] = v0; cells[0][1] = v1; cells[0][2] = v2;
+          cells[1][0] = v1; cells[1][1] = v2; cells[1][2] = v3;
+          if (diagonal == "right/left" || diagonal == "left/right")
+            local_diagonal = "right";
+        }
+        else
+        {
+          cells[0][0] = v0; cells[0][1] = v1; cells[0][2] = v3;
+          cells[1][0] = v0; cells[1][1] = v2; cells[1][2] = v3;
+          if (diagonal == "right/left" || diagonal == "left/right")
+            local_diagonal = "left";
+        }
+        editor.add_cell(cell++, cells[0]);
+        editor.add_cell(cell++, cells[1]);
+      }
+    }
+  }
+
+  // Close mesh editor
+  editor.close();
+
+  // Broadcast mesh according to parallel policy
+  if (MPI::is_broadcaster(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/RectangleMesh.h b/dolfin/generation/RectangleMesh.h
new file mode 100644
index 0000000..2f2fd98
--- /dev/null
+++ b/dolfin/generation/RectangleMesh.h
@@ -0,0 +1,109 @@
+// Copyright (C) 2005-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Mikael Mortensen, 2014
+//
+// First added:  2005-12-02
+// Last changed: 2014-02-17
+
+#ifndef __RECTANGLE_MESH_H
+#define __RECTANGLE_MESH_H
+
+#include <string>
+#include <dolfin/common/MPI.h>
+#include <dolfin/mesh/Mesh.h>
+
+namespace dolfin
+{
+
+  /// Triangular mesh of the 2D rectangle (x0, y0) x (x1, y1).
+  /// Given the number of cells (nx, ny) in each direction,
+  /// the total number of triangles will be 2*nx*ny and the
+  /// total number of vertices will be (nx + 1)*(ny + 1).
+
+  class RectangleMesh : public Mesh
+  {
+  public:
+
+    /// *Arguments*
+    ///     x0 (double)
+    ///         :math:`x`-min.
+    ///     y0 (double)
+    ///         :math:`y`-min.
+    ///     x1 (double)
+    ///         :math:`x`-max.
+    ///     y1 (double)
+    ///         :math:`y`-max.
+    ///     xn (double)
+    ///         Number of cells in :math:`x`-direction.
+    ///     yn (double)
+    ///         Number of cells in :math:`y`-direction.
+    ///     diagonal (string)
+    ///         Direction of diagonals: "left", "right", "left/right", "crossed"
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Mesh with 6 cells in each direction on the
+    ///         // set [-1,2] x [-1,2]
+    ///         RectangleMesh mesh(-1, -1, 2, 2, 6, 6);
+    ///
+    RectangleMesh(double x0, double y0, double x1, double y1,
+                  std::size_t nx, std::size_t ny,
+                  std::string diagonal="right");
+
+    /// *Arguments*
+    ///     comm (MPI_Comm)
+    ///         MPI communicator
+    ///     x0 (double)
+    ///         :math:`x`-min.
+    ///     y0 (double)
+    ///         :math:`y`-min.
+    ///     x1 (double)
+    ///         :math:`x`-max.
+    ///     y1 (double)
+    ///         :math:`y`-max.
+    ///     xn (double)
+    ///         Number of cells in :math:`x`-direction.
+    ///     yn (double)
+    ///         Number of cells in :math:`y`-direction.
+    ///     diagonal (string)
+    ///         Direction of diagonals: "left", "right", "left/right", "crossed"
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Mesh with 6 cells in each direction on the
+    ///         // set [-1,2] x [-1,2]
+    ///         RectangleMesh mesh(MPI_COMM_WORLD, -1, -1, 2, 2, 6, 6);
+    ///
+    RectangleMesh(MPI_Comm comm, double x0, double y0, double x1, double y1,
+                  std::size_t nx, std::size_t ny,
+                  std::string diagonal="right");
+
+  private:
+
+    // Build mesh
+    void build(double x0, double y0, double x1, double y1,
+               std::size_t nx, std::size_t ny,
+               std::string diagonal="right");
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/Triangulate.cpp b/dolfin/generation/Triangulate.cpp
new file mode 100644
index 0000000..7b886b1
--- /dev/null
+++ b/dolfin/generation/Triangulate.cpp
@@ -0,0 +1,118 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-02
+// Last changed: 2012-02-09
+
+#ifdef HAS_CGAL
+
+#include <vector>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Triangulation_2.h>
+#include <CGAL/Delaunay_triangulation_2.h>
+#include <CGAL/Triangulation_vertex_base_with_info_2.h>
+#include <CGAL/Triangulation_3.h>
+#include <CGAL/Delaunay_triangulation_3.h>
+#include <CGAL/Triangulation_vertex_base_with_info_3.h>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include "CGALMeshBuilder.h"
+#include "Triangulate.h"
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+
+// 2D triangulation typedefs
+typedef CGAL::Triangulation_vertex_base_2<K> Tvb2base;
+typedef CGAL::Triangulation_vertex_base_with_info_2<std::size_t, K, Tvb2base> Tvb2;
+typedef CGAL::Triangulation_face_base_2<K> Tfb2;
+typedef CGAL::Triangulation_data_structure_2<Tvb2, Tfb2> Tds2;
+typedef CGAL::Delaunay_triangulation_2<K, Tds2> Triangulation2;
+
+// 3D triangulation typedefs
+typedef CGAL::Triangulation_vertex_base_3<K> Tvb3base;
+typedef CGAL::Triangulation_vertex_base_with_info_3<std::size_t, K, Tvb3base> Tvb3;
+typedef CGAL::Triangulation_cell_base_3<K> Tfb3;
+typedef CGAL::Triangulation_data_structure_3<Tvb3, Tfb3> Tds3;
+typedef CGAL::Delaunay_triangulation_3<K, Tds3> Triangulation3;
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void Triangulate::triangulate(Mesh& mesh, const std::vector<Point>& vertices,
+                              std::size_t gdim)
+{
+  // Check that we are not running in parallel
+  if (MPI::size(mesh.mpi_comm()) > 1)
+  {
+    dolfin_error("Triangulate.cpp",
+                 "triangulate points using CGAL",
+                 "Cannot create triangulated meshes in parallel");
+  }
+
+  // Check that we have enough points (vertices) to create a triangulation
+  dolfin_assert(vertices.size() > gdim);
+
+  // Triangulate points and build mesh
+  if (gdim == 2)
+    triangulate2D(mesh, vertices);
+  else if (gdim == 3)
+    triangulate3D(mesh, vertices);
+  else
+  {
+    dolfin_error("Triangulate.cpp",
+                 "triangulate points using CGAL",
+                 "No suitable triangulate function for geometric dim %d", gdim);
+  }
+}
+//-----------------------------------------------------------------------------
+void Triangulate::triangulate2D(Mesh& mesh, const std::vector<Point>& vertices)
+{
+  // Create vector of CGAL points
+  std::vector<K::Point_2> cgal_points;
+  std::vector<Point>::const_iterator p;
+  for (p = vertices.begin(); p != vertices.end(); ++p)
+    cgal_points.push_back(K::Point_2(p->x(), p->y()));
+
+  // Create CGAL triangulation
+  Triangulation2 t;
+  t.insert(cgal_points.begin(), cgal_points.end());
+
+  // Build DOLFIN mesh from triangulation
+  CGALMeshBuilder::build(mesh, t);
+}
+//-----------------------------------------------------------------------------
+void Triangulate::triangulate3D(Mesh& mesh, const std::vector<Point>& vertices)
+{
+  // Create vector of CGAL points
+  std::vector<K::Point_3> cgal_points;
+  std::vector<Point>::const_iterator p;
+  for (p = vertices.begin(); p != vertices.end(); ++p)
+    cgal_points.push_back(K::Point_3(p->x(), p->y(), p->z()));
+
+  // Create CGAL triangulation
+  Triangulation3 t;
+  t.insert(cgal_points.begin(), cgal_points.end());
+
+  // Build DOLFIN mesh from triangulation
+  CGALMeshBuilder::build(mesh, t);
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/generation/Triangulate.h b/dolfin/generation/Triangulate.h
new file mode 100644
index 0000000..b22398f
--- /dev/null
+++ b/dolfin/generation/Triangulate.h
@@ -0,0 +1,57 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-02
+// Last changed:
+
+#ifndef __DOLFIN_TRIANGULATEGENERATOR_H
+#define __DOLFIN_TRIANGULATEGENERATOR_H
+
+#ifdef HAS_CGAL
+
+#include <vector>
+
+namespace dolfin
+{
+
+  class Mesh;
+  class Point;
+
+  /// Create mesh from a triangulation of points
+
+  class Triangulate
+  {
+  public:
+
+    /// Create mesh from a triangulation of points
+    static void triangulate(Mesh& mesh, const std::vector<Point>& vertices,
+                            std::size_t gdim);
+
+  private:
+
+    // Create 2D mesh from a triangulation of points
+    static void triangulate2D(Mesh& mesh, const std::vector<Point>& vertices);
+
+    // Create 3D mesh from a triangulation of points
+    static void triangulate3D(Mesh& mesh, const std::vector<Point>& vertices);
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/generation/UnitCubeMesh.h b/dolfin/generation/UnitCubeMesh.h
new file mode 100644
index 0000000..f39b48e
--- /dev/null
+++ b/dolfin/generation/UnitCubeMesh.h
@@ -0,0 +1,87 @@
+// Copyright (C) 2005-2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet 2012
+// Modified by Mikael Mortensen, 2014
+//
+// First added:  2005-12-02
+// Last changed: 2014-02-17
+
+#ifndef __UNIT_CUBE_MESH_H
+#define __UNIT_CUBE_MESH_H
+
+#include <cstddef>
+#include <dolfin/common/MPI.h>
+#include "BoxMesh.h"
+
+namespace dolfin
+{
+
+  /// Tetrahedral mesh of the 3D unit cube [0,1] x [0,1] x [0,1].
+  /// Given the number of cells (nx, ny, nz) in each direction,
+  /// the total number of tetrahedra will be 6*nx*ny*nz and the
+  /// total number of vertices will be (nx + 1)*(ny + 1)*(nz + 1).
+
+  class UnitCubeMesh : public BoxMesh
+  {
+  public:
+
+    /// Create a uniform finite element _Mesh_ over the unit cube
+    /// [0,1] x [0,1] x [0,1].
+    ///
+    /// *Arguments*
+    ///     nx (std::size_t)
+    ///         Number of cells in :math:`x` direction.
+    ///     ny (std::size_t)
+    ///         Number of cells in :math:`y` direction.
+    ///     nz (std::size_t)
+    ///         Number of cells in :math:`z` direction.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitCubeMesh mesh(32, 32, 32);
+    ///
+    UnitCubeMesh(std::size_t nx, std::size_t ny, std::size_t nz)
+        : BoxMesh(0.0, 0.0, 0.0, 1.0, 1.0, 1.0, nx, ny, nz) {}
+
+    /// Create a uniform finite element _Mesh_ over the unit cube
+    /// [0,1] x [0,1] x [0,1].
+    ///
+    /// *Arguments*
+    ///     comm (MPI_Comm)
+    ///         MPI communicator
+    ///     nx (std::size_t)
+    ///         Number of cells in :math:`x` direction.
+    ///     ny (std::size_t)
+    ///         Number of cells in :math:`y` direction.
+    ///     nz (std::size_t)
+    ///         Number of cells in :math:`z` direction.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitCubeMesh mesh(MPI_COMM_WORLD, 32, 32, 32);
+    ///
+    UnitCubeMesh(MPI_Comm comm, std::size_t nx, std::size_t ny, std::size_t nz)
+      : BoxMesh(comm, 0.0, 0.0, 0.0, 1.0, 1.0, 1.0, nx, ny, nz) {}
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/UnitIntervalMesh.h b/dolfin/generation/UnitIntervalMesh.h
new file mode 100644
index 0000000..81e9af5
--- /dev/null
+++ b/dolfin/generation/UnitIntervalMesh.h
@@ -0,0 +1,78 @@
+// Copyright (C) 2007 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010.
+// Modified by Benjamin Kehlet 2012
+// Modified by Mikael Mortensen, 2014
+//
+// First added:  2007-11-23
+// Last changed: 2014-02-17
+
+#ifndef __UNIT_INTERVAL_MESH_H
+#define __UNIT_INTERVAL_MESH_H
+
+#include <cstddef>
+#include <dolfin/common/MPI.h>
+#include "IntervalMesh.h"
+
+namespace dolfin
+{
+
+  /// A mesh of the unit interval (0, 1) with a given number of cells
+  /// (nx) in the axial direction. The total number of intervals will
+  /// be nx and the total number of vertices will be (nx + 1).
+
+  class UnitIntervalMesh : public IntervalMesh
+  {
+  public:
+
+    /// Constructor
+    ///
+    /// *Arguments*
+    ///     nx (std::size_t)
+    ///         The number of cells.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Create a mesh of 25 cells in the interval [0,1]
+    ///         UnitIntervalMesh mesh(25);
+    ///
+    UnitIntervalMesh(std::size_t nx) : IntervalMesh(nx, 0.0, 1.0) {}
+
+    /// Constructor
+    ///
+    /// *Arguments*
+    ///     comm (MPI_Comm)
+    ///         MPI communicator
+    ///     nx (std::size_t)
+    ///         The number of cells.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         // Create a mesh of 25 cells in the interval [0,1]
+    ///         UnitIntervalMesh mesh(MPI_COMM_WORLD, 25);
+    ///
+    UnitIntervalMesh(MPI_Comm comm, std::size_t nx)
+      : IntervalMesh(comm, nx, 0.0, 1.0) {}
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/UnitSquareMesh.h b/dolfin/generation/UnitSquareMesh.h
new file mode 100644
index 0000000..33eba96
--- /dev/null
+++ b/dolfin/generation/UnitSquareMesh.h
@@ -0,0 +1,93 @@
+// Copyright (C) 2005-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Mikael Mortensen, 2014
+//
+// First added:  2005-12-02
+// Last changed: 2014-02-17
+
+#ifndef __UNIT_SQUARE_MESH_H
+#define __UNIT_SQUARE_MESH_H
+
+#include <string>
+#include "RectangleMesh.h"
+
+namespace dolfin
+{
+
+  /// Triangular mesh of the 2D unit square [0,1] x [0,1].
+  /// Given the number of cells (nx, ny) in each direction,
+  /// the total number of triangles will be 2*nx*ny and the
+  /// total number of vertices will be (nx + 1)*(ny + 1).
+  ///
+  /// std::string diagonal ("left", "right", "right/left", "left/right",
+  /// or "crossed") indicates the direction of the diagonals.
+
+  class UnitSquareMesh : public RectangleMesh
+  {
+  public:
+
+    /// Create a uniform finite element _Mesh_ over the unit square
+    /// [0,1] x [0,1].
+    ///
+    /// *Arguments*
+    ///     nx (std::size_t)
+    ///         Number of cells in horizontal direction.
+    ///     ny (std::size_t)
+    ///         Number of cells in vertical direction.
+    ///     diagonal (std::string)
+    ///         Optional argument: A std::string indicating
+    ///         the direction of the diagonals.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitSquareMesh mesh1(32, 32);
+    ///         UnitSquareMesh mesh2(32, 32, "crossed");
+    ///
+    UnitSquareMesh(std::size_t nx, std::size_t ny, std::string diagonal="right")
+      : RectangleMesh(0.0, 0.0, 1.0, 1.0, nx, ny, diagonal) {}
+
+    /// Create a uniform finite element _Mesh_ over the unit square
+    /// [0,1] x [0,1].
+    ///
+    /// *Arguments*
+    ///     comm (MPI_Comm)
+    ///         MPI communicator
+    ///     nx (std::size_t)
+    ///         Number of cells in horizontal direction.
+    ///     ny (std::size_t)
+    ///         Number of cells in vertical direction.
+    ///     diagonal (std::string)
+    ///         Optional argument: A std::string indicating
+    ///         the direction of the diagonals.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitSquareMesh mesh1(MPI_COMM_WORLD, 32, 32);
+    ///         UnitSquareMesh mesh2(MPI_COMM_WORLD, 32, 32, "crossed");
+    ///
+    UnitSquareMesh(MPI_Comm comm, std::size_t nx, std::size_t ny,
+                   std::string diagonal="right")
+      : RectangleMesh(comm, 0.0, 0.0, 1.0, 1.0, nx, ny, diagonal) {}
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/UnitTetrahedronMesh.cpp b/dolfin/generation/UnitTetrahedronMesh.cpp
new file mode 100644
index 0000000..ab3e958
--- /dev/null
+++ b/dolfin/generation/UnitTetrahedronMesh.cpp
@@ -0,0 +1,73 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-10-19
+// Last changed: 2014-02-06
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include "UnitTetrahedronMesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+UnitTetrahedronMesh::UnitTetrahedronMesh() : Mesh()
+{
+  // Receive mesh according to parallel policy
+  if (MPI::is_receiver(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+
+  // Open mesh for editing
+  MeshEditor editor;
+  editor.open(*this, CellType::tetrahedron, 3, 3);
+
+  // Create vertices
+  editor.init_vertices_global(4, 4);
+  std::vector<double> x(3);
+  x[0] = 0.0; x[1] = 0.0; x[2] = 0.0;
+  editor.add_vertex(0, x);
+
+  x[0] = 1.0; x[1] = 0.0; x[2] = 0.0;
+  editor.add_vertex(1, x);
+
+  x[0] = 0.0; x[1] = 1.0; x[2] = 0.0;
+  editor.add_vertex(2, x);
+
+  x[0] = 0.0; x[1] = 0.0; x[2] = 1.0;
+  editor.add_vertex(3, x);
+
+  // Create cells
+  editor.init_cells_global(1, 1);
+  std::vector<std::size_t> cell_data(4);
+  cell_data[0] = 0; cell_data[1] = 1; cell_data[2] = 2; cell_data[3] = 3;
+  editor.add_cell(0, cell_data);
+
+  // Close mesh editor
+  editor.close();
+
+  // Broadcast mesh according to parallel policy
+  if (MPI::is_broadcaster(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/UnitTetrahedronMesh.h b/dolfin/generation/UnitTetrahedronMesh.h
new file mode 100644
index 0000000..eff4fc5
--- /dev/null
+++ b/dolfin/generation/UnitTetrahedronMesh.h
@@ -0,0 +1,51 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet 2012
+//
+// First added:  2010-10-19
+// Last changed: 2012-11-09
+
+#ifndef __UNIT_TETRAHEDRON_MESH_H
+#define __UNIT_TETRAHEDRON_MESH_H
+
+#include <dolfin/mesh/Mesh.h>
+
+namespace dolfin
+{
+
+  /// A mesh consisting of a single tetrahedron with vertices at
+  ///
+  ///   (0, 0, 0)
+  ///   (1, 0, 0)
+  ///   (0, 1, 0)
+  ///   (0, 0, 1)
+  ///
+  /// This class is useful for testing.
+
+  class UnitTetrahedronMesh : public Mesh
+  {
+  public:
+
+    /// Create mesh of unit tetrahedron
+    UnitTetrahedronMesh();
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/UnitTriangleMesh.cpp b/dolfin/generation/UnitTriangleMesh.cpp
new file mode 100644
index 0000000..e30420a
--- /dev/null
+++ b/dolfin/generation/UnitTriangleMesh.cpp
@@ -0,0 +1,69 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-10-19
+// Last changed: 2014-02-06
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/mesh/CellType.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include "UnitTriangleMesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+UnitTriangleMesh::UnitTriangleMesh() : Mesh()
+{
+  // Receive mesh according to parallel policy
+  if (MPI::is_receiver(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+
+  // Open mesh for editing
+  MeshEditor editor;
+  editor.open(*this, CellType::triangle, 2, 2);
+
+  // Create vertices
+  editor.init_vertices_global(3, 3);
+  std::vector<double> x(2);
+  x[0] = 0.0; x[1] = 0.0;
+  editor.add_vertex(0, x);
+  x[0] = 1.0; x[1] = 0.0;
+  editor.add_vertex(1, x);
+  x[0] = 0.0; x[1] = 1.0;
+  editor.add_vertex(2, x);
+
+  // Create cells
+  editor.init_cells_global(1, 1);
+  std::vector<std::size_t> cell_data(3);
+  cell_data[0] = 0; cell_data[1] = 1; cell_data[2] = 2;
+  editor.add_cell(0, cell_data);
+
+  // Close mesh editor
+  editor.close();
+
+  // Broadcast mesh according to parallel policy
+  if (MPI::is_broadcaster(this->mpi_comm()))
+  {
+    MeshPartitioning::build_distributed_mesh(*this);
+    return;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/generation/UnitTriangleMesh.h b/dolfin/generation/UnitTriangleMesh.h
new file mode 100644
index 0000000..2f986f7
--- /dev/null
+++ b/dolfin/generation/UnitTriangleMesh.h
@@ -0,0 +1,50 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet 2012
+//
+// First added:  2010-10-19
+// Last changed: 2012-11-09
+
+#ifndef __UNIT_TRIANGLE_MESH_H
+#define __UNIT_TRIANGLE_MESH_H
+
+#include <dolfin/mesh/Mesh.h>
+
+namespace dolfin
+{
+
+  /// A mesh consisting of a single triangle with vertices at
+  ///
+  ///   (0, 0)
+  ///   (1, 0)
+  ///   (0, 1)
+  ///
+  /// This class is useful for testing.
+
+  class UnitTriangleMesh : public Mesh
+  {
+  public:
+
+    /// Create mesh of unit triangle
+    UnitTriangleMesh();
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/generation/cgal_csg3d.h b/dolfin/generation/cgal_csg3d.h
new file mode 100644
index 0000000..55f0381
--- /dev/null
+++ b/dolfin/generation/cgal_csg3d.h
@@ -0,0 +1,59 @@
+#ifdef HAS_CGAL
+
+#define CGAL_NO_DEPRECATED_CODE
+#define CGAL_MESH_3_VERBOSE
+//#define PROTECTION_DEBUG
+
+#define CGAL_MESH_3_NO_DEPRECATED_SURFACE_INDEX
+#define CGAL_MESH_3_NO_DEPRECATED_C3T3_ITERATORS
+
+#include <CGAL/basic.h>
+
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Nef_polyhedron_3.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+#include <CGAL/Mesh_triangulation_3.h>
+#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
+#include <CGAL/Triangulation_vertex_base_with_info_3.h>
+#include <CGAL/Triangulation_cell_base_with_info_3.h>
+
+#include <CGAL/IO/Polyhedron_iostream.h>
+#include <CGAL/Bbox_3.h>
+
+#include <CGAL/Mesh_criteria_3.h>
+#include <CGAL/Polyhedral_mesh_domain_with_features_3.h>
+#include <CGAL/make_mesh_3.h>
+
+namespace dolfin
+{
+  namespace csg
+  {
+
+    // Exact polyhedron
+    typedef CGAL::Exact_predicates_exact_constructions_kernel Exact_Kernel;
+    typedef Exact_Kernel::Triangle_3 Exact_Triangle_3;
+    typedef CGAL::Nef_polyhedron_3<Exact_Kernel> Nef_polyhedron_3;
+    typedef CGAL::Polyhedron_3<Exact_Kernel> Exact_Polyhedron_3;
+    typedef Exact_Polyhedron_3::HalfedgeDS Exact_HalfedgeDS;
+    typedef Nef_polyhedron_3::Point_3 Exact_Point_3;
+
+    // Domain
+    typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+    typedef CGAL::Mesh_polyhedron_3<K>::type Polyhedron_3;
+    typedef K::Point_3 Point_3;
+    typedef K::Vector_3 Vector_3;
+    typedef K::Triangle_3 Triangle_3;
+    typedef CGAL::Polyhedral_mesh_domain_with_features_3<K> Mesh_domain;
+
+    // Triangulation
+    typedef CGAL::Mesh_triangulation_3<Mesh_domain>::type Tr;
+    typedef CGAL::Mesh_complex_3_in_triangulation_3<
+      Tr,Mesh_domain::Corner_index,Mesh_domain::Curve_segment_index> C3t3;
+
+    // Criteria
+    typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
+  }
+}
+#endif
diff --git a/dolfin/generation/cgal_triangulate_polyhedron.h b/dolfin/generation/cgal_triangulate_polyhedron.h
new file mode 100644
index 0000000..2185a4e
--- /dev/null
+++ b/dolfin/generation/cgal_triangulate_polyhedron.h
@@ -0,0 +1,218 @@
+// Copyright (c) 2010-2011  GeometryFactory Sarl (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+// 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.
+//
+// Licensees holding a valid commercial license may use this file in
+// accordance with the commercial license agreement provided with the software.
+//
+// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+//
+// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Polyhedron/demo/Polyhedron/include/CGAL/triangulate_polyhedron.h $
+// $Id: triangulate_polyhedron.h 67117 2012-01-13 18:14:48Z lrineau $
+//
+//
+// Author(s)     : Laurent Rineau
+
+#ifndef CGAL_TRIANGULATE_POLYHEDRON_H
+
+#include <CGAL/Modifier_base.h>
+#include <CGAL/HalfedgeDS_decorator.h>
+
+#include <CGAL/Triangulation_vertex_base_with_info_2.h>
+#include <CGAL/Triangulation_face_base_with_info_2.h>
+#include <CGAL/Constrained_Delaunay_triangulation_2.h>
+#include <CGAL/Constrained_triangulation_plus_2.h>
+#include <CGAL/Triangulation_2_filtered_projection_traits_3.h>
+
+// TODO: submit this file to CGAL too
+#include "compute_normal.h"
+
+#include <queue>
+#include <vector>
+#include <utility>
+
+namespace CGAL {
+
+template <class Polyhedron>
+class Triangulate_modifier
+  : public CGAL::Modifier_base<typename Polyhedron::HalfedgeDS>
+{
+  typedef typename Polyhedron::HalfedgeDS HDS;
+  typedef typename Polyhedron::Traits Traits;
+
+  typedef typename Polyhedron::Halfedge_handle Halfedge_handle;
+  typedef typename Polyhedron::Facet Facet;
+  typedef typename Polyhedron::Facet_iterator Facet_iterator;
+  typedef typename Polyhedron::Facet_handle Facet_handle;
+
+  typedef CGAL::Triangulation_2_filtered_projection_traits_3<Traits> P_traits;
+
+  typedef CGAL::Triangulation_vertex_base_with_info_2<Halfedge_handle,
+                                                      P_traits> Vb;
+
+  struct Face_info
+  {
+    typename Polyhedron::Halfedge_handle e[3];
+    bool is_external;
+  };
+
+  typedef CGAL::Triangulation_face_base_with_info_2<Face_info,
+                                                    P_traits>          Fb1;
+
+  typedef CGAL::Constrained_triangulation_face_base_2<P_traits, Fb1>   Fb;
+  typedef CGAL::Triangulation_data_structure_2<Vb,Fb>                  TDS;
+  typedef CGAL::No_intersection_tag                                    Itag;
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits,
+                                                     TDS,
+                                                     Itag>             CDTbase;
+  typedef CGAL::Constrained_triangulation_plus_2<CDTbase>              CDT;
+
+public:
+  Triangulate_modifier() {}
+
+  bool is_external(typename CDT::Face_handle fh) const
+  { return fh->info().is_external; }
+
+  void operator()(HDS& hds)
+  {
+    CGAL::HalfedgeDS_decorator<HDS> decorator(hds);
+    typedef typename HDS::Halfedge Halfedge;
+
+    // One need to store facet handles into a vector, because the list of
+    // facets of the polyhedron will be modified during the loop, and
+    // that invalidates the range [facets_begin(), facets_end()[.
+    std::vector<Facet_handle> facets;
+    facets.reserve(hds.size_of_faces());
+    for(Facet_iterator fit = hds.faces_begin(),
+          end = hds.faces_end(); fit != end; ++fit)
+    {
+      facets.push_back(fit);
+    }
+
+    // Iterates on the vector of facet handles
+    for (typename std::vector<Facet_handle>::iterator fit_it = facets.begin(),
+          end0 = facets.end(); fit_it != end0; ++fit_it)
+    {
+      Facet_handle fit0 = *fit_it;
+      typename Traits::Vector_3 normal
+        = compute_facet_normal<Facet, Traits>(*fit0);
+
+      P_traits cdt_traits(normal);
+      CDT cdt(cdt_traits);
+
+      typename Facet::Halfedge_around_facet_circulator
+        he_circ = fit0->facet_begin(),
+        he_circ_end(he_circ);
+      typename CDT::Vertex_handle previous, first;
+      do
+      {
+        typename CDT::Vertex_handle vh = cdt.insert(he_circ->vertex()->point());
+        if (first == 0)
+          first = vh;
+        vh->info() = he_circ;
+        if(previous != 0 && previous != vh)
+          cdt.insert_constraint(previous, vh);
+        previous = vh;
+      } while (++he_circ != he_circ_end);
+      cdt.insert_constraint(previous, first);
+
+      // sets mark is_external
+      for(typename CDT::All_faces_iterator
+            fit = cdt.all_faces_begin(),
+            end = cdt.all_faces_end();
+          fit != end; ++fit)
+      {
+        fit->info().is_external = false;
+      }
+      std::queue<typename CDT::Face_handle> face_queue;
+      face_queue.push(cdt.infinite_vertex()->face());
+      while (!face_queue.empty())
+      {
+        typename CDT::Face_handle fh = face_queue.front();
+        face_queue.pop();
+        if(fh->info().is_external)
+          continue;
+        fh->info().is_external = true;
+        for (int i = 0; i < 3; ++i)
+        {
+          if (!cdt.is_constrained(std::make_pair(fh, i)))
+            face_queue.push(fh->neighbor(i));
+        }
+      }
+
+      // then modify the polyhedron
+      decorator.make_hole(fit0->halfedge());
+      for(typename CDT::Finite_edges_iterator
+            eit = cdt.finite_edges_begin(),
+            end = cdt.finite_edges_end();
+          eit != end; ++eit)
+      {
+        typename CDT::Face_handle fh = eit->first;
+        const int index = eit->second;
+        typename CDT::Face_handle opposite_fh = fh->neighbor(eit->second);
+        const int opposite_index = opposite_fh->index(fh);
+        const typename CDT::Vertex_handle va = fh->vertex(cdt. cw(index));
+        const typename CDT::Vertex_handle vb = fh->vertex(cdt.ccw(index));
+
+        if (!(is_external(fh) && is_external(opposite_fh)) &&
+            ! cdt.is_constrained(*eit) )
+        {
+          // strictly internal edge
+          Halfedge_handle h = hds.edges_push_back(Halfedge(),
+                                                  Halfedge());
+          fh->info().e[index] = h;
+          opposite_fh->info().e[opposite_index] = h->opposite();
+
+          decorator.set_vertex(h, va->info()->vertex());
+          decorator.set_vertex(h->opposite(), vb->info()->vertex());
+        }
+        if( cdt.is_constrained(*eit) )
+        {
+          if(!is_external(fh))
+            fh->info().e[index] = va->info();
+          if(!is_external(opposite_fh))
+            opposite_fh->info().e[opposite_index] = vb->info();
+        }
+      }
+      for (typename CDT::Finite_faces_iterator fit = cdt.finite_faces_begin(),
+            end = cdt.finite_faces_end(); fit != end; ++fit)
+      {
+        if (!is_external(fit))
+        {
+          Halfedge_handle h0 = fit->info().e[0];
+          Halfedge_handle h1 = fit->info().e[1];
+          Halfedge_handle h2 = fit->info().e[2];
+          CGAL_assertion(h0 != Halfedge_handle());
+          CGAL_assertion(h1 != Halfedge_handle());
+          CGAL_assertion(h2 != Halfedge_handle());
+
+          typedef typename Halfedge::Base HBase;
+          h0->HBase::set_next(h1);
+          decorator.set_prev(h1, h0);
+          h1->HBase::set_next(h2);
+          decorator.set_prev(h2, h1);
+          h2->HBase::set_next(h0);
+          decorator.set_prev(h0, h2);
+
+          decorator.fill_hole(h0);
+        }
+      }
+    } // end loop on facets of the input polyhedron
+  }
+}; // end class Triangulate_modifier
+
+template <typename Polyhedron>
+void triangulate_polyhedron(Polyhedron& p)
+{
+  CGAL::Triangulate_modifier<Polyhedron> modifier;
+  p.delegate(modifier);
+}
+
+} // end namespace CGAL
+
+#endif // CGAL_TRIANGULATE_POLYHEDRON_H
diff --git a/dolfin/generation/compute_normal.h b/dolfin/generation/compute_normal.h
new file mode 100644
index 0000000..0576783
--- /dev/null
+++ b/dolfin/generation/compute_normal.h
@@ -0,0 +1,44 @@
+#ifndef _COMPUTE_NORMAL_
+#define _COMPUTE_NORMAL_
+
+template <class Facet, class Kernel>
+typename Kernel::Vector_3 compute_facet_normal(const Facet& f)
+{
+  typedef typename Kernel::Point_3 Point;
+  typedef typename Kernel::Vector_3 Vector;
+  typedef typename Facet::Halfedge_around_facet_const_circulator HF_circulator;
+  Vector normal = CGAL::NULL_VECTOR;
+  HF_circulator he = f.facet_begin();
+  HF_circulator end = he;
+  CGAL_For_all(he,end)
+  {
+    const Point& prev = he->prev()->vertex()->point();
+    const Point& curr = he->vertex()->point();
+    const Point& next = he->next()->vertex()->point();
+    Vector n = CGAL::cross_product(next-curr,prev-curr);
+    normal = normal + n;
+  }
+  return normal / std::sqrt(normal * normal);
+}
+
+template <class Vertex, class Kernel>
+typename Kernel::Vector_3 compute_vertex_normal(const Vertex& v)
+{
+  typedef typename Kernel::Vector_3 Vector;
+  typedef typename Vertex::Halfedge_around_vertex_const_circulator HV_circulator;
+  typedef typename Vertex::Facet Facet;
+  Vector normal = CGAL::NULL_VECTOR;
+  HV_circulator he = v.vertex_begin();
+  HV_circulator end = he;
+  CGAL_For_all(he,end)
+  {
+    if(!he->is_border())
+    {
+      Vector n = compute_facet_normal<Facet,Kernel>(*he->facet());
+      normal = normal + (n / std::sqrt(n*n));
+    }
+  }
+  return normal / std::sqrt(normal * normal);
+}
+
+#endif // _COMPUTE_NORMAL_
diff --git a/dolfin/generation/dolfin_generation.h b/dolfin/generation/dolfin_generation.h
new file mode 100644
index 0000000..ea57f31
--- /dev/null
+++ b/dolfin/generation/dolfin_generation.h
@@ -0,0 +1,29 @@
+#ifndef __DOLFIN_GENERATION_H
+#define __DOLFIN_GENERATION_H
+
+// DOLFIN mesh generation interface
+
+#include <dolfin/generation/ImplicitDomainMeshGenerator.h>
+#include <dolfin/generation/PolygonalMeshGenerator.h>
+#include <dolfin/generation/PolyhedralMeshGenerator.h>
+#include <dolfin/generation/Triangulate.h>
+#include <dolfin/generation/BoxMesh.h>
+#include <dolfin/generation/EllipseMesh.h>
+#include <dolfin/generation/EllipsoidMesh.h>
+#include <dolfin/generation/IntervalMesh.h>
+#include <dolfin/generation/RectangleMesh.h>
+#include <dolfin/generation/UnitTetrahedronMesh.h>
+#include <dolfin/generation/UnitCubeMesh.h>
+#include <dolfin/generation/UnitIntervalMesh.h>
+#include <dolfin/generation/UnitTriangleMesh.h>
+#include <dolfin/generation/UnitSquareMesh.h>
+#include <dolfin/generation/CSGGeometry.h>
+#include <dolfin/generation/CSGMeshGenerator.h>
+#include <dolfin/generation/CSGCGALMeshGenerator2D.h>
+#include <dolfin/generation/CSGCGALMeshGenerator3D.h>
+#include <dolfin/generation/CSGOperators.h>
+#include <dolfin/generation/CSGPrimitive.h>
+#include <dolfin/generation/CSGPrimitives2D.h>
+#include <dolfin/generation/CSGPrimitives3D.h>
+#include <dolfin/generation/CSGGeometries3D.h>
+#endif
diff --git a/dolfin/generation/self_intersect.h b/dolfin/generation/self_intersect.h
new file mode 100644
index 0000000..d0bdad8
--- /dev/null
+++ b/dolfin/generation/self_intersect.h
@@ -0,0 +1,155 @@
+// compute self-intersection of a CGAL triangle polyhedron mesh
+// original code from Lutz Kettner
+#ifndef _SELF_INTERSECT_H_
+#define _SELF_INTERSECT_H_
+
+#include <CGAL/box_intersection_d.h>
+#include <CGAL/intersections.h>
+#include <CGAL/Bbox_3.h>
+
+template <class Polyhedron, class Kernel, class OutputIterator>
+struct Intersect_facets
+{
+  typedef typename Kernel::Point_3      Point;
+  typedef typename Kernel::Vector_3     Vector;
+  typedef typename Kernel::Segment_3    Segment;
+  typedef typename Kernel::Triangle_3   Triangle;
+  typedef typename Polyhedron::Facet_const_handle       Facet_const_handle;
+  typedef typename Polyhedron::Facet_const_iterator     Facet_const_iterator;
+  typedef typename Polyhedron::Halfedge_const_handle    Halfedge_const_handle;
+  typedef typename CGAL::Box_intersection_d::Box_with_handle_d<double, 3, Facet_const_handle> Box;
+  mutable OutputIterator m_iterator;
+
+public:
+
+  Intersect_facets(OutputIterator it)
+    : m_iterator(it)
+  {
+  }
+
+  void operator()(const Box* b,
+    const Box* c) const
+  {
+    Halfedge_const_handle h = b->handle()->halfedge();
+
+    // check for shared egde --> no intersection
+    if(h->opposite()->facet() == c->handle() ||
+      h->next()->opposite()->facet() == c->handle() ||
+      h->next()->next()->opposite()->facet() == c->handle())
+      return;
+
+    // check for shared vertex --> maybe intersection, maybe not
+    Halfedge_const_handle g = c->handle()->halfedge();
+    Halfedge_const_handle v;
+
+    if(h->vertex() == g->vertex())
+      v = g;
+    if(h->vertex() == g->next()->vertex())
+      v = g->next();
+    if(h->vertex() == g->next()->next()->vertex())
+      v = g->next()->next();
+
+    if(v == Halfedge_const_handle())
+    {
+      h = h->next();
+      if(h->vertex() == g->vertex())
+	v = g;
+      if(h->vertex() == g->next()->vertex())
+	v = g->next();
+      if(h->vertex() == g->next()->next()->vertex())
+	v = g->next()->next();
+      if(v == Halfedge_const_handle())
+      {
+	h = h->next();
+	if(h->vertex() == g->vertex())
+	  v = g;
+	if(h->vertex() == g->next()->vertex())
+	  v = g->next();
+	if(h->vertex() == g->next()->next()->vertex())
+	  v = g->next()->next();
+      }
+    }
+
+    if(v != Halfedge_const_handle())
+    {
+      // found shared vertex:
+      CGAL_assertion(h->vertex() == v->vertex());
+      // geometric check if the opposite segments intersect the triangles
+      Triangle t1( h->vertex()->point(),
+	h->next()->vertex()->point(),
+	h->next()->next()->vertex()->point());
+      Triangle t2( v->vertex()->point(),
+	v->next()->vertex()->point(),
+	v->next()->next()->vertex()->point());
+      Segment s1( h->next()->vertex()->point(),
+	h->next()->next()->vertex()->point());
+      Segment s2( v->next()->vertex()->point(),
+	v->next()->next()->vertex()->point());
+
+      if(CGAL::do_intersect(t1,s2))
+      {
+	*m_iterator++ = t1;
+	*m_iterator++ = t2;
+      }
+      else
+	if(CGAL::do_intersect(t2,s1))
+	{
+	  *m_iterator++ = t1;
+	  *m_iterator++ = t2;
+	}
+	return;
+    }
+
+    // check for geometric intersection
+    Triangle t1( h->vertex()->point(),
+      h->next()->vertex()->point(),
+      h->next()->next()->vertex()->point());
+    Triangle t2( g->vertex()->point(),
+      g->next()->vertex()->point(),
+      g->next()->next()->vertex()->point());
+    if(CGAL::do_intersect(t1, t2))
+    {
+      *m_iterator++ = t1;
+      *m_iterator++ = t2;
+    }
+  } // end operator ()
+}; // end struct Intersect_facets
+
+template <class Polyhedron, class Kernel, class OutputIterator>
+void self_intersect(const Polyhedron& polyhedron,
+		    OutputIterator out)
+{
+  typedef typename Polyhedron::Facet_const_iterator     Facet_const_iterator;
+  typedef typename Polyhedron::Facet_const_handle       Facet_const_handle;
+  typedef typename CGAL::Box_intersection_d::Box_with_handle_d<double, 3, Facet_const_handle> Box;
+
+  // make one box per facet
+  std::vector<Box> boxes;
+  boxes.reserve(polyhedron.size_of_facets());
+
+  Facet_const_iterator f;
+  for(f = polyhedron.facets_begin();
+    f != polyhedron.facets_end();
+    f++)
+    boxes.push_back(Box( f->halfedge()->vertex()->point().bbox() +
+    f->halfedge()->next()->vertex()->point().bbox() +
+    f->halfedge()->next()->next()->vertex()->point().bbox(),
+    f));
+
+  // generate box pointers
+  std::vector<const Box*> box_ptr;
+  box_ptr.reserve(polyhedron.size_of_facets());
+  typename std::vector<Box>::iterator b;
+  for(b = boxes.begin();
+    b != boxes.end();
+    b++)
+    box_ptr.push_back(&*b);
+
+  // compute self-intersections filtered out by boxes
+  Intersect_facets<Polyhedron,Kernel,OutputIterator> intersect_facets(out);
+  std::ptrdiff_t cutoff = 2000;
+  CGAL::box_self_intersection_d(box_ptr.begin(), box_ptr.end(),intersect_facets,cutoff);
+
+} // end self_intersect
+
+#endif // _SELF_INTERSECT_H_
diff --git a/dolfin/geometry/BoundingBoxTree.cpp b/dolfin/geometry/BoundingBoxTree.cpp
new file mode 100644
index 0000000..b323f5f
--- /dev/null
+++ b/dolfin/geometry/BoundingBoxTree.cpp
@@ -0,0 +1,207 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-09
+// Last changed: 2014-02-06
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include "BoundingBoxTree1D.h"
+#include "BoundingBoxTree2D.h"
+#include "BoundingBoxTree3D.h"
+#include "BoundingBoxTree.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+BoundingBoxTree::BoundingBoxTree() : _mesh(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+BoundingBoxTree::~BoundingBoxTree()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void BoundingBoxTree::build(const Mesh& mesh)
+{
+  build(mesh, mesh.topology().dim());
+}
+//-----------------------------------------------------------------------------
+void BoundingBoxTree::build(const Mesh& mesh, std::size_t tdim)
+{
+  // Select implementation
+  switch (mesh.geometry().dim())
+  {
+  case 1:
+    _tree.reset(new BoundingBoxTree1D());
+    break;
+  case 2:
+    _tree.reset(new BoundingBoxTree2D());
+    break;
+  case 3:
+    _tree.reset(new BoundingBoxTree3D());
+    break;
+  default:
+    dolfin_error("BoundingBoxTree.cpp",
+                 "build bounding box tree",
+                 "Not implemented for geometric dimension %d",
+                 mesh.geometry().dim());
+  }
+
+  // Build tree
+  dolfin_assert(_tree);
+  _tree->build(mesh, tdim);
+
+  // Store mesh
+  _mesh = &mesh;
+}
+//-----------------------------------------------------------------------------
+void BoundingBoxTree::build(const std::vector<Point>& points, std::size_t gdim)
+{
+  // Select implementation
+  switch (gdim)
+  {
+  case 1:
+    _tree.reset(new BoundingBoxTree1D());
+    break;
+  case 2:
+    _tree.reset(new BoundingBoxTree2D());
+    break;
+  case 3:
+    _tree.reset(new BoundingBoxTree3D());
+    break;
+  default:
+    dolfin_error("BoundingBoxTree.cpp",
+                 "build bounding box tree",
+                 "Not implemented for geometric dimension %d",
+                 gdim);
+  }
+
+  // Build tree
+  dolfin_assert(_tree);
+  _tree->build(points);
+}
+//-----------------------------------------------------------------------------
+std::vector<unsigned int>
+BoundingBoxTree::compute_collisions(const Point& point) const
+{
+  // Check that tree has been built
+  check_built();
+
+  // Delegate call to implementation
+  dolfin_assert(_tree);
+  return _tree->compute_collisions(point);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+BoundingBoxTree::compute_collisions(const BoundingBoxTree& tree) const
+{
+  // Check that tree has been built
+  check_built();
+
+  // Delegate call to implementation
+  dolfin_assert(_tree);
+  dolfin_assert(tree._tree);
+  return _tree->compute_collisions(*tree._tree);
+}
+//-----------------------------------------------------------------------------
+std::vector<unsigned int>
+BoundingBoxTree::compute_entity_collisions(const Point& point) const
+{
+  // Check that tree has been built
+  check_built();
+
+  // Delegate call to implementation
+  dolfin_assert(_tree);
+  dolfin_assert(_mesh);
+  return _tree->compute_entity_collisions(point, *_mesh);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+BoundingBoxTree::compute_entity_collisions(const BoundingBoxTree& tree) const
+{
+  // Check that tree has been built
+  check_built();
+
+  // Delegate call to implementation
+  dolfin_assert(_tree);
+  dolfin_assert(tree._tree);
+  dolfin_assert(_mesh);
+  dolfin_assert(tree._mesh);
+  return _tree->compute_entity_collisions(*tree._tree, *_mesh, *tree._mesh);
+}
+//-----------------------------------------------------------------------------
+unsigned int
+BoundingBoxTree::compute_first_collision(const Point& point) const
+{
+  // Check that tree has been built
+  check_built();
+
+  // Delegate call to implementation
+  dolfin_assert(_tree);
+  return _tree->compute_first_collision(point);
+}
+//-----------------------------------------------------------------------------
+unsigned int
+BoundingBoxTree::compute_first_entity_collision(const Point& point) const
+{
+  // Check that tree has been built
+  check_built();
+
+  // Delegate call to implementation
+  dolfin_assert(_tree);
+  dolfin_assert(_mesh);
+  return _tree->compute_first_entity_collision(point, *_mesh);
+}
+//-----------------------------------------------------------------------------
+std::pair<unsigned int, double>
+BoundingBoxTree::compute_closest_entity(const Point& point) const
+{
+  // Check that tree has been built
+  check_built();
+
+  // Delegate call to implementation
+  dolfin_assert(_tree);
+  dolfin_assert(_mesh);
+  return _tree->compute_closest_entity(point, *_mesh);
+}
+//-----------------------------------------------------------------------------
+std::pair<unsigned int, double>
+BoundingBoxTree::compute_closest_point(const Point& point) const
+{
+  // Check that tree has been built
+  check_built();
+
+  // Delegate call to implementation
+  dolfin_assert(_tree);
+  return _tree->compute_closest_point(point);
+}
+//-----------------------------------------------------------------------------
+void BoundingBoxTree::check_built() const
+{
+  if (!_tree)
+  {
+    dolfin_error("BoundingBoxTree.cpp",
+                 "compute collisions with bounding box tree",
+                 "Bounding box tree has not been built. You need to call tree.build()");
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/BoundingBoxTree.h b/dolfin/geometry/BoundingBoxTree.h
new file mode 100644
index 0000000..c76f9d9
--- /dev/null
+++ b/dolfin/geometry/BoundingBoxTree.h
@@ -0,0 +1,246 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-09
+// Last changed: 2014-02-06
+
+#ifndef __BOUNDING_BOX_TREE_H
+#define __BOUNDING_BOX_TREE_H
+
+#include <limits>
+#include <vector>
+#include <memory>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Point;
+  class GenericBoundingBoxTree;
+  class Mesh;
+
+  /// This class implements a (distributed) axis aligned bounding box
+  /// tree (AABB tree). Bounding box trees can be created from meshes
+  /// and [other data structures, to be filled in].
+
+  class BoundingBoxTree
+  {
+  public:
+
+    /// Create empty bounding box tree
+    BoundingBoxTree();
+
+    /// Destructor
+    ~BoundingBoxTree();
+
+    /// Build bounding box tree for cells of mesh.
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh for which to compute the bounding box tree.
+    void build(const Mesh& mesh);
+
+    /// Build bounding box tree for mesh entities of given dimension.
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh for which to compute the bounding box tree.
+    ///     dimension (std::size_t)
+    ///         The entity dimension (topological dimension) for which
+    ///         to compute the bounding box tree.
+    void build(const Mesh& mesh, std::size_t tdim);
+
+    /// Build bounding box tree for point cloud.
+    ///
+    /// *Arguments*
+    ///     points (std::vector<_Point_>)
+    ///         The list of points.
+    ///     gdim (std::size_t)
+    ///         The geometric dimension.
+    void build(const std::vector<Point>& points, std::size_t gdim);
+
+    /// Compute all collisions between bounding boxes and _Point_.
+    ///
+    /// *Returns*
+    ///     std::vector<unsigned int>
+    ///         A list of local indices for entities contained in
+    ///         (leaf) bounding boxes that collide with (intersect)
+    ///         the given point.
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point.
+    std::vector<unsigned int>
+    compute_collisions(const Point& point) const;
+
+    /// Compute all collisions between bounding boxes and _BoundingBoxTree_.
+    ///
+    /// *Returns*
+    ///     std::vector<unsigned int>
+    ///         A list of local indices for entities in this tree that
+    ///         collide with (intersect) entities in other tree.
+    ///     std::vector<unsigned int>
+    ///         A list of local indices for entities in other tree that
+    ///         collide with (intersect) entities in this tree.
+    ///
+    /// The two lists have equal length and contain matching entities,
+    /// such that entity `i` in the first list collides with entity
+    /// `i` in the second list.
+    ///
+    /// Note that this means that the entity lists may contain
+    /// duplicate entities since a single entity may collide with
+    /// several different entities.
+    ///
+    /// *Arguments*
+    ///     tree (_BoundingBoxTree_)
+    ///         The bounding box tree.
+    ///
+    /// Note that this function only checks collisions between bounding
+    /// boxes of entities. It does not check that the entities
+    /// themselves actually collide. To compute entity collisions, use
+    /// the function compute_entity_collisions.
+    std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+    compute_collisions(const BoundingBoxTree& tree) const;
+
+    /// Compute all collisions between entities and _Point_.
+    ///
+    /// *Returns*
+    ///     std::vector<unsigned int>
+    ///         A list of local indices for entities that collide with
+    ///         (intersect) the given point.
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point.
+    std::vector<unsigned int>
+    compute_entity_collisions(const Point& point) const;
+
+    /// Compute all collisions between entities and _BoundingBoxTree_.
+    ///
+    /// *Returns*
+    ///     std::vector<unsigned int>
+    ///         A list of local indices for entities in this tree that
+    ///         collide with (intersect) entities in other tree.
+    ///     std::vector<unsigned int>
+    ///         A list of local indices for entities in other tree that
+    ///         collide with (intersect) entities in this tree.
+    ///
+    /// The two lists have equal length and contain matching entities,
+    /// such that entity `i` in the first list collides with entity
+    /// `i` in the second list.
+    ///
+    /// Note that this means that the entity lists may contain
+    /// duplicate entities since a single entity may collide with
+    /// several different entities.
+    ///
+    /// *Arguments*
+    ///     tree (_BoundingBoxTree_)
+    ///         The bounding box tree.
+    std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+    compute_entity_collisions(const BoundingBoxTree& tree) const;
+
+    /// Compute first collision between bounding boxes and _Point_.
+    ///
+    /// *Returns*
+    ///     unsigned int
+    ///         The local index for the first found entity contained
+    ///         in a (leaf) bounding box that collides with
+    ///         (intersects) the given point. If not found,
+    ///         std::numeric_limits<unsigned int>::max() is returned.
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point.
+    unsigned int
+    compute_first_collision(const Point& point) const;
+
+    /// Compute first collision between entities and _Point_.
+    ///
+    /// *Returns*
+    ///     unsigned int
+    ///         The local index for the first found entity that
+    ///         collides with (intersects) the given point. If not
+    ///         found, std::numeric_limits<unsigned int>::max() is
+    ///         returned.
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point.
+    unsigned int
+    compute_first_entity_collision(const Point& point) const;
+
+    /// Compute closest entity to _Point_.
+    ///
+    /// *Returns*
+    ///     unsigned int
+    ///         The local index for the entity that is closest to the
+    ///         point. If more than one entity is at the same distance
+    ///         (or point contained in entity), then the first entity
+    ///         is returned.
+    ///     double
+    ///         The distance to the closest entity.
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point.
+    std::pair<unsigned int, double>
+    compute_closest_entity(const Point& point) const;
+
+    /// Compute closest point to _Point_. This function assumes
+    /// that the tree has been built for a point cloud.
+    ///
+    /// Developer note: This function should not be confused with
+    /// computing the closest point in all entities of a mesh. That
+    /// function could be added with relative ease since we actually
+    /// compute the closest points to get the distance in the above
+    /// function (compute_closest_entity) inside the specialized
+    /// implementations in TetrahedronCell.cpp etc.
+    ///
+    /// *Returns*
+    ///     unsigned int
+    ///         The local index for the point that is closest to the
+    ///         point. If more than one point is at the same distance
+    ///         (or point contained in entity), then the first point
+    ///         is returned.
+    ///     double
+    ///         The distance to the closest point.
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point.
+    std::pair<unsigned int, double>
+    compute_closest_point(const Point& point) const;
+
+  private:
+
+    // Check that tree has been built
+    void check_built() const;
+
+    // Dimension-dependent implementation
+    std::unique_ptr<GenericBoundingBoxTree> _tree;
+
+    // Pointer to the mesh. We all know that we don't really want
+    // to store a pointer to the mesh here, but without it we will
+    // be forced to make calls like
+    // tree_A.compute_entity_intersections(tree_B, mesh_A, mesh_B).
+    const Mesh* _mesh;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/BoundingBoxTree1D.h b/dolfin/geometry/BoundingBoxTree1D.h
new file mode 100644
index 0000000..c6f5f47
--- /dev/null
+++ b/dolfin/geometry/BoundingBoxTree1D.h
@@ -0,0 +1,173 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-02
+// Last changed: 2014-02-24
+
+#ifndef __BOUNDING_BOX_TREE_1D_H
+#define __BOUNDING_BOX_TREE_1D_H
+
+#include <algorithm>
+#include <vector>
+#include <dolfin/common/constants.h>
+#include "GenericBoundingBoxTree.h"
+
+namespace dolfin
+{
+
+  // Specialization of bounding box implementation to 1D
+
+  class BoundingBoxTree1D : public GenericBoundingBoxTree
+  {
+  protected:
+
+    // Comparison operator for sorting of bounding boxes. Boxes are
+    // sorted by their midpoints along the longest axis.
+
+    struct less_x
+    {
+      const std::vector<double>& bboxes;
+      less_x(const std::vector<double>& bboxes): bboxes(bboxes) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* bi = bboxes.data() + 2*i;
+        const double* bj = bboxes.data() + 2*j;
+        return bi[0] + bi[1] < bj[0] + bj[1];
+      }
+    };
+
+    // Return geometric dimension
+    std::size_t gdim() const { return 1; }
+
+    // Return bounding box coordinates for node
+    const double* get_bbox_coordinates(unsigned int node) const
+    {
+      return _bbox_coordinates.data() + 2*node;
+    }
+
+    // Check whether point (x) is in bounding box (node)
+    bool point_in_bbox(const double* x, unsigned int node) const
+    {
+      const double* b = _bbox_coordinates.data() + 2*node;
+      const double eps = DOLFIN_EPS_LARGE*(b[1] - b[0]);
+      return b[0] - eps <= x[0] && x[0] <= b[1] + eps;
+    }
+
+    // Check whether bounding box (a) collides with bounding box (node)
+    bool bbox_in_bbox(const double* a, unsigned int node) const
+    {
+      const double* b = _bbox_coordinates.data() + 2*node;
+      const double eps = DOLFIN_EPS_LARGE*(b[1] - b[0]);
+      return b[0] - eps <= a[1] && a[0] <= b[1] + eps;
+    }
+
+    // Compute squared distance between point and bounding box
+    double compute_squared_distance_bbox(const double* x,
+                                         unsigned int node) const
+    {
+      // Note: Some else-if might be in order here but I assume the
+      // compiler can do a better job at optimizing/parallelizing this
+      // version. This is also the way the algorithm is presented in
+      // Ericsson.
+
+      const double* b = _bbox_coordinates.data() + 2*node;
+      double r2 = 0.0;
+
+      if (x[0] < b[0]) r2 += (x[0] - b[0])*(x[0] - b[0]);
+      if (x[0] > b[1]) r2 += (x[0] - b[1])*(x[0] - b[1]);
+
+      return r2;
+    }
+
+    // Compute squared distance between point and point
+    double compute_squared_distance_point(const double* x,
+                                          unsigned int node) const
+    {
+      const double* p = _bbox_coordinates.data() + 2*node;
+      return (x[0] - p[0])*(x[0] - p[0]);
+    }
+
+    // Compute bounding box of bounding boxes
+    void compute_bbox_of_bboxes(double* bbox,
+                                std::size_t& axis,
+                                const std::vector<double>& leaf_bboxes,
+                                const std::vector<unsigned int>::iterator& begin,
+                                const std::vector<unsigned int>::iterator& end)
+    {
+      typedef std::vector<unsigned int>::const_iterator iterator;
+
+      // Get coordinates for first box
+      iterator it = begin;
+      const double* b = leaf_bboxes.data() + 2*(*it);
+      bbox[0] = b[0];
+      bbox[1] = b[1];
+
+      // Compute min and max over remaining boxes
+      for (++it; it != end; ++it)
+      {
+        const double* b = leaf_bboxes.data() + 2*(*it);
+        if (b[0] < bbox[0]) bbox[0] = b[0];
+        if (b[1] > bbox[1]) bbox[1] = b[1];
+      }
+
+      // Compute longest axis
+      axis = 0;
+    }
+
+    // Compute bounding box of points
+    void compute_bbox_of_points(double* bbox,
+                                std::size_t& axis,
+                                const std::vector<Point>& points,
+                                const std::vector<unsigned int>::iterator& begin,
+                                const std::vector<unsigned int>::iterator& end)
+    {
+      typedef std::vector<unsigned int>::const_iterator iterator;
+
+      // Get coordinates for first point
+      iterator it = begin;
+      const double* p = points[*it].coordinates();
+      bbox[0] = p[0];
+      bbox[1] = p[0];
+
+      // Compute min and max over remaining boxes
+      for (; it != end; ++it)
+      {
+        const double* p = points[*it].coordinates();
+        if (p[0] < bbox[0]) bbox[0] = p[0];
+        if (p[0] > bbox[1]) bbox[1] = p[0];
+      }
+
+      // Compute longest axis
+      axis = 0;
+    }
+
+    // Sort leaf bounding boxes along given axis
+    void sort_bboxes(std::size_t axis,
+                     const std::vector<double>& leaf_bboxes,
+                     const std::vector<unsigned int>::iterator& begin,
+                     const std::vector<unsigned int>::iterator& middle,
+                     const std::vector<unsigned int>::iterator& end)
+    {
+      std::nth_element(begin, middle, end, less_x(leaf_bboxes));
+    }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/BoundingBoxTree2D.h b/dolfin/geometry/BoundingBoxTree2D.h
new file mode 100644
index 0000000..3ea79db
--- /dev/null
+++ b/dolfin/geometry/BoundingBoxTree2D.h
@@ -0,0 +1,215 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-02
+// Last changed: 2013-11-30
+
+#ifndef __BOUNDING_BOX_TREE_2D_H
+#define __BOUNDING_BOX_TREE_2D_H
+
+#include <algorithm>
+#include <vector>
+#include <dolfin/common/constants.h>
+#include "GenericBoundingBoxTree.h"
+
+namespace dolfin
+{
+
+  // Specialization of bounding box implementation to 2D
+
+  class BoundingBoxTree2D : public GenericBoundingBoxTree
+  {
+  protected:
+
+    // Comparison operators for sorting of bounding boxes. Boxes are
+    // sorted by their midpoints along the longest axis.
+
+    struct less_x
+    {
+      const std::vector<double>& bboxes;
+      less_x(const std::vector<double>& bboxes): bboxes(bboxes) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* bi = bboxes.data() + 4*i;
+        const double* bj = bboxes.data() + 4*j;
+        return bi[0] + bi[2] < bj[0] + bj[2];
+      }
+    };
+
+    struct less_y
+    {
+      const std::vector<double>& bboxes;
+      less_y(const std::vector<double>& bboxes): bboxes(bboxes) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* bi = bboxes.data() + 4*i;
+        const double* bj = bboxes.data() + 4*j;
+        return bi[1] + bi[3] < bj[1] + bj[3];
+      }
+    };
+
+    // Return geometric dimension
+    std::size_t gdim() const { return 2; }
+
+    // Return bounding box coordinates for node
+    const double* get_bbox_coordinates(unsigned int node) const
+    {
+      return _bbox_coordinates.data() + 4*node;
+    }
+
+    // Check whether point (x) is in bounding box (node)
+    bool point_in_bbox(const double* x, unsigned int node) const
+    {
+      const double* b = _bbox_coordinates.data() + 4*node;
+      const double eps0 = DOLFIN_EPS_LARGE*(b[2] - b[0]);
+      const double eps1 = DOLFIN_EPS_LARGE*(b[3] - b[1]);
+      return (b[0] - eps0 <= x[0] && x[0] <= b[2] + eps0 &&
+              b[1] - eps1 <= x[1] && x[1] <= b[3] + eps1);
+    }
+
+    // Check whether bounding box (a) collides with bounding box (node)
+    bool bbox_in_bbox(const double* a, unsigned int node) const
+    {
+      const double* b = _bbox_coordinates.data() + 4*node;
+      const double eps0 = DOLFIN_EPS_LARGE*(b[2] - b[0]);
+      const double eps1 = DOLFIN_EPS_LARGE*(b[3] - b[1]);
+      return (b[0] - eps0 <= a[2] && a[0] <= b[2] + eps0 &&
+              b[1] - eps1 <= a[3] && a[1] <= b[3] + eps1);
+    }
+
+    // Compute squared distance between point and bounding box
+    double compute_squared_distance_bbox(const double* x,
+                                         unsigned int node) const
+    {
+      // Note: Some else-if might be in order here but I assume the
+      // compiler can do a better job at optimizing/parallelizing this
+      // version. This is also the way the algorithm is presented in
+      // Ericsson.
+
+      const double* b = _bbox_coordinates.data() + 4*node;
+      double r2 = 0.0;
+
+      if (x[0] < b[0]) r2 += (x[0] - b[0])*(x[0] - b[0]);
+      if (x[0] > b[2]) r2 += (x[0] - b[2])*(x[0] - b[2]);
+      if (x[1] < b[1]) r2 += (x[1] - b[1])*(x[1] - b[1]);
+      if (x[1] > b[3]) r2 += (x[1] - b[3])*(x[1] - b[3]);
+
+      return r2;
+    }
+
+    // Compute squared distance between point and point
+    double compute_squared_distance_point(const double* x,
+                                          unsigned int node) const
+    {
+      const double* p = _bbox_coordinates.data() + 4*node;
+      return (x[0] - p[0])*(x[0] - p[0]) + (x[1] - p[1])*(x[1] - p[1]);
+    }
+
+    // Compute bounding box of bounding boxes
+    void compute_bbox_of_bboxes(double* bbox,
+                                std::size_t& axis,
+                                const std::vector<double>& leaf_bboxes,
+                                const std::vector<unsigned int>::iterator& begin,
+                                const std::vector<unsigned int>::iterator& end)
+    {
+      typedef std::vector<unsigned int>::const_iterator iterator;
+
+      // Get coordinates for first box
+      iterator it = begin;
+      const double* b = leaf_bboxes.data() + 4*(*it);
+      bbox[0] = b[0];
+      bbox[1] = b[1];
+      bbox[2] = b[2];
+      bbox[3] = b[3];
+
+      // Compute min and max over remaining boxes
+      for (++it; it != end; ++it)
+      {
+        const double* b = leaf_bboxes.data() + 4*(*it);
+        if (b[0] < bbox[0]) bbox[0] = b[0];
+        if (b[1] < bbox[1]) bbox[1] = b[1];
+        if (b[2] > bbox[2]) bbox[2] = b[2];
+        if (b[3] > bbox[3]) bbox[3] = b[3];
+      }
+
+      // Compute longest axis
+      const double x = bbox[2] - bbox[0];
+      const double y = bbox[3] - bbox[1];
+
+      if (x > y)
+        axis = 0;
+      else
+        axis = 1;
+    }
+
+    // Compute bounding box of points
+    void compute_bbox_of_points(double* bbox,
+                                std::size_t& axis,
+                                const std::vector<Point>& points,
+                                const std::vector<unsigned int>::iterator& begin,
+                                const std::vector<unsigned int>::iterator& end)
+    {
+      typedef std::vector<unsigned int>::const_iterator iterator;
+
+      // Get coordinates for first point
+      iterator it = begin;
+      const double* p = points[*it].coordinates();
+      bbox[0] = p[0];
+      bbox[1] = p[1];
+      bbox[2] = p[0];
+      bbox[3] = p[1];
+
+      // Compute min and max over remaining points
+      for (; it != end; ++it)
+      {
+        const double* p = points[*it].coordinates();
+        if (p[0] < bbox[0]) bbox[0] = p[0];
+        if (p[1] < bbox[1]) bbox[1] = p[1];
+        if (p[0] > bbox[2]) bbox[2] = p[0];
+        if (p[1] > bbox[3]) bbox[3] = p[1];
+      }
+
+      // Compute longest axis
+      const double x = bbox[2] - bbox[0];
+      const double y = bbox[3] - bbox[1];
+
+      if (x > y)
+        axis = 0;
+      else
+        axis = 1;
+    }
+
+    // Sort leaf bounding boxes along given axis
+    void sort_bboxes(std::size_t axis,
+                     const std::vector<double>& leaf_bboxes,
+                     const std::vector<unsigned int>::iterator& begin,
+                     const std::vector<unsigned int>::iterator& middle,
+                     const std::vector<unsigned int>::iterator& end)
+    {
+      if (axis == 0)
+        std::nth_element(begin, middle, end, less_x(leaf_bboxes));
+      else
+        std::nth_element(begin, middle, end, less_y(leaf_bboxes));
+    }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/BoundingBoxTree3D.h b/dolfin/geometry/BoundingBoxTree3D.h
new file mode 100644
index 0000000..8b2bee4
--- /dev/null
+++ b/dolfin/geometry/BoundingBoxTree3D.h
@@ -0,0 +1,257 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-09
+// Last changed: 2013-11-30
+
+#ifndef __BOUNDING_BOX_TREE_3D_H
+#define __BOUNDING_BOX_TREE_3D_H
+
+#include <algorithm>
+#include <vector>
+#include <dolfin/common/constants.h>
+#include "GenericBoundingBoxTree.h"
+
+namespace dolfin
+{
+
+  // Specialization of bounding box implementation to 3D
+
+  class BoundingBoxTree3D : public GenericBoundingBoxTree
+  {
+  protected:
+
+    // Comparison operators for sorting of bounding boxes. Boxes are
+    // sorted by their midpoints along the longest axis.
+
+    struct less_x_bbox
+    {
+      const std::vector<double>& bboxes;
+      less_x_bbox(const std::vector<double>& bboxes): bboxes(bboxes) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* bi = bboxes.data() + 6*i;
+        const double* bj = bboxes.data() + 6*j;
+        return bi[0] + bi[3] < bj[0] + bj[3];
+      }
+    };
+
+    struct less_y_bbox
+    {
+      const std::vector<double>& bboxes;
+      less_y_bbox(const std::vector<double>& bboxes): bboxes(bboxes) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* bi = bboxes.data() + 6*i;
+        const double* bj = bboxes.data() + 6*j;
+        return bi[1] + bi[4] < bj[1] + bj[4];
+      }
+    };
+
+    struct less_z_bbox
+    {
+      const std::vector<double>& bboxes;
+      less_z_bbox(const std::vector<double>& bboxes): bboxes(bboxes) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* bi = bboxes.data() + 6*i;
+        const double* bj = bboxes.data() + 6*j;
+        return bi[2] + bi[5] < bj[2] + bj[5];
+      }
+    };
+
+    // Return geometric dimension
+    std::size_t gdim() const { return 3; }
+
+    // Return bounding box coordinates for node
+    const double* get_bbox_coordinates(unsigned int node) const
+    {
+      return _bbox_coordinates.data() + 6*node;
+    }
+
+    // Check whether point (x) is in bounding box (node)
+    bool point_in_bbox(const double* x, const unsigned int node) const
+    {
+      const double* b = _bbox_coordinates.data() + 6*node;
+      const double eps0 = DOLFIN_EPS_LARGE*(b[3] - b[0]);
+      const double eps1 = DOLFIN_EPS_LARGE*(b[4] - b[1]);
+      const double eps2 = DOLFIN_EPS_LARGE*(b[5] - b[2]);
+      return (b[0] - eps0 <= x[0] && x[0] <= b[3] + eps0 &&
+              b[1] - eps1 <= x[1] && x[1] <= b[4] + eps1 &&
+              b[2] - eps2 <= x[2] && x[2] <= b[5] + eps2);
+    }
+
+    // Check whether bounding box (a) collides with bounding box (node)
+    bool bbox_in_bbox(const double* a, unsigned int node) const
+    {
+      const double* b = _bbox_coordinates.data() + 6*node;
+      const double eps0 = DOLFIN_EPS_LARGE*(b[3] - b[0]);
+      const double eps1 = DOLFIN_EPS_LARGE*(b[4] - b[1]);
+      const double eps2 = DOLFIN_EPS_LARGE*(b[5] - b[2]);
+      return (b[0] - eps0 <= a[3] && a[0] <= b[3] + eps0 &&
+              b[1] - eps1 <= a[4] && a[1] <= b[4] + eps1 &&
+              b[2] - eps2 <= a[5] && a[2] <= b[5] + eps2);
+    }
+
+    // Compute squared distance between point and bounding box
+    double compute_squared_distance_bbox(const double* x,
+                                         unsigned int node) const
+    {
+      // Note: Some else-if might be in order here but I assume the
+      // compiler can do a better job at optimizing/parallelizing this
+      // version. This is also the way the algorithm is presented in
+      // Ericsson.
+
+      const double* b = _bbox_coordinates.data() + 6*node;
+      double r2 = 0.0;
+
+      if (x[0] < b[0]) r2 += (x[0] - b[0])*(x[0] - b[0]);
+      if (x[0] > b[3]) r2 += (x[0] - b[3])*(x[0] - b[3]);
+      if (x[1] < b[1]) r2 += (x[1] - b[1])*(x[1] - b[1]);
+      if (x[1] > b[4]) r2 += (x[1] - b[4])*(x[1] - b[4]);
+      if (x[2] < b[2]) r2 += (x[2] - b[2])*(x[2] - b[2]);
+      if (x[2] > b[5]) r2 += (x[2] - b[5])*(x[2] - b[5]);
+
+      return r2;
+    }
+
+    // Compute squared distance between point and point
+    double compute_squared_distance_point(const double* x,
+                                          unsigned int node) const
+    {
+      const double* p = _bbox_coordinates.data() + 6*node;
+      return ((x[0] - p[0])*(x[0] - p[0]) +
+              (x[1] - p[1])*(x[1] - p[1]) +
+              (x[2] - p[2])*(x[2] - p[2]));
+    }
+
+    // Compute bounding box of bounding boxes
+    void compute_bbox_of_bboxes(double* bbox,
+                                std::size_t& axis,
+                                const std::vector<double>& leaf_bboxes,
+                                const std::vector<unsigned int>::iterator& begin,
+                                const std::vector<unsigned int>::iterator& end)
+    {
+      typedef std::vector<unsigned int>::const_iterator iterator;
+
+      // Get coordinates for first box
+      iterator it = begin;
+      const double* b = leaf_bboxes.data() + 6*(*it);
+      bbox[0] = b[0];
+      bbox[1] = b[1];
+      bbox[2] = b[2];
+      bbox[3] = b[3];
+      bbox[4] = b[4];
+      bbox[5] = b[5];
+
+      // Compute min and max over remaining boxes
+      for (; it != end; ++it)
+      {
+        const double* b = leaf_bboxes.data() + 6*(*it);
+        if (b[0] < bbox[0]) bbox[0] = b[0];
+        if (b[1] < bbox[1]) bbox[1] = b[1];
+        if (b[2] < bbox[2]) bbox[2] = b[2];
+        if (b[3] > bbox[3]) bbox[3] = b[3];
+        if (b[4] > bbox[4]) bbox[4] = b[4];
+        if (b[5] > bbox[5]) bbox[5] = b[5];
+      }
+
+      // Compute longest axis
+      const double x = bbox[3] - bbox[0];
+      const double y = bbox[4] - bbox[1];
+      const double z = bbox[5] - bbox[2];
+
+      if (x > y && x > z)
+        axis = 0;
+      else if (y > z)
+        axis = 1;
+      else
+        axis = 2;
+    }
+
+    // Compute bounding box of points
+    void compute_bbox_of_points(double* bbox,
+                                std::size_t& axis,
+                                const std::vector<Point>& points,
+                                const std::vector<unsigned int>::iterator& begin,
+                                const std::vector<unsigned int>::iterator& end)
+    {
+      typedef std::vector<unsigned int>::const_iterator iterator;
+
+      // Get coordinates for first point
+      iterator it = begin;
+      const double* p = points[*it].coordinates();
+      bbox[0] = p[0];
+      bbox[1] = p[1];
+      bbox[2] = p[2];
+      bbox[3] = p[0];
+      bbox[4] = p[1];
+      bbox[5] = p[2];
+
+      // Compute min and max over remaining points
+      for (++it; it != end; ++it)
+      {
+        const double* p = points[*it].coordinates();
+        if (p[0] < bbox[0]) bbox[0] = p[0];
+        if (p[1] < bbox[1]) bbox[1] = p[1];
+        if (p[2] < bbox[2]) bbox[2] = p[2];
+        if (p[0] > bbox[3]) bbox[3] = p[0];
+        if (p[1] > bbox[4]) bbox[4] = p[1];
+        if (p[2] > bbox[5]) bbox[5] = p[2];
+      }
+
+      // Compute longest axis
+      const double x = bbox[3] - bbox[0];
+      const double y = bbox[4] - bbox[1];
+      const double z = bbox[5] - bbox[2];
+
+      if (x > y && x > z)
+        axis = 0;
+      else if (y > z)
+        axis = 1;
+      else
+        axis = 2;
+    }
+
+    // Sort leaf bounding boxes along given axis
+    void sort_bboxes(std::size_t axis,
+                     const std::vector<double>& leaf_bboxes,
+                     const std::vector<unsigned int>::iterator& begin,
+                     const std::vector<unsigned int>::iterator& middle,
+                     const std::vector<unsigned int>::iterator& end)
+    {
+      switch (axis)
+      {
+      case 0:
+        std::nth_element(begin, middle, end, less_x_bbox(leaf_bboxes));
+        break;
+      case 1:
+        std::nth_element(begin, middle, end, less_y_bbox(leaf_bboxes));
+        break;
+      default:
+        std::nth_element(begin, middle, end, less_z_bbox(leaf_bboxes));
+      }
+    }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/CollisionDetection.cpp b/dolfin/geometry/CollisionDetection.cpp
new file mode 100644
index 0000000..4bf51c1
--- /dev/null
+++ b/dolfin/geometry/CollisionDetection.cpp
@@ -0,0 +1,1107 @@
+// Copyright (C) 2014 Anders Logg and August Johansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2014-02-03
+// Last changed: 2014-02-24
+//
+//-----------------------------------------------------------------------------
+// Special note regarding the function collides_tetrahedron_tetrahedron
+//-----------------------------------------------------------------------------
+//
+// The source code for the tetrahedron-tetrahedron collision test is
+// from Fabio Ganovelli, Federico Ponchio and Claudio Rocchini: Fast
+// Tetrahedron-Tetrahedron Overlap Algorithm, Journal of Graphics
+// Tools, 7(2), 2002, and is under the following copyright:
+//
+// Visual Computing Group
+// IEI Institute, CNUCE Institute, CNR Pisa
+//
+// Copyright(C) 2002 by Fabio Ganovelli, Federico Ponchio and Claudio
+// Rocchini
+//
+// All rights reserved.
+//
+// Permission to use, copy, modify, distribute and sell this software
+// and its documentation for any purpose is hereby granted without
+// fee, provided that the above copyright notice appear in all copies
+// and that both that copyright notice and this permission notice
+// appear in supporting documentation. the author makes no
+// representations about the suitability of this software for any
+// purpose. It is provided "as is" without express or implied
+// warranty.
+//
+//-----------------------------------------------------------------------------
+// Special note regarding the function collides_triangle_triangle
+//-----------------------------------------------------------------------------
+//
+// The source code for the triangle-triangle collision test is from
+// Tomas Moller: A Fast Triangle-Triangle Intersection Test, Journal
+// of Graphics Tools, 2(2), 1997, and is in the public domain.
+//
+//-----------------------------------------------------------------------------
+
+#include <dolfin/mesh/MeshEntity.h>
+#include "Point.h"
+#include "CollisionDetection.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+bool CollisionDetection::collides(const MeshEntity& entity,
+                                  const Point& point)
+{
+  switch (entity.dim())
+  {
+  case 0:
+    dolfin_not_implemented();
+    break;
+  case 1:
+    return collides_interval_point(entity, point);
+  case 2:
+    return collides_triangle_point(entity, point);
+  case 3:
+    return collides_tetrahedron_point(entity, point);
+  default:
+    dolfin_error("CollisionDetection.cpp",
+		 "collides entity with point",
+		 "Unknown dimension of entity");
+  }
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides(const MeshEntity& entity_0,
+			     const MeshEntity& entity_1)
+{
+  switch (entity_0.dim())
+  {
+  case 0:
+    // Collision with PointCell
+    dolfin_not_implemented();
+    break;
+  case 1:
+    // Collision with interval
+    switch (entity_1.dim())
+    {
+    case 0:
+      dolfin_not_implemented();
+      break;
+    case 1:
+      return collides_interval_interval(entity_1, entity_0);
+      break;
+    case 2:
+      dolfin_not_implemented();
+      break;
+    case 3:
+      dolfin_not_implemented();
+      break;
+    default:
+      dolfin_error("CollisionDetection.cpp",
+                   "collides entity_0 with entity_1",
+                   "Unknown dimension of entity_1 in IntervalCell collision");
+    }
+    break;
+  case 2:
+    // Collision with triangle
+    switch (entity_1.dim())
+    {
+    case 0:
+      dolfin_not_implemented();
+      break;
+    case 1:
+      dolfin_not_implemented();
+      break;
+    case 2:
+      return collides_triangle_triangle(entity_0, entity_1);
+    case 3:
+      return collides_tetrahedron_triangle(entity_1, entity_0);
+    default:
+      dolfin_error("CollisionDetection.cpp",
+		   "collides entity_0 with entity_1",
+		   "Unknown dimension of entity_1 in TriangleCell collision");
+    }
+    break;
+  case 3:
+    // Collision with tetrahedron
+    switch (entity_1.dim())
+    {
+    case 0:
+     dolfin_not_implemented();
+      break;
+    case 1:
+      dolfin_not_implemented();
+      break;
+    case 2:
+      return collides_tetrahedron_triangle(entity_0, entity_1);
+      break;
+    case 3:
+      return collides_tetrahedron_tetrahedron(entity_0, entity_1);
+      break;
+    default:
+      dolfin_error("CollisionDetection.cpp",
+		   "collides entity_0 with entity_1",
+		   "Unknown dimension of entity_1 in TetrahedronCell collision");
+    }
+    break;
+  default:
+    dolfin_error("CollisionDetection.cpp",
+		 "collides entity_0 with entity_1",
+		 "Unknown dimension of entity_0");
+  }
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool CollisionDetection::collides_interval_point(const MeshEntity& entity,
+                                                 const Point& point)
+{
+  // Get coordinates
+  const MeshGeometry& geometry = entity.mesh().geometry();
+  const unsigned int* vertices = entity.entities(0);
+  const double x0 = geometry.point(vertices[0])[0];
+  const double x1 = geometry.point(vertices[1])[0];
+  const double x = point.x();
+
+  // Check for collision
+  const double dx = std::abs(x1 - x0);
+  const double eps = std::max(DOLFIN_EPS_LARGE, DOLFIN_EPS_LARGE*dx);
+  return ((x >= x0 - eps && x <= x1 + eps) ||
+          (x >= x1 - eps && x <= x0 + eps));
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_interval_interval(const MeshEntity& interval_0,
+                                               const MeshEntity& interval_1)
+{
+  // Get coordinates
+  const MeshGeometry& geometry_0 = interval_0.mesh().geometry();
+  const MeshGeometry& geometry_1 = interval_1.mesh().geometry();
+  const unsigned int* vertices_0 = interval_0.entities(0);
+  const unsigned int* vertices_1 = interval_1.entities(0);
+  const double x00 = geometry_0.point(vertices_0[0])[0];
+  const double x01 = geometry_0.point(vertices_0[1])[0];
+  const double x10 = geometry_1.point(vertices_1[0])[0];
+  const double x11 = geometry_1.point(vertices_1[1])[0];
+
+  const double a0 = std::min(x00, x01);
+  const double b0 = std::max(x00, x01);
+  const double a1 = std::min(x10, x11);
+  const double b1 = std::max(x10, x11);
+
+  // Check for collisions
+  const double dx = std::min(b0 - a0, b1 - a1);
+  const double eps = std::max(DOLFIN_EPS_LARGE, DOLFIN_EPS_LARGE*dx);
+  return b1 > a0 - eps && a1 < b0 + eps;
+}
+//-----------------------------------------------------------------------------
+bool CollisionDetection::collides_triangle_point(const MeshEntity& triangle,
+                                                 const Point& point)
+{
+  dolfin_assert(triangle.mesh().topology().dim() == 2);
+
+  const MeshGeometry& geometry = triangle.mesh().geometry();
+  const unsigned int* vertices = triangle.entities(0);
+  return collides_triangle_point(geometry.point(vertices[0]),
+				 geometry.point(vertices[1]),
+				 geometry.point(vertices[2]),
+				 point);
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_triangle_triangle(const MeshEntity& triangle_0,
+                                               const MeshEntity& triangle_1)
+{
+  dolfin_assert(triangle_0.mesh().topology().dim() == 2);
+  dolfin_assert(triangle_1.mesh().topology().dim() == 2);
+
+  // Get vertices as points
+  const MeshGeometry& geometry_0 = triangle_0.mesh().geometry();
+  const unsigned int* vertices_0 = triangle_0.entities(0);
+  const MeshGeometry& geometry_1 = triangle_1.mesh().geometry();
+  const unsigned int* vertices_1 = triangle_1.entities(0);
+
+  return collides_triangle_triangle(geometry_0.point(vertices_0[0]),
+				    geometry_0.point(vertices_0[1]),
+				    geometry_0.point(vertices_0[2]),
+				    geometry_1.point(vertices_1[0]),
+				    geometry_1.point(vertices_1[1]),
+				    geometry_1.point(vertices_1[2]));
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_tetrahedron_point(const MeshEntity& tetrahedron,
+                                               const Point& point)
+{
+  dolfin_assert(tetrahedron.mesh().topology().dim() == 3);
+
+  // Get the vertices as points
+  const MeshGeometry& geometry = tetrahedron.mesh().geometry();
+  const unsigned int* vertices = tetrahedron.entities(0);
+
+  return collides_tetrahedron_point(geometry.point(vertices[0]),
+				    geometry.point(vertices[1]),
+				    geometry.point(vertices[2]),
+				    geometry.point(vertices[3]),
+				    point);
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_tetrahedron_triangle(const MeshEntity& tetrahedron,
+                                                  const MeshEntity& triangle)
+{
+  dolfin_assert(tetrahedron.mesh().topology().dim() == 3);
+  dolfin_assert(triangle.mesh().topology().dim() == 2);
+
+  // Get the vertices of the tetrahedron as points
+  const MeshGeometry& geometry_tet = tetrahedron.mesh().geometry();
+  const unsigned int* vertices_tet = tetrahedron.entities(0);
+
+  // Get the vertices of the triangle as points
+  const MeshGeometry& geometry_tri = triangle.mesh().geometry();
+  const unsigned int* vertices_tri = triangle.entities(0);
+
+  return collides_tetrahedron_triangle(geometry_tet.point(vertices_tet[0]),
+				       geometry_tet.point(vertices_tet[1]),
+				       geometry_tet.point(vertices_tet[2]),
+				       geometry_tet.point(vertices_tet[3]),
+				       geometry_tri.point(vertices_tri[0]),
+				       geometry_tri.point(vertices_tri[1]),
+				       geometry_tri.point(vertices_tri[2]));
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_tetrahedron_tetrahedron
+(const MeshEntity& tetrahedron_0,
+ const MeshEntity& tetrahedron_1)
+{
+  // This algorithm checks whether two tetrahedra intersect.
+
+  // Algorithm and source code from Fabio Ganovelli, Federico Ponchio
+  // and Claudio Rocchini: Fast Tetrahedron-Tetrahedron Overlap
+  // Algorithm, Journal of Graphics Tools, 7(2), 2002. DOI:
+  // 10.1080/10867651.2002.10487557. Source code available at
+  // http://web.archive.org/web/20031130075955/http://www.acm.org/jgt/papers/GanovelliPonchioRocchini02/tet_a_tet.html
+
+  dolfin_assert(tetrahedron_0.mesh().topology().dim() == 3);
+  dolfin_assert(tetrahedron_1.mesh().topology().dim() == 3);
+
+  // Get the vertices as points
+  const MeshGeometry& geometry = tetrahedron_0.mesh().geometry();
+  const unsigned int* vertices = tetrahedron_0.entities(0);
+  const MeshGeometry& geometry_q = tetrahedron_1.mesh().geometry();
+  const unsigned int* vertices_q = tetrahedron_1.entities(0);
+  std::vector<Point> V1(4), V2(4);
+  for (std::size_t i = 0; i < 4; ++i)
+  {
+    V1[i] = geometry.point(vertices[i]);
+    V2[i] = geometry_q.point(vertices_q[i]);
+  }
+
+  // Get the vectors between V2 and V1[0]
+  std::vector<Point> P_V1(4);
+  for (std::size_t i = 0; i < 4; ++i)
+    P_V1[i] = V2[i]-V1[0];
+
+  // Data structure for edges of V1 and V2
+  std::vector<Point> e_v1(5), e_v2(5);
+  e_v1[0] = V1[1] - V1[0];
+  e_v1[1] = V1[2] - V1[0];
+  e_v1[2] = V1[3] - V1[0];
+  Point n = e_v1[1].cross(e_v1[0]);
+
+  // Maybe flip normal. Normal should be outward.
+  if (n.dot(e_v1[2]) > 0)
+    n *= -1;
+  std::vector<int> masks(4);
+  std::vector<std::vector<double> > Coord_1(4, std::vector<double>(4));
+  if (separating_plane_face_A_1(P_V1, n, Coord_1[0], masks[0]))
+    return false;
+  n = e_v1[0].cross(e_v1[2]);
+
+  // Maybe flip normal
+  if (n.dot(e_v1[1]) > 0)
+    n *= -1;
+  if (separating_plane_face_A_1(P_V1, n, Coord_1[1], masks[1]))
+    return false;
+  if (separating_plane_edge_A(Coord_1, masks, 0, 1))
+    return false;
+  n = e_v1[2].cross(e_v1[1]);
+
+  // Maybe flip normal
+  if (n.dot(e_v1[0]) > 0)
+    n *= -1;
+  if (separating_plane_face_A_1(P_V1, n, Coord_1[2], masks[2]))
+    return false;
+  if (separating_plane_edge_A(Coord_1, masks, 0, 2))
+    return false;
+  if (separating_plane_edge_A(Coord_1, masks, 1,2))
+    return false;
+  e_v1[4] = V1[3] - V1[1];
+  e_v1[3] = V1[2] - V1[1];
+  n = e_v1[3].cross(e_v1[4]);
+
+  // Maybe flip normal. Note the < since e_v1[0]=v1-v0.
+  if (n.dot(e_v1[0]) < 0)
+    n *= -1;
+  if (separating_plane_face_A_2(V1, V2, n, Coord_1[3], masks[3]))
+    return false;
+  if (separating_plane_edge_A(Coord_1, masks, 0, 3))
+    return false;
+  if (separating_plane_edge_A(Coord_1, masks, 1, 3))
+    return false;
+  if (separating_plane_edge_A(Coord_1, masks, 2, 3))
+    return false;
+  if ((masks[0] | masks[1] | masks[2] | masks[3] )!= 15)
+    return true;
+
+  // From now on, if there is a separating plane, it is parallel to a
+  // face of b.
+  std::vector<Point> P_V2(4);
+  for (std::size_t i = 0; i < 4; ++i)
+    P_V2[i] = V1[i] - V2[0];
+  e_v2[0] = V2[1] - V2[0];
+  e_v2[1] = V2[2] - V2[0];
+  e_v2[2] = V2[3] - V2[0];
+  n = e_v2[1].cross(e_v2[0]);
+
+  // Maybe flip normal
+  if (n.dot(e_v2[2])>0)
+    n *= -1;
+  if (separating_plane_face_B_1(P_V2, n))
+    return false;
+  n=e_v2[0].cross(e_v2[2]);
+
+  // Maybe flip normal
+  if (n.dot(e_v2[1]) > 0)
+    n *= -1;
+  if (separating_plane_face_B_1(P_V2, n))
+    return false;
+  n = e_v2[2].cross(e_v2[1]);
+
+  // Maybe flip normal
+  if (n.dot(e_v2[0]) > 0)
+    n *= -1;
+  if (separating_plane_face_B_1(P_V2, n))
+    return false;
+  e_v2[4] = V2[3] - V2[1];
+  e_v2[3] = V2[2] - V2[1];
+  n = e_v2[3].cross(e_v2[4]);
+
+  // Maybe flip normal. Note the < since e_v2[0] = V2[1] - V2[0].
+  if (n.dot(e_v2[0]) < 0)
+    n *= -1;
+  if (separating_plane_face_B_2(V1, V2, n))
+    return false;
+
+  return true;
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_edge_edge(const Point& a,
+				       const Point& b,
+				       const Point& c,
+				       const Point& d)
+{
+  const double tol = DOLFIN_EPS_LARGE;
+
+  // Check if two edges are the same
+  if ((a - c).norm() < tol and (b - d).norm() < tol)
+    return false;
+  if ((a - d).norm() < tol and (b - c).norm() < tol)
+    return false;
+
+  // Get edges as vectors and compute the normal
+  const Point L1 = b - a;
+  const Point L2 = d - c;
+  const Point n = L1.cross(L2);
+
+  // Check if L1 and L2 are coplanar
+  const Point ca = c - a;
+  if (std::abs(ca.dot(n)) > tol)
+    return false;
+
+  // Find orthogonal plane with normal n1
+  const Point n1 = n.cross(L1);
+  const double n1dotL2 = n1.dot(L2);
+  if (std::abs(n1dotL2) < tol)
+    return false;
+  const double t = n1.dot(a - c) / n1dotL2;
+  if (t <= 0 or t >= 1)
+    return false;
+
+  // Find orthogonal plane with normal n2
+  const Point n2 = n.cross(L2);
+  const double n2dotL1 = n2.dot(L1);
+  if (std::abs(n2dotL1) < tol)
+    return false;
+  const double s = n2.dot(c - a) / n2dotL1;
+  if (s <= 0 or s >= 1)
+    return false;
+
+  return true;
+}
+//-----------------------------------------------------------------------------
+bool CollisionDetection::collides_triangle_point(const Point& p0,
+                                                 const Point& p1,
+                                                 const Point& p2,
+                                                 const Point &point)
+{
+  // Algorithm from http://www.blackpawn.com/texts/pointinpoly/
+  // See also "Real-Time Collision Detection" by Christer Ericson.
+  //
+  // We express AP as a linear combination of the vectors AB and
+  // AC. Point is inside triangle iff AP is a convex combination.
+  //
+  // Note: This function may be optimized if only 2D vectors and inner
+  // products need to be computed.
+
+  // Compute vectors
+  const Point v1 = p1 - p0;
+  const Point v2 = p2 - p0;
+  const Point v = point - p0;
+
+  // Compute entries of linear system
+  const double a11 = v1.dot(v1);
+  const double a12 = v1.dot(v2);
+  const double a22 = v2.dot(v2);
+  const double b1 = v.dot(v1);
+  const double b2 = v.dot(v2);
+
+  // Solve linear system
+  const double inv_det = 1.0 / (a11*a22 - a12*a12);
+  const double x1 = inv_det*( a22*b1 - a12*b2);
+  const double x2 = inv_det*(-a12*b1 + a11*b2);
+
+  // Tolerance for numeric test (using vector v1)
+  const double dx = std::abs(v1.x());
+  const double dy = std::abs(v1.y());
+  const double eps = std::max(DOLFIN_EPS_LARGE, DOLFIN_EPS_LARGE*std::max(dx, dy));
+
+  // Check if point is inside
+  return x1 >= -eps && x2 >= -eps && x1 + x2 <= 1.0 + eps;
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_triangle_triangle(const Point& p0,
+					       const Point& p1,
+					       const Point& p2,
+					       const Point& q0,
+					       const Point& q1,
+					       const Point& q2)
+{
+  // Algorithm and code from Tomas Moller: A Fast Triangle-Triangle
+  // Intersection Test, Journal of Graphics Tools, 2(2), 1997. Source
+  // code is available at
+  // http://fileadmin.cs.lth.se/cs/Personal/Tomas_Akenine-Moller/code/opttritri.txt
+
+  // First check if the triangles are the same. We need to do this
+  // separately if we do _not_ allow for adjacent edges to be
+  // classified as colliding (see the edge_edge_test).
+
+  const Point Vmid = (p0 + p1 + p2) / 3.;
+  const Point Umid = (q0 + q1 + q2) / 3.;
+  if ((Vmid-Umid).norm() < DOLFIN_EPS_LARGE)
+    return true;
+
+  Point E1, E2;
+  Point N1, N2;
+  double d1, d2;
+  double du0, du1, du2, dv0, dv1, dv2;
+  Point D;
+  double isect1[2], isect2[2];
+  double du0du1, du0du2, dv0dv1, dv0dv2;
+  int index;
+  double vp0, vp1, vp2;
+  double up0, up1, up2;
+  double bb, cc, max;
+
+  // Compute plane equation of triangle(p0,p1,p2)
+  E1 = p1-p0;
+  E2 = p2-p0;
+  N1 = E1.cross(E2);
+  d1 = -N1.dot(p0);
+
+  // Plane equation 1: N1.X+d1=0. Put q0,q1,q2 into plane equation 1
+  // to compute signed distances to the plane
+  du0 = N1.dot(q0)+d1;
+  du1 = N1.dot(q1)+d1;
+  du2 = N1.dot(q2)+d1;
+
+  // Coplanarity robustness check
+  if (std::abs(du0) < DOLFIN_EPS_LARGE)
+    du0 = 0.0;
+  if (std::abs(du1) < DOLFIN_EPS_LARGE)
+    du1 = 0.0;
+  if (std::abs(du2) < DOLFIN_EPS_LARGE)
+    du2 = 0.0;
+  du0du1 = du0*du1;
+  du0du2 = du0*du2;
+
+  // Same sign on all of them + not equal 0?
+  if (du0du1>0. && du0du2>0.)
+    return false;
+
+  // Compute plane of triangle (q0,q1,q2)
+  E1 = q1-q0;
+  E2 = q2-q0;
+  N2 = E1.cross(E2);
+  d2 = -N2.dot(q0);
+  // Plane equation 2: N2.X+d2=0. Put p0,p1,p2 into plane equation 2
+  dv0 = N2.dot(p0)+d2;
+  dv1 = N2.dot(p1)+d2;
+  dv2 = N2.dot(p2)+d2;
+
+  // Coplanarity check
+  if (std::abs(dv0) < DOLFIN_EPS_LARGE)
+    dv0 = 0.0;
+  if (std::abs(dv1) < DOLFIN_EPS_LARGE)
+    dv1 = 0.0;
+  if (std::abs(dv2) < DOLFIN_EPS_LARGE)
+    dv2 = 0.0;
+  dv0dv1 = dv0*dv1;
+  dv0dv2 = dv0*dv2;
+
+  // Same sign on all of them + not equal 0 ?
+  if (dv0dv1>0. && dv0dv2>0.)
+    return false;
+
+  // Compute direction of intersection line
+  D = N1.cross(N2);
+
+  // Compute and index to the largest component of D
+  max = (double)std::abs(D[0]);
+  index = 0;
+  bb = (double)std::abs(D[1]);
+  cc = (double)std::abs(D[2]);
+  if (bb > max)
+    max = bb, index = 1;
+  if (cc > max)
+    max = cc, index = 2;
+
+  // This is the simplified projection onto L
+  vp0 = p0[index];
+  vp1 = p1[index];
+  vp2 = p2[index];
+
+  up0 = q0[index];
+  up1 = q1[index];
+  up2 = q2[index];
+
+  // Compute interval for triangle 1
+  double a, b, c, x0, x1;
+  if (compute_intervals(vp0, vp1, vp2, dv0, dv1, dv2, dv0dv1, dv0dv2,
+                        a, b, c, x0, x1))
+    return coplanar_tri_tri(N1, p0, p1, p2, q0, q1, q2);
+
+  // Compute interval for triangle 2
+  double d, e, f, y0, y1;
+  if (compute_intervals(up0, up1, up2, du0, du1, du2, du0du1, du0du2,
+                        d, e, f, y0, y1))
+    return coplanar_tri_tri(N1, p0, p1, p2, q0, q1, q2);
+
+  double xx, yy, xxyy, tmp;
+  xx = x0*x1;
+  yy = y0*y1;
+  xxyy = xx*yy;
+
+  tmp = a*xxyy;
+  isect1[0] = tmp+b*x1*yy;
+  isect1[1] = tmp+c*x0*yy;
+
+  tmp = d*xxyy;
+  isect2[0] = tmp+e*xx*y1;
+  isect2[1] = tmp+f*xx*y0;
+
+  if (isect1[0] > isect1[1])
+    std::swap(isect1[0], isect1[1]);
+  if (isect2[0] > isect2[1])
+    std::swap(isect2[0], isect2[1]);
+
+  if (isect1[1] < isect2[0] ||
+      isect2[1] < isect1[0])
+    return false;
+
+  return true;
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_tetrahedron_point(const Point& p0,
+					       const Point& p1,
+					       const Point& p2,
+					       const Point& p3,
+					       const Point& point)
+{
+  // Algorithm from http://www.blackpawn.com/texts/pointinpoly/
+  // See also "Real-Time Collision Detection" by Christer Ericson.
+  //
+  // We express AP as a linear combination of the vectors AB, AC and
+  // AD. Point is inside triangle iff AP is a convex combination.
+
+  // Compute vectors
+  const Point v1 = p1 - p0;
+  const Point v2 = p2 - p0;
+  const Point v3 = p3 - p0;
+  const Point v = point - p0;
+
+  // Compute entries of linear system
+  const double a11 = v1.dot(v1);
+  const double a12 = v1.dot(v2);
+  const double a13 = v1.dot(v3);
+  const double a22 = v2.dot(v2);
+  const double a23 = v2.dot(v3);
+  const double a33 = v3.dot(v3);
+  const double b1 = v.dot(v1);
+  const double b2 = v.dot(v2);
+  const double b3 = v.dot(v3);
+
+  // Compute subdeterminants
+  const double d11 = a22*a33 - a23*a23;
+  const double d12 = a12*a33 - a23*a13;
+  const double d13 = a12*a23 - a22*a13;
+  const double d22 = a11*a33 - a13*a13;
+  const double d23 = a11*a23 - a12*a13;
+  const double d33 = a11*a22 - a12*a12;
+
+  // Compute inverse of determinant determinant
+  const double inv_det = 1.0 / (a11*d11 - a12*d12 + a13*d13);
+
+  // Solve linear system
+  const double x1 = inv_det*( d11*b1 - d12*b2 + d13*b3);
+  const double x2 = inv_det*(-d12*b1 + d22*b2 - d23*b3);
+  const double x3 = inv_det*( d13*b1 - d23*b2 + d33*b3);
+
+  // Tolerance for numeric test (using vector v1)
+  const double dx = std::abs(v1.x());
+  const double dy = std::abs(v1.y());
+  const double dz = std::abs(v1.z());
+  const double eps = std::max(DOLFIN_EPS_LARGE, DOLFIN_EPS_LARGE*std::max(dx, std::max(dy, dz)));
+
+  // Check if point is inside cell
+  return x1 >= -eps && x2 >= -eps && x3 >= -eps && x1 + x2 + x3 <= 1.0 + eps;
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::collides_tetrahedron_triangle(const Point& p0,
+						  const Point& p1,
+						  const Point& p2,
+						  const Point& p3,
+						  const Point& q0,
+						  const Point& q1,
+						  const Point& q2)
+{
+  // Collision is determined by first if any triangle vertex is inside
+  // the tetrahedron. If not, we continue checking the intersection of
+  // the triangle with the four faces of the tetrahedron.
+
+  // Triangle vertex in tetrahedron collision
+  if (collides_tetrahedron_point(p0, p1, p2, p3, q0))
+    return true;
+  if (collides_tetrahedron_point(p0, p1, p2, p3, q1))
+    return true;
+  if (collides_tetrahedron_point(p0, p1, p2, p3, q2))
+    return true;
+
+  // Triangle-triangle collision tests
+  if (collides_triangle_triangle(q0, q1, q2, p1, p2, p3))
+    return true;
+  if (collides_triangle_triangle(q0, q1, q2, p0, p2, p3))
+    return true;
+  if (collides_triangle_triangle(q0, q1, q2, p0, p1, p3))
+    return true;
+  if (collides_triangle_triangle(q0, q1, q2, p0, p1, p2))
+    return true;
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool CollisionDetection::edge_edge_test(int i0,
+                                        int i1,
+                                        double Ax,
+                                        double Ay,
+					const Point& V0,
+					const Point& U0,
+					const Point& U1)
+{
+  // Helper function for triangle triangle collision. Test edge vs
+  // edge.
+
+  // Here we have the option of classifying adjacent edges of two
+  // triangles as colliding by changing > to >= and < to <= below.
+
+  const double Bx = U0[i0] - U1[i0];
+  const double By = U0[i1] - U1[i1];
+  const double Cx = V0[i0] - U0[i0];
+  const double Cy = V0[i1] - U0[i1];
+  const double f = Ay*Bx - Ax*By;
+  const double d = By*Cx - Bx*Cy;
+
+  if ((f > 0 && d >= 0 && d <= f) ||
+      (f < 0 && d <= 0 && d >= f))
+  {
+    const double e = Ax*Cy - Ay*Cx;
+    if (f > 0)
+    {
+      // Allow or not allow adjacent edges as colliding:
+      //if (e >= 0 && e <= f) return true;
+      if (e > 0 && e < f)
+        return true;
+    }
+    else
+    {
+      // Allow or not allow adjacent edges as colliding:
+      //if (e <= 0 && e >= f) return true;
+      if (e < 0 && e > f)
+        return true;
+    }
+  }
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool CollisionDetection::edge_against_tri_edges(int i0,
+                                                int i1,
+						const Point& V0,
+						const Point& V1,
+						const Point& U0,
+						const Point& U1,
+						const Point& U2)
+{
+  // Helper function for triangle triangle collision
+  const double Ax = V1[i0] - V0[i0];
+  const double Ay = V1[i1] - V0[i1];
+
+  // Test edge U0,U1 against V0,V1
+  if (edge_edge_test(i0, i1, Ax, Ay, V0, U0, U1))
+    return true;
+
+  // Test edge U1,U2 against V0,V1
+  if (edge_edge_test(i0, i1, Ax, Ay, V0, U1, U2))
+    return true;
+
+  // Test edge U2,U1 against V0,V1
+  if (edge_edge_test(i0, i1, Ax, Ay, V0, U2, U0))
+    return true;
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool CollisionDetection::point_in_tri(int i0,
+                                      int i1,
+				      const Point& V0,
+				      const Point& U0,
+				      const Point& U1,
+				      const Point& U2)
+{
+  // Helper function for triangle triangle collision
+  // Is T1 completly inside T2?
+  // Check if V0 is inside tri(U0,U1,U2)
+  double a = U1[i1] - U0[i1];
+  double b = -(U1[i0] - U0[i0]);
+  double c = -a*U0[i0] - b*U0[i1];
+  const double d0 = a*V0[i0] + b*V0[i1] + c;
+
+  a = U2[i1] - U1[i1];
+  b = -(U2[i0] - U1[i0]);
+  c = -a*U1[i0] - b*U1[i1];
+  const double d1 = a*V0[i0] + b*V0[i1] + c;
+
+  a = U0[i1] - U2[i1];
+  b = -(U0[i0] - U2[i0]);
+  c = -a*U2[i0] - b*U2[i1];
+  const double d2 = a*V0[i0] + b*V0[i1] + c;
+
+  if (d0*d1 > 0.)
+  {
+    if (d0*d2 > 0.)
+      return true;
+  }
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool CollisionDetection::coplanar_tri_tri(const Point& N,
+					  const Point& V0,
+					  const Point& V1,
+					  const Point& V2,
+					  const Point& U0,
+					  const Point& U1,
+					  const Point& U2)
+{
+  // Helper function for triangle triangle collision
+
+  double A[3];
+  int i0,i1;
+
+  // First project onto an axis-aligned plane, that maximizes the area
+  // of the triangles, compute indices: i0,i1.
+  A[0] = std::abs(N[0]);
+  A[1] = std::abs(N[1]);
+  A[2] = std::abs(N[2]);
+
+  if (A[0] > A[1])
+  {
+    if (A[0] > A[2])
+    {
+      i0 = 1;      // A[0] is greatest
+      i1 = 2;
+    }
+    else
+    {
+      i0 = 0;      // A[2] is greatest
+      i1 = 1;
+    }
+  }
+  else   // A[0]<=A[1]
+  {
+    if (A[2] > A[1])
+    {
+      i0 = 0;      // A[2] is greatest
+      i1 = 1;
+    }
+    else
+    {
+      i0 = 0;      // A[1] is greatest
+      i1 = 2;
+    }
+  }
+
+  // Test all edges of triangle 1 against the edges of triangle 2
+  if (edge_against_tri_edges(i0, i1, V0, V1, U0, U1, U2))
+    return true;
+  if (edge_against_tri_edges(i0, i1, V1, V2, U0, U1, U2))
+    return true;
+  if (edge_against_tri_edges(i0, i1, V2, V0, U0, U1, U2))
+    return true;
+
+  // Finally, test if tri1 is totally contained in tri2 or vice versa
+  if (point_in_tri(i0, i1, V0, U0, U1, U2))
+    return true;
+  if (point_in_tri(i0, i1, U0, V0, V1, V2))
+    return true;
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool CollisionDetection::compute_intervals(double VV0,
+					   double VV1,
+					   double VV2,
+					   double D0,
+					   double D1,
+					   double D2,
+					   double D0D1,
+					   double D0D2,
+					   double& A,
+					   double& B,
+					   double& C,
+					   double& X0,
+					   double& X1)
+{
+  // Helper function for triangle triangle collision
+
+  if (D0D1 > 0.)
+  {
+    // Here we know that D0D2<=0.0, that is D0, D1 are on the same
+    // side, D2 on the other or on the plane
+    A = VV2;
+    B = (VV0 - VV2)*D2;
+    C = (VV1 - VV2)*D2;
+    X0 = D2 - D0;
+    X1 = D2 - D1;
+  }
+  else if (D0D2 > 0.)
+  {
+    // Here we know that d0d1<=0.0
+    A = VV1;
+    B = (VV0 - VV1)*D1;
+    C = (VV2 - VV1)*D1;
+    X0 = D1 - D0;
+    X1 = D1 - D2;
+  }
+  else if (D1*D2 > 0. || D0 != 0.)
+  {
+    // Here we know that d0d1<=0.0 or that D0!=0.0
+    A = VV0;
+    B = (VV1 - VV0)*D0;
+    C = (VV2 - VV0)*D0;
+    X0 = D0 - D1;
+    X1 = D0 - D2;
+  }
+  else if (D1 != 0.)
+  {
+    A = VV1;
+    B = (VV0 - VV1)*D1;
+    C = (VV2 - VV1)*D1;
+    X0 = D1 - D0;
+    X1 = D1 - D2;
+  }
+  else if (D2 != 0.)
+  {
+    A = VV2;
+    B = (VV0 - VV2)*D2;
+    C = (VV1 - VV2)*D2;
+    X0 = D2 - D0;
+    X1 = D2 - D1;
+  }
+  else {
+    // Go to coplanar test
+    return true;
+  }
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::separating_plane_face_A_1(const std::vector<Point>& pv1,
+					      const Point& n,
+					      std::vector<double>& coord,
+					      int&  mask_edges)
+{
+  // Helper function for tetrahedron-tetrahedron collision test:
+  // checks if plane pv1 is a separating plane. Stores local
+  // coordinates and the mask bit mask_edges.
+
+  mask_edges = 0;
+  const int shifts[4] = {1, 2, 4, 8};
+
+  for (std::size_t i = 0; i < 4; ++i)
+  {
+    coord[i] = pv1[i].dot(n);
+    if (coord[i] > 0)
+      mask_edges |= shifts[i];
+  }
+
+  return (mask_edges == 15);
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::separating_plane_face_A_2(const std::vector<Point>& V1,
+					      const std::vector<Point>& V2,
+					      const Point& n,
+					      std::vector<double>& coord,
+					      int&  mask_edges)
+{
+  // Helper function for tetrahedron-tetrahedron collision test:
+  // checks if plane v1,v2 is a separating plane. Stores local
+  // coordinates and the mask bit mask_edges.
+
+  mask_edges = 0;
+  const int shifts[4] = {1, 2, 4, 8};
+
+  for (std::size_t i = 0; i < 4; ++i)
+  {
+    coord[i] = (V2[i] - V1[1]).dot(n);
+    if (coord[i] > 0)
+      mask_edges |= shifts[i];
+  }
+
+  return (mask_edges == 15);
+}
+//-----------------------------------------------------------------------------
+bool
+CollisionDetection::separating_plane_edge_A
+(const std::vector<std::vector<double> >& coord_1,
+ const std::vector<int>& masks,
+ int f0,
+ int f1)
+{
+  // Helper function for tetrahedron-tetrahedron collision: checks if
+  // edge is in the plane separating faces f0 and f1.
+
+  const std::vector<double>& coord_f0 = coord_1[f0];
+  const std::vector<double>& coord_f1 = coord_1[f1];
+
+  int maskf0 = masks[f0];
+  int maskf1 = masks[f1];
+
+  if ((maskf0 | maskf1) != 15) // if there is a vertex of b
+    return false; // included in (-,-) return false
+
+  maskf0 &= (maskf0 ^ maskf1); // exclude the vertices in (+,+)
+  maskf1 &= (maskf0 ^ maskf1);
+
+  // edge 0: 0--1
+  if ((maskf0 & 1) && // the vertex 0 of b is in (-,+)
+      (maskf1 & 2)) // the vertex 1 of b is in (+,-)
+    if ((coord_f0[1]*coord_f1[0] - coord_f0[0]*coord_f1[1]) > 0)
+      // the edge of b (0,1) intersect (-,-) (see the paper)
+      return false;
+
+  if ((maskf0 & 2) &&
+      (maskf1 & 1))
+    if ((coord_f0[1]*coord_f1[0] - coord_f0[0]*coord_f1[1]) < 0)
+      return false;
+
+  // edge 1: 0--2
+  if ((maskf0 & 1) &&
+      (maskf1 & 4))
+    if ((coord_f0[2]*coord_f1[0] - coord_f0[0]*coord_f1[2]) > 0)
+      return false;
+
+  if ((maskf0 & 4) &&
+      (maskf1 & 1))
+    if ((coord_f0[2]*coord_f1[0] - coord_f0[0]*coord_f1[2]) < 0)
+      return false;
+
+  // edge 2: 0--3
+  if ((maskf0 & 1) &&
+      (maskf1 & 8))
+    if ((coord_f0[3]*coord_f1[0] - coord_f0[0]*coord_f1[3]) > 0)
+      return false;
+
+  if ((maskf0 & 8) &&
+      (maskf1 & 1))
+    if ((coord_f0[3]*coord_f1[0] - coord_f0[0]*coord_f1[3]) < 0)
+      return false;
+
+  // edge 3: 1--2
+  if ((maskf0 & 2) &&
+      (maskf1 & 4))
+    if ((coord_f0[2]*coord_f1[1] - coord_f0[1]*coord_f1[2]) > 0)
+      return false;
+
+  if ((maskf0 & 4) &&
+      (maskf1 & 2))
+    if ((coord_f0[2]*coord_f1[1] - coord_f0[1]*coord_f1[2]) < 0)
+      return false;
+
+  // edge 4: 1--3
+  if ((maskf0 & 2) &&
+      (maskf1 & 8))
+    if ((coord_f0[3]*coord_f1[1] - coord_f0[1]*coord_f1[3]) > 0)
+      return false;
+
+  if ((maskf0 & 8) &&
+      (maskf1 & 2))
+    if ((coord_f0[3]*coord_f1[1] - coord_f0[1]*coord_f1[3]) < 0)
+      return false;
+
+  // edge 5: 2--3
+  if ((maskf0 & 4) &&
+      (maskf1 & 8))
+    if ((coord_f0[3]*coord_f1[2] - coord_f0[2]*coord_f1[3]) > 0)
+      return false;
+
+  if ((maskf0 & 8) &&
+      (maskf1 & 4))
+    if ((coord_f0[3]*coord_f1[2] - coord_f0[2]*coord_f1[3]) < 0)
+      return false;
+
+  // Now there exists a separating plane supported by the edge shared
+  // by f0 and f1.
+  return true;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/CollisionDetection.h b/dolfin/geometry/CollisionDetection.h
new file mode 100644
index 0000000..229f1f8
--- /dev/null
+++ b/dolfin/geometry/CollisionDetection.h
@@ -0,0 +1,303 @@
+// Copyright (C) 2014 Anders Logg and August Johansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2014-02-03
+// Last changed: 2014-02-24
+
+#include <vector>
+#include <dolfin/log/log.h>
+
+#ifndef __COLLISION_DETECTION_H
+#define __COLLISION_DETECTION_H
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class MeshEntity;
+
+  /// This class implements algorithms for detecting pairwise
+  /// collisions between mesh entities of varying dimensions.
+
+  class CollisionDetection
+  {
+  public:
+
+    /// Check whether entity collides with point.
+    ///
+    /// *Arguments*
+    ///     entity (_MeshEntity_)
+    ///         The entity.
+    ///     point (_Point_)
+    ///         The point.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff entity collides with cell.
+    static bool collides(const MeshEntity& entity,
+			 const Point& point);
+
+    /// Check whether two entities collide.
+    ///
+    /// *Arguments*
+    ///     entity_0 (_MeshEntity_)
+    ///         The first entity.
+    ///     entity_1 (_MeshEntity_)
+    ///         The second entity.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff entity collides with cell.
+    static bool collides(const MeshEntity& entity_0,
+			 const MeshEntity& entity_1);
+
+    /// Check whether interval collides with point.
+    ///
+    /// *Arguments*
+    ///     interval (_MeshEntity_)
+    ///         The interval.
+    ///     point (_Point_)
+    ///         The point.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff objects collide.
+    static bool collides_interval_point(const MeshEntity& interval,
+					const Point& point);
+
+    /// Check whether interval collides with interval.
+    ///
+    /// *Arguments*
+    ///     interval_0 (_MeshEntity_)
+    ///         The first interval.
+    ///     interval_1 (_MeshEntity_)
+    ///         The second interval.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff objects collide.
+    static bool collides_interval_interval(const MeshEntity& interval_0,
+					   const MeshEntity& interval_1);
+
+    /// Check whether triangle collides with point.
+    ///
+    /// *Arguments*
+    ///     triangle (_MeshEntity_)
+    ///         The triangle.
+    ///     point (_Point_)
+    ///         The point.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff objects collide.
+    static bool collides_triangle_point(const MeshEntity& triangle,
+					const Point& point);
+
+    /// Check whether triangle collides with triangle.
+    ///
+    /// *Arguments*
+    ///     triangle_0 (_MeshEntity_)
+    ///         The first triangle.
+    ///     triangle_1 (_MeshEntity_)
+    ///         The second triangle.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff objects collide.
+    static bool collides_triangle_triangle(const MeshEntity& triangle_0,
+					   const MeshEntity& triangle_1);
+
+    /// Check whether tetrahedron collides with point.
+    ///
+    /// *Arguments*
+    ///     tetrahedron (_MeshEntity_)
+    ///         The tetrahedron.
+    ///     point (_Point_)
+    ///         The point.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff objects collide.
+    static bool collides_tetrahedron_point(const MeshEntity& tetrahedron,
+                                           const Point& point);
+
+    /// Check whether tetrahedron collides with triangle.
+    ///
+    /// *Arguments*
+    ///     tetrahedron (_MeshEntity_)
+    ///         The tetrahedron.
+    ///     triangle (_MeshEntity_)
+    ///         The triangle.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff objects collide.
+    static bool collides_tetrahedron_triangle(const MeshEntity& tetrahedron,
+                                              const MeshEntity& triangle);
+
+    /// Check whether tetrahedron collides with tetrahedron.
+    ///
+    /// *Arguments*
+    ///     tetrahedron_0 (_MeshEntity_)
+    ///         The first tetrahedron.
+    ///     tetrahedron_1 (_MeshEntity_)
+    ///         The second tetrahedron.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff objects collide.
+    static bool collides_tetrahedron_tetrahedron(const MeshEntity& tetrahedron_0,
+                                                 const MeshEntity& tetrahedron_1);
+
+    /// Check whether edge a-b collides with edge c-d.
+    static bool collides_edge_edge(const Point& a, const Point& b,
+				   const Point& c, const Point& d);
+
+  private:
+
+    // The implementation of collides_triangle_point
+    static bool collides_triangle_point(const Point& p0,
+					const Point& p1,
+					const Point& p2,
+					const Point& point);
+
+    // The implementation of collides_triangle_triangle
+    static bool collides_triangle_triangle(const Point& p0,
+					   const Point& p1,
+					   const Point& p2,
+					   const Point& q0,
+					   const Point& q1,
+					   const Point& q2);
+
+    // The implementation of collides_tetrahedron_point
+    static bool collides_tetrahedron_point(const Point& p0,
+					   const Point& p1,
+					   const Point& p2,
+					   const Point& p3,
+					   const Point& point);
+
+    // The implementation of collides_tetrahedron_triangle
+    static bool collides_tetrahedron_triangle(const Point& p0,
+					      const Point& p1,
+					      const Point& p2,
+					      const Point& p3,
+					      const Point& q0,
+					      const Point& q1,
+					      const Point& q2);
+
+    // Helper function for triangle-triangle collision
+    static bool edge_edge_test(int i0,
+                               int i1,
+                               double Ax,
+                               double Ay,
+			       const Point& V0,
+			       const Point& U0,
+			       const Point& U1);
+
+    // Helper function for triangle-triangle collision
+    static bool edge_against_tri_edges(int i0,
+                                       int i1,
+				       const Point& V0,
+				       const Point& V1,
+				       const Point& U0,
+				       const Point& U1,
+				       const Point& U2);
+
+    // Helper function for triangle-triangle collision
+    static bool point_in_tri(int i0,
+                             int i1,
+			     const Point& V0,
+			     const Point& U0,
+			     const Point& U1,
+			     const Point& U2);
+
+    // Helper function for triangle-triangle collision
+    static bool coplanar_tri_tri(const Point& N,
+				 const Point& V0,
+				 const Point& V1,
+				 const Point& V2,
+				 const Point& U0,
+				 const Point& U1,
+				 const Point& U2);
+
+    // Helper function for triangle-triangle collision
+    static bool compute_intervals(double VV0,
+                                  double VV1,
+                                  double VV2,
+				  double D0,
+                                  double D1,
+                                  double D2,
+				  double D0D1,
+                                  double D0D2,
+				  double& A,
+                                  double& B,
+                                  double& C,
+				  double& X0,
+                                  double& X1);
+
+    // Helper function for collides_tetrahedron_tetrahedron: checks if
+    // plane pv1 is a separating plane. Stores local coordinates bc
+    // and the mask bit mask_edges.
+    static bool separating_plane_face_A_1(const std::vector<Point>& pv1,
+					  const Point& n,
+					  std::vector<double>& bc,
+					  int& mask_edges);
+
+    // Helper function for collides_tetrahedron_tetrahedron: checks if
+    // plane v1, v2 is a separating plane. Stores local coordinates bc
+    // and the mask bit mask_edges.
+    static bool separating_plane_face_A_2(const std::vector<Point>& v1,
+					  const std::vector<Point>& v2,
+					  const Point& n,
+					  std::vector<double>& bc,
+					  int& mask_edges);
+
+    // Helper function for collides_tetrahedron_tetrahedron: checks if
+    // plane pv2 is a separating plane.
+    static bool separating_plane_face_B_1(const std::vector<Point>& P_V2,
+					  const Point& n)
+    {
+      return ((P_V2[0].dot(n) > 0) &&
+	      (P_V2[1].dot(n) > 0) &&
+	      (P_V2[2].dot(n) > 0) &&
+	      (P_V2[3].dot(n) > 0));
+    }
+
+    // Helper function for collides_tetrahedron_tetrahedron: checks if
+    // plane v1, v2 is a separating plane.
+    static bool separating_plane_face_B_2(const std::vector<Point>& V1,
+					  const std::vector<Point>& V2,
+					  const Point& n)
+    {
+      return (((V1[0] - V2[1]).dot(n) > 0) &&
+	      ((V1[1] - V2[1]).dot(n) > 0) &&
+	      ((V1[2] - V2[1]).dot(n) > 0) &&
+	      ((V1[3] - V2[1]).dot(n) > 0));
+    }
+
+    // Helper function for collides_tetrahedron_tetrahedron: checks if
+    // edge is in the plane separating faces f0 and f1.
+    static bool separating_plane_edge_A(const std::vector<std::vector<double> >& coord_1,
+					const std::vector<int>& masks,
+					int f0,
+					int f1);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/GenericBoundingBoxTree.cpp b/dolfin/geometry/GenericBoundingBoxTree.cpp
new file mode 100644
index 0000000..49cb9ae
--- /dev/null
+++ b/dolfin/geometry/GenericBoundingBoxTree.cpp
@@ -0,0 +1,727 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-02
+// Last changed: 2014-02-06
+
+// Define a maximum dimension used for a local array in the recursive
+// build function. Speeds things up compared to allocating it in each
+// recursion and is more convenient than sending it around.
+#define MAX_DIM 6
+
+#include <dolfin/geometry/Point.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/MeshEntity.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include "BoundingBoxTree1D.h" // used for internal point search tree
+#include "BoundingBoxTree2D.h" // used for internal point search tree
+#include "BoundingBoxTree3D.h" // used for internal point search tree
+#include "GenericBoundingBoxTree.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+GenericBoundingBoxTree::GenericBoundingBoxTree() : _tdim(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void GenericBoundingBoxTree::build(const Mesh& mesh, std::size_t tdim)
+{
+  // Check dimension
+  if (tdim < 1 or tdim > mesh.topology().dim())
+  {
+    dolfin_error("GenericBoundingBoxTree.cpp",
+                 "compute bounding box tree",
+                 "Dimension must be a number between 1 and %d",
+                 mesh.topology().dim());
+  }
+
+  // Clear existing data if any
+  clear();
+
+  // Store topological dimension (only used for checking that entity
+  // collisions can only be computed with cells)
+  _tdim = tdim;
+
+  // Initialize entities of given dimension if they don't exist
+  mesh.init(tdim);
+
+  // Create bounding boxes for all entities (leaves)
+  const std::size_t _gdim = gdim();
+  const unsigned int num_leaves = mesh.num_entities(tdim);
+  std::vector<double> leaf_bboxes(2*_gdim*num_leaves);
+  for (MeshEntityIterator it(mesh, tdim); !it.end(); ++it)
+    compute_bbox_of_entity(leaf_bboxes.data() + 2*_gdim*it->index(), *it, _gdim);
+
+  // Create leaf partition (to be sorted)
+  std::vector<unsigned int> leaf_partition(num_leaves);
+  for (unsigned int i = 0; i < num_leaves; ++i)
+    leaf_partition[i] = i;
+
+  // Recursively build the bounding box tree from the leaves
+  _build(leaf_bboxes, leaf_partition.begin(), leaf_partition.end(), _gdim);
+
+  log(PROGRESS,
+      "Computed bounding box tree with %d nodes for %d entities.",
+      num_bboxes(), num_leaves);
+}
+//-----------------------------------------------------------------------------
+void GenericBoundingBoxTree::build(const std::vector<Point>& points)
+{
+  // Clear existing data if any
+  clear();
+
+  // Create leaf partition (to be sorted)
+  const unsigned int num_leaves = points.size();
+  std::vector<unsigned int> leaf_partition(num_leaves);
+  for (unsigned int i = 0; i < num_leaves; ++i)
+    leaf_partition[i] = i;
+
+  // Recursively build the bounding box tree from the leaves
+  _build(points, leaf_partition.begin(), leaf_partition.end(), gdim());
+
+  info("Computed bounding box tree with %d nodes for %d points.",
+       num_bboxes(), num_leaves);
+}
+//-----------------------------------------------------------------------------
+std::vector<unsigned int>
+GenericBoundingBoxTree::compute_collisions(const Point& point) const
+{
+  // Call recursive find function
+  std::vector<unsigned int> entities;
+  _compute_collisions(*this, point, num_bboxes() - 1, entities, 0);
+
+  return entities;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+GenericBoundingBoxTree::compute_collisions(const GenericBoundingBoxTree& tree) const
+{
+  // Introduce new variables for clarity
+  const GenericBoundingBoxTree& A(*this);
+  const GenericBoundingBoxTree& B(tree);
+
+  // Create data structures for storing collisions
+  std::vector<unsigned int> entities_A;
+  std::vector<unsigned int> entities_B;
+
+  // Call recursive find function
+  _compute_collisions(A, B,
+                      A.num_bboxes() - 1, B.num_bboxes() - 1,
+                      entities_A, entities_B, 0, 0);
+
+  return std::make_pair(entities_A, entities_B);
+}
+//-----------------------------------------------------------------------------
+std::vector<unsigned int>
+GenericBoundingBoxTree::compute_entity_collisions(const Point& point,
+                                                  const Mesh& mesh) const
+{
+  // Point in entity only implemented for cells. Consider extending this.
+  if (_tdim != mesh.topology().dim())
+  {
+    dolfin_error("GenericBoundingBoxTree.cpp",
+                 "compute collision between point and mesh entities",
+                 "Point-in-entity is only implemented for cells");
+  }
+
+  // Call recursive find function to compute bounding box candidates
+  std::vector<unsigned int> entities;
+  _compute_collisions(*this, point, num_bboxes() - 1, entities, &mesh);
+
+  return entities;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+GenericBoundingBoxTree::compute_entity_collisions(const GenericBoundingBoxTree& tree,
+                                                  const Mesh& mesh_A,
+                                                  const Mesh& mesh_B) const
+{
+  // Introduce new variables for clarity
+  const GenericBoundingBoxTree& A(*this);
+  const GenericBoundingBoxTree& B(tree);
+
+  // Create data structures for storing collisions
+  std::vector<unsigned int> entities_A;
+  std::vector<unsigned int> entities_B;
+
+  // Call recursive find function
+  _compute_collisions(A, B,
+                      A.num_bboxes() - 1, B.num_bboxes() - 1,
+                      entities_A, entities_B, &mesh_A, &mesh_B);
+
+  return std::make_pair(entities_A, entities_B);
+}
+//-----------------------------------------------------------------------------
+unsigned int
+GenericBoundingBoxTree::compute_first_collision(const Point& point) const
+{
+  // Call recursive find function
+  return _compute_first_collision(*this, point, num_bboxes() - 1);
+}
+//-----------------------------------------------------------------------------
+unsigned int
+GenericBoundingBoxTree::compute_first_entity_collision(const Point& point,
+                                                       const Mesh& mesh) const
+{
+  // Point in entity only implemented for cells. Consider extending this.
+  if (_tdim != mesh.topology().dim())
+  {
+    dolfin_error("GenericBoundingBoxTree.cpp",
+                 "compute collision between point and mesh entities",
+                 "Point-in-entity is only implemented for cells");
+  }
+
+  // Call recursive find function
+  return _compute_first_entity_collision(*this, point, num_bboxes() - 1, mesh);
+}
+//-----------------------------------------------------------------------------
+std::pair<unsigned int, double>
+GenericBoundingBoxTree::compute_closest_entity(const Point& point,
+                                               const Mesh& mesh) const
+{
+  // Closest entity only implemented for cells. Consider extending this.
+  if (_tdim != mesh.topology().dim())
+  {
+    dolfin_error("GenericBoundingBoxTree.cpp",
+                 "compute closest entity of point",
+                 "Closest-entity is only implemented for cells");
+  }
+
+  // Compute point search tree if not already done
+  build_point_search_tree(mesh);
+
+  // Search point cloud to get a good starting guess
+  dolfin_assert(_point_search_tree);
+  double r = _point_search_tree->compute_closest_point(point).second;
+
+  // Initialize index and distance to closest entity
+  unsigned int closest_entity = std::numeric_limits<unsigned int>::max();
+  double R2 = r*r;
+
+  // Call recursive find function
+  _compute_closest_entity(*this, point, num_bboxes() - 1,
+                          mesh, closest_entity, R2);
+
+  // Sanity check
+  dolfin_assert(closest_entity < std::numeric_limits<unsigned int>::max());
+
+  std::pair<unsigned int, double> ret(closest_entity, sqrt(R2));
+  return ret;
+}
+//-----------------------------------------------------------------------------
+std::pair<unsigned int, double>
+GenericBoundingBoxTree::compute_closest_point(const Point& point) const
+{
+  // Closest point only implemented for point cloud
+  if (_tdim != 0)
+  {
+    dolfin_error("GenericBoundingBoxTree.cpp",
+                 "compute closest point",
+                 "Search tree has not been built for point cloud");
+  }
+
+  // Note that we don't compute a point search tree here... That would
+  // be weird.
+
+  // Get initial guess by picking the distance to a "random" point
+  unsigned int closest_point = 0;
+  double R2 = compute_squared_distance_point(point.coordinates(),
+                                             closest_point);
+
+  // Call recursive find function
+  _compute_closest_point(*this, point, num_bboxes() - 1, closest_point, R2);
+
+  std::pair<unsigned int, double> ret(closest_point, sqrt(R2));
+  return ret;
+}
+//-----------------------------------------------------------------------------
+// Implementation of protected functions
+//-----------------------------------------------------------------------------
+void GenericBoundingBoxTree::clear()
+{
+  _tdim = 0;
+  _bboxes.clear();
+  _bbox_coordinates.clear();
+  _point_search_tree.reset();
+}
+//-----------------------------------------------------------------------------
+unsigned int
+GenericBoundingBoxTree::_build(const std::vector<double>& leaf_bboxes,
+                               const std::vector<unsigned int>::iterator& begin,
+                               const std::vector<unsigned int>::iterator& end,
+                               std::size_t gdim)
+{
+  dolfin_assert(begin < end);
+
+  // Create empty bounding box data
+  BBox bbox;
+
+  // Reached leaf
+  if (end - begin == 1)
+  {
+    // Get bounding box coordinates for leaf
+    const unsigned int entity_index = *begin;
+    const double* b = leaf_bboxes.data() + 2*gdim*entity_index;
+
+    // Store bounding box data
+    bbox.child_0 = num_bboxes(); // child_0 == node denotes a leaf
+    bbox.child_1 = entity_index; // index of entity contained in leaf
+    return add_bbox(bbox, b, gdim);
+  }
+
+  // Compute bounding box of all bounding boxes
+  double b[MAX_DIM];
+  std::size_t axis;
+  compute_bbox_of_bboxes(b, axis, leaf_bboxes, begin, end);
+
+  // Sort bounding boxes along longest axis
+  std::vector<unsigned int>::iterator middle = begin + (end - begin) / 2;
+  sort_bboxes(axis, leaf_bboxes, begin, middle, end);
+
+  // Split bounding boxes into two groups and call recursively
+  bbox.child_0 = _build(leaf_bboxes, begin, middle, gdim);
+  bbox.child_1 = _build(leaf_bboxes, middle, end, gdim);
+
+  // Store bounding box data. Note that root box will be added last.
+  return add_bbox(bbox, b, gdim);
+}
+//-----------------------------------------------------------------------------
+unsigned int
+GenericBoundingBoxTree::_build(const std::vector<Point>& points,
+                               const std::vector<unsigned int>::iterator& begin,
+                               const std::vector<unsigned int>::iterator& end,
+                               std::size_t gdim)
+{
+  dolfin_assert(begin < end);
+
+  // Create empty bounding box data
+  BBox bbox;
+
+  // Reached leaf
+  if (end - begin == 1)
+  {
+    // Store bounding box data
+    const unsigned int point_index = *begin;
+    bbox.child_0 = num_bboxes(); // child_0 == node denotes a leaf
+    bbox.child_1 = point_index;  // index of entity contained in leaf
+    return add_point(bbox, points[point_index], gdim);
+  }
+
+  // Compute bounding box of all points
+  double b[MAX_DIM];
+  std::size_t axis;
+  compute_bbox_of_points(b, axis, points, begin, end);
+
+  // Sort bounding boxes along longest axis
+  std::vector<unsigned int>::iterator middle = begin + (end - begin) / 2;
+  sort_points(axis, points, begin, middle, end);
+
+  // Split bounding boxes into two groups and call recursively
+  bbox.child_0 = _build(points, begin, middle, gdim);
+  bbox.child_1 = _build(points, middle, end, gdim);
+
+  // Store bounding box data. Note that root box will be added last.
+  return add_bbox(bbox, b, gdim);
+}
+//-----------------------------------------------------------------------------
+void
+GenericBoundingBoxTree::_compute_collisions(const GenericBoundingBoxTree& tree,
+                                            const Point& point,
+                                            unsigned int node,
+                                            std::vector<unsigned int>& entities,
+                                            const Mesh* mesh)
+{
+  // Get bounding box for current node
+  const BBox& bbox = tree.get_bbox(node);
+
+  // If point is not in bounding box, then don't search further
+  if (!tree.point_in_bbox(point.coordinates(), node))
+    return;
+
+  // If box is a leaf (which we know contains the point), then add it
+  else if (tree.is_leaf(bbox, node))
+  {
+    // child_1 denotes entity for leaves
+    const unsigned int entity_index = bbox.child_1;
+
+    // If we have a mesh, check that the candidate is really a collision
+    if (mesh)
+    {
+      // Get cell
+      Cell cell(*mesh, entity_index);
+      if (cell.collides(point))
+        entities.push_back(entity_index);
+    }
+
+    // Otherwise, add the candidate
+    else
+      entities.push_back(entity_index);
+  }
+
+  // Check both children
+  else
+  {
+    _compute_collisions(tree, point, bbox.child_0, entities, mesh);
+    _compute_collisions(tree, point, bbox.child_1, entities, mesh);
+  }
+}
+//-----------------------------------------------------------------------------
+void
+GenericBoundingBoxTree::_compute_collisions(const GenericBoundingBoxTree& A,
+                                            const GenericBoundingBoxTree& B,
+                                            unsigned int node_A,
+                                            unsigned int node_B,
+                                            std::vector<unsigned int>& entities_A,
+                                            std::vector<unsigned int>& entities_B,
+                                            const Mesh* mesh_A,
+                                            const Mesh* mesh_B)
+{
+  // Get bounding boxes for current nodes
+  const BBox& bbox_A = A.get_bbox(node_A);
+  const BBox& bbox_B = B.get_bbox(node_B);
+
+  // If bounding boxes don't collide, then don't search further
+  if (!B.bbox_in_bbox(A.get_bbox_coordinates(node_A), node_B))
+    return;
+
+  // Check whether we've reached a leaf in A or B
+  const bool is_leaf_A = A.is_leaf(bbox_A, node_A);
+  const bool is_leaf_B = B.is_leaf(bbox_B, node_B);
+
+  // If both boxes are leaves (which we know collide), then add them
+  if (is_leaf_A && is_leaf_B)
+  {
+    // child_1 denotes entity for leaves
+    const unsigned int entity_index_A = bbox_A.child_1;
+    const unsigned int entity_index_B = bbox_B.child_1;
+
+    // If we have a mesh, check that the candidate is really a collision
+    if (mesh_A)
+    {
+      dolfin_assert(mesh_B);
+      Cell cell_A(*mesh_A, entity_index_A);
+      Cell cell_B(*mesh_B, entity_index_B);
+      if (cell_A.collides(cell_B))
+      {
+        entities_A.push_back(entity_index_A);
+        entities_B.push_back(entity_index_B);
+      }
+    }
+
+    // Otherwise, add the candidate
+    else
+    {
+      entities_A.push_back(entity_index_A);
+      entities_B.push_back(entity_index_B);
+    }
+  }
+
+  // If we reached the leaf in A, then descend B
+  else if (is_leaf_A)
+  {
+    _compute_collisions(A, B, node_A, bbox_B.child_0,
+                        entities_A, entities_B, mesh_A, mesh_B);
+    _compute_collisions(A, B, node_A, bbox_B.child_1,
+                        entities_A, entities_B, mesh_A, mesh_B);
+  }
+
+  // If we reached the leaf in B, then descend A
+  else if (is_leaf_B)
+  {
+    _compute_collisions(A, B, bbox_A.child_0, node_B,
+                        entities_A, entities_B, mesh_A, mesh_B);
+    _compute_collisions(A, B, bbox_A.child_1, node_B,
+                        entities_A, entities_B, mesh_A, mesh_B);
+  }
+
+  // At this point, we know neither is a leaf so descend the largest
+  // tree first. Note that nodes are added in reverse order with the
+  // top bounding box at the end so the largest tree (the one with the
+  // the most boxes left to traverse) has the largest node number.
+  else if (node_A > node_B)
+  {
+    _compute_collisions(A, B, bbox_A.child_0, node_B,
+                        entities_A, entities_B, mesh_A, mesh_B);
+    _compute_collisions(A, B, bbox_A.child_1, node_B,
+                        entities_A, entities_B, mesh_A, mesh_B);
+  }
+  else
+  {
+    _compute_collisions(A, B, node_A, bbox_B.child_0,
+                        entities_A, entities_B, mesh_A, mesh_B);
+    _compute_collisions(A, B, node_A, bbox_B.child_1,
+                        entities_A, entities_B, mesh_A, mesh_B);
+  }
+
+  // Note that cases above can be collected in fewer cases but this
+  // way the logic is easier to follow.
+}
+//-----------------------------------------------------------------------------
+unsigned int
+GenericBoundingBoxTree::_compute_first_collision(const GenericBoundingBoxTree& tree,
+                                                 const Point& point,
+                                                 unsigned int node)
+{
+  // Get max integer to signify not found
+  unsigned int not_found = std::numeric_limits<unsigned int>::max();
+
+  // Get bounding box for current node
+  const BBox& bbox = tree.get_bbox(node);
+
+  // If point is not in bounding box, then don't search further
+  if (!tree.point_in_bbox(point.coordinates(), node))
+    return not_found;
+
+  // If box is a leaf (which we know contains the point), then return it
+  else if (tree.is_leaf(bbox, node))
+    return bbox.child_1; // child_1 denotes entity for leaves
+
+  // Check both children
+  else
+  {
+    unsigned int c0 = _compute_first_collision(tree, point, bbox.child_0);
+    if (c0 != not_found)
+      return c0;
+
+    // Check second child
+    unsigned int c1 = _compute_first_collision(tree, point, bbox.child_1);
+    if (c1 != not_found)
+      return c1;
+  }
+
+  // Point not found
+  return not_found;
+}
+//-----------------------------------------------------------------------------
+unsigned int
+GenericBoundingBoxTree::_compute_first_entity_collision(const GenericBoundingBoxTree& tree,
+                                                        const Point& point,
+                                                        unsigned int node,
+                                                        const Mesh& mesh)
+{
+  // Get max integer to signify not found
+  unsigned int not_found = std::numeric_limits<unsigned int>::max();
+
+  // Get bounding box for current node
+  const BBox& bbox = tree.get_bbox(node);
+
+  // If point is not in bounding box, then don't search further
+  if (!tree.point_in_bbox(point.coordinates(), node))
+    return not_found;
+
+  // If box is a leaf (which we know contains the point), then check entity
+  else if (tree.is_leaf(bbox, node))
+  {
+    // Get entity (child_1 denotes entity index for leaves)
+    dolfin_assert(tree._tdim == mesh.topology().dim());
+    const unsigned int entity_index = bbox.child_1;
+    Cell cell(mesh, entity_index);
+
+    // Check entity
+    if (cell.collides(point))
+      return entity_index;
+  }
+
+  // Check both children
+  else
+  {
+    const unsigned int c0 = _compute_first_entity_collision(tree,
+                                                            point,
+                                                            bbox.child_0,
+                                                            mesh);
+    if (c0 != not_found)
+      return c0;
+
+    const unsigned int c1 = _compute_first_entity_collision(tree,
+                                                            point,
+                                                            bbox.child_1,
+                                                            mesh);
+    if (c1 != not_found)
+      return c1;
+  }
+
+  // Point not found
+  return not_found;
+}
+//-----------------------------------------------------------------------------
+void
+GenericBoundingBoxTree::_compute_closest_entity(const GenericBoundingBoxTree& tree,
+                                                const Point& point,
+                                                unsigned int node,
+                                                const Mesh& mesh,
+                                                unsigned int& closest_entity,
+                                                double& R2)
+{
+  // Get bounding box for current node
+  const BBox& bbox = tree.get_bbox(node);
+
+  // If bounding box is outside radius, then don't search further
+  const double r2 = tree.compute_squared_distance_bbox(point.coordinates(), node);
+  if (r2 > R2)
+    return;
+
+  // If box is leaf (which we know is inside radius), then shrink radius
+  else if (tree.is_leaf(bbox, node))
+  {
+    // Get entity (child_1 denotes entity index for leaves)
+    dolfin_assert(tree._tdim == mesh.topology().dim());
+    const unsigned int entity_index = bbox.child_1;
+    Cell cell(mesh, entity_index);
+
+    // If entity is closer than best result so far, then return it
+    const double r2 = cell.squared_distance(point);
+    if (r2 < R2)
+    {
+      closest_entity = entity_index;
+      R2 = r2;
+    }
+  }
+
+  // Check both children
+  else
+  {
+    _compute_closest_entity(tree, point, bbox.child_0, mesh, closest_entity, R2);
+    _compute_closest_entity(tree, point, bbox.child_1, mesh, closest_entity, R2);
+  }
+}
+//-----------------------------------------------------------------------------
+void
+GenericBoundingBoxTree::_compute_closest_point(const GenericBoundingBoxTree& tree,
+                                               const Point& point,
+                                               unsigned int node,
+                                               unsigned int& closest_point,
+                                               double& R2)
+{
+  // Get bounding box for current node
+  const BBox& bbox = tree.get_bbox(node);
+
+  // If box is leaf, then compute distance and shrink radius
+  if (tree.is_leaf(bbox, node))
+  {
+    const double r2 = tree.compute_squared_distance_point(point.coordinates(),
+                                                          node);
+    if (r2 < R2)
+    {
+      closest_point = bbox.child_1;
+      R2 = r2;
+    }
+  }
+  else
+  {
+    // If bounding box is outside radius, then don't search further
+    const double r2 = tree.compute_squared_distance_bbox(point.coordinates(),
+                                                         node);
+    if (r2 > R2)
+      return;
+
+    // Check both children
+    _compute_closest_point(tree, point, bbox.child_0, closest_point, R2);
+    _compute_closest_point(tree, point, bbox.child_1, closest_point, R2);
+  }
+}
+//-----------------------------------------------------------------------------
+void GenericBoundingBoxTree::build_point_search_tree(const Mesh& mesh) const
+{
+  // Don't build search tree if it already exists
+  if (_point_search_tree)
+    return;
+  info("Building point search tree to accelerate distance queries.");
+
+  // Create list of midpoints for all cells
+  std::vector<Point> points;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+    points.push_back(cell->midpoint());
+
+  // Select implementation
+  const std::size_t gdim = mesh.geometry().dim();
+  switch (gdim)
+  {
+  case 1:
+    _point_search_tree.reset(new BoundingBoxTree1D());
+    break;
+  case 2:
+    _point_search_tree.reset(new BoundingBoxTree2D());
+    break;
+  case 3:
+    _point_search_tree.reset(new BoundingBoxTree3D());
+    break;
+  default:
+    dolfin_error("BoundingBoxTree.cpp",
+                 "build bounding box tree",
+                 "Not implemented for geometric dimension %d",
+                 gdim);
+  }
+
+  // Build tree
+  dolfin_assert(_point_search_tree);
+  _point_search_tree->build(points);
+}
+//-----------------------------------------------------------------------------
+void GenericBoundingBoxTree::compute_bbox_of_entity(double* b,
+                                                    const MeshEntity& entity,
+                                                    std::size_t gdim) const
+{
+  // Get bounding box coordinates
+  double* xmin = b;
+  double* xmax = b + gdim;
+
+  // Get mesh entity data
+  const MeshGeometry& geometry = entity.mesh().geometry();
+  const size_t num_vertices = entity.num_entities(0);
+  const unsigned int* vertices = entity.entities(0);
+  dolfin_assert(num_vertices >= 2);
+
+  // Get coordinates for first vertex
+  const double* x = geometry.x(vertices[0]);
+  for (std::size_t j = 0; j < gdim; ++j)
+    xmin[j] = xmax[j] = x[j];
+
+  // Compute min and max over remaining vertices
+  for (unsigned int i = 1; i < num_vertices; ++i)
+  {
+    const double* x = geometry.x(vertices[i]);
+    for (std::size_t j = 0; j < gdim; ++j)
+    {
+      xmin[j] = std::min(xmin[j], x[j]);
+      xmax[j] = std::max(xmax[j], x[j]);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void
+GenericBoundingBoxTree::sort_points(std::size_t axis,
+                                    const std::vector<Point>& points,
+                                    const std::vector<unsigned int>::iterator& begin,
+                                    const std::vector<unsigned int>::iterator& middle,
+                                    const std::vector<unsigned int>::iterator& end)
+{
+  switch (axis)
+  {
+  case 0:
+    std::nth_element(begin, middle, end, less_x_point(points));
+    break;
+  case 1:
+    std::nth_element(begin, middle, end, less_y_point(points));
+    break;
+  default:
+    std::nth_element(begin, middle, end, less_z_point(points));
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/GenericBoundingBoxTree.h b/dolfin/geometry/GenericBoundingBoxTree.h
new file mode 100644
index 0000000..10e1cce
--- /dev/null
+++ b/dolfin/geometry/GenericBoundingBoxTree.h
@@ -0,0 +1,344 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-23
+// Last changed: 2014-02-06
+
+#ifndef __GENERIC_BOUNDING_BOX_TREE_H
+#define __GENERIC_BOUNDING_BOX_TREE_H
+
+#include <memory>
+#include <set>
+#include <vector>
+#include <dolfin/geometry/Point.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  class MeshEntity;
+
+  /// Base class for bounding box implementations (envelope-letter
+  /// design)
+
+  class GenericBoundingBoxTree
+  {
+  public:
+
+    /// Constructor
+    GenericBoundingBoxTree();
+
+    /// Destructor
+    virtual ~GenericBoundingBoxTree() {}
+
+    /// Build bounding box tree for mesh entites of given dimension
+    void build(const Mesh& mesh, std::size_t tdim);
+
+    /// Build bounding box tree for point cloud
+    void build(const std::vector<Point>& points);
+
+    /// Compute all collisions between bounding boxes and _Point_
+    std::vector<unsigned int>
+    compute_collisions(const Point& point) const;
+
+    /// Compute all collisions between bounding boxes and _BoundingBoxTree_
+    std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+    compute_collisions(const GenericBoundingBoxTree& tree) const;
+
+    /// Compute all collisions between entities and _Point_
+    std::vector<unsigned int>
+    compute_entity_collisions(const Point& point,
+                              const Mesh& mesh) const;
+
+    /// Compute all collisions between entities and _BoundingBoxTree_
+    std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+    compute_entity_collisions(const GenericBoundingBoxTree& tree,
+                              const Mesh& mesh_A, const Mesh& mesh_B) const;
+
+    /// Compute first collision between bounding boxes and _Point_
+    unsigned int compute_first_collision(const Point& point) const;
+
+    /// Compute first collision between entities and _Point_
+    unsigned int compute_first_entity_collision(const Point& point,
+                                              const Mesh& mesh) const;
+
+    /// Compute closest entity and distance to _Point_
+    std::pair<unsigned int, double> compute_closest_entity(const Point& point,
+                                                           const Mesh& mesh) const;
+
+    /// Compute closest point and distance to _Point_
+    std::pair<unsigned int, double> compute_closest_point(const Point& point) const;
+
+  protected:
+
+    // Bounding box data. Leaf nodes are indicated by setting child_0
+    // equal to the node itself. For leaf nodes, child_1 is set to the
+    // index of the entity contained in the leaf bounding box.
+    struct BBox
+    {
+      unsigned int child_0;
+      unsigned int child_1;
+    };
+
+    // Topological dimension of leaf entities
+    std::size_t _tdim;
+
+    // List of bounding boxes (parent-child-entity relations)
+    std::vector<BBox> _bboxes;
+
+    // List of bounding box coordinates
+    std::vector<double> _bbox_coordinates;
+
+    // Point search tree used to accelerate distance queries
+    mutable std::unique_ptr<GenericBoundingBoxTree> _point_search_tree;
+
+    // Clear existing data if any
+    void clear();
+
+    //--- Recursive build functions ---
+
+    // Build bounding box tree for entities (recursive)
+    unsigned int _build(const std::vector<double>& leaf_bboxes,
+                        const std::vector<unsigned int>::iterator& begin,
+                        const std::vector<unsigned int>::iterator& end,
+                        std::size_t gdim);
+
+    // Build bounding box tree for points (recursive)
+    unsigned int _build(const std::vector<Point>& points,
+                        const std::vector<unsigned int>::iterator& begin,
+                        const std::vector<unsigned int>::iterator& end,
+                        std::size_t gdim);
+
+    //--- Recursive search functions ---
+
+    // Note that these functions are made static for consistency as
+    // some of them need to deal with more than tree.
+
+    /// Compute collisions with point (recursive)
+    static void
+    _compute_collisions(const GenericBoundingBoxTree& tree,
+                        const Point& point,
+                        unsigned int node,
+                        std::vector<unsigned int>& entities,
+                        const Mesh* mesh);
+
+    /// Compute collisions with tree (recursive)
+    static void
+    _compute_collisions(const GenericBoundingBoxTree& A,
+                        const GenericBoundingBoxTree& B,
+                        unsigned int node_A,
+                        unsigned int node_B,
+                        std::vector<unsigned int>& entities_A,
+                        std::vector<unsigned int>& entities_B,
+                        const Mesh* mesh_A,
+                        const Mesh* mesh_B);
+
+    /// Compute first collision (recursive)
+    static unsigned int
+    _compute_first_collision(const GenericBoundingBoxTree& tree,
+                             const Point& point,
+                             unsigned int node);
+
+    /// Compute first entity collision (recursive)
+    static unsigned int
+    _compute_first_entity_collision(const GenericBoundingBoxTree& tree,
+                                    const Point& point,
+                                    unsigned int node,
+                                    const Mesh& mesh);
+
+    /// Compute closest entity (recursive)
+    static void _compute_closest_entity(const GenericBoundingBoxTree& tree,
+                                        const Point& point,
+                                        unsigned int node,
+                                        const Mesh& mesh,
+                                        unsigned int& closest_entity,
+                                        double& R2);
+
+    /// Compute closest point (recursive)
+    static void
+    _compute_closest_point(const GenericBoundingBoxTree& tree,
+                           const Point& point,
+                           unsigned int node,
+                           unsigned int& closest_point,
+                           double& R2);
+
+    //--- Utility functions ---
+
+    // Compute point search tree if not already done
+    void build_point_search_tree(const Mesh& mesh) const;
+
+    // Compute bounding box of mesh entity
+    void compute_bbox_of_entity(double* b,
+                                const MeshEntity& entity,
+                                std::size_t gdim) const;
+
+    // Sort points along given axis
+    void sort_points(std::size_t axis,
+                     const std::vector<Point>& points,
+                     const std::vector<unsigned int>::iterator& begin,
+                     const std::vector<unsigned int>::iterator& middle,
+                     const std::vector<unsigned int>::iterator& end);
+
+    // Add bounding box and coordinates
+    inline unsigned int add_bbox(const BBox& bbox,
+                                 const double* b,
+                                 std::size_t gdim)
+    {
+      // Add bounding box
+      _bboxes.push_back(bbox);
+
+      // Add bounding box coordinates
+      for (std::size_t i = 0; i < 2*gdim; ++i)
+        _bbox_coordinates.push_back(b[i]);
+
+      return _bboxes.size() - 1;
+    }
+
+    // Return bounding box for given node
+    inline const BBox& get_bbox(unsigned int node) const
+    {
+      return _bboxes[node];
+    }
+
+    // Return number of bounding boxes
+    inline unsigned int num_bboxes() const
+    {
+      return _bboxes.size();
+    }
+
+    // Add bounding box and point coordinates
+    inline unsigned int add_point(const BBox& bbox,
+                                  const Point& point,
+                                  std::size_t gdim)
+    {
+      // Add bounding box
+      _bboxes.push_back(bbox);
+
+      // Add point coordinates (twice)
+      const double* x = point.coordinates();
+      for (std::size_t i = 0; i < gdim; ++i)
+        _bbox_coordinates.push_back(x[i]);
+      for (std::size_t i = 0; i < gdim; ++i)
+        _bbox_coordinates.push_back(x[i]);
+
+      return _bboxes.size() - 1;
+    }
+
+    // Check whether bounding box is a leaf node
+    inline bool is_leaf(const BBox& bbox, unsigned int node) const
+    {
+      // Leaf nodes are marked by setting child_0 equal to the node itself
+      return bbox.child_0 == node;
+    }
+
+    // Comparison operators for sorting of points. The corresponding
+    // comparison operators for bounding boxes are dimension-dependent
+    // and are therefore implemented in the subclasses.
+
+    struct less_x_point
+    {
+      const std::vector<Point>& points;
+      less_x_point(const std::vector<Point>& points): points(points) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* pi = points[i].coordinates();
+        const double* pj = points[j].coordinates();
+        return pi[0] < pj[0];
+      }
+    };
+
+    struct less_y_point
+    {
+      const std::vector<Point>& points;
+      less_y_point(const std::vector<Point>& points): points(points) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* pi = points[i].coordinates();
+        const double* pj = points[j].coordinates();
+        return pi[1] < pj[1];
+      }
+    };
+
+    struct less_z_point
+    {
+      const std::vector<Point>& points;
+      less_z_point(const std::vector<Point>& points): points(points) {}
+
+      inline bool operator()(unsigned int i, unsigned int j)
+      {
+        const double* pi = points[i].coordinates();
+        const double* pj = points[j].coordinates();
+        return pi[2] < pj[2];
+      }
+    };
+
+    //--- Dimension-dependent functions to be implemented by subclass ---
+
+    // Return geometric dimension
+    virtual std::size_t gdim() const = 0;
+
+    // Return bounding box coordinates for node
+    virtual const double* get_bbox_coordinates(unsigned int node) const = 0;
+
+    // Check whether point (x) is in bounding box (node)
+    virtual bool
+    point_in_bbox(const double* x, unsigned int node) const = 0;
+
+    // Check whether bounding box (a) collides with bounding box (node)
+    virtual bool
+    bbox_in_bbox(const double* a, unsigned int node) const = 0;
+
+    // Compute squared distance between point and bounding box
+    virtual double
+    compute_squared_distance_bbox(const double* x, unsigned int node) const = 0;
+
+    // Compute squared distance between point and point
+    virtual double
+    compute_squared_distance_point(const double* x, unsigned int node) const = 0;
+
+    // Compute bounding box of bounding boxes
+    virtual void
+    compute_bbox_of_bboxes(double* bbox,
+                           std::size_t& axis,
+                           const std::vector<double>& leaf_bboxes,
+                           const std::vector<unsigned int>::iterator& begin,
+                           const std::vector<unsigned int>::iterator& end) = 0;
+
+    // Compute bounding box of points
+    virtual void
+    compute_bbox_of_points(double* bbox,
+                           std::size_t& axis,
+                           const std::vector<Point>& points,
+                           const std::vector<unsigned int>::iterator& begin,
+                           const std::vector<unsigned int>::iterator& end) = 0;
+
+    // Sort leaf bounding boxes along given axis
+    virtual void
+    sort_bboxes(std::size_t axis,
+                const std::vector<double>& leaf_bboxes,
+                const std::vector<unsigned int>::iterator& begin,
+                const std::vector<unsigned int>::iterator& middle,
+                const std::vector<unsigned int>::iterator& end) = 0;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/ImplicitSurface.cpp b/dolfin/geometry/ImplicitSurface.cpp
new file mode 100644
index 0000000..68b3d28
--- /dev/null
+++ b/dolfin/geometry/ImplicitSurface.cpp
@@ -0,0 +1,45 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-04
+// Last changed:
+
+#include <dolfin/generation/CSGPrimitives3D.h>
+#include <dolfin/log/log.h>
+#include "ImplicitSurface.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+ImplicitSurface::ImplicitSurface(Sphere s, std::string type)
+  : sphere(s), type(type)
+{
+  // Checck type
+  if (type != "manifold" && type != "manifold_with_boundary"
+      && type != "non_manifold")
+  {
+    dolfin_error("ImplicitSurface.cpp",
+                 "create implicit surface",
+                 "Unknown surface type \"%s\"", type.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+ImplicitSurface::~ImplicitSurface()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/ImplicitSurface.h b/dolfin/geometry/ImplicitSurface.h
new file mode 100644
index 0000000..ce6d1c5
--- /dev/null
+++ b/dolfin/geometry/ImplicitSurface.h
@@ -0,0 +1,97 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-04
+// Last changed:
+
+#ifndef __IMPLICITSURFACE_H
+#define __IMPLICITSURFACE_H
+
+#include <list>
+#include <string>
+#include <utility>
+#include <vector>
+#include <dolfin/generation/CSGPrimitives3D.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  /// This class is used to define a surface via a function f(x) -> R,
+  /// where for a point y on the surface f(y) = 0.
+
+  /// WARNING: This class is experimental and likely to change.
+
+  class ImplicitSurface
+  {
+  public:
+
+    /// Create an isosurface
+    ///
+    /// *Arguments*
+    ///     s (Sphere)
+    ///         Bounding sphere for surface.
+    ///
+    ///     type (std::string)
+    ///         Isosurface type. One of "manifold", "manifold_with_boundary"
+    ///         or "non_manifold".
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         IsoSurface isosurface(Sphere(Point(0.0, 0.2, 0.4), 1.0),
+    ///                               "manifold_with_boundary");
+    ///
+    ImplicitSurface(Sphere s, std::string type);
+
+    /// Destructor
+    virtual ~ImplicitSurface();
+
+    /// Signed distance function surface. If f0(p) = 0, the point p is
+    /// possibly on the surface, which case ImplicitSurface::f1 can be
+    /// called to check.
+    virtual double f0(const Point& point) const = 0;
+
+    /// For a point for which f0 \approx 0, return <= is point is on
+    /// is on the surface.  Can be used for creating open surfaces by
+    /// discarding with any artificial closure.
+    virtual double f1(const Point& point) const
+    { return -1.0; }
+
+    // Return true is point is on surface (within tolerance). Note:
+    // The CGAL surface mesh generator will usually fail for open
+    // surface. To handle this case, f0 can describe a closed surface,
+    // and this function can be overloaded to 'filter' the mesh of the
+    // closed surface.
+    virtual bool on_surface(const Point& point, double tol=1.0e-2) const
+    { return std::abs(f0(point)) < tol && f1(point) < 0.0; }
+
+    /// Bounding sphere
+    const Sphere sphere;
+
+    /// Polylines
+    std::list<std::vector<Point> > polylines;
+
+    /// Surface type
+    const std::string type;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/IntersectionTriangulation.cpp b/dolfin/geometry/IntersectionTriangulation.cpp
new file mode 100644
index 0000000..603b32c
--- /dev/null
+++ b/dolfin/geometry/IntersectionTriangulation.cpp
@@ -0,0 +1,966 @@
+// Copyright (C) 2014 Anders Logg and August Johansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2014-02-03
+// Last changed: 2014-03-03
+
+#include <dolfin/mesh/MeshEntity.h>
+#include "IntersectionTriangulation.h"
+#include "CollisionDetection.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::vector<double>
+IntersectionTriangulation::triangulate_intersection(const MeshEntity& entity_0,
+						    const MeshEntity& entity_1)
+{
+  switch (entity_0.dim())
+  {
+  case 0:
+    // PointCell
+    dolfin_not_implemented();
+    break;
+  case 1:
+    // IntervalCell
+    dolfin_not_implemented();
+    break;
+  case 2:
+    // TriangleCell
+    switch (entity_1.dim())
+    {
+    case 0:
+      dolfin_not_implemented();
+      break;
+    case 1:
+      dolfin_not_implemented();
+      break;
+    case 2:
+      return triangulate_intersection_triangle_triangle(entity_0, entity_1);
+    case 3:
+      return triangulate_intersection_tetrahedron_triangle(entity_1, entity_0);
+    default:
+      dolfin_error("IntersectionTriangulation.cpp",
+		   "triangulate intersection of entity_0 and entity_1",
+		   "unknown dimension of entity_1 in TriangleCell");
+    }
+  case 3:
+    // TetrahedronCell
+    switch (entity_1.dim())
+    {
+    case 0:
+      dolfin_not_implemented();
+      break;
+    case 1:
+      dolfin_not_implemented();
+      break;
+    case 2:
+      return triangulate_intersection_tetrahedron_triangle(entity_0, entity_1);
+    case 3:
+      return triangulate_intersection_tetrahedron_tetrahedron(entity_0, entity_1);
+    default:
+      dolfin_error("IntersectionTriangulation.cpp",
+		   "triangulate intersection of entity_0 and entity_1",
+		   "unknown dimension of entity_1 in TetrahedronCell");
+    }
+  default:
+    dolfin_error("IntersectionTriangulation.cpp",
+		 "triangulate intersection of entity_0 and entity_1",
+		 "unknown dimension of entity_0");
+  }
+  return std::vector<double>();
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+IntersectionTriangulation::triangulate_intersection_interval_interval
+(const MeshEntity& interval_0, const MeshEntity& interval_1)
+{
+  dolfin_assert(interval_0.mesh().topology().dim() == 1);
+  dolfin_assert(interval_1.mesh().topology().dim() == 1);
+
+  dolfin_not_implemented();
+  std::vector<double> triangulation;
+  return triangulation;
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+IntersectionTriangulation::triangulate_intersection_triangle_triangle
+(const MeshEntity& c0, const MeshEntity& c1)
+{
+  // This algorithm computes the (convex) polygon resulting from the
+  // intersection of two triangles. It then triangulates the polygon
+  // by trivially drawing an edge from one vertex to all other
+  // vertices. The polygon is computed by first identifying all
+  // vertex-cell collisions and then all edge-edge collisions. The
+  // points are then sorted using a simplified Graham scan (simplified
+  // since we know the polygon is convex).
+
+  dolfin_assert(c0.mesh().topology().dim() == 2);
+  dolfin_assert(c1.mesh().topology().dim() == 2);
+
+  // Tolerance for duplicate points (p and q are the same if
+  // (p-q).norm() < same_point_tol)
+  const double same_point_tol = DOLFIN_EPS_LARGE;
+
+  // Get geometry and vertex data
+  const MeshGeometry& geometry_0 = c0.mesh().geometry();
+  const MeshGeometry& geometry_1 = c1.mesh().geometry();
+  const unsigned int* vertices_0 = c0.entities(0);
+  const unsigned int* vertices_1 = c1.entities(0);
+
+  // Create empty list of collision points
+  std::vector<Point> points;
+
+  // Find all vertex-cell collisions
+  for (std::size_t i = 0; i < 3; i++)
+  {
+    const Point p0 = geometry_0.point(vertices_0[i]);
+    const Point p1 = geometry_1.point(vertices_1[i]);
+    if (CollisionDetection::collides_triangle_point(c1, p0))
+      points.push_back(p0);
+    if (CollisionDetection::collides_triangle_point(c0, p1))
+      points.push_back(p1);
+  }
+
+  // Find all edge-edge collisions (not needed?)
+  for (std::size_t i0 = 0; i0 < 3; i0++)
+  {
+    const std::size_t j0 = (i0 + 1) % 3;
+    const Point p0 = geometry_0.point(vertices_0[i0]);
+    const Point q0 = geometry_0.point(vertices_0[j0]);
+    for (std::size_t i1 = 0; i1 < 3; i1++)
+    {
+      const std::size_t j1 = (i1 + 1) % 3;
+      const Point p1 = geometry_1.point(vertices_1[i1]);
+      const Point q1 = geometry_1.point(vertices_1[j1]);
+      Point point;
+      if (intersection_edge_edge(p0, q0, p1, q1, point))
+        points.push_back(point);
+    }
+  }
+
+  // Remove duplicate points
+  std::vector<Point> tmp;
+  tmp.reserve(points.size());
+
+  for (std::size_t i = 0; i < points.size(); ++i)
+  {
+    bool different = true;
+    for (std::size_t j = i+1; j < points.size(); ++j)
+      if ((points[i] - points[j]).norm() < same_point_tol)
+      {
+	different = false;
+	break;
+      }
+    if (different)
+      tmp.push_back(points[i]);
+  }
+  points = tmp;
+
+  // Special case: no points found
+  std::vector<double> triangulation;
+  if (points.size() < 3)
+    return triangulation;
+
+  // Find left-most point (smallest x-coordinate)
+  std::size_t i_min = 0;
+  double x_min = points[0].x();
+  for (std::size_t i = 1; i < points.size(); i++)
+  {
+    const double x = points[i].x();
+    if (x < x_min)
+    {
+      x_min = x;
+      i_min = i;
+    }
+  }
+
+  // Compute signed squared cos of angle with (0, 1) from i_min to all points
+  std::vector<std::pair<double, std::size_t> > order;
+  for (std::size_t i = 0; i < points.size(); i++)
+  {
+    // Skip left-most point used as origin
+    if (i == i_min)
+      continue;
+
+    // Compute vector to point
+    const Point v = points[i] - points[i_min];
+
+    // Compute square cos of angle
+    const double cos2 = (v.y() < 0.0 ? -1.0 : 1.0)*v.y()*v.y() / v.squared_norm();
+
+    // Store for sorting
+    order.push_back(std::make_pair(cos2, i));
+  }
+
+  // Sort points based on angle
+  std::sort(order.begin(), order.end());
+
+  // Triangulate polygon by connecting i_min with the ordered points
+  triangulation.reserve((points.size() - 2)*3*2);
+  const Point& p0 = points[i_min];
+  for (std::size_t i = 0; i < points.size() - 2; i++)
+  {
+    const Point& p1 = points[order[i].second];
+    const Point& p2 = points[order[i + 1].second];
+    triangulation.push_back(p0.x());
+    triangulation.push_back(p0.y());
+    triangulation.push_back(p1.x());
+    triangulation.push_back(p1.y());
+    triangulation.push_back(p2.x());
+    triangulation.push_back(p2.y());
+  }
+
+  return triangulation;
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+IntersectionTriangulation::triangulate_intersection_tetrahedron_triangle
+(const MeshEntity& tetrahedron, const MeshEntity& triangle)
+{
+  // This code mimics the
+  // triangulate_intersection_tetrahedron_tetrahedron and the
+  // triangulate_intersection_tetrahedron_tetrahedron_triangle_codes:
+  // we first identify triangle nodes in the tetrahedra. Them we
+  // continue with edge-face detection for the four faces of the
+  // tetrahedron and the triangle. The points found are used to form a
+  // triangulation by first sorting them using a Graham scan.
+
+  dolfin_assert(tetrahedron.mesh().topology().dim() == 3);
+  dolfin_assert(triangle.mesh().topology().dim() == 2);
+
+  // Tolerance for duplicate points (p and q are the same if
+  // (p-q).norm() < same_point_tol)
+  const double same_point_tol = DOLFIN_EPS_LARGE;
+
+  // Tolerance for small triangle (could be improved by identifying
+  // sliver and small triangles)
+  const double tri_det_tol = DOLFIN_EPS_LARGE;
+
+  // Get the vertices as points
+  const MeshGeometry& tet_geom = tetrahedron.mesh().geometry();
+  const unsigned int* tet_vert = tetrahedron.entities(0);
+
+  const MeshGeometry& tri_geom = triangle.mesh().geometry();
+  const unsigned int* tri_vert = triangle.entities(0);
+  const Point q0 = tri_geom.point(tri_vert[0]);
+  const Point q1 = tri_geom.point(tri_vert[1]);
+  const Point q2 = tri_geom.point(tri_vert[2]);
+
+  std::vector<Point> points;
+
+  // Triangle node in tetrahedron intersection
+  if (CollisionDetection::collides_tetrahedron_point(tetrahedron, q0))
+    points.push_back(q0);
+
+  if (CollisionDetection::collides_tetrahedron_point(tetrahedron, q1))
+    points.push_back(q1);
+
+  if (CollisionDetection::collides_tetrahedron_point(tetrahedron, q2))
+    points.push_back(q2);
+
+  // Check if a tetrahedron edge intersects the triangle
+  std::vector<std::vector<int> > tet_edges(6, std::vector<int>(2));
+  tet_edges[0][0] = tet_vert[2];
+  tet_edges[0][1] = tet_vert[3];
+  tet_edges[1][0] = tet_vert[1];
+  tet_edges[1][1] = tet_vert[3];
+  tet_edges[2][0] = tet_vert[1];
+  tet_edges[2][1] = tet_vert[2];
+  tet_edges[3][0] = tet_vert[0];
+  tet_edges[3][1] = tet_vert[3];
+  tet_edges[4][0] = tet_vert[0];
+  tet_edges[4][1] = tet_vert[2];
+  tet_edges[5][0] = tet_vert[0];
+  tet_edges[5][1] = tet_vert[1];
+
+  Point pt;
+  for (std::size_t e = 0; e < 6; ++e)
+  {
+    if (intersection_face_edge(q0, q1, q2,
+			       tet_geom.point(tet_edges[e][0]),
+			       tet_geom.point(tet_edges[e][1]),
+			       pt))
+      points.push_back(pt);
+  }
+
+  // Check if a triangle edge intersects a tetrahedron face
+  std::vector<std::vector<std::size_t> >
+    tet_faces(4, std::vector<std::size_t>(3));
+
+  tet_faces[0][0] = tet_vert[1];
+  tet_faces[0][1] = tet_vert[2];
+  tet_faces[0][2] = tet_vert[3];
+  tet_faces[1][0] = tet_vert[0];
+  tet_faces[1][1] = tet_vert[2];
+  tet_faces[1][2] = tet_vert[3];
+  tet_faces[2][0] = tet_vert[0];
+  tet_faces[2][1] = tet_vert[1];
+  tet_faces[2][2] = tet_vert[3];
+  tet_faces[3][0] = tet_vert[0];
+  tet_faces[3][1] = tet_vert[1];
+  tet_faces[3][2] = tet_vert[2];
+
+  for (std::size_t f = 0; f < 4; ++f)
+  {
+    if (intersection_face_edge(tet_geom.point(tet_faces[f][0]),
+			       tet_geom.point(tet_faces[f][1]),
+			       tet_geom.point(tet_faces[f][2]),
+			       q0, q1, pt))
+      points.push_back(pt);
+    if (intersection_face_edge(tet_geom.point(tet_faces[f][0]),
+			       tet_geom.point(tet_faces[f][1]),
+			       tet_geom.point(tet_faces[f][2]),
+			       q0, q2, pt))
+      points.push_back(pt);
+    if (intersection_face_edge(tet_geom.point(tet_faces[f][0]),
+			       tet_geom.point(tet_faces[f][1]),
+			       tet_geom.point(tet_faces[f][2]),
+			       q1, q2, pt))
+      points.push_back(pt);
+  }
+
+
+  // edge edge intersection
+  for (std::size_t f = 0; f < 6; ++f)
+  {
+    if (intersection_edge_edge(tet_geom.point(tet_edges[f][0]),
+			       tet_geom.point(tet_edges[f][1]),
+			       q0, q1,
+			       pt))
+      points.push_back(pt);
+    if (intersection_edge_edge(tet_geom.point(tet_edges[f][0]),
+			       tet_geom.point(tet_edges[f][1]),
+			       q0,q2,
+			       pt))
+      points.push_back(pt);
+    if (intersection_edge_edge(tet_geom.point(tet_edges[f][0]),
+			       tet_geom.point(tet_edges[f][1]),
+			       q1,q2,
+			       pt))
+      points.push_back(pt);
+  }
+
+
+
+  // Remove duplicate nodes
+  std::vector<Point> tmp;
+  tmp.reserve(points.size());
+
+  for (std::size_t i = 0; i < points.size(); ++i)
+  {
+    bool different = true;
+    for (std::size_t j = i+1; j < points.size(); ++j)
+      if ((points[i] - points[j]).norm() < same_point_tol)
+      {
+	different = false;
+	break;
+      }
+    if (different)
+      tmp.push_back(points[i]);
+  }
+  points = tmp;
+
+  // We didn't find sufficiently many points
+  if (points.size() < 3)
+    return std::vector<double>();
+
+  std::vector<double> triangulation;
+
+  Point n = (points[2] - points[0]).cross(points[1] - points[0]);
+  const double det = n.norm();
+  n /= det;
+
+  if (points.size() == 3) {
+    // Include if determinant is sufficiently large
+    if (std::abs(det) > tri_det_tol)
+    {
+      if (det < -tri_det_tol)
+	std::swap(points[0], points[1]);
+
+      // One triangle with three vertices in 3D gives 9 doubles
+      triangulation.resize(9);
+      for (std::size_t m = 0, idx = 0; m < 3; ++m)
+	for (std::size_t d = 0; d < 3; ++d, ++idx)
+	  triangulation[idx] = points[m][d];
+    }
+    return triangulation;
+  }
+
+  // Tesselate as in the triangle-triangle intesection case: First
+  // sort points using a Graham scan, then connect to form triangles.
+
+  // Use the center of the points and point no 0 as reference for the
+  // angle calculation
+  Point pointscenter = points[0];
+  for (std::size_t m = 1; m < points.size(); ++m)
+    pointscenter += points[m];
+  pointscenter /= points.size();
+
+  std::vector<std::pair<double, std::size_t> > order;
+  Point ref = points[0]-pointscenter;
+  ref /= ref.norm();
+
+  // Calculate and store angles
+  for (std::size_t m = 1; m < points.size(); ++m)
+  {
+    const Point v = points[m] - pointscenter;
+    const double frac = ref.dot(v) / v.norm();
+    double alpha;
+    if (frac <= -1)
+      alpha = DOLFIN_PI;
+    else if (frac >= 1)
+      alpha = 0;
+    else
+    {
+      alpha = acos(frac);
+      if (v.dot(n.cross(ref)) < 0)
+        alpha = 2*DOLFIN_PI-alpha;
+    }
+    order.push_back(std::make_pair(alpha, m));
+  }
+
+  // Sort angles
+  std::sort(order.begin(), order.end());
+
+  // Tesselate
+  for (std::size_t m = 0; m < order.size()-1; ++m)
+  {
+    // Candidate triangle
+    std::vector<Point> cand(3);
+    cand[0] = points[0];
+    cand[1] = points[order[m].second];
+    cand[2] = points[order[m + 1].second];
+
+    // Include triangle if determinant is sufficiently large
+    const double det = ((cand[2] - cand[1]).cross(cand[1] - cand[0])).norm();
+    if (std::abs(det) > tri_det_tol)
+    {
+      if (det < -tri_det_tol)
+	std::swap(cand[0], cand[1]);
+      for (std::size_t n = 0; n < 3; ++n)
+	for (std::size_t d = 0; d < 3; ++d)
+	  triangulation.push_back(cand[n][d]);
+    }
+  }
+
+  return triangulation;
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+IntersectionTriangulation::triangulate_intersection_tetrahedron_tetrahedron
+(const MeshEntity& tetrahedron_0,
+ const MeshEntity& tetrahedron_1)
+{
+  // This algorithm computes the intersection of cell_0 and cell_1 by
+  // returning a vector<double> with points describing a tetrahedral
+  // mesh of the intersection. We will use the fact that the
+  // intersection is a convex polyhedron. The algorithm works by first
+  // identifying intersection points: vertex points inside a cell,
+  // edge-face collision points and edge-edge collision points (the
+  // edge-edge is a rare occurance). Having the intersection points,
+  // we identify points that are coplanar and thus form a facet of the
+  // polyhedron. These points are then used to form a tesselation of
+  // triangles, which are used to form tetrahedra by the use of the
+  // center point of the polyhedron. This center point is thus an
+  // additional point not found on the polyhedron facets.
+
+  dolfin_assert(tetrahedron_0.mesh().topology().dim() == 3);
+  dolfin_assert(tetrahedron_1.mesh().topology().dim() == 3);
+
+  // Tolerance for coplanar points
+  const double coplanar_tol = 1000*DOLFIN_EPS_LARGE;
+
+  // Tolerance for the tetrahedron determinant (otherwise problems
+  // with warped tets)
+  const double tet_det_tol = DOLFIN_EPS_LARGE;
+
+  // Tolerance for duplicate points (p and q are the same if
+  // (p-q).norm() < same_point_tol)
+  const double same_point_tol = DOLFIN_EPS_LARGE;
+
+  // Tolerance for small triangle (could be improved by identifying
+  // sliver and small triangles)
+  const double tri_det_tol = DOLFIN_EPS_LARGE;
+
+  // Points in the triangulation (unique)
+  std::vector<Point> points;
+
+  // Get the vertices as points
+  const MeshGeometry& geom_0 = tetrahedron_0.mesh().geometry();
+  const unsigned int* vert_0 = tetrahedron_0.entities(0);
+  const MeshGeometry& geom_1 = tetrahedron_1.mesh().geometry();
+  const unsigned int* vert_1 = tetrahedron_1.entities(0);
+
+  // Node intersection
+  for (int i = 0; i<4; ++i)
+  {
+    if (CollisionDetection::collides_tetrahedron_point(tetrahedron_0,
+						       geom_1.point(vert_1[i])))
+      points.push_back(geom_1.point(vert_1[i]));
+
+    if (CollisionDetection::collides_tetrahedron_point(tetrahedron_1,
+						       geom_0.point(vert_0[i])))
+      points.push_back(geom_0.point(vert_0[i]));
+  }
+
+  // Edge face intersections
+  std::vector<std::vector<std::size_t> > edges_0(6, std::vector<std::size_t>(2));
+  edges_0[0][0] = vert_0[2];
+  edges_0[0][1] = vert_0[3];
+  edges_0[1][0] = vert_0[1];
+  edges_0[1][1] = vert_0[3];
+  edges_0[2][0] = vert_0[1];
+  edges_0[2][1] = vert_0[2];
+  edges_0[3][0] = vert_0[0];
+  edges_0[3][1] = vert_0[3];
+  edges_0[4][0] = vert_0[0];
+  edges_0[4][1] = vert_0[2];
+  edges_0[5][0] = vert_0[0];
+  edges_0[5][1] = vert_0[1];
+
+  std::vector<std::vector<std::size_t> > edges_1(6, std::vector<std::size_t>(2));
+  edges_1[0][0] = vert_1[2];
+  edges_1[0][1] = vert_1[3];
+  edges_1[1][0] = vert_1[1];
+  edges_1[1][1] = vert_1[3];
+  edges_1[2][0] = vert_1[1];
+  edges_1[2][1] = vert_1[2];
+  edges_1[3][0] = vert_1[0];
+  edges_1[3][1] = vert_1[3];
+  edges_1[4][0] = vert_1[0];
+  edges_1[4][1] = vert_1[2];
+  edges_1[5][0] = vert_1[0];
+  edges_1[5][1] = vert_1[1];
+
+  std::vector<std::vector<std::size_t> > faces_0(4, std::vector<std::size_t>(3));
+  faces_0[0][0] = vert_0[1];
+  faces_0[0][1] = vert_0[2];
+  faces_0[0][2] = vert_0[3];
+  faces_0[1][0] = vert_0[0];
+  faces_0[1][1] = vert_0[2];
+  faces_0[1][2] = vert_0[3];
+  faces_0[2][0] = vert_0[0];
+  faces_0[2][1] = vert_0[1];
+  faces_0[2][2] = vert_0[3];
+  faces_0[3][0] = vert_0[0];
+  faces_0[3][1] = vert_0[1];
+  faces_0[3][2] = vert_0[2];
+
+  std::vector<std::vector<std::size_t> > faces_1(4, std::vector<std::size_t>(3));
+  faces_1[0][0] = vert_1[1];
+  faces_1[0][1] = vert_1[2];
+  faces_1[0][2] = vert_1[3];
+  faces_1[1][0] = vert_1[0];
+  faces_1[1][1] = vert_1[2];
+  faces_1[1][2] = vert_1[3];
+  faces_1[2][0] = vert_1[0];
+  faces_1[2][1] = vert_1[1];
+  faces_1[2][2] = vert_1[3];
+  faces_1[3][0] = vert_1[0];
+  faces_1[3][1] = vert_1[1];
+  faces_1[3][2] = vert_1[2];
+
+  // Loop over edges e and faces f
+  for (std::size_t e = 0; e < 6; ++e)
+    for (std::size_t f = 0; f < 4; ++f)
+    {
+      Point pta;
+      if (intersection_face_edge(geom_0.point(faces_0[f][0]),
+				 geom_0.point(faces_0[f][1]),
+				 geom_0.point(faces_0[f][2]),
+				 geom_1.point(edges_1[e][0]),
+				 geom_1.point(edges_1[e][1]),
+				 pta))
+  	points.push_back(pta);
+
+      Point ptb;
+      if (intersection_face_edge(geom_1.point(faces_1[f][0]),
+				 geom_1.point(faces_1[f][1]),
+				 geom_1.point(faces_1[f][2]),
+				 geom_0.point(edges_0[e][0]),
+				 geom_0.point(edges_0[e][1]),
+				 ptb))
+  	points.push_back(ptb);
+    }
+
+  // Edge edge intersection
+  for (int i = 0; i < 6; ++i)
+    for (int j = 0; j < 6; ++j)
+    {
+      Point pt;
+      if (intersection_edge_edge(geom_0.point(edges_0[i][0]),
+				 geom_0.point(edges_0[i][1]),
+				 geom_1.point(edges_1[j][0]),
+				 geom_1.point(edges_1[j][1]),
+				 pt))
+  	points.push_back(pt);
+    }
+
+  // Remove duplicate nodes
+  std::vector<Point> tmp;
+  tmp.reserve(points.size());
+  for (std::size_t i = 0; i < points.size(); ++i)
+  {
+    bool different=true;
+    for (std::size_t j = i+1; j < points.size(); ++j)
+    {
+      if ((points[i] - points[j]).norm() < same_point_tol) {
+  	different = false;
+  	break;
+      }
+    }
+
+    if (different)
+      tmp.push_back(points[i]);
+  }
+  points = tmp;
+
+  // We didn't find sufficiently many points: can't form any
+  // tetrahedra.
+  if (points.size() < 4)
+    return std::vector<double>();
+
+  // Points forming the tetrahedral partitioning of the polyhedron. We
+  // have 4 points per tetrahedron in three dimensions => 12 doubles
+  // per tetrahedron.
+  std::vector<double> triangulation;
+
+  // Start forming a tesselation
+  if (points.size() == 4)
+  {
+    // Include if determinant is sufficiently large. The determinant
+    // can possibly be computed in a more stable way if needed.
+    const double det = (points[3] - points[0]).dot
+      ((points[1] - points[0]).cross(points[2] - points[0]));
+
+    if (std::abs(det) > tet_det_tol)
+    {
+      if (det < -tet_det_tol)
+        std::swap(points[0], points[1]);
+
+      // One tet with four vertices in 3D gives 12 doubles
+      triangulation.resize(12);
+      for (std::size_t m = 0, idx = 0; m < 4; ++m)
+  	for (std::size_t d = 0; d < 3; ++d, ++idx)
+  	  triangulation[idx] = points[m][d];
+    }
+    // Note: this can be empty if the tetrahedron was not sufficiently
+    // large
+    return triangulation;
+  }
+
+  // Tetrahedra are created using the facet points and a center point.
+  Point polyhedroncenter = points[0];
+  for (std::size_t i = 1; i < points.size(); ++i)
+    polyhedroncenter += points[i];
+  polyhedroncenter /= points.size();
+
+  // Data structure for storing checked triangle indices (do this
+  // better with some fancy stl structure?)
+  const std::size_t N = points.size(), N2 = points.size()*points.size();
+  std::vector<int> checked(N*N2 + N2 + N, 0);
+
+  // Find coplanar points
+  for (std::size_t i = 0; i < points.size(); ++i)
+    for (std::size_t j = i+1; j < points.size(); ++j)
+      for (std::size_t k = 0; k < points.size(); ++k)
+  	if (checked[i*N2 + j*N + k] == 0 and k != i and k != j)
+  	{
+  	  // Check that triangle area is sufficiently large
+  	  Point n = (points[j] - points[i]).cross(points[k] - points[i]);
+  	  const double tridet = n.norm();
+  	  if (tridet < tri_det_tol)
+            break;
+
+  	  // Normalize normal
+  	  n /= tridet;
+
+  	  // Compute triangle center
+  	  const Point tricenter = (points[i] + points[j] + points[k]) / 3.;
+
+  	  // Check whether all other points are on one side of thus
+  	  // facet. Initialize as true for the case of only three
+  	  // coplanar points.
+  	  bool on_convex_hull = true;
+
+  	  // Compute dot products to check which side of the plane
+  	  // (i,j,k) we're on. Note: it seems to be better to compute
+  	  // n.dot(points[m]-n.dot(tricenter) rather than
+  	  // n.dot(points[m]-tricenter).
+  	  std::vector<double> ip(points.size(), -(n.dot(tricenter)));
+  	  for (std::size_t m = 0; m < points.size(); ++m)
+  	    ip[m] += n.dot(points[m]);
+
+  	  // Check inner products range by finding max & min (this
+  	  // seemed possibly more numerically stable than checking all
+  	  // vs all and then break).
+  	  double minip = 9e99, maxip = -9e99;
+  	  for (size_t m = 0; m < points.size(); ++m)
+  	    if (m != i and m != j and m != k)
+  	    {
+  	      minip = (minip > ip[m]) ? ip[m] : minip;
+  	      maxip = (maxip < ip[m]) ? ip[m] : maxip;
+  	    }
+
+  	  // Different sign => triangle is not on the convex hull
+  	  if (minip*maxip < -DOLFIN_EPS)
+  	    on_convex_hull = false;
+
+  	  if (on_convex_hull)
+  	  {
+  	    // Find all coplanar points on this facet given the
+  	    // tolerance coplanar_tol
+  	    std::vector<std::size_t> coplanar;
+  	    for (std::size_t m = 0; m < points.size(); ++m)
+  	      if (std::abs(ip[m]) < coplanar_tol)
+  		coplanar.push_back(m);
+
+  	    // Mark this plane (how to do this better?)
+  	    for (std::size_t m = 0; m < coplanar.size(); ++m)
+  	      for (std::size_t n = m+1; n < coplanar.size(); ++n)
+  		for (std::size_t o = n+1; o < coplanar.size(); ++o)
+  		  checked[coplanar[m]*N2 + coplanar[n]*N + coplanar[o]]
+                    = checked[coplanar[m]*N2 + coplanar[o]*N + coplanar[n]]
+  		    = checked[coplanar[n]*N2 + coplanar[m]*N + coplanar[o]]
+  		    = checked[coplanar[n]*N2 + coplanar[o]*N + coplanar[m]]
+  		    = checked[coplanar[o]*N2 + coplanar[n]*N + coplanar[m]]
+  		    = checked[coplanar[o]*N2 + coplanar[m]*N + coplanar[n]]
+                    = 1;
+
+  	    // Do the actual tesselation using the coplanar points and
+  	    // a center point
+  	    if (coplanar.size() == 3)
+  	    {
+  	      // Form one tetrahedron
+  	      std::vector<Point> cand(4);
+  	      cand[0] = points[coplanar[0]];
+  	      cand[1] = points[coplanar[1]];
+  	      cand[2] = points[coplanar[2]];
+  	      cand[3] = polyhedroncenter;
+
+  	      // Include if determinant is sufficiently large
+  	      const double det = (cand[3]-cand[0]).dot
+                ((cand[1] - cand[0]).cross(cand[2] - cand[0]));
+  	      if (std::abs(det) > tet_det_tol)
+  	      {
+  		if (det < -tet_det_tol)
+  		  std::swap(cand[0], cand[1]);
+
+  		for (std::size_t m = 0; m < 4; ++m)
+  		  for (std::size_t d = 0; d < 3; ++d)
+  		    triangulation.push_back(cand[m][d]);
+  	      }
+
+  	    }
+  	    else if (coplanar.size() > 3)
+  	    {
+  	      // Tesselate as in the triangle-triangle intersection
+  	      // case: First sort points using a Graham scan, then
+  	      // connect to form triangles. Finally form tetrahedra
+  	      // using the center of the polyhedron.
+
+  	      // Use the center of the coplanar points and point no 0
+  	      // as reference for the angle calculation
+  	      Point pointscenter = points[coplanar[0]];
+  	      for (std::size_t m = 1; m < coplanar.size(); ++m)
+  		pointscenter += points[coplanar[m]];
+  	      pointscenter /= coplanar.size();
+
+  	      std::vector<std::pair<double, std::size_t> > order;
+  	      Point ref = points[coplanar[0]] - pointscenter;
+  	      ref /= ref.norm();
+
+  	      // Calculate and store angles
+  	      for (std::size_t m = 1; m < coplanar.size(); ++m)
+  	      {
+  		const Point v = points[coplanar[m]] - pointscenter;
+  		const double frac = ref.dot(v) / v.norm();
+  		double alpha;
+  		if (frac <= -1)
+                  alpha=DOLFIN_PI;
+  		else if (frac>=1)
+                  alpha=0;
+  		else
+                {
+  		  alpha = acos(frac);
+  		  if (v.dot(n.cross(ref)) < 0)
+                    alpha = 2*DOLFIN_PI-alpha;
+  		}
+  		order.push_back(std::make_pair(alpha, m));
+  	      }
+
+  	      // Sort angles
+  	      std::sort(order.begin(), order.end());
+
+  	      // Tesselate
+  	      for (std::size_t m = 0; m < coplanar.size()-2; ++m)
+  	      {
+  		// Candidate tetrahedron:
+  		std::vector<Point> cand(4);
+  		cand[0] = points[coplanar[0]];
+  		cand[1] = points[coplanar[order[m].second]];
+  		cand[2] = points[coplanar[order[m + 1].second]];
+  		cand[3] = polyhedroncenter;
+
+  		// Include tetrahedron if determinant is "large"
+  		const double det = (cand[3] - cand[0]).dot
+                  ((cand[1] - cand[0]).cross(cand[2] - cand[0]));
+  		if (std::abs(det) > tet_det_tol)
+  		{
+  		  if (det < -tet_det_tol)
+  		    std::swap(cand[0], cand[1]);
+  		  for (std::size_t n = 0; n < 4; ++n)
+  		    for (std::size_t d = 0; d < 3; ++d)
+  		      triangulation.push_back(cand[n][d]);
+  		}
+  	      }
+  	    }
+  	  }
+  	}
+
+
+  return triangulation;
+}
+//-----------------------------------------------------------------------------
+bool
+IntersectionTriangulation::intersection_edge_edge(const Point& a,
+						  const Point& b,
+						  const Point& c,
+						  const Point& d,
+						  Point& pt)
+{
+  // Check if two edges are the same
+  const double same_point_tol = DOLFIN_EPS_LARGE;
+  if ((a - c).norm() < same_point_tol and
+      (b - d).norm() < same_point_tol)
+    return false;
+  if ((a - d).norm() < same_point_tol and
+      (b - c).norm() < same_point_tol)
+    return false;
+
+  // Tolerance for orthogonality
+  const double orth_tol = DOLFIN_EPS_LARGE;
+
+  // Tolerance for coplanarity
+  const double coplanar_tol = DOLFIN_EPS_LARGE;
+
+  const Point L1 = b - a;
+  const Point L2 = d - c;
+  const Point ca = c - a;
+  const Point n = L1.cross(L2);
+
+  // Check if L1 and L2 are coplanar (what if they're overlapping?)
+  if (std::abs(ca.dot(n)) > coplanar_tol)
+    return false;
+
+  // Find orthogonal plane with normal n1
+  const Point n1 = n.cross(L1);
+  const double n1dotL2 = n1.dot(L2);
+
+  // If we have orthogonality
+  if (std::abs(n1dotL2) > orth_tol)
+  {
+    const double t = n1.dot(a - c) / n1dotL2;
+
+    // Find orthogonal plane with normal n2
+    const Point n2 = n.cross(L2);
+    const double n2dotL1 = n2.dot(L1);
+    if (t >= 0 and
+        t <= 1 and
+        std::abs(n2dotL1) > orth_tol)
+    {
+      const double s = n2.dot(c - a) / n2dotL1;
+      if (s >= 0 and
+          s <= 1)
+      {
+	pt = a + s*L1;
+	return true;
+      }
+    }
+  }
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool
+IntersectionTriangulation::intersection_face_edge(const Point& r,
+						  const Point& s,
+						  const Point& t,
+						  const Point& a,
+						  const Point& b,
+						  Point& pt)
+{
+  // This standard edge face intersection test is as follows:
+  // - Check if end points of the edge (a,b) on opposite side of plane
+  // given by the face (r,s,t)
+  // - If we have sign change, compute intersection with plane.
+  // - Check if computed point is on triangle given by face.
+
+  // If the edge and the face are in the same plane, we return false
+  // and leave this to the edge-edge intersection test.
+
+  // Tolerance for edga and face in plane (topologically 2D problem)
+  const double top_2d_tol = DOLFIN_EPS_LARGE;
+
+  // Compute normal
+  const Point rs = s - r;
+  const Point rt = t - r;
+  Point n = rs.cross(rt);
+  n /= n.norm();
+
+  // Check sign change (note that if either dot product is zero it's
+  // orthogonal)
+  const double da = n.dot(a - r);
+  const double db = n.dot(b - r);
+
+  // Note: if da and db we may have edge intersection (detected in
+  // other routine)
+  if (da*db > 0)
+    return false;
+
+  // Face and edge are in topological 2d: taken care of in edge-edge
+  // intersection or point in simplex.
+  const double sum = std::abs(da) + std::abs(db);
+  if (sum < top_2d_tol)
+    return false;
+
+  // Calculate intersection
+  pt = a + std::abs(da) / sum * (b - a);
+
+  // Check if point is in triangle by calculating and checking
+  // barycentric coords.
+  const double d00 = rs.squared_norm();
+  const double d01 = rs.dot(rt);
+  const double d11 = rt.squared_norm();
+  const Point e2 = pt-r;
+  const double d20 = e2.dot(rs);
+  const double d21 = e2.dot(rt);
+  const double invdet = 1. / (d00*d11 - d01*d01);
+  const double v = (d11*d20 - d01*d21)*invdet;
+  if (v < 0.)
+    return false;
+
+  const double w = (d00*d21 - d01*d20)*invdet;
+  if (w < 0.)
+    return false;
+
+  if (v+w > 1.)
+    return false;
+
+  return true;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/IntersectionTriangulation.h b/dolfin/geometry/IntersectionTriangulation.h
new file mode 100644
index 0000000..4452893
--- /dev/null
+++ b/dolfin/geometry/IntersectionTriangulation.h
@@ -0,0 +1,146 @@
+// Copyright (C) 2014 Anders Logg and August Johansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2014-02-03
+// Last changed: 2014-02-15
+
+#include <vector>
+#include <dolfin/log/log.h>
+
+#ifndef __INTERSECTION_TRIANGULATION_H
+#define __INTERSECTION_TRIANGULATION_H
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class MeshEntity;
+
+  /// This class implements algorithms for computing triangulations of
+  /// pairwise intersections of simplices.
+
+  class IntersectionTriangulation
+  {
+  public:
+
+    /// Compute triangulation of intersection of two entities
+    ///
+    /// *Arguments*
+    ///     entity_0 (_MeshEntity_)
+    ///         The first entity.
+    ///     entity_1 (_MeshEntity_)
+    ///         The second entity.
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         A flattened array of simplices of dimension
+    ///         num_simplices x num_vertices x gdim =
+    ///         num_simplices x (tdim + 1) x gdim
+    static std::vector<double>
+    triangulate_intersection(const MeshEntity& entity_0,
+                             const MeshEntity& entity_1);
+
+    /// Compute triangulation of intersection of two intervals
+    ///
+    /// *Arguments*
+    ///     T0 (_MeshEntity_)
+    ///         The first interval.
+    ///     T1 (_MeshEntity_)
+    ///         The second interval.
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         A flattened array of simplices of dimension
+    ///         num_simplices x num_vertices x gdim =
+    ///         num_simplices x (tdim + 1) x gdim
+    static std::vector<double>
+    triangulate_intersection_interval_interval(const MeshEntity& interval_0,
+                                               const MeshEntity& interval_1);
+
+    /// Compute triangulation of intersection of two triangles
+    ///
+    /// *Arguments*
+    ///     T0 (_MeshEntity_)
+    ///         The first triangle.
+    ///     T1 (_MeshEntity_)
+    ///         The second triangle.
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         A flattened array of simplices of dimension
+    ///         num_simplices x num_vertices x gdim =
+    ///         num_simplices x (tdim + 1) x gdim
+    static std::vector<double>
+    triangulate_intersection_triangle_triangle(const MeshEntity& triangle_0,
+                                               const MeshEntity& triangle_1);
+
+    /// Compute triangulation of intersection of a tetrahedron and a triangle
+    ///
+    /// *Arguments*
+    ///     T0 (_MeshEntity_)
+    ///         The tetrahedron.
+    ///     T1 (_MeshEntity_)
+    ///         The triangle
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         A flattened array of simplices of dimension
+    ///         num_simplices x num_vertices x gdim =
+    ///         num_simplices x (tdim + 1) x gdim
+    static std::vector<double>
+    triangulate_intersection_tetrahedron_triangle(const MeshEntity& tetrahedron,
+                                                  const MeshEntity& triangle);
+
+    /// Compute triangulation of intersection of two tetrahedra
+    ///
+    /// *Arguments*
+    ///     T0 (_MeshEntity_)
+    ///         The first tetrahedron.
+    ///     T1 (_MeshEntity_)
+    ///         The second tetrahedron.
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         A flattened array of simplices of dimension
+    ///         num_simplices x num_vertices x gdim =
+    ///         num_simplices x (tdim + 1) x gdim
+    static std::vector<double>
+    triangulate_intersection_tetrahedron_tetrahedron(const MeshEntity& tetrahedron_0,
+                                                     const MeshEntity& tetrahedron_1);
+
+  private:
+
+    // Helper function
+    static bool intersection_edge_edge(const Point& a,
+				       const Point& b,
+				       const Point& c,
+				       const Point& d,
+				       Point& pt);
+
+    // Helper function
+    static bool intersection_face_edge(const Point& r,
+				       const Point& s,
+				       const Point& t,
+				       const Point& a,
+				       const Point& b,
+				       Point& pt);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/MeshPointIntersection.cpp b/dolfin/geometry/MeshPointIntersection.cpp
new file mode 100644
index 0000000..763624c
--- /dev/null
+++ b/dolfin/geometry/MeshPointIntersection.cpp
@@ -0,0 +1,44 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-18
+// Last changed: 2013-08-28
+
+#include <dolfin/log/LogStream.h>
+#include <dolfin/mesh/Cell.h>
+#include "BoundingBoxTree.h"
+#include "MeshPointIntersection.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshPointIntersection::MeshPointIntersection(const Mesh& mesh,
+                                             const Point& point)
+{
+  // Build bounding box tree
+  BoundingBoxTree tree;
+  tree.build(mesh);
+
+  // Compute intersection
+  _intersected_cells = tree.compute_entity_collisions(point);
+}
+//-----------------------------------------------------------------------------
+MeshPointIntersection::~MeshPointIntersection()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/MeshPointIntersection.h b/dolfin/geometry/MeshPointIntersection.h
new file mode 100644
index 0000000..a8b1dc3
--- /dev/null
+++ b/dolfin/geometry/MeshPointIntersection.h
@@ -0,0 +1,62 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-18
+// Last changed: 2013-05-30
+
+#ifndef __MESH_POINT_INTERSECTION_H
+#define __MESH_POINT_INTERSECTION_H
+
+#include <vector>
+#include <memory>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  class Point;
+
+  /// This class represents an intersection between a _Mesh_ and a
+  /// _Point_. The resulting intersection is stored as a list of zero
+  /// or more cells.
+
+  class MeshPointIntersection
+  {
+  public:
+
+    /// Compute intersection between mesh and point
+    MeshPointIntersection(const Mesh& mesh,
+                          const Point& point);
+
+    /// Destructor
+    ~MeshPointIntersection();
+
+    /// Return the list of (local) indices for intersected cells
+    const std::vector<unsigned int>& intersected_cells() const
+    { return _intersected_cells; }
+
+  private:
+
+    // The list of (local) indices for intersected cells
+    std::vector<unsigned int> _intersected_cells;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/geometry/Point.cpp b/dolfin/geometry/Point.cpp
new file mode 100644
index 0000000..ca8caad
--- /dev/null
+++ b/dolfin/geometry/Point.cpp
@@ -0,0 +1,76 @@
+// Copyright (C) 2006-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2006.
+//
+// First added:  2006-06-12
+// Last changed: 2014-01-06
+
+#include <cmath>
+#include <dolfin/common/constants.h>
+#include <dolfin/log/log.h>
+#include <dolfin/log/LogStream.h>
+#include <dolfin/math/basic.h>
+#include "Point.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+double Point::squared_distance(const Point& p) const
+{
+  const double dx = p._x[0] - _x[0];
+  const double dy = p._x[1] - _x[1];
+  const double dz = p._x[2] - _x[2];
+
+  return dx*dx + dy*dy + dz*dz;
+}
+//-----------------------------------------------------------------------------
+const Point Point::cross(const Point& p) const
+{
+  Point q;
+
+  q._x[0] = _x[1]*p._x[2] - _x[2]*p._x[1];
+  q._x[1] = _x[2]*p._x[0] - _x[0]*p._x[2];
+  q._x[2] = _x[0]*p._x[1] - _x[1]*p._x[0];
+
+  return q;
+}
+//-----------------------------------------------------------------------------
+double Point::dot(const Point& p) const
+{
+  return _x[0]*p._x[0] + _x[1]*p._x[1] + _x[2]*p._x[2];
+}
+//-----------------------------------------------------------------------------
+Point Point::rotate(const Point& k, double theta) const
+{
+  dolfin_assert(near(k.norm(), 1.0));
+
+  const Point& v = *this;
+  const double cosTheta = cos(theta);
+  const double sinTheta = sin(theta);
+
+  //Rodriques' rotation formula
+  return v*cosTheta + k.cross(v)*sinTheta + k*k.dot(v)*(1-cosTheta);
+}
+//-----------------------------------------------------------------------------
+std::string Point::str(bool verbose) const
+{
+  std::stringstream s;
+  s << "<Point x = " << x() << " y = " << y() << " z = " << z() << ">";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/Point.h b/dolfin/geometry/Point.h
new file mode 100644
index 0000000..e9e4341
--- /dev/null
+++ b/dolfin/geometry/Point.h
@@ -0,0 +1,340 @@
+// Copyright (C) 2006-2014 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2006.
+// Modified by Andre Massing, 2009.
+//
+// First added:  2006-06-12
+// Last changed: 2014-01-06
+
+#ifndef __POINT_H
+#define __POINT_H
+
+#include <cmath>
+#include <iostream>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+  /// A Point represents a point in :math:`\mathbb{R}^3` with
+  /// coordinates :math:`x, y, z,` or alternatively, a vector in
+  /// :math:`\mathbb{R}^3`, supporting standard operations like the
+  /// norm, distances, scalar and vector products etc.
+
+  class Point
+  {
+  public:
+
+    /// Create a point at (x, y, z). Default value (0, 0, 0).
+    ///
+    /// *Arguments*
+    ///     x (double)
+    ///         The x-coordinate.
+    ///     y (double)
+    ///         The y-coordinate.
+    ///     z (double)
+    ///         The z-coordinate.
+    Point(const double x=0.0, const double y=0.0, const double z=0.0)
+    { _x[0] = x; _x[1] = y; _x[2] = z; }
+
+    /// Create point from array
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         Dimension of the array.
+    ///     x (double)
+    ///         The array to create a Point from.
+    Point(std::size_t dim, const double* x)
+    { for (std::size_t i = 0; i < 3; i++) _x[i] = (i < dim ? x[i] : 0.0); }
+
+    /// Copy constructor
+    ///
+    /// *Arguments*
+    ///     p (_Point_)
+    ///         The object to be copied.
+    Point(const Point& p)
+    { _x[0] = p._x[0]; _x[1] = p._x[1]; _x[2] = p._x[2]; }
+
+    /// Destructor
+    ~Point() {}
+
+    /// Return address of coordinate in direction i
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Direction.
+    ///
+    /// *Returns*
+    ///     double
+    ///         Adress of coordinate in the given direction.
+    double& operator[] (std::size_t i)
+    { dolfin_assert(i < 3); return _x[i]; }
+
+    /// Return coordinate in direction i
+    ///
+    /// *Arguments*
+    ///     i (std::size_t)
+    ///         Direction.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The coordinate in the given direction.
+    double operator[] (std::size_t i) const
+    { dolfin_assert(i < 3); return _x[i]; }
+
+    /// Return x-coordinate
+    ///
+    /// *Returns*
+    ///     double
+    ///         The x-coordinate.
+    double x() const
+    { return _x[0]; }
+
+    /// Return y-coordinate
+    ///
+    /// *Returns*
+    ///     double
+    ///         The y-coordinate.
+    double y() const
+    { return _x[1]; }
+
+    /// Return z-coordinate
+    ///
+    /// *Returns*
+    ///     double
+    ///         The z-coordinate.
+    double z() const
+    { return _x[2]; }
+
+    /// Return coordinate array
+    ///
+    /// *Returns*
+    ///     list of doubles
+    ///         The coordinates.
+    double* coordinates()
+    { return _x; }
+
+    /// Return coordinate array (const. version)
+    ///
+    /// *Returns*
+    ///     list of doubles
+    ///         The coordinates.
+    const double* coordinates() const
+    { return _x; }
+
+    /// Compute sum of two points
+    Point operator+ (const Point& p) const
+    { Point q(_x[0] + p._x[0], _x[1] + p._x[1], _x[2] + p._x[2]); return q; }
+
+    /// Compute difference of two points
+    Point operator- (const Point& p) const
+    { Point q(_x[0] - p._x[0], _x[1] - p._x[1], _x[2] - p._x[2]); return q; }
+
+    /// Add given point
+    const Point& operator+= (const Point& p)
+    { _x[0] += p._x[0]; _x[1] += p._x[1]; _x[2] += p._x[2]; return *this; }
+
+    /// Subtract given point
+    const Point& operator-= (const Point& p)
+    { _x[0] -= p._x[0]; _x[1] -= p._x[1]; _x[2] -= p._x[2]; return *this; }
+
+    /// Unary minus
+    Point operator- ()
+    { Point p(-_x[0], -_x[1], -_x[2]); return p; }
+
+    /// Multiplication with scalar
+    Point operator* (double a) const
+    { Point p(a*_x[0], a*_x[1], a*_x[2]); return p; }
+
+    /// Incremental multiplication with scalar
+    const Point& operator*= (double a)
+    { _x[0] *= a; _x[1] *= a; _x[2] *= a; return *this; }
+
+    /// Division by scalar
+    Point operator/ (double a) const
+    { Point p(_x[0]/a, _x[1]/a, _x[2]/a); return p; }
+
+    /// Incremental division by scalar
+    const Point& operator/= (double a)
+    { _x[0] /= a; _x[1] /= a; _x[2] /= a; return *this; }
+
+    /// Assignment operator
+    const Point& operator= (const Point& p)
+    { _x[0] = p._x[0]; _x[1] = p._x[1]; _x[2] = p._x[2]; return *this; }
+
+    /// Compute squared distance to given point
+    ///
+    /// *Arguments*
+    ///     p (_Point_)
+    ///         The point to compute distance to.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The squared distance.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Point p1(0, 4, 0);
+    ///         Point p2(2, 0, 4);
+    ///         info("%g", p1.squared_distance(p2));
+    ///
+    ///     output::
+    ///
+    ///         6
+    double squared_distance(const Point& p) const;
+
+    /// Compute distance to given point
+    ///
+    /// *Arguments*
+    ///     p (_Point_)
+    ///         The point to compute distance to.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The distance.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Point p1(0, 4, 0);
+    ///         Point p2(2, 0, 4);
+    ///         info("%g", p1.distance(p2));
+    ///
+    ///     output::
+    ///
+    ///         6
+    inline double distance(const Point& p) const
+    { return sqrt(squared_distance(p)); }
+
+    /// Compute norm of point representing a vector from the origin
+    ///
+    /// *Returns*
+    ///     double
+    ///         The (Euclidean) norm of the vector from the origin to
+    ///         the point.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Point p(1.0, 2.0, 2.0);
+    ///         info("%g", p.norm());
+    ///
+    ///     output::
+    ///
+    ///         3
+    double norm() const
+    {
+      return std::sqrt(_x[0]*_x[0] + _x[1]*_x[1] + _x[2]*_x[2]);
+    }
+
+    /// Compute norm of point representing a vector from the origin
+    ///
+    /// *Returns*
+    ///     double
+    ///         The squared (Euclidean) norm of the vector from the
+    ///         origin of the point.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Point p(1.0, 2.0, 2.0);
+    ///         info("%g", p.squared_norm());
+    ///
+    ///     output::
+    ///
+    ///         9
+    double squared_norm() const
+    {
+      return _x[0]*_x[0] + _x[1]*_x[1] + _x[2]*_x[2];
+    }
+
+    /// Compute cross product with given vector
+    ///
+    /// *Arguments*
+    ///     p (_Point_)
+    ///         Another point.
+    ///
+    /// *Returns*
+    ///     Point
+    ///         The cross product.
+    const Point cross(const Point& p) const;
+
+    /// Compute dot product with given vector
+    ///
+    /// *Arguments*
+    ///     p (_Point_)
+    ///         Another point.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The dot product.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Point p1(1.0, 4.0, 8.0);
+    ///         Point p2(2.0, 0.0, 0.0);
+    ///         info("%g", p1.dot(p2));
+    ///
+    ///     output::
+    ///
+    ///         2
+    double dot(const Point& p) const;
+
+    /// Rotate around a given axis
+    ///
+    /// *Arguments*
+    ///     a (_Point_)
+    ///         The axis to rotate around. Must be unit length.
+    ///     theta (_double_)
+    ///         The rotation angle.
+    ///
+    /// *Returns*
+    ///     Point
+    ///         The rotated point.
+    Point rotate(const Point& a, double theta) const;
+
+    // Note: Not a subclass of Variable for efficiency!
+
+    /// Return informal string representation (pretty-print)
+    ///
+    /// *Arguments*
+    ///     verbose (bool)
+    ///         Flag to turn on additional output.
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         An informal representation of the function space.
+    std::string str(bool verbose=false) const;
+
+  private:
+
+    double _x[3];
+
+  };
+
+  /// Multiplication with scalar
+  inline Point operator*(double a, const Point& p)
+  { return p*a; }
+
+  inline std::ostream& operator<<(std::ostream& stream, const Point& point)
+  { stream << point.str(false); return stream; }
+
+}
+
+#endif
diff --git a/dolfin/geometry/SimplexQuadrature.cpp b/dolfin/geometry/SimplexQuadrature.cpp
new file mode 100644
index 0000000..f7f115b
--- /dev/null
+++ b/dolfin/geometry/SimplexQuadrature.cpp
@@ -0,0 +1,108 @@
+// Copyright (C) 2014 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2014-02-24
+// Last changed: 2014-03-03
+
+#include <dolfin/log/log.h>
+#include "SimplexQuadrature.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::pair<std::vector<double>, std::vector<double> >
+SimplexQuadrature::compute_quadrature_rule(const double* coordinates,
+                                           std::size_t tdim,
+                                           std::size_t gdim,
+                                           std::size_t order)
+{
+  switch (tdim)
+  {
+  case 1:
+    return compute_quadrature_rule_interval(coordinates, gdim, order);
+    break;
+  case 2:
+    return compute_quadrature_rule_triangle(coordinates, gdim, order);
+    break;
+  case 3:
+    return compute_quadrature_rule_tetrahedron(coordinates, gdim, order);
+    break;
+  default:
+    dolfin_error("SimplexQuadrature.cpp",
+                 "compute quadrature rule for simplex",
+                 "Only implemented for topological dimension 1, 2, 3");
+  };
+
+  std::pair<std::vector<double>, std::vector<double> > quadrature_rule;
+  return quadrature_rule;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::vector<double>, std::vector<double> >
+SimplexQuadrature::compute_quadrature_rule_interval(const double* coordinates,
+                                                    std::size_t gdim,
+                                                    std::size_t order)
+{
+  std::pair<std::vector<double>, std::vector<double> > quadrature_rule;
+
+  // FIXME: Not implemented
+
+  return quadrature_rule;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::vector<double>, std::vector<double> >
+SimplexQuadrature::compute_quadrature_rule_triangle(const double* coordinates,
+                                                    std::size_t gdim,
+                                                    std::size_t order)
+{
+  std::pair<std::vector<double>, std::vector<double> > quadrature_rule;
+
+  // FIXME: Temporary implementation just so we have something to work with
+
+  // Compute area of triangle
+  const double* x0 = coordinates;
+  const double* x1 = coordinates + 2;
+  const double* x2 = coordinates + 4;
+  const double A = 0.5*std::abs((x0[0]*x1[1] + x0[1]*x2[0] + x1[0]*x2[1]) -
+                                (x2[0]*x1[1] + x2[1]*x0[0] + x1[0]*x0[1]));
+
+  // Quadrature weights
+  std::vector<double> w;
+  w.push_back(A / 3);
+  w.push_back(A / 3);
+  w.push_back(A / 3);
+
+  // Quadrature points
+  std::vector<double> x;
+  x.push_back(x0[0]); x.push_back(x0[1]);
+  x.push_back(x1[0]); x.push_back(x1[1]);
+  x.push_back(x2[0]); x.push_back(x2[1]);
+
+  return std::make_pair(w, x);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::vector<double>, std::vector<double> >
+SimplexQuadrature::compute_quadrature_rule_tetrahedron(const double* coordinates,
+                                                       std::size_t gdim,
+                                                       std::size_t order)
+{
+  std::pair<std::vector<double>, std::vector<double> > quadrature_rule;
+
+  // FIXME: Not implemented
+
+  return quadrature_rule;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/SimplexQuadrature.h b/dolfin/geometry/SimplexQuadrature.h
new file mode 100644
index 0000000..4537f2f
--- /dev/null
+++ b/dolfin/geometry/SimplexQuadrature.h
@@ -0,0 +1,122 @@
+// Copyright (C) 2014 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2014-02-24
+// Last changed: 2014-03-03
+
+#ifndef __SIMPLEX_QUADRATURE_H
+#define __SIMPLEX_QUADRATURE_H
+
+#include <vector>
+#include "Point.h"
+
+namespace dolfin
+{
+
+  class SimplexQuadrature
+  {
+  public:
+
+    /// Compute quadrature rule for simplex.
+    ///
+    /// *Arguments*
+    ///     coordinates (double *)
+    ///         A flattened array of simplex coordinates of
+    ///         dimension num_vertices x gdim = (tdim + 1)*gdim.
+    ///     tdim (std::size_t)
+    ///         The topological dimension of the simplex.
+    ///     gdim (std::size_t)
+    ///         The geometric dimension.
+    ///     order (std::size_t)
+    ///         The order of convergence of the quadrature rule.
+    ///
+    /// *Returns*
+    ///     std::pair<std::vector<double>, std::vector<double> >
+    ///         An array of quadrature weights and a corresponding
+    ///         flattened array of quadrature points.
+    static std::pair<std::vector<double>, std::vector<double> >
+    compute_quadrature_rule(const double* coordinates,
+                            std::size_t tdim,
+                            std::size_t gdim,
+                            std::size_t order);
+
+    /// Compute quadrature rule for interval.
+    ///
+    /// *Arguments*
+    ///     coordinates (double *)
+    ///         A flattened array of simplex coordinates of
+    ///         dimension num_vertices x gdim = 2*gdim.
+    ///     gdim (std::size_t)
+    ///         The geometric dimension.
+    ///     order (std::size_t)
+    ///         The order of convergence of the quadrature rule.
+    ///
+    /// *Returns*
+    ///     std::pair<std::vector<double>, std::vector<double> >
+    ///         An array of quadrature weights and a corresponding
+    ///         flattened array of quadrature points.
+    static std::pair<std::vector<double>, std::vector<double> >
+    compute_quadrature_rule_interval(const double* coordinates,
+                                     std::size_t gdim,
+                                     std::size_t order);
+
+    /// Compute quadrature rule for triangle.
+    ///
+    /// *Arguments*
+    ///     coordinates (double *)
+    ///         A flattened array of simplex coordinates of
+    ///         dimension num_vertices x gdim = 3*gdim.
+    ///     gdim (std::size_t)
+    ///         The geometric dimension.
+    ///     order (std::size_t)
+    ///         The order of convergence of the quadrature rule.
+    ///
+    /// *Returns*
+    ///     std::pair<std::vector<double>, std::vector<double> >
+    ///         An array of quadrature weights and a corresponding
+    ///         flattened array of quadrature points.
+    static std::pair<std::vector<double>, std::vector<double> >
+    compute_quadrature_rule_triangle(const double* coordinates,
+                                     std::size_t gdim,
+                                     std::size_t order);
+
+    /// Compute quadrature rule for tetrahedron.
+    ///
+    /// *Arguments*
+    ///     coordinates (double *)
+    ///         A flattened array of simplex coordinates of
+    ///         dimension num_vertices x gdim = 4*gdim.
+    ///     gdim (std::size_t)
+    ///         The geometric dimension.
+    ///     order (std::size_t)
+    ///         The order of convergence of the quadrature rule.
+    ///
+    /// *Returns*
+    ///     std::pair<std::vector<double>, std::vector<double> >
+    ///         An array of quadrature weights and a corresponding
+    ///         flattened array of quadrature points.
+    static std::pair<std::vector<double>, std::vector<double> >
+    compute_quadrature_rule_tetrahedron(const double* coordinates,
+                                        std::size_t gdim,
+                                        std::size_t order);
+
+  };
+
+}
+
+#endif
+
diff --git a/dolfin/geometry/dolfin_geometry.h b/dolfin/geometry/dolfin_geometry.h
new file mode 100644
index 0000000..025fc28
--- /dev/null
+++ b/dolfin/geometry/dolfin_geometry.h
@@ -0,0 +1,14 @@
+#ifndef __DOLFIN_GEOMETRY_H
+#define __DOLFIN_GEOMETRY_H
+
+// DOLFIN geometry interface
+
+#include <dolfin/geometry/ImplicitSurface.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/geometry/BoundingBoxTree.h>
+#include <dolfin/geometry/GenericBoundingBoxTree.h>
+#include <dolfin/geometry/BoundingBoxTree3D.h>
+#include <dolfin/geometry/MeshPointIntersection.h>
+#include <dolfin/geometry/intersect.h>
+
+#endif
diff --git a/dolfin/geometry/intersect.cpp b/dolfin/geometry/intersect.cpp
new file mode 100644
index 0000000..bc7364f
--- /dev/null
+++ b/dolfin/geometry/intersect.cpp
@@ -0,0 +1,33 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-30
+// Last changed: 2013-05-30
+
+#include "MeshPointIntersection.h"
+#include "intersect.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::shared_ptr<const MeshPointIntersection>
+dolfin::intersect(const Mesh& mesh, const Point& point)
+{
+  return std::shared_ptr<const MeshPointIntersection>
+    (new MeshPointIntersection(mesh, point));
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/geometry/intersect.h b/dolfin/geometry/intersect.h
new file mode 100644
index 0000000..cd34ebb
--- /dev/null
+++ b/dolfin/geometry/intersect.h
@@ -0,0 +1,50 @@
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-18
+// Last changed: 2013-05-30
+
+#ifndef __INTERSECT_H
+#define __INTERSECT_H
+
+#include <memory>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  class Point;
+  class MeshPointIntersection;
+
+  /// Compute and return intersection between _Mesh_ and _Point_.
+  ///
+  /// *Arguments*
+  ///     mesh (_Mesh_)
+  ///         The mesh to be intersected.
+  ///     point (_Point_)
+  ///         The point to be intersected.
+  ///
+  /// *Returns*
+  ///     _MeshPointIntersection_
+  ///         The intersection data.
+  std::shared_ptr<const MeshPointIntersection>
+  intersect(const Mesh& mesh, const Point& point);
+
+}
+
+#endif
diff --git a/dolfin/graph/BoostGraphColoring.h b/dolfin/graph/BoostGraphColoring.h
new file mode 100644
index 0000000..ee14ee7
--- /dev/null
+++ b/dolfin/graph/BoostGraphColoring.h
@@ -0,0 +1,123 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-11-24
+// Last changed:
+
+#ifndef __DOLFIN_BOOST_GRAPH_INTERFACE_H
+#define __DOLFIN_BOOST_GRAPH_INTERFACE_H
+
+#include <iostream>
+#include <vector>
+
+#include <boost/graph/adjacency_list.hpp>
+#include <boost/graph/compressed_sparse_row_graph.hpp>
+#include <boost/graph/sequential_vertex_coloring.hpp>
+#include <dolfin/common/Timer.h>
+#include "Graph.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class colors a graph using the Boost Graph Library.
+
+  class BoostGraphColoring
+  {
+
+  public:
+
+    /// Compute vertex colors
+    template<typename ColorType>
+    static std::size_t compute_local_vertex_coloring(const Graph& graph,
+                                     std::vector<ColorType>& colors)
+    {
+      Timer timer("Boost graph coloring (from dolfin::Graph)");
+
+      // Typedef for Boost compressed sparse row graph
+      typedef boost::compressed_sparse_row_graph<boost::directedS,
+        boost::property<boost::vertex_color_t, ColorType> > BoostGraph;
+
+      // Number of vertices
+      const std::size_t n = graph.size();
+
+      // Count number of edges
+      Graph::const_iterator vertex;
+      std::size_t num_edges = 0;
+      for (vertex = graph.begin(); vertex != graph.end(); ++vertex)
+        num_edges += vertex->size();
+
+      // Build list of graph edges
+      std::vector<std::pair<std::size_t, std::size_t> > edges;
+      edges.reserve(num_edges);
+      graph_set_type::const_iterator edge;
+      for (vertex = graph.begin(); vertex != graph.end(); ++vertex)
+      {
+        for (edge = vertex->begin(); edge != vertex->end(); ++edge)
+        {
+          const std::size_t vertex_index = vertex - graph.begin();
+          if (vertex_index != *edge)
+            edges.push_back(std::make_pair(vertex_index, *edge));
+        }
+      }
+      // Build Boost graph
+      const BoostGraph g(boost::edges_are_unsorted_multi_pass,
+                         edges.begin(), edges.end(), n);
+
+      // Resize vector to hold colors
+      colors.resize(n);
+
+      // Perform coloring
+      return compute_local_vertex_coloring(g, colors);
+    }
+
+    /// Compute vertex colors
+    template<typename T, typename ColorType>
+    static std::size_t compute_local_vertex_coloring(const T& graph,
+                                            std::vector<ColorType>& colors)
+    {
+      Timer timer("Boost graph coloring");
+
+      // Number of vertices in graph
+      const std::size_t num_vertices = boost::num_vertices(graph);
+      dolfin_assert(num_vertices == colors.size());
+
+      typedef typename boost::graph_traits<T>::vertices_size_type
+        vert_size_type;
+      typedef typename boost::property_map<T,
+        boost::vertex_index_t>::const_type vert_index_map;
+
+      // Resize to hold colors
+      colors.resize(num_vertices);
+
+      // Color vertices
+      std::vector<vert_size_type> _colors(num_vertices);
+      boost::iterator_property_map<vert_size_type*, vert_index_map>
+          color(&_colors.front(), get(boost::vertex_index, graph));
+      const vert_size_type num_colors = sequential_vertex_coloring(graph,
+                                                                   color);
+
+      // Coppy colors and return
+      std::copy(_colors.begin(), _colors.end(), colors.begin());
+      return num_colors;
+    }
+
+  };
+}
+
+#endif
diff --git a/dolfin/graph/BoostGraphOrdering.cpp b/dolfin/graph/BoostGraphOrdering.cpp
new file mode 100644
index 0000000..cafb868
--- /dev/null
+++ b/dolfin/graph/BoostGraphOrdering.cpp
@@ -0,0 +1,194 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-07-06
+// Last changed: 2012-11-12
+
+#define BOOST_NO_HASH
+
+#include <boost/graph/compressed_sparse_row_graph.hpp>
+#include <boost/graph/cuthill_mckee_ordering.hpp>
+#include <boost/graph/properties.hpp>
+
+#include <dolfin/common/Timer.h>
+#include "Graph.h"
+#include "BoostGraphOrdering.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::vector<std::size_t>
+  BoostGraphOrdering::compute_cuthill_mckee(const Graph& graph, bool reverse)
+{
+  Timer timer("Boost Cuthill-McKee graph ordering (from dolfin::Graph)");
+
+  // Number of vertices
+  const std::size_t n = graph.size();
+
+  // Typedef for Boost compressed sparse row graph
+  typedef boost::compressed_sparse_row_graph<boost::directedS> BoostGraph;
+
+  // Build Boost graph
+  const BoostGraph boost_graph = build_csr_directed_graph<BoostGraph>(graph);
+
+  // Check if graph has no edges
+  std::vector<std::size_t> map(n);
+  if (boost::num_edges(boost_graph) == 0)
+  {
+    // Graph has no edges, so no need to re-order
+    for (std::size_t i = 0; i < map.size(); ++i)
+      map[i] = i;
+  }
+  else
+  {
+    // Boost vertex -> index map
+    const boost::property_map<BoostGraph, boost::vertex_index_t>::type
+      boost_index_map = get(boost::vertex_index, boost_graph);
+
+    // Compute graph re-ordering
+    std::vector<std::size_t> inv_perm(n);
+    if (!reverse)
+      boost::cuthill_mckee_ordering(boost_graph, inv_perm.begin());
+    else
+      boost::cuthill_mckee_ordering(boost_graph, inv_perm.rbegin());
+
+    // Build old-to-new vertex map
+    for (std::size_t i = 0; i < map.size(); ++i)
+      map[boost_index_map[inv_perm[i]]] = i;
+  }
+
+  return map;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t>
+  BoostGraphOrdering::compute_cuthill_mckee(const std::set<std::pair<std::size_t, std::size_t> >& edges,
+                                            std::size_t size, bool reverse)
+{
+  Timer timer("Boost Cuthill-McKee graph ordering");
+
+  // Typedef for Boost compressed sparse row graph
+  typedef boost::compressed_sparse_row_graph<boost::directedS> BoostGraph;
+
+  // Build Boost graph
+  const BoostGraph boost_graph(boost::edges_are_unsorted_multi_pass,
+                         edges.begin(), edges.end(), size);
+
+  // Check if graph has no edges
+  std::vector<std::size_t> map(size);
+  if (boost::num_edges(boost_graph) == 0)
+  {
+    // Graph has no edges, so no need to re-order
+    for (std::size_t i = 0; i < map.size(); ++i)
+      map[i] = i;
+  }
+  else
+  {
+    // Get Boost vertex -> index map
+    const boost::property_map<BoostGraph, boost::vertex_index_t>::type
+      boost_index_map = get(boost::vertex_index, boost_graph);
+
+    // Compute graph re-ordering
+    std::vector<std::size_t> inv_perm(size);
+    if (!reverse)
+      boost::cuthill_mckee_ordering(boost_graph, inv_perm.begin());
+    else
+      boost::cuthill_mckee_ordering(boost_graph, inv_perm.rbegin());
+
+    // Build old-to-new vertex map
+    for (std::size_t i = 0; i < size; ++i)
+      map[boost_index_map[inv_perm[i]]] = i;
+  }
+
+  return map;
+}
+//-----------------------------------------------------------------------------
+template<typename T, typename X>
+T BoostGraphOrdering::build_undirected_graph(const X& graph)
+{
+  Timer timer("Build Boost undirected graph");
+
+  // Graph size
+  const std::size_t n = graph.size();
+
+  // Build Boost graph
+  T boost_graph(n);
+  typename X::const_iterator vertex;
+  graph_set_type::const_iterator edge;
+  for (vertex = graph.begin(); vertex != graph.end(); ++vertex)
+  {
+    const std::size_t vertex_index = vertex - graph.begin();
+    for (edge = vertex->begin(); edge != vertex->end(); ++edge)
+    {
+      if (vertex_index < *edge)
+        boost::add_edge(vertex_index, *edge, boost_graph);
+    }
+  }
+
+  return boost_graph;
+}
+//-----------------------------------------------------------------------------
+template<typename T, typename X>
+T BoostGraphOrdering::build_directed_graph(const X& graph)
+{
+  Timer timer("Build Boost directed graph");
+
+  // Graph size
+  const std::size_t n = graph.size();
+
+  // Build Boost graph
+  T boost_graph(n);
+  typename X::const_iterator vertex;
+  graph_set_type::const_iterator edge;
+  for (vertex = graph.begin(); vertex != graph.end(); ++vertex)
+  {
+    const std::size_t vertex_index = vertex - graph.begin();
+    for (edge = vertex->begin(); edge != vertex->end(); ++edge)
+    {
+      if (vertex_index != *edge)
+        boost::add_edge(vertex_index, *edge, boost_graph);
+    }
+  }
+
+  return boost_graph;
+}
+//-----------------------------------------------------------------------------
+template<typename T, typename X>
+T BoostGraphOrdering::build_csr_directed_graph(const X& graph)
+{
+  Timer timer("Build Boost CSR graph");
+
+  // Count number of edges
+  Graph::const_iterator vertex;
+  std::size_t num_edges = 0;
+  for (vertex = graph.begin(); vertex != graph.end(); ++vertex)
+    num_edges += vertex->size();
+
+  // Build list of graph edges
+  std::vector<std::pair<std::size_t, std::size_t> > edges;
+  edges.reserve(num_edges);
+  graph_set_type::const_iterator edge;
+  for (vertex = graph.begin(); vertex != graph.end(); ++vertex)
+    for (edge = vertex->begin(); edge != vertex->end(); ++edge)
+      edges.push_back(std::make_pair(vertex - graph.begin(), *edge));
+
+  // Number of vertices
+  const std::size_t n = graph.size();
+
+  // Build and return Boost graph
+  return T(boost::edges_are_unsorted_multi_pass, edges.begin(), edges.end(), n);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/graph/BoostGraphOrdering.h b/dolfin/graph/BoostGraphOrdering.h
new file mode 100644
index 0000000..07550ea
--- /dev/null
+++ b/dolfin/graph/BoostGraphOrdering.h
@@ -0,0 +1,66 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-07-06
+// Last changed: 2012-11-12
+
+#ifndef __DOLFIN_BOOST_GRAPH_ORDERING_H
+#define __DOLFIN_BOOST_GRAPH_ORDERING_H
+
+#include <set>
+#include <utility>
+#include <vector>
+#include "Graph.h"
+
+namespace dolfin
+{
+
+  /// This class computes graph re-orderings. It uses Boost Graph.
+
+  class BoostGraphOrdering
+  {
+
+  public:
+
+    /// Compute re-ordering (map[old] -> new) using Cuthill-McKee algorithm
+    static std::vector<std::size_t> compute_cuthill_mckee(const Graph& graph,
+                                                          bool reverse=false);
+
+    /// Compute re-ordering (map[old] -> new) using Cuthill-McKee algorithm
+    static std::vector<std::size_t>
+      compute_cuthill_mckee(const std::set<std::pair<std::size_t, std::size_t> >& edges,
+                            std::size_t size, bool reverse=false);
+
+  private:
+
+    // Build Boost undirected graph
+    template<typename T, typename X>
+    static T build_undirected_graph(const X& graph);
+
+    // Build Boost directed graph
+    template<typename T, typename X>
+    static T build_directed_graph(const X& graph);
+
+    // Build Boost compressed sparse row graph
+    template<typename T, typename X>
+    static T build_csr_directed_graph(const X& graph);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/graph/Graph.h b/dolfin/graph/Graph.h
new file mode 100644
index 0000000..bfe0424
--- /dev/null
+++ b/dolfin/graph/Graph.h
@@ -0,0 +1,43 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-11-16
+// Last changed: 2010-11-25
+
+#ifndef __GRAPH_TYPES_H
+#define __GRAPH_TYPES_H
+
+#include <vector>
+
+#define BOOST_NO_HASH
+
+#include <boost/graph/adjacency_list.hpp>
+#include <boost/unordered_set.hpp>
+#include <dolfin/common/Set.h>
+
+namespace dolfin
+{
+
+  /// Typedefs for simple graph data structures
+
+  /// Vector of unordered sets
+  typedef dolfin::Set<std::size_t> graph_set_type;
+  typedef std::vector<graph_set_type> Graph;
+
+}
+
+#endif
diff --git a/dolfin/graph/GraphBuilder.cpp b/dolfin/graph/GraphBuilder.cpp
new file mode 100644
index 0000000..7588b8d
--- /dev/null
+++ b/dolfin/graph/GraphBuilder.cpp
@@ -0,0 +1,368 @@
+// Copyright (C) 2010-2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Chris Richardson, 2012
+//
+// First added:  2010-02-19
+// Last changed: 2013-01-31
+
+#include <algorithm>
+#include <numeric>
+#include <set>
+#include <utility>
+#include <vector>
+#include <boost/unordered_map.hpp>
+#include <boost/unordered_set.hpp>
+
+#include <dolfin/log/log.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/types.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/Vertex.h>
+#include "GraphBuilder.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Graph GraphBuilder::local_graph(const Mesh& mesh, const GenericDofMap& dofmap0,
+                                                  const GenericDofMap& dofmap1)
+{
+  // Create empty graph
+  const std::size_t n = dofmap0.global_dimension();
+  Graph graph(n);
+
+  // Build graph
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    const std::vector<dolfin::la_index>& dofs0
+      = dofmap0.cell_dofs(cell->index());
+    const std::vector<dolfin::la_index>& dofs1
+      = dofmap1.cell_dofs(cell->index());
+    std::vector<dolfin::la_index>::const_iterator node0, node1;
+    for (node0 = dofs0.begin(); node0 != dofs0.end(); ++node0)
+      for (node1 = dofs1.begin(); node1 != dofs1.end(); ++node1)
+        if (*node0 != *node1)
+          graph[*node0].insert(*node1);
+  }
+
+  return graph;
+}
+//-----------------------------------------------------------------------------
+Graph GraphBuilder::local_graph(const Mesh& mesh,
+                                const std::vector<std::size_t>& coloring_type)
+{
+  // Initialise mesh
+  for (std::size_t i = 0; i < coloring_type.size(); ++i)
+    mesh.init(coloring_type[i]);
+  for (std::size_t i = 1; i < coloring_type.size(); ++i)
+    mesh.init(coloring_type[i - 1], coloring_type[i]);
+
+  // Check coloring type
+  dolfin_assert(coloring_type.size() >= 2);
+  dolfin_assert(coloring_type.front() == coloring_type.back());
+
+  // Create graph
+  const std::size_t num_verticies = mesh.num_entities(coloring_type[0]);
+  Graph graph(num_verticies);
+
+  // Build graph
+  for (MeshEntityIterator vertex_entity(mesh, coloring_type[0]);
+       !vertex_entity.end(); ++vertex_entity)
+  {
+    const std::size_t vertex_entity_index = vertex_entity->index();
+
+    boost::unordered_set<std::size_t> entity_list0;
+    boost::unordered_set<std::size_t> entity_list1;
+    entity_list0.insert(vertex_entity_index);
+
+    // Build list of entities, moving between levels
+    for (std::size_t level = 1; level < coloring_type.size(); ++level)
+    {
+      for (boost::unordered_set<std::size_t>::const_iterator entity_index
+             = entity_list0.begin(); entity_index != entity_list0.end();
+           ++entity_index)
+      {
+        const MeshEntity entity(mesh, coloring_type[level -1], *entity_index);
+        for (MeshEntityIterator neighbor(entity, coloring_type[level]);
+             !neighbor.end(); ++neighbor)
+        {
+          entity_list1.insert(neighbor->index());
+        }
+      }
+      entity_list0 = entity_list1;
+      entity_list1.clear();
+    }
+
+    // Add edges to graph
+    graph[vertex_entity_index].insert(entity_list0.begin(),
+                                      entity_list0.end());
+  }
+
+  return graph;
+}
+//-----------------------------------------------------------------------------
+Graph GraphBuilder::local_graph(const Mesh& mesh,
+                                std::size_t dim0, std::size_t dim1)
+{
+  mesh.init(dim0);
+  mesh.init(dim1);
+  mesh.init(dim0, dim1);
+  mesh.init(dim1, dim0);
+
+  // Create graph
+  const std::size_t num_verticies = mesh.num_entities(dim0);
+  Graph graph(num_verticies);
+
+  // Build graph
+  for (MeshEntityIterator colored_entity(mesh, dim0); !colored_entity.end();
+       ++colored_entity)
+  {
+    const std::size_t colored_entity_index = colored_entity->index();
+    for (MeshEntityIterator entity(*colored_entity, dim1); !entity.end();
+         ++entity)
+    {
+      for (MeshEntityIterator neighbor(*entity, dim0); !neighbor.end();
+           ++neighbor)
+      {
+        if (colored_entity_index != neighbor->index())
+          graph[colored_entity_index].insert(neighbor->index());
+      }
+    }
+  }
+
+  return graph;
+}
+//-----------------------------------------------------------------------------
+void GraphBuilder::compute_dual_graph(const MPI_Comm mpi_comm,
+                                      const LocalMeshData& mesh_data,
+                            std::vector<std::set<std::size_t> >& local_graph,
+                            std::set<std::size_t>& ghost_vertices)
+{
+  FacetCellMap facet_cell_map;
+
+  #ifdef HAS_MPI
+  compute_local_dual_graph(mpi_comm, mesh_data, local_graph, facet_cell_map);
+  compute_nonlocal_dual_graph(mpi_comm, mesh_data, local_graph, facet_cell_map,
+                              ghost_vertices);
+  #else
+  compute_local_dual_graph(mpi_comm, mesh_data, local_graph, facet_cell_map);
+  #endif
+}
+//-----------------------------------------------------------------------------
+void GraphBuilder::compute_local_dual_graph(const MPI_Comm mpi_comm,
+                                            const LocalMeshData& mesh_data,
+                            std::vector<std::set<std::size_t> >& local_graph,
+                            FacetCellMap& facet_cell_map)
+{
+  Timer timer("Compute local dual graph");
+
+  // List of cell vertices
+  const boost::multi_array<std::size_t, 2>& cell_vertices
+    = mesh_data.cell_vertices;
+  const std::size_t num_local_cells = mesh_data.global_cell_indices.size();
+  const std::size_t num_vertices_per_cell = mesh_data.num_vertices_per_cell;
+  const std::size_t num_vertices_per_facet = num_vertices_per_cell - 1;
+
+  dolfin_assert(num_local_cells == cell_vertices.shape()[0]);
+  dolfin_assert(num_vertices_per_cell == cell_vertices.shape()[1]);
+
+  local_graph.resize(num_local_cells);
+  facet_cell_map.clear();
+
+  // Compute local edges (cell-cell connections) using global
+  // (internal to this function, not the user numbering) numbering
+
+  // Get offset for this process
+  const std::size_t cell_offset = MPI::global_offset(mpi_comm, num_local_cells,
+                                                     true);
+
+  // Create map from facet (list of vertex indices) to cells
+  facet_cell_map.rehash((facet_cell_map.size()
+                     + num_local_cells)/facet_cell_map.max_load_factor() + 1);
+
+  // Iterate over all cells
+  std::vector<std::size_t> cellvtx(num_vertices_per_cell);
+  std::pair<std::vector<std::size_t>, std::size_t>
+    map_entry(std::vector<std::size_t>(num_vertices_per_facet), 0);
+  for (std::size_t i = 0; i < num_local_cells; ++i)
+  {
+    // Copy cell vertices and sort into order, taking a subset (minus
+    // one vertex) to form a set of facet vertices
+    std::copy(cell_vertices[i].begin(), cell_vertices[i].end(),
+              cellvtx.begin());
+    std::sort(cellvtx.begin(), cellvtx.end());
+
+    // Copy data to map_entry
+    std::copy(cellvtx.begin() + 1, cellvtx.end(), map_entry.first.begin());
+    map_entry.second = i;
+
+    // Iterate over facets in cell
+    for (std::size_t j = 0; j < num_vertices_per_cell; ++j)
+    {
+      // Map lookup/insert
+      std::pair<FacetCellMap::iterator, bool> map_lookup
+        = facet_cell_map.insert(map_entry);
+
+      // If facet was already in the map
+      if (!map_lookup.second)
+      {
+        // Already in map. Connect cells and delete facet from map
+        // Add offset to cell index when inserting into local_graph
+        local_graph[i].insert(map_lookup.first->second + cell_offset);
+        local_graph[map_lookup.first->second].insert(i + cell_offset);
+
+        // Save memory and search time by erasing
+        facet_cell_map.erase(map_lookup.first);
+      }
+
+      // Change facet by one entry, cycling from [1,2,3] -> [0,2,3]- >
+      // [0,1,3] -> [0,1,2] (for tetrahedron)
+      if (j != num_vertices_per_facet)
+        map_entry.first[j] = cellvtx[j];
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void GraphBuilder::compute_nonlocal_dual_graph(const MPI_Comm mpi_comm,
+                                               const LocalMeshData& mesh_data,
+                            std::vector<std::set<std::size_t> >& local_graph,
+                            FacetCellMap& facet_cell_map,
+                            std::set<std::size_t>& ghost_vertices)
+{
+  Timer timer("Compute non-local dual graph");
+
+  // At this stage facet_cell map only contains facets->cells with
+  // edge facets either interprocess or external boundaries
+
+  // List of cell vertices
+  const boost::multi_array<std::size_t, 2>& cell_vertices
+    = mesh_data.cell_vertices;
+  const std::size_t num_local_cells = mesh_data.global_cell_indices.size();
+  const std::size_t num_vertices_per_cell = mesh_data.num_vertices_per_cell;
+  const std::size_t num_vertices_per_facet = num_vertices_per_cell - 1;
+
+  dolfin_assert(num_local_cells == cell_vertices.shape()[0]);
+  dolfin_assert(num_vertices_per_cell == cell_vertices.shape()[1]);
+
+  // Compute local edges (cell-cell connections) using global
+  // (internal to this function, not the user numbering) numbering
+
+  // Get offset for this process
+  const std::size_t offset = MPI::global_offset(mpi_comm, num_local_cells,
+                                                true);
+  const std::size_t num_processes = MPI::size(mpi_comm);
+
+  // Send facet-cell map to intermediary match-making processes
+  std::vector<std::vector<std::size_t> > send_buffer(num_processes);
+  std::vector<std::vector<std::size_t> > received_buffer(num_processes);
+
+  // Pack map data and send to match-maker process
+  boost::unordered_map<std::vector<std::size_t>,
+                       std::size_t>::const_iterator it;
+  for (it = facet_cell_map.begin(); it != facet_cell_map.end(); ++it)
+  {
+    // FIXME: Could use a better index? First vertex is slightly skewed
+    //        towards low values - may not be important
+
+    // Use first vertex of facet to partition into blocks
+    std::size_t dest_proc = MPI::index_owner(mpi_comm, (it->first)[0],
+                                             mesh_data.num_global_vertices);
+
+    // Pack map into vectors to send
+    for (std::size_t i = 0; i < num_vertices_per_facet; ++i)
+      send_buffer[dest_proc].push_back((it->first)[i]);
+
+    // Add offset to cell numbers sent off process
+    send_buffer[dest_proc].push_back(it->second + offset);
+  }
+
+  // Send data
+  MPI::all_to_all(mpi_comm, send_buffer, received_buffer);
+
+  // Clear send buffer
+  send_buffer = std::vector<std::vector<std::size_t> >(num_processes);
+
+  // Map to connect processes and cells, using facet as key
+  typedef boost::unordered_map<std::vector<std::size_t>,
+              std::pair<std::size_t, std::size_t> > MatchMap;
+  MatchMap matchmap;
+
+  // Look for matches to send back to other processes
+  std::pair<std::vector<std::size_t>,
+            std::pair<std::size_t, std::size_t> > key;
+  key.first.resize(num_vertices_per_facet);
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    // Unpack into map
+    const std::vector<std::size_t>& data_p = received_buffer[p];
+    for (std::size_t i = 0; i < data_p.size();
+         i += (num_vertices_per_facet + 1))
+    {
+      // Build map key
+      std::copy(&data_p[i], &data_p[i] + num_vertices_per_facet,
+                key.first.begin());
+      key.second.first = p;
+      key.second.second = data_p[i + num_vertices_per_facet];
+
+      // Perform map insertion/look-up
+      std::pair<MatchMap::iterator, bool> data = matchmap.insert(key);
+
+      // If data is already in the map, extract data and remove from
+      // map
+      if (!data.second)
+      {
+        // Found a match of two facets - send back to owners
+        const std::size_t proc1 = data.first->second.first;
+        const std::size_t proc2 = p;
+        const std::size_t cell1 = data.first->second.second;
+        const std::size_t cell2 = data_p[i + num_vertices_per_facet];
+        send_buffer[proc1].push_back(cell1);
+        send_buffer[proc1].push_back(cell2);
+        send_buffer[proc2].push_back(cell2);
+        send_buffer[proc2].push_back(cell1);
+
+        // Remove facet - saves memory and search time
+        matchmap.erase(data.first);
+      }
+    }
+  }
+
+  // Send matches to other proceses
+  MPI::all_to_all(mpi_comm, send_buffer, received_buffer);
+
+  // Clear ghost vertices
+  ghost_vertices.clear();
+
+  // Flatten received data and insert connected cells into local map
+  for (std::size_t p = 0; p < received_buffer.size(); ++p)
+  {
+    const std::vector<std::size_t>& cell_list = received_buffer[p];
+    for (std::size_t i = 0; i < cell_list.size(); i += 2)
+    {
+      dolfin_assert(cell_list[i] >= offset);
+      dolfin_assert(cell_list[i] - offset < local_graph.size());
+
+      local_graph[cell_list[i] - offset].insert(cell_list[i + 1]);
+      ghost_vertices.insert(cell_list[i + 1]);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/graph/GraphBuilder.h b/dolfin/graph/GraphBuilder.h
new file mode 100644
index 0000000..598a462
--- /dev/null
+++ b/dolfin/graph/GraphBuilder.h
@@ -0,0 +1,91 @@
+// Copyright (C) 2010-2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-02-19
+// Last changed: 2013-01-16
+
+#ifndef __GRAPH_BUILDER_H
+#define __GRAPH_BUILDER_H
+
+#include <set>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <boost/unordered_map.hpp>
+#include <dolfin/common/MPI.h>
+#include "Graph.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericDofMap;
+  class LocalMeshData;
+  class Mesh;
+
+  /// This class builds a Graph corresponding to various objects
+
+  class GraphBuilder
+  {
+
+  public:
+
+    /// Build local graph from dofmap
+    static Graph local_graph(const Mesh& mesh, const GenericDofMap& dofmap0,
+                                               const GenericDofMap& dofmap1);
+
+    /// Build local graph from mesh (general version)
+    static Graph local_graph(const Mesh& mesh,
+                             const std::vector<std::size_t>& coloring_type);
+
+    /// Build local graph (specialized version)
+    static Graph local_graph(const Mesh& mesh, std::size_t dim0,
+                                               std::size_t dim1);
+
+    /// Build distributed dual graph (cell-cell connections) for from
+    /// LocalMeshData
+    static void
+      compute_dual_graph(const MPI_Comm mpi_comm,
+                         const LocalMeshData& mesh_data,
+                         std::vector<std::set<std::size_t> >& local_graph,
+                         std::set<std::size_t>& ghost_vertices);
+
+  private:
+
+    typedef boost::unordered_map<std::vector<std::size_t>, std::size_t>
+      FacetCellMap;
+
+    // Build local part of dual graph for mesh
+    static void
+      compute_local_dual_graph(const MPI_Comm mpi_comm,
+                               const LocalMeshData& mesh_data,
+                               std::vector<std::set<std::size_t> >& local_graph,
+                               FacetCellMap& facet_cell_map);
+
+    // Build nonlocal part of dual graph for mesh.
+    // GraphBuilder::compute_local_dual_graph should be called first.
+    static void
+      compute_nonlocal_dual_graph(const MPI_Comm mpi_comm,
+                                  const LocalMeshData& mesh_data,
+                                  std::vector<std::set<std::size_t> >& local_graph,
+                                  FacetCellMap& facet_cell_map,
+                                  std::set<std::size_t>& ghost_vertices);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/graph/GraphColoring.cpp b/dolfin/graph/GraphColoring.cpp
new file mode 100644
index 0000000..e5df0fb
--- /dev/null
+++ b/dolfin/graph/GraphColoring.cpp
@@ -0,0 +1,58 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring 2011
+// Modified by Anders Logg 2011
+//
+// First added:  2011-02-21
+// Last changed: 2011-05-11
+
+// Included here to avoid a C++ problem with some MPI implementations
+#include <dolfin/common/MPI.h>
+
+#include <string>
+#include <dolfin/common/Array.h>
+#include <dolfin/log/log.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include "BoostGraphColoring.h"
+#include "Graph.h"
+#include "ZoltanInterface.h"
+#include "GraphColoring.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::size_t GraphColoring::compute_local_vertex_coloring(const Graph& graph,
+                                              std::vector<std::size_t>& colors)
+{
+  // Get coloring library from parameter system
+  const std::string colorer = parameters["graph_coloring_library"];
+
+  // Color mesh
+  if (colorer == "Boost")
+    return BoostGraphColoring::compute_local_vertex_coloring(graph, colors);
+  else if (colorer == "Zoltan")
+    return ZoltanInterface::compute_local_vertex_coloring(graph, colors);
+  else
+  {
+    dolfin_error("GraphColoring.cpp",
+                 "compute mesh coloring",
+                 "Unknown coloring type. Known types are \"Boost\" and \"Zoltan\"");
+    return 0;
+  }
+}
+//----------------------------------------------------------------------------
diff --git a/dolfin/graph/GraphColoring.h b/dolfin/graph/GraphColoring.h
new file mode 100644
index 0000000..f5e7925
--- /dev/null
+++ b/dolfin/graph/GraphColoring.h
@@ -0,0 +1,46 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-02-21
+// Last changed:
+
+#ifndef __GRAPH_COLORING_H
+#define __GRAPH_COLORING_H
+
+
+#include <cstddef>
+#include <vector>
+#include "Graph.h"
+
+namespace dolfin
+{
+
+  /// This class provides a common interface to graph coloring libraries
+
+  class GraphColoring
+  {
+
+  public:
+
+    /// Compute vertex colors
+    static std::size_t compute_local_vertex_coloring(const Graph& graph,
+                                            std::vector<std::size_t>& colors);
+
+  };
+}
+
+#endif
diff --git a/dolfin/graph/GraphOrdering.cpp b/dolfin/graph/GraphOrdering.cpp
new file mode 100644
index 0000000..a42cfb5
--- /dev/null
+++ b/dolfin/graph/GraphOrdering.cpp
@@ -0,0 +1,197 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2010-11-15
+// Last changed: 2011-11-15
+
+#ifdef HAS_TRILINOS
+
+// Included here to avoid a C++ problem with some MPI implementations
+#include <dolfin/common/MPI.h>
+
+#include <boost/scoped_array.hpp>
+#include <zoltan_cpp.h>
+
+#include "dolfin/common/MPI.h"
+#include "dolfin/la/GenericSparsityPattern.h"
+#include "dolfin/la/TensorLayout.h"
+#include "dolfin/log/log.h"
+#include "GraphOrdering.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+GraphOrdering::GraphOrdering(const TensorLayout& tensor_layout)
+      : _tensor_layout(tensor_layout)
+{
+  if (tensor_layout.rank() != 2)
+  {
+    dolfin_error("GraphOrdering.cpp",
+                 "create matrix re-ordering",
+                 "Zoltan object for sparsity pattern re-ordering can only be used for rank 2 tensors");
+  }
+
+  if (!tensor_layout.sparsity_pattern())
+  {
+    dolfin_error("GraphOrdering.cpp",
+                 "create matrix re-ordering",
+                 "TensorLayout object must a have sparsity pattern");
+  }
+
+  if (tensor_layout.size(0) != tensor_layout.size(1))
+  {
+    dolfin_error("GraphOrdering.cpp",
+                 "create matrix re-ordering",
+                 "Zoltan object for sparsity pattern re-ordering can only be used for square matrices");
+  }
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> GraphOrdering::compute_local_reordering_map()
+{
+  // Initialise Zoltan
+  float version;
+  int argc = 0;
+  char** argv = NULL;
+  Zoltan_Initialize(argc, argv, &version);
+
+  // Create Zoltan object
+  Zoltan zoltan;
+
+  // Set parameters
+  //zoltan.Set_Param( "ORDER_METHOD", "METIS");
+  zoltan.Set_Param( "ORDER_METHOD", "SCOTCH");
+  zoltan.Set_Param( "NUM_GID_ENTRIES", "1");  // global ID is 1 integer
+  zoltan.Set_Param( "NUM_LID_ENTRIES", "1");  // local ID is 1 integer
+  zoltan.Set_Param( "OBJ_WEIGHT_DIM", "0");   // omit object weights
+
+  // Set call-back functions
+  zoltan.Set_Num_Obj_Fn(GraphOrdering::get_number_of_objects, this);
+  zoltan.Set_Obj_List_Fn(GraphOrdering::get_object_list, this);
+  zoltan.Set_Num_Edges_Multi_Fn(GraphOrdering::get_number_edges, this);
+  zoltan.Set_Edge_List_Multi_Fn(GraphOrdering::get_all_edges, this);
+
+  // Create array for global ids that should be re-ordered
+  std::vector<ZOLTAN_ID_TYPE> global_ids(num_global_objects());
+  for (std::size_t i = 0; i < global_ids.size(); ++i)
+    global_ids[i] = i;
+
+  // Create array for re-ordered vertices
+  std::vector<ZOLTAN_ID_TYPE> new_id(num_global_objects());
+
+  // Compute re-ordering
+  int rc = zoltan.Order(1, num_global_objects(), &global_ids[0], &new_id[0]);
+
+  // Check for errors
+  if (rc != ZOLTAN_OK)
+  {
+    dolfin_error("GraphOrdering.cpp",
+                 "compute matrix re-ordering",
+                 "Zoltan partitioning failed");
+  }
+
+  // Copy re-ordering into a vector (in case Zoltan uses something other than std::size_t)
+  std::vector<std::size_t> map(new_id.begin(), new_id.end());
+
+  return map;
+}
+//-----------------------------------------------------------------------------
+int GraphOrdering::num_global_objects() const
+{
+  return _tensor_layout.size(0);
+}
+//-----------------------------------------------------------------------------
+int GraphOrdering::num_local_objects() const
+{
+  return _tensor_layout.size(0);
+}
+//-----------------------------------------------------------------------------
+void GraphOrdering::num_edges_per_vertex(std::vector<std::size_t>& num_edges) const
+{
+  dolfin_assert(_tensor_layout.sparsity_pattern());
+  _tensor_layout.sparsity_pattern()->num_nonzeros_diagonal(num_edges);
+}
+//-----------------------------------------------------------------------------
+const std::vector<std::vector<std::size_t> > GraphOrdering::edges() const
+{
+  dolfin_assert(_tensor_layout.sparsity_pattern());
+  return _tensor_layout.sparsity_pattern()->diagonal_pattern(GenericSparsityPattern::unsorted);
+}
+//-----------------------------------------------------------------------------
+//-----------------------------------------------------------------------------
+int GraphOrdering::get_number_of_objects(void *data, int *ierr)
+{
+  GraphOrdering *objs = (GraphOrdering *)data;
+  *ierr = ZOLTAN_OK;
+  return objs->num_local_objects();
+}
+//-----------------------------------------------------------------------------
+void GraphOrdering::get_object_list(void *data, int sizeGID, int sizeLID,
+                                ZOLTAN_ID_PTR globalID, ZOLTAN_ID_PTR localID,
+                                int wgt_dim, float *obj_wgts, int *ierr)
+{
+  GraphOrdering *objs = (GraphOrdering *)data;
+  *ierr = ZOLTAN_OK;
+  for (int i = 0; i< objs->num_local_objects(); i++)
+  {
+    globalID[i] = i;
+    localID[i] = i;
+  }
+}
+//-----------------------------------------------------------------------------
+void GraphOrdering::get_number_edges(void *data, int num_gid_entries,
+                                       int num_lid_entries,
+                                       int num_obj, ZOLTAN_ID_PTR global_ids,
+                                       ZOLTAN_ID_PTR local_ids, int *num_edges,
+                                       int *ierr)
+{
+  GraphOrdering *objs = (GraphOrdering *)data;
+
+  // Get number of edges for each graph vertex
+  std::vector<std::size_t> number_edges;
+  objs->num_edges_per_vertex(number_edges);
+
+  // Fill array num_edges array
+  for (std::size_t i = 0; i < number_edges.size(); ++i)
+    num_edges[i] = number_edges[i];
+}
+//-----------------------------------------------------------------------------
+void GraphOrdering::get_all_edges(void *data, int num_gid_entries,
+                                  int num_lid_entries, int num_obj,
+                                  ZOLTAN_ID_PTR global_ids,
+                                  ZOLTAN_ID_PTR local_ids,
+                                  int *num_edges,
+                                  ZOLTAN_ID_PTR nbor_global_id,
+                                  int *nbor_procs, int wgt_dim,
+                                  float *ewgts, int *ierr)
+{
+  GraphOrdering *objs = (GraphOrdering *)data;
+  const std::vector<std::vector<std::size_t> > edges = objs->edges();
+
+  std::size_t sum = 0;
+  for (std::size_t i = 0; i < edges.size(); ++i)
+  {
+    dolfin_assert(static_cast<int>(edges[i].size()) == num_edges[i]);
+    for (std::size_t j = 0; j < edges[i].size(); ++j)
+      nbor_global_id[sum*num_gid_entries + j] = edges[i][j];
+    sum += edges[i].size();
+  }
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/graph/GraphOrdering.h b/dolfin/graph/GraphOrdering.h
new file mode 100644
index 0000000..4d5cd0d
--- /dev/null
+++ b/dolfin/graph/GraphOrdering.h
@@ -0,0 +1,99 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-11-15
+// Last changed:
+
+#ifndef __DOLFIN_ZOLTAN_ORDERING_H
+#define __DOLFIN_ZOLTAN_ORDERING_H
+
+#ifdef HAS_TRILINOS
+
+#include <cstddef>
+#include <vector>
+#include <zoltan_cpp.h>
+#include "dolfin/common/Set.h"
+
+namespace dolfin
+{
+
+
+  class TensorLayout;
+
+  /// This class computes re-ordering based on a SparsityPattern graph
+  /// representation of a sparse matrix. It uses Zoltan, which is part of
+  /// Trilinos.
+
+  class GraphOrdering
+  {
+
+  public:
+
+    /// Constructor
+    GraphOrdering(const TensorLayout& tensor_layout);
+
+    /// Compute re-ordering for process (map[old] -> new)
+    std::vector<std::size_t> compute_local_reordering_map();
+
+  private:
+
+    /// Number of global graph vertices
+    int num_global_objects() const;
+
+    /// Number of local graph vertices
+    int num_local_objects() const;
+
+    /// Number of edges per vertex
+    void num_edges_per_vertex(std::vector<std::size_t>& num_edges) const;
+
+    /// Vertex edges
+    const std::vector<std::vector<std::size_t> > edges() const;
+
+    // Zoltan call-back functions
+
+    static int get_number_of_objects(void* data, int* ierr);
+
+    static void get_object_list(void* data, int sizeGID, int sizeLID,
+                                ZOLTAN_ID_PTR globalID,
+                                ZOLTAN_ID_PTR localID, int wgt_dim,
+                                float* obj_wgts, int* ierr);
+
+    static void get_number_edges(void* data, int num_gid_entries,
+                                 int num_lid_entries,
+                                 int num_obj, ZOLTAN_ID_PTR global_ids,
+                                 ZOLTAN_ID_PTR local_ids, int* num_edges,
+                                 int* ierr);
+
+    static void get_all_edges(void* data, int num_gid_entries,
+                              int num_lid_entries, int num_obj,
+                              ZOLTAN_ID_PTR global_ids,
+                              ZOLTAN_ID_PTR local_ids,
+                              int* num_edges,
+                              ZOLTAN_ID_PTR nbor_global_id,
+                              int* nbor_procs, int wgt_dim,
+                              float* ewgts, int* ierr);
+
+
+    // Tensor layout
+    const TensorLayout& _tensor_layout;
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/graph/ParMETIS.cpp b/dolfin/graph/ParMETIS.cpp
new file mode 100644
index 0000000..439a1bd
--- /dev/null
+++ b/dolfin/graph/ParMETIS.cpp
@@ -0,0 +1,314 @@
+// Copyright (C) 2008-2011 Niclas Jansson, Ola Skavhaug and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2010
+// Modified by Chris Richardson 2013
+//
+// First added:  2010-02-10
+// Last changed: 2013-04-26
+
+#include <dolfin/log/dolfin_log.h>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include "ParMETIS.h"
+#include "GraphBuilder.h"
+
+#ifdef HAS_PARMETIS
+#include <parmetis.h>
+#endif
+
+using namespace dolfin;
+
+#ifdef HAS_PARMETIS
+
+namespace dolfin
+{
+  // This class builds a ParMETIS dual graph
+
+  class ParMETISDualGraph
+  {
+  public:
+
+    // Constructor
+    ParMETISDualGraph(MPI_Comm mpi_comm, const LocalMeshData& mesh_data);
+
+    // Destructor
+    ~ParMETISDualGraph();
+
+    // ParMETIS data
+    std::vector<idx_t> elmdist;
+    std::vector<idx_t> eptr;
+    std::vector<idx_t> eind;
+    idx_t numflag;
+    idx_t* xadj;
+    idx_t* adjncy;
+
+    // Number of partitions (one for each process)
+    idx_t nparts;
+
+    // Strange weight arrays needed by ParMETIS
+    idx_t ncon;
+    std::vector<real_t> tpwgts;
+    std::vector<real_t> ubvec;
+
+    // Prepare remaining arguments for ParMETIS
+    idx_t* elmwgt;
+    idx_t wgtflag;
+    idx_t edgecut;
+
+  };
+}
+//-----------------------------------------------------------------------------
+void ParMETIS::compute_partition(const MPI_Comm mpi_comm,
+                                 std::vector<std::size_t>& cell_partition,
+                                 const LocalMeshData& mesh_data,
+                                 std::string mode)
+{
+  // Duplicate MPI communicator (ParMETIS does not take const
+  // arguments, so duplicate communicator to be sure it isn't changed)
+  MPI_Comm comm;
+  MPI_Comm_dup(mpi_comm, &comm);
+
+  // Build dual graph
+  ParMETISDualGraph g(mpi_comm, mesh_data);
+
+  dolfin_assert(g.eptr.size() - 1 == mesh_data.cell_vertices.size());
+
+  // Partition graph
+  if (mode == "partition")
+    partition(comm, cell_partition, g);
+  else if (mode == "adaptive_repartition")
+    adaptive_repartition(comm, cell_partition, g);
+  else if (mode == "refine")
+    refine(comm, cell_partition, g);
+  else
+  {
+    dolfin_error("ParMETIS.cpp",
+                 "compute mesh partitioning using ParMETIS",
+                 "partition model %s is unknown. Must be \"partition\", \"adactive_partition\" or \"refine\"",
+                 mode.c_str());
+  }
+
+  MPI_Comm_free(&comm);
+}
+//-----------------------------------------------------------------------------
+void ParMETIS::partition(MPI_Comm mpi_comm,
+                         std::vector<std::size_t>& cell_partition,
+                         ParMETISDualGraph& g)
+{
+  Timer timer1("PARALLEL 1b: Compute graph partition (calling ParMETIS)");
+
+  // Options for ParMETIS
+  idx_t options[3];
+  options[0] = 1;
+  options[1] = 0;
+  options[2] = 15;
+
+  // Check that data arrays are not empty
+  dolfin_assert(!g.tpwgts.empty());
+  dolfin_assert(!g.ubvec.empty());
+
+  // Call ParMETIS to partition graph
+  const std::size_t num_local_cells = g.eptr.size() - 1;
+  std::vector<idx_t> part(num_local_cells);
+  dolfin_assert(!part.empty());
+  int err = ParMETIS_V3_PartKway(g.elmdist.data(), g.xadj, g.adjncy, g.elmwgt,
+                                 NULL, &g.wgtflag, &g.numflag, &g.ncon,
+                                 &g.nparts,
+                                 g.tpwgts.data(), g.ubvec.data(), options,
+                                 &g.edgecut, part.data(),
+                                 &mpi_comm);
+  dolfin_assert(err == METIS_OK);
+
+  // Copy cell partition data
+  cell_partition = std::vector<std::size_t>(part.begin(), part.end());
+}
+//-----------------------------------------------------------------------------
+void ParMETIS::adaptive_repartition(MPI_Comm mpi_comm,
+                                    std::vector<std::size_t>& cell_partition,
+                                    ParMETISDualGraph& g)
+{
+  Timer timer1("PARALLEL 1b: Compute graph partition (calling ParMETIS Adaptive Repartition)");
+
+  // Options for ParMETIS
+  idx_t options[4];
+  options[0] = 1;
+  options[1] = 0;
+  options[2] = 15;
+  options[3] = PARMETIS_PSR_UNCOUPLED;
+  // For repartition, PARMETIS_PSR_COUPLED seems to suppress all
+  // migration if already balanced.  Try PARMETIS_PSR_UNCOUPLED for
+  // better edge cut.
+
+  // Check that data arrays are not empty
+  dolfin_assert(!g.tpwgts.empty());
+  dolfin_assert(!g.ubvec.empty());
+
+  // Call ParMETIS to partition graph
+  const double itr = parameters["ParMETIS_repartitioning_weight"];
+  real_t _itr = itr;
+  std::vector<idx_t> part(g.eptr.size() - 1);
+  std::vector<idx_t> vsize(part.size(), 1);
+  dolfin_assert(!part.empty());
+  int err = ParMETIS_V3_AdaptiveRepart(g.elmdist.data(), g.xadj, g.adjncy,
+                                       g.elmwgt, NULL, vsize.data(), &g.wgtflag,
+                                       &g.numflag, &g.ncon, &g.nparts,
+                                       g.tpwgts.data(), g.ubvec.data(), &_itr,
+                                       options, &g.edgecut, part.data(),
+                                       &mpi_comm);
+  dolfin_assert(err == METIS_OK);
+
+  // Copy cell partition data
+  cell_partition = std::vector<std::size_t>(part.begin(), part.end());
+}
+//-----------------------------------------------------------------------------
+void ParMETIS::refine(MPI_Comm mpi_comm,
+                      std::vector<std::size_t>& cell_partition,
+                      ParMETISDualGraph& g)
+{
+  Timer timer1("PARALLEL 1b: Compute graph partition (calling ParMETIS Refine)");
+
+  // Get some MPI data
+  const std::size_t process_number = MPI::rank(mpi_comm);
+
+  // Options for ParMETIS
+  idx_t options[4];
+  options[0] = 1;
+  options[1] = 0;
+  options[2] = 15;
+  //options[3] = PARMETIS_PSR_UNCOUPLED;
+
+  // For repartition, PARMETIS_PSR_COUPLED seems to suppress all
+  // migration if already balanced.  Try PARMETIS_PSR_UNCOUPLED for
+  // better edge cut.
+
+  // Check that data arrays are not empty
+  dolfin_assert(!g.tpwgts.empty());
+  dolfin_assert(!g.ubvec.empty());
+
+  // Partitioning array to be computed by ParMETIS. Prefill with
+  // process_number.
+  const std::size_t num_local_cells = g.eptr.size() - 1;
+  std::vector<idx_t> part(num_local_cells, process_number);
+  dolfin_assert(!part.empty());
+
+  // Call ParMETIS to partition graph
+  int err = ParMETIS_V3_RefineKway(g.elmdist.data(), g.xadj, g.adjncy, g.elmwgt,
+                                   NULL, &g.wgtflag, &g.numflag, &g.ncon,
+                                   &g.nparts,
+                                   g.tpwgts.data(), g.ubvec.data(), options,
+                                   &g.edgecut, part.data(), &mpi_comm);
+  dolfin_assert(err == METIS_OK);
+
+  // Copy cell partition data
+  cell_partition = std::vector<std::size_t>(part.begin(), part.end());
+}
+//-----------------------------------------------------------------------------
+ParMETISDualGraph::ParMETISDualGraph(MPI_Comm mpi_comm,
+                                     const LocalMeshData& mesh_data)
+{
+  // Get number of processes and process number
+  const std::size_t num_processes = MPI::size(mpi_comm);
+
+  // Get dimensions of local mesh_data
+  const std::size_t num_local_cells = mesh_data.cell_vertices.size();
+  const std::size_t num_cell_vertices = mesh_data.num_vertices_per_cell;
+
+  // Check that number of local graph nodes (cells) is > 0
+  if (num_local_cells == 0)
+  {
+    dolfin_error("ParMETIS.cpp",
+                 "compute mesh partitioning using ParMETIS",
+                 "ParMETIS cannot be used if a process has no cells (graph nodes). Use SCOTCH to perform partitioning instead");
+  }
+
+  // Communicate number of cells between all processors
+  std::vector<std::size_t> num_cells;
+  MPI::all_gather(mpi_comm, num_local_cells, num_cells);
+
+  // Build elmdist array with cell offsets for all processors
+  elmdist.assign(num_processes + 1, 0);
+  for (std::size_t i = 1; i < num_processes + 1; ++i)
+    elmdist[i] = elmdist[i - 1] + num_cells[i - 1];
+
+  eptr.resize(num_local_cells + 1);
+  eind.assign(num_local_cells*num_cell_vertices, 0);
+  for (std::size_t i = 0; i < num_local_cells; i++)
+  {
+    dolfin_assert(mesh_data.cell_vertices[i].size() == num_cell_vertices);
+    eptr[i] = i*num_cell_vertices;
+    for (std::size_t j = 0; j < num_cell_vertices; j++)
+      eind[eptr[i] + j] = mesh_data.cell_vertices[i][j];
+  }
+  eptr[num_local_cells] = num_local_cells*num_cell_vertices;
+
+  dolfin_assert(!eptr.empty());
+  dolfin_assert(!eind.empty());
+
+  // Number of nodes shared for dual graph (partition along facets)
+  idx_t ncommonnodes = num_cell_vertices - 1;
+  numflag = 0;
+  xadj = 0;
+  adjncy = 0;
+
+  dolfin_assert(!eptr.empty());
+  dolfin_assert(!eind.empty());
+
+  // Could use GraphBuilder::compute_dual_graph() instead
+  int err = ParMETIS_V3_Mesh2Dual(elmdist.data(), eptr.data(), eind.data(),
+                                  &numflag, &ncommonnodes,
+                                  &xadj, &adjncy,
+                                  &mpi_comm);
+  dolfin_assert(err == METIS_OK);
+
+
+  // Number of partitions (one for each process)
+  nparts = num_processes;
+
+  // Strange weight arrays needed by ParMETIS
+  ncon = 1;
+  tpwgts.assign(ncon*nparts, 1.0/static_cast<real_t>(nparts));
+  ubvec.assign(ncon, 1.05);
+
+  // Prepare remaining arguments for ParMETIS
+  elmwgt = NULL;
+  wgtflag = 0;
+  edgecut = 0;
+}
+//-----------------------------------------------------------------------------
+ParMETISDualGraph::~ParMETISDualGraph()
+{
+  // Free metis data structures
+  METIS_Free(xadj);
+  METIS_Free(adjncy);
+}
+//-----------------------------------------------------------------------------
+#else
+void ParMETIS::compute_partition(const MPI_Comm mpi_comm,
+                                 std::vector<std::size_t>& cell_partition,
+                                 const LocalMeshData& data,
+                                 std::string mode)
+{
+  dolfin_error("ParMETIS.cpp",
+               "compute mesh partitioning using ParMETIS",
+               "DOLFIN has been configured without support for ParMETIS");
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/graph/ParMETIS.h b/dolfin/graph/ParMETIS.h
new file mode 100644
index 0000000..0c17eaa
--- /dev/null
+++ b/dolfin/graph/ParMETIS.h
@@ -0,0 +1,79 @@
+// Copyright (C) 2008-2009 Niclas Jansson, Ola Skavhaug and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2010
+//
+// First added:  2010-02-10
+// Last changed:
+
+#ifndef __PARMETIS_PARTITIONER_H
+#define __PARMETIS_PARTITIONER_H
+
+#include <cstddef>
+#include <vector>
+#include <dolfin/common/MPI.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class LocalMeshData;
+
+  class ParMETISDualGraph;
+
+  /// This class proivdes an interface to ParMETIS
+
+  class ParMETIS
+  {
+  public:
+
+    /// Compute cell partition using ParMETIS. The mode argument
+    /// determines which ParMETIS function is called. It can be one of
+    /// "partition", "adaptive_repartition" or "refine". For meshes
+    /// that have already been partitioned or are already well
+    /// partitioned, it can be advantageous to use
+    /// "adaptive_repartition" or "refine".
+    static void compute_partition(const MPI_Comm mpi_comm,
+                                  std::vector<std::size_t>& cell_partition,
+                                  const LocalMeshData& mesh_data,
+                                  std::string mode="partition");
+
+  private:
+
+#ifdef HAS_PARMETIS
+    // Standard ParMETIS partition
+    static void partition(MPI_Comm mpi_comm,
+                          std::vector<std::size_t>& cell_partition,
+                          ParMETISDualGraph& g);
+
+    // ParMETIS adaptive repartition
+    static void adaptive_repartition(MPI_Comm mpi_comm,
+                                     std::vector<std::size_t>& cell_partition,
+                                     ParMETISDualGraph& g);
+
+    // ParMETIS refine repartition
+    static void refine(MPI_Comm mpi_comm,
+                       std::vector<std::size_t>& cell_partition,
+                       ParMETISDualGraph& g);
+#endif
+
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/graph/SCOTCH.cpp b/dolfin/graph/SCOTCH.cpp
new file mode 100644
index 0000000..a19ce3b
--- /dev/null
+++ b/dolfin/graph/SCOTCH.cpp
@@ -0,0 +1,444 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2010-02-10
+// Last changed: 2011-11-14
+
+#include <algorithm>
+#include <map>
+#include <numeric>
+#include <set>
+#include <boost/lexical_cast.hpp>
+
+#include <dolfin/common/Set.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include "GraphBuilder.h"
+#include "SCOTCH.h"
+
+#include <dolfin/common/dolfin_common.h>
+
+#ifdef HAS_SCOTCH
+extern "C"
+{
+#include <stdint.h>
+#include <ptscotch.h>
+}
+#endif
+
+using namespace dolfin;
+
+#ifdef HAS_SCOTCH
+
+//-----------------------------------------------------------------------------
+void SCOTCH::compute_partition(const MPI_Comm mpi_comm,
+                               std::vector<std::size_t>& cell_partition,
+                               const LocalMeshData& mesh_data)
+{
+  // FIXME: Use std::set or std::vector?
+
+  // Create data structures to hold graph
+  std::vector<std::set<std::size_t> > local_graph;
+  std::set<std::size_t> ghost_vertices;
+
+  // Compute local dual graph
+  GraphBuilder::compute_dual_graph(mpi_comm, mesh_data, local_graph,
+                                   ghost_vertices);
+
+  // Compute partitions
+  const std::size_t num_global_vertices = mesh_data.num_global_cells;
+  const std::vector<std::size_t>& global_cell_indices
+    = mesh_data.global_cell_indices;
+  partition(mpi_comm, local_graph, ghost_vertices, global_cell_indices,
+            num_global_vertices, cell_partition);
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> SCOTCH::compute_gps(const Graph& graph,
+                                             std::size_t num_passes)
+{
+  // Create strategy string for Gibbs-Poole-Stockmayer ordering
+  std::string strategy = "g{pass= "
+    + boost::lexical_cast<std::string>(num_passes) + "}";
+
+  return compute_reordering(graph, strategy);
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> SCOTCH::compute_reordering(const Graph& graph,
+                                                    std::string scotch_strategy)
+{
+  std::vector<std::size_t> permutation, inverse_permutation;
+  compute_reordering(graph, permutation, inverse_permutation, scotch_strategy);
+  return permutation;
+}
+//-----------------------------------------------------------------------------
+void SCOTCH::compute_reordering(const Graph& graph,
+                                std::vector<std::size_t>& permutation,
+                                std::vector<std::size_t>& inverse_permutation,
+                                std::string scotch_strategy)
+{
+  Timer timer("SCOTCH graph ordering");
+
+  // Number of local graph vertices (cells)
+  const SCOTCH_Num vertnbr = graph.size();
+
+  // Data structures for graph input to SCOTCH (add 1 for case that
+  // graph size is zero)
+  std::vector<SCOTCH_Num> verttab;
+  verttab.reserve(vertnbr + 1);
+  std::vector<SCOTCH_Num> edgetab;
+  edgetab.reserve(20*vertnbr);
+
+  // Build local graph input for SCOTCH
+  // (number of local + ghost graph vertices (cells),
+  // number of local edges + edges connecting to ghost vertices)
+  SCOTCH_Num edgenbr = 0;
+  verttab.push_back(0);
+  Graph::const_iterator vertex;
+  for(vertex = graph.begin(); vertex != graph.end(); ++vertex)
+  {
+    edgenbr += vertex->size();
+    verttab.push_back(verttab.back() + vertex->size());
+    edgetab.insert(edgetab.end(), vertex->begin(), vertex->end());
+  }
+
+  // Create SCOTCH graph
+  SCOTCH_Graph scotch_graph;
+
+  // C-style array indexing
+  const SCOTCH_Num baseval = 0;
+
+  // Create SCOTCH graph and intialise
+  if (SCOTCH_graphInit(&scotch_graph) != 0)
+  {
+    dolfin_error("SCOTCH.cpp",
+                 "re-order graph using SCOTCH",
+                 "Error initializing SCOTCH graph");
+  }
+
+  // Build SCOTCH graph
+  if (SCOTCH_graphBuild(&scotch_graph, baseval,
+                        vertnbr, &verttab[0], &verttab[1], NULL, NULL,
+                        edgenbr, &edgetab[0], NULL))
+  {
+    dolfin_error("SCOTCH.cpp",
+                 "partition mesh using SCOTCH",
+                 "Error building SCOTCH graph");
+  }
+
+  // Check graph data for consistency
+  /*
+  #ifdef DEBUG
+  if (SCOTCH_graphCheck(&scotch_graph))
+  {
+    dolfin_error("SCOTCH.cpp",
+                 "partition mesh using SCOTCH",
+                 "Consistency error in SCOTCH graph");
+  }
+  #endif
+  */
+
+  // Re-ordering strategy
+  SCOTCH_Strat strat;
+  SCOTCH_stratInit(&strat);
+
+  // Set SCOTCH strategy (if provided)
+  //SCOTCH_stratGraphOrderBuild(&strat, SCOTCH_STRATQUALITY, 0, 0);
+  //SCOTCH_stratGraphOrderBuild(&strat, SCOTCH_STRATSPEED, 0, 0);
+  if (!scotch_strategy.empty())
+    SCOTCH_stratGraphOrder(&strat, scotch_strategy.c_str());
+
+  // Vector to hold permutation vectors
+  std::vector<SCOTCH_Num> permutation_indices(vertnbr);
+  std::vector<SCOTCH_Num> inverse_permutation_indices(vertnbr);
+
+  // Reset SCOTCH random number generator to produce deterministic
+  // partitions
+  SCOTCH_randomReset();
+
+  // Compute re-ordering
+  if (SCOTCH_graphOrder(&scotch_graph, &strat, permutation_indices.data(),
+                        inverse_permutation_indices.data(), NULL, NULL, NULL))
+  {
+    dolfin_error("SCOTCH.cpp",
+                 "re-order graph using SCOTCH",
+                 "Error during re-ordering");
+  }
+
+  // Clean up SCOTCH objects
+  SCOTCH_graphExit(&scotch_graph);
+  SCOTCH_stratExit(&strat);
+
+  // Copy permutation vectors
+  permutation.resize(vertnbr);
+  inverse_permutation.resize(vertnbr);
+  std::copy(permutation_indices.begin(), permutation_indices.end(),
+            permutation.begin());
+  std::copy(inverse_permutation_indices.begin(),
+            inverse_permutation_indices.end(), inverse_permutation.begin());
+}
+//-----------------------------------------------------------------------------
+void SCOTCH::partition(const MPI_Comm mpi_comm,
+                       const std::vector<std::set<std::size_t> >& local_graph,
+                       const std::set<std::size_t>& ghost_vertices,
+                       const std::vector<std::size_t>& global_cell_indices,
+                       const std::size_t num_global_vertices,
+                       std::vector<std::size_t>& cell_partition)
+{
+  Timer timer("Partition graph (calling SCOTCH)");
+
+  // C-style array indexing
+  const SCOTCH_Num baseval = 0;
+
+  // Number of processes
+  const std::size_t num_processes = MPI::size(mpi_comm);
+
+  // This process number
+  const std::size_t proc_num = MPI::rank(mpi_comm);
+
+  // Local data ---------------------------------
+
+  // Number of local graph vertices (cells)
+  const SCOTCH_Num vertlocnbr = local_graph.size();
+
+  // Data structures for graph input to SCOTCH (add 1 for case that
+  // local graph size is zero)
+  std::vector<SCOTCH_Num> vertloctab;
+  vertloctab.reserve(local_graph.size() + 1);
+  std::vector<SCOTCH_Num> edgeloctab;
+
+  // Build local graph input for SCOTCH
+  // (number of local + ghost graph vertices (cells),
+  // number of local edges + edges connecting to ghost vertices)
+  SCOTCH_Num edgelocnbr = 0;
+  vertloctab.push_back((SCOTCH_Num) 0);
+  std::vector<std::set<std::size_t> >::const_iterator vertex;
+  for(vertex = local_graph.begin(); vertex != local_graph.end(); ++vertex)
+  {
+    edgelocnbr += vertex->size();
+    vertloctab.push_back(vertloctab.back() + vertex->size());
+    edgeloctab.insert(edgeloctab.end(), vertex->begin(), vertex->end());
+  }
+
+  // Handle case that local graph size is zero
+  if (edgeloctab.empty())
+    edgeloctab.resize(1);
+
+  // Global data ---------------------------------
+
+  // Number of local vertices (cells) on each process
+  std::vector<SCOTCH_Num> proccnttab;
+  const SCOTCH_Num local_graph_size = local_graph.size();
+  MPI::all_gather(mpi_comm, local_graph_size, proccnttab);
+
+  // FIXME: explain this test
+  // Array containing . . . . (some sanity checks)
+  std::vector<std::size_t> procvrttab(num_processes + 1);
+  for (std::size_t i = 0; i < num_processes; ++i)
+  {
+    procvrttab[i] = std::accumulate(proccnttab.begin(),
+                                    proccnttab.begin() + i, (std::size_t) 0);
+  }
+  procvrttab[num_processes] = procvrttab[num_processes - 1]
+    + proccnttab[num_processes - 1];
+
+  // Sanity check
+  for (std::size_t i = 1; i <= proc_num; ++i)
+    dolfin_assert(procvrttab[i] >= (procvrttab[i - 1] + proccnttab[i - 1]));
+
+  // Print graph data -------------------------------------
+  /*
+  {
+    const SCOTCH_Num vertgstnbr = local_graph.size() + ghost_vertices.size();
+
+    // Total  (global) number of vertices (cells) in the graph
+    const SCOTCH_Num vertglbnbr = num_global_vertices;
+
+    // Total (global) number of edges (cell-cell connections) in the graph
+    const SCOTCH_Num edgeglbnbr = MPI::sum(mpi_comm, edgelocnbr);
+
+    for (std::size_t proc = 0; proc < num_processes; ++proc)
+    {
+      // Print data for one process at a time
+      if (proc == proc_num)
+      {
+        // Number of processes
+        const SCOTCH_Num procglbnbr = num_processes;
+
+        cout << "--------------------------------------------------" << endl;
+        cout << "Num vertices (vertglbnbr)     : " << vertglbnbr << endl;
+        cout << "Num edges (edgeglbnbr)        : " << edgeglbnbr << endl;
+        cout << "Num of processes (procglbnbr) : " << procglbnbr << endl;
+        cout << "Vert per processes (proccnttab) : " << endl;
+        for (std::size_t i = 0; i < proccnttab.size(); ++i)
+          cout << "  " << proccnttab[i];
+        cout << endl;
+        cout << "Offests (procvrttab): " << endl;
+        for (std::size_t i = 0; i < procvrttab.size(); ++i)
+          cout << "  " << procvrttab[i];
+        cout << endl;
+
+        //------ Print local data
+        cout << "(*) Num vertices (vertlocnbr)        : " << vertlocnbr << endl;
+        cout << "(*) Num vert (inc ghost) (vertgstnbr): " << vertgstnbr << endl;
+        cout << "(*) Num edges (edgelocnbr)           : " << edgelocnbr << endl;
+        cout << "(*) Vertloctab: " << endl;
+        for (std::size_t i = 0; i < vertloctab.size(); ++i)
+          cout << "  " << vertloctab[i];
+        cout << endl;
+        cout << "edgeloctab: " << endl;
+        for (std::size_t i = 0; i < edgeloctab.size(); ++i)
+          cout << "  " << edgeloctab[i];
+        cout << endl;
+        cout << "--------------------------------------------------" << endl;
+      }
+      MPI::barrier(mpi_comm);
+    }
+    MPI::barrier(mpi_comm);
+  }
+  */
+  // ------------------------------------------------------
+
+  // Create SCOTCH graph and intialise
+  SCOTCH_Dgraph dgrafdat;
+  if (SCOTCH_dgraphInit(&dgrafdat, mpi_comm) != 0)
+  {
+    dolfin_error("SCOTCH.cpp",
+                 "partition mesh using SCOTCH",
+                 "Error initializing SCOTCH graph");
+  }
+
+  // Build SCOTCH distributed graph
+  if (SCOTCH_dgraphBuild(&dgrafdat, baseval, vertlocnbr, vertlocnbr,
+                              &vertloctab[0], NULL, NULL, NULL,
+                              edgelocnbr, edgelocnbr,
+                              &edgeloctab[0], NULL, NULL) )
+  {
+    dolfin_error("SCOTCH.cpp",
+                 "partition mesh using SCOTCH",
+                 "Error building SCOTCH graph");
+  }
+
+  // Check graph data for consistency
+  #ifdef DEBUG
+  if (SCOTCH_dgraphCheck(&dgrafdat))
+  {
+    dolfin_error("SCOTCH.cpp",
+                 "partition mesh using SCOTCH",
+                 "Consistency error in SCOTCH graph");
+  }
+  #endif
+
+  // Number of partitions (set equal to number of processes)
+  const SCOTCH_Num npart = num_processes;
+
+  // Partitioning strategy
+  SCOTCH_Strat strat;
+  SCOTCH_stratInit(&strat);
+
+  // Set strategy (SCOTCH uses very crytic strings for this, and they can change between versions)
+  //std::string strategy = "b{sep=m{asc=b{bnd=q{strat=f},org=q{strat=f}},low=q{strat=m{type=h,vert=80,low=h{pass=10}f{bal=0.0005,move=80},asc=b{bnd=d{dif=1,rem=1,pass=40}f{bal=0.005,move=80},org=f{bal=0.005,move=80}}}|m{type=h,vert=80,low=h{pass=10}f{bal=0.0005,move=80},asc=b{bnd=d{dif=1,rem=1,pass=40}f{bal=0.005,move=80},org=f{bal=0.005,move=80}}}},seq=q{strat=m{type=h,vert=80,low=h{pass=10}f{bal=0.0005,move=80},asc=b{bnd=d{dif=1,rem=1,pass=40}f{bal=0.005,move=80},org=f{bal=0.005,move=80}}}|m{type=h,vert=80,low=h{pass=10}f{bal=0.0005,move=80},asc=b{bnd=d{dif=1,rem=1,pass=40}f{bal=0.005,move=80},org=f{bal=0.005,move=80}}}}},seq=b{job=t,map=t,poli=S,sep=m{type=h,vert=80,low=h{pass=10}f{bal=0.0005,move=80},asc=b{bnd=d{dif=1,rem=1,pass=40}f{bal=0.005,move=80},org=f{bal=0.005,move=80}}}|m{type=h,vert=80,low=h{pass=10}f{bal=0.0005,move=80},asc=b{bnd=d{dif=1,rem=1,pass=40}f{bal=0.005,move=80},org=f{bal=0.005,move=80}}}}}";
+  //SCOTCH_stratDgraphMap (&strat, strategy.c_str());
+
+  // Resize vector to hold cell partition indices (ugly to handle vertlocnbr = 0 case)
+  std::vector<SCOTCH_Num> _cell_partition(vertlocnbr);
+  SCOTCH_Num _cell_dummy = 0;
+  SCOTCH_Num* __cell_partition = 0;
+  cell_partition.resize(vertlocnbr);
+  if (vertlocnbr > 0)
+    __cell_partition = &_cell_partition[0];
+  else
+    __cell_partition = &_cell_dummy;
+
+  // Reset SCOTCH random number generator to produce deterministic partitions
+  SCOTCH_randomReset();
+
+  // Partition graph
+  if (SCOTCH_dgraphPart(&dgrafdat, npart, &strat, __cell_partition))
+  {
+    dolfin_error("SCOTCH.cpp",
+                 "partition mesh using SCOTCH",
+                 "Error during partitioning");
+  }
+
+  // Clean up SCOTCH objects
+  SCOTCH_dgraphExit(&dgrafdat);
+  SCOTCH_stratExit(&strat);
+
+  // Copy partition
+  cell_partition.resize(_cell_partition.size());
+  std::copy(_cell_partition.begin(), _cell_partition.end(),
+            cell_partition.begin());
+}
+//-----------------------------------------------------------------------------
+#else
+//-----------------------------------------------------------------------------
+void SCOTCH::compute_partition(const MPI_Comm mpi_comm,
+                               std::vector<std::size_t>& cell_partition,
+                               const LocalMeshData& mesh_data)
+{
+  dolfin_error("SCOTCH.cpp",
+               "partition mesh using SCOTCH",
+               "DOLFIN has been configured without support for SCOTCH");
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> SCOTCH::compute_gps(const Graph& graph,
+                                             std::size_t num_passes)
+{
+  dolfin_error("SCOTCH.cpp",
+               "re-order graph using SCOTCH",
+               "DOLFIN has been configured without support for SCOTCH");
+  return std::vector<std::size_t>();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t>
+SCOTCH::compute_reordering(const Graph& graph,
+                           std::string scotch_strategy)
+{
+  dolfin_error("SCOTCH.cpp",
+               "re-order graph using SCOTCH",
+               "DOLFIN has been configured without support for SCOTCH");
+  return std::vector<std::size_t>();
+}
+//-----------------------------------------------------------------------------
+void SCOTCH::compute_reordering(const Graph& graph,
+                                std::vector<std::size_t>& permutation,
+                                std::vector<std::size_t>& inverse_permutation,
+                                std::string scotch_strategy)
+
+{
+  dolfin_error("SCOTCH.cpp",
+               "re-order graph using SCOTCH",
+               "DOLFIN has been configured without support for SCOTCH");
+}
+//-----------------------------------------------------------------------------
+void SCOTCH::partition(const MPI_Comm mpi_comm,
+                       const std::vector<std::set<std::size_t> >& local_graph,
+                       const std::set<std::size_t>& ghost_vertices,
+                       const std::vector<std::size_t>& global_cell_indices,
+                       std::size_t num_global_vertices,
+                       std::vector<std::size_t>& cell_partition)
+{
+  dolfin_error("SCOTCH.cpp",
+               "partition mesh using SCOTCH",
+               "DOLFIN has been configured without support for SCOTCH");
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/graph/SCOTCH.h b/dolfin/graph/SCOTCH.h
new file mode 100644
index 0000000..5cbc974
--- /dev/null
+++ b/dolfin/graph/SCOTCH.h
@@ -0,0 +1,80 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-02-10
+// Last changed:
+
+#ifndef __SCOTCH_PARTITIONER_H
+#define __SCOTCH_PARTITIONER_H
+
+#include <cstddef>
+#include <set>
+#include <string>
+#include <vector>
+
+#include <dolfin/common/MPI.h>
+#include "Graph.h"
+
+namespace dolfin
+{
+  // Forward declarations
+  class LocalMeshData;
+
+  /// This class proivdes an interface to SCOTCH-PT (parallel version)
+
+  class SCOTCH
+  {
+  public:
+
+    // Compute cell partition
+    static void compute_partition(const MPI_Comm mpi_comm,
+                                  std::vector<std::size_t>& cell_partition,
+                                  const LocalMeshData& mesh_data);
+
+    /// Compute reordering (map[old] -> new) using
+    /// Gibbs-Poole-Stockmeyer re-ordering
+    static std::vector<std::size_t> compute_gps(const Graph& graph,
+                                                std::size_t num_passes=5);
+
+    // Compute graph re-ordering
+    static std::vector<std::size_t>
+      compute_reordering(const Graph& graph,
+                         std::string scotch_strategy="");
+
+    // Compute graph re-ordering
+    static
+      void compute_reordering(const Graph& graph,
+                              std::vector<std::size_t>& permutation,
+                              std::vector<std::size_t>& inverse_permutation,
+                              std::string scotch_strategy="");
+
+  private:
+
+    // Compute cell partitions from distribted dual graph
+    static
+      void partition(const MPI_Comm mpi_comm,
+                     const std::vector<std::set<std::size_t> >& local_graph,
+                     const std::set<std::size_t>& ghost_vertices,
+                     const std::vector<std::size_t>& global_cell_indices,
+                     const std::size_t num_global_vertices,
+                     std::vector<std::size_t>& cell_partition);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/graph/ZoltanInterface.cpp b/dolfin/graph/ZoltanInterface.cpp
new file mode 100644
index 0000000..11713cd
--- /dev/null
+++ b/dolfin/graph/ZoltanInterface.cpp
@@ -0,0 +1,181 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2010-11-16
+// Last changed: 2011-11-14
+
+// Included here to avoid a C++ problem with some MPI implementations
+#include <dolfin/common/MPI.h>
+
+#include <boost/foreach.hpp>
+#include "dolfin/common/Timer.h"
+#include "dolfin/log/log.h"
+#include "Graph.h"
+#include "ZoltanInterface.h"
+
+using namespace dolfin;
+
+#ifdef HAS_TRILINOS
+//-----------------------------------------------------------------------------
+std::size_t
+ZoltanInterface::compute_local_vertex_coloring(const Graph& graph,
+                                               std::vector<std::size_t>& colors)
+{
+  // Create Zoltan graph wrapper
+  ZoltanGraphInterface zoltan_graph(graph);
+
+  // Initialise Zoltan
+  float version;
+  int argc = 0;
+  char** argv = NULL;
+  Zoltan_Initialize(argc, argv, &version);
+
+  // Create Zoltan object (local)
+  Zoltan zoltan(MPI_COMM_SELF);
+
+  // Set parameters
+  zoltan.Set_Param( "NUM_GID_ENTRIES", "1");  // global ID is single integer
+  zoltan.Set_Param( "NUM_LID_ENTRIES", "1");  // local ID is single integer
+  zoltan.Set_Param( "SUPERSTEP_SIZE", "1000");
+  //zoltan.Set_Param( "COLORING_ORDER", "U");
+
+  // Set call-back functions
+  zoltan.Set_Num_Obj_Fn(ZoltanInterface::ZoltanGraphInterface::get_number_of_objects, &zoltan_graph);
+  zoltan.Set_Obj_List_Fn(ZoltanInterface::ZoltanGraphInterface::get_object_list, &zoltan_graph);
+  zoltan.Set_Num_Edges_Multi_Fn(ZoltanInterface::ZoltanGraphInterface::get_number_edges, &zoltan_graph);
+  zoltan.Set_Edge_List_Multi_Fn(ZoltanInterface::ZoltanGraphInterface::get_all_edges, &zoltan_graph);
+
+  // Create array for global ids that should be re-ordered
+  std::vector<ZOLTAN_ID_TYPE> global_ids(graph.size());
+  for (std::size_t i = 0; i < global_ids.size(); ++i)
+    global_ids[i] = i;
+
+  // Call Zoltan function to compute coloring
+  int num_id = 1;
+  std::vector<int> _colors(graph.size());
+  int rc = zoltan.Color(num_id, graph.size(), global_ids.data(),
+                        _colors.data());
+  if (rc != ZOLTAN_OK)
+  {
+    dolfin_error("ZoltanInterface.cpp",
+                 "color mesh using Zoltan",
+                 "Call to Zoltan failed");
+  }
+
+  // Copy colors and convert to base zero
+  colors.resize(_colors.size());
+  for (std::size_t i = 0; i < colors.size(); ++i)
+    colors[i] = _colors[i] - 1;
+
+  // Count number of unique colors
+  const std::set<std::size_t> colors_set(colors.begin(), colors.end());
+
+  return colors_set.size();
+}
+//-----------------------------------------------------------------------------
+#else
+std::size_t ZoltanInterface::compute_local_vertex_coloring(const Graph& graph,
+                                                           std::vector<std::size_t>& colors)
+{
+  dolfin_error("ZoltanInterface.cpp",
+               "color mesh using Zoltan",
+               "DOLFIN has been configured without support for Zoltan from Trilinos");
+  return 0;
+}
+#endif
+//-----------------------------------------------------------------------------
+//-----------------------------------------------------------------------------
+#ifdef HAS_TRILINOS
+ZoltanInterface::ZoltanGraphInterface::ZoltanGraphInterface(const Graph& graph)
+    : _graph(graph)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void ZoltanInterface::ZoltanGraphInterface::num_vertex_edges(unsigned int* num_edges) const
+{
+  dolfin_assert(num_edges);
+
+  // Compute nunber of edges from each graph node
+  for (std::size_t i = 0; i < _graph.size(); ++i)
+    num_edges[i] = _graph[i].size();
+}
+//-----------------------------------------------------------------------------
+//-----------------------------------------------------------------------------
+int ZoltanInterface::ZoltanGraphInterface::get_number_of_objects(void* data,
+                                                                 int* ierr)
+{
+  ZoltanGraphInterface *objs = (ZoltanGraphInterface *)data;
+  *ierr = ZOLTAN_OK;
+  return objs->_graph.size();
+}
+//-----------------------------------------------------------------------------
+void ZoltanInterface::ZoltanGraphInterface::get_object_list(void *data,
+                                   int sizeGID, int sizeLID,
+                                   ZOLTAN_ID_PTR global_id,
+                                   ZOLTAN_ID_PTR local_id, int wgt_dim,
+                                   float* obj_wgts, int* ierr)
+{
+  ZoltanGraphInterface *objs = (ZoltanGraphInterface *)data;
+  *ierr = ZOLTAN_OK;
+  for (std::size_t i = 0; i< objs->_graph.size(); i++)
+  {
+    global_id[i] = i;
+    local_id[i]  = i;
+  }
+}
+//-----------------------------------------------------------------------------
+void ZoltanInterface::ZoltanGraphInterface::get_number_edges(void *data,
+                                    int num_gid_entries,
+                                    int num_lid_entries,
+                                    int num_obj, ZOLTAN_ID_PTR global_ids,
+                                    ZOLTAN_ID_PTR local_ids, int *num_edges,
+                                    int *ierr)
+{
+  ZoltanGraphInterface *objs = (ZoltanGraphInterface *)data;
+  objs->num_vertex_edges(reinterpret_cast<unsigned int*>(num_edges));
+}
+//-----------------------------------------------------------------------------
+void ZoltanInterface::ZoltanGraphInterface::get_all_edges(void* data,
+                                 int num_gid_entries,
+                                 int num_lid_entries, int num_obj,
+                                 ZOLTAN_ID_PTR global_ids,
+                                 ZOLTAN_ID_PTR local_ids,
+                                 int* num_edges,
+                                 ZOLTAN_ID_PTR nbor_global_id,
+                                 int* nbor_procs, int wgt_dim,
+                                 float* ewgts, int* ierr)
+{
+  ZoltanGraphInterface *objs = (ZoltanGraphInterface *)data;
+
+  // Get graph
+  const Graph graph = objs->_graph;
+
+  unsigned int entry = 0;
+  for (unsigned int i = 0; i < graph.size(); ++i)
+  {
+    dolfin_assert(graph[i].size() == (unsigned int) num_edges[i]);
+    BOOST_FOREACH(boost::unordered_set<unsigned int>::value_type edge, graph[i])
+    {
+      nbor_global_id[entry++] = edge;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/graph/ZoltanInterface.h b/dolfin/graph/ZoltanInterface.h
new file mode 100644
index 0000000..024ca57
--- /dev/null
+++ b/dolfin/graph/ZoltanInterface.h
@@ -0,0 +1,100 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-11-16
+// Last changed:
+
+#ifndef __DOLFIN_ZOLTAN_GRAPH_COLORING_H
+#define __DOLFIN_ZOLTAN_GRAPH_COLORING_H
+
+#include <vector>
+
+#ifdef HAS_TRILINOS
+#include <zoltan_cpp.h>
+#endif
+
+#include "Graph.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class colors a graph using Zoltan (part of Trilinos). It is designed
+  /// to work on a single process.
+
+  class ZoltanInterface
+  {
+
+  public:
+
+    /// Compute vertex colors
+    static std::size_t
+      compute_local_vertex_coloring(const Graph& graph,
+                                    std::vector<std::size_t>& colors);
+
+  private:
+
+    #ifdef HAS_TRILINOS
+    class ZoltanGraphInterface
+    {
+
+      public:
+
+      /// Constructor
+      ZoltanGraphInterface(const Graph& graph);
+
+      private:
+
+      // Graph object
+      const Graph& _graph;
+
+      public:
+
+      /// Number of edges from each vertex
+      void num_vertex_edges(unsigned int* num_edges) const;
+
+      // Zoltan call-back functions
+      static int get_number_of_objects(void* data, int* ierr);
+
+      static void get_object_list(void* data, int sizeGID, int sizeLID,
+                                  ZOLTAN_ID_PTR globalID,
+                                  ZOLTAN_ID_PTR localID, int wgt_dim,
+                                  float* obj_wgts, int* ierr);
+
+      static void get_number_edges(void* data, int num_gid_entries,
+                                   int num_lid_entries,
+                                   int num_obj, ZOLTAN_ID_PTR global_ids,
+                                   ZOLTAN_ID_PTR local_ids, int* num_edges,
+                                   int* ierr);
+
+      static void get_all_edges(void* data, int num_gid_entries,
+                                int num_lid_entries, int num_obj,
+                                ZOLTAN_ID_PTR global_ids,
+                                ZOLTAN_ID_PTR local_ids,
+                                int* num_edges,
+                                ZOLTAN_ID_PTR nbor_global_id,
+                                int* nbor_procs, int wgt_dim,
+                                float* ewgts, int* ierr);
+
+    };
+    #endif
+
+  };
+}
+
+#endif
diff --git a/dolfin/graph/ZoltanPartition.cpp b/dolfin/graph/ZoltanPartition.cpp
new file mode 100644
index 0000000..4315c3d
--- /dev/null
+++ b/dolfin/graph/ZoltanPartition.cpp
@@ -0,0 +1,466 @@
+// Copyright (C) 2013 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-13
+// Last changed: 2013-02-26
+
+#include<set>
+#include<vector>
+#include<boost/lexical_cast.hpp>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include "GraphBuilder.h"
+#include "ZoltanPartition.h"
+
+using namespace dolfin;
+
+#ifdef HAS_TRILINOS
+
+//-----------------------------------------------------------------------------
+void
+ZoltanPartition::compute_partition_phg(const MPI_Comm mpi_comm,
+                                       std::vector<std::size_t>& cell_partition,
+                                       const LocalMeshData& mesh_data)
+{
+  Timer timer0("Partition graph (calling Zoltan PHG)");
+
+  // Create data structures to hold graph
+  std::vector<std::set<std::size_t> > local_graph;
+  std::set<std::size_t> ghost_vertices;
+
+  // Compute local dual graph
+  GraphBuilder::compute_dual_graph(mpi_comm, mesh_data, local_graph,
+                                   ghost_vertices);
+
+  // Initialise Zoltan
+  float version;
+  int argc = 0;
+  char** argv = NULL;
+  Zoltan_Initialize(argc, argv, &version);
+
+  // Create Zoltan object
+  Zoltan zoltan;
+
+  // Set Zolatn parameters
+  zoltan.Set_Param("NUM_GID_ENTRIES", "1");
+  zoltan.Set_Param("NUM_LID_ENTRIES", "0");
+
+  zoltan.Set_Param("NUM_GLOBAL_PARTS",
+              boost::lexical_cast<std::string>(MPI::size(mpi_comm)));
+
+  zoltan.Set_Param("NUM_LOCAL_PARTS", "1");
+  zoltan.Set_Param("LB_METHOD", "GRAPH");
+
+  // Get partition method: 'PARTITION', 'REPARTITION' or 'REFINE'
+  std::string lb_approach = parameters["partitioning_approach"];
+  zoltan.Set_Param("LB_APPROACH", lb_approach.c_str());
+
+  // Repartitioning weighting
+  double phg_repart_multiplier = parameters["Zoltan_PHG_REPART_MULTIPLIER"];
+  zoltan.Set_Param("PHG_REPART_MULTIPLIER",
+                   boost::lexical_cast<std::string>(phg_repart_multiplier));
+
+
+  // Set call-back functions
+  void *mesh_data_ptr = (void *)&mesh_data;
+  zoltan.Set_Num_Obj_Fn(get_number_of_objects, mesh_data_ptr);
+  zoltan.Set_Obj_List_Fn(get_object_list, mesh_data_ptr);
+
+  void *graph_data_ptr = (void *)&local_graph;
+  zoltan.Set_Num_Edges_Multi_Fn(get_number_edges, graph_data_ptr);
+  zoltan.Set_Edge_List_Multi_Fn(get_all_edges, graph_data_ptr);
+
+  // Call Zoltan function to compute partitions
+  int changes = 0;
+  int num_gids = 0;
+  int num_lids = 0;
+  int num_import, num_export;
+  ZOLTAN_ID_PTR import_lids;
+  ZOLTAN_ID_PTR export_lids;
+  ZOLTAN_ID_PTR import_gids;
+  ZOLTAN_ID_PTR export_gids;
+  int* import_procs;
+  int* export_procs;
+  int* import_parts;
+  int* export_parts;
+
+  int rc = zoltan.LB_Partition(changes, num_gids, num_lids,
+           num_import, import_gids, import_lids, import_procs, import_parts,
+           num_export, export_gids, export_lids, export_procs, export_parts);
+
+  dolfin_assert(num_gids == 1);
+  dolfin_assert(num_lids == 0);
+
+  std::size_t proc = MPI::rank(mpi_comm);
+
+  if (rc != ZOLTAN_OK)
+  {
+    dolfin_error("ZoltanPartition.cpp",
+                 "partition mesh using Zoltan",
+                 "Call to Zoltan failed");
+  }
+
+  cell_partition.assign(local_graph.size(), proc);
+
+  std::size_t offset = MPI::global_offset(mpi_comm, local_graph.size(), true);
+  for(int i = 0; i < num_export; ++i)
+  {
+    const std::size_t idx = export_gids[i] - offset;
+    cell_partition[idx] = (std::size_t)export_procs[i];
+  }
+
+  // Free data structures allocated by Zoltan::LB_Partition
+  zoltan.LB_Free_Part(&import_gids, &import_lids, &import_procs, &import_parts);
+  zoltan.LB_Free_Part(&export_gids, &export_lids, &export_procs, &export_parts);
+}
+//-----------------------------------------------------------------------------
+void
+ZoltanPartition::compute_partition_rcb(const MPI_Comm mpi_comm,
+                                       std::vector<std::size_t>& cell_partition,
+                                       const LocalMeshData& mesh_data)
+{
+  Timer timer0("Partition graph (calling Zoltan RCB)");
+
+  // Get number of local graph vertices
+  const std::size_t nlocal = mesh_data.cell_vertices.shape()[0];
+
+  // Initialise Zoltan
+  float version;
+  int argc = 0;
+  char** argv = NULL;
+  Zoltan_Initialize(argc, argv, &version);
+
+  // Create Zoltan object
+  Zoltan zoltan;
+
+  // Set Zoltan parameters
+  zoltan.Set_Param("NUM_GID_ENTRIES", "1");
+  zoltan.Set_Param("NUM_LID_ENTRIES", "0");
+
+  zoltan.Set_Param("NUM_GLOBAL_PARTS",
+               boost::lexical_cast<std::string>(MPI::size(mpi_comm)));
+
+  zoltan.Set_Param("NUM_LOCAL_PARTS", "1");
+  zoltan.Set_Param("LB_METHOD", "RCB");
+
+  // Set call-back functions
+  void *mesh_data_ptr = (void *)&mesh_data;
+
+  zoltan.Set_Num_Obj_Fn(get_number_of_objects, mesh_data_ptr);
+  zoltan.Set_Obj_List_Fn(get_object_list, mesh_data_ptr);
+  zoltan.Set_Num_Geom_Fn(get_geom, mesh_data_ptr);
+  zoltan.Set_Geom_Multi_Fn(get_all_geom, mesh_data_ptr);
+
+  // Call Zoltan function to compute partitions
+  int changes = 0;
+  int num_gids = 0;
+  int num_lids = 0;
+  int num_import, num_export;
+  ZOLTAN_ID_PTR import_lids;
+  ZOLTAN_ID_PTR export_lids;
+  ZOLTAN_ID_PTR import_gids;
+  ZOLTAN_ID_PTR export_gids;
+  int* import_procs;
+  int* export_procs;
+  int* import_parts;
+  int* export_parts;
+
+  int rc = zoltan.LB_Partition(changes, num_gids, num_lids,
+           num_import, import_gids, import_lids, import_procs, import_parts,
+           num_export, export_gids, export_lids, export_procs, export_parts);
+
+  dolfin_assert(num_gids == 1);
+  dolfin_assert(num_lids == 0);
+
+
+  // Get my process rank
+  const std::size_t my_rank = MPI::rank(mpi_comm);
+
+  if (rc != ZOLTAN_OK)
+  {
+    dolfin_error("ZoltanPartition.cpp",
+                 "partition mesh using Zoltan",
+                 "Call to Zoltan failed");
+  }
+
+  // Assign all nodes to this processor
+  cell_partition.assign(nlocal, my_rank);
+  std::size_t offset = MPI::global_offset(mpi_comm, nlocal, true);
+
+  // Change nodes to be exported to the appropriate remote processor
+  for(int i = 0; i < num_export; ++i)
+  {
+    const std::size_t idx = export_gids[i] - offset;
+    cell_partition[idx] = export_procs[i];
+  }
+
+  // Free data structures allocated by Zoltan::LB_Partition
+  zoltan.LB_Free_Part(&import_gids, &import_lids, &import_procs, &import_parts);
+  zoltan.LB_Free_Part(&export_gids, &export_lids, &export_procs, &export_parts);
+}
+//-----------------------------------------------------------------------------
+int ZoltanPartition::get_number_of_objects(void* data, int* ierr)
+{
+  LocalMeshData* local_mesh_data = (LocalMeshData*)data;
+  *ierr = ZOLTAN_OK;
+  return local_mesh_data->cell_vertices.shape()[0];
+}
+//-----------------------------------------------------------------------------
+void ZoltanPartition::get_object_list(void *data,
+                                      int num_gid_entries,
+                                      int num_lid_entries,
+                                      ZOLTAN_ID_PTR global_id,
+                                      ZOLTAN_ID_PTR local_id, int wgt_dim,
+                                      float* obj_wgts, int* ierr)
+{
+  LocalMeshData* local_mesh_data = (LocalMeshData*)data;
+  dolfin_assert(local_mesh_data);
+
+  // Get MPI communicator
+  const MPI_Comm mpi_comm = local_mesh_data->mpi_comm();
+
+  dolfin_assert(num_gid_entries == 1);
+  dolfin_assert(num_lid_entries == 0);
+
+  const std::size_t nlocal = local_mesh_data->cell_vertices.shape()[0];
+  const std::size_t offset = MPI::global_offset(mpi_comm, nlocal, true);
+
+  for (std::size_t i = 0; i < nlocal; ++i)
+    global_id[i] = i + offset;
+
+  dolfin_assert(wgt_dim == 0);
+  obj_wgts = NULL;
+
+  *ierr = ZOLTAN_OK;
+}
+//-----------------------------------------------------------------------------
+void ZoltanPartition::get_number_edges(void *data,
+                                       int num_gid_entries,
+                                       int num_lid_entries,
+                                       int num_obj, ZOLTAN_ID_PTR global_ids,
+                                       ZOLTAN_ID_PTR local_ids, int *num_edges,
+                                       int *ierr)
+{
+  std::vector<std::set<std::size_t> >* local_graph
+    = (std::vector<std::set<std::size_t> >*)data;
+
+  dolfin_assert(num_gid_entries == 1);
+  dolfin_assert(num_lid_entries == 0);
+  dolfin_assert(num_obj == (int)local_graph->size());
+
+  for (std::size_t i = 0; i < local_graph->size(); ++i)
+    num_edges[i] = (*local_graph)[i].size();
+
+  *ierr = ZOLTAN_OK;
+}
+//-----------------------------------------------------------------------------
+void ZoltanPartition::get_all_edges(void* data,
+                                 int num_gid_entries,
+                                 int num_lid_entries, int num_obj,
+                                 ZOLTAN_ID_PTR global_ids,
+                                 ZOLTAN_ID_PTR local_ids,
+                                 int* num_edges,
+                                 ZOLTAN_ID_PTR nbor_global_id,
+                                 int* nbor_procs, int wgt_dim,
+                                 float* ewgts, int* ierr)
+{
+  error("ZoltanPartition::get_all_edges need to be updated for MPI communicator");
+  /*
+  // Get graph
+  const std::vector<std::set<std::size_t> >* local_graph
+    = (std::vector<std::set<std::size_t> >*)data;
+
+  // MPI communicate
+  const MPI_Comm mpi_comm = local_graph->mpi_comm();
+
+  std::vector<std::size_t> offsets;
+  std::size_t local_offset = MPI::global_offset(mpi_comm, local_graph->size(),
+                                                true);
+  MPI::all_gather(mpi_comm, local_offset, offsets);
+  offsets.push_back(MPI::sum(mpi_comm, local_graph->size()));
+
+  std::size_t i = 0;
+  for(std::vector<std::set<std::size_t> >::iterator node = local_graph->begin();
+      node != local_graph->end(); ++node)
+  {
+    for(std::set<std::size_t>::iterator edge = node->begin();
+        edge != node->end(); ++edge)
+    {
+      nbor_global_id[i] = *edge;
+      nbor_procs[i] = std::upper_bound(offsets.begin(), offsets.end(), *edge)
+        - offsets.begin()-1;
+      i++;
+    }
+  }
+
+  dolfin_assert(wgt_dim == 0);
+  ewgts = NULL;
+  *ierr = ZOLTAN_OK;
+  */
+}
+//-----------------------------------------------------------------------------
+int ZoltanPartition::get_geom(void* data, int* ierr)
+{
+  LocalMeshData* local_mesh_data=(LocalMeshData*)data;
+
+  *ierr = ZOLTAN_OK;
+  return local_mesh_data->gdim;
+}
+//-----------------------------------------------------------------------------
+void ZoltanPartition::get_all_geom(void *data,
+                                   int num_gid_entries, int num_lid_entries,
+                                   int num_obj, ZOLTAN_ID_PTR global_ids,
+                                   ZOLTAN_ID_PTR local_ids,
+                                   int num_dim, double *geom_vec, int *ierr)
+{
+  const LocalMeshData* local_mesh_data=(LocalMeshData*)data;
+  dolfin_assert(local_mesh_data);
+
+  // Get MPI communicator
+  const MPI_Comm mpi_comm = local_mesh_data->mpi_comm();
+
+  dolfin_assert(num_gid_entries == 1);
+  dolfin_assert(num_lid_entries == 0);
+
+  std::size_t gdim = local_mesh_data->gdim;
+  dolfin_assert(num_dim == (int)gdim);
+
+  std::size_t num_local_cells = local_mesh_data->cell_vertices.shape()[0];
+  std::size_t cell_offset = MPI::global_offset(mpi_comm, num_local_cells, true);
+  std::size_t num_vertices_per_cell = local_mesh_data->cell_vertices.shape()[1];
+  dolfin_assert(num_obj == (int)num_local_cells);
+
+  // Work out all ranges for vertices
+  std::size_t num_local_vertices
+    = local_mesh_data->vertex_coordinates.shape()[0];
+  std::vector<std::size_t> vertex_offsets;
+  std::size_t local_vertex_offset
+    = MPI::global_offset(mpi_comm, num_local_vertices, true);
+  MPI::all_gather(mpi_comm, local_vertex_offset, vertex_offsets);
+  vertex_offsets.push_back(MPI::sum(mpi_comm, num_local_vertices));
+
+  // Need to get all vertex coordinates which are referred to by
+  // topology onto this process...
+  std::map<std::size_t, std::vector<double> > vertex;
+
+  // Insert local vertices into map
+  for(std::size_t i = 0; i < num_local_vertices; ++i)
+  {
+    vertex[i + local_vertex_offset]
+      = std::vector<double>(local_mesh_data->vertex_coordinates[i].begin(),
+                            local_mesh_data->vertex_coordinates[i].end());
+  }
+
+  std::size_t num_processes = MPI::size(mpi_comm);
+  std::vector<std::vector<std::size_t> >send_buffer(num_processes);
+  std::vector<std::vector<std::size_t> >receive_buffer(num_processes);
+
+  // Make list of requested remote vertices for each remote process
+  for (std::size_t i = 0; i < num_local_cells; ++i)
+    for (std::size_t j = 0; j < num_vertices_per_cell; ++j)
+    {
+      std::size_t ivtx = local_mesh_data->cell_vertices[i][j];
+      if (ivtx < local_vertex_offset
+         || ivtx >= (local_vertex_offset + num_local_vertices))
+      {
+        // Find owner of this vertex and then add to request list for
+        // that process
+        std::size_t proc = std::upper_bound(vertex_offsets.begin(),
+                                            vertex_offsets.end(), ivtx)
+          - vertex_offsets.begin() - 1;
+        send_buffer[proc].push_back(ivtx);
+      }
+    }
+
+  MPI::all_to_all(mpi_comm, send_buffer, receive_buffer);
+
+  std::vector<std::vector<double> > dsend_buffer(num_processes);
+  std::vector<std::vector<double> > dreceive_buffer(num_processes);
+
+  // Get received requests for vertices from remote processes, and put
+  // together answer to send back
+  for (std::vector<std::vector<std::size_t> >::iterator p
+         = receive_buffer.begin(); p != receive_buffer.end(); ++p)
+  {
+    std::size_t proc = p - receive_buffer.begin();
+    for (std::vector<std::size_t>::iterator vidx = p->begin();
+         vidx != p->end(); ++vidx)
+    {
+      dolfin_assert(*vidx >= local_vertex_offset);
+      dolfin_assert(*vidx < (local_vertex_offset + num_local_vertices));
+      dsend_buffer[proc].insert(dsend_buffer[proc].end(),
+                                local_mesh_data->vertex_coordinates[*vidx - local_vertex_offset].begin(),
+                                local_mesh_data->vertex_coordinates[*vidx - local_vertex_offset].end());
+    }
+  }
+
+  MPI::all_to_all(mpi_comm, dsend_buffer, dreceive_buffer);
+
+  // insert received coordinates into local map.
+  for(std::size_t i = 0; i < num_processes; ++i)
+  {
+    std::vector<double>::iterator vcoords = dreceive_buffer[i].begin();
+    for(std::vector<std::size_t>::iterator v = send_buffer[i].begin();
+        v != send_buffer[i].end(); ++v)
+    {
+      vertex[*v] = std::vector<double>(vcoords, vcoords + gdim);
+      vcoords += gdim;
+    }
+  }
+
+  double *geom_ptr = geom_vec;
+  for (std::size_t i = 0; i < num_local_cells; ++i)
+  {
+    std::vector<double> x(gdim, 0.0);
+    for(std::size_t j = 0; j < num_vertices_per_cell ; ++j)
+    {
+      std::size_t idx
+        = local_mesh_data->cell_vertices[global_ids[i] - cell_offset][j] ;
+      for(std::size_t k=0; k < gdim ; ++k)
+        x[k] += vertex[idx][k];
+    }
+
+    std::copy(x.begin(), x.end(), geom_ptr);
+    geom_ptr += gdim;
+  }
+
+  *ierr = ZOLTAN_OK;
+}
+//-----------------------------------------------------------------------------
+#else
+void ZoltanPartition::compute_partition_phg(const MPI_Comm mpi_comm,
+                                            std::vector<std::size_t>& cell_partition,
+                                            const LocalMeshData& mesh_data)
+{
+  dolfin_error("ZoltanPartition.cpp",
+               "partition mesh using Zoltan",
+               "DOLFIN has been configured without support for Zoltan from Trilinos");
+}
+//-----------------------------------------------------------------------------
+void ZoltanPartition::compute_partition_rcb(const MPI_Comm mpi_comm,
+                                            std::vector<std::size_t>& cell_partition,
+                                            const LocalMeshData& mesh_data)
+{
+  dolfin_error("ZoltanPartition.cpp",
+               "partition mesh using Zoltan",
+               "DOLFIN has been configured without support for Zoltan from Trilinos");
+}
+#endif
+//-----------------------------------------------------------------------------
diff --git a/dolfin/graph/ZoltanPartition.h b/dolfin/graph/ZoltanPartition.h
new file mode 100644
index 0000000..eb6bda4
--- /dev/null
+++ b/dolfin/graph/ZoltanPartition.h
@@ -0,0 +1,99 @@
+// Copyright (C) 2013 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-15
+// Last changed: 2013-02-26
+
+#ifndef __DOLFIN_ZOLTAN_PARTITION_H
+#define __DOLFIN_ZOLTAN_PARTITION_H
+
+#include <vector>
+#include <dolfin/common/MPI.h>
+
+#ifdef HAS_TRILINOS
+#include <zoltan_cpp.h>
+#endif
+
+namespace dolfin
+{
+
+  class LocalMeshData;
+
+  /// This class partitions a graph using Zoltan (part of Trilinos).
+
+  class ZoltanPartition
+  {
+
+  public:
+
+    /// Calculate partitioning using Parallel HyperGraph (Zoltan PHG)
+    static void compute_partition_phg(const MPI_Comm mpi_comm,
+                                      std::vector<std::size_t>& cell_partition,
+                                      const LocalMeshData& mesh_data);
+
+    /// Calculate partitioning using recursive block bisection
+    /// (Zoltan RCB - geometric partitioner)
+    static void compute_partition_rcb(const MPI_Comm mpi_comm,
+                                      std::vector<std::size_t>& cell_partition,
+                                      const LocalMeshData& mesh_data);
+
+  private:
+
+    #ifdef HAS_TRILINOS
+
+    static void num_vertex_edges(void * data, unsigned int* num_edges);
+
+    static int get_number_of_objects(void* data, int* ierr);
+
+    static void get_object_list(void *data,
+                                int sizeGID, int sizeLID,
+                                ZOLTAN_ID_PTR global_id,
+                                ZOLTAN_ID_PTR local_id, int wgt_dim,
+                                float* obj_wgts, int* ierr);
+
+    static void get_number_edges(void *data,
+                                 int num_gid_entries,
+                                 int num_lid_entries,
+                                 int num_obj, ZOLTAN_ID_PTR global_ids,
+                                 ZOLTAN_ID_PTR local_ids, int *num_edges,
+                                 int *ierr);
+
+    static void get_all_edges(void* data,
+                              int num_gid_entries,
+                              int num_lid_entries, int num_obj,
+                              ZOLTAN_ID_PTR global_ids,
+                              ZOLTAN_ID_PTR local_ids,
+                              int* num_edges,
+                              ZOLTAN_ID_PTR nbor_global_id,
+                              int* nbor_procs, int wgt_dim,
+                              float* ewgts, int* ierr);
+
+
+    static void get_all_geom(void *data,
+                             int num_gid_entries, int num_lid_entries,
+                             int num_obj,
+                             ZOLTAN_ID_PTR global_ids, ZOLTAN_ID_PTR local_ids,
+                             int num_dim, double *geom_vec, int *ierr);
+
+    static int get_geom(void* data, int* ierr);
+
+    #endif
+
+  };
+}
+
+#endif
diff --git a/dolfin/graph/dolfin_graph.h b/dolfin/graph/dolfin_graph.h
new file mode 100644
index 0000000..880c40c
--- /dev/null
+++ b/dolfin/graph/dolfin_graph.h
@@ -0,0 +1,11 @@
+#ifndef __DOLFIN_GRAPH_H
+#define __DOLFIN_GRAPH_H
+
+// DOLFIN graph interface
+
+#include <dolfin/graph/Graph.h>
+#include <dolfin/graph/GraphBuilder.h>
+#include <dolfin/graph/BoostGraphOrdering.h>
+#include <dolfin/graph/SCOTCH.h>
+
+#endif
diff --git a/dolfin/io/BinaryFile.cpp b/dolfin/io/BinaryFile.cpp
new file mode 100644
index 0000000..0c69a4b
--- /dev/null
+++ b/dolfin/io/BinaryFile.cpp
@@ -0,0 +1,321 @@
+// Copyright (C) 2009-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-11-11
+// Last changed: 2011-11-23
+
+#include <fstream>
+#include <istream>
+#include <ios>
+#include <boost/scoped_array.hpp>
+#include <boost/filesystem.hpp>
+#include <boost/iostreams/filter/gzip.hpp>
+#include <boost/iostreams/operations.hpp>
+#include <iosfwd>
+
+#include <dolfin/common/Array.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/CellType.h>
+#include <dolfin/mesh/Mesh.h>
+#include "BinaryFile.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+BinaryFile::BinaryFile(const std::string filename, bool store_connectivity)
+  : GenericFile(filename, "Binary"), _store_connectivity(store_connectivity)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+BinaryFile::~BinaryFile()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::operator>> (std::vector<double>& values)
+{
+  open_read();
+
+  const std::size_t n = read_uint();
+  values.resize(n);
+  read_array(n, &values[0]);
+
+  close_read();
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::operator>> (GenericVector& vector)
+{
+  open_read();
+
+  const std::size_t n = read_uint();
+  std::vector<double> values(n);
+  read_array(n, values.data());
+
+  vector.init(MPI_COMM_WORLD, n);
+  vector.set_local(values);
+  vector.apply("insert");
+
+  close_read();
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::operator>> (Mesh& mesh)
+{
+  // Open file
+  open_read();
+
+  // Clear mesh
+  mesh.clear();
+
+  // Read mesh topology
+  MeshTopology& t = mesh._topology;
+  std::size_t D = read_uint();
+
+  std::vector<std::size_t> t_num_entities(D + 1);
+  read_array(D + 1, t_num_entities.data());
+  //t.num_entities.resize(D + 1);
+  //read_array(D + 1, t.num_entities.data());
+
+  t.num_entities = std::vector<unsigned int>(t_num_entities.begin(),
+                                             t_num_entities.end());
+
+  t.connectivity.resize(D + 1);
+  for (std::size_t i = 0; i <= D; i++)
+  {
+    for (std::size_t j = 0; j <= D; j++)
+    {
+      t.connectivity[i].push_back(MeshConnectivity(i, j));
+      MeshConnectivity& c = t.connectivity[i][j];
+      const std::size_t size = read_uint();
+      if (size > 0)
+      {
+        const std::size_t num_entities = read_uint();
+        c._connections = std::vector<unsigned int>(size);
+        read_array(size, &(c._connections)[0]);
+        c.index_to_position.resize(num_entities + 1);
+        read_array(c.index_to_position.size(), c.index_to_position.data());
+      }
+    }
+  }
+
+  // Read mesh geometry (ignoring higher order stuff)
+  MeshGeometry& g = mesh._geometry;
+  g._dim = read_uint();
+  const std::size_t size = read_uint();
+  g.coordinates.resize(g._dim*size);
+  read_array(g._dim*size, g.coordinates.data());
+
+  g.local_index_to_position.resize(size);
+  for (std::size_t i = 0; i < size; ++i)
+    g.local_index_to_position[i] = i;
+
+  // Read cell type
+  mesh._cell_type = CellType::create(static_cast<CellType::Type>(read_uint()));
+
+  // Read mesh data
+  // FIXME: Not implemented
+
+  // Read mesh domains
+  // FIXME: Not implemented
+
+  // Initialize mesh domains
+  mesh._domains.init(D);
+
+  // Close file
+  close_read();
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::operator<< (const std::vector<double>& values)
+{
+  open_write();
+
+  write_uint(values.size());
+  write_array(values.size(), &values[0]);
+
+  close_write();
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::operator<< (const GenericVector& vector)
+{
+  open_write();
+
+  const std::size_t n = vector.size();
+  std::vector<double> values(n);
+  vector.get_local(values);
+  write_uint(n);
+  write_array(n, values.data());
+
+  close_write();
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::operator<< (const Mesh& mesh)
+{
+  // Open file
+  open_write();
+
+  // Write mesh topology
+  const MeshTopology& t = mesh._topology;
+  const std::size_t D = t.dim();
+  write_uint(D);
+  if (_store_connectivity)
+  {
+    std::vector<std::size_t> t_num_entities(t.num_entities.begin(),
+                                            t.num_entities.end());
+    write_array(D + 1, t_num_entities.data());
+  }
+  else
+  {
+    for (std::size_t i = 0; i <= D; i++)
+    {
+      if (i==0 || i == D)
+        write_uint(t.size(i));
+      else
+        write_uint(0);
+    }
+  }
+  for (std::size_t i = 0; i <= D; i++)
+  {
+    for (std::size_t j = 0; j <= D; j++)
+    {
+      const MeshConnectivity& c = t.connectivity[i][j];
+
+      // If store all connectivity or if storing cell connectivity
+      if (_store_connectivity || (i == D && j == 0))
+      {
+        write_uint(c.size());
+        if (!c.empty())
+        {
+          write_uint(c.index_to_position.size() - 1);
+          write_array(c.size(), c._connections.data());
+          write_array(c.index_to_position.size(), c.index_to_position.data());
+        }
+      }
+      else
+        write_uint(0);
+    }
+  }
+
+  // Write mesh geometry (ignoring higher order stuff)
+  const MeshGeometry& g = mesh._geometry;
+  write_uint(g._dim);
+  write_uint(g.size());
+  write_array(g._dim*g.size(), g.coordinates.data());
+
+  // Write cell type
+  write_uint(static_cast<std::size_t>(mesh._cell_type->cell_type()));
+
+  // Write mesh data
+  // FIXME: Not implemented
+
+  // Close file
+  close_write();
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::open_read()
+{
+  // Get file path and extension
+  const boost::filesystem::path path(_filename);
+  const std::string extension = boost::filesystem::extension(path);
+
+  // FIXME: Check that file exists
+  if (!boost::filesystem::is_regular_file(_filename))
+  {
+    dolfin_error("BinaryFile.cpp",
+                 "open binary file",
+                 "File \"%s\" does not exist or is not a regular file",
+                 _filename.c_str());
+  }
+
+  // Load xml file (unzip if necessary) into parser
+  if (extension == ".gz")
+    // Decompress file
+    ifilter.push(boost::iostreams::gzip_decompressor());
+
+  ifile.open(_filename.c_str(), std::ios::in | std::ios::binary);
+  if (!ifile.is_open())
+  {
+    dolfin_error("BinaryFile.cpp",
+                 "open binary file",
+                 "Cannot open file \"%s\" for reading", _filename.c_str());
+  }
+  ifilter.push(ifile);
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::open_write()
+{
+  // Compress if filename has extension '.gz'
+  const boost::filesystem::path path(_filename);
+  const std::string extension = boost::filesystem::extension(path);
+
+  if (extension == ".gz")
+    ofilter.push(boost::iostreams::gzip_compressor());
+
+  ofile.open(_filename.c_str(), std::ios::out | std::ios::binary);
+  if (!ofile.is_open())
+  {
+    dolfin_error("BinaryFile.cpp",
+                 "open binary file",
+                 "Cannot open file \"%s\" for writing", _filename.c_str());
+  }
+  ofilter.push(ofile);
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::close_read()
+{
+  ifilter.reset();
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::close_write()
+{
+  ofilter.reset();
+}
+//-----------------------------------------------------------------------------
+std::size_t BinaryFile::read_uint()
+{
+  std::size_t value = 0;
+  boost::iostreams::read(ifilter, (char*) &value,
+                         (std::streamsize) sizeof(std::size_t));
+  return value;
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void BinaryFile::read_array(std::size_t n, T* values)
+{
+  for (std::size_t i = 0; i < n; ++i)
+  {
+    boost::iostreams::read(ifilter, (char*) (values + i),
+                           (std::streamsize) sizeof(T));
+  }
+}
+//-----------------------------------------------------------------------------
+void BinaryFile::write_uint(std::size_t value)
+{
+  boost::iostreams::write(ofilter, (char*) &value,
+                          (std::streamsize) sizeof(std::size_t));
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void BinaryFile::write_array(std::size_t n, const T* values)
+{
+  for (std::size_t i = 0; i < n; ++i)
+  {
+    boost::iostreams::write(ofilter, (char*) &values[i],
+                            (std::streamsize) sizeof(T));
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/BinaryFile.h b/dolfin/io/BinaryFile.h
new file mode 100644
index 0000000..c503f6a
--- /dev/null
+++ b/dolfin/io/BinaryFile.h
@@ -0,0 +1,121 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-11-11
+// Last changed: 2011-10-23
+
+#ifndef __BINARY_FILE_H
+#define __BINARY_FILE_H
+
+#include <fstream>
+#include <boost/iostreams/filtering_streambuf.hpp>
+#include "GenericFile.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericVector;
+  class Mesh;
+
+  /// This class handles input/output in binary format. This format
+  /// is more efficient than DOLFIN XML format but does not support
+  /// all data types. Use this format with caution. Often, a plain
+  /// text self-documenting format is more suitable for storing data.
+
+  class BinaryFile : public GenericFile
+  {
+  public:
+
+    /// Constructor
+    BinaryFile(const std::string filename, bool store_connectivity=false);
+
+    /// Destructor
+    virtual ~BinaryFile();
+
+    //--- Input ---
+
+    /// Read array
+    void operator>> (std::vector<double>& values);
+
+    /// Read vector
+    void operator>> (GenericVector& vector);
+
+    /// Read mesh
+    void operator>> (Mesh& mesh);
+
+    //--- Output ---
+
+    /// Write array
+    void operator<< (const std::vector<double>& values);
+
+    /// Write vector
+    void operator<< (const GenericVector& vector);
+
+    /// Write mesh
+    void operator<< (const Mesh& mesh);
+
+  private:
+
+    // Open file for reading
+    void open_read();
+
+    // Open file for writing
+    void open_write();
+
+    // Close file for reading
+    void close_read();
+
+    // Close file for writing
+    void close_write();
+
+    // Read std::size_t
+    std::size_t read_uint();
+
+    // Read array (std::size_t)
+    template<typename T>
+    void read_array(std::size_t n, T* values);
+
+    // Read array (double)
+    //void read_array(std::size_t n, double* values);
+
+    // Write std::size_t
+    void write_uint(std::size_t value);
+
+    // Write array (std::size_t)
+    template<typename T>
+    void write_array(std::size_t n, const T* values);
+
+    // Write array (double)
+    //void write_array(std::size_t n, const double* values);
+
+    // Store all connectivity in a mesh
+    bool _store_connectivity;
+
+    // File for reading
+    boost::iostreams::filtering_streambuf<boost::iostreams::input> ifilter;
+    std::ifstream ifile;
+
+    // File for writing
+    boost::iostreams::filtering_streambuf<boost::iostreams::output> ofilter;
+    std::ofstream ofile;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/Encoder.h b/dolfin/io/Encoder.h
new file mode 100644
index 0000000..3940299
--- /dev/null
+++ b/dolfin/io/Encoder.h
@@ -0,0 +1,97 @@
+// Copyright (C) 2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2009-08-11
+// Last changed: 2011-11-14
+
+#ifndef __ENCODER_H
+#define __ENCODER_H
+
+#ifdef HAS_ZLIB
+#include <zlib.h>
+extern "C"
+{
+  int compress(Bytef *dest, uLongf *destLen, const Bytef *source, uLong sourceLen);
+}
+#endif
+
+#include <sstream>
+#include <vector>
+#include <utility>
+#include <boost/shared_array.hpp>
+#include "base64.h"
+
+namespace dolfin
+{
+
+  /// This class provides tools for encoding and compressing streams
+  /// for use in output files
+
+  /// We cheating in some functions by relying on std::vector data being
+  /// contiguous in memory. This will be part of the upcoming C++ standard.
+
+  namespace Encoder
+  {
+
+    template<typename T>
+    static void encode_base64(const T* data, std::size_t length,
+                              std::stringstream& encoded_data)
+    {
+      encoded_data << base64_encode((const unsigned char*) &data[0],
+                                    length*sizeof(T));
+    }
+
+    template<typename T>
+    static void encode_base64(const std::vector<T>& data,
+                              std::stringstream& encoded_data)
+    {
+      encoded_data << base64_encode((const unsigned char*) &data[0],
+                                    data.size()*sizeof(T));
+    }
+
+    #ifdef HAS_ZLIB
+    template<typename T>
+    static std::pair<boost::shared_array<unsigned char>, std::size_t> compress_data(const std::vector<T>& data)
+    {
+      // Compute length of uncompressed data
+      const unsigned long uncompressed_size = data.size()*sizeof(T);
+
+      // Compute maxium length of compressed data
+      unsigned long compressed_size = (uncompressed_size + (((uncompressed_size)/1000)+1)+12);;
+
+      // Allocate space for compressed data
+      boost::shared_array<unsigned char> compressed_data(new unsigned char[compressed_size]);
+
+      // Compress data
+      if (compress((Bytef*) compressed_data.get(), &compressed_size, (const Bytef*) &data[0], uncompressed_size) != Z_OK)
+      {
+        dolfin_error("Encoder.h",
+                     "compress data when writing file",
+                     "Zlib error while compressing data");
+      }
+
+      // Make pair and return
+      return std::make_pair(compressed_data, compressed_size);
+    }
+    #endif
+
+  }
+}
+
+#endif
diff --git a/dolfin/io/ExodusFile.cpp b/dolfin/io/ExodusFile.cpp
new file mode 100644
index 0000000..c958af9
--- /dev/null
+++ b/dolfin/io/ExodusFile.cpp
@@ -0,0 +1,400 @@
+// Copyright (C) 2013 Nico Schlömer
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-27
+
+#ifdef HAS_VTK
+#ifdef HAS_VTK_EXODUS
+
+#include <vtkUnsignedIntArray.h>
+#include <vtkIntArray.h>
+#include <vtkDoubleArray.h>
+#include <vtkCellType.h>
+#include <vtkPointData.h>
+#include <vtkCellData.h>
+#include <vtkCellArray.h>
+#include <vtkIdTypeArray.h>
+#include <vtkUnstructuredGrid.h>
+#include <vtkExodusIIWriter.h>
+
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include "ExodusFile.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+ExodusFile::ExodusFile(const std::string filename)
+  : GenericFile(filename, "Exodus"),
+    _writer(vtkSmartPointer<vtkExodusIIWriter>::New())
+{
+  // Set filename.
+  _writer->SetFileName(filename.c_str());
+}
+//----------------------------------------------------------------------------
+ExodusFile::~ExodusFile()
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+void ExodusFile::operator<<(const Mesh& mesh)
+{
+  perform_write(create_vtk_mesh(mesh));
+  log(TRACE, "Saved mesh %s (%s) to file %s in Exodus format.",
+      mesh.name().c_str(), mesh.label().c_str(), _filename.c_str());
+  return;
+}
+//----------------------------------------------------------------------------
+void ExodusFile::operator<<(const MeshFunction<std::size_t>& meshfunction)
+{
+  dolfin_assert(meshfunction.mesh());
+  const Mesh& mesh = *meshfunction.mesh();
+  const std::size_t cell_dim = meshfunction.dim();
+
+  // Throw error for MeshFunctions on vertices for interval elements
+  if (mesh.topology().dim() == 1 && cell_dim == 0)
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "write mesh function to Exodus file",
+                 "Exodus output of mesh functions on interval facets is not supported");
+  }
+
+  if (cell_dim != mesh.topology().dim()
+      && cell_dim != mesh.topology().dim() - 1)
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "write mesh function to Exodus file",
+                 "Exodus output of mesh functions is implemented for cell- and facet-based functions only");
+  }
+
+  // Create Exodus mesh
+  vtkSmartPointer<vtkUnstructuredGrid> vtk_mesh = create_vtk_mesh(mesh);
+
+  // Add cell data
+  const std::size_t dim = meshfunction.dim();
+  const std::size_t num_cells = mesh.num_cells();
+  vtkSmartPointer<vtkUnsignedIntArray> cell_data
+    = vtkSmartPointer<vtkUnsignedIntArray>::New();
+  cell_data->SetNumberOfComponents(dim);
+
+  // Copy data to change type and avoid const cast
+  std::vector<unsigned int> tmp(meshfunction.values(),
+                                meshfunction.values() + meshfunction.size());
+  dolfin_assert(tmp.size() ==  dim*num_cells);
+  cell_data->SetArray(tmp.data(), dim*num_cells, 1);
+  cell_data->SetName(meshfunction.name().c_str());
+  vtk_mesh->GetCellData()->AddArray(cell_data);
+
+  // Write out.
+  perform_write(vtk_mesh);
+
+  log(TRACE, "Saved mesh function %s (%s) to file %s in Exodus format.",
+      mesh.name().c_str(), mesh.label().c_str(), _filename.c_str());
+}
+//----------------------------------------------------------------------------
+void ExodusFile::operator<<(const MeshFunction<int>& meshfunction)
+{
+  dolfin_assert(meshfunction.mesh());
+  const Mesh& mesh = *meshfunction.mesh();
+  const std::size_t cell_dim = meshfunction.dim();
+
+  // Throw error for MeshFunctions on vertices for interval elements
+  if (mesh.topology().dim() == 1 && cell_dim == 0)
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "write mesh function to Exodus file",
+                 "Exodus output of mesh functions on interval facets is not supported");
+  }
+
+  if (cell_dim != mesh.topology().dim()
+      && cell_dim != mesh.topology().dim() - 1)
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "write mesh function to Exodus file",
+                 "Exodus output of mesh functions is implemented for cell- and facet-based functions only");
+  }
+
+  // Create Exodus mesh
+  vtkSmartPointer<vtkUnstructuredGrid> vtk_mesh = create_vtk_mesh(mesh);
+
+  // Add cell data
+  const std::size_t dim = meshfunction.dim();
+  const std::size_t num_cells = mesh.num_cells();
+  vtkSmartPointer<vtkIntArray> cell_data
+    = vtkSmartPointer<vtkIntArray>::New();
+  cell_data->SetNumberOfComponents(dim);
+
+  std::vector<int> tmp(meshfunction.values(),
+                       meshfunction.values() + meshfunction.size());
+  dolfin_assert(tmp.size() ==  dim*num_cells);
+  cell_data->SetArray(tmp.data(), dim*num_cells, 1);
+  cell_data->SetName(meshfunction.name().c_str());
+  vtk_mesh->GetCellData()->AddArray(cell_data);
+
+  // Write out
+  perform_write(vtk_mesh);
+
+  log(TRACE, "Saved mesh function %s (%s) to file %s in Exodus format.",
+      mesh.name().c_str(), mesh.label().c_str(), _filename.c_str());
+}
+//----------------------------------------------------------------------------
+void ExodusFile::operator<<(const MeshFunction<double>& meshfunction)
+{
+  dolfin_assert(meshfunction.mesh());
+  const Mesh& mesh = *meshfunction.mesh();
+  const std::size_t cell_dim = meshfunction.dim();
+
+  const std::size_t D = mesh.topology().dim();
+
+  // Throw error for MeshFunctions on vertices for interval elements
+  if (D == 1 && cell_dim == 0)
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "write mesh function to Exodus file",
+                 "Exodus output of mesh functions on interval facets is not supported");
+  }
+
+  if (D && cell_dim != D - 1)
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "write mesh function to Exodus file",
+                 "Exodus output of mesh functions is implemented for cell- and facet-based functions only");
+  }
+
+  // Create Exodus mesh
+  vtkSmartPointer<vtkUnstructuredGrid> vtk_mesh = create_vtk_mesh(mesh);
+
+  // Add cell data
+  const std::size_t dim = meshfunction.dim();
+  const std::size_t num_cells = mesh.num_cells();
+  vtkSmartPointer<vtkDoubleArray> cell_data =
+    vtkSmartPointer<vtkDoubleArray>::New();
+  cell_data->SetNumberOfComponents(dim);
+
+  std::vector<double> tmp(meshfunction.values(),
+                       meshfunction.values() + meshfunction.size());
+  cell_data->SetArray(tmp.data(), dim*num_cells, 1);
+  cell_data->SetName(meshfunction.name().c_str());
+  vtk_mesh->GetCellData()->AddArray(cell_data);
+
+  // Write out
+  perform_write(vtk_mesh);
+
+  log(TRACE, "Saved mesh function %s (%s) to file %s in Exodus format.",
+      mesh.name().c_str(), mesh.label().c_str(), _filename.c_str());
+}
+//----------------------------------------------------------------------------
+void ExodusFile::operator<<(const Function& u)
+{
+  write_function(u, counter);
+}
+//----------------------------------------------------------------------------
+void ExodusFile::operator<<(const std::pair<const Function*, double> u)
+{
+  dolfin_assert(u.first);
+  write_function(*(u.first), u.second);
+}
+//----------------------------------------------------------------------------
+void ExodusFile::write_function(const Function& u, double time) const
+{
+  // Get rank of Function
+  const std::size_t rank = u.value_rank();
+  if (rank > 2)
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "write data to Exodus file",
+                 "Only scalar, vector and tensor functions can be saved in Exodus format");
+  }
+
+  // Get number of components
+  const std::size_t dim = u.value_size();
+
+  // Check that function type can be handled, cf.
+  // http://www.vtk.org/Bug/view.php?id=13508.
+  if (dim > 6)
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "write data to Exodus file",
+                 "Can't handle more than 6 components");
+  }
+
+  // Test for cell-based element type
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *u.function_space()->mesh();
+
+  vtkSmartPointer<vtkUnstructuredGrid> vtk_mesh =
+    create_vtk_mesh(mesh);
+
+  std::size_t cell_based_dim = 1;
+  for (std::size_t i = 0; i < rank; i++)
+    cell_based_dim *= mesh.topology().dim();
+
+  dolfin_assert(u.function_space()->dofmap());
+  const GenericDofMap& dofmap = *u.function_space()->dofmap();
+
+  // Define the vector that holds the values outside the if
+  // to make sure it doesn't get destroyed before the data
+  // is written out to a file
+  std::vector<double> values;
+  if (dofmap.max_cell_dimension() == cell_based_dim)
+  {
+    // Extract DOFs from u
+    std::vector<int> dof_set;
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const std::vector<int>& dofs = dofmap.cell_dofs(cell->index());
+      for(std::size_t i = 0; i < dofmap.cell_dimension(cell->index()); ++i)
+        dof_set.push_back(dofs[i]);
+    }
+    // Get values
+    values.resize(dof_set.size());
+    dolfin_assert(u.vector());
+    u.vector()->get_local(&values[0], dof_set.size(), &dof_set[0]);
+
+    // Set the cell array
+    vtkSmartPointer<vtkDoubleArray> cell_data
+      = vtkSmartPointer<vtkDoubleArray>::New();
+    cell_data->SetNumberOfComponents(dim);
+    cell_data->SetArray(&values[0], dof_set.size(), 1);
+    cell_data->SetName(u.name().c_str());
+    vtk_mesh->GetCellData()->AddArray(cell_data);
+  }
+  else
+  {
+    // Extract point values
+    const std::size_t num_vertices = mesh.num_vertices();
+    const std::size_t size = num_vertices*dim;
+    values.resize(size);
+    u.compute_vertex_values(values, mesh);
+
+    // Set the point array
+    vtkSmartPointer<vtkDoubleArray> point_data
+      = vtkSmartPointer<vtkDoubleArray>::New();
+    point_data->SetNumberOfComponents(dim);
+    point_data->SetArray(&values[0], size, 1);
+    point_data->SetName(u.name().c_str());
+    vtk_mesh->GetPointData()->AddArray(point_data);
+  }
+
+  // Actually write out the data
+  perform_write(vtk_mesh);
+
+  log(TRACE, "Saved function %s (%s) to file %s in Exodus format.",
+      u.name().c_str(), u.label().c_str(), _filename.c_str());
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkUnstructuredGrid>
+ExodusFile::create_vtk_mesh(const Mesh& mesh) const
+{
+  // Build Exodus unstructured grid object
+  vtkSmartPointer<vtkUnstructuredGrid> unstructured_grid =
+    vtkSmartPointer<vtkUnstructuredGrid>::New();
+
+  // Toplogical dimension of mesh
+  const std::size_t D = mesh.topology().dim();
+
+  // Set the points
+  const std::size_t num_points = mesh.num_vertices();
+  vtkSmartPointer<vtkPoints> points = vtkSmartPointer<vtkPoints>::New();
+  // In VTK, all mesh topologies have nodes with coordinates X, Y, Z.
+  // Hence, for 1D and 2D, fill the remaining coordinates with 0
+  if (D == 1)
+  {
+    points->SetNumberOfPoints(num_points);
+    const std::vector<double> & coords = mesh.coordinates();
+    for (std::size_t k = 0; k < num_points; k++)
+      points->SetPoint(k, coords[k], 0.0, 0.0);
+  }
+  else if (D == 2)
+  {
+    points->SetNumberOfPoints(num_points);
+    const std::vector<double>& coords = mesh.coordinates();
+    for (std::size_t k = 0; k < num_points; k++)
+      points->SetPoint(k, coords[2*k], coords[2*k + 1], 0.0);
+  }
+  else if (D == 3)
+  {
+    // For 3D topologies, we can just move some pointers around to
+    // give VTK access to the node coordinates
+    vtkSmartPointer<vtkDoubleArray> point_data
+      = vtkSmartPointer<vtkDoubleArray>::New();
+    point_data->SetNumberOfComponents(3);
+    dolfin_assert(mesh.coordinates().size() ==  3*num_points);
+    std::vector<double> tmp(mesh.coordinates().begin(),
+                            mesh.coordinates().end());
+    dolfin_assert(mesh.coordinates().size() == 3*num_points);
+    point_data->SetArray(tmp.data(), 3*num_points, 1);
+    points->SetData(point_data);
+  }
+  else
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "extract node coordinates",
+                 "Illegal topological dimension");
+  }
+  unstructured_grid->SetPoints(points);
+
+  // Set cells. Those need to be copied over since the default DOLFIN
+  // node ID data type is std::size_t and the node ID of Exodus is
+  // vtkIdType (typically long long int).
+  const std::size_t n = D + 1;
+  const std::size_t num_cells = mesh.num_cells();
+  const std::vector<unsigned int> cells = mesh.cells();
+  vtkSmartPointer<vtkCellArray> cell_data
+    = vtkSmartPointer<vtkCellArray>::New();
+
+  // Allocate 4 entries, we may use less though
+  std::vector<vtkIdType> tmp(4);
+  for (std::size_t k = 0; k < num_cells; k++)
+  {
+    for (std::size_t i = 0; i < n; i++)
+      tmp[i] = cells[n*k + i];
+    cell_data->InsertNextCell(n, tmp.data());
+  }
+
+  if (n == 2)
+    unstructured_grid->SetCells(VTK_LINE, cell_data);
+  else if (n == 3)
+    unstructured_grid->SetCells(VTK_TRIANGLE, cell_data);
+  else if (n == 4)
+    unstructured_grid->SetCells(VTK_TETRA, cell_data);
+  else
+  {
+    dolfin_error("ExodusFile.cpp",
+                 "construct VTK mesh",
+                 "Illegal element node number");
+  }
+
+  return unstructured_grid;
+}
+//----------------------------------------------------------------------------
+void ExodusFile::perform_write(const vtkSmartPointer<vtkUnstructuredGrid>& vtk_mesh) const
+{
+  // Write out to file.
+  _writer->SetInput(vtk_mesh);
+  _writer->Write();
+
+  return;
+}
+//----------------------------------------------------------------------------
+
+#endif
+#endif
diff --git a/dolfin/io/ExodusFile.h b/dolfin/io/ExodusFile.h
new file mode 100644
index 0000000..5af1cb5
--- /dev/null
+++ b/dolfin/io/ExodusFile.h
@@ -0,0 +1,76 @@
+// Copyright (C) 2013 Nico Schlömer
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-27
+
+#ifndef __EXODUS_FILE_H
+#define __EXODUS_FILE_H
+
+#ifdef HAS_VTK
+#ifdef HAS_VTK_EXODUS
+
+#include <vtkSmartPointer.h>
+#include "GenericFile.h"
+
+// Forward declarations
+class vtkUnstructuredGrid;
+class vtkExodusIIWriter;
+
+namespace dolfin
+{
+
+  class Function;
+  class Mesh;
+  template <typename T> class MeshFunction;
+
+  /// This class supports the output of meshes and functions.
+  /// Exodus format for visualistion purposes. It is not suitable to
+  /// checkpointing as it may decimate some data.
+
+  class ExodusFile : public GenericFile
+  {
+  public:
+
+    ExodusFile(const std::string filename);
+    ~ExodusFile();
+
+    void operator<< (const Mesh& mesh);
+    void operator<< (const MeshFunction<std::size_t>& meshfunction);
+    void operator<< (const MeshFunction<int>& meshfunction);
+    void operator<< (const MeshFunction<double>& meshfunction);
+    void operator<< (const Function& u);
+    void operator<< (const std::pair<const Function*, double> u);
+
+  private:
+
+    void write_function(const Function& u, double time) const;
+
+    vtkSmartPointer<vtkUnstructuredGrid>
+      create_vtk_mesh(const Mesh& mesh) const;
+
+    void
+      perform_write(const vtkSmartPointer<vtkUnstructuredGrid>& vtk_mesh) const;
+
+    const vtkSmartPointer<vtkExodusIIWriter> _writer;
+
+  };
+
+}
+
+#endif
+#endif
+#endif
diff --git a/dolfin/io/File.cpp b/dolfin/io/File.cpp
new file mode 100644
index 0000000..e10d607
--- /dev/null
+++ b/dolfin/io/File.cpp
@@ -0,0 +1,244 @@
+// Copyright (C) 2002-2011 Johan Hoffman, Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Magnus Vikstrom 2007.
+// Modified by Nuno Lopes 2008.
+// Modified by Niclas Jansson 2008.
+// Modified by Ola Skavhaug 2009.
+//
+// First added:  2002-11-12
+// Last changed: 2013-03-11
+
+#include <fstream>
+#include <string>
+#include <boost/filesystem.hpp>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/log/dolfin_log.h>
+#include "BinaryFile.h"
+#include "ExodusFile.h"
+#include "RAWFile.h"
+#include "SVGFile.h"
+#include "VTKFile.h"
+#include "X3DFile.h"
+#include "XMLFile.h"
+#include "XDMFFile.h"
+#include "XYZFile.h"
+
+#include "File.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+File::File(const std::string filename, std::string encoding)
+  : _mpi_comm(MPI_COMM_WORLD)
+{
+  init(MPI_COMM_WORLD, filename, encoding);
+}
+//-----------------------------------------------------------------------------
+File::File(MPI_Comm comm, const std::string filename, std::string encoding)
+  : _mpi_comm(comm)
+{
+  init(comm, filename, encoding);
+}
+//-----------------------------------------------------------------------------
+File::File(const std::string filename, Type type, std::string encoding)
+  : _mpi_comm(MPI_COMM_WORLD)
+{
+  init(MPI_COMM_WORLD, filename, type, encoding);
+}
+//-----------------------------------------------------------------------------
+File::File(MPI_Comm comm, const std::string filename, Type type,
+           std::string encoding) : _mpi_comm(comm)
+{
+  init(comm, filename, type, encoding);
+}
+//-----------------------------------------------------------------------------
+File::File(std::ostream& outstream) : _mpi_comm(MPI_COMM_SELF)
+{
+  file.reset(new XMLFile(outstream));
+}
+//-----------------------------------------------------------------------------
+File::~File()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void File::operator<<(const std::pair<const Mesh*, double> mesh)
+{
+  file->write(MPI::rank(_mpi_comm));
+  *file << mesh;
+}
+//-----------------------------------------------------------------------------
+void File::operator<<(const std::pair<const MeshFunction<int>*, double> f)
+{
+  file->write(MPI::rank(_mpi_comm));
+  *file << f;
+}
+//-----------------------------------------------------------------------------
+void
+File::operator<<(const std::pair<const MeshFunction<std::size_t>*, double> f)
+{
+  file->write(MPI::rank(_mpi_comm));
+  *file << f;
+}
+//-----------------------------------------------------------------------------
+void File::operator<<(const std::pair<const MeshFunction<double>*, double> f)
+{
+  file->write(MPI::rank(_mpi_comm));
+  *file << f;
+}
+//-----------------------------------------------------------------------------
+void File::operator<<(const std::pair<const MeshFunction<bool>*, double> f)
+{
+  file->write(MPI::rank(_mpi_comm));
+  *file << f;
+}
+//-----------------------------------------------------------------------------
+void File::operator<<(const std::pair<const Function*, double> u)
+{
+  file->write(MPI::rank(_mpi_comm));
+  *file << u;
+}
+//-----------------------------------------------------------------------------
+bool File::exists(std::string filename)
+{
+  std::ifstream file(filename.c_str());
+  if (!file.is_open())
+    return false;
+  else
+  {
+    file.close();
+    return true;
+  }
+}
+//-----------------------------------------------------------------------------
+void File::create_parent_path(std::string filename)
+{
+  const boost::filesystem::path path(filename);
+  if (path.has_parent_path()
+      && !boost::filesystem::is_directory(path.parent_path()))
+  {
+    boost::filesystem::create_directories(path.parent_path());
+    if (!boost::filesystem::is_directory(path.parent_path()))
+    {
+      dolfin_error("File.cpp",
+                   "open file",
+                   "Could not create directory \"%s\"",
+                   path.parent_path().string().c_str());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void File::init(MPI_Comm comm, const std::string filename,
+                std::string encoding)
+{
+  // Create parent path for file if file has a parent path
+  create_parent_path(filename);
+
+  // Get file path and extension
+  const boost::filesystem::path path(filename);
+  const std::string extension = boost::filesystem::extension(path);
+
+  // Choose format based on extension
+  if (extension == ".gz")
+  {
+    // Get suffix after discarding .gz
+    const std::string ext =
+      boost::filesystem::extension(boost::filesystem::basename(path));
+    if (ext == ".xml")
+      file.reset(new XMLFile(comm, filename));
+    else if (ext == ".bin")
+      file.reset(new BinaryFile(filename));
+    else
+    {
+      dolfin_error("File.cpp",
+                   "open file",
+                   "Unknown file type (\"%s\") for file \"%s\"",
+                   ext.c_str(), filename.c_str());
+    }
+  }
+  else if (extension == ".x3d")
+    file.reset(new X3DFile(filename));
+  else if (extension == ".xml")
+    file.reset(new XMLFile(comm, filename));
+  else if (extension == ".pvd")
+    file.reset(new VTKFile(filename, encoding));
+#ifdef HAS_VTK
+#ifdef HAS_VTK_EXODUS
+  else if (extension == ".e")
+    file.reset(new ExodusFile(filename));
+#endif
+#endif
+  else if (extension == ".raw")
+    file.reset(new RAWFile(filename));
+  else if (extension == ".xyz")
+    file.reset(new XYZFile(filename));
+  else if (extension == ".bin")
+    file.reset(new BinaryFile(filename));
+#ifdef HAS_HDF5
+  else if (extension == ".xdmf")
+    file.reset(new XDMFFile(comm, filename));
+#endif
+  else if (extension == ".svg")
+    file.reset(new SVGFile(filename));
+  else
+  {
+    dolfin_error("File.cpp",
+                 "open file",
+                 "Unknown file type (\"%s\") for file \"%s\"",
+                 extension.c_str(), filename.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void File::init(MPI_Comm comm, const std::string filename, Type type,
+                std::string encoding)
+{
+  switch (type)
+  {
+  case x3d:
+    file.reset(new X3DFile(filename));
+    break;
+  case xdmf:
+#ifdef HAS_HDF5
+    file.reset(new XDMFFile(comm, filename));
+    break;
+#endif
+  case xml:
+    file.reset(new XMLFile(comm, filename));
+    break;
+  case vtk:
+    file.reset(new VTKFile(filename, encoding));
+    break;
+  case raw:
+    file.reset(new RAWFile(filename));
+    break;
+  case xyz:
+    file.reset(new XYZFile(filename));
+    break;
+  case binary:
+    file.reset(new BinaryFile(filename));
+    break;
+  default:
+    dolfin_error("File.cpp",
+                 "open file",
+                 "Unknown file type (\"%d\") for file \"%s\"",
+                 type, filename.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/File.h b/dolfin/io/File.h
new file mode 100644
index 0000000..83ae2e0
--- /dev/null
+++ b/dolfin/io/File.h
@@ -0,0 +1,275 @@
+// Copyright (C) 2002-2012 Johan Hoffman, Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Magnus Vikstrom 2007
+// Modified by Nuno Lopes 2008
+// Modified by Ola Skavhaug 2009
+//
+// First added:  2002-11-12
+// Last changed: 2013-03-11
+
+#ifndef __FILE_H
+#define __FILE_H
+
+#include <memory>
+#include <ostream>
+#include <string>
+#include <utility>
+#include <dolfin/common/MPI.h>
+#include "GenericFile.h"
+
+namespace dolfin
+{
+
+  /// A File represents a data file for reading and writing objects.
+  /// Unless specified explicitly, the format is determined by the
+  /// file name suffix.
+
+  /// A list of objects that can be read/written to file can be found in
+  /// GenericFile.h. Compatible file formats include:
+  ///     * Binary (.bin)
+  ///     * RAW    (.raw)
+  ///     * SVG    (.svg)
+  ///     * XD3    (.xd3)
+  ///     * XDMF   (.xdmf)
+  ///     * XML    (.xml)
+  ///     * XYZ    (.xyz)
+  ///     * VTK    (.pvd)
+
+  class File
+  {
+  public:
+
+    /// File formats
+    enum Type {x3d, xdmf, xml, vtk, raw, xyz, binary, svg};
+
+    /// Create a file with given name
+    ///
+    /// *Arguments*
+    ///     filename (std::string)
+    ///         Name of file.
+    ///     encoding (std::string)
+    ///         Optional argument specifying encoding, ascii is default.
+    ///
+    /// *Example*
+    ///    .. code-block:: c++
+    ///
+    ///         // Save solution to file
+    ///         File file("solution.pvd");
+    ///         file << u;
+    ///
+    ///         // Read mesh data from file
+    ///         File mesh_file("mesh.xml");
+    ///         mesh_file >> mesh;
+    ///
+    ///         // Using compressed binary format
+    ///         File comp_file("solution.pvd", "compressed");
+    ///
+    File(const std::string filename, std::string encoding="ascii");
+
+    /// Create a file with given name with MPI communicator
+    ///
+    /// *Arguments*
+    ///     communicator (MPI_Comm)
+    ///         The MPI communicator.
+    ///     filename (std::string)
+    ///         Name of file.
+    ///     encoding (std::string)
+    ///         Optional argument specifying encoding, ascii is default.
+    ///
+    /// *Example*
+    ///    .. code-block:: c++
+    ///
+    ///         // Save solution to file
+    ///         File file(u.mesh()->mpi_comm(), "solution.pvd");
+    ///         file << u;
+    ///
+    ///         // Read mesh data from file
+    ///         File mesh_file(MPI_COMM_WORLD, "mesh.xml");
+    ///         mesh_file >> mesh;
+    ///
+    ///         // Using compressed binary format
+    ///         File comp_file(u.mesh()->mpi_comm(), "solution.pvd",
+    ///                        "compressed");
+    ///
+    File(MPI_Comm comm, const std::string filename,
+         std::string encoding="ascii");
+
+    /// Create a file with given name and type (format)
+    ///
+    /// *Arguments*
+    ///     filename (std::string)
+    ///         Name of file.
+    ///     type (Type)
+    ///         File format.
+    ///     encoding (std::string)
+    ///         Optional argument specifying encoding, ascii is default.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         File file("solution", vtk);
+    ///
+    File(const std::string filename, Type type, std::string encoding="ascii");
+
+    /// Create a file with given name and type (format) with MPI communicator
+    ///
+    /// *Arguments*
+    ///     communicator (MPI_Comm)
+    ///         The MPI communicator.
+    ///     filename (std::string)
+    ///         Name of file.
+    ///     type (Type)
+    ///         File format.
+    ///     encoding (std::string)
+    ///         Optional argument specifying encoding, ascii is default.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         File file(MPI_COMM_WORLD, "solution", vtk);
+    ///
+    File(MPI_Comm comm, const std::string filename, Type type,
+         std::string encoding="ascii");
+
+    /// Create an outfile object writing to stream
+    ///
+    /// *Arguments*
+    ///     outstream (std::ostream)
+    ///         The stream.
+    File(std::ostream& outstream);
+
+    /// Destructor
+    ~File();
+
+    /// Read from file
+    template<typename T> void operator>>(T& t)
+    {
+      file->read();
+      *file >> t;
+    }
+
+    /// Write Function to file
+    //void operator<<(const Function& u);
+
+    /// Write Mesh to file with time
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         File file("mesh.pvd", "compressed");
+    ///         file << std::make_pair<const Mesh*, double>(&mesh, t);
+    ///
+    void operator<<(const std::pair<const Mesh*, double> mesh);
+
+    /// Write MeshFunction to file with time
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         File file("markers.pvd", "compressed");
+    ///         file << std::make_pair<const MeshFunction<int>*, double>(&f, t);
+    ///
+    void operator<<(const std::pair<const MeshFunction<int>*, double> f);
+
+    /// Write MeshFunction to file with time
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         File file("markers.pvd", "compressed");
+    ///         file << std::make_pair<const MeshFunction<std::size_t>*, double>(&f, t);
+    ///
+    void operator<<
+      (const std::pair<const MeshFunction<std::size_t>*, double> f);
+
+    /// Write MeshFunction to file with time
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         File file("markers.pvd", "compressed");
+    ///         file << std::make_pair<const MeshFunction<double>*, double>(&f, t);
+    ///
+    void operator<< (const std::pair<const MeshFunction<double>*, double> f);
+
+    /// Write MeshFunction to file with time
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         File file("markers.pvd", "compressed");
+    ///         file << std::make_pair<const MeshFunction<bool>*, double>(&f, t);
+    ///
+    void operator<<(const std::pair<const MeshFunction<bool>*, double> f);
+
+    /// Write Function to file with time
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         File file("solution.pvd", "compressed");
+    ///         file << std::make_pair<const Function*, double>(&u, t);
+    ///
+    void operator<<(const std::pair<const Function*, double> u);
+
+    /// Write object to file
+    template<typename T> void operator<<(const T& t)
+    {
+      file->write(MPI::rank(_mpi_comm));
+      *file << t;
+    }
+
+    /// Check if file exists
+    ///
+    /// *Arguments*
+    ///     filename (std::string)
+    ///         Name of file.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the file exists.
+    static bool exists(std::string filename);
+
+    // Create parent path for file if file has a parent path
+    ///
+    /// *Arguments*
+    ///     filename (std::string)
+    ///         Name of file / path.
+    static void create_parent_path(std::string filename);
+
+  private:
+
+    // Initialise GenericFile (using file extension to determine type)
+    void init(MPI_Comm comm, const std::string filename, std::string encoding);
+
+    // Initialise GenericFile  (with specified type)
+    void init(MPI_Comm comm, const std::string filename, Type type,
+              std::string encoding);
+
+    // FIXME: Remove when GenericFile::write is cleaned up
+    // MPI communicator
+    const MPI_Comm _mpi_comm;
+
+    // Pointer to implementation (envelope-letter design)
+    std::unique_ptr<GenericFile> file;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/GenericFile.cpp b/dolfin/io/GenericFile.cpp
new file mode 100644
index 0000000..0e0fb8c
--- /dev/null
+++ b/dolfin/io/GenericFile.cpp
@@ -0,0 +1,361 @@
+// Copyright (C) 2002-2011 Johan Hoffman and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson 2008
+// Modified by Ola Skavhaug 2009
+// Modified by Garth N. Wells 2009
+//
+// First added:  2002-11-12
+// Last changed: 2013-03-11
+
+#include <fstream>
+#include <dolfin/common/MPI.h>
+#include <dolfin/log/dolfin_log.h>
+#include "GenericFile.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+GenericFile::GenericFile(std::string filename, std::string filetype)
+ : _filename(filename), _filetype(filetype),
+   opened_read(false),  opened_write(false), check_header(false),
+   counter(0), counter1(0), counter2(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+GenericFile::~GenericFile()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (Mesh& mesh)
+{
+  read_not_impl("Mesh");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (GenericVector& x)
+{
+  read_not_impl("Vector");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (GenericMatrix& A)
+{
+  read_not_impl("Matrix");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (GenericDofMap& data)
+{
+  read_not_impl("GenericDofMap");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (LocalMeshData& data)
+{
+  read_not_impl("LocalMeshData");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (MeshFunction<int>& mesh_function)
+{
+  read_not_impl("MeshFunction<int>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (MeshFunction<std::size_t>& mesh_function)
+{
+  read_not_impl("MeshFunction<std::size_t>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (MeshFunction<double>& mesh_function)
+{
+  read_not_impl("MeshFunction<double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (MeshFunction<bool>& mesh_function)
+{
+  read_not_impl("MeshFunction<bool>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (MeshValueCollection<int>& mesh_markers)
+{
+  read_not_impl("MeshValueCollection<int>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (MeshValueCollection<std::size_t>& mesh_markers)
+{
+  read_not_impl("MeshValueCollection<std::size_t>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (MeshValueCollection<double>& mesh_markers)
+{
+  read_not_impl("MeshValueCollection<double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (MeshValueCollection<bool>& mesh_markers)
+{
+  read_not_impl("MeshValueCollection<bool>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (Parameters& parameters)
+{
+  read_not_impl("Parameters");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::vector<int>& x)
+{
+  read_not_impl("std::vector<int>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::vector<std::size_t>& x)
+{
+  read_not_impl("std::vector<std::size_t>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::vector<double>& x)
+{
+  read_not_impl("std::vector<double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::map<std::size_t, int>& map)
+{
+  read_not_impl("std::map<std::size_t, int>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::map<std::size_t, std::size_t>& map)
+{
+  read_not_impl("std::map<std::size_t, std::size_t>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::map<std::size_t, double>& map)
+{
+  read_not_impl("std::map<std::size_t, double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::map<std::size_t, std::vector<int> >& array_map)
+{
+  read_not_impl("std::map<std::size_t, std::vector<int> >");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::map<std::size_t, std::vector<std::size_t> >& array_map)
+{
+  read_not_impl("std::map<std::size_t, std::vector<std::size_t> >");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (std::map<std::size_t, std::vector<double> >& array_map)
+{
+  read_not_impl("std::map<std::size_t, std::vector<double> >");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator>> (Function& u)
+{
+  read_not_impl("Function");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const Mesh & mesh)
+{
+  write_not_impl("Mesh");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const GenericVector& x)
+{
+  write_not_impl("Vector");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const GenericMatrix& A)
+{
+  write_not_impl("Matrix");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const GenericDofMap& dofmap)
+{
+  write_not_impl("GenericDofMap");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const LocalMeshData& data)
+{
+  write_not_impl("LocalMeshData");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const MeshFunction<int>& mesh_function)
+{
+  write_not_impl("MeshFunction<int>");
+}
+void GenericFile::operator<< (const MeshFunction<std::size_t>& mesh_function)
+{
+  write_not_impl("MeshFunction<std::size_t>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const MeshFunction<double>& mesh_function)
+{
+  write_not_impl("MeshFunction<double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const MeshFunction<bool>& mesh_function)
+{
+  write_not_impl("MeshFunction<bool>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const MeshValueCollection<int>& mesh_markers)
+{
+  write_not_impl("MeshValueCollection<int>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const MeshValueCollection<std::size_t>& mesh_markers)
+{
+  write_not_impl("MeshValueCollection<std::size_t>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const MeshValueCollection<double>& mesh_markers)
+{
+  write_not_impl("MeshValueCollection<double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const MeshValueCollection<bool>& mesh_markers)
+{
+  write_not_impl("MeshValueCollection<bool>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const Function& u)
+{
+  write_not_impl("Function");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::pair<const Mesh*, double> mesh)
+{
+  write_not_impl("std::pair<Mesh*, double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::pair<const MeshFunction<int>*, double> f)
+{
+  write_not_impl("std::pair<MeshFunction<int>*, double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::pair<const MeshFunction<std::size_t>*, double> f)
+{
+  write_not_impl("std::pair<MeshFunction<std::size_t>*, double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::pair<const MeshFunction<double>*, double> f)
+{
+  write_not_impl("std::pair<MeshFunction<double>*, double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::pair<const MeshFunction<bool>*, double> f)
+{
+  write_not_impl("std::pair<MeshFunction<bool>*, double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::pair<const Function*, double> u)
+{
+  write_not_impl("std::pair<Function*, double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const Parameters& parameters)
+{
+  write_not_impl("Parameters");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::vector<int>& x)
+{
+  read_not_impl("std::vector<int>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::vector<std::size_t>& x)
+{
+  read_not_impl("std::vector<std::size_t>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::vector<double>& x)
+{
+  read_not_impl("std::vector<double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::map<std::size_t, int>& map)
+{
+  read_not_impl("std::map<std::size_t, int>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::map<std::size_t, std::size_t>& map)
+{
+  read_not_impl("std::map<std::size_t, std::size_t>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::map<std::size_t, double>& map)
+{
+  read_not_impl("std::map<std::size_t, double>");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::map<std::size_t,
+                              std::vector<int> >& array_map)
+{
+  read_not_impl("std::map<std::size_t, std::vector<int> >");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::map<std::size_t,
+                              std::vector<std::size_t> >& array_map)
+{
+  read_not_impl("std::map<std::size_t, std::vector<std::size_t> >");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::operator<< (const std::map<std::size_t,
+                              std::vector<double> >& array_map)
+{
+  read_not_impl("std::map<std::size_t, std::vector<double> >");
+}
+//-----------------------------------------------------------------------------
+void GenericFile::read()
+{
+  opened_read = true;
+}
+//-----------------------------------------------------------------------------
+void GenericFile::write(std::size_t process_number)
+{
+  // pvd files should only be cleared by one process
+  if (_filetype == "VTK" && process_number > 0)
+    opened_write = true;
+
+  // Open file
+  if (!opened_write)
+  {
+    // Clear file
+    std::ofstream file(_filename.c_str(), std::ios::trunc);
+    if (!file.good())
+    {
+      dolfin_error("GenericFile.cpp",
+                   "write to file",
+                   "Unable to open file \"%s\" for writing",
+                   _filename.c_str());
+    }
+    file.close();
+  }
+  opened_write = true;
+}
+//-----------------------------------------------------------------------------
+void GenericFile::read_not_impl(const std::string object) const
+{
+  dolfin_error("GenericFile.cpp",
+               "read object from file",
+               "Cannot read objects of type %s from %s files",
+               object.c_str(), _filetype.c_str());
+}
+//-----------------------------------------------------------------------------
+void GenericFile::write_not_impl(const std::string object) const
+{
+  dolfin_error("GenericFile.cpp",
+               "write object to file",
+               "Cannot write objects of type %s to %s files",
+               object.c_str(), _filetype.c_str());
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/GenericFile.h b/dolfin/io/GenericFile.h
new file mode 100644
index 0000000..61967a6
--- /dev/null
+++ b/dolfin/io/GenericFile.h
@@ -0,0 +1,146 @@
+// Copyright (C) 2003-2011 Johan Hoffman and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2009.
+//
+// First added:  2003-07-15
+// Last changed: 2013-03-11
+
+#ifndef __GENERIC_FILE_H
+#define __GENERIC_FILE_H
+
+#include <map>
+#include <string>
+#include <utility>
+#include <vector>
+
+namespace dolfin
+{
+
+  class GenericDofMap;
+  class Function;
+  class GenericMatrix;
+  class GenericVector;
+  class LocalMeshData;
+  class Mesh;
+  template <typename T> class MeshFunction;
+  template <typename T> class MeshValueCollection;
+  class Parameters;
+
+  class GenericFile
+  {
+  public:
+
+    /// Constructor
+    GenericFile(std::string filename,
+                std::string filetype);
+
+    /// Destructor
+    virtual ~GenericFile();
+
+    // Input
+    virtual void operator>> (Mesh& mesh);
+    virtual void operator>> (GenericVector& x);
+    virtual void operator>> (GenericMatrix& A);
+    virtual void operator>> (GenericDofMap& dofmap);
+    virtual void operator>> (LocalMeshData& data);
+    virtual void operator>> (MeshFunction<int>& mesh_function);
+    virtual void operator>> (MeshFunction<std::size_t>& mesh_function);
+    virtual void operator>> (MeshFunction<double>& mesh_function);
+    virtual void operator>> (MeshFunction<bool>& mesh_function);
+    virtual void operator>> (MeshValueCollection<int>& mesh_markers);
+    virtual void operator>> (MeshValueCollection<std::size_t>& mesh_markers);
+    virtual void operator>> (MeshValueCollection<double>& mesh_markers);
+    virtual void operator>> (MeshValueCollection<bool>& mesh_markers);
+    virtual void operator>> (Parameters& parameters);
+    virtual void operator>> (std::vector<int>& x);
+    virtual void operator>> (std::vector<std::size_t>& x);
+    virtual void operator>> (std::vector<double>& x);
+    virtual void operator>> (std::map<std::size_t, int>& map);
+    virtual void operator>> (std::map<std::size_t, std::size_t>& map);
+    virtual void operator>> (std::map<std::size_t, double>& map);
+    virtual void operator>> (std::map<std::size_t, std::vector<int> >& array_map);
+    virtual void operator>> (std::map<std::size_t, std::vector<std::size_t> >& array_map);
+    virtual void operator>> (std::map<std::size_t, std::vector<double> >& array_map);
+    virtual void operator>> (Function& u);
+
+    // Output
+    virtual void operator<< (const GenericVector& x);
+    virtual void operator<< (const GenericMatrix& A);
+    virtual void operator<< (const Mesh& mesh);
+    virtual void operator<< (const GenericDofMap& dofmap);
+    virtual void operator<< (const LocalMeshData& data);
+    virtual void operator<< (const MeshFunction<int>& mesh_function);
+    virtual void operator<< (const MeshFunction<std::size_t>& mesh_function);
+    virtual void operator<< (const MeshFunction<double>& mesh_function);
+    virtual void operator<< (const MeshFunction<bool>& mesh_function);
+    virtual void operator<< (const MeshValueCollection<int>& mesh_markers);
+    virtual void operator<< (const MeshValueCollection<std::size_t>& mesh_markers);
+    virtual void operator<< (const MeshValueCollection<double>& mesh_markers);
+    virtual void operator<< (const MeshValueCollection<bool>& mesh_markers);
+    virtual void operator<< (const Function& u);
+
+    // Output with time
+    virtual void operator<< (const std::pair<const Mesh*, double> mesh);
+    virtual void operator<< (const std::pair<const MeshFunction<int>*, double> f);
+    virtual void operator<< (const std::pair<const MeshFunction<std::size_t>*, double> f);
+    virtual void operator<< (const std::pair<const MeshFunction<double>*, double> f);
+    virtual void operator<< (const std::pair<const MeshFunction<bool>*, double> f);
+    virtual void operator<< (const std::pair<const Function*, double> u);
+
+    virtual void operator<< (const Parameters& parameters);
+    virtual void operator<< (const std::vector<int>& x);
+    virtual void operator<< (const std::vector<std::size_t>& x);
+    virtual void operator<< (const std::vector<double>& x);
+    virtual void operator<< (const std::map<std::size_t, int>& map);
+    virtual void operator<< (const std::map<std::size_t, std::size_t>& map);
+    virtual void operator<< (const std::map<std::size_t, double>& map);
+    virtual void operator<< (const std::map<std::size_t, std::vector<int> >& array_map);
+    virtual void operator<< (const std::map<std::size_t, std::vector<std::size_t> >& array_map);
+    virtual void operator<< (const std::map<std::size_t, std::vector<double> >& array_map);
+
+    void read();
+    virtual void write(std::size_t process_number);
+
+    // Return filename
+    std::string name() const
+    { return _filename; }
+
+  protected:
+
+    void read_not_impl(const std::string object) const;
+    void write_not_impl(const std::string object) const;
+
+    std::string _filename;
+    std::string _filetype;
+
+    bool opened_read;
+    bool opened_write;
+
+    // True if we have written a header
+    bool check_header;
+
+    // Counters for the number of times various data has been written
+    std::size_t counter;
+    std::size_t counter1;
+    std::size_t counter2;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/HDF5Attribute.cpp b/dolfin/io/HDF5Attribute.cpp
new file mode 100644
index 0000000..bfe771b
--- /dev/null
+++ b/dolfin/io/HDF5Attribute.cpp
@@ -0,0 +1,212 @@
+// Copyright (C) 2013 Chris N Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First added:  2012-06-01
+// Last changed: 2013-11-05
+
+#ifdef HAS_HDF5
+
+#include<boost/lexical_cast.hpp>
+#include<dolfin/common/Array.h>
+#include "HDF5Interface.h"
+#include "HDF5Attribute.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+template <typename T>
+const std::string
+HDF5Attribute::vector_to_string(const std::vector<T>& vector_value) const
+{
+  std::string value;
+  value = "";
+  const std::size_t nlast = vector_value.size() - 1;
+  for(std::size_t i = 0; i < nlast; ++i)
+    value += boost::lexical_cast<std::string>(vector_value[i]) + ", ";
+  value += boost::lexical_cast<std::string>(vector_value[nlast]);
+  return value;
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void HDF5Attribute::set_value(const std::string attribute_name,
+                              const T& attribute_value)
+{
+  if (!HDF5Interface::has_dataset(hdf5_file_id, dataset_name))
+  {
+    dolfin_error("HDF5Attribute.cpp",
+                 "set attribute on dataset",
+                 "Dataset does not exist");
+  }
+
+  if (HDF5Interface::has_attribute(hdf5_file_id, dataset_name,
+                                   attribute_name))
+  {
+    HDF5Interface::delete_attribute(hdf5_file_id, dataset_name,
+                                    attribute_name);
+  }
+
+  HDF5Interface::add_attribute(hdf5_file_id, dataset_name,
+                               attribute_name, attribute_value);
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void HDF5Attribute::get_value(const std::string attribute_name,
+                              T& attribute_value) const
+{
+  if (!HDF5Interface::has_dataset(hdf5_file_id, dataset_name))
+  {
+    dolfin_error("HDF5Attribute.cpp",
+                 "get attribute of dataset",
+                 "Dataset does not exist");
+  }
+
+  if (!HDF5Interface::has_attribute(hdf5_file_id, dataset_name,
+                                    attribute_name))
+  {
+    dolfin_error("HDF5Attribute.cpp",
+                 "get attribute of dataset",
+                 "Attribute does not exist");
+  }
+
+  HDF5Interface::get_attribute(hdf5_file_id, dataset_name, attribute_name,
+                               attribute_value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::set(const std::string attribute_name,
+                        const double value)
+{
+  set_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::set(const std::string attribute_name,
+                        const std::size_t value)
+{
+  set_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::set(const std::string attribute_name,
+                        const std::vector<double>& value)
+{
+  set_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::set(const std::string attribute_name,
+                        const std::vector<std::size_t>& value)
+{
+  set_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::set(const std::string attribute_name,
+                        const std::string value)
+{
+  set_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::get(const std::string attribute_name,
+                        double& value) const
+{
+  get_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::get(const std::string attribute_name,
+                        std::size_t& value) const
+{
+  get_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::get(const std::string attribute_name,
+                        std::vector<double>& value) const
+{
+  get_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::get(const std::string attribute_name,
+                        std::vector<std::size_t>& value) const
+{
+  get_value(attribute_name, value);
+}
+//-----------------------------------------------------------------------------
+void HDF5Attribute::get(const std::string attribute_name,
+                        std::string& value) const
+{
+  const std::string attribute_type = type_str(attribute_name);
+  if (attribute_type == "string")
+    get_value(attribute_name, value);
+  else if (attribute_type == "float")
+  {
+    double float_value;
+    get_value(attribute_name, float_value);
+    value = boost::lexical_cast<std::string>(float_value);
+  }
+  else if (attribute_type == "int")
+  {
+    std::size_t int_value;
+    get_value(attribute_name, int_value);
+    value = boost::lexical_cast<std::string>(int_value);
+  }
+  else if (attribute_type == "vectorfloat")
+  {
+    std::vector<double> vector_value;
+    get_value(attribute_name, vector_value);
+    value = vector_to_string(vector_value);
+  }
+  else if (attribute_type == "vectorint")
+  {
+    std::vector<std::size_t> vector_value;
+    get_value(attribute_name, vector_value);
+    value = vector_to_string(vector_value);
+  }
+  else
+    value = "Unsupported";
+}
+//-----------------------------------------------------------------------------
+bool HDF5Attribute::exists(const std::string attribute_name) const
+{
+  return HDF5Interface::has_attribute(hdf5_file_id, dataset_name,
+                                      attribute_name);
+}
+//-----------------------------------------------------------------------------
+const std::string HDF5Attribute::str(const std::string attribute_name) const
+{
+  std::string str_result;
+  get(attribute_name, str_result);
+  return str_result;
+}
+//-----------------------------------------------------------------------------
+const std::string HDF5Attribute::str() const
+{
+  std::string str_result;
+  std::vector<std::string> attrs
+    = HDF5Interface::list_attributes(hdf5_file_id, dataset_name);
+  for(std::vector<std::string>::iterator s = attrs.begin();
+      s != attrs.end(); ++s)
+  {
+    str_result += *s + " ";
+  }
+  return str_result;
+}
+//-----------------------------------------------------------------------------
+const std::string
+HDF5Attribute::type_str(const std::string attribute_name) const
+{
+  return HDF5Interface::get_attribute_type(hdf5_file_id, dataset_name,
+                                           attribute_name);
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/io/HDF5Attribute.h b/dolfin/io/HDF5Attribute.h
new file mode 100644
index 0000000..922433b
--- /dev/null
+++ b/dolfin/io/HDF5Attribute.h
@@ -0,0 +1,120 @@
+// Copyright (C) 2013 Chris N. Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-10-16
+// Last changed: 2013-11-05
+
+#ifndef __DOLFIN_HDF5ATTRIBUTE_H
+#define __DOLFIN_HDF5ATTRIBUTE_H
+
+#ifdef HAS_HDF5
+
+#include <string>
+#include <vector>
+
+#include<dolfin/common/Array.h>
+#include "HDF5Interface.h"
+
+namespace dolfin
+{
+
+  /// HDF5Attribute gives access to the attributes of a dataset
+  /// via set() and get() methods
+
+  class HDF5Attribute
+  {
+  public:
+
+    // FIXME: Check validity of file and dataset
+
+    /// Constructor
+    HDF5Attribute(const hid_t hdf5_file_id, std::string dataset_name)
+      : hdf5_file_id(hdf5_file_id), dataset_name(dataset_name) {}
+
+    /// Destructor
+    ~HDF5Attribute() {}
+
+    /// Check for the existence of an attribute on a dataset
+    bool exists(const std::string attribute_name) const;
+
+    /// Set the value of a double attribute in the HDF5 file
+    void set(const std::string attribute_name, const double value);
+
+    /// Set the value of a double attribute in the HDF5 file
+    void set(const std::string attribute_name, const std::size_t value);
+
+    /// Set the value of an array of float attribute in the HDF5 file
+    void set(const std::string attribute_name,
+             const std::vector<double>& value);
+
+    /// Set the value of an array of float attribute in the HDF5 file
+    void set(const std::string attribute_name,
+             const std::vector<std::size_t>& value);
+
+    /// Set the value of a string attribute in the HDF5 file
+    void set(const std::string attribute_name, const std::string value);
+
+    /// Set the value of a double attribute in the HDF5 file
+    void get(const std::string attribute_name, double& value) const;
+
+    /// Get the value of a vector double attribute in the HDF5 file
+    void get(const std::string attribute_name,
+             std::vector<double>& value) const;
+
+    /// Set the value of a double attribute in the HDF5 file
+    void get(const std::string attribute_name, std::size_t& value) const;
+
+    /// Get the value of a vector double attribute in the HDF5 file
+    void get(const std::string attribute_name,
+             std::vector<std::size_t>& value) const;
+
+    /// Get the value of an attribute in the HDF5 file as a string
+    void get(const std::string attribute_name, std::string& value) const;
+
+    /// Get the value of the attribute in the HDF5 file
+    /// as a string representation
+    const std::string str(const std::string attribute_name) const;
+
+    /// Get the type of the attribute "string", "float", "int"
+    /// "vectorfloat", "vectorint" or "unsupported"
+    const std::string type_str(const std::string attribute_name) const;
+
+    /// Get the names of all the attributes on this dataset
+    const std::string str() const;
+
+  private:
+
+    const hid_t hdf5_file_id;
+    const std::string dataset_name;
+
+    // Set the value of an attribute in the HDF5 file
+    template <typename T>
+    void set_value(const std::string attribute_name, const T& value);
+
+    // Get the value of an attribute in the HDF5 file
+    template <typename T>
+    void get_value(const std::string attribute_name, T& value) const;
+
+    template <typename T>
+    const std::string
+      vector_to_string(const std::vector<T>& vector_value) const;
+
+  };
+}
+
+#endif
+#endif
diff --git a/dolfin/io/HDF5File.cpp b/dolfin/io/HDF5File.cpp
new file mode 100644
index 0000000..40d019e
--- /dev/null
+++ b/dolfin/io/HDF5File.cpp
@@ -0,0 +1,1386 @@
+// Copyright (C) 2012 Chris N Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2012
+
+#ifdef HAS_HDF5
+
+#include <cstdio>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <boost/filesystem.hpp>
+#include <boost/lexical_cast.hpp>
+#include <boost/assign.hpp>
+#include <boost/multi_array.hpp>
+#include <boost/unordered_map.hpp>
+
+#include <dolfin/common/constants.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/MeshValueCollection.h>
+#include <dolfin/mesh/Vertex.h>
+#include "HDF5Attribute.h"
+#include "HDF5Interface.h"
+#include "HDF5Utility.h"
+#include "HDF5File.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+HDF5File::HDF5File(MPI_Comm comm, const std::string filename,
+                   const std::string file_mode)
+  : hdf5_file_open(false), hdf5_file_id(0), _mpi_comm(comm)
+{
+  // HDF5 chunking
+  parameters.add("chunking", false);
+
+  // Create directory if required (create on rank 0)
+  if (MPI::rank(_mpi_comm) == 0)
+  {
+    const boost::filesystem::path path(filename);
+    if (path.has_parent_path()
+        && !boost::filesystem::is_directory(path.parent_path()))
+    {
+      boost::filesystem::create_directories(path.parent_path());
+      if (!boost::filesystem::is_directory(path.parent_path()))
+      {
+        dolfin_error("HDF5File.cpp",
+                     "open file",
+                     "Could not create directory \"%s\"",
+                     path.parent_path().string().c_str());
+      }
+    }
+  }
+
+  // Wait until directory has been created
+  MPI::barrier(_mpi_comm);
+
+  // Open HDF5 file
+  const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+  hdf5_file_id = HDF5Interface::open_file(_mpi_comm, filename, file_mode,
+                                          mpi_io);
+  hdf5_file_open = true;
+}
+//-----------------------------------------------------------------------------
+HDF5File::~HDF5File()
+{
+  close();
+}
+//-----------------------------------------------------------------------------
+void HDF5File::close()
+{
+  // Close HDF5 file
+  if (hdf5_file_open)
+    HDF5Interface::close_file(hdf5_file_id);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::flush()
+{
+  dolfin_assert(hdf5_file_open);
+  HDF5Interface::flush_file(hdf5_file_id);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const std::vector<Point>& points,
+                     const std::string dataset_name)
+{
+  dolfin_assert(points.size() > 0);
+  dolfin_assert(hdf5_file_open);
+
+  // Get number of points (global)
+  std::size_t num_points_global = MPI::sum(_mpi_comm, points.size());
+
+  // Data set name
+  const std::string coord_dataset =  dataset_name + "/coordinates";
+
+  // Pack data
+  const std::size_t n = points.size();
+  std::vector<double> x(3*n);
+  for (std::size_t i = 0; i< n; ++i)
+    for (std::size_t j = 0; j < 3; ++j)
+      x[3*i + j] = points[i][j];
+
+  // Write data to file
+  //  const bool chunking = parameters["chunking"];
+  std::vector<std::size_t> global_size(2);
+  global_size[0] = num_points_global;
+  global_size[1] = 3;
+
+  const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+  write_data(coord_dataset, x, global_size, mpi_io);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const std::vector<double>& values,
+                     const std::string dataset_name)
+{
+  std::vector<std::size_t> global_size(1, MPI::sum(_mpi_comm, values.size()));
+  const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+  write_data(dataset_name, values, global_size, mpi_io);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const GenericVector& x, const std::string dataset_name)
+{
+  dolfin_assert(x.size() > 0);
+  dolfin_assert(hdf5_file_open);
+
+  // Get all local data
+  std::vector<double> local_data;
+  x.get_local(local_data);
+
+  // Write data to file
+  std::pair<std::size_t, std::size_t> local_range = x.local_range();
+  const bool chunking = parameters["chunking"];
+  const std::vector<std::size_t> global_size(1, x.size());
+  const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+  HDF5Interface::write_dataset(hdf5_file_id, dataset_name, local_data,
+                               local_range, global_size, mpi_io, chunking);
+
+  // Add partitioning attribute to dataset
+  std::vector<std::size_t> partitions;
+  std::vector<std::size_t> local_range_first(1, local_range.first);
+  MPI::gather(_mpi_comm, local_range_first, partitions);
+  MPI::broadcast(_mpi_comm, partitions);
+
+  HDF5Interface::add_attribute(hdf5_file_id, dataset_name, "partition",
+                               partitions);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(GenericVector& x, const std::string dataset_name,
+                    const bool use_partition_from_file) const
+{
+  dolfin_assert(hdf5_file_open);
+
+  // Check for data set exists
+  if (!HDF5Interface::has_dataset(hdf5_file_id, dataset_name))
+    error("Data set with name \"%s\" does not exist", dataset_name.c_str());
+
+  // Get dataset rank
+  const std::size_t rank = HDF5Interface::dataset_rank(hdf5_file_id,
+                                                       dataset_name);
+  dolfin_assert(rank == 1);
+
+  // Get global dataset size
+  const std::vector<std::size_t> data_size
+      = HDF5Interface::get_dataset_size(hdf5_file_id, dataset_name);
+
+  // Check that rank is 1
+  dolfin_assert(data_size.size() == 1);
+
+  // Check input vector, and re-size if not already sized
+  if (x.empty())
+  {
+    // Intialize vector
+    if (use_partition_from_file)
+    {
+      // Get partition from file
+      std::vector<std::size_t> partitions;
+      HDF5Interface::get_attribute(hdf5_file_id, dataset_name, "partition",
+                                   partitions);
+
+      // Check that number of MPI processes matches partitioning
+      if (MPI::size(_mpi_comm) != partitions.size())
+      {
+        dolfin_error("HDF5File.cpp",
+                     "read vector from file",
+                     "Different number of processes used when writing. Cannot restore partitioning");
+      }
+
+      // Add global size at end of partition vectors
+      partitions.push_back(data_size[0]);
+
+      // Initialise vector
+      const std::size_t process_num = MPI::rank(_mpi_comm);
+      const std::pair<std::size_t, std::size_t>
+        local_range(partitions[process_num], partitions[process_num + 1]);
+      x.init(_mpi_comm, local_range);
+    }
+    else
+      x.init(_mpi_comm, data_size[0]);
+  }
+  else if (x.size() != data_size[0])
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read vector from file",
+                 "Size mis-match between vector in file and input vector");
+  }
+
+  // Get local range
+  const std::pair<std::size_t, std::size_t> local_range = x.local_range();
+
+  // Read data from file
+  std::vector<double> data;
+  HDF5Interface::read_dataset(hdf5_file_id, dataset_name, local_range, data);
+
+  // Set data
+  x.set_local(data);
+  x.apply("insert");
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const Mesh& mesh, const std::string name)
+{
+  write(mesh, mesh.topology().dim(), name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const Mesh& mesh, std::size_t cell_dim,
+                     const std::string name)
+{
+  Timer t0("HDF5: write mesh to file");
+
+  dolfin_assert(hdf5_file_open);
+
+  // ---------- Vertices (coordinates)
+  {
+    // Write vertex data to HDF5 file
+    const std::string coord_dataset =  name + "/coordinates";
+
+    // Copy coordinates and indices and remove off-process values
+    const std::size_t gdim = mesh.geometry().dim();
+    const std::vector<double> vertex_coords
+      = HDF5Utility::reorder_vertices_by_global_indices(mesh);
+
+    // Write coordinates out from each process
+    std::vector<std::size_t> global_size(2);
+    global_size[0] = MPI::sum(_mpi_comm, vertex_coords.size()/gdim);
+    global_size[1] = gdim;
+    dolfin_assert(global_size[0] == mesh.size_global(0));
+    const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+    write_data(coord_dataset, vertex_coords, global_size, mpi_io);
+  }
+
+  // ---------- Topology
+  {
+    std::vector<std::size_t> topological_data;
+    topological_data.reserve(mesh.num_entities(cell_dim)*(cell_dim + 1));
+
+    if (cell_dim == mesh.topology().dim() || MPI::size(_mpi_comm) == 1)
+    {
+      // Usual case, with cell output, and/or none shared with another
+      // process.
+      // Get/build topology data
+      for (MeshEntityIterator c(mesh, cell_dim); !c.end(); ++c)
+        for (VertexIterator v(*c); !v.end(); ++v)
+          topological_data.push_back(v->global_index());
+    }
+    else
+    {
+      // Drop duplicate topology for shared entities of less than mesh
+      // dimension
+
+      // If not already numbered, number entities of order cell_dim so
+      // we can get shared_entities
+      DistributedMeshTools::number_entities(mesh, cell_dim);
+
+      const std::size_t my_rank = MPI::rank(_mpi_comm);
+      const std::map<unsigned int, std::set<unsigned int> >& shared_entities
+        = mesh.topology().shared_entities(cell_dim);
+
+      for (MeshEntityIterator c(mesh, cell_dim); !c.end(); ++c)
+      {
+        std::map<unsigned int, std::set<unsigned int> >::const_iterator
+          sh = shared_entities.find(c->index());
+
+        // If unshared, or owned locally, append to topology
+        if (sh == shared_entities.end())
+        {
+          for (VertexIterator v(*c); !v.end(); ++v)
+            topological_data.push_back(v->global_index());
+        }
+        else
+        {
+          std::set<unsigned int>::const_iterator lowest_proc
+            = sh->second.begin();
+          if (*lowest_proc > my_rank)
+          {
+            for (VertexIterator v(*c); !v.end(); ++v)
+              topological_data.push_back(v->global_index());
+          }
+        }
+      }
+    }
+
+    // Write topology data
+    const std::string topology_dataset =  name + "/topology";
+    std::vector<std::size_t> global_size(2);
+    global_size[0] = MPI::sum(_mpi_comm,
+                              topological_data.size()/(cell_dim + 1));
+    global_size[1] = cell_dim + 1;
+    dolfin_assert(global_size[0] == mesh.size_global(cell_dim));
+    const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+    write_data(topology_dataset, topological_data, global_size, mpi_io);
+
+    // For cells, write the global cell index
+    if (cell_dim == mesh.topology().dim())
+    {
+      const std::string cell_index_dataset = name + "/cell_indices";
+      global_size.pop_back();
+      const std::vector<std::size_t>& cells =
+        mesh.topology().global_indices(mesh.topology().dim());
+      const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+      write_data(cell_index_dataset, cells, global_size, mpi_io);
+    }
+
+    // Add cell type attribute
+    HDF5Interface::add_attribute(hdf5_file_id, topology_dataset, "celltype",
+                    CellType::type2string((CellType::Type)cell_dim));
+
+    // Add partitioning attribute to dataset
+    std::vector<std::size_t> partitions;
+    const std::size_t topology_offset
+      = MPI::global_offset(_mpi_comm, topological_data.size()/(cell_dim + 1),
+                           true);
+
+    std::vector<std::size_t> topology_offset_tmp(1, topology_offset);
+    MPI::gather(_mpi_comm, topology_offset_tmp, partitions);
+    MPI::broadcast(_mpi_comm, partitions);
+    HDF5Interface::add_attribute(hdf5_file_id, topology_dataset,
+                                 "partition", partitions);
+  }
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const MeshFunction<std::size_t>& meshfunction,
+                     const std::string name)
+{
+  write_mesh_function(meshfunction, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(MeshFunction<std::size_t>& meshfunction,
+                    const std::string name) const
+{
+  read_mesh_function(meshfunction, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const MeshFunction<int>& meshfunction,
+                     const std::string name)
+{
+  write_mesh_function(meshfunction, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(MeshFunction<int>& meshfunction,
+                    const std::string name) const
+{
+  read_mesh_function(meshfunction, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const MeshFunction<double>& meshfunction,
+                     const std::string name)
+{
+  write_mesh_function(meshfunction, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(MeshFunction<double>& meshfunction,
+                    const std::string name) const
+{
+  read_mesh_function(meshfunction, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const MeshFunction<bool>& meshfunction,
+                     const std::string name)
+{
+  const Mesh& mesh = *meshfunction.mesh();
+  const std::size_t cell_dim = meshfunction.dim();
+
+  // HDF5 does not support a boolean type,
+  // so copy to int with values 1 and 0
+  MeshFunction<int> mf(mesh, cell_dim);
+  for (MeshEntityIterator cell(mesh, cell_dim); !cell.end(); ++cell)
+    mf[cell->index()] = (meshfunction[cell->index()] ? 1 : 0);
+
+  write_mesh_function(mf, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(MeshFunction<bool>& meshfunction,
+                    const std::string name) const
+{
+  const Mesh& mesh = *meshfunction.mesh();
+  const std::size_t cell_dim = meshfunction.dim();
+
+  // HDF5 does not support bool, so use int instead
+  MeshFunction<int> mf(mesh, cell_dim);
+  read_mesh_function(mf, name);
+
+  for (MeshEntityIterator cell(mesh, cell_dim); !cell.end(); ++cell)
+    meshfunction[cell->index()] = (mf[cell->index()] != 0);
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void HDF5File::read_mesh_function(MeshFunction<T>& meshfunction,
+                                  const std::string mesh_name) const
+{
+  const Mesh& mesh = *meshfunction.mesh();
+
+  dolfin_assert(hdf5_file_open);
+
+  const std::string topology_name = mesh_name + "/topology";
+
+  if (!HDF5Interface::has_dataset(hdf5_file_id, topology_name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read topology dataset",
+                 "Dataset \"%s\" not found", topology_name.c_str());
+  }
+
+  // Look for Coordinates dataset - but not used
+  const std::string coordinates_name = mesh_name + "/coordinates";
+  if (!HDF5Interface::has_dataset(hdf5_file_id, coordinates_name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read coordinates dataset",
+                 "Dataset \"%s\" not found", coordinates_name.c_str());
+  }
+
+  // Look for Values dataset
+  const std::string values_name = mesh_name + "/values";
+  if (!HDF5Interface::has_dataset(hdf5_file_id, values_name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read values dataset",
+                 "Dataset \"%s\" not found", values_name.c_str());
+  }
+
+  // --- Topology ---
+  // Discover size of topology dataset
+  const std::vector<std::size_t> topology_dim
+      = HDF5Interface::get_dataset_size(hdf5_file_id, topology_name);
+
+  // Some consistency checks
+
+  const std::size_t num_global_cells = topology_dim[0];
+  const std::size_t vert_per_cell = topology_dim[1];
+  const std::size_t cell_dim = vert_per_cell - 1;
+
+  // Initialise if called from MeshFunction constructor with filename
+  // argument
+  if (meshfunction.size() == 0)
+    meshfunction.init(cell_dim);
+
+  // Otherwise, pre-existing MeshFunction must have correct dimension
+  if (cell_dim != meshfunction.dim())
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read meshfunction topology",
+                 "Cell dimension mismatch");
+  }
+
+  // Ensure size_global(cell_dim) is set
+  DistributedMeshTools::number_entities(mesh, cell_dim);
+
+  if (num_global_cells != mesh.size_global(cell_dim))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read meshfunction topology",
+                 "Mesh dimension mismatch");
+  }
+
+  // Divide up cells ~equally between processes
+  const std::pair<std::size_t, std::size_t> cell_range
+    = MPI::local_range(_mpi_comm, num_global_cells);
+  const std::size_t num_read_cells = cell_range.second - cell_range.first;
+
+  // Read a block of cells
+  std::vector<std::size_t> topology_data;
+  topology_data.reserve(num_read_cells*vert_per_cell);
+  HDF5Interface::read_dataset(hdf5_file_id, topology_name, cell_range,
+                              topology_data);
+
+  boost::multi_array_ref<std::size_t, 2>
+    topology_array(topology_data.data(),
+                   boost::extents[num_read_cells][vert_per_cell]);
+
+  std::vector<T> value_data;
+  value_data.reserve(num_read_cells);
+  HDF5Interface::read_dataset(hdf5_file_id, values_name, cell_range,
+                              value_data);
+
+  // Now send the read data to each process on the basis of the first
+  // vertex of the entity, since we do not know the global_index
+  const std::size_t num_processes = MPI::size(_mpi_comm);
+  const std::size_t max_vertex = mesh.size_global(0);
+
+  std::vector<std::vector<std::size_t> > send_topology(num_processes);
+  std::vector<std::vector<T> > send_values(num_processes);
+  for (std::size_t i = 0; i < num_read_cells ; ++i)
+  {
+    std::vector<std::size_t> cell_topology(topology_array[i].begin(),
+                                           topology_array[i].end());
+    std::sort(cell_topology.begin(), cell_topology.end());
+
+    // Use first vertex to decide where to send this data
+    const std::size_t send_to_process
+      = MPI::index_owner(_mpi_comm, cell_topology.front(), max_vertex);
+
+    send_topology[send_to_process].insert(send_topology[send_to_process].end(),
+                                          cell_topology.begin(),
+                                          cell_topology.end());
+    send_values[send_to_process].push_back(value_data[i]);
+  }
+
+  std::vector<std::vector<std::size_t> > receive_topology(num_processes);
+  std::vector<std::vector<T> > receive_values(num_processes);
+  MPI::all_to_all(_mpi_comm, send_topology, receive_topology);
+  MPI::all_to_all(_mpi_comm, send_values, receive_values);
+
+  // Generate requests for data from remote processes, based on the
+  // first vertex of the MeshEntities which belong on this process
+  // Send our process number, and our local index, so it can come back
+  // directly to the right place
+  std::vector<std::vector<std::size_t> > send_requests(num_processes);
+  const std::size_t process_number = MPI::rank(_mpi_comm);
+  for (MeshEntityIterator cell(mesh, cell_dim); !cell.end(); ++cell)
+  {
+    std::vector<std::size_t> cell_topology;
+    for (VertexIterator v(*cell); !v.end(); ++v)
+    {
+      cell_topology.push_back(v->global_index());
+    }
+    std::sort(cell_topology.begin(), cell_topology.end());
+
+    // Use first vertex to decide where to send this request
+    std::size_t send_to_process = MPI::index_owner(_mpi_comm,
+                                                   cell_topology.front(),
+                                                   max_vertex);
+    // Map to this process and local index by appending to send data
+    cell_topology.push_back(cell->index());
+    cell_topology.push_back(process_number);
+    send_requests[send_to_process].insert(send_requests[send_to_process].end(),
+                                          cell_topology.begin(),
+                                          cell_topology.end());
+  }
+
+  std::vector<std::vector<std::size_t> > receive_requests(num_processes);
+  MPI::all_to_all(_mpi_comm, send_requests, receive_requests);
+
+  // At this point, the data with its associated vertices is in
+  // receive_values and receive_topology and the final destinations
+  // are stored in receive_requests as
+  // [vertices][index][process][vertices][index][process]...  Some
+  // data will have more than one destination
+
+  // Create a mapping from the topology vector to the desired data
+  typedef boost::unordered_map<std::vector<std::size_t>, T> VectorKeyMap;
+  VectorKeyMap cell_to_data;
+
+  for (std::size_t i = 0; i < receive_values.size(); ++i)
+  {
+    dolfin_assert(receive_values[i].size()*vert_per_cell
+                  == receive_topology[i].size());
+    std::vector<std::size_t>::iterator p = receive_topology[i].begin();
+    for (std::size_t j = 0; j < receive_values[i].size(); ++j)
+    {
+      const std::vector<std::size_t> cell(p, p + vert_per_cell);
+      cell_to_data[cell] = receive_values[i][j];
+      p += vert_per_cell;
+    }
+  }
+
+  // Clear vectors for reuse - now to send values and indices to final
+  // destination
+  send_topology = std::vector<std::vector<std::size_t> >(num_processes);
+  send_values = std::vector<std::vector<T> >(num_processes);
+
+  // Go through requests, which are stacked as [vertex, vertex, ...]
+  // [index] [proc] etc.  Use the vertices as the key for the map
+  // (above) to retrieve the data to send to proc
+  for (std::size_t i = 0; i < receive_requests.size(); ++i)
+  {
+    for (std::vector<std::size_t>::iterator p = receive_requests[i].begin();
+         p != receive_requests[i].end(); p += (vert_per_cell + 2))
+    {
+      const std::vector<std::size_t> cell(p, p + vert_per_cell);
+      const std::size_t remote_index = *(p + vert_per_cell);
+      const std::size_t send_to_proc = *(p + vert_per_cell + 1);
+
+      const typename VectorKeyMap::iterator find_cell = cell_to_data.find(cell);
+      dolfin_assert(find_cell != cell_to_data.end());
+      send_values[send_to_proc].push_back(find_cell->second);
+      send_topology[send_to_proc].push_back(remote_index);
+    }
+  }
+
+  MPI::all_to_all(_mpi_comm, send_topology, receive_topology);
+  MPI::all_to_all(_mpi_comm, send_values, receive_values);
+
+  // At this point, receive_topology should only list the local indices
+  // and received values should have the appropriate values for each
+  for (std::size_t i = 0; i < receive_values.size(); ++i)
+  {
+    dolfin_assert(receive_values[i].size() == receive_topology[i].size());
+    for (std::size_t j = 0; j < receive_values[i].size(); ++j)
+      meshfunction[receive_topology[i][j]] = receive_values[i][j];
+  }
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void HDF5File::write_mesh_function(const MeshFunction<T>& meshfunction,
+                                   const std::string name)
+{
+  if (meshfunction.size() == 0)
+  {
+    dolfin_error("HDF5File.cpp",
+                 "save empty MeshFunction",
+                 "No values in MeshFunction");
+  }
+
+  const Mesh& mesh = *meshfunction.mesh();
+  const std::size_t cell_dim = meshfunction.dim();
+
+  // Write a mesh for the MeshFunction - this will also globally
+  // number the entities if needed
+  write(mesh, cell_dim, name);
+
+  // Storage for output values
+  std::vector<T> data_values;
+
+  if (cell_dim == mesh.topology().dim() || MPI::size(_mpi_comm) == 1)
+  {
+    // No duplicates
+    data_values.assign(meshfunction.values(),
+                       meshfunction.values() + meshfunction.size());
+  }
+  else
+  {
+    data_values.reserve(mesh.size(cell_dim));
+
+    // Drop duplicate data
+    const std::size_t my_rank = MPI::rank(_mpi_comm);
+    const std::map<unsigned int, std::set<unsigned int> >& shared_entities
+      = mesh.topology().shared_entities(cell_dim);
+
+    for (std::size_t i = 0; i < meshfunction.size(); ++i)
+    {
+      std::map<unsigned int, std::set<unsigned int> >::const_iterator sh
+        = shared_entities.find(i);
+
+      // If unshared, or shared and locally owned, append to vector
+      if (sh == shared_entities.end())
+        data_values.push_back(meshfunction[i]);
+      else
+      {
+        std::set<unsigned int>::iterator lowest_proc = sh->second.begin();
+        if (*lowest_proc > my_rank)
+          data_values.push_back(meshfunction[i]);
+      }
+    }
+  }
+
+  // Write values to HDF5
+  std::vector<std::size_t> global_size(1, MPI::sum(_mpi_comm,
+                                                   data_values.size()));
+  const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+  write_data(name + "/values", data_values, global_size, mpi_io);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const Function& u,  const std::string name,
+                     double timestamp)
+{
+  if (!HDF5Interface::has_dataset(hdf5_file_id, name))
+  {
+    write(u, name);
+    std::vector<double> vectime(1, timestamp);
+    attributes(name).set("series", vectime);
+  }
+  else
+  {
+    HDF5Attribute attr = attributes(name);
+    if (!attr.exists("series"))
+    {
+      dolfin_error("HDF5File.cpp",
+                   "append to series",
+                   "Function dataset does not contain a 'series' attribute");
+    }
+
+    std::vector<double> vectime;
+    attr.get("series", vectime);
+
+    std::size_t nvec = vectime.size();
+    std::string vecname = name
+      + "/vector_" + boost::lexical_cast<std::string>(nvec);
+
+    vectime.push_back(timestamp);
+    attr.set("series", vectime);
+
+    write(*u.vector(), vecname);
+  }
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const Function& u, const std::string name)
+{
+  Timer t0("HDF5: write Function");
+
+  // Get mesh and dofmap
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *u.function_space()->mesh();
+
+  dolfin_assert(u.function_space()->dofmap());
+  const GenericDofMap& dofmap = *u.function_space()->dofmap();
+
+  // FIXME:
+  // Possibly sort cell_dofs into global cell order before writing?
+
+  // Save data in compressed format with an index to mark out
+  // the start of each row
+
+  std::vector<dolfin::la_index> cell_dofs;
+  std::vector<std::size_t> x_cell_dofs;
+  x_cell_dofs.reserve(mesh.num_cells());
+
+  for (std::size_t i = 0; i != mesh.num_cells(); ++i)
+  {
+    x_cell_dofs.push_back(cell_dofs.size());
+    const std::vector<dolfin::la_index>& cell_dofs_i = dofmap.cell_dofs(i);
+    cell_dofs.insert(cell_dofs.end(), cell_dofs_i.begin(), cell_dofs_i.end());
+  }
+
+  // Add offset to CSR index to be seamless in parallel
+  std::size_t offset = MPI::global_offset(_mpi_comm, cell_dofs.size(), true);
+  std::transform(x_cell_dofs.begin(),
+                 x_cell_dofs.end(),
+                 x_cell_dofs.begin(),
+                 std::bind2nd(std::plus<std::size_t>(), offset));
+
+  const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+
+  // Save DOFs on each cell
+  std::vector<std::size_t> global_size(1, MPI::sum(_mpi_comm,
+                                                   cell_dofs.size()));
+  write_data(name + "/cell_dofs", cell_dofs, global_size, mpi_io);
+  if (MPI::rank(_mpi_comm) == MPI::size(_mpi_comm) - 1)
+    x_cell_dofs.push_back(global_size[0]);
+  global_size[0] = mesh.size_global(mesh.topology().dim()) + 1;
+  write_data(name + "/x_cell_dofs", x_cell_dofs, global_size, mpi_io);
+
+  // Save cell ordering
+  const std::vector<std::size_t>& cells =
+    mesh.topology().global_indices(mesh.topology().dim());
+  global_size[0] = mesh.size_global(mesh.topology().dim());
+  write_data(name + "/cells", cells, global_size, mpi_io);
+
+  // Save vector
+  write(*u.vector(), name + "/vector");
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(Function& u, const std::string name)
+{
+  Timer t0("HDF5: read Function");
+
+  dolfin_assert(hdf5_file_open);
+
+  // FIXME: This routine is long and involves a lot of MPI, but it
+  // should work for the general case of reading a function that was
+  // written from a different number of processes.  Memory efficiency
+  // could be improved by limiting the scope of some of the temporary
+  // variables
+
+  std::string basename = name;
+  std::string vector_dataset_name = name + "/vector";
+
+  // Check that the name we have been given corresponds to a "group"
+  // If not, then maybe we have been given the vector dataset name
+  // directly, so the group name should be one level up.
+  if (!HDF5Interface::has_group(hdf5_file_id, basename))
+  {
+    basename = name.substr(0, name.rfind("/"));
+    vector_dataset_name = name;
+  }
+
+  const std::string cells_dataset_name = basename + "/cells";
+  const std::string cell_dofs_dataset_name = basename + "/cell_dofs";
+  const std::string x_cell_dofs_dataset_name = basename + "/x_cell_dofs";
+
+  // Check datasets exist
+  if (!HDF5Interface::has_group(hdf5_file_id, name))
+    error("Group with name \"%s\" does not exist", name.c_str());
+  if (!HDF5Interface::has_dataset(hdf5_file_id, cells_dataset_name))
+    error("Dataset with name \"%s\" does not exist",
+          cells_dataset_name.c_str());
+  if (!HDF5Interface::has_dataset(hdf5_file_id, cell_dofs_dataset_name))
+    error("Dataset with name \"%s\" does not exist",
+          cell_dofs_dataset_name.c_str());
+  if (!HDF5Interface::has_dataset(hdf5_file_id, x_cell_dofs_dataset_name))
+    error("Dataset with name \"%s\" does not exist",
+          x_cell_dofs_dataset_name.c_str());
+  if (!HDF5Interface::has_dataset(hdf5_file_id, vector_dataset_name))
+    error("Dataset with name \"%s\" does not exist",
+          vector_dataset_name.c_str());
+
+  // Get existing mesh and dofmap - these should be pre-existing
+  // and set up by user when defining the Function
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *u.function_space()->mesh();
+  dolfin_assert(u.function_space()->dofmap());
+  const GenericDofMap& dofmap = *u.function_space()->dofmap();
+
+  // Get dimension of dataset
+  const std::vector<std::size_t> dataset_size =
+    HDF5Interface::get_dataset_size(hdf5_file_id, cells_dataset_name);
+  const std::size_t num_global_cells = dataset_size[0];
+  if (mesh.size_global(mesh.topology().dim())
+     != num_global_cells)
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read Function from file",
+                 "Number of global cells does not match");
+  }
+
+  // Divide cells equally between processes
+  const std::pair<std::size_t, std::size_t> cell_range
+    = MPI::local_range(_mpi_comm, num_global_cells);
+
+  // Read cells
+  std::vector<std::size_t> input_cells;
+  HDF5Interface::read_dataset(hdf5_file_id, cells_dataset_name,
+                              cell_range, input_cells);
+
+  // Overlap reads of DOF indices, to get full range on each process
+  std::vector<std::size_t> x_cell_dofs;
+  HDF5Interface::read_dataset(hdf5_file_id, x_cell_dofs_dataset_name,
+                              std::make_pair(cell_range.first,
+                                             cell_range.second + 1),
+                              x_cell_dofs);
+
+  // Read cell-DOF maps
+  std::vector<dolfin::la_index> input_cell_dofs;
+  HDF5Interface::read_dataset(hdf5_file_id, cell_dofs_dataset_name,
+                              std::make_pair(x_cell_dofs.front(),
+                                             x_cell_dofs.back()),
+                              input_cell_dofs);
+
+  GenericVector& x = *u.vector();
+
+  const std::vector<std::size_t> vector_size =
+    HDF5Interface::get_dataset_size(hdf5_file_id, vector_dataset_name);
+  const std::size_t num_global_dofs = vector_size[0];
+  dolfin_assert(num_global_dofs == x.size(0));
+  const std::pair<dolfin::la_index, dolfin::la_index>
+    input_vector_range = MPI::local_range(_mpi_comm, vector_size[0]);
+
+  std::vector<double> input_values;
+  HDF5Interface::read_dataset(hdf5_file_id, vector_dataset_name,
+                              input_vector_range,
+                              input_values);
+
+  // Calculate one (global cell, local_dof_index) to associate
+  // with each item in the vector on this process
+
+  std::vector<std::size_t> global_cells;
+  std::vector<std::size_t> remote_local_dofi;
+
+  HDF5Utility::map_gdof_to_cell(_mpi_comm,
+                                input_cells, input_cell_dofs,
+                                x_cell_dofs, input_vector_range,
+                                global_cells, remote_local_dofi);
+
+  // At this point, each process has a set of data, and for
+  // each value, a global_cell and local_dof to send it to.
+  // However, it is not known which processes the cells
+  // are actually on.
+
+  // Find where the needed cells are held
+  std::vector<std::pair<std::size_t, std::size_t > >
+    cell_ownership = HDF5Utility::cell_owners(mesh, global_cells);
+
+  // Having found the cell location, the actual global_dof index
+  // held by that (cell, local_dof) is needed on the process
+  // which holds the data values
+  std::vector<dolfin::la_index> global_dof;
+  HDF5Utility::get_global_dof(_mpi_comm, cell_ownership,
+                              remote_local_dofi, input_vector_range, dofmap,
+                              global_dof);
+
+
+  const std::size_t num_processes = MPI::size(_mpi_comm);
+
+  // Shift to dividing things into the vector range of Function Vector
+  const std::pair<dolfin::la_index, dolfin::la_index>
+    vector_range = x.local_range();
+
+  std::vector<std::vector<double> > receive_values(num_processes);
+  std::vector<std::vector<dolfin::la_index> > receive_indices(num_processes);
+  {
+    std::vector<std::vector<double> > send_values(num_processes);
+    std::vector<std::vector<dolfin::la_index> > send_indices(num_processes);
+    const std::size_t
+      n_vector_vals = input_vector_range.second - input_vector_range.first;
+    std::vector<dolfin::la_index> all_vec_range;
+
+    std::vector<dolfin::la_index> vector_range_second(1, vector_range.second);
+    MPI::gather(_mpi_comm, vector_range_second, all_vec_range);
+    MPI::broadcast(_mpi_comm, all_vec_range);
+
+    for (std::size_t i = 0; i != n_vector_vals; ++i)
+    {
+      const std::size_t dest = std::upper_bound(all_vec_range.begin(),
+                                                all_vec_range.end(),
+                                                global_dof[i])
+                                              - all_vec_range.begin();
+      dolfin_assert(dest < num_processes);
+      dolfin_assert(i < input_values.size());
+      send_indices[dest].push_back(global_dof[i]);
+      send_values[dest].push_back(input_values[i]);
+    }
+
+    MPI::all_to_all(_mpi_comm, send_values, receive_values);
+    MPI::all_to_all(_mpi_comm, send_indices, receive_indices);
+  }
+
+  std::vector<double>
+    vector_values(vector_range.second - vector_range.first);
+
+  for (std::size_t i = 0; i != num_processes; ++i)
+  {
+    const std::vector<double>& rval = receive_values[i];
+    const std::vector<dolfin::la_index>& rindex = receive_indices[i];
+    dolfin_assert(rval.size() == rindex.size());
+    for (std::size_t j = 0; j != rindex.size(); ++j)
+    {
+      dolfin_assert(rindex[j] >= vector_range.first);
+      dolfin_assert(rindex[j] < vector_range.second);
+      vector_values[rindex[j] - vector_range.first]
+        = rval[j];
+    }
+  }
+
+  x.set_local(vector_values);
+  x.apply("insert");
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const MeshValueCollection<std::size_t>& mesh_values,
+                     const std::string name)
+{
+  write_mesh_value_collection(mesh_values, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(MeshValueCollection<std::size_t>& mesh_values,
+                    const std::string name) const
+{
+  read_mesh_value_collection(mesh_values, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const MeshValueCollection<double>& mesh_values,
+                     const std::string name)
+{
+  write_mesh_value_collection(mesh_values, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(MeshValueCollection<double>& mesh_values,
+                    const std::string name) const
+{
+  read_mesh_value_collection(mesh_values, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::write(const MeshValueCollection<bool>& mesh_values,
+                     const std::string name)
+{
+  // HDF5 does not implement bool, use int and copy
+
+  MeshValueCollection<int> mvc_int(mesh_values.mesh(), mesh_values.dim());
+  const std::map<std::pair<std::size_t, std::size_t>, bool>& values
+    = mesh_values.values();
+  for (std::map<std::pair<std::size_t, std::size_t>,
+                bool>::const_iterator mesh_value_it = values.begin();
+       mesh_value_it != values.end(); ++mesh_value_it)
+  {
+    mvc_int.set_value(mesh_value_it->first.first, mesh_value_it->first.second,
+                      mesh_value_it->second ? 1 : 0);
+  }
+
+  write_mesh_value_collection(mvc_int, name);
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(MeshValueCollection<bool>& mesh_values,
+                    const std::string name) const
+{
+  // HDF5 does not implement bool, use int and copy
+
+  MeshValueCollection<int> mvc_int(mesh_values.mesh(), mesh_values.dim());
+  read_mesh_value_collection(mvc_int, name);
+
+  const std::map<std::pair<std::size_t, std::size_t>, int>& values
+    = mvc_int.values();
+  for (std::map<std::pair<std::size_t, std::size_t>,
+                int>::const_iterator mesh_value_it = values.begin();
+      mesh_value_it != values.end(); ++mesh_value_it)
+  {
+    mesh_values.set_value(mesh_value_it->first.first,
+                          mesh_value_it->first.second,
+                          (mesh_value_it->second != 0));
+  }
+
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void HDF5File::write_mesh_value_collection(const MeshValueCollection<T>& mesh_values, const std::string name)
+{
+  const std::map<std::pair<std::size_t, std::size_t>, T>& values
+    = mesh_values.values();
+
+  const Mesh& mesh = *mesh_values.mesh();
+  const std::vector<std::size_t>& global_cell_index
+    = mesh.topology().global_indices(mesh.topology().dim());
+
+  std::vector<T> data_values;
+  std::vector<std::size_t> entities;
+  std::vector<std::size_t> cells;
+
+  for (typename std::map<std::pair<std::size_t, std::size_t>,
+         T>::const_iterator
+         p = values.begin(); p != values.end(); ++p)
+  {
+    cells.push_back(global_cell_index[p->first.first]);
+    entities.push_back(p->first.second);
+    data_values.push_back(p->second);
+  }
+
+  std::vector<std::size_t> global_size(1, MPI::sum(_mpi_comm,
+                                                   data_values.size()));
+  const bool mpi_io = MPI::size(_mpi_comm) > 1 ? true : false;
+  write_data(name + "/values", data_values, global_size, mpi_io);
+  write_data(name + "/entities", entities, global_size, mpi_io);
+  write_data(name + "/cells", cells, global_size, mpi_io);
+
+  HDF5Interface::add_attribute(hdf5_file_id, name, "dimension",
+                               mesh_values.dim());
+}
+//-----------------------------------------------------------------------------
+template <typename T>
+void HDF5File::read_mesh_value_collection(MeshValueCollection<T>& mesh_vc,
+                                          const std::string name) const
+{
+  dolfin_assert(hdf5_file_open);
+  mesh_vc.clear();
+  if (!HDF5Interface::has_group(hdf5_file_id, name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "open MeshValueCollection dataset",
+                 "Group \"%s\" not found in file", name.c_str());
+  }
+
+  std::size_t dim = 0;
+  HDF5Interface::get_attribute(hdf5_file_id, name, "dimension", dim);
+
+  const std::string values_name = name + "/values";
+  const std::string entities_name = name + "/entities";
+  const std::string cells_name = name + "/cells";
+
+  if (!HDF5Interface::has_dataset(hdf5_file_id, values_name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "open MeshValueCollection dataset",
+                 "Dataset \"%s\" not found in file", values_name.c_str());
+  }
+
+  if (!HDF5Interface::has_dataset(hdf5_file_id, entities_name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "open MeshValueCollection dataset",
+                 "Dataset \"%s\" not found in file", entities_name.c_str());
+  }
+
+  if (!HDF5Interface::has_dataset(hdf5_file_id, cells_name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "open MeshValueCollection dataset",
+                 "Dataset \"%s\" not found in file", cells_name.c_str());
+  }
+
+  // Check all datasets have the same size
+  const std::vector<std::size_t> values_dim
+      = HDF5Interface::get_dataset_size(hdf5_file_id, values_name);
+  const std::vector<std::size_t> entities_dim
+      = HDF5Interface::get_dataset_size(hdf5_file_id, entities_name);
+  const std::vector<std::size_t> cells_dim
+      = HDF5Interface::get_dataset_size(hdf5_file_id, cells_name);
+  dolfin_assert(values_dim[0] == entities_dim[0]);
+  dolfin_assert(values_dim[0] == cells_dim[0]);
+
+  // Check size of dataset. If small enough, just read on all processes...
+
+  // FIXME: optimise value
+  const std::size_t max_data_one = 1048576; // arbtirary 1M
+
+  if (values_dim[0] < max_data_one)
+  {
+    // read on all processes
+    const std::pair<std::size_t, std::size_t> range(0, values_dim[0]);
+    const std::size_t local_size = range.second - range.first;
+
+    std::vector<T> values_data;
+    values_data.reserve(local_size);
+    HDF5Interface::read_dataset(hdf5_file_id, values_name, range, values_data);
+    std::vector<std::size_t> entities_data;
+    entities_data.reserve(local_size);
+    HDF5Interface::read_dataset(hdf5_file_id, entities_name, range,
+                                entities_data);
+    std::vector<std::size_t> cells_data;
+    cells_data.reserve(local_size);
+    HDF5Interface::read_dataset(hdf5_file_id, cells_name, range, cells_data);
+
+    // Get global mapping to restore values
+    const Mesh& mesh = *mesh_vc.mesh();
+    const std::vector<std::size_t>& global_cell_index
+      = mesh.topology().global_indices(mesh.topology().dim());
+
+    // Reference to actual map of MeshValueCollection
+    std::map<std::pair<std::size_t, std::size_t>, T>& mvc_map
+      = mesh_vc.values();
+
+    // Find cells which are on this process
+    for (std::size_t i = 0; i < cells_data.size(); ++i)
+    {
+      const std::vector<std::size_t>::const_iterator lidx
+        = std::find(global_cell_index.begin(), global_cell_index.end(),
+                    cells_data[i]);
+      if (lidx != global_cell_index.end())
+      {
+        const std::size_t local_index = lidx - global_cell_index.begin();
+        mvc_map[std::make_pair(local_index, entities_data[i])]
+          = values_data[i];
+      }
+    }
+
+  }
+  else
+  {
+    const Mesh& mesh = *mesh_vc.mesh();
+
+    // Divide range between processes
+    const std::pair<std::size_t, std::size_t> data_range
+      = MPI::local_range(_mpi_comm, values_dim[0]);
+    const std::size_t local_size = data_range.second - data_range.first;
+
+    // Read local range of values, entities and cells
+    std::vector<T> values_data;
+    values_data.reserve(local_size);
+    HDF5Interface::read_dataset(hdf5_file_id, values_name, data_range,
+                                values_data);
+    std::vector<std::size_t> entities_data;
+    entities_data.reserve(local_size);
+    HDF5Interface::read_dataset(hdf5_file_id, entities_name, data_range,
+                                entities_data);
+    std::vector<std::size_t> cells_data;
+    cells_data.reserve(local_size);
+    HDF5Interface::read_dataset(hdf5_file_id, cells_name, data_range,
+                                cells_data);
+
+    std::vector<std::pair<std::size_t, std::size_t> > cell_ownership;
+    cell_ownership = HDF5Utility::cell_owners(mesh, cells_data);
+
+    const std::size_t num_processes = MPI::size(_mpi_comm);
+    std::vector<std::vector<std::size_t> > send_entities(num_processes);
+    std::vector<std::vector<std::size_t> > send_local(num_processes);
+    std::vector<std::vector<T> > send_values(num_processes);
+    for (std::size_t i = 0; i != cells_data.size(); ++i)
+    {
+      const std::size_t dest = cell_ownership[i].first;
+      send_local[dest].push_back(cell_ownership[i].second);
+      send_entities[dest].push_back(entities_data[i]);
+      send_values[dest].push_back(values_data[i]);
+    }
+
+    std::vector<std::vector<T> > recv_values(num_processes);
+    std::vector<std::vector<std::size_t> > recv_entities(num_processes);
+    std::vector<std::vector<std::size_t> > recv_local(num_processes);
+    MPI::all_to_all(_mpi_comm, send_entities, recv_entities);
+    MPI::all_to_all(_mpi_comm, send_local, recv_local);
+    MPI::all_to_all(_mpi_comm, send_values, recv_values);
+
+    // Reference to actual map of MeshValueCollection
+    std::map<std::pair<std::size_t, std::size_t>, T>& mvc_map
+      = mesh_vc.values();
+
+    for (std::size_t i = 0; i < num_processes; ++i)
+    {
+      const std::vector<std::size_t>& local_index = recv_local[i];
+      const std::vector<std::size_t>& local_entities = recv_entities[i];
+      const std::vector<T>& local_values = recv_values[i];
+      dolfin_assert(local_index.size() == local_entities.size());
+      dolfin_assert(local_index.size() == local_values.size());
+
+      for (std::size_t j = 0; j < local_index.size(); ++j)
+      {
+        mvc_map[std::make_pair(local_index[j], local_entities[j])]
+          = local_values[j];
+      }
+    }
+
+  }
+}
+//-----------------------------------------------------------------------------
+void HDF5File::read(Mesh& input_mesh, const std::string mesh_name,
+                    bool use_partition_from_file) const
+{
+  Timer t("HDF5: read mesh");
+
+  dolfin_assert(hdf5_file_open);
+
+  const std::string topology_name = mesh_name + "/topology";
+  if (!HDF5Interface::has_dataset(hdf5_file_id, topology_name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read topology dataset",
+                 "Dataset \"%s\" not found", topology_name.c_str());
+  }
+
+  const std::string coordinates_name = mesh_name + "/coordinates";
+  if (!HDF5Interface::has_dataset(hdf5_file_id, coordinates_name))
+  {
+    dolfin_error("HDF5File.cpp",
+                 "read coordinates dataset",
+                 "Dataset \"%s\" not found", coordinates_name.c_str());
+  }
+
+  // Structure to store local mesh
+  LocalMeshData mesh_data(_mpi_comm);
+  mesh_data.clear();
+
+  // --- Topology ---
+
+  // Discover size of topology dataset
+  std::vector<std::size_t> topology_dim
+      = HDF5Interface::get_dataset_size(hdf5_file_id, topology_name);
+
+  // Get total number of cells, as number of rows in topology dataset
+  const std::size_t num_global_cells = topology_dim[0];
+  mesh_data.num_global_cells = num_global_cells;
+
+  // Set vertices-per-cell from number of columns
+  const std::size_t num_vertices_per_cell = topology_dim[1];
+  mesh_data.num_vertices_per_cell = num_vertices_per_cell;
+  mesh_data.tdim = topology_dim[1] - 1;
+
+  // Get partition from file
+  std::vector<std::size_t> partitions;
+  HDF5Interface::get_attribute(hdf5_file_id, topology_name, "partition",
+                               partitions);
+
+  std::pair<std::size_t, std::size_t> cell_range;
+
+  // Check whether number of MPI processes matches partitioning, and
+  // restore if possible
+  if (MPI::size(_mpi_comm) == partitions.size())
+  {
+    partitions.push_back(num_global_cells);
+    const std::size_t proc = MPI::rank(_mpi_comm);
+    cell_range = std::make_pair(partitions[proc], partitions[proc + 1]);
+
+    // Restore partitioning if requested
+    if (use_partition_from_file)
+    {
+      mesh_data.cell_partition
+        = std::vector<std::size_t>(cell_range.second - cell_range.first, proc);
+    }
+  }
+  else
+  {
+    if (use_partition_from_file)
+      warning("Could not use partition from file: wrong size");
+    // Divide up cells ~equally between processes
+    cell_range = MPI::local_range(_mpi_comm, num_global_cells);
+  }
+
+  const std::size_t num_local_cells = cell_range.second - cell_range.first;
+
+  // Read a block of cells
+  std::vector<std::size_t> topology_data;
+  topology_data.reserve(num_local_cells*num_vertices_per_cell);
+  HDF5Interface::read_dataset(hdf5_file_id, topology_name, cell_range,
+                              topology_data);
+
+  // Look for cell indices in dataset, and use if available
+  mesh_data.global_cell_indices.reserve(num_local_cells);
+  const std::string cell_indices_name = mesh_name + "/cell_indices";
+  if (HDF5Interface::has_dataset(hdf5_file_id, cell_indices_name))
+  {
+    HDF5Interface::read_dataset(hdf5_file_id, cell_indices_name,
+                                cell_range, mesh_data.global_cell_indices);
+  }
+  else
+  {
+    for (std::size_t i = 0; i < num_local_cells; i++)
+      mesh_data.global_cell_indices.push_back(cell_range.first + i);
+  }
+
+  // Copy to boost::multi_array
+  mesh_data.cell_vertices.resize(boost::extents[num_local_cells][num_vertices_per_cell]);
+  std::copy(topology_data.begin(), topology_data.end(),
+            mesh_data.cell_vertices.data());
+
+  // --- Coordinates ---
+  // Get dimensions of coordinate dataset
+  std::vector<std::size_t> coords_dim
+    = HDF5Interface::get_dataset_size(hdf5_file_id, coordinates_name);
+  mesh_data.num_global_vertices = coords_dim[0];
+  mesh_data.gdim = coords_dim[1];
+
+  // Divide range into equal blocks for each process
+  const std::pair<std::size_t, std::size_t> vertex_range
+    = MPI::local_range(_mpi_comm, mesh_data.num_global_vertices);
+  const std::size_t num_local_vertices
+    = vertex_range.second - vertex_range.first;
+
+  // Read vertex data to temporary vector
+  std::vector<double> coordinates_data;
+  coordinates_data.reserve(num_local_vertices*mesh_data.gdim);
+  HDF5Interface::read_dataset(hdf5_file_id, coordinates_name, vertex_range,
+                              coordinates_data);
+
+  // Copy to boost::multi_array
+  mesh_data.vertex_coordinates.resize(boost::extents[num_local_vertices][mesh_data.gdim]);
+  std::copy(coordinates_data.begin(), coordinates_data.end(),
+            mesh_data.vertex_coordinates.data());
+
+  // Fill vertex indices with values - not used in build_distributed_mesh
+  mesh_data.vertex_indices.resize(num_local_vertices);
+  for (std::size_t i = 0; i < mesh_data.vertex_coordinates.size(); ++i)
+    mesh_data.vertex_indices[i] = vertex_range.first + i;
+
+  // Build distributed mesh
+
+  t.stop();
+
+  if (MPI::size(_mpi_comm) == 1)
+    HDF5Utility::build_local_mesh(input_mesh, mesh_data);
+  else
+    MeshPartitioning::build_distributed_mesh(input_mesh, mesh_data);
+}
+//-----------------------------------------------------------------------------
+bool HDF5File::has_dataset(const std::string dataset_name) const
+{
+  dolfin_assert(hdf5_file_open);
+  return HDF5Interface::has_dataset(hdf5_file_id, dataset_name);
+}
+//-----------------------------------------------------------------------------
+HDF5Attribute HDF5File::attributes(const std::string dataset_name)
+{
+  dolfin_assert(hdf5_file_open);
+  return HDF5Attribute(hdf5_file_id, dataset_name);
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/io/HDF5File.h b/dolfin/io/HDF5File.h
new file mode 100644
index 0000000..500f3c9
--- /dev/null
+++ b/dolfin/io/HDF5File.h
@@ -0,0 +1,233 @@
+// Copyright (C) 2012 Chris N. Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2012
+
+#ifndef __DOLFIN_HDF5FILE_H
+#define __DOLFIN_HDF5FILE_H
+
+#ifdef HAS_HDF5
+
+#include <string>
+#include <utility>
+#include <vector>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Variable.h>
+#include "HDF5Attribute.h"
+#include "HDF5Interface.h"
+
+namespace dolfin
+{
+
+  class Function;
+  class GenericVector;
+  class LocalMeshData;
+  class Mesh;
+  template<typename T> class MeshFunction;
+  template<typename T> class MeshValueCollection;
+  class HDF5Attribute;
+
+  class HDF5File : public Variable
+  {
+  public:
+
+    /// Constructor. file_mode should "a" (append), "w" (write) or "r"
+    /// (read).
+    HDF5File(MPI_Comm comm, const std::string filename,
+             const std::string file_mode);
+
+    /// Destructor
+    ~HDF5File();
+
+    /// Close file
+    void close();
+
+    /// Write points to file
+    void write(const std::vector<Point>& points, const std::string name);
+
+    /// Write simple vector of double to file
+    void write(const std::vector<double>& values, const std::string name);
+
+    /// Write Vector to file in a format suitable for re-reading
+    void write(const GenericVector& x, const std::string name);
+
+    /// Read vector from file and optionally re-use any partitioning
+    /// that is available in the file
+    void read(GenericVector& x, const std::string dataset_name,
+              const bool use_partition_from_file) const;
+
+    /// Write Mesh to file in a format suitable for re-reading
+    void write(const Mesh& mesh, const std::string name);
+
+    /// Write Mesh of given cell dimension to file in a format
+    /// suitable for re-reading
+    void write(const Mesh& mesh, const std::size_t cell_dim,
+               const std::string name);
+
+    /// Write Function to file in a format suitable for re-reading
+    void write(const Function& u, const std::string name);
+
+    /// Write Function to file with a timestamp
+    void write(const Function& u, const std::string name, double timestamp);
+
+    /// Read Function from file and distribute data according to
+    /// the Mesh and dofmap associated with the Function
+    void read(Function& u, const std::string name);
+
+    /// Read Mesh from file and optionally re-use any partition data
+    /// in the file
+    void read(Mesh& mesh, const std::string name,
+              bool use_partition_from_file) const;
+
+    /// Write MeshFunction to file in a format suitable for re-reading
+    void write(const MeshFunction<std::size_t>& meshfunction,
+               const std::string name);
+
+    /// Write MeshFunction to file in a format suitable for re-reading
+    void write(const MeshFunction<int>& meshfunction, const std::string name);
+
+    /// Write MeshFunction to file in a format suitable for re-reading
+    void write(const MeshFunction<double>& meshfunction,
+               const std::string name);
+
+    /// Write MeshFunction to file in a format suitable for re-reading
+    void write(const MeshFunction<bool>& meshfunction, const std::string name);
+
+    /// Read MeshFunction from file
+    void read(MeshFunction<std::size_t>& meshfunction,
+              const std::string name) const;
+
+    /// Read MeshFunction from file
+    void read(MeshFunction<int>& meshfunction, const std::string name) const;
+
+    /// Read MeshFunction from file
+    void read(MeshFunction<double>& meshfunction,
+              const std::string name) const;
+
+    /// Read MeshFunction from file
+    void read(MeshFunction<bool>& meshfunction, const std::string name) const;
+
+    /// Write MeshValueCollection to file
+    void write(const MeshValueCollection<std::size_t>& mesh_values,
+               const std::string name);
+
+    /// Write MeshValueCollection to file
+    void write(const MeshValueCollection<double>& mesh_values,
+               const std::string name);
+
+    /// Write MeshValueCollection to file
+    void write(const MeshValueCollection<bool>& mesh_values,
+               const std::string name);
+
+    /// Read MeshValueCollection from file
+    void read(MeshValueCollection<std::size_t>& mesh_values,
+              const std::string name) const;
+
+    /// Read MeshValueCollection from file
+    void read(MeshValueCollection<double>& mesh_values,
+              const std::string name) const;
+
+    /// Read MeshValueCollection from file
+    void read(MeshValueCollection<bool>& mesh_values,
+              const std::string name) const;
+
+    /// Check if dataset exists in HDF5 file
+    bool has_dataset(const std::string dataset_name) const;
+
+    // Get/set attributes of an existing dataset
+    HDF5Attribute attributes(const std::string dataset_name);
+
+    /// Flush buffered I/O to disk
+    void flush();
+
+  private:
+
+    // Friend
+    friend class XDMFFile;
+    friend class TimeSeriesHDF5;
+
+    // Write a MeshFunction to file
+    template <typename T>
+    void write_mesh_function(const MeshFunction<T>& meshfunction,
+                             const std::string name);
+
+    // Read a MeshFunction from file
+    template <typename T>
+    void read_mesh_function(MeshFunction<T>& meshfunction,
+                            const std::string name) const;
+
+    // Write a MeshValueCollection to file
+    template <typename T>
+    void write_mesh_value_collection(const MeshValueCollection<T>& mesh_values,
+                                     const std::string name);
+
+    // Read a MeshValueCollection from file
+    template <typename T>
+    void read_mesh_value_collection(MeshValueCollection<T>& mesh_values,
+                                    const std::string name) const;
+
+    // Write contiguous data to HDF5 data set. Data is flattened into
+    // a 1D array, e.g. [x0, y0, z0, x1, y1, z1] for a vector in 3D
+    template <typename T>
+    void write_data(const std::string dataset_name,
+                    const std::vector<T>& data,
+                    const std::vector<std::size_t> global_size,
+                    bool use_mpi_io);
+
+    // HDF5 file descriptor/handle
+    bool hdf5_file_open;
+    hid_t hdf5_file_id;
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+  };
+
+  //---------------------------------------------------------------------------
+  // Needs to go here, because of use in XDMFFile.cpp
+  template <typename T>
+  void HDF5File::write_data(const std::string dataset_name,
+                            const std::vector<T>& data,
+                            const std::vector<std::size_t> global_size,
+                            bool use_mpi_io)
+  {
+    dolfin_assert(hdf5_file_open);
+    dolfin_assert(global_size.size() > 0);
+
+    // Get number of 'items'
+    std::size_t num_local_items = 1;
+    for (std::size_t i = 1; i < global_size.size(); ++i)
+      num_local_items *= global_size[i];
+    num_local_items = data.size()/num_local_items;
+
+    // Compute offset
+    const std::size_t offset = MPI::global_offset(_mpi_comm, num_local_items,
+                                                  true);
+    std::pair<std::size_t, std::size_t> range(offset,
+                                              offset + num_local_items);
+
+    // Write data to HDF5 file
+    const bool chunking = parameters["chunking"];
+    HDF5Interface::write_dataset(hdf5_file_id, dataset_name, data,
+                                 range, global_size, use_mpi_io, chunking);
+  }
+  //---------------------------------------------------------------------------
+
+}
+
+#endif
+#endif
diff --git a/dolfin/io/HDF5Interface.cpp b/dolfin/io/HDF5Interface.cpp
new file mode 100644
index 0000000..fbe857a
--- /dev/null
+++ b/dolfin/io/HDF5Interface.cpp
@@ -0,0 +1,406 @@
+// Copyright (C) 2012 Chris N. Richardson and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring, 2012
+//
+// First Added: 2012-09-21
+// Last Changed: 2013-10-24
+
+#include <boost/filesystem.hpp>
+#include <boost/lexical_cast.hpp>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/log/log.h>
+#include "HDF5File.h"
+#include "HDF5Interface.h"
+
+#ifdef HAS_HDF5
+
+#define HDF5_FAIL -1
+#define HDF5_MAXSTRLEN 80
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+hid_t HDF5Interface::open_file(MPI_Comm mpi_comm, const std::string filename,
+                               const std::string mode,
+                               const bool use_mpi_io)
+{
+  // Set parallel access with communicator
+  const hid_t plist_id = H5Pcreate(H5P_FILE_ACCESS);
+  if (use_mpi_io)
+  {
+    #ifdef HAS_MPI
+    MPI_Info info;
+    MPI_Info_create(&info);
+    herr_t status = H5Pset_fapl_mpio(plist_id, mpi_comm, info);
+    dolfin_assert(status != HDF5_FAIL);
+    MPI_Info_free(&info);
+    #else
+    dolfin_error("HDF5Interface.cpp",
+                 "create HDF5 file",
+                 "Cannot use MPI-IO output if DOLFIN is not configured with MPI");
+    #endif
+  }
+
+  hid_t file_id = HDF5_FAIL;
+  if (mode == "w")
+  {
+    // Create file for write, (overwriting existing file, if present)
+    file_id = H5Fcreate(filename.c_str(), H5F_ACC_TRUNC, H5P_DEFAULT,
+                        plist_id);
+  }
+  else
+  {
+    // Check that file exists
+    if (!boost::filesystem::is_regular_file(filename))
+    {
+      dolfin_error("HDF5Interface.cpp",
+                   "open HDF5 file",
+                   "File does not exist");
+    }
+
+    if (mode == "a")
+    {
+      // Open file existing file for append
+      file_id = H5Fopen(filename.c_str(), H5F_ACC_RDWR, plist_id);
+    }
+    else if (mode == "r")
+      file_id = H5Fopen(filename.c_str(), H5F_ACC_RDONLY, plist_id);
+    else
+    {
+      dolfin_error("HDF5Interface.cpp",
+                   "open HDF5 file",
+                   "Unknown file mode \"%s\"", mode.c_str());
+    }
+
+  }
+  dolfin_assert(file_id != HDF5_FAIL);
+
+  // Release file-access template
+  herr_t status = H5Pclose(plist_id);
+  dolfin_assert(status != HDF5_FAIL);
+
+  return file_id;
+}
+//-----------------------------------------------------------------------------
+void HDF5Interface::close_file(const hid_t hdf5_file_handle)
+{
+  herr_t status = H5Fclose(hdf5_file_handle);
+  dolfin_assert(status != HDF5_FAIL);
+}
+//-----------------------------------------------------------------------------
+void HDF5Interface::flush_file(const hid_t hdf5_file_handle)
+{
+  herr_t status = H5Fflush(hdf5_file_handle, H5F_SCOPE_GLOBAL);
+  dolfin_assert(status != HDF5_FAIL);
+}
+//-----------------------------------------------------------------------------
+const std::string HDF5Interface::get_attribute_type(
+                  const hid_t hdf5_file_handle,
+                  const std::string dataset_name,
+                  const std::string attribute_name)
+{
+  herr_t status;
+
+  // Open dataset or group by name
+  const hid_t dset_id = H5Oopen(hdf5_file_handle, dataset_name.c_str(),
+                                H5P_DEFAULT);
+  dolfin_assert(dset_id != HDF5_FAIL);
+
+  // Open attribute by name and get its type
+  const hid_t attr_id = H5Aopen(dset_id, attribute_name.c_str(), H5P_DEFAULT);
+  dolfin_assert(attr_id != HDF5_FAIL);
+  const hid_t attr_type = H5Aget_type(attr_id);
+  dolfin_assert(attr_type != HDF5_FAIL);
+
+  // Determine type of attribute
+  const hid_t h5class = H5Tget_class(attr_type);
+
+  // Get size of space, will determine if it is a vector or not
+  const hid_t dataspace = H5Aget_space(attr_id);
+  dolfin_assert(dataspace != HDF5_FAIL);
+  hsize_t cur_size[10];
+  hsize_t max_size[10];
+  const int ndims = H5Sget_simple_extent_dims(dataspace, cur_size, max_size);
+
+  std::string attribute_type_description;
+
+  if (h5class == H5T_FLOAT && ndims == 0)
+    attribute_type_description = "float";
+  else if (h5class == H5T_INTEGER && ndims == 0)
+    attribute_type_description = "int";
+  else if (h5class == H5T_FLOAT)
+    attribute_type_description = "vectorfloat";
+  else if (h5class == H5T_INTEGER)
+    attribute_type_description = "vectorint";
+  else if (h5class == H5T_STRING)
+    attribute_type_description = "string";
+  else
+    attribute_type_description = "unsupported";
+
+  // Close attribute type
+  status = H5Tclose(attr_type);
+  dolfin_assert(status != HDF5_FAIL);
+
+  // Close attribute
+  status = H5Aclose(attr_id);
+  dolfin_assert(status != HDF5_FAIL);
+
+  // Close dataset or group
+  status = H5Oclose(dset_id);
+  dolfin_assert(status != HDF5_FAIL);
+
+  return attribute_type_description;
+}
+//-----------------------------------------------------------------------------
+void HDF5Interface::delete_attribute(const hid_t hdf5_file_handle,
+                                     const std::string dataset_name,
+                                     const std::string attribute_name)
+{
+  herr_t status;
+
+  // Open dataset or group by name
+  const hid_t dset_id = H5Oopen(hdf5_file_handle, dataset_name.c_str(),
+                                H5P_DEFAULT);
+  dolfin_assert(dset_id != HDF5_FAIL);
+
+  // Delete attribute by name
+  status = H5Adelete(dset_id, attribute_name.c_str());
+  dolfin_assert(status != HDF5_FAIL);
+
+  // Close dataset or group
+  status = H5Oclose(dset_id);
+  dolfin_assert(status != HDF5_FAIL);
+}
+//-----------------------------------------------------------------------------
+herr_t HDF5Interface::attribute_iteration_function(hid_t loc_id,
+                                                   const char* name,
+                                                   const H5A_info_t* info,
+                                                   void *str)
+{
+  std::vector<std::string>* s = (std::vector<std::string>*)str;
+  std::string attr_name(name);
+  s->push_back(name);
+  return 0;
+}
+//-----------------------------------------------------------------------------
+const std::vector<std::string>
+HDF5Interface::list_attributes(const hid_t hdf5_file_handle,
+                               const std::string dataset_name)
+{
+  // Open dataset or group by name
+  const hid_t dset_id = H5Oopen(hdf5_file_handle, dataset_name.c_str(),
+                                H5P_DEFAULT);
+  dolfin_assert(dset_id != HDF5_FAIL);
+
+  hsize_t n = 0;
+
+  std::vector<std::string> out_string;
+  herr_t status = H5Aiterate2(dset_id, H5_INDEX_NAME, H5_ITER_INC, &n,
+                              attribute_iteration_function,
+                              (void *)&out_string);
+  dolfin_assert(status != HDF5_FAIL);
+
+  return out_string;
+}
+//-----------------------------------------------------------------------------
+bool HDF5Interface::has_attribute(const hid_t hdf5_file_handle,
+                                  const std::string dataset_name,
+                                  const std::string attribute_name)
+{
+  herr_t status;
+  htri_t has_attr;
+
+  // Open dataset or group by name
+  const hid_t dset_id = H5Oopen(hdf5_file_handle, dataset_name.c_str(),
+                                H5P_DEFAULT);
+  dolfin_assert(dset_id != HDF5_FAIL);
+
+  // Check for attribute by name
+  has_attr = H5Aexists(dset_id, attribute_name.c_str());
+  dolfin_assert(has_attr != HDF5_FAIL);
+
+  // Close dataset or group
+  status = H5Oclose(dset_id);
+  dolfin_assert(status != HDF5_FAIL);
+
+  return (has_attr > 0);
+}
+//-----------------------------------------------------------------------------
+bool HDF5Interface::has_group(const hid_t hdf5_file_handle,
+                              const std::string group_name)
+{
+  hid_t lapl_id = H5Pcreate(H5P_LINK_ACCESS);
+  htri_t status = H5Lexists(hdf5_file_handle, group_name.c_str(), lapl_id);
+  dolfin_assert(status >= 0);
+  if(status==0)
+    return false;
+
+  H5O_info_t object_info;
+  H5Oget_info_by_name(hdf5_file_handle, group_name.c_str(), &object_info,
+                      lapl_id);
+
+  return (object_info.type == H5O_TYPE_GROUP);
+}
+//-----------------------------------------------------------------------------
+bool HDF5Interface::has_dataset(const hid_t hdf5_file_handle,
+                                const std::string dataset_name)
+{
+  hid_t lapl_id = H5Pcreate(H5P_LINK_ACCESS);
+  htri_t status = H5Lexists(hdf5_file_handle, dataset_name.c_str(), lapl_id);
+  dolfin_assert(status >= 0);
+  return status;
+}
+//-----------------------------------------------------------------------------
+void HDF5Interface::add_group(const hid_t hdf5_file_handle,
+                              const std::string group_name)
+{
+  std::string _group_name(group_name);
+
+  // Cannot create the root level group
+  if (_group_name.size() == 0 || _group_name == "/")
+    return;
+
+  // Prepend a slash if missing
+  if (_group_name[0] != '/')
+    _group_name = "/" + _group_name;
+
+  // Starting from the root level, check and create groups if needed
+  std::size_t pos = 0;
+  while (pos != std::string::npos)
+  {
+    pos++;
+    pos = _group_name.find('/', pos);
+    const std::string parent_name(_group_name, 0, pos);
+
+    if (!has_group(hdf5_file_handle, parent_name))
+    {
+      hid_t group_id_vis = H5Gcreate2(hdf5_file_handle, parent_name.c_str(),
+                                      H5P_DEFAULT, H5P_DEFAULT, H5P_DEFAULT);
+      dolfin_assert(group_id_vis != HDF5_FAIL);
+
+      herr_t status = H5Gclose(group_id_vis);
+      dolfin_assert(status != HDF5_FAIL);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+std::size_t HDF5Interface::dataset_rank(const hid_t hdf5_file_handle,
+                                        const std::string dataset_name)
+{
+  // Open dataset
+  const hid_t dset_id = H5Dopen2(hdf5_file_handle, dataset_name.c_str(),
+                                 H5P_DEFAULT);
+  dolfin_assert(dset_id != HDF5_FAIL);
+
+  // Get the dataspace of the dataset
+  const hid_t space = H5Dget_space(dset_id);
+  dolfin_assert(space != HDF5_FAIL);
+
+  // Get dataset rank
+  const int rank = H5Sget_simple_extent_ndims(space);
+  dolfin_assert(rank >= 0);
+
+  // Close dataspace and dataset
+  herr_t status = H5Sclose(space);
+  dolfin_assert(status != HDF5_FAIL);
+  status = H5Dclose(dset_id);
+  dolfin_assert(status != HDF5_FAIL);
+
+  return rank;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t>
+HDF5Interface::get_dataset_size(const hid_t hdf5_file_handle,
+                                const std::string dataset_name)
+{
+  // Open named dataset
+  const hid_t dset_id = H5Dopen2(hdf5_file_handle, dataset_name.c_str(),
+                                 H5P_DEFAULT);
+  dolfin_assert(dset_id != HDF5_FAIL);
+
+  // Get the dataspace of the dataset
+  const hid_t space = H5Dget_space(dset_id);
+  dolfin_assert(space != HDF5_FAIL);
+
+  // Get rank
+  const int rank = H5Sget_simple_extent_ndims(space);
+
+  // Allocate data
+  std::vector<hsize_t> size(rank);
+
+  // Get size in each dimension
+  const int ndims = H5Sget_simple_extent_dims(space, size.data(), NULL);
+  dolfin_assert(ndims == rank);
+
+  // Close dataspace and dataset
+  herr_t status = H5Sclose(space);
+  dolfin_assert(status != HDF5_FAIL);
+  status = H5Dclose(dset_id);
+  dolfin_assert(status != HDF5_FAIL);
+
+  return std::vector<std::size_t>(size.begin(), size.end());
+}
+//-----------------------------------------------------------------------------
+std::size_t HDF5Interface::num_datasets_in_group(const hid_t hdf5_file_handle,
+                                                 const std::string group_name)
+{
+  // Get group info by name
+  H5G_info_t group_info;
+  hid_t lapl_id = H5Pcreate(H5P_LINK_ACCESS);
+  herr_t status = H5Gget_info_by_name(hdf5_file_handle, group_name.c_str(),
+                                      &group_info, lapl_id);
+  dolfin_assert(status != HDF5_FAIL);
+  return group_info.nlinks;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::string>
+HDF5Interface::dataset_list(const hid_t hdf5_file_handle,
+                            const std::string group_name)
+{
+  // List all member datasets of a group by name
+  char namebuf[HDF5_MAXSTRLEN];
+
+  herr_t status;
+
+  // Open group by name group_name
+  hid_t group_id = H5Gopen2(hdf5_file_handle, group_name.c_str(), H5P_DEFAULT);
+  dolfin_assert(group_id != HDF5_FAIL);
+
+  // Count how many datasets in the group
+  hsize_t num_datasets;
+  status = H5Gget_num_objs(group_id, &num_datasets);
+  dolfin_assert(status != HDF5_FAIL);
+
+  // Iterate through group collecting all dataset names
+  std::vector<std::string> list_of_datasets;
+  for (hsize_t i = 0; i < num_datasets; i++)
+  {
+    H5Gget_objname_by_idx(group_id, i, namebuf, HDF5_MAXSTRLEN);
+    list_of_datasets.push_back(std::string(namebuf));
+  }
+
+  // Close group
+  status = H5Gclose(group_id);
+  dolfin_assert(status != HDF5_FAIL);
+
+  return list_of_datasets;
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/io/HDF5Interface.h b/dolfin/io/HDF5Interface.h
new file mode 100644
index 0000000..5455242
--- /dev/null
+++ b/dolfin/io/HDF5Interface.h
@@ -0,0 +1,616 @@
+// Copyright (C) 2012 Chris N. Richardson and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-21
+
+#ifndef __DOLFIN_HDF5_INTERFACE_H
+#define __DOLFIN_HDF5_INTERFACE_H
+
+#ifdef HAS_HDF5
+
+#include <vector>
+#include <string>
+
+// Note: dolfin/common/MPI.h is included before hdf5.h to avoid the
+// MPICH_IGNORE_CXX_SEEK issue
+#include <dolfin/common/MPI.h>
+#include <hdf5.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  class HDF5File;
+
+  /// This class wraps HDF5 function calls. HDF5 function calls should
+  /// only appear in a member function of this class and not elsewhere
+  /// in the library.
+
+  class HDF5Interface
+  {
+  #define HDF5_FAIL -1
+  public:
+
+    /// Open HDF5 and return file descriptor
+    static hid_t open_file(MPI_Comm mpi_comm, const std::string filename,
+                           const std::string mode, const bool use_mpi_io);
+
+    /// Close HDF5 file
+    static void close_file(const hid_t hdf5_file_handle);
+
+    /// Flush data to file to improve data integrity after
+    /// interruption
+    static void flush_file(const hid_t hdf5_file_handle);
+
+    /// Write data to existing HDF file as defined by range blocks on
+    /// each process
+    /// data: data to be written, flattened into 1D vector
+    /// range: the local range on this processor
+    /// global_size: the global multidimensional shape of the array
+    /// use_mpio: whether using MPI or not
+    /// use_chunking: whether using chunking or not
+    template <typename T>
+    static void write_dataset(const hid_t file_handle,
+                              const std::string dataset_name,
+                              const std::vector<T>& data,
+                              const std::pair<std::size_t, std::size_t> range,
+                              const std::vector<std::size_t> global_size,
+                              bool use_mpio, bool use_chunking);
+
+    /// Read data from a HDF5 dataset "dataset_name" as defined by
+    /// range blocks on each process range: the local range on this
+    /// processor data: a flattened 1D array of values
+    template <typename T>
+    static void read_dataset(const hid_t file_handle,
+                             const std::string dataset_name,
+                             const std::pair<std::size_t, std::size_t> range,
+                             std::vector<T>& data);
+
+    /// Check for existence of group in HDF5 file
+    static bool has_group(const hid_t hdf5_file_handle,
+                          const std::string group_name);
+
+    /// Check for existence of dataset in HDF5 file
+    static bool has_dataset(const hid_t hdf5_file_handle,
+                            const std::string dataset_name);
+
+    /// Add group to HDF5 file
+    static void add_group(const hid_t hdf5_file_handle,
+                          const std::string dataset_name);
+
+    /// Get dataset rank
+    static std::size_t dataset_rank(const hid_t hdf5_file_handle,
+                                    const std::string dataset_name);
+
+    /// Return number of data sets in a group
+    static std::size_t num_datasets_in_group(const hid_t hdf5_file_handle,
+                                             const std::string group_name);
+
+    /// Get dataset size (size of each dimension)
+    static std::vector<std::size_t>
+      get_dataset_size(const hid_t hdf5_file_handle,
+                       const std::string dataset_name);
+
+    /// Return list all datasets in named group of file
+    static std::vector<std::string> dataset_list(const hid_t hdf5_file_handle,
+                                                 const std::string group_name);
+
+    /// Get type of attribute
+    static const std::string
+      get_attribute_type(const hid_t hdf5_file_handle,
+                         const std::string dataset_name,
+                         const std::string attribute_name);
+
+    /// Get a named attribute of a dataset of known type
+    template <typename T>
+    static void get_attribute(const hid_t hdf5_file_handle,
+                              const std::string dataset_name,
+                              const std::string attribute_name,
+                              T& attribute_value);
+
+    /// Add attribute to dataset or group
+    template <typename T>
+    static void add_attribute(const hid_t hdf5_file_handle,
+                              const std::string dataset_name,
+                              const std::string attribute_name,
+                              const T& attribute_value);
+
+    /// Delete an attribute from a dataset or group
+    static void delete_attribute(const hid_t hdf5_file_handle,
+                                 const std::string dataset_name,
+                                 const std::string attribute_name);
+
+    /// Check if an attribute exists on a dataset or group
+    static bool has_attribute(const hid_t hdf5_file_handle,
+                              const std::string dataset_name,
+                              const std::string attribute_name);
+
+    // List attributes of dataset or group
+    static const std::vector<std::string>
+      list_attributes(const hid_t hdf5_file_handle,
+                      const std::string dataset_name);
+
+  private:
+
+    static herr_t attribute_iteration_function(hid_t loc_id,
+                                               const char* name,
+                                               const H5A_info_t* info,
+                                               void* str);
+
+    template <typename T>
+      static void add_attribute_value(const hid_t dset_id,
+                                      const std::string attribute_name,
+                                      const T& attribute_value);
+
+    template <typename T>
+      static void add_attribute_value(const hid_t dset_id,
+                                      const std::string attribute_name,
+                                      const std::vector<T>& attribute_value);
+
+    template <typename T>
+      static void get_attribute_value(const hid_t attr_type,
+                                      const hid_t attr_id,
+                                      T& attribute_value);
+
+    template <typename T>
+      static void get_attribute_value(const hid_t attr_type,
+                                      const hid_t attr_id,
+                                      std::vector<T>& attribute_value);
+
+    // Return HDF5 data type
+    template <typename T>
+      static hid_t hdf5_type()
+    {
+      dolfin_error("HDF5Interface.cpp",
+                   "get HDF5 primitive data type",
+                   "No specialised function for this data type");
+      return 0;
+    }
+
+  };
+
+  //---------------------------------------------------------------------------
+  template <> inline hid_t HDF5Interface::hdf5_type<double>()
+  { return H5T_NATIVE_DOUBLE; }
+  //---------------------------------------------------------------------------
+  template <> inline hid_t HDF5Interface::hdf5_type<int>()
+  { return H5T_NATIVE_INT; }
+  //---------------------------------------------------------------------------
+  template <> inline hid_t HDF5Interface::hdf5_type<std::size_t>()
+  {
+    if (sizeof(std::size_t) == sizeof(unsigned long))
+      return H5T_NATIVE_ULONG;
+    else if (sizeof(std::size_t) == sizeof(unsigned int))
+      return H5T_NATIVE_UINT;
+    else
+      dolfin_error("HDF5Interface.h",
+                   "determine size of std::size_t",
+                   "std::size_t is not the same size as long or int");
+    return 0;
+  }
+  //---------------------------------------------------------------------------
+  template <> inline hid_t HDF5Interface::hdf5_type<int64_t>()
+  { return H5T_NATIVE_INT64; }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  inline void
+    HDF5Interface::write_dataset(const hid_t file_handle,
+                                 const std::string dataset_name,
+                                 const std::vector<T>& data,
+                                 const std::pair<std::size_t,std::size_t> range,
+                                 const std::vector<std::size_t> global_size,
+                                 bool use_mpi_io, bool use_chunking)
+  {
+    // Data rank
+    const std::size_t rank = global_size.size();
+    dolfin_assert(rank != 0);
+
+    if (rank > 2)
+    {
+      dolfin_error("HDF5Interface.cpp",
+                   "write dataset to HDF5 file",
+                   "Only rank 1 and rank 2 datsset are supported");
+    }
+
+    // Get HDF5 data type
+    const hid_t h5type = hdf5_type<T>();
+
+    // Hyperslab selection parameters
+    std::vector<hsize_t> count(global_size.begin(), global_size.end());
+    count[0] = range.second - range.first;
+
+    // Data offsets
+    std::vector<hsize_t> offset(rank, 0);
+    offset[0] = range.first;
+
+    // Dataset dimensions
+    const std::vector<hsize_t> dimsf(global_size.begin(), global_size.end());
+
+    // Generic status report
+    herr_t status;
+
+    // Create a global data space
+    const hid_t filespace0 = H5Screate_simple(rank, dimsf.data(), NULL);
+    dolfin_assert(filespace0 != HDF5_FAIL);
+
+    // Set chunking parameters
+    hid_t chunking_properties;
+    if (use_chunking)
+    {
+      // Set chunk size and limit to 1kB min/1MB max
+      hsize_t chunk_size = dimsf[0]/2;
+      if (chunk_size > 1048576)
+        chunk_size = 1048576;
+      if (chunk_size < 1024)
+        chunk_size = 1024;
+
+      hsize_t chunk_dims[2] = {chunk_size, dimsf[1]};
+      chunking_properties = H5Pcreate(H5P_DATASET_CREATE);
+      H5Pset_chunk(chunking_properties, rank, chunk_dims);
+    }
+    else
+      chunking_properties = H5P_DEFAULT;
+
+    // Check that group exists and recursively create if required
+    const std::string group_name(dataset_name, 0, dataset_name.rfind('/'));
+    add_group(file_handle, group_name);
+
+    // Create global dataset (using dataset_name)
+    const hid_t dset_id = H5Dcreate2(file_handle, dataset_name.c_str(), h5type,
+                                     filespace0, H5P_DEFAULT,
+                                     chunking_properties, H5P_DEFAULT);
+    dolfin_assert(dset_id != HDF5_FAIL);
+
+    // Close global data space
+    status = H5Sclose(filespace0);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Create a local data space
+    const hid_t memspace = H5Screate_simple(rank, count.data(), NULL);
+    dolfin_assert(memspace != HDF5_FAIL);
+
+    // Create a file dataspace within the global space - a hyperslab
+    const hid_t filespace1 = H5Dget_space(dset_id);
+    status = H5Sselect_hyperslab(filespace1, H5S_SELECT_SET, offset.data(),
+                                 NULL, count.data(), NULL);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Set parallel access
+    const hid_t plist_id = H5Pcreate(H5P_DATASET_XFER);
+    if (use_mpi_io)
+    {
+      status = H5Pset_dxpl_mpio(plist_id, H5FD_MPIO_COLLECTIVE);
+      dolfin_assert(status != HDF5_FAIL);
+    }
+
+    // Write local dataset into selected hyperslab
+    status = H5Dwrite(dset_id, h5type, memspace, filespace1, plist_id,
+                      data.data());
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close dataset collectively
+    status = H5Dclose(dset_id);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close hyperslab
+    status = H5Sclose(filespace1);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close local dataset
+    status = H5Sclose(memspace);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Release file-access template
+    status = H5Pclose(plist_id);
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  inline void
+    HDF5Interface::read_dataset(const hid_t file_handle,
+                                const std::string dataset_name,
+                                const std::pair<std::size_t, std::size_t> range,
+                                std::vector<T>& data)
+  {
+    // Open the dataset
+    const hid_t dset_id = H5Dopen2(file_handle, dataset_name.c_str(),
+                                   H5P_DEFAULT);
+    dolfin_assert(dset_id != HDF5_FAIL);
+
+    // Open dataspace
+    const hid_t dataspace = H5Dget_space(dset_id);
+    dolfin_assert(dataspace != HDF5_FAIL);
+
+    // Get rank of data set
+    const int rank = H5Sget_simple_extent_ndims(dataspace);
+    dolfin_assert(rank >= 0);
+
+    if (rank > 2)
+      warning("HDF5Interface::read_dataset untested for rank > 2.");
+
+    // Allocate data for size of each dimension
+    std::vector<hsize_t> dimensions_size(rank);
+
+    // Get size in each dimension
+    const int ndims = H5Sget_simple_extent_dims(dataspace,
+                                                dimensions_size.data(), NULL);
+    dolfin_assert(ndims == rank);
+
+    // Hyperslab selection
+    std::vector<hsize_t> offset(rank, 0);
+    offset[0]= range.first;
+    std::vector<hsize_t> count(dimensions_size);
+    count[0] = range.second - range.first;
+
+    // Select a block in the dataset beginning at offset[], with
+    // size=count[]
+    herr_t status = H5Sselect_hyperslab(dataspace, H5S_SELECT_SET,
+                                        offset.data(), NULL, count.data(),
+                                        NULL);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Create a memory dataspace
+    const hid_t memspace = H5Screate_simple(rank, count.data(), NULL);
+    dolfin_assert (memspace != HDF5_FAIL);
+
+    // Resize local data to read into
+    std::size_t data_size = 1;
+    for (std::size_t i = 0; i < count.size(); ++i)
+      data_size *= count[i];
+    data.resize(data_size);
+
+    // Read data on each process
+    const int h5type = hdf5_type<T>();
+    status = H5Dread(dset_id, h5type, memspace, dataspace, H5P_DEFAULT,
+                     data.data());
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close dataspace
+    status = H5Sclose(dataspace);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close dataset
+    status = H5Dclose(dset_id);
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  inline void HDF5Interface::get_attribute(hid_t hdf5_file_handle,
+                                           const std::string dataset_name,
+                                           const std::string attribute_name,
+                                           T& attribute_value)
+  {
+    herr_t status;
+
+    // Open dataset or group by name
+    const hid_t dset_id = H5Oopen(hdf5_file_handle, dataset_name.c_str(),
+                                   H5P_DEFAULT);
+    dolfin_assert(dset_id != HDF5_FAIL);
+
+    // Open attribute by name and get its type
+    const hid_t attr_id = H5Aopen(dset_id, attribute_name.c_str(), H5P_DEFAULT);
+    dolfin_assert(attr_id != HDF5_FAIL);
+    const hid_t attr_type = H5Aget_type(attr_id);
+    dolfin_assert(attr_type != HDF5_FAIL);
+
+    // Specific code for each type of data template
+    get_attribute_value(attr_type, attr_id, attribute_value);
+
+    // Close attribute type
+    status = H5Tclose(attr_type);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close attribute
+    status = H5Aclose(attr_id);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close dataset or group
+    status = H5Oclose(dset_id);
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //--------------------------------------------------------------------------
+  template <typename T>
+  inline void HDF5Interface::add_attribute(const hid_t hdf5_file_handle,
+                                           const std::string dataset_name,
+                                           const std::string attribute_name,
+                                           const T& attribute_value)
+  {
+
+    // Open named dataset or group
+    hid_t dset_id = H5Oopen(hdf5_file_handle, dataset_name.c_str(),
+                            H5P_DEFAULT);
+    dolfin_assert(dset_id != HDF5_FAIL);
+
+    // Check if attribute already exists and delete if so
+    htri_t has_attr = H5Aexists(dset_id, attribute_name.c_str());
+    dolfin_assert(has_attr != HDF5_FAIL);
+    if (has_attr > 0)
+    {
+      herr_t status = H5Adelete(dset_id, attribute_name.c_str());
+      dolfin_assert(status != HDF5_FAIL);
+    }
+
+    // Add attribute of appropriate type
+    add_attribute_value(dset_id, attribute_name, attribute_value);
+
+    // Close dataset or group
+    herr_t status = H5Oclose(dset_id);
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //---------------------------------------------------------------------------
+  // Specialised member functions (must be inlined to avoid link errors)
+  //---------------------------------------------------------------------------
+
+  // Template for simple types (e.g. size_t, double, int etc.) and
+  // vectors of these
+  // Specialization below for string
+  template<typename T>
+  inline void
+    HDF5Interface::add_attribute_value(const hid_t dset_id,
+                                       const std::string attribute_name,
+                                       const T& attribute_value)
+  {
+    // Create a scalar dataspace
+    hid_t dataspace_id = H5Screate(H5S_SCALAR);
+    dolfin_assert(dataspace_id != HDF5_FAIL);
+
+    const hid_t h5type = hdf5_type<T>();
+
+    // Create attribute of type std::size_t
+    hid_t attribute_id = H5Acreate2(dset_id, attribute_name.c_str(),
+                                   h5type, dataspace_id,
+                                   H5P_DEFAULT, H5P_DEFAULT);
+    dolfin_assert(attribute_id != HDF5_FAIL);
+
+    // Write attribute to dataset
+    herr_t status = H5Awrite(attribute_id, h5type, &attribute_value);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close attribute
+    status = H5Aclose(attribute_id);
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  inline void HDF5Interface::add_attribute_value(const hid_t dset_id,
+                                        const std::string attribute_name,
+                                        const std::vector<T>& attribute_value)
+  {
+
+    const hid_t h5type = hdf5_type<T>();
+
+    // Create a vector dataspace
+    const hsize_t dimsf = attribute_value.size();
+    const hid_t dataspace_id = H5Screate_simple(1, &dimsf, NULL);
+    dolfin_assert(dataspace_id != HDF5_FAIL);
+
+    // Create an attribute of type size_t in the dataspace
+    const hid_t attribute_id = H5Acreate2(dset_id, attribute_name.c_str(),
+                                         h5type, dataspace_id,
+                                         H5P_DEFAULT, H5P_DEFAULT);
+    dolfin_assert(attribute_id != HDF5_FAIL);
+
+    // Write attribute to dataset
+    herr_t status = H5Awrite(attribute_id, h5type, &attribute_value[0]);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close attribute
+    status = H5Aclose(attribute_id);
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //---------------------------------------------------------------------------
+  template<>
+  inline void HDF5Interface::add_attribute_value(const hid_t dset_id,
+                                          const std::string attribute_name,
+                                          const std::string& attribute_value)
+  {
+    // Create a scalar dataspace
+    const hid_t dataspace_id = H5Screate(H5S_SCALAR);
+    dolfin_assert(dataspace_id != HDF5_FAIL);
+
+    // Copy basic string type from HDF5 types and set string length
+    const hid_t datatype_id = H5Tcopy(H5T_C_S1);
+    herr_t status = H5Tset_size(datatype_id, attribute_value.size());
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Create attribute in the dataspace with the given string
+    const hid_t attribute_id = H5Acreate2(dset_id, attribute_name.c_str(),
+                                          datatype_id, dataspace_id,
+                                          H5P_DEFAULT, H5P_DEFAULT);
+    dolfin_assert(attribute_id != HDF5_FAIL);
+
+    // Write attribute to dataset
+    status = H5Awrite(attribute_id, datatype_id, attribute_value.c_str());
+    dolfin_assert(status != HDF5_FAIL);
+
+    // Close attribute
+    status = H5Aclose(attribute_id);
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //--------------------------------------------------------------------------
+  template<typename T>
+  inline void HDF5Interface::get_attribute_value(const hid_t attr_type,
+                                                 const hid_t attr_id,
+                                                 T& attribute_value)
+  {
+    const hid_t h5type = hdf5_type<T>();
+
+    // FIXME: more complete check of type
+    dolfin_assert(H5Tget_class(attr_type) == H5Tget_class(h5type));
+
+    // Read value
+    herr_t status = H5Aread(attr_id, h5type, &attribute_value);
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+    inline void
+    HDF5Interface::get_attribute_value(const hid_t attr_type,
+                                       const hid_t attr_id,
+                                       std::vector<T>& attribute_value)
+  {
+    const hid_t h5type = hdf5_type<T>();
+
+    // FIXME: more complete check of type
+    dolfin_assert(H5Tget_class(attr_type) == H5Tget_class(h5type));
+
+    // get dimensions of attribute array, check it is one-dimensional
+    const hid_t dataspace = H5Aget_space(attr_id);
+    dolfin_assert(dataspace != HDF5_FAIL);
+
+    hsize_t cur_size[10];
+    hsize_t max_size[10];
+    const int ndims = H5Sget_simple_extent_dims(dataspace, cur_size, max_size);
+    dolfin_assert(ndims == 1);
+
+    attribute_value.resize(cur_size[0]);
+
+    // Read value to vector
+    herr_t status = H5Aread(attr_id, h5type, attribute_value.data());
+    dolfin_assert(status != HDF5_FAIL);
+  }
+  //---------------------------------------------------------------------------
+  template<>
+  inline void HDF5Interface::get_attribute_value(const hid_t attr_type,
+                                                 const hid_t attr_id,
+                                                 std::string& attribute_value)
+  {
+    // Check this attribute is a string
+    dolfin_assert(H5Tget_class(attr_type) == H5T_STRING);
+
+    // Copy string type from HDF5 types and set length accordingly
+    const hid_t memtype = H5Tcopy(H5T_C_S1);
+    const int string_length = H5Tget_size(attr_type) + 1;
+    herr_t status = H5Tset_size(memtype, string_length);
+    dolfin_assert(status != HDF5_FAIL);
+
+    // FIXME: messy
+    // Copy string value into temporary vector std::vector::data can
+    // be copied into (std::string::data cannot)
+    std::vector<char> attribute_data(string_length);
+    status = H5Aread(attr_id, memtype, attribute_data.data());
+    dolfin_assert(status != HDF5_FAIL);
+
+    attribute_value.assign(attribute_data.data());
+  }
+  //---------------------------------------------------------------------------
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/io/HDF5Utility.cpp b/dolfin/io/HDF5Utility.cpp
new file mode 100644
index 0000000..d14da25
--- /dev/null
+++ b/dolfin/io/HDF5Utility.cpp
@@ -0,0 +1,440 @@
+// Copyright (C) 2013 Chris N. Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2012
+//
+// First added:  2013-05-08
+// Last changed: 2014-02-06
+
+#ifdef HAS_HDF5
+
+#include <iostream>
+#include <boost/multi_array.hpp>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/Vertex.h>
+
+#include "HDF5Utility.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void HDF5Utility::map_gdof_to_cell(
+  const MPI_Comm mpi_comm,
+  const std::vector<std::size_t>& input_cells,
+  const std::vector<dolfin::la_index>& input_cell_dofs,
+  const std::vector<std::size_t>& x_cell_dofs,
+  const std::pair<dolfin::la_index, dolfin::la_index> vector_range,
+  std::vector<std::size_t>& global_cells,
+  std::vector<std::size_t>& remote_local_dofi)
+{
+  // Go through all locally held cells (as read from file)
+  // and make mapping from global DOF index back to the cell and local index.
+  // Some overwriting will occur if multiple cells refer to the same DOF
+
+  const std::size_t num_processes = MPI::size(mpi_comm);
+  std::vector<dolfin::la_index> all_vec_range;
+  std::vector<dolfin::la_index> vector_range_second(1, vector_range.second);
+  MPI::gather(mpi_comm, vector_range_second, all_vec_range);
+  MPI::broadcast(mpi_comm, all_vec_range);
+
+  std::map<dolfin::la_index,
+           std::pair<std::size_t, std::size_t> > dof_to_cell;
+  const std::size_t offset = x_cell_dofs[0];
+  for (std::size_t i = 0; i < x_cell_dofs.size() - 1; ++i)
+  {
+    for (std::size_t j = x_cell_dofs[i] ; j != x_cell_dofs[i + 1]; ++j)
+    {
+      const unsigned char local_dof_i = j - x_cell_dofs[i];
+      const dolfin::la_index global_dof = input_cell_dofs[j - offset];
+      dof_to_cell[global_dof] = std::make_pair(input_cells[i], local_dof_i);
+    }
+  }
+
+  // Transfer dof_to_cell map to processes which hold the
+  // vector data for that DOF
+  std::vector<std::vector<dolfin::la_index> > send_dofs(num_processes);
+  std::vector<std::vector<std::size_t> > send_cell_dofs(num_processes);
+  for (std::map<dolfin::la_index,
+        std::pair<std::size_t, std::size_t> >::const_iterator
+        p = dof_to_cell.begin(); p != dof_to_cell.end(); ++p)
+  {
+    const std::size_t dest = std::upper_bound(all_vec_range.begin(),
+                                              all_vec_range.end(),
+                                              p->first)
+                                            - all_vec_range.begin();
+    send_dofs[dest].push_back(p->first);
+    send_cell_dofs[dest].push_back(p->second.first);
+    send_cell_dofs[dest].push_back(p->second.second);
+  }
+
+  std::vector<std::vector<dolfin::la_index> > receive_dofs(num_processes);
+  std::vector<std::vector<std::size_t> > receive_cell_dofs(num_processes);
+  MPI::all_to_all(mpi_comm, send_dofs, receive_dofs);
+  MPI::all_to_all(mpi_comm, send_cell_dofs, receive_cell_dofs);
+
+  // Unpack associated cell and local_dofs into vector
+  // There may be some overwriting due to receiving an
+  // index for the same DOF from multiple cells on different processes
+
+  global_cells.resize(vector_range.second - vector_range.first);
+  remote_local_dofi.resize(vector_range.second - vector_range.first);
+  for (std::size_t i = 0; i < num_processes; ++i)
+  {
+    std::vector<dolfin::la_index>& rdofs = receive_dofs[i];
+    std::vector<std::size_t>& rcelldofs = receive_cell_dofs[i];
+    dolfin_assert(rcelldofs.size() == 2*rdofs.size());
+    for (std::size_t j = 0; j < rdofs.size(); ++j)
+    {
+      dolfin_assert(rdofs[j] >= vector_range.first);
+      dolfin_assert(rdofs[j] < vector_range.second);
+      global_cells[rdofs[j] - vector_range.first] = rcelldofs[2*j];
+      remote_local_dofi[rdofs[j] - vector_range.first] = rcelldofs[2*j + 1];
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void HDF5Utility::get_global_dof(
+  const MPI_Comm mpi_comm,
+  const std::vector<std::pair<std::size_t, std::size_t> >& cell_ownership,
+  const std::vector<std::size_t>& remote_local_dofi,
+  const std::pair<std::size_t, std::size_t> vector_range,
+  const GenericDofMap& dofmap,
+  std::vector<dolfin::la_index>& global_dof)
+{
+  const std::size_t num_processes = MPI::size(mpi_comm);
+  std::vector<std::vector<std::size_t> > send_cell_dofs(num_processes);
+  const std::size_t n_vector_vals = vector_range.second - vector_range.first;
+  global_dof.resize(n_vector_vals);
+
+  for (std::size_t i = 0; i != n_vector_vals; ++i)
+  {
+    const std::size_t dest = cell_ownership[i].first;
+    // Send local index (on remote) and cell local_dof index
+    send_cell_dofs[dest].push_back(cell_ownership[i].second);
+    send_cell_dofs[dest].push_back(remote_local_dofi[i]);
+  }
+
+  std::vector<std::vector<std::size_t> > receive_cell_dofs(num_processes);
+  MPI::all_to_all(mpi_comm, send_cell_dofs, receive_cell_dofs);
+
+  // Return back the global dof to the process the request came from
+  std::vector<std::vector<dolfin::la_index> >
+    send_global_dof_back(num_processes);
+  for (std::size_t i = 0; i < num_processes; ++i)
+  {
+    const std::vector<std::size_t>& rdof = receive_cell_dofs[i];
+    for (std::size_t j = 0; j < rdof.size(); j += 2)
+    {
+      const std::vector<dolfin::la_index>& dmap = dofmap.cell_dofs(rdof[j]);
+      dolfin_assert(rdof[j + 1] < dmap.size());
+      send_global_dof_back[i].push_back(dmap[rdof[j + 1]]);
+    }
+  }
+
+  std::vector<std::vector<dolfin::la_index> >
+    receive_global_dof_back(num_processes);
+  MPI::all_to_all(mpi_comm, send_global_dof_back, receive_global_dof_back);
+
+  // Go through the received data in the same order as when it was
+  // sent out as a request, pulling out the global_dof for each vector
+  // position
+
+  std::vector<std::size_t> pos(num_processes, 0);
+  for (std::size_t i = 0; i != n_vector_vals; ++i)
+  {
+    const std::size_t src = cell_ownership[i].first;
+    dolfin_assert(src < num_processes);
+    const std::vector<dolfin::la_index>& rgdof = receive_global_dof_back[src];
+    dolfin_assert(pos[src] < rgdof.size());
+    global_dof[i] = rgdof[pos[src]];
+    pos[src]++;
+  }
+
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::size_t, std::size_t> >
+HDF5Utility::cell_owners(const Mesh& mesh, const std::vector<std::size_t> cells)
+{
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  const std::size_t num_processes = MPI::size(mpi_comm);
+  const std::size_t num_global_cells
+    = mesh.size_global(mesh.topology().dim());
+  const std::pair<std::size_t, std::size_t> cell_range
+    = MPI::local_range(mpi_comm, num_global_cells);
+
+  // Find the ownership and local index for
+  // all cells in MPI::local_range(num_global_cells)
+  std::vector<std::pair<std::size_t, std::size_t> > cell_locations;
+  cell_owners_in_range(cell_locations, mesh);
+
+  // Requested cells (given in "cells" argument) are now known to be
+  // on the "matching" process given by MPI::index_owner
+  std::vector<std::vector<std::size_t> > receive_input_cells(num_processes);
+  {
+    std::vector<std::vector<std::size_t> > send_input_cells(num_processes);
+    for (std::vector<std::size_t>::const_iterator c = cells.begin();
+         c != cells.end(); ++c)
+    {
+      const std::size_t dest = MPI::index_owner(mpi_comm, *c, num_global_cells);
+      send_input_cells[dest].push_back(*c);
+    }
+    MPI::all_to_all(mpi_comm, send_input_cells, receive_input_cells);
+  }
+
+  // Reflect back to sending process with cell owner and local index
+  std::vector<std::vector<std::size_t> > send_cells(num_processes);
+  for (std::size_t i = 0; i != num_processes; ++i)
+  {
+    const std::vector<std::size_t>& rcells = receive_input_cells[i];
+    for (std::size_t j = 0; j < rcells.size(); ++j)
+    {
+      dolfin_assert(rcells[j] >= cell_range.first);
+      dolfin_assert(rcells[j] < cell_range.second);
+      std::pair<std::size_t, std::size_t>& loc
+        = cell_locations[rcells[j] - cell_range.first];
+      send_cells[i].push_back(loc.first);
+      send_cells[i].push_back(loc.second);
+    }
+  }
+
+  std::vector<std::vector<std::size_t> > receive_cells(num_processes);
+  MPI::all_to_all(mpi_comm, send_cells, receive_cells);
+
+  std::vector<std::pair<std::size_t, std::size_t> >
+    output_cell_locations(cells.size());
+
+  // Index to walk through data reflected back
+  std::vector<std::size_t> pos(num_processes, 0);
+  for (std::size_t i = 0; i < cells.size(); ++i)
+  {
+    const std::size_t src = MPI::index_owner(mpi_comm, cells[i],
+                                             num_global_cells);
+    const std::vector<std::size_t>& rcell = receive_cells[src];
+    dolfin_assert(pos[src] < rcell.size()/2);
+    output_cell_locations[i].first  = rcell[2*pos[src]];
+    output_cell_locations[i].second = rcell[2*pos[src] + 1];
+    pos[src]++;
+  }
+
+  return output_cell_locations;
+}
+//-----------------------------------------------------------------------------
+void HDF5Utility::cell_owners_in_range(std::vector<std::pair<std::size_t,
+                                       std::size_t> >& global_owner,
+                                       const Mesh& mesh)
+{
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  const std::size_t n_global_cells = mesh.size_global(mesh.topology().dim());
+  const std::size_t num_processes = MPI::size(mpi_comm);
+
+  // Communicate global ownership of cells to matching process
+  const std::pair<std::size_t, std::size_t> range
+    = MPI::local_range(mpi_comm, n_global_cells);
+  global_owner.resize(range.second - range.first);
+
+  std::vector<std::vector<std::size_t> > send_owned_global(num_processes);
+  for (CellIterator mesh_cell(mesh); !mesh_cell.end(); ++mesh_cell)
+  {
+    const std::size_t global_i = mesh_cell->global_index();
+    const std::size_t local_i = mesh_cell->index();
+    const std::size_t po_proc = MPI::index_owner(mpi_comm, global_i,
+                                                 n_global_cells);
+    send_owned_global[po_proc].push_back(global_i);
+    send_owned_global[po_proc].push_back(local_i);
+  }
+
+  std::vector<std::vector<std::size_t> > owned_global(num_processes);
+  MPI::all_to_all(mpi_comm, send_owned_global, owned_global);
+
+  std::size_t count = 0;
+  // Construct mapping from global_index(partial range held) to owning
+  // process and remote local_index
+  for (std::vector<std::vector<std::size_t> >::iterator owner
+         = owned_global.begin(); owner != owned_global.end(); ++owner)
+  {
+    for (std::vector<std::size_t>::iterator r = owner->begin();
+         r != owner->end(); r += 2)
+    {
+      const std::size_t proc = owner - owned_global.begin();
+      const std::size_t idx = *r - range.first;
+      global_owner[idx].first = proc;    // owning process
+      global_owner[idx].second = *(r+1); // local index on owning process
+      count++;
+    }
+  }
+
+  // All cells in range should be accounted for
+  dolfin_assert(count == range.second - range.first);
+}
+//-----------------------------------------------------------------------------
+void HDF5Utility::build_local_mesh(Mesh& mesh, const LocalMeshData& mesh_data)
+{
+  // NOTE: This function is only used when running in serial
+
+  // Create mesh for editing
+  MeshEditor editor;
+  dolfin_assert(mesh_data.tdim != 0);
+  std::string cell_type_str
+    = CellType::type2string((CellType::Type)mesh_data.tdim);
+  editor.open(mesh, cell_type_str, mesh_data.tdim, mesh_data.gdim);
+
+  // Iterate over vertices and add to mesh
+  editor.init_vertices_global(mesh_data.num_global_vertices,
+                              mesh_data.num_global_vertices);
+  for (std::size_t i = 0; i < mesh_data.num_global_vertices; ++i)
+  {
+    const std::size_t index = mesh_data.vertex_indices[i];
+    const std::vector<double> coords(mesh_data.vertex_coordinates[i].begin(),
+                                     mesh_data.vertex_coordinates[i].end());
+    Point p(mesh_data.gdim, coords.data());
+    editor.add_vertex(index, p);
+  }
+
+  // Iterate over cells and add to mesh
+  editor.init_cells_global(mesh_data.num_global_cells,
+                           mesh_data.num_global_cells);
+
+  for (std::size_t i = 0; i < mesh_data.num_global_cells; ++i)
+  {
+    const std::size_t index = mesh_data.global_cell_indices[i];
+    const std::vector<std::size_t> v(mesh_data.cell_vertices[i].begin(),
+                                     mesh_data.cell_vertices[i].end());
+    editor.add_cell(index, v);
+  }
+
+  // Close mesh editor
+  editor.close();
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+HDF5Utility::reorder_vertices_by_global_indices(const Mesh& mesh)
+{
+  std::size_t width = mesh.geometry().dim();
+  std::vector<double> ordered_coordinates(mesh.coordinates());
+  reorder_values_by_global_indices(mesh, ordered_coordinates, width);
+  return ordered_coordinates;
+}
+//---------------------------------------------------------------------------
+void HDF5Utility::reorder_values_by_global_indices(const Mesh& mesh,
+                                      std::vector<double>& data,
+                                      const std::size_t width)
+{
+  Timer t("HDF5: reorder vertex values");
+
+  dolfin_assert(mesh.num_vertices()*width == data.size());
+
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  // Get shared vertices
+  const std::map<unsigned int, std::set<unsigned int> >& shared_vertices
+    = mesh.topology().shared_entities(0);
+
+  // My process rank
+  const unsigned int my_rank = MPI::rank(mpi_comm);
+
+  // Number of processes
+  const unsigned int num_processes = MPI::size(mpi_comm);
+
+  // Build list of vertex data to send. Only send shared vertex if I'm the
+  // lowest rank process
+  std::vector<bool> vertex_sender(mesh.num_vertices(), true);
+  std::map<unsigned int, std::set<unsigned int> >::const_iterator it;
+  for (it = shared_vertices.begin(); it != shared_vertices.end(); ++it)
+  {
+    // Check if vertex is shared
+    if (!it->second.empty())
+    {
+      // Check if I am the lowest rank owner
+      const std::size_t sharing_min_rank
+        = *std::min_element(it->second.begin(), it->second.end());
+      if (my_rank > sharing_min_rank)
+        vertex_sender[it->first] = false;
+    }
+  }
+
+  // Global size
+  const std::size_t N = mesh.size_global(0);
+
+  // Process offset
+  const std::pair<std::size_t, std::size_t> local_range
+    = MPI::local_range(mpi_comm, N);
+  const std::size_t offset = local_range.first;
+
+  // Build buffer of indices and coords to send
+  std::vector<std::vector<std::size_t> > send_buffer_index(num_processes);
+  std::vector<std::vector<double> > send_buffer_values(num_processes);
+
+  // Reference to data to send, reorganised as a 2D boost::multi_array
+  boost::multi_array_ref<double, 2>
+    data_array(data.data(), boost::extents[mesh.num_vertices()][width]);
+
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    const std::size_t vidx = v->index();
+    if (vertex_sender[vidx])
+    {
+      std::size_t owner = MPI::index_owner(mpi_comm, v->global_index(), N);
+      send_buffer_index[owner].push_back(v->global_index());
+      send_buffer_values[owner].insert(send_buffer_values[owner].end(),
+                                       data_array[vidx].begin(),
+                                       data_array[vidx].end());
+    }
+  }
+
+  // Send/receive indices
+  std::vector<std::vector<std::size_t> > receive_buffer_index;
+  MPI::all_to_all(mpi_comm, send_buffer_index, receive_buffer_index);
+
+  // Send/receive coords
+  std::vector<std::vector<double> > receive_buffer_values;
+  MPI::all_to_all(mpi_comm, send_buffer_values, receive_buffer_values);
+
+  // Build vectors of ordered values
+  std::vector<double>
+    ordered_values(width*(local_range.second - local_range.first));
+  for (std::size_t p = 0; p < receive_buffer_index.size(); ++p)
+  {
+    for (std::size_t i = 0; i < receive_buffer_index[p].size(); ++i)
+    {
+      const std::size_t local_index = receive_buffer_index[p][i] - offset;
+      for (std::size_t j = 0; j < width; ++j)
+      {
+        ordered_values[local_index*width + j]
+          = receive_buffer_values[p][i*width + j];
+      }
+    }
+  }
+
+  data.assign(ordered_values.begin(), ordered_values.end());
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/io/HDF5Utility.h b/dolfin/io/HDF5Utility.h
new file mode 100644
index 0000000..dcec631
--- /dev/null
+++ b/dolfin/io/HDF5Utility.h
@@ -0,0 +1,103 @@
+// Copyright (C) 2013 Chris N. Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First added:  2013-05-07
+// Last changed: 2013-06-18
+
+#ifndef __DOLFIN_HDF5UTILITY_H
+#define __DOLFIN_HDF5UTILITY_H
+
+#ifdef HAS_HDF5
+
+#include <string>
+#include <vector>
+
+#include "dolfin/common/types.h"
+
+namespace dolfin
+{
+  class GenericDofMap;
+  class Mesh;
+
+  /// This class contains some algorithms which do not explicitly
+  /// depend on the HDF5 file format, mostly to do with reorganising
+  /// Mesh entities with MPI
+
+  class HDF5Utility
+  {
+  public:
+
+    /// Generate two vectors, in the range of "vector_range"
+    /// of the global DOFs.
+    /// global_cells is a list of cells which point to the DOF (non-unique)
+    /// and remote_local_dofi is the pertinent local_dof of the cell.
+    /// input_cells is a list of cells held on this process, and
+    /// input_cell_dofs/x_cell_dofs list their local_dofs.
+    static void
+      map_gdof_to_cell(const MPI_Comm mpi_comm,
+                       const std::vector<std::size_t>& input_cells,
+                       const std::vector<dolfin::la_index>& input_cell_dofs,
+                       const std::vector<std::size_t>& x_cell_dofs,
+                       const std::pair<dolfin::la_index, dolfin::la_index>
+                       vector_range,
+                       std::vector<std::size_t>& global_cells,
+                       std::vector<std::size_t>& remote_local_dofi);
+
+    /// Given the cell dof index specified
+    /// as (process, local_cell_index, local_cell_dof_index)
+    /// get the global_dof index from that location, and return it for all
+    /// DOFs in the range of "vector_range"
+    static void get_global_dof(const MPI_Comm mpi_comm,
+         const std::vector<std::pair<std::size_t, std::size_t> >& cell_ownership,
+         const std::vector<std::size_t>& remote_local_dofi,
+         const std::pair<std::size_t, std::size_t> vector_range,
+         const GenericDofMap& dofmap,
+         std::vector<dolfin::la_index>& global_dof);
+
+    /// Get cell owners for an arbitrary set of cells.
+    /// Returns (process, local index) pairs
+    static std::vector<std::pair<std::size_t, std::size_t> >
+      cell_owners(const Mesh&mesh, const std::vector<std::size_t> cells);
+
+    /// Get mapping of cells in the assigned global range of the
+    /// current process to remote process and remote local index.
+    static void cell_owners_in_range(std::vector<std::pair<std::size_t,
+                                     std::size_t> >& global_owner,
+                                     const Mesh& mesh);
+
+    /// Convert LocalMeshData structure to a Mesh, used when running
+    /// in serial
+    static void build_local_mesh(Mesh& mesh, const LocalMeshData& mesh_data);
+
+    /// Reorder vertices into global index order, so they can be saved
+    /// correctly for HDF5 mesh output
+    static std::vector<double>
+      reorder_vertices_by_global_indices(const Mesh& mesh);
+
+    /// Reorder data values of type double into global index order
+    /// Shape of 2D array is given in global_size
+    static void reorder_values_by_global_indices(const Mesh& mesh,
+                                                 std::vector<double>& data,
+                                                 std::size_t width);
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/io/RAWFile.cpp b/dolfin/io/RAWFile.cpp
new file mode 100644
index 0000000..a25f96a
--- /dev/null
+++ b/dolfin/io/RAWFile.cpp
@@ -0,0 +1,235 @@
+// Copyright (C) 2005-2007 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Nuno Lopes 2008
+// Modified by Martin Alnes 2008
+// Modified by Anders Logg 2011
+//
+// First added:  2008-05-29
+// Last changed: 2011-11-14
+
+#include <fstream>
+#include <sstream>
+#include <dolfin/common/Array.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/Vector.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/Cell.h>
+#include "RAWFile.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+RAWFile::RAWFile(const std::string filename) : GenericFile(filename, "RAW")
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+RAWFile::~RAWFile()
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+void RAWFile::operator<<(const MeshFunction<int>& meshfunction)
+{
+  MeshFunctionWrite(meshfunction);
+}
+//----------------------------------------------------------------------------
+void RAWFile::operator<<(const MeshFunction<double>& meshfunction)
+{
+  MeshFunctionWrite(meshfunction);
+}
+//----------------------------------------------------------------------------
+void RAWFile::operator<<(const Function& u)
+{
+  // Update raw file name and clear file
+  rawNameUpdate(counter);
+
+  // Write results
+  ResultsWrite(u);
+
+  // Increase the number of times we have saved the function
+  counter++;
+
+  cout << "Saved function " << u.name() << " (" << u.label()
+       << ") to file " << _filename << " in RAW format." << endl;
+}
+//----------------------------------------------------------------------------
+void RAWFile::ResultsWrite(const Function& u) const
+{
+  // Type of data (point or cell). Point by default.
+  std::string data_type = "point";
+
+  // For brevity
+  dolfin_assert(u.function_space());
+  const FunctionSpace& V = *u.function_space();
+  dolfin_assert(V.mesh());
+  dolfin_assert(V.dofmap());
+  const Mesh& mesh = *V.mesh();
+  const GenericDofMap& dofmap = *V.dofmap();
+
+  // Get rank of Function
+  dolfin_assert(V.element());
+  const std::size_t rank = V.element()->value_rank();
+  if (rank > 1)
+  {
+    dolfin_error("RAWFile.cpp",
+                 "write data to RAW file",
+                 "Only scalar and vectors functions can be saved in RAW format");
+  }
+
+  // Get number of components
+  std::size_t dim = 1;
+  for (std::size_t i = 0; i < rank; i++)
+    dim *= V.element()->value_dimension(i);
+
+  // Test for cell-based element type
+  std::size_t cell_based_dim = 1;
+  for (std::size_t i = 0; i < rank; i++)
+    cell_based_dim *= mesh.topology().dim();
+  if (dofmap.max_cell_dimension() == cell_based_dim)
+    data_type = "cell";
+
+  // Open file
+  std::ofstream fp(raw_filename.c_str(), std::ios_base::app);
+
+  // Write function data at mesh cells
+  if (data_type == "cell")
+  {
+    // Allocate memory for function values at cell centres
+    //const std::size_t size = mesh.num_cells()*dim;
+    std::vector<double> values;
+
+    // Get function values on cells
+    dolfin_assert(u.vector());
+    u.vector()->get_local(values);
+
+    // Write function data at cells
+    std::size_t num_cells = mesh.num_cells();
+    fp << num_cells << std::endl;
+
+    std::ostringstream ss;
+    ss << std::scientific;
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      // Write all components
+      ss.str("");
+      for (std::size_t i = 0; i < dim; i++)
+        ss  <<" "<< values[cell->index() + i*mesh.num_cells()];
+      ss << std::endl;
+      fp << ss.str();
+    }
+  }
+  else if (data_type == "point")
+  {
+    // Allocate memory for function values at vertices
+    //const std::size_t size = mesh.num_vertices()*dim;
+    std::vector<double> values;
+
+    // Get function values at vertices
+    u.compute_vertex_values(values, mesh);
+
+    // Write function data at mesh vertices
+    std::size_t num_vertices = mesh.num_vertices();
+    fp << num_vertices << std::endl;
+
+    std::ostringstream ss;
+    ss << std::scientific;
+    for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+    {
+      ss.str("");
+      for(std::size_t i = 0; i<dim; i++)
+        ss << " " << values[vertex->index() + i*mesh.num_cells()];
+
+      ss << std::endl;
+      fp << ss.str();
+    }
+  }
+  else
+  {
+   dolfin_error("RAWFile.cpp",
+                "write data to RAW file",
+                "Unknown data type");
+  }
+}
+//----------------------------------------------------------------------------
+void RAWFile::rawNameUpdate(const int counter)
+{
+  std::string filestart, extension;
+  std::ostringstream fileid, newfilename;
+
+  fileid.fill('0');
+  fileid.width(6);
+
+  filestart.assign(_filename, 0, _filename.find("."));
+  extension.assign(_filename, _filename.find("."), _filename.size());
+
+  fileid << counter;
+  newfilename << filestart << fileid.str() << ".raw";
+
+  raw_filename = newfilename.str();
+
+  // Make sure file is empty
+  std::ofstream file(raw_filename.c_str(), std::ios::trunc);
+  if (!file.is_open())
+  {
+    dolfin_error("RAWFile.cpp",
+                 "write data to RAW file",
+                 "Unable to open file \"%s\"", raw_filename.c_str());
+  }
+  file.close();
+}
+//----------------------------------------------------------------------------
+template<typename T>
+void RAWFile::MeshFunctionWrite(T& meshfunction)
+{
+  // Update raw file name and clear file
+  rawNameUpdate(counter);
+
+  const Mesh& mesh = *meshfunction.mesh();
+
+  if (meshfunction.dim() != mesh.topology().dim())
+  {
+    dolfin_error("RAWFile.cpp",
+                 "write mesh function to RAW file",
+                 "RAW output of mesh functions is implemenetd for cell-based functions only");
+  }
+
+  // Open file
+  std::ofstream fp(raw_filename.c_str(), std::ios_base::app);
+
+  fp << mesh.num_cells( ) << std::endl;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+    fp << meshfunction[cell->index()] << std::endl;
+
+  // Close file
+  fp.close();
+
+  // Increase the number of times we have saved the mesh function
+  counter++;
+
+  cout << "saved mesh function " << counter << " times." << endl;
+
+  cout << "Saved mesh function " << mesh.name() << " (" << mesh.label()
+       << ") to file " << _filename << " in RAW format." << endl;
+}
+//----------------------------------------------------------------------------
diff --git a/dolfin/io/RAWFile.h b/dolfin/io/RAWFile.h
new file mode 100644
index 0000000..13ac512
--- /dev/null
+++ b/dolfin/io/RAWFile.h
@@ -0,0 +1,61 @@
+// Copyright (C) 2005-2007 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Nuno Lopes 2008.
+//
+// First added:  2008-05-29
+
+
+#ifndef __RAW_FILE_H
+#define __RAW_FILE_H
+
+#include <fstream>
+#include "GenericFile.h"
+
+namespace dolfin
+{
+
+  class RAWFile : public GenericFile
+  {
+  public:
+
+    /// Write results in raw format
+
+    explicit RAWFile(const std::string filename);
+
+    ~RAWFile();
+
+    void operator<< (const MeshFunction<int>& meshfunction);
+    void operator<< (const MeshFunction<double>& meshfunction);
+    void operator<< (const Function& u);
+
+  private:
+
+    void ResultsWrite(const Function& u) const;
+    void rawNameUpdate(const int counter);
+
+    template<typename T>
+    void MeshFunctionWrite(T& meshfunction);
+
+    // raw filename
+    std::string raw_filename;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/SAX2AttributeParser.h b/dolfin/io/SAX2AttributeParser.h
new file mode 100644
index 0000000..d3f83ab
--- /dev/null
+++ b/dolfin/io/SAX2AttributeParser.h
@@ -0,0 +1,83 @@
+// Copyright (C) 2009 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2009-03-03
+// Last changed: 2011-11-14
+
+#ifndef __SAXHANDLER_H
+#define __SAXHANDLER_H
+
+#include <string>
+#include <boost/lexical_cast.hpp>
+#include <libxml/parser.h>
+
+namespace dolfin
+{
+
+  class GenericVector;
+  class Mesh;
+  class Parameters;
+
+  class SAX2AttributeParser
+  {
+  public:
+
+    template<typename T>
+    static T parse(const xmlChar* name, const xmlChar** attrs,
+			                 const char* attribute, std::size_t num_attributes)
+    {
+      // Check that we got the data
+      if (!attrs)
+      {
+        dolfin_error("SAX2AttributeParser.h",
+                     "parse XML file using SAX interface",
+                     "Missing attribute \"%s\" for <%s> in XML file",
+                     attribute, name);
+      }
+
+      // Parse data
+      for (std::size_t i = 0; i < num_attributes; i++)
+      {
+        // Check for attribute
+        if (xmlStrcasecmp(attrs[5*i], (xmlChar *) attribute) == 0)
+        {
+          if (!attrs[5*i + 3])
+          {
+            dolfin_error("SAX2AttributeParser.h",
+                         "value for attribute \"%s\" of <%s> missing in XML file",
+                         attribute, name);
+          }
+          std::string value(attrs[5*i + 3], attrs[5*i + 4]);
+          return boost::lexical_cast<T, std::string>(value);
+        }
+      }
+
+      // Didn't get the value
+      dolfin_error("SAX2AttributeParser.h",
+                   "value for attribute \"%s\" of <%s> missing in XML file",
+                   attribute, name);
+
+      return boost::lexical_cast<T, std::string>("0");
+    }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/SVGFile.cpp b/dolfin/io/SVGFile.cpp
new file mode 100644
index 0000000..de77c54
--- /dev/null
+++ b/dolfin/io/SVGFile.cpp
@@ -0,0 +1,128 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-12-01
+// Last changed: 2012-12-01
+
+#include <iostream>
+#include <fstream>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/log/log.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/Edge.h>
+#include "SVGFile.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+SVGFile::SVGFile(const std::string filename): GenericFile(filename, "SVG")
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+SVGFile::~SVGFile()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void SVGFile::operator<< (const Mesh& mesh)
+{
+  // Get file path and generate filename
+  std::string prefix;
+  prefix.assign(_filename, 0, _filename.find_last_of("."));
+  std::ostringstream _filename;
+  _filename << prefix;
+  if (MPI::size(mesh.mpi_comm()) > 1)
+    _filename << "_p" << MPI::rank(mesh.mpi_comm());
+  _filename << ".svg";
+
+  // Open file
+  std::ofstream fp(_filename.str().c_str(), std::ios_base::out);
+
+  // Get parameters
+  const double relative_line_width = parameters["relative_line_width"];
+
+  // Get dimensions
+  double xmin = std::numeric_limits<double>::max();
+  double xmax = std::numeric_limits<double>::min();
+  double ymin = std::numeric_limits<double>::max();
+  double ymax = std::numeric_limits<double>::min();
+  const std::size_t gdim = mesh.geometry().dim();
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    xmin = std::min(xmin, v->x(0));
+    xmax = std::max(xmax, v->x(0));
+    if (gdim > 1)
+    {
+      ymin = std::min(ymin, v->x(1));
+      ymax = std::max(ymax, v->x(1));
+    }
+  }
+  if (gdim == 1)
+  {
+    ymin = xmin;
+    ymax = xmax;
+  }
+
+  // Write header
+  fp << "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>" << std::endl;
+  fp << "<!-- Created with DOLFIN (http://fenicsproject.org/) -->" << std::endl;
+  fp << std::endl;
+  fp << "<svg"
+     << " x=\"" << xmin << "\""
+     << " y=\"" << ymin << "\""
+     << " width=\""  << (xmax - xmin) << "\""
+     << " height=\"" << (ymax - ymin) << "\""
+     << ">" << std::endl;
+  fp << "  <g id=\"layer1\">" << std::endl;
+
+  // Write edges of mesh
+  for (EdgeIterator e(mesh); !e.end(); ++e)
+  {
+    // Get the two vertex coordinates
+    Vertex v0(mesh, e->entities(0)[0]);
+    Vertex v1(mesh, e->entities(0)[1]);
+    double x0(v0.x(0));
+    double x1(v1.x(0));
+    double y0(0);
+    double y1(0);
+    if (gdim > 1)
+    {
+      y0 = v0.x(1);
+      y1 = v1.x(1);
+    }
+
+    // Write SVG data
+    fp << "    <path style=\"fill:none;stroke:#000000;stroke-width:"
+       << (relative_line_width*e->length())
+       << "px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1\""
+       << std::endl
+       << "          d=\"M "
+       << x0 << "," << y0 << " " << x1 << "," << y1 << "\""
+       << " id=\"edge" << e->index() << "\"/>" << std::endl;
+  }
+
+  // Write footer
+  fp << "  </g>" << std::endl;
+  fp << "</svg>" << std::endl;
+
+  // Close file
+  fp.close();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/SVGFile.h b/dolfin/io/SVGFile.h
new file mode 100644
index 0000000..d6704dd
--- /dev/null
+++ b/dolfin/io/SVGFile.h
@@ -0,0 +1,49 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-12-01
+// Last changed: 2012-12-01
+
+#ifndef __SVG_FILE_H
+#define __SVG_FILE_H
+
+#include "GenericFile.h"
+
+namespace dolfin
+{
+
+  /// This class implements output of meshes to scalable vector
+  /// graphics format (SVG).
+
+  class SVGFile : public GenericFile
+  {
+  public:
+
+    /// Constructor
+    explicit SVGFile(const std::string filename);
+
+    /// Destructor
+    ~SVGFile();
+
+    /// Store mesh to file
+    void operator<< (const Mesh& mesh);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/VTKFile.cpp b/dolfin/io/VTKFile.cpp
new file mode 100644
index 0000000..846d4f7
--- /dev/null
+++ b/dolfin/io/VTKFile.cpp
@@ -0,0 +1,779 @@
+// Copyright (C) 2005-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2005-2011
+// Modified by Kristian Oelgaard 2006
+// Modified by Martin Alnes 2008
+// Modified by Niclas Jansson 2009
+// Modified by Johannes Ring 2012
+//
+// First added:  2005-07-05
+// Last changed: 2013-03-11
+
+#include <ostream>
+#include <sstream>
+#include <vector>
+#include <iomanip>
+#include <boost/cstdint.hpp>
+#include <boost/detail/endian.hpp>
+
+#include "pugixml.hpp"
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/Vertex.h>
+#include "Encoder.h"
+#include "VTKWriter.h"
+#include "VTKFile.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+VTKFile::VTKFile(const std::string filename, std::string encoding)
+  : GenericFile(filename, "VTK"),
+    _encoding(encoding), binary(false), compress(false)
+{
+  if (encoding != "ascii" && encoding != "base64" && encoding != "compressed")
+  {
+    dolfin_error("VTKFile.cpp",
+                 "create VTK file",
+                 "Unknown encoding (\"%s\"). "
+                 "Known encodings are \"ascii\", \"base64\" and \"compressed\"",
+                 encoding.c_str());
+  }
+
+  if (encoding == "ascii")
+  {
+    encode_string = "ascii";
+    binary = false;
+  }
+  else if (encoding == "base64" || encoding == "compressed")
+  {
+    encode_string = "binary";
+    binary = true;
+    if (encoding == "compressed")
+      compress = true;
+  }
+  else
+  {
+    dolfin_error("VTKFile.cpp",
+                 "create VTK file",
+                 "Unknown encoding (\"%s\"). "
+                 "Known encodings are \"ascii\", \"base64\" and \"compressed\"",
+                 encoding.c_str());
+  }
+}
+//----------------------------------------------------------------------------
+VTKFile::~VTKFile()
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const Mesh& mesh)
+{
+  write_mesh(mesh, counter);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const MeshFunction<bool>& meshfunction)
+{
+  mesh_function_write(meshfunction, counter);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const MeshFunction<std::size_t>& meshfunction)
+{
+  mesh_function_write(meshfunction, counter);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const MeshFunction<int>& meshfunction)
+{
+  mesh_function_write(meshfunction, counter);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const MeshFunction<double>& meshfunction)
+{
+  mesh_function_write(meshfunction, counter);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const Function& u)
+{
+  write_function(u, counter);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const std::pair<const Mesh*, double> mesh)
+{
+  dolfin_assert(mesh.first);
+  write_mesh(*(mesh.first), mesh.second);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const std::pair<const MeshFunction<int>*, double> f)
+{
+  dolfin_assert(f.first);
+  mesh_function_write(*(f.first), f.second);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const std::pair<const MeshFunction<std::size_t>*,
+                                         double> f)
+{
+  dolfin_assert(f.first);
+  mesh_function_write(*(f.first), f.second);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const std::pair<const MeshFunction<double>*, double> f)
+{
+  dolfin_assert(f.first);
+  mesh_function_write(*(f.first), f.second);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const std::pair<const MeshFunction<bool>*, double> f)
+{
+  dolfin_assert(f.first);
+  mesh_function_write(*(f.first), f.second);
+}
+//----------------------------------------------------------------------------
+void VTKFile::operator<<(const std::pair<const Function*, double> u)
+{
+  dolfin_assert(u.first);
+  write_function(*(u.first), u.second);
+}
+//----------------------------------------------------------------------------
+void VTKFile::write_function(const Function& u, double time)
+{
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *u.function_space()->mesh();
+
+  // Get MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  // Get vtu file name and intialise
+  std::string vtu_filename = init(mesh, mesh.topology().dim());
+
+  // Write mesh
+  VTKWriter::write_mesh(mesh, mesh.topology().dim(), vtu_filename, binary,
+                        compress);
+
+  // Write results
+  results_write(u, vtu_filename);
+
+  // Parallel-specfic files
+  const std::size_t num_processes = MPI::size(mpi_comm);
+  if (num_processes > 1 && MPI::rank(mpi_comm) == 0)
+  {
+    std::string pvtu_filename = vtu_name(0, 0, counter, ".pvtu");
+    pvtu_write(u, pvtu_filename);
+    pvd_file_write(counter, time, pvtu_filename);
+  }
+  else if (num_processes == 1)
+    pvd_file_write(counter, time, vtu_filename);
+
+  // Finalise and write pvd files
+  finalize(vtu_filename, time);
+
+  log(TRACE, "Saved function %s (%s) to file %s in VTK format.",
+      u.name().c_str(), u.label().c_str(), _filename.c_str());
+}
+//----------------------------------------------------------------------------
+void VTKFile::write_mesh(const Mesh& mesh, double time)
+{
+  Timer t("Write mesh to PVD/VTK file");
+
+  // Get MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  // Get vtu file name and intialise out files
+  std::string vtu_filename = init(mesh, mesh.topology().dim());
+
+  // Write local mesh to vtu file
+  VTKWriter::write_mesh(mesh, mesh.topology().dim(), vtu_filename, binary,
+                        compress);
+
+  // Parallel-specific files
+  const std::size_t num_processes = MPI::size(mpi_comm);
+  if (num_processes > 1 && MPI::rank(mpi_comm) == 0)
+  {
+    std::string pvtu_filename = vtu_name(0, 0, counter, ".pvtu");
+    pvtu_write_mesh(pvtu_filename, num_processes);
+    pvd_file_write(counter, time, pvtu_filename);
+  }
+  else if (num_processes == 1)
+    pvd_file_write(counter, time, vtu_filename);
+
+  // Finalise
+  finalize(vtu_filename, time);
+
+  log(TRACE, "Saved mesh %s (%s) to file %s in VTK format.",
+      mesh.name().c_str(), mesh.label().c_str(), _filename.c_str());
+}
+//----------------------------------------------------------------------------
+std::string VTKFile::init(const Mesh& mesh, std::size_t cell_dim) const
+{
+  // Get MPI communicators
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  // Get vtu file name and clear file
+  std::string vtu_filename = vtu_name(MPI::rank(mpi_comm),
+                                      MPI::size(mpi_comm),
+                                      counter, ".vtu");
+  clear_file(vtu_filename);
+
+  // Number of cells
+  const std::size_t num_cells = mesh.topology().size(cell_dim);
+
+  // Write headers
+  vtk_header_open(mesh.num_vertices(), num_cells, vtu_filename);
+
+  return vtu_filename;
+}
+//----------------------------------------------------------------------------
+void VTKFile::finalize(std::string vtu_filename, double time)
+{
+  // Close headers
+  vtk_header_close(vtu_filename);
+
+  // Increase the number of times we have saved the object
+  counter++;
+}
+//----------------------------------------------------------------------------
+void VTKFile::results_write(const Function& u, std::string vtu_filename) const
+{
+  // Get rank of Function
+  const std::size_t rank = u.value_rank();
+  if (rank > 2)
+  {
+    dolfin_error("VTKFile.cpp",
+                 "write data to VTK file",
+                 "Only scalar, vector and tensor functions can be saved in VTK format");
+  }
+
+  // Get number of components
+  const std::size_t dim = u.value_size();
+
+  // Check that function type can be handled
+  if (rank == 1)
+  {
+    if (!(dim == 2 || dim == 3))
+    {
+      dolfin_error("VTKFile.cpp",
+                   "write data to VTK file",
+                   "Don't know how to handle vector function with dimension other than 2 or 3");
+    }
+  }
+  else if (rank == 2)
+  {
+    if (!(dim == 4 || dim == 9))
+    {
+      dolfin_error("VTKFile.cpp",
+                   "write data to VTK file",
+                   "Don't know how to handle tensor function with dimension other than 4 or 9");
+    }
+  }
+
+  // Test for cell-based element type
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *u.function_space()->mesh();
+  std::size_t cell_based_dim = 1;
+  for (std::size_t i = 0; i < rank; i++)
+    cell_based_dim *= mesh.topology().dim();
+
+  dolfin_assert(u.function_space()->dofmap());
+  const GenericDofMap& dofmap= *u.function_space()->dofmap();
+  if (dofmap.max_cell_dimension() == cell_based_dim)
+    VTKWriter::write_cell_data(u, vtu_filename, binary, compress);
+  else
+    write_point_data(u, mesh, vtu_filename);
+}
+//----------------------------------------------------------------------------
+void VTKFile::write_point_data(const GenericFunction& u, const Mesh& mesh,
+                               std::string vtu_filename) const
+{
+  const std::size_t rank = u.value_rank();
+  const std::size_t num_vertices = mesh.num_vertices();
+
+  // Get number of components
+  const std::size_t dim = u.value_size();
+
+  // Open file
+  std::ofstream fp(vtu_filename.c_str(), std::ios_base::app);
+  fp.precision(16);
+
+  // Allocate memory for function values at vertices
+  const std::size_t size = num_vertices*dim;
+  std::vector<double> values(size);
+
+  // Get function values at vertices and zero any small values
+  u.compute_vertex_values(values, mesh);
+  dolfin_assert(values.size() == size);
+  std::vector<double>::iterator it;
+  for (it = values.begin(); it != values.end(); ++it)
+  {
+    if (std::abs(*it) < DOLFIN_EPS)
+      *it = 0.0;
+  }
+
+  if (rank == 0)
+  {
+    fp << "<PointData  Scalars=\"" << u.name() << "\"> " << std::endl;
+    fp << "<DataArray  type=\"Float64\"  Name=\"" << u.name() << "\"  format=\""<< encode_string <<"\">";
+  }
+  else if (rank == 1)
+  {
+    fp << "<PointData  Vectors=\"" << u.name() << "\"> " << std::endl;
+    fp << "<DataArray  type=\"Float64\"  Name=\"" << u.name() << "\"  NumberOfComponents=\"3\" format=\""<< encode_string <<"\">";
+  }
+  else if (rank == 2)
+  {
+    fp << "<PointData  Tensors=\"" << u.name() << "\"> " << std::endl;
+    fp << "<DataArray  type=\"Float64\"  Name=\"" << u.name() << "\"  NumberOfComponents=\"9\" format=\""<< encode_string <<"\">";
+  }
+
+  if (_encoding == "ascii")
+  {
+    std::ostringstream ss;
+    ss << std::scientific;
+    ss << std::setprecision(16);
+    for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+    {
+      if (rank == 1 && dim == 2)
+      {
+        // Append 0.0 to 2D vectors to make them 3D
+        for(std::size_t i = 0; i < 2; i++)
+          ss << values[vertex->index() + i*num_vertices] << " ";
+        ss << 0.0 << "  ";
+      }
+      else if (rank == 2 && dim == 4)
+      {
+        // Pad 2D tensors with 0.0 to make them 3D
+        for(std::size_t i = 0; i < 2; i++)
+        {
+          ss << values[vertex->index() + (2*i + 0)*num_vertices] << " ";
+          ss << values[vertex->index() + (2*i + 1)*num_vertices] << " ";
+          ss << 0.0 << " ";
+        }
+        ss << 0.0 << " ";
+        ss << 0.0 << " ";
+        ss << 0.0 << "  ";
+      }
+      else
+      {
+        // Write all components
+        for(std::size_t i = 0; i < dim; i++)
+          ss << values[vertex->index() + i*num_vertices] << " ";
+        ss << " ";
+      }
+    }
+
+    // Send to file
+    fp << ss.str();
+  }
+  else if (_encoding == "base64" || _encoding == "compressed")
+  {
+    // Number of zero paddings per point
+    std::size_t padding_per_point = 0;
+    if (rank == 1 && dim == 2)
+      padding_per_point = 1;
+    else if (rank == 2 && dim == 4)
+      padding_per_point = 5;
+
+    // Number of data entries per point and total number
+    const std::size_t num_data_per_point = dim + padding_per_point;
+    const std::size_t num_total_data_points = num_vertices*num_data_per_point;
+
+    std::vector<double> data(num_total_data_points, 0);
+    for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+    {
+      const std::size_t index = vertex->index();
+      for(std::size_t i = 0; i < dim; i++)
+        data[index*num_data_per_point + i] = values[index + i*num_vertices];
+    }
+
+    // Create encoded stream
+    fp << VTKWriter::encode_stream(data, compress) << std::endl;
+  }
+
+  fp << "</DataArray> " << std::endl;
+  fp << "</PointData> " << std::endl;
+}
+//----------------------------------------------------------------------------
+void VTKFile::pvd_file_write(std::size_t step, double time,
+                             std::string fname)
+{
+  pugi::xml_document xml_doc;
+  if (step == 0)
+  {
+    pugi::xml_node vtk_node = xml_doc.append_child("VTKFile");
+    vtk_node.append_attribute("type") = "Collection";
+    vtk_node.append_attribute("version") = "0.1";
+    vtk_node.append_child("Collection");
+  }
+  else
+  {
+    pugi::xml_parse_result result = xml_doc.load_file(_filename.c_str());
+    if (!result)
+    {
+      dolfin_error("VTKFile.cpp",
+                   "write data to VTK file",
+                   "XML parsing error when reading from existing file");
+    }
+  }
+
+  // Remove directory path from name for pvd file
+  const std::string fname_strip = strip_path(fname);
+
+  // Get Collection node
+  pugi::xml_node xml_collections = xml_doc.child("VTKFile").child("Collection");
+  dolfin_assert(xml_collections);
+
+  // Append data set
+  pugi::xml_node dataset_node = xml_collections.append_child("DataSet");
+  dataset_node.append_attribute("timestep") = time;
+  dataset_node.append_attribute("part") = "0";
+  dataset_node.append_attribute("file") = fname_strip.c_str();
+
+  // Save file
+  xml_doc.save_file(_filename.c_str(), "  ");
+}
+//----------------------------------------------------------------------------
+void VTKFile::pvtu_write_mesh(pugi::xml_node xml_node) const
+{
+  // Vertex data
+  pugi::xml_node vertex_data_node = xml_node.append_child("PPoints");
+  pugi::xml_node data_node = vertex_data_node.append_child("PDataArray");
+  data_node.append_attribute("type") = "Float64";
+  data_node.append_attribute("NumberOfComponents") = "3";
+
+  // Cell data
+  pugi::xml_node cell_data_node = xml_node.append_child("PCellData");
+
+  data_node = cell_data_node.append_child("PDataArray");
+  data_node.append_attribute("type") = "UInt32";
+  data_node.append_attribute("Name") = "connectivity";
+
+  data_node = cell_data_node.append_child("PDataArray");
+  data_node.append_attribute("type") = "UInt32";
+  data_node.append_attribute("Name") = "offsets";
+
+  data_node = cell_data_node.append_child("PDataArray");
+  data_node.append_attribute("type") = "UInt8";
+  data_node.append_attribute("Name") = "types";
+}
+//----------------------------------------------------------------------------
+void VTKFile::pvtu_write_function(std::size_t dim, std::size_t rank,
+                                  const std::string data_location,
+                                  const std::string name,
+                                  const std::string fname,
+                                  std::size_t num_processes) const
+{
+  // Create xml doc
+  pugi::xml_document xml_doc;
+  pugi::xml_node vtk_node = xml_doc.append_child("VTKFile");
+  vtk_node.append_attribute("type") = "PUnstructuredGrid";
+  vtk_node.append_attribute("version") = "0.1";
+  pugi::xml_node grid_node = vtk_node.append_child("PUnstructuredGrid");
+  grid_node.append_attribute("GhostLevel") = 0;
+
+  // Mesh
+  pvtu_write_mesh(grid_node);
+
+  // Get type based on rank
+  std::string rank_type;
+  std::size_t num_components = 0;
+  if (rank == 0)
+  {
+    rank_type = "Scalars";
+    num_components = 0;
+  }
+  else if (rank == 1)
+  {
+    rank_type = "Vectors";
+    if (!(dim == 2 || dim == 3))
+    {
+      dolfin_error("VTKFile.cpp",
+                   "write data to VTK file",
+                   "Don't know how to handle vector function with dimension other than 2 or 3");
+    }
+    num_components = 3;
+  }
+  else if (rank == 2)
+  {
+    rank_type = "Tensors";
+    if (!(dim == 4 || dim == 9))
+    {
+      dolfin_error("VTKFile.cpp",
+                   "write data to VTK file",
+                   "Don't know how to handle tensor function with dimension other than 4 or 9");
+    }
+    num_components = 9;
+  }
+  else
+  {
+    dolfin_error("VTKFile.cpp",
+                 "write data to VTK file",
+                 "Cannot handle XML output of rank %d", rank);
+  }
+
+  // Add function data
+  pugi::xml_node data_node;
+  if (data_location == "point")
+    data_node = grid_node.append_child("PPointData");
+  else if (data_location == "cell")
+    data_node = grid_node.append_child("PCellData");
+
+  data_node.append_attribute(rank_type.c_str()) = name.c_str();
+  pugi::xml_node data_array_node = data_node.append_child("PDataArray");
+  data_array_node.append_attribute("type") = "Float64";
+  data_array_node.append_attribute("Name") = name.c_str();
+  data_array_node.append_attribute("NumberOfComponents")
+    = (unsigned int) num_components;
+
+  // Write vtu file list
+  for(std::size_t i = 0; i <num_processes; i++)
+  {
+    const std::string tmp_string = strip_path(vtu_name(i, num_processes,
+                                                       counter, ".vtu"));
+    pugi::xml_node piece_node = grid_node.append_child("Piece");
+    piece_node.append_attribute("Source") = tmp_string.c_str();
+  }
+
+  xml_doc.save_file(fname.c_str(), "  ");
+}
+//----------------------------------------------------------------------------
+void VTKFile::pvtu_write_mesh(const std::string fname,
+                              const std::size_t num_processes) const
+{
+  // Create xml doc
+  pugi::xml_document xml_doc;
+  pugi::xml_node vtk_node = xml_doc.append_child("VTKFile");
+  vtk_node.append_attribute("type") = "PUnstructuredGrid";
+  vtk_node.append_attribute("version") = "0.1";
+  pugi::xml_node grid_node = vtk_node.append_child("PUnstructuredGrid");
+  grid_node.append_attribute("GhostLevel") = 0;
+
+  // Mesh
+  pvtu_write_mesh(grid_node);
+
+  // Write vtu file list
+  for (std::size_t i = 0; i < num_processes; i++)
+  {
+    const std::string tmp_string = strip_path(vtu_name(i, num_processes,
+                                                       counter, ".vtu"));
+    pugi::xml_node piece_node = grid_node.append_child("Piece");
+    piece_node.append_attribute("Source") = tmp_string.c_str();
+  }
+
+  xml_doc.save_file(fname.c_str(), "  ");
+}
+//----------------------------------------------------------------------------
+void VTKFile::pvtu_write(const Function& u, const std::string fname) const
+{
+  dolfin_assert(u.function_space()->element());
+  const std::size_t rank = u.function_space()->element()->value_rank();
+  if (rank > 2)
+  {
+    dolfin_error("VTKFile.cpp",
+                 "write data to VTK file",
+                 "Only scalar, vector and tensor functions can be saved in VTK format");
+  }
+
+  // Get number of components
+  const std::size_t dim = u.value_size();
+
+  // Get mesh
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *(u.function_space()->mesh());
+
+  // Test for cell-based element type
+  std::string data_type = "point";
+  std::size_t cell_based_dim = 1;
+  dolfin_assert(u.function_space()->dofmap());
+  for (std::size_t i = 0; i < rank; i++)
+    cell_based_dim *= mesh.topology().dim();
+  if (u.function_space()->dofmap()->max_cell_dimension() == cell_based_dim)
+    data_type = "cell";
+
+  const std::size_t num_processes = MPI::size(mesh.mpi_comm());
+  pvtu_write_function(dim, rank, data_type, u.name(), fname, num_processes);
+}
+//----------------------------------------------------------------------------
+void VTKFile::vtk_header_open(std::size_t num_vertices, std::size_t num_cells,
+                              std::string vtu_filename) const
+{
+  // Open file
+  std::ofstream file(vtu_filename.c_str(), std::ios::app);
+  file.precision(16);
+  if (!file.is_open())
+  {
+    dolfin_error("VTKFile.cpp",
+                 "write data to VTK file",
+                 "Unable to open file \"%s\"", _filename.c_str());
+  }
+
+  // Figure out endianness of machine
+  std::string endianness = "";
+  if (encode_string == "binary")
+  {
+    #if defined BOOST_LITTLE_ENDIAN
+    endianness = "byte_order=\"LittleEndian\"";
+    #elif defined BOOST_BIG_ENDIAN
+    endianness = "byte_order=\"BigEndian\"";;
+    #else
+    dolfin_error("VTKFile.cpp",
+                 "write data to VTK file",
+                 "Unable to determine the endianness of the machine for VTK binary output");
+    #endif
+  }
+
+  // Compression string
+  std::string compressor = "";
+  if (_encoding == "compressed")
+    compressor = "compressor=\"vtkZLibDataCompressor\"";
+
+  // Write headers
+  file << "<?xml version=\"1.0\"?>" << std::endl;
+  file << "<VTKFile type=\"UnstructuredGrid\"  version=\"0.1\" " << endianness
+       <<  " " << compressor << ">" << std::endl;
+  file << "<UnstructuredGrid>" << std::endl;
+  file << "<Piece  NumberOfPoints=\"" << num_vertices << "\" NumberOfCells=\""
+       << num_cells << "\">" << std::endl;
+
+  // Close file
+  file.close();
+}
+//----------------------------------------------------------------------------
+void VTKFile::vtk_header_close(std::string vtu_filename) const
+{
+  // Open file
+  std::ofstream file(vtu_filename.c_str(), std::ios::app);
+  file.precision(16);
+  if (!file.is_open())
+  {
+    dolfin_error("VTKFile.cpp",
+                 "write data to VTK file",
+                 "Unable to open file \"%s\"", _filename.c_str());
+  }
+
+  // Close headers
+  file << "</Piece>" << std::endl << "</UnstructuredGrid>" << std::endl
+       << "</VTKFile>";
+
+  // Close file
+  file.close();
+}
+//----------------------------------------------------------------------------
+std::string VTKFile::vtu_name(const int process, const int num_processes,
+                              const int counter, std::string ext) const
+{
+  std::string filestart, extension;
+  std::ostringstream fileid, newfilename;
+
+  fileid.fill('0');
+  fileid.width(6);
+
+  filestart.assign(_filename, 0, _filename.find_last_of("."));
+  extension.assign(_filename, _filename.find_last_of("."), _filename.size());
+
+  fileid << counter;
+
+  // Add process number to .vtu file name
+  std::string proc = "";
+  if (num_processes > 1)
+  {
+    std::ostringstream _p;
+    _p << "_p" << process << "_";
+    proc = _p.str();
+  }
+  newfilename << filestart << proc << fileid.str() << ext;
+
+  return newfilename.str();
+}
+//----------------------------------------------------------------------------
+template<typename T>
+void VTKFile::mesh_function_write(T& meshfunction, double time)
+{
+  const Mesh& mesh = *meshfunction.mesh();
+  const std::size_t cell_dim = meshfunction.dim();
+
+  // Update vtu file name and clear file
+  std::string vtu_filename = init(mesh, cell_dim);
+
+  // Write mesh
+  VTKWriter::write_mesh(mesh, cell_dim, vtu_filename, binary, compress);
+
+  // Open file to write data
+  std::ofstream fp(vtu_filename.c_str(), std::ios_base::app);
+  fp.precision(16);
+  fp << "<CellData  Scalars=\"" << meshfunction.name() << "\">" << std::endl;
+  fp << "<DataArray  type=\"Float64\"  Name=\"" << meshfunction.name()
+     << "\"  format=\"ascii\">";
+
+  // Write data
+  for (MeshEntityIterator cell(mesh, cell_dim); !cell.end(); ++cell)
+    fp << meshfunction[cell->index()] << " ";
+
+  // Write footers
+  fp << "</DataArray>" << std::endl;
+  fp << "</CellData>" << std::endl;
+
+  // Close file
+  fp.close();
+
+  // Parallel-specfic files
+  const std::size_t num_processes = MPI::size(mesh.mpi_comm());
+  const std::size_t process_number = MPI::rank(mesh.mpi_comm());
+  if (num_processes > 1 && process_number == 0)
+  {
+    std::string pvtu_filename = vtu_name(0, 0, counter, ".pvtu");
+    pvtu_write_function(1, 0, "cell", meshfunction.name(), pvtu_filename,
+                        num_processes);
+    pvd_file_write(counter, time, pvtu_filename);
+  }
+  else if (num_processes == 1)
+    pvd_file_write(counter, time, vtu_filename);
+
+  // Write pvd files
+  finalize(vtu_filename, time);
+
+  log(TRACE, "Saved mesh function %s (%s) to file %s in VTK format.",
+      mesh.name().c_str(), mesh.label().c_str(), _filename.c_str());
+}
+//----------------------------------------------------------------------------
+void VTKFile::clear_file(std::string file) const
+{
+  // Open file and clear
+  std::ofstream _file(file.c_str(), std::ios::trunc);
+  if (!_file.is_open())
+  {
+    dolfin_error("VTKFile.cpp",
+                 "clear VTK file",
+                 "Unable to open file \"%s\"", file.c_str());
+  }
+  _file.close();
+}
+//----------------------------------------------------------------------------
+std::string VTKFile::strip_path(std::string file) const
+{
+  std::string fname;
+  fname.assign(file, _filename.find_last_of("/") + 1, file.size());
+  return fname;
+}
+//----------------------------------------------------------------------------
diff --git a/dolfin/io/VTKFile.h b/dolfin/io/VTKFile.h
new file mode 100644
index 0000000..65ce369
--- /dev/null
+++ b/dolfin/io/VTKFile.h
@@ -0,0 +1,126 @@
+// Copyright (C) 2005-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006.
+// Modified by Niclas Jansson 2009.
+//
+// First added:  2005-07-05
+// Last changed: 2013-03-11
+
+#ifndef __VTK_FILE_H
+#define __VTK_FILE_H
+
+#include <fstream>
+#include <string>
+#include <utility>
+#include <vector>
+#include "GenericFile.h"
+
+namespace pugi
+{
+  class xml_node;
+}
+
+namespace dolfin
+{
+
+  /// This class supports the output of meshes and functions in VTK
+  /// XML format for visualistion purposes. It is not suitable to
+  /// checkpointing as it may decimate some data.
+
+  class VTKFile : public GenericFile
+  {
+  public:
+
+    VTKFile(const std::string filename, std::string encoding);
+    ~VTKFile();
+
+    void operator<< (const Mesh& mesh);
+    void operator<< (const MeshFunction<bool>& meshfunction);
+    void operator<< (const MeshFunction<std::size_t>& meshfunction);
+    void operator<< (const MeshFunction<int>& meshfunction);
+    void operator<< (const MeshFunction<double>& meshfunction);
+    void operator<< (const Function& u);
+    void operator<< (const std::pair<const Mesh*, double> mesh);
+    void operator<< (const std::pair<const MeshFunction<int>*, double> f);
+    void
+      operator<< (const std::pair<const MeshFunction<std::size_t>*, double> f);
+    void operator<< (const std::pair<const MeshFunction<double>*, double> f);
+    void operator<< (const std::pair<const MeshFunction<bool>*, double> f);
+    void operator<< (const std::pair<const Function*, double> u);
+
+  protected:
+
+    void write_function(const Function& u, double time);
+
+    void write_mesh(const Mesh& mesh, double time);
+
+    std::string init(const Mesh& mesh, std::size_t dim) const;
+
+    void finalize(std::string vtu_filename, double time);
+
+    void results_write(const Function& u, std::string file) const;
+
+    void write_point_data(const GenericFunction& u, const Mesh& mesh,
+                          std::string file) const;
+
+    void pvd_file_write(std::size_t step, double time, std::string file);
+
+
+    void pvtu_write_function(std::size_t dim, std::size_t rank,
+                             const std::string data_location,
+                             const std::string name,
+                             const std::string filename,
+                             std::size_t num_processes) const;
+
+    void pvtu_write_mesh(const std::string pvtu_filename,
+                         const std::size_t num_processes) const;
+
+    void pvtu_write(const Function& u, const std::string pvtu_filename) const;
+
+    void vtk_header_open(std::size_t num_vertices, std::size_t num_cells,
+                         std::string file) const;
+
+    void vtk_header_close(std::string file) const;
+
+    std::string vtu_name(const int process, const int num_processes,
+                         const int counter, std::string ext) const;
+
+    void clear_file(std::string file) const;
+
+    template<typename T>
+    void mesh_function_write(T& meshfunction, double time);
+
+    // Strip path from file
+    std::string strip_path(std::string file) const;
+
+  private:
+
+    void pvtu_write_mesh(pugi::xml_node xml_node) const;
+
+    // File encoding
+    const std::string _encoding;
+    std::string encode_string;
+
+    bool binary;
+    bool compress;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/VTKWriter.cpp b/dolfin/io/VTKWriter.cpp
new file mode 100644
index 0000000..0962e8f
--- /dev/null
+++ b/dolfin/io/VTKWriter.cpp
@@ -0,0 +1,414 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+// Modified by Johannes Ring 2012
+//
+// First added:  2010-07-19
+// Last changed: 2012-09-14
+
+#include <fstream>
+#include <ostream>
+#include <sstream>
+#include <vector>
+#include <iomanip>
+#include <boost/detail/endian.hpp>
+
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/Vertex.h>
+#include "Encoder.h"
+#include "VTKWriter.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+void VTKWriter::write_mesh(const Mesh& mesh, std::size_t cell_dim,
+                           std::string filename, bool binary, bool compress)
+{
+  if (binary)
+    write_base64_mesh(mesh, cell_dim, filename, compress);
+  else
+    write_ascii_mesh(mesh, cell_dim, filename);
+}
+//----------------------------------------------------------------------------
+void VTKWriter::write_cell_data(const Function& u, std::string filename,
+                                bool binary, bool compress)
+{
+  // For brevity
+  dolfin_assert(u.function_space()->mesh());
+  dolfin_assert(u.function_space()->dofmap());
+  const Mesh& mesh = *u.function_space()->mesh();
+  const GenericDofMap& dofmap = *u.function_space()->dofmap();
+  const std::size_t num_cells = mesh.num_cells();
+
+  std::string encode_string;
+  if (!binary)
+    encode_string = "ascii";
+  else
+    encode_string = "binary";
+
+  // Get rank of Function
+  const std::size_t rank = u.value_rank();
+  if(rank > 2)
+  {
+      dolfin_error("VTKFile.cpp",
+                   "write data to VTK file",
+                   "Don't know how to handle vector function with dimension other than 2 or 3");
+  }
+
+  // Get number of components
+  const std::size_t data_dim = u.value_size();
+
+  // Open file
+  std::ofstream fp(filename.c_str(), std::ios_base::app);
+  fp.precision(16);
+
+  // Write headers
+  if (rank == 0)
+  {
+    fp << "<CellData  Scalars=\"" << u.name() << "\"> " << std::endl;
+    fp << "<DataArray  type=\"Float64\"  Name=\"" << u.name() << "\"  format=\""
+       << encode_string <<"\">";
+  }
+  else if (rank == 1)
+  {
+    if(!(data_dim == 2 || data_dim == 3))
+    {
+      dolfin_error("VTKWriter.cpp",
+                   "write data to VTK file",
+                   "Don't know how to handle vector function with dimension other than 2 or 3");
+    }
+    fp << "<CellData  Vectors=\"" << u.name() << "\"> " << std::endl;
+    fp << "<DataArray  type=\"Float64\"  Name=\"" << u.name()
+       << "\"  NumberOfComponents=\"3\" format=\""<< encode_string <<"\">";
+  }
+  else if (rank == 2)
+  {
+    if(!(data_dim == 4 || data_dim == 9))
+    {
+      dolfin_error("VTKFile.cpp",
+                   "write data to VTK file",
+                   "Don't know how to handle tensor function with dimension other than 4 or 9");
+    }
+    fp << "<CellData  Tensors=\"" << u.name() << "\"> " << std::endl;
+    fp << "<DataArray  type=\"Float64\"  Name=\"" << u.name()
+       << "\"  NumberOfComponents=\"9\" format=\""<< encode_string <<"\">";
+  }
+
+  // Allocate memory for function values at cell centres
+  const std::size_t size = num_cells*data_dim;
+
+  // Build lists of dofs and create map
+  std::vector<dolfin::la_index> dof_set;
+  std::vector<std::size_t> offset(size + 1);
+  std::vector<std::size_t>::iterator cell_offset = offset.begin();
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Tabulate dofs
+    const std::vector<dolfin::la_index>& dofs = dofmap.cell_dofs(cell->index());
+    for(std::size_t i = 0; i < dofmap.cell_dimension(cell->index()); ++i)
+      dof_set.push_back(dofs[i]);
+
+    // Add local dimension to cell offset and increment
+    *(cell_offset + 1) = *(cell_offset) + dofmap.cell_dimension(cell->index());
+    ++cell_offset;
+  }
+
+  // Get  values
+  std::vector<double> values(dof_set.size());
+  dolfin_assert(u.vector());
+  u.vector()->get_local(values.data(), dof_set.size(), dof_set.data());
+
+  // Get cell data
+  if (!binary)
+    fp << ascii_cell_data(mesh, offset, values, data_dim, rank);
+  else
+  {
+    fp << base64_cell_data(mesh, offset, values, data_dim, rank, compress)
+       << std::endl;
+  }
+  fp << "</DataArray> " << std::endl;
+  fp << "</CellData> " << std::endl;
+}
+//----------------------------------------------------------------------------
+std::string VTKWriter::ascii_cell_data(const Mesh& mesh,
+                                       const std::vector<std::size_t>& offset,
+                                       const std::vector<double>& values,
+                                       std::size_t data_dim, std::size_t rank)
+{
+  std::ostringstream ss;
+  ss << std::scientific;
+  ss << std::setprecision(16);
+  std::vector<std::size_t>::const_iterator cell_offset = offset.begin();
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    if (rank == 1 && data_dim == 2)
+    {
+      // Append 0.0 to 2D vectors to make them 3D
+      ss << values[*cell_offset] << "  " << values[*cell_offset + 1] << " "
+         << 0.0;
+    }
+    else if (rank == 2 && data_dim == 4)
+    {
+      // Pad with 0.0 to 2D tensors to make them 3D
+      for(std::size_t i = 0; i < 2; i++)
+      {
+        ss << values[*cell_offset + 2*i] << " ";
+        ss << values[*cell_offset + 2*i + 1] << " ";
+        ss << 0.0 << " ";
+      }
+      ss << 0.0 << " ";
+      ss << 0.0 << " ";
+      ss << 0.0;
+    }
+    else
+    {
+      // Write all components
+      for (std::size_t i = 0; i < data_dim; i++)
+        ss << values[*cell_offset + i] << " ";
+    }
+    ss << "  ";
+    ++cell_offset;
+  }
+
+  return ss.str();
+}
+//----------------------------------------------------------------------------
+std::string VTKWriter::base64_cell_data(const Mesh& mesh,
+                                        const std::vector<std::size_t>& offset,
+                                        const std::vector<double>& values,
+                                        std::size_t data_dim, std::size_t rank,
+                                        bool compress)
+{
+  const std::size_t num_cells = mesh.num_cells();
+
+  // Number of zero paddings per point
+  std::size_t padding_per_point = 0;
+  if (rank == 1 && data_dim == 2)
+    padding_per_point = 1;
+  else if (rank == 2 && data_dim == 4)
+    padding_per_point = 5;
+
+  // Number of data entries per point and total number
+  const std::size_t num_data_per_point = data_dim + padding_per_point;
+  const std::size_t num_total_data_points = num_cells*num_data_per_point;
+
+  std::vector<std::size_t>::const_iterator cell_offset = offset.begin();
+  std::vector<double> data(num_total_data_points, 0);
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    const std::size_t index = cell->index();
+    for(std::size_t i = 0; i < data_dim; i++)
+      data[index*num_data_per_point + i] = values[*cell_offset + i];
+    ++cell_offset;
+  }
+
+  return encode_stream(data, compress);
+}
+//----------------------------------------------------------------------------
+void VTKWriter::write_ascii_mesh(const Mesh& mesh, std::size_t cell_dim,
+                                 std::string filename)
+{
+  const std::size_t num_cells = mesh.topology().size(cell_dim);
+  const std::size_t num_cell_vertices = mesh.type().num_vertices(cell_dim);
+
+  // Get VTK cell type
+  const std::size_t _vtk_cell_type = vtk_cell_type(mesh, cell_dim);
+
+  // Open file
+  std::ofstream file(filename.c_str(), std::ios::app);
+  file.precision(16);
+  if (!file.is_open())
+  {
+    dolfin_error("VTKWriter.cpp",
+                 "write mesh to VTK file"
+                 "Unable to open file \"%s\"", filename.c_str());
+  }
+
+  // Write vertex positions
+  file << "<Points>" << std::endl;
+  file << "<DataArray  type=\"Float64\"  NumberOfComponents=\"3\"  format=\""
+       << "ascii" << "\">";
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    Point p = v->point();
+    file << p.x() << " " << p.y() << " " <<  p.z() << "  ";
+  }
+  file << "</DataArray>" << std::endl <<  "</Points>" << std::endl;
+
+  // Write cell connectivity
+  file << "<Cells>" << std::endl;
+  file << "<DataArray  type=\"UInt32\"  Name=\"connectivity\"  format=\""
+       << "ascii" << "\">";
+  for (MeshEntityIterator c(mesh, cell_dim); !c.end(); ++c)
+  {
+    for (VertexIterator v(*c); !v.end(); ++v)
+      file << v->index() << " ";
+    file << " ";
+  }
+  file << "</DataArray>" << std::endl;
+
+  // Write offset into connectivity array for the end of each cell
+  file << "<DataArray  type=\"UInt32\"  Name=\"offsets\"  format=\"" << "ascii"
+       << "\">";
+  for (std::size_t offsets = 1; offsets <= num_cells; offsets++)
+    file << offsets*num_cell_vertices << " ";
+  file << "</DataArray>" << std::endl;
+
+  // Write cell type
+  file << "<DataArray  type=\"UInt8\"  Name=\"types\"  format=\"" << "ascii"
+       << "\">";
+  for (std::size_t types = 0; types < num_cells; types++)
+    file << _vtk_cell_type << " ";
+  file  << "</DataArray>" << std::endl;
+  file  << "</Cells>" << std::endl;
+
+  // Close file
+  file.close();
+}
+//-----------------------------------------------------------------------------
+void VTKWriter::write_base64_mesh(const Mesh& mesh, std::size_t cell_dim,
+                                  std::string filename, bool compress)
+{
+  const std::size_t num_cells = mesh.topology().size(cell_dim);
+  const std::size_t num_cell_vertices = mesh.type().num_vertices(cell_dim);
+
+  // Get VTK cell type
+  const boost::uint8_t _vtk_cell_type = vtk_cell_type(mesh, cell_dim);
+
+  // Open file
+  std::ofstream file(filename.c_str(), std::ios::app);
+  file.precision(16);
+  if ( !file.is_open() )
+  {
+    dolfin_error("VTKWriter.cpp",
+                 "write mesh to VTK file",
+                 "Unable to open file \"%s\"", filename.c_str());
+  }
+
+  // Write vertex positions
+  file << "<Points>" << std::endl;
+  file << "<DataArray  type=\"Float64\"  NumberOfComponents=\"3\"  format=\""
+       << "binary" << "\">" << std::endl;
+  std::vector<double> vertex_data(3*mesh.num_vertices());
+  std::vector<double>::iterator vertex_entry = vertex_data.begin();
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    const Point p = v->point();
+    *vertex_entry++ = p.x();
+    *vertex_entry++ = p.y();
+    *vertex_entry++ = p.z();
+  }
+  // Create encoded stream
+  file <<  encode_stream(vertex_data, compress) << std::endl;
+  file << "</DataArray>" << std::endl <<  "</Points>" << std::endl;
+
+  // Write cell connectivity
+  file << "<Cells>" << std::endl;
+  file << "<DataArray  type=\"UInt32\"  Name=\"connectivity\"  format=\""
+       << "binary" << "\">" << std::endl;
+  const int size = num_cells*num_cell_vertices;
+  std::vector<boost::uint32_t> cell_data(size);
+  std::vector<boost::uint32_t>::iterator cell_entry = cell_data.begin();
+  for (MeshEntityIterator c(mesh, cell_dim); !c.end(); ++c)
+  {
+    for (VertexIterator v(*c); !v.end(); ++v)
+      *cell_entry++ = v->index();
+  }
+
+  // Create encoded stream
+  file << encode_stream(cell_data, compress) << std::endl;
+  file << "</DataArray>" << std::endl;
+
+  // Write offset into connectivity array for the end of each cell
+  file << "<DataArray  type=\"UInt32\"  Name=\"offsets\"  format=\""
+       << "binary" << "\">" << std::endl;
+  std::vector<boost::uint32_t> offset_data(num_cells*num_cell_vertices);
+  std::vector<boost::uint32_t>::iterator offset_entry = offset_data.begin();
+  for (std::size_t offsets = 1; offsets <= num_cells; offsets++)
+    *offset_entry++ = offsets*num_cell_vertices;
+
+  // Create encoded stream
+  file << encode_stream(offset_data, compress) << std::endl;
+  file << "</DataArray>" << std::endl;
+
+  // Write cell type
+  file << "<DataArray  type=\"UInt8\"  Name=\"types\"  format=\"" << "binary"
+       << "\">" << std::endl;
+  std::vector<boost::uint8_t> type_data(num_cells);
+  std::vector<boost::uint8_t>::iterator type_entry = type_data.begin();
+  for (std::size_t types = 0; types < num_cells; types++)
+    *type_entry++ = _vtk_cell_type;
+
+  // Create encoded stream
+  file << encode_stream(type_data, compress) << std::endl;
+
+  file  << "</DataArray>" << std::endl;
+  file  << "</Cells>" << std::endl;
+
+  // Close file
+  file.close();
+}
+//----------------------------------------------------------------------------
+boost::uint8_t VTKWriter::vtk_cell_type(const Mesh& mesh,
+                                        std::size_t cell_dim)
+{
+  // Get cell type
+  CellType::Type cell_type = mesh.type().cell_type();
+  if (mesh.topology().dim() == cell_dim)
+    cell_type = mesh.type().cell_type();
+  else if (mesh.topology().dim() - 1 == cell_dim)
+    cell_type = mesh.type().facet_type();
+  else if (cell_dim == 1)
+    cell_type = CellType::interval;
+  else if (cell_dim == 0)
+    cell_type = CellType::point;
+  else
+  {
+    dolfin_error("VTKWriter.cpp",
+                 "write data to VTK file",
+                 "Can only handle cells, cell facets or points with VTK output for now");
+  }
+
+  // Determine VTK cell type
+  boost::uint8_t vtk_cell_type = 0;
+  if (cell_type == CellType::tetrahedron)
+    vtk_cell_type = 10;
+  else if (cell_type == CellType::triangle)
+    vtk_cell_type = 5;
+  else if (cell_type == CellType::interval)
+    vtk_cell_type = 3;
+  else if (cell_type == CellType::point)
+    vtk_cell_type = 1;
+  else
+  {
+    dolfin_error("VTKWriter.cpp",
+                 "write data to VTK file",
+                 "Unknown cell type (%d)", cell_type);
+  }
+
+  return vtk_cell_type;
+}
+//----------------------------------------------------------------------------
diff --git a/dolfin/io/VTKWriter.h b/dolfin/io/VTKWriter.h
new file mode 100644
index 0000000..11b8078
--- /dev/null
+++ b/dolfin/io/VTKWriter.h
@@ -0,0 +1,156 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-07-19
+// Last changed:
+
+#ifndef __VTK_WRITER_H
+#define __VTK_WRITER_H
+
+#include <string>
+#include <vector>
+#include <boost/cstdint.hpp>
+#include "Encoder.h"
+
+namespace dolfin
+{
+
+  class Function;
+  class Mesh;
+
+  class VTKWriter
+  {
+  public:
+
+    // Mesh writer
+    static void write_mesh(const Mesh& mesh, std::size_t cell_dim,
+                           std::string file,
+                           bool binary, bool compress);
+
+    // Cell data writer
+    static void write_cell_data(const Function& u, std::string file,
+                                bool binary, bool compress);
+
+    // Form (compressed) base64 encoded string for VTK
+    template<typename T>
+    static std::string encode_stream(const std::vector<T>& data,
+                                     bool compress);
+  //friend class VTKFile;
+
+  private:
+
+    // Write cell data (ascii)
+    static std::string ascii_cell_data(const Mesh& mesh,
+                                       const std::vector<std::size_t>& offset,
+                                       const std::vector<double>& values,
+                                       std::size_t dim, std::size_t rank);
+
+    // Write cell data (base64)
+    static std::string base64_cell_data(const Mesh& mesh,
+                                        const std::vector<std::size_t>& offset,
+                                        const std::vector<double>& values,
+                                        std::size_t dim, std::size_t rank,
+                                        bool compress);
+
+    // Mesh writer (ascii)
+    static void write_ascii_mesh(const Mesh& mesh, std::size_t cell_dim,
+                                 std::string file);
+
+    // Mesh writer (base64)
+    static void write_base64_mesh(const Mesh& mesh, std::size_t cell_dim,
+                                  std::string file, bool compress);
+
+    // Get VTK cell type
+    static boost::uint8_t vtk_cell_type(const Mesh& mesh, std::size_t cell_dim);
+
+    // Compute base64 encoded stream for VTK
+    template<typename T>
+    static std::string encode_inline_base64(const std::vector<T>& data);
+
+    // Compute compressed base64 encoded stream for VTK
+    template<typename T>
+    static std::string encode_inline_compressed_base64(const std::vector<T>&
+                                                       data);
+
+  };
+
+  //--------------------------------------------------------------------------
+  template<typename T>
+  std::string VTKWriter::encode_stream(const std::vector<T>& data,
+                                       bool compress)
+  {
+    std::stringstream stream;
+
+    if (compress)
+    {
+      #ifdef HAS_ZLIB
+      return encode_inline_compressed_base64(data);
+      #else
+      warning("zlib must be configured to enable compressed VTK output. Using uncompressed base64 encoding instead.");
+      return encode_inline_base64(data);
+      #endif
+    }
+    else
+      return encode_inline_base64(data);
+  }
+  //--------------------------------------------------------------------------
+  template<typename T>
+  std::string VTKWriter::encode_inline_base64(const std::vector<T>& data)
+  {
+    std::stringstream stream;
+
+    const boost::uint32_t size = data.size()*sizeof(T);
+    Encoder::encode_base64(&size, 1, stream);
+    Encoder::encode_base64(data, stream);
+
+    return stream.str();
+  }
+  //--------------------------------------------------------------------------
+  #ifdef HAS_ZLIB
+  template<typename T>
+  std::string VTKWriter::encode_inline_compressed_base64(const std::vector<T>&
+                                                         data)
+  {
+    std::stringstream stream;
+
+    boost::uint32_t header[4];
+    header[0] = 1;
+    header[1] = data.size()*sizeof(T);
+    header[2] = 0;
+
+    // Compress data
+    std::pair<boost::shared_array<unsigned char>, std::size_t>
+      compressed_data = Encoder::compress_data(data);
+
+    // Length of compressed data
+    header[3] = compressed_data.second;
+
+    // Encode header
+    Encoder::encode_base64(&header[0], 4, stream);
+
+    // Encode data
+    Encoder::encode_base64(compressed_data.first.get(),
+                           compressed_data.second, stream);
+
+    return stream.str();
+  }
+  #endif
+  //--------------------------------------------------------------------------
+
+}
+
+#endif
diff --git a/dolfin/io/X3DFile.cpp b/dolfin/io/X3DFile.cpp
new file mode 100644
index 0000000..c6fbd02
--- /dev/null
+++ b/dolfin/io/X3DFile.cpp
@@ -0,0 +1,668 @@
+// Copyright (C) 2013 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-03-05
+// Last changed: 2014-02-01
+
+#include <iostream>
+#include <fstream>
+#include <boost/lexical_cast.hpp>
+
+#include "pugixml.hpp"
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Edge.h>
+#include <dolfin/mesh/Face.h>
+#include <dolfin/mesh/Vertex.h>
+
+#include "X3DFile.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+X3DFile::X3DFile(const std::string filename) : GenericFile(filename, "X3D"),
+  facet_type("IndexedFaceSet")
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+X3DFile::~X3DFile()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void X3DFile::operator<< (const Mesh& mesh)
+{
+  write_mesh(mesh);
+}
+//-----------------------------------------------------------------------------
+void X3DFile::operator<< (const MeshFunction<std::size_t>& meshfunction)
+{
+  write_meshfunction(meshfunction);
+}
+//-----------------------------------------------------------------------------
+void X3DFile::operator<< (const Function& u)
+{
+  write_function(u);
+}
+//-----------------------------------------------------------------------------
+std::string X3DFile::color_palette(const int palette) const
+{
+  // Make a basic palette of 256 colours
+  std::stringstream colour;
+  switch (palette)
+  {
+  case 1:
+    for (int i = 0; i < 256; ++i)
+    {
+      const double x = (double)i/255.0;
+      const double y = 1.0 - x;
+      const double r = 4*pow(x, 3) - 3*pow(x, 4);
+      const double g = 4*pow(x, 2)*(1.0 - pow(x, 2));
+      const double b = 4*pow(y, 3) - 3*pow(y, 4);
+      colour << r << " " << g << " " << b << " ";
+    }
+    break;
+
+  case 2:
+    for (int i = 0; i < 256; ++i)
+    {
+      const double lm = 425.0 + 250.0*(double)i/255.0;
+      const double b
+        = 1.8*exp(-pow((lm - 450.0)/((lm>450.0) ? 40.0 : 20.0), 2.0));
+      const double g
+        = 0.9*exp(-pow((lm - 550.0)/((lm>550.0) ? 60 : 40.0), 2.0));
+      double r = 1.0*exp(-pow((lm - 600.0)/((lm>600.0) ? 40.0 : 50.0), 2.0));
+      r += 0.3*exp(-pow((lm - 450.0)/((lm>450.0) ? 20.0 : 30.0), 2.0));
+      const double tot = (r + g + b);
+
+      colour << r/tot << " " << g/tot << " " << b/tot << " ";
+    }
+    break;
+
+  default:
+    for (int i = 0; i < 256 ; ++i)
+    {
+      const double r = (double)i/255.0;
+      const double g = (double)(i*(255 - i))/(128.0*127.0);
+      const double b = (double)(255 - i)/255.0;
+      colour << r << " " << g << " " << b << " ";
+    }
+    break;
+  }
+
+  return colour.str();
+}
+//-----------------------------------------------------------------------------
+void X3DFile::write_meshfunction(const MeshFunction<std::size_t>& meshfunction)
+{
+  // Palette choice
+  const int palette = 2;
+
+  // Get mesh
+  dolfin_assert(meshfunction.mesh());
+  const Mesh& mesh = *meshfunction.mesh();
+
+  // Ensure connectivity has been computed
+  mesh.init(mesh.topology().dim() - 1 , mesh.topology().dim());
+
+  // Mesh geometric dimension
+  const std::size_t gdim = mesh.geometry().dim();
+
+  // Mesh topological dimension
+  const std::size_t tdim = mesh.topology().dim();
+
+  // MeshFunction dimension
+  const std::size_t cell_dim = meshfunction.dim();
+
+  // Check that MeshFunction dimension is handled
+  if (cell_dim != tdim)
+  {
+    dolfin_error("X3DFile.cpp",
+                 "output meshfunction",
+                 "Can only output CellFunction at present");
+  }
+
+  // Check that X3D type is appropriate
+  if (cell_dim == tdim && facet_type == "IndexedLineSet")
+  {
+    dolfin_error("X3DFile.cpp",
+                 "output meshfunction",
+                 "Cannot output CellFunction with Edge mesh");
+  }
+
+  // Check that mesh is in 2D or 3D
+  if (gdim !=2 && gdim !=3)
+  {
+    dolfin_error("X3DFile.cpp",
+                 "output mesh",
+                 "X3D will only output 2D or 3D meshes");
+  }
+
+  // Pointer to MeshFunction data
+  const std::size_t* values = meshfunction.values();
+
+  // Get min/max values of MeshFunction
+  std::size_t minval = *std::min_element(values, values + meshfunction.size());
+  minval = MPI::min(mesh.mpi_comm(), minval);
+  std::size_t maxval = *std::max_element(values, values + meshfunction.size());
+  maxval = MPI::max(mesh.mpi_comm(), maxval);
+  double dval;
+  if (maxval == minval)
+    dval = 1.0;
+  else
+    dval = 255.0/(double)(maxval - minval);
+
+  // Get mesh min/max  dimensions and viewpoint
+  const std::vector<double> xpos = mesh_min_max(mesh);
+
+  // Get MPI details
+  const std::size_t process_number = MPI::rank(mesh.mpi_comm());
+
+  // Create pugi xml document
+  pugi::xml_document xml_doc;
+
+  // Write XML header
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+    output_xml_header(xml_doc, xpos);
+
+  // Make a set of the indices we wish to use. In 3D, we are ignoring
+  // all interior facets, so reducing the number of vertices
+  // substantially
+  const std::vector<std::size_t> vecindex = vertex_index(mesh);
+
+  // Write vertices
+  write_vertices(xml_doc, mesh, vecindex);
+
+  // Iterate over mesh facets
+  std::vector<unsigned int> local_output;
+  for (FaceIterator f(mesh); !f.end(); ++f)
+  {
+    // Check if topolgical dimension is 2, or if we have a boundary
+    // facet in 3D
+    if (tdim == 2 || f->num_global_entities(tdim) == 1)
+    {
+      // Get cell connected to facet
+      CellIterator cell(*f);
+
+      // Write mesh function value to string stream
+      local_output.push_back((unsigned int)
+                             ((meshfunction[*cell] - minval)*dval));
+    }
+  }
+
+  // Gather up data on zero
+  std::vector<unsigned int> gathered_output;
+  MPI::gather(mesh.mpi_comm(), local_output, gathered_output);
+
+  // Write XML on root process
+  if (process_number == 0)
+  {
+    pugi::xml_node indexed_face_set = xml_doc.child("X3D")
+      .child("Scene").child("Shape").child(facet_type.c_str());
+    indexed_face_set.append_attribute("colorPerVertex") = "false";
+
+    std::stringstream str_output;
+    for (std::vector<unsigned int>::iterator val = gathered_output.begin();
+         val != gathered_output.end(); ++val)
+    {
+      str_output << *val << " ";
+    }
+
+    indexed_face_set.append_attribute("colorIndex") = str_output.str().c_str();
+
+    // Output palette
+    pugi::xml_node color = indexed_face_set.append_child("Color");
+    color.append_attribute("color") = color_palette(palette).c_str();
+
+    // Save XML file
+    xml_doc.save_file(_filename.c_str(), "  ");
+  }
+}
+//-----------------------------------------------------------------------------
+void X3DFile::write_function(const Function& u)
+{
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *u.function_space()->mesh();
+
+  // Mesh geometric and tological dimensions
+  const std::size_t gdim = mesh.geometry().dim();
+  const std::size_t tdim = mesh.topology().dim();
+
+  if (gdim !=2 && gdim !=3)
+  {
+    dolfin_error("X3DFile.cpp",
+                 "output mesh",
+                 "X3D will only output 2D or 3D meshes");
+  }
+
+  // Build mesh connectivity
+  mesh.init(tdim - 1 , tdim);
+
+  dolfin_assert(u.function_space()->dofmap());
+  const GenericDofMap& dofmap = *u.function_space()->dofmap();
+
+  // Only allow scalar fields
+  if (u.value_rank() > 1)
+  {
+    dolfin_error("X3DFile.cpp",
+                 "write X3D",
+                 "Can only handle scalar and vector Functions");
+  }
+
+  if (u.value_rank() == 1)
+    warning("X3DFile outputs scalar magnitude of vector field");
+
+  // Only allow vertex centered data
+  const bool vertex_data = (dofmap.max_cell_dimension() != 1);
+  if (!vertex_data)
+  {
+    dolfin_error("X3DFile.cpp",
+                 "write X3D",
+                 "Can only handle vertex-based Function at present");
+  }
+
+  // Compute vertex data values
+  std::vector<double> data_values;
+  u.compute_vertex_values(data_values, mesh);
+
+  // Normalise data values
+  if (u.value_rank() == 1)
+  {
+    std::vector<double> magnitude;
+    const std::size_t num_vertices = mesh.num_vertices();
+    for (std::size_t i = 0; i < num_vertices ; ++i)
+    {
+      double val = 0.0;
+      for (std::size_t j = 0; j < u.value_size() ; j++)
+        val += pow(data_values[i + j*num_vertices], 2.0);
+      val = sqrt(val);
+      magnitude.push_back(val);
+    }
+    data_values.resize(magnitude.size());
+    std::copy(magnitude.begin(), magnitude.end(), data_values.begin());
+  }
+
+  // Create pugi document
+  pugi::xml_document xml_doc;
+
+  // Get mesh mix/max dimensions and wriet XML header
+  const std::vector<double> xpos = mesh_min_max(mesh);
+  output_xml_header(xml_doc, xpos);
+
+  // Get indices of vertices on mesh surface
+  const std::vector<std::size_t> surface_vertices = vertex_index(mesh);
+
+  // Write vertices and vertex data to XML file
+  write_vertices(xml_doc, mesh, surface_vertices);
+  write_values(xml_doc, mesh, surface_vertices, data_values);
+
+  // Save XML file
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+    xml_doc.save_file(_filename.c_str(), "  ");
+}
+//-----------------------------------------------------------------------------
+void X3DFile::write_mesh(const Mesh& mesh)
+{
+  const std::size_t gdim = mesh.geometry().dim();
+  if (gdim !=2 && gdim !=3)
+  {
+    dolfin_error("X3DFile.cpp",
+                 "output mesh",
+                 "X3D will only output 2D or 3D meshes");
+  }
+
+  // Creat pugi doc
+  pugi::xml_document xml_doc;
+
+  // For serial - ensure connectivity
+  mesh.init(mesh.topology().dim() - 1 , mesh.topology().dim());
+
+  // Get mesh max and min dimensions and viewpoint
+  const std::vector<double> xpos = mesh_min_max(mesh);
+
+  // Create XML for all mesh vertices on surface
+  output_xml_header(xml_doc, xpos);
+  const std::vector<std::size_t> vecindex = vertex_index(mesh);
+  write_vertices(xml_doc, mesh, vecindex);
+
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+    xml_doc.save_file(_filename.c_str(), "  ");
+}
+//-----------------------------------------------------------------------------
+void X3DFile::write_values(pugi::xml_document& xml_doc, const Mesh& mesh,
+                           const std::vector<std::size_t> vecindex,
+                           const std::vector<double> data_values)
+{
+  const std::size_t tdim = mesh.topology().dim();
+
+  double minval = *std::min_element(data_values.begin(), data_values.end());
+  minval = MPI::min(mesh.mpi_comm(), minval);
+  double maxval = *std::max_element(data_values.begin(), data_values.end());
+  maxval = MPI::max(mesh.mpi_comm(), maxval);
+
+  double scale = 0.0;
+  if (maxval == minval)
+    scale = 1.0;
+  else
+    scale = 255.0/(maxval - minval);
+
+  std::vector<int> local_output;
+  if (facet_type == "IndexedLineSet")
+  {
+    for (EdgeIterator e(mesh); !e.end(); ++e)
+    {
+      bool allow_edge = (tdim == 2);
+
+      // If one of the faces connected to this edge is external, then
+      // output the edge
+      if (!allow_edge)
+      {
+        for (FaceIterator f(*e); !f.end(); ++f)
+        {
+          if (f->num_global_entities(tdim) == 1)
+            allow_edge = true;
+        }
+      }
+
+      if (allow_edge)
+      {
+        for (VertexIterator v(*e); !v.end(); ++v)
+        {
+          local_output.push_back((int)((data_values[v->index()] - minval)
+                                       *scale));
+        }
+        local_output.push_back(-1);
+      }
+    }
+  }
+  else if (facet_type == "IndexedFaceSet")
+  {
+    // Output faces
+    for (FaceIterator f(mesh); !f.end(); ++f)
+    {
+      if (tdim == 2 || f->num_global_entities(tdim) == 1)
+      {
+        for (VertexIterator v(*f); !v.end(); ++v)
+        {
+          local_output.push_back((int)((data_values[v->index()] - minval)
+                                       *scale));
+        }
+        local_output.push_back(-1);
+      }
+    }
+  }
+
+  // Gather up on zero
+  std::vector<int> gathered_output;
+  MPI::gather(mesh.mpi_comm(), local_output, gathered_output);
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    pugi::xml_node indexed_face_set = xml_doc.child("X3D")
+      .child("Scene").child("Shape").child(facet_type.c_str());
+    indexed_face_set.append_attribute("colorPerVertex") = "true";
+
+    std::stringstream str_output;
+    for (std::vector<int>::iterator val = gathered_output.begin();
+         val != gathered_output.end(); ++val)
+    {
+      str_output << *val << " ";
+    }
+    indexed_face_set.append_attribute("colorIndex") = str_output.str().c_str();
+
+    // Output colour palette
+    const int palette = 2;
+    pugi::xml_node color = indexed_face_set.append_child("Color");
+    color.append_attribute("color") = color_palette(palette).c_str();
+  }
+}
+//-----------------------------------------------------------------------------
+void X3DFile::write_vertices(pugi::xml_document& xml_doc, const Mesh& mesh,
+                             const std::vector<std::size_t> vecindex)
+{
+  std::size_t offset = MPI::global_offset(mesh.mpi_comm(), vecindex.size(),
+                                          true);
+
+  const std::size_t process_number = MPI::rank(mesh.mpi_comm());
+  const std::size_t tdim = mesh.topology().dim();
+  const std::size_t gdim = mesh.geometry().dim();
+
+  std::vector<int> local_output;
+  if (facet_type == "IndexedLineSet")
+  {
+    for (EdgeIterator e(mesh); !e.end(); ++e)
+    {
+      bool allow_edge = (tdim == 2);
+
+      // If one of the faces connected to this edge is external, then
+      // output the edge
+      if (!allow_edge)
+      {
+        for (FaceIterator f(*e); !f.end(); ++f)
+        {
+          if (f->num_global_entities(tdim) == 1)
+            allow_edge = true;
+        }
+      }
+
+      if (allow_edge)
+      {
+        for (VertexIterator v(*e); !v.end(); ++v)
+        {
+          std::size_t index_it  = std::find(vecindex.begin(),
+                                            vecindex.end(),
+                                            v->index()) - vecindex.begin();
+          local_output.push_back(index_it + offset);
+        }
+        local_output.push_back(-1);
+      }
+    }
+  }
+  else if (facet_type == "IndexedFaceSet")
+  {
+    // Output faces
+    for (FaceIterator f(mesh); !f.end(); ++f)
+    {
+      if (tdim == 2 || f->num_global_entities(tdim) == 1)
+      {
+        for (VertexIterator v(*f); !v.end(); ++v)
+        {
+          std::size_t index_it = std::find(vecindex.begin(),
+                                           vecindex.end(),
+                                           v->index()) - vecindex.begin();
+          local_output.push_back(index_it + offset);
+        }
+        local_output.push_back(-1);
+      }
+    }
+  }
+
+  std::vector<int> gathered_output;
+  MPI::gather(mesh.mpi_comm(), local_output, gathered_output);
+
+  if (process_number == 0)
+  {
+    pugi::xml_node indexed_face_set
+      = xml_doc.child("X3D").child("Scene").child("Shape").child(facet_type.c_str());
+
+    std::stringstream str_output;
+    for (std::vector<int>::iterator val = gathered_output.begin();
+         val != gathered_output.end(); ++val)
+    {
+      str_output << *val << " ";
+    }
+    indexed_face_set.append_attribute("coordIndex") = str_output.str().c_str();
+  }
+
+  // Now fill in the geometry
+  std::vector<double> local_geom_output;
+  for (std::vector<std::size_t>::const_iterator index = vecindex.begin();
+       index != vecindex.end(); ++index)
+  {
+    Vertex v(mesh, *index);
+    local_geom_output.push_back(v.x(0));
+    local_geom_output.push_back(v.x(1));
+    if (gdim == 2)
+      local_geom_output.push_back(0.0);
+    else
+      local_geom_output.push_back(v.x(2));
+  }
+
+  std::vector<double> gathered_geom_output;
+  MPI::gather(mesh.mpi_comm(), local_geom_output, gathered_geom_output);
+
+  // Finally, close off with the XML footer on process zero
+  if (process_number == 0)
+  {
+    pugi::xml_node indexed_face_set
+      = xml_doc.child("X3D").child("Scene").child("Shape").child(facet_type.c_str());
+
+    pugi::xml_node coordinate = indexed_face_set.append_child("Coordinate");
+
+    std::stringstream str_output;
+    for (std::vector<double>::iterator val = gathered_geom_output.begin();
+         val != gathered_geom_output.end(); ++val)
+    {
+      str_output << *val << " ";
+    }
+    coordinate.append_attribute("point") = str_output.str().c_str();
+  }
+}
+//-----------------------------------------------------------------------------
+void X3DFile::output_xml_header(pugi::xml_document& xml_doc,
+                                const std::vector<double>& xpos)
+{
+  xml_doc.append_child(pugi::node_doctype).set_value("X3D PUBLIC \"ISO//Web3D//DTD X3D 3.2//EN\" \"http://www.web3d.org/specifications/x3d-3.2.dtd\"");
+
+  pugi::xml_node x3d = xml_doc.append_child("X3D");
+  x3d.append_attribute("profile") = "Interchange";
+  x3d.append_attribute("version") = "3.2";
+  x3d.append_attribute("xmlns:xsd")
+    = "http://www.w3.org/2001/XMLSchema-instance";
+  x3d.append_attribute("xsd:noNamespaceSchemaLocation")
+    = "http://www.web3d.org/specifications/x3d-3.2.xsd";
+
+  pugi::xml_node scene = x3d.append_child("Scene");
+  pugi::xml_node viewpoint = scene.append_child("Viewpoint");
+  std::string xyz = boost::lexical_cast<std::string>(xpos[0]) + " "
+      + boost::lexical_cast<std::string>(xpos[1]) + " "
+    + boost::lexical_cast<std::string>(xpos[3]);
+  viewpoint.append_attribute("position") = xyz.c_str();
+
+  viewpoint.append_attribute("orientation") = "0 0 0 1";
+  viewpoint.append_attribute("fieldOfView") = "0.785398";
+  xyz = boost::lexical_cast<std::string>(xpos[0]) + " "
+    + boost::lexical_cast<std::string>(xpos[1]) + " "
+    + boost::lexical_cast<std::string>(xpos[2]);
+  viewpoint.append_attribute("centerOfRotation") = xyz.c_str();
+
+  viewpoint.append_attribute("zNear") = "-1";
+  viewpoint.append_attribute("zFar") = "-1";
+  pugi::xml_node background = scene.append_child("Background");
+  background.append_attribute("skyColor") = "0.9 0.9 1.0";
+
+  pugi::xml_node shape = scene.append_child("Shape");
+  pugi::xml_node material
+    = shape.append_child("Appearance").append_child("Material");
+  material.append_attribute("ambientIntensity") = "0.05";
+  material.append_attribute("shininess") = "0.5";
+  material.append_attribute("diffuseColor") = "0.7 0.7 0.7";
+  material.append_attribute("specularColor") = "0.9 0.9 0.9";
+  material.append_attribute("emmisiveColor") = "0.7 0.7 0.7";
+
+  shape.append_child(facet_type.c_str()).append_attribute("solid") = "false";
+}
+//-----------------------------------------------------------------------------
+std::vector<double> X3DFile::mesh_min_max(const Mesh& mesh) const
+{
+  // Get MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  // Get dimensions
+  double xmin = std::numeric_limits<double>::max();
+  double xmax = std::numeric_limits<double>::min();
+  double ymin = std::numeric_limits<double>::max();
+  double ymax = std::numeric_limits<double>::min();
+  double zmin = std::numeric_limits<double>::max();
+  double zmax = std::numeric_limits<double>::min();
+
+  const std::size_t gdim = mesh.geometry().dim();
+
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    xmin = std::min(xmin, v->x(0));
+    xmax = std::max(xmax, v->x(0));
+    ymin = std::min(ymin, v->x(1));
+    ymax = std::max(ymax, v->x(1));
+    if (gdim == 2)
+    {
+      zmin = 0.0;
+      zmax = 0.0;
+    }
+    else
+    {
+      zmin = std::min(zmin, v->x(2));
+      zmax = std::max(zmax, v->x(2));
+    }
+  }
+
+  xmin = MPI::min(mpi_comm, xmin);
+  ymin = MPI::min(mpi_comm, ymin);
+  zmin = MPI::min(mpi_comm, zmin);
+
+  xmax = MPI::max(mpi_comm, xmax);
+  ymax = MPI::max(mpi_comm, ymax);
+  zmax = MPI::max(mpi_comm, zmax);
+
+  std::vector<double> result;
+  result.push_back((xmax + xmin)/2.0);
+  result.push_back((ymax + zmin)/2.0);
+  result.push_back((zmax + zmin)/2.0);
+
+  double d = std::max(xmax - xmin, ymax - ymin);
+  d = 2.0*std::max(d, zmax - zmin) + zmax ;
+  result.push_back(d);
+
+  return result;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> X3DFile::vertex_index(const Mesh& mesh) const
+{
+  const std::size_t tdim = mesh.topology().dim();
+  std::set<std::size_t> vindex;
+
+  for (FaceIterator f(mesh); !f.end(); ++f)
+  {
+    // If in 3D, only output exterior faces
+    // FIXME: num_global_entities not working in serial
+    if (tdim == 2 || f->num_global_entities(tdim) == 1)
+    {
+      for (VertexIterator v(*f); !v.end(); ++v)
+        vindex.insert(v->index());
+    }
+  }
+
+  // Copy to vector for wider iterator support
+  const std::vector<std::size_t> vecindex(vindex.begin(), vindex.end());
+  return vecindex;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/X3DFile.h b/dolfin/io/X3DFile.h
new file mode 100644
index 0000000..2dd0eda
--- /dev/null
+++ b/dolfin/io/X3DFile.h
@@ -0,0 +1,104 @@
+// Copyright (C) 2013 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-03-05
+// Last changed: 2013-05-10
+
+#ifndef __X3D_FILE_H
+#define __X3D_FILE_H
+
+#include "GenericFile.h"
+
+namespace pugi
+{
+  class xml_document;
+}
+
+namespace dolfin
+{
+
+  /// This class implements output of meshes to X3D (successor to
+  /// VRML) graphics format (http://www.web3d.org/x3d/). It is
+  /// suitable for output of small to medium size meshes for 3D
+  /// visualisation via browsers, and can also do basic Function and
+  /// MeshFunction output (on the surface) X3D files can be included
+  /// on web pages with WebGL functionality (see www.x3dom.org).
+
+  class X3DFile : public GenericFile
+  {
+  public:
+
+    /// Constructor
+    explicit X3DFile(const std::string filename);
+
+    /// Destructor
+    ~X3DFile();
+
+    /// Output Mesh to X3D format - for a 3D mesh, only producing
+    /// surface facets
+    void operator<< (const Mesh& mesh);
+
+    /// Output MeshFunction to X3D format - for a 3D mesh, only
+    /// producing surface facets
+    void operator<< (const MeshFunction<std::size_t>& meshfunction);
+
+    /// Output Function to X3D format - for a 3D mesh, only producing
+    /// surface facets
+    void operator<< (const Function& function);
+
+  private:
+
+    // Get mesh dimensions and viewpoint distance
+    std::vector<double> mesh_min_max(const Mesh& mesh) const;
+
+    // Get list of vertex indices which are on surface
+    std::vector<std::size_t> vertex_index(const Mesh& mesh) const;
+
+    // Output mesh vertices to XML
+    void write_vertices(pugi::xml_document& xml_doc, const Mesh& mesh,
+                        const std::vector<std::size_t> vecindex);
+
+    // Output values to XML using a colour palette
+    void write_values(pugi::xml_document& xml_doc, const Mesh& mesh,
+                      const std::vector<std::size_t> vecindex,
+                      const std::vector<double> data_values);
+
+    // XML header output
+    void output_xml_header(pugi::xml_document& xml_doc,
+                           const std::vector<double>& xpos);
+
+    // Write out surface mesh to file
+    void write_mesh(const Mesh& mesh);
+
+    // Write out surface mesh to file
+    void write_function(const Function& u);
+
+    // Write out surface mesh to file
+    void write_meshfunction(const MeshFunction<std::size_t>& meshfunction);
+
+    // Get a string representing a color palette
+    std::string color_palette(const int pal) const;
+
+    // Whether in Face or Edge mode - should either be
+    // "IndexedFaceSet" or "IndexedLineSet"
+    const std::string facet_type;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/XDMFFile.cpp b/dolfin/io/XDMFFile.cpp
new file mode 100644
index 0000000..37cd87f
--- /dev/null
+++ b/dolfin/io/XDMFFile.cpp
@@ -0,0 +1,957 @@
+// Copyright (C) 2012 Chris N. Richardson and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2012
+
+#ifdef HAS_HDF5
+
+#include <iomanip>
+#include <ostream>
+#include <sstream>
+#include <vector>
+#include <boost/algorithm/string.hpp>
+#include <boost/assign.hpp>
+#include <boost/filesystem.hpp>
+#include <boost/format.hpp>
+#include <boost/lexical_cast.hpp>
+
+#include "pugixml.hpp"
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/DistributedMeshTools.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Vertex.h>
+#include "HDF5File.h"
+#include "HDF5Utility.h"
+#include "XDMFFile.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+XDMFFile::XDMFFile(MPI_Comm comm, const std::string filename)
+  : GenericFile(filename, "XDMF"), _mpi_comm(comm)
+{
+  // Make name for HDF5 file (used to store data)
+  boost::filesystem::path p(filename);
+  p.replace_extension(".h5");
+  hdf5_filename = p.string();
+
+  // File mode will be set when reading or writing
+  hdf5_filemode = "";
+
+  // Rewrite the mesh at every time step in a time series. Should be
+  // turned off if the mesh remains constant.
+  parameters.add("rewrite_function_mesh", true);
+
+  // Flush datasets to disk at each timestep. Allows inspection of the
+  // HDF5 file whilst running, at some performance cost.
+  parameters.add("flush_output", false);
+
+  // HDF5 file restart interval. Use 0 to collect all output in one file.
+  parameters.add("multi_file", 0);
+  
+}
+//----------------------------------------------------------------------------
+XDMFFile::~XDMFFile()
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator<< (const Function& u)
+{
+  std::pair<const Function*, double> ut(&u, (double) counter);
+  *this << ut;
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator<< (const std::pair<const Function*, double> ut)
+{
+  const int mf_interval = parameters["multi_file"];
+
+  // Conditions for starting a new HDF5 file
+  if ( (mf_interval != 0 and counter%mf_interval == 0) or hdf5_filemode != "w" )
+  { 
+    // Make name for HDF5 file (used to store data)
+    boost::filesystem::path p(_filename);
+    p.replace_extension(".h5");
+    hdf5_filename = p.string();
+
+    if (mf_interval != 0)
+    {
+      std::stringstream s;
+      s << std::setw(6) << std::setfill('0') << counter;
+      hdf5_filename += "_" + s.str();
+    }
+    
+    // Create new HDF5 file (truncate),
+    // closing any open file from a previous timestep
+    hdf5_file.reset(new HDF5File(_mpi_comm, hdf5_filename, "w"));
+    hdf5_filemode = "w";
+  }
+
+  dolfin_assert(hdf5_file);
+
+  // Access Function, Mesh, dofmap  and time step
+  dolfin_assert(ut.first);
+  const Function& u = *(ut.first);
+
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *u.function_space()->mesh();
+
+  dolfin_assert(u.function_space()->dofmap());
+  const GenericDofMap& dofmap = *u.function_space()->dofmap();
+
+  const double time_step = ut.second;
+
+  // Geometric and topological dimension
+  const std::size_t gdim = mesh.geometry().dim();
+  const std::size_t tdim = mesh.topology().dim();
+
+  // Get some Function and cell information
+  const std::size_t value_rank = u.value_rank();
+  const std::size_t value_size = u.value_size();
+
+  std::size_t padded_value_size = value_size;
+
+  // Test for cell-centred data
+  std::size_t cell_based_dim = 1;
+  for (std::size_t i = 0; i < value_rank; i++)
+    cell_based_dim *= tdim;
+  const bool vertex_data = !(dofmap.max_cell_dimension() == cell_based_dim);
+
+  // Get number of local/global cells/vertices
+  const std::size_t num_local_cells = mesh.num_cells();
+  const std::size_t num_local_vertices = mesh.num_vertices();
+  const std::size_t num_global_cells = mesh.size_global(tdim);
+
+  // Get Function data at vertices/cell centres
+  std::vector<double> data_values;
+
+  if (vertex_data)
+  {
+    u.compute_vertex_values(data_values, mesh);
+
+    // Interleave the values for vector or tensor fields and pad 2D
+    // vectors and tensors to 3D
+    if (value_rank > 0)
+    {
+      if (value_size == 2)
+        padded_value_size = 3;
+      if (value_size == 4)
+        padded_value_size = 9;
+
+      std::vector<double> _data_values(padded_value_size*num_local_vertices,
+                                       0.0);
+      for (std::size_t i = 0; i < num_local_vertices; i++)
+      {
+        for (std::size_t j = 0; j < value_size; j++)
+        {
+          std::size_t tensor_2d_offset = (j > 1 && value_size == 4) ? 1 : 0;
+          _data_values[i*padded_value_size + j + tensor_2d_offset]
+              = data_values[i + j*num_local_vertices];
+        }
+      }
+      data_values = _data_values;
+    }
+  }
+  else
+  {
+    dolfin_assert(u.function_space()->dofmap());
+    dolfin_assert(u.vector());
+
+    // Allocate memory for function values at cell centres
+    const std::size_t size = num_local_cells*value_size;
+
+    // Build lists of dofs and create map
+    std::vector<dolfin::la_index> dof_set;
+    std::vector<std::size_t> offset(size + 1);
+    std::vector<std::size_t>::iterator cell_offset = offset.begin();
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      // Tabulate dofs
+      const std::vector<dolfin::la_index>& dofs
+        = dofmap.cell_dofs(cell->index());
+      for (std::size_t i = 0; i < dofmap.cell_dimension(cell->index()); ++i)
+        dof_set.push_back(dofs[i]);
+
+      // Add local dimension to cell offset and increment
+      *(cell_offset + 1) = *(cell_offset)
+        + dofmap.cell_dimension(cell->index());
+      ++cell_offset;
+    }
+
+    // Get  values
+    data_values.resize(dof_set.size());
+    dolfin_assert(u.vector());
+    u.vector()->get_local(data_values.data(), dof_set.size(), dof_set.data());
+
+    if (value_size == 2)
+      padded_value_size = 3;
+    if (value_size == 4)
+      padded_value_size = 9;
+
+    cell_offset = offset.begin();
+    std::vector<double> _data_values(padded_value_size*num_local_cells, 0.0);
+    std::size_t count = 0;
+    if (value_rank == 1 && value_size == 2)
+    {
+      for (CellIterator cell(mesh); !cell.end(); ++cell)
+      {
+        _data_values[count++] = data_values[*cell_offset];
+        _data_values[count++] = data_values[*cell_offset + 1];
+        count++;
+      }
+      ++cell_offset;
+    }
+    else if (value_rank == 2 && value_size == 4)
+    {
+      // Pad with 0.0 to 2D tensors to make them 3D
+      for (CellIterator cell(mesh); !cell.end(); ++cell)
+      {
+        for (std::size_t i = 0; i < 2; i++)
+        {
+          _data_values[count++] = data_values[*cell_offset + 2*i];
+          _data_values[count++] = data_values[*cell_offset + 2*i + 1];
+          count++;
+        }
+        count += 3;
+        ++cell_offset;
+      }
+    }
+    else
+    {
+      // Write all components
+      for (CellIterator cell(mesh); !cell.end(); ++cell)
+      {
+        for (std::size_t i = 0; i < value_size; i++)
+          _data_values[count++] = data_values[*cell_offset + i];
+        ++cell_offset;
+      }
+    }
+    data_values = _data_values;
+  }
+
+  // FIXME: Below is messy. Should query HDF5 file writer for existing
+  //        mesh name
+  // Write mesh to HDF5 file
+  if (parameters["rewrite_function_mesh"] || counter == 0)
+  {
+    const std::string h5_mesh_name = "/Mesh/" + boost::lexical_cast<std::string>(counter);
+    boost::filesystem::path p(hdf5_filename);
+    current_mesh_name = p.filename().string() + ":" + h5_mesh_name;
+    hdf5_file->write(mesh, h5_mesh_name);
+  }
+
+  // Remove duplicates for vertex-based data
+  std::vector<std::size_t> global_size(2);
+  global_size[1] = padded_value_size;
+  if (vertex_data)
+  {
+    HDF5Utility::reorder_values_by_global_indices(mesh, data_values,
+                                                  padded_value_size);
+    global_size[0] = mesh.size_global(0);
+  }
+  else
+    global_size[0] = mesh.size_global(tdim);
+
+  // Save data values to HDF5 file.  Vertex/cell values are saved in
+  // the hdf5 group /VisualisationVector as distinct from /Vector
+  // which is used for solution vectors.
+  const std::string dataset_name = "/VisualisationVector/"
+    + boost::lexical_cast<std::string>(counter);
+
+  const bool mpi_io = MPI::size(mesh.mpi_comm()) > 1 ? true : false;
+  hdf5_file->write_data(dataset_name, data_values, global_size, mpi_io);
+
+  // Flush file. Improves chances of recovering data if
+  // interrupted. Also makes file somewhat readable between writes.
+  if (parameters["flush_output"])
+    hdf5_file->flush();
+
+  // Write the XML meta description (see http://www.xdmf.org) on
+  // process zero
+  const std::size_t num_total_vertices = mesh.size_global(0);
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    output_xml(time_step, vertex_data, tdim, num_global_cells, gdim,
+               num_total_vertices, value_rank, padded_value_size,
+               u.name(), dataset_name);
+  }
+
+  // Increment counter
+  counter++;
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator>> (Mesh& mesh)
+{
+  read(mesh, false);
+}
+//-----------------------------------------------------------------------------
+void XDMFFile::read(Mesh& mesh, bool use_partition_from_file)
+{
+  // Prepare HDF5 file
+  if (hdf5_filemode != "r")
+  {
+    hdf5_file.reset(new HDF5File(_mpi_comm, hdf5_filename, "r"));
+    hdf5_filemode = "r";
+  }
+  dolfin_assert(hdf5_file);
+
+  // Prepare XML file
+  pugi::xml_document xml_doc;
+  pugi::xml_parse_result result = xml_doc.load_file(_filename.c_str());
+  if (!result)
+  {
+    dolfin_error("XDMFFile.cpp",
+                 "read mesh from XDMF/H5 files",
+                 "XML parsing error. XDMF file should contain only one mesh/dataset");
+  }
+
+  // Topology - check format and get dataset name
+  pugi::xml_node xdmf_topology
+    = xml_doc.child("Xdmf").child("Domain").child("Grid").child("Topology").child("DataItem");
+  if (!xdmf_topology)
+  {
+    dolfin_error("XDMFFile.cpp",
+                 "read mesh from XDMF/H5 files",
+                 "XML parsing error. XDMF file should contain only one mesh/dataset");
+  }
+
+  const std::string
+    topological_data_format(xdmf_topology.attribute("Format").value());
+  if (topological_data_format != "HDF")
+  {
+    dolfin_error("XDMFFile.cpp",
+                 "read mesh from XDMF/H5 files",
+                 "XML parsing error. Wrong dataset format (not HDF5)");
+  }
+
+  const std::string topo_ref(xdmf_topology.first_child().value());
+  std::vector<std::string> topo_bits;
+  boost::split(topo_bits, topo_ref, boost::is_any_of(":/"));
+
+  // Should have 5 elements "filename.h5", "", "Mesh", "meshname", "topology"
+  dolfin_assert(topo_bits.size() == 5);
+  // FIXME: get path() from filename to check
+  //  dolfin_assert(topo_bits[0] == hdf5_filename);
+  dolfin_assert(topo_bits[2] == "Mesh");
+  dolfin_assert(topo_bits[4] == "topology");
+
+  // Geometry - check format and get dataset name
+  pugi::xml_node xdmf_geometry =
+    xml_doc.child("Xdmf").child("Domain").child("Grid").child("Geometry").child("DataItem");
+  dolfin_assert(xdmf_geometry);
+
+  const std::string geom_fmt(xdmf_geometry.attribute("Format").value());
+  dolfin_assert(geom_fmt == "HDF");
+
+  const std::string geom_ref(xdmf_geometry.first_child().value());
+  std::vector<std::string> geom_bits;
+  boost::split(geom_bits, geom_ref, boost::is_any_of(":/"));
+
+  // Should have 5 elements "filename.h5", "", "Mesh", "meshname",
+  // "coordinates"
+  dolfin_assert(geom_bits.size() == 5);
+  //  dolfin_assert(geom_bits[0] == hdf5_filename);
+  dolfin_assert(geom_bits[2] == "Mesh");
+  dolfin_assert(geom_bits[3] == topo_bits[3]);
+  dolfin_assert(geom_bits[4] == "coordinates");
+
+  // Try to read the mesh from the associated HDF5 file
+  hdf5_file->read(mesh, "/Mesh/" + geom_bits[3], use_partition_from_file);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator<< (const Mesh& mesh)
+{
+  // Write Mesh to HDF5 file
+
+  if (hdf5_filemode != "w")
+  {
+    // Create HDF5 file (truncate)
+    hdf5_file.reset(new HDF5File(mesh.mpi_comm(), hdf5_filename, "w"));
+    hdf5_filemode = "w";
+  }
+
+  // Output data name
+  const std::string name = mesh.name();
+
+  // Topological and geometric dimensions
+  const std::size_t gdim = mesh.geometry().dim();
+  const std::size_t cell_dim = mesh.topology().dim();
+
+  // Make sure entities are numbered
+  DistributedMeshTools::number_entities(mesh, cell_dim);
+
+  // Get number of global cells and vertices
+  const std::size_t num_global_cells   = mesh.size_global(cell_dim);
+  const std::size_t num_total_vertices = mesh.size_global(0);
+
+  // Write mesh to HDF5 file
+  // The XML below will obliterate any existing XDMF file
+
+  const std::string group_name = "/Mesh/" + name;
+  hdf5_file->write(mesh, cell_dim, group_name);
+
+  // Write the XML meta description on process zero
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Create XML document
+    pugi::xml_document xml_doc;
+
+    // XML headers
+    xml_doc.append_child(pugi::node_doctype).set_value("Xdmf SYSTEM \"Xdmf.dtd\" []");
+    pugi::xml_node xdmf = xml_doc.append_child("Xdmf");
+    xdmf.append_attribute("Version") = "2.0";
+    xdmf.append_attribute("xmlns:xi") = "http://www.w3.org/2001/XInclude";
+    pugi::xml_node xdmf_domain = xdmf.append_child("Domain");
+    pugi::xml_node xdmf_grid = xdmf_domain.append_child("Grid");
+    xdmf_grid.append_attribute("Name") = name.c_str();
+    xdmf_grid.append_attribute("GridType") = "Uniform";
+
+    // Describe topological connectivity
+    pugi::xml_node xdmf_topology = xdmf_grid.append_child("Topology");
+    boost::filesystem::path p(hdf5_filename);
+    const std::string topology_reference = p.filename().string() + ":"
+      + group_name + "/topology";
+    xml_mesh_topology(xdmf_topology, cell_dim, num_global_cells,
+                      topology_reference);
+
+    // Describe geometric coordinates
+    pugi::xml_node xdmf_geometry = xdmf_grid.append_child("Geometry");
+    const std::string geometry_reference = p.filename().string() + ":"
+      + group_name + "/coordinates";
+    xml_mesh_geometry(xdmf_geometry, num_total_vertices, gdim,
+                      geometry_reference);
+
+    xml_doc.save_file(_filename.c_str(), "  ");
+  }
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator<< (const MeshFunction<bool>& meshfunction)
+{
+  write_mesh_function(meshfunction);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator<< (const MeshFunction<int>& meshfunction)
+{
+  write_mesh_function(meshfunction);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator<< (const MeshFunction<std::size_t>& meshfunction)
+{
+  write_mesh_function(meshfunction);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator<< (const MeshFunction<double>& meshfunction)
+{
+  write_mesh_function(meshfunction);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::write(const std::vector<Point>& points)
+{
+  // Intialise HDF5 file
+  if (hdf5_filemode != "w")
+  {
+    // Create HDF5 file (truncate)
+    hdf5_file.reset(new HDF5File(_mpi_comm, hdf5_filename, "w"));
+    hdf5_filemode = "w";
+  }
+
+  // Get number of points (global)
+  const std::size_t num_global_points = MPI::sum(_mpi_comm, points.size());
+
+  // Write HDF5 file
+  const std::string group_name = "/Points";
+  hdf5_file->write(points, group_name);
+
+  // The XML created below will obliterate any existing XDMF file
+  write_point_xml(group_name, num_global_points, 0);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::write(const std::vector<Point>& points,
+                     const std::vector<double>& values)
+{
+  // Write clouds of points to XDMF/HDF5 with values
+
+  dolfin_assert(points.size() == values.size());
+
+  // Intialise HDF5 file
+  if (hdf5_filemode != "w")
+  {
+    // Create HDF5 file (truncate)
+    hdf5_file.reset(new HDF5File(_mpi_comm, hdf5_filename, "w"));
+    hdf5_filemode = "w";
+  }
+
+  // Get number of points (global)
+  const std::size_t num_global_points = MPI::sum(_mpi_comm, points.size());
+
+  // Write HDF5 file
+  const std::string group_name = "/Points";
+  hdf5_file->write(points, group_name);
+
+  const std::string values_name = group_name + "/values";
+  hdf5_file->write(values, values_name);
+
+  // The XML created will obliterate any existing XDMF file
+  write_point_xml(group_name, num_global_points, 1);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::write_point_xml(const std::string group_name,
+                               const std::size_t num_global_points,
+                               const unsigned int value_size)
+{
+  // Write the XML meta description on process zero
+  if (MPI::rank(_mpi_comm) == 0)
+  {
+
+    // Create XML document
+    pugi::xml_document xml_doc;
+
+    // XML headers
+    xml_doc.append_child(pugi::node_doctype).set_value("Xdmf SYSTEM \"Xdmf.dtd\" []");
+    pugi::xml_node xdmf = xml_doc.append_child("Xdmf");
+    xdmf.append_attribute("Version") = "2.0";
+    xdmf.append_attribute("xmlns:xi") = "http://www.w3.org/2001/XInclude";
+    pugi::xml_node xdmf_domain = xdmf.append_child("Domain");
+    pugi::xml_node xdmf_grid = xdmf_domain.append_child("Grid");
+    xdmf_grid.append_attribute("Name") = "Point cloud";
+    xdmf_grid.append_attribute("GridType") = "Uniform";
+
+
+    // Describe topological connectivity
+    pugi::xml_node xdmf_topology = xdmf_grid.append_child("Topology");
+    xdmf_topology.append_attribute("NumberOfElements")
+      = (unsigned int) num_global_points;
+    xdmf_topology.append_attribute("TopologyType") = "PolyVertex";
+    xdmf_topology.append_attribute("NodesPerElement") = "1";
+
+    // Describe geometric coordinates
+    pugi::xml_node xdmf_geometry = xdmf_grid.append_child("Geometry");
+    const std::string geometry_reference = current_mesh_name + "/coordinates";
+    xml_mesh_geometry(xdmf_geometry, num_global_points, 3,
+		      geometry_reference);
+
+    if(value_size != 0)
+    {
+      dolfin_assert(value_size == 1 || value_size == 3);
+
+      // Grid/Attribute (value data)
+      pugi::xml_node xdmf_values = xdmf_grid.append_child("Attribute");
+      xdmf_values.append_attribute("Name") = "point_values";
+
+      if(value_size == 1)
+        xdmf_values.append_attribute("AttributeType") = "Scalar";
+      else
+        xdmf_values.append_attribute("AttributeType") = "Vector";
+
+      xdmf_values.append_attribute("Center") = "Node";
+
+      pugi::xml_node xdmf_data = xdmf_values.append_child("DataItem");
+      xdmf_data.append_attribute("Format") = "HDF";
+
+      std::string s
+        = boost::lexical_cast<std::string>(num_global_points) + " "
+        + boost::lexical_cast<std::string>(value_size);
+
+      xdmf_data.append_attribute("Dimensions") = s.c_str();
+
+      boost::filesystem::path p(hdf5_filename);
+      s = p.filename().string() + ":" + group_name + "/values";
+      xdmf_data.append_child(pugi::node_pcdata).set_value(s.c_str());
+    }
+
+    xml_doc.save_file(_filename.c_str(), "  ");
+  }
+}
+//----------------------------------------------------------------------------
+template<typename T>
+void XDMFFile::write_mesh_function(const MeshFunction<T>& meshfunction)
+{
+  // Get mesh
+  dolfin_assert(meshfunction.mesh());
+  const Mesh& mesh = *meshfunction.mesh();
+
+  if (hdf5_filemode != "w")
+  {
+    // Create HDF5 file (truncate)
+    hdf5_file.reset(new HDF5File(mesh.mpi_comm(), hdf5_filename, "w"));
+    hdf5_filemode = "w";
+  }
+
+  if (meshfunction.size() == 0)
+  {
+    dolfin_error("XDMFFile.cpp",
+                 "save empty MeshFunction",
+                 "No values in MeshFunction");
+  }
+
+  const std::size_t cell_dim = meshfunction.dim();
+  dolfin_assert(cell_dim <= mesh.topology().dim());
+
+  // Use HDF5 function to output MeshFunction
+  const std::string h5_mesh_name = "/Mesh/" + boost::lexical_cast<std::string>(counter);
+  boost::filesystem::path p(hdf5_filename);
+  current_mesh_name = p.filename().string() + ":" + h5_mesh_name;
+  hdf5_file->write(meshfunction, h5_mesh_name);
+
+  // Saved MeshFunction values are in the /Mesh group
+  const std::string dataset_name =  current_mesh_name + "/values";
+
+  // Write the XML meta description (see http://www.xdmf.org) on
+  // process zero
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    output_xml((double)counter, false,
+               cell_dim, mesh.size_global(cell_dim),
+               mesh.geometry().dim(), mesh.size_global(0),
+               0, 1, meshfunction.name(), dataset_name);
+  }
+
+  counter++;
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator>> (MeshFunction<bool>& meshfunction)
+{
+  const Mesh& mesh = *meshfunction.mesh();
+  const std::size_t cell_dim = meshfunction.dim();
+
+  MeshFunction<std::size_t> mf(mesh, cell_dim);
+  read_mesh_function(mf);
+
+  for (MeshEntityIterator cell(mesh, cell_dim); !cell.end(); ++cell)
+    meshfunction[cell->index()] = (mf[cell->index()] == 1);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator>> (MeshFunction<int>& meshfunction)
+{
+  read_mesh_function(meshfunction);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator>> (MeshFunction<std::size_t>& meshfunction)
+{
+  read_mesh_function(meshfunction);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::operator>> (MeshFunction<double>& meshfunction)
+{
+  read_mesh_function(meshfunction);
+}
+//----------------------------------------------------------------------------
+template<typename T>
+void XDMFFile::read_mesh_function(MeshFunction<T>& meshfunction)
+{
+  if (hdf5_filemode != "r")
+  {
+    hdf5_file.reset(new HDF5File(_mpi_comm, hdf5_filename, "r"));
+    hdf5_filemode = "r";
+  }
+
+  dolfin_assert(hdf5_file);
+
+  pugi::xml_document xml_doc;
+  pugi::xml_parse_result result = xml_doc.load_file(_filename.c_str());
+  if (!result)
+  {
+    dolfin_error("XDMFFile.cpp",
+                 "read mesh from XDMF/H5 files",
+                 "XML parsing error when reading from file");
+  }
+
+  // Topology - check format and get dataset name
+  pugi::xml_node xdmf_topology = xml_doc.child("Xdmf").child("Domain").
+    child("Grid").child("Grid").child("Topology").child("DataItem");
+  dolfin_assert(xdmf_topology);
+
+  const std::string topo_fmt(xdmf_topology.attribute("Format").value());
+  dolfin_assert(topo_fmt == "HDF");
+
+  const std::string topo_ref(xdmf_topology.first_child().value());
+  std::vector<std::string> topo_bits;
+  boost::split(topo_bits, topo_ref, boost::is_any_of(":/"));
+
+  // Should have 5 elements "filename.h5", "", "Mesh", "meshname", "topology"
+  dolfin_assert(topo_bits.size() == 5);
+  //  dolfin_assert(topo_bits[0] == hdf5_filename);
+  dolfin_assert(topo_bits[2] == "Mesh");
+  dolfin_assert(topo_bits[4] == "topology");
+
+  // Geometry - check format and get dataset name
+  pugi::xml_node xdmf_geometry = xml_doc.child("Xdmf").child("Domain").
+    child("Grid").child("Grid").child("Geometry").child("DataItem");
+  dolfin_assert(xdmf_geometry);
+
+  const std::string geom_fmt(xdmf_geometry.attribute("Format").value());
+  dolfin_assert(geom_fmt == "HDF");
+
+  const std::string geom_ref(xdmf_geometry.first_child().value());
+  std::vector<std::string> geom_bits;
+  boost::split(geom_bits, geom_ref, boost::is_any_of(":/"));
+
+  // Should have 5 elements "filename.h5", "", "Mesh", "meshname",
+  // "coordinates"
+  dolfin_assert(geom_bits.size() == 5);
+  //  dolfin_assert(geom_bits[0] == hdf5_filename);
+  dolfin_assert(geom_bits[2] == "Mesh");
+  dolfin_assert(geom_bits[3] == topo_bits[3]);
+  dolfin_assert(geom_bits[4] == "coordinates");
+
+  // Values - check format and get dataset name
+  pugi::xml_node xdmf_values = xml_doc.child("Xdmf").child("Domain").
+    child("Grid").child("Grid").child("Attribute").child("DataItem");
+  dolfin_assert(xdmf_values);
+
+  const std::string value_fmt(xdmf_values.attribute("Format").value());
+  dolfin_assert(value_fmt == "HDF");
+
+  const std::string value_ref(xdmf_values.first_child().value());
+  std::vector<std::string> value_bits;
+  boost::split(value_bits, value_ref, boost::is_any_of(":/"));
+  dolfin_assert(value_bits.size() == 5);
+  //  dolfin_assert(geom_bits[0] == hdf5_filename);
+  dolfin_assert(value_bits[2] == "Mesh");
+  dolfin_assert(value_bits[3] == topo_bits[3]);
+  dolfin_assert(value_bits[4] == "values");
+
+  // Try to read the meshfunction from the associated HDF5 file
+  hdf5_file->read(meshfunction, "/Mesh/" + geom_bits[3]);
+}
+//----------------------------------------------------------------------------
+void XDMFFile::xml_mesh_topology(pugi::xml_node &xdmf_topology,
+                                 const std::size_t cell_dim,
+                                 const std::size_t num_global_cells,
+                                 const std::string topology_reference) const
+{
+  xdmf_topology.append_attribute("NumberOfElements")
+    = (unsigned int) num_global_cells;
+
+  // Cell type
+  if (cell_dim == 0)
+  {
+    xdmf_topology.append_attribute("TopologyType") = "PolyVertex";
+    xdmf_topology.append_attribute("NodesPerElement") = "1";
+  }
+  else if (cell_dim == 1)
+  {
+    xdmf_topology.append_attribute("TopologyType") = "PolyLine";
+    xdmf_topology.append_attribute("NodesPerElement") = "2";
+  }
+  else if (cell_dim == 2)
+    xdmf_topology.append_attribute("TopologyType") = "Triangle";
+  else if (cell_dim == 3)
+    xdmf_topology.append_attribute("TopologyType") = "Tetrahedron";
+
+  // Refer to all cells and dimensions
+  pugi::xml_node xdmf_topology_data = xdmf_topology.append_child("DataItem");
+  xdmf_topology_data.append_attribute("Format") = "HDF";
+  const std::string cell_dims
+    = boost::lexical_cast<std::string>(num_global_cells)
+    + " " + boost::lexical_cast<std::string>(cell_dim + 1);
+  xdmf_topology_data.append_attribute("Dimensions") = cell_dims.c_str();
+
+  xdmf_topology_data.append_child(pugi::node_pcdata).set_value(topology_reference.c_str());
+}
+//----------------------------------------------------------------------------
+void XDMFFile::xml_mesh_geometry(pugi::xml_node& xdmf_geometry,
+                                 const std::size_t num_total_vertices,
+                                 const std::size_t gdim,
+                                 const std::string geometry_reference) const
+{
+  dolfin_assert(0 < gdim && gdim <= 3);
+  std::string geometry_type;
+  if (gdim == 1)
+  {
+    // geometry "X" is not supported in XDMF
+    geometry_type = "X_Y_Z";
+  }
+  else if (gdim == 2)
+    geometry_type = "XY";
+  else if (gdim == 3)
+    geometry_type = "XYZ";
+
+  xdmf_geometry.append_attribute("GeometryType") = geometry_type.c_str();
+  pugi::xml_node xdmf_geom_data = xdmf_geometry.append_child("DataItem");
+
+  xdmf_geom_data.append_attribute("Format") = "HDF";
+  std::string geom_dim = boost::lexical_cast<std::string>(num_total_vertices)
+    + " " + boost::lexical_cast<std::string>(gdim);
+  xdmf_geom_data.append_attribute("Dimensions") = geom_dim.c_str();
+
+  if (gdim == 1)
+  {
+    // FIXME: improve this workaround
+
+    // When gdim==1, XDMF does not support a 1D geometry "X", so need
+    // to provide some dummy Y and Z values.  Using the "X_Y_Z"
+    // geometry the Y and Z values can be supplied as separate
+    // datasets, here in plain text (though it could be done in HDF5
+    // too).
+
+    // Cannot write HDF5 here, as we are only running on rank 0, and
+    // will deadlock.
+
+    std::string dummy_zeros;
+    dummy_zeros.reserve(2*num_total_vertices);
+    for (std::size_t i = 0; i < num_total_vertices; ++i)
+      dummy_zeros += "0 ";
+
+    pugi::xml_node xdmf_geom_1 = xdmf_geometry.append_child("DataItem");
+    xdmf_geom_1.append_attribute("Format") = "XML";
+    geom_dim = boost::lexical_cast<std::string>(num_total_vertices) + " 1" ;
+    xdmf_geom_1.append_attribute("Dimensions") = geom_dim.c_str();
+    xdmf_geom_1.append_child(pugi::node_pcdata).set_value(dummy_zeros.c_str());
+
+    pugi::xml_node xdmf_geom_2 = xdmf_geometry.append_child("DataItem");
+    xdmf_geom_2.append_attribute("Format") = "XML";
+    geom_dim = boost::lexical_cast<std::string>(num_total_vertices) + " 1" ;
+    xdmf_geom_2.append_attribute("Dimensions") = geom_dim.c_str();
+    xdmf_geom_2.append_child(pugi::node_pcdata).set_value(dummy_zeros.c_str());
+  }
+
+  xdmf_geom_data.append_child(pugi::node_pcdata).set_value(geometry_reference.c_str());
+}
+//----------------------------------------------------------------------------
+void XDMFFile::output_xml(const double time_step, const bool vertex_data,
+                          const std::size_t cell_dim,
+                          const std::size_t num_global_cells,
+                          const std::size_t gdim,
+                          const std::size_t num_total_vertices,
+                          const std::size_t value_rank,
+                          const std::size_t padded_value_size,
+                          const std::string name,
+                          const std::string dataset_name) const
+{
+  // Working data structure for formatting XML file
+  std::string s;
+  pugi::xml_document xml_doc;
+  pugi::xml_node xdmf_timegrid;
+  pugi::xml_node xdmf_timedata;
+
+  if (counter == 0)
+  {
+    // First time step - create document template, adding a mesh and
+    // an empty time-series
+    xml_doc.append_child(pugi::node_doctype).set_value("Xdmf SYSTEM \"Xdmf.dtd\" []");
+    pugi::xml_node xdmf = xml_doc.append_child("Xdmf");
+    xdmf.append_attribute("Version") = "2.0";
+    xdmf.append_attribute("xmlns:xi") = "http://www.w3.org/2001/XInclude";
+    pugi::xml_node xdmf_domain = xdmf.append_child("Domain");
+
+    //  /Xdmf/Domain/Grid - actually a TimeSeries, not a spatial grid
+    xdmf_timegrid = xdmf_domain.append_child("Grid");
+    xdmf_timegrid.append_attribute("Name") = "TimeSeries";
+    xdmf_timegrid.append_attribute("GridType") = "Collection";
+    xdmf_timegrid.append_attribute("CollectionType") = "Temporal";
+
+    //  /Xdmf/Domain/Grid/Time
+    pugi::xml_node xdmf_time = xdmf_timegrid.append_child("Time");
+    xdmf_time.append_attribute("TimeType") = "List";
+    xdmf_timedata = xdmf_time.append_child("DataItem");
+    xdmf_timedata.append_attribute("Format") = "XML";
+    xdmf_timedata.append_attribute("Dimensions") = "1";
+    xdmf_timedata.append_child(pugi::node_pcdata);
+  }
+  else
+  {
+    // Subsequent timestep - read in existing XDMF file
+    pugi::xml_parse_result result = xml_doc.load_file(_filename.c_str());
+    if (!result)
+    {
+      dolfin_error("XDMFFile.cpp",
+                   "write data to XDMF file",
+                   "XML parsing error when reading from existing file");
+    }
+
+    // Get data node
+    xdmf_timegrid = xml_doc.child("Xdmf").child("Domain").child("Grid");
+    dolfin_assert(xdmf_timegrid);
+
+    // Get time series node
+    xdmf_timedata = xdmf_timegrid.child("Time").child("DataItem");
+    dolfin_assert(xdmf_timedata);
+  }
+
+  //  Add a time step to the TimeSeries List
+  xdmf_timedata.attribute("Dimensions").set_value(static_cast<unsigned int>(counter + 1));
+  s = boost::lexical_cast<std::string>(xdmf_timedata.first_child().value())
+    + " " + boost::str((boost::format("%d") % time_step));
+  xdmf_timedata.first_child().set_value(s.c_str());
+
+  //   /Xdmf/Domain/Grid/Grid - the actual data for this timestep
+  pugi::xml_node xdmf_grid = xdmf_timegrid.append_child("Grid");
+  s = name + "_" + boost::lexical_cast<std::string>(counter);
+  xdmf_grid.append_attribute("Name") = s.c_str();
+  xdmf_grid.append_attribute("GridType") = "Uniform";
+
+  // Grid/Topology
+  pugi::xml_node xdmf_topology = xdmf_grid.append_child("Topology");
+
+  // For XDMF file need to remove path from filename so that xdmf
+  // filenames such as "results/data.xdmf" correctly index h5 files in
+  // the same directory
+
+  std::string topology_reference = current_mesh_name + "/topology";
+  xml_mesh_topology(xdmf_topology, cell_dim, num_global_cells,
+                    topology_reference);
+
+  // Grid/Geometry
+  pugi::xml_node xdmf_geometry = xdmf_grid.append_child("Geometry");
+  std::string geometry_reference = current_mesh_name + "/coordinates";
+  xml_mesh_geometry(xdmf_geometry, num_total_vertices, gdim,
+                    geometry_reference);
+
+  // Grid/Attribute (Function value data)
+  pugi::xml_node xdmf_values = xdmf_grid.append_child("Attribute");
+  xdmf_values.append_attribute("Name") = name.c_str();
+
+  if (value_rank == 0)
+    xdmf_values.append_attribute("AttributeType") = "Scalar";
+  else if (value_rank == 1)
+    xdmf_values.append_attribute("AttributeType") = "Vector";
+  else if (value_rank == 2)
+    xdmf_values.append_attribute("AttributeType") = "Tensor";
+
+  if (vertex_data)
+    xdmf_values.append_attribute("Center") = "Node";
+  else
+    xdmf_values.append_attribute("Center") = "Cell";
+
+  pugi::xml_node xdmf_data = xdmf_values.append_child("DataItem");
+  xdmf_data.append_attribute("Format") = "HDF";
+
+  const std::size_t num_total_entities
+    = vertex_data ? num_total_vertices : num_global_cells;
+
+  s = boost::lexical_cast<std::string>(num_total_entities) + " "
+    + boost::lexical_cast<std::string>(padded_value_size);
+
+  xdmf_data.append_attribute("Dimensions") = s.c_str();
+
+  boost::filesystem::path p(hdf5_filename);  
+  s = p.filename().string() + ":" + dataset_name;
+  xdmf_data.append_child(pugi::node_pcdata).set_value(s.c_str());
+
+  // Write XML file
+  xml_doc.save_file(_filename.c_str(), "  ");
+}
+//----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/io/XDMFFile.h b/dolfin/io/XDMFFile.h
new file mode 100644
index 0000000..d60206d
--- /dev/null
+++ b/dolfin/io/XDMFFile.h
@@ -0,0 +1,163 @@
+// Copyright (C) 2012 Chris N. Richardson and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2012
+
+#ifndef __DOLFIN_XDMFFILE_H
+#define __DOLFIN_XDMFFILE_H
+
+#ifdef HAS_HDF5
+
+#include <memory>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Variable.h>
+#include "GenericFile.h"
+
+namespace pugi
+{
+  class xml_node;
+}
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Function;
+  class HDF5File;
+  class Mesh;
+  template<typename T> class MeshFunction;
+  class Point;
+
+  /// This class supports the output of meshes and functions in XDMF
+  /// (http://www.xdmf.org) format. It creates an XML file that describes
+  /// the data and points to a HDF5 file that stores the actual problem
+  /// data. Output of data in parallel is supported.
+  ///
+  /// XDMF is not suitable for checkpointing as it may decimate
+  /// some data.
+
+  class XDMFFile : public GenericFile, public Variable
+  {
+  public:
+
+    /// Constructor
+    XDMFFile(MPI_Comm comm, const std::string filename);
+
+    /// Destructor
+    ~XDMFFile();
+
+    /// Save a mesh for visualisation, with e.g. ParaView. Creates a HDF5
+    /// file to store the mesh, and a related XDMF file with metadata.
+    void operator<< (const Mesh& mesh);
+
+    /// Read in a mesh from the associated HDF5 file,
+    /// optionally using stored partitioning, if possible
+    /// when the same number of processes are being used.
+    void read(Mesh& mesh, bool use_partition_from_file);
+
+    /// Read in a mesh from the associated HDF5 file
+    void operator>> (Mesh& mesh);
+
+    /// Save a Function to XDMF/HDF5 files for visualisation.
+    void operator<< (const Function& u);
+
+    /// Save Function + time stamp to file
+    void operator<< (const std::pair<const Function*, double> ut);
+
+    /// Save MeshFunction to file
+    void operator<< (const MeshFunction<bool>& meshfunction);
+    void operator<< (const MeshFunction<int>& meshfunction);
+    void operator<< (const MeshFunction<std::size_t>& meshfunction);
+    void operator<< (const MeshFunction<double>& meshfunction);
+
+    /// Save a cloud of points to file
+    void write(const std::vector<Point>& points);
+
+    /// Save a cloud of points, with scalar values
+    void write(const std::vector<Point>& points,
+               const std::vector<double>& values);
+
+    using GenericFile::write;
+
+    /// Read first MeshFunction from file
+    void operator>> (MeshFunction<bool>& meshfunction);
+    void operator>> (MeshFunction<int>& meshfunction);
+    void operator>> (MeshFunction<std::size_t>& meshfunction);
+    void operator>> (MeshFunction<double>& meshfunction);
+
+  private:
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+    // HDF5 data file
+    std::unique_ptr<HDF5File> hdf5_file;
+
+    // HDF5 filename
+    std::string hdf5_filename;
+
+    // HDF5 file mode (r/w)
+    std::string hdf5_filemode;
+
+    // Generic MeshFunction writer
+    template<typename T>
+      void write_mesh_function(const MeshFunction<T>& meshfunction);
+
+    // Generic MeshFunction reader
+    template<typename T>
+      void read_mesh_function(MeshFunction<T>& meshfunction);
+
+    // Write XML description of point clouds, with value_size = 0, 1 or 3
+    // (for either no point data, scalar, or vector)
+    void write_point_xml(const std::string dataset_name,
+                         const std::size_t num_global_points,
+                         const unsigned int value_size);
+
+    // Write XML description for Function and MeshFunction output
+    // updating time-series if need be
+    void output_xml(const double time_step, const bool vertex_data,
+                    const std::size_t cell_dim,
+                    const std::size_t num_global_cells,
+                    const std::size_t gdim,
+                    const std::size_t num_total_vertices,
+                    const std::size_t value_rank,
+                    const std::size_t padded_value_size,
+                    const std::string name,
+                    const std::string dataset_name) const;
+
+    // Helper function to add topology reference to XDMF XML file
+    void xml_mesh_topology(pugi::xml_node& xdmf_topology,
+                           const std::size_t cell_dim,
+                           const std::size_t num_global_cells,
+                           const std::string topology_dataset_name) const;
+
+    // Helper function to add geometry section to XDMF XML file
+    void xml_mesh_geometry(pugi::xml_node& xdmf_geometry,
+                           const std::size_t num_all_local_cells,
+                           const std::size_t gdim,
+                           const std::string geometry_dataset_name) const;
+
+    // Most recent mesh name
+    std::string current_mesh_name;
+  };
+}
+#endif
+#endif
diff --git a/dolfin/io/XMLArray.h b/dolfin/io/XMLArray.h
new file mode 100644
index 0000000..ab6ac03
--- /dev/null
+++ b/dolfin/io/XMLArray.h
@@ -0,0 +1,120 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2006-07-02
+// Last changed: 2011-11-14
+
+#ifndef __XMLARRAY_H
+#define __XMLARRAY_H
+
+#include <ostream>
+#include <string>
+#include <vector>
+#include <boost/format.hpp>
+#include <boost/lexical_cast.hpp>
+#include "dolfin/common/Array.h"
+#include "dolfin/log/log.h"
+#include "pugixml.hpp"
+
+namespace pugi
+{
+  class xml_node;
+}
+
+namespace dolfin
+{
+
+  class XMLArray
+  {
+  public:
+
+    // Read XML vector. Vector must have correct size.
+    template<typename T>
+    static void read(std::vector<T>& x, const pugi::xml_node xml_dolfin);
+
+    /// Write the XML file
+    template<typename T>
+    static void write(const std::vector<T>& x, const std::string type,
+                      pugi::xml_node xml_node);
+
+  };
+
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void XMLArray::read(std::vector<T>& x, const pugi::xml_node xml_node)
+  {
+    // Check that we have a XML Array
+    const pugi::xml_node array = xml_node.child("array");
+    if (!array)
+    {
+      dolfin_error("XMLArray.h",
+                   "read array from XML file",
+                   "Unable to find <array> tag in XML file");
+    }
+
+    // Get size and type
+    const std::size_t size = array.attribute("size").as_uint();
+    const std::string type  = array.attribute("type").value();
+    if (type != "double")
+    {
+      dolfin_error("XMLArray.h",
+                   "read array from XML file",
+                   "XML I/O of Array objects only supported when the value type is 'double'");
+    }
+
+    // Iterate over array entries
+    x.resize(size);
+    Array<std::size_t> indices(size);
+    for (pugi::xml_node_iterator it = array.begin(); it != array.end(); ++it)
+    {
+      const std::size_t index = it->attribute("index").as_uint();
+      const double value = it->attribute("value").as_double();
+      dolfin_assert(index < size);
+      indices[index] = index;
+      x[index] = value;
+    }
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void XMLArray::write(const std::vector<T>& x, const std::string type,
+                       pugi::xml_node xml_node)
+  {
+    // Add array node
+    pugi::xml_node array_node = xml_node.append_child("array");
+
+    // Add attributes
+    const std::size_t size = x.size();
+    array_node.append_attribute("type") = type.c_str();
+    array_node.append_attribute("size") = (unsigned int) size;
+
+    // Add data
+    for (std::size_t i = 0; i < size; ++i)
+    {
+      pugi::xml_node element_node = array_node.append_child("element");
+      element_node.append_attribute("index") = (unsigned int) i;
+      // NOTE: Casting to a string to avoid loss of precision when
+      //       pugixml performs double-to-char conversion
+      element_node.append_attribute("value")
+        = boost::str(boost::format("%.15e") % x[i]).c_str();
+    }
+  }
+  //---------------------------------------------------------------------------
+}
+
+#endif
diff --git a/dolfin/io/XMLFile.cpp b/dolfin/io/XMLFile.cpp
new file mode 100644
index 0000000..4ddd58d
--- /dev/null
+++ b/dolfin/io/XMLFile.cpp
@@ -0,0 +1,455 @@
+// Copyright (C) 2009-2011 Ola Skavhaug and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2009-03-03
+// Last changed: 2013-05-21
+
+#include <iostream>
+#include <fstream>
+
+#include <boost/filesystem.hpp>
+#include <boost/iostreams/filtering_stream.hpp>
+#include <boost/iostreams/filtering_streambuf.hpp>
+#include <boost/iostreams/copy.hpp>
+#include <boost/iostreams/filter/gzip.hpp>
+
+#include "pugixml.hpp"
+
+#include <dolfin/common/Array.h>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/mesh/LocalMeshValueCollection.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include <dolfin/common/Timer.h>
+#include "XMLFunctionData.h"
+#include "XMLLocalMeshSAX.h"
+#include "XMLMesh.h"
+#include "XMLMeshFunction.h"
+#include "XMLMeshValueCollection.h"
+#include "XMLParameters.h"
+#include "XMLVector.h"
+#include "XMLFile.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+XMLFile::XMLFile(MPI_Comm mpi_comm, const std::string filename)
+  : GenericFile(filename, "XML"), _mpi_comm(mpi_comm)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+XMLFile::XMLFile(std::ostream& s) : GenericFile("", "XML"),
+                                    outstream(&s, NoDeleter()),
+                                    _mpi_comm(MPI_COMM_SELF)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+XMLFile::~XMLFile()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator>> (Mesh& input_mesh)
+{
+  if (MPI::size(input_mesh.mpi_comm()) == 1)
+  {
+    // Create XML doc and get DOLFIN node
+    pugi::xml_document xml_doc;
+    load_xml_doc(xml_doc);
+    const pugi::xml_node dolfin_node = get_dolfin_xml_node(xml_doc);
+
+    // Read mesh
+    XMLMesh::read(input_mesh, dolfin_node);
+  }
+  else
+  {
+    // Read local mesh data
+    Timer t("XML: readSAX");
+    LocalMeshData local_mesh_data(_mpi_comm);
+    XMLLocalMeshSAX xml_object(_mpi_comm, local_mesh_data, _filename);
+    xml_object.read();
+    t.stop();
+
+    // Partition and build mesh
+    MeshPartitioning::build_distributed_mesh(input_mesh, local_mesh_data);
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator<< (const Mesh& output_mesh)
+{
+  if (MPI::size(output_mesh.mpi_comm()) > 1)
+  {
+    dolfin_error("XMLFile.cpp",
+                 "write mesh to XML file in parallel",
+                 "Parallel XML mesh output is not supported. Use HDF5 format instead");
+  }
+
+  pugi::xml_document doc;
+  pugi::xml_node node = write_dolfin(doc);
+  XMLMesh::write(output_mesh, node);
+  save_xml_doc(doc);
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator>> (LocalMeshData& input_data)
+{
+  XMLLocalMeshSAX xml_object(_mpi_comm, input_data, _filename);
+  xml_object.read();
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator<< (const LocalMeshData& output_data)
+{
+  dolfin_error("XMLFile.cpp",
+               "write local mesh data to XML file",
+               "Not implemented");
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator>> (GenericVector& input)
+{
+  pugi::xml_document xml_doc;
+  pugi::xml_node dolfin_node(0);
+
+  // Read vector size
+  std::size_t size = 0;
+  if (MPI::rank(_mpi_comm) == 0)
+  {
+    load_xml_doc(xml_doc);
+    dolfin_node = get_dolfin_xml_node(xml_doc);
+    size = XMLVector::read_size(dolfin_node);
+  }
+  MPI::broadcast(_mpi_comm, size);
+
+  // Resize if necessary
+  const std::size_t input_vector_size = input.size();
+  const std::size_t num_proc = MPI::size(_mpi_comm);
+  if (num_proc > 1 && input_vector_size != size)
+  {
+    warning("Resizing parallel vector. Default partitioning will be used. \
+To control distribution, initialize vector size before reading from file.");
+  }
+  if (input.size() != size)
+    input.init(_mpi_comm, size);
+
+  // Read vector on root process
+  if (MPI::rank(_mpi_comm) == 0)
+  {
+    dolfin_assert(dolfin_node);
+    XMLVector::read(input, dolfin_node);
+  }
+
+  // Finalise
+  input.apply("insert");
+}
+//-----------------------------------------------------------------------------
+void XMLFile::read_vector(std::vector<double>& input,
+                          std::vector<dolfin::la_index>& indices)
+{
+  // Create XML doc and get DOLFIN node
+  pugi::xml_document xml_doc;
+  load_xml_doc(xml_doc);
+  const pugi::xml_node dolfin_node = get_dolfin_xml_node(xml_doc);
+
+  // Read parameters
+  XMLVector::read(input, indices, dolfin_node);
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator<< (const GenericVector& output)
+{
+  // Open file on process 0 for distributed objects and on all processes
+  // for local objects
+  if (MPI::rank(_mpi_comm) == 0)
+  {
+    pugi::xml_document doc;
+    pugi::xml_node node = write_dolfin(doc);
+    XMLVector::write(output, node, true);
+    save_xml_doc(doc);
+  }
+  else
+  {
+    pugi::xml_node node(0);
+    XMLVector::write(output, node, false);
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator>> (Parameters& input)
+{
+  // Create XML doc and get DOLFIN node
+  pugi::xml_document xml_doc;
+  load_xml_doc(xml_doc);
+  const pugi::xml_node dolfin_node = get_dolfin_xml_node(xml_doc);
+
+  // Read parameters
+  XMLParameters::read(input, dolfin_node);
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator<< (const Parameters& output)
+{
+  if (MPI::rank(_mpi_comm) == 0)
+  {
+    pugi::xml_document doc;
+    pugi::xml_node node = write_dolfin(doc);
+    XMLParameters::write(output, node);
+    save_xml_doc(doc);
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator>>(Function& input)
+{
+  // Create XML doc and get DOLFIN node
+  pugi::xml_document xml_doc;
+  pugi::xml_node dolfin_node(0);
+  if (MPI::rank(_mpi_comm) == 0)
+  {
+    load_xml_doc(xml_doc);
+    dolfin_node = get_dolfin_xml_node(xml_doc);
+  }
+
+  // Read data
+  XMLFunctionData::read(input, dolfin_node);
+}
+//-----------------------------------------------------------------------------
+void XMLFile::operator<< (const Function& output)
+{
+  if (MPI::rank(_mpi_comm) == 0)
+  {
+    pugi::xml_document doc;
+    pugi::xml_node node = write_dolfin(doc);
+    XMLFunctionData::write(output, node);
+    save_xml_doc(doc);
+  }
+  else
+  {
+    pugi::xml_node node(0);
+    XMLFunctionData::write(output, node);
+  }
+}
+//-----------------------------------------------------------------------------
+template<typename T>
+void XMLFile::read_mesh_function(MeshFunction<T>& t,
+                                 const std::string type) const
+{
+  if (MPI::size(_mpi_comm) == 1)
+  {
+    pugi::xml_document xml_doc;
+    load_xml_doc(xml_doc);
+    pugi::xml_node dolfin_node = get_dolfin_xml_node(xml_doc);
+    XMLMeshFunction::read(t, type, dolfin_node);
+  }
+  else
+  {
+    // Read a MeshValueCollection on processs 0, then communicate to
+    // other procs
+    std::size_t dim = 0;
+    MeshValueCollection<T> mvc(t.mesh());
+    if (MPI::rank(_mpi_comm) == 0)
+    {
+      pugi::xml_document xml_doc;
+      load_xml_doc(xml_doc);
+      pugi::xml_node dolfin_node = get_dolfin_xml_node(xml_doc);
+      XMLMeshFunction::read(mvc, type, dolfin_node);
+      dim = mvc.dim();
+      MPI::broadcast(_mpi_comm, dim);
+    }
+    else
+    {
+      MPI::broadcast(_mpi_comm, dim);
+      mvc.init(dim);
+    }
+
+    // Broadcast and set dimension
+
+    // Build local data
+    LocalMeshValueCollection<T> local_data(mvc, dim);
+
+    // Distribute MeshValueCollection
+    MeshPartitioning::build_distributed_value_collection<T>(mvc, local_data,
+                                                            *t.mesh());
+
+    // Assign collection to mesh function (this is a local operation)
+    t = mvc;
+  }
+}
+//-----------------------------------------------------------------------------
+template<typename T>
+void XMLFile::write_mesh_function(const MeshFunction<T>& t,
+                                  const std::string type)
+{
+  not_working_in_parallel("MeshFunction XML output in parallel not yet supported.");
+
+  pugi::xml_document xml_doc;
+  pugi::xml_node node = write_dolfin(xml_doc);
+  XMLMeshFunction::write(t, type, node, false);
+  save_xml_doc(xml_doc);
+}
+//-----------------------------------------------------------------------------
+template<typename T>
+void XMLFile::read_mesh_value_collection(MeshValueCollection<T>& t,
+                                         const std::string type) const
+{
+  if (MPI::size(_mpi_comm) == 1)
+  {
+    pugi::xml_document xml_doc;
+    load_xml_doc(xml_doc);
+    const pugi::xml_node dolfin_node = get_dolfin_xml_node(xml_doc);
+    XMLMeshValueCollection::read(t, type, dolfin_node);
+  }
+  else
+  {
+    // Read file on process 0
+    MeshValueCollection<T> tmp_collection(t.mesh());
+    if (MPI::rank(_mpi_comm) == 0)
+    {
+      pugi::xml_document xml_doc;
+      load_xml_doc(xml_doc);
+      const pugi::xml_node dolfin_node = get_dolfin_xml_node(xml_doc);
+      XMLMeshValueCollection::read(tmp_collection, type, dolfin_node);
+      std::size_t dim = (tmp_collection.dim());
+      MPI::broadcast(_mpi_comm, dim);
+    }
+    else
+    {
+      std::size_t dim = 0;
+      MPI::broadcast(_mpi_comm, dim);
+      tmp_collection.init(dim);
+    }
+
+    // Create local data and build value collectio
+    LocalMeshValueCollection<T> local_data(tmp_collection,
+                                           tmp_collection.dim());
+
+    // Build mesh value collection
+    dolfin_assert(t.mesh());
+    t.init(tmp_collection.dim());
+    MeshPartitioning::build_distributed_value_collection(t, local_data,
+                                                         *t.mesh());
+  }
+}
+//-----------------------------------------------------------------------------
+template<typename T>
+void XMLFile::write_mesh_value_collection(const MeshValueCollection<T>& t,
+                                          const std::string type)
+{
+  not_working_in_parallel("MeshValueCollection XML output in parallel not yet supported.");
+
+  pugi::xml_document xml_doc;
+  pugi::xml_node node = write_dolfin(xml_doc);
+  XMLMeshValueCollection::write(t, type, node);
+  save_xml_doc(xml_doc);
+}
+//-----------------------------------------------------------------------------
+void XMLFile::load_xml_doc(pugi::xml_document& xml_doc) const
+{
+  // Create XML parser result
+  pugi::xml_parse_result result;
+
+  // Get file path and extension
+  const boost::filesystem::path path(_filename);
+  const std::string extension = boost::filesystem::extension(path);
+
+  // FIXME: Check that file exists
+  if (!boost::filesystem::is_regular_file(_filename))
+  {
+    dolfin_error("XMLFile.cpp",
+                 "read data from XML file",
+                 "Unable to open file \"%s\"", _filename.c_str());
+  }
+
+  // Load xml file (unzip if necessary) into parser
+  if (extension == ".gz")
+  {
+    // Decompress file
+    std::ifstream
+      file(_filename.c_str(), std::ios_base::in|std::ios_base::binary);
+    boost::iostreams::filtering_streambuf<boost::iostreams::input> in;
+    in.push(boost::iostreams::gzip_decompressor());
+    in.push(file);
+
+    // FIXME: Is this the best way to do it?
+    std::stringstream dst;
+    boost::iostreams::copy(in, dst);
+
+    // Load data
+    result = xml_doc.load(dst);
+  }
+  else
+    result = xml_doc.load_file(_filename.c_str());
+
+  // Check the XML file was opened successfully
+  if (!result)
+  {
+    dolfin_error("XMLFile.cpp",
+                 "read data from XML file",
+                 "Error while parsing XML");
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLFile::save_xml_doc(const pugi::xml_document& xml_doc) const
+{
+  if (outstream)
+    xml_doc.save(*outstream, "  ");
+  else
+  {
+    // Compress if filename has extension '.gz'
+    const boost::filesystem::path path(_filename);
+    const std::string extension = boost::filesystem::extension(path);
+    if (extension == ".gz")
+    {
+      std::stringstream xml_stream;
+      xml_doc.save(xml_stream, "  ");
+
+      std::ofstream
+        file(_filename.c_str(), std::ios_base::out | std::ios_base::binary);
+      boost::iostreams::filtering_streambuf<boost::iostreams::output> out;
+      out.push(boost::iostreams::gzip_compressor());
+      out.push(file);
+      boost::iostreams::copy(xml_stream, out);
+    }
+    else
+      xml_doc.save_file(_filename.c_str(), "  ");
+  }
+}
+//-----------------------------------------------------------------------------
+const pugi::xml_node
+XMLFile::get_dolfin_xml_node(pugi::xml_document& xml_doc) const
+{
+  // Check that we have a DOLFIN XML file
+  const pugi::xml_node dolfin_node = xml_doc.child("dolfin");
+  if (!dolfin_node)
+  {
+    dolfin_error("XMLFile.cpp",
+                 "read data from XML file",
+                 "Not a DOLFIN XML file");
+  }
+  return dolfin_node;
+}
+//-----------------------------------------------------------------------------
+pugi::xml_node XMLFile::write_dolfin(pugi::xml_document& xml_doc)
+{
+  pugi::xml_node node = xml_doc.append_child("dolfin");
+  node.append_attribute("xmlns:dolfin") = "http://fenicsproject.org";
+  return node;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/XMLFile.h b/dolfin/io/XMLFile.h
new file mode 100644
index 0000000..09f91f8
--- /dev/null
+++ b/dolfin/io/XMLFile.h
@@ -0,0 +1,174 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2011.
+//
+// First added:  2009-03-03
+// Last changed: 2011-09-17
+
+#ifndef __XMLFILE_H
+#define __XMLFILE_H
+
+#include <map>
+#include <ostream>
+#include <string>
+#include <vector>
+#include <memory>
+#include <dolfin/common/types.h>
+#include <dolfin/common/MPI.h>
+#include "GenericFile.h"
+
+namespace pugi
+{
+  class xml_document;
+  class xml_node;
+}
+
+namespace dolfin
+{
+
+  class Function;
+  class GenericVector;
+  class LocalMeshData;
+  class Mesh;
+  class Parameters;
+  template<typename T> class Array;
+  template<typename T> class MeshFunction;
+  template<typename T> class MeshValueCollection;
+
+  class XMLFile : public GenericFile
+  {
+  public:
+
+    /// Constructor
+    XMLFile(MPI_Comm mpi_comm, const std::string filename);
+
+    /// Constructor from a stream
+    XMLFile(std::ostream& s);
+
+    ~XMLFile();
+
+    // Mesh
+    void operator>> (Mesh& input);
+    void operator<< (const Mesh& output);
+
+    // LocalMeshData
+    void operator>> (LocalMeshData& input);
+    void operator<< (const LocalMeshData& output);
+
+    // Vector
+    void operator>> (GenericVector& input);
+    void read_vector(std::vector<double>& input,
+                     std::vector<dolfin::la_index>& indices);
+    void operator<< (const GenericVector& output);
+
+    // Parameters
+    void operator>> (Parameters& input);
+    void operator<< (const Parameters& output);
+
+    // Function data
+    void operator>>(Function& input);
+    void operator<<(const Function& output);
+
+    // MeshFunction (uint)
+    void operator>> (MeshFunction<std::size_t>& input)
+    { read_mesh_function(input, "uint"); }
+    void operator<< (const MeshFunction<std::size_t>& output)
+    { write_mesh_function(output, "uint"); }
+
+    // MeshFunction (int)
+    void operator>> (MeshFunction<int>& input)
+    { read_mesh_function(input, "int"); }
+    void operator<< (const MeshFunction<int>& output)
+    { write_mesh_function(output, "int"); }
+
+    // MeshFunction (double)
+    void operator>> (MeshFunction<double>& input)
+    { read_mesh_function(input, "double"); }
+    void operator<< (const MeshFunction<double>& output)
+    { write_mesh_function(output, "double"); }
+
+    // MeshFunction (bool)
+    void operator>> (MeshFunction<bool>& input)
+    { read_mesh_function(input, "bool"); }
+    void operator<< (const MeshFunction<bool>& input)
+    { write_mesh_function(input, "bool"); }
+
+    // MeshValueCollection (std::size_t)
+    void operator>> (MeshValueCollection<std::size_t>& input)
+    { read_mesh_value_collection(input, "uint"); }
+    void operator<< (const MeshValueCollection<std::size_t>& output)
+    { write_mesh_value_collection(output, "uint"); }
+
+    // MeshValueCollection (int)
+    void operator>> (MeshValueCollection<int>& input)
+    { read_mesh_value_collection(input, "int"); }
+    void operator<< (const MeshValueCollection<int>& output)
+    { write_mesh_value_collection(output, "int"); }
+
+    // MeshValueCollection (double)
+    void operator>> (MeshValueCollection<double>& input)
+    { read_mesh_value_collection(input, "double"); }
+    void operator<< (const MeshValueCollection<double>& output)
+    { write_mesh_value_collection(output, "double"); }
+
+    // MeshValueCollection (bool)
+    void operator>> (MeshValueCollection<bool>& input)
+    { read_mesh_value_collection(input, "bool"); }
+    void operator<< (const MeshValueCollection<bool>& input)
+    { write_mesh_value_collection(input, "bool"); }
+
+  private:
+
+    // Read MeshFunction
+    template<typename T> void read_mesh_function(MeshFunction<T>& t,
+                                                 const std::string type) const;
+
+    // Write MeshFunction
+    template<typename T> void write_mesh_function(const MeshFunction<T>& t,
+                                                  const std::string type);
+
+    // Read MeshValueCollection
+    template<typename T>
+    void read_mesh_value_collection(MeshValueCollection<T>& t,
+                                    const std::string type) const;
+
+    // Write MeshValueCollection
+    template<typename T>
+    void write_mesh_value_collection(const MeshValueCollection<T>& t,
+                                     const std::string type);
+
+    // Load/open XML doc (from file)
+    void load_xml_doc(pugi::xml_document& xml_doc) const;
+
+    // Save XML doc (to file or stream)
+    void save_xml_doc(const pugi::xml_document& xml_doc) const;
+
+    // Get DOLFIN XML node
+    const pugi::xml_node get_dolfin_xml_node(pugi::xml_document& xml_doc) const;
+
+    static pugi::xml_node write_dolfin(pugi::xml_document& doc);
+
+    std::shared_ptr<std::ostream> outstream;
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+  };
+
+}
+#endif
diff --git a/dolfin/io/XMLFunctionData.cpp b/dolfin/io/XMLFunctionData.cpp
new file mode 100644
index 0000000..740c770
--- /dev/null
+++ b/dolfin/io/XMLFunctionData.cpp
@@ -0,0 +1,318 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2012
+//
+// First added:  2011-09-27
+// Last changed: 2012-04-04
+
+#include <algorithm>
+#include <iomanip>
+#include <iostream>
+#include <iterator>
+#include <string>
+#include <utility>
+#include <vector>
+#include <boost/lexical_cast.hpp>
+#include "pugixml.hpp"
+
+#include "dolfin/common/Array.h"
+#include "dolfin/common/MPI.h"
+#include "dolfin/fem/GenericDofMap.h"
+#include "dolfin/function/Function.h"
+#include "dolfin/function/FunctionSpace.h"
+#include "dolfin/la/GenericVector.h"
+#include "dolfin/log/log.h"
+#include "dolfin/mesh/Mesh.h"
+#include "dolfin/mesh/MeshTopology.h"
+#include "XMLFunctionData.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void XMLFunctionData::read(Function& u, const pugi::xml_node xml_dolfin)
+{
+  dolfin_assert(u.vector());
+  GenericVector& vector = *u.vector();
+  dolfin_assert(u.function_space());
+  const FunctionSpace& V = *u.function_space();
+
+  dolfin_assert(V.mesh());
+  const Mesh& mesh = *V.mesh();
+
+  std::vector<std::pair<dolfin::la_index, dolfin::la_index> >
+    global_to_cell_dof;
+  std::vector<double> x;
+  std::vector<dolfin::la_index> indices;
+
+  const std::size_t num_dofs = V.dim();
+
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Check that we have a XML function data
+    const pugi::xml_node xml_function_data_node
+      = xml_dolfin.child("function_data");
+    if (!xml_function_data_node)
+    {
+      dolfin_error("XMLFunctionData.cpp",
+                   "read function from XML file",
+                   "Not a DOLFIN Function XML file");
+    }
+
+    // Check size
+    const std::size_t size = xml_function_data_node.attribute("size").as_uint();
+    if (size != num_dofs)
+    {
+      dolfin_error("XMLFunctionData.cpp",
+                   "read function from XML file",
+                   "The number of degrees of freedom (%d) does not match the "
+                   "dimension of the function space (%d)",
+                   size, num_dofs);
+    }
+    dolfin_assert(size == vector.size());
+
+    global_to_cell_dof.resize(num_dofs);
+    x.resize(num_dofs);
+    indices.resize(num_dofs);
+
+    // Iterate over each cell entry
+    for (pugi::xml_node_iterator it = xml_function_data_node.begin();
+         it != xml_function_data_node.end(); ++it)
+    {
+      const std::string name = it->name();
+      dolfin_assert(name == "dof");
+
+      const std::size_t global_index = it->attribute("index").as_uint();
+      const double value = it->attribute("value").as_double();
+      const std::size_t cell_index = it->attribute("cell_index").as_uint();
+      const std::size_t local_dof_index
+        = it->attribute("cell_dof_index").as_uint();
+
+      global_to_cell_dof[global_index].first = cell_index;
+      global_to_cell_dof[global_index].second = local_dof_index;
+      x[global_index] = value;
+    }
+  }
+
+  // Build current dof map based on function space V
+  std::vector<std::vector<dolfin::la_index> > dof_map;
+  build_dof_map(dof_map, V);
+
+  // Map old-to-current vector positions
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    for (std::size_t i = 0; i < num_dofs; ++i)
+    {
+      // Indices for data from file
+      dolfin_assert(i < global_to_cell_dof.size());
+      const std::size_t global_cell_index = global_to_cell_dof[i].first;
+      const std::size_t local_dof_index   = global_to_cell_dof[i].second;
+
+      // Local dof vector for V
+      const std::vector<dolfin::la_index>& dofs = dof_map[global_cell_index];
+      dolfin_assert(local_dof_index < dofs.size());
+      const dolfin::la_index new_index = dofs[local_dof_index];
+
+      // File to new
+      indices[i] = new_index;
+    }
+
+    vector.set(x.data(), x.size(), indices.data());
+  }
+
+  // Finalise vector
+  vector.apply("insert");
+}
+//-----------------------------------------------------------------------------
+void XMLFunctionData::write(const Function& u, pugi::xml_node xml_node)
+{
+  // Check that we don't have a sub-function
+  if(!u.function_space()->component().empty())
+  {
+    dolfin_error("XMLFunctionData.cpp",
+                 "write Function to XML file",
+                 "Cannot write sub-Functions (views) to XML files");
+  }
+
+  // Get function space
+  dolfin_assert(u.function_space());
+  const FunctionSpace& V = *u.function_space();
+
+  dolfin_assert(V.mesh());
+  const Mesh& mesh = *V.mesh();
+
+  std::vector<double> x;
+  dolfin_assert(u.vector());
+  if (MPI::size(mesh.mpi_comm()) > 1)
+    u.vector()->gather_on_zero(x);
+  else
+    u.vector()->get_local(x);
+
+  // Build map
+  std::vector<std::vector<std::pair<dolfin::la_index, dolfin::la_index> > >
+    global_dof_to_cell_dof;
+  build_global_to_cell_dof(global_dof_to_cell_dof, V);
+
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    // Add vector node
+    pugi::xml_node function_node = xml_node.append_child("function_data");
+    function_node.append_attribute("size") = (unsigned int) x.size();
+
+    // Add data
+    for (std::size_t i = 0; i < x.size(); ++i)
+    {
+      dolfin_assert(i < global_dof_to_cell_dof.size());
+
+      pugi::xml_node dof_node = function_node.append_child("dof");
+      dof_node.append_attribute("index") = (unsigned int) i;
+      dof_node.append_attribute("value")
+        = boost::lexical_cast<std::string>(x[i]).c_str();
+      dof_node.append_attribute("cell_index")
+        = (unsigned int) global_dof_to_cell_dof[i][0].first;
+      dof_node.append_attribute("cell_dof_index")
+        = (unsigned int) global_dof_to_cell_dof[i][0].second;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLFunctionData::build_global_to_cell_dof(
+  std::vector<std::vector<std::pair<dolfin::la_index, dolfin::la_index> > >&
+  global_dof_to_cell_dof,
+  const FunctionSpace& V)
+{
+  // Get mesh and dofmap
+  dolfin_assert(V.mesh());
+  dolfin_assert(V.dofmap());
+  const Mesh& mesh = *V.mesh();
+  const GenericDofMap& dofmap = *V.dofmap();
+
+  std::vector<dolfin::la_index> local_dofmap;
+  if (MPI::size(mesh.mpi_comm()) > 1)
+  {
+    // Check that local-to-global cell numbering is available
+    const std::size_t D = mesh.topology().dim();
+    dolfin_assert(mesh.topology().have_global_indices(D));
+
+    // Build dof map data with global cell indices
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const std::size_t local_cell_index = cell->index();
+      const std::size_t global_cell_index = cell->global_index();
+      local_dofmap.push_back(global_cell_index);
+      local_dofmap.push_back(dofmap.cell_dofs(local_cell_index).size());
+      local_dofmap.insert(local_dofmap.end(),
+                          dofmap.cell_dofs(local_cell_index).begin(),
+                          dofmap.cell_dofs(local_cell_index).end());
+    }
+  }
+  else
+  {
+    // Build dof map data
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const std::size_t local_cell_index = cell->index();
+      local_dofmap.push_back(local_cell_index);
+      local_dofmap.push_back(dofmap.cell_dofs(local_cell_index).size());
+      local_dofmap.insert(local_dofmap.end(),
+                          dofmap.cell_dofs(local_cell_index).begin(),
+                          dofmap.cell_dofs(local_cell_index).end());
+    }
+  }
+
+  // Gather dof map data on root process
+  std::vector<dolfin::la_index> gathered_dofmap;
+  MPI::gather(mesh.mpi_comm(), local_dofmap, gathered_dofmap);
+
+  // Build global dof - (global cell, local dof) map on root process
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    global_dof_to_cell_dof.resize(dofmap.global_dimension());
+    for (std::size_t i = 0; i < gathered_dofmap.size(); )
+    {
+      const std::size_t global_cell_index = gathered_dofmap[i++];
+      const std::size_t num_dofs     = gathered_dofmap[i++];
+      for (std::size_t j = 0; j < num_dofs; ++j)
+        global_dof_to_cell_dof[gathered_dofmap[i++]].push_back(std::make_pair(global_cell_index, j));
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLFunctionData::build_dof_map(
+  std::vector<std::vector<dolfin::la_index> >& dof_map,
+  const FunctionSpace& V)
+{
+  // Get mesh and dofmap
+  dolfin_assert(V.mesh());
+  dolfin_assert(V.dofmap());
+  const Mesh& mesh = *V.mesh();
+  const GenericDofMap& dofmap = *V.dofmap();
+
+  // Get global number of cells
+  const std::size_t num_cells = MPI::sum(mesh.mpi_comm(), mesh.num_cells());
+
+  std::vector<dolfin::la_index> local_dofmap;
+  if (MPI::size(mesh.mpi_comm()) > 1)
+  {
+    // Check that local-to-global cell numbering is available
+    const std::size_t D = mesh.topology().dim();
+    dolfin_assert(mesh.topology().have_global_indices(D));
+
+    // Build dof map data with global cell indices
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const std::size_t local_cell_index = cell->index();
+      const std::size_t global_cell_index = cell->global_index();
+      local_dofmap.push_back(global_cell_index);
+      local_dofmap.push_back(dofmap.cell_dofs(local_cell_index).size());
+      local_dofmap.insert(local_dofmap.end(),
+                          dofmap.cell_dofs(local_cell_index).begin(),
+                          dofmap.cell_dofs(local_cell_index).end());
+    }
+  }
+  else
+  {
+    // Build dof map data
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const std::size_t local_cell_index = cell->index();
+      local_dofmap.push_back(local_cell_index);
+      local_dofmap.push_back(dofmap.cell_dofs(local_cell_index).size());
+      local_dofmap.insert(local_dofmap.end(),
+                          dofmap.cell_dofs(local_cell_index).begin(),
+                          dofmap.cell_dofs(local_cell_index).end());
+    }
+  }
+
+  // Gather dof map data on root process
+  std::vector<dolfin::la_index> gathered_dofmap;
+  MPI::gather(mesh.mpi_comm(), local_dofmap, gathered_dofmap);
+
+  // Build global dofmap on root process
+  if (MPI::rank(mesh.mpi_comm()) == 0)
+  {
+    dof_map.resize(num_cells);
+    for (std::size_t i = 0; i < gathered_dofmap.size(); )
+    {
+      const std::size_t global_cell_index = gathered_dofmap[i++];
+      const std::size_t num_dofs     = gathered_dofmap[i++];
+      for (std::size_t j = 0; j < num_dofs; ++j)
+        dof_map[global_cell_index].push_back(gathered_dofmap[i++]);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/XMLFunctionData.h b/dolfin/io/XMLFunctionData.h
new file mode 100644
index 0000000..72d60e9
--- /dev/null
+++ b/dolfin/io/XMLFunctionData.h
@@ -0,0 +1,61 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-09-27
+// Last changed: 2011-09-27
+
+#ifndef __XMLFUNCTIONDATA_H
+#define __XMLFUNCTIONDATA_H
+
+#include <ostream>
+#include <vector>
+
+namespace pugi
+{
+  class xml_node;
+}
+
+namespace dolfin
+{
+
+  class Function;
+
+  class XMLFunctionData
+  {
+  public:
+
+    /// Read the XML file with function data
+    static void read(Function& u, pugi::xml_node xml_node);
+
+    /// Write the XML file with function data
+    static void write(const Function& u, pugi::xml_node xml_node);
+
+  private:
+
+    static void build_global_to_cell_dof(std::vector<std::vector<
+     std::pair<dolfin::la_index, dolfin::la_index> > >& global_dof_to_cell_dof,
+     const FunctionSpace& V);
+
+    static void build_dof_map(std::vector<std::vector<dolfin::la_index>
+                              >& global_dof_to_cell_dof,
+                              const FunctionSpace& V);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/XMLLocalMeshSAX.cpp b/dolfin/io/XMLLocalMeshSAX.cpp
new file mode 100644
index 0000000..fdc44db
--- /dev/null
+++ b/dolfin/io/XMLLocalMeshSAX.cpp
@@ -0,0 +1,576 @@
+// Copyright (C) 2008-2011 Ola Skavhaug and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2011
+//
+// First added:  2008-11-28
+// Last changed: 2012-11-26
+
+#include <iostream>
+
+#include <map>
+#include <memory>
+#include <utility>
+#include <vector>
+#include <boost/assign/list_of.hpp>
+
+#include <dolfin/common/constants.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/CellType.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include "SAX2AttributeParser.h"
+#include "XMLLocalMeshSAX.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+XMLLocalMeshSAX::XMLLocalMeshSAX(MPI_Comm mpi_comm, LocalMeshData& mesh_data,
+                                 const std::string filename)
+  : _mpi_comm(mpi_comm), _mesh_data(mesh_data), _filename(filename),
+    state(OUTSIDE)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read()
+{
+  // Clear mesh data
+  _mesh_data.clear();
+
+  // Create SAX2 handler
+  xmlSAXHandler sax_handler;
+  memset(&sax_handler, 0, sizeof(sax_handler));
+  sax_handler.initialized = XML_SAX2_MAGIC;
+
+  // Call back functions
+  sax_handler.startDocument = XMLLocalMeshSAX::sax_start_document;
+  sax_handler.endDocument   = XMLLocalMeshSAX::sax_end_document;
+
+  sax_handler.startElementNs = XMLLocalMeshSAX::sax_start_element;
+  sax_handler.endElementNs   = XMLLocalMeshSAX::sax_end_element;
+
+  sax_handler.warning = XMLLocalMeshSAX::sax_warning;
+  sax_handler.error = XMLLocalMeshSAX::sax_error;
+
+  // Parse file
+  int err = xmlSAXUserParseFile(&sax_handler, (void *) this, _filename.c_str());
+  if (err != 0)
+  {
+    dolfin_error("XMLLocalMeshSAX.cpp",
+                 "read local mesh data",
+                 "Error encountered by libxml2 when parsing XML file \"%s\"",
+                 _filename.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::start_element(const xmlChar* name, const xmlChar** attrs,
+                                    std::size_t num_attributes)
+{
+  switch (state)
+  {
+  case OUTSIDE:
+    if (xmlStrcasecmp(name, (xmlChar* ) "mesh") == 0)
+    {
+      read_mesh(name, attrs, num_attributes);
+      state = INSIDE_MESH;
+    }
+    break;
+
+  case INSIDE_MESH:
+    if (xmlStrcasecmp(name, (xmlChar* ) "vertices") == 0)
+    {
+      read_vertices(name, attrs, num_attributes);
+      state = INSIDE_VERTICES;
+    }
+    else if (xmlStrcasecmp(name, (xmlChar* ) "cells") == 0)
+    {
+      read_cells(name, attrs, num_attributes);
+      state = INSIDE_CELLS;
+    }
+    else if (xmlStrcasecmp(name, (xmlChar* ) "data") == 0)
+    {
+      //dolfin_error("XMLLocalMeshSAX.cpp",
+      //             "read mesh data in parallel",
+      //             "not implemented");
+      //read_mesh_data(name, attrs, num_attributes);
+      state = INSIDE_DATA;
+    }
+    else if (xmlStrcasecmp(name, (xmlChar* ) "domains") == 0)
+    {
+      state = INSIDE_DOMAINS;
+    }
+    break;
+
+  case INSIDE_VERTICES:
+    if (xmlStrcasecmp(name, (xmlChar* ) "vertex") == 0)
+    {
+      read_vertex(name, attrs, num_attributes);
+    }
+    break;
+
+  case INSIDE_CELLS:
+    if (xmlStrcasecmp(name, (xmlChar* ) "interval") == 0)
+      read_interval(name, attrs, num_attributes);
+    else if (xmlStrcasecmp(name, (xmlChar* ) "triangle") == 0)
+      read_triangle(name, attrs, num_attributes);
+    else if (xmlStrcasecmp(name, (xmlChar* ) "tetrahedron") == 0)
+      read_tetrahedron(name, attrs, num_attributes);
+    break;
+
+  case INSIDE_DATA:
+    if (xmlStrcasecmp(name, (xmlChar* ) "meshfunction") == 0)
+    {
+      //read_mesh_function(name, attrs);
+      state = INSIDE_MESH_FUNCTION;
+    }
+    else if (xmlStrcasecmp(name, (xmlChar* ) "array") == 0)
+    {
+      //read_array(name, attrs);
+      state = INSIDE_ARRAY;
+    }
+    else if (xmlStrcasecmp(name, (xmlChar* ) "data_entry") == 0)
+    {
+      //read_data_entry(name, attrs);
+      state = INSIDE_DATA_ENTRY;
+    }
+    break;
+
+  case INSIDE_DOMAINS:
+    if (xmlStrcasecmp(name, (xmlChar* ) "mesh_value_collection") == 0)
+    {
+      read_mesh_value_collection(name, attrs, num_attributes);
+      state = INSIDE_MESH_VALUE_COLLECTION;
+    }
+    break;
+
+  case INSIDE_MESH_VALUE_COLLECTION:
+    if (xmlStrcasecmp(name, (xmlChar* ) "value") == 0)
+    {
+      read_mesh_value_collection_entry(name, attrs, num_attributes);
+      state = INSIDE_MESH_VALUE_COLLECTION;
+    }
+    break;
+
+  case INSIDE_DATA_ENTRY:
+    if (xmlStrcasecmp(name, (xmlChar* ) "array") == 0)
+    {
+      //read_array(name, attrs);
+      state = INSIDE_ARRAY;
+    }
+    break;
+  case DONE:
+    dolfin_error("XMLLocalMeshSAX.cpp",
+                 "read local mesh data",
+                 "Inconsistent state in XML reader (%d). End of file reached", state);
+
+  default:
+    dolfin_error("XMLLocalMeshSAX.cpp",
+                 "read local mesh data",
+                 "Inconsistent state in XML reader (%d)", state);
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::end_element(const xmlChar *name)
+{
+  switch (state)
+  {
+  case INSIDE_MESH:
+    if (xmlStrcasecmp(name, (xmlChar* ) "mesh") == 0)
+      state = DONE;
+    break;
+
+  case INSIDE_VERTICES:
+    if (xmlStrcasecmp(name, (xmlChar* ) "vertices") == 0)
+      state = INSIDE_MESH;
+    break;
+
+  case INSIDE_CELLS:
+    if (xmlStrcasecmp(name, (xmlChar* ) "cells") == 0)
+      state = INSIDE_MESH;
+    break;
+
+  case INSIDE_DATA:
+    if (xmlStrcasecmp(name, (xmlChar* ) "data") == 0)
+      state = INSIDE_MESH;
+    break;
+
+  case INSIDE_DOMAINS:
+    if (xmlStrcasecmp(name, (xmlChar* ) "domains") == 0)
+      state = INSIDE_MESH;
+    break;
+
+  case INSIDE_MESH_VALUE_COLLECTION:
+    if (xmlStrcasecmp(name, (xmlChar* ) "mesh_value_collection") == 0)
+      state = INSIDE_DOMAINS;
+    break;
+
+  case INSIDE_MESH_FUNCTION:
+    if (xmlStrcasecmp(name, (xmlChar* ) "meshfunction") == 0)
+      state = INSIDE_DATA;
+    break;
+
+  case INSIDE_DATA_ENTRY:
+    if (xmlStrcasecmp(name, (xmlChar* ) "data_entry") == 0)
+      state = INSIDE_DATA;
+
+  case INSIDE_ARRAY:
+    if (xmlStrcasecmp(name, (xmlChar* ) "array") == 0)
+      state = INSIDE_DATA_ENTRY;
+    if (xmlStrcasecmp(name, (xmlChar* ) "data_entry") == 0)
+      state = INSIDE_DATA;
+    break;
+
+  default:
+    {
+     //warning("Closing XML tag '%s', but state is %d.", name, state);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::sax_start_document(void *ctx)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::sax_end_document(void *ctx)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::sax_start_element(void* ctx,
+                                        const xmlChar* name,
+                                        const xmlChar* prefix,
+                                        const xmlChar* URI,
+                                        int nb_namespaces,
+                                        const xmlChar** namespaces,
+                                        int nb_attributes,
+                                        int nb_defaulted,
+                                        const xmlChar** attrs)
+{
+  ((XMLLocalMeshSAX*) ctx)->start_element(name, attrs, nb_attributes);
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::sax_end_element(void* ctx,
+                                      const xmlChar* name,
+                                      const xmlChar* prefix,
+                                      const xmlChar* URI)
+{
+  ((XMLLocalMeshSAX*) ctx)->end_element(name);
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::sax_warning(void *ctx, const char *msg, ...)
+{
+  va_list args;
+  va_start(args, msg);
+  char buffer[DOLFIN_LINELENGTH];
+  vsnprintf(buffer, DOLFIN_LINELENGTH, msg, args);
+  warning("Incomplete XML data: " + std::string(buffer));
+  va_end(args);
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::sax_error(void *ctx, const char *msg, ...)
+{
+  va_list args;
+  va_start(args, msg);
+  char buffer[DOLFIN_LINELENGTH];
+  vsnprintf(buffer, DOLFIN_LINELENGTH, msg, args);
+  dolfin_error("XMLLocalMeshSAX.cpp",
+               "read local mesh data",
+               "Illegal XML data (\"%s\")",
+               std::string(buffer).c_str());
+  va_end(args);
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::sax_fatal_error(void *ctx, const char *msg, ...)
+{
+  va_list args;
+  va_start(args, msg);
+  char buffer[DOLFIN_LINELENGTH];
+  vsnprintf(buffer, DOLFIN_LINELENGTH, msg, args);
+  dolfin_error("XMLLocalMeshSAX.cpp",
+               "read local mesh data",
+               "Illegal XML data: (\"%s\")",
+               std::string(buffer).c_str());
+  va_end(args);
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read_mesh(const xmlChar* name, const xmlChar** attrs,
+                                std::size_t num_attributes)
+{
+  // Parse values
+  std::string type = SAX2AttributeParser::parse<std::string>(name, attrs,
+                                                             "celltype",
+                                                             num_attributes);
+  gdim = SAX2AttributeParser::parse<unsigned int>(name, attrs, "dim",
+                                                  num_attributes);
+
+  // Create cell type to get topological dimension
+  std::unique_ptr<CellType> cell_type(CellType::create(type));
+  tdim = cell_type->dim();
+
+  // Get number of entities for topological dimension 0
+  _mesh_data.tdim = tdim;
+  _mesh_data.gdim = gdim;
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read_vertices(const xmlChar* name, const xmlChar** attrs,
+                                    std::size_t num_attributes)
+{
+  // Parse the number of global vertices
+  const std::size_t num_global_vertices
+    = SAX2AttributeParser::parse<unsigned int>(name, attrs, "size",
+                                               num_attributes);
+  _mesh_data.num_global_vertices = num_global_vertices;
+
+  // Compute vertex range
+  vertex_range = MPI::local_range(_mpi_comm, num_global_vertices);
+
+  // Reserve space for local-to-global vertex map and vertex coordinates
+  _mesh_data.vertex_indices.reserve(num_local_vertices());
+  _mesh_data.vertex_coordinates.resize(boost::extents[num_local_vertices()][_mesh_data.gdim]);
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read_vertex(const xmlChar* name, const xmlChar** attrs,
+                                  std::size_t num_attributes)
+{
+  // Read vertex index
+  const std::size_t v
+    = SAX2AttributeParser::parse<unsigned int>(name, attrs,
+                                               "index",
+                                               num_attributes);
+
+  // Skip vertices not in range for this process
+  if (v < vertex_range.first || v >= vertex_range.second)
+    return;
+
+  const std::size_t local_index = v - vertex_range.first;
+  const char *xyz[] = {"x", "y", "z"};
+
+  for(std::size_t i = 0; i < gdim ; ++i)
+  {
+    _mesh_data.vertex_coordinates[local_index][i]
+      = SAX2AttributeParser::parse<double>(name, attrs, xyz[i], num_attributes);
+  }
+
+  // Store global vertex numbering
+  _mesh_data.vertex_indices.push_back(v);
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read_cells(const xmlChar* name, const xmlChar** attrs,
+                                 std::size_t num_attributes)
+{
+  // Parse the number of global cells
+  const std::size_t num_global_cells
+    = SAX2AttributeParser::parse<unsigned int>(name, attrs, "size",
+                                               num_attributes);
+  _mesh_data.num_global_cells = num_global_cells;
+
+  // Compute cell range
+  cell_range = MPI::local_range(_mpi_comm, num_global_cells);
+
+  // Allocate space for cells
+  _mesh_data.cell_vertices.resize(boost::extents[num_local_cells()][_mesh_data.tdim + 1]);
+
+  // Reserve space for global cell indices
+  _mesh_data.global_cell_indices.reserve(num_local_cells());
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read_interval(const xmlChar* name, const xmlChar** attrs,
+                                    std::size_t num_attributes)
+{
+  // Check dimension
+  if (tdim != 1)
+  {
+    dolfin_error("XMLLocalMeshSAX.cpp",
+                 "read local mesh data",
+                 "Mesh entity (interval) does not match dimension of mesh (%d)",
+                 tdim);
+  }
+
+  // Read cell index
+  const std::size_t c
+    = SAX2AttributeParser::parse<unsigned int>(name, attrs, "index",
+                                               num_attributes);
+
+  // Skip cells not in range for this process
+  if (c < cell_range.first || c >= cell_range.second)
+    return;
+
+  // Add cell
+  boost::multi_array<std::size_t , 2>::subarray<1>::type cell
+      = _mesh_data.cell_vertices[c - cell_range.first];
+  cell[0] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v0",
+                                                     num_attributes);
+  cell[1] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v1",
+                                                     num_attributes);
+
+  // Add global cell index
+  _mesh_data.global_cell_indices.push_back(c);
+
+  // Vertices per cell
+  _mesh_data.num_vertices_per_cell = 2;
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read_triangle(const xmlChar *name,
+                                    const xmlChar **attrs,
+                                    std::size_t num_attributes)
+{
+  // Check dimension
+  if (tdim != 2)
+  {
+    dolfin_error("XMLLocalMeshSAX.cpp",
+                 "read local mesh data",
+                 "Mesh entity (interval) does not match dimension of mesh (%d)", tdim);
+  }
+
+  // Read cell index
+  const std::size_t
+    c = SAX2AttributeParser::parse<unsigned int>(name, attrs,  "index",
+                                                 num_attributes);
+
+  // Skip cells not in range for this process
+  if (c < cell_range.first || c >= cell_range.second)
+    return;
+
+  // Add cell
+  boost::multi_array<std::size_t, 2>::subarray<1>::type cell
+    = _mesh_data.cell_vertices[c- cell_range.first];
+  cell[0] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v0",
+                                                     num_attributes);
+  cell[1] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v1",
+                                                     num_attributes);
+  cell[2] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v2",
+                                                     num_attributes);
+
+  // Add global cell index
+  _mesh_data.global_cell_indices.push_back(c);
+
+  // Vertices per cell
+  _mesh_data.num_vertices_per_cell = 3;
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read_tetrahedron(const xmlChar *name,
+                                       const xmlChar **attrs,
+                                       std::size_t num_attributes)
+{
+  // Check dimension
+  if (tdim != 3)
+  {
+    dolfin_error("XMLLocalMeshSAX.cpp",
+                 "read local mesh data",
+                 "Mesh entity (interval) does not match dimension of mesh (%d)", tdim);
+  }
+
+  // Read cell index
+  const std::size_t c = SAX2AttributeParser::parse<unsigned int>(name, attrs, "index", num_attributes);
+
+  // Skip cells not in range for this process
+  if (c < cell_range.first || c >= cell_range.second)
+    return;
+
+  // Add cell
+  boost::multi_array<std::size_t, 2>::subarray<1>::type cell
+    = _mesh_data.cell_vertices[c - cell_range.first];
+  cell[0] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v0",
+                                                     num_attributes);
+  cell[1] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v1",
+                                                     num_attributes);
+  cell[2] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v2",
+                                                     num_attributes);
+  cell[3] = SAX2AttributeParser::parse<unsigned int>(name, attrs, "v3",
+                                                     num_attributes);
+
+  // Add global cell index
+  _mesh_data.global_cell_indices.push_back(c);
+
+  // Vertices per cell
+  _mesh_data.num_vertices_per_cell = 4;
+}
+//-----------------------------------------------------------------------------
+void XMLLocalMeshSAX::read_mesh_value_collection(const xmlChar* name,
+                                                 const xmlChar** attrs,
+                                                 std::size_t num_attributes)
+{
+  // Parse values
+  const std::string type
+    = SAX2AttributeParser::parse<std::string>(name, attrs, "type",
+                                              num_attributes);
+  const std::size_t dim
+    = SAX2AttributeParser::parse<unsigned int>(name, attrs, "dim",
+                                               num_attributes);
+  const std::size_t size
+    = SAX2AttributeParser::parse<unsigned int>(name, attrs, "size",
+                                               num_attributes);
+
+  // Compute domain value range
+  domain_value_range = MPI::local_range(_mpi_comm, size);
+  domain_dim = dim;
+
+  if (type != "uint")
+  {
+    dolfin_error("XMLLocalMeshSAX.cpp",
+                 "read local mesh data",
+                 "XMLLocalMeshSAX can only read unsigned integer domain values");
+  }
+
+  std::vector<std::pair<std::pair<std::size_t, std::size_t>, std::size_t> > tmp;
+  _mesh_data.domain_data.insert(std::make_pair(dim, tmp));
+
+  // Reset counter
+  domain_value_counter = 0;
+}
+//-----------------------------------------------------------------------------
+void
+XMLLocalMeshSAX::read_mesh_value_collection_entry(const xmlChar* name,
+                                                  const xmlChar** attrs,
+                                                  std::size_t num_attributes)
+{
+  if (domain_value_counter >= domain_value_range.first
+      && domain_value_counter < domain_value_range.second)
+  {
+    // Parse values
+    std::pair<std::pair<std::size_t, unsigned int>, unsigned int> entry_data;
+    entry_data.first.first
+      = SAX2AttributeParser::parse<unsigned int>(name, attrs, "cell_index",
+                                                 num_attributes);
+    entry_data.first.second
+      = SAX2AttributeParser::parse<unsigned int>(name, attrs, "local_entity",
+                                                 num_attributes);
+    entry_data.second
+      = SAX2AttributeParser::parse<unsigned int>(name, attrs,  "value",
+                                                 num_attributes);
+
+    std::vector<std::pair<std::pair<std::size_t,
+                                    std::size_t>, std::size_t> >& data
+      = _mesh_data.domain_data.find(domain_dim)->second;
+    data.push_back(entry_data);
+  }
+
+  ++domain_value_counter;
+}
+//-----------------------------------------------------------------------------
+std::size_t XMLLocalMeshSAX::num_local_vertices() const
+{
+  return vertex_range.second - vertex_range.first;
+}
+//-----------------------------------------------------------------------------
+std::size_t XMLLocalMeshSAX::num_local_cells() const
+{
+  return cell_range.second - cell_range.first;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/XMLLocalMeshSAX.h b/dolfin/io/XMLLocalMeshSAX.h
new file mode 100644
index 0000000..74248cc
--- /dev/null
+++ b/dolfin/io/XMLLocalMeshSAX.h
@@ -0,0 +1,141 @@
+// Copyright (C) 2006-2011 Ola Skavhaug and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kent-Andre Mardal, 2011.
+//
+// First added:  2009-03-10
+// Last changed: 2011-09-17
+
+#ifndef __XMLLOCALMESHDATASAX_H
+#define __XMLLOCALMESHDATASAX_H
+
+#include <string>
+#include <libxml/parser.h>
+#include <dolfin/common/MPI.h>
+
+namespace dolfin
+{
+
+  class LocalMeshData;
+
+  /// Documentation of class XMLLocalMeshSAX
+
+  class XMLLocalMeshSAX
+  {
+
+  public:
+
+    XMLLocalMeshSAX(MPI_Comm mpi_comm, LocalMeshData& mesh_data,
+                    const std::string filename);
+
+    void read();
+
+    void start_element(const xmlChar* name, const xmlChar** attrs,
+                       std::size_t num_attributes);
+    void end_element(const xmlChar* name);
+
+  private:
+
+    enum ParserState {OUTSIDE,
+                      INSIDE_MESH, INSIDE_VERTICES, INSIDE_CELLS,
+                      INSIDE_DATA, INSIDE_DOMAINS, INSIDE_MESH_VALUE_COLLECTION,
+                      INSIDE_MESH_FUNCTION,
+                      INSIDE_ARRAY, INSIDE_DATA_ENTRY,
+                      DONE};
+
+    static void sax_start_document(void *ctx);
+    static void sax_end_document(void *ctx);
+
+    static void sax_start_element(void* ctx,
+                                  const xmlChar* name,
+                                  const xmlChar* prefix,
+                                  const xmlChar* URI,
+                                  int nb_namespaces,
+                                  const xmlChar** namespaces,
+                                  int nb_attributes,
+                                  int nb_defaulted,
+                                  const xmlChar** attrs);
+
+    static void sax_end_element(void* ctx,
+                                const xmlChar* name,
+                                const xmlChar* prefix,
+                                const xmlChar* URI);
+
+
+    static void sax_warning     (void *ctx, const char *msg, ...);
+    static void sax_error       (void *ctx, const char *msg, ...);
+    static void sax_fatal_error (void *ctx, const char *msg, ...);
+
+    // Callbacks for reading XML data
+    void read_mesh(const xmlChar* name, const xmlChar** attrs,
+                   std::size_t num_attributes);
+    void read_vertices(const xmlChar* name, const xmlChar** attrs,
+                       std::size_t num_attributes);
+    void read_vertex(const xmlChar* name, const xmlChar** attrs,
+                     std::size_t num_attributes);
+    void read_cells(const xmlChar* name, const xmlChar** attrs,
+                    std::size_t num_attributes);
+    void read_interval(const xmlChar* name, const xmlChar** attrs,
+                       std::size_t num_attributes);
+    void read_triangle(const xmlChar* name, const xmlChar** attrs,
+                       std::size_t num_attributes);
+    void read_tetrahedron(const xmlChar* name, const xmlChar** attrs,
+                          std::size_t num_attributes);
+
+    void read_mesh_value_collection(const xmlChar* name, const xmlChar** attrs,
+                                    std::size_t num_attributes);
+    void read_mesh_value_collection_entry(const xmlChar* name,
+                                          const xmlChar** attrs,
+                                          std::size_t num_attributes);
+
+    // Number of local vertices
+    std::size_t num_local_vertices() const;
+
+    // Number of local cells
+    std::size_t num_local_cells() const;
+
+    // Geometrical mesh dimesion
+    std::size_t gdim;
+
+    // Topological mesh dimesion
+    std::size_t tdim;
+
+    // Range for vertices
+    std::pair<std::size_t, std::size_t> vertex_range;
+
+    // Range for cells
+    std::pair<std::size_t, std::size_t> cell_range;
+
+    // Range for domain data and counter
+    std::pair<std::size_t, std::size_t> domain_value_range;
+    std::size_t domain_value_counter;
+    std::size_t domain_dim;
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+    LocalMeshData& _mesh_data;
+
+    const std::string _filename;
+
+    // State of parser
+    ParserState state;
+
+  };
+
+}
+#endif
diff --git a/dolfin/io/XMLMesh.cpp b/dolfin/io/XMLMesh.cpp
new file mode 100644
index 0000000..7b0b03e
--- /dev/null
+++ b/dolfin/io/XMLMesh.cpp
@@ -0,0 +1,509 @@
+// Copyright (C) 2011-2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2002-12-06
+// Last changed: 2014-02-06
+
+#include <map>
+#include <memory>
+#include <iomanip>
+#include <iostream>
+#include <vector>
+#include <boost/format.hpp>
+#include <boost/lexical_cast.hpp>
+#include <memory>
+
+#include "pugixml.hpp"
+
+#include "dolfin/common/MPI.h"
+#include "dolfin/common/NoDeleter.h"
+#include "dolfin/geometry/Point.h"
+#include "dolfin/la/GenericVector.h"
+#include "dolfin/mesh/Cell.h"
+#include "dolfin/mesh/CellType.h"
+#include "dolfin/mesh/Mesh.h"
+#include "dolfin/mesh/MeshData.h"
+#include "dolfin/mesh/MeshEditor.h"
+#include "dolfin/mesh/Vertex.h"
+#include "dolfin/mesh/MeshFunction.h"
+#include "XMLMeshFunction.h"
+#include "XMLMeshValueCollection.h"
+#include "XMLMesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void XMLMesh::read(Mesh& mesh, const pugi::xml_node xml_dolfin)
+{
+  // Get mesh node
+  const pugi::xml_node mesh_node = xml_dolfin.child("mesh");
+  if (!mesh_node)
+  {
+    dolfin_error("XMLMesh.cpp",
+                 "read mesh from XML file",
+                 "Not a DOLFIN XML Mesh file");
+  }
+
+  // Read mesh
+  read_mesh(mesh, mesh_node);
+
+  // Read mesh data (if any)
+  read_data(mesh.data(), mesh, mesh_node);
+
+  // Read mesh domains (if any)
+  read_domains(mesh.domains(), mesh, mesh_node);
+}
+//-----------------------------------------------------------------------------
+void XMLMesh::write(const Mesh& mesh, pugi::xml_node xml_node)
+{
+  // Add mesh node
+  pugi::xml_node mesh_node = xml_node.append_child("mesh");
+
+  // Write mesh
+  write_mesh(mesh, mesh_node);
+
+  // Write mesh data (if any)
+  write_data(mesh, mesh.data(), mesh_node);
+
+  // Write mesh markers (if any)
+  write_domains(mesh, mesh.domains(), mesh_node);
+}
+//-----------------------------------------------------------------------------
+void XMLMesh::read_mesh(Mesh& mesh, const pugi::xml_node mesh_node)
+{
+  // Get cell type and geometric dimension
+  const std::string cell_type_str = mesh_node.attribute("celltype").value();
+  const std::size_t gdim = mesh_node.attribute("dim").as_uint();
+
+  // Get topological dimension
+  std::unique_ptr<CellType> cell_type(CellType::create(cell_type_str));
+  const std::size_t tdim = cell_type->dim();
+
+  // Create mesh for editing
+  MeshEditor editor;
+  editor.open(mesh, cell_type_str, tdim, gdim);
+
+  // Get vertices xml node
+  pugi::xml_node xml_vertices = mesh_node.child("vertices");
+  dolfin_assert(xml_vertices);
+
+  // Get number of vertices and init editor
+  const std::size_t num_vertices = xml_vertices.attribute("size").as_uint();
+  editor.init_vertices_global(num_vertices, num_vertices);
+
+  // Iterate over vertices and add to mesh
+  Point p;
+  for (pugi::xml_node_iterator it = xml_vertices.begin();
+       it != xml_vertices.end(); ++it)
+  {
+    const std::size_t index = it->attribute("index").as_uint();
+    p[0] = it->attribute("x").as_double();
+    p[1] = it->attribute("y").as_double();
+    p[2] = it->attribute("z").as_double();
+    editor.add_vertex(index, p);
+  }
+
+  // Get cells node
+  pugi::xml_node xml_cells = mesh_node.child("cells");
+  dolfin_assert(xml_cells);
+
+  // Get number of cells and init editor
+  const std::size_t num_cells = xml_cells.attribute("size").as_uint();
+  editor.init_cells_global(num_cells, num_cells);
+
+  // Create list of vertex index attribute names
+  const unsigned int num_vertices_per_cell = cell_type->num_vertices(tdim);
+  std::vector<std::string> v_str(num_vertices_per_cell);
+  for (std::size_t i = 0; i < num_vertices_per_cell; ++i)
+    v_str[i] = "v" + boost::lexical_cast<std::string, unsigned int>(i);
+
+  // Iterate over cells and add to mesh
+  std::vector<std::size_t> v(num_vertices_per_cell);
+  for (pugi::xml_node_iterator it = xml_cells.begin(); it != xml_cells.end();
+       ++it)
+  {
+    const std::size_t index = it->attribute("index").as_uint();
+    for (unsigned int i = 0; i < num_vertices_per_cell; ++i)
+      v[i] = it->attribute(v_str[i].c_str()).as_uint();
+    editor.add_cell(index, v);
+  }
+
+  // Close mesh editor
+  editor.close();
+}
+//-----------------------------------------------------------------------------
+void XMLMesh::read_data(MeshData& data, const Mesh& mesh,
+                        const pugi::xml_node mesh_node)
+{
+  // Check if we have any mesh data
+  const pugi::xml_node xml_data = mesh_node.child("data");
+  if (!xml_data)
+    return;
+
+  // Iterate over data
+  for (pugi::xml_node_iterator it = xml_data.begin();
+       it != xml_data.end(); ++it)
+  {
+    // Get node name
+    const std::string node_name = it->name();
+
+    // Read data stored as a MeshFunction (new style)
+    if (node_name == "mesh_function")
+    {
+      // Create MeshFunction to read data into
+      MeshFunction<std::size_t> mf(mesh);
+
+      // Read  MeshFunction
+      //const std::string data_type = it->attribute("type").value();
+      XMLMeshFunction::read(mf, "uint", *it);
+
+      // Create mesh domain array
+      std::vector<std::size_t>& _data
+        = data.create_array(mf.name(), mf.dim());
+      _data.resize(mf.size());
+
+      // Copy MeshFunction into MeshDomain array
+      for (std::size_t i = 0; i < _data.size(); ++i)
+        _data[i] = mf[i];
+    }
+    else if (node_name != "data_entry")
+    {
+      dolfin_error("XMLMesh.cpp",
+                   "read mesh data from XML file",
+                   "Expecting XML node <data_entry> but got <%s>",
+                   node_name.c_str());
+    }
+    else // Old-style storage
+    {
+      // Get name of data set
+      const std::string data_set_name = it->attribute("name").value();
+
+      // Check that there is only one data set
+      if (it->first_child().next_sibling())
+      {
+        dolfin_error("XMLMesh.cpp",
+                     "read mesh data from XML file",
+                     "XML file contains too many data sets");
+      }
+
+      // Get type of data set
+      pugi::xml_node data_set = it->first_child();
+      const std::string data_set_type = data_set.name();
+      if (data_set_type == "array")
+      {
+        dolfin_error("XMLMesh.cpp",
+                     "read mesh data from XML file",
+                     "Only MeshFunction data can be read");
+      }
+      else if (data_set_type == "mesh_function")
+      {
+        // Create MeshFunction to read data into
+        MeshFunction<std::size_t> mf(mesh);
+
+        // Read  MeshFunction
+        const std::string data_type = data_set.attribute("type").value();
+        XMLMeshFunction::read(mf, data_type, *it);
+
+        // Create mesh domain array
+        std::vector<std::size_t>& _data
+          = data.create_array(data_set_name, mf.dim());
+        _data.resize(mf.size());
+
+        // Copy MeshFunction into MeshDomain array
+        for (std::size_t i = 0; i < _data.size(); ++i)
+          _data[i] = mf[i];
+      }
+      else if (data_set_type == "meshfunction")
+      {
+        dolfin_error("XMLMesh.cpp",
+                     "read mesh data from XML file",
+                     "The XML tag <meshfunction> has been changed to <mesh_function>");
+      }
+      else
+      {
+        dolfin_error("XMLMesh.cpp",
+                     "read mesh data from XML file",
+                     "Reading of MeshData \"%s\" is not yet supported",
+                     data_set_type.c_str());
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLMesh::read_domains(MeshDomains& domains, const Mesh& mesh,
+                           const pugi::xml_node mesh_node)
+{
+  // Check if we have any domains
+  const pugi::xml_node xml_domains = mesh_node.child("domains");
+  if (!xml_domains)
+    return;
+
+  // Iterate over data
+  for (pugi::xml_node_iterator it = xml_domains.begin();
+       it != xml_domains.end(); ++it)
+  {
+    // Check that node is <mesh_value_collection>
+    const std::string node_name = it->name();
+    if (node_name != "mesh_value_collection")
+    {
+      dolfin_error("XMLMesh.cpp",
+                   "read mesh domains from XML file",
+                   "Expecting XML node <mesh_value_collection> but got <%s>",
+                   node_name.c_str());
+    }
+
+    // Get attributes
+    const std::string type = it->attribute("type").value();
+    const std::size_t dim = it->attribute("dim").as_uint();
+
+    // Check that the type is uint
+    if (type != "uint")
+    {
+      dolfin_error("XMLMesh.cpp",
+                   "read mesh domains from XML file",
+                   "Mesh domains must be marked as uint, not %s",
+                   type.c_str());
+    }
+
+    // Initialise mesh entities
+    mesh.init(dim);
+
+    // Read data into a mesh value collection
+    std::shared_ptr<const Mesh> _mesh = reference_to_no_delete_pointer(mesh);
+    MeshValueCollection<std::size_t> mvc(_mesh);
+    XMLMeshValueCollection::read(mvc, type, *it);
+
+    // Get mesh value collection data
+    const std::map<std::pair<std::size_t, std::size_t>, std::size_t>&
+      values = mvc.values();
+
+    // Get mesh domain data and fill
+    std::map<std::size_t, std::size_t>& markers
+      = domains.markers(dim);
+    std::map<std::pair<std::size_t, std::size_t>,
+             std::size_t>::const_iterator entry;
+    if (dim != mesh.topology().dim())
+    {
+      for (entry = values.begin(); entry != values.end(); ++entry)
+      {
+        const Cell cell(mesh, entry->first.first);
+        const std::size_t entity_index
+          = cell.entities(dim)[entry->first.second];
+        markers[entity_index] = entry->second;
+      }
+    }
+    else
+    {
+      // Special case for cells
+      for (entry = values.begin(); entry != values.end(); ++entry)
+        markers[entry->first.first] = entry->second;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLMesh::read_array_uint(std::vector<std::size_t>& array,
+                              const pugi::xml_node xml_array)
+{
+  // Check that we have an array
+  const std::string name = xml_array.name();
+  if (name != "array")
+  {
+    dolfin_error("XMLMesh.cpp",
+                 "read mesh array data from XML file",
+                 "Expecting an XML array node");
+  }
+
+  // Check type is unit
+  const std::string type = xml_array.attribute("type").value();
+  if (type != "uint")
+  {
+    dolfin_error("XMLMesh.cpp",
+                 "read mesh array data from XML file",
+                 "Expecting an XML array node");
+  }
+
+  // Get size and resize vector
+  const std::size_t size = xml_array.attribute("size").as_uint();
+  array.resize(size);
+
+  // Iterate over array entries
+  for (pugi::xml_node_iterator it = xml_array.begin(); it !=xml_array.end();
+       ++it)
+  {
+    const std::size_t index = it->attribute("index").as_uint();
+    const double value = it->attribute("value").as_uint();
+    dolfin_assert(index < size);
+    array[index] = value;
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLMesh::write_mesh(const Mesh& mesh, pugi::xml_node mesh_node)
+{
+  // Add mesh attributes
+  const CellType::Type _cell_type = mesh.type().cell_type();
+  const std::string cell_type = CellType::type2string(_cell_type);
+  mesh_node.append_attribute("celltype") = cell_type.c_str();
+  mesh_node.append_attribute("dim") = (unsigned int) mesh.geometry().dim();
+
+  // Add vertices node
+  pugi::xml_node vertices_node = mesh_node.append_child("vertices");
+  vertices_node.append_attribute("size") = (unsigned int) mesh.num_vertices();
+
+  // Write each vertex
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    pugi::xml_node vertex_node = vertices_node.append_child("vertex");
+    vertex_node.append_attribute("index") = (unsigned int) v->index();
+
+    const Point p = v->point();
+    switch (mesh.geometry().dim())
+    {
+      case 1:
+        vertex_node.append_attribute("x")
+            = boost::str(boost::format("%.15e") % p.x()).c_str();
+        break;
+      case 2:
+        vertex_node.append_attribute("x")
+            = boost::str(boost::format("%.15e") % p.x()).c_str();
+        vertex_node.append_attribute("y")
+            = boost::str(boost::format("%.15e") % p.y()).c_str();
+        break;
+      case 3:
+        vertex_node.append_attribute("x")
+            = boost::str(boost::format("%.15e") % p.x()).c_str();
+        vertex_node.append_attribute("y")
+            = boost::str(boost::format("%.15e") % p.y()).c_str();
+        vertex_node.append_attribute("z")
+            = boost::str(boost::format("%.15e") % p.z()).c_str();
+        break;
+      default:
+        dolfin_error("XMLMesh.cpp",
+                     "write mesh to XML file",
+                     "The XML mesh file format only supports 1D, 2D and 3D meshes");
+    }
+  }
+
+  // Add cells node
+  pugi::xml_node cells_node = mesh_node.append_child("cells");
+  cells_node.append_attribute("size") = (unsigned int) mesh.num_cells();
+
+  // Add each cell
+  for (CellIterator c(mesh); !c.end(); ++c)
+  {
+    pugi::xml_node cell_node = cells_node.append_child(cell_type.c_str());
+    cell_node.append_attribute("index") = (unsigned int) c->index();
+
+    const unsigned int* vertices = c->entities(0);
+    dolfin_assert(vertices);
+
+    switch (_cell_type)
+    {
+    case CellType::interval:
+      cell_node.append_attribute("v0") = (unsigned int) vertices[0];
+      cell_node.append_attribute("v1") = (unsigned int) vertices[1];
+      break;
+    case CellType::triangle:
+      cell_node.append_attribute("v0") = (unsigned int) vertices[0];
+      cell_node.append_attribute("v1") = (unsigned int) vertices[1];
+      cell_node.append_attribute("v2") = (unsigned int) vertices[2];
+      break;
+    case CellType::tetrahedron:
+      cell_node.append_attribute("v0") = (unsigned int) vertices[0];
+      cell_node.append_attribute("v1") = (unsigned int) vertices[1];
+      cell_node.append_attribute("v2") = (unsigned int) vertices[2];
+      cell_node.append_attribute("v3") = (unsigned int) vertices[3];
+      break;
+    default:
+      dolfin_error("XMLMesh.cpp",
+                   "write mesh to XML file",
+                   "Unknown cell type (%u)", _cell_type);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLMesh::write_data(const Mesh& mesh, const MeshData& data,
+                         pugi::xml_node mesh_node)
+{
+  // Check if there is any data to write
+  if (data._arrays.empty())
+    return;
+
+  // Add mesh data node
+  pugi::xml_node mesh_data_node = mesh_node.append_child("data");
+
+  // Write arrays
+  typedef std::vector<std::map<std::string,
+                               std::vector<std::size_t> > >::const_iterator array_iterator_d;
+  typedef std::map<std::string,
+                   std::vector<std::size_t> >::const_iterator array_iterator;
+  for (array_iterator_d it_d = data._arrays.begin(); it_d != data._arrays.end(); ++it_d)
+  {
+    const std::size_t dim =  it_d - data._arrays.begin();
+    for (array_iterator it = it_d->begin(); it != it_d->end(); ++it)
+    {
+      // Data set name and array
+      std::string name = it->first;
+      const std::vector<std::size_t>& array = it->second;
+
+      // Check data lenght
+      if (array.size() != mesh.num_entities(dim))
+      {
+        dolfin_error("XMLMesh.cpp",
+                     "write mesh data to XML file",
+                     "Data array length does not match number of mesh entities");
+      }
+
+      // Copy data into MeshFunction
+      MeshFunction<std::size_t> mf(mesh, dim);
+      mf.rename(name, name);
+      for (std::size_t i = 0; i < mf.size(); ++i)
+        mf[i] = array[i];
+
+      // Write MeshFunction
+      XMLMeshFunction::write(mf, "uint", mesh_data_node, false);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void XMLMesh::write_domains(const Mesh& mesh, const MeshDomains& domains,
+                            pugi::xml_node mesh_node)
+{
+  // Check if there is any data to write
+  if (domains.is_empty())
+    return;
+
+  // Add mesh domains node
+  pugi::xml_node domains_node = mesh_node.append_child("domains");
+
+  // Write mesh markers
+  for (std::size_t d = 0; d <= domains.max_dim(); d++)
+  {
+    if (!domains.markers(d).empty())
+    {
+      const std::map<std::size_t, std::size_t>& domain = domains.markers(d);
+
+      MeshValueCollection<std::size_t> collection(mesh, d);
+      std::map<std::size_t, std::size_t>::const_iterator it;
+      for (it = domain.begin(); it != domain.end(); ++it)
+        collection.set_value(it->first, it->second);
+      XMLMeshValueCollection::write(collection, "uint", domains_node);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/XMLMesh.h b/dolfin/io/XMLMesh.h
new file mode 100644
index 0000000..73d4c10
--- /dev/null
+++ b/dolfin/io/XMLMesh.h
@@ -0,0 +1,89 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2003-07-15
+// Last changed: 2011-09-02
+
+#ifndef __XML_MESH_H
+#define __XML_MESH_H
+
+#include <ostream>
+#include <string>
+#include <vector>
+
+namespace pugi
+{
+  class xml_node;
+}
+
+namespace dolfin
+{
+
+  class Mesh;
+  class MeshData;
+  class MeshDomains;
+
+  class XMLMesh
+  {
+  public:
+
+    /// Read mesh from XML
+    static void read(Mesh& mesh, const pugi::xml_node mesh_node);
+
+    /// Write mesh to XML
+    static void write(const Mesh& mesh, pugi::xml_node mesh_node);
+
+  private:
+
+    // Read mesh
+    static void read_mesh(Mesh& mesh,
+                          const pugi::xml_node mesh_node);
+
+    // Read mesh data
+    static void read_data(MeshData& data,
+                          const Mesh& mesh,
+                          const pugi::xml_node mesh_node);
+
+    // Read mesh domains
+    static void read_domains(MeshDomains& domains,
+                             const Mesh& mesh,
+                             const pugi::xml_node mesh_node);
+
+    // Read array
+    static void read_array_uint(std::vector<std::size_t>& array,
+                                const pugi::xml_node xml_array);
+
+    // Write mesh
+    static void write_mesh(const Mesh& mesh,
+                           pugi::xml_node mesh_node);
+
+    // Write mesh data
+    static void write_data(const Mesh& mesh, const MeshData& data,
+                           pugi::xml_node mesh_node);
+
+    // Write mesh markers
+    static void write_domains(const Mesh& mesh,
+                              const MeshDomains& domains,
+                              pugi::xml_node mesh_node);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/XMLMeshFunction.h b/dolfin/io/XMLMeshFunction.h
new file mode 100644
index 0000000..81eae7a
--- /dev/null
+++ b/dolfin/io/XMLMeshFunction.h
@@ -0,0 +1,249 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2011-06-30
+// Last changed: 2011-11-14
+
+#ifndef __XML_MESH_FUNCTION_H
+#define __XML_MESH_FUNCTION_H
+
+#include <iomanip>
+#include <iostream>
+#include <ostream>
+#include <string>
+
+#include "pugixml.hpp"
+#include <dolfin/mesh/LocalMeshValueCollection.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/MeshValueCollection.h>
+#include "XMLMesh.h"
+#include "XMLMeshValueCollection.h"
+
+#include <dolfin/common/Timer.h>
+
+namespace dolfin
+{
+
+  class XMLMeshFunction
+  {
+  public:
+
+    /// Read XML MeshFunction
+    template <typename T>
+    static void read(MeshFunction<T>& mesh_function, const std::string type,
+                     const pugi::xml_node xml_mesh);
+
+    /// Read XML MeshFunction as a MeshValueCollection
+    template <typename T>
+    static void read(MeshValueCollection<T>& mesh_value_collection,
+                     const std::string type, const pugi::xml_node xml_mesh);
+
+    /// Write the XML file
+    template<typename T>
+    static void write(const MeshFunction<T>& mesh_function,
+                      const std::string type, pugi::xml_node xml_node,
+                      bool write_mesh=true);
+
+  };
+
+  //---------------------------------------------------------------------------
+  template <typename T>
+  inline void XMLMeshFunction::read(MeshFunction<T>& mesh_function,
+                                    const std::string type,
+                                    const pugi::xml_node xml_mesh)
+  {
+    bool new_format = false;
+    pugi::xml_node xml_meshfunction;
+    if (std::string(xml_mesh.name()) == "mesh_function")
+    {
+      // XML node is a mesh function
+      new_format = true;
+      xml_meshfunction = xml_mesh;
+    }
+    else
+    {
+      // Tag
+      std::string tag_name = "mesh_function";
+
+      // Check for old tag
+      if (xml_mesh.child("meshfunction"))
+      {
+        warning("The XML tag <meshfunction> has been changed to <mesh_function>. "
+                "I'll be nice and read your XML data anyway, for now, but you will "
+                "need to update your XML files (a simple search and replace) to use "
+                "future versions of DOLFIN.");
+        tag_name = "meshfunction";
+      }
+
+      // Get XML node
+      xml_meshfunction = xml_mesh.child(tag_name.c_str());
+
+      // Read main tag
+      if (!xml_meshfunction)
+        std::cout << "Not a DOLFIN MeshFunction XML file." << std::endl;
+
+      if (xml_meshfunction.attributes_begin() == xml_meshfunction.attributes_end())
+        new_format = true;
+    }
+
+    // Check for new (MeshValueCollection) / old storage
+    if (new_format)
+    {
+      // Read new-style MeshFunction
+      MeshValueCollection<T> mesh_value_collection(mesh_function.mesh());
+      XMLMeshValueCollection::read<T>(mesh_value_collection, type,
+                                      xml_meshfunction);
+
+      // Assign collection to mesh function (this is a local
+      // operation) and attach name
+      mesh_function = mesh_value_collection;
+      mesh_function.rename(mesh_value_collection.name(),
+                           mesh_value_collection.label());
+    }
+    else
+    {
+      // Get type and size
+      const std::string file_data_type = xml_meshfunction.attribute("type").value();
+      const std::size_t dim = xml_meshfunction.attribute("dim").as_uint();
+      const std::size_t size = xml_meshfunction.attribute("size").as_uint();
+
+      // Check that types match
+      if (type != file_data_type)
+      {
+        dolfin_error("XMLMeshFunction.h",
+                     "read mesh function from XML file",
+                     "Type mismatch reading XML MeshFunction. MeshFunction type is \"%s\", but file type is \"%s\"",
+                     type.c_str(), file_data_type.c_str());
+      }
+
+      // Initialise MeshFunction
+      mesh_function.init(dim, size);
+
+      // Iterate over entries (choose data type)
+      if (type == "uint")
+      {
+        for (pugi::xml_node_iterator it = xml_meshfunction.begin();
+             it != xml_meshfunction.end(); ++it)
+        {
+          const std::size_t index = it->attribute("index").as_uint();
+          dolfin_assert(index < size);
+          mesh_function[index] = it->attribute("value").as_uint();
+        }
+      }
+      else if (type == "int")
+      {
+        for (pugi::xml_node_iterator it = xml_meshfunction.begin();
+             it != xml_meshfunction.end(); ++it)
+        {
+          const std::size_t index = it->attribute("index").as_uint();
+          dolfin_assert(index < size);
+          mesh_function[index] = it->attribute("value").as_int();
+        }
+      }
+      else if (type == "double")
+      {
+        for (pugi::xml_node_iterator it = xml_meshfunction.begin();
+             it != xml_meshfunction.end(); ++it)
+        {
+          const std::size_t index = it->attribute("index").as_uint();
+          dolfin_assert(index < size);
+          mesh_function[index] = it->attribute("value").as_double();
+        }
+      }
+      else if (type == "bool")
+      {
+        for (pugi::xml_node_iterator it = xml_meshfunction.begin();
+             it != xml_meshfunction.end(); ++it)
+        {
+          const std::size_t index = it->attribute("index").as_uint();
+          dolfin_assert(index < size);
+          mesh_function[index] = it->attribute("value").as_bool();
+        }
+      }
+      else
+      {
+        dolfin_error("XMLMeshFunction.h",
+                     "read mesh function from XML file",
+                     "Unknown value type (\"%s\")", type.c_str());
+      }
+    }
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  inline void XMLMeshFunction::read(MeshValueCollection<T>& mesh_value_collection,
+                                    const std::string type,
+                                    const pugi::xml_node xml_mesh)
+  {
+    // Check for old tag
+    std::string tag_name("mesh_function");
+    if (xml_mesh.child("meshfunction"))
+    {
+      warning("The XML tag <meshfunction> has been changed to <mesh_function>. "
+              "I'll be nice and read your XML data anyway, for now, but you will "
+              "need to update your XML files (a simple search and replace) to use "
+              "future versions of DOLFIN.");
+      tag_name = "meshfunction";
+    }
+
+    // Read main tag
+    const pugi::xml_node xml_meshfunction = xml_mesh.child(tag_name.c_str());
+    if (!xml_meshfunction)
+      std::cout << "Not a DOLFIN MeshFunction XML file." << std::endl;
+
+    // Check for new (MeshValueCollection) / old storage
+    if (xml_meshfunction.attributes_begin() == xml_meshfunction.attributes_end())
+    {
+      // Read new-style MeshFunction
+      XMLMeshValueCollection::read<T>(mesh_value_collection, type,
+                                      xml_meshfunction);
+    }
+    else
+    {
+      dolfin_error("XMLMeshFunction.h",
+                   "read mesh function from XML file",
+                   "Cannot read old-style MeshFunction XML files as a MeshValueCollection");
+    }
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void XMLMeshFunction::write(const MeshFunction<T>& mesh_function,
+                              const std::string type, pugi::xml_node xml_node,
+                              bool write_mesh)
+  {
+    not_working_in_parallel("MeshFunction XML output");
+
+    // Write mesh if requested
+    if (write_mesh)
+      XMLMesh::write(*mesh_function.mesh(), xml_node);
+
+    // Add mesh function node and attributes
+    pugi::xml_node mf_node = xml_node.append_child("mesh_function");
+
+    // Create MeshValueCollection for output
+    MeshValueCollection<T> mesh_value_collection(mesh_function);
+    mesh_value_collection.rename(mesh_function.name(), mesh_function.label());
+
+    // Write MeshValueCollection
+    XMLMeshValueCollection::write(mesh_value_collection, type, mf_node);
+  }
+  //---------------------------------------------------------------------------
+
+}
+#endif
diff --git a/dolfin/io/XMLMeshValueCollection.h b/dolfin/io/XMLMeshValueCollection.h
new file mode 100644
index 0000000..fe8d9a0
--- /dev/null
+++ b/dolfin/io/XMLMeshValueCollection.h
@@ -0,0 +1,179 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-30
+// Last changed: 2011-11-15
+
+#ifndef __XML_MESH_VALUE_COLLECTION_H
+#define __XML_MESH_VALUE_COLLECTION_H
+
+#include <boost/lexical_cast.hpp>
+#include <dolfin/mesh/MeshValueCollection.h>
+#include "pugixml.hpp"
+#include "xmlutils.h"
+#include "XMLMesh.h"
+
+namespace dolfin
+{
+
+  class XMLMeshValueCollection
+  {
+  public:
+
+    // Read mesh value collection from XML file
+    template <typename T>
+    static void read(MeshValueCollection<T>& mesh_value_collection,
+                     const std::string type,
+                     const pugi::xml_node xml_node);
+
+    /// Write mesh value collection to XML file
+    template<typename T>
+    static void write(const MeshValueCollection<T>& mesh_value_collection,
+                      const std::string type,
+                      pugi::xml_node xml_node);
+
+  };
+
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void
+    XMLMeshValueCollection::read(MeshValueCollection<T>& mesh_value_collection,
+                                 const std::string type,
+                                 const pugi::xml_node xml_node)
+  {
+    // Get node
+    const pugi::xml_node mvc_node
+      = get_node(xml_node, "mesh_value_collection");
+    dolfin_assert(mvc_node);
+
+    // Get attributes
+    const std::string name = mvc_node.attribute("name").value();
+    const std::string type_file = mvc_node.attribute("type").value();
+    const std::size_t dim = mvc_node.attribute("dim").as_uint();
+
+    // Attach name to mesh value collection object
+    mesh_value_collection.rename(name, "a mesh value collection");
+
+    // Set dimension
+    mesh_value_collection.init(dim);
+
+    // Check that types match
+    if (type != type_file)
+    {
+      dolfin_error("XMLMeshValueCollection.h",
+                   "read mesh value collection from XML file",
+                   "Type mismatch, found \"%s\" but expecting \"%s\"",
+                   type_file.c_str(), type.c_str());
+    }
+
+    // Clear old values
+    mesh_value_collection.clear();
+
+    // Choose data type
+    if (type == "uint")
+    {
+      pugi::xml_node_iterator it;
+      for (it = mvc_node.begin(); it != mvc_node.end(); ++it)
+      {
+        const std::size_t cell_index = it->attribute("cell_index").as_uint();
+        const std::size_t local_entity
+          = it->attribute("local_entity").as_uint();
+        const std::size_t value = it->attribute("value").as_uint();
+        mesh_value_collection.set_value(cell_index, local_entity, value);
+      }
+    }
+    else if (type == "int")
+    {
+      pugi::xml_node_iterator it;
+      for (it = mvc_node.begin(); it != mvc_node.end(); ++it)
+      {
+        const std::size_t cell_index = it->attribute("cell_index").as_uint();
+        const std::size_t local_entity
+          = it->attribute("local_entity").as_uint();
+        const int value = it->attribute("value").as_int();
+        mesh_value_collection.set_value(cell_index, local_entity, value);
+      }
+    }
+    else if (type == "double")
+    {
+      pugi::xml_node_iterator it;
+      for (it = mvc_node.begin(); it != mvc_node.end(); ++it)
+      {
+        const std::size_t cell_index = it->attribute("cell_index").as_uint();
+        const std::size_t local_entity
+          = it->attribute("local_entity").as_uint();
+        const double value = it->attribute("value").as_double();
+        mesh_value_collection.set_value(cell_index, local_entity, value);
+      }
+    }
+    else if (type == "bool")
+    {
+      pugi::xml_node_iterator it;
+      for (it = mvc_node.begin(); it != mvc_node.end(); ++it)
+      {
+        const std::size_t cell_index = it->attribute("cell_index").as_uint();
+        const std::size_t local_entity
+          = it->attribute("local_entity").as_uint();
+        const bool value = it->attribute("value").as_bool();
+        mesh_value_collection.set_value(cell_index, local_entity, value);
+      }
+    }
+    else
+    {
+      dolfin_error("XMLValueCollection.h",
+                   "read mesh value collection from XML file",
+                   "Unhandled value type \"%s\"", type.c_str());
+    }
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void XMLMeshValueCollection::write(const MeshValueCollection<T>&
+                                       mesh_value_collection,
+                                     const std::string type,
+                                     pugi::xml_node xml_node)
+  {
+    not_working_in_parallel("Writing XML MeshValueCollection");
+
+    // Add mesh function node and attributes
+    pugi::xml_node mf_node = xml_node.append_child("mesh_value_collection");
+    mf_node.append_attribute("name") = mesh_value_collection.name().c_str();
+    mf_node.append_attribute("type") = type.c_str();
+    mf_node.append_attribute("dim")
+      = (unsigned int)mesh_value_collection.dim();
+    mf_node.append_attribute("size")
+      = (unsigned int) mesh_value_collection.size();
+
+    // Add data
+    const std::map<std::pair<std::size_t, std::size_t>, T>&
+      values = mesh_value_collection.values();
+    typename std::map<std::pair<std::size_t,
+      std::size_t>, T>::const_iterator it;
+    for (it = values.begin(); it != values.end(); ++it)
+    {
+      pugi::xml_node entity_node = mf_node.append_child("value");
+      entity_node.append_attribute("cell_index")
+        = (unsigned int) it->first.first;
+      entity_node.append_attribute("local_entity")
+        = (unsigned int) it->first.second;
+      entity_node.append_attribute("value")
+        = boost::lexical_cast<std::string>(it->second).c_str();
+    }
+  }
+  //---------------------------------------------------------------------------
+
+}
+#endif
diff --git a/dolfin/io/XMLParameters.cpp b/dolfin/io/XMLParameters.cpp
new file mode 100644
index 0000000..9447562
--- /dev/null
+++ b/dolfin/io/XMLParameters.cpp
@@ -0,0 +1,164 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2009-03-16
+// Last changed: 2011-11-14
+
+#include "pugixml.hpp"
+#include <dolfin/log/log.h>
+#include <dolfin/parameter/Parameter.h>
+#include <dolfin/parameter/Parameters.h>
+#include "XMLParameters.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void XMLParameters::read(Parameters& p, const pugi::xml_node xml_dolfin)
+{
+  // Check that we have a XML Parameters
+  const pugi::xml_node xml_parameters = xml_dolfin.child("parameters");
+  if (!xml_parameters)
+  {
+    dolfin_error("XMLParameters.cpp",
+                 "read parameters from XML file",
+                 "Not a DOLFIN Parameters XML file");
+  }
+
+  // Check that there is only one root parameters set
+  if (xml_dolfin.first_child().next_sibling())
+  {
+    dolfin_error("XMLParameters.cpp",
+                 "read parameters from XML file",
+                 "Two parameter sets (not nested) are defined in XML file");
+  }
+
+  // Get name of root parameters and rename parameter set
+  const std::string name = xml_parameters.attribute("name").value();
+  p.rename(name);
+
+  // Read parameters
+  read_parameter_nest(p, xml_parameters);
+}
+//-----------------------------------------------------------------------------
+void XMLParameters::write(const Parameters& parameters, pugi::xml_node xml_node)
+{
+  // Get keys
+  std::vector<std::string> parameter_keys;
+  parameters.get_parameter_keys(parameter_keys);
+
+  // Add parameters node
+  pugi::xml_node parameters_node = xml_node.append_child("parameters");
+  parameters_node.append_attribute("name") = parameters.name().c_str();
+
+  // Write each parameter item
+  for (std::size_t i = 0; i < parameter_keys.size(); ++i)
+  {
+    const Parameter& parameter = parameters[parameter_keys[i]];
+
+    pugi::xml_node parameter_node = parameters_node.append_child("parameter");
+    parameter_node.append_attribute("key") = parameter.key().c_str();
+    parameter_node.append_attribute("type") = parameter.type_str().c_str();
+    if (parameter.type_str() == "int")
+      parameter_node.append_attribute("value") = static_cast<int>(parameter);
+    else if (parameter.type_str() == "double")
+      parameter_node.append_attribute("value") = static_cast<double>(parameter);
+    else if (parameter.type_str() == "bool")
+      parameter_node.append_attribute("value") = static_cast<bool>(parameter);
+    else if (parameter.type_str() == "string")
+      parameter_node.append_attribute("value") = static_cast<std::string>(parameter).c_str();
+    else
+    {
+      dolfin_error("XMLParameters.cpp",
+                   "write parameters to XML file",
+                   "Unknown type (\"%s\") of parameters \"%s\"",
+                   parameter.type_str().c_str(), parameter.key().c_str());
+    }
+  }
+
+  // Write nested parameter sets
+  std::vector<std::string> nested_keys;
+  parameters.get_parameter_set_keys(nested_keys);
+  for (std::size_t i = 0; i < nested_keys.size(); ++i)
+    write(parameters(nested_keys[i]), parameters_node);
+}
+//-----------------------------------------------------------------------------
+void XMLParameters::read_parameter_nest(Parameters& p,
+                                        const pugi::xml_node xml_node)
+{
+  // Iterate over parameters
+  for (pugi::xml_node_iterator it = xml_node.begin(); it != xml_node.end(); ++it)
+  {
+    // Get name (parameters or parameter)
+    const std::string node_name = it->name();
+    if (node_name == "parameters")
+    {
+      // Get name of parameters set
+      const std::string name = it->attribute("name").value();
+
+      // Create parameter set if necessary
+      if (!p.has_parameter_set(name))
+      {
+        Parameters nested_parameters(name);
+        p.add(nested_parameters);
+      }
+
+      // Set parameter value
+      read_parameter_nest(p(name), *it);
+    }
+    else if (node_name == "parameter")
+    {
+      const std::string key = it->attribute("key").value();
+      const std::string type = it->attribute("type").value();
+      const pugi::xml_attribute value = it->attribute("value");
+      if (type == "double")
+        XMLParameters::add_parameter(p, key, value.as_double());
+      else if (type == "int")
+        XMLParameters::add_parameter(p, key, value.as_int());
+      else if (type == "bool")
+        XMLParameters::add_parameter(p, key, value.as_bool());
+      else if (type == "string")
+        XMLParameters::add_parameter(p, key, value.value());
+      else
+      {
+        dolfin_error("XMLParameters.cpp",
+                     "read parameters from XML file",
+                     "Unknown type (\"%s\") of parameters \"%s\"",
+                     type.c_str(), key.c_str());
+      }
+    }
+    else
+    {
+      dolfin_error("XMLParameters.cpp",
+                   "read parameters from XML file",
+                   "Unknown tag (\"%s\") in XML Parameters file",
+                   node_name.c_str());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+template<typename T>
+void XMLParameters::add_parameter(Parameters& p, const std::string& key,
+                                  T value)
+{
+  if (p.has_parameter(key))
+    p[key] = value;
+  else
+    p.add(key, value);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/XMLParameters.h b/dolfin/io/XMLParameters.h
new file mode 100644
index 0000000..61409cb
--- /dev/null
+++ b/dolfin/io/XMLParameters.h
@@ -0,0 +1,60 @@
+// Copyright (C) 2011 Ola Skavhaug, Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-03-16
+// Last changed: 2011-03-28
+
+#ifndef __XML_PARAMETERS_H
+#define __XML_PARAMETERS_H
+
+#include <ostream>
+#include <string>
+
+namespace pugi
+{
+  class xml_node;
+}
+
+namespace dolfin
+{
+
+  class Parameters;
+
+  // FIXME: Need to test nested parameters and ranges in XML format
+
+  class XMLParameters
+  {
+  public:
+
+    /// Read parameters from XML file
+    static void read(Parameters& parameters, const pugi::xml_node xml_dolfin);
+
+    /// Write the XML file
+    static void write(const Parameters& parameters, pugi::xml_node xml_node);
+
+  private:
+
+    static void read_parameter_nest(Parameters& p, const pugi::xml_node xml_node);
+
+    template<typename T>
+    static void add_parameter(Parameters& p, const std::string& key, T value);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/XMLVector.cpp b/dolfin/io/XMLVector.cpp
new file mode 100644
index 0000000..3fdfe0b
--- /dev/null
+++ b/dolfin/io/XMLVector.cpp
@@ -0,0 +1,144 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2002-12-06
+// Last changed: 2011-11-17
+
+#include <iomanip>
+#include <iostream>
+#include <string>
+#include "pugixml.hpp"
+
+#include "dolfin/common/Array.h"
+#include "dolfin/common/MPI.h"
+#include "dolfin/fem/GenericDofMap.h"
+#include "dolfin/function/FunctionSpace.h"
+#include "dolfin/la/GenericVector.h"
+#include "dolfin/mesh/Mesh.h"
+#include "XMLArray.h"
+#include "XMLVector.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void XMLVector::read(GenericVector& x, const pugi::xml_node xml_dolfin)
+{
+  // Read data in to vectors
+  std::vector<double> data;
+  std::vector<dolfin::la_index> indices;
+  read(data, indices, xml_dolfin);
+
+  // Set data (GenericVector::apply will be called by calling function)
+  x.set(data.data(), data.size(), indices.data());
+}
+//-----------------------------------------------------------------------------
+void XMLVector::read(std::vector<double>& x, std::vector<dolfin::la_index>& indices,
+                     const pugi::xml_node xml_dolfin)
+{
+  // Check that we have a XML Vector
+  const pugi::xml_node xml_vector_node = xml_dolfin.child("vector");
+  if (!xml_vector_node)
+  {
+    dolfin_error("XMLVector.cpp",
+                 "read vector from XML file",
+                 "Not a DOLFIN Vector XML file");
+  }
+
+  // Get type and size
+  const pugi::xml_node array = xml_vector_node.child("array");
+  if (!array)
+  {
+    dolfin_error("XMLVector.cpp",
+                 "read vector from XML file",
+                 "Expecting an Array inside a DOLFIN Vector XML file");
+  }
+
+  const std::size_t size = array.attribute("size").as_uint();
+  const std::string type = array.attribute("type").value();
+
+  // Check if size is zero
+  if (size == 0)
+  {
+    dolfin_error("XMLVector.cpp",
+                 "read vector from XML file",
+                 "size is zero");
+  }
+
+  // Iterate over array entries
+  x.resize(size);
+  indices.resize(size);
+  for (pugi::xml_node_iterator it = array.begin(); it != array.end(); ++it)
+  {
+    const std::size_t index = it->attribute("index").as_uint();
+    const double value = it->attribute("value").as_double();
+    dolfin_assert(index < size);
+    indices[index] = index;
+    x[index] = value;
+  }
+}
+//-----------------------------------------------------------------------------
+std::size_t XMLVector::read_size(const pugi::xml_node xml_dolfin)
+{
+  // Check that we have a XML Vector
+  const pugi::xml_node xml_vector_node = xml_dolfin.child("vector");
+  if (!xml_vector_node)
+  {
+    dolfin_error("XMLVector.cpp",
+                 "read vector from XML file",
+                 "Not a DOLFIN Vector XML file");
+  }
+
+  // Get size
+  const pugi::xml_node array = xml_vector_node.child("array");
+  if (!array)
+    std::cout << "XMLVector::read_size: not a DOLFIN Array" << std::endl;
+
+  return array.attribute("size").as_uint();
+}
+//-----------------------------------------------------------------------------
+void XMLVector::write(const GenericVector& vector, pugi::xml_node xml_node,
+                      bool write_to_stream)
+{
+  // Gather entries from process i on process 0
+  std::vector<double> x;
+  if (MPI::size(vector.mpi_comm()) > 1)
+    vector.gather_on_zero(x);
+  else
+    vector.get_local(x);
+
+  const std::size_t size = vector.size();
+
+  // Check if size is zero
+  if (size == 0)
+  {
+    dolfin_error("XMLVector.cpp",
+                 "write vector to XML file",
+                 "size is zero");
+  }
+
+  if (write_to_stream)
+  {
+    dolfin_assert(size == x.size());
+
+    // Add vector node
+    pugi::xml_node vector_node = xml_node.append_child("vector");
+
+    // Write data
+    XMLArray::write(x, "double", vector_node);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/XMLVector.h b/dolfin/io/XMLVector.h
new file mode 100644
index 0000000..86672f3
--- /dev/null
+++ b/dolfin/io/XMLVector.h
@@ -0,0 +1,62 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2003-07-15
+// Last changed: 2006-05-23
+
+#ifndef __XMLVECTOR_H
+#define __XMLVECTOR_H
+
+#include <ostream>
+#include <vector>
+
+namespace pugi
+{
+  class xml_node;
+}
+
+namespace dolfin
+{
+
+  class FunctionSpace;
+  class GenericVector;
+
+  class XMLVector
+  {
+  public:
+
+    // Read XML vector. Vector must have correct size.
+    static void read(GenericVector& x, const pugi::xml_node xml_dolfin);
+
+    // Read XML vector in Array
+    static void read(std::vector<double>& x,
+                     std::vector<dolfin::la_index>& indices,
+                     const pugi::xml_node xml_dolfin);
+
+    // Read XML vector size
+    static std::size_t read_size(const pugi::xml_node xml_dolfin);
+
+    /// Write the XML file
+    static void write(const GenericVector& vector, pugi::xml_node xml_node,
+                      bool write_to_stream);
+
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/XYZFile.cpp b/dolfin/io/XYZFile.cpp
new file mode 100644
index 0000000..b6d2e96
--- /dev/null
+++ b/dolfin/io/XYZFile.cpp
@@ -0,0 +1,209 @@
+// Copyright (C) 2005-2007 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Nuno Lopes 2008
+// Modified by Anders Logg 2011
+//
+// First added:  2008-07-02
+// Last changed: 2011-11-21
+
+#include <fstream>
+#include <sstream>
+#include <boost/scoped_array.hpp>
+
+#include <dolfin/common/Array.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/Vector.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/Cell.h>
+#include "XYZFile.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+XYZFile::XYZFile(const std::string filename)
+  : GenericFile(filename, "XYZ")
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+XYZFile::~XYZFile()
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+void XYZFile::operator<<(const Function& u)
+{
+  // Update xyz file name and clear file
+  xyz_name_update();
+
+  // Write results
+  results_write(u);
+
+  // Increase the number of times we have saved the function
+  counter++;
+
+  cout << "Saved function " << u.name() << " (" << u.label()
+       << ") to file " << _filename << " in xd3d xyz format." << endl;
+}
+//----------------------------------------------------------------------------
+void XYZFile::results_write(const Function& u) const
+{
+  // Open file
+  std::ofstream fp(xyz_filename.c_str(), std::ios_base::app);
+  if (!fp)
+  {
+    dolfin_error("XYZFile.cpp",
+                 "write function to XYZ file"
+                 "Unable to open file \"%s\"", _filename.c_str());
+  }
+
+  const std::size_t rank = u.function_space()->element()->value_rank();
+  if (rank > 1)
+  {
+    dolfin_error("XYZFile.cpp",
+                 "write function XYZ file",
+                 "Only scalar functions can be saved in XYZ format");
+  }
+
+  // Get number of components
+  std::size_t dim = 1;
+  for (std::size_t i = 0; i < rank; i++)
+    dim *= u.function_space()->element()->value_dimension(i);
+
+  dolfin_assert(u.function_space()->mesh());
+  const Mesh& mesh = *u.function_space()->mesh();
+
+  // Allocate memory for function values at vertices
+  //const std::size_t size = mesh.num_vertices()*dim;
+  std::vector<double> values;
+
+  // Get function values at vertices
+  u.compute_vertex_values(values, mesh);
+
+  // Write function data at mesh vertices
+  if (dim > 1)
+  {
+    dolfin_error("XYZFile.cpp",
+                 "write function XYZ file",
+                 "Only scalar functions can be saved in XYZ format");
+  }
+
+  std::ostringstream ss;
+  ss << std::scientific;
+  for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+  {
+    ss.str("");
+    for (std::size_t i = 0; i < mesh.geometry().dim(); i++)
+      ss << vertex->x(i) << " ";
+    ss << values[vertex->index()];
+    ss <<std::endl;
+    fp << ss.str();
+  }
+}
+//----------------------------------------------------------------------------
+void XYZFile::xyz_name_update()
+{
+  std::string filestart, extension;
+  std::ostringstream fileid, newfilename;
+
+  fileid.fill('0');
+  fileid.width(6);
+
+  filestart.assign(_filename, 0, _filename.find("."));
+  extension.assign(_filename, _filename.find("."), _filename.size());
+
+  fileid << counter;
+  newfilename << filestart << fileid.str() << ".xyz";
+  xyz_filename = newfilename.str();
+
+  // Make sure file is empty
+  std::ofstream fp(xyz_filename.c_str(), std::ios_base::trunc);
+  if (!fp)
+  {
+    dolfin_error("XYZFile.cpp",
+                 "write data to XYZ file",
+                 "Unable to open file \"%s\"", xyz_filename.c_str());
+  }
+
+  // Add to index file
+  std::ofstream fp_index(_filename.c_str(), std::ios_base::trunc);
+  if (!fp_index)
+  {
+    dolfin_error("XYZFile.cpp",
+                 "write data to XYZ file",
+                 "Unable to open file \"%s\"", _filename.c_str());
+  }
+  else
+  {
+    // File is cleared in GenericFile::write so we rewrite the whole
+    // index every time, easier than messing with a flag to say that
+    // the file should not be cleared. This whole file needs some
+    // cleanup but we can sort that out later.
+    for (std::size_t i = 0; i < counter + 1; i++)
+    {
+      std::ostringstream fileid0;
+      fileid0.fill('0');
+      fileid0.width(6);
+      fileid0 << i;
+      std::ostringstream f;
+      f << filestart << fileid0.str() << ".xyz";
+      fp_index << f.str() << "\n";
+    }
+  }
+}
+//----------------------------------------------------------------------------
+template<typename T>
+void XYZFile::mesh_function_write(T& meshfunction)
+{
+  // Update xyz file name and clear file
+  xyz_name_update();
+
+  Mesh& mesh = meshfunction.mesh();
+
+  if (meshfunction.dim() != mesh.topology().dim())
+  {
+    dolfin_error("XYZFile.cpp",
+                 "write mesh function to XYZ file",
+                 "XYZ output of mesh functions is implemented for cell-based functions only");
+  }
+
+  // Open file
+  std::ofstream fp(xyz_filename.c_str(), std::ios_base::app);
+  if (!fp)
+  {
+    dolfin_error("XYZFile.cpp",
+                 "write mesh function to XYZ file",
+                 "Unable to open file \"%s\"", _filename.c_str());
+  }
+
+  fp << mesh.num_cells() << std::endl;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+    fp << meshfunction.get(cell->index())  << std::endl;
+
+  // Increase the number of times we have saved the mesh function
+  counter++;
+
+  cout << "saved mesh function " << counter << " times." << endl;
+  cout << "Saved mesh function " << mesh.name() << " (" << mesh.label()
+       << ") to file " << _filename << " in XYZ format." << endl;
+}
+//----------------------------------------------------------------------------
diff --git a/dolfin/io/XYZFile.h b/dolfin/io/XYZFile.h
new file mode 100644
index 0000000..73c5648
--- /dev/null
+++ b/dolfin/io/XYZFile.h
@@ -0,0 +1,63 @@
+// Copyright (C) 2005-2007 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Nuno Lopes 2008
+// Modified by Anders Logg 2011
+//
+// First added:  2008-07-02
+// Last changed: 2011-11-21
+
+#ifndef __XYZ_FILE_H
+#define __XYZ_FILE_H
+
+#include <string>
+#include "GenericFile.h"
+
+namespace dolfin
+{
+
+  class Function;
+
+  class XYZFile : public GenericFile
+  {
+  public:
+
+    /// Simple and light file format for use with Xd3d. Supports
+    /// scalar solution on 2D convex domains. The files only have a
+    /// list of xyz coordinates 'x y u(x,y)=z'
+
+    explicit XYZFile(const std::string filename);
+    ~XYZFile();
+
+    void operator<< (const Function& u);
+
+  private:
+
+    void results_write(const Function& u) const;
+    void xyz_name_update();
+
+    template<typename T>
+    void mesh_function_write(T& meshfunction);
+
+    // raw filename
+    std::string xyz_filename;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/io/base64.cpp b/dolfin/io/base64.cpp
new file mode 100644
index 0000000..528707b
--- /dev/null
+++ b/dolfin/io/base64.cpp
@@ -0,0 +1,124 @@
+/* 
+   base64.cpp and base64.h
+
+   Copyright (C) 2004-2008 René Nyffenegger
+
+   This source code is provided 'as-is', without any express or implied
+   warranty. In no event will the author be held liable for any damages
+   arising from the use of this software.
+
+   Permission is granted to anyone to use this software for any purpose,
+   including commercial applications, and to alter it and redistribute it
+   freely, subject to the following restrictions:
+
+   1. The origin of this source code must not be misrepresented; you must not
+      claim that you wrote the original source code. If you use this source code
+      in a product, an acknowledgment in the product documentation would be
+      appreciated but is not required.
+
+   2. Altered source versions must be plainly marked as such, and must not be
+      misrepresented as being the original source code.
+
+   3. This notice may not be removed or altered from any source distribution.
+
+   René Nyffenegger rene.nyffenegger@adp-gmbh.ch
+
+*/
+
+#include "base64.h"
+#include <iostream>
+
+static const std::string base64_chars = 
+             "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+             "abcdefghijklmnopqrstuvwxyz"
+             "0123456789+/";
+
+
+static inline bool is_base64(unsigned char c) {
+  return (isalnum(c) || (c == '+') || (c == '/'));
+}
+
+std::string base64_encode(unsigned char const* bytes_to_encode, unsigned int in_len) {
+  std::string ret;
+  int i = 0;
+  int j = 0;
+  unsigned char char_array_3[3];
+  unsigned char char_array_4[4];
+
+  while (in_len--) {
+    char_array_3[i++] = *(bytes_to_encode++);
+    if (i == 3) {
+      char_array_4[0] = (char_array_3[0] & 0xfc) >> 2;
+      char_array_4[1] = ((char_array_3[0] & 0x03) << 4) + ((char_array_3[1] & 0xf0) >> 4);
+      char_array_4[2] = ((char_array_3[1] & 0x0f) << 2) + ((char_array_3[2] & 0xc0) >> 6);
+      char_array_4[3] = char_array_3[2] & 0x3f;
+
+      for(i = 0; (i <4) ; i++)
+        ret += base64_chars[char_array_4[i]];
+      i = 0;
+    }
+  }
+
+  if (i)
+  {
+    for(j = i; j < 3; j++)
+      char_array_3[j] = '\0';
+
+    char_array_4[0] = (char_array_3[0] & 0xfc) >> 2;
+    char_array_4[1] = ((char_array_3[0] & 0x03) << 4) + ((char_array_3[1] & 0xf0) >> 4);
+    char_array_4[2] = ((char_array_3[1] & 0x0f) << 2) + ((char_array_3[2] & 0xc0) >> 6);
+    char_array_4[3] = char_array_3[2] & 0x3f;
+
+    for (j = 0; (j < i + 1); j++)
+      ret += base64_chars[char_array_4[j]];
+
+    while((i++ < 3))
+      ret += '=';
+
+  }
+
+  return ret;
+
+}
+
+std::string base64_decode(std::string const& encoded_string) {
+  int in_len = encoded_string.size();
+  int i = 0;
+  int j = 0;
+  int in_ = 0;
+  unsigned char char_array_4[4], char_array_3[3];
+  std::string ret;
+
+  while (in_len-- && ( encoded_string[in_] != '=') && is_base64(encoded_string[in_])) {
+    char_array_4[i++] = encoded_string[in_]; in_++;
+    if (i ==4) {
+      for (i = 0; i <4; i++)
+        char_array_4[i] = base64_chars.find(char_array_4[i]);
+
+      char_array_3[0] = (char_array_4[0] << 2) + ((char_array_4[1] & 0x30) >> 4);
+      char_array_3[1] = ((char_array_4[1] & 0xf) << 4) + ((char_array_4[2] & 0x3c) >> 2);
+      char_array_3[2] = ((char_array_4[2] & 0x3) << 6) + char_array_4[3];
+
+      for (i = 0; (i < 3); i++)
+        ret += char_array_3[i];
+      i = 0;
+    }
+  }
+
+  if (i) {
+    for (j = i; j <4; j++)
+      char_array_4[j] = 0;
+
+    for (j = 0; j <4; j++)
+      char_array_4[j] = base64_chars.find(char_array_4[j]);
+
+    char_array_3[0] = (char_array_4[0] << 2) + ((char_array_4[1] & 0x30) >> 4);
+    char_array_3[1] = ((char_array_4[1] & 0xf) << 4) + ((char_array_4[2] & 0x3c) >> 2);
+    char_array_3[2] = ((char_array_4[2] & 0x3) << 6) + char_array_4[3];
+
+    for (j = 0; (j < i - 1); j++) ret += char_array_3[j];
+  }
+
+  return ret;
+}
+
diff --git a/dolfin/io/base64.h b/dolfin/io/base64.h
new file mode 100644
index 0000000..5f87aec
--- /dev/null
+++ b/dolfin/io/base64.h
@@ -0,0 +1,5 @@
+#include <string>
+
+std::string base64_encode(unsigned char const* , unsigned int len);
+std::string base64_decode(std::string const& s);
+
diff --git a/dolfin/io/dolfin_io.h b/dolfin/io/dolfin_io.h
new file mode 100644
index 0000000..82d1de1
--- /dev/null
+++ b/dolfin/io/dolfin_io.h
@@ -0,0 +1,12 @@
+#ifndef __DOLFIN_IO_H
+#define __DOLFIN_IO_H
+
+// DOLFIN io interface
+
+#include <dolfin/io/GenericFile.h>
+#include <dolfin/io/File.h>
+#include <dolfin/io/XDMFFile.h>
+#include <dolfin/io/HDF5File.h>
+#include <dolfin/io/HDF5Attribute.h>
+
+#endif
diff --git a/dolfin/io/pugiconfig.hpp b/dolfin/io/pugiconfig.hpp
new file mode 100644
index 0000000..c219671
--- /dev/null
+++ b/dolfin/io/pugiconfig.hpp
@@ -0,0 +1,69 @@
+/**
+ * pugixml parser - version 1.2
+ * --------------------------------------------------------
+ * Copyright (C) 2006-2012, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
+ * Report bugs and download new versions at http://pugixml.org/
+ *
+ * This library is distributed under the MIT License. See notice at the end
+ * of this file.
+ *
+ * This work is based on the pugxml parser, which is:
+ * Copyright (C) 2003, by Kristen Wegner (kristen@tima.net)
+ */
+
+#ifndef HEADER_PUGICONFIG_HPP
+#define HEADER_PUGICONFIG_HPP
+
+// Uncomment this to enable wchar_t mode
+// #define PUGIXML_WCHAR_MODE
+
+// Uncomment this to disable XPath
+// #define PUGIXML_NO_XPATH
+
+// Uncomment this to disable STL
+// #define PUGIXML_NO_STL
+
+// Uncomment this to disable exceptions
+// #define PUGIXML_NO_EXCEPTIONS
+
+// Set this to control attributes for public classes/functions, i.e.:
+// #define PUGIXML_API __declspec(dllexport) // to export all public symbols from DLL
+// #define PUGIXML_CLASS __declspec(dllimport) // to import all classes from DLL
+// #define PUGIXML_FUNCTION __fastcall // to set calling conventions to all public functions to fastcall
+// In absence of PUGIXML_CLASS/PUGIXML_FUNCTION definitions PUGIXML_API is used instead
+
+// Uncomment this to switch to header-only version
+// #define PUGIXML_HEADER_ONLY
+// #include "pugixml.cpp"
+
+// Tune these constants to adjust memory-related behavior
+// #define PUGIXML_MEMORY_PAGE_SIZE 32768
+// #define PUGIXML_MEMORY_OUTPUT_STACK 10240
+// #define PUGIXML_MEMORY_XPATH_PAGE_SIZE 4096
+
+#endif
+
+/**
+ * Copyright (c) 2006-2012 Arseny Kapoulkine
+ *
+ * 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.
+ */
diff --git a/dolfin/io/pugixml.cpp b/dolfin/io/pugixml.cpp
new file mode 100644
index 0000000..4035ab1
--- /dev/null
+++ b/dolfin/io/pugixml.cpp
@@ -0,0 +1,10250 @@
+/**
+ * pugixml parser - version 1.2
+ * --------------------------------------------------------
+ * Copyright (C) 2006-2012, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
+ * Report bugs and download new versions at http://pugixml.org/
+ *
+ * This library is distributed under the MIT License. See notice at the end
+ * of this file.
+ *
+ * This work is based on the pugxml parser, which is:
+ * Copyright (C) 2003, by Kristen Wegner (kristen@tima.net)
+ */
+
+#ifndef SOURCE_PUGIXML_CPP
+#define SOURCE_PUGIXML_CPP
+
+#include "pugixml.hpp"
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <assert.h>
+#include <wchar.h>
+
+#ifndef PUGIXML_NO_XPATH
+#	include <math.h>
+#	include <float.h>
+#	ifdef PUGIXML_NO_EXCEPTIONS
+#		include <setjmp.h>
+#	endif
+#endif
+
+#ifndef PUGIXML_NO_STL
+#	include <istream>
+#	include <ostream>
+#	include <string>
+#endif
+
+// For placement new
+#include <new>
+
+#ifdef _MSC_VER
+#	pragma warning(push)
+#	pragma warning(disable: 4127) // conditional expression is constant
+#	pragma warning(disable: 4324) // structure was padded due to __declspec(align())
+#	pragma warning(disable: 4611) // interaction between '_setjmp' and C++ object destruction is non-portable
+#	pragma warning(disable: 4702) // unreachable code
+#	pragma warning(disable: 4996) // this function or variable may be unsafe
+#	pragma warning(disable: 4793) // function compiled as native: presence of '_setjmp' makes a function unmanaged
+#endif
+
+#ifdef __INTEL_COMPILER
+#	pragma warning(disable: 177) // function was declared but never referenced 
+#	pragma warning(disable: 279) // controlling expression is constant
+#	pragma warning(disable: 1478 1786) // function was declared "deprecated"
+#	pragma warning(disable: 1684) // conversion from pointer to same-sized integral type
+#endif
+
+#if defined(__BORLANDC__) && defined(PUGIXML_HEADER_ONLY)
+#	pragma warn -8080 // symbol is declared but never used; disabling this inside push/pop bracket does not make the warning go away
+#endif
+
+#ifdef __BORLANDC__
+#	pragma option push
+#	pragma warn -8008 // condition is always false
+#	pragma warn -8066 // unreachable code
+#endif
+
+#ifdef __SNC__
+// Using diag_push/diag_pop does not disable the warnings inside templates due to a compiler bug
+#	pragma diag_suppress=178 // function was declared but never referenced
+#	pragma diag_suppress=237 // controlling expression is constant
+#endif
+
+// Inlining controls
+#if defined(_MSC_VER) && _MSC_VER >= 1300
+#	define PUGI__NO_INLINE __declspec(noinline)
+#elif defined(__GNUC__)
+#	define PUGI__NO_INLINE __attribute__((noinline))
+#else
+#	define PUGI__NO_INLINE 
+#endif
+
+// Simple static assertion
+#define PUGI__STATIC_ASSERT(cond) { static const char condition_failed[(cond) ? 1 : -1] = {0}; (void)condition_failed[0]; }
+
+// Digital Mars C++ bug workaround for passing char loaded from memory via stack
+#ifdef __DMC__
+#	define PUGI__DMC_VOLATILE volatile
+#else
+#	define PUGI__DMC_VOLATILE
+#endif
+
+// Borland C++ bug workaround for not defining ::memcpy depending on header include order (can't always use std::memcpy because some compilers don't have it at all)
+#if defined(__BORLANDC__) && !defined(__MEM_H_USING_LIST)
+using std::memcpy;
+using std::memmove;
+#endif
+
+// In some environments MSVC is a compiler but the CRT lacks certain MSVC-specific features
+#if defined(_MSC_VER) && !defined(__S3E__)
+#	define PUGI__MSVC_CRT_VERSION _MSC_VER
+#endif
+
+#ifdef PUGIXML_HEADER_ONLY
+#	define PUGI__NS_BEGIN namespace pugi { namespace impl {
+#	define PUGI__NS_END } }
+#	define PUGI__FN inline
+#	define PUGI__FN_NO_INLINE inline
+#else
+#	if defined(_MSC_VER) && _MSC_VER < 1300 // MSVC6 seems to have an amusing bug with anonymous namespaces inside namespaces
+#		define PUGI__NS_BEGIN namespace pugi { namespace impl {
+#		define PUGI__NS_END } }
+#	else
+#		define PUGI__NS_BEGIN namespace pugi { namespace impl { namespace {
+#		define PUGI__NS_END } } }
+#	endif
+#	define PUGI__FN
+#	define PUGI__FN_NO_INLINE PUGI__NO_INLINE
+#endif
+
+// uintptr_t
+#if !defined(_MSC_VER) || _MSC_VER >= 1600
+#	include <stdint.h>
+#else
+#	ifndef _UINTPTR_T_DEFINED
+// No native uintptr_t in MSVC6 and in some WinCE versions
+typedef size_t uintptr_t;
+#define _UINTPTR_T_DEFINED
+#	endif
+PUGI__NS_BEGIN
+	typedef unsigned __int8 uint8_t;
+	typedef unsigned __int16 uint16_t;
+	typedef unsigned __int32 uint32_t;
+PUGI__NS_END
+#endif
+
+// Memory allocation
+PUGI__NS_BEGIN
+	PUGI__FN void* default_allocate(size_t size)
+	{
+		return malloc(size);
+	}
+
+	PUGI__FN void default_deallocate(void* ptr)
+	{
+		free(ptr);
+	}
+
+	template <typename T>
+	struct xml_memory_management_function_storage
+	{
+		static allocation_function allocate;
+		static deallocation_function deallocate;
+	};
+
+	template <typename T> allocation_function xml_memory_management_function_storage<T>::allocate = default_allocate;
+	template <typename T> deallocation_function xml_memory_management_function_storage<T>::deallocate = default_deallocate;
+
+	typedef xml_memory_management_function_storage<int> xml_memory;
+PUGI__NS_END
+
+// String utilities
+PUGI__NS_BEGIN
+	// Get string length
+	PUGI__FN size_t strlength(const char_t* s)
+	{
+		assert(s);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcslen(s);
+	#else
+		return strlen(s);
+	#endif
+	}
+
+	// Compare two strings
+	PUGI__FN bool strequal(const char_t* src, const char_t* dst)
+	{
+		assert(src && dst);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcscmp(src, dst) == 0;
+	#else
+		return strcmp(src, dst) == 0;
+	#endif
+	}
+
+	// Compare lhs with [rhs_begin, rhs_end)
+	PUGI__FN bool strequalrange(const char_t* lhs, const char_t* rhs, size_t count)
+	{
+		for (size_t i = 0; i < count; ++i)
+			if (lhs[i] != rhs[i])
+				return false;
+	
+		return lhs[count] == 0;
+	}
+	
+#ifdef PUGIXML_WCHAR_MODE
+	// Convert string to wide string, assuming all symbols are ASCII
+	PUGI__FN void widen_ascii(wchar_t* dest, const char* source)
+	{
+		for (const char* i = source; *i; ++i) *dest++ = *i;
+		*dest = 0;
+	}
+#endif
+PUGI__NS_END
+
+#if !defined(PUGIXML_NO_STL) || !defined(PUGIXML_NO_XPATH)
+// auto_ptr-like buffer holder for exception recovery
+PUGI__NS_BEGIN
+	struct buffer_holder
+	{
+		void* data;
+		void (*deleter)(void*);
+
+		buffer_holder(void* data_, void (*deleter_)(void*)): data(data_), deleter(deleter_)
+		{
+		}
+
+		~buffer_holder()
+		{
+			if (data) deleter(data);
+		}
+
+		void* release()
+		{
+			void* result = data;
+			data = 0;
+			return result;
+		}
+	};
+PUGI__NS_END
+#endif
+
+PUGI__NS_BEGIN
+	static const size_t xml_memory_page_size =
+	#ifdef PUGIXML_MEMORY_PAGE_SIZE
+		PUGIXML_MEMORY_PAGE_SIZE
+	#else
+		32768
+	#endif
+		;
+
+	static const uintptr_t xml_memory_page_alignment = 32;
+	static const uintptr_t xml_memory_page_pointer_mask = ~(xml_memory_page_alignment - 1);
+	static const uintptr_t xml_memory_page_name_allocated_mask = 16;
+	static const uintptr_t xml_memory_page_value_allocated_mask = 8;
+	static const uintptr_t xml_memory_page_type_mask = 7;
+
+	struct xml_allocator;
+
+	struct xml_memory_page
+	{
+		static xml_memory_page* construct(void* memory)
+		{
+			if (!memory) return 0; //$ redundant, left for performance
+
+			xml_memory_page* result = static_cast<xml_memory_page*>(memory);
+
+			result->allocator = 0;
+			result->memory = 0;
+			result->prev = 0;
+			result->next = 0;
+			result->busy_size = 0;
+			result->freed_size = 0;
+
+			return result;
+		}
+
+		xml_allocator* allocator;
+
+		void* memory;
+
+		xml_memory_page* prev;
+		xml_memory_page* next;
+
+		size_t busy_size;
+		size_t freed_size;
+
+		char data[1];
+	};
+
+	struct xml_memory_string_header
+	{
+		uint16_t page_offset; // offset from page->data
+		uint16_t full_size; // 0 if string occupies whole page
+	};
+
+	struct xml_allocator
+	{
+		xml_allocator(xml_memory_page* root): _root(root), _busy_size(root->busy_size)
+		{
+		}
+
+		xml_memory_page* allocate_page(size_t data_size)
+		{
+			size_t size = offsetof(xml_memory_page, data) + data_size;
+
+			// allocate block with some alignment, leaving memory for worst-case padding
+			void* memory = xml_memory::allocate(size + xml_memory_page_alignment);
+			if (!memory) return 0;
+
+			// align upwards to page boundary
+			void* page_memory = reinterpret_cast<void*>((reinterpret_cast<uintptr_t>(memory) + (xml_memory_page_alignment - 1)) & ~(xml_memory_page_alignment - 1));
+
+			// prepare page structure
+			xml_memory_page* page = xml_memory_page::construct(page_memory);
+
+			page->memory = memory;
+			page->allocator = _root->allocator;
+
+			return page;
+		}
+
+		static void deallocate_page(xml_memory_page* page)
+		{
+			xml_memory::deallocate(page->memory);
+		}
+
+		void* allocate_memory_oob(size_t size, xml_memory_page*& out_page);
+
+		void* allocate_memory(size_t size, xml_memory_page*& out_page)
+		{
+			if (_busy_size + size > xml_memory_page_size) return allocate_memory_oob(size, out_page);
+
+			void* buf = _root->data + _busy_size;
+
+			_busy_size += size;
+
+			out_page = _root;
+
+			return buf;
+		}
+
+		void deallocate_memory(void* ptr, size_t size, xml_memory_page* page)
+		{
+			if (page == _root) page->busy_size = _busy_size;
+
+			assert(ptr >= page->data && ptr < page->data + page->busy_size);
+			(void)!ptr;
+
+			page->freed_size += size;
+			assert(page->freed_size <= page->busy_size);
+
+			if (page->freed_size == page->busy_size)
+			{
+				if (page->next == 0)
+				{
+					assert(_root == page);
+
+					// top page freed, just reset sizes
+					page->busy_size = page->freed_size = 0;
+					_busy_size = 0;
+				}
+				else
+				{
+					assert(_root != page);
+					assert(page->prev);
+
+					// remove from the list
+					page->prev->next = page->next;
+					page->next->prev = page->prev;
+
+					// deallocate
+					deallocate_page(page);
+				}
+			}
+		}
+
+		char_t* allocate_string(size_t length)
+		{
+			// allocate memory for string and header block
+			size_t size = sizeof(xml_memory_string_header) + length * sizeof(char_t);
+			
+			// round size up to pointer alignment boundary
+			size_t full_size = (size + (sizeof(void*) - 1)) & ~(sizeof(void*) - 1);
+
+			xml_memory_page* page;
+			xml_memory_string_header* header = static_cast<xml_memory_string_header*>(allocate_memory(full_size, page));
+
+			if (!header) return 0;
+
+			// setup header
+			ptrdiff_t page_offset = reinterpret_cast<char*>(header) - page->data;
+
+			assert(page_offset >= 0 && page_offset < (1 << 16));
+			header->page_offset = static_cast<uint16_t>(page_offset);
+
+			// full_size == 0 for large strings that occupy the whole page
+			assert(full_size < (1 << 16) || (page->busy_size == full_size && page_offset == 0));
+			header->full_size = static_cast<uint16_t>(full_size < (1 << 16) ? full_size : 0);
+
+			// round-trip through void* to avoid 'cast increases required alignment of target type' warning
+			// header is guaranteed a pointer-sized alignment, which should be enough for char_t
+			return static_cast<char_t*>(static_cast<void*>(header + 1));
+		}
+
+		void deallocate_string(char_t* string)
+		{
+			// this function casts pointers through void* to avoid 'cast increases required alignment of target type' warnings
+			// we're guaranteed the proper (pointer-sized) alignment on the input string if it was allocated via allocate_string
+
+			// get header
+			xml_memory_string_header* header = static_cast<xml_memory_string_header*>(static_cast<void*>(string)) - 1;
+
+			// deallocate
+			size_t page_offset = offsetof(xml_memory_page, data) + header->page_offset;
+			xml_memory_page* page = reinterpret_cast<xml_memory_page*>(static_cast<void*>(reinterpret_cast<char*>(header) - page_offset));
+
+			// if full_size == 0 then this string occupies the whole page
+			size_t full_size = header->full_size == 0 ? page->busy_size : header->full_size;
+
+			deallocate_memory(header, full_size, page);
+		}
+
+		xml_memory_page* _root;
+		size_t _busy_size;
+	};
+
+	PUGI__FN_NO_INLINE void* xml_allocator::allocate_memory_oob(size_t size, xml_memory_page*& out_page)
+	{
+		const size_t large_allocation_threshold = xml_memory_page_size / 4;
+
+		xml_memory_page* page = allocate_page(size <= large_allocation_threshold ? xml_memory_page_size : size);
+		out_page = page;
+
+		if (!page) return 0;
+
+		if (size <= large_allocation_threshold)
+		{
+			_root->busy_size = _busy_size;
+
+			// insert page at the end of linked list
+			page->prev = _root;
+			_root->next = page;
+			_root = page;
+
+			_busy_size = size;
+		}
+		else
+		{
+			// insert page before the end of linked list, so that it is deleted as soon as possible
+			// the last page is not deleted even if it's empty (see deallocate_memory)
+			assert(_root->prev);
+
+			page->prev = _root->prev;
+			page->next = _root;
+
+			_root->prev->next = page;
+			_root->prev = page;
+		}
+
+		// allocate inside page
+		page->busy_size = size;
+
+		return page->data;
+	}
+PUGI__NS_END
+
+namespace pugi
+{
+	/// A 'name=value' XML attribute structure.
+	struct xml_attribute_struct
+	{
+		/// Default ctor
+		xml_attribute_struct(impl::xml_memory_page* page): header(reinterpret_cast<uintptr_t>(page)), name(0), value(0), prev_attribute_c(0), next_attribute(0)
+		{
+		}
+
+		uintptr_t header;
+
+		char_t* name;	///< Pointer to attribute name.
+		char_t*	value;	///< Pointer to attribute value.
+
+		xml_attribute_struct* prev_attribute_c;	///< Previous attribute (cyclic list)
+		xml_attribute_struct* next_attribute;	///< Next attribute
+	};
+
+	/// An XML document tree node.
+	struct xml_node_struct
+	{
+		/// Default ctor
+		/// \param type - node type
+		xml_node_struct(impl::xml_memory_page* page, xml_node_type type): header(reinterpret_cast<uintptr_t>(page) | (type - 1)), parent(0), name(0), value(0), first_child(0), prev_sibling_c(0), next_sibling(0), first_attribute(0)
+		{
+		}
+
+		uintptr_t header;
+
+		xml_node_struct*		parent;					///< Pointer to parent
+
+		char_t*					name;					///< Pointer to element name.
+		char_t*					value;					///< Pointer to any associated string data.
+
+		xml_node_struct*		first_child;			///< First child
+		
+		xml_node_struct*		prev_sibling_c;			///< Left brother (cyclic list)
+		xml_node_struct*		next_sibling;			///< Right brother
+		
+		xml_attribute_struct*	first_attribute;		///< First attribute
+	};
+}
+
+PUGI__NS_BEGIN
+	struct xml_document_struct: public xml_node_struct, public xml_allocator
+	{
+		xml_document_struct(xml_memory_page* page): xml_node_struct(page, node_document), xml_allocator(page), buffer(0)
+		{
+		}
+
+		const char_t* buffer;
+	};
+
+	inline xml_allocator& get_allocator(const xml_node_struct* node)
+	{
+		assert(node);
+
+		return *reinterpret_cast<xml_memory_page*>(node->header & xml_memory_page_pointer_mask)->allocator;
+	}
+PUGI__NS_END
+
+// Low-level DOM operations
+PUGI__NS_BEGIN
+	inline xml_attribute_struct* allocate_attribute(xml_allocator& alloc)
+	{
+		xml_memory_page* page;
+		void* memory = alloc.allocate_memory(sizeof(xml_attribute_struct), page);
+
+		return new (memory) xml_attribute_struct(page);
+	}
+
+	inline xml_node_struct* allocate_node(xml_allocator& alloc, xml_node_type type)
+	{
+		xml_memory_page* page;
+		void* memory = alloc.allocate_memory(sizeof(xml_node_struct), page);
+
+		return new (memory) xml_node_struct(page, type);
+	}
+
+	inline void destroy_attribute(xml_attribute_struct* a, xml_allocator& alloc)
+	{
+		uintptr_t header = a->header;
+
+		if (header & impl::xml_memory_page_name_allocated_mask) alloc.deallocate_string(a->name);
+		if (header & impl::xml_memory_page_value_allocated_mask) alloc.deallocate_string(a->value);
+
+		alloc.deallocate_memory(a, sizeof(xml_attribute_struct), reinterpret_cast<xml_memory_page*>(header & xml_memory_page_pointer_mask));
+	}
+
+	inline void destroy_node(xml_node_struct* n, xml_allocator& alloc)
+	{
+		uintptr_t header = n->header;
+
+		if (header & impl::xml_memory_page_name_allocated_mask) alloc.deallocate_string(n->name);
+		if (header & impl::xml_memory_page_value_allocated_mask) alloc.deallocate_string(n->value);
+
+		for (xml_attribute_struct* attr = n->first_attribute; attr; )
+		{
+			xml_attribute_struct* next = attr->next_attribute;
+
+			destroy_attribute(attr, alloc);
+
+			attr = next;
+		}
+
+		for (xml_node_struct* child = n->first_child; child; )
+		{
+			xml_node_struct* next = child->next_sibling;
+
+			destroy_node(child, alloc);
+
+			child = next;
+		}
+
+		alloc.deallocate_memory(n, sizeof(xml_node_struct), reinterpret_cast<xml_memory_page*>(header & xml_memory_page_pointer_mask));
+	}
+
+	PUGI__FN_NO_INLINE xml_node_struct* append_node(xml_node_struct* node, xml_allocator& alloc, xml_node_type type = node_element)
+	{
+		xml_node_struct* child = allocate_node(alloc, type);
+		if (!child) return 0;
+
+		child->parent = node;
+
+		xml_node_struct* first_child = node->first_child;
+			
+		if (first_child)
+		{
+			xml_node_struct* last_child = first_child->prev_sibling_c;
+
+			last_child->next_sibling = child;
+			child->prev_sibling_c = last_child;
+			first_child->prev_sibling_c = child;
+		}
+		else
+		{
+			node->first_child = child;
+			child->prev_sibling_c = child;
+		}
+			
+		return child;
+	}
+
+	PUGI__FN_NO_INLINE xml_attribute_struct* append_attribute_ll(xml_node_struct* node, xml_allocator& alloc)
+	{
+		xml_attribute_struct* a = allocate_attribute(alloc);
+		if (!a) return 0;
+
+		xml_attribute_struct* first_attribute = node->first_attribute;
+
+		if (first_attribute)
+		{
+			xml_attribute_struct* last_attribute = first_attribute->prev_attribute_c;
+
+			last_attribute->next_attribute = a;
+			a->prev_attribute_c = last_attribute;
+			first_attribute->prev_attribute_c = a;
+		}
+		else
+		{
+			node->first_attribute = a;
+			a->prev_attribute_c = a;
+		}
+			
+		return a;
+	}
+PUGI__NS_END
+
+// Helper classes for code generation
+PUGI__NS_BEGIN
+	struct opt_false
+	{
+		enum { value = 0 };
+	};
+
+	struct opt_true
+	{
+		enum { value = 1 };
+	};
+PUGI__NS_END
+
+// Unicode utilities
+PUGI__NS_BEGIN
+	inline uint16_t endian_swap(uint16_t value)
+	{
+		return static_cast<uint16_t>(((value & 0xff) << 8) | (value >> 8));
+	}
+
+	inline uint32_t endian_swap(uint32_t value)
+	{
+		return ((value & 0xff) << 24) | ((value & 0xff00) << 8) | ((value & 0xff0000) >> 8) | (value >> 24);
+	}
+
+	struct utf8_counter
+	{
+		typedef size_t value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			// U+0000..U+007F
+			if (ch < 0x80) return result + 1;
+			// U+0080..U+07FF
+			else if (ch < 0x800) return result + 2;
+			// U+0800..U+FFFF
+			else return result + 3;
+		}
+
+		static value_type high(value_type result, uint32_t)
+		{
+			// U+10000..U+10FFFF
+			return result + 4;
+		}
+	};
+
+	struct utf8_writer
+	{
+		typedef uint8_t* value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			// U+0000..U+007F
+			if (ch < 0x80)
+			{
+				*result = static_cast<uint8_t>(ch);
+				return result + 1;
+			}
+			// U+0080..U+07FF
+			else if (ch < 0x800)
+			{
+				result[0] = static_cast<uint8_t>(0xC0 | (ch >> 6));
+				result[1] = static_cast<uint8_t>(0x80 | (ch & 0x3F));
+				return result + 2;
+			}
+			// U+0800..U+FFFF
+			else
+			{
+				result[0] = static_cast<uint8_t>(0xE0 | (ch >> 12));
+				result[1] = static_cast<uint8_t>(0x80 | ((ch >> 6) & 0x3F));
+				result[2] = static_cast<uint8_t>(0x80 | (ch & 0x3F));
+				return result + 3;
+			}
+		}
+
+		static value_type high(value_type result, uint32_t ch)
+		{
+			// U+10000..U+10FFFF
+			result[0] = static_cast<uint8_t>(0xF0 | (ch >> 18));
+			result[1] = static_cast<uint8_t>(0x80 | ((ch >> 12) & 0x3F));
+			result[2] = static_cast<uint8_t>(0x80 | ((ch >> 6) & 0x3F));
+			result[3] = static_cast<uint8_t>(0x80 | (ch & 0x3F));
+			return result + 4;
+		}
+
+		static value_type any(value_type result, uint32_t ch)
+		{
+			return (ch < 0x10000) ? low(result, ch) : high(result, ch);
+		}
+	};
+
+	struct utf16_counter
+	{
+		typedef size_t value_type;
+
+		static value_type low(value_type result, uint32_t)
+		{
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t)
+		{
+			return result + 2;
+		}
+	};
+
+	struct utf16_writer
+	{
+		typedef uint16_t* value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			*result = static_cast<uint16_t>(ch);
+
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t ch)
+		{
+			uint32_t msh = static_cast<uint32_t>(ch - 0x10000) >> 10;
+			uint32_t lsh = static_cast<uint32_t>(ch - 0x10000) & 0x3ff;
+
+			result[0] = static_cast<uint16_t>(0xD800 + msh);
+			result[1] = static_cast<uint16_t>(0xDC00 + lsh);
+
+			return result + 2;
+		}
+
+		static value_type any(value_type result, uint32_t ch)
+		{
+			return (ch < 0x10000) ? low(result, ch) : high(result, ch);
+		}
+	};
+
+	struct utf32_counter
+	{
+		typedef size_t value_type;
+
+		static value_type low(value_type result, uint32_t)
+		{
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t)
+		{
+			return result + 1;
+		}
+	};
+
+	struct utf32_writer
+	{
+		typedef uint32_t* value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			*result = ch;
+
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t ch)
+		{
+			*result = ch;
+
+			return result + 1;
+		}
+
+		static value_type any(value_type result, uint32_t ch)
+		{
+			*result = ch;
+
+			return result + 1;
+		}
+	};
+
+	struct latin1_writer
+	{
+		typedef uint8_t* value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			*result = static_cast<uint8_t>(ch > 255 ? '?' : ch);
+
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t ch)
+		{
+			(void)ch;
+
+			*result = '?';
+
+			return result + 1;
+		}
+	};
+
+	template <size_t size> struct wchar_selector;
+
+	template <> struct wchar_selector<2>
+	{
+		typedef uint16_t type;
+		typedef utf16_counter counter;
+		typedef utf16_writer writer;
+	};
+
+	template <> struct wchar_selector<4>
+	{
+		typedef uint32_t type;
+		typedef utf32_counter counter;
+		typedef utf32_writer writer;
+	};
+
+	typedef wchar_selector<sizeof(wchar_t)>::counter wchar_counter;
+	typedef wchar_selector<sizeof(wchar_t)>::writer wchar_writer;
+
+	template <typename Traits, typename opt_swap = opt_false> struct utf_decoder
+	{
+		static inline typename Traits::value_type decode_utf8_block(const uint8_t* data, size_t size, typename Traits::value_type result)
+		{
+			const uint8_t utf8_byte_mask = 0x3f;
+
+			while (size)
+			{
+				uint8_t lead = *data;
+
+				// 0xxxxxxx -> U+0000..U+007F
+				if (lead < 0x80)
+				{
+					result = Traits::low(result, lead);
+					data += 1;
+					size -= 1;
+
+					// process aligned single-byte (ascii) blocks
+					if ((reinterpret_cast<uintptr_t>(data) & 3) == 0)
+					{
+						// round-trip through void* to silence 'cast increases required alignment of target type' warnings
+						while (size >= 4 && (*static_cast<const uint32_t*>(static_cast<const void*>(data)) & 0x80808080) == 0)
+						{
+							result = Traits::low(result, data[0]);
+							result = Traits::low(result, data[1]);
+							result = Traits::low(result, data[2]);
+							result = Traits::low(result, data[3]);
+							data += 4;
+							size -= 4;
+						}
+					}
+				}
+				// 110xxxxx -> U+0080..U+07FF
+				else if (static_cast<unsigned int>(lead - 0xC0) < 0x20 && size >= 2 && (data[1] & 0xc0) == 0x80)
+				{
+					result = Traits::low(result, ((lead & ~0xC0) << 6) | (data[1] & utf8_byte_mask));
+					data += 2;
+					size -= 2;
+				}
+				// 1110xxxx -> U+0800-U+FFFF
+				else if (static_cast<unsigned int>(lead - 0xE0) < 0x10 && size >= 3 && (data[1] & 0xc0) == 0x80 && (data[2] & 0xc0) == 0x80)
+				{
+					result = Traits::low(result, ((lead & ~0xE0) << 12) | ((data[1] & utf8_byte_mask) << 6) | (data[2] & utf8_byte_mask));
+					data += 3;
+					size -= 3;
+				}
+				// 11110xxx -> U+10000..U+10FFFF
+				else if (static_cast<unsigned int>(lead - 0xF0) < 0x08 && size >= 4 && (data[1] & 0xc0) == 0x80 && (data[2] & 0xc0) == 0x80 && (data[3] & 0xc0) == 0x80)
+				{
+					result = Traits::high(result, ((lead & ~0xF0) << 18) | ((data[1] & utf8_byte_mask) << 12) | ((data[2] & utf8_byte_mask) << 6) | (data[3] & utf8_byte_mask));
+					data += 4;
+					size -= 4;
+				}
+				// 10xxxxxx or 11111xxx -> invalid
+				else
+				{
+					data += 1;
+					size -= 1;
+				}
+			}
+
+			return result;
+		}
+
+		static inline typename Traits::value_type decode_utf16_block(const uint16_t* data, size_t size, typename Traits::value_type result)
+		{
+			const uint16_t* end = data + size;
+
+			while (data < end)
+			{
+				uint16_t lead = opt_swap::value ? endian_swap(*data) : *data;
+
+				// U+0000..U+D7FF
+				if (lead < 0xD800)
+				{
+					result = Traits::low(result, lead);
+					data += 1;
+				}
+				// U+E000..U+FFFF
+				else if (static_cast<unsigned int>(lead - 0xE000) < 0x2000)
+				{
+					result = Traits::low(result, lead);
+					data += 1;
+				}
+				// surrogate pair lead
+				else if (static_cast<unsigned int>(lead - 0xD800) < 0x400 && data + 1 < end)
+				{
+					uint16_t next = opt_swap::value ? endian_swap(data[1]) : data[1];
+
+					if (static_cast<unsigned int>(next - 0xDC00) < 0x400)
+					{
+						result = Traits::high(result, 0x10000 + ((lead & 0x3ff) << 10) + (next & 0x3ff));
+						data += 2;
+					}
+					else
+					{
+						data += 1;
+					}
+				}
+				else
+				{
+					data += 1;
+				}
+			}
+
+			return result;
+		}
+
+		static inline typename Traits::value_type decode_utf32_block(const uint32_t* data, size_t size, typename Traits::value_type result)
+		{
+			const uint32_t* end = data + size;
+
+			while (data < end)
+			{
+				uint32_t lead = opt_swap::value ? endian_swap(*data) : *data;
+
+				// U+0000..U+FFFF
+				if (lead < 0x10000)
+				{
+					result = Traits::low(result, lead);
+					data += 1;
+				}
+				// U+10000..U+10FFFF
+				else
+				{
+					result = Traits::high(result, lead);
+					data += 1;
+				}
+			}
+
+			return result;
+		}
+
+		static inline typename Traits::value_type decode_latin1_block(const uint8_t* data, size_t size, typename Traits::value_type result)
+		{
+			for (size_t i = 0; i < size; ++i)
+			{
+				result = Traits::low(result, data[i]);
+			}
+
+			return result;
+		}
+
+		static inline typename Traits::value_type decode_wchar_block_impl(const uint16_t* data, size_t size, typename Traits::value_type result)
+		{
+			return decode_utf16_block(data, size, result);
+		}
+
+		static inline typename Traits::value_type decode_wchar_block_impl(const uint32_t* data, size_t size, typename Traits::value_type result)
+		{
+			return decode_utf32_block(data, size, result);
+		}
+
+		static inline typename Traits::value_type decode_wchar_block(const wchar_t* data, size_t size, typename Traits::value_type result)
+		{
+			return decode_wchar_block_impl(reinterpret_cast<const wchar_selector<sizeof(wchar_t)>::type*>(data), size, result);
+		}
+	};
+
+	template <typename T> PUGI__FN void convert_utf_endian_swap(T* result, const T* data, size_t length)
+	{
+		for (size_t i = 0; i < length; ++i) result[i] = endian_swap(data[i]);
+	}
+
+#ifdef PUGIXML_WCHAR_MODE
+	PUGI__FN void convert_wchar_endian_swap(wchar_t* result, const wchar_t* data, size_t length)
+	{
+		for (size_t i = 0; i < length; ++i) result[i] = static_cast<wchar_t>(endian_swap(static_cast<wchar_selector<sizeof(wchar_t)>::type>(data[i])));
+	}
+#endif
+PUGI__NS_END
+
+PUGI__NS_BEGIN
+	enum chartype_t
+	{
+		ct_parse_pcdata = 1,	// \0, &, \r, <
+		ct_parse_attr = 2,		// \0, &, \r, ', "
+		ct_parse_attr_ws = 4,	// \0, &, \r, ', ", \n, tab
+		ct_space = 8,			// \r, \n, space, tab
+		ct_parse_cdata = 16,	// \0, ], >, \r
+		ct_parse_comment = 32,	// \0, -, >, \r
+		ct_symbol = 64,			// Any symbol > 127, a-z, A-Z, 0-9, _, :, -, .
+		ct_start_symbol = 128	// Any symbol > 127, a-z, A-Z, _, :
+	};
+
+	static const unsigned char chartype_table[256] =
+	{
+		55,  0,   0,   0,   0,   0,   0,   0,      0,   12,  12,  0,   0,   63,  0,   0,   // 0-15
+		0,   0,   0,   0,   0,   0,   0,   0,      0,   0,   0,   0,   0,   0,   0,   0,   // 16-31
+		8,   0,   6,   0,   0,   0,   7,   6,      0,   0,   0,   0,   0,   96,  64,  0,   // 32-47
+		64,  64,  64,  64,  64,  64,  64,  64,     64,  64,  192, 0,   1,   0,   48,  0,   // 48-63
+		0,   192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192, // 64-79
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 0,   0,   16,  0,   192, // 80-95
+		0,   192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192, // 96-111
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 0, 0, 0, 0, 0,           // 112-127
+
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192, // 128+
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192,    192, 192, 192, 192, 192, 192, 192, 192
+	};
+
+	enum chartypex_t
+	{
+		ctx_special_pcdata = 1,   // Any symbol >= 0 and < 32 (except \t, \r, \n), &, <, >
+		ctx_special_attr = 2,     // Any symbol >= 0 and < 32 (except \t), &, <, >, "
+		ctx_start_symbol = 4,	  // Any symbol > 127, a-z, A-Z, _
+		ctx_digit = 8,			  // 0-9
+		ctx_symbol = 16			  // Any symbol > 127, a-z, A-Z, 0-9, _, -, .
+	};
+	
+	static const unsigned char chartypex_table[256] =
+	{
+		3,  3,  3,  3,  3,  3,  3,  3,     3,  0,  2,  3,  3,  2,  3,  3,     // 0-15
+		3,  3,  3,  3,  3,  3,  3,  3,     3,  3,  3,  3,  3,  3,  3,  3,     // 16-31
+		0,  0,  2,  0,  0,  0,  3,  0,     0,  0,  0,  0,  0, 16, 16,  0,     // 32-47
+		24, 24, 24, 24, 24, 24, 24, 24,    24, 24, 0,  0,  3,  0,  3,  0,     // 48-63
+
+		0,  20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,    // 64-79
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 0,  0,  0,  0,  20,    // 80-95
+		0,  20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,    // 96-111
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 0,  0,  0,  0,  0,     // 112-127
+
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,    // 128+
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20,    20, 20, 20, 20, 20, 20, 20, 20
+	};
+	
+#ifdef PUGIXML_WCHAR_MODE
+	#define PUGI__IS_CHARTYPE_IMPL(c, ct, table) ((static_cast<unsigned int>(c) < 128 ? table[static_cast<unsigned int>(c)] : table[128]) & (ct))
+#else
+	#define PUGI__IS_CHARTYPE_IMPL(c, ct, table) (table[static_cast<unsigned char>(c)] & (ct))
+#endif
+
+	#define PUGI__IS_CHARTYPE(c, ct) PUGI__IS_CHARTYPE_IMPL(c, ct, chartype_table)
+	#define PUGI__IS_CHARTYPEX(c, ct) PUGI__IS_CHARTYPE_IMPL(c, ct, chartypex_table)
+
+	PUGI__FN bool is_little_endian()
+	{
+		unsigned int ui = 1;
+
+		return *reinterpret_cast<unsigned char*>(&ui) == 1;
+	}
+
+	PUGI__FN xml_encoding get_wchar_encoding()
+	{
+		PUGI__STATIC_ASSERT(sizeof(wchar_t) == 2 || sizeof(wchar_t) == 4);
+
+		if (sizeof(wchar_t) == 2)
+			return is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+		else 
+			return is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+	}
+
+	PUGI__FN xml_encoding guess_buffer_encoding(uint8_t d0, uint8_t d1, uint8_t d2, uint8_t d3)
+	{
+		// look for BOM in first few bytes
+		if (d0 == 0 && d1 == 0 && d2 == 0xfe && d3 == 0xff) return encoding_utf32_be;
+		if (d0 == 0xff && d1 == 0xfe && d2 == 0 && d3 == 0) return encoding_utf32_le;
+		if (d0 == 0xfe && d1 == 0xff) return encoding_utf16_be;
+		if (d0 == 0xff && d1 == 0xfe) return encoding_utf16_le;
+		if (d0 == 0xef && d1 == 0xbb && d2 == 0xbf) return encoding_utf8;
+
+		// look for <, <? or <?xm in various encodings
+		if (d0 == 0 && d1 == 0 && d2 == 0 && d3 == 0x3c) return encoding_utf32_be;
+		if (d0 == 0x3c && d1 == 0 && d2 == 0 && d3 == 0) return encoding_utf32_le;
+		if (d0 == 0 && d1 == 0x3c && d2 == 0 && d3 == 0x3f) return encoding_utf16_be;
+		if (d0 == 0x3c && d1 == 0 && d2 == 0x3f && d3 == 0) return encoding_utf16_le;
+		if (d0 == 0x3c && d1 == 0x3f && d2 == 0x78 && d3 == 0x6d) return encoding_utf8;
+
+		// look for utf16 < followed by node name (this may fail, but is better than utf8 since it's zero terminated so early)
+		if (d0 == 0 && d1 == 0x3c) return encoding_utf16_be;
+		if (d0 == 0x3c && d1 == 0) return encoding_utf16_le;
+
+		// no known BOM detected, assume utf8
+		return encoding_utf8;
+	}
+
+	PUGI__FN xml_encoding get_buffer_encoding(xml_encoding encoding, const void* contents, size_t size)
+	{
+		// replace wchar encoding with utf implementation
+		if (encoding == encoding_wchar) return get_wchar_encoding();
+
+		// replace utf16 encoding with utf16 with specific endianness
+		if (encoding == encoding_utf16) return is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+		// replace utf32 encoding with utf32 with specific endianness
+		if (encoding == encoding_utf32) return is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+		// only do autodetection if no explicit encoding is requested
+		if (encoding != encoding_auto) return encoding;
+
+		// skip encoding autodetection if input buffer is too small
+		if (size < 4) return encoding_utf8;
+
+		// try to guess encoding (based on XML specification, Appendix F.1)
+		const uint8_t* data = static_cast<const uint8_t*>(contents);
+
+		PUGI__DMC_VOLATILE uint8_t d0 = data[0], d1 = data[1], d2 = data[2], d3 = data[3];
+
+		return guess_buffer_encoding(d0, d1, d2, d3);
+	}
+
+	PUGI__FN bool get_mutable_buffer(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, bool is_mutable)
+	{
+		if (is_mutable)
+		{
+			out_buffer = static_cast<char_t*>(const_cast<void*>(contents));
+		}
+		else
+		{
+			void* buffer = xml_memory::allocate(size > 0 ? size : 1);
+			if (!buffer) return false;
+
+			memcpy(buffer, contents, size);
+
+			out_buffer = static_cast<char_t*>(buffer);
+		}
+
+		out_length = size / sizeof(char_t);
+
+		return true;
+	}
+
+#ifdef PUGIXML_WCHAR_MODE
+	PUGI__FN bool need_endian_swap_utf(xml_encoding le, xml_encoding re)
+	{
+		return (le == encoding_utf16_be && re == encoding_utf16_le) || (le == encoding_utf16_le && re == encoding_utf16_be) ||
+			   (le == encoding_utf32_be && re == encoding_utf32_le) || (le == encoding_utf32_le && re == encoding_utf32_be);
+	}
+
+	PUGI__FN bool convert_buffer_endian_swap(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, bool is_mutable)
+	{
+		const char_t* data = static_cast<const char_t*>(contents);
+	
+		if (is_mutable)
+		{
+			out_buffer = const_cast<char_t*>(data);
+		}
+		else
+		{
+			out_buffer = static_cast<char_t*>(xml_memory::allocate(size > 0 ? size : 1));
+			if (!out_buffer) return false;
+		}
+
+		out_length = size / sizeof(char_t);
+
+		convert_wchar_endian_swap(out_buffer, data, out_length);
+
+		return true;
+	}
+
+	PUGI__FN bool convert_buffer_utf8(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size)
+	{
+		const uint8_t* data = static_cast<const uint8_t*>(contents);
+
+		// first pass: get length in wchar_t units
+		out_length = utf_decoder<wchar_counter>::decode_utf8_block(data, size, 0);
+
+		// allocate buffer of suitable length
+		out_buffer = static_cast<char_t*>(xml_memory::allocate((out_length > 0 ? out_length : 1) * sizeof(char_t)));
+		if (!out_buffer) return false;
+
+		// second pass: convert utf8 input to wchar_t
+		wchar_writer::value_type out_begin = reinterpret_cast<wchar_writer::value_type>(out_buffer);
+		wchar_writer::value_type out_end = utf_decoder<wchar_writer>::decode_utf8_block(data, size, out_begin);
+
+		assert(out_end == out_begin + out_length);
+		(void)!out_end;
+
+		return true;
+	}
+
+	template <typename opt_swap> PUGI__FN bool convert_buffer_utf16(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, opt_swap)
+	{
+		const uint16_t* data = static_cast<const uint16_t*>(contents);
+		size_t length = size / sizeof(uint16_t);
+
+		// first pass: get length in wchar_t units
+		out_length = utf_decoder<wchar_counter, opt_swap>::decode_utf16_block(data, length, 0);
+
+		// allocate buffer of suitable length
+		out_buffer = static_cast<char_t*>(xml_memory::allocate((out_length > 0 ? out_length : 1) * sizeof(char_t)));
+		if (!out_buffer) return false;
+
+		// second pass: convert utf16 input to wchar_t
+		wchar_writer::value_type out_begin = reinterpret_cast<wchar_writer::value_type>(out_buffer);
+		wchar_writer::value_type out_end = utf_decoder<wchar_writer, opt_swap>::decode_utf16_block(data, length, out_begin);
+
+		assert(out_end == out_begin + out_length);
+		(void)!out_end;
+
+		return true;
+	}
+
+	template <typename opt_swap> PUGI__FN bool convert_buffer_utf32(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, opt_swap)
+	{
+		const uint32_t* data = static_cast<const uint32_t*>(contents);
+		size_t length = size / sizeof(uint32_t);
+
+		// first pass: get length in wchar_t units
+		out_length = utf_decoder<wchar_counter, opt_swap>::decode_utf32_block(data, length, 0);
+
+		// allocate buffer of suitable length
+		out_buffer = static_cast<char_t*>(xml_memory::allocate((out_length > 0 ? out_length : 1) * sizeof(char_t)));
+		if (!out_buffer) return false;
+
+		// second pass: convert utf32 input to wchar_t
+		wchar_writer::value_type out_begin = reinterpret_cast<wchar_writer::value_type>(out_buffer);
+		wchar_writer::value_type out_end = utf_decoder<wchar_writer, opt_swap>::decode_utf32_block(data, length, out_begin);
+
+		assert(out_end == out_begin + out_length);
+		(void)!out_end;
+
+		return true;
+	}
+
+	PUGI__FN bool convert_buffer_latin1(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size)
+	{
+		const uint8_t* data = static_cast<const uint8_t*>(contents);
+
+		// get length in wchar_t units
+		out_length = size;
+
+		// allocate buffer of suitable length
+		out_buffer = static_cast<char_t*>(xml_memory::allocate((out_length > 0 ? out_length : 1) * sizeof(char_t)));
+		if (!out_buffer) return false;
+
+		// convert latin1 input to wchar_t
+		wchar_writer::value_type out_begin = reinterpret_cast<wchar_writer::value_type>(out_buffer);
+		wchar_writer::value_type out_end = utf_decoder<wchar_writer>::decode_latin1_block(data, size, out_begin);
+
+		assert(out_end == out_begin + out_length);
+		(void)!out_end;
+
+		return true;
+	}
+
+	PUGI__FN bool convert_buffer(char_t*& out_buffer, size_t& out_length, xml_encoding encoding, const void* contents, size_t size, bool is_mutable)
+	{
+		// get native encoding
+		xml_encoding wchar_encoding = get_wchar_encoding();
+
+		// fast path: no conversion required
+		if (encoding == wchar_encoding) return get_mutable_buffer(out_buffer, out_length, contents, size, is_mutable);
+
+		// only endian-swapping is required
+		if (need_endian_swap_utf(encoding, wchar_encoding)) return convert_buffer_endian_swap(out_buffer, out_length, contents, size, is_mutable);
+
+		// source encoding is utf8
+		if (encoding == encoding_utf8) return convert_buffer_utf8(out_buffer, out_length, contents, size);
+
+		// source encoding is utf16
+		if (encoding == encoding_utf16_be || encoding == encoding_utf16_le)
+		{
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+			return (native_encoding == encoding) ?
+				convert_buffer_utf16(out_buffer, out_length, contents, size, opt_false()) :
+				convert_buffer_utf16(out_buffer, out_length, contents, size, opt_true());
+		}
+
+		// source encoding is utf32
+		if (encoding == encoding_utf32_be || encoding == encoding_utf32_le)
+		{
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+			return (native_encoding == encoding) ?
+				convert_buffer_utf32(out_buffer, out_length, contents, size, opt_false()) :
+				convert_buffer_utf32(out_buffer, out_length, contents, size, opt_true());
+		}
+
+		// source encoding is latin1
+		if (encoding == encoding_latin1) return convert_buffer_latin1(out_buffer, out_length, contents, size);
+
+		assert(!"Invalid encoding");
+		return false;
+	}
+#else
+	template <typename opt_swap> PUGI__FN bool convert_buffer_utf16(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, opt_swap)
+	{
+		const uint16_t* data = static_cast<const uint16_t*>(contents);
+		size_t length = size / sizeof(uint16_t);
+
+		// first pass: get length in utf8 units
+		out_length = utf_decoder<utf8_counter, opt_swap>::decode_utf16_block(data, length, 0);
+
+		// allocate buffer of suitable length
+		out_buffer = static_cast<char_t*>(xml_memory::allocate((out_length > 0 ? out_length : 1) * sizeof(char_t)));
+		if (!out_buffer) return false;
+
+		// second pass: convert utf16 input to utf8
+		uint8_t* out_begin = reinterpret_cast<uint8_t*>(out_buffer);
+		uint8_t* out_end = utf_decoder<utf8_writer, opt_swap>::decode_utf16_block(data, length, out_begin);
+
+		assert(out_end == out_begin + out_length);
+		(void)!out_end;
+
+		return true;
+	}
+
+	template <typename opt_swap> PUGI__FN bool convert_buffer_utf32(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, opt_swap)
+	{
+		const uint32_t* data = static_cast<const uint32_t*>(contents);
+		size_t length = size / sizeof(uint32_t);
+
+		// first pass: get length in utf8 units
+		out_length = utf_decoder<utf8_counter, opt_swap>::decode_utf32_block(data, length, 0);
+
+		// allocate buffer of suitable length
+		out_buffer = static_cast<char_t*>(xml_memory::allocate((out_length > 0 ? out_length : 1) * sizeof(char_t)));
+		if (!out_buffer) return false;
+
+		// second pass: convert utf32 input to utf8
+		uint8_t* out_begin = reinterpret_cast<uint8_t*>(out_buffer);
+		uint8_t* out_end = utf_decoder<utf8_writer, opt_swap>::decode_utf32_block(data, length, out_begin);
+
+		assert(out_end == out_begin + out_length);
+		(void)!out_end;
+
+		return true;
+	}
+
+	PUGI__FN size_t get_latin1_7bit_prefix_length(const uint8_t* data, size_t size)
+	{
+		for (size_t i = 0; i < size; ++i)
+			if (data[i] > 127)
+				return i;
+
+		return size;
+	}
+
+	PUGI__FN bool convert_buffer_latin1(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, bool is_mutable)
+	{
+		const uint8_t* data = static_cast<const uint8_t*>(contents);
+
+		// get size of prefix that does not need utf8 conversion
+		size_t prefix_length = get_latin1_7bit_prefix_length(data, size);
+		assert(prefix_length <= size);
+
+		const uint8_t* postfix = data + prefix_length;
+		size_t postfix_length = size - prefix_length;
+
+		// if no conversion is needed, just return the original buffer
+		if (postfix_length == 0) return get_mutable_buffer(out_buffer, out_length, contents, size, is_mutable);
+
+		// first pass: get length in utf8 units
+		out_length = prefix_length + utf_decoder<utf8_counter>::decode_latin1_block(postfix, postfix_length, 0);
+
+		// allocate buffer of suitable length
+		out_buffer = static_cast<char_t*>(xml_memory::allocate((out_length > 0 ? out_length : 1) * sizeof(char_t)));
+		if (!out_buffer) return false;
+
+		// second pass: convert latin1 input to utf8
+		memcpy(out_buffer, data, prefix_length);
+
+		uint8_t* out_begin = reinterpret_cast<uint8_t*>(out_buffer);
+		uint8_t* out_end = utf_decoder<utf8_writer>::decode_latin1_block(postfix, postfix_length, out_begin + prefix_length);
+
+		assert(out_end == out_begin + out_length);
+		(void)!out_end;
+
+		return true;
+	}
+
+	PUGI__FN bool convert_buffer(char_t*& out_buffer, size_t& out_length, xml_encoding encoding, const void* contents, size_t size, bool is_mutable)
+	{
+		// fast path: no conversion required
+		if (encoding == encoding_utf8) return get_mutable_buffer(out_buffer, out_length, contents, size, is_mutable);
+
+		// source encoding is utf16
+		if (encoding == encoding_utf16_be || encoding == encoding_utf16_le)
+		{
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+			return (native_encoding == encoding) ?
+				convert_buffer_utf16(out_buffer, out_length, contents, size, opt_false()) :
+				convert_buffer_utf16(out_buffer, out_length, contents, size, opt_true());
+		}
+
+		// source encoding is utf32
+		if (encoding == encoding_utf32_be || encoding == encoding_utf32_le)
+		{
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+			return (native_encoding == encoding) ?
+				convert_buffer_utf32(out_buffer, out_length, contents, size, opt_false()) :
+				convert_buffer_utf32(out_buffer, out_length, contents, size, opt_true());
+		}
+
+		// source encoding is latin1
+		if (encoding == encoding_latin1) return convert_buffer_latin1(out_buffer, out_length, contents, size, is_mutable);
+
+		assert(!"Invalid encoding");
+		return false;
+	}
+#endif
+
+	PUGI__FN size_t as_utf8_begin(const wchar_t* str, size_t length)
+	{
+		// get length in utf8 characters
+		return utf_decoder<utf8_counter>::decode_wchar_block(str, length, 0);
+	}
+
+	PUGI__FN void as_utf8_end(char* buffer, size_t size, const wchar_t* str, size_t length)
+	{
+		// convert to utf8
+		uint8_t* begin = reinterpret_cast<uint8_t*>(buffer);
+		uint8_t* end = utf_decoder<utf8_writer>::decode_wchar_block(str, length, begin);
+	
+		assert(begin + size == end);
+		(void)!end;
+
+		// zero-terminate
+		buffer[size] = 0;
+	}
+	
+#ifndef PUGIXML_NO_STL
+	PUGI__FN std::string as_utf8_impl(const wchar_t* str, size_t length)
+	{
+		// first pass: get length in utf8 characters
+		size_t size = as_utf8_begin(str, length);
+
+		// allocate resulting string
+		std::string result;
+		result.resize(size);
+
+		// second pass: convert to utf8
+		if (size > 0) as_utf8_end(&result[0], size, str, length);
+
+		return result;
+	}
+
+	PUGI__FN std::basic_string<wchar_t> as_wide_impl(const char* str, size_t size)
+	{
+		const uint8_t* data = reinterpret_cast<const uint8_t*>(str);
+
+		// first pass: get length in wchar_t units
+		size_t length = utf_decoder<wchar_counter>::decode_utf8_block(data, size, 0);
+
+		// allocate resulting string
+		std::basic_string<wchar_t> result;
+		result.resize(length);
+
+		// second pass: convert to wchar_t
+		if (length > 0)
+		{
+			wchar_writer::value_type begin = reinterpret_cast<wchar_writer::value_type>(&result[0]);
+			wchar_writer::value_type end = utf_decoder<wchar_writer>::decode_utf8_block(data, size, begin);
+
+			assert(begin + length == end);
+			(void)!end;
+		}
+
+		return result;
+	}
+#endif
+
+	inline bool strcpy_insitu_allow(size_t length, uintptr_t allocated, char_t* target)
+	{
+		assert(target);
+		size_t target_length = strlength(target);
+
+		// always reuse document buffer memory if possible
+		if (!allocated) return target_length >= length;
+
+		// reuse heap memory if waste is not too great
+		const size_t reuse_threshold = 32;
+
+		return target_length >= length && (target_length < reuse_threshold || target_length - length < target_length / 2);
+	}
+
+	PUGI__FN bool strcpy_insitu(char_t*& dest, uintptr_t& header, uintptr_t header_mask, const char_t* source)
+	{
+		size_t source_length = strlength(source);
+
+		if (source_length == 0)
+		{
+			// empty string and null pointer are equivalent, so just deallocate old memory
+			xml_allocator* alloc = reinterpret_cast<xml_memory_page*>(header & xml_memory_page_pointer_mask)->allocator;
+
+			if (header & header_mask) alloc->deallocate_string(dest);
+			
+			// mark the string as not allocated
+			dest = 0;
+			header &= ~header_mask;
+
+			return true;
+		}
+		else if (dest && strcpy_insitu_allow(source_length, header & header_mask, dest))
+		{
+			// we can reuse old buffer, so just copy the new data (including zero terminator)
+			memcpy(dest, source, (source_length + 1) * sizeof(char_t));
+			
+			return true;
+		}
+		else
+		{
+			xml_allocator* alloc = reinterpret_cast<xml_memory_page*>(header & xml_memory_page_pointer_mask)->allocator;
+
+			// allocate new buffer
+			char_t* buf = alloc->allocate_string(source_length + 1);
+			if (!buf) return false;
+
+			// copy the string (including zero terminator)
+			memcpy(buf, source, (source_length + 1) * sizeof(char_t));
+
+			// deallocate old buffer (*after* the above to protect against overlapping memory and/or allocation failures)
+			if (header & header_mask) alloc->deallocate_string(dest);
+			
+			// the string is now allocated, so set the flag
+			dest = buf;
+			header |= header_mask;
+
+			return true;
+		}
+	}
+
+	struct gap
+	{
+		char_t* end;
+		size_t size;
+			
+		gap(): end(0), size(0)
+		{
+		}
+			
+		// Push new gap, move s count bytes further (skipping the gap).
+		// Collapse previous gap.
+		void push(char_t*& s, size_t count)
+		{
+			if (end) // there was a gap already; collapse it
+			{
+				// Move [old_gap_end, new_gap_start) to [old_gap_start, ...)
+				assert(s >= end);
+				memmove(end - size, end, reinterpret_cast<char*>(s) - reinterpret_cast<char*>(end));
+			}
+				
+			s += count; // end of current gap
+				
+			// "merge" two gaps
+			end = s;
+			size += count;
+		}
+			
+		// Collapse all gaps, return past-the-end pointer
+		char_t* flush(char_t* s)
+		{
+			if (end)
+			{
+				// Move [old_gap_end, current_pos) to [old_gap_start, ...)
+				assert(s >= end);
+				memmove(end - size, end, reinterpret_cast<char*>(s) - reinterpret_cast<char*>(end));
+
+				return s - size;
+			}
+			else return s;
+		}
+	};
+	
+	PUGI__FN char_t* strconv_escape(char_t* s, gap& g)
+	{
+		char_t* stre = s + 1;
+
+		switch (*stre)
+		{
+			case '#':	// &#...
+			{
+				unsigned int ucsc = 0;
+
+				if (stre[1] == 'x') // &#x... (hex code)
+				{
+					stre += 2;
+
+					char_t ch = *stre;
+
+					if (ch == ';') return stre;
+
+					for (;;)
+					{
+						if (static_cast<unsigned int>(ch - '0') <= 9)
+							ucsc = 16 * ucsc + (ch - '0');
+						else if (static_cast<unsigned int>((ch | ' ') - 'a') <= 5)
+							ucsc = 16 * ucsc + ((ch | ' ') - 'a' + 10);
+						else if (ch == ';')
+							break;
+						else // cancel
+							return stre;
+
+						ch = *++stre;
+					}
+					
+					++stre;
+				}
+				else	// &#... (dec code)
+				{
+					char_t ch = *++stre;
+
+					if (ch == ';') return stre;
+
+					for (;;)
+					{
+						if (static_cast<unsigned int>(ch - '0') <= 9)
+							ucsc = 10 * ucsc + (ch - '0');
+						else if (ch == ';')
+							break;
+						else // cancel
+							return stre;
+
+						ch = *++stre;
+					}
+					
+					++stre;
+				}
+
+			#ifdef PUGIXML_WCHAR_MODE
+				s = reinterpret_cast<char_t*>(wchar_writer::any(reinterpret_cast<wchar_writer::value_type>(s), ucsc));
+			#else
+				s = reinterpret_cast<char_t*>(utf8_writer::any(reinterpret_cast<uint8_t*>(s), ucsc));
+			#endif
+					
+				g.push(s, stre - s);
+				return stre;
+			}
+
+			case 'a':	// &a
+			{
+				++stre;
+
+				if (*stre == 'm') // &am
+				{
+					if (*++stre == 'p' && *++stre == ';') // &amp;
+					{
+						*s++ = '&';
+						++stre;
+							
+						g.push(s, stre - s);
+						return stre;
+					}
+				}
+				else if (*stre == 'p') // &ap
+				{
+					if (*++stre == 'o' && *++stre == 's' && *++stre == ';') // &apos;
+					{
+						*s++ = '\'';
+						++stre;
+
+						g.push(s, stre - s);
+						return stre;
+					}
+				}
+				break;
+			}
+
+			case 'g': // &g
+			{
+				if (*++stre == 't' && *++stre == ';') // &gt;
+				{
+					*s++ = '>';
+					++stre;
+					
+					g.push(s, stre - s);
+					return stre;
+				}
+				break;
+			}
+
+			case 'l': // &l
+			{
+				if (*++stre == 't' && *++stre == ';') // &lt;
+				{
+					*s++ = '<';
+					++stre;
+						
+					g.push(s, stre - s);
+					return stre;
+				}
+				break;
+			}
+
+			case 'q': // &q
+			{
+				if (*++stre == 'u' && *++stre == 'o' && *++stre == 't' && *++stre == ';') // &quot;
+				{
+					*s++ = '"';
+					++stre;
+					
+					g.push(s, stre - s);
+					return stre;
+				}
+				break;
+			}
+
+			default:
+				break;
+		}
+		
+		return stre;
+	}
+
+	// Utility macro for last character handling
+	#define ENDSWITH(c, e) ((c) == (e) || ((c) == 0 && endch == (e)))
+
+	PUGI__FN char_t* strconv_comment(char_t* s, char_t endch)
+	{
+		gap g;
+		
+		while (true)
+		{
+			while (!PUGI__IS_CHARTYPE(*s, ct_parse_comment)) ++s;
+		
+			if (*s == '\r') // Either a single 0x0d or 0x0d 0x0a pair
+			{
+				*s++ = '\n'; // replace first one with 0x0a
+				
+				if (*s == '\n') g.push(s, 1);
+			}
+			else if (s[0] == '-' && s[1] == '-' && ENDSWITH(s[2], '>')) // comment ends here
+			{
+				*g.flush(s) = 0;
+				
+				return s + (s[2] == '>' ? 3 : 2);
+			}
+			else if (*s == 0)
+			{
+				return 0;
+			}
+			else ++s;
+		}
+	}
+
+	PUGI__FN char_t* strconv_cdata(char_t* s, char_t endch)
+	{
+		gap g;
+			
+		while (true)
+		{
+			while (!PUGI__IS_CHARTYPE(*s, ct_parse_cdata)) ++s;
+			
+			if (*s == '\r') // Either a single 0x0d or 0x0d 0x0a pair
+			{
+				*s++ = '\n'; // replace first one with 0x0a
+				
+				if (*s == '\n') g.push(s, 1);
+			}
+			else if (s[0] == ']' && s[1] == ']' && ENDSWITH(s[2], '>')) // CDATA ends here
+			{
+				*g.flush(s) = 0;
+				
+				return s + 1;
+			}
+			else if (*s == 0)
+			{
+				return 0;
+			}
+			else ++s;
+		}
+	}
+	
+	typedef char_t* (*strconv_pcdata_t)(char_t*);
+		
+	template <typename opt_eol, typename opt_escape> struct strconv_pcdata_impl
+	{
+		static char_t* parse(char_t* s)
+		{
+			gap g;
+			
+			while (true)
+			{
+				while (!PUGI__IS_CHARTYPE(*s, ct_parse_pcdata)) ++s;
+					
+				if (*s == '<') // PCDATA ends here
+				{
+					*g.flush(s) = 0;
+					
+					return s + 1;
+				}
+				else if (opt_eol::value && *s == '\r') // Either a single 0x0d or 0x0d 0x0a pair
+				{
+					*s++ = '\n'; // replace first one with 0x0a
+					
+					if (*s == '\n') g.push(s, 1);
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (*s == 0)
+				{
+					return s;
+				}
+				else ++s;
+			}
+		}
+	};
+	
+	PUGI__FN strconv_pcdata_t get_strconv_pcdata(unsigned int optmask)
+	{
+		PUGI__STATIC_ASSERT(parse_escapes == 0x10 && parse_eol == 0x20);
+
+		switch ((optmask >> 4) & 3) // get bitmask for flags (eol escapes)
+		{
+		case 0: return strconv_pcdata_impl<opt_false, opt_false>::parse;
+		case 1: return strconv_pcdata_impl<opt_false, opt_true>::parse;
+		case 2: return strconv_pcdata_impl<opt_true, opt_false>::parse;
+		case 3: return strconv_pcdata_impl<opt_true, opt_true>::parse;
+		default: return 0; // should not get here
+		}
+	}
+
+	typedef char_t* (*strconv_attribute_t)(char_t*, char_t);
+	
+	template <typename opt_escape> struct strconv_attribute_impl
+	{
+		static char_t* parse_wnorm(char_t* s, char_t end_quote)
+		{
+			gap g;
+
+			// trim leading whitespaces
+			if (PUGI__IS_CHARTYPE(*s, ct_space))
+			{
+				char_t* str = s;
+				
+				do ++str;
+				while (PUGI__IS_CHARTYPE(*str, ct_space));
+				
+				g.push(s, str - s);
+			}
+
+			while (true)
+			{
+				while (!PUGI__IS_CHARTYPE(*s, ct_parse_attr_ws | ct_space)) ++s;
+				
+				if (*s == end_quote)
+				{
+					char_t* str = g.flush(s);
+					
+					do *str-- = 0;
+					while (PUGI__IS_CHARTYPE(*str, ct_space));
+				
+					return s + 1;
+				}
+				else if (PUGI__IS_CHARTYPE(*s, ct_space))
+				{
+					*s++ = ' ';
+		
+					if (PUGI__IS_CHARTYPE(*s, ct_space))
+					{
+						char_t* str = s + 1;
+						while (PUGI__IS_CHARTYPE(*str, ct_space)) ++str;
+						
+						g.push(s, str - s);
+					}
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (!*s)
+				{
+					return 0;
+				}
+				else ++s;
+			}
+		}
+
+		static char_t* parse_wconv(char_t* s, char_t end_quote)
+		{
+			gap g;
+
+			while (true)
+			{
+				while (!PUGI__IS_CHARTYPE(*s, ct_parse_attr_ws)) ++s;
+				
+				if (*s == end_quote)
+				{
+					*g.flush(s) = 0;
+				
+					return s + 1;
+				}
+				else if (PUGI__IS_CHARTYPE(*s, ct_space))
+				{
+					if (*s == '\r')
+					{
+						*s++ = ' ';
+				
+						if (*s == '\n') g.push(s, 1);
+					}
+					else *s++ = ' ';
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (!*s)
+				{
+					return 0;
+				}
+				else ++s;
+			}
+		}
+
+		static char_t* parse_eol(char_t* s, char_t end_quote)
+		{
+			gap g;
+
+			while (true)
+			{
+				while (!PUGI__IS_CHARTYPE(*s, ct_parse_attr)) ++s;
+				
+				if (*s == end_quote)
+				{
+					*g.flush(s) = 0;
+				
+					return s + 1;
+				}
+				else if (*s == '\r')
+				{
+					*s++ = '\n';
+					
+					if (*s == '\n') g.push(s, 1);
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (!*s)
+				{
+					return 0;
+				}
+				else ++s;
+			}
+		}
+
+		static char_t* parse_simple(char_t* s, char_t end_quote)
+		{
+			gap g;
+
+			while (true)
+			{
+				while (!PUGI__IS_CHARTYPE(*s, ct_parse_attr)) ++s;
+				
+				if (*s == end_quote)
+				{
+					*g.flush(s) = 0;
+				
+					return s + 1;
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (!*s)
+				{
+					return 0;
+				}
+				else ++s;
+			}
+		}
+	};
+
+	PUGI__FN strconv_attribute_t get_strconv_attribute(unsigned int optmask)
+	{
+		PUGI__STATIC_ASSERT(parse_escapes == 0x10 && parse_eol == 0x20 && parse_wconv_attribute == 0x40 && parse_wnorm_attribute == 0x80);
+		
+		switch ((optmask >> 4) & 15) // get bitmask for flags (wconv wnorm eol escapes)
+		{
+		case 0:  return strconv_attribute_impl<opt_false>::parse_simple;
+		case 1:  return strconv_attribute_impl<opt_true>::parse_simple;
+		case 2:  return strconv_attribute_impl<opt_false>::parse_eol;
+		case 3:  return strconv_attribute_impl<opt_true>::parse_eol;
+		case 4:  return strconv_attribute_impl<opt_false>::parse_wconv;
+		case 5:  return strconv_attribute_impl<opt_true>::parse_wconv;
+		case 6:  return strconv_attribute_impl<opt_false>::parse_wconv;
+		case 7:  return strconv_attribute_impl<opt_true>::parse_wconv;
+		case 8:  return strconv_attribute_impl<opt_false>::parse_wnorm;
+		case 9:  return strconv_attribute_impl<opt_true>::parse_wnorm;
+		case 10: return strconv_attribute_impl<opt_false>::parse_wnorm;
+		case 11: return strconv_attribute_impl<opt_true>::parse_wnorm;
+		case 12: return strconv_attribute_impl<opt_false>::parse_wnorm;
+		case 13: return strconv_attribute_impl<opt_true>::parse_wnorm;
+		case 14: return strconv_attribute_impl<opt_false>::parse_wnorm;
+		case 15: return strconv_attribute_impl<opt_true>::parse_wnorm;
+		default: return 0; // should not get here
+		}
+	}
+
+	inline xml_parse_result make_parse_result(xml_parse_status status, ptrdiff_t offset = 0)
+	{
+		xml_parse_result result;
+		result.status = status;
+		result.offset = offset;
+
+		return result;
+	}
+
+	struct xml_parser
+	{
+		xml_allocator alloc;
+		char_t* error_offset;
+		xml_parse_status error_status;
+		
+		// Parser utilities.
+		#define PUGI__SKIPWS()			{ while (PUGI__IS_CHARTYPE(*s, ct_space)) ++s; }
+		#define PUGI__OPTSET(OPT)			( optmsk & (OPT) )
+		#define PUGI__PUSHNODE(TYPE)		{ cursor = append_node(cursor, alloc, TYPE); if (!cursor) PUGI__THROW_ERROR(status_out_of_memory, s); }
+		#define PUGI__POPNODE()			{ cursor = cursor->parent; }
+		#define PUGI__SCANFOR(X)			{ while (*s != 0 && !(X)) ++s; }
+		#define PUGI__SCANWHILE(X)		{ while ((X)) ++s; }
+		#define PUGI__ENDSEG()			{ ch = *s; *s = 0; ++s; }
+		#define PUGI__THROW_ERROR(err, m)	return error_offset = m, error_status = err, static_cast<char_t*>(0)
+		#define PUGI__CHECK_ERROR(err, m)	{ if (*s == 0) PUGI__THROW_ERROR(err, m); }
+		
+		xml_parser(const xml_allocator& alloc_): alloc(alloc_), error_offset(0), error_status(status_ok)
+		{
+		}
+
+		// DOCTYPE consists of nested sections of the following possible types:
+		// <!-- ... -->, <? ... ?>, "...", '...'
+		// <![...]]>
+		// <!...>
+		// First group can not contain nested groups
+		// Second group can contain nested groups of the same type
+		// Third group can contain all other groups
+		char_t* parse_doctype_primitive(char_t* s)
+		{
+			if (*s == '"' || *s == '\'')
+			{
+				// quoted string
+				char_t ch = *s++;
+				PUGI__SCANFOR(*s == ch);
+				if (!*s) PUGI__THROW_ERROR(status_bad_doctype, s);
+
+				s++;
+			}
+			else if (s[0] == '<' && s[1] == '?')
+			{
+				// <? ... ?>
+				s += 2;
+				PUGI__SCANFOR(s[0] == '?' && s[1] == '>'); // no need for ENDSWITH because ?> can't terminate proper doctype
+				if (!*s) PUGI__THROW_ERROR(status_bad_doctype, s);
+
+				s += 2;
+			}
+			else if (s[0] == '<' && s[1] == '!' && s[2] == '-' && s[3] == '-')
+			{
+				s += 4;
+				PUGI__SCANFOR(s[0] == '-' && s[1] == '-' && s[2] == '>'); // no need for ENDSWITH because --> can't terminate proper doctype
+				if (!*s) PUGI__THROW_ERROR(status_bad_doctype, s);
+
+				s += 4;
+			}
+			else PUGI__THROW_ERROR(status_bad_doctype, s);
+
+			return s;
+		}
+
+		char_t* parse_doctype_ignore(char_t* s)
+		{
+			assert(s[0] == '<' && s[1] == '!' && s[2] == '[');
+			s++;
+
+			while (*s)
+			{
+				if (s[0] == '<' && s[1] == '!' && s[2] == '[')
+				{
+					// nested ignore section
+					s = parse_doctype_ignore(s);
+					if (!s) return s;
+				}
+				else if (s[0] == ']' && s[1] == ']' && s[2] == '>')
+				{
+					// ignore section end
+					s += 3;
+
+					return s;
+				}
+				else s++;
+			}
+
+			PUGI__THROW_ERROR(status_bad_doctype, s);
+		}
+
+		char_t* parse_doctype_group(char_t* s, char_t endch, bool toplevel)
+		{
+			assert(s[0] == '<' && s[1] == '!');
+			s++;
+
+			while (*s)
+			{
+				if (s[0] == '<' && s[1] == '!' && s[2] != '-')
+				{
+					if (s[2] == '[')
+					{
+						// ignore
+						s = parse_doctype_ignore(s);
+						if (!s) return s;
+					}
+					else
+					{
+						// some control group
+						s = parse_doctype_group(s, endch, false);
+						if (!s) return s;
+					}
+				}
+				else if (s[0] == '<' || s[0] == '"' || s[0] == '\'')
+				{
+					// unknown tag (forbidden), or some primitive group
+					s = parse_doctype_primitive(s);
+					if (!s) return s;
+				}
+				else if (*s == '>')
+				{
+					s++;
+
+					return s;
+				}
+				else s++;
+			}
+
+			if (!toplevel || endch != '>') PUGI__THROW_ERROR(status_bad_doctype, s);
+
+			return s;
+		}
+
+		char_t* parse_exclamation(char_t* s, xml_node_struct* cursor, unsigned int optmsk, char_t endch)
+		{
+			// parse node contents, starting with exclamation mark
+			++s;
+
+			if (*s == '-') // '<!-...'
+			{
+				++s;
+
+				if (*s == '-') // '<!--...'
+				{
+					++s;
+
+					if (PUGI__OPTSET(parse_comments))
+					{
+						PUGI__PUSHNODE(node_comment); // Append a new node on the tree.
+						cursor->value = s; // Save the offset.
+					}
+
+					if (PUGI__OPTSET(parse_eol) && PUGI__OPTSET(parse_comments))
+					{
+						s = strconv_comment(s, endch);
+
+						if (!s) PUGI__THROW_ERROR(status_bad_comment, cursor->value);
+					}
+					else
+					{
+						// Scan for terminating '-->'.
+						PUGI__SCANFOR(s[0] == '-' && s[1] == '-' && ENDSWITH(s[2], '>'));
+						PUGI__CHECK_ERROR(status_bad_comment, s);
+
+						if (PUGI__OPTSET(parse_comments))
+							*s = 0; // Zero-terminate this segment at the first terminating '-'.
+
+						s += (s[2] == '>' ? 3 : 2); // Step over the '\0->'.
+					}
+				}
+				else PUGI__THROW_ERROR(status_bad_comment, s);
+			}
+			else if (*s == '[')
+			{
+				// '<![CDATA[...'
+				if (*++s=='C' && *++s=='D' && *++s=='A' && *++s=='T' && *++s=='A' && *++s == '[')
+				{
+					++s;
+
+					if (PUGI__OPTSET(parse_cdata))
+					{
+						PUGI__PUSHNODE(node_cdata); // Append a new node on the tree.
+						cursor->value = s; // Save the offset.
+
+						if (PUGI__OPTSET(parse_eol))
+						{
+							s = strconv_cdata(s, endch);
+
+							if (!s) PUGI__THROW_ERROR(status_bad_cdata, cursor->value);
+						}
+						else
+						{
+							// Scan for terminating ']]>'.
+							PUGI__SCANFOR(s[0] == ']' && s[1] == ']' && ENDSWITH(s[2], '>'));
+							PUGI__CHECK_ERROR(status_bad_cdata, s);
+
+							*s++ = 0; // Zero-terminate this segment.
+						}
+					}
+					else // Flagged for discard, but we still have to scan for the terminator.
+					{
+						// Scan for terminating ']]>'.
+						PUGI__SCANFOR(s[0] == ']' && s[1] == ']' && ENDSWITH(s[2], '>'));
+						PUGI__CHECK_ERROR(status_bad_cdata, s);
+
+						++s;
+					}
+
+					s += (s[1] == '>' ? 2 : 1); // Step over the last ']>'.
+				}
+				else PUGI__THROW_ERROR(status_bad_cdata, s);
+			}
+			else if (s[0] == 'D' && s[1] == 'O' && s[2] == 'C' && s[3] == 'T' && s[4] == 'Y' && s[5] == 'P' && ENDSWITH(s[6], 'E'))
+			{
+				s -= 2;
+
+				if (cursor->parent) PUGI__THROW_ERROR(status_bad_doctype, s);
+
+				char_t* mark = s + 9;
+
+				s = parse_doctype_group(s, endch, true);
+				if (!s) return s;
+
+				if (PUGI__OPTSET(parse_doctype))
+				{
+					while (PUGI__IS_CHARTYPE(*mark, ct_space)) ++mark;
+
+					PUGI__PUSHNODE(node_doctype);
+
+					cursor->value = mark;
+
+					assert((s[0] == 0 && endch == '>') || s[-1] == '>');
+					s[*s == 0 ? 0 : -1] = 0;
+
+					PUGI__POPNODE();
+				}
+			}
+			else if (*s == 0 && endch == '-') PUGI__THROW_ERROR(status_bad_comment, s);
+			else if (*s == 0 && endch == '[') PUGI__THROW_ERROR(status_bad_cdata, s);
+			else PUGI__THROW_ERROR(status_unrecognized_tag, s);
+
+			return s;
+		}
+
+		char_t* parse_question(char_t* s, xml_node_struct*& ref_cursor, unsigned int optmsk, char_t endch)
+		{
+			// load into registers
+			xml_node_struct* cursor = ref_cursor;
+			char_t ch = 0;
+
+			// parse node contents, starting with question mark
+			++s;
+
+			// read PI target
+			char_t* target = s;
+
+			if (!PUGI__IS_CHARTYPE(*s, ct_start_symbol)) PUGI__THROW_ERROR(status_bad_pi, s);
+
+			PUGI__SCANWHILE(PUGI__IS_CHARTYPE(*s, ct_symbol));
+			PUGI__CHECK_ERROR(status_bad_pi, s);
+
+			// determine node type; stricmp / strcasecmp is not portable
+			bool declaration = (target[0] | ' ') == 'x' && (target[1] | ' ') == 'm' && (target[2] | ' ') == 'l' && target + 3 == s;
+
+			if (declaration ? PUGI__OPTSET(parse_declaration) : PUGI__OPTSET(parse_pi))
+			{
+				if (declaration)
+				{
+					// disallow non top-level declarations
+					if (cursor->parent) PUGI__THROW_ERROR(status_bad_pi, s);
+
+					PUGI__PUSHNODE(node_declaration);
+				}
+				else
+				{
+					PUGI__PUSHNODE(node_pi);
+				}
+
+				cursor->name = target;
+
+				PUGI__ENDSEG();
+
+				// parse value/attributes
+				if (ch == '?')
+				{
+					// empty node
+					if (!ENDSWITH(*s, '>')) PUGI__THROW_ERROR(status_bad_pi, s);
+					s += (*s == '>');
+
+					PUGI__POPNODE();
+				}
+				else if (PUGI__IS_CHARTYPE(ch, ct_space))
+				{
+					PUGI__SKIPWS();
+
+					// scan for tag end
+					char_t* value = s;
+
+					PUGI__SCANFOR(s[0] == '?' && ENDSWITH(s[1], '>'));
+					PUGI__CHECK_ERROR(status_bad_pi, s);
+
+					if (declaration)
+					{
+						// replace ending ? with / so that 'element' terminates properly
+						*s = '/';
+
+						// we exit from this function with cursor at node_declaration, which is a signal to parse() to go to LOC_ATTRIBUTES
+						s = value;
+					}
+					else
+					{
+						// store value and step over >
+						cursor->value = value;
+						PUGI__POPNODE();
+
+						PUGI__ENDSEG();
+
+						s += (*s == '>');
+					}
+				}
+				else PUGI__THROW_ERROR(status_bad_pi, s);
+			}
+			else
+			{
+				// scan for tag end
+				PUGI__SCANFOR(s[0] == '?' && ENDSWITH(s[1], '>'));
+				PUGI__CHECK_ERROR(status_bad_pi, s);
+
+				s += (s[1] == '>' ? 2 : 1);
+			}
+
+			// store from registers
+			ref_cursor = cursor;
+
+			return s;
+		}
+
+		char_t* parse(char_t* s, xml_node_struct* xmldoc, unsigned int optmsk, char_t endch)
+		{
+			strconv_attribute_t strconv_attribute = get_strconv_attribute(optmsk);
+			strconv_pcdata_t strconv_pcdata = get_strconv_pcdata(optmsk);
+			
+			char_t ch = 0;
+			xml_node_struct* cursor = xmldoc;
+			char_t* mark = s;
+
+			while (*s != 0)
+			{
+				if (*s == '<')
+				{
+					++s;
+
+				LOC_TAG:
+					if (PUGI__IS_CHARTYPE(*s, ct_start_symbol)) // '<#...'
+					{
+						PUGI__PUSHNODE(node_element); // Append a new node to the tree.
+
+						cursor->name = s;
+
+						PUGI__SCANWHILE(PUGI__IS_CHARTYPE(*s, ct_symbol)); // Scan for a terminator.
+						PUGI__ENDSEG(); // Save char in 'ch', terminate & step over.
+
+						if (ch == '>')
+						{
+							// end of tag
+						}
+						else if (PUGI__IS_CHARTYPE(ch, ct_space))
+						{
+						LOC_ATTRIBUTES:
+							while (true)
+							{
+								PUGI__SKIPWS(); // Eat any whitespace.
+						
+								if (PUGI__IS_CHARTYPE(*s, ct_start_symbol)) // <... #...
+								{
+									xml_attribute_struct* a = append_attribute_ll(cursor, alloc); // Make space for this attribute.
+									if (!a) PUGI__THROW_ERROR(status_out_of_memory, s);
+
+									a->name = s; // Save the offset.
+
+									PUGI__SCANWHILE(PUGI__IS_CHARTYPE(*s, ct_symbol)); // Scan for a terminator.
+									PUGI__CHECK_ERROR(status_bad_attribute, s); //$ redundant, left for performance
+
+									PUGI__ENDSEG(); // Save char in 'ch', terminate & step over.
+									PUGI__CHECK_ERROR(status_bad_attribute, s); //$ redundant, left for performance
+
+									if (PUGI__IS_CHARTYPE(ch, ct_space))
+									{
+										PUGI__SKIPWS(); // Eat any whitespace.
+										PUGI__CHECK_ERROR(status_bad_attribute, s); //$ redundant, left for performance
+
+										ch = *s;
+										++s;
+									}
+									
+									if (ch == '=') // '<... #=...'
+									{
+										PUGI__SKIPWS(); // Eat any whitespace.
+
+										if (*s == '"' || *s == '\'') // '<... #="...'
+										{
+											ch = *s; // Save quote char to avoid breaking on "''" -or- '""'.
+											++s; // Step over the quote.
+											a->value = s; // Save the offset.
+
+											s = strconv_attribute(s, ch);
+										
+											if (!s) PUGI__THROW_ERROR(status_bad_attribute, a->value);
+
+											// After this line the loop continues from the start;
+											// Whitespaces, / and > are ok, symbols and EOF are wrong,
+											// everything else will be detected
+											if (PUGI__IS_CHARTYPE(*s, ct_start_symbol)) PUGI__THROW_ERROR(status_bad_attribute, s);
+										}
+										else PUGI__THROW_ERROR(status_bad_attribute, s);
+									}
+									else PUGI__THROW_ERROR(status_bad_attribute, s);
+								}
+								else if (*s == '/')
+								{
+									++s;
+									
+									if (*s == '>')
+									{
+										PUGI__POPNODE();
+										s++;
+										break;
+									}
+									else if (*s == 0 && endch == '>')
+									{
+										PUGI__POPNODE();
+										break;
+									}
+									else PUGI__THROW_ERROR(status_bad_start_element, s);
+								}
+								else if (*s == '>')
+								{
+									++s;
+
+									break;
+								}
+								else if (*s == 0 && endch == '>')
+								{
+									break;
+								}
+								else PUGI__THROW_ERROR(status_bad_start_element, s);
+							}
+
+							// !!!
+						}
+						else if (ch == '/') // '<#.../'
+						{
+							if (!ENDSWITH(*s, '>')) PUGI__THROW_ERROR(status_bad_start_element, s);
+
+							PUGI__POPNODE(); // Pop.
+
+							s += (*s == '>');
+						}
+						else if (ch == 0)
+						{
+							// we stepped over null terminator, backtrack & handle closing tag
+							--s;
+							
+							if (endch != '>') PUGI__THROW_ERROR(status_bad_start_element, s);
+						}
+						else PUGI__THROW_ERROR(status_bad_start_element, s);
+					}
+					else if (*s == '/')
+					{
+						++s;
+
+						char_t* name = cursor->name;
+						if (!name) PUGI__THROW_ERROR(status_end_element_mismatch, s);
+						
+						while (PUGI__IS_CHARTYPE(*s, ct_symbol))
+						{
+							if (*s++ != *name++) PUGI__THROW_ERROR(status_end_element_mismatch, s);
+						}
+
+						if (*name)
+						{
+							if (*s == 0 && name[0] == endch && name[1] == 0) PUGI__THROW_ERROR(status_bad_end_element, s);
+							else PUGI__THROW_ERROR(status_end_element_mismatch, s);
+						}
+							
+						PUGI__POPNODE(); // Pop.
+
+						PUGI__SKIPWS();
+
+						if (*s == 0)
+						{
+							if (endch != '>') PUGI__THROW_ERROR(status_bad_end_element, s);
+						}
+						else
+						{
+							if (*s != '>') PUGI__THROW_ERROR(status_bad_end_element, s);
+							++s;
+						}
+					}
+					else if (*s == '?') // '<?...'
+					{
+						s = parse_question(s, cursor, optmsk, endch);
+						if (!s) return s;
+
+						assert(cursor);
+						if ((cursor->header & xml_memory_page_type_mask) + 1 == node_declaration) goto LOC_ATTRIBUTES;
+					}
+					else if (*s == '!') // '<!...'
+					{
+						s = parse_exclamation(s, cursor, optmsk, endch);
+						if (!s) return s;
+					}
+					else if (*s == 0 && endch == '?') PUGI__THROW_ERROR(status_bad_pi, s);
+					else PUGI__THROW_ERROR(status_unrecognized_tag, s);
+				}
+				else
+				{
+					mark = s; // Save this offset while searching for a terminator.
+
+					PUGI__SKIPWS(); // Eat whitespace if no genuine PCDATA here.
+
+					if (*s == '<')
+					{
+						// We skipped some whitespace characters because otherwise we would take the tag branch instead of PCDATA one
+						assert(mark != s);
+
+						if (!PUGI__OPTSET(parse_ws_pcdata | parse_ws_pcdata_single))
+						{
+							continue;
+						}
+						else if (PUGI__OPTSET(parse_ws_pcdata_single))
+						{
+							if (s[1] != '/' || cursor->first_child) continue;
+						}
+					}
+
+					s = mark;
+							
+					if (cursor->parent)
+					{
+						PUGI__PUSHNODE(node_pcdata); // Append a new node on the tree.
+						cursor->value = s; // Save the offset.
+
+						s = strconv_pcdata(s);
+								
+						PUGI__POPNODE(); // Pop since this is a standalone.
+						
+						if (!*s) break;
+					}
+					else
+					{
+						PUGI__SCANFOR(*s == '<'); // '...<'
+						if (!*s) break;
+						
+						++s;
+					}
+
+					// We're after '<'
+					goto LOC_TAG;
+				}
+			}
+
+			// check that last tag is closed
+			if (cursor != xmldoc) PUGI__THROW_ERROR(status_end_element_mismatch, s);
+
+			return s;
+		}
+
+		static xml_parse_result parse(char_t* buffer, size_t length, xml_node_struct* root, unsigned int optmsk)
+		{
+			xml_document_struct* xmldoc = static_cast<xml_document_struct*>(root);
+
+			// store buffer for offset_debug
+			xmldoc->buffer = buffer;
+
+			// early-out for empty documents
+			if (length == 0) return make_parse_result(status_ok);
+
+			// create parser on stack
+			xml_parser parser(*xmldoc);
+
+			// save last character and make buffer zero-terminated (speeds up parsing)
+			char_t endch = buffer[length - 1];
+			buffer[length - 1] = 0;
+			
+			// perform actual parsing
+			parser.parse(buffer, xmldoc, optmsk, endch);
+
+			xml_parse_result result = make_parse_result(parser.error_status, parser.error_offset ? parser.error_offset - buffer : 0);
+			assert(result.offset >= 0 && static_cast<size_t>(result.offset) <= length);
+
+			// update allocator state
+			*static_cast<xml_allocator*>(xmldoc) = parser.alloc;
+
+			// since we removed last character, we have to handle the only possible false positive
+			if (result && endch == '<')
+			{
+				// there's no possible well-formed document with < at the end
+				return make_parse_result(status_unrecognized_tag, length);
+			}
+
+			return result;
+		}
+	};
+
+	// Output facilities
+	PUGI__FN xml_encoding get_write_native_encoding()
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		return get_wchar_encoding();
+	#else
+		return encoding_utf8;
+	#endif
+	}
+
+	PUGI__FN xml_encoding get_write_encoding(xml_encoding encoding)
+	{
+		// replace wchar encoding with utf implementation
+		if (encoding == encoding_wchar) return get_wchar_encoding();
+
+		// replace utf16 encoding with utf16 with specific endianness
+		if (encoding == encoding_utf16) return is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+		// replace utf32 encoding with utf32 with specific endianness
+		if (encoding == encoding_utf32) return is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+		// only do autodetection if no explicit encoding is requested
+		if (encoding != encoding_auto) return encoding;
+
+		// assume utf8 encoding
+		return encoding_utf8;
+	}
+
+#ifdef PUGIXML_WCHAR_MODE
+	PUGI__FN size_t get_valid_length(const char_t* data, size_t length)
+	{
+		assert(length > 0);
+
+		// discard last character if it's the lead of a surrogate pair 
+		return (sizeof(wchar_t) == 2 && static_cast<unsigned int>(static_cast<uint16_t>(data[length - 1]) - 0xD800) < 0x400) ? length - 1 : length;
+	}
+
+	PUGI__FN size_t convert_buffer(char_t* r_char, uint8_t* r_u8, uint16_t* r_u16, uint32_t* r_u32, const char_t* data, size_t length, xml_encoding encoding)
+	{
+		// only endian-swapping is required
+		if (need_endian_swap_utf(encoding, get_wchar_encoding()))
+		{
+			convert_wchar_endian_swap(r_char, data, length);
+
+			return length * sizeof(char_t);
+		}
+	
+		// convert to utf8
+		if (encoding == encoding_utf8)
+		{
+			uint8_t* dest = r_u8;
+			uint8_t* end = utf_decoder<utf8_writer>::decode_wchar_block(data, length, dest);
+
+			return static_cast<size_t>(end - dest);
+		}
+
+		// convert to utf16
+		if (encoding == encoding_utf16_be || encoding == encoding_utf16_le)
+		{
+			uint16_t* dest = r_u16;
+
+			// convert to native utf16
+			uint16_t* end = utf_decoder<utf16_writer>::decode_wchar_block(data, length, dest);
+
+			// swap if necessary
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+			if (native_encoding != encoding) convert_utf_endian_swap(dest, dest, static_cast<size_t>(end - dest));
+
+			return static_cast<size_t>(end - dest) * sizeof(uint16_t);
+		}
+
+		// convert to utf32
+		if (encoding == encoding_utf32_be || encoding == encoding_utf32_le)
+		{
+			uint32_t* dest = r_u32;
+
+			// convert to native utf32
+			uint32_t* end = utf_decoder<utf32_writer>::decode_wchar_block(data, length, dest);
+
+			// swap if necessary
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+			if (native_encoding != encoding) convert_utf_endian_swap(dest, dest, static_cast<size_t>(end - dest));
+
+			return static_cast<size_t>(end - dest) * sizeof(uint32_t);
+		}
+
+		// convert to latin1
+		if (encoding == encoding_latin1)
+		{
+			uint8_t* dest = r_u8;
+			uint8_t* end = utf_decoder<latin1_writer>::decode_wchar_block(data, length, dest);
+
+			return static_cast<size_t>(end - dest);
+		}
+
+		assert(!"Invalid encoding");
+		return 0;
+	}
+#else
+	PUGI__FN size_t get_valid_length(const char_t* data, size_t length)
+	{
+		assert(length > 4);
+
+		for (size_t i = 1; i <= 4; ++i)
+		{
+			uint8_t ch = static_cast<uint8_t>(data[length - i]);
+
+			// either a standalone character or a leading one
+			if ((ch & 0xc0) != 0x80) return length - i;
+		}
+
+		// there are four non-leading characters at the end, sequence tail is broken so might as well process the whole chunk
+		return length;
+	}
+
+	PUGI__FN size_t convert_buffer(char_t* /* r_char */, uint8_t* r_u8, uint16_t* r_u16, uint32_t* r_u32, const char_t* data, size_t length, xml_encoding encoding)
+	{
+		if (encoding == encoding_utf16_be || encoding == encoding_utf16_le)
+		{
+			uint16_t* dest = r_u16;
+
+			// convert to native utf16
+			uint16_t* end = utf_decoder<utf16_writer>::decode_utf8_block(reinterpret_cast<const uint8_t*>(data), length, dest);
+
+			// swap if necessary
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+			if (native_encoding != encoding) convert_utf_endian_swap(dest, dest, static_cast<size_t>(end - dest));
+
+			return static_cast<size_t>(end - dest) * sizeof(uint16_t);
+		}
+
+		if (encoding == encoding_utf32_be || encoding == encoding_utf32_le)
+		{
+			uint32_t* dest = r_u32;
+
+			// convert to native utf32
+			uint32_t* end = utf_decoder<utf32_writer>::decode_utf8_block(reinterpret_cast<const uint8_t*>(data), length, dest);
+
+			// swap if necessary
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+			if (native_encoding != encoding) convert_utf_endian_swap(dest, dest, static_cast<size_t>(end - dest));
+
+			return static_cast<size_t>(end - dest) * sizeof(uint32_t);
+		}
+
+		if (encoding == encoding_latin1)
+		{
+			uint8_t* dest = r_u8;
+			uint8_t* end = utf_decoder<latin1_writer>::decode_utf8_block(reinterpret_cast<const uint8_t*>(data), length, dest);
+
+			return static_cast<size_t>(end - dest);
+		}
+
+		assert(!"Invalid encoding");
+		return 0;
+	}
+#endif
+
+	class xml_buffered_writer
+	{
+		xml_buffered_writer(const xml_buffered_writer&);
+		xml_buffered_writer& operator=(const xml_buffered_writer&);
+
+	public:
+		xml_buffered_writer(xml_writer& writer_, xml_encoding user_encoding): writer(writer_), bufsize(0), encoding(get_write_encoding(user_encoding))
+		{
+			PUGI__STATIC_ASSERT(bufcapacity >= 8);
+		}
+
+		~xml_buffered_writer()
+		{
+			flush();
+		}
+
+		void flush()
+		{
+			flush(buffer, bufsize);
+			bufsize = 0;
+		}
+
+		void flush(const char_t* data, size_t size)
+		{
+			if (size == 0) return;
+
+			// fast path, just write data
+			if (encoding == get_write_native_encoding())
+				writer.write(data, size * sizeof(char_t));
+			else
+			{
+				// convert chunk
+				size_t result = convert_buffer(scratch.data_char, scratch.data_u8, scratch.data_u16, scratch.data_u32, data, size, encoding);
+				assert(result <= sizeof(scratch));
+
+				// write data
+				writer.write(scratch.data_u8, result);
+			}
+		}
+
+		void write(const char_t* data, size_t length)
+		{
+			if (bufsize + length > bufcapacity)
+			{
+				// flush the remaining buffer contents
+				flush();
+
+				// handle large chunks
+				if (length > bufcapacity)
+				{
+					if (encoding == get_write_native_encoding())
+					{
+						// fast path, can just write data chunk
+						writer.write(data, length * sizeof(char_t));
+						return;
+					}
+
+					// need to convert in suitable chunks
+					while (length > bufcapacity)
+					{
+						// get chunk size by selecting such number of characters that are guaranteed to fit into scratch buffer
+						// and form a complete codepoint sequence (i.e. discard start of last codepoint if necessary)
+						size_t chunk_size = get_valid_length(data, bufcapacity);
+
+						// convert chunk and write
+						flush(data, chunk_size);
+
+						// iterate
+						data += chunk_size;
+						length -= chunk_size;
+					}
+
+					// small tail is copied below
+					bufsize = 0;
+				}
+			}
+
+			memcpy(buffer + bufsize, data, length * sizeof(char_t));
+			bufsize += length;
+		}
+
+		void write(const char_t* data)
+		{
+			write(data, strlength(data));
+		}
+
+		void write(char_t d0)
+		{
+			if (bufsize + 1 > bufcapacity) flush();
+
+			buffer[bufsize + 0] = d0;
+			bufsize += 1;
+		}
+
+		void write(char_t d0, char_t d1)
+		{
+			if (bufsize + 2 > bufcapacity) flush();
+
+			buffer[bufsize + 0] = d0;
+			buffer[bufsize + 1] = d1;
+			bufsize += 2;
+		}
+
+		void write(char_t d0, char_t d1, char_t d2)
+		{
+			if (bufsize + 3 > bufcapacity) flush();
+
+			buffer[bufsize + 0] = d0;
+			buffer[bufsize + 1] = d1;
+			buffer[bufsize + 2] = d2;
+			bufsize += 3;
+		}
+
+		void write(char_t d0, char_t d1, char_t d2, char_t d3)
+		{
+			if (bufsize + 4 > bufcapacity) flush();
+
+			buffer[bufsize + 0] = d0;
+			buffer[bufsize + 1] = d1;
+			buffer[bufsize + 2] = d2;
+			buffer[bufsize + 3] = d3;
+			bufsize += 4;
+		}
+
+		void write(char_t d0, char_t d1, char_t d2, char_t d3, char_t d4)
+		{
+			if (bufsize + 5 > bufcapacity) flush();
+
+			buffer[bufsize + 0] = d0;
+			buffer[bufsize + 1] = d1;
+			buffer[bufsize + 2] = d2;
+			buffer[bufsize + 3] = d3;
+			buffer[bufsize + 4] = d4;
+			bufsize += 5;
+		}
+
+		void write(char_t d0, char_t d1, char_t d2, char_t d3, char_t d4, char_t d5)
+		{
+			if (bufsize + 6 > bufcapacity) flush();
+
+			buffer[bufsize + 0] = d0;
+			buffer[bufsize + 1] = d1;
+			buffer[bufsize + 2] = d2;
+			buffer[bufsize + 3] = d3;
+			buffer[bufsize + 4] = d4;
+			buffer[bufsize + 5] = d5;
+			bufsize += 6;
+		}
+
+		// utf8 maximum expansion: x4 (-> utf32)
+		// utf16 maximum expansion: x2 (-> utf32)
+		// utf32 maximum expansion: x1
+		enum
+		{
+			bufcapacitybytes =
+			#ifdef PUGIXML_MEMORY_OUTPUT_STACK
+				PUGIXML_MEMORY_OUTPUT_STACK
+			#else
+				10240
+			#endif
+			,
+			bufcapacity = bufcapacitybytes / (sizeof(char_t) + 4)
+		};
+
+		char_t buffer[bufcapacity];
+
+		union
+		{
+			uint8_t data_u8[4 * bufcapacity];
+			uint16_t data_u16[2 * bufcapacity];
+			uint32_t data_u32[bufcapacity];
+			char_t data_char[bufcapacity];
+		} scratch;
+
+		xml_writer& writer;
+		size_t bufsize;
+		xml_encoding encoding;
+	};
+
+	PUGI__FN void text_output_escaped(xml_buffered_writer& writer, const char_t* s, chartypex_t type)
+	{
+		while (*s)
+		{
+			const char_t* prev = s;
+			
+			// While *s is a usual symbol
+			while (!PUGI__IS_CHARTYPEX(*s, type)) ++s;
+		
+			writer.write(prev, static_cast<size_t>(s - prev));
+
+			switch (*s)
+			{
+				case 0: break;
+				case '&':
+					writer.write('&', 'a', 'm', 'p', ';');
+					++s;
+					break;
+				case '<':
+					writer.write('&', 'l', 't', ';');
+					++s;
+					break;
+				case '>':
+					writer.write('&', 'g', 't', ';');
+					++s;
+					break;
+				case '"':
+					writer.write('&', 'q', 'u', 'o', 't', ';');
+					++s;
+					break;
+				default: // s is not a usual symbol
+				{
+					unsigned int ch = static_cast<unsigned int>(*s++);
+					assert(ch < 32);
+
+					writer.write('&', '#', static_cast<char_t>((ch / 10) + '0'), static_cast<char_t>((ch % 10) + '0'), ';');
+				}
+			}
+		}
+	}
+
+	PUGI__FN void text_output(xml_buffered_writer& writer, const char_t* s, chartypex_t type, unsigned int flags)
+	{
+		if (flags & format_no_escapes)
+			writer.write(s);
+		else
+			text_output_escaped(writer, s, type);
+	}
+
+	PUGI__FN void text_output_cdata(xml_buffered_writer& writer, const char_t* s)
+	{
+		do
+		{
+			writer.write('<', '!', '[', 'C', 'D');
+			writer.write('A', 'T', 'A', '[');
+
+			const char_t* prev = s;
+
+			// look for ]]> sequence - we can't output it as is since it terminates CDATA
+			while (*s && !(s[0] == ']' && s[1] == ']' && s[2] == '>')) ++s;
+
+			// skip ]] if we stopped at ]]>, > will go to the next CDATA section
+			if (*s) s += 2;
+
+			writer.write(prev, static_cast<size_t>(s - prev));
+
+			writer.write(']', ']', '>');
+		}
+		while (*s);
+	}
+
+	PUGI__FN void node_output_attributes(xml_buffered_writer& writer, const xml_node& node, unsigned int flags)
+	{
+		const char_t* default_name = PUGIXML_TEXT(":anonymous");
+
+		for (xml_attribute a = node.first_attribute(); a; a = a.next_attribute())
+		{
+			writer.write(' ');
+			writer.write(a.name()[0] ? a.name() : default_name);
+			writer.write('=', '"');
+
+			text_output(writer, a.value(), ctx_special_attr, flags);
+
+			writer.write('"');
+		}
+	}
+
+	PUGI__FN void node_output(xml_buffered_writer& writer, const xml_node& node, const char_t* indent, unsigned int flags, unsigned int depth)
+	{
+		const char_t* default_name = PUGIXML_TEXT(":anonymous");
+
+		if ((flags & format_indent) != 0 && (flags & format_raw) == 0)
+			for (unsigned int i = 0; i < depth; ++i) writer.write(indent);
+
+		switch (node.type())
+		{
+		case node_document:
+		{
+			for (xml_node n = node.first_child(); n; n = n.next_sibling())
+				node_output(writer, n, indent, flags, depth);
+			break;
+		}
+			
+		case node_element:
+		{
+			const char_t* name = node.name()[0] ? node.name() : default_name;
+
+			writer.write('<');
+			writer.write(name);
+
+			node_output_attributes(writer, node, flags);
+
+			if (flags & format_raw)
+			{
+				if (!node.first_child())
+					writer.write(' ', '/', '>');
+				else
+				{
+					writer.write('>');
+
+					for (xml_node n = node.first_child(); n; n = n.next_sibling())
+						node_output(writer, n, indent, flags, depth + 1);
+
+					writer.write('<', '/');
+					writer.write(name);
+					writer.write('>');
+				}
+			}
+			else if (!node.first_child())
+				writer.write(' ', '/', '>', '\n');
+			else if (node.first_child() == node.last_child() && (node.first_child().type() == node_pcdata || node.first_child().type() == node_cdata))
+			{
+				writer.write('>');
+
+				if (node.first_child().type() == node_pcdata)
+					text_output(writer, node.first_child().value(), ctx_special_pcdata, flags);
+				else
+					text_output_cdata(writer, node.first_child().value());
+
+				writer.write('<', '/');
+				writer.write(name);
+				writer.write('>', '\n');
+			}
+			else
+			{
+				writer.write('>', '\n');
+				
+				for (xml_node n = node.first_child(); n; n = n.next_sibling())
+					node_output(writer, n, indent, flags, depth + 1);
+
+				if ((flags & format_indent) != 0 && (flags & format_raw) == 0)
+					for (unsigned int i = 0; i < depth; ++i) writer.write(indent);
+				
+				writer.write('<', '/');
+				writer.write(name);
+				writer.write('>', '\n');
+			}
+
+			break;
+		}
+		
+		case node_pcdata:
+			text_output(writer, node.value(), ctx_special_pcdata, flags);
+			if ((flags & format_raw) == 0) writer.write('\n');
+			break;
+
+		case node_cdata:
+			text_output_cdata(writer, node.value());
+			if ((flags & format_raw) == 0) writer.write('\n');
+			break;
+
+		case node_comment:
+			writer.write('<', '!', '-', '-');
+			writer.write(node.value());
+			writer.write('-', '-', '>');
+			if ((flags & format_raw) == 0) writer.write('\n');
+			break;
+
+		case node_pi:
+		case node_declaration:
+			writer.write('<', '?');
+			writer.write(node.name()[0] ? node.name() : default_name);
+
+			if (node.type() == node_declaration)
+			{
+				node_output_attributes(writer, node, flags);
+			}
+			else if (node.value()[0])
+			{
+				writer.write(' ');
+				writer.write(node.value());
+			}
+
+			writer.write('?', '>');
+			if ((flags & format_raw) == 0) writer.write('\n');
+			break;
+
+		case node_doctype:
+			writer.write('<', '!', 'D', 'O', 'C');
+			writer.write('T', 'Y', 'P', 'E');
+
+			if (node.value()[0])
+			{
+				writer.write(' ');
+				writer.write(node.value());
+			}
+
+			writer.write('>');
+			if ((flags & format_raw) == 0) writer.write('\n');
+			break;
+
+		default:
+			assert(!"Invalid node type");
+		}
+	}
+
+	inline bool has_declaration(const xml_node& node)
+	{
+		for (xml_node child = node.first_child(); child; child = child.next_sibling())
+		{
+			xml_node_type type = child.type();
+
+			if (type == node_declaration) return true;
+			if (type == node_element) return false;
+		}
+
+		return false;
+	}
+
+	inline bool allow_insert_child(xml_node_type parent, xml_node_type child)
+	{
+		if (parent != node_document && parent != node_element) return false;
+		if (child == node_document || child == node_null) return false;
+		if (parent != node_document && (child == node_declaration || child == node_doctype)) return false;
+
+		return true;
+	}
+
+	PUGI__FN void recursive_copy_skip(xml_node& dest, const xml_node& source, const xml_node& skip)
+	{
+		assert(dest.type() == source.type());
+
+		switch (source.type())
+		{
+		case node_element:
+		{
+			dest.set_name(source.name());
+
+			for (xml_attribute a = source.first_attribute(); a; a = a.next_attribute())
+				dest.append_attribute(a.name()).set_value(a.value());
+
+			for (xml_node c = source.first_child(); c; c = c.next_sibling())
+			{
+				if (c == skip) continue;
+
+				xml_node cc = dest.append_child(c.type());
+				assert(cc);
+
+				recursive_copy_skip(cc, c, skip);
+			}
+
+			break;
+		}
+
+		case node_pcdata:
+		case node_cdata:
+		case node_comment:
+		case node_doctype:
+			dest.set_value(source.value());
+			break;
+
+		case node_pi:
+			dest.set_name(source.name());
+			dest.set_value(source.value());
+			break;
+
+		case node_declaration:
+		{
+			dest.set_name(source.name());
+
+			for (xml_attribute a = source.first_attribute(); a; a = a.next_attribute())
+				dest.append_attribute(a.name()).set_value(a.value());
+
+			break;
+		}
+
+		default:
+			assert(!"Invalid node type");
+		}
+	}
+
+	inline bool is_text_node(xml_node_struct* node)
+	{
+		xml_node_type type = static_cast<xml_node_type>((node->header & impl::xml_memory_page_type_mask) + 1);
+
+		return type == node_pcdata || type == node_cdata;
+	}
+
+	// get value with conversion functions
+	PUGI__FN int get_value_int(const char_t* value, int def)
+	{
+		if (!value) return def;
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return static_cast<int>(wcstol(value, 0, 10));
+	#else
+		return static_cast<int>(strtol(value, 0, 10));
+	#endif
+	}
+
+	PUGI__FN unsigned int get_value_uint(const char_t* value, unsigned int def)
+	{
+		if (!value) return def;
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return static_cast<unsigned int>(wcstoul(value, 0, 10));
+	#else
+		return static_cast<unsigned int>(strtoul(value, 0, 10));
+	#endif
+	}
+
+	PUGI__FN double get_value_double(const char_t* value, double def)
+	{
+		if (!value) return def;
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcstod(value, 0);
+	#else
+		return strtod(value, 0);
+	#endif
+	}
+
+	PUGI__FN float get_value_float(const char_t* value, float def)
+	{
+		if (!value) return def;
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return static_cast<float>(wcstod(value, 0));
+	#else
+		return static_cast<float>(strtod(value, 0));
+	#endif
+	}
+
+	PUGI__FN bool get_value_bool(const char_t* value, bool def)
+	{
+		if (!value) return def;
+
+		// only look at first char
+		char_t first = *value;
+
+		// 1*, t* (true), T* (True), y* (yes), Y* (YES)
+		return (first == '1' || first == 't' || first == 'T' || first == 'y' || first == 'Y');
+	}
+
+	// set value with conversion functions
+	PUGI__FN bool set_value_buffer(char_t*& dest, uintptr_t& header, uintptr_t header_mask, char (&buf)[128])
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		char_t wbuf[128];
+		impl::widen_ascii(wbuf, buf);
+
+		return strcpy_insitu(dest, header, header_mask, wbuf);
+	#else
+		return strcpy_insitu(dest, header, header_mask, buf);
+	#endif
+	}
+
+	PUGI__FN bool set_value_convert(char_t*& dest, uintptr_t& header, uintptr_t header_mask, int value)
+	{
+		char buf[128];
+		sprintf(buf, "%d", value);
+	
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+
+	PUGI__FN bool set_value_convert(char_t*& dest, uintptr_t& header, uintptr_t header_mask, unsigned int value)
+	{
+		char buf[128];
+		sprintf(buf, "%u", value);
+
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+
+	PUGI__FN bool set_value_convert(char_t*& dest, uintptr_t& header, uintptr_t header_mask, double value)
+	{
+		char buf[128];
+		sprintf(buf, "%g", value);
+
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+	
+	PUGI__FN bool set_value_convert(char_t*& dest, uintptr_t& header, uintptr_t header_mask, bool value)
+	{
+		return strcpy_insitu(dest, header, header_mask, value ? PUGIXML_TEXT("true") : PUGIXML_TEXT("false"));
+	}
+
+	// we need to get length of entire file to load it in memory; the only (relatively) sane way to do it is via seek/tell trick
+	PUGI__FN xml_parse_status get_file_size(FILE* file, size_t& out_result)
+	{
+	#if defined(PUGI__MSVC_CRT_VERSION) && PUGI__MSVC_CRT_VERSION >= 1400 && !defined(_WIN32_WCE)
+		// there are 64-bit versions of fseek/ftell, let's use them
+		typedef __int64 length_type;
+
+		_fseeki64(file, 0, SEEK_END);
+		length_type length = _ftelli64(file);
+		_fseeki64(file, 0, SEEK_SET);
+	#elif defined(__MINGW32__) && !defined(__NO_MINGW_LFS) && !defined(__STRICT_ANSI__)
+		// there are 64-bit versions of fseek/ftell, let's use them
+		typedef off64_t length_type;
+
+		fseeko64(file, 0, SEEK_END);
+		length_type length = ftello64(file);
+		fseeko64(file, 0, SEEK_SET);
+	#else
+		// if this is a 32-bit OS, long is enough; if this is a unix system, long is 64-bit, which is enough; otherwise we can't do anything anyway.
+		typedef long length_type;
+
+		fseek(file, 0, SEEK_END);
+		length_type length = ftell(file);
+		fseek(file, 0, SEEK_SET);
+	#endif
+
+		// check for I/O errors
+		if (length < 0) return status_io_error;
+		
+		// check for overflow
+		size_t result = static_cast<size_t>(length);
+
+		if (static_cast<length_type>(result) != length) return status_out_of_memory;
+
+		// finalize
+		out_result = result;
+
+		return status_ok;
+	}
+
+	PUGI__FN xml_parse_result load_file_impl(xml_document& doc, FILE* file, unsigned int options, xml_encoding encoding)
+	{
+		if (!file) return make_parse_result(status_file_not_found);
+
+		// get file size (can result in I/O errors)
+		size_t size = 0;
+		xml_parse_status size_status = get_file_size(file, size);
+
+		if (size_status != status_ok)
+		{
+			fclose(file);
+			return make_parse_result(size_status);
+		}
+		
+		// allocate buffer for the whole file
+		char* contents = static_cast<char*>(xml_memory::allocate(size > 0 ? size : 1));
+
+		if (!contents)
+		{
+			fclose(file);
+			return make_parse_result(status_out_of_memory);
+		}
+
+		// read file in memory
+		size_t read_size = fread(contents, 1, size, file);
+		fclose(file);
+
+		if (read_size != size)
+		{
+			xml_memory::deallocate(contents);
+			return make_parse_result(status_io_error);
+		}
+		
+		return doc.load_buffer_inplace_own(contents, size, options, encoding);
+	}
+
+#ifndef PUGIXML_NO_STL
+	template <typename T> struct xml_stream_chunk
+	{
+		static xml_stream_chunk* create()
+		{
+			void* memory = xml_memory::allocate(sizeof(xml_stream_chunk));
+			
+			return new (memory) xml_stream_chunk();
+		}
+
+		static void destroy(void* ptr)
+		{
+			xml_stream_chunk* chunk = static_cast<xml_stream_chunk*>(ptr);
+
+			// free chunk chain
+			while (chunk)
+			{
+				xml_stream_chunk* next = chunk->next;
+				xml_memory::deallocate(chunk);
+				chunk = next;
+			}
+		}
+
+		xml_stream_chunk(): next(0), size(0)
+		{
+		}
+
+		xml_stream_chunk* next;
+		size_t size;
+
+		T data[xml_memory_page_size / sizeof(T)];
+	};
+
+	template <typename T> PUGI__FN xml_parse_status load_stream_data_noseek(std::basic_istream<T>& stream, void** out_buffer, size_t* out_size)
+	{
+		buffer_holder chunks(0, xml_stream_chunk<T>::destroy);
+
+		// read file to a chunk list
+		size_t total = 0;
+		xml_stream_chunk<T>* last = 0;
+
+		while (!stream.eof())
+		{
+			// allocate new chunk
+			xml_stream_chunk<T>* chunk = xml_stream_chunk<T>::create();
+			if (!chunk) return status_out_of_memory;
+
+			// append chunk to list
+			if (last) last = last->next = chunk;
+			else chunks.data = last = chunk;
+
+			// read data to chunk
+			stream.read(chunk->data, static_cast<std::streamsize>(sizeof(chunk->data) / sizeof(T)));
+			chunk->size = static_cast<size_t>(stream.gcount()) * sizeof(T);
+
+			// read may set failbit | eofbit in case gcount() is less than read length, so check for other I/O errors
+			if (stream.bad() || (!stream.eof() && stream.fail())) return status_io_error;
+
+			// guard against huge files (chunk size is small enough to make this overflow check work)
+			if (total + chunk->size < total) return status_out_of_memory;
+			total += chunk->size;
+		}
+
+		// copy chunk list to a contiguous buffer
+		char* buffer = static_cast<char*>(xml_memory::allocate(total));
+		if (!buffer) return status_out_of_memory;
+
+		char* write = buffer;
+
+		for (xml_stream_chunk<T>* chunk = static_cast<xml_stream_chunk<T>*>(chunks.data); chunk; chunk = chunk->next)
+		{
+			assert(write + chunk->size <= buffer + total);
+			memcpy(write, chunk->data, chunk->size);
+			write += chunk->size;
+		}
+
+		assert(write == buffer + total);
+
+		// return buffer
+		*out_buffer = buffer;
+		*out_size = total;
+
+		return status_ok;
+	}
+
+	template <typename T> PUGI__FN xml_parse_status load_stream_data_seek(std::basic_istream<T>& stream, void** out_buffer, size_t* out_size)
+	{
+		// get length of remaining data in stream
+		typename std::basic_istream<T>::pos_type pos = stream.tellg();
+		stream.seekg(0, std::ios::end);
+		std::streamoff length = stream.tellg() - pos;
+		stream.seekg(pos);
+
+		if (stream.fail() || pos < 0) return status_io_error;
+
+		// guard against huge files
+		size_t read_length = static_cast<size_t>(length);
+
+		if (static_cast<std::streamsize>(read_length) != length || length < 0) return status_out_of_memory;
+
+		// read stream data into memory (guard against stream exceptions with buffer holder)
+		buffer_holder buffer(xml_memory::allocate((read_length > 0 ? read_length : 1) * sizeof(T)), xml_memory::deallocate);
+		if (!buffer.data) return status_out_of_memory;
+
+		stream.read(static_cast<T*>(buffer.data), static_cast<std::streamsize>(read_length));
+
+		// read may set failbit | eofbit in case gcount() is less than read_length (i.e. line ending conversion), so check for other I/O errors
+		if (stream.bad() || (!stream.eof() && stream.fail())) return status_io_error;
+
+		// return buffer
+		size_t actual_length = static_cast<size_t>(stream.gcount());
+		assert(actual_length <= read_length);
+
+		*out_buffer = buffer.release();
+		*out_size = actual_length * sizeof(T);
+
+		return status_ok;
+	}
+
+	template <typename T> PUGI__FN xml_parse_result load_stream_impl(xml_document& doc, std::basic_istream<T>& stream, unsigned int options, xml_encoding encoding)
+	{
+		void* buffer = 0;
+		size_t size = 0;
+
+		// load stream to memory (using seek-based implementation if possible, since it's faster and takes less memory)
+		xml_parse_status status = (stream.tellg() < 0) ? load_stream_data_noseek(stream, &buffer, &size) : load_stream_data_seek(stream, &buffer, &size);
+		if (status != status_ok) return make_parse_result(status);
+
+		return doc.load_buffer_inplace_own(buffer, size, options, encoding);
+	}
+#endif
+
+#if defined(PUGI__MSVC_CRT_VERSION) || defined(__BORLANDC__) || (defined(__MINGW32__) && !defined(__STRICT_ANSI__))
+	PUGI__FN FILE* open_file_wide(const wchar_t* path, const wchar_t* mode)
+	{
+		return _wfopen(path, mode);
+	}
+#else
+	PUGI__FN char* convert_path_heap(const wchar_t* str)
+	{
+		assert(str);
+
+		// first pass: get length in utf8 characters
+		size_t length = wcslen(str);
+		size_t size = as_utf8_begin(str, length);
+
+		// allocate resulting string
+		char* result = static_cast<char*>(xml_memory::allocate(size + 1));
+		if (!result) return 0;
+
+		// second pass: convert to utf8
+		as_utf8_end(result, size, str, length);
+
+		return result;
+	}
+
+	PUGI__FN FILE* open_file_wide(const wchar_t* path, const wchar_t* mode)
+	{
+		// there is no standard function to open wide paths, so our best bet is to try utf8 path
+		char* path_utf8 = convert_path_heap(path);
+		if (!path_utf8) return 0;
+
+		// convert mode to ASCII (we mirror _wfopen interface)
+		char mode_ascii[4] = {0};
+		for (size_t i = 0; mode[i]; ++i) mode_ascii[i] = static_cast<char>(mode[i]);
+
+		// try to open the utf8 path
+		FILE* result = fopen(path_utf8, mode_ascii);
+
+		// free dummy buffer
+		xml_memory::deallocate(path_utf8);
+
+		return result;
+	}
+#endif
+
+	PUGI__FN bool save_file_impl(const xml_document& doc, FILE* file, const char_t* indent, unsigned int flags, xml_encoding encoding)
+	{
+		if (!file) return false;
+
+		xml_writer_file writer(file);
+		doc.save(writer, indent, flags, encoding);
+
+		int result = ferror(file);
+
+		fclose(file);
+
+		return result == 0;
+	}
+PUGI__NS_END
+
+namespace pugi
+{
+	PUGI__FN xml_writer_file::xml_writer_file(void* file_): file(file_)
+	{
+	}
+
+	PUGI__FN void xml_writer_file::write(const void* data, size_t size)
+	{
+		size_t result = fwrite(data, 1, size, static_cast<FILE*>(file));
+		(void)!result; // unfortunately we can't do proper error handling here
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN xml_writer_stream::xml_writer_stream(std::basic_ostream<char, std::char_traits<char> >& stream): narrow_stream(&stream), wide_stream(0)
+	{
+	}
+
+	PUGI__FN xml_writer_stream::xml_writer_stream(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream): narrow_stream(0), wide_stream(&stream)
+	{
+	}
+
+	PUGI__FN void xml_writer_stream::write(const void* data, size_t size)
+	{
+		if (narrow_stream)
+		{
+			assert(!wide_stream);
+			narrow_stream->write(reinterpret_cast<const char*>(data), static_cast<std::streamsize>(size));
+		}
+		else
+		{
+			assert(wide_stream);
+			assert(size % sizeof(wchar_t) == 0);
+
+			wide_stream->write(reinterpret_cast<const wchar_t*>(data), static_cast<std::streamsize>(size / sizeof(wchar_t)));
+		}
+	}
+#endif
+
+	PUGI__FN xml_tree_walker::xml_tree_walker(): _depth(0)
+	{
+	}
+	
+	PUGI__FN xml_tree_walker::~xml_tree_walker()
+	{
+	}
+
+	PUGI__FN int xml_tree_walker::depth() const
+	{
+		return _depth;
+	}
+
+	PUGI__FN bool xml_tree_walker::begin(xml_node&)
+	{
+		return true;
+	}
+
+	PUGI__FN bool xml_tree_walker::end(xml_node&)
+	{
+		return true;
+	}
+
+	PUGI__FN xml_attribute::xml_attribute(): _attr(0)
+	{
+	}
+
+	PUGI__FN xml_attribute::xml_attribute(xml_attribute_struct* attr): _attr(attr)
+	{
+	}
+
+	PUGI__FN static void unspecified_bool_xml_attribute(xml_attribute***)
+	{
+	}
+
+	PUGI__FN xml_attribute::operator xml_attribute::unspecified_bool_type() const
+	{
+		return _attr ? unspecified_bool_xml_attribute : 0;
+	}
+
+	PUGI__FN bool xml_attribute::operator!() const
+	{
+		return !_attr;
+	}
+
+	PUGI__FN bool xml_attribute::operator==(const xml_attribute& r) const
+	{
+		return (_attr == r._attr);
+	}
+	
+	PUGI__FN bool xml_attribute::operator!=(const xml_attribute& r) const
+	{
+		return (_attr != r._attr);
+	}
+
+	PUGI__FN bool xml_attribute::operator<(const xml_attribute& r) const
+	{
+		return (_attr < r._attr);
+	}
+	
+	PUGI__FN bool xml_attribute::operator>(const xml_attribute& r) const
+	{
+		return (_attr > r._attr);
+	}
+	
+	PUGI__FN bool xml_attribute::operator<=(const xml_attribute& r) const
+	{
+		return (_attr <= r._attr);
+	}
+	
+	PUGI__FN bool xml_attribute::operator>=(const xml_attribute& r) const
+	{
+		return (_attr >= r._attr);
+	}
+
+	PUGI__FN xml_attribute xml_attribute::next_attribute() const
+	{
+		return _attr ? xml_attribute(_attr->next_attribute) : xml_attribute();
+	}
+
+	PUGI__FN xml_attribute xml_attribute::previous_attribute() const
+	{
+		return _attr && _attr->prev_attribute_c->next_attribute ? xml_attribute(_attr->prev_attribute_c) : xml_attribute();
+	}
+
+	PUGI__FN const char_t* xml_attribute::as_string(const char_t* def) const
+	{
+		return (_attr && _attr->value) ? _attr->value : def;
+	}
+
+	PUGI__FN int xml_attribute::as_int(int def) const
+	{
+		return impl::get_value_int(_attr ? _attr->value : 0, def);
+	}
+
+	PUGI__FN unsigned int xml_attribute::as_uint(unsigned int def) const
+	{
+		return impl::get_value_uint(_attr ? _attr->value : 0, def);
+	}
+
+	PUGI__FN double xml_attribute::as_double(double def) const
+	{
+		return impl::get_value_double(_attr ? _attr->value : 0, def);
+	}
+
+	PUGI__FN float xml_attribute::as_float(float def) const
+	{
+		return impl::get_value_float(_attr ? _attr->value : 0, def);
+	}
+
+	PUGI__FN bool xml_attribute::as_bool(bool def) const
+	{
+		return impl::get_value_bool(_attr ? _attr->value : 0, def);
+	}
+
+	PUGI__FN bool xml_attribute::empty() const
+	{
+		return !_attr;
+	}
+
+	PUGI__FN const char_t* xml_attribute::name() const
+	{
+		return (_attr && _attr->name) ? _attr->name : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* xml_attribute::value() const
+	{
+		return (_attr && _attr->value) ? _attr->value : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN size_t xml_attribute::hash_value() const
+	{
+		return static_cast<size_t>(reinterpret_cast<uintptr_t>(_attr) / sizeof(xml_attribute_struct));
+	}
+
+	PUGI__FN xml_attribute_struct* xml_attribute::internal_object() const
+	{
+		return _attr;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute::operator=(const char_t* rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+	
+	PUGI__FN xml_attribute& xml_attribute::operator=(int rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute::operator=(unsigned int rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute::operator=(double rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+	
+	PUGI__FN xml_attribute& xml_attribute::operator=(bool rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+
+	PUGI__FN bool xml_attribute::set_name(const char_t* rhs)
+	{
+		if (!_attr) return false;
+		
+		return impl::strcpy_insitu(_attr->name, _attr->header, impl::xml_memory_page_name_allocated_mask, rhs);
+	}
+		
+	PUGI__FN bool xml_attribute::set_value(const char_t* rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::strcpy_insitu(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN bool xml_attribute::set_value(int rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN bool xml_attribute::set_value(unsigned int rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN bool xml_attribute::set_value(double rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+	
+	PUGI__FN bool xml_attribute::set_value(bool rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+#ifdef __BORLANDC__
+	PUGI__FN bool operator&&(const xml_attribute& lhs, bool rhs)
+	{
+		return (bool)lhs && rhs;
+	}
+
+	PUGI__FN bool operator||(const xml_attribute& lhs, bool rhs)
+	{
+		return (bool)lhs || rhs;
+	}
+#endif
+
+	PUGI__FN xml_node::xml_node(): _root(0)
+	{
+	}
+
+	PUGI__FN xml_node::xml_node(xml_node_struct* p): _root(p)
+	{
+	}
+	
+	PUGI__FN static void unspecified_bool_xml_node(xml_node***)
+	{
+	}
+
+	PUGI__FN xml_node::operator xml_node::unspecified_bool_type() const
+	{
+		return _root ? unspecified_bool_xml_node : 0;
+	}
+
+	PUGI__FN bool xml_node::operator!() const
+	{
+		return !_root;
+	}
+
+	PUGI__FN xml_node::iterator xml_node::begin() const
+	{
+		return iterator(_root ? _root->first_child : 0, _root);
+	}
+
+	PUGI__FN xml_node::iterator xml_node::end() const
+	{
+		return iterator(0, _root);
+	}
+	
+	PUGI__FN xml_node::attribute_iterator xml_node::attributes_begin() const
+	{
+		return attribute_iterator(_root ? _root->first_attribute : 0, _root);
+	}
+
+	PUGI__FN xml_node::attribute_iterator xml_node::attributes_end() const
+	{
+		return attribute_iterator(0, _root);
+	}
+	
+	PUGI__FN xml_object_range<xml_node_iterator> xml_node::children() const
+	{
+		return xml_object_range<xml_node_iterator>(begin(), end());
+	}
+
+	PUGI__FN xml_object_range<xml_named_node_iterator> xml_node::children(const char_t* name_) const
+	{
+		return xml_object_range<xml_named_node_iterator>(xml_named_node_iterator(child(name_), name_), xml_named_node_iterator());
+	}
+
+	PUGI__FN xml_object_range<xml_attribute_iterator> xml_node::attributes() const
+	{
+		return xml_object_range<xml_attribute_iterator>(attributes_begin(), attributes_end());
+	}
+
+	PUGI__FN bool xml_node::operator==(const xml_node& r) const
+	{
+		return (_root == r._root);
+	}
+
+	PUGI__FN bool xml_node::operator!=(const xml_node& r) const
+	{
+		return (_root != r._root);
+	}
+
+	PUGI__FN bool xml_node::operator<(const xml_node& r) const
+	{
+		return (_root < r._root);
+	}
+	
+	PUGI__FN bool xml_node::operator>(const xml_node& r) const
+	{
+		return (_root > r._root);
+	}
+	
+	PUGI__FN bool xml_node::operator<=(const xml_node& r) const
+	{
+		return (_root <= r._root);
+	}
+	
+	PUGI__FN bool xml_node::operator>=(const xml_node& r) const
+	{
+		return (_root >= r._root);
+	}
+
+	PUGI__FN bool xml_node::empty() const
+	{
+		return !_root;
+	}
+	
+	PUGI__FN const char_t* xml_node::name() const
+	{
+		return (_root && _root->name) ? _root->name : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN xml_node_type xml_node::type() const
+	{
+		return _root ? static_cast<xml_node_type>((_root->header & impl::xml_memory_page_type_mask) + 1) : node_null;
+	}
+	
+	PUGI__FN const char_t* xml_node::value() const
+	{
+		return (_root && _root->value) ? _root->value : PUGIXML_TEXT("");
+	}
+	
+	PUGI__FN xml_node xml_node::child(const char_t* name_) const
+	{
+		if (!_root) return xml_node();
+
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			if (i->name && impl::strequal(name_, i->name)) return xml_node(i);
+
+		return xml_node();
+	}
+
+	PUGI__FN xml_attribute xml_node::attribute(const char_t* name_) const
+	{
+		if (!_root) return xml_attribute();
+
+		for (xml_attribute_struct* i = _root->first_attribute; i; i = i->next_attribute)
+			if (i->name && impl::strequal(name_, i->name))
+				return xml_attribute(i);
+		
+		return xml_attribute();
+	}
+	
+	PUGI__FN xml_node xml_node::next_sibling(const char_t* name_) const
+	{
+		if (!_root) return xml_node();
+		
+		for (xml_node_struct* i = _root->next_sibling; i; i = i->next_sibling)
+			if (i->name && impl::strequal(name_, i->name)) return xml_node(i);
+
+		return xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::next_sibling() const
+	{
+		if (!_root) return xml_node();
+		
+		if (_root->next_sibling) return xml_node(_root->next_sibling);
+		else return xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::previous_sibling(const char_t* name_) const
+	{
+		if (!_root) return xml_node();
+		
+		for (xml_node_struct* i = _root->prev_sibling_c; i->next_sibling; i = i->prev_sibling_c)
+			if (i->name && impl::strequal(name_, i->name)) return xml_node(i);
+
+		return xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::previous_sibling() const
+	{
+		if (!_root) return xml_node();
+		
+		if (_root->prev_sibling_c->next_sibling) return xml_node(_root->prev_sibling_c);
+		else return xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::parent() const
+	{
+		return _root ? xml_node(_root->parent) : xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::root() const
+	{
+		if (!_root) return xml_node();
+
+		impl::xml_memory_page* page = reinterpret_cast<impl::xml_memory_page*>(_root->header & impl::xml_memory_page_pointer_mask);
+
+		return xml_node(static_cast<impl::xml_document_struct*>(page->allocator));
+	}
+
+	PUGI__FN xml_text xml_node::text() const
+	{
+		return xml_text(_root);
+	}
+
+	PUGI__FN const char_t* xml_node::child_value() const
+	{
+		if (!_root) return PUGIXML_TEXT("");
+		
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			if (i->value && impl::is_text_node(i))
+				return i->value;
+
+		return PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* xml_node::child_value(const char_t* name_) const
+	{
+		return child(name_).child_value();
+	}
+
+	PUGI__FN xml_attribute xml_node::first_attribute() const
+	{
+		return _root ? xml_attribute(_root->first_attribute) : xml_attribute();
+	}
+
+	PUGI__FN xml_attribute xml_node::last_attribute() const
+	{
+		return _root && _root->first_attribute ? xml_attribute(_root->first_attribute->prev_attribute_c) : xml_attribute();
+	}
+
+	PUGI__FN xml_node xml_node::first_child() const
+	{
+		return _root ? xml_node(_root->first_child) : xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::last_child() const
+	{
+		return _root && _root->first_child ? xml_node(_root->first_child->prev_sibling_c) : xml_node();
+	}
+
+	PUGI__FN bool xml_node::set_name(const char_t* rhs)
+	{
+		switch (type())
+		{
+		case node_pi:
+		case node_declaration:
+		case node_element:
+			return impl::strcpy_insitu(_root->name, _root->header, impl::xml_memory_page_name_allocated_mask, rhs);
+
+		default:
+			return false;
+		}
+	}
+		
+	PUGI__FN bool xml_node::set_value(const char_t* rhs)
+	{
+		switch (type())
+		{
+		case node_pi:
+		case node_cdata:
+		case node_pcdata:
+		case node_comment:
+		case node_doctype:
+			return impl::strcpy_insitu(_root->value, _root->header, impl::xml_memory_page_value_allocated_mask, rhs);
+
+		default:
+			return false;
+		}
+	}
+
+	PUGI__FN xml_attribute xml_node::append_attribute(const char_t* name_)
+	{
+		if (type() != node_element && type() != node_declaration) return xml_attribute();
+		
+		xml_attribute a(impl::append_attribute_ll(_root, impl::get_allocator(_root)));
+		a.set_name(name_);
+		
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::prepend_attribute(const char_t* name_)
+	{
+		if (type() != node_element && type() != node_declaration) return xml_attribute();
+		
+		xml_attribute a(impl::allocate_attribute(impl::get_allocator(_root)));
+		if (!a) return xml_attribute();
+
+		a.set_name(name_);
+		
+		xml_attribute_struct* head = _root->first_attribute;
+
+		if (head)
+		{
+			a._attr->prev_attribute_c = head->prev_attribute_c;
+			head->prev_attribute_c = a._attr;
+		}
+		else
+			a._attr->prev_attribute_c = a._attr;
+		
+		a._attr->next_attribute = head;
+		_root->first_attribute = a._attr;
+				
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::insert_attribute_before(const char_t* name_, const xml_attribute& attr)
+	{
+		if ((type() != node_element && type() != node_declaration) || attr.empty()) return xml_attribute();
+		
+		// check that attribute belongs to *this
+		xml_attribute_struct* cur = attr._attr;
+
+		while (cur->prev_attribute_c->next_attribute) cur = cur->prev_attribute_c;
+
+		if (cur != _root->first_attribute) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(impl::get_allocator(_root)));
+		if (!a) return xml_attribute();
+
+		a.set_name(name_);
+
+		if (attr._attr->prev_attribute_c->next_attribute)
+			attr._attr->prev_attribute_c->next_attribute = a._attr;
+		else
+			_root->first_attribute = a._attr;
+		
+		a._attr->prev_attribute_c = attr._attr->prev_attribute_c;
+		a._attr->next_attribute = attr._attr;
+		attr._attr->prev_attribute_c = a._attr;
+				
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::insert_attribute_after(const char_t* name_, const xml_attribute& attr)
+	{
+		if ((type() != node_element && type() != node_declaration) || attr.empty()) return xml_attribute();
+		
+		// check that attribute belongs to *this
+		xml_attribute_struct* cur = attr._attr;
+
+		while (cur->prev_attribute_c->next_attribute) cur = cur->prev_attribute_c;
+
+		if (cur != _root->first_attribute) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(impl::get_allocator(_root)));
+		if (!a) return xml_attribute();
+
+		a.set_name(name_);
+
+		if (attr._attr->next_attribute)
+			attr._attr->next_attribute->prev_attribute_c = a._attr;
+		else
+			_root->first_attribute->prev_attribute_c = a._attr;
+		
+		a._attr->next_attribute = attr._attr->next_attribute;
+		a._attr->prev_attribute_c = attr._attr;
+		attr._attr->next_attribute = a._attr;
+
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::append_copy(const xml_attribute& proto)
+	{
+		if (!proto) return xml_attribute();
+
+		xml_attribute result = append_attribute(proto.name());
+		result.set_value(proto.value());
+
+		return result;
+	}
+
+	PUGI__FN xml_attribute xml_node::prepend_copy(const xml_attribute& proto)
+	{
+		if (!proto) return xml_attribute();
+
+		xml_attribute result = prepend_attribute(proto.name());
+		result.set_value(proto.value());
+
+		return result;
+	}
+
+	PUGI__FN xml_attribute xml_node::insert_copy_after(const xml_attribute& proto, const xml_attribute& attr)
+	{
+		if (!proto) return xml_attribute();
+
+		xml_attribute result = insert_attribute_after(proto.name(), attr);
+		result.set_value(proto.value());
+
+		return result;
+	}
+
+	PUGI__FN xml_attribute xml_node::insert_copy_before(const xml_attribute& proto, const xml_attribute& attr)
+	{
+		if (!proto) return xml_attribute();
+
+		xml_attribute result = insert_attribute_before(proto.name(), attr);
+		result.set_value(proto.value());
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::append_child(xml_node_type type_)
+	{
+		if (!impl::allow_insert_child(this->type(), type_)) return xml_node();
+		
+		xml_node n(impl::append_node(_root, impl::get_allocator(_root), type_));
+
+		if (type_ == node_declaration) n.set_name(PUGIXML_TEXT("xml"));
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::prepend_child(xml_node_type type_)
+	{
+		if (!impl::allow_insert_child(this->type(), type_)) return xml_node();
+		
+		xml_node n(impl::allocate_node(impl::get_allocator(_root), type_));
+		if (!n) return xml_node();
+
+		n._root->parent = _root;
+
+		xml_node_struct* head = _root->first_child;
+
+		if (head)
+		{
+			n._root->prev_sibling_c = head->prev_sibling_c;
+			head->prev_sibling_c = n._root;
+		}
+		else
+			n._root->prev_sibling_c = n._root;
+		
+		n._root->next_sibling = head;
+		_root->first_child = n._root;
+				
+		if (type_ == node_declaration) n.set_name(PUGIXML_TEXT("xml"));
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::insert_child_before(xml_node_type type_, const xml_node& node)
+	{
+		if (!impl::allow_insert_child(this->type(), type_)) return xml_node();
+		if (!node._root || node._root->parent != _root) return xml_node();
+	
+		xml_node n(impl::allocate_node(impl::get_allocator(_root), type_));
+		if (!n) return xml_node();
+
+		n._root->parent = _root;
+		
+		if (node._root->prev_sibling_c->next_sibling)
+			node._root->prev_sibling_c->next_sibling = n._root;
+		else
+			_root->first_child = n._root;
+		
+		n._root->prev_sibling_c = node._root->prev_sibling_c;
+		n._root->next_sibling = node._root;
+		node._root->prev_sibling_c = n._root;
+
+		if (type_ == node_declaration) n.set_name(PUGIXML_TEXT("xml"));
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::insert_child_after(xml_node_type type_, const xml_node& node)
+	{
+		if (!impl::allow_insert_child(this->type(), type_)) return xml_node();
+		if (!node._root || node._root->parent != _root) return xml_node();
+	
+		xml_node n(impl::allocate_node(impl::get_allocator(_root), type_));
+		if (!n) return xml_node();
+
+		n._root->parent = _root;
+	
+		if (node._root->next_sibling)
+			node._root->next_sibling->prev_sibling_c = n._root;
+		else
+			_root->first_child->prev_sibling_c = n._root;
+		
+		n._root->next_sibling = node._root->next_sibling;
+		n._root->prev_sibling_c = node._root;
+		node._root->next_sibling = n._root;
+
+		if (type_ == node_declaration) n.set_name(PUGIXML_TEXT("xml"));
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::append_child(const char_t* name_)
+	{
+		xml_node result = append_child(node_element);
+
+		result.set_name(name_);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::prepend_child(const char_t* name_)
+	{
+		xml_node result = prepend_child(node_element);
+
+		result.set_name(name_);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::insert_child_after(const char_t* name_, const xml_node& node)
+	{
+		xml_node result = insert_child_after(node_element, node);
+
+		result.set_name(name_);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::insert_child_before(const char_t* name_, const xml_node& node)
+	{
+		xml_node result = insert_child_before(node_element, node);
+
+		result.set_name(name_);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::append_copy(const xml_node& proto)
+	{
+		xml_node result = append_child(proto.type());
+
+		if (result) impl::recursive_copy_skip(result, proto, result);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::prepend_copy(const xml_node& proto)
+	{
+		xml_node result = prepend_child(proto.type());
+
+		if (result) impl::recursive_copy_skip(result, proto, result);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::insert_copy_after(const xml_node& proto, const xml_node& node)
+	{
+		xml_node result = insert_child_after(proto.type(), node);
+
+		if (result) impl::recursive_copy_skip(result, proto, result);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::insert_copy_before(const xml_node& proto, const xml_node& node)
+	{
+		xml_node result = insert_child_before(proto.type(), node);
+
+		if (result) impl::recursive_copy_skip(result, proto, result);
+
+		return result;
+	}
+
+	PUGI__FN bool xml_node::remove_attribute(const char_t* name_)
+	{
+		return remove_attribute(attribute(name_));
+	}
+
+	PUGI__FN bool xml_node::remove_attribute(const xml_attribute& a)
+	{
+		if (!_root || !a._attr) return false;
+
+		// check that attribute belongs to *this
+		xml_attribute_struct* attr = a._attr;
+
+		while (attr->prev_attribute_c->next_attribute) attr = attr->prev_attribute_c;
+
+		if (attr != _root->first_attribute) return false;
+
+		if (a._attr->next_attribute) a._attr->next_attribute->prev_attribute_c = a._attr->prev_attribute_c;
+		else if (_root->first_attribute) _root->first_attribute->prev_attribute_c = a._attr->prev_attribute_c;
+		
+		if (a._attr->prev_attribute_c->next_attribute) a._attr->prev_attribute_c->next_attribute = a._attr->next_attribute;
+		else _root->first_attribute = a._attr->next_attribute;
+
+		impl::destroy_attribute(a._attr, impl::get_allocator(_root));
+
+		return true;
+	}
+
+	PUGI__FN bool xml_node::remove_child(const char_t* name_)
+	{
+		return remove_child(child(name_));
+	}
+
+	PUGI__FN bool xml_node::remove_child(const xml_node& n)
+	{
+		if (!_root || !n._root || n._root->parent != _root) return false;
+
+		if (n._root->next_sibling) n._root->next_sibling->prev_sibling_c = n._root->prev_sibling_c;
+		else if (_root->first_child) _root->first_child->prev_sibling_c = n._root->prev_sibling_c;
+		
+		if (n._root->prev_sibling_c->next_sibling) n._root->prev_sibling_c->next_sibling = n._root->next_sibling;
+		else _root->first_child = n._root->next_sibling;
+		
+		impl::destroy_node(n._root, impl::get_allocator(_root));
+
+		return true;
+	}
+
+	PUGI__FN xml_node xml_node::find_child_by_attribute(const char_t* name_, const char_t* attr_name, const char_t* attr_value) const
+	{
+		if (!_root) return xml_node();
+		
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			if (i->name && impl::strequal(name_, i->name))
+			{
+				for (xml_attribute_struct* a = i->first_attribute; a; a = a->next_attribute)
+					if (impl::strequal(attr_name, a->name) && impl::strequal(attr_value, a->value))
+						return xml_node(i);
+			}
+
+		return xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::find_child_by_attribute(const char_t* attr_name, const char_t* attr_value) const
+	{
+		if (!_root) return xml_node();
+		
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			for (xml_attribute_struct* a = i->first_attribute; a; a = a->next_attribute)
+				if (impl::strequal(attr_name, a->name) && impl::strequal(attr_value, a->value))
+					return xml_node(i);
+
+		return xml_node();
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN string_t xml_node::path(char_t delimiter) const
+	{
+		xml_node cursor = *this; // Make a copy.
+		
+		string_t result = cursor.name();
+
+		while (cursor.parent())
+		{
+			cursor = cursor.parent();
+			
+			string_t temp = cursor.name();
+			temp += delimiter;
+			temp += result;
+			result.swap(temp);
+		}
+
+		return result;
+	}
+#endif
+
+	PUGI__FN xml_node xml_node::first_element_by_path(const char_t* path_, char_t delimiter) const
+	{
+		xml_node found = *this; // Current search context.
+
+		if (!_root || !path_ || !path_[0]) return found;
+
+		if (path_[0] == delimiter)
+		{
+			// Absolute path; e.g. '/foo/bar'
+			found = found.root();
+			++path_;
+		}
+
+		const char_t* path_segment = path_;
+
+		while (*path_segment == delimiter) ++path_segment;
+
+		const char_t* path_segment_end = path_segment;
+
+		while (*path_segment_end && *path_segment_end != delimiter) ++path_segment_end;
+
+		if (path_segment == path_segment_end) return found;
+
+		const char_t* next_segment = path_segment_end;
+
+		while (*next_segment == delimiter) ++next_segment;
+
+		if (*path_segment == '.' && path_segment + 1 == path_segment_end)
+			return found.first_element_by_path(next_segment, delimiter);
+		else if (*path_segment == '.' && *(path_segment+1) == '.' && path_segment + 2 == path_segment_end)
+			return found.parent().first_element_by_path(next_segment, delimiter);
+		else
+		{
+			for (xml_node_struct* j = found._root->first_child; j; j = j->next_sibling)
+			{
+				if (j->name && impl::strequalrange(j->name, path_segment, static_cast<size_t>(path_segment_end - path_segment)))
+				{
+					xml_node subsearch = xml_node(j).first_element_by_path(next_segment, delimiter);
+
+					if (subsearch) return subsearch;
+				}
+			}
+
+			return xml_node();
+		}
+	}
+
+	PUGI__FN bool xml_node::traverse(xml_tree_walker& walker)
+	{
+		walker._depth = -1;
+		
+		xml_node arg_begin = *this;
+		if (!walker.begin(arg_begin)) return false;
+
+		xml_node cur = first_child();
+				
+		if (cur)
+		{
+			++walker._depth;
+
+			do 
+			{
+				xml_node arg_for_each = cur;
+				if (!walker.for_each(arg_for_each))
+					return false;
+						
+				if (cur.first_child())
+				{
+					++walker._depth;
+					cur = cur.first_child();
+				}
+				else if (cur.next_sibling())
+					cur = cur.next_sibling();
+				else
+				{
+					// Borland C++ workaround
+					while (!cur.next_sibling() && cur != *this && !cur.parent().empty())
+					{
+						--walker._depth;
+						cur = cur.parent();
+					}
+						
+					if (cur != *this)
+						cur = cur.next_sibling();
+				}
+			}
+			while (cur && cur != *this);
+		}
+
+		assert(walker._depth == -1);
+
+		xml_node arg_end = *this;
+		return walker.end(arg_end);
+	}
+
+	PUGI__FN size_t xml_node::hash_value() const
+	{
+		return static_cast<size_t>(reinterpret_cast<uintptr_t>(_root) / sizeof(xml_node_struct));
+	}
+
+	PUGI__FN xml_node_struct* xml_node::internal_object() const
+	{
+		return _root;
+	}
+
+	PUGI__FN void xml_node::print(xml_writer& writer, const char_t* indent, unsigned int flags, xml_encoding encoding, unsigned int depth) const
+	{
+		if (!_root) return;
+
+		impl::xml_buffered_writer buffered_writer(writer, encoding);
+
+		impl::node_output(buffered_writer, *this, indent, flags, depth);
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN void xml_node::print(std::basic_ostream<char, std::char_traits<char> >& stream, const char_t* indent, unsigned int flags, xml_encoding encoding, unsigned int depth) const
+	{
+		xml_writer_stream writer(stream);
+
+		print(writer, indent, flags, encoding, depth);
+	}
+
+	PUGI__FN void xml_node::print(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream, const char_t* indent, unsigned int flags, unsigned int depth) const
+	{
+		xml_writer_stream writer(stream);
+
+		print(writer, indent, flags, encoding_wchar, depth);
+	}
+#endif
+
+	PUGI__FN ptrdiff_t xml_node::offset_debug() const
+	{
+		xml_node_struct* r = root()._root;
+
+		if (!r) return -1;
+
+		const char_t* buffer = static_cast<impl::xml_document_struct*>(r)->buffer;
+
+		if (!buffer) return -1;
+
+		switch (type())
+		{
+		case node_document:
+			return 0;
+
+		case node_element:
+		case node_declaration:
+		case node_pi:
+			return (_root->header & impl::xml_memory_page_name_allocated_mask) ? -1 : _root->name - buffer;
+
+		case node_pcdata:
+		case node_cdata:
+		case node_comment:
+		case node_doctype:
+			return (_root->header & impl::xml_memory_page_value_allocated_mask) ? -1 : _root->value - buffer;
+
+		default:
+			return -1;
+		}
+	}
+
+#ifdef __BORLANDC__
+	PUGI__FN bool operator&&(const xml_node& lhs, bool rhs)
+	{
+		return (bool)lhs && rhs;
+	}
+
+	PUGI__FN bool operator||(const xml_node& lhs, bool rhs)
+	{
+		return (bool)lhs || rhs;
+	}
+#endif
+
+	PUGI__FN xml_text::xml_text(xml_node_struct* root): _root(root)
+	{
+	}
+
+	PUGI__FN xml_node_struct* xml_text::_data() const
+	{
+		if (!_root || impl::is_text_node(_root)) return _root;
+
+		for (xml_node_struct* node = _root->first_child; node; node = node->next_sibling)
+			if (impl::is_text_node(node))
+				return node;
+
+		return 0;
+	}
+
+	PUGI__FN xml_node_struct* xml_text::_data_new()
+	{
+		xml_node_struct* d = _data();
+		if (d) return d;
+
+		return xml_node(_root).append_child(node_pcdata).internal_object();
+	}
+
+	PUGI__FN xml_text::xml_text(): _root(0)
+	{
+	}
+
+	PUGI__FN static void unspecified_bool_xml_text(xml_text***)
+	{
+	}
+
+	PUGI__FN xml_text::operator xml_text::unspecified_bool_type() const
+	{
+		return _data() ? unspecified_bool_xml_text : 0;
+	}
+
+	PUGI__FN bool xml_text::operator!() const
+	{
+		return !_data();
+	}
+
+	PUGI__FN bool xml_text::empty() const
+	{
+		return _data() == 0;
+	}
+
+	PUGI__FN const char_t* xml_text::get() const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? d->value : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* xml_text::as_string(const char_t* def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? d->value : def;
+	}
+
+	PUGI__FN int xml_text::as_int(int def) const
+	{
+		xml_node_struct* d = _data();
+
+		return impl::get_value_int(d ? d->value : 0, def);
+	}
+
+	PUGI__FN unsigned int xml_text::as_uint(unsigned int def) const
+	{
+		xml_node_struct* d = _data();
+
+		return impl::get_value_uint(d ? d->value : 0, def);
+	}
+
+	PUGI__FN double xml_text::as_double(double def) const
+	{
+		xml_node_struct* d = _data();
+
+		return impl::get_value_double(d ? d->value : 0, def);
+	}
+
+	PUGI__FN float xml_text::as_float(float def) const
+	{
+		xml_node_struct* d = _data();
+
+		return impl::get_value_float(d ? d->value : 0, def);
+	}
+
+	PUGI__FN bool xml_text::as_bool(bool def) const
+	{
+		xml_node_struct* d = _data();
+
+		return impl::get_value_bool(d ? d->value : 0, def);
+	}
+
+	PUGI__FN bool xml_text::set(const char_t* rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::strcpy_insitu(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(int rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(unsigned int rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(double rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(bool rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(const char_t* rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(int rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(unsigned int rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(double rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(bool rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_node xml_text::data() const
+	{
+		return xml_node(_data());
+	}
+
+#ifdef __BORLANDC__
+	PUGI__FN bool operator&&(const xml_text& lhs, bool rhs)
+	{
+		return (bool)lhs && rhs;
+	}
+
+	PUGI__FN bool operator||(const xml_text& lhs, bool rhs)
+	{
+		return (bool)lhs || rhs;
+	}
+#endif
+
+	PUGI__FN xml_node_iterator::xml_node_iterator()
+	{
+	}
+
+	PUGI__FN xml_node_iterator::xml_node_iterator(const xml_node& node): _wrap(node), _parent(node.parent())
+	{
+	}
+
+	PUGI__FN xml_node_iterator::xml_node_iterator(xml_node_struct* ref, xml_node_struct* parent): _wrap(ref), _parent(parent)
+	{
+	}
+
+	PUGI__FN bool xml_node_iterator::operator==(const xml_node_iterator& rhs) const
+	{
+		return _wrap._root == rhs._wrap._root && _parent._root == rhs._parent._root;
+	}
+	
+	PUGI__FN bool xml_node_iterator::operator!=(const xml_node_iterator& rhs) const
+	{
+		return _wrap._root != rhs._wrap._root || _parent._root != rhs._parent._root;
+	}
+
+	PUGI__FN xml_node& xml_node_iterator::operator*() const
+	{
+		assert(_wrap._root);
+		return _wrap;
+	}
+
+	PUGI__FN xml_node* xml_node_iterator::operator->() const
+	{
+		assert(_wrap._root);
+		return const_cast<xml_node*>(&_wrap); // BCC32 workaround
+	}
+
+	PUGI__FN const xml_node_iterator& xml_node_iterator::operator++()
+	{
+		assert(_wrap._root);
+		_wrap._root = _wrap._root->next_sibling;
+		return *this;
+	}
+
+	PUGI__FN xml_node_iterator xml_node_iterator::operator++(int)
+	{
+		xml_node_iterator temp = *this;
+		++*this;
+		return temp;
+	}
+
+	PUGI__FN const xml_node_iterator& xml_node_iterator::operator--()
+	{
+		_wrap = _wrap._root ? _wrap.previous_sibling() : _parent.last_child();
+		return *this;
+	}
+
+	PUGI__FN xml_node_iterator xml_node_iterator::operator--(int)
+	{
+		xml_node_iterator temp = *this;
+		--*this;
+		return temp;
+	}
+
+	PUGI__FN xml_attribute_iterator::xml_attribute_iterator()
+	{
+	}
+
+	PUGI__FN xml_attribute_iterator::xml_attribute_iterator(const xml_attribute& attr, const xml_node& parent): _wrap(attr), _parent(parent)
+	{
+	}
+
+	PUGI__FN xml_attribute_iterator::xml_attribute_iterator(xml_attribute_struct* ref, xml_node_struct* parent): _wrap(ref), _parent(parent)
+	{
+	}
+
+	PUGI__FN bool xml_attribute_iterator::operator==(const xml_attribute_iterator& rhs) const
+	{
+		return _wrap._attr == rhs._wrap._attr && _parent._root == rhs._parent._root;
+	}
+	
+	PUGI__FN bool xml_attribute_iterator::operator!=(const xml_attribute_iterator& rhs) const
+	{
+		return _wrap._attr != rhs._wrap._attr || _parent._root != rhs._parent._root;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute_iterator::operator*() const
+	{
+		assert(_wrap._attr);
+		return _wrap;
+	}
+
+	PUGI__FN xml_attribute* xml_attribute_iterator::operator->() const
+	{
+		assert(_wrap._attr);
+		return const_cast<xml_attribute*>(&_wrap); // BCC32 workaround
+	}
+
+	PUGI__FN const xml_attribute_iterator& xml_attribute_iterator::operator++()
+	{
+		assert(_wrap._attr);
+		_wrap._attr = _wrap._attr->next_attribute;
+		return *this;
+	}
+
+	PUGI__FN xml_attribute_iterator xml_attribute_iterator::operator++(int)
+	{
+		xml_attribute_iterator temp = *this;
+		++*this;
+		return temp;
+	}
+
+	PUGI__FN const xml_attribute_iterator& xml_attribute_iterator::operator--()
+	{
+		_wrap = _wrap._attr ? _wrap.previous_attribute() : _parent.last_attribute();
+		return *this;
+	}
+
+	PUGI__FN xml_attribute_iterator xml_attribute_iterator::operator--(int)
+	{
+		xml_attribute_iterator temp = *this;
+		--*this;
+		return temp;
+	}
+
+	PUGI__FN xml_named_node_iterator::xml_named_node_iterator(): _name(0)
+	{
+	}
+
+	PUGI__FN xml_named_node_iterator::xml_named_node_iterator(const xml_node& node, const char_t* name): _node(node), _name(name)
+	{
+	}
+
+	PUGI__FN bool xml_named_node_iterator::operator==(const xml_named_node_iterator& rhs) const
+	{
+		return _node == rhs._node;
+	}
+
+	PUGI__FN bool xml_named_node_iterator::operator!=(const xml_named_node_iterator& rhs) const
+	{
+		return _node != rhs._node;
+	}
+
+	PUGI__FN xml_node& xml_named_node_iterator::operator*() const
+	{
+		assert(_node._root);
+		return _node;
+	}
+
+	PUGI__FN xml_node* xml_named_node_iterator::operator->() const
+	{
+		assert(_node._root);
+		return const_cast<xml_node*>(&_node); // BCC32 workaround
+	}
+
+	PUGI__FN const xml_named_node_iterator& xml_named_node_iterator::operator++()
+	{
+		assert(_node._root);
+		_node = _node.next_sibling(_name);
+		return *this;
+	}
+
+	PUGI__FN xml_named_node_iterator xml_named_node_iterator::operator++(int)
+	{
+		xml_named_node_iterator temp = *this;
+		++*this;
+		return temp;
+	}
+
+	PUGI__FN xml_parse_result::xml_parse_result(): status(status_internal_error), offset(0), encoding(encoding_auto)
+	{
+	}
+
+	PUGI__FN xml_parse_result::operator bool() const
+	{
+		return status == status_ok;
+	}
+
+	PUGI__FN const char* xml_parse_result::description() const
+	{
+		switch (status)
+		{
+		case status_ok: return "No error";
+
+		case status_file_not_found: return "File was not found";
+		case status_io_error: return "Error reading from file/stream";
+		case status_out_of_memory: return "Could not allocate memory";
+		case status_internal_error: return "Internal error occurred";
+
+		case status_unrecognized_tag: return "Could not determine tag type";
+
+		case status_bad_pi: return "Error parsing document declaration/processing instruction";
+		case status_bad_comment: return "Error parsing comment";
+		case status_bad_cdata: return "Error parsing CDATA section";
+		case status_bad_doctype: return "Error parsing document type declaration";
+		case status_bad_pcdata: return "Error parsing PCDATA section";
+		case status_bad_start_element: return "Error parsing start element tag";
+		case status_bad_attribute: return "Error parsing element attribute";
+		case status_bad_end_element: return "Error parsing end element tag";
+		case status_end_element_mismatch: return "Start-end tags mismatch";
+
+		default: return "Unknown error";
+		}
+	}
+
+	PUGI__FN xml_document::xml_document(): _buffer(0)
+	{
+		create();
+	}
+
+	PUGI__FN xml_document::~xml_document()
+	{
+		destroy();
+	}
+
+	PUGI__FN void xml_document::reset()
+	{
+		destroy();
+		create();
+	}
+
+	PUGI__FN void xml_document::reset(const xml_document& proto)
+	{
+		reset();
+
+		for (xml_node cur = proto.first_child(); cur; cur = cur.next_sibling())
+			append_copy(cur);
+	}
+
+	PUGI__FN void xml_document::create()
+	{
+		// initialize sentinel page
+		PUGI__STATIC_ASSERT(offsetof(impl::xml_memory_page, data) + sizeof(impl::xml_document_struct) + impl::xml_memory_page_alignment <= sizeof(_memory));
+
+		// align upwards to page boundary
+		void* page_memory = reinterpret_cast<void*>((reinterpret_cast<uintptr_t>(_memory) + (impl::xml_memory_page_alignment - 1)) & ~(impl::xml_memory_page_alignment - 1));
+
+		// prepare page structure
+		impl::xml_memory_page* page = impl::xml_memory_page::construct(page_memory);
+
+		page->busy_size = impl::xml_memory_page_size;
+
+		// allocate new root
+		_root = new (page->data) impl::xml_document_struct(page);
+		_root->prev_sibling_c = _root;
+
+		// setup sentinel page
+		page->allocator = static_cast<impl::xml_document_struct*>(_root);
+	}
+
+	PUGI__FN void xml_document::destroy()
+	{
+		// destroy static storage
+		if (_buffer)
+		{
+			impl::xml_memory::deallocate(_buffer);
+			_buffer = 0;
+		}
+
+		// destroy dynamic storage, leave sentinel page (it's in static memory)
+		if (_root)
+		{
+			impl::xml_memory_page* root_page = reinterpret_cast<impl::xml_memory_page*>(_root->header & impl::xml_memory_page_pointer_mask);
+			assert(root_page && !root_page->prev && !root_page->memory);
+
+			// destroy all pages
+			for (impl::xml_memory_page* page = root_page->next; page; )
+			{
+				impl::xml_memory_page* next = page->next;
+
+				impl::xml_allocator::deallocate_page(page);
+
+				page = next;
+			}
+
+			// cleanup root page
+			root_page->allocator = 0;
+			root_page->next = 0;
+			root_page->busy_size = root_page->freed_size = 0;
+
+			_root = 0;
+		}
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN xml_parse_result xml_document::load(std::basic_istream<char, std::char_traits<char> >& stream, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		return impl::load_stream_impl(*this, stream, options, encoding);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load(std::basic_istream<wchar_t, std::char_traits<wchar_t> >& stream, unsigned int options)
+	{
+		reset();
+
+		return impl::load_stream_impl(*this, stream, options, encoding_wchar);
+	}
+#endif
+
+	PUGI__FN xml_parse_result xml_document::load(const char_t* contents, unsigned int options)
+	{
+		// Force native encoding (skip autodetection)
+	#ifdef PUGIXML_WCHAR_MODE
+		xml_encoding encoding = encoding_wchar;
+	#else
+		xml_encoding encoding = encoding_utf8;
+	#endif
+
+		return load_buffer(contents, impl::strlength(contents) * sizeof(char_t), options, encoding);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_file(const char* path_, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		FILE* file = fopen(path_, "rb");
+
+		return impl::load_file_impl(*this, file, options, encoding);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_file(const wchar_t* path_, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		FILE* file = impl::open_file_wide(path_, L"rb");
+
+		return impl::load_file_impl(*this, file, options, encoding);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_buffer_impl(void* contents, size_t size, unsigned int options, xml_encoding encoding, bool is_mutable, bool own)
+	{
+		reset();
+
+		// check input buffer
+		assert(contents || size == 0);
+
+		// get actual encoding
+		xml_encoding buffer_encoding = impl::get_buffer_encoding(encoding, contents, size);
+
+		// get private buffer
+		char_t* buffer = 0;
+		size_t length = 0;
+
+		if (!impl::convert_buffer(buffer, length, buffer_encoding, contents, size, is_mutable)) return impl::make_parse_result(status_out_of_memory);
+		
+		// delete original buffer if we performed a conversion
+		if (own && buffer != contents && contents) impl::xml_memory::deallocate(contents);
+
+		// parse
+		xml_parse_result res = impl::xml_parser::parse(buffer, length, _root, options);
+
+		// remember encoding
+		res.encoding = buffer_encoding;
+
+		// grab onto buffer if it's our buffer, user is responsible for deallocating contens himself
+		if (own || buffer != contents) _buffer = buffer;
+
+		return res;
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_buffer(const void* contents, size_t size, unsigned int options, xml_encoding encoding)
+	{
+		return load_buffer_impl(const_cast<void*>(contents), size, options, encoding, false, false);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_buffer_inplace(void* contents, size_t size, unsigned int options, xml_encoding encoding)
+	{
+		return load_buffer_impl(contents, size, options, encoding, true, false);
+	}
+		
+	PUGI__FN xml_parse_result xml_document::load_buffer_inplace_own(void* contents, size_t size, unsigned int options, xml_encoding encoding)
+	{
+		return load_buffer_impl(contents, size, options, encoding, true, true);
+	}
+
+	PUGI__FN void xml_document::save(xml_writer& writer, const char_t* indent, unsigned int flags, xml_encoding encoding) const
+	{
+		impl::xml_buffered_writer buffered_writer(writer, encoding);
+
+		if ((flags & format_write_bom) && encoding != encoding_latin1)
+		{
+			// BOM always represents the codepoint U+FEFF, so just write it in native encoding
+		#ifdef PUGIXML_WCHAR_MODE
+			unsigned int bom = 0xfeff;
+			buffered_writer.write(static_cast<wchar_t>(bom));
+		#else
+			buffered_writer.write('\xef', '\xbb', '\xbf');
+		#endif
+		}
+
+		if (!(flags & format_no_declaration) && !impl::has_declaration(*this))
+		{
+			buffered_writer.write(PUGIXML_TEXT("<?xml version=\"1.0\""));
+			if (encoding == encoding_latin1) buffered_writer.write(PUGIXML_TEXT(" encoding=\"ISO-8859-1\""));
+			buffered_writer.write('?', '>');
+			if (!(flags & format_raw)) buffered_writer.write('\n');
+		}
+
+		impl::node_output(buffered_writer, *this, indent, flags, 0);
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN void xml_document::save(std::basic_ostream<char, std::char_traits<char> >& stream, const char_t* indent, unsigned int flags, xml_encoding encoding) const
+	{
+		xml_writer_stream writer(stream);
+
+		save(writer, indent, flags, encoding);
+	}
+
+	PUGI__FN void xml_document::save(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream, const char_t* indent, unsigned int flags) const
+	{
+		xml_writer_stream writer(stream);
+
+		save(writer, indent, flags, encoding_wchar);
+	}
+#endif
+
+	PUGI__FN bool xml_document::save_file(const char* path_, const char_t* indent, unsigned int flags, xml_encoding encoding) const
+	{
+		FILE* file = fopen(path_, (flags & format_save_file_text) ? "w" : "wb");
+		return impl::save_file_impl(*this, file, indent, flags, encoding);
+	}
+
+	PUGI__FN bool xml_document::save_file(const wchar_t* path_, const char_t* indent, unsigned int flags, xml_encoding encoding) const
+	{
+		FILE* file = impl::open_file_wide(path_, (flags & format_save_file_text) ? L"w" : L"wb");
+		return impl::save_file_impl(*this, file, indent, flags, encoding);
+	}
+
+	PUGI__FN xml_node xml_document::document_element() const
+	{
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			if ((i->header & impl::xml_memory_page_type_mask) + 1 == node_element)
+				return xml_node(i);
+
+		return xml_node();
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN std::string PUGIXML_FUNCTION as_utf8(const wchar_t* str)
+	{
+		assert(str);
+
+		return impl::as_utf8_impl(str, wcslen(str));
+	}
+
+	PUGI__FN std::string PUGIXML_FUNCTION as_utf8(const std::basic_string<wchar_t>& str)
+	{
+		return impl::as_utf8_impl(str.c_str(), str.size());
+	}
+	
+	PUGI__FN std::basic_string<wchar_t> PUGIXML_FUNCTION as_wide(const char* str)
+	{
+		assert(str);
+
+		return impl::as_wide_impl(str, strlen(str));
+	}
+	
+	PUGI__FN std::basic_string<wchar_t> PUGIXML_FUNCTION as_wide(const std::string& str)
+	{
+		return impl::as_wide_impl(str.c_str(), str.size());
+	}
+#endif
+
+	PUGI__FN void PUGIXML_FUNCTION set_memory_management_functions(allocation_function allocate, deallocation_function deallocate)
+	{
+		impl::xml_memory::allocate = allocate;
+		impl::xml_memory::deallocate = deallocate;
+	}
+
+	PUGI__FN allocation_function PUGIXML_FUNCTION get_memory_allocation_function()
+	{
+		return impl::xml_memory::allocate;
+	}
+
+	PUGI__FN deallocation_function PUGIXML_FUNCTION get_memory_deallocation_function()
+	{
+		return impl::xml_memory::deallocate;
+	}
+}
+
+#if !defined(PUGIXML_NO_STL) && (defined(_MSC_VER) || defined(__ICC))
+namespace std
+{
+	// Workarounds for (non-standard) iterator category detection for older versions (MSVC7/IC8 and earlier)
+	PUGI__FN std::bidirectional_iterator_tag _Iter_cat(const pugi::xml_node_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+
+	PUGI__FN std::bidirectional_iterator_tag _Iter_cat(const pugi::xml_attribute_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+
+	PUGI__FN std::forward_iterator_tag _Iter_cat(const pugi::xml_named_node_iterator&)
+	{
+		return std::forward_iterator_tag();
+	}
+}
+#endif
+
+#if !defined(PUGIXML_NO_STL) && defined(__SUNPRO_CC)
+namespace std
+{
+	// Workarounds for (non-standard) iterator category detection
+	PUGI__FN std::bidirectional_iterator_tag __iterator_category(const pugi::xml_node_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+
+	PUGI__FN std::bidirectional_iterator_tag __iterator_category(const pugi::xml_attribute_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+
+	PUGI__FN std::forward_iterator_tag __iterator_category(const pugi::xml_named_node_iterator&)
+	{
+		return std::forward_iterator_tag();
+	}
+}
+#endif
+
+#ifndef PUGIXML_NO_XPATH
+
+// STL replacements
+PUGI__NS_BEGIN
+	struct equal_to
+	{
+		template <typename T> bool operator()(const T& lhs, const T& rhs) const
+		{
+			return lhs == rhs;
+		}
+	};
+
+	struct not_equal_to
+	{
+		template <typename T> bool operator()(const T& lhs, const T& rhs) const
+		{
+			return lhs != rhs;
+		}
+	};
+
+	struct less
+	{
+		template <typename T> bool operator()(const T& lhs, const T& rhs) const
+		{
+			return lhs < rhs;
+		}
+	};
+
+	struct less_equal
+	{
+		template <typename T> bool operator()(const T& lhs, const T& rhs) const
+		{
+			return lhs <= rhs;
+		}
+	};
+
+	template <typename T> void swap(T& lhs, T& rhs)
+	{
+		T temp = lhs;
+		lhs = rhs;
+		rhs = temp;
+	}
+
+	template <typename I, typename Pred> I min_element(I begin, I end, const Pred& pred)
+	{
+		I result = begin;
+
+		for (I it = begin + 1; it != end; ++it)
+			if (pred(*it, *result))
+				result = it;
+
+		return result;
+	}
+
+	template <typename I> void reverse(I begin, I end)
+	{
+		while (begin + 1 < end) swap(*begin++, *--end);
+	}
+
+	template <typename I> I unique(I begin, I end)
+	{
+		// fast skip head
+		while (begin + 1 < end && *begin != *(begin + 1)) begin++;
+
+		if (begin == end) return begin;
+
+		// last written element
+		I write = begin++; 
+
+		// merge unique elements
+		while (begin != end)
+		{
+			if (*begin != *write)
+				*++write = *begin++;
+			else
+				begin++;
+		}
+
+		// past-the-end (write points to live element)
+		return write + 1;
+	}
+
+	template <typename I> void copy_backwards(I begin, I end, I target)
+	{
+		while (begin != end) *--target = *--end;
+	}
+
+	template <typename I, typename Pred, typename T> void insertion_sort(I begin, I end, const Pred& pred, T*)
+	{
+		assert(begin != end);
+
+		for (I it = begin + 1; it != end; ++it)
+		{
+			T val = *it;
+
+			if (pred(val, *begin))
+			{
+				// move to front
+				copy_backwards(begin, it, it + 1);
+				*begin = val;
+			}
+			else
+			{
+				I hole = it;
+
+				// move hole backwards
+				while (pred(val, *(hole - 1)))
+				{
+					*hole = *(hole - 1);
+					hole--;
+				}
+
+				// fill hole with element
+				*hole = val;
+			}
+		}
+	}
+
+	// std variant for elements with ==
+	template <typename I, typename Pred> void partition(I begin, I middle, I end, const Pred& pred, I* out_eqbeg, I* out_eqend)
+	{
+		I eqbeg = middle, eqend = middle + 1;
+
+		// expand equal range
+		while (eqbeg != begin && *(eqbeg - 1) == *eqbeg) --eqbeg;
+		while (eqend != end && *eqend == *eqbeg) ++eqend;
+
+		// process outer elements
+		I ltend = eqbeg, gtbeg = eqend;
+
+		for (;;)
+		{
+			// find the element from the right side that belongs to the left one
+			for (; gtbeg != end; ++gtbeg)
+				if (!pred(*eqbeg, *gtbeg))
+				{
+					if (*gtbeg == *eqbeg) swap(*gtbeg, *eqend++);
+					else break;
+				}
+
+			// find the element from the left side that belongs to the right one
+			for (; ltend != begin; --ltend)
+				if (!pred(*(ltend - 1), *eqbeg))
+				{
+					if (*eqbeg == *(ltend - 1)) swap(*(ltend - 1), *--eqbeg);
+					else break;
+				}
+
+			// scanned all elements
+			if (gtbeg == end && ltend == begin)
+			{
+				*out_eqbeg = eqbeg;
+				*out_eqend = eqend;
+				return;
+			}
+
+			// make room for elements by moving equal area
+			if (gtbeg == end)
+			{
+				if (--ltend != --eqbeg) swap(*ltend, *eqbeg);
+				swap(*eqbeg, *--eqend);
+			}
+			else if (ltend == begin)
+			{
+				if (eqend != gtbeg) swap(*eqbeg, *eqend);
+				++eqend;
+				swap(*gtbeg++, *eqbeg++);
+			}
+			else swap(*gtbeg++, *--ltend);
+		}
+	}
+
+	template <typename I, typename Pred> void median3(I first, I middle, I last, const Pred& pred)
+	{
+		if (pred(*middle, *first)) swap(*middle, *first);
+		if (pred(*last, *middle)) swap(*last, *middle);
+		if (pred(*middle, *first)) swap(*middle, *first);
+	}
+
+	template <typename I, typename Pred> void median(I first, I middle, I last, const Pred& pred)
+	{
+		if (last - first <= 40)
+		{
+			// median of three for small chunks
+			median3(first, middle, last, pred);
+		}
+		else
+		{
+			// median of nine
+			size_t step = (last - first + 1) / 8;
+
+			median3(first, first + step, first + 2 * step, pred);
+			median3(middle - step, middle, middle + step, pred);
+			median3(last - 2 * step, last - step, last, pred);
+			median3(first + step, middle, last - step, pred);
+		}
+	}
+
+	template <typename I, typename Pred> void sort(I begin, I end, const Pred& pred)
+	{
+		// sort large chunks
+		while (end - begin > 32)
+		{
+			// find median element
+			I middle = begin + (end - begin) / 2;
+			median(begin, middle, end - 1, pred);
+
+			// partition in three chunks (< = >)
+			I eqbeg, eqend;
+			partition(begin, middle, end, pred, &eqbeg, &eqend);
+
+			// loop on larger half
+			if (eqbeg - begin > end - eqend)
+			{
+				sort(eqend, end, pred);
+				end = eqbeg;
+			}
+			else
+			{
+				sort(begin, eqbeg, pred);
+				begin = eqend;
+			}
+		}
+
+		// insertion sort small chunk
+		if (begin != end) insertion_sort(begin, end, pred, &*begin);
+	}
+PUGI__NS_END
+
+// Allocator used for AST and evaluation stacks
+PUGI__NS_BEGIN
+	struct xpath_memory_block
+	{	
+		xpath_memory_block* next;
+
+		char data[
+	#ifdef PUGIXML_MEMORY_XPATH_PAGE_SIZE
+			PUGIXML_MEMORY_XPATH_PAGE_SIZE
+	#else
+			4096
+	#endif
+		];
+	};
+		
+	class xpath_allocator
+	{
+		xpath_memory_block* _root;
+		size_t _root_size;
+
+	public:
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		jmp_buf* error_handler;
+	#endif
+
+		xpath_allocator(xpath_memory_block* root, size_t root_size = 0): _root(root), _root_size(root_size)
+		{
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			error_handler = 0;
+		#endif
+		}
+		
+		void* allocate_nothrow(size_t size)
+		{
+			const size_t block_capacity = sizeof(_root->data);
+
+			// align size so that we're able to store pointers in subsequent blocks
+			size = (size + sizeof(void*) - 1) & ~(sizeof(void*) - 1);
+
+			if (_root_size + size <= block_capacity)
+			{
+				void* buf = _root->data + _root_size;
+				_root_size += size;
+				return buf;
+			}
+			else
+			{
+				size_t block_data_size = (size > block_capacity) ? size : block_capacity;
+				size_t block_size = block_data_size + offsetof(xpath_memory_block, data);
+
+				xpath_memory_block* block = static_cast<xpath_memory_block*>(xml_memory::allocate(block_size));
+				if (!block) return 0;
+				
+				block->next = _root;
+				
+				_root = block;
+				_root_size = size;
+				
+				return block->data;
+			}
+		}
+
+		void* allocate(size_t size)
+		{
+			void* result = allocate_nothrow(size);
+
+			if (!result)
+			{
+			#ifdef PUGIXML_NO_EXCEPTIONS
+				assert(error_handler);
+				longjmp(*error_handler, 1);
+			#else
+				throw std::bad_alloc();
+			#endif
+			}
+
+			return result;
+		}
+
+		void* reallocate(void* ptr, size_t old_size, size_t new_size)
+		{
+			// align size so that we're able to store pointers in subsequent blocks
+			old_size = (old_size + sizeof(void*) - 1) & ~(sizeof(void*) - 1);
+			new_size = (new_size + sizeof(void*) - 1) & ~(sizeof(void*) - 1);
+
+			// we can only reallocate the last object
+			assert(ptr == 0 || static_cast<char*>(ptr) + old_size == _root->data + _root_size);
+
+			// adjust root size so that we have not allocated the object at all
+			bool only_object = (_root_size == old_size);
+
+			if (ptr) _root_size -= old_size;
+
+			// allocate a new version (this will obviously reuse the memory if possible)
+			void* result = allocate(new_size);
+			assert(result);
+
+			// we have a new block
+			if (result != ptr && ptr)
+			{
+				// copy old data
+				assert(new_size > old_size);
+				memcpy(result, ptr, old_size);
+
+				// free the previous page if it had no other objects
+				if (only_object)
+				{
+					assert(_root->data == result);
+					assert(_root->next);
+
+					xpath_memory_block* next = _root->next->next;
+
+					if (next)
+					{
+						// deallocate the whole page, unless it was the first one
+						xml_memory::deallocate(_root->next);
+						_root->next = next;
+					}
+				}
+			}
+
+			return result;
+		}
+
+		void revert(const xpath_allocator& state)
+		{
+			// free all new pages
+			xpath_memory_block* cur = _root;
+
+			while (cur != state._root)
+			{
+				xpath_memory_block* next = cur->next;
+
+				xml_memory::deallocate(cur);
+
+				cur = next;
+			}
+
+			// restore state
+			_root = state._root;
+			_root_size = state._root_size;
+		}
+
+		void release()
+		{
+			xpath_memory_block* cur = _root;
+			assert(cur);
+
+			while (cur->next)
+			{
+				xpath_memory_block* next = cur->next;
+
+				xml_memory::deallocate(cur);
+
+				cur = next;
+			}
+		}
+	};
+
+	struct xpath_allocator_capture
+	{
+		xpath_allocator_capture(xpath_allocator* alloc): _target(alloc), _state(*alloc)
+		{
+		}
+
+		~xpath_allocator_capture()
+		{
+			_target->revert(_state);
+		}
+
+		xpath_allocator* _target;
+		xpath_allocator _state;
+	};
+
+	struct xpath_stack
+	{
+		xpath_allocator* result;
+		xpath_allocator* temp;
+	};
+
+	struct xpath_stack_data
+	{
+		xpath_memory_block blocks[2];
+		xpath_allocator result;
+		xpath_allocator temp;
+		xpath_stack stack;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		jmp_buf error_handler;
+	#endif
+
+		xpath_stack_data(): result(blocks + 0), temp(blocks + 1)
+		{
+			blocks[0].next = blocks[1].next = 0;
+
+			stack.result = &result;
+			stack.temp = &temp;
+
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			result.error_handler = temp.error_handler = &error_handler;
+		#endif
+		}
+
+		~xpath_stack_data()
+		{
+			result.release();
+			temp.release();
+		}
+	};
+PUGI__NS_END
+
+// String class
+PUGI__NS_BEGIN
+	class xpath_string
+	{
+		const char_t* _buffer;
+		bool _uses_heap;
+
+		static char_t* duplicate_string(const char_t* string, size_t length, xpath_allocator* alloc)
+		{
+			char_t* result = static_cast<char_t*>(alloc->allocate((length + 1) * sizeof(char_t)));
+			assert(result);
+
+			memcpy(result, string, length * sizeof(char_t));
+			result[length] = 0;
+
+			return result;
+		}
+
+		static char_t* duplicate_string(const char_t* string, xpath_allocator* alloc)
+		{
+			return duplicate_string(string, strlength(string), alloc);
+		}
+
+	public:
+		xpath_string(): _buffer(PUGIXML_TEXT("")), _uses_heap(false)
+		{
+		}
+
+		explicit xpath_string(const char_t* str, xpath_allocator* alloc)
+		{
+			bool empty_ = (*str == 0);
+
+			_buffer = empty_ ? PUGIXML_TEXT("") : duplicate_string(str, alloc);
+			_uses_heap = !empty_;
+		}
+
+		explicit xpath_string(const char_t* str, bool use_heap): _buffer(str), _uses_heap(use_heap)
+		{
+		}
+
+		xpath_string(const char_t* begin, const char_t* end, xpath_allocator* alloc)
+		{
+			assert(begin <= end);
+
+			bool empty_ = (begin == end);
+
+			_buffer = empty_ ? PUGIXML_TEXT("") : duplicate_string(begin, static_cast<size_t>(end - begin), alloc);
+			_uses_heap = !empty_;
+		}
+
+		void append(const xpath_string& o, xpath_allocator* alloc)
+		{
+			// skip empty sources
+			if (!*o._buffer) return;
+
+			// fast append for constant empty target and constant source
+			if (!*_buffer && !_uses_heap && !o._uses_heap)
+			{
+				_buffer = o._buffer;
+			}
+			else
+			{
+				// need to make heap copy
+				size_t target_length = strlength(_buffer);
+				size_t source_length = strlength(o._buffer);
+				size_t result_length = target_length + source_length;
+
+				// allocate new buffer
+				char_t* result = static_cast<char_t*>(alloc->reallocate(_uses_heap ? const_cast<char_t*>(_buffer) : 0, (target_length + 1) * sizeof(char_t), (result_length + 1) * sizeof(char_t)));
+				assert(result);
+
+				// append first string to the new buffer in case there was no reallocation
+				if (!_uses_heap) memcpy(result, _buffer, target_length * sizeof(char_t));
+
+				// append second string to the new buffer
+				memcpy(result + target_length, o._buffer, source_length * sizeof(char_t));
+				result[result_length] = 0;
+
+				// finalize
+				_buffer = result;
+				_uses_heap = true;
+			}
+		}
+
+		const char_t* c_str() const
+		{
+			return _buffer;
+		}
+
+		size_t length() const
+		{
+			return strlength(_buffer);
+		}
+		
+		char_t* data(xpath_allocator* alloc)
+		{
+			// make private heap copy
+			if (!_uses_heap)
+			{
+				_buffer = duplicate_string(_buffer, alloc);
+				_uses_heap = true;
+			}
+
+			return const_cast<char_t*>(_buffer);
+		}
+
+		bool empty() const
+		{
+			return *_buffer == 0;
+		}
+
+		bool operator==(const xpath_string& o) const
+		{
+			return strequal(_buffer, o._buffer);
+		}
+
+		bool operator!=(const xpath_string& o) const
+		{
+			return !strequal(_buffer, o._buffer);
+		}
+
+		bool uses_heap() const
+		{
+			return _uses_heap;
+		}
+	};
+
+	PUGI__FN xpath_string xpath_string_const(const char_t* str)
+	{
+		return xpath_string(str, false);
+	}
+PUGI__NS_END
+
+PUGI__NS_BEGIN
+	PUGI__FN bool starts_with(const char_t* string, const char_t* pattern)
+	{
+		while (*pattern && *string == *pattern)
+		{
+			string++;
+			pattern++;
+		}
+
+		return *pattern == 0;
+	}
+
+	PUGI__FN const char_t* find_char(const char_t* s, char_t c)
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcschr(s, c);
+	#else
+		return strchr(s, c);
+	#endif
+	}
+
+	PUGI__FN const char_t* find_substring(const char_t* s, const char_t* p)
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		// MSVC6 wcsstr bug workaround (if s is empty it always returns 0)
+		return (*p == 0) ? s : wcsstr(s, p);
+	#else
+		return strstr(s, p);
+	#endif
+	}
+
+	// Converts symbol to lower case, if it is an ASCII one
+	PUGI__FN char_t tolower_ascii(char_t ch)
+	{
+		return static_cast<unsigned int>(ch - 'A') < 26 ? static_cast<char_t>(ch | ' ') : ch;
+	}
+
+	PUGI__FN xpath_string string_value(const xpath_node& na, xpath_allocator* alloc)
+	{
+		if (na.attribute())
+			return xpath_string_const(na.attribute().value());
+		else
+		{
+			const xml_node& n = na.node();
+
+			switch (n.type())
+			{
+			case node_pcdata:
+			case node_cdata:
+			case node_comment:
+			case node_pi:
+				return xpath_string_const(n.value());
+			
+			case node_document:
+			case node_element:
+			{
+				xpath_string result;
+
+				xml_node cur = n.first_child();
+				
+				while (cur && cur != n)
+				{
+					if (cur.type() == node_pcdata || cur.type() == node_cdata)
+						result.append(xpath_string_const(cur.value()), alloc);
+
+					if (cur.first_child())
+						cur = cur.first_child();
+					else if (cur.next_sibling())
+						cur = cur.next_sibling();
+					else
+					{
+						while (!cur.next_sibling() && cur != n)
+							cur = cur.parent();
+
+						if (cur != n) cur = cur.next_sibling();
+					}
+				}
+				
+				return result;
+			}
+			
+			default:
+				return xpath_string();
+			}
+		}
+	}
+	
+	PUGI__FN unsigned int node_height(xml_node n)
+	{
+		unsigned int result = 0;
+		
+		while (n)
+		{
+			++result;
+			n = n.parent();
+		}
+		
+		return result;
+	}
+	
+	PUGI__FN bool node_is_before(xml_node ln, unsigned int lh, xml_node rn, unsigned int rh)
+	{
+		// normalize heights
+		for (unsigned int i = rh; i < lh; i++) ln = ln.parent();
+		for (unsigned int j = lh; j < rh; j++) rn = rn.parent();
+		
+		// one node is the ancestor of the other
+		if (ln == rn) return lh < rh;
+		
+		// find common ancestor
+		while (ln.parent() != rn.parent())
+		{
+			ln = ln.parent();
+			rn = rn.parent();
+		}
+
+		// there is no common ancestor (the shared parent is null), nodes are from different documents
+		if (!ln.parent()) return ln < rn;
+
+		// determine sibling order
+		for (; ln; ln = ln.next_sibling())
+			if (ln == rn)
+				return true;
+				
+		return false;
+	}
+
+	PUGI__FN bool node_is_ancestor(xml_node parent, xml_node node)
+	{
+		while (node && node != parent) node = node.parent();
+
+		return parent && node == parent;
+	}
+
+	PUGI__FN const void* document_order(const xpath_node& xnode)
+	{
+		xml_node_struct* node = xnode.node().internal_object();
+
+		if (node)
+		{
+			if (node->name && (node->header & xml_memory_page_name_allocated_mask) == 0) return node->name;
+			if (node->value && (node->header & xml_memory_page_value_allocated_mask) == 0) return node->value;
+			return 0;
+		}
+
+		xml_attribute_struct* attr = xnode.attribute().internal_object();
+
+		if (attr)
+		{
+			if ((attr->header & xml_memory_page_name_allocated_mask) == 0) return attr->name;
+			if ((attr->header & xml_memory_page_value_allocated_mask) == 0) return attr->value;
+			return 0;
+		}
+
+		return 0;
+	}
+	
+	struct document_order_comparator
+	{
+		bool operator()(const xpath_node& lhs, const xpath_node& rhs) const
+		{
+			// optimized document order based check
+			const void* lo = document_order(lhs);
+			const void* ro = document_order(rhs);
+
+			if (lo && ro) return lo < ro;
+
+			// slow comparison
+			xml_node ln = lhs.node(), rn = rhs.node();
+
+			// compare attributes
+			if (lhs.attribute() && rhs.attribute())
+			{
+				// shared parent
+				if (lhs.parent() == rhs.parent())
+				{
+					// determine sibling order
+					for (xml_attribute a = lhs.attribute(); a; a = a.next_attribute())
+						if (a == rhs.attribute())
+							return true;
+					
+					return false;
+				}
+				
+				// compare attribute parents
+				ln = lhs.parent();
+				rn = rhs.parent();
+			}
+			else if (lhs.attribute())
+			{
+				// attributes go after the parent element
+				if (lhs.parent() == rhs.node()) return false;
+				
+				ln = lhs.parent();
+			}
+			else if (rhs.attribute())
+			{
+				// attributes go after the parent element
+				if (rhs.parent() == lhs.node()) return true;
+				
+				rn = rhs.parent();
+			}
+
+			if (ln == rn) return false;
+			
+			unsigned int lh = node_height(ln);
+			unsigned int rh = node_height(rn);
+			
+			return node_is_before(ln, lh, rn, rh);
+		}
+	};
+
+	struct duplicate_comparator
+	{
+		bool operator()(const xpath_node& lhs, const xpath_node& rhs) const
+		{
+			if (lhs.attribute()) return rhs.attribute() ? lhs.attribute() < rhs.attribute() : true;
+			else return rhs.attribute() ? false : lhs.node() < rhs.node();
+		}
+	};
+	
+	PUGI__FN double gen_nan()
+	{
+	#if defined(__STDC_IEC_559__) || ((FLT_RADIX - 0 == 2) && (FLT_MAX_EXP - 0 == 128) && (FLT_MANT_DIG - 0 == 24))
+		union { float f; uint32_t i; } u[sizeof(float) == sizeof(uint32_t) ? 1 : -1];
+		u[0].i = 0x7fc00000;
+		return u[0].f;
+	#else
+		// fallback
+		const volatile double zero = 0.0;
+		return zero / zero;
+	#endif
+	}
+	
+	PUGI__FN bool is_nan(double value)
+	{
+	#if defined(PUGI__MSVC_CRT_VERSION) || defined(__BORLANDC__)
+		return !!_isnan(value);
+	#elif defined(fpclassify) && defined(FP_NAN)
+		return fpclassify(value) == FP_NAN;
+	#else
+		// fallback
+		const volatile double v = value;
+		return v != v;
+	#endif
+	}
+	
+	PUGI__FN const char_t* convert_number_to_string_special(double value)
+	{
+	#if defined(PUGI__MSVC_CRT_VERSION) || defined(__BORLANDC__)
+		if (_finite(value)) return (value == 0) ? PUGIXML_TEXT("0") : 0;
+		if (_isnan(value)) return PUGIXML_TEXT("NaN");
+		return value > 0 ? PUGIXML_TEXT("Infinity") : PUGIXML_TEXT("-Infinity");
+	#elif defined(fpclassify) && defined(FP_NAN) && defined(FP_INFINITE) && defined(FP_ZERO)
+		switch (fpclassify(value))
+		{
+		case FP_NAN:
+			return PUGIXML_TEXT("NaN");
+
+		case FP_INFINITE:
+			return value > 0 ? PUGIXML_TEXT("Infinity") : PUGIXML_TEXT("-Infinity");
+
+		case FP_ZERO:
+			return PUGIXML_TEXT("0");
+
+		default:
+			return 0;
+		}
+	#else
+		// fallback
+		const volatile double v = value;
+
+		if (v == 0) return PUGIXML_TEXT("0");
+		if (v != v) return PUGIXML_TEXT("NaN");
+		if (v * 2 == v) return value > 0 ? PUGIXML_TEXT("Infinity") : PUGIXML_TEXT("-Infinity");
+		return 0;
+	#endif
+	}
+	
+	PUGI__FN bool convert_number_to_boolean(double value)
+	{
+		return (value != 0 && !is_nan(value));
+	}
+	
+	PUGI__FN void truncate_zeros(char* begin, char* end)
+	{
+		while (begin != end && end[-1] == '0') end--;
+
+		*end = 0;
+	}
+
+	// gets mantissa digits in the form of 0.xxxxx with 0. implied and the exponent
+#if defined(PUGI__MSVC_CRT_VERSION) && PUGI__MSVC_CRT_VERSION >= 1400 && !defined(_WIN32_WCE)
+	PUGI__FN void convert_number_to_mantissa_exponent(double value, char* buffer, size_t buffer_size, char** out_mantissa, int* out_exponent)
+	{
+		// get base values
+		int sign, exponent;
+		_ecvt_s(buffer, buffer_size, value, DBL_DIG + 1, &exponent, &sign);
+
+		// truncate redundant zeros
+		truncate_zeros(buffer, buffer + strlen(buffer));
+
+		// fill results
+		*out_mantissa = buffer;
+		*out_exponent = exponent;
+	}
+#else
+	PUGI__FN void convert_number_to_mantissa_exponent(double value, char* buffer, size_t buffer_size, char** out_mantissa, int* out_exponent)
+	{
+		// get a scientific notation value with IEEE DBL_DIG decimals
+		sprintf(buffer, "%.*e", DBL_DIG, value);
+		assert(strlen(buffer) < buffer_size);
+		(void)!buffer_size;
+
+		// get the exponent (possibly negative)
+		char* exponent_string = strchr(buffer, 'e');
+		assert(exponent_string);
+
+		int exponent = atoi(exponent_string + 1);
+
+		// extract mantissa string: skip sign
+		char* mantissa = buffer[0] == '-' ? buffer + 1 : buffer;
+		assert(mantissa[0] != '0' && mantissa[1] == '.');
+
+		// divide mantissa by 10 to eliminate integer part
+		mantissa[1] = mantissa[0];
+		mantissa++;
+		exponent++;
+
+		// remove extra mantissa digits and zero-terminate mantissa
+		truncate_zeros(mantissa, exponent_string);
+
+		// fill results
+		*out_mantissa = mantissa;
+		*out_exponent = exponent;
+	}
+#endif
+
+	PUGI__FN xpath_string convert_number_to_string(double value, xpath_allocator* alloc)
+	{
+		// try special number conversion
+		const char_t* special = convert_number_to_string_special(value);
+		if (special) return xpath_string_const(special);
+
+		// get mantissa + exponent form
+		char mantissa_buffer[64];
+
+		char* mantissa;
+		int exponent;
+		convert_number_to_mantissa_exponent(value, mantissa_buffer, sizeof(mantissa_buffer), &mantissa, &exponent);
+
+		// make the number!
+		char_t result[512];
+		char_t* s = result;
+
+		// sign
+		if (value < 0) *s++ = '-';
+
+		// integer part
+		if (exponent <= 0)
+		{
+			*s++ = '0';
+		}
+		else
+		{
+			while (exponent > 0)
+			{
+				assert(*mantissa == 0 || static_cast<unsigned int>(*mantissa - '0') <= 9);
+				*s++ = *mantissa ? *mantissa++ : '0';
+				exponent--;
+			}
+		}
+
+		// fractional part
+		if (*mantissa)
+		{
+			// decimal point
+			*s++ = '.';
+
+			// extra zeroes from negative exponent
+			while (exponent < 0)
+			{
+				*s++ = '0';
+				exponent++;
+			}
+
+			// extra mantissa digits
+			while (*mantissa)
+			{
+				assert(static_cast<unsigned int>(*mantissa - '0') <= 9);
+				*s++ = *mantissa++;
+			}
+		}
+
+		// zero-terminate
+		assert(s < result + sizeof(result) / sizeof(result[0]));
+		*s = 0;
+
+		return xpath_string(result, alloc);
+	}
+	
+	PUGI__FN bool check_string_to_number_format(const char_t* string)
+	{
+		// parse leading whitespace
+		while (PUGI__IS_CHARTYPE(*string, ct_space)) ++string;
+
+		// parse sign
+		if (*string == '-') ++string;
+
+		if (!*string) return false;
+
+		// if there is no integer part, there should be a decimal part with at least one digit
+		if (!PUGI__IS_CHARTYPEX(string[0], ctx_digit) && (string[0] != '.' || !PUGI__IS_CHARTYPEX(string[1], ctx_digit))) return false;
+
+		// parse integer part
+		while (PUGI__IS_CHARTYPEX(*string, ctx_digit)) ++string;
+
+		// parse decimal part
+		if (*string == '.')
+		{
+			++string;
+
+			while (PUGI__IS_CHARTYPEX(*string, ctx_digit)) ++string;
+		}
+
+		// parse trailing whitespace
+		while (PUGI__IS_CHARTYPE(*string, ct_space)) ++string;
+
+		return *string == 0;
+	}
+
+	PUGI__FN double convert_string_to_number(const char_t* string)
+	{
+		// check string format
+		if (!check_string_to_number_format(string)) return gen_nan();
+
+		// parse string
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcstod(string, 0);
+	#else
+		return atof(string);
+	#endif
+	}
+
+	PUGI__FN bool convert_string_to_number(const char_t* begin, const char_t* end, double* out_result)
+	{
+		char_t buffer[32];
+
+		size_t length = static_cast<size_t>(end - begin);
+		char_t* scratch = buffer;
+
+		if (length >= sizeof(buffer) / sizeof(buffer[0]))
+		{
+			// need to make dummy on-heap copy
+			scratch = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+			if (!scratch) return false;
+		}
+
+		// copy string to zero-terminated buffer and perform conversion
+		memcpy(scratch, begin, length * sizeof(char_t));
+		scratch[length] = 0;
+
+		*out_result = convert_string_to_number(scratch);
+
+		// free dummy buffer
+		if (scratch != buffer) xml_memory::deallocate(scratch);
+
+		return true;
+	}
+	
+	PUGI__FN double round_nearest(double value)
+	{
+		return floor(value + 0.5);
+	}
+
+	PUGI__FN double round_nearest_nzero(double value)
+	{
+		// same as round_nearest, but returns -0 for [-0.5, -0]
+		// ceil is used to differentiate between +0 and -0 (we return -0 for [-0.5, -0] and +0 for +0)
+		return (value >= -0.5 && value <= 0) ? ceil(value) : floor(value + 0.5);
+	}
+	
+	PUGI__FN const char_t* qualified_name(const xpath_node& node)
+	{
+		return node.attribute() ? node.attribute().name() : node.node().name();
+	}
+	
+	PUGI__FN const char_t* local_name(const xpath_node& node)
+	{
+		const char_t* name = qualified_name(node);
+		const char_t* p = find_char(name, ':');
+		
+		return p ? p + 1 : name;
+	}
+
+	struct namespace_uri_predicate
+	{
+		const char_t* prefix;
+		size_t prefix_length;
+
+		namespace_uri_predicate(const char_t* name)
+		{
+			const char_t* pos = find_char(name, ':');
+
+			prefix = pos ? name : 0;
+			prefix_length = pos ? static_cast<size_t>(pos - name) : 0;
+		}
+
+		bool operator()(const xml_attribute& a) const
+		{
+			const char_t* name = a.name();
+
+			if (!starts_with(name, PUGIXML_TEXT("xmlns"))) return false;
+
+			return prefix ? name[5] == ':' && strequalrange(name + 6, prefix, prefix_length) : name[5] == 0;
+		}
+	};
+
+	PUGI__FN const char_t* namespace_uri(const xml_node& node)
+	{
+		namespace_uri_predicate pred = node.name();
+		
+		xml_node p = node;
+		
+		while (p)
+		{
+			xml_attribute a = p.find_attribute(pred);
+			
+			if (a) return a.value();
+			
+			p = p.parent();
+		}
+		
+		return PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* namespace_uri(const xml_attribute& attr, const xml_node& parent)
+	{
+		namespace_uri_predicate pred = attr.name();
+		
+		// Default namespace does not apply to attributes
+		if (!pred.prefix) return PUGIXML_TEXT("");
+		
+		xml_node p = parent;
+		
+		while (p)
+		{
+			xml_attribute a = p.find_attribute(pred);
+			
+			if (a) return a.value();
+			
+			p = p.parent();
+		}
+		
+		return PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* namespace_uri(const xpath_node& node)
+	{
+		return node.attribute() ? namespace_uri(node.attribute(), node.parent()) : namespace_uri(node.node());
+	}
+
+	PUGI__FN void normalize_space(char_t* buffer)
+	{
+		char_t* write = buffer;
+
+		for (char_t* it = buffer; *it; )
+		{
+			char_t ch = *it++;
+
+			if (PUGI__IS_CHARTYPE(ch, ct_space))
+			{
+				// replace whitespace sequence with single space
+				while (PUGI__IS_CHARTYPE(*it, ct_space)) it++;
+
+				// avoid leading spaces
+				if (write != buffer) *write++ = ' ';
+			}
+			else *write++ = ch;
+		}
+
+		// remove trailing space
+		if (write != buffer && PUGI__IS_CHARTYPE(write[-1], ct_space)) write--;
+
+		// zero-terminate
+		*write = 0;
+	}
+
+	PUGI__FN void translate(char_t* buffer, const char_t* from, const char_t* to)
+	{
+		size_t to_length = strlength(to);
+
+		char_t* write = buffer;
+
+		while (*buffer)
+		{
+			PUGI__DMC_VOLATILE char_t ch = *buffer++;
+
+			const char_t* pos = find_char(from, ch);
+
+			if (!pos)
+				*write++ = ch; // do not process
+			else if (static_cast<size_t>(pos - from) < to_length)
+				*write++ = to[pos - from]; // replace
+		}
+
+		// zero-terminate
+		*write = 0;
+	}
+
+	struct xpath_variable_boolean: xpath_variable
+	{
+		xpath_variable_boolean(): value(false)
+		{
+		}
+
+		bool value;
+		char_t name[1];
+	};
+
+	struct xpath_variable_number: xpath_variable
+	{
+		xpath_variable_number(): value(0)
+		{
+		}
+
+		double value;
+		char_t name[1];
+	};
+
+	struct xpath_variable_string: xpath_variable
+	{
+		xpath_variable_string(): value(0)
+		{
+		}
+
+		~xpath_variable_string()
+		{
+			if (value) xml_memory::deallocate(value);
+		}
+
+		char_t* value;
+		char_t name[1];
+	};
+
+	struct xpath_variable_node_set: xpath_variable
+	{
+		xpath_node_set value;
+		char_t name[1];
+	};
+
+	static const xpath_node_set dummy_node_set;
+
+	PUGI__FN unsigned int hash_string(const char_t* str)
+	{
+		// Jenkins one-at-a-time hash (http://en.wikipedia.org/wiki/Jenkins_hash_function#one-at-a-time)
+		unsigned int result = 0;
+
+		while (*str)
+		{
+			result += static_cast<unsigned int>(*str++);
+			result += result << 10;
+			result ^= result >> 6;
+		}
+	
+		result += result << 3;
+		result ^= result >> 11;
+		result += result << 15;
+	
+		return result;
+	}
+
+	template <typename T> PUGI__FN T* new_xpath_variable(const char_t* name)
+	{
+		size_t length = strlength(name);
+		if (length == 0) return 0; // empty variable names are invalid
+
+		// $$ we can't use offsetof(T, name) because T is non-POD, so we just allocate additional length characters
+		void* memory = xml_memory::allocate(sizeof(T) + length * sizeof(char_t));
+		if (!memory) return 0;
+
+		T* result = new (memory) T();
+
+		memcpy(result->name, name, (length + 1) * sizeof(char_t));
+
+		return result;
+	}
+
+	PUGI__FN xpath_variable* new_xpath_variable(xpath_value_type type, const char_t* name)
+	{
+		switch (type)
+		{
+		case xpath_type_node_set:
+			return new_xpath_variable<xpath_variable_node_set>(name);
+
+		case xpath_type_number:
+			return new_xpath_variable<xpath_variable_number>(name);
+
+		case xpath_type_string:
+			return new_xpath_variable<xpath_variable_string>(name);
+
+		case xpath_type_boolean:
+			return new_xpath_variable<xpath_variable_boolean>(name);
+
+		default:
+			return 0;
+		}
+	}
+
+	template <typename T> PUGI__FN void delete_xpath_variable(T* var)
+	{
+		var->~T();
+		xml_memory::deallocate(var);
+	}
+
+	PUGI__FN void delete_xpath_variable(xpath_value_type type, xpath_variable* var)
+	{
+		switch (type)
+		{
+		case xpath_type_node_set:
+			delete_xpath_variable(static_cast<xpath_variable_node_set*>(var));
+			break;
+
+		case xpath_type_number:
+			delete_xpath_variable(static_cast<xpath_variable_number*>(var));
+			break;
+
+		case xpath_type_string:
+			delete_xpath_variable(static_cast<xpath_variable_string*>(var));
+			break;
+
+		case xpath_type_boolean:
+			delete_xpath_variable(static_cast<xpath_variable_boolean*>(var));
+			break;
+
+		default:
+			assert(!"Invalid variable type");
+		}
+	}
+
+	PUGI__FN xpath_variable* get_variable(xpath_variable_set* set, const char_t* begin, const char_t* end)
+	{
+		char_t buffer[32];
+
+		size_t length = static_cast<size_t>(end - begin);
+		char_t* scratch = buffer;
+
+		if (length >= sizeof(buffer) / sizeof(buffer[0]))
+		{
+			// need to make dummy on-heap copy
+			scratch = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+			if (!scratch) return 0;
+		}
+
+		// copy string to zero-terminated buffer and perform lookup
+		memcpy(scratch, begin, length * sizeof(char_t));
+		scratch[length] = 0;
+
+		xpath_variable* result = set->get(scratch);
+
+		// free dummy buffer
+		if (scratch != buffer) xml_memory::deallocate(scratch);
+
+		return result;
+	}
+PUGI__NS_END
+
+// Internal node set class
+PUGI__NS_BEGIN
+	PUGI__FN xpath_node_set::type_t xpath_sort(xpath_node* begin, xpath_node* end, xpath_node_set::type_t type, bool rev)
+	{
+		xpath_node_set::type_t order = rev ? xpath_node_set::type_sorted_reverse : xpath_node_set::type_sorted;
+
+		if (type == xpath_node_set::type_unsorted)
+		{
+			sort(begin, end, document_order_comparator());
+
+			type = xpath_node_set::type_sorted;
+		}
+		
+		if (type != order) reverse(begin, end);
+			
+		return order;
+	}
+
+	PUGI__FN xpath_node xpath_first(const xpath_node* begin, const xpath_node* end, xpath_node_set::type_t type)
+	{
+		if (begin == end) return xpath_node();
+
+		switch (type)
+		{
+		case xpath_node_set::type_sorted:
+			return *begin;
+
+		case xpath_node_set::type_sorted_reverse:
+			return *(end - 1);
+
+		case xpath_node_set::type_unsorted:
+			return *min_element(begin, end, document_order_comparator());
+
+		default:
+			assert(!"Invalid node set type");
+			return xpath_node();
+		}
+	}
+
+	class xpath_node_set_raw
+	{
+		xpath_node_set::type_t _type;
+
+		xpath_node* _begin;
+		xpath_node* _end;
+		xpath_node* _eos;
+
+	public:
+		xpath_node_set_raw(): _type(xpath_node_set::type_unsorted), _begin(0), _end(0), _eos(0)
+		{
+		}
+
+		xpath_node* begin() const
+		{
+			return _begin;
+		}
+
+		xpath_node* end() const
+		{
+			return _end;
+		}
+
+		bool empty() const
+		{
+			return _begin == _end;
+		}
+
+		size_t size() const
+		{
+			return static_cast<size_t>(_end - _begin);
+		}
+
+		xpath_node first() const
+		{
+			return xpath_first(_begin, _end, _type);
+		}
+
+		void push_back(const xpath_node& node, xpath_allocator* alloc)
+		{
+			if (_end == _eos)
+			{
+				size_t capacity = static_cast<size_t>(_eos - _begin);
+
+				// get new capacity (1.5x rule)
+				size_t new_capacity = capacity + capacity / 2 + 1;
+
+				// reallocate the old array or allocate a new one
+				xpath_node* data = static_cast<xpath_node*>(alloc->reallocate(_begin, capacity * sizeof(xpath_node), new_capacity * sizeof(xpath_node)));
+				assert(data);
+
+				// finalize
+				_begin = data;
+				_end = data + capacity;
+				_eos = data + new_capacity;
+			}
+
+			*_end++ = node;
+		}
+
+		void append(const xpath_node* begin_, const xpath_node* end_, xpath_allocator* alloc)
+		{
+			size_t size_ = static_cast<size_t>(_end - _begin);
+			size_t capacity = static_cast<size_t>(_eos - _begin);
+			size_t count = static_cast<size_t>(end_ - begin_);
+
+			if (size_ + count > capacity)
+			{
+				// reallocate the old array or allocate a new one
+				xpath_node* data = static_cast<xpath_node*>(alloc->reallocate(_begin, capacity * sizeof(xpath_node), (size_ + count) * sizeof(xpath_node)));
+				assert(data);
+
+				// finalize
+				_begin = data;
+				_end = data + size_;
+				_eos = data + size_ + count;
+			}
+
+			memcpy(_end, begin_, count * sizeof(xpath_node));
+			_end += count;
+		}
+
+		void sort_do()
+		{
+			_type = xpath_sort(_begin, _end, _type, false);
+		}
+
+		void truncate(xpath_node* pos)
+		{
+			assert(_begin <= pos && pos <= _end);
+
+			_end = pos;
+		}
+
+		void remove_duplicates()
+		{
+			if (_type == xpath_node_set::type_unsorted)
+				sort(_begin, _end, duplicate_comparator());
+		
+			_end = unique(_begin, _end);
+		}
+
+		xpath_node_set::type_t type() const
+		{
+			return _type;
+		}
+
+		void set_type(xpath_node_set::type_t value)
+		{
+			_type = value;
+		}
+	};
+PUGI__NS_END
+
+PUGI__NS_BEGIN
+	struct xpath_context
+	{
+		xpath_node n;
+		size_t position, size;
+
+		xpath_context(const xpath_node& n_, size_t position_, size_t size_): n(n_), position(position_), size(size_)
+		{
+		}
+	};
+
+	enum lexeme_t
+	{
+		lex_none = 0,
+		lex_equal,
+		lex_not_equal,
+		lex_less,
+		lex_greater,
+		lex_less_or_equal,
+		lex_greater_or_equal,
+		lex_plus,
+		lex_minus,
+		lex_multiply,
+		lex_union,
+		lex_var_ref,
+		lex_open_brace,
+		lex_close_brace,
+		lex_quoted_string,
+		lex_number,
+		lex_slash,
+		lex_double_slash,
+		lex_open_square_brace,
+		lex_close_square_brace,
+		lex_string,
+		lex_comma,
+		lex_axis_attribute,
+		lex_dot,
+		lex_double_dot,
+		lex_double_colon,
+		lex_eof
+	};
+
+	struct xpath_lexer_string
+	{
+		const char_t* begin;
+		const char_t* end;
+
+		xpath_lexer_string(): begin(0), end(0)
+		{
+		}
+
+		bool operator==(const char_t* other) const
+		{
+			size_t length = static_cast<size_t>(end - begin);
+
+			return strequalrange(other, begin, length);
+		}
+	};
+
+	class xpath_lexer
+	{
+		const char_t* _cur;
+		const char_t* _cur_lexeme_pos;
+		xpath_lexer_string _cur_lexeme_contents;
+
+		lexeme_t _cur_lexeme;
+
+	public:
+		explicit xpath_lexer(const char_t* query): _cur(query)
+		{
+			next();
+		}
+		
+		const char_t* state() const
+		{
+			return _cur;
+		}
+		
+		void next()
+		{
+			const char_t* cur = _cur;
+
+			while (PUGI__IS_CHARTYPE(*cur, ct_space)) ++cur;
+
+			// save lexeme position for error reporting
+			_cur_lexeme_pos = cur;
+
+			switch (*cur)
+			{
+			case 0:
+				_cur_lexeme = lex_eof;
+				break;
+			
+			case '>':
+				if (*(cur+1) == '=')
+				{
+					cur += 2;
+					_cur_lexeme = lex_greater_or_equal;
+				}
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_greater;
+				}
+				break;
+
+			case '<':
+				if (*(cur+1) == '=')
+				{
+					cur += 2;
+					_cur_lexeme = lex_less_or_equal;
+				}
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_less;
+				}
+				break;
+
+			case '!':
+				if (*(cur+1) == '=')
+				{
+					cur += 2;
+					_cur_lexeme = lex_not_equal;
+				}
+				else
+				{
+					_cur_lexeme = lex_none;
+				}
+				break;
+
+			case '=':
+				cur += 1;
+				_cur_lexeme = lex_equal;
+
+				break;
+			
+			case '+':
+				cur += 1;
+				_cur_lexeme = lex_plus;
+
+				break;
+
+			case '-':
+				cur += 1;
+				_cur_lexeme = lex_minus;
+
+				break;
+
+			case '*':
+				cur += 1;
+				_cur_lexeme = lex_multiply;
+
+				break;
+
+			case '|':
+				cur += 1;
+				_cur_lexeme = lex_union;
+
+				break;
+			
+			case '$':
+				cur += 1;
+
+				if (PUGI__IS_CHARTYPEX(*cur, ctx_start_symbol))
+				{
+					_cur_lexeme_contents.begin = cur;
+
+					while (PUGI__IS_CHARTYPEX(*cur, ctx_symbol)) cur++;
+
+					if (cur[0] == ':' && PUGI__IS_CHARTYPEX(cur[1], ctx_symbol)) // qname
+					{
+						cur++; // :
+
+						while (PUGI__IS_CHARTYPEX(*cur, ctx_symbol)) cur++;
+					}
+
+					_cur_lexeme_contents.end = cur;
+				
+					_cur_lexeme = lex_var_ref;
+				}
+				else
+				{
+					_cur_lexeme = lex_none;
+				}
+
+				break;
+
+			case '(':
+				cur += 1;
+				_cur_lexeme = lex_open_brace;
+
+				break;
+
+			case ')':
+				cur += 1;
+				_cur_lexeme = lex_close_brace;
+
+				break;
+			
+			case '[':
+				cur += 1;
+				_cur_lexeme = lex_open_square_brace;
+
+				break;
+
+			case ']':
+				cur += 1;
+				_cur_lexeme = lex_close_square_brace;
+
+				break;
+
+			case ',':
+				cur += 1;
+				_cur_lexeme = lex_comma;
+
+				break;
+
+			case '/':
+				if (*(cur+1) == '/')
+				{
+					cur += 2;
+					_cur_lexeme = lex_double_slash;
+				}
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_slash;
+				}
+				break;
+		
+			case '.':
+				if (*(cur+1) == '.')
+				{
+					cur += 2;
+					_cur_lexeme = lex_double_dot;
+				}
+				else if (PUGI__IS_CHARTYPEX(*(cur+1), ctx_digit))
+				{
+					_cur_lexeme_contents.begin = cur; // .
+
+					++cur;
+
+					while (PUGI__IS_CHARTYPEX(*cur, ctx_digit)) cur++;
+
+					_cur_lexeme_contents.end = cur;
+					
+					_cur_lexeme = lex_number;
+				}
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_dot;
+				}
+				break;
+
+			case '@':
+				cur += 1;
+				_cur_lexeme = lex_axis_attribute;
+
+				break;
+
+			case '"':
+			case '\'':
+			{
+				char_t terminator = *cur;
+
+				++cur;
+
+				_cur_lexeme_contents.begin = cur;
+				while (*cur && *cur != terminator) cur++;
+				_cur_lexeme_contents.end = cur;
+				
+				if (!*cur)
+					_cur_lexeme = lex_none;
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_quoted_string;
+				}
+
+				break;
+			}
+
+			case ':':
+				if (*(cur+1) == ':')
+				{
+					cur += 2;
+					_cur_lexeme = lex_double_colon;
+				}
+				else
+				{
+					_cur_lexeme = lex_none;
+				}
+				break;
+
+			default:
+				if (PUGI__IS_CHARTYPEX(*cur, ctx_digit))
+				{
+					_cur_lexeme_contents.begin = cur;
+
+					while (PUGI__IS_CHARTYPEX(*cur, ctx_digit)) cur++;
+				
+					if (*cur == '.')
+					{
+						cur++;
+
+						while (PUGI__IS_CHARTYPEX(*cur, ctx_digit)) cur++;
+					}
+
+					_cur_lexeme_contents.end = cur;
+
+					_cur_lexeme = lex_number;
+				}
+				else if (PUGI__IS_CHARTYPEX(*cur, ctx_start_symbol))
+				{
+					_cur_lexeme_contents.begin = cur;
+
+					while (PUGI__IS_CHARTYPEX(*cur, ctx_symbol)) cur++;
+
+					if (cur[0] == ':')
+					{
+						if (cur[1] == '*') // namespace test ncname:*
+						{
+							cur += 2; // :*
+						}
+						else if (PUGI__IS_CHARTYPEX(cur[1], ctx_symbol)) // namespace test qname
+						{
+							cur++; // :
+
+							while (PUGI__IS_CHARTYPEX(*cur, ctx_symbol)) cur++;
+						}
+					}
+
+					_cur_lexeme_contents.end = cur;
+				
+					_cur_lexeme = lex_string;
+				}
+				else
+				{
+					_cur_lexeme = lex_none;
+				}
+			}
+
+			_cur = cur;
+		}
+
+		lexeme_t current() const
+		{
+			return _cur_lexeme;
+		}
+
+		const char_t* current_pos() const
+		{
+			return _cur_lexeme_pos;
+		}
+
+		const xpath_lexer_string& contents() const
+		{
+			assert(_cur_lexeme == lex_var_ref || _cur_lexeme == lex_number || _cur_lexeme == lex_string || _cur_lexeme == lex_quoted_string);
+
+			return _cur_lexeme_contents;
+		}
+	};
+
+	enum ast_type_t
+	{
+		ast_op_or,						// left or right
+		ast_op_and,						// left and right
+		ast_op_equal,					// left = right
+		ast_op_not_equal,				// left != right
+		ast_op_less,					// left < right
+		ast_op_greater,					// left > right
+		ast_op_less_or_equal,			// left <= right
+		ast_op_greater_or_equal,		// left >= right
+		ast_op_add,						// left + right
+		ast_op_subtract,				// left - right
+		ast_op_multiply,				// left * right
+		ast_op_divide,					// left / right
+		ast_op_mod,						// left % right
+		ast_op_negate,					// left - right
+		ast_op_union,					// left | right
+		ast_predicate,					// apply predicate to set; next points to next predicate
+		ast_filter,						// select * from left where right
+		ast_filter_posinv,				// select * from left where right; proximity position invariant
+		ast_string_constant,			// string constant
+		ast_number_constant,			// number constant
+		ast_variable,					// variable
+		ast_func_last,					// last()
+		ast_func_position,				// position()
+		ast_func_count,					// count(left)
+		ast_func_id,					// id(left)
+		ast_func_local_name_0,			// local-name()
+		ast_func_local_name_1,			// local-name(left)
+		ast_func_namespace_uri_0,		// namespace-uri()
+		ast_func_namespace_uri_1,		// namespace-uri(left)
+		ast_func_name_0,				// name()
+		ast_func_name_1,				// name(left)
+		ast_func_string_0,				// string()
+		ast_func_string_1,				// string(left)
+		ast_func_concat,				// concat(left, right, siblings)
+		ast_func_starts_with,			// starts_with(left, right)
+		ast_func_contains,				// contains(left, right)
+		ast_func_substring_before,		// substring-before(left, right)
+		ast_func_substring_after,		// substring-after(left, right)
+		ast_func_substring_2,			// substring(left, right)
+		ast_func_substring_3,			// substring(left, right, third)
+		ast_func_string_length_0,		// string-length()
+		ast_func_string_length_1,		// string-length(left)
+		ast_func_normalize_space_0,		// normalize-space()
+		ast_func_normalize_space_1,		// normalize-space(left)
+		ast_func_translate,				// translate(left, right, third)
+		ast_func_boolean,				// boolean(left)
+		ast_func_not,					// not(left)
+		ast_func_true,					// true()
+		ast_func_false,					// false()
+		ast_func_lang,					// lang(left)
+		ast_func_number_0,				// number()
+		ast_func_number_1,				// number(left)
+		ast_func_sum,					// sum(left)
+		ast_func_floor,					// floor(left)
+		ast_func_ceiling,				// ceiling(left)
+		ast_func_round,					// round(left)
+		ast_step,						// process set left with step
+		ast_step_root					// select root node
+	};
+
+	enum axis_t
+	{
+		axis_ancestor,
+		axis_ancestor_or_self,
+		axis_attribute,
+		axis_child,
+		axis_descendant,
+		axis_descendant_or_self,
+		axis_following,
+		axis_following_sibling,
+		axis_namespace,
+		axis_parent,
+		axis_preceding,
+		axis_preceding_sibling,
+		axis_self
+	};
+	
+	enum nodetest_t
+	{
+		nodetest_none,
+		nodetest_name,
+		nodetest_type_node,
+		nodetest_type_comment,
+		nodetest_type_pi,
+		nodetest_type_text,
+		nodetest_pi,
+		nodetest_all,
+		nodetest_all_in_namespace
+	};
+
+	template <axis_t N> struct axis_to_type
+	{
+		static const axis_t axis;
+	};
+
+	template <axis_t N> const axis_t axis_to_type<N>::axis = N;
+		
+	class xpath_ast_node
+	{
+	private:
+		// node type
+		char _type;
+		char _rettype;
+
+		// for ast_step / ast_predicate
+		char _axis;
+		char _test;
+
+		// tree node structure
+		xpath_ast_node* _left;
+		xpath_ast_node* _right;
+		xpath_ast_node* _next;
+
+		union
+		{
+			// value for ast_string_constant
+			const char_t* string;
+			// value for ast_number_constant
+			double number;
+			// variable for ast_variable
+			xpath_variable* variable;
+			// node test for ast_step (node name/namespace/node type/pi target)
+			const char_t* nodetest;
+		} _data;
+
+		xpath_ast_node(const xpath_ast_node&);
+		xpath_ast_node& operator=(const xpath_ast_node&);
+
+		template <class Comp> static bool compare_eq(xpath_ast_node* lhs, xpath_ast_node* rhs, const xpath_context& c, const xpath_stack& stack, const Comp& comp)
+		{
+			xpath_value_type lt = lhs->rettype(), rt = rhs->rettype();
+
+			if (lt != xpath_type_node_set && rt != xpath_type_node_set)
+			{
+				if (lt == xpath_type_boolean || rt == xpath_type_boolean)
+					return comp(lhs->eval_boolean(c, stack), rhs->eval_boolean(c, stack));
+				else if (lt == xpath_type_number || rt == xpath_type_number)
+					return comp(lhs->eval_number(c, stack), rhs->eval_number(c, stack));
+				else if (lt == xpath_type_string || rt == xpath_type_string)
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					xpath_string ls = lhs->eval_string(c, stack);
+					xpath_string rs = rhs->eval_string(c, stack);
+
+					return comp(ls, rs);
+				}
+			}
+			else if (lt == xpath_type_node_set && rt == xpath_type_node_set)
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ls = lhs->eval_node_set(c, stack);
+				xpath_node_set_raw rs = rhs->eval_node_set(c, stack);
+
+				for (const xpath_node* li = ls.begin(); li != ls.end(); ++li)
+					for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+					{
+						xpath_allocator_capture cri(stack.result);
+
+						if (comp(string_value(*li, stack.result), string_value(*ri, stack.result)))
+							return true;
+					}
+
+				return false;
+			}
+			else
+			{
+				if (lt == xpath_type_node_set)
+				{
+					swap(lhs, rhs);
+					swap(lt, rt);
+				}
+
+				if (lt == xpath_type_boolean)
+					return comp(lhs->eval_boolean(c, stack), rhs->eval_boolean(c, stack));
+				else if (lt == xpath_type_number)
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					double l = lhs->eval_number(c, stack);
+					xpath_node_set_raw rs = rhs->eval_node_set(c, stack);
+
+					for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+					{
+						xpath_allocator_capture cri(stack.result);
+
+						if (comp(l, convert_string_to_number(string_value(*ri, stack.result).c_str())))
+							return true;
+					}
+
+					return false;
+				}
+				else if (lt == xpath_type_string)
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					xpath_string l = lhs->eval_string(c, stack);
+					xpath_node_set_raw rs = rhs->eval_node_set(c, stack);
+
+					for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+					{
+						xpath_allocator_capture cri(stack.result);
+
+						if (comp(l, string_value(*ri, stack.result)))
+							return true;
+					}
+
+					return false;
+				}
+			}
+
+			assert(!"Wrong types");
+			return false;
+		}
+
+		template <class Comp> static bool compare_rel(xpath_ast_node* lhs, xpath_ast_node* rhs, const xpath_context& c, const xpath_stack& stack, const Comp& comp)
+		{
+			xpath_value_type lt = lhs->rettype(), rt = rhs->rettype();
+
+			if (lt != xpath_type_node_set && rt != xpath_type_node_set)
+				return comp(lhs->eval_number(c, stack), rhs->eval_number(c, stack));
+			else if (lt == xpath_type_node_set && rt == xpath_type_node_set)
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ls = lhs->eval_node_set(c, stack);
+				xpath_node_set_raw rs = rhs->eval_node_set(c, stack);
+
+				for (const xpath_node* li = ls.begin(); li != ls.end(); ++li)
+				{
+					xpath_allocator_capture cri(stack.result);
+
+					double l = convert_string_to_number(string_value(*li, stack.result).c_str());
+
+					for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+					{
+						xpath_allocator_capture crii(stack.result);
+
+						if (comp(l, convert_string_to_number(string_value(*ri, stack.result).c_str())))
+							return true;
+					}
+				}
+
+				return false;
+			}
+			else if (lt != xpath_type_node_set && rt == xpath_type_node_set)
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				double l = lhs->eval_number(c, stack);
+				xpath_node_set_raw rs = rhs->eval_node_set(c, stack);
+
+				for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+				{
+					xpath_allocator_capture cri(stack.result);
+
+					if (comp(l, convert_string_to_number(string_value(*ri, stack.result).c_str())))
+						return true;
+				}
+
+				return false;
+			}
+			else if (lt == xpath_type_node_set && rt != xpath_type_node_set)
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ls = lhs->eval_node_set(c, stack);
+				double r = rhs->eval_number(c, stack);
+
+				for (const xpath_node* li = ls.begin(); li != ls.end(); ++li)
+				{
+					xpath_allocator_capture cri(stack.result);
+
+					if (comp(convert_string_to_number(string_value(*li, stack.result).c_str()), r))
+						return true;
+				}
+
+				return false;
+			}
+			else
+			{
+				assert(!"Wrong types");
+				return false;
+			}
+		}
+
+		void apply_predicate(xpath_node_set_raw& ns, size_t first, xpath_ast_node* expr, const xpath_stack& stack)
+		{
+			assert(ns.size() >= first);
+
+			size_t i = 1;
+			size_t size = ns.size() - first;
+				
+			xpath_node* last = ns.begin() + first;
+				
+			// remove_if... or well, sort of
+			for (xpath_node* it = last; it != ns.end(); ++it, ++i)
+			{
+				xpath_context c(*it, i, size);
+			
+				if (expr->rettype() == xpath_type_number)
+				{
+					if (expr->eval_number(c, stack) == i)
+						*last++ = *it;
+				}
+				else if (expr->eval_boolean(c, stack))
+					*last++ = *it;
+			}
+			
+			ns.truncate(last);
+		}
+
+		void apply_predicates(xpath_node_set_raw& ns, size_t first, const xpath_stack& stack)
+		{
+			if (ns.size() == first) return;
+			
+			for (xpath_ast_node* pred = _right; pred; pred = pred->_next)
+			{
+				apply_predicate(ns, first, pred->_left, stack);
+			}
+		}
+
+		void step_push(xpath_node_set_raw& ns, const xml_attribute& a, const xml_node& parent, xpath_allocator* alloc)
+		{
+			if (!a) return;
+
+			const char_t* name = a.name();
+
+			// There are no attribute nodes corresponding to attributes that declare namespaces
+			// That is, "xmlns:..." or "xmlns"
+			if (starts_with(name, PUGIXML_TEXT("xmlns")) && (name[5] == 0 || name[5] == ':')) return;
+			
+			switch (_test)
+			{
+			case nodetest_name:
+				if (strequal(name, _data.nodetest)) ns.push_back(xpath_node(a, parent), alloc);
+				break;
+				
+			case nodetest_type_node:
+			case nodetest_all:
+				ns.push_back(xpath_node(a, parent), alloc);
+				break;
+				
+			case nodetest_all_in_namespace:
+				if (starts_with(name, _data.nodetest))
+					ns.push_back(xpath_node(a, parent), alloc);
+				break;
+			
+			default:
+				;
+			}
+		}
+		
+		void step_push(xpath_node_set_raw& ns, const xml_node& n, xpath_allocator* alloc)
+		{
+			if (!n) return;
+
+			switch (_test)
+			{
+			case nodetest_name:
+				if (n.type() == node_element && strequal(n.name(), _data.nodetest)) ns.push_back(n, alloc);
+				break;
+				
+			case nodetest_type_node:
+				ns.push_back(n, alloc);
+				break;
+				
+			case nodetest_type_comment:
+				if (n.type() == node_comment)
+					ns.push_back(n, alloc);
+				break;
+				
+			case nodetest_type_text:
+				if (n.type() == node_pcdata || n.type() == node_cdata)
+					ns.push_back(n, alloc);
+				break;
+				
+			case nodetest_type_pi:
+				if (n.type() == node_pi)
+					ns.push_back(n, alloc);
+				break;
+									
+			case nodetest_pi:
+				if (n.type() == node_pi && strequal(n.name(), _data.nodetest))
+					ns.push_back(n, alloc);
+				break;
+				
+			case nodetest_all:
+				if (n.type() == node_element)
+					ns.push_back(n, alloc);
+				break;
+				
+			case nodetest_all_in_namespace:
+				if (n.type() == node_element && starts_with(n.name(), _data.nodetest))
+					ns.push_back(n, alloc);
+				break;
+
+			default:
+				assert(!"Unknown axis");
+			} 
+		}
+
+		template <class T> void step_fill(xpath_node_set_raw& ns, const xml_node& n, xpath_allocator* alloc, T)
+		{
+			const axis_t axis = T::axis;
+
+			switch (axis)
+			{
+			case axis_attribute:
+			{
+				for (xml_attribute a = n.first_attribute(); a; a = a.next_attribute())
+					step_push(ns, a, n, alloc);
+				
+				break;
+			}
+			
+			case axis_child:
+			{
+				for (xml_node c = n.first_child(); c; c = c.next_sibling())
+					step_push(ns, c, alloc);
+					
+				break;
+			}
+			
+			case axis_descendant:
+			case axis_descendant_or_self:
+			{
+				if (axis == axis_descendant_or_self)
+					step_push(ns, n, alloc);
+					
+				xml_node cur = n.first_child();
+				
+				while (cur && cur != n)
+				{
+					step_push(ns, cur, alloc);
+					
+					if (cur.first_child())
+						cur = cur.first_child();
+					else if (cur.next_sibling())
+						cur = cur.next_sibling();
+					else
+					{
+						while (!cur.next_sibling() && cur != n)
+							cur = cur.parent();
+					
+						if (cur != n) cur = cur.next_sibling();
+					}
+				}
+				
+				break;
+			}
+			
+			case axis_following_sibling:
+			{
+				for (xml_node c = n.next_sibling(); c; c = c.next_sibling())
+					step_push(ns, c, alloc);
+				
+				break;
+			}
+			
+			case axis_preceding_sibling:
+			{
+				for (xml_node c = n.previous_sibling(); c; c = c.previous_sibling())
+					step_push(ns, c, alloc);
+				
+				break;
+			}
+			
+			case axis_following:
+			{
+				xml_node cur = n;
+
+				// exit from this node so that we don't include descendants
+				while (cur && !cur.next_sibling()) cur = cur.parent();
+				cur = cur.next_sibling();
+
+				for (;;)
+				{
+					step_push(ns, cur, alloc);
+
+					if (cur.first_child())
+						cur = cur.first_child();
+					else if (cur.next_sibling())
+						cur = cur.next_sibling();
+					else
+					{
+						while (cur && !cur.next_sibling()) cur = cur.parent();
+						cur = cur.next_sibling();
+
+						if (!cur) break;
+					}
+				}
+
+				break;
+			}
+
+			case axis_preceding:
+			{
+				xml_node cur = n;
+
+				while (cur && !cur.previous_sibling()) cur = cur.parent();
+				cur = cur.previous_sibling();
+
+				for (;;)
+				{
+					if (cur.last_child())
+						cur = cur.last_child();
+					else
+					{
+						// leaf node, can't be ancestor
+						step_push(ns, cur, alloc);
+
+						if (cur.previous_sibling())
+							cur = cur.previous_sibling();
+						else
+						{
+							do 
+							{
+								cur = cur.parent();
+								if (!cur) break;
+
+								if (!node_is_ancestor(cur, n)) step_push(ns, cur, alloc);
+							}
+							while (!cur.previous_sibling());
+
+							cur = cur.previous_sibling();
+
+							if (!cur) break;
+						}
+					}
+				}
+
+				break;
+			}
+			
+			case axis_ancestor:
+			case axis_ancestor_or_self:
+			{
+				if (axis == axis_ancestor_or_self)
+					step_push(ns, n, alloc);
+
+				xml_node cur = n.parent();
+				
+				while (cur)
+				{
+					step_push(ns, cur, alloc);
+					
+					cur = cur.parent();
+				}
+				
+				break;
+			}
+
+			case axis_self:
+			{
+				step_push(ns, n, alloc);
+
+				break;
+			}
+
+			case axis_parent:
+			{
+				if (n.parent()) step_push(ns, n.parent(), alloc);
+
+				break;
+			}
+				
+			default:
+				assert(!"Unimplemented axis");
+			}
+		}
+		
+		template <class T> void step_fill(xpath_node_set_raw& ns, const xml_attribute& a, const xml_node& p, xpath_allocator* alloc, T v)
+		{
+			const axis_t axis = T::axis;
+
+			switch (axis)
+			{
+			case axis_ancestor:
+			case axis_ancestor_or_self:
+			{
+				if (axis == axis_ancestor_or_self && _test == nodetest_type_node) // reject attributes based on principal node type test
+					step_push(ns, a, p, alloc);
+
+				xml_node cur = p;
+				
+				while (cur)
+				{
+					step_push(ns, cur, alloc);
+					
+					cur = cur.parent();
+				}
+				
+				break;
+			}
+
+			case axis_descendant_or_self:
+			case axis_self:
+			{
+				if (_test == nodetest_type_node) // reject attributes based on principal node type test
+					step_push(ns, a, p, alloc);
+
+				break;
+			}
+
+			case axis_following:
+			{
+				xml_node cur = p;
+				
+				for (;;)
+				{
+					if (cur.first_child())
+						cur = cur.first_child();
+					else if (cur.next_sibling())
+						cur = cur.next_sibling();
+					else
+					{
+						while (cur && !cur.next_sibling()) cur = cur.parent();
+						cur = cur.next_sibling();
+						
+						if (!cur) break;
+					}
+
+					step_push(ns, cur, alloc);
+				}
+
+				break;
+			}
+
+			case axis_parent:
+			{
+				step_push(ns, p, alloc);
+
+				break;
+			}
+
+			case axis_preceding:
+			{
+				// preceding:: axis does not include attribute nodes and attribute ancestors (they are the same as parent's ancestors), so we can reuse node preceding
+				step_fill(ns, p, alloc, v);
+				break;
+			}
+			
+			default:
+				assert(!"Unimplemented axis");
+			}
+		}
+		
+		template <class T> xpath_node_set_raw step_do(const xpath_context& c, const xpath_stack& stack, T v)
+		{
+			const axis_t axis = T::axis;
+			bool attributes = (axis == axis_ancestor || axis == axis_ancestor_or_self || axis == axis_descendant_or_self || axis == axis_following || axis == axis_parent || axis == axis_preceding || axis == axis_self);
+
+			xpath_node_set_raw ns;
+			ns.set_type((axis == axis_ancestor || axis == axis_ancestor_or_self || axis == axis_preceding || axis == axis_preceding_sibling) ? xpath_node_set::type_sorted_reverse : xpath_node_set::type_sorted);
+
+			if (_left)
+			{
+				xpath_node_set_raw s = _left->eval_node_set(c, stack);
+
+				// self axis preserves the original order
+				if (axis == axis_self) ns.set_type(s.type());
+
+				for (const xpath_node* it = s.begin(); it != s.end(); ++it)
+				{
+					size_t size = ns.size();
+
+					// in general, all axes generate elements in a particular order, but there is no order guarantee if axis is applied to two nodes
+					if (axis != axis_self && size != 0) ns.set_type(xpath_node_set::type_unsorted);
+					
+					if (it->node())
+						step_fill(ns, it->node(), stack.result, v);
+					else if (attributes)
+						step_fill(ns, it->attribute(), it->parent(), stack.result, v);
+						
+					apply_predicates(ns, size, stack);
+				}
+			}
+			else
+			{
+				if (c.n.node())
+					step_fill(ns, c.n.node(), stack.result, v);
+				else if (attributes)
+					step_fill(ns, c.n.attribute(), c.n.parent(), stack.result, v);
+				
+				apply_predicates(ns, 0, stack);
+			}
+
+			// child, attribute and self axes always generate unique set of nodes
+			// for other axis, if the set stayed sorted, it stayed unique because the traversal algorithms do not visit the same node twice
+			if (axis != axis_child && axis != axis_attribute && axis != axis_self && ns.type() == xpath_node_set::type_unsorted)
+				ns.remove_duplicates();
+
+			return ns;
+		}
+		
+	public:
+		xpath_ast_node(ast_type_t type, xpath_value_type rettype_, const char_t* value):
+			_type(static_cast<char>(type)), _rettype(static_cast<char>(rettype_)), _axis(0), _test(0), _left(0), _right(0), _next(0)
+		{
+			assert(type == ast_string_constant);
+			_data.string = value;
+		}
+
+		xpath_ast_node(ast_type_t type, xpath_value_type rettype_, double value):
+			_type(static_cast<char>(type)), _rettype(static_cast<char>(rettype_)), _axis(0), _test(0), _left(0), _right(0), _next(0)
+		{
+			assert(type == ast_number_constant);
+			_data.number = value;
+		}
+		
+		xpath_ast_node(ast_type_t type, xpath_value_type rettype_, xpath_variable* value):
+			_type(static_cast<char>(type)), _rettype(static_cast<char>(rettype_)), _axis(0), _test(0), _left(0), _right(0), _next(0)
+		{
+			assert(type == ast_variable);
+			_data.variable = value;
+		}
+		
+		xpath_ast_node(ast_type_t type, xpath_value_type rettype_, xpath_ast_node* left = 0, xpath_ast_node* right = 0):
+			_type(static_cast<char>(type)), _rettype(static_cast<char>(rettype_)), _axis(0), _test(0), _left(left), _right(right), _next(0)
+		{
+		}
+
+		xpath_ast_node(ast_type_t type, xpath_ast_node* left, axis_t axis, nodetest_t test, const char_t* contents):
+			_type(static_cast<char>(type)), _rettype(xpath_type_node_set), _axis(static_cast<char>(axis)), _test(static_cast<char>(test)), _left(left), _right(0), _next(0)
+		{
+			_data.nodetest = contents;
+		}
+
+		void set_next(xpath_ast_node* value)
+		{
+			_next = value;
+		}
+
+		void set_right(xpath_ast_node* value)
+		{
+			_right = value;
+		}
+
+		bool eval_boolean(const xpath_context& c, const xpath_stack& stack)
+		{
+			switch (_type)
+			{
+			case ast_op_or:
+				return _left->eval_boolean(c, stack) || _right->eval_boolean(c, stack);
+				
+			case ast_op_and:
+				return _left->eval_boolean(c, stack) && _right->eval_boolean(c, stack);
+				
+			case ast_op_equal:
+				return compare_eq(_left, _right, c, stack, equal_to());
+
+			case ast_op_not_equal:
+				return compare_eq(_left, _right, c, stack, not_equal_to());
+	
+			case ast_op_less:
+				return compare_rel(_left, _right, c, stack, less());
+			
+			case ast_op_greater:
+				return compare_rel(_right, _left, c, stack, less());
+
+			case ast_op_less_or_equal:
+				return compare_rel(_left, _right, c, stack, less_equal());
+			
+			case ast_op_greater_or_equal:
+				return compare_rel(_right, _left, c, stack, less_equal());
+
+			case ast_func_starts_with:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_string lr = _left->eval_string(c, stack);
+				xpath_string rr = _right->eval_string(c, stack);
+
+				return starts_with(lr.c_str(), rr.c_str());
+			}
+
+			case ast_func_contains:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_string lr = _left->eval_string(c, stack);
+				xpath_string rr = _right->eval_string(c, stack);
+
+				return find_substring(lr.c_str(), rr.c_str()) != 0;
+			}
+
+			case ast_func_boolean:
+				return _left->eval_boolean(c, stack);
+				
+			case ast_func_not:
+				return !_left->eval_boolean(c, stack);
+				
+			case ast_func_true:
+				return true;
+				
+			case ast_func_false:
+				return false;
+
+			case ast_func_lang:
+			{
+				if (c.n.attribute()) return false;
+				
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_string lang = _left->eval_string(c, stack);
+				
+				for (xml_node n = c.n.node(); n; n = n.parent())
+				{
+					xml_attribute a = n.attribute(PUGIXML_TEXT("xml:lang"));
+					
+					if (a)
+					{
+						const char_t* value = a.value();
+						
+						// strnicmp / strncasecmp is not portable
+						for (const char_t* lit = lang.c_str(); *lit; ++lit)
+						{
+							if (tolower_ascii(*lit) != tolower_ascii(*value)) return false;
+							++value;
+						}
+						
+						return *value == 0 || *value == '-';
+					}
+				}
+				
+				return false;
+			}
+
+			case ast_variable:
+			{
+				assert(_rettype == _data.variable->type());
+
+				if (_rettype == xpath_type_boolean)
+					return _data.variable->get_boolean();
+
+				// fallthrough to type conversion
+			}
+
+			default:
+			{
+				switch (_rettype)
+				{
+				case xpath_type_number:
+					return convert_number_to_boolean(eval_number(c, stack));
+					
+				case xpath_type_string:
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					return !eval_string(c, stack).empty();
+				}
+					
+				case xpath_type_node_set:				
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					return !eval_node_set(c, stack).empty();
+				}
+
+				default:
+					assert(!"Wrong expression for return type boolean");
+					return false;
+				}
+			}
+			}
+		}
+
+		double eval_number(const xpath_context& c, const xpath_stack& stack)
+		{
+			switch (_type)
+			{
+			case ast_op_add:
+				return _left->eval_number(c, stack) + _right->eval_number(c, stack);
+				
+			case ast_op_subtract:
+				return _left->eval_number(c, stack) - _right->eval_number(c, stack);
+
+			case ast_op_multiply:
+				return _left->eval_number(c, stack) * _right->eval_number(c, stack);
+
+			case ast_op_divide:
+				return _left->eval_number(c, stack) / _right->eval_number(c, stack);
+
+			case ast_op_mod:
+				return fmod(_left->eval_number(c, stack), _right->eval_number(c, stack));
+
+			case ast_op_negate:
+				return -_left->eval_number(c, stack);
+
+			case ast_number_constant:
+				return _data.number;
+
+			case ast_func_last:
+				return static_cast<double>(c.size);
+			
+			case ast_func_position:
+				return static_cast<double>(c.position);
+
+			case ast_func_count:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				return static_cast<double>(_left->eval_node_set(c, stack).size());
+			}
+			
+			case ast_func_string_length_0:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				return static_cast<double>(string_value(c.n, stack.result).length());
+			}
+			
+			case ast_func_string_length_1:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				return static_cast<double>(_left->eval_string(c, stack).length());
+			}
+			
+			case ast_func_number_0:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				return convert_string_to_number(string_value(c.n, stack.result).c_str());
+			}
+			
+			case ast_func_number_1:
+				return _left->eval_number(c, stack);
+
+			case ast_func_sum:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				double r = 0;
+				
+				xpath_node_set_raw ns = _left->eval_node_set(c, stack);
+				
+				for (const xpath_node* it = ns.begin(); it != ns.end(); ++it)
+				{
+					xpath_allocator_capture cri(stack.result);
+
+					r += convert_string_to_number(string_value(*it, stack.result).c_str());
+				}
+			
+				return r;
+			}
+
+			case ast_func_floor:
+			{
+				double r = _left->eval_number(c, stack);
+				
+				return r == r ? floor(r) : r;
+			}
+
+			case ast_func_ceiling:
+			{
+				double r = _left->eval_number(c, stack);
+				
+				return r == r ? ceil(r) : r;
+			}
+
+			case ast_func_round:
+				return round_nearest_nzero(_left->eval_number(c, stack));
+			
+			case ast_variable:
+			{
+				assert(_rettype == _data.variable->type());
+
+				if (_rettype == xpath_type_number)
+					return _data.variable->get_number();
+
+				// fallthrough to type conversion
+			}
+
+			default:
+			{
+				switch (_rettype)
+				{
+				case xpath_type_boolean:
+					return eval_boolean(c, stack) ? 1 : 0;
+					
+				case xpath_type_string:
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					return convert_string_to_number(eval_string(c, stack).c_str());
+				}
+					
+				case xpath_type_node_set:
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					return convert_string_to_number(eval_string(c, stack).c_str());
+				}
+					
+				default:
+					assert(!"Wrong expression for return type number");
+					return 0;
+				}
+				
+			}
+			}
+		}
+		
+		xpath_string eval_string_concat(const xpath_context& c, const xpath_stack& stack)
+		{
+			assert(_type == ast_func_concat);
+
+			xpath_allocator_capture ct(stack.temp);
+
+			// count the string number
+			size_t count = 1;
+			for (xpath_ast_node* nc = _right; nc; nc = nc->_next) count++;
+
+			// gather all strings
+			xpath_string static_buffer[4];
+			xpath_string* buffer = static_buffer;
+
+			// allocate on-heap for large concats
+			if (count > sizeof(static_buffer) / sizeof(static_buffer[0]))
+			{
+				buffer = static_cast<xpath_string*>(stack.temp->allocate(count * sizeof(xpath_string)));
+				assert(buffer);
+			}
+
+			// evaluate all strings to temporary stack
+			xpath_stack swapped_stack = {stack.temp, stack.result};
+
+			buffer[0] = _left->eval_string(c, swapped_stack);
+
+			size_t pos = 1;
+			for (xpath_ast_node* n = _right; n; n = n->_next, ++pos) buffer[pos] = n->eval_string(c, swapped_stack);
+			assert(pos == count);
+
+			// get total length
+			size_t length = 0;
+			for (size_t i = 0; i < count; ++i) length += buffer[i].length();
+
+			// create final string
+			char_t* result = static_cast<char_t*>(stack.result->allocate((length + 1) * sizeof(char_t)));
+			assert(result);
+
+			char_t* ri = result;
+
+			for (size_t j = 0; j < count; ++j)
+				for (const char_t* bi = buffer[j].c_str(); *bi; ++bi)
+					*ri++ = *bi;
+
+			*ri = 0;
+
+			return xpath_string(result, true);
+		}
+
+		xpath_string eval_string(const xpath_context& c, const xpath_stack& stack)
+		{
+			switch (_type)
+			{
+			case ast_string_constant:
+				return xpath_string_const(_data.string);
+			
+			case ast_func_local_name_0:
+			{
+				xpath_node na = c.n;
+				
+				return xpath_string_const(local_name(na));
+			}
+
+			case ast_func_local_name_1:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ns = _left->eval_node_set(c, stack);
+				xpath_node na = ns.first();
+				
+				return xpath_string_const(local_name(na));
+			}
+
+			case ast_func_name_0:
+			{
+				xpath_node na = c.n;
+				
+				return xpath_string_const(qualified_name(na));
+			}
+
+			case ast_func_name_1:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ns = _left->eval_node_set(c, stack);
+				xpath_node na = ns.first();
+				
+				return xpath_string_const(qualified_name(na));
+			}
+
+			case ast_func_namespace_uri_0:
+			{
+				xpath_node na = c.n;
+				
+				return xpath_string_const(namespace_uri(na));
+			}
+
+			case ast_func_namespace_uri_1:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ns = _left->eval_node_set(c, stack);
+				xpath_node na = ns.first();
+				
+				return xpath_string_const(namespace_uri(na));
+			}
+
+			case ast_func_string_0:
+				return string_value(c.n, stack.result);
+
+			case ast_func_string_1:
+				return _left->eval_string(c, stack);
+
+			case ast_func_concat:
+				return eval_string_concat(c, stack);
+
+			case ast_func_substring_before:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, swapped_stack);
+				xpath_string p = _right->eval_string(c, swapped_stack);
+
+				const char_t* pos = find_substring(s.c_str(), p.c_str());
+				
+				return pos ? xpath_string(s.c_str(), pos, stack.result) : xpath_string();
+			}
+			
+			case ast_func_substring_after:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, swapped_stack);
+				xpath_string p = _right->eval_string(c, swapped_stack);
+				
+				const char_t* pos = find_substring(s.c_str(), p.c_str());
+				if (!pos) return xpath_string();
+
+				const char_t* result = pos + p.length();
+
+				return s.uses_heap() ? xpath_string(result, stack.result) : xpath_string_const(result);
+			}
+
+			case ast_func_substring_2:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, swapped_stack);
+				size_t s_length = s.length();
+
+				double first = round_nearest(_right->eval_number(c, stack));
+				
+				if (is_nan(first)) return xpath_string(); // NaN
+				else if (first >= s_length + 1) return xpath_string();
+				
+				size_t pos = first < 1 ? 1 : static_cast<size_t>(first);
+				assert(1 <= pos && pos <= s_length + 1);
+
+				const char_t* rbegin = s.c_str() + (pos - 1);
+				
+				return s.uses_heap() ? xpath_string(rbegin, stack.result) : xpath_string_const(rbegin);
+			}
+			
+			case ast_func_substring_3:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, swapped_stack);
+				size_t s_length = s.length();
+
+				double first = round_nearest(_right->eval_number(c, stack));
+				double last = first + round_nearest(_right->_next->eval_number(c, stack));
+				
+				if (is_nan(first) || is_nan(last)) return xpath_string();
+				else if (first >= s_length + 1) return xpath_string();
+				else if (first >= last) return xpath_string();
+				else if (last < 1) return xpath_string();
+				
+				size_t pos = first < 1 ? 1 : static_cast<size_t>(first);
+				size_t end = last >= s_length + 1 ? s_length + 1 : static_cast<size_t>(last);
+
+				assert(1 <= pos && pos <= end && end <= s_length + 1);
+				const char_t* rbegin = s.c_str() + (pos - 1);
+				const char_t* rend = s.c_str() + (end - 1);
+
+				return (end == s_length + 1 && !s.uses_heap()) ? xpath_string_const(rbegin) : xpath_string(rbegin, rend, stack.result);
+			}
+
+			case ast_func_normalize_space_0:
+			{
+				xpath_string s = string_value(c.n, stack.result);
+
+				normalize_space(s.data(stack.result));
+
+				return s;
+			}
+
+			case ast_func_normalize_space_1:
+			{
+				xpath_string s = _left->eval_string(c, stack);
+
+				normalize_space(s.data(stack.result));
+			
+				return s;
+			}
+
+			case ast_func_translate:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, stack);
+				xpath_string from = _right->eval_string(c, swapped_stack);
+				xpath_string to = _right->_next->eval_string(c, swapped_stack);
+
+				translate(s.data(stack.result), from.c_str(), to.c_str());
+
+				return s;
+			}
+
+			case ast_variable:
+			{
+				assert(_rettype == _data.variable->type());
+
+				if (_rettype == xpath_type_string)
+					return xpath_string_const(_data.variable->get_string());
+
+				// fallthrough to type conversion
+			}
+
+			default:
+			{
+				switch (_rettype)
+				{
+				case xpath_type_boolean:
+					return xpath_string_const(eval_boolean(c, stack) ? PUGIXML_TEXT("true") : PUGIXML_TEXT("false"));
+					
+				case xpath_type_number:
+					return convert_number_to_string(eval_number(c, stack), stack.result);
+					
+				case xpath_type_node_set:
+				{
+					xpath_allocator_capture cr(stack.temp);
+
+					xpath_stack swapped_stack = {stack.temp, stack.result};
+
+					xpath_node_set_raw ns = eval_node_set(c, swapped_stack);
+					return ns.empty() ? xpath_string() : string_value(ns.first(), stack.result);
+				}
+				
+				default:
+					assert(!"Wrong expression for return type string");
+					return xpath_string();
+				}
+			}
+			}
+		}
+
+		xpath_node_set_raw eval_node_set(const xpath_context& c, const xpath_stack& stack)
+		{
+			switch (_type)
+			{
+			case ast_op_union:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_node_set_raw ls = _left->eval_node_set(c, swapped_stack);
+				xpath_node_set_raw rs = _right->eval_node_set(c, stack);
+				
+				// we can optimize merging two sorted sets, but this is a very rare operation, so don't bother
+				rs.set_type(xpath_node_set::type_unsorted);
+
+				rs.append(ls.begin(), ls.end(), stack.result);
+				rs.remove_duplicates();
+				
+				return rs;
+			}
+
+			case ast_filter:
+			case ast_filter_posinv:
+			{
+				xpath_node_set_raw set = _left->eval_node_set(c, stack);
+
+				// either expression is a number or it contains position() call; sort by document order
+				if (_type == ast_filter) set.sort_do();
+
+				apply_predicate(set, 0, _right, stack);
+			
+				return set;
+			}
+			
+			case ast_func_id:
+				return xpath_node_set_raw();
+			
+			case ast_step:
+			{
+				switch (_axis)
+				{
+				case axis_ancestor:
+					return step_do(c, stack, axis_to_type<axis_ancestor>());
+					
+				case axis_ancestor_or_self:
+					return step_do(c, stack, axis_to_type<axis_ancestor_or_self>());
+
+				case axis_attribute:
+					return step_do(c, stack, axis_to_type<axis_attribute>());
+
+				case axis_child:
+					return step_do(c, stack, axis_to_type<axis_child>());
+				
+				case axis_descendant:
+					return step_do(c, stack, axis_to_type<axis_descendant>());
+
+				case axis_descendant_or_self:
+					return step_do(c, stack, axis_to_type<axis_descendant_or_self>());
+
+				case axis_following:
+					return step_do(c, stack, axis_to_type<axis_following>());
+				
+				case axis_following_sibling:
+					return step_do(c, stack, axis_to_type<axis_following_sibling>());
+				
+				case axis_namespace:
+					// namespaced axis is not supported
+					return xpath_node_set_raw();
+				
+				case axis_parent:
+					return step_do(c, stack, axis_to_type<axis_parent>());
+				
+				case axis_preceding:
+					return step_do(c, stack, axis_to_type<axis_preceding>());
+
+				case axis_preceding_sibling:
+					return step_do(c, stack, axis_to_type<axis_preceding_sibling>());
+				
+				case axis_self:
+					return step_do(c, stack, axis_to_type<axis_self>());
+
+				default:
+					assert(!"Unknown axis");
+					return xpath_node_set_raw();
+				}
+			}
+
+			case ast_step_root:
+			{
+				assert(!_right); // root step can't have any predicates
+
+				xpath_node_set_raw ns;
+
+				ns.set_type(xpath_node_set::type_sorted);
+
+				if (c.n.node()) ns.push_back(c.n.node().root(), stack.result);
+				else if (c.n.attribute()) ns.push_back(c.n.parent().root(), stack.result);
+
+				return ns;
+			}
+
+			case ast_variable:
+			{
+				assert(_rettype == _data.variable->type());
+
+				if (_rettype == xpath_type_node_set)
+				{
+					const xpath_node_set& s = _data.variable->get_node_set();
+
+					xpath_node_set_raw ns;
+
+					ns.set_type(s.type());
+					ns.append(s.begin(), s.end(), stack.result);
+
+					return ns;
+				}
+
+				// fallthrough to type conversion
+			}
+
+			default:
+				assert(!"Wrong expression for return type node set");
+				return xpath_node_set_raw();
+			}
+		}
+		
+		bool is_posinv()
+		{
+			switch (_type)
+			{
+			case ast_func_position:
+				return false;
+
+			case ast_string_constant:
+			case ast_number_constant:
+			case ast_variable:
+				return true;
+
+			case ast_step:
+			case ast_step_root:
+				return true;
+
+			case ast_predicate:
+			case ast_filter:
+			case ast_filter_posinv:
+				return true;
+
+			default:
+				if (_left && !_left->is_posinv()) return false;
+				
+				for (xpath_ast_node* n = _right; n; n = n->_next)
+					if (!n->is_posinv()) return false;
+					
+				return true;
+			}
+		}
+
+		xpath_value_type rettype() const
+		{
+			return static_cast<xpath_value_type>(_rettype);
+		}
+	};
+
+	struct xpath_parser
+	{
+		xpath_allocator* _alloc;
+		xpath_lexer _lexer;
+
+		const char_t* _query;
+		xpath_variable_set* _variables;
+
+		xpath_parse_result* _result;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		jmp_buf _error_handler;
+	#endif
+
+		void throw_error(const char* message)
+		{
+			_result->error = message;
+			_result->offset = _lexer.current_pos() - _query;
+
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			longjmp(_error_handler, 1);
+		#else
+			throw xpath_exception(*_result);
+		#endif
+		}
+
+		void throw_error_oom()
+		{
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			throw_error("Out of memory");
+		#else
+			throw std::bad_alloc();
+		#endif
+		}
+
+		void* alloc_node()
+		{
+			void* result = _alloc->allocate_nothrow(sizeof(xpath_ast_node));
+
+			if (!result) throw_error_oom();
+
+			return result;
+		}
+
+		const char_t* alloc_string(const xpath_lexer_string& value)
+		{
+			if (value.begin)
+			{
+				size_t length = static_cast<size_t>(value.end - value.begin);
+
+				char_t* c = static_cast<char_t*>(_alloc->allocate_nothrow((length + 1) * sizeof(char_t)));
+				if (!c) throw_error_oom();
+
+				memcpy(c, value.begin, length * sizeof(char_t));
+				c[length] = 0;
+
+				return c;
+			}
+			else return 0;
+		}
+
+		xpath_ast_node* parse_function_helper(ast_type_t type0, ast_type_t type1, size_t argc, xpath_ast_node* args[2])
+		{
+			assert(argc <= 1);
+
+			if (argc == 1 && args[0]->rettype() != xpath_type_node_set) throw_error("Function has to be applied to node set");
+
+			return new (alloc_node()) xpath_ast_node(argc == 0 ? type0 : type1, xpath_type_string, args[0]);
+		}
+
+		xpath_ast_node* parse_function(const xpath_lexer_string& name, size_t argc, xpath_ast_node* args[2])
+		{
+			switch (name.begin[0])
+			{
+			case 'b':
+				if (name == PUGIXML_TEXT("boolean") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_boolean, xpath_type_boolean, args[0]);
+					
+				break;
+			
+			case 'c':
+				if (name == PUGIXML_TEXT("count") && argc == 1)
+				{
+					if (args[0]->rettype() != xpath_type_node_set) throw_error("Function has to be applied to node set");
+					return new (alloc_node()) xpath_ast_node(ast_func_count, xpath_type_number, args[0]);
+				}
+				else if (name == PUGIXML_TEXT("contains") && argc == 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_contains, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("concat") && argc >= 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_concat, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("ceiling") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_ceiling, xpath_type_number, args[0]);
+					
+				break;
+			
+			case 'f':
+				if (name == PUGIXML_TEXT("false") && argc == 0)
+					return new (alloc_node()) xpath_ast_node(ast_func_false, xpath_type_boolean);
+				else if (name == PUGIXML_TEXT("floor") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_floor, xpath_type_number, args[0]);
+					
+				break;
+			
+			case 'i':
+				if (name == PUGIXML_TEXT("id") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_id, xpath_type_node_set, args[0]);
+					
+				break;
+			
+			case 'l':
+				if (name == PUGIXML_TEXT("last") && argc == 0)
+					return new (alloc_node()) xpath_ast_node(ast_func_last, xpath_type_number);
+				else if (name == PUGIXML_TEXT("lang") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_lang, xpath_type_boolean, args[0]);
+				else if (name == PUGIXML_TEXT("local-name") && argc <= 1)
+					return parse_function_helper(ast_func_local_name_0, ast_func_local_name_1, argc, args);
+			
+				break;
+			
+			case 'n':
+				if (name == PUGIXML_TEXT("name") && argc <= 1)
+					return parse_function_helper(ast_func_name_0, ast_func_name_1, argc, args);
+				else if (name == PUGIXML_TEXT("namespace-uri") && argc <= 1)
+					return parse_function_helper(ast_func_namespace_uri_0, ast_func_namespace_uri_1, argc, args);
+				else if (name == PUGIXML_TEXT("normalize-space") && argc <= 1)
+					return new (alloc_node()) xpath_ast_node(argc == 0 ? ast_func_normalize_space_0 : ast_func_normalize_space_1, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("not") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_not, xpath_type_boolean, args[0]);
+				else if (name == PUGIXML_TEXT("number") && argc <= 1)
+					return new (alloc_node()) xpath_ast_node(argc == 0 ? ast_func_number_0 : ast_func_number_1, xpath_type_number, args[0]);
+			
+				break;
+			
+			case 'p':
+				if (name == PUGIXML_TEXT("position") && argc == 0)
+					return new (alloc_node()) xpath_ast_node(ast_func_position, xpath_type_number);
+				
+				break;
+			
+			case 'r':
+				if (name == PUGIXML_TEXT("round") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_round, xpath_type_number, args[0]);
+
+				break;
+			
+			case 's':
+				if (name == PUGIXML_TEXT("string") && argc <= 1)
+					return new (alloc_node()) xpath_ast_node(argc == 0 ? ast_func_string_0 : ast_func_string_1, xpath_type_string, args[0]);
+				else if (name == PUGIXML_TEXT("string-length") && argc <= 1)
+					return new (alloc_node()) xpath_ast_node(argc == 0 ? ast_func_string_length_0 : ast_func_string_length_1, xpath_type_string, args[0]);
+				else if (name == PUGIXML_TEXT("starts-with") && argc == 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_starts_with, xpath_type_boolean, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("substring-before") && argc == 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_substring_before, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("substring-after") && argc == 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_substring_after, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("substring") && (argc == 2 || argc == 3))
+					return new (alloc_node()) xpath_ast_node(argc == 2 ? ast_func_substring_2 : ast_func_substring_3, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("sum") && argc == 1)
+				{
+					if (args[0]->rettype() != xpath_type_node_set) throw_error("Function has to be applied to node set");
+					return new (alloc_node()) xpath_ast_node(ast_func_sum, xpath_type_number, args[0]);
+				}
+
+				break;
+			
+			case 't':
+				if (name == PUGIXML_TEXT("translate") && argc == 3)
+					return new (alloc_node()) xpath_ast_node(ast_func_translate, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("true") && argc == 0)
+					return new (alloc_node()) xpath_ast_node(ast_func_true, xpath_type_boolean);
+					
+				break;
+
+			default:
+				break;
+			}
+
+			throw_error("Unrecognized function or wrong parameter count");
+
+			return 0;
+		}
+
+		axis_t parse_axis_name(const xpath_lexer_string& name, bool& specified)
+		{
+			specified = true;
+
+			switch (name.begin[0])
+			{
+			case 'a':
+				if (name == PUGIXML_TEXT("ancestor"))
+					return axis_ancestor;
+				else if (name == PUGIXML_TEXT("ancestor-or-self"))
+					return axis_ancestor_or_self;
+				else if (name == PUGIXML_TEXT("attribute"))
+					return axis_attribute;
+				
+				break;
+			
+			case 'c':
+				if (name == PUGIXML_TEXT("child"))
+					return axis_child;
+				
+				break;
+			
+			case 'd':
+				if (name == PUGIXML_TEXT("descendant"))
+					return axis_descendant;
+				else if (name == PUGIXML_TEXT("descendant-or-self"))
+					return axis_descendant_or_self;
+				
+				break;
+			
+			case 'f':
+				if (name == PUGIXML_TEXT("following"))
+					return axis_following;
+				else if (name == PUGIXML_TEXT("following-sibling"))
+					return axis_following_sibling;
+				
+				break;
+			
+			case 'n':
+				if (name == PUGIXML_TEXT("namespace"))
+					return axis_namespace;
+				
+				break;
+			
+			case 'p':
+				if (name == PUGIXML_TEXT("parent"))
+					return axis_parent;
+				else if (name == PUGIXML_TEXT("preceding"))
+					return axis_preceding;
+				else if (name == PUGIXML_TEXT("preceding-sibling"))
+					return axis_preceding_sibling;
+				
+				break;
+			
+			case 's':
+				if (name == PUGIXML_TEXT("self"))
+					return axis_self;
+				
+				break;
+
+			default:
+				break;
+			}
+
+			specified = false;
+			return axis_child;
+		}
+
+		nodetest_t parse_node_test_type(const xpath_lexer_string& name)
+		{
+			switch (name.begin[0])
+			{
+			case 'c':
+				if (name == PUGIXML_TEXT("comment"))
+					return nodetest_type_comment;
+
+				break;
+
+			case 'n':
+				if (name == PUGIXML_TEXT("node"))
+					return nodetest_type_node;
+
+				break;
+
+			case 'p':
+				if (name == PUGIXML_TEXT("processing-instruction"))
+					return nodetest_type_pi;
+
+				break;
+
+			case 't':
+				if (name == PUGIXML_TEXT("text"))
+					return nodetest_type_text;
+
+				break;
+			
+			default:
+				break;
+			}
+
+			return nodetest_none;
+		}
+
+		// PrimaryExpr ::= VariableReference | '(' Expr ')' | Literal | Number | FunctionCall
+		xpath_ast_node* parse_primary_expression()
+		{
+			switch (_lexer.current())
+			{
+			case lex_var_ref:
+			{
+				xpath_lexer_string name = _lexer.contents();
+
+				if (!_variables)
+					throw_error("Unknown variable: variable set is not provided");
+
+				xpath_variable* var = get_variable(_variables, name.begin, name.end);
+
+				if (!var)
+					throw_error("Unknown variable: variable set does not contain the given name");
+
+				_lexer.next();
+
+				return new (alloc_node()) xpath_ast_node(ast_variable, var->type(), var);
+			}
+
+			case lex_open_brace:
+			{
+				_lexer.next();
+
+				xpath_ast_node* n = parse_expression();
+
+				if (_lexer.current() != lex_close_brace)
+					throw_error("Unmatched braces");
+
+				_lexer.next();
+
+				return n;
+			}
+
+			case lex_quoted_string:
+			{
+				const char_t* value = alloc_string(_lexer.contents());
+
+				xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_string_constant, xpath_type_string, value);
+				_lexer.next();
+
+				return n;
+			}
+
+			case lex_number:
+			{
+				double value = 0;
+
+				if (!convert_string_to_number(_lexer.contents().begin, _lexer.contents().end, &value))
+					throw_error_oom();
+
+				xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_number_constant, xpath_type_number, value);
+				_lexer.next();
+
+				return n;
+			}
+
+			case lex_string:
+			{
+				xpath_ast_node* args[2] = {0};
+				size_t argc = 0;
+				
+				xpath_lexer_string function = _lexer.contents();
+				_lexer.next();
+				
+				xpath_ast_node* last_arg = 0;
+				
+				if (_lexer.current() != lex_open_brace)
+					throw_error("Unrecognized function call");
+				_lexer.next();
+
+				if (_lexer.current() != lex_close_brace)
+					args[argc++] = parse_expression();
+
+				while (_lexer.current() != lex_close_brace)
+				{
+					if (_lexer.current() != lex_comma)
+						throw_error("No comma between function arguments");
+					_lexer.next();
+					
+					xpath_ast_node* n = parse_expression();
+					
+					if (argc < 2) args[argc] = n;
+					else last_arg->set_next(n);
+
+					argc++;
+					last_arg = n;
+				}
+				
+				_lexer.next();
+
+				return parse_function(function, argc, args);
+			}
+
+			default:
+				throw_error("Unrecognizable primary expression");
+
+				return 0;
+			}
+		}
+		
+		// FilterExpr ::= PrimaryExpr | FilterExpr Predicate
+		// Predicate ::= '[' PredicateExpr ']'
+		// PredicateExpr ::= Expr
+		xpath_ast_node* parse_filter_expression()
+		{
+			xpath_ast_node* n = parse_primary_expression();
+
+			while (_lexer.current() == lex_open_square_brace)
+			{
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_expression();
+
+				if (n->rettype() != xpath_type_node_set) throw_error("Predicate has to be applied to node set");
+
+				bool posinv = expr->rettype() != xpath_type_number && expr->is_posinv();
+
+				n = new (alloc_node()) xpath_ast_node(posinv ? ast_filter_posinv : ast_filter, xpath_type_node_set, n, expr);
+
+				if (_lexer.current() != lex_close_square_brace)
+					throw_error("Unmatched square brace");
+			
+				_lexer.next();
+			}
+			
+			return n;
+		}
+		
+		// Step ::= AxisSpecifier NodeTest Predicate* | AbbreviatedStep
+		// AxisSpecifier ::= AxisName '::' | '@'?
+		// NodeTest ::= NameTest | NodeType '(' ')' | 'processing-instruction' '(' Literal ')'
+		// NameTest ::= '*' | NCName ':' '*' | QName
+		// AbbreviatedStep ::= '.' | '..'
+		xpath_ast_node* parse_step(xpath_ast_node* set)
+		{
+			if (set && set->rettype() != xpath_type_node_set)
+				throw_error("Step has to be applied to node set");
+
+			bool axis_specified = false;
+			axis_t axis = axis_child; // implied child axis
+
+			if (_lexer.current() == lex_axis_attribute)
+			{
+				axis = axis_attribute;
+				axis_specified = true;
+				
+				_lexer.next();
+			}
+			else if (_lexer.current() == lex_dot)
+			{
+				_lexer.next();
+				
+				return new (alloc_node()) xpath_ast_node(ast_step, set, axis_self, nodetest_type_node, 0);
+			}
+			else if (_lexer.current() == lex_double_dot)
+			{
+				_lexer.next();
+				
+				return new (alloc_node()) xpath_ast_node(ast_step, set, axis_parent, nodetest_type_node, 0);
+			}
+		
+			nodetest_t nt_type = nodetest_none;
+			xpath_lexer_string nt_name;
+			
+			if (_lexer.current() == lex_string)
+			{
+				// node name test
+				nt_name = _lexer.contents();
+				_lexer.next();
+
+				// was it an axis name?
+				if (_lexer.current() == lex_double_colon)
+				{
+					// parse axis name
+					if (axis_specified) throw_error("Two axis specifiers in one step");
+
+					axis = parse_axis_name(nt_name, axis_specified);
+
+					if (!axis_specified) throw_error("Unknown axis");
+
+					// read actual node test
+					_lexer.next();
+
+					if (_lexer.current() == lex_multiply)
+					{
+						nt_type = nodetest_all;
+						nt_name = xpath_lexer_string();
+						_lexer.next();
+					}
+					else if (_lexer.current() == lex_string)
+					{
+						nt_name = _lexer.contents();
+						_lexer.next();
+					}
+					else throw_error("Unrecognized node test");
+				}
+				
+				if (nt_type == nodetest_none)
+				{
+					// node type test or processing-instruction
+					if (_lexer.current() == lex_open_brace)
+					{
+						_lexer.next();
+						
+						if (_lexer.current() == lex_close_brace)
+						{
+							_lexer.next();
+
+							nt_type = parse_node_test_type(nt_name);
+
+							if (nt_type == nodetest_none) throw_error("Unrecognized node type");
+							
+							nt_name = xpath_lexer_string();
+						}
+						else if (nt_name == PUGIXML_TEXT("processing-instruction"))
+						{
+							if (_lexer.current() != lex_quoted_string)
+								throw_error("Only literals are allowed as arguments to processing-instruction()");
+						
+							nt_type = nodetest_pi;
+							nt_name = _lexer.contents();
+							_lexer.next();
+							
+							if (_lexer.current() != lex_close_brace)
+								throw_error("Unmatched brace near processing-instruction()");
+							_lexer.next();
+						}
+						else
+							throw_error("Unmatched brace near node type test");
+
+					}
+					// QName or NCName:*
+					else
+					{
+						if (nt_name.end - nt_name.begin > 2 && nt_name.end[-2] == ':' && nt_name.end[-1] == '*') // NCName:*
+						{
+							nt_name.end--; // erase *
+							
+							nt_type = nodetest_all_in_namespace;
+						}
+						else nt_type = nodetest_name;
+					}
+				}
+			}
+			else if (_lexer.current() == lex_multiply)
+			{
+				nt_type = nodetest_all;
+				_lexer.next();
+			}
+			else throw_error("Unrecognized node test");
+			
+			xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_step, set, axis, nt_type, alloc_string(nt_name));
+			
+			xpath_ast_node* last = 0;
+			
+			while (_lexer.current() == lex_open_square_brace)
+			{
+				_lexer.next();
+				
+				xpath_ast_node* expr = parse_expression();
+
+				xpath_ast_node* pred = new (alloc_node()) xpath_ast_node(ast_predicate, xpath_type_node_set, expr);
+				
+				if (_lexer.current() != lex_close_square_brace)
+					throw_error("Unmatched square brace");
+				_lexer.next();
+				
+				if (last) last->set_next(pred);
+				else n->set_right(pred);
+				
+				last = pred;
+			}
+			
+			return n;
+		}
+		
+		// RelativeLocationPath ::= Step | RelativeLocationPath '/' Step | RelativeLocationPath '//' Step
+		xpath_ast_node* parse_relative_location_path(xpath_ast_node* set)
+		{
+			xpath_ast_node* n = parse_step(set);
+			
+			while (_lexer.current() == lex_slash || _lexer.current() == lex_double_slash)
+			{
+				lexeme_t l = _lexer.current();
+				_lexer.next();
+
+				if (l == lex_double_slash)
+					n = new (alloc_node()) xpath_ast_node(ast_step, n, axis_descendant_or_self, nodetest_type_node, 0);
+				
+				n = parse_step(n);
+			}
+			
+			return n;
+		}
+		
+		// LocationPath ::= RelativeLocationPath | AbsoluteLocationPath
+		// AbsoluteLocationPath ::= '/' RelativeLocationPath? | '//' RelativeLocationPath
+		xpath_ast_node* parse_location_path()
+		{
+			if (_lexer.current() == lex_slash)
+			{
+				_lexer.next();
+				
+				xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_step_root, xpath_type_node_set);
+
+				// relative location path can start from axis_attribute, dot, double_dot, multiply and string lexemes; any other lexeme means standalone root path
+				lexeme_t l = _lexer.current();
+
+				if (l == lex_string || l == lex_axis_attribute || l == lex_dot || l == lex_double_dot || l == lex_multiply)
+					return parse_relative_location_path(n);
+				else
+					return n;
+			}
+			else if (_lexer.current() == lex_double_slash)
+			{
+				_lexer.next();
+				
+				xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_step_root, xpath_type_node_set);
+				n = new (alloc_node()) xpath_ast_node(ast_step, n, axis_descendant_or_self, nodetest_type_node, 0);
+				
+				return parse_relative_location_path(n);
+			}
+
+			// else clause moved outside of if because of bogus warning 'control may reach end of non-void function being inlined' in gcc 4.0.1
+			return parse_relative_location_path(0);
+		}
+		
+		// PathExpr ::= LocationPath
+		//				| FilterExpr
+		//				| FilterExpr '/' RelativeLocationPath
+		//				| FilterExpr '//' RelativeLocationPath
+		xpath_ast_node* parse_path_expression()
+		{
+			// Clarification.
+			// PathExpr begins with either LocationPath or FilterExpr.
+			// FilterExpr begins with PrimaryExpr
+			// PrimaryExpr begins with '$' in case of it being a variable reference,
+			// '(' in case of it being an expression, string literal, number constant or
+			// function call.
+
+			if (_lexer.current() == lex_var_ref || _lexer.current() == lex_open_brace || 
+				_lexer.current() == lex_quoted_string || _lexer.current() == lex_number ||
+				_lexer.current() == lex_string)
+			{
+				if (_lexer.current() == lex_string)
+				{
+					// This is either a function call, or not - if not, we shall proceed with location path
+					const char_t* state = _lexer.state();
+					
+					while (PUGI__IS_CHARTYPE(*state, ct_space)) ++state;
+					
+					if (*state != '(') return parse_location_path();
+
+					// This looks like a function call; however this still can be a node-test. Check it.
+					if (parse_node_test_type(_lexer.contents()) != nodetest_none) return parse_location_path();
+				}
+				
+				xpath_ast_node* n = parse_filter_expression();
+
+				if (_lexer.current() == lex_slash || _lexer.current() == lex_double_slash)
+				{
+					lexeme_t l = _lexer.current();
+					_lexer.next();
+					
+					if (l == lex_double_slash)
+					{
+						if (n->rettype() != xpath_type_node_set) throw_error("Step has to be applied to node set");
+
+						n = new (alloc_node()) xpath_ast_node(ast_step, n, axis_descendant_or_self, nodetest_type_node, 0);
+					}
+	
+					// select from location path
+					return parse_relative_location_path(n);
+				}
+
+				return n;
+			}
+			else return parse_location_path();
+		}
+
+		// UnionExpr ::= PathExpr | UnionExpr '|' PathExpr
+		xpath_ast_node* parse_union_expression()
+		{
+			xpath_ast_node* n = parse_path_expression();
+
+			while (_lexer.current() == lex_union)
+			{
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_union_expression();
+
+				if (n->rettype() != xpath_type_node_set || expr->rettype() != xpath_type_node_set)
+					throw_error("Union operator has to be applied to node sets");
+
+				n = new (alloc_node()) xpath_ast_node(ast_op_union, xpath_type_node_set, n, expr);
+			}
+
+			return n;
+		}
+
+		// UnaryExpr ::= UnionExpr | '-' UnaryExpr
+		xpath_ast_node* parse_unary_expression()
+		{
+			if (_lexer.current() == lex_minus)
+			{
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_unary_expression();
+
+				return new (alloc_node()) xpath_ast_node(ast_op_negate, xpath_type_number, expr);
+			}
+			else return parse_union_expression();
+		}
+		
+		// MultiplicativeExpr ::= UnaryExpr
+		//						  | MultiplicativeExpr '*' UnaryExpr
+		//						  | MultiplicativeExpr 'div' UnaryExpr
+		//						  | MultiplicativeExpr 'mod' UnaryExpr
+		xpath_ast_node* parse_multiplicative_expression()
+		{
+			xpath_ast_node* n = parse_unary_expression();
+
+			while (_lexer.current() == lex_multiply || (_lexer.current() == lex_string &&
+				   (_lexer.contents() == PUGIXML_TEXT("mod") || _lexer.contents() == PUGIXML_TEXT("div"))))
+			{
+				ast_type_t op = _lexer.current() == lex_multiply ? ast_op_multiply :
+					_lexer.contents().begin[0] == 'd' ? ast_op_divide : ast_op_mod;
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_unary_expression();
+
+				n = new (alloc_node()) xpath_ast_node(op, xpath_type_number, n, expr);
+			}
+
+			return n;
+		}
+
+		// AdditiveExpr ::= MultiplicativeExpr
+		//					| AdditiveExpr '+' MultiplicativeExpr
+		//					| AdditiveExpr '-' MultiplicativeExpr
+		xpath_ast_node* parse_additive_expression()
+		{
+			xpath_ast_node* n = parse_multiplicative_expression();
+
+			while (_lexer.current() == lex_plus || _lexer.current() == lex_minus)
+			{
+				lexeme_t l = _lexer.current();
+
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_multiplicative_expression();
+
+				n = new (alloc_node()) xpath_ast_node(l == lex_plus ? ast_op_add : ast_op_subtract, xpath_type_number, n, expr);
+			}
+
+			return n;
+		}
+
+		// RelationalExpr ::= AdditiveExpr
+		//					  | RelationalExpr '<' AdditiveExpr
+		//					  | RelationalExpr '>' AdditiveExpr
+		//					  | RelationalExpr '<=' AdditiveExpr
+		//					  | RelationalExpr '>=' AdditiveExpr
+		xpath_ast_node* parse_relational_expression()
+		{
+			xpath_ast_node* n = parse_additive_expression();
+
+			while (_lexer.current() == lex_less || _lexer.current() == lex_less_or_equal || 
+				   _lexer.current() == lex_greater || _lexer.current() == lex_greater_or_equal)
+			{
+				lexeme_t l = _lexer.current();
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_additive_expression();
+
+				n = new (alloc_node()) xpath_ast_node(l == lex_less ? ast_op_less : l == lex_greater ? ast_op_greater :
+								l == lex_less_or_equal ? ast_op_less_or_equal : ast_op_greater_or_equal, xpath_type_boolean, n, expr);
+			}
+
+			return n;
+		}
+		
+		// EqualityExpr ::= RelationalExpr
+		//					| EqualityExpr '=' RelationalExpr
+		//					| EqualityExpr '!=' RelationalExpr
+		xpath_ast_node* parse_equality_expression()
+		{
+			xpath_ast_node* n = parse_relational_expression();
+
+			while (_lexer.current() == lex_equal || _lexer.current() == lex_not_equal)
+			{
+				lexeme_t l = _lexer.current();
+
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_relational_expression();
+
+				n = new (alloc_node()) xpath_ast_node(l == lex_equal ? ast_op_equal : ast_op_not_equal, xpath_type_boolean, n, expr);
+			}
+
+			return n;
+		}
+		
+		// AndExpr ::= EqualityExpr | AndExpr 'and' EqualityExpr
+		xpath_ast_node* parse_and_expression()
+		{
+			xpath_ast_node* n = parse_equality_expression();
+
+			while (_lexer.current() == lex_string && _lexer.contents() == PUGIXML_TEXT("and"))
+			{
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_equality_expression();
+
+				n = new (alloc_node()) xpath_ast_node(ast_op_and, xpath_type_boolean, n, expr);
+			}
+
+			return n;
+		}
+
+		// OrExpr ::= AndExpr | OrExpr 'or' AndExpr
+		xpath_ast_node* parse_or_expression()
+		{
+			xpath_ast_node* n = parse_and_expression();
+
+			while (_lexer.current() == lex_string && _lexer.contents() == PUGIXML_TEXT("or"))
+			{
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_and_expression();
+
+				n = new (alloc_node()) xpath_ast_node(ast_op_or, xpath_type_boolean, n, expr);
+			}
+
+			return n;
+		}
+		
+		// Expr ::= OrExpr
+		xpath_ast_node* parse_expression()
+		{
+			return parse_or_expression();
+		}
+
+		xpath_parser(const char_t* query, xpath_variable_set* variables, xpath_allocator* alloc, xpath_parse_result* result): _alloc(alloc), _lexer(query), _query(query), _variables(variables), _result(result)
+		{
+		}
+
+		xpath_ast_node* parse()
+		{
+			xpath_ast_node* result = parse_expression();
+			
+			if (_lexer.current() != lex_eof)
+			{
+				// there are still unparsed tokens left, error
+				throw_error("Incorrect query");
+			}
+			
+			return result;
+		}
+
+		static xpath_ast_node* parse(const char_t* query, xpath_variable_set* variables, xpath_allocator* alloc, xpath_parse_result* result)
+		{
+			xpath_parser parser(query, variables, alloc, result);
+
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			int error = setjmp(parser._error_handler);
+
+			return (error == 0) ? parser.parse() : 0;
+		#else
+			return parser.parse();
+		#endif
+		}
+	};
+
+	struct xpath_query_impl
+	{
+		static xpath_query_impl* create()
+		{
+			void* memory = xml_memory::allocate(sizeof(xpath_query_impl));
+
+			return new (memory) xpath_query_impl();
+		}
+
+		static void destroy(void* ptr)
+		{
+			if (!ptr) return;
+			
+			// free all allocated pages
+			static_cast<xpath_query_impl*>(ptr)->alloc.release();
+
+			// free allocator memory (with the first page)
+			xml_memory::deallocate(ptr);
+		}
+
+		xpath_query_impl(): root(0), alloc(&block)
+		{
+			block.next = 0;
+		}
+
+		xpath_ast_node* root;
+		xpath_allocator alloc;
+		xpath_memory_block block;
+	};
+
+	PUGI__FN xpath_string evaluate_string_impl(xpath_query_impl* impl, const xpath_node& n, xpath_stack_data& sd)
+	{
+		if (!impl) return xpath_string();
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return xpath_string();
+	#endif
+
+		xpath_context c(n, 1, 1);
+
+		return impl->root->eval_string(c, sd.stack);
+	}
+PUGI__NS_END
+
+namespace pugi
+{
+#ifndef PUGIXML_NO_EXCEPTIONS
+	PUGI__FN xpath_exception::xpath_exception(const xpath_parse_result& result_): _result(result_)
+	{
+		assert(_result.error);
+	}
+	
+	PUGI__FN const char* xpath_exception::what() const throw()
+	{
+		return _result.error;
+	}
+
+	PUGI__FN const xpath_parse_result& xpath_exception::result() const
+	{
+		return _result;
+	}
+#endif
+	
+	PUGI__FN xpath_node::xpath_node()
+	{
+	}
+		
+	PUGI__FN xpath_node::xpath_node(const xml_node& node_): _node(node_)
+	{
+	}
+		
+	PUGI__FN xpath_node::xpath_node(const xml_attribute& attribute_, const xml_node& parent_): _node(attribute_ ? parent_ : xml_node()), _attribute(attribute_)
+	{
+	}
+
+	PUGI__FN xml_node xpath_node::node() const
+	{
+		return _attribute ? xml_node() : _node;
+	}
+		
+	PUGI__FN xml_attribute xpath_node::attribute() const
+	{
+		return _attribute;
+	}
+	
+	PUGI__FN xml_node xpath_node::parent() const
+	{
+		return _attribute ? _node : _node.parent();
+	}
+
+	PUGI__FN static void unspecified_bool_xpath_node(xpath_node***)
+	{
+	}
+
+	PUGI__FN xpath_node::operator xpath_node::unspecified_bool_type() const
+	{
+		return (_node || _attribute) ? unspecified_bool_xpath_node : 0;
+	}
+	
+	PUGI__FN bool xpath_node::operator!() const
+	{
+		return !(_node || _attribute);
+	}
+
+	PUGI__FN bool xpath_node::operator==(const xpath_node& n) const
+	{
+		return _node == n._node && _attribute == n._attribute;
+	}
+	
+	PUGI__FN bool xpath_node::operator!=(const xpath_node& n) const
+	{
+		return _node != n._node || _attribute != n._attribute;
+	}
+
+#ifdef __BORLANDC__
+	PUGI__FN bool operator&&(const xpath_node& lhs, bool rhs)
+	{
+		return (bool)lhs && rhs;
+	}
+
+	PUGI__FN bool operator||(const xpath_node& lhs, bool rhs)
+	{
+		return (bool)lhs || rhs;
+	}
+#endif
+
+	PUGI__FN void xpath_node_set::_assign(const_iterator begin_, const_iterator end_)
+	{
+		assert(begin_ <= end_);
+
+		size_t size_ = static_cast<size_t>(end_ - begin_);
+
+		if (size_ <= 1)
+		{
+			// deallocate old buffer
+			if (_begin != &_storage) impl::xml_memory::deallocate(_begin);
+
+			// use internal buffer
+			if (begin_ != end_) _storage = *begin_;
+
+			_begin = &_storage;
+			_end = &_storage + size_;
+		}
+		else
+		{
+			// make heap copy
+			xpath_node* storage = static_cast<xpath_node*>(impl::xml_memory::allocate(size_ * sizeof(xpath_node)));
+
+			if (!storage)
+			{
+			#ifdef PUGIXML_NO_EXCEPTIONS
+				return;
+			#else
+				throw std::bad_alloc();
+			#endif
+			}
+
+			memcpy(storage, begin_, size_ * sizeof(xpath_node));
+			
+			// deallocate old buffer
+			if (_begin != &_storage) impl::xml_memory::deallocate(_begin);
+
+			// finalize
+			_begin = storage;
+			_end = storage + size_;
+		}
+	}
+
+	PUGI__FN xpath_node_set::xpath_node_set(): _type(type_unsorted), _begin(&_storage), _end(&_storage)
+	{
+	}
+
+	PUGI__FN xpath_node_set::xpath_node_set(const_iterator begin_, const_iterator end_, type_t type_): _type(type_), _begin(&_storage), _end(&_storage)
+	{
+		_assign(begin_, end_);
+	}
+
+	PUGI__FN xpath_node_set::~xpath_node_set()
+	{
+		if (_begin != &_storage) impl::xml_memory::deallocate(_begin);
+	}
+		
+	PUGI__FN xpath_node_set::xpath_node_set(const xpath_node_set& ns): _type(ns._type), _begin(&_storage), _end(&_storage)
+	{
+		_assign(ns._begin, ns._end);
+	}
+	
+	PUGI__FN xpath_node_set& xpath_node_set::operator=(const xpath_node_set& ns)
+	{
+		if (this == &ns) return *this;
+		
+		_type = ns._type;
+		_assign(ns._begin, ns._end);
+
+		return *this;
+	}
+
+	PUGI__FN xpath_node_set::type_t xpath_node_set::type() const
+	{
+		return _type;
+	}
+		
+	PUGI__FN size_t xpath_node_set::size() const
+	{
+		return _end - _begin;
+	}
+		
+	PUGI__FN bool xpath_node_set::empty() const
+	{
+		return _begin == _end;
+	}
+		
+	PUGI__FN const xpath_node& xpath_node_set::operator[](size_t index) const
+	{
+		assert(index < size());
+		return _begin[index];
+	}
+
+	PUGI__FN xpath_node_set::const_iterator xpath_node_set::begin() const
+	{
+		return _begin;
+	}
+		
+	PUGI__FN xpath_node_set::const_iterator xpath_node_set::end() const
+	{
+		return _end;
+	}
+	
+	PUGI__FN void xpath_node_set::sort(bool reverse)
+	{
+		_type = impl::xpath_sort(_begin, _end, _type, reverse);
+	}
+
+	PUGI__FN xpath_node xpath_node_set::first() const
+	{
+		return impl::xpath_first(_begin, _end, _type);
+	}
+
+	PUGI__FN xpath_parse_result::xpath_parse_result(): error("Internal error"), offset(0)
+	{
+	}
+
+	PUGI__FN xpath_parse_result::operator bool() const
+	{
+		return error == 0;
+	}
+
+	PUGI__FN const char* xpath_parse_result::description() const
+	{
+		return error ? error : "No error";
+	}
+
+	PUGI__FN xpath_variable::xpath_variable()
+	{
+	}
+
+	PUGI__FN const char_t* xpath_variable::name() const
+	{
+		switch (_type)
+		{
+		case xpath_type_node_set:
+			return static_cast<const impl::xpath_variable_node_set*>(this)->name;
+
+		case xpath_type_number:
+			return static_cast<const impl::xpath_variable_number*>(this)->name;
+
+		case xpath_type_string:
+			return static_cast<const impl::xpath_variable_string*>(this)->name;
+
+		case xpath_type_boolean:
+			return static_cast<const impl::xpath_variable_boolean*>(this)->name;
+
+		default:
+			assert(!"Invalid variable type");
+			return 0;
+		}
+	}
+
+	PUGI__FN xpath_value_type xpath_variable::type() const
+	{
+		return _type;
+	}
+
+	PUGI__FN bool xpath_variable::get_boolean() const
+	{
+		return (_type == xpath_type_boolean) ? static_cast<const impl::xpath_variable_boolean*>(this)->value : false;
+	}
+
+	PUGI__FN double xpath_variable::get_number() const
+	{
+		return (_type == xpath_type_number) ? static_cast<const impl::xpath_variable_number*>(this)->value : impl::gen_nan();
+	}
+
+	PUGI__FN const char_t* xpath_variable::get_string() const
+	{
+		const char_t* value = (_type == xpath_type_string) ? static_cast<const impl::xpath_variable_string*>(this)->value : 0;
+		return value ? value : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const xpath_node_set& xpath_variable::get_node_set() const
+	{
+		return (_type == xpath_type_node_set) ? static_cast<const impl::xpath_variable_node_set*>(this)->value : impl::dummy_node_set;
+	}
+
+	PUGI__FN bool xpath_variable::set(bool value)
+	{
+		if (_type != xpath_type_boolean) return false;
+
+		static_cast<impl::xpath_variable_boolean*>(this)->value = value;
+		return true;
+	}
+
+	PUGI__FN bool xpath_variable::set(double value)
+	{
+		if (_type != xpath_type_number) return false;
+
+		static_cast<impl::xpath_variable_number*>(this)->value = value;
+		return true;
+	}
+
+	PUGI__FN bool xpath_variable::set(const char_t* value)
+	{
+		if (_type != xpath_type_string) return false;
+
+		impl::xpath_variable_string* var = static_cast<impl::xpath_variable_string*>(this);
+
+		// duplicate string
+		size_t size = (impl::strlength(value) + 1) * sizeof(char_t);
+
+		char_t* copy = static_cast<char_t*>(impl::xml_memory::allocate(size));
+		if (!copy) return false;
+
+		memcpy(copy, value, size);
+
+		// replace old string
+		if (var->value) impl::xml_memory::deallocate(var->value);
+		var->value = copy;
+
+		return true;
+	}
+
+	PUGI__FN bool xpath_variable::set(const xpath_node_set& value)
+	{
+		if (_type != xpath_type_node_set) return false;
+
+		static_cast<impl::xpath_variable_node_set*>(this)->value = value;
+		return true;
+	}
+
+	PUGI__FN xpath_variable_set::xpath_variable_set()
+	{
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i) _data[i] = 0;
+	}
+
+	PUGI__FN xpath_variable_set::~xpath_variable_set()
+	{
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i)
+		{
+			xpath_variable* var = _data[i];
+
+			while (var)
+			{
+				xpath_variable* next = var->_next;
+
+				impl::delete_xpath_variable(var->_type, var);
+
+				var = next;
+			}
+		}
+	}
+
+	PUGI__FN xpath_variable* xpath_variable_set::find(const char_t* name) const
+	{
+		const size_t hash_size = sizeof(_data) / sizeof(_data[0]);
+		size_t hash = impl::hash_string(name) % hash_size;
+
+		// look for existing variable
+		for (xpath_variable* var = _data[hash]; var; var = var->_next)
+			if (impl::strequal(var->name(), name))
+				return var;
+
+		return 0;
+	}
+
+	PUGI__FN xpath_variable* xpath_variable_set::add(const char_t* name, xpath_value_type type)
+	{
+		const size_t hash_size = sizeof(_data) / sizeof(_data[0]);
+		size_t hash = impl::hash_string(name) % hash_size;
+
+		// look for existing variable
+		for (xpath_variable* var = _data[hash]; var; var = var->_next)
+			if (impl::strequal(var->name(), name))
+				return var->type() == type ? var : 0;
+
+		// add new variable
+		xpath_variable* result = impl::new_xpath_variable(type, name);
+
+		if (result)
+		{
+			result->_type = type;
+			result->_next = _data[hash];
+
+			_data[hash] = result;
+		}
+
+		return result;
+	}
+
+	PUGI__FN bool xpath_variable_set::set(const char_t* name, bool value)
+	{
+		xpath_variable* var = add(name, xpath_type_boolean);
+		return var ? var->set(value) : false;
+	}
+
+	PUGI__FN bool xpath_variable_set::set(const char_t* name, double value)
+	{
+		xpath_variable* var = add(name, xpath_type_number);
+		return var ? var->set(value) : false;
+	}
+
+	PUGI__FN bool xpath_variable_set::set(const char_t* name, const char_t* value)
+	{
+		xpath_variable* var = add(name, xpath_type_string);
+		return var ? var->set(value) : false;
+	}
+
+	PUGI__FN bool xpath_variable_set::set(const char_t* name, const xpath_node_set& value)
+	{
+		xpath_variable* var = add(name, xpath_type_node_set);
+		return var ? var->set(value) : false;
+	}
+
+	PUGI__FN xpath_variable* xpath_variable_set::get(const char_t* name)
+	{
+		return find(name);
+	}
+
+	PUGI__FN const xpath_variable* xpath_variable_set::get(const char_t* name) const
+	{
+		return find(name);
+	}
+
+	PUGI__FN xpath_query::xpath_query(const char_t* query, xpath_variable_set* variables): _impl(0)
+	{
+		impl::xpath_query_impl* qimpl = impl::xpath_query_impl::create();
+
+		if (!qimpl)
+		{
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			_result.error = "Out of memory";
+		#else
+			throw std::bad_alloc();
+		#endif
+		}
+		else
+		{
+			impl::buffer_holder impl_holder(qimpl, impl::xpath_query_impl::destroy);
+
+			qimpl->root = impl::xpath_parser::parse(query, variables, &qimpl->alloc, &_result);
+
+			if (qimpl->root)
+			{
+				_impl = static_cast<impl::xpath_query_impl*>(impl_holder.release());
+				_result.error = 0;
+			}
+		}
+	}
+
+	PUGI__FN xpath_query::~xpath_query()
+	{
+		impl::xpath_query_impl::destroy(_impl);
+	}
+
+	PUGI__FN xpath_value_type xpath_query::return_type() const
+	{
+		if (!_impl) return xpath_type_none;
+
+		return static_cast<impl::xpath_query_impl*>(_impl)->root->rettype();
+	}
+
+	PUGI__FN bool xpath_query::evaluate_boolean(const xpath_node& n) const
+	{
+		if (!_impl) return false;
+		
+		impl::xpath_context c(n, 1, 1);
+		impl::xpath_stack_data sd;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return false;
+	#endif
+		
+		return static_cast<impl::xpath_query_impl*>(_impl)->root->eval_boolean(c, sd.stack);
+	}
+	
+	PUGI__FN double xpath_query::evaluate_number(const xpath_node& n) const
+	{
+		if (!_impl) return impl::gen_nan();
+		
+		impl::xpath_context c(n, 1, 1);
+		impl::xpath_stack_data sd;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return impl::gen_nan();
+	#endif
+
+		return static_cast<impl::xpath_query_impl*>(_impl)->root->eval_number(c, sd.stack);
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN string_t xpath_query::evaluate_string(const xpath_node& n) const
+	{
+		impl::xpath_stack_data sd;
+
+		return impl::evaluate_string_impl(static_cast<impl::xpath_query_impl*>(_impl), n, sd).c_str();
+	}
+#endif
+
+	PUGI__FN size_t xpath_query::evaluate_string(char_t* buffer, size_t capacity, const xpath_node& n) const
+	{
+		impl::xpath_stack_data sd;
+
+		impl::xpath_string r = impl::evaluate_string_impl(static_cast<impl::xpath_query_impl*>(_impl), n, sd);
+
+		size_t full_size = r.length() + 1;
+		
+		if (capacity > 0)
+		{
+			size_t size = (full_size < capacity) ? full_size : capacity;
+			assert(size > 0);
+
+			memcpy(buffer, r.c_str(), (size - 1) * sizeof(char_t));
+			buffer[size - 1] = 0;
+		}
+		
+		return full_size;
+	}
+
+	PUGI__FN xpath_node_set xpath_query::evaluate_node_set(const xpath_node& n) const
+	{
+		if (!_impl) return xpath_node_set();
+
+		impl::xpath_ast_node* root = static_cast<impl::xpath_query_impl*>(_impl)->root;
+
+		if (root->rettype() != xpath_type_node_set)
+		{
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			return xpath_node_set();
+		#else
+			xpath_parse_result res;
+			res.error = "Expression does not evaluate to node set";
+
+			throw xpath_exception(res);
+		#endif
+		}
+		
+		impl::xpath_context c(n, 1, 1);
+		impl::xpath_stack_data sd;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return xpath_node_set();
+	#endif
+
+		impl::xpath_node_set_raw r = root->eval_node_set(c, sd.stack);
+
+		return xpath_node_set(r.begin(), r.end(), r.type());
+	}
+
+	PUGI__FN const xpath_parse_result& xpath_query::result() const
+	{
+		return _result;
+	}
+
+	PUGI__FN static void unspecified_bool_xpath_query(xpath_query***)
+	{
+	}
+
+	PUGI__FN xpath_query::operator xpath_query::unspecified_bool_type() const
+	{
+		return _impl ? unspecified_bool_xpath_query : 0;
+	}
+
+	PUGI__FN bool xpath_query::operator!() const
+	{
+		return !_impl;
+	}
+
+	PUGI__FN xpath_node xml_node::select_single_node(const char_t* query, xpath_variable_set* variables) const
+	{
+		xpath_query q(query, variables);
+		return select_single_node(q);
+	}
+
+	PUGI__FN xpath_node xml_node::select_single_node(const xpath_query& query) const
+	{
+		xpath_node_set s = query.evaluate_node_set(*this);
+		return s.empty() ? xpath_node() : s.first();
+	}
+
+	PUGI__FN xpath_node_set xml_node::select_nodes(const char_t* query, xpath_variable_set* variables) const
+	{
+		xpath_query q(query, variables);
+		return select_nodes(q);
+	}
+
+	PUGI__FN xpath_node_set xml_node::select_nodes(const xpath_query& query) const
+	{
+		return query.evaluate_node_set(*this);
+	}
+}
+
+#endif
+
+#ifdef __BORLANDC__
+#	pragma option pop
+#endif
+
+// Intel C++ does not properly keep warning state for function templates,
+// so popping warning state at the end of translation unit leads to warnings in the middle.
+#if defined(_MSC_VER) && !defined(__INTEL_COMPILER)
+#	pragma warning(pop)
+#endif
+
+// Undefine all local macros (makes sure we're not leaking macros in header-only mode)
+#undef PUGI__NO_INLINE
+#undef PUGI__STATIC_ASSERT
+#undef PUGI__DMC_VOLATILE
+#undef PUGI__MSVC_CRT_VERSION
+#undef PUGI__NS_BEGIN
+#undef PUGI__NS_END
+#undef PUGI__FN
+#undef PUGI__FN_NO_INLINE
+#undef PUGI__IS_CHARTYPE_IMPL
+#undef PUGI__IS_CHARTYPE
+#undef PUGI__IS_CHARTYPEX
+#undef PUGI__SKIPWS
+#undef PUGI__OPTSET
+#undef PUGI__PUSHNODE
+#undef PUGI__POPNODE
+#undef PUGI__SCANFOR
+#undef PUGI__SCANWHILE
+#undef PUGI__ENDSEG
+#undef PUGI__THROW_ERROR
+#undef PUGI__CHECK_ERROR
+
+#endif
+
+/**
+ * Copyright (c) 2006-2012 Arseny Kapoulkine
+ *
+ * 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.
+ */
diff --git a/dolfin/io/pugixml.hpp b/dolfin/io/pugixml.hpp
new file mode 100644
index 0000000..77b4dcf
--- /dev/null
+++ b/dolfin/io/pugixml.hpp
@@ -0,0 +1,1265 @@
+/**
+ * pugixml parser - version 1.2
+ * --------------------------------------------------------
+ * Copyright (C) 2006-2012, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
+ * Report bugs and download new versions at http://pugixml.org/
+ *
+ * This library is distributed under the MIT License. See notice at the end
+ * of this file.
+ *
+ * This work is based on the pugxml parser, which is:
+ * Copyright (C) 2003, by Kristen Wegner (kristen@tima.net)
+ */
+
+#ifndef PUGIXML_VERSION
+// Define version macro; evaluates to major * 100 + minor so that it's safe to use in less-than comparisons
+#	define PUGIXML_VERSION 120
+#endif
+
+// Include user configuration file (this can define various configuration macros)
+#include "pugiconfig.hpp"
+
+#ifndef HEADER_PUGIXML_HPP
+#define HEADER_PUGIXML_HPP
+
+// Include stddef.h for size_t and ptrdiff_t
+#include <stddef.h>
+
+// Include exception header for XPath
+#if !defined(PUGIXML_NO_XPATH) && !defined(PUGIXML_NO_EXCEPTIONS)
+#	include <exception>
+#endif
+
+// Include STL headers
+#ifndef PUGIXML_NO_STL
+#	include <iterator>
+#	include <iosfwd>
+#	include <string>
+#endif
+
+// Macro for deprecated features
+#ifndef PUGIXML_DEPRECATED
+#	if defined(__GNUC__)
+#		define PUGIXML_DEPRECATED __attribute__((deprecated))
+#	elif defined(_MSC_VER) && _MSC_VER >= 1300
+#		define PUGIXML_DEPRECATED __declspec(deprecated)
+#	else
+#		define PUGIXML_DEPRECATED
+#	endif
+#endif
+
+// If no API is defined, assume default
+#ifndef PUGIXML_API
+#	define PUGIXML_API
+#endif
+
+// If no API for classes is defined, assume default
+#ifndef PUGIXML_CLASS
+#	define PUGIXML_CLASS PUGIXML_API
+#endif
+
+// If no API for functions is defined, assume default
+#ifndef PUGIXML_FUNCTION
+#	define PUGIXML_FUNCTION PUGIXML_API
+#endif
+
+// Character interface macros
+#ifdef PUGIXML_WCHAR_MODE
+#	define PUGIXML_TEXT(t) L ## t
+#	define PUGIXML_CHAR wchar_t
+#else
+#	define PUGIXML_TEXT(t) t
+#	define PUGIXML_CHAR char
+#endif
+
+namespace pugi
+{
+	// Character type used for all internal storage and operations; depends on PUGIXML_WCHAR_MODE
+	typedef PUGIXML_CHAR char_t;
+
+#ifndef PUGIXML_NO_STL
+	// String type used for operations that work with STL string; depends on PUGIXML_WCHAR_MODE
+	typedef std::basic_string<PUGIXML_CHAR, std::char_traits<PUGIXML_CHAR>, std::allocator<PUGIXML_CHAR> > string_t;
+#endif
+}
+
+// The PugiXML namespace
+namespace pugi
+{
+	// Tree node types
+	enum xml_node_type
+	{
+		node_null,			// Empty (null) node handle
+		node_document,		// A document tree's absolute root
+		node_element,		// Element tag, i.e. '<node/>'
+		node_pcdata,		// Plain character data, i.e. 'text'
+		node_cdata,			// Character data, i.e. '<![CDATA[text]]>'
+		node_comment,		// Comment tag, i.e. '<!-- text -->'
+		node_pi,			// Processing instruction, i.e. '<?name?>'
+		node_declaration,	// Document declaration, i.e. '<?xml version="1.0"?>'
+		node_doctype		// Document type declaration, i.e. '<!DOCTYPE doc>'
+	};
+
+	// Parsing options
+
+	// Minimal parsing mode (equivalent to turning all other flags off).
+	// Only elements and PCDATA sections are added to the DOM tree, no text conversions are performed.
+	const unsigned int parse_minimal = 0x0000;
+
+	// This flag determines if processing instructions (node_pi) are added to the DOM tree. This flag is off by default.
+	const unsigned int parse_pi = 0x0001;
+
+	// This flag determines if comments (node_comment) are added to the DOM tree. This flag is off by default.
+	const unsigned int parse_comments = 0x0002;
+
+	// This flag determines if CDATA sections (node_cdata) are added to the DOM tree. This flag is on by default.
+	const unsigned int parse_cdata = 0x0004;
+
+	// This flag determines if plain character data (node_pcdata) that consist only of whitespace are added to the DOM tree.
+	// This flag is off by default; turning it on usually results in slower parsing and more memory consumption.
+	const unsigned int parse_ws_pcdata = 0x0008;
+
+	// This flag determines if character and entity references are expanded during parsing. This flag is on by default.
+	const unsigned int parse_escapes = 0x0010;
+
+	// This flag determines if EOL characters are normalized (converted to #xA) during parsing. This flag is on by default.
+	const unsigned int parse_eol = 0x0020;
+	
+	// This flag determines if attribute values are normalized using CDATA normalization rules during parsing. This flag is on by default.
+	const unsigned int parse_wconv_attribute = 0x0040;
+
+	// This flag determines if attribute values are normalized using NMTOKENS normalization rules during parsing. This flag is off by default.
+	const unsigned int parse_wnorm_attribute = 0x0080;
+	
+	// This flag determines if document declaration (node_declaration) is added to the DOM tree. This flag is off by default.
+	const unsigned int parse_declaration = 0x0100;
+
+	// This flag determines if document type declaration (node_doctype) is added to the DOM tree. This flag is off by default.
+	const unsigned int parse_doctype = 0x0200;
+
+	// This flag determines if plain character data (node_pcdata) that is the only child of the parent node and that consists only
+	// of whitespace is added to the DOM tree.
+	// This flag is off by default; turning it on may result in slower parsing and more memory consumption.
+	const unsigned int parse_ws_pcdata_single = 0x0400;
+
+	// The default parsing mode.
+	// Elements, PCDATA and CDATA sections are added to the DOM tree, character/reference entities are expanded,
+	// End-of-Line characters are normalized, attribute values are normalized using CDATA normalization rules.
+	const unsigned int parse_default = parse_cdata | parse_escapes | parse_wconv_attribute | parse_eol;
+
+	// The full parsing mode.
+	// Nodes of all types are added to the DOM tree, character/reference entities are expanded,
+	// End-of-Line characters are normalized, attribute values are normalized using CDATA normalization rules.
+	const unsigned int parse_full = parse_default | parse_pi | parse_comments | parse_declaration | parse_doctype;
+
+	// These flags determine the encoding of input data for XML document
+	enum xml_encoding
+	{
+		encoding_auto,		// Auto-detect input encoding using BOM or < / <? detection; use UTF8 if BOM is not found
+		encoding_utf8,		// UTF8 encoding
+		encoding_utf16_le,	// Little-endian UTF16
+		encoding_utf16_be,	// Big-endian UTF16
+		encoding_utf16,		// UTF16 with native endianness
+		encoding_utf32_le,	// Little-endian UTF32
+		encoding_utf32_be,	// Big-endian UTF32
+		encoding_utf32,		// UTF32 with native endianness
+		encoding_wchar,		// The same encoding wchar_t has (either UTF16 or UTF32)
+		encoding_latin1
+	};
+
+	// Formatting flags
+	
+	// Indent the nodes that are written to output stream with as many indentation strings as deep the node is in DOM tree. This flag is on by default.
+	const unsigned int format_indent = 0x01;
+	
+	// Write encoding-specific BOM to the output stream. This flag is off by default.
+	const unsigned int format_write_bom = 0x02;
+
+	// Use raw output mode (no indentation and no line breaks are written). This flag is off by default.
+	const unsigned int format_raw = 0x04;
+	
+	// Omit default XML declaration even if there is no declaration in the document. This flag is off by default.
+	const unsigned int format_no_declaration = 0x08;
+
+	// Don't escape attribute values and PCDATA contents. This flag is off by default.
+	const unsigned int format_no_escapes = 0x10;
+
+	// Open file using text mode in xml_document::save_file. This enables special character (i.e. new-line) conversions on some systems. This flag is off by default.
+	const unsigned int format_save_file_text = 0x20;
+
+	// The default set of formatting flags.
+	// Nodes are indented depending on their depth in DOM tree, a default declaration is output if document has none.
+	const unsigned int format_default = format_indent;
+		
+	// Forward declarations
+	struct xml_attribute_struct;
+	struct xml_node_struct;
+
+	class xml_node_iterator;
+	class xml_attribute_iterator;
+	class xml_named_node_iterator;
+
+	class xml_tree_walker;
+
+	class xml_node;
+
+	class xml_text;
+	
+	#ifndef PUGIXML_NO_XPATH
+	class xpath_node;
+	class xpath_node_set;
+	class xpath_query;
+	class xpath_variable_set;
+	#endif
+
+	// Range-based for loop support
+	template <typename It> class xml_object_range
+	{
+	public:
+		typedef It const_iterator;
+
+		xml_object_range(It b, It e): _begin(b), _end(e)
+		{
+		}
+
+		It begin() const { return _begin; }
+		It end() const { return _end; }
+
+	private:
+		It _begin, _end;
+	};
+
+	// Writer interface for node printing (see xml_node::print)
+	class PUGIXML_CLASS xml_writer
+	{
+	public:
+		virtual ~xml_writer() {}
+
+		// Write memory chunk into stream/file/whatever
+		virtual void write(const void* data, size_t size) = 0;
+	};
+
+	// xml_writer implementation for FILE*
+	class PUGIXML_CLASS xml_writer_file: public xml_writer
+	{
+	public:
+		// Construct writer from a FILE* object; void* is used to avoid header dependencies on stdio
+		xml_writer_file(void* file);
+
+		virtual void write(const void* data, size_t size);
+
+	private:
+		void* file;
+	};
+
+	#ifndef PUGIXML_NO_STL
+	// xml_writer implementation for streams
+	class PUGIXML_CLASS xml_writer_stream: public xml_writer
+	{
+	public:
+		// Construct writer from an output stream object
+		xml_writer_stream(std::basic_ostream<char, std::char_traits<char> >& stream);
+		xml_writer_stream(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream);
+
+		virtual void write(const void* data, size_t size);
+
+	private:
+		std::basic_ostream<char, std::char_traits<char> >* narrow_stream;
+		std::basic_ostream<wchar_t, std::char_traits<wchar_t> >* wide_stream;
+	};
+	#endif
+
+	// A light-weight handle for manipulating attributes in DOM tree
+	class PUGIXML_CLASS xml_attribute
+	{
+		friend class xml_attribute_iterator;
+		friend class xml_node;
+
+	private:
+		xml_attribute_struct* _attr;
+	
+		typedef void (*unspecified_bool_type)(xml_attribute***);
+
+	public:
+		// Default constructor. Constructs an empty attribute.
+		xml_attribute();
+		
+		// Constructs attribute from internal pointer
+		explicit xml_attribute(xml_attribute_struct* attr);
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+
+		// Borland C++ workaround
+		bool operator!() const;
+
+		// Comparison operators (compares wrapped attribute pointers)
+		bool operator==(const xml_attribute& r) const;
+		bool operator!=(const xml_attribute& r) const;
+		bool operator<(const xml_attribute& r) const;
+		bool operator>(const xml_attribute& r) const;
+		bool operator<=(const xml_attribute& r) const;
+		bool operator>=(const xml_attribute& r) const;
+
+		// Check if attribute is empty
+		bool empty() const;
+
+		// Get attribute name/value, or "" if attribute is empty
+		const char_t* name() const;
+		const char_t* value() const;
+
+		// Get attribute value, or the default value if attribute is empty
+		const char_t* as_string(const char_t* def = PUGIXML_TEXT("")) const;
+
+		// Get attribute value as a number, or the default value if conversion did not succeed or attribute is empty
+		int as_int(int def = 0) const;
+		unsigned int as_uint(unsigned int def = 0) const;
+		double as_double(double def = 0) const;
+		float as_float(float def = 0) const;
+
+		// Get attribute value as bool (returns true if first character is in '1tTyY' set), or the default value if attribute is empty
+		bool as_bool(bool def = false) const;
+
+		// Set attribute name/value (returns false if attribute is empty or there is not enough memory)
+		bool set_name(const char_t* rhs);
+		bool set_value(const char_t* rhs);
+
+		// Set attribute value with type conversion (numbers are converted to strings, boolean is converted to "true"/"false")
+		bool set_value(int rhs);
+		bool set_value(unsigned int rhs);
+		bool set_value(double rhs);
+		bool set_value(bool rhs);
+
+		// Set attribute value (equivalent to set_value without error checking)
+		xml_attribute& operator=(const char_t* rhs);
+		xml_attribute& operator=(int rhs);
+		xml_attribute& operator=(unsigned int rhs);
+		xml_attribute& operator=(double rhs);
+		xml_attribute& operator=(bool rhs);
+
+		// Get next/previous attribute in the attribute list of the parent node
+		xml_attribute next_attribute() const;
+		xml_attribute previous_attribute() const;
+
+		// Get hash value (unique for handles to the same object)
+		size_t hash_value() const;
+
+		// Get internal pointer
+		xml_attribute_struct* internal_object() const;
+	};
+
+#ifdef __BORLANDC__
+	// Borland C++ workaround
+	bool PUGIXML_FUNCTION operator&&(const xml_attribute& lhs, bool rhs);
+	bool PUGIXML_FUNCTION operator||(const xml_attribute& lhs, bool rhs);
+#endif
+
+	// A light-weight handle for manipulating nodes in DOM tree
+	class PUGIXML_CLASS xml_node
+	{
+		friend class xml_attribute_iterator;
+		friend class xml_node_iterator;
+		friend class xml_named_node_iterator;
+
+	protected:
+		xml_node_struct* _root;
+
+		typedef void (*unspecified_bool_type)(xml_node***);
+
+	public:
+		// Default constructor. Constructs an empty node.
+		xml_node();
+
+		// Constructs node from internal pointer
+		explicit xml_node(xml_node_struct* p);
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+
+		// Borland C++ workaround
+		bool operator!() const;
+	
+		// Comparison operators (compares wrapped node pointers)
+		bool operator==(const xml_node& r) const;
+		bool operator!=(const xml_node& r) const;
+		bool operator<(const xml_node& r) const;
+		bool operator>(const xml_node& r) const;
+		bool operator<=(const xml_node& r) const;
+		bool operator>=(const xml_node& r) const;
+
+		// Check if node is empty.
+		bool empty() const;
+
+		// Get node type
+		xml_node_type type() const;
+
+		// Get node name/value, or "" if node is empty or it has no name/value
+		const char_t* name() const;
+		const char_t* value() const;
+	
+		// Get attribute list
+		xml_attribute first_attribute() const;
+		xml_attribute last_attribute() const;
+
+		// Get children list
+		xml_node first_child() const;
+		xml_node last_child() const;
+
+		// Get next/previous sibling in the children list of the parent node
+		xml_node next_sibling() const;
+		xml_node previous_sibling() const;
+		
+		// Get parent node
+		xml_node parent() const;
+
+		// Get root of DOM tree this node belongs to
+		xml_node root() const;
+
+		// Get text object for the current node
+		xml_text text() const;
+
+		// Get child, attribute or next/previous sibling with the specified name
+		xml_node child(const char_t* name) const;
+		xml_attribute attribute(const char_t* name) const;
+		xml_node next_sibling(const char_t* name) const;
+		xml_node previous_sibling(const char_t* name) const;
+
+		// Get child value of current node; that is, value of the first child node of type PCDATA/CDATA
+		const char_t* child_value() const;
+
+		// Get child value of child with specified name. Equivalent to child(name).child_value().
+		const char_t* child_value(const char_t* name) const;
+
+		// Set node name/value (returns false if node is empty, there is not enough memory, or node can not have name/value)
+		bool set_name(const char_t* rhs);
+		bool set_value(const char_t* rhs);
+		
+		// Add attribute with specified name. Returns added attribute, or empty attribute on errors.
+		xml_attribute append_attribute(const char_t* name);
+		xml_attribute prepend_attribute(const char_t* name);
+		xml_attribute insert_attribute_after(const char_t* name, const xml_attribute& attr);
+		xml_attribute insert_attribute_before(const char_t* name, const xml_attribute& attr);
+
+		// Add a copy of the specified attribute. Returns added attribute, or empty attribute on errors.
+		xml_attribute append_copy(const xml_attribute& proto);
+		xml_attribute prepend_copy(const xml_attribute& proto);
+		xml_attribute insert_copy_after(const xml_attribute& proto, const xml_attribute& attr);
+		xml_attribute insert_copy_before(const xml_attribute& proto, const xml_attribute& attr);
+
+		// Add child node with specified type. Returns added node, or empty node on errors.
+		xml_node append_child(xml_node_type type = node_element);
+		xml_node prepend_child(xml_node_type type = node_element);
+		xml_node insert_child_after(xml_node_type type, const xml_node& node);
+		xml_node insert_child_before(xml_node_type type, const xml_node& node);
+
+		// Add child element with specified name. Returns added node, or empty node on errors.
+		xml_node append_child(const char_t* name);
+		xml_node prepend_child(const char_t* name);
+		xml_node insert_child_after(const char_t* name, const xml_node& node);
+		xml_node insert_child_before(const char_t* name, const xml_node& node);
+
+		// Add a copy of the specified node as a child. Returns added node, or empty node on errors.
+		xml_node append_copy(const xml_node& proto);
+		xml_node prepend_copy(const xml_node& proto);
+		xml_node insert_copy_after(const xml_node& proto, const xml_node& node);
+		xml_node insert_copy_before(const xml_node& proto, const xml_node& node);
+
+		// Remove specified attribute
+		bool remove_attribute(const xml_attribute& a);
+		bool remove_attribute(const char_t* name);
+
+		// Remove specified child
+		bool remove_child(const xml_node& n);
+		bool remove_child(const char_t* name);
+
+		// Find attribute using predicate. Returns first attribute for which predicate returned true.
+		template <typename Predicate> xml_attribute find_attribute(Predicate pred) const
+		{
+			if (!_root) return xml_attribute();
+			
+			for (xml_attribute attrib = first_attribute(); attrib; attrib = attrib.next_attribute())
+				if (pred(attrib))
+					return attrib;
+		
+			return xml_attribute();
+		}
+
+		// Find child node using predicate. Returns first child for which predicate returned true.
+		template <typename Predicate> xml_node find_child(Predicate pred) const
+		{
+			if (!_root) return xml_node();
+	
+			for (xml_node node = first_child(); node; node = node.next_sibling())
+				if (pred(node))
+					return node;
+		
+			return xml_node();
+		}
+
+		// Find node from subtree using predicate. Returns first node from subtree (depth-first), for which predicate returned true.
+		template <typename Predicate> xml_node find_node(Predicate pred) const
+		{
+			if (!_root) return xml_node();
+
+			xml_node cur = first_child();
+			
+			while (cur._root && cur._root != _root)
+			{
+				if (pred(cur)) return cur;
+
+				if (cur.first_child()) cur = cur.first_child();
+				else if (cur.next_sibling()) cur = cur.next_sibling();
+				else
+				{
+					while (!cur.next_sibling() && cur._root != _root) cur = cur.parent();
+
+					if (cur._root != _root) cur = cur.next_sibling();
+				}
+			}
+
+			return xml_node();
+		}
+
+		// Find child node by attribute name/value
+		xml_node find_child_by_attribute(const char_t* name, const char_t* attr_name, const char_t* attr_value) const;
+		xml_node find_child_by_attribute(const char_t* attr_name, const char_t* attr_value) const;
+
+	#ifndef PUGIXML_NO_STL
+		// Get the absolute node path from root as a text string.
+		string_t path(char_t delimiter = '/') const;
+	#endif
+
+		// Search for a node by path consisting of node names and . or .. elements.
+		xml_node first_element_by_path(const char_t* path, char_t delimiter = '/') const;
+
+		// Recursively traverse subtree with xml_tree_walker
+		bool traverse(xml_tree_walker& walker);
+	
+	#ifndef PUGIXML_NO_XPATH
+		// Select single node by evaluating XPath query. Returns first node from the resulting node set.
+		xpath_node select_single_node(const char_t* query, xpath_variable_set* variables = 0) const;
+		xpath_node select_single_node(const xpath_query& query) const;
+
+		// Select node set by evaluating XPath query
+		xpath_node_set select_nodes(const char_t* query, xpath_variable_set* variables = 0) const;
+		xpath_node_set select_nodes(const xpath_query& query) const;
+	#endif
+		
+		// Print subtree using a writer object
+		void print(xml_writer& writer, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+
+	#ifndef PUGIXML_NO_STL
+		// Print subtree to stream
+		void print(std::basic_ostream<char, std::char_traits<char> >& os, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+		void print(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& os, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, unsigned int depth = 0) const;
+	#endif
+
+		// Child nodes iterators
+		typedef xml_node_iterator iterator;
+
+		iterator begin() const;
+		iterator end() const;
+
+		// Attribute iterators
+		typedef xml_attribute_iterator attribute_iterator;
+
+		attribute_iterator attributes_begin() const;
+		attribute_iterator attributes_end() const;
+
+		// Range-based for support
+		xml_object_range<xml_node_iterator> children() const;
+		xml_object_range<xml_named_node_iterator> children(const char_t* name) const;
+		xml_object_range<xml_attribute_iterator> attributes() const;
+
+		// Get node offset in parsed file/string (in char_t units) for debugging purposes
+		ptrdiff_t offset_debug() const;
+
+		// Get hash value (unique for handles to the same object)
+		size_t hash_value() const;
+
+		// Get internal pointer
+		xml_node_struct* internal_object() const;
+	};
+
+#ifdef __BORLANDC__
+	// Borland C++ workaround
+	bool PUGIXML_FUNCTION operator&&(const xml_node& lhs, bool rhs);
+	bool PUGIXML_FUNCTION operator||(const xml_node& lhs, bool rhs);
+#endif
+
+	// A helper for working with text inside PCDATA nodes
+	class PUGIXML_CLASS xml_text
+	{
+		friend class xml_node;
+
+		xml_node_struct* _root;
+
+		typedef void (*unspecified_bool_type)(xml_text***);
+
+		explicit xml_text(xml_node_struct* root);
+
+		xml_node_struct* _data_new();
+		xml_node_struct* _data() const;
+
+	public:
+		// Default constructor. Constructs an empty object.
+		xml_text();
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+
+		// Borland C++ workaround
+		bool operator!() const;
+
+		// Check if text object is empty
+		bool empty() const;
+
+		// Get text, or "" if object is empty
+		const char_t* get() const;
+
+		// Get text, or the default value if object is empty
+		const char_t* as_string(const char_t* def = PUGIXML_TEXT("")) const;
+
+		// Get text as a number, or the default value if conversion did not succeed or object is empty
+		int as_int(int def = 0) const;
+		unsigned int as_uint(unsigned int def = 0) const;
+		double as_double(double def = 0) const;
+		float as_float(float def = 0) const;
+
+		// Get text as bool (returns true if first character is in '1tTyY' set), or the default value if object is empty
+		bool as_bool(bool def = false) const;
+
+		// Set text (returns false if object is empty or there is not enough memory)
+		bool set(const char_t* rhs);
+
+		// Set text with type conversion (numbers are converted to strings, boolean is converted to "true"/"false")
+		bool set(int rhs);
+		bool set(unsigned int rhs);
+		bool set(double rhs);
+		bool set(bool rhs);
+
+		// Set text (equivalent to set without error checking)
+		xml_text& operator=(const char_t* rhs);
+		xml_text& operator=(int rhs);
+		xml_text& operator=(unsigned int rhs);
+		xml_text& operator=(double rhs);
+		xml_text& operator=(bool rhs);
+
+		// Get the data node (node_pcdata or node_cdata) for this object
+		xml_node data() const;
+	};
+
+#ifdef __BORLANDC__
+	// Borland C++ workaround
+	bool PUGIXML_FUNCTION operator&&(const xml_text& lhs, bool rhs);
+	bool PUGIXML_FUNCTION operator||(const xml_text& lhs, bool rhs);
+#endif
+
+	// Child node iterator (a bidirectional iterator over a collection of xml_node)
+	class PUGIXML_CLASS xml_node_iterator
+	{
+		friend class xml_node;
+
+	private:
+		mutable xml_node _wrap;
+		xml_node _parent;
+
+		xml_node_iterator(xml_node_struct* ref, xml_node_struct* parent);
+
+	public:
+		// Iterator traits
+		typedef ptrdiff_t difference_type;
+		typedef xml_node value_type;
+		typedef xml_node* pointer;
+		typedef xml_node& reference;
+
+	#ifndef PUGIXML_NO_STL
+		typedef std::bidirectional_iterator_tag iterator_category;
+	#endif
+
+		// Default constructor
+		xml_node_iterator();
+
+		// Construct an iterator which points to the specified node
+		xml_node_iterator(const xml_node& node);
+
+		// Iterator operators
+		bool operator==(const xml_node_iterator& rhs) const;
+		bool operator!=(const xml_node_iterator& rhs) const;
+
+		xml_node& operator*() const;
+		xml_node* operator->() const;
+
+		const xml_node_iterator& operator++();
+		xml_node_iterator operator++(int);
+
+		const xml_node_iterator& operator--();
+		xml_node_iterator operator--(int);
+	};
+
+	// Attribute iterator (a bidirectional iterator over a collection of xml_attribute)
+	class PUGIXML_CLASS xml_attribute_iterator
+	{
+		friend class xml_node;
+
+	private:
+		mutable xml_attribute _wrap;
+		xml_node _parent;
+
+		xml_attribute_iterator(xml_attribute_struct* ref, xml_node_struct* parent);
+
+	public:
+		// Iterator traits
+		typedef ptrdiff_t difference_type;
+		typedef xml_attribute value_type;
+		typedef xml_attribute* pointer;
+		typedef xml_attribute& reference;
+
+	#ifndef PUGIXML_NO_STL
+		typedef std::bidirectional_iterator_tag iterator_category;
+	#endif
+
+		// Default constructor
+		xml_attribute_iterator();
+
+		// Construct an iterator which points to the specified attribute
+		xml_attribute_iterator(const xml_attribute& attr, const xml_node& parent);
+
+		// Iterator operators
+		bool operator==(const xml_attribute_iterator& rhs) const;
+		bool operator!=(const xml_attribute_iterator& rhs) const;
+
+		xml_attribute& operator*() const;
+		xml_attribute* operator->() const;
+
+		const xml_attribute_iterator& operator++();
+		xml_attribute_iterator operator++(int);
+
+		const xml_attribute_iterator& operator--();
+		xml_attribute_iterator operator--(int);
+	};
+
+	// Named node range helper
+	class xml_named_node_iterator
+	{
+	public:
+		// Iterator traits
+		typedef ptrdiff_t difference_type;
+		typedef xml_node value_type;
+		typedef xml_node* pointer;
+		typedef xml_node& reference;
+
+	#ifndef PUGIXML_NO_STL
+		typedef std::forward_iterator_tag iterator_category;
+	#endif
+
+		// Default constructor
+		xml_named_node_iterator();
+
+		// Construct an iterator which points to the specified node
+		xml_named_node_iterator(const xml_node& node, const char_t* name);
+
+		// Iterator operators
+		bool operator==(const xml_named_node_iterator& rhs) const;
+		bool operator!=(const xml_named_node_iterator& rhs) const;
+
+		xml_node& operator*() const;
+		xml_node* operator->() const;
+
+		const xml_named_node_iterator& operator++();
+		xml_named_node_iterator operator++(int);
+
+	private:
+		mutable xml_node _node;
+		const char_t* _name;
+	};
+
+	// Abstract tree walker class (see xml_node::traverse)
+	class PUGIXML_CLASS xml_tree_walker
+	{
+		friend class xml_node;
+
+	private:
+		int _depth;
+	
+	protected:
+		// Get current traversal depth
+		int depth() const;
+	
+	public:
+		xml_tree_walker();
+		virtual ~xml_tree_walker();
+
+		// Callback that is called when traversal begins
+		virtual bool begin(xml_node& node);
+
+		// Callback that is called for each node traversed
+		virtual bool for_each(xml_node& node) = 0;
+
+		// Callback that is called when traversal ends
+		virtual bool end(xml_node& node);
+	};
+
+	// Parsing status, returned as part of xml_parse_result object
+	enum xml_parse_status
+	{
+		status_ok = 0,				// No error
+
+		status_file_not_found,		// File was not found during load_file()
+		status_io_error,			// Error reading from file/stream
+		status_out_of_memory,		// Could not allocate memory
+		status_internal_error,		// Internal error occurred
+
+		status_unrecognized_tag,	// Parser could not determine tag type
+
+		status_bad_pi,				// Parsing error occurred while parsing document declaration/processing instruction
+		status_bad_comment,			// Parsing error occurred while parsing comment
+		status_bad_cdata,			// Parsing error occurred while parsing CDATA section
+		status_bad_doctype,			// Parsing error occurred while parsing document type declaration
+		status_bad_pcdata,			// Parsing error occurred while parsing PCDATA section
+		status_bad_start_element,	// Parsing error occurred while parsing start element tag
+		status_bad_attribute,		// Parsing error occurred while parsing element attribute
+		status_bad_end_element,		// Parsing error occurred while parsing end element tag
+		status_end_element_mismatch // There was a mismatch of start-end tags (closing tag had incorrect name, some tag was not closed or there was an excessive closing tag)
+	};
+
+	// Parsing result
+	struct PUGIXML_CLASS xml_parse_result
+	{
+		// Parsing status (see xml_parse_status)
+		xml_parse_status status;
+
+		// Last parsed offset (in char_t units from start of input data)
+		ptrdiff_t offset;
+
+		// Source document encoding
+		xml_encoding encoding;
+
+		// Default constructor, initializes object to failed state
+		xml_parse_result();
+
+		// Cast to bool operator
+		operator bool() const;
+
+		// Get error description
+		const char* description() const;
+	};
+
+	// Document class (DOM tree root)
+	class PUGIXML_CLASS xml_document: public xml_node
+	{
+	private:
+		char_t* _buffer;
+
+		char _memory[192];
+		
+		// Non-copyable semantics
+		xml_document(const xml_document&);
+		const xml_document& operator=(const xml_document&);
+
+		void create();
+		void destroy();
+
+		xml_parse_result load_buffer_impl(void* contents, size_t size, unsigned int options, xml_encoding encoding, bool is_mutable, bool own);
+
+	public:
+		// Default constructor, makes empty document
+		xml_document();
+
+		// Destructor, invalidates all node/attribute handles to this document
+		~xml_document();
+
+		// Removes all nodes, leaving the empty document
+		void reset();
+
+		// Removes all nodes, then copies the entire contents of the specified document
+		void reset(const xml_document& proto);
+
+	#ifndef PUGIXML_NO_STL
+		// Load document from stream.
+		xml_parse_result load(std::basic_istream<char, std::char_traits<char> >& stream, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+		xml_parse_result load(std::basic_istream<wchar_t, std::char_traits<wchar_t> >& stream, unsigned int options = parse_default);
+	#endif
+
+		// Load document from zero-terminated string. No encoding conversions are applied.
+		xml_parse_result load(const char_t* contents, unsigned int options = parse_default);
+
+		// Load document from file
+		xml_parse_result load_file(const char* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+		xml_parse_result load_file(const wchar_t* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Load document from buffer. Copies/converts the buffer, so it may be deleted or changed after the function returns.
+		xml_parse_result load_buffer(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Load document from buffer, using the buffer for in-place parsing (the buffer is modified and used for storage of document data).
+		// You should ensure that buffer data will persist throughout the document's lifetime, and free the buffer memory manually once document is destroyed.
+		xml_parse_result load_buffer_inplace(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Load document from buffer, using the buffer for in-place parsing (the buffer is modified and used for storage of document data).
+		// You should allocate the buffer with pugixml allocation function; document will free the buffer when it is no longer needed (you can't use it anymore).
+		xml_parse_result load_buffer_inplace_own(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Save XML document to writer (semantics is slightly different from xml_node::print, see documentation for details).
+		void save(xml_writer& writer, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+
+	#ifndef PUGIXML_NO_STL
+		// Save XML document to stream (semantics is slightly different from xml_node::print, see documentation for details).
+		void save(std::basic_ostream<char, std::char_traits<char> >& stream, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+		void save(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default) const;
+	#endif
+
+		// Save XML to file
+		bool save_file(const char* path, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+		bool save_file(const wchar_t* path, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+
+		// Get document element
+		xml_node document_element() const;
+	};
+
+#ifndef PUGIXML_NO_XPATH
+	// XPath query return type
+	enum xpath_value_type
+	{
+		xpath_type_none,	  // Unknown type (query failed to compile)
+		xpath_type_node_set,  // Node set (xpath_node_set)
+		xpath_type_number,	  // Number
+		xpath_type_string,	  // String
+		xpath_type_boolean	  // Boolean
+	};
+
+	// XPath parsing result
+	struct PUGIXML_CLASS xpath_parse_result
+	{
+		// Error message (0 if no error)
+		const char* error;
+
+		// Last parsed offset (in char_t units from string start)
+		ptrdiff_t offset;
+
+		// Default constructor, initializes object to failed state
+		xpath_parse_result();
+
+		// Cast to bool operator
+		operator bool() const;
+
+		// Get error description
+		const char* description() const;
+	};
+
+	// A single XPath variable
+	class PUGIXML_CLASS xpath_variable
+	{
+		friend class xpath_variable_set;
+
+	protected:
+		xpath_value_type _type;
+		xpath_variable* _next;
+
+		xpath_variable();
+
+		// Non-copyable semantics
+		xpath_variable(const xpath_variable&);
+		xpath_variable& operator=(const xpath_variable&);
+		
+	public:
+		// Get variable name
+		const char_t* name() const;
+
+		// Get variable type
+		xpath_value_type type() const;
+
+		// Get variable value; no type conversion is performed, default value (false, NaN, empty string, empty node set) is returned on type mismatch error
+		bool get_boolean() const;
+		double get_number() const;
+		const char_t* get_string() const;
+		const xpath_node_set& get_node_set() const;
+
+		// Set variable value; no type conversion is performed, false is returned on type mismatch error
+		bool set(bool value);
+		bool set(double value);
+		bool set(const char_t* value);
+		bool set(const xpath_node_set& value);
+	};
+
+	// A set of XPath variables
+	class PUGIXML_CLASS xpath_variable_set
+	{
+	private:
+		xpath_variable* _data[64];
+
+		// Non-copyable semantics
+		xpath_variable_set(const xpath_variable_set&);
+		xpath_variable_set& operator=(const xpath_variable_set&);
+
+		xpath_variable* find(const char_t* name) const;
+
+	public:
+		// Default constructor/destructor
+		xpath_variable_set();
+		~xpath_variable_set();
+
+		// Add a new variable or get the existing one, if the types match
+		xpath_variable* add(const char_t* name, xpath_value_type type);
+
+		// Set value of an existing variable; no type conversion is performed, false is returned if there is no such variable or if types mismatch
+		bool set(const char_t* name, bool value);
+		bool set(const char_t* name, double value);
+		bool set(const char_t* name, const char_t* value);
+		bool set(const char_t* name, const xpath_node_set& value);
+
+		// Get existing variable by name
+		xpath_variable* get(const char_t* name);
+		const xpath_variable* get(const char_t* name) const;
+	};
+
+	// A compiled XPath query object
+	class PUGIXML_CLASS xpath_query
+	{
+	private:
+		void* _impl;
+		xpath_parse_result _result;
+
+		typedef void (*unspecified_bool_type)(xpath_query***);
+
+		// Non-copyable semantics
+		xpath_query(const xpath_query&);
+		xpath_query& operator=(const xpath_query&);
+
+	public:
+		// Construct a compiled object from XPath expression.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws xpath_exception on compilation errors.
+		explicit xpath_query(const char_t* query, xpath_variable_set* variables = 0);
+
+		// Destructor
+		~xpath_query();
+
+		// Get query expression return type
+		xpath_value_type return_type() const;
+		
+		// Evaluate expression as boolean value in the specified context; performs type conversion if necessary.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws std::bad_alloc on out of memory errors.
+		bool evaluate_boolean(const xpath_node& n) const;
+		
+		// Evaluate expression as double value in the specified context; performs type conversion if necessary.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws std::bad_alloc on out of memory errors.
+		double evaluate_number(const xpath_node& n) const;
+		
+	#ifndef PUGIXML_NO_STL
+		// Evaluate expression as string value in the specified context; performs type conversion if necessary.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws std::bad_alloc on out of memory errors.
+		string_t evaluate_string(const xpath_node& n) const;
+	#endif
+		
+		// Evaluate expression as string value in the specified context; performs type conversion if necessary.
+		// At most capacity characters are written to the destination buffer, full result size is returned (includes terminating zero).
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws std::bad_alloc on out of memory errors.
+		// If PUGIXML_NO_EXCEPTIONS is defined, returns empty  set instead.
+		size_t evaluate_string(char_t* buffer, size_t capacity, const xpath_node& n) const;
+
+		// Evaluate expression as node set in the specified context.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws xpath_exception on type mismatch and std::bad_alloc on out of memory errors.
+		// If PUGIXML_NO_EXCEPTIONS is defined, returns empty node set instead.
+		xpath_node_set evaluate_node_set(const xpath_node& n) const;
+
+		// Get parsing result (used to get compilation errors in PUGIXML_NO_EXCEPTIONS mode)
+		const xpath_parse_result& result() const;
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+
+		// Borland C++ workaround
+		bool operator!() const;
+	};
+	
+	#ifndef PUGIXML_NO_EXCEPTIONS
+	// XPath exception class
+	class PUGIXML_CLASS xpath_exception: public std::exception
+	{
+	private:
+		xpath_parse_result _result;
+
+	public:
+		// Construct exception from parse result
+		explicit xpath_exception(const xpath_parse_result& result);
+
+		// Get error message
+		virtual const char* what() const throw();
+
+		// Get parse result
+		const xpath_parse_result& result() const;
+	};
+	#endif
+	
+	// XPath node class (either xml_node or xml_attribute)
+	class PUGIXML_CLASS xpath_node
+	{
+	private:
+		xml_node _node;
+		xml_attribute _attribute;
+	
+		typedef void (*unspecified_bool_type)(xpath_node***);
+
+	public:
+		// Default constructor; constructs empty XPath node
+		xpath_node();
+		
+		// Construct XPath node from XML node/attribute
+		xpath_node(const xml_node& node);
+		xpath_node(const xml_attribute& attribute, const xml_node& parent);
+
+		// Get node/attribute, if any
+		xml_node node() const;
+		xml_attribute attribute() const;
+		
+		// Get parent of contained node/attribute
+		xml_node parent() const;
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+		
+		// Borland C++ workaround
+		bool operator!() const;
+
+		// Comparison operators
+		bool operator==(const xpath_node& n) const;
+		bool operator!=(const xpath_node& n) const;
+	};
+
+#ifdef __BORLANDC__
+	// Borland C++ workaround
+	bool PUGIXML_FUNCTION operator&&(const xpath_node& lhs, bool rhs);
+	bool PUGIXML_FUNCTION operator||(const xpath_node& lhs, bool rhs);
+#endif
+
+	// A fixed-size collection of XPath nodes
+	class PUGIXML_CLASS xpath_node_set
+	{
+	public:
+		// Collection type
+		enum type_t
+		{
+			type_unsorted,			// Not ordered
+			type_sorted,			// Sorted by document order (ascending)
+			type_sorted_reverse		// Sorted by document order (descending)
+		};
+		
+		// Constant iterator type
+		typedef const xpath_node* const_iterator;
+	
+		// Default constructor. Constructs empty set.
+		xpath_node_set();
+
+		// Constructs a set from iterator range; data is not checked for duplicates and is not sorted according to provided type, so be careful
+		xpath_node_set(const_iterator begin, const_iterator end, type_t type = type_unsorted);
+
+		// Destructor
+		~xpath_node_set();
+		
+		// Copy constructor/assignment operator
+		xpath_node_set(const xpath_node_set& ns);
+		xpath_node_set& operator=(const xpath_node_set& ns);
+
+		// Get collection type
+		type_t type() const;
+		
+		// Get collection size
+		size_t size() const;
+
+		// Indexing operator
+		const xpath_node& operator[](size_t index) const;
+		
+		// Collection iterators
+		const_iterator begin() const;
+		const_iterator end() const;
+
+		// Sort the collection in ascending/descending order by document order
+		void sort(bool reverse = false);
+		
+		// Get first node in the collection by document order
+		xpath_node first() const;
+		
+		// Check if collection is empty
+		bool empty() const;
+	
+	private:
+		type_t _type;
+		
+		xpath_node _storage;
+		
+		xpath_node* _begin;
+		xpath_node* _end;
+
+		void _assign(const_iterator begin, const_iterator end);
+	};
+#endif
+
+#ifndef PUGIXML_NO_STL
+	// Convert wide string to UTF8
+	std::basic_string<char, std::char_traits<char>, std::allocator<char> > PUGIXML_FUNCTION as_utf8(const wchar_t* str);
+	std::basic_string<char, std::char_traits<char>, std::allocator<char> > PUGIXML_FUNCTION as_utf8(const std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >& str);
+	
+	// Convert UTF8 to wide string
+	std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > PUGIXML_FUNCTION as_wide(const char* str);
+	std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > PUGIXML_FUNCTION as_wide(const std::basic_string<char, std::char_traits<char>, std::allocator<char> >& str);
+#endif
+
+	// Memory allocation function interface; returns pointer to allocated memory or NULL on failure
+	typedef void* (*allocation_function)(size_t size);
+	
+	// Memory deallocation function interface
+	typedef void (*deallocation_function)(void* ptr);
+
+	// Override default memory management functions. All subsequent allocations/deallocations will be performed via supplied functions.
+	void PUGIXML_FUNCTION set_memory_management_functions(allocation_function allocate, deallocation_function deallocate);
+	
+	// Get current memory management functions
+	allocation_function PUGIXML_FUNCTION get_memory_allocation_function();
+	deallocation_function PUGIXML_FUNCTION get_memory_deallocation_function();
+}
+
+#if !defined(PUGIXML_NO_STL) && (defined(_MSC_VER) || defined(__ICC))
+namespace std
+{
+	// Workarounds for (non-standard) iterator category detection for older versions (MSVC7/IC8 and earlier)
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION _Iter_cat(const pugi::xml_node_iterator&);
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION _Iter_cat(const pugi::xml_attribute_iterator&);
+	std::forward_iterator_tag PUGIXML_FUNCTION _Iter_cat(const pugi::xml_named_node_iterator&);
+}
+#endif
+
+#if !defined(PUGIXML_NO_STL) && defined(__SUNPRO_CC)
+namespace std
+{
+	// Workarounds for (non-standard) iterator category detection
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION __iterator_category(const pugi::xml_node_iterator&);
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION __iterator_category(const pugi::xml_attribute_iterator&);
+	std::forward_iterator_tag PUGIXML_FUNCTION __iterator_category(const pugi::xml_named_node_iterator&);
+}
+#endif
+
+#endif
+
+/**
+ * Copyright (c) 2006-2012 Arseny Kapoulkine
+ *
+ * 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.
+ */
diff --git a/dolfin/io/xmlutils.cpp b/dolfin/io/xmlutils.cpp
new file mode 100644
index 0000000..1c9d52b
--- /dev/null
+++ b/dolfin/io/xmlutils.cpp
@@ -0,0 +1,44 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-09-15
+// Last changed: 2011-11-15
+
+#include <dolfin/log/log.h>
+#include "xmlutils.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+const pugi::xml_node
+  dolfin::get_node(const pugi::xml_node& xml_node, std::string node_name)
+{
+  // Check node itself
+  if (xml_node.name() == node_name)
+    return xml_node;
+
+  // Check child
+  const pugi::xml_node child_node = xml_node.child(node_name.c_str());
+  if (!child_node)
+  {
+    dolfin_error("xmlutils.cpp",
+                 "read DOLFIN XML data",
+                 "Unable to find tag <%s>", node_name.c_str());
+  }
+  return child_node;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/io/xmlutils.h b/dolfin/io/xmlutils.h
new file mode 100644
index 0000000..17fa132
--- /dev/null
+++ b/dolfin/io/xmlutils.h
@@ -0,0 +1,41 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-09-15
+// Last changed: 2011-09-15
+
+#ifndef __XML_UTILS_H
+#define __XML_UTILS_H
+
+#include <string>
+#include "pugixml.hpp"
+
+
+namespace dolfin
+{
+
+  // This file provides a small number of utility functions that may be
+  // useful when parsing XML using pugixml.
+
+  /// Get XML node with given name, either the given node itself or a
+  /// child node. An error message is thrown if node is not found.
+  const pugi::xml_node get_node(const pugi::xml_node& xml_node,
+                                std::string node_name);
+
+}
+
+#endif
diff --git a/dolfin/la/BlockMatrix.cpp b/dolfin/la/BlockMatrix.cpp
new file mode 100644
index 0000000..5b1eb3e
--- /dev/null
+++ b/dolfin/la/BlockMatrix.cpp
@@ -0,0 +1,195 @@
+// Copyright (C) 2008 Kent-Andre Mardal
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2012
+// Modified by Garth N. Wells 2011
+//
+// First added:  2008-08-25
+// Last changed: 2012-03-15
+
+#include <iostream>
+#include <memory>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/NoDeleter.h>
+#include "dolfin/common/utils.h"
+#include "BlockVector.h"
+#include "DefaultFactory.h"
+#include "GenericVector.h"
+#include "Matrix.h"
+#include "BlockMatrix.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+BlockMatrix::BlockMatrix(std::size_t m, std::size_t n)
+  : matrices(boost::extents[m][n])
+{
+  for (std::size_t i = 0; i < m; i++)
+    for (std::size_t j = 0; j < n; j++)
+      matrices[i][j].reset(new Matrix());
+}
+//-----------------------------------------------------------------------------
+BlockMatrix::~BlockMatrix()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void BlockMatrix::set_block(std::size_t i, std::size_t j,
+                            std::shared_ptr<GenericMatrix> m)
+{
+  dolfin_assert(i < matrices.shape()[0]);
+  dolfin_assert(j < matrices.shape()[1]);
+  matrices[i][j] = m;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericMatrix>
+BlockMatrix::get_block(std::size_t i, std::size_t j) const
+{
+  dolfin_assert(i < matrices.shape()[0]);
+  dolfin_assert(j < matrices.shape()[1]);
+  return matrices[i][j];
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericMatrix> BlockMatrix::get_block(std::size_t i,
+                                                        std::size_t j)
+{
+  dolfin_assert(i < matrices.shape()[0]);
+  dolfin_assert(j < matrices.shape()[1]);
+  return matrices[i][j];
+}
+//-----------------------------------------------------------------------------
+std::size_t BlockMatrix::size(std::size_t dim) const
+{
+  dolfin_assert(dim < 1);
+  return matrices.shape()[dim];
+}
+//-----------------------------------------------------------------------------
+void BlockMatrix::zero()
+{
+  for (std::size_t i = 0; i < matrices.shape()[0]; i++)
+    for (std::size_t j = 0; j < matrices.shape()[1]; j++)
+      matrices[i][j]->zero();
+}
+//-----------------------------------------------------------------------------
+void BlockMatrix::apply(std::string mode)
+{
+  Timer timer("Apply (BlockMatrix)");
+  for (std::size_t i = 0; i < matrices.shape()[0]; i++)
+    for (std::size_t j = 0; j < matrices.shape()[1]; j++)
+      matrices[i][j]->apply(mode);
+}
+//-----------------------------------------------------------------------------
+std::string BlockMatrix::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+    for (std::size_t i = 0; i < matrices.shape()[0]; i++)
+    {
+      for (std::size_t j = 0; i < matrices.shape()[1]; j++)
+      {
+        s << "  BlockMatrix (" << i << ", " << j << ")" << std::endl
+          << std::endl;
+        s << indent(indent(matrices[i][j]->str(true))) << std::endl;
+      }
+    }
+  }
+  else
+  {
+    s << "<BlockMatrix containing " << matrices.shape()[0] << " x "
+      << matrices.shape()[1] << " blocks>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void BlockMatrix::mult(const BlockVector& x, BlockVector& y,
+                       bool transposed) const
+{
+  if (transposed)
+  {
+    dolfin_error("BlockMatrix.cpp",
+                 "compute transpose matrix-vector product",
+                 "Not implemented for block matrices");
+  }
+
+  // Create tempory vector
+  dolfin_assert(matrices[0][0]);
+
+  // Loop over block rows
+  for(std::size_t row = 0; row < matrices.shape()[0]; row++)
+  {
+    // RHS sub-vector
+    GenericVector& _y = *(y.get_block(row));
+
+    const GenericMatrix& _matA = *matrices[row][0];
+
+    // Resize y and zero
+    if (_y.empty())
+      _matA.init_vector(_y, 0);
+    _y.zero();
+
+    // Loop over block columns
+    std::shared_ptr<GenericVector>
+      z_tmp = _matA.factory().create_vector();
+    for(std::size_t col = 0; col < matrices.shape()[1]; ++col)
+    {
+      const GenericVector& _x = *(x.get_block(col));
+      dolfin_assert(matrices[row][col]);
+      matrices[row][col]->mult(_x, *z_tmp);
+      _y += *z_tmp;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericMatrix> BlockMatrix::schur_approximation(bool symmetry) const
+{
+  // Currently returns [diag(C * diag(A)^-1 * B) - D]
+  if (!symmetry)
+  {
+    dolfin_error("BlockMatrix.cpp",
+                 "compute Schur complement approximation",
+                 "Not implemented for unsymmetric matrix");
+  }
+
+  dolfin_assert(matrices.size()==2 && matrices[0].size()==2 && matrices[1].size()==2);
+
+  GenericMatrix &A = *matrices[0][0];
+  GenericMatrix &C = *matrices[1][0];
+  GenericMatrix &D = *matrices[1][1];
+
+  std::shared_ptr<GenericMatrix> S(D.copy());
+
+  std::vector<std::size_t> cols_i;
+  std::vector<double> vals_i;
+  for (std::size_t i = 0; i < D.size(0); i++)
+  {
+    C.getrow(i, cols_i, vals_i);
+    double diag_ii = 0;
+    for (std::size_t k = 0; k < cols_i.size(); k++)
+    {
+      const std::size_t j = cols_i[k];
+      const double val=vals_i[k];
+      diag_ii -= val*val/A(j,j);
+    }
+    const dolfin::la_index _i = i;
+    S->add(&diag_ii, 1, &_i, 1, &_i);
+  }
+  return S;
+}
diff --git a/dolfin/la/BlockMatrix.h b/dolfin/la/BlockMatrix.h
new file mode 100644
index 0000000..c33e54d
--- /dev/null
+++ b/dolfin/la/BlockMatrix.h
@@ -0,0 +1,87 @@
+// Copyright (C) 2008 Kent-Andre Mardal
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008.
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2008-08-25
+// Last changed: 2011-01-22
+
+#ifndef __BLOCKMATRIX_H
+#define __BLOCKMATRIX_H
+
+#include <boost/multi_array.hpp>
+#include <memory>
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class GenericMatrix;
+
+  class BlockMatrix
+  {
+  public:
+
+    // Constructor
+    BlockMatrix(std::size_t m=0, std::size_t n=0);
+
+    // Destructor
+    ~BlockMatrix();
+
+    /// Set block
+    void set_block(std::size_t i, std::size_t j,
+                   std::shared_ptr<GenericMatrix> m);
+
+    /// Get block (const version)
+    std::shared_ptr<const GenericMatrix>
+      get_block(std::size_t i, std::size_t j) const;
+
+    /// Get block
+    std::shared_ptr<GenericMatrix> get_block(std::size_t i, std::size_t j);
+
+    /// Return size of given dimension
+    std::size_t size(std::size_t dim) const;
+
+    /// Set all entries to zero and keep any sparse structure
+    void zero();
+
+    /// Finalize assembly of tensor
+    void apply(std::string mode);
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Matrix-vector product, y = Ax
+    void mult(const BlockVector& x, BlockVector& y,
+              bool transposed=false) const;
+
+    /// Create a crude explicit Schur approximation  of S = D - C A^-1
+    /// B of  (A B; C  D) If symmetry !=  0, then the  caller promises
+    /// that B = symmetry * transpose(C).
+    std::shared_ptr<GenericMatrix>
+      schur_approximation(bool symmetry=true) const;
+
+  private:
+
+    boost::multi_array<std::shared_ptr<GenericMatrix>, 2> matrices;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/BlockVector.cpp b/dolfin/la/BlockVector.cpp
new file mode 100644
index 0000000..7d4c6cd
--- /dev/null
+++ b/dolfin/la/BlockVector.cpp
@@ -0,0 +1,202 @@
+// Copyright (C) 2008 Kent-Andre Mardal
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2008-08-25
+// Last changed: 2011-01-22
+//
+// Modified by Anders Logg, 2008.
+
+#include <algorithm>
+#include <cmath>
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/utils.h>
+#include "GenericVector.h"
+#include "Vector.h"
+#include "BlockVector.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+BlockVector::BlockVector(std::size_t n) : vectors(n)
+{
+  for (std::size_t i = 0; i < n; i++)
+    vectors[i].reset(new Vector());
+}
+//-----------------------------------------------------------------------------
+BlockVector::~BlockVector()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+BlockVector* BlockVector::copy() const
+{
+  BlockVector* x = new BlockVector(vectors.size());
+  for (std::size_t i = 0; i < vectors.size(); i++)
+    x->set_block(i, std::shared_ptr<GenericVector>(vectors[i]->copy()));
+  return x;
+}
+//-----------------------------------------------------------------------------
+void BlockVector::set_block(std::size_t i, std::shared_ptr<GenericVector> v)
+{
+  dolfin_assert(i < vectors.size());
+  vectors[i] = v;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericVector>
+BlockVector::get_block(std::size_t i) const
+{
+  dolfin_assert(i < vectors.size());
+  return vectors[i];
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> BlockVector::get_block(std::size_t i)
+{
+  dolfin_assert(i < vectors.size());
+  return vectors[i];
+}
+//-----------------------------------------------------------------------------
+bool BlockVector::empty() const
+{
+  return vectors.empty();
+}
+//-----------------------------------------------------------------------------
+std::size_t BlockVector::size() const
+{
+  return vectors.size();
+}
+//-----------------------------------------------------------------------------
+void BlockVector::axpy(double a, const BlockVector& x)
+{
+  for (std::size_t i = 0; i < vectors.size(); i++)
+    vectors[i]->axpy(a, *x.get_block(i));
+}
+//-----------------------------------------------------------------------------
+double BlockVector::inner(const BlockVector& x) const
+{
+  double value = 0.0;
+  for (std::size_t i = 0; i < vectors.size(); i++)
+    value += vectors[i]->inner(*x.get_block(i));
+  return value;
+}
+//-----------------------------------------------------------------------------
+double BlockVector::norm(std::string norm_type) const
+{
+  double value = 0.0;
+  if(norm_type == "l1")
+  {
+    for (std::size_t i = 0; i < vectors.size(); i++)
+      value += vectors[i]->norm(norm_type);
+  }
+  else if (norm_type == "l2")
+  {
+    for (std::size_t i = 0; i < vectors.size(); i++)
+      value += std::pow(vectors[i]->norm(norm_type), 2);
+    value = sqrt(value);
+  }
+  else if (norm_type == "linf")
+  {
+    std::vector<double> linf(vectors.size());
+    for (std::size_t i = 0; i < vectors.size(); i++)
+      linf[i] = vectors[i]->norm(norm_type);
+     value = *(std::max_element(linf.begin(), linf.end()));
+  }
+  return value;
+}
+//-----------------------------------------------------------------------------
+double BlockVector::min() const
+{
+  std::vector<double> _min(vectors.size());
+  for (std::size_t i = 0; i < vectors.size(); i++)
+    _min[i] = vectors[i]->min();
+
+  return *(std::min_element(_min.begin(), _min.end()));
+}
+//-----------------------------------------------------------------------------
+double BlockVector::max() const
+{
+  std::vector<double> _max(vectors.size());
+  for (std::size_t i = 0; i < vectors.size(); i++)
+    _max[i] = vectors[i]->min();
+
+  return *(std::max_element(_max.begin(), _max.end()));
+}
+//-----------------------------------------------------------------------------
+const BlockVector& BlockVector::operator*= (double a)
+{
+  for(std::size_t i = 0; i < vectors.size(); i++)
+    *vectors[i] *= a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const BlockVector& BlockVector::operator/= (double a)
+{
+  for(std::size_t i = 0; i < vectors.size(); i++)
+    *vectors[i] /= a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const BlockVector& BlockVector::operator+= (const BlockVector& y)
+{
+  axpy(1.0, y);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const BlockVector& BlockVector::operator-= (const BlockVector& y)
+{
+  axpy(-1.0, y);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const BlockVector& BlockVector::operator= (const BlockVector& x)
+{
+  for(std::size_t i = 0; i < vectors.size(); i++)
+    *vectors[i] = *x.get_block(i);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const BlockVector& BlockVector::operator= (double a)
+{
+  for(std::size_t i = 0; i < vectors.size(); i++)
+    *vectors[i] = a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+std::string BlockVector::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    for (std::size_t i = 0; i < vectors.size(); i++)
+    {
+      s << "  BlockVector " << i << std::endl << std::endl;
+      s << indent(indent(vectors[i]->str(true))) << std::endl;
+    }
+  }
+  else
+  {
+    s << "<BlockVector containing " << vectors.size() << " blocks>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/BlockVector.h b/dolfin/la/BlockVector.h
new file mode 100644
index 0000000..5cc49c2
--- /dev/null
+++ b/dolfin/la/BlockVector.h
@@ -0,0 +1,111 @@
+// Copyright (C) 2008 Kent-Andre Mardal
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008.
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2008-08-25
+// Last changed: 2011-01-22
+//
+
+#ifndef __BLOCKVECTOR_H
+#define __BLOCKVECTOR_H
+
+#include <string>
+#include <vector>
+#include <memory>
+#include <dolfin/common/types.h>
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class GenericVector;
+
+  class BlockVector
+  {
+  public:
+
+    /// Constructor
+    BlockVector(std::size_t n = 0);
+
+    /// Destructor
+    virtual ~BlockVector();
+
+    /// Return copy of tensor
+    virtual BlockVector* copy() const;
+
+    /// Set function
+    void set_block(std::size_t i, std::shared_ptr<GenericVector> v);
+
+    /// Get sub-vector (const)
+    std::shared_ptr<const GenericVector> get_block(std::size_t i) const;
+
+    /// Get sub-vector (non-const)
+    std::shared_ptr<GenericVector> get_block(std::size_t);
+
+    /// Add multiple of given vector (AXPY operation)
+    void axpy(double a, const BlockVector& x);
+
+    /// Return inner product with given vector
+    double inner(const BlockVector& x) const;
+
+    /// Return norm of vector
+    double norm(std::string norm_type) const;
+
+    /// Return minimum value of vector
+    double min() const;
+
+    /// Return maximum value of vector
+    double max() const;
+
+    /// Multiply vector by given number
+    const BlockVector& operator*= (double a);
+
+    /// Divide vector by given number
+    const BlockVector& operator/= (double a);
+
+    /// Add given vector
+    const BlockVector& operator+= (const BlockVector& x);
+
+    /// Subtract given vector
+    const BlockVector& operator-= (const BlockVector& x);
+
+    /// Assignment operator
+    const BlockVector& operator= (const BlockVector& x);
+
+    /// Assignment operator
+    const BlockVector& operator= (double a);
+
+    /// Return true if empty
+    virtual bool empty() const;
+
+    /// Number of vectors
+    std::size_t size() const;
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+  private:
+
+    std::vector<std::shared_ptr<GenericVector> > vectors;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/CholmodCholeskySolver.cpp b/dolfin/la/CholmodCholeskySolver.cpp
new file mode 100644
index 0000000..3fef6b6
--- /dev/null
+++ b/dolfin/la/CholmodCholeskySolver.cpp
@@ -0,0 +1,353 @@
+// Copyright (C) 2008-2011 Dag Lindbo and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2012
+//
+// First added:  2008-08-15
+// Last changed: 2012-08-21
+
+#include <cstring>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/la/GenericLinearOperator.h>
+#include <dolfin/la/GenericMatrix.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/log/dolfin_log.h>
+#include "LUSolver.h"
+#include "UmfpackLUSolver.h"
+#include "CholmodCholeskySolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Parameters CholmodCholeskySolver::default_parameters()
+{
+  Parameters p(LUSolver::default_parameters());
+  p.rename("cholmod_lu_solver");
+  return p;
+}
+//-----------------------------------------------------------------------------
+CholmodCholeskySolver::CholmodCholeskySolver()
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+CholmodCholeskySolver::CholmodCholeskySolver(std::shared_ptr<const GenericLinearOperator> A)
+  : _matA(A)
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+CholmodCholeskySolver::~CholmodCholeskySolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+//=============================================================================
+#ifdef HAS_CHOLMOD
+std::size_t CholmodCholeskySolver::solve(const GenericLinearOperator& A,
+                                         GenericVector& x,
+                                         const GenericVector& b)
+{
+  // Factorize matrix
+  factorize(A);
+
+  // Solve system
+  factorized_solve(x, b);
+
+  // Clear data
+  cholmod.clear();
+
+  return 1;
+}
+//-----------------------------------------------------------------------------
+std::size_t CholmodCholeskySolver::factorize(const GenericLinearOperator& A)
+{
+  // Need matrix data
+  const GenericMatrix& _matA = require_matrix(A);
+
+  // Check dimensions and get number of non-zeroes
+  boost::tuples::tuple<const std::size_t*,
+                       const std::size_t*,
+                       const double*, int> data = _matA.data();
+  const std::size_t M = _matA.size(0);
+  const std::size_t nnz = boost::tuples::get<3>(data);
+  dolfin_assert(_matA.size(0) == _matA.size(1));
+
+  dolfin_assert(nnz >= M);
+
+  // Initialise cholmod data
+  // NOTE: Casting away const here
+  cholmod.init((UF_long*) boost::tuples::get<0>(data),
+               (UF_long*) boost::tuples::get<1>(data),
+               (double*) boost::tuples::get<2>(data), M, nnz);
+
+  // Factorize
+  log(PROGRESS, "Cholesky-factorizing linear system of size %d x %d (CHOLMOD).",
+      M, M);
+  cholmod.factorize();
+
+  return 1;
+}
+//-----------------------------------------------------------------------------
+std::size_t CholmodCholeskySolver::factorized_solve(GenericVector& x,
+                                                    const GenericVector& b)
+{
+  const std::size_t N = b.size();
+
+  if (!cholmod.factorized)
+  {
+    dolfin_error("CholmodCholeskySolver.cpp",
+                 "perform factorized solve using CHOLMOD Cholesky solver",
+                 "Factorized solve no preceded by call to factorize()");
+  }
+
+  if (N != cholmod.N)
+  {
+    dolfin_error("CholmodCholeskySolver.cpp",
+                 "perform factorized solve using CHOLMOD Cholesky solver",
+                 "Vector does not match size of factored matrix");
+  }
+
+  // Initialise solution vector and solve
+  x.resize(b.mpi_comm(), b.local_range());
+
+  log(PROGRESS, "Solving factorized linear system of size %d x %d (CHOLMOD).",
+      N, N);
+
+  cholmod.factorized_solve(x.data(), b.data());
+
+  return 1;
+}
+//-----------------------------------------------------------------------------
+#else
+// ============================================================================
+std::size_t CholmodCholeskySolver::solve(const GenericLinearOperator& A,
+                                         GenericVector& x,
+                                          const GenericVector& b)
+{
+  warning("CHOLMOD must be installed to peform a Cholesky solve for the current backend. Attemping to use UMFPACK solver.");
+
+  std::shared_ptr<const GenericLinearOperator> Atmp(&A, NoDeleter());
+  UmfpackLUSolver solver(Atmp);
+  return solver.solve(x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t CholmodCholeskySolver::factorize(const GenericLinearOperator& A)
+{
+  dolfin_error("CholdmodCholeskySolver.cpp",
+               "perform factorization using CHOLMOD Cholesky solver",
+               "CHOLMOD is not installed");
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t CholmodCholeskySolver::factorized_solve(GenericVector& x,
+                                                    const GenericVector& b)
+{
+  dolfin_error("CholdmodCholeskySolver.cpp",
+               "perform factorized solve using CHOLMOD Cholesky solver",
+               "CHOLMOD is not installed");
+  return 0;
+}
+#endif
+
+//==============================================================================
+// CholmodCholeskySolver::Cholmod implementation
+#ifdef HAS_CHOLMOD
+//==============================================================================
+CholmodCholeskySolver::Cholmod::Cholmod()
+  : N(0), factorized(false), A_chol(0), L_chol(0)
+{
+  // "Start" cholmod
+  cholmod_l_start(&c);
+}
+//-----------------------------------------------------------------------------
+CholmodCholeskySolver::Cholmod::~Cholmod()
+{
+  clear();
+
+  // "stop" cholmod
+  cholmod_l_finish(&c);
+}
+//-----------------------------------------------------------------------------
+void CholmodCholeskySolver::Cholmod::clear()
+{
+  if (A_chol)
+  {
+    cholmod_l_free(1, sizeof(cholmod_sparse), A_chol, &c);
+    A_chol = 0;
+  }
+  if (L_chol)
+  {
+    cholmod_l_free_factor(&L_chol, &c);
+    L_chol = 0;
+  }
+}
+//-----------------------------------------------------------------------------
+void CholmodCholeskySolver::Cholmod::init(UF_long* Ap, UF_long* Ai, double* Ax,
+                                          std::size_t M, std::size_t nz)
+{
+  if (factorized)
+    log(DBG, "CholeskySolver already contains a factorized matrix! Clearing and starting over.");
+
+  // Clear any data
+  clear();
+
+  A_chol = (cholmod_sparse*) cholmod_l_malloc(1, sizeof(cholmod_sparse), &c);
+
+  // The matrix
+  A_chol->p = Ap;
+  A_chol->i = Ai;
+  A_chol->x = Ax;
+
+  A_chol->nzmax = nz;
+  A_chol->ncol = M;
+  A_chol->nrow = M;
+
+  A_chol->sorted = 1;
+  A_chol->packed = 1;
+
+  A_chol->xtype = CHOLMOD_REAL;
+  A_chol->stype = -1;
+  A_chol->dtype = CHOLMOD_DOUBLE;
+  A_chol->itype = CHOLMOD_LONG;
+
+  N = M;
+}
+//-----------------------------------------------------------------------------
+void CholmodCholeskySolver::Cholmod::factorize()
+{
+  // Analyze
+  L_chol = cholmod_l_analyze(A_chol, &c);
+
+  // Factorize
+  cholmod_l_factorize(A_chol, L_chol, &c);
+
+  check_status("factorize()");
+
+  factorized = true;
+}
+//-----------------------------------------------------------------------------
+void CholmodCholeskySolver::Cholmod::factorized_solve(double*x,
+                                                      const double* b)
+{
+  cholmod_dense *x_chol, *b_chol;
+
+  // initialize rhs
+  b_chol = (cholmod_dense*) cholmod_l_malloc(1, sizeof(cholmod_dense), &c);
+  b_chol->x = (double*) b;
+  b_chol->nrow = N;
+  b_chol->ncol = 1;
+  b_chol->d = N;
+  b_chol->nzmax = N;
+  b_chol->xtype = A_chol->xtype;
+  b_chol->dtype = A_chol->dtype;
+
+  // Solve
+  x_chol = cholmod_l_solve(CHOLMOD_A, L_chol, b_chol, &c);
+
+  // Compute residual and residual norm
+  cholmod_dense* r_chol = residual(x_chol,b_chol);
+  double residn = residual_norm(r_chol, x_chol, b_chol);
+
+  // Iterative refinement
+  if (residn > 1.0e-14)
+  {
+    refine_once(x_chol, r_chol);
+
+    cholmod_l_free_dense(&r_chol, &c);
+
+    r_chol = residual(x_chol, b_chol);
+    residn = residual_norm(r_chol, x_chol,b_chol);
+  }
+
+  // Solution vector
+  // FIXME: Cholmod allocates its own solution vector.
+  memcpy(x, x_chol->x, N*sizeof(double));
+  cholmod_l_free_dense(&x_chol, &c);
+
+  // Clear rhs
+  cholmod_l_free(1, sizeof(cholmod_dense), b_chol, &c);
+
+  // Clear residual
+  cholmod_l_free_dense(&r_chol, &c);
+
+  check_status("factorized_solve()");
+}
+//-----------------------------------------------------------------------------
+cholmod_dense* CholmodCholeskySolver::Cholmod::residual(cholmod_dense* x,
+                                                        cholmod_dense* b)
+{
+  double  one[2] = { 1, 0};
+  double mone[2] = {-1, 0};
+
+  // Residual r = r-A*x
+  cholmod_dense* r = cholmod_l_copy_dense(b, &c);
+  cholmod_l_sdmult(A_chol, 0, mone, one, x, r, &c);
+
+  return r;
+}
+//-----------------------------------------------------------------------------
+double CholmodCholeskySolver::Cholmod::residual_norm(cholmod_dense* r,
+                                                     cholmod_dense* x,
+                                                     cholmod_dense* b)
+{
+  double r_norm = cholmod_l_norm_dense(r, 0, &c);
+  double x_norm = cholmod_l_norm_dense(x, 0, &c);
+  double b_norm = cholmod_l_norm_dense(b, 0, &c);
+  double A_norm = cholmod_l_norm_sparse(A_chol, 0, &c);
+  double Axb_norm = A_norm*x_norm + b_norm;
+
+  return r_norm/Axb_norm;
+}
+//-----------------------------------------------------------------------------
+void CholmodCholeskySolver::Cholmod::refine_once(cholmod_dense* x,
+                                                 cholmod_dense* r)
+{
+  cholmod_dense* r_iter;
+  r_iter = cholmod_l_solve(CHOLMOD_A, L_chol, r, &c);
+
+  double* xx = (double*) x->x;
+  double* rx = (double*) r_iter->x;
+
+  for(std::size_t i = 0; i < N; i++)
+    xx[i] = xx[i] + rx[i];
+
+  cholmod_l_free_dense(&r_iter, &c);
+}
+//-----------------------------------------------------------------------------
+void CholmodCholeskySolver::Cholmod::check_status(std::string function)
+{
+  UF_long status = c.status;
+
+  if ( status < 0)
+  {
+    cout << "\nCHOLMOD Warning: problem related to call to " << function
+	    << ".\n_full CHOLMOD common dump:" << endl;
+
+    cholmod_l_print_common(NULL, &c);
+  }
+  else if (status > 0)
+  {
+    cout << "\nCHOLMOD Fatal error: problem related to call to " << function
+	    << ".\n_full CHOLMOD common dump:" << endl;
+    cholmod_l_print_common(NULL, &c);
+  }
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/la/CholmodCholeskySolver.h b/dolfin/la/CholmodCholeskySolver.h
new file mode 100644
index 0000000..c3f442a
--- /dev/null
+++ b/dolfin/la/CholmodCholeskySolver.h
@@ -0,0 +1,141 @@
+// Copyright (C) 2008 Dag Lindbo and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2008-08-15
+// Last changed: 2011-11-11
+
+#ifndef __CHOLMOD_CHOLESKY_SOLVER_H
+#define __CHOLMOD_CHOLESKY_SOLVER_H
+
+#include <memory>
+#include "GenericLinearSolver.h"
+
+#ifdef HAS_CHOLMOD
+extern "C"
+{
+  #include <cholmod.h>
+}
+#endif
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class GenericVector;
+  class GenericLinearOperator;
+
+  /// This class implements the direct solution (Cholesky
+  /// factorization) of linear systems of the form Ax = b. Sparse
+  /// matrices are solved using CHOLMOD
+  /// http://www.cise.ufl.edu/research/sparse/cholmod/ if installed.
+
+  class CholmodCholeskySolver : public GenericLinearSolver
+  {
+  public:
+
+    /// Constructor
+    CholmodCholeskySolver();
+
+    /// Constructor
+    CholmodCholeskySolver(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Destructor
+    ~CholmodCholeskySolver();
+
+    /// Solve the operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A)
+    {
+      dolfin_error("CholmodCholeskySolver.h",
+                   "set operator for CHOLMOD Cholesky solver",
+                   "Not implemented");
+    }
+
+    /// Solve linear system Ax = b for a sparse matrix using CHOLMOD
+    virtual std::size_t solve(const GenericLinearOperator& A,
+                              GenericVector& x,
+                              const GenericVector& b);
+
+    /// Cholesky-factor sparse matrix A if CHOLMOD is installed
+    virtual std::size_t factorize(const GenericLinearOperator& A);
+
+    /// Solve factorized system (CHOLMOD).
+    virtual std::size_t factorized_solve(GenericVector& x,
+                                         const GenericVector& b);
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+  private:
+
+    // Operator (the matrix)
+    std::shared_ptr<const GenericLinearOperator> _matA;
+
+#ifdef HAS_CHOLMOD
+    // Data for Cholesky factorization of sparse ublas matrix (cholmod only)
+    class Cholmod
+    {
+    public:
+
+      Cholmod();
+      ~Cholmod();
+
+      /// Clear data
+      void clear();
+
+      /// Initialise with matrix
+      void init(long int* Ap, long int* Ai, double* Ax, std::size_t M,
+                std::size_t nz);
+
+      /// Factorize
+      void factorize();
+
+      /// Factorized solve
+      void factorized_solve(double*x, const double* b);
+
+      std::size_t N;
+      bool factorized;
+
+    private:
+
+      /// Compute residual: b-Ax
+      cholmod_dense* residual(cholmod_dense* x, cholmod_dense* b);
+
+      /// Compute residual norm
+      double residual_norm(cholmod_dense* r, cholmod_dense* x,
+                           cholmod_dense* b);
+
+      /// Perform one refinement
+      void refine_once(cholmod_dense* x, cholmod_dense* r);
+
+      /// Check status flag returned by an CHOLMOD function
+      void check_status(std::string function);
+
+      // CHOLMOD data
+      cholmod_sparse* A_chol;
+      cholmod_factor* L_chol;
+      cholmod_common c;
+    };
+
+    Cholmod cholmod;
+#endif
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/CoordinateMatrix.cpp b/dolfin/la/CoordinateMatrix.cpp
new file mode 100644
index 0000000..8038907
--- /dev/null
+++ b/dolfin/la/CoordinateMatrix.cpp
@@ -0,0 +1,114 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-10-15
+// Last changed:
+
+#include <vector>
+#include "dolfin/common/MPI.h"
+#include "GenericMatrix.h"
+#include "CoordinateMatrix.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+CoordinateMatrix::CoordinateMatrix(const GenericMatrix& A, bool symmetric,
+                                   bool base_one)
+  : _mpi_comm(A.mpi_comm()), _symmetric(symmetric), _base_one(base_one)
+{
+  _size[0] = A.size(0);
+  _size[1] = A.size(1);
+
+  // Iterate over local rows
+  const std::pair<std::size_t, std::size_t> local_row_range = A.local_range(0);
+  if (!_symmetric)
+  {
+    for (std::size_t i = local_row_range.first; i < local_row_range.second; ++i)
+    {
+      // Get column and value data for row
+      std::vector<std::size_t> columns;
+      std::vector<double> values;
+      A.getrow(i, columns, values);
+
+      // Insert data at end
+      _rows.insert(_rows.end(), columns.size(), i);
+      _cols.insert(_cols.end(), columns.begin(), columns.end());
+      _vals.insert(_vals.end(), values.begin(), values.end());
+    }
+    dolfin_assert(_rows.size() == _cols.size());
+  }
+  else
+  {
+    dolfin_assert(_size[0] == _size[1]);
+    for (std::size_t i = local_row_range.first; i < local_row_range.second; ++i)
+    {
+      // Get column and value data for row
+      std::vector<std::size_t> columns;
+      std::vector<double> values;
+      A.getrow(i, columns, values);
+
+      for (std::size_t j = 0; j < columns.size(); ++j)
+      {
+        if (columns[j] >= i)
+        {
+          _rows.push_back(i);
+          _cols.push_back(columns[j]);
+          _vals.push_back(values[j]);
+        }
+      }
+    }
+    dolfin_assert(_rows.size() == _cols.size());
+  }
+
+  // Add 1 for Fortran-style indices
+  if (base_one)
+  {
+    for (std::size_t i = 0; i < _cols.size(); ++i)
+    {
+      _rows[i]++;
+      _cols[i]++;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+double CoordinateMatrix::norm(std::string norm_type) const
+{
+  if (norm_type != "frobenius")
+  {
+    error("Do not know to comput %s norm for CoordinateMatrix",
+          norm_type.c_str());
+  }
+
+  double _norm = 0.0;
+  if (!_symmetric)
+  {
+    for (std::size_t i = 0; i < _vals.size(); ++i)
+      _norm += _vals[i]*_vals[i];
+  }
+  else
+  {
+    for (std::size_t i = 0; i < _vals.size(); ++i)
+    {
+      if (_rows[i] == _cols[i])
+        _norm += _vals[i]*_vals[i];
+      else
+        _norm += 2.0*_vals[i]*_vals[i];
+    }
+  }
+  return std::sqrt(dolfin::MPI::sum(_mpi_comm, _norm));
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/CoordinateMatrix.h b/dolfin/la/CoordinateMatrix.h
new file mode 100644
index 0000000..2dc3193
--- /dev/null
+++ b/dolfin/la/CoordinateMatrix.h
@@ -0,0 +1,92 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-10-16
+// Last changed:
+
+#ifndef __DOLFIN_COORDINATE_MATRIX_H
+#define __DOLFIN_COORDINATE_MATRIX_H
+
+#include <string>
+#include <vector>
+#include <dolfin/common/types.h>
+#include <dolfin/common/MPI.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericMatrix;
+
+  /// Coordinate sparse matrix.
+
+  class CoordinateMatrix
+  {
+  public:
+
+    /// Constructor
+    CoordinateMatrix(const GenericMatrix& A, bool symmetric, bool base_one);
+
+    /// Destructor
+    virtual ~CoordinateMatrix() {}
+
+    std::size_t size(std::size_t dim) const
+    { return _size[dim]; }
+
+    const std::vector<std::size_t>& rows() const
+    { return _rows; }
+
+    const std::vector<std::size_t>& columns() const
+    { return _cols; }
+
+    const std::vector<double>& values() const
+    { return _vals; }
+
+    /// Return norm of matrix
+    double norm(std::string norm_type) const;
+
+    MPI_Comm mpi_comm() const
+    { return _mpi_comm; }
+
+    bool base_one() const
+    { return _base_one; }
+
+  private:
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+    // Row and column indices
+    std::vector<std::size_t> _rows;
+    std::vector<std::size_t> _cols;
+
+    // Storage of values
+    std::vector<double> _vals;
+
+    // Gobal size
+    std::size_t _size[2];
+
+    // Symmetric storage
+    const bool _symmetric;
+
+    // Array base (C/Fortran)
+    const bool _base_one;
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/DefaultFactory.cpp b/dolfin/la/DefaultFactory.cpp
new file mode 100644
index 0000000..8775985
--- /dev/null
+++ b/dolfin/la/DefaultFactory.cpp
@@ -0,0 +1,139 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Fredrik Valdmanis, 2011
+//
+// First added:  2008-05-17
+// Last changed: 2011-11-11
+
+#include <dolfin/parameter/GlobalParameters.h>
+#include "uBLASFactory.h"
+#include "PETScFactory.h"
+#include "PETScCuspFactory.h"
+#include "EpetraFactory.h"
+#include "STLFactory.h"
+#include "DefaultFactory.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericMatrix> DefaultFactory::create_matrix() const
+{
+  return factory().create_matrix();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> DefaultFactory::create_vector() const
+{
+  return factory().create_vector();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<TensorLayout>
+DefaultFactory::create_layout(std::size_t rank) const
+{
+  return factory().create_layout(rank);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLinearOperator>
+DefaultFactory::create_linear_operator() const
+{
+  return factory().create_linear_operator();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLUSolver>
+  DefaultFactory::create_lu_solver(std::string method) const
+{
+  return factory().create_lu_solver(method);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLinearSolver>
+DefaultFactory::create_krylov_solver(std::string method,
+                                     std::string preconditioner) const
+{
+  return factory().create_krylov_solver(method, preconditioner);
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+DefaultFactory::lu_solver_methods() const
+{
+  return factory().lu_solver_methods();
+}
+ //-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+DefaultFactory::krylov_solver_methods() const
+{
+  return factory().krylov_solver_methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+DefaultFactory::krylov_solver_preconditioners() const
+{
+  return factory().krylov_solver_preconditioners();
+}
+//-----------------------------------------------------------------------------
+GenericLinearAlgebraFactory& DefaultFactory::factory()
+{
+  // Fallback
+  const std::string default_backend = "uBLAS";
+  typedef uBLASFactory<> DefaultFactory;
+
+  // Get backend from parameter system
+  const std::string backend = dolfin::parameters["linear_algebra_backend"];
+
+  // Choose backend
+  if (backend == "uBLAS")
+    return uBLASFactory<>::instance();
+  else if (backend == "PETSc")
+  {
+    #ifdef HAS_PETSC
+    return PETScFactory::instance();
+    #else
+    dolfin_error("DefaultFactory.cpp",
+                 "access linear algebra backend",
+                 "PETSc linear algebra backend is not available");
+    #endif
+  }
+  else if (backend == "PETScCusp")
+  {
+    #ifdef HAS_PETSC_CUSP
+    return PETScCuspFactory::instance();
+    #else
+    dolfin_error("DefaultFactory.cpp",
+                 "access linear algebra backend",
+                 "PETScCusp linear algebra backend is not available");
+    #endif
+  }
+  else if (backend == "Epetra")
+  {
+    #ifdef HAS_TRILINOS
+    return EpetraFactory::instance();
+    #else
+    dolfin_error("DefaultFactory.cpp",
+                 "access linear algebra backend",
+                 "Trilinos linear algebra backend is not available");
+    #endif
+  }
+  else if (backend == "STL")
+  {
+    return STLFactory::instance();
+  }
+
+  // Fallback
+  log(WARNING, "Linear algebra backend \"" + backend
+      + "\" not available, using " + default_backend + ".");
+  return DefaultFactory::instance();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/DefaultFactory.h b/dolfin/la/DefaultFactory.h
new file mode 100644
index 0000000..0824a6c
--- /dev/null
+++ b/dolfin/la/DefaultFactory.h
@@ -0,0 +1,84 @@
+// Copyright (C) 2008-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-05-17
+// Last changed: 2012-08-21
+
+#ifndef __DEFAULT_FACTORY_H
+#define __DEFAULT_FACTORY_H
+
+#include <string>
+#include <memory>
+#include <dolfin/common/types.h>
+#include "GenericLinearAlgebraFactory.h"
+
+namespace dolfin
+{
+
+  class DefaultFactory : public GenericLinearAlgebraFactory
+  {
+
+    class GenericLinearSolver;
+
+    public:
+
+    /// Constructor
+    DefaultFactory() {}
+
+    /// Destructor
+    virtual ~DefaultFactory() {}
+
+    /// Create empty matrix
+    virtual std::shared_ptr<GenericMatrix> create_matrix() const;
+
+    /// Create empty vector
+    virtual std::shared_ptr<GenericVector> create_vector() const;
+
+    /// Create empty tensor layout
+    virtual std::shared_ptr<TensorLayout> create_layout(std::size_t rank) const;
+
+    /// Create empty linear operator
+    virtual std::shared_ptr<GenericLinearOperator> create_linear_operator() const;
+
+    /// Create LU solver
+    virtual std::shared_ptr<dolfin::GenericLUSolver>
+      create_lu_solver(std::string method) const;
+
+    /// Create Krylov solver
+    virtual std::shared_ptr<dolfin::GenericLinearSolver>
+      create_krylov_solver(std::string method, std::string preconditioner) const;
+
+    /// Return a list of available LU solver methods
+    std::vector<std::pair<std::string, std::string> >
+      lu_solver_methods() const;
+
+    /// Return a list of available Krylov solver methods
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_methods() const;
+
+    /// Return a list of available preconditioners
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_preconditioners() const;
+
+    /// Return instance of default backend
+    static GenericLinearAlgebraFactory& factory();
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/EpetraFactory.cpp b/dolfin/la/EpetraFactory.cpp
new file mode 100644
index 0000000..fea5d33
--- /dev/null
+++ b/dolfin/la/EpetraFactory.cpp
@@ -0,0 +1,113 @@
+// Copyright (C) 2008 Martin Sandve Alnes, Kent-Andre Mardal and Johannes Ring
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2008-04-21
+// Last changed: 2011-11-02
+
+#ifdef HAS_TRILINOS
+
+#include "dolfin/common/MPI.h"
+
+#include <Epetra_MpiComm.h>
+#include <Epetra_SerialComm.h>
+
+#include "dolfin/common/SubSystemsManager.h"
+#include "SparsityPattern.h"
+#include "EpetraLUSolver.h"
+#include "EpetraMatrix.h"
+#include "EpetraVector.h"
+#include "EpetraFactory.h"
+
+#include "EpetraKrylovSolver.h"
+
+using namespace dolfin;
+
+// Singleton instance
+EpetraFactory EpetraFactory::factory;
+
+//-----------------------------------------------------------------------------
+EpetraFactory::EpetraFactory()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+EpetraFactory::~EpetraFactory()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericMatrix> EpetraFactory::create_matrix() const
+{
+  std::shared_ptr<GenericMatrix> A(new EpetraMatrix);
+  return A;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> EpetraFactory::create_vector() const
+{
+  std::shared_ptr<GenericVector> x(new EpetraVector);
+  return x;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<TensorLayout> EpetraFactory::create_layout(std::size_t rank) const
+{
+  bool sparsity = false;
+  if (rank > 1)
+    sparsity = true;
+  std::shared_ptr<TensorLayout> pattern(new TensorLayout(0, sparsity));
+  return pattern;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLinearOperator> EpetraFactory::create_linear_operator() const
+{
+  std::shared_ptr<GenericLinearOperator> A(new NotImplementedLinearOperator);
+  return A;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLUSolver> EpetraFactory::create_lu_solver(std::string method) const
+{
+  std::shared_ptr<GenericLUSolver> solver(new EpetraLUSolver(method));
+  return solver;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLinearSolver> EpetraFactory::create_krylov_solver(std::string method,
+                                              std::string preconditioner) const
+{
+  std::shared_ptr<GenericLinearSolver> solver(new EpetraKrylovSolver(method, preconditioner));
+  return solver;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+  EpetraFactory::lu_solver_methods() const
+{
+  return EpetraLUSolver::methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+EpetraFactory::krylov_solver_methods() const
+{
+  return EpetraKrylovSolver::methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+  EpetraFactory::krylov_solver_preconditioners() const
+{
+  return EpetraKrylovSolver::preconditioners();
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/la/EpetraFactory.h b/dolfin/la/EpetraFactory.h
new file mode 100644
index 0000000..2949576
--- /dev/null
+++ b/dolfin/la/EpetraFactory.h
@@ -0,0 +1,103 @@
+// Copyright (C) 2008 Martin Sandve Alnes, Kent-Andre Mardal and Johannes Ring
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011-2012
+//
+// First added:  2008-04-21
+// Last changed: 2012-08-20
+
+#ifdef HAS_TRILINOS
+
+#ifndef __EPETRA_FACTORY_H
+#define __EPETRA_FACTORY_H
+
+#include <string>
+#include <memory>
+#include "EpetraKrylovSolver.h"
+#include "EpetraLUSolver.h"
+#include "EpetraMatrix.h"
+#include "EpetraVector.h"
+#include "TensorLayout.h"
+#include "GenericLinearAlgebraFactory.h"
+
+namespace dolfin
+{
+
+  class GenericLinearSolver;
+
+  class EpetraFactory : public GenericLinearAlgebraFactory
+  {
+  public:
+
+    /// Destructor
+    virtual ~EpetraFactory();
+
+    /// --- GenericLinearAlgebraFactory interface
+
+    /// Create empty matrix
+    std::shared_ptr<GenericMatrix> create_matrix() const;
+
+    /// Create empty vector
+    std::shared_ptr<GenericVector> create_vector() const;
+
+    /// Create empty tensor layout
+    std::shared_ptr<TensorLayout> create_layout(std::size_t rank) const;
+
+    /// Create empty linear operator
+    std::shared_ptr<GenericLinearOperator> create_linear_operator() const;
+
+    /// Create LU solver
+    std::shared_ptr<GenericLUSolver>
+      create_lu_solver(std::string method) const;
+
+    /// Create Krylov solver
+    std::shared_ptr<GenericLinearSolver>
+      create_krylov_solver(std::string method, std::string preconditioner) const;
+
+    /// Return a list of available LU solver methods
+    std::vector<std::pair<std::string, std::string> >
+    lu_solver_methods() const;
+
+    /// Return a list of available Krylov solver methods
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_methods() const;
+
+    /// Return a list of available preconditioners
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_preconditioners() const;
+
+    /// --- EpetraFactory interface
+
+    // Return singleton instance
+    static EpetraFactory& instance()
+    { return factory; }
+
+  private:
+
+    // Private constructor
+    EpetraFactory();
+
+    // Singleton instance
+    static EpetraFactory factory;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/EpetraKrylovSolver.cpp b/dolfin/la/EpetraKrylovSolver.cpp
new file mode 100644
index 0000000..8837732
--- /dev/null
+++ b/dolfin/la/EpetraKrylovSolver.cpp
@@ -0,0 +1,341 @@
+// Copyright (C) 2008-2011 Kent-Andre Mardal and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+#ifdef HAS_TRILINOS
+
+#include <boost/assign/list_of.hpp>
+
+#include <dolfin/common/MPI.h>
+
+#include <Epetra_Comm.h>
+#include <Epetra_ConfigDefs.h>
+#include <Epetra_CrsMatrix.h>
+#include <Epetra_FECrsMatrix.h>
+#include <Epetra_FEVector.h>
+#include <Epetra_LinearProblem.h>
+#include <Epetra_Operator.h>
+#include <Epetra_Vector.h>
+#include <Epetra_Map.h>
+#include <Epetra_LinearProblem.h>
+#include <BelosLinearProblem.hpp>
+#include <BelosEpetraAdapter.hpp>
+#include <BelosSolverFactory.hpp>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/log/dolfin_log.h>
+#include "EpetraMatrix.h"
+#include "EpetraVector.h"
+#include "GenericLinearOperator.h"
+#include "GenericVector.h"
+#include "KrylovSolver.h"
+#include "TrilinosPreconditioner.h"
+#include "EpetraKrylovSolver.h"
+
+using namespace dolfin;
+
+// List of available solvers
+const std::map<std::string, std::string> EpetraKrylovSolver::_methods
+  = boost::assign::map_list_of("default", "GMRES")
+                              ("cg",      "CG")
+                              ("gmres",   "GMRES")
+                              ("minres",  "MINRES")
+                              ("rcg",     "RCG")
+                              ("gcrodr",  "GCRODR")
+                              ("lsqr",    "LSQR");
+
+// List of available solvers descriptions
+const std::vector<std::pair<std::string, std::string> >
+EpetraKrylovSolver::_methods_descr = boost::assign::pair_list_of
+  ("default", "default Krylov method")
+  ("cg",      "Conjugate gradient method")
+  ("gmres",   "Generalized minimal residual method")
+  ("minres",  "Minimal residual method")
+  ("rcg",     "Recycling conjugate gradient method")
+  ("gcrodr",  "Block recycling GMRES method")
+  ("lsqr",    "Least-squared QR method");
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> > EpetraKrylovSolver::methods()
+{
+  return EpetraKrylovSolver::_methods_descr;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+EpetraKrylovSolver::preconditioners()
+{
+  return TrilinosPreconditioner::preconditioners();
+}
+//-----------------------------------------------------------------------------
+Parameters EpetraKrylovSolver::default_parameters()
+{
+  Parameters p(KrylovSolver::default_parameters());
+  p.rename("epetra_krylov_solver");
+  p.add("monitor_interval", 1);
+  return p;
+}
+//-----------------------------------------------------------------------------
+EpetraKrylovSolver::EpetraKrylovSolver(std::string method,
+                                       std::string preconditioner)
+  : _method(method),
+    _preconditioner(new TrilinosPreconditioner(preconditioner)),
+    _relative_residual(0.0),
+    _absolute_residual(0.0)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  // Check that requsted solver is supported
+  if (_methods.count(method) == 0)
+  {
+    dolfin_error("EpetraKrylovSolver.cpp",
+                 "create Epetra Krylov solver",
+                 "Unknown Krylov method \"%s\"", method.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+EpetraKrylovSolver::EpetraKrylovSolver(std::string method,
+                                       TrilinosPreconditioner& preconditioner)
+  : _method(method),
+    _preconditioner(reference_to_no_delete_pointer(preconditioner)),
+    _relative_residual(0.0), _absolute_residual(0.0)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  // Check that requsted solver is supported
+  if (_methods.count(method) == 0)
+  {
+    dolfin_error("EpetraKrylovSolver.cpp",
+                 "create Epetra Krylov solver",
+                 "Unknown Krylov method \"%s\"", method.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+EpetraKrylovSolver::~EpetraKrylovSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void EpetraKrylovSolver::set_operator(std::shared_ptr<const GenericLinearOperator> A)
+{
+  set_operators(A, A);
+}
+//-----------------------------------------------------------------------------
+void EpetraKrylovSolver::set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                                       std::shared_ptr<const GenericLinearOperator> P)
+{
+  _matA = as_type<const EpetraMatrix>(require_matrix(A));
+  _matP = as_type<const EpetraMatrix>(require_matrix(P));
+  dolfin_assert(_matA);
+  dolfin_assert(_matP);
+}
+//-----------------------------------------------------------------------------
+const GenericLinearOperator& EpetraKrylovSolver::get_operator() const
+{
+  if (!_matA)
+  {
+    dolfin_error("EpetraKrylovSolver.cpp",
+                 "access operator for Epetra Krylov solver",
+                 "Operator has not been set");
+  }
+  return *_matA;
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraKrylovSolver::solve(GenericVector& x,
+                                      const GenericVector& b)
+{
+  return solve(as_type<EpetraVector>(x), as_type<const EpetraVector>(b));
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraKrylovSolver::solve(EpetraVector& x, const EpetraVector& b)
+{
+  Timer timer("Epetra Krylov solver");
+
+  dolfin_assert(_matA);
+  dolfin_assert(_matP);
+
+  // Check dimensions
+  const std::size_t M = _matA->size(0);
+  const std::size_t N = _matA->size(1);
+  if (M != b.size())
+  {
+    dolfin_error("EpetraKrylovSolver.cpp",
+                 "solve linear system using Epetra Krylov solver",
+                 "Non-matching dimensions for linear system");
+  }
+
+  // Write a message
+  const bool report = parameters["report"];
+  if (report && _matA->mat()->Comm().MyPID() == 0)
+  {
+    info("Solving linear system of size %d x %d (Epetra Krylov solver).",
+         M, N);
+  }
+
+  // Reinitialize solution vector if necessary
+  if (x.empty())
+  {
+    _matA->init_vector(x, 1);
+    x.zero();
+  }
+  else if (!parameters["nonzero_initial_guess"])
+    x.zero();
+
+  // Create linear problem
+  // Make clear that the RCP doesn't own the memory and thus doesn't try
+  // to destroy the object when it goes out of scope.
+  Teuchos::RCP<BelosLinearProblem> linear_problem
+    = Teuchos::rcp(new BelosLinearProblem(
+                     Teuchos::rcp(_matA->mat().get(), false),
+                     Teuchos::rcp(x.vec().get(), false),
+                     Teuchos::rcp(b.vec().get(), false)));
+  const bool success = linear_problem->setProblem();
+  dolfin_assert(success);
+
+  // Set output level
+  Teuchos::ParameterList belosList;
+  int verbosity = Belos::Errors + Belos::Warnings;
+  if (parameters["monitor_convergence"])
+  {
+    verbosity += Belos::IterationDetails;
+    verbosity += Belos::OrthoDetails;
+    verbosity += Belos::StatusTestDetails;
+    belosList.set("Output Frequency", (int)parameters["monitor_interval"]);
+    belosList.set("Output Style", Belos::Brief);
+  }
+
+  if (parameters["report"])
+    verbosity += Belos::TimingDetails;
+
+  belosList.set("Verbosity", verbosity);
+  belosList.set("Convergence Tolerance",
+                (double)parameters["relative_tolerance"]);
+  belosList.set("Maximum Iterations", (int)parameters["maximum_iterations"]);
+
+  // Set preconditioner
+  dolfin_assert(_matP);
+  _preconditioner->set(*linear_problem, *_matP);
+
+  // Look up the Belos name of the method in _methods. This is a
+  // little complicated since std::maps<> don't have const lookup.
+  std::map<std::string, std::string>::const_iterator
+    it = _methods.find(_method);
+  if (it == _methods.end())
+  {
+    dolfin_error("EpetraKrylovSolver.cpp",
+                 "solve linear system using Epetra Krylov solver",
+                 "unknown method \"%s\"", _method.c_str());
+  }
+
+  // Set-up linear solver
+  Belos::SolverFactory<BelosScalarType,BelosMultiVector, BelosOperator> factory;
+  Teuchos::RCP<Belos::SolverManager<BelosScalarType,
+                                    BelosMultiVector, BelosOperator> > solver
+    = factory.create(it->second, Teuchos::rcp(&belosList, false));
+  solver->setProblem(linear_problem);
+
+  // Start solve
+  Belos::ReturnType ret = solver->solve();
+  if (ret == Belos::Converged)
+  {
+    if (parameters["report"])
+    {
+      info("Epetra (Belos) Krylov solver (%s, %s) converged in %d iterations.",
+           _method.c_str(),
+           _preconditioner->name().c_str(),
+           solver->getNumIters());
+    }
+  }
+  else if (ret == Belos::Unconverged)
+  {
+    std::stringstream message;
+    message << "Epetra (Belos) Krylov solver (" << _method << ", "
+            << _preconditioner->name() << ") "
+            << "failed to converge after " << solver->getNumIters()
+            << " iterations ";
+
+    if (parameters["error_on_nonconvergence"])
+    {
+      dolfin_error("EpetraKrylovSolver.cpp",
+                   "solve linear system using Epetra Krylov solver",
+                   message.str());
+    }
+    else
+      warning(message.str());
+  }
+  else
+  {
+    dolfin_error("EpetraKrylovSolver.cpp",
+                 "solve linear system using Epetra Krylov solver",
+                 "illegal Belos return code");
+  }
+
+  // TODO
+  // Update residuals
+  //_absolute_residual = solver->TrueResidual();
+  //_relative_residual = solver->ScaledResidual();
+
+  // Update ghost values
+  x.update_ghost_values();
+
+  // Return number of iterations
+  return solver->getNumIters();
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraKrylovSolver::solve(const GenericLinearOperator& A,
+                                      GenericVector& x,
+                                      const GenericVector& b)
+{
+  return solve(as_type<const EpetraMatrix>(require_matrix(A)),
+               as_type<EpetraVector>(x),
+               as_type<const EpetraVector>(b));
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraKrylovSolver::solve(const EpetraMatrix& A, EpetraVector& x,
+                                      const EpetraVector& b)
+{
+  std::shared_ptr<const EpetraMatrix> Atmp(&A, NoDeleter());
+  set_operator(Atmp);
+  return solve(x, b);
+}
+//-----------------------------------------------------------------------------
+double EpetraKrylovSolver::residual(const std::string residual_type) const
+{
+  dolfin_error("EpetraKrylovSolver.cpp",
+               "compute residual of Epetra Krylov solver",
+               "Not yet implemented");
+
+  if (residual_type == "relative")
+    return _relative_residual;
+  else if (residual_type == "absolute")
+    return _absolute_residual;
+  else
+  {
+    dolfin_error("EpetraKrylovSolver.cpp",
+                 "compute residual of Epetra Krylov solver",
+                 "Unknown residual type: \"%s\"", residual_type.c_str()
+                 );
+    return 0.0;
+  }
+}
+//-----------------------------------------------------------------------------
+std::string EpetraKrylovSolver::str(bool verbose) const
+{
+  dolfin_not_implemented();
+  return std::string();
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/la/EpetraKrylovSolver.h b/dolfin/la/EpetraKrylovSolver.h
new file mode 100644
index 0000000..6eb3c3c
--- /dev/null
+++ b/dolfin/la/EpetraKrylovSolver.h
@@ -0,0 +1,138 @@
+// Copyright (C) 2008-2011 Kent-Andre Mardal and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2011
+// Modified by Garth N. Wells 2009
+//
+// First added:  2008
+// Last changed: 2011-10-19
+
+#ifdef HAS_TRILINOS
+
+#ifndef __EPETRA_KRYLOV_SOLVER_H
+#define __EPETRA_KRYLOV_SOLVER_H
+
+#include <map>
+#include <memory>
+#include <string>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/types.h>
+#include "GenericLinearSolver.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericLinearOperator;
+  class GenericVector;
+  class EpetraMatrix;
+  class EpetraVector;
+  class EpetraLinearOperator;
+  class EpetraUserPreconditioner;
+  class TrilinosPreconditioner;
+
+  /// This class implements Krylov methods for linear systems of the
+  /// form Ax = b. It is a wrapper for the Krylov solvers of Epetra.
+
+  class EpetraKrylovSolver : public GenericLinearSolver
+  {
+  public:
+
+    /// Create Krylov solver for a particular method and
+    /// preconditioner
+    EpetraKrylovSolver(std::string method = "default",
+                       std::string preconditioner = "default");
+
+    /// Create Krylov solver for a particular method and
+    /// TrilinosPreconditioner
+    EpetraKrylovSolver(std::string method,
+                       TrilinosPreconditioner& preconditioner);
+
+    /// Destructor
+    ~EpetraKrylovSolver();
+
+    /// Set the operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Set the operator (matrix)
+    void set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                       std::shared_ptr<const GenericLinearOperator> P);
+
+    /// Get the operator (matrix)
+    const GenericLinearOperator& get_operator() const;
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(EpetraVector& x, const EpetraVector& b);
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                      const GenericVector& b);
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(const EpetraMatrix& A, EpetraVector& x,
+                      const EpetraVector& b);
+
+    /// Return residual from most recent solve
+    double residual(const std::string residualtype) const;
+
+    /// Return a list of available solver methods
+    static std::vector<std::pair<std::string, std::string> > methods();
+
+    /// Return a list of available preconditioners
+    static std::vector<std::pair<std::string, std::string> > preconditioners();
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+  private:
+
+    // Solver type
+    std::string _method;
+
+    // Available solvers
+    static const std::map<std::string, std::string> _methods;
+
+    // Available solvers descriptions
+    static const std::vector<std::pair<std::string, std::string> >
+      _methods_descr;
+
+    // Operator (the matrix)
+    std::shared_ptr<const EpetraMatrix> _matA;
+
+    // Matrix used to construct the preconditoner
+    std::shared_ptr<const EpetraMatrix> _matP;
+
+    // Preconditioner
+    std::shared_ptr<TrilinosPreconditioner> _preconditioner;
+
+    // Residuals
+    double _relative_residual;
+    double _absolute_residual;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/EpetraLUSolver.cpp b/dolfin/la/EpetraLUSolver.cpp
new file mode 100644
index 0000000..4f9542a
--- /dev/null
+++ b/dolfin/la/EpetraLUSolver.cpp
@@ -0,0 +1,337 @@
+// Copyright (C) 2008-2010 Kent-Andre Mardal and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011-2012
+//
+// First added:  2008
+// Last changed: 2012-08-22
+
+#ifdef HAS_TRILINOS
+
+// Included here to avoid a C++ problem with some MPI implementations
+#include <dolfin/common/MPI.h>
+
+#include <Amesos.h>
+#include <Amesos_BaseSolver.h>
+#include <Amesos_ConfigDefs.h>
+#include <Amesos_Klu.h>
+#include <Epetra_FECrsMatrix.h>
+#include <Epetra_FEVector.h>
+#include <Epetra_LinearProblem.h>
+#include <Epetra_MultiVector.h>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Timer.h>
+#include "GenericLinearOperator.h"
+#include "GenericVector.h"
+#include "EpetraMatrix.h"
+#include "EpetraVector.h"
+#include "LUSolver.h"
+#include "EpetraLUSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+EpetraLUSolver::methods()
+{
+  static std::vector<std::pair<std::string, std::string> > m;
+
+  m.push_back(std::make_pair("default", "default LU solver"));
+  m.push_back(std::make_pair("umfpack", "UMFPACK (Unsymmetric MultiFrontal sparse LU factorization)"));
+  m.push_back(std::make_pair("mumps", "MUMPS (MUltifrontal Massively Parallel Sparse direct Solver)"));
+  m.push_back(std::make_pair("klu", "Trilinos KLU"));
+
+  return m;
+}
+//-----------------------------------------------------------------------------
+std::string EpetraLUSolver::choose_method(std::string method) const
+{
+  Amesos factory;
+  if (method == "default")
+  {
+    if (factory.Query("Amesos_Mumps"))
+      method = "Amesos_Mumps";
+    else if (factory.Query("Amesos_Umfpack"))
+      method = "Amesos_Umfpack";
+    else if (factory.Query("Amesos_Klu"))
+      method = "Amesos_Klu";
+    else
+    {
+      dolfin_error("EpetraLUSolver.cpp",
+                   "choose default Epetra LU solver",
+                   "No methods available");
+    }
+  }
+  else if (method == "umfpack")
+    method = "Amesos_Umfpack";
+  else if (method == "mumps")
+    method = "Amesos_mumps";
+  else if (method == "klu")
+    method = "Amesos_Klu";
+  else
+  {
+    dolfin_error("EpetraLUSolver.cpp",
+                 "solve linear system",
+                 "Unknown LU solver method \"%s\". "
+                 "Use list_lu_solver_methods() to list available methods",
+                 method.c_str());
+  }
+
+  return method;
+}
+//-----------------------------------------------------------------------------
+Parameters EpetraLUSolver::default_parameters()
+{
+  Parameters p(LUSolver::default_parameters());
+  p.rename("epetra_lu_solver");
+  return p;
+}
+//-----------------------------------------------------------------------------
+EpetraLUSolver::EpetraLUSolver(std::string method)
+  : symbolic_factorized(false),
+    numeric_factorized(false),
+    linear_problem(new Epetra_LinearProblem)
+{
+  // Set default parameters
+  parameters = default_parameters();
+
+  // Choose method
+  _method = choose_method(method);
+
+  // Initialize solver
+  Amesos factory;
+  solver.reset(factory.Create(_method, *linear_problem));
+
+  // Check that solver was initialized correctly
+  if (!solver)
+  {
+    dolfin_error("EpetraLUSolver.cpp",
+                 "create Epetra LU solver",
+                 "Epetra was not able to create linear solver \"%s\"",
+                 _method.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+EpetraLUSolver::EpetraLUSolver(std::shared_ptr<const GenericLinearOperator> A,
+                               std::string method)
+  : symbolic_factorized(false),
+    numeric_factorized(false),
+    linear_problem(new Epetra_LinearProblem)
+{
+  // Set default parameters
+  parameters = default_parameters();
+
+  // Set operator
+  _matA = as_type<const EpetraMatrix>(require_matrix(A));
+  dolfin_assert(_matA);
+
+  // Choose method
+  _method = choose_method(method);
+
+  // Initialize solver
+  Amesos factory;
+  solver.reset(factory.Create(_method, *linear_problem));
+
+  // Check that solver was initialized correctly
+  if (!solver)
+  {
+    dolfin_error("EpetraLUSolver.cpp",
+                 "create Epetra LU solver",
+                 "Epetra was not able to create linear solver \"%s\"",
+                 _method.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+EpetraLUSolver::~EpetraLUSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void
+EpetraLUSolver::set_operator(std::shared_ptr<const GenericLinearOperator> A)
+{
+  dolfin_assert(linear_problem);
+
+  _matA = as_type<const EpetraMatrix>(require_matrix(A));
+  dolfin_assert(_matA);
+  linear_problem->SetOperator(_matA->mat().get());
+
+  symbolic_factorized = false;
+  numeric_factorized  = false;
+}
+//-----------------------------------------------------------------------------
+const GenericLinearOperator& EpetraLUSolver::get_operator() const
+{
+  if (!_matA)
+  {
+    dolfin_error("EpetraLUSolver.cpp",
+                 "access operator for Epetra LU solver",
+                 "Operator has not been set");
+  }
+  return *_matA;
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraLUSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  Timer timer("Epetra LU solver");
+
+  dolfin_assert(linear_problem);
+  dolfin_assert(solver);
+
+  // Write a message
+  if (parameters["report"] && dolfin::MPI::rank(MPI_COMM_WORLD) == 0)
+  {
+    if (solver->UseTranspose())
+    {
+      info("Solving linear system transposed of size %d x %d using Epetra LU solver (%s).",
+           _matA->size(0), _matA->size(1), _method.c_str());
+    }
+    else
+    {
+      info("Solving linear system of size %d x %d using Epetra LU solver (%s).",
+           _matA->size(0), _matA->size(1), _method.c_str());
+    }
+  }
+
+  // Downcast vector
+  EpetraVector& _x = as_type<EpetraVector>(x);
+  const EpetraVector& _b = as_type<const EpetraVector>(b);
+
+  // Get operator matrix
+  const Epetra_RowMatrix* A = linear_problem->GetMatrix();
+  if (!A)
+  {
+    dolfin_error("EpetraLUSolver.cpp",
+                 "solve linear system using Epetra LU solver",
+                 "Operator has not been set");
+  }
+
+  const std::size_t N = A->NumGlobalCols64();
+  if (N != b.size())
+  {
+    dolfin_error("EpetraLUSolver.cpp",
+                 "solve linear system using Epetra LU solver",
+                 "Non-matching dimensions for linear system");
+  }
+
+  // Initialize solution vector
+  if (x.empty())
+  {
+    _matA->init_vector(x, 1);
+    x.zero();
+  }
+
+  // Set LHS and RHS vectors
+  linear_problem->SetRHS(_b.vec().get());
+  linear_problem->SetLHS(_x.vec().get());
+
+  // Get some parameters
+  const bool reuse_fact   = parameters["reuse_factorization"];
+  const bool same_pattern = parameters["same_nonzero_pattern"];
+
+  // Perform symbolic factorization
+  if ( (reuse_fact || same_pattern) && !symbolic_factorized )
+  {
+    AMESOS_CHK_ERR(solver->SymbolicFactorization());
+    symbolic_factorized = true;
+  }
+  else if (!reuse_fact && !same_pattern)
+  {
+    AMESOS_CHK_ERR(solver->SymbolicFactorization());
+    symbolic_factorized = true;
+  }
+
+  // Perform numeric factorization
+  if (reuse_fact && !numeric_factorized)
+  {
+    AMESOS_CHK_ERR(solver->NumericFactorization());
+    numeric_factorized = true;
+  }
+  else if (!reuse_fact)
+  {
+    AMESOS_CHK_ERR(solver->NumericFactorization());
+    numeric_factorized = true;
+  }
+
+  // Solve
+  AMESOS_CHK_ERR(solver->Solve());
+
+  // Update ghost values
+  _x.update_ghost_values();
+
+  return 1;
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraLUSolver::solve(const GenericLinearOperator& A,
+                                  GenericVector& x,
+                                  const GenericVector& b)
+{
+  return solve(as_type<const EpetraMatrix>(require_matrix(A)),
+               as_type<EpetraVector>(x),
+               as_type<const EpetraVector>(b));
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraLUSolver::solve(const EpetraMatrix& A, EpetraVector& x,
+                                  const EpetraVector& b)
+{
+  std::shared_ptr<const EpetraMatrix> Atmp(&A, NoDeleter());
+  set_operator(Atmp);
+  return solve(x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraLUSolver::solve_transpose(GenericVector& x,
+                                            const GenericVector& b)
+{
+  dolfin_assert(solver);
+  solver->SetUseTranspose(true);
+  std::size_t out = solve(x, b);
+  solver->SetUseTranspose(false);
+  return out;
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraLUSolver::solve_transpose(const GenericLinearOperator& A,
+                                            GenericVector& x,
+                                            const GenericVector& b)
+{
+  dolfin_assert(solver);
+  solver->SetUseTranspose(true);
+  std::size_t out = solve(A, x, b);
+  solver->SetUseTranspose(false);
+  return out;
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraLUSolver::solve_transpose(const EpetraMatrix& A,
+                                            EpetraVector& x,
+                                            const EpetraVector& b)
+{
+  dolfin_assert(solver);
+  solver->SetUseTranspose(true);
+  std::size_t out = solve(A, x, b);
+  solver->SetUseTranspose(false);
+  return out;
+}
+//-----------------------------------------------------------------------------
+std::string EpetraLUSolver::str(bool verbose) const
+{
+  dolfin_not_implemented();
+  return std::string();
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/EpetraLUSolver.h b/dolfin/la/EpetraLUSolver.h
new file mode 100644
index 0000000..b114073
--- /dev/null
+++ b/dolfin/la/EpetraLUSolver.h
@@ -0,0 +1,123 @@
+// Copyright (C) 2008-2010 Kent-Andre Mardal and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2008
+// Last changed: 2011-10-19
+
+#ifdef HAS_TRILINOS
+
+#ifndef __EPETRA_LU_SOLVER_H
+#define __EPETRA_LU_SOLVER_H
+
+#include <memory>
+#include "GenericLUSolver.h"
+
+/// Forward declaration
+class Amesos_BaseSolver;
+class Epetra_LinearProblem;
+
+namespace dolfin
+{
+  /// Forward declarations
+  class GenericLinearOperator;
+  class GenericVector;
+  class EpetraMatrix;
+  class EpetraVector;
+
+  /// This class implements the direct solution (LU factorization) for
+  /// linear systems of the form Ax = b. It is a wrapper for the LU
+  /// solver of Epetra.
+
+  class EpetraLUSolver : public GenericLUSolver
+  {
+  public:
+
+    /// Constructor
+    EpetraLUSolver(std::string method="default");
+
+    /// Constructor
+    EpetraLUSolver(std::shared_ptr<const GenericLinearOperator> A,
+                   std::string method="default");
+
+    /// Destructor
+    ~EpetraLUSolver();
+
+    /// Set operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Get operator (matrix)
+    const GenericLinearOperator& get_operator() const;
+
+    /// Solve linear system Ax = b
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                      const GenericVector& b);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(const EpetraMatrix& A, EpetraVector& x,
+                      const EpetraVector& b);
+
+    /// Solve linear system A^Tx = b
+    std::size_t solve_transpose(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system A^Tx = b
+    std::size_t solve_transpose(const GenericLinearOperator& A,
+                                GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system A^Tx = b
+    std::size_t solve_transpose(const EpetraMatrix& A, EpetraVector& x,
+                                const EpetraVector& b);
+
+    /// Return a list of available solver methods
+    static std::vector<std::pair<std::string, std::string> > methods();
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+  private:
+
+    // Choose method / solver package
+    std::string choose_method(std::string method) const;
+
+    bool symbolic_factorized, numeric_factorized;
+
+    // Operator (the matrix)
+    std::shared_ptr<const EpetraMatrix> _matA;
+
+    // Epetra linear problem
+    std::unique_ptr<Epetra_LinearProblem> linear_problem;
+
+    // Linear solver
+    std::unique_ptr<Amesos_BaseSolver> solver;
+
+    // Solver method
+    std::string _method;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/EpetraMatrix.cpp b/dolfin/la/EpetraMatrix.cpp
new file mode 100644
index 0000000..42b5479
--- /dev/null
+++ b/dolfin/la/EpetraMatrix.cpp
@@ -0,0 +1,814 @@
+// Copyright (C) 2008 Martin Sandve Alnes, Kent-Andre Mardal and Johannes Ring
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2012
+// Modified by Garth N. Wells 2008-2010
+// Modified by Mikael Mortensen 2011
+//
+// First added:  2008-04-21
+// Last changed: 2012-03-15
+
+#ifdef HAS_TRILINOS
+
+// Included here to avoid a C++ problem with some MPI implementations
+#include <dolfin/common/MPI.h>
+
+#include <cstring>
+#include <iostream>
+#include <iomanip>
+#include <set>
+#include <sstream>
+#include <utility>
+
+#include <Epetra_BlockMap.h>
+#include <Epetra_CrsGraph.h>
+#include <Epetra_CrsMatrix.h>
+#include <Epetra_FECrsGraph.h>
+#include <Epetra_FECrsMatrix.h>
+#include <Epetra_FEVector.h>
+#include <Epetra_Vector.h>
+#include <Epetra_MpiComm.h>
+#include <Epetra_SerialComm.h>
+#include <EpetraExt_MatrixMatrix.h>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/log/dolfin_log.h>
+#include "EpetraVector.h"
+#include "GenericSparsityPattern.h"
+#include "SparsityPattern.h"
+#include "EpetraFactory.h"
+#include "TensorLayout.h"
+#include "EpetraMatrix.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+EpetraMatrix::EpetraMatrix()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+EpetraMatrix::EpetraMatrix(const EpetraMatrix& A)
+{
+  if (A.mat())
+    _matA.reset(new Epetra_FECrsMatrix(*A.mat()));
+}
+//-----------------------------------------------------------------------------
+EpetraMatrix::EpetraMatrix(Teuchos::RCP<Epetra_FECrsMatrix> A)
+  : _matA(reference_to_no_delete_pointer(*A.get())), ref_keeper(A)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+EpetraMatrix::EpetraMatrix(std::shared_ptr<Epetra_FECrsMatrix> A) : _matA(A)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+EpetraMatrix::EpetraMatrix(const Epetra_CrsGraph& graph)
+    : _matA(new Epetra_FECrsMatrix(Copy, graph))
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+EpetraMatrix::~EpetraMatrix()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::init(const TensorLayout& tensor_layout)
+{
+  if (!empty())
+  {
+    #ifdef DOLFIN_DEPRECATION_ERROR
+    error("EpetraMatrix cannot be initialized more than once. Remove build definition -DDOLFIN_DEPRECATION_ERROR to change this to a warning.");
+    #else
+    warning("EpetraMatrix should not be initialized more than once. In version > 1.4, this will become an error.");
+    #endif
+  }
+
+  if (_matA && !_matA.unique())
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "initialize Epetra matrix",
+                 "More than one object points to the underlying Epetra object");
+  }
+
+  // Get local range
+  const std::pair<std::size_t, std::size_t> range
+    = tensor_layout.local_range(0);
+  const std::size_t num_local_rows = range.second - range.first;
+  const std::size_t n0 = range.first;
+
+  dolfin_assert(tensor_layout.sparsity_pattern());
+  const SparsityPattern& _pattern
+    = dynamic_cast<const SparsityPattern&>(*tensor_layout.sparsity_pattern());
+  const std::vector<std::vector<std::size_t> > d_pattern
+    = _pattern.diagonal_pattern(SparsityPattern::unsorted);
+  const std::vector<std::vector<std::size_t> > o_pattern
+      = _pattern.off_diagonal_pattern(SparsityPattern::unsorted);
+
+  // Get number of non-zeroes per row
+  std::vector<std::size_t> num_nonzeros;
+  _pattern.num_local_nonzeros(num_nonzeros);
+
+  // Create row map
+  #ifdef HAS_MPI
+  Epetra_MpiComm epetra_comm(tensor_layout.mpi_comm());
+  #else
+  Epetra_SerialComm epetra_comm;
+  #endif
+
+  Epetra_Map row_map((dolfin::la_index) tensor_layout.size(0),
+                     (dolfin::la_index) num_local_rows, 0, epetra_comm);
+
+  // For rectangular matrices with more columns than rows, the columns
+  // which are larger than those in row_map are marked as nonlocal
+  // (and assembly fails).  The domain_map fixes that problem, at
+  // least in the serial case.  FIXME: Needs attention in the parallel
+  // case. Maybe range_map is also req'd.
+  const std::pair<std::size_t, std::size_t> colrange
+    = tensor_layout.local_range(1);
+  const int num_local_cols = colrange.second - colrange.first;
+  Epetra_Map domain_map((dolfin::la_index) tensor_layout.size(1),
+                        num_local_cols, 0, epetra_comm);
+
+  // Create Epetra_FECrsGraph
+  const std::vector<int> _num_nonzeros(num_nonzeros.begin(),
+                                       num_nonzeros.end());
+  Epetra_CrsGraph matrix_map(Copy, row_map, _num_nonzeros.data());
+
+  // Add diagonal block indices
+  for (std::size_t local_row = 0; local_row < d_pattern.size(); local_row++)
+  {
+    const dolfin::la_index global_row = local_row + n0;
+    std::vector<dolfin::la_index> entries(d_pattern[local_row].begin(),
+                                          d_pattern[local_row].end());
+    matrix_map.InsertGlobalIndices(global_row,
+                                   (dolfin::la_index) entries.size(),
+                                   entries.data());
+  }
+
+  // Add off-diagonal block indices (parallel only)
+  for (std::size_t local_row = 0; local_row < o_pattern.size(); local_row++)
+  {
+    const std::size_t global_row = local_row + n0;
+    std::vector<dolfin::la_index> entries(o_pattern[local_row].begin(),
+                                          o_pattern[local_row].end());
+    matrix_map.InsertGlobalIndices(global_row, entries.size(), entries.data());
+  }
+
+  try
+  {
+    // Finalise map. Here, row_map is standing in for RangeMap, which is
+    // probably ok but should be double-checked.
+    //matrix_map.GlobalAssemble(domain_map, row_map);
+    //matrix_map.OptimizeStorage();
+    matrix_map.FillComplete(domain_map, row_map);
+    matrix_map.OptimizeStorage();
+  }
+  catch (int err)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "initialize Epetra matrix",
+                 "Epetra threw error %d in assembly of domain map", err);
+  }
+
+  // Create matrix
+  _matA.reset(new Epetra_FECrsMatrix(Copy, matrix_map));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericMatrix> EpetraMatrix::copy() const
+{
+  std::shared_ptr<EpetraMatrix> B(new EpetraMatrix(*this));
+  return B;
+}
+//-----------------------------------------------------------------------------
+bool EpetraMatrix::empty() const
+{
+  return _matA ? false : true;
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraMatrix::size(std::size_t dim) const
+{
+  if (dim > 1)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "access size of Epetra matrix",
+                 "Illegal axis (%d), must be 0 or 1", dim);
+  }
+
+  if (_matA)
+  {
+    const std::size_t M = _matA->NumGlobalRows64();
+    const std::size_t N = _matA->NumGlobalCols64();
+    return (dim == 0 ? M : N);
+  }
+  else
+    return 0;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+EpetraMatrix::local_range(std::size_t dim) const
+{
+  dolfin_assert(dim < 2);
+  if (dim == 1)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "access local column range for Epetra matrix",
+                 "Only local row range is available for Epetra matrices");
+  }
+
+  dolfin_assert(_matA);
+  const Epetra_BlockMap& row_map = _matA->RowMap();
+  dolfin_assert(row_map.LinearMap());
+
+  return std::make_pair(row_map.MinMyGID64(), row_map.MaxMyGID64() + 1);
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::init_vector(GenericVector& z, std::size_t dim) const
+{
+  if (!z.empty())
+  {
+    #ifdef DOLFIN_DEPRECATION_ERROR
+    error("EpetraVector may not be initialized more than once. Remove build definiton -DDOLFIN_DEPRECATION_ERROR to change this to a warning.");
+    #else
+    warning("EpetraVector may not be initialized more than once. In version > 1.4, this will become an error.");
+    #endif
+  }
+
+  dolfin_assert(_matA);
+
+  // Get map appropriate map
+  const Epetra_Map* map = 0;
+  if (dim == 0)
+    map = &(_matA->RangeMap());
+  else if (dim == 1)
+    map = &(_matA->DomainMap());
+  else
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "initialize Epetra vector to match Epetra matrix",
+                 "Dimension must be 0 or 1, not %d", dim);
+  }
+
+  // Reset vector with new map
+  EpetraVector& _z = as_type<EpetraVector>(z);
+  _z.init(*map);
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::get(double* block, std::size_t m,
+                       const dolfin::la_index* rows,
+                       std::size_t n, const dolfin::la_index* cols) const
+{
+  dolfin_assert(_matA);
+
+  int num_entities = 0;
+  int* indices;
+  double* values;
+
+  // For each row in rows
+  for(std::size_t i = 0; i < m; ++i)
+  {
+    // Extract the values and indices from row: rows[i]
+    if (_matA->IndicesAreLocal())
+    {
+      const int err = _matA->ExtractMyRowView(rows[i], num_entities, values,
+                                          indices);
+      if (err != 0)
+      {
+        dolfin_error("EpetraMatrix",
+                     "get block of values from Epetra matrix",
+                     "Did not manage to perform Epetra_FECrsMatrix::ExtractMyRowView");
+      }
+    }
+    else
+    {
+      const int err = _matA->ExtractGlobalRowView(rows[i], num_entities, values,
+                                               indices);
+      if (err != 0)
+      {
+        dolfin_error("EpetraMatrix",
+                     "get block of values from Epetra matrix",
+                     "Did not manage to perform Epetra_FECrsMatrix::ExtractMyRowView");
+      }
+    }
+
+    // Step the indices to the start of cols
+    int k = 0;
+    while (indices[k] < (int) cols[0])
+      k++;
+
+    // Fill the collumns in the block
+    for (std::size_t j = 0; j < n; j++)
+    {
+      if (k < num_entities and indices[k] == (int) cols[j])
+      {
+        block[i*n + j] = values[k];
+        k++;
+      }
+      else
+        block[i*n + j] = 0.0;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::set(const double* block,
+                       std::size_t m, const dolfin::la_index* rows,
+                       std::size_t n, const dolfin::la_index* cols)
+{
+  // This function is awkward and somewhat restrictive because of the
+  // poor support for setting off-process values in Epetra
+
+  dolfin_assert(_matA);
+
+  const int err = _matA->ReplaceGlobalValues(m, rows, n, cols, block,
+                                          Epetra_FECrsMatrix::ROW_MAJOR);
+  if (err != 0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "set block of values for Epetra matrix",
+                 "Did not manage to perform Epetra_FECrsMatrix::ReplaceGlobalValues");
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::add(const double* block,
+                       std::size_t m, const dolfin::la_index* rows,
+                       std::size_t n, const dolfin::la_index* cols)
+{
+  dolfin_assert(_matA);
+  const int err = _matA->SumIntoGlobalValues(m, rows, n, cols, block,
+                                         Epetra_FECrsMatrix::ROW_MAJOR);
+  if (err != 0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "add block of values to Epetra matrix",
+                 "Did not manage to perform Epetra_FECrsMatrix::SumIntoGlobalValues");
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::axpy(double a, const GenericMatrix& A,
+                        bool same_nonzero_pattern)
+{
+  const EpetraMatrix* AA = &as_type<const EpetraMatrix>(A);
+  if (!AA->mat()->Filled())
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "perform axpy operation with Epetra matrix",
+                 "Epetra matrix is not in the correct state");
+  }
+
+  const int err = EpetraExt::MatrixMatrix::Add(*(AA->mat()), false, a,
+                                               *_matA, 1.0);
+  if (err != 0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "perform axpy operation with Epetra matrix",
+                 "Did not manage to perform EpetraExt::MatrixMatrix::Add. If the matrix has been assembled, the nonzero patterns must match");
+  }
+}
+//-----------------------------------------------------------------------------
+double EpetraMatrix::norm(std::string norm_type) const
+{
+  dolfin_assert(_matA);
+  if (norm_type == "l1")
+    return _matA->NormOne();
+  else if (norm_type == "linf")
+    return _matA->NormInf();
+  else if (norm_type == "frobenius")
+    return _matA->NormFrobenius();
+  else
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "compute norm of Epetra matrix",
+                 "Unknown norm type: \"%s\"", norm_type.c_str());
+    return 0.0;
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::zero()
+{
+  dolfin_assert(_matA);
+  const int err = _matA->PutScalar(0.0);
+  if (err != 0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "zero Epetra matrix",
+                 "Did not manage to perform Epetra_FECrsMatrix::PutScalar");
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::apply(std::string mode)
+{
+  Timer timer("Apply (EpetraMatrix)");
+
+  dolfin_assert(_matA);
+  int err = 0;
+  if (mode == "add")
+    err = _matA->GlobalAssemble(true, Add);
+  else if (mode == "insert")
+    err = _matA->GlobalAssemble(true);
+  else if (mode == "flush")
+  {
+    // Do nothing
+  }
+  else
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "apply changes to Epetra matrix",
+                 "Unknown apply mode \"%s\"", mode.c_str());
+  }
+
+  if (err != 0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "apply changes to Epetra matrix",
+                 "Did not manage to perform Epetra_FECrsMatrix::GlobalAssemble");
+  }
+}
+//-----------------------------------------------------------------------------
+MPI_Comm EpetraMatrix::mpi_comm() const
+{
+  dolfin_assert(_matA);
+  MPI_Comm mpi_comm = MPI_COMM_NULL;
+  #ifdef HAS_MPI
+  // Get Epetra MPI communicator (downcast)
+  const Epetra_MpiComm* epetra_mpi_comm
+    = dynamic_cast<const Epetra_MpiComm*>(&(_matA->Map().Comm()));
+  dolfin_assert(epetra_mpi_comm);
+  mpi_comm = epetra_mpi_comm->Comm();
+  #else
+  mpi_comm = MPI_COMM_SELF;
+  #endif
+
+  return mpi_comm;
+}
+//-----------------------------------------------------------------------------
+std::string EpetraMatrix::str(bool verbose) const
+{
+  if (!_matA)
+    return "<Uninitialized EpetraMatrix>";
+
+  std::stringstream s;
+  if (verbose)
+  {
+    warning("Verbose output for EpetraMatrix not implemented, calling Epetra Print directly.");
+    dolfin_assert(_matA);
+    _matA->Print(std::cout);
+  }
+  else
+    s << "<EpetraMatrix of size " << size(0) << " x " << size(1) << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::ident(std::size_t m, const dolfin::la_index* rows)
+{
+  dolfin_assert(_matA);
+  dolfin_assert(_matA->Filled() == true);
+
+  // FIXME: This is a major hack and will not scale for large numbers
+  // of processes. The problem is that a dof is not guaranteed to
+  // reside on the same process as one of cells to which it belongs
+  // (which is bad, but is due to the sparsity pattern
+  // computation). This function only work for locally owned rows (the
+  // PETSc version works for any row).
+
+  typedef boost::unordered_set<std::size_t> MySet;
+
+  // Number of MPI processes
+  const std::size_t num_processes = _matA->Comm().NumProc();
+  const std::size_t process_number = _matA->Comm().MyPID();
+
+  // Build lists of local and nonlocal rows
+  MySet local_rows;
+  std::vector<std::size_t> non_local_rows;
+  for (std::size_t i = 0; i < m; ++i)
+  {
+    if (_matA->MyGlobalRow(rows[i]))
+      local_rows.insert(rows[i]);
+    else
+      non_local_rows.push_back(rows[i]);
+  }
+
+  // If parallel, send non_local rows to all processes
+  if (num_processes > 1)
+  {
+    // Send list of nonlocal rows to all processes
+    std::vector<std::vector<std::size_t> >  send_data(num_processes);
+    for (std::size_t p = 0; p < num_processes; ++p)
+    {
+      if (p != process_number)
+      {
+        send_data[p].insert(send_data[p].end(), non_local_rows.begin(),
+                            non_local_rows.end());
+      }
+    }
+
+    std::vector<std::vector<std::size_t> > received_data;
+    MPI::all_to_all(mpi_comm(), send_data, received_data);
+
+    // Unpack data
+    for (std::size_t p = 0; p < num_processes; ++p)
+    {
+      for (std::size_t i = 0; i < received_data[p].size(); ++i)
+      {
+        // Insert row into set if it's local
+        const dolfin::la_index new_index = received_data[p][i];
+        if (_matA->MyGlobalRow(new_index))
+          local_rows.insert(new_index);
+      }
+    }
+  }
+
+  const Epetra_CrsGraph& graph = _matA->Graph();
+  MySet::const_iterator global_row;
+  for (global_row = local_rows.begin(); global_row != local_rows.end();
+       ++global_row)
+  {
+    // Get local row index
+    const dolfin::la_index _global_row = *global_row;
+    const int local_row = _matA->LRID(_global_row);
+
+    // If this process owns row, then zero row
+    if (local_row >= 0)
+    {
+      // Get row map
+      int num_nz = 0;
+      int* column_indices;
+      int err = graph.ExtractMyRowView(local_row, num_nz, column_indices);
+      if (err != 0)
+      {
+        dolfin_error("EpetraMatrix.cpp",
+                     "set rows of Epetra matrix to identity matrix",
+                     "Did not manage to extract row map");
+      }
+
+      // Zero row
+      std::vector<double> block(num_nz, 0.0);
+      err = _matA->ReplaceMyValues(local_row, num_nz, &block[0], column_indices);
+      if (err != 0)
+      {
+        dolfin_error("EpetraMatrix.cpp",
+                     "set rows of Epetra matrix to identity matrix",
+                     "Did not manage to perform Epetra_FECrsMatrix::ReplaceGlobalValues");
+      }
+
+      // Place one on the diagonal
+      const double one = 1.0;
+      _matA->ReplaceMyValues(local_row, 1, &one, &local_row);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::zero(std::size_t m, const dolfin::la_index* rows)
+{
+  // FIXME: This can be made more efficient by eliminating creation of
+  //        some obejcts inside the loop
+
+  dolfin_assert(_matA);
+  const Epetra_CrsGraph& graph = _matA->Graph();
+  for (std::size_t i = 0; i < m; ++i)
+  {
+    const int row = rows[i];
+    const int num_nz = graph.NumGlobalIndices(row);
+    std::vector<int> indices(num_nz);
+
+    int out_num = 0;
+    graph.ExtractGlobalRowCopy(row, num_nz, out_num, &indices[0]);
+
+    std::vector<double> block(num_nz);
+    const int err = _matA->ReplaceGlobalValues(row, num_nz, block.data(),
+                                            indices.data());
+    if (err != 0)
+    {
+      dolfin_error("EpetraMatrix.cpp",
+                   "zero Epetra matrix",
+                   "Did not manage to perform Epetra_FECrsMatrix::ReplaceGlobalValues");
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::mult(const GenericVector& x_, GenericVector& Ax_) const
+{
+  dolfin_assert(_matA);
+  const EpetraVector& x = as_type<const EpetraVector>(x_);
+  EpetraVector& Ax = as_type<EpetraVector>(Ax_);
+
+  if (x.size() != size(1))
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "compute matrix-vector product with Epetra matrix",
+                 "Non-matching dimensions for matrix-vector product");
+  }
+
+  // Initialize RHS
+  if (Ax.empty())
+    this->init_vector(Ax, 0);
+
+  if (Ax.size() != size(0))
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "compute matrix-vector product with Epetra matrix",
+                 "Vector for matrix-vector result has wrong size");
+  }
+
+  dolfin_assert(x.vec());
+  dolfin_assert(Ax.vec());
+  const int err = _matA->Multiply(false, *(x.vec()), *(Ax.vec()));
+  if (err != 0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "compute matrix-vector product with Epetra matrix",
+                 "Did not manage to perform Epetra_FECrsMatrix::Multiply.");
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::transpmult(const GenericVector& x_, GenericVector& Ax_) const
+{
+  dolfin_assert(_matA);
+  const EpetraVector& x = as_type<const EpetraVector>(x_);
+  EpetraVector& Ax = as_type<EpetraVector>(Ax_);
+
+  if (x.size() != size(0))
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "compute transpose matrix-vector product with Epetra matrix",
+                 "Non-matching dimensions for transpose matrix-vector product");
+  }
+
+  // Initialize RHS
+  if (Ax.empty())
+    this->init_vector(Ax, 1);
+
+  if (Ax.size() != size(1))
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "compute transpose matrix-vector product with Epetra matrix",
+                 "Vector for transpose matrix-vector result has wrong size");
+  }
+
+  const int err = _matA->Multiply(true, *(x.vec()), *(Ax.vec()));
+  if (err != 0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "compute transpose matrix-vector product with Epetra matrix",
+                 "Did not manage to perform Epetra_FECrsMatrix::Multiply");
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::set_diagonal(const GenericVector& x)
+{
+  dolfin_assert(_matA);
+
+  const EpetraVector& x_ = x.down_cast<EpetraVector>();
+
+  if (size(1) != size(0) || size(0) != x_.size())
+  {
+    dolfin_error("EpetraMatrix.cpp",
+		 "set the diagonal of an Epetra matrix",
+		 "Matrix and vector dimensions don't match for matrix-vector set");
+  }
+  
+  const Epetra_Vector xx(View, *(x_.vec().get()), 0);
+
+  const int err = _matA->ReplaceDiagonalValues(xx);
+  if (err != 0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+		 "set the diagonal of an Epetra matrix",
+		 "Did not manage to perform Epetra_CrsMatrix::ReplaceDiagonalValues");
+  }
+ }
+//-----------------------------------------------------------------------------
+void EpetraMatrix::getrow(std::size_t row, std::vector<std::size_t>& columns,
+                          std::vector<double>& values) const
+{
+  dolfin_assert(_matA);
+
+  // Get local row index
+  const dolfin::la_index _row = row;
+  const int local_row_index = _matA->LRID(_row);
+
+  // If this process has part of the row, get values
+  if (local_row_index >= 0)
+  {
+    // Temporary variables
+    int* indices;
+    double* vals;
+    int num_entries;
+
+    // Extract data from Epetra matrix
+    const int err = _matA->ExtractMyRowView(local_row_index, num_entries, vals,
+                                            indices);
+    if (err != 0)
+    {
+      dolfin_error("EpetraMatrix.cpp",
+                   "extract row of Epetra matrix",
+                   "Did not manage to perform Epetra_FECrsMatrix::ExtractMyRowView");
+    }
+
+    // Put data in columns and values
+    columns.resize(num_entries);
+    values.resize(num_entries);
+    for (int i = 0; i < num_entries; i++)
+    {
+      columns[i] = _matA->GCID(indices[i]);  // Return global column indices
+      values[i]  = vals[i];
+    }
+  }
+  else
+  {
+    columns.resize(0);
+    values.resize(0);
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraMatrix::setrow(std::size_t row,
+                          const std::vector<std::size_t>& columns,
+                          const std::vector<double>& values)
+{
+  static bool print_msg_once = true;
+  if (print_msg_once)
+  {
+    info("EpetraMatrix::setrow is implemented inefficiently");
+    print_msg_once = false;
+  }
+
+  for (std::size_t i = 0; i < columns.size(); i++)
+  {
+    dolfin::la_index _row = row;
+    dolfin::la_index _col = columns[i];
+    set(&values[i], 1, &_row, 1, &_col);
+  }
+}
+//-----------------------------------------------------------------------------
+GenericLinearAlgebraFactory& EpetraMatrix::factory() const
+{
+  return EpetraFactory::instance();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Epetra_FECrsMatrix> EpetraMatrix::mat() const
+{
+  return _matA;
+}
+//-----------------------------------------------------------------------------
+const EpetraMatrix& EpetraMatrix::operator*= (double a)
+{
+  dolfin_assert(_matA);
+  const int err = _matA->Scale(a);
+  if (err !=0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "multiply Epetra matrix by scalar",
+                 "Did not manage to perform Epetra_FECrsMatrix::Scale");
+  }
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraMatrix& EpetraMatrix::operator/= (double a)
+{
+  dolfin_assert(_matA);
+  int err = _matA->Scale(1.0/a);
+  if (err !=0)
+  {
+    dolfin_error("EpetraMatrix.cpp",
+                 "divide Epetra matrix by scalar",
+                 "Did not manage to perform Epetra_FECrsMatrix::Scale");
+  }
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const GenericMatrix& EpetraMatrix::operator= (const GenericMatrix& A)
+{
+  *this = as_type<const EpetraMatrix>(A);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraMatrix& EpetraMatrix::operator= (const EpetraMatrix& A)
+{
+  if (A.mat())
+    _matA.reset(new Epetra_FECrsMatrix(*A.mat()));
+  else
+    A.mat().reset();
+  return *this;
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/EpetraMatrix.h b/dolfin/la/EpetraMatrix.h
new file mode 100644
index 0000000..e36ad11
--- /dev/null
+++ b/dolfin/la/EpetraMatrix.h
@@ -0,0 +1,197 @@
+// Copyright (C) 2008 Martin Sandve Alnes, Kent-Andre Mardal and Johannes Ring
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2012
+// Modified by Garth N. Wells 2008, 2009
+//
+// First added:  2008-04-21
+// Last changed: 2012-08-20
+
+#ifndef __EPETRA_MATRIX_H
+#define __EPETRA_MATRIX_H
+
+#ifdef HAS_TRILINOS
+
+#include <memory>
+#include "GenericMatrix.h"
+#include <Teuchos_RCP.hpp>
+
+class Epetra_FECrsMatrix;
+class Epetra_CrsGraph;
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class TensorLayout;
+
+  /// This class provides a simple matrix class based on Epetra.
+  /// It is a simple wrapper for an Epetra matrix object (Epetra_FECrsMatrix)
+  /// implementing the GenericMatrix interface.
+  ///
+  /// The interface is intentionally simple. For advanced usage,
+  /// access the Epetra_FECrsMatrix object using the function mat() and
+  /// use the standard Epetra interface.
+
+  class EpetraMatrix : public GenericMatrix
+  {
+  public:
+
+    /// Create empty matrix
+    EpetraMatrix();
+
+    /// Copy constuctor
+    EpetraMatrix(const EpetraMatrix& A);
+
+    /// Create matrix from given Epetra_FECrsMatrix pointer
+    explicit EpetraMatrix(Teuchos::RCP<Epetra_FECrsMatrix> A);
+
+    /// Create matrix from given Epetra_FECrsMatrix pointer
+    explicit EpetraMatrix(std::shared_ptr<Epetra_FECrsMatrix> A);
+
+    /// Create matrix from given Epetra_CrsGraph
+    explicit EpetraMatrix(const Epetra_CrsGraph& graph);
+
+    /// Destructor
+    virtual ~EpetraMatrix();
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Initialize zero tensor using tensor layout
+    virtual void init(const TensorLayout& tensor_layout);
+
+    /// Return true if empty
+    virtual bool empty() const;
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const;
+
+    /// Return local ownership range
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const;
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero();
+
+    /// Finalize assembly of tensor. The following values are recognized
+    /// for the mode parameter:
+    ///
+    ///   add    - corresponding to Epetra GlobalAssemble(Add)
+    ///   insert - corresponding to Epetra GlobalAssemble(Insert)
+    virtual void apply(std::string mode);
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    //--- Implementation of the GenericMatrix interface ---
+
+    /// Return copy of matrix
+    virtual std::shared_ptr<GenericMatrix> copy() const;
+
+    /// Intialize vector z to be compatible with the matrix-vector
+    /// product y = Ax. In the parallel case, both size and layout are
+    /// important.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+    virtual void init_vector(GenericVector& z, std::size_t dim) const;
+
+    /// Get block of values
+    virtual void get(double* block, std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols) const;
+
+    /// Set block of values
+    virtual void set(const double* block, std::size_t m,
+                     const dolfin::la_index* rows, std::size_t n,
+                     const dolfin::la_index* cols);
+
+    /// Add block of values
+    virtual void add(const double* block, std::size_t m,
+                     const dolfin::la_index* rows, std::size_t n,
+                     const dolfin::la_index* cols);
+
+    /// Add multiple of given matrix (AXPY operation)
+    virtual void axpy(double a, const GenericMatrix& A,
+                      bool same_nonzero_pattern);
+
+    /// Return norm of matrix
+    virtual double norm(std::string norm_type) const;
+
+    /// Get non-zero values of given row
+    virtual void getrow(std::size_t row, std::vector<std::size_t>& columns,
+                        std::vector<double>& values) const;
+
+    /// Set values for given row
+    virtual void setrow(std::size_t row,
+                        const std::vector<std::size_t>& columns,
+                        const std::vector<double>& values);
+
+    /// Set given rows to zero
+    virtual void zero(std::size_t m, const dolfin::la_index* rows);
+
+    /// Set given rows to identity matrix
+    virtual void ident(std::size_t m, const dolfin::la_index* rows);
+
+    // Matrix-vector product, y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const;
+
+    // Matrix-vector product, y = A^T x
+    virtual void transpmult(const GenericVector& x, GenericVector& y) const;
+
+    /// Set diagonal of a matrix
+    virtual void set_diagonal(const GenericVector& x);
+
+    /// Multiply matrix by given number
+    virtual const EpetraMatrix& operator*= (double a);
+
+    /// Divide matrix by given number
+    virtual const EpetraMatrix& operator/= (double a);
+
+    /// Assignment operator
+    virtual const GenericMatrix& operator= (const GenericMatrix& x);
+
+    //--- Special functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const;
+
+    //--- Special Epetra functions ---
+
+    /// Return Epetra_FECrsMatrix pointer
+    std::shared_ptr<Epetra_FECrsMatrix> mat() const;
+
+    /// Assignment operator
+    const EpetraMatrix& operator= (const EpetraMatrix& x);
+
+  private:
+
+    // Epetra_FECrsMatrix pointer
+    std::shared_ptr<Epetra_FECrsMatrix> _matA;
+
+    // Epetra_FECrsMatrix pointer, used when initialized with a
+    // Teuchos::RCP shared_ptr
+    Teuchos::RCP<Epetra_FECrsMatrix> ref_keeper;
+  };
+
+}
+
+#endif // HAS_TRILINOS
+#endif // __EPETRA_MATRIX_H
diff --git a/dolfin/la/EpetraVector.cpp b/dolfin/la/EpetraVector.cpp
new file mode 100644
index 0000000..d4843d8
--- /dev/null
+++ b/dolfin/la/EpetraVector.cpp
@@ -0,0 +1,926 @@
+// Copyright (C) 2008 Martin Sandve Alnes, Kent-Andre Mardal and Johannes Ring
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2008-2010
+// Modified by Anders Logg 2011-2012
+//
+// First added:  2008-04-21
+// Last changed: 2012-08-22
+
+#ifdef HAS_TRILINOS
+
+// Included here to avoid a C++ problem with some MPI implementations
+#include <dolfin/common/MPI.h>
+
+#include <cmath>
+#include <cstring>
+#include <numeric>
+#include <utility>
+
+#include <Epetra_FEVector.h>
+#include <Epetra_Export.h>
+#include <Epetra_Import.h>
+#include <Epetra_BlockMap.h>
+#include <Epetra_MultiVector.h>
+#include <Epetra_MpiComm.h>
+#include <Epetra_SerialComm.h>
+#include <Epetra_Vector.h>
+#include <Epetra_DataAccess.h>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/Set.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/log/dolfin_log.h>
+#include "uBLASVector.h"
+#include "PETScVector.h"
+#include "EpetraVector.h"
+#include "EpetraFactory.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+EpetraVector::EpetraVector()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+EpetraVector::EpetraVector(MPI_Comm comm, std::size_t N)
+{
+  // Create Epetra vector
+  init(comm, N);
+}
+//-----------------------------------------------------------------------------
+EpetraVector::EpetraVector(std::shared_ptr<Epetra_FEVector> x) : _x(x)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+EpetraVector::EpetraVector(const Epetra_BlockMap& map)
+{
+  _x.reset(new Epetra_FEVector(map));
+}
+//-----------------------------------------------------------------------------
+EpetraVector::EpetraVector(const EpetraVector& v)
+{
+  // Copy Epetra vector
+  dolfin_assert(v._x);
+  _x.reset(new Epetra_FEVector(*(v._x)));
+
+  // Copy ghost data
+  if (v.x_ghost)
+    x_ghost.reset(new Epetra_Vector(*(v.x_ghost)));
+  ghost_global_to_local = v.ghost_global_to_local;
+}
+//-----------------------------------------------------------------------------
+EpetraVector::~EpetraVector()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> EpetraVector::copy() const
+{
+  dolfin_assert(_x);
+  std::shared_ptr<GenericVector> y(new EpetraVector(*this));
+  return y;
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::init(MPI_Comm comm, std::size_t N)
+{
+  // Create empty ghost vertices vector
+  std::vector<la_index> ghost_indices;
+
+  // Compute local ownership range
+  const std::pair<std::size_t, std::size_t> range = MPI::local_range(comm, N);
+
+  // Initialize vector
+  init(comm, range, ghost_indices);
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::init(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range)
+{
+  std::vector<la_index> ghost_indices;
+  init(comm, range, ghost_indices);
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::init(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range,
+                        const std::vector<la_index>& ghost_indices)
+{
+  if (!this->empty())
+  {
+    #ifdef DOLFIN_DEPRECATION_ERROR
+    error("EpetraVector may not be initialized more than once. Remove build definition -DDOLFIN_DEPRECATION_ERROR to change this to a warning.");
+    #else
+    warning("EpetraVector should not be initialized more than once. In version > 1.4, this will become an error.");
+    #endif
+  }
+
+  if (_x && !_x.unique())
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "resize Epetra vector",
+                 "More than one object points to the underlying Epetra object");
+  }
+
+  // Create ghost data structures
+  ghost_global_to_local.clear();
+
+  Epetra_SerialComm epetra_serial_comm;
+  #ifdef HAS_MPI
+  Epetra_MpiComm epetra_comm(comm);
+  #else
+  Epetra_SerialComm epetra_comm;
+  if (!ghost_indices.empty() && epetra_comm.NumProc() > 1)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "initialize Epetra vector",
+                 "Serial EpetraVectors do not support ghost points");
+  }
+  #endif
+
+  // Compute local size
+  const dolfin::la_index local_size = range.second - range.first;
+  dolfin_assert(range.second >= range.first);
+
+  const dolfin::la_index _global_size = -1;
+  const int _local_size = local_size;
+  const int _element_size = 1;
+  const int _index_base = 0;
+  Epetra_BlockMap epetra_map(_global_size, _local_size, _element_size,
+                             _index_base, epetra_comm);
+
+  // Build global-to-local map for ghost indices
+  for (std::size_t i = 0; i < ghost_indices.size(); ++i)
+  {
+    ghost_global_to_local.insert(std::pair<std::size_t,
+                                 std::size_t>(ghost_indices[i], i));
+  }
+
+  // Create vector
+  _x.reset(new Epetra_FEVector(epetra_map));
+
+  // Create local ghost vector
+  const dolfin::la_index num_ghost_entries = ghost_indices.size();
+  const std::vector<dolfin::la_index> ghost_entries(ghost_indices.begin(),
+                                                    ghost_indices.end());
+  Epetra_BlockMap ghost_map(num_ghost_entries, num_ghost_entries,
+                            ghost_entries.data(), 1, 0, epetra_serial_comm);
+  x_ghost.reset(new Epetra_Vector(ghost_map));
+}
+//-----------------------------------------------------------------------------
+bool EpetraVector::empty() const
+{
+  return _x ? _x->GlobalLength64() == 0 : true;
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraVector::size() const
+{
+  return _x ? _x->GlobalLength64() : 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t EpetraVector::local_size() const
+{
+  return _x ? _x->MyLength() : 0;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t> EpetraVector::local_range() const
+{
+  dolfin_assert(_x);
+  dolfin_assert(_x->Map().LinearMap());
+  const Epetra_BlockMap& map = _x->Map();
+  return std::make_pair<std::size_t, std::size_t>(map.MinMyGID(),
+                                                  map.MaxMyGID() + 1);
+}
+//-----------------------------------------------------------------------------
+bool EpetraVector::owns_index(std::size_t i) const
+{
+  dolfin_assert(_x);
+  const dolfin::la_index _i = i;
+  return _x->Map().MyGID(_i);
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::zero()
+{
+  Timer timer("Apply (EpetraVector)");
+  dolfin_assert(_x);
+  const int err = _x->PutScalar(0.0);
+  if (err != 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "zero Epetra vector",
+                 "Did not manage to perform Epetra_Vector::PutScalar");
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::apply(std::string mode)
+{
+  dolfin_assert(_x);
+
+  // Special treatement required for values applied using 'set'
+  // because Epetra_FEVector::ReplaceGlobalValues does not behave well.
+  // This would be simpler if we required that only local values (on
+  // this process) can be set
+
+  // Get communicator
+  const Epetra_Comm& epetra_comm = _x->Map().Comm();
+
+  int err = 0;
+  int num_my_off_process = off_process_set_values.size();
+  int num_off_proc = 0;
+  epetra_comm.SumAll(&num_my_off_process, &num_off_proc, 1);
+  if (num_off_proc  > 0)
+  {
+    std::vector<dolfin::la_index> non_local_indices;
+    non_local_indices.reserve(off_process_set_values.size());
+    std::vector<double> non_local_values;
+    non_local_values.reserve(off_process_set_values.size());
+    boost::unordered_map<std::size_t, double>::const_iterator entry;
+    for (entry = off_process_set_values.begin();
+         entry != off_process_set_values.end(); ++entry)
+    {
+      non_local_indices.push_back(entry->first);
+      non_local_values.push_back(entry->second);
+    }
+
+    // Create map for y
+    Epetra_BlockMap target_map(-1, non_local_indices.size(),
+                               non_local_indices.data(), 1, 0, epetra_comm);
+
+    // Create vector y (view of non_local_values)
+    Epetra_Vector y(View, target_map, non_local_values.data());
+
+    // Create importer
+    Epetra_Import importer(_x->Map(), target_map);
+
+    // Import off-process 'set' data
+    if (mode == "add")
+      _x->Import(y, importer, Add);
+    else if (mode == "insert")
+      _x->Import(y, importer, Insert);
+
+    err = _x->GlobalAssemble(Add);
+  }
+  else
+  {
+    if (mode == "add")
+      err = _x->GlobalAssemble(Add);
+    else if (mode == "insert")
+    {
+      // This is 'Add' because we take of data that is set in the previous
+      // code block. Epetra behaviour is very poor w.r.t 'set' - probably
+      // need to keep track of state set/add internally.
+      err = _x->GlobalAssemble(Add);
+    }
+    else
+    {
+      dolfin_error("EpetraVector.cpp",
+                   "apply changes to Epetra vector",
+                   "Unknown apply mode (\"%s\")", mode.c_str());
+    }
+  }
+
+  // Check that call to GlobalAssemble was successful
+  if (err != 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "apply changes to Epetra vector",
+                 "Did not manage to perform Epetra_Vector::GlobalAssemble");
+  }
+
+  // Clear map of off-process set values
+  off_process_set_values.clear();
+
+  // Update ghost values
+  update_ghost_values();
+}
+//-----------------------------------------------------------------------------
+MPI_Comm EpetraVector::mpi_comm() const
+{
+  dolfin_assert(_x);
+  MPI_Comm mpi_comm = MPI_COMM_NULL;
+#ifdef HAS_MPI
+  // Get Epetra MPI communicator (downcast)
+  const Epetra_MpiComm* epetra_mpi_comm
+    = dynamic_cast<const Epetra_MpiComm*>(&(_x->Map().Comm()));
+  dolfin_assert(epetra_mpi_comm);
+  mpi_comm = epetra_mpi_comm->Comm();
+#else
+  mpi_comm = MPI_COMM_SELF;
+#endif
+
+  return mpi_comm;
+}
+//-----------------------------------------------------------------------------
+std::string EpetraVector::str(bool verbose) const
+{
+  if (!_x)
+    return "<Uninitialized EpetraVector>";
+
+  std::stringstream s;
+  if (verbose)
+  {
+    dolfin_assert(_x);
+    _x->Print(std::cout);
+  }
+  else
+    s << "<EpetraVector of size " << size() << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::get_local(std::vector<double>& values) const
+{
+  if (!_x)
+  {
+    values.clear();
+    return;
+  }
+
+  values.resize(_x->MyLength());
+
+  const int err = _x->ExtractCopy(values.data(), 0);
+  if (err!= 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "access local values from Epetra vector",
+                 "Did not manage to perform Epetra_Vector::ExtractCopy");
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::set_local(const std::vector<double>& values)
+{
+  dolfin_assert(_x);
+  const std::size_t local_size = _x->MyLength();
+
+  if (values.size() != local_size)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "set local values of Epetra vector",
+                 "Size of values array is not equal to local vector size");
+  }
+
+  for (std::size_t i = 0; i < local_size; ++i)
+    (*_x)[0][i] = values[i];
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::add_local(const Array<double>& values)
+{
+  dolfin_assert(_x);
+  const std::size_t local_size = _x->MyLength();
+  if (values.size() != local_size)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "add local values to Epetra vector",
+                 "Size of values array is not equal to local vector size");
+  }
+
+  for (std::size_t i = 0; i < local_size; ++i)
+    (*_x)[0][i] += values[i];
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::set(const double* block, std::size_t m,
+                       const dolfin::la_index* rows)
+{
+  dolfin_assert(_x);
+  const Epetra_BlockMap& map = _x->Map();
+  dolfin_assert(_x->Map().LinearMap());
+  const dolfin::la_index n0 = map.MinMyGID64();
+  const dolfin::la_index n1 = map.MaxMyGID64();
+
+  // Set local values, or add to off-process cache for later communication
+  for (std::size_t i = 0; i < m; ++i)
+  {
+    if (rows[i] >= n0 && rows[i] <= n1)
+      (*_x)[0][rows[i] - n0] = block[i];
+    else
+      off_process_set_values[rows[i]] = block[i];
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::add(const double* block, std::size_t m,
+                       const dolfin::la_index* rows)
+{
+  if (!off_process_set_values.empty())
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "add block of values to Epetra vector",
+                 "apply() must be called between calling EpetraVector::set and EpetraVector::add");
+  }
+
+  dolfin_assert(_x);
+  int err = _x->SumIntoGlobalValues((int) m, rows, block);
+
+  if (err != 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "add block of values to Epetra vector",
+                 "Did not manage to perform Epetra_Vector::SumIntoGlobalValues");
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::get_local(double* block, std::size_t m,
+                             const dolfin::la_index* rows) const
+{
+  dolfin_assert(_x);
+  const Epetra_BlockMap& map = _x->Map();
+  dolfin_assert(_x->Map().LinearMap());
+  const dolfin::la_index n0 = map.MinMyGID64();
+
+  // Get values
+  if (ghost_global_to_local.empty())
+  {
+    for (std::size_t i = 0; i < m; ++i)
+      block[i] = (*_x)[0][rows[i] - n0];
+  }
+  else
+  {
+    dolfin_assert(x_ghost);
+    const dolfin::la_index n1 = map.MaxMyGID();
+    const Epetra_BlockMap& ghost_map = x_ghost->Map();
+    for (std::size_t i = 0; i < m; ++i)
+    {
+      if (rows[i] >= n0 && rows[i] <= n1)
+        block[i] = (*_x)[0][rows[i] - n0];
+      else
+      {
+        // FIXME: Check if look-up in std::map is faster than
+        // Epetra_BlockMap::LID Get local index
+        const dolfin::la_index local_index = ghost_map.LID(rows[i]);
+        dolfin_assert(local_index != -1);
+
+        //boost::unordered_map<std::size_t, std::size_t>::const_iterator
+        //  _local_index = ghost_global_to_local.find(rows[i]);
+        //dolfin_assert(_local_index != ghost_global_to_local.end());
+        //const int local_index = _local_index->second;
+
+        // Get value
+        block[i] = (*x_ghost)[local_index];
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::gather(GenericVector& y,
+                          const std::vector<dolfin::la_index>& indices) const
+{
+  dolfin_assert(_x);
+
+  // Down cast to an EpetraVector
+  EpetraVector& _y = as_type<EpetraVector>(y);
+
+  // Create serial communicator
+  Epetra_SerialComm epetra_serial_comm;
+
+  // Create map for y
+  Epetra_BlockMap target_map(indices.size(), indices.size(), indices.data(),
+                             1, 0, epetra_serial_comm);
+
+  // Initialise vector y
+  if (y.empty())
+    _y.init(target_map);
+  else if (_y.size() != indices.size() ||  MPI::size(y.mpi_comm()))
+  {
+    // FIXME: also check that vector is local
+    dolfin_error("EpetraVector.cpp",
+                 "gather vector entries",
+                 "Cannot re-initialize gather vector. Must be empty, or have correct size and be a local vector");
+  }
+
+  dolfin_assert(_y.vec());
+
+  // Create importer
+  Epetra_Import importer(target_map, _x->Map());
+
+  // Import values into y
+  _y.vec()->Import(*_x, importer, Insert);
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::gather(std::vector<double>& x,
+                          const std::vector<dolfin::la_index>& indices) const
+{
+  const std::size_t _size = indices.size();
+  x.resize(_size);
+  dolfin_assert(x.size() == _size);
+
+  // Gather values into a vector
+  EpetraVector y;
+  this->gather(y, indices);
+
+  dolfin_assert(y.size() == _size);
+  const Epetra_FEVector& _y = *(y.vec());
+
+  // Copy values into x
+  for (std::size_t i = 0; i < _size; ++i)
+    x[i] = (_y)[0][i];
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::gather_on_zero(std::vector<double>& x) const
+{
+  // FIXME: Is there an Epetra function for this?
+  dolfin_assert(_x);
+  std::vector<dolfin::la_index> indices;
+  if (_x->Comm().MyPID() == 0)
+  {
+    indices.resize(this->size());
+    for (std::size_t i = 0; i < size(); ++i)
+      indices[i] = i;
+  }
+
+  gather(x, indices);
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::init(const Epetra_BlockMap& map)
+{
+  if (_x)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "initialize vector with Epetra_BlockMap",
+                 "Cannot re-intialize non-empty vector");
+  }
+
+  // Clear ghost data
+  x_ghost.reset();
+  ghost_global_to_local.clear();
+  off_process_set_values.clear();
+
+  _x.reset(new Epetra_FEVector(map));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Epetra_FEVector> EpetraVector::vec() const
+{
+  return _x;
+}
+//-----------------------------------------------------------------------------
+double EpetraVector::inner(const GenericVector& y) const
+{
+  dolfin_assert(_x);
+
+  const EpetraVector& v = as_type<const EpetraVector>(y);
+  if (!v._x)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "compute inner product with Epetra vector",
+                 "Given vector is not initialized");
+  }
+
+  double a;
+  const int err = _x->Dot(*(v._x), &a);
+  if (err!= 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "compute inner product with Epetra vector",
+                 "Did not manage to perform Epetra_Vector::Dot");
+  }
+
+  return a;
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::axpy(double a, const GenericVector& y)
+{
+  dolfin_assert(_x);
+
+  const EpetraVector& _y = as_type<const EpetraVector>(y);
+  if (!_y._x)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "perform axpy operation with Epetra vector",
+                 "Given vector is not initialized");
+  }
+
+  if (size() != _y.size())
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "perform axpy operation with Epetra vector",
+                 "Vectors are not of the same size");
+  }
+
+  const int err = _x->Update(a, *(_y.vec()), 1.0);
+  if (err != 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "perform axpy operation with Epetra vector",
+                 "Did not manage to perform Epetra_Vector::Update");
+  }
+
+  update_ghost_values();
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::abs()
+{
+  dolfin_assert(_x);
+  _x->Abs(*_x);
+}
+//-----------------------------------------------------------------------------
+GenericLinearAlgebraFactory& EpetraVector::factory() const
+{
+  return EpetraFactory::instance();
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator= (const GenericVector& v)
+{
+  *this = as_type<const EpetraVector>(v);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator= (double a)
+{
+  dolfin_assert(_x);
+  _x->PutScalar(a);
+
+  // Update ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+void EpetraVector::update_ghost_values()
+{
+  if (x_ghost)
+  {
+    dolfin_assert(_x);
+    dolfin_assert(x_ghost->MyLength()
+                  == (dolfin::la_index) ghost_global_to_local.size());
+
+    // Create importer
+    Epetra_Import importer(x_ghost->Map(), _x->Map());
+
+    // Import into ghost vector
+    x_ghost->Import(*_x, importer, Insert);
+  }
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator= (const EpetraVector& v)
+{
+  // Check that vector lengths are equal
+  if (size() != v.size())
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "assign one vector to another",
+                 "Vectors must be of the same length when assigning. "
+                 "Consider using the copy constructor instead");
+  }
+
+  // Check that maps (parallel layout) are the same
+  dolfin_assert(_x);
+  dolfin_assert(v._x);
+  if (!_x->Map().SameAs(v._x->Map()))
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "assign one vector to another",
+                 "Vectors must have the same parallel layout when assigning. "
+                 "Consider using the copy constructor instead");
+  }
+
+  // Assign values
+  *_x = *v._x;
+
+  // Update ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator+= (const GenericVector& y)
+{
+  axpy(1.0, y);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator+= (double a)
+{
+  dolfin_assert(_x);
+  Epetra_FEVector y(*_x);
+  y.PutScalar(a);
+  _x->Update(1.0, y, 1.0);
+
+  // Update ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator-= (const GenericVector& y)
+{
+  axpy(-1.0, y);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator-= (double a)
+{
+  dolfin_assert(_x);
+  Epetra_FEVector y(*_x);
+  y.PutScalar(-a);
+  _x->Update(1.0, y, 1.0);
+
+  // Update ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator*= (double a)
+{
+  dolfin_assert(_x);
+  const int err = _x->Scale(a);
+  if (err!= 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "multiply Epetra vector by scalar",
+                 "Did not manage to perform Epetra_Vector::Scale");
+  }
+
+  // Update ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator*= (const GenericVector& y)
+{
+  dolfin_assert(_x);
+  const EpetraVector& v = as_type<const EpetraVector>(y);
+
+  if (!v._x)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "perform point-wise multiplication with Epetra vector",
+                 "Given vector is not initialized");
+  }
+
+  if (size() != v.size())
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "perform point-wise multiplication with Epetra vector",
+                 "Vectors are not of the same size");
+  }
+
+  const int err = _x->Multiply(1.0, *_x, *v._x, 0.0);
+  if (err!= 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "perform point-wise multiplication with Epetra vector",
+                 "Did not manage to perform Epetra_Vector::Multiply");
+  }
+
+  // Update ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const EpetraVector& EpetraVector::operator/=(double a)
+{
+  *this *= 1.0/a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+double EpetraVector::norm(std::string norm_type) const
+{
+  dolfin_assert(_x);
+
+  double value = 0.0;
+  int err = 0;
+  if (norm_type == "l1")
+    err = _x->Norm1(&value);
+  else if (norm_type == "l2")
+    err = _x->Norm2(&value);
+  else if (norm_type == "linf")
+    err = _x->NormInf(&value);
+  else
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "compute norm of Epetra vector",
+                 "Illegal norm type \"%s\".", norm_type.c_str());
+  }
+
+  if (err != 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "compute norm of Epetra vector",
+                 "Did not manage to perform Epetra_vector::Norm");
+  }
+
+  return value;
+}
+//-----------------------------------------------------------------------------
+double EpetraVector::min() const
+{
+  dolfin_assert(_x);
+  double value = 0.0;
+  const int err = _x->MinValue(&value);
+  if (err!= 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "compute minimum value of Epetra vector",
+                 "Did not manage to perform Epetra_Vector::MinValue");
+  }
+
+  return value;
+}
+//-----------------------------------------------------------------------------
+double EpetraVector::max() const
+{
+  dolfin_assert(_x);
+  double value = 0.0;
+  const int err = _x->MaxValue(&value);
+  if (err != 0)
+  {
+    dolfin_error("EpetraVector.cpp",
+                 "compute maximum value of Epetra vector",
+                 "Did not manage to perform Epetra_Vector::MinValue");
+  }
+
+  return value;
+}
+//-----------------------------------------------------------------------------
+double EpetraVector::sum() const
+{
+  dolfin_assert(_x);
+  const std::size_t local_size = _x->MyLength();
+
+  // Get local values
+  std::vector<double> x_local;
+  get_local(x_local);
+
+  // Compute local sum
+  double local_sum = 0.0;
+  for (std::size_t i = 0; i < local_size; ++i)
+    local_sum += x_local[i];
+
+  // Compute global sum
+  double global_sum = 0.0;
+  _x->Comm().SumAll(&local_sum, &global_sum, 1);
+
+  return global_sum;
+}
+//-----------------------------------------------------------------------------
+double EpetraVector::sum(const Array<std::size_t>& rows) const
+{
+  dolfin_assert(_x);
+  const std::size_t n0 = local_range().first;
+  const std::size_t n1 = local_range().second;
+
+  // Build sets of local and nonlocal entries
+  Set<std::size_t> local_rows;
+  Set<std::size_t> nonlocal_rows;
+  for (std::size_t i = 0; i < rows.size(); ++i)
+  {
+    if (rows[i] >= n0 && rows[i] < n1)
+      local_rows.insert(rows[i]);
+    else
+      nonlocal_rows.insert(rows[i]);
+  }
+
+  // Send nonlocal row indices to other processes
+  const std::size_t num_processes = _x->Comm().NumProc();
+  const std::size_t process_number = _x->Comm().MyPID();
+  for (std::size_t i = 1; i < num_processes; ++i)
+  {
+    // Receive data from process p - i (i steps to the left), send data to
+    // process p + i (i steps to the right)
+    const std::size_t source
+      = (process_number - i + num_processes) % num_processes;
+    const std::size_t dest   = (process_number + i) % num_processes;
+
+    // Send and receive data
+    std::vector<std::size_t> received_nonlocal_rows;
+    MPI::send_recv(mpi_comm(), nonlocal_rows.set(), dest,
+                   received_nonlocal_rows, source);
+
+    // Add rows which reside on this process
+    for (std::size_t j = 0; j < received_nonlocal_rows.size(); ++j)
+    {
+      if (received_nonlocal_rows[j] >= n0 && received_nonlocal_rows[j] < n1)
+        local_rows.insert(received_nonlocal_rows[j]);
+    }
+  }
+
+  // Compute local sum
+  double local_sum = 0.0;
+  for (std::size_t i = 0; i < local_rows.size(); ++i)
+    local_sum += (*_x)[0][local_rows[i] - n0];
+
+  // Compute global sum
+  double global_sum = 0.0;
+  _x->Comm().SumAll(&local_sum, &global_sum, 1);
+
+  return global_sum;
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/la/EpetraVector.h b/dolfin/la/EpetraVector.h
new file mode 100644
index 0000000..a2316c0
--- /dev/null
+++ b/dolfin/la/EpetraVector.h
@@ -0,0 +1,251 @@
+// Copyright (C) 2008 Martin Sandve Alnes, Kent-Andre Mardal and Johannes Ring
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008-2010.
+// Modified by Garth N. Wells, 2008-2009.
+//
+// First added:  2008-04-21
+// Last changed: 2011-01-14
+
+#ifndef __EPETRA_VECTOR_H
+#define __EPETRA_VECTOR_H
+
+#ifdef HAS_TRILINOS
+
+#include <map>
+#include <string>
+#include <utility>
+#include <vector>
+#include <memory>
+#include <boost/unordered_map.hpp>
+#include <boost/unordered_set.hpp>
+
+#include <dolfin/common/types.h>
+#include "GenericVector.h"
+
+class Epetra_FEVector;
+class Epetra_MultiVector;
+class Epetra_Vector;
+class Epetra_BlockMap;
+
+namespace dolfin
+{
+
+  template <typename T> class Array;
+  class GenericVector;
+
+  /// This class provides a simple vector class based on Epetra.
+  /// It is a simple wrapper for an Epetra vector object (Epetra_FEVector)
+  /// implementing the GenericVector interface.
+  ///
+  /// The interface is intentionally simple. For advanced usage,
+  /// access the Epetra_FEVector object using the function vec() or vec_ptr()
+  /// and use the standard Epetra interface.
+
+  class EpetraVector: public GenericVector
+  {
+  public:
+
+    /// Create empty vector
+    EpetraVector();
+
+    /// Create vector of size N
+    EpetraVector(MPI_Comm comm, std::size_t N);
+
+    /// Copy constructor
+    EpetraVector(const EpetraVector& x);
+
+    /// Create vector view from given Epetra_FEVector pointer
+    explicit EpetraVector(std::shared_ptr<Epetra_FEVector> vector);
+
+    /// Create vector from given Epetra_BlockMap
+    explicit EpetraVector(const Epetra_BlockMap& map);
+
+    /// Destructor
+    virtual ~EpetraVector();
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero();
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode);
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    //--- Implementation of the GenericVector interface ---
+
+    /// Return copy of vector
+    virtual std::shared_ptr<GenericVector> copy() const;
+
+    /// Initialize vector to size N
+    virtual void init(MPI_Comm comm, std::size_t N);
+
+    /// Initialize vector with given ownership range
+    virtual void init(MPI_Comm comm,
+                      std::pair<std::size_t, std::size_t> range);
+
+    /// Initialize vector with given ownership range and with ghost
+    /// values
+    virtual void init(MPI_Comm comm,
+                      std::pair<std::size_t, std::size_t> range,
+                      const std::vector<la_index>& ghost_indices);
+
+    /// Return true if vector is empty
+    virtual bool empty() const;
+
+    /// Return size of vector
+    virtual std::size_t size() const;
+
+    /// Return size of local vector
+    virtual std::size_t local_size() const;
+
+    /// Return local ownership range of a vector
+    virtual std::pair<std::size_t, std::size_t> local_range() const;
+
+    /// Determine whether global vector index is owned by this process
+    virtual bool owns_index(std::size_t i) const;
+
+    /// Set block of values
+    virtual void set(const double* block, std::size_t m,
+                     const dolfin::la_index* rows);
+
+    /// Add block of values
+    virtual void add(const double* block, std::size_t m,
+                     const dolfin::la_index* rows);
+
+    virtual void get_local(double* block, std::size_t m,
+                           const dolfin::la_index* rows) const;
+
+    /// Get all values on local process
+    virtual void get_local(std::vector<double>& values) const;
+
+    /// Set all values on local process
+    virtual void set_local(const std::vector<double>& values);
+
+    /// Add all values to each entry on local process
+    virtual void add_local(const Array<double>& values);
+
+    /// Gather entries into local vector x
+    virtual void gather(GenericVector& x,
+                        const std::vector<dolfin::la_index>& indices) const;
+
+    /// Gather entries into x
+    virtual void gather(std::vector<double>& x,
+                        const std::vector<dolfin::la_index>& indices) const;
+
+    /// Gather all entries into x on process 0
+    virtual void gather_on_zero(std::vector<double>& x) const;
+
+    /// Add multiple of given vector (AXPY operation)
+    virtual void axpy(double a, const GenericVector& x);
+
+    /// Replace all entries in the vector by their absolute values
+    virtual void abs();
+
+    /// Return inner product with given vector
+    virtual double inner(const GenericVector& vector) const;
+
+    /// Return norm of vector
+    virtual double norm(std::string norm_type) const;
+
+    /// Return minimum value of vector
+    virtual double min() const;
+
+    /// Return maximum value of vector
+    virtual double max() const;
+
+    /// Return sum of values of vector
+    virtual double sum() const;
+
+    /// Return sum of selected rows in vector
+    virtual double sum(const Array<std::size_t>& rows) const;
+
+    /// Multiply vector by given number
+    virtual const EpetraVector& operator*= (double a);
+
+    /// Multiply vector by another vector pointwise
+    virtual const EpetraVector& operator*= (const GenericVector& x);
+
+    /// Divide vector by given number
+    virtual const EpetraVector& operator/= (double a);
+
+    /// Add given vector
+    virtual const EpetraVector& operator+= (const GenericVector& x);
+
+    /// Add number to all components of a vector
+    virtual const EpetraVector& operator+= (double a);
+
+    /// Subtract given vector
+    virtual const EpetraVector& operator-= (const GenericVector& x);
+
+    /// Subtract number from all components of a vector
+    virtual const EpetraVector& operator-= (double a);
+
+    /// Assignment operator
+    virtual const EpetraVector& operator= (const GenericVector& x);
+
+    /// Assignment operator
+    virtual const EpetraVector& operator= (double a);
+
+    virtual void update_ghost_values();
+
+    //--- Special functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const;
+
+    //--- Special Epetra functions ---
+
+    /// Initialize Epetra_FEVector with Epetra map
+    void init(const Epetra_BlockMap& map);
+
+    /// Return Epetra_FEVector pointer
+    std::shared_ptr<Epetra_FEVector> vec() const;
+
+    /// Assignment operator
+    const EpetraVector& operator= (const EpetraVector& x);
+
+    // Bring init function from GenericVector into scope
+    using GenericTensor::init;
+
+  private:
+
+    // Epetra_FEVector pointer
+    std::shared_ptr<Epetra_FEVector> _x;
+
+    // Epetra_FEVector pointer
+    std::shared_ptr<Epetra_Vector> x_ghost;
+
+    // Global-to-local map for ghost values
+    boost::unordered_map<std::size_t, std::size_t> ghost_global_to_local;
+
+    // Cache of off-process 'set' values (versus 'add') to be
+    // communicated
+    boost::unordered_map<std::size_t, double> off_process_set_values;
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/la/GenericLUSolver.h b/dolfin/la/GenericLUSolver.h
new file mode 100644
index 0000000..464dc95
--- /dev/null
+++ b/dolfin/la/GenericLUSolver.h
@@ -0,0 +1,84 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011-2012
+//
+// First added:  2010-07-11
+// Last changed: 2012-08-20
+
+#ifndef __GENERIC_LU_SOLVER_H
+#define __GENERIC_LU_SOLVER_H
+
+#include <memory>
+#include <dolfin/common/Variable.h>
+#include "GenericLinearSolver.h"
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class GenericVector;
+  class GenericLinearOperator;
+
+  /// This a base class for LU solvers
+
+  class GenericLUSolver : public GenericLinearSolver
+  {
+
+  public:
+
+    /// Set operator (matrix)
+    virtual void
+      set_operator(std::shared_ptr<const GenericLinearOperator> A) = 0;
+
+    /// Solve linear system Ax = b
+    virtual std::size_t solve(GenericVector& x, const GenericVector& b) = 0;
+
+    /// Solve linear system Ax = b
+    virtual std::size_t solve(const GenericLinearOperator& A,
+                       GenericVector& x, const GenericVector& b)
+    {
+      dolfin_error("GenericLUSolver.h",
+                   "solve linear system",
+                   "Not supported by current linear algebra backend. Consider using solve(x, b)");
+      return 0;
+    }
+
+    /// Solve linear system A^Tx = b
+    virtual std::size_t solve_transpose(GenericVector& x, const GenericVector& b)
+    {
+      dolfin_error("GenericLUSolver.h",
+                   "solve linear system",
+                   "Not supported by current linear algebra backend.");
+      return 0;
+    }
+
+    /// Solve linear system A^Tx = b
+    virtual std::size_t solve_transpose(const GenericLinearOperator& A,
+                       GenericVector& x, const GenericVector& b)
+    {
+      dolfin_error("GenericLUSolver.h",
+                   "solve linear system",
+                   "Not supported by current linear algebra backend.");
+      return 0;
+    }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/GenericLinearAlgebraFactory.h b/dolfin/la/GenericLinearAlgebraFactory.h
new file mode 100644
index 0000000..55d3b0e
--- /dev/null
+++ b/dolfin/la/GenericLinearAlgebraFactory.h
@@ -0,0 +1,124 @@
+// Copyright (C) 2007 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011-2012
+//
+// First added:  2007-11-30
+// Last changed: 2012-08-22
+
+#ifndef __GENERIC_LINEAR_ALGEBRA_FACTORY_H
+#define __GENERIC_LINEAR_ALGEBRA_FACTORY_H
+
+#include <string>
+#include <vector>
+#include <memory>
+#include <dolfin/common/types.h>
+#include <dolfin/log/log.h>
+
+// Included here so we can define dummy class below
+#include "GenericLinearOperator.h"
+
+namespace dolfin
+{
+
+  class GenericLinearSolver;
+  class GenericLUSolver;
+  class GenericMatrix;
+  class GenericVector;
+  class TensorLayout;
+
+  class GenericLinearAlgebraFactory
+  {
+  public:
+
+    /// Constructor
+    GenericLinearAlgebraFactory() {}
+
+    /// Destructor
+    virtual ~GenericLinearAlgebraFactory() {}
+
+    /// Create empty matrix
+    virtual std::shared_ptr<GenericMatrix> create_matrix() const = 0;
+
+    /// Create empty vector
+    virtual std::shared_ptr<GenericVector> create_vector() const = 0;
+
+    /// Create empty tensor layout
+    virtual std::shared_ptr<TensorLayout> create_layout(std::size_t rank) const = 0;
+
+    /// Create empty linear operator
+    virtual std::shared_ptr<GenericLinearOperator> create_linear_operator() const = 0;
+
+    /// Create LU solver
+    virtual std::shared_ptr<GenericLUSolver>
+    create_lu_solver(std::string method) const = 0;
+
+    /// Create Krylov solver
+    virtual std::shared_ptr<GenericLinearSolver>
+    create_krylov_solver(std::string method, std::string preconditioner) const = 0;
+
+    /// Return a list of available LU solver methods.
+    /// This function should be overloaded by subclass if non-empty.
+    virtual std::vector<std::pair<std::string, std::string> >
+    lu_solver_methods() const
+    {
+      std::vector<std::pair<std::string, std::string> > methods;
+      return methods;
+    }
+
+    /// Return a list of available Krylov solver methods.
+    /// This function should be overloaded by subclass if non-empty.
+    virtual std::vector<std::pair<std::string, std::string> >
+    krylov_solver_methods() const
+    {
+      std::vector<std::pair<std::string, std::string> > methods;
+      return methods;
+    }
+
+    /// Return a list of available preconditioners.
+    /// This function should be overloaded by subclass if non-empty.
+    virtual std::vector<std::pair<std::string, std::string> >
+    krylov_solver_preconditioners() const
+    {
+      std::vector<std::pair<std::string, std::string> > preconditioners;
+      return preconditioners;
+    }
+
+  protected:
+
+    // Dummy class that can be returned for linear algebra backends
+    // that do not support the GenericLinearOperator interface
+    class NotImplementedLinearOperator : public GenericLinearOperator
+    {
+    public:
+
+      std::size_t size(std::size_t dim) const
+      { return 0; }
+
+      void mult(const GenericVector& x, GenericVector& y) const
+      { dolfin_not_implemented(); }
+
+      std::string str(bool verbose) const
+      { dolfin_not_implemented(); return ""; }
+
+    };
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/GenericLinearOperator.h b/dolfin/la/GenericLinearOperator.h
new file mode 100644
index 0000000..edb1910
--- /dev/null
+++ b/dolfin/la/GenericLinearOperator.h
@@ -0,0 +1,77 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-08-20
+// Last changed: 2012-12-12
+
+#ifndef __GENERIC_LINEAR_OPERATOR_H
+#define __GENERIC_LINEAR_OPERATOR_H
+
+#include "LinearAlgebraObject.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericVector;
+  class GenericLinearAlgebraFactory;
+
+  /// This class defines a common interface for linear operators,
+  /// including actual matrices (class _GenericMatrix_) and linear
+  /// operators only defined in terms of their action on vectors.
+  ///
+  /// This class is used internally by DOLFIN to define a class
+  /// hierarchy of backend independent linear operators and solvers.
+  /// Users should not interface to this class directly but instead
+  /// use the _LinearOperator_ class.
+
+  class GenericLinearOperator : public virtual LinearAlgebraObject
+  {
+  public:
+
+    // Destructor
+    virtual ~GenericLinearOperator() {}
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const = 0;
+
+    /// Compute matrix-vector product y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const = 0;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const = 0;
+
+  protected:
+
+    friend class LinearOperator;
+
+    // Initialize linear operator to match parallel layout of vectors
+    // x and y for product y = Ax. Needs to be implemented by backend.
+    virtual void init_layout(const GenericVector& x, 
+			     const GenericVector& y,
+			     GenericLinearOperator* wrapper)
+    {
+      dolfin_error("GenericLinearOperator.h",
+                   "initialize backend implementation of linear operator",
+                   "Missing init_layout() function for backend");
+    }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/GenericLinearSolver.cpp b/dolfin/la/GenericLinearSolver.cpp
new file mode 100644
index 0000000..13249c0
--- /dev/null
+++ b/dolfin/la/GenericLinearSolver.cpp
@@ -0,0 +1,65 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-26
+// Last changed:
+
+#include "GenericLinearOperator.h"
+#include "GenericLinearSolver.h"
+#include "GenericMatrix.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+const GenericMatrix& GenericLinearSolver::require_matrix(const GenericLinearOperator& A)
+{
+  // Try to dynamic cast to a GenericMatrix
+  try
+  {
+    return dynamic_cast<const GenericMatrix&>(A);
+  }
+  catch (std::exception& e)
+  {
+    dolfin_error("GenericLinearSolver.h",
+                 "use linear operator as a matrix (real matrix required)",
+                 "%s", e.what());
+  }
+
+  // Return something to keep the compiler happy, code will not be reached
+  return dynamic_cast<const GenericMatrix&>(A);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericMatrix>
+GenericLinearSolver::require_matrix(std::shared_ptr<const GenericLinearOperator> A)
+{
+  // Try to down cast shared pointer
+  std::shared_ptr<const GenericMatrix> _matA
+    = std::dynamic_pointer_cast<const GenericMatrix>(A);
+
+  // Check results. Note the difference from the as_type functions
+  // in LinearAlgebraObject in that we check the return value here
+  // and throw an error if the cast fails.
+  if (!_matA)
+  {
+    dolfin_error("GenericLinearSolver.h",
+                 "use linear operator as a matrix (real matrix required)",
+                 "Dynamic cast failed");
+  }
+
+  return _matA;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/GenericLinearSolver.h b/dolfin/la/GenericLinearSolver.h
new file mode 100644
index 0000000..3e72bc1
--- /dev/null
+++ b/dolfin/la/GenericLinearSolver.h
@@ -0,0 +1,147 @@
+// Copyright (C) 2008-2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2009-2013
+//
+// First added:  2008-08-26
+// Last changed: 2014-05-27
+
+#ifndef __GENERIC_LINEAR_SOLVER_H
+#define __GENERIC_LINEAR_SOLVER_H
+
+#include <vector>
+#include <memory>
+#include <dolfin/common/Variable.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericLinearOperator;
+  class GenericMatrix;
+  class GenericVector;
+  class VectorSpaceBasis;
+
+  /// This class provides a general solver for linear systems Ax = b.
+
+  class GenericLinearSolver : public Variable
+  {
+  public:
+
+    /// Set operator (matrix)
+    virtual void
+      set_operator(std::shared_ptr<const GenericLinearOperator> A) = 0;
+
+    /// Set operator (matrix) and preconditioner matrix
+    virtual void
+      set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                    std::shared_ptr<const GenericLinearOperator> P)
+    {
+      dolfin_error("GenericLinearSolver.h",
+                   "set operator and preconditioner for linear solver",
+                   "Not supported by current linear algebra backend");
+    }
+
+    /// Set null space of the operator (matrix). This is used to solve
+    /// singular systems
+    virtual void set_nullspace(const VectorSpaceBasis& nullspace)
+    {
+      dolfin_error("GenericLinearSolver.h",
+                   "set nullspace for operator",
+                   "Not supported by current linear algebra solver backend");
+    }
+
+    /// Solve linear system Ax = b
+    virtual std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                              const GenericVector& b)
+    {
+      dolfin_error("GenericLinearSolver.h",
+                   "solve linear system",
+                   "Not supported by current linear algebra backend. Consider using solve(x, b)");
+      return 0;
+    }
+
+    /// Solve linear system Ax = b
+    virtual std::size_t solve(GenericVector& x, const GenericVector& b)
+    {
+      dolfin_error("GenericLinearSolver.h",
+                   "solve linear system",
+                   "Not supported by current linear algebra backend. Consider using solve(x, b)");
+      return 0;
+    }
+
+    /// Solve linear system A^Tx = b
+    virtual std::size_t solve_transpose(const GenericLinearOperator& A,
+                                        GenericVector& x,
+                                        const GenericVector& b)
+    {
+      dolfin_error("GenericLinearSolver.h",
+                   "solve linear system transpose",
+                   "Not supported by current linear algebra backend. Consider using solve_transpose(x, b)");
+      return 0;
+    }
+
+    /// Solve linear system A^Tx = b
+    virtual std::size_t solve_transpose(GenericVector& x,
+                                        const GenericVector& b)
+    {
+      dolfin_error("GenericLinearSolver.h",
+                   "solve linear system transpose",
+                   "Not supported by current linear algebra backend. Consider using solve_transpose(x, b)");
+      return 0;
+    }
+
+    // FIXME: This should not be needed. Need to cleanup linear solver
+    // name jungle: default, lu, iterative, direct, krylov, etc
+    /// Return parameter type: "krylov_solver" or "lu_solver"
+    virtual std::string parameter_type() const
+    {
+      return "default";
+    }
+
+    /// Update solver parameters (useful for LinearSolver wrapper)
+    virtual void update_parameters(const Parameters& parameters)
+    {
+      this->parameters.update(parameters);
+    }
+
+  protected:
+
+    // Developer note: The functions here provide similar functionality
+    // as the as_type functions in the LinearAlgebraObject base class. The
+    // difference is that they specifically complain that a matrix is
+    // required, which gives a user a more informative error message
+    //from solvers that don't support matrix-free representation of
+    //linear operators.
+
+    // Down-cast GenericLinearOperator to GenericMatrix when an actual
+    // matrix is required, not only a linear operator. This is the
+    // const reference version of the down-cast.
+    static const GenericMatrix& require_matrix(const GenericLinearOperator& A);
+
+    // Down-cast GenericLinearOperator to GenericMatrix when an actual
+    // matrix is required, not only a linear operator. This is the
+    // const reference version of the down-cast.
+    static std::shared_ptr<const GenericMatrix>
+    require_matrix(std::shared_ptr<const GenericLinearOperator> A);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/GenericMatrix.cpp b/dolfin/la/GenericMatrix.cpp
new file mode 100644
index 0000000..08f95e5
--- /dev/null
+++ b/dolfin/la/GenericMatrix.cpp
@@ -0,0 +1,183 @@
+// Copyright (C) 2010-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Mikael Mortensen 2011
+//
+// First added:  2010-02-23
+// Last changed: 2013-02-19
+
+#include <dolfin/common/constants.h>
+#include <dolfin/common/Timer.h>
+#include "GenericSparsityPattern.h"
+#include "GenericLinearAlgebraFactory.h"
+#include "TensorLayout.h"
+#include "GenericMatrix.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void GenericMatrix::ident_zeros()
+{
+  // Check size of system
+  if (size(0) != size(1))
+  {
+    dolfin_error("GenericMatrix.cpp",
+                 "ident_zeros",
+                 "Matrix is not square");
+  }
+
+  std::vector<std::size_t> columns;
+  std::vector<double> values;
+  std::vector<dolfin::la_index> zero_rows;
+  const std::pair<std::size_t, std::size_t> row_range = local_range(0);
+  const std::size_t m = row_range.second - row_range.first;
+
+  // Check which rows are zero
+  for (std::size_t row = 0; row < m; row++)
+  {
+    // Get global row number
+    int global_row = row + row_range.first;
+
+    // Get value for row
+    getrow(global_row, columns, values);
+
+    // Get maximum value in row
+    double max = 0.0;
+    for (std::size_t k = 0; k < values.size(); k++)
+      max = std::max(max, std::abs(values[k]));
+
+    // Check if row is zero
+    if (max < DOLFIN_EPS)
+      zero_rows.push_back(global_row);
+  }
+
+  // Write a message
+  log(TRACE, "Found %d zero row(s), inserting ones on the diagonal.", zero_rows.size());
+
+  // Insert one on the diagonal for rows with only zeros.
+  ident(zero_rows.size(), zero_rows.data());
+
+  // Apply changes
+  apply("insert");
+}
+//-----------------------------------------------------------------------------
+void GenericMatrix::compressed(GenericMatrix& B) const
+{
+  Timer timer("Compress matrix");
+
+  // Create new layout
+  std::shared_ptr<TensorLayout>
+    new_layout = B.factory().create_layout(2);
+  dolfin_assert(new_layout);
+
+  // Pointer to sparsity pattern
+  GenericSparsityPattern* new_sparsity_pattern
+    = new_layout->sparsity_pattern().get();
+
+  // Retrieve global and local matrix info
+  std::vector<std::size_t> global_dimensions(2);
+  global_dimensions[0] = size(0);
+  global_dimensions[1] = size(1);
+  std::vector<std::pair<std::size_t, std::size_t> > local_range(2);
+  local_range[0] = this->local_range(0);
+  local_range[1] = this->local_range(0);
+
+  // With the row-by-row algorithm used here there is no need for
+  // inserting non_local rows and as such we can simply use a dummy
+  // for off_process_owner
+  std::vector<const boost::unordered_map<std::size_t, unsigned int>* >
+    off_process_owner(2);
+  const boost::unordered_map<std::size_t, unsigned int> dummy;
+  off_process_owner[0] = &dummy;
+  off_process_owner[1] = &dummy;
+  const std::pair<std::size_t, std::size_t> row_range = local_range[0];
+  const std::size_t m = row_range.second - row_range.first;
+
+  // Initialize layout
+  new_layout->init(MPI_COMM_WORLD, global_dimensions, 1, local_range);
+
+  // Initialize sparsity pattern
+  if (new_sparsity_pattern)
+    new_sparsity_pattern->init(MPI_COMM_WORLD, global_dimensions, local_range,
+                               off_process_owner);
+
+  // Declare some variables used to extract matrix information
+  std::vector<std::size_t> columns;
+  std::vector<double> values;
+
+  // Hold all values of local matrix
+  std::vector<double> allvalues;
+
+  // Hold column id for all values of local matrix
+  std::vector<dolfin::la_index> allcolumns;
+
+  // Hold accumulated number of cols on local matrix
+  std::vector<dolfin::la_index> offset(m + 1);
+
+  offset[0] = 0;
+  std::vector<dolfin::la_index> thisrow(1);
+  std::vector<dolfin::la_index> thiscolumn;
+  std::vector<const std::vector<dolfin::la_index>* > dofs(2);
+  dofs[0] = &thisrow;
+  dofs[1] = &thiscolumn;
+
+  // Iterate over rows
+  for (std::size_t i = 0; i < m; i++)
+  {
+    // Get row and locate nonzeros. Store non-zero values and columns
+    // for later
+    const std::size_t global_row = i + row_range.first;
+    getrow(global_row, columns, values);
+    std::size_t count = 0;
+    thiscolumn.clear();
+    for (std::size_t j = 0; j < columns.size(); j++)
+    {
+      // Store if non-zero or diagonal entry. PETSc solvers require this
+      if (std::abs(values[j]) > DOLFIN_EPS || columns[j] == global_row)
+      {
+        thiscolumn.push_back(columns[j]);
+        allvalues.push_back(values[j]);
+        allcolumns.push_back(columns[j]);
+        count++;
+      }
+    }
+
+    thisrow[0] = global_row;
+    offset[i + 1] = offset[i] + count;
+
+    // Build new compressed sparsity pattern
+    if (new_sparsity_pattern)
+      new_sparsity_pattern->insert(dofs);
+  }
+
+  // Finalize sparsity pattern
+  if (new_sparsity_pattern)
+    new_sparsity_pattern->apply();
+
+  // Create matrix with the new layout
+  B.init(*new_layout);
+
+  // Put the values back into new compressed matrix
+  for (std::size_t i = 0; i < m; i++)
+  {
+    const dolfin::la_index global_row = i + row_range.first;
+    B.set(&allvalues[offset[i]], 1, &global_row,
+        offset[i+1] - offset[i], &allcolumns[offset[i]]);
+  }
+  B.apply("insert");
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/GenericMatrix.h b/dolfin/la/GenericMatrix.h
new file mode 100644
index 0000000..c77d86d
--- /dev/null
+++ b/dolfin/la/GenericMatrix.h
@@ -0,0 +1,239 @@
+// Copyright (C) 2006-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Jansson 2006
+// Modified by Anders Logg 2006-2012
+// Modified by Ola Skavhaug 2007-2008
+// Modified by Kent-Andre Mardal 2008
+// Modified by Martin Alnæs 2008
+// Modified by Mikael Mortensen 2011
+//
+// First added:  2006-04-24
+// Last changed: 2012-08-20
+
+#ifndef __GENERIC_MATRIX_H
+#define __GENERIC_MATRIX_H
+
+#include <vector>
+#include <boost/tuple/tuple.hpp>
+#include "GenericTensor.h"
+#include "GenericLinearOperator.h"
+
+namespace dolfin
+{
+
+  class GenericVector;
+  class TensorLayout;
+
+  /// This class defines a common interface for matrices.
+
+  class GenericMatrix : public GenericTensor, public GenericLinearOperator
+  {
+  public:
+
+    /// Destructor
+    virtual ~GenericMatrix() {}
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Return tensor rank (number of dimensions)
+    virtual std::size_t rank() const
+    { return 2; }
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const = 0;
+
+    /// Return local ownership range
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const = 0;
+
+    /// Get block of values
+    virtual void get(double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows) const
+    { get(block, num_rows[0], rows[0], num_rows[1], rows[1]); }
+
+    /// Set block of values
+    virtual void set(const double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows)
+    { set(block, num_rows[0], rows[0], num_rows[1], rows[1]); }
+
+    /// Add block of values
+    virtual void add(const double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows)
+    { add(block, num_rows[0], rows[0], num_rows[1], rows[1]); }
+
+    /// Add block of values
+    virtual void
+      add(const double* block,
+          const std::vector<const std::vector<dolfin::la_index>* >& rows)
+    {
+      add(block, (rows[0])->size(), &(*rows[0])[0], (rows[1])->size(),
+          &(*rows[1])[0]);
+    }
+
+    /// Add block of values
+    virtual void add(const double* block,
+                     const std::vector<std::vector<dolfin::la_index> >& rows)
+    {
+      add(block, rows[0].size(), &(rows[0])[0], rows[1].size(),
+          &(rows[1])[0]);
+    }
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero() = 0;
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode) = 0;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const = 0;
+
+    //--- Matrix interface ---
+
+    /// Return copy of matrix
+    virtual std::shared_ptr<GenericMatrix> copy() const = 0;
+
+    /// Initialize vector z to be compatible with the matrix-vector
+    /// product y = Ax. In the parallel case, both size and layout are
+    /// important.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+    virtual void init_vector(GenericVector& z, std::size_t dim) const = 0;
+
+    /// Get block of values
+    virtual void get(double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols) const = 0;
+
+    /// Set block of values
+    virtual void set(const double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols) = 0;
+
+    /// Add block of values
+    virtual void add(const double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols) = 0;
+
+    /// Add multiple of given matrix (AXPY operation)
+    virtual void axpy(double a, const GenericMatrix& A,
+                      bool same_nonzero_pattern) = 0;
+
+    /// Return norm of matrix
+    virtual double norm(std::string norm_type) const = 0;
+
+    /// Get non-zero values of given row on local process
+    virtual void getrow(std::size_t row, std::vector<std::size_t>& columns,
+                        std::vector<double>& values) const = 0;
+
+    /// Set values for given row on local process
+    virtual void setrow(std::size_t row,
+                        const std::vector<std::size_t>& columns,
+                        const std::vector<double>& values) = 0;
+
+    /// Set given rows to zero
+    virtual void zero(std::size_t m, const dolfin::la_index* rows) = 0;
+
+    /// Set given rows to identity matrix
+    virtual void ident(std::size_t m, const dolfin::la_index* rows) = 0;
+
+    /// Matrix-vector product, y = A^T x. The y vector must either be
+    /// zero-sized or have correct size and parallel layout.
+    virtual void transpmult(const GenericVector& x, GenericVector& y) const = 0;
+
+    /// Set diagonal of a matrix
+    virtual void set_diagonal(const GenericVector& x) = 0;
+
+    /// Multiply matrix by given number
+    virtual const GenericMatrix& operator*= (double a) = 0;
+
+    /// Divide matrix by given number
+    virtual const GenericMatrix& operator/= (double a) = 0;
+
+    /// Add given matrix
+    const GenericMatrix& operator+= (const GenericMatrix& A)
+    {
+      axpy(1.0, A, false);
+      return *this;
+    }
+
+    /// Subtract given matrix
+    const GenericMatrix& operator-= (const GenericMatrix& A)
+    {
+      axpy(-1.0, A, false);
+      return *this;
+    }
+
+    /// Test if matrix is symmetric
+    virtual bool is_symmetric(double tol) const
+    {
+      dolfin_error("GenericMatrix.h",
+                   "test if matrix is symmetric",
+                   "Not implemented by current linear algebra backend");
+      return false;
+    }
+
+    /// Assignment operator
+    virtual const GenericMatrix& operator= (const GenericMatrix& x) = 0;
+
+    /// Return pointers to underlying compresssed row/column storage data
+    /// For compressed row storage, data = (row_pointer[#rows +1],
+    /// column_index[#nz], matrix_values[#nz], nz)
+    virtual boost::tuples::tuple<const std::size_t*, const std::size_t*,
+                                 const double*, int> data() const
+    {
+      dolfin_error("GenericMatrix.h",
+                   "return pointers to underlying matrix data",
+                   "Not implemented by current linear algebra backend");
+      return boost::tuples::tuple<const std::size_t*, const std::size_t*,
+                                  const double*, int>(0, 0, 0, 0);
+   }
+
+    //--- Convenience functions ---
+
+    /// Get value of given entry
+    virtual double operator() (dolfin::la_index i, dolfin::la_index j) const
+    { double value(0); get(&value, 1, &i, 1, &j); return value; }
+
+    /// Get value of given entry
+    virtual double getitem(std::pair<dolfin::la_index,
+                           dolfin::la_index> ij) const
+    {
+      double value(0);
+      get(&value, 1, &ij.first, 1, &ij.second);
+      return value;
+    }
+
+    /// Set given entry to value. apply("insert") must be called
+    /// before using using the object.
+    virtual void setitem(std::pair<dolfin::la_index, dolfin::la_index> ij,
+                         double value)
+    {  set(&value, 1, &ij.first, 1, &ij.second); }
+
+    /// Insert one on the diagonal for all zero rows
+    virtual void ident_zeros();
+
+    /// Build compressed version of matrix (zeros removed)
+    virtual void compressed(GenericMatrix& B) const;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/GenericPreconditioner.h b/dolfin/la/GenericPreconditioner.h
new file mode 100644
index 0000000..cebd498
--- /dev/null
+++ b/dolfin/la/GenericPreconditioner.h
@@ -0,0 +1,66 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-11-09
+// Last changed:
+
+#ifndef __GENERIC_PRECONDITIONER_H
+#define __GENERIC_PRECONDITIONER_H
+
+#include <vector>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericVector;
+  class VectorSpaceBasis;
+
+  /// This class provides a common base preconditioners.
+
+  class GenericPreconditioner
+  {
+  public:
+
+    virtual ~GenericPreconditioner() {}
+
+    /// Set the (approximate) null space of the preconditioner operator
+    /// (matrix). This is required for certain preconditioner types,
+    /// e.g. smoothed aggregation multigrid
+    virtual void set_nullspace(const VectorSpaceBasis& nullspace)
+    {
+      dolfin_error("GenericPreconditioner.h",
+                   "set nullspace for preconditioner operator",
+                   "Not supported by current preconditioner type");
+    }
+
+    /// Set the coordinates of the operator (matrix) rows and geometric
+    /// dimension d. This is can be used by required for certain
+    /// preconditioners, e.g. ML. The input for this function can be
+    /// generated using GenericDofMap::tabulate_all_dofs.
+    virtual void set_coordinates(const std::vector<double>& x, std::size_t dim)
+    {
+      dolfin_error("GenericPreconditioner.h",
+                   "set coordinates for preconditioner operator",
+                   "Not supported by current preconditioner type");
+    }
+
+  };
+}
+
+#endif
diff --git a/dolfin/la/GenericSparsityPattern.h b/dolfin/la/GenericSparsityPattern.h
new file mode 100644
index 0000000..3406ff8
--- /dev/null
+++ b/dolfin/la/GenericSparsityPattern.h
@@ -0,0 +1,129 @@
+// Copyright (C) 2007 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Magnus Vikstrom, 2008.
+// Modified by Anders Logg, 2009.
+// Modified by Garth N. Wells, 2010.
+//
+// First added:  2007-11-30
+// Last changed: 2010-12-30
+
+#ifndef __GENERIC_SPARSITY_PATTERN_H
+#define __GENERIC_SPARSITY_PATTERN_H
+
+#include <utility>
+#include <vector>
+#include <boost/unordered_map.hpp>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  /// Base class (interface) for generic tensor sparsity patterns.
+  /// Currently, this interface is mostly limited to matrices.
+
+  class GenericSparsityPattern : public Variable
+  {
+  public:
+
+    enum Type {sorted, unsorted};
+
+    /// Create empty sparsity pattern
+    GenericSparsityPattern(std::size_t primary_dim)
+      : _primary_dim(primary_dim) {}
+
+    /// Destructor
+    virtual ~GenericSparsityPattern() {}
+
+    /// Initialize sparsity pattern for a generic tensor
+    virtual void
+      init(const MPI_Comm mpi_comm,
+           const std::vector<std::size_t>& dims,
+           const std::vector<std::pair<std::size_t, std::size_t> >& local_range,
+           const std::vector<const boost::unordered_map<std::size_t,
+           unsigned int>* > off_process_owner) = 0;
+
+    /// Insert non-zero entries
+    virtual void insert(const std::vector<const std::vector<dolfin::la_index>* >& entries) = 0;
+
+    /// Add edges (vertex = [index, owning process])
+    virtual void
+      add_edges(const std::pair<dolfin::la_index, std::size_t>& vertex,
+                const std::vector<dolfin::la_index>& edges) = 0;
+
+    /// Return rank
+    virtual std::size_t rank() const = 0;
+
+    /// Return primary dimension (e.g., 0=row partition, 1=column partition)
+    std::size_t primary_dim() const
+    { return _primary_dim; }
+
+    /// Return local range for dimension dim
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const = 0;
+
+    /// Return total number of nonzeros in local_range
+    virtual std::size_t num_nonzeros() const = 0;
+
+    /// Fill vector with number of nonzeros for diagonal block in
+    /// local_range for primary dimemsion
+    virtual void
+      num_nonzeros_diagonal(std::vector<std::size_t>& num_nonzeros) const = 0;
+
+    /// Fill vector with number of nonzeros for off-diagonal block in
+    /// local_range for primary dimemsion
+    virtual void num_nonzeros_off_diagonal(std::vector<std::size_t>& num_nonzeros) const = 0;
+
+    /// Fill vector with number of nonzeros in local_range for
+    /// primary dimemsion
+    virtual void
+      num_local_nonzeros(std::vector<std::size_t>& num_nonzeros) const = 0;
+
+    /// Return underlying sparsity pattern (diagonal). Options are
+    /// 'sorted' and 'unsorted'.
+    virtual std::vector<std::vector<std::size_t> >
+      diagonal_pattern(Type type) const = 0;
+
+    /// Return underlying sparsity pattern (off-diagional). Options are
+    /// 'sorted' and 'unsorted'.
+    virtual std::vector<std::vector<std::size_t> >
+      off_diagonal_pattern(Type type) const = 0;
+
+    /// Fill vector with edges for given vertex
+    virtual void get_edges(std::size_t vertex,
+                           std::vector<dolfin::la_index>& edges) const = 0;
+
+    /// Finalize sparsity pattern
+    virtual void apply() = 0;
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const = 0;
+
+  private:
+
+    // Primary sparsity pattern storage dimension
+    // (e.g., 0=row partition, 1=column partition)
+    const std::size_t _primary_dim;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/GenericTensor.h b/dolfin/la/GenericTensor.h
new file mode 100644
index 0000000..8f1c14e
--- /dev/null
+++ b/dolfin/la/GenericTensor.h
@@ -0,0 +1,110 @@
+// Copyright (C) 2007-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2007-2011
+// Modified by Ola Skavhaug 2007
+// Modified by Martin Alnæs 2008
+//
+// First added:  2007-01-17
+// Last changed: 2012-08-22
+
+#ifndef __GENERIC_TENSOR_H
+#define __GENERIC_TENSOR_H
+
+#include <exception>
+#include <typeinfo>
+#include <memory>
+#include <dolfin/log/log.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/types.h>
+#include "LinearAlgebraObject.h"
+
+namespace dolfin
+{
+
+  class TensorLayout;
+  class GenericLinearAlgebraFactory;
+
+  /// This class defines a common interface for arbitrary rank tensors.
+
+  class GenericTensor : public virtual LinearAlgebraObject
+  {
+  public:
+
+    /// Destructor
+    virtual ~GenericTensor() {}
+
+    //--- Basic GenericTensor interface ---
+
+    /// Initialize zero tensor using tensor layout
+    virtual void init(const TensorLayout& tensor_layout) = 0;
+
+    /// Return true if empty
+    virtual bool empty() const = 0;
+
+    /// Return tensor rank (number of dimensions)
+    virtual std::size_t rank() const = 0;
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const = 0;
+
+    /// Return local ownership range
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const = 0;
+
+    /// Get block of values
+    virtual void get(double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows) const = 0;
+
+    /// Set block of values
+    virtual void set(const double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows) = 0;
+
+    /// Add block of values
+    virtual
+      void add(const double* block,
+           const std::vector<const std::vector<dolfin::la_index>* >& rows) = 0;
+
+    /// Add block of values
+    virtual
+      void add(const double* block,
+               const std::vector<std::vector<dolfin::la_index> >& rows) = 0;
+
+    /// Add block of values
+    virtual void add(const double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows) = 0;
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero() = 0;
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode) = 0;
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const = 0;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const = 0;
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const = 0;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/GenericVector.h b/dolfin/la/GenericVector.h
new file mode 100644
index 0000000..e96079b
--- /dev/null
+++ b/dolfin/la/GenericVector.h
@@ -0,0 +1,289 @@
+// Copyright (C) 2006-2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006-2011
+// Modified by Kent-Andre Mardal 2008
+// Modified by Ola Skavhaug 2008
+// Modified by Martin Sandve Alnes 2009
+// Modified by Johan Hake 2009-2010
+//
+// First added:  2006-04-25
+// Last changed: 2011-11-11
+
+#ifndef __GENERIC_VECTOR_H
+#define __GENERIC_VECTOR_H
+
+#include <algorithm>
+#include <utility>
+#include <vector>
+#include <dolfin/log/log.h>
+#include <dolfin/common/types.h>
+#include "TensorLayout.h"
+#include "GenericTensor.h"
+
+namespace dolfin
+{
+  template<typename T> class Array;
+
+  /// This class defines a common interface for vectors.
+
+  class GenericVector : public GenericTensor
+  {
+  public:
+
+    /// Destructor
+    virtual ~GenericVector() {}
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Initialize zero tensor using sparsity pattern
+    virtual void init(const TensorLayout& tensor_layout)
+    {
+      if (!empty())
+        error("GenericVector cannot be initialised more than once");
+      init(tensor_layout.mpi_comm(), tensor_layout.local_range(0));
+      zero();
+    }
+
+    /// Return tensor rank (number of dimensions)
+    virtual std::size_t rank() const
+    { return 1; }
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const
+    { dolfin_assert(dim == 0); return size(); }
+
+    /// Return local ownership range
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const
+    { dolfin_assert(dim == 0); return local_range(); }
+
+    /// Get block of values
+    virtual void get(double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows) const
+    { get_local(block, num_rows[0], rows[0]); }
+
+    /// Set block of values
+    virtual void set(const double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows)
+    { set(block, num_rows[0], rows[0]); }
+
+    /// Add block of values
+    virtual void add(const double* block, const dolfin::la_index* num_rows,
+                     const dolfin::la_index * const * rows)
+    { add(block, num_rows[0], rows[0]); }
+
+    /// Add block of values
+    virtual void
+      add(const double* block,
+          const std::vector<const std::vector<dolfin::la_index>* >& rows)
+    { add(block, rows[0]->size(), &(*rows[0])[0]); }
+
+    /// Add block of values
+    virtual void add(const double* block,
+                     const std::vector<std::vector<dolfin::la_index> >& rows)
+    { add(block, rows[0].size(), &(rows[0])[0]); }
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero() = 0;
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode) = 0;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const = 0;
+
+    //--- Vector interface ---
+
+    /// Return copy of vector
+    virtual std::shared_ptr<GenericVector> copy() const = 0;
+
+    /// Initialize vector to global size N
+    virtual void init(MPI_Comm comm, std::size_t N) = 0;
+
+    /// Intitialize vector with given local ownership range
+    virtual void init(MPI_Comm comm,
+                      std::pair<std::size_t, std::size_t> range) = 0;
+
+    /// Initialise vector with given ownership range and with ghost
+    /// values
+    virtual void init(MPI_Comm comm,
+                      std::pair<std::size_t, std::size_t> range,
+                      const std::vector<la_index>& ghost_indices) = 0;
+
+    /// Deprecated: resize vector to global size N
+    virtual void resize(MPI_Comm comm, std::size_t N)
+    {
+      deprecation("EpetraVector::resize(...)", "1.4", "1.5",
+                  "Use GenericVector::init(...) (can only be called once).");
+      init(comm, N);
+    }
+
+    /// Deprecated: resize vector with given ownership range
+    virtual void resize(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range)
+    {
+      deprecation("EpetraVector::resize(...)", "1.4", "1.5",
+                  "Use GenericVector::init(...) (can only be called once).");
+      init(comm, range);
+    }
+
+    /// Deprevated: resize vector with given ownership range and with
+    /// ghost values
+    virtual void resize(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range,
+                        const std::vector<la_index>& ghost_indices)
+    {
+      deprecation("EpetraVector::resize(...)", "1.4", "1.5",
+                  "Use GenericVector::init(...) (can only be called once).");
+      init(comm, range, ghost_indices);
+    }
+
+    /// Return global size of vector
+    virtual std::size_t size() const = 0;
+
+    /// Return local size of vector
+    virtual std::size_t local_size() const = 0;
+
+    /// Return local ownership range of a vector
+    virtual std::pair<std::size_t, std::size_t> local_range() const = 0;
+
+    /// Determine whether global vector index is owned by this process
+    virtual bool owns_index(std::size_t i) const = 0;
+
+    /// Get block of values (values must all live on the local process)
+    virtual void get_local(double* block, std::size_t m,
+                           const dolfin::la_index* rows) const = 0;
+
+    /// Set block of values
+    virtual void set(const double* block, std::size_t m,
+                     const dolfin::la_index* rows) = 0;
+
+    /// Add block of values
+    virtual void add(const double* block, std::size_t m,
+                     const dolfin::la_index* rows) = 0;
+
+    /// Get all values on local process
+    virtual void get_local(std::vector<double>& values) const = 0;
+
+    /// Set all values on local process
+    virtual void set_local(const std::vector<double>& values) = 0;
+
+    /// Add values to each entry on local process
+    virtual void add_local(const Array<double>& values) = 0;
+
+    /// Gather entries into local vector x
+    virtual void gather(GenericVector& x,
+                        const std::vector<dolfin::la_index>& indices) const = 0;
+
+    /// Gather entries into x
+    virtual void gather(std::vector<double>& x,
+                        const std::vector<dolfin::la_index>& indices) const = 0;
+
+    /// Gather all entries into x on process 0
+    virtual void gather_on_zero(std::vector<double>& x) const = 0;
+
+    /// Add multiple of given vector (AXPY operation)
+    virtual void axpy(double a, const GenericVector& x) = 0;
+
+    /// Replace all entries in the vector by their absolute values
+    virtual void abs() = 0;
+
+    /// Return inner product with given vector
+    virtual double inner(const GenericVector& x) const = 0;
+
+    /// Return norm of vector
+    virtual double norm(std::string norm_type) const = 0;
+
+    /// Return minimum value of vector
+    virtual double min() const = 0;
+
+    /// Return maximum value of vector
+    virtual double max() const = 0;
+
+    /// Return sum of vector
+    virtual double sum() const = 0;
+
+    /// Return sum of selected rows in vector. Repeated entries are
+    /// only summed once.
+    virtual double sum(const Array<std::size_t>& rows) const = 0;
+
+    /// Multiply vector by given number
+    virtual const GenericVector& operator*= (double a) = 0;
+
+    /// Multiply vector by another vector pointwise
+    virtual const GenericVector& operator*= (const GenericVector& x) = 0;
+
+    /// Divide vector by given number
+    virtual const GenericVector& operator/= (double a) = 0;
+
+    /// Add given vector
+    virtual const GenericVector& operator+= (const GenericVector& x) = 0;
+
+    /// Add number to all components of a vector
+    virtual const GenericVector& operator+= (double a) = 0;
+
+    /// Subtract given vector
+    virtual const GenericVector& operator-= (const GenericVector& x) = 0;
+
+    /// Subtract number from all components of a vector
+    virtual const GenericVector& operator-= (double a) = 0;
+
+    /// Assignment operator
+    virtual const GenericVector& operator= (const GenericVector& x) = 0;
+
+    /// Assignment operator
+    virtual const GenericVector& operator= (double a) = 0;
+
+    /// Return pointer to underlying data (const version)
+    virtual const double* data() const
+    {
+      dolfin_error("GenericVector.h",
+                   "return pointer to underlying vector data",
+                   "Not implemented by current linear algebra backend");
+      return 0;
+    }
+
+    /// Return pointer to underlying data
+    virtual double* data()
+    {
+      dolfin_error("GenericVector.h",
+                   "return pointer to underlying vector data",
+                   "Not implemented by current linear algebra backend");
+      return 0;
+    }
+
+    //--- Convenience functions ---
+
+    /// Get value of given entry
+    virtual double operator[] (dolfin::la_index i) const
+    { double value(0); get_local(&value, 1, &i); return value; }
+
+    /// Get value of given entry
+    virtual double getitem(dolfin::la_index i) const
+    { double value(0); get_local(&value, 1, &i); return value; }
+
+    /// Set given entry to value. apply("insert") should be called
+    /// before using using the object.
+    virtual void setitem(dolfin::la_index i, double value)
+    { set(&value, 1, &i); }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/KrylovSolver.cpp b/dolfin/la/KrylovSolver.cpp
new file mode 100644
index 0000000..2ae9a64
--- /dev/null
+++ b/dolfin/la/KrylovSolver.cpp
@@ -0,0 +1,194 @@
+// Copyright (C) 2007-2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2008
+// Modified by Anders Logg 2008-2012
+//
+// First added:  2007-07-03
+// Last changed: 2013-11-25
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/parameter/Parameters.h>
+#include <dolfin/log/LogStream.h>
+#include "GenericMatrix.h"
+#include "GenericVector.h"
+#include "DefaultFactory.h"
+#include "LinearSolver.h"
+#include "VectorSpaceBasis.h"
+#include "KrylovSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Parameters KrylovSolver::default_parameters()
+{
+  Parameters p("krylov_solver");
+
+  p.add("relative_tolerance",      1.0e-6);
+  p.add("absolute_tolerance",      1.0e-15);
+  p.add("divergence_limit",        1.0e4);
+  p.add("maximum_iterations",      10000);
+  p.add("report",                  true);
+  p.add("monitor_convergence",     false);
+  p.add("error_on_nonconvergence", true);
+  p.add("nonzero_initial_guess",   false);
+
+  // FIXME: This should be removed, see
+  // https://bugs.launchpad.net/dolfin/+bug/988494
+  p.add("use_petsc_cusp_hack", false);
+
+  // GMRES options
+  Parameters p_gmres("gmres");
+  p_gmres.add("restart", 30);
+  p.add(p_gmres);
+
+  // General preconditioner options
+  Parameters p_pc("preconditioner");
+  p_pc.add("shift_nonzero", 0.0);
+
+  // Re-use options
+  std::set<std::string> structure_options;
+  structure_options.insert("same");
+  structure_options.insert("same_nonzero_pattern");
+  structure_options.insert("different_nonzero_pattern");
+  p_pc.add("structure", "different_nonzero_pattern", structure_options);
+
+  p_pc.add("report", false);
+
+  // ILU preconditioner options
+  Parameters p_pc_ilu("ilu");
+  p_pc_ilu.add("fill_level", 0);
+
+  // Schwartz preconditioner options
+  Parameters p_pc_schwarz("schwarz");
+  p_pc_schwarz.add("overlap", 1);
+
+  // Add sub-preconditioner options
+  p_pc.add(p_pc_ilu);
+  p_pc.add(p_pc_schwarz);
+
+  // Add preconditioner options
+  p.add(p_pc);
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+KrylovSolver::KrylovSolver(std::string method, std::string preconditioner)
+{
+  // Initialize solver
+  init(method, preconditioner);
+}
+//-----------------------------------------------------------------------------
+KrylovSolver::KrylovSolver(std::shared_ptr<const GenericLinearOperator> A,
+                           std::string method, std::string preconditioner)
+{
+  // Initialize solver
+  init(method, preconditioner);
+
+  // Set operator
+  set_operator(A);
+}
+//-----------------------------------------------------------------------------
+KrylovSolver::~KrylovSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void
+KrylovSolver::set_operator(std::shared_ptr<const GenericLinearOperator> A)
+{
+  dolfin_assert(solver);
+  solver->parameters.update(parameters);
+  solver->set_operator(A);
+}
+//-----------------------------------------------------------------------------
+void
+KrylovSolver::set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                            std::shared_ptr<const GenericLinearOperator> P)
+{
+  dolfin_assert(solver);
+  solver->parameters.update(parameters);
+  solver->set_operators(A, P);
+}
+//-----------------------------------------------------------------------------
+void KrylovSolver::set_nullspace(const VectorSpaceBasis& nullspace)
+{
+  solver->set_nullspace(nullspace);
+}
+//-----------------------------------------------------------------------------
+std::size_t KrylovSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  dolfin_assert(solver);
+  //check_dimensions(solver->get_operator(), x, b);
+
+  Timer timer("Krylov solver");
+  solver->parameters.update(parameters);
+  return solver->solve(x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t KrylovSolver::solve(const GenericLinearOperator& A,
+                                GenericVector& x,
+                                const GenericVector& b)
+{
+  dolfin_assert(solver);
+  //check_dimensions(A, x, b);
+
+  Timer timer("Krylov solver");
+  solver->parameters.update(parameters);
+  return solver->solve(A, x, b);
+}
+//-----------------------------------------------------------------------------
+void KrylovSolver::init(std::string method, std::string preconditioner)
+{
+  // Get default linear algebra factory
+  DefaultFactory factory;
+
+  // Get list of available methods and preconditioners
+  std::vector<std::pair<std::string, std::string> >
+    methods = factory.krylov_solver_methods();
+  std::vector<std::pair<std::string, std::string> >
+    preconditioners = factory.krylov_solver_preconditioners();
+
+  // Check that method is available
+  if (!LinearSolver::in_list(method, methods))
+  {
+    dolfin_error("KrylovSolver.cpp",
+                 "solve linear system using Krylov iteration",
+                 "Unknown Krylov method \"%s\". "
+                 "Use list_krylov_solver_methods() to list available Krylov methods",
+                 method.c_str());
+  }
+
+  // Check that preconditioner is available
+  if (!LinearSolver::in_list(preconditioner, preconditioners))
+  {
+    dolfin_error("KrylovSolver.cpp",
+                 "solve linear system using Krylov iteration",
+                 "Unknown preconditioner \"%s\". "
+                 "Use list_krylov_solver_preconditioners() to list available preconditioners()",
+                 preconditioner.c_str());
+  }
+
+  // Set default parameters
+  parameters = dolfin::parameters("krylov_solver");
+
+  // Initialize solver
+  solver = factory.create_krylov_solver(method, preconditioner);
+  solver->parameters.update(parameters);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/KrylovSolver.h b/dolfin/la/KrylovSolver.h
new file mode 100644
index 0000000..34c4b4f
--- /dev/null
+++ b/dolfin/la/KrylovSolver.h
@@ -0,0 +1,106 @@
+// Copyright (C) 2007-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug, 2008.
+// Modified by Anders Logg, 2008.
+//
+// First added:  2007-07-03
+// Last changed: 2014-05-27
+
+#ifndef __KRYLOV_SOLVER_H
+#define __KRYLOV_SOLVER_H
+
+#include <string>
+#include <vector>
+#include <memory>
+#include "GenericLinearSolver.h"
+
+namespace dolfin
+{
+
+  class GenericLinearOperator;
+  class GenericVector;
+  class VectorSpaceBasis;
+
+  /// This class defines an interface for a Krylov solver. The
+  /// approproiate solver is chosen on the basis of the matrix/vector
+  /// type.
+
+  class KrylovSolver : public GenericLinearSolver
+  {
+  public:
+
+    /// Constructor
+    KrylovSolver(std::string method="default",
+                 std::string preconditioner="default");
+
+    /// Constructor
+    KrylovSolver(std::shared_ptr<const GenericLinearOperator> A,
+                 std::string method="default",
+                 std::string preconditioner="default");
+
+    /// Destructor
+    ~KrylovSolver();
+
+    /// Set operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Set operator (matrix) and preconditioner matrix
+    void set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                       std::shared_ptr<const GenericLinearOperator> P);
+
+    /// Set null space of the operator (matrix). This is used to solve
+    /// singular systems
+    void set_nullspace(const VectorSpaceBasis& nullspace);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(const GenericLinearOperator& A,
+                      GenericVector& x, const GenericVector& b);
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+    /// Update solver parameters (pass parameters down to wrapped implementation)
+    virtual void update_parameters(const Parameters& parameters)
+    {
+      this->parameters.update(parameters);
+      solver->parameters.update(parameters);
+    }
+
+    // FIXME: This should not be needed. Need to cleanup linear solver
+    // name jungle: default, lu, iterative, direct, krylov, etc
+    /// Return parameter type: "krylov_solver" or "lu_solver"
+    std::string parameter_type() const
+    {
+      return "krylov_solver";
+    }
+
+  private:
+
+    // Initialize solver
+    void init(std::string method, std::string preconditioner);
+
+    // Solver
+    std::shared_ptr<GenericLinearSolver> solver;
+
+  };
+}
+
+#endif
diff --git a/dolfin/la/LUSolver.cpp b/dolfin/la/LUSolver.cpp
new file mode 100644
index 0000000..0e98e8b
--- /dev/null
+++ b/dolfin/la/LUSolver.cpp
@@ -0,0 +1,127 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011-2012
+//
+// First added:  2010-07-11
+// Last changed: 2012-08-20
+
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Timer.h>
+#include "DefaultFactory.h"
+#include "LinearSolver.h"
+#include "LUSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+LUSolver::LUSolver(std::string method)
+{
+  // Initialize solver
+  init(method);
+}
+//-----------------------------------------------------------------------------
+LUSolver::LUSolver(std::shared_ptr<const GenericLinearOperator> A,
+                   std::string method)
+{
+  // Initialize solver
+  init(method);
+
+  // Set operator
+  set_operator(A);
+}
+//-----------------------------------------------------------------------------
+LUSolver::~LUSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void
+LUSolver::set_operator(std::shared_ptr<const GenericLinearOperator> A)
+{
+  dolfin_assert(solver);
+  solver->parameters.update(parameters);
+  solver->set_operator(A);
+}
+//-----------------------------------------------------------------------------
+std::size_t LUSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  dolfin_assert(solver);
+
+  Timer timer("LU solver");
+  solver->parameters.update(parameters);
+  return solver->solve(x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t LUSolver::solve(const GenericLinearOperator& A, GenericVector& x,
+                             const GenericVector& b)
+{
+  dolfin_assert(solver);
+
+  Timer timer("LU solver");
+  solver->parameters.update(parameters);
+  return solver->solve(A, x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t LUSolver::solve_transpose(GenericVector& x, const GenericVector& b)
+{
+  dolfin_assert(solver);
+
+  Timer timer("LU solver");
+  solver->parameters.update(parameters);
+  return solver->solve_transpose(x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t LUSolver::solve_transpose(const GenericLinearOperator& A,
+                                      GenericVector& x,
+                                      const GenericVector& b)
+{
+  dolfin_assert(solver);
+
+  Timer timer("LU solver (transpose version)");
+  solver->parameters.update(parameters);
+  return solver->solve_transpose(A, x, b);
+}
+//-----------------------------------------------------------------------------
+void LUSolver::init(std::string method)
+{
+  // Get default linear algebra factory
+  DefaultFactory factory;
+
+  // Get list of available methods
+  std::vector<std::pair<std::string, std::string> >
+    methods = factory.lu_solver_methods();
+
+  // Check that method is available
+  if (!LinearSolver::in_list(method, methods))
+  {
+    dolfin_error("LUSolver.cpp",
+                 "solve linear system using LU factorization",
+                 "Unknown LU method \"%s\". "
+                 "Use list_lu_solver_methods() to list available LU methods",
+                 method.c_str());
+  }
+
+  // Set default parameters
+  parameters = dolfin::parameters("lu_solver");
+
+  // Initialize solver
+  solver = factory.create_lu_solver(method);
+  solver->parameters.update(parameters);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/LUSolver.h b/dolfin/la/LUSolver.h
new file mode 100644
index 0000000..3bdbb00
--- /dev/null
+++ b/dolfin/la/LUSolver.h
@@ -0,0 +1,111 @@
+// Copyright (C) 2007-2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2008
+// Modified by Dag Lindbo 2008
+// Modified by Anders Logg 2008-2012
+// Modified by Kent-Andre Mardal 2008
+//
+// First added:  2007-07-03
+// Last changed: 2014-05-27
+
+#ifndef __LU_SOLVER_H
+#define __LU_SOLVER_H
+
+#include <string>
+#include <memory>
+#include "GenericLUSolver.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericLinearOperator;
+  class GenericVector;
+
+  /// LU solver for the built-in LA backends.
+
+  class LUSolver : public GenericLUSolver
+  {
+  public:
+
+    /// Constructor
+    LUSolver(std::string method= "default");
+
+    /// Constructor
+    LUSolver(std::shared_ptr<const GenericLinearOperator> A,
+             std::string method="default");
+
+    /// Destructor
+    ~LUSolver();
+
+    /// Set operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system A^Tx = b
+    std::size_t solve_transpose(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system
+    std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                      const GenericVector& b);
+
+    /// Solve linear system
+    std::size_t solve_transpose(const GenericLinearOperator& A,
+                                GenericVector& x, const GenericVector& b);
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("lu_solver");
+      p.add("report", true);
+      p.add("verbose", false);
+      p.add("symmetric", false);
+      p.add("same_nonzero_pattern", false);
+      p.add("reuse_factorization", false);
+      return p;
+    }
+
+    /// Update solver parameters (pass parameters down to wrapped implementation)
+    virtual void update_parameters(const Parameters& parameters)
+    {
+      this->parameters.update(parameters);
+      solver->parameters.update(parameters);
+    }
+
+    // FIXME: This should not be needed. Need to cleanup linear solver
+    // name jungle: default, lu, iterative, direct, krylov, etc
+    /// Return parameter type: "krylov_solver" or "lu_solver"
+    std::string parameter_type() const
+    {
+      return "lu_solver";
+    }
+
+  private:
+
+    // Initialize solver
+    void init(std::string method);
+
+    // Solver
+    std::shared_ptr<GenericLinearSolver> solver;
+
+  };
+}
+
+#endif
diff --git a/dolfin/la/LinearAlgebraObject.h b/dolfin/la/LinearAlgebraObject.h
new file mode 100644
index 0000000..c804d04
--- /dev/null
+++ b/dolfin/la/LinearAlgebraObject.h
@@ -0,0 +1,192 @@
+// Copyright (C) 2007-2012 Anders Logg, Garth N. Wells, Ola Skavhaug,
+// Martin Alnæs
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-08-22
+// Last changed: 2012-08-24
+
+#ifndef __LINEAR_ALGEBRA_OBJECT_H
+#define __LINEAR_ALGEBRA_OBJECT_H
+
+#include <memory>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  /// This is a common base class for all DOLFIN linear algebra
+  /// objects. In particular, it provides casting mechanisms between
+  /// different types.
+
+  class LinearAlgebraObject : public virtual Variable
+  {
+  public:
+
+    /// Cast object to its derived class, if possible (const version).
+    /// An error is thrown if the cast is unsuccessful.
+    template<typename T> const T& down_cast() const
+    {
+      try
+      {
+        return dynamic_cast<const T&>(*instance());
+      }
+      catch (std::exception& e)
+      {
+        dolfin_error("LinearAlgebraObject.h",
+                     "down-cast linear algebra object to requested type",
+                     "%s", e.what());
+      }
+
+      // Return something to keep the compiler happy, code will not be
+      // reached
+      return dynamic_cast<const T&>(*instance());
+    }
+
+    /// Cast object to its derived class, if possible (non-const version).
+    /// An error is thrown if the cast is unsuccessful.
+    template<typename T> T& down_cast()
+    {
+      try
+      {
+        return dynamic_cast<T&>(*instance());
+      }
+      catch (std::exception& e)
+      {
+        dolfin_error("LinearAlgebraObject.h",
+                     "down-cast linear algebra object to requested type",
+                     "%s", e.what());
+      }
+
+      // Return something to keep the compiler happy, code will not be reached
+      return dynamic_cast<T&>(*instance());
+    }
+
+    /// Cast shared pointer object to its derived class, if possible.
+    /// Caller must check for success (returns null if cast fails).
+    template<typename X, typename Y>
+    static std::shared_ptr<X> down_cast(std::shared_ptr<Y> A)
+    {
+      // Try to down cast shared pointer
+      std::shared_ptr<X> _matA = std::dynamic_pointer_cast<X>(A);
+
+      // If down cast fails, try to get shared ptr instance to
+      // unwrapped object
+      if (!_matA)
+      {
+        // Try to get instance to unwrapped object and cast
+        if (A->shared_instance())
+          _matA = std::dynamic_pointer_cast<X>(A->shared_instance());
+      }
+      return _matA;
+    }
+
+    /// Return concrete instance / unwrap (const version)
+    virtual const LinearAlgebraObject* instance() const
+    { return this; }
+
+    /// Return concrete instance / unwrap (non-const version)
+    virtual LinearAlgebraObject* instance()
+    { return this; }
+
+    /// Return concrete shared ptr instance / unwrap (const version)
+    virtual std::shared_ptr<const LinearAlgebraObject> shared_instance() const
+    { return std::shared_ptr<const LinearAlgebraObject>(); }
+
+    /// Return concrete shared ptr instance / unwrap (non-const version)
+    virtual std::shared_ptr<LinearAlgebraObject> shared_instance()
+    { return std::shared_ptr<LinearAlgebraObject>(); }
+
+  };
+
+  /// Cast object to its derived class, if possible (non-const version).
+  /// An error is thrown if the cast is unsuccessful.
+  template<typename Y, typename X>
+  Y& as_type(X& x)
+  {
+    try
+    {
+      return dynamic_cast<Y&>(*x.instance());
+    }
+    catch (std::exception& e)
+    {
+      dolfin_error("LinearAlgebraObject.h",
+                   "down-cast linear algebra object to requested type",
+                   "%s", e.what());
+    }
+
+    // Return something to keep the compiler happy, code will not be reached
+    return dynamic_cast<Y&>(*x.instance());
+  }
+
+  // This function has been copied from Boost 1.53.0
+  // (boost/smart_ptr/shared_ptr.hpp) and modified. It has been modified
+  // because the line
+  //
+  //     (void) dynamic_cast< T* >( static_cast< U* >( 0 ) );
+  //
+  // breaks with the Intel C++ compiler (icpc 13.0.1 20121010). This
+  // modified function should only be called when using the Intel compiler
+  // and compiler and Boost updates should be tested.
+  #if defined __INTEL_COMPILER
+  template<class T, class U>
+  std::shared_ptr<T>
+    dolfin_dynamic_pointer_cast(std::shared_ptr<U> const & r )
+  {
+      // Below give error with icpc 13.0.1 20121010
+      //(void) dynamic_cast< T* >( static_cast< U* >( 0 ) );
+      typedef typename std::shared_ptr<T>::element_type E;
+      E * p = dynamic_cast< E* >( r.get() );
+      return p? std::shared_ptr<T>( r, p ): std::shared_ptr<T>();
+  }
+  #endif
+
+  /// Cast shared pointer object to its derived class, if possible.
+  /// Caller must check for success (returns null if cast fails).
+  template<typename Y, typename X>
+  std::shared_ptr<Y> as_type(std::shared_ptr<X> x)
+  {
+    // Try to down cast shared pointer
+    std::shared_ptr<Y> y = std::dynamic_pointer_cast<Y>(x);
+
+    // If down cast fails, try to get shared ptr instance to unwrapped object
+    if (!y)
+    {
+      // Try to get instance to unwrapped object and cast
+      if (x->shared_instance())
+      {
+        // Called modified function if using Intel compiler. See comments
+        // on above function.
+        #if defined __INTEL_COMPILER
+        y = dolfin_dynamic_pointer_cast<Y>(x->shared_instance());
+        #else
+        y = std::dynamic_pointer_cast<Y>(x->shared_instance());
+        #endif
+      }
+    }
+    return y;
+  }
+
+  /// Check whether the object matches a specific type
+  template<typename Y, typename X>
+  bool has_type(const X& x)
+  {
+    return bool(dynamic_cast<const Y*>(x.instance()));
+  }
+
+}
+
+#endif
diff --git a/dolfin/la/LinearOperator.cpp b/dolfin/la/LinearOperator.cpp
new file mode 100644
index 0000000..1a15308
--- /dev/null
+++ b/dolfin/la/LinearOperator.cpp
@@ -0,0 +1,71 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-08-20
+// Last changed: 2012-12-12
+
+#include "DefaultFactory.h"
+#include "LinearOperator.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+LinearOperator::LinearOperator(const GenericVector& x,
+                               const GenericVector& y)
+{
+  // Create concrete implementation
+  DefaultFactory factory;
+  _matA = factory.create_linear_operator();
+  dolfin_assert(_matA);
+
+  // Initialize implementation
+  _matA->init_layout(x, y, this);
+}
+//-----------------------------------------------------------------------------
+LinearOperator::LinearOperator()
+{
+  // Initialization is postponed until the backend is accessed to
+  // enable accessing the member function size() to extract the size.
+  // The size would otherwise need to be passed to the constructor of
+  // LinearOperator which is often unpractical for subclasses.
+}
+//-----------------------------------------------------------------------------
+std::string LinearOperator::str(bool verbose) const
+{
+  return "<User-defined linear operator>";
+}
+//-----------------------------------------------------------------------------
+const GenericLinearOperator* LinearOperator::instance() const
+{
+  return _matA.get();
+}
+//-----------------------------------------------------------------------------
+GenericLinearOperator* LinearOperator::instance()
+{
+  return _matA.get();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const LinearAlgebraObject> LinearOperator::shared_instance() const
+{
+  return _matA;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<LinearAlgebraObject> LinearOperator::shared_instance()
+{
+  return _matA;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/LinearOperator.h b/dolfin/la/LinearOperator.h
new file mode 100644
index 0000000..68904aa
--- /dev/null
+++ b/dolfin/la/LinearOperator.h
@@ -0,0 +1,85 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+// // You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-08-20
+// Last changed: 2012-12-12
+
+#ifndef __LINEAR_OPERATOR_H
+#define __LINEAR_OPERATOR_H
+
+#include <memory>
+#include "GenericLinearOperator.h"
+
+namespace dolfin
+{
+
+  /// This class defines an interface for linear operators defined
+  /// only in terms of their action (matrix-vector product) and can be
+  /// used for matrix-free solution of linear systems. The linear
+  /// algebra backend is decided at run-time based on the present
+  /// value of the "linear_algebra_backend" parameter.
+  ///
+  /// To define a linear operator, users need to inherit from this
+  /// class and overload the function mult(x, y) which defines the
+  /// action of the matrix on the vector x as y = Ax.
+
+  class LinearOperator : public GenericLinearOperator
+  {
+  public:
+
+    // Create linear operator to match parallel layout of vectors
+    // x and y for product y = Ax.
+    LinearOperator(const GenericVector& x, const GenericVector& y);
+
+    /// Create linear operator
+    LinearOperator();
+
+    /// Destructor
+    virtual ~LinearOperator() {}
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const = 0;
+
+    /// Compute matrix-vector product y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const = 0;
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    //--- Special functions, intended for library use only ---
+
+    /// Return concrete instance / unwrap (const version)
+    virtual const GenericLinearOperator* instance() const;
+
+    /// Return concrete instance / unwrap (non-const version)
+    virtual GenericLinearOperator* instance();
+
+    /// Return concrete instance / unwrap (const shared pointer version)
+    virtual std::shared_ptr<const LinearAlgebraObject> shared_instance() const;
+
+    /// Return concrete instance / unwrap (shared pointer version)
+    virtual std::shared_ptr<LinearAlgebraObject> shared_instance();
+
+  private:
+
+    // Pointer to concrete implementation
+    std::shared_ptr<GenericLinearOperator> _matA;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/LinearSolver.cpp b/dolfin/la/LinearSolver.cpp
new file mode 100644
index 0000000..84895d3
--- /dev/null
+++ b/dolfin/la/LinearSolver.cpp
@@ -0,0 +1,172 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hake, 2010.
+// Modified by Garth N. Wells, 2010.
+//
+// First added:  2008-05-10
+// Last changed: 2013-12-04
+
+#include "DefaultFactory.h"
+#include "KrylovSolver.h"
+#include "LUSolver.h"
+#include "CholmodCholeskySolver.h"
+#include "LinearSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+LinearSolver::LinearSolver(std::string method,
+                           std::string preconditioner)
+{
+  // Get default linear algebra factory
+  DefaultFactory factory;
+
+  // Get list of available methods
+  std::vector<std::pair<std::string, std::string> >
+    lu_methods = factory.lu_solver_methods();
+  std::vector<std::pair<std::string, std::string> >
+    krylov_methods = factory.krylov_solver_methods();
+
+  // Handle some default and generic solver options
+  if (method == "default")
+    method = "lu";
+  else if (method == "direct")
+    method = "lu";
+  else if (method == "iterative")
+    method = "gmres";
+
+  // Choose solver
+  if (method == "lu" || in_list(method, lu_methods))
+  {
+    // Adjust preconditioner default --> none
+    if (preconditioner == "default")
+      preconditioner = "none";
+
+    // Check that preconditioner has not been set
+    if (preconditioner != "none")
+    {
+      dolfin_error("LinearSolver.cpp",
+                   "solve linear system",
+                   "Preconditioner may not be specified for LU solver");
+    }
+
+    // Use default LU method if "lu" is specified
+    if (method == "lu")
+      method = "default";
+
+    // Initialize solver
+    solver.reset(new LUSolver(method));
+
+    // Set parameter type
+    _parameter_type = "lu_solver";
+  }
+  else if (method == "cholesky")
+  {
+    // Adjust preconditioner default --> none
+    if (preconditioner == "default")
+      preconditioner = "none";
+
+    // Check that preconditioner has not been set
+    if (preconditioner != "none")
+    {
+      dolfin_error("LinearSolver.cpp",
+                   "solve linear system",
+                   "Preconditioner may not be specified for Cholesky solver");
+    }
+
+    // Initialize solver
+    solver.reset(new CholmodCholeskySolver());
+
+    // Set parameter type
+    _parameter_type = "lu_solver";
+  }
+  else if (in_list(method, krylov_methods))
+  {
+    // Method and preconditioner will be checked by KrylovSolver
+
+    // Initialize solver
+    solver.reset(new KrylovSolver(method, preconditioner));
+
+    // Set parameter type
+    _parameter_type = "krylov_solver";
+  }
+  else
+  {
+    dolfin_error("LinearSolver.cpp",
+                 "solve linear system",
+                 "Unknown solver method \"%s\". "
+                 "Use list_linear_solver_methods() to list available methods",
+                 method.c_str());
+  }
+
+  // Get parameters
+  parameters = solver->parameters;
+
+  // Rename the parameters
+  parameters.rename("linear_solver");
+}
+//-----------------------------------------------------------------------------
+LinearSolver::~LinearSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void
+LinearSolver::set_operator(std::shared_ptr<const GenericLinearOperator> A)
+{
+  dolfin_assert(solver);
+  solver->parameters.update(parameters);
+  solver->set_operator(A);
+}
+//-----------------------------------------------------------------------------
+void
+LinearSolver::set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                            std::shared_ptr<const GenericLinearOperator> P)
+{
+  dolfin_assert(solver);
+  solver->parameters.update(parameters);
+  solver->set_operators(A, P);
+}
+//-----------------------------------------------------------------------------
+std::size_t LinearSolver::solve(const GenericLinearOperator& A,
+                                 GenericVector& x,
+                                 const GenericVector& b)
+{
+  dolfin_assert(solver);
+  solver->parameters.update(parameters);
+  return solver->solve(A, x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t LinearSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  dolfin_assert(solver);
+  solver->parameters.update(parameters);
+  return solver->solve(x, b);
+}
+//-----------------------------------------------------------------------------
+bool
+LinearSolver::in_list(const std::string& method,
+                      const std::vector<std::pair<std::string, std::string> > methods)
+{
+  for (std::size_t i = 0; i < methods.size(); i++)
+    if (method == methods[i].first)
+      return true;
+
+  return false;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/LinearSolver.h b/dolfin/la/LinearSolver.h
new file mode 100644
index 0000000..b957440
--- /dev/null
+++ b/dolfin/la/LinearSolver.h
@@ -0,0 +1,115 @@
+// Copyright (C) 2004-2013 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2006-2010.
+// Modified by Ola Skavhaug 2008.
+//
+// First added:  2004-06-19
+// Last changed: 2014-05-27
+
+#ifndef __LINEAR_SOLVER_H
+#define __LINEAR_SOLVER_H
+
+#include <memory>
+#include <string>
+#include <memory>
+#include <dolfin/common/types.h>
+#include "GenericLinearSolver.h"
+
+namespace dolfin
+{
+
+  class GenericLinearOperator;
+  class GenericVector;
+  class LUSolver;
+  class KrylovSolver;
+  class LinearVariationalSolver;
+
+  /// This class provides a general solver for linear systems Ax = b.
+
+  class LinearSolver : public GenericLinearSolver
+  {
+  public:
+
+    /// Create linear solver
+    LinearSolver(std::string method = "default",
+                 std::string preconditioner = "default");
+
+    /// Destructor
+    ~LinearSolver();
+
+    /// Set the operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Set the operator (matrix) and preconitioner matrix
+    void set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                       std::shared_ptr<const GenericLinearOperator> P);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(const GenericLinearOperator& A,
+               GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("linear_solver");
+      return p;
+    }
+
+    /// Update solver parameters (pass parameters down to wrapped implementation)
+    virtual void update_parameters(const Parameters& parameters)
+    {
+      this->parameters.update(parameters);
+      solver->update_parameters(parameters);
+    }
+
+    // FIXME: This should not be needed. Need to cleanup linear solver
+    // name jungle: default, lu, iterative, direct, krylov, etc
+    /// Return parameter type: "krylov_solver" or "lu_solver"
+    std::string parameter_type() const
+    {
+      return _parameter_type;
+    }
+
+  private:
+
+    // Friends
+    friend class LUSolver;
+    friend class KrylovSolver;
+    friend class LinearVariationalSolver;
+    friend class NewtonSolver;
+
+    // Check whether string is contained in list
+    static bool
+    in_list(const std::string& method,
+            const std::vector<std::pair<std::string, std::string> > methods);
+
+    // Solver
+    std::unique_ptr<GenericLinearSolver> solver;
+
+    // FIXME: This should not be needed
+    // Parameter type
+    std::string _parameter_type;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/MUMPSLUSolver.cpp b/dolfin/la/MUMPSLUSolver.cpp
new file mode 100644
index 0000000..e7d60e4
--- /dev/null
+++ b/dolfin/la/MUMPSLUSolver.cpp
@@ -0,0 +1,199 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-10-16
+// Last changed:
+
+
+#include <vector>
+
+#include "dolfin/common/NoDeleter.h"
+#include "dolfin/common/MPI.h"
+#include "dolfin/log/log.h"
+#include "CoordinateMatrix.h"
+#include "GenericVector.h"
+#include "LUSolver.h"
+#include "MUMPSLUSolver.h"
+
+#ifdef PETSC_HAVE_MUMPS
+
+using namespace dolfin;
+
+// Macros to match MUMPS documentation (C/Fortran indexing issue)
+#define ICNTL(I) icntl[(I)-1]
+#define CNTL(I) cntl[(I)-1]
+#define INFOG(I) infog[(I)-1]
+#define INFO(I) info[(I)-1]
+#define RINFOG(I) rinfog[(I)-1]
+#define RINFO(I) rinfo[(I)-1]
+
+//-----------------------------------------------------------------------------
+Parameters MUMPSLUSolver::default_parameters()
+{
+  Parameters p(LUSolver::default_parameters());
+  p.rename("mumps_lu_solver");
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+MUMPSLUSolver::MUMPSLUSolver(const CoordinateMatrix& A)
+  : _matA(reference_to_no_delete_pointer(A))
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+MUMPSLUSolver::MUMPSLUSolver(std::shared_ptr<const CoordinateMatrix> A)
+  : _matA(A)
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+MUMPSLUSolver::~MUMPSLUSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t MUMPSLUSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  assert(_matA);
+
+  DMUMPS_STRUC_C data;
+
+  data.comm_fortran = -987654;
+
+  // Initialise
+  data.job = -1;
+
+  // Host participates in solve
+  data.par = 1;
+
+  // Output related paramters
+  //data.ICNTL(1) = 6; // error messages
+  //data.ICNTL(2) = 0;
+  //data.ICNTL(3) = 6; // Global information
+  //data.ICNTL(3) = 6; // Global information
+  if (parameters["verbose"])
+    data.ICNTL(4) = 2;
+  else
+    data.ICNTL(4) = 1;
+
+  // Matrix symmetry (0=non-symmetric, 2=symmetric postitve defn, 2=symmetric)
+  data.sym = 0;
+  if (parameters["symmetric"])
+    data.sym = 2;
+
+  // Initialise MUMPS
+  dmumps_c(&data);
+
+  // Related to use of ScaLAPACK (+/-. Negative is faster?)
+  //data.ICNTL(13) = -1;
+
+  // Solve transpose (1: A x = b, otherwise A^T x = b)
+  data.ICNTL(9) = 1;
+
+  // FIXME (20=default)
+  data.ICNTL(14) = 20;
+
+  // Reordering (7=automatic)
+  data.ICNTL(7) = 7;
+
+  // Control solution vector (0=solution on root, 1=solution distributed)
+  data.ICNTL(21) = 1;
+
+  // Distributed matrix
+  data.ICNTL(18) = 3;
+
+  // Parallel/serial analysis (0=auto, 1=serial, 2=parallel)
+  if (MPI::size(_matA->mpi_comm()) > 1)
+    data.ICNTL(28) = 2;
+  else
+    data.ICNTL(28) = 0;
+
+  // Parallel graph partitioning library (0=auto, 1=pt-scotch, 2=parmetis)
+  data.ICNTL(29) = 0;
+
+  // Global size
+  assert(_matA->size(0) == _matA->size(1));
+  data.n = _matA->size(0);
+
+  if (!_matA->base_one())
+    error("MUMPS requires a CoordinateMatrix with Fortran-style base 1 indexing.");
+
+  // Get matrix coordindate and value data
+  const std::vector<std::size_t>& rows = _matA->rows();
+  const std::vector<std::size_t>& cols = _matA->columns();
+  const std::vector<double>& vals = _matA->values();
+
+  // Number of non-zero entries on this process
+  data.nz_loc = rows.size();
+
+  // Pass matrix data to MUMPS. Trust MUMPS not to change it
+  data.irn_loc = const_cast<int*>(reinterpret_cast<const int*>(rows.data()));
+  data.jcn_loc = const_cast<int*>(reinterpret_cast<const int*>(cols.data()));
+  data.a_loc   = const_cast<double*>(&vals[0]);
+
+  // Analyse and factorize
+  data.job = 4;
+  dmumps_c(&data);
+  if (data.INFOG(1) < 0)
+    error("MUMPS reported an error during the analysis and factorisation.");
+
+  cout << "Factorisation finished" << endl;
+
+  // Gather RHS on root process and attach
+  std::vector<double> _b;
+  b.gather_on_zero(_b);
+  data.rhs = &_b[0];
+
+  // Scaling strategy (77 is default)
+  data.ICNTL(8) = 77;
+
+  // Get size of local solution vector x and create objects to hold solution
+  const std::size_t local_x_size = data.INFO(23);
+  std::vector<int> x_local_indices(local_x_size);
+  std::vector<double> x_local_vals(local_x_size);
+
+  // Attach solution data to MUMPS object
+  data.lsol_loc = local_x_size;
+  data.sol_loc  = x_local_vals.data();
+  data.isol_loc = x_local_indices.data();
+
+  // Solve problem
+  data.job = 3;
+  dmumps_c(&data);
+  if (data.INFOG(1) < 0)
+    error("MUMPS reported an error during the solve.");
+
+  // Shift indices by -1
+  for (std::size_t i = 0; i < local_x_size ; ++i)
+    x_local_indices[i]--;
+
+  // Set x values
+  x.set(x_local_vals.data(), x_local_indices.size(),
+        x_local_indices.data());
+  x.apply("insert");
+
+  // Clean up
+  data.job = -2;
+  dmumps_c(&data);
+
+  return 1;
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/la/MUMPSLUSolver.h b/dolfin/la/MUMPSLUSolver.h
new file mode 100644
index 0000000..b12de2d
--- /dev/null
+++ b/dolfin/la/MUMPSLUSolver.h
@@ -0,0 +1,80 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2009-2010.
+//
+// First added:  2011-10-16
+// Last changed:
+
+#ifndef __DOLFIN_MUMPS_LU_SOLVER_H
+#define __DOLFIN_MUMPS_LU_SOLVER_H
+
+#include <memory>
+#include <dolfin/common/Variable.h>
+
+#ifdef HAS_PETSC
+#include <petscconf.h>
+#endif
+
+#ifdef PETSC_HAVE_MUMPS
+
+extern "C"
+{
+#include "dmumps_c.h"
+}
+
+namespace dolfin
+{
+  /// Forward declarations
+  class CoordinateMatrix;
+  class GenericVector;
+
+  /// This class implements the direct solution (LU factorization) for
+  /// linear systems of the form Ax = b. It is a wrapper for the MUMPS
+  /// LU solver.
+
+  class MUMPSLUSolver : public Variable
+  {
+  public:
+
+    /// Constructor
+    MUMPSLUSolver(const CoordinateMatrix& A);
+
+    /// Constructor
+    MUMPSLUSolver(std::shared_ptr<const CoordinateMatrix> A);
+
+    /// Destructor
+    ~MUMPSLUSolver();
+
+    /// Solve linear system Ax = b
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+  private:
+
+    // Operator (the matrix)
+    std::shared_ptr<const CoordinateMatrix> _matA;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/Matrix.h b/dolfin/la/Matrix.h
new file mode 100644
index 0000000..308cccf
--- /dev/null
+++ b/dolfin/la/Matrix.h
@@ -0,0 +1,229 @@
+// Copyright (C) 2006-2008 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug, 2007-2008.
+// Modified by Kent-Andre Mardal, 2008.
+// Modified by Martin Sandve Alnes, 2008.
+//
+// First added:  2006-05-15
+// Last changed: 2009-09-08
+
+#ifndef __MATRIX_H
+#define __MATRIX_H
+
+#include <boost/tuple/tuple.hpp>
+#include <memory>
+#include "DefaultFactory.h"
+#include "GenericMatrix.h"
+
+namespace dolfin
+{
+
+  class GenericVector;
+  class TensorLayout;
+
+  /// This class provides the default DOLFIN matrix class,
+  /// based on the default DOLFIN linear algebra backend.
+
+  class Matrix : public GenericMatrix
+  {
+  public:
+
+    /// Create empty matrix
+    Matrix()
+    {
+      DefaultFactory factory;
+      matrix = factory.create_matrix();
+    }
+
+    /// Copy constructor
+    Matrix(const Matrix& A) : matrix(A.matrix->copy()) {}
+
+    /// Create a Vector from a GenericVetor
+    Matrix(const GenericMatrix& A) : matrix(A.copy()) {}
+
+    /// Destructor
+    virtual ~Matrix() {}
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Initialize zero tensor using tensor layout
+    virtual void init(const TensorLayout& tensor_layout)
+    { matrix->init(tensor_layout); }
+
+    /// Return true if matrix is empty
+    virtual bool empty() const
+    { return matrix->empty(); }
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const
+    { return matrix->size(dim); }
+
+    /// Return local ownership range
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const
+    { return matrix->local_range(dim); }
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero()
+    { matrix->zero(); }
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode)
+    { matrix->apply(mode); }
+
+    /// Return MPI communicator
+    MPI_Comm mpi_comm() const
+    { return matrix->mpi_comm(); }
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const
+    { return "<Matrix wrapper of " + matrix->str(verbose) + ">"; }
+
+    //--- Implementation of the GenericMatrix interface ---
+
+    /// Return copy of matrix
+    virtual std::shared_ptr<GenericMatrix> copy() const
+    {
+      std::shared_ptr<Matrix> A(new Matrix(*this));
+      return A;
+    }
+
+    /// Resize vector y such that is it compatible with matrix for
+    /// multuplication Ax = b (dim = 0 -> b, dim = 1 -> x) In parallel
+    /// case, size and layout are important.
+    virtual void init_vector(GenericVector& y, std::size_t dim) const
+    { matrix->init_vector(y, dim); }
+
+    /// Get block of values
+    virtual void get(double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols) const
+    { matrix->get(block, m, rows, n, cols); }
+
+    /// Set block of values
+    virtual void set(const double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols)
+    { matrix->set(block, m, rows, n, cols); }
+
+    /// Add block of values
+    virtual void add(const double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols)
+    { matrix->add(block, m, rows, n, cols); }
+
+    /// Add multiple of given matrix (AXPY operation)
+    virtual void axpy(double a, const GenericMatrix& A,
+                      bool same_nonzero_pattern)
+    { matrix->axpy(a, A, same_nonzero_pattern); }
+
+    /// Return norm of matrix
+    virtual double norm(std::string norm_type) const
+    { return matrix->norm(norm_type); }
+
+    /// Get non-zero values of given row
+    virtual void getrow(std::size_t row, std::vector<std::size_t>& columns,
+                        std::vector<double>& values) const
+    { matrix->getrow(row, columns, values); }
+
+    /// Set values for given row
+    virtual void setrow(std::size_t row,
+                        const std::vector<std::size_t>& columns,
+                        const std::vector<double>& values)
+    { matrix->setrow(row, columns, values); }
+
+    /// Set given rows to zero
+    virtual void zero(std::size_t m, const dolfin::la_index* rows)
+    { matrix->zero(m, rows); }
+
+    /// Set given rows to identity matrix
+    virtual void ident(std::size_t m, const dolfin::la_index* rows)
+    { matrix->ident(m, rows); }
+
+    // Matrix-vector product, y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const
+    { matrix->mult(x, y); }
+
+    // Matrix-vector product, y = Ax
+    virtual void transpmult(const GenericVector& x, GenericVector& y) const
+    { matrix->transpmult(x, y); }
+
+    /// Set diagonal of a matrix
+    virtual void set_diagonal(const GenericVector& x)
+    { matrix->set_diagonal(x); }
+
+    /// Multiply matrix by given number
+    virtual const Matrix& operator*= (double a)
+    { *matrix *= a; return *this; }
+
+    /// Divide matrix by given number
+    virtual const Matrix& operator/= (double a)
+    { *matrix /= a; return *this; }
+
+    /// Assignment operator
+    virtual const GenericMatrix& operator= (const GenericMatrix& A)
+    { *matrix = A; return *this; }
+
+    /// Test if matrix is symmetric
+    virtual bool is_symmetric(double tol) const
+    { return matrix->is_symmetric(tol); }
+
+    /// Return pointers to underlying compressed storage data.
+    /// See GenericMatrix for documentation.
+    virtual boost::tuples::tuple<const std::size_t*, const std::size_t*,
+      const double*, int> data() const
+    { return matrix->data(); }
+
+    //--- Special functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const
+    { return matrix->factory(); }
+
+    //--- Special functions, intended for library use only ---
+
+    /// Return concrete instance / unwrap (const version)
+    virtual const GenericMatrix* instance() const
+    { return matrix.get() ; }
+
+    /// Return concrete instance / unwrap (non-const version)
+    virtual GenericMatrix* instance()
+    { return matrix.get(); }
+
+    virtual std::shared_ptr<const LinearAlgebraObject> shared_instance() const
+    { return matrix; }
+
+    virtual std::shared_ptr<LinearAlgebraObject> shared_instance()
+    { return matrix; }
+
+    //--- Special Matrix functions ---
+
+    /// Assignment operator
+    const Matrix& operator= (const Matrix& A)
+    { *matrix = *A.matrix; return *this; }
+
+  private:
+
+    // Pointer to concrete implementation
+    std::shared_ptr<GenericMatrix> matrix;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/PETScBaseMatrix.cpp b/dolfin/la/PETScBaseMatrix.cpp
new file mode 100644
index 0000000..f28efa6
--- /dev/null
+++ b/dolfin/la/PETScBaseMatrix.cpp
@@ -0,0 +1,131 @@
+// Copyright (C) 2011-2012 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-02-11
+// Last changed: 2012-08-22
+
+#ifdef HAS_PETSC
+
+#include <dolfin/log/dolfin_log.h>
+#include "GenericVector.h"
+#include "PETScVector.h"
+#include "PETScBaseMatrix.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+PETScBaseMatrix::PETScBaseMatrix(Mat A) : _matA(A)
+{
+  // Increase reference count
+  if (_matA)
+    PetscObjectReference((PetscObject)_matA);
+}
+//-----------------------------------------------------------------------------
+PETScBaseMatrix::~PETScBaseMatrix()
+{
+  // Decrease reference count (PETSc will destroy object once
+  // reference counts reached zero)
+  if (_matA)
+    MatDestroy(&_matA);
+}
+//-----------------------------------------------------------------------------
+PETScBaseMatrix::PETScBaseMatrix(const PETScBaseMatrix& A)
+{
+  dolfin_error("PETScBaseMatrix.cpp",
+               "copy constructor",
+               "PETScBaseMatrix does not provide a copy constructor");
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScBaseMatrix::size(std::size_t dim) const
+{
+  if (dim > 1)
+  {
+    dolfin_error("PETScBaseMatrix.cpp",
+                 "access size of PETSc matrix",
+                 "Illegal axis (%d), must be 0 or 1", dim);
+  }
+
+  if (_matA)
+  {
+    PetscInt m(0), n(0);
+    PetscErrorCode ierr = MatGetSize(_matA, &m, &n);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MetGetSize");
+    if (dim == 0)
+      return m;
+    else
+      return n;
+  }
+  else
+    return 0;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+PETScBaseMatrix::local_range(std::size_t dim) const
+{
+  dolfin_assert(dim <= 1);
+  if (dim == 1)
+  {
+    dolfin_error("PETScBaseMatrix.cpp",
+                 "access local column range for PETSc matrix",
+                 "Only local row range is available for PETSc matrices");
+  }
+
+  if (_matA)
+  {
+    PetscInt m(0), n(0);
+    PetscErrorCode ierr = MatGetOwnershipRange(_matA, &m, &n);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatGetOwnershipRange");
+    return std::make_pair(m, n);
+  }
+  else
+    return std::make_pair(0, 0);
+}
+//-----------------------------------------------------------------------------
+void PETScBaseMatrix::init_vector(GenericVector& z, std::size_t dim) const
+{
+  dolfin_assert(_matA);
+
+  PetscErrorCode ierr;
+
+  // Downcast vector
+  PETScVector& _z = as_type<PETScVector>(z);
+
+  // Create new PETSc vector
+  Vec x = NULL;
+  if (dim == 0)
+  {
+    ierr = MatGetVecs(_matA, PETSC_NULL, &x);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatGetVecs");
+  }
+  else if (dim == 1)
+  {
+    ierr = MatGetVecs(_matA, &x, PETSC_NULL);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatGetVecs");
+  }
+  else
+  {
+    dolfin_error("PETScBaseMatrix.cpp",
+                 "intialize PETSc vector to match PETSc matrix",
+                 "Dimension must be 0 or 1, not %d", dim);
+  }
+
+  // Associate new PETSc vector with _z
+  _z._x = x;
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/PETScBaseMatrix.h b/dolfin/la/PETScBaseMatrix.h
new file mode 100644
index 0000000..d996843
--- /dev/null
+++ b/dolfin/la/PETScBaseMatrix.h
@@ -0,0 +1,94 @@
+// Copyright (C) 2005-2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Fredrik Valdmanis, 2011
+//
+// First added:  2005-01-17
+// Last changed: 2011-09-07
+
+#ifndef __PETSC_BASE_MATRIX_H
+#define __PETSC_BASE_MATRIX_H
+
+#ifdef HAS_PETSC
+
+#include <string>
+#include <utility>
+#include <memory>
+#include <petscmat.h>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/Variable.h>
+#include "PETScObject.h"
+
+namespace dolfin
+{
+
+  class GenericVector;
+
+  /// This class is a base class for matrices that can be used in
+  /// PETScKrylovSolver.
+
+  class PETScBaseMatrix : public PETScObject, public virtual Variable
+  {
+  public:
+
+    /// Constructor
+    PETScBaseMatrix() : _matA(NULL) {}
+
+    /// Constructor
+    explicit PETScBaseMatrix(Mat A);
+
+    /// Copy constructor
+    PETScBaseMatrix(const PETScBaseMatrix& A);
+
+    /// Destructor
+    ~PETScBaseMatrix();
+
+    /// Return number of rows (dim = 0) or columns (dim = 1)
+    std::size_t size(std::size_t dim) const;
+
+    /// Return local range along dimension dim
+    std::pair<std::size_t, std::size_t> local_range(std::size_t dim) const;
+
+    /// Initialize vector to be compatible with the matrix-vector product
+    /// y = Ax. In the parallel case, both size and layout are
+    /// important.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+    void init_vector(GenericVector& z, std::size_t dim) const;
+
+    /// Return PETSc Mat pointer
+    Mat mat() const
+    { return _matA; }
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const = 0;
+
+  protected:
+
+    // PETSc Mat pointer
+    Mat _matA;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScCuspFactory.cpp b/dolfin/la/PETScCuspFactory.cpp
new file mode 100644
index 0000000..0cefb14
--- /dev/null
+++ b/dolfin/la/PETScCuspFactory.cpp
@@ -0,0 +1,106 @@
+// Copyright (C) 2011 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-09-13
+// Last changed: 2012-08-24
+
+#ifdef HAS_PETSC_CUSP
+
+#include "SparsityPattern.h"
+#include "PETScLUSolver.h"
+#include "PETScMatrix.h"
+#include "PETScVector.h"
+#include "PETScLinearOperator.h"
+#include "PETScCuspFactory.h"
+
+using namespace dolfin;
+
+// Singleton instance
+PETScCuspFactory PETScCuspFactory::factory;
+
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericMatrix> PETScCuspFactory::create_matrix() const
+{
+  std::shared_ptr<GenericMatrix> A(new PETScMatrix(true));
+  return A;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> PETScCuspFactory:: create_vector() const
+{
+  std::shared_ptr<GenericVector> x(new PETScVector(true));
+  return x;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> PETScCuspFactory:: create_local_vector() const
+{
+  std::shared_ptr<GenericVector> x(new PETScVector(true));
+  return x;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<TensorLayout>
+PETScCuspFactory::create_layout(std::size_t rank) const
+{
+  bool sparsity = false;
+  if (rank > 1)
+    sparsity = true;
+  std::shared_ptr<TensorLayout> pattern(new TensorLayout(0, sparsity));
+  return pattern;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLinearOperator>
+PETScCuspFactory::create_linear_operator() const
+{
+  std::shared_ptr<GenericLinearOperator> A(new PETScLinearOperator);
+  return A;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLUSolver>
+PETScCuspFactory::create_lu_solver(std::string method) const
+{
+  std::shared_ptr<GenericLUSolver> solver(new PETScLUSolver(method));
+  return solver;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLinearSolver>
+PETScCuspFactory::create_krylov_solver(std::string method,
+                                       std::string preconditioner) const
+{
+  std::shared_ptr<GenericLinearSolver>
+    solver(new PETScKrylovSolver(method, preconditioner));
+  return solver;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+  PETScCuspFactory::lu_solver_methods() const
+{
+  return PETScLUSolver::methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+  PETScCuspFactory::krylov_solver_methods() const
+{
+  return PETScKrylovSolver::methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+  PETScCuspFactory::krylov_solver_preconditioners() const
+{
+  return PETScKrylovSolver::preconditioners();
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/PETScCuspFactory.h b/dolfin/la/PETScCuspFactory.h
new file mode 100644
index 0000000..9362d4d
--- /dev/null
+++ b/dolfin/la/PETScCuspFactory.h
@@ -0,0 +1,92 @@
+// Copyright (C) 2011 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-09-13
+// Last changed: 2012-08-24
+
+#ifdef HAS_PETSC_CUSP
+
+#ifndef __PETSC_CUSP_FACTORY_H
+#define __PETSC_CUSP_FACTORY_H
+
+#include "PETScKrylovSolver.h"
+#include "PETScLUSolver.h"
+#include "PETScMatrix.h"
+#include "PETScVector.h"
+#include "TensorLayout.h"
+#include "GenericLinearAlgebraFactory.h"
+
+namespace dolfin
+{
+
+  class PETScCuspFactory : public GenericLinearAlgebraFactory
+  {
+  public:
+
+    /// Destructor
+    virtual ~PETScCuspFactory() {}
+
+    /// Create empty matrix
+    std::shared_ptr<GenericMatrix> create_matrix() const;
+
+    /// Create empty vector
+    std::shared_ptr<GenericVector> create_vector() const;
+
+    /// Create empty tensor layout
+    std::shared_ptr<TensorLayout> create_layout(std::size_t rank) const;
+
+    /// Create empty linear operator
+    std::shared_ptr<GenericLinearOperator> create_linear_operator() const;
+
+    /// Create LU solver
+    std::shared_ptr<GenericLUSolver>
+      create_lu_solver(std::string method) const;
+
+    /// Create Krylov solver
+    std::shared_ptr<GenericLinearSolver>
+      create_krylov_solver(std::string method,
+                           std::string preconditioner) const;
+
+    /// Return a list of available LU solver methods
+    std::vector<std::pair<std::string, std::string> >
+      lu_solver_methods() const;
+
+    /// Return a list of available Krylov solver methods
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_methods() const;
+
+    /// Return a list of available preconditioners
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_preconditioners() const;
+
+    /// Return singleton instance
+    static PETScCuspFactory& instance()
+    { return factory; }
+
+  private:
+
+    /// Private constructor
+    PETScCuspFactory() {}
+    static PETScCuspFactory factory;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScFactory.cpp b/dolfin/la/PETScFactory.cpp
new file mode 100644
index 0000000..706907a
--- /dev/null
+++ b/dolfin/la/PETScFactory.cpp
@@ -0,0 +1,102 @@
+// Copyright (C) 2005-2006 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2009-2012
+//
+// First added:  2007-12-06
+// Last changed: 2012-08-21
+
+#ifdef HAS_PETSC
+
+#include "SparsityPattern.h"
+#include "PETScLUSolver.h"
+#include "PETScMatrix.h"
+#include "PETScVector.h"
+#include "PETScLinearOperator.h"
+#include "PETScFactory.h"
+
+using namespace dolfin;
+
+// Singleton instance
+PETScFactory PETScFactory::factory;
+
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericMatrix> PETScFactory::create_matrix() const
+{
+  std::shared_ptr<GenericMatrix> A(new PETScMatrix);
+  return A;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> PETScFactory:: create_vector() const
+{
+  std::shared_ptr<GenericVector> x(new PETScVector);
+  return x;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<TensorLayout>
+PETScFactory::create_layout(std::size_t rank) const
+{
+  bool sparsity = false;
+  if (rank > 1)
+    sparsity = true;
+  std::shared_ptr<TensorLayout> pattern(new TensorLayout(0, sparsity));
+  return pattern;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLinearOperator>
+PETScFactory::create_linear_operator() const
+{
+  std::shared_ptr<GenericLinearOperator> A(new PETScLinearOperator);
+  return A;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLUSolver>
+PETScFactory::create_lu_solver(std::string method) const
+{
+  std::shared_ptr<GenericLUSolver> solver(new PETScLUSolver(method));
+  return solver;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericLinearSolver>
+PETScFactory::create_krylov_solver(std::string method,
+                                   std::string preconditioner) const
+{
+  std::shared_ptr<GenericLinearSolver>
+    solver(new PETScKrylovSolver(method, preconditioner));
+  return solver;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+  PETScFactory::lu_solver_methods() const
+{
+  return PETScLUSolver::methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+  PETScFactory::krylov_solver_methods() const
+{
+  return PETScKrylovSolver::methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+  PETScFactory::krylov_solver_preconditioners() const
+{
+  return PETScKrylovSolver::preconditioners();
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/PETScFactory.h b/dolfin/la/PETScFactory.h
new file mode 100644
index 0000000..86b8b91
--- /dev/null
+++ b/dolfin/la/PETScFactory.h
@@ -0,0 +1,95 @@
+// Copyright (C) 2007 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011-2012
+//
+// First added:  2007-11-30
+// Last changed: 2012-08-20
+
+#ifdef HAS_PETSC
+
+#ifndef __PETSC_FACTORY_H
+#define __PETSC_FACTORY_H
+
+#include <string>
+#include <memory>
+#include <dolfin/common/types.h>
+#include "PETScKrylovSolver.h"
+#include "PETScLUSolver.h"
+#include "PETScMatrix.h"
+#include "PETScVector.h"
+#include "TensorLayout.h"
+#include "GenericLinearAlgebraFactory.h"
+
+namespace dolfin
+{
+
+  class PETScFactory : public GenericLinearAlgebraFactory
+  {
+  public:
+
+    /// Destructor
+    virtual ~PETScFactory() {}
+
+    /// Create empty matrix
+    std::shared_ptr<GenericMatrix> create_matrix() const;
+
+    /// Create empty vector
+    std::shared_ptr<GenericVector> create_vector() const;
+
+    /// Create empty tensor layout
+    std::shared_ptr<TensorLayout> create_layout(std::size_t rank) const;
+
+    /// Create empty linear operator
+    std::shared_ptr<GenericLinearOperator> create_linear_operator() const;
+
+    /// Create LU solver
+    std::shared_ptr<GenericLUSolver> create_lu_solver(std::string method) const;
+
+    /// Create Krylov solver
+    std::shared_ptr<GenericLinearSolver> create_krylov_solver(std::string method,
+                                            std::string preconditioner) const;
+
+    /// Return a list of available LU solver methods
+    std::vector<std::pair<std::string, std::string> >
+      lu_solver_methods() const;
+
+    /// Return a list of available Krylov solver methods
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_methods() const;
+
+    /// Return a list of available preconditioners
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_preconditioners() const;
+
+    /// Return singleton instance
+    static PETScFactory& instance()
+    { return factory; }
+
+  private:
+
+    /// Private constructor
+    PETScFactory() {}
+    static PETScFactory factory;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScKrylovSolver.cpp b/dolfin/la/PETScKrylovSolver.cpp
new file mode 100644
index 0000000..3ec6f95
--- /dev/null
+++ b/dolfin/la/PETScKrylovSolver.cpp
@@ -0,0 +1,716 @@
+// Copyright (C) 2005 Johan Jansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2005-2012
+// Modified by Garth N. Wells 2005-2010
+// Modified by Fredrik Valdmanis 2011
+//
+// First added:  2005-12-02
+// Last changed: 2013-11-25
+
+#ifdef HAS_PETSC
+
+#include <petsclog.h>
+#include <boost/assign/list_of.hpp>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Timer.h>
+#include "GenericMatrix.h"
+#include "GenericVector.h"
+#include "KrylovSolver.h"
+#include "PETScBaseMatrix.h"
+#include "PETScMatrix.h"
+#include "PETScPreconditioner.h"
+#include "PETScUserPreconditioner.h"
+#include "PETScVector.h"
+#include "VectorSpaceBasis.h"
+#include "PETScKrylovSolver.h"
+
+using namespace dolfin;
+
+// Mapping from method string to PETSc
+const std::map<std::string, const KSPType> PETScKrylovSolver::_methods
+  = boost::assign::map_list_of("default",  "")
+                              ("cg",         KSPCG)
+                              ("gmres",      KSPGMRES)
+                              ("minres",     KSPMINRES)
+                              ("tfqmr",      KSPTFQMR)
+                              ("richardson", KSPRICHARDSON)
+                              ("bicgstab",   KSPBCGS);
+
+// Mapping from method string to description
+const std::vector<std::pair<std::string, std::string> >
+  PETScKrylovSolver::_methods_descr = boost::assign::pair_list_of
+    ("default",    "default Krylov method")
+    ("cg",         "Conjugate gradient method")
+    ("gmres",      "Generalized minimal residual method")
+    ("minres",     "Minimal residual method")
+    ("tfqmr",      "Transpose-free quasi-minimal residual method")
+    ("richardson", "Richardson method")
+    ("bicgstab",   "Biconjugate gradient stabilized method");
+
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+PETScKrylovSolver::methods()
+{
+  return PETScKrylovSolver::_methods_descr;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+PETScKrylovSolver::preconditioners()
+{
+  return PETScPreconditioner::preconditioners();
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::set_options_prefix(std::string prefix)
+{
+  dolfin_assert(_ksp);
+  PetscErrorCode ierr = KSPSetOptionsPrefix(_ksp, prefix.c_str());
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOptionsPrefix");
+}
+//-----------------------------------------------------------------------------
+Parameters PETScKrylovSolver::default_parameters()
+{
+  Parameters p(KrylovSolver::default_parameters());
+  p.rename("petsc_krylov_solver");
+
+  // Norm type used in covergence test
+  std::set<std::string> allowed_norm_types;
+  allowed_norm_types.insert("preconditioned");
+  allowed_norm_types.insert("true");
+  allowed_norm_types.insert("none");
+  p.add("convergence_norm_type", allowed_norm_types);
+
+  // Control PETSc performance profiling
+  p.add<bool>("profile");
+
+  p.add("options_prefix", "default");
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+PETScKrylovSolver::PETScKrylovSolver(std::string method,
+                                     std::string preconditioner)
+  : _ksp(NULL), pc_dolfin(NULL),
+    _preconditioner(new PETScPreconditioner(preconditioner)),
+    petsc_nullspace(NULL), preconditioner_set(false)
+{
+  // Check that the requested method is known
+  if (_methods.count(method) == 0)
+  {
+    dolfin_error("PETScKrylovSolver.cpp",
+                 "create PETSc Krylov solver",
+                 "Unknown Krylov method \"%s\"", method.c_str());
+  }
+
+  // Set parameter values
+  parameters = default_parameters();
+
+  init(method);
+}
+//-----------------------------------------------------------------------------
+PETScKrylovSolver::PETScKrylovSolver(std::string method,
+                                     PETScPreconditioner& preconditioner)
+  : _ksp(NULL), _preconditioner(reference_to_no_delete_pointer(preconditioner)),
+    petsc_nullspace(NULL), preconditioner_set(false)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  init(method);
+}
+//-----------------------------------------------------------------------------
+PETScKrylovSolver::PETScKrylovSolver(std::string method,
+  std::shared_ptr<PETScPreconditioner> preconditioner)
+  : _ksp(NULL), _preconditioner(preconditioner), petsc_nullspace(NULL),
+    preconditioner_set(false)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  init(method);
+}
+//-----------------------------------------------------------------------------
+PETScKrylovSolver::PETScKrylovSolver(std::string method,
+                                     PETScUserPreconditioner& preconditioner)
+  : _ksp(NULL), pc_dolfin(&preconditioner), petsc_nullspace(NULL),
+    preconditioner_set(false)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  init(method);
+}
+//-----------------------------------------------------------------------------
+PETScKrylovSolver::PETScKrylovSolver(std::string method,
+  std::shared_ptr<PETScUserPreconditioner> preconditioner)
+  : _ksp(NULL), pc_dolfin(preconditioner.get()), petsc_nullspace(NULL),
+    preconditioner_set(false)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  init(method);
+}
+//-----------------------------------------------------------------------------
+PETScKrylovSolver::PETScKrylovSolver(KSP ksp)
+  : _ksp(ksp), pc_dolfin(0), petsc_nullspace(NULL), preconditioner_set(true)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  // Increment reference count
+  if (_ksp)
+    PetscObjectReference((PetscObject)_ksp);
+}
+//-----------------------------------------------------------------------------
+PETScKrylovSolver::~PETScKrylovSolver()
+{
+  if (_ksp)
+    KSPDestroy(&_ksp);
+  if (petsc_nullspace)
+    MatNullSpaceDestroy(&petsc_nullspace);
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::set_operator(std::shared_ptr<const GenericLinearOperator> A)
+{
+  set_operators(A, A);
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::set_operator(std::shared_ptr<const PETScBaseMatrix> A)
+{
+  set_operators(A, A);
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::set_operators(std::shared_ptr<const  GenericLinearOperator> A,
+                                      std::shared_ptr<const GenericLinearOperator> P)
+{
+  set_operators(as_type<const PETScBaseMatrix>(A),
+                as_type<const PETScBaseMatrix>(P));
+}
+//-----------------------------------------------------------------------------
+void
+PETScKrylovSolver::set_operators(std::shared_ptr<const PETScBaseMatrix> A,
+                                 std::shared_ptr<const PETScBaseMatrix> P)
+{
+  _matA = A;
+  _matP = P;
+  dolfin_assert(_matA);
+  dolfin_assert(_matP);
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::set_nullspace(const VectorSpaceBasis& nullspace)
+{
+  PetscErrorCode ierr;
+
+  // Copy vectors
+  for (std::size_t i = 0; i < nullspace.dim(); ++i)
+  {
+    dolfin_assert(nullspace[i]);
+    const PETScVector& x = nullspace[i]->down_cast<PETScVector>();
+
+    // Copy vector
+    _nullspace.push_back(x);
+  }
+
+  // Get pointers to underlying PETSc objects and normalize vectors
+  std::vector<Vec> petsc_vec(nullspace.dim());
+  for (std::size_t i = 0; i < nullspace.dim(); ++i)
+  {
+    petsc_vec[i] = _nullspace[i].vec();
+    PetscReal val = 0.0;
+    ierr = VecNormalize(_nullspace[i].vec(), &val);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecNormalize");
+  }
+
+  // Create null space
+  if (petsc_nullspace)
+    MatNullSpaceDestroy(&petsc_nullspace);
+  ierr = MatNullSpaceCreate(PETSC_COMM_WORLD, PETSC_FALSE,
+                            nullspace.dim(),
+                            petsc_vec.data(), &petsc_nullspace);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatNullSpaceCreate");
+
+  // Set null space
+  dolfin_assert(_ksp);
+  ierr = KSPSetNullSpace(_ksp, petsc_nullspace);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetNullSpace");
+}
+//-----------------------------------------------------------------------------
+const PETScBaseMatrix& PETScKrylovSolver::get_operator() const
+{
+  if (!_matA)
+  {
+    dolfin_error("PETScKrylovSolver.cpp",
+                 "access operator for PETSc Krylov solver",
+                 "Operator has not been set");
+  }
+  return *_matA;
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScKrylovSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  return solve(as_type<PETScVector>(x), as_type<const PETScVector>(b));
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScKrylovSolver::solve(const GenericLinearOperator& A,
+                                      GenericVector& x,
+                                      const GenericVector& b)
+{
+  return solve(as_type<const PETScBaseMatrix>(A),
+               as_type<PETScVector>(x),
+               as_type<const PETScVector>(b));
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScKrylovSolver::solve(PETScVector& x, const PETScVector& b)
+{
+  Timer timer("PETSc Krylov solver");
+
+  dolfin_assert(_matA);
+  dolfin_assert(_ksp);
+
+  PetscErrorCode ierr;
+
+  // Check dimensions
+  const std::size_t M = _matA->size(0);
+  const std::size_t N = _matA->size(1);
+  if (_matA->size(0) != b.size())
+  {
+    dolfin_error("PETScKrylovSolver.cpp",
+                 "unable to solve linear system with PETSc Krylov solver",
+                 "Non-matching dimensions for linear system (matrix has %d rows and right-hand side vector has %d rows)",
+                 _matA->size(0), b.size());
+  }
+
+  // Write a message
+  const bool report = parameters["report"];
+  if (report && dolfin::MPI::rank(PETSC_COMM_WORLD) == 0)
+    info("Solving linear system of size %d x %d (PETSc Krylov solver).", M, N);
+
+  // Reinitialize solution vector if necessary
+  if (x.empty())
+  {
+    _matA->init_vector(x, 1);
+    x.zero();
+  }
+
+  // Set some PETSc-specific options
+  set_petsc_ksp_options();
+
+  // Set operators
+  set_petsc_operators();
+
+  // Set near null space for preconditioner
+  if (_preconditioner)
+  {
+    dolfin_assert(_matP);
+    const MatNullSpace pc_nullspace = _preconditioner->near_nullspace();
+
+    if (pc_nullspace && !preconditioner_set)
+    {
+      #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR >= 3
+      ierr = MatSetNearNullSpace(_matP->mat(), pc_nullspace);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetNearNullSpace");
+      #else
+      dolfin_error("PETScMatrix.cpp",
+                   "set approximate null space for PETSc matrix",
+                   "This is supported by PETSc version > 3.2");
+      #endif
+    }
+  }
+
+  // FIXME: Improve check for re-setting preconditoner, e.g. if
+  //        parameters change
+  // FIXME: Solve using matrix free matrices fails if no user provided
+  //        Prec is provided
+  // Set preconditioner if necessary
+  if (_preconditioner && !preconditioner_set)
+  {
+    _preconditioner->set(*this);
+    preconditioner_set = true;
+  }
+  // User defined preconditioner
+  else if (pc_dolfin && !preconditioner_set)
+  {
+    PETScUserPreconditioner::setup(_ksp, *pc_dolfin);
+    preconditioner_set = true;
+  }
+
+  // Check whether we need a work-around for a bug in PETSc-stable.
+  // This has been fixed in PETSc-dev, see
+  // https://bugs.launchpad.net/dolfin/+bug/988494
+  const bool use_petsc_cusp_hack = parameters["use_petsc_cusp_hack"];
+  if (use_petsc_cusp_hack)
+    info("Using hack to get around PETScCusp bug: ||b|| = %g", b.norm("l2"));
+
+  // Set convergence norm type
+  if (parameters["convergence_norm_type"].is_set())
+  {
+    const std::string convergence_norm_type
+      = parameters["convergence_norm_type"];
+    if (convergence_norm_type == "true")
+    {
+      ierr = KSPSetNormType(_ksp, KSP_NORM_UNPRECONDITIONED);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetNormType");
+    }
+    else if (convergence_norm_type == "preconditioned")
+    {
+      ierr = KSPSetNormType(_ksp, KSP_NORM_PRECONDITIONED);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetNormType");
+    }
+    else if (convergence_norm_type == "none")
+    {
+      ierr = KSPSetNormType(_ksp, KSP_NORM_NONE);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetNormType");
+    }
+  }
+
+  std::string prefix = std::string(parameters["options_prefix"]);
+  if (prefix != "default")
+  {
+    // Make sure that the prefix has a '_' at the end if the user didn't provide it
+    char lastchar = *prefix.rbegin();
+    if (lastchar != '_')
+      prefix += "_";
+
+    KSPSetOptionsPrefix(_ksp, prefix.c_str());
+  }
+  KSPSetFromOptions(_ksp);
+
+  // Solve linear system
+  if (MPI::rank(PETSC_COMM_WORLD) == 0)
+  {
+    log(PROGRESS, "PETSc Krylov solver starting to solve %i x %i system.",
+        _matA->size(0), _matA->size(1));
+  }
+
+  if (parameters["profile"].is_set())
+  {
+    const bool profile_performance = parameters["profile"];
+    if (profile_performance)
+    {
+      PetscLogBegin();
+      ierr = KSPSolve(_ksp, b.vec(), x.vec());
+      if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSolve");
+      PetscLogView(PETSC_VIEWER_STDOUT_WORLD);
+    }
+  }
+  else
+  {
+    ierr =  KSPSolve(_ksp, b.vec(), x.vec());
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSolve");
+  }
+
+  // Update ghost values
+  x.update_ghost_values();
+
+  // Get the number of iterations
+  PetscInt num_iterations = 0;
+  ierr = KSPGetIterationNumber(_ksp, &num_iterations);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetIterationNumber");
+
+  // Check if the solution converged and print error/warning if not converged
+  KSPConvergedReason reason;
+  ierr = KSPGetConvergedReason(_ksp, &reason);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetConvergedReason");
+  if (reason < 0)
+  {
+    // Get solver residual norm
+    double rnorm = 0.0;
+    ierr = KSPGetResidualNorm(_ksp, &rnorm);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetResidualNorm");
+    const char *reason_str = KSPConvergedReasons[reason];
+    bool error_on_nonconvergence = parameters["error_on_nonconvergence"];
+    if (error_on_nonconvergence)
+    {
+      dolfin_error("PETScKrylovSolver.cpp",
+                   "solve linear system using PETSc Krylov solver",
+                   "Solution failed to converge in %i iterations (PETSc reason %s, residual norm ||r|| = %e)",
+                   static_cast<int>(num_iterations), reason_str, rnorm);
+    }
+    else
+    {
+      warning("Krylov solver did not converge in %i iterations (PETSc reason %s, residual norm ||r|| = %e).",
+              num_iterations, reason_str, rnorm);
+    }
+  }
+
+  // Report results
+  if (report && dolfin::MPI::rank(PETSC_COMM_WORLD) == 0)
+    write_report(num_iterations, reason);
+
+  return num_iterations;
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScKrylovSolver::solve(const PETScBaseMatrix& A,
+                                      PETScVector& x,
+                                      const PETScVector& b)
+{
+  // Set operator
+  std::shared_ptr<const PETScBaseMatrix> Atmp(&A, NoDeleter());
+  set_operator(Atmp);
+
+  // Call solve
+  return solve(x, b);
+}
+//-----------------------------------------------------------------------------
+KSP PETScKrylovSolver::ksp() const
+{
+  return _ksp;
+}
+//-----------------------------------------------------------------------------
+std::string PETScKrylovSolver::str(bool verbose) const
+{
+  dolfin_assert(_ksp);
+  std::stringstream s;
+  if (verbose)
+  {
+    warning("Verbose output for PETScKrylovSolver not implemented, calling \
+PETSc KSPView directly.");
+    PetscErrorCode ierr = KSPView(_ksp, PETSC_VIEWER_STDOUT_WORLD);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPView");
+  }
+  else
+    s << "<PETScKrylovSolver>";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::init(const std::string& method)
+{
+  PetscErrorCode ierr;
+
+  if (_ksp)
+    KSPDestroy(&_ksp);
+
+  // Set up solver environment
+  ierr = KSPCreate(PETSC_COMM_WORLD, &_ksp);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPCreate");
+
+  // Set solver type
+  if (method != "default")
+  {
+    ierr = KSPSetType(_ksp, _methods.find(method)->second);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetType");
+  }
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::set_petsc_operators()
+{
+  dolfin_assert(_matA);
+  dolfin_assert(_matP);
+  dolfin_assert(_ksp);
+
+  PetscErrorCode ierr;
+
+  // Get parameter
+  #if PETSC_VERSION_RELEASE
+  const std::string mat_structure = parameters("preconditioner")["structure"];
+
+  // Set operators with appropriate option
+  if (mat_structure == "same")
+  {
+    ierr = KSPSetOperators(_ksp, _matA->mat(), _matP->mat(), SAME_PRECONDITIONER);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOperators");
+  }
+  else if (mat_structure == "same_nonzero_pattern")
+  {
+    ierr = KSPSetOperators(_ksp, _matA->mat(), _matP->mat(), SAME_NONZERO_PATTERN);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOperators");
+  }
+  else if (mat_structure == "different_nonzero_pattern")
+  {
+    ierr = KSPSetOperators(_ksp, _matA->mat(), _matP->mat(),
+                           DIFFERENT_NONZERO_PATTERN);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOperators");
+  }
+  else
+  {
+    dolfin_error("PETScKrylovSolver.cpp",
+                 "set PETSc Krylov solver operators",
+                 "Preconditioner re-use paramrter \"%s \" is unknown",
+                 mat_structure.c_str());
+  }
+  #else
+  ierr = KSPSetOperators(_ksp, _matA->mat(), _matP->mat());
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOperators");
+  #endif
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::set_petsc_ksp_options()
+{
+  PetscErrorCode ierr;
+
+  // GMRES restart parameter
+  const int gmres_restart = parameters("gmres")["restart"];
+  ierr = KSPGMRESSetRestart(_ksp, gmres_restart);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGMRESSetRestart");
+
+  // Non-zero initial guess
+  const bool nonzero_guess = parameters["nonzero_initial_guess"];
+  PetscBool petsc_nonzero_guess = PETSC_FALSE;
+  if (nonzero_guess)
+    petsc_nonzero_guess = PETSC_TRUE;
+  ierr = KSPSetInitialGuessNonzero(_ksp, petsc_nonzero_guess);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetInitialGuessNonzero");
+
+  // Monitor convergence
+  const bool monitor_convergence = parameters["monitor_convergence"];
+  if (monitor_convergence)
+  {
+    ierr = KSPMonitorSet(_ksp, KSPMonitorTrueResidualNorm, 0, 0);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPMonitorSet");
+  }
+
+  // Set tolerances
+  const int max_iterations = parameters["maximum_iterations"];
+  ierr = KSPSetTolerances(_ksp,
+                          parameters["relative_tolerance"],
+                          parameters["absolute_tolerance"],
+                          parameters["divergence_limit"],
+                          max_iterations);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetTolerances");
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::write_report(int num_iterations,
+                                     KSPConvergedReason reason)
+{
+  dolfin_assert(_ksp);
+
+  PetscErrorCode ierr;
+
+  // Get name of solver and preconditioner
+  PC pc;
+  #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR <= 3
+  const KSPType ksp_type;
+  const PCType pc_type;
+  #else
+  KSPType ksp_type;
+  PCType pc_type;
+  #endif
+  ierr = KSPGetType(_ksp, &ksp_type);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetType");
+
+  ierr = KSPGetPC(_ksp, &pc);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+
+  ierr = PCGetType(pc, &pc_type);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "PCGetType");
+
+  // If using additive Schwarz or block Jacobi, get 'sub' method which is
+  // applied to each block
+  const std::string pc_type_str = pc_type;
+  #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR <= 3
+  const KSPType sub_ksp_type;
+  const PCType sub_pc_type;
+  #else
+  KSPType sub_ksp_type;
+  PCType sub_pc_type;
+  #endif
+  PC sub_pc;
+  KSP* sub_ksp = NULL;
+  if (pc_type_str == PCASM || pc_type_str == PCBJACOBI)
+  {
+    if (pc_type_str == PCASM)
+    {
+      ierr = PCASMGetSubKSP(pc, PETSC_NULL, PETSC_NULL, &sub_ksp);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCASMGetSubKSP");
+    }
+    else if (pc_type_str == PCBJACOBI)
+    {
+      ierr = PCBJacobiGetSubKSP(pc, PETSC_NULL, PETSC_NULL, &sub_ksp);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCBJacobiGetSubKSP");
+    }
+    ierr = KSPGetType(*sub_ksp, &sub_ksp_type);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetType");
+
+    ierr = KSPGetPC(*sub_ksp, &sub_pc);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+
+    ierr = PCGetType(sub_pc, &sub_pc_type);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCGetType");
+  }
+
+  // FIXME: Get preconditioner description from PETScPreconditioner
+
+  // Report number of iterations and solver type
+  if (reason >= 0)
+  {
+    log(PROGRESS, "PETSc Krylov solver (%s, %s) converged in %d iterations.",
+        ksp_type, pc_type, num_iterations);
+  }
+  else
+  {
+    log(PROGRESS, "PETSc Krylov solver (%s, %s) failed to converge in %d iterations.",
+        ksp_type, pc_type, num_iterations);
+  }
+
+  if (pc_type_str == PCASM || pc_type_str == PCBJACOBI)
+  {
+    log(PROGRESS, "PETSc Krylov solver preconditioner (%s) submethods: (%s, %s)",
+        pc_type, sub_ksp_type, sub_pc_type);
+  }
+
+  #if PETSC_HAVE_HYPRE
+  if (pc_type_str == PCHYPRE)
+  {
+    const char* hypre_sub_type;
+    ierr = PCHYPREGetType(pc, &hypre_sub_type);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCHYPREGetType");
+
+    log(PROGRESS, "  Hypre preconditioner method: %s", hypre_sub_type);
+  }
+  #endif
+}
+//-----------------------------------------------------------------------------
+void PETScKrylovSolver::check_dimensions(const PETScBaseMatrix& A,
+                                         const GenericVector& x,
+                                         const GenericVector& b) const
+{
+  // Check dimensions of A
+  if (A.size(0) == 0 || A.size(1) == 0)
+  {
+    dolfin_error("PETScKrylovSolver.cpp",
+                 "unable to solve linear system with PETSc Krylov solver",
+                 "Matrix does not have a nonzero number of rows and columns");
+  }
+
+  // Check dimensions of A vs b
+  if (A.size(0) != b.size())
+  {
+    dolfin_error("PETScKrylovSolver.cpp",
+                 "unable to solve linear system with PETSc Krylov solver",
+                 "Non-matching dimensions for linear system (matrix has %d rows and right-hand side vector has %d rows)",
+                 A.size(0), b.size());
+  }
+
+  // Check dimensions of A vs x
+  if (!x.empty() && x.size() != A.size(1))
+  {
+    dolfin_error("PETScKrylovSolver.cpp",
+                 "unable to solve linear system with PETSc Krylov solver",
+                 "Non-matching dimensions for linear system (matrix has %d columns and solution vector has %d rows)",
+                 A.size(1), x.size());
+  }
+
+  // FIXME: We could implement a more thorough check of local/global
+  // FIXME: dimensions for distributed matrices and vectors here.
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/PETScKrylovSolver.h b/dolfin/la/PETScKrylovSolver.h
new file mode 100644
index 0000000..9aa1780
--- /dev/null
+++ b/dolfin/la/PETScKrylovSolver.h
@@ -0,0 +1,198 @@
+// Copyright (C) 2004-2005 Johan Jansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2005-2012
+// Modified by Johan Hoffman 2005
+// Modified by Andy R. Terrel 2005
+// Modified by Garth N. Wells 2005-2010
+//
+// First added:  2005-12-02
+// Last changed: 2012-08-20
+
+#ifndef __DOLFIN_PETSC_KRYLOV_SOLVER_H
+#define __DOLFIN_PETSC_KRYLOV_SOLVER_H
+
+#ifdef HAS_PETSC
+
+#include <map>
+#include <petscksp.h>
+#include <memory>
+#include <dolfin/common/types.h>
+#include "GenericLinearSolver.h"
+#include "PETScObject.h"
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class GenericMatrix;
+  class GenericVector;
+  class PETScBaseMatrix;
+  class PETScMatrix;
+  class PETScVector;
+  class PETScPreconditioner;
+  class PETScUserPreconditioner;
+  class PETScSNESSolver;
+  class VectorSpaceBasis;
+
+  /// This class implements Krylov methods for linear systems
+  /// of the form Ax = b. It is a wrapper for the Krylov solvers
+  /// of PETSc.
+
+  class PETScKrylovSolver : public GenericLinearSolver, public PETScObject
+  {
+  public:
+
+    /// Create Krylov solver for a particular method and names
+    /// preconditioner
+    PETScKrylovSolver(std::string method = "default",
+                      std::string preconditioner = "default");
+
+    /// Create Krylov solver for a particular method and
+    /// PETScPreconditioner
+    PETScKrylovSolver(std::string method, PETScPreconditioner& preconditioner);
+
+    /// Create Krylov solver for a particular method and
+    /// PETScPreconditioner (shared_ptr version)
+    PETScKrylovSolver(std::string method,
+		      std::shared_ptr<PETScPreconditioner> preconditioner);
+
+    /// Create Krylov solver for a particular method and
+    /// PETScPreconditioner
+    PETScKrylovSolver(std::string method,
+                      PETScUserPreconditioner& preconditioner);
+
+    /// Create Krylov solver for a particular method and
+    /// PETScPreconditioner (shared_ptr version)
+    PETScKrylovSolver(std::string method,
+		    std::shared_ptr<PETScUserPreconditioner> preconditioner);
+
+    /// Create solver wrapper of a PETSc KSP object
+    explicit PETScKrylovSolver(KSP ksp);
+
+    /// Destructor
+    ~PETScKrylovSolver();
+
+    /// Set operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Set operator (matrix)
+    void set_operator(std::shared_ptr<const PETScBaseMatrix> A);
+
+    /// Set operator (matrix) and preconditioner matrix
+    void set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                       std::shared_ptr<const GenericLinearOperator> P);
+
+    /// Set operator (matrix) and preconditioner matrix
+    void set_operators(std::shared_ptr<const PETScBaseMatrix> A,
+                       std::shared_ptr<const PETScBaseMatrix> P);
+
+    /// Set null space of the operator (matrix). This is used to solve
+    /// singular systems
+    void set_nullspace(const VectorSpaceBasis& nullspace);
+
+    /// Get operator (matrix)
+    const PETScBaseMatrix& get_operator() const;
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(PETScVector& x, const PETScVector& b);
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                      const GenericVector& b);
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(const PETScBaseMatrix& A, PETScVector& x,
+                      const PETScVector& b);
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Return PETSc KSP pointer
+    KSP ksp() const;
+
+    /// Return a list of available solver methods
+    static std::vector<std::pair<std::string, std::string> > methods();
+
+    /// Return a list of available preconditioners
+    static std::vector<std::pair<std::string, std::string> > preconditioners();
+
+    /// Set options prefix
+    void set_options_prefix(std::string prefix);
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+    friend class PETScSNESSolver;
+
+  private:
+
+    // Initialize KSP solver
+    void init(const std::string& method);
+
+    // Set PETSc operators
+    void set_petsc_operators();
+
+    // Set options that affect KSP object
+    void set_petsc_ksp_options();
+
+    // Report the number of iterations
+    void write_report(int num_iterations, KSPConvergedReason reason);
+
+    void check_dimensions(const PETScBaseMatrix& A, const GenericVector& x,
+                          const GenericVector& b) const;
+
+    // Available solvers
+    static const std::map<std::string, const KSPType> _methods;
+
+    // Available solvers descriptions
+    static const std::vector<std::pair<std::string, std::string> >
+      _methods_descr;
+
+    // PETSc solver pointer
+    KSP _ksp;
+
+    // DOLFIN-defined PETScUserPreconditioner
+    PETScUserPreconditioner* pc_dolfin;
+
+    // Preconditioner
+    std::shared_ptr<PETScPreconditioner> _preconditioner;
+
+    // Operator (the matrix)
+    std::shared_ptr<const PETScBaseMatrix> _matA;
+
+    // Matrix used to construct the preconditoner
+    std::shared_ptr<const PETScBaseMatrix> _matP;
+
+    // Null space vectors
+    std::vector<PETScVector> _nullspace;
+
+    // PETSc null space
+    MatNullSpace petsc_nullspace;
+
+    bool preconditioner_set;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScLUSolver.cpp b/dolfin/la/PETScLUSolver.cpp
new file mode 100644
index 0000000..b003376
--- /dev/null
+++ b/dolfin/la/PETScLUSolver.cpp
@@ -0,0 +1,495 @@
+// Copyright (C) 2005-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2009-2010
+// Modified by Niclas Jansson 2009
+// Modified by Fredrik Valdmanis 2011
+//
+// First added:  2005
+// Last changed: 2011-11-11
+
+#ifdef HAS_PETSC
+
+#include <dolfin/common/Timer.h>
+
+#include <boost/assign/list_of.hpp>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include "LUSolver.h"
+#include "PETScMatrix.h"
+#include "PETScOptions.h"
+#include "PETScVector.h"
+#include "PETScLUSolver.h"
+
+using namespace dolfin;
+
+#define MAT_SOLVER_UMFPACK      MATSOLVERUMFPACK
+#define MAT_SOLVER_MUMPS        MATSOLVERMUMPS
+#define MAT_SOLVER_PASTIX       MATSOLVERPASTIX
+#define MAT_SOLVER_PETSC        MATSOLVERPETSC
+#define MAT_SOLVER_SUPERLU_DIST MATSOLVERSUPERLU_DIST
+#define MAT_SOLVER_SUPERLU      MATSOLVERSUPERLU
+
+// List of available LU solvers
+const std::map<std::string, const MatSolverPackage> PETScLUSolver::_methods
+  = boost::assign::map_list_of("default", "")
+                              #if PETSC_HAVE_UMFPACK || PETSC_HAVE_SUITESPARSE
+                              ("umfpack",      MAT_SOLVER_UMFPACK)
+                              #endif
+                              #if PETSC_HAVE_MUMPS
+                              ("mumps",        MAT_SOLVER_MUMPS)
+                              #endif
+                              #if PETSC_HAVE_PASTIX
+                              ("pastix",       MAT_SOLVER_PASTIX)
+                              #endif
+                              #if PETSC_HAVE_SUPERLU
+                              ("superlu",      MAT_SOLVER_SUPERLU)
+                              #endif
+                              #if PETSC_HAVE_SUPERLU_DIST
+                              ("superlu_dist", MAT_SOLVER_SUPERLU_DIST)
+                              #endif
+                              ("petsc",        MAT_SOLVER_PETSC);
+//-----------------------------------------------------------------------------
+const std::map<const MatSolverPackage, const bool>
+PETScLUSolver::_methods_cholesky
+= boost::assign::map_list_of(MAT_SOLVER_UMFPACK,      false)
+                              (MAT_SOLVER_MUMPS,        true)
+                              (MAT_SOLVER_PASTIX,       true)
+                              (MAT_SOLVER_SUPERLU,      false)
+                              (MAT_SOLVER_SUPERLU_DIST, false)
+                              (MAT_SOLVER_PETSC,        true);
+//-----------------------------------------------------------------------------
+const std::vector<std::pair<std::string, std::string> >
+PETScLUSolver::_methods_descr
+  = boost::assign::pair_list_of("default", "default LU solver")
+    #if PETSC_HAVE_UMFPACK || PETSC_HAVE_SUITESPARSE
+    ("umfpack", "UMFPACK (Unsymmetric MultiFrontal sparse LU factorization)")
+    #endif
+    #if PETSC_HAVE_MUMPS
+    ("mumps", "MUMPS (MUltifrontal Massively Parallel Sparse direct Solver)")
+    #endif
+    #if PETSC_HAVE_PASTIX
+    ("pastix", "PaStiX (Parallel Sparse matriX package)")
+    #endif
+    #if PETSC_HAVE_SUPERLU
+    ("superlu", "SuperLU")
+    #endif
+    #if PETSC_HAVE_SUPERLU_DIST
+    ("superlu_dist", "Parallel SuperLU")
+    #endif
+    ("petsc", "PETSc builtin LU solver");
+
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+PETScLUSolver::methods()
+{
+  return PETScLUSolver::_methods_descr;
+}
+//-----------------------------------------------------------------------------
+Parameters PETScLUSolver::default_parameters()
+{
+  Parameters p(LUSolver::default_parameters());
+  p.rename("petsc_lu_solver");
+
+  // Number of threads per process for multi-threaded solvers
+  p.add<std::size_t>("num_threads");
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+PETScLUSolver::PETScLUSolver(std::string method) : _ksp(NULL)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  // Initialize PETSc LU solver
+  init_solver(method);
+}
+//-----------------------------------------------------------------------------
+PETScLUSolver::PETScLUSolver(std::shared_ptr<const PETScMatrix> A,
+                             std::string method) : _ksp(NULL), _matA(A)
+{
+  // Check dimensions
+  if (A->size(0) != A->size(1))
+  {
+    dolfin_error("PETScLUSolver.cpp",
+                 "create PETSc LU solver",
+                 "Cannot LU factorize non-square PETSc matrix");
+  }
+
+  // Set parameter values
+  parameters = default_parameters();
+
+  // Initialize PETSc LU solver
+  init_solver(method);
+}
+//-----------------------------------------------------------------------------
+PETScLUSolver::~PETScLUSolver()
+{
+  if (_ksp)
+    KSPDestroy(&_ksp);
+}
+//-----------------------------------------------------------------------------
+void
+PETScLUSolver::set_operator(std::shared_ptr<const GenericLinearOperator> A)
+{
+  _matA = as_type<const PETScMatrix>(require_matrix(A));
+  dolfin_assert(_matA);
+}
+//-----------------------------------------------------------------------------
+void PETScLUSolver::set_operator(std::shared_ptr<const PETScMatrix> A)
+{
+  _matA = A;
+  dolfin_assert(_matA);
+}
+//-----------------------------------------------------------------------------
+const GenericLinearOperator& PETScLUSolver::get_operator() const
+{
+  if (!_matA)
+  {
+    dolfin_error("PETScLUSolver.cpp",
+                 "access operator of PETSc LU solver",
+                 "Operator has not been set");
+  }
+  return *_matA;
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScLUSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  return solve(x, b, false);
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScLUSolver::solve(GenericVector& x, const GenericVector& b,
+                                 bool transpose)
+{
+  Timer timer("PETSc LU solver");
+
+  dolfin_assert(_ksp);
+  dolfin_assert(_matA);
+
+  PetscErrorCode ierr;
+
+  // Downcast matrix and vectors
+  const PETScVector& _b = as_type<const PETScVector>(b);
+  PETScVector& _x = as_type<PETScVector>(x);
+
+  // Check dimensions
+  if (_matA->size(0) != b.size())
+  {
+    dolfin_error("PETScLUSolver.cpp",
+                 "solve linear system using PETSc LU solver",
+                 "Cannot factorize non-square PETSc matrix");
+  }
+
+  // Initialize solution vector if required (make compatible with A in
+  // parallel)
+  if (x.empty())
+    _matA->init_vector(x, 1);
+
+  // Set PETSc operators (depends on factorization re-use options);
+  set_petsc_operators();
+
+  // Write a pre-solve message
+  pre_report(*_matA);
+
+  // Get package used to solve system
+  PC pc;
+  ierr = KSPGetPC(_ksp, &pc);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+
+  configure_ksp(_solver_package);
+
+  // Set number of threads if using PaStiX
+  if (strcmp(_solver_package, MATSOLVERPASTIX) == 0)
+  {
+    if (parameters["num_threads"].is_set())
+    {
+      // Use number of threads specified for LU solver
+      ierr = PetscOptionsSetValue("-mat_pastix_threadnbr",
+                           parameters["num_threads"].value_str().c_str());
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PetscOptionsSetValue");
+    }
+    else
+    {
+      // Use global number of threads
+      ierr = PetscOptionsSetValue("-mat_pastix_threadnbr",
+                        dolfin::parameters["num_threads"].value_str().c_str());
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PetscOptionsSetValue");
+    }
+  }
+
+  // Solve linear system
+  const Vec b_petsc = _b.vec();
+  Vec x_petsc = _x.vec();
+  if (!transpose)
+  {
+    ierr = KSPSolve(_ksp, b_petsc, x_petsc);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSolve");
+  }
+  else
+  {
+    ierr = KSPSolveTranspose(_ksp, b_petsc, x_petsc);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSolveTranspose");
+  }
+
+  // Update ghost values
+  _x.update_ghost_values();
+
+  return 1;
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScLUSolver::solve(const GenericLinearOperator& A,
+                                 GenericVector& x,
+                                 const GenericVector& b)
+{
+  return solve(as_type<const PETScMatrix>(require_matrix(A)),
+               as_type<PETScVector>(x),
+               as_type<const PETScVector>(b));
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScLUSolver::solve(const PETScMatrix& A, PETScVector& x,
+                                 const PETScVector& b)
+{
+  std::shared_ptr<const PETScMatrix> Atmp(&A, NoDeleter());
+  set_operator(Atmp);
+  return solve(x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScLUSolver::solve_transpose(GenericVector& x,
+                                           const GenericVector& b)
+{
+return solve(x, b, true);
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScLUSolver::solve_transpose(const GenericLinearOperator& A,
+                                           GenericVector& x,
+                                           const GenericVector& b)
+{
+  return solve_transpose(as_type<const PETScMatrix>(require_matrix(A)),
+                         as_type<PETScVector>(x),
+                         as_type<const PETScVector>(b));
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScLUSolver::solve_transpose(const PETScMatrix& A,
+                                           PETScVector& x,
+                                           const PETScVector& b)
+{
+  std::shared_ptr<const PETScMatrix> _matA(&A, NoDeleter());
+  set_operator(_matA);
+  return solve_transpose(x, b);
+}
+//-----------------------------------------------------------------------------
+std::string PETScLUSolver::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    warning("Verbose output for PETScLUSolver not implemented, calling PETSc KSPView directly.");
+    PetscErrorCode ierr = KSPView(_ksp, PETSC_VIEWER_STDOUT_WORLD);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPView");
+  }
+  else
+    s << "<PETScLUSolver>";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+KSP PETScLUSolver::ksp() const
+{
+  return _ksp;
+}
+//-----------------------------------------------------------------------------
+const MatSolverPackage PETScLUSolver::select_solver(std::string& method) const
+{
+  // Check package string
+  if (_methods.count(method) == 0)
+  {
+    dolfin_error("PETScLUSolver.cpp",
+                 "solve linear system using PETSc LU solver",
+                 "Unknown LU method \"%s\"", method.c_str());
+  }
+
+  // Choose appropriate 'default' solver
+  if (method == "default")
+  {
+    if (MPI::size(MPI_COMM_WORLD) == 1)
+    {
+      #if PETSC_HAVE_UMFPACK || PETSC_HAVE_SUITESPARSE
+      method = "umfpack";
+      #elif PETSC_HAVE_MUMPS
+      method = "mumps";
+      PETScOptions::set("mat_mumps_icntl_7", 0);
+      #elif PETSC_HAVE_PASTIX
+      method = "pastix";
+      #elif PETSC_HAVE_SUPERLU
+      method = "superlu";
+      #elif PETSC_HAVE_SUPERLU_DIST
+      method = "superlu_dist";
+      #else
+      method = "petsc";
+      warning("Using PETSc native LU solver. Consider configuring PETSc with an efficient LU solver (e.g. UMFPACK, MUMPS).");
+      #endif
+    }
+    else
+    {
+      #if PETSC_HAVE_MUMPS
+      method = "mumps";
+      PETScOptions::set("mat_mumps_icntl_7", 0);
+      #elif PETSC_HAVE_SUPERLU_DIST
+      method = "superlu_dist";
+      #elif PETSC_HAVE_PASTIX
+      method = "pastix";
+      #else
+      dolfin_error("PETScLUSolver.cpp",
+                   "solve linear system using PETSc LU solver",
+                   "No suitable solver for parallel LU found. Consider configuring PETSc with MUMPS or SuperLU_dist");
+      #endif
+    }
+  }
+
+  return _methods.find(method)->second;
+}
+//-----------------------------------------------------------------------------
+bool PETScLUSolver::solver_has_cholesky(const MatSolverPackage package) const
+{
+  return _methods_cholesky.find(package)->second;
+}
+//-----------------------------------------------------------------------------
+void PETScLUSolver::init_solver(std::string& method)
+{
+  // Select solver
+  _solver_package = select_solver(method);
+
+  // Destroy old solver environment if necessary
+  if (_ksp)
+    KSPDestroy(&_ksp);
+
+  PetscErrorCode ierr;
+
+  // Create solver
+  if (MPI::size(MPI_COMM_WORLD) > 1)
+  {
+    ierr = KSPCreate(PETSC_COMM_WORLD, &_ksp);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPCreate");
+  }
+  else
+  {
+    ierr = KSPCreate(PETSC_COMM_SELF, &_ksp);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+  }
+
+  // Make solver preconditioner only
+  ierr = KSPSetType(_ksp, KSPPREONLY);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetType");
+}
+//-----------------------------------------------------------------------------
+void PETScLUSolver::configure_ksp(const MatSolverPackage solver_package)
+{
+  PetscErrorCode ierr;
+
+  PC pc;
+  ierr = KSPGetPC(_ksp, &pc);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+
+  // Set preconditioner to LU factorization/Cholesky as appropriate
+
+  const bool symmetric = parameters["symmetric"];
+  if (symmetric && solver_has_cholesky(solver_package))
+  {
+    ierr = PCSetType(pc, PCCHOLESKY);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetType");
+  }
+  else
+  {
+    ierr = PCSetType(pc, PCLU);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetType");
+  }
+
+  // Set solver package
+  ierr = PCFactorSetMatSolverPackage(pc, solver_package);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorSetMatSolverPackage");
+
+  // Allow matrices with zero diagonals to be solved
+  ierr = PCFactorSetShiftType(pc, MAT_SHIFT_NONZERO);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorSetShiftType");
+  ierr = PCFactorSetShiftAmount(pc, PETSC_DECIDE);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorSetShiftAmount");
+}
+//-----------------------------------------------------------------------------
+void PETScLUSolver::set_petsc_operators()
+{
+  dolfin_assert(_matA->mat());
+
+  PetscErrorCode ierr;
+
+  #if PETSC_VERSION_RELEASE
+  // Get some parameters
+  const bool reuse_fact   = parameters["reuse_factorization"];
+  const bool same_pattern = parameters["same_nonzero_pattern"];
+
+  // Set operators with appropriate preconditioner option
+
+  if (reuse_fact)
+  {
+    ierr = KSPSetOperators(_ksp, _matA->mat(), _matA->mat(), SAME_PRECONDITIONER);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOperators");
+  }
+  else if (same_pattern)
+  {
+    ierr = KSPSetOperators(_ksp, _matA->mat(), _matA->mat(), SAME_NONZERO_PATTERN);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOperators");
+  }
+  else
+  {
+    ierr = KSPSetOperators(_ksp, _matA->mat(), _matA->mat(),
+                           DIFFERENT_NONZERO_PATTERN);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOperators");
+  }
+  #else
+  ierr = KSPSetOperators(_ksp, _matA->mat(), _matA->mat());
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPSetOperators");
+  #endif
+}
+//-----------------------------------------------------------------------------
+void PETScLUSolver::pre_report(const PETScMatrix& A) const
+{
+  PetscErrorCode ierr;
+
+  const MatSolverPackage solver_type;
+  PC pc;
+  ierr = KSPGetPC(_ksp, &pc);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+
+  ierr = PCFactorGetMatSolverPackage(pc, &solver_type);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorGetMatSolverPackage");
+
+  // Get parameter
+  const bool report = parameters["report"];
+
+  if (report && dolfin::MPI::rank(MPI_COMM_WORLD) == 0)
+  {
+    log(PROGRESS,"Solving linear system of size %d x %d (PETSc LU solver, %s).",
+        A.size(0), A.size(1), solver_type);
+  }
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/la/PETScLUSolver.h b/dolfin/la/PETScLUSolver.h
new file mode 100644
index 0000000..c3a1d6c
--- /dev/null
+++ b/dolfin/la/PETScLUSolver.h
@@ -0,0 +1,156 @@
+// Copyright (C) 2005-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2009-2010.
+//
+// First added:  2005
+// Last changed: 2011-10-19
+
+#ifndef __DOLFIN_PETSC_LU_SOLVER_H
+#define __DOLFIN_PETSC_LU_SOLVER_H
+
+#ifdef HAS_PETSC
+
+#include <map>
+#include <memory>
+#include <petscksp.h>
+#include <petscpc.h>
+#include "GenericLUSolver.h"
+#include "PETScObject.h"
+
+namespace dolfin
+{
+  /// Forward declarations
+  class GenericLinearOperator;
+  class GenericVector;
+  class PETScLinearOperator;
+  class PETScMatrix;
+  class PETScVector;
+  class PETScSNESSolver;
+
+  /// This class implements the direct solution (LU factorization) for
+  /// linear systems of the form Ax = b. It is a wrapper for the LU
+  /// solver of PETSc.
+
+  class PETScLUSolver : public GenericLUSolver, public PETScObject
+  {
+  public:
+
+    /// Constructor
+    PETScLUSolver(std::string method="default");
+
+    /// Constructor
+    PETScLUSolver(std::shared_ptr<const PETScMatrix> A,
+                  std::string method="default");
+
+    /// Destructor
+    ~PETScLUSolver();
+
+    /// Set operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Set operator (matrix)
+    void set_operator(std::shared_ptr<const PETScMatrix> A);
+
+    /// Get operator (matrix)
+    const GenericLinearOperator& get_operator() const;
+
+    /// Solve linear system Ax = b
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(GenericVector& x, const GenericVector& b,
+                      bool transpose);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                      const GenericVector& b);
+
+    /// Solve linear system Ax = b
+    std::size_t solve(const PETScMatrix& A, PETScVector& x,
+                      const PETScVector& b);
+
+    /// Solve linear system A^Tx = b
+    std::size_t solve_transpose(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system A^Tx = b
+    std::size_t solve_transpose(const GenericLinearOperator& A,
+                                GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system A^Tx = b
+    std::size_t solve_transpose(const PETScMatrix& A, PETScVector& x,
+                                const PETScVector& b);
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Return PETSc KSP pointer
+    KSP ksp() const;
+
+    /// Return a list of available solver methods
+    static std::vector<std::pair<std::string, std::string> > methods();
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+    friend class PETScSNESSolver;
+
+  private:
+
+    const MatSolverPackage _solver_package;
+
+    // Available LU solvers
+    static const std::map<std::string, const MatSolverPackage> _methods;
+
+    // Whether those solvers support Cholesky
+    static const std::map<const MatSolverPackage, const bool> _methods_cholesky;
+
+    // Available LU solvers descriptions
+    static const std::vector<std::pair<std::string, std::string> >
+      _methods_descr;
+
+    // Select LU solver type
+    const MatSolverPackage select_solver(std::string& method) const;
+
+    // Does an LU solver support Cholesky?
+    bool solver_has_cholesky(const MatSolverPackage package) const;
+
+    // Initialise solver
+    void init_solver(std::string& method);
+
+    // Configure PETSc options
+    void configure_ksp(const MatSolverPackage solver_package);
+
+    // Set PETSc operators
+    void set_petsc_operators();
+
+    // Print pre-solve report
+    void pre_report(const PETScMatrix& A) const;
+
+    /// PETSc solver pointer
+    KSP _ksp;
+
+    // Operator (the matrix)
+    std::shared_ptr<const PETScMatrix> _matA;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScLinearOperator.cpp b/dolfin/la/PETScLinearOperator.cpp
new file mode 100644
index 0000000..ad9d7cd
--- /dev/null
+++ b/dolfin/la/PETScLinearOperator.cpp
@@ -0,0 +1,146 @@
+// Copyright (C) 2005-2006 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Andy R. Terrel 2005
+//
+// First added:  2005-01-17
+// Last changed: 2010-08-28
+
+#ifdef HAS_PETSC
+
+#include <iostream>
+#include <petscmat.h>
+#include <memory>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/types.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/MPI.h>
+#include "PETScVector.h"
+#include "PETScLinearOperator.h"
+
+using namespace dolfin;
+
+// Callback function for PETSc mult function
+namespace dolfin
+{
+  int usermult(Mat A, Vec x, Vec y)
+  {
+    // Wrap PETSc Vec as dolfin::PETScVector
+    PETScVector _x(x);
+    PETScVector _y(y);
+
+    // Extract pointer to PETScLinearOperator
+    void* ctx = 0;
+    MatShellGetContext(A, &ctx);
+    PETScLinearOperator* _matA = ((PETScLinearOperator*) ctx);
+
+    // Call user-defined mult function through wrapper
+    dolfin_assert(_matA);
+    GenericLinearOperator* wrapper = _matA->wrapper();
+    dolfin_assert(wrapper);
+    wrapper->mult(_x, _y);
+
+    return 0;
+  }
+}
+
+//-----------------------------------------------------------------------------
+PETScLinearOperator::PETScLinearOperator() : _wrapper(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScLinearOperator::size(std::size_t dim) const
+{
+  return PETScBaseMatrix::size(dim);
+}
+//-----------------------------------------------------------------------------
+void PETScLinearOperator::mult(const GenericVector& x, GenericVector& y) const
+{
+  dolfin_not_implemented();
+}
+//-----------------------------------------------------------------------------
+std::string PETScLinearOperator::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+  {
+    warning("Verbose output for PETScLinearOperator not implemented.");
+    s << str(false);
+  }
+  else
+  {
+    s << "<PETScLinearOperator of size "
+      << PETScBaseMatrix::size(0)
+      << " x "
+      << PETScBaseMatrix::size(1) << ">";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+const GenericLinearOperator* PETScLinearOperator::wrapper() const
+{
+  return _wrapper;
+}
+//-----------------------------------------------------------------------------
+GenericLinearOperator* PETScLinearOperator::wrapper()
+{
+  return _wrapper;
+}
+//-----------------------------------------------------------------------------
+void PETScLinearOperator::init_layout(const GenericVector& x,
+				      const GenericVector& y,
+				      GenericLinearOperator* wrapper)
+{
+  // Store wrapper
+  _wrapper = wrapper;
+
+  // Get global dimension
+  const std::size_t M = y.size();
+  const std::size_t N = x.size();
+
+  // Get local range
+  std::size_t m_local = M;
+  std::size_t n_local = N;
+  if (MPI::size(MPI_COMM_WORLD) > 1)
+  {
+    std::pair<std::size_t, std::size_t> local_range_x = x.local_range();
+    std::pair<std::size_t, std::size_t> local_range_y = y.local_range();
+    m_local = local_range_y.second - local_range_y.first;
+    n_local = local_range_x.second - local_range_x.first;
+  }
+
+  // Initialize PETSc matrix
+  PetscErrorCode ierr;
+  if (_matA)
+    MatDestroy(&_matA);
+
+  // Create shell matrix
+  ierr = MatCreateShell(PETSC_COMM_WORLD, m_local, n_local, M, N,
+                        (void*) this, &_matA);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatCreateShell");
+
+  // Incrase reference count
+  PetscObjectReference((PetscObject)_matA);
+
+  ierr = MatShellSetOperation(_matA, MATOP_MULT, (void (*)()) usermult);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatShellSetOperation");
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/PETScLinearOperator.h b/dolfin/la/PETScLinearOperator.h
new file mode 100644
index 0000000..3b108ca
--- /dev/null
+++ b/dolfin/la/PETScLinearOperator.h
@@ -0,0 +1,86 @@
+// Copyright (C) 2005-2012 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Andy R. Terrel 2005
+//
+// First added:  2005-01-17
+// Last changed: 2012-12-11
+
+#ifndef __PETSC_LINEAR_OPERATOR_H
+#define __PETSC_LINEAR_OPERATOR_H
+
+#ifdef HAS_PETSC
+
+#include <string>
+#include <dolfin/common/types.h>
+#include "PETScBaseMatrix.h"
+#include "GenericLinearOperator.h"
+
+namespace dolfin
+{
+
+  class PETScVector;
+
+  // This is the PETSc version of the _GenericLinearOperator_
+  // (matrix-free) interface for the solution of linear systems
+  // defined in terms of the action (matrix-vector product) of a
+  // linear operator.
+
+  class PETScLinearOperator : public PETScBaseMatrix,
+    public GenericLinearOperator
+  {
+  public:
+
+    /// Constructor
+    PETScLinearOperator();
+
+    //--- Implementation of the GenericLinearOperator interface ---
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const;
+
+    /// Compute matrix-vector product y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    //--- Special functions ---
+
+    /// Return pointer to wrapper (const version)
+    virtual const GenericLinearOperator* wrapper() const;
+
+    /// Return pointer to wrapper (const version)
+    virtual GenericLinearOperator* wrapper();
+
+  protected:
+
+    // Initialization
+    void init_layout(const GenericVector& x,
+		     const GenericVector& y,
+		     GenericLinearOperator* wrapper);
+
+    // Pointer to wrapper
+    GenericLinearOperator* _wrapper;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScMatrix.cpp b/dolfin/la/PETScMatrix.cpp
new file mode 100644
index 0000000..89a2369
--- /dev/null
+++ b/dolfin/la/PETScMatrix.cpp
@@ -0,0 +1,668 @@
+// Copyright (C) 2004-2012 Johan Hoffman, Johan Jansson and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2005-2009.
+// Modified by Andy R. Terrel 2005.
+// Modified by Ola Skavhaug 2007-2009.
+// Modified by Magnus Vikstrøm 2007-2008.
+// Modified by Fredrik Valdmanis 2011-2012
+// Modified by Jan Blechta 2013
+//
+// First added:  2004
+// Last changed: 2013-09-24
+
+#ifdef HAS_PETSC
+
+#include <iostream>
+#include <sstream>
+#include <iomanip>
+#include <boost/assign/list_of.hpp>
+
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/MPI.h>
+#include "PETScVector.h"
+#include "PETScMatrix.h"
+#include "GenericSparsityPattern.h"
+#include "SparsityPattern.h"
+#include "TensorLayout.h"
+#include "PETScFactory.h"
+#include "PETScCuspFactory.h"
+
+using namespace dolfin;
+
+const std::map<std::string, NormType> PETScMatrix::norm_types
+  = boost::assign::map_list_of("l1",        NORM_1)
+                              ("linf",      NORM_INFINITY)
+                              ("frobenius", NORM_FROBENIUS);
+
+//-----------------------------------------------------------------------------
+PETScMatrix::PETScMatrix(bool use_gpu) : PETScBaseMatrix(NULL),
+                                         _use_gpu(use_gpu)
+{
+#ifndef HAS_PETSC_CUSP
+  if (use_gpu)
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "create GPU matrix",
+                 "PETSc not compiled with Cusp support");
+  }
+#endif
+
+  // Do nothing else
+}
+//-----------------------------------------------------------------------------
+PETScMatrix::PETScMatrix(Mat A) : PETScBaseMatrix(A), _use_gpu(false)
+{
+  // Do nothing (reference count to A is incremented in base class)
+}
+//-----------------------------------------------------------------------------
+PETScMatrix::PETScMatrix(const PETScMatrix& A) : PETScBaseMatrix(NULL),
+                                                 _use_gpu(false)
+{
+  if (A.mat())
+  {
+    PetscErrorCode ierr = MatDuplicate(A.mat(), MAT_COPY_VALUES, &_matA);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatDuplicate");
+  }
+}
+//-----------------------------------------------------------------------------
+PETScMatrix::~PETScMatrix()
+{
+  // Do nothing (PETSc matrix is destroyed in base class)
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericMatrix> PETScMatrix::copy() const
+{
+  return std::shared_ptr<GenericMatrix>(new PETScMatrix(*this));
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::init(const TensorLayout& tensor_layout)
+{
+  PetscErrorCode ierr;
+
+  // Get global dimensions and local range
+  dolfin_assert(tensor_layout.rank() == 2);
+  const std::size_t M = tensor_layout.size(0);
+  const std::size_t N = tensor_layout.size(1);
+  const std::pair<std::size_t, std::size_t> row_range
+    = tensor_layout.local_range(0);
+  const std::pair<std::size_t, std::size_t> col_range
+    = tensor_layout.local_range(1);
+  const std::size_t m = row_range.second - row_range.first;
+  const std::size_t n = col_range.second - col_range.first;
+
+  // Get sparsity pattern
+  dolfin_assert(tensor_layout.sparsity_pattern());
+  const GenericSparsityPattern& sparsity_pattern
+    = *tensor_layout.sparsity_pattern();
+
+  if (_matA)
+  {
+    #ifdef DOLFIN_DEPRECATION_ERROR
+    error("PETScMatrix may not be initialized more than once. Remove build definiton -DDOLFIN_DEPRECATION_ERROR to change this to a warning.");
+    #else
+    warning("PETScMatrix may not be initialized more than once. In version > 1.4, this will become an error.");
+    #endif
+    MatDestroy(&_matA);
+  }
+
+  // Initialize matrix
+  if (row_range.first == 0 && row_range.second == M)
+  {
+    // Get number of nonzeros for each row from sparsity pattern
+    dolfin_assert(tensor_layout.sparsity_pattern());
+    std::vector<std::size_t> num_nonzeros(M);
+    sparsity_pattern.num_nonzeros_diagonal(num_nonzeros);
+
+    // Create matrix
+    ierr = MatCreate(PETSC_COMM_SELF, &_matA);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatCreate");
+
+    // Set size
+    ierr = MatSetSizes(_matA, M, N, M, N);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetSizes");
+
+    // Set matrix type according to chosen architecture
+    if (!_use_gpu)
+    {
+      ierr = MatSetType(_matA, MATSEQAIJ);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetType");
+    }
+    #ifdef HAS_PETSC_CUSP
+    else
+    {
+      ierr = MatSetType(_matA, MATSEQAIJCUSP);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetType");
+    }
+    #endif
+
+    // Set block size
+    if (tensor_layout.block_size > 1)
+    {
+     ierr =  MatSetBlockSize(_matA, tensor_layout.block_size);
+     if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetBlockSize");
+    }
+
+    // FIXME: Change to MatSeqAIJSetPreallicationCSR for improved performance?
+
+    // Allocate space (using data from sparsity pattern)
+
+    // Copy number of non-zeros to PetscInt type
+    const std::vector<PetscInt> _num_nonzeros(num_nonzeros.begin(),
+                                              num_nonzeros.end());
+    ierr = MatSeqAIJSetPreallocation(_matA, 0, _num_nonzeros.data());
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatSeqAIJSetPreallocation");
+
+    // Set column indices
+    /*
+    const std::vector<std::vector<std::size_t> > _column_indices
+        = sparsity_pattern.diagonal_pattern(SparsityPattern::sorted);
+    std::vector<int> column_indices;
+    column_indices.reserve(sparsity_pattern.num_nonzeros());
+    for (std::size_t i = 0; i < _column_indices.size(); ++i)
+    {
+      //cout << "Row: " << i << endl;
+      //for (std::size_t j = 0; j < _column_indices[i].size(); ++j)
+      //  cout << "  Col: " << _column_indices[i][j] << endl;
+      column_indices.insert(column_indices.end(), _column_indices[i].begin(), _column_indices[i].end());
+    }
+    MatSeqAIJSetColumnIndices(_matA, &column_indices[0]);
+    */
+  }
+  else
+  {
+    if (_use_gpu)
+    {
+      not_working_in_parallel("Due to limitations in PETSc, "
+                              "distributed PETSc Cusp matrices");
+    }
+
+    // FIXME: Try using MatStashSetInitialSize to optimise performance
+
+    // Get number of nonzeros for each row from sparsity pattern
+    std::vector<std::size_t> num_nonzeros_diagonal;
+    std::vector<std::size_t> num_nonzeros_off_diagonal;
+    sparsity_pattern.num_nonzeros_diagonal(num_nonzeros_diagonal);
+    sparsity_pattern.num_nonzeros_off_diagonal(num_nonzeros_off_diagonal);
+
+    // Create matrix
+    ierr = MatCreate(PETSC_COMM_WORLD, &_matA);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatCreate");
+
+    // Set size
+    ierr = MatSetSizes(_matA, m, n, M, N);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetSizes");
+
+    // Set matrix type
+    ierr = MatSetType(_matA, MATMPIAIJ);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetType");
+
+    // Set block size
+    if (tensor_layout.block_size > 1)
+    {
+      ierr = MatSetBlockSize(_matA, tensor_layout.block_size);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetBlockSize");
+    }
+    // Allocate space (using data from sparsity pattern)
+    const std::vector<PetscInt>
+      _num_nonzeros_diagonal(num_nonzeros_diagonal.begin(),
+                             num_nonzeros_diagonal.end());
+    const std::vector<PetscInt>
+      _num_nonzeros_off_diagonal(num_nonzeros_off_diagonal.begin(),
+                                 num_nonzeros_off_diagonal.end());
+    ierr = MatMPIAIJSetPreallocation(_matA, 0, _num_nonzeros_diagonal.data(),
+                                     0, _num_nonzeros_off_diagonal.data());
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatMPIAIJSetPreallocation");
+  }
+
+  // Set some options
+
+  // Do not allow more entries than have been pre-allocated
+  ierr = MatSetOption(_matA, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_TRUE);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetOption");
+
+  ierr = MatSetOption(_matA, MAT_KEEP_NONZERO_PATTERN, PETSC_TRUE);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetOption");
+
+  ierr = MatSetFromOptions(_matA);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetFromOptions");
+
+  #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR > 2
+  ierr = MatSetUp(_matA);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetUp");
+  #endif
+}
+//-----------------------------------------------------------------------------
+bool PETScMatrix::empty() const
+{
+  return _matA ? false : true;
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::get(double* block,
+                      std::size_t m, const dolfin::la_index* rows,
+                      std::size_t n, const dolfin::la_index* cols) const
+{
+  // Get matrix entries (must be on this process)
+  dolfin_assert(_matA);
+  PetscErrorCode ierr = MatGetValues(_matA, m, rows, n, cols, block);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatGetValues");
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::set(const double* block,
+                      std::size_t m, const dolfin::la_index* rows,
+                      std::size_t n, const dolfin::la_index* cols)
+{
+  dolfin_assert(_matA);
+  PetscErrorCode ierr = MatSetValues(_matA, m, rows, n, cols, block,
+                                    INSERT_VALUES);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetValues");
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::add(const double* block,
+                      std::size_t m, const dolfin::la_index* rows,
+                      std::size_t n, const dolfin::la_index* cols)
+{
+  dolfin_assert(_matA);
+  PetscErrorCode ierr = MatSetValues(_matA, m, rows, n, cols, block, ADD_VALUES);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatSetValues");
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::axpy(double a, const GenericMatrix& A,
+                       bool same_nonzero_pattern)
+{
+  PetscErrorCode ierr;
+
+  const PETScMatrix* AA = &as_type<const PETScMatrix>(A);
+  dolfin_assert(_matA);
+  dolfin_assert(AA->mat());
+  if (same_nonzero_pattern)
+  {
+    ierr = MatAXPY(_matA, a, AA->mat(), SAME_NONZERO_PATTERN);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatAXPY");
+  }
+  else
+  {
+    ierr = MatAXPY(_matA, a, AA->mat(), DIFFERENT_NONZERO_PATTERN);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatAXPY");
+  }
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::getrow(std::size_t row, std::vector<std::size_t>& columns,
+                         std::vector<double>& values) const
+{
+  dolfin_assert(_matA);
+
+  PetscErrorCode ierr;
+  const PetscInt *cols = 0;
+  const double *vals = 0;
+  PetscInt ncols = 0;
+  ierr = MatGetRow(_matA, row, &ncols, &cols, &vals);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatGetRow");
+
+  // Assign values to std::vectors
+  columns.assign(cols, cols + ncols);
+  values.assign(vals, vals + ncols);
+
+  ierr = MatRestoreRow(_matA, row, &ncols, &cols, &vals);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatRestorRow");
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::setrow(std::size_t row,
+                         const std::vector<std::size_t>& columns,
+                         const std::vector<double>& values)
+{
+  dolfin_assert(_matA);
+
+  // Check size of arrays
+  if (columns.size() != values.size())
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "set row of values for PETSc matrix",
+                 "Number of columns and values don't match");
+  }
+
+  // Handle case n = 0
+  const PetscInt n = columns.size();
+  if (n == 0)
+    return;
+
+  // Set values
+  const PetscInt _row = row;
+  const std::vector<PetscInt> _columns(columns.begin(), columns.end());
+  set(&values[0], 1, &_row, n, _columns.data());
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::zero(std::size_t m, const dolfin::la_index* rows)
+{
+  dolfin_assert(_matA);
+
+  PetscErrorCode ierr;
+  IS is = 0;
+  PetscScalar null = 0.0;
+  const PetscInt _m = m;
+  ierr = ISCreateGeneral(PETSC_COMM_SELF, _m, rows, PETSC_COPY_VALUES, &is);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "ISCreateGeneral");
+  ierr = MatZeroRowsIS(_matA, is, null, NULL, NULL);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatZeroRowsIS");
+  ierr = ISDestroy(&is);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "ISDestroy");
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::ident(std::size_t m, const dolfin::la_index* rows)
+{
+  dolfin_assert(_matA);
+
+  PetscErrorCode ierr;
+  IS is = 0;
+  PetscScalar one = 1.0;
+  const PetscInt _m = m;
+  ierr = ISCreateGeneral(PETSC_COMM_SELF, _m, rows, PETSC_COPY_VALUES, &is);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "ISCreateGeneral");
+  ierr = MatZeroRowsIS(_matA, is, one, NULL, NULL);
+  if (ierr == PETSC_ERR_ARG_WRONGSTATE)
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "set given rows to identity matrix",
+                 "some diagonal elements not preallocated "
+                 "(try assembler option keep_diagonal)");
+  }
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatZeroRowsIS");
+
+  ierr = ISDestroy(&is);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "ISDestroy");
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::mult(const GenericVector& x, GenericVector& y) const
+{
+  dolfin_assert(_matA);
+
+  const PETScVector& xx = as_type<const PETScVector>(x);
+  PETScVector& yy = as_type<PETScVector>(y);
+
+  if (size(1) != xx.size())
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "compute matrix-vector product with PETSc matrix",
+                 "Non-matching dimensions for matrix-vector product");
+  }
+
+  // Resize RHS if empty
+  if (yy.size() == 0)
+    init_vector(yy, 0);
+
+  if (size(0) != yy.size())
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "compute matrix-vector product with PETSc matrix",
+                 "Vector for matrix-vector result has wrong size");
+  }
+
+  PetscErrorCode ierr = MatMult(_matA, xx.vec(), yy.vec());
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatMult");
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::transpmult(const GenericVector& x, GenericVector& y) const
+{
+  dolfin_assert(_matA);
+
+  const PETScVector& xx = as_type<const PETScVector>(x);
+  PETScVector& yy = as_type<PETScVector>(y);
+
+  if (size(0) != xx.size())
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "compute transpose matrix-vector product with PETSc matrix",
+                 "Non-matching dimensions for transpose matrix-vector product");
+  }
+
+  // Resize RHS if empty
+  if (yy.size() == 0)
+    init_vector(yy, 1);
+
+  if (size(1) != yy.size())
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "compute transpose matrix-vector product with PETSc matrix",
+                 "Vector for transpose matrix-vector result has wrong size");
+  }
+
+  PetscErrorCode ierr = MatMultTranspose(_matA, xx.vec(), yy.vec());
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatMultTranspose");
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::set_diagonal(const GenericVector& x)
+{
+  dolfin_assert(_matA);
+
+  const PETScVector& xx = x.down_cast<PETScVector>();
+  if (size(1) != size(0) || size(0) != xx.size())
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "set diagonal of a PETSc matrix",
+                 "Matrix and vector dimensions don't match for matrix-vector set");
+  }
+
+  PetscErrorCode ierr = MatDiagonalSet(_matA, xx.vec(), INSERT_VALUES);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatDiagonalSet");
+  apply("insert");
+}
+//-----------------------------------------------------------------------------
+double PETScMatrix::norm(std::string norm_type) const
+{
+  dolfin_assert(_matA);
+
+  // Check that norm is known
+  if (norm_types.count(norm_type) == 0)
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "compute norm of PETSc matrix",
+                 "Unknown norm type (\"%s\")", norm_type.c_str());
+  }
+
+  double value = 0.0;
+  PetscErrorCode ierr = MatNorm(_matA, norm_types.find(norm_type)->second,
+                                &value);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatNorm");
+  return value;
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::apply(std::string mode)
+{
+  Timer timer("Apply (PETScMatrix)");
+
+  dolfin_assert(_matA);
+  PetscErrorCode ierr;
+  if (mode == "add")
+  {
+    ierr = MatAssemblyBegin(_matA, MAT_FINAL_ASSEMBLY);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatAssemblyBegin");
+    ierr = MatAssemblyEnd(_matA, MAT_FINAL_ASSEMBLY);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatAssemblyEnd");
+  }
+  else if (mode == "insert")
+  {
+    ierr = MatAssemblyBegin(_matA, MAT_FINAL_ASSEMBLY);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatAssemblyBegin");
+    ierr = MatAssemblyEnd(_matA, MAT_FINAL_ASSEMBLY);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatAssemblyEnd");
+  }
+  else if (mode == "flush")
+  {
+    ierr = MatAssemblyBegin(_matA, MAT_FLUSH_ASSEMBLY);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatAssemblyBegin");
+    ierr = MatAssemblyEnd(_matA, MAT_FLUSH_ASSEMBLY);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatAssemblyEnd");
+  }
+  else
+  {
+    dolfin_error("PETScMatrix.cpp",
+                 "apply changes to PETSc matrix",
+                 "Unknown apply mode \"%s\"", mode.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+MPI_Comm PETScMatrix::mpi_comm() const
+{
+  dolfin_assert(_matA);
+  MPI_Comm mpi_comm = MPI_COMM_NULL;
+  PetscObjectGetComm((PetscObject)_matA, &mpi_comm);
+  return mpi_comm;
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::zero()
+{
+  dolfin_assert(_matA);
+  PetscErrorCode ierr = MatZeroEntries(_matA);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatZeroEntries");
+}
+//-----------------------------------------------------------------------------
+const PETScMatrix& PETScMatrix::operator*= (double a)
+{
+  dolfin_assert(_matA);
+  PetscErrorCode ierr = MatScale(_matA, a);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatScale");
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScMatrix& PETScMatrix::operator/= (double a)
+{
+  dolfin_assert(_matA);
+  MatScale(_matA, 1.0/a);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const GenericMatrix& PETScMatrix::operator= (const GenericMatrix& A)
+{
+  *this = as_type<const PETScMatrix>(A);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+bool PETScMatrix::is_symmetric(double tol) const
+{
+  dolfin_assert(_matA);
+  PetscBool symmetric = PETSC_FALSE;
+  PetscErrorCode ierr = MatIsSymmetric(_matA, tol, &symmetric);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatIsSymmetric");
+  return symmetric == PETSC_TRUE ? true : false;
+}
+//-----------------------------------------------------------------------------
+GenericLinearAlgebraFactory& PETScMatrix::factory() const
+{
+  if (!_use_gpu)
+    return PETScFactory::instance();
+  #ifdef HAS_PETSC_CUSP
+  else
+    return PETScCuspFactory::instance();
+  #endif
+
+  // Return something to keep the compiler happy. Code will never be
+  // reached.
+  return PETScFactory::instance();
+}
+//-----------------------------------------------------------------------------
+const PETScMatrix& PETScMatrix::operator= (const PETScMatrix& A)
+{
+  if (!A.mat())
+  {
+    if (_matA)
+    {
+      #ifdef DOLFIN_DEPRECATION_ERROR
+      error("PETScVector may not be initialized more than once. Remove build definiton -DDOLFIN_DEPRECATION_ERROR to change this to a warning. Error is in PETScMatrix::operator=.");
+      #else
+      warning("PETScVector may not be initialized more than once. In version > 1.4, this will become an error. Warning is in PETScMatrix::operator=.");
+      #endif
+      MatDestroy(&_matA);
+    }
+    _matA = NULL;
+  }
+  else if (this != &A) // Check for self-assignment
+  {
+    if (_matA)
+    {
+      // Get reference count to _matA
+      PetscInt ref_count = 0;
+      PetscObjectGetReference((PetscObject)_matA, &ref_count);
+      if (ref_count > 1)
+      {
+        dolfin_error("PETScMatrix.cpp",
+                     "assign to PETSc matrix",
+                     "More than one object points to the underlying PETSc object");
+      }
+      #ifdef DOLFIN_DEPRECATION_ERROR
+      error("PETScMatrix may not be initialized more than once. Remove build definiton -DDOLFIN_DEPRECATION_ERROR to change this to a warning. Error is in PETScMatrix::operator=.");
+      #else
+      warning("PETScMatrix may not be initialized more than once. In version > 1.4, this will become an error. Warning is in PETScMatrix::operator=.");
+      #endif
+      MatDestroy(&_matA);
+    }
+
+    // Duplicate with the same pattern as A.A
+    PetscErrorCode ierr = MatDuplicate(A.mat(), MAT_COPY_VALUES, &_matA);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "MatDuplicate");
+  }
+  return *this;
+}
+//-----------------------------------------------------------------------------
+void PETScMatrix::binary_dump(std::string file_name) const
+{
+  PetscErrorCode ierr;
+
+  PetscViewer view_out;
+  ierr = PetscViewerBinaryOpen(PETSC_COMM_WORLD, file_name.c_str(),
+                               FILE_MODE_WRITE, &view_out);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "PetscViewerBinaryOpen");
+
+  ierr = MatView(_matA, view_out);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatView");
+
+  ierr = PetscViewerDestroy(&view_out);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "PetscViewerDestroy");
+}
+//-----------------------------------------------------------------------------
+std::string PETScMatrix::str(bool verbose) const
+{
+  if (!_matA)
+    return "<Uninitialized PETScMatrix>";
+
+  std::stringstream s;
+  if (verbose)
+  {
+    warning("Verbose output for PETScMatrix not implemented, calling PETSc MatView directly.");
+
+    // FIXME: Maybe this could be an option?
+    dolfin_assert(_matA);
+    PetscErrorCode ierr;
+    if (MPI::size(MPI_COMM_WORLD) > 1)
+    {
+      ierr = MatView(_matA, PETSC_VIEWER_STDOUT_WORLD);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "MatView");
+    }
+    else
+    {
+      ierr = MatView(_matA, PETSC_VIEWER_STDOUT_SELF);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "MatView");
+    }
+  }
+  else
+    s << "<PETScMatrix of size " << size(0) << " x " << size(1) << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/PETScMatrix.h b/dolfin/la/PETScMatrix.h
new file mode 100644
index 0000000..884722d
--- /dev/null
+++ b/dolfin/la/PETScMatrix.h
@@ -0,0 +1,205 @@
+// Copyright (C) 2004-2012 Johan Hoffman, Johan Jansson and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Andy R. Terrel 2005
+// Modified by Garth N. Wells 2006-2009
+// Modified by Kent-Andre Mardal 2008
+// Modified by Ola Skavhaug 2008
+// Modified by Fredrik Valdmanis 2011
+//
+// First added:  2004-01-01
+// Last changed: 2012-08-22
+
+#ifndef __PETSC_MATRIX_H
+#define __PETSC_MATRIX_H
+
+#ifdef HAS_PETSC
+
+#include <map>
+#include <string>
+#include <memory>
+#include <petscmat.h>
+#include <petscsys.h>
+
+#include "GenericMatrix.h"
+#include "PETScBaseMatrix.h"
+
+namespace dolfin
+{
+
+  class PETScVector;
+  class TensorLayout;
+
+  /// This class provides a simple matrix class based on PETSc.
+  /// It is a wrapper for a PETSc matrix pointer (Mat)
+  /// implementing the GenericMatrix interface.
+  ///
+  /// The interface is intentionally simple. For advanced usage,
+  /// access the PETSc Mat pointer using the function mat() and
+  /// use the standard PETSc interface.
+
+  class PETScMatrix : public GenericMatrix, public PETScBaseMatrix
+  {
+  public:
+
+    /// Create empty matrix
+    PETScMatrix(bool use_gpu=false);
+
+    /// Create a wrapper around a PETSc Mat pointer
+    explicit PETScMatrix(Mat A);
+
+    /// Copy constructor
+    PETScMatrix(const PETScMatrix& A);
+
+    /// Destructor
+    virtual ~PETScMatrix();
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Initialize zero tensor using tensor layout
+    void init(const TensorLayout& tensor_layout);
+
+    /// Return true if empty
+    bool empty() const;
+
+    /// Return size of given dimension
+    std::size_t size(std::size_t dim) const
+    { return PETScBaseMatrix::size(dim); }
+
+    /// Return local ownership range
+    std::pair<std::size_t, std::size_t> local_range(std::size_t dim) const
+    { return PETScBaseMatrix::local_range(dim); }
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero();
+
+    /// Finalize assembly of tensor. The following values are recognized
+    /// for the mode parameter:
+    ///
+    ///   add    - corresponds to PETSc MatAssemblyBegin+End(MAT_FINAL_ASSEMBLY)
+    ///   insert - corresponds to PETSc MatAssemblyBegin+End(MAT_FINAL_ASSEMBLY)
+    ///   flush  - corresponds to PETSc MatAssemblyBegin+End(MAT_FLUSH_ASSEMBLY)
+    virtual void apply(std::string mode);
+
+    /// Return MPI communicator
+    MPI_Comm mpi_comm() const;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    //--- Implementation of the GenericMatrix interface --
+
+    /// Return copy of matrix
+    virtual std::shared_ptr<GenericMatrix> copy() const;
+
+    /// Intialize vector z to be compatible with the matrix-vector product
+    /// y = Ax. In the parallel case, both size and layout are
+    /// important.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+    virtual void init_vector(GenericVector& z, std::size_t dim) const
+    { PETScBaseMatrix::init_vector(z, dim); }
+
+    /// Get block of values
+    virtual void get(double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols) const;
+
+    /// Set block of values
+    virtual void set(const double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols);
+
+    /// Add block of values
+    virtual void add(const double* block,
+                     std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols);
+
+    /// Add multiple of given matrix (AXPY operation)
+    virtual void axpy(double a, const GenericMatrix& A,
+                      bool same_nonzero_pattern);
+
+    /// Get non-zero values of given row
+    virtual void getrow(std::size_t row,
+                        std::vector<std::size_t>& columns,
+                        std::vector<double>& values) const;
+
+    /// Set values for given row
+    virtual void setrow(std::size_t row,
+                        const std::vector<std::size_t>& columns,
+                        const std::vector<double>& values);
+
+    /// Set given rows to zero
+    virtual void zero(std::size_t m, const dolfin::la_index* rows);
+
+    /// Set given rows to identity matrix
+    virtual void ident(std::size_t m, const dolfin::la_index* rows);
+
+    // Matrix-vector product, y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const;
+
+    // Matrix-vector product, y = A^T x
+    virtual void transpmult(const GenericVector& x, GenericVector& y) const;
+
+    /// Set diagonal of a matrix
+    virtual void set_diagonal(const GenericVector& x);
+
+    /// Multiply matrix by given number
+    virtual const PETScMatrix& operator*= (double a);
+
+    /// Divide matrix by given number
+    virtual const PETScMatrix& operator/= (double a);
+
+    /// Assignment operator
+    virtual const GenericMatrix& operator= (const GenericMatrix& A);
+
+    /// Test if matrix is symmetric
+    virtual bool is_symmetric(double tol) const;
+
+    //--- Special functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const;
+
+    //--- Special PETScFunctions ---
+
+    /// Return norm of matrix
+    double norm(std::string norm_type) const;
+
+    /// Assignment operator
+    const PETScMatrix& operator= (const PETScMatrix& A);
+
+    /// Dump matrix to PETSc binary format
+    void binary_dump(std::string file_name) const;
+
+  private:
+
+    // PETSc norm types
+    static const std::map<std::string, NormType> norm_types;
+
+    // PETSc matrix architecture
+    const bool _use_gpu;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScObject.h b/dolfin/la/PETScObject.h
new file mode 100644
index 0000000..0e4ca75
--- /dev/null
+++ b/dolfin/la/PETScObject.h
@@ -0,0 +1,59 @@
+// Copyright (C) 2008 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-01-07
+// Last changed: 2011-01-24
+
+#ifndef __PETSC_OBJECT_H
+#define __PETSC_OBJECT_H
+
+#include <string>
+#include <dolfin/common/SubSystemsManager.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  /// This class calls SubSystemsManager to initialise PETSc.
+  ///
+  /// All PETSc objects must be derived from this class.
+
+  class PETScObject
+  {
+  public:
+
+    /// Constructor. Ensures that PETSc has been initialised.
+    PETScObject() { SubSystemsManager::init_petsc(); }
+
+    /// Destructor
+    virtual ~PETScObject() {}
+
+    /// Print error message for PETSc calls that return an error
+    static void petsc_error(int error_code,
+                            std::string filename,
+                            std::string petsc_function)
+    {
+      dolfin_error(filename,
+               "successfully call PETSc function '" + petsc_function + "'",
+                "PETSc error code is: %d", error_code);
+    }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/PETScOptions.cpp b/dolfin/la/PETScOptions.cpp
new file mode 100644
index 0000000..8cecc87
--- /dev/null
+++ b/dolfin/la/PETScOptions.cpp
@@ -0,0 +1,69 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-08-12
+// Last changed:
+
+#ifdef HAS_PETSC
+
+#include "PETScOptions.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void PETScOptions::set(std::string option)
+{
+  set<std::string>(option, "");
+}
+//-----------------------------------------------------------------------------
+void PETScOptions::set(std::string option, bool value)
+{
+  set<bool>(option, value);
+}
+//-----------------------------------------------------------------------------
+void PETScOptions::set(std::string option, int value)
+{
+  set<int>(option, value);
+}
+//-----------------------------------------------------------------------------
+void PETScOptions::set(std::string option, double value)
+{
+  set<double>(option, value);
+}
+//-----------------------------------------------------------------------------
+void PETScOptions::set(std::string option, std::string value)
+{
+  set<std::string>(option, value);
+}
+//-----------------------------------------------------------------------------
+void PETScOptions::clear(std::string option)
+{
+  SubSystemsManager::init_petsc();
+  PetscErrorCode ierr;
+  ierr = PetscOptionsClearValue(option.c_str());
+  if (ierr != 0)
+  {
+    dolfin_error("PETScOptions.cpp",
+                 "clear PETSc option/parameter '" + option + "'",
+                 "PETSc error code is: %d", ierr);
+
+  }
+}
+//-----------------------------------------------------------------------------
+
+
+#endif
diff --git a/dolfin/la/PETScOptions.h b/dolfin/la/PETScOptions.h
new file mode 100644
index 0000000..3c1b6d5
--- /dev/null
+++ b/dolfin/la/PETScOptions.h
@@ -0,0 +1,85 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-08-12
+// Last changed:
+
+#ifndef __DOLFIN_PETSC_OPTIONS_H
+#define __DOLFIN_PETSC_OPTIONS_H
+
+#ifdef HAS_PETSC
+
+#include <string>
+#include <boost/lexical_cast.hpp>
+#include <petscoptions.h>
+#include <dolfin/common/SubSystemsManager.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  /// These class provides static functions that permit users to set
+  /// and retreive PETSc options via the PETSc option/parameter
+  /// system. The option should be prefixed by '-', e.g.
+  ///
+  ///     PETScOptions::set("mat_mumps_icntl_14", 40.0);
+
+  class PETScOptions
+  {
+  public:
+
+    /// Set PETSc option that takes no value
+    static void set(std::string option);
+
+    /// Set PETSc boolean option
+    static void set(std::string option, bool value);
+
+    /// Set PETSc integer option
+    static void set(std::string option, int value);
+
+    /// Set PETSc double option
+    static void set(std::string option, double value);
+
+    /// Set PETSc string option
+    static void set(std::string option, std::string value);
+
+    /// Genetic function for setting PETSc option
+    template<typename T>
+      static void set(std::string option, const T value)
+    {
+      SubSystemsManager::init_petsc();
+
+      PetscErrorCode ierr;
+      std::string _option = "-" + option;
+      ierr = PetscOptionsSetValue(_option.c_str(),
+                           boost::lexical_cast<std::string>(value).c_str());
+      if (ierr != 0)
+      {
+        dolfin_error("PETScOptions.h",
+                     "set PETSc option/parameter '" + option + "'",
+                     "PETSc error code is: %d", ierr);
+      }
+    }
+
+    /// Clear PETSc option
+    static void clear(std::string option);
+
+  };
+}
+
+#endif
+#endif
diff --git a/dolfin/la/PETScPreconditioner.cpp b/dolfin/la/PETScPreconditioner.cpp
new file mode 100644
index 0000000..7844b73
--- /dev/null
+++ b/dolfin/la/PETScPreconditioner.cpp
@@ -0,0 +1,795 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2010-2012
+//
+// First added:  2010-02-25
+// Last changed: 2012-04-11
+
+#ifdef HAS_PETSC
+
+#include <boost/assign/list_of.hpp>
+#include <boost/lexical_cast.hpp>
+#include <petscksp.h>
+#include <petscmat.h>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/log/dolfin_log.h>
+#include "GenericVector.h"
+#include "KrylovSolver.h"
+#include "PETScKrylovSolver.h"
+#include "PETScVector.h"
+#include "VectorSpaceBasis.h"
+#include "PETScPreconditioner.h"
+
+using namespace dolfin;
+
+// Mapping from preconditioner string to PETSc
+const std::map<std::string, const PCType> PETScPreconditioner::_methods
+  = boost::assign::map_list_of("default",          "")
+                              ("none",             PCNONE)
+                              ("ilu",              PCILU)
+                              ("icc",              PCICC)
+                              ("jacobi",           PCJACOBI)
+                              ("bjacobi",          PCBJACOBI)
+                              ("sor",              PCSOR)
+                              ("additive_schwarz", PCASM)
+                              #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR > 2
+                              ("petsc_amg",        PCGAMG)
+                              #endif
+                              #if PETSC_HAVE_HYPRE
+                              ("hypre_amg",        PCHYPRE)
+                              ("hypre_euclid",     PCHYPRE)
+                              ("hypre_parasails",  PCHYPRE)
+                              #endif
+                              #if PETSC_HAVE_ML
+                              ("amg",              PCML)
+                              ("ml_amg",           PCML)
+                              #elif PETSC_HAVE_HYPRE
+                              ("amg",              PCHYPRE)
+                              #endif
+                              ;
+
+// Mapping from preconditioner string to description string
+const std::vector<std::pair<std::string, std::string> >
+PETScPreconditioner::_methods_descr
+  = boost::assign::pair_list_of
+    ("default",          "default preconditioner")
+    ("none",             "No preconditioner")
+    ("ilu",              "Incomplete LU factorization")
+    ("icc",              "Incomplete Cholesky factorization")
+    ("sor",              "Successive over-relaxation")
+    #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR > 2
+    ("petsc_amg",        "PETSc algebraic multigrid")
+    #endif
+    #if HAS_PETSC_CUSP
+    ("jacobi",           "Jacobi iteration (GPU enabled)")
+    ("bjacobi",          "Block Jacobi iteration (GPU enabled)")
+    ("additive_schwarz", "Additive Schwarz (GPU enabled)")
+    #else
+    ("jacobi",           "Jacobi iteration")
+    ("bjacobi",          "Block Jacobi iteration")
+    ("additive_schwarz", "Additive Schwarz")
+    #endif
+    #if PETSC_HAVE_HYPRE
+    ("amg",              "Algebraic multigrid")
+    ("hypre_amg",        "Hypre algebraic multigrid (BoomerAMG)")
+    ("hypre_euclid",     "Hypre parallel incomplete LU factorization")
+    ("hypre_parasails",  "Hypre parallel sparse approximate inverse")
+    #endif
+    #if PETSC_HAVE_ML
+    ("ml_amg",           "ML algebraic multigrid")
+    #endif
+    ;
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+PETScPreconditioner::preconditioners()
+{
+  return PETScPreconditioner::_methods_descr;
+}
+//-----------------------------------------------------------------------------
+Parameters PETScPreconditioner::default_parameters()
+{
+  Parameters p(KrylovSolver::default_parameters()("preconditioner"));
+  p.rename("petsc_preconditioner");
+
+  // General parameters
+  //p.add("view", false);
+
+  // Generic multigrid parameters
+  Parameters p_mg("mg");
+  p_mg.add<std::size_t>("num_levels");
+  p_mg.add<std::size_t>("num_sweeps");
+  p.add(p_mg);
+
+  // ML package parameters
+  Parameters p_ml("ml");
+  p_ml.add<std::size_t>("print_level", 0, 10);
+  p_ml.add<std::string>("cycle_type", boost::assign::list_of("v")("w"));
+  p_ml.add<std::size_t>("max_num_levels");
+  p_ml.add<std::size_t>("max_coarse_size");
+  p_ml.add<double>("aggregation_damping_factor");
+  p_ml.add<double>("threshold");
+  p_ml.add<bool>("use_spectral_Anorm");
+  p_ml.add<int>("energy_minimization", -1, 4);
+  p_ml.add<double>("energy_minimization_threshold");
+  p_ml.add<double>("auxiliary_threshold");
+  p_ml.add<bool>("repartition");
+  p_ml.add<std::string>("repartition_type",
+                        boost::assign::list_of("Zoltan")("ParMETIS"));
+  p_ml.add<std::string>("zoltan_repartition_scheme",
+               boost::assign::list_of("RCB")("hypergraph")("fast_hypergraph"));
+  p_ml.add<std::string>("aggregation_scheme",
+            boost::assign::list_of("Uncoupled")("Coupled")("MIS")("METIS"));
+  p.add(p_ml);
+
+  // PETSc GAMG parameters
+  Parameters p_gamg("gamg");
+  p_gamg.add<std::size_t>("verbose");
+  p_gamg.add("num_aggregation_smooths", 1);
+  p_gamg.add<double>("threshold");
+  p_gamg.add<std::size_t>("max_coarse_size");
+  p_gamg.add<std::size_t>("max_process_coarse_size");
+  p_gamg.add<bool>("repartition");
+  p_gamg.add<bool>("square_graph");
+  p_gamg.add<bool>("symmetrize_graph");
+  p_gamg.add<std::size_t>("max_num_levels");
+  p.add(p_gamg);
+
+  // Hypre/ParaSails parameters
+  Parameters p_parasails("parasails");
+  p_parasails.add<double>("threshold");
+  p_parasails.add<std::size_t>("levels");
+
+  // Hypre/BoomerAMG parameters
+  Parameters p_boomeramg("BoomerAMG");
+  p_boomeramg.add<std::string>("cycle_type"); // "V" or "W"
+  p_boomeramg.add<std::size_t>("max_levels");
+  p_boomeramg.add<double>("strong_threshold");
+  p_boomeramg.add<double>("relaxation_weight");
+  p_boomeramg.add<std::size_t>("agressive_coarsening_levels");
+  p_boomeramg.add<std::string>("relax_type_coarse");
+
+  // Hypre package parameters
+  Parameters p_hypre("hypre");
+  p_hypre.add(p_parasails);
+  p_hypre.add(p_boomeramg);
+  p.add(p_hypre);
+
+  // Prefix for setting options
+  p.add("options_prefix", "default");
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+PETScPreconditioner::PETScPreconditioner(std::string type)
+  : _type(type), petsc_near_nullspace(NULL), gdim(0)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  // Check that the requested method is known
+  if (_methods.count(type) == 0)
+  {
+    dolfin_error("PETScPreconditioner.cpp",
+                 "create PETSc preconditioner",
+                 "Unknown preconditioner type (\"%s\")", type.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+PETScPreconditioner::~PETScPreconditioner()
+{
+  if (petsc_near_nullspace)
+    MatNullSpaceDestroy(&petsc_near_nullspace);
+}
+//-----------------------------------------------------------------------------
+void PETScPreconditioner::set(PETScKrylovSolver& solver)
+{
+  PetscErrorCode ierr;
+  dolfin_assert(solver.ksp());
+
+  // Get PETSc PC pointer
+  PC pc;
+  ierr = KSPGetPC(solver.ksp(), &pc);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+
+  // Treat special cases  first
+  if (_type.find("hypre") != std::string::npos)
+  {
+    #if PETSC_HAVE_HYPRE
+    ierr = PCSetType(pc, PCHYPRE);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetType");
+
+    ierr = PCFactorSetShiftType(pc, MAT_SHIFT_NONZERO);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorSetShiftType");
+    ierr = PCFactorSetShiftAmount(pc, PETSC_DECIDE);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorSetShiftAmount");
+
+    if (_type == "hypre_amg" || _type == "amg")
+    {
+      ierr = PCHYPRESetType(pc, "boomeramg");
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCHYPRESetType");
+      if (parameters("mg")["num_sweeps"].is_set())
+      {
+        const std::size_t num_sweeps = parameters("mg")["num_sweeps"];
+        PetscOptionsSetValue("-pc_hypre_boomeramg_grid_sweeps_all",
+                         boost::lexical_cast<std::string>(num_sweeps).c_str());
+      }
+      if (parameters("hypre")("BoomerAMG")["cycle_type"].is_set())
+      {
+        const std::string cycle
+          = parameters("hypre")("BoomerAMG")["cycle_type"];
+        PetscOptionsSetValue("-pc_hypre_boomeramg_cycle_type", cycle.c_str());
+      }
+      if (parameters("hypre")("BoomerAMG")["max_levels"].is_set())
+      {
+        const std::size_t max_levels
+          = parameters("hypre")("BoomerAMG")["max_levels"];
+        PetscOptionsSetValue("-pc_hypre_boomeramg_max_levels",
+                          boost::lexical_cast<std::string>(max_levels).c_str());
+      }
+      if (parameters("hypre")("BoomerAMG")["strong_threshold"].is_set())
+      {
+        const double threshold
+          = parameters("hypre")("BoomerAMG")["strong_threshold"];
+        PetscOptionsSetValue("-pc_hypre_boomeramg_strong_threshold",
+                          boost::lexical_cast<std::string>(threshold).c_str());
+      }
+      if (parameters("hypre")("BoomerAMG")["relaxation_weight"].is_set())
+      {
+        const double relax
+          = parameters("hypre")("BoomerAMG")["relaxation_weight"];
+        PetscOptionsSetValue("-pc_hypre_boomeramg_relax_weight_all",
+                            boost::lexical_cast<std::string>(relax).c_str() );
+      }
+      if (parameters("hypre")("BoomerAMG")["agressive_coarsening_levels"].is_set())
+      {
+        const std::size_t levels
+          = parameters("hypre")("BoomerAMG")["agressive_coarsening_levels"];
+        PetscOptionsSetValue("-pc_hypre_boomeramg_agg_nl",
+                            boost::lexical_cast<std::string>(levels).c_str() );
+      }
+      if (parameters("hypre")("BoomerAMG")["relax_type_coarse"].is_set())
+      {
+        const std::string type
+          = parameters("hypre")("BoomerAMG")["relax_type_coarse"];
+        PetscOptionsSetValue("-pc_hypre_boomeramg_relax_type_coarse",
+                             type.c_str());
+      }
+    }
+    else if (_type == "hypre_parasails")
+    {
+      ierr = PCHYPRESetType(pc, "parasails");
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCHYPRESetType");
+      if (parameters("hypre")("parasails")["threshold"].is_set())
+      {
+        const double thresh = parameters("hypre")("parasails")["threshold"];
+        PetscOptionsSetValue("-pc_hypre_parasails_thresh",
+                             boost::lexical_cast<std::string>(thresh).c_str());
+      }
+      if (parameters("hypre")("parasails")["levels"].is_set())
+      {
+        const int levels = parameters("hypre")("parasails")["levels"];
+        PetscOptionsSetValue("-pc_hypre_parasails_nlevels",
+                             boost::lexical_cast<std::string>(levels).c_str());
+      }
+    }
+    else if (_type == "hypre_euclid")
+    {
+      ierr = PCHYPRESetType(pc, "euclid");
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCHYPRESetType");
+      const std::size_t ilu_level = parameters("ilu")["fill_level"];
+      PetscOptionsSetValue("-pc_hypre_euclid_levels",
+                          boost::lexical_cast<std::string>(ilu_level).c_str());
+    }
+    else
+    {
+      dolfin_error("PETScPreconditioner.cpp",
+                   "set PETSc preconditioner",
+                   "Requested Hypre preconditioner unknown (note that pilut is not supported)");
+    }
+
+    #else
+    warning("PETSc has not been compiled with the HYPRE library for "
+            "algebraic multigrid. Default PETSc solver will be used. "
+            "For performance, installation of HYPRE is recommended.");
+    #endif
+  }
+  else if (_type == "amg_ml" || _type == "ml_amg")
+  {
+    #if PETSC_HAVE_ML
+
+    // Set preconditioner to ML
+    ierr = PCSetType(pc, PCML);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetType");
+
+    // Set some parameters before set-up. These parameters can:
+    // (i)  Only be set via the PETSc parameters system; or
+    // (ii) Cannot be changed once once the preconditioner has been
+    //      setup. The is tricky because we don't know how many levels ML
+    //      will create until we've called PCSetUp
+
+    // --- ML parameters
+
+    // Output level
+    if (parameters("ml")["print_level"].is_set())
+    {
+      const std::size_t print_level = parameters("ml")["print_level"];
+      PetscOptionsSetValue("-pc_ml_PrintLevel",
+                       boost::lexical_cast<std::string>(print_level).c_str());
+    }
+
+    // Maximum number of levels
+    if (parameters("ml")["max_num_levels"].is_set())
+    {
+      const std::size_t max_levels = parameters("ml")["max_num_levels"];
+      PetscOptionsSetValue("-pc_ml_maxNlevels",
+                       boost::lexical_cast<std::string>(max_levels).c_str());
+    }
+
+    // Aggregation scheme (Uncoupled, Coupled, MIS, . . .)
+    if (parameters("ml")["aggregation_scheme"].is_set())
+    {
+      const std::string scheme = parameters("ml")["aggregation_scheme"];
+      PetscOptionsSetValue("-pc_ml_CoarsenScheme", scheme.c_str());
+    }
+
+    // Aggregation damping factor
+    if (parameters("ml")["aggregation_damping_factor"].is_set())
+    {
+      const double damping = parameters("ml")["aggregation_damping_factor"];
+      PetscOptionsSetValue("-pc_ml_DampingFactor",
+                           boost::lexical_cast<std::string>(damping).c_str());
+    }
+
+    // Maximum coarse level problem size
+    if (parameters("ml")["max_coarse_size"].is_set())
+    {
+      const std::size_t max_size = parameters("ml")["max_coarse_size"];
+      PetscOptionsSetValue("-pc_ml_maxCoarseSize",
+                            boost::lexical_cast<std::string>(max_size).c_str());
+    }
+
+    // Threshold parameters used in aggregation
+    if (parameters("ml")["threshold"].is_set())
+    {
+      const double threshold = parameters("ml")["threshold"];
+      PetscOptionsSetValue("-pc_ml_Threshold",
+                          boost::lexical_cast<std::string>(threshold).c_str());
+    }
+
+    // Spectral norm
+    if (parameters("ml")["use_spectral_Anorm"].is_set())
+    {
+      const bool Anorm = parameters("ml")["use_spectral_Anorm"];
+      if (Anorm)
+        PetscOptionsSetValue("-pc_ml_SpectralNormScheme_Anorm", "1");
+      else
+        PetscOptionsSetValue("-pc_ml_SpectralNormScheme_Anorm", "0");
+    }
+
+    // Energy minimization strategy
+    if (parameters("ml")["energy_minimization"].is_set())
+    {
+      const int method = parameters("ml")["energy_minimization"];
+      PetscOptionsSetValue("-pc_ml_EnergyMinimization",
+                            boost::lexical_cast<std::string>(method).c_str());
+
+      // Energy minimization drop tolerance
+      if (parameters("ml")["energy_minimization_threshold"].is_set())
+      {
+        const double threshold
+          = parameters("ml")["energy_minimization_threshold"];
+        PetscOptionsSetValue("-pc_ml_EnergyMinimizationDropTol",
+                          boost::lexical_cast<std::string>(threshold).c_str());
+      }
+    }
+
+    // Auxiliary threshold drop tolerance
+    /*
+    PetscOptionsSetValue("-pc_ml_Aux", "1");
+    if (parameters("ml")["auxiliary_threshold"].is_set())
+    {
+      const double threshold = parameters("ml")["auxiliary_threshold"];
+      PetscOptionsSetValue("-pc_ml_AuxThreshold",
+                            boost::lexical_cast<std::string>(threshold).c_str());
+    }
+    */
+
+    // Allow ML to re-partition problem
+    if (parameters("ml")["repartition"].is_set())
+    {
+      const bool repartition = parameters("ml")["repartition"];
+      if (repartition)
+      {
+        PetscOptionsSetValue("-pc_ml_repartition", "1");
+        if (parameters("ml")["repartition_type"].is_set())
+        {
+          PetscOptionsSetValue("-pc_ml_repartitionType",
+                   parameters("ml")["repartition_type"].value_str().c_str());
+        }
+        if (parameters("ml")["zoltan_repartition_scheme"].is_set())
+        {
+          PetscOptionsSetValue("-pc_ml_repartitionZoltanScheme",
+           parameters("ml")["zoltan_repartition_scheme"].value_str().c_str());
+        }
+      }
+      else
+        PetscOptionsSetValue("-pc_ml_repartition", "0");
+    }
+
+    // --- PETSc parameters
+
+    // Number of smmoother applications
+    if (parameters("mg")["num_sweeps"].is_set())
+    {
+      const std::size_t num_sweeps = parameters("mg")["num_sweeps"];
+      PetscOptionsSetValue("-pc_mg_smoothup",
+                        boost::lexical_cast<std::string>(num_sweeps).c_str());
+      PetscOptionsSetValue("-pc_mg_smoothdown",
+                        boost::lexical_cast<std::string>(num_sweeps).c_str());
+    }
+
+    if (parameters("ml")["cycle_type"].is_set())
+    {
+      const std::string type = parameters("mg")["cycle_type"];
+      PetscOptionsSetValue("-pc_mg_cycles", type.c_str());
+    }
+
+    // Coarse level solver
+    #if PETSC_HAVE_MUMPS
+    PetscOptionsSetValue("-mg_coarse_ksp_type", "preonly");
+    PetscOptionsSetValue("-mg_coarse_pc_type", "lu");
+    PetscOptionsSetValue("-mg_coarse_pc_factor_mat_solver_package", "mumps");
+    #endif
+
+    // Smoother on all levels
+    PetscOptionsSetValue("-mg_levels_ksp_type", "chebyshev");
+    //PetscOptionsSetValue("mg_levels_ksp_chebyshev_estimate_eigenvalues",
+    //                      "0.0,1.1");
+    //PetscOptionsSetValue("-mg_levels_ksp_type", "richardson");
+    PetscOptionsSetValue("-mg_levels_ksp_max_it",
+                          boost::lexical_cast<std::string>(4).c_str());
+
+    //PetscOptionsSetValue("-mg_levels_pc_type", "none");
+    PetscOptionsSetValue("-mg_levels_pc_type", "jacobi");
+    //PetscOptionsSetValue("-mg_levels_pc_type", "sor");
+    //PetscOptionsSetValue("-mg_levels_1_pc_sor_its",
+    //                      boost::lexical_cast<std::string>(2).c_str());
+
+    /*
+    // Level 1 smoother (0 is coarse, N is finest)
+    PetscOptionsSetValue("-mg_levels_1_ksp_type", "chebyshev");
+    PetscOptionsSetValue("-mg_levels_1_ksp_max_it",
+                          boost::lexical_cast<std::string>(1).c_str());
+    PetscOptionsSetValue("-mg_levels_1_pc_type", "sor");
+    PetscOptionsSetValue("-mg_levels_1_pc_sor_its",
+                          boost::lexical_cast<std::string>(2).c_str());
+
+    // Level 2  smoother
+    PetscOptionsSetValue("-mg_levels_2_ksp_type", "chebyshev");
+    PetscOptionsSetValue("-mg_levels_2_ksp_max_it",
+                          boost::lexical_cast<std::string>(1).c_str());
+    PetscOptionsSetValue("-mg_levels_2_pc_type", "sor");
+    PetscOptionsSetValue("-mg_levels_2_pc_sor_its",
+			 boost::lexical_cast<std::string>(1).c_str());
+    */
+
+    #else
+    warning("PETSc has not been compiled with the ML library for   "
+            "algerbraic multigrid. Default PETSc solver will be used. "
+            "For performance, installation of ML is recommended.");
+    #endif
+  }
+  else if (_type == "petsc_amg")
+  {
+    #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR > 2
+
+    // The PETSc AMG (smoothed aggegration) preconditioner
+    //PetscOptionsSetValue("-log_summary",
+    //                     boost::lexical_cast<std::string>(1).c_str());
+
+    // Set preconditioner to ML
+    ierr = PCSetType(pc, PCGAMG);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetType");
+
+    // Coarse level solver
+    #if PETSC_HAVE_MUMPS
+    PetscOptionsSetValue("-mg_coarse_ksp_type", "preonly");
+    PetscOptionsSetValue("-mg_coarse_pc_type", "lu");
+    PetscOptionsSetValue("-mg_coarse_pc_factor_mat_solver_package", "mumps");
+    #endif
+
+    // Output level
+    if (parameters("gamg")["verbose"].is_set())
+    {
+      const std::size_t verbose = parameters("gamg")["verbose"];
+      PetscOptionsSetValue("-pc_gamg_verbose",
+                  boost::lexical_cast<std::string>(verbose ?  1 : 0 ).c_str());
+    }
+
+    // -------- Aggregation options
+
+    // Set to smoothed aggregation
+    PetscOptionsSetValue("-pc_gamg_type", "agg");
+
+    // Number of aggregation smooths
+    if (parameters("gamg")["num_aggregation_smooths"].is_set())
+    {
+      const std::size_t num_smooths
+        = parameters("gamg")["num_aggregation_smooths"];
+      PetscOptionsSetValue("-pc_gamg_agg_nsmooths",
+                        boost::lexical_cast<std::string>(num_smooths).c_str());
+      // Note: Below seems to have no effect
+      //PCGAMGSetNSmooths(pc, num_smooths);
+    }
+
+    // Square graph
+    if (parameters("gamg")["square_graph"].is_set())
+    {
+      const bool square = parameters("gamg")["square_graph"];
+      PetscOptionsSetValue("-pc_gamg_square_graph",
+                         boost::lexical_cast<std::string>(square).c_str());
+      //PCGAMGSetSquareGraph(pc, square ? PETSC_TRUE : PETSC_FALSE);
+    }
+
+    // Symmetrize graph (if not square)
+    if (parameters("gamg")["symmetrize_graph"].is_set())
+    {
+      const bool symmetrize = parameters("gamg")["symmetrize_graph"];
+      PetscOptionsSetValue("-pc_gamg_sym_graph",
+                           boost::lexical_cast<std::string>(symmetrize).c_str());
+      //PCGAMGSetSymGraph(pc, symmetric ? PETSC_TRUE : PETSC_FALSE);
+    }
+
+    // -------- AMG options
+
+    PetscOptionsSetValue("-mg_levels_ksp_max_it",
+                          boost::lexical_cast<std::string>(4).c_str());
+    PetscOptionsSetValue("-mg_levels_pc_type", "jacobi");
+
+    // Threshold parameters used in aggregation
+    if (parameters("gamg")["threshold"].is_set())
+    {
+      const double threshold = parameters("gamg")["threshold"];
+      ierr = PCGAMGSetThreshold(pc, threshold);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCGAMGSetThreshold");
+    }
+
+    // Maximum coarse level problem size
+    if (parameters("gamg")["max_coarse_size"].is_set())
+    {
+      const std::size_t max_size = parameters("gamg")["max_coarse_size"];
+      ierr = PCGAMGSetCoarseEqLim(pc, max_size);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCGAMGSetCoarseEqLimit");
+    }
+
+    // Maximum coarse level problem size on a process
+    if (parameters("gamg")["max_process_coarse_size"].is_set())
+    {
+      const std::size_t max_size
+        = parameters("gamg")["max_process_coarse_size"];
+      ierr = PCGAMGSetProcEqLim(pc, max_size);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCGAMGSetProcEqLim");
+    }
+
+    // Allow GAMG to re-partition problem
+    if (parameters("gamg")["repartition"].is_set())
+    {
+      const bool repartition = parameters("gamg")["repartition"];
+      ierr = PCGAMGSetRepartitioning(pc,repartition ? PETSC_TRUE : PETSC_FALSE);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "PCGAMGSetRepartitioning");
+    }
+
+    // Maximum numebr of levels
+    if (parameters("gamg")["max_num_levels"].is_set())
+    {
+      const std::size_t num_levels = parameters("gamg")["max_num_levels"];
+      PetscOptionsSetValue("-pc_mg_levels",
+                         boost::lexical_cast<std::string>(num_levels).c_str());
+      // Note: Below doesn't appear to work
+      //ierr = PCGAMGSetNlevels(pc, num_levels);
+      //if (ierr != 0) petsc_error(ierr, __FILE__, "PCGAMGSetNlevels");
+    }
+
+    #else
+    warning("PETSc native algebraic multigrid support requires PETSc"
+             "version > 3.2. Default PETSc preconditioner will be used.");
+    #endif
+
+  }
+  else if (_type == "additive_schwarz")
+  {
+    // Select method and overlap
+    ierr = PCSetType(pc, _methods.find("additive_schwarz")->second);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetType");
+
+    const int schwarz_overlap = parameters("schwarz")["overlap"];
+    PCASMSetOverlap(pc, schwarz_overlap);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCASMSetOverlap");
+
+    // Get sub-solvers and set sub-solver parameters
+    /*
+    KSP* sub_ksps;
+    int num_local(0), first(0);
+    PCASMGetSubKSP(pc, &num_local, &first, &sub_ksps);
+    for (int i = 0; i < num_local; ++i)
+    {
+      // Get sub-preconditioner
+      PC sub_pc;
+      KSPGetPC(sub_ksps[i], &sub_pc);
+
+      //PCSetType(sub_pc, PCLU);
+      //PCFactorSetMatSolverPackage(sub_pc, MAT_SOLVER_UMFPACK);
+      //PCSetType(sub_pc, PCILU);
+      //KSPSetType(sub_ksps[i], KSPGMRES);
+      PCFactorSetLevels(sub_pc, parameters("ilu")["fill_level"]);
+      //PCFactorSetLevels(sub_pc, 4);
+      //PCView(sub_pc, PETSC_VIEWER_STDOUT_WORLD);
+    }
+    //KSPSetTolerances(sub_ksps[0], 1.0e-1,
+		//                      parameters["absolute_tolerance"],
+		//                      parameters["divergence_limit"],
+		//                      100);
+    //KSPMonitorSet(sub_ksps[0], KSPMonitorTrueResidualNorm, 0, 0);
+    */
+  }
+  else if (_type != "default")
+  {
+    ierr = PCSetType(pc, _methods.find(_type)->second);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetType");
+    ierr = PCFactorSetShiftType(pc, MAT_SHIFT_NONZERO);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorSetShiftType");
+    ierr = PCFactorSetShiftAmount(pc, parameters["shift_nonzero"]);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorSetShiftAmount");
+  }
+
+  const int ilu_levels = parameters("ilu")["fill_level"];
+  ierr = PCFactorSetLevels(pc, ilu_levels);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "PCFactorSetLevels");
+
+  // Set physical coordinates for row dofs
+  if (!_coordinates.empty())
+  {
+    dolfin_assert(gdim > 0);
+    #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR < 3
+    ierr = PCSetCoordinates(pc, gdim, _coordinates.data());
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetCoordinates");
+    #else
+    ierr = PCSetCoordinates(pc, gdim, _coordinates.size()/gdim,
+                            _coordinates.data());
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetCoordinates");
+    #endif
+  }
+
+  // Clear memory
+  _coordinates.clear();
+
+  std::string prefix = std::string(parameters["options_prefix"]);
+  if (prefix != "default")
+  {
+    // Make sure that the prefix has a '_' at the end if the user didn't provide it
+    char lastchar = *prefix.rbegin();
+    if (lastchar != '_')
+      prefix += "_";
+
+    PCSetOptionsPrefix(pc, prefix.c_str());
+  }
+  PCSetFromOptions(pc);
+
+  // Print preconditioner information
+  const bool report = parameters["report"];
+  if (report)
+  {
+    ierr = PCSetUp(pc);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCSetUp");
+    ierr = PCView(pc, PETSC_VIEWER_STDOUT_WORLD);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCView");
+  }
+}
+//-----------------------------------------------------------------------------
+void PETScPreconditioner::set_nullspace(const VectorSpaceBasis& near_nullspace)
+{
+  #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR < 3
+  dolfin_error("PETScPreconditioner.cpp",
+               "set approximate null space for PETSc preconditioner",
+               "This is supported by PETSc version > 3.2");
+  #else
+
+  // Clear near nullspace
+  if (petsc_near_nullspace)
+    MatNullSpaceDestroy(&petsc_near_nullspace);
+  _near_nullspace.clear();
+
+  // Copy vectors
+  for (std::size_t i = 0; i < near_nullspace.dim(); ++i)
+  {
+    dolfin_assert(near_nullspace[i]);
+    const PETScVector& x = near_nullspace[i]->down_cast<PETScVector>();
+
+    // Copy vector
+    _near_nullspace.push_back(x);
+  }
+
+  // Get pointers to underlying PETSc objects
+  std::vector<Vec> petsc_vec(near_nullspace.dim());
+  for (std::size_t i = 0; i < near_nullspace.dim(); ++i)
+    petsc_vec[i] = _near_nullspace[i].vec();
+
+  // Create null space
+  PetscErrorCode ierr;
+  ierr = MatNullSpaceCreate(PETSC_COMM_WORLD, PETSC_FALSE, near_nullspace.dim(),
+                            petsc_vec.data(), &petsc_near_nullspace);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "MatNullSpaceCreate");
+  #endif
+}
+//-----------------------------------------------------------------------------
+void PETScPreconditioner::set_coordinates(const std::vector<double>& x,
+                                          std::size_t dim)
+{
+  _coordinates = x;
+  gdim = dim;
+}
+//-----------------------------------------------------------------------------
+void PETScPreconditioner::set_fieldsplit(PETScKrylovSolver& solver,
+                    const std::vector<std::vector<dolfin::la_index> >& fields,
+                    const std::vector<std::string>& split_names)
+{
+  dolfin_assert(fields.size() == split_names.size());
+  PetscErrorCode ierr;
+
+  if (fields.empty())
+    return;
+
+  // Get PETSc PC pointer
+  PC pc;
+  dolfin_assert(solver.ksp());
+  ierr = KSPGetPC(solver.ksp(), &pc);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+
+  // Add split for each field
+  for (std::size_t i = 0; i < fields.size(); ++i)
+  {
+    // Create IndexSet
+    IS is;
+    ierr = ISCreateGeneral(PETSC_COMM_WORLD, fields[i].size(), fields[i].data(),
+                           PETSC_USE_POINTER, &is);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "ISCreateGeneral");
+
+    // Add split
+    PCFieldSplitSetIS(pc, split_names[i].c_str(), is);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "PCFieldSplitSetIS");
+
+    // Clean up IndexSet
+    ierr = ISDestroy(&is);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "ISDestroy");
+  }
+}
+//-----------------------------------------------------------------------------
+std::string PETScPreconditioner::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+    warning("Verbose output for PETScPreconditioner not implemented.");
+  else
+    s << "<PETScPreconditioner>";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/PETScPreconditioner.h b/dolfin/la/PETScPreconditioner.h
new file mode 100644
index 0000000..0c3941d
--- /dev/null
+++ b/dolfin/la/PETScPreconditioner.h
@@ -0,0 +1,128 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2010-02-25
+// Last changed: 2011-10-19
+
+#ifndef __DOLFIN_PETSC_PRECONDITIONER_H
+#define __DOLFIN_PETSC_PRECONDITIONER_H
+
+#ifdef HAS_PETSC
+
+#include <string>
+#include <vector>
+#include <memory>
+#include <petscpc.h>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/la/PETScObject.h>
+#include <dolfin/parameter/Parameters.h>
+#include "GenericPreconditioner.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class PETScKrylovSolver;
+  class PETScSNESSolver;
+  class VectorSpaceBasis;
+
+  /// This class is a wrapper for configuring PETSc
+  /// preconditioners. It does not own a preconditioner. It can take a
+  /// PETScKrylovSolver and set the preconditioner type and
+  /// parameters.
+
+  class PETScPreconditioner : public PETScObject,
+    public GenericPreconditioner, public Variable
+  {
+  public:
+
+    /// Create a particular preconditioner object
+    explicit PETScPreconditioner(std::string type = "default");
+
+    /// Destructor
+    virtual ~PETScPreconditioner();
+
+    /// Set the precondtioner type and parameters
+    virtual void set(PETScKrylovSolver& solver);
+
+    /// Set the (near) null space of the preconditioner operator
+    /// (matrix). This is required for certain preconditioner types,
+    /// e.g. smoothed aggregation multigrid
+    void set_nullspace(const VectorSpaceBasis& near_nullspace);
+
+    /// Return the PETSc null space
+    MatNullSpace near_nullspace() const
+    { return petsc_near_nullspace; }
+
+    /// Set the coordinates of the operator (matrix) rows and
+    /// geometric dimension d. This is can be used by required for
+    /// certain preconditioners, e.g. ML. The input for this function
+    /// can be generated using GenericDofMap::tabulate_all_dofs.
+    void set_coordinates(const std::vector<double>& x, std::size_t dim);
+
+    // FIXME: Document
+    void
+      set_fieldsplit(PETScKrylovSolver& solver,
+                     const std::vector<std::vector<dolfin::la_index> >& fields,
+                     const std::vector<std::string>& split_names);
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Rerturn a list of available preconditioners
+    static std::vector<std::pair<std::string, std::string> > preconditioners();
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+    friend class PETScSNESSolver;
+
+  private:
+
+    /// Named preconditioner
+    std::string _type;
+
+    // Available names preconditioners
+    static const std::map<std::string, const PCType> _methods;
+
+    // Available preconditioner descriptions
+    static const std::vector<std::pair<std::string, std::string> >
+      _methods_descr;
+
+    // Near null space vectors
+    std::vector<PETScVector> _near_nullspace;
+
+    // PETSc near null space.
+    MatNullSpace petsc_near_nullspace;
+
+    // Operator row coordinates
+    std::vector<double> _coordinates;
+
+    // Geometric dimension associates with coordinates
+    std::size_t gdim;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScUserPreconditioner.cpp b/dolfin/la/PETScUserPreconditioner.cpp
new file mode 100644
index 0000000..0eb7549
--- /dev/null
+++ b/dolfin/la/PETScUserPreconditioner.cpp
@@ -0,0 +1,98 @@
+// Copyright (C) 2005 Johan Jansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2005, 2012.
+// Modified by Anders Logg 2006.
+//
+// First added:  2005
+// Last changed: 2012-05-10
+
+#ifdef HAS_PETSC
+
+#include <memory>
+#include <petscversion.h>
+#if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR > 2
+#include <petsc-private/pcimpl.h>
+#else
+#include <private/pcimpl.h>
+#endif
+#include <dolfin/common/NoDeleter.h>
+#include "PETScVector.h"
+#include "PETScUserPreconditioner.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+PETScUserPreconditioner::PETScUserPreconditioner()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+PETScUserPreconditioner::~PETScUserPreconditioner()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void PETScUserPreconditioner::setup(const KSP ksp, PETScUserPreconditioner& pc)
+{
+  PC petscpc;
+  PetscErrorCode ierr = KSPGetPC(ksp, &petscpc);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "KSPGetPC");
+  PETScUserPreconditioner::PCCreate(petscpc);
+
+  petscpc->data = &pc;
+  petscpc->ops->apply = PETScUserPreconditioner::PCApply;
+  petscpc->ops->applytranspose = PETScUserPreconditioner::PCApply;
+  petscpc->ops->applysymmetricleft = PETScUserPreconditioner::PCApply;
+  petscpc->ops->applysymmetricright = PETScUserPreconditioner::PCApply;
+}
+//-----------------------------------------------------------------------------
+int PETScUserPreconditioner::PCApply(PC pc, Vec x, Vec y)
+{
+  // Convert vectors to DOLFIN wrapper format and pass to DOLFIN
+  // preconditioner
+  PETScUserPreconditioner* newpc = (PETScUserPreconditioner*)pc->data;
+
+  // Wrap PETSc vectors as DOLFIN PETScVectors
+  PETScVector dolfinx(x), dolfiny(y);
+
+  // Solve
+  newpc->solve(dolfiny, dolfinx);
+  return 0;
+}
+//-----------------------------------------------------------------------------
+int PETScUserPreconditioner::PCCreate(PC pc)
+{
+  // Initialize function pointers to 0
+  pc->ops->setup               = 0;
+  pc->ops->apply               = 0;
+  pc->ops->applyrichardson     = 0;
+  pc->ops->applytranspose      = 0;
+  pc->ops->applysymmetricleft  = 0;
+  pc->ops->applysymmetricright = 0;
+  pc->ops->setfromoptions      = 0;
+  pc->ops->view                = 0;
+  pc->ops->destroy             = 0;
+  pc->ops->reset               = 0;
+  // Set PETSc name of preconditioner
+  PetscObjectChangeTypeName((PetscObject)pc, "DOLFIN");
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/PETScUserPreconditioner.h b/dolfin/la/PETScUserPreconditioner.h
new file mode 100644
index 0000000..a6a196c
--- /dev/null
+++ b/dolfin/la/PETScUserPreconditioner.h
@@ -0,0 +1,73 @@
+// Copyright (C) 2005 Johan Jansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2005-2006.
+// Modified Garth N. Wells 2005
+//
+// First added:  2005
+// Last changed: 2008-01-07
+
+#ifndef __PETSC_USER_PRECONDITIONER_H
+#define __PETSC_USER_PRECONDITIONER_H
+
+#ifdef HAS_PETSC
+
+#include <petscksp.h>
+#include <petscpc.h>
+#include "PETScObject.h"
+
+namespace dolfin
+{
+
+  class PETScVector;
+
+  /// This class specifies the interface for user-defined Krylov
+  /// method PETScPreconditioners. A user wishing to implement her own
+  /// PETScPreconditioner needs only supply a function that approximately
+  /// solves the linear system given a right-hand side.
+
+  class PETScUserPreconditioner : public PETScObject
+  {
+  public:
+
+    /// Constructor
+    PETScUserPreconditioner();
+
+    /// Destructor
+    virtual ~PETScUserPreconditioner();
+
+    static void setup(const KSP ksp, PETScUserPreconditioner& pc);
+
+    /// Solve linear system approximately for given right-hand side b
+    virtual void solve(PETScVector& x, const PETScVector& b) = 0;
+
+  protected:
+
+    PC petscpc;
+
+  private:
+
+    static int PCApply(PC pc, Vec x, Vec y);
+    static int PCCreate(PC pc);
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PETScVector.cpp b/dolfin/la/PETScVector.cpp
new file mode 100644
index 0000000..08102b4
--- /dev/null
+++ b/dolfin/la/PETScVector.cpp
@@ -0,0 +1,914 @@
+// Copyright (C) 2004-2012 Johan Hoffman, Johan Jansson and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2005-2010
+// Modified by Martin Sandve Alnes 2008
+// Modified by Johannes Ring 2011.
+// Modified by Fredrik Valdmanis 2011-2012
+//
+// First added:  2004
+// Last changed: 2012-08-22
+
+#ifdef HAS_PETSC
+
+#include <cmath>
+#include <numeric>
+#include <boost/assign/list_of.hpp>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Set.h>
+#include <dolfin/log/dolfin_log.h>
+#include "PETScVector.h"
+#include "uBLASVector.h"
+#include "PETScFactory.h"
+#include "PETScCuspFactory.h"
+#include <dolfin/common/MPI.h>
+
+using namespace dolfin;
+
+const std::map<std::string, NormType> PETScVector::norm_types
+= boost::assign::map_list_of("l1",   NORM_1)
+  ("l2",   NORM_2)
+  ("linf", NORM_INFINITY);
+
+//-----------------------------------------------------------------------------
+PETScVector::PETScVector() : _x(NULL), _use_gpu(false)
+{
+#ifndef HAS_PETSC_CUSP
+  if (_use_gpu)
+  {
+    dolfin_error("PETScVector.cpp",
+                 "create empty GPU vector",
+                 "PETSc not compiled with Cusp support");
+  }
+#endif
+}
+//-----------------------------------------------------------------------------
+PETScVector::PETScVector(MPI_Comm comm, std::size_t N, bool use_gpu)
+  : _x(NULL), _use_gpu(use_gpu)
+{
+  #ifndef HAS_PETSC_CUSP
+  if (_use_gpu)
+  {
+    dolfin_error("PETScVector.cpp",
+                 "create GPU vector",
+                 "PETSc not compiled with Cusp support");
+  }
+  #endif
+
+  // Empty ghost indices vector
+  const std::vector<la_index> ghost_indices;
+
+  // Compute a local range
+  const std::pair<std::size_t, std::size_t> range = MPI::local_range(comm, N);
+  _init(comm, range, ghost_indices);
+}
+//-----------------------------------------------------------------------------
+PETScVector::PETScVector(const GenericSparsityPattern& sparsity_pattern)
+  : _x(NULL), _use_gpu(false)
+{
+  std::vector<la_index> ghost_indices;
+  init(sparsity_pattern.mpi_comm(), sparsity_pattern.local_range(0),
+         ghost_indices);
+}
+//-----------------------------------------------------------------------------
+PETScVector::PETScVector(Vec x): _x(x), _use_gpu(false)
+{
+  // Increase reference count
+  PetscObjectReference((PetscObject)_x);
+}
+//-----------------------------------------------------------------------------
+PETScVector::PETScVector(const PETScVector& v) : _x(NULL), _use_gpu(false)
+{
+  PetscErrorCode ierr;
+
+  // Create new vector
+  ierr = VecDuplicate(v._x, &_x);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecDuplicate");
+
+  // Copy data
+  ierr = VecCopy(v._x, _x);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecCopy");
+
+  // Copy ghost data
+  ghost_global_to_local = v.ghost_global_to_local;
+
+  // Update ghost values
+  update_ghost_values();
+}
+//-----------------------------------------------------------------------------
+PETScVector::~PETScVector()
+{
+  if (_x)
+    VecDestroy(&_x);
+}
+//-----------------------------------------------------------------------------
+bool PETScVector::distributed() const
+{
+  dolfin_assert(_x);
+
+  // Get type
+  #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR <= 3
+  const VecType petsc_type;
+  #else
+  VecType petsc_type;
+  #endif
+  PetscErrorCode ierr = VecGetType(_x, &petsc_type);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecGetType");
+
+  // Return type
+  bool _distributed = false;
+  if (strcmp(petsc_type, VECMPI) == 0)
+    _distributed = true;
+  else if (strcmp(petsc_type, VECSEQ) == 0)
+    _distributed =  false;
+  #ifdef HAS_PETSC_CUSP
+  // TODO: Uncomment these two lines after implementing MPI Cusp vectors
+  //else if (strcmp(petsc_type, VECMPICUSP) == 0)
+  //  _distributed = true;
+  else if (strcmp(petsc_type, VECSEQCUSP) == 0)
+    _distributed = false;
+  #endif
+  else
+  {
+    dolfin_error("PETScVector.cpp",
+                 "check whether PETSc vector is distributed",
+                 "Unknown vector type (\"%s\")", petsc_type);
+  }
+
+  return _distributed;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> PETScVector::copy() const
+{
+  return std::shared_ptr<GenericVector>(new PETScVector(*this));
+}
+//-----------------------------------------------------------------------------
+void PETScVector::init(MPI_Comm comm, std::size_t N)
+{
+  const std::pair<std::size_t, std::size_t> range
+    = MPI::local_range(comm, N);
+  init(comm, range);
+}
+//-----------------------------------------------------------------------------
+void PETScVector::init(MPI_Comm comm,
+                         std::pair<std::size_t, std::size_t> range)
+{
+  // Create empty ghost indices vector
+  std::vector<la_index> ghost_indices;
+  init(comm, range, ghost_indices);
+}
+//-----------------------------------------------------------------------------
+void PETScVector::init(MPI_Comm comm,
+                         std::pair<std::size_t, std::size_t> range,
+                         const std::vector<la_index>& ghost_indices)
+{
+  // Re-initialise vector
+  _init(comm, range, ghost_indices);
+}
+//-----------------------------------------------------------------------------
+void PETScVector::get_local(std::vector<double>& values) const
+{
+  dolfin_assert(_x);
+  //const std::size_t n0 = local_range().first;
+  const std::size_t local_size = local_range().second - local_range().first;
+  values.resize(local_size);
+
+  if (local_size == 0)
+    return;
+
+  // Get pointer to PETSc vector data
+  const PetscScalar* data;
+  PetscErrorCode ierr = VecGetArrayRead(_x, &data);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecGetArrayRead");
+
+  // Copy data into vector
+  std::copy(data, data + local_size, values.begin());
+
+  // Restore array
+  ierr = VecRestoreArrayRead(_x, &data);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecRestoreArrayRead");
+}
+//-----------------------------------------------------------------------------
+void PETScVector::set_local(const std::vector<double>& values)
+{
+  dolfin_assert(_x);
+  const std::size_t n0 = local_range().first;
+  const std::size_t local_size = local_range().second - local_range().first;
+  if (values.size() != local_size)
+  {
+    dolfin_error("PETScVector.cpp",
+                 "set local values of PETSc vector",
+                 "Size of values array is not equal to local vector size");
+  }
+
+  if (local_size == 0)
+    return;
+
+  // Build array of global indices
+  std::vector<PetscInt> rows(local_size, n0);
+  for (std::size_t i = 0; i < local_size; ++i)
+    rows[i] += i;
+
+  PetscErrorCode ierr = VecSetValues(_x, local_size, rows.data(),
+                                     values.data(), INSERT_VALUES);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecSetValues");
+}
+//-----------------------------------------------------------------------------
+void PETScVector::add_local(const Array<double>& values)
+{
+  dolfin_assert(_x);
+  const std::size_t n0 = local_range().first;
+  const std::size_t local_size = local_range().second - local_range().first;
+  if (values.size() != local_size)
+  {
+    dolfin_error("PETScVector.cpp",
+                 "add local values to PETSc vector",
+                 "Size of values array is not equal to local vector size");
+  }
+
+  if (local_size == 0)
+    return;
+
+  // Build array of global indices
+  std::vector<PetscInt> rows(local_size, n0);
+  for (std::size_t i = 0; i < local_size; ++i)
+    rows[i] += i;
+
+  PetscErrorCode ierr = VecSetValues(_x, local_size, rows.data(),
+                                     values.data(), ADD_VALUES);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecSetValues");
+}
+//-----------------------------------------------------------------------------
+void PETScVector::get_local(double* block, std::size_t m,
+			    const dolfin::la_index* rows) const
+{
+  if (m == 0)
+    return;
+
+  dolfin_assert(_x);
+  PetscErrorCode ierr;
+
+  Vec xg;
+  ierr = VecGhostGetLocalForm(_x, &xg);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecGhostGetLocalForm");
+
+  const std::size_t offset = local_range().first;
+
+  // Use VecGetValues if no ghost points, otherwise check for ghost
+  // values
+  if (!xg)
+  {
+    // Get pointer to PETSc vector data
+    const PetscScalar* data;
+    PetscErrorCode ierr = VecGetArrayRead(_x, &data);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecGetArrayRead");
+
+    for (std::size_t i = 0; i < m; ++i)
+      block[i] = data[rows[i] - offset];
+
+    // Restor array
+    ierr = VecRestoreArrayRead(_x, &data);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecRestoreArrayRead");
+  }
+  else
+  {
+    dolfin_assert(xg);
+
+    // Get local range
+    const PetscInt n0 = local_range().first;
+    const PetscInt n1 = local_range().second;
+    const PetscInt local_size = n1 - n0;
+
+    // Build list of rows, and get from ghosted vector
+    std::vector<PetscInt> local_rows(m);
+    for (std::size_t i = 0; i < m; ++i)
+    {
+      if (rows[i] >= n0 && rows[i] < n1)
+        local_rows[i] = rows[i] - n0;
+      else
+      {
+        boost::unordered_map<std::size_t, std::size_t>::const_iterator
+          local_index = ghost_global_to_local.find(rows[i]);
+        dolfin_assert(local_index != ghost_global_to_local.end());
+        local_rows[i] = local_index->second + local_size;
+      }
+    }
+
+    // Pick values from ghosted vector
+    ierr = VecGetValues(xg, m, local_rows.data(), block);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecGetValues");
+  }
+
+  ierr = VecGhostRestoreLocalForm(_x, &xg);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecGhostRestoreLocalForm");
+}
+//-----------------------------------------------------------------------------
+void PETScVector::set(const double* block, std::size_t m,
+                      const dolfin::la_index* rows)
+{
+  dolfin_assert(_x);
+  if (m == 0)
+    return;
+  PetscErrorCode ierr = VecSetValues(_x, m, rows, block, INSERT_VALUES);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecSetValues");
+}
+//-----------------------------------------------------------------------------
+void PETScVector::add(const double* block, std::size_t m,
+                      const dolfin::la_index* rows)
+{
+  dolfin_assert(_x);
+  if (m == 0)
+    return;
+  PetscErrorCode ierr = VecSetValues(_x, m, rows, block, ADD_VALUES);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecSetValues");
+}
+//-----------------------------------------------------------------------------
+void PETScVector::apply(std::string mode)
+{
+  Timer timer("Apply (PETScVector)");
+  dolfin_assert(_x);
+  PetscErrorCode ierr;
+  ierr = VecAssemblyBegin(_x);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecAssemblyBegin");
+  ierr = VecAssemblyEnd(_x);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecAssemblyEnd");
+
+  // Update any ghost values
+  update_ghost_values();
+}
+//-----------------------------------------------------------------------------
+MPI_Comm PETScVector::mpi_comm() const
+{
+  dolfin_assert(_x);
+  MPI_Comm mpi_comm = MPI_COMM_NULL;
+  PetscObjectGetComm((PetscObject)(_x), &mpi_comm);
+  return mpi_comm;
+}
+//-----------------------------------------------------------------------------
+void PETScVector::zero()
+{
+  dolfin_assert(_x);
+  double a = 0.0;
+  PetscErrorCode ierr = VecSet(_x, a);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecSet");
+  this->apply("insert");
+}
+//-----------------------------------------------------------------------------
+bool PETScVector::empty() const
+{
+  return size() == 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScVector::size() const
+{
+  PetscInt n = 0;
+  if (_x)
+  {
+    PetscErrorCode ierr = VecGetSize(_x, &n);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecGetSize");
+  }
+  return n;
+}
+//-----------------------------------------------------------------------------
+std::size_t PETScVector::local_size() const
+{
+  PetscInt n = 0;
+  if (_x)
+  {
+    PetscErrorCode ierr = VecGetLocalSize(_x, &n);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecGetLocalSize");
+  }
+  return n;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t> PETScVector::local_range() const
+{
+  PetscInt n0, n1;
+  PetscErrorCode ierr = VecGetOwnershipRange(_x, &n0, &n1);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecGetOwnershipRange");
+  dolfin_assert(n0 <= n1);
+  return std::make_pair(n0, n1);
+}
+//-----------------------------------------------------------------------------
+bool PETScVector::owns_index(std::size_t i) const
+{
+  if (i >= local_range().first && i < local_range().second)
+    return true;
+  else
+    return false;
+}
+//-----------------------------------------------------------------------------
+const GenericVector& PETScVector::operator= (const GenericVector& v)
+{
+  *this = as_type<const PETScVector>(v);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator= (const PETScVector& v)
+{
+  // Check that vector lengths are equal
+  if (size() != v.size())
+  {
+    dolfin_error("PETScVector.cpp",
+                 "assign one vector to another",
+                 "Vectors must be of the same length when assigning. "
+                 "Consider using the copy constructor instead");
+  }
+
+  // Check that vector local ranges are equal (relevant in parallel)
+  if (local_range() != v.local_range())
+  {
+    dolfin_error("PETScVector.cpp",
+                 "assign one vector to another",
+                 "Vectors must have the same parallel layout when assigning. "
+                 "Consider using the copy constructor instead");
+  }
+
+  // Check for self-assignment
+  if (this != &v)
+  {
+    // Copy data (local operatrion)
+    dolfin_assert(v._x);
+    dolfin_assert(_x);
+    PetscErrorCode ierr = VecCopy(v._x, _x);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecCopy");
+
+    // Update ghost values
+    update_ghost_values();
+  }
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator= (double a)
+{
+  dolfin_assert(_x);
+  PetscErrorCode ierr = VecSet(_x, a);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecSet");
+  apply("insert");
+  return *this;
+}
+//-----------------------------------------------------------------------------
+void PETScVector::update_ghost_values()
+{
+  dolfin_assert(_x);
+  PetscErrorCode ierr;
+
+  #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR <= 3
+  if (dolfin::MPI::size(mpi_comm()) > 1)
+  #endif
+  {
+    // Check of vector is ghosted
+    Vec xg;
+    ierr = VecGhostGetLocalForm(_x, &xg);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecGhostGetLocalForm");
+
+    // If ghosted, update
+    if (xg)
+    {
+      ierr = VecGhostUpdateBegin(_x, INSERT_VALUES, SCATTER_FORWARD);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "VecGhostUpdateBegin");
+      ierr = VecGhostUpdateEnd(_x, INSERT_VALUES, SCATTER_FORWARD);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "VecGhostUpdateEnd");
+    }
+
+    ierr = VecGhostRestoreLocalForm(_x, &xg);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecGhostRestoreLocalForm");
+  }
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator+= (const GenericVector& x)
+{
+  axpy(1.0, x);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator+= (double a)
+{
+  dolfin_assert(_x);
+  PetscErrorCode ierr = VecShift(_x, a);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecShift");
+
+  // Update any ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator-= (const GenericVector& x)
+{
+  axpy(-1.0, x);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator-= (double a)
+{
+  dolfin_assert(_x);
+  (*this) += -a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator*= (const double a)
+{
+  dolfin_assert(_x);
+  PetscErrorCode ierr = VecScale(_x, a);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScale");
+
+  // Update ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator*= (const GenericVector& y)
+{
+  dolfin_assert(_x);
+  const PETScVector& v = as_type<const PETScVector>(y);
+  dolfin_assert(v._x);
+  if (size() != v.size())
+  {
+    dolfin_error("PETScVector.cpp",
+                 "perform point-wise multiplication with PETSc vector",
+                 "Vectors are not of the same size");
+  }
+
+  PetscErrorCode ierr = VecPointwiseMult(_x, _x, v._x);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecPointwiseMult");
+
+  // Update ghost values
+  update_ghost_values();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const PETScVector& PETScVector::operator/= (const double a)
+{
+  dolfin_assert(_x);
+  dolfin_assert(a != 0.0);
+  const double b = 1.0/a;
+  (*this) *= b;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+double PETScVector::inner(const GenericVector& y) const
+{
+  dolfin_assert(_x);
+  const PETScVector& _y = as_type<const PETScVector>(y);
+  dolfin_assert(_y._x);
+  double a;
+  PetscErrorCode ierr = VecDot(_y._x, _x, &a);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecDot");
+  return a;
+}
+//-----------------------------------------------------------------------------
+void PETScVector::axpy(double a, const GenericVector& y)
+{
+  dolfin_assert(_x);
+
+  const PETScVector& _y = as_type<const PETScVector>(y);
+  dolfin_assert(_y._x);
+  if (size() != _y.size())
+  {
+    dolfin_error("PETScVector.cpp",
+                 "perform axpy operation with PETSc vector",
+                 "Vectors are not of the same size");
+  }
+
+  PetscErrorCode ierr = VecAXPY(_x, a, _y._x);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecAXPY");
+
+  // Update ghost values
+  update_ghost_values();
+}
+//-----------------------------------------------------------------------------
+void PETScVector::abs()
+{
+  dolfin_assert(_x);
+  VecAbs(_x);
+
+  // Update ghost values
+  update_ghost_values();
+}
+//-----------------------------------------------------------------------------
+double PETScVector::norm(std::string norm_type) const
+{
+  dolfin_assert(_x);
+  if (norm_types.count(norm_type) == 0)
+  {
+    dolfin_error("PETScVector.cpp",
+                 "compute norm of PETSc vector",
+                 "Unknown norm type (\"%s\")", norm_type.c_str());
+  }
+
+  double value = 0.0;
+  PetscErrorCode ierr = VecNorm(_x, norm_types.find(norm_type)->second,
+                                &value);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecNorm");
+  return value;
+}
+//-----------------------------------------------------------------------------
+double PETScVector::min() const
+{
+  dolfin_assert(_x);
+  double value = 0.0;
+  PetscInt position = 0;
+  PetscErrorCode ierr = VecMin(_x, &position, &value);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecMin");
+  return value;
+}
+//-----------------------------------------------------------------------------
+double PETScVector::max() const
+{
+  dolfin_assert(_x);
+  double value = 0.0;
+  PetscInt position = 0;
+  PetscErrorCode ierr = VecMax(_x, &position, &value);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecMax");
+  return value;
+}
+//-----------------------------------------------------------------------------
+double PETScVector::sum() const
+{
+  dolfin_assert(_x);
+  double value = 0.0;
+  PetscErrorCode ierr = VecSum(_x, &value);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecSum");
+  return value;
+}
+//-----------------------------------------------------------------------------
+double PETScVector::sum(const Array<std::size_t>& rows) const
+{
+  dolfin_assert(_x);
+  const std::size_t n0 = local_range().first;
+  const std::size_t n1 = local_range().second;
+
+  // Build sets of local and nonlocal entries
+  Set<PetscInt> local_rows;
+  Set<std::size_t> send_nonlocal_rows;
+  for (std::size_t i = 0; i < rows.size(); ++i)
+  {
+    if (rows[i] >= n0 && rows[i] < n1)
+      local_rows.insert(rows[i]);
+    else
+      send_nonlocal_rows.insert(rows[i]);
+  }
+
+  // Send nonlocal rows indices to other processes
+  const std::size_t num_processes  = MPI::size(mpi_comm());
+  const std::size_t process_number = MPI::rank(mpi_comm());
+  for (std::size_t i = 1; i < num_processes; ++i)
+  {
+    // Receive data from process p - i (i steps to the left), send data to
+    // process p + i (i steps to the right)
+    const std::size_t source
+      = (process_number - i + num_processes) % num_processes;
+    const std::size_t dest   = (process_number + i) % num_processes;
+
+    // Send and receive data
+    std::vector<std::size_t> received_nonlocal_rows;
+    MPI::send_recv(mpi_comm(), send_nonlocal_rows.set(), dest,
+                   received_nonlocal_rows, source);
+
+    // Add rows which reside on this process
+    for (std::size_t j = 0; j < received_nonlocal_rows.size(); ++j)
+    {
+      if (received_nonlocal_rows[j] >= n0 && received_nonlocal_rows[j] < n1)
+        local_rows.insert(received_nonlocal_rows[j]);
+    }
+  }
+
+  // Get local values
+  std::vector<double> local_values(local_rows.size());
+  get_local(&local_values[0], local_rows.size(), &local_rows.set()[0]);
+
+  // Compute local sum
+  const double local_sum = std::accumulate(local_values.begin(),
+                                           local_values.end(), 0.0);
+
+  return MPI::sum(mpi_comm(), local_sum);
+}
+//-----------------------------------------------------------------------------
+std::string PETScVector::str(bool verbose) const
+{
+  if (!_x)
+    return "<Uninitialized PETScVector>";
+
+  PetscErrorCode ierr;
+  std::stringstream s;
+  if (verbose)
+  {
+    // Get vector type
+    #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR <= 3
+    const VecType petsc_type;
+    #else
+    VecType petsc_type;
+    #endif
+    dolfin_assert(_x);
+    ierr = VecGetType(_x, &petsc_type);
+    if (ierr != 0) petsc_error(ierr, __FILE__, "VecGet");
+
+    if (strcmp(petsc_type, VECSEQ) == 0)
+    {
+      ierr = VecView(_x, PETSC_VIEWER_STDOUT_SELF);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "VecView");
+    }
+    else if (strcmp(petsc_type, VECMPI) == 0)
+    {
+      ierr = VecView(_x, PETSC_VIEWER_STDOUT_WORLD);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "VecView");
+    }
+    #ifdef HAS_PETSC_CUSP
+    else if (strcmp(petsc_type, VECSEQCUSP) == 0)
+    {
+      ierr = VecView(*_x, PETSC_VIEWER_STDOUT_SELF);
+      if (ierr != 0) petsc_error(ierr, __FILE__, "VecView");
+    // TODO: Uncomment these two lines after implementing MPI Cusp vectors
+    //else if (strcmp(petsc_type, VECMPICUSP) == 0)
+    //  VecView(*x, PETSC_VIEWER_STDOUT_WORLD);
+    }
+    #endif
+  }
+  else
+    s << "<PETScVector of size " << size() << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void PETScVector::gather(GenericVector& y,
+                         const std::vector<dolfin::la_index>& indices) const
+{
+  dolfin_assert(_x);
+  PetscErrorCode ierr;
+
+  // Down cast to a PETScVector
+  PETScVector& _y = as_type<PETScVector>(y);
+
+  // Prepare data for index sets (global indices)
+  std::vector<PetscInt> global_indices(indices.begin(), indices.end());
+
+  // Prepare data for index sets (local indices)
+  const std::size_t n = indices.size();
+
+  if (_y.empty())
+  {
+    // Initialise vector and make local
+    y.init(MPI_COMM_SELF, n);
+  }
+  else if (y.size() != n || MPI::size(y.mpi_comm()))
+  {
+    dolfin_error("PETScVector.cpp",
+                 "gather vector entries",
+                 "Cannot re-initialize gather vector. Must be empty, or have correct size and be a local vector");
+  }
+
+
+  // PETSc will bail out if it receives a NULL pointer even though m == 0.
+  // Can't return from function since function calls are collective.
+  if (n == 0)
+    global_indices.resize(1);
+
+  // Create local index sets
+  IS from, to;
+  ierr = ISCreateGeneral(PETSC_COMM_SELF, n, global_indices.data(),
+                         PETSC_COPY_VALUES, &from);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "ISCreateGeneral");
+  ierr = ISCreateStride(PETSC_COMM_SELF, n, 0 , 1, &to);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "ISCreateStride");
+
+
+  // Perform scatter
+  VecScatter scatter;
+  ierr = VecScatterCreate(_x, from, _y.vec(), to, &scatter);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScatterCreate");
+  ierr = VecScatterBegin(scatter, _x, _y.vec(), INSERT_VALUES,
+                         SCATTER_FORWARD);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScatterBegin");
+  ierr = VecScatterEnd(scatter, _x, _y.vec(), INSERT_VALUES,
+                       SCATTER_FORWARD);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScatterEnd");
+
+  // Clean up
+  ierr = VecScatterDestroy(&scatter);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScatterDestroy");
+  ierr = ISDestroy(&from);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "ISDestroy");
+  ierr = ISDestroy(&to);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "ISDestroy");
+}
+//-----------------------------------------------------------------------------
+void PETScVector::gather(std::vector<double>& x,
+                         const std::vector<dolfin::la_index>& indices) const
+{
+  x.resize(indices.size());
+  PETScVector y;
+  gather(y, indices);
+  dolfin_assert(y.local_size() == x.size());
+  y.get_local(x);
+}
+//-----------------------------------------------------------------------------
+void PETScVector::gather_on_zero(std::vector<double>& x) const
+{
+  PetscErrorCode ierr;
+
+  if (MPI::rank(mpi_comm()) == 0)
+    x.resize(size());
+  else
+    x.resize(0);
+
+  Vec vout;
+  VecScatter scatter;
+  ierr = VecScatterCreateToZero(_x, &scatter, &vout);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScatterCreateToZero");
+  ierr = VecScatterBegin(scatter, _x, vout, INSERT_VALUES, SCATTER_FORWARD);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScatterBegin");
+  ierr = VecScatterEnd(scatter, _x, vout, INSERT_VALUES, SCATTER_FORWARD);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScatterEnd");
+  ierr = VecScatterDestroy(&scatter);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecScatterDestroy");
+
+  // Wrap PETSc vector
+  if (MPI::rank(mpi_comm()) == 0)
+  {
+    PETScVector _vout(vout);
+    _vout.get_local(x);
+  }
+}
+//-----------------------------------------------------------------------------
+void PETScVector::_init(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range,
+                        const std::vector<la_index>& ghost_indices)
+{
+  PetscErrorCode ierr;
+  if (_x)
+  {
+    #ifdef DOLFIN_DEPRECATION_ERROR
+    error("PETScVector cannot be initialized more than once. Remove build definiton -DDOLFIN_DEPRECATION_ERROR to change this to a warning.");
+    #else
+    warning("PETScVector may not be initialized more than once. In version > 1.4, this will become an error.");
+    #endif
+    VecDestroy(&_x);
+  }
+
+  // GPU support does not work in parallel
+  if (_use_gpu && MPI::size(comm))
+  {
+    not_working_in_parallel("Due to limitations in PETSc, "
+                            "distributed PETSc Cusp vectors");
+  }
+
+  #ifdef HAS_PETSC_CUSP
+  ierr = VecSetType(_x, VECSEQCUSP);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecSetType");
+  #endif
+
+  const std::size_t local_size = range.second - range.first;
+  dolfin_assert(range.second >= range.first);
+
+  // Copy ghost indices
+  ierr = VecCreateGhost(comm, local_size, PETSC_DECIDE,
+                        ghost_indices.size(), ghost_indices.data(), &_x);
+  if (ierr != 0) petsc_error(ierr, __FILE__, "VecCreateGhost");
+
+  // Build global-to-local map for ghost indices
+  ghost_global_to_local.clear();
+  for (std::size_t i = 0; i < ghost_indices.size(); ++i)
+  {
+    ghost_global_to_local.insert(std::pair<std::size_t,
+                                 std::size_t>(ghost_indices[i], i));
+  }
+}
+//-----------------------------------------------------------------------------
+Vec PETScVector::vec() const
+{
+  return _x;
+}
+//-----------------------------------------------------------------------------
+GenericLinearAlgebraFactory& PETScVector::factory() const
+{
+  if (!_use_gpu)
+    return PETScFactory::instance();
+  #ifdef HAS_PETSC_CUSP
+  else
+    return PETScCuspFactory::instance();
+  #endif
+
+  // Return something to keep the compiler happy. Code will never be reached.
+  return PETScFactory::instance();
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/la/PETScVector.h b/dolfin/la/PETScVector.h
new file mode 100644
index 0000000..7023d5c
--- /dev/null
+++ b/dolfin/la/PETScVector.h
@@ -0,0 +1,258 @@
+// Copyright (C) 2004-2010 Johan Hoffman, Johan Jansson and Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2005-2010.
+// Modified by Kent-Andre Mardal, 2008.
+// Modified by Ola Skavhaug, 2008.
+// Modified by Martin Alnæs, 2008.
+// Modified by Fredrik Valdmanis, 2011.
+//
+// First added:  2004-01-01
+// Last changed: 2011-09-29
+
+#ifndef __PETSC_VECTOR_H
+#define __PETSC_VECTOR_H
+
+#ifdef HAS_PETSC
+
+#include <map>
+#include <string>
+#include <utility>
+#include <memory>
+#include <boost/unordered_map.hpp>
+#include <petscsys.h>
+#include <petscvec.h>
+
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/types.h>
+#include "GenericVector.h"
+#include "PETScObject.h"
+
+namespace dolfin
+{
+
+  class GenericSparsityPattern;
+  template<typename T> class Array;
+
+  /// This class provides a simple vector class based on PETSc.
+  /// It is a simple wrapper for a PETSc vector pointer (Vec)
+  /// implementing the GenericVector interface.
+  ///
+  /// The interface is intentionally simple. For advanced usage,
+  /// access the PETSc Vec pointer using the function vec() and
+  /// use the standard PETSc interface.
+
+  class PETScVector : public GenericVector, public PETScObject
+  {
+  public:
+
+    /// Create empty vector
+    PETScVector();
+
+    /// Create vector of size N
+    PETScVector(MPI_Comm comm, std::size_t N, bool use_gpu=false);
+
+    /// Create vector
+    explicit PETScVector(const GenericSparsityPattern& sparsity_pattern);
+
+    /// Copy constructor
+    PETScVector(const PETScVector& x);
+
+    /// Create vector wrapper of PETSc Vec pointer
+    explicit PETScVector(Vec x);
+
+    /// Destructor
+    virtual ~PETScVector();
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero();
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode);
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    //--- Implementation of the GenericVector interface ---
+
+    /// Return copy of vector
+    virtual std::shared_ptr<GenericVector> copy() const;
+
+    /// Initialize vector to global size N
+    virtual void init(MPI_Comm comm, std::size_t N);
+
+    /// Initialize vector with given ownership range
+    virtual void init(MPI_Comm comm,
+                      std::pair<std::size_t, std::size_t> range);
+
+    /// Initialize vector with given ownership range and with ghost values
+    virtual void init(MPI_Comm comm,
+                      std::pair<std::size_t, std::size_t> range,
+                      const std::vector<la_index>& ghost_indices);
+
+    // Bring init function from GenericVector into scope
+    using GenericVector::init;
+
+    /// Return true if vector is empty
+    virtual bool empty() const;
+
+    /// Return size of vector
+    virtual std::size_t size() const;
+
+    /// Return local size of vector
+    virtual std::size_t local_size() const;
+
+    /// Return ownership range of a vector
+    virtual std::pair<std::size_t, std::size_t> local_range() const;
+
+    /// Determine whether global vector index is owned by this process
+    virtual bool owns_index(std::size_t i) const;
+
+    /// Get block of values (values must all live on the local process)
+    virtual void get_local(double* block, std::size_t m,
+                           const dolfin::la_index* rows) const;
+
+    /// Set block of values
+    virtual void set(const double* block, std::size_t m,
+                     const dolfin::la_index* rows);
+
+    /// Add block of values
+    virtual void add(const double* block, std::size_t m,
+                     const dolfin::la_index* rows);
+
+    /// Get all values on local process
+    virtual void get_local(std::vector<double>& values) const;
+
+    /// Set all values on local process
+    virtual void set_local(const std::vector<double>& values);
+
+    /// Add values to each entry on local process
+    virtual void add_local(const Array<double>& values);
+
+    /// Gather vector entries into a local vector
+    virtual void gather(GenericVector& y,
+                        const std::vector<dolfin::la_index>& indices) const;
+
+    /// Gather entries into x
+    virtual void gather(std::vector<double>& x,
+                        const std::vector<dolfin::la_index>& indices) const;
+
+    /// Gather all entries into x on process 0
+    virtual void gather_on_zero(std::vector<double>& x) const;
+
+    /// Add multiple of given vector (AXPY operation)
+    virtual void axpy(double a, const GenericVector& x);
+
+    /// Replace all entries in the vector by their absolute values
+    virtual void abs();
+
+    /// Return inner product with given vector
+    virtual double inner(const GenericVector& v) const;
+
+    /// Return norm of vector
+    virtual double norm(std::string norm_type) const;
+
+    /// Return minimum value of vector
+    virtual double min() const;
+
+    /// Return maximum value of vector
+    virtual double max() const;
+
+    /// Return sum of values of vector
+    virtual double sum() const;
+
+    /// Return sum of selected rows in vector
+    virtual double sum(const Array<std::size_t>& rows) const;
+
+    /// Multiply vector by given number
+    virtual const PETScVector& operator*= (double a);
+
+    /// Multiply vector by another vector pointwise
+    virtual const PETScVector& operator*= (const GenericVector& x);
+
+    /// Divide vector by given number
+    virtual const PETScVector& operator/= (double a);
+
+    /// Add given vector
+    virtual const PETScVector& operator+= (const GenericVector& x);
+
+    /// Add number to all components of a vector
+    virtual const PETScVector& operator+= (double a);
+
+    /// Subtract given vector
+    virtual const PETScVector& operator-= (const GenericVector& x);
+
+    /// Subtract number from all components of a vector
+    virtual const PETScVector& operator-= (double a);
+
+    /// Assignment operator
+    virtual const GenericVector& operator= (const GenericVector& x);
+
+    /// Assignment operator
+    virtual const PETScVector& operator= (double a);
+
+    virtual void update_ghost_values();
+
+    //--- Special functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const;
+
+    //--- Special PETSc functions ---
+
+    /// Return pointer to PETSc Vec object
+    Vec vec() const;
+
+    /// Assignment operator
+    const PETScVector& operator= (const PETScVector& x);
+
+    friend class PETScBaseMatrix;
+    friend class PETScMatrix;
+
+  private:
+
+    // Initialise PETSc vector
+    void _init(MPI_Comm comm, std::pair<std::size_t, std::size_t> range,
+               const std::vector<la_index>& ghost_indices);
+
+    // Return true if vector is distributed
+    bool distributed() const;
+
+    // PETSc Vec pointer
+    Vec _x;
+
+    // Global-to-local map for ghost values
+    boost::unordered_map<std::size_t, std::size_t> ghost_global_to_local;
+
+    // PETSc norm types
+    static const std::map<std::string, NormType> norm_types;
+
+    // PETSc vector architecture
+    const bool _use_gpu;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/PaStiXLUSolver.cpp b/dolfin/la/PaStiXLUSolver.cpp
new file mode 100644
index 0000000..ab12160
--- /dev/null
+++ b/dolfin/la/PaStiXLUSolver.cpp
@@ -0,0 +1,294 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-10-19
+// Last changed:
+
+#include <algorithm>
+#include <numeric>
+#include <string>
+#include <vector>
+#include <boost/assign/list_of.hpp>
+
+// Necessary since pastix.h does not include it
+#include <stdint.h>
+
+#include "dolfin/common/MPI.h"
+#include "dolfin/common/NoDeleter.h"
+#include "dolfin/common/types.h"
+#include "dolfin/log/dolfin_log.h"
+#include "dolfin/parameter/GlobalParameters.h"
+#include "GenericVector.h"
+#include "SparsityPattern.h"
+#include "GenericMatrix.h"
+#include "LUSolver.h"
+#include "STLMatrix.h"
+#include "PaStiXLUSolver.h"
+
+#ifdef HAS_PASTIX
+
+extern "C"
+{
+#include <pastix.h>
+}
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Parameters PaStiXLUSolver::default_parameters()
+{
+  Parameters p(LUSolver::default_parameters());
+  p.rename("pastix_lu_solver");
+
+  // Number of threads per MPI process
+  p.add<std::size_t>("num_threads");
+
+  // Thread mode (see PaStiX user documentation)
+  const std::set<std::string> thread_modes
+    = boost::assign::list_of("multiple")("single")("funnel");
+  p.add<std::string>("thread_mode", thread_modes);
+
+  // Min/max block size for BLAS. This paramerers can have a significant
+  // effect on peformance. Best settings depends on systems and BLAS
+  // implementation.
+  p.add("min_block_size", 180);
+  p.add("max_block_size", 340);
+
+  // Check matrix for consistency
+  p.add("check_matrix", false);
+
+  // Renumber
+  p.add("renumber", true);
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+PaStiXLUSolver::PaStiXLUSolver(const STLMatrix& A)
+  : A(reference_to_no_delete_pointer(A))
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+PaStiXLUSolver::PaStiXLUSolver(std::shared_ptr<const STLMatrix> A) : A(A)
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+PaStiXLUSolver::~PaStiXLUSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t PaStiXLUSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  dolfin_assert(A);
+
+  // Get block size from STLMatrix
+  const std::size_t block_size = A->block_size();
+
+  // MPI communicator
+  MPI_Comm mpi_comm = A->mpi_comm();
+
+  // Intitialise PaStiX parameters
+  pastix_int_t iparm[IPARM_SIZE];
+  double dparm[DPARM_SIZE];
+  for (int i = 0; i < IPARM_SIZE; i++)
+    iparm[i] = 0;
+  for (int i = 0; i < DPARM_SIZE; i++)
+    dparm[i] = 0;
+
+  // Set default parameters
+  pastix_initParam(iparm, dparm);
+
+  // Set LU or Cholesky depending on operator symmetry
+  const bool symmetric = parameters["symmetric"];
+  if (symmetric)
+  {
+    iparm[IPARM_SYM] = API_SYM_YES;
+    //iparm[IPARM_FACTORIZATION] = API_FACT_LDLT;
+    iparm[IPARM_FACTORIZATION] = API_FACT_LLT;
+  }
+  else
+  {
+    iparm[IPARM_SYM] = API_SYM_NO;
+    iparm[IPARM_FACTORIZATION] = API_FACT_LU;
+  }
+
+  // Number of dofs per node (block size)
+  iparm[IPARM_DOF_NBR] = block_size;
+
+  // Set BLAS block sizes (affects performance)
+  const std::size_t min_block_size = parameters["min_block_size"];
+  iparm[IPARM_MIN_BLOCKSIZE] = min_block_size;
+  const std::size_t max_block_size = parameters["max_block_size"];
+  iparm[IPARM_MAX_BLOCKSIZE] = max_block_size;
+  //iparm[IPARM_ABS] = API_YES;
+
+  // Get matrix data in compressed sparse column format (C indexing)
+  std::vector<double> vals;
+  std::vector<pastix_int_t> rows, col_ptr, local_to_global_cols;
+  A->csc(vals, rows, col_ptr, local_to_global_cols, true, symmetric);
+
+  // Copy local-to-global
+  const std::vector<pastix_int_t> local_to_global_cols_ref
+    = local_to_global_cols;
+
+  // Convert to base 1
+  for (std::size_t i = 0;  i < rows.size(); ++i)
+    rows[i] += 1;
+  for (std::size_t i = 0;  i < col_ptr.size(); ++i)
+    col_ptr[i] += 1;
+  for (std::size_t i = 0;  i < local_to_global_cols.size(); ++i)
+    local_to_global_cols[i] += 1;
+
+  dolfin_assert(local_to_global_cols.size() > 0);
+
+  // Pointers to data structures
+  pastix_int_t* _col_ptr = col_ptr.data();
+  pastix_int_t* _rows = rows.data();
+  pastix_int_t* _local_to_global_cols = local_to_global_cols.data();
+
+  // Graph (matrix) distributed
+  iparm[IPARM_GRAPHDIST] = API_YES;
+
+  // Matrix size
+  const pastix_int_t n = (col_ptr.size() - 1);
+
+  // Check matrix
+  if (parameters["check_matrix"])
+  {
+    double* _vals = vals.data();
+    d_pastix_checkMatrix(mpi_comm, API_VERBOSE_YES, iparm[IPARM_SYM], API_NO,
+  		                   n, &_col_ptr, &_rows, &_vals,
+                         &_local_to_global_cols, block_size);
+  }
+  else
+    iparm[IPARM_MATRIX_VERIFICATION] = API_NO;
+
+  // PaStiX object
+  pastix_data_t* pastix_data = NULL;
+
+  // Number of threads per MPI process
+  if (parameters["num_threads"].is_set())
+  {
+    iparm[IPARM_THREAD_NBR]
+      = std::max((std::size_t) 1, (std::size_t) parameters["num_threads"]);
+  }
+  else
+  {
+    iparm[IPARM_THREAD_NBR] = std::max((std::size_t) 1,
+                            (std::size_t) dolfin::parameters["num_threads"]);
+  }
+
+  // PaStiX threading mode
+  if (parameters["thread_mode"].is_set())
+  {
+    const std::string thread_mode = parameters["thread_mode"];
+    if (thread_mode == "multiple")
+      iparm[IPARM_THREAD_COMM_MODE] = API_THREAD_MULTIPLE;
+    else if (thread_mode == "single")
+      iparm[IPARM_THREAD_COMM_MODE] = API_THREAD_COMM_ONE;
+    else if (thread_mode == "funnel")
+      iparm[IPARM_THREAD_COMM_MODE] = API_THREAD_FUNNELED;
+    else
+    {
+      dolfin_error("PaStiXLUSolver.cpp",
+                   "set PaStiX thread mode",
+                   "Unknown mode \"%s\"", thread_mode.c_str());
+    }
+  }
+
+  // User-supplied RHS
+  iparm[IPARM_RHS_MAKING] = API_RHS_B;
+
+  // Level of verbosity
+  if (parameters["verbose"])
+    iparm[IPARM_VERBOSE] = API_VERBOSE_YES;
+  else
+    iparm[IPARM_VERBOSE] = API_VERBOSE_NO;
+
+  // Allocate space for solver
+  dolfin_assert(local_to_global_cols.size() > 0);
+  std::vector<pastix_int_t> perm(local_to_global_cols.size());
+  std::vector<pastix_int_t> invp(local_to_global_cols.size());
+
+  // Renumbering
+  const bool renumber = parameters["renumber"];
+  if (!renumber)
+  {
+    iparm[IPARM_ORDERING] = API_ORDER_PERSONAL;
+    iparm[IPARM_LEVEL_OF_FILL] = -1;
+    iparm[IPARM_AMALGAMATION_LEVEL]  = 10;
+    for (std::size_t i = 0; i < local_to_global_cols.size(); ++i)
+    {
+      perm[i] = i + 1;
+      std::copy(perm.begin(), perm.end(), invp.begin());
+    }
+  }
+
+  // Number of RHS vectors
+  const pastix_int_t nrhs = 1;
+
+  // Re-order
+  iparm[IPARM_START_TASK] = API_TASK_ORDERING;
+  iparm[IPARM_END_TASK]   = API_TASK_BLEND;
+  d_dpastix(&pastix_data, mpi_comm, n, _col_ptr, _rows, vals.data(),
+            _local_to_global_cols, perm.data(), invp.data(), NULL, nrhs,
+            iparm, dparm);
+
+  // Factorise
+  iparm[IPARM_START_TASK] = API_TASK_NUMFACT;
+  iparm[IPARM_END_TASK]   = API_TASK_NUMFACT;
+  d_dpastix(&pastix_data, mpi_comm, n, _col_ptr, _rows, vals.data(),
+            _local_to_global_cols, perm.data(), invp.data(), NULL, nrhs,
+            iparm, dparm);
+
+  // Get RHS data for this process
+  std::vector<double> _b;
+  std::vector<dolfin::la_index> idx(block_size*n);
+  dolfin_assert((int) local_to_global_cols_ref.size() ==  n);
+  for (std::size_t i = 0; i < local_to_global_cols_ref.size(); ++i)
+    for (std::size_t j = 0; j < block_size; ++j)
+      idx[i*block_size + j] = local_to_global_cols_ref[i]*block_size + j;
+  b.gather(_b, idx);
+
+  // Solve
+  iparm[IPARM_START_TASK] = API_TASK_SOLVE;
+  iparm[IPARM_END_TASK] = API_TASK_SOLVE;
+  d_dpastix(&pastix_data, mpi_comm, n, _col_ptr, _rows, vals.data(),
+            _local_to_global_cols, perm.data(), invp.data(),
+            _b.data(), nrhs, iparm, dparm);
+
+  // Distribute solution
+  x.init(mpi_comm, b.local_range());
+  x.set(_b.data(), idx.size(), idx.data());
+  x.apply("insert");
+
+  // Clean up
+  iparm[IPARM_START_TASK] = API_TASK_CLEAN;
+  iparm[IPARM_END_TASK] = API_TASK_CLEAN;
+  d_dpastix(&pastix_data, mpi_comm, n, NULL, NULL, NULL,
+            _local_to_global_cols,
+            perm.data(), invp.data(),
+            _b.data(), nrhs, iparm, dparm);
+
+  return 1;
+}
+//-----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/la/PaStiXLUSolver.h b/dolfin/la/PaStiXLUSolver.h
new file mode 100644
index 0000000..ce563fa
--- /dev/null
+++ b/dolfin/la/PaStiXLUSolver.h
@@ -0,0 +1,69 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-10-16
+// Last changed:
+
+#ifndef __DOLFIN_PASTIXLUSOLVER_H
+#define __DOLFIN_PASTIXLUSOLVER_H
+
+#include <utility>
+#include <vector>
+#include <memory>
+#include <dolfin/common/types.h>
+#include <dolfin/common/Variable.h>
+
+#ifdef HAS_PASTIX
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericMatrix;
+  class GenericVector;
+  class SparsityPattern;
+  class STLMatrix;
+
+  class PaStiXLUSolver : public Variable
+  {
+  public:
+
+    /// Constructor
+    PaStiXLUSolver(const STLMatrix& A);
+
+    /// Constructor
+    PaStiXLUSolver(std::shared_ptr<const STLMatrix> A);
+
+    /// Destructor
+    virtual ~PaStiXLUSolver();
+
+    /// Solve Ax = b
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+  private:
+
+    std::shared_ptr<const STLMatrix> A;
+
+  };
+
+}
+
+#endif
+#endif
diff --git a/dolfin/la/SLEPcEigenSolver.cpp b/dolfin/la/SLEPcEigenSolver.cpp
new file mode 100644
index 0000000..0022e46
--- /dev/null
+++ b/dolfin/la/SLEPcEigenSolver.cpp
@@ -0,0 +1,409 @@
+// Copyright (C) 2005-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2008
+// Modified by Anders Logg 2008-2012
+// Modified by Marie Rognes 2009
+// Modified by Fredrik Valdmanis 2011
+//
+// First added:  2005-08-31
+// Last changed: 2012-02-22
+
+#ifdef HAS_SLEPC
+
+#include <slepcversion.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include "PETScMatrix.h"
+#include "PETScVector.h"
+#include "SLEPcEigenSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+SLEPcEigenSolver::SLEPcEigenSolver(const PETScMatrix& A)
+  : _matA(reference_to_no_delete_pointer(const_cast<PETScMatrix&>(A)))
+{
+  dolfin_assert(A.size(0) == A.size(1));
+
+  // Set default parameter values
+  parameters = default_parameters();
+
+  // Set up solver environment
+  EPSCreate(PETSC_COMM_WORLD, &eps);
+}
+//-----------------------------------------------------------------------------
+SLEPcEigenSolver::SLEPcEigenSolver(const PETScMatrix& A, const PETScMatrix& B)
+  : _matA(reference_to_no_delete_pointer(A)), _matB(reference_to_no_delete_pointer(B))
+{
+  dolfin_assert(A.size(0) == A.size(1));
+  dolfin_assert(B.size(0) == A.size(0));
+  dolfin_assert(B.size(1) == A.size(1));
+
+  // Set default parameter values
+  parameters = default_parameters();
+
+  // Set up solver environment
+  EPSCreate(PETSC_COMM_WORLD, &eps);
+}
+//-----------------------------------------------------------------------------
+SLEPcEigenSolver::SLEPcEigenSolver(std::shared_ptr<const PETScMatrix> A)
+  : _matA(A)
+{
+  dolfin_assert(A->size(0) == A->size(1));
+
+  // Set default parameter values
+  parameters = default_parameters();
+
+  // Set up solver environment
+  EPSCreate(PETSC_COMM_WORLD, &eps);
+}
+//-----------------------------------------------------------------------------
+SLEPcEigenSolver::SLEPcEigenSolver(std::shared_ptr<const PETScMatrix> A,
+                                   std::shared_ptr<const PETScMatrix> B)
+  : _matA(A), _matB(B)
+
+{
+  dolfin_assert(A->size(0) == A->size(1));
+  dolfin_assert(B->size(0) == A->size(0));
+  dolfin_assert(B->size(1) == A->size(1));
+
+  // Set default parameter values
+  parameters = default_parameters();
+
+  // Set up solver environment
+  EPSCreate(PETSC_COMM_WORLD, &eps);
+}
+//-----------------------------------------------------------------------------
+SLEPcEigenSolver::~SLEPcEigenSolver()
+{
+  // Destroy solver environment
+  if (eps)
+    EPSDestroy(&eps);
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::solve()
+{
+  solve(_matA->size(0));
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::solve(std::size_t n)
+{
+  dolfin_assert(_matA);
+
+  // Associate matrix (matrices) with eigenvalue solver
+  dolfin_assert(_matA->size(0) == _matA->size(1));
+  if (_matB)
+  {
+    dolfin_assert(_matB->size(0) == _matB->size(1) && _matB->size(0) == _matA->size(0));
+    EPSSetOperators(eps, _matA->mat(), _matB->mat());
+  }
+  else
+    EPSSetOperators(eps, _matA->mat(), PETSC_NULL);
+
+  // Set number of eigenpairs to compute
+  dolfin_assert(n <= _matA->size(0));
+  EPSSetDimensions(eps, n, PETSC_DECIDE, PETSC_DECIDE);
+
+  // Set parameters from local parameters
+  read_parameters();
+
+  // Set parameters from PETSc parameter database
+  std::string prefix = std::string(parameters["options_prefix"]);
+  if (prefix != "default")
+  {
+    // Make sure that the prefix has a '_' at the end if the user didn't provide it
+    char lastchar = *prefix.rbegin();
+    if (lastchar != '_')
+      prefix += "_";
+
+    EPSSetOptionsPrefix(eps, prefix.c_str());
+  }
+  EPSSetFromOptions(eps);
+
+  if (parameters["verbose"])
+  {
+    KSP ksp;
+    ST st;
+    EPSMonitorSet(eps, EPSMonitorAll, PETSC_NULL, PETSC_NULL);
+    EPSSetType(eps, EPSARPACK);
+    EPSGetST(eps, &st);
+    STGetKSP(st, &ksp);
+    KSPMonitorSet(ksp, KSPMonitorDefault, PETSC_NULL, PETSC_NULL);
+    EPSView(eps, PETSC_VIEWER_STDOUT_SELF);
+  }
+
+  // Solve
+  EPSSolve(eps);
+
+  // Check for convergence
+  EPSConvergedReason reason;
+  EPSGetConvergedReason(eps, &reason);
+  if (reason < 0)
+    warning("Eigenvalue solver did not converge");
+
+  // Report solver status
+  dolfin::la_index num_iterations = 0;
+  EPSGetIterationNumber(eps, &num_iterations);
+
+  #if SLEPC_VERSION_MAJOR == 3 && SLEPC_VERSION_MINOR < 4
+  const EPSType eps_type = NULL;
+  #else
+  EPSType eps_type = NULL;
+  #endif
+  EPSGetType(eps, &eps_type);
+  log(PROGRESS, "Eigenvalue solver (%s) converged in %d iterations.",
+      eps_type, num_iterations);
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::get_eigenvalue(double& lr, double& lc) const
+{
+  get_eigenvalue(lr, lc, 0);
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::get_eigenpair(double& lr, double& lc,
+                                     GenericVector& r, GenericVector& c) const
+{
+  PETScVector& _r = as_type<PETScVector>(r);
+  PETScVector& _c = as_type<PETScVector>(c);
+  get_eigenpair(lr, lc, _r, _c, 0);
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::get_eigenpair(double& lr, double& lc,
+                                     PETScVector& r, PETScVector& c) const
+{
+  get_eigenpair(lr, lc, r, c, 0);
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::get_eigenvalue(double& lr, double& lc,
+                                      std::size_t i) const
+{
+  const dolfin::la_index ii = static_cast<dolfin::la_index>(i);
+
+  // Get number of computed values
+  dolfin::la_index num_computed_eigenvalues;
+  EPSGetConverged(eps, &num_computed_eigenvalues);
+
+  if (ii < num_computed_eigenvalues)
+    EPSGetEigenvalue(eps, ii, &lr, &lc);
+  else
+  {
+    dolfin_error("SLEPcEigenSolver.cpp",
+                 "extract eigenvalue from SLEPc eigenvalue solver",
+                 "Requested eigenvalue (%d) has not been computed", i);
+  }
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::get_eigenpair(double& lr, double& lc,
+                                     GenericVector& r, GenericVector& c,
+                                     std::size_t i) const
+{
+  PETScVector& _r = as_type<PETScVector>(r);
+  PETScVector& _c = as_type<PETScVector>(c);
+  get_eigenpair(lr, lc, _r, _c, i);
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::get_eigenpair(double& lr, double& lc,
+                                     PETScVector& r, PETScVector& c,
+                                     std::size_t i) const
+{
+  const dolfin::la_index ii = static_cast<dolfin::la_index>(i);
+
+  // Get number of computed eigenvectors/values
+  dolfin::la_index num_computed_eigenvalues;
+  EPSGetConverged(eps, &num_computed_eigenvalues);
+
+  if (ii < num_computed_eigenvalues)
+  {
+    dolfin_assert(_matA);
+    _matA->init_vector(r, 0);
+    _matA->init_vector(c, 0);
+
+    dolfin_assert(r.vec());
+    dolfin_assert(c.vec());
+    EPSGetEigenpair(eps, ii, &lr, &lc, r.vec(), c.vec());
+  }
+  else
+  {
+    dolfin_error("SLEPcEigenSolver.cpp",
+                 "extract eigenpair from SLEPc eigenvalue solver",
+                 "Requested eigenpair (%d) has not been computed", i);
+  }
+}
+//-----------------------------------------------------------------------------
+std::size_t SLEPcEigenSolver::get_number_converged() const
+{
+  dolfin::la_index num_conv;
+  EPSGetConverged(eps, &num_conv);
+  return num_conv;
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::set_deflation_space(const PETScVector& deflation_space)
+{
+  Vec x = deflation_space.vec();
+  EPSSetDeflationSpace(eps, 1, &x);
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::read_parameters()
+{
+  set_problem_type(parameters["problem_type"]);
+  set_spectrum(parameters["spectrum"]);
+  set_solver(parameters["solver"]);
+  set_tolerance(parameters["tolerance"], parameters["maximum_iterations"]);
+  set_spectral_transform(parameters["spectral_transform"],
+                         parameters["spectral_shift"]);
+
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::set_problem_type(std::string type)
+{
+  // Do nothing if default type is specified
+  if (type == "default")
+    return;
+
+  if (type == "hermitian")
+    EPSSetProblemType(eps, EPS_HEP);
+  else if (type == "non_hermitian")
+    EPSSetProblemType(eps, EPS_NHEP);
+  else if (type == "gen_hermitian")
+    EPSSetProblemType(eps, EPS_GHEP);
+  else if (type == "gen_non_hermitian")
+    EPSSetProblemType(eps, EPS_GNHEP);
+  else if (type == "pos_gen_non_hermitian")
+    EPSSetProblemType(eps, EPS_PGNHEP);
+  else
+  {
+    dolfin_error("SLEPcEigenSolver.cpp",
+                 "set problem type for SLEPc eigensolver",
+                 "Unknown problem type (\"%s\")", type.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::set_spectral_transform(std::string transform,
+                                              double shift)
+{
+  if (transform == "default")
+    return;
+
+  ST st;
+  EPSGetST(eps, &st);
+  if (transform == "shift-and-invert")
+  {
+    STSetType(st, STSINVERT);
+    STSetShift(st, shift);
+  }
+  else
+  {
+    dolfin_error("SLEPcEigenSolver.cpp",
+                 "set spectral transform for SLEPc eigensolver",
+                 "Unknown transform (\"%s\")", transform.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::set_spectrum(std::string spectrum)
+{
+  // Do nothing if default type is specified
+  if (spectrum == "default")
+    return;
+
+  // Choose spectrum
+  if (spectrum == "largest magnitude")
+    EPSSetWhichEigenpairs(eps, EPS_LARGEST_MAGNITUDE);
+  else if (spectrum == "smallest magnitude")
+    EPSSetWhichEigenpairs(eps, EPS_SMALLEST_MAGNITUDE);
+  else if (spectrum == "largest real")
+    EPSSetWhichEigenpairs(eps, EPS_LARGEST_REAL);
+  else if (spectrum == "smallest real")
+    EPSSetWhichEigenpairs(eps, EPS_SMALLEST_REAL);
+  else if (spectrum == "largest imaginary")
+    EPSSetWhichEigenpairs(eps, EPS_LARGEST_IMAGINARY);
+  else if (spectrum == "smallest imaginary")
+    EPSSetWhichEigenpairs(eps, EPS_SMALLEST_IMAGINARY);
+  else if (spectrum == "target magnitude")
+  {
+    EPSSetWhichEigenpairs(eps, EPS_TARGET_MAGNITUDE);
+    EPSSetTarget(eps, parameters["spectral_shift"]);
+  }
+  else if (spectrum == "target real")
+  {
+    EPSSetWhichEigenpairs(eps, EPS_TARGET_REAL);
+    EPSSetTarget(eps, parameters["spectral_shift"]);
+  }
+  else if (spectrum == "target imaginary")
+  {
+    EPSSetWhichEigenpairs(eps, EPS_TARGET_IMAGINARY);
+    EPSSetTarget(eps, parameters["spectral_shift"]);
+  }
+  else
+  {
+    dolfin_error("SLEPcEigenSolver.cpp",
+                 "set spectrum for SLEPc eigensolver",
+                 "Unknown spectrum type (\"%s\")", spectrum.c_str());
+  }
+
+  // FIXME: Need to add some test here as most algorithms only compute
+  // FIXME: largest eigenvalues. Asking for smallest leads to a PETSc error.
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::set_solver(std::string solver)
+{
+  // Do nothing if default type is specified
+  if (solver == "default")
+    return;
+
+  // Choose solver
+
+  // (Note that lanczos will give PETSc error unless problem_type is
+  // set to 'hermitian' or 'gen_hermitian')
+  if (solver == "power")
+    EPSSetType(eps, EPSPOWER);
+  else if (solver == "subspace")
+    EPSSetType(eps, EPSSUBSPACE);
+  else if (solver == "arnoldi")
+    EPSSetType(eps, EPSARNOLDI);
+  else if (solver == "lanczos")
+    EPSSetType(eps, EPSLANCZOS);
+  else if (solver == "krylov-schur")
+    EPSSetType(eps, EPSKRYLOVSCHUR);
+  else if (solver == "lapack")
+    EPSSetType(eps, EPSLAPACK);
+  else if (solver == "arpack")
+    EPSSetType(eps, EPSARPACK);
+  else
+  {
+    dolfin_error("SLEPcEigenSolver.cpp",
+                 "set solver for SLEPc eigensolver",
+                 "Unknown solver type (\"%s\")", solver.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void SLEPcEigenSolver::set_tolerance(double tolerance, std::size_t maxiter)
+{
+  dolfin_assert(tolerance > 0.0);
+  EPSSetTolerances(eps, tolerance, maxiter);
+}
+//-----------------------------------------------------------------------------
+std::size_t SLEPcEigenSolver::get_iteration_number() const
+{
+  dolfin::la_index num_iter;
+  EPSGetIterationNumber(eps, &num_iter);
+  return num_iter;
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/SLEPcEigenSolver.h b/dolfin/la/SLEPcEigenSolver.h
new file mode 100644
index 0000000..d86710d
--- /dev/null
+++ b/dolfin/la/SLEPcEigenSolver.h
@@ -0,0 +1,240 @@
+// Copyright (C) 2005-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug, 2008.
+// Modified by Anders Logg, 2008.
+// Modified by Marie Rognes, 2009.
+//
+// First added:  2005-08-31
+// Last changed: 2011-02-02
+
+#ifndef __SLEPC_EIGEN_SOLVER_H
+#define __SLEPC_EIGEN_SOLVER_H
+
+#ifdef HAS_SLEPC
+
+#include <string>
+#include <memory>
+#include <slepceps.h>
+#include "dolfin/common/types.h"
+#include "PETScObject.h"
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class GenericVector;
+  class PETScMatrix;
+  class PETScVector;
+
+  /// This class provides an eigenvalue solver for PETSc matrices.
+  /// It is a wrapper for the SLEPc eigenvalue solver.
+  ///
+  /// The following parameters may be specified to control the solver.
+  ///
+  /// 1. "spectrum"
+  ///
+  /// This parameter controls which part of the spectrum to compute.
+  /// Possible values are
+  ///
+  ///   "largest magnitude"   (eigenvalues with largest magnitude)
+  ///   "smallest magnitude"  (eigenvalues with smallest magnitude)
+  ///   "largest real"        (eigenvalues with largest double part)
+  ///   "smallest real"       (eigenvalues with smallest double part)
+  ///   "largest imaginary"   (eigenvalues with largest imaginary part)
+  ///   "smallest imaginary"  (eigenvalues with smallest imaginary part)
+  ///
+  /// For SLEPc versions >= 3.1 , the following values are also possible
+  ///
+  ///   "target magnitude"    (eigenvalues closest to target in magnitude)
+  ///   "target real"         (eigenvalues closest to target in real part)
+  ///   "target imaginary"    (eigenvalues closest to target in imaginary part)
+  ///
+  /// The default is "largest magnitude"
+  ///
+  /// 2. "solver"
+  ///
+  /// This parameter controls which algorithm is used by SLEPc.
+  /// Possible values are
+  ///
+  ///   "power"               (power iteration)
+  ///   "subspace"            (subspace iteration)
+  ///   "arnoldi"             (Arnoldi)
+  ///   "lanczos"             (Lanczos)
+  ///   "krylov-schur"        (Krylov-Schur)
+  ///   "lapack"              (LAPACK, all values, direct, small systems only)
+  ///   "arpack"              (ARPACK)
+  ///
+  /// The default is "krylov-schur"
+  ///
+  /// 3. "tolerance"
+  ///
+  /// This parameter controls the tolerance used by SLEPc.
+  /// Possible values are positive double numbers.
+  ///
+  /// The default is 1e-15;
+  ///
+  /// 4. "maximum_iterations"
+  ///
+  /// This parameter controls the maximum number of iterations used by SLEPc.
+  /// Possible values are positive integers.
+  ///
+  /// Note that both the tolerance and the number of iterations must be
+  /// specified if either one is specified.
+  ///
+  /// 5. "problem_type"
+  ///
+  /// This parameter can be used to give extra information about the
+  /// type of the eigenvalue problem. Some solver types require this
+  /// extra piece of information. Possible values are:
+  ///
+  ///   "hermitian"               (Hermitian)
+  ///   "non_hermitian"           (Non-Hermitian)
+  ///   "gen_hermitian"           (Generalized Hermitian)
+  ///   "gen_non_hermitian"       (Generalized Non-Hermitian)
+  ///   "pos_gen_non_hermitian"   (Generalized Non-Hermitian with positive semidefinite B)
+  ///
+  /// 6. "spectral_transform"
+  ///
+  /// This parameter controls the application of a spectral transform. A
+  /// spectral transform can be used to enhance the convergence of the
+  /// eigensolver and in particular to only compute eigenvalues in the
+  /// interior of the spectrum. Possible values are:
+  ///
+  ///   "shift-and-invert"      (A shift-and-invert transform)
+  ///
+  /// Note that if a spectral transform is given, then also a non-zero
+  /// spectral shift parameter has to be provided.
+  ///
+  /// The default is no spectral transform.
+  ///
+  /// 7. "spectral_shift"
+  ///
+  /// This parameter controls the spectral shift used by the spectral
+  /// transform and must be provided if a spectral transform is given. The
+  /// possible values are real numbers.
+  ///
+
+  class SLEPcEigenSolver : public Variable, public PETScObject
+  {
+  public:
+
+    /// Create eigenvalue solver for Ax = \lambda x
+    SLEPcEigenSolver(const PETScMatrix& A);
+
+    /// Create eigenvalue solver Ax = \lambda Bx
+    SLEPcEigenSolver(const PETScMatrix& A, const PETScMatrix& B);
+
+    /// Create eigenvalue solver for Ax = \lambda x
+    SLEPcEigenSolver(std::shared_ptr<const PETScMatrix> A);
+
+    /// Create eigenvalue solver for Ax = \lambda x
+    SLEPcEigenSolver(std::shared_ptr<const PETScMatrix> A,
+                     std::shared_ptr<const PETScMatrix> B);
+
+    /// Destructor
+    ~SLEPcEigenSolver();
+
+    /// Compute all eigenpairs of the matrix A (solve Ax = \lambda x)
+    void solve();
+
+    /// Compute the n first eigenpairs of the matrix A (solve Ax = \lambda x)
+    void solve(std::size_t n);
+
+    /// Get the first eigenvalue
+    void get_eigenvalue(double& lr, double& lc) const;
+
+    /// Get the first eigenpair
+    void get_eigenpair(double& lr, double& lc,
+                       GenericVector& r, GenericVector& c) const;
+
+    /// Get the first eigenpair
+    void get_eigenpair(double& lr, double& lc,
+                       PETScVector& r, PETScVector& c) const;
+
+    /// Get eigenvalue i
+    void get_eigenvalue(double& lr, double& lc, std::size_t i) const;
+
+    /// Get eigenpair i
+    void get_eigenpair(double& lr, double& lc,
+                       GenericVector& r, GenericVector& c, std::size_t i) const;
+
+    /// Get eigenpair i
+    void get_eigenpair(double& lr, double& lc,
+                       PETScVector& r, PETScVector& c, std::size_t i) const;
+
+    // Get the number of iterations used by the solver
+    std::size_t get_iteration_number() const;
+
+    // Get the number of converged eigenvalues
+    std::size_t get_number_converged() const;
+
+    // Set deflation space
+    void set_deflation_space(const PETScVector& deflation_space);
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("slepc_eigenvalue_solver");
+
+      p.add("problem_type",       "default");
+      p.add("spectrum",           "largest magnitude");
+      p.add("solver",             "krylov-schur");
+      p.add("tolerance",          1e-15);
+      p.add("maximum_iterations", 10000);
+      p.add("spectral_transform", "default");
+      p.add("spectral_shift",     0.0);
+      p.add("verbose",            false);
+      p.add("options_prefix",     "default");
+
+      return p;
+    }
+
+  private:
+
+    /// Callback for changes in parameter values
+    void read_parameters();
+
+    // Set problem type (used for SLEPc internals)
+    void set_problem_type(std::string type);
+
+    // Set spectral transform
+    void set_spectral_transform(std::string transform, double shift);
+
+    // Set spectrum
+    void set_spectrum(std::string solver);
+
+    // Set solver
+    void set_solver(std::string spectrum);
+
+    // Set tolerance
+    void set_tolerance(double tolerance, std::size_t maxiter);
+
+    // Operators (A x = \lambda x or Ax = \lambda B x)
+    std::shared_ptr<const PETScMatrix> _matA;
+    std::shared_ptr<const PETScMatrix> _matB;
+
+    // SLEPc solver pointer
+    EPS eps;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/STLFactory.cpp b/dolfin/la/STLFactory.cpp
new file mode 100644
index 0000000..f097e3e
--- /dev/null
+++ b/dolfin/la/STLFactory.cpp
@@ -0,0 +1,28 @@
+// Copyright (C) 2007 Ilmar Wilbers
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008.
+//
+// First added:  2008-05-21
+// Last changed: 2008-08-07
+
+#include "STLFactory.h"
+
+using namespace dolfin;
+
+// Singleton instance
+STLFactory STLFactory::factory;
diff --git a/dolfin/la/STLFactory.h b/dolfin/la/STLFactory.h
new file mode 100644
index 0000000..d32fdbb
--- /dev/null
+++ b/dolfin/la/STLFactory.h
@@ -0,0 +1,115 @@
+// Copyright (C) 2007 Ilmar Wilbers
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2012
+// Modified by Garth N. Wells 2012
+//
+// First added:  2008-05-21
+// Last changed: 2012-08-20
+
+#ifndef __DOLFIN_STL_FACTORY_H
+#define __DOLFIN_STL_FACTORY_H
+
+#include <memory>
+#include <dolfin/log/log.h>
+#include "GenericLinearAlgebraFactory.h"
+#include "STLMatrix.h"
+#include "STLVector.h"
+#include "TensorLayout.h"
+#include "Vector.h"
+
+namespace dolfin
+{
+
+  class STLFactory: public GenericLinearAlgebraFactory
+  {
+  public:
+
+    /// Destructor
+    virtual ~STLFactory() {}
+
+    /// Create empty matrix
+    std::shared_ptr<GenericMatrix> create_matrix() const
+    {
+      std::shared_ptr<GenericMatrix> A(new STLMatrix);
+      return A;
+    }
+
+    /// Create empty vector
+    std::shared_ptr<GenericVector> create_vector() const
+    {
+      std::shared_ptr<GenericVector> x(new STLVector);
+      return x;
+    }
+
+    /// Create empty tensor layout
+    std::shared_ptr<TensorLayout> create_layout(std::size_t rank) const
+    {
+      std::shared_ptr<TensorLayout> pattern(new TensorLayout(0, false));
+      return pattern;
+    }
+
+    /// Create empty linear operator
+    std::shared_ptr<GenericLinearOperator> create_linear_operator() const
+    {
+      dolfin_error("STLFactory.h",
+                   "create linear operator",
+                   "Not supported by STL linear algebra backend");
+      std::shared_ptr<GenericLinearOperator>
+        A(new NotImplementedLinearOperator);
+      return A;
+    }
+
+    /// Create LU solver
+    std::shared_ptr<GenericLUSolver>
+      create_lu_solver(std::string method) const
+    {
+      dolfin_error("STLFactory",
+                   "create LU solver",
+                   "LU solver not available for the STL backend");
+      std::shared_ptr<GenericLUSolver> solver;
+      return solver;
+    }
+
+    /// Create Krylov solver
+    std::shared_ptr<GenericLinearSolver>
+      create_krylov_solver(std::string method,
+                           std::string preconditioner) const
+    {
+      dolfin_error("STLFactory",
+                   "create Krylov solver",
+                   "Krylov solver not available for the STL backend");
+      std::shared_ptr<GenericLinearSolver> solver;
+      return solver;
+    }
+
+    /// Return singleton instance
+    static STLFactory& instance()
+    { return factory; }
+
+  protected:
+
+    // Private Constructor
+    STLFactory() {}
+
+    // Singleton instance
+    static STLFactory factory;
+
+  };
+}
+
+#endif
diff --git a/dolfin/la/STLFactoryCSC.cpp b/dolfin/la/STLFactoryCSC.cpp
new file mode 100644
index 0000000..583b874
--- /dev/null
+++ b/dolfin/la/STLFactoryCSC.cpp
@@ -0,0 +1,26 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-21
+// Last changed:
+
+#include "STLFactoryCSC.h"
+
+using namespace dolfin;
+
+// Singleton instance
+STLFactoryCSC STLFactoryCSC::factory;
diff --git a/dolfin/la/STLFactoryCSC.h b/dolfin/la/STLFactoryCSC.h
new file mode 100644
index 0000000..1cc0ec7
--- /dev/null
+++ b/dolfin/la/STLFactoryCSC.h
@@ -0,0 +1,60 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-21
+// Last changed:
+
+#ifndef __DOLFIN_STL_FACTORY_CSC_H
+#define __DOLFIN_STL_FACTORY_CSC_H
+
+#include <memory>
+#include "TensorLayout.h"
+#include "STLFactory.h"
+
+namespace dolfin
+{
+
+  class STLFactoryCSC : public STLFactory
+  {
+  public:
+
+    /// Destructor
+    virtual ~STLFactoryCSC() {}
+
+    /// Create empty tensor layout
+    virtual std::shared_ptr<TensorLayout> create_layout(std::size_t rank) const
+    {
+      std::shared_ptr<TensorLayout> pattern(new TensorLayout(1, false));
+      return pattern;
+    }
+
+    /// Return singleton instance
+    static STLFactoryCSC& instance()
+    { return factory; }
+
+  private:
+
+    /// Private Constructor
+    STLFactoryCSC() {}
+
+    // Singleton instance
+    static STLFactoryCSC factory;
+
+  };
+}
+
+#endif
diff --git a/dolfin/la/STLMatrix.cpp b/dolfin/la/STLMatrix.cpp
new file mode 100644
index 0000000..ccdd57e
--- /dev/null
+++ b/dolfin/la/STLMatrix.cpp
@@ -0,0 +1,470 @@
+// Copyright (C) 2007-2012 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2007
+// Modified by Ilmar Wilbers 2008
+//
+// First added:  2007-01-17
+// Last changed: 2012-03-15
+
+#include <algorithm>
+#include <iomanip>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <boost/serialization/utility.hpp>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/types.h>
+#include "STLFactory.h"
+#include "STLFactoryCSC.h"
+#include "STLMatrix.h"
+
+using namespace dolfin;
+
+struct CompareIndex
+{
+  CompareIndex(std::size_t index) : _index(index) {}
+  bool operator()(const std::pair<std::size_t, double>& entry) const
+  { return _index == entry.first; }
+  private:
+    const std::size_t _index;
+};
+
+//-----------------------------------------------------------------------------
+void STLMatrix::init(const TensorLayout& tensor_layout)
+{
+  // Check that sparsity pattern has correct storage (row vs column storage)
+  if (_primary_dim != tensor_layout.primary_dim)
+  {
+    dolfin_error("STLMatrix.cpp",
+                 "initialization of STL matrix",
+                 "Primary storage dim of matrix and tensot layout must be the same");
+  }
+
+  // Get MPI communicator
+  _mpi_comm = tensor_layout.mpi_comm();
+
+  // Set co-dimension
+  std::size_t primary_codim = 1;
+  if (_primary_dim == 1)
+    primary_codim = 0;
+
+  // Set block size
+  _block_size = tensor_layout.block_size;
+
+  _local_range = tensor_layout.local_range(_primary_dim);
+  num_codim_entities = tensor_layout.size(primary_codim);
+
+  const std::size_t num_primary_entiries = _local_range.second
+    - _local_range.first;
+
+  _values.resize(num_primary_entiries);
+
+  // FIXME: Add function to sparsity pattern to get nnz per row to
+  //        to reserve space for vectors
+  //if (tensor_layout.sparsity_pattern()
+  //{
+  //  Reserve space here
+  //}
+}
+//-----------------------------------------------------------------------------
+std::size_t STLMatrix::size(std::size_t dim) const
+{
+  if (dim > 1)
+  {
+    dolfin_error("STLMatrix.cpp",
+                 "access size of STL matrix",
+                 "Illegal axis (%d), must be 0 or 1", dim);
+  }
+
+  if (_primary_dim == 0)
+  {
+    if (dim == 0)
+    {
+      return dolfin::MPI::sum(_mpi_comm,
+                              _local_range.second - _local_range.first);
+    }
+    else
+      return num_codim_entities;
+  }
+  else
+  {
+    if (dim == 0)
+      return num_codim_entities;
+    else
+    {
+      return dolfin::MPI::sum(_mpi_comm,
+                              _local_range.second - _local_range.first);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+STLMatrix::local_range(std::size_t dim) const
+{
+  dolfin_assert(dim < 2);
+  if (_primary_dim == 0)
+  {
+    if (dim == 0)
+      return _local_range;
+    else
+      return std::make_pair(0, num_codim_entities);
+  }
+  else
+  {
+    if (dim == 0)
+      return std::make_pair(0, num_codim_entities);
+    else
+      return _local_range;
+  }
+}
+//-----------------------------------------------------------------------------
+void STLMatrix::zero()
+{
+  std::vector<std::vector<std::pair<std::size_t, double> > >::iterator slice;
+  std::vector<std::pair<std::size_t, double> >::iterator entry;
+  for (slice = _values.begin(); slice != _values.end(); ++slice)
+    for (entry = slice->begin(); entry != slice->end(); ++entry)
+      entry->second = 0.0;
+}
+//-----------------------------------------------------------------------------
+void STLMatrix::add(const double* block,
+                    std::size_t m, const dolfin::la_index* rows,
+                    std::size_t n, const dolfin::la_index* cols)
+{
+  // Perform a simple linear search along each column. Otherwise,
+  // append the value (calling push_back).
+
+  const dolfin::la_index* primary_slice = rows;
+  const dolfin::la_index* secondary_slice = cols;
+
+  std::size_t dim   = m;
+  std::size_t codim = n;
+  std::size_t map0  = 1;
+  std::size_t map1  = n;
+  if (_primary_dim == 1)
+  {
+    dim = n;
+    codim = m;
+    map0  = n;
+    map1  = 1;
+  }
+
+  // Iterate over primary dimension
+  for (std::size_t i = 0; i < dim; i++)
+  {
+    // Global primary index
+    const std::size_t I = primary_slice[i];
+
+    // Check if I is a local row/column
+    if (I < _local_range.second && I >= _local_range.first)
+    {
+      const std::size_t I_local = I - _local_range.first;
+
+      assert(I_local < _values.size());
+      std::vector<std::pair<std::size_t, double> >& slice = _values[I_local];
+
+      // Iterate over co-dimension
+      for (std::size_t j = 0; j < codim; j++)
+      {
+        const std::size_t pos = i*map1 + j*map0;
+
+        // Global index
+        const std::size_t J = secondary_slice[j];
+
+        // Check if entry exists and insert
+        std::vector<std::pair<std::size_t, double> >::iterator entry
+              = std::find_if(slice.begin(), slice.end(), CompareIndex(J));
+        if (entry != slice.end())
+          entry->second += block[pos];
+        else
+          slice.push_back(std::make_pair(J, block[pos]));
+      }
+    }
+    else
+    {
+      // Iterate over columns
+      for (std::size_t j = 0; j < n; j++)
+      {
+        // Global column, coordinate
+        const std::size_t J = secondary_slice[j];
+        const std::pair<std::size_t, std::size_t> global_coordinate(I, J);
+        //const std::size_t pos = i*n + j;
+        const std::size_t pos = i*map1 + j*map0;
+
+        boost::unordered_map<std::pair<std::size_t,
+                                       std::size_t>, double>::iterator coord;
+        coord = off_processs_data.find(global_coordinate);
+        if (coord == off_processs_data.end())
+          off_processs_data[global_coordinate] = block[pos];
+        else
+          coord->second += block[pos];
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void STLMatrix::apply(std::string mode)
+{
+  Timer timer("Apply (STLMatrix)");
+
+  // Number of processes
+  const std::size_t num_processes = MPI::size(_mpi_comm);
+
+  // Data to send
+  std::vector<std::vector<std::size_t> > send_non_local_rows(num_processes);
+  std::vector<std::vector<std::size_t> > send_non_local_cols(num_processes);
+  std::vector<std::vector<double> > send_non_local_vals(num_processes);
+
+  std::vector<std::size_t> range(2);
+  range[0] = _local_range.first;
+  range[1] = _local_range.second;
+  std::vector<std::size_t> process_ranges;
+  dolfin::MPI::all_gather(_mpi_comm, range, process_ranges);
+
+  // Communicate off-process data
+  boost::unordered_map<std::pair<std::size_t,
+                                 std::size_t>, double>::const_iterator entry;
+  for (entry = off_processs_data.begin(); entry != off_processs_data.end();
+       ++entry)
+  {
+    const std::size_t global_row = entry->first.first;
+
+    // FIXME: This can be more efficient by storing sparsity pattern,
+    //        or caching owning process for repeated assembly
+
+    // Get owning process
+    std::size_t owner = 0;
+    for (std::size_t proc = 0; proc < num_processes; ++proc)
+    {
+      if (global_row < process_ranges[2*proc + 1]
+          && global_row >= process_ranges[2*proc])
+      {
+        owner = proc;
+        break;
+      }
+    }
+
+    send_non_local_rows[owner].push_back(global_row);
+    send_non_local_cols[owner].push_back(entry->first.second);
+    send_non_local_vals[owner].push_back(entry->second);
+  }
+
+  // Send/receive data
+  std::vector<std::vector<std::size_t> > received_non_local_rows;
+  std::vector<std::vector<std::size_t> > received_non_local_cols;
+  std::vector<std::vector<double> > received_non_local_vals;
+  dolfin::MPI::all_to_all(_mpi_comm, send_non_local_rows,
+                          received_non_local_rows);
+  dolfin::MPI::all_to_all(_mpi_comm, send_non_local_cols,
+                          received_non_local_cols);
+  dolfin::MPI::all_to_all(_mpi_comm, send_non_local_vals,
+                          received_non_local_vals);
+
+  // Add/insert off-process data
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    const std::vector<std::size_t>& received_non_local_rows_p
+      = received_non_local_rows[p];
+    const std::vector<std::size_t>& received_non_local_cols_p
+      = received_non_local_cols[p];
+    const std::vector<double>& received_non_local_vals_p
+      = received_non_local_vals[p];
+
+    dolfin_assert(received_non_local_rows_p.size()
+           == received_non_local_cols_p.size());
+    dolfin_assert(received_non_local_rows_p.size()
+           == received_non_local_vals_p.size());
+
+    for (std::size_t i = 0; i < received_non_local_rows_p.size(); ++i)
+    {
+      dolfin_assert(received_non_local_rows_p[i] < _local_range.second
+                    && received_non_local_rows_p[i] >= _local_range.first);
+      const std::size_t I_local
+        = received_non_local_rows_p[i] - _local_range.first;
+      dolfin_assert(I_local < _values.size());
+
+      const std::size_t J = received_non_local_cols_p[i];
+      std::vector<std::pair<std::size_t, double> >::iterator e
+            = std::find_if(_values[I_local].begin(), _values[I_local].end(),
+                           CompareIndex(J));
+      if (e != _values[I_local].end())
+        e->second += received_non_local_vals_p[i];
+      else
+        _values[I_local].push_back(std::make_pair(J,
+                                               received_non_local_vals_p[i]));
+    }
+  }
+
+  // Sort columns (csr)/rows (csc)
+  sort();
+}
+//-----------------------------------------------------------------------------
+double STLMatrix::norm(std::string norm_type) const
+{
+  if (norm_type != "frobenius")
+    error("Do not know to comput %s norm for STLMatrix", norm_type.c_str());
+
+  double _norm = 0.0;
+  for (std::size_t i = 0; i < _values.size(); ++i)
+  {
+    for (std::size_t j = 0; j < _values[i].size(); ++j)
+      _norm += _values[i][j].second*_values[i][j].second;
+  }
+  return std::sqrt(dolfin::MPI::sum(_mpi_comm, _norm));
+}
+//-----------------------------------------------------------------------------
+void STLMatrix::getrow(std::size_t row, std::vector<std::size_t>& columns,
+                       std::vector<double>& values) const
+{
+  if (_primary_dim == 1)
+  {
+    dolfin_error("STLMatrix.cpp",
+                 "getting row from matrix",
+                 "A row can only be extract from a STLMatrix that use row-wise storage.");
+  }
+
+  dolfin_assert(row < _local_range.second && row >= _local_range.first);
+  const std::size_t local_row = row - _local_range.first;
+  dolfin_assert(local_row < _values.size());
+
+  // Copy row values
+  columns.resize(_values[local_row].size());
+  values.resize(_values[local_row].size());
+  for (std::size_t i = 0; i < _values[local_row].size(); ++i)
+  {
+    columns[i] = _values[local_row][i].first;
+    values[i]  = _values[local_row][i].second;
+  }
+}
+//-----------------------------------------------------------------------------
+void STLMatrix::ident(std::size_t m, const dolfin::la_index* rows)
+{
+  if (_primary_dim == 1)
+  {
+    dolfin_error("STLMatrix.cpp",
+                 "creating identity row",
+                 "STLMatrix::ident can only be used with row-wise storage.");
+  }
+
+  std::pair<std::size_t, std::size_t> row_range = local_range(0);
+  for (std::size_t i = 0; i < m; ++i)
+  {
+    const std::size_t global_row = rows[i];
+    if (global_row >= row_range.first && global_row < row_range.second)
+    {
+      const std::size_t local_row = global_row - row_range.first;
+      dolfin_assert(local_row < _values.size());
+      for (std::size_t j = 0; j < _values[local_row].size(); ++j)
+        _values[local_row][j].second = 0.0;
+
+      // Place one on diagonal
+      std::vector<std::pair<std::size_t, double> >::iterator diagonal
+          = std::find_if(_values[local_row].begin(), _values[local_row].end(),
+                         CompareIndex(global_row));
+
+      if (diagonal != _values[local_row].end())
+        diagonal->second = 1.0;
+      else
+        _values[local_row].push_back(std::make_pair(global_row, 1.0));
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+const STLMatrix& STLMatrix::operator*= (double a)
+{
+  std::vector<std::vector<std::pair<std::size_t, double> > >::iterator row;
+  std::vector<std::pair<std::size_t, double> >::iterator entry;
+  for (row = _values.begin(); row != _values.end(); ++row)
+    for (entry = row->begin(); entry != row->end(); ++entry)
+      entry->second *=a;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const STLMatrix& STLMatrix::operator/= (double a)
+{
+  return (*this) *= 1.0/a;
+}
+//-----------------------------------------------------------------------------
+std::string STLMatrix::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    if (_primary_dim == 1)
+    {
+      dolfin_error("STLMatrix.cpp",
+                   "verbose string output of matrix",
+                   "Verbose string output is currently supported for row-wise storage only.");
+    }
+
+    s << str(false) << std::endl << std::endl;
+    for (std::size_t i = 0; i < _local_range.second - _local_range.first; i++)
+    {
+      // Sort row data by colmun index
+      std::vector<std::pair<std::size_t, double> > data = _values[i];
+      std::sort(data.begin(), data.end());
+
+      // Set precision
+      std::stringstream line;
+      line << std::setiosflags(std::ios::scientific);
+      line << std::setprecision(1);
+
+      // Format matrix
+      line << "|";
+      std::vector<std::pair<std::size_t, double> >::const_iterator entry;
+      for (entry = data.begin(); entry != data.end(); ++entry)
+      {
+        line << " (" << i << ", " << entry->first << ", " << entry->second
+             << ")";
+      }
+      line << " |";
+
+      s << line.str().c_str() << std::endl;
+    }
+  }
+  else
+    s << "<STLMatrix of size " << size(0) << " x " << size(1) << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+GenericLinearAlgebraFactory& STLMatrix::factory() const
+{
+  if (_primary_dim == 0)
+    return STLFactory::instance();
+  else
+    return STLFactoryCSC::instance();
+}
+//-----------------------------------------------------------------------------
+std::size_t STLMatrix::nnz() const
+{
+  return dolfin::MPI::sum(_mpi_comm, local_nnz());
+}
+//-----------------------------------------------------------------------------
+std::size_t STLMatrix::local_nnz() const
+{
+  std::size_t _nnz = 0;
+  for (std::size_t i = 0; i < _values.size(); ++i)
+    _nnz += _values[i].size();
+  return _nnz;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/STLMatrix.h b/dolfin/la/STLMatrix.h
new file mode 100644
index 0000000..08e5a3f
--- /dev/null
+++ b/dolfin/la/STLMatrix.h
@@ -0,0 +1,388 @@
+// Copyright (C) 2007-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2007
+// Modified by Garth N. Wells 2007, 2009
+// Modified by Ilmar Wilbers 2008
+//
+// First added:  2007-01-17
+// Last changed: 2012-08-20
+
+#ifndef __DOLFIN_STL_MATRIX_H
+#define __DOLFIN_STL_MATRIX_H
+
+#include <string>
+#include <utility>
+#include <vector>
+#include <boost/unordered_map.hpp>
+
+#include <dolfin/common/types.h>
+#include <dolfin/log/log.h>
+#include "TensorLayout.h"
+#include "GenericMatrix.h"
+
+#include <dolfin/log/dolfin_log.h>
+
+namespace dolfin
+{
+
+  class GenericSparsityPattern;
+  class GenericVector;
+
+  /// Simple STL-based implementation of the GenericMatrix interface.
+  /// The sparse matrix is stored as a pair of std::vector of
+  /// std::vector, one for the columns and one for the values.
+  ///
+  /// Historically, this class has undergone a number of different
+  /// incarnations, based on various combinations of std::vector,
+  /// std::set and std::map. The current implementation has proven to
+  /// be the fastest.
+
+  class STLMatrix : public GenericMatrix
+  {
+  public:
+
+    /// Create empty matrix
+  STLMatrix(std::size_t primary_dim=0) : _mpi_comm(MPI_COMM_SELF),
+      _primary_dim(primary_dim), _block_size(1), _local_range(0, 0),
+      num_codim_entities(0) {}
+
+    /// Destructor
+    virtual ~STLMatrix() {}
+
+    ///--- Implementation of the GenericTensor interface ---
+
+    /// Initialize zero tensor using sparsity pattern
+    virtual void init(const TensorLayout& tensor_layout);
+
+    /// Return true if empty
+    virtual bool empty() const
+    { return _values.empty(); }
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const;
+
+    /// Return local ownership range
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const;
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero();
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode);
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const
+    { return _mpi_comm; }
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    //--- Implementation of the GenericMatrix interface ---
+
+    /// Return copy of matrix
+    virtual std::shared_ptr<GenericMatrix> copy() const
+    {
+      std::shared_ptr<GenericMatrix> A(new STLMatrix(*this));
+      return A;
+    }
+
+    /// Initialize vector z to be compatible with the matrix-vector
+    /// product y = Ax. In the parallel case, both size and layout are
+    /// important.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+    virtual void init_vector(GenericVector& z, std::size_t dim) const
+    { dolfin_not_implemented(); }
+
+    /// Get block of values
+    virtual void get(double* block, std::size_t m,
+                     const dolfin::la_index* rows, std::size_t n,
+                     const dolfin::la_index* cols) const
+    { dolfin_not_implemented(); }
+
+    /// Set block of values
+    virtual void set(const double* block, std::size_t m,
+                     const dolfin::la_index* rows, std::size_t n,
+                     const dolfin::la_index* cols)
+    { dolfin_not_implemented(); }
+
+    /// Add block of values
+    virtual void add(const double* block, std::size_t m,
+                     const dolfin::la_index* rows, std::size_t n,
+                     const dolfin::la_index* cols);
+
+    /// Add multiple of given matrix (AXPY operation)
+    virtual void axpy(double a, const GenericMatrix& A,
+                      bool same_nonzero_pattern)
+    { dolfin_not_implemented(); }
+
+    /// Return norm of matrix
+    virtual double norm(std::string norm_type) const;
+
+    /// Get non-zero values of given row
+    virtual void getrow(std::size_t row, std::vector<std::size_t>& columns,
+                        std::vector<double>& values) const;
+
+    /// Set values for given row
+    virtual void setrow(std::size_t row,
+                        const std::vector<std::size_t>& columns,
+                        const std::vector<double>& values)
+    { dolfin_not_implemented(); }
+
+    /// Set given rows to zero
+    virtual void zero(std::size_t m, const dolfin::la_index* rows)
+    { dolfin_not_implemented(); }
+
+    /// Set given rows to identity matrix
+    virtual void ident(std::size_t m, const dolfin::la_index* rows);
+
+    // Matrix-vector product, y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const
+    { dolfin_not_implemented(); }
+
+    // Matrix-vector product, y = A^T x
+    virtual void transpmult(const GenericVector& x, GenericVector& y) const
+    { dolfin_not_implemented(); }
+
+    /// Set diagonal of a matrix
+    virtual void set_diagonal(const GenericVector& x)
+    { dolfin_not_implemented(); }
+
+    /// Multiply matrix by given number
+    virtual const STLMatrix& operator*= (double a);
+
+    /// Divide matrix by given number
+    virtual const STLMatrix& operator/= (double a);
+
+    /// Assignment operator
+    virtual const GenericMatrix& operator= (const GenericMatrix& A)
+    { dolfin_not_implemented(); return *this; }
+
+    ///--- Specialized matrix functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const;
+
+    ///--- STLMatrix interface ---
+
+    /// Return matrix block size
+    std::size_t block_size() const
+    { return _block_size; }
+
+    /// Clear matrix. Destroys data and sparse layout
+    void clear()
+    {
+      _local_range = std::pair<std::size_t, std::size_t>(0, 0);
+      num_codim_entities = 0;
+      _values.clear();
+      off_processs_data.clear();
+    }
+
+    void sort()
+    {
+      std::vector<std::vector<std::pair<std::size_t, double> > >::iterator row;
+      for (row = _values.begin(); row < _values.end(); ++row)
+        std::sort(row->begin(), row->end());
+    }
+
+    /// Return matrix in CSR format
+    template<typename T>
+    void csr(std::vector<double>& vals, std::vector<T>& cols,
+             std::vector<T>& row_ptr,
+             std::vector<T>& local_to_global_row,
+             bool block,
+             bool symmetric) const;
+
+    /// Return matrix in CSC format
+    template<typename T>
+    void csc(std::vector<double>& vals, std::vector<T>& rows,
+             std::vector<T>& col_ptr,
+             std::vector<T>& local_to_global_col,
+             bool block,
+             bool symmetric) const;
+
+    /// Return number of global non-zero entries
+    std::size_t nnz() const;
+
+    /// Return number of local non-zero entries
+    std::size_t local_nnz() const;
+
+  private:
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+    /// Return matrix in compressed format
+    template<typename T>
+    void compressed_storage(std::vector<double>& vals,
+                            std::vector<T>& rows,
+                            std::vector<T>& col_ptr,
+                            std::vector<T>& local_to_global_col,
+                            bool block,
+                            bool symmetric) const;
+
+    // Primary dimension (0=row-wise storage, 1=column-wise storage)
+    const std::size_t _primary_dim;
+
+    // Block size, e.g. 3 for 3D elasticity with appropriate dof ordering
+    std::size_t _block_size;
+
+    // Local ownership range (row range for row-wise storage, column
+    // range for column-wise storage)
+    std::pair<std::size_t, std::size_t> _local_range;
+
+    // Number of columns (row-wise storage) or number of rows (column-wise
+    // storage)
+    std::size_t num_codim_entities;
+
+    // Storage of non-zero matrix values
+    std::vector<std::vector<std::pair<std::size_t, double> > > _values;
+
+    // Off-process data ([i, j], value)
+    boost::unordered_map<std::pair<std::size_t, std::size_t>, double>
+      off_processs_data;
+
+  };
+
+  //---------------------------------------------------------------------------
+  // Implementation of templated functions
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void STLMatrix::csr(std::vector<double>& vals, std::vector<T>& cols,
+                      std::vector<T>& row_ptr,
+                      std::vector<T>& local_to_global_row,
+                      bool block,
+                      bool symmetric) const
+  {
+    if (_primary_dim != 0)
+    {
+      dolfin_error("STLMatrix.cpp",
+                   "creating compressed row storage data",
+                   "Cannot create CSR matrix from STLMatrix with column-wise storage.");
+    }
+    compressed_storage(vals, cols, row_ptr, local_to_global_row, block,
+                       symmetric);
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void STLMatrix::csc(std::vector<double>& vals, std::vector<T>& rows,
+                      std::vector<T>& col_ptr,
+                      std::vector<T>& local_to_global_col,
+                      bool block,
+                      bool symmetric) const
+  {
+    if (_primary_dim != 1)
+    {
+      dolfin_error("STLMatrix.cpp",
+                   "creating compressed column storage data",
+                   "Cannot create CSC matrix from STLMatrix with row-wise storage.");
+    }
+    compressed_storage(vals, rows, col_ptr, local_to_global_col, block,
+                       symmetric);
+  }
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void STLMatrix::compressed_storage(std::vector<double>& vals,
+                                     std::vector<T>& cols,
+                                     std::vector<T>& row_ptr,
+                                     std::vector<T>& local_to_global_row,
+                                     bool block,
+                                     bool symmetric) const
+  {
+    // Reset data structures
+    vals.clear();
+    cols.clear();
+    row_ptr.clear();
+    local_to_global_row.clear();
+
+    // Reserve memory
+    row_ptr.reserve(_values.size() + 1);
+    local_to_global_row.reserve(_values.size());
+
+    // Build CSR data structures
+    row_ptr.push_back(0);
+
+    // Number of local non-zero entries
+    const std::size_t _local_nnz = local_nnz();
+
+    // Number of local rows (columns)
+    const std::size_t num_local_rows = _values.size();
+
+    if (!symmetric)
+    {
+      // Reserve memory
+      vals.reserve(_local_nnz);
+      cols.reserve(_local_nnz);
+
+      // Build data structures
+      for (std::size_t local_row = 0; local_row < num_local_rows;
+           local_row += _block_size)
+      {
+        for (std::size_t column = 0; column < _values[local_row].size();
+             column += _block_size)
+        {
+          cols.push_back(_values[local_row][column].first/_block_size);
+          for (std::size_t b0 = 0; b0 < _block_size; ++b0)
+            for (std::size_t b1 = 0; b1 < _block_size; ++b1)
+              vals.push_back(_values[local_row + b0][column + b1].second);
+        }
+        local_to_global_row.push_back((_local_range.first
+                                       + local_row)/_block_size);
+        row_ptr.push_back(row_ptr.back()+_values[local_row].size()/_block_size);
+      }
+    }
+    else
+    {
+      // Reserve memory
+      vals.reserve((_local_nnz - num_local_rows)/2 + num_local_rows);
+      cols.reserve((_local_nnz - num_local_rows)/2 + num_local_rows);
+
+      // Build data structures
+      for (std::size_t local_row = 0; local_row < _values.size();
+           local_row += _block_size)
+      {
+        const std::size_t global_row_index
+          = (local_row + _local_range.first)/_block_size;
+        std::size_t counter = 0;
+        for (std::size_t column = 0; column < _values[local_row].size();
+             column += _block_size)
+        {
+          const std::size_t index
+            = _values[local_row][column].first/_block_size;
+          if (index >= global_row_index)
+          {
+            cols.push_back(index);
+            for (std::size_t b0 = 0; b0 < _block_size; ++b0)
+              for (std::size_t b1 = 0; b1 < _block_size; ++b1)
+                vals.push_back(_values[local_row + b0][column + b1].second);
+            ++counter;
+          }
+        }
+        local_to_global_row.push_back(global_row_index);
+        row_ptr.push_back(row_ptr.back() + counter);
+      }
+    }
+  }
+//-----------------------------------------------------------------------------
+
+}
+
+#endif
diff --git a/dolfin/la/STLVector.h b/dolfin/la/STLVector.h
new file mode 100644
index 0000000..c572903
--- /dev/null
+++ b/dolfin/la/STLVector.h
@@ -0,0 +1,43 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-03-27
+// Last changed:
+
+#ifndef __DOLFIN_STLVECTOR_H
+#define __DOLFIN_STLVECTOR_H
+
+#include "EpetraVector.h"
+#include "PETScVector.h"
+#include "uBLASVector.h"
+
+namespace dolfin
+{
+
+  #ifdef HAS_PETSC
+    typedef PETScVector STLVector;
+  #else
+   #ifdef HAS_TRILINOS
+    typedef EpetraVector STLVector;
+   #else
+    typedef uBLASVector STLVector;
+   #endif 
+  #endif	
+
+}
+
+#endif
diff --git a/dolfin/la/Scalar.h b/dolfin/la/Scalar.h
new file mode 100644
index 0000000..63da84c
--- /dev/null
+++ b/dolfin/la/Scalar.h
@@ -0,0 +1,193 @@
+// Copyright (C) 2007-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2007-2011.
+// Modified by Ola Skavhaug, 2007.
+//
+// First added:  2007-03-15
+// Last changed: 2011-11-11
+
+#ifndef __SCALAR_H
+#define __SCALAR_H
+
+#include <string>
+#include <vector>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/SubSystemsManager.h>
+#include <dolfin/common/types.h>
+#include "DefaultFactory.h"
+#include "GenericTensor.h"
+#include "TensorLayout.h"
+
+namespace dolfin
+{
+
+  class TensorLayout;
+
+  /// This class represents a real-valued scalar quantity and
+  /// implements the GenericTensor interface for scalars.
+
+  class Scalar : public GenericTensor
+  {
+  public:
+
+    /// Create zero scalar
+    Scalar() : GenericTensor(), _value(0.0), _mpi_comm(MPI_COMM_WORLD)
+    { SubSystemsManager::init_mpi(); }
+
+    /// Destructor
+    virtual ~Scalar() {}
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Initialize zero tensor using sparsity pattern
+    void init(const TensorLayout& tensor_layout)
+    {
+      _value = 0.0;
+      _mpi_comm = tensor_layout.mpi_comm();
+    }
+
+    /// Return true if empty
+    bool empty() const
+    { return false; }
+
+    /// Return tensor rank (number of dimensions)
+    std::size_t rank() const
+    { return 0; }
+
+    /// Return size of given dimension
+    std::size_t size(std::size_t dim) const
+    {
+      if (dim != 0)
+      {
+        dolfin_error("Scalar.h",
+                     "get size of scalar",
+                     "Dim must be equal to zero.");
+      }
+
+      return 0;
+    }
+
+    /// Return local ownership range
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const
+    {
+      dolfin_error("Scalar.h",
+                   "get local range of scalar",
+                   "The local_range() function is not available for scalars");
+      return std::make_pair(0, 0);
+    }
+
+    /// Get block of values
+    void get(double* block, const dolfin::la_index* num_rows,
+             const dolfin::la_index * const * rows) const
+    { block[0] = _value; }
+
+    /// Set block of values
+    void set(const double* block, const dolfin::la_index* num_rows,
+             const dolfin::la_index * const * rows)
+    { _value = block[0]; }
+
+    /// Add block of values
+    void add(const double* block, const dolfin::la_index* num_rows,
+             const dolfin::la_index * const * rows)
+    {
+      dolfin_assert(block);
+      _value += block[0];
+    }
+
+    /// Add block of values
+    void add(const double* block,
+             const std::vector<const std::vector<dolfin::la_index>* >& rows)
+    {
+      dolfin_assert(block);
+      _value += block[0];
+    }
+
+    /// Add block of values
+    void add(const double* block,
+             const std::vector<std::vector<dolfin::la_index> >& rows)
+    {
+      dolfin_assert(block);
+      _value += block[0];
+    }
+
+    /// Set all entries to zero and keep any sparse structure
+    void zero()
+    { _value = 0.0; }
+
+    /// Finalize assembly of tensor
+    void apply(std::string mode)
+    { _value = MPI::sum(_mpi_comm, _value); }
+
+    /// Return MPI communicator
+    MPI_Comm mpi_comm() const
+    { return _mpi_comm; }
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const
+    {
+      std::stringstream s;
+      s << "<Scalar value " << _value << ">";
+      return s.str();
+    }
+
+    //--- Scalar interface ---
+
+    /// Return copy of scalar
+    virtual std::shared_ptr<Scalar> copy() const
+    {
+      std::shared_ptr<Scalar> s(new Scalar);
+      s->_value = _value;
+      return s;
+    }
+
+    /// Cast to double
+    operator double() const
+    { return _value; }
+
+    /// Assignment from double
+    const Scalar& operator= (double value)
+    { _value = value; return *this; }
+
+    //--- Special functions
+
+    /// Return a factory for the default linear algebra backend
+    GenericLinearAlgebraFactory& factory() const
+    {
+      DefaultFactory f;
+      return f.factory();
+    }
+    //{ return dolfin::uBLASFactory<>::instance(); }
+
+    /// Get value
+    double getval() const
+    { return _value; }
+
+  private:
+
+    // Value of scalar
+    double _value;
+
+    // MPI communicator
+     MPI_Comm _mpi_comm;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/SparsityPattern.cpp b/dolfin/la/SparsityPattern.cpp
new file mode 100644
index 0000000..8ed6a30
--- /dev/null
+++ b/dolfin/la/SparsityPattern.cpp
@@ -0,0 +1,492 @@
+// Copyright (C) 2007-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Magnus Vikstrom, 2008.
+// Modified by Anders Logg, 2008-2009.
+// Modified by Ola Skavhaug, 2009.
+//
+// First added:  2007-03-13
+// Last changed: 2011-01-02
+
+#include <algorithm>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/log/log.h>
+#include <dolfin/log/LogStream.h>
+#include "SparsityPattern.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+SparsityPattern::SparsityPattern(std::size_t primary_dim)
+  : GenericSparsityPattern(primary_dim), _mpi_comm(MPI_COMM_NULL)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+SparsityPattern::SparsityPattern(
+  const MPI_Comm mpi_comm,
+  const std::vector<std::size_t>& dims,
+  const std::vector<std::pair<std::size_t, std::size_t> >& local_range,
+  const std::vector<const boost::unordered_map<std::size_t, unsigned int>* > off_process_owner,
+  std::size_t primary_dim)
+  : GenericSparsityPattern(primary_dim), _mpi_comm(MPI_COMM_NULL)
+{
+  init(mpi_comm, dims, local_range, off_process_owner);
+}
+//-----------------------------------------------------------------------------
+void SparsityPattern::init(
+  const MPI_Comm mpi_comm,
+  const std::vector<std::size_t>& dims,
+  const std::vector<std::pair<std::size_t, std::size_t> >& local_range,
+  const std::vector<const boost::unordered_map<std::size_t, unsigned int>* > off_process_owner)
+{
+  // Only rank 2 sparsity patterns are supported
+  dolfin_assert(dims.size() == 2);
+
+  _mpi_comm = mpi_comm;
+
+  const std::size_t _primary_dim = primary_dim();
+
+  // Check that dimensions match
+  dolfin_assert(dims.size() == local_range.size());
+  dolfin_assert(dims.size() == off_process_owner.size());
+
+  // Clear sparsity pattern data
+  diagonal.clear();
+  off_diagonal.clear();
+  non_local.clear();
+  _off_process_owner.clear();
+
+  // Set ownership range
+  _local_range = local_range;
+
+  // Store copy of nonlocal index to owning process map
+  _off_process_owner.reserve(off_process_owner.size());
+  for (std::size_t i = 0; i < off_process_owner.size(); ++i)
+  {
+    dolfin_assert(off_process_owner[i]);
+    _off_process_owner.push_back(*off_process_owner[i]);
+  }
+
+  // Check that primary dimension is valid
+  if (_primary_dim > 1)
+   {
+    dolfin_error("SparsityPattern.cpp",
+                 "primary dimension for sparsity pattern storage",
+                 "Primary dimension must be less than 2 (0=row major, 1=column major");
+  }
+
+  // Resize diagonal block
+  dolfin_assert(_local_range[_primary_dim].second
+                > _local_range[_primary_dim].first);
+  diagonal.resize(_local_range[_primary_dim].second
+                  - _local_range[_primary_dim].first);
+
+  // Resize off-diagonal block (only needed when local range != global range)
+  off_diagonal.resize(_local_range[_primary_dim].second
+                      - _local_range[_primary_dim].first);
+}
+//-----------------------------------------------------------------------------
+void SparsityPattern::insert(const std::vector<const std::vector<dolfin::la_index>* >& entries)
+{
+  dolfin_assert(entries.size() == 2);
+  dolfin_assert(entries[0]);
+  dolfin_assert(entries[1]);
+
+  const std::size_t _primary_dim = primary_dim();
+
+  const std::vector<dolfin::la_index>* map_i;
+  const std::vector<dolfin::la_index>* map_j;
+  std::size_t primary_codim;
+  dolfin_assert(_primary_dim < 2);
+  if (_primary_dim == 0)
+  {
+    primary_codim = 1;
+    map_i = entries[0];
+    map_j = entries[1];
+  }
+  else
+  {
+    primary_codim = 0;
+    map_i = entries[1];
+    map_j = entries[0];
+  }
+
+  const std::pair<dolfin::la_index, dolfin::la_index>
+    local_range0(_local_range[_primary_dim].first,
+                 _local_range[_primary_dim].second);
+  const std::pair<dolfin::la_index, dolfin::la_index>
+    local_range1(_local_range[primary_codim].first,
+                 _local_range[primary_codim].second);
+
+  // Check local range
+  if (MPI::size(_mpi_comm) == 1)
+  {
+    // Sequential mode, do simple insertion
+    std::vector<dolfin::la_index>::const_iterator i_index;
+    for (i_index = map_i->begin(); i_index != map_i->end(); ++i_index)
+      diagonal[*i_index].insert(map_j->begin(), map_j->end());
+  }
+  else
+  {
+    // Parallel mode, use either diagonal, off_diagonal or non_local
+    std::vector<dolfin::la_index>::const_iterator i_index;
+    for (i_index = map_i->begin(); i_index != map_i->end(); ++i_index)
+    {
+      if (local_range0.first <= *i_index && *i_index < local_range0.second)
+      {
+        // Subtract offset
+        const std::size_t I = *i_index - local_range0.first;
+
+        // Store local entry in diagonal or off-diagonal block
+        std::vector<dolfin::la_index>::const_iterator j_index;
+        for (j_index = map_j->begin(); j_index != map_j->end(); ++j_index)
+        {
+          if (local_range1.first <= *j_index && *j_index < local_range1.second)
+          {
+            dolfin_assert(I < diagonal.size());
+            diagonal[I].insert(*j_index);
+          }
+          else
+          {
+            dolfin_assert(I < off_diagonal.size());
+            off_diagonal[I].insert(*j_index);
+          }
+        }
+      }
+      else
+      {
+        // Store non-local entry (communicated later during apply())
+        std::vector<dolfin::la_index>::const_iterator j_index;
+        for (j_index = map_j->begin(); j_index != map_j->end(); ++j_index)
+        {
+          non_local.push_back(*i_index);
+          non_local.push_back(*j_index);
+        }
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void SparsityPattern::add_edges(const std::pair<dolfin::la_index,
+                                                std::size_t>& vertex,
+                                const std::vector<dolfin::la_index>& edges)
+{
+  const std::size_t _primary_dim = primary_dim();
+  const dolfin::la_index vertex_index = vertex.first;
+
+
+  std::pair<dolfin::la_index, dolfin::la_index>
+    local_range(_local_range[_primary_dim].first,
+                _local_range[_primary_dim].second);
+
+  // Add off-process owner if vertex is not owned by this process
+  if (vertex_index < local_range.first || vertex_index >= local_range.second)
+    _off_process_owner[_primary_dim].insert(vertex);
+
+  // Add edges
+  std::vector<dolfin::la_index> dofs0(1, vertex.first);
+  std::vector<const std::vector<dolfin::la_index>* > entries(2);
+  entries[0] = &dofs0;
+  entries[1] = &edges;
+  insert(entries);
+}
+//-----------------------------------------------------------------------------
+std::size_t SparsityPattern::rank() const
+{
+  return 2;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+  SparsityPattern::local_range(std::size_t dim) const
+{
+  dolfin_assert(dim < 2);
+  return _local_range[dim];
+}
+//-----------------------------------------------------------------------------
+std::size_t SparsityPattern::num_nonzeros() const
+{
+  std::size_t nz = 0;
+  typedef std::vector<set_type>::const_iterator slice_it;
+  for (slice_it slice = diagonal.begin(); slice != diagonal.end(); ++slice)
+    nz += slice->size();
+  for (slice_it slice = off_diagonal.begin(); slice != off_diagonal.end();
+       ++slice)
+  {
+    nz += slice->size();
+  }
+  return nz;
+}
+//-----------------------------------------------------------------------------
+void  SparsityPattern::num_nonzeros_diagonal(std::vector<std::size_t>& num_nonzeros) const
+{
+  // Resize vector
+  num_nonzeros.resize(diagonal.size());
+
+  // Get number of nonzeros per generalised row
+  typedef std::vector<set_type>::const_iterator slice_it;
+  for (slice_it slice = diagonal.begin(); slice != diagonal.end(); ++slice)
+    num_nonzeros[slice - diagonal.begin()] = slice->size();
+}
+//-----------------------------------------------------------------------------
+void SparsityPattern::num_nonzeros_off_diagonal(std::vector<std::size_t>& num_nonzeros) const
+{
+  // Resize vector
+  num_nonzeros.resize(off_diagonal.size());
+
+  // Compute number of nonzeros per generalised row
+  typedef std::vector<set_type>::const_iterator slice_it;
+  for (slice_it slice = off_diagonal.begin(); slice != off_diagonal.end();
+       ++slice)
+  {
+    num_nonzeros[slice - off_diagonal.begin()] = slice->size();
+  }
+}
+//-----------------------------------------------------------------------------
+void SparsityPattern::num_local_nonzeros(std::vector<std::size_t>& num_nonzeros) const
+{
+  num_nonzeros_diagonal(num_nonzeros);
+  if (!off_diagonal.empty())
+  {
+    std::vector<std::size_t> tmp;
+    num_nonzeros_off_diagonal(tmp);
+    dolfin_assert(num_nonzeros.size() == tmp.size());
+    std::transform(num_nonzeros.begin(), num_nonzeros.end(), tmp.begin(),
+                   num_nonzeros.begin(), std::plus<std::size_t>());
+  }
+}
+//-----------------------------------------------------------------------------
+void SparsityPattern::get_edges(std::size_t vertex,
+                                std::vector<dolfin::la_index>& edges) const
+{
+  dolfin_assert(vertex >= _local_range[0].first && vertex
+                < _local_range[0].second);
+
+  const std::size_t local_vertex = vertex - _local_range[0].first;
+  dolfin_assert(local_vertex < diagonal.size());
+  std::size_t size = diagonal[local_vertex].size();
+  if (!off_diagonal.empty())
+  {
+    dolfin_assert(local_vertex < off_diagonal.size());
+    size += off_diagonal[local_vertex].size();
+  }
+  edges.resize(size);
+
+  std::copy(diagonal[local_vertex].begin(), diagonal[local_vertex].end(),
+            edges.begin());
+  if (!off_diagonal.empty())
+  {
+    std::copy(off_diagonal[local_vertex].begin(),
+              off_diagonal[local_vertex].end(),
+              edges.begin() + diagonal[local_vertex].size());
+  }
+}
+//-----------------------------------------------------------------------------
+void SparsityPattern::apply()
+{
+  const std::size_t _primary_dim = primary_dim();
+
+  std::size_t primary_codim;
+  dolfin_assert(_primary_dim < 2);
+  if (_primary_dim == 0)
+    primary_codim = 1;
+  else
+    primary_codim = 0;
+
+  const std::size_t num_processes = MPI::size(_mpi_comm);
+  const std::size_t proc_number = MPI::rank(_mpi_comm);
+
+  // Print some useful information
+  if (get_log_level() <= DBG)
+    info_statistics();
+
+  // Communicate non-local blocks if any
+  if (MPI::size(_mpi_comm) > 1)
+  {
+    // Figure out correct process for each non-local entry
+    dolfin_assert(non_local.size() % 2 == 0);
+    std::vector<std::vector<std::size_t> > non_local_send(num_processes);
+
+    for (std::size_t i = 0; i < non_local.size(); i += 2)
+    {
+      // Get generalised row for non-local entry
+      const std::size_t I = non_local[i];
+      const std::size_t J = non_local[i + 1];
+
+      // Figure out which process owns the row
+      boost::unordered_map<std::size_t, unsigned int>::const_iterator
+        non_local_index = _off_process_owner[_primary_dim].find(I);
+      dolfin_assert(non_local_index != _off_process_owner[_primary_dim].end());
+      const std::size_t p = non_local_index->second;
+
+      dolfin_assert(p < num_processes);
+      dolfin_assert(p != proc_number);
+
+      non_local_send[p].push_back(I);
+      non_local_send[p].push_back(J);
+    }
+
+    // Communicate non-local entries to other processes
+    std::vector<std::vector<std::size_t> > non_local_received;
+    MPI::all_to_all(_mpi_comm, non_local_send, non_local_received);
+
+    // Insert non-local entries received from other processes
+    for (std::size_t p = 0; p < num_processes; ++p)
+    {
+      const std::vector<std::size_t>& non_local_received_p
+        = non_local_received[p];
+      dolfin_assert(non_local_received_p.size() % 2 == 0);
+
+      for (std::size_t i = 0; i < non_local_received_p.size(); i += 2)
+      {
+        // Get generalised row and column
+        std::size_t I = non_local_received_p[i];
+        const std::size_t J = non_local_received_p[i + 1];
+
+        // Sanity check
+        if (I < _local_range[_primary_dim].first
+            || I >= _local_range[_primary_dim].second)
+        {
+          dolfin_error("SparsityPattern.cpp",
+                       "apply changes to sparsity pattern",
+                       "Received illegal sparsity pattern entry for row/column %d, not in range [%d, %d]",
+                       I, _local_range[_primary_dim].first,
+                       _local_range[_primary_dim].second);
+        }
+
+        // Subtract offset
+        I -= _local_range[_primary_dim].first;
+
+        // Insert in diagonal or off-diagonal block
+        if (_local_range[primary_codim].first <= J &&
+            J < _local_range[primary_codim].second)
+        {
+          dolfin_assert(I < diagonal.size());
+          diagonal[I].insert(J);
+        }
+        else
+        {
+          dolfin_assert(I < off_diagonal.size());
+          off_diagonal[I].insert(J);
+        }
+      }
+    }
+  }
+
+  // Clear non-local entries
+  non_local.clear();
+}
+//-----------------------------------------------------------------------------
+std::string SparsityPattern::str(bool verbose) const
+{
+  // Print each row
+  std::stringstream s;
+  typedef set_type::const_iterator entry_it;
+  for (std::size_t i = 0; i < diagonal.size(); i++)
+  {
+    if (primary_dim() == 0)
+      s << "Row " << i << ":";
+    else
+      s << "Col " << i << ":";
+
+    for (entry_it entry = diagonal[i].begin(); entry != diagonal[i].end();
+         ++entry)
+    {
+      s << " " << *entry;
+    }
+    s << std::endl;
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::vector<std::size_t> >
+  SparsityPattern::diagonal_pattern(Type type) const
+{
+  std::vector<std::vector<std::size_t> > v(diagonal.size());
+  for (std::size_t i = 0; i < diagonal.size(); ++i)
+    v[i].insert(v[i].begin(), diagonal[i].begin(), diagonal[i].end());
+
+  if (type == sorted)
+  {
+    for (std::size_t i = 0; i < v.size(); ++i)
+      std::sort(v[i].begin(), v[i].end());
+  }
+
+  return v;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::vector<std::size_t> >
+  SparsityPattern::off_diagonal_pattern(Type type) const
+{
+  std::vector<std::vector<std::size_t> > v(off_diagonal.size());
+  for (std::size_t i = 0; i < off_diagonal.size(); ++i)
+    v[i].insert(v[i].begin(), off_diagonal[i].begin(), off_diagonal[i].end());
+
+  if (type == sorted)
+  {
+    for (std::size_t i = 0; i < v.size(); ++i)
+      std::sort(v[i].begin(), v[i].end());
+  }
+
+  return v;
+}
+//-----------------------------------------------------------------------------
+void SparsityPattern::info_statistics() const
+{
+  // Count nonzeros in diagonal block
+  std::size_t num_nonzeros_diagonal = 0;
+  for (std::size_t i = 0; i < diagonal.size(); ++i)
+    num_nonzeros_diagonal += diagonal[i].size();
+
+  // Count nonzeros in off-diagonal block
+  std::size_t num_nonzeros_off_diagonal = 0;
+  for (std::size_t i = 0; i < off_diagonal.size(); ++i)
+    num_nonzeros_off_diagonal += off_diagonal[i].size();
+
+  // Count nonzeros in non-local block
+  const std::size_t num_nonzeros_non_local = non_local.size()/2;
+
+  // Count total number of nonzeros
+  const std::size_t num_nonzeros_total = num_nonzeros_diagonal
+    + num_nonzeros_off_diagonal + num_nonzeros_non_local;
+
+  std::size_t size0 = _local_range[0].second;
+  std::size_t size1 = _local_range[1].second;
+  size0 = MPI::max(_mpi_comm, size0);
+  size1 = MPI::max(_mpi_comm, size1);
+
+  // Return number of entries
+  cout << "Matrix of size " << size0 << " x " << size1 << " has "
+       << num_nonzeros_total << " (" << 100.0*num_nonzeros_total/(size0*size1)
+        << "%)" << " nonzero entries." << endl;
+  if (num_nonzeros_total != num_nonzeros_diagonal)
+  {
+    cout << "Diagonal: " << num_nonzeros_diagonal << " ("
+         << (100.0*static_cast<double>(num_nonzeros_diagonal) / static_cast<double>(num_nonzeros_total))
+         << "%), ";
+    cout << "off-diagonal: " << num_nonzeros_off_diagonal << " ("
+         << (100.0*static_cast<double>(num_nonzeros_off_diagonal)/static_cast<double>(num_nonzeros_total))
+         << "%), ";
+    cout << "non-local: " << num_nonzeros_non_local << " ("
+         << (100.0*static_cast<double>(num_nonzeros_non_local)/static_cast<double>(num_nonzeros_total))
+         << "%)";
+    cout << endl;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/SparsityPattern.h b/dolfin/la/SparsityPattern.h
new file mode 100644
index 0000000..779fd34
--- /dev/null
+++ b/dolfin/la/SparsityPattern.h
@@ -0,0 +1,150 @@
+// Copyright (C) 2007-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2007-2009.
+//
+// First added:  2007-03-13
+// Last changed: 2011-01-02
+
+#ifndef __SPARSITY_PATTERN_H
+#define __SPARSITY_PATTERN_H
+
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "dolfin/common/Set.h"
+#include "dolfin/common/types.h"
+#include "GenericSparsityPattern.h"
+#include <boost/unordered_map.hpp>
+
+namespace dolfin
+{
+
+  /// This class implements the GenericSparsityPattern interface.
+  /// It is used by most linear algebra backends.
+
+  class SparsityPattern : public GenericSparsityPattern
+  {
+
+    // NOTE: Do not change this typedef without performing careful
+    //       performance profiling
+    // Set type used for the rows of the sparsity pattern
+    typedef dolfin::Set<std::size_t> set_type;
+
+  public:
+
+    /// Create empty sparsity pattern
+    SparsityPattern(std::size_t primary_dim);
+
+    /// Create sparsity pattern for a generic tensor
+    SparsityPattern(const MPI_Comm mpi_comm,
+                    const std::vector<std::size_t>& dims,
+                    const std::vector<std::pair<std::size_t,
+                    std::size_t> >& ownership_range,
+                    const std::vector<const boost::unordered_map<std::size_t,
+                    unsigned int>* > off_process_owner,
+                    std::size_t primary_dim);
+
+    /// Initialize sparsity pattern for a generic tensor
+    void init(const MPI_Comm mpi_comm,
+              const std::vector<std::size_t>& dims,
+              const std::vector<std::pair<std::size_t,
+              std::size_t> >& ownership_range,
+              const std::vector<const boost::unordered_map<std::size_t,
+              unsigned int>* > off_process_owner);
+
+    /// Insert non-zero entries
+    void
+      insert(const std::vector<const std::vector<dolfin::la_index>* >& entries);
+
+    /// Add edges (vertex = [index, owning process])
+    void add_edges(const std::pair<dolfin::la_index, std::size_t>& vertex,
+                   const std::vector<dolfin::la_index>& edges);
+
+    /// Return rank
+    std::size_t rank() const;
+
+    /// Return local range for dimension dim
+    std::pair<std::size_t, std::size_t> local_range(std::size_t dim) const;
+
+    /// Return number of local nonzeros
+    std::size_t num_nonzeros() const;
+
+    /// Fill array with number of nonzeros for diagonal block in
+    /// local_range for dimension 0. For matrices, fill array with number
+    /// of nonzeros per local row for diagonal block
+    void num_nonzeros_diagonal(std::vector<std::size_t>& num_nonzeros) const;
+
+    /// Fill array with number of nonzeros for off-diagonal block in
+    /// local_range for dimension 0. For matrices, fill array with number
+    /// of nonzeros per local row for off-diagonal block
+    void
+      num_nonzeros_off_diagonal(std::vector<std::size_t>& num_nonzeros) const;
+
+    /// Fill vector with number of nonzeros in local_range for dimension 0
+    void num_local_nonzeros(std::vector<std::size_t>& num_nonzeros) const;
+
+    /// Fill vector with edges for given vertex
+    void get_edges(std::size_t vertex,
+                   std::vector<dolfin::la_index>& edges) const;
+
+    /// Finalize sparsity pattern
+    void apply();
+
+    // Return MPI communicator
+    MPI_Comm mpi_comm() const
+    { return _mpi_comm; }
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Return underlying sparsity pattern (diagonal). Options are
+    /// 'sorted' and 'unsorted'.
+    std::vector<std::vector<std::size_t> > diagonal_pattern(Type type) const;
+
+    /// Return underlying sparsity pattern (off-diagional). Options are
+    /// 'sorted' and 'unsorted'.
+    std::vector<std::vector<std::size_t> >
+      off_diagonal_pattern(Type type) const;
+
+  private:
+
+    // Print some useful information
+    void info_statistics() const;
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+    // Ownership range for each dimension
+    std::vector<std::pair<std::size_t, std::size_t> > _local_range;
+
+    // Sparsity patterns for diagonal and off-diagonal blocks
+    std::vector<set_type> diagonal;
+    std::vector<set_type> off_diagonal;
+
+    // Sparsity pattern for non-local entries stored as [i0, j0, i1, j1, ...]
+    std::vector<std::size_t> non_local;
+
+    // Map from non-local vertex to owning process index
+    std::vector<boost::unordered_map<std::size_t, unsigned int> >
+      _off_process_owner;
+
+  };
+
+}
+#endif
diff --git a/dolfin/la/TensorLayout.cpp b/dolfin/la/TensorLayout.cpp
new file mode 100644
index 0000000..a40bb8d
--- /dev/null
+++ b/dolfin/la/TensorLayout.cpp
@@ -0,0 +1,109 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-24
+// Last changed:
+
+#include <dolfin/log/log.h>
+#include <dolfin/log/LogStream.h>
+#include "SparsityPattern.h"
+#include "TensorLayout.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+TensorLayout::TensorLayout(std::size_t pdim, bool sparsity_pattern)
+  : primary_dim(pdim), block_size(0), _mpi_comm(MPI_COMM_NULL)
+{
+  // Create empty sparsity pattern
+  if (sparsity_pattern)
+    _sparsity_pattern.reset(new SparsityPattern(primary_dim));
+}
+//-----------------------------------------------------------------------------
+TensorLayout::TensorLayout(const MPI_Comm mpi_comm,
+                           const std::vector<std::size_t>& dims,
+                           std::size_t pdim, std::size_t bs,
+                           const std::vector<std::pair<std::size_t,
+                           std::size_t> >& ownership_range,
+                           bool sparsity_pattern)
+  : primary_dim(pdim), block_size(bs), _mpi_comm(mpi_comm),
+    _shape(dims), _ownership_range(ownership_range)
+{
+  // Only rank 2 sparsity patterns are supported
+  dolfin_assert(!(sparsity_pattern && dims.size() != 2));
+
+  // Check that dimensions match
+  dolfin_assert(dims.size() == ownership_range.size());
+
+  // Create empty sparsity pattern
+  if (_sparsity_pattern)
+    _sparsity_pattern.reset(new SparsityPattern(primary_dim));
+}
+//-----------------------------------------------------------------------------
+void TensorLayout::init(const MPI_Comm mpi_comm,
+                        const std::vector<std::size_t>& dims, std::size_t bs,
+  const std::vector<std::pair<std::size_t, std::size_t> >& ownership_range)
+{
+  // Only rank 2 sparsity patterns are supported
+  dolfin_assert(!(_sparsity_pattern && dims.size() != 2));
+
+  // Check that dimensions match
+  dolfin_assert(dims.size() == ownership_range.size());
+
+  // Store MPI communicator
+  _mpi_comm = mpi_comm;
+
+  // Store dimensions
+  _shape = dims;
+
+  // Store block size
+  block_size = bs;
+
+  // Store ownership range
+  _ownership_range = ownership_range;
+}
+//-----------------------------------------------------------------------------
+std::size_t TensorLayout::rank() const
+{
+  return _shape.size();
+}
+//-----------------------------------------------------------------------------
+std::size_t TensorLayout::size(std::size_t i) const
+{
+  dolfin_assert(i < _shape.size());
+  return _shape[i];
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+TensorLayout::local_range(std::size_t dim) const
+{
+  dolfin_assert(dim < 2);
+  return _ownership_range[dim];
+}
+//-----------------------------------------------------------------------------
+std::string TensorLayout::str() const
+{
+  std::stringstream s;
+  s << "<TensorLayout for tensor of rank " << rank() << ">" << std::endl;
+  for (std::size_t i = 0; i < rank(); i++)
+  {
+    s << " Local range for dim " << i << ": [" << _ownership_range[i].first
+        << ", " << _ownership_range[i].second << ")" << std::endl;
+  }
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/TensorLayout.h b/dolfin/la/TensorLayout.h
new file mode 100644
index 0000000..3d89e79
--- /dev/null
+++ b/dolfin/la/TensorLayout.h
@@ -0,0 +1,111 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-02-24
+// Last changed:
+
+#ifndef __TENSOR_LAYOUT_H
+#define __TENSOR_LAYOUT_H
+
+#include <string>
+#include <utility>
+#include <vector>
+#include <memory>
+
+#include "dolfin/common/types.h"
+#include "dolfin/common/MPI.h"
+#include "GenericSparsityPattern.h"
+
+namespace dolfin
+{
+
+  /// This class described the size and possibly the sparsity of a
+  /// (sparse) tensor. It is used by the linear algebra backends to
+  /// initialise tensors.
+
+  class TensorLayout
+  {
+
+  public:
+
+    /// Create empty tensor layout
+    TensorLayout(std::size_t primary_dim, bool sparsity_pattern);
+
+    /// Create a tensor layout
+    TensorLayout(const MPI_Comm mpi_comm,
+                 const std::vector<std::size_t>& dims,
+                 std::size_t primary_dim,
+                 std::size_t block_size,
+                 const std::vector<std::pair<std::size_t, std::size_t> >& ownership_range,
+                 bool sparsity_pattern);
+
+    /// Initialize tensor layout
+    void init(const MPI_Comm mpi_comm,
+              const std::vector<std::size_t>& dims,
+              std::size_t block_size,
+              const std::vector<std::pair<std::size_t, std::size_t> >& ownership_range);
+
+    /// Return rank
+    std::size_t rank() const;
+
+    /// Return global size for dimension i (size of tensor, includes
+    /// non-zeroes)
+    std::size_t size(std::size_t i) const;
+
+    /// Return local range for dimension dim
+    std::pair<std::size_t, std::size_t> local_range(std::size_t dim) const;
+
+    /// Return sparsity pattern (possibly null)
+    std::shared_ptr<GenericSparsityPattern> sparsity_pattern()
+    { return _sparsity_pattern; }
+
+    /// Return sparsity pattern (possibly null), const version
+    std::shared_ptr<const GenericSparsityPattern> sparsity_pattern() const
+    { return _sparsity_pattern; }
+
+    /// Return informal string representation (pretty-print)
+    std::string str() const;
+
+    /// Primary storage dim (e.g., 0=row major, 1=column major)
+    const std::size_t primary_dim;
+
+    /// Dofmap block size, e.g. 3 for 3D elasticity with a suitable
+    /// ordered dofmap
+    std::size_t block_size;
+
+    /// Return MPI communicator
+    MPI_Comm mpi_comm() const
+    { return _mpi_comm; }
+
+  private:
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+    // Shape of tensor
+    std::vector<std::size_t> _shape;
+
+    // Ownership range for each dimension
+    std::vector<std::pair<std::size_t, std::size_t> > _ownership_range;
+
+    // Sparsity pattern
+    std::shared_ptr<GenericSparsityPattern> _sparsity_pattern;
+
+  };
+
+}
+#endif
diff --git a/dolfin/la/TrilinosPreconditioner.cpp b/dolfin/la/TrilinosPreconditioner.cpp
new file mode 100644
index 0000000..c968f4b
--- /dev/null
+++ b/dolfin/la/TrilinosPreconditioner.cpp
@@ -0,0 +1,278 @@
+// Copyright (C) 2010-2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+#ifdef HAS_TRILINOS
+
+#include <dolfin/common/MPI.h>
+#include <boost/assign/list_of.hpp>
+
+#include <Epetra_CombineMode.h>
+#include <Epetra_FECrsMatrix.h>
+#include <Epetra_FEVector.h>
+#include <Epetra_RowMatrix.h>
+#include <Epetra_MultiVector.h>
+#include <Epetra_Vector.h>
+#include <Ifpack.h>
+#include <ml_include.h>
+#include <ml_epetra_utils.h>
+#include <ml_MultiLevelPreconditioner.h>
+#include <Teuchos_ParameterList.hpp>
+#include <BelosEpetraAdapter.hpp>
+#include <BelosLinearProblem.hpp>
+
+#include <dolfin/log/log.h>
+#include "EpetraKrylovSolver.h"
+#include "EpetraMatrix.h"
+#include "EpetraVector.h"
+#include "GenericVector.h"
+#include "KrylovSolver.h"
+#include "VectorSpaceBasis.h"
+#include "TrilinosPreconditioner.h"
+
+using namespace dolfin;
+
+// Mapping from preconditioner string to Trilinos
+const std::map<std::string, int> TrilinosPreconditioner::_preconditioners
+  = boost::assign::map_list_of
+  ("default", -1)
+  ("none",    -1)
+  ("ilu",     -1)
+  ("icc",     -1)
+  ("amg",     -1)
+  ("ml_amg",  -1);
+
+// Mapping from preconditioner string to Trilinos
+const std::vector<std::pair<std::string, std::string> >
+TrilinosPreconditioner::_preconditioners_descr
+  = boost::assign::pair_list_of
+  ("default",   "default preconditioner")
+  ("none",      "no preconditioner")
+  ("ilu",       "Incomplete LU factorization")
+  ("icc",       "Incomplete Cholesky factorization")
+  ("amg",       "Algebraic multigrid")
+  ("ml_amg",    "ML algebraic multigrid");
+
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+TrilinosPreconditioner::preconditioners()
+{
+  return TrilinosPreconditioner::_preconditioners_descr;
+}
+//-----------------------------------------------------------------------------
+Parameters TrilinosPreconditioner::default_parameters()
+{
+  Parameters p(KrylovSolver::default_parameters()("preconditioner"));
+  p.rename("trilinos_preconditioner");
+
+  // Add some extra Trilinos-specific Schwarz options
+  //    Options are Zero, Insert, Add, Average, AbsMax
+  p("schwarz").add("mode", "Zero");
+  //    Options are rcm, metis, amd
+  p("schwarz").add("reordering_type", "rcm");
+
+  // ML options
+  Parameters p_ml("ml");
+  p_ml.add("output_level", 0);
+  p_ml.add("max_levels", 10);
+
+  // Add nested parameters sets
+  p.add(p_ml);
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+TrilinosPreconditioner::TrilinosPreconditioner(std::string preconditioner)
+  : _preconditioner(preconditioner)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  // Check that the requested method is known
+  if (_preconditioners.count(preconditioner) == 0)
+  {
+    dolfin_error("TrilinosPreconditioner.cpp",
+                 "create Trilinos preconditioner",
+                 "Unknown preconditioner (\"%s\")", preconditioner.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+TrilinosPreconditioner::~TrilinosPreconditioner()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void TrilinosPreconditioner::set(BelosLinearProblem& problem,
+                                 const EpetraMatrix& P)
+{
+  // Pointer to preconditioner matrix
+  // TODO const?!
+  Epetra_RowMatrix* _matP = P.mat().get();
+  dolfin_assert(_matP);
+
+  // Set preconditioner
+  if (_preconditioner == "default" || _preconditioner == "ilu"
+      || _preconditioner == "icc")
+  {
+    // Get/set some parameters
+    const int ilu_fill_level       = parameters("ilu")["fill_level"];
+    const int overlap              = parameters("schwarz")["overlap"];
+    const std::string reordering   = parameters("schwarz")["reordering_type"];
+    const std::string schwarz_mode = parameters("schwarz")["mode"];
+    Teuchos::ParameterList plist;
+    plist.set("fact: level-of-fill",      ilu_fill_level);
+    plist.set("schwarz: combine mode",    schwarz_mode);
+    plist.set("schwarz: reordering type", reordering);
+
+    // Create preconditioner
+    std::string ifpack_name;
+    if (_preconditioner == "icc")
+      ifpack_name = "IC";
+    else
+      ifpack_name = "ILU";
+
+    Ifpack ifpack_factory;
+    _ifpack_preconditioner.reset(ifpack_factory.Create(ifpack_name, _matP,
+                                                       overlap));
+    dolfin_assert(_ifpack_preconditioner != 0);
+
+    // Set any user-provided parameters
+    if (parameter_list)
+      plist.setParameters(*parameter_list);
+
+    // Set up preconditioner
+    _ifpack_preconditioner->SetParameters(plist);
+    _ifpack_preconditioner->Initialize();
+    _ifpack_preconditioner->Compute();
+
+    // Create the Belos preconditioned operator from the Ifpack
+    // preconditioner.  This is necessary because Belos expects an
+    // operator to apply the preconditioner with Apply() NOT
+    // ApplyInverse().
+    Teuchos::RCP<Belos::EpetraPrecOp> belosPrec =
+      Teuchos::rcp(new Belos::EpetraPrecOp(Teuchos::rcp(_ifpack_preconditioner.get(),
+                                                        false)));
+
+    // Using a *left* preconditioner messes with Belos' norm computation and
+    // can cause funny behavior at places. Stick with right preconditioning for
+    // now.
+    problem.setRightPrec(belosPrec);
+  }
+  else if (_preconditioner == "hypre_amg")
+  {
+    info("Hypre AMG not available for Trilinos. Using ML instead.");
+    set_ml(problem, *_matP);
+  }
+  else if (_preconditioner == "ml_amg" || _preconditioner == "amg")
+    set_ml(problem, *_matP);
+  else if (_preconditioner == "none")
+  {
+    // Do nothing.
+  }
+  else
+  {
+    dolfin_error("TrilinosPreconditioner.cpp",
+                 "create Trilinos preconditioner",
+                 "Unknown preconditioner \"%s\"", _preconditioner.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void TrilinosPreconditioner::set_parameters(std::shared_ptr<const Teuchos::ParameterList> list)
+{
+  parameter_list = list;
+}
+//-----------------------------------------------------------------------------
+void TrilinosPreconditioner::set_parameters(Teuchos::RCP<Teuchos::ParameterList> list)
+{
+  parameter_list = std::shared_ptr<const Teuchos::ParameterList>(reference_to_no_delete_pointer(*list.get()));
+  parameter_ref_keeper = list;
+}
+//-----------------------------------------------------------------------------
+void TrilinosPreconditioner::set_nullspace(const VectorSpaceBasis& nullspace)
+{
+  // Clear nullspace
+  _nullspace.reset();
+
+  for (std::size_t i = 0; i < nullspace.dim(); ++i)
+  {
+    dolfin_assert(nullspace[i]);
+
+    // Get Epetra vector
+    const EpetraVector& v = as_type<const EpetraVector>(*nullspace[i]);
+    dolfin_assert(v.vec());
+
+      // Initialise null space multivector on first pass
+    if (i == 0)
+    {
+      _nullspace.reset(new Epetra_MultiVector(v.vec()->Map(),
+                                              nullspace.dim()));
+    }
+
+    // Copy data into Epetra_MultiVector object
+    const Epetra_Vector& _v = *(*(v.vec()))(0);
+    *(*_nullspace)(i) = _v;
+  }
+}
+//-----------------------------------------------------------------------------
+std::string TrilinosPreconditioner::name() const
+{
+  return _preconditioner;
+}
+//-----------------------------------------------------------------------------
+std::string TrilinosPreconditioner::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+    warning("Verbose output for TrilinosPreconditioner not implemented.");
+  else
+    s << "<TrilinosPreconditioner>";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void
+TrilinosPreconditioner::set_ml(BelosLinearProblem& problem,
+                               const Epetra_RowMatrix& P)
+{
+
+  Teuchos::ParameterList mlist;
+  ML_Epetra::SetDefaults("SA", mlist);
+
+  // Set any user-provided parameters
+  if (parameter_list)
+    mlist.setParameters(*parameter_list);
+
+  // Set null space
+  if (_nullspace)
+  {
+    mlist.set("null space: add default vectors", false);
+    mlist.set("null space: type", "pre-computed");
+    mlist.set("null space: dimension", _nullspace->NumVectors());
+    mlist.set("null space: vectors", _nullspace->Values());
+  }
+
+  // Create preconditioner
+  _ml_preconditioner.reset(new ML_Epetra::MultiLevelPreconditioner(P, mlist,
+                                                                   true));
+  Teuchos::RCP<Belos::EpetraPrecOp> belosPrec
+    = Teuchos::rcp(new Belos::EpetraPrecOp(Teuchos::rcp(_ml_preconditioner.get(),
+                                                        false)));
+
+  // Set this operator as preconditioner for the linear problem
+  problem.setRightPrec(belosPrec);
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/TrilinosPreconditioner.h b/dolfin/la/TrilinosPreconditioner.h
new file mode 100644
index 0000000..a911f00
--- /dev/null
+++ b/dolfin/la/TrilinosPreconditioner.h
@@ -0,0 +1,151 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+#ifndef __DOLFIN_TRILINOS_PRECONDITIONER_H
+#define __DOLFIN_TRILINOS_PRECONDITIONER_H
+
+#ifdef HAS_TRILINOS
+
+#include <string>
+#include <vector>
+#include <memory>
+#include <Teuchos_ParameterList.hpp>
+#include <Teuchos_RCP.hpp>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/parameter/Parameters.h>
+#include "GenericPreconditioner.h"
+
+// Trilinos forward declarations
+class Epetra_MultiVector;
+class Epetra_RowMatrix;
+class Epetra_Operator;
+class Ifpack_Preconditioner;
+namespace Belos
+{
+  template<class ScalarType, class MV, class OP>
+  class LinearProblem;
+}
+
+namespace ML_Epetra
+{
+  class MultiLevelPreconditioner;
+}
+
+namespace Teuchos
+{
+  class ParameterList;
+}
+
+// some typdefs for Belos
+typedef double BelosScalarType;
+typedef Epetra_MultiVector BelosMultiVector;
+typedef Epetra_Operator BelosOperator;
+typedef Belos::LinearProblem<BelosScalarType, BelosMultiVector, BelosOperator>
+  BelosLinearProblem;
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class EpetraKrylovSolver;
+  class EpetraMatrix;
+  class GenericVector;
+  class VectorSpaceBasis;
+
+  /// This class is a wrapper for configuring Epetra
+  /// preconditioners. It does not own a preconditioner. It can take a
+  /// EpetraKrylovSolver and set the preconditioner type and
+  /// parameters.
+
+  class TrilinosPreconditioner : public GenericPreconditioner, public Variable
+  {
+  public:
+
+    /// Create Krylov solver for a particular method and preconditioner
+    explicit TrilinosPreconditioner(std::string method="default");
+
+    /// Destructor
+    virtual ~TrilinosPreconditioner();
+
+    /// Set the precondtioner and matrix used in preconditioner
+    virtual void set(BelosLinearProblem& problem,
+                     const EpetraMatrix& P
+                     );
+
+    /// Set the Trilonos preconditioner parameters list
+    void set_parameters(std::shared_ptr<const Teuchos::ParameterList> list);
+
+    /// Set the Trilonos preconditioner parameters list (for use from
+    /// Python)
+    void set_parameters(Teuchos::RCP<Teuchos::ParameterList> list);
+
+    /// Set basis for the null space of the operator. Setting this is
+    /// critical to the performance of some preconditioners, e.g. ML.
+    /// The vectors spanning the null space are copied.
+    void set_nullspace(const VectorSpaceBasis& null_space);
+
+    /// Return preconditioner name
+    std::string name() const;
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Return a list of available preconditioners
+    static std::vector<std::pair<std::string, std::string> > preconditioners();
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+  private:
+
+    /// Setup the ML precondtioner
+    void set_ml(BelosLinearProblem& problem,
+                const Epetra_RowMatrix& P);
+
+    /// Named preconditioner
+    std::string _preconditioner;
+
+    // Available named preconditioners
+    static const std::map<std::string, int> _preconditioners;
+
+    // Available named preconditionersdescriptions
+    static const std::vector<std::pair<std::string, std::string> >
+      _preconditioners_descr;
+
+    // The Preconditioner
+    std::shared_ptr<Ifpack_Preconditioner> _ifpack_preconditioner;
+    std::shared_ptr<ML_Epetra::MultiLevelPreconditioner> _ml_preconditioner;
+
+    // Parameter list
+    std::shared_ptr<const Teuchos::ParameterList> parameter_list;
+
+    // Vectors spanning the null space
+    std::shared_ptr<Epetra_MultiVector> _nullspace;
+
+    // Teuchos::ParameterList pointer, used when initialized with a
+    // Teuchos::RCP shared_ptr
+    Teuchos::RCP<const Teuchos::ParameterList> parameter_ref_keeper;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/la/UmfpackLUSolver.cpp b/dolfin/la/UmfpackLUSolver.cpp
new file mode 100644
index 0000000..2253c05
--- /dev/null
+++ b/dolfin/la/UmfpackLUSolver.cpp
@@ -0,0 +1,518 @@
+// Copyright (C) 2006-2008 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006-2012
+// Modified by Dag Lindbo 2008
+//
+// First added:  2006-06-01
+// Last changed: 2012-08-20
+
+
+#include <memory>
+
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/log/dolfin_log.h>
+#include "UmfpackLUSolver.h"
+#include "GenericLinearOperator.h"
+#include "GenericMatrix.h"
+#include "GenericVector.h"
+#include "KrylovSolver.h"
+#include "LUSolver.h"
+
+extern "C"
+{
+#ifdef HAS_UMFPACK
+#include <umfpack.h>
+#endif
+}
+
+#ifdef HAS_UMFPACK
+namespace dolfin
+{
+  class UmfpackIntSymbolicDeleter
+  {
+  public:
+    void operator() (void* symbolic)
+    {
+      if (symbolic)
+      {
+        umfpack_di_free_symbolic(&symbolic);
+        symbolic = 0;
+      }
+    }
+  };
+
+  class UmfpackLongIntSymbolicDeleter
+  {
+  public:
+    void operator() (void* symbolic)
+    {
+      if (symbolic)
+      {
+        umfpack_dl_free_symbolic(&symbolic);
+        symbolic = 0;
+      }
+    }
+  };
+
+  class UmfpackIntNumericDeleter
+  {
+  public:
+    void operator() (void* numeric)
+    {
+      if (numeric)
+      {
+        umfpack_di_free_numeric(&numeric);
+        numeric = 0;
+      }
+    }
+  };
+
+  class UmfpackLongIntNumericDeleter
+  {
+  public:
+    void operator() (void* numeric)
+    {
+      if (numeric)
+      {
+        umfpack_dl_free_numeric(&numeric);
+        numeric = 0;
+      }
+    }
+  };
+}
+#endif
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Parameters UmfpackLUSolver::default_parameters()
+{
+  Parameters p(LUSolver::default_parameters());
+  p.rename("umfpack_lu_solver");
+  return p;
+}
+//-----------------------------------------------------------------------------
+UmfpackLUSolver::UmfpackLUSolver()
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+UmfpackLUSolver::UmfpackLUSolver(std::shared_ptr<const GenericLinearOperator> A)
+  : _matA(A)
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+UmfpackLUSolver::~UmfpackLUSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void
+UmfpackLUSolver::set_operator(std::shared_ptr<const GenericLinearOperator> A)
+{
+  symbolic.reset();
+  numeric.reset();
+  _matA = A;
+  dolfin_assert(_matA);
+}
+//-----------------------------------------------------------------------------
+const GenericLinearOperator& UmfpackLUSolver::get_operator() const
+{
+  if (!_matA)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "access operator for PETSc Krylov solver",
+                 "Operator has not been set");
+  }
+  return *_matA;
+}
+//-----------------------------------------------------------------------------
+std::size_t UmfpackLUSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  dolfin_assert(_matA);
+
+  // Get some parameters
+  const bool reuse_fact   = parameters["reuse_factorization"];
+  const bool same_pattern = parameters["same_nonzero_pattern"];
+
+  // Perform symbolic factorization if required
+  if (!symbolic)
+    symbolic_factorize();
+  else if (!reuse_fact && !same_pattern)
+    symbolic_factorize();
+
+  // Perform numerical factorization if required
+  if (!numeric)
+    numeric_factorize();
+  else if (!reuse_fact)
+    numeric_factorize();
+
+  // Solve
+  return solve_factorized(x, b);
+}
+//-----------------------------------------------------------------------------
+std::size_t
+UmfpackLUSolver::solve(const GenericLinearOperator& A, GenericVector& x,
+                       const GenericVector& b)
+{
+  std::shared_ptr<const GenericLinearOperator> Atmp(&A, NoDeleter());
+  set_operator(Atmp);
+  return solve(x, b);
+}
+//-----------------------------------------------------------------------------
+void UmfpackLUSolver::symbolic_factorize()
+{
+  if (!_matA)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "factorize matrix with UMFPACK LU solver (symbolic)",
+                 "Operator has not been set");
+  }
+
+  // Clear any old factorizations
+  symbolic.reset();
+  numeric.reset();
+
+  // Need matrix data
+  std::shared_ptr<const GenericMatrix> A = require_matrix(_matA);
+
+  // Get matrix data
+  boost::tuples::tuple<const std::size_t*, const std::size_t*,
+                       const double*, int> data = A->data();
+  const std::size_t* Ap  = boost::tuples::get<0>(data);
+  const std::size_t* Ai  = boost::tuples::get<1>(data);
+  const double*      Ax  = boost::tuples::get<2>(data);
+  const std::size_t  nnz = boost::tuples::get<3>(data);
+
+  // Check dimensions and get number of non-zeroes
+  const std::size_t M = A->size(0);
+  const std::size_t N = A->size(1);
+  dolfin_assert(nnz >= M);
+
+  // Factorize and solve
+  log(PROGRESS, "Symbolic factorization of a matrix of size %d x %d (UMFPACK).",
+      M, N);
+
+  // Perform symbolic factorisation
+  symbolic = umfpack_factorize_symbolic(M, N, Ap, Ai, Ax);
+}
+//-----------------------------------------------------------------------------
+void UmfpackLUSolver::numeric_factorize()
+{
+  if (!_matA)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "factorize matrix with UMFPACK LU solver (numeric)",
+                 "Operator has not been set");
+  }
+
+  // Need matrix data
+  std::shared_ptr<const GenericMatrix> A = require_matrix(_matA);
+
+  // Get matrix data
+  boost::tuples::tuple<const std::size_t*, const std::size_t*,
+                       const double*, int> data = A->data();
+  const std::size_t* Ap  = boost::tuples::get<0>(data);
+  const std::size_t* Ai  = boost::tuples::get<1>(data);
+  const double*      Ax  = boost::tuples::get<2>(data);
+  const std::size_t  nnz = boost::tuples::get<3>(data);
+
+  // Check dimensions and get number of non-zeroes
+  const std::size_t M   = A->size(0);
+  const std::size_t N   = A->size(1);
+  dolfin_assert(nnz >= M);
+
+  // Factorize and solve
+  log(PROGRESS, "LU factorization of a matrix of size %d x %d (UMFPACK).",
+      M, N);
+
+  dolfin_assert(symbolic);
+  numeric.reset();
+
+  // Perform LU factorisation
+  numeric = umfpack_factorize_numeric(Ap, Ai, Ax, symbolic.get());
+}
+//-----------------------------------------------------------------------------
+std::size_t UmfpackLUSolver::solve_factorized(GenericVector& x,
+                                              const GenericVector& b) const
+{
+  if (!_matA)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "solve linear system with UMFPACK LU solver",
+                 "Operator has not been set");
+  }
+
+  // Need matrix data
+  std::shared_ptr<const GenericMatrix> A = require_matrix(_matA);
+
+  dolfin_assert(A->size(0) == A->size(0));
+  dolfin_assert(A->size(0) == b.size());
+
+  // Resize x if required
+  if (x.empty())
+    x.init(MPI_COMM_SELF, A->size(1));
+
+  if (!symbolic)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "solve linear system with UMFPACK LU solver",
+                 "Missing symbolic factorization, please call UmfpackLUSolver::factorize_symbolic()");
+  }
+
+  if (!numeric)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "solve linear system with UMFPACK LU solver",
+                 "Missing numeric factorization, please call UmfpackLUSolver::factorize_numeric()");
+  }
+
+  // Get matrix data
+  boost::tuples::tuple<const std::size_t*, const std::size_t*, const double*,
+                       int> data = A->data();
+  const std::size_t* Ap  = boost::tuples::get<0>(data);
+  const std::size_t* Ai  = boost::tuples::get<1>(data);
+  const double*      Ax  = boost::tuples::get<2>(data);
+
+  log(PROGRESS, "Solving linear system of size %d x %d (UMFPACK LU solver).",
+      A->size(0), A->size(1));
+
+  // Solve for tranpose since we use compressed rows and UMFPACK
+  // expected compressed columns
+  umfpack_solve(Ap, Ai, Ax, x.data(), b.data(), numeric.get());
+
+  return 1;
+}
+//-----------------------------------------------------------------------------
+#ifdef HAS_UMFPACK
+//-----------------------------------------------------------------------------
+std::shared_ptr<void>
+UmfpackLUSolver::umfpack_factorize_symbolic(std::size_t M, std::size_t N,
+                                            const std::size_t* Ap,
+                                            const std::size_t* Ai,
+                                            const double* Ax)
+{
+  dolfin_assert(Ap);
+  dolfin_assert(Ai);
+  dolfin_assert(Ax);
+
+  void* symbolic = 0;
+  std::unique_ptr<double> dnull;
+
+  // Symbolic factorisation step (reordering, etc)
+  if (sizeof(std::size_t) == sizeof(int))
+  {
+    const int* _Ap = reinterpret_cast<const int*>(Ap);
+    const int* _Ai = reinterpret_cast<const int*>(Ai);
+    long int status = umfpack_di_symbolic(M, N, _Ap, _Ai, Ax, &symbolic,
+                                          dnull.get(), dnull.get());
+    umfpack_check_status(status, "symbolic");
+    return std::shared_ptr<void>(symbolic, UmfpackIntSymbolicDeleter());
+  }
+  else if (sizeof(std::size_t) == sizeof(UF_long))
+  {
+    const UF_long* _Ap = reinterpret_cast<const UF_long*>(Ap);
+    const UF_long* _Ai = reinterpret_cast<const UF_long*>(Ai);
+    long int status = umfpack_dl_symbolic(M, N, _Ap, _Ai, Ax, &symbolic,
+                                          dnull.get(), dnull.get());
+    umfpack_check_status(status, "symbolic");
+    return std::shared_ptr<void>(symbolic, UmfpackLongIntSymbolicDeleter());
+  }
+  else
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "factorize matrix with UMFPACK LU solver (symbolic)",
+                 "Could not determine correct types for casting integers to pass to UMFPACK");
+  }
+
+  return std::shared_ptr<void>();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<void>
+UmfpackLUSolver::umfpack_factorize_numeric(const std::size_t* Ap,
+                                           const std::size_t* Ai,
+                                           const double* Ax,
+                                           void* symbolic)
+{
+  dolfin_assert(Ap);
+  dolfin_assert(Ai);
+  dolfin_assert(Ax);
+  dolfin_assert(symbolic);
+
+  void* numeric = 0;
+  std::unique_ptr<double> dnull;
+
+  // Factorization step
+  long int status = 0;
+  if (sizeof(std::size_t) == sizeof(int))
+  {
+    const int* _Ap = reinterpret_cast<const int*>(Ap);
+    const int* _Ai = reinterpret_cast<const int*>(Ai);
+    status = umfpack_di_numeric(_Ap, _Ai, Ax, symbolic, &numeric, dnull.get(),
+                                dnull.get());
+    umfpack_check_status(status, "numeric");
+    return std::shared_ptr<void>(numeric, UmfpackIntNumericDeleter());
+  }
+  else if (sizeof(std::size_t) == sizeof(UF_long))
+  {
+    const UF_long* _Ap = reinterpret_cast<const UF_long*>(Ap);
+    const UF_long* _Ai = reinterpret_cast<const UF_long*>(Ai);
+    status = umfpack_dl_numeric(_Ap, _Ai, Ax, symbolic, &numeric, dnull.get(),
+                                dnull.get());
+    umfpack_check_status(status, "numeric");
+    return std::shared_ptr<void>(numeric, UmfpackLongIntNumericDeleter());
+  }
+  else
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "factorize matrix with UMFPACK LU solver (numeric)",
+                 "Could not determine correct types for casting integers to pass to UMFPACK");
+  }
+
+  return std::shared_ptr<void>();
+}
+//-----------------------------------------------------------------------------
+void UmfpackLUSolver::umfpack_solve(const std::size_t* Ap,
+                                    const std::size_t* Ai,
+                                    const double* Ax, double* x,
+                                    const double* b, void* numeric)
+{
+  dolfin_assert(Ap);
+  dolfin_assert(Ai);
+  dolfin_assert(Ax);
+  dolfin_assert(x);
+  dolfin_assert(b);
+  dolfin_assert(numeric);
+
+  std::unique_ptr<double> dnull;
+
+  // Solve system. We assume CSR storage, but UMFPACK expects CSC, so solve
+  // for the transpose
+  long int status = 0;
+  if (sizeof(std::size_t) == sizeof(int))
+  {
+    const int* _Ap = reinterpret_cast<const int*>(Ap);
+    const int* _Ai = reinterpret_cast<const int*>(Ai);
+    status = umfpack_di_solve(UMFPACK_At, _Ap, _Ai, Ax, x, b, numeric,
+                              dnull.get(), dnull.get());
+  }
+  else if (sizeof(std::size_t) == sizeof(UF_long))
+  {
+    const UF_long* _Ap = reinterpret_cast<const UF_long*>(Ap);
+    const UF_long* _Ai = reinterpret_cast<const UF_long*>(Ai);
+    status = umfpack_dl_solve(UMFPACK_At, _Ap, _Ai, Ax, x, b, numeric,
+                              dnull.get(), dnull.get());
+  }
+  else
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "solve linear system with UMFPACK LU solver",
+                 "Could not determine correct types for casting integers to pass to UMFPACK");
+  }
+
+  umfpack_check_status(status, "solve");
+}
+//-----------------------------------------------------------------------------
+void UmfpackLUSolver::umfpack_check_status(long int status,
+                                           std::string function)
+{
+  if(status == UMFPACK_OK)
+    return;
+
+  // Printing which UMFPACK function is returning an warning/error
+  cout << "UMFPACK problem related to call to " << function << endl;
+
+  if (status == UMFPACK_WARNING_singular_matrix)
+    warning("UMFPACK reports that the matrix being solved is singular.");
+  else if (status == UMFPACK_ERROR_out_of_memory)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "solve linear system with UMFPACK LU solver",
+                 "UMFPACK has run out of memory");
+  }
+  else if(status == UMFPACK_ERROR_invalid_system)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "solve linear system with UMFPACK LU solver",
+                 "UMFPACK reports an invalid system. Matrix may be non-square");
+  }
+  else if(status == UMFPACK_ERROR_invalid_Numeric_object)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "solve linear system with UMFPACK LU solver",
+                 "UMFPACK reports an invalid Numeric object");
+  }
+  else if(status == UMFPACK_ERROR_invalid_Symbolic_object)
+  {
+    dolfin_error("UmfpackLUSolver.cpp",
+                 "solve linear system with UMFPACK LU solver",
+                 "UMFPACK reports an invalid Symbolic object");
+  }
+  else if(status != UMFPACK_OK)
+    warning("UMFPACK is reporting an unknown error.");
+}
+//-----------------------------------------------------------------------------
+#else
+//-----------------------------------------------------------------------------
+std::shared_ptr<void>
+UmfpackLUSolver::umfpack_factorize_symbolic(std::size_t M, std::size_t N,
+                                            const std::size_t* Ap,
+                                            const std::size_t* Ai,
+                                            const double* Ax)
+{
+  dolfin_error("UmfpackLUSolver.cpp",
+               "factorize matrix with UMFPACK LU solver (symbolic)",
+               "UMFPACK has not been installed");
+  return std::shared_ptr<void>();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<void>
+UmfpackLUSolver::umfpack_factorize_numeric(const std::size_t* Ap,
+                                           const std::size_t* Ai,
+                                           const double* Ax,
+                                           void* symbolic)
+{
+  dolfin_error("UmfpackLUSolver.cpp",
+               "factorize matrix with UMFPACK LU solver (numeric)",
+               "UMFPACK has not been installed");
+  return std::shared_ptr<void>();
+}
+//-----------------------------------------------------------------------------
+void UmfpackLUSolver::umfpack_solve(const std::size_t* Ap,
+                                    const std::size_t* Ai,
+                                    const double* Ax, double* x,
+                                    const double* b, void* numeric)
+{
+  dolfin_error("UmfpackLUSolver.cpp",
+               "solve linear system with UMFPACK",
+               "UMFPACK has not been installed");
+}
+//-----------------------------------------------------------------------------
+void UmfpackLUSolver::umfpack_check_status(long int status,
+                                           std::string function)
+{
+  dolfin_error("UmfpackLUSolver.cpp",
+               "solve linear system with UMFPACK",
+               "UMFPACK has not been installed");
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/la/UmfpackLUSolver.h b/dolfin/la/UmfpackLUSolver.h
new file mode 100644
index 0000000..c9e3b49
--- /dev/null
+++ b/dolfin/la/UmfpackLUSolver.h
@@ -0,0 +1,119 @@
+// Copyright (C) 2006-2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006, 2012
+// Modified by Dag Lindbo 2008
+//
+// First added:  2006-05-31
+// Last changed: 2012-08-20
+
+#ifndef __UMFPACK_LU_SOLVER_H
+#define __UMFPACK_LU_SOLVER_H
+
+#include <memory>
+#include <dolfin/common/types.h>
+#include "GenericLUSolver.h"
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class GenericVector;
+  class GenericLinearOperator;
+  class uBLASVector;
+  class uBLASLinearOperator;
+  template<typename Mat> class uBLASMatrix;
+
+  /// This class implements the direct solution (LU factorization) of
+  /// linear systems of the form Ax = b using UMFPACK
+  /// (http://www.cise.ufl.edu/research/sparse/umfpack/) if installed.
+
+  class UmfpackLUSolver : public GenericLUSolver
+  {
+
+  public:
+
+    /// Constructor
+    UmfpackLUSolver();
+
+    /// Constructor
+    UmfpackLUSolver(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Destructor
+    ~UmfpackLUSolver();
+
+    /// Set operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A);
+
+    /// Return the operator (matrix)
+    const GenericLinearOperator& get_operator() const;
+
+    /// Solve linear system Ax = b for a sparse matrix using UMFPACK
+    /// if installed
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system
+    std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                      const GenericVector& b);
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+  private:
+
+    // Perform symbolic factorisation
+    void symbolic_factorize();
+
+    /// LU factorisation
+    void numeric_factorize();
+
+    /// Solve factorized system (UMFPACK).
+    std::size_t solve_factorized(GenericVector& x,
+                                 const GenericVector& b) const;
+
+    // Return pointer to symbolic factorisation
+    static std::shared_ptr<void>
+      umfpack_factorize_symbolic(std::size_t M, std::size_t N,
+                                 const std::size_t* Ap,
+                                 const std::size_t* Ai,
+                                 const double* Ax);
+
+    // Return pointer to the numerical factorisation
+    static std::shared_ptr<void>
+      umfpack_factorize_numeric(const std::size_t* Ap,
+                                const std::size_t* Ai,
+                                const double* Ax, void* symbolic);
+
+    static void umfpack_solve(const std::size_t* Ap, const std::size_t* Ai,
+                              const double* Ax, double* x, const double* b,
+                              void* numeric);
+
+    /// Check status flag returned by an UMFPACK function
+    static void umfpack_check_status(long int status, std::string function);
+
+    // UMFPACK data (note that boost::scoped_ptr cannot hold a void pointer)
+    std::shared_ptr<void> symbolic;
+    std::shared_ptr<void> numeric;
+
+    // Operator (the matrix)
+    std::shared_ptr<const GenericLinearOperator> _matA;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/Vector.h b/dolfin/la/Vector.h
new file mode 100644
index 0000000..7f40983
--- /dev/null
+++ b/dolfin/la/Vector.h
@@ -0,0 +1,287 @@
+// Copyright (C) 2007 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2007-2010.
+// Modified by Kent-Andre Mardal, 2008.
+// Modified by Ola Skavhaug, 2008.
+// Modified by Martin Sandve Alnes, 2008.
+//
+// First added:  2007-07-03
+// Last changed: 2011-01-14
+
+#ifndef __DOLFIN_VECTOR_H
+#define __DOLFIN_VECTOR_H
+
+#include <string>
+#include <utility>
+#include <memory>
+#include <dolfin/common/types.h>
+#include "DefaultFactory.h"
+#include "GenericVector.h"
+
+namespace dolfin
+{
+
+  template<typename T> class Array;
+
+  /// This class provides the default DOLFIN vector class,
+  /// based on the default DOLFIN linear algebra backend.
+
+  class Vector : public GenericVector
+  {
+  public:
+
+    /// Create empty vector
+    Vector()
+    {
+      DefaultFactory factory;
+      vector = factory.create_vector();
+    }
+
+    /// Create vector of size N
+    Vector(MPI_Comm comm, std::size_t N)
+    {
+      DefaultFactory factory;
+      vector = factory.create_vector();
+      vector->init(comm, N);
+    }
+
+    /// Copy constructor
+    Vector(const Vector& x) : vector(x.vector->copy()) {}
+
+    /// Create a Vector from a GenericVetor
+    Vector(const GenericVector& x) : vector(x.copy()) {}
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Return copy of vector
+    virtual std::shared_ptr<GenericVector> copy() const
+    {
+      std::shared_ptr<Vector> x(new Vector(*this));
+      return x;
+    }
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero()
+    { vector->zero(); }
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode)
+    { vector->apply(mode); }
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const
+    { return vector->mpi_comm(); }
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const
+    { return "<Vector wrapper of " + vector->str(verbose) + ">"; }
+
+    //--- Implementation of the GenericVector interface ---
+
+    /// Initialize vector to size N
+    virtual void init(MPI_Comm comm, std::size_t N)
+    { vector->init(comm, N); }
+
+    /// Initlialize vector with given ownership range
+    virtual void init(MPI_Comm comm, std::pair<std::size_t, std::size_t> range)
+    { vector->init(comm, range); }
+
+    /// Initialize vector with given ownership range and with ghost
+    /// values
+    virtual void init(MPI_Comm comm,
+                      std::pair<std::size_t, std::size_t> range,
+                      const std::vector<la_index>& ghost_indices)
+    { vector->init(comm, range, ghost_indices); }
+
+    // Bring init function from GenericVector into scope
+    using GenericVector::init;
+
+    /// Return true if vector is empty
+    virtual bool empty() const
+    { return vector->empty(); }
+
+    /// Return size of vector
+    virtual std::size_t size() const
+    { return vector->size(); }
+
+    /// Return local size of vector
+    virtual std::size_t local_size() const
+    { return vector->local_size(); }
+
+    /// Return local ownership range of a vector
+    virtual std::pair<std::size_t, std::size_t> local_range() const
+    { return vector->local_range(); }
+
+    /// Determine whether global vector index is owned by this process
+    virtual bool owns_index(std::size_t i) const
+    { return vector->owns_index(i); }
+
+    /// Get block of values (values must all live on the local process)
+    virtual void get_local(double* block, std::size_t m,
+                           const dolfin::la_index* rows) const
+    { vector->get_local(block,m,rows); }
+
+    /// Set block of values
+    virtual void set(const double* block, std::size_t m,
+                     const dolfin::la_index* rows)
+    { vector->set(block, m, rows); }
+
+    /// Add block of values
+    virtual void add(const double* block, std::size_t m,
+                     const dolfin::la_index* rows)
+    { vector->add(block, m, rows); }
+
+    /// Get all values on local process
+    virtual void get_local(std::vector<double>& values) const
+    { vector->get_local(values); }
+
+    /// Set all values on local process
+    virtual void set_local(const std::vector<double>& values)
+    { vector->set_local(values); }
+
+    /// Add values to each entry on local process
+    virtual void add_local(const Array<double>& values)
+    { vector->add_local(values); }
+
+    /// Gather entries into local vector x
+    virtual void gather(GenericVector& x,
+                        const std::vector<dolfin::la_index>& indices) const
+    { vector->gather(x, indices); }
+
+    /// Gather entries into x
+    virtual void gather(std::vector<double>& x,
+                        const std::vector<dolfin::la_index>& indices) const
+    { vector->gather(x, indices); }
+
+    /// Gather all entries into x on process 0
+    virtual void gather_on_zero(std::vector<double>& x) const
+    { vector->gather_on_zero(x); }
+
+    /// Add multiple of given vector (AXPY operation)
+    virtual void axpy(double a, const GenericVector& x)
+    { vector->axpy(a, x); }
+
+    /// Replace all entries in the vector by their absolute values
+    virtual void abs()
+    { vector->abs(); }
+
+    /// Return inner product with given vector
+    virtual double inner(const GenericVector& x) const
+    { return vector->inner(x); }
+
+    /// Return norm of vector
+    virtual double norm(std::string norm_type) const
+    { return vector->norm(norm_type); }
+
+    /// Return minimum value of vector
+    virtual double min() const
+    { return vector->min(); }
+
+    /// Return maximum value of vector
+    virtual double max() const
+    { return vector->max(); }
+
+    /// Return sum of values of vector
+    virtual double sum() const
+    { return vector->sum(); }
+
+    virtual double sum(const Array<std::size_t>& rows) const
+    { return vector->sum(rows); }
+
+    /// Multiply vector by given number
+    virtual const Vector& operator*= (double a)
+    { *vector *= a; return *this; }
+
+    /// Multiply vector by another vector pointwise
+    virtual const Vector& operator*= (const GenericVector& x)
+    { *vector *= x; return *this; }
+
+    /// Divide vector by given number
+    virtual const Vector& operator/= (double a)
+    { *this *= 1.0 / a; return *this; }
+
+    /// Add given vector
+    virtual const Vector& operator+= (const GenericVector& x)
+    { axpy(1.0, x); return *this; }
+
+    /// Add number to all components of a vector
+    virtual const GenericVector& operator+= (double a)
+    { *vector += a; return *this; }
+
+    /// Subtract given vector
+    virtual const Vector& operator-= (const GenericVector& x)
+    { axpy(-1.0, x); return *this; }
+
+    /// Subtract number from all components of a vector
+    virtual const GenericVector& operator-= (double a)
+    { *vector -= a; return *this; }
+
+    /// Assignment operator
+    virtual const GenericVector& operator= (const GenericVector& x)
+    { *vector = x; return *this; }
+
+    /// Assignment operator
+    const Vector& operator= (double a)
+    { *vector = a; return *this; }
+
+    /// Return pointer to underlying data (const version)
+    virtual const double* data() const
+    { return vector->data(); }
+
+    /// Return pointer to underlying data
+    virtual double* data()
+    { return vector->data(); }
+
+    //--- Special functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const
+    { return vector->factory(); }
+
+    //--- Special functions, intended for library use only ---
+
+    /// Return concrete instance / unwrap (const version)
+    virtual const GenericVector* instance() const
+    { return vector.get(); }
+
+    /// Return concrete instance / unwrap (non-const version)
+    virtual GenericVector* instance()
+    { return vector.get(); }
+
+    virtual std::shared_ptr<const LinearAlgebraObject> shared_instance() const
+    { return vector; }
+
+    virtual std::shared_ptr<LinearAlgebraObject> shared_instance()
+    { return vector; }
+
+    //--- Special Vector functions ---
+
+    /// Assignment operator
+    const Vector& operator= (const Vector& x)
+    { *vector = *x.vector; return *this; }
+
+  private:
+
+    // Pointer to concrete implementation
+    std::shared_ptr<GenericVector> vector;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/VectorSpaceBasis.cpp b/dolfin/la/VectorSpaceBasis.cpp
new file mode 100644
index 0000000..5a4113a
--- /dev/null
+++ b/dolfin/la/VectorSpaceBasis.cpp
@@ -0,0 +1,93 @@
+// Copyright (C) 2013 Patrick E. Farrell
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-29
+// Last changed: 2013-05-29
+
+#include <dolfin/common/constants.h>
+#include "VectorSpaceBasis.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+VectorSpaceBasis::VectorSpaceBasis(const std::vector<std::shared_ptr<
+                                     GenericVector> > basis)
+  : _basis(basis)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+bool VectorSpaceBasis::is_orthonormal() const
+{
+  for (std::size_t i = 0; i < _basis.size(); i++)
+  {
+    for (std::size_t j = i; j < _basis.size(); j++)
+    {
+      dolfin_assert(_basis[i]);
+      dolfin_assert(_basis[j]);
+      const double delta_ij = (i == j) ? 1.0 : 0.0;
+      const double dot_ij = _basis[i]->inner(*_basis[j]);
+      if (abs(delta_ij - dot_ij) > DOLFIN_EPS)
+        return false;
+    }
+  }
+
+  return true;
+}
+//-----------------------------------------------------------------------------
+bool VectorSpaceBasis::is_orthogonal() const
+{
+  for (std::size_t i = 0; i < _basis.size(); i++)
+  {
+    for (std::size_t j = i; j < _basis.size(); j++)
+    {
+      dolfin_assert(_basis[i]);
+      dolfin_assert(_basis[j]);
+      if (i != j)
+      {
+        const double dot_ij = _basis[i]->inner(*_basis[j]);
+        if (abs(dot_ij) > DOLFIN_EPS)
+          return false;
+      }
+    }
+  }
+
+  return true;
+}
+//-----------------------------------------------------------------------------
+void VectorSpaceBasis::orthogonalize(GenericVector& x) const
+{
+  for (std::size_t i = 0; i < _basis.size(); i++)
+  {
+    dolfin_assert(_basis[i]);
+    const double dot = _basis[i]->inner(x);
+    x.axpy(-dot, *_basis[i]);
+  }
+}
+//-----------------------------------------------------------------------------
+std::size_t VectorSpaceBasis::dim() const
+{
+  return _basis.size();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const GenericVector>
+VectorSpaceBasis::operator[] (std::size_t i) const
+{
+  dolfin_assert(i < _basis.size());
+  return _basis[i];
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/VectorSpaceBasis.h b/dolfin/la/VectorSpaceBasis.h
new file mode 100644
index 0000000..97257dc
--- /dev/null
+++ b/dolfin/la/VectorSpaceBasis.h
@@ -0,0 +1,68 @@
+// Copyright (C) 2013 Patrick E. Farrell
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-29
+// Last changed: 2013-05-29
+
+#ifndef __VECTOR_SPACE_BASIS_H
+#define __VECTOR_SPACE_BASIS_H
+
+#include <vector>
+#include <memory>
+#include "GenericVector.h"
+
+namespace dolfin
+{
+
+  /// This class defines a basis for vector spaces,
+  /// typically used for expressing nullspaces, transpose nullspaces
+  /// and near nullspaces of singular operators
+
+  class VectorSpaceBasis
+  {
+  public:
+
+    /// Constructor
+    VectorSpaceBasis(const std::vector<std::shared_ptr<GenericVector> > basis);
+
+    /// Destructor
+    ~VectorSpaceBasis() {}
+
+    /// Test if basis is orthonormal
+    bool is_orthonormal() const;
+
+    /// Test if basis is orthogonal
+    bool is_orthogonal() const;
+
+    /// Orthogonalize x with respect to basis
+    void orthogonalize(GenericVector& x) const;
+
+    /// Dimension of the basis
+    std::size_t dim() const;
+
+    /// Get a particular basis vector
+    std::shared_ptr<const GenericVector> operator[] (std::size_t i) const;
+
+  private:
+
+    // Basis vectors
+    const std::vector<std::shared_ptr<GenericVector> > _basis;
+
+  };
+}
+
+#endif
diff --git a/dolfin/la/dolfin_la.h b/dolfin/la/dolfin_la.h
new file mode 100644
index 0000000..faaf1f5
--- /dev/null
+++ b/dolfin/la/dolfin_la.h
@@ -0,0 +1,76 @@
+#ifndef __DOLFIN_LA_H
+#define __DOLFIN_LA_H
+
+// DOLFIN la interface
+
+// Note that the order is important!
+
+#include <dolfin/la/ublas.h>
+
+#include <dolfin/la/LinearAlgebraObject.h>
+#include <dolfin/la/GenericLinearOperator.h>
+
+#include <dolfin/la/GenericTensor.h>
+#include <dolfin/la/GenericMatrix.h>
+#include <dolfin/la/GenericSparsityPattern.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/la/VectorSpaceBasis.h>
+#include <dolfin/la/GenericLinearSolver.h>
+#include <dolfin/la/GenericLUSolver.h>
+#include <dolfin/la/GenericPreconditioner.h>
+
+#include <dolfin/la/PETScOptions.h>
+#include <dolfin/la/PETScObject.h>
+#include <dolfin/la/PETScBaseMatrix.h>
+#include <dolfin/la/uBLASFactory.h>
+
+#include <dolfin/la/uBLASMatrix.h>
+#include <dolfin/la/uBLASLinearOperator.h>
+#include <dolfin/la/PETScMatrix.h>
+#include <dolfin/la/PETScLinearOperator.h>
+#include <dolfin/la/PETScPreconditioner.h>
+#include <dolfin/la/EpetraLUSolver.h>
+#include <dolfin/la/EpetraKrylovSolver.h>
+#include <dolfin/la/EpetraMatrix.h>
+#include <dolfin/la/EpetraVector.h>
+
+#include <dolfin/la/PETScKrylovSolver.h>
+#include <dolfin/la/PETScLUSolver.h>
+#include <dolfin/la/CholmodCholeskySolver.h>
+#include <dolfin/la/UmfpackLUSolver.h>
+#include <dolfin/la/MUMPSLUSolver.h>
+#include <dolfin/la/PaStiXLUSolver.h>
+
+#include <dolfin/la/STLMatrix.h>
+#include <dolfin/la/CoordinateMatrix.h>
+#include <dolfin/la/uBLASVector.h>
+#include <dolfin/la/PETScVector.h>
+
+#include <dolfin/la/SparsityPattern.h>
+
+#include <dolfin/la/GenericLinearAlgebraFactory.h>
+#include <dolfin/la/DefaultFactory.h>
+#include <dolfin/la/PETScUserPreconditioner.h>
+#include <dolfin/la/PETScFactory.h>
+#include <dolfin/la/PETScCuspFactory.h>
+#include <dolfin/la/EpetraFactory.h>
+#include <dolfin/la/STLFactory.h>
+#include <dolfin/la/SLEPcEigenSolver.h>
+#include <dolfin/la/TrilinosPreconditioner.h>
+#include <dolfin/la/uBLASSparseMatrix.h>
+#include <dolfin/la/uBLASDenseMatrix.h>
+#include <dolfin/la/uBLASPreconditioner.h>
+#include <dolfin/la/uBLASKrylovSolver.h>
+#include <dolfin/la/uBLASILUPreconditioner.h>
+#include <dolfin/la/Vector.h>
+#include <dolfin/la/Matrix.h>
+#include <dolfin/la/Scalar.h>
+#include <dolfin/la/LinearSolver.h>
+#include <dolfin/la/KrylovSolver.h>
+#include <dolfin/la/LUSolver.h>
+#include <dolfin/la/solve.h>
+#include <dolfin/la/BlockVector.h>
+#include <dolfin/la/BlockMatrix.h>
+#include <dolfin/la/LinearOperator.h>
+
+#endif
diff --git a/dolfin/la/solve.cpp b/dolfin/la/solve.cpp
new file mode 100644
index 0000000..1966cab
--- /dev/null
+++ b/dolfin/la/solve.cpp
@@ -0,0 +1,316 @@
+// Copyright (C) 2007-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2008
+// Modified by Garth N. Wells 2011
+// Modified by Mikael Mortensen 2011
+//
+// First added:  2007-04-30
+// Last changed: 2011-12-21
+
+#include <memory>
+#include <boost/assign/list_of.hpp>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/log/Table.h>
+#include <dolfin/log/LogStream.h>
+#include "GenericLinearOperator.h"
+#include "GenericVector.h"
+#include "GenericLinearAlgebraFactory.h"
+#include "DefaultFactory.h"
+#include "LinearSolver.h"
+#include "solve.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::size_t dolfin::solve(const GenericLinearOperator& A,
+                          GenericVector& x,
+                          const GenericVector& b,
+                          std::string method,
+                          std::string preconditioner)
+{
+  Timer timer("Solving linear system");
+  LinearSolver solver(method, preconditioner);
+  return solver.solve(A, x, b);
+}
+//-----------------------------------------------------------------------------
+void dolfin::list_linear_solver_methods()
+{
+  // Get methods
+  std::vector<std::pair<std::string, std::string> >
+    methods = linear_solver_methods();
+
+  // Pretty-print list of methods
+  Table t("Solver method", false);
+  for (std::size_t i = 0; i < methods.size(); i++)
+    t(methods[i].first, "Description") = methods[i].second;
+  cout << t.str(true) << endl;
+}
+//-----------------------------------------------------------------------------
+void dolfin::list_lu_solver_methods()
+{
+  // Get methods
+  std::vector<std::pair<std::string, std::string> >
+    methods = lu_solver_methods();
+
+  // Pretty-print list of methods
+  Table t("LU method", false);
+  for (std::size_t i = 0; i < methods.size(); i++)
+    t(methods[i].first, "Description") = methods[i].second;
+  cout << t.str(true) << endl;
+}
+//-----------------------------------------------------------------------------
+void dolfin::list_krylov_solver_methods()
+{
+  // Get methods
+  std::vector<std::pair<std::string, std::string> >
+    methods = krylov_solver_methods();
+
+  // Pretty-print list of methods
+  Table t("Krylov method", false);
+  for (std::size_t i = 0; i < methods.size(); i++)
+    t(methods[i].first, "Description") = methods[i].second;
+  cout << t.str(true) << endl;
+}
+//-----------------------------------------------------------------------------
+void dolfin::list_krylov_solver_preconditioners()
+{
+  // Get preconditioners
+  std::vector<std::pair<std::string, std::string> >
+    preconditioners = krylov_solver_preconditioners();
+
+  // Pretty-print list of preconditioners
+  Table t("Preconditioner", false);
+  for (std::size_t i = 0; i < preconditioners.size(); i++)
+    t(preconditioners[i].first, "Description") = preconditioners[i].second;
+  cout << t.str(true) << endl;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+dolfin::linear_solver_methods()
+{
+  // Add default method
+  std::vector<std::pair<std::string, std::string> >
+    methods;
+  methods.push_back(std::make_pair("default", "default linear solver"));
+
+  // Add LU methods
+  std::vector<std::pair<std::string, std::string> >
+    lu_methods = DefaultFactory::factory().lu_solver_methods();
+  for (std::size_t i = 0; i < lu_methods.size(); i++)
+  {
+    if (lu_methods[i].first != "default")
+      methods.push_back(lu_methods[i]);
+  }
+
+  // Add Krylov methods
+  std::vector<std::pair<std::string, std::string> >
+    krylov_methods = DefaultFactory::factory().krylov_solver_methods();
+  for (std::size_t i = 0; i < krylov_methods.size(); i++)
+  {
+    if (krylov_methods[i].first != "default")
+      methods.push_back(krylov_methods[i]);
+  }
+
+  return methods;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> > dolfin::lu_solver_methods()
+{
+  return DefaultFactory::factory().lu_solver_methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+dolfin::krylov_solver_methods()
+{
+  return DefaultFactory::factory().krylov_solver_methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+dolfin::krylov_solver_preconditioners()
+{
+  return DefaultFactory::factory().krylov_solver_preconditioners();
+}
+//-----------------------------------------------------------------------------
+bool dolfin::has_lu_solver_method(std::string method)
+{
+  std::vector<std::pair<std::string, std::string> > methods =
+    DefaultFactory::factory().lu_solver_methods();
+  for (std::size_t i = 0; i < methods.size(); i++)
+    if (methods[i].first == method)
+      return true;
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool dolfin::has_krylov_solver_method(std::string method)
+{
+  std::vector<std::pair<std::string, std::string> > methods =
+    DefaultFactory::factory().krylov_solver_methods();
+  for (std::size_t i = 0; i < methods.size(); i++)
+    if (methods[i].first == method)
+      return true;
+  return false;
+}
+//-----------------------------------------------------------------------------
+bool dolfin::has_krylov_solver_preconditioner(std::string preconditioner)
+{
+  std::vector<std::pair<std::string, std::string> > preconditioners
+    = DefaultFactory::factory().krylov_solver_preconditioners();
+  for (std::size_t i = 0; i < preconditioners.size(); i++)
+    if (preconditioners[i].first == preconditioner)
+      return true;
+  return false;
+}
+//-----------------------------------------------------------------------------
+double dolfin::residual(const GenericLinearOperator& A,
+                        const GenericVector& x,
+                        const GenericVector& b)
+{
+  std::shared_ptr<GenericVector> y = x.factory().create_vector();
+  A.mult(x, *y);
+  *y -= b;
+  return y->norm("l2");
+}
+//-----------------------------------------------------------------------------
+double dolfin::norm(const GenericVector& x, std::string norm_type)
+{
+  return x.norm(norm_type);
+}
+//-----------------------------------------------------------------------------
+double dolfin::normalize(GenericVector& x, std::string normalization_type)
+{
+  if (x.empty())
+  {
+    dolfin_error("solve.cpp",
+                 "normalize vector",
+                 "Cannot normalize vector of zero length");
+  }
+
+  double c = 0.0;
+  if (normalization_type == "l2")
+  {
+    c = x.norm("l2");
+    x /= c;
+  }
+  else if (normalization_type == "average")
+  {
+    c = x.sum()/static_cast<double>(x.size());
+    x -= c;
+  }
+  else
+  {
+    dolfin_error("solve.cpp",
+                 "normalize vector",
+                 "Unknown normalization type (\"%s\")",
+                 normalization_type.c_str());
+  }
+
+  return c;
+}
+//-----------------------------------------------------------------------------
+bool dolfin::has_linear_algebra_backend(std::string backend)
+{
+  if (backend == "uBLAS")
+    return true;
+  else if (backend == "PETSc")
+  {
+    #ifdef HAS_PETSC
+    return true;
+    #else
+    return false;
+    #endif
+  }
+  else if (backend == "PETScCusp")
+  {
+    #ifdef HAS_PETSC_CUSP
+    return true;
+    #else
+    return false;
+    #endif
+  }
+  else if (backend == "Epetra")
+  {
+    #ifdef HAS_TRILINOS
+    return true;
+    #else
+    return false;
+    #endif
+  }
+  else if (backend == "STL")
+    return true;
+
+  return false;
+}
+//-------------------------------------------------------------------------
+void dolfin::list_linear_algebra_backends()
+{
+  std::vector<std::pair<std::string, std::string> > backends
+    = linear_algebra_backends();
+
+  // Pretty-print list of available linear algebra backends
+  Table t("Linear algebra backends", false);
+  for (std::size_t i = 0; i < backends.size(); i++)
+    t(backends[i].first, "Description") = backends[i].second;
+
+  cout << t.str(true) << endl;
+}
+//-------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+dolfin::linear_algebra_backends()
+{
+  std::vector<std::pair<std::string, std::string> > backends;
+
+  std::map<std::string, std::string> default_backend
+    = boost::assign::map_list_of("uBLAS",  " (default)")
+                                ("Epetra", "")
+                                ("PETSc", "");
+  #ifdef HAS_PETSC
+  default_backend["uBLAS"] = "";
+  default_backend["PETSc"] = " (default)";
+  #else
+    #ifdef HAS_TRILINOS
+    default_backend["uBLAS"] = "";
+    default_backend["Epetra"] = " (default)";
+    #endif
+  #endif
+
+  // Add available backends
+  backends.push_back(std::make_pair("uBLAS",
+                                    "Template based basic linear algebra "
+				    "from boost" + default_backend["uBLAS"]));
+  backends.push_back(std::make_pair("STL",
+                                  "Light weight storage backend for Tensors"));
+
+  #ifdef HAS_PETSC
+  backends.push_back(std::make_pair("PETSc",
+                                    "Powerful MPI parallel linear algebra"
+				    " library" + default_backend["PETSc"]));
+  #endif
+  #ifdef HAS_PETSC_CUSP
+  backends.push_back(std::make_pair("PETScCusp",
+                                    "GPU-accelerated build of PETSc"));
+  #endif
+  #ifdef HAS_TRILINOS
+  backends.push_back(std::make_pair("Epetra",
+                                    "Powerful MPI parallel linear algebra"
+				    " library" + default_backend["Epetra"]));
+  #endif
+
+  return backends;
+}
+//-------------------------------------------------------------------------
diff --git a/dolfin/la/solve.h b/dolfin/la/solve.h
new file mode 100644
index 0000000..7f7282b
--- /dev/null
+++ b/dolfin/la/solve.h
@@ -0,0 +1,110 @@
+// Copyright (C) 2007-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2008.
+// Modified by Garth N. Wells 2011.
+//
+// First added:  2007-04-30
+// Last changed: 2011-10-19
+
+#ifndef __SOLVE_LA_H
+#define __SOLVE_LA_H
+
+#include <vector>
+#include <string>
+
+#include <dolfin/common/types.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericLinearOperator;
+  class GenericVector;
+
+  /// Solve linear system Ax = b
+  std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                    const GenericVector& b,
+                    std::string method = "lu",
+                    std::string preconditioner = "none");
+
+  /// List available linear algebra backends
+  void list_linear_algebra_backends();
+
+  /// List available solver methods for current linear algebra backend
+  void list_linear_solver_methods();
+
+  /// List available LU methods for current linear algebra backend
+  void list_lu_solver_methods();
+
+  /// List available Krylov methods for current linear algebra backend
+  void list_krylov_solver_methods();
+
+  /// List available preconditioners for current linear algebra
+  /// backend
+  void list_krylov_solver_preconditioners();
+
+  // Return true if a specific linear algebra backend is supported
+  bool has_linear_algebra_backend(std::string backend);
+
+  /// Return true if LU method for the current linear algebra backend is
+  /// available
+  bool has_lu_solver_method(std::string method);
+
+  /// Return true if Krylov method for the current linear algebra
+  /// backend is available
+  bool has_krylov_solver_method(std::string method);
+
+  /// Return true if Preconditioner for the current linear algebra
+  /// backend is available
+  bool has_krylov_solver_preconditioner(std::string preconditioner);
+
+  /// Return available linear algebra backends
+  std::vector<std::pair<std::string, std::string> > linear_algebra_backends();
+
+  /// Return a list of available solver methods for current linear
+  /// algebra backend
+  std::vector<std::pair<std::string, std::string> > linear_solver_methods();
+
+  /// Return a list of available LU methods for current linear algebra
+  /// backend
+  std::vector<std::pair<std::string, std::string> > lu_solver_methods();
+
+  /// Return a list of available Krylov methods for current linear
+  /// algebra backend
+  std::vector<std::pair<std::string, std::string> > krylov_solver_methods();
+
+  /// Return a list of available preconditioners for current linear
+  /// algebra backend
+  std::vector<std::pair<std::string, std::string> >
+    krylov_solver_preconditioners();
+
+  /// Compute residual ||Ax - b||
+  double residual(const GenericLinearOperator& A, const GenericVector& x,
+                  const GenericVector& b);
+
+  /// Compute norm of vector. Valid norm types are "l2", "l1" and
+  /// "linf".
+  double norm(const GenericVector& x, std::string norm_type="l2");
+
+  /// Normalize vector according to given normalization type
+  double normalize(GenericVector& x,
+                   std::string normalization_type = "average");
+
+}
+
+#endif
diff --git a/dolfin/la/uBLASDenseMatrix.h b/dolfin/la/uBLASDenseMatrix.h
new file mode 100644
index 0000000..6129780
--- /dev/null
+++ b/dolfin/la/uBLASDenseMatrix.h
@@ -0,0 +1,33 @@
+// Copyright (C) 2006 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-05-29
+// Last changed:
+
+#ifndef __UBLAS_DENSE_MATRIX_H
+#define __UBLAS_DENSE_MATRIX_H
+
+#include "uBLASMatrix.h"
+
+namespace dolfin
+{
+
+  typedef uBLASMatrix<ublas_dense_matrix> uBLASDenseMatrix;
+
+}
+
+#endif
diff --git a/dolfin/la/uBLASDummyPreconditioner.cpp b/dolfin/la/uBLASDummyPreconditioner.cpp
new file mode 100644
index 0000000..5d0eda3
--- /dev/null
+++ b/dolfin/la/uBLASDummyPreconditioner.cpp
@@ -0,0 +1,41 @@
+// Copyright (C) 2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-07-04
+// Last changed: 2006-07-04
+
+#include "uBLASVector.h"
+#include "uBLASDummyPreconditioner.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+uBLASDummyPreconditioner::uBLASDummyPreconditioner()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+uBLASDummyPreconditioner::~uBLASDummyPreconditioner()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void uBLASDummyPreconditioner::solve(uBLASVector& x, const uBLASVector& b) const
+{
+  x.vec().assign(b.vec());
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/uBLASDummyPreconditioner.h b/dolfin/la/uBLASDummyPreconditioner.h
new file mode 100644
index 0000000..7fb5734
--- /dev/null
+++ b/dolfin/la/uBLASDummyPreconditioner.h
@@ -0,0 +1,55 @@
+// Copyright (C) 2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-07-04
+// Last changed: 2006-07-04
+
+#ifndef __UBLAS_DUMMY_PRECONDITIONER_H
+#define __UBLAS_DUMMY_PRECONDITIONER_H
+
+#include "uBLASPreconditioner.h"
+
+namespace dolfin
+{
+
+  /// This class provides a dummy (do nothing) preconditioner for the
+  /// uBLAS Krylov solver.
+
+  class uBLASDummyPreconditioner : public uBLASPreconditioner
+  {
+  public:
+
+    /// Constructor
+    uBLASDummyPreconditioner();
+
+    /// Destructor
+    ~uBLASDummyPreconditioner();
+
+    /// Initialise preconditioner (dense matrix)
+    void init(const uBLASMatrix<ublas_sparse_matrix>& A) {}
+
+    /// Initialise preconditioner (virtual matrix)
+    void init(const uBLASLinearOperator& A) {}
+
+    /// Solve linear system Ax = b approximately
+    void solve(uBLASVector& x, const uBLASVector& b) const;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/uBLASFactory.h b/dolfin/la/uBLASFactory.h
new file mode 100644
index 0000000..887009a
--- /dev/null
+++ b/dolfin/la/uBLASFactory.h
@@ -0,0 +1,141 @@
+// Copyright (C) 2007 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2008
+// Modified by Anders Logg 2011-2012
+//
+// First added:  2007-12-06
+// Last changed: 2012-08-20
+
+#ifndef __UBLAS_FACTORY_H
+#define __UBLAS_FACTORY_H
+
+#include <string>
+#include <memory>
+
+#include "uBLASKrylovSolver.h"
+#include "uBLASMatrix.h"
+#include "uBLASVector.h"
+#include "TensorLayout.h"
+#include "UmfpackLUSolver.h"
+#include "GenericLinearAlgebraFactory.h"
+
+namespace dolfin
+{
+  // Forward declaration
+  class GenericLinearSolver;
+
+  template<typename Mat = ublas_sparse_matrix>
+  class uBLASFactory : public GenericLinearAlgebraFactory
+  {
+  public:
+
+    /// Destructor
+    virtual ~uBLASFactory() {}
+
+    /// Create empty matrix
+    std::shared_ptr<GenericMatrix> create_matrix() const
+    {
+      std::shared_ptr<GenericMatrix> A(new uBLASMatrix<Mat>);
+      return A;
+    }
+
+    /// Create empty vector
+    std::shared_ptr<GenericVector> create_vector() const
+    {
+      std::shared_ptr<GenericVector> x(new uBLASVector);
+      return x;
+    }
+
+    /// Create empty tensor layout
+    std::shared_ptr<TensorLayout> create_layout(std::size_t rank) const
+    {
+      bool sparsity = false;
+      if (rank > 1)
+        sparsity = true;
+      std::shared_ptr<TensorLayout> pattern(new TensorLayout(0, sparsity));
+      return pattern;
+    }
+
+    /// Create empty linear operator
+    std::shared_ptr<GenericLinearOperator> create_linear_operator() const
+    {
+      std::shared_ptr<GenericLinearOperator> A(new uBLASLinearOperator);
+      return A;
+    }
+
+    /// Create LU solver
+    std::shared_ptr<GenericLUSolver> create_lu_solver(std::string method) const
+    {
+      std::shared_ptr<GenericLUSolver> solver(new UmfpackLUSolver);
+      return solver;
+    }
+
+    /// Create Krylov solver
+    std::shared_ptr<GenericLinearSolver> create_krylov_solver(std::string method,
+                                              std::string preconditioner) const
+    {
+      std::shared_ptr<GenericLinearSolver>
+        solver(new uBLASKrylovSolver(method, preconditioner));
+      return solver;
+    }
+
+    /// Return a list of available LU solver methods
+    std::vector<std::pair<std::string, std::string> >
+      lu_solver_methods() const
+    {
+      std::vector<std::pair<std::string, std::string> > methods;
+      methods.push_back(std::make_pair("default",
+                                       "default LU solver"));
+      methods.push_back(std::make_pair("umfpack",
+                                       "UMFPACK (Unsymmetric MultiFrontal sparse LU factorization)"));
+      return methods;
+    }
+
+    /// Return a list of available Krylov solver methods
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_methods() const
+    {
+      return uBLASKrylovSolver::methods();
+    }
+
+    /// Return a list of available preconditioners
+    std::vector<std::pair<std::string, std::string> >
+      krylov_solver_preconditioners() const
+    {
+      return uBLASKrylovSolver::preconditioners();
+    }
+
+    /// Return singleton instance
+    static uBLASFactory<Mat>& instance()
+    { return factory; }
+
+  private:
+
+    // Private Constructor
+    uBLASFactory() {}
+
+    // Singleton instance
+    static uBLASFactory<Mat> factory;
+
+  };
+}
+
+// Initialise static data
+template<typename Mat> dolfin::uBLASFactory<Mat> dolfin::uBLASFactory<Mat>::factory;
+
+#endif
diff --git a/dolfin/la/uBLASILUPreconditioner.cpp b/dolfin/la/uBLASILUPreconditioner.cpp
new file mode 100644
index 0000000..00f018b
--- /dev/null
+++ b/dolfin/la/uBLASILUPreconditioner.cpp
@@ -0,0 +1,184 @@
+// Copyright (C) 2006-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2006-2010.
+//
+// First added:  2006-06-23
+// Last changed: 2010-08-31
+
+#include <dolfin/common/constants.h>
+#include "uBLASVector.h"
+#include "uBLASSparseMatrix.h"
+#include "uBLASILUPreconditioner.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+uBLASILUPreconditioner::uBLASILUPreconditioner(const Parameters& krylov_parameters)
+  : parameters(krylov_parameters)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+uBLASILUPreconditioner::~uBLASILUPreconditioner()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void uBLASILUPreconditioner::init(const uBLASMatrix<ublas_sparse_matrix>& P)
+{
+  ublas_sparse_matrix& _matM = M.mat();
+
+  const std::size_t size = P.size(0);
+  _matM.resize(size, size, false);
+  _matM.assign(P.mat());
+
+  // Add term to diagonal to avoid negative pivots
+  const double zero_shift = parameters("preconditioner")["shift_nonzero"];
+  if(zero_shift > 0.0)
+    _matM.plus_assign( zero_shift*ublas::identity_matrix<double>(size) );
+
+  /*
+  // Straightforward and very slow implementation. This is used for verification
+  tic();
+  M.assign(A);
+  for(std::size_t i=1; i < size; ++i)
+  {
+    for(std::size_t k=0; k < i; ++k)
+    {
+     if( fabs( M(i,k) ) > 0.0 )
+      {
+        M(i,k) = M(i,k)/M(k,k);
+        for(std::size_t j=k+1; j < size; ++j)
+        {
+          if( fabs( M(i,j) ) > DOLFIN_EPS )
+              M(i,j) = M(i,j) - M(i,k)*M(k,j);
+        }
+      }
+    }
+  }
+  */
+
+  // This approach using uBLAS iterators is simple and quite fast.
+  // Is it possible to remove the M(.,.) calls? This would speed it up a lot.
+
+  /*
+  // Sparse matrix iterators
+  typedef uBLASMatrix<ublas_sparse_matrix>::iterator1 it1;
+  typedef uBLASMatrix<ublas_sparse_matrix>::iterator2 it2;
+  it2 ij;
+  for (it1 i1 = M.begin1(); i1 != M.end1(); ++i1)  // iterate over rows  i=0 -> size
+  {
+    for (it2 ik = i1.begin(); ik.index2() <  ik.index1(); ++ik) // move along row k=0 -> i
+    {
+      *ik /= M(ik.index2(),ik.index2());    // M(i,k) = M(i,k)/M(k,k)
+      ij=ik;
+      ++ij;
+      for( ; ij != i1.end(); ++ij)                  // over j=k+1 -> size
+        *ij -=  (*ik)*M(ik.index2(), ij.index2());  // M(i,j) = M(i,j) - M(i,k)*M(k, j)
+    }
+  }
+  */
+
+  // The below algorithm is based on that in the book
+  // Y. Saad, "Iterative Methods for Sparse Linear Systems", p.276-278.
+  // It is specific to compressed row storage
+
+  // Initialise some data
+  diagonal.resize(size);
+  diagonal[0] = 0;
+
+  std::vector<std::size_t> iw(size);
+  for(std::size_t i=0; i< size; ++i)
+    iw[i] = 0;
+
+  std::size_t j0=0, j1=0, j=0, jrow=0, jw=0;
+  double t1;
+
+  for (std::size_t k = 0; k < size ; ++k)        // i (rows)
+  {
+    j0 = _matM.index1_data () [k];    // ia
+    j1 = _matM.index1_data () [k+1]-1;
+
+    // Initialise working array iw
+    for (std::size_t i = j0;  i <= j1; ++i)
+      iw[ _matM.index2_data () [i] ] = i;  // ja
+
+    // Move along row looking for diagonal
+    j=j0;
+    while(j <= j1)
+    {
+      jrow = _matM.index2_data () [j];  // ja
+
+      if( jrow >= k ) // passed or found diagonal, therefore break
+        break;
+
+      t1 = (_matM.value_data() [j])/(_matM.value_data() [ diagonal[jrow] ]);  //M(k,j) = M(k,j)/M(j,j)
+      _matM.value_data() [j] = t1;
+      for(std::size_t jj = diagonal[jrow]+1; jj <= _matM.index1_data () [jrow+1]-1; ++jj)
+      {
+        jw = iw[ _matM.index2_data () [jj] ];
+        if(jw != 0)
+          _matM.value_data() [jw] = _matM.value_data() [jw] -t1*(_matM.value_data() [jj]);
+      } // jj
+      ++j;
+    }
+    diagonal[k] = j;
+
+    if (jrow != k || fabs( _matM.value_data() [j] ) < DOLFIN_EPS)
+    {
+      dolfin_error("uBLASILUPreconditioner.cpp",
+                   "initialize uBLAS ILU preconditioner",
+                   "Zero pivot detected in row %u", k);
+    }
+
+    for(std::size_t i=j0; i <= j1; ++i)
+      iw[ _matM.index2_data () [i] ] = 0;
+  } // k
+}
+//-----------------------------------------------------------------------------
+void uBLASILUPreconditioner::solve(uBLASVector& x, const uBLASVector& b) const
+{
+  // Get uderlying uBLAS matrices and vectors
+  ublas_vector& _x = x.vec();
+  const ublas_vector& _b = b.vec();
+  const ublas_sparse_matrix & _matM = M.mat();
+
+  dolfin_assert(_matM.size1() > 0 && _matM.size2() > 0);
+  dolfin_assert( _x.size() == _matM.size1() );
+  dolfin_assert( _x.size() == _b.size());
+
+  // Solve in-place
+  _x.assign(_b);
+
+  // Perform substutions for compressed row storage. This is the fastest.
+  const std::size_t size = _matM.size1();
+  for(std::size_t i =0; i < size; ++i)
+  {
+    std::size_t k;
+    for(k = _matM.index1_data () [i]; k < diagonal[i]; ++k)
+      _x(i) -= ( _matM.value_data () [k] )*x[ _matM.index2_data () [k] ];
+  }
+  for(int i =size-1; i >= 0; --i)
+  {
+    std::size_t k;
+    for(k = _matM.index1_data () [i+1]-1; k > diagonal[i]; --k)
+      _x(i) -= ( _matM.value_data () [k] )*x[ _matM.index2_data () [k] ];
+    _x(i) /= ( _matM.value_data () [k] );
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/uBLASILUPreconditioner.h b/dolfin/la/uBLASILUPreconditioner.h
new file mode 100644
index 0000000..fd6d43a
--- /dev/null
+++ b/dolfin/la/uBLASILUPreconditioner.h
@@ -0,0 +1,69 @@
+// Copyright (C) 2006-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006.
+//
+// First added:  2006-06-23
+// Last changed: 2009-07-03
+
+#ifndef __UBLAS_ILU_PRECONDITIONER_H
+#define __UBLAS_ILU_PRECONDITIONER_H
+
+#include "ublas.h"
+#include "uBLASPreconditioner.h"
+#include "uBLASMatrix.h"
+
+namespace dolfin
+{
+
+  template<typename Mat> class uBLASMatrix;
+  class uBLASVector;
+
+  /// This class implements an incomplete LU factorization (ILU)
+  /// preconditioner for the uBLAS Krylov solver.
+
+  class uBLASILUPreconditioner : public uBLASPreconditioner
+  {
+  public:
+
+    /// Constructor
+    uBLASILUPreconditioner(const Parameters& krylov_parameters);
+
+    /// Destructor
+    ~uBLASILUPreconditioner();
+
+    // Initialize preconditioner
+    void init(const uBLASMatrix<ublas_sparse_matrix>& P);
+
+    /// Solve linear system Ax = b approximately
+    void solve(uBLASVector& x, const uBLASVector& b) const;
+
+  private:
+
+    // Preconditioner matrix (factorised)
+    uBLASMatrix<ublas_sparse_matrix> M;
+
+    // Diagonal
+    std::vector<std::size_t> diagonal;
+
+    const Parameters& parameters;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/uBLASKrylovSolver.cpp b/dolfin/la/uBLASKrylovSolver.cpp
new file mode 100644
index 0000000..a6e6de9
--- /dev/null
+++ b/dolfin/la/uBLASKrylovSolver.cpp
@@ -0,0 +1,168 @@
+// Copyright (C) 2006-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006-2012
+//
+// First added:  2006-05-31
+// Last changed: 2012-05-07
+
+#include <boost/assign/list_of.hpp>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/log/LogStream.h>
+#include "uBLASILUPreconditioner.h"
+#include "uBLASDummyPreconditioner.h"
+#include "uBLASKrylovSolver.h"
+#include "KrylovSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+uBLASKrylovSolver::methods()
+{
+  return boost::assign::pair_list_of
+    ("default",  "default Krylov method")
+    ("cg",       "Conjugate gradient method")
+    ("gmres",    "Generalized minimal residual method")
+    ("bicgstab", "Biconjugate gradient stabilized method");
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+uBLASKrylovSolver::preconditioners()
+{
+  return boost::assign::pair_list_of
+    ("default", "default preconditioner")
+    ("none",    "No preconditioner")
+    ("ilu",     "Incomplete LU factorization");
+}
+//-----------------------------------------------------------------------------
+Parameters uBLASKrylovSolver::default_parameters()
+{
+  Parameters p(KrylovSolver::default_parameters());
+  p.rename("ublas_krylov_solver");
+  return p;
+}
+//-----------------------------------------------------------------------------
+uBLASKrylovSolver::uBLASKrylovSolver(std::string method,
+                                     std::string preconditioner)
+  : _method(method), report(false)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  // Select and create default preconditioner
+  select_preconditioner(preconditioner);
+}
+//-----------------------------------------------------------------------------
+uBLASKrylovSolver::uBLASKrylovSolver(uBLASPreconditioner& pc)
+  : _method("default"), _pc(reference_to_no_delete_pointer(pc)), report(false)
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+uBLASKrylovSolver::uBLASKrylovSolver(std::string method,
+                                     uBLASPreconditioner& pc)
+  : _method(method), _pc(reference_to_no_delete_pointer(pc)), report(false)
+{
+  // Set parameter values
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+uBLASKrylovSolver::~uBLASKrylovSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t uBLASKrylovSolver::solve(GenericVector& x, const GenericVector& b)
+{
+  dolfin_assert(_matA);
+  dolfin_assert(_matP);
+
+  // Try to first use operator as a uBLAS matrix
+  if (has_type<const uBLASMatrix<ublas_sparse_matrix> >(*_matA))
+  {
+    std::shared_ptr<const uBLASMatrix<ublas_sparse_matrix> > A
+      = as_type<const uBLASMatrix<ublas_sparse_matrix> >(_matA);
+    std::shared_ptr<const uBLASMatrix<ublas_sparse_matrix> > P
+      = as_type<const uBLASMatrix<ublas_sparse_matrix> >(_matP);
+
+    dolfin_assert(A);
+    dolfin_assert(P);
+
+    return solve_krylov(*A,
+                        as_type<uBLASVector>(x),
+                        as_type<const uBLASVector>(b),
+                        *P);
+  }
+
+  // If that fails, try to use it as a uBLAS linear operator
+  if (has_type<const uBLASLinearOperator>(*_matA))
+  {
+    std::shared_ptr<const uBLASLinearOperator> A
+      =  as_type<const uBLASLinearOperator>(_matA);
+    std::shared_ptr<const uBLASLinearOperator> P
+      =  as_type<const uBLASLinearOperator>(_matP);
+
+    dolfin_assert(A);
+    dolfin_assert(P);
+
+    return solve_krylov(*A,
+                        as_type<uBLASVector>(x),
+                        as_type<const uBLASVector>(b),
+                        *P);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t uBLASKrylovSolver::solve(const GenericLinearOperator& A,
+                                     GenericVector& x,
+                                     const GenericVector& b)
+{
+  // Set operator
+  std::shared_ptr<const GenericLinearOperator> Atmp(&A, NoDeleter());
+  set_operator(Atmp);
+  return solve(as_type<uBLASVector>(x), as_type<const uBLASVector>(b));
+}
+//-----------------------------------------------------------------------------
+void uBLASKrylovSolver::select_preconditioner(std::string preconditioner)
+{
+  if (preconditioner == "none")
+    _pc.reset(new uBLASDummyPreconditioner());
+  else if (preconditioner == "ilu")
+    _pc.reset(new uBLASILUPreconditioner(parameters));
+  else if (preconditioner == "default")
+    _pc.reset(new uBLASILUPreconditioner(parameters));
+  else
+  {
+    warning("Requested preconditioner is not available for uBLAS Krylov solver. Using ILU.");
+    _pc.reset(new uBLASILUPreconditioner(parameters));
+  }
+}
+//-----------------------------------------------------------------------------
+void uBLASKrylovSolver::read_parameters()
+{
+  // Set tolerances and other parameters
+  rtol    = parameters["relative_tolerance"];
+  atol    = parameters["absolute_tolerance"];
+  div_tol = parameters["divergence_limit"];
+  max_it  = parameters["maximum_iterations"];
+  restart = parameters("gmres")["restart"];
+  report  = parameters["report"];
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/uBLASKrylovSolver.h b/dolfin/la/uBLASKrylovSolver.h
new file mode 100644
index 0000000..1976d2a
--- /dev/null
+++ b/dolfin/la/uBLASKrylovSolver.h
@@ -0,0 +1,518 @@
+// Copyright (C) 2006-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006-2012
+//
+// First added:  2006-05-31
+// Last changed: 2012-08-20
+
+#ifndef __UBLAS_KRYLOV_SOLVER_H
+#define __UBLAS_KRYLOV_SOLVER_H
+
+#include <set>
+#include <string>
+#include <memory>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/types.h>
+#include "ublas.h"
+#include "GenericLinearSolver.h"
+#include "uBLASLinearOperator.h"
+#include "uBLASMatrix.h"
+#include "uBLASVector.h"
+#include "uBLASPreconditioner.h"
+
+namespace dolfin
+{
+
+  class GenericLinearOperator;
+  class GenericVector;
+
+  /// This class implements Krylov methods for linear systems
+  /// of the form Ax = b using uBLAS data types.
+
+  class uBLASKrylovSolver : public GenericLinearSolver
+  {
+  public:
+
+    /// Create Krylov solver for a particular method and preconditioner
+    uBLASKrylovSolver(std::string method="default",
+                      std::string preconditioner="default");
+
+    /// Create Krylov solver for a particular uBLASPreconditioner
+    uBLASKrylovSolver(uBLASPreconditioner& pc);
+
+    /// Create Krylov solver for a particular method and uBLASPreconditioner
+    uBLASKrylovSolver(std::string method,
+                      uBLASPreconditioner& pc);
+
+    /// Destructor
+    ~uBLASKrylovSolver();
+
+    /// Solve the operator (matrix)
+    void set_operator(std::shared_ptr<const GenericLinearOperator> A)
+    { set_operators(A, A); }
+
+    /// Set operator (matrix) and preconditioner matrix
+    void set_operators(std::shared_ptr<const GenericLinearOperator> A,
+                       std::shared_ptr<const GenericLinearOperator> P)
+    { _matA = A; _matP = P; }
+
+
+    /// Return the operator (matrix)
+    const GenericLinearOperator& get_operator() const
+    {
+      if (!_matA)
+      {
+        dolfin_error("uBLASKrylovSolver.cpp",
+                     "access operator for uBLAS Krylov solver",
+                     "Operator has not been set");
+      }
+      return *_matA;
+    }
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(GenericVector& x, const GenericVector& b);
+
+    /// Solve linear system Ax = b and return number of iterations
+    std::size_t solve(const GenericLinearOperator& A, GenericVector& x,
+                      const GenericVector& b);
+
+    /// Return a list of available solver methods
+    static std::vector<std::pair<std::string, std::string> > methods();
+
+    /// Return a list of available preconditioners
+    static std::vector<std::pair<std::string, std::string> > preconditioners();
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+  private:
+
+    /// Select solver and solve linear system Ax = b and return number
+    /// of iterations
+    template<typename MatA, typename MatP>
+      std::size_t solve_krylov(const MatA& A,
+                               uBLASVector& x,
+                               const uBLASVector& b,
+                               const MatP& P);
+
+    /// Solve linear system Ax = b using CG
+    template<typename Mat>
+      std::size_t solveCG(const Mat& A, uBLASVector& x, const uBLASVector& b,
+                          bool& converged) const;
+
+    /// Solve linear system Ax = b using restarted GMRES
+    template<typename Mat>
+      std::size_t solveGMRES(const Mat& A, uBLASVector& x, const uBLASVector& b,
+                             bool& converged) const;
+
+    /// Solve linear system Ax = b using BiCGStab
+    template<typename Mat>
+      std::size_t solveBiCGStab(const Mat& A, uBLASVector& x,
+                                const uBLASVector& b,
+                                bool& converged) const;
+
+    /// Select and create named preconditioner
+    void select_preconditioner(std::string preconditioner);
+
+    /// Read solver parameters
+    void read_parameters();
+
+    /// Krylov method
+    std::string _method;
+
+    /// Preconditioner
+    std::shared_ptr<uBLASPreconditioner> _pc;
+
+    /// Solver parameters
+    double rtol, atol, div_tol;
+    std::size_t max_it, restart;
+    bool report;
+
+    /// Operator (the matrix)
+    std::shared_ptr<const GenericLinearOperator> _matA;
+
+    /// Matrix used to construct the preconditoner
+    std::shared_ptr<const GenericLinearOperator> _matP;
+
+  };
+  //---------------------------------------------------------------------------
+  // Implementation of template functions
+  //---------------------------------------------------------------------------
+  template<typename MatA, typename MatP>
+    std::size_t uBLASKrylovSolver::solve_krylov(const MatA& A,
+                                                uBLASVector& x,
+                                                const uBLASVector& b,
+                                                const MatP& P)
+  {
+    // Check dimensions
+    std::size_t M = A.size(0);
+    std::size_t N = A.size(1);
+    if ( N != b.size() )
+    {
+      dolfin_error("uBLASKrylovSolver.h",
+                   "solve linear system using uBLAS Krylov solver",
+                   "Non-matching dimensions for linear system");
+    }
+
+    // Reinitialise x if necessary
+    if (x.size() != b.size())
+    {
+      x.resize(b.mpi_comm(), b.local_range());
+      x.zero();
+    }
+
+    // Read parameters if not done
+    read_parameters();
+
+    // Write a message
+    if (report)
+      info("Solving linear system of size %d x %d (uBLAS Krylov solver).", M, N);
+
+    // Initialise preconditioner if necessary
+    _pc->init(P);
+
+    // Choose solver and solve
+    bool converged = false;
+    std::size_t iterations = 0;
+    if (_method == "cg")
+      iterations = solveCG(A, x, b, converged);
+    else if (_method == "gmres")
+      iterations = solveGMRES(A, x, b, converged);
+    else if (_method == "bicgstab")
+      iterations = solveBiCGStab(A, x, b, converged);
+    else if (_method == "default")
+      iterations = solveBiCGStab(A, x, b, converged);
+    else
+    {
+      dolfin_error("uBLASKrylovSolver.h",
+                   "solve linear system using uBLAS Krylov solver",
+                   "Requested Krylov method (\"%s\") is unknown", _method.c_str());
+    }
+
+    // Check for convergence
+    if (!converged)
+    {
+      bool error_on_nonconvergence = parameters["error_on_nonconvergence"];
+      if (error_on_nonconvergence)
+      {
+        dolfin_error("uBLASKrylovSolver.h",
+                     "solve linear system using uBLAS Krylov solver",
+                     "Solution failed to converge");
+      }
+      else
+        warning("uBLAS Krylov solver failed to converge.");
+    }
+    else if (report)
+      info("Krylov solver converged in %d iterations.", iterations);
+
+    return iterations;
+  }
+  //----------------------------------------------------------------------------
+  template<typename Mat>
+    std::size_t uBLASKrylovSolver::solveCG(const Mat& A,
+                                           uBLASVector& x,
+                                           const uBLASVector& b,
+                                           bool& converged) const
+  {
+    warning("Conjugate-gradient method not yet programmed for uBLASKrylovSolver. Using GMRES.");
+    return solveGMRES(A, x, b, converged);
+  }
+  //----------------------------------------------------------------------------
+  template<typename Mat>
+    std::size_t uBLASKrylovSolver::solveGMRES(const Mat& A, uBLASVector& x,
+                                              const uBLASVector& b,
+                                              bool& converged) const
+  {
+    // Get underlying uBLAS vectors
+    ublas_vector& _x = x.vec();
+    const ublas_vector& _b = b.vec();
+
+    // Get size of system
+    const std::size_t size = A.size(0);
+
+    // Create residual vector
+    uBLASVector r(size);
+    ublas_vector& _r = r.vec();
+
+    // Create H matrix and h vector
+    ublas_matrix_cmajor_tri H(restart, restart);
+    ublas_vector _h(restart+1);
+
+    // Create gamma vector
+    ublas_vector _gamma(restart + 1);
+
+    // Matrix containing v_k as columns.
+    ublas_matrix_cmajor V(size, restart + 1);
+
+    // w vector
+    uBLASVector w(size);
+    ublas_vector& _w = w.vec();
+
+    // Givens vectors
+    ublas_vector _c(restart), _s(restart);
+
+    // Miscellaneous storage
+    double nu, temp1, temp2, r_norm = 0.0, beta0 = 0;
+
+    converged = false;
+    std::size_t iteration = 0;
+    while (iteration < max_it && !converged)
+    {
+      // Compute residual r = b -A*x
+      //noalias(r) = b;
+      //axpy_prod(A, -x, r, false);
+      A.mult(x, r);
+      _r *= -1.0;
+      noalias(_r) += _b;
+
+      // Apply preconditioner (use w for temporary storage)
+      _w.assign(_r);
+      _pc->solve(r, w);
+
+      // L2 norm of residual (for most recent restart)
+      const double beta = norm_2(_r);
+
+     // Save intial residual (from restart 0)
+     if(iteration == 0)
+       beta0 = beta;
+
+     if(beta < atol)
+     {
+       converged = true;
+       return iteration;
+     }
+
+      // Intialise gamma
+      _gamma.clear();
+      _gamma(0) = beta;
+
+      // Create first column of V
+      noalias(column(V, 0)) = _r/beta;
+
+      // Modified Gram-Schmidt procedure
+      std::size_t subiteration = 0;
+      std::size_t j = 0;
+      while (subiteration < restart && iteration < max_it && !converged
+             && r_norm/beta < div_tol)
+      {
+        // Compute product w = A*V_j (use r for temporary storage)
+        //axpy_prod(A, column(V, j), w, true);
+        noalias(_r) = column(V, j);
+        A.mult(r, w);
+
+        // Apply preconditioner (use r for temporary storage)
+        _r.assign(_w);
+        _pc->solve(w, r);
+
+        for (std::size_t i=0; i <= j; ++i)
+        {
+          _h(i)= inner_prod(_w, column(V,i));
+          noalias(_w) -= _h(i)*column(V,i);
+        }
+        _h(j+1) = norm_2(_w);
+
+        // Insert column of V (inserting v_(j+1)
+        noalias(column(V,j+1)) = _w/_h(j+1);
+
+        // Apply previous Givens rotations to the "new" column (this
+        // could be improved? - use more uBLAS functions.  The below
+        // has been taken from old DOLFIN code.)
+        for(std::size_t i=0; i<j; ++i)
+        {
+          temp1 = _h(i);
+          temp2 = _h(i+1);
+          _h(i)   = _c(i)*temp1 - _s(i)*temp2;
+          _h(i+1) = _s(i)*temp1 + _c(i)*temp2 ;
+        }
+
+        // Compute new c_i and s_i
+        nu = sqrt( _h(j)*_h(j) + _h(j+1)*_h(j+1) );
+
+        // Direct access to c & s below leads to some strange compiler
+        // errors when using vector expressions and noalias(). By
+        // using "subrange", we are working with vector expressions
+        // rather than reals
+        //c(j) =  h(j)/nu;
+        //s(j) = -h(j+1)/nu;
+        subrange(_c, j,j+1) =  subrange(_h, j,j+1)/nu;
+        subrange(_s, j,j+1) = -subrange(_h, j+1,j+2)/nu;
+
+        // Apply new rotation to last column
+        _h(j)   = _c(j)*_h(j) - _s(j)*_h(j+1);
+        _h(j+1) = 0.0;
+
+        // Apply rotations to gamma
+        temp1 = _c(j)*_gamma(j) - _s(j)*_gamma(j+1);
+        _gamma(j+1) = _s(j)*_gamma(j) + _c(j)*_gamma(j+1);
+        _gamma(j) = temp1;
+        r_norm = fabs(_gamma(j+1));
+
+        // Add h to H matrix. Would ne nice to use
+        //   noalias(column(H, j)) = subrange(h, 0, restart);
+        // but this gives an error when uBLAS debugging is turned onand H
+        // is a triangular matrix
+        for(std::size_t i=0; i<j+1; ++i)
+          H(i,j) = _h(i);
+
+        // Check for convergence
+        if( r_norm/beta0 < rtol || r_norm < atol )
+          converged = true;
+
+        ++iteration;
+        ++subiteration;
+        ++j;
+      }
+
+      // Eliminate extra rows and columns (this does not resize or
+      // copy, just addresses a range)
+      ublas_matrix_cmajor_tri_range Htrunc(H, ublas::range(0,subiteration),
+                                           ublas::range(0,subiteration));
+      ublas_vector_range _g(_gamma, ublas::range(0,subiteration));
+
+      // Solve triangular system H*g and return result in g
+      ublas::inplace_solve(Htrunc, _g, ublas::upper_tag ());
+
+      // x_m = x_0 + V*y
+      ublas_matrix_cmajor_range _v( V, ublas::range(0,V.size1()),
+                                    ublas::range(0,subiteration) );
+      axpy_prod(_v, _g, _x, false);
+    }
+    return iteration;
+  }
+  //----------------------------------------------------------------------------
+  template<typename Mat>
+    std::size_t uBLASKrylovSolver::solveBiCGStab(const Mat& A,
+                                                 uBLASVector& x,
+                                                 const uBLASVector& b,
+                                                 bool& converged) const
+  {
+    // Get uderlying uBLAS vectors
+    ublas_vector& _x = x.vec();
+    const ublas_vector& _b = b.vec();
+
+   // Get size of system
+    const std::size_t size = A.size(0);
+
+    // Allocate vectors
+    uBLASVector r(size), rstar(size), p(size), s(size), v(size), t(size),
+      y(size), z(size);
+    ublas_vector& _r = r.vec();
+    ublas_vector& _rstar = rstar.vec();
+    ublas_vector& _p = p.vec();
+    ublas_vector& _s = s.vec();
+    ublas_vector& _v = v.vec();
+    ublas_vector& _t = t.vec();
+    ublas_vector& _y = y.vec();
+    ublas_vector& _z = z.vec();
+
+    double alpha = 1.0, beta = 0.0, omega = 1.0, r_norm = 0.0;
+    double rho_old = 1.0, rho = 1.0;
+
+    // Compute residual r = b -A*x
+    //r.assign(b);
+    //axpy_prod(A, -x, r, false);
+    A.mult(x, r);
+    r *= -1.0;
+    noalias(_r) += _b;
+
+    const double r0_norm = norm_2(_r);
+    if( r0_norm < atol )
+    {
+      converged = true;
+      return 0;
+    }
+
+    // Initialise r^star, v and p
+    _rstar.assign(_r);
+    _v.clear();
+    _p.clear();
+
+    // Apply preconditioner to r^start. This is a trick to avoid
+    // problems in which (r^start, r) = 0 after the first iteration
+    // (such as PDE's with homogeneous Neumann bc's and no
+    // forcing/source term.
+    _pc->solve(rstar, r);
+
+    // Right-preconditioned Bi-CGSTAB
+
+    // Start iterations
+    converged = false;
+    std::size_t iteration = 0;
+    while (iteration < max_it && !converged && r_norm/r0_norm < div_tol)
+    {
+      // Set rho_n = rho_n+1
+      rho_old = rho;
+
+      // Compute new rho
+      rho = ublas::inner_prod(_r, _rstar);
+      if( fabs(rho) < 1e-25 )
+      {
+        dolfin_error("uBLASKrylovSolver.h",
+                     "solve linear system using uBLAS BiCGStab solver",
+                     "Solution failed to converge, rho = %g", rho);
+      }
+
+      beta = (rho/rho_old)*(alpha/omega);
+
+      // p = r1 + beta*p - beta*omega*A*p
+      p *= beta;
+      noalias(_p) += _r - beta*omega*_v;
+
+      // My = p
+      _pc->solve(y, p);
+
+      // v = A*y
+      //axpy_prod(A, y, v, true);
+      A.mult(y, v);
+
+      // alpha = (r, rstart) / (v, rstar)
+      alpha = rho/ublas::inner_prod(_v, _rstar);
+
+      // s = r - alpha*v
+      noalias(_s) = _r - alpha*_v;
+
+      // Mz = s
+      _pc->solve(z, s);
+
+      // t = A*z
+      //axpy_prod(A, z, t, true);
+      A.mult(z, t);
+
+      // omega = (t, s) / (t,t)
+      omega = ublas::inner_prod(_t, _s)/ublas::inner_prod(_t, _t);
+
+      // x = x + alpha*p + omega*s
+      noalias(_x) += alpha*_y + omega*_z;
+
+      // r = s - omega*t
+      noalias(_r) = _s - omega*_t;
+
+      // Compute norm of the residual and check for convergence
+      r_norm = norm_2(_r);
+      if( r_norm/r0_norm < rtol || r_norm < atol)
+        converged = true;
+
+      ++iteration;
+    }
+
+    return iteration;
+  }
+  //----------------------------------------------------------------------------
+}
+
+#endif
diff --git a/dolfin/la/uBLASLinearOperator.cpp b/dolfin/la/uBLASLinearOperator.cpp
new file mode 100644
index 0000000..a98f7a6
--- /dev/null
+++ b/dolfin/la/uBLASLinearOperator.cpp
@@ -0,0 +1,82 @@
+// Copyright (C) 2006-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-07-07
+// Last changed: 2012-12-12
+
+#include "GenericVector.h"
+#include "uBLASLinearOperator.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+uBLASLinearOperator::uBLASLinearOperator() : _wrapper(0), M(0), N(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t uBLASLinearOperator::size(std::size_t dim) const
+{
+  if (dim == 0)
+    return M;
+  else if (dim == 1)
+    return N;
+  else
+  {
+    dolfin_error("uBLASLinearOperator.h",
+                 "return size of uBLASLinearOperator",
+                 "Illegal dimension (%d)", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+void uBLASLinearOperator::mult(const GenericVector& x, GenericVector& y) const
+{
+  dolfin_assert(_wrapper);
+  _wrapper->mult(x, y);
+}
+//-----------------------------------------------------------------------------
+std::string uBLASLinearOperator::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    warning("Verbose output for uBLASLinearOperator not implemented.");
+    s << str(false);
+  }
+  else
+  {
+    s << "<uBLASLinearOperator>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void uBLASLinearOperator::init_layout(const GenericVector& x,
+				      const GenericVector& y,
+				      GenericLinearOperator* wrapper)
+{
+  // Store dimensions
+  this->M = y.size();
+  this->N = x.size();
+
+  // Store wrapper
+  _wrapper = wrapper;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/uBLASLinearOperator.h b/dolfin/la/uBLASLinearOperator.h
new file mode 100644
index 0000000..751818e
--- /dev/null
+++ b/dolfin/la/uBLASLinearOperator.h
@@ -0,0 +1,73 @@
+// Copyright (C) 2006-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-06-30
+// Last changed: 2012-12-12
+
+#ifndef __UBLAS_LINEAR_OPERATOR_H
+#define __UBLAS_LINEAR_OPERATOR_H
+
+#include <string>
+#include <dolfin/common/types.h>
+#include "GenericLinearOperator.h"
+
+namespace dolfin
+{
+
+  class uBLASVector;
+
+  // This is the uBLAS version of the _GenericLinearOperator_
+  // (matrix-free) interface for the solution of linear systems
+  // defined in terms of the action (matrix-vector product) of a
+  // linear operator.
+
+  class uBLASLinearOperator : public GenericLinearOperator
+  {
+  public:
+
+    /// Constructor
+    uBLASLinearOperator();
+
+    //--- Implementation of the GenericLinearOperator interface ---
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const;
+
+    /// Compute matrix-vector product y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+  protected:
+
+    // Initialization
+    void init_layout(const GenericVector& x,
+		     const GenericVector& y,
+		     GenericLinearOperator* wrapper);
+
+    // Pointer to wrapper
+    GenericLinearOperator* _wrapper;
+
+    // Dimensions
+    std::size_t M, N;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/uBLASMatrix.h b/dolfin/la/uBLASMatrix.h
new file mode 100644
index 0000000..0451c21
--- /dev/null
+++ b/dolfin/la/uBLASMatrix.h
@@ -0,0 +1,758 @@
+// Copyright (C) 2006-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006-2012
+// Modified by Ola Skavhaug 2007-2008
+// Modified by Kent-Andre Mardal 2008
+// Modified by Martin Sandve Alnes 2008
+// Modified by Dag Lindbo 2008
+//
+// First added:  2006-07-05
+// Last changed: 2012-08-20
+
+#ifndef __UBLAS_MATRIX_H
+#define __UBLAS_MATRIX_H
+
+#include <sstream>
+#include <iomanip>
+#include <boost/tuple/tuple.hpp>
+
+#include <dolfin/common/Timer.h>
+#include "GenericMatrix.h"
+#include "SparsityPattern.h"
+#include "TensorLayout.h"
+#include "ublas.h"
+#include "uBLASFactory.h"
+#include "uBLASVector.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class uBLASVector;
+  template<typename T> class uBLASFactory;
+
+  namespace ublas = boost::numeric::ublas;
+
+  /// This class provides a simple matrix class based on uBLAS.
+  /// It is a simple wrapper for a uBLAS matrix implementing the
+  /// GenericMatrix interface.
+  ///
+  /// The interface is intentionally simple. For advanced usage,
+  /// access the underlying uBLAS matrix and use the standard
+  /// uBLAS interface which is documented at
+  /// http://www.boost.org/libs/numeric/ublas/doc/index.htm.
+  ///
+  /// Developer note: specialised member functions must be
+  /// inlined to avoid link errors.
+
+  template<typename Mat>
+  class uBLASMatrix : public GenericMatrix
+  {
+  public:
+
+    /// Create empty matrix
+    uBLASMatrix();
+
+    /// Create M x N matrix
+    uBLASMatrix(std::size_t M, std::size_t N);
+
+    /// Copy constructor
+    uBLASMatrix(const uBLASMatrix& A);
+
+    /// Create matrix from given uBLAS matrix expression
+    template <typename E>
+    explicit uBLASMatrix(const ublas::matrix_expression<E>& A) : Mat(A) {}
+
+    /// Destructor
+    virtual ~uBLASMatrix();
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Initialize zero tensor using tenor layout
+    virtual void init(const TensorLayout& tensor_layout);
+
+    /// Return true if empty
+    virtual bool empty() const
+    { return size(0) == 0; }
+
+    /// Return size of given dimension
+    virtual std::size_t size(std::size_t dim) const;
+
+    /// Return local ownership range
+    virtual std::pair<std::size_t, std::size_t>
+      local_range(std::size_t dim) const
+    { return std::make_pair(0, size(dim)); }
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero();
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode);
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const
+    { return MPI_COMM_SELF; }
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    //--- Implementation of the GenericMatrix interface ---
+
+    /// Return copy of matrix
+    virtual std::shared_ptr<GenericMatrix> copy() const;
+
+    /// Resize matrix to M x N
+    virtual void resize(std::size_t M, std::size_t N);
+
+    /// Intialixe vector z to be compatible with the matrix-vector product
+    /// y = Ax. In the parallel case, both size and layout are
+    /// important.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+    virtual void init_vector(GenericVector& z, std::size_t dim) const;
+
+    /// Get block of values
+    virtual void get(double* block, std::size_t m, const dolfin::la_index* rows,
+                     std::size_t n, const dolfin::la_index* cols) const;
+
+    /// Set block of values
+    virtual void set(const double* block, std::size_t m,
+                     const dolfin::la_index* rows, std::size_t n,
+                     const dolfin::la_index* cols);
+
+    /// Add block of values
+    virtual void add(const double* block, std::size_t m,
+                     const dolfin::la_index* rows, std::size_t n,
+                     const dolfin::la_index* cols);
+
+    /// Add multiple of given matrix (AXPY operation)
+    virtual void axpy(double a, const GenericMatrix& A,
+                      bool same_nonzero_pattern);
+
+    /// Return norm of matrix
+    virtual double norm(std::string norm_type) const;
+
+    /// Get non-zero values of given row
+    virtual void getrow(std::size_t row, std::vector<std::size_t>& columns,
+                        std::vector<double>& values) const;
+
+    /// Set values for given row
+    virtual void setrow(std::size_t row_idx,
+                        const std::vector<std::size_t>& columns,
+                        const std::vector<double>& values);
+
+    /// Set given rows to zero
+    virtual void zero(std::size_t m, const dolfin::la_index* rows);
+
+    /// Set given rows to identity matrix
+    virtual void ident(std::size_t m, const dolfin::la_index* rows);
+
+    /// Matrix-vector product, y = Ax
+    virtual void mult(const GenericVector& x, GenericVector& y) const;
+
+    /// Matrix-vector product, y = A^T x
+    virtual void transpmult(const GenericVector& x, GenericVector& y) const;
+
+    /// Set diagonal of a matrix
+    virtual void set_diagonal(const GenericVector& x);
+
+    /// Multiply matrix by given number
+    virtual const uBLASMatrix<Mat>& operator*= (double a);
+
+    /// Divide matrix by given number
+    virtual const uBLASMatrix<Mat>& operator/= (double a);
+
+    /// Assignment operator
+    virtual const GenericMatrix& operator= (const GenericMatrix& A);
+
+    /// Return pointers to underlying compresssed storage data
+    /// See GenericMatrix for documentation.
+    virtual boost::tuples::tuple<const std::size_t*, const std::size_t*,
+      const double*, int> data() const;
+
+    //--- Special functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const
+    { return uBLASFactory<Mat>::instance(); }
+
+    //--- Special uBLAS functions ---
+
+    /// Return reference to uBLAS matrix (const version)
+    const Mat& mat() const
+    { return _matA; }
+
+    /// Return reference to uBLAS matrix (non-const version)
+    Mat& mat()
+    { return _matA; }
+
+    /// Solve Ax = b out-of-place using uBLAS (A is not destroyed)
+    void solve(uBLASVector& x, const uBLASVector& b) const;
+
+    /// Solve Ax = b in-place using uBLAS(A is destroyed)
+    void solve_in_place(uBLASVector& x, const uBLASVector& b);
+
+    /// Compute inverse of matrix
+    void invert();
+
+    /// Lump matrix into vector m
+    void lump(uBLASVector& m) const;
+
+    /// Compress matrix (eliminate all non-zeros from a sparse matrix)
+    void compress();
+
+    /// Access value of given entry
+    double operator() (dolfin::la_index i, dolfin::la_index j) const
+    { return _matA(i, j); }
+
+    /// Assignment operator
+    const uBLASMatrix<Mat>& operator= (const uBLASMatrix<Mat>& A);
+
+  private:
+
+    // General uBLAS LU solver which accepts both vector and matrix
+    // right-hand sides
+    template<typename B>
+    void solve_in_place(B& X);
+
+    // uBLAS matrix object
+    Mat _matA;
+
+  };
+
+  //---------------------------------------------------------------------------
+  // Implementation of uBLASMatrix
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  uBLASMatrix<Mat>::uBLASMatrix() : GenericMatrix(), _matA(0, 0)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  uBLASMatrix<Mat>::uBLASMatrix(std::size_t M, std::size_t N)
+    : GenericMatrix(), _matA(M, N)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  uBLASMatrix<Mat>::uBLASMatrix(const uBLASMatrix& A)
+    : GenericMatrix(), _matA(A._matA)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  uBLASMatrix<Mat>::~uBLASMatrix()
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  std::shared_ptr<GenericMatrix> uBLASMatrix<Mat>::copy() const
+  {
+    std::shared_ptr<GenericMatrix> A(new uBLASMatrix<Mat>(*this));
+    return A;
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix< Mat >::resize(std::size_t M, std::size_t N)
+  {
+    // Resize matrix
+    if( size(0) != M || size(1) != N )
+      _matA.Mat::resize(M, N, false);
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  std::size_t uBLASMatrix<Mat>::size(std::size_t dim) const
+  {
+    if (dim > 1)
+    {
+      dolfin_error("uBLASMatrix.h",
+                   "access size of uBLAS matrix",
+                   "Illegal axis (%d), must be 0 or 1", dim);
+    }
+
+    dolfin_assert(dim < 2);
+    return (dim == 0 ? _matA.Mat::size1() : _matA.Mat::size2());
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  double uBLASMatrix<Mat>::norm(std::string norm_type) const
+  {
+    if (norm_type == "l1")
+      return norm_1(_matA);
+    else if (norm_type == "linf")
+      return norm_inf(_matA);
+    else if (norm_type == "frobenius")
+      return norm_frobenius(_matA);
+    else
+    {
+      dolfin_error("uBLASMatrix.h",
+                   "compute norm of uBLAS matrix",
+                   "Unknown norm type (\"%s\")",
+                   norm_type.c_str());
+      return 0.0;
+    }
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::getrow(std::size_t row_idx,
+                                std::vector<std::size_t>& columns,
+                                std::vector<double>& values) const
+  {
+    dolfin_assert(row_idx < this->size(0));
+
+    // Reference to matrix row
+    const ublas::matrix_row<const Mat> row(_matA, row_idx);
+
+    // Insert values into std::vectors
+    columns.clear();
+    values.clear();
+    typename ublas::matrix_row<const Mat>::const_iterator component;
+    for (component = row.begin(); component != row.end(); ++component)
+    {
+      columns.push_back(component.index());
+      values.push_back(*component );
+    }
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::setrow(std::size_t row_idx,
+                                const std::vector<std::size_t>& columns,
+                                const std::vector<double>& values)
+  {
+    dolfin_assert(columns.size() == values.size());
+    dolfin_assert(row_idx < this->size(0));
+
+    ublas::matrix_row<Mat> row(_matA, row_idx);
+    dolfin_assert(columns.size() <= row.size());
+
+    row *= 0;
+    for(std::size_t i = 0; i < columns.size(); i++)
+      row(columns[i])=values[i];
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::init_vector(GenericVector& z, std::size_t dim) const
+  {
+    z.init(mpi_comm(), size(dim));
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::set(const double* block, std::size_t m,
+                             const dolfin::la_index* rows,
+                             std::size_t n, const dolfin::la_index* cols)
+  {
+    for (std::size_t i = 0; i < m; i++)
+      for (std::size_t j = 0; j < n; j++)
+        _matA(rows[i] , cols[j]) = block[i*n + j];
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::add(const double* block, std::size_t m, const dolfin::la_index* rows,
+                             std::size_t n, const dolfin::la_index* cols)
+  {
+    for (std::size_t i = 0; i < m; i++)
+      for (std::size_t j = 0; j < n; j++)
+        _matA(rows[i] , cols[j]) += block[i*n + j];
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::get(double* block, std::size_t m,
+                             const dolfin::la_index* rows,
+                             std::size_t n, const dolfin::la_index* cols) const
+  {
+    for(std::size_t i = 0; i < m; ++i)
+      for(std::size_t j = 0; j < n; ++j)
+        block[i*n + j] = _matA(rows[i], cols[j]);
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::lump(uBLASVector& m) const
+  {
+    const std::size_t n = size(1);
+    m.init(mpi_comm(), n);
+    m.zero();
+    ublas::scalar_vector<double> one(n, 1.0);
+    ublas::axpy_prod(_matA, one, m.vec(), true);
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::solve(uBLASVector& x, const uBLASVector& b) const
+  {
+    // Make copy of matrix and vector
+    uBLASMatrix<Mat> Atemp;
+    Atemp.mat().resize(size(0), size(1));
+    Atemp.mat().assign(_matA);
+    x.vec().resize(b.vec().size());
+    x.vec().assign(b.vec());
+
+    // Solve
+    Atemp.solve_in_place(x.vec());
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::solve_in_place(uBLASVector& x, const uBLASVector& b)
+  {
+    const std::size_t M = _matA.size1();
+    dolfin_assert(M == b.size());
+
+    // Initialise solution vector
+    if( x.vec().size() != M )
+      x.vec().resize(M);
+    x.vec().assign(b.vec());
+
+    // Solve
+    solve_in_place(x.vec());
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::invert()
+  {
+    const std::size_t M = _matA.size1();
+    dolfin_assert(M == _matA.size2());
+
+    // Create indentity matrix
+    Mat X(M, M);
+    X.assign(ublas::identity_matrix<double>(M));
+
+    // Solve
+    solve_in_place(X);
+    _matA.assign_temporary(X);
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::zero()
+  {
+    // Iterate through no-zero pattern and zero entries
+    typename Mat::iterator1 row;    // Iterator over rows
+    typename Mat::iterator2 entry;  // Iterator over entries
+    for (row = _matA.begin1(); row != _matA.end1(); ++row)
+      for (entry = row.begin(); entry != row.end(); ++entry)
+        *entry = 0;
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::zero(std::size_t m, const dolfin::la_index* rows)
+  {
+    for(std::size_t i = 0; i < m; ++i)
+      ublas::row(_matA, rows[i]) *= 0.0;
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::ident(std::size_t m, const dolfin::la_index* rows)
+  {
+    // Copy row indices to a vector
+    std::vector<std::size_t> _rows(rows, rows + m);
+
+    std::size_t counter = 0;
+    bool diagonal_missing = true;
+    typename Mat::iterator1 row;    // Iterator over rows
+    typename Mat::iterator2 entry;  // Iterator over entries
+    for (row = _matA.begin1(); row != _matA.end1(); ++row)
+    {
+      entry = row.begin();
+      if (std::find(_rows.begin(), _rows.end(), entry.index1()) != _rows.end())
+      {
+        // Iterate over entries to zero and place one on the diagonal
+        for (entry = row.begin(); entry != row.end(); ++entry)
+        {
+          if (entry.index1() == entry.index2())
+          {
+            *entry = 1.0;
+            diagonal_missing = false;
+          }
+          else
+            *entry = 0.0;
+        }
+        if (diagonal_missing)
+          dolfin_error("uBLASMatrix.h",
+                       "set row(s) of matrix to identity",
+                       "Row %d does not contain diagonal entry",
+                       row.index1());
+        diagonal_missing = true;
+        ++ counter;
+      }
+      if (counter == _rows.size())
+        continue;
+    }
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::mult(const GenericVector& x, GenericVector& y) const
+  {
+    const uBLASVector& xx = as_type<const uBLASVector>(x);
+    uBLASVector& yy = as_type<uBLASVector>(y);
+
+    if (size(1) != xx.size())
+    {
+      dolfin_error("uBLASMatrix.h",
+                   "compute matrix-vector product with uBLAS matrix",
+                   "Non-matching dimensions for matrix-vector product");
+    }
+
+    // Resize RHS if empty
+    if (yy.empty())
+      init_vector(yy, 0);
+
+    if (size(0) != yy.size())
+    {
+      dolfin_error("uBLASMatrix.h",
+                   "compute matrix-vector product with uBLAS matrix",
+                   "Vector for matrix-vector result has wrong size");
+    }
+
+    ublas::axpy_prod(_matA, xx.vec(), yy.vec(), true);
+  }
+  //-----------------------------------------------------------------------------
+  template <class Mat>
+  void uBLASMatrix<Mat>::set_diagonal(const GenericVector& x)
+  {
+    if (size(1) != size(0) || size(0) != x.size())
+    {
+      dolfin_error("uBLASMatrix.h",
+                   "Set diagonal of a uBLAS Matrix",
+                   "Matrix and vector dimensions don't match");
+    }
+
+    const double* xx = x.down_cast<uBLASVector>().data();
+    typename Mat::iterator1 row;    // Iterator over rows
+    typename Mat::iterator2 entry;  // Iterator over entries
+
+    // FIXME: Cannot be a good way to do it for a dense matrices
+    for (row = _matA.begin1(); row != _matA.end1(); ++row)
+    {
+      for (entry = row.begin(); entry != row.end(); ++entry)
+      {
+	if (entry.index2() > entry.index1())
+	  break;
+	if (entry.index2() == entry.index1())
+	  *entry = xx[entry.index1()];
+      }
+    }
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  void uBLASMatrix<Mat>::transpmult(const GenericVector& x,
+                                    GenericVector& y) const
+  {
+    dolfin_error("uBLASMatrix.h",
+                 "compute transpose matrix-vector product",
+                 "Not supported by the uBLAS linear algebra backend");
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  const uBLASMatrix<Mat>& uBLASMatrix<Mat>::operator*= (double a)
+   {
+    _matA *= a;
+    return *this;
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  const uBLASMatrix<Mat>& uBLASMatrix<Mat>::operator/= (double a)
+  {
+    _matA /= a;
+    return *this;
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  const GenericMatrix& uBLASMatrix<Mat>::operator= (const GenericMatrix& A)
+  {
+    *this = as_type<const uBLASMatrix<Mat> >(A);
+    return *this;
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  inline const
+    uBLASMatrix<Mat>& uBLASMatrix<Mat>::operator= (const uBLASMatrix<Mat>& A)
+  {
+    // Check for self-assignment
+    if (this != &A)
+    {
+      // Assume uBLAS take care of deleting an existing Matrix
+      // using its assignment operator
+      _matA = A.mat();
+    }
+    return *this;
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  inline void uBLASMatrix<Mat>::compress()
+  {
+    Mat A_temp(this->size(0), this->size(1));
+    A_temp.assign(_matA);
+    _matA.swap(A_temp);
+  }
+  //----------------------------------------------------------------------------
+  template <typename Mat>
+  std::string uBLASMatrix<Mat>::str(bool verbose) const
+  {
+    typename Mat::const_iterator1 it1;  // Iterator over rows
+    typename Mat::const_iterator2 it2;  // Iterator over entries
+
+    std::stringstream s;
+
+    if (verbose)
+    {
+      s << str(false) << std::endl << std::endl;
+      for (it1 = _matA.begin1(); it1 != _matA.end1(); ++it1)
+      {
+        s << "|";
+        for (it2 = it1.begin(); it2 != it1.end(); ++it2)
+        {
+          std::stringstream entry;
+          entry << std::setiosflags(std::ios::scientific);
+          entry << std::setprecision(16);
+          entry << " (" << it2.index1() << ", " << it2.index2() << ", " << *it2 << ")";
+          s << entry.str();
+        }
+        s << " |" << std::endl;
+      }
+    }
+    else
+    {
+      s << "<uBLASMatrix of size " << size(0) << " x " << size(1) << ">";
+    }
+
+    return s.str();
+  }
+  //----------------------------------------------------------------------------
+  // Specialised member functions (must be inlined to avoid link errors)
+  //----------------------------------------------------------------------------
+  template <>
+  inline void
+    uBLASMatrix<ublas_sparse_matrix>::init(const TensorLayout& tensor_layout)
+  {
+    resize(tensor_layout.size(0), tensor_layout.size(1));
+    _matA.clear();
+
+    // Get sparsity pattern
+    dolfin_assert(tensor_layout.sparsity_pattern());
+    const SparsityPattern* pattern_pointer
+      = dynamic_cast<const SparsityPattern*>(tensor_layout.sparsity_pattern().get());
+    if (!pattern_pointer)
+    {
+      dolfin_error("uBLASMatrix.h",
+                   "initialize uBLAS matrix",
+                   "Cannot convert GenericSparsityPattern to concrete SparsityPattern type");
+    }
+
+    // Reserve space for non-zeroes and get non-zero pattern
+    _matA.reserve(pattern_pointer->num_nonzeros());
+    const std::vector<std::vector<std::size_t> > pattern
+      = pattern_pointer->diagonal_pattern(SparsityPattern::sorted);
+
+    // Add entries
+    std::vector<std::vector<std::size_t> >::const_iterator row;
+    Set<std::size_t>::const_iterator element;
+    for(row = pattern.begin(); row != pattern.end(); ++row)
+      for(element = row->begin(); element != row->end(); ++element)
+        _matA.push_back(row - pattern.begin(), *element, 0.0);
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  inline void uBLASMatrix<Mat>::init(const TensorLayout& tensor_layout)
+  {
+    resize(tensor_layout.size(0), tensor_layout.size(1));
+    _matA.clear();
+  }
+  //---------------------------------------------------------------------------
+  template <>
+  inline void uBLASMatrix<ublas_sparse_matrix>::apply(std::string mode)
+  {
+    Timer timer("Apply (matrix)");
+
+    // Make sure matrix assembly is complete
+    _matA.complete_index1_data();
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  inline void uBLASMatrix<Mat>::apply(std::string mode)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  inline void uBLASMatrix<Mat>::axpy(double a, const GenericMatrix& A,
+                                     bool same_nonzero_pattern)
+  {
+    // Check for same size
+    if (size(0) != A.size(0) or size(1) != A.size(1))
+    {
+      dolfin_error("uBLASMatrix.h",
+                   "perform axpy operation with uBLAS matrix",
+                   "Dimensions don't match");
+    }
+
+    _matA += (a)*(as_type<const uBLASMatrix>(A).mat());
+  }
+  //---------------------------------------------------------------------------
+  template <>
+  inline boost::tuples::tuple<const std::size_t*, const std::size_t*,
+                         const double*, int>
+    uBLASMatrix<ublas_sparse_matrix>::data() const
+  {
+    typedef boost::tuples::tuple<const std::size_t*, const std::size_t*,
+      const double*, int> tuple;
+    return tuple(&_matA.index1_data()[0], &_matA.index2_data()[0],
+                 &_matA.value_data()[0], _matA.nnz());
+  }
+  //---------------------------------------------------------------------------
+  template <typename Mat>
+  inline boost::tuples::tuple<const std::size_t*, const std::size_t*,
+    const double*, int> uBLASMatrix<Mat>::data() const
+  {
+    dolfin_error("uBLASMatrix.h",
+                 "return pointers to underlying matrix data",
+                 "Not implemented for this uBLAS matrix type");
+    return boost::tuples::tuple<const std::size_t*,
+                                const std::size_t*,
+                                const double*,
+                                int>(0, 0, 0, 0);
+  }
+  //---------------------------------------------------------------------------
+  template<typename Mat> template<typename B>
+  void uBLASMatrix<Mat>::solve_in_place(B& X)
+  {
+    const std::size_t M = _matA.size1();
+    dolfin_assert(M == _matA.size2());
+
+    // Create permutation matrix
+    ublas::permutation_matrix<std::size_t> pmatrix(M);
+
+    // Factorise (with pivoting)
+    std::size_t singular = ublas::lu_factorize(_matA, pmatrix);
+    if (singular > 0)
+    {
+      dolfin_error("uBLASMatrix.h",
+                   "solve in-place using uBLAS matrix",
+                   "Singularity detected in matrix factorization on row %u",
+                   singular - 1);
+    }
+
+    // Back substitute
+    ublas::lu_substitute(_matA, pmatrix, X);
+  }
+  //----------------------------------------------------------------------------
+}
+
+#endif
diff --git a/dolfin/la/uBLASPreconditioner.h b/dolfin/la/uBLASPreconditioner.h
new file mode 100644
index 0000000..4afa809
--- /dev/null
+++ b/dolfin/la/uBLASPreconditioner.h
@@ -0,0 +1,79 @@
+// Copyright (C) 2006-2009 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006-2011
+//
+// First added:  2006-06-23
+// Last changed: 2011-11-11
+
+#ifndef __UBLAS_PRECONDITIONER_H
+#define __UBLAS_PRECONDITIONER_H
+
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  class uBLASVector;
+  class uBLASLinearOperator;
+  template<typename Mat> class uBLASMatrix;
+
+  /// This class specifies the interface for preconditioners for the
+  /// uBLAS Krylov solver.
+
+  class uBLASPreconditioner
+  {
+  public:
+
+    /// Constructor
+    uBLASPreconditioner() {}
+
+    /// Destructor
+    virtual ~uBLASPreconditioner() {}
+
+    /// Initialise preconditioner (sparse matrix)
+    virtual void init(const uBLASMatrix<ublas_sparse_matrix>& P)
+    {
+      dolfin_error("uBLASPreconditioner",
+                   "initialize uBLAS preconditioner",
+                   "No init() function for preconditioner uBLASMatrix<ublas_sparse_matrix>");
+    }
+
+    /// Initialise preconditioner (dense matrix)
+    virtual void init(const uBLASMatrix<ublas_dense_matrix>& P)
+    {
+      dolfin_error("uBLASPreconditioner",
+                   "initialize uBLAS preconditioner",
+                   "No init() function for preconditioner uBLASMatrix<ublas_dense_matrix>");
+    }
+
+    /// Initialise preconditioner (virtual matrix)
+    virtual void init(const uBLASLinearOperator& P)
+    {
+      dolfin_error("uBLASPreconditioner",
+                   "initialize uBLAS preconditioner",
+                   "No init() function for preconditioner uBLASLinearOperator");
+    }
+
+    /// Solve linear system (M^-1)Ax = y
+    virtual void solve(uBLASVector& x, const uBLASVector& b) const = 0;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/uBLASSparseMatrix.h b/dolfin/la/uBLASSparseMatrix.h
new file mode 100644
index 0000000..e3f2366
--- /dev/null
+++ b/dolfin/la/uBLASSparseMatrix.h
@@ -0,0 +1,33 @@
+// Copyright (C) 2006 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-05-29
+// Last changed: 2006-07-05
+
+#ifndef __UBLAS_SPARSE_MATRIX_H
+#define __UBLAS_SPARSE_MATRIX_H
+
+#include "uBLASMatrix.h"
+
+namespace dolfin
+{
+
+  typedef uBLASMatrix<ublas_sparse_matrix> uBLASSparseMatrix;
+
+}
+
+#endif
diff --git a/dolfin/la/uBLASVector.cpp b/dolfin/la/uBLASVector.cpp
new file mode 100644
index 0000000..925dc04
--- /dev/null
+++ b/dolfin/la/uBLASVector.cpp
@@ -0,0 +1,414 @@
+// Copyright (C) 2006-2008 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006-2012
+// Modified by Kent-Andre Mardal 2008
+// Modified by Martin Sandve Alnes 2008
+//
+// First added:  2006-04-04
+// Last changed: 2012-03-15
+
+#include <algorithm>
+#include <iomanip>
+#include <iostream>
+#include <sstream>
+#include <boost/numeric/ublas/vector.hpp>
+#include <boost/numeric/ublas/vector_expression.hpp>
+#include <boost/unordered_set.hpp>
+
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/Array.h>
+#include "uBLASVector.h"
+#include "uBLASFactory.h"
+#include "GenericLinearAlgebraFactory.h"
+
+#ifdef HAS_PETSC
+#include "PETScVector.h"
+#endif
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+uBLASVector::uBLASVector() : _x(new ublas_vector(0))
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+uBLASVector::uBLASVector(std::size_t N)
+  : _x(new ublas_vector(N))
+{
+  // Set all entries to zero
+  _x->clear();
+}
+//-----------------------------------------------------------------------------
+uBLASVector::uBLASVector(const uBLASVector& x) : _x(new ublas_vector(*(x._x)))
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+uBLASVector::uBLASVector(std::shared_ptr<ublas_vector> x) : _x(x)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+uBLASVector::~uBLASVector()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<GenericVector> uBLASVector::copy() const
+{
+  std::shared_ptr<GenericVector> y(new uBLASVector(*this));
+  return y;
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::resize(MPI_Comm comm, std::size_t N)
+{
+  if (MPI::size(comm) > 1)
+  {
+    dolfin_error("uBLASVector.cpp",
+                 "resize uBLAS vector",
+                 "Distributed vectors not supported by uBLAS backend");
+  }
+
+  if (_x->size() == N)
+    return;
+  _x->resize(N, false);
+
+  // Set vector to zero
+  _x->clear();
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::resize(MPI_Comm comm,
+                         std::pair<std::size_t, std::size_t> range)
+{
+  if (MPI::size(comm) > 1)
+  {
+    dolfin_error("uBLASVector.cpp",
+                 "resize uBLAS vector",
+                 "Distributed vectors not supported by uBLAS backend");
+  }
+
+  resize(comm, range.second - range.first);
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::resize(MPI_Comm comm,
+                         std::pair<std::size_t, std::size_t> range,
+                         const std::vector<la_index>& ghost_indices)
+{
+  if (MPI::size(comm) > 1)
+  {
+    dolfin_error("uBLASVector.cpp",
+                 "resize uBLAS vector",
+                 "Distributed vectors not supported by uBLAS backend");
+  }
+
+  if (!ghost_indices.empty())
+  {
+    dolfin_error("uBLASVector.cpp",
+                 "resize uBLAS vector",
+                 "Distributed vectors not supported by uBLAS backend");
+  }
+
+  resize(comm, range.second - range.first);
+}
+//-----------------------------------------------------------------------------
+bool uBLASVector::empty() const
+{
+  return _x->empty();
+}
+//-----------------------------------------------------------------------------
+std::size_t uBLASVector::size() const
+{
+  return _x->size();
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t> uBLASVector::local_range() const
+{
+  return std::make_pair(0, size());
+}
+//-----------------------------------------------------------------------------
+bool uBLASVector::owns_index(std::size_t i) const
+{
+  if (i < size())
+    return true;
+  else
+    return false;
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::get_local(double* block, std::size_t m,
+                            const dolfin::la_index* rows) const
+{
+  for (std::size_t i = 0; i < m; i++)
+    block[i] = (*_x)(rows[i]);
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::get_local(std::vector<double>& values) const
+{
+  values.resize(size());
+  for (std::size_t i = 0; i < size(); i++)
+    values[i] = (*_x)(i);
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::set_local(const std::vector<double>& values)
+{
+  dolfin_assert(values.size() == size());
+  for (std::size_t i = 0; i < size(); i++)
+    (*_x)(i) = values[i];
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::add_local(const Array<double>& values)
+{
+  dolfin_assert(values.size() == size());
+  for (std::size_t i = 0; i < size(); i++)
+    (*_x)(i) += values[i];
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::gather(GenericVector& x,
+                         const std::vector<dolfin::la_index>& indices) const
+{
+  const std::size_t _size = indices.size();
+  dolfin_assert(this->size() >= _size);
+
+  if (x.empty())
+    x.init(mpi_comm(), _size);
+  ublas_vector& tmp = as_type<uBLASVector>(x).vec();
+  dolfin_assert(x.size(0) == _size);
+  for (std::size_t i = 0; i < _size; i++)
+    tmp(i) = (*_x)(indices[i]);
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::gather(std::vector<double>& x,
+                         const std::vector<dolfin::la_index>& indices) const
+{
+  const std::size_t _size = indices.size();
+  x.resize(_size);
+  dolfin_assert(x.size() == _size);
+  for (std::size_t i = 0; i < _size; i++)
+    x[i] = (*_x)(indices[i]);
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::gather_on_zero(std::vector<double>& x) const
+{
+  get_local(x);
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::set(const double* block, std::size_t m,
+                      const dolfin::la_index* rows)
+{
+  for (std::size_t i = 0; i < m; i++)
+    (*_x)(rows[i]) = block[i];
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::add(const double* block, std::size_t m,
+                      const dolfin::la_index* rows)
+{
+  for (std::size_t i = 0; i < m; i++)
+    (*_x)(rows[i]) += block[i];
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::apply(std::string mode)
+{
+  Timer timer("Apply (uBLAS vector)");
+
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::zero()
+{
+  _x->clear();
+}
+//-----------------------------------------------------------------------------
+double uBLASVector::norm(std::string norm_type) const
+{
+  if (norm_type == "l1")
+    return norm_1(*_x);
+  else if (norm_type == "l2")
+    return norm_2(*_x);
+  else if (norm_type == "linf")
+    return norm_inf(*_x);
+  else
+  {
+    dolfin_error("uBLASVector.cpp",
+                 "compute norm of uBLAS vector",
+                 "Unknown norm type (\"%s\")", norm_type.c_str());
+  }
+
+  return 0.0;
+}
+//-----------------------------------------------------------------------------
+double uBLASVector::min() const
+{
+  double value = *std::min_element(_x->begin(), _x->end());
+  return value;
+}
+//-----------------------------------------------------------------------------
+double uBLASVector::max() const
+{
+  double value = *std::max_element(_x->begin(), _x->end());
+  return value;
+}
+//-----------------------------------------------------------------------------
+double uBLASVector::sum() const
+{
+  return ublas::sum(*_x);
+}
+//-----------------------------------------------------------------------------
+double uBLASVector::sum(const Array<std::size_t>& rows) const
+{
+  boost::unordered_set<std::size_t> row_set;
+  double _sum = 0.0;
+  for (std::size_t i = 0; i < rows.size(); ++i)
+  {
+    const std::size_t index = rows[i];
+    dolfin_assert(index < size());
+    if (row_set.find(index) == row_set.end())
+    {
+      _sum += (*_x)[index];
+      row_set.insert(index);
+    }
+  }
+  return _sum;
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::axpy(double a, const GenericVector& y)
+{
+  if (size() != y.size())
+  {
+    dolfin_error("uBLASVector.cpp",
+                 "perform axpy operation with uBLAS vector",
+                 "Vectors are not of the same size");
+  }
+
+  (*_x) += a * as_type<const uBLASVector>(y).vec();
+}
+//-----------------------------------------------------------------------------
+void uBLASVector::abs()
+{
+  dolfin_assert(_x);
+  const std::size_t size = _x->size();
+  for (std::size_t i = 0; i < size; i++)
+    (*_x)[i] = std::abs((*_x)[i]);
+}
+//-----------------------------------------------------------------------------
+double uBLASVector::inner(const GenericVector& y) const
+{
+  return ublas::inner_prod(*_x, as_type<const uBLASVector>(y).vec());
+}
+//-----------------------------------------------------------------------------
+const GenericVector& uBLASVector::operator= (const GenericVector& v)
+{
+  *this = as_type<const uBLASVector>(v);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator= (const uBLASVector& v)
+{
+  if (size() != v.size())
+  {
+    dolfin_error("uBLASVector.cpp",
+                 "assign one vector to another",
+                 "Vectors must be of the same length when assigning. "
+                 "Consider using the copy constructor instead");
+  }
+
+  assert(_x);
+  *_x = v.vec();
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator= (double a)
+{
+  _x->ublas_vector::assign(ublas::scalar_vector<double> (_x->size(), a));
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator*= (const double a)
+{
+  (*_x) *= a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator*= (const GenericVector& y)
+{
+  *_x = ublas::element_prod(*_x, as_type<const uBLASVector>(y).vec());
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator/= (const double a)
+{
+  (*_x) /= a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator+= (const GenericVector& y)
+{
+  *_x += as_type<const uBLASVector>(y).vec();
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator+= (double a)
+{
+  boost::numeric::ublas::scalar_vector<double> _a(_x->size(), a);
+  *_x += _a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator-= (const GenericVector& y)
+{
+  *_x -= as_type<const uBLASVector>(y).vec();
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const uBLASVector& uBLASVector::operator-= (double a)
+{
+  boost::numeric::ublas::scalar_vector<double> _a(_x->size(), a);
+  *_x -= _a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+std::string uBLASVector::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    s << "[";
+    for (ublas_vector::const_iterator it = _x->begin(); it != _x->end(); ++it)
+    {
+      std::stringstream entry;
+      entry << std::setiosflags(std::ios::scientific);
+      entry << std::setprecision(16);
+      entry << *it << " ";
+      s << entry.str() << std::endl;
+    }
+    s << "]";
+  }
+  else
+    s << "<uBLASVector of size " << size() << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+GenericLinearAlgebraFactory& uBLASVector::factory() const
+{
+  return uBLASFactory<>::instance();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/la/uBLASVector.h b/dolfin/la/uBLASVector.h
new file mode 100644
index 0000000..79b17a9
--- /dev/null
+++ b/dolfin/la/uBLASVector.h
@@ -0,0 +1,290 @@
+// Copyright (C) 2006-2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2006-2010.
+// Modified by Kent-Andre Mardal, 2008.
+// Modified by Ola Skavhaug, 2008.
+// Modified by Martin Alnæs, 2008.
+//
+// First added:  2006-03-04
+// Last changed: 2011-01-14
+
+#ifndef __UBLAS_VECTOR_H
+#define __UBLAS_VECTOR_H
+
+#include <string>
+#include <utility>
+#include <vector>
+#include <memory>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/types.h>
+#include "ublas.h"
+#include "GenericVector.h"
+
+namespace dolfin
+{
+
+  namespace ublas = boost::numeric::ublas;
+
+  template<typename T> class Array;
+
+  /// This class provides a simple vector class based on uBLAS.
+  /// It is a simple wrapper for a uBLAS vector implementing the
+  /// GenericVector interface.
+  ///
+  /// The interface is intentionally simple. For advanced usage,
+  /// access the underlying uBLAS vector and use the standard
+  /// uBLAS interface which is documented at
+  /// http://www.boost.org/libs/numeric/ublas/doc/index.htm.
+
+  class uBLASVector : public GenericVector
+  {
+  public:
+
+    /// Create empty vector
+    uBLASVector();
+
+    /// Create vector of size N
+    uBLASVector(std::size_t N);
+
+    /// Copy constructor
+    uBLASVector(const uBLASVector& x);
+
+    /// Construct vector from a ublas_vector
+    explicit uBLASVector(std::shared_ptr<ublas_vector> x);
+
+    /// Destructor
+    virtual ~uBLASVector();
+
+    //--- Implementation of the GenericTensor interface ---
+
+    /// Set all entries to zero and keep any sparse structure
+    virtual void zero();
+
+    /// Finalize assembly of tensor
+    virtual void apply(std::string mode);
+
+    /// Return MPI communicator
+    virtual MPI_Comm mpi_comm() const
+    { return MPI_COMM_SELF; }
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+    //--- Implementation of the GenericVector interface ---
+
+    /// Create copy of tensor
+    virtual std::shared_ptr<GenericVector> copy() const;
+
+    /// Resize vector to size N
+    virtual void init(MPI_Comm comm, std::size_t N)
+    {
+      if (!empty())
+      {
+        dolfin_error("uBLASVector.cpp",
+                     "calling uBLASVector::init(...)",
+                     "Cannot call init for a non-empty vector. Use uBlASVector::resize instead");
+      }
+      resize(comm, N);
+    }
+
+    /// Resize vector with given ownership range
+    virtual void init(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range)
+    {
+      if (!empty())
+      {
+        dolfin_error("uBLASVector.cpp",
+                     "calling uBLASVector::init(...)",
+                     "Cannot call init for a non-empty vector. Use uBlASVector::resize instead");
+      }
+      resize(comm, range);
+    }
+
+    /// Resize vector with given ownership range and with ghost values
+    virtual void init(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range,
+                        const std::vector<la_index>& ghost_indices)
+    {
+      if (!empty())
+      {
+        dolfin_error("uBLASVector.cpp",
+                     "calling uBLASVector::init(...)",
+                     "Cannot call init for a non-empty vector. Use uBlASVector::resize instead");
+      }
+      resize(comm, range, ghost_indices);
+    }
+
+    // Bring init function from GenericVector into scope
+    using GenericVector::init;
+
+    /// Resize vector to size N
+    virtual void resize(MPI_Comm comm, std::size_t N);
+
+    /// Resize vector with given ownership range
+    virtual void resize(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range);
+
+    /// Resize vector with given ownership range and with ghost values
+    virtual void resize(MPI_Comm comm,
+                        std::pair<std::size_t, std::size_t> range,
+                        const std::vector<la_index>& ghost_indices);
+
+    /// Return true if vector is empty
+    virtual bool empty() const;
+
+    /// Return true if vector is empty
+    virtual std::size_t size() const;
+
+    /// Return local size of vector
+    virtual std::size_t local_size() const
+    { return size(); }
+
+    /// Return local ownership range of a vector
+    virtual std::pair<std::size_t, std::size_t> local_range() const;
+
+    /// Determine whether global vector index is owned by this process
+    virtual bool owns_index(std::size_t i) const;
+
+    /// Get block of values
+    virtual void get_local(double* block, std::size_t m,
+                           const dolfin::la_index* rows) const;
+
+    /// Set block of values
+    virtual void set(const double* block, std::size_t m,
+                     const dolfin::la_index* rows);
+
+    /// Add block of values
+    virtual void add(const double* block, std::size_t m,
+                     const dolfin::la_index* rows);
+
+    /// Get all values on local process
+    virtual void get_local(std::vector<double>& values) const;
+
+    /// Set all values on local process
+    virtual void set_local(const std::vector<double>& values);
+
+    /// Add values to each entry on local process
+    virtual void add_local(const Array<double>& values);
+
+    /// Gather entries into local vector x
+    virtual void gather(GenericVector& x,
+                        const std::vector<dolfin::la_index>& indices) const;
+
+    /// Gather entries into x
+    virtual void gather(std::vector<double>& x,
+                        const std::vector<dolfin::la_index>& indices) const;
+
+    /// Gather all entries into x on process 0
+    virtual void gather_on_zero(std::vector<double>& x) const;
+
+    /// Add multiple of given vector (AXPY operation)
+    virtual void axpy(double a, const GenericVector& x);
+
+    /// Replace all entries in the vector by their absolute values
+    virtual void abs();
+
+    /// Return inner product with given vector
+    virtual double inner(const GenericVector& x) const;
+
+    /// Compute norm of vector
+    virtual double norm(std::string norm_type) const;
+
+    /// Return minimum value of vector
+    virtual double min() const;
+
+    /// Return maximum value of vector
+    virtual double max() const;
+
+    /// Return sum of values of vector
+    virtual double sum() const;
+
+    /// Return sum of selected rows in vector. Repeated entries are
+    /// only summed once.
+    virtual double sum(const Array<std::size_t>& rows) const;
+
+    /// Multiply vector by given number
+    virtual const uBLASVector& operator*= (double a);
+
+    /// Multiply vector by another vector pointwise
+    virtual const uBLASVector& operator*= (const GenericVector& x);
+
+    /// Divide vector by given number
+    virtual const uBLASVector& operator/= (double a);
+
+    /// Add given vector
+    virtual const uBLASVector& operator+= (const GenericVector& x);
+
+    /// Add number to all components of a vector
+    virtual const uBLASVector& operator+= (double a);
+
+    /// Subtract given vector
+    virtual const uBLASVector& operator-= (const GenericVector& x);
+
+    /// Subtract number from all components of a vector
+    virtual const uBLASVector& operator-= (double a);
+
+    /// Assignment operator
+    virtual const GenericVector& operator= (const GenericVector& x);
+
+    /// Assignment operator
+    virtual const uBLASVector& operator= (double a);
+
+    /// Return pointer to underlying data (const version)
+    virtual const double* data() const
+    { return &_x->data()[0]; }
+
+    /// Return pointer to underlying data
+    virtual double* data()
+    { return &_x->data()[0]; }
+
+    //--- Special functions ---
+
+    /// Return linear algebra backend factory
+    virtual GenericLinearAlgebraFactory& factory() const;
+
+    //--- Special uBLAS functions ---
+
+    /// Return reference to uBLAS vector (const version)
+    const ublas_vector& vec() const
+    { return *_x; }
+
+    /// Return reference to uBLAS vector (non-const version)
+    ublas_vector& vec()
+    { return *_x; }
+
+    /// Access value of given entry (const version)
+    virtual double operator[] (dolfin::la_index i) const
+    { return (*_x)(i); }
+
+    /// Access value of given entry (non-const version)
+    double& operator[] (dolfin::la_index i)
+    { return (*_x)(i); }
+
+    /// Assignment operator
+    const uBLASVector& operator= (const uBLASVector& x);
+
+  private:
+
+    // Smart pointer to uBLAS vector object
+    std::shared_ptr<ublas_vector> _x;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/la/ublas.h b/dolfin/la/ublas.h
new file mode 100644
index 0000000..930b74d
--- /dev/null
+++ b/dolfin/la/ublas.h
@@ -0,0 +1,77 @@
+// Copyright (C) 2006-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-
+// Last changed: 2011-12-04
+
+#ifndef __DOLFIN_UBLAS_H
+#define __DOLFIN_UBLAS_H
+
+#include <boost/numeric/ublas/matrix.hpp>
+#include <boost/numeric/ublas/vector.hpp>
+//#include <boost/numeric/ublas/vector_of_vector.hpp>
+#include <boost/numeric/ublas/matrix_sparse.hpp>
+
+// These two files must be included due to a bug in Boost version < 1.33.
+#include <boost/numeric/ublas/vector_proxy.hpp>
+#include <boost/numeric/ublas/triangular.hpp>
+#include <boost/numeric/ublas/operation.hpp>
+
+#include <boost/numeric/ublas/lu.hpp>
+#include <boost/numeric/ublas/io.hpp>
+
+
+namespace dolfin
+{
+  /// Various typedefs for uBLAS data types
+
+  namespace ublas = boost::numeric::ublas;
+
+  // uBLAS vector
+  typedef ublas::vector<double> ublas_vector;
+  typedef ublas::vector_range<ublas_vector> ublas_vector_range;
+
+  // uBLAS dense matrix
+  typedef ublas::matrix<double> ublas_dense_matrix;
+  typedef ublas::matrix_range<ublas_dense_matrix> ublas_matrix_range;
+
+  // uBLAS dense matrix (column major format)
+  typedef ublas::matrix<double, ublas::column_major> ublas_matrix_cmajor;
+  typedef ublas::matrix_range<ublas_matrix_cmajor> ublas_matrix_cmajor_range;
+
+  // uBLAS sparse matrix
+  typedef ublas::compressed_matrix<double, ublas::row_major> ublas_sparse_matrix;
+
+  // uBLAS sparse matrix (column major format)
+  typedef ublas::compressed_matrix<double, ublas::column_major> ublas_sparse_matrix_cmajor;
+
+  // uBLAS sparse matrix for temporary assembly
+  typedef ublas::generalized_vector_of_vector<double, ublas::row_major,
+            ublas::vector<ublas::compressed_vector<double> > > ublas_assembly_matrix;
+
+  // uBLAS sparse matrix for temporary assembly (column major format)
+  typedef ublas::generalized_vector_of_vector<double, ublas::column_major,
+            ublas::vector<ublas::compressed_vector<double> > > ublas_assembly_matrix_cmajor;
+
+  // uBLAS upper triangular matrix (column major format)
+  typedef ublas::triangular_matrix<double, ublas::upper, ublas::column_major> ublas_matrix_cmajor_tri;
+  typedef ublas::matrix_range<ublas_matrix_cmajor_tri> ublas_matrix_cmajor_tri_range;
+  typedef ublas::matrix_column<ublas_matrix_cmajor_tri> ublas_matrix_cmajor_tri_column;
+
+}
+
+#endif
diff --git a/dolfin/log/Event.cpp b/dolfin/log/Event.cpp
new file mode 100644
index 0000000..55da139
--- /dev/null
+++ b/dolfin/log/Event.cpp
@@ -0,0 +1,58 @@
+// Copyright (C) 2004-2005 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2004-01-03
+// Last changed: 2005
+
+#include "log.h"
+#include "Event.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Event::Event(const std::string msg, unsigned int maxcount) :
+  _msg(msg), _maxcount(maxcount), _count(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Event::~Event()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void Event::operator() ()
+{
+  if ( _count < _maxcount)
+    info(_msg);
+
+  _count++;
+
+  if ( _count == _maxcount && _maxcount > 1 )
+    info("Last message repeated %d times. Not displaying again.", _count);
+}
+//-----------------------------------------------------------------------------
+unsigned int Event::count() const
+{
+  return _count;
+}
+//-----------------------------------------------------------------------------
+unsigned int Event::maxcount() const
+{
+  return _maxcount;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/log/Event.h b/dolfin/log/Event.h
new file mode 100644
index 0000000..8e89dd0
--- /dev/null
+++ b/dolfin/log/Event.h
@@ -0,0 +1,75 @@
+// Copyright (C) 2004-2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2004-01-03
+// Last changed: 2007-05-14
+
+#ifndef __EVENT_H
+#define __EVENT_H
+
+#include <string>
+
+namespace dolfin
+{
+
+  /// A event is a string message which is displayed
+  /// only a limited number of times.
+  ///
+  /// *Example*
+  ///     .. code-block:: c++
+  ///
+  ///         Event event("System is stiff, damping is needed.");
+  ///         while ()
+  ///         {
+  ///           ...
+  ///           if ( ... )
+  ///           {
+  ///             event();
+  ///             ...
+  ///           }
+  ///         }
+
+  class Event
+  {
+  public:
+
+    /// Constructor
+    Event(const std::string msg, unsigned int maxcount = 1);
+
+    /// Destructor
+    ~Event();
+
+    /// Display message
+    void operator() ();
+
+    /// Display count
+    unsigned int count() const;
+
+    /// Maximum display count
+    unsigned int maxcount() const;
+
+  private:
+
+    std::string _msg;
+    unsigned int _maxcount;
+    unsigned int _count;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/log/LogLevel.h b/dolfin/log/LogLevel.h
new file mode 100644
index 0000000..f3bf62a
--- /dev/null
+++ b/dolfin/log/LogLevel.h
@@ -0,0 +1,21 @@
+#ifndef __LOGLEVEL_H
+#define __LOGLEVEL_H
+
+namespace dolfin
+{
+  // These log levels match the levels in the Python 'logging' module
+  // (and adds trace/progress).
+
+  enum LogLevel
+  {
+    CRITICAL  = 50, // errors that may lead to data corruption and suchlike
+    ERROR     = 40, // things that go boom
+    WARNING   = 30, // things that may go boom later
+    INFO      = 20, // information of general interest
+    PROGRESS  = 16, // what's happening (broadly)
+    TRACE     = 13, // what's happening (in detail)
+    DBG       = 10  // sundry
+  };
+}
+
+#endif
diff --git a/dolfin/log/LogManager.cpp b/dolfin/log/LogManager.cpp
new file mode 100644
index 0000000..9e441c7
--- /dev/null
+++ b/dolfin/log/LogManager.cpp
@@ -0,0 +1,24 @@
+// Copyright (C) 2003-2005 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2003-03-13
+// Last changed: 2005
+
+#include "LogManager.h"
+
+// Initialise static data
+dolfin::Logger dolfin::LogManager::logger;
diff --git a/dolfin/log/LogManager.h b/dolfin/log/LogManager.h
new file mode 100644
index 0000000..d86b129
--- /dev/null
+++ b/dolfin/log/LogManager.h
@@ -0,0 +1,50 @@
+// Copyright (C) 2003-2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Thanks to Jim Tilander for many helpful hints.
+//
+// First added:  2003-03-13
+// Last changed: 2007-05-11
+
+#ifndef __LOG_MANAGER_H
+#define __LOG_MANAGER_H
+
+#include "Logger.h"
+
+namespace dolfin
+{
+
+  /* FIXME: logging in destructors may fail at exit because the logger instance
+     may already be destroyed ("static initialization order fiasco"). The same
+     may happen at startup, if logging from constructors of static objects. The
+     logger instance should be converted to a heap-allocated (and never
+     deleted) object, with an accessor function. Like in SubSystemsManager, but
+     maybe with a static pointer rather than a static object in the accessor
+     function. */
+
+  class LogManager
+  {
+  public:
+
+    // Singleton instance of logger
+    static Logger logger;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/log/LogStream.cpp b/dolfin/log/LogStream.cpp
new file mode 100644
index 0000000..49a443e
--- /dev/null
+++ b/dolfin/log/LogStream.cpp
@@ -0,0 +1,129 @@
+// Copyright (C) 2003-2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2009.
+//
+// First added:  2003-03-13
+// Last changed: 2009-09-08
+
+#include <dolfin/common/constants.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEntity.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include "log.h"
+#include "LogStream.h"
+
+using namespace dolfin;
+
+// Definition of the global dolfin::cout and dolfin::endl variables
+LogStream dolfin::cout(LogStream::COUT);
+LogStream dolfin::endl(LogStream::ENDL);
+
+//-----------------------------------------------------------------------------
+LogStream::LogStream(Type type) : _type(type)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+LogStream::~LogStream()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (const LogStream& stream)
+{
+  if (stream._type == ENDL)
+  {
+    // Send buffer to log system
+    info(buffer.str());
+
+    // Reset buffer
+    buffer.str("");
+  }
+  else
+    buffer << stream.buffer.str();
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (const std::string& s)
+{
+  buffer << s;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (int a)
+{
+  buffer << a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (unsigned int a)
+{
+  buffer << a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (long int a)
+{
+  buffer << a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (long unsigned int a)
+{
+  buffer << a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (double a)
+{
+  buffer << a;
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (std::complex<double> z)
+{
+  buffer << z.real() << " + " << z.imag() << "i";
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (const Variable& variable)
+{
+  buffer << variable.str(false);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (const MeshEntity& entity)
+{
+  buffer << entity.str(false);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+LogStream& LogStream::operator<< (const Point& point)
+{
+  buffer << point.str(false);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+void LogStream::setprecision(std::streamsize n)
+{
+  buffer.precision(n);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/log/LogStream.h b/dolfin/log/LogStream.h
new file mode 100644
index 0000000..1c08d83
--- /dev/null
+++ b/dolfin/log/LogStream.h
@@ -0,0 +1,108 @@
+// Copyright (C) 2003-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2005.
+//
+// First added:  2003-03-13
+// Last changed: 2009-08-11
+
+#ifndef __LOG_STREAM_H
+#define __LOG_STREAM_H
+
+#include <complex>
+#include <string>
+#include <sstream>
+
+namespace dolfin
+{
+
+  class Variable;
+  class MeshEntity;
+  class MeshEntityIterator;
+  class Point;
+
+  /// This class provides functionality similar to standard C++
+  /// streams (std::cout, std::endl) for output but working through
+  /// the DOLFIN log system.
+
+  class LogStream
+  {
+  public:
+
+    /// Stream types
+    enum Type {COUT, ENDL};
+
+    /// Create log stream of given type
+    LogStream(Type type);
+
+    /// Destructor
+    ~LogStream();
+
+    /// Output for log stream
+    LogStream& operator<< (const LogStream& stream);
+
+    /// Output for string
+    LogStream& operator<< (const std::string& s);
+
+    /// Output for int
+    LogStream& operator<< (int a);
+
+    /// Output for unsigned int
+    LogStream& operator<< (unsigned int a);
+
+    /// Output for long int
+    LogStream& operator<< (long int a);
+
+    /// Output for long int
+    LogStream& operator<< (long unsigned int a);
+
+    /// Output for double
+    LogStream& operator<< (double a);
+
+    /// Output for std::complex<double>
+    LogStream& operator<< (std::complex<double> z);
+
+    /// Output for variable (calling str() method)
+    LogStream& operator<< (const Variable& variable);
+
+    /// Output for mesh entity (not subclass of Variable for efficiency)
+    LogStream& operator<< (const MeshEntity& entity);
+
+    /// Output for point (not subclass of Variable for efficiency)
+    LogStream& operator<< (const Point& point);
+
+    void setprecision(std::streamsize n);
+
+  private:
+
+    // Type of stream
+    Type _type;
+
+    // Buffer
+    std::stringstream buffer;
+
+  };
+
+  /// dolfin::cout
+  extern LogStream cout;
+
+  /// dolfin::endl;
+  extern LogStream endl;
+
+}
+
+#endif
diff --git a/dolfin/log/Logger.cpp b/dolfin/log/Logger.cpp
new file mode 100644
index 0000000..89647e5
--- /dev/null
+++ b/dolfin/log/Logger.cpp
@@ -0,0 +1,437 @@
+// Copyright (C) 2003-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug, 2007, 2009.
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2003-03-13
+// Last changed: 2013-11-15
+
+
+#include <fstream>
+#include <iomanip>
+#include <iostream>
+#include <sstream>
+#include <stdexcept>
+#include <string>
+#include <unistd.h>
+
+#include <boost/bind.hpp>
+#include <boost/date_time/posix_time/posix_time.hpp>
+#include <boost/thread.hpp>
+#include <boost/lexical_cast.hpp>
+
+#ifdef __linux__
+#include <sys/types.h>
+#include <unistd.h>
+#endif
+
+#include <dolfin/common/constants.h>
+#include <dolfin/common/defines.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include "LogLevel.h"
+#include "Logger.h"
+
+using namespace dolfin;
+
+typedef std::map<std::string, std::pair<std::size_t, double> >::iterator
+map_iterator;
+typedef std::map<std::string, std::pair<std::size_t, double> >::const_iterator
+const_map_iterator;
+
+// Function for monitoring memory usage, called by thread
+#ifdef __linux__
+void _monitor_memory_usage(dolfin::Logger* logger)
+{
+  assert(logger);
+
+  // Open statm
+  //std::fstream
+
+  // Get process ID and page size
+  const std::size_t pid = getpid();
+  const size_t page_size = getpagesize();
+
+  // Print some info
+  std::stringstream s;
+  s << "Initializing memory monitor for process " << pid << ".";
+  logger->log(s.str());
+
+  // Prepare statm file
+  std::stringstream filename;
+  filename << "/proc/" << pid << "/statm";
+  std::ifstream statm;
+
+  // Enter loop
+  while (true)
+  {
+    // Sleep for a while
+    boost::this_thread::sleep(boost::posix_time::seconds(1));
+
+    // Read number of pages from statm
+    statm.open(filename.str().c_str());
+    if (!statm)
+      logger->error("Unable to open statm file for process.");
+    size_t num_pages;
+    statm >> num_pages;
+    statm.close();
+
+    // Convert to MB and report memory usage
+    const size_t num_mb = num_pages*page_size / (1024*1024);
+    logger->_report_memory_usage(num_mb);
+  }
+}
+#endif
+
+//-----------------------------------------------------------------------------
+Logger::Logger() : _active(true), _log_level(INFO), indentation_level(0),
+                   logstream(&std::cout), _maximum_memory_usage(-1)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Logger::~Logger()
+{
+  // Join memory monitor thread if it exists
+  if (_thread_monitor_memory_usage)
+    _thread_monitor_memory_usage->join();
+}
+//-----------------------------------------------------------------------------
+void Logger::log(std::string msg, int log_level) const
+{
+  write(log_level, msg, -1);
+}
+//-----------------------------------------------------------------------------
+void Logger::log_underline(std::string msg, int log_level) const
+{
+  if (msg.empty())
+    log(msg, log_level);
+
+  std::stringstream s;
+  s << msg;
+  s << "\n";
+  for (int i = 0; i < indentation_level; i++)
+    s << "  ";
+  for (std::size_t i = 0; i < msg.size(); i++)
+    s << "-";
+
+  log(s.str(), log_level);
+}
+//-----------------------------------------------------------------------------
+void Logger::warning(std::string msg) const
+{
+  std::string s = std::string("*** Warning: ") + msg;
+  write(WARNING, s, -1);
+}
+//-----------------------------------------------------------------------------
+void Logger::error(std::string msg) const
+{
+  std::string s = std::string("*** Error: ") + msg;
+  throw std::runtime_error(s);
+}
+//-----------------------------------------------------------------------------
+void Logger::dolfin_error(std::string location,
+                          std::string task,
+                          std::string reason,
+                          int mpi_rank) const
+{
+  std::string _mpi_rank = boost::lexical_cast<std::string>(mpi_rank);
+  if (mpi_rank < 0)
+    _mpi_rank = "unknown";
+
+  std::stringstream s;
+  s << std::endl << std::endl
+    << "*** "
+    << "-------------------------------------------------------------------------"
+    << std::endl
+    << "*** DOLFIN encountered an error. If you are not able to resolve this issue"
+    << std::endl
+    << "*** using the information listed below, you can ask for help at"
+    << std::endl
+    << "***" << std::endl
+    << "***     fenics@fenicsproject.org"
+    << std::endl
+    << "***" << std::endl
+    << "*** Remember to include the error message listed below and, if possible,"
+    << std::endl
+    << "*** include a *minimal* running example to reproduce the error."
+    << std::endl
+    << "***" << std::endl
+    << "*** "
+    << "-------------------------------------------------------------------------"
+    << std::endl
+    << "*** " << "Error:   Unable to " << task << "." << std::endl
+    << "*** " << "Reason:  " << reason << "." << std::endl
+    << "*** " << "Where:   This error was encountered inside " << location << "."
+    << std::endl
+    << "*** " << "Process: " << _mpi_rank << std::endl
+    << "*** " << std::endl
+    << "*** " << "DOLFIN version: " << dolfin_version()  << std::endl
+    << "*** " << "Git changeset:  " << git_commit_hash() << std::endl
+    << "*** "
+    << "-------------------------------------------------------------------------"
+    << std::endl;
+
+  throw std::runtime_error(s.str());
+}
+//-----------------------------------------------------------------------------
+void Logger::deprecation(std::string feature,
+                         std::string version_deprecated,
+                         std::string version_remove,
+                         std::string message) const
+{
+  std::stringstream s;
+  s << "*** "
+    << "-------------------------------------------------------------------------"
+    << std::endl
+    << "*** Warning: " << feature << " has been deprecated in DOLFIN version "
+    << version_deprecated << "." << std::endl
+    << "*** It will be removed from version " << version_remove << "."
+    << std::endl
+    << "*** " << message << std::endl
+    << "*** "
+    << "-------------------------------------------------------------------------"
+    << std::endl;
+
+  #ifdef DOLFIN_DEPRECATION_ERROR
+  error(s.str());
+  #else
+  write(WARNING, s.str(), -1);
+  #endif
+}
+//-----------------------------------------------------------------------------
+void Logger::begin(std::string msg, int log_level)
+{
+  // Write a message
+  log(msg, log_level);
+  indentation_level++;
+}
+//-----------------------------------------------------------------------------
+void Logger::end()
+{
+  indentation_level--;
+}
+//-----------------------------------------------------------------------------
+void Logger::progress(std::string title, double p) const
+{
+  std::stringstream line;
+  line << title << " [";
+
+  const int N = DOLFIN_TERM_WIDTH - title.size() - 12 - 2*indentation_level;
+  const int n = static_cast<int>(p*static_cast<double>(N));
+
+  for (int i = 0; i < n; i++)
+    line << '=';
+  if (n < N)
+    line << '>';
+  for (int i = n+1; i < N; i++)
+    line << ' ';
+
+  line << std::setiosflags(std::ios::fixed);
+  line << std::setprecision(1);
+  line << "] " << 100.0*p << '%';
+
+  write(PROGRESS, line.str(), -1);
+}
+//-----------------------------------------------------------------------------
+void Logger::set_output_stream(std::ostream& ostream)
+{
+  logstream = &ostream;
+}
+//-----------------------------------------------------------------------------
+void Logger::set_log_active(bool active)
+{
+  _active = active;
+}
+//-----------------------------------------------------------------------------
+void Logger::set_log_level(int log_level)
+{
+  _log_level = log_level;
+}
+//-----------------------------------------------------------------------------
+void Logger::register_timing(std::string task, double elapsed_time)
+{
+  // Remove small or negative numbers
+  if (elapsed_time < DOLFIN_EPS)
+    elapsed_time = 0.0;
+
+  // Print a message
+  std::stringstream line;
+  line << "Elapsed time: " << elapsed_time << " (" << task << ")";
+  log(line.str(), TRACE);
+
+  // Store values for summary
+  map_iterator it = _timings.find(task);
+  if (it == _timings.end())
+  {
+    std::pair<std::size_t, double> timing(1, elapsed_time);
+    _timings[task] = timing;
+  }
+  else
+  {
+    it->second.first += 1;
+    it->second.second += elapsed_time;
+  }
+}
+//-----------------------------------------------------------------------------
+void Logger::list_timings(bool reset)
+{
+  // Check if timings are empty
+  if (_timings.empty())
+  {
+    log("Timings: no timings to report.");
+    return;
+  }
+  else
+  {
+    log("");
+    log(timings(reset).str(true));
+  }
+
+  // Print maximum memory usage if available
+  if (_maximum_memory_usage >= 0)
+  {
+    std::stringstream s;
+    s << "\nMaximum memory usage: " << _maximum_memory_usage << " MB";
+    log(s.str());
+  }
+
+}
+//-----------------------------------------------------------------------------
+Table Logger::timings(bool reset)
+{
+  // Generate timing table
+  Table table("Summary of timings");
+  for (const_map_iterator it = _timings.begin(); it != _timings.end(); ++it)
+  {
+    const std::string task    = it->first;
+    const std::size_t num_timings    = it->second.first;
+    const double total_time   = it->second.second;
+    const double average_time = total_time / static_cast<double>(num_timings);
+
+    table(task, "Average time") = average_time;
+    table(task, "Total time")   = total_time;
+    table(task, "Reps")         = num_timings;
+  }
+
+  // Clear timings
+  if (reset)
+    _timings.clear();
+
+  return table;
+}
+//-----------------------------------------------------------------------------
+double Logger::timing(std::string task, bool reset)
+{
+  // Find timing
+  map_iterator it = _timings.find(task);
+  if (it == _timings.end())
+  {
+    std::stringstream line;
+    line << "No timings registered for task \"" << task << "\".";
+    dolfin_error("Logger.cpp",
+                 "extract timing for task",
+                 line.str());
+  }
+
+  // Compute average
+  const std::size_t num_timings  = it->second.first;
+  const double total_time   = it->second.second;
+  const double average_time = total_time / static_cast<double>(num_timings);
+
+  // Clear timing
+  _timings.erase(it);
+
+  return average_time;
+}
+//-----------------------------------------------------------------------------
+void Logger::monitor_memory_usage()
+{
+  #ifndef __linux__
+  warning("Unable to initialize memory monitor; only available on GNU/Linux.");
+  return;
+
+  #else
+
+  // Check that thread has not alrady been started
+  if (_thread_monitor_memory_usage)
+  {
+    log("Memory monitor already initialize.");
+    return;
+  }
+
+  // Create thread
+  _thread_monitor_memory_usage.reset(new boost::thread(boost::bind(&_monitor_memory_usage, this)));
+
+  #endif
+}
+//-----------------------------------------------------------------------------
+void Logger::_report_memory_usage(size_t num_mb)
+{
+  std::stringstream s;
+  s << "Memory usage: " << num_mb << " MB";
+  log(s.str());
+  _maximum_memory_usage = std::max(_maximum_memory_usage,
+                                   static_cast<long int>(num_mb));
+}
+//-----------------------------------------------------------------------------
+void Logger::__debug(std::string msg) const
+{
+  std::string s = std::string("DEBUG: ") + msg;
+  write(DBG, s, -1);
+}
+//-----------------------------------------------------------------------------
+void Logger::__dolfin_assert(std::string file, unsigned long line,
+                             std::string function, std::string check) const
+{
+  std::stringstream location;
+  location << file << " (line " << line << ")";
+  std::stringstream task;
+  task << "complete call to function " << function << "()";
+  std::stringstream reason;
+  reason << "Assertion " << check << " failed";
+  dolfin_error(location.str(), task.str(), reason.str());
+}
+//-----------------------------------------------------------------------------
+void Logger::write(int log_level, std::string msg, int rank) const
+{
+  // Check log level
+  if (!_active || log_level < _log_level)
+    return;
+
+  // Check if we want output on root process only
+  const bool std_out_all_processes = parameters["std_out_all_processes"];
+  if (rank > 0 && !std_out_all_processes && log_level < WARNING)
+    return;
+
+  // Prefix with process number if running in parallel
+  if (rank >= 0)
+  {
+    std::stringstream prefix;
+    prefix << "Process " << rank << ": ";
+    msg = prefix.str() + msg;
+  }
+
+  // Add indentation
+  for (int i = 0; i < indentation_level; i++)
+    msg = "  " + msg;
+
+  // Write to stream
+  *logstream << msg << std::endl;
+}
+//----------------------------------------------------------------------------
diff --git a/dolfin/log/Logger.h b/dolfin/log/Logger.h
new file mode 100644
index 0000000..7056cce
--- /dev/null
+++ b/dolfin/log/Logger.h
@@ -0,0 +1,162 @@
+// Copyright (C) 2003-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Thanks to Jim Tilander for many helpful hints.
+//
+// Modified by Ola Skavhaug 2007, 2009
+//
+// First added:  2003-03-13
+// Last changed: 2013-01-07
+
+#ifndef __LOGGER_H
+#define __LOGGER_H
+
+#include <map>
+#include <memory>
+#include <ostream>
+#include <string>
+#include "Table.h"
+#include "LogLevel.h"
+
+// Forward declarations
+namespace boost { class thread; }
+
+namespace dolfin
+{
+
+  class Logger
+  {
+  public:
+
+    /// Constructor
+    Logger();
+
+    /// Destructor
+    ~Logger();
+
+    /// Print message
+    void log(std::string msg, int log_level=INFO) const;
+
+    /// Print underlined message
+    void log_underline(std::string msg, int log_level=INFO) const;
+
+    /// Print warning
+    void warning(std::string msg) const;
+
+    /// Print error message and throw exception
+    void error(std::string msg) const;
+
+    /// Print error message, prefer this to the above generic error message
+    void dolfin_error(std::string location,
+                      std::string task,
+                      std::string reason,
+                      int mpi_rank=-1) const;
+
+    /// Issue deprecation warning for removed feature
+    void deprecation(std::string feature,
+                     std::string version_deprecated,
+                     std::string version_remove,
+                     std::string message) const;
+
+    /// Begin task (increase indentation level)
+    void begin(std::string msg, int log_level=INFO);
+
+    /// End task (decrease indentation level)
+    void end();
+
+    /// Draw progress bar
+    void progress (std::string title, double p) const;
+
+    /// Set output stream
+    void set_output_stream(std::ostream& stream);
+
+    /// Get output stream
+    std::ostream& get_output_stream() { return *logstream; }
+
+    /// Turn logging on or off
+    void set_log_active(bool active);
+
+    /// Return true iff logging is active
+    inline bool is_active() { return _active; }
+
+    /// Set log level
+    void set_log_level(int log_level);
+
+    /// Get log level
+    inline int get_log_level() const { return _log_level; }
+
+    /// Register timing (for later summary)
+    void register_timing(std::string task, double elapsed_time);
+
+    /// Return a summary of timings and tasks as a Table, optionally
+    /// clearing stored timings
+    Table timings(bool reset=false);
+
+    /// Print summary of timings and tasks, optionally clearing stored
+    /// timings
+    void list_timings(bool reset=false);
+
+    /// Return timing (average) for given task, optionally clearing
+    /// timing for task
+    double timing(std::string task, bool reset=false);
+
+    /// Monitor memory usage. Call this function at the start of a
+    /// program to continuously monitor the memory usage of the
+    /// process.
+    void monitor_memory_usage();
+
+    /// Helper function for reporting memory usage
+    void _report_memory_usage(size_t num_mb);
+
+    /// Helper function for dolfin_debug macro
+    void __debug(std::string msg) const;
+
+    /// Helper function for dolfin_dolfin_assert macro
+    void __dolfin_assert(std::string file, unsigned long line,
+                  std::string function, std::string check) const;
+
+  private:
+
+    // Write message
+    void write(int log_level, std::string msg, int rank) const;
+
+    // True iff logging is active
+    bool _active;
+
+    // Current log level
+    int _log_level;
+
+    // Current indentation level
+    int indentation_level;
+
+    // Optional stream for logging
+    std::ostream* logstream;
+
+    // List of timings for tasks, map from string to (num_timings, total_time)
+    std::map<std::string, std::pair<std::size_t, double> > _timings;
+
+    // Thread used for monitoring memory usage
+    std::unique_ptr<boost::thread> _thread_monitor_memory_usage;
+
+    // Maximum memory usage so far
+    long int _maximum_memory_usage;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/log/Progress.cpp b/dolfin/log/Progress.cpp
new file mode 100644
index 0000000..39d6f1e
--- /dev/null
+++ b/dolfin/log/Progress.cpp
@@ -0,0 +1,165 @@
+// Copyright (C) 2003-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Thanks to Jim Tilander for many helpful hints.
+//
+// Modified by Garth N. Wells, 2006.
+// Modified by Ola Skavhaug, 2009.
+//
+// First added:  2003-03-14
+// Last changed: 2011-11-14
+
+#include <dolfin/common/constants.h>
+#include <dolfin/common/timing.h>
+#include "log.h"
+#include "LogManager.h"
+#include "Progress.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Progress::Progress(std::string title, unsigned int n)
+  : _title(title), _n(n), i(0), t_step(0.5), c_step(1), _p(0), _t(0), tc(0),
+    always(false), finished(false), displayed(false), counter(0)
+{
+  if (n <= 0)
+  {
+    dolfin_error("Progress.cpp",
+                 "create progress bar",
+                 "Number of steps for progress bar must be positive");
+  }
+
+  // LogManager::logger.progress(title, 0.0);
+  _t = time();
+
+  // When log level is TRACE or lower, always display at least the 100% message
+  if (LogManager::logger.get_log_level() <= TRACE )
+    always = true;
+}
+//-----------------------------------------------------------------------------
+Progress::Progress(std::string title)
+  : _title(title), _n(0), i(0), t_step(0.5), c_step(1), _p(0), _t(0), tc(0),
+    always(false), finished(false), displayed(false), counter(0)
+{
+  // LogManager::logger.progress(title, 0.0);
+  _t = time();
+
+  // When log level is TRACE or lower, always display at least the 100% message
+  if (LogManager::logger.get_log_level() <= TRACE )
+    always = true;
+}
+//-----------------------------------------------------------------------------
+Progress::~Progress()
+{
+  // Display last progress bar if not displayed
+  if (displayed && !finished)
+    LogManager::logger.progress(_title, 1.0);
+}
+//-----------------------------------------------------------------------------
+void Progress::operator=(double p)
+{
+  if (_n != 0)
+  {
+    dolfin_error("Progress.cpp",
+                 "update progress bar",
+                 "Cannot specify value for progress bar with given number of steps");
+  }
+
+  update(p);
+}
+//-----------------------------------------------------------------------------
+void Progress::operator++(int)
+{
+  if (_n == 0)
+  {
+    dolfin_error("Progress.cpp",
+                 "increment progress bar",
+                 "Cannot step progress bar for session with unknown number of steps");
+  }
+
+  if (i < _n)
+    i++;
+
+  update(static_cast<double>(i) / static_cast<double>(_n));
+}
+//-----------------------------------------------------------------------------
+void Progress::update(double p)
+{
+  // FIXME: We should be able to simplify this...
+
+  // Check that enough number of updates have passed so we don't call
+  // time() to often which is costly
+  if (counter++ < c_step)
+    return;
+  counter = 0;
+
+  // Check if we have already finished
+  if (finished)
+    return;
+
+  // Check that enough time has passed since last update
+  const double t = time();
+  const bool t_check = (t - _t >= t_step - DOLFIN_EPS);
+
+  // Adjust counter step
+  const double fraction = 0.1;
+  if (t - this->tc < fraction * t_step)
+    c_step *= 2;
+  else if (t - this->tc > t_step && c_step >= 2)
+    c_step /= 2;
+  this->tc = t;
+
+  // Reset time for next update
+  if (t_check)
+  {
+    _p = p;
+    _t = t;
+  }
+
+  // Assume we want to update the progress
+  bool do_log_update = t_check;
+
+  // Nontrivial check for first update
+  if (t_check && !always && !displayed && p >= 0.7)
+  {
+    // skip the first update, since it will probably reach 100%
+    // before the next time t_check is true
+    do_log_update = false;
+
+    // ...but don't skip the next (pretend we displayed this one)
+    displayed = true;
+  }
+
+  // Nontrivial check for last update
+  if (p >= 1.0)
+  {
+    // always display 100% message if a message has already been shown
+    if (displayed || always)
+      do_log_update = true;
+
+    // ...but don't show more than one
+    finished = true;
+  }
+
+  // Only update when the increase is significant
+  if (do_log_update)
+  {
+    LogManager::logger.progress(_title, p);
+    displayed = true;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/log/Progress.h b/dolfin/log/Progress.h
new file mode 100644
index 0000000..db24de0
--- /dev/null
+++ b/dolfin/log/Progress.h
@@ -0,0 +1,137 @@
+// Copyright (C) 2003-2008 Anders Logg and Jim Tilander
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2003-03-14
+// Last changed: 2010-11-10
+
+#ifndef __PROGRESS_H
+#define __PROGRESS_H
+
+#include <string>
+
+namespace dolfin
+{
+
+  // FIXME: Replace implementation with wrapper for boost::progress_display
+  // FIXME: See http://www.boost.org/doc/libs/1_42_0/libs/timer/timer.htm
+
+  /// This class provides a simple way to create and update progress
+  /// bars during a computation.
+  ///
+  /// *Example*
+  ///     A progress bar may be used either in an iteration with a known number
+  ///     of steps:
+  ///
+  ///     .. code-block:: c++
+  ///
+  ///         Progress p("Iterating...", n);
+  ///         for (int i = 0; i < n; i++)
+  ///         {
+  ///           ...
+  ///           p++;
+  ///         }
+  ///
+  ///     or in an iteration with an unknown number of steps:
+  ///
+  ///     .. code-block:: c++
+  ///
+  ///         Progress p("Iterating...");
+  ///         while (t < T)
+  ///         {
+  ///           ...
+  ///           p = t / T;
+  ///         }
+
+  class Progress
+  {
+  public:
+
+    /// Create progress bar with a known number of steps
+    ///
+    /// *Arguments*
+    ///     title (std::string)
+    ///         The title.
+    ///     n (unsigned int)
+    ///         Number of steps.
+    Progress(std::string title, unsigned int n);
+
+    /// Create progress bar with an unknown number of steps
+    ///
+    /// *Arguments*
+    ///     title (std::string)
+    ///         The title.
+    Progress(std::string title);
+
+    /// Destructor
+    ~Progress();
+
+    /// Set current position
+    ///
+    /// *Arguments*
+    ///     p (double)
+    ///         The position.
+    void operator=(double p);
+
+    /// Increment progress
+    void operator++(int);
+
+  private:
+
+    // Update progress
+    void update(double p);
+
+    // Title of progress bar
+    std::string _title;
+
+    // Number of steps
+    std::size_t _n;
+
+    // Current position
+    std::size_t i;
+
+    // Minimum time increment
+    double t_step;
+
+    // Minimum counter increment
+    std::size_t c_step;
+
+    // Current progress
+    double _p;
+
+    // Time for latest update
+    double _t;
+
+    // Time for last checking the time
+    double tc;
+
+    // Always visible
+    bool always;
+
+    // Finished flag
+    bool finished;
+
+    // Displayed flag
+    bool displayed;
+
+    // Counter for updates
+    std::size_t counter;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/log/README b/dolfin/log/README
new file mode 100644
index 0000000..7640867
--- /dev/null
+++ b/dolfin/log/README
@@ -0,0 +1,44 @@
+Developer notes for the log library
+-----------------------------------
+
+* Some rules of thumb for the dolfin_error function.
+
+  - The 'task' string should be sufficiently high level ("assemble form")
+    to make sense to a user.
+  - Use the same 'task' string from all errors originating from the same
+    function.
+  - The 'task' string should provide details of which particular algorithm
+    or method that was used ("assemble form using OpenMP assembler").
+  - The 'reason' string should try to explain why the task failed in the
+    context of the task that failed ("subdomains are not yet handled").
+  - Write "initialize mesh function" rather than "initialize MeshFunction".
+
+  Some examples:
+
+  dolfin_error("DofMap.cpp",
+               "create mapping of degrees of freedom",
+               "Mesh is not ordered according to the UFC numbering convention. "
+               "Consider calling mesh.order()");
+
+  dolfin_error("File.cpp",
+               "open file",
+               "Could not create directory \"%s\"",
+               path.parent_path().string().c_str());
+
+  dolfin_error("TriangleCell.cpp",
+               "access number of entities of triangle cell",
+               "Illegal topological dimension (%d)", dim);
+
+  dolfin_error("VTKFile.cpp",
+               "Create VTK file",
+               "Unknown encoding (\"%s\"). "
+               "Known encodings are \"ascii\", \"base64\" and \"compressed\"",
+               encoding.c_str());
+
+  dolfin_error("SubSystemsManager.cpp",
+               "initialize PETSc subsystem",
+               "DOLFIN has not been configured with PETSc support");
+
+  dolfin_error("PETScKrylovSolver.cpp",
+               "solve linear system with PETSc Krylov solver",
+               "Matrix does not have a nonzero number of rows and columns");
diff --git a/dolfin/log/Table.cpp b/dolfin/log/Table.cpp
new file mode 100644
index 0000000..71b0d9c
--- /dev/null
+++ b/dolfin/log/Table.cpp
@@ -0,0 +1,356 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-07-19
+// Last changed: 2011-11-15
+
+#include <iomanip>
+#include <iostream>
+#include <sstream>
+
+#include <dolfin/common/constants.h>
+#include <dolfin/log/LogStream.h>
+#include <dolfin/log/log.h>
+#include "Table.h"
+
+using namespace dolfin;
+
+typedef std::vector<std::string>::const_iterator iterator;
+
+//-----------------------------------------------------------------------------
+Table::Table(std::string title, bool right_justify)
+  : _title(title), _right_justify(right_justify)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Table::~Table()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+TableEntry Table::operator() (std::string row, std::string col)
+{
+  TableEntry entry(row, col, *this);
+  return entry;
+}
+//-----------------------------------------------------------------------------
+void Table::set(std::string row, std::string col, int value)
+{
+  std::stringstream s;
+  s << value;
+  set(row, col, s.str());
+}
+//-----------------------------------------------------------------------------
+void Table::set(std::string row, std::string col, std::size_t value)
+{
+  std::stringstream s;
+  s << value;
+  set(row, col, s.str());
+}
+//-----------------------------------------------------------------------------
+void Table::set(std::string row, std::string col, double value)
+{
+  if (std::abs(value) < DOLFIN_EPS)
+    value = 0.0;
+  std::stringstream s;
+  s << std::setprecision(5) << value;
+  set(row, col, s.str());
+  dvalues[std::make_pair(row, col)] = value;
+}
+//-----------------------------------------------------------------------------
+void Table::set(std::string row, std::string col, std::string value)
+{
+  // Add row
+  if (row_set.find(row) == row_set.end())
+  {
+    rows.push_back(row);
+    row_set.insert(row);
+  }
+
+  // Add column
+  if (col_set.find(col) == col_set.end())
+  {
+    cols.push_back(col);
+    col_set.insert(col);
+  }
+
+  // Store value
+  std::pair<std::string, std::string> key(row, col);
+  values[key] = value;
+}
+//-----------------------------------------------------------------------------
+std::string Table::get(std::string row, std::string col) const
+{
+  std::pair<std::string, std::string> key(row, col);
+  std::map<std::pair<std::string, std::string>, std::string>::const_iterator
+    it = values.find(key);
+
+  if (it == values.end())
+  {
+    dolfin_error("Table.cpp",
+                 "access table value",
+                 "Missing table value for entry (\"%s\", \"%s\")",
+                 row.c_str(), col.c_str());
+  }
+
+  return it->second;
+}
+//-----------------------------------------------------------------------------
+double Table::get_value(std::string row, std::string col) const
+{
+  std::pair<std::string, std::string> key(row, col);
+  std::map<std::pair<std::string, std::string>, double>::const_iterator
+    it = dvalues.find(key);
+
+  if (it == dvalues.end())
+  {
+    dolfin_error("Table.cpp",
+                 "access table value",
+                 "Missing double value for entry (\"%s\", \"%s\")",
+                 row.c_str(), col.c_str());
+  }
+
+  return it->second;
+}
+//-----------------------------------------------------------------------------
+std::string Table::title() const
+{
+  return _title;
+}
+//-----------------------------------------------------------------------------
+/* Removed after storing values as strings instead of double
+Table Table::operator+ (const Table& table) const
+{
+  // Check table sizes
+  if (rows.size() != table.rows.size() || cols.size() != table.cols.size())
+  {
+    dolfin_error("Table.cpp",
+                 "add tables",
+                 "Dimension mismatch for addition of tables");
+  }
+
+  // Add tables
+  Table t;
+  for (iterator i = rows.begin(); i !=rows.end(); i++)
+    for (iterator j = cols.begin(); j != cols.end(); j++)
+      t.set(*i, *j, get(*i, *j) + table.get(*i, *j));
+
+  return t;
+}
+//-----------------------------------------------------------------------------
+Table Table::operator- (const Table& table) const
+{
+  // Check table sizes
+  if (rows.size() != table.rows.size() || cols.size() != table.cols.size())
+  {
+    dolfin_error("Table.cpp",
+                 "subtract tables",
+                 "Dimension mismatch for addition of tables");
+  }
+
+  // Add tables
+  Table t;
+  for (iterator i = rows.begin(); i !=rows.end(); i++)
+    for (iterator j = cols.begin(); j != cols.end(); j++)
+      t.set(*i, *j, get(*i, *j) - table.get(*i, *j));
+
+  return t;
+}
+*/
+//-----------------------------------------------------------------------------
+const Table& Table::operator= (const Table& table)
+{
+  // Assign everything but the title
+
+  rows = table.rows;
+  row_set = table.row_set;
+
+  cols = table.cols;
+  col_set = table.col_set;
+
+  values = table.values;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+std::string Table::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    //s << str(false) << std::endl << std::endl;
+
+    std::vector<std::vector<std::string> > tvalues;
+    std::vector<std::size_t> col_sizes;
+
+    // Format values and compute column sizes
+    col_sizes.push_back(_title.size());
+    for (std::size_t j = 0; j < cols.size(); j++)
+      col_sizes.push_back(cols[j].size());
+    for (std::size_t i = 0; i < rows.size(); i++)
+    {
+      tvalues.push_back(std::vector<std::string>());
+      col_sizes[0] = std::max(col_sizes[0], rows[i].size());
+      for (std::size_t j = 0; j < cols.size(); j++)
+      {
+        std::string value = get(rows[i], cols[j]);
+        tvalues[i].push_back(value);
+        col_sizes[j + 1] = std::max(col_sizes[j + 1], value.size());
+      }
+    }
+    std::size_t row_size = 2*col_sizes.size() + 1;
+    for (std::size_t j = 0; j < col_sizes.size(); j++)
+      row_size += col_sizes[j];
+
+    // Write table
+    s << _title;
+    for (std::size_t k = 0; k < col_sizes[0] - _title.size(); k++)
+      s << " ";
+    s << "  |";
+    for (std::size_t j = 0; j < cols.size(); j++)
+    {
+      if (_right_justify)
+      {
+        for (std::size_t k = 0; k < col_sizes[j + 1] - cols[j].size(); k++)
+          s << " ";
+        s << "  " << cols[j];
+      }
+      else
+      {
+        s << "  " << cols[j];
+        for (std::size_t k = 0; k < col_sizes[j + 1] - cols[j].size(); k++)
+          s << " ";
+      }
+    }
+    s << "\n";
+    for (std::size_t k = 0; k < row_size; k++)
+      s << "-";
+    for (std::size_t i = 0; i < rows.size(); i++)
+    {
+      s << "\n";
+      s << rows[i];
+      for (std::size_t k = 0; k < col_sizes[0] - rows[i].size(); k++)
+        s << " ";
+      s << "  |";
+      for (std::size_t j = 0; j < cols.size(); j++)
+      {
+        if (_right_justify)
+        {
+          for (std::size_t k = 0; k < col_sizes[j + 1] - tvalues[i][j].size(); k++)
+            s << " ";
+          s << "  " << tvalues[i][j];
+        }
+        else
+        {
+          s << "  " << tvalues[i][j];
+          for (std::size_t k = 0; k < col_sizes[j + 1] - tvalues[i][j].size(); k++)
+            s << " ";
+        }
+      }
+    }
+  }
+  else
+  {
+    s << "<Table of size " << rows.size() << " x " << cols.size() << ">";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string Table::str_latex() const
+{
+  if (rows.empty() || cols.empty())
+    return "Empty table";
+
+  std::stringstream s;
+
+  s << _title << "\n";
+  s << "\\begin{center}\n";
+  s << "\\begin{tabular}{|l|";
+  for (std::size_t j = 0; j < cols.size(); j++)
+    s << "|c";
+  s << "|}\n";
+  s << "\\hline\n";
+  s << "& ";
+  for (std::size_t j = 0; j < cols.size(); j++)
+  {
+    if (j < cols.size() - 1)
+      s << cols[j] << " & ";
+    else
+      s << cols[j] << " \\\\\n";
+  }
+  s << "\\hline\\hline\n";
+  for (std::size_t i = 0; i < rows.size(); i++)
+  {
+    s << rows[i] << " & ";
+    for (std::size_t j = 0; j < cols.size(); j++)
+    {
+      if (j < cols.size() - 1)
+        s << get(rows[i], cols[j]) << " & ";
+      else
+        s << get(rows[i], cols[j]) << " \\\\\n";
+    }
+    s << "\\hline\n";
+  }
+  s << "\\end{tabular}\n";
+  s << "\\end{center}\n";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+TableEntry::TableEntry(std::string row, std::string col, Table& table)
+  : _row(row), _col(col), _table(table)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+TableEntry::~TableEntry()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+const TableEntry& TableEntry::operator= (std::size_t value)
+{
+  _table.set(_row, _col, value);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const TableEntry& TableEntry::operator= (int value)
+{
+  _table.set(_row, _col, value);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const TableEntry& TableEntry::operator= (double value)
+{
+  _table.set(_row, _col, value);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const TableEntry& TableEntry::operator= (std::string value)
+{
+  _table.set(_row, _col, value);
+  return *this;
+}
+//-----------------------------------------------------------------------------
+TableEntry::operator std::string() const
+{
+  return _table.get(_row, _col);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/log/Table.h b/dolfin/log/Table.h
new file mode 100644
index 0000000..01a07e2
--- /dev/null
+++ b/dolfin/log/Table.h
@@ -0,0 +1,157 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-07-19
+// Last changed: 2011-10-07
+
+#ifndef __TABLE_H
+#define __TABLE_H
+
+#include <map>
+#include <set>
+#include <vector>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  class TableEntry;
+
+  /// This class provides storage and pretty-printing for tables.
+  /// Example usage:
+  ///
+  ///   Table table("Timings");
+  ///
+  ///   table("uBLAS",  "Assemble") = 0.010;
+  ///   table("uBLAS",  "Solve")    = 0.020;
+  ///   table("PETSc",  "Assemble") = 0.011;
+  ///   table("PETSc",  "Solve")    = 0.019;
+  ///   table("Epetra", "Assemble") = 0.012;
+  ///   table("Epetra", "Solve")    = 0.018;
+  ///
+  ///   info(table);
+
+  class Table : public Variable
+  {
+  public:
+
+    /// Create empty table
+    Table(std::string title="", bool right_justify=true);
+
+    /// Destructor
+    ~Table();
+
+    /// Return table entry
+    TableEntry operator() (std::string row, std::string col);
+
+    /// Set value of table entry
+    void set(std::string row, std::string col, int value);
+
+    /// Set value of table entry
+    void set(std::string row, std::string col, std::size_t value);
+
+    /// Set value of table entry
+    void set(std::string row, std::string col, double value);
+
+    /// Set value of table entry
+    void set(std::string row, std::string col, std::string value);
+
+    /// Get value of table entry
+    std::string get(std::string row, std::string col) const;
+
+    /// Get value of table entry
+    double get_value(std::string row, std::string col) const;
+
+    /// Return table title
+    std::string title() const;
+
+    /// Assignment operator
+    const Table& operator= (const Table& table);
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Return informal string representation for LaTeX
+    std::string str_latex() const;
+
+  private:
+
+    // Table title
+    std::string _title;
+
+    // Rows
+    std::vector<std::string> rows;
+    std::set<std::string> row_set;
+
+    // Columns
+    std::vector<std::string> cols;
+    std::set<std::string> col_set;
+
+    // Table values as strings
+    std::map<std::pair<std::string, std::string>, std::string> values;
+
+    // Table values as doubles
+    std::map<std::pair<std::string, std::string>, double> dvalues;
+
+    // True if we should right-justify the table entries
+    bool _right_justify;
+
+  };
+
+  /// This class represents an entry in a Table
+
+  class TableEntry
+  {
+  public:
+
+    /// Create table entry
+    TableEntry(std::string row, std::string col, Table& table);
+
+    /// Destructor
+    ~TableEntry();
+
+    /// Assign value to table entry
+    const TableEntry& operator= (std::size_t value);
+
+    /// Assign value to table entry
+    const TableEntry& operator= (int value);
+
+    /// Assign value to table entry
+    const TableEntry& operator= (double value);
+
+    /// Assign value to table entry
+    const TableEntry& operator= (std::string value);
+
+    /// Cast to entry value
+    operator std::string() const;
+
+  private:
+
+    // Row
+    std::string _row;
+
+    // Column
+    std::string _col;
+
+    // Table
+    Table& _table;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/log/dolfin_log.h b/dolfin/log/dolfin_log.h
new file mode 100644
index 0000000..4ac7c6b
--- /dev/null
+++ b/dolfin/log/dolfin_log.h
@@ -0,0 +1,13 @@
+#ifndef __DOLFIN_LOG_H
+#define __DOLFIN_LOG_H
+
+/// DOLFIN log interface
+
+#include <dolfin/log/log.h>
+#include <dolfin/log/Event.h>
+#include <dolfin/log/LogStream.h>
+#include <dolfin/log/Progress.h>
+#include <dolfin/log/Table.h>
+#include <dolfin/log/LogLevel.h>
+
+#endif
diff --git a/dolfin/log/log.cpp b/dolfin/log/log.cpp
new file mode 100644
index 0000000..ef34b2c
--- /dev/null
+++ b/dolfin/log/log.cpp
@@ -0,0 +1,230 @@
+// Copyright (C) 2003-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Thanks to Jim Tilander for many helpful hints.
+//
+// Modified by Ola Skavhaug 2007,
+// Modified by Garth N. Wells 2009
+//
+// First added:  2003-03-13
+// Last changed: 2013-04-18
+
+#include <cstdarg>
+#include <cstdlib>
+#include <iostream>
+#include <sstream>
+#include <stdarg.h>
+#include <stdio.h>
+
+#include <boost/scoped_array.hpp>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/parameter/Parameters.h>
+#include "LogManager.h"
+#include "log.h"
+
+using namespace dolfin;
+
+static boost::scoped_array<char> buffer(0);
+static unsigned int buffer_size= 0;
+
+// Buffer allocation
+void allocate_buffer(std::string msg)
+{
+  // va_list, start, end require a char pointer of fixed size so we
+  // need to allocate the buffer here. We allocate twice the size of
+  // the format string and at least DOLFIN_LINELENGTH. This should be
+  // ok in most cases.
+  unsigned int new_size = std::max(static_cast<unsigned int>(2*msg.size()),
+                                   static_cast<unsigned int>(DOLFIN_LINELENGTH));
+  //static_cast<unsigned int>(DOLFIN_LINELENGTH));
+  if (new_size > buffer_size)
+  {
+    buffer.reset(new char[new_size]);
+    buffer_size = new_size;
+  }
+}
+
+// Macro for parsing arguments
+#define read(buffer, msg) \
+  allocate_buffer(msg); \
+  va_list aptr; \
+  va_start(aptr, msg); \
+  vsnprintf(buffer, buffer_size, msg.c_str(), aptr); \
+  va_end(aptr);
+
+//-----------------------------------------------------------------------------
+void dolfin::info(std::string msg, ...)
+{
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  read(buffer.get(), msg);
+  LogManager::logger.log(buffer.get());
+}
+//-----------------------------------------------------------------------------
+void dolfin::info(const Variable& variable, bool verbose)
+{
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  info(variable.str(verbose));
+}
+//-----------------------------------------------------------------------------
+void dolfin::info(const Parameters& parameters, bool verbose)
+{
+  // Need separate function for Parameters since we can't make Parameters
+  // a subclass of Variable (gives cyclic dependencies)
+
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  info(parameters.str(verbose));
+}
+//-----------------------------------------------------------------------------
+void dolfin::info_stream(std::ostream& out, std::string msg)
+{
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  std::ostream& old_out = LogManager::logger.get_output_stream();
+  LogManager::logger.set_output_stream(out);
+  LogManager::logger.log(msg);
+  LogManager::logger.set_output_stream(old_out);
+}
+//-----------------------------------------------------------------------------
+void dolfin::info_underline(std::string msg, ...)
+{
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  read(buffer.get(), msg);
+  LogManager::logger.log_underline(buffer.get());
+}
+//-----------------------------------------------------------------------------
+void dolfin::warning(std::string msg, ...)
+{
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  read(buffer.get(), msg);
+  LogManager::logger.warning(buffer.get());
+}
+//-----------------------------------------------------------------------------
+void dolfin::error(std::string msg, ...)
+{
+  read(buffer.get(), msg);
+  LogManager::logger.error(buffer.get());
+}
+//-----------------------------------------------------------------------------
+void dolfin::dolfin_error(std::string location,
+                          std::string task,
+                          std::string reason, ...)
+{
+  read(buffer.get(), reason);
+  LogManager::logger.dolfin_error(location, task, buffer.get());
+}
+//-----------------------------------------------------------------------------
+void dolfin::deprecation(std::string feature,
+                         std::string version_deprecated,
+                         std::string version_remove,
+                         std::string message, ...)
+{
+  read(buffer.get(), message);
+  LogManager::logger.deprecation(feature, version_deprecated, version_remove,
+                                 buffer.get());
+}
+//-----------------------------------------------------------------------------
+void dolfin::log(int log_level, std::string msg, ...)
+{
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  read(buffer.get(), msg);
+  LogManager::logger.log(buffer.get(), log_level);
+}
+//-----------------------------------------------------------------------------
+void dolfin::begin(std::string msg, ...)
+{
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  read(buffer.get(), msg);
+  LogManager::logger.begin(buffer.get());
+}
+//-----------------------------------------------------------------------------
+void dolfin::begin(int log_level, std::string msg, ...)
+{
+  if (!LogManager::logger.is_active()) return; // optimization
+  read(buffer.get(), msg);
+  LogManager::logger.begin(buffer.get(), log_level);
+}
+//-----------------------------------------------------------------------------
+void dolfin::end()
+{
+  if (!LogManager::logger.is_active())
+    return; // optimization
+  LogManager::logger.end();
+}
+//-----------------------------------------------------------------------------
+void dolfin::set_log_active(bool active)
+{
+  LogManager::logger.set_log_active(active);
+}
+//-----------------------------------------------------------------------------
+void dolfin::set_log_level(int level)
+{
+  LogManager::logger.set_log_level(level);
+}
+//-----------------------------------------------------------------------------
+void dolfin::set_output_stream(std::ostream& out)
+{
+  LogManager::logger.set_output_stream(out);
+}
+//-----------------------------------------------------------------------------
+int dolfin::get_log_level()
+{
+  return LogManager::logger.get_log_level();
+}
+//-----------------------------------------------------------------------------
+void dolfin::monitor_memory_usage()
+{
+  LogManager::logger.monitor_memory_usage();
+}
+//-----------------------------------------------------------------------------
+void dolfin::not_working_in_parallel(std::string what)
+{
+  if (MPI::size(MPI_COMM_WORLD) > 1)
+  {
+    dolfin_error("log.cpp",
+                 "perform operation in parallel",
+                 "%s is not yet working in parallel.\n"
+                 "***          Consider filing a bug report at %s",
+                 what.c_str(), "https://bitbucket.org/fenics-project/dolfin/issues");
+  }
+}
+//-----------------------------------------------------------------------------
+void dolfin::__debug(std::string file, unsigned long line,
+                     std::string function, std::string format, ...)
+{
+  read(buffer.get(), format);
+  std::ostringstream ost;
+  ost << "[at " << file << ":" << line << " in " << function << "()]";
+  LogManager::logger.__debug(ost.str());
+  std::string msg = std::string(buffer.get());
+  LogManager::logger.__debug(msg);
+}
+//-----------------------------------------------------------------------------
+void dolfin::__dolfin_assert(std::string file, unsigned long line,
+                      std::string function, std::string check)
+{
+  LogManager::logger.__dolfin_assert(file, line, function, check);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/log/log.h b/dolfin/log/log.h
new file mode 100644
index 0000000..74d71a1
--- /dev/null
+++ b/dolfin/log/log.h
@@ -0,0 +1,184 @@
+// Copyright (C) 2003-2013 Anders Logg and Jim Tilander
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug 2007, 2009
+//
+// First added:  2003-03-13
+// Last changed: 2013-01-07
+
+#ifndef __LOG_H
+#define __LOG_H
+
+#include <string>
+#include "LogLevel.h"
+
+namespace dolfin
+{
+
+  class Variable;
+  class Parameters;
+
+  /// The DOLFIN log system provides the following set of functions for
+  /// uniform handling of log messages, warnings and errors. In addition,
+  /// macros are provided for debug messages and dolfin_assertions.
+  ///
+  /// Only messages with a debug level higher than or equal to the current
+  /// log level are printed (the default being zero). Logging may also be
+  /// turned off by calling set_log_active(false).
+
+  /// Print message
+  void info(std::string msg, ...);
+
+  /// Print parameter (using output of str() method)
+  void info(const Parameters& parameters, bool verbose=false);
+
+  /// Print variable (using output of str() method)
+  void info(const Variable& variable, bool verbose=false);
+
+  /// Print message to stream
+  void info_stream(std::ostream& out, std::string msg);
+
+  /// Print underlined message
+  void info_underline(std::string msg, ...);
+
+  /// Print warning
+  void warning(std::string msg, ...);
+
+  /// Print error message and throw an exception.
+  /// Note to developers: this function should not be used internally
+  /// in DOLFIN. Use the more informative dolfin_error instead.
+  void error(std::string msg, ...);
+
+  /// Print error message. Prefer this to the above generic error message.
+  ///
+  /// *Arguments*
+  ///     location (std::string)
+  ///         Name of the file from which the error message was generated.
+  ///     task (std::string)
+  ///         Name of the task that failed.
+  ///         Note that this string should begin with lowercase.
+  ///         Note that this string should not be punctuated.
+  ///     reason (std::string)
+  ///         A format string explaining the reason for the failure.
+  ///         Note that this string should begin with uppercase.
+  ///         Note that this string should not be punctuated.
+  ///         Note that this string may contain printf style formatting.
+  ///     ... (primitive types like int, std::size_t, double, bool)
+  ///         Optional arguments for the format string.
+  ///
+  /// Developers should read the file dolfin/log/README in the DOLFIN
+  /// source tree for further notes about the use of this function.
+  void dolfin_error(std::string location,
+                    std::string task,
+                    std::string reason, ...);
+
+  /// Issue deprecation warning for removed feature
+  ///
+  /// *Arguments*
+  ///     feature (std::string)
+  ///        Name of the feature that has been removed.
+  ///     version_deprecated (std::string)
+  ///        Version number of the release in which the feature is deprecated.
+  ///     version_remove (std::string)
+  ///        Version number of the release in which the feature will be removed.
+  ///     message (std::string)
+  ///        A format string explaining the deprecation.
+  void deprecation(std::string feature,
+                   std::string version_deprecated,
+                   std::string version_remove,
+                   std::string message, ...);
+
+  /// Print message at given debug level
+  void log(int debug_level, std::string msg, ...);
+
+  /// Begin task (increase indentation level)
+  void begin(std::string msg, ...);
+
+  /// Begin task (increase indentation level)
+  void begin(int debug_level, std::string msg, ...);
+
+  /// End task (decrease indentation level)
+  void end();
+
+  /// Turn logging on or off
+  void set_log_active(bool active=true);
+
+  /// Set log level
+  void set_log_level(int level);
+
+  /// Set output stream
+  void set_output_stream(std::ostream& out);
+
+  /// Get log level
+  int get_log_level();
+
+  /// Monitor memory usage. Call this function at the start of a
+  /// program to continuously monitor the memory usage of the process.
+  void monitor_memory_usage();
+
+  /// Report that functionality has not (yet) been implemented to work
+  /// in parallel
+  void not_working_in_parallel(std::string what);
+
+  // Helper function for dolfin_debug macro
+  void __debug(std::string file,
+               unsigned long line,
+               std::string function,
+               std::string format, ...);
+
+  // Helper function for dolfin_dolfin_assert macro
+  void __dolfin_assert(std::string file,
+                unsigned long line,
+                std::string function,
+                std::string check);
+
+}
+
+// The following three macros are the only "functions" in DOLFIN
+// named dolfin_foo. Other functions can be placed inside the
+// DOLFIN namespace and therefore don't require a prefix.
+
+// Debug macros (with varying number of arguments)
+#define dolfin_debug(msg)                  do { dolfin::__debug(__FILE__, __LINE__, __FUNCTION__, msg); } while (false)
+#define dolfin_debug1(msg, a0)             do { dolfin::__debug(__FILE__, __LINE__, __FUNCTION__, msg, a0); } while (false)
+#define dolfin_debug2(msg, a0, a1)         do { dolfin::__debug(__FILE__, __LINE__, __FUNCTION__, msg, a0, a1); } while (false)
+#define dolfin_debug3(msg, a0, a1, a2)     do { dolfin::__debug(__FILE__, __LINE__, __FUNCTION__, msg, a0, a1, a2); } while (false)
+#define dolfin_debug4(msg, a0, a1, a2, a3) do { dolfin::__debug(__FILE__, __LINE__, __FUNCTION__, msg, a0, a1, a2, a3); } while (false)
+
+// Not implemented error, reporting function name and line number
+#define dolfin_not_implemented() \
+  do { \
+    dolfin::dolfin_error("log.h", \
+                 "perform call to DOLFIN function", \
+                 "The function %s has not been implemented (in %s line %d)", \
+                 __FUNCTION__, __FILE__, __LINE__); \
+  } while (false)
+
+// Assertion, only active if DEBUG is defined
+#ifdef DEBUG
+#define dolfin_assert(check) \
+  do { \
+    if (!(check)) \
+    { \
+      dolfin::__dolfin_assert(__FILE__, __LINE__, __FUNCTION__, #check);    \
+    } \
+  } while (false)
+#else
+#define dolfin_assert(check)
+#endif
+
+#endif
diff --git a/dolfin/math/Lagrange.cpp b/dolfin/math/Lagrange.cpp
new file mode 100644
index 0000000..4e8d887
--- /dev/null
+++ b/dolfin/math/Lagrange.cpp
@@ -0,0 +1,180 @@
+// Copyright (C) 2003-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2006.
+// Modified by Benjamin Kehlet, 2009
+//
+// First added:  2003-06-12
+// Last changed: 2009-03-20
+
+#include <cmath>
+#include <dolfin/common/constants.h>
+#include "Lagrange.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Lagrange::Lagrange(std::size_t q) : _q(q), counter(0), points(q + 1, 0.0),
+   instability_detected("Warning: Lagrange polynomial is not numerically stable. The degree is too high.")
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Lagrange::Lagrange(const Lagrange& p) : _q(p._q), counter(p.counter),
+    points(p.points), instability_detected(p.instability_detected)
+{
+  if (counter == size())
+    init();
+}
+//-----------------------------------------------------------------------------
+void Lagrange::set(std::size_t i, double x)
+{
+  dolfin_assert(i <= _q);
+
+  points[i] = x;
+
+  counter++;
+  if (counter == size())
+    init();
+}
+//-----------------------------------------------------------------------------
+std::size_t Lagrange::size() const
+{
+  return points.size();
+}
+//-----------------------------------------------------------------------------
+std::size_t Lagrange::degree() const
+{
+  return _q;
+}
+//-----------------------------------------------------------------------------
+double Lagrange::point(std::size_t i) const
+{
+  dolfin_assert(i < points.size());
+  return points[i];
+}
+//-----------------------------------------------------------------------------
+double Lagrange::operator() (std::size_t i, double x)
+{
+  return eval(i, x);
+}
+//-----------------------------------------------------------------------------
+double Lagrange::eval(std::size_t i, double x)
+{
+  dolfin_assert(i < points.size());
+
+  double product(constants[i]);
+  for (std::size_t j = 0; j < points.size(); j++)
+  {
+    if (j != i)
+      product *= x - points[j];
+  }
+
+  return product;
+}
+//-----------------------------------------------------------------------------
+double Lagrange::ddx(std::size_t i, double x)
+{
+  dolfin_assert(i < points.size());
+
+  double s(0.0);
+  double prod(1.0);
+  bool x_equals_point = false;
+
+  for (std::size_t j = 0; j < points.size(); ++j)
+  {
+    if (j != i)
+    {
+      double t = x - points[j];
+      if (std::abs(t) < DOLFIN_EPS)
+        x_equals_point = true;
+      else
+      {
+        s += 1/t;
+        prod *= t;
+      }
+    }
+  }
+
+  if (x_equals_point)
+    return prod*constants[i];
+  else
+    return prod*constants[i]*s;
+}
+//-----------------------------------------------------------------------------
+double Lagrange::dqdx(std::size_t i)
+{
+  double product = constants[i];
+  for (std::size_t j = 1; j <= _q; j++)
+    product *= (double) j;
+
+  return product;
+}
+//-----------------------------------------------------------------------------
+std::string Lagrange::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+    for (std::size_t i = 0; i < points.size(); i++)
+      s << "  x[" << i << "] = " << points[i];
+  }
+  else
+  {
+    s << "<Lagrange polynomial of degree " << _q << " with "
+          << points.size() << " points>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void Lagrange::init()
+{
+  // Note: this will be computed when n nodal points have been set,
+  // assuming they are distinct. Precomputing the constants has a downside
+  // wrt to numerical stability, since the constants will decrease as
+  // the degree increases (and for high order be less than epsilon.
+
+  constants.resize(points.size());
+
+  // Compute constants
+  for (std::size_t i = 0; i < points.size(); i++)
+  {
+    double product = 1.0;
+    for (std::size_t j = 0; j < points.size(); j++)
+    {
+      if (j != i)
+      {
+        if (std::abs(points[i] - points[j]) < DOLFIN_EPS)
+        {
+          dolfin_error("Lagrange.cpp",
+                       "create Lagrange polynomial",
+                       "Nodal points are not distinct");
+        }
+        product *= points[i] - points[j];
+      }
+    }
+
+    if (std::abs(product) < DOLFIN_EPS)
+      instability_detected();
+
+    constants[i] = 1.0/product;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/math/Lagrange.h b/dolfin/math/Lagrange.h
new file mode 100644
index 0000000..b7b4e14
--- /dev/null
+++ b/dolfin/math/Lagrange.h
@@ -0,0 +1,105 @@
+// Copyright (C) 2003-2005 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2003-06-12
+// Last changed: 2009-09-08
+
+#ifndef __LAGRANGE_H
+#define __LAGRANGE_H
+
+#include <vector>
+
+#include <dolfin/log/Event.h>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+  /// Lagrange polynomial (basis) with given degree q determined by
+  /// n = q + 1 nodal points.
+  ///
+  /// Example: q = 1 (n = 2)
+  ///
+  ///   Lagrange p(1);
+  ///   p.set(0, 0.0);
+  ///   p.set(1, 1.0);
+  ///
+  /// It is the callers reponsibility that the points are distinct.
+  ///
+  /// This creates a Lagrange polynomial (actually two Lagrange
+  /// polynomials):
+  ///
+  ///   p(0,x) = 1 - x   (one at x = 0, zero at x = 1)
+  ///   p(1,x) = x       (zero at x = 0, one at x = 1)
+  ///
+
+
+  class Lagrange : public Variable
+  {
+  public:
+
+    /// Constructor
+    Lagrange(std::size_t q);
+
+    /// Copy constructor
+    Lagrange(const Lagrange& p);
+
+    /// Specify point
+    void set(std::size_t i, double x);
+
+    /// Return number of points
+    std::size_t size() const;
+
+    /// Return degree
+    std::size_t degree() const;
+
+    /// Return point
+    double point(std::size_t i) const;
+
+    /// Return value of polynomial i at given point x
+    double operator() (std::size_t i, double x);
+
+    /// Return value of polynomial i at given point x
+    double eval(std::size_t i, double x);
+
+    /// Return derivate of polynomial i at given point x
+    double ddx(std::size_t i, double x);
+
+    /// Return derivative q (a constant) of polynomial
+    double dqdx(std::size_t i);
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+  private:
+
+    void init();
+
+    const std::size_t _q;
+
+    // Counts the number of time set has been called to determine when
+    // init should be called
+    std::size_t counter;
+
+    std::vector<double> points;
+    std::vector<double> constants;
+
+    Event instability_detected;
+  };
+
+}
+
+#endif
diff --git a/dolfin/math/Legendre.cpp b/dolfin/math/Legendre.cpp
new file mode 100644
index 0000000..ee07d4a
--- /dev/null
+++ b/dolfin/math/Legendre.cpp
@@ -0,0 +1,49 @@
+// Copyright (C) 2003-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet
+//
+// First added:  2003-06-03
+// Last changed: 2009-02-17
+
+#include <cmath>
+#include <boost/math/special_functions/legendre.hpp>
+
+#include <dolfin/common/constants.h>
+#include <dolfin/log/dolfin_log.h>
+#include "Legendre.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+double Legendre::eval(std::size_t n, double x)
+{
+  return boost::math::legendre_p(n, x);
+}
+//-----------------------------------------------------------------------------
+double Legendre::ddx(std::size_t n, double x)
+{
+  dolfin_assert(1.0 - x*x > 0.0);
+  return -boost::math::legendre_p(n, 1, x)/(std::sqrt(1.0 - x*x));
+}
+//-----------------------------------------------------------------------------
+double Legendre::d2dx(std::size_t n, double x)
+{
+  dolfin_assert(1.0 - x*x != 0.0);
+  return boost::math::legendre_p(n, 2, x)/(1.0 - x*x);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/math/Legendre.h b/dolfin/math/Legendre.h
new file mode 100644
index 0000000..381a135
--- /dev/null
+++ b/dolfin/math/Legendre.h
@@ -0,0 +1,48 @@
+// Copyright (C) 2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-06-01
+// Last changed:
+
+#ifndef __LEGENDRE_H
+#define __LEGENDRE_H
+
+#include <cstddef>
+
+namespace dolfin
+{
+
+  /// Interface for computing Legendre polynomials via Boost.
+
+  class Legendre
+  {
+  public:
+
+    /// Evaluate polynomial of order n at point x
+    static double eval(std::size_t n, double x);
+
+    /// Evaluate first derivative of polynomial of order n at point x
+    static double ddx(std::size_t n, double x);
+
+    /// Evaluate second derivative of polynomial of order n at point x
+    static double d2dx(std::size_t n, double x);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/math/basic.cpp b/dolfin/math/basic.cpp
new file mode 100644
index 0000000..37a01b9
--- /dev/null
+++ b/dolfin/math/basic.cpp
@@ -0,0 +1,72 @@
+// Copyright (C) 2003-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2005-2011.
+//
+// First added:  2003-02-06
+// Last changed: 2011-07-01
+
+#include <time.h>
+#include <cstdlib>
+#include <cmath>
+#include <dolfin/common/constants.h>
+#include "basic.h"
+
+using namespace dolfin;
+
+namespace dolfin
+{
+  // Seed only first time
+  bool rand_seeded = false;
+}
+
+//-----------------------------------------------------------------------------
+std::size_t dolfin::ipow(std::size_t a, std::size_t n)
+{
+  std::size_t p = a;
+  for (std::size_t i = 1; i < n; i++)
+    p *= a;
+  return p;
+}
+//-----------------------------------------------------------------------------
+double dolfin::rand()
+{
+  if (!rand_seeded)
+  {
+    unsigned int s = static_cast<long int>(time(0));
+    std::srand(s);
+    rand_seeded = true;
+  }
+  return static_cast<double>(std::rand()) / static_cast<double>(RAND_MAX);
+}
+//-----------------------------------------------------------------------------
+void dolfin::seed(std::size_t s)
+{
+  std::srand(s);
+  rand_seeded = true;
+}
+//-----------------------------------------------------------------------------
+bool dolfin::near(double x, double x0, double eps)
+{
+  return x0 - eps <= x && x <= x0 + eps;
+}
+//-----------------------------------------------------------------------------
+bool dolfin::between(double x, std::pair<double, double> range)
+{
+  return range.first - DOLFIN_EPS <= x && x <= range.second + DOLFIN_EPS;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/math/basic.h b/dolfin/math/basic.h
new file mode 100644
index 0000000..841f507
--- /dev/null
+++ b/dolfin/math/basic.h
@@ -0,0 +1,49 @@
+// Copyright (C) 2003-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2003-02-06
+// Last changed: 2011-07-01
+
+#ifndef __BASIC_H
+#define __BASIC_H
+
+#include <cstddef>
+#include <utility>
+#include <dolfin/common/constants.h>
+
+namespace dolfin
+{
+  /// Return a to the power n
+  std::size_t ipow(std::size_t a, std::size_t n);
+
+  /// Return a random number, uniformly distributed between [0.0, 1.0)
+  double rand();
+
+  /// Seed random number generator
+  void seed(std::size_t s);
+
+  /// Check whether x is close to x0 (to within DOLFIN_EPS)
+  bool near(double x, double x0, double eps=DOLFIN_EPS);
+
+  // FIXME: This should not involve eps. It is 'between' and
+  //        not 'nearly between'.
+  /// Check whether x is between x0 and x1 (inclusive, to within DOLFIN_EPS)
+  bool between(double x, std::pair<double, double> range);
+
+}
+
+#endif
diff --git a/dolfin/math/dolfin_math.h b/dolfin/math/dolfin_math.h
new file mode 100644
index 0000000..d506189
--- /dev/null
+++ b/dolfin/math/dolfin_math.h
@@ -0,0 +1,10 @@
+#ifndef __DOLFIN_MATH_H
+#define __DOLFIN_MATH_H
+
+// DOLFIN math
+
+#include <dolfin/math/basic.h>
+#include <dolfin/math/Lagrange.h>
+#include <dolfin/math/Legendre.h>
+
+#endif
diff --git a/dolfin/mesh/BoundaryComputation.cpp b/dolfin/mesh/BoundaryComputation.cpp
new file mode 100644
index 0000000..b3c606c
--- /dev/null
+++ b/dolfin/mesh/BoundaryComputation.cpp
@@ -0,0 +1,465 @@
+// Copyright (C) 2006-2013 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Jansson 2006.
+// Modified by Ola Skavhaug 2006.
+// Modified by Niclas Jansson 2009.
+// Modified by Oeyvind Evju, 2013
+//
+// First added:  2006-06-21
+// Last changed: 2014-02-06
+
+#include <dolfin/common/timing.h>
+
+#include <dolfin/log/dolfin_log.h>
+#include "BoundaryMesh.h"
+#include "Cell.h"
+#include "Facet.h"
+#include "Mesh.h"
+#include "MeshData.h"
+#include "MeshEditor.h"
+#include "MeshEntity.h"
+#include "MeshFunction.h"
+#include "MeshGeometry.h"
+#include "MeshTopology.h"
+#include "Vertex.h"
+#include "BoundaryComputation.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void BoundaryComputation::compute_boundary(const Mesh& mesh,
+                                           const std::string type,
+                                           BoundaryMesh& boundary)
+{
+  // We iterate over all facets in the mesh and check if they are on
+  // the boundary. A facet is on the boundary if it is connected to
+  // exactly one cell.
+
+  log(TRACE, "Computing boundary mesh.");
+
+  bool exterior = true;
+  bool interior = true;
+  if (type == "exterior")
+    interior = false;
+  else if (type == "interior")
+    exterior = false;
+  else if (type != "local")
+  {
+    dolfin_error("BoundaryComputation.cpp",
+                 "determine boundary mesh type",
+                 "Unknown boundary type (%d)", type.c_str());
+  }
+
+  // Get my MPI process rank and number of MPI processes
+  const std::size_t my_rank = MPI::rank(mesh.mpi_comm());
+  const std::size_t num_processes = MPI::size(mesh.mpi_comm());
+
+  // Open boundary mesh for editing
+  const std::size_t D = mesh.topology().dim();
+  MeshEditor editor;
+  editor.open(boundary, mesh.type().facet_type(), D - 1, mesh.geometry().dim());
+
+  // Generate facet - cell connectivity if not generated
+  mesh.init(D - 1, D);
+
+  // Temporary arrays for assignment of indices to vertices on the boundary
+  std::map<std::size_t, std::size_t> boundary_vertices;
+
+  // Map of index "owners" (process responsible for assigning global index)
+  std::map< std::size_t, std::size_t > global_index_owner;
+
+  // Shared vertices for full mesh
+  // FIXME: const_cast
+  const std::map<unsigned int, std::set<unsigned int> > &
+    shared_vertices = const_cast<Mesh&>(mesh).topology().shared_entities(0);
+
+  // Shared vertices for boundary mesh
+  std::map<unsigned int, std::set<unsigned int> > shared_boundary_vertices;
+  if (exterior)
+  {
+    // Extract shared vertices if vertex is identified as part of globally
+    // exterior facet.
+    std::vector<std::size_t> boundary_global_indices;
+    for (std::map<unsigned int, std::set<unsigned int> >::const_iterator
+        sv_it=shared_vertices.begin(); sv_it != shared_vertices.end(); ++sv_it)
+    {
+      std::size_t local_mesh_index = sv_it->first;
+      Vertex v(mesh, local_mesh_index);
+
+      for (FacetIterator f(v); !f.end(); ++f)
+      {
+        if (f->num_global_entities(D) == 1)
+        {
+          const std::size_t global_mesh_index
+            = mesh.topology().global_indices(0)[local_mesh_index];
+          shared_boundary_vertices[local_mesh_index] = sv_it->second;
+          boundary_global_indices.push_back(global_mesh_index);
+          break;
+        }
+      }
+    }
+
+    // Distribute all shared boundary vertices
+    std::vector<std::vector<std::size_t> > boundary_global_indices_all;
+    MPI::all_gather(mesh.mpi_comm(), boundary_global_indices,
+                     boundary_global_indices_all);
+
+    // Identify and clean up discrepancies between shared vertices of full mesh
+    // and shared vertices of boundary mesh
+    for (auto sbv_it = shared_boundary_vertices.begin();
+         sbv_it != shared_boundary_vertices.end(); )
+    {
+      std::size_t local_mesh_index = sbv_it->first;
+      const std::size_t global_mesh_index
+        = mesh.topology().global_indices(0)[local_mesh_index];
+
+      // Check if this vertex is identified as boundary vertex on
+      // other processes sharing this vertex
+      std::set<unsigned int> &other_processes = sbv_it->second;
+      for (auto  op_it=other_processes.begin();
+           op_it != other_processes.end(); )
+      {
+        // Check if vertex is identified as boundary vertex on process *op_it
+        bool is_boundary_vertex
+          = (std::find(boundary_global_indices_all[*op_it].begin(),
+                      boundary_global_indices_all[*op_it].end(),
+                      global_mesh_index)
+             != boundary_global_indices_all[*op_it].end());
+
+        // Erase item if this is not identified as a boundary vertex
+        // on process *op_it, and increment iterator
+        if (!is_boundary_vertex)
+        {
+          // Erase item while carefully avoiding invalidating the
+          // iterator: First increment it to get the next, valid
+          // iterator, and then erase what it pointed to from
+          // other_processes
+          other_processes.erase(op_it++);
+        }
+        else
+          ++op_it;
+      }
+
+      // Erase item from map if no other processes identify this
+      // vertex as a boundary vertex, and increment iterator
+      if (other_processes.size() == 0)
+      {
+        // Erase carefully as above
+        shared_boundary_vertices.erase(sbv_it++);
+      }
+      else
+        ++sbv_it;
+    }
+  }
+  else
+  {
+    // If interior boundary, shared vertices are the same
+    shared_boundary_vertices = shared_vertices;
+  }
+
+  // Determine boundary facet, count boundary vertices and facets, and
+  // assign vertex indices
+  std::size_t num_boundary_vertices = 0;
+  std::size_t num_owned_vertices = 0;
+  std::size_t num_boundary_cells = 0;
+
+  MeshFunction<bool> boundary_facet(mesh, D - 1, false);
+  for (FacetIterator f(mesh); !f.end(); ++f)
+  {
+    // Boundary facets are connected to exactly one cell
+    if (f->num_entities(D) == 1)
+    {
+      const bool global_exterior_facet =  (f->num_global_entities(D) == 1);
+      if (global_exterior_facet && exterior)
+        boundary_facet[*f] = true;
+      else if (!global_exterior_facet && interior)
+        boundary_facet[*f] = true;
+
+      if (boundary_facet[*f])
+      {
+        // Count boundary vertices and assign indices
+        for (VertexIterator v(*f); !v.end(); ++v)
+        {
+          const std::size_t local_mesh_index = v->index();
+
+          if (boundary_vertices.find(local_mesh_index)
+              == boundary_vertices.end())
+          {
+            const std::size_t local_boundary_index = num_boundary_vertices;
+            boundary_vertices[local_mesh_index] = local_boundary_index;
+
+            // Determine "owner" of global_mesh_index
+            std::size_t owner = my_rank;
+
+            std::map<unsigned int, std::set<unsigned int> >::const_iterator
+              other_processes_it
+              = shared_boundary_vertices.find(local_mesh_index);
+            if (other_processes_it != shared_boundary_vertices.end() && D > 1)
+            {
+              const std::set<unsigned int>& other_processes
+                = other_processes_it->second;
+              const std::size_t min_process
+                = *std::min_element(other_processes.begin(),
+                                    other_processes.end());
+              boundary.topology().shared_entities(0)[local_boundary_index]
+                = other_processes;
+
+              // FIXME: More sophisticated ownership determination
+              if (min_process < owner)
+                owner = min_process;
+            }
+            const std::size_t global_mesh_index
+              = mesh.topology().global_indices(0)[local_mesh_index];
+            global_index_owner[global_mesh_index] = owner;
+
+            // Update counts
+            if (owner == my_rank)
+              num_owned_vertices++;
+            num_boundary_vertices++;
+          }
+        }
+
+        // Count boundary cells (facets of the mesh)
+        num_boundary_cells++;
+      }
+    }
+  }
+
+  // Initiate boundary topology
+  /*
+  boundary.topology().init(0, num_boundary_vertices,
+                           MPI::sum(mesh.mpi_comm(), num_owned_vertices));
+  boundary.topology().init(D - 1, num_boundary_cells,
+                           MPI::sum(mesh.mpi_comm(), num_boundary_cells));
+  */
+
+  // Specify number of vertices and cells
+  editor.init_vertices_global(num_boundary_vertices, MPI::sum(mesh.mpi_comm(),
+                                                              num_owned_vertices));
+  editor.init_cells_global(num_boundary_cells, MPI::sum(mesh.mpi_comm(),
+                                                        num_boundary_cells));
+
+  // Write vertex map
+  MeshFunction<std::size_t>& vertex_map = boundary.entity_map(0);
+  if (num_boundary_vertices > 0)
+    vertex_map.init(boundary, 0, num_boundary_vertices);
+  std::map<std::size_t, std::size_t>::const_iterator it;
+  for (it = boundary_vertices.begin(); it != boundary_vertices.end(); ++it)
+    vertex_map[it->second] = it->first;
+
+  // Get vertex ownership distribution, and find index to start global
+  // numbering from
+  std::vector<std::size_t> ownership_distribution(num_processes);
+  MPI::all_gather(mesh.mpi_comm(), num_owned_vertices, ownership_distribution);
+  std::size_t start_index = 0;
+  for (std::size_t j = 0; j < my_rank; j++)
+    start_index += ownership_distribution[j];
+
+  // Set global indices of owned vertices, request global indices for
+  // vertices owned elsewhere
+  std::map<std::size_t, std::size_t> global_indices;
+  std::vector<std::vector<std::size_t> > request_global_indices(num_processes);
+
+  std::size_t current_index = start_index;
+  for (std::size_t local_boundary_index = 0;
+       local_boundary_index<num_boundary_vertices; local_boundary_index++)
+  {
+    const std::size_t local_mesh_index = vertex_map[local_boundary_index];
+    const std::size_t global_mesh_index
+      = mesh.topology().global_indices(0)[local_mesh_index];
+
+    const std::size_t owner = global_index_owner[global_mesh_index];
+    if (owner != my_rank)
+      request_global_indices[owner].push_back(global_mesh_index);
+    else
+      global_indices[global_mesh_index] = current_index++;
+  }
+
+  // Send and receive requests from other processes
+  std::vector<std::vector<std::size_t> > global_index_requests(num_processes);
+  MPI::all_to_all(mesh.mpi_comm(), request_global_indices,
+                  global_index_requests);
+
+  // Find response to requests of global indices
+  std::vector<std::vector<std::size_t> > respond_global_indices(num_processes);
+  for (std::size_t i = 0; i < num_processes; i++)
+  {
+    const std::size_t N = global_index_requests[i].size();
+    respond_global_indices[i].resize(N);
+
+    for (std::size_t j = 0; j < N; j++)
+      respond_global_indices[i][j]
+        = global_indices[global_index_requests[i][j]];
+  }
+
+  // Scatter responses back to requesting processes
+  std::vector<std::vector<std::size_t> > global_index_responses(num_processes);
+  MPI::all_to_all(mesh.mpi_comm(), respond_global_indices,
+                  global_index_responses);
+
+  // Update global_indices
+  for (std::size_t i = 0; i < num_processes; i++)
+  {
+    const std::size_t N = global_index_responses[i].size();
+    // Check that responses are the same size as the requests made
+    dolfin_assert(global_index_responses[i].size()
+                  == request_global_indices[i].size());
+    for (std::size_t j = 0; j < N; j++)
+    {
+      const std::size_t global_mesh_index = request_global_indices[i][j];
+      const std::size_t global_boundary_index = global_index_responses[i][j];
+      global_indices[global_mesh_index] = global_boundary_index;
+    }
+  }
+
+  // Create vertices
+  for (std::size_t local_boundary_index = 0;
+       local_boundary_index < num_boundary_vertices; local_boundary_index++)
+  {
+    const std::size_t local_mesh_index = vertex_map[local_boundary_index];
+    const std::size_t global_mesh_index
+      = mesh.topology().global_indices(0)[local_mesh_index];
+    const std::size_t global_boundary_index = global_indices[global_mesh_index];
+
+    Vertex v(mesh, local_mesh_index);
+
+    editor.add_vertex_global(local_boundary_index, global_boundary_index,
+                             v.point());
+  }
+
+  // Find global index to start cell numbering from for current process
+  std::vector<std::size_t> cell_distribution(num_processes);
+  MPI::all_gather(mesh.mpi_comm(), num_boundary_cells, cell_distribution);
+  std::size_t start_cell_index = 0;
+  for (std::size_t i = 0; i < my_rank; i++)
+    start_cell_index += cell_distribution[i];
+
+  // Create cells (facets) and map between boundary mesh cells and facets parent
+  MeshFunction<std::size_t>& cell_map = boundary.entity_map(D - 1);
+  if (num_boundary_cells > 0)
+    cell_map.init(boundary, D - 1, num_boundary_cells);
+  std::vector<std::size_t>
+    cell(boundary.type().num_vertices(boundary.topology().dim()));
+  std::size_t current_cell = 0;
+  for (FacetIterator f(mesh); !f.end(); ++f)
+  {
+    if (boundary_facet[*f])
+    {
+      // Compute new vertex numbers for cell
+      const unsigned int* vertices = f->entities(0);
+      for (std::size_t i = 0; i < cell.size(); i++)
+        cell[i] = boundary_vertices[vertices[i]];
+
+      // Reorder vertices so facet is right-oriented w.r.t. facet
+      // normal
+      reorder(cell, *f);
+
+      // Create mapping from boundary cell to mesh facet if requested
+      if (!cell_map.empty())
+        cell_map[current_cell] = f->index();
+
+      // Add cell
+      editor.add_cell(current_cell, start_cell_index+current_cell, cell);
+      current_cell++;
+    }
+  }
+
+  // Close mesh editor. Note the argument order=false to prevent
+  // ordering from destroying the orientation of facets accomplished
+  // by calling reorder() below.
+  editor.close(false);
+}
+//-----------------------------------------------------------------------------
+void BoundaryComputation::reorder(std::vector<std::size_t>& vertices,
+                                  const Facet& facet)
+{
+  // Get mesh
+  const Mesh& mesh = facet.mesh();
+
+  // Get the vertex opposite to the facet (the one we remove)
+  std::size_t vertex = 0;
+  const Cell cell(mesh, facet.entities(mesh.topology().dim())[0]);
+  for (std::size_t i = 0; i < cell.num_entities(0); i++)
+  {
+    bool not_in_facet = true;
+    vertex = cell.entities(0)[i];
+    for (std::size_t j = 0; j < facet.num_entities(0); j++)
+    {
+      if (vertex == facet.entities(0)[j])
+      {
+        not_in_facet = false;
+        break;
+      }
+    }
+    if (not_in_facet)
+      break;
+  }
+  const Point p = mesh.geometry().point(vertex);
+
+  // Check orientation
+  switch (mesh.type().cell_type())
+  {
+  case CellType::interval:
+    // Do nothing
+    break;
+  case CellType::triangle:
+    {
+      dolfin_assert(facet.num_entities(0) == 2);
+
+      const Point p0 = mesh.geometry().point(facet.entities(0)[0]);
+      const Point p1 = mesh.geometry().point(facet.entities(0)[1]);
+      const Point v = p1 - p0;
+      const Point n(v.y(), -v.x());
+
+      if (n.dot(p0 - p) < 0.0)
+      {
+        const std::size_t tmp = vertices[0];
+        vertices[0] = vertices[1];
+        vertices[1] = tmp;
+      }
+    }
+    break;
+  case CellType::tetrahedron:
+    {
+      dolfin_assert(facet.num_entities(0) == 3);
+
+      const Point p0 = mesh.geometry().point(facet.entities(0)[0]);
+      const Point p1 = mesh.geometry().point(facet.entities(0)[1]);
+      const Point p2 = mesh.geometry().point(facet.entities(0)[2]);
+      const Point v1 = p1 - p0;
+      const Point v2 = p2 - p0;
+      const Point n  = v1.cross(v2);
+
+      if (n.dot(p0 - p) < 0.0)
+      {
+        const std::size_t tmp = vertices[0];
+        vertices[0] = vertices[1];
+        vertices[1] = tmp;
+      }
+    }
+    break;
+  default:
+    {
+      dolfin_error("BoundaryComputation.cpp",
+                   "reorder cell for extraction of mesh boundary",
+                   "Unknown cell type (%d)",
+                   mesh.type().cell_type());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/BoundaryComputation.h b/dolfin/mesh/BoundaryComputation.h
new file mode 100644
index 0000000..13267be
--- /dev/null
+++ b/dolfin/mesh/BoundaryComputation.h
@@ -0,0 +1,63 @@
+// Copyright (C) 2006-20013 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson 2009.
+//
+// First added:  2006-06-21
+// Last changed: 2013-02-21
+
+#ifndef __BOUNDARY_COMPUTATION_H
+#define __BOUNDARY_COMPUTATION_H
+
+#include <string>
+#include <vector>
+
+namespace dolfin
+{
+
+  class BoundaryMesh;
+  class Facet;
+  class Mesh;
+  template <typename T> class MeshFunction;
+
+  /// This class implements provides a set of basic algorithms for
+  /// the computation of boundaries.
+
+  class BoundaryComputation
+  {
+  public:
+
+    /// Compute the exterior boundary of a given mesh
+    static void compute_boundary(const Mesh& mesh,
+                                          const std::string type,
+                                          BoundaryMesh& boundary);
+
+    /// Compute the boundary of a given mesh
+    static void compute_boundary_common(const Mesh& mesh,
+					                              BoundaryMesh& boundary,
+					                              bool interior_boundary);
+
+  private:
+
+    /// Reorder vertices so facet is right-oriented w.r.t. facet normal
+    static void reorder(std::vector<std::size_t>& vertices, const Facet& facet);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/BoundaryMesh.cpp b/dolfin/mesh/BoundaryMesh.cpp
new file mode 100644
index 0000000..e05d409
--- /dev/null
+++ b/dolfin/mesh/BoundaryMesh.cpp
@@ -0,0 +1,82 @@
+// Copyright (C) 2006-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson 2009.
+// Modified by Joachim B Haga 2012.
+//
+// First added:  2006-06-21
+// Last changed: 2012-09-05
+
+#include <iostream>
+
+#include <dolfin/log/log.h>
+#include "BoundaryComputation.h"
+#include "BoundaryMesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+BoundaryMesh::BoundaryMesh(const Mesh& mesh, std::string type, bool order)
+  : Mesh()
+{
+  // Create boundary mesh
+  BoundaryComputation::compute_boundary(mesh, type, *this);
+
+  // Order mesh if requested
+  if (order)
+    this->order();
+}
+//-----------------------------------------------------------------------------
+BoundaryMesh::~BoundaryMesh()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+MeshFunction<std::size_t>& BoundaryMesh::entity_map(std::size_t d)
+{
+  if (d == 0)
+    return _vertex_map;
+  else if (d == this->topology().dim())
+    return _cell_map;
+  else
+  {
+    dolfin_error("BoundaryMesh.cpp",
+                 "access entity map (from boundary mesh underlying mesh",
+                 "Can only access vertex and cells maps");
+  }
+
+  // Return something to keep compilers happy, code is never reached
+  return _cell_map;
+}
+//-----------------------------------------------------------------------------
+const MeshFunction<std::size_t>& BoundaryMesh::entity_map(std::size_t d) const
+{
+  if (d == 0)
+    return _vertex_map;
+  else if (d == this->topology().dim())
+    return _cell_map;
+  else
+  {
+    dolfin_error("BoundaryMesh.cpp",
+                 "access entity map (from boundary mesh underlying mesh",
+                 "Can only access vertex and cells maps");
+  }
+
+  // Return something to keep compilers happy, code is never reached
+  return _cell_map;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/BoundaryMesh.h b/dolfin/mesh/BoundaryMesh.h
new file mode 100644
index 0000000..8e75f0e
--- /dev/null
+++ b/dolfin/mesh/BoundaryMesh.h
@@ -0,0 +1,86 @@
+// Copyright (C) 2006-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson 2009.
+// Modified by Joachim B Haga 2012.
+//
+// First added:  2006-06-21
+// Last changed: 2012-10-30
+
+#ifndef __BOUNDARY_MESH_H
+#define __BOUNDARY_MESH_H
+
+#include <string>
+#include "MeshFunction.h"
+#include "Mesh.h"
+
+namespace dolfin
+{
+
+  /// A BoundaryMesh is a mesh over the boundary of some given mesh.
+  /// The cells of the boundary mesh (facets of the original mesh) are
+  /// oriented to produce outward pointing normals relative to the
+  /// original mesh.
+
+  class BoundaryMesh : public Mesh
+  {
+  public:
+
+    /// Create boundary mesh from given mesh.
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         Another _Mesh_ object.
+    ///     type (_std::string_)
+    ///         The type of BoundaryMesh, which can be "exterior",
+    ///         "interior" or "local". "exterior" is the globally
+    ///         external boundary, "interior" is the inter-process mesh
+    ///         and "local" is the boudary of the local (this process)
+    ///         mesh.
+    ///     order (bool)
+    ///         Optional argument which can be used to control whether
+    ///         or not the boundary mesh should be ordered according
+    ///         to the UFC ordering convention. If set to false, the
+    ///         boundary mesh will be ordered with right-oriented
+    ///         facets (outward-pointing unit normals). The default
+    ///         value is true.
+    BoundaryMesh(const Mesh& mesh, std::string type, bool order=true);
+
+    /// Destructor
+    ~BoundaryMesh();
+
+    /// Get index map for entities of dimension d in the boundary mesh
+    /// to the entity in the original full mesh
+    MeshFunction<std::size_t>& entity_map(std::size_t d);
+
+    /// Get index map for entities of dimension d in the boundary mesh
+    /// to the entity in the original full mesh (const version)
+    const MeshFunction<std::size_t>& entity_map(std::size_t d) const;
+
+  private:
+
+    BoundaryMesh() {}
+
+    MeshFunction<std::size_t> _cell_map;
+
+    MeshFunction<std::size_t> _vertex_map;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/Cell.h b/dolfin/mesh/Cell.h
new file mode 100644
index 0000000..16b8646
--- /dev/null
+++ b/dolfin/mesh/Cell.h
@@ -0,0 +1,407 @@
+// Copyright (C) 2006-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman 2006.
+// Modified by Andre Massing 2009.
+// Modified by Garth N. Wells 2010.
+// Modified by Jan Blechta 2013
+//
+// First added:  2006-06-01
+// Last changed: 2014-02-16
+
+#ifndef __CELL_H
+#define __CELL_H
+
+#include <memory>
+
+#include <dolfin/geometry/Point.h>
+#include "CellType.h"
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshEntityIteratorBase.h"
+#include "MeshFunction.h"
+#include <dolfin/geometry/CollisionDetection.h>
+#include <dolfin/geometry/IntersectionTriangulation.h>
+
+namespace dolfin
+{
+
+  /// A Cell is a _MeshEntity_ of topological codimension 0.
+
+  class Cell : public MeshEntity
+  {
+  public:
+
+    /// Create empty cell
+    Cell() : MeshEntity() {}
+
+    /// Create cell on given mesh with given index
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     index (std::size_t)
+    ///         The index.
+    Cell(const Mesh& mesh, std::size_t index)
+      : MeshEntity(mesh, mesh.topology().dim(), index) {}
+
+    /// Destructor
+    ~Cell() {}
+
+    /// Return type of cell
+    CellType::Type type() const
+    { return _mesh->type().cell_type(); }
+
+    /// Compute orientation of cell
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Orientation of the cell (0 is 'up'/'right', 1 is 'down'/'left')
+    std::size_t orientation() const
+    { return _mesh->type().orientation(*this); }
+
+    /// Compute orientation of cell relative to given 'up' direction
+    ///
+    /// *Arguments*
+    ///     up (_Point_)
+    ///         The direction defined as 'up'
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Orientation of the cell (0 is 'same', 1 is 'opposite')
+    std::size_t orientation(const Point& up) const
+    { return _mesh->type().orientation(*this, up); }
+
+    /// Compute (generalized) volume of cell
+    ///
+    /// *Returns*
+    ///     double
+    ///         The volume of the cell.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitSquare mesh(1, 1);
+    ///         Cell cell(mesh, 0);
+    ///         info("%g", cell.volume());
+    ///
+    ///     output::
+    ///
+    ///         0.5
+    double volume() const
+    { return _mesh->type().volume(*this); }
+
+    /// Compute diameter of cell
+    ///
+    /// *Returns*
+    ///     double
+    ///         The diameter of the cell.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitSquare mesh(1, 1);
+    ///         Cell cell(mesh, 0);
+    ///         info("%g", cell.diameter());
+    ///
+    ///     output::
+    ///
+    ///         1.41421
+    double diameter() const
+    { return _mesh->type().diameter(*this); }
+
+    /// Compute inradius of cell
+    ///
+    /// *Returns*
+    ///     double
+    ///         Radius of the sphere inscribed in the cell.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitSquare mesh(1, 1);
+    ///         Cell cell(mesh, 0);
+    ///         info("%g", cell.inradius());
+    ///
+    ///     output::
+    ///
+    ///         0.29289
+    double inradius() const
+    {
+      // We would need facet areas
+      _mesh->init(_mesh->type().dim() - 1);
+
+      return _mesh->type().inradius(*this);
+    }
+
+    /// Compute ratio of inradius to circumradius times dim for cell.
+    /// Useful as cell quality measure. Returns 1. for equilateral
+    /// and 0. for degenerate cell.
+    /// See Jonathan Richard Shewchuk: What Is a Good Linear Finite Element?,
+    /// online: http://www.cs.berkeley.edu/~jrs/papers/elemj.pdf
+    ///
+    /// *Returns*
+    ///     double
+    ///         cell_dimension * inradius / circumradius
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitSquare mesh(1, 1);
+    ///         Cell cell(mesh, 0);
+    ///         info("%g", cell.radius_ratio());
+    ///
+    ///     output::
+    ///
+    ///         0.828427
+    double radius_ratio() const
+    {
+      // We would need facet areas
+      _mesh->init(_mesh->type().dim() - 1);
+
+      return _mesh->type().radius_ratio(*this);
+    }
+
+    /// Compute squared distance to given point.
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point.
+    /// *Returns*
+    ///     double
+    ///         The squared distance to the point.
+    double squared_distance(const Point& point) const
+    { return _mesh->type().squared_distance(*this, point); }
+
+    /// Compute distance to given point.
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point.
+    /// *Returns*
+    ///     double
+    ///         The distance to the point.
+    double distance(const Point& point) const
+    {
+      return sqrt(squared_distance(point));
+    }
+
+    /// Compute component i of normal of given facet with respect to the cell
+    ///
+    /// *Arguments*
+    ///     facet (std::size_t)
+    ///         Index of facet.
+    ///     i (std::size_t)
+    ///         Component.
+    ///
+    /// *Returns*
+    ///     double
+    ///         Component i of the normal of the facet.
+    double normal(std::size_t facet, std::size_t i) const
+    { return _mesh->type().normal(*this, facet, i); }
+
+    /// Compute normal of given facet with respect to the cell
+    ///
+    /// *Arguments*
+    ///     facet (std::size_t)
+    ///         Index of facet.
+    ///
+    /// *Returns*
+    ///     _Point_
+    ///         Normal of the facet.
+    Point normal(std::size_t facet) const
+    { return _mesh->type().normal(*this, facet); }
+
+    /// Compute normal to cell itself (viewed as embedded in 3D)
+    ///
+    /// *Returns*
+    ///     _Point_
+    ///         Normal of the cell
+    Point cell_normal() const
+    { return _mesh->type().cell_normal(*this); }
+
+    /// Compute the area/length of given facet with respect to the cell
+    ///
+    /// *Arguments*
+    ///     facet (std::size_t)
+    ///         Index of the facet.
+    ///
+    /// *Returns*
+    ///     double
+    ///         Area/length of the facet.
+    double facet_area(std::size_t facet) const
+    { return _mesh->type().facet_area(*this, facet); }
+
+    /// Order entities locally
+    ///
+    /// *Arguments*
+    ///     global_vertex_indices (_std::vector<std::size_t>_)
+    ///         The global vertex indices.
+    void order(const std::vector<std::size_t>& local_to_global_vertex_indices)
+    { _mesh->type().order(*this, local_to_global_vertex_indices); }
+
+    /// Check if entities are ordered
+    ///
+    /// *Arguments*
+    ///     global_vertex_indices (_std::vector<std::size_t>)
+    ///         The global vertex indices.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff ordered.
+    bool ordered(const std::vector<std::size_t>& local_to_global_vertex_indices) const
+    { return _mesh->type().ordered(*this, local_to_global_vertex_indices); }
+
+    /// Check whether given point is contained in cell. This function is
+    /// identical to the function collides(point).
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point to be checked.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff point is contained in cell.
+    bool contains(const Point& point) const
+    { return CollisionDetection::collides(*this, point); }
+
+    /// Check whether given point collides with cell
+    ///
+    /// *Arguments*
+    ///     point (_Point_)
+    ///         The point to be checked.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff point collides with cell.
+    bool collides(const Point& point) const
+    { return CollisionDetection::collides(*this, point); }
+
+    /// Check whether given entity collides with cell
+    ///
+    /// *Arguments*
+    ///     entity (_MeshEntity_)
+    ///         The cell to be checked.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True iff entity collides with cell.
+    bool collides(const MeshEntity& entity) const
+    { return CollisionDetection::collides(*this, entity); }
+
+    /// Compute triangulation of intersection with given entity
+    ///
+    /// *Arguments*
+    ///     entity (_MeshEntity_)
+    ///         The entity with which to intersect.
+    ///
+    /// *Returns*
+    ///     std::vector<double>
+    ///         A flattened array of simplices of dimension
+    ///         num_simplices x num_vertices x gdim =
+    ///         num_simplices x (tdim + 1) x gdim
+    std::vector<double>
+    triangulate_intersection(const MeshEntity& entity) const
+    { return IntersectionTriangulation::triangulate_intersection(*this, entity); }
+
+    // FIXME: This function is part of a UFC transition
+    /// Get cell vertex coordinates
+    void get_vertex_coordinates(std::vector<double>& coordinates) const
+    {
+      const std::size_t gdim = _mesh->geometry().dim();
+      const std::size_t num_vertices = this->num_entities(0);
+      const unsigned int* vertices = this->entities(0);
+      coordinates.resize(num_vertices*gdim);
+      for (std::size_t i = 0; i < num_vertices; i++)
+        for (std::size_t j = 0; j < gdim; j++)
+          coordinates[i*gdim + j] = _mesh->geometry().x(vertices[i])[j];
+    }
+
+    // FIXME: This function is part of a UFC transition
+    /// Fill UFC cell with miscellaneous data
+    void get_cell_data(ufc::cell& ufc_cell, int local_facet=-1) const
+    {
+      ufc_cell.geometric_dimension = _mesh->geometry().dim();;
+      ufc_cell.local_facet = local_facet;
+      ufc_cell.orientation = _mesh->cell_orientations()[index()];
+      ufc_cell.mesh_identifier = mesh_id();
+      ufc_cell.index = index();
+    }
+
+    // FIXME: This function is part of a UFC transition
+    /// Fill UFC cell with topology data
+    void get_cell_topology(ufc::cell& ufc_cell) const
+    {
+      const MeshTopology& topology = _mesh->topology();
+
+      const std::size_t tdim = topology.dim();
+      ufc_cell.topological_dimension = tdim;
+      ufc_cell.orientation = _mesh->cell_orientations()[index()];
+
+      ufc_cell.entity_indices.resize(tdim + 1);
+      for (std::size_t d = 0; d < tdim; d++)
+      {
+        ufc_cell.entity_indices[d].resize(num_entities(d));
+        if (topology.have_global_indices(d))
+        {
+          const std::vector<std::size_t>& global_indices
+            = topology.global_indices(d);
+          for (std::size_t i = 0; i < num_entities(d); ++i)
+            ufc_cell.entity_indices[d][i] = global_indices[entities(d)[i]];
+        }
+        else
+        {
+          for (std::size_t i = 0; i < num_entities(d); ++i)
+            ufc_cell.entity_indices[d][i] = entities(d)[i];
+        }
+      }
+      ufc_cell.entity_indices[tdim].resize(1);
+
+      ufc_cell.entity_indices[tdim][0] = index();
+
+      // FIXME: Using the local cell index is inconsistent with UFC, but
+      //        necessary to make DOLFIN run
+      // Local cell index
+      ufc_cell.index = ufc_cell.entity_indices[tdim][0];
+    }
+
+  };
+
+  /// A CellIterator is a MeshEntityIterator of topological codimension 0.
+  typedef MeshEntityIteratorBase<Cell> CellIterator;
+
+  /// A CellFunction is a MeshFunction of topological codimension 0.
+  template <typename T> class CellFunction : public MeshFunction<T>
+  {
+  public:
+
+    CellFunction(const Mesh& mesh)
+      : MeshFunction<T>(mesh, mesh.topology().dim()) {}
+
+    CellFunction(std::shared_ptr<const Mesh> mesh)
+      : MeshFunction<T>(mesh, mesh->topology().dim()) {}
+
+    CellFunction(const Mesh& mesh, const T& value)
+      : MeshFunction<T>(mesh, mesh.topology().dim(), value) {}
+
+    CellFunction(std::shared_ptr<const Mesh> mesh, const T& value)
+      : MeshFunction<T>(mesh, mesh->topology().dim(), value) {}
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/CellType.cpp b/dolfin/mesh/CellType.cpp
new file mode 100644
index 0000000..e7fd6a7
--- /dev/null
+++ b/dolfin/mesh/CellType.cpp
@@ -0,0 +1,335 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristoffer Selim 2008
+// Modified by Andre Massing 2010
+// Modified by Jan Blechta 2013
+//
+// First added:  2006-06-05
+// Last changed: 2013-02-21
+
+#include <algorithm>
+
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/dolfin_log.h>
+#include "Cell.h"
+#include "CellType.h"
+#include "IntervalCell.h"
+#include "MeshFunction.h"
+#include "PointCell.h"
+#include "TetrahedronCell.h"
+#include "TriangleCell.h"
+#include "Vertex.h"
+
+using namespace dolfin;
+
+namespace dolfin
+{
+
+  // Comparison operator for sorting based on global indices
+  class GlobalSort
+  {
+  public:
+
+    GlobalSort(const std::vector<std::size_t>& local_to_global_vertex_indices)
+        : g(local_to_global_vertex_indices) {}
+
+    bool operator() (const std::size_t& l, const std::size_t& r)
+    { return g[l] < g[r]; }
+
+    const std::vector<std::size_t>& g;
+
+  };
+
+}
+
+//-----------------------------------------------------------------------------
+CellType::CellType(Type cell_type, Type facet_type)
+  : _cell_type(cell_type), _facet_type(facet_type)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+CellType::~CellType()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+CellType* CellType::create(Type type)
+{
+  switch ( type )
+  {
+  case point:
+    return new PointCell();
+  case interval:
+    return new IntervalCell();
+  case triangle:
+    return new TriangleCell();
+  case tetrahedron:
+    return new TetrahedronCell();
+  default:
+    dolfin_error("CellType.cpp",
+                 "create cell type",
+                 "Unknown cell type (%d)", type);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+CellType* CellType::create(std::string type)
+{
+  return create(string2type(type));
+}
+//-----------------------------------------------------------------------------
+CellType::Type CellType::string2type(std::string type)
+{
+  if (type == "interval")
+    return interval;
+  else if (type == "triangle")
+    return triangle;
+  else if (type == "tetrahedron")
+    return tetrahedron;
+  else
+  {
+    dolfin_error("CellType.cpp",
+                 "convert string to cell type",
+                 "Unknown cell type (\"%s\")", type.c_str());
+  }
+
+  return interval;
+}
+//-----------------------------------------------------------------------------
+std::string CellType::type2string(Type type)
+{
+  switch (type)
+  {
+  case point:
+    return "point";
+  case interval:
+    return "interval";
+  case triangle:
+    return "triangle";
+  case tetrahedron:
+    return "tetrahedron";
+  default:
+    dolfin_error("CellType.cpp",
+                 "convert cell type to string",
+                 "Unknown cell type (\"%d\")", type);
+  }
+
+  return "";
+}
+//-----------------------------------------------------------------------------
+bool CellType::ordered(const Cell& cell, const std::vector<std::size_t>&
+                       local_to_global_vertex_indices) const
+{
+  // Get mesh topology
+  const MeshTopology& topology = cell.mesh().topology();
+  const std::size_t dim = topology.dim();
+  const std::size_t c = cell.index();
+
+  // Get vertices
+  const std::size_t num_vertices = topology(dim, 0).size(c);
+  const unsigned int* vertices = topology(dim, 0)(c);
+  dolfin_assert(vertices);
+
+  // Check that vertices are in ascending order
+  if (!increasing(num_vertices, vertices, local_to_global_vertex_indices))
+    return false;
+
+  // Note the comparison below: d + 1 < dim, not d < dim - 1
+  // Otherwise, d < dim - 1 will evaluate to true for dim = 0 with std::size_t
+
+  // Check numbering of entities of positive dimension and codimension
+  for (std::size_t d = 1; d + 1 < dim; d++)
+  {
+    // Check if entities exist, otherwise skip
+    const MeshConnectivity& connectivity = topology(d, 0);
+    if (connectivity.empty())
+      continue;
+
+    // Get entities
+    const std::size_t num_entities = topology(dim, d).size(c);
+    const unsigned int* entities = topology(dim, d)(c);
+
+    // Iterate over entities
+    for (std::size_t e = 1; e < num_entities; e++)
+    {
+      // Get vertices for first entity
+      const std::size_t  e0 = entities[e - 1];
+      const std::size_t  n0 = connectivity.size(e0);
+      const unsigned int* v0 = connectivity(e0);
+
+      // Get vertices for second entity
+      const std::size_t  e1 = entities[e];
+      const std::size_t  n1 = connectivity.size(e1);
+      const unsigned int* v1 = connectivity(e1);
+
+      // Check ordering of entities
+      if (!increasing(n0, v0, n1, v1, num_vertices, vertices,
+                      local_to_global_vertex_indices))
+        return false;
+    }
+  }
+
+  return true;
+}
+//-----------------------------------------------------------------------------
+void CellType::sort_entities(std::size_t num_vertices,
+                             unsigned int* local_vertices,
+                             const std::vector<std::size_t>&
+                             local_to_global_vertex_indices)
+{
+  // Two cases here, either sort vertices directly (when running in
+  // serial) or sort based on the global indices (when running in
+  // parallel)
+
+  // Sort on global vertex indices
+  GlobalSort global_sort(local_to_global_vertex_indices);
+  std::sort(local_vertices, local_vertices + num_vertices, global_sort);
+}
+//-----------------------------------------------------------------------------
+bool CellType::increasing(std::size_t num_vertices,
+                          const unsigned int* local_vertices,
+                          const std::vector<std::size_t>&
+                          local_to_global_vertex_indices)
+{
+  // Two cases here, either check vertices directly (when running in serial)
+  // or check based on the global indices (when running in parallel)
+
+  for (std::size_t v = 1; v < num_vertices; v++)
+    if (local_to_global_vertex_indices[local_vertices[v - 1]] >= local_to_global_vertex_indices[local_vertices[v]])
+      return false;
+  return true;
+}
+//-----------------------------------------------------------------------------
+bool CellType::increasing(std::size_t n0, const unsigned int* v0,
+                          std::size_t n1, const unsigned int* v1,
+                          std::size_t num_vertices,
+                          const unsigned int* local_vertices,
+               const std::vector<std::size_t>& local_to_global_vertex_indices)
+{
+  dolfin_assert(n0 == n1);
+  dolfin_assert(num_vertices > n0);
+  const std::size_t num_non_incident = num_vertices - n0;
+
+  // Compute non-incident vertices for first entity
+  std::vector<std::size_t> w0(num_non_incident);
+  std::size_t k = 0;
+  for (std::size_t i = 0; i < num_vertices; i++)
+  {
+    const std::size_t v = local_vertices[i];
+    bool incident = false;
+    for (std::size_t j = 0; j < n0; j++)
+    {
+      if (v0[j] == v)
+      {
+        incident = true;
+        break;
+      }
+    }
+    if (!incident)
+      w0[k++] = v;
+  }
+  dolfin_assert(k == num_non_incident);
+
+  // Compute non-incident vertices for second entity
+  std::vector<std::size_t> w1(num_non_incident);
+  k = 0;
+  for (std::size_t i = 0; i < num_vertices; i++)
+  {
+    const std::size_t v = local_vertices[i];
+    bool incident = false;
+    for (std::size_t j = 0; j < n1; j++)
+    {
+      if (v1[j] == v)
+      {
+        incident = true;
+        break;
+      }
+    }
+
+    if (!incident)
+      w1[k++] = v;
+  }
+  dolfin_assert(k == num_non_incident);
+
+  // Compare lexicographic ordering of w0 and w1
+  for (std::size_t i = 0; i < num_non_incident; i++)
+  {
+    if (local_to_global_vertex_indices[w0[i]]
+        < local_to_global_vertex_indices[w1[i]])
+    {
+      return true;
+    }
+    else if (local_to_global_vertex_indices[w0[i]]
+             > local_to_global_vertex_indices[w1[i]])
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+//-----------------------------------------------------------------------------
+std::size_t CellType::orientation(const Cell& cell, const Point& up) const
+{
+  Point n = cell.cell_normal();
+  return (n.dot(up) < 0.0 ? 1 : 0);
+}
+//-----------------------------------------------------------------------------
+double CellType::inradius(const Cell& cell) const
+{
+  // Check cell type
+  if (_cell_type != interval && _cell_type != triangle
+      && _cell_type != tetrahedron)
+  {
+    dolfin_error("Cell.h",
+                 "compute cell inradius",
+                 "formula not implemented for non-simplicial cells");
+  }
+
+  // Pick dim
+  const size_t d = dim();
+
+  // Compute volume
+  const double V = volume(cell);
+
+  // Handle degenerate case
+  if (V == 0.0) {return 0.0;}
+
+  // Compute total area of facets
+  double A = 0;
+  for (std::size_t i = 0; i <= d; i++)
+    A += facet_area(cell, i);
+
+  // See Jonathan Richard Shewchuk: What Is a Good Linear Finite Element?,
+  // online: http://www.cs.berkeley.edu/~jrs/papers/elemj.pdf
+  return d*V/A;
+}
+//-----------------------------------------------------------------------------
+double CellType::radius_ratio(const Cell& cell) const
+{
+  const double r = inradius(cell);
+
+  // Handle degenerate case
+  if (r == 0.0)
+    return 0.0;
+  else
+    return 2.0*dim()*r/diameter(cell);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/CellType.h b/dolfin/mesh/CellType.h
new file mode 100644
index 0000000..adf451a
--- /dev/null
+++ b/dolfin/mesh/CellType.h
@@ -0,0 +1,175 @@
+// Copyright (C) 2006-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristoffer Selim 2008
+// Modified by Andre Massing 2009-2010
+// Modified by Jan Blechta 2013
+//
+// First added:  2006-06-05
+// Last changed: 2014-01-06
+
+#ifndef __CELL_TYPE_H
+#define __CELL_TYPE_H
+
+#include <string>
+#include <vector>
+
+namespace dolfin
+{
+
+  class Cell;
+  class MeshEditor;
+  class MeshEntity;
+  template <typename T> class MeshFunction;
+  class Point;
+
+  /// This class provides a common interface for different cell types.
+  /// Each cell type implements mesh functionality that is specific to
+  /// a certain type of cell.
+
+  class CellType
+  {
+  public:
+
+    /// Enum for different cell types
+    enum Type { point, interval, triangle, tetrahedron };
+
+    /// Constructor
+    CellType(Type cell_type, Type facet_type);
+
+    /// Destructor
+    virtual ~CellType();
+
+    /// Create cell type from type (factory function)
+    static CellType* create(Type type);
+
+    /// Create cell type from string (factory function)
+    static CellType* create(std::string type);
+
+    /// Convert from string to cell type
+    static Type string2type(std::string type);
+
+    /// Convert from cell type to string
+    static std::string type2string(Type type);
+
+    /// Return type of cell
+    Type cell_type() const { return _cell_type; }
+
+    /// Return type of cell for facets
+    Type facet_type() const { return _facet_type; }
+
+    /// Return topological dimension of cell
+    virtual std::size_t dim() const = 0;
+
+    /// Return number of entitites of given topological dimension
+    virtual std::size_t num_entities(std::size_t dim) const = 0;
+
+    /// Return number of vertices for entity of given topological dimension
+    virtual std::size_t num_vertices(std::size_t dim) const = 0;
+
+    /// Return orientation of the cell (assuming flat space)
+    virtual std::size_t orientation(const Cell& cell) const = 0;
+
+    /// Return orientation of the cell relative to given up direction
+    std::size_t orientation(const Cell& cell, const Point& up) const;
+
+    /// Create entities e of given topological dimension from vertices v
+    virtual void create_entities(std::vector<std::vector<unsigned int> >& e,
+                                 std::size_t dim, const unsigned int* v) const = 0;
+
+    /// Refine cell uniformly
+    virtual void refine_cell(Cell& cell, MeshEditor& editor,
+                             std::size_t& current_cell) const = 0;
+
+    /// Compute (generalized) volume of mesh entity
+    virtual double volume(const MeshEntity& entity) const = 0;
+
+    /// Compute diameter of mesh entity
+    virtual double diameter(const MeshEntity& entity) const = 0;
+
+    /// Compute inradius of cell
+    virtual double inradius(const Cell& cell) const;
+
+    /// Compute dim*inradius/circumradius for given cell
+    virtual double radius_ratio(const Cell& cell) const;
+
+    /// Compute squared distance to given point
+    virtual double squared_distance(const Cell& cell, const Point& point) const = 0;
+
+    /// Compute component i of normal of given facet with respect to the cell
+    virtual double normal(const Cell& cell, std::size_t facet, std::size_t i) const = 0;
+
+    /// Compute of given facet with respect to the cell
+    virtual Point normal(const Cell& cell, std::size_t facet) const = 0;
+
+    /// Compute normal to given cell (viewed as embedded in 3D)
+    virtual Point cell_normal(const Cell& cell) const = 0;
+
+    /// Compute the area/length of given facet with respect to the cell
+    virtual double facet_area(const Cell& cell, std::size_t facet) const = 0;
+
+    // FIXME: The order() function should be reimplemented and use one common
+    // FIXME: implementation for all cell types, just as we have for ordered()
+
+    /// Order entities locally
+    virtual void order(Cell& cell,
+            const std::vector<std::size_t>& local_to_global_vertex_indices) const = 0;
+
+    /// Check if entities are ordered
+    bool ordered(const Cell& cell,
+                 const std::vector<std::size_t>& local_to_global_vertex_indices) const;
+
+    /// Check whether given point collides with cell
+    virtual bool collides(const Cell& cell, const Point& point) const = 0;
+
+    /// Check whether given entity collides with cell
+    virtual bool collides(const Cell& cell, const MeshEntity& entity) const = 0;
+
+    /// Compute triangulation of intersection of two cells
+    virtual std::vector<double>
+    triangulate_intersection(const Cell& c0, const Cell& c1) const = 0;
+
+    /// Return description of cell type
+    virtual std::string description(bool plural) const = 0;
+
+  protected:
+
+    Type _cell_type;
+    Type _facet_type;
+
+    // Sort vertices based on global entity indices
+    static void sort_entities(std::size_t num_vertices,
+                      unsigned int* vertices,
+                      const std::vector<std::size_t>& local_to_global_vertex_indices);
+
+  private:
+
+    // Check if list of vertices is increasing
+    static bool increasing(std::size_t num_vertices, const unsigned int* vertices,
+                     const std::vector<std::size_t>& local_to_global_vertex_indices);
+
+    // Check that <entity e0 with vertices v0> <= <entity e1 with vertices v1>
+    static bool increasing(std::size_t n0, const unsigned int* v0,
+                       std::size_t n1,     const unsigned int* v1,
+                       std::size_t num_vertices, const unsigned int* vertices,
+                       const std::vector<std::size_t>& local_to_global_vertex_indices);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/DistributedMeshTools.cpp b/dolfin/mesh/DistributedMeshTools.cpp
new file mode 100644
index 0000000..4b0a6dd
--- /dev/null
+++ b/dolfin/mesh/DistributedMeshTools.cpp
@@ -0,0 +1,1062 @@
+// Copyright (C) 2011-2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2011
+//
+// First added:  2011-09-17
+// Last changed: 2013-01-29
+
+#include "dolfin/common/MPI.h"
+#include "dolfin/common/Timer.h"
+#include "dolfin/log/log.h"
+#include "BoundaryMesh.h"
+#include "Facet.h"
+#include "Mesh.h"
+#include "MeshEntityIterator.h"
+#include "MeshFunction.h"
+#include "Vertex.h"
+
+#include "DistributedMeshTools.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void DistributedMeshTools::number_entities(const Mesh& mesh, std::size_t d)
+{
+  Timer timer("Build mesh number mesh entities");
+
+  // Return if global entity indices have already been calculated
+  if (mesh.topology().have_global_indices(d))
+    return;
+
+  // Const-cast to allow data to be attached
+  Mesh& _mesh = const_cast<Mesh&>(mesh);
+
+  if (MPI::size(mesh.mpi_comm()) == 1)
+  {
+    mesh.init(d);
+
+    // Set global entity numbers in mesh
+    _mesh.topology().init(d, mesh.num_entities(d), mesh.num_entities(d));
+    _mesh.topology().init_global_indices(d, mesh.num_entities(d));
+    for (MeshEntityIterator e(mesh, d); !e.end(); ++e)
+      _mesh.topology().set_global_index(d, e->index(), e->index());
+
+    return;
+  }
+
+  // Get shared entities map
+  std::map<unsigned int, std::set<unsigned int> >&
+    shared_entities = _mesh.topology().shared_entities(d);
+
+  // Number entities
+  std::vector<std::size_t> global_entity_indices;
+  const std::map<unsigned int, std::pair<unsigned int, unsigned int> >
+    slave_entities;
+  const std::size_t num_global_entities = number_entities(mesh, slave_entities,
+                                                          global_entity_indices,
+                                                          shared_entities, d);
+
+  // Set global entity numbers in mesh
+  _mesh.topology().init(d, mesh.num_entities(d), num_global_entities);
+  _mesh.topology().init_global_indices(d, global_entity_indices.size());
+  for (std::size_t i = 0; i < global_entity_indices.size(); ++i)
+    _mesh.topology().set_global_index(d, i, global_entity_indices[i]);
+}
+//-----------------------------------------------------------------------------
+std::size_t DistributedMeshTools::number_entities(
+  const Mesh& mesh,
+  const std::map<unsigned int, std::pair<unsigned int,
+  unsigned int> >& slave_entities,
+  std::vector<std::size_t>& global_entity_indices,
+  std::map<unsigned int, std::set<unsigned int> >& shared_entities,
+  std::size_t d)
+{
+  // Developer note: This function should use global_vertex_indices for
+  // the global mesh indices and *not* access these through the mesh. In
+  // some cases special numbering is passed in which differs from mesh
+  // global numbering, e.g. when computing mesh entity numbering for
+  // problems with periodic boundary conditions.
+
+  Timer timer("PARALLEL x: Number mesh entities");
+
+  // Check that we're not re-numbering vertices (these are fixed at
+  // mesh construction)
+  if (d == 0)
+  {
+    dolfin_error("MeshPartitioning.cpp",
+                 "number mesh entities",
+                 "Gloval vertex indices exist at input. Cannot be renumbered");
+  }
+
+  // Check that we're not re-numbering cells (these are fixed at mesh
+  // construction)
+  if (d == mesh.topology().dim())
+  {
+    shared_entities.clear();
+    global_entity_indices = mesh.topology().global_indices(d);
+    return mesh.size_global(d);
+
+    /*
+    dolfin_error("MeshPartitioning.cpp",
+                 "number mesh entities",
+                 "Global cells indices exist at input. Cannot be renumbered");
+    */
+  }
+
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  // Get number of processes and process number
+  const std::size_t num_processes = MPI::size(mpi_comm);
+  const std::size_t process_number = MPI::rank(mpi_comm);
+
+  // Initialize entities of dimension d locally
+  mesh.init(d);
+
+  // Build list of slave entities to exclude from ownership computation
+  std::vector<bool> exclude(mesh.num_entities(d), false);
+  std::map<unsigned int, std::pair<unsigned int,
+                                   unsigned int> >::const_iterator s;
+  for (s = slave_entities.begin(); s != slave_entities.end(); ++s)
+    exclude[s->first] = true;
+
+  // Build entity global [vertex list]-to-[local entity index]
+  // map. Exclude any slave entities.
+  std::map<std::vector<std::size_t>, unsigned int> entities;
+  std::pair<std::vector<std::size_t>, unsigned int> entity;
+  for (MeshEntityIterator e(mesh, d); !e.end(); ++e)
+  {
+    const std::size_t local_index = e->index();
+    if (!exclude[local_index])
+    {
+      entity.second = local_index;
+      entity.first = std::vector<std::size_t>();
+      for (VertexIterator vertex(*e); !vertex.end(); ++vertex)
+        entity.first.push_back(vertex->global_index());
+      std::sort(entity.first.begin(), entity.first.end());
+      entities.insert(entity);
+    }
+  }
+
+  // Get vertex global indices
+  const std::vector<std::size_t>& global_vertex_indices
+    = mesh.topology().global_indices(0);
+
+  // Get shared vertices (local index, [sharing processes])
+  const std::map<unsigned int, std::set<unsigned int> >& shared_vertices_local
+                            = mesh.topology().shared_entities(0);
+
+  // Compute ownership of entities of dimension d ([entity vertices], data):
+  //  [0]: owned and shared (will be numbered by this process, and number
+  //       communicated to other processes)
+  //  [1]: not owned but shared (will be numbered by another process, and number
+  //       communicated to this processes)
+  boost::array<std::map<Entity, EntityData>, 2> entity_ownership;
+  std::vector<std::size_t> owned_entities;
+  compute_entity_ownership(mpi_comm, entities, shared_vertices_local,
+                           global_vertex_indices, d, owned_entities,
+                           entity_ownership);
+
+  // Split shared entities for convenience
+  const std::map<Entity, EntityData>& owned_shared_entities
+    = entity_ownership[0];
+  std::map<Entity, EntityData>& unowned_shared_entities = entity_ownership[1];
+
+  // Number of entities 'owned' by this process
+  const std::size_t num_local_entities = owned_entities.size()
+                                       + owned_shared_entities.size();
+
+  // Compute global number of entities and local process offset
+  const std::pair<std::size_t, std::size_t> num_global_entities
+    = compute_num_global_entities(mpi_comm, num_local_entities, num_processes,
+                                  process_number);
+
+  // Extract offset
+  std::size_t offset = num_global_entities.second;
+
+  // Prepare list of global entity numbers. Check later that nothing
+  // is equal to std::numeric_limits<std::size_t>::max()
+  global_entity_indices = std::vector<std::size_t>(mesh.size(d),
+                               std::numeric_limits<std::size_t>::max());
+
+  std::map<Entity, EntityData>::const_iterator it;
+
+  // Number exlusively owned entities
+  for (std::size_t i = 0; i < owned_entities.size(); ++i)
+    global_entity_indices[owned_entities[i]] = offset++;
+
+  // Number shared entities that this process is responsible for
+  // numbering
+  std::map<Entity, EntityData>::const_iterator it1;
+  for (it1 = owned_shared_entities.begin();
+       it1 != owned_shared_entities.end(); ++it1)
+  {
+    global_entity_indices[it1->second.local_index] = offset++;
+  }
+
+  // Communicate indices for shared entities (owned by this process)
+  // and get indices for shared but not owned entities
+  std::vector<std::vector<std::size_t> > send_values(num_processes);
+  std::vector<std::size_t> destinations;
+  for (it1 = owned_shared_entities.begin();
+       it1 != owned_shared_entities.end(); ++it1)
+  {
+    // Get entity index
+    const unsigned int local_entity_index = it1->second.local_index;
+    const std::size_t global_entity_index
+      = global_entity_indices[local_entity_index];
+    dolfin_assert(global_entity_index
+                  != std::numeric_limits<std::size_t>::max());
+
+    // Get entity processes (processes sharing the entity)
+    const std::vector<unsigned int>& entity_processes = it1->second.processes;
+
+    // Get entity vertices (global vertex indices)
+    const Entity& e = it1->first;
+
+    // Prepare data for sending
+    for (std::size_t j = 0; j < entity_processes.size(); ++j)
+    {
+      // Store interleaved: entity index, number of vertices, global
+      // vertex indices
+      std::size_t p = entity_processes[j];
+      send_values[p].push_back(global_entity_index);
+      send_values[p].push_back(e.size());
+      send_values[p].insert(send_values[p].end(), e.begin(), e.end());
+    }
+  }
+
+  // Send data
+  std::vector<std::vector<std::size_t> > received_values;
+  MPI::all_to_all(mpi_comm, send_values, received_values);
+
+  // Fill in global entity indices received from lower ranked
+  // processes
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    for (std::size_t i = 0; i < received_values[p].size();)
+    {
+      const std::size_t global_index = received_values[p][i++];
+      const std::size_t entity_size = received_values[p][i++];
+      Entity e;
+      for (std::size_t j = 0; j < entity_size; ++j)
+        e.push_back(received_values[p][i++]);
+
+      // Access unowned entity data
+      std::map<Entity, EntityData>::const_iterator recv_entity;
+      recv_entity = unowned_shared_entities.find(e);
+
+      // Sanity check, should not receive an entity we don't need
+      if (recv_entity == unowned_shared_entities.end())
+      {
+        std::stringstream msg;
+        msg << "Process " << MPI::rank(mpi_comm)
+            << " received illegal entity given by ";
+        msg << " with global index " << global_index;
+        msg << " from process " << p;
+        dolfin_error("MeshPartitioning.cpp",
+                     "number mesh entities",
+                     msg.str());
+      }
+
+      const std::size_t local_entity_index = recv_entity->second.local_index;
+      dolfin_assert(global_entity_indices[local_entity_index]
+                    == std::numeric_limits<std::size_t>::max());
+      global_entity_indices[local_entity_index] = global_index;
+    }
+  }
+
+  // Get slave indices from master
+  {
+    std::vector<std::vector<std::size_t> >
+      slave_send_buffer(MPI::size(mpi_comm));
+    std::vector<std::vector<std::size_t> >
+      local_slave_index(MPI::size(mpi_comm));
+    for (s = slave_entities.begin(); s != slave_entities.end(); ++s)
+    {
+      // Local index on remote process
+      slave_send_buffer[s->second.first].push_back(s->second.second);
+
+      // Local index on this
+      local_slave_index[s->second.first].push_back(s->first);
+    }
+    std::vector<std::vector<std::size_t> > slave_receive_buffer;
+    MPI::all_to_all(mpi_comm, slave_send_buffer, slave_receive_buffer);
+
+    // Send back master indices
+    for (std::size_t p = 0; p < slave_receive_buffer.size(); ++p)
+    {
+      slave_send_buffer[p].clear();
+      for (std::size_t i = 0; i < slave_receive_buffer[p].size(); ++i)
+      {
+        const std::size_t local_master = slave_receive_buffer[p][i];
+        slave_send_buffer[p].push_back(global_entity_indices[local_master]);
+      }
+    }
+    MPI::all_to_all(mpi_comm, slave_send_buffer, slave_receive_buffer);
+
+    // Set slave indices to received master indices
+    for (std::size_t p = 0; p < slave_receive_buffer.size(); ++p)
+    {
+      for (std::size_t i = 0; i < slave_receive_buffer[p].size(); ++i)
+      {
+        const std::size_t slave_index = local_slave_index[p][i];
+        global_entity_indices[slave_index] = slave_receive_buffer[p][i];
+      }
+    }
+  }
+
+  // Sanity check
+  for (std::size_t i = 0; i < global_entity_indices.size(); ++i)
+  {
+    dolfin_assert(global_entity_indices[i]
+                  != std::numeric_limits<std::size_t>::max());
+  }
+
+  // Build shared_entities (global index, [sharing processes])
+  shared_entities.clear();
+  std::map<Entity, EntityData>::const_iterator e;
+  for (e = owned_shared_entities.begin(); e != owned_shared_entities.end(); ++e)
+  {
+    const EntityData& ed = e->second;
+    shared_entities[ed.local_index]
+      = std::set<unsigned int>(ed.processes.begin(),
+                               ed.processes.end());
+  }
+  for (e = unowned_shared_entities.begin();
+       e != unowned_shared_entities.end(); ++e)
+  {
+    const EntityData& ed = e->second;
+    shared_entities[ed.local_index]
+      = std::set<unsigned int>(ed.processes.begin(),
+                               ed.processes.end());
+  }
+
+  // Return number of global entities
+  return num_global_entities.first;
+}
+//-----------------------------------------------------------------------------
+std::map<std::size_t, std::set<std::pair<std::size_t, std::size_t> > >
+DistributedMeshTools::locate_off_process_entities(const std::vector<std::size_t>& entity_indices,
+                                                  std::size_t dim,
+                                                  const Mesh& mesh)
+{
+  if (dim == 0)
+  {
+    warning("DistributedMeshTools::host_processes has not been tested for vertices.");
+  }
+
+  // Mesh topology dim
+  const std::size_t D = mesh.topology().dim();
+
+  // Check that entity is a vertex or a cell
+  if (dim != 0 && dim != D)
+  {
+    dolfin_error("DistributedMeshTools.cpp",
+                 "compute off-process indices",
+                 "This version of DistributedMeshTools::host_processes is only for vertices or cells");
+  }
+
+  // Check that global numbers have been computed.
+  if (!mesh.topology().have_global_indices(dim))
+  {
+    dolfin_error("DistributedMeshTools.cpp",
+                 "compute off-process indices",
+                 "Global mesh entity numbers have not been computed");
+  }
+
+  // Check that global numbers have been computed.
+  if (!mesh.topology().have_global_indices(D))
+  {
+    dolfin_error("DistributedMeshTools.cpp",
+                 "compute off-process indices",
+                 "Global mesh entity numbers have not been computed");
+  }
+
+  // Get global cell entity indices on this process
+  const std::vector<std::size_t> global_entity_indices
+      = mesh.topology().global_indices(dim);
+
+  dolfin_assert(global_entity_indices.size() == mesh.num_cells());
+
+  // Prepare map to hold process numbers
+  std::map<std::size_t, std::set<std::pair<std::size_t, std::size_t> > >
+    processes;
+
+  // FIXME: work on optimising below code
+
+  // List of indices to send
+  std::vector<std::size_t> my_entities;
+
+  // Remove local cells from my_entities to reduce communication
+  if (dim == D)
+  {
+    // In order to fill vector my_entities...
+    // build and populate a local set for non-local cells
+    std::set<std::size_t> set_of_my_entities(entity_indices.begin(),
+                                             entity_indices.end());
+
+    // FIXME: This can be made more efficient by exploiting fact that
+    //        set is sorted
+    // Remove local cells from set_of_my_entities to reduce communication
+    for (std::size_t j = 0; j < global_entity_indices.size(); ++j)
+      set_of_my_entities.erase(global_entity_indices[j]);
+
+    // Copy entries from set_of_my_entities to my_entities
+    my_entities = std::vector<std::size_t>(set_of_my_entities.begin(),
+                                           set_of_my_entities.end());
+  }
+  else
+    my_entities = entity_indices;
+
+  // FIXME: handle case when my_entities.empty()
+  //dolfin_assert(!my_entities.empty());
+
+  // Prepare data structures for send/receive
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+  const std::size_t num_proc = MPI::size(mpi_comm);
+  const std::size_t proc_num = MPI::rank(mpi_comm);
+  const std::size_t max_recv = MPI::max(mpi_comm, my_entities.size());
+  std::vector<std::size_t> off_process_entities(max_recv);
+
+  // Send and receive data
+  for (std::size_t k = 1; k < num_proc; ++k)
+  {
+    const std::size_t src  = (proc_num - k + num_proc) % num_proc;
+    const std::size_t dest = (proc_num + k) % num_proc;
+    MPI::send_recv(mpi_comm, my_entities, dest, off_process_entities, src);
+
+    const std::size_t recv_entity_count = off_process_entities.size();
+
+    // Check if this process owns received entities, and if so
+    // store local index
+    std::vector<std::size_t> my_hosted_entities;
+    {
+      // Build a temporary map hosting global_entity_indices
+      std::map<std::size_t, std::size_t> map_of_global_entity_indices;
+      for (std::size_t j = 0; j < global_entity_indices.size(); j++)
+        map_of_global_entity_indices[global_entity_indices[j]] = j;
+
+      for (std::size_t j = 0; j < recv_entity_count; j++)
+      {
+        // Check if this process hosts 'received_entity'
+        const std::size_t received_entity = off_process_entities[j];
+        std::map<std::size_t, std::size_t>::const_iterator it;
+        it = map_of_global_entity_indices.find(received_entity);
+        if (it != map_of_global_entity_indices.end())
+        {
+          const std::size_t local_index = it->second;
+          my_hosted_entities.push_back(received_entity);
+          my_hosted_entities.push_back(local_index);
+        }
+      }
+    }
+
+    // Send/receive hosted cells
+    const std::size_t max_recv_host_proc
+      = MPI::max(mpi_comm, my_hosted_entities.size());
+    std::vector<std::size_t> host_processes(max_recv_host_proc);
+    MPI::send_recv(mpi_comm, my_hosted_entities, src, host_processes, dest);
+
+    const std::size_t recv_hostproc_count = host_processes.size();
+    for (std::size_t j = 0; j < recv_hostproc_count; j += 2)
+    {
+      const std::size_t global_index = host_processes[j];
+      const std::size_t local_index  = host_processes[j + 1];
+      processes[global_index].insert(std::make_pair(dest, local_index));
+    }
+
+    // FIXME: Do later for efficiency
+    // Remove entries from entities (from my_entities) that cannot
+    // reside on more processes (i.e., cells)
+  }
+
+  // Sanity check
+  const std::set<std::size_t> test_set(my_entities.begin(), my_entities.end());
+  const std::size_t number_expected = test_set.size();
+  if (number_expected != processes.size())
+  {
+    dolfin_error("DistributedMeshTools.cpp",
+                 "compute off-process indices",
+                 "Sanity check failed");
+  }
+
+  return processes;
+}
+//-----------------------------------------------------------------------------
+boost::unordered_map<unsigned int, std::vector<std::pair<unsigned int, unsigned int> > >
+  DistributedMeshTools::compute_shared_entities(const Mesh& mesh, std::size_t d)
+{
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+  const unsigned int comm_size = MPI::size(mpi_comm);
+
+  // Return empty set if running in serial
+  if (MPI::size(mpi_comm) == 1)
+  {
+    return boost::unordered_map<unsigned int, std::vector<std::pair<unsigned int, unsigned int> > >();
+  }
+
+  // Initialize entities of dimension d
+  mesh.init(d);
+
+  // Number entities (globally)
+  number_entities(mesh, d);
+
+  // Get shared entities to processes map
+  const std::map<unsigned int, std::set<unsigned int> >&
+    shared_entities = mesh.topology().shared_entities(d);
+
+  // Get local-to-global indices map
+  const std::vector<std::size_t>& global_indices_map
+    = mesh.topology().global_indices(d);
+
+  // Global-to-local map for each process
+  boost::unordered_map<std::size_t, boost::unordered_map<std::size_t, std::size_t> > global_to_local;
+
+  // Pack global indices for sending to sharing processes
+  std::vector<std::vector<std::size_t> > send_indices(comm_size);
+  std::vector<std::vector<std::size_t> > local_sent_indices(comm_size);
+  std::map<unsigned int, std::set<unsigned int> >::const_iterator shared_entity;
+  for (shared_entity = shared_entities.begin();
+       shared_entity != shared_entities.end(); ++shared_entity)
+  {
+    // Local index
+    const unsigned int local_index = shared_entity->first;
+
+    // Global index
+    dolfin_assert(local_index < global_indices_map.size());
+    std::size_t global_index = global_indices_map[local_index];
+
+    // Destinarion process
+    const std::set<unsigned int>& sharing_processes = shared_entity->second;
+
+    // Pack data for sending and build global-to-local map
+    std::set<unsigned int>::const_iterator dest;
+    for (dest = sharing_processes.begin(); dest != sharing_processes.end();
+         ++dest)
+    {
+      send_indices[*dest].push_back(global_index);
+      local_sent_indices[*dest].push_back(local_index);
+      global_to_local[*dest].insert(std::make_pair(global_index, local_index));
+    }
+  }
+
+  std::vector<std::vector<std::size_t> > recv_entities;
+  MPI::all_to_all(mpi_comm, send_indices, recv_entities);
+
+  // Clear send data
+  send_indices.clear();
+  send_indices.resize(comm_size);
+
+  // Determine local entities indices for received global entity indices
+  boost::unordered_map<std::size_t, std::vector<std::size_t> >::const_iterator
+    received_global_indices;
+  for (std::size_t p = 0; p < recv_entities.size(); ++p)
+  {
+    // Get process number of neighbour
+    const std::size_t sending_proc = p;
+
+    if (recv_entities[p].size() > 0)
+    {
+      // Get global-to-local map for neighbour process
+      boost::unordered_map<std::size_t, boost::unordered_map<std::size_t, std::size_t> >::const_iterator
+        it = global_to_local.find(sending_proc);
+      dolfin_assert(it != global_to_local.end());
+      const boost::unordered_map<std::size_t, std::size_t>&
+        neighbour_global_to_local = it->second;
+
+      // Build vector of local indices
+      const std::vector<std::size_t>& global_indices_recv
+        = recv_entities[p];
+      for (std::size_t i = 0; i < global_indices_recv.size(); ++i)
+      {
+        // Global index
+        const std::size_t global_index = global_indices_recv[i];
+
+        // Find local index corresponding to global index
+        boost::unordered_map<std::size_t, std::size_t>::const_iterator
+          n_global_to_local = neighbour_global_to_local.find(global_index);
+
+        dolfin_assert(n_global_to_local != neighbour_global_to_local.end());
+        const std::size_t my_local_index = n_global_to_local->second;
+        send_indices[sending_proc].push_back(my_local_index);
+      }
+    }
+  }
+
+  MPI::all_to_all(mpi_comm, send_indices, recv_entities);
+
+  // Build map
+  boost::unordered_map<unsigned int, std::vector<std::pair<unsigned int, unsigned int> > >
+    shared_local_indices_map;
+
+  // Loop over data received from each process
+  boost::unordered_map<std::size_t, std::vector<std::size_t> >::const_iterator
+    received_local_indices;
+  for (std::size_t p = 0; p < recv_entities.size(); ++p)
+  {
+    if (recv_entities[p].size() > 0)
+    {
+      // Process that shares entities
+      const std::size_t proc = p;
+
+      // Local indices on sharing process
+      const std::vector<std::size_t>& neighbour_local_indices
+        = recv_entities[p];
+
+      // Local indices on this process
+      const std::vector<std::size_t>& my_local_indices = local_sent_indices[p];
+
+      // Check that sizes match
+      dolfin_assert(my_local_indices.size() == neighbour_local_indices.size());
+
+      for (std::size_t i = 0; i < neighbour_local_indices.size(); ++i)
+      {
+        shared_local_indices_map[my_local_indices[i]].push_back(std::make_pair(proc,
+                                                                               neighbour_local_indices[i]));
+      }
+    }
+  }
+
+  return shared_local_indices_map;
+}
+//-----------------------------------------------------------------------------
+void DistributedMeshTools::compute_entity_ownership(
+  const MPI_Comm mpi_comm,
+  const std::map<std::vector<std::size_t>, unsigned int>& entities,
+  const std::map<unsigned int, std::set<unsigned int> >& shared_vertices_local,
+  const std::vector<std::size_t>& global_vertex_indices,
+  std::size_t d,
+  std::vector<std::size_t>& owned_entities,
+  boost::array<std::map<Entity, EntityData>, 2>& shared_entities)
+{
+  // Build global-to-local indices map for shared vertices
+  std::map<std::size_t, std::set<unsigned int> > shared_vertices;
+  std::map<unsigned int, std::set<unsigned int> >::const_iterator v;
+  for (v = shared_vertices_local.begin(); v != shared_vertices_local.end(); ++v)
+  {
+    dolfin_assert(v->first < global_vertex_indices.size());
+    shared_vertices.insert(std::make_pair(global_vertex_indices[v->first],
+                                          v->second));
+  }
+
+  // Entity ownership list ([entity vertices], data):
+  //  [0]: owned and shared (will be numbered by this process, and number
+  //       communicated to other processes)
+  //  [1]: not owned but shared (will be numbered by another process, and number
+  //       communicated to this processes)
+
+  // Compute preliminary ownership lists (shared_entities) without
+  // communication
+  compute_preliminary_entity_ownership(mpi_comm, shared_vertices, entities,
+                                       owned_entities, shared_entities);
+
+  // Qualify boundary entities. We need to find out if the shared
+  // (shared with lower ranked process) entities are entities of a
+  // lower ranked process.  If not, this process becomes the lower
+  // ranked process for the entity in question, and is therefore
+  // responsible for communicating values to the higher ranked
+  // processes (if any).
+  compute_final_entity_ownership(mpi_comm, owned_entities, shared_entities);
+}
+//-----------------------------------------------------------------------------
+void DistributedMeshTools::compute_preliminary_entity_ownership(
+  const MPI_Comm mpi_comm,
+  const std::map<std::size_t, std::set<unsigned int> >& shared_vertices,
+  const std::map<Entity, unsigned int>& entities,
+  std::vector<std::size_t>& owned_entities,
+  boost::array<std::map<Entity, EntityData>, 2>& shared_entities)
+{
+  // Entities
+  std::map<Entity, EntityData>& owned_shared_entities = shared_entities[0];
+  std::map<Entity, EntityData>& unowned_shared_entities = shared_entities[1];
+
+  // Clear maps
+  owned_entities.clear();
+  owned_shared_entities.clear();
+  unowned_shared_entities.clear();
+
+  // Get my process number
+  const std::size_t process_number = MPI::rank(mpi_comm);
+
+  // Iterate over all local entities
+  std::map<std::vector<std::size_t>,  unsigned int>::const_iterator it;
+  for (it = entities.begin(); it != entities.end(); ++it)
+  {
+    const Entity& entity = it->first;
+    const std::size_t local_entity_index = it->second;
+
+    // Compute which processes entity is shared with
+    std::vector< unsigned int> entity_processes;
+    if (is_shared(entity, shared_vertices))
+    {
+      // Processes sharing first vertex of entity
+      std::vector<std::size_t>
+        intersection(shared_vertices.find(entity[0])->second.begin(),
+                     shared_vertices.find(entity[0])->second.end());
+      std::vector<std::size_t>::iterator intersection_end = intersection.end();
+
+      // Loop over entity vertices
+      for (std::size_t i = 1; i < entity.size(); ++i)
+      {
+        // Global vertex index
+        const std::size_t v = entity[i];
+
+        // Sharing processes
+        const std::set< unsigned int>& shared_vertices_v
+          = shared_vertices.find(v)->second;
+
+        intersection_end
+          = std::set_intersection(intersection.begin(), intersection_end,
+                                  shared_vertices_v.begin(),
+                                  shared_vertices_v.end(),
+                                  intersection.begin());
+      }
+      entity_processes = std::vector< unsigned int>(intersection.begin(),
+                                                    intersection_end);
+    }
+
+    // Check if entity is master, slave or shared but not owned (shared
+    // with lower ranked process)
+    bool shared_but_not_owned = false;
+    for (std::size_t i = 0; i < entity_processes.size(); ++i)
+    {
+      if (entity_processes[i] < process_number)
+      {
+        shared_but_not_owned = true;
+        break;
+      }
+    }
+
+    if (entity_processes.empty())
+    {
+      owned_entities.push_back(local_entity_index);
+    }
+    else if (shared_but_not_owned)
+    {
+      unowned_shared_entities[entity] = EntityData(local_entity_index,
+                                                   entity_processes);
+    }
+    else
+    {
+      owned_shared_entities[entity] = EntityData(local_entity_index,
+                                                 entity_processes);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void DistributedMeshTools::compute_final_entity_ownership(
+  const MPI_Comm mpi_comm,
+  std::vector<std::size_t>& owned_entities,
+  boost::array<std::map<Entity, EntityData>, 2>& shared_entities)
+{
+  // Entities ([entity vertices], index) to be numbered
+  std::map<Entity, EntityData>& owned_shared_entities = shared_entities[0];
+  std::map<Entity, EntityData>& unowned_shared_entities = shared_entities[1];
+
+  // Get MPI number of processes and process number
+  const std::size_t num_processes = MPI::size(mpi_comm);
+  const std::size_t process_number = MPI::rank(mpi_comm);
+
+  // Communicate common entities, starting with the entities we think
+  // are shared but not owned
+  std::vector<std::vector<std::size_t> >
+    send_common_entity_values(num_processes);
+  for (std::map<Entity, EntityData>::const_iterator it
+         = unowned_shared_entities.begin(); it != unowned_shared_entities.end();
+       ++it)
+  {
+    // Get entity vertices (global vertex indices)
+    const Entity& entity = it->first;
+
+    // Get entity processes (processes that might share the entity)
+    const std::vector<unsigned int>& entity_processes = it->second.processes;
+
+    // Prepare data for sending
+    for (std::size_t j = 0; j < entity_processes.size(); ++j)
+    {
+      const std::size_t p = entity_processes[j];
+      send_common_entity_values[p].push_back(entity.size());
+      send_common_entity_values[p].insert(send_common_entity_values[p].end(),
+                                          entity.begin(), entity.end());
+    }
+  }
+
+  // Communicate common entities, add the entities we think are owned
+  // and shared
+  for (std::map<Entity, EntityData>::const_iterator it
+         = owned_shared_entities.begin();
+       it != owned_shared_entities.end(); ++it)
+  {
+    // Get entity vertices (global vertex indices)
+    const Entity& entity = it->first;
+
+    // Get entity processes (processes that might share the entity)
+    const std::vector<unsigned int>& entity_processes = it->second.processes;
+
+    // Prepare data for sending
+    for (std::size_t j = 0; j < entity_processes.size(); ++j)
+    {
+      const unsigned int p = entity_processes[j];
+      dolfin_assert(process_number < p);
+      send_common_entity_values[p].push_back(entity.size());
+      send_common_entity_values[p].insert(send_common_entity_values[p].end(),
+                                          entity.begin(), entity.end());
+    }
+  }
+
+  // Communicate common entities
+  std::vector<std::vector<std::size_t> > received_common_entity_values;
+  MPI::all_to_all(mpi_comm, send_common_entity_values,
+                  received_common_entity_values);
+
+  // Check if entities received are really entities
+  std::vector<std::vector<std::size_t> > send_is_entity_values(num_processes);
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    for (std::size_t i = 0; i < received_common_entity_values[p].size();)
+    {
+      // Get entity
+      const std::size_t entity_size = received_common_entity_values[p][i++];
+      Entity entity;
+      for (std::size_t j = 0; j < entity_size; ++j)
+        entity.push_back(received_common_entity_values[p][i++]);
+
+      // Check if received really is an entity on this process (in which
+      // case it will be in owned or unowned entities)
+      bool is_entity = false;
+      if (unowned_shared_entities.find(entity) != unowned_shared_entities.end()
+          || owned_shared_entities.find(entity) != owned_shared_entities.end())
+      {
+        is_entity = true;
+      }
+
+      // Add information about entity (whether it's actually an
+      // entity) to send to other processes
+      send_is_entity_values[p].push_back(entity_size);
+      for (std::size_t j = 0; j < entity_size; ++j)
+        send_is_entity_values[p].push_back(entity[j]);
+      send_is_entity_values[p].push_back(is_entity);
+    }
+  }
+
+  // Send data back (list of requested entities that are really entities)
+  std::vector<std::vector<std::size_t> > received_is_entity_values;
+  MPI::all_to_all(mpi_comm, send_is_entity_values, received_is_entity_values);
+
+  // Create map from entities to processes where it is an entity
+  std::map<Entity, std::vector<unsigned int> > entity_processes;
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    for (std::size_t i = 0; i < received_is_entity_values[p].size();)
+    {
+      const std::size_t entity_size = received_is_entity_values[p][i++];
+      Entity entity;
+      for (std::size_t j = 0; j < entity_size; ++j)
+        entity.push_back(received_is_entity_values[p][i++]);
+      const std::size_t is_entity = received_is_entity_values[p][i++];
+      if (is_entity == 1)
+      {
+        // Add entity since it is actually an entity for process p
+        entity_processes[entity].push_back(p);
+      }
+    }
+  }
+
+  // Fix the list of entities we do not own (numbered by lower ranked
+  // process)
+  std::vector<std::vector<std::size_t> > unignore_entities;
+  std::map<Entity, EntityData>::iterator entity;
+  for (entity = unowned_shared_entities.begin();
+       entity != unowned_shared_entities.end(); ++entity)
+  {
+    const Entity& entity_vertices = entity->first;
+    EntityData& entity_data = entity->second;
+    const unsigned int local_entity_index = entity_data.local_index;
+    if (entity_processes.find(entity_vertices) != entity_processes.end())
+    {
+      const std::vector<unsigned int>& common_processes
+        = entity_processes[entity_vertices];
+      dolfin_assert(!common_processes.empty());
+      const std::size_t min_proc = *(std::min_element(common_processes.begin(),
+                                                      common_processes.end()));
+
+      if (process_number < min_proc)
+      {
+        // Move from unowned to owned
+        owned_shared_entities[entity_vertices] = EntityData(local_entity_index,
+                                                            common_processes);
+
+        // Add entity to list of entities that should be removed from
+        // the unowned entity list.
+        unignore_entities.push_back(entity_vertices);
+      }
+      else
+        entity_data.processes = common_processes;
+    }
+    else
+    {
+      // Move from unowned to owned exclusively
+      owned_entities.push_back(local_entity_index);
+
+      // Add entity to list of entities that should be removed from the
+      // shared but not owned entity list
+      unignore_entities.push_back(entity_vertices);
+    }
+  }
+
+  // Remove unowned shared entities that should not be shared
+  for (std::size_t i = 0; i < unignore_entities.size(); ++i)
+    unowned_shared_entities.erase(unignore_entities[i]);
+
+  // Fix the list of entities we share
+  std::vector<std::vector<std::size_t> > unshare_entities;
+  for (std::map<Entity, EntityData>::iterator it
+         = owned_shared_entities.begin();
+       it != owned_shared_entities.end(); ++it)
+  {
+    const Entity& e = it->first;
+    const unsigned int local_entity_index = it->second.local_index;
+    if (entity_processes.find(e) == entity_processes.end())
+    {
+      // Move from shared to owned elusively
+      owned_entities.push_back(local_entity_index);
+      unshare_entities.push_back(e);
+    }
+    else
+    {
+      // Update processor list of shared entities
+      it->second.processes = entity_processes[e];
+    }
+  }
+
+  // Remove shared entities that should not be shared
+  for (std::size_t i = 0; i < unshare_entities.size(); ++i)
+    owned_shared_entities.erase(unshare_entities[i]);
+}
+//-----------------------------------------------------------------------------
+bool DistributedMeshTools::is_shared(const Entity& entity,
+         const std::map<std::size_t, std::set<unsigned int> >& shared_vertices)
+{
+  // Iterate over entity vertices
+  Entity::const_iterator e;
+  for (e = entity.begin(); e != entity.end(); ++e)
+  {
+    // Return false if an entity vertex is not in the list (map) of
+    // shared entities
+    if (shared_vertices.find(*e) == shared_vertices.end())
+      return false;
+  }
+  return true;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+DistributedMeshTools::compute_num_global_entities(const MPI_Comm mpi_comm,
+                                                  std::size_t num_local_entities,
+                                                  std::size_t num_processes,
+                                                  std::size_t process_number)
+{
+  // Communicate number of local entities
+  std::vector<std::size_t> num_entities_to_number;
+  MPI::all_gather(mpi_comm, num_local_entities, num_entities_to_number);
+
+  // Compute offset
+  const std::size_t offset
+    = std::accumulate(num_entities_to_number.begin(),
+                      num_entities_to_number.begin() + process_number, 
+                      (std::size_t)0);
+
+  // Compute number of global entities
+  const std::size_t num_global = std::accumulate(num_entities_to_number.begin(),
+                                                 num_entities_to_number.end(),
+                                                 (std::size_t)0);
+
+  return std::make_pair(num_global, offset);
+}
+//-----------------------------------------------------------------------------
+void DistributedMeshTools::init_facet_cell_connections(Mesh& mesh)
+{
+  // Topological dimension
+  const std::size_t D = mesh.topology().dim();
+
+  // Initialize entities of dimension d
+  mesh.init(D - 1);
+
+  // Build entity(vertex list)-to-local-vertex-index map
+  std::map<std::vector<std::size_t>, unsigned int> entities;
+  for (MeshEntityIterator e(mesh, D - 1); !e.end(); ++e)
+  {
+    std::vector<std::size_t> entity;
+    for (VertexIterator vertex(*e); !vertex.end(); ++vertex)
+      entity.push_back(vertex->global_index());
+    std::sort(entity.begin(), entity.end());
+    entities[entity] = e->index();
+  }
+
+  // Get shared vertices (local index, [sharing processes])
+  const std::map<unsigned int, std::set<unsigned int> >& shared_vertices_local
+                            = mesh.topology().shared_entities(0);
+  const std::vector<std::size_t>& global_vertex_indices
+      = mesh.topology().global_indices(0);
+
+  // Compute ownership of entities ([entity vertices], data):
+  //  [0]: owned and shared (will be numbered by this process, and number
+  //       communicated to other processes)
+  //  [1]: not owned but shared (will be numbered by another process, and number
+  //       communicated to this processes)
+  std::vector<std::size_t> owned_entities;
+  boost::array<std::map<Entity, EntityData>, 2> entity_ownership;
+  compute_entity_ownership(mesh.mpi_comm(), entities, shared_vertices_local,
+                           global_vertex_indices, D - 1, owned_entities,
+                           entity_ownership);
+
+  // Split ownership for convenience
+  const std::map<Entity, EntityData>& owned_shared_entities
+    = entity_ownership[0];
+  const std::map<Entity, EntityData>& unowned_shared_entities
+    = entity_ownership[1];
+
+  // Create vector to hold number of cells connected to each
+  // facet. Assume facet is internal, then modify for external facets.
+  std::vector<unsigned int> num_global_neighbors(mesh.num_facets(), 2);
+
+  // Add facets that are locally connected to one cell only
+  for (FacetIterator facet(mesh); !facet.end(); ++facet)
+  {
+    if (facet->num_entities(D) == 1)
+      num_global_neighbors[facet->index()] = 1;
+  }
+
+  // Handle facets on internal partition boundaries
+  std::map<Entity, EntityData>::const_iterator it;
+
+  for (it = owned_shared_entities.begin();
+       it != owned_shared_entities.end(); ++it)
+  {
+    num_global_neighbors[entities.find(it->first)->second] = 2;
+  }
+
+  for (it = unowned_shared_entities.begin();
+       it != unowned_shared_entities.end(); ++it)
+  {
+    num_global_neighbors[entities.find(it->first)->second] = 2;
+  }
+  mesh.topology()(D - 1, mesh.topology().dim()).set_global_size(num_global_neighbors);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/DistributedMeshTools.h b/dolfin/mesh/DistributedMeshTools.h
new file mode 100644
index 0000000..fea14fc
--- /dev/null
+++ b/dolfin/mesh/DistributedMeshTools.h
@@ -0,0 +1,156 @@
+// Copyright (C) 2011-2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-09-17
+// Last changed: 2013-01-29
+
+#ifndef __MESH_DISTRIBUTED_TOOLS_H
+#define __MESH_DISTRIBUTED_TOOLS_H
+
+#include <map>
+#include <numeric>
+#include <set>
+#include <utility>
+#include <vector>
+#include <boost/array.hpp>
+#include <boost/unordered_map.hpp>
+#include <dolfin/common/MPI.h>
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class provides various funtionality for working with
+  /// distributed meshes.
+
+  class DistributedMeshTools
+  {
+  public:
+
+    /// Create global entity indices for entities of dimension d
+    static void number_entities(const Mesh& mesh, std::size_t d);
+
+    /// Create global entity indices for entities of dimension d for
+    /// given global vertex indices.
+    static std::size_t number_entities(
+      const Mesh& mesh,
+      const std::map<unsigned int, std::pair<unsigned int,
+      unsigned int> >& slave_entities,
+      std::vector<std::size_t>& global_entity_indices,
+      std::map<unsigned int, std::set<unsigned int> >& shared_entities,
+      std::size_t d);
+
+    // Compute number of cells connected to each facet
+    // (globally). Facets on internal boundaries will be connected to
+    // two cells (with the cells residing on neighboring processes)
+    static void init_facet_cell_connections(Mesh& mesh);
+
+    /// Find processes that own or share mesh entities (using entity
+    /// global indices). Returns (global_dof, set(process_num,
+    /// local_index)). Exclusively local entities will not appear in
+    /// the map. Works only for vertices and cells
+    static
+      std::map<std::size_t, std::set<std::pair<std::size_t, std::size_t> > >
+      locate_off_process_entities(const std::vector<std::size_t>&
+                                  entity_indices,
+                                  std::size_t dim, const Mesh& mesh);
+
+    /// Compute map from local index of shared entity to list
+    /// of sharing process and local index,
+    /// i.e. (local index, [(sharing process p, local index on p)])
+    static boost::unordered_map<unsigned int,
+      std::vector<std::pair<unsigned int, unsigned int> > >
+      compute_shared_entities(const Mesh& mesh, std::size_t d);
+
+  private:
+
+    // Data structure for a mesh entity (list of vertices, using
+    // global indices)
+    typedef std::vector<std::size_t> Entity;
+
+    // Data structure to mesh entity data
+    struct EntityData
+    {
+      // Constructor
+      EntityData() : local_index(0) {}
+
+      // Constructor  (index is local)
+      explicit EntityData(unsigned int index) : local_index(index) {}
+
+      // Constructor (index is local)
+      EntityData(unsigned int index, const std::vector<unsigned int>& procs)
+        : local_index(index), processes(procs) {}
+
+      // Constructor  (index is local)
+      EntityData(unsigned int index, unsigned int process)
+        : local_index(index), processes(1, process) {}
+
+      // Local (this process) entity index
+      unsigned int local_index;
+
+      // Processes on which entity resides
+      std::vector<unsigned int> processes;
+    };
+
+    // Compute ownership of entities ([entity vertices], data)
+    //  [0]: owned exclusively (will be numbered by this process)
+    //  [1]: owned and shared (will be numbered by this process, and number
+    //       communicated to other processes)
+    //  [2]: not owned but shared (will be numbered by another process,
+    //       and number communicated to this processes)
+    static void compute_entity_ownership(
+      const MPI_Comm mpi_comm,
+      const std::map<std::vector<std::size_t>, unsigned int>& entities,
+      const std::map<unsigned int, std::set<unsigned int> >& shared_vertices_local,
+      const std::vector<std::size_t>& global_vertex_indices,
+      std::size_t d,
+      std::vector<std::size_t>& owned_entities,
+      boost::array<std::map<Entity, EntityData>, 2>& shared_entities);
+
+    // Build preliminary 'guess' of shared entities. This function does
+    // not involve any inter-process communication.
+    static void compute_preliminary_entity_ownership(
+      const MPI_Comm mpi_comm,
+      const std::map<std::size_t, std::set<unsigned int> >& shared_vertices,
+      const std::map<Entity, unsigned int>& entities,
+      std::vector<std::size_t>& owned_entities,
+      boost::array<std::map<Entity, EntityData>, 2>& entity_ownership);
+
+    // Communicate with other processes to finalise entity ownership
+    static void
+      compute_final_entity_ownership(const MPI_Comm mpi_comm,
+                                     std::vector<std::size_t>& owned_entities,
+                                     boost::array<std::map<Entity,
+                                     EntityData>, 2>& entity_ownership);
+
+    // Check if all entity vertices are the shared vertices in overlap
+    static bool is_shared(const std::vector<std::size_t>& entity_vertices,
+                const std::map<std::size_t, std::set<unsigned int> >& shared_vertices);
+
+    // Compute and return (number of global entities, process offset)
+    static std::pair<std::size_t, std::size_t>
+      compute_num_global_entities(const MPI_Comm mpi_comm,
+                                  std::size_t num_local_entities,
+                                  std::size_t num_processes,
+                                  std::size_t process_number);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/DomainBoundary.h b/dolfin/mesh/DomainBoundary.h
new file mode 100644
index 0000000..83528fa
--- /dev/null
+++ b/dolfin/mesh/DomainBoundary.h
@@ -0,0 +1,52 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-05-23
+// Last changed: 2008-05-23
+
+#ifndef __DOMAIN_BOUNDARY_H
+#define __DOMAIN_BOUNDARY_H
+
+#include <dolfin/common/Array.h>
+#include "SubDomain.h"
+
+namespace dolfin
+{
+
+  /// This class provides a SubDomain which picks out the boundary of
+  /// a mesh, and provides a convenient way to specify boundary
+  /// conditions on the entire boundary of a mesh.
+
+  class DomainBoundary : public SubDomain
+  {
+  public:
+
+    /// Constructor
+    DomainBoundary() {}
+
+    /// Destructor
+    virtual ~DomainBoundary() {}
+
+    /// Return true for points on the boundary
+    virtual bool inside(const Array<double>& x, bool on_boundary) const
+    { return on_boundary; }
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/DynamicMeshEditor.cpp b/dolfin/mesh/DynamicMeshEditor.cpp
new file mode 100644
index 0000000..4ad063b
--- /dev/null
+++ b/dolfin/mesh/DynamicMeshEditor.cpp
@@ -0,0 +1,235 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-09-22
+// Last changed: 2014-02-06
+
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/parameter/dolfin_parameter.h>
+#include "Mesh.h"
+#include "MeshEditor.h"
+#include "DynamicMeshEditor.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+DynamicMeshEditor::DynamicMeshEditor() : _mesh(0), _tdim(0), _gdim(0),
+                                         _cell_type(0),
+                                         _num_global_vertices(0),
+                                         _num_global_cells(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+DynamicMeshEditor::~DynamicMeshEditor()
+{
+  clear();
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::open(Mesh& mesh, CellType::Type type, std::size_t tdim,
+                             std::size_t gdim, std::size_t num_global_vertices,
+                             std::size_t num_global_cells)
+{
+  // Clear old data
+  mesh.clear();
+  clear();
+
+  // Save data
+  _mesh = &mesh;
+  _gdim = gdim;
+  _tdim = tdim;
+  _cell_type = CellType::create(type);
+  _num_global_vertices = num_global_vertices;
+  _num_global_cells    = num_global_cells;
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::open(Mesh& mesh, std::string type, std::size_t tdim,
+                             std::size_t gdim, std::size_t num_global_vertices,
+                             std::size_t num_global_cells)
+{
+  if (type == "point")
+  {
+    open(mesh, CellType::point, tdim, gdim, num_global_vertices,
+         num_global_cells);
+  }
+  else if (type == "interval")
+  {
+    open(mesh, CellType::interval, tdim, gdim, num_global_vertices,
+         num_global_cells);
+  }
+  else if (type == "triangle")
+  {
+    open(mesh, CellType::triangle, tdim, gdim, num_global_vertices,
+         num_global_cells);
+  }
+  else if (type == "tetrahedron")
+  {
+    open(mesh, CellType::tetrahedron, tdim, gdim, num_global_vertices,
+         num_global_cells);
+  }
+  else
+  {
+    dolfin_error("DynamicMeshEditor.cpp",
+                 "open dynamic mesh editor",
+                 "Unknown cell type (\"%s\")", type.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::add_vertex(std::size_t v, const Point& p)
+{
+  // Resize array if necessary
+  const std::size_t offset = v*_gdim;
+  const std::size_t size = offset + _gdim;
+  if (size > vertex_coordinates.size())
+    vertex_coordinates.resize(size, 0.0);
+
+  // Set coordinates
+  for (std::size_t i = 0; i < _gdim; i++)
+    vertex_coordinates[offset + i] = p[i];
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::add_vertex(std::size_t v, double x)
+{
+  Point p(x);
+  add_vertex(v, p);
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::add_vertex(std::size_t v, double x, double y)
+{
+  Point p(x, y);
+  add_vertex(v, p);
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::add_vertex(std::size_t v, double x, double y, double z)
+{
+  Point p(x, y, z);
+  add_vertex(v, p);
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::add_cell(std::size_t c,
+                                 const std::vector<std::size_t>& v)
+{
+  // Check size of array
+  const std::size_t vertices_per_cell = _cell_type->num_vertices(_tdim);
+  if (v.size() != vertices_per_cell)
+  {
+    dolfin_error("DynamicMeshEditor.cpp",
+                 "add cell using dynamic mesh editor",
+                 "Illegal number of vertices (%d) for cell, expected %d",
+                 v.size(), vertices_per_cell);
+  }
+
+  // Resize array if necessary
+  const std::size_t offset = c*vertices_per_cell;
+  const std::size_t size = offset + vertices_per_cell;
+  if (size > cell_vertices.size())
+    cell_vertices.resize(size, 0);
+
+  // Set vertices
+  for (std::size_t i = 0; i < vertices_per_cell; i++)
+    cell_vertices[offset + i] = v[i];
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::add_cell(std::size_t c, std::size_t v0, std::size_t v1)
+{
+  std::vector<std::size_t> vertices;
+  vertices.push_back(v0);
+  vertices.push_back(v1);
+  add_cell(c, vertices);
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::add_cell(std::size_t c, std::size_t v0,
+                                 std::size_t v1, std::size_t v2)
+{
+  std::vector<std::size_t> vertices;
+  vertices.push_back(v0);
+  vertices.push_back(v1);
+  vertices.push_back(v2);
+  add_cell(c, vertices);
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::add_cell(std::size_t c, std::size_t v0,
+                                 std::size_t v1, std::size_t v2,
+                                 std::size_t v3)
+{
+  std::vector<std::size_t> vertices;
+  vertices.push_back(v0);
+  vertices.push_back(v1);
+  vertices.push_back(v2);
+  vertices.push_back(v3);
+  add_cell(c, vertices);
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::close(bool order)
+{
+  dolfin_assert(_mesh);
+  dolfin_assert(_cell_type);
+
+  // Open default mesh editor
+  MeshEditor editor;
+  editor.open(*_mesh, _cell_type->cell_type(), _tdim, _gdim);
+
+  // Set number of vertices
+  const std::size_t num_vertices = vertex_coordinates.size()/_gdim;
+  editor.init_vertices_global(num_vertices, _num_global_vertices);
+
+  // Set number of cells
+  const std::size_t vertices_per_cell = _cell_type->num_vertices(_gdim);
+  const std::size_t num_cells = cell_vertices.size()/vertices_per_cell;
+  editor.init_cells_global(num_cells, _num_global_cells);
+
+  // Add vertices
+  std::vector<double> p(_gdim);
+  for (std::size_t v = 0; v < num_vertices; v++)
+  {
+    const std::size_t offset = v*_gdim;
+    for (std::size_t i = 0; i < _gdim; i++)
+      p[i] = vertex_coordinates[offset + i];
+    editor.add_vertex(v, p);
+  }
+
+  // Add cells
+  std::vector<std::size_t> vertices(vertices_per_cell);
+  for (std::size_t c = 0; c < num_cells; c++)
+  {
+    const std::size_t offset = c*vertices_per_cell;
+    for (std::size_t i = 0; i < vertices_per_cell; i++)
+      vertices[i] = cell_vertices[offset + i];
+    editor.add_cell(c, vertices);
+  }
+
+  // Close editor
+  editor.close(order);
+
+  // Clear data
+  clear();
+}
+//-----------------------------------------------------------------------------
+void DynamicMeshEditor::clear()
+{
+  _mesh = 0;
+  _tdim = 0;
+  _gdim = 0;
+
+  delete _cell_type;
+  _cell_type = 0;
+
+  vertex_coordinates.clear();
+  cell_vertices.clear();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/DynamicMeshEditor.h b/dolfin/mesh/DynamicMeshEditor.h
new file mode 100644
index 0000000..baab9c2
--- /dev/null
+++ b/dolfin/mesh/DynamicMeshEditor.h
@@ -0,0 +1,116 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-09-22
+// Last changed: 2008-11-13
+
+#ifndef __DYNAMIC_MESH_EDITOR_H
+#define __DYNAMIC_MESH_EDITOR_H
+
+#include "CellType.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+  class Point;
+  class Vector;
+
+  /// This class provides an interface for dynamic editing of meshes,
+  /// that is, when the number of vertices and cells are not known
+  /// a priori. If the number of vertices and cells are known a priori,
+  /// it is more efficient to use the default editor MeshEditor.
+
+  class DynamicMeshEditor
+  {
+  public:
+
+    /// Constructor
+    DynamicMeshEditor();
+
+    /// Destructor
+    ~DynamicMeshEditor();
+
+    /// Open mesh of given cell type, topological and geometrical dimension
+    void open(Mesh& mesh, CellType::Type type, std::size_t tdim,
+              std::size_t gdim, std::size_t num_global_vertices,
+              std::size_t num_global_cells);
+
+    /// Open mesh of given cell type, topological and geometrical dimension
+    void open(Mesh& mesh, std::string type, std::size_t tdim, std::size_t gdim,
+              std::size_t num_global_vertices, std::size_t num_global_cells);
+
+    /// Add vertex v at given point p
+    void add_vertex(std::size_t v, const Point& p);
+
+    /// Add vertex v at given coordinate x
+    void add_vertex(std::size_t v, double x);
+
+    /// Add vertex v at given coordinate (x, y)
+    void add_vertex(std::size_t v, double x, double y);
+
+    /// Add vertex v at given coordinate (x, y, z)
+    void add_vertex(std::size_t v, double x, double y, double z);
+
+    /// Add cell with given vertices
+    void add_cell(std::size_t c, const std::vector<std::size_t>& v);
+
+    /// Add cell (interval) with given vertices
+    void add_cell(std::size_t c, std::size_t v0, std::size_t v1);
+
+    /// Add cell (triangle) with given vertices
+    void add_cell(std::size_t c,  std::size_t v0, std::size_t v1,
+                  std::size_t v2);
+
+    /// Add cell (tetrahedron) with given vertices
+    void add_cell(std::size_t c, std::size_t v0, std::size_t v1,
+                  std::size_t v2, std::size_t v3);
+
+    /// Close mesh, finish editing, and order entities locally
+    void close(bool order=false);
+
+  private:
+
+    // Clear data
+    void clear();
+
+    // The mesh
+    Mesh* _mesh;
+
+    // Topological dimension
+    std::size_t _tdim;
+
+    // Geometrical (Euclidean) dimension
+    std::size_t _gdim;
+
+    // Cell type
+    CellType* _cell_type;
+
+    // Number of global vertices and cells
+    std::size_t _num_global_vertices, _num_global_cells;
+
+    // Dynamic storage for vertex coordinates
+    std::vector<double> vertex_coordinates;
+
+    // Dynamic storage for cells
+    std::vector<std::size_t> cell_vertices;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/Edge.cpp b/dolfin/mesh/Edge.cpp
new file mode 100644
index 0000000..8820f4f
--- /dev/null
+++ b/dolfin/mesh/Edge.cpp
@@ -0,0 +1,68 @@
+// Copyright (C) 2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman 2006.
+//
+// First added:  2006-06-02
+// Last changed: 2011-02-08
+
+#include <cmath>
+#include "Vertex.h"
+#include "Edge.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+double Edge::length() const
+{
+  const unsigned int* vertices = entities(0);
+  dolfin_assert(vertices);
+
+  const Vertex v0(*_mesh, vertices[0]);
+  const Vertex v1(*_mesh, vertices[1]);
+
+  const Point p0 = v0.point();
+  const Point p1 = v1.point();
+
+  double length(sqrt((p1.x()-p0.x())*(p1.x()-p0.x())
+               + (p1.y()-p0.y())*(p1.y()-p0.y())
+               + (p1.z()-p0.z())*(p1.z()-p0.z())));
+
+  return length;
+}
+//-----------------------------------------------------------------------------
+double Edge::dot(const Edge& edge) const
+{
+  const unsigned int* v0 = entities(0);
+  const unsigned int* v1 = edge.entities(0);
+  dolfin_assert(v0);
+  dolfin_assert(v1);
+
+  const MeshGeometry& g = _mesh->geometry();
+  const double* x00 = g.x(v0[0]);
+  const double* x01 = g.x(v0[1]);
+  const double* x10 = g.x(v1[0]);
+  const double* x11 = g.x(v1[1]);
+
+  double sum = 0.0;
+  const std::size_t gdim = g.dim();
+  for (std::size_t i = 0; i < gdim; i++)
+    sum += (x01[i] - x00[i]) * (x11[i] - x10[i]);
+
+  return sum;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/Edge.h b/dolfin/mesh/Edge.h
new file mode 100644
index 0000000..0f223e9
--- /dev/null
+++ b/dolfin/mesh/Edge.h
@@ -0,0 +1,128 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman 2006.
+// Modified by Kristoffer Selim 2009.
+//
+// First added:  2006-06-02
+// Last changed: 2011-02-08
+
+#ifndef __EDGE_H
+#define __EDGE_H
+
+#include <memory>
+
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshEntityIteratorBase.h"
+#include "MeshFunction.h"
+
+namespace dolfin
+{
+
+  /// An Edge is a _MeshEntity_ of topological dimension 1.
+
+  class Edge : public MeshEntity
+  {
+  public:
+
+    /// Create edge on given mesh
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     index (std::size_t)
+    ///         Index of the edge.
+    Edge(const Mesh& mesh, std::size_t index) : MeshEntity(mesh, 1, index) {}
+
+    /// Create edge from mesh entity
+    ///
+    /// *Arguments*
+    ///     entity (_MeshEntity_)
+    ///         The mesh entity to create an edge from.
+    Edge(MeshEntity& entity) : MeshEntity(entity.mesh(), 1, entity.index()) {}
+
+    /// Destructor
+    ~Edge() {}
+
+    /// Compute Euclidean length of edge
+    ///
+    /// *Returns*
+    ///     double
+    ///         Euclidean length of edge.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitSquare mesh(2, 2);
+    ///         Edge edge(mesh, 0);
+    ///         info("%g", edge.length());
+    ///
+    ///     output::
+    ///
+    ///         0.5
+    double length() const;
+
+    /// Compute dot product between edge and other edge
+    ///
+    /// *Arguments*
+    ///     edge (_Edge_)
+    ///         Another edge.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The dot product.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         UnitSquare mesh(2, 2);
+    ///         Edge edge1(mesh, 0);
+    ///         Edge edge2(mesh, 1);
+    ///         info("%g", edge1.dot(edge2));
+    ///
+    ///     output::
+    ///
+    ///         0.25
+    double dot(const Edge& edge) const;
+
+  };
+
+  /// An EdgeIterator is a _MeshEntityIterator_ of topological dimension 1.
+  typedef MeshEntityIteratorBase<Edge> EdgeIterator;
+
+  /// An EdgeFunction is a _MeshFunction_ of topological dimension 1.
+  template <typename T> class EdgeFunction : public MeshFunction<T>
+  {
+  public:
+
+    EdgeFunction(const Mesh& mesh) : MeshFunction<T>(mesh, 1) {}
+
+    EdgeFunction(std::shared_ptr<const Mesh> mesh)
+      : MeshFunction<T>(mesh, 1) {}
+
+    EdgeFunction(const Mesh& mesh, const T& value)
+      : MeshFunction<T>(mesh, 1, value) {}
+
+    EdgeFunction(std::shared_ptr<const Mesh> mesh, const T& value)
+      : MeshFunction<T>(mesh, 1, value) {}
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/Face.cpp b/dolfin/mesh/Face.cpp
new file mode 100644
index 0000000..d5dbbc3
--- /dev/null
+++ b/dolfin/mesh/Face.cpp
@@ -0,0 +1,130 @@
+// Copyright (C) 2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2006-06-02
+// Last changed: 2011-02-26
+
+#include <dolfin/geometry/Point.h>
+#include "Cell.h"
+#include "Face.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+double Face::area() const
+{
+  dolfin_assert(_mesh);
+  dolfin_assert(_mesh->ordered());
+
+  const std::size_t D = _mesh->topology().dim();
+
+  // If the Face is the same topological dimension as cell
+  if (D == 2)
+  {
+    // Get the cell corresponding to this Face
+    const Cell cell(*_mesh, this->index());
+
+    // Return the generalized volume (area)
+    return cell.volume();
+
+  }
+  else
+  {
+
+    // Initialize needed connectivity
+    _mesh->init(2, D);
+
+    // Get cell to which face belong (first cell when there is more than one)
+    const Cell cell(*_mesh, this->entities(D)[0]);
+
+    // Get local index of facet with respect to the cell
+    const std::size_t local_facet = cell.index(*this);
+
+    return cell.facet_area(local_facet);
+  }
+}
+//-----------------------------------------------------------------------------
+double Face::normal(std::size_t i) const
+{
+  dolfin_assert(_mesh);
+  dolfin_assert(_mesh->ordered());
+
+  const std::size_t tD = _mesh->topology().dim();
+  const std::size_t gD = _mesh->geometry().dim();
+
+  // Check for when Cell has the same topological dimension as Face and we are in R^2
+  if (tD == 2 && gD == 2)
+  {
+    dolfin_error("Face.cpp",
+                 "compute Face normal",
+                 "Don't know how to compute Face normal for a Face in a 2D mesh embedded in R^2.");
+  }
+
+  // Check for when Cell has the same topological dimension as Face and we are in R^3
+  if (tD == 2 && gD == 3)
+  {
+    dolfin_not_implemented();
+  }
+
+  // Initialize needed connectivity
+  _mesh->init(2, tD);
+
+  // Get cell to which face belong (first cell when there is more than one)
+  const Cell cell(*_mesh, this->entities(tD)[0]);
+
+  // Get local index of facet with respect to the cell
+  const std::size_t local_facet = cell.index(*this);
+
+  return cell.normal(local_facet, i);
+}
+//-----------------------------------------------------------------------------
+Point Face::normal() const
+{
+  dolfin_assert(_mesh);
+  dolfin_assert(_mesh->ordered());
+
+  const std::size_t tD = _mesh->topology().dim();
+  const std::size_t gD = _mesh->geometry().dim();
+
+  // Check for when Cell has the same topological dimension as Face and we are in R^2
+  if (tD == 2 && gD == 2)
+  {
+    dolfin_error("Face.cpp",
+                 "compute Face normal",
+                 "Don't know how to compute Face normal for a Face in a 2D mesh embedded in R^2.");
+  }
+
+  // Check for when Cell has the same topological dimension as Face and we are in R^3
+  if (tD == 2 && gD == 3)
+  {
+    dolfin_not_implemented();
+  }
+
+  // Initialize needed connectivity
+  _mesh->init(2, tD);
+
+  // Get cell to which face belong (first cell when there is more than one)
+  const Cell cell(*_mesh, this->entities(tD)[0]);
+
+  // Get local index of facet with respect to the cell
+  const std::size_t local_facet = cell.index(*this);
+
+  return cell.normal(local_facet);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/Face.h b/dolfin/mesh/Face.h
new file mode 100644
index 0000000..d4d4993
--- /dev/null
+++ b/dolfin/mesh/Face.h
@@ -0,0 +1,84 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2011
+//
+// First added:  2006-06-02
+// Last changed: 2011-02-22
+
+#ifndef __FACE_H
+#define __FACE_H
+
+#include <memory>
+
+#include "MeshEntity.h"
+#include "MeshEntityIteratorBase.h"
+#include "MeshFunction.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+  class Point;
+
+  /// A Face is a MeshEntity of topological dimension 2.
+
+  class Face : public MeshEntity
+  {
+  public:
+
+    /// Constructor
+    Face(const Mesh& mesh, std::size_t index) : MeshEntity(mesh, 2, index) {}
+
+    /// Destructor
+    ~Face() {}
+
+    /// Calculate the area of the face (triangle)
+    double area() const;
+
+    /// Compute component i of the normal to the face
+    double normal(std::size_t i) const;
+
+    /// Compute normal to the face
+    Point normal() const;
+
+  };
+
+  /// A FaceIterator is a MeshEntityIterator of topological dimension 2.
+  typedef MeshEntityIteratorBase<Face> FaceIterator;
+
+  /// A FaceFunction is a MeshFunction of topological dimension 2.
+  template <typename T> class FaceFunction : public MeshFunction<T>
+  {
+  public:
+
+    FaceFunction(const Mesh& mesh) : MeshFunction<T>(mesh, 2) {}
+
+    FaceFunction(std::shared_ptr<const Mesh> mesh)
+      : MeshFunction<T>(mesh, 2) {}
+
+    FaceFunction(const Mesh& mesh, const T& value)
+      : MeshFunction<T>(mesh, 2, value) {}
+
+    FaceFunction(std::shared_ptr<const Mesh> mesh, const T& value)
+      : MeshFunction<T>(mesh, 2, value) {}
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/Facet.cpp b/dolfin/mesh/Facet.cpp
new file mode 100644
index 0000000..66fcab8
--- /dev/null
+++ b/dolfin/mesh/Facet.cpp
@@ -0,0 +1,98 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2011
+//
+// First added:  2006-06-02
+// Last changed: 2011-11-14
+
+#include <dolfin/geometry/Point.h>
+#include "Cell.h"
+#include "MeshTopology.h"
+#include "Facet.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+double Facet::normal(std::size_t i) const
+{
+  const std::size_t D = _mesh->topology().dim();
+  _mesh->init(D - 1);
+  _mesh->init(D - 1, D);
+  dolfin_assert(_mesh->ordered());
+
+  // Get cell to which face belong (first cell when there is more than one)
+  const Cell cell(*_mesh, this->entities(D)[0]);
+
+  // Get local index of facet with respect to the cell
+  const std::size_t local_facet = cell.index(*this);
+
+  return cell.normal(local_facet, i);
+}
+//-----------------------------------------------------------------------------
+Point Facet::normal() const
+{
+  const std::size_t D = _mesh->topology().dim();
+  _mesh->init(D - 1);
+  _mesh->init(D - 1, D);
+  dolfin_assert(_mesh->ordered());
+
+  // Get cell to which face belong (first cell when there is more than one)
+  const Cell cell(*_mesh, this->entities(D)[0]);
+
+  // Get local index of facet with respect to the cell
+  const std::size_t local_facet = cell.index(*this);
+
+  return cell.normal(local_facet);
+}
+//-----------------------------------------------------------------------------
+bool Facet::exterior() const
+{
+  const std::size_t D = _mesh->topology().dim();
+  if (this->num_global_entities(D) == 1)
+    return true;
+  else
+    return false;
+}
+//-----------------------------------------------------------------------------
+std::pair<const Cell, const Cell>
+Facet::adjacent_cells(const std::vector<std::size_t>* facet_orientation) const
+{
+  dolfin_assert(num_entities(dim() + 1) == 2);
+
+  // Get cell indices
+  const std::size_t D = dim() + 1;
+  const std::size_t c0 = entities(D)[0];
+  const std::size_t c1 = entities(D)[1];
+
+  // Normal ordering
+  if (!facet_orientation || (*facet_orientation)[this->index()] == c0)
+    return std::make_pair(Cell(mesh(), c0), Cell(mesh(), c1));
+
+  // Sanity check
+  if ((*facet_orientation)[this->index()] != c1)
+  {
+    dolfin_error("Facet.cpp",
+                 "extract adjacent cells of facet",
+                 "Illegal facet orientation specified, cell %d is not a neighbor of facet %d",
+                 (*facet_orientation)[this->index()], index());
+  }
+
+  // Opposite ordering
+  return std::make_pair(Cell(mesh(), c1), Cell(mesh(), c0));
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/Facet.h b/dolfin/mesh/Facet.h
new file mode 100644
index 0000000..8062936
--- /dev/null
+++ b/dolfin/mesh/Facet.h
@@ -0,0 +1,101 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2009-2011.
+//
+// First added:  2006-06-02
+// Last changed: 2011-04-07
+
+#ifndef __FACET_H
+#define __FACET_H
+
+#include <memory>
+
+#include <utility>
+#include <vector>
+#include "Cell.h"
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshEntityIteratorBase.h"
+#include "MeshFunction.h"
+
+namespace dolfin
+{
+
+  /// A Facet is a MeshEntity of topological codimension 1.
+
+  class Facet : public MeshEntity
+  {
+  public:
+
+    /// Constructor
+    Facet(const Mesh& mesh, std::size_t index)
+      : MeshEntity(mesh, mesh.topology().dim() - 1, index) {}
+
+    /// Destructor
+    ~Facet() {}
+
+    /// Compute component i of the normal to the facet
+    double normal(std::size_t i) const;
+
+    /// Compute normal to the facet
+    Point normal() const;
+
+    /// Return true if facet is an exterior facet (relative to global mesh,
+    /// so this function will return false for facets on partition
+    /// boundaries). Facet connectivity must be initialized before
+    /// calling this function.
+    bool exterior() const;
+
+    // FIXME: This function should take care of the case where adjacent cells
+    // FIXME: live on different processes
+
+    /// Return adjacent cells. An optional argument that lists for
+    /// each facet the index of the first cell may be given to specify
+    /// the ordering of the two cells. If not specified, the ordering
+    /// will depend on the (arbitrary) ordering of the mesh
+    /// connectivity.
+    std::pair<const Cell, const Cell>
+      adjacent_cells(const std::vector<std::size_t>* facet_orientation) const;
+
+  };
+
+  /// A FacetIterator is a MeshEntityIterator of topological
+  /// codimension 1.
+  typedef MeshEntityIteratorBase<Facet> FacetIterator;
+
+  /// A FacetFunction is a MeshFunction of topological codimension 1.
+  template <typename T> class FacetFunction : public MeshFunction<T>
+  {
+  public:
+
+    FacetFunction(const Mesh& mesh)
+      : MeshFunction<T>(mesh, mesh.topology().dim() - 1) {}
+
+    FacetFunction(std::shared_ptr<const Mesh> mesh)
+      : MeshFunction<T>(mesh, mesh->topology().dim() - 1) {}
+
+    FacetFunction(const Mesh& mesh, const T& value)
+      : MeshFunction<T>(mesh, mesh.topology().dim() - 1, value) {}
+
+    //FacetFunction(boost:shared_ptr<const Mesh> mesh, const T& value)
+    //  : MeshFunction<T>(mesh, mesh->topology().dim() - 1, value) {}
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/FacetCell.cpp b/dolfin/mesh/FacetCell.cpp
new file mode 100644
index 0000000..c9dc26b
--- /dev/null
+++ b/dolfin/mesh/FacetCell.cpp
@@ -0,0 +1,59 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-02-08
+// Last changed: 2013-01-09
+
+#include "BoundaryMesh.h"
+#include "Facet.h"
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshFunction.h"
+#include "FacetCell.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+FacetCell::FacetCell(const BoundaryMesh& mesh, const Cell& facet)
+  : Cell(mesh, 0), _facet_index(0)
+{
+  const std::size_t D = mesh.topology().dim();
+
+  // Get map from facets (boundary cells) to mesh cells
+  const MeshFunction<std::size_t>& cell_map = mesh.entity_map(D);
+
+  // Get mesh facet corresponding to boundary cell
+  Facet mesh_facet(mesh, cell_map[facet]);
+
+  // Get cell index (pick first, there is only one)
+  dolfin_assert(mesh_facet.num_entities(D) == 1);
+  _local_index = mesh_facet.entities(D)[0];
+
+  // Get local index of facet
+  _facet_index = index(mesh_facet);
+}
+//-----------------------------------------------------------------------------
+FacetCell::~FacetCell()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t FacetCell::facet_index() const
+{
+  return _facet_index;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/FacetCell.h b/dolfin/mesh/FacetCell.h
new file mode 100644
index 0000000..efce722
--- /dev/null
+++ b/dolfin/mesh/FacetCell.h
@@ -0,0 +1,58 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2010-02-08
+// Last changed: 2010-02-08
+
+#ifndef __FACET_CELL_H
+#define __FACET_CELL_H
+
+#include "Cell.h"
+
+namespace dolfin
+{
+
+  class BoundaryMesh;
+
+  /// This class represents a cell in a mesh incident to a facet on
+  /// the boundary. It is useful in cases where one needs to iterate
+  /// over a boundary mesh and access the corresponding cells in the
+  /// original mesh.
+
+  class FacetCell : public Cell
+  {
+  public:
+
+    /// Create cell on mesh corresponding to given facet (cell) on boundary
+    FacetCell(const BoundaryMesh& mesh, const Cell& facet);
+
+    /// Destructor
+    ~FacetCell();
+
+    /// Return local index of facet with respect to the cell
+    std::size_t facet_index() const;
+
+  private:
+
+    // Facet index
+    std::size_t _facet_index;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/IntervalCell.cpp b/dolfin/mesh/IntervalCell.cpp
new file mode 100644
index 0000000..cb5ca91
--- /dev/null
+++ b/dolfin/mesh/IntervalCell.cpp
@@ -0,0 +1,308 @@
+// Copyright (C) 2006-2014 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristian Oelgaard 2007
+// Modified by Kristoffer Selim 2008
+// Modified by Marie E. Rognes 2011
+// Modified by August Johansson 2014
+//
+// First added:  2006-06-05
+// Last changed: 2014-02-13
+
+#include <algorithm>
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "MeshEditor.h"
+#include "MeshEntity.h"
+#include "MeshGeometry.h"
+#include "IntervalCell.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::size_t IntervalCell::dim() const
+{
+  return 1;
+}
+//-----------------------------------------------------------------------------
+std::size_t IntervalCell::num_entities(std::size_t dim) const
+{
+  switch (dim)
+  {
+  case 0:
+    return 2; // vertices
+  case 1:
+    return 1; // cells
+  default:
+    dolfin_error("IntervalCell.cpp",
+                 "access number of entities of interval cell",
+                 "Illegal topological dimension (%d)", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t IntervalCell::num_vertices(std::size_t dim) const
+{
+  switch (dim)
+  {
+  case 0:
+    return 1; // vertices
+  case 1:
+    return 2; // cells
+  default:
+    dolfin_error("IntervalCell.cpp",
+                 "access number of vertices for subsimplex of interval cell",
+                 "Illegal topological dimension (%d)", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t IntervalCell::orientation(const Cell& cell) const
+{
+  const Point up(0.0, 1.0);
+  return cell.orientation(up);
+}
+//-----------------------------------------------------------------------------
+void IntervalCell::create_entities(std::vector<std::vector<unsigned int> >& e,
+                                   std::size_t dim, const unsigned int* v) const
+{
+  // We don't need to create any entities
+  dolfin_error("IntervalCell.cpp",
+               "create entities of interval cell",
+               "Don't know how to create entities of topological dimension %d", dim);
+}
+//-----------------------------------------------------------------------------
+void IntervalCell::refine_cell(Cell& cell, MeshEditor& editor,
+                               std::size_t& current_cell) const
+{
+  // Get vertices
+  const unsigned int* v = cell.entities(0);
+  dolfin_assert(v);
+
+  // Get offset for new vertex indices
+  const std::size_t offset = cell.mesh().num_vertices();
+
+  // Compute indices for the three new vertices
+  const std::size_t v0 = v[0];
+  const std::size_t v1 = v[1];
+  const std::size_t e0 = offset + cell.index();
+
+  // Add the two new cells
+  std::vector<std::size_t> new_cell(2);
+
+  new_cell[0] = v0; new_cell[1] = e0;
+  editor.add_cell(current_cell++, new_cell);
+
+  new_cell[0] = e0; new_cell[1] = v1;
+  editor.add_cell(current_cell++, new_cell);
+}
+//-----------------------------------------------------------------------------
+double IntervalCell::volume(const MeshEntity& interval) const
+{
+  // Check that we get an interval
+  if (interval.dim() != 1)
+  {
+    dolfin_error("IntervalCell.cpp",
+                 "compute volume (length) of interval cell",
+                 "Illegal mesh entity, not an interval");
+  }
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = interval.mesh().geometry();
+
+  // Get the coordinates of the two vertices
+  const unsigned int* vertices = interval.entities(0);
+  const double* x0 = geometry.x(vertices[0]);
+  const double* x1 = geometry.x(vertices[1]);
+
+  // Compute length of interval (line segment)
+  double sum = 0.0;
+  for (std::size_t i = 0; i < geometry.dim(); ++i)
+  {
+    const double dx = x1[i] - x0[i];
+    sum += dx*dx;
+  }
+
+  return std::sqrt(sum);
+}
+//-----------------------------------------------------------------------------
+double IntervalCell::diameter(const MeshEntity& interval) const
+{
+  // Check that we get an interval
+  if (interval.dim() != 1)
+  {
+    dolfin_error("IntervalCell.cpp",
+                 "compute diameter of interval cell",
+                 "Illegal mesh entity, not an interval");
+  }
+
+  // Diameter is same as volume for interval (line segment)
+  return volume(interval);
+}
+//-----------------------------------------------------------------------------
+double IntervalCell::squared_distance(const Cell& cell, const Point& point) const
+{
+  // Get the vertices as points
+  const MeshGeometry& geometry = cell.mesh().geometry();
+  const unsigned int* vertices = cell.entities(0);
+  const Point p0 = geometry.point(vertices[0]);
+  const Point p1 = geometry.point(vertices[1]);
+
+  // Compute vector
+  const Point v0  = point - p0;
+  const Point v1  = point - p1;
+  const Point v01 = p1 - p0;
+
+  // Check if p0 is closest point (outside of interval)
+  const double a0 = v0.dot(v01);
+  if (a0 < 0.0)
+    return v0.dot(v0);
+
+  // Check if p1 is closest point (outside the interval)
+  const double a1 = - v1.dot(v01);
+  if (a1 < 0.0)
+    return v1.dot(v1);
+
+  // Inside interval, so use Pythagoras to subtract length of projection
+  return std::max(v0.dot(v0) - a0*a0 / v01.dot(v01), 0.0);
+
+  /*
+
+  // Old implementation that only looks at x-coordinate. Faster for 1D
+  // meshes but speed is rarely an issue in 1D so we might as well use
+  // the more general implementation also in 1D.
+
+  // Get x-coordinates of point
+  const double x = point.x();
+  const double x0 = p0.x();
+  const double x1 = p1.x();
+
+  // Compute min and max
+  const double a = std::min(x0, x1);
+  const double b = std::max(x0, x1);
+
+  // Check if point is left of a
+  if (x < a) return (x - a)*(x - a);
+
+  // Check if point is right of b
+  if (x > b) return (x - b)*(x - b);
+
+  // Point is inside interval so distance is zero
+  return 0.0;
+  */
+}
+//-----------------------------------------------------------------------------
+double IntervalCell::normal(const Cell& cell, std::size_t facet, std::size_t i) const
+{
+  return normal(cell, facet)[i];
+}
+//-----------------------------------------------------------------------------
+Point IntervalCell::normal(const Cell& cell, std::size_t facet) const
+{
+  // Get mesh geometry
+  const MeshGeometry& geometry = cell.mesh().geometry();
+
+  // Get the two vertices as points
+  const unsigned int* vertices = cell.entities(0);
+  Point p0 = geometry.point(vertices[0]);
+  Point p1 = geometry.point(vertices[1]);
+
+  // Compute normal
+  Point n = p0 - p1;
+  if (facet == 1)
+    n *= -1.0;
+
+  // Normalize
+  n /= n.norm();
+
+  return n;
+}
+//-----------------------------------------------------------------------------
+Point IntervalCell::cell_normal(const Cell& cell) const
+{
+  // Get mesh geometry
+  const MeshGeometry& geometry = cell.mesh().geometry();
+
+  // Cell_normal only defined for gdim = 1, 2 for now
+  const std::size_t gdim = geometry.dim();
+  if (gdim > 2)
+    dolfin_error("IntervalCell.cpp",
+                 "compute cell normal",
+                 "Illegal geometric dimension (%d)", gdim);
+
+  // Get the two vertices as points
+  const unsigned int* vertices = cell.entities(0);
+  Point p0 = geometry.point(vertices[0]);
+  Point p1 = geometry.point(vertices[1]);
+
+  // Define normal by rotating tangent counterclockwise
+  Point t = p1 - p0;
+  Point n(-t.y(), t.x());
+
+  // Normalize
+  n /= n.norm();
+
+  return n;
+}
+//-----------------------------------------------------------------------------
+double IntervalCell::facet_area(const Cell& cell, std::size_t facet) const
+{
+  return 1.0;
+}
+//-----------------------------------------------------------------------------
+void IntervalCell::order(Cell& cell,
+                 const std::vector<std::size_t>& local_to_global_vertex_indices) const
+{
+  // Sort i - j for i > j: 1 - 0
+
+  // Get mesh topology
+  MeshTopology& topology = const_cast<MeshTopology&>(cell.mesh().topology());
+
+  // Sort local vertices in ascending order, connectivity 1 - 0
+  if (!topology(1, 0).empty())
+  {
+    unsigned int* cell_vertices = const_cast<unsigned int*>(cell.entities(0));
+    sort_entities(2, cell_vertices, local_to_global_vertex_indices);
+  }
+}
+//-----------------------------------------------------------------------------
+bool IntervalCell::collides(const Cell& cell, const Point& point) const
+{
+  return CollisionDetection::collides(cell, point);
+}
+//-----------------------------------------------------------------------------
+bool IntervalCell::collides(const Cell& cell, const MeshEntity& entity) const
+{
+  return CollisionDetection::collides(cell, entity);
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+IntervalCell::triangulate_intersection(const Cell& c0, const Cell& c1) const
+{
+  return IntersectionTriangulation::triangulate_intersection(c0, c1);
+}
+//-----------------------------------------------------------------------------
+std::string IntervalCell::description(bool plural) const
+{
+  if (plural)
+    return "intervals";
+  else
+    return "interval";
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/IntervalCell.h b/dolfin/mesh/IntervalCell.h
new file mode 100644
index 0000000..a4d1132
--- /dev/null
+++ b/dolfin/mesh/IntervalCell.h
@@ -0,0 +1,110 @@
+// Copyright (C) 2006-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristoffer Selim 2008
+//
+// First added:  2006-06-05
+// Last changed: 2014-01-06
+
+#ifndef __INTERVAL_CELL_H
+#define __INTERVAL_CELL_H
+
+#include <string>
+#include <vector>
+#include "CellType.h"
+
+namespace dolfin
+{
+
+  class Cell;
+  class MeshEditor;
+  class MeshEntity;
+  template<typename T> class MeshFunction;
+
+  /// This class implements functionality for interval meshes.
+
+  class IntervalCell : public CellType
+  {
+  public:
+
+    /// Specify cell type and facet type
+    IntervalCell() : CellType(interval, point) {}
+
+    /// Return topological dimension of cell
+    std::size_t dim() const;
+
+    /// Return number of entitites of given topological dimension
+    std::size_t num_entities(std::size_t dim) const;
+
+    /// Return number of vertices for entity of given topological dimension
+    std::size_t num_vertices(std::size_t dim) const;
+
+    /// Return orientation of the cell (assuming flat space)
+    std::size_t orientation(const Cell& cell) const;
+
+    /// Create entities e of given topological dimension from vertices v
+    void create_entities(std::vector<std::vector<unsigned int> >& e, std::size_t dim,
+                         const unsigned int* v) const;
+
+    /// Refine cell uniformly
+    void refine_cell(Cell& cell, MeshEditor& editor, std::size_t& current_cell) const;
+
+    /// Compute (generalized) volume (length) of interval
+    double volume(const MeshEntity& interval) const;
+
+    /// Compute diameter of interval
+    double diameter(const MeshEntity& interval) const;
+
+    /// Compute squared distance to given point
+    double squared_distance(const Cell& cell, const Point& point) const;
+
+    /// Compute component i of normal of given facet with respect to the cell
+    double normal(const Cell& cell, std::size_t facet, std::size_t i) const;
+
+    /// Compute of given facet with respect to the cell
+    Point normal(const Cell& cell, std::size_t facet) const;
+
+    /// Compute normal to given cell (viewed as embedded in 2D)
+    Point cell_normal(const Cell& cell) const;
+
+    /// Compute the area/length of given facet with respect to the cell
+    double facet_area(const Cell& cell, std::size_t facet) const;
+
+    /// Order entities locally
+    void order(Cell& cell,
+               const std::vector<std::size_t>& local_to_global_vertex_indices) const;
+
+    /// Check whether given point collides with cell
+    virtual
+    bool collides(const Cell& cell, const Point& point) const;
+
+    /// Check whether given entity collides with cell
+    virtual
+    bool collides(const Cell& cell, const MeshEntity& entity) const;
+
+    /// Compute triangulation of intersection of two cells
+    virtual std::vector<double>
+    triangulate_intersection(const Cell& c0, const Cell& c1) const;
+
+    /// Return description of cell type
+    std::string description(bool plural) const;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/LocalMeshData.cpp b/dolfin/mesh/LocalMeshData.cpp
new file mode 100644
index 0000000..87d8290
--- /dev/null
+++ b/dolfin/mesh/LocalMeshData.cpp
@@ -0,0 +1,322 @@
+// Copyright (C) 2008 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2011
+//
+// First added:  2008-11-28
+// Last changed: 2012-11-24
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "Mesh.h"
+#include "MeshDomains.h"
+#include "Vertex.h"
+#include "LocalMeshData.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+LocalMeshData::LocalMeshData(const MPI_Comm mpi_comm)
+  : num_global_vertices(0), num_global_cells(0),
+    num_vertices_per_cell(0), gdim(0), tdim(0), _mpi_comm(mpi_comm)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+LocalMeshData::LocalMeshData(const Mesh& mesh)
+  : num_global_vertices(0), num_global_cells(0), num_vertices_per_cell(0),
+    gdim(0), tdim(0), _mpi_comm(mesh.mpi_comm())
+{
+  Timer timer("build LocalMeshData");
+
+  // Extract data on main process and split among processes
+  if (MPI::is_broadcaster(mesh.mpi_comm()))
+  {
+    extract_mesh_data(mesh);
+    broadcast_mesh_data(mesh.mpi_comm());
+  }
+  else
+    receive_mesh_data(mesh.mpi_comm());
+}
+//-----------------------------------------------------------------------------
+LocalMeshData::~LocalMeshData()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::string LocalMeshData::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false);
+    s << std::endl;
+
+    s << "  Vertex coordinates" << std::endl;
+    s << "  ------------------" << std::endl;
+    for (std::size_t i = 0; i < vertex_coordinates.size(); i++)
+    {
+      s << "    " << i << ":";
+      for (std::size_t j = 0; j < vertex_coordinates[i].size(); j++)
+        s << " " << vertex_coordinates[i][j];
+      s << std::endl;
+    }
+    s << std::endl;
+
+    s << "  Vertex indices" << std::endl;
+    s << "  --------------" << std::endl;
+    for (std::size_t i = 0; i < vertex_coordinates.size(); i++)
+      s << "    " << i << ": " << vertex_indices[i] << std::endl;
+    s << std::endl;
+
+    s << "  Cell vertices" << std::endl;
+    s << "  ------------" << std::endl;
+    for (std::size_t i = 0; i < cell_vertices.shape()[0]; i++)
+    {
+      s << "    " << i << ":";
+      for (std::size_t j = 0; j < cell_vertices.shape()[1]; j++)
+        s << " " << cell_vertices[i][j];
+      s << std::endl;
+    }
+    s << std::endl;
+  }
+  else
+  {
+    s << "<LocalMeshData with "
+      << vertex_coordinates.size() << " vertices (out of "
+      << num_global_vertices << ") and "
+      << cell_vertices.shape()[0] << " cells (out of "
+      << num_global_cells << ")>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void LocalMeshData::clear()
+{
+  vertex_coordinates.resize(boost::extents[0][0]);
+  vertex_indices.clear();
+  cell_vertices.resize(boost::extents[0][0]);
+  global_cell_indices.clear();
+  num_global_vertices = 0;
+  num_global_cells = 0;
+  gdim = 0;
+  tdim = 0;
+  domain_data.clear();
+}
+//-----------------------------------------------------------------------------
+void LocalMeshData::extract_mesh_data(const Mesh& mesh)
+{
+  if (!mesh.domains().is_empty())
+  {
+    dolfin_error("LocalMeshData.cpp",
+                 "extract local mesh data",
+                 "Marked subdomains are not yet supported");
+  }
+
+  // Clear old data
+  clear();
+
+  // Set scalar data
+  gdim = mesh.geometry().dim();
+  tdim = mesh.topology().dim();
+  num_global_vertices = mesh.num_vertices();
+  num_global_cells = mesh.num_cells();
+  num_vertices_per_cell = mesh.type().num_entities(0);
+
+  // Get coordinates for all vertices stored on local processor
+  vertex_coordinates.resize(boost::extents[mesh.num_vertices()][gdim]);
+  for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+  {
+    const std::size_t index = vertex->index();
+    std::copy(vertex->x(), vertex->x() + gdim, vertex_coordinates[index].begin());
+  }
+
+  // Get global vertex indices for all vertices stored on local processor
+  vertex_indices.reserve(mesh.num_vertices());
+  for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+    vertex_indices.push_back(vertex->index());
+
+  // Get global vertex indices for all cells stored on local processor
+  cell_vertices.resize(boost::extents[mesh.num_cells()][num_vertices_per_cell]);
+  global_cell_indices.reserve(mesh.num_cells());
+  //  std::vector<std::size_t> vertices(num_vertices_per_cell);
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    const std::size_t index = cell->index();
+    global_cell_indices.push_back(index);
+    std::copy(cell->entities(0), cell->entities(0) + num_vertices_per_cell,
+              cell_vertices[index].begin());
+  }
+
+  cout << "Number of global vertices: " << num_global_vertices << endl;
+  cout << "Number of global cells: "    << num_global_cells << endl;
+}
+//-----------------------------------------------------------------------------
+void LocalMeshData::broadcast_mesh_data(const MPI_Comm mpi_comm)
+{
+  // Get number of processes
+  const std::size_t num_processes = MPI::size(mpi_comm);
+
+  // Broadcast simple scalar data
+  {
+    std::vector<std::size_t> values;
+    values.push_back(gdim);
+    values.push_back(tdim);
+    values.push_back(num_global_vertices);
+    values.push_back(num_global_cells);
+    values.push_back(num_vertices_per_cell);
+    MPI::broadcast(mpi_comm, values);
+  }
+
+  // Broadcast coordinates for vertices
+  {
+    std::vector<std::vector<double> > send_values(num_processes);
+    for (std::size_t p = 0; p < num_processes; p++)
+    {
+      const std::pair<std::size_t, std::size_t> local_range
+        = MPI::local_range(mpi_comm, p, num_global_vertices);
+      log(TRACE, "Sending %d vertices to process %d, range is (%d, %d)",
+          local_range.second - local_range.first, p, local_range.first, local_range.second);
+
+      send_values[p].reserve(gdim*(local_range.second - local_range.first));
+      for (std::size_t i = local_range.first; i < local_range.second; i++)
+      {
+        send_values[p].insert(send_values[p].end(),
+                              vertex_coordinates[i].begin(),
+                              vertex_coordinates[i].end());
+      }
+    }
+    std::vector<double> values;
+    MPI::scatter(mpi_comm, send_values, values);
+    unpack_vertex_coordinates(values);
+  }
+
+  // Broadcast global vertex indices
+  {
+    std::vector<std::vector<std::size_t> > send_values(num_processes);
+    for (std::size_t p = 0; p < num_processes; p++)
+    {
+      const std::pair<std::size_t, std::size_t> local_range
+        = MPI::local_range(mpi_comm, p, num_global_vertices);
+      send_values[p].reserve(local_range.second - local_range.first);
+      for (std::size_t i = local_range.first; i < local_range.second; i++)
+        send_values[p].push_back(vertex_indices[i]);
+    }
+    MPI::scatter(mpi_comm, send_values, vertex_indices);
+  }
+
+  dolfin_debug("check");
+  // Broadcast cell vertices
+  {
+    std::vector<std::vector<std::size_t> > send_values(num_processes);
+    for (std::size_t p = 0; p < num_processes; p++)
+    {
+      const std::pair<std::size_t, std::size_t> local_range
+        = MPI::local_range(mpi_comm, p, num_global_cells);
+      log(TRACE, "Sending %d cells to process %d, range is (%d, %d)",
+          local_range.second - local_range.first, p, local_range.first, local_range.second);
+      const std::size_t range = local_range.second - local_range.first;
+      send_values[p].reserve(range*(num_vertices_per_cell + 1));
+      for (std::size_t i = local_range.first; i < local_range.second; i++)
+      {
+        send_values[p].push_back(global_cell_indices[i]);
+        send_values[p].insert(send_values[p].end(),
+                              cell_vertices[i].begin(), cell_vertices[i].end());
+      }
+    }
+    std::vector<std::size_t> values;
+    MPI::scatter(mpi_comm, send_values, values);
+    unpack_cell_vertices(values);
+  }
+}
+//-----------------------------------------------------------------------------
+void LocalMeshData::receive_mesh_data(const MPI_Comm mpi_comm)
+{
+  dolfin_debug("check");
+  // Receive simple scalar data
+  {
+    std::vector<std::size_t> values;
+    MPI::broadcast(mpi_comm, values);
+    dolfin_assert(values.size() == 5);
+    gdim = values[0];
+    tdim = values[1];
+    num_global_vertices = values[2];
+    num_global_cells = values[3];
+    num_vertices_per_cell = values[4];
+  }
+
+  dolfin_debug("check");
+  // Receive coordinates for vertices
+  {
+    std::vector<std::vector<double> > send_values;
+    std::vector<double> values;
+    MPI::scatter(mpi_comm, send_values, values);
+    unpack_vertex_coordinates(values);
+  }
+
+  dolfin_debug("check");
+  // Receive global vertex indices
+  {
+    std::vector<std::vector<std::size_t> > send_values;
+    MPI::scatter(mpi_comm, send_values, vertex_indices);
+  }
+
+  dolfin_debug("check");
+  /// Receive coordinates for vertices
+  {
+    std::vector<std::vector<std::size_t> > send_values;
+    std::vector<std::size_t> values;
+    MPI::scatter(mpi_comm, send_values, values);
+    unpack_cell_vertices(values);
+  }
+}
+//-----------------------------------------------------------------------------
+void LocalMeshData::unpack_vertex_coordinates(const std::vector<double>& values)
+{
+  dolfin_assert(values.size() % gdim == 0);
+  const std::size_t num_vertices = values.size()/gdim;
+  vertex_coordinates.resize(boost::extents[num_vertices][gdim]);
+  for (std::size_t i = 0; i < num_vertices; i++)
+  {
+    std::copy(values.begin() + i*gdim, values.begin() + (i + 1)*gdim,
+              vertex_coordinates[i].begin());
+  }
+
+  log(TRACE, "Received %d vertex coordinates", vertex_coordinates.size());
+}
+//-----------------------------------------------------------------------------
+void LocalMeshData::unpack_cell_vertices(const std::vector<std::size_t>& values)
+{
+  const std::size_t num_cells = values.size()/(tdim + 2);
+  dolfin_assert(values.size() % (tdim + 2) == 0);
+  cell_vertices.resize(boost::extents[num_cells][num_vertices_per_cell]);
+  global_cell_indices.clear();
+  std::size_t k = 0;
+  for (std::size_t i = 0; i < num_cells; i++)
+  {
+    global_cell_indices.push_back(values[k++]);
+    for (std::size_t j = 0; j < tdim + 1; j++)
+      cell_vertices[i][j] = values[k++];
+  }
+
+  log(TRACE, "Received %d cell vertices", cell_vertices.size());
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/LocalMeshData.h b/dolfin/mesh/LocalMeshData.h
new file mode 100644
index 0000000..f69a124
--- /dev/null
+++ b/dolfin/mesh/LocalMeshData.h
@@ -0,0 +1,142 @@
+// Copyright (C) 2008 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008-2009.
+//
+// First added:  2008-11-28
+// Last changed: 2013-02-18
+//
+// Modified by Anders Logg, 2008-2009.
+// Modified by Kent-Andre Mardal, 2011.
+
+#ifndef __LOCAL_MESH_DATA_H
+#define __LOCAL_MESH_DATA_H
+
+#include <map>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Variable.h>
+#include "CellType.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class stores mesh data on a local processor corresponding
+  /// to a portion of a (larger) global mesh.
+  ///
+  /// Note that the data stored in this class does typically not
+  /// correspond to a topologically connected mesh; it merely stores a
+  /// list of vertex coordinates, a list of cell-vertex mappings and a
+  /// list of global vertex numbers for the locally stored vertices.
+  ///
+  /// It is typically used for parsing meshes in parallel from mesh
+  /// XML files. After local mesh data has been parsed on each
+  /// processor, a subsequent repartitioning takes place: first a
+  /// geometric partitioning of the vertices followed by a
+  /// redistribution of vertex and cell data, and then a topological
+  /// partitioning again followed by redistribution of vertex and cell
+  /// data, at that point corresponding to topologically connected
+  /// meshes instead of local mesh data.
+
+  class LocalMeshData : public Variable
+  {
+  public:
+
+    /// Create empty local mesh data
+    LocalMeshData(const MPI_Comm mpi_comm);
+
+    /// Create local mesh data for given mesh
+    LocalMeshData(const Mesh& mesh);
+
+    /// Destructor
+    ~LocalMeshData();
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    // Clear all data
+    void clear();
+
+    // Copy data from mesh
+    void extract_mesh_data(const Mesh& mesh);
+
+    // Broadcast mesh data from main process (used when Mesh is created
+    // on one process)
+    void broadcast_mesh_data(const MPI_Comm mpi_comm);
+
+    // Receive mesh data from main process
+    void receive_mesh_data(const MPI_Comm mpi_comm);
+
+    // Unpack received vertex coordinates
+    void unpack_vertex_coordinates(const std::vector<double>& values);
+
+    // Unpack received cell vertices
+    void unpack_cell_vertices(const std::vector<std::size_t>& values);
+
+    // Coordinates for all vertices stored on local processor
+    boost::multi_array<double, 2> vertex_coordinates;
+
+    // Global vertex indices for all vertices stored on local processor
+    std::vector<std::size_t> vertex_indices;
+
+    // Global vertex indices for all cells stored on local processor
+    boost::multi_array<std::size_t, 2> cell_vertices;
+
+    // Global cell numbers for all cells stored on local processor
+    std::vector<std::size_t> global_cell_indices;
+
+    // Optional process owner for each cell in  global_cell_indices
+    std::vector<std::size_t> cell_partition;
+
+    // Global number of vertices
+    std::size_t num_global_vertices;
+
+    // Global number of cells
+    std::size_t num_global_cells;
+
+    // Number of vertices per cell
+    std::size_t num_vertices_per_cell;
+
+    // Geometrical dimension
+    std::size_t gdim;
+
+    // Topological dimension
+    std::size_t tdim;
+
+    // Mesh domain data [dim](line, (cell_index, local_index, value))
+    std::map<std::size_t, std::vector<std::pair<std::pair<std::size_t,
+      std::size_t>, std::size_t> > >
+        domain_data;
+
+    // Return MPI communicator
+    MPI_Comm mpi_comm() const
+    { return _mpi_comm; }
+
+  private:
+
+    // MPI communicator. It is stored because it is used on some
+    // Zoltan call-back functions.
+    MPI_Comm _mpi_comm;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/LocalMeshValueCollection.h b/dolfin/mesh/LocalMeshValueCollection.h
new file mode 100644
index 0000000..8bf369b
--- /dev/null
+++ b/dolfin/mesh/LocalMeshValueCollection.h
@@ -0,0 +1,139 @@
+// Copyright (C) 2008-2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008-2009.
+//
+// First added:  2008-11-28
+// Last changed: 2011-03-25
+//
+// Modified by Anders Logg, 2008-2009.
+// Modified by Kent-Andre Mardal, 2011.
+
+
+#ifndef __LOCAL_MESH_VALUE_COLLECTION_H
+#define __LOCAL_MESH_VALUE_COLLECTION_H
+
+#include <map>
+#include <utility>
+#include <vector>
+#include <dolfin/common/MPI.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  template <typename T> class MeshValueCollection;
+
+  /// This class stores mesh data on a local processor corresponding
+  /// to a portion of a MeshValueCollection.
+
+  template <typename T>
+  class LocalMeshValueCollection
+  {
+  public:
+
+    /// Create local mesh data for given LocalMeshValueCollection
+    LocalMeshValueCollection(const MeshValueCollection<T>& values,
+                             std::size_t dim);
+
+    /// Destructor
+    ~LocalMeshValueCollection() {}
+
+    /// Return dimension of cell entity
+    std::size_t dim () const
+    { return _dim; }
+
+    /// Return data
+    const std::vector<std::pair<std::pair<std::size_t,
+      std::size_t>, T> >& values() const
+    { return _values; }
+
+  private:
+
+    // Topological dimension
+    const std::size_t _dim;
+
+    // MeshValueCollection values (cell_index, local_index), value))
+    std::vector<std::pair<std::pair<std::size_t, std::size_t>, T> >  _values;
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+  };
+
+  //---------------------------------------------------------------------------
+  // Implementation of LocalMeshValueCollection
+  //---------------------------------------------------------------------------
+  template <typename T>
+  LocalMeshValueCollection<T>::LocalMeshValueCollection(const MeshValueCollection<T>& values,
+                                                        std::size_t dim)
+    : _dim(dim), _mpi_comm(MPI_COMM_WORLD)
+  {
+    // Prepare data
+    std::vector<std::vector<std::size_t> > send_indices;
+    std::vector<std::vector<T> > send_v;
+
+    // Extract data on main process and split among processes
+    if (MPI::is_broadcaster(_mpi_comm))
+    {
+      // Get number of processes
+      const std::size_t num_processes = MPI::size(_mpi_comm);
+      send_indices.resize(num_processes);
+      send_v.resize(num_processes);
+
+      const std::map<std::pair<std::size_t, std::size_t>, T>& vals
+        = values.values();
+      for (std::size_t p = 0; p < num_processes; p++)
+      {
+        const std::pair<std::size_t, std::size_t> local_range
+          = MPI::local_range(_mpi_comm, p, vals.size());
+        typename std::map<std::pair<std::size_t,
+          std::size_t>, T>::const_iterator it = vals.begin();
+        std::advance(it, local_range.first);
+        for (std::size_t i = local_range.first; i < local_range.second; ++i)
+        {
+          send_indices[p].push_back(it->first.first);
+          send_indices[p].push_back(it->first.second);
+          send_v[p].push_back(it->second);
+          std::advance(it, 1);
+        }
+      }
+    }
+
+    // Scatter data
+    std::vector<std::size_t> indices;
+    std::vector<T> v;
+    MPI::scatter(_mpi_comm, send_indices, indices);
+    MPI::scatter(_mpi_comm, send_v, v);
+    dolfin_assert(2*v.size() == indices.size());
+
+    // Unpack
+    for (std::size_t i = 0; i < v.size(); ++i)
+    {
+      const std::size_t cell_index = indices[2*i];
+      const std::size_t local_entity_index = indices[2*i + 1];
+      const T value = v[i];
+      _values.push_back(std::make_pair(std::make_pair(cell_index,
+                                                      local_entity_index),
+                                       value));
+    }
+  }
+  //---------------------------------------------------------------------------
+
+}
+
+#endif
diff --git a/dolfin/mesh/Mesh.cpp b/dolfin/mesh/Mesh.cpp
new file mode 100644
index 0000000..f3946df
--- /dev/null
+++ b/dolfin/mesh/Mesh.cpp
@@ -0,0 +1,549 @@
+// Copyright (C) 2006-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman 2007
+// Modified by Garth N. Wells 2007-2011
+// Modified by Niclas Jansson 2008
+// Modified by Kristoffer Selim 2008
+// Modified by Andre Massing 2009-2010
+// Modified by Johannes Ring 2012
+// Modified by Marie E. Rognes 2012
+// Modified by Mikael Mortensen 2012
+// Modified by Jan Blechta 2013
+//
+// First added:  2006-05-09
+// Last changed: 2013-06-27
+
+#include <dolfin/ale/ALE.h>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/utils.h>
+#include <dolfin/function/Expression.h>
+#include <dolfin/generation/CSGMeshGenerator.h>
+#include <dolfin/io/File.h>
+#include <dolfin/log/log.h>
+#include <dolfin/geometry/BoundingBoxTree.h>
+#include "BoundaryMesh.h"
+#include "Cell.h"
+#include "Facet.h"
+#include "LocalMeshData.h"
+#include "MeshColoring.h"
+#include "MeshOrdering.h"
+#include "MeshPartitioning.h"
+#include "MeshRenumbering.h"
+#include "MeshSmoothing.h"
+#include "MeshTransformation.h"
+#include "TopologyComputation.h"
+#include "Vertex.h"
+#include "Mesh.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Mesh::Mesh() : Variable("mesh", "DOLFIN mesh"),
+               Hierarchical<Mesh>(*this),
+               _cell_type(0),
+               _ordered(false),
+               _cell_orientations(0),
+               _mpi_comm(MPI_COMM_WORLD)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Mesh::Mesh(MPI_Comm comm) : Variable("mesh", "DOLFIN mesh"),
+               Hierarchical<Mesh>(*this),
+               _cell_type(0),
+               _ordered(false),
+               _cell_orientations(0),
+               _mpi_comm(comm)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Mesh::Mesh(const Mesh& mesh) : Variable("mesh", "DOLFIN mesh"),
+                               Hierarchical<Mesh>(*this),
+                               _cell_type(0),
+                               _ordered(false),
+                               _cell_orientations(0),
+                               _mpi_comm(MPI_COMM_WORLD)
+{
+  *this = mesh;
+}
+//-----------------------------------------------------------------------------
+Mesh::Mesh(std::string filename) : Variable("mesh", "DOLFIN mesh"),
+                                   Hierarchical<Mesh>(*this),
+                                   _cell_type(0),
+                                   _ordered(false),
+                                   _cell_orientations(0),
+                                   _mpi_comm(MPI_COMM_WORLD)
+{
+  File file(_mpi_comm, filename);
+  file >> *this;
+  _cell_orientations.resize(this->num_cells(), -1);
+}
+//-----------------------------------------------------------------------------
+Mesh::Mesh(MPI_Comm comm, std::string filename)
+  : Variable("mesh", "DOLFIN mesh"), Hierarchical<Mesh>(*this),
+    _cell_type(0), _ordered(false), _cell_orientations(0), _mpi_comm(comm)
+{
+  File file(_mpi_comm, filename);
+  file >> *this;
+  _cell_orientations.resize(this->num_cells(), -1);
+}
+//-----------------------------------------------------------------------------
+Mesh::Mesh(MPI_Comm comm, LocalMeshData& local_mesh_data)
+  : Variable("mesh", "DOLFIN mesh"), Hierarchical<Mesh>(*this),
+    _cell_type(0), _ordered(false), _cell_orientations(0),
+    _mpi_comm(comm)
+{
+  MeshPartitioning::build_distributed_mesh(*this, local_mesh_data);
+}
+//-----------------------------------------------------------------------------
+Mesh::Mesh(const CSGGeometry& geometry, std::size_t resolution)
+  : Variable("mesh", "DOLFIN mesh"),
+    Hierarchical<Mesh>(*this),
+    _cell_type(0),
+    _ordered(false),
+    _cell_orientations(0),
+    _mpi_comm(MPI_COMM_WORLD)
+{
+  // Build mesh on process 0
+  if (MPI::rank(_mpi_comm) == 0)
+    CSGMeshGenerator::generate(*this, geometry, resolution);
+
+  // Build distributed mesh
+  if (MPI::size(_mpi_comm) > 1)
+    MeshPartitioning::build_distributed_mesh(*this);
+}
+//-----------------------------------------------------------------------------
+Mesh::Mesh(std::shared_ptr<const CSGGeometry> geometry,
+           std::size_t resolution)
+  : Variable("mesh", "DOLFIN mesh"),
+    Hierarchical<Mesh>(*this),
+    _cell_type(0),
+    _ordered(false),
+    _cell_orientations(0),
+    _mpi_comm(MPI_COMM_WORLD)
+{
+  assert(geometry);
+
+  // Build mesh on process 0
+  if (MPI::rank(_mpi_comm) == 0)
+    CSGMeshGenerator::generate(*this, *geometry, resolution);
+
+  // Build distributed mesh
+  if (MPI::size(_mpi_comm) > 1)
+    MeshPartitioning::build_distributed_mesh(*this);
+}
+//-----------------------------------------------------------------------------
+Mesh::~Mesh()
+{
+  clear();
+}
+//-----------------------------------------------------------------------------
+const Mesh& Mesh::operator=(const Mesh& mesh)
+{
+  // Clear all data
+  clear();
+
+  // Assign data
+  _topology = mesh._topology;
+  _geometry = mesh._geometry;
+  _domains = mesh._domains;
+  _data = mesh._data;
+  if (mesh._cell_type)
+    _cell_type = CellType::create(mesh._cell_type->cell_type());
+  _cell_orientations = mesh._cell_orientations;
+
+  // Rename
+  rename(mesh.name(), mesh.label());
+
+  // Call assignment operator for base class
+  Hierarchical<Mesh>::operator=(mesh);
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+MeshData& Mesh::data()
+{
+  return _data;
+}
+//-----------------------------------------------------------------------------
+const MeshData& Mesh::data() const
+{
+  return _data;
+}
+//-----------------------------------------------------------------------------
+std::size_t Mesh::init(std::size_t dim) const
+{
+  // This function is obviously not const since it may potentially
+  // compute new connectivity. However, in a sense all connectivity of
+  // a mesh always exists, it just hasn't been computed yet. The
+  // const_cast is also needed to allow iterators over a const Mesh to
+  // create new connectivity.
+
+  // Skip if mesh is empty
+  if (num_cells() == 0)
+  {
+    warning("Mesh is empty, unable to create entities of dimension %d.", dim);
+    return 0;
+  }
+
+  // Skip if already computed
+  if (_topology.size(dim) > 0)
+    return _topology.size(dim);
+
+  // Skip vertices and cells (should always exist)
+  if (dim == 0 || dim == _topology.dim())
+    return _topology.size(dim);
+
+  // Check that mesh is ordered
+  if (!ordered())
+  {
+    dolfin_error("Mesh.cpp",
+                 "initialize mesh entities",
+                 "Mesh is not ordered according to the UFC numbering convention. Consider calling mesh.order()");
+  }
+
+  // Compute connectivity
+  Mesh* mesh = const_cast<Mesh*>(this);
+  TopologyComputation::compute_entities(*mesh, dim);
+
+  // Order mesh if necessary
+  if (!ordered())
+    mesh->order();
+
+  return _topology.size(dim);
+}
+//-----------------------------------------------------------------------------
+void Mesh::init(std::size_t d0, std::size_t d1) const
+{
+  // This function is obviously not const since it may potentially
+  // compute new connectivity. However, in a sense all connectivity of
+  // a mesh always exists, it just hasn't been computed yet. The
+  // const_cast is also needed to allow iterators over a const Mesh to
+  // create new connectivity.
+
+  // Skip if mesh is empty
+  if (num_cells() == 0)
+  {
+    warning("Mesh is empty, unable to create connectivity %d --> %d.", d0, d1);
+    return;
+  }
+
+  // Skip if already computed
+  if (!_topology(d0, d1).empty())
+    return;
+
+  // Check that mesh is ordered
+  if (!ordered())
+  {
+    dolfin_error("Mesh.cpp",
+                 "initialize mesh connectivity",
+                 "Mesh is not ordered according to the UFC numbering convention. Consider calling mesh.order()");
+  }
+
+  // Compute connectivity
+  Mesh* mesh = const_cast<Mesh*>(this);
+  TopologyComputation::compute_connectivity(*mesh, d0, d1);
+
+  // Order mesh if necessary
+  if (!ordered())
+    mesh->order();
+}
+//-----------------------------------------------------------------------------
+void Mesh::init() const
+{
+  // Compute all entities
+  for (std::size_t d = 0; d <= topology().dim(); d++)
+    init(d);
+
+  // Compute all connectivity
+  for (std::size_t d0 = 0; d0 <= topology().dim(); d0++)
+    for (std::size_t d1 = 0; d1 <= topology().dim(); d1++)
+      init(d0, d1);
+}
+//-----------------------------------------------------------------------------
+void Mesh::clear()
+{
+  _topology.clear();
+  _geometry.clear();
+  _data.clear();
+  delete _cell_type;
+  _cell_type = 0;
+  _ordered = false;
+  _cell_orientations.clear();
+}
+//-----------------------------------------------------------------------------
+void Mesh::clean()
+{
+  const std::size_t D = topology().dim();
+  for (std::size_t d0 = 0; d0 <= D; d0++)
+  {
+    for (std::size_t d1 = 0; d1 <= D; d1++)
+    {
+      if (!(d0 == D && d1 == 0))
+        _topology.clear(d0, d1);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void Mesh::order()
+{
+  // Order mesh
+  MeshOrdering::order(*this);
+
+  // Remember that the mesh has been ordered
+  _ordered = true;
+
+  // Clear cell_orientations (as these depend on the ordering)
+  _cell_orientations.clear();
+}
+//-----------------------------------------------------------------------------
+bool Mesh::ordered() const
+{
+  // Don't check if we know (or think we know) that the mesh is ordered
+  if (_ordered)
+    return true;
+
+  _ordered = MeshOrdering::ordered(*this);
+  return _ordered;
+}
+//-----------------------------------------------------------------------------
+dolfin::Mesh Mesh::renumber_by_color() const
+{
+  std::vector<std::size_t> coloring_type;
+  const std::size_t D = topology().dim();
+  coloring_type.push_back(D);
+  coloring_type.push_back(0);
+  coloring_type.push_back(D);
+  return MeshRenumbering::renumber_by_color(*this, coloring_type);
+}
+//-----------------------------------------------------------------------------
+void Mesh::translate(const Point& point)
+{
+  MeshTransformation::translate(*this, point);
+}
+//-----------------------------------------------------------------------------
+void Mesh::rotate(double angle, std::size_t axis)
+{
+  MeshTransformation::rotate(*this, angle, axis);
+}
+//-----------------------------------------------------------------------------
+void Mesh::rotate(double angle, std::size_t axis, const Point& point)
+{
+  MeshTransformation::rotate(*this, angle, axis, point);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<MeshDisplacement> Mesh::move(BoundaryMesh& boundary)
+{
+  return ALE::move(*this, boundary);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<MeshDisplacement> Mesh::move(Mesh& mesh)
+{
+  return ALE::move(*this, mesh);
+}
+//-----------------------------------------------------------------------------
+void Mesh::move(const GenericFunction& displacement)
+{
+  ALE::move(*this, displacement);
+}
+//-----------------------------------------------------------------------------
+void Mesh::smooth(std::size_t num_iterations)
+{
+  MeshSmoothing::smooth(*this, num_iterations);
+}
+//-----------------------------------------------------------------------------
+void Mesh::smooth_boundary(std::size_t num_iterations, bool harmonic_smoothing)
+{
+  MeshSmoothing::smooth_boundary(*this, num_iterations, harmonic_smoothing);
+}
+//-----------------------------------------------------------------------------
+void Mesh::snap_boundary(const SubDomain& sub_domain, bool harmonic_smoothing)
+{
+  MeshSmoothing::snap_boundary(*this, sub_domain, harmonic_smoothing);
+}
+//-----------------------------------------------------------------------------
+const std::vector<std::size_t>& Mesh::color(std::string coloring_type) const
+{
+  // Define graph type
+  const std::size_t dim = MeshColoring::type_to_dim(coloring_type, *this);
+  std::vector<std::size_t> _coloring_type;
+  _coloring_type.push_back(topology().dim());
+  _coloring_type.push_back(dim);
+  _coloring_type.push_back(topology().dim());
+
+  return color(_coloring_type);
+}
+//-----------------------------------------------------------------------------
+const std::vector<std::size_t>&
+Mesh::color(std::vector<std::size_t> coloring_type) const
+{
+  // Find color data
+  std::map<std::vector<std::size_t>, std::pair<std::vector<std::size_t>,
+           std::vector<std::vector<std::size_t> > > >::const_iterator
+    coloring_data = this->topology().coloring.find(coloring_type);
+
+  if (coloring_data != this->topology().coloring.end())
+  {
+    dolfin_debug("Mesh has already been colored, not coloring again.");
+    return coloring_data->second.first;
+  }
+
+  // We do the same const-cast trick here as in the init() functions
+  // since we are not really changing the mesh, just attaching some
+  // auxiliary data to it.
+  Mesh* _mesh = const_cast<Mesh*>(this);
+  return MeshColoring::color(*_mesh, coloring_type);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<BoundingBoxTree> Mesh::bounding_box_tree() const
+{
+  // Allocate and build tree if necessary
+  if (!_tree)
+  {
+    _tree.reset(new BoundingBoxTree());
+    _tree->build(*this);
+  }
+
+  return _tree;
+}
+//-----------------------------------------------------------------------------
+double Mesh::hmin() const
+{
+  CellIterator cell(*this);
+  double h = cell->diameter();
+  for (; !cell.end(); ++cell)
+    h = std::min(h, cell->diameter());
+
+  return h;
+}
+//-----------------------------------------------------------------------------
+double Mesh::hmax() const
+{
+  CellIterator cell(*this);
+  double h = cell->diameter();
+  for (; !cell.end(); ++cell)
+    h = std::max(h, cell->diameter());
+
+  return h;
+}
+//-----------------------------------------------------------------------------
+double Mesh::rmin() const
+{
+  CellIterator cell(*this);
+  double r = cell->inradius();
+  for (; !cell.end(); ++cell)
+    r = std::min(r, cell->inradius());
+
+  return r;
+}
+//-----------------------------------------------------------------------------
+double Mesh::rmax() const
+{
+  CellIterator cell(*this);
+  double r = cell->inradius();
+  for (; !cell.end(); ++cell)
+    r = std::max(r, cell->inradius());
+
+  return r;
+}
+//-----------------------------------------------------------------------------
+std::size_t Mesh::hash() const
+{
+  // Get local hashes
+  const std::size_t kt_local = _topology.hash();
+  const std::size_t kg_local = _geometry.hash();
+
+  // Compute global hash
+  const std::size_t kt = hash_global(_mpi_comm, kt_local);
+  const std::size_t kg = hash_global(_mpi_comm, kg_local);
+
+  // Compute hash based on the Cantor pairing function
+  return (kt + kg)*(kt + kg + 1)/2 + kg;
+}
+//-----------------------------------------------------------------------------
+std::string Mesh::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    s << indent(_geometry.str(true));
+    s << indent(_topology.str(true));
+    s << indent(_data.str(true));
+  }
+  else
+  {
+    std::string cell_type("undefined cell type");
+    if (_cell_type)
+      cell_type = _cell_type->description(true);
+
+    s << "<Mesh of topological dimension "
+      << topology().dim() << " ("
+      << cell_type << ") with "
+      << num_vertices() << " vertices and "
+      << num_cells() << " cells, "
+      << (_ordered ? "ordered" : "unordered") << ">";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+const std::vector<int>& Mesh::cell_orientations() const
+{
+  return _cell_orientations;
+}
+//-----------------------------------------------------------------------------
+std::vector<int>& Mesh::cell_orientations()
+{
+  return _cell_orientations;
+}
+//-----------------------------------------------------------------------------
+void Mesh::init_cell_orientations(const Expression& global_normal)
+{
+  // Check that global_normal has the right size
+  if (global_normal.value_size() != 3)
+  {
+     dolfin_error("Mesh.cpp",
+                  "initialize cell orientations",
+                  "Global normal value size is assumed to be 3 (not %d)",
+                  global_normal.value_size());
+  }
+
+  Array<double> values(3);
+  Point up;
+  for (CellIterator cell(*this); !cell.end(); ++cell)
+  {
+    // Extract cell midpoint as Array
+    const Array<double> x(3, cell->midpoint().coordinates());
+
+    // Evaluate global normal at cell midpoint
+    global_normal.eval(values, x);
+
+    // Extract values as Point
+    for (unsigned int i = 0; i < 3; i++)
+      up[i] = values[i];
+
+    // Set orientation as orientation relative to up direction.
+    _cell_orientations[cell->index()] = cell->orientation(up);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/Mesh.h b/dolfin/mesh/Mesh.h
new file mode 100644
index 0000000..cfd2ba6
--- /dev/null
+++ b/dolfin/mesh/Mesh.h
@@ -0,0 +1,702 @@
+// Copyright (C) 2006-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman 2007
+// Modified by Magnus Vikstrøm 2007
+// Modified by Garth N. Wells 2007-2013
+// Modified by Niclas Jansson 2008
+// Modified by Kristoffer Selim 2008
+// Modified by Andre Massing 2009-2010
+// Modified by Marie E. Rognes 2012
+// Modified by Mikael Mortensen 2012
+// Modified by Jan Blechta 2013
+//
+// First added:  2006-05-08
+// Last changed: 2013-06-27
+
+#ifndef __MESH_H
+#define __MESH_H
+
+#include <string>
+#include <utility>
+#include <memory>
+
+#include <dolfin/ale/MeshDisplacement.h>
+#include <dolfin/common/Hierarchical.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Variable.h>
+#include "MeshData.h"
+#include "MeshDomains.h"
+#include "MeshGeometry.h"
+#include "MeshConnectivity.h"
+#include "MeshTopology.h"
+
+namespace dolfin
+{
+  class BoundaryMesh;
+  class CellType;
+  class CSGGeometry;
+  class Expression;
+  class GenericFunction;
+  class LocalMeshData;
+  class MeshEntity;
+  class Point;
+  class SubDomain;
+  class BoundingBoxTree;
+
+  /// A _Mesh_ consists of a set of connected and numbered mesh entities.
+  ///
+  /// Both the representation and the interface are
+  /// dimension-independent, but a concrete interface is also provided
+  /// for standard named mesh entities:
+  ///
+  /// .. tabularcolumns:: |c|c|c|
+  ///
+  /// +--------+-----------+-------------+
+  /// | Entity | Dimension | Codimension |
+  /// +========+===========+=============+
+  /// | Vertex |  0        |             |
+  /// +--------+-----------+-------------+
+  /// | Edge   |  1        |             |
+  /// +--------+-----------+-------------+
+  /// | Face   |  2        |             |
+  /// +--------+-----------+-------------+
+  /// | Facet  |           |      1      |
+  /// +--------+-----------+-------------+
+  /// | Cell   |           |      0      |
+  /// +--------+-----------+-------------+
+  ///
+  /// When working with mesh iterators, all entities and connectivity
+  /// are precomputed automatically the first time an iterator is
+  /// created over any given topological dimension or connectivity.
+  ///
+  /// Note that for efficiency, only entities of dimension zero
+  /// (vertices) and entities of the maximal dimension (cells) exist
+  /// when creating a _Mesh_. Other entities must be explicitly created
+  /// by calling init(). For example, all edges in a mesh may be
+  /// created by a call to mesh.init(1). Similarly, connectivities
+  /// such as all edges connected to a given vertex must also be
+  /// explicitly created (in this case by a call to mesh.init(0, 1)).
+
+  class Mesh : public Variable, public Hierarchical<Mesh>
+  {
+  public:
+
+    /// Create empty mesh
+    Mesh();
+
+    /// Create empty mesh
+    Mesh(MPI_Comm comm);
+
+    /// Copy constructor.
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         Object to be copied.
+    Mesh(const Mesh& mesh);
+
+    /// Create mesh from data file.
+    ///
+    /// *Arguments*
+    ///     filename (std::string)
+    ///         Name of file to load.
+    explicit Mesh(std::string filename);
+
+    /// Create mesh from data file.
+    ///
+    /// *Arguments*
+    ///     comm (MPI_Comm)
+    ///         The MPI communicator
+    ///     filename (std::string)
+    ///         Name of file to load.
+    Mesh(MPI_Comm comm, std::string filename);
+
+    /// Create a distributed mesh from local (per process) data.
+    ///
+    /// *Arguments*
+    ///     comm (MPI_Comm)
+    ///         MPI communicator for the mesh.
+    ///     local_mesh_data (_LocalMeshData_)
+    ///         Data from which to build the mesh.
+    Mesh(MPI_Comm comm, LocalMeshData& local_mesh_data);
+
+    /// Create mesh defined by Constructive Solid Geometry (CSG)
+    ///
+    /// *Arguments*
+    ///     geometry (_CSGGeometry_)
+    ///         The CSG geometry
+    ///     resolution (std::size_t)
+    ///         An integer specifying the mesh resolution
+    Mesh(const CSGGeometry& geometry, std::size_t resolution);
+
+    /// Create mesh defined by Constructive Solid Geometry (CSG)
+    ///
+    /// *Arguments*
+    ///     geometry (_CSGGeometry_)
+    ///         The CSG geometry
+    ///     resolution (std::size_t)
+    ///         An integer specifying the mesh resolution
+    Mesh(std::shared_ptr<const CSGGeometry> geometry,
+         std::size_t resolution);
+
+    /// Destructor.
+    ~Mesh();
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         Another _Mesh_ object.
+    const Mesh& operator=(const Mesh& mesh);
+
+    /// Get number of vertices in mesh.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of vertices.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::size_t num_vertices() const
+    { return _topology.size(0); }
+
+    /// Get number of edges in mesh.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of edges.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::size_t num_edges() const
+    { return _topology.size(1); }
+
+    /// Get number of faces in mesh.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of faces.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::size_t num_faces() const
+    { return _topology.size(2); }
+
+    /// Get number of facets in mesh.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of facets.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::size_t num_facets() const
+    { return _topology.size(_topology.dim() - 1); }
+
+    /// Get number of cells in mesh.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of cells.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::size_t num_cells() const
+    { return _topology.size(_topology.dim()); }
+
+    /// Get number of entities of given topological dimension.
+    ///
+    /// *Arguments*
+    ///     d (std::size_t)
+    ///         Topological dimension.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of entities of topological dimension d.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::size_t num_entities(std::size_t d) const
+    { return _topology.size(d); }
+
+    /// Get vertex coordinates.
+    ///
+    /// *Returns*
+    ///     std::vector<double>&
+    ///         Coordinates of all vertices.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::vector<double>& coordinates()
+    { return _geometry.x(); }
+
+    /// Return coordinates of all vertices (const version).
+    const std::vector<double>& coordinates() const
+    { return _geometry.x(); }
+
+    /// Get cell connectivity.
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         Connectivity for all cells.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    const std::vector<unsigned int>& cells() const
+    { return _topology(_topology.dim(), 0)(); }
+
+    /// Get number of local entities of given topological dimension.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         Topological dimension.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of local entities of topological dimension d.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::size_t size(std::size_t dim) const
+    { return _topology.size(dim); }
+
+    /// Get global number of entities of given topological dimension.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         Topological dimension.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Global number of entities of topological dimension d.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::size_t size_global(std::size_t dim) const
+    { return _topology.size_global(dim); }
+
+    /// Get mesh topology.
+    ///
+    /// *Returns*
+    ///     _MeshTopology_
+    ///         The topology object associated with the mesh.
+    MeshTopology& topology()
+    { return _topology; }
+
+    /// Get mesh topology (const version).
+    const MeshTopology& topology() const
+    { return _topology; }
+
+    /// Get mesh geometry.
+    ///
+    /// *Returns*
+    ///     _MeshGeometry_
+    ///         The geometry object associated with the mesh.
+    MeshGeometry& geometry()
+    { return _geometry; }
+
+    /// Get mesh geometry (const version).
+    const MeshGeometry& geometry() const
+    { return _geometry; }
+
+    /// Get mesh (sub)domains.
+    ///
+    /// *Returns*
+    ///     _MeshDomains_
+    ///         The (sub)domains associated with the mesh.
+    MeshDomains& domains()
+    { return _domains; }
+
+    /// Get mesh (sub)domains.
+    const MeshDomains& domains() const
+    { return _domains; }
+
+    /// Get bounding box tree for mesh. The bounding box tree is
+    /// initialized and built upon the first call to this
+    /// function. The bounding box tree can be used to compute
+    /// collisions between the mesh and other objects. It is the
+    /// responsibility of the caller to use (and possibly rebuild) the
+    /// tree. It is stored as a (mutable) member of the mesh to enable
+    /// sharing of the bounding box tree data structure.
+    std::shared_ptr<BoundingBoxTree> bounding_box_tree() const;
+
+    /// Get mesh data.
+    ///
+    /// *Returns*
+    ///     _MeshData_
+    ///         The mesh data object associated with the mesh.
+    MeshData& data();
+
+    /// Get mesh data (const version).
+    const MeshData& data() const;
+
+    /// Get mesh cell type.
+    ///
+    /// *Returns*
+    ///     _CellType_
+    ///         The cell type object associated with the mesh.
+    CellType& type()
+    { dolfin_assert(_cell_type); return *_cell_type; }
+
+    /// Get mesh cell type (const version).
+    const CellType& type() const
+    { dolfin_assert(_cell_type); return *_cell_type; }
+
+    /// Compute entities of given topological dimension.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         Topological dimension.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         Number of created entities.
+    std::size_t init(std::size_t dim) const;
+
+    /// Compute connectivity between given pair of dimensions.
+    ///
+    /// *Arguments*
+    ///     d0 (std::size_t)
+    ///         Topological dimension.
+    ///
+    ///     d1 (std::size_t)
+    ///         Topological dimension.
+    void init(std::size_t d0, std::size_t d1) const;
+
+    /// Compute all entities and connectivity.
+    void init() const;
+
+    /// Clear all mesh data.
+    void clear();
+
+    /// Clean out all auxiliary topology data. This clears all
+    /// topological data, except the connectivity between cells and
+    /// vertices.
+    void clean();
+
+    /// Order all mesh entities.
+    ///
+    /// .. seealso::
+    ///
+    ///     UFC documentation (put link here!)
+    void order();
+
+    /// Check if mesh is ordered according to the UFC numbering convention.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         The return values is true iff the mesh is ordered.
+    bool ordered() const;
+
+    /// Renumber mesh entities by coloring. This function is currently
+    /// restricted to renumbering by cell coloring. The cells
+    /// (cell-vertex connectivity) and the coordinates of the mesh are
+    /// renumbered to improve the locality within each color. It is
+    /// assumed that the mesh has already been colored and that only
+    /// cell-vertex connectivity exists as part of the mesh.
+    Mesh renumber_by_color() const;
+
+    /// Translate mesh according to a given vector.
+    ///
+    /// *Arguments*
+    ///     point (Point)
+    ///         The vector defining the translation.
+    void translate(const Point& point);
+
+    /// Rotate mesh around a coordinate axis through center of mass
+    /// of all mesh vertices
+    ///
+    /// *Arguments*
+    ///     angle (double)
+    ///         The number of degrees (0-360) of rotation.
+    ///     axis (std::size_t)
+    ///         The coordinate axis around which to rotate the mesh.
+    void rotate(double angle, std::size_t axis=2);
+
+    /// Rotate mesh around a coordinate axis through a given point
+    ///
+    /// *Arguments*
+    ///     angle (double)
+    ///         The number of degrees (0-360) of rotation.
+    ///     axis (std::size_t)
+    ///         The coordinate axis around which to rotate the mesh.
+    ///     point (_Point_)
+    ///         The point around which to rotate the mesh.
+    void rotate(double angle, std::size_t axis, const Point& point);
+
+    /// Move coordinates of mesh according to new boundary coordinates.
+    ///
+    /// *Arguments*
+    ///     boundary (_BoundaryMesh_)
+    ///         A mesh containing just the boundary cells.
+    ///
+    /// *Returns*
+    ///     MeshDisplacement
+    ///         Displacement encapsulated in Expression subclass
+    ///         MeshDisplacement.
+    std::shared_ptr<MeshDisplacement> move(BoundaryMesh& boundary);
+
+    /// Move coordinates of mesh according to adjacent mesh with
+    /// common global vertices.
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         A _Mesh_ object.
+    ///
+    /// *Returns*
+    ///     MeshDisplacement
+    ///         Displacement encapsulated in Expression subclass
+    ///         MeshDisplacement.
+    std::shared_ptr<MeshDisplacement> move(Mesh& mesh);
+
+    /// Move coordinates of mesh according to displacement function.
+    ///
+    /// *Arguments*
+    ///     displacement (_GenericFunction_)
+    ///         A _GenericFunction_ object.
+    void move(const GenericFunction& displacement);
+
+    /// Smooth internal vertices of mesh by local averaging.
+    ///
+    /// *Arguments*
+    ///     num_iterations (std::size_t)
+    ///         Number of iterations to perform smoothing,
+    ///         default value is 1.
+    void smooth(std::size_t num_iterations=1);
+
+    /// Smooth boundary vertices of mesh by local averaging.
+    ///
+    /// *Arguments*
+    ///     num_iterations (std::size_t)
+    ///         Number of iterations to perform smoothing,
+    ///         default value is 1.
+    ///
+    ///     harmonic_smoothing (bool)
+    ///         Flag to turn on harmonics smoothing, default
+    ///         value is true.
+    void smooth_boundary(std::size_t num_iterations=1,
+                         bool harmonic_smoothing=true);
+
+    /// Snap boundary vertices of mesh to match given sub domain.
+    ///
+    /// *Arguments*
+    ///     sub_domain (_SubDomain_)
+    ///         A _SubDomain_ object.
+    ///
+    ///     harmonic_smoothing (bool)
+    ///         Flag to turn on harmonics smoothing, default
+    ///         value is true.
+    void snap_boundary(const SubDomain& sub_domain,
+                       bool harmonic_smoothing=true);
+
+    /// Color the cells of the mesh such that no two neighboring cells
+    /// share the same color. A colored mesh keeps a
+    /// CellFunction<std::size_t> named "cell colors" as mesh data which
+    /// holds the colors of the mesh.
+    ///
+    /// *Arguments*
+    ///     coloring_type (std::string)
+    ///         Coloring type, specifying what relation makes two
+    ///         cells neighbors, can be one of "vertex", "edge" or
+    ///         "facet".
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         The colors as a mesh function over the cells of the mesh.
+    const std::vector<std::size_t>& color(std::string coloring_type) const;
+
+    /// Color the cells of the mesh such that no two neighboring cells
+    /// share the same color. A colored mesh keeps a
+    /// CellFunction<std::size_t> named "cell colors" as mesh data which
+    /// holds the colors of the mesh.
+    ///
+    /// *Arguments*
+    ///     coloring_type (std::vector<std::size_t>)
+    ///         Coloring type given as list of topological dimensions,
+    ///         specifying what relation makes two mesh entinties neighbors.
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         The colors as a mesh function over entities of the mesh.
+    const std::vector<std::size_t>&
+      color(std::vector<std::size_t> coloring_type) const;
+
+    /// Compute minimum cell diameter.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The minimum cell diameter, the diameter is computed as
+    ///         two times the circumradius
+    ///         (http://mathworld.wolfram.com).
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    double hmin() const;
+
+    /// Compute maximum cell diameter.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The maximum cell diameter, the diameter is computed as
+    ///         two times the circumradius
+    ///         (http://mathworld.wolfram.com).
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    double hmax() const;
+
+    /// Compute minimum cell inradius.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The minimum of cells' inscribed sphere radii
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    double rmin() const;
+
+    /// Compute maximum cell inradius.
+    ///
+    /// *Returns*
+    ///     double
+    ///         The maximum of cells' inscribed sphere radii
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    double rmax() const;
+
+    /// Compute hash of mesh, currently based on the has of the mesh
+    /// geometry and mesh topology.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         A tree-hashed value of the coordinates over all MPI processes
+    ///
+    std::size_t hash() const;
+
+    /// Informal string representation.
+    ///
+    /// *Arguments*
+    ///     verbose (bool)
+    ///         Flag to turn on additional output.
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         An informal representation of the mesh.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         No example code available for this function.
+    std::string str(bool verbose) const;
+
+    /// Return cell_orientations
+    ///
+    /// *Returns*
+    ///     std::vector<int>
+    ///         Map from cell index to orientation of cell
+    std::vector<int>& cell_orientations();
+
+    /// Return cell_orientations (const version)
+    ///
+    /// *Returns*
+    ///     std::vector<int>
+    ///         Map from cell index to orientation of cell
+    const std::vector<int>& cell_orientations() const;
+
+    /// Compute and initialize cell_orientations relative to a given
+    /// global outward direction/normal/orientation. Only defined if
+    /// mesh is orientable.
+    ///
+    /// *Arguments*
+    ///     global_normal (Expression)
+    ///         A global normal direction to the mesh
+    void init_cell_orientations(const Expression& global_normal);
+
+    /// Mesh MPI communicator
+    MPI_Comm mpi_comm() const
+    { return _mpi_comm; }
+
+  private:
+
+    // Friends
+    friend class MeshEditor;
+    friend class TopologyComputation;
+    friend class MeshOrdering;
+    friend class BinaryFile;
+
+    // Mesh topology
+    MeshTopology _topology;
+
+    // Mesh geometry
+    MeshGeometry _geometry;
+
+    // Mesh domains
+    MeshDomains _domains;
+
+    // Auxiliary mesh data
+    MeshData _data;
+
+    // Bounding box tree used to compute collisions between the mesh
+    // and other objects. The tree is initialized to a zero pointer
+    // and is allocated and built when bounding_box_tree() is called.
+    mutable std::shared_ptr<BoundingBoxTree> _tree;
+
+    // Cell type
+    CellType* _cell_type;
+
+    // True if mesh has been ordered
+    mutable bool _ordered;
+
+    // Orientation of cells relative to a global direction
+    std::vector<int> _cell_orientations;
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+  };
+}
+
+#endif
diff --git a/dolfin/mesh/MeshColoring.cpp b/dolfin/mesh/MeshColoring.cpp
new file mode 100644
index 0000000..c7d763b
--- /dev/null
+++ b/dolfin/mesh/MeshColoring.cpp
@@ -0,0 +1,181 @@
+// Copyright (C) 2010-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2010-2011
+// Modified by Johannes Ring 2011
+//
+// First added:  2010-11-15
+// Last changed: 2011-11-14
+
+#include <map>
+#include <utility>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/utils.h>
+#include <dolfin/graph/Graph.h>
+#include <dolfin/graph/GraphBuilder.h>
+#include <dolfin/graph/GraphColoring.h>
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "Edge.h"
+#include "Facet.h"
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshEntityIterator.h"
+#include "Vertex.h"
+#include "MeshColoring.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+const std::vector<std::size_t>& MeshColoring::color_cells(Mesh& mesh,
+                                                     std::string coloring_type)
+{
+  // Define graph type
+  std::vector<std::size_t> _coloring_type;
+  _coloring_type.push_back(mesh.topology().dim());
+  _coloring_type.push_back(type_to_dim(coloring_type, mesh));
+  _coloring_type.push_back(mesh.topology().dim());
+
+  return color(mesh, _coloring_type);
+}
+//-----------------------------------------------------------------------------
+const std::vector<std::size_t>&
+MeshColoring::color(Mesh& mesh,
+                    const std::vector<std::size_t>& coloring_type)
+{
+  // Convenience typedefs
+  typedef std::pair<std::vector<std::size_t>, std::vector<std::vector<std::size_t> > > ColorData;
+
+  info("Coloring mesh.");
+
+  // Create empty coloring data
+  ColorData _color_data;
+
+  // Clear any old data
+  mesh.topology().coloring.erase(coloring_type);
+
+  // Create coloring data
+  mesh.topology().coloring.insert(std::make_pair(coloring_type, _color_data));
+
+  // Convenience references to data
+  dolfin_assert(mesh.topology().coloring.find(coloring_type) != mesh.topology().coloring.end());
+  ColorData& color_data = mesh.topology().coloring.find(coloring_type)->second;
+
+  std::vector<std::size_t>& colors = color_data.first;
+  std::vector<std::vector<std::size_t> >& entities_of_color = color_data.second;
+
+  // Initialise mesh function for colors and compute coloring
+  const std::size_t colored_entity_dim = coloring_type[0];
+  colors.resize(mesh.num_entities(colored_entity_dim));
+  const std::size_t num_colors = MeshColoring::compute_colors(mesh, colors,
+                                                       coloring_type);
+
+  // Build lists of entities for each color
+  entities_of_color.resize(num_colors);
+  for (std::size_t i = 0; i < colors.size(); i++)
+  {
+    const std::size_t color = colors[i];
+    dolfin_assert(color < num_colors);
+    entities_of_color[color].push_back(i);
+  }
+
+  return colors;
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshColoring::compute_colors(const Mesh& mesh,
+                                          std::vector<std::size_t>& colors,
+                                          const std::vector<std::size_t>& coloring_type)
+{
+  if (coloring_type.front() != coloring_type.back())
+  {
+    dolfin_error("MeshColoring.cpp",
+                 "compute mesh colors",
+                 "Mesh coloring does not support dim i - j coloring");
+  }
+
+  // Create graph
+  Graph graph;
+  if (coloring_type.size() == 3)
+    graph = GraphBuilder::local_graph(mesh, coloring_type[0], coloring_type[1]);
+  else
+    graph = GraphBuilder::local_graph(mesh, coloring_type);
+
+  // Color graph
+  return GraphColoring::compute_local_vertex_coloring(graph, colors);
+}
+//-----------------------------------------------------------------------------
+CellFunction<std::size_t> MeshColoring::cell_colors(const Mesh& mesh,
+                                       std::string coloring_type)
+{
+  // Get graph/coloring type
+  const std::size_t dim = MeshColoring::type_to_dim(coloring_type, mesh);
+  std::vector<std::size_t> _coloring_type;
+  _coloring_type.push_back(mesh.topology().dim());
+  _coloring_type.push_back(dim);
+  _coloring_type.push_back(mesh.topology().dim());
+
+  return cell_colors(mesh, _coloring_type);
+}
+//-----------------------------------------------------------------------------
+CellFunction<std::size_t> MeshColoring::cell_colors(const Mesh& mesh,
+                              const std::vector<std::size_t> coloring_type)
+{
+
+  // Get color data
+  std::map<std::vector<std::size_t>, std::pair<std::vector<std::size_t>,
+           std::vector<std::vector<std::size_t> > > >::const_iterator coloring_data;
+  coloring_data = mesh.topology().coloring.find(coloring_type);
+
+  // Check that coloring has been computed
+  if (coloring_data == mesh.topology().coloring.end())
+  {
+    dolfin_error("MeshColoring.cpp",
+                 "get coloring as MeshFunction",
+                 "Requested coloring has not been computed");
+  }
+
+  // Colors
+  const std::vector<std::size_t>& colors = coloring_data->second.first;
+
+  CellFunction<std::size_t> mf(mesh);
+  dolfin_assert(colors.size() == mesh.num_entities(coloring_type[0]));
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+    mf[*cell] = colors[cell->index()];
+  return mf;
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshColoring::type_to_dim(std::string coloring_type,
+                                       const Mesh& mesh)
+{
+  // Check that coloring type is valid
+  if (coloring_type != "vertex" && coloring_type != "edge" && coloring_type != "facet")
+  {
+    dolfin_error("MeshColoring.cpp",
+                 "compute mesh colors",
+                 "Unknown coloring type (\"%s\"). Known options are \"vertex\", \"edge\" and \"facet\"",
+                 coloring_type.c_str());
+  }
+
+  // Select topological dimension
+  if (coloring_type == "vertex")
+    return 0;
+  else if (coloring_type == "edge")
+    return 1;
+  else
+    return mesh.topology().dim() - 1;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshColoring.h b/dolfin/mesh/MeshColoring.h
new file mode 100644
index 0000000..4973816
--- /dev/null
+++ b/dolfin/mesh/MeshColoring.h
@@ -0,0 +1,76 @@
+// Copyright (C) 2010-2011 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010.
+//
+// First added:  2010-11-15
+// Last changed: 2011-01-29
+
+#ifndef __MESH_COLORING_H
+#define __MESH_COLORING_H
+
+#include <string>
+#include <vector>
+#include "Cell.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class computes colorings for a local mesh. It supports
+  /// vertex, edge, and facet-based colorings.
+
+  class MeshColoring
+  {
+  public:
+
+    /// Color the cells of a mesh for given coloring type, which can
+    /// be one of "vertex", "edge" or "facet". Coloring is saved in the
+    /// mesh topology
+    static const std::vector<std::size_t>& color_cells(Mesh& mesh,
+                                                 std::string coloring_type);
+
+    /// Color the cells of a mesh for given coloring type specified by
+    /// topological dimension, which can be one of 0, 1 or D - 1. Coloring
+    /// is saved in the mesh topology
+    static const std::vector<std::size_t>& color(Mesh& mesh,
+                                       const std::vector<std::size_t>& coloring_type);
+
+    /// Compute cell colors for given coloring type specified by
+    /// topological dimension, which can be one of 0, 1 or D - 1.
+    static std::size_t compute_colors(const Mesh& mesh,
+                               std::vector<std::size_t>& colors,
+                               const std::vector<std::size_t>& coloring_type);
+
+    /// Return a MeshFunction with the cell colors (used for visualisation)
+    static CellFunction<std::size_t> cell_colors(const Mesh& mesh,
+                                           std::string coloring_type);
+
+    /// Return a MeshFunction with the cell colors (used for visualisation)
+    static CellFunction<std::size_t> cell_colors(const Mesh& mesh,
+						                              const std::vector<std::size_t> coloring_type);
+
+
+    /// Convert coloring type to topological dimension
+    static std::size_t type_to_dim(std::string coloring_type, const Mesh& mesh);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshConnectivity.cpp b/dolfin/mesh/MeshConnectivity.cpp
new file mode 100644
index 0000000..3f385ec
--- /dev/null
+++ b/dolfin/mesh/MeshConnectivity.cpp
@@ -0,0 +1,176 @@
+// Copyright (C) 2006-2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Mikael Mortensen 2014
+//
+// First added:  2006-05-09
+// Last changed: 2014-01-09
+
+#include <sstream>
+#include <boost/functional/hash.hpp>
+#include <dolfin/log/log.h>
+#include "MeshConnectivity.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshConnectivity::MeshConnectivity(std::size_t d0, std::size_t d1)
+  : _d0(d0), _d1(d1)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+MeshConnectivity::MeshConnectivity(const MeshConnectivity& connectivity)
+  : _d0(0), _d1(0)
+{
+  *this = connectivity;
+}
+//-----------------------------------------------------------------------------
+MeshConnectivity::~MeshConnectivity()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+const MeshConnectivity&
+MeshConnectivity::operator= (const MeshConnectivity& connectivity)
+{
+  // Clear old data if any
+  clear();
+
+  // Copy data
+  _d0 = connectivity._d0;
+  _d1 = connectivity._d1;
+  _connections = connectivity._connections;
+  _num_global_connections = connectivity._num_global_connections;
+  index_to_position = connectivity.index_to_position;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+void MeshConnectivity::clear()
+{
+  std::vector<unsigned int>().swap(_connections);
+  std::vector<unsigned int>().swap(index_to_position);
+}
+//-----------------------------------------------------------------------------
+void MeshConnectivity::init(std::size_t num_entities,
+                            std::size_t num_connections)
+{
+  // Clear old data if any
+  clear();
+
+  // Compute the total size
+  const std::size_t size = num_entities*num_connections;
+
+  // Allocate
+  _connections.resize(size);
+  std::fill(_connections.begin(), _connections.end(), 0);
+  index_to_position.resize(num_entities + 1);
+
+  // Initialize data
+  for (std::size_t e = 0; e < index_to_position.size(); e++)
+    index_to_position[e] = e*num_connections;
+}
+//-----------------------------------------------------------------------------
+void MeshConnectivity::init(std::vector<std::size_t>& num_connections)
+{
+  // Clear old data if any
+  clear();
+
+  // Initialize offsets and compute total size
+  const std::size_t num_entities = num_connections.size();
+  index_to_position.resize(num_entities + 1);
+  std::size_t size = 0;
+  for (std::size_t e = 0; e < num_entities; e++)
+  {
+    index_to_position[e] = size;
+    size += num_connections[e];
+  }
+  index_to_position[num_entities] = size;
+
+  // Initialize connections
+  _connections.resize(size);
+  std::fill(_connections.begin(), _connections.end(), 0);
+}
+//-----------------------------------------------------------------------------
+void MeshConnectivity::set(std::size_t entity, std::size_t connection,
+                           std::size_t pos)
+{
+  dolfin_assert((entity + 1) < index_to_position.size());
+  dolfin_assert(pos < index_to_position[entity + 1]
+                - index_to_position[entity]);
+  _connections[index_to_position[entity] + pos] = connection;
+}
+//-----------------------------------------------------------------------------
+void MeshConnectivity::set(std::size_t entity,
+                           const std::vector<std::size_t>& connections)
+{
+  dolfin_assert((entity + 1) < index_to_position.size());
+  dolfin_assert(connections.size()
+                == index_to_position[entity + 1] - index_to_position[entity]);
+
+  // Copy data
+  std::copy(connections.begin(), connections.end(),
+            _connections.begin() + index_to_position[entity]);
+}
+//-----------------------------------------------------------------------------
+void MeshConnectivity::set(std::size_t entity, std::size_t* connections)
+{
+  dolfin_assert((entity + 1) < index_to_position.size());
+  dolfin_assert(connections);
+
+  // Copy data
+  const std::size_t num_connections
+    = index_to_position[entity + 1] - index_to_position[entity];
+  std::copy(connections, connections + num_connections,
+            _connections.begin() + index_to_position[entity]);
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshConnectivity::hash() const
+{
+  // Compute local hash key
+  boost::hash<std::vector<unsigned int> > uhash;
+  return uhash(_connections);
+}
+//-----------------------------------------------------------------------------
+std::string MeshConnectivity::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+    for (std::size_t e = 0; e < index_to_position.size() - 1; e++)
+    {
+      s << "  " << e << ":";
+      for (std::size_t i = index_to_position[e]; i < index_to_position[e + 1];
+           i++)
+      {
+        s << " " << _connections[i];
+      }
+      s << std::endl;
+    }
+  }
+  else
+  {
+    s << "<MeshConnectivity " << _d0 << " -- " << _d1 << " of size "
+      << _connections.size() << ">";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshConnectivity.h b/dolfin/mesh/MeshConnectivity.h
new file mode 100644
index 0000000..f168ab9
--- /dev/null
+++ b/dolfin/mesh/MeshConnectivity.h
@@ -0,0 +1,176 @@
+// Copyright (C) 2006-2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-05-09
+// Last changed: 2010-11-28
+
+#ifndef __MESH_CONNECTIVITY_H
+#define __MESH_CONNECTIVITY_H
+
+#include <vector>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  /// Mesh connectivity stores a sparse data structure of connections
+  /// (incidence relations) between mesh entities for a fixed pair of
+  /// topological dimensions.
+  ///
+  /// The connectivity can be specified either by first giving the
+  /// number of entities and the number of connections for each entity,
+  /// which may either be equal for all entities or different, or by
+  /// giving the entire (sparse) connectivity pattern.
+
+  class MeshConnectivity
+  {
+  public:
+
+    /// Create empty connectivity between given dimensions (d0 -- d1)
+    MeshConnectivity(std::size_t d0, std::size_t d1);
+
+    /// Copy constructor
+    MeshConnectivity(const MeshConnectivity& connectivity);
+
+    /// Destructor
+    ~MeshConnectivity();
+
+    /// Assignment
+    const MeshConnectivity& operator= (const MeshConnectivity& connectivity);
+
+    /// Return true if the total number of connections is equal to zero
+    bool empty() const
+    { return _connections.empty(); }
+
+    /// Return total number of connections
+    std::size_t size() const
+    { return _connections.size(); }
+
+    /// Return number of connections for given entity
+    std::size_t size(std::size_t entity) const
+    {
+      return ( (entity + 1) < index_to_position.size()
+          ? index_to_position[entity + 1] - index_to_position[entity] : 0);
+    }
+
+    /// Return global number of connections for given entity
+    std::size_t size_global(std::size_t entity) const
+    {
+      if (_num_global_connections.empty())
+        return size(entity);
+      else
+      {
+        dolfin_assert(entity < _num_global_connections.size());
+        return _num_global_connections[entity];
+      }
+    }
+
+    /// Return array of connections for given entity
+    const unsigned int* operator() (std::size_t entity) const
+    {
+      return ((entity + 1) < index_to_position.size()
+        ? &_connections[index_to_position[entity]] : 0);
+    }
+
+    /// Return contiguous array of connections for all entities
+    const std::vector<unsigned int>& operator() () const
+    { return _connections; }
+
+    /// Clear all data
+    void clear();
+
+    /// Initialize number of entities and number of connections (equal
+    /// for all)
+    void init(std::size_t num_entities, std::size_t num_connections);
+
+    /// Initialize number of entities and number of connections
+    /// (individually)
+    void init(std::vector<std::size_t>& num_connections);
+
+    /// Set given connection for given entity
+    void set(std::size_t entity, std::size_t connection, std::size_t pos);
+
+    /// Set all connections for given entity
+    void set(std::size_t entity, const std::vector<std::size_t>& connections);
+
+    /// Set all connections for given entity
+    void set(std::size_t entity, std::size_t* connections);
+
+    /// Set all connections for all entities (T is a container, e.g.
+    /// a std::vector<std::size_t>, std::set<std::size_t>, etc)
+    template <typename T>
+    void set(const std::vector<T>& connections)
+    {
+      // Clear old data if any
+      clear();
+
+      // Initialize offsets and compute total size
+      index_to_position.resize(connections.size() + 1);
+      unsigned int size = 0;
+      for (std::size_t e = 0; e < connections.size(); e++)
+      {
+        index_to_position[e] = size;
+        size += connections[e].size();
+      }
+      index_to_position[connections.size()] = size;
+
+      // Initialize connections
+      _connections.reserve(size);
+      typename std::vector<T>::const_iterator e;
+      for (e = connections.begin(); e != connections.end(); ++e)
+        _connections.insert(_connections.end(), e->begin(), e->end());
+    }
+
+    /// Set global number of connections for all local entities
+    void
+      set_global_size(const std::vector<unsigned int>& num_global_connections)
+    {
+      dolfin_assert(num_global_connections.size()
+                    == index_to_position.size() - 1);
+      _num_global_connections = num_global_connections;
+    }
+
+    /// Hash of connections
+    std::size_t hash() const;
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+  private:
+
+    // Friends
+    friend class BinaryFile;
+    friend class MeshRenumbering;
+
+    // Dimensions (only used for pretty-printing)
+    std::size_t _d0, _d1;
+
+    // Connections for all entities stored as a contiguous array
+    std::vector<unsigned int> _connections;
+
+    // Global number of connections for all entities (possibly not
+    // computed)
+    std::vector<unsigned int> _num_global_connections;
+
+    // Position of first connection for each entity (using local index)
+    std::vector<unsigned int> index_to_position;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshData.cpp b/dolfin/mesh/MeshData.cpp
new file mode 100644
index 0000000..9869daa
--- /dev/null
+++ b/dolfin/mesh/MeshData.cpp
@@ -0,0 +1,225 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson 2008
+//
+// First added:  2008-05-19
+// Last changed: 2011-11-14
+
+#include <sstream>
+#include <dolfin/common/utils.h>
+#include <dolfin/log/log.h>
+#include "MeshFunction.h"
+#include "MeshData.h"
+
+using namespace dolfin;
+
+typedef std::map<std::string, std::vector<std::size_t> >::iterator a_iterator;
+typedef std::map<std::string, std::vector<std::size_t> >::const_iterator
+a_const_iterator;
+
+//-----------------------------------------------------------------------------
+MeshData::MeshData() : _arrays(5)
+{
+  // Add list of deprecated names
+  _deprecated_names.push_back("boundary_facet_cells");
+  _deprecated_names.push_back("boundary_facet_numbers");
+  _deprecated_names.push_back("boundary_indicators");
+  _deprecated_names.push_back("material_indicators");
+  _deprecated_names.push_back("cell_domains");
+  _deprecated_names.push_back("interior_facet_domains");
+  _deprecated_names.push_back("exterior_facet_domains");
+}
+//-----------------------------------------------------------------------------
+MeshData::~MeshData()
+{
+  clear();
+}
+//-----------------------------------------------------------------------------
+const MeshData& MeshData::operator= (const MeshData& data)
+{
+  // Clear all data
+  clear();
+
+  // Copy ararys
+  _arrays = data._arrays;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+bool MeshData::exists(std::string name, std::size_t dim) const
+{
+  if (_arrays.size() < dim)
+    return false;
+
+  // Check is named array has been created
+  if (dim < _arrays.size())
+    if (_arrays[dim].find(name) != _arrays[dim].end())
+      return true;
+
+  return false;
+}
+//-----------------------------------------------------------------------------
+void MeshData::clear()
+{
+  _arrays.clear();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<dolfin::MeshFunction<std::size_t> >
+MeshData::create_mesh_function(std::string name)
+{
+  dolfin_error("MeshData.cpp",
+               "create a MeshFunction via mesh data",
+               "MeshFunctions can no longer be stored in MeshData. Use arrays instead");
+
+  return std::shared_ptr<MeshFunction<std::size_t> >();
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<dolfin::MeshFunction<std::size_t> >
+MeshData::create_mesh_function(std::string name, std::size_t dim)
+{
+  dolfin_error("MeshData.cpp",
+               "create a MeshFunction via mesh data",
+               "MeshFunctions can no longer be stored in MeshData. Use arrays instead");
+
+  return std::shared_ptr<MeshFunction<std::size_t> >();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t>& MeshData::create_array(std::string name,
+                                                 std::size_t dim)
+{
+  // Check if array needs to be re-sized
+  if (_arrays.size() < dim + 1)
+    _arrays.resize(dim + 1);
+
+  // Check if data already exists
+  dolfin_assert(dim < _arrays.size());
+  a_iterator it = _arrays[dim].find(name);
+  if (it != _arrays[dim].end())
+  {
+    warning("Mesh data named \"%s\" already exists.", name.c_str());
+    return it->second;
+  }
+
+  // Check if name is deprecated
+  check_deprecated(name);
+
+  // Add empty vector to map
+  std::pair<a_iterator, bool> ins
+    = _arrays[dim].insert(std::make_pair(name, std::vector<std::size_t>(0)));
+
+  // Return vector
+  return ins.first->second;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<MeshFunction<std::size_t> >
+MeshData::mesh_function(const std::string name) const
+{
+  dolfin_error("MeshData.cpp",
+               "access a MeshFunction via mesh data",
+               "MeshFunctions can no longer be stored in MeshData. Use arrays instead");
+
+  return std::shared_ptr<MeshFunction<std::size_t> >();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t>& MeshData::array(std::string name, std::size_t dim)
+{
+  dolfin_assert(dim < _arrays.size());
+
+  // Check if data exists
+  a_iterator it = _arrays[dim].find(name);
+  if (it == _arrays[dim].end())
+  {
+    dolfin_error("MeshData.cpp",
+                 "access mesh data",
+                 "Mesh data array named \"%s\" does not exist",
+                 name.c_str());
+  }
+  return it->second;
+}
+//-----------------------------------------------------------------------------
+const std::vector<std::size_t>& MeshData::array(std::string name,
+                                                std::size_t dim) const
+{
+  dolfin_assert(dim < _arrays.size());
+
+  // Check if data exists
+  a_const_iterator it = _arrays[dim].find(name);
+  if (it == _arrays[dim].end())
+  {
+    dolfin_error("MeshData.cpp",
+                 "access mesh data",
+                 "Mesh data array named \"%s\" does not exist",
+                 name.c_str());
+  }
+  return it->second;
+}
+//-----------------------------------------------------------------------------
+void MeshData::erase_array(const std::string name, std::size_t dim)
+{
+  dolfin_assert(dim < _arrays.size());
+  a_iterator it = _arrays[dim].find(name);
+  if (it != _arrays[dim].end())
+    _arrays[dim].erase(it);
+  else
+    warning("Mesh data named \"%s\" does not exist.", name.c_str());
+}
+//-----------------------------------------------------------------------------
+std::string MeshData::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+    s << "  std::vector<std::size_t>" << std::endl;
+    s << "  -----------------" << std::endl;
+    for (std::size_t d = 0; d < _arrays.size(); ++d)
+    {
+      for (a_const_iterator it = _arrays[d].begin(); it
+             != _arrays[d].end(); ++it)
+      {
+        s << "  " << it->first << " ( dim = " << d
+          << ", size = " << it->second.size() << ")" << std::endl;
+      }
+    }
+    s << std::endl;
+  }
+  else
+  {
+    std::size_t size = 0;
+    for (std::size_t d = 0; d < _arrays.size(); ++d)
+      size += _arrays[d].size();
+    s << "<MeshData containing " << size << " objects>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void MeshData::check_deprecated(std::string name) const
+{
+  for (std::size_t i = 0; i < _deprecated_names.size(); i++)
+  {
+    if (name == _deprecated_names[i])
+    {
+      dolfin_error("MeshData.cpp",
+                   "access mesh data",
+                   "Mesh data named \"%s\" is no longer recognized by DOLFIN",
+                   name.c_str());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshData.h b/dolfin/mesh/MeshData.h
new file mode 100644
index 0000000..fa522a1
--- /dev/null
+++ b/dolfin/mesh/MeshData.h
@@ -0,0 +1,205 @@
+// Copyright (C) 2008-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson, 2008.
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2008-05-19
+// Last changed: 2011-09-15
+
+#ifndef __MESH_DATA_H
+#define __MESH_DATA_H
+
+#include <map>
+#include <string>
+#include <vector>
+#include <memory>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  class Mesh;
+  template <typename T> class MeshFunction;
+
+  /// The class MeshData is a container for auxiliary mesh data,
+  /// represented either as arrays or maps. Each dataset is identified
+  /// by a unique user-specified string. Only std::size_t-valued data
+  /// are currently supported.
+  ///
+  /// Auxiliary mesh data may be attached to a mesh by users as a
+  /// convenient way to store data associated with a mesh. It is also
+  /// used internally by DOLFIN to communicate data associated with
+  /// meshes. The following named mesh data are recognized by DOLFIN:
+  ///
+  /// Facet orientation (used for assembly over interior facets)
+  ///
+  ///   * "facet_orientation"  - _std:vector_ <std::size_t> of dimension D - 1
+  ///
+  /// Sub meshes (used by the class SubMesh)
+  ///
+  ///   * "parent_vertex_indices" - _std::vector_ <std::size_t> of dimension 0
+  ///
+  /// Note to developers: use underscore in names in place of spaces.
+
+  class MeshData : public Variable
+  {
+  public:
+
+    /// Constructor
+    MeshData();
+
+    /// Destructor
+    ~MeshData();
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     data (_MeshData_)
+    ///         Another MeshData object.
+    const MeshData& operator= (const MeshData& data);
+
+    /// Clear all data
+    void clear();
+
+    //--- Query of data ---
+
+    /// Check is array exists
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name of the array.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True is array exists, false otherwise.
+    bool exists(std::string name, std::size_t dim) const;
+
+    //--- Creation of data ---
+
+    /// This function is no longer supported. It is retained to print
+    /// an informative error message. It will be removed in the
+    /// future.
+    std::shared_ptr<MeshFunction<std::size_t> >
+      create_mesh_function(std::string name);
+
+    /// This function is no longer supported. It is retained to print
+    /// an informative error message. It will be removed in the
+    /// future.
+    std::shared_ptr<MeshFunction<std::size_t> >
+      create_mesh_function(std::string name, std::size_t dim);
+
+    /// Create empty array (vector) with given name
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name of the array.
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         The array.
+    //std::vector<std::size_t>& create_array(std::string name);
+
+    /// Create array (vector) with given name and size
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name of the array.
+    ///     size (std::size_t)
+    ///         The size (length) of the array.
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         The array.
+    //private:
+    std::vector<std::size_t>& create_array(std::string name, std::size_t dim);
+
+    //public:
+    //--- Retrieval of data ---
+
+    /// This function is no longer supported. It is retained to print
+    /// an informative error message. It will be removed in the
+    /// future.
+    std::shared_ptr<MeshFunction<std::size_t> >
+      mesh_function(const std::string name) const;
+
+    /// Return array with given name (returning zero if data is not
+    /// available)
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name of the array.
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         The array.
+    std::vector<std::size_t>& array(std::string name, std::size_t dim);
+
+    /// Return array with given name (returning zero if data is not
+    /// available)
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name of the array.
+    ///
+    /// *Returns*
+    ///     std::vector<std::size_t>
+    ///         The array.
+    const std::vector<std::size_t>& array(std::string name,
+                                          std::size_t dim) const;
+
+    //--- Removal of data ---
+
+    /// Erase array with given name
+    ///
+    /// *Arguments*
+    ///     name (std::string)
+    ///         The name of the array.
+    void erase_array(const std::string name, std::size_t dim);
+
+    //--- Misc ---
+
+    /// Return informal string representation (pretty-print)
+    ///
+    /// *Arguments*
+    ///     verbose (bool)
+    ///         Flag to turn on additional output.
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         An informal representation.
+    std::string str(bool verbose) const;
+
+    /// Friends
+    friend class XMLMesh;
+
+  private:
+
+    // Check if name is deprecated
+    void check_deprecated(std::string name) const;
+
+    // A map from named mesh array data to vector for dim
+    std::vector<std::map<std::string, std::vector<std::size_t> > > _arrays;
+
+    // List of depcrecated named data
+    std::vector<std::string> _deprecated_names;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshDomains.cpp b/dolfin/mesh/MeshDomains.cpp
new file mode 100644
index 0000000..72177e7
--- /dev/null
+++ b/dolfin/mesh/MeshDomains.cpp
@@ -0,0 +1,119 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2012
+//
+// First added:  2011-08-29
+// Last changed: 2011-04-03
+
+#include <limits>
+#include <dolfin/log/log.h>
+#include "MeshDomains.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshDomains::MeshDomains()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+MeshDomains::~MeshDomains()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshDomains::max_dim() const
+{
+  if (!_markers.empty())
+    return _markers.size() - 1;
+  else
+    return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshDomains::num_marked(std::size_t dim) const
+{
+  dolfin_assert(dim < _markers.size());
+  return _markers[dim].size();
+}
+//-----------------------------------------------------------------------------
+bool MeshDomains::is_empty() const
+{
+  std::size_t size = 0;
+  for (std::size_t i = 0; i < _markers.size(); i++)
+    size += _markers[i].size();
+  return size == 0;
+}
+//-----------------------------------------------------------------------------
+std::map<std::size_t, std::size_t>& MeshDomains::markers(std::size_t dim)
+{
+  dolfin_assert(dim < _markers.size());
+  return _markers[dim];
+}
+//-----------------------------------------------------------------------------
+const std::map<std::size_t, std::size_t>&
+MeshDomains::markers(std::size_t dim) const
+{
+  dolfin_assert(dim < _markers.size());
+  return _markers[dim];
+}
+//-----------------------------------------------------------------------------
+bool MeshDomains::set_marker(std::pair<std::size_t, std::size_t> marker,
+                             std::size_t dim)
+{
+  dolfin_assert(dim < _markers.size());
+  return _markers[dim].insert(marker).second;
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshDomains::get_marker(std::size_t entity_index,
+                                    std::size_t dim) const
+{
+  dolfin_assert(dim < _markers.size());
+  std::map<std::size_t, std::size_t>::const_iterator it
+    = _markers[dim].find(entity_index);
+  if (it == _markers[dim].end())
+  {
+    dolfin_error("MeshDomains.cpp",
+                 "get marker",
+                 "Marked entity index does not exist in marked set");
+  }
+
+  return it->second;
+}
+//-----------------------------------------------------------------------------
+const MeshDomains& MeshDomains::operator= (const MeshDomains& domains)
+{
+  // Copy data
+  _markers = domains._markers;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+void MeshDomains::init(std::size_t dim)
+{
+  // Clear old data
+  clear();
+
+  // Add markers for each topological dimension
+  _markers.resize(dim + 1);
+}
+//-----------------------------------------------------------------------------
+void MeshDomains::clear()
+{
+  _markers.clear();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshDomains.h b/dolfin/mesh/MeshDomains.h
new file mode 100644
index 0000000..0efc893
--- /dev/null
+++ b/dolfin/mesh/MeshDomains.h
@@ -0,0 +1,95 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2012
+//
+// First added:  2011-08-29
+// Last changed: 2012-04-03
+
+#ifndef __MESH_DOMAINS_H
+#define __MESH_DOMAINS_H
+
+#include <map>
+#include <vector>
+
+namespace dolfin
+{
+
+  /// The class _MeshDomains_ stores the division of a _Mesh_ into
+  /// subdomains. For each topological dimension 0 <= d <= D, where D
+  /// is the topological dimension of the _Mesh_, a set of integer
+  /// markers are stored for a subset of the entities of dimension d,
+  /// indicating for each entity in the subset the number of the
+  /// subdomain. It should be noted that the subset does not need to
+  /// contain all entities of any given dimension; entities not
+  /// contained in the subset are "unmarked".
+
+  class MeshDomains
+  {
+  public:
+
+    /// Create empty mesh domains
+    MeshDomains();
+
+    /// Destructor
+    ~MeshDomains();
+
+    /// Return maximum topological dimension of stored markers
+    std::size_t max_dim() const;
+
+    /// Return number of marked entities of given dimension
+    std::size_t num_marked(std::size_t dim) const;
+
+    /// Check whether domain data is empty
+    bool is_empty() const;
+
+    /// Get subdomain markers for given dimension (shared pointer
+    /// version)
+    std::map<std::size_t, std::size_t>& markers(std::size_t dim);
+
+    /// Get subdomain markers for given dimension (const shared
+    /// pointer version)
+    const std::map<std::size_t, std::size_t>& markers(std::size_t dim) const;
+
+    /// Set marker (entity index, marker value) of a given dimension
+    /// d. Returns true if a new key is inserted, false otherwise.
+    bool set_marker(std::pair<std::size_t, std::size_t> marker,
+                    std::size_t dim);
+
+    /// Get marker (entity index, marker value) of a given dimension
+    /// d. Throws an error if marker does not exist.
+    std::size_t get_marker(std::size_t entity_index, std::size_t dim) const;
+
+    /// Assignment operator
+    const MeshDomains& operator= (const MeshDomains& domains);
+
+    /// Initialize mesh domains for given topological dimension
+    void init(std::size_t dim);
+
+    /// Clear all data
+    void clear();
+
+  private:
+
+    // Subdomain markers for each geometric dimension
+    std::vector<std::map<std::size_t, std::size_t> > _markers;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshEditor.cpp b/dolfin/mesh/MeshEditor.cpp
new file mode 100644
index 0000000..7ebeba5
--- /dev/null
+++ b/dolfin/mesh/MeshEditor.cpp
@@ -0,0 +1,382 @@
+// Copyright (C) 2006-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012
+//
+// First added:  2006-05-16
+// Last changed: 2014-02-06
+
+#include <dolfin/log/log.h>
+#include <dolfin/geometry/Point.h>
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshFunction.h"
+#include "MeshEditor.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshEditor::MeshEditor() : _mesh(0), _tdim(0), _gdim(0), _num_vertices(0),
+                           _num_cells(0), next_vertex(0), next_cell(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+MeshEditor::~MeshEditor()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::open(Mesh& mesh, std::size_t tdim, std::size_t gdim)
+{
+  switch (tdim)
+  {
+  case 0:
+    open(mesh, CellType::point, tdim, gdim);
+    break;
+  case 1:
+    open(mesh, CellType::interval, tdim, gdim);
+    break;
+  case 2:
+    open(mesh, CellType::triangle, tdim, gdim);
+    break;
+  case 3:
+    open(mesh, CellType::tetrahedron, tdim, gdim);
+    break;
+  default:
+    dolfin_error("MeshEditor.cpp",
+                 "open mesh for editing",
+                 "Uknown cell type of topological dimension %d", tdim);
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::open(Mesh& mesh, CellType::Type type, std::size_t tdim,
+                      std::size_t gdim)
+{
+  // Clear old mesh data
+  mesh.clear();
+  clear();
+
+  // Save mesh and dimension
+  _mesh = &mesh;
+  _gdim = gdim;
+  _tdim = tdim;
+
+  // Set cell type
+  mesh._cell_type = CellType::create(type);
+
+  // Initialize topological dimension
+  mesh._topology.init(tdim);
+
+  // Initialize domains
+  mesh._domains.init(tdim);
+
+  // Initialize temporary storage for local cell data
+  _vertices = std::vector<std::size_t>(mesh.type().num_vertices(tdim), 0);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::open(Mesh& mesh, std::string type, std::size_t tdim,
+                      std::size_t gdim)
+{
+  if (type == "point")
+    open(mesh, CellType::point, tdim, gdim);
+  else if (type == "interval")
+    open(mesh, CellType::interval, tdim, gdim);
+  else if (type == "triangle")
+    open(mesh, CellType::triangle, tdim, gdim);
+  else if (type == "tetrahedron")
+    open(mesh, CellType::tetrahedron, tdim, gdim);
+  else
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "open mesh for editing",
+                 "Unknown cell type (\"%s\")", type.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::init_vertices_global(std::size_t num_local_vertices,
+                                      std::size_t num_global_vertices)
+{
+  // Check if we are currently editing a mesh
+  if (!_mesh)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "initialize vertices in mesh editor",
+                 "No mesh opened, unable to edit");
+  }
+
+  // Initialize mesh data
+  _num_vertices = num_local_vertices;
+  _mesh->_topology.init(0, num_local_vertices, num_global_vertices);
+  _mesh->_topology.init_global_indices(0, num_local_vertices);
+  _mesh->_geometry.init(_gdim, num_local_vertices);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::init_cells_global(std::size_t num_local_cells,
+                                   std::size_t num_global_cells)
+{
+  // Check if we are currently editing a mesh
+  if (!_mesh)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "initialize cells in mesh editor",
+                 "No mesh opened, unable to edit");
+  }
+
+  // Initialize mesh data
+  _num_cells = num_local_cells;
+  _mesh->_topology.init(_tdim, num_local_cells, num_global_cells);
+  _mesh->_topology.init_global_indices(_tdim, num_local_cells);
+  _mesh->_topology(_tdim, 0).init(_num_cells,
+                                  _mesh->type().num_vertices(_tdim));
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_vertex(std::size_t index, const Point& p)
+{
+  add_vertex_global(index, index, p);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_vertex(std::size_t index, const std::vector<double>& x)
+{
+  add_vertex_global(index, index, x);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_vertex(std::size_t index, double x)
+{
+  dolfin_assert(_gdim == 1);
+  std::vector<double> p(1);
+  p[0] = x;
+  add_vertex(index, p);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_vertex(std::size_t index, double x, double y)
+{
+  dolfin_assert(_gdim == 2);
+  std::vector<double> p(2);
+  p[0] = x;
+  p[1] = y;
+  add_vertex(index, p);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_vertex(std::size_t index, double x, double y, double z)
+{
+  dolfin_assert(_gdim == 3);
+  std::vector<double> p(3);
+  p[0] = x;
+  p[1] = y;
+  p[2] = z;
+  add_vertex(index, p);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_vertex_global(std::size_t local_index,
+                                   std::size_t global_index,
+                                   const Point& p)
+{
+  // Add vertex
+  add_vertex_common(local_index, _gdim);
+
+  // Set coordinate
+  std::vector<double> x(p.coordinates(), p.coordinates() + _gdim);
+  _mesh->_geometry.set(local_index, x);
+  _mesh->_topology.set_global_index(0, local_index, global_index);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_vertex_global(std::size_t local_index,
+                                   std::size_t global_index,
+                                   const std::vector<double>& x)
+{
+  // Add vertex
+  add_vertex_common(local_index, x.size());
+
+  // Set coordinate
+  _mesh->_geometry.set(local_index, x);
+  _mesh->_topology.set_global_index(0, local_index, global_index);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_cell(std::size_t c, std::size_t v0, std::size_t v1)
+{
+  dolfin_assert(_tdim == 1);
+  dolfin_assert(_vertices.size() == 2);
+  _vertices[0] = v0;
+  _vertices[1] = v1;
+  add_cell(c, c, _vertices);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_cell(std::size_t c, std::size_t v0, std::size_t v1,
+                          std::size_t v2)
+{
+  dolfin_assert(_tdim == 2);
+  dolfin_assert(_vertices.size() == 3);
+  _vertices[0] = v0;
+  _vertices[1] = v1;
+  _vertices[2] = v2;
+  add_cell(c, c, _vertices);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_cell(std::size_t c, std::size_t v0, std::size_t v1,
+                          std::size_t v2, std::size_t v3)
+{
+  dolfin_assert(_tdim == 3);
+  dolfin_assert(_vertices.size() == 4);
+  _vertices[0] = v0;
+  _vertices[1] = v1;
+  _vertices[2] = v2;
+  _vertices[3] = v3;
+  add_cell(c, c, _vertices);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_cell(std::size_t c, const std::vector<std::size_t>& v)
+{
+  add_cell(c, c, v);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_cell(std::size_t local_index, std::size_t global_index,
+                          const std::vector<std::size_t>& v)
+{
+  dolfin_assert(v.size() == _tdim + 1);
+
+  // Check vertices
+  check_vertices(v);
+
+  // Add cell
+  add_cell_common(local_index, _tdim);
+
+  // Set data
+  _mesh->_topology(_tdim, 0).set(local_index, v);
+  _mesh->_topology.set_global_index(_tdim, local_index, global_index);
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::close(bool order)
+{
+  // Order mesh if requested
+  dolfin_assert(_mesh);
+  if (order && !_mesh->ordered())
+    _mesh->order();
+
+  // Initialize cell orientations
+  _mesh->cell_orientations().resize(_mesh->num_cells(), -1);
+
+  // Clear data
+  clear();
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_vertex_common(std::size_t v, std::size_t gdim)
+{
+  // Check if we are currently editing a mesh
+  if (!_mesh)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "add vertex to mesh using mesh editor",
+                 "No mesh opened, unable to edit");
+  }
+
+  // Check that the dimension matches
+  if (gdim != _gdim)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "add vertex to mesh using mesh editor",
+                 "Illegal dimension for vertex coordinate (%d), expecting %d",
+                 gdim, _gdim);
+  }
+
+  // Check value of vertex index
+  if (v >= _num_vertices)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "add vertex to mesh using mesh editor",
+                 "Vertex index (%d) out of range [0, %d)",
+                 v, _num_vertices);
+  }
+
+  // Check if there is room for more vertices
+  if (next_vertex >= _num_vertices)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "add vertex to mesh using mesh editor",
+                 "Vertex list is full, %d vertices already specified",
+                 _num_vertices);
+  }
+
+  // Step to next vertex
+  next_vertex++;
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::add_cell_common(std::size_t c, std::size_t tdim)
+{
+  // Check if we are currently editing a mesh
+  if (!_mesh)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "add cell to mesh using mesh editor",
+                 "No mesh opened, unable to edit");
+  }
+
+  // Check that the dimension matches
+  if (tdim != _tdim)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "add cell to mesh using mesh editor",
+                 "Illegal dimension for cell (%d), expecting %d", tdim, _tdim);
+  }
+
+  // Check value of cell index
+  if (c >= _num_cells)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "add cell to mesh using mesh editor",
+                 "Cell index (%d) out of range [0, %d)",
+                 c, _num_cells);
+  }
+
+  // Check if there is room for more cells
+  if (next_cell >= _num_cells)
+  {
+    dolfin_error("MeshEditor.cpp",
+                 "add cell to mesh using mesh editor",
+                 "Cell list is full, %d cells already specified",
+                 _num_cells);
+  }
+
+  // Step to next cell
+  next_cell++;
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::clear()
+{
+  _tdim = 0;
+  _gdim = 0;
+  _num_vertices = 0;
+  _num_cells = 0;
+  next_vertex = 0;
+  next_cell = 0;
+  _mesh = 0;
+  _vertices.clear();
+}
+//-----------------------------------------------------------------------------
+void MeshEditor::check_vertices(const std::vector<std::size_t>& v) const
+{
+  for (std::size_t i = 0; i < v.size(); ++i)
+  {
+    if (_num_vertices > 0 && v[i] >= _num_vertices)
+    {
+      dolfin_error("MeshEditor.cpp",
+                   "add cell using mesh editor",
+                   "Vertex index (%d) out of range [0, %d)", v[i], _num_vertices);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshEditor.h b/dolfin/mesh/MeshEditor.h
new file mode 100644
index 0000000..7fccb52
--- /dev/null
+++ b/dolfin/mesh/MeshEditor.h
@@ -0,0 +1,362 @@
+// Copyright (C) 2006-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-05-16
+// Last changed: 2014-02-06
+
+#ifndef __MESH_EDITOR_H
+#define __MESH_EDITOR_H
+
+#include <vector>
+#include "CellType.h"
+
+namespace dolfin
+{
+
+  class CellType;
+  class Mesh;
+  class Point;
+
+  /// A simple mesh editor for creating simplicial meshes in 1D, 2D
+  /// and 3D.
+
+  class MeshEditor
+  {
+  public:
+
+    /// Constructor
+    MeshEditor();
+
+    /// Destructor
+    ~MeshEditor();
+
+    /// Open mesh of given topological and geometrical dimension
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to open.
+    ///     tdim (std::size_t)
+    ///         The topological dimension.
+    ///     gdim (std::size_t)
+    ///         The geometrical dimension.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Mesh mesh;
+    ///         MeshEditor editor;
+    ///         editor.open(mesh, 2, 2);
+    ///
+    void open(Mesh& mesh, std::size_t tdim, std::size_t gdim);
+
+    /// Open mesh of given cell type, topological and geometrical dimension
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to open.
+    ///     type (CellType::Type)
+    ///         Cell type.
+    ///     tdim (std::size_t)
+    ///         The topological dimension.
+    ///     gdim (std::size_t)
+    ///         The geometrical dimension.
+    void open(Mesh& mesh, CellType::Type type, std::size_t tdim, std::size_t gdim);
+
+    /// Open mesh of given cell type, topological and geometrical dimension
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to open.
+    ///     type (std::string)
+    ///         Cell type.
+    ///     tdim (std::size_t)
+    ///         The topological dimension.
+    ///     gdim (std::size_t)
+    ///         The geometrical dimension.
+    void open(Mesh& mesh, std::string type, std::size_t tdim, std::size_t gdim);
+
+    /// Specify number of vertices (serial version)
+    ///
+    /// *Arguments*
+    ///     num_vertices (std::size_t)
+    ///         The number of vertices.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Mesh mesh;
+    ///         MeshEditor editor;
+    ///         editor.open(mesh, 2, 2);
+    ///         editor.init_vertices(9);
+    ///
+    void init_vertices(std::size_t num_vertices)
+    { init_vertices_global(num_vertices, num_vertices); }
+
+    /// Specify number of vertices (distributed version)
+    ///
+    /// *Arguments*
+    ///     num_local_vertices (std::size_t)
+    ///         The number of vertices on this process.
+    ///     num_global_vertices (std::size_t)
+    ///         The number of vertices in distributed mesh.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Mesh mesh;
+    ///         MeshEditor editor;
+    ///         editor.open(mesh, 2, 2);
+    ///         editor.init_vertices(4, 8);
+    ///
+    void init_vertices_global(std::size_t num_local_vertices,
+                              std::size_t num_global_vertices);
+
+    /// Specify number of cells (serial version)
+    ///
+    /// *Arguments*
+    ///     num_cells (std::size_t)
+    ///         The number of cells.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Mesh mesh;
+    ///         MeshEditor editor;
+    ///         editor.open(mesh, 2, 2);
+    ///         editor.init_cells(8);
+    void init_cells(std::size_t num_cells)
+    { init_cells_global(num_cells, num_cells); }
+
+    /// Specify number of cells (distributed version)
+    ///
+    /// *Arguments*
+    ///     num_local_cells (std::size_t)
+    ///         The number of local cells.
+    ///     num_global_cells (std::size_t)
+    ///         The number of cells in distributed mesh.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         Mesh mesh;
+    ///         MeshEditor editor;
+    ///         editor.open(mesh, 2, 2);
+    ///         editor.init_cells(2, 6);
+    ///
+    void init_cells_global(std::size_t num_local_cells, std::size_t num_global_cells);
+
+    /// Add vertex v at given point p
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The vertex (index).
+    ///     p (_Point_)
+    ///         The point.
+    void add_vertex(std::size_t index, const Point& p);
+
+    /// Add vertex v at given coordinate x
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The vertex (index).
+    ///     x (std::vector<double>)
+    ///         The x-coordinates.
+    void add_vertex(std::size_t index, const std::vector<double>& x);
+
+    /// Add vertex v at given point x (for a 1D mesh)
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The vertex (index).
+    ///     x (double)
+    ///         The x-coordinate.
+    void add_vertex(std::size_t index, double x);
+
+    /// Add vertex v at given point (x, y) (for a 2D mesh)
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The vertex (index).
+    ///     x (double)
+    ///         The x-coordinate.
+    ///     y (double)
+    ///         The y-coordinate.
+    void add_vertex(std::size_t index, double x, double y);
+
+    /// Add vertex v at given point (x, y, z) (for a 3D mesh)
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The vertex (index).
+    ///     x (double)
+    ///         The x-coordinate.
+    ///     y (double)
+    ///         The y-coordinate.
+    ///     z (double)
+    ///         The z-coordinate.
+    void add_vertex(std::size_t index, double x, double y, double z);
+
+    /// Add vertex v at given point p
+    ///
+    /// *Arguments*
+    ///     local_index (std::size_t)
+    ///         The vertex (local index).
+    ///     global_index (std::size_t)
+    ///         The vertex (global_index).
+    ///     p (_Point_)
+    ///         The point.
+    void add_vertex_global(std::size_t local_index, std::size_t global_index,
+                           const Point& p);
+
+    /// Add vertex v at given coordinate x
+    ///
+    /// *Arguments*
+    ///     local_index (std::size_t)
+    ///         The vertex (local index).
+    ///     global_index (std::size_t)
+    ///         The vertex (global_index).
+    ///     x (std::vector<double>)
+    ///         The x-coordinates.
+    void add_vertex_global(std::size_t local_index, std::size_t global_index,
+                           const std::vector<double>& x);
+
+    /// Add cell with given vertices (1D)
+    ///
+    /// *Arguments*
+    ///     c (std::size_t)
+    ///         The cell (index).
+    ///     v0 (std::vector<std::size_t>)
+    ///         The first vertex (local index).
+    ///     v1 (std::vector<std::size_t>)
+    ///         The second vertex (local index).
+    void add_cell(std::size_t c, std::size_t v0, std::size_t v1);
+
+    /// Add cell with given vertices (2D)
+    ///
+    /// *Arguments*
+    ///     c (std::size_t)
+    ///         The cell (index).
+    ///     v0 (std::vector<std::size_t>)
+    ///         The first vertex (local index).
+    ///     v1 (std::vector<std::size_t>)
+    ///         The second vertex (local index).
+    ///     v2 (std::vector<std::size_t>)
+    ///         The third vertex (local index).
+    void add_cell(std::size_t c, std::size_t v0, std::size_t v1, std::size_t v2);
+
+    /// Add cell with given vertices (3D)
+    ///
+    /// *Arguments*
+    ///     c (std::size_t)
+    ///         The cell (index).
+    ///     v0 (std::vector<std::size_t>)
+    ///         The first vertex (local index).
+    ///     v1 (std::vector<std::size_t>)
+    ///         The second vertex (local index).
+    ///     v2 (std::vector<std::size_t>)
+    ///         The third vertex (local index).
+    ///     v3 (std::vector<std::size_t>)
+    ///         The fourth vertex (local index).
+    void add_cell(std::size_t c, std::size_t v0, std::size_t v1,
+                  std::size_t v2, std::size_t v3);
+
+    /// Add cell with given vertices
+    ///
+    /// *Arguments*
+    ///     c (std::size_t)
+    ///         The cell (index).
+    ///     v (std::vector<std::size_t>)
+    ///         The vertex indices (local indices)
+    void add_cell(std::size_t c, const std::vector<std::size_t>& v);
+
+    /// Add cell with given vertices
+    ///
+    /// *Arguments*
+    ///     local_index (std::size_t)
+    ///         The cell (index).
+    ///     global_index (std::size_t)
+    ///         The global (user) cell index.
+    ///     v (std::vector<std::size_t>)
+    ///         The vertex indices (local indices)
+    void add_cell(std::size_t local_index, std::size_t global_index,
+                  const std::vector<std::size_t>& v);
+
+    /// Close mesh, finish editing, and order entities locally
+    ///
+    /// *Arguments*
+    ///     order (bool)
+    ///         Order entities locally if true. Default values is true.
+    ///
+    /// *Example*
+    ///     .. code-block:: c++
+    ///
+    ///         MeshEditor editor;
+    ///         editor.open(mesh, 2, 2);
+    ///         ...
+    ///         editor.close()
+    ///
+    void close(bool order=true);
+
+  private:
+
+    // Friends
+    friend class TetrahedronCell;
+
+    // Add vertex, common part
+    void add_vertex_common(std::size_t v, std::size_t dim);
+
+    // Add cell, common part
+    void add_cell_common(std::size_t v, std::size_t dim);
+
+    // Compute boundary indicators (exterior facets)
+    void compute_boundary_indicators();
+
+    // Clear all data
+    void clear();
+
+    // Check that vertices are in range
+    void check_vertices(const std::vector<std::size_t>& v) const;
+
+    // The mesh
+    Mesh* _mesh;
+
+    // Topological dimension
+    std::size_t _tdim;
+
+    // Geometrical (Euclidean) dimension
+    std::size_t _gdim;
+
+    // Number of vertices
+    std::size_t _num_vertices;
+
+    // Number of cells
+    std::size_t _num_cells;
+
+    // Next available vertex
+    std::size_t next_vertex;
+
+    // Next available cell
+    std::size_t next_cell;
+
+    // Temporary storage for local cell data
+    std::vector<std::size_t> _vertices;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshEntity.cpp b/dolfin/mesh/MeshEntity.cpp
new file mode 100644
index 0000000..523d22a
--- /dev/null
+++ b/dolfin/mesh/MeshEntity.cpp
@@ -0,0 +1,154 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Andre Massing, 2009.
+// Modified by Garth N. Wells, 2012.
+//
+// First added:  2006-05-11
+// Last changed: 2013-06-23
+
+#include <dolfin/log/log.h>
+#include "Mesh.h"
+#include "MeshTopology.h"
+#include "Vertex.h"
+#include "MeshEntity.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshEntity::MeshEntity(const Mesh& mesh, std::size_t dim, std::size_t index)
+  : _mesh(0), _dim(0), _local_index(0)
+{
+  init(mesh, dim, index);
+}
+//-----------------------------------------------------------------------------
+void MeshEntity::init(const Mesh& mesh, std::size_t dim, std::size_t index)
+{
+  // Store variables
+  _mesh = &mesh; // Yes, we should probably use a shared pointer here...
+  _dim = dim;
+  _local_index = index;
+
+  // Check index range
+  if (index < _mesh->num_entities(dim))
+    return;
+
+  // Initialize mesh entities
+  _mesh->init(dim);
+
+  // Check index range again
+  if (index < _mesh->num_entities(dim))
+    return;
+
+  // Illegal index range
+  dolfin_error("MeshEntity.cpp",
+               "create mesh entity",
+               "Mesh entity index %d out of range [0, %d] for entity of dimension %d",
+               index, _mesh->num_entities(dim), dim);
+}
+//-----------------------------------------------------------------------------
+MeshEntity::~MeshEntity()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+bool MeshEntity::incident(const MeshEntity& entity) const
+{
+  // Must be in the same mesh to be incident
+  if ( _mesh != entity._mesh )
+    return false;
+
+  // Get list of entities for given topological dimension
+  const unsigned int* entities = _mesh->topology()(_dim, entity._dim)(_local_index);
+  const std::size_t num_entities = _mesh->topology()(_dim, entity._dim).size(_local_index);
+
+  // Check if any entity matches
+  for (std::size_t i = 0; i < num_entities; ++i)
+    if (entities[i] == entity._local_index)
+      return true;
+
+  // Entity was not found
+  return false;
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshEntity::index(const MeshEntity& entity) const
+{
+  // Must be in the same mesh to be incident
+  if (_mesh != entity._mesh)
+  {
+    dolfin_error("MeshEntity.cpp",
+                 "compute index of mesh entity",
+                 "Mesh entity is defined on a different mesh");
+  }
+
+  // Get list of entities for given topological dimension
+  const unsigned int* entities = _mesh->topology()(_dim, entity._dim)(_local_index);
+  const std::size_t num_entities = _mesh->topology()(_dim, entity._dim).size(_local_index);
+
+  // Check if any entity matches
+  for (std::size_t i = 0; i < num_entities; ++i)
+    if (entities[i] == entity._local_index)
+      return i;
+
+  // Entity was not found
+  dolfin_error("MeshEntity.cpp",
+               "compute index of mesh entity",
+               "Mesh entity was not found");
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+Point MeshEntity::midpoint() const
+{
+  // Special case: a vertex is its own midpoint (don't check neighbors)
+  if (_dim == 0)
+    return _mesh->geometry().point(_local_index);
+
+  // Other wise iterate over incident vertices and compute average
+  std::size_t num_vertices = 0;
+
+  double x = 0.0;
+  double y = 0.0;
+  double z = 0.0;
+
+  for (VertexIterator v(*this); !v.end(); ++v)
+  {
+    x += v->point().x();
+    y += v->point().y();
+    z += v->point().z();
+    num_vertices++;
+  }
+
+  x /= double(num_vertices);
+  y /= double(num_vertices);
+  z /= double(num_vertices);
+
+  Point p(x, y, z);
+  return p;
+}
+//-----------------------------------------------------------------------------
+std::string MeshEntity::str(bool verbose) const
+{
+  if (verbose)
+    warning("Verbose output for MeshEntityIterator not implemented.");
+
+  std::stringstream s;
+  s << "<Mesh entity " << index()
+    << " of topological dimension " << dim() << ">";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshEntity.h b/dolfin/mesh/MeshEntity.h
new file mode 100644
index 0000000..d133919
--- /dev/null
+++ b/dolfin/mesh/MeshEntity.h
@@ -0,0 +1,246 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Andre Massing, 2009.
+// Modified by Garth N. Wells, 2012.
+//
+// First added:  2006-05-11
+// Last changed: 2013-06-23
+
+#ifndef __MESH_ENTITY_H
+#define __MESH_ENTITY_H
+
+#include <cmath>
+#include <iostream>
+
+#include <dolfin/geometry/Point.h>
+#include "Mesh.h"
+
+namespace dolfin
+{
+
+  //class Mesh;
+  class Point;
+
+  /// A MeshEntity represents a mesh entity associated with
+  /// a specific topological dimension of some _Mesh_.
+
+  class MeshEntity
+  {
+  public:
+
+    /// Default Constructor
+    MeshEntity() : _mesh(0), _dim(0), _local_index(0) {}
+
+    /// Constructor
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     dim (std::size_t)
+    ///         The topological dimension.
+    ///     index (std::size_t)
+    ///         The index.
+    MeshEntity(const Mesh& mesh, std::size_t dim, std::size_t index);
+
+    /// Destructor
+    virtual ~MeshEntity();
+
+    /// Initialize mesh entity with given data
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     dim (std::size_t)
+    ///         The topological dimension.
+    ///     index (std::size_t)
+    ///         The index.
+    void init(const Mesh& mesh, std::size_t dim, std::size_t index);
+
+    /// Comparision Operator
+    ///
+    /// *Arguments*
+    ///     another (_MeshEntity_)
+    ///         Another mesh entity
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the two mesh entities are equal.
+    bool operator==(const MeshEntity& e) const
+    {
+      return (_mesh == e._mesh && _dim == e._dim
+              && _local_index == e._local_index);
+    }
+
+    /// Comparision Operator
+    ///
+    /// *Arguments*
+    ///     another (MeshEntity)
+    ///         Another mesh entity.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the two mesh entities are NOT equal.
+    bool operator!=(const MeshEntity& e) const
+    { return !operator==(e); }
+
+    /// Return mesh associated with mesh entity
+    ///
+    /// *Returns*
+    ///     _Mesh_
+    ///         The mesh.
+    const Mesh& mesh() const
+    { return *_mesh; }
+
+    /// Return topological dimension
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The dimension.
+    std::size_t dim() const
+    { return _dim; }
+
+    /// Return index of mesh entity
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The index.
+    std::size_t index() const
+    { return _local_index; }
+
+    /// Return global index of mesh entity
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The global index. Set to
+    ///         std::numerical_limits<std::size_t>::max() if global index
+    ///         has not been computed
+    std::size_t global_index() const
+    { return _mesh->topology().global_indices(_dim)[_local_index]; }
+
+    /// Return local number of incident mesh entities of given
+    /// topological dimension
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The topological dimension.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    /// The number of local incident MeshEntity objects of given
+    /// dimension.
+    std::size_t num_entities(std::size_t dim) const
+    { return _mesh->topology()(_dim, dim).size(_local_index); }
+
+    /// Return global number of incident mesh entities of given
+    /// topological dimension
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The topological dimension.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The number of global incident MeshEntity objects of given
+    ///         dimension.
+    std::size_t num_global_entities(std::size_t dim) const
+    { return _mesh->topology()(_dim, dim).size_global(_local_index); }
+
+    /// Return array of indices for incident mesh entitites of given
+    /// topological dimension
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The topological dimension.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The index for incident mesh entities of given dimension.
+    const unsigned int* entities(std::size_t dim) const
+    { return _mesh->topology()(_dim, dim)(_local_index); }
+
+    /// Return unique mesh ID
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The unique mesh ID.
+    std::size_t mesh_id() const
+    { return _mesh->id(); }
+
+    /// Check if given entity is incident
+    ///
+    /// *Arguments*
+    ///     entity (_MeshEntity_)
+    ///         The entity.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the given entity is incident
+    bool incident(const MeshEntity& entity) const;
+
+    /// Compute local index of given incident entity (error if not
+    /// found)
+    ///
+    /// *Arguments*
+    ///     entity (_MeshEntity_)
+    ///         The mesh entity.
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The local index of given entity.
+    std::size_t index(const MeshEntity& entity) const;
+
+    /// Compute midpoint of cell
+    ///
+    /// *Returns*
+    ///     _Point_
+    ///         The midpoint of the cell.
+    Point midpoint() const;
+
+    // Note: Not a subclass of Variable for efficiency!
+    /// Return informal string representation (pretty-print)
+    ///
+    /// *Arguments*
+    ///     verbose (bool)
+    ///         Flag to turn on additional output.
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         An informal representation of the function space.
+    std::string str(bool verbose) const;
+
+  protected:
+
+    // Friends
+    friend class MeshEntityIterator;
+    template<typename T> friend class MeshEntityIteratorBase;
+    friend class SubsetIterator;
+
+    // The mesh
+    Mesh const * _mesh;
+
+    // Topological dimension
+    std::size_t _dim;
+
+    // Local index of entity within topological dimension
+    std::size_t _local_index;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshEntityIterator.h b/dolfin/mesh/MeshEntityIterator.h
new file mode 100644
index 0000000..86eebee
--- /dev/null
+++ b/dolfin/mesh/MeshEntityIterator.h
@@ -0,0 +1,204 @@
+// Copyright (C) 2006-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Andre Massing 2009
+//
+// First added:  2006-05-09
+// Last changed: 2013-04-23
+
+#ifndef __MESH_ENTITY_ITERATOR_H
+#define __MESH_ENTITY_ITERATOR_H
+
+#include "Mesh.h"
+#include "MeshEntity.h"
+
+namespace dolfin
+{
+
+  /// MeshEntityIterator provides a common iterator for mesh entities
+  /// over meshes, boundaries and incidence relations. The basic use
+  /// is illustrated below.
+  ///
+  /// *Example*
+  ///
+  ///     The following example shows how to iterate over all mesh entities
+  ///     of a mesh of topological dimension dim:
+  ///
+  ///     .. code-block:: c++
+  ///
+  ///         for (MeshEntityIterator e(mesh, dim); !e.end(); ++e)
+  ///         {
+  ///           e->foo();
+  ///         }
+  ///
+  ///     The following example shows how to iterate over mesh entities of
+  ///     topological dimension dim connected (incident) to some mesh entity f:
+  ///
+  ///     .. code-block:: c++
+  ///
+  ///         for (MeshEntityIterator e(f, dim); !e.end(); ++e)
+  ///         {
+  ///           e->foo();
+  ///         }
+  ///
+  /// In addition to the general iterator, a set of specific named iterators
+  /// are provided for entities of type _Vertex_, _Edge_, _Face_, _Facet_
+  /// and _Cell_. These iterators are defined along with their respective
+  /// classes.
+
+  class MeshEntityIterator
+  {
+  public:
+
+    /// Default constructor
+    MeshEntityIterator() : _pos(0), pos_end(0), index(0) {}
+
+    /// Create iterator for mesh entities over given topological dimension
+    MeshEntityIterator(const Mesh& mesh, std::size_t dim)
+      : _entity(), _pos(0), pos_end(mesh.size(dim)), index(0)
+    {
+      // Check if mesh is empty
+      if (mesh.num_vertices() == 0)
+        return;
+
+      // Initialize mesh entity
+      _entity.init(mesh, dim, 0);
+
+      // Update end position if entities need to be generated first
+      if (pos_end == 0)
+        pos_end = mesh.init(dim);
+    }
+
+    /// Create iterator for entities of given dimension connected to
+    /// given entity
+    MeshEntityIterator(const MeshEntity& entity, std::size_t dim)
+      : _entity(entity.mesh(), dim, 0), _pos(0), index(0)
+    {
+      // Get connectivity
+      const MeshConnectivity& c = entity.mesh().topology()(entity.dim(), dim);
+
+      // Compute connectivity if empty
+      if (c.empty())
+        entity.mesh().init(entity.dim(), dim);
+
+      // Get size and index map
+      if (c.empty())
+      {
+        pos_end = 0;
+        index = 0;
+      }
+      else
+      {
+        pos_end = c.size(entity.index());
+        index = c(entity.index());
+      }
+    }
+
+    /// Copy constructor
+    MeshEntityIterator(const MeshEntityIterator& it)
+      : _entity(it._entity), _pos(it._pos), pos_end(it.pos_end),
+      index(it.index) {}
+
+    /// Destructor
+    virtual ~MeshEntityIterator() {}
+
+    /// Step to next mesh entity (prefix increment)
+    MeshEntityIterator& operator++()
+    {
+      ++_pos;
+      return *this;
+    }
+
+    /// Step to the previous mesh entity (prefix decrease)
+    MeshEntityIterator& operator--()
+    {
+      --_pos;
+      return *this;
+    }
+
+    /// Return current position
+    std::size_t pos() const
+    { return _pos; }
+
+    /// Comparison operator
+    bool operator==(const MeshEntityIterator& it) const
+    {
+      // Use const_cast to use operator* inside comparison, which
+      // automatically updates the entity index corresponding to pos
+      // *before* comparison (since update of entity delays until
+      // request for entity)
+      return ((const_cast<MeshEntityIterator *>(this))->operator*()
+            == (const_cast<MeshEntityIterator *>(&it))->operator*()
+            && _pos == it._pos && index == it.index);
+    }
+
+    /// Comparison operator
+    bool operator!=(const MeshEntityIterator & it) const
+    { return !operator==(it); }
+
+    /// Dereference operator
+    MeshEntity& operator*()
+    { return *operator->(); }
+
+    /// Member access operator
+    MeshEntity* operator->()
+    { _entity._local_index = (index ? index[_pos] : _pos); return &_entity; }
+
+    /// Check if iterator has reached the end
+    bool end() const
+    { return _pos >= pos_end; }
+
+    /// Provide a safeguard iterator pointing beyond the end of an
+    /// iteration process, either iterating over the mesh /or incident
+    /// entities. Added to be bit more like STL iterators, since many
+    /// algorithms rely on a kind of beyond iterator.
+    MeshEntityIterator end_iterator()
+    {
+      MeshEntityIterator
+      sg(*this);
+      sg.set_end();
+      return sg;
+    }
+
+    // Note: Not a subclass of Variable for efficiency!
+    // Commented out to avoid warning about shadowing str() for MeshEntity
+    // Return informal string representation (pretty-print)
+    // std::string str(bool verbose) const;
+
+  private:
+
+    // Set pos to end position. To create a kind of mesh.end() iterator.
+    void set_end()
+    { _pos = pos_end; }
+
+    // Mesh entity
+    MeshEntity _entity;
+
+    // Current position
+    std::size_t _pos;
+
+    // End position
+    std::size_t pos_end;
+
+    // Mapping from pos to index (if any)
+    const unsigned int* index;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshEntityIteratorBase.h b/dolfin/mesh/MeshEntityIteratorBase.h
new file mode 100644
index 0000000..4e31c7d
--- /dev/null
+++ b/dolfin/mesh/MeshEntityIteratorBase.h
@@ -0,0 +1,169 @@
+// Copyright (C) 2012 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Andre Massing 2009
+//
+// First added:  2006-05-09
+// Last changed: 2011-11-08
+
+#ifndef __MESH_ENTITY_ITERATOR_BASE_H
+#define __MESH_ENTITY_ITERATOR_BASE_H
+
+#include <cstddef>
+#include "Mesh.h"
+#include "MeshEntity.h"
+
+namespace dolfin
+{
+
+  template<class T>
+  class MeshEntityIteratorBase
+  {
+  public:
+
+    /// Create iterator for mesh entities over given topological dimension
+    explicit MeshEntityIteratorBase(const Mesh& mesh)
+      : _entity(mesh, 0), _pos(0), pos_end(0), index(0)
+    {
+      // Check if mesh is empty
+      if (mesh.num_vertices() == 0)
+        return;
+
+      // Get number of entities
+      pos_end = mesh.init(_entity.dim());
+    }
+
+    /// Create iterator for entities of given dimension connected to given entity
+    explicit MeshEntityIteratorBase(const MeshEntity& entity)
+      : _entity(entity.mesh(), 0), _pos(0), index(0)
+    {
+      // Get connectivity
+      const MeshConnectivity& c = entity.mesh().topology()(entity.dim(), _entity.dim());
+
+      // Compute connectivity if empty
+      if (c.empty())
+        entity.mesh().init(entity.dim(), _entity.dim());
+
+      // Get size and index map
+      if (c.empty())
+      {
+        pos_end = 0;
+        index = 0;
+      }
+      else
+      {
+        pos_end = c.size(entity.index());
+        index = c(entity.index());
+      }
+    }
+
+    /// Copy constructor
+    MeshEntityIteratorBase(const MeshEntityIteratorBase& it)
+      : _entity(it._entity), _pos(it._pos), pos_end(it.pos_end), index(it.index) {}
+
+    /// Destructor
+    ~MeshEntityIteratorBase() {}
+
+    /// Step to next mesh entity (prefix increment)
+    MeshEntityIteratorBase& operator++()
+    {
+      ++_pos;
+      return *this;
+    }
+
+    /// Step to the previous mesh entity (prefix decrease)
+    MeshEntityIteratorBase& operator--()
+    {
+      --_pos;
+      return *this;
+    }
+
+    /// Return current position
+    std::size_t pos() const
+    { return _pos; }
+
+    /// Comparison operator.
+    bool operator==(const MeshEntityIteratorBase & it) const
+    {
+      // Use const_cast to use operator* inside comparison, which automatically
+      // updates the entity index corresponding to pos *before* comparison (since
+      // update of entity delays until request for entity)
+
+      return ((const_cast<MeshEntityIteratorBase<T> *>(this))->operator*()
+            == (const_cast<MeshEntityIteratorBase<T> *>(&it))->operator*()
+            && _pos == it._pos && index == it.index);
+    }
+
+    /// Comparison operator
+    bool operator!=(const MeshEntityIteratorBase & it) const
+    { return !operator==(it); }
+
+    /// Dereference operator
+    T& operator*()
+    { return *operator->(); }
+
+    /// Member access operator
+    T* operator->()
+    { _entity._local_index = (index ? index[_pos] : _pos); return &_entity; }
+
+    /// Random access operator
+    T& operator[] (std::size_t pos)
+    { _pos = pos; return *operator->();}
+
+    /// Check if iterator has reached the end
+    bool end() const
+    { return _pos >= pos_end; }
+
+    /// Provide a safeguard iterator pointing beyond the end of an iteration
+    /// process, either iterating over the mesh /or incident entities. Added to
+    /// be bit more like STL iterators, since many algorithms rely on a kind of
+    /// beyond iterator.
+    MeshEntityIteratorBase end_iterator()
+    {
+      MeshEntityIteratorBase sg(*this);
+      sg.set_end();
+      return sg;
+    }
+
+    // Note: Not a subclass of Variable for efficiency!
+    // Commented out to avoid warning about shadowing str() for MeshEntity
+    // Return informal string representation (pretty-print)
+    // std::string str(bool verbose) const;
+
+  private:
+
+    /// Set pos to end position. To create a kind of mesh.end() iterator.
+    void set_end()
+    { _pos = pos_end; }
+
+    // Mesh entity
+    T _entity;
+
+    // Current position
+    std::size_t _pos;
+
+    // End position
+    std::size_t pos_end;
+
+    // Mapping from pos to index (if any)
+    const unsigned int* index;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshFunction.cpp b/dolfin/mesh/MeshFunction.cpp
new file mode 100644
index 0000000..ff479b9
--- /dev/null
+++ b/dolfin/mesh/MeshFunction.cpp
@@ -0,0 +1,67 @@
+// Copyright (C) 2009-2011 Ola Skavhaug and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-25
+// Last changed: 2011-09-22
+
+#include <sstream>
+#include <string>
+#include "LocalMeshValueCollection.h"
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshPartitioning.h"
+#include "MeshFunction.h"
+#include "MeshValueCollection.h"
+
+namespace dolfin
+{
+
+//-----------------------------------------------------------------------------
+template<> std::string MeshFunction<double>::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    for (std::size_t i = 0; i < _size; i++)
+      s << "  (" << _dim << ", " << i << "): " << _values[i] << std::endl;
+  }
+  else
+    s << "<MeshFunction of topological dimension " << _dim << " containing " << _size << " values>";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+template<> std::string MeshFunction<std::size_t>::str(bool verbose) const
+{
+  std::stringstream s;
+
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    for (std::size_t i = 0; i < _size; i++)
+      s << "  (" << _dim << ", " << i << "): " << _values[i] << std::endl;
+  }
+  else
+    s << "<MeshFunction of topological dimension " << _dim << " containing " << _size << " values>";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+
+}
diff --git a/dolfin/mesh/MeshFunction.h b/dolfin/mesh/MeshFunction.h
new file mode 100644
index 0000000..765de2b
--- /dev/null
+++ b/dolfin/mesh/MeshFunction.h
@@ -0,0 +1,843 @@
+// Copyright (C) 2006-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman, 2007.
+// Modified by Garth N. Wells, 2010-2013
+//
+// First added:  2006-05-22
+// Last changed: 2013-05-10
+
+#ifndef __MESH_FUNCTION_H
+#define __MESH_FUNCTION_H
+
+#include <map>
+#include <vector>
+
+#include <boost/scoped_array.hpp>
+#include <memory>
+#include <boost/unordered_set.hpp>
+#include <dolfin/common/Hierarchical.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/log/log.h>
+#include <dolfin/io/File.h>
+#include "LocalMeshValueCollection.h"
+#include "MeshDomains.h"
+#include "MeshEntity.h"
+#include "Mesh.h"
+#include "MeshConnectivity.h"
+
+namespace dolfin
+{
+
+  class MeshEntity;
+
+  /// A MeshFunction is a function that can be evaluated at a set of
+  /// mesh entities. A MeshFunction is discrete and is only defined
+  /// at the set of mesh entities of a fixed topological dimension.
+  /// A MeshFunction may for example be used to store a global
+  /// numbering scheme for the entities of a (parallel) mesh, marking
+  /// sub domains or boolean markers for mesh refinement.
+
+  template <typename T> class MeshFunction : public Variable,
+    public Hierarchical<MeshFunction<T> >
+  {
+  public:
+
+    /// Create empty mesh function
+    MeshFunction();
+
+    /// Create empty mesh function on given mesh
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    explicit MeshFunction(const Mesh& mesh);
+
+    /// Create empty mesh function on given mesh (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    explicit MeshFunction(std::shared_ptr<const Mesh> mesh);
+
+    /// Create mesh function of given dimension on given mesh
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension for the mesh function.
+    MeshFunction(const Mesh& mesh, std::size_t dim);
+
+    /// Create mesh function of given dimension on given mesh
+    /// (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension for the mesh function.
+    MeshFunction(std::shared_ptr<const Mesh> mesh, std::size_t dim);
+
+    /// Create mesh of given dimension on given mesh and initialize
+    /// to a value
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension.
+    ///     value (T)
+    ///         The value.
+    MeshFunction(const Mesh& mesh, std::size_t dim, const T& value);
+
+    /// Create mesh of given dimension on given mesh and initialize
+    /// to a value (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension.
+    ///     value (T)
+    ///         The value.
+    MeshFunction(std::shared_ptr<const Mesh> mesh, std::size_t dim,
+                 const T& value);
+
+    /// Create function from data file
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     filename (std::string)
+    ///         The filename to create mesh function from.
+    MeshFunction(const Mesh& mesh, const std::string filename);
+
+    /// Create function from data file (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     filename (std::string)
+    ///         The filename to create mesh function from.
+    MeshFunction(std::shared_ptr<const Mesh> mesh,
+                 const std::string filename);
+
+    /// Create function from a MeshValueCollecion
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     value_collection (_MeshValueCollection_ <T>)
+    ///         The mesh value collection for the mesh function data.
+    MeshFunction(const Mesh& mesh,
+                 const MeshValueCollection<T>& value_collection);
+
+    /// Create function from a MeshValueCollecion (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     value_collection (_MeshValueCollection_ <T>)
+    ///         The mesh value collection for the mesh function data.
+    MeshFunction(std::shared_ptr<const Mesh> mesh,
+                 const MeshValueCollection<T>& value_collection);
+
+    /// Create function from MeshDomains
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to create mesh function on.
+    ///     dim (std::size_t)
+    ///         The dimension of the MeshFunction
+    ///     domains (_MeshDomains)
+    ///         The domains from which to extratc the domain markers
+    MeshFunction(std::shared_ptr<const Mesh> mesh,
+                 std::size_t dim, const MeshDomains& domains);
+
+    /// Copy constructor
+    ///
+    /// *Arguments*
+    ///     f (_MeshFunction_ <T>)
+    ///         The object to be copied.
+    MeshFunction(const MeshFunction<T>& f);
+
+    /// Destructor
+    ~MeshFunction() {}
+
+    /// Assign mesh function to other mesh function
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     f (_MeshFunction_ <T>)
+    ///         A _MeshFunction_ object to asssign to another MeshFunction.
+    MeshFunction<T>& operator= (const MeshFunction<T>& f);
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     mesh (_MeshValueCollection_)
+    ///         A _MeshValueCollection_ object used to construct a MeshFunction.
+    MeshFunction<T>& operator=(const MeshValueCollection<T>& mesh);
+
+    /// Return mesh associated with mesh function
+    ///
+    /// *Returns*
+    ///     _Mesh_
+    ///         The mesh.
+    std::shared_ptr<const Mesh> mesh() const;
+
+    /// Return topological dimension
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The dimension.
+    std::size_t dim() const;
+
+    /// Return true if empty
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if empty.
+    bool empty() const;
+
+    /// Return size (number of entities)
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The size.
+    std::size_t size() const;
+
+    /// Return array of values (const. version)
+    ///
+    /// *Returns*
+    ///     T
+    ///         The values.
+    const T* values() const;
+
+    /// Return array of values
+    ///
+    /// *Returns*
+    ///     T
+    ///         The values.
+    T* values();
+
+    /// Return value at given mesh entity
+    ///
+    /// *Arguments*
+    ///     entity (_MeshEntity_)
+    ///         The mesh entity.
+    ///
+    /// *Returns*
+    ///     T
+    ///         The value at the given entity.
+    T& operator[] (const MeshEntity& entity);
+
+    /// Return value at given mesh entity (const version)
+    ///
+    /// *Arguments*
+    ///     entity (_MeshEntity_)
+    ///         The mesh entity.
+    ///
+    /// *Returns*
+    ///     T
+    ///         The value at the given entity.
+    const T& operator[] (const MeshEntity& entity) const;
+
+    /// Return value at given index
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The index.
+    ///
+    /// *Returns*
+    ///     T
+    ///         The value at the given index.
+    T& operator[] (std::size_t index);
+
+    /// Return value at given index  (const version)
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The index.
+    ///
+    /// *Returns*
+    ///     T
+    ///         The value at the given index.
+    const T& operator[] (std::size_t index) const;
+
+    /// Set all values to given value
+    const MeshFunction<T>& operator= (const T& value);
+
+    /// Initialize mesh function for given topological dimension
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The dimension.
+    void init(std::size_t dim);
+
+    /// Initialize mesh function for given topological dimension of
+    /// given size
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The dimension.
+    ///     size (std::size_t)
+    ///         The size.
+    void init(std::size_t dim, std::size_t size);
+
+    /// Initialize mesh function for given topological dimension
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     dim (std::size_t)
+    ///         The dimension.
+    void init(const Mesh& mesh, std::size_t dim);
+
+    /// Initialize mesh function for given topological dimension
+    /// (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     dim (std::size_t)
+    ///         The dimension.
+    void init(std::shared_ptr<const Mesh> mesh, std::size_t dim);
+
+    /// Initialize mesh function for given topological dimension of
+    /// given size
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     dim (std::size_t)
+    ///         The dimension.
+    ///     size (std::size_t)
+    ///         The size.
+    void init(const Mesh& mesh, std::size_t dim, std::size_t size);
+
+    /// Initialize mesh function for given topological dimension of
+    /// given size (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     dim (std::size_t)
+    ///         The dimension.
+    ///     size (std::size_t)
+    ///         The size.
+    void init(std::shared_ptr<const Mesh> mesh, std::size_t dim,
+              std::size_t size);
+
+    /// Set value at given index
+    ///
+    /// *Arguments*
+    ///     index (std::size_t)
+    ///         The index.
+    ///     value (T)
+    ///         The value.
+    void set_value(std::size_t index, const T& value);
+
+    /// Compatibility function for use in SubDomains
+    void set_value(std::size_t index, const T& value, const Mesh& mesh)
+    { set_value(index, value); }
+
+    /// Set values
+    ///
+    /// *Arguments*
+    ///     values (std::vector<T>)
+    ///         The values.
+    void set_values(const std::vector<T>& values);
+
+    /// Set all values to given value
+    ///
+    /// *Arguments*
+    ///     value (T)
+    ///         The value to set all values to.
+    void set_all(const T& value);
+
+    /// Return informal string representation (pretty-print)
+    ///
+    /// *Arguments*
+    ///     verbose (bool)
+    ///         Flag to turn on additional output.
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         An informal representation.
+    std::string str(bool verbose) const;
+
+  private:
+
+    // Values at the set of mesh entities. We don't use a std::vector<T>
+    // here because it has trouble with bool, which C++ specialises.
+    boost::scoped_array<T> _values;
+
+    // The mesh
+    std::shared_ptr<const Mesh> _mesh;
+
+    // Topological dimension
+    std::size_t _dim;
+
+    // Number of mesh entities
+    std::size_t _size;
+  };
+
+  template<> std::string MeshFunction<double>::str(bool verbose) const;
+  template<> std::string MeshFunction<std::size_t>::str(bool verbose) const;
+
+  //---------------------------------------------------------------------------
+  // Implementation of MeshFunction
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshFunction<T>::MeshFunction() : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this), _values(0), _dim(0),
+    _size(0)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshFunction<T>::MeshFunction(const Mesh& mesh)
+    : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this),
+    _mesh(reference_to_no_delete_pointer(mesh)), _dim(0), _size(0)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshFunction<T>::MeshFunction(std::shared_ptr<const Mesh> mesh)
+    : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this), _mesh(mesh), _dim(0), _size(0)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  MeshFunction<T>::MeshFunction(const Mesh& mesh, std::size_t dim)
+    : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this),
+    _mesh(reference_to_no_delete_pointer(mesh)) , _dim(0), _size(0)
+  {
+    init(dim);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshFunction<T>::MeshFunction(std::shared_ptr<const Mesh> mesh,
+                                  std::size_t dim)
+    : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this), _mesh(mesh), _dim(0), _size(0)
+  {
+    init(dim);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  MeshFunction<T>::MeshFunction(const Mesh& mesh, std::size_t dim,
+                                const T& value)
+    : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this),
+    _mesh(reference_to_no_delete_pointer(mesh)), _dim(0), _size(0)
+  {
+    init(dim);
+    set_all(value);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshFunction<T>::MeshFunction(std::shared_ptr<const Mesh> mesh,
+                                   std::size_t dim, const T& value)
+  : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this), _mesh(mesh), _dim(0), _size(0)
+  {
+    init(dim);
+    set_all(value);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  MeshFunction<T>::MeshFunction(const Mesh& mesh, const std::string filename)
+    : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this),
+    _mesh(reference_to_no_delete_pointer(mesh)), _dim(0), _size(0)
+  {
+    File file(filename);
+    file >> *this;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshFunction<T>::MeshFunction(std::shared_ptr<const Mesh> mesh,
+                                  const std::string filename)
+    : Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this), _mesh(mesh), _dim(0), _size(0)
+  {
+    File file(filename);
+    file >> *this;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  MeshFunction<T>::MeshFunction(const Mesh& mesh,
+    const MeshValueCollection<T>& value_collection) :
+    Variable("f", "unnamed MeshFunction"),
+      Hierarchical<MeshFunction<T> >(*this),
+      _mesh(reference_to_no_delete_pointer(mesh)),
+      _dim(value_collection.dim()), _size(0)
+  {
+    *this = value_collection;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshFunction<T>::MeshFunction(std::shared_ptr<const Mesh> mesh,
+                                  const MeshValueCollection<T>& value_collection)
+    : Variable("f", "unnamed MeshFunction"),
+      Hierarchical<MeshFunction<T> >(*this), _mesh(mesh),
+      _dim(value_collection.dim()), _size(0)
+  {
+    *this = value_collection;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshFunction<T>::MeshFunction(std::shared_ptr<const Mesh> mesh,
+                                  std::size_t dim, const MeshDomains& domains)
+    : Variable("f", "unnamed MeshFunction"),
+      Hierarchical<MeshFunction<T> >(*this), _mesh(mesh), _dim(0), _size(0)
+  {
+    dolfin_assert(_mesh);
+
+    // Initialise MeshFunction
+    init(dim);
+
+    // Initialise mesh
+    mesh->init(dim);
+
+    // Set MeshFunction with default value
+    set_all(std::numeric_limits<T>::max());
+
+    // Get mesh dimension
+    const std::size_t D = _mesh->topology().dim();
+    dolfin_assert(dim <= D);
+
+    // Get domain data
+    const std::map<std::size_t, std::size_t>& data = domains.markers(dim);
+
+    // Iterate over all values and copy into MeshFunctions
+    std::map<std::size_t, std::size_t>::const_iterator it;
+    for (it = data.begin(); it != data.end(); ++it)
+    {
+      // Get value collection entry data
+      const std::size_t entity_index = it->first;
+      const T value = it->second;
+
+      dolfin_assert(entity_index < _size);
+      _values[entity_index] = value;
+    }
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  MeshFunction<T>::MeshFunction(const MeshFunction<T>& f) :
+    Variable("f", "unnamed MeshFunction"),
+    Hierarchical<MeshFunction<T> >(*this), _dim(0), _size(0)
+  {
+    *this = f;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  MeshFunction<T>& MeshFunction<T>::operator= (const MeshFunction<T>& f)
+  {
+    if (_size != f._size)
+      _values.reset(new T[f._size]);
+    _mesh = f._mesh;
+    _dim  = f._dim;
+    _size = f._size;
+    std::copy(f._values.get(), f._values.get() + _size, _values.get());
+
+    Hierarchical<MeshFunction<T> >::operator=(f);
+
+    return *this;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  MeshFunction<T>& MeshFunction<T>::operator=(const MeshValueCollection<T>& mesh_value_collection)
+  {
+    _dim = mesh_value_collection.dim();
+    init(_dim);
+    dolfin_assert(_mesh);
+
+    // Get mesh connectivity D --> d
+    const std::size_t d = _dim;
+    const std::size_t D = _mesh->topology().dim();
+    dolfin_assert(d <= D);
+
+    // Generate connectivity if it does not excist
+    _mesh->init(D, d);
+    const MeshConnectivity& connectivity = _mesh->topology()(D, d);
+    dolfin_assert(!connectivity.empty());
+
+    // Set MeshFunction with default value
+    set_all(std::numeric_limits<T>::max());
+
+    // Iterate over all values
+    boost::unordered_set<std::size_t> entities_values_set;
+    typename std::map<std::pair<std::size_t, std::size_t>, T>::const_iterator it;
+    const std::map<std::pair<std::size_t, std::size_t>, T>& values
+      = mesh_value_collection.values();
+    for (it = values.begin(); it != values.end(); ++it)
+    {
+      // Get value collection entry data
+      const std::size_t cell_index = it->first.first;
+      const std::size_t local_entity = it->first.second;
+      const T value = it->second;
+
+      std::size_t entity_index = 0;
+      if (d != D)
+      {
+        // Get global (local to to process) entity index
+        dolfin_assert(cell_index < _mesh->num_cells());
+        entity_index = connectivity(cell_index)[local_entity];
+      }
+      else
+      {
+        entity_index = cell_index;
+        dolfin_assert(local_entity == 0);
+      }
+
+      // Set value for entity
+      dolfin_assert(entity_index < _size);
+      _values[entity_index] = value;
+
+      // Add entity index to set (used to check that all values are set)
+      entities_values_set.insert(entity_index);
+    }
+
+    // Check that all values have been set, if not issue a debug message
+    if (entities_values_set.size() != _size)
+      dolfin_debug("Mesh value collection does not contain all values for all entities");
+
+    return *this;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    std::shared_ptr<const Mesh> MeshFunction<T>::mesh() const
+  {
+    dolfin_assert(_mesh);
+    return _mesh;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    std::size_t MeshFunction<T>::dim() const
+  {
+    return _dim;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    bool MeshFunction<T>::empty() const
+  {
+    return _size == 0;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    std::size_t MeshFunction<T>::size() const
+  {
+    return _size;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    const T* MeshFunction<T>::values() const
+  {
+    return _values.get();
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    T* MeshFunction<T>::values()
+  {
+    return _values.get();
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    T& MeshFunction<T>::operator[] (const MeshEntity& entity)
+  {
+    dolfin_assert(_values);
+    dolfin_assert(&entity.mesh() == _mesh.get());
+    dolfin_assert(entity.dim() == _dim);
+    dolfin_assert(entity.index() < _size);
+    return _values[entity.index()];
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    const T& MeshFunction<T>::operator[] (const MeshEntity& entity) const
+  {
+    dolfin_assert(_values);
+    dolfin_assert(&entity.mesh() == _mesh.get());
+    dolfin_assert(entity.dim() == _dim);
+    dolfin_assert(entity.index() < _size);
+    return _values[entity.index()];
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    T& MeshFunction<T>::operator[] (std::size_t index)
+  {
+    dolfin_assert(_values);
+    dolfin_assert(index < _size);
+    return _values[index];
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    const T& MeshFunction<T>::operator[] (std::size_t index) const
+  {
+    dolfin_assert(_values);
+    dolfin_assert(index < _size);
+    return _values[index];
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    const MeshFunction<T>& MeshFunction<T>::operator= (const T& value)
+  {
+    set_all(value);
+    //Hierarchical<MeshFunction<T> >::operator=(value);
+    return *this;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshFunction<T>::init(std::size_t dim)
+  {
+    if (!_mesh)
+    {
+      dolfin_error("MeshFunction.h",
+                   "initialize mesh function",
+                   "Mesh has not been specified for mesh function");
+
+    }
+    _mesh->init(dim);
+    init(_mesh, dim, _mesh->size(dim));
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshFunction<T>::init(std::size_t dim, std::size_t size)
+  {
+    if (!_mesh)
+    {
+      dolfin_error("MeshFunction.h",
+                   "initialize mesh function",
+                   "Mesh has not been specified for mesh function");
+    }
+    _mesh->init(dim);
+    init(_mesh, dim, size);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshFunction<T>::init(const Mesh& mesh, std::size_t dim)
+  {
+    mesh.init(dim);
+    init(mesh, dim, mesh.size(dim));
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshFunction<T>::init(std::shared_ptr<const Mesh> mesh,
+                               std::size_t dim)
+  {
+    dolfin_assert(mesh);
+    mesh->init(dim);
+    init(mesh, dim, mesh->size(dim));
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshFunction<T>::init(const Mesh& mesh, std::size_t dim,
+                               std::size_t size)
+  {
+    // Initialize mesh for entities of given dimension
+    mesh.init(dim);
+    dolfin_assert(mesh.size(dim) == size);
+
+    // Initialize data
+    if (_size != size)
+      _values.reset(new T[size]);
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _dim = dim;
+    _size = size;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshFunction<T>::init(std::shared_ptr<const Mesh> mesh,
+                               std::size_t dim, std::size_t size)
+  {
+    dolfin_assert(mesh);
+
+    // Initialize mesh for entities of given dimension
+    mesh->init(dim);
+    dolfin_assert(mesh->size(dim) == size);
+
+    // Initialize data
+    if (_size != size)
+      _values.reset(new T[size]);
+    _mesh = mesh;
+    _dim = dim;
+    _size = size;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  void MeshFunction<T>::set_value(std::size_t index, const T& value)
+  {
+    dolfin_assert(_values);
+    dolfin_assert(index < _size);
+    _values[index] = value;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  void MeshFunction<T>::set_values(const std::vector<T>& values)
+  {
+    dolfin_assert(_values);
+    dolfin_assert(_size == values.size());
+    std::copy(values.begin(), values.end(), _values.get());
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  void MeshFunction<T>::set_all(const T& value)
+  {
+    dolfin_assert(_values);
+    std::fill(_values.get(), _values.get() + _size, value);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  std::string MeshFunction<T>::str(bool verbose) const
+  {
+    std::stringstream s;
+    if (verbose)
+    {
+      s << str(false) << std::endl << std::endl;
+      warning("Verbose output of MeshFunctions must be implemented manually.");
+
+      // This has been disabled as it severely restricts the ease with which
+      // templated MeshFunctions can be used, e.g. it is not possible to
+      // template over std::vector.
+
+      //for (std::size_t i = 0; i < _size; i++)
+      //  s << "  (" << _dim << ", " << i << "): " << _values[i] << std::endl;
+    }
+    else
+    {
+      s << "<MeshFunction of topological dimension " << dim()
+        << " containing " << size() << " values>";
+    }
+
+    return s.str();
+  }
+  //---------------------------------------------------------------------------
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshGeometry.cpp b/dolfin/mesh/MeshGeometry.cpp
new file mode 100644
index 0000000..751e524
--- /dev/null
+++ b/dolfin/mesh/MeshGeometry.cpp
@@ -0,0 +1,141 @@
+// Copyright (C) 2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2008.
+// Modified by Kristoffer Selim, 2008.
+//
+// First added:  2006-05-19
+// Last changed: 2010-04-29
+
+#include <sstream>
+#include <boost/functional/hash.hpp>
+
+#include <dolfin/log/log.h>
+#include "MeshGeometry.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshGeometry::MeshGeometry() : _dim(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+MeshGeometry::MeshGeometry(const MeshGeometry& geometry) : _dim(0)
+{
+  *this = geometry;
+}
+//-----------------------------------------------------------------------------
+MeshGeometry::~MeshGeometry()
+{
+  clear();
+}
+//-----------------------------------------------------------------------------
+const MeshGeometry& MeshGeometry::operator= (const MeshGeometry& geometry)
+{
+  // Copy data
+  _dim = geometry._dim;
+  coordinates             = geometry.coordinates;
+  position_to_local_index = geometry.position_to_local_index;
+  local_index_to_position = geometry.local_index_to_position;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+Point MeshGeometry::point(std::size_t n) const
+{
+  double _x = 0.0;
+  double _y = 0.0;
+  double _z = 0.0;
+
+  if ( _dim > 0 )
+    _x = x(n, 0);
+  if ( _dim > 1 )
+    _y = x(n, 1);
+  if ( _dim > 2 )
+    _z = x(n, 2);
+
+  Point p(_x, _y, _z);
+  return p;
+}
+//-----------------------------------------------------------------------------
+void MeshGeometry::clear()
+{
+  _dim  = 0;
+  coordinates.clear();
+  position_to_local_index.clear();
+  local_index_to_position.clear();
+}
+//-----------------------------------------------------------------------------
+void MeshGeometry::init(std::size_t dim, std::size_t size)
+{
+  // Delete old data if any
+  clear();
+
+  // Allocate new data
+  coordinates.resize(dim*size);
+
+  // Allocate new data
+  position_to_local_index.resize(size);
+  local_index_to_position.resize(size);
+
+  // Save dimension and size
+  _dim = dim;
+}
+//-----------------------------------------------------------------------------
+void MeshGeometry::set(std::size_t local_index,
+                       const std::vector<double>& x)
+{
+  dolfin_assert(x.size() == _dim);
+  std::copy(x.begin(), x.end(), coordinates.begin() + local_index*_dim);
+
+  dolfin_assert(local_index < position_to_local_index.size());
+  position_to_local_index[local_index] = local_index;
+
+  dolfin_assert(local_index < local_index_to_position.size());
+  local_index_to_position[local_index] = local_index;
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshGeometry::hash() const
+{
+  // Compute local hash
+  boost::hash<std::vector<double> > dhash;
+  const std::size_t local_hash = dhash(coordinates);
+  return local_hash;
+}
+//-----------------------------------------------------------------------------
+std::string MeshGeometry::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+    for (std::size_t i = 0; i < size(); i++)
+    {
+      s << "  " << i << ":";
+      for (std::size_t d = 0; d < _dim; d++)
+        s << " " << x(i, d);
+      s << std::endl;
+    }
+    s << std::endl;
+  }
+  else
+    s << "<MeshGeometry of dimension " << _dim << " and size " << size() << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshGeometry.h b/dolfin/mesh/MeshGeometry.h
new file mode 100644
index 0000000..4925c6d
--- /dev/null
+++ b/dolfin/mesh/MeshGeometry.h
@@ -0,0 +1,151 @@
+// Copyright (C) 2006 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2008.
+//
+// First added:  2006-05-08
+// Last changed: 2010-11-29
+
+#ifndef __MESH_GEOMETRY_H
+#define __MESH_GEOMETRY_H
+
+#include <string>
+#include <vector>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/log/log.h>
+
+namespace dolfin
+{
+
+  /// MeshGeometry stores the geometry imposed on a mesh. Currently,
+  /// the geometry is represented by the set of coordinates for the
+  /// vertices of a mesh, but other representations are possible.
+
+  class Function;
+
+  class MeshGeometry
+  {
+  public:
+
+    /// Create empty set of coordinates
+    MeshGeometry();
+
+    /// Copy constructor
+    MeshGeometry(const MeshGeometry& geometry);
+
+    /// Destructor
+    ~MeshGeometry();
+
+    /// Assignment
+    const MeshGeometry& operator= (const MeshGeometry& geometry);
+
+    /// Return Euclidean dimension of coordinate system
+    std::size_t dim() const
+    { return _dim; }
+
+    /// Return number of coordinates
+    std::size_t size() const
+    {
+      dolfin_assert(coordinates.size() % _dim == 0);
+      return coordinates.size()/_dim;
+    }
+
+    /// Return value of coordinate with local index n in direction i
+    double& x(std::size_t n, std::size_t i)
+    {
+      dolfin_assert(n < local_index_to_position.size());
+      dolfin_assert(i < _dim);
+      return coordinates[local_index_to_position[n]*_dim + i];
+    }
+
+    /// Return value of coordinate with local index n in direction i
+    double x(std::size_t n, std::size_t i) const
+    {
+      dolfin_assert(n < local_index_to_position.size());
+      dolfin_assert(i < _dim);
+      return coordinates[local_index_to_position[n]*_dim + i];
+    }
+
+    /// Return array of values for coordinate with local index n
+    double* x(std::size_t n)
+    {
+      dolfin_assert(n < local_index_to_position.size());
+      return &coordinates[local_index_to_position[n]*_dim];
+    }
+
+    /// Return array of values for coordinate with local index n
+    const double* x(std::size_t n) const
+    {
+      dolfin_assert(n < local_index_to_position.size());
+      return &coordinates[local_index_to_position[n]*_dim];
+    }
+
+    /// Return array of values for all coordinates
+    std::vector<double>& x()
+    { return coordinates; }
+
+    /// Return array of values for all coordinates
+    const std::vector<double>& x() const
+    { return coordinates; }
+
+    /// Return coordinate with local index n as a 3D point value
+    Point point(std::size_t n) const;
+
+    /// Clear all data
+    void clear();
+
+    /// Initialize coordinate list to given dimension and size
+    void init(std::size_t dim, std::size_t size);
+
+    /// Set value of coordinate
+    //void set(std::size_t n, std::size_t i, double x);
+    void set(std::size_t local_index, const std::vector<double>& x);
+
+    /// Hash of coordinate values
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         A tree-hashed value of the coordinates over all MPI processes
+    ///
+    std::size_t hash() const;
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+  private:
+
+    // Friends
+    friend class BinaryFile;
+    friend class MeshRenumbering;
+
+    // Euclidean dimension
+    std::size_t _dim;
+
+    // Coordinates for all vertices stored as a contiguous array
+    std::vector<double> coordinates;
+
+    // Local coordinate indices (array position -> index)
+    std::vector<unsigned int> position_to_local_index;
+
+    // Local coordinate indices (local index -> array position)
+    std::vector<unsigned int> local_index_to_position;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshOrdering.cpp b/dolfin/mesh/MeshOrdering.cpp
new file mode 100644
index 0000000..bcf3712
--- /dev/null
+++ b/dolfin/mesh/MeshOrdering.cpp
@@ -0,0 +1,80 @@
+// Copyright (C) 2007-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-01-30
+// Last changed: 2012-06-25
+
+#include <vector>
+#include <memory>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "Mesh.h"
+#include "MeshOrdering.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void MeshOrdering::order(Mesh& mesh)
+{
+  log(TRACE, "Ordering mesh.");
+
+  // Special case
+  if (mesh.num_cells() == 0)
+    return;
+
+  // Get global vertex numbering
+  dolfin_assert(mesh.topology().have_global_indices(0));
+  const std::vector<std::size_t>& local_to_global_vertex_indices
+    = mesh.topology().global_indices(0);
+
+  // Skip ordering for dimension 0
+  if (mesh.topology().dim() == 0)
+    return;
+
+  // Iterate over all cells and order the mesh entities locally
+  Progress p("Ordering mesh", mesh.num_cells());
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    cell->order(local_to_global_vertex_indices);
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
+bool MeshOrdering::ordered(const Mesh& mesh)
+{
+  // Special case
+  if (mesh.num_cells() == 0)
+    return true;
+
+  // Get global vertex numbering
+  dolfin_assert(mesh.topology().have_global_indices(0));
+  const std::vector<std::size_t>& local_to_global_vertex_indices
+    = mesh.topology().global_indices(0);
+
+  // Check if all cells are ordered
+  Progress p("Checking mesh ordering", mesh.num_cells());
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    if (!cell->ordered(local_to_global_vertex_indices))
+      return false;
+    p++;
+  }
+
+  return true;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshOrdering.h b/dolfin/mesh/MeshOrdering.h
new file mode 100644
index 0000000..5ed62cd
--- /dev/null
+++ b/dolfin/mesh/MeshOrdering.h
@@ -0,0 +1,46 @@
+// Copyright (C) 2007-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-01-30
+// Last changed: 2010-11-27
+
+#ifndef __MESH_ORDERING_H
+#define __MESH_ORDERING_H
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class implements the ordering of mesh entities according to
+  /// the UFC specification (see appendix of DOLFIN user manual).
+
+  class MeshOrdering
+  {
+  public:
+
+    /// Order mesh
+    static void order(Mesh& mesh);
+
+    /// Check if mesh is ordered
+    static bool ordered(const Mesh& mesh);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshPartitioning.cpp b/dolfin/mesh/MeshPartitioning.cpp
new file mode 100644
index 0000000..6673999
--- /dev/null
+++ b/dolfin/mesh/MeshPartitioning.cpp
@@ -0,0 +1,545 @@
+// Copyright (C) 2008-2012 Niclas Jansson, Ola Skavhaug, Anders Logg
+// and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kent-Andre Mardal 2011
+// Modified by Anders Logg 2011
+// Modified by Garth N. Wells 2011-2012
+//
+// First added:  2008-12-01
+// Last changed: 2014-02-06
+
+#include <algorithm>
+#include <iterator>
+#include <map>
+#include <numeric>
+#include <set>
+#include <boost/multi_array.hpp>
+
+#include <dolfin/log/log.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/geometry/Point.h>
+#include <dolfin/graph/ParMETIS.h>
+#include <dolfin/graph/SCOTCH.h>
+#include <dolfin/graph/ZoltanPartition.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include "BoundaryMesh.h"
+#include "DistributedMeshTools.h"
+#include "Facet.h"
+#include "LocalMeshData.h"
+#include "Mesh.h"
+#include "MeshEditor.h"
+#include "MeshEntity.h"
+#include "MeshEntityIterator.h"
+#include "MeshFunction.h"
+#include "MeshTopology.h"
+#include "MeshValueCollection.h"
+#include "Vertex.h"
+#include "MeshPartitioning.h"
+
+using namespace dolfin;
+
+// Explicitly instantiate some templated functions to help the Python
+// wrappers
+template void MeshPartitioning::build_mesh_value_collection(const Mesh& mesh,
+   const std::vector<std::pair<std::pair<std::size_t, std::size_t>, std::size_t> >&
+                                                            local_value_data,
+   MeshValueCollection<std::size_t>& mesh_values);
+
+template void MeshPartitioning::build_mesh_value_collection(const Mesh& mesh,
+   const std::vector<std::pair<std::pair<std::size_t, std::size_t>, int> >&
+                                                            local_value_data,
+   MeshValueCollection<int>& mesh_values);
+
+template void MeshPartitioning::build_mesh_value_collection(const Mesh& mesh,
+   const std::vector<std::pair<std::pair<std::size_t, std::size_t>, double> >&
+                                                            local_value_data,
+   MeshValueCollection<double>& mesh_values);
+
+template void MeshPartitioning::build_mesh_value_collection(const Mesh& mesh,
+   const std::vector<std::pair<std::pair<std::size_t, std::size_t>, bool> >&
+                                                            local_value_data,
+                                     MeshValueCollection<bool>& mesh_values);
+
+//-----------------------------------------------------------------------------
+void MeshPartitioning::build_distributed_mesh(Mesh& mesh)
+{
+  if (MPI::size(mesh.mpi_comm()) > 1)
+  {
+    // Create and distribute local mesh data
+    LocalMeshData local_mesh_data(mesh);
+
+    // Build distributed mesh
+    build_distributed_mesh(mesh, local_mesh_data);
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshPartitioning::build_distributed_mesh(Mesh& mesh,
+                            const std::vector<std::size_t>& cell_destinations)
+{
+  if (MPI::size(mesh.mpi_comm()) > 1)
+  {
+    // Create and distribute local mesh data
+    LocalMeshData local_mesh_data(mesh);
+
+    // Attach cell destinations
+    local_mesh_data.cell_partition = cell_destinations;
+
+    // Build distributed mesh
+    build_distributed_mesh(mesh, local_mesh_data);
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshPartitioning::build_distributed_mesh(Mesh& mesh,
+                                              const LocalMeshData& local_data)
+{
+  // Compute cell partitioning or use partitioning provides in local_data
+  std::vector<std::size_t> cell_partition;
+  if (local_data.cell_partition.empty())
+    cell_partition = partition_cells(mesh, local_data);
+  else
+  {
+    cell_partition = local_data.cell_partition;
+    dolfin_assert(cell_partition.size()
+                  == local_data.global_cell_indices.size());
+    dolfin_assert(*std::max_element(cell_partition.begin(), cell_partition.end())
+                  < MPI::size(mesh.mpi_comm()));
+  }
+
+  // Build mesh from local mesh data and provided cell partition
+  build(mesh, local_data, cell_partition);
+
+  // Create MeshDomains from local_data
+  build_mesh_domains(mesh, local_data);
+
+  // Initialise number of globally connected cells to each facet. This is
+  // necessary to distinguish between facets on an exterior boundary and
+  // facets on a partition boundary (see
+  // https://bugs.launchpad.net/dolfin/+bug/733834).
+  DistributedMeshTools::init_facet_cell_connections(mesh);
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> MeshPartitioning::partition_cells(Mesh& mesh,
+                                                const LocalMeshData& mesh_data)
+{
+  // Data structure to hold cell partitions
+  std::vector<std::size_t> cell_partition;
+
+  // Compute cell partition using partitioner from parameter system
+  const std::string partitioner = parameters["mesh_partitioner"];
+  if (partitioner == "SCOTCH")
+    SCOTCH::compute_partition(mesh.mpi_comm(), cell_partition, mesh_data);
+  else if (partitioner == "ParMETIS")
+    ParMETIS::compute_partition(mesh.mpi_comm(), cell_partition, mesh_data);
+  else if (partitioner == "Zoltan_RCB")
+  {
+    ZoltanPartition::compute_partition_rcb(mesh.mpi_comm(), cell_partition,
+                                           mesh_data);
+  }
+  else if (partitioner == "Zoltan_PHG")
+  {
+    ZoltanPartition::compute_partition_phg(mesh.mpi_comm(), cell_partition,
+                                           mesh_data);
+  }
+  else
+  {
+    dolfin_error("MeshPartitioning.cpp",
+                 "compute cell partition",
+                 "Mesh partitioner '%s' is unknown.", partitioner.c_str());
+  }
+
+  return cell_partition;
+}
+//-----------------------------------------------------------------------------
+void MeshPartitioning::build(Mesh& mesh, const LocalMeshData& mesh_data,
+                             const std::vector<std::size_t>& cell_partition)
+{
+  // Distribute cells
+  Timer timer("PARALLEL 2: Distribute mesh (cells and vertices)");
+  std::vector<std::size_t> global_cell_indices;
+  boost::multi_array<std::size_t, 2> cell_vertices;
+  distribute_cells(mesh.mpi_comm(), mesh_data, cell_partition,
+                   global_cell_indices, cell_vertices);
+
+  // Distribute vertices
+  std::vector<std::size_t> vertex_indices;
+  boost::multi_array<double, 2> vertex_coordinates;
+  std::map<std::size_t, std::size_t> vertex_global_to_local;
+  distribute_vertices(mesh.mpi_comm(), mesh_data, cell_vertices, vertex_indices,
+                      vertex_global_to_local, vertex_coordinates);
+  timer.stop();
+
+  // Build mesh
+  build_mesh(mesh, global_cell_indices, cell_vertices, vertex_indices,
+             vertex_coordinates, vertex_global_to_local,
+             mesh_data.tdim, mesh_data.gdim, mesh_data.num_global_cells,
+             mesh_data.num_global_vertices);
+}
+//-----------------------------------------------------------------------------
+void  MeshPartitioning::distribute_cells(const MPI_Comm mpi_comm,
+                                         const LocalMeshData& mesh_data,
+                            const std::vector<std::size_t>& cell_partition,
+                            std::vector<std::size_t>& global_cell_indices,
+                            boost::multi_array<std::size_t, 2>& cell_vertices)
+{
+  // This function takes the partition computed by the partitioner
+  // (which tells us to which process each of the local cells stored in
+  // LocalMeshData on this process belongs. We use MPI::all_to_all to
+  // redistribute all cells (the global vertex indices of all cells).
+
+  // Number of MPI processes
+  const std::size_t num_processes = MPI::size(mpi_comm);
+
+  // Get dimensions of local mesh_data
+  const std::size_t num_local_cells = mesh_data.cell_vertices.size();
+  dolfin_assert(mesh_data.global_cell_indices.size() == num_local_cells);
+  const std::size_t num_cell_vertices = mesh_data.num_vertices_per_cell;
+  if (!mesh_data.cell_vertices.empty())
+  {
+    if (mesh_data.cell_vertices[0].size() != num_cell_vertices)
+    {
+      dolfin_error("MeshPartitioning.cpp",
+                   "distribute cells",
+                   "Mismatch in number of cell vertices (%d != %d) on process %d",
+                   mesh_data.cell_vertices[0].size(), num_cell_vertices,
+                   MPI::rank(mpi_comm));
+    }
+  }
+
+  // Build array of cell-vertex connectivity and partition vector
+  // Distribute the global cell number as well
+  std::vector<std::vector<std::size_t> > send_cell_vertices(num_processes);
+  for (std::size_t i = 0; i < num_local_cells; i++)
+  {
+    const std::size_t dest = cell_partition[i];
+    send_cell_vertices[dest].push_back(mesh_data.global_cell_indices[i]);
+    for (std::size_t j = 0; j < num_cell_vertices; j++)
+      send_cell_vertices[dest].push_back(mesh_data.cell_vertices[i][j]);
+  }
+
+  // Distribute cell-vertex connectivity
+  std::vector<std::vector<std::size_t> > received_cell_vertices(num_processes);
+  MPI::all_to_all(mpi_comm, send_cell_vertices, received_cell_vertices);
+
+  // Count number of received cells
+  std::size_t num_new_local_cells = 0;
+  for (std::size_t p = 0; p < received_cell_vertices.size(); ++p)
+  {
+    num_new_local_cells
+      += received_cell_vertices[p].size()/(num_cell_vertices + 1);
+  }
+
+  // Put mesh_data back into mesh_data.cell_vertices
+  cell_vertices.resize(boost::extents[num_new_local_cells][num_cell_vertices]);
+  global_cell_indices.resize(num_new_local_cells);
+
+  // Loop over new cells
+  std::size_t c = 0;
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    for (std::size_t i = 0; i < received_cell_vertices[p].size();
+         i += (num_cell_vertices + 1))
+    {
+      global_cell_indices[c] = received_cell_vertices[p][i];
+      for (std::size_t j = 0; j < num_cell_vertices; ++j)
+        cell_vertices[c][j] = received_cell_vertices[p][i + 1 + j];
+
+      ++c;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshPartitioning::distribute_vertices(const MPI_Comm mpi_comm,
+                    const LocalMeshData& mesh_data,
+                    const boost::multi_array<std::size_t, 2>& cell_vertices,
+                    std::vector<std::size_t>& vertex_indices,
+                    std::map<std::size_t, std::size_t>& vertex_global_to_local,
+                    boost::multi_array<double, 2>& vertex_coordinates)
+{
+  // This function distributes all vertices (coordinates and
+  // local-to-global mapping) according to the cells that are stored on
+  // each process. This happens in several stages: First each process
+  // figures out which vertices it needs (by looking at its cells)
+  // and where those vertices are located. That information is then
+  // distributed so that each process learns where it needs to send
+  // its vertices.
+
+  // Get number of processes
+  const std::size_t num_processes = MPI::size(mpi_comm);
+
+  // Get geometric dimension
+  const std::size_t gdim = mesh_data.gdim;
+
+  // Compute which vertices we need
+  std::set<std::size_t> needed_vertex_indices;
+  boost::multi_array<std::size_t, 2>::const_iterator vertices;
+  for (vertices = cell_vertices.begin(); vertices != cell_vertices.end();
+       ++vertices)
+  {
+    needed_vertex_indices.insert(vertices->begin(), vertices->end());
+  }
+
+  // Compute where (process number) the vertices we need are located
+  std::vector<std::vector<std::size_t> > send_vertex_indices(num_processes);
+  std::vector<std::vector<std::size_t> > vertex_location(num_processes);
+  std::set<std::size_t>::const_iterator required_vertex;
+  for (required_vertex = needed_vertex_indices.begin();
+       required_vertex != needed_vertex_indices.end(); ++required_vertex)
+  {
+    // Get process that has required vertex
+    const std::size_t location = MPI::index_owner(mpi_comm, *required_vertex,
+                                                mesh_data.num_global_vertices);
+    send_vertex_indices[location].push_back(*required_vertex);
+    vertex_location[location].push_back(*required_vertex);
+  }
+
+  // Send required vertices to other processes, and receive back vertices
+  // required by other processes.
+  std::vector<std::vector<std::size_t> > received_vertex_indices;
+  MPI::all_to_all(mpi_comm, send_vertex_indices, received_vertex_indices);
+
+  // Distribute vertex coordinates
+  std::vector<std::vector<double> > send_vertex_coordinates(num_processes);
+  const std::pair<std::size_t, std::size_t> local_vertex_range
+    = MPI::local_range(mpi_comm, mesh_data.num_global_vertices);
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    send_vertex_coordinates[p].reserve(received_vertex_indices[p].size()*gdim);
+    for (std::size_t i = 0; i < received_vertex_indices[p].size(); ++i)
+    {
+      dolfin_assert(received_vertex_indices[p][i] >= local_vertex_range.first
+                 && received_vertex_indices[p][i] < local_vertex_range.second);
+      const std::size_t location
+        = received_vertex_indices[p][i] - local_vertex_range.first;
+      for (std::size_t j = 0; j < gdim; ++j)
+        send_vertex_coordinates[p].push_back(mesh_data.vertex_coordinates[location][j]);
+    }
+  }
+  std::vector<std::vector<double> > received_vertex_coordinates;
+  MPI::all_to_all(mpi_comm, send_vertex_coordinates,
+                  received_vertex_coordinates);
+
+  // Set index counters to first position in receive buffers
+  std::vector<std::size_t> index_counters(num_processes, 0);
+
+  // Clear data
+  vertex_indices.clear();
+  vertex_global_to_local.clear();
+
+  // Count number of local vertices
+  std::size_t num_local_vertices = 0;
+  for (std::size_t p = 0; p < num_processes; ++p)
+    num_local_vertices += received_vertex_coordinates[p].size()/gdim;
+
+  // Store coordinates and construct global to local mapping
+  vertex_coordinates.resize(boost::extents[num_local_vertices][gdim]);
+  vertex_indices.resize(num_local_vertices);
+  std::size_t v = 0;
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    for (std::size_t i = 0; i < received_vertex_coordinates[p].size();
+         i += gdim)
+    {
+      for (std::size_t j = 0; j < gdim; ++j)
+        vertex_coordinates[v][j] = received_vertex_coordinates[p][i + j];
+
+      const std::size_t global_vertex_index
+        = vertex_location[p][index_counters[p]++];
+      vertex_global_to_local[global_vertex_index] = v;
+      vertex_indices[v] = global_vertex_index;
+
+      ++v;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshPartitioning::build_mesh(Mesh& mesh,
+              const std::vector<std::size_t>& global_cell_indices,
+              const boost::multi_array<std::size_t, 2>& cell_global_vertices,
+              const std::vector<std::size_t>& vertex_indices,
+              const boost::multi_array<double, 2>& vertex_coordinates,
+              const std::map<std::size_t, std::size_t>& vertex_global_to_local,
+              std::size_t tdim, std::size_t gdim, std::size_t num_global_cells,
+              std::size_t num_global_vertices)
+{
+  Timer timer("PARALLEL 3: Build mesh (from local mesh data)");
+
+  // Get number of processes and process number
+  const std::size_t num_processes = MPI::size(mesh.mpi_comm());
+  const std::size_t process_number = MPI::rank(mesh.mpi_comm());
+
+  // Open mesh for editing
+  mesh.clear();
+  MeshEditor editor;
+  editor.open(mesh, tdim, gdim);
+
+  // Add vertices
+  editor.init_vertices_global(vertex_coordinates.size(), num_global_vertices);
+  Point point(gdim);
+  dolfin_assert(vertex_indices.size() == vertex_coordinates.size());
+  for (std::size_t i = 0; i < vertex_coordinates.size(); ++i)
+  {
+    for (std::size_t j = 0; j < gdim; ++j)
+      point[j] = vertex_coordinates[i][j];
+    editor.add_vertex_global(i, vertex_indices[i], point);
+  }
+
+  // Add cells
+  editor.init_cells_global(cell_global_vertices.size(), num_global_cells);
+  const std::size_t num_cell_vertices = tdim + 1;
+  std::vector<std::size_t> cell(num_cell_vertices);
+  for (std::size_t i = 0; i < cell_global_vertices.size(); ++i)
+  {
+    for (std::size_t j = 0; j < num_cell_vertices; ++j)
+    {
+      // Get local cell vertex
+      std::map<std::size_t, std::size_t>::const_iterator iter
+          = vertex_global_to_local.find(cell_global_vertices[i][j]);
+      dolfin_assert(iter != vertex_global_to_local.end());
+      cell[j] = iter->second;
+    }
+    editor.add_cell(i, global_cell_indices[i], cell);
+  }
+
+  // Close mesh: Note that this must be done after creating the global
+  // vertex map or otherwise the ordering in mesh.close() will be wrong
+  // (based on local numbers).
+  editor.close();
+
+  // Construct boundary mesh
+  BoundaryMesh bmesh(mesh, "exterior");
+
+  const MeshFunction<std::size_t>& boundary_vertex_map = bmesh.entity_map(0);
+  const std::size_t boundary_size = boundary_vertex_map.size();
+
+  // Build sorted array of global boundary vertex indices (global
+  // numbering)
+  std::vector<std::size_t> global_vertex_send(boundary_size);
+  for (std::size_t i = 0; i < boundary_size; ++i)
+    global_vertex_send[i] = vertex_indices[boundary_vertex_map[i]];
+  std::sort(global_vertex_send.begin(), global_vertex_send.end());
+
+  // Receive buffer
+  std::vector<std::size_t> global_vertex_recv;
+
+  // Create shared_vertices data structure: mapping from shared vertices
+  // to list of neighboring processes
+  std::map<unsigned int, std::set<unsigned int> >& shared_vertices
+        = mesh.topology().shared_entities(0);
+  shared_vertices.clear();
+
+  // FIXME: Remove computation from inside communication loop
+
+  // Build shared vertex to sharing processes map
+  for (std::size_t i = 1; i < num_processes; ++i)
+  {
+    // We send data to process p - i (i steps to the left)
+    const int p = (process_number - i + num_processes) % num_processes;
+
+    // We receive data from process p + i (i steps to the right)
+    const int q = (process_number + i) % num_processes;
+
+    // Send and receive
+    MPI::send_recv(mesh.mpi_comm(), global_vertex_send, p,
+                   global_vertex_recv, q);
+
+    // Compute intersection of global indices
+    std::vector<std::size_t> intersection(std::min(global_vertex_send.size(),
+                                                   global_vertex_recv.size()));
+    std::vector<std::size_t>::iterator intersection_end
+      = std::set_intersection(global_vertex_send.begin(),
+                              global_vertex_send.end(),
+                              global_vertex_recv.begin(),
+                              global_vertex_recv.end(),
+                              intersection.begin());
+
+    // Fill shared vertices information
+    std::vector<std::size_t>::const_iterator global_index;
+    for (global_index = intersection.begin(); global_index != intersection_end;
+         ++global_index)
+    {
+      // Get local index
+      std::map<std::size_t, std::size_t>::const_iterator local_index;
+      local_index = vertex_global_to_local.find(*global_index);
+      dolfin_assert(local_index != vertex_global_to_local.end());
+
+      // Insert (local index, [proc])
+      shared_vertices[local_index->second].insert(q);
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshPartitioning::build_mesh_domains(Mesh& mesh,
+                                          const LocalMeshData& local_data)
+{
+  // Local domain data
+  const std::map<std::size_t,  std::vector<
+    std::pair<std::pair<std::size_t, std::size_t>, std::size_t> > >&
+    domain_data = local_data.domain_data;
+
+  if (domain_data.empty())
+    return;
+
+  // Initialse mesh domains
+  const std::size_t D = mesh.topology().dim();
+  mesh.domains().init(D);
+
+  std::map<std::size_t, std::vector<
+    std::pair<std::pair<std::size_t, std::size_t>,
+              std::size_t> > >::const_iterator dim_data;
+  for (dim_data = domain_data.begin(); dim_data != domain_data.end();
+       ++dim_data)
+  {
+    // Get mesh value collection used for marking
+    const std::size_t dim = dim_data->first;
+
+    // Initialise mesh
+    mesh.init(dim);
+
+    // Create empty MeshValueCollection
+    MeshValueCollection<std::size_t> mvc(mesh, dim);
+
+    // Get domain data
+    const std::vector<std::pair<std::pair<std::size_t, std::size_t>,
+                                std::size_t> >& local_value_data
+                                = dim_data->second;
+
+    // Build mesh value vollection
+    build_mesh_value_collection(mesh, local_value_data, mvc);
+
+    // Get data from mesh value collection
+    const std::map<std::pair<std::size_t, std::size_t>, std::size_t>& values
+      = mvc.values();
+
+    // Get map from mes domains
+    std::map<std::size_t, std::size_t>& markers = mesh.domains().markers(dim);
+
+    std::map<std::pair<std::size_t, std::size_t>,
+             std::size_t>::const_iterator it;
+    for (it = values.begin(); it != values.end(); ++it)
+    {
+      const std::size_t cell_index = it->first.first;
+      const std::size_t local_entity_index = it->first.second;
+
+      const Cell cell(mesh, cell_index);
+      const MeshEntity e(mesh, dim, cell.entities(dim)[local_entity_index]);
+      markers[e.index()] = it->second;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshPartitioning.h b/dolfin/mesh/MeshPartitioning.h
new file mode 100644
index 0000000..187e45a
--- /dev/null
+++ b/dolfin/mesh/MeshPartitioning.h
@@ -0,0 +1,299 @@
+// Copyright (C) 2008-2012 Niclas Jansson, Ola Skavhaug, Anders Logg and
+// Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2010
+// Modified by Kent-Andre Mardal, 2011
+//
+// First added:  2008-12-01
+// Last changed: 2012-12-24
+
+#ifndef __MESH_PARTITIONING_H
+#define __MESH_PARTITIONING_H
+
+#include <map>
+#include <utility>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <dolfin/log/log.h>
+#include "DistributedMeshTools.h"
+#include "LocalMeshValueCollection.h"
+#include "Mesh.h"
+
+namespace dolfin
+{
+  // Developer note: MeshFunction and MeshValueCollection cannot appear
+  // in the implementations that appear in this file of the templated
+  // functions as this leads to a circular dependency. Therefore the
+  // functions are templated over these types.
+
+  template <typename T> class MeshFunction;
+  template <typename T> class MeshValueCollection;
+  class LocalMeshData;
+
+  /// This class partitions and distributes a mesh based on
+  /// partitioned local mesh data.The local mesh data will
+  /// also be repartitioned and redistributed during the computation
+  /// of the mesh partitioning.
+  ///
+  /// After partitioning, each process has a local mesh and some data
+  /// that couples the meshes together.
+
+  class MeshPartitioning
+  {
+  public:
+
+    /// Build a partitioned mesh based from a local mesh on process 0
+    static void build_distributed_mesh(Mesh& mesh);
+
+    /// Build a partitioned mesh based from a local mesh on process 0
+    /// with supplied destination processes for each cell
+    static void
+      build_distributed_mesh(Mesh& mesh,
+                             const std::vector<std::size_t>& cell_partition);
+
+    /// Build a partitioned mesh from local mesh data that is
+    /// distributed across processes
+    static void build_distributed_mesh(Mesh& mesh, const LocalMeshData& data);
+
+    /// Build a MeshValueCollection based on LocalMeshValueCollection
+    template<typename T>
+      static void
+      build_distributed_value_collection(MeshValueCollection<T>& values,
+                                const LocalMeshValueCollection<T>& local_data,
+                                const Mesh& mesh);
+
+  private:
+
+    // Compute cell partitioning for local mesh data. Returns
+    // cell->process vector for cells in LocalMeshData
+    static std::vector<std::size_t> partition_cells(Mesh& mesh,
+                                                    const LocalMeshData& data);
+
+    // Build mesh from local mesh data with a computed partition
+    static void build(Mesh& mesh, const LocalMeshData& data,
+                      const std::vector<std::size_t>& cell_partition);
+
+    // This function takes the partition computed by the partitioner
+    // (which tells us to which process each of the local cells stored in
+    // LocalMeshData on this process belongs. We use MPI::distribute to
+    // redistribute all cells (the global vertex indices of all cells).
+    static void
+      distribute_cells(const MPI_Comm mpi_comm,
+                       const LocalMeshData& data,
+                       const std::vector<std::size_t>& cell_partition,
+                       std::vector<std::size_t>& cell_local_to_global_indices,
+                       boost::multi_array<std::size_t, 2>& cell_local_vertices);
+
+    // Distribute vertices
+    static void
+      distribute_vertices(const MPI_Comm mpi_comm,
+                          const LocalMeshData& data,
+            const boost::multi_array<std::size_t, 2>& cell_local_vertices,
+            std::vector<std::size_t>& vertex_local_to_global_indices,
+            std::map<std::size_t, std::size_t>& vertex_global_to_local_indices,
+            boost::multi_array<double, 2>& vertex_coordinates);
+
+    // Build mesh
+    static void
+      build_mesh(Mesh& mesh,
+                 const std::vector<std::size_t>& global_cell_indices,
+                 const boost::multi_array<std::size_t, 2>& cell_vertices,
+                 const std::vector<std::size_t>& vertex_indices,
+                 const boost::multi_array<double, 2>& vertex_coordinates,
+                 const std::map<std::size_t, std::size_t>& vertex_global_to_local_indices,
+                 std::size_t tdim, std::size_t gdim, std::size_t num_global_cells,
+                 std::size_t num_global_vertices);
+
+    // Create and attach distributed MeshDomains from local_data
+    static void build_mesh_domains(Mesh& mesh,
+                                   const LocalMeshData& local_data);
+
+    // Create and attach distributed MeshDomains from local_data
+    // [entry, (cell_index, local_index, value)]
+    template<typename T, typename MeshValueCollection>
+    static void build_mesh_value_collection(const Mesh& mesh,
+      const std::vector<std::pair<std::pair<std::size_t, std::size_t>, T> >& local_value_data,
+      MeshValueCollection& mesh_values);
+  };
+
+  //---------------------------------------------------------------------------
+  template<typename T>
+  void MeshPartitioning::build_distributed_value_collection(MeshValueCollection<T>& values,
+             const LocalMeshValueCollection<T>& local_data, const Mesh& mesh)
+  {
+    // Extract data
+    const std::vector<std::pair<std::pair<std::size_t, std::size_t>, T> >& local_values
+      = local_data.values();
+
+    // Build MeshValueCollection from local data
+    build_mesh_value_collection(mesh, local_values, values);
+  }
+  //---------------------------------------------------------------------------
+  template<typename T, typename MeshValueCollection>
+  void MeshPartitioning::build_mesh_value_collection(const Mesh& mesh,
+    const std::vector<std::pair<std::pair<std::size_t, std::size_t>, T> >& local_value_data,
+    MeshValueCollection& mesh_values)
+  {
+    // Get MPI communicator
+    const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+    // Get topological dimensions
+    const std::size_t D = mesh.topology().dim();
+    const std::size_t dim = mesh_values.dim();
+    mesh.init(dim);
+
+    // This is required for old-style mesh data that uses (cell index,
+    // local entity index)
+    mesh.init(dim, D);
+
+    // Clear MeshValueCollection values
+    mesh_values.clear();
+
+    // Initialise global entity numbering
+    DistributedMeshTools::number_entities(mesh, dim);
+
+    if (dim == 0)
+    {
+      // MeshPartitioning::build_mesh_value_collection needs updating
+      // for vertices
+      dolfin_not_implemented();
+    }
+
+    // Get mesh value collection used for marking
+    MeshValueCollection& markers = mesh_values;
+
+    // Get local mesh data for domains
+    const std::vector< std::pair<std::pair<std::size_t, std::size_t>, T> >&
+      ldata = local_value_data;
+
+    // Get local local-to-global map
+    if (!mesh.topology().have_global_indices(D))
+    {
+      dolfin_error("MeshPartitioning.h",
+                   "build mesh value collection",
+                   "Do not have have_global_entity_indices");
+    }
+
+    // Get global indices on local process
+    const std::vector<std::size_t> global_entity_indices
+      = mesh.topology().global_indices(D);
+
+    // Add local (to this process) data to domain marker
+    std::vector<std::size_t> off_process_global_cell_entities;
+
+    // Build and populate a local map for global_entity_indices
+    std::map<std::size_t, std::size_t> map_of_global_entity_indices;
+    for (std::size_t i = 0; i < global_entity_indices.size(); i++)
+      map_of_global_entity_indices[global_entity_indices[i]] = i;
+
+    for (std::size_t i = 0; i < ldata.size(); ++i)
+    {
+      const std::size_t global_cell_index = ldata[i].first.first;
+      std::map<std::size_t, std::size_t>::const_iterator data
+        = map_of_global_entity_indices.find(global_cell_index);
+      if (data != map_of_global_entity_indices.end())
+      {
+        const std::size_t local_cell_index = data->second;
+        const std::size_t entity_local_index = ldata[i].first.second;
+        const T value = ldata[i].second;
+        markers.set_value(local_cell_index, entity_local_index, value);
+      }
+      else
+        off_process_global_cell_entities.push_back(global_cell_index);
+    }
+
+    // Get destinations and local cell index at destination for
+    // off-process cells
+    const std::map<std::size_t, std::set<std::pair<std::size_t, std::size_t> > >
+      entity_hosts
+      = DistributedMeshTools::locate_off_process_entities(off_process_global_cell_entities,
+                                                          D, mesh);
+
+    // Number of MPI processes
+    const std::size_t num_processes = MPI::size(mpi_comm);
+
+    // Pack data to send to appropriate process
+    std::vector<std::vector<std::size_t> > send_data0(num_processes);
+    std::vector<std::vector<T> > send_data1(num_processes);
+    std::map<std::size_t, std::set<std::pair<std::size_t, std::size_t> > >::const_iterator entity_host;
+
+    {
+      // Build a convenience map in order to speedup the loop over
+      // local data
+      std::map<std::size_t, std::set<std::size_t> > map_of_ldata;
+      for (std::size_t i = 0; i < ldata.size(); ++i)
+        map_of_ldata[ldata[i].first.first].insert(i);
+
+      for (entity_host = entity_hosts.begin(); entity_host != entity_hosts.end();
+           ++entity_host)
+      {
+        const std::size_t host_global_cell_index = entity_host->first;
+        const std::set<std::pair<std::size_t, std::size_t> >& processes_data
+          = entity_host->second;
+
+        // Loop over local data
+        std::map<std::size_t, std::set<std::size_t> >::const_iterator ldata_it
+          = map_of_ldata.find(host_global_cell_index);
+        if (ldata_it != map_of_ldata.end())
+        {
+          for (std::set<std::size_t>::const_iterator it = ldata_it->second.begin();
+               it != ldata_it->second.end(); it++)
+          {
+            const std::size_t local_entity_index = ldata[*it].first.second;
+            const T domain_value = ldata[*it].second;
+
+            std::set<std::pair<std::size_t, std::size_t> >::const_iterator process_data;
+            for (process_data = processes_data.begin();
+                 process_data != processes_data.end(); ++process_data)
+            {
+              const std::size_t proc = process_data->first;
+              const std::size_t local_cell_entity = process_data->second;
+              send_data0[proc].push_back(local_cell_entity);
+              send_data0[proc].push_back(local_entity_index);
+              send_data1[proc].push_back(domain_value);
+            }
+          }
+        }
+      }
+    }
+
+    // Send/receive data
+    std::vector<std::vector<std::size_t> > received_data0;
+    std::vector<std::vector<T> > received_data1;
+    MPI::all_to_all(mpi_comm, send_data0, received_data0);
+    MPI::all_to_all(mpi_comm, send_data1, received_data1);
+
+    // Add received data to mesh domain
+    for (std::size_t p = 0; p < num_processes; ++p)
+    {
+      dolfin_assert(2*received_data1[p].size() == received_data0[p].size());
+      for (std::size_t i = 0; i < received_data1[p].size(); ++i)
+      {
+        const std::size_t local_cell_entity = received_data0[p][2*i];
+        const std::size_t local_entity_index = received_data0[p][2*i + 1];
+        const T value = received_data1[p][i];
+        dolfin_assert(local_cell_entity < mesh.num_cells());
+        markers.set_value(local_cell_entity, local_entity_index, value);
+      }
+    }
+  }
+  //---------------------------------------------------------------------------
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshQuality.cpp b/dolfin/mesh/MeshQuality.cpp
new file mode 100644
index 0000000..2e005bf
--- /dev/null
+++ b/dolfin/mesh/MeshQuality.cpp
@@ -0,0 +1,135 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-10-07
+// Last changed:
+
+#include <sstream>
+#include <dolfin/common/MPI.h>
+#include "Cell.h"
+#include "Mesh.h"
+#include "MeshFunction.h"
+#include "MeshQuality.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+dolfin::CellFunction<double>
+MeshQuality::radius_ratios(std::shared_ptr<const Mesh> mesh)
+{
+  // Create CellFunction
+  CellFunction<double> cf(mesh, 0.0);
+
+  // Compute radius ration
+  for (CellIterator cell(*mesh); !cell.end(); ++cell)
+    cf[*cell] = cell->radius_ratio();
+
+  return cf;
+}
+//-----------------------------------------------------------------------------
+std::pair<double, double> MeshQuality::radius_ratio_min_max(const Mesh& mesh)
+{
+  CellIterator cell(mesh);
+  double qmin = cell->radius_ratio();
+  double qmax = cell->radius_ratio();
+  for (; !cell.end(); ++cell)
+  {
+    qmin = std::min(qmin, cell->radius_ratio());
+    qmax = std::max(qmax, cell->radius_ratio());
+  }
+
+  qmin = MPI::min(mesh.mpi_comm(), qmin);
+  qmax = MPI::max(mesh.mpi_comm(), qmax);
+  return std::make_pair(qmin, qmax);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::vector<double>, std::vector<double> >
+MeshQuality::radius_ratio_histogram_data(const Mesh& mesh,
+                                         std::size_t num_bins)
+{
+  std::vector<double> bins(num_bins), values(num_bins, 0.0);
+  dolfin_assert(radius_ratio_min_max(mesh).second <= 1.0);
+
+  const double interval = 1.0/static_cast<double>(num_bins);
+  for (std::size_t i = 0; i < num_bins; ++i)
+    bins[i] = static_cast<double>(i)*interval + interval/2.0;
+
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    const double ratio = cell->radius_ratio();
+
+    // Compute 'bin' index, and handle special case that ratio = 1.0
+    const std::size_t slot
+      = std::min(static_cast<std::size_t>(ratio/interval), num_bins -1);
+
+    values[slot] += 1.0;
+  }
+
+  for (std::size_t i = 0; i < values.size(); ++i)
+    values[i] = MPI::sum(mesh.mpi_comm(), values[i]);
+
+  return std::make_pair(bins, values);
+}
+//-----------------------------------------------------------------------------
+std::string
+MeshQuality::radius_ratio_matplotlib_histogram(const Mesh& mesh,
+					       std::size_t num_intervals)
+{
+  // Compute data
+  std::pair<std::vector<double>, std::vector<double> >
+    data = radius_ratio_histogram_data(mesh, num_intervals);
+
+  dolfin_assert(!data.first.empty());
+  dolfin_assert(data.first.size() == data.second.size());
+
+  // Create Matplotlib string
+  std::stringstream matplotlib;
+  matplotlib << "def plot_histogram():" << std::endl;
+  std::stringstream bins, values;
+  bins   << "    bins = [" << data.first[0];
+  values << "    values = [" << data.second[0];
+  for (std::size_t i = 1; i < data.first.size(); ++i)
+  {
+    bins   << ", " << data.first[i];
+    values << ", " << data.second[i];
+  }
+  bins << "]";
+  values << "]";
+
+  matplotlib << bins.str() << std::endl;
+  matplotlib << values.str()  << std::endl;
+  matplotlib << std::endl;
+
+  matplotlib << "    pylab.xlim([0, 1])" <<  std::endl;
+  matplotlib << "    width = 0.7*(bins[1] - bins[0])" << std::endl;
+  matplotlib << "    pylab.xlabel('radius ratio')" << std::endl;
+  matplotlib << "    pylab.ylabel('number of cells')" << std::endl;
+  matplotlib << "    pylab.bar(bins, values, align='center', width=width)"
+             << std::endl;
+  matplotlib << "    pylab.show()" << std::endl;
+
+  matplotlib << std::endl;
+  matplotlib << "try:" << std::endl;
+  matplotlib << "    import pylab"  << std::endl;
+  matplotlib << "except ImportError:" << std::endl;
+  matplotlib << "    print(\"Plotting mesh quality histogram requires Matplotlib\")" << std::endl;
+  matplotlib << "else:" << std::endl;
+  matplotlib << "    plot_histogram()" << std::endl;
+
+  return matplotlib.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshQuality.h b/dolfin/mesh/MeshQuality.h
new file mode 100644
index 0000000..5351881
--- /dev/null
+++ b/dolfin/mesh/MeshQuality.h
@@ -0,0 +1,95 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-10-07
+// Last changed:
+
+#ifndef __MESH_QUALITY_H
+#define __MESH_QUALITY_H
+
+#include <string>
+#include <utility>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <memory>
+#include "Cell.h"
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// The class provides functions to quantify mesh quality
+
+  class MeshQuality
+  {
+  public:
+
+    /// Compute the radius ratio for all cells.
+    ///
+    /// *Returns*
+    ///     CellFunction<double>
+    ///         The cell radius ratio radius ratio geometric_dimension *
+    ///         * inradius / circumradius (geometric_dimension
+    ///         is normalization factor). It has range zero to one.
+    ///         Zero indicates a degenerate element.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         std::shared_ptr<Mesh> mesh(new UnitCubeMesh(4, 4, 4));
+    ///         CellFunction<double> = MeshQuality::radius_ratio(mesh);
+    static CellFunction<double>
+      radius_ratios(std::shared_ptr<const Mesh> mesh);
+
+
+    /// Compute the minimum and maximum radius ratio of cells
+    /// (across all processes)
+    ///
+    /// *Returns*
+    ///     std::pair<double, double>
+    ///         The [minimum, maximum] cell radii ratio (geometric_dimension *
+    ///         * inradius / circumradius, geometric_dimension
+    ///         is normalization factor). It has range zero to one.
+    ///         Zero indicates a degenerate element.
+    ///
+    /// *Example*
+    ///     .. note::
+    ///
+    ///         Mesh  UnitCubeMesh(4, 4, 4);
+    ///         std::pair<double, double> ratios
+    ///            = MeshQuality::radius_ratio_min_max(mesh);
+    ///         double min_ratio = ratios.first;
+    ///         double max_ratio = ratios.second;
+    static std::pair<double, double> radius_ratio_min_max(const Mesh& mesh);
+
+
+    /// Create (ratio, number of cells) data for creating a histogram
+    /// of cell quality
+    static std::pair<std::vector<double>, std::vector<double> >
+      radius_ratio_histogram_data(const Mesh& mesh,
+                                  std::size_t num_intervals = 50);
+
+    /// Create Matplotlib string to plot cell quality histogram
+    static std::string
+      radius_ratio_matplotlib_histogram(const Mesh& mesh,
+					std::size_t num_bins = 50);
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshRenumbering.cpp b/dolfin/mesh/MeshRenumbering.cpp
new file mode 100644
index 0000000..2587af4
--- /dev/null
+++ b/dolfin/mesh/MeshRenumbering.cpp
@@ -0,0 +1,267 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2010-11-27
+// Last changed: 2014-02-06
+
+#include <algorithm>
+#include <vector>
+
+#include <dolfin/log/log.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/utils.h>
+#include "Cell.h"
+#include "Mesh.h"
+#include "MeshEditor.h"
+#include "MeshTopology.h"
+#include "MeshGeometry.h"
+#include "MeshRenumbering.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+dolfin::Mesh MeshRenumbering::renumber_by_color(const Mesh& mesh,
+                                 const std::vector<std::size_t> coloring_type)
+{
+  // Start timer
+  Timer timer("Renumber mesh by color");
+
+  // Get some some mesh
+  const std::size_t tdim = mesh.topology().dim();
+  const std::size_t gdim = mesh.geometry().dim();
+  const std::size_t num_local_vertices  = mesh.size(0);
+  const std::size_t num_global_vertices = mesh.size_global(0);
+  const std::size_t num_local_cells     = mesh.size(tdim);
+  const std::size_t num_global_cells    = mesh.size_global(tdim);
+
+  // Check that requested coloring is a cell coloring
+  if (coloring_type[0] != tdim)
+  {
+    dolfin_error("MeshRenumbering.cpp",
+                 "renumber mesh by color",
+                 "Coloring is not a cell coloring: only cell colorings are supported");
+  }
+
+  // Compute renumbering
+  std::vector<double> new_coordinates;
+  std::vector<std::size_t> new_connections;
+  MeshRenumbering::compute_renumbering(mesh, coloring_type, new_coordinates,
+                                       new_connections);
+
+  // Create new mesh
+  Mesh new_mesh;
+
+  // Create mesh editor
+  MeshEditor editor;
+  editor.open(new_mesh, mesh.type().cell_type(), tdim, gdim);
+  editor.init_cells_global(num_local_cells, num_global_cells);
+  editor.init_vertices_global(num_local_vertices, num_global_vertices);
+
+  // Add vertices
+  dolfin_assert(new_coordinates.size() == num_local_vertices*gdim);
+  for (std::size_t i = 0; i < num_local_vertices; ++i)
+  {
+    std::vector<double> x(gdim);
+    for (std::size_t j = 0; j < gdim; ++j)
+      x[j] = new_coordinates[i*gdim + j];
+    editor.add_vertex(i, x);
+  }
+
+  cout << "Done adding vertices" << endl;
+
+  // Add cells
+  dolfin_assert(new_coordinates.size() == num_local_vertices*gdim);
+  const std::size_t vertices_per_cell = mesh.type().num_entities(0);
+  for (std::size_t i = 0; i < num_local_cells; ++i)
+  {
+    std::vector<std::size_t> c(vertices_per_cell);
+    std::copy(new_connections.begin() + i*vertices_per_cell,
+              new_connections.begin() + i*vertices_per_cell + vertices_per_cell,
+              c.begin());
+    editor.add_cell(i, c);
+  }
+
+  editor.close();
+
+  cout << "Close editor" << endl;
+
+  // Initialise coloring data
+  typedef std::map<std::vector<std::size_t>, std::pair<std::vector<std::size_t>,
+           std::vector<std::vector<std::size_t> > > >::const_iterator ConstMeshColoringData;
+
+  // Get old coloring
+  ConstMeshColoringData mesh_coloring
+    = mesh.topology().coloring.find(coloring_type);
+  if (mesh_coloring == mesh.topology().coloring.end())
+  {
+    dolfin_error("MeshRenumbering.cpp",
+                 "renumber mesh by color",
+                 "Requested mesh coloring has not been computed");
+  }
+
+  // Get old coloring data
+  const std::vector<std::size_t>& colors = mesh_coloring->second.first;
+  const std::vector<std::vector<std::size_t> >&
+    entities_of_color = mesh_coloring->second.second;
+  dolfin_assert(colors.size() == num_local_cells);
+  dolfin_assert(!entities_of_color.empty());
+  const std::size_t num_colors = entities_of_color.size();
+
+  // New coloring data
+  dolfin_assert(new_mesh.topology().coloring.empty());
+  std::vector<std::size_t> new_colors(colors.size());
+  std::vector<std::vector<std::size_t> > new_entities_of_color(num_colors);
+
+  std::size_t current_cell = 0;
+  for (std::size_t color = 0; color < num_colors; color++)
+  {
+    // Get the array of cell indices of current color
+    const std::vector<std::size_t>& colored_cells = entities_of_color[color];
+    std::vector<std::size_t>& new_colored_cells = new_entities_of_color[color];
+
+    // Update cell color data
+    for (std::size_t i = 0; i < colored_cells.size(); i++)
+    {
+      new_colored_cells.push_back(current_cell);
+      new_colors[current_cell] = color;
+      current_cell++;
+    }
+  }
+
+  // Set new coloring mesh data
+  std::pair<ConstMeshColoringData, bool> insert
+    = new_mesh.topology().coloring.insert(std::make_pair(coloring_type,
+                          std::make_pair(new_colors, new_entities_of_color)));
+  dolfin_assert(insert.second);
+
+  cout << "Return new mesh" << endl;
+
+  return new_mesh;
+}
+//-----------------------------------------------------------------------------
+void MeshRenumbering::compute_renumbering(const Mesh& mesh,
+                                          const std::vector<std::size_t>& coloring_type,
+                                          std::vector<double>& new_coordinates,
+                                          std::vector<std::size_t>& new_connections)
+{
+  // Get some some mesh
+  const std::size_t tdim = mesh.topology().dim();
+  const std::size_t gdim = mesh.geometry().dim();
+  const std::size_t num_vertices = mesh.num_vertices();
+  const std::size_t num_cells = mesh.num_cells();
+
+  // Resize vectors
+  const MeshConnectivity& connectivity = mesh.topology()(tdim, 0);
+  const std::size_t connections_size = connectivity.size();
+  new_connections.resize(connections_size);
+
+  const std::size_t coordinates_size = mesh.geometry().size()*mesh.geometry().dim();
+  new_coordinates.resize(coordinates_size);
+
+  typedef std::map<std::vector<std::size_t>, std::pair<std::vector<std::size_t>,
+           std::vector<std::vector<std::size_t> > > >::const_iterator MeshColoringData;
+
+  info("Renumbering mesh by cell colors.");
+  info(mesh);
+
+  // Check that requested coloring is a cell coloring
+  if (coloring_type[0] != mesh.topology().dim())
+  {
+    dolfin_error("MeshRenumbering.cpp",
+                 "compute renumbering of mesh",
+                 "Coloring is not a cell coloring: only cell colorings are supported");
+  }
+
+  // Get coloring
+  MeshColoringData mesh_coloring = mesh.topology().coloring.find(coloring_type);
+
+  // Check that requested coloring has been computed
+  if (mesh_coloring == mesh.topology().coloring.end())
+  {
+    dolfin_error("MeshRenumbering.cpp",
+                 "compute renumbering of mesh",
+                 "Requested mesh coloring has not been computed");
+  }
+
+  // Get coloring data (copies since the data will be deleted mesh.clear())
+  const std::vector<std::size_t>& colors_old = mesh_coloring->second.first;
+  const std::vector<std::vector<std::size_t> >&
+    entities_of_color_old = mesh_coloring->second.second;
+  dolfin_assert(colors_old.size() == num_cells);
+  dolfin_assert(!entities_of_color_old.empty());
+
+  // Get coordinates
+  const std::vector<double>& coordinates = mesh.geometry().coordinates;
+
+  // New vertex indices, -1 if not yet renumbered
+  std::vector<int> new_vertex_indices(num_vertices, -1);
+
+  // Iterate over colors
+  const std::size_t num_colors = entities_of_color_old.size();
+  std::size_t connections_offset = 0;
+  std::size_t current_vertex = 0;
+  for (std::size_t color = 0; color < num_colors; ++color)
+  {
+    // Get the array of cell indices of current color
+    const std::vector<std::size_t>& colored_cells = entities_of_color_old[color];
+
+    // Iterate over cells for current color
+    for (std::size_t i = 0; i < colored_cells.size(); i++)
+    {
+      // Current cell
+      Cell cell(mesh, colored_cells[i]);
+
+      // Get array of vertices for current cell
+      const unsigned int* cell_vertices = cell.entities(0);
+      const std::size_t num_cell_vertices   = cell.num_entities(0);
+
+      // Iterate over cell vertices
+      for (std::size_t j = 0; j < num_cell_vertices; j++)
+      {
+        // Get vertex index
+        const std::size_t vertex_index = cell_vertices[j];
+
+        // Renumber and copy coordinate data if vertex is not yet renumbered
+        if (new_vertex_indices[vertex_index] == -1)
+        {
+          std::copy(coordinates.begin() + vertex_index*gdim,
+                    coordinates.begin() + (vertex_index + 1)*gdim,
+                    new_coordinates.begin() + current_vertex*gdim);
+          new_vertex_indices[vertex_index] = current_vertex++;
+        }
+
+        // Renumber and copy connectivity data (must be done after vertex renumbering)
+        const std::size_t new_vertex_index = new_vertex_indices[vertex_index];
+        new_connections[connections_offset++] = new_vertex_index;
+      }
+    }
+  }
+
+  // Check that all vertices have been renumbered
+  for (std::size_t i = 0; i < new_vertex_indices.size(); i++)
+  {
+    if (new_vertex_indices[i] == -1)
+    {
+      dolfin_error("MeshRenumbering.cpp",
+                   "compute renumbering of mesh",
+                   "Some vertices were not renumbered");
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshRenumbering.h b/dolfin/mesh/MeshRenumbering.h
new file mode 100644
index 0000000..4dba3a8
--- /dev/null
+++ b/dolfin/mesh/MeshRenumbering.h
@@ -0,0 +1,68 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2010-11-27
+// Last changed: 2011-01-16
+
+#ifndef __MESH_RENUMBERING_H
+#define __MESH_RENUMBERING_H
+
+#include <vector>
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class implements renumbering algorithms for meshes.
+
+  class MeshRenumbering
+  {
+  public:
+
+    /// Renumber mesh entities by coloring. This function is currently
+    /// restricted to renumbering by cell coloring. The cells
+    /// (cell-vertex connectivity) and the coordinates of the mesh are
+    /// renumbered to improve the locality within each color. It is
+    /// assumed that the mesh has already been colored and that only
+    /// cell-vertex connectivity exists as part of the mesh.
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         Mesh to be renumbered.
+    ///     coloring (_std::vector<std::size_t>_)
+    ///         Mesh coloring type.
+    /// *Returns*
+    ///     _Mesh_
+    static Mesh renumber_by_color(const Mesh& mesh,
+                                  std::vector<std::size_t> coloring);
+
+  private:
+
+    static void compute_renumbering(const Mesh& mesh,
+                                    const std::vector<std::size_t>& coloring,
+                                    std::vector<double>& coordinates,
+                                    std::vector<std::size_t>& connectivity);
+
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshSmoothing.cpp b/dolfin/mesh/MeshSmoothing.cpp
new file mode 100644
index 0000000..5d1a6c2
--- /dev/null
+++ b/dolfin/mesh/MeshSmoothing.cpp
@@ -0,0 +1,207 @@
+// Copyright (C) 2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2010
+//
+// First added:  2008-07-16
+// Last changed: 2011-03-17
+
+#include <dolfin/ale/ALE.h>
+#include <dolfin/common/Array.h>
+#include <dolfin/common/constants.h>
+#include "Mesh.h"
+#include "BoundaryMesh.h"
+#include "Vertex.h"
+#include "Edge.h"
+#include "Facet.h"
+#include "Cell.h"
+#include "MeshData.h"
+#include "SubDomain.h"
+#include "MeshSmoothing.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void MeshSmoothing::smooth(Mesh& mesh, std::size_t num_iterations)
+{
+  log(PROGRESS, "Smoothing mesh");
+
+  // Make sure we have cell-facet connectivity
+  mesh.init(mesh.topology().dim(), mesh.topology().dim() - 1);
+
+  // Make sure we have vertex-edge connectivity
+  mesh.init(0, 1);
+
+  // Make sure the mesh is ordered
+  mesh.order();
+
+  // Mark vertices on the boundary so we may skip them
+  BoundaryMesh boundary(mesh, "exterior");
+  const MeshFunction<std::size_t> vertex_map = boundary.entity_map(0);
+  MeshFunction<bool> on_boundary(mesh, 0);
+  on_boundary = false;
+  if (boundary.num_vertices() > 0)
+  {
+    for (VertexIterator v(boundary); !v.end(); ++v)
+      on_boundary[vertex_map[*v]] = true;
+  }
+
+  // Iterate over all vertices
+  const std::size_t d = mesh.geometry().dim();
+  std::vector<double> xx(d);
+  for (std::size_t iteration = 0; iteration < num_iterations; iteration++)
+  {
+    for (VertexIterator v(mesh); !v.end(); ++v)
+    {
+      // Skip vertices on the boundary
+      if (on_boundary[*v])
+        continue;
+
+      // Get coordinates of vertex
+      double* x = mesh.geometry().x(v->index());
+      const Point p = v->point();
+
+      // Compute center of mass of neighboring vertices
+      for (std::size_t i = 0; i < d; i++) xx[i] = 0.0;
+      std::size_t num_neighbors = 0;
+      for (EdgeIterator e(*v); !e.end(); ++e)
+      {
+        // Get the other vertex
+        dolfin_assert(e->num_entities(0) == 2);
+        std::size_t other_index = e->entities(0)[0];
+        if (other_index == v->index())
+          other_index = e->entities(0)[1];
+
+        // Create the vertex
+        Vertex vn(mesh, other_index);
+
+        // Skip the vertex itself
+        if (v->index() == vn.index())
+          continue;
+        num_neighbors += 1;
+
+        // Compute center of mass
+        const double* xn = vn.x();
+        for (std::size_t i = 0; i < d; i++)
+          xx[i] += xn[i];
+      }
+      for (std::size_t i = 0; i < d; i++)
+        xx[i] /= static_cast<double>(num_neighbors);
+
+      // Compute closest distance to boundary of star
+      double rmin = 0.0;
+      for (CellIterator c(*v); !c.end(); ++c)
+      {
+        // Get local number of vertex relative to facet
+        const std::size_t local_vertex = c->index(*v);
+
+        // Get normal of corresponding facet
+        Point n = c->normal(local_vertex);
+
+        // Get first vertex in facet
+        Facet f(mesh, c->entities(mesh.topology().dim() - 1)[local_vertex]);
+        VertexIterator fv(f);
+
+        // Compute length of projection of v - fv onto normal
+        const double r = std::abs(n.dot(p - fv->point()));
+        if (rmin == 0.0)
+          rmin = r;
+        else
+          rmin = std::min(rmin, r);
+      }
+
+      // Move vertex at most a distance rmin / 2
+      double r = 0.0;
+      for (std::size_t i = 0; i < d; i++)
+      {
+        const double dx = xx[i] - x[i];
+        r += dx*dx;
+      }
+      r = std::sqrt(r);
+      if (r < DOLFIN_EPS)
+        continue;
+      rmin = std::min(0.5*rmin, r);
+      for (std::size_t i = 0; i < d; i++)
+        x[i] += rmin*(xx[i] - x[i])/r;
+    }
+  }
+
+  if (num_iterations > 1)
+    log(PROGRESS, "Mesh smoothing repeated %d times.", num_iterations);
+}
+//-----------------------------------------------------------------------------
+void MeshSmoothing::smooth_boundary(Mesh& mesh,
+                                    std::size_t num_iterations,
+                                    bool harmonic_smoothing)
+{
+  cout << "Smoothing boundary of mesh: " << mesh << endl;
+
+  // Extract boundary of mesh
+  BoundaryMesh boundary(mesh, "exterior");
+
+  // Smooth boundary
+  smooth(boundary, num_iterations);
+
+  // Move interior vertices
+  move_interior_vertices(mesh, boundary, harmonic_smoothing);
+}
+//-----------------------------------------------------------------------------
+void MeshSmoothing::snap_boundary(Mesh& mesh,
+                                  const SubDomain& sub_domain,
+                                  bool harmonic_smoothing)
+{
+  cout << "Snapping boundary of mesh: " << mesh << endl;
+
+  // Extract boundary of mesh
+  BoundaryMesh boundary(mesh, "exterior");
+
+  const std::size_t dim = mesh.geometry().dim();
+
+  // Smooth boundary
+  MeshGeometry& geometry = boundary.geometry();
+  for (std::size_t i = 0; i < boundary.num_vertices(); i++)
+  {
+    Array<double> x(dim, geometry.x(i));
+    sub_domain.snap(x);
+  }
+
+  // Move interior vertices
+  move_interior_vertices(mesh, boundary, harmonic_smoothing);
+}
+//-----------------------------------------------------------------------------
+void MeshSmoothing::move_interior_vertices(Mesh& mesh,
+                                           BoundaryMesh& boundary,
+                                           bool harmonic_smoothing)
+{
+  // Select smoothing of interior vertices
+  if (harmonic_smoothing)
+    ALE::move(mesh, boundary);
+  else
+  {
+    // Use vertex map to update boundary coordinates of original mesh
+    const MeshFunction<std::size_t>& vertex_map = boundary.entity_map(0);
+    const std::size_t d = mesh.geometry().dim();
+    for (VertexIterator v(boundary); !v.end(); ++v)
+    {
+      const double* xb = v->x();
+      double* xm = mesh.geometry().x(vertex_map[*v]);
+      for (std::size_t i = 0; i < d; i++)
+        xm[i] = xb[i];
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshSmoothing.h b/dolfin/mesh/MeshSmoothing.h
new file mode 100644
index 0000000..3355285
--- /dev/null
+++ b/dolfin/mesh/MeshSmoothing.h
@@ -0,0 +1,62 @@
+// Copyright (C) 2008-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-07-16
+// Last changed: 2010-03-02
+
+#ifndef __MESH_SMOOTHING_H
+#define __MESH_SMOOTHING_H
+
+namespace dolfin
+{
+
+  class Mesh;
+  class SubDomain;
+
+  /// This class implements various mesh smoothing algorithms.
+
+  class MeshSmoothing
+  {
+  public:
+
+    /// Smooth internal vertices of mesh by local averaging
+    static void smooth(Mesh& mesh, std::size_t num_iterations=1);
+
+    /// Smooth boundary vertices of mesh by local averaging and
+    /// (optionally) use harmonic smoothing on interior vertices
+    static void smooth_boundary(Mesh& mesh,
+                                std::size_t num_iterations=1,
+                                bool harmonic_smoothing=true);
+
+    /// Snap boundary vertices of mesh to match given sub domain and
+    /// (optionally) use harmonic smoothing on interior vertices
+    static void snap_boundary(Mesh& mesh,
+                              const SubDomain& sub_domain,
+                              bool harmonic_smoothing=true);
+
+  private:
+
+    // Move interior vertices
+    static void move_interior_vertices(Mesh& mesh,
+                                       BoundaryMesh& boundary,
+                                       bool harmonic_smoothing);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshTopology.cpp b/dolfin/mesh/MeshTopology.cpp
new file mode 100644
index 0000000..0f05288
--- /dev/null
+++ b/dolfin/mesh/MeshTopology.cpp
@@ -0,0 +1,245 @@
+// Copyright (C) 2006-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-05-08
+// Last changed: 2013-02-03
+
+#include <numeric>
+#include <sstream>
+#include <dolfin/log/log.h>
+#include <dolfin/common/utils.h>
+#include "MeshConnectivity.h"
+#include "MeshTopology.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MeshTopology::MeshTopology()
+
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+MeshTopology::MeshTopology(const MeshTopology& topology)
+  : coloring(topology.coloring), num_entities(topology.num_entities),
+    global_num_entities(topology.global_num_entities),
+    _global_indices(topology._global_indices),
+    _shared_entities(topology._shared_entities),
+    connectivity(topology.connectivity)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+MeshTopology::~MeshTopology()
+{
+  clear();
+}
+//-----------------------------------------------------------------------------
+MeshTopology& MeshTopology::operator= (const MeshTopology& topology)
+{
+  // Clear old data if any
+  clear();
+
+  // Copy data
+
+  // Public data
+  coloring = topology.coloring;
+
+  // Private data
+  num_entities = topology.num_entities;
+  global_num_entities = topology.global_num_entities;
+  _global_indices = topology._global_indices;
+  _shared_entities = topology._shared_entities;
+  connectivity = topology.connectivity;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshTopology::dim() const
+{
+  return num_entities.size() - 1;
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshTopology::size(std::size_t dim) const
+{
+  if (num_entities.size() == 0)
+    return 0;
+
+  dolfin_assert(dim < num_entities.size());
+  return num_entities[dim];
+}
+//-----------------------------------------------------------------------------
+std::size_t MeshTopology::size_global(std::size_t dim) const
+{
+  if (global_num_entities.empty())
+    return 0;
+
+  dolfin_assert(dim < global_num_entities.size());
+  return global_num_entities[dim];
+}
+//-----------------------------------------------------------------------------
+void MeshTopology::clear()
+{
+  // Clear data
+  coloring.clear();
+  num_entities.clear();
+  global_num_entities.clear();
+  _global_indices.clear();
+  _shared_entities.clear();
+  connectivity.clear();
+}
+//-----------------------------------------------------------------------------
+void MeshTopology::clear(std::size_t d0, std::size_t d1)
+{
+  dolfin_assert(d0 < connectivity.size());
+  dolfin_assert(d1 < connectivity[d0].size());
+  connectivity[d0][d1].clear();
+}
+//-----------------------------------------------------------------------------
+void MeshTopology::init(std::size_t dim)
+{
+  // Clear old data if any
+  clear();
+
+  // Initialize number of mesh entities
+  num_entities = std::vector<unsigned int>(dim + 1, 0);
+  global_num_entities = std::vector<std::size_t>(dim + 1, 0);
+
+  // Initialize storage for global indices
+  _global_indices.resize(dim + 1);
+
+  // Initialize mesh connectivity
+  connectivity.resize(dim + 1);
+  for (std::size_t d0 = 0; d0 <= dim; d0++)
+    for (std::size_t d1 = 0; d1 <= dim; d1++)
+      connectivity[d0].push_back(MeshConnectivity(d0, d1));
+}
+//-----------------------------------------------------------------------------
+void MeshTopology::init(std::size_t dim, std::size_t local_size,
+                        std::size_t global_size)
+{
+  dolfin_assert(dim < num_entities.size());
+  num_entities[dim] = local_size;
+
+  dolfin_assert(dim < global_num_entities.size());
+  global_num_entities[dim] = global_size;
+
+  // FIXME: Remove this when ghost/halo cells are supported
+  // If mesh is local, make shared vertices empty
+  if (dim == 0 && (local_size == global_size))
+    shared_entities(0);
+}
+//-----------------------------------------------------------------------------
+void MeshTopology::init_global_indices(std::size_t dim, std::size_t size)
+{
+  dolfin_assert(dim < _global_indices.size());
+  _global_indices[dim]
+    = std::vector<std::size_t>(size, std::numeric_limits<std::size_t>::max());
+}
+//-----------------------------------------------------------------------------
+dolfin::MeshConnectivity& MeshTopology::operator() (std::size_t d0,
+                                                    std::size_t d1)
+{
+  dolfin_assert(d0 < connectivity.size());
+  dolfin_assert(d1 < connectivity[d0].size());
+  return connectivity[d0][d1];
+}
+//-----------------------------------------------------------------------------
+const dolfin::MeshConnectivity& MeshTopology::operator() (std::size_t d0,
+                                                          std::size_t d1) const
+{
+  dolfin_assert(d0 < connectivity.size());
+  dolfin_assert(d1 < connectivity[d0].size());
+  return connectivity[d0][d1];
+}
+//-----------------------------------------------------------------------------
+std::map<unsigned int, std::set<unsigned int> >&
+MeshTopology::shared_entities(unsigned int dim)
+{
+  dolfin_assert(dim <= this->dim());
+  return _shared_entities[dim];
+}
+//-----------------------------------------------------------------------------
+const std::map<unsigned int, std::set<unsigned int> >&
+MeshTopology::shared_entities(unsigned int dim) const
+{
+  std::map<unsigned int, std::map<unsigned int,
+                                  std::set<unsigned int> > >::const_iterator e;
+  e = _shared_entities.find(dim);
+  if (e == _shared_entities.end())
+  {
+    dolfin_error("MeshTopology.cpp",
+                 "get shared mesh entities",
+                 "Shared mesh entities have not been computed for dim %d", dim);
+  }
+  return e->second;
+}
+//-----------------------------------------------------------------------------
+size_t MeshTopology::hash() const
+{
+  return (*this)(dim(), 0).hash();
+}
+//-----------------------------------------------------------------------------
+std::string MeshTopology::str(bool verbose) const
+{
+  const std::size_t _dim = num_entities.size() - 1;
+  std::stringstream s;
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+
+    s << "  Number of entities:" << std::endl << std::endl;
+    for (std::size_t d = 0; d <= _dim; d++)
+      s << "    dim = " << d << ": " << num_entities[d] << std::endl;
+    s << std::endl;
+
+    s << "  Connectivity matrix:" << std::endl << std::endl;
+    s << "     ";
+    for (std::size_t d1 = 0; d1 <= _dim; d1++)
+      s << " " << d1;
+    s << std::endl;
+    for (std::size_t d0 = 0; d0 <= _dim; d0++)
+    {
+      s << "    " << d0;
+      for (std::size_t d1 = 0; d1 <= _dim; d1++)
+      {
+        if (!connectivity[d0][d1].empty())
+          s << " x";
+        else
+          s << " -";
+      }
+      s << std::endl;
+    }
+    s << std::endl;
+
+    for (std::size_t d0 = 0; d0 <= _dim; d0++)
+    {
+      for (std::size_t d1 = 0; d1 <= _dim; d1++)
+      {
+        if (connectivity[d0][d1].empty())
+          continue;
+        s << indent(connectivity[d0][d1].str(true));
+        s << std::endl;
+      }
+    }
+  }
+  else
+    s << "<MeshTopology of dimension " << _dim << ">";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshTopology.h b/dolfin/mesh/MeshTopology.h
new file mode 100644
index 0000000..025a47c
--- /dev/null
+++ b/dolfin/mesh/MeshTopology.h
@@ -0,0 +1,174 @@
+// Copyright (C) 2006-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-05-08
+// Last changed: 2012-10-25
+
+#ifndef __MESH_TOPOLOGY_H
+#define __MESH_TOPOLOGY_H
+
+#include <map>
+#include <utility>
+#include <vector>
+#include "MeshConnectivity.h"
+
+namespace dolfin
+{
+
+  /// MeshTopology stores the topology of a mesh, consisting of mesh
+  /// entities and connectivity (incidence relations for the mesh
+  /// entities). Note that the mesh entities don't need to be stored,
+  /// only the number of entities and the connectivity. Any numbering
+  /// scheme for the mesh entities is stored separately in a
+  /// MeshFunction over the entities.
+  ///
+  /// A mesh entity e may be identified globally as a pair e = (dim,
+  /// i), where dim is the topological dimension and i is the index of
+  /// the entity within that topological dimension.
+
+  class MeshTopology
+  {
+  public:
+
+    /// Create empty mesh topology
+    MeshTopology();
+
+    /// Copy constructor
+    MeshTopology(const MeshTopology& topology);
+
+    /// Destructor
+    ~MeshTopology();
+
+    /// Assignment
+    MeshTopology& operator= (const MeshTopology& topology);
+
+    /// Return topological dimension
+    std::size_t dim() const;
+
+    /// Return number of entities for given dimension
+    std::size_t size(std::size_t dim) const;
+
+    /// Return global number of entities for given dimension
+    std::size_t size_global(std::size_t dim) const;
+
+    /// Clear all data
+    void clear();
+
+    /// Clear data for given pair of topological dimensions
+    void clear(std::size_t d0, std::size_t d1);
+
+    /// Initialize topology of given maximum dimension
+    void init(std::size_t dim);
+
+    /// Set number of local entities (local_size) and global entities
+    /// (global_size) for given topological dimension dim
+    void init(std::size_t dim, std::size_t local_size, std::size_t global_size);
+
+    /// Initialize storage for global entity numbering for entities of
+    /// dimension dim
+    void init_global_indices(std::size_t dim, std::size_t size);
+
+    /// Set global index for entity of dimension dim and with local
+    /// index
+    void set_global_index(std::size_t dim, std::size_t local_index,
+                          std::size_t global_index)
+    {
+      dolfin_assert(dim < _global_indices.size());
+      dolfin_assert(local_index < _global_indices[dim].size());
+      _global_indices[dim][local_index] = global_index;
+    }
+
+    /// Get local-to-global index map for entities of topological
+    /// dimension d
+    const std::vector<std::size_t>& global_indices(std::size_t d) const
+    {
+      dolfin_assert(d < _global_indices.size());
+      return _global_indices[d];
+    }
+
+    /// Check if global indices are available for entiries of
+    /// dimension dim
+    bool have_global_indices(std::size_t dim) const
+    {
+      dolfin_assert(dim < _global_indices.size());
+      return !_global_indices[dim].empty();
+    }
+
+    /// Return map from shared entities (local index) to processes
+    /// that share the entity
+    std::map<unsigned int, std::set<unsigned int> >&
+      shared_entities(unsigned int dim);
+
+    /// Return map from shared entiies (local index) to process that
+    /// share the entity (const version)
+    const std::map<unsigned int, std::set<unsigned int> >&
+      shared_entities(unsigned int dim) const;
+
+    /// Return connectivity for given pair of topological dimensions
+    dolfin::MeshConnectivity& operator() (std::size_t d0, std::size_t d1);
+
+    /// Return connectivity for given pair of topological dimensions
+    const dolfin::MeshConnectivity& operator() (std::size_t d0,
+                                                std::size_t d1) const;
+
+    /// Return hash based on the hash of cell-vertex connectivity
+    size_t hash() const;
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    /// Mesh entity colors, if computed. First vector is
+    ///
+    ///    (colored entity dim - dim1 - dim2 - ... -  colored entity dim)
+    ///
+    /// The first vector in the pair stores mesh entity colors and the
+    /// vector<vector> is a list of all mesh entity indices of the same
+    /// color, e.g. vector<vector>[col][i] is the index of the ith entity
+    /// of color 'col'.
+    // Developer note: std::vector is used in place of a MeshFunction
+    //                 to avoid circular dependencies in the header files
+    std::map<std::vector<std::size_t>,
+      std::pair<std::vector<std::size_t>,
+      std::vector<std::vector<std::size_t> > > > coloring;
+
+  private:
+
+    // Friends
+    friend class BinaryFile;
+
+    // Number of mesh entities for each topological dimension
+    std::vector<unsigned int> num_entities;
+
+    // Global number of mesh entities for each topological dimension
+    std::vector<std::size_t> global_num_entities;
+
+    // Global indices for mesh entities (empty if not set)
+    std::vector<std::vector<std::size_t> > _global_indices;
+
+    // For entities of a given dimension d , maps each shared entity
+    // (local index) to a list of the processes sharing the vertex
+    std::map<unsigned int, std::map<unsigned int, std::set<unsigned int> > >
+      _shared_entities;
+
+    // Connectivity for pairs of topological dimensions
+    std::vector<std::vector<MeshConnectivity> > connectivity;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshTransformation.cpp b/dolfin/mesh/MeshTransformation.cpp
new file mode 100644
index 0000000..02a1e1b
--- /dev/null
+++ b/dolfin/mesh/MeshTransformation.cpp
@@ -0,0 +1,186 @@
+// Copyright (C) 2012-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-01-16
+// Last changed: 2013-06-28
+
+#include <cmath>
+
+#include <dolfin/common/constants.h>
+#include <dolfin/mesh/Mesh.h>
+#include "MeshTransformation.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void MeshTransformation::translate(Mesh& mesh, const Point& point)
+{
+  // Get mesh geometry
+  MeshGeometry& geometry = mesh.geometry();
+  const std::size_t gdim = geometry.dim();
+
+  // Get displacement vector coordinates
+  const double* dx = point.coordinates();
+
+  // Displace all points
+  for (std::size_t i = 0; i < geometry.size(); i++)
+  {
+    double* x = geometry.x(i);
+    for (std::size_t j = 0; j < gdim; j++)
+      x[j] += dx[j];
+  }
+}
+//-----------------------------------------------------------------------------
+void MeshTransformation::rotate(Mesh& mesh, double angle, std::size_t axis)
+{
+  // Get mesh geometry
+  MeshGeometry& geometry = mesh.geometry();
+  const std::size_t gdim = geometry.dim();
+
+  // Reset center of mass
+  std::vector<double> c(gdim);
+  for (std::size_t j = 0; j < gdim; j++)
+    c[j] = 0.0;
+
+  // Sum all vertex coordinates
+  for (std::size_t i = 0; i < geometry.size(); i++)
+  {
+    const double* x = geometry.x(i);
+    for (std::size_t j = 0; j < gdim; j++)
+      c[j] += x[j];
+  }
+
+  // Divide by the number of vertices
+  for (std::size_t j = 0; j < gdim; j++)
+    c[j] /= static_cast<double>(geometry.size());
+
+  // Set up point
+  dolfin_assert(gdim <= 3);
+  Point p;
+  for (std::size_t j = 0; j < gdim; j++)
+    p[j] = c[j];
+
+  // Rotate around center of mass
+  rotate(mesh, angle, axis, p);
+}
+//-----------------------------------------------------------------------------
+void MeshTransformation::rotate(Mesh& mesh, double angle, std::size_t axis,
+                                const Point& p)
+{
+  // Compute angle (radians)
+  const double theta = angle/180.0*DOLFIN_PI;
+
+  // Get coordinates of point
+  const double* c = p.coordinates();
+
+  // Check dimension
+  const std::size_t gdim = mesh.geometry().dim();
+  if (gdim == 2)
+  {
+    // Check axis of rotation (must be 2)
+    if (axis != 2)
+    {
+      dolfin_error("MeshTransformation.cpp",
+                   "rotate mesh",
+                   "A 2D mesh can only be rotated around the z-axis (axis = 2)");
+    }
+
+    // Set up rotation matrix
+    const double S00 = cos(theta); const double S01 = -sin(theta);
+    const double S10 = sin(theta); const double S11 =  cos(theta);
+
+    // Rotate all points
+    MeshGeometry& geometry = mesh.geometry();
+    for (std::size_t i = 0; i < geometry.size(); i++)
+    {
+      // Get coordinate
+      double* x = geometry.x(i);
+
+      // Compute vector from rotation point
+      const double dx0 = x[0] - c[0];
+      const double dx1 = x[1] - c[1];
+
+      // Rotate
+      const double x0 = c[0] + S00*dx0 + S01*dx1;
+      const double x1 = c[1] + S10*dx0 + S11*dx1;
+
+      // Store coordinate
+      x[0] = x0;
+      x[1] = x1;
+    }
+  }
+  else if (gdim == 3)
+  {
+    // Set up 2D rotation matrix
+    const double S00 = cos(theta); const double S01 = -sin(theta);
+    const double S10 = sin(theta); const double S11 =  cos(theta);
+
+    // Initialize 3D rotation matrix to identity matrix
+    double R00 = 1.0; double R01 = 0.0; double R02 = 0.0;
+    double R10 = 0.0; double R11 = 1.0; double R12 = 0.0;
+    double R20 = 0.0; double R21 = 0.0; double R22 = 1.0;
+
+    // Set up 3D rotation matrix
+    switch (axis)
+    {
+    case 0:
+      R11 = S00; R12 = S01; R21 = S10; R22 = S11;
+      break;
+    case 1:
+      R00 = S00; R02 = S01; R20 = S10; R22 = S11;
+      break;
+    case 2:
+      R00 = S00; R01 = S01; R10 = S10; R11 = S11;
+      break;
+    default:
+      dolfin_error("MeshTransformation.cpp",
+                   "rotate mesh",
+                   "A 3D mesh can only be rotated around axis 0, 1 or 2");
+    }
+
+    // Rotate all points
+    MeshGeometry& geometry = mesh.geometry();
+    for (std::size_t i = 0; i < geometry.size(); i++)
+    {
+      // Get coordinate
+      double* x = geometry.x(i);
+
+      // Compute vector from rotation point
+      const double dx0 = x[0] - c[0];
+      const double dx1 = x[1] - c[1];
+      const double dx2 = x[2] - c[2];
+
+      // Rotate
+      const double x0 = c[0] + R00*dx0 + R01*dx1 + R02*dx2;
+      const double x1 = c[1] + R10*dx0 + R11*dx1 + R12*dx2;
+      const double x2 = c[2] + R20*dx0 + R21*dx1 + R22*dx2;
+
+      // Store coordinate
+      x[0] = x0;
+      x[1] = x1;
+      x[2] = x2;
+    }
+  }
+  else
+  {
+    dolfin_error("MeshTransformation.cpp",
+                 "rotate mesh",
+                 "Mesh rotation has not been implemented for meshes of dimension %d",
+                 gdim);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/MeshTransformation.h b/dolfin/mesh/MeshTransformation.h
new file mode 100644
index 0000000..bca69b9
--- /dev/null
+++ b/dolfin/mesh/MeshTransformation.h
@@ -0,0 +1,76 @@
+// Copyright (C) 2012-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-01-16
+// Last changed: 2013-06-27
+
+#ifndef __MESH_TRANSFORMATION_H
+#define __MESH_TRANSFORMATION_H
+
+namespace dolfin
+{
+
+   class Mesh;
+   class Point;
+
+  /// This class implements various transformations of the coordinates
+  /// of a mesh.
+
+  class MeshTransformation
+  {
+  public:
+
+    /// Translate mesh according to a given vector.
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh
+    ///     point (Point)
+    ///         The vector defining the translation.
+    static void translate(Mesh& mesh, const Point& point);
+
+    /// Rotate mesh around a coordinate axis through center of mass
+    /// of all mesh vertices
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     angle (double)
+    ///         The number of degrees (0-360) of rotation.
+    ///     axis (std::size_t)
+    ///         The coordinate axis around which to rotate the mesh.
+    static void rotate(Mesh& mesh, double angle, std::size_t axis);
+
+    /// Rotate mesh around a coordinate axis through a given point
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///     angle (double)
+    ///         The number of degrees (0-360) of rotation.
+    ///     axis (std::size_t)
+    ///         The coordinate axis around which to rotate the mesh.
+    ///     point (_Point_)
+    ///         The point around which to rotate the mesh.
+    static void rotate(Mesh& mesh, double angle, std::size_t axis,
+                       const Point& p);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/MeshValueCollection.h b/dolfin/mesh/MeshValueCollection.h
new file mode 100644
index 0000000..ad93b74
--- /dev/null
+++ b/dolfin/mesh/MeshValueCollection.h
@@ -0,0 +1,625 @@
+// Copyright (C) 2011-2013 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Chris Richardson, 2013.
+//
+// First added:  2006-08-30
+// Last changed: 2013-05-22
+
+#ifndef __MESH_VALUE_COLLECTION_H
+#define __MESH_VALUE_COLLECTION_H
+
+#include <map>
+#include <utility>
+#include <memory>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/Variable.h>
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshFunction.h"
+
+namespace dolfin
+{
+
+  /// The MeshValueCollection class can be used to store data
+  /// associated with a subset of the entities of a mesh of a given
+  /// topological dimension. It differs from the MeshFunction class in
+  /// two ways. First, data does not need to be associated with all
+  /// entities (only a subset). Second, data is associated with
+  /// entities through the corresponding cell index and local entity
+  /// number (relative to the cell), not by global entity index, which
+  /// means that data may be stored robustly to file.
+
+  template <typename T>
+  class MeshValueCollection : public Variable
+  {
+  public:
+
+    /// Create empty mesh value collection
+    ///
+    MeshValueCollection();
+
+    /// Create an empty mesh value collection on a given mesh
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    explicit MeshValueCollection(std::shared_ptr<const Mesh> mesh);
+
+    /// Create a mesh value collection from a MeshFunction
+    ///
+    /// *Arguments*
+    ///     mesh_function (_MeshFunction_ <T>)
+    ///         The mesh function for creating a MeshValueCollection.
+    explicit MeshValueCollection(const MeshFunction<T>& mesh_function);
+
+    /// Create a mesh value collection of entities of given dimension
+    /// on a given mesh
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh associated with the collection.
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension for the mesh value collection.
+    MeshValueCollection(const Mesh& mesh, std::size_t dim);
+
+    /// Create a mesh value collection of entities of given dimension
+    /// on a given mesh (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh associated with the collection.
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension for the mesh value collection.
+    MeshValueCollection(std::shared_ptr<const Mesh> mesh, std::size_t dim);
+
+    /// Create a mesh value collection from a file.
+    ///
+    /// *Arguments*
+    ///     mesh (Mesh)
+    ///         A mesh associated with the collection. The mesh is used to
+    ///         map collection values to the appropriate process.
+    ///     filename (std::string)
+    ///         The XML file name.
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension for the mesh value collection.
+    MeshValueCollection(const Mesh& mesh, const std::string filename);
+
+    /// Destructor
+    ~MeshValueCollection() {}
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     mesh_function (_MeshFunction_)
+    ///         A _MeshFunction_ object used to construct a
+    ///         MeshValueCollection.
+    MeshValueCollection<T>& operator=(const MeshFunction<T>& mesh_function);
+
+    /// Assignment operator
+    ///
+    /// *Arguments*
+    ///     mesh_value_collection (_MeshValueCollection_)
+    ///         A _MeshValueCollection_ object used to construct a
+    ///         MeshValueCollection.
+    MeshValueCollection<T>&
+      operator=(const MeshValueCollection<T>& mesh_value_collection);
+
+    /// Initialise MeshValueCollection wirth mesh and dimension
+    ///
+    /// *Arguments*
+    ///     mesh (_mesh))
+    ///         The mesh on which the value collection is defined
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension for the mesh value collection.
+    void init(const Mesh& mesh, std::size_t dim);
+
+    /// Initialise MeshValueCollection wirth mesh and dimension
+    /// (shared_ptr version)
+    ///
+    /// *Arguments*
+    ///     mesh (_mesh))
+    ///         The mesh on which the value collection is defined
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension for the mesh value collection.
+    void init(std::shared_ptr<const Mesh> mesh, std::size_t dim);
+
+    /// Set dimension. This function should not generally be used. It is
+    /// for reading MeshValueCollections as the dimension is not
+    /// generally known at construction.
+    ///
+    /// *Arguments*
+    ///     dim (std::size_t)
+    ///         The mesh entity dimension for the mesh value collection.
+    void init(std::size_t dim);
+
+    /// Return topological dimension
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The dimension.
+    std::size_t dim() const;
+
+    /// Return associated mesh
+    ///
+    /// *Returns*
+    ///     _Mesh_
+    ///         The mesh.
+    std::shared_ptr<const Mesh> mesh() const;
+
+    /// Return true if the subset is empty
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True if the subset is empty.
+    bool empty() const;
+
+    /// Return size (number of entities in subset)
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The size.
+    std::size_t size() const;
+
+    /// Set marker value for given entity defined by a cell index and
+    /// a local entity index
+    ///
+    /// *Arguments*
+    ///     cell_index (std::size_t)
+    ///         The index of the cell.
+    ///     local_entity (std::size_t)
+    ///         The local index of the entity relative to the cell.
+    ///     marker_value (T)
+    ///         The value of the marker.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True is a new value is inserted, false if overwriting
+    ///         an existing value.
+    bool set_value(std::size_t cell_index, std::size_t local_entity,
+                   const T& value);
+
+    /// Set value for given entity index
+    ///
+    /// *Arguments*
+    ///     entity_index (std::size_t)
+    ///         Index of the entity.
+    ///     value (T).
+    ///         The value of the marker.
+    ///     mesh (_Mesh_)
+    ///         The mesh.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True is a new value is inserted, false if overwriting
+    ///         an existing value.
+    bool set_value(std::size_t entity_index, const T& value);
+
+    /// Get marker value for given entity defined by a cell index and
+    /// a local entity index
+    ///
+    /// *Arguments*
+    ///     cell_index (std::size_t)
+    ///         The index of the cell.
+    ///     local_entity (std::size_t)
+    ///         The local index of the entity relative to the cell.
+    ///
+    /// *Returns*
+    ///     marker_value (T)
+    ///         The value of the marker.
+    T get_value(std::size_t cell_index, std::size_t local_entity);
+
+    /// Get all values
+    ///
+    /// *Returns*
+    ///     std::map<std::pair<std::size_t, std::size_t>, T>
+    ///         A map from positions to values.
+    std::map<std::pair<std::size_t, std::size_t>, T>& values();
+
+    /// Get all values (const version)
+    ///
+    /// *Returns*
+    ///     std::map<std::pair<std::size_t, std::size_t>, T>
+    ///         A map from positions to values.
+    const std::map<std::pair<std::size_t, std::size_t>, T>& values() const;
+
+    /// Clear all values
+    void clear();
+
+    /// Return informal string representation (pretty-print)
+    ///
+    /// *Arguments*
+    ///     verbose (bool)
+    ///         Flag to turn on additional output.
+    ///
+    /// *Returns*
+    ///     std::string
+    ///         An informal representation.
+    std::string str(bool verbose) const;
+
+  private:
+
+    // Associated mesh
+    std::shared_ptr<const Mesh> _mesh;
+
+    // Topological dimension
+    int _dim;
+
+    // The values
+    std::map<std::pair<std::size_t, std::size_t>, T> _values;
+
+  };
+
+  //---------------------------------------------------------------------------
+  // Implementation of MeshValueCollection
+  //---------------------------------------------------------------------------
+  template <typename T>
+  MeshValueCollection<T>::MeshValueCollection()
+    : Variable("m", "unnamed MeshValueCollection"), _dim(-1)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshValueCollection<T>::MeshValueCollection(std::shared_ptr<const Mesh>
+                                                mesh) : _mesh(mesh), _dim(-1)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshValueCollection<T>::MeshValueCollection(const Mesh& mesh,
+                                                std::size_t dim)
+    : Variable("m", "unnamed MeshValueCollection"),
+    _mesh(reference_to_no_delete_pointer(mesh)), _dim(dim)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshValueCollection<T>::MeshValueCollection(std::shared_ptr<const Mesh>
+                                                mesh, std::size_t dim)
+    : Variable("m", "unnamed MeshValueCollection"), _mesh(mesh), _dim(dim)
+  {
+    // Do nothing
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshValueCollection<T>::MeshValueCollection(const MeshFunction<T>&
+                                                mesh_function)
+    : Variable("m", "unnamed MeshValueCollection"), _mesh(mesh_function.mesh()),
+    _dim(mesh_function.dim())
+  {
+    dolfin_assert(_mesh);
+    const std::size_t D = _mesh->topology().dim();
+
+    // Handle cells as a special case
+    if ((int) D == _dim)
+    {
+      for (std::size_t cell_index = 0; cell_index < mesh_function.size();
+           ++cell_index)
+      {
+        const std::pair<std::size_t, std::size_t> key(cell_index, 0);
+        _values.insert(std::make_pair(key, mesh_function[cell_index]));
+      }
+    }
+    else
+    {
+      _mesh->init(_dim, D);
+      const MeshConnectivity& connectivity = _mesh->topology()(_dim, D);
+      dolfin_assert(!connectivity.empty());
+      for (std::size_t entity_index = 0; entity_index < mesh_function.size();
+           ++entity_index)
+      {
+        // Find the cell
+        dolfin_assert(connectivity.size(entity_index) > 0);
+        const MeshEntity entity(*_mesh, _dim, entity_index);
+        for (std::size_t i = 0; i < entity.num_entities(D) ; ++i)
+        {
+          // Create cell
+          const Cell cell(*_mesh, connectivity(entity_index)[i]);
+
+          // Find the local entity index
+          const std::size_t local_entity = cell.index(entity);
+
+          // Insert into map
+          const std::pair<std::size_t, std::size_t> key(cell.index(),
+                                                        local_entity);
+          _values.insert(std::make_pair(key, mesh_function[entity_index]));
+        }
+      }
+    }
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshValueCollection<T>::MeshValueCollection(const Mesh& mesh,
+                                                const std::string filename)
+    : Variable("m", "unnamed MeshValueCollection"),
+    _mesh(reference_to_no_delete_pointer(mesh)), _dim(-1)
+  {
+    File file(filename);
+    file >> *this;
+    dolfin_assert(_dim > -1);
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshValueCollection<T>&
+    MeshValueCollection<T>::operator=(const MeshFunction<T>& mesh_function)
+  {
+    _mesh = mesh_function.mesh();
+    _dim = mesh_function.dim();
+
+    dolfin_assert(_mesh);
+
+    const std::size_t D = _mesh->topology().dim();
+
+    // FIXME: Use iterators
+
+    // Handle cells as a special case
+    if ((int) D == _dim)
+    {
+      for (std::size_t cell_index = 0; cell_index < mesh_function.size();
+           ++cell_index)
+      {
+        const std::pair<std::size_t, std::size_t> key(cell_index, 0);
+        _values.insert(std::make_pair(key, mesh_function[cell_index]));
+      }
+    }
+    else
+    {
+      _mesh->init(_dim, D);
+      const MeshConnectivity& connectivity = _mesh->topology()(_dim, D);
+      dolfin_assert(!connectivity.empty());
+      for (std::size_t entity_index = 0; entity_index < mesh_function.size();
+           ++entity_index)
+      {
+        // Find the cell
+        dolfin_assert(connectivity.size(entity_index) > 0);
+        const MeshEntity entity(*_mesh, _dim, entity_index);
+        for (std::size_t i = 0; i < entity.num_entities(D) ; ++i)
+        {
+          // Create cell
+          const Cell cell(*_mesh, connectivity(entity_index)[i]);
+
+          // Find the local entity index
+          const std::size_t local_entity = cell.index(entity);
+
+          // Insert into map
+          const std::pair<std::size_t, std::size_t> key(cell.index(),
+                                                        local_entity);
+          _values.insert(std::make_pair(key, mesh_function[entity_index]));
+        }
+      }
+    }
+
+    return *this;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    MeshValueCollection<T>&
+    MeshValueCollection<T>::operator=(const MeshValueCollection<T>&
+                                      mesh_value_collection)
+  {
+    _mesh = mesh_value_collection._mesh;
+    _dim = mesh_value_collection.dim();
+    _values = mesh_value_collection.values();
+
+    return *this;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshValueCollection<T>::init(const Mesh& mesh, std::size_t dim)
+  {
+    mesh.init(dim);
+    _mesh = reference_to_no_delete_pointer(mesh);
+    _dim = dim;
+    _values.clear();
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshValueCollection<T>::init(std::shared_ptr<const Mesh> mesh,
+                                      std::size_t dim)
+  {
+    mesh->init(dim);
+    _mesh = mesh;
+    _dim = dim;
+    _values.clear();
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    void MeshValueCollection<T>::init(std::size_t dim)
+  {
+    dolfin_assert(_mesh);
+    dolfin_assert(_dim < 0);
+    _dim = dim;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    std::size_t MeshValueCollection<T>::dim() const
+  {
+    dolfin_assert(_dim >= 0);
+    return _dim;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  bool MeshValueCollection<T>::empty() const
+  {
+    return _values.empty();
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  std::size_t MeshValueCollection<T>::size() const
+  {
+    return _values.size();
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+    std::shared_ptr<const Mesh> MeshValueCollection<T>::mesh() const
+  {
+    dolfin_assert(_mesh);
+    return _mesh;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  bool MeshValueCollection<T>::set_value(std::size_t cell_index,
+                                         std::size_t local_entity,
+                                         const T& value)
+  {
+    dolfin_assert(_dim >= 0);
+    if (!_mesh)
+    {
+      dolfin_error("MeshValueCollection.h",
+                   "set value",
+                   "A mesh has not been associcated with this MeshValueCollection");
+    }
+
+    const std::pair<std::size_t, std::size_t> pos(cell_index, local_entity);
+    std::pair<typename std::map<std::pair<std::size_t, std::size_t>, T>::iterator, bool>
+      it = _values.insert(std::make_pair(pos, value));
+
+    // If an item with same key already exists the value has not been
+    // set and we need to update it
+    if (!it.second)
+      it.first->second = value;
+
+    return it.second;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  bool MeshValueCollection<T>::set_value(std::size_t entity_index,
+                                         const T& value)
+  {
+    if (!_mesh)
+    {
+      dolfin_error("MeshValueCollection.h",
+                   "set value",
+                   "A mesh has not been associcated with this MeshValueCollection");
+    }
+
+    dolfin_assert(_dim >= 0);
+
+    // Special case when d = D
+    const std::size_t D = _mesh->topology().dim();
+    if (_dim == (int) D)
+    {
+      // Set local entity index to zero when we mark a cell
+      const std::pair<std::size_t, std::size_t> pos(entity_index, 0);
+      std::pair<typename std::map<std::pair<std::size_t,
+        std::size_t>, T>::iterator, bool> it;
+      it = _values.insert(std::make_pair(pos, value));
+
+      // If an item with same key already exists the value has not been
+      // set and we need to update it
+      if (!it.second)
+        it.first->second = value;
+
+      return it.second;
+    }
+
+    // Get mesh connectivity d --> D
+    _mesh->init(_dim, D);
+    const MeshConnectivity& connectivity = _mesh->topology()(_dim, D);
+
+    // Find the cell
+    dolfin_assert(!connectivity.empty());
+    dolfin_assert(connectivity.size(entity_index) > 0);
+    const MeshEntity entity(*_mesh, _dim, entity_index);
+    const Cell cell(*_mesh, connectivity(entity_index)[0]); // choose first
+
+    // Find the local entity index
+    const std::size_t local_entity = cell.index(entity);
+
+    // Add value
+    const std::pair<std::size_t, std::size_t> pos(cell.index(), local_entity);
+    std::pair<typename std::map<std::pair<std::size_t,
+      std::size_t>, T>::iterator, bool> it;
+    it = _values.insert(std::make_pair(pos, value));
+
+    // If an item with same key already exists the value has not been
+    // set and we need to update it
+    if (!it.second)
+      it.first->second = value;
+
+    return it.second;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  T MeshValueCollection<T>::get_value(std::size_t cell_index,
+				      std::size_t local_entity)
+  {
+    dolfin_assert(_dim >= 0);
+
+    const std::pair<std::size_t, std::size_t> pos(cell_index, local_entity);
+    const typename std::map<std::pair<std::size_t,
+      std::size_t>, T>::const_iterator
+      it = _values.find(pos);
+
+    if (it == _values.end())
+    {
+      dolfin_error("MeshValueCollection.h",
+                   "extract value",
+                   "No value stored for cell index: %d and local index: %d",
+                   cell_index, local_entity);
+    }
+
+    return it->second;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  std::map<std::pair<std::size_t, std::size_t>, T>&
+    MeshValueCollection<T>::values()
+  {
+    return _values;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  const std::map<std::pair<std::size_t, std::size_t>, T>&
+    MeshValueCollection<T>::values() const
+  {
+    return _values;
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  void MeshValueCollection<T>::clear()
+  {
+    _values.clear();
+  }
+  //---------------------------------------------------------------------------
+  template <typename T>
+  std::string MeshValueCollection<T>::str(bool verbose) const
+  {
+    std::stringstream s;
+    if (verbose)
+    {
+      s << str(false) << std::endl << std::endl;
+      warning("Verbose output of MeshValueCollection must be implemented manually.");
+    }
+    else
+    {
+      s << "<MeshValueCollection of topological dimension " << dim()
+        << " containing " << size() << " values>";
+    }
+
+    return s.str();
+  }
+  //---------------------------------------------------------------------------
+
+}
+
+#endif
diff --git a/dolfin/mesh/PeriodicBoundaryComputation.cpp b/dolfin/mesh/PeriodicBoundaryComputation.cpp
new file mode 100644
index 0000000..1cc2ecc
--- /dev/null
+++ b/dolfin/mesh/PeriodicBoundaryComputation.cpp
@@ -0,0 +1,380 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-01-10
+// Last changed:
+
+#include <limits>
+#include <map>
+#include <utility>
+#include <vector>
+#include <boost/unordered_map.hpp>
+
+#include <dolfin/common/Array.h>
+#include <dolfin/log/log.h>
+#include "DistributedMeshTools.h"
+#include "Facet.h"
+#include "Mesh.h"
+#include "MeshEntityIterator.h"
+#include "SubDomain.h"
+#include "PeriodicBoundaryComputation.h"
+
+using namespace dolfin;
+
+// Comparison operator for hashing coordinates. Note that two
+// coordinates are considered equal if equal to within specified
+// tolerance.
+struct lt_coordinate
+{
+  lt_coordinate(double tolerance) : TOL(tolerance) {}
+
+  bool operator() (const std::vector<double>& x,
+                   const std::vector<double>& y) const
+  {
+    std::size_t n = std::max(x.size(), y.size());
+    for (std::size_t i = 0; i < n; ++i)
+    {
+      double xx = 0.0;
+      double yy = 0.0;
+      if (i < x.size())
+        xx = x[i];
+      if (i < y.size())
+        yy = y[i];
+
+      if (xx < (yy - TOL))
+        return true;
+      else if (xx > (yy + TOL))
+        return false;
+    }
+    return false;
+  }
+
+  // Tolerance
+  const double TOL;
+
+};
+
+//-----------------------------------------------------------------------------
+std::map<unsigned int, std::pair<unsigned int, unsigned int> >
+  PeriodicBoundaryComputation::compute_periodic_pairs(const Mesh& mesh,
+                                                      const SubDomain& sub_domain,
+                                                      const std::size_t dim)
+{
+  // MPI communication
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  // Get geometric and topological dimensions
+  const std::size_t gdim = mesh.geometry().dim();
+  const std::size_t tdim = mesh.topology().dim();
+
+  // Arrays used for mapping coordinates
+  std::vector<double> x(gdim);
+  std::vector<double> y(gdim);
+
+  // Wrap x and y (Array view of x and y)
+  Array<double> _x(gdim, x.data());
+  Array<double> _y(gdim, y.data());
+
+  std::vector<std::size_t> slave_entities;
+  std::vector<std::vector<double> > slave_mapped_coords;
+
+  // Min/max coordinates of facet midpoints [min_x, max_x]. Used to
+  // build bounding box of all master entity midpoints on this process
+  std::vector<double> x_min_max;
+
+  // Map from master entity midpoint coordinate to local facet index
+  std::map<std::vector<double>, unsigned int, lt_coordinate>
+    master_coord_to_entity_index((lt_coordinate(sub_domain.map_tolerance)));
+
+  // Intialise facet-cell connectivity
+  mesh.init(tdim - 1, tdim);
+  mesh.init(dim);
+
+  std::vector<bool> visited(mesh.num_entities(dim), false);
+  for (FacetIterator f(mesh); !f.end(); ++f)
+  {
+    // Consider boundary entities only
+    const bool global_exterior_facet = (f->num_global_entities(tdim) == 1);
+    if (global_exterior_facet)
+    {
+      for (MeshEntityIterator e(*f, dim); !e.end(); ++e)
+      {
+        // Avoid visiting entities more than once
+        if (visited[e->index()])
+          continue;
+        else
+          visited[e->index()] = true;
+
+        // Copy entity coordinate
+        const Point midpoint = e->midpoint();
+        std::copy(midpoint.coordinates(), midpoint.coordinates() + gdim,
+                  x.begin());
+
+        // Check if entity lies on a 'master' or 'slave' boundary
+        if (sub_domain.inside(_x, true))
+        {
+          // Build bounding box data for master entity midpoints
+          if (x_min_max.empty())
+          {
+            x_min_max = x;
+            x_min_max.insert(x_min_max.end(), x.begin(), x.end());
+          }
+
+          for (std::size_t i = 0; i < gdim; ++i)
+          {
+            x_min_max[i]        = std::min(x_min_max[i], x[i]);
+            x_min_max[gdim + i] = std::max(x_min_max[gdim + i], x[i]);
+          }
+
+          // Insert (midpoint coordinates, local index) into map
+          master_coord_to_entity_index.insert(std::make_pair(x, e->index()));
+        }
+        else
+        {
+          // Let's check the user is going to map all coordinates
+          for (size_t i = 0; i < y.size(); i++)
+          {
+            y[i] = std::numeric_limits<double>::quiet_NaN();
+          }
+
+          // Get mapped midpoint (y) of slave entity
+          sub_domain.map(_x, _y);
+
+          // Check for NaNs after the map
+          for (size_t i = 0; i < y.size(); i++)
+          {
+            if (std::isnan(y[i]))
+            {
+              dolfin_error("PeriodicBoundaryComputation.cpp",
+                           "periodic boundary mapping",
+                           "Need to set coordinate %d in sub_domain.map", i);
+            }
+          }
+
+          // Check if entity lies on a 'slave' boundary
+          if (sub_domain.inside(_y, true))
+          {
+            // Store slave local index and midpoint coordinates
+            slave_entities.push_back(e->index());
+            slave_mapped_coords.push_back(y);
+          }
+        }
+      }
+    }
+  }
+
+  // Communicate bounding boxes for master entities
+  std::vector<std::vector<double> > bounding_boxes;
+  MPI::all_gather(mpi_comm, x_min_max, bounding_boxes);
+
+  // Number of MPI processes
+  std::size_t num_processes = MPI::size(mpi_comm);
+
+  // Build send buffer of mapped slave midpoint coordinate to
+  // processes that may own the master entity
+  std::vector<std::vector<double> > slave_mapped_coords_send(num_processes);
+  std::vector<std::vector<unsigned int> > sent_slave_indices(num_processes);
+  for (std::size_t i = 0; i < slave_entities.size(); ++i)
+  {
+    for (std::size_t p = 0; p < num_processes; ++p)
+    {
+      // Slave mapped coordinates from process p
+      std::vector<double>& slave_mapped_coords_send_p
+        = slave_mapped_coords_send[p];
+
+      // Check if mapped slave falls within master entity bounding box
+      // on process p
+      if (in_bounding_box(slave_mapped_coords[i], bounding_boxes[p],
+                          sub_domain.map_tolerance))
+      {
+        sent_slave_indices[p].push_back(slave_entities[i]);
+        slave_mapped_coords_send_p.insert(slave_mapped_coords_send_p.end(),
+                                          slave_mapped_coords[i].begin(),
+                                          slave_mapped_coords[i].end());
+      }
+    }
+  }
+
+  // Send slave midpoints to possible owners of correspoding master
+  // entity
+  std::vector<std::vector<double> > slave_mapped_coords_recv;
+  MPI::all_to_all(mpi_comm,  slave_mapped_coords_send,
+                  slave_mapped_coords_recv);
+  dolfin_assert(slave_mapped_coords_recv.size() == num_processes);
+
+  // Check if this process owns the master facet for a received (mapped)
+  // slave
+  std::vector<double> coordinates(gdim);
+  std::vector<std::vector<unsigned int> > master_local_entity(num_processes);
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    const std::vector<double>& slave_mapped_coords_p
+      = slave_mapped_coords_recv[p];
+    for (std::size_t i = 0; i < slave_mapped_coords_p.size(); i += gdim)
+    {
+      // Unpack received mapped slave midpoint coordinate
+      std::copy(&slave_mapped_coords_p[i],
+                &slave_mapped_coords_p[i] + gdim, coordinates.begin());
+
+      // Check is this process has a master entity that is paired with
+      // a received slave entity
+      std::map<std::vector<double>, unsigned int>::const_iterator
+        it = master_coord_to_entity_index.find(coordinates);
+
+      // If this process owns the master, insert master entity index,
+      // else insert std::numeric_limits<unsigned int>::max()
+      if (it !=  master_coord_to_entity_index.end())
+        master_local_entity[p].push_back(it->second);
+      else
+        master_local_entity[p].push_back(std::numeric_limits<unsigned int>::max());
+    }
+  }
+
+  // Send local index of master entity back to owner of slave entity
+  std::vector<std::vector<unsigned int> > master_entity_local_index_recv;
+  MPI::all_to_all(mpi_comm, master_local_entity,
+                  master_entity_local_index_recv);
+
+  // Build map from slave facets on this process to master facet (local
+  // facet index, process owner)
+  std::map<unsigned int, std::pair<unsigned int, unsigned int> >
+    slave_to_master_entity;
+  std::size_t num_local_slave_entities = 0;
+  for (std::size_t p = 0; p < num_processes; ++p)
+  {
+    const std::vector<unsigned int> master_entity_index_p
+      = master_entity_local_index_recv[p];
+    const std::vector<unsigned int> sent_slaves_p = sent_slave_indices[p];
+    dolfin_assert(master_entity_index_p.size() == sent_slaves_p.size());
+
+    for (std::size_t i = 0; i < master_entity_index_p.size(); ++i)
+    {
+      if (master_entity_index_p[i] < std::numeric_limits<unsigned int>::max())
+      {
+        ++num_local_slave_entities;
+        slave_to_master_entity.insert(std::make_pair(sent_slaves_p[i],
+                                      std::make_pair(p, master_entity_index_p[i])));
+      }
+    }
+  }
+
+  return slave_to_master_entity;
+}
+//-----------------------------------------------------------------------------
+MeshFunction<std::size_t>
+PeriodicBoundaryComputation::masters_slaves(std::shared_ptr<const Mesh> mesh,
+                                            const SubDomain& sub_domain,
+                                            const std::size_t dim)
+{
+  dolfin_assert(mesh);
+
+  // Create MeshFunction and initialse to zero
+  MeshFunction<std::size_t> mf(*mesh, dim, 0);
+
+  // Compute marker
+  const std::map<unsigned int, std::pair<unsigned int, unsigned int> >
+    slaves = compute_periodic_pairs(*mesh, sub_domain, dim);
+
+  // Mark master and slaves, and pack off-process masters to send
+  std::vector<std::vector<std::size_t> >
+    master_dofs_send(MPI::size(mesh->mpi_comm()));
+  std::map<unsigned int,
+           std::pair<unsigned int, unsigned int> >::const_iterator slave;
+  for (slave = slaves.begin(); slave != slaves.end(); ++slave)
+  {
+    // Set slave
+    mf[slave->first] = 2;
+
+    // Pack master entity to send to all sharing proceses
+    dolfin_assert(slave->second.first < master_dofs_send.size());
+    master_dofs_send[slave->second.first].push_back(slave->second.second);
+  }
+
+  // Send/receive master entities
+  std::vector<std::vector<std::size_t> > master_dofs_recv;
+  MPI::all_to_all(mesh->mpi_comm(), master_dofs_send, master_dofs_recv);
+
+  // Build list of sharing processes
+  boost::unordered_map<unsigned int,
+std::vector<std::pair<unsigned int, unsigned int> > >
+    shared_entities_map = DistributedMeshTools::compute_shared_entities(*mesh, dim);
+  boost::unordered_map<unsigned int, std::vector<std::pair<unsigned int, unsigned int> > >::const_iterator e;
+  std::vector<std::vector<std::pair<unsigned int, unsigned int> > >
+    shared_entities(mesh->num_entities(dim));
+  for (e = shared_entities_map.begin(); e != shared_entities_map.end(); ++e)
+  {
+    dolfin_assert(e->first < shared_entities.size());
+    shared_entities[e->first] = e->second;
+  }
+
+  // Mark and pack master to send to all sharing proceses
+  master_dofs_send.clear();
+  master_dofs_send.resize(MPI::size(mesh->mpi_comm()));
+  for (std::size_t p = 0; p < master_dofs_recv.size(); ++p)
+  {
+    for (std::size_t i = 0; i < master_dofs_recv[p].size(); ++i)
+    {
+      // Get local index
+      const std::size_t local_index = master_dofs_recv[p][i];
+
+      // Mark locally
+      mf[local_index] = 1;
+
+      // Pack to send to sharing processes
+      const std::vector<std::pair<unsigned int, unsigned int> > sharing
+        = shared_entities[local_index] ;
+      for (std::size_t j = 0; j < sharing.size(); ++j)
+      {
+        dolfin_assert(sharing[j].first < master_dofs_send.size());
+        master_dofs_send[sharing[j].first].push_back(sharing[j].second);
+      }
+    }
+  }
+
+  // Send/receive master entities
+  MPI::all_to_all(mesh->mpi_comm(), master_dofs_send, master_dofs_recv);
+
+  // Mark master entities in mesh function
+  for (std::size_t i = 0; i < master_dofs_recv.size(); ++i)
+    for (std::size_t j = 0; j < master_dofs_recv[i].size(); ++j)
+      mf[master_dofs_recv[i][j]] = 1;
+
+  return mf;
+}
+//-----------------------------------------------------------------------------
+bool
+PeriodicBoundaryComputation::in_bounding_box(const std::vector<double>& point,
+                                       const std::vector<double>& bounding_box,
+                                       const double tol)
+{
+  // Return false if bounding box is empty
+  if (bounding_box.empty())
+    return false;
+
+  const std::size_t gdim = point.size();
+  dolfin_assert(bounding_box.size() == 2*gdim);
+  for (std::size_t i = 0; i < gdim; ++i)
+  {
+    if (!(point[i] >= (bounding_box[i] - tol)
+          && point[i] <= (bounding_box[gdim + i] + tol)))
+    {
+      return false;
+    }
+  }
+  return true;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/PeriodicBoundaryComputation.h b/dolfin/mesh/PeriodicBoundaryComputation.h
new file mode 100644
index 0000000..9ece25a
--- /dev/null
+++ b/dolfin/mesh/PeriodicBoundaryComputation.h
@@ -0,0 +1,74 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-01-10
+// Last changed:
+
+#ifndef __PERIODIC_BOUNDARY_COMPUTATION_H
+#define __PERIODIC_BOUNDARY_COMPUTATION_H
+
+#include <map>
+#include <utility>
+#include <vector>
+#include <dolfin/common/constants.h>
+#include <dolfin/mesh/MeshFunction.h>
+
+namespace dolfin
+{
+
+  class Mesh;
+  class SubDomain;
+
+  /// This class computes map from slave entity to master entity
+
+  class PeriodicBoundaryComputation
+  {
+  public:
+
+    /// For entities of dimension dim, compute map from a slave entity
+    /// on this process (local index) to its master entity (owning
+    /// process, local index on owner). If a master entity is shared
+    /// by processes, only one of the owning processes is returned.
+    static std::map<unsigned int, std::pair<unsigned int, unsigned int> >
+      compute_periodic_pairs(const Mesh& mesh, const SubDomain& sub_domain,
+                             const std::size_t dim);
+
+    /// This function returns a MeshFunction which marks mesh entities
+    /// of dimension dim according to:
+    ///
+    ///     2: slave entities
+    ///     1: master entities
+    ///     0: all other entities
+    ///
+    /// It is useful for visualising and debugging the Expression::map
+    /// function that is used to apply periodic boundary conditions.
+    static MeshFunction<std::size_t>
+      masters_slaves(std::shared_ptr<const Mesh> mesh,
+                     const SubDomain& sub_domain, const std::size_t dim);
+
+  private:
+
+    // Return true is point lies within bounding box
+    static bool in_bounding_box(const std::vector<double>& point,
+                                const std::vector<double>& bounding_box,
+                                const double tol);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/PointCell.cpp b/dolfin/mesh/PointCell.cpp
new file mode 100644
index 0000000..1091e86
--- /dev/null
+++ b/dolfin/mesh/PointCell.cpp
@@ -0,0 +1,190 @@
+// Copyright (C) 2007-2008 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2014
+// Modified by Kristoffer Sleim 2008
+// Modified by August Johansson 2014
+//
+// First added:  2007-12-12
+// Last changed: 2014-02-13
+
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "Facet.h"
+#include "MeshEditor.h"
+#include "MeshEntity.h"
+#include "Vertex.h"
+#include "PointCell.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::size_t PointCell::dim() const
+{
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t PointCell::num_entities(std::size_t dim) const
+{
+  switch (dim)
+  {
+  case 0:
+    return 1; // vertices
+  default:
+    dolfin_error("PointCell.cpp",
+                 "extract number of entities of given dimension in cell",
+                 "Illegal topological dimension %d for point", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t PointCell::num_vertices(std::size_t dim) const
+{
+  switch (dim)
+  {
+  case 0:
+    return 1; // vertices
+  default:
+    dolfin_error("PointCell.cpp",
+                 "extract number of vertices of given dimension in cell",
+                 "Illegal topological dimension %d for point", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t PointCell::orientation(const Cell& cell) const
+{
+  dolfin_error("PointCell.cpp",
+               "find orientation",
+               "Orientation not defined for point cell");
+  return 0;
+}
+//-----------------------------------------------------------------------------
+void PointCell::create_entities(std::vector<std::vector<unsigned int> >& e,
+                                std::size_t dim,
+                                const unsigned int* v) const
+{
+  dolfin_error("PointCell.cpp",
+               "create entities",
+               "Entities on a point cell are not defined");
+}
+//-----------------------------------------------------------------------------
+void PointCell::refine_cell(Cell& cell, MeshEditor& editor,
+                          std::size_t& current_cell) const
+{
+  dolfin_error("PointCell.cpp",
+               "refine cell",
+               "Refinement of a point cell is not defined");
+}
+//-----------------------------------------------------------------------------
+double PointCell::volume(const MeshEntity& triangle) const
+{
+  dolfin_error("PointCell.cpp",
+               "compute volume of cell",
+               "Volume of a point cell is not defined");
+  return 0.0;
+}
+//-----------------------------------------------------------------------------
+double PointCell::diameter(const MeshEntity& triangle) const
+{
+  dolfin_error("PointCell.cpp",
+               "find diameter of cell",
+               "Diameter of a point cell is not defined");
+  return 0.0;
+}
+//-----------------------------------------------------------------------------
+double PointCell::squared_distance(const Cell& cell, const Point& point) const
+{
+  dolfin_not_implemented();
+  return 0.0;
+}
+//-----------------------------------------------------------------------------
+double PointCell::normal(const Cell& cell, std::size_t facet, std::size_t i) const
+{
+  dolfin_error("PointCell.cpp",
+               "find component of normal vector of cell",
+               "Component %d of normal of a point cell is not defined", i);
+  return 0.0;
+}
+//-----------------------------------------------------------------------------
+Point PointCell::normal(const Cell& cell, std::size_t facet) const
+{
+  dolfin_error("PointCell.cpp",
+               "find normal vector of cell",
+               "Normal vector of a point cell is not defined");
+  Point p;
+  return p;
+}
+//-----------------------------------------------------------------------------
+Point PointCell::cell_normal(const Cell& cell) const
+{
+  dolfin_error("PointCell.cpp",
+               "compute cell normal",
+               "Normal vector of a point cell is not defined");
+  Point p;
+  return p;
+}
+//-----------------------------------------------------------------------------
+double PointCell::facet_area(const Cell& cell, std::size_t facet) const
+{
+  dolfin_error("PointCell.cpp",
+               "find facet area of cell",
+               "Facet area of a point cell is not defined");
+  return 0.0;
+}
+//-----------------------------------------------------------------------------
+void PointCell::order(Cell& cell,
+                 const std::vector<std::size_t>& local_to_global_vertex_indices) const
+{
+  dolfin_error("PointCell.cpp",
+               "order cell",
+               "Ordering of a point cell is not defined");
+}
+//-----------------------------------------------------------------------------
+bool PointCell::collides(const Cell& cell, const Point& point) const
+{
+  return CollisionDetection::collides(cell, point);
+}
+//-----------------------------------------------------------------------------
+bool PointCell::collides(const Cell& cell, const MeshEntity& entity) const
+{
+  return CollisionDetection::collides(cell, entity);
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+PointCell::triangulate_intersection(const Cell& c0, const Cell& c1) const
+{
+  return IntersectionTriangulation::triangulate_intersection(c0, c1);
+}
+//-----------------------------------------------------------------------------
+std::string PointCell::description(bool plural) const
+{
+  if (plural)
+    return "points";
+  return "points";
+}
+//-----------------------------------------------------------------------------
+std::size_t PointCell::find_edge(std::size_t i, const Cell& cell) const
+{
+  dolfin_error("PointCell.cpp",
+               "find edge",
+               "Edges are not defined for a point cell");
+  return 0;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/PointCell.h b/dolfin/mesh/PointCell.h
new file mode 100644
index 0000000..685ba95
--- /dev/null
+++ b/dolfin/mesh/PointCell.h
@@ -0,0 +1,112 @@
+// Copyright (C) 2007-2007 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2008-2013
+// Modified by Kristoffer Selim 2008
+//
+// First added:  2007-12-12
+// Last changed: 2014-01-06
+
+#ifndef __POINT_CELL_H
+#define __POINT_CELL_H
+
+#include "CellType.h"
+
+namespace dolfin
+{
+
+  /// This class implements functionality for triangular meshes.
+
+  class PointCell : public CellType
+  {
+  public:
+
+    /// Specify cell type and facet type
+    PointCell() : CellType(point, point) {}
+
+    /// Return topological dimension of cell
+    std::size_t dim() const;
+
+    /// Return number of entitites of given topological dimension
+    std::size_t num_entities(std::size_t dim) const;
+
+    /// Return number of vertices for entity of given topological dimension
+    std::size_t num_vertices(std::size_t dim) const;
+
+    /// Return orientation of the cell
+    std::size_t orientation(const Cell& cell) const;
+
+    /// Create entities e of given topological dimension from vertices v
+    void create_entities(std::vector<std::vector<unsigned int> >& e,
+                         std::size_t dim, const unsigned int* v) const;
+
+    /// Order entities locally (connectivity 1-0, 2-0, 2-1)
+    void
+      order(Cell& cell,
+            const std::vector<std::size_t>& local_to_global_vertex_indices) const;
+
+    /// Refine cell uniformly
+    void refine_cell(Cell& cell, MeshEditor& editor,
+                     std::size_t& current_cell) const;
+
+    /// Compute (generalized) volume (area) of triangle
+    double volume(const MeshEntity& triangle) const;
+
+    /// Compute diameter of triangle
+    double diameter(const MeshEntity& triangle) const;
+
+    /// Compute squared distance to given point
+    double squared_distance(const Cell& cell, const Point& point) const;
+
+    /// Compute component i of normal of given facet with respect to the cell
+    double normal(const Cell& cell, std::size_t facet, std::size_t i) const;
+
+    /// Compute of given facet with respect to the cell
+    Point normal(const Cell& cell, std::size_t facet) const;
+
+    /// Compute normal to given cell (viewed as embedded in 1D)
+    Point cell_normal(const Cell& cell) const;
+
+    /// Compute the area/length of given facet with respect to the cell
+    double facet_area(const Cell& cell, std::size_t facet) const;
+
+    /// Order entities locally
+    void order(Cell& cell) const;
+
+    /// Check whether given point is contained in cell
+    bool collides(const Cell& cell, const Point& point) const;
+
+    /// Check whether given entity collides with cell
+    bool collides(const Cell& cell, const MeshEntity& entity) const;
+    
+    /// Compute triangulation of intersection of two cells
+    virtual std::vector<double>
+    triangulate_intersection(const Cell& c0, const Cell& c1) const;
+
+    /// Return description of cell type
+    std::string description(bool plural) const;
+
+  private:
+
+    // Find local index of edge i according to ordering convention
+    std::size_t find_edge(std::size_t i, const Cell& cell) const;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/Restriction.cpp b/dolfin/mesh/Restriction.cpp
new file mode 100644
index 0000000..f6c2e6c
--- /dev/null
+++ b/dolfin/mesh/Restriction.cpp
@@ -0,0 +1,83 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-11-14
+// Last changed: 2012-11-19
+
+#include <dolfin/common/NoDeleter.h>
+#include "SubDomain.h"
+#include "Restriction.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Restriction::Restriction(const Mesh& mesh,
+                         const SubDomain& sub_domain)
+{
+  init_from_subdomain(mesh, sub_domain, mesh.topology().dim());
+}
+//-----------------------------------------------------------------------------
+Restriction::Restriction(const Mesh& mesh,
+                         const SubDomain& sub_domain, std::size_t dim)
+{
+  init_from_subdomain(mesh, sub_domain, dim);
+}
+//-----------------------------------------------------------------------------
+Restriction::Restriction(const MeshFunction<std::size_t>& domain_markers,
+                         std::size_t domain_number)
+  : _domain_markers(reference_to_no_delete_pointer(domain_markers)),
+    _domain_number(domain_number)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+Restriction::Restriction(std::shared_ptr<const MeshFunction<std::size_t> > domain_markers,
+                         std::size_t domain_number)
+  : _domain_markers(domain_markers),
+    _domain_number(domain_number)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+const Mesh& Restriction::mesh() const
+{
+  dolfin_assert(_domain_markers);
+  return *_domain_markers->mesh();
+}
+//-----------------------------------------------------------------------------
+std::size_t Restriction::dim() const
+{
+  dolfin_assert(_domain_markers);
+  return _domain_markers->dim();
+}
+//-----------------------------------------------------------------------------
+void Restriction::init_from_subdomain(const Mesh& mesh,
+                                      const SubDomain& sub_domain, std::size_t dim)
+{
+  // Create mesh function
+  MeshFunction<std::size_t>* __domain_markers = new MeshFunction<std::size_t>(mesh, dim);
+  dolfin_assert(__domain_markers);
+
+  // Set all markers to 1 and mark current domain as 0
+  __domain_markers->set_all(1);
+  sub_domain.mark(*__domain_markers, 0);
+  _domain_number = 0;
+
+  // Store shared pointer
+  _domain_markers = std::shared_ptr<const MeshFunction<std::size_t> >(__domain_markers);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/Restriction.h b/dolfin/mesh/Restriction.h
new file mode 100644
index 0000000..46cf664
--- /dev/null
+++ b/dolfin/mesh/Restriction.h
@@ -0,0 +1,118 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-11-14
+// Last changed: 2012-11-19
+
+#ifndef __RESTRICTION_H
+#define __RESTRICTION_H
+
+#include <memory>
+#include "MeshFunction.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class SubDomain;
+
+  /// This class represents a restriction of a mesh to a subdomain,
+  /// which can be defined as a subset of all the cells, the facets,
+  /// or possibly lower dimensional entities of the mesh.
+
+  class Restriction
+  {
+  public:
+
+    /// Create cell-based restriction from subdomain
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh
+    ///     sub_domain (_SubDomain_)
+    ///         Sub domain defining the restriction
+    Restriction(const Mesh& mesh, const SubDomain& sub_domain);
+
+    /// Create restriction from subdomain to entities of arbitrary dimension
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh
+    ///     sub_domain (_SubDomain_)
+    ///         Sub domain defining the restriction
+    ///     dim (std::size_t)
+    ///         Dimension of restriction
+    Restriction(const Mesh& mesh, const SubDomain& sub_domain, std::size_t dim);
+
+    /// Create restriction from domain markers
+    ///
+    /// *Arguments*
+    ///     domain_markers (_MeshFunction_ <std::size_t>)
+    ///         Domain markers for the cells of the mesh.
+    ///     domain_number (std::size_t)
+    ///         Identifier for domain.
+    Restriction(const MeshFunction<std::size_t>& domain_markers,
+                std::size_t domain_number);
+
+    /// Create restriction from domain markers (shared pointer version)
+    ///
+    /// *Arguments*
+    ///     domain_markers (_MeshFunction_ <std::size_t>)
+    ///         Domain markers for the cells of the mesh.
+    ///     domain_number (std::size_t)
+    ///         Identifier for domain.
+    Restriction(std::shared_ptr<const MeshFunction<std::size_t> > domain_markers,
+                std::size_t domain_number);
+
+    /// Return the full unrestricted mesh
+    const Mesh& mesh() const;
+
+    /// Return topological dimension of restriction
+    std::size_t dim() const;
+
+    /// Check whether restriction contains entity
+    bool contains(const MeshEntity& entity) const
+    {
+      dolfin_assert(_domain_markers);
+      return (*_domain_markers)[entity] == _domain_number;
+    }
+
+    /// Check whether restriction contains entity (d, i)
+    bool contains(std::size_t d, std::size_t i) const
+    {
+      dolfin_assert(_domain_markers);
+      dolfin_assert(d == _domain_markers->dim());
+      return (*_domain_markers)[i] == _domain_number;
+    }
+
+  private:
+
+    // Initialize domain markers from subdomain
+    void init_from_subdomain(const Mesh& mesh,
+                             const SubDomain& sub_domain, std::size_t dim);
+
+    // Domain markers
+    std::shared_ptr<const MeshFunction<std::size_t> > _domain_markers;
+
+    // Identifier for domain
+    std::size_t _domain_number;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/SubDomain.cpp b/dolfin/mesh/SubDomain.cpp
new file mode 100644
index 0000000..12c4e66
--- /dev/null
+++ b/dolfin/mesh/SubDomain.cpp
@@ -0,0 +1,327 @@
+// Copyright (C) 2007-2008 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Niclas Jansson 2009.
+//
+// First added:  2007-04-24
+// Last changed: 2011-08-31
+
+#include <dolfin/common/Array.h>
+#include <dolfin/common/RangedIndexSet.h>
+#include <dolfin/log/log.h>
+#include "Mesh.h"
+#include "MeshData.h"
+#include "MeshEntity.h"
+#include "MeshEntityIterator.h"
+#include "Vertex.h"
+#include "MeshFunction.h"
+#include "MeshValueCollection.h"
+#include "SubDomain.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+SubDomain::SubDomain(const double map_tol) : map_tolerance(map_tol),
+                                             _geometric_dimension(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+SubDomain::~SubDomain()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+bool SubDomain::inside(const Array<double>& x, bool on_boundary) const
+{
+  dolfin_error("SubDomain.cpp",
+               "check whether point is inside subdomain",
+               "Function inside() not implemented by user");
+  return false;
+}
+//-----------------------------------------------------------------------------
+void SubDomain::map(const Array<double>& x, Array<double>& y) const
+{
+  dolfin_error("SubDomain.cpp",
+               "map points within subdomain",
+               "Function map() not implemented by user. (Required for periodic boundary conditions)");
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark_cells(Mesh& mesh,
+                           std::size_t sub_domain,
+                           bool check_midpoint) const
+{
+  mark(mesh, mesh.topology().dim(), sub_domain, check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark_facets(Mesh& mesh,
+                            std::size_t sub_domain,
+                            bool check_midpoint) const
+{
+  mark(mesh, mesh.topology().dim() - 1, sub_domain, check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(Mesh& mesh,
+                     std::size_t dim,
+                     std::size_t sub_domain,
+                     bool check_midpoint) const
+{
+  //dolfin_assert(mesh.domains().markers(dim));
+  //error("Not yet updated (SubDomain::mark) ");
+  apply_markers(mesh.domains().markers(dim), dim, sub_domain, mesh, check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(MeshFunction<std::size_t>& sub_domains,
+                     std::size_t sub_domain,
+                     bool check_midpoint) const
+{
+  apply_markers(sub_domains, sub_domain, *sub_domains.mesh(), check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(MeshFunction<int>& sub_domains,
+                     int sub_domain,
+                     bool check_midpoint) const
+{
+  apply_markers(sub_domains, sub_domain, *sub_domains.mesh(), check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(MeshFunction<double>& sub_domains,
+                     double sub_domain,
+                     bool check_midpoint) const
+{
+  apply_markers(sub_domains, sub_domain, *sub_domains.mesh(), check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(MeshFunction<bool>& sub_domains,
+                     bool sub_domain,
+                     bool check_midpoint) const
+{
+  apply_markers(sub_domains, sub_domain, *sub_domains.mesh(), check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(MeshValueCollection<std::size_t>& sub_domains,
+                     std::size_t sub_domain,
+                     const Mesh& mesh,
+                     bool check_midpoint) const
+{
+  apply_markers(sub_domains, sub_domain, mesh, check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(MeshValueCollection<int>& sub_domains,
+                     int sub_domain,
+                     const Mesh& mesh,
+                     bool check_midpoint) const
+{
+  apply_markers(sub_domains, sub_domain, mesh, check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(MeshValueCollection<double>& sub_domains,
+                     double sub_domain,
+                     const Mesh& mesh,
+                     bool check_midpoint) const
+{
+  apply_markers(sub_domains, sub_domain, mesh, check_midpoint);
+}
+//-----------------------------------------------------------------------------
+void SubDomain::mark(MeshValueCollection<bool>& sub_domains,
+                     bool sub_domain,
+                     const Mesh& mesh,
+                     bool check_midpoint) const
+{
+  apply_markers(sub_domains, sub_domain, mesh, check_midpoint);
+}
+//-----------------------------------------------------------------------------
+std::size_t SubDomain::geometric_dimension() const
+{
+  // Check that dim has been set
+  if (_geometric_dimension == 0)
+  {
+    dolfin_error("SubDomain.cpp",
+                 "get geometric dimension",
+                 "Dimension of subdomain has not been specified");
+  }
+
+  return _geometric_dimension;
+}
+//-----------------------------------------------------------------------------
+template<typename S, typename T>
+void SubDomain::apply_markers(S& sub_domains,
+                              T sub_domain,
+                              const Mesh& mesh,
+                              bool check_midpoint) const
+{
+  log(TRACE, "Computing sub domain markers for sub domain %d.", sub_domain);
+
+  // Get the dimension of the entities we are marking
+  const std::size_t dim = sub_domains.dim();
+
+  // Compute facet - cell connectivity if necessary
+  const std::size_t D = mesh.topology().dim();
+  if (dim == D - 1)
+  {
+    mesh.init(D - 1);
+    mesh.init(D - 1, D);
+  }
+
+  // Set geometric dimension (needed for SWIG interface)
+  _geometric_dimension = mesh.geometry().dim();
+
+  // Speed up the computation by only checking each vertex once (or
+  // twice if it is on the boundary for some but not all facets).
+  RangedIndexSet boundary_visited(mesh.num_vertices());
+  RangedIndexSet interior_visited(mesh.num_vertices());
+  std::vector<bool> boundary_inside(mesh.num_vertices());
+  std::vector<bool> interior_inside(mesh.num_vertices());
+
+  // Always false when not marking facets
+  bool on_boundary = false;
+
+  // Compute sub domain markers
+  Progress p("Computing sub domain markers", mesh.num_entities(dim));
+  for (MeshEntityIterator entity(mesh, dim); !entity.end(); ++entity)
+  {
+    // Check if entity is on the boundary if entity is a facet
+    if (dim == D - 1)
+      on_boundary = (entity->num_global_entities(D) == 1);
+
+    // Select the visited-cache to use for this facet (or entity)
+    RangedIndexSet&    is_visited = (on_boundary ? boundary_visited : interior_visited);
+    std::vector<bool>& is_inside  = (on_boundary ? boundary_inside  : interior_inside);
+
+    // Start by assuming all points are inside
+    bool all_points_inside = true;
+
+    // Check all incident vertices if dimension is > 0 (not a vertex)
+    if (entity->dim() > 0)
+    {
+      for (VertexIterator vertex(*entity); !vertex.end(); ++vertex)
+      {
+        if (is_visited.insert(vertex->index()))
+        {
+          Array<double> x(_geometric_dimension, const_cast<double*>(vertex->x()));
+          is_inside[vertex->index()] = inside(x, on_boundary);
+        }
+
+        if (!is_inside[vertex->index()])
+        {
+          all_points_inside = false;
+          break;
+        }
+      }
+    }
+
+    // Check midpoint (works also in the case when we have a single vertex)
+    if (all_points_inside && check_midpoint)
+    {
+      Array<double> x(_geometric_dimension,
+                      const_cast<double*>(entity->midpoint().coordinates()));
+      if (!inside(x, on_boundary))
+        all_points_inside = false;
+    }
+
+    // Mark entity with all vertices inside
+    if (all_points_inside)
+      sub_domains.set_value(entity->index(), sub_domain);
+
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
+template<typename T>
+void SubDomain::apply_markers(std::map<std::size_t, std::size_t>& sub_domains,
+                              std::size_t dim,
+                              T sub_domain,
+                              const Mesh& mesh,
+                              bool check_midpoint) const
+{
+  // FIXME: This function can probably be folded into the above
+  //        function operator[] in std::map and MeshFunction.
+
+  log(TRACE, "Computing sub domain markers for sub domain %d.", sub_domain);
+
+  // Compute facet - cell connectivity if necessary
+  const std::size_t D = mesh.topology().dim();
+  if (dim == D - 1)
+  {
+    mesh.init(D - 1);
+    mesh.init(D - 1, D);
+  }
+
+  // Set geometric dimension (needed for SWIG interface)
+  _geometric_dimension = mesh.geometry().dim();
+
+  // Speed up the computation by only checking each vertex once (or
+  // twice if it is on the boundary for some but not all facets).
+  RangedIndexSet boundary_visited(mesh.num_vertices());
+  RangedIndexSet interior_visited(mesh.num_vertices());
+  std::vector<bool> boundary_inside(mesh.num_vertices());
+  std::vector<bool> interior_inside(mesh.num_vertices());
+
+  // Always false when not marking facets
+  bool on_boundary = false;
+
+  // Compute sub domain markers
+  Progress p("Computing sub domain markers", mesh.num_entities(dim));
+  for (MeshEntityIterator entity(mesh, dim); !entity.end(); ++entity)
+  {
+    // Check if entity is on the boundary if entity is a facet
+    if (dim == D - 1)
+      on_boundary = (entity->num_global_entities(D) == 1);
+
+    // Select the visited-cache to use for this facet (or entity)
+    RangedIndexSet&    is_visited = (on_boundary ? boundary_visited : interior_visited);
+    std::vector<bool>& is_inside  = (on_boundary ? boundary_inside  : interior_inside);
+
+    // Start by assuming all points are inside
+    bool all_points_inside = true;
+
+    // Check all incident vertices if dimension is > 0 (not a vertex)
+    if (entity->dim() > 0)
+    {
+      for (VertexIterator vertex(*entity); !vertex.end(); ++vertex)
+      {
+        if (is_visited.insert(vertex->index()))
+        {
+          Array<double> x(_geometric_dimension, const_cast<double*>(vertex->x()));
+          is_inside[vertex->index()] = inside(x, on_boundary);
+        }
+
+        if (!is_inside[vertex->index()])
+        {
+          all_points_inside = false;
+          break;
+        }
+      }
+    }
+
+    // Check midpoint (works also in the case when we have a single vertex)
+    if (all_points_inside && check_midpoint)
+    {
+      Array<double> x(_geometric_dimension,
+                      const_cast<double*>(entity->midpoint().coordinates()));
+      if (!inside(x, on_boundary))
+        all_points_inside = false;
+    }
+
+    // Mark entity with all vertices inside
+    if (all_points_inside)
+      sub_domains[entity->index()] =  sub_domain;
+
+    p++;
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/SubDomain.h b/dolfin/mesh/SubDomain.h
new file mode 100644
index 0000000..294387a
--- /dev/null
+++ b/dolfin/mesh/SubDomain.h
@@ -0,0 +1,288 @@
+// Copyright (C) 2007-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-04-10
+// Last changed: 2013-04-12
+
+#ifndef __SUB_DOMAIN_H
+#define __SUB_DOMAIN_H
+
+#include <cstddef>
+#include <map>
+#include <dolfin/common/constants.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  template <typename T> class MeshFunction;
+  template <typename T> class MeshValueCollection;
+  template <typename T> class Array;
+
+  /// This class defines the interface for definition of subdomains.
+  /// Alternatively, subdomains may be defined by a _Mesh_ and a
+  /// _MeshFunction_ <std::size_t> over the mesh.
+
+  class SubDomain
+  {
+  public:
+
+    /// Constructor
+    ///
+    /// *Arguments*
+    ///     map_tol (double)
+    ///         The tolerance used when identifying mapped points using
+    ///         the function SubDomain::map.
+    SubDomain(const double map_tol=1.0e-10);
+
+    /// Destructor
+    virtual ~SubDomain();
+
+    /// Return true for points inside the subdomain
+    ///
+    /// *Arguments*
+    ///     x (_Array_ <double>)
+    ///         The coordinates of the point.
+    ///     on_boundary (bool)
+    ///         True for points on the boundary.
+    ///
+    /// *Returns*
+    ///     bool
+    ///         True for points inside the subdomain.
+    virtual bool inside(const Array<double>& x, bool on_boundary) const;
+
+    /// Map coordinate x in domain H to coordinate y in domain G (used for
+    /// periodic boundary conditions)
+    ///
+    /// *Arguments*
+    ///     x (_Array_ <double>)
+    ///         The coordinates in domain H.
+    ///     y (_Array_ <double>)
+    ///         The coordinates in domain G.
+    virtual void map(const Array<double>& x, Array<double>& y) const;
+
+    /// Snap coordinate to boundary of subdomain
+    ///
+    /// *Arguments*
+    ///     x (_Array_ <double>)
+    ///         The coordinates.
+    virtual void snap(Array<double>& x) const {}
+
+    //--- Marking of Mesh ---
+
+    /// Set subdomain markers (std::size_t) on cells for given subdomain number
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to be marked.
+    ///     sub_domain (std::size_t)
+    ///         The subdomain number.
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark_cells(Mesh& mesh,
+                    std::size_t sub_domain,
+                    bool check_midpoint=true) const;
+
+    /// Set subdomain markers (std::size_t) on facets for given subdomain number
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to be marked.
+    ///     sub_domain (std::size_t)
+    ///         The subdomain number.
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark_facets(Mesh& mesh,
+                     std::size_t sub_domain,
+                     bool check_midpoint=true) const;
+
+    /// Set subdomain markers (std::size_t) for given topological dimension
+    /// and subdomain number
+    ///
+    /// *Arguments*
+    ///     mesh (_Mesh_)
+    ///         The mesh to be marked.
+    ///     dim (std::size_t)
+    ///         The topological dimension of entities to be marked.
+    ///     sub_domain (std::size_t)
+    ///         The subdomain number.
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(Mesh& mesh,
+              std::size_t dim,
+              std::size_t sub_domain,
+              bool check_midpoint=true) const;
+
+    //--- Marking of MeshFunction ---
+
+    /// Set subdomain markers (std::size_t) for given subdomain number
+    ///
+    /// *Arguments*
+    ///     sub_domains (_MeshFunction_ <std::size_t>)
+    ///         The subdomain markers.
+    ///     sub_domain (std::size_t)
+    ///         The subdomain number.
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(MeshFunction<std::size_t>& sub_domains,
+              std::size_t sub_domain,
+              bool check_midpoint=true) const;
+
+    /// Set subdomain markers (int) for given subdomain number
+    ///
+    /// *Arguments*
+    ///     sub_domains (_MeshFunction_ <int>)
+    ///         The subdomain markers.
+    ///     sub_domain (int)
+    ///         The subdomain number.
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(MeshFunction<int>& sub_domains,
+              int sub_domain,
+              bool check_midpoint=true) const;
+
+    /// Set subdomain markers (double) for given subdomain number
+    ///
+    /// *Arguments*
+    ///     sub_domains (_MeshFunction_ <double>)
+    ///         The subdomain markers.
+    ///     sub_domain (double)
+    ///         The subdomain number.
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(MeshFunction<double>& sub_domains,
+              double sub_domain,
+              bool check_midpoint=true) const;
+
+    /// Set subdomain markers (bool) for given subdomain
+    ///
+    /// *Arguments*
+    ///     sub_domains (_MeshFunction_ <bool>)
+    ///         The subdomain markers.
+    ///     sub_domain (bool)
+    ///         The subdomain number.
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(MeshFunction<bool>& sub_domains,
+              bool sub_domain,
+              bool check_midpoint=true) const;
+
+    //--- Marking of MeshValueCollection ---
+
+    /// Set subdomain markers (std::size_t) for given subdomain number
+    ///
+    /// *Arguments*
+    ///     sub_domains (_MeshValueCollection_ <std::size_t>)
+    ///         The subdomain markers.
+    ///     sub_domain (std::size_t)
+    ///         The subdomain number.
+    ///     mesn (_Mesh_)
+    ///         The mesh.
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(MeshValueCollection<std::size_t>& sub_domains,
+              std::size_t sub_domain,
+              const Mesh& mesh,
+              bool check_midpoint=true) const;
+
+    /// Set subdomain markers (int) for given subdomain number
+    ///
+    /// *Arguments*
+    ///     sub_domains (_MeshValueCollection_ <int>)
+    ///         The subdomain markers
+    ///     sub_domain (int)
+    ///         The subdomain number
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(MeshValueCollection<int>& sub_domains,
+              int sub_domain,
+              const Mesh& mesh,
+              bool check_midpoint=true) const;
+
+    /// Set subdomain markers (double) for given subdomain number
+    ///
+    /// *Arguments*
+    ///     sub_domains (_MeshValueCollection_ <double>)
+    ///         The subdomain markers.
+    ///     sub_domain (double)
+    ///         The subdomain number
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(MeshValueCollection<double>& sub_domains,
+              double sub_domain,
+              const Mesh& mesh,
+              bool check_midpoint=true) const;
+
+    /// Set subdomain markers (bool) for given subdomain
+    ///
+    /// *Arguments*
+    ///     sub_domains (_MeshValueCollection_ <bool>)
+    ///         The subdomain markers
+    ///     sub_domain (bool)
+    ///         The subdomain number
+    ///     check_midpoint (bool)
+    ///         Flag for whether midpoint of cell should be checked (default).
+    void mark(MeshValueCollection<bool>& sub_domains,
+              bool sub_domain,
+              const Mesh& mesh,
+              bool check_midpoint=true) const;
+
+    /// Return geometric dimension
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The geometric dimension.
+    std::size_t geometric_dimension() const;
+
+    /// Return tolerance uses to find matching point via mao function
+    ///
+    /// *Returns*
+    ///     double
+    ///         The tolerance.
+    const double map_tolerance;
+
+  private:
+
+    /// Apply marker of type T (most likely an std::size_t) to object of class
+    /// S (most likely MeshFunction or MeshValueCollection)
+    template<typename S, typename T>
+    void apply_markers(S& sub_domains,
+                       T sub_domain,
+                       const Mesh& mesh,
+                       bool check_midpoint) const;
+
+    template<typename T>
+      void apply_markers(std::map<std::size_t, std::size_t>& sub_domains,
+                         std::size_t dim,
+                         T sub_domain,
+                         const Mesh& mesh,
+                         bool check_midpoint) const;
+
+    // Friends
+    friend class DirichletBC;
+    friend class PeriodicBC;
+
+    // Geometric dimension, needed for SWIG interface, will be set before
+    // calls to inside() and map()
+    mutable std::size_t _geometric_dimension;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/SubMesh.cpp b/dolfin/mesh/SubMesh.cpp
new file mode 100644
index 0000000..0edd1cd
--- /dev/null
+++ b/dolfin/mesh/SubMesh.cpp
@@ -0,0 +1,320 @@
+// Copyright (C) 2009-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-02-11
+// Last changed: 2014-02-06
+
+#include <limits>
+#include <map>
+#include <vector>
+
+#include "Cell.h"
+#include "Mesh.h"
+#include "MeshEditor.h"
+#include "MeshEntityIterator.h"
+#include "MeshFunction.h"
+#include "SubDomain.h"
+#include "SubMesh.h"
+#include "Vertex.h"
+#include "MeshValueCollection.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+SubMesh::SubMesh(const Mesh& mesh, const SubDomain& sub_domain)
+{
+  // Create mesh function and mark sub domain
+  MeshFunction<std::size_t> sub_domains(mesh, mesh.topology().dim());
+  sub_domains = 0;
+  sub_domain.mark(sub_domains, 1);
+
+  // Copy data into std::vector
+  const std::vector<std::size_t> _sub_domains(sub_domains.values(),
+                                              sub_domains.values()
+                                              + sub_domains.size());
+
+  // Create sub mesh
+  init(mesh, _sub_domains, 1);
+}
+//-----------------------------------------------------------------------------
+SubMesh::SubMesh(const Mesh& mesh,
+                 const MeshFunction<std::size_t>& sub_domains,
+                 std::size_t sub_domain)
+{
+  // Copy data into std::vector
+  const std::vector<std::size_t> _sub_domains(sub_domains.values(),
+                                              sub_domains.values()
+                                              + sub_domains.size());
+
+  // Create sub mesh
+  init(mesh, _sub_domains, sub_domain);
+}
+//----------------------------------------------------------------------------
+SubMesh::SubMesh(const Mesh& mesh, std::size_t sub_domain)
+{
+  // Topological dimension
+  const std::size_t D = mesh.topology().dim();
+
+  if (mesh.domains().num_marked(D) == 0)
+  {
+    dolfin_error("SubMesh.cpp",
+                 "construct SubMesh",
+                 "Mesh does not include a MeshValueCollection the cell dimension of the mesh");
+  }
+
+  // Get cell markers
+  const std::map<std::size_t, std::size_t>& cell_markers
+    = mesh.domains().markers(D);
+
+  // Build vector for all cells to hold markers
+  std::vector<std::size_t> sub_domains(mesh.num_cells(),
+                                std::numeric_limits<std::size_t>::max());
+  std::map<std::size_t, std::size_t>::const_iterator it;
+  for (it = cell_markers.begin(); it != cell_markers.end(); ++it)
+    sub_domains[it->first] = it->second;
+
+  // Create sub mesh
+  init(mesh, sub_domains, sub_domain);
+}
+//-----------------------------------------------------------------------------
+SubMesh::~SubMesh()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void SubMesh::init(const Mesh& mesh,
+                   const std::vector<std::size_t>& sub_domains,
+                   std::size_t sub_domain)
+{
+  // Open mesh for editing
+  MeshEditor editor;
+  const std::size_t D = mesh.topology().dim();
+  editor.open(*this, mesh.type().cell_type(), D,
+              mesh.geometry().dim());
+
+  // Build set of cells that are in sub-mesh
+  std::vector<bool> parent_cell_in_subdomain(mesh.num_cells(), false);
+  std::set<std::size_t> submesh_cells;
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    if (sub_domains[cell->index()] == sub_domain)
+    {
+      parent_cell_in_subdomain[cell->index()] = true;
+      submesh_cells.insert(cell->index());
+    }
+  }
+
+  // Map from parent vertex index to submesh vertex index
+  std::map<std::size_t, std::size_t> parent_to_submesh_vertex_indices;
+
+  // Map from submesh cell to parent cell
+  std::vector<std::size_t> submesh_cell_parent_indices;
+  submesh_cell_parent_indices.reserve(submesh_cells.size());
+
+  // Vector from parent cell index to submesh cell index
+  std::vector<std::size_t> parent_to_submesh_cell_indices(mesh.num_cells(), 0);
+
+  // Add sub-mesh cells
+  editor.init_cells_global(submesh_cells.size(), submesh_cells.size());
+  std::size_t current_cell = 0;
+  std::size_t current_vertex = 0;
+  for (std::set<std::size_t>::iterator cell_it = submesh_cells.begin();
+       cell_it != submesh_cells.end(); ++cell_it)
+  {
+    // Data structure to hold new vertex indices for cell
+    std::vector<std::size_t> cell_vertices;
+
+    // Create cell
+    Cell cell(mesh, *cell_it);
+
+    // Iterate over cell vertices
+    for (VertexIterator vertex(cell); !vertex.end(); ++vertex)
+    {
+      const std::size_t parent_vertex_index = vertex->index();
+
+      // Look for parent vertex in map
+      std::map<std::size_t, std::size_t>::iterator vertex_it
+        = parent_to_submesh_vertex_indices.find(parent_vertex_index);
+
+      // If vertex has been inserted, get new index, otherwise
+      // increment and insert
+      std::size_t submesh_vertex_index = 0;
+      if (vertex_it != parent_to_submesh_vertex_indices.end())
+        submesh_vertex_index = vertex_it->second;
+      else
+      {
+        submesh_vertex_index = current_vertex++;
+        parent_to_submesh_vertex_indices[parent_vertex_index]
+          = submesh_vertex_index;
+      }
+
+      // Add vertex to list of cell vertices (new indexing)
+      cell_vertices.push_back(submesh_vertex_index);
+    }
+
+    // Add parent cell index to list
+    submesh_cell_parent_indices.push_back(cell.index());
+
+    // Store parent cell -> submesh cell indices
+    parent_to_submesh_cell_indices[cell.index()] = current_cell;
+
+    // Add cell to mesh
+    editor.add_cell(current_cell++, cell_vertices);
+  }
+
+  // Vector to hold submesh vertex -> parent vertex
+  std::vector<std::size_t> parent_vertex_indices;
+  parent_vertex_indices.resize(parent_to_submesh_vertex_indices.size());
+
+  // Initialise mesh editor
+  editor.init_vertices_global(parent_to_submesh_vertex_indices.size(),
+                              parent_to_submesh_vertex_indices.size());
+
+  // Add vertices
+  for (std::map<std::size_t, std::size_t>::iterator it
+         = parent_to_submesh_vertex_indices.begin();
+       it != parent_to_submesh_vertex_indices.end(); ++it)
+  {
+    Vertex vertex(mesh, it->first);
+    if (MPI::size(mesh.mpi_comm()) > 1)
+      error("SubMesh::init not working in parallel");
+
+    // FIXME: Get global vertex index
+    editor.add_vertex(it->second, vertex.point());
+    parent_vertex_indices[it->second] = it->first;
+  }
+
+  // Close editor
+  editor.close();
+
+  // Build submesh-to-parent map for vertices
+  std::vector<std::size_t>& parent_vertex_indices_mf
+    = data().create_array("parent_vertex_indices", 0);
+  parent_vertex_indices_mf.resize(num_vertices());
+  for (std::map<std::size_t, std::size_t>::iterator it
+         = parent_to_submesh_vertex_indices.begin();
+       it != parent_to_submesh_vertex_indices.end(); ++it)
+  {
+    parent_vertex_indices_mf[it->second] = it->first;
+  }
+
+  // Build submesh-to-parent map for cells
+  std::vector<std::size_t>& parent_cell_indices
+    = data().create_array("parent_cell_indices", D);
+  parent_cell_indices.resize(num_cells());
+  current_cell = 0;
+  for (std::vector<std::size_t>::iterator it
+         = submesh_cell_parent_indices.begin();
+       it != submesh_cell_parent_indices.end(); ++it)
+  {
+    parent_cell_indices[current_cell++] = *it;
+  }
+
+  // Initialise present MeshDomain
+  const MeshDomains& parent_domains = mesh.domains();
+  this->domains().init(parent_domains.max_dim());
+
+  // Collect MeshValueCollections from parent mesh
+  for (std::size_t dim_t = 0; dim_t <= parent_domains.max_dim(); dim_t++)
+  {
+    // If parent mesh does not has a data for dim_t
+    if (parent_domains.num_marked(dim_t) == 0)
+      continue;
+
+    // Initialise connectivity
+    mesh.init(dim_t, D);
+
+    // FIXME: Can avoid building this map for cell and vertices
+
+    // Build map from submesh entity (parent vertex list) -> (submesh index)
+    mesh.init(dim_t);
+    std::map<std::vector<std::size_t>, std::size_t> entity_map;
+    for (MeshEntityIterator e(*this, dim_t); !e.end(); ++e)
+    {
+      // Build list of entity vertex indices and sort
+      std::vector<std::size_t> vertex_list;
+      for (VertexIterator v(*e); !v.end(); ++v)
+        vertex_list.push_back(parent_vertex_indices[v->index()]);
+      std::sort(vertex_list.begin(), vertex_list.end());
+      entity_map.insert(std::make_pair(vertex_list, e->index()));
+    }
+
+    // Get submesh marker map
+    std::map<std::size_t, std::size_t>& submesh_markers
+      = this->domains().markers(dim_t);
+
+    // Get values map from parent MeshValueCollection
+    const std::map<std::size_t, std::size_t>& parent_markers
+      = parent_domains.markers(dim_t);
+
+    // Iterate over all parents marker values
+    std::map<std::size_t, std::size_t>::const_iterator itt;
+    for (itt = parent_markers.begin(); itt != parent_markers.end(); itt++)
+    {
+      // Create parent entity
+      const MeshEntity parent_entity(mesh, dim_t, itt->first);
+
+      // FIXME: Need to check all attached cells
+      std::size_t parent_cell_index = std::numeric_limits<std::size_t>::max();
+      if (dim_t == D)
+      {
+        parent_cell_index = itt->first;
+      }
+      else
+      {
+        // Get first parent cell index attached to parent entity
+        for (std::size_t i = 0; i < parent_entity.num_entities(D); ++i)
+        {
+          if (sub_domains[parent_entity.entities(D)[i]] == sub_domain)
+          {
+            parent_cell_index = parent_entity.entities(D)[i];
+            break;
+          }
+        }
+      }
+
+      // Check if the cell is included in the submesh
+      if (sub_domains[parent_cell_index] == sub_domain)
+      {
+        // Map markers from parent mesh to submesh
+	if (dim_t == D)
+        {
+          // Get submesh cell index
+          const std::size_t submesh_cell_index
+            = parent_to_submesh_cell_indices[parent_cell_index];
+	  submesh_markers[submesh_cell_index] = itt->second;
+        }
+	else
+	{
+          std::vector<std::size_t> parent_vertex_list;
+          for (VertexIterator v(parent_entity); !v.end(); ++v)
+            parent_vertex_list.push_back(v->index());
+          std::sort(parent_vertex_list.begin(), parent_vertex_list.end());
+
+          // Get submesh entity index
+          std::map<std::vector<std::size_t>, std::size_t>::const_iterator
+            submesh_it = entity_map.find(parent_vertex_list);
+          dolfin_assert(submesh_it != entity_map.end());
+
+          submesh_markers[submesh_it->second] = itt->second;
+	}
+      }
+    }
+  }
+
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/SubMesh.h b/dolfin/mesh/SubMesh.h
new file mode 100644
index 0000000..c039918
--- /dev/null
+++ b/dolfin/mesh/SubMesh.h
@@ -0,0 +1,67 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-02-11
+// Last changed: 2013-02-11
+
+#ifndef __SUB_MESH_H
+#define __SUB_MESH_H
+
+#include <map>
+#include "Mesh.h"
+
+namespace dolfin
+{
+
+  class SubDomain;
+  template <typename T> class MeshFunction;
+
+  /// A SubMesh is a mesh defined as a subset of a given mesh. It
+  /// provides a convenient way to create matching meshes for
+  /// multiphysics applications by creating meshes for subdomains as
+  /// subsets of a single global mesh. A mapping from the vertices of
+  /// the sub mesh to the vertices of the parent mesh is stored as the
+  /// mesh data named "parent_vertex_indices".
+
+  class SubMesh : public Mesh
+  {
+  public:
+
+    /// Create subset of given mesh marked by sub domain
+    SubMesh(const Mesh& mesh, const SubDomain& sub_domain);
+
+    /// Create subset of given mesh marked by mesh function
+    SubMesh(const Mesh& mesh, const MeshFunction<std::size_t>& sub_domains,
+            std::size_t sub_domain);
+
+    /// Create subset of given mesh from stored MeshValueCollection
+    SubMesh(const Mesh& mesh, std::size_t sub_domain);
+
+    /// Destructor
+    ~SubMesh();
+
+  private:
+
+    /// Create sub mesh
+    void init(const Mesh& mesh, const std::vector<std::size_t>& sub_domains,
+              std::size_t sub_domain);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/SubsetIterator.h b/dolfin/mesh/SubsetIterator.h
new file mode 100644
index 0000000..de1e43b
--- /dev/null
+++ b/dolfin/mesh/SubsetIterator.h
@@ -0,0 +1,137 @@
+// Copyright (C) 2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Andre Massing 2011.
+//
+// First added:  2010-11-17
+// Last changed: 2011-11-10
+
+#ifndef __SUBSET_ITERATOR_H
+#define __SUBSET_ITERATOR_H
+
+#include <vector>
+
+#include<memory>
+
+#include <dolfin/log/log.h>
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshEntityIterator.h"
+#include "MeshFunction.h"
+
+namespace dolfin
+{
+
+  /// A _SubsetIterator_ is similar to a _MeshEntityIterator_ but
+  /// iterates over a specified subset of the range of entities as
+  /// specified by a _MeshFunction_ that labels the entites.
+
+  class SubsetIterator
+  {
+  public:
+
+    /// Create iterator for given mesh function. The iterator visits
+    /// all entities that match the given label.
+    SubsetIterator(const MeshFunction<std::size_t>& labels, std::size_t label)
+      : _entity(*labels.mesh(), labels.dim(), 0),
+        _subset(new std::vector<std::size_t>()), subset(*_subset)
+    {
+      // Extract subset
+      subset.clear();
+      for (MeshEntityIterator entity(*labels.mesh(), labels.dim());
+           !entity.end(); ++entity)
+      {
+        if (labels[*entity] == label)
+          subset.push_back(entity->index());
+      }
+      info("Iterating over subset, found %d entities out of %d.",
+           subset.size(), labels.size());
+
+      // Set iterator
+      it = subset.begin();
+    }
+
+    /// Copy Constructor
+    SubsetIterator(const SubsetIterator& subset_iter)
+    : _entity(subset_iter._entity), _subset(subset_iter._subset),
+    subset(*_subset), it(subset_iter.it)
+    {}
+
+    /// Destructor
+    virtual ~SubsetIterator() {}
+
+    /// Step to next mesh entity (prefix increment)
+    SubsetIterator& operator++()
+    {
+      ++it;
+      return *this;
+    }
+
+    /// Comparison operator
+    bool operator==(const SubsetIterator& sub_iter) const
+    {
+      return ((const_cast<SubsetIterator *>(this))->operator*()
+            == (const_cast<SubsetIterator *>(&sub_iter))->operator*()
+            && it == sub_iter.it && &subset == &sub_iter.subset);
+    }
+
+    /// Comparison operator
+    bool operator!=(const SubsetIterator & sub_iter) const
+    { return !operator==(sub_iter); }
+
+    /// Dereference operator
+    MeshEntity& operator*()
+    { return *operator->(); }
+
+    /// Member access operator
+    MeshEntity* operator->()
+    { _entity._local_index = *it; return &_entity; }
+
+    /// Check if iterator has reached the end
+    bool end() const
+    { return it == subset.end(); }
+
+    SubsetIterator end_iterator()
+    {
+      SubsetIterator sg(*this);
+      sg.set_end();
+      return sg;
+    }
+
+  private:
+
+    /// Set pos to end position. To create a kind of mesh.end() iterator.
+    void set_end()
+    { it = subset.end(); }
+
+    // Mesh entity
+    MeshEntity _entity;
+
+    // Subset in shared data form
+    std::shared_ptr< std::vector<std::size_t> > _subset;
+
+    //Subset reference for convenience / speed
+    std::vector<std::size_t> & subset;
+
+    // Iterator
+    std::vector<std::size_t>::iterator it;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/TetrahedronCell.cpp b/dolfin/mesh/TetrahedronCell.cpp
new file mode 100644
index 0000000..f480339
--- /dev/null
+++ b/dolfin/mesh/TetrahedronCell.cpp
@@ -0,0 +1,729 @@
+// Copyright (C) 2006-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman 2006
+// Modified by Garth N. Wells 2006
+// Modified by Kristian Oelgaard 2006
+// Modified by Kristoffer Selim 2008
+// Modified by August Johansson 2014
+//
+// First added:  2006-06-05
+// Last changed: 2014-02-13
+
+#include <algorithm>
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "Facet.h"
+#include "MeshEditor.h"
+#include "MeshGeometry.h"
+#include "Vertex.h"
+#include "TriangleCell.h"
+#include "TetrahedronCell.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::size_t TetrahedronCell::dim() const
+{
+  return 3;
+}
+//-----------------------------------------------------------------------------
+std::size_t TetrahedronCell::num_entities(std::size_t dim) const
+{
+  switch (dim)
+  {
+  case 0:
+    return 4; // vertices
+  case 1:
+    return 6; // edges
+  case 2:
+    return 4; // faces
+  case 3:
+    return 1; // cells
+  default:
+    dolfin_error("TetrahedronCell.cpp",
+		 "access number of entities of tetrahedron cell",
+		 "Illegal topological dimension (%d)", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t TetrahedronCell::num_vertices(std::size_t dim) const
+{
+  switch (dim)
+  {
+  case 0:
+    return 1; // vertices
+  case 1:
+    return 2; // edges
+  case 2:
+    return 3; // faces
+  case 3:
+    return 4; // cells
+  default:
+    dolfin_error("TetrahedronCell.cpp",
+		 "access number of vertices for subsimplex of tetrahedron cell",
+		 "Illegal topological dimension (%d)", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t TetrahedronCell::orientation(const Cell& cell) const
+{
+  const Vertex v0(cell.mesh(), cell.entities(0)[0]);
+  const Vertex v1(cell.mesh(), cell.entities(0)[1]);
+  const Vertex v2(cell.mesh(), cell.entities(0)[2]);
+  const Vertex v3(cell.mesh(), cell.entities(0)[3]);
+
+  const Point p01 = v1.point() - v0.point();
+  const Point p02 = v2.point() - v0.point();
+  const Point p03 = v3.point() - v0.point();
+
+  const Point n = p01.cross(p02);
+
+  return (n.dot(p03) < 0.0 ? 1 : 0);
+}
+//-----------------------------------------------------------------------------
+void
+TetrahedronCell::create_entities(std::vector<std::vector<unsigned int> >& e,
+                                 std::size_t dim, const unsigned int* v) const
+{
+  // We only need to know how to create edges and faces
+  switch (dim)
+  {
+  case 1:
+    // Resize data structure
+    e.resize(6);
+    for (int i = 0; i < 6; ++i)
+      e[i] .resize(2);
+
+    // Create the six edges
+    e[0][0] = v[2]; e[0][1] = v[3];
+    e[1][0] = v[1]; e[1][1] = v[3];
+    e[2][0] = v[1]; e[2][1] = v[2];
+    e[3][0] = v[0]; e[3][1] = v[3];
+    e[4][0] = v[0]; e[4][1] = v[2];
+    e[5][0] = v[0]; e[5][1] = v[1];
+    break;
+  case 2:
+    // Resize data structure
+    e.resize(4);
+    for (int i = 0; i < 4; ++i)
+      e[i] .resize(3);
+
+    // Create the four faces
+    e[0][0] = v[1]; e[0][1] = v[2]; e[0][2] = v[3];
+    e[1][0] = v[0]; e[1][1] = v[2]; e[1][2] = v[3];
+    e[2][0] = v[0]; e[2][1] = v[1]; e[2][2] = v[3];
+    e[3][0] = v[0]; e[3][1] = v[1]; e[3][2] = v[2];
+    break;
+  default:
+    dolfin_error("TetrahedronCell.cpp",
+                 "create entities of tetrahedron cell",
+                 "Don't know how to create entities of topological dimension %d", dim);
+  }
+}
+//-----------------------------------------------------------------------------
+void TetrahedronCell::refine_cell(Cell& cell, MeshEditor& editor,
+                                  std::size_t& current_cell) const
+{
+  // Get vertices and edges
+  const unsigned int* v = cell.entities(0);
+  const unsigned int* e = cell.entities(1);
+  dolfin_assert(v);
+  dolfin_assert(e);
+
+  // Get offset for new vertex indices
+  const std::size_t offset = cell.mesh().num_vertices();
+
+  // Compute indices for the ten new vertices
+  const std::size_t v0 = v[0];
+  const std::size_t v1 = v[1];
+  const std::size_t v2 = v[2];
+  const std::size_t v3 = v[3];
+  const std::size_t e0 = offset + e[find_edge(0, cell)];
+  const std::size_t e1 = offset + e[find_edge(1, cell)];
+  const std::size_t e2 = offset + e[find_edge(2, cell)];
+  const std::size_t e3 = offset + e[find_edge(3, cell)];
+  const std::size_t e4 = offset + e[find_edge(4, cell)];
+  const std::size_t e5 = offset + e[find_edge(5, cell)];
+
+  // Regular refinement creates 8 new cells but we need to be careful
+  // to make the partition in a way that does not make the aspect
+  // ratio worse in each refinement. We do this by cutting the middle
+  // octahedron along the shortest of three possible paths.
+  dolfin_assert(editor._mesh);
+  const Point p0 = editor._mesh->geometry().point(e0);
+  const Point p1 = editor._mesh->geometry().point(e1);
+  const Point p2 = editor._mesh->geometry().point(e2);
+  const Point p3 = editor._mesh->geometry().point(e3);
+  const Point p4 = editor._mesh->geometry().point(e4);
+  const Point p5 = editor._mesh->geometry().point(e5);
+  const double d05 = p0.distance(p5);
+  const double d14 = p1.distance(p4);
+  const double d23 = p2.distance(p3);
+
+  // Data structure to hold cells
+  std::vector<std::vector<std::size_t> > cells(8, std::vector<std::size_t>(4));
+
+  // First create the 4 congruent tetrahedra at the corners
+  cells[0][0] = v0; cells[0][1] = e3; cells[0][2] = e4; cells[0][3] = e5;
+  cells[1][0] = v1; cells[1][1] = e1; cells[1][2] = e2; cells[1][3] = e5;
+  cells[2][0] = v2; cells[2][1] = e0; cells[2][2] = e2; cells[2][3] = e4;
+  cells[3][0] = v3; cells[3][1] = e0; cells[3][2] = e1; cells[3][3] = e3;
+
+  // Then divide the remaining octahedron into 4 tetrahedra
+  if (d05 <= d14 && d14 <= d23)
+  {
+    cells[4][0] = e0; cells[4][1] = e1; cells[4][2] = e2; cells[4][3] = e5;
+    cells[5][0] = e0; cells[5][1] = e1; cells[5][2] = e3; cells[5][3] = e5;
+    cells[6][0] = e0; cells[6][1] = e2; cells[6][2] = e4; cells[6][3] = e5;
+    cells[7][0] = e0; cells[7][1] = e3; cells[7][2] = e4; cells[7][3] = e5;
+  }
+  else if (d14 <= d23)
+  {
+    cells[4][0] = e0; cells[4][1] = e1; cells[4][2] = e2; cells[4][3] = e4;
+    cells[5][0] = e0; cells[5][1] = e1; cells[5][2] = e3; cells[5][3] = e4;
+    cells[6][0] = e1; cells[6][1] = e2; cells[6][2] = e4; cells[6][3] = e5;
+    cells[7][0] = e1; cells[7][1] = e3; cells[7][2] = e4; cells[7][3] = e5;
+  }
+  else
+  {
+    cells[4][0] = e0; cells[4][1] = e1; cells[4][2] = e2; cells[4][3] = e3;
+    cells[5][0] = e0; cells[5][1] = e2; cells[5][2] = e3; cells[5][3] = e4;
+    cells[6][0] = e1; cells[6][1] = e2; cells[6][2] = e3; cells[6][3] = e5;
+    cells[7][0] = e2; cells[7][1] = e3; cells[7][2] = e4; cells[7][3] = e5;
+  }
+
+  // Add cells
+  std::vector<std::vector<std::size_t> >::const_iterator _cell;
+  for (_cell = cells.begin(); _cell != cells.end(); ++_cell)
+    editor.add_cell(current_cell++, *_cell);
+}
+//-----------------------------------------------------------------------------
+void TetrahedronCell::refine_cellIrregular(Cell& cell, MeshEditor& editor,
+					   std::size_t& current_cell, std::size_t refinement_rule, std::size_t* marked_edges) const
+{
+  dolfin_not_implemented();
+
+  /*
+  // Get vertices and edges
+  const unsigned int* v = cell.entities(0);
+  const unsigned int* e = cell.entities(1);
+  dolfin_assert(v);
+  dolfin_assert(e);
+
+  // Get offset for new vertex indices
+  const std::size_t offset = cell.mesh().num_vertices();
+
+  // Compute indices for the ten new vertices
+  const std::size_t v0 = v[0];
+  const std::size_t v1 = v[1];
+  const std::size_t v2 = v[2];
+  const std::size_t v3 = v[3];
+  const std::size_t e0 = offset + e[0];
+  const std::size_t e1 = offset + e[1];
+  const std::size_t e2 = offset + e[2];
+  const std::size_t e3 = offset + e[3];
+  const std::size_t e4 = offset + e[4];
+  const std::size_t e5 = offset + e[5];
+
+  // Refine according to refinement rule
+  // The rules are numbered according to the paper:
+  // J. Bey, "Tetrahedral Grid Refinement", 1995.
+  switch (refinement_rule)
+  {
+  case 1:
+  // Rule 1: 4 new cells
+  editor.add_cell(current_cell++, v0, e1, e3, e2);
+  editor.add_cell(current_cell++, v1, e2, e4, e0);
+  editor.add_cell(current_cell++, v2, e0, e5, e1);
+  editor.add_cell(current_cell++, v3, e5, e4, e3);
+  break;
+  case 2:
+  // Rule 2: 2 new cells
+  editor.add_cell(current_cell++, v0, e1, e3, e2);
+  editor.add_cell(current_cell++, v1, e2, e4, e0);
+  break;
+  case 3:
+  // Rule 3: 3 new cells
+  editor.add_cell(current_cell++, v0, e1, e3, e2);
+  editor.add_cell(current_cell++, v1, e2, e4, e0);
+  editor.add_cell(current_cell++, v2, e0, e5, e1);
+  break;
+  case 4:
+  // Rule 4: 4 new cells
+  editor.add_cell(current_cell++, v0, e1, e3, e2);
+  editor.add_cell(current_cell++, v1, e2, e4, e0);
+  editor.add_cell(current_cell++, v2, e0, e5, e1);
+  editor.add_cell(current_cell++, v3, e5, e4, e3);
+  break;
+  default:
+  dolfin_error("TetrahedronCell.cpp",
+  "perform regular cut refinement of tetrahedron",
+  "Illegal rule (%d) for irregular refinement of tetrahedron",
+  refinement_rule);
+  }
+  */
+}
+//-----------------------------------------------------------------------------
+double TetrahedronCell::volume(const MeshEntity& tetrahedron) const
+{
+  // Check that we get a tetrahedron
+  if (tetrahedron.dim() != 3)
+  {
+    dolfin_error("TetrahedronCell.cpp",
+		 "compute volume of tetrahedron cell",
+		 "Illegal mesh entity, not a tetrahedron");
+  }
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = tetrahedron.mesh().geometry();
+
+  // Only know how to compute the volume when embedded in R^3
+  if (geometry.dim() != 3)
+  {
+    dolfin_error("TetrahedronCell.cpp",
+		 "compute volume of tetrahedron",
+		 "Only know how to compute volume when embedded in R^3");
+  }
+
+  // Get the coordinates of the four vertices
+  const unsigned int* vertices = tetrahedron.entities(0);
+  const double* x0 = geometry.x(vertices[0]);
+  const double* x1 = geometry.x(vertices[1]);
+  const double* x2 = geometry.x(vertices[2]);
+  const double* x3 = geometry.x(vertices[3]);
+
+  // Formula for volume from http://mathworld.wolfram.com
+  const double v = (x0[0]*(x1[1]*x2[2] + x3[1]*x1[2] + x2[1]*x3[2] - x2[1]*x1[2] - x1[1]*x3[2] - x3[1]*x2[2]) -
+                    x1[0]*(x0[1]*x2[2] + x3[1]*x0[2] + x2[1]*x3[2] - x2[1]*x0[2] - x0[1]*x3[2] - x3[1]*x2[2]) +
+                    x2[0]*(x0[1]*x1[2] + x3[1]*x0[2] + x1[1]*x3[2] - x1[1]*x0[2] - x0[1]*x3[2] - x3[1]*x1[2]) -
+                    x3[0]*(x0[1]*x1[2] + x1[1]*x2[2] + x2[1]*x0[2] - x1[1]*x0[2] - x2[1]*x1[2] - x0[1]*x2[2]));
+
+  return std::abs(v)/6.0;
+}
+//-----------------------------------------------------------------------------
+double TetrahedronCell::diameter(const MeshEntity& tetrahedron) const
+{
+  // Check that we get a tetrahedron
+  if (tetrahedron.dim() != 3)
+  {
+    dolfin_error("TetrahedronCell.cpp",
+		 "compute diameter of tetrahedron cell",
+		 "Illegal mesh entity, not a tetrahedron");
+  }
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = tetrahedron.mesh().geometry();
+
+  // Only know how to compute the volume when embedded in R^3
+  if (geometry.dim() != 3)
+  {
+    dolfin_error("TetrahedronCell.cpp",
+		 "compute diameter",
+		 "Tetrahedron is not embedded in R^3, only know how to compute diameter in that case");
+  }
+
+  // Get the coordinates of the four vertices
+  const unsigned int* vertices = tetrahedron.entities(0);
+  const Point p0 = geometry.point(vertices[0]);
+  const Point p1 = geometry.point(vertices[1]);
+  const Point p2 = geometry.point(vertices[2]);
+  const Point p3 = geometry.point(vertices[3]);
+
+  // Compute side lengths
+  const double a  = p1.distance(p2);
+  const double b  = p0.distance(p2);
+  const double c  = p0.distance(p1);
+  const double aa = p0.distance(p3);
+  const double bb = p1.distance(p3);
+  const double cc = p2.distance(p3);
+
+  // Compute "area" of triangle with strange side lengths
+  const double la   = a*aa;
+  const double lb   = b*bb;
+  const double lc   = c*cc;
+  const double s    = 0.5*(la+lb+lc);
+  const double area = sqrt(s*(s-la)*(s-lb)*(s-lc));
+
+  // Formula for diameter (2*circumradius) from http://mathworld.wolfram.com
+  return area/(3.0*volume(tetrahedron));
+}
+//-----------------------------------------------------------------------------
+double TetrahedronCell::squared_distance(const Cell& cell, const Point& point) const
+{
+  // Algorithm from Real-time collision detection by Christer Ericson:
+  // ClosestPtPointTetrahedron on page 143, Section 5.1.6.
+  //
+  // Note: This algorithm actually computes the closest point but we
+  // only return the distance to that point.
+
+  // Get the vertices as points
+  const MeshGeometry& geometry = cell.mesh().geometry();
+  const unsigned int* vertices = cell.entities(0);
+  const Point a = geometry.point(vertices[0]);
+  const Point b = geometry.point(vertices[1]);
+  const Point c = geometry.point(vertices[2]);
+  const Point d = geometry.point(vertices[3]);
+
+  // Initialize squared distance
+  double r2 = std::numeric_limits<double>::max();
+
+  // Check face ABC
+  if (point_outside_of_plane(point, a, b, c, d))
+    r2 = std::min(r2, TriangleCell::squared_distance(point, a, b, c));
+
+  // Check face ACD
+  if (point_outside_of_plane(point, a, c, d, b))
+    r2 = std::min(r2, TriangleCell::squared_distance(point, a, c, d));
+
+  // Check face ADB
+  if (point_outside_of_plane(point, a, d, b, c))
+    r2 = std::min(r2, TriangleCell::squared_distance(point, a, d, b));
+
+  // Check facet BDC
+  if (point_outside_of_plane(point, b, d, c, a))
+    r2 = std::min(r2, TriangleCell::squared_distance(point, b, d, c));
+
+  // Point is inside tetrahedron so distance is zero
+  if (r2 == std::numeric_limits<double>::max())
+    r2 = 0.0;
+
+  return r2;
+}
+//-----------------------------------------------------------------------------
+double TetrahedronCell::normal(const Cell& cell, std::size_t facet, std::size_t i) const
+{
+  return normal(cell, facet)[i];
+}
+//-----------------------------------------------------------------------------
+Point TetrahedronCell::normal(const Cell& cell, std::size_t facet) const
+{
+  // Make sure we have facets
+  cell.mesh().init(3, 2);
+
+  // Create facet from the mesh and local facet number
+  Facet f(cell.mesh(), cell.entities(2)[facet]);
+
+  // Get global index of opposite vertex
+  const std::size_t v0 = cell.entities(0)[facet];
+
+  // Get global index of vertices on the facet
+  std::size_t v1 = f.entities(0)[0];
+  std::size_t v2 = f.entities(0)[1];
+  std::size_t v3 = f.entities(0)[2];
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = cell.mesh().geometry();
+
+  // Get the coordinates of the four vertices
+  const double* p0 = geometry.x(v0);
+  const double* p1 = geometry.x(v1);
+  const double* p2 = geometry.x(v2);
+  const double* p3 = geometry.x(v3);
+
+  // Create points from vertex coordinates
+  Point P0(p0[0], p0[1], p0[2]);
+  Point P1(p1[0], p1[1], p1[2]);
+  Point P2(p2[0], p2[1], p2[2]);
+  Point P3(p3[0], p3[1], p3[2]);
+
+  // Create vectors
+  Point V0 = P0 - P1;
+  Point V1 = P2 - P1;
+  Point V2 = P3 - P1;
+
+  // Compute normal vector
+  Point n = V1.cross(V2);
+
+  // Normalize
+  n /= n.norm();
+
+  // Flip direction of normal so it points outward
+  if (n.dot(V0) > 0)
+    n *= -1.0;
+
+  return n;
+}
+//-----------------------------------------------------------------------------
+Point TetrahedronCell::cell_normal(const Cell& cell) const
+{
+  dolfin_error("TetrahedronCell.cpp",
+               "compute cell normal",
+               "cell_normal not implemented for TetrahedronCell");
+
+  return Point();
+}
+//-----------------------------------------------------------------------------
+double TetrahedronCell::facet_area(const Cell& cell, std::size_t facet) const
+{
+  dolfin_assert(cell.mesh().topology().dim() == 3);
+  dolfin_assert(cell.mesh().geometry().dim() == 3);
+
+  // Create facet from the mesh and local facet number
+  Facet f(cell.mesh(), cell.entities(2)[facet]);
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = f.mesh().geometry();
+
+  // Get the coordinates of the three vertices
+  const unsigned int* vertices = f.entities(0);
+  const double* x0 = geometry.x(vertices[0]);
+  const double* x1 = geometry.x(vertices[1]);
+  const double* x2 = geometry.x(vertices[2]);
+
+  // Compute area of triangle embedded in R^3
+  double v0 = (x0[1]*x1[2] + x0[2]*x2[1] + x1[1]*x2[2]) - (x2[1]*x1[2] + x2[2]*x0[1] + x1[1]*x0[2]);
+  double v1 = (x0[2]*x1[0] + x0[0]*x2[2] + x1[2]*x2[0]) - (x2[2]*x1[0] + x2[0]*x0[2] + x1[2]*x0[0]);
+  double v2 = (x0[0]*x1[1] + x0[1]*x2[0] + x1[0]*x2[1]) - (x2[0]*x1[1] + x2[1]*x0[0] + x1[0]*x0[1]);
+
+  // Formula for area from http://mathworld.wolfram.com
+  return  0.5*sqrt(v0*v0 + v1*v1 + v2*v2);
+}
+//-----------------------------------------------------------------------------
+void TetrahedronCell::order(Cell& cell,
+			    const std::vector<std::size_t>& local_to_global_vertex_indices) const
+{
+  // Sort i - j for i > j: 1 - 0, 2 - 0, 2 - 1, 3 - 0, 3 - 1, 3 - 2
+
+  // Get mesh topology
+  const MeshTopology& topology = cell.mesh().topology();
+
+  // Sort local vertices on edges in ascending order, connectivity 1 - 0
+  if (!topology(1, 0).empty())
+  {
+    dolfin_assert(!topology(3, 1).empty());
+
+    // Get edges
+    const unsigned int* cell_edges = cell.entities(1);
+
+    // Sort vertices on each edge
+    for (std::size_t i = 0; i < 6; i++)
+    {
+      unsigned int* edge_vertices = const_cast<unsigned int*>(topology(1, 0)(cell_edges[i]));
+      sort_entities(2, edge_vertices, local_to_global_vertex_indices);
+    }
+  }
+
+  // Sort local vertices on facets in ascending order, connectivity 2 - 0
+  if (!topology(2, 0).empty())
+  {
+    dolfin_assert(!topology(3, 2).empty());
+
+    // Get facets
+    const unsigned int* cell_facets = cell.entities(2);
+
+    // Sort vertices on each facet
+    for (std::size_t i = 0; i < 4; i++)
+    {
+      unsigned int* facet_vertices = const_cast<unsigned int*>(topology(2, 0)(cell_facets[i]));
+      sort_entities(3, facet_vertices, local_to_global_vertex_indices);
+    }
+  }
+
+  // Sort local edges on local facets after non-incident vertex, connectivity 2 - 1
+  if (!topology(2, 1).empty())
+  {
+    dolfin_assert(!topology(3, 2).empty());
+    dolfin_assert(!topology(2, 0).empty());
+    dolfin_assert(!topology(1, 0).empty());
+
+    // Get facet numbers
+    const unsigned int* cell_facets = cell.entities(2);
+
+    // Loop over facets on cell
+    for (std::size_t i = 0; i < 4; i++)
+    {
+      // For each facet number get the global vertex numbers
+      const unsigned int* facet_vertices = topology(2, 0)(cell_facets[i]);
+
+      // For each facet number get the global edge number
+      unsigned int* cell_edges = const_cast<unsigned int*>(topology(2, 1)(cell_facets[i]));
+
+      // Loop over vertices on facet
+      std::size_t m = 0;
+      for (std::size_t j = 0; j < 3; j++)
+      {
+	// Loop edges on facet
+	for (std::size_t k(m); k < 3; k++)
+	{
+	  // For each edge number get the global vertex numbers
+	  const unsigned int* edge_vertices = topology(1, 0)(cell_edges[k]);
+
+	  // Check if the jth vertex of facet i is non-incident on edge k
+	  if (!std::count(edge_vertices, edge_vertices + 2, facet_vertices[j]))
+	  {
+	    // Swap facet numbers
+	    std::size_t tmp = cell_edges[m];
+	    cell_edges[m] = cell_edges[k];
+	    cell_edges[k] = tmp;
+	    m++;
+	    break;
+	  }
+	}
+      }
+    }
+  }
+
+  // Sort local vertices on cell in ascending order, connectivity 3 - 0
+  if (!topology(3, 0).empty())
+  {
+    unsigned int* cell_vertices = const_cast<unsigned int*>(cell.entities(0));
+    sort_entities(4, cell_vertices, local_to_global_vertex_indices);
+  }
+
+  // Sort local edges on cell after non-incident vertex tuble, connectivity 3-1
+  if (!topology(3, 1).empty())
+  {
+    dolfin_assert(!topology(1, 0).empty());
+
+    // Get cell vertices and edge numbers
+    const unsigned int* cell_vertices = cell.entities(0);
+    unsigned int* cell_edges = const_cast<unsigned int*>(cell.entities(1));
+
+    // Loop two vertices on cell as a lexicographical tuple
+    // (i, j): (0,1) (0,2) (0,3) (1,2) (1,3) (2,3)
+    std::size_t m = 0;
+    for (std::size_t i = 0; i < 3; i++)
+    {
+      for (std::size_t j = i+1; j < 4; j++)
+      {
+	// Loop edge numbers
+	for (std::size_t k = m; k < 6; k++)
+	{
+	  // Get local vertices on edge
+	  const unsigned int* edge_vertices = topology(1, 0)(cell_edges[k]);
+
+	  // Check if the ith and jth vertex of the cell are non-incident on edge k
+	  if (!std::count(edge_vertices, edge_vertices+2, cell_vertices[i]) && \
+	      !std::count(edge_vertices, edge_vertices+2, cell_vertices[j]) )
+	  {
+	    // Swap edge numbers
+	    std::size_t tmp = cell_edges[m];
+	    cell_edges[m] = cell_edges[k];
+	    cell_edges[k] = tmp;
+	    m++;
+	    break;
+	  }
+	}
+      }
+    }
+  }
+
+  // Sort local facets on cell after non-incident vertex, connectivity 3 - 2
+  if (!topology(3, 2).empty())
+  {
+    dolfin_assert(!topology(2, 0).empty());
+
+    // Get cell vertices and facet numbers
+    const unsigned int* cell_vertices = cell.entities(0);
+    unsigned int* cell_facets   = const_cast<unsigned int*>(cell.entities(2));
+
+    // Loop vertices on cell
+    for (std::size_t i = 0; i < 4; i++)
+    {
+      // Loop facets on cell
+      for (std::size_t j = i; j < 4; j++)
+      {
+	unsigned int* facet_vertices = const_cast<unsigned int*>(topology(2, 0)(cell_facets[j]));
+
+	// Check if the ith vertex of the cell is non-incident on facet j
+	if (!std::count(facet_vertices, facet_vertices+3, cell_vertices[i]))
+	{
+	  // Swap facet numbers
+	  std::size_t tmp = cell_facets[i];
+	  cell_facets[i] = cell_facets[j];
+	  cell_facets[j] = tmp;
+	  break;
+	}
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+bool TetrahedronCell::collides(const Cell& cell, const Point& point) const
+{
+  return CollisionDetection::collides(cell, point);
+}
+//-----------------------------------------------------------------------------
+bool TetrahedronCell::collides(const Cell& cell, const MeshEntity& entity) const
+{
+  return CollisionDetection::collides(cell, entity);
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+TetrahedronCell::triangulate_intersection(const Cell& c0, const Cell& c1) const
+{
+  return IntersectionTriangulation::triangulate_intersection(c0, c1);
+}
+//-----------------------------------------------------------------------------
+std::string TetrahedronCell::description(bool plural) const
+{
+  if (plural)
+    return "tetrahedra";
+  return "tetrahedron";
+}
+//-----------------------------------------------------------------------------
+std::size_t TetrahedronCell::find_edge(std::size_t i, const Cell& cell) const
+{
+  // Get vertices and edges
+  const unsigned int* v = cell.entities(0);
+  const unsigned int* e = cell.entities(1);
+  dolfin_assert(v);
+  dolfin_assert(e);
+
+  // Ordering convention for edges (order of non-incident vertices)
+  static std::size_t EV[6][2] = {{0, 1}, {0, 2}, {0, 3}, {1, 2}, {1, 3}, {2, 3}};
+
+  // Look for edge satisfying ordering convention
+  for (std::size_t j = 0; j < 6; j++)
+  {
+    const unsigned int* ev = cell.mesh().topology()(1, 0)(e[j]);
+    dolfin_assert(ev);
+    const std::size_t v0 = v[EV[i][0]];
+    const std::size_t v1 = v[EV[i][1]];
+    if (ev[0] != v0 && ev[0] != v1 && ev[1] != v0 && ev[1] != v1)
+      return j;
+  }
+
+  // We should not reach this
+  dolfin_error("TetrahedronCell.cpp",
+               "find specified edge in cell",
+               "Edge really not found");
+  return 0;
+}
+//-----------------------------------------------------------------------------
+bool TetrahedronCell::point_outside_of_plane(const Point& point,
+                                             const Point& a,
+                                             const Point& b,
+                                             const Point& c,
+                                             const Point& d) const
+{
+  // Algorithm from Real-time collision detection by Christer Ericson:
+  // PointOutsideOfPlane on page 144, Section 5.1.6.
+
+  const Point v = (b - a).cross(c - a);
+  const double signp = v.dot(point - a);
+  const double signd = v.dot(d - a);
+
+  return signp * signd < 0.0;
+}
+//-----------------------------------------------------------------------------
+
diff --git a/dolfin/mesh/TetrahedronCell.h b/dolfin/mesh/TetrahedronCell.h
new file mode 100644
index 0000000..8be6511
--- /dev/null
+++ b/dolfin/mesh/TetrahedronCell.h
@@ -0,0 +1,125 @@
+// Copyright (C) 2006-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hoffman, 2006.
+// Modified by Garth N. Wells, 2006.
+// Modified by Kristoffer Selim, 2008.
+//
+// First added:  2006-06-05
+// Last changed: 2014-01-31
+
+#ifndef __TETRAHEDRON_CELL_H
+#define __TETRAHEDRON_CELL_H
+
+#include <vector>
+#include "CellType.h"
+
+namespace dolfin
+{
+
+  class Cell;
+
+  /// This class implements functionality for tetrahedral meshes.
+
+  class TetrahedronCell : public CellType
+  {
+  public:
+
+    /// Specify cell type and facet type
+    TetrahedronCell() : CellType(tetrahedron, triangle) {}
+
+    /// Return topological dimension of cell
+    std::size_t dim() const;
+
+    /// Return number of entitites of given topological dimension
+    std::size_t num_entities(std::size_t dim) const;
+
+    /// Return number of vertices for entity of given topological dimension
+    std::size_t num_vertices(std::size_t dim) const;
+
+    /// Return orientation of the cell
+    std::size_t orientation(const Cell& cell) const;
+
+    /// Create entities e of given topological dimension from vertices v
+    void create_entities(std::vector<std::vector<unsigned int> >& e,
+                         std::size_t dim, const unsigned int* v) const;
+
+    /// Regular refinement of cell
+    void refine_cell(Cell& cell, MeshEditor& editor,
+                     std::size_t& current_cell) const;
+
+    /// Irregular refinement of cell
+    void refine_cellIrregular(Cell& cell, MeshEditor& editor,
+                              std::size_t& current_cell, std::size_t refinement_rule,
+                              std::size_t* marked_edges) const;
+
+    /// Compute volume of tetrahedron
+    double volume(const MeshEntity& tetrahedron) const;
+
+    /// Compute diameter of tetrahedron
+    double diameter(const MeshEntity& tetrahedron) const;
+
+    /// Compute squared distance to given point
+    double squared_distance(const Cell& cell, const Point& point) const;
+
+    /// Compute component i of normal of given facet with respect to the cell
+    double normal(const Cell& cell, std::size_t facet, std::size_t i) const;
+
+    /// Compute normal of given facet with respect to the cell
+    Point normal(const Cell& cell, std::size_t facet) const;
+
+    /// Compute normal to given cell (viewed as embedded in 4D ...)
+    Point cell_normal(const Cell& cell) const;
+
+    /// Compute the area/length of given facet with respect to the cell
+    double facet_area(const Cell& cell, std::size_t facet) const;
+
+    /// Order entities locally
+    void order(Cell& cell,
+               const std::vector<std::size_t>& local_to_global_vertex_indices) const;
+
+    /// Check whether given point collides with cell
+    bool collides(const Cell& cell, const Point& point) const;
+
+    /// Check whether given entity collides with cell
+    bool collides(const Cell& cell, const MeshEntity& entity) const;
+
+    /// Compute triangulation of intersection of two cells
+    virtual std::vector<double>
+    triangulate_intersection(const Cell& c0, const Cell& c1) const;
+    
+    /// Return description of cell type
+    std::string description(bool plural) const;
+
+  private:
+
+    // Find local index of edge i according to ordering convention
+    std::size_t find_edge(std::size_t i, const Cell& cell) const;
+
+    // Check whether point is outside region defined by facet ABC.
+    // The fourth vertex is needed to define the orientation.
+    bool point_outside_of_plane(const Point& point,
+                                const Point& A,
+                                const Point& B,
+                                const Point& C,
+                                const Point& D) const;
+ 
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/TopologyComputation.cpp b/dolfin/mesh/TopologyComputation.cpp
new file mode 100644
index 0000000..698ce62
--- /dev/null
+++ b/dolfin/mesh/TopologyComputation.cpp
@@ -0,0 +1,366 @@
+// Copyright (C) 2006-2014 Anders Logg and Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2012.
+//
+// First added:  2006-06-02
+// Last changed: 2014-01-12
+
+#include <algorithm>
+#include <vector>
+#include <boost/unordered_map.hpp>
+#include <boost/version.hpp>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/utils.h>
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "CellType.h"
+#include "Mesh.h"
+#include "MeshConnectivity.h"
+#include "MeshEntityIterator.h"
+#include "MeshTopology.h"
+#include "TopologyComputation.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::size_t TopologyComputation::compute_entities(Mesh& mesh, std::size_t dim)
+{
+  // Get mesh topology and connectivity
+  MeshTopology& topology = mesh.topology();
+  MeshConnectivity& ce = topology(topology.dim(), dim);
+  MeshConnectivity& ev = topology(dim, 0);
+
+  // Check if entities have already been computed
+  if (topology.size(dim) > 0)
+  {
+    // Make sure we really have the connectivity
+    if ((ce.empty() && dim != topology.dim()) || (ev.empty() && dim != 0))
+    {
+      dolfin_error("TopologyComputation.cpp",
+                   "compute topological entities",
+                   "Entities of topological dimension %d exist but connectivity is missing", dim);
+    }
+    return topology.size(dim);
+  }
+
+  // Make sure connectivity does not already exist
+  if (!ce.empty() || !ev.empty())
+  {
+    dolfin_error("TopologyComputation.cpp",
+                 "compute topological entities",
+                 "Connectivity for topological dimension %d exists but entities are missing", dim);
+  }
+
+
+  // Start timer
+  Timer timer("compute entities dim = " + to_string(dim));
+
+  // Get cell type
+  const CellType& cell_type = mesh.type();
+
+  // Initialize local array of entities
+  const std::size_t m = cell_type.num_entities(dim);
+  const std::size_t n = cell_type.num_vertices(dim);
+  std::vector<std::vector<unsigned int> >
+    e_vertices(m, std::vector<unsigned int>(n, 0));
+
+  // List of entity e indices connected to cell
+  std::vector<std::vector<unsigned int> > connectivity_ce(mesh.num_cells());
+
+  // List of vertces indices connected to entity e
+  std::vector<std::vector<unsigned int> > connectivity_ev;
+
+  std::size_t current_entity = 0;
+  std::size_t max_ce_connections = 1;
+  boost::unordered_map<std::vector<unsigned int>, unsigned int>
+    evertices_to_index;
+
+  // Rehash/reserve map for efficiency
+  const std::size_t max_elements
+    = mesh.num_cells()*mesh.type().num_entities(dim)/2;
+  #if BOOST_VERSION < 105000
+  evertices_to_index.rehash(max_elements/evertices_to_index.max_load_factor()
+                            + 1);
+  #else
+  evertices_to_index.reserve(max_elements);
+  #endif
+
+  // Loop over cells
+  for (CellIterator c(mesh); !c.end(); ++c)
+  {
+    // Cell index
+    const std::size_t cell_index = c->index();
+
+    // Reserve space to reduce dynamic allocations
+    connectivity_ce[cell_index].reserve(max_ce_connections);
+
+    // Get vertices from cell
+    const unsigned int* vertices = c->entities(0);
+    dolfin_assert(vertices);
+
+    // Create entities
+    cell_type.create_entities(e_vertices, dim, vertices);
+
+    // Iterate over the given list of entities
+    std::vector<std::vector<unsigned int> >::iterator entity;
+    for (entity = e_vertices.begin(); entity != e_vertices.end(); ++entity)
+    {
+      // Sort entities (to use as map key)
+      std::sort(entity->begin(), entity->end());
+
+      // Insert into map
+      std::pair<boost::unordered_map<std::vector<unsigned int>, unsigned int>::iterator, bool>
+        it = evertices_to_index.insert(std::make_pair(*entity, current_entity));
+
+      // Entity index
+      std::size_t e_index = it.first->second;
+
+      // Add entity index to cell - e connectivity
+      connectivity_ce[cell_index].push_back(e_index);
+
+      // If new key was inserted, increment entity counter
+      if (it.second)
+      {
+        // Add list of new entity vertices
+        connectivity_ev.push_back(*entity);
+
+        // Update max vector size (used to reserve space for performance);
+        max_ce_connections = std::max(max_ce_connections,
+                                      connectivity_ce[cell_index].size());
+
+        // Increase counter
+        current_entity++;
+      }
+    }
+  }
+
+  // Initialise connectivity data structure
+  topology.init(dim, connectivity_ev.size(), connectivity_ev.size());
+
+  // Copy connectivity data into static MeshTopology data structures
+  ce.set(connectivity_ce);
+  ev.set(connectivity_ev);
+
+  return current_entity;
+}
+//-----------------------------------------------------------------------------
+void TopologyComputation::compute_connectivity(Mesh& mesh,
+                                               std::size_t d0,
+                                               std::size_t d1)
+{
+  // This is where all the logic takes place to find a stragety for
+  // the connectivity computation. For any given pair (d0, d1), the
+  // connectivity is computed by suitably combining the following
+  // basic building blocks:
+  //
+  //   1. compute_entities():     d  - 0  from dim - 0
+  //   2. compute_transpose():    d0 - d1 from d1 - d0
+  //   3. compute_intersection(): d0 - d1 from d0 - d' - d1
+  //
+  // Each of these functions assume a set of preconditions that we
+  // need to satisfy.
+
+  log(TRACE, "Requesting connectivity %d - %d.", d0, d1);
+
+  // Get mesh topology and connectivity
+  MeshTopology& topology = mesh.topology();
+  MeshConnectivity& connectivity = topology(d0, d1);
+
+  // Check if connectivity has already been computed
+  if (!connectivity.empty())
+    return;
+
+  // Compute entities if they don't exist
+  if (topology.size(d0) == 0)
+    compute_entities(mesh, d0);
+  if (topology.size(d1) == 0)
+    compute_entities(mesh, d1);
+
+  // Check is mesh has entities
+  if (topology.size(d0) == 0 && topology.size(d1) == 0)
+    return;
+
+  // Check if connectivity still needs to be computed
+  if (!connectivity.empty())
+    return;
+
+  // Start timer
+  Timer timer("compute connectivity " + to_string(d0) + " - " + to_string(d1));
+
+  // Decide how to compute the connectivity
+  if (d0 == 0 && d1 == 0)
+  {
+    std::vector<std::vector<std::size_t> >
+      connectivity00(topology.size(d0), std::vector<std::size_t>(1));
+    for (MeshEntityIterator v(mesh, d0); !v.end(); ++v)
+      connectivity00[v->index()][0] = v->index();
+    topology(d0, d0).set(connectivity00);
+  }
+  else if (d0 < d1)
+  {
+    // Compute connectivity d1 - d0 and take transpose
+    compute_connectivity(mesh, d1, d0);
+    compute_from_transpose(mesh, d0, d1);
+  }
+  else
+  {
+    // These connections should already exist
+    dolfin_assert(!(d0 > 0 && d1 == 0));
+
+    // Choose how to take intersection
+    dolfin_assert(d0 != 0);
+    dolfin_assert(d1 != 0);
+    std::size_t d = 0;
+
+    // Compute connectivity d0 - d - d1 and take intersection
+    compute_connectivity(mesh, d0, d);
+    compute_connectivity(mesh, d, d1);
+    compute_from_intersection(mesh, d0, d1, d);
+  }
+}
+//--------------------------------------------------------------------------
+void TopologyComputation::compute_from_transpose(Mesh& mesh, std::size_t d0,
+                                                 std::size_t d1)
+{
+  // The transpose is computed in three steps:
+  //
+  //   1. Iterate over entities of dimension d1 and count the number
+  //      of connections for each entity of dimension d0
+  //
+  //   2. Allocate memory / prepare data structures
+  //
+  //   3. Iterate again over entities of dimension d1 and add connections
+  //      for each entity of dimension d0
+
+  log(TRACE, "Computing mesh connectivity %d - %d from transpose.", d0, d1);
+
+  // Get mesh topology and connectivity
+  MeshTopology& topology = mesh.topology();
+  MeshConnectivity& connectivity = topology(d0, d1);
+
+  // Need connectivity d1 - d0
+  dolfin_assert(!topology(d1, d0).empty());
+
+  // Temporary array
+  std::vector<std::size_t> tmp(topology.size(d0), 0);
+
+  // Count the number of connections
+  for (MeshEntityIterator e1(mesh, d1); !e1.end(); ++e1)
+    for (MeshEntityIterator e0(*e1, d0); !e0.end(); ++e0)
+      tmp[e0->index()]++;
+
+  // Initialize the number of connections
+  connectivity.init(tmp);
+
+  // Reset current position for each entity
+  std::fill(tmp.begin(), tmp.end(), 0);
+
+  // Add the connections
+  for (MeshEntityIterator e1(mesh, d1); !e1.end(); ++e1)
+    for (MeshEntityIterator e0(*e1, d0); !e0.end(); ++e0)
+      connectivity.set(e0->index(), e1->index(), tmp[e0->index()]++);
+}
+//----------------------------------------------------------------------------
+void TopologyComputation::compute_from_intersection(Mesh& mesh,
+                                                    std::size_t d0,
+                                                    std::size_t d1,
+                                                    std::size_t d)
+{
+  log(TRACE, "Computing mesh connectivity %d - %d from intersection %d - %d - %d.",
+      d0, d1, d0, d, d1);
+
+  // Get mesh topology
+  MeshTopology& topology = mesh.topology();
+
+  // Check preconditions
+  dolfin_assert(d0 >= d1);
+  dolfin_assert(!topology(d0, d).empty());
+  dolfin_assert(!topology(d, d1).empty());
+
+  // Temporary dynamic storage, later copied into static storage
+  std::vector<std::vector<std::size_t> > connectivity(topology.size(d0));
+
+  // A bitmap used to ensure we do not store duplicates
+  std::vector<bool> e1_visited(topology.size(d1));
+
+  // Iterate over all entities of dimension d0
+  std::size_t max_size = 1;
+  const std::size_t e0_num_entities = mesh.type().num_vertices(d0);
+  const std::size_t e1_num_entities = mesh.type().num_vertices(d1);
+  std::vector<std::size_t> _e0(e0_num_entities);
+  std::vector<std::size_t> _e1(e1_num_entities);
+  for (MeshEntityIterator e0(mesh, d0); !e0.end(); ++e0)
+  {
+    // Get set of connected entities for current entity
+    std::vector<std::size_t>& entities = connectivity[e0->index()];
+
+    // Reserve space
+    entities.reserve(max_size);
+
+    // Sorted list of e0 vertex indices (necessary to test for
+    // presence of one list in another)
+    std::copy(e0->entities(0), e0->entities(0) + e0_num_entities, _e0.begin());
+    std::sort(_e0.begin(), _e0.end());
+
+    // Initialise e1_visited to false for all neighbours of e0. The
+    // loop structure mirrors the one below.
+    for (MeshEntityIterator e(*e0, d); !e.end(); ++e)
+      for (MeshEntityIterator e1(*e, d1); !e1.end(); ++e1)
+        e1_visited[e1->index()] = false;
+
+    // Iterate over all connected entities of dimension d
+    for (MeshEntityIterator e(*e0, d); !e.end(); ++e)
+    {
+      // Iterate over all connected entities of dimension d1
+      for (MeshEntityIterator e1(*e, d1); !e1.end(); ++e1)
+      {
+        // Skip already visited connected entities (to avoid duplicates)
+        if (e1_visited[e1->index()])
+          continue;
+        e1_visited[e1->index()] = true;
+
+        if (d0 == d1)
+        {
+          // An entity is not a neighbor to itself (duplicate index
+          // entries removed at end)
+          if (e0->index() != e1->index())
+            entities.push_back(e1->index());
+        }
+        else
+        {
+          // Sorted list of e1 vertex indices
+          std::copy(e1->entities(0), e1->entities(0) + e1_num_entities,
+                    _e1.begin());
+          std::sort(_e1.begin(), _e1.end());
+
+          // Entity e1 must be completely contained in e0
+          if (std::includes(_e0.begin(), _e0.end(), _e1.begin(), _e1.end()))
+            entities.push_back(e1->index());
+        }
+      }
+    }
+
+    // Store maximum size
+    max_size = std::max(entities.size(), max_size);
+  }
+
+  // Copy to static storage
+  topology(d0, d1).set(connectivity);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/TopologyComputation.h b/dolfin/mesh/TopologyComputation.h
new file mode 100644
index 0000000..c80b4fd
--- /dev/null
+++ b/dolfin/mesh/TopologyComputation.h
@@ -0,0 +1,61 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2012.
+//
+// First added:  2006-06-02
+// Last changed: 2012-02-14
+
+#ifndef __TOPOLOGY_COMPUTATION_H
+#define __TOPOLOGY_COMPUTATION_H
+
+#include <vector>
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class implements a set of basic algorithms that automate
+  /// the computation of mesh entities and connectivity.
+
+  class TopologyComputation
+  {
+  public:
+
+    /// Compute mesh entities of given topological dimension
+    static std::size_t compute_entities(Mesh& mesh, std::size_t dim);
+
+    /// Compute connectivity for given pair of topological dimensions
+    static void compute_connectivity(Mesh& mesh, std::size_t d0,
+                                     std::size_t d1);
+
+  private:
+
+    // Compute connectivity from transpose
+    static void compute_from_transpose(Mesh& mesh, std::size_t d0,
+                                       std::size_t d1);
+
+    // Compute connectivity from intersection
+    static void compute_from_intersection(Mesh& mesh, std::size_t d0,
+                                          std::size_t d1, std::size_t d);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/TriangleCell.cpp b/dolfin/mesh/TriangleCell.cpp
new file mode 100644
index 0000000..56942b6
--- /dev/null
+++ b/dolfin/mesh/TriangleCell.cpp
@@ -0,0 +1,524 @@
+// Copyright (C) 2006-2014 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells 2006
+// Modified by Kristian Oelgaard 2006-2007
+// Modified by Dag Lindbo 2008
+// Modified by Kristoffer Selim 2008
+// Modified by Jan Blechta 2013
+// Modified by August Johansson 2014
+//
+// First added:  2006-06-05
+// Last changed: 2014-03-03
+
+#include <algorithm>
+#include <dolfin/log/log.h>
+#include "Cell.h"
+#include "MeshEditor.h"
+#include "MeshEntity.h"
+#include "Facet.h"
+#include "TriangleCell.h"
+#include "Vertex.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+std::size_t TriangleCell::dim() const
+{
+  return 2;
+}
+//-----------------------------------------------------------------------------
+std::size_t TriangleCell::num_entities(std::size_t dim) const
+{
+  switch (dim)
+  {
+  case 0:
+    return 3; // vertices
+  case 1:
+    return 3; // edges
+  case 2:
+    return 1; // cells
+  default:
+    dolfin_error("TriangleCell.cpp",
+                 "access number of entities of triangle cell",
+                 "Illegal topological dimension (%d)", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t TriangleCell::num_vertices(std::size_t dim) const
+{
+  switch (dim)
+  {
+  case 0:
+    return 1; // vertices
+  case 1:
+    return 2; // edges
+  case 2:
+    return 3; // cells
+  default:
+    dolfin_error("TriangleCell.cpp",
+                 "access number of vertices for subsimplex of triangle cell",
+                 "Illegal topological dimension (%d)", dim);
+  }
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+std::size_t TriangleCell::orientation(const Cell& cell) const
+{
+  const Point up(0.0, 0.0, 1.0);
+  return cell.orientation(up);
+}
+//-----------------------------------------------------------------------------
+void TriangleCell::create_entities(std::vector<std::vector<unsigned int> >& e,
+                                   std::size_t dim, const unsigned int* v) const
+{
+  // We only need to know how to create edges
+  if (dim != 1)
+  {
+    dolfin_error("TriangleCell.cpp",
+                 "create entities of triangle cell",
+                 "Don't know how to create entities of topological dimension %d", dim);
+  }
+
+  // Resize data structure
+  e.resize(3);
+  e[0].resize(2);
+  e[1].resize(2);
+  e[2].resize(2);
+
+  // Create the three edges
+  e[0][0] = v[1]; e[0][1] = v[2];
+  e[1][0] = v[0]; e[1][1] = v[2];
+  e[2][0] = v[0]; e[2][1] = v[1];
+}
+//-----------------------------------------------------------------------------
+void TriangleCell::refine_cell(Cell& cell, MeshEditor& editor,
+                               std::size_t& current_cell) const
+{
+  // Get vertices and edges
+  const unsigned int* v = cell.entities(0);
+  const unsigned int* e = cell.entities(1);
+  dolfin_assert(v);
+  dolfin_assert(e);
+
+  // Get offset for new vertex indices
+  const std::size_t offset = cell.mesh().num_vertices();
+
+  // Compute indices for the six new vertices
+  const std::size_t v0 = v[0];
+  const std::size_t v1 = v[1];
+  const std::size_t v2 = v[2];
+  const std::size_t e0 = offset + e[find_edge(0, cell)];
+  const std::size_t e1 = offset + e[find_edge(1, cell)];
+  const std::size_t e2 = offset + e[find_edge(2, cell)];
+
+  // Create four new cells
+  std::vector<std::vector<std::size_t> > cells(4, std::vector<std::size_t>(3));
+  cells[0][0] = v0; cells[0][1] = e2; cells[0][2] = e1;
+  cells[1][0] = v1; cells[1][1] = e0; cells[1][2] = e2;
+  cells[2][0] = v2; cells[2][1] = e1; cells[2][2] = e0;
+  cells[3][0] = e0; cells[3][1] = e1; cells[3][2] = e2;
+
+  // Add cells
+  std::vector<std::vector<std::size_t> >::const_iterator _cell;
+  for (_cell = cells.begin(); _cell != cells.end(); ++_cell)
+    editor.add_cell(current_cell++, *_cell);
+}
+//-----------------------------------------------------------------------------
+double TriangleCell::volume(const MeshEntity& triangle) const
+{
+  // Check that we get a triangle
+  if (triangle.dim() != 2)
+  {
+    dolfin_error("TriangleCell.cpp",
+                 "compute volume (area) of triangle cell",
+                 "Illegal mesh entity, not a triangle");
+  }
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = triangle.mesh().geometry();
+
+  // Get the coordinates of the three vertices
+  const unsigned int* vertices = triangle.entities(0);
+  const double* x0 = geometry.x(vertices[0]);
+  const double* x1 = geometry.x(vertices[1]);
+  const double* x2 = geometry.x(vertices[2]);
+
+  if (geometry.dim() == 2)
+  {
+    // Compute area of triangle embedded in R^2
+    double v2 = (x0[0]*x1[1] + x0[1]*x2[0] + x1[0]*x2[1]) - (x2[0]*x1[1] + x2[1]*x0[0] + x1[0]*x0[1]);
+
+    // Formula for volume from http://mathworld.wolfram.com
+    return 0.5 * std::abs(v2);
+  }
+  else if (geometry.dim() == 3)
+  {
+    // Compute area of triangle embedded in R^3
+    const double v0 = (x0[1]*x1[2] + x0[2]*x2[1] + x1[1]*x2[2]) - (x2[1]*x1[2] + x2[2]*x0[1] + x1[1]*x0[2]);
+    const double v1 = (x0[2]*x1[0] + x0[0]*x2[2] + x1[2]*x2[0]) - (x2[2]*x1[0] + x2[0]*x0[2] + x1[2]*x0[0]);
+    const double v2 = (x0[0]*x1[1] + x0[1]*x2[0] + x1[0]*x2[1]) - (x2[0]*x1[1] + x2[1]*x0[0] + x1[0]*x0[1]);
+
+    // Formula for volume from http://mathworld.wolfram.com
+    return  0.5*sqrt(v0*v0 + v1*v1 + v2*v2);
+  }
+  else
+    dolfin_error("TriangleCell.cpp",
+                 "compute volume of triangle",
+                 "Only know how to compute volume when embedded in R^2 or R^3");
+
+  return 0.0;
+}
+//-----------------------------------------------------------------------------
+double TriangleCell::diameter(const MeshEntity& triangle) const
+{
+  // Check that we get a triangle
+  if (triangle.dim() != 2)
+  {
+    dolfin_error("TriangleCell.cpp",
+                 "compute diameter of triangle cell",
+                 "Illegal mesh entity, not a triangle");
+  }
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = triangle.mesh().geometry();
+
+  // Only know how to compute the diameter when embedded in R^2 or R^3
+  if (geometry.dim() != 2 && geometry.dim() != 3)
+    dolfin_error("TriangleCell.cpp",
+                 "compute diameter of triangle",
+                 "Only know how to compute diameter when embedded in R^2 or R^3");
+
+  // Get the coordinates of the three vertices
+  const unsigned int* vertices = triangle.entities(0);
+  const Point p0 = geometry.point(vertices[0]);
+  const Point p1 = geometry.point(vertices[1]);
+  const Point p2 = geometry.point(vertices[2]);
+
+  // FIXME: Assuming 3D coordinates, could be more efficient if
+  // FIXME: if we assumed 2D coordinates in 2D
+
+  // Compute side lengths
+  const double a  = p1.distance(p2);
+  const double b  = p0.distance(p2);
+  const double c  = p0.distance(p1);
+
+  // Formula for diameter (2*circumradius) from http://mathworld.wolfram.com
+  return 0.5*a*b*c / volume(triangle);
+}
+//-----------------------------------------------------------------------------
+double TriangleCell::squared_distance(const Cell& cell, const Point& point) const
+{
+  // Get the vertices as points
+  const MeshGeometry& geometry = cell.mesh().geometry();
+  const unsigned int* vertices = cell.entities(0);
+  const Point a = geometry.point(vertices[0]);
+  const Point b = geometry.point(vertices[1]);
+  const Point c = geometry.point(vertices[2]);
+
+  // Call function to compute squared distance
+  return squared_distance(point, a, b, c);
+}
+//-----------------------------------------------------------------------------
+double TriangleCell::squared_distance(const Point& point,
+                                      const Point& a,
+                                      const Point& b,
+                                      const Point& c)
+{
+  // Algorithm from Real-time collision detection by Christer Ericson:
+  // ClosestPtPointTriangle on page 141, Section 5.1.5.
+  //
+  // Algorithm modified to handle triangles embedded in 3D.
+  //
+  // Note: This algorithm actually computes the closest point but we
+  // only return the distance to that point.
+
+  // Compute normal to plane defined by triangle
+  const Point ab = b - a;
+  const Point ac = c - a;
+  Point n = ab.cross(ac);
+  n /= n.norm();
+
+  // Subtract projection onto plane
+  const double pn = (point - a).dot(n);
+  const Point p = point - pn*n;
+
+  // Check if point is in vertex region outside A
+  const Point ap = p - a;
+  const double d1 = ab.dot(ap);
+  const double d2 = ac.dot(ap);
+  if (d1 <= 0.0 && d2 <= 0.0)
+    return p.squared_distance(a) + pn*pn;
+
+  // Check if point is in vertex region outside B
+  const Point bp = p - b;
+  const double d3 = ab.dot(bp);
+  const double d4 = ac.dot(bp);
+  if (d3 >= 0.0 && d4 <= d3)
+    return p.squared_distance(b) + pn*pn;
+
+  // Check if point is in edge region of AB and if so compute projection
+  const double vc = d1*d4 - d3*d2;
+  if (vc <= 0.0 && d1 >= 0.0 && d3 <= 0.0)
+  {
+    const double v = d1 / (d1 - d3);
+    return p.squared_distance(a + v*ab) + pn*pn;
+  }
+
+  // Check if point is in vertex region outside C
+  const Point cp = p - c;
+  const double d5 = ab.dot(cp);
+  const double d6 = ac.dot(cp);
+  if (d6 >= 0.0 && d5 <= d6)
+    return p.squared_distance(c) + pn*pn;
+
+  // Check if point is in edge region of AC and if so compute projection
+  const double vb = d5*d2 - d1*d6;
+  if (vb <= 0.0 && d2 >= 0.0 && d6 <= 0.0)
+  {
+    const double w = d2 / (d2 - d6);
+    return p.squared_distance(a + w*ac) + pn*pn;
+  }
+
+  // Check if point is in edge region of BC and if so compute projection
+  const double va = d3*d6 - d5*d4;
+  if (va <= 0.0 && (d4 - d3) >= 0.0 && (d5 - d6) >= 0.0)
+  {
+    const double w = (d4 - d3) / ((d4 - d3) + (d5 - d6));
+    return p.squared_distance(b + w*(c - b)) + pn*pn;
+  }
+
+  // Point is inside triangle so return distance to plane
+  return pn*pn;
+}
+//-----------------------------------------------------------------------------
+double TriangleCell::normal(const Cell& cell, std::size_t facet, std::size_t i) const
+{
+  return normal(cell, facet)[i];
+}
+//-----------------------------------------------------------------------------
+Point TriangleCell::normal(const Cell& cell, std::size_t facet) const
+{
+  // Make sure we have facets
+  cell.mesh().init(2, 1);
+
+  // Create facet from the mesh and local facet number
+  Facet f(cell.mesh(), cell.entities(1)[facet]);
+
+  // The normal vector is currently only defined for a triangle in R^2
+  // MER: This code is super for a triangle in R^3 too, this error
+  // could be removed, unless it is here for some other reason.
+  if (cell.mesh().geometry().dim() != 2)
+    dolfin_error("TriangleCell.cpp",
+                 "find normal",
+                 "Normal vector is not defined in dimension %d (only defined when the triangle is in R^2", cell.mesh().geometry().dim());
+
+  // Get global index of opposite vertex
+  const std::size_t v0 = cell.entities(0)[facet];
+
+  // Get global index of vertices on the facet
+  const std::size_t v1 = f.entities(0)[0];
+  const std::size_t v2 = f.entities(0)[1];
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = cell.mesh().geometry();
+
+  // Get the coordinates of the three vertices
+  const Point p0 = geometry.point(v0);
+  const Point p1 = geometry.point(v1);
+  const Point p2 = geometry.point(v2);
+
+  // Subtract projection of p2 - p0 onto p2 - p1
+  Point t = p2 - p1;
+  t /= t.norm();
+  Point n = p2 - p0;
+  n -= n.dot(t)*t;
+
+  // Normalize
+  n /= n.norm();
+
+  return n;
+}
+//-----------------------------------------------------------------------------
+Point TriangleCell::cell_normal(const Cell& cell) const
+{
+  // Get mesh geometry
+  const MeshGeometry& geometry = cell.mesh().geometry();
+
+  // Cell_normal only defined for gdim = 2, 3:
+  const std::size_t gdim = geometry.dim();
+  if (gdim > 3)
+    dolfin_error("TriangleCell.cpp",
+                 "compute cell normal",
+                 "Illegal geometric dimension (%d)", gdim);
+
+  // Get the three vertices as points
+  const unsigned int* vertices = cell.entities(0);
+  const Point p0 = geometry.point(vertices[0]);
+  const Point p1 = geometry.point(vertices[1]);
+  const Point p2 = geometry.point(vertices[2]);
+
+  // Defined cell normal via cross product of first two edges:
+  const Point v01 = p1 - p0;
+  const Point v02 = p2 - p0;
+  Point n = v01.cross(v02);
+
+  // Normalize
+  n /= n.norm();
+
+  return n;
+}
+//-----------------------------------------------------------------------------
+double TriangleCell::facet_area(const Cell& cell, std::size_t facet) const
+{
+  // Create facet from the mesh and local facet number
+  const Facet f(cell.mesh(), cell.entities(1)[facet]);
+
+  // Get global index of vertices on the facet
+  const std::size_t v0 = f.entities(0)[0];
+  const std::size_t v1 = f.entities(0)[1];
+
+  // Get mesh geometry
+  const MeshGeometry& geometry = cell.mesh().geometry();
+
+  // Get the coordinates of the two vertices
+  const double* p0 = geometry.x(v0);
+  const double* p1 = geometry.x(v1);
+
+  // Compute distance between vertices
+  double d = 0.0;
+  for (std::size_t i = 0; i < geometry.dim(); i++)
+  {
+    const double dp = p0[i] - p1[i];
+    d += dp*dp;
+  }
+
+  return std::sqrt(d);
+}
+//-----------------------------------------------------------------------------
+void TriangleCell::order(Cell& cell,
+                 const std::vector<std::size_t>& local_to_global_vertex_indices) const
+{
+  // Sort i - j for i > j: 1 - 0, 2 - 0, 2 - 1
+
+  // Get mesh topology
+  const MeshTopology& topology = cell.mesh().topology();
+
+  // Sort local vertices on edges in ascending order, connectivity 1 - 0
+  if (!topology(1, 0).empty())
+  {
+    dolfin_assert(!topology(2, 1).empty());
+
+    // Get edge indices (local)
+    const unsigned int* cell_edges = cell.entities(1);
+
+    // Sort vertices on each edge
+    for (std::size_t i = 0; i < 3; i++)
+    {
+      unsigned int* edge_vertices = const_cast<unsigned int*>(topology(1, 0)(cell_edges[i]));
+      sort_entities(2, edge_vertices, local_to_global_vertex_indices);
+    }
+  }
+
+  // Sort local vertices on cell in ascending order, connectivity 2 - 0
+  if (!topology(2, 0).empty())
+  {
+    unsigned int* cell_vertices = const_cast<unsigned int*>(cell.entities(0));
+    sort_entities(3, cell_vertices, local_to_global_vertex_indices);
+  }
+
+  // Sort local edges on cell after non-incident vertex, connectivity 2 - 1
+  if (!topology(2, 1).empty())
+  {
+    dolfin_assert(!topology(2, 1).empty());
+
+    // Get cell vertiex and edge indices (local)
+    const unsigned int* cell_vertices = cell.entities(0);
+    unsigned int* cell_edges = const_cast<unsigned int*>(cell.entities(1));
+
+    // Loop over vertices on cell
+    for (std::size_t i = 0; i < 3; i++)
+    {
+      // Loop over edges on cell
+      for (std::size_t j = i; j < 3; j++)
+      {
+        const unsigned int* edge_vertices = topology(1, 0)(cell_edges[j]);
+
+        // Check if the ith vertex of the cell is non-incident with edge j
+        if (std::count(edge_vertices, edge_vertices + 2, cell_vertices[i]) == 0)
+        {
+          // Swap edge numbers
+          std::size_t tmp = cell_edges[i];
+          cell_edges[i] = cell_edges[j];
+          cell_edges[j] = tmp;
+          break;
+        }
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+bool TriangleCell::collides(const Cell& cell, const Point& point) const
+{
+  return CollisionDetection::collides(cell, point);
+}
+//-----------------------------------------------------------------------------
+bool TriangleCell::collides(const Cell& cell, const MeshEntity& entity) const
+{
+  return CollisionDetection::collides(cell, entity);
+}
+//-----------------------------------------------------------------------------
+std::vector<double>
+TriangleCell::triangulate_intersection(const Cell& c0, const Cell& c1) const
+{
+  return IntersectionTriangulation::triangulate_intersection(c0, c1);
+}
+//-----------------------------------------------------------------------------
+std::string TriangleCell::description(bool plural) const
+{
+  if (plural)
+    return "triangles";
+  return "triangle";
+}
+//-----------------------------------------------------------------------------
+std::size_t TriangleCell::find_edge(std::size_t i, const Cell& cell) const
+{
+  // Get vertices and edges
+  const unsigned int* v = cell.entities(0);
+  const unsigned int* e = cell.entities(1);
+  dolfin_assert(v);
+  dolfin_assert(e);
+
+  // Look for edge satisfying ordering convention
+  for (std::size_t j = 0; j < 3; j++)
+  {
+    const unsigned int* ev = cell.mesh().topology()(1, 0)(e[j]);
+    dolfin_assert(ev);
+    if (ev[0] != v[i] && ev[1] != v[i])
+      return j;
+  }
+
+  // We should not reach this
+  dolfin_error("TriangleCell.cpp",
+               "find specified edge in cell",
+               "Edge really not found");
+  return 0;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/mesh/TriangleCell.h b/dolfin/mesh/TriangleCell.h
new file mode 100644
index 0000000..7b7ab24
--- /dev/null
+++ b/dolfin/mesh/TriangleCell.h
@@ -0,0 +1,118 @@
+// Copyright (C) 2006-2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Kristoffer Selim, 2008.
+// Modified by Jan Blechta 2013
+//
+// First added:  2006-06-05
+// Last changed: 2014-01-06
+
+#ifndef __TRIANGLE_CELL_H
+#define __TRIANGLE_CELL_H
+
+#include <vector>
+#include "CellType.h"
+
+namespace dolfin
+{
+
+  /// This class implements functionality for triangular meshes.
+
+  class TriangleCell : public CellType
+  {
+  public:
+
+    /// Specify cell type and facet type
+    TriangleCell() : CellType(triangle, interval) {}
+
+    /// Return topological dimension of cell
+    std::size_t dim() const;
+
+    /// Return number of entitites of given topological dimension
+    std::size_t num_entities(std::size_t dim) const;
+
+    /// Return number of vertices for entity of given topological dimension
+    std::size_t num_vertices(std::size_t dim) const;
+
+    /// Return orientation of the cell
+    std::size_t orientation(const Cell& cell) const;
+
+    /// Create entities e of given topological dimension from vertices v
+    void create_entities(std::vector<std::vector<unsigned int> >& e,
+                         std::size_t dim,
+                         const unsigned int* v) const;
+
+    /// Refine cell uniformly
+    void refine_cell(Cell& cell, MeshEditor& editor,
+                     std::size_t& current_cell) const;
+
+    /// Compute (generalized) volume (area) of triangle
+    double volume(const MeshEntity& triangle) const;
+
+    /// Compute diameter of triangle
+    double diameter(const MeshEntity& triangle) const;
+
+    /// Compute squared distance to given point
+    double squared_distance(const Cell& cell, const Point& point) const;
+
+    /// Compute squared distance to given point. This version takes
+    /// the three vertex coordinates as 3D points. This makes it
+    /// possible to reuse this function for computing the (squared)
+    /// distance to a tetrahedron.
+    static double squared_distance(const Point& point,
+                                   const Point& a,
+                                   const Point& b,
+                                   const Point& c);
+
+    /// Compute component i of normal of given facet with respect to the cell
+    double normal(const Cell& cell, std::size_t facet, std::size_t i) const;
+
+    /// Compute of given facet with respect to the cell
+    Point normal(const Cell& cell, std::size_t facet) const;
+
+    /// Compute normal to given cell (viewed as embedded in 3D)
+    Point cell_normal(const Cell& cell) const;
+
+    /// Compute the area/length of given facet with respect to the cell
+    double facet_area(const Cell& cell, std::size_t facet) const;
+
+    /// Order entities locally
+    void order(Cell& cell,
+               const std::vector<std::size_t>& local_to_global_vertex_indices) const;
+
+    /// Check whether given point collides with cell
+    bool collides(const Cell& cell, const Point& point) const;
+
+    /// Check whether given entity collides with cell
+    bool collides(const Cell& cell, const MeshEntity& entity) const;
+
+    /// Compute triangulation of intersection of two cells
+    std::vector<double>
+    triangulate_intersection(const Cell& c0, const Cell& c1) const;
+
+    /// Return description of cell type
+    std::string description(bool plural) const;
+
+  private:
+
+    // Find local index of edge i according to ordering convention
+    std::size_t find_edge(std::size_t i, const Cell& cell) const;
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/Vertex.h b/dolfin/mesh/Vertex.h
new file mode 100644
index 0000000..d4832ca
--- /dev/null
+++ b/dolfin/mesh/Vertex.h
@@ -0,0 +1,87 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-06-01
+// Last changed: 2013-01-09
+
+#ifndef __VERTEX_H
+#define __VERTEX_H
+
+#include <memory>
+
+#include <dolfin/geometry/Point.h>
+#include "Mesh.h"
+#include "MeshEntity.h"
+#include "MeshEntityIteratorBase.h"
+#include "MeshFunction.h"
+
+namespace dolfin
+{
+
+  /// A Vertex is a MeshEntity of topological dimension 0.
+
+  class Vertex : public MeshEntity
+  {
+  public:
+
+    /// Create vertex on given mesh
+    Vertex(const Mesh& mesh, std::size_t index) : MeshEntity(mesh, 0, index) {}
+
+    /// Create vertex from mesh entity
+    Vertex(MeshEntity& entity) : MeshEntity(entity.mesh(), 0, entity.index()) {}
+
+    /// Destructor
+    ~Vertex() {}
+
+    /// Return value of vertex coordinate i
+    double x(std::size_t i) const
+    { return _mesh->geometry().x(_local_index, i); }
+
+    /// Return vertex coordinates as a 3D point value
+    Point point() const
+    { return _mesh->geometry().point(_local_index); }
+
+    /// Return array of vertex coordinates (const version)
+    const double* x() const
+    { return _mesh->geometry().x(_local_index); }
+
+  };
+
+  /// A VertexIterator is a MeshEntityIterator of topological dimension 0
+  typedef MeshEntityIteratorBase<Vertex> VertexIterator;
+
+  /// A VertexFunction is a MeshFunction of topological dimension 0.
+  template <typename T> class VertexFunction : public MeshFunction<T>
+  {
+  public:
+
+    VertexFunction(const Mesh& mesh) : MeshFunction<T>(mesh, 0) {}
+
+    VertexFunction(std::shared_ptr<const Mesh> mesh)
+      : MeshFunction<T>(mesh, 0) {}
+
+    VertexFunction(const Mesh& mesh, const T& value)
+      : MeshFunction<T>(mesh, 0, value) {}
+
+    VertexFunction(std::shared_ptr<const Mesh> mesh, const T& value)
+      : MeshFunction<T>(mesh, 0, value) {}
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/mesh/dolfin_mesh.h b/dolfin/mesh/dolfin_mesh.h
new file mode 100644
index 0000000..4ca20ca
--- /dev/null
+++ b/dolfin/mesh/dolfin_mesh.h
@@ -0,0 +1,40 @@
+#ifndef __DOLFIN_MESH_H
+#define __DOLFIN_MESH_H
+
+// DOLFIN mesh interface
+
+#include <dolfin/mesh/CellType.h>
+#include <dolfin/mesh/MeshTopology.h>
+#include <dolfin/mesh/MeshGeometry.h>
+#include <dolfin/mesh/MeshDomains.h>
+#include <dolfin/mesh/MeshData.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEntity.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/MeshEntityIteratorBase.h>
+#include <dolfin/mesh/SubsetIterator.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/Edge.h>
+#include <dolfin/mesh/Face.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/FacetCell.h>
+#include <dolfin/mesh/MeshConnectivity.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/DynamicMeshEditor.h>
+#include <dolfin/mesh/LocalMeshValueCollection.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/MeshValueCollection.h>
+#include <dolfin/mesh/MeshColoring.h>
+#include <dolfin/mesh/MeshRenumbering.h>
+#include <dolfin/mesh/MeshTransformation.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/mesh/SubDomain.h>
+#include <dolfin/mesh/SubMesh.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/mesh/DomainBoundary.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/mesh/PeriodicBoundaryComputation.h>
+#include <dolfin/mesh/MeshQuality.h>
+
+#endif
diff --git a/dolfin/multistage/MultiStageScheme.cpp b/dolfin/multistage/MultiStageScheme.cpp
new file mode 100644
index 0000000..2c8233d
--- /dev/null
+++ b/dolfin/multistage/MultiStageScheme.cpp
@@ -0,0 +1,266 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-15
+// Last changed: 2014-03-05
+
+#include <sstream>
+#include <memory>
+#include <dolfin/log/log.h>
+
+#include "MultiStageScheme.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+MultiStageScheme::MultiStageScheme(
+    std::vector<std::vector<std::shared_ptr<const Form> > > stage_forms, 
+    std::shared_ptr<const Form> last_stage, 
+    std::vector<std::shared_ptr<Function> > stage_solutions,
+    std::shared_ptr<Function> u, 
+    std::shared_ptr<Constant> t, 
+    std::shared_ptr<Constant> dt,
+    std::vector<double> dt_stage_offset, 
+    std::vector<int> jacobian_indices,
+    unsigned int order,
+    const std::string name,
+    const std::string human_form) : 
+  Variable(name, ""), _stage_forms(stage_forms), _last_stage(last_stage), 
+  _stage_solutions(stage_solutions), _u(u), _t(t), _dt(dt), 
+  _dt_stage_offset(dt_stage_offset), _jacobian_indices(jacobian_indices), 
+  _order(order), _implicit(false), _human_form(human_form)
+{
+  _check_arguments();
+}
+//-----------------------------------------------------------------------------
+MultiStageScheme::MultiStageScheme(
+    std::vector<std::vector<std::shared_ptr<const Form> > > stage_forms, 
+    std::shared_ptr<const Form> last_stage, 
+    std::vector<std::shared_ptr<Function> > stage_solutions,
+    std::shared_ptr<Function> u, 
+    std::shared_ptr<Constant> t, 
+    std::shared_ptr<Constant> dt,
+    std::vector<double> dt_stage_offset, 
+    std::vector<int> jacobian_indices,
+    unsigned int order,
+    const std::string name,
+    const std::string human_form,
+    std::vector<const DirichletBC* > bcs) :
+  Variable(name, ""), _stage_forms(stage_forms), _last_stage(last_stage), 
+  _stage_solutions(stage_solutions), _u(u), _t(t), _dt(dt), 
+  _dt_stage_offset(dt_stage_offset), _jacobian_indices(jacobian_indices), 
+  _order(order), _implicit(false), _human_form(human_form), _bcs(bcs)
+{
+  _check_arguments();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::vector<std::shared_ptr<const Form> > >&
+MultiStageScheme::stage_forms()
+{
+  return _stage_forms;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Form> MultiStageScheme::last_stage()
+{
+  return _last_stage;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::shared_ptr<Function> >& MultiStageScheme::stage_solutions()
+{
+  return _stage_solutions;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Function> MultiStageScheme::solution()
+{
+  return _u;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const Function> MultiStageScheme::solution() const
+{
+  return _u;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Constant> MultiStageScheme::t()
+{
+  return _t;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Constant> MultiStageScheme::dt()
+{
+  return _dt;
+}
+//-----------------------------------------------------------------------------
+const std::vector<double>& MultiStageScheme::dt_stage_offset() const
+{
+  return _dt_stage_offset;
+}
+//-----------------------------------------------------------------------------
+unsigned int MultiStageScheme::order() const
+{
+  return _order;
+}
+//-----------------------------------------------------------------------------
+std::vector<const DirichletBC* > MultiStageScheme::bcs() const
+{
+  return _bcs;
+}
+//-----------------------------------------------------------------------------
+bool MultiStageScheme::implicit(unsigned int stage) const
+{
+  if (stage >= _stage_forms.size())
+  {
+    dolfin_error("MultiStageScheme.cpp",
+		 "quering if stage is implicit",
+		 "Expecting a stage less than the number of total stages in "
+		 "the scheme.");
+  }
+
+  return _stage_forms[stage].size() == 2;
+}
+//-----------------------------------------------------------------------------
+
+bool MultiStageScheme::implicit() const
+{
+  return _implicit;
+}
+//-----------------------------------------------------------------------------
+int MultiStageScheme::jacobian_index(unsigned int stage) const
+{
+  if (stage >= _jacobian_indices.size())
+  {
+    dolfin_error("MultiStageScheme.cpp",
+		 "quering for jacobian index",
+		 "Expecting a stage less than the number of total stages in "
+		 "the scheme.");
+  }
+
+  return _jacobian_indices[stage];
+}
+//-----------------------------------------------------------------------------
+std::string MultiStageScheme::str(bool verbose) const
+{
+  if (!verbose)
+    return name();
+
+  std::stringstream s;
+  s << name() << std::endl << _human_form;
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void MultiStageScheme::_check_arguments()
+{
+  // Check number of stage sollutions is same as number of stage forms
+  if (_stage_solutions.size()!=_stage_forms.size())
+  {
+    dolfin_error("MultiStageScheme.cpp",
+		 "construct MultiStageScheme",
+		 "Expecting the number of stage solutions to be the sames as "\
+		 "number of stage forms");
+  }
+
+  // Check that the number of coefficients in last form is the same as 
+  // number of stages 
+  /*
+    if (_last_stage->num_coefficients() != _stage_forms.size())
+    dolfin_error("MultiStageScheme.cpp",
+  		 "construct MultiStageScheme",
+  		 "Expecting the number of stage solutions to be the sames as " \
+  		 "number of coefficients in the last form");
+  */
+  
+  // Check solution is in the same space as the last stage solution
+  if (!_u->in(*_stage_solutions[_stage_solutions.size()-1]->function_space()))
+  {
+    dolfin_error("MultiStageScheme.cpp",
+		 "construct MultiStageScheme",
+		 "Expecting all solutions to be in the same FunctionSpace");
+  }
+
+  // Check number of passed stage forms
+  for (unsigned int i=0; i < _stage_forms.size();i++)
+  {
+    // Check solution is in the same space as the stage solution
+    if (!_u->in(*_stage_solutions[i]->function_space()))
+    {
+      dolfin_error("MultiStageScheme.cpp",
+		   "construct MultiStageScheme",
+		   "Expecting all solutions to be in the same FunctionSpace");
+    }
+
+    // Check we have correct number of forms
+    if (_stage_forms[i].size()==0 || _stage_forms[i].size()>2)
+    {
+      dolfin_error("MultiStageScheme.cpp",
+		   "construct MultiStageScheme",
+		   "Expecting stage_forms to only include vectors of size 1 or 2");
+    }
+
+    // Check if Scheme is implicit
+    if (_stage_forms[i].size()==2)
+    {
+      _implicit = true;
+
+      // First form should be the linear (in testfunction) form
+      if (_stage_forms[i][0]->rank() != 1)
+      {
+	dolfin_error("MultiStageScheme.cpp",
+		     "construct MultiStageScheme",
+		     "Expecting the right-hand side of stage form %d to be a "\
+		     "linear form (not rank %d)", i, _stage_forms[i][0]->rank());
+      }
+
+      // Second form should be the bilinear form
+      if (_stage_forms[i][1]->rank() != 2)
+      {
+	dolfin_error("MultiStageScheme.cpp",
+		     "construct MultiStageScheme",
+		     "Expecting the left-hand side of stage form %d to be a "\
+		     "linear form (not rank %d)", i, _stage_forms[i][1]->rank());
+      }
+
+      // Check that function space of solution variable matches trial space
+      if (!_stage_solutions[i]->in(*_stage_forms[i][1]->function_space(1)))
+      {
+	dolfin_error("MultiStageScheme.cpp",
+		     "construct MultiStageScheme",
+		     "Expecting the stage solution %d to be a member of the "
+		     "trial space of stage form %d", i, i);
+      }
+    }
+    else
+    {
+      // Check explicit stage form
+      if (_stage_forms[i][0]->rank() != 1)
+      {
+	dolfin_error("MultiStageScheme.cpp",
+		     "construct MultiStageScheme",
+		     "Expecting stage form %d to be a linear form (not "\
+		     "rank %d)", i, _stage_forms[i][0]->rank());
+      }
+
+      // Check that function space of solution variable matches trial space
+      if (!_stage_solutions[i]->in(*_stage_forms[i][0]->function_space(0)))
+      {
+	dolfin_error("MultiStageScheme.cpp",
+		     "construct MultiStageScheme",
+		     "Expecting the stage solution %d to be a member of the "
+		     "test space of stage form %d", i, i);
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/multistage/MultiStageScheme.h b/dolfin/multistage/MultiStageScheme.h
new file mode 100644
index 0000000..fa75a2c
--- /dev/null
+++ b/dolfin/multistage/MultiStageScheme.h
@@ -0,0 +1,163 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-15
+// Last changed: 2014-03-05
+
+#ifndef __BUTCHERSCHEME_H
+#define __BUTCHERSCHEME_H
+
+#include <vector>
+#include <memory>
+
+#include <dolfin/common/Variable.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/fem/Form.h>
+
+namespace dolfin
+{
+
+  /// This class is a place holder for forms and solutions for a multi stage 
+  /// Butcher tableau based method
+
+  // Forward declarations
+  class Form;
+  class Function;
+  class DirichletBC;
+  class Constant;
+
+  class MultiStageScheme : public Variable
+  {
+  public:
+
+    /// Constructor
+    /// FIXME: This constructor is a MESS. Needs clean up...
+    MultiStageScheme(std::vector<std::vector<std::shared_ptr<const Form> > > stage_forms, 
+		  std::shared_ptr<const Form> last_stage, 
+		  std::vector<std::shared_ptr<Function> > stage_solutions,
+		  std::shared_ptr<Function> u, 
+		  std::shared_ptr<Constant> t, 
+		  std::shared_ptr<Constant> dt,
+		  std::vector<double> dt_stage_offset, 
+		  std::vector<int> jacobian_indices,
+		  unsigned int order,
+		  const std::string name,
+		  const std::string human_form);
+
+    /// Constructor with Boundary conditions
+    MultiStageScheme(std::vector<std::vector<std::shared_ptr<const Form> > > stage_forms, 
+		  std::shared_ptr<const Form> last_stage, 
+		  std::vector<std::shared_ptr<Function> > stage_solutions,
+		  std::shared_ptr<Function> u, 
+		  std::shared_ptr<Constant> t, 
+		  std::shared_ptr<Constant> dt, 
+		  std::vector<double> dt_stage_offset, 
+		  std::vector<int> jacobian_indices,
+		  unsigned int order,
+		  const std::string name,
+		  const std::string human_form,
+		  std::vector<const DirichletBC* > bcs);
+
+    /// Return the stages
+    std::vector<std::vector<std::shared_ptr<const Form> > >& stage_forms();
+
+    /// Return the last stage
+    std::shared_ptr<const Form> last_stage();
+
+    /// Return stage solutions
+    std::vector<std::shared_ptr<Function> >& stage_solutions();
+    
+    /// Return solution variable
+    std::shared_ptr<Function> solution();
+
+    /// Return solution variable (const version)
+    std::shared_ptr<const Function> solution() const;
+
+    /// Return local time
+    std::shared_ptr<Constant> t();
+
+    /// Return local timestep
+    std::shared_ptr<Constant> dt();
+
+    /// Return local timestep
+    const std::vector<double>& dt_stage_offset() const;
+
+    /// Return the order of the scheme
+    unsigned int order() const;
+
+    /// Return boundary conditions
+    std::vector<const DirichletBC* > bcs() const;
+
+    /// Return true if stage is implicit
+    bool implicit(unsigned int stage) const;
+
+    /// Return true if the whole scheme is implicit
+    bool implicit() const;
+
+    // Return a distinct jacobian index for a given stage if negative the 
+    // stage is explicit and hence no jacobian needed.
+    int jacobian_index(unsigned int stage) const;
+
+    /// Return informal string representation (pretty-print)
+    virtual std::string str(bool verbose) const;
+
+  private:
+    
+    // Check sanity of arguments
+    void _check_arguments();
+
+    // Vector of forms for the different RK stages
+    std::vector<std::vector<std::shared_ptr<const Form> > > _stage_forms;
+
+    // A linear combination of solutions for the last stage
+    std::shared_ptr<const Form> _last_stage;
+    
+    // Solutions for the different stages
+    std::vector<std::shared_ptr<Function> > _stage_solutions;
+
+    // The solution
+    std::shared_ptr<Function> _u;
+
+    // The local time 
+    std::shared_ptr<Constant> _t;
+
+    // The local time step
+    std::shared_ptr<Constant> _dt;
+    
+    // The time step offset. (c from the ButcherTableau)
+    std::vector<double> _dt_stage_offset;
+
+    // Map for distinct storage of jacobians
+    std::vector<int> _jacobian_indices;
+
+    // The order of the scheme
+    unsigned int _order;
+
+    // Is the scheme implicit
+    bool _implicit;
+
+    // A pretty print representation of the form
+    std::string _human_form;
+
+    // The boundary conditions
+    std::vector<const DirichletBC* > _bcs;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/multistage/PointIntegralSolver.cpp b/dolfin/multistage/PointIntegralSolver.cpp
new file mode 100644
index 0000000..e5dea7b
--- /dev/null
+++ b/dolfin/multistage/PointIntegralSolver.cpp
@@ -0,0 +1,824 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-15
+// Last changed: 2014-04-09
+
+#include <cmath>
+#include <algorithm>
+#include <memory>
+
+#include <dolfin/log/log.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/Constant.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/nls/NewtonSolver.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/fem/GenericDofMap.h>
+#include <dolfin/fem/UFC.h>
+
+#include "MultiStageScheme.h"
+#include "PointIntegralSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+PointIntegralSolver::PointIntegralSolver(std::shared_ptr<MultiStageScheme> scheme) :
+  Variable("PointIntegralSolver", "unnamed"), _scheme(scheme),
+  _mesh(_scheme->stage_forms()[0][0]->mesh()),
+  _dofmap(*_scheme->stage_forms()[0][0]->function_space(0)->dofmap()),
+  _system_size(_dofmap.num_entity_dofs(0)), _dof_offset(_mesh.type().num_entities(0)),
+  _num_stages(_scheme->stage_forms().size()), _local_to_local_dofs(_system_size),
+  _vertex_map(), _local_to_global_dofs(_system_size),
+  _local_stage_solutions(_scheme->stage_solutions().size()),
+  _u0(_system_size), _residual(_system_size), _y(_system_size), _dx(_system_size),
+  _ufcs(), _coefficient_index(), _recompute_jacobian(),
+  _jacobians(), _eta(1.0), _num_jacobian_computations(0)
+{
+  Timer construct_pis("Construct PointIntegralSolver");
+
+  // Set parameters
+  parameters = default_parameters();
+
+  _check_forms();
+  _init();
+}
+//-----------------------------------------------------------------------------
+PointIntegralSolver::~PointIntegralSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::reset_newton_solver()
+{
+  _eta = parameters("newton_solver")["eta_0"];
+
+  for (unsigned int i=0; i < _recompute_jacobian.size(); i++)
+    _recompute_jacobian[i] = true;
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::reset_stage_solutions()
+{
+  // Iterate over stage forms
+  for (unsigned int stage=0; stage<_num_stages; stage++)
+  {
+    // Reset global stage solutions
+    *_scheme->stage_solutions()[stage]->vector() = 0.0;
+
+    // Reset local stage solutions
+    for (unsigned int row=0; row < _system_size; row++)
+      _local_stage_solutions[stage][row] = 0.0;
+
+  }
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::step(double dt)
+{
+
+  const bool reset_stage_solutions_ = parameters["reset_stage_solutions"];
+  const bool reset_newton_solver_ = parameters("newton_solver")["reset_each_step"];
+
+  // Check for reseting stage solutions
+  if (reset_stage_solutions_)
+    reset_stage_solutions();
+
+  // Check for reseting newtonsolver for each time step
+  if (reset_newton_solver_)
+    reset_newton_solver();
+
+  Timer t_step("PointIntegralSolver::step");
+
+  dolfin_assert(dt > 0.0);
+
+  // Update time constant of scheme
+  *_scheme->dt() = dt;
+
+  // Time at start of timestep
+  const double t0 = *_scheme->t();
+
+  // Get ownership range
+  const dolfin::la_index n0 = _dofmap.ownership_range().first;
+  const dolfin::la_index n1 = _dofmap.ownership_range().second;
+
+  // Iterate over vertices
+  ufc::cell ufc_cell;
+  std::vector<double> vertex_coordinates;
+  for (std::size_t vert_ind=0; vert_ind < _mesh.num_vertices(); ++vert_ind)
+  {
+
+    // Cell containing vertex
+    const Cell cell(_mesh, _vertex_map[vert_ind].first);
+    cell.get_vertex_coordinates(vertex_coordinates);
+    cell.get_cell_data(ufc_cell);
+
+    // Get all dofs for cell
+    // FIXME: Shold we include logics about empty dofmaps?
+    const std::vector<dolfin::la_index>& cell_dofs
+      = _dofmap.cell_dofs(cell.index());
+
+    // Tabulate local-local dofmap
+    _dofmap.tabulate_entity_dofs(_local_to_local_dofs, 0,
+				 _vertex_map[vert_ind].second);
+
+    // Fill local to global dof map and check that the dof is owned
+    bool owns_all_dofs = true;
+    for (unsigned int row=0; row < _system_size; row++)
+    {
+      _local_to_global_dofs[row] = cell_dofs[_local_to_local_dofs[row]];
+      if (_local_to_global_dofs[row] < n0 || n1 <=_local_to_global_dofs[row])
+      {
+	owns_all_dofs = false;
+	break;
+      }
+    }
+
+    // If not owning all dofs
+    if (!owns_all_dofs)
+      continue;
+
+    // Iterate over stage forms
+    for (unsigned int stage=0; stage<_num_stages; stage++)
+    {
+
+      // Update cell
+      // TODO: Pass suitable bool vector here to avoid tabulating all coefficient dofs:
+      _ufcs[stage][0]->update(cell, vertex_coordinates, ufc_cell);
+                              //some_integral.enabled_coefficients());
+
+      // Check if we have an explicit stage (only 1 form)
+      if (_ufcs[stage].size() == 1)
+      {
+	_solve_explicit_stage(vert_ind, stage, ufc_cell, vertex_coordinates);
+      }
+
+      // or an implicit stage (2 forms)
+      else
+      {
+	_solve_implicit_stage(vert_ind, stage, cell, ufc_cell, vertex_coordinates);
+      }
+
+    }
+
+    Timer t_last_stage("Last stage: tabulate_tensor");
+
+    // Last stage point integral
+    const ufc::point_integral& integral = *_last_stage_ufc->default_point_integral;
+
+    // Update coeffcients for last stage
+    // TODO: Pass suitable bool vector here to avoid tabulating all coefficient dofs:
+    _last_stage_ufc->update(cell, vertex_coordinates, ufc_cell);
+                            //integral.enabled_coefficients());
+
+    // Tabulate cell tensor
+    integral.tabulate_tensor(_last_stage_ufc->A.data(), _last_stage_ufc->w(),
+			     vertex_coordinates.data(),
+			     _vertex_map[vert_ind].second,
+                             ufc_cell.orientation);
+
+    // Update solution with a tabulation of the last stage
+    for (unsigned int row=0; row < _system_size; row++)
+      _y[row] = _last_stage_ufc->A[_local_to_local_dofs[row]];
+
+    // Update global solution with last stage
+    _scheme->solution()->vector()->set(_y.data(), _local_to_global_dofs.size(),
+				       _local_to_global_dofs.data());
+  }
+
+  for (unsigned int stage=0; stage<_num_stages; stage++)
+    _scheme->stage_solutions()[stage]->vector()->apply("insert");
+
+  _scheme->solution()->vector()->apply("insert");
+
+  // Update time
+  *_scheme->t() = t0 + dt;
+
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::_solve_explicit_stage(std::size_t vert_ind,
+                                                unsigned int stage,
+                                                const ufc::cell& ufc_cell,
+                                                const std::vector<double>& vertex_coordinates)
+{
+  Timer t_expl("Explicit stage");
+
+  // Local vertex ind
+  const unsigned int local_vert = _vertex_map[vert_ind].second;
+
+  // Point integral
+  const ufc::point_integral& integral = *_ufcs[stage][0]->default_point_integral;
+
+  // Tabulate cell tensor
+  Timer t_expl_tt("Explicit stage: tabulate_tensor");
+  integral.tabulate_tensor(_ufcs[stage][0]->A.data(), _ufcs[stage][0]->w(),
+			   vertex_coordinates.data(), local_vert,
+                           ufc_cell.orientation);
+  t_expl_tt.stop();
+
+  // Extract vertex dofs from tabulated tensor and put them into the local
+  // stage solution vector
+  // Extract vertex dofs from tabulated tensor
+  for (unsigned int row=0; row < _system_size; row++)
+  {
+    _local_stage_solutions[stage][row] = _ufcs[stage][0]->A[_local_to_local_dofs[row]];
+  }
+
+  // Put solution back into global stage solution vector
+  // NOTE: This so an UFC.update (coefficient restriction) would just work
+  _scheme->stage_solutions()[stage]->vector()->set(
+		 _local_stage_solutions[stage].data(), _system_size,
+		 _local_to_global_dofs.data());
+
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::_solve_implicit_stage(std::size_t vert_ind,
+                                                unsigned int stage, const Cell& cell,
+                                                const ufc::cell& ufc_cell,
+                                                const std::vector<double>& vertex_coordinates)
+{
+
+  Timer t_impl("Implicit stage");
+
+  // Do a simplified newton solve
+  _simplified_newton_solve(vert_ind, stage, cell, ufc_cell, vertex_coordinates);
+
+  // Put solution back into global stage solution vector
+  _scheme->stage_solutions()[stage]->vector()->set(_local_stage_solutions[stage].data(), \
+						   _system_size,
+						   _local_to_global_dofs.data());
+
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::step_interval(double t0, double t1, double dt)
+{
+  if (dt <= 0.0)
+  {
+    dolfin_error("PointIntegralSolver.cpp",
+		 "stepping PointIntegralSolver",
+		 "Expecting a positive dt");
+  }
+
+  if (t0 >= t1)
+  {
+    dolfin_error("PointIntegralSolver.cpp",
+		 "stepping PointIntegralSolver",
+		 "Expecting t0 to be smaller than t1");
+  }
+
+  // Set start time
+  *_scheme->t() = t0;
+  double t = t0;
+  double next_dt = std::min(t1-t, dt);
+
+  // Step interval
+  while (t + next_dt <= t1)
+  {
+    if (next_dt < DOLFIN_EPS)
+      break;
+    step(next_dt);
+    t = *_scheme->t();
+    next_dt = std::min(t1-t, dt);
+  }
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::_compute_jacobian(std::vector<double>& jac,
+					    const std::vector<double>& u,
+					    unsigned int local_vert,
+					    UFC& loc_ufc, const Cell& cell,
+					    const ufc::cell& ufc_cell,
+					    int coefficient_index,
+					    const std::vector<double>& vertex_coordinates)
+{
+  const ufc::point_integral& J_integral = *loc_ufc.default_point_integral;
+
+  //Timer _timer_compute_jac("Implicit stage: Compute jacobian");
+  //Timer t_impl_update("Update_cell");
+  // TODO: Pass suitable bool vector here to avoid tabulating all coefficient dofs:
+  loc_ufc.update(cell, vertex_coordinates, ufc_cell);
+                 //J_integral.enabled_coefficients());
+  //t_impl_update.stop();
+
+  // If there is a solution coefficient in the jacobian form
+  if (coefficient_index>0)
+  {
+    // Put solution back into restricted coefficients before tabulate new jacobian
+    for (unsigned int row=0; row < _system_size; row++)
+    {
+      loc_ufc.w()[coefficient_index][_local_to_local_dofs[row]] = u[row];
+    }
+  }
+
+  // Tabulate Jacobian
+  Timer t_impl_tt_jac("Implicit stage: tabulate_tensor (J)");
+  J_integral.tabulate_tensor(loc_ufc.A.data(), loc_ufc.w(),
+			     vertex_coordinates.data(),
+			     local_vert,
+                             ufc_cell.orientation);
+  t_impl_tt_jac.stop();
+
+  // Extract vertex dofs from tabulated tensor
+  //Timer t_impl_update_jac("Implicit stage: update_jac");
+  for (unsigned int row=0; row < _system_size; row++)
+    for (unsigned int col=0; col < _system_size; col++)
+      jac[row*_system_size + col] = loc_ufc.A[_local_to_local_dofs[row]*
+					      _dof_offset*_system_size +
+					      _local_to_local_dofs[col]];
+  //t_impl_update_jac.stop();
+
+  // LU factorize Jacobian
+  //Timer lu_factorize("Implicit stage: LU factorize");
+  _lu_factorize(jac);
+  _num_jacobian_computations += 1;
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::_lu_factorize(std::vector<double>& A)
+{
+
+  // Local variables
+  double sum;
+  const int system_size = _system_size;
+
+  for (int k = 1; k < system_size; k++)
+  {
+
+    for (int i = 0; i <= k-1; ++i)
+    {
+
+      sum = 0.0;
+      for (int r = 0; r <= i-1; r++)
+      {
+        sum += A[i*_system_size+r]*A[r*_system_size+k];
+      }
+
+      A[i*_system_size+k] -=sum;
+
+      sum = 0.0;
+      for (int r = 0; r <= i-1; r++)
+      {
+        sum += A[k*_system_size+r]*A[r*_system_size+i];
+      }
+
+      A[k*_system_size+i] = (A[k*_system_size+i]-sum)/A[i*_system_size+i];
+
+    }
+
+    sum = 0.0;
+    for (int r = 0; r <= k-1; r++)
+    {
+      sum += A[k*_system_size+r]*A[r*_system_size+k];
+    }
+
+    A[k*_system_size+k] -= sum;
+
+  }
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::_forward_backward_subst(const std::vector<double>& A,
+						  const std::vector<double>& b,
+						  std::vector<double>& x) const
+{
+  // solves Ax = b with forward backward substitution, provided that
+  // A is already LU factorized
+
+  double sum;
+
+  x[0] = b[0];
+
+  // Forward
+  for (unsigned int i=1; i < _system_size; ++i)
+  {
+    sum = 0.0;
+    for (unsigned int j=0; j <= i-1; ++j)
+    {
+      sum = sum + A[i*_system_size+j]*x[j];
+    }
+
+    x[i] = b[i] -sum;
+  }
+
+  const unsigned int _system_size_m_1 = _system_size-1;
+  x[_system_size_m_1] = x[_system_size_m_1]/\
+    A[_system_size_m_1*_system_size+_system_size_m_1];
+
+  // Backward
+  for (int i = _system_size-2; i >= 0; i--)
+  {
+    sum = 0;
+    for (unsigned int j=i+1; j < _system_size; ++j)
+    {
+      sum = sum +A[i*_system_size+j]*x[j];
+    }
+
+    x[i] = (x[i]-sum)/A[i*_system_size+i];
+  }
+}
+//-----------------------------------------------------------------------------
+double PointIntegralSolver::_norm(const std::vector<double>& vec) const
+{
+  double l2_norm = 0;
+
+  for (unsigned int i = 0; i < vec.size(); ++i)
+    l2_norm += vec[i]*vec[i];
+
+  l2_norm = std::sqrt(l2_norm);
+  return l2_norm;
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::_check_forms()
+{
+  // Iterate over stage forms and check they include point integrals
+  std::vector<std::vector<std::shared_ptr<const Form> > >& stage_forms
+    = _scheme->stage_forms();
+  for (unsigned int i=0; i < stage_forms.size(); i++)
+  {
+    for (unsigned int j=0; j < stage_forms[i].size(); j++)
+    {
+      // Check form includes at least PointIntegral
+      if (!stage_forms[i][j]->ufc_form()->has_point_integrals())
+      {
+	dolfin_error("PointIntegralSolver.cpp",
+		     "constructing PointIntegralSolver",
+		     "Expecting form to have at least 1 PointIntegral");
+      }
+
+      // Num dofs per vertex
+      const GenericDofMap& dofmap = *stage_forms[i][j]->function_space(0)->dofmap();
+      const unsigned int dofs_per_vertex = dofmap.num_entity_dofs(0);
+      const unsigned int vert_per_cell = _mesh.topology()(_mesh.topology().dim(), 0).size(0);
+
+      if (vert_per_cell*dofs_per_vertex != dofmap.max_cell_dimension())
+      {
+      	dolfin_error("PointIntegralSolver.cpp",
+      		     "constructing PointIntegralSolver",
+      		     "Expecting test space to only have dofs on vertices");
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::_init()
+{
+  // Get stage forms
+  std::vector<std::vector<std::shared_ptr<const Form> > >& stage_forms
+    = _scheme->stage_forms();
+
+  // Init local stage solutions
+  for (unsigned int stage=0; stage < _num_stages; stage++)
+    _local_stage_solutions[stage].resize(_system_size);
+
+  // Init coefficient index and ufcs
+  _coefficient_index.resize(stage_forms.size());
+  _ufcs.resize(stage_forms.size());
+
+  // Initiate jacobian matrices
+  if (_scheme->implicit())
+  {
+    // First count the number of distinct jacobians
+    int max_jacobian_index = 0;
+    for (unsigned int stage=0; stage < _num_stages; stage++)
+      max_jacobian_index = std::max(_scheme->jacobian_index(stage),
+				    max_jacobian_index);
+
+    // Create memory for jacobians
+    _jacobians.resize(max_jacobian_index+1);
+    for (int i=0; i<=max_jacobian_index; i++)
+      _jacobians[i].resize(_system_size*_system_size);
+    _recompute_jacobian.resize(max_jacobian_index+1, true);
+
+  }
+
+  // Create last stage UFC form
+  _last_stage_ufc = std::make_shared<UFC>(*_scheme->last_stage());
+
+  // Iterate over stages and collect information
+  for (unsigned int stage = 0; stage < stage_forms.size(); stage++)
+  {
+    // Create a UFC object for first form
+    _ufcs[stage].push_back(std::make_shared<UFC>(*stage_forms[stage][0]));
+
+    //  If implicit stage
+    if (stage_forms[stage].size()==2)
+    {
+      // Create a UFC object for second form
+      _ufcs[stage].push_back(std::make_shared<UFC>(*stage_forms[stage][1]));
+
+      // Find coefficient index for each of the two implicit forms
+      for (unsigned int i = 0; i < 2; i++)
+      {
+	for (unsigned int j = 0;  j < stage_forms[stage][i]->num_coefficients();
+             j++)
+	{
+
+	  // Check if stage solution is the same as coefficient j
+	  if (stage_forms[stage][i]->coefficients()[j]->id()
+              == _scheme->stage_solutions()[stage]->id())
+	  {
+	    _coefficient_index[stage].push_back(j);
+	    break;
+	  }
+	}
+      }
+
+      // Check that nonlinear form includes a coefficient index
+      // (otherwise it might be some error in the form)
+      if (_coefficient_index[stage].size() == 0)
+      {
+	dolfin_error("PointIntegralSolver.cpp",
+		     "constructing PointIntegralSolver",
+		     "Expecting nonlinear form of stage: %d to be dependent "\
+		     "on the stage solution.", stage);
+      }
+
+    }
+  }
+
+  // Build vertex map
+  _vertex_map.resize(_mesh.num_vertices());
+
+  // Init mesh connections
+  _mesh.init(0);
+  const unsigned int dim_t = _mesh.topology().dim();
+
+  // Iterate over vertices and collect cell and local vertex information
+  for (VertexIterator vert(_mesh); !vert.end(); ++vert)
+  {
+    // First look for cell where the vert is local vert 0
+    bool local_vert_found = false;
+    for (CellIterator cell(*vert); !cell.end(); ++cell )
+    {
+      // If the first local vertex is the same as the global vertex
+      if (cell->entities(0)[0]==vert->index())
+      {
+	_vertex_map[vert->index()].first = cell->index();
+	_vertex_map[vert->index()].second = 0;
+	local_vert_found = true;
+	break;
+      }
+    }
+
+    // If no cell exist where vert corresponds to local vert 0 just grab
+    // local cell 0 and find what local vert the global vert corresponds to
+    if (!local_vert_found)
+    {
+      const Cell cell0(_mesh, vert->entities(dim_t)[0]);
+      _vertex_map[vert->index()].first = cell0.index();
+
+      unsigned int local_vert_index = 0;
+      for (VertexIterator local_vert(cell0); !local_vert.end(); ++local_vert)
+      {
+	// If local vert is found
+	if (vert->index()==local_vert->index())
+	{
+	  // Store local vertex index
+	  _vertex_map[vert->index()].second = local_vert_index;
+	  break;
+	}
+
+	// Bump index
+	local_vert_index++;
+      }
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void PointIntegralSolver::_simplified_newton_solve(
+			      std::size_t vert_ind, unsigned int stage,
+//			      UFC& loc_ufc,
+//			      int coefficient_index_F, int coefficient_index_J,
+			      const Cell& cell,
+			      const ufc::cell& ufc_cell,
+			      const std::vector<double>& vertex_coordinates)
+{
+
+  //Timer _timer_newton_solve("Implicit stage: Newton solve");
+  const Parameters& newton_solver_params = parameters("newton_solver");
+  const size_t report_vertex = newton_solver_params["report_vertex"];
+  const double kappa = newton_solver_params["kappa"];
+  const double rtol = newton_solver_params["relative_tolerance"];
+  std::size_t max_iterations = newton_solver_params["maximum_iterations"];
+  const double max_relative_previous_residual = newton_solver_params["max_relative_previous_residual"];
+  const double relaxation = newton_solver_params["relaxation_parameter"];
+  const bool report = newton_solver_params["report"];
+  const bool verbose_report = newton_solver_params["verbose_report"];
+  bool always_recompute_jacobian = newton_solver_params["always_recompute_jacobian"];
+  const unsigned int local_vert = _vertex_map[vert_ind].second;
+  UFC& loc_ufc_F = *_ufcs[stage][0];
+  UFC& loc_ufc_J = *_ufcs[stage][1];
+  const int coefficient_index_F = _coefficient_index[stage][0];
+  const int coefficient_index_J = _coefficient_index[stage].size()==2 ?
+    _coefficient_index[stage][1] : -1;
+  const unsigned int jac_index = _scheme->jacobian_index(stage);
+  std::vector<double>& jac = _jacobians[jac_index];
+
+  if (newton_solver_params["recompute_jacobian_each_solve"])
+    _recompute_jacobian[jac_index] = true;
+
+  bool newton_solve_restared = false;
+  unsigned int newton_iterations = 0;
+  double relative_previous_residual = 1.0, residual, prev_residual = 1.0,
+    initial_residual = 1.0, relative_residual = 1.0;
+
+  // Get point integrals
+  const ufc::point_integral& F_integral = *loc_ufc_F.default_point_integral;
+
+  // Local solution
+  std::vector<double>& u = _local_stage_solutions[stage];
+
+  // Update with previous local solution and make a backup of solution to
+  // be used in a potential restarting of newton solver
+  for (unsigned int row=0; row < _system_size; row++)
+    _u0[row] = u[row] = loc_ufc_F.w()[coefficient_index_F][_local_to_local_dofs[row]];
+
+  do
+  {
+
+    // Tabulate residual
+    Timer t_impl_tt_F("Implicit stage: tabulate_tensor (F)");
+    F_integral.tabulate_tensor(loc_ufc_F.A.data(), loc_ufc_F.w(),
+			       vertex_coordinates.data(),
+			       local_vert,
+                               ufc_cell.orientation);
+    t_impl_tt_F.stop();
+
+    // Extract vertex dofs from tabulated tensor, together with the old stage
+    // solution
+    for (unsigned int row=0; row < _system_size; row++)
+      _residual[row] = loc_ufc_F.A[_local_to_local_dofs[row]];
+
+    residual = _norm(_residual);
+    if (newton_iterations == 0)
+      initial_residual = residual;//std::max(residual, DOLFIN_EPS);
+
+    relative_residual = residual/initial_residual;
+
+    // Check for relative residual convergence
+    if (relative_residual < rtol)
+      break;
+
+    // Should we recompute jacobian
+    if (_recompute_jacobian[jac_index] || always_recompute_jacobian)
+    {
+      _compute_jacobian(jac, u, local_vert, loc_ufc_J, cell, ufc_cell,
+    			coefficient_index_J, vertex_coordinates);
+      _recompute_jacobian[jac_index] = false;
+    }
+
+    // Perform linear solve By forward backward substitution
+    //Timer forward_backward_substitution("Implicit stage: fb substituion");
+    _forward_backward_subst(jac, _residual, _dx);
+    //forward_backward_substitution.stop();
+
+    // Newton_Iterations == 0
+    if (newton_iterations == 0)
+    {
+      // On first iteration we need an approximation of eta. We take
+      // the one from previous step and increase it slightly. This is
+      // important for linear problems which only should recquire 1
+      // iteration to converge.
+      _eta = _eta > DOLFIN_EPS ? _eta : DOLFIN_EPS;
+      _eta = std::pow(_eta, 0.8);
+    }
+
+    // 2nd time around
+    else
+    {
+
+      // How fast are we converging?
+      relative_previous_residual = residual/prev_residual;
+
+      if (always_recompute_jacobian)
+      {
+
+	if ((report && vert_ind == report_vertex) || verbose_report)
+	  info("Newton solver after %d iterations. vertex: %d, "	\
+	       "relative_previous_residual: %.3f, "			\
+	       "relative_residual: %.3e, residual: %.3e.",
+	       newton_iterations, vert_ind, relative_previous_residual,
+	       relative_residual, residual);
+
+      }
+
+      // If we diverge
+      else if (relative_previous_residual > 1)
+      {
+
+	if ((report && vert_ind == report_vertex) || verbose_report)
+	  info("Newton solver diverges after %d iterations. vertex: %d, "		\
+	       "relative_previous_residual: %.3f, "			\
+	       "relative_residual: %.3e, residual: %.3e.",
+	       newton_iterations, vert_ind, relative_previous_residual,
+	       relative_residual, residual);
+
+	// If we have not restarted newton solve previously
+	if (!newton_solve_restared)
+	{
+	  if ((report && vert_ind == report_vertex) || verbose_report)
+	    info("Restarting newton solve for vertex: %d", vert_ind);
+
+	  // Reset flags
+	  newton_solve_restared = true;
+	  always_recompute_jacobian = true;
+
+	  // Reset solution
+	  for (unsigned int row=0; row < _system_size; row++)
+	    loc_ufc_F.w()[coefficient_index_F][_local_to_local_dofs[row]] = u[row] = _u0[row];
+
+	  // Update variables
+	  _eta = parameters("newton_solver")["eta_0"];
+	  newton_iterations = 0;
+	  relative_previous_residual = prev_residual = initial_residual = relative_residual = 1.0;
+	  max_iterations = 400;
+	  continue;
+	}
+
+      }
+
+      // We converge too slow
+      else if (relative_previous_residual >= max_relative_previous_residual ||
+	       residual > (kappa*rtol*(1 - relative_previous_residual)/	\
+			   std::pow(relative_previous_residual,		\
+				    max_iterations - newton_iterations)))
+      {
+
+	if ((report && vert_ind == report_vertex) || verbose_report)
+	  info("Newton solver converges too slow at iteration %d. vertex: %d, "	\
+	       "relative_previous_residual: %.3f, "			\
+	       "relative_residual: %.3e, residual: %.3e. Recomputing jacobian.",
+	       newton_iterations, vert_ind, relative_previous_residual,
+	       relative_residual, residual);
+
+	_recompute_jacobian[jac_index] = true;
+
+      }
+      else
+      {
+	if ((report && vert_ind == report_vertex) || verbose_report)
+	  info("Newton solver after %d iterations. vertex: %d, "	\
+	       "relative_previous_residual: %.3f, "			\
+	       "relative_residual: %.3e, residual: %.3e.",
+	       newton_iterations, vert_ind, relative_previous_residual,
+	       relative_residual, residual);
+
+	// Update eta
+	_eta = relative_previous_residual/(1.0 - relative_previous_residual);
+
+      }
+
+    }
+
+    // No convergence
+    if (newton_iterations > max_iterations)
+    {
+      if (report)
+	info("Newton solver did not converge after %d iterations. vertex: %d, "	\
+	     "relative_previous_residual: %.3f, "			\
+	     "relative_residual: %.3e, residual: %.3e.", max_iterations, vert_ind,
+	     relative_previous_residual, relative_residual, residual);
+
+      error("Newton solver in PointIntegralSolver exeeded maximal iterations.");
+    }
+
+    // Update solution
+    if (std::abs(1.0 - relaxation) < DOLFIN_EPS)
+      for (unsigned int i=0; i < u.size(); i++)
+	u[i] -= _dx[i];
+    else
+      for (unsigned int i=0; i < u.size(); i++)
+	u[i] -= relaxation*_dx[i];
+
+    // Put solution back into restricted coefficients before tabulate new residual
+    for (unsigned int row=0; row < _system_size; row++)
+      loc_ufc_F.w()[coefficient_index_F][_local_to_local_dofs[row]] = u[row];
+
+    prev_residual = residual;
+    newton_iterations++;
+
+  } while(_eta*relative_residual >= kappa*rtol);
+
+  if ((report && vert_ind == report_vertex) || verbose_report)
+    info("Newton solver converged after %d iterations. vertex: %d, "\
+	 "relative_previous_residual: %.3f, relative_residual: %.3e, "\
+	 "residual: %.3e.", newton_iterations, vert_ind,
+	 relative_previous_residual, relative_residual, residual);
+
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/multistage/PointIntegralSolver.h b/dolfin/multistage/PointIntegralSolver.h
new file mode 100644
index 0000000..779f765
--- /dev/null
+++ b/dolfin/multistage/PointIntegralSolver.h
@@ -0,0 +1,222 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-15
+// Last changed: 2014-03-10
+
+#ifndef __POINTINTEGRALSOLVER_H
+#define __POINTINTEGRALSOLVER_H
+
+#include <vector>
+#include <set>
+#include <memory>
+
+#include <dolfin/common/Variable.h>
+#include <dolfin/fem/Assembler.h>
+
+namespace dolfin
+{
+
+  /// This class is a time integrator for general Runge Kutta forms,
+  /// which only includes Point integrals with piecewise linear test
+  /// functions. Such problems are disconnected at the vertices and
+  /// can therefore be solved locally.
+
+  // Forward declarations
+  class MultiStageScheme;
+  class UFC;
+
+  class PointIntegralSolver : public Variable
+  {
+  public:
+
+    /// Constructor
+    /// FIXME: Include version where one can pass a Solver and/or Parameters
+    PointIntegralSolver(std::shared_ptr<MultiStageScheme> scheme);
+
+    /// Destructor
+    ~PointIntegralSolver();
+
+    /// Step solver with time step dt
+    void step(double dt);
+
+    /// Step solver an interval using dt as time step
+    void step_interval(double t0, double t1, double dt);
+
+    /// Return the MultiStageScheme
+    std::shared_ptr<MultiStageScheme> scheme() const
+    { return _scheme; }
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("point_integral_solver");
+
+      p.add("reset_stage_solutions", true);
+
+      // Set parameters for NewtonSolver
+      Parameters pn("newton_solver");
+      pn.add("maximum_iterations", 40);
+      pn.add("recompute_jacobian_for_linear_problems", false);
+      pn.add("always_recompute_jacobian", false);
+      pn.add("recompute_jacobian_each_solve", false);
+      pn.add("relaxation_parameter", 1., 0., 1.);
+      pn.add("relative_tolerance", 1e-10, 1e-20, 1e-3);
+
+      pn.add("kappa", 0.1, 0.05, 1.0);
+      pn.add("eta_0", 1., 1e-15, 1.0);
+      pn.add("max_relative_previous_residual", 1e-1, 1e-5, 1.0);
+      pn.add("reset_each_step", true);
+      pn.add("report", false);
+      pn.add("report_vertex", 0, 0, 32767);
+      pn.add("verbose_report", false);
+
+      p.add(pn);
+
+      return p;
+    }
+
+    // Reset newton solver
+    void reset_newton_solver();
+
+    // Reset stage solutions
+    void reset_stage_solutions();
+
+    // Return number of computations of jacobian
+    std::size_t num_jacobian_computations() const
+    {
+      return _num_jacobian_computations;
+    }
+
+  private:
+
+    // Convergence critera for simplified Newton solver
+    enum convergence_criteria_t
+    {
+
+      converged,
+      too_slow,
+      exceeds_max_iter,
+      diverge
+
+    };
+
+    // In-place LU factorization of jacobian matrix
+    void _lu_factorize(std::vector<double>& A);
+
+    // Forward backward substitution, assume that mat is already
+    // inplace LU factorized
+    void _forward_backward_subst(const std::vector<double>& A,
+				 const std::vector<double>& b,
+				 std::vector<double>& x) const;
+
+    // Compute jacobian using passed UFC form
+    void _compute_jacobian(std::vector<double>& jac, const std::vector<double>& u,
+			   unsigned int local_vert, UFC& loc_ufc,
+			   const Cell& cell, const ufc::cell& ufc_cell,
+			   int coefficient_index,
+			   const std::vector<double>& vertex_coordinates);
+
+    // Compute the norm of a vector
+    double _norm(const std::vector<double>& vec) const;
+
+    // Check the forms making sure they only include piecewise linear
+    // test functions
+    void _check_forms();
+
+    // Build map between vertices, cells and the correspondning local vertex
+    // and initialize UFC data for each form
+    void _init();
+
+    // Solve an explicit stage
+    void _solve_explicit_stage(std::size_t vert_ind, unsigned int stage,
+                               const ufc::cell& ufc_cell,
+			       const std::vector<double>& vertex_coordinates);
+
+    // Solve an implicit stage
+    void _solve_implicit_stage(std::size_t vert_ind, unsigned int stage,
+			       const Cell& cell, const ufc::cell& ufc_cell,
+			       const std::vector<double>& vertex_coordinates);
+
+    void _simplified_newton_solve(std::size_t vert_ind, unsigned int stage,
+				  const Cell& cell, const ufc::cell& ufc_cell,
+				  const std::vector<double>& vertex_coordinates);
+
+    // The MultiStageScheme
+    std::shared_ptr<MultiStageScheme> _scheme;
+
+    // Reference to mesh
+    const Mesh& _mesh;
+
+    // The dofmap (Same for all stages and forms)
+    const GenericDofMap& _dofmap;
+
+    // Size of ODE system
+    const std::size_t _system_size;
+
+    // Offset into local dofmap
+    // FIXME: Consider put in local loop
+    const unsigned int _dof_offset;
+
+    // Number of stages
+    const unsigned int _num_stages;
+
+    // Local to local dofs to be used in tabulate entity dofs
+    std::vector<std::size_t> _local_to_local_dofs;
+
+    // Vertex map between vertices, cells and corresponding local vertex
+    std::vector<std::pair<std::size_t, unsigned int> > _vertex_map;
+
+    // Local to global dofs used when solution is fanned out to global vector
+    std::vector<dolfin::la_index> _local_to_global_dofs;
+
+    // Local stage solutions
+    std::vector<std::vector<double> > _local_stage_solutions;
+
+    // Local solutions
+    std::vector<double> _u0;
+    std::vector<double> _residual;
+    std::vector<double> _y;
+    std::vector<double> _dx;
+
+    // UFC objects, one for each form
+    std::vector<std::vector<std::shared_ptr<UFC> > > _ufcs;
+
+    // UFC objects for the last form
+    std::shared_ptr<UFC> _last_stage_ufc;
+
+    // Solution coefficient index in form
+    std::vector<std::vector<int> > _coefficient_index;
+
+    // Flag which is set to false once the jacobian has been computed
+    std::vector<bool> _recompute_jacobian;
+
+    // Jacobians/LU factorized jacobians matrices
+    std::vector<std::vector<double> > _jacobians;
+
+    // Variable used in the estimation of the error of the newton
+    // iteration for the first iteration (Important for linear problems!)
+    double _eta;
+
+    // Number of computations of Jacobian
+    std::size_t _num_jacobian_computations;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/multistage/RKSolver.cpp b/dolfin/multistage/RKSolver.cpp
new file mode 100644
index 0000000..8c198ee
--- /dev/null
+++ b/dolfin/multistage/RKSolver.cpp
@@ -0,0 +1,138 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-15
+// Last changed: 2014-03-05
+
+#include <cmath>
+
+#include <dolfin/log/log.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/Constant.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/fem/assemble.h>
+#include <dolfin/fem/solve.h>
+#include <dolfin/fem/DirichletBC.h>
+
+#include "MultiStageScheme.h"
+#include "RKSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+RKSolver::RKSolver(std::shared_ptr<MultiStageScheme> scheme) : 
+  _scheme(scheme), _tmp(scheme->solution()->vector()->copy())
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void RKSolver::step(double dt)
+{
+  dolfin_assert(dt > 0.0);
+
+  // Update time constant of scheme
+  *_scheme->dt() = dt;
+
+  // Time at start of timestep
+  const double t0 = *_scheme->t();
+
+  // Get scheme data
+  std::vector<std::vector<std::shared_ptr<const Form> > >& stage_forms = \
+    _scheme->stage_forms();
+  std::vector<std::shared_ptr<Function> >& stage_solutions = _scheme->stage_solutions();
+  std::vector<const DirichletBC* > bcs = _scheme->bcs();
+  
+  // Iterate over stage forms
+  for (unsigned int stage=0; stage < stage_forms.size(); stage++)
+  {
+
+    // Update time
+    //*_scheme->t() = t0 + dt*_scheme->dt_stage_offset()[stage];
+
+    // Check if we have an explicit stage (only 1 form)
+    if (stage_forms[stage].size()==1)
+    {
+
+      // Just do an assemble
+      _assembler.assemble(*stage_solutions[stage]->vector(), *stage_forms[stage][0]);
+      
+      // Apply boundary conditions
+      // FIXME: stage solutions are time derivatives and we cannot apply the 
+      // bcs directly on them
+      for (unsigned int j = 0; j < bcs.size(); j++)
+      {
+	dolfin_assert(bcs[j]);
+	bcs[j]->apply(*stage_solutions[stage]->vector());
+      }
+      
+    }
+    
+    // or an implicit stage (2 forms)
+    else
+    {
+      // FIXME: applying the bcs on stage solutions are probably wrong...
+      // FIXME: Include solver parameters
+      // Do a nonlinear solve
+      solve(*stage_forms[stage][0] == 0, *stage_solutions[stage], bcs, *stage_forms[stage][1]);
+    }
+
+  }
+
+  // Update solution with last stage
+  GenericVector& solution_vector = *_scheme->solution()->vector();
+  
+  // Do the last stage (just an assemble)
+  _assembler.assemble(*_tmp, *_scheme->last_stage());
+  solution_vector = *_tmp;
+
+  // Update time
+  *_scheme->t() = t0 + dt;
+  
+}
+//-----------------------------------------------------------------------------
+void RKSolver::step_interval(double t0, double t1, double dt)
+{
+  if (dt<=0.0)
+  {
+    dolfin_error("RKSolver.cpp",
+		 "stepping RKSolver",
+		 "Expecting a positive dt");
+  }
+
+  if (t0>=t1)
+  {
+    dolfin_error("RKSolver.cpp",
+		 "stepping RKSolver",
+		 "Expecting t0 to be smaller than t1");
+  }
+  
+  // Set start time
+  *_scheme->t() = t0;
+  double t = t0;
+  double next_dt = std::min(t1-t, dt);
+
+  // Step interval
+  while (t + next_dt <= t1)
+  {
+    if (next_dt < DOLFIN_EPS)
+      break;
+    step(next_dt);
+    t = *_scheme->t();
+    next_dt = std::min(t1-t, dt);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/multistage/RKSolver.h b/dolfin/multistage/RKSolver.h
new file mode 100644
index 0000000..e7a78d8
--- /dev/null
+++ b/dolfin/multistage/RKSolver.h
@@ -0,0 +1,73 @@
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-02-15
+// Last changed: 2014-03-05
+
+#ifndef __RKSOLVER_H
+#define __RKSOLVER_H
+
+#include <vector>
+#include <memory>
+
+#include <dolfin/function/FunctionAXPY.h>
+#include <dolfin/fem/Assembler.h>
+#include <dolfin/la/GenericVector.h>
+
+namespace dolfin
+{
+
+  /// This class is a time integrator for general Runge Kutta problems
+
+  // Forward declarations
+  class MultiStageScheme;
+
+  class RKSolver
+  {
+  public:
+
+    /// Constructor
+    /// FIXME: Include version where one can pass a Solver and/or Parameters
+    RKSolver(std::shared_ptr<MultiStageScheme> scheme);
+
+    /// Step solver with time step dt
+    void step(double dt);
+
+    /// Step solver an interval using dt as time step
+    void step_interval(double t0, double t1, double dt);
+
+    /// Return the MultiStageScheme
+    std::shared_ptr<MultiStageScheme> scheme() const 
+    {return _scheme;}
+
+  private:
+
+    // The MultiStageScheme
+    std::shared_ptr<MultiStageScheme> _scheme;
+
+    // Temp vector for final stage
+    // FIXME: Add this as a Function called previous step or something
+    std::shared_ptr<GenericVector> _tmp;
+
+    // Assembler for explicit stages
+    Assembler _assembler;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/multistage/dolfin_multistage.h b/dolfin/multistage/dolfin_multistage.h
new file mode 100644
index 0000000..5ee8180
--- /dev/null
+++ b/dolfin/multistage/dolfin_multistage.h
@@ -0,0 +1,10 @@
+#ifndef __DOLFIN_MULTISTAGE_H
+#define __DOLFIN_MULTISTAGE_H
+
+// DOLFIN multistage interface
+
+#include <dolfin/multistage/MultiStageScheme.h>
+#include <dolfin/multistage/RKSolver.h>
+#include <dolfin/multistage/PointIntegralSolver.h>
+
+#endif
diff --git a/dolfin/nls/NewtonSolver.cpp b/dolfin/nls/NewtonSolver.cpp
new file mode 100644
index 0000000..29bea28
--- /dev/null
+++ b/dolfin/nls/NewtonSolver.cpp
@@ -0,0 +1,280 @@
+// Copyright (C) 2005-2008 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2005-2009
+// Modified by Martin Alnes 2008
+// Modified by Johan Hake 2010
+//
+// First added:  2005-10-23
+// Last changed: 2014-05-27
+
+#include <iostream>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/la/GenericLinearSolver.h>
+#include <dolfin/la/LinearSolver.h>
+#include <dolfin/la/Matrix.h>
+#include <dolfin/la/Vector.h>
+#include <dolfin/la/LUSolver.h>
+#include <dolfin/la/KrylovSolver.h>
+#include <dolfin/log/log.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/MPI.h>
+#include "NonlinearProblem.h"
+#include "NewtonSolver.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+Parameters NewtonSolver::default_parameters()
+{
+  Parameters p("newton_solver");
+
+  p.add("linear_solver",           "default");
+  p.add("preconditioner",          "default");
+  p.add("maximum_iterations",      10);
+  p.add("relative_tolerance",      1e-9);
+  p.add("absolute_tolerance",      1e-10);
+  p.add("convergence_criterion",   "residual");
+  p.add("method",                  "full");
+  p.add("relaxation_parameter",    1.0);
+  p.add("report",                  true);
+  p.add("error_on_nonconvergence", true);
+
+  //p.add("reuse_preconditioner", false);
+
+  p.add(LUSolver::default_parameters());
+  p.add(KrylovSolver::default_parameters());
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+NewtonSolver::NewtonSolver()
+  : Variable("Newton solver", "unamed"), _newton_iteration(0), _residual(0.0),
+    _residual0(0.0), _matA(new Matrix), _dx(new Vector), _b(new Vector),
+    _mpi_comm(MPI_COMM_WORLD)
+{
+  // Set default parameters
+  parameters = default_parameters();
+}
+//-----------------------------------------------------------------------------
+NewtonSolver::NewtonSolver(std::shared_ptr<GenericLinearSolver> solver,
+                           GenericLinearAlgebraFactory& factory)
+  : Variable("Newton solver", "unamed"), _newton_iteration(0), _residual(0.0),
+    _residual0(0.0), _solver(solver), _matA(factory.create_matrix()),
+    _dx(factory.create_vector()), _b(factory.create_vector()),
+    _mpi_comm(MPI_COMM_WORLD)
+{
+  // Set default parameters
+  parameters = default_parameters();
+
+  // Store linear solver type
+  parameters["linear_solver"] = "user_defined";
+  parameters["preconditioner"] = "user_defined";
+}
+//-----------------------------------------------------------------------------
+NewtonSolver::~NewtonSolver()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, bool>
+NewtonSolver::solve(NonlinearProblem& nonlinear_problem,
+                    GenericVector& x)
+{
+  dolfin_assert(_matA);
+  dolfin_assert(_b);
+  dolfin_assert(_dx);
+
+  // Extract parameters
+  const std::string convergence_criterion = parameters["convergence_criterion"];
+  const std::size_t maxiter = parameters["maximum_iterations"];
+
+  // Create linear solver if not already created
+  const std::string solver_type = parameters["linear_solver"];
+  const std::string pc_type = parameters["preconditioner"];
+  if (!_solver)
+    _solver = std::shared_ptr<LinearSolver>(new LinearSolver(solver_type, pc_type));
+  dolfin_assert(_solver);
+
+  // Set parameters for linear solver
+  _solver->update_parameters(parameters(_solver->parameter_type()));
+
+  // Reset iteration counts
+  std::size_t krylov_iterations = 0;
+  _newton_iteration = 0;
+
+  // Compute F(u)
+  nonlinear_problem.F(*_b, x);
+  nonlinear_problem.form(*_matA, *_b, x);
+
+  // Check convergence
+  bool newton_converged = false;
+  if (convergence_criterion == "residual")
+    newton_converged = converged(*_b, nonlinear_problem, 0);
+  else if (convergence_criterion == "incremental")
+  {
+    // We need to do at least one Newton step with the ||dx||-stopping
+    // criterion.
+    newton_converged = false;
+  }
+  else
+  {
+    dolfin_error("NewtonSolver.cpp",
+                 "check for convergence",
+                 "The convergence criterion %s is unknown, known criteria are 'residual' or 'incremental'",
+                 convergence_criterion.c_str());
+  }
+
+  _solver->set_operator(_matA);
+
+  // Get relaxation parameter
+  const double relaxation = parameters["relaxation_parameter"];
+
+  // Start iterations
+  while (!newton_converged && _newton_iteration < maxiter)
+  {
+    // Compute Jacobian
+    nonlinear_problem.J(*_matA, x);
+
+    // FIXME: This reset is a hack to handle a deficiency in the
+    // Trilinos wrappers
+    _solver->set_operator(_matA);
+
+    // Perform linear solve and update total number of Krylov
+    // iterations
+    if (!_dx->empty())
+      _dx->zero();
+    krylov_iterations += _solver->solve(*_dx, *_b);
+
+    // Update solution
+    if (std::abs(1.0 - relaxation) < DOLFIN_EPS)
+      x -= (*_dx);
+    else
+      x.axpy(-relaxation, *_dx);
+
+    // Increment iteration count
+    _newton_iteration++;
+
+    // FIXME: This step is not needed if residual is based on dx and
+    //        this has converged.
+    // FIXME: But, this function call may update internal variable, etc.
+    // Compute F
+    nonlinear_problem.F(*_b, x);
+    nonlinear_problem.form(*_matA, *_b, x);
+
+    // Test for convergence
+    if (convergence_criterion == "residual")
+      newton_converged = converged(*_b, nonlinear_problem, _newton_iteration);
+    else if (convergence_criterion == "incremental")
+    {
+      // Subtract 1 to make sure that the initial residual0 is properly set.
+      newton_converged = converged(*_dx, nonlinear_problem, _newton_iteration - 1);
+    }
+    else
+    {
+      dolfin_error("NewtonSolver.cpp",
+                   "check for convergence",
+                   "The convergence criterion %s is unknown, known criteria are 'residual' or 'incremental'",
+                   convergence_criterion.c_str());
+    }
+  }
+
+  if (newton_converged)
+  {
+    if (dolfin::MPI::rank(_mpi_comm) == 0)
+    {
+     info("Newton solver finished in %d iterations and %d linear solver iterations.",
+          _newton_iteration, krylov_iterations);
+    }
+  }
+  else
+  {
+    const bool error_on_nonconvergence = parameters["error_on_nonconvergence"];
+    if (error_on_nonconvergence)
+    {
+      dolfin_error("NewtonSolver.cpp",
+                   "solve nonlinear system with NewtonSolver",
+                   "Newton solver did not converge");
+    }
+    else
+      warning("Newton solver did not converge.");
+  }
+
+  return std::make_pair(_newton_iteration, newton_converged);
+}
+//-----------------------------------------------------------------------------
+std::size_t NewtonSolver::iteration() const
+{
+  return _newton_iteration;
+}
+//-----------------------------------------------------------------------------
+double NewtonSolver::residual() const
+{
+  return _residual;
+}
+//-----------------------------------------------------------------------------
+double NewtonSolver::relative_residual() const
+{
+  return _residual/_residual0;
+}
+//-----------------------------------------------------------------------------
+GenericLinearSolver& NewtonSolver::linear_solver() const
+{
+  if (!_solver)
+  {
+    dolfin_error("NewtonSolver.cpp",
+                 "access linear solver for Newton solver",
+                 "The linear solver will not be initialized until solve() "
+                 "has been called. For control of the linear solver, pass "
+                 "a linear solver to the constructor of NewtonSolver");
+  }
+
+  return *_solver;
+}
+//-----------------------------------------------------------------------------
+bool NewtonSolver::converged(const GenericVector& r,
+                             const NonlinearProblem& nonlinear_problem,
+                             std::size_t newton_iteration)
+{
+  const double rtol = parameters["relative_tolerance"];
+  const double atol = parameters["absolute_tolerance"];
+  const bool report = parameters["report"];
+
+  _residual = r.norm("l2");
+
+  // If this is the first iteration step, set initial residual
+  if (newton_iteration == 0)
+    _residual0 = _residual;
+
+  // Relative residual
+  const double relative_residual = _residual/_residual0;
+
+  // Output iteration number and residual
+  if (report && dolfin::MPI::rank(_mpi_comm) == 0)
+  {
+    info("Newton iteration %d: r (abs) = %.3e (tol = %.3e) r (rel) = %.3e (tol = %.3e)",
+         newton_iteration, _residual, atol, relative_residual, rtol);
+  }
+
+  // Return true if convergence criterion is met
+  if (relative_residual < rtol || _residual < atol)
+    return true;
+  else
+    return false;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/nls/NewtonSolver.h b/dolfin/nls/NewtonSolver.h
new file mode 100644
index 0000000..fcc5d9f
--- /dev/null
+++ b/dolfin/nls/NewtonSolver.h
@@ -0,0 +1,148 @@
+// Copyright (C) 2005-2008 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2006-2011
+// Modified by Anders E. Johansen 2011
+//
+// First added:  2005-10-23
+// Last changed: 2013-11-20
+
+#ifndef __NEWTON_SOLVER_H
+#define __NEWTON_SOLVER_H
+
+#include <utility>
+#include <memory>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericLinearSolver;
+  class GenericLinearAlgebraFactory;
+  class GenericMatrix;
+  class GenericVector;
+  class NonlinearProblem;
+
+  /// This class defines a Newton solver for nonlinear systems of
+  /// equations of the form :math:`F(x) = 0`.
+
+  class NewtonSolver : public Variable
+  {
+  public:
+
+    /// Create nonlinear solver
+    NewtonSolver();
+
+    /// Create nonlinear solver using provided linear solver
+    ///
+    /// *Arguments*
+    ///     solver (_GenericLinearSolver_)
+    ///         The linear solver.
+    ///     factory (_GenericLinearAlgebraFactory_)
+    ///         The factory.
+    NewtonSolver(std::shared_ptr<GenericLinearSolver> solver,
+                 GenericLinearAlgebraFactory& factory);
+
+    /// Destructor
+    virtual ~NewtonSolver();
+
+    /// Solve abstract nonlinear problem :math:`F(x) = 0` for given
+    /// :math:`F` and Jacobian :math:`\dfrac{\partial F}{\partial x}`.
+    ///
+    /// *Arguments*
+    ///     nonlinear_function (_NonlinearProblem_)
+    ///         The nonlinear problem.
+    ///     x (_GenericVector_)
+    ///         The vector.
+    ///
+    /// *Returns*
+    ///     std::pair<std::size_t, bool>
+    ///         Pair of number of Newton iterations, and whether
+    ///         iteration converged)
+    std::pair<std::size_t, bool> solve(NonlinearProblem& nonlinear_function,
+                                       GenericVector& x);
+
+    /// Return Newton iteration number
+    ///
+    /// *Returns*
+    ///     std::size_t
+    ///         The iteration number.
+    std::size_t iteration() const;
+
+    /// Return current residual
+    ///
+    /// *Returns*
+    ///     double
+    ///         Current residual.
+    double residual() const;
+
+    /// Return current relative residual
+    ///
+    /// *Returns*
+    ///     double
+    ///       Current relative residual.
+    double relative_residual() const;
+
+    /// Return the linear solver
+    ///
+    /// *Returns*
+    ///     _GenericLinearSolver_
+    ///         The linear solver.
+    GenericLinearSolver& linear_solver() const;
+
+    /// Default parameter values
+    ///
+    /// *Returns*
+    ///     _Parameters_
+    ///         Parameter values.
+    static Parameters default_parameters();
+
+  private:
+
+    // Convergence test
+    virtual bool converged(const GenericVector& r,
+                           const NonlinearProblem& nonlinear_problem,
+                           std::size_t iteration);
+
+    // Current number of Newton iterations
+    std::size_t _newton_iteration;
+
+    // Most recent residual and intitial residual
+    double _residual, _residual0;
+
+    // Solver
+    std::shared_ptr<GenericLinearSolver> _solver;
+
+    // Jacobian matrix
+    std::shared_ptr<GenericMatrix> _matA;
+
+    // Solution vector
+    std::shared_ptr<GenericVector> _dx;
+
+    // Resdiual vector
+    std::shared_ptr<GenericVector> _b;
+
+    // MPI communicator
+    MPI_Comm _mpi_comm;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/nls/NonlinearProblem.h b/dolfin/nls/NonlinearProblem.h
new file mode 100644
index 0000000..388dd0a
--- /dev/null
+++ b/dolfin/nls/NonlinearProblem.h
@@ -0,0 +1,63 @@
+// Copyright (C) 2005-2008 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008.
+//
+// First added:  2005-10-24
+// Last changed: 2011-01-14
+
+#ifndef __NONLINEAR_PROBLEM_H
+#define __NONLINEAR_PROBLEM_H
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericMatrix;
+  class GenericVector;
+
+  /// This is a base class for nonlinear problems which can return the
+  /// nonlinear function F(u) and its Jacobian J = dF(u)/du.
+
+  class NonlinearProblem
+  {
+  public:
+
+    /// Constructor
+    NonlinearProblem() {}
+
+    /// Destructor
+    virtual ~NonlinearProblem() {}
+
+    /// Function called by Newton solver before requesting F or J.
+    /// This can be used to compute F and J together
+    virtual void form(GenericMatrix& A, GenericVector& b, const GenericVector& x)
+    {
+      // Do nothing if not supplied by the user
+    }
+
+    /// Compute F at current point x
+    virtual void F(GenericVector& b, const GenericVector& x) = 0;
+
+    /// Compute J = F' at current point x
+    virtual void J(GenericMatrix& A, const GenericVector& x) = 0;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/nls/PETScSNESSolver.cpp b/dolfin/nls/PETScSNESSolver.cpp
new file mode 100644
index 0000000..4bca9c2
--- /dev/null
+++ b/dolfin/nls/PETScSNESSolver.cpp
@@ -0,0 +1,660 @@
+// Copyright (C) 2012 Patrick E. Farrell
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Corrado Maurini 2013
+// Modified by Anders Logg 2013
+//
+// First added:  2012-10-13
+// Last changed: 2013-11-21
+
+#ifdef ENABLE_PETSC_SNES
+
+#include <map>
+#include <string>
+#include <utility>
+#include <petscsys.h>
+#include <boost/assign/list_of.hpp>
+
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/timing.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/la/PETScKrylovSolver.h>
+#include <dolfin/la/PETScMatrix.h>
+#include <dolfin/la/PETScLUSolver.h>
+#include <dolfin/la/PETScPreconditioner.h>
+#include <dolfin/la/PETScVector.h>
+#include "NonlinearProblem.h"
+#include "PETScSNESSolver.h"
+
+using namespace dolfin;
+
+#if PETSC_VERSION_RELEASE
+  #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR == 3
+  // Mapping from method string to PETSc
+  const std::map<std::string, std::pair<std::string, const SNESType> >
+  PETScSNESSolver::_methods
+    = boost::assign::map_list_of
+        ("default",     std::make_pair("default SNES method", ""))
+        ("ls",          std::make_pair("Line search method", SNESLS))
+        ("tr",          std::make_pair("Trust region method",  SNESTR))
+        ("test",        std::make_pair("Tool to verify Jacobian approximation", SNESTEST))
+        ("ngmres",      std::make_pair("Nonlinear generalised minimum residual method", SNESNGMRES))
+        ("nrichardson", std::make_pair("Richardson nonlinear method (Picard iteration)", SNESNRICHARDSON))
+        ("virs",        std::make_pair("Reduced space active set solver method (for bounds)", SNESVIRS))
+        ("viss",        std::make_pair("Reduced space active set solver method (for bounds)", SNESVISS))
+        ("qn",          std::make_pair("Limited memory quasi-Newton", SNESQN))
+        ("ncg",         std::make_pair("Nonlinear conjugate gradient method", SNESNCG))
+        ("fas",         std::make_pair("Full Approximation Scheme nonlinear multigrid method", SNESFAS))
+        ("ms",          std::make_pair("Multistage smoothers", SNESMS));
+  #elif PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR == 4
+  // Mapping from method string to PETSc
+  const std::map<std::string, std::pair<std::string, const SNESType> >
+  PETScSNESSolver::_methods
+   = boost::assign::map_list_of
+      ("default",      std::make_pair("default SNES method", ""))
+      ("newtonls",     std::make_pair("Line search method", SNESNEWTONLS))
+      ("newtontr",     std::make_pair("Trust region method", SNESNEWTONTR))
+      ("test",         std::make_pair("Tool to verify Jacobian approximation", SNESTEST))
+      ("ngmres",       std::make_pair("Nonlinear generalised minimum residual method", SNESNGMRES))
+      ("nrichardson",  std::make_pair("Richardson nonlinear method (Picard iteration)", SNESNRICHARDSON))
+      ("vinewtonrsls", std::make_pair("Reduced space active set solver method (for bounds)", SNESVINEWTONRSLS))
+      ("vinewtonssls", std::make_pair("Reduced space active set solver method (for bounds)", SNESVINEWTONSSLS))
+      ("qn",           std::make_pair("Limited memory quasi-Newton", SNESQN))
+      ("ncg",          std::make_pair("Nonlinear conjugate gradient method", SNESNCG))
+      ("fas",          std::make_pair("Full Approximation Scheme nonlinear multigrid method", SNESFAS))
+      ("nasm",         std::make_pair("Nonlinear Additive Schwartz", SNESNASM))
+      ("anderson",     std::make_pair("Anderson mixing method", SNESANDERSON))
+      ("aspin",        std::make_pair("Additive-Schwarz Preconditioned Inexact Newton", SNESASPIN))
+      ("ms",           std::make_pair("Multistage smoothers", SNESMS));
+  #endif
+#else // Development version
+  // Mapping from method string to PETSc
+  const std::map<std::string, std::pair<std::string, const SNESType> >
+  PETScSNESSolver::_methods
+   = boost::assign::map_list_of
+      ("default",      std::make_pair("default SNES method", ""))
+      ("newtonls",     std::make_pair("Line search method", SNESNEWTONLS))
+      ("newtontr",     std::make_pair("Trust region method", SNESNEWTONTR))
+      ("test",         std::make_pair("Tool to verify Jacobian approximation", SNESTEST))
+      ("ngmres",       std::make_pair("Nonlinear generalised minimum residual method", SNESNGMRES))
+      ("nrichardson",  std::make_pair("Richardson nonlinear method (Picard iteration)", SNESNRICHARDSON))
+      ("vinewtonrsls", std::make_pair("Reduced space active set solver method (for bounds)", SNESVINEWTONRSLS))
+      ("vinewtonssls", std::make_pair("Reduced space active set solver method (for bounds)", SNESVINEWTONSSLS))
+      ("qn",           std::make_pair("Limited memory quasi-Newton", SNESQN))
+      ("ncg",          std::make_pair("Nonlinear conjugate gradient method", SNESNCG))
+      ("fas",          std::make_pair("Full Approximation Scheme nonlinear multigrid method", SNESFAS))
+      ("ms",           std::make_pair("Multistage smoothers", SNESMS));
+#endif
+
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> > PETScSNESSolver::methods()
+{
+  std::vector<std::pair<std::string, std::string> > available_methods;
+  std::map<std::string, std::pair<std::string,
+                                  const SNESType> >::const_iterator it;
+  for (it = _methods.begin(); it != _methods.end(); ++it)
+    available_methods.push_back(std::make_pair(it->first, it->second.first));
+  return available_methods;
+}
+//-----------------------------------------------------------------------------
+Parameters PETScSNESSolver::default_parameters()
+{
+  Parameters p(NewtonSolver::default_parameters());
+  p.rename("snes_solver");
+  p.add("solution_tolerance", 1.0e-16);
+  p.add("maximum_residual_evaluations", 2000);
+  p.add("options_prefix", "default");
+  p.remove("convergence_criterion");
+  p.remove("relaxation_parameter");
+  p.remove("method");
+  p.add("method", "default");
+
+  std::set<std::string> line_searches;
+  line_searches.insert("basic");
+  line_searches.insert("bt");
+  line_searches.insert("l2");
+  line_searches.insert("cp");
+  p.add("line_search", "basic", line_searches);
+
+  std::set<std::string> bound_types;
+  bound_types.insert("default");
+  bound_types.insert("nonnegative");
+  bound_types.insert("nonpositive");
+  p.add("sign", "default", bound_types);
+
+  return p;
+}
+//-----------------------------------------------------------------------------
+PETScSNESSolver::PETScSNESSolver(std::string nls_type) : _snes(NULL)
+{
+  // Check that the requested method is known
+  if (_methods.count(nls_type) == 0)
+  {
+    dolfin_error("PETScSNESSolver.cpp",
+                 "create PETSc SNES solver",
+                 "Unknown SNES method \"%s\"", nls_type.c_str());
+  }
+
+  // Set parameter values
+  parameters = default_parameters();
+
+  init(nls_type);
+}
+//-----------------------------------------------------------------------------
+PETScSNESSolver::~PETScSNESSolver()
+{
+  if (_snes)
+    SNESDestroy(&_snes);
+}
+//-----------------------------------------------------------------------------
+void PETScSNESSolver::init(const std::string& method)
+{
+  if (_snes)
+    SNESDestroy(&_snes);
+
+  // Create SNES object
+  SNESCreate(PETSC_COMM_WORLD, &_snes);
+
+  // Set solver type
+  if (method != "default")
+  {
+    std::map<std::string, std::pair<std::string,
+                                    const SNESType> >::const_iterator it;
+    it = _methods.find(method);
+    dolfin_assert(it != _methods.end());
+    SNESSetType(_snes, it->second.second);
+  }
+
+  // Set to default to not having explicit bounds
+  has_explicit_bounds = false;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, bool>
+PETScSNESSolver::solve(NonlinearProblem& nonlinear_problem,
+                       GenericVector& x,
+                       const GenericVector& lb,
+                       const GenericVector& ub)
+{
+  // Set linear solver parameters
+  set_linear_solver_parameters();
+
+  // Check size of the bound vectors
+  if (lb.size() != ub.size())
+  {
+    dolfin_error("PETScSNESSolver.cpp",
+                 "assigning upper and lower bounds",
+                 "The size of the given upper and lower bounds is different");
+  }
+  else if (lb.size() != x.size())
+  {
+    dolfin_error("PETScSNESSolver.cpp",
+                 "assigning upper and lower bounds",
+                 "The size of the bounds is different from the size of the solution vector");
+  }
+
+  // Set the bounds
+  std::shared_ptr<const PETScVector>
+    _ub(&ub.down_cast<PETScVector>(), NoDeleter());
+  std::shared_ptr<const PETScVector>
+    _lb(&lb.down_cast<PETScVector>(), NoDeleter());
+  this->lb = _lb;
+  this->ub = _ub;
+  has_explicit_bounds = true;
+
+  return this->solve(nonlinear_problem, x);
+}
+//-----------------------------------------------------------------------------
+void
+PETScSNESSolver::init(NonlinearProblem& nonlinear_problem,
+                       GenericVector& x)
+{
+  Timer timer("SNES solver init");
+  PETScVector f;
+  PETScMatrix A;
+
+  // Set linear solver parameters
+  set_linear_solver_parameters();
+
+  const bool report = parameters["report"];
+
+  // Compute F(u)
+  nonlinear_problem.form(A, f, x);
+  nonlinear_problem.F(f, x);
+  nonlinear_problem.J(A, x);
+
+  _snes_ctx.nonlinear_problem = &nonlinear_problem;
+  _snes_ctx.x = &x.down_cast<PETScVector>();
+
+  SNESSetFunction(_snes, f.vec(), PETScSNESSolver::FormFunction, &_snes_ctx);
+  SNESSetJacobian(_snes, A.mat(), A.mat(), PETScSNESSolver::FormJacobian,
+                  &_snes_ctx);
+
+  std::string prefix = std::string(parameters["options_prefix"]);
+  if (prefix != "default")
+  {
+    // Make sure that the prefix has a '_' at the end if the user didn't provide it
+    char lastchar = *prefix.rbegin();
+    if (lastchar != '_')
+      prefix += "_";
+
+    SNESSetOptionsPrefix(_snes, prefix.c_str());
+  }
+
+  // Set some options from the parameters
+  if (report)
+    SNESMonitorSet(_snes, SNESMonitorDefault, PETSC_NULL, PETSC_NULL);
+
+  // Set the bounds, if any
+  set_bounds(x);
+
+  // Set the method
+  if (std::string(parameters["method"]) != "default")
+  {
+    std::map<std::string, std::pair<std::string,
+                                    const SNESType> >::const_iterator it;
+    it = _methods.find(std::string(parameters["method"]));
+    dolfin_assert(it != _methods.end());
+    SNESSetType(_snes, it->second.second);
+  // If
+  //      a) the user has set bounds (is_vi())
+  // AND  b) the user has not set a solver (method == default)
+  // THEN set a good method that supports bounds
+  // (most methods do not support bounds)
+  }
+  else if (std::string(parameters["method"]) == "default" && is_vi())
+  {
+    std::map<std::string, std::pair<std::string,
+                                    const SNESType> >::const_iterator it;
+    #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR == 3 && PETSC_VERSION_RELEASE
+    it = _methods.find("viss");
+    #else
+    it = _methods.find("vinewtonssls");
+    #endif
+    dolfin_assert(it != _methods.end());
+    SNESSetType(_snes, it->second.second);
+  }
+
+  SNESLineSearch linesearch;
+
+  #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR < 4
+  SNESGetSNESLineSearch(_snes, &linesearch);
+  #else
+  SNESGetLineSearch(_snes, &linesearch);
+  #endif
+
+  if (report)
+    SNESLineSearchSetMonitor(linesearch, PETSC_TRUE);
+  const std::string line_search_type = std::string(parameters["line_search"]);
+  SNESLineSearchSetType(linesearch, line_search_type.c_str());
+
+  // Tolerances
+  const int max_iters = parameters["maximum_iterations"];
+  const int max_residual_evals = parameters["maximum_residual_evaluations"];
+  SNESSetTolerances(_snes, parameters["absolute_tolerance"],
+                    parameters["relative_tolerance"],
+                    parameters["solution_tolerance"],
+                    max_iters, max_residual_evals);
+
+  // Set some options
+  SNESSetFromOptions(_snes);
+  if (report)
+    SNESView(_snes, PETSC_VIEWER_STDOUT_WORLD);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, bool>
+PETScSNESSolver::solve(NonlinearProblem& nonlinear_problem,
+                       GenericVector& x)
+{
+  Timer timer("SNES solver execution");
+  PETScVector f;
+  PETScMatrix A;
+  PetscInt its;
+  SNESConvergedReason reason;
+
+  this->init(nonlinear_problem, x);
+  SNESSolve(_snes, PETSC_NULL, _snes_ctx.x->vec());
+
+  // Update any ghost values
+  PETScVector& _x = x.down_cast<PETScVector>();
+  _x.update_ghost_values();
+
+  SNESGetIterationNumber(_snes, &its);
+  SNESGetConvergedReason(_snes, &reason);
+
+  const bool report = parameters["report"];
+
+  MPI_Comm comm = MPI_COMM_NULL;
+  PetscObjectGetComm((PetscObject)_snes, &comm);
+  if (reason > 0 && report && dolfin::MPI::rank(comm) == 0)
+  {
+    info("PETSc SNES solver converged in %d iterations with convergence reason %s.",
+         its, SNESConvergedReasons[reason]);
+  }
+  else if (reason < 0 && dolfin::MPI::rank(comm) == 0)
+  {
+    warning("PETSc SNES solver diverged in %d iterations with divergence reason %s.",
+            its, SNESConvergedReasons[reason]);
+  }
+
+  if (parameters["error_on_nonconvergence"] && reason < 0)
+  {
+    dolfin_error("PETScSNESSolver.cpp",
+                 "solve nonlinear system with PETScSNESSolver",
+                 "Solver did not converge",
+                 "Bummer");
+  }
+
+  return std::make_pair(its, reason > 0);
+}
+//-----------------------------------------------------------------------------
+PetscErrorCode PETScSNESSolver::FormFunction(SNES snes, Vec x, Vec f, void* ctx)
+{
+  struct snes_ctx_t snes_ctx = *(struct snes_ctx_t*) ctx;
+  NonlinearProblem* nonlinear_problem = snes_ctx.nonlinear_problem;
+  PETScVector* _x = snes_ctx.x;
+
+  // Wrap the PETSc Vec as DOLFIN PETScVector
+  PETScVector x_wrap(x);
+  PETScVector f_wrap(f);
+
+  // Update current solution that is associated with nonlinear
+  // problem. This is required because x is not the solution vector
+  // that was passed to PETSc. PETSc updates the solution vector at
+  // the end of solve. We should find a better solution.
+  *_x = x_wrap;
+
+  // Update ghost values
+  _x ->update_ghost_values();
+
+  // Compute F(u)
+  PETScMatrix A;
+  nonlinear_problem->form(A, f_wrap, *_x);
+  nonlinear_problem->F(f_wrap, *_x);
+
+  return 0;
+}
+//-----------------------------------------------------------------------------
+#if PETSC_VERSION_RELEASE
+PetscErrorCode PETScSNESSolver::FormJacobian(SNES snes, Vec x, Mat* A, Mat* P,
+                                             MatStructure* flag, void* ctx)
+{
+  // Interface does not presently support a preconditioner that
+  // differs from operator A
+  if (*A != *P)
+  {
+    dolfin_error("PETScSNESSolver.cpp",
+                 "for Jacobian",
+                 "Matrix object incompatibility. The Jacobian matrix must not be reset when using PETSc SNES.");
+  }
+
+  // Get nonlinear problem object
+  struct snes_ctx_t snes_ctx = *(struct snes_ctx_t*) ctx;
+  NonlinearProblem* nonlinear_problem = snes_ctx.nonlinear_problem;
+
+  // Wrap the PETSc objects
+  PETScMatrix A_wrap(*P);
+  PETScVector x_wrap(x);
+
+
+  // Form Jacobian
+  PETScVector f;
+  nonlinear_problem->form(A_wrap, f, x_wrap);
+  nonlinear_problem->J(A_wrap, x_wrap);
+
+  *flag = SAME_NONZERO_PATTERN;
+
+  return 0;
+}
+#else
+PetscErrorCode PETScSNESSolver::FormJacobian(SNES snes, Vec x, Mat A, Mat P,
+                                             void* ctx)
+{
+  // Interface does not presently support a preconditioner that
+  // differs from operator A
+  if (A != P)
+  {
+    dolfin_error("PETScSNESSolver.cpp",
+                 "for Jacobian",
+                 "Matrix object incompatibility. The Jacobian matrix must not be reset when using PETSc SNES.");
+  }
+
+  // Get nonlinear problem object
+  struct snes_ctx_t snes_ctx = *(struct snes_ctx_t*) ctx;
+  NonlinearProblem* nonlinear_problem = snes_ctx.nonlinear_problem;
+
+  // Wrap the PETSc objects
+  PETScMatrix A_wrap(P);
+  PETScVector x_wrap(x);
+
+  // Form Jacobian
+  PETScVector f;
+  nonlinear_problem->form(A_wrap, f, x_wrap);
+  nonlinear_problem->J(A_wrap, x_wrap);
+
+  return 0;
+}
+#endif
+//-----------------------------------------------------------------------------
+void PETScSNESSolver::set_linear_solver_parameters()
+{
+  KSP ksp;
+  PC pc;
+
+  SNESGetKSP(_snes, &ksp);
+  KSPGetPC(ksp, &pc);
+
+  MPI_Comm comm = MPI_COMM_NULL;
+  PetscObjectGetComm((PetscObject)_snes, &comm);
+
+  if (parameters["report"])
+    KSPMonitorSet(ksp, KSPMonitorDefault, PETSC_NULL, PETSC_NULL);
+
+  const std::string linear_solver  = parameters["linear_solver"];
+  const std::string preconditioner = parameters["preconditioner"];
+
+  if (linear_solver == "default")
+  {
+    // Do nothing
+  }
+  else if (PETScKrylovSolver::_methods.count(linear_solver) != 0)
+  {
+    std::map<std::string, const KSPType>::const_iterator
+      solver_pair = PETScKrylovSolver::_methods.find(linear_solver);
+    dolfin_assert(solver_pair != PETScKrylovSolver::_methods.end());
+    KSPSetType(ksp, solver_pair->second);
+    if (preconditioner != "default"
+        && PETScPreconditioner::_methods.count(preconditioner) != 0)
+    {
+      std::map<std::string, const PCType>::const_iterator it
+        = PETScPreconditioner::_methods.find(preconditioner);
+      dolfin_assert(it != PETScPreconditioner::_methods.end());
+      PCSetType(pc, it->second);
+    }
+
+    Parameters krylov_parameters = parameters("krylov_solver");
+
+    // GMRES restart parameter
+    const int gmres_restart = krylov_parameters("gmres")["restart"];
+    KSPGMRESSetRestart(ksp, gmres_restart);
+
+    // Non-zero initial guess
+    const bool nonzero_guess = krylov_parameters["nonzero_initial_guess"];
+    if (nonzero_guess)
+      KSPSetInitialGuessNonzero(ksp, PETSC_TRUE);
+    else
+      KSPSetInitialGuessNonzero(ksp, PETSC_FALSE);
+
+    if (krylov_parameters["monitor_convergence"])
+      KSPMonitorSet(ksp, KSPMonitorTrueResidualNorm, 0, 0);
+
+    // Set tolerances
+    const int max_iters = krylov_parameters["maximum_iterations"];
+    KSPSetTolerances(ksp,
+                     krylov_parameters["relative_tolerance"],
+                     krylov_parameters["absolute_tolerance"],
+                     krylov_parameters["divergence_limit"],
+                     max_iters);
+  }
+  else if (linear_solver == "lu"
+           || PETScLUSolver::_methods.count(linear_solver) != 0)
+  {
+    std::string lu_method;
+    if (PETScLUSolver::_methods.find(linear_solver)
+        != PETScLUSolver::_methods.end())
+    {
+      lu_method = linear_solver;
+    }
+    else
+    {
+      if (MPI::size(comm) == 1)
+      {
+        #if PETSC_HAVE_UMFPACK
+        lu_method = "umfpack";
+        #elif PETSC_HAVE_MUMPS
+        lu_method = "mumps";
+        #elif PETSC_HAVE_PASTIX
+        lu_method = "pastix";
+        #elif PETSC_HAVE_SUPERLU
+        lu_method = "superlu";
+        #else
+        lu_method = "petsc";
+        warning("Using PETSc native LU solver. Consider configuring PETSc with an efficient LU solver (e.g. UMFPACK, MUMPS).");
+        #endif
+      }
+      else
+      {
+        #if PETSC_HAVE_SUPERLU_DIST
+        lu_method = "superlu_dist";
+        #elif PETSC_HAVE_PASTIX
+        lu_method = "pastix";
+        #elif PETSC_HAVE_MUMPS
+        lu_method = "mumps";
+        #else
+        dolfin_error("PETScSNESSolver.cpp",
+                     "solve linear system using PETSc LU solver",
+                     "No suitable solver for parallel LU found. Consider configuring PETSc with MUMPS or SuperLU_dist");
+        #endif
+      }
+    }
+
+    KSPSetType(ksp, KSPPREONLY);
+    PCSetType(pc, PCLU);
+    std::map<std::string, const MatSolverPackage>::const_iterator
+      it = PETScLUSolver::_methods.find(lu_method);
+    dolfin_assert(it != PETScLUSolver::_methods.end());
+    PCFactorSetMatSolverPackage(pc, it->second);
+  }
+  else
+  {
+    dolfin_error("PETScSNESSolver.cpp",
+                 "set linear solver options",
+                 "Unknown KSP method \"%s\"", linear_solver.c_str());
+  }
+}
+//-----------------------------------------------------------------------------
+void PETScSNESSolver::set_bounds(GenericVector& x)
+{
+  if (is_vi())
+  {
+    dolfin_assert(_snes);
+    const std::string sign   = parameters["sign"];
+    const std::string method = parameters["method"];
+    #if PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR == 3
+    if (method != "virs" && method != "viss" && method != "default")
+    {
+      dolfin_error("PETScSNESSolver.cpp",
+                   "set variational inequality bounds",
+                   "Need to use virs or viss methods if bounds are set");
+    }
+    #else
+    if (method != "vinewtonrsls" && method != "vinewtonssls" && method != "default")
+    {
+      dolfin_error("PETScSNESSolver.cpp",
+                   "set variational inequality bounds",
+                   "Need to use vinewtonrsls or vinewtonssls methods if bounds are set");
+    }
+    #endif
+
+    if (sign != "default")
+    {
+      // Here, x is the model vector from which we make our Vecs that
+      // tell PETSc the bounds.
+      Vec ub, lb;
+
+      PETScVector _x = x.down_cast<PETScVector>();
+      VecDuplicate(_x.vec(), &ub);
+      VecDuplicate(_x.vec(), &lb);
+      if (sign == "nonnegative")
+      {
+        #if PETSC_VERSION_RELEASE
+        VecSet(ub, SNES_VI_INF);
+        #else
+        VecSet(ub, PETSC_INFINITY);
+        #endif
+
+        VecSet(lb, 0.0);
+      }
+      else if (sign == "nonpositive")
+      {
+        VecSet(ub, 0.0);
+
+        #if PETSC_VERSION_RELEASE
+        VecSet(lb, SNES_VI_INF);
+        #else
+        VecSet(lb, PETSC_INFINITY);
+        #endif
+
+      }
+      else
+      {
+        dolfin_error("PETScSNESSolver.cpp",
+                     "set PETSc SNES solver bounds",
+                     "Unknown bound type \"%s\"", sign.c_str());
+      }
+
+      SNESVISetVariableBounds(_snes, lb, ub);
+      VecDestroy(&ub);
+      VecDestroy(&lb);
+    }
+    else if (has_explicit_bounds == true)
+    {
+      const PETScVector* lb = this->lb.get();
+      const PETScVector* ub = this->ub.get();
+      SNESVISetVariableBounds(_snes, lb->vec(), ub->vec());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+bool PETScSNESSolver::is_vi() const
+{
+  const std::string sign = parameters["sign"];
+  if (sign != "default" && this->has_explicit_bounds == true)
+  {
+    dolfin_error("PETScSNESSolver.cpp",
+                 "set variational inequality bounds",
+                 "Both the sign parameter and the explicit bounds are set");
+    return false;
+  }
+  else if (sign != "default" || this->has_explicit_bounds == true)
+    return true;
+  else
+    return false;
+}
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/nls/PETScSNESSolver.h b/dolfin/nls/PETScSNESSolver.h
new file mode 100644
index 0000000..ae57e8f
--- /dev/null
+++ b/dolfin/nls/PETScSNESSolver.h
@@ -0,0 +1,168 @@
+// Copyright (C) 2012 Patrick E. Farrell
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Corrado Maurini, 2013.
+//
+// First added:  2012-10-13
+// Last changed: 2013-11-21
+
+#ifndef __PETSC_SNES_SOLVER_H
+#define __PETSC_SNES_SOLVER_H
+
+#ifdef ENABLE_PETSC_SNES
+
+#include <map>
+#include <petscsnes.h>
+#include <memory>
+#include <dolfin/nls/NewtonSolver.h>
+#include <dolfin/parameter/Parameters.h>
+#include <dolfin/la/PETScObject.h>
+#include <dolfin/la/PETScVector.h>
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class PETScVector;
+
+  /// This class implements methods for solving nonlinear systems
+  /// via PETSc's SNES interface. It includes line search and trust
+  /// region techniques for globalising the convergence of the
+  /// nonlinear iteration.
+
+  class PETScSNESSolver : public PETScObject
+  {
+  public:
+
+    /// Create SNES solver for a particular method
+    PETScSNESSolver(std::string nls_type="default");
+
+    /// Destructor
+    virtual ~PETScSNESSolver();
+
+    /// Solve a nonlinear variational inequality with bound constraints
+    ///
+    /// *Arguments*
+    ///     nonlinear_function (_NonlinearProblem_)
+    ///         The nonlinear problem.
+    ///     x (_GenericVector_)
+    ///         The vector.
+    ///     lb (_GenericVector_)
+    ///         The lower bound.
+    ///     ub (_GenericVector_)
+    ///         The upper bound.
+    ///
+    /// *Returns*
+    ///     std::pair<std::size_t, bool>
+    ///         Pair of number of Newton iterations, and whether
+    ///         iteration converged)
+    std::pair<std::size_t, bool> solve(NonlinearProblem& nonlinear_problem,
+                                       GenericVector& x,
+                                       const GenericVector& lb,
+                                       const GenericVector& ub);
+
+    /// Solve abstract nonlinear problem :math:`F(x) = 0` for given
+    /// :math:`F` and Jacobian :math:`\dfrac{\partial F}{\partial x}`.
+    ///
+    /// *Arguments*
+    ///     nonlinear_function (_NonlinearProblem_)
+    ///         The nonlinear problem.
+    ///     x (_GenericVector_)
+    ///         The vector.
+    ///
+    /// *Returns*
+    ///     std::pair<std::size_t, bool>
+    ///         Pair of number of Newton iterations, and whether
+    ///         iteration converged)
+    std::pair<std::size_t, bool> solve(NonlinearProblem& nonlinear_function,
+                                       GenericVector& x);
+
+    /// Set up the SNES object, but don't do anything yet, in case the
+    /// user wants to access the SNES object directly
+    void init(NonlinearProblem& nonlinear_problem, GenericVector& x);
+
+    /// Return a list of available solver methods
+    static std::vector<std::pair<std::string, std::string> > methods();
+
+    /// Default parameter values
+    static Parameters default_parameters();
+
+    Parameters parameters;
+
+    /// Return PETSc SNES pointer
+    SNES snes() const
+    { return _snes; }
+
+  private:
+    struct snes_ctx_t
+    {
+      NonlinearProblem* nonlinear_problem;
+      PETScVector* x;
+      const PETScVector* xl;
+      const PETScVector* xu;
+    };
+
+    // PETSc solver pointer
+    SNES _snes;
+
+    // Initialize SNES solver
+    void init(const std::string& method);
+
+    // Update the linear solver parameters
+    void set_linear_solver_parameters();
+
+    // Available solvers
+    static const std::map<std::string,
+      std::pair<std::string, const SNESType> > _methods;
+
+    // The callback for PETSc to compute F, the nonlinear residual
+    static PetscErrorCode FormFunction(SNES snes, Vec x, Vec f, void* ctx);
+
+    // The callback for PETSc to compute A, the Jacobian
+    #if PETSC_VERSION_RELEASE
+    static PetscErrorCode FormJacobian(SNES snes, Vec x, Mat* A, Mat* B,
+                                       MatStructure* flag, void* ctx);
+    #else
+    static PetscErrorCode FormJacobian(SNES snes, Vec x, Mat A, Mat B,
+                                       void* ctx);
+    #endif
+
+    // Set the bounds on the problem from the parameters, if desired
+    // Here, x is passed in as a model vector from which we make our
+    // Vecs that tell PETSc the bounds if the "sign" parameter is
+    // used.
+    void set_bounds(GenericVector& x);
+
+    // Check if the problem is a variational inequality
+    bool is_vi() const;
+
+    // Upper and lower bounds for bound-constrained solvers
+    std::shared_ptr<const PETScVector> lb;
+    std::shared_ptr<const PETScVector> ub;
+
+    // Flag to indicate if explicit bounds are set
+    bool has_explicit_bounds;
+
+    // SNES context
+    struct snes_ctx_t _snes_ctx;
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/nls/TAOLinearBoundSolver.cpp b/dolfin/nls/TAOLinearBoundSolver.cpp
new file mode 100644
index 0000000..73a0170
--- /dev/null
+++ b/dolfin/nls/TAOLinearBoundSolver.cpp
@@ -0,0 +1,450 @@
+// Copyright (C) 2012 Corrado Maurini
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added : 2012-12-03
+// Last changed: 2013-04-04
+
+#ifdef ENABLE_PETSC_TAO
+
+#include <petsclog.h>
+
+#include <dolfin/common/Timer.h>
+#include <boost/assign/list_of.hpp>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/NoDeleter.h>
+#include "dolfin/la/GenericMatrix.h"
+#include "dolfin/la/GenericVector.h"
+#include "dolfin/la/PETScMatrix.h"
+#include "dolfin/la/PETScVector.h"
+#include "dolfin/la/PETScKrylovSolver.h"
+#include "dolfin/la/PETScPreconditioner.h"
+#include "TAOLinearBoundSolver.h"
+#include "petscksp.h"
+#include "petscvec.h"
+#include "petscmat.h"
+#include "petsctao.h"
+
+#include <dolfin/common/timing.h>
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+// Mapping from ksp_method string to PETSc
+const std::map<std::string, const KSPType> TAOLinearBoundSolver::_ksp_methods
+  = boost::assign::map_list_of("default",    ""         )
+                              ("cg",         KSPCG      )
+                              ("gmres",      KSPGMRES   )
+                              ("minres",     KSPMINRES  )
+                              ("tfqmr",      KSPTFQMR   )
+                              ("richardson", KSPRICHARDSON)
+                              ("stcg",       KSPSTCG     )
+                              ("bicgstab",   KSPBCGS    );
+//-----------------------------------------------------------------------------
+// Mapping from method string to description
+const std::vector<std::pair<std::string, std::string> >
+  TAOLinearBoundSolver::_methods_descr = boost::assign::pair_list_of
+    ("default"  ,  "Default Tao method (tao_tron)"         )
+    ("tron" ,  "Newton Trust Region method"            )
+    ("bqpip",  "Interior Point Newton Algorithm"       )
+    ("gpcg" ,  "Gradient Projection Conjugate Gradient")
+    ("blmvm",  "Limited memory variable metric method" );
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+TAOLinearBoundSolver::methods()
+{
+  return TAOLinearBoundSolver::_methods_descr;
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+TAOLinearBoundSolver::krylov_solvers()
+{
+  return PETScKrylovSolver::methods();
+}
+//-----------------------------------------------------------------------------
+std::vector<std::pair<std::string, std::string> >
+TAOLinearBoundSolver::preconditioners()
+{
+  return PETScPreconditioner::preconditioners();
+}
+//-----------------------------------------------------------------------------
+TAOLinearBoundSolver::TAOLinearBoundSolver(const std::string method,
+                                           const std::string ksp_type,
+                                           const std::string pc_type)
+  : _tao(NULL), preconditioner(new PETScPreconditioner(pc_type)),
+    preconditioner_set(false)
+{
+  // Set parameter values
+  parameters = default_parameters();
+
+  //Initialize the Tao solver
+  init(method);
+
+  //Set the PETSC KSP used by TAO
+  set_ksp(ksp_type);
+
+  // Some preconditioners may lead to errors because not compatible with TAO.
+  if ((pc_type != "default") or (ksp_type != "default") or (method != "default"))
+  {
+    log(WARNING, "Some preconditioners may be not be applicable to "\
+	"TAO solvers and generate errors.");
+  }
+
+}
+//-----------------------------------------------------------------------------
+TAOLinearBoundSolver::~TAOLinearBoundSolver()
+{
+  if (_tao)
+    TaoDestroy(&_tao);
+}
+//-----------------------------------------------------------------------------
+void
+TAOLinearBoundSolver::set_operators(std::shared_ptr<const GenericMatrix> A,
+                                    std::shared_ptr<const GenericVector> b)
+{
+  std::shared_ptr<const PETScMatrix>
+    _matA = GenericTensor::down_cast<const PETScMatrix>(A);
+  std::shared_ptr<const PETScVector>
+    _b = GenericTensor::down_cast<const PETScVector>(b);
+  set_operators(_matA, _b);
+}
+//-----------------------------------------------------------------------------
+void
+TAOLinearBoundSolver::set_operators(std::shared_ptr<const PETScMatrix> A,
+				    std::shared_ptr<const PETScVector> b)
+{
+  this->A = A;
+  this->b = b;
+  dolfin_assert(this->A);
+  dolfin_assert(this->b);
+}
+//-----------------------------------------------------------------------------
+std::size_t TAOLinearBoundSolver::solve(const GenericMatrix& A1,
+                                        GenericVector& x,
+					const GenericVector& b1,
+                                        const GenericVector& xl,
+					const GenericVector& xu)
+{
+  return solve(A1.down_cast<PETScMatrix>(),
+	       x.down_cast<PETScVector>(),
+	       b1.down_cast<PETScVector>(),
+	       xl.down_cast<PETScVector>(),
+	       xu.down_cast<PETScVector>());
+}
+//-----------------------------------------------------------------------------
+std::size_t TAOLinearBoundSolver::solve(const PETScMatrix& A1,
+                                        PETScVector& x,
+					const PETScVector& b1,
+                                        const PETScVector& xl,
+					const PETScVector& xu)
+{
+
+  // Check symmetry
+  dolfin_assert(A1.size(0) == A1.size(1));
+
+  // Set operators (A and b)
+  std::shared_ptr<const PETScMatrix> _matA(&A1, NoDeleter());
+  std::shared_ptr<const PETScVector> _b(&b1, NoDeleter());
+  set_operators(_matA,_b);
+  dolfin_assert(A->mat());
+  //dolfin_assert(b->vec());
+
+  // Set initial vector
+  dolfin_assert(_tao);
+  TaoSetInitialVector(_tao, x.vec());
+
+  // Set the bound on the variables
+  TaoSetVariableBounds(_tao, xl.vec(), xu.vec());
+
+  // Set the user function, gradient, hessian evaluation routines and
+  // data structures
+  TaoSetObjectiveAndGradientRoutine(_tao,
+                                    __TAOFormFunctionGradientQuadraticProblem,
+                                    this);
+  TaoSetHessianRoutine(_tao, A->mat(), A->mat(),
+                       __TAOFormHessianQuadraticProblem, this);
+
+  // Set parameters from local parameters, including ksp parameters
+  read_parameters();
+
+  // Clear previous monitors
+  TaoCancelMonitors(_tao);
+
+  // Set the monitor
+  if (parameters["monitor_convergence"])
+    TaoSetMonitor(_tao, __TAOMonitor, this, PETSC_NULL);
+
+
+  // Check for any tao command line options
+  std::string prefix = std::string(parameters["options_prefix"]);
+  if (prefix != "default")
+  {
+    // Make sure that the prefix has a '_' at the end if the user
+    // didn't provide it
+    char lastchar = *prefix.rbegin();
+    if (lastchar != '_')
+      prefix += "_";
+
+    TaoSetOptionsPrefix(_tao, prefix.c_str());
+  }
+  TaoSetFromOptions(_tao);
+
+  // Solve the bound constrained problem
+  Timer timer("TAO solver");
+  const char* tao_type;
+  TaoGetType(_tao, &tao_type);
+  log(PROGRESS, "Tao solver %s starting to solve %i x %i system", tao_type,
+      A->size(0), A->size(1));
+
+  // Solve
+  TaoSolve(_tao);
+
+  // Update ghost values
+  x.update_ghost_values();
+
+  // Print the report on convergences and methods used
+  if (parameters["report"])
+    TaoView(_tao, PETSC_VIEWER_STDOUT_WORLD);
+
+  // Check for convergence
+  TaoConvergedReason reason;
+  TaoGetConvergedReason(_tao, &reason);
+
+  // Get the number of iterations
+  PetscInt num_iterations = 0;
+  TaoGetMaximumIterations(_tao, &num_iterations);
+
+  // Report number of iterations
+  if (reason >= 0)
+    log(PROGRESS, "Tao solver converged\n");
+  else
+  {
+    bool error_on_nonconvergence = parameters["error_on_nonconvergence"];
+    if (error_on_nonconvergence)
+    {
+      TaoView(_tao, PETSC_VIEWER_STDOUT_WORLD);
+      dolfin_error("TAOLinearBoundSolver.cpp",
+                   "solve linear system using Tao solver",
+                   "Solution failed to converge in %i iterations (TAO reason %d)",
+                   num_iterations, reason);
+    }
+    else
+    {
+      log(WARNING,  "Tao solver %s failed to converge. Try a different TAO method,"\
+	  " adjust some parameters", tao_type);
+    }
+  }
+
+  return num_iterations;
+}
+//-----------------------------------------------------------------------------
+void TAOLinearBoundSolver::set_solver(const std::string& method)
+{
+  dolfin_assert(_tao);
+
+  // Do nothing if default type is specified
+  if (method == "default")
+    TaoSetType(_tao, "tron");
+  else
+  {
+    // Choose solver
+    if (method == "tron")
+      TaoSetType(_tao, "tron");
+    else if (method == "blmvm")
+      TaoSetType(_tao, "blmvm" );
+    else if (method == "gpcg")
+      TaoSetType(_tao, "gpcg" );
+    else if (method == "bqpip")
+      TaoSetType(_tao, "bqpip");
+    else
+    {
+      dolfin_error("TAOLinearBoundSolver.cpp",
+		   "set solver for TAO solver",
+                   "Unknown solver type (\"%s\")", method.c_str());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void TAOLinearBoundSolver::set_ksp(std::string ksp_type)
+{
+  // Set ksp type
+  if (ksp_type != "default")
+  {
+    dolfin_assert(_tao);
+    KSP ksp;
+    TaoGetKSP(_tao, &ksp);
+    if (ksp)
+      KSPSetType(ksp, _ksp_methods.find(ksp_type)->second);
+    else
+    {
+      log(WARNING, "The selected tao solver does not allow to set a specific "\
+	  "Krylov solver. Option %s is ignored", ksp_type.c_str());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+Tao TAOLinearBoundSolver::tao() const
+{
+  return _tao;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const PETScMatrix> TAOLinearBoundSolver::get_matrix() const
+{
+  return A;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<const PETScVector> TAOLinearBoundSolver::get_vector() const
+{
+  return b;
+}
+//-----------------------------------------------------------------------------
+void TAOLinearBoundSolver::read_parameters()
+{
+  dolfin_assert(_tao);
+
+  // Set tolerances
+  TaoSetTolerances(_tao, parameters["function_absolute_tol"],
+		   parameters["function_relative_tol"],
+		   parameters["gradient_absolute_tol"],
+		   parameters["gradient_relative_tol"],
+		   parameters["gradient_t_tol"]);
+
+  // Set TAO solver maximum iterations
+  int maxits = parameters["maximum_iterations"];
+  TaoSetMaximumIterations(_tao, maxits);
+
+  // Set ksp_options
+  set_ksp_options();
+}
+//-----------------------------------------------------------------------------
+void TAOLinearBoundSolver::init(const std::string& method)
+{
+  // Check that nobody else shares this solver
+  if (_tao)
+    TaoDestroy(&_tao);
+
+  // Set up solver environment
+  TaoCreate(PETSC_COMM_WORLD, &_tao);
+
+  // Set tao solver
+  set_solver(method);
+}
+//-----------------------------------------------------------------------------
+void TAOLinearBoundSolver::set_ksp_options()
+{
+  dolfin_assert(_tao);
+  KSP ksp;
+  TaoGetKSP(_tao, &ksp);
+  if (ksp)
+  {
+    Parameters krylov_parameters = parameters("krylov_solver");
+
+    // GMRES restart parameter
+    const int gmres_restart = krylov_parameters("gmres")["restart"];
+    KSPGMRESSetRestart(ksp, gmres_restart);
+
+    // Non-zero initial guess
+    const bool nonzero_guess = krylov_parameters["nonzero_initial_guess"];
+    if (nonzero_guess)
+      KSPSetInitialGuessNonzero(ksp, PETSC_TRUE);
+    else
+      KSPSetInitialGuessNonzero(ksp, PETSC_FALSE);
+
+    if (krylov_parameters["monitor_convergence"])
+      KSPMonitorSet(ksp, KSPMonitorTrueResidualNorm, 0, 0);
+
+    // Set tolerances
+    const int max_ksp_it = krylov_parameters["maximum_iterations"];
+    KSPSetTolerances(ksp,
+                     krylov_parameters["relative_tolerance"],
+		     krylov_parameters["absolute_tolerance"],
+		     krylov_parameters["divergence_limit"],
+		     max_ksp_it);
+
+    // Set preconditioner
+    if (preconditioner && !preconditioner_set)
+    {
+      PETScKrylovSolver dolfin_ksp(ksp);
+      preconditioner->set(dolfin_ksp);
+      preconditioner_set = true;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+PetscErrorCode
+TAOLinearBoundSolver::__TAOFormFunctionGradientQuadraticProblem(Tao tao,
+                                                                Vec X,
+                                                                PetscReal *ener,
+                                                                Vec G,
+                                                                void *ptr)
+{
+   PetscReal AXX, bX;
+   const TAOLinearBoundSolver* solver = static_cast<TAOLinearBoundSolver*>(ptr);
+   const PETScMatrix* A = solver->get_matrix().get();
+   const PETScVector* b = solver->get_vector().get();
+
+   dolfin_assert(A);
+   dolfin_assert(b);
+
+   // Calculate AX=A*X and store in G
+   MatMult(A->mat(), X, G);
+
+   // Calculate AXX=A*X*X
+   VecDot(G, X, &AXX);
+
+   // Calculate bX=b*X
+   VecDot(b->vec(), X, &bX);
+
+   // Calculate the functional value ener=1/2*A*X*X-b*X
+   *ener = 0.5*AXX-bX;
+
+   // Calculate the gradient vector G=A*X-b
+   VecAXPBY(G, -1.0, 1.0, b->vec());
+   return 0;
+}
+//-----------------------------------------------------------------------------
+PetscErrorCode
+TAOLinearBoundSolver::__TAOFormHessianQuadraticProblem(Tao tao,
+                                                       Vec X, Mat H,
+                                                       Mat Hpre,
+                                                       void *ptr)
+{
+   const TAOLinearBoundSolver* solver = static_cast<TAOLinearBoundSolver*>(ptr);
+   const PETScMatrix* A = solver->get_matrix().get();
+
+   dolfin_assert(A);
+
+   // Set the hessian to the matrix A (quadratic problem)
+   Mat Atmp = A->mat();
+   H = Atmp;
+   return 0;
+}
+//------------------------------------------------------------------------------
+PetscErrorCode TAOLinearBoundSolver::__TAOMonitor(Tao tao, void *ctx)
+{
+  dolfin_assert(tao);
+  PetscInt its;
+  PetscReal f, gnorm, cnorm, xdiff;
+  TaoConvergedReason reason;
+  TaoGetSolutionStatus(tao, &its, &f, &gnorm, &cnorm, &xdiff, &reason);
+  if (!(its%5))
+    PetscPrintf(PETSC_COMM_WORLD,"iteration=%D\tf=%g\n",its,(double)f);
+
+  return 0;
+}
+//------------------------------------------------------------------------------
+#endif
diff --git a/dolfin/nls/TAOLinearBoundSolver.h b/dolfin/nls/TAOLinearBoundSolver.h
new file mode 100644
index 0000000..50fbe6d
--- /dev/null
+++ b/dolfin/nls/TAOLinearBoundSolver.h
@@ -0,0 +1,222 @@
+// Copyright (C) 2012 Corrado Maurini
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-12-03
+// Last changed: 2013-04-02
+
+#ifndef _TAOLinearBoundSolver_H
+#define _TAOLinearBoundSolver_H
+
+#ifdef ENABLE_PETSC_TAO
+
+#include <memory>
+
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/common/types.h>
+#include <map>
+#include <petscksp.h>
+#include <petscpc.h>
+#include <petsctao.h>
+#include <dolfin/la/PETScObject.h>
+#include <dolfin/la/KrylovSolver.h>
+
+namespace dolfin
+{
+
+  /// Forward declarations
+  class GenericMatrix;
+  class GenericVector;
+  class PETScMatrix;
+  class PETScVector;
+  class PETScPreconditioner;
+  class PETScKrylovSolver;
+  class PETScKSPDeleter;
+
+  /// This class provides a bound constrained solver for a
+  /// linear variational inequality defined by a matrix A and a vector b.
+  /// It solves the problem:
+  ///
+  /// Find :math:`x_l\leq x\leq x_u` such that
+  /// :math:`(Ax-b)\cdot (y-x)\geq 0,\; \forall x_l\leq y\leq x_u`
+  ///
+  /// It is a wrapper for the TAO bound constrained solver.
+  ///
+  /// *Example*
+  ///    .. code-block:: python
+  ///
+  ///       # Assemble the linear system
+  ///       A, b = assemble_system(a, L, bc)
+  ///       # Define the constraints
+  ///       constraint_u = Constant(1.)
+  ///       constraint_l = Constant(0.)
+  ///       u_min = interpolate(constraint_l, V)
+  ///       u_max = interpolate(constraint_u, V)
+  ///       # Define the function to store the solution
+  ///       usol=Function(V)
+  ///       # Create the TAOLinearBoundSolver
+  ///       solver=TAOLinearBoundSolver("tao_gpcg","gmres")
+  ///       # Set some parameters
+  ///       solver.parameters["monitor_convergence"]=True
+  ///       solver.parameters["report"]=True
+  ///       # Solve the problem
+  ///       solver.solve(A, usol.vector(), b , u_min.vector(), u_max.vector())
+  ///       info(solver.parameters,True)
+  ///
+  class TAOLinearBoundSolver : public Variable, public PETScObject
+  {
+  public:
+
+    /// Create TAO bound constrained solver
+    TAOLinearBoundSolver(const std::string method = "default",
+                         const std::string ksp_type = "default",
+                         const std::string pc_type = "default");
+
+    /// Destructor
+    ~TAOLinearBoundSolver();
+
+    /// Solve the linear variational inequality defined by A and b
+    /// with xl =< x <= xu
+    std::size_t solve(const GenericMatrix& A, GenericVector& x,
+		      const GenericVector& b, const GenericVector& xl,
+		      const GenericVector& xu);
+
+    /// Solve the linear variational inequality defined by A and b
+    /// with xl =< x <= xu
+    std::size_t solve(const PETScMatrix& A, PETScVector& x,
+                      const PETScVector& b,
+		      const PETScVector& xl, const PETScVector& xu);
+
+    // Set the TAO solver type
+    void set_solver(const std::string&);
+
+    /// Set PETSC Krylov Solver (ksp) used by TAO
+    void set_ksp( const std::string ksp_type = "default");
+
+    // Return TAO solver pointer
+    Tao tao() const;
+
+    /// Return a list of available Tao solver methods
+    static std::vector<std::pair<std::string, std::string> > methods();
+
+    /// Return a list of available krylov solvers
+    static std::vector<std::pair<std::string, std::string> > krylov_solvers();
+
+    /// Return a list of available preconditioners
+    static std::vector<std::pair<std::string, std::string> > preconditioners();
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("tao_solver");
+
+      p.add("monitor_convergence"    , false);
+      p.add("report"                 , false);
+      p.add("function_absolute_tol"  , 1.0e-10);
+      p.add("function_relative_tol"  , 1.0e-10);
+      p.add("gradient_absolute_tol"  , 1.0e-8);
+      p.add("gradient_relative_tol"  , 1.0e-8);
+      p.add("gradient_t_tol"         , 0.0);
+      p.add("error_on_nonconvergence", true);
+      p.add("maximum_iterations"     , 100);
+      p.add("options_prefix"         , "default");
+
+      Parameters ksp("krylov_solver");
+      ksp = KrylovSolver::default_parameters();
+      p.add(ksp);
+
+      return p;
+    }
+
+    // Return Matrix shared pointer
+    std::shared_ptr<const PETScMatrix> get_matrix() const;
+
+    // Return load vector shared pointer
+    std::shared_ptr<const PETScVector> get_vector() const;
+
+  private:
+
+    // Set operators with GenericMatrix and GenericVector
+    void set_operators(std::shared_ptr<const GenericMatrix> A,
+		       std::shared_ptr<const GenericVector> b);
+
+    // Set operators with shared pointer to PETSc objects
+    void set_operators(std::shared_ptr<const PETScMatrix> A,
+		       std::shared_ptr<const PETScVector> b);
+
+    // Callback for changes in parameter values
+    void read_parameters();
+
+    // Available ksp solvers
+    static const std::map<std::string, const KSPType> _ksp_methods;
+
+    // Available tao solvers descriptions
+    static const std::vector<std::pair<std::string, std::string> >
+      _methods_descr;
+
+    // Set options
+    void set_ksp_options();
+
+    // Initialize TAO solver
+    void init(const std::string& method);
+
+    // Tao solver pointer
+    Tao _tao;
+
+    // Petsc preconditioner
+    std::shared_ptr<PETScPreconditioner> preconditioner;
+
+    // Operator (the matrix) and the vector
+    std::shared_ptr<const PETScMatrix> A;
+    std::shared_ptr<const PETScVector> b;
+
+    bool preconditioner_set;
+
+    // Computes the value of the objective function and its gradient.
+    static PetscErrorCode
+      __TAOFormFunctionGradientQuadraticProblem(Tao tao, Vec X,
+                                                PetscReal *ener, Vec G,
+                                                void *ptr);
+
+    // Computes the hessian of the quadratic objective function
+    static PetscErrorCode
+      __TAOFormHessianQuadraticProblem(Tao tao,Vec X, Mat H, Mat Hpre,
+                                       void *ptr);
+
+    //-------------------------------------------------------------------------
+    //  Monitor the state of the solution at each iteration. The
+    //  output printed to the screen is:
+    //
+    //	iterate - the current iterate number (>=0)
+    //	f       - the current function value
+    //	gnorm 	- the square of the gradient norm, duality gap, or other
+    //             measure
+    //            indicating distance from optimality.
+    //  cnorm - the infeasibility of the current solution with regard
+    //         to the constraints.
+    //  xdiff - the step length or trust region radius of the most
+    //         recent iterate.
+    //-------------------------------------------------------------------------
+    static PetscErrorCode __TAOMonitor(Tao tao, void *ctx);
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/nls/dolfin_nls.h b/dolfin/nls/dolfin_nls.h
new file mode 100644
index 0000000..c228b8c
--- /dev/null
+++ b/dolfin/nls/dolfin_nls.h
@@ -0,0 +1,11 @@
+#ifndef __DOLFIN_NLS_H
+#define __DOLFIN_NLS_H
+
+// DOLFIN nonlinear solver
+
+#include <dolfin/nls/NonlinearProblem.h>
+#include <dolfin/nls/NewtonSolver.h>
+#include <dolfin/nls/PETScSNESSolver.h>
+#include <dolfin/nls/TAOLinearBoundSolver.h>
+
+#endif
diff --git a/dolfin/parameter/GlobalParameters.cpp b/dolfin/parameter/GlobalParameters.cpp
new file mode 100644
index 0000000..e5fc695
--- /dev/null
+++ b/dolfin/parameter/GlobalParameters.cpp
@@ -0,0 +1,159 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-07-02
+// Last changed: 2011-11-15
+
+#include <fstream>
+#include <cstdlib>
+#include <iostream>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/io/File.h>
+#include "GlobalParameters.h"
+
+using namespace dolfin;
+
+/// The global parameter database
+GlobalParameters dolfin::parameters;
+
+//-----------------------------------------------------------------------------
+GlobalParameters::GlobalParameters() : Parameters("dolfin")
+{
+  // Set default parameter values
+  *static_cast<Parameters*>(this) = default_parameters();
+
+  // Search paths to parameter files in order of decreasing priority
+  std::vector<std::string> parameter_files;
+  parameter_files.push_back("dolfin_parameters.xml");
+  parameter_files.push_back("dolfin_parameters.xml.gz");
+#ifdef _WIN32
+  std::string home_directory(std::getenv("USERPROFILE"));
+  parameter_files.push_back(home_directory + "\\.config\\fenics\\dolfin_parameters.xml");
+  parameter_files.push_back(home_directory + "\\.config\\fenics\\dolfin_parameters.xml.gz");
+#else
+  std::string home_directory(std::getenv("HOME"));
+  parameter_files.push_back(home_directory + "/.config/fenics/dolfin_parameters.xml");
+  parameter_files.push_back(home_directory + "/.config/fenics/dolfin_parameters.xml.gz");
+#endif
+
+  // Try reading parameters from files
+  for (std::size_t i = 0; i < parameter_files.size(); ++i)
+  {
+    // Check if file exists
+    std::ifstream f;
+    f.open(parameter_files[i].c_str());
+    if (!f.is_open())
+      continue;
+    f.close();
+
+    // Note: Cannot use DOLFIN log system here since it's not initialized
+    std::cout << "Reading DOLFIN parameters from file \""
+              << parameter_files[i] << "\"." << std::endl;
+
+    // Read global parameters from file
+    File file(parameter_files[i]);
+    file >> *this;
+
+    // Don't read further files if found
+    break;
+  }
+}
+//-----------------------------------------------------------------------------
+GlobalParameters::~GlobalParameters()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void GlobalParameters::parse(int argc, char* argv[])
+{
+  log(TRACE, "Parsing command-line arguments.");
+
+  // Extract DOLFIN and PETSc arguments
+  std::vector<std::string> args_dolfin;
+  std::vector<std::string> args_petsc;
+  std::vector<std::string>* current = 0;
+  args_dolfin.push_back(argv[0]);
+  args_petsc.push_back(argv[0]);
+  for (int i = 1; i < argc; ++i)
+  {
+    std::string arg(argv[i]);
+
+    if (arg.size() > 2 && arg.substr(0, 2) == "--")
+    {
+      if (arg.size() > 8 && arg.substr(0, 8) == "--petsc.")
+      {
+        current = &args_petsc;
+        current->push_back("-" + arg.substr(8));
+      }
+      else
+      {
+        current = &args_dolfin;
+        current->push_back(arg);
+      }
+    }
+    else
+    {
+      if (current)
+        current->push_back(arg);
+      else
+        dolfin_error("GlobalParameters.cpp",
+                     "parse command-line options",
+                     "Illegal command-line options");
+    }
+  }
+
+  // Copy to argv lists
+  char** argv_dolfin = new char*[args_dolfin.size()];
+  for (std::size_t i = 0; i < args_dolfin.size(); ++i)
+  {
+    argv_dolfin[i] = new char[args_dolfin[i].size() + 1];
+    sprintf(argv_dolfin[i], "%s", args_dolfin[i].c_str());
+  }
+  char** argv_petsc = new char*[args_petsc.size()];
+  for (std::size_t i = 0; i < args_petsc.size(); ++i)
+  {
+    argv_petsc[i] = new char[args_petsc[i].size() + 1];
+    sprintf(argv_petsc[i], "%s", args_petsc[i].c_str());
+  }
+
+  // Debugging
+  const bool debug = false;
+  if (debug)
+  {
+    cout << "DOLFIN args:";
+    for (std::size_t i = 0; i < args_dolfin.size(); i++)
+      cout << " " << args_dolfin[i];
+    cout << endl;
+    cout << "PETSc args: ";
+    for (std::size_t i = 0; i < args_petsc.size(); i++)
+      cout << " " << args_petsc[i];
+    cout << endl;
+  }
+
+  // Parse DOLFIN and PETSc options
+  parse_common(args_dolfin.size(), argv_dolfin);
+  parse_petsc(args_petsc.size(), argv_petsc);
+
+  // Cleanup
+  for (std::size_t i = 0; i < args_dolfin.size(); ++i)
+    delete [] argv_dolfin[i];
+  for (std::size_t i = 0; i < args_petsc.size(); ++i)
+    delete [] argv_petsc[i];
+  delete [] argv_dolfin;
+  delete [] argv_petsc;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/parameter/GlobalParameters.h b/dolfin/parameter/GlobalParameters.h
new file mode 100644
index 0000000..524f1a6
--- /dev/null
+++ b/dolfin/parameter/GlobalParameters.h
@@ -0,0 +1,193 @@
+// Copyright (C) 2009-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Fredrik Valdmanis, 2011
+//
+// First added:  2009-07-02
+// Last changed: 2013-06-21
+
+#ifndef __GLOBAL_PARAMETERS_H
+#define __GLOBAL_PARAMETERS_H
+
+#include "Parameters.h"
+#include <dolfin/la/KrylovSolver.h>
+#include <dolfin/la/LUSolver.h>
+
+namespace dolfin
+{
+
+  /// This class defines the global DOLFIN parameter database.
+
+  class GlobalParameters : public Parameters
+  {
+  public:
+
+    /// Constructor
+    GlobalParameters();
+
+    /// Destructor
+    virtual ~GlobalParameters();
+
+    /// Parse parameters from command-line
+    virtual void parse(int argc, char* argv[]);
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      Parameters p("dolfin");
+
+      // General
+
+      // Prefix for timer tasks
+      p.add("timer_prefix", "");
+
+      // Allow extrapolation in function interpolation
+      p.add("allow_extrapolation", false);
+
+      // Use exact or linear interpolation in ODESolution::eval()
+      p.add("exact_interpolation", true);
+
+      // Output
+
+      // Print standard output on all processes
+      p.add("std_out_all_processes", true);
+
+      // Line width relative to edge length in SVG output
+      p.add("relative_line_width", 0.025);
+
+      // Number of threads to run, 0 = run serial version
+      p.add("num_threads", 0);
+
+      // DOF reordering when running in serial
+      p.add("reorder_dofs_serial", true);
+
+      // Allowed dofs ordering libraries and set default
+      std::set<std::string> allowed_dof_ordering_libraries;
+      allowed_dof_ordering_libraries.insert("Boost");
+      allowed_dof_ordering_libraries.insert("random");
+      allowed_dof_ordering_libraries.insert("SCOTCH");
+      std::string default_dof_ordering_library = "Boost";
+      #ifdef HAS_SCOTCH
+      default_dof_ordering_library = "SCOTCH";
+      #endif
+
+      // Add dof ordering library
+      p.add("dof_ordering_library", default_dof_ordering_library,
+            allowed_dof_ordering_libraries);
+
+      // Print the level of thread support provided by the MPI library
+      p.add("print_mpi_thread_support_level", false);
+
+      // Allowed partitioners (not necessarily installed)
+      std::set<std::string> allowed_mesh_partitioners;
+      allowed_mesh_partitioners.insert("ParMETIS");
+      allowed_mesh_partitioners.insert("SCOTCH");
+      allowed_mesh_partitioners.insert("Zoltan_RCB");
+      allowed_mesh_partitioners.insert("Zoltan_PHG");
+      allowed_mesh_partitioners.insert("None");
+
+      // Set default graph/mesh partitioner
+      std::string default_mesh_partitioner = "SCOTCH";
+      #ifdef HAS_PARMETIS
+        #ifndef HAS_SCOTCH
+        default_mesh_partitioner = "ParMETIS";
+        #endif
+      #endif
+
+      // Add mesh/graph partitioner
+      p.add("mesh_partitioner", default_mesh_partitioner,
+            allowed_mesh_partitioners);
+
+      // Approaches to partitioning (following Zoltan syntax)
+      // but applies to both Zoltan PHG and ParMETIS
+      std::set<std::string> allowed_partitioning_approaches;
+      allowed_partitioning_approaches.insert("PARTITION");
+      allowed_partitioning_approaches.insert("REPARTITION");
+      allowed_partitioning_approaches.insert("REFINE");
+
+      p.add("partitioning_approach",
+            "PARTITION",
+            allowed_partitioning_approaches);
+
+      #ifdef HAS_PARMETIS
+      // Repartitioning parameter, determines how strongly to hold on
+      // to cells when shifting between processes
+      p.add("ParMETIS_repartitioning_weight", 1000.0);
+      #endif
+
+      #ifdef HAS_TRILINOS
+      // Zoltan PHG partitioner parameters
+      p.add("Zoltan_PHG_REPART_MULTIPLIER", 1.0);
+      #endif
+
+      // Graph coloring
+      std::set<std::string> allowed_coloring_libraries;
+      allowed_coloring_libraries.insert("Boost");
+      #ifdef HAS_TRILINOS
+      allowed_coloring_libraries.insert("Zoltan");
+      #endif
+      p.add("graph_coloring_library", "Boost", allowed_coloring_libraries);
+
+      // Mesh refinement
+      std::set<std::string> allowed_refinement_algorithms;
+      std::string default_refinement_algorithm("recursive_bisection");
+      allowed_refinement_algorithms.insert("bisection");
+      allowed_refinement_algorithms.insert("iterative_bisection");
+      allowed_refinement_algorithms.insert("recursive_bisection");
+      allowed_refinement_algorithms.insert("regular_cut");
+      p.add("refinement_algorithm",
+            default_refinement_algorithm,
+            allowed_refinement_algorithms);
+
+      // Linear algebra
+      std::set<std::string> allowed_backends;
+      std::string default_backend("uBLAS");
+      allowed_backends.insert("uBLAS");
+      allowed_backends.insert("STL");
+      #ifdef HAS_PETSC
+      allowed_backends.insert("PETSc");
+      default_backend = "PETSc";
+      p.add("use_petsc_signal_handler", false);
+      #endif
+      #ifdef HAS_PETSC_CUSP
+      allowed_backends.insert("PETScCusp");
+      #endif
+      #ifdef HAS_TRILINOS
+      allowed_backends.insert("Epetra");
+        #ifndef HAS_PETSC
+        default_backend = "Epetra";
+        #endif
+      #endif
+      p.add("linear_algebra_backend",
+            default_backend,
+            allowed_backends);
+
+      // Add nested parameter sets
+      p.add(KrylovSolver::default_parameters());
+      p.add(LUSolver::default_parameters());
+
+      return p;
+    }
+
+  };
+
+  /// The global parameter database
+  extern GlobalParameters parameters;
+
+}
+
+#endif
diff --git a/dolfin/parameter/Parameter.cpp b/dolfin/parameter/Parameter.cpp
new file mode 100644
index 0000000..08f2a56
--- /dev/null
+++ b/dolfin/parameter/Parameter.cpp
@@ -0,0 +1,712 @@
+// Copyright (C) 2009-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Marie Rognes 2011
+// Modified by Joachim B Haga 2012
+//
+// First added:  2009-05-08
+// Last changed: 2012-09-11
+
+#include <sstream>
+#include <dolfin/log/log.h>
+#include "Parameter.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+// class Parameter
+//-----------------------------------------------------------------------------
+Parameter::Parameter(std::string key)
+  : _access_count(0), _change_count(0), _is_set(false),
+    _key(key), _description("missing description")
+{
+  // Check that key name is allowed
+  check_key(key);
+}
+//-----------------------------------------------------------------------------
+Parameter::~Parameter()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+std::string Parameter::key() const
+{
+  return _key;
+}
+//-----------------------------------------------------------------------------
+std::string Parameter::description() const
+{
+  return _description;
+}
+//-----------------------------------------------------------------------------
+bool Parameter::is_set() const
+{
+  return _is_set;
+}
+//-----------------------------------------------------------------------------
+void Parameter::reset()
+{
+  _is_set = false;
+}
+//-----------------------------------------------------------------------------
+std::size_t Parameter::access_count() const
+{
+  return _access_count;
+}
+//-----------------------------------------------------------------------------
+std::size_t Parameter::change_count() const
+{
+  return _change_count;
+}
+//-----------------------------------------------------------------------------
+void Parameter::set_range(int min_value, int max_value)
+{
+  dolfin_error("Parameter.cpp",
+               "set range for parameter",
+               "Cannot set int-valued range for parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+}
+//-----------------------------------------------------------------------------
+void Parameter::set_range(double min_value, double max_value)
+{
+  dolfin_error("Parameter.cpp",
+               "set range for parameter",
+               "Cannot set double-valued range for parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+}
+//-----------------------------------------------------------------------------
+void Parameter::set_range(std::set<std::string> range)
+{
+  dolfin_error("Parameter.cpp",
+               "set range for parameter",
+               "Cannot set string-valued range for parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+}
+//-----------------------------------------------------------------------------
+void Parameter::get_range(int& min_value, int& max_value) const
+{
+  dolfin_error("Parameter.cpp",
+               "get range for parameter",
+               "Cannot get int-valued range for parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+}
+//-----------------------------------------------------------------------------
+void Parameter::get_range(double& min_value, double& max_value) const
+{
+  dolfin_error("Parameter.cpp",
+               "get range for parameter",
+               "Cannot get double-valued range for parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+}
+//-----------------------------------------------------------------------------
+void Parameter::get_range(std::set<std::string>& range) const
+{
+  dolfin_error("Parameter.cpp",
+               "get range for parameter",
+               "Cannot get string-valued range for parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+}
+//-----------------------------------------------------------------------------
+const Parameter& Parameter::operator= (int value)
+{
+  dolfin_error("Parameter.cpp",
+               "assign parameter",
+               "Cannot assign int-value to parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const Parameter& Parameter::operator= (double value)
+{
+  dolfin_error("Parameter.cpp",
+               "assign parameter",
+               "Cannot assign double-value to parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const Parameter& Parameter::operator= (std::string value)
+{
+  dolfin_error("Parameter.cpp",
+               "assign parameter",
+               "Cannot assign string-value to parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const Parameter& Parameter::operator= (const char* value)
+{
+  dolfin_error("Parameter.cpp",
+               "assign parameter",
+               "Cannot assign char-value to parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const Parameter& Parameter::operator= (bool value)
+{
+  dolfin_error("Parameter.cpp",
+               "assign parameter",
+               "Cannot assign bool-value to parameter \"%s\" of type %s",
+               _key.c_str(), type_str().c_str());
+  return *this;
+}
+//-----------------------------------------------------------------------------
+Parameter::operator int() const
+{
+  dolfin_error("Parameter.cpp",
+               "convert to integer",
+               "Cannot convert parameter \"%s\" of type %s to int",
+               _key.c_str(), type_str().c_str());
+  return 0;
+}
+//-----------------------------------------------------------------------------
+Parameter::operator std::size_t() const
+{
+  dolfin_error("Parameter.cpp",
+               "convert to unsigned integer",
+               "Cannot convert parameter \"%s\" of type %s to std::size_t",
+               _key.c_str(), type_str().c_str());
+  return 0;
+}
+//-----------------------------------------------------------------------------
+Parameter::operator double() const
+{
+  dolfin_error("Parameter.cpp",
+               "convert to double",
+               "Cannot convert parameter \"%s\" of type %s to double",
+               _key.c_str(), type_str().c_str());
+  return 0;
+}
+//-----------------------------------------------------------------------------
+Parameter::operator std::string() const
+{
+  dolfin_error("Parameter.cpp",
+               "convert to string",
+               "Cannot convert parameter \"%s\" of type %s to string",
+               _key.c_str(), type_str().c_str());
+  return 0;
+}
+//-----------------------------------------------------------------------------
+Parameter::operator bool() const
+{
+  dolfin_error("Parameter.cpp",
+               "convert to string",
+               "Cannot convert parameter \"%s\" of type %s to bool",
+               _key.c_str(), type_str().c_str());
+  return 0;
+}
+//-----------------------------------------------------------------------------
+void Parameter::check_key(std::string key)
+{
+  // Space and punctuation not allowed in key names
+  for (std::size_t i = 0; i < key.size(); i++)
+  {
+    if (key[i] == ' ' || key[i] == '.')
+    {
+      dolfin_error("Parameter.cpp",
+                   "check allowed name for key",
+                   "Illegal character '%c' in parameter key \"%s\"",
+                   key[i], key.c_str());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+// class IntParameter
+//-----------------------------------------------------------------------------
+IntParameter::IntParameter(std::string key)
+  : Parameter(key), _value(0), _min(0), _max(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+IntParameter::IntParameter(std::string key, int value)
+  : Parameter(key), _value(value), _min(0), _max(0)
+{
+  _is_set = true;
+}
+//-----------------------------------------------------------------------------
+IntParameter::~IntParameter()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void IntParameter::set_range(int min_value, int max_value)
+{
+  // Check range
+  if (min_value > max_value)
+  {
+    dolfin_error("Parameter.cpp",
+                 "set range for parameter",
+                 "Illegal range for int-valued parameter: [%d, %d]",
+                 min_value, max_value);
+  }
+
+  // Set range
+  _min  = min_value;
+  _max = max_value;
+}
+//-----------------------------------------------------------------------------
+void IntParameter::get_range(int& min_value, int& max_value) const
+{
+  // Get range
+  min_value = _min;
+  max_value = _max;
+}
+//-----------------------------------------------------------------------------
+const IntParameter& IntParameter::operator= (int value)
+{
+  // Check value
+  if (_min != _max && (value < _min || value > _max))
+  {
+    dolfin_error("Parameter.cpp",
+                 "assign value to parameter",
+                 "Value %d out of allowed range [%d, %d] for parameter\"%s\"",
+                 value, _min, _max, key().c_str());
+  }
+
+  // Set value
+  _value = value;
+  _change_count++;
+  _is_set = true;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+IntParameter::operator int() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "convert parameter to int",
+                 "Parameter has not been set");
+  }
+
+  _access_count++;
+  return _value;
+}
+//-----------------------------------------------------------------------------
+IntParameter::operator std::size_t() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "convert int parameter to std::size_t",
+                 "Parameter has not been set");
+  }
+
+  if (_value < 0)
+  {
+    dolfin_error("Parameter.cpp",
+                 "convert int parameter to std::size_t",
+                 "Parameter \"%s\" has negative value %d",
+                 key().c_str(), _value);
+  }
+
+  _access_count++;
+  return _value;
+}
+//-----------------------------------------------------------------------------
+std::string IntParameter::type_str() const
+{
+  return "int";
+}
+//-----------------------------------------------------------------------------
+std::string IntParameter::value_str() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "get string representation of value",
+                 "Parameter has not been set");
+  }
+
+  std::stringstream s;
+  s << _value;
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string IntParameter::range_str() const
+{
+  std::stringstream s;
+  if (_min == _max)
+    s << "[]";
+  else
+    s << "[" << _min << ", " << _max << "]";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string IntParameter::str() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "get string representation of parameter",
+                 "Parameter has not been set");
+  }
+
+  std::stringstream s;
+  s << "<int-valued parameter named \""
+    << key()
+    << "\" with value "
+    << _value
+    << ">";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// class DoubleParameter
+//-----------------------------------------------------------------------------
+DoubleParameter::DoubleParameter(std::string key)
+  : Parameter(key), _value(0.0),_min(0.0), _max(0.0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+DoubleParameter::DoubleParameter(std::string key, double value)
+  : Parameter(key), _value(value), _min(0.0), _max(0.0)
+{
+  _is_set = true;
+}
+//-----------------------------------------------------------------------------
+DoubleParameter::~DoubleParameter()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void DoubleParameter::set_range(double min_value, double max_value)
+{
+  // Check range
+  if (min_value > max_value)
+  {
+    dolfin_error("Parameter.cpp",
+                 "set range for parameter",
+                 "Illegal range for double-valued parameter: [%g, %g]",
+                 min_value, max_value);
+  }
+
+  // Set range
+  _min = min_value;
+  _max = max_value;
+}
+//-----------------------------------------------------------------------------
+void DoubleParameter::get_range(double& min_value, double& max_value) const
+{
+  // Get range
+  min_value = _min;
+  max_value = _max;
+}
+//-----------------------------------------------------------------------------
+const DoubleParameter& DoubleParameter::operator= (double value)
+{
+  // Check value
+  if (_min != _max && (value < _min || value > _max))
+  {
+    dolfin_error("Parameter.cpp",
+                 "assign value to parameter",
+                 "Value %g out of allowed range [%g, %g] for parameter\"%s\"",
+                 value, _min, _max, key().c_str());
+  }
+
+  // Set value
+  _value = value;
+  _change_count++;
+  _is_set = true;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+DoubleParameter::operator double() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "convert parameter to double",
+                 "Parameter has not been set");
+  }
+
+  _access_count++;
+  return _value;
+}
+//-----------------------------------------------------------------------------
+std::string DoubleParameter::type_str() const
+{
+  return "double";
+}
+//-----------------------------------------------------------------------------
+std::string DoubleParameter::value_str() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "get string representation of value",
+                 "Parameter has not been set");
+  }
+
+  std::stringstream s;
+  s << _value;
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string DoubleParameter::range_str() const
+{
+  std::stringstream s;
+  if (_min == _max)
+    s << "[]";
+  else
+    s << "[" << _min << ", " << _max << "]";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string DoubleParameter::str() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "get string representation of parameter",
+                 "Parameter has not been set");
+  }
+
+  std::stringstream s;
+  s << "<double-valued parameter named \""
+    << key()
+    << "\" with value "
+    << _value
+    << ">";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// class StringParameter
+//-----------------------------------------------------------------------------
+StringParameter::StringParameter(std::string key) : Parameter(key)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+StringParameter::StringParameter(std::string key, std::string value)
+  : Parameter(key), _value(value)
+{
+  _is_set = true;
+}
+//-----------------------------------------------------------------------------
+StringParameter::~StringParameter()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+void StringParameter::set_range(std::set<std::string> range)
+{
+  _range = range;
+}
+//-----------------------------------------------------------------------------
+void StringParameter::get_range(std::set<std::string>& range) const
+{
+  // Get range
+  range = _range;
+}
+//-----------------------------------------------------------------------------
+const StringParameter& StringParameter::operator= (std::string value)
+{
+  // Check value
+  if (!_range.empty() && _range.find(value) == _range.end())
+  {
+    std::stringstream s;
+    s << "Illegal value for parameter \"" << _key << "\". "
+      << "Allowed values are: " << range_str();
+    dolfin_error("Parameter.cpp",
+                 "assign parameter value",
+                 s.str());
+  }
+
+  // Set value
+  _value = value;
+  _change_count++;
+  _is_set = true;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+const StringParameter& StringParameter::operator= (const char* value)
+{
+  std::string s(value);
+
+  // Check value
+  if (!_range.empty() && _range.find(s) == _range.end())
+  {
+    std::stringstream stream;
+    stream << "Illegal value for parameter \"" << _key << "\". "
+	   << "Allowed values are: " << range_str();
+    dolfin_error("Parameter.cpp",
+                 "assign parameter value",
+                 stream.str());
+  }
+
+  // Set value
+  _value = s;
+  _change_count++;
+  _is_set = true;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+StringParameter::operator std::string() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "convert parameter to string ",
+                 "Parameter has not been set");
+  }
+
+  _access_count++;
+  return _value;
+}
+//-----------------------------------------------------------------------------
+std::string StringParameter::type_str() const
+{
+  return "string";
+}
+//-----------------------------------------------------------------------------
+std::string StringParameter::value_str() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "get string representation of value",
+                 "Parameter has not been set");
+  }
+  return _value;
+}
+//-----------------------------------------------------------------------------
+std::string StringParameter::range_str() const
+{
+  std::stringstream s;
+  s << "[";
+  std::size_t i = 0;
+  for (std::set<std::string>::const_iterator it = _range.begin();
+       it != _range.end(); ++it)
+  {
+    s << *it;
+    if (i++ < _range.size() - 1)
+      s << ", ";
+  }
+  s << "]";
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+std::string StringParameter::str() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "get string representation of parameter",
+                 "Parameter has not been set");
+  }
+
+  std::stringstream s;
+  s << "<string-valued parameter named \""
+    << key()
+    << "\" with value "
+    << _value
+    << ">";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+// class BoolParameter
+//-----------------------------------------------------------------------------
+BoolParameter::BoolParameter(std::string key) : Parameter(key), _value(false)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+BoolParameter::BoolParameter(std::string key, bool value)
+  : Parameter(key), _value(value)
+{
+  _is_set = true;
+}
+//-----------------------------------------------------------------------------
+BoolParameter::~BoolParameter()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+const BoolParameter& BoolParameter::operator= (bool value)
+{
+  // Set value
+  _value = value;
+  _change_count++;
+  _is_set = true;
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+BoolParameter::operator bool() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "convert parameter to bool",
+                 "Parameter has not been set");
+  }
+
+  _access_count++;
+  return _value;
+}
+//-----------------------------------------------------------------------------
+std::string BoolParameter::type_str() const
+{
+  return "bool";
+}
+//-----------------------------------------------------------------------------
+std::string BoolParameter::value_str() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "get string representation of value",
+                 "Parameter has not been set");
+  }
+
+  if (_value)
+    return "true";
+  else
+    return "false";
+}
+//-----------------------------------------------------------------------------
+std::string BoolParameter::range_str() const
+{
+  return "{true, false}";
+}
+//-----------------------------------------------------------------------------
+std::string BoolParameter::str() const
+{
+  if (!_is_set)
+  {
+    dolfin_error("Parameter.cpp",
+                 "get string representation of parameter",
+                 "Parameter has not been set");
+  }
+
+  std::stringstream s;
+  s << "<bool-valued parameter named \""
+    << key()
+    << "\" with value "
+    << _value
+    << ">";
+  return s.str();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/parameter/Parameter.h b/dolfin/parameter/Parameter.h
new file mode 100644
index 0000000..ddac0f9
--- /dev/null
+++ b/dolfin/parameter/Parameter.h
@@ -0,0 +1,336 @@
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2009-05-08
+// Last changed: 2012-09-11
+
+#ifndef __PARAMETER_H
+#define __PARAMETER_H
+
+#include <set>
+#include <sstream>
+#include <string>
+
+namespace dolfin
+{
+
+  /// Base class for parameters.
+
+  class Parameter
+  {
+  public:
+
+    /// Create parameter for given key
+    explicit Parameter(std::string key);
+
+    /// Destructor
+    virtual ~Parameter();
+
+    /// Return parameter key
+    std::string key() const;
+
+    /// Return parameter description
+    std::string description() const;
+
+    /// Return true if parameter is set, return false otherwise
+    bool is_set() const;
+
+    /// Reset the parameter to empty, so that is_set() returns false.
+    void reset();
+
+    /// Return access count (number of times parameter has been accessed)
+    std::size_t access_count() const;
+
+    /// Return change count (number of times parameter has been changed)
+    std::size_t change_count() const;
+
+    /// Set range for int-valued parameter
+    virtual void set_range(int min_value, int max_value);
+
+    /// Set range for double-valued parameter
+    virtual void set_range(double min_value, double max_value);
+
+    /// Set range for string-valued parameter
+    virtual void set_range(std::set<std::string> range);
+
+    /// Get range for int-valued parameter
+    virtual void get_range(int& min_value, int& max_value) const;
+
+    /// Get range for double-valued parameter
+    virtual void get_range(double& min_value, double& max_value) const;
+
+    /// Get range for string-valued parameter
+    virtual void get_range(std::set<std::string>& range) const;
+
+    /// Assignment from int
+    virtual const Parameter& operator= (int value);
+
+    /// Assignment from double
+    virtual const Parameter& operator= (double value);
+
+    /// Assignment from string
+    virtual const Parameter& operator= (std::string value);
+
+    /// Assignment from string
+    virtual const Parameter& operator= (const char* value);
+
+    /// Assignment from bool
+    virtual const Parameter& operator= (bool value);
+
+    /// Cast parameter to int
+    virtual operator int() const;
+
+    /// Cast parameter to std::size_t
+    virtual operator std::size_t() const;
+
+    /// Cast parameter to double
+    virtual operator double() const;
+
+    /// Cast parameter to string
+    virtual operator std::string() const;
+
+    /// Cast parameter to bool
+    virtual operator bool() const;
+
+    /// Return value type string
+    virtual std::string type_str() const = 0;
+
+    /// Return value string
+    virtual std::string value_str() const = 0;
+
+    /// Return range string
+    virtual std::string range_str() const = 0;
+
+    /// Return short string description
+    virtual std::string str() const = 0;
+
+    // Check that key name is allowed
+    static void check_key(std::string key);
+
+  protected:
+
+    // Access count
+    mutable std::size_t _access_count;
+
+    // Change count
+    std::size_t _change_count;
+
+    // Whether or not parameter has been set
+    bool _is_set;
+
+    // Parameter key
+    std::string _key;
+
+    // Parameter description
+    std::string _description;
+
+  };
+
+  /// Parameter with value type int
+  class IntParameter : public Parameter
+  {
+  public:
+
+    /// Create unset int-valued
+    explicit IntParameter(std::string key);
+
+    /// Create int-valued parameter
+    IntParameter(std::string key, int value);
+
+    /// Destructor
+    ~IntParameter();
+
+    /// Set range
+    void set_range(int min_value, int max_value);
+
+    /// Get range
+    void get_range(int &min_value, int &max_value) const;
+
+    /// Assignment
+    const IntParameter& operator= (int value);
+
+    /// Cast parameter to int
+    operator int() const;
+
+    /// Cast parameter to std::size_t
+    operator std::size_t() const;
+
+    /// Return value type string
+    std::string type_str() const;
+
+    /// Return value string
+    std::string value_str() const;
+
+    /// Return range string
+    std::string range_str() const;
+
+    /// Return short string description
+    std::string str() const;
+
+  private:
+
+    /// Parameter value
+    int _value;
+
+    /// Parameter range
+    int _min, _max;
+
+  };
+
+  /// Parameter with value type double
+  class DoubleParameter : public Parameter
+  {
+  public:
+
+    /// Create unset double-valued parameter
+    explicit DoubleParameter(std::string key);
+
+    /// Create double-valued parameter
+    DoubleParameter(std::string key, double value);
+
+    /// Destructor
+    ~DoubleParameter();
+
+    /// Set range
+    void set_range(double min_value, double max_value);
+
+    /// Get range
+    void get_range(double &min_value, double &max_value) const;
+
+    /// Assignment
+    const DoubleParameter& operator= (double value);
+
+    /// Cast parameter to double
+    operator double() const;
+
+    /// Return value type string
+    std::string type_str() const;
+
+    /// Return value string
+    std::string value_str() const;
+
+    /// Return range string
+    std::string range_str() const;
+
+    /// Return short string description
+    std::string str() const;
+
+  private:
+
+    /// Parameter value
+    double _value;
+
+    /// Parameter range
+    double _min, _max;
+
+  };
+
+  /// Parameter with value type string
+  class StringParameter : public Parameter
+  {
+  public:
+
+    /// Create unset string-valued parameter
+    explicit StringParameter(std::string key);
+
+    /// Create string-valued parameter
+    StringParameter(std::string key, std::string value);
+
+    /// Destructor
+    ~StringParameter();
+
+    /// Set range
+    void set_range(std::set<std::string> range);
+
+    /// Get range
+    void get_range(std::set<std::string>& range) const;
+
+    /// Assignment
+    const StringParameter& operator= (std::string value);
+
+    /// Assignment
+    const StringParameter& operator= (const char* value);
+
+    /// Cast parameter to string
+    operator std::string() const;
+
+    /// Return value type string
+    std::string type_str() const;
+
+    /// Return value string
+    std::string value_str() const;
+
+    /// Return range string
+    std::string range_str() const;
+
+    /// Return short string description
+    std::string str() const;
+
+  private:
+
+    /// Parameter value
+    std::string _value;
+
+    /// Parameter range
+    std::set<std::string> _range;
+
+  };
+
+  /// Parameter with value type bool
+  class BoolParameter : public Parameter
+  {
+  public:
+
+    /// Create unset bool-valued parameter
+    explicit BoolParameter(std::string key);
+
+    /// Create bool-valued parameter
+    BoolParameter(std::string key, bool value);
+
+    /// Destructor
+    ~BoolParameter();
+
+    /// Assignment
+    const BoolParameter& operator= (bool value);
+
+    /// Cast parameter to bool
+    operator bool() const;
+
+    /// Return value type string
+    std::string type_str() const;
+
+    /// Return value string
+    std::string value_str() const;
+
+    /// Return range string
+    std::string range_str() const;
+
+    /// Return short string description
+    std::string str() const;
+
+  private:
+
+    /// Parameter value
+    bool _value;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/parameter/Parameters.cpp b/dolfin/parameter/Parameters.cpp
new file mode 100644
index 0000000..6f76930
--- /dev/null
+++ b/dolfin/parameter/Parameters.cpp
@@ -0,0 +1,650 @@
+// Copyright (C) 2009-2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hake, 2009
+// Modified by Garth N. Wells, 2009
+//
+// First added:  2009-05-08
+// Last changed: 2012-10-26
+
+#include <sstream>
+#include <stdio.h>
+#include <boost/program_options.hpp>
+#include <boost/scoped_array.hpp>
+
+#include <dolfin/log/log.h>
+#include <dolfin/log/LogStream.h>
+#include <dolfin/log/Table.h>
+#include <dolfin/common/utils.h>
+#include <dolfin/common/SubSystemsManager.h>
+#include "Parameter.h"
+#include "Parameters.h"
+
+using namespace dolfin;
+namespace po = boost::program_options;
+
+// Typedef of iterators for convenience
+typedef std::map<std::string, Parameter*>::iterator parameter_iterator;
+typedef std::map<std::string, Parameter*>::const_iterator const_parameter_iterator;
+typedef std::map<std::string, Parameters*>::iterator parameter_set_iterator;
+typedef std::map<std::string, Parameters*>::const_iterator const_parameter_set_iterator;
+
+//-----------------------------------------------------------------------------
+Parameters::Parameters(std::string key) : _key(key)
+{
+  // Check that key name is allowed
+  Parameter::check_key(key);
+}
+//-----------------------------------------------------------------------------
+Parameters::~Parameters()
+{
+  clear();
+}
+//-----------------------------------------------------------------------------
+Parameters::Parameters(const Parameters& parameters)
+{
+  *this = parameters;
+}
+//-----------------------------------------------------------------------------
+std::string Parameters::name() const
+{
+  return _key;
+}
+//-----------------------------------------------------------------------------
+void Parameters::rename(std::string key)
+{
+  Parameter::check_key(key);
+  _key = key;
+}
+//-----------------------------------------------------------------------------
+void Parameters::clear()
+{
+  // Delete parameters
+  for (parameter_iterator it = _parameters.begin(); it != _parameters.end();
+       ++it)
+  {
+    delete it->second;
+  }
+  _parameters.clear();
+
+  // Delete parameter sets
+  for (parameter_set_iterator it = _parameter_sets.begin();
+       it != _parameter_sets.end(); ++it)
+  {
+    delete it->second;
+  }
+  _parameter_sets.clear();
+
+  // Reset key
+  _key = "";
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, int value)
+{
+  // Check key name
+  if (find_parameter(key))
+  {
+    dolfin_error("Parameters.cpp",
+                 "add parameter",
+                 "Parameter \"%s.%s\" already defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  // Add parameter
+  _parameters[key] = new IntParameter(key, value);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, int value,
+                     int min_value, int max_value)
+{
+  // Add parameter
+  add(key, value);
+
+  // Set range
+  Parameter* p = find_parameter(key);
+  dolfin_assert(p);
+  p->set_range(min_value, max_value);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, double value)
+{
+  // Check key name
+  if (find_parameter(key))
+  {
+    dolfin_error("Parameters.cpp",
+                 "add parameter",
+                 "Parameter \"%s.%s\" already defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  // Add parameter
+  _parameters[key] = new DoubleParameter(key, value);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, double value,
+                     double min_value, double max_value)
+{
+  // Add parameter
+  add(key, value);
+
+  // Set range
+  Parameter* p = find_parameter(key);
+  dolfin_assert(p);
+  p->set_range(min_value, max_value);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, std::string value)
+{
+  // Check key name
+  if (find_parameter(key))
+  {
+    dolfin_error("Parameters.cpp",
+                 "add parameter",
+                 "Parameter \"%s.%s\" already defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  // Add parameter
+  _parameters[key] = new StringParameter(key, value);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, const char* value)
+{
+  // This version is needed to avoid having const char* picked up by
+  // the add function for bool parameters.
+
+  // Check key name
+  if (find_parameter(key))
+  {
+    dolfin_error("Parameters.cpp",
+                 "add parameter",
+                 "Parameter \"%s.%s\" already defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  // Add parameter
+  _parameters[key] = new StringParameter(key, value);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, std::string value,
+                     std::set<std::string> range)
+{
+  // Add parameter
+  add(key, value);
+
+  // Set range
+  Parameter* p = find_parameter(key);
+  dolfin_assert(p);
+  p->set_range(range);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, const char* value,
+                     std::set<std::string> range)
+{
+  // This version is needed to avoid having const char* picked up by
+  // the add function for bool parameters.
+
+  // Add parameter
+  add(key, value);
+
+  // Set range
+  Parameter* p = find_parameter(key);
+  dolfin_assert(p);
+  p->set_range(range);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(std::string key, bool value)
+{
+  // Check key name
+  if (find_parameter(key))
+  {
+    dolfin_error("Parameters.cpp",
+                 "add parameter",
+                 "Parameter \"%s.%s\" already defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  // Add parameter
+  _parameters[key] = new BoolParameter(key, value);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add(const Parameters& parameters)
+{
+  // Check key name
+  if (find_parameter_set(parameters.name()))
+  {
+    dolfin_error("Parameters.cpp",
+                 "add parameter set",
+                 "Parameter set \"%s.%s\" already defined",
+                 this->name().c_str(), parameters.name().c_str());
+  }
+
+  // Add parameter set
+  Parameters* p = new Parameters("");
+  *p = parameters;
+  _parameter_sets[parameters.name()] = p;
+}
+//-----------------------------------------------------------------------------
+void Parameters::remove(std::string key)
+{
+  // Check key name
+  if (!find_parameter(key) && !find_parameter_set(key))
+  {
+    dolfin_error("Parameters.cpp",
+                 "remove parameter or parameter set",
+                 "No parameter or parameter set \"%s.%s\" defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  // Delete objects (safe to delete both even if only one is nonzero)
+  delete find_parameter(key);
+  delete find_parameter_set(key);
+
+  // Remove from maps (safe to remove both)
+  std::size_t num_removed = 0;
+  num_removed += _parameters.erase(key);
+  num_removed += _parameter_sets.erase(key);
+  dolfin_assert(num_removed == 1);
+}
+//-----------------------------------------------------------------------------
+void Parameters::parse(int argc, char* argv[])
+{
+  log(TRACE, "Parsing command-line arguments.");
+  parse_common(argc, argv);
+}
+//-----------------------------------------------------------------------------
+void Parameters::update(const Parameters& parameters)
+{
+  // Update the parameters
+  for (const_parameter_iterator it = parameters._parameters.begin();
+       it != parameters._parameters.end(); ++it)
+  {
+    // Get parameters
+    const Parameter& other = *it->second;
+    Parameter* self = find_parameter(other.key());
+
+    // Skip parameters not in this parameter set (no new parameters added)
+    if (!self)
+    {
+      warning("Ignoring unknown parameter \"%s\" in parameter set \"%s\" when updating parameter set \"%s\".",
+              other.key().c_str(), parameters.name().c_str(), name().c_str());
+      continue;
+    }
+
+    // Skip unset parameters
+    if (!other.is_set())
+    {
+      warning("Ignoring unset parameter \"%s\" in parameter set \"%s\" when updating parameter set \"%s\".",
+              other.key().c_str(), parameters.name().c_str(), name().c_str());
+      continue;
+    }
+
+    // Set value (will give an error if the type is wrong)
+    if (other.type_str() == "int")
+      *self = static_cast<int>(other);
+    else if (other.type_str() == "double")
+      *self = static_cast<double>(other);
+    else if (other.type_str() == "bool")
+      *self = static_cast<bool>(other);
+    else if (other.type_str() == "string")
+      *self = static_cast<std::string>(other);
+    else
+      dolfin_error("Parameters.cpp",
+                   "update parameter set",
+                   "Parameter \"%s\" has unknown type: \"%s\"",
+                   other.key().c_str(), other.type_str().c_str());
+  }
+
+  // Update nested parameter sets
+  for (const_parameter_set_iterator it = parameters._parameter_sets.begin(); it != parameters._parameter_sets.end(); ++it)
+    (*this)(it->first).update(*it->second);
+}
+//-----------------------------------------------------------------------------
+Parameter& Parameters::operator[] (std::string key)
+{
+  Parameter* p = find_parameter(key);
+  if (!p)
+  {
+    dolfin_error("Parameters.cpp",
+                 "access parameter",
+                 "Parameter \"%s.%s\" not defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  return *p;
+}
+//-----------------------------------------------------------------------------
+const Parameter& Parameters::operator[] (std::string key) const
+{
+  Parameter* p = find_parameter(key);
+  if (!p)
+  {
+    dolfin_error("Parameters.cpp",
+                 "access parameter",
+                 "Parameter \"%s.%s\" not defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  return *p;
+}
+//-----------------------------------------------------------------------------
+Parameters& Parameters::operator() (std::string key)
+{
+  Parameters* p = find_parameter_set(key);
+  if (!p)
+  {
+    dolfin_error("Parameters.cpp",
+                 "access parameter set",
+                 "Parameter set \"%s.%s\" not defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  return *p;
+}
+//-----------------------------------------------------------------------------
+const Parameters& Parameters::operator() (std::string key) const
+{
+  Parameters* p = find_parameter_set(key);
+  if (!p)
+  {
+    dolfin_error("Parameters.cpp",
+                 "access parameter set",
+                 "Parameter set \"%s.%s\" not defined",
+                 this->name().c_str(), key.c_str());
+  }
+
+  return *p;
+}
+//-----------------------------------------------------------------------------
+const Parameters& Parameters::operator= (const Parameters& parameters)
+{
+  // Clear all parameters
+  clear();
+
+  // Note: We're relying on the default copy constructors for the
+  // Parameter subclasses here to do their work, which they should
+  // since they don't use any dynamically allocated data.
+
+  // Copy key
+  _key = parameters._key;
+
+  // Copy parameters
+  for (const_parameter_iterator it = parameters._parameters.begin();
+       it != parameters._parameters.end(); ++it)
+  {
+    const Parameter& p = *it->second;
+    Parameter* q = 0;
+    if (p.type_str() == "int")
+      q = new IntParameter(dynamic_cast<const IntParameter&>(p));
+    else if (p.type_str() == "double")
+      q = new DoubleParameter(dynamic_cast<const DoubleParameter&>(p));
+    else if (p.type_str() == "bool")
+      q = new BoolParameter(dynamic_cast<const BoolParameter&>(p));
+    else if (p.type_str() == "string")
+      q = new StringParameter(dynamic_cast<const StringParameter&>(p));
+    else
+    {
+      dolfin_error("Parameters.cpp",
+                   "copy parameter set",
+                   "Parameter from parameter set \"%s\" to parameter set \"%s\" has unknown type: \"%s\"",
+                   parameters.name().c_str(), name().c_str(), p.type_str().c_str());
+    }
+
+    _parameters[p.key()] = q;
+  }
+
+  // Copy parameter sets
+  for (const_parameter_set_iterator it = parameters._parameter_sets.begin();
+       it != parameters._parameter_sets.end(); ++it)
+  {
+    const Parameters& p = *it->second;
+    _parameter_sets[p.name()] = new Parameters(p);
+  }
+
+  return *this;
+}
+//-----------------------------------------------------------------------------
+bool Parameters::has_key(std::string key) const
+{
+  return has_parameter(key) || has_parameter_set(key);
+}
+//-----------------------------------------------------------------------------
+bool Parameters::has_parameter(std::string key) const
+{
+  return find_parameter(key) != 0;
+}
+//-----------------------------------------------------------------------------
+bool Parameters::has_parameter_set(std::string key) const
+{
+  return find_parameter_set(key) != 0;
+}
+//-----------------------------------------------------------------------------
+void Parameters::get_parameter_keys(std::vector<std::string>& keys) const
+{
+  keys.reserve(_parameters.size());
+  for (const_parameter_iterator it = _parameters.begin();
+       it != _parameters.end(); ++it)
+  {
+    keys.push_back(it->first);
+  }
+}
+//-----------------------------------------------------------------------------
+void Parameters::get_parameter_set_keys(std::vector<std::string>& keys) const
+{
+  keys.reserve(_parameter_sets.size());
+  for (const_parameter_set_iterator it = _parameter_sets.begin();
+       it != _parameter_sets.end(); ++it)
+  {
+    keys.push_back(it->first);
+  }
+ }
+//-----------------------------------------------------------------------------
+std::string Parameters::str(bool verbose) const
+{
+  std::stringstream s;
+  if (verbose)
+  {
+    s << str(false) << std::endl << std::endl;
+    if (_parameters.empty() && _parameter_sets.empty())
+    {
+      s << name() << indent("(empty)");
+      return s.str();
+    }
+
+    Table t(_key);
+    for (const_parameter_iterator it = _parameters.begin();
+         it != _parameters.end(); ++it)
+    {
+      Parameter* p = it->second;
+      t(p->key(), "type") = p->type_str();
+      t(p->key(), "value") = (p->is_set() ? p->value_str() : "<unset>");
+      t(p->key(), "range") = p->range_str();
+      t(p->key(), "access") = p->access_count();
+      t(p->key(), "change") = p->change_count();
+    }
+    s << indent(t.str(true));
+
+    for (const_parameter_set_iterator it = _parameter_sets.begin();
+         it != _parameter_sets.end(); ++it)
+    {
+      s << "\n\n" << indent(it->second->str(verbose));
+    }
+  }
+  else
+  {
+    s << "<Parameter set \"" << name() << "\" containing "
+      << _parameters.size() << " parameter(s) and "
+      << _parameter_sets.size() << " nested parameter set(s)>";
+  }
+
+  return s.str();
+}
+//-----------------------------------------------------------------------------
+void Parameters::parse_common(int argc, char* argv[])
+{
+  // Add list of allowed options to po::options_description
+  po::options_description desc("Allowed options");
+  add_parameter_set_to_po(desc, *this);
+
+  // Add help option
+  desc.add_options()("help", "show help text");
+
+  // Read command-line arguments into po::variables_map
+  po::variables_map vm;
+  const po::parsed_options parsed
+    = po::command_line_parser(argc, argv).options(desc).allow_unregistered().run();
+  po::store(parsed, vm);
+  po::notify(vm);
+
+  // Collect and report unrecognized options
+  const std::vector<std::string> unrecognized_options
+    = po::collect_unrecognized(parsed.options, po::include_positional);
+  for (std::size_t i = 0; i < unrecognized_options.size(); i++)
+  {
+    cout << "Skipping unrecognized option for parameter set \""
+         << name() << "\": " << unrecognized_options[i] << endl;
+  }
+
+  // Show help text
+  if (vm.count("help"))
+  {
+    std::stringstream s;
+    s << desc;
+    info(s.str());
+    exit(1);
+  }
+
+  // Read values from the parsed variable map
+  read_vm(vm, *this);
+}
+//-----------------------------------------------------------------------------
+void Parameters::parse_petsc(int argc, char* argv[])
+{
+  // Return if there are no arguments
+  if (argc <= 1)
+    return;
+
+  // Print options
+  cout << "Passing options to PETSc:";
+  for (int i = 1; i < argc; i++)
+    cout << " " << argv[i];
+  cout << endl;
+
+  SubSystemsManager::init_petsc(argc, argv);
+}
+//-----------------------------------------------------------------------------
+void Parameters::add_parameter_set_to_po(po::options_description& desc,
+                                         const Parameters &parameters,
+                                         std::string base_name) const
+{
+  for (const_parameter_iterator it = parameters._parameters.begin();
+       it != parameters._parameters.end(); ++it)
+  {
+    const Parameter& p = *it->second;
+    std::string param_name(base_name + p.key());
+    if (p.type_str() == "int")
+    {
+      desc.add_options()(param_name.c_str(), po::value<int>(),
+                         p.description().c_str());
+    }
+    else if (p.type_str() == "bool")
+    {
+      desc.add_options()(param_name.c_str(), po::value<bool>(),
+                         p.description().c_str());
+    }
+    else if (p.type_str() == "double")
+    {
+      desc.add_options()(param_name.c_str(), po::value<double>(),
+                         p.description().c_str());
+    }
+    else if (p.type_str() == "string")
+    {
+      desc.add_options()(param_name.c_str(), po::value<std::string>(),
+                         p.description().c_str());
+    }
+  }
+
+  for (const_parameter_set_iterator it = parameters._parameter_sets.begin();
+       it != parameters._parameter_sets.end(); ++it)
+  {
+    add_parameter_set_to_po(desc, *it->second, base_name + it->first + ".");
+  }
+}
+//-----------------------------------------------------------------------------
+void Parameters::read_vm(po::variables_map& vm, Parameters& parameters,
+                         std::string base_name)
+{
+  // Read values from po::variables_map
+  for (parameter_iterator it = parameters._parameters.begin();
+       it != parameters._parameters.end(); ++it)
+  {
+    Parameter& p = *it->second;
+    std::string param_name(base_name + p.key());
+    if (p.type_str() == "int")
+    {
+      const po::variable_value& v = vm[param_name];
+      if (!v.empty())
+        p = v.as<int>();
+    }
+    else if (p.type_str() == "bool")
+    {
+      const po::variable_value& v = vm[param_name];
+      if (!v.empty())
+        p = v.as<bool>();
+    }
+    else if (p.type_str() == "double")
+    {
+      const po::variable_value& v = vm[param_name];
+      if (!v.empty())
+        p = v.as<double>();
+    }
+    else if (p.type_str() == "string")
+    {
+      const po::variable_value& v = vm[param_name];
+      if (!v.empty())
+        p = v.as<std::string>();
+    }
+  }
+
+  for (parameter_set_iterator it = parameters._parameter_sets.begin();
+       it != parameters._parameter_sets.end(); ++it)
+  {
+    read_vm(vm, *it->second, base_name + it->first + ".");
+  }
+}
+//-----------------------------------------------------------------------------
+Parameter* Parameters::find_parameter(std::string key) const
+{
+  const_parameter_iterator p = _parameters.find(key);
+  if (p == _parameters.end())
+    return 0;
+  return p->second;
+}
+//-----------------------------------------------------------------------------
+Parameters* Parameters::find_parameter_set(std::string key) const
+{
+  const_parameter_set_iterator p = _parameter_sets.find(key);
+  if (p == _parameter_sets.end())
+    return 0;
+  return p->second;
+}
+//-----------------------------------------------------------------------------
+namespace dolfin
+{
+  Parameters empty_parameters("empty");
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/parameter/Parameters.h b/dolfin/parameter/Parameters.h
new file mode 100644
index 0000000..2116685
--- /dev/null
+++ b/dolfin/parameter/Parameters.h
@@ -0,0 +1,307 @@
+// Copyright (C) 2009-2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hake, 2009
+// Modified by Garth N. Wells, 2009
+//
+// First added:  2009-05-08
+// Last changed: 2011-10-24
+
+#ifndef __PARAMETERS_H
+#define __PARAMETERS_H
+
+#include <set>
+#include <map>
+#include <vector>
+#include "Parameter.h"
+#include <dolfin/log/log.h>
+
+namespace boost
+{
+  namespace program_options
+  {
+    class variables_map;
+    class options_description;
+  }
+}
+
+namespace dolfin
+{
+
+  class XMLParameters;
+
+  /// This class stores a set of parameters. Each parameter is
+  /// identified by a unique string (the key) and a value of some
+  /// given value type. Parameter sets can be nested at arbitrary
+  /// depths.
+  ///
+  /// A parameter may be either int, double, string or boolean valued.
+  ///
+  /// Parameters may be added as follows:
+  ///
+  ///   Parameters p("my_parameters");
+  ///   p.add("relative_tolerance",  1e-15);
+  ///   p.add("absolute_tolerance",  1e-15);
+  ///   p.add("gmres_restart",       30);
+  ///   p.add("monitor_convergence", false);
+  ///
+  /// Parameters may be changed as follows:
+  ///
+  ///   p["gmres_restart"] = 50;
+  ///
+  /// Parameter values may be retrieved as follows:
+  ///
+  ///   int gmres_restart = p["gmres_restart"];
+  ///
+  /// Parameter sets may be nested as follows:
+  ///
+  ///   Parameters q("nested_parameters");
+  ///   p.add(q);
+  ///
+  /// Nested parameters may then be accessed by
+  ///
+  ///   p("nested_parameters")["..."]
+  ///
+  /// Parameters may be nested at arbitrary depths.
+  ///
+  /// Parameters may be parsed from the command-line as follows:
+  ///
+  ///   p.parse(argc, argv);
+  ///
+  /// Note: spaces in parameter keys are not allowed (to simplify
+  /// usage from command-line).
+
+  class Parameters
+  {
+  public:
+
+    /// Create empty parameter set
+    explicit Parameters(std::string key = "parameters");
+
+    /// Destructor
+    virtual ~Parameters();
+
+    /// Copy constructor
+    Parameters(const Parameters& parameters);
+
+    /// Return name for parameter set
+    std::string name() const;
+
+    /// Rename parameter set
+    void rename(std::string key);
+
+    /// Clear parameter set
+    void clear();
+
+    /// Add an unset parameter of type T. For example, to create a
+    /// unset parameter of type bool, do
+    /// parameters.add<bool>("my_setting")
+    template<typename T>
+    void add(std::string key)
+    {
+      dolfin_error("Parameters.h",
+                   "create parameter of requested type",
+                   "Type '%s' is not allowed", key.c_str());
+    }
+
+    /// Add an unset parameter of type T with allows parameters. For
+    /// example, to create a unset parameter of type bool, do
+    /// parameters.add<bool>("my_setting")
+    template<typename T>
+    void add(std::string key, T min, T max)
+    {
+      dolfin_error("Parameters.h",
+                   "create parameter of requested type",
+                   "Type '%s' is not allowed", key.c_str());
+    }
+
+    /// Add an unset parameter of type T with allows parameters. For
+    /// example, to create a unset parameter of type bool, do
+    /// parameters.add<bool>("my_setting")
+    template<typename T>
+    void add(std::string key, std::set<T> valid_values)
+    {
+      dolfin_error("Parameters.h",
+                   "create parameter of requested type",
+                   "Type '%s' is not allowed", key.c_str());
+    }
+
+    /// Add int-valued parameter
+    void add(std::string key, int value);
+
+    /// Add int-valued parameter with given range
+    void add(std::string key, int value, int min_value, int max_value);
+
+    /// Add double-valued parameter
+    void add(std::string key, double value);
+
+    /// Add double-valued parameter with given range
+    void add(std::string key, double value, double min_value, double max_value);
+
+    /// Add string-valued parameter
+    void add(std::string key, std::string value);
+
+    /// Add string-valued parameter
+    void add(std::string key, const char* value);
+
+    /// Add string-valued parameter with given range
+    void add(std::string key, std::string value, std::set<std::string> range);
+
+    /// Add string-valued parameter with given range
+    void add(std::string key, const char* value, std::set<std::string> range);
+
+    /// Add bool-valued parameter
+    void add(std::string key, bool value);
+
+    /// Add nested parameter set
+    void add(const Parameters& parameters);
+
+    /// Remove parameter or parameter set with given key
+    void remove(std::string key);
+
+    /// Parse parameters from command-line
+    virtual void parse(int argc, char* argv[]);
+
+    /// Update parameters with another set of parameters
+    void update(const Parameters& parameters);
+
+    /// Return parameter for given key
+    Parameter& operator[] (std::string key);
+
+    /// Return parameter for given key (const version)
+    const Parameter& operator[] (std::string key) const;
+
+    // Note: We would have liked to use [] also for access of nested
+    // parameter sets just like we do in Python but we can't overload
+    // on return type.
+
+    /// Return nested parameter set for given key
+    Parameters& operator() (std::string key);
+
+    /// Return nested parameter set for given key (const)
+    const Parameters& operator() (std::string key) const;
+
+    /// Assignment operator
+    const Parameters& operator= (const Parameters& parameters);
+
+    /// Check if parameter set has key (parameter or nested parameter set)
+    bool has_key(std::string key) const;
+
+    /// Check if parameter set has given parameter
+    bool has_parameter(std::string key) const;
+
+    /// Check if parameter set has given nested parameter set
+    bool has_parameter_set(std::string key) const;
+
+    /// Return a vector of parameter keys
+    void get_parameter_keys(std::vector<std::string>& keys) const;
+
+    /// Return a vector of parameter set keys
+    void get_parameter_set_keys(std::vector<std::string>& keys) const;
+
+    /// Return informal string representation (pretty-print)
+    std::string str(bool verbose) const;
+
+    // Return pointer to parameter for given key and 0 if not found
+    Parameter* find_parameter(std::string key) const;
+
+    // Return pointer to parameter set for given key and 0 if not found
+    Parameters* find_parameter_set(std::string key) const;
+
+
+  protected:
+
+    /// Parse filtered options (everything except PETSc options)
+    void parse_common(int argc, char* argv[]);
+
+    /// Parse filtered options (only PETSc options)
+    void parse_petsc(int argc, char* argv[]);
+
+  private:
+
+    // Add all parameters as options to a boost::program_option instance
+    void
+      add_parameter_set_to_po(boost::program_options::options_description& desc,
+                              const Parameters &parameters,
+                              std::string base_name="") const;
+
+    // Read in values from the boost::variable_map
+    void read_vm(boost::program_options::variables_map& vm,
+                 Parameters &parameters,
+                 std::string base_name="");
+
+    // Parameter set key
+    std::string _key;
+
+    // Map from key to parameter
+    std::map<std::string, Parameter*> _parameters;
+
+    // Map from key to parameter sets
+    std::map<std::string, Parameters*> _parameter_sets;
+
+  };
+
+  // Specialised templated for unset parameters
+  template<> inline void Parameters::add<std::size_t>(std::string key)
+  { _parameters[key] = new IntParameter(key); }
+
+  template<> inline void  Parameters::add<std::size_t>(std::string key,
+                                                       std::size_t min,
+                                                       std::size_t max)
+  {
+    _parameters[key] = new IntParameter(key);
+    _parameters[key]->set_range((int) min, (int) max);
+  }
+
+  template<> inline void Parameters::add<int>(std::string key)
+  { _parameters[key] = new IntParameter(key); }
+
+  template<> inline void Parameters::add<int>(std::string key, int min, int max)
+  {
+    _parameters[key] = new IntParameter(key);
+    _parameters[key]->set_range(min, max);
+  }
+
+  template<> inline void Parameters::add<double>(std::string key)
+  { _parameters[key] = new DoubleParameter(key); }
+
+  template<> inline void Parameters::add<double>(std::string key, double min,
+                                                 double max)
+  {
+    _parameters[key] = new DoubleParameter(key);
+    _parameters[key]->set_range(min, max);
+  }
+
+  template<> inline void Parameters::add<std::string>(std::string key)
+  { _parameters[key] = new StringParameter(key); }
+
+  template<> inline void Parameters::add(std::string key,
+                                         std::set<std::string> valid_values)
+  {
+    _parameters[key] = new StringParameter(key);
+    _parameters[key]->set_range(valid_values);
+  }
+
+  template<> inline void Parameters::add<bool>(std::string key)
+  { _parameters[key] = new BoolParameter(key); }
+
+  // Default empty parameters
+  extern Parameters empty_parameters;
+
+}
+
+#endif
diff --git a/dolfin/parameter/dolfin_parameter.h b/dolfin/parameter/dolfin_parameter.h
new file mode 100644
index 0000000..b88864b
--- /dev/null
+++ b/dolfin/parameter/dolfin_parameter.h
@@ -0,0 +1,10 @@
+#ifndef __DOLFIN_PARAMETER_H
+#define __DOLFIN_PARAMETER_H
+
+/// DOLFIN parameter interface
+
+#include <dolfin/parameter/Parameter.h>
+#include <dolfin/parameter/Parameters.h>
+#include <dolfin/parameter/GlobalParameters.h>
+
+#endif
diff --git a/dolfin/plot/ExpressionWrapper.cpp b/dolfin/plot/ExpressionWrapper.cpp
new file mode 100644
index 0000000..3bde8c3
--- /dev/null
+++ b/dolfin/plot/ExpressionWrapper.cpp
@@ -0,0 +1,34 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2012
+//
+// First added:  2012-06-02
+// Last changed: 2012-06-19
+
+#include "ExpressionWrapper.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+ExpressionWrapper::ExpressionWrapper(std::shared_ptr<const Expression> expression,
+                                     std::shared_ptr<const Mesh> mesh) :
+  _mesh(mesh), _expression(expression)
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
diff --git a/dolfin/plot/ExpressionWrapper.h b/dolfin/plot/ExpressionWrapper.h
new file mode 100644
index 0000000..a32af23
--- /dev/null
+++ b/dolfin/plot/ExpressionWrapper.h
@@ -0,0 +1,67 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2012
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-06-02
+// Last changed: 2012-08-21
+
+#ifndef __EXPRESSION_WRAPPER_H
+#define __EXPRESSION_WRAPPER_H
+
+#include <memory>
+#include <dolfin/common/Variable.h>
+
+namespace dolfin
+{
+
+  class Expression;
+  class Mesh;
+
+  /// A light wrapper class to hold an expression to plot, along with the mesh
+  /// to plot it on. Allows clean, templated plotter code in plot.cpp
+
+  class ExpressionWrapper : public Variable
+  {
+  public:
+
+    /// Create wrapped expression object
+    explicit ExpressionWrapper(std::shared_ptr<const Expression> expression,
+                               std::shared_ptr<const Mesh> mesh);
+
+    /// Get shared pointer to the expression
+    std::shared_ptr<const Expression> expression() const
+    { return _expression; }
+
+    /// Get shared pointer to the mesh
+    std::shared_ptr<const Mesh> mesh() const
+    { return _mesh; }
+
+  private:
+
+    // The mesh to plot on
+    std::shared_ptr<const Mesh> _mesh;
+
+    // The expression itself
+    std::shared_ptr<const Expression> _expression;
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/plot/GenericVTKPlottable.h b/dolfin/plot/GenericVTKPlottable.h
new file mode 100644
index 0000000..ef307b2
--- /dev/null
+++ b/dolfin/plot/GenericVTKPlottable.h
@@ -0,0 +1,116 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-06-20
+// Last changed: 2012-09-13
+
+#ifndef __GENERIC_VTK_PLOTTABLE_H
+#define __GENERIC_VTK_PLOTTABLE_H
+
+#ifdef HAS_VTK
+
+#include <vtkSmartPointer.h>
+#include <vtkAlgorithmOutput.h>
+#include <vtkActor.h>
+#include <vtkActor2D.h>
+
+namespace dolfin
+{
+
+  class Parameters;
+  class Variable;
+  class VTKWindowOutputStage;
+
+  /// This class defines a common interface for objects that can be
+  /// plotted by the VTKPlotter class
+
+  class GenericVTKPlottable
+  {
+  public:
+
+    // This destructor should be uncommented, but it causes a problem
+    // in parallel with MPI calls being made after MPI is shutdown. Needs
+    // further investigation.
+    virtual ~GenericVTKPlottable() {}
+
+    /// To be redefined in classes that require special parameters. Called
+    /// once with the default parameters.
+    virtual void modify_default_parameters(Parameters& p) = 0;
+
+    /// To be redefined in classes that require special parameters. Called
+    /// once with user-specified parameters, but before init_pipeline.
+    virtual void modify_user_parameters(Parameters& p) {}
+
+    /// Initialize the parts of the pipeline that this class controls
+    virtual void init_pipeline(const Parameters& p) = 0;
+
+    /// Connect or reconnect to the output stage.
+    virtual void connect_to_output(VTKWindowOutputStage& output) = 0;
+
+    /// Update the plottable data. The variable may be empty, or it may
+    /// be a new variable to plot. is_compatible(var) must be true.
+    virtual void update(std::shared_ptr<const Variable> var,
+                        const Parameters& p, int framecounter) = 0;
+
+    /// Return whether this plottable is compatible with the variable
+    virtual bool is_compatible(const Variable &var) const = 0;
+
+    /// Update the scalar range of the plottable data
+    virtual void update_range(double range[2]) = 0;
+
+    /// Inform the plottable about the range. Most plottables don't care,
+    /// since this is handled in the output stage.
+    virtual void rescale(double range[2], const Parameters& p) {}
+
+    /// Return geometric dimension
+    virtual std::size_t dim() const = 0;
+
+    /// Get an actor for showing vertex labels
+    virtual vtkSmartPointer<vtkActor2D> get_vertex_label_actor(vtkSmartPointer<vtkRenderer>)
+    {
+      warning("Plotting of vertex labels is not implemented by the current"
+              " VTK plottable type.");
+      // Return empty actor to have something (invisible) to render
+      return vtkSmartPointer<vtkActor2D>::New();
+    }
+
+    /// Get an actor for showing cell labels
+    virtual vtkSmartPointer<vtkActor2D> get_cell_label_actor(vtkSmartPointer<vtkRenderer>)
+    {
+      warning("Plotting of cell labels is not implemented by the current"
+              " VTK plottable type.");
+      // Return empty actor to have something (invisible) to render
+      return vtkSmartPointer<vtkActor2D>::New();
+    }
+
+    /// Get an actor for showing the mesh
+    virtual vtkSmartPointer<vtkActor> get_mesh_actor()
+    {
+      warning("Plotting of mesh is not implemented by the current"
+          " VTK plottable type.");
+      // Return empty actor to have something (invisible) to render
+      return vtkSmartPointer<vtkActor>::New();
+    }
+
+  };
+}
+
+#endif
+
+#endif
diff --git a/dolfin/plot/VTKPlottableCSGGeometry.cpp b/dolfin/plot/VTKPlottableCSGGeometry.cpp
new file mode 100644
index 0000000..491cb4e
--- /dev/null
+++ b/dolfin/plot/VTKPlottableCSGGeometry.cpp
@@ -0,0 +1,104 @@
+// Copyright (C) 2012 Joachim B Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet, 2012
+//
+// First added:  2012-09-04
+// Last changed: 2012-10-30
+
+#ifdef HAS_VTK
+
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/generation/CSGGeometry.h>
+#include <dolfin/generation/cgal_csg3d.h>
+#include <dolfin/generation/GeometryToCGALConverter.h>
+#include <dolfin/generation/CGALMeshBuilder.h>
+#include <dolfin/generation/CSGCGALMeshGenerator2D.h>
+#include "VTKPlottableCSGGeometry.h"
+
+using namespace dolfin;
+
+static std::shared_ptr<dolfin::Mesh> getBoundaryMesh(const CSGGeometry& geometry)
+{
+  #ifdef HAS_CGAL
+
+  if (geometry.dim() == 3)
+  {
+    // Convert geometry to a CGAL polyhedron
+    csg::Polyhedron_3 p;
+    GeometryToCGALConverter::convert(geometry, p, false);
+
+    std::shared_ptr<dolfin::Mesh> mesh(new Mesh);
+
+    // copy the boundary of polyhedron to a dolfin mesh
+    dolfin::cout << "Building surface mesh from cgal polyhedron" << dolfin::endl;
+    CGALMeshBuilder::build_surface_mesh_poly(*mesh, p);
+    dolfin::cout << "  Done" << dolfin::endl;
+    return mesh;
+
+  } else
+  {
+    dolfin_assert(geometry.dim() == 2);
+
+    // We're cheating a bit here: Generate a mesh and extract the boundary.
+    // TODO: Implement this properly by extracting the boundary from
+    // the geometry.
+
+    Mesh m;
+    CSGCGALMeshGenerator2D generator(geometry);
+    generator.generate(m);
+    return std::shared_ptr<dolfin::Mesh>(new BoundaryMesh(m, "exterior"));
+  }
+
+  #else
+    return std::shared_ptr<dolfin::Mesh>(new Mesh);
+  #endif
+}
+//-----------------------------------------------------------------------------
+
+//----------------------------------------------------------------------------
+VTKPlottableCSGGeometry::VTKPlottableCSGGeometry(std::shared_ptr<const CSGGeometry> geometry) :
+  VTKPlottableMesh(getBoundaryMesh(*geometry)),
+  _geometry(geometry)
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+bool VTKPlottableCSGGeometry::is_compatible(const Variable &var) const
+{
+  return dynamic_cast<const CSGGeometry*>(&var);
+}
+//----------------------------------------------------------------------------
+void VTKPlottableCSGGeometry::update(std::shared_ptr<const Variable> var, const Parameters& parameters, int framecounter)
+{
+  if (var)
+  {
+    _geometry = std::dynamic_pointer_cast<const CSGGeometry>(var);
+    dolfin_assert(_geometry);
+    std::shared_ptr<dolfin::Mesh> mesh = getBoundaryMesh(*_geometry);
+
+    VTKPlottableMesh::update(mesh, parameters, framecounter);
+  }
+}
+//----------------------------------------------------------------------------
+VTKPlottableCSGGeometry *dolfin::CreateVTKPlottable(std::shared_ptr<const CSGGeometry> geometry)
+{
+  return new VTKPlottableCSGGeometry(geometry);
+}
+//----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/plot/VTKPlottableCSGGeometry.h b/dolfin/plot/VTKPlottableCSGGeometry.h
new file mode 100644
index 0000000..f6a8de3
--- /dev/null
+++ b/dolfin/plot/VTKPlottableCSGGeometry.h
@@ -0,0 +1,67 @@
+// Copyright (C) 2012 Joachim B Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-08-27
+// Last changed: 2012-09-13
+
+#ifndef __VTK_PLOTTABLE_CSGGEOMETRY_H
+#define __VTK_PLOTTABLE_CSGGEOMETRY_H
+
+#ifdef HAS_VTK
+
+#include "VTKPlottableMesh.h"
+
+namespace dolfin
+{
+
+  class CSGGeometry;
+
+  /// Data wrapper class for CSG geometries
+
+  class VTKPlottableCSGGeometry : public VTKPlottableMesh
+  {
+  public:
+
+    explicit
+    VTKPlottableCSGGeometry(std::shared_ptr<const CSGGeometry> geometry);
+
+    /// Additional parameters for VTKPlottableCSGGeometry
+    virtual void modify_default_parameters(Parameters& p)
+    {
+      p["wireframe"] = true;
+      p["scalarbar"] = false;
+    }
+
+    /// Update the plottable data
+    void update(std::shared_ptr<const Variable> var, const Parameters& p,
+                int frame_counter);
+
+    /// Return whether this plottable is compatible with the variable
+    bool is_compatible(const Variable &var) const;
+
+  private:
+
+    std::shared_ptr<const CSGGeometry> _geometry;
+
+  };
+
+  VTKPlottableCSGGeometry *CreateVTKPlottable(std::shared_ptr<const CSGGeometry> geometry);
+}
+
+#endif
+
+#endif
diff --git a/dolfin/plot/VTKPlottableDirichletBC.cpp b/dolfin/plot/VTKPlottableDirichletBC.cpp
new file mode 100644
index 0000000..01a8164
--- /dev/null
+++ b/dolfin/plot/VTKPlottableDirichletBC.cpp
@@ -0,0 +1,104 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-06-20
+// Last changed: 2012-09-20
+
+#ifdef HAS_VTK
+
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericVector.h>
+
+#include "VTKPlottableDirichletBC.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+VTKPlottableDirichletBC::VTKPlottableDirichletBC(std::shared_ptr<const DirichletBC> bc)
+  : VTKPlottableGenericFunction(std::shared_ptr<const Function>(new Function(bc->function_space()))),
+    _bc(bc)
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+void VTKPlottableDirichletBC::init_pipeline(const Parameters& parameters)
+{
+  Parameters new_parameters = parameters;
+  new_parameters["mode"] = "color";
+  VTKPlottableGenericFunction::init_pipeline(new_parameters);
+}
+//----------------------------------------------------------------------------
+bool VTKPlottableDirichletBC::is_compatible(const Variable &var) const
+{
+  const DirichletBC *bc(dynamic_cast<const DirichletBC*>(&var));
+  if (!bc)
+  {
+    return false;
+  }
+
+  const FunctionSpace &V = *bc->function_space();
+  if (V.element()->value_rank() > 1 || V.element()->value_rank() != _bc->function_space()->element()->value_rank())
+  {
+    return false;
+  }
+
+  return VTKPlottableMesh::is_compatible(*V.mesh());
+}
+//----------------------------------------------------------------------------
+void VTKPlottableDirichletBC::update(std::shared_ptr<const Variable> var,
+                                     const Parameters& parameters,
+                                     int framecounter)
+{
+  if (var)
+    _bc = std::dynamic_pointer_cast<const DirichletBC>(var);
+
+  dolfin_assert(!_function.expired());
+  std::shared_ptr<const Function> func
+    = std::dynamic_pointer_cast<const Function>(_function.lock());
+
+  dolfin_assert(_bc && func);
+  if (_bc->function_space() != func->function_space())
+    func.reset(new Function(_bc->function_space()));
+
+  // We passed in the Function to begin with, so the const_case is safe
+  GenericVector &vec = *const_cast<GenericVector*>(func->vector().get());
+
+  double unset_value = 0.0;
+  if (func->value_rank() == 0)
+    unset_value = std::numeric_limits<double>::quiet_NaN();
+
+  // Set the function data to all-undefined (zero for vectors, NaN for scalars)
+  std::vector<double> data(vec.local_size());
+  std::fill(data.begin(), data.end(), unset_value);
+  vec.set_local(data);
+
+  // Apply the BC
+  _bc->apply(vec);
+
+  VTKPlottableGenericFunction::update(func, parameters, framecounter);
+}
+//----------------------------------------------------------------------------
+VTKPlottableDirichletBC *dolfin::CreateVTKPlottable(std::shared_ptr<const DirichletBC> bc)
+{
+  return new VTKPlottableDirichletBC(bc);
+}
+
+#endif
diff --git a/dolfin/plot/VTKPlottableDirichletBC.h b/dolfin/plot/VTKPlottableDirichletBC.h
new file mode 100644
index 0000000..8913581
--- /dev/null
+++ b/dolfin/plot/VTKPlottableDirichletBC.h
@@ -0,0 +1,70 @@
+// Copyright (C) 2012 Joachim B Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-08-27
+// Last changed: 2012-09-11
+
+#ifndef __VTK_PLOTTABLE_DIRICHLETBC_H
+#define __VTK_PLOTTABLE_DIRICHLETBC_H
+
+#ifdef HAS_VTK
+
+#include "VTKPlottableGenericFunction.h"
+
+namespace dolfin
+{
+
+  class DirichletBC;
+  class Function;
+
+  /// Data wrapper class for Dirichlet boundary conditions
+
+  class VTKPlottableDirichletBC : public VTKPlottableGenericFunction
+  {
+  public:
+
+    explicit
+    VTKPlottableDirichletBC(std::shared_ptr<const DirichletBC> bc);
+
+    /// Additional parameters for VTKPlottableDirichletBC
+    virtual Parameters default_parameters()
+    {
+      return Parameters();
+    }
+
+    /// Initialize the parts of the pipeline that this class controls
+    virtual void init_pipeline(const Parameters& parameters);
+
+    /// Check if the plotter is compatible with a given DirichletBC variable
+    bool is_compatible(const Variable &var) const;
+
+    /// Update the scalar range of the plottable data
+    void update(std::shared_ptr<const Variable> var, const Parameters& parameters, int framecounter);
+
+  private:
+
+    std::shared_ptr<const DirichletBC> _bc;
+
+  };
+
+  VTKPlottableDirichletBC* CreateVTKPlottable(std::shared_ptr<const DirichletBC>);
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/plot/VTKPlottableGenericFunction.cpp b/dolfin/plot/VTKPlottableGenericFunction.cpp
new file mode 100644
index 0000000..9762988
--- /dev/null
+++ b/dolfin/plot/VTKPlottableGenericFunction.cpp
@@ -0,0 +1,340 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+// Modified by Benjamin Kehlet 2012
+//
+// First added:  2012-06-20
+// Last changed: 2013-11-15
+
+#ifdef HAS_VTK
+
+#include <vtkArrowSource.h>
+#include <vtkUnstructuredGrid.h>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/function/Expression.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/la/GenericVector.h>
+#include <dolfin/mesh/Vertex.h>
+
+#include "VTKPlottableMesh.h"
+#include "VTKPlottableGenericFunction.h"
+#include "VTKPlottableGenericFunction1D.h"
+#include "ExpressionWrapper.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+VTKPlottableGenericFunction::VTKPlottableGenericFunction(std::shared_ptr<const Function> function)
+  : VTKPlottableMesh(function->function_space()->mesh()),
+    _function(function)
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+VTKPlottableGenericFunction::VTKPlottableGenericFunction(std::shared_ptr<const Expression> expression,
+                                                         std::shared_ptr<const Mesh> mesh)
+  : VTKPlottableMesh(mesh), _function(expression)
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+VTKPlottableGenericFunction:: ~VTKPlottableGenericFunction()
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+std::size_t VTKPlottableGenericFunction::value_rank() const
+{
+  dolfin_assert(!_function.expired());
+  return _function.lock()->value_rank();
+}
+//----------------------------------------------------------------------------
+void VTKPlottableGenericFunction::init_pipeline(const Parameters& p)
+{
+  _warpscalar = vtkSmartPointer<vtkWarpScalar>::New();
+  // Required in VTK6.0/6.1, default and XYPlaneOn() doesn't work
+  _warpscalar->UseNormalOn();
+  _warpscalar->SetNormal(0, 0, 1);
+  _warpvector = vtkSmartPointer<vtkWarpVector>::New();
+  _glyphs = vtkSmartPointer<vtkGlyph3D>::New();
+  _mode = (std::string)p["mode"];
+
+  VTKPlottableMesh::init_pipeline(p);
+  dolfin_assert(!_function.expired());
+  switch (_function.lock()->value_rank())
+  {
+    // Setup pipeline for scalar functions
+    case 0:
+    {
+      if (mesh()->topology().dim() < 3)
+      {
+        if (_mode == "auto")
+        {
+          // Default mode for 2D scalars
+          _mode = "warp";
+        }
+        if (_mode != "color" && _mode != "warp")
+        {
+          warning("Mode not valid for 2D scalar plot: "+_mode);
+          _mode = "warp";
+        }
+
+        // In 2D, we warp the mesh according to the scalar values
+        // (1D is normally plotted by separate Plottable class)
+        if (_mode == "warp")
+          insert_filter(_warpscalar);
+      }
+      else
+      {
+        if (_mode == "auto")
+        {
+          // In 3D, we just show the scalar values as colors on the mesh
+          _mode = "color";
+        }
+        if (_mode != "color")
+        {
+          warning("Mode not valid for 3D scalar plot: "+_mode);
+          _mode = "color";
+        }
+
+        // Nothing to do
+      }
+    }
+    break;
+
+    // Setup pipeline for vector functions. Everything is set up except the
+    // mapper
+    case 1:
+    {
+      if (_mode == "auto")
+      {
+        // Default mode is glyphs for vectors (2D and 3D)
+        _mode = "glyphs";
+      }
+      if (_mode != "color" && _mode != "glyphs" && _mode != "displacement")
+      {
+        warning("Mode not valid for vector plot: "+_mode);
+        _mode = "glyphs";
+      }
+
+      // Setup pipeline for warp visualization
+      if (_mode == "displacement")
+      {
+        insert_filter(_warpvector);
+      }
+
+      // Setup pipeline for glyph visualization
+      vtkSmartPointer<vtkArrowSource> arrow =
+        vtkSmartPointer<vtkArrowSource>::New();
+      arrow->SetTipRadius(0.08);
+      arrow->SetTipResolution(16);
+      arrow->SetTipLength(0.25);
+      arrow->SetShaftRadius(0.05);
+      arrow->SetShaftResolution(16);
+
+      // Create the glyph object, set source (the arrow) and input
+      // (the grid) and adjust various parameters
+      _glyphs->SetSourceConnection(arrow->GetOutputPort());
+      #if VTK_MAJOR_VERSION <= 5
+      _glyphs->SetInput(grid());
+      #else
+      _glyphs->SetInputData(grid());
+      #endif
+      _glyphs->SetVectorModeToUseVector();
+      _glyphs->SetScaleModeToScaleByVector();
+      _glyphs->SetColorModeToColorByVector();
+    }
+    break;
+    default:
+    {
+      dolfin_error("VTKPlotter.cpp",
+                   "plot function of rank > 2.",
+                   "Plotting of higher order functions is not supported.");
+    }
+  }
+}
+//----------------------------------------------------------------------------
+bool VTKPlottableGenericFunction::is_compatible(const Variable &var) const
+{
+  const GenericFunction*  function(dynamic_cast<const Function*>(&var));
+  const ExpressionWrapper*
+    wrapper(dynamic_cast<const ExpressionWrapper*>(&var));
+  const Mesh *mesh(NULL);
+
+  if (function)
+  {
+    mesh
+      = static_cast<const Function*>(function)->function_space()->mesh().get();
+  }
+  else if (wrapper)
+  {
+    function = wrapper->expression().get();
+    mesh = wrapper->mesh().get();
+  }
+  else
+    return false;
+
+  if (function->value_rank() > 1 || (function->value_rank() == 0)
+      != !_glyphs->GetInput())
+  {
+    return false;
+  }
+  return VTKPlottableMesh::is_compatible(*mesh);
+}
+//----------------------------------------------------------------------------
+void VTKPlottableGenericFunction::update(std::shared_ptr<const Variable> var,
+                                         const Parameters& p,
+                                         int frame_counter)
+{
+  std::shared_ptr<const Mesh> mesh = VTKPlottableMesh::mesh();
+  if (var)
+  {
+    std::shared_ptr<const Function>
+      function(std::dynamic_pointer_cast<const Function>(var));
+    std::shared_ptr<const ExpressionWrapper>
+      wrapper(std::dynamic_pointer_cast<const ExpressionWrapper>(var));
+    dolfin_assert(function || wrapper);
+    if (function)
+    {
+      mesh = function->function_space()->mesh();
+      _function = function;
+    }
+    else
+    {
+      mesh = wrapper->mesh();
+      _function = wrapper->expression();
+    }
+  }
+
+  // Update the mesh
+  VTKPlottableMesh::update(mesh, p, frame_counter);
+
+  // Update the values on the mesh
+  dolfin_assert(!_function.expired());
+  const Function *func = dynamic_cast<const Function *>(_function.lock().get());
+  if (func && func->vector()->local_size()
+      == (std::size_t)grid()->GetNumberOfCells() && dim() > 1)
+  {
+    // Hack to display DG0 functions. Should really be implemented using
+    // duplicate points (one point per vertex per cell), so that warping.
+    // DG1 and 1D work as expected.
+    // Also: How do we find out if a FunctionSpace is discontinuous?
+    insert_filter(NULL); // expel the warpscalar filter
+    std::vector<double> cell_values;
+    func->vector()->get_local(cell_values);
+    setCellValues(cell_values.size(), &cell_values[0], p);
+  }
+  else
+  {
+    std::vector<double> vertex_values;
+    _function.lock()->compute_vertex_values(vertex_values, *mesh);
+    if (dim() == 1)
+    {
+      // Sort 1D data on x-coordinate because vtkXYPlotActor does not
+      // recognise cell connectivity information
+      std::vector<std::pair<double, double> > point_value;
+      VertexIterator v(*mesh);
+      for(std::size_t i = 0; i < vertex_values.size(); ++i)
+      {
+        const double xpos = v[i].point().x();
+        point_value.push_back(std::make_pair(xpos, vertex_values[i]));
+      }
+
+      std::sort(point_value.begin(), point_value.end());
+      for(std::size_t i = 0; i < vertex_values.size(); ++i)
+        vertex_values[i] = point_value[i].second;
+    }
+
+    setPointValues(vertex_values.size(), &vertex_values[0], p);
+  }
+}
+//----------------------------------------------------------------------------
+void
+VTKPlottableGenericFunction::rescale(double range[2], const Parameters& p)
+{
+  const double scale = p["scale"];
+  const double* bounds = grid()->GetBounds();
+  const double length[3]
+    = {bounds[1]-bounds[0], bounds[3]-bounds[2], bounds[5]-bounds[4]};
+
+  const double bbox_diag = std::sqrt(length[0]*length[0] + length[1]*length[1]
+                                     + length[2]*length[2]);
+
+  // The scale for displacements is absolute
+  _warpvector->SetScaleFactor(scale);
+
+  // Compute the scale for vector glyphs, so that the longest arrows
+  // cover about two cells
+  double vector_scale = scale * mesh()->hmax() * 2.0;
+  vector_scale /= (range[1] > 0 ? range[1] : 1.0);
+
+  _glyphs->SetScaleFactor(vector_scale);
+
+  // Set the default warp such that the max warp is one sixth of the
+  // diagonal of the mesh
+  double scalar_scale = scale*bbox_diag/6.0;
+  scalar_scale /= (range[1] > range[0] ? range[1] - range[0] : 1.0);
+
+  _warpscalar->SetScaleFactor(scalar_scale);
+}
+//----------------------------------------------------------------------------
+void VTKPlottableGenericFunction::update_range(double range[2])
+{
+  // Superclass gets the range from the grid
+  VTKPlottableMesh::update_range(range);
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkAlgorithmOutput>
+VTKPlottableGenericFunction::get_output() const
+{
+  // In the 3D glyph case, return the glyphs' output
+  dolfin_assert(!_function.expired());
+  if (_function.lock()->value_rank() == 1 && _mode == "glyphs")
+    return _glyphs->GetOutputPort();
+  else
+    return VTKPlottableMesh::get_output();
+}
+//----------------------------------------------------------------------------
+VTKPlottableGenericFunction*
+dolfin::CreateVTKPlottable(std::shared_ptr<const Function> function)
+{
+  if (function->function_space()->mesh()->topology().dim() == 1)
+    return new VTKPlottableGenericFunction1D(function);
+  else
+    return new VTKPlottableGenericFunction(function);
+}
+//----------------------------------------------------------------------------
+VTKPlottableGenericFunction*
+dolfin::CreateVTKPlottable(std::shared_ptr<const ExpressionWrapper> wrapper)
+{
+  return CreateVTKPlottable(wrapper->expression(), wrapper->mesh());
+}
+//----------------------------------------------------------------------------
+VTKPlottableGenericFunction*
+dolfin::CreateVTKPlottable(std::shared_ptr<const Expression> expr,
+                           std::shared_ptr<const Mesh> mesh)
+{
+  if (mesh->topology().dim() == 1)
+    return new VTKPlottableGenericFunction1D(expr, mesh);
+  else
+    return new VTKPlottableGenericFunction(expr, mesh);
+}
+//----------------------------------------------------------------------------
+#endif
diff --git a/dolfin/plot/VTKPlottableGenericFunction.h b/dolfin/plot/VTKPlottableGenericFunction.h
new file mode 100644
index 0000000..2cb6730
--- /dev/null
+++ b/dolfin/plot/VTKPlottableGenericFunction.h
@@ -0,0 +1,138 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-06-20
+// Last changed: 2012-09-20
+
+#ifndef __VTK_PLOTTABLE_GENERIC_FUNCTION_H
+#define __VTK_PLOTTABLE_GENERIC_FUNCTION_H
+
+#ifdef HAS_VTK
+
+#include <memory>
+#include <vtkWarpScalar.h>
+#include <vtkWarpVector.h>
+#include <vtkGlyph3D.h>
+
+#include <dolfin/common/Variable.h>
+#include "VTKPlottableMesh.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Expression;
+  class ExpressionWrapper;
+  class Function;
+  class GenericFunction;
+  class GenericVTKPlottable;
+  class Mesh;
+  class Parameters;
+
+  /// Data wrapper class for plotting generic functions, including
+  /// instances of the Function and Expression classes.
+
+  class VTKPlottableGenericFunction : public VTKPlottableMesh
+  {
+  public:
+
+    explicit
+      VTKPlottableGenericFunction(std::shared_ptr<const Function> function);
+
+    VTKPlottableGenericFunction(std::shared_ptr<const Expression> expression,
+                                std::shared_ptr<const Mesh> mesh);
+
+    virtual ~VTKPlottableGenericFunction();
+
+    //--- Implementation of the GenericVTKPlottable interface ---
+
+    /// Additional parameters for VTKPlottableGenericFunction
+    virtual void modify_default_parameters(Parameters& p) {}
+
+    virtual void modify_user_parameters(Parameters& p)
+    {
+      std::string mode = p["mode"];
+      Parameter& elevate = p["elevate"];
+      if (dim() < 3 && value_rank() == 0 && mode != "color"
+          && !elevate.is_set())
+      {
+        elevate = -65.0;
+      }
+    }
+
+    /// Initialize the parts of the pipeline that this class controls
+    void init_pipeline(const Parameters& p);
+
+    /// Update the plottable data
+    void update(std::shared_ptr<const Variable> var, const Parameters& p,
+                int framecounter);
+
+    /// Check if the plotter is compatible with a given variable
+    /// (same-rank function on same mesh for example)
+    bool is_compatible(const Variable& var) const;
+
+    /// Update the scalar range of the plottable data
+    void update_range(double range[2]);
+
+    /// Inform the plottable about the range.
+    virtual void rescale(double range[2], const Parameters& p);
+
+    /// Return data to visualize
+    vtkSmartPointer<vtkAlgorithmOutput> get_output() const;
+
+  protected:
+
+    // Update scalar values
+    void update_scalar();
+
+    // Update vector values
+    void update_vector();
+
+    // The function to visualize
+    std::weak_ptr<const GenericFunction> _function;
+
+    // The scalar warp filter
+    vtkSmartPointer<vtkWarpScalar> _warpscalar;
+
+    // The vector warp filter
+    vtkSmartPointer<vtkWarpVector> _warpvector;
+
+    // The glyph filter
+    vtkSmartPointer<vtkGlyph3D> _glyphs;
+
+    // Mode flag
+    std::string _mode;
+
+    std::size_t value_rank() const;
+
+  };
+
+  VTKPlottableGenericFunction*
+    CreateVTKPlottable(std::shared_ptr<const Function>);
+  VTKPlottableGenericFunction*
+    CreateVTKPlottable(std::shared_ptr<const ExpressionWrapper>);
+  VTKPlottableGenericFunction*
+    CreateVTKPlottable(std::shared_ptr<const Expression>,
+                       std::shared_ptr<const Mesh>);
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/plot/VTKPlottableGenericFunction1D.cpp b/dolfin/plot/VTKPlottableGenericFunction1D.cpp
new file mode 100644
index 0000000..e0fc571
--- /dev/null
+++ b/dolfin/plot/VTKPlottableGenericFunction1D.cpp
@@ -0,0 +1,156 @@
+// Copyright (C) 2012 Joachim B Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-11
+// Last changed: 2012-09-17
+
+#ifdef HAS_VTK
+
+#include <vtkXYPlotActor.h>
+#include <vtkUnstructuredGrid.h>
+#include <vtkProperty2D.h>
+#include <vtkGlyphSource2D.h>
+#include <vtkTextProperty.h>
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+
+#include "ExpressionWrapper.h"
+#include "VTKWindowOutputStage.h"
+#include "VTKPlottableGenericFunction1D.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+VTKPlottableGenericFunction1D::VTKPlottableGenericFunction1D(std::shared_ptr<const Function> function)
+  : VTKPlottableGenericFunction(function),
+    _actor(vtkSmartPointer<vtkXYPlotActor>::New())
+{
+  dolfin_assert(dim() == 1);
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+VTKPlottableGenericFunction1D::VTKPlottableGenericFunction1D(std::shared_ptr<const Expression> expression,
+                                                             std::shared_ptr<const Mesh> mesh)
+  : VTKPlottableGenericFunction(expression, mesh),
+    _actor(vtkSmartPointer<vtkXYPlotActor>::New())
+{
+  dolfin_assert(dim() == 1);
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+void VTKPlottableGenericFunction1D::init_pipeline(const Parameters& p)
+{
+  VTKPlottableGenericFunction::init_pipeline(p);
+
+  #if VTK_MAJOR_VERSION <= 5
+  _actor->AddInput(grid());
+  #else
+  _actor->AddDataSetInput(grid());
+  #endif
+  _actor->SetXValuesToValue();
+
+  _actor->GetProperty()->SetColor(0.0, 0.0, 0.8);
+  _actor->GetProperty()->SetLineWidth(1.5);
+  _actor->GetProperty()->SetPointSize(4);
+  _actor->PlotPointsOn();
+  _actor->SetPlotPoints(0, 1);
+
+  _actor->SetXTitle("x");
+  _actor->SetYTitle("u(x)");
+
+  _actor->GetAxisLabelTextProperty()->ShadowOff();
+  _actor->GetAxisLabelTextProperty()->ItalicOff();
+  _actor->GetAxisLabelTextProperty()->SetColor(0, 0, 0);
+
+  _actor->GetAxisTitleTextProperty()->ShadowOff();
+  _actor->GetAxisTitleTextProperty()->ItalicOff();
+  _actor->GetAxisTitleTextProperty()->SetColor(0, 0, 0);
+
+  _actor->GetPositionCoordinate ()->SetValue(0, 0, 1);
+  _actor->GetPosition2Coordinate()->SetValue(1, 1, 0);
+  _actor->SetBorder(30);
+
+  #if (VTK_MAJOR_VERSION == 6) || ((VTK_MAJOR_VERSION == 5) && (VTK_MINOR_VERSION >= 6))
+  _actor->SetReferenceYValue(0.0);
+  #endif
+  _actor->SetAdjustYLabels(false); // Use the ranges set in rescale()
+}
+//----------------------------------------------------------------------------
+void VTKPlottableGenericFunction1D::connect_to_output(VTKWindowOutputStage& output)
+{
+  output.add_viewprop(_actor);
+}
+//----------------------------------------------------------------------------
+bool VTKPlottableGenericFunction1D::is_compatible(const Variable &var) const
+{
+  const GenericFunction *function(dynamic_cast<const Function*>(&var));
+  const ExpressionWrapper *wrapper(dynamic_cast<const ExpressionWrapper*>(&var));
+  const Mesh *mesh(NULL);
+
+  if (function)
+  {
+    mesh = static_cast<const Function*>(function)->function_space()->mesh().get();
+  }
+  else if (wrapper)
+  {
+    mesh = wrapper->mesh().get();
+  }
+
+  if (!mesh || mesh->topology().dim() != 1)
+  {
+    return false;
+  }
+
+  return VTKPlottableGenericFunction::is_compatible(var);
+}
+//----------------------------------------------------------------------------
+void VTKPlottableGenericFunction1D::update(std::shared_ptr<const Variable> var,
+                                           const Parameters& p, int framecounter)
+{
+  VTKPlottableGenericFunction::update(var, p, framecounter);
+  dolfin_assert(dim() == 1);
+
+  double* bounds = grid()->GetBounds(); // [xmin xmax ymin ymax zmin zmax]
+  _actor->SetXRange(bounds);
+}
+//----------------------------------------------------------------------------
+void VTKPlottableGenericFunction1D::rescale(double range[2],
+                                            const Parameters& p)
+{
+  _actor->SetYRange(range);
+  #if (VTK_MAJOR_VERSION == 6) || ((VTK_MAJOR_VERSION == 5) && (VTK_MINOR_VERSION >= 6))
+  if (range[0] < 0 && range[1] > 0)
+    _actor->ShowReferenceYLineOn();
+  else
+    _actor->ShowReferenceYLineOff();
+  #endif
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkActor2D> VTKPlottableGenericFunction1D::get_vertex_label_actor(vtkSmartPointer<vtkRenderer> renderer)
+{
+  return GenericVTKPlottable::get_vertex_label_actor(renderer);
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkActor2D> VTKPlottableGenericFunction1D::get_cell_label_actor(vtkSmartPointer<vtkRenderer> renderer)
+{
+  return GenericVTKPlottable::get_cell_label_actor(renderer);
+}
+//----------------------------------------------------------------------------
+
+#endif
diff --git a/dolfin/plot/VTKPlottableGenericFunction1D.h b/dolfin/plot/VTKPlottableGenericFunction1D.h
new file mode 100644
index 0000000..99dec31
--- /dev/null
+++ b/dolfin/plot/VTKPlottableGenericFunction1D.h
@@ -0,0 +1,93 @@
+// Copyright (C) 2012 Joachim B Haga.
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-11
+// Last changed: 2012-09-13
+
+#ifndef __VTK_PLOTTABLE_GENERICFUNCTION_1D_H
+#define __VTK_PLOTTABLE_GENERICFUNCTION_1D_H
+
+#ifdef HAS_VTK
+
+#include <vtkSmartPointer.h>
+
+#include <dolfin/mesh/Mesh.h>
+#include "VTKPlottableGenericFunction.h"
+
+class vtkXYPlotActor;
+
+namespace dolfin
+{
+
+  class Mesh;
+  class VTKWindowOutputStage;
+
+  ///
+
+  class VTKPlottableGenericFunction1D : public VTKPlottableGenericFunction
+  {
+  public:
+
+    explicit
+    VTKPlottableGenericFunction1D(std::shared_ptr<const Function> function);
+
+    VTKPlottableGenericFunction1D(std::shared_ptr<const Expression> expression,
+                                  std::shared_ptr<const Mesh> mesh);
+
+    virtual ~VTKPlottableGenericFunction1D() {}
+
+    //--- Implementation of the GenericVTKPlottable interface ---
+
+    /// Additional parameters for VTKPlottableGenericFunction1D
+    virtual void modify_default_parameters(Parameters& p)
+    {
+      p["scalarbar"] = false;
+    }
+
+    /// Initialize the parts of the pipeline that this class controls
+    virtual void init_pipeline(const Parameters &parameters);
+
+    /// Connect or reconnect to the output stage.
+    virtual void connect_to_output(VTKWindowOutputStage& output);
+
+    /// Update the plottable data
+    virtual void update(std::shared_ptr<const Variable> var,
+                        const Parameters& p, int frame_counter);
+
+    /// Inform the plottable about the range.
+    virtual void rescale(double range[2], const Parameters& p);
+
+    /// Return whether this plottable is compatible with the variable
+    virtual bool is_compatible(const Variable& var) const;
+
+    /// Get an actor for showing vertex labels
+    virtual vtkSmartPointer<vtkActor2D> get_vertex_label_actor(vtkSmartPointer<vtkRenderer>);
+
+    /// Get an actor for showing cell labels
+    virtual vtkSmartPointer<vtkActor2D> get_cell_label_actor(vtkSmartPointer<vtkRenderer>);
+
+  private:
+
+    vtkSmartPointer<vtkXYPlotActor> _actor;
+
+  };
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/plot/VTKPlottableMesh.cpp b/dolfin/plot/VTKPlottableMesh.cpp
new file mode 100644
index 0000000..c1968a7
--- /dev/null
+++ b/dolfin/plot/VTKPlottableMesh.cpp
@@ -0,0 +1,518 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+// Modified by Benjamin Kehlet 2012
+//
+// First added:  2012-06-20
+// Last changed: 2013-11-15
+
+#ifdef HAS_VTK
+
+#include <vtkCellArray.h>
+#include <vtkCellCenters.h>
+#include <vtkCellData.h>
+#include <vtkFloatArray.h>
+#include <vtkGeometryFilter.h>
+#include <vtkIdFilter.h>
+#include <vtkPointData.h>
+#include <vtkPointSetAlgorithm.h>
+#include <vtkPolyDataMapper.h>
+#include <vtkProperty.h>
+#include <vtkRenderer.h>
+#include <vtkSelectVisiblePoints.h>
+#include <vtkStringArray.h>
+#include <vtkTextProperty.h>
+#include <vtkUnstructuredGrid.h>
+#include <vtkVectorNorm.h>
+
+#if !((VTK_MAJOR_VERSION == 5) && (VTK_MINOR_VERSION < 4))
+#include <vtkLabeledDataMapper.h>
+#include <vtkPointSetToLabelHierarchy.h>
+#endif
+
+#include <dolfin/common/Timer.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/CellType.h>
+
+#include "VTKWindowOutputStage.h"
+#include "VTKPlottableMesh.h"
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+VTKPlottableMesh::VTKPlottableMesh(std::shared_ptr<const Mesh> mesh, std::size_t entity_dim) :
+  _grid(vtkSmartPointer<vtkUnstructuredGrid>::New()),
+  _full_grid(vtkSmartPointer<vtkUnstructuredGrid>::New()),
+  _geometryFilter(vtkSmartPointer<vtkGeometryFilter>::New()),
+  _mesh(mesh),
+  _entity_dim(entity_dim)
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+VTKPlottableMesh::VTKPlottableMesh(std::shared_ptr<const Mesh> mesh) :
+  _grid(vtkSmartPointer<vtkUnstructuredGrid>::New()),
+  _full_grid(vtkSmartPointer<vtkUnstructuredGrid>::New()),
+  _geometryFilter(vtkSmartPointer<vtkGeometryFilter>::New()),
+  _mesh(mesh),
+  _entity_dim(mesh->topology().dim())
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+void VTKPlottableMesh::init_pipeline(const Parameters& p)
+{
+  dolfin_assert(_geometryFilter);
+
+  #if VTK_MAJOR_VERSION == 5
+  _geometryFilter->SetInput(_grid);
+  #else
+  _geometryFilter->SetInputData(_grid);
+  #endif
+  _geometryFilter->Update();
+}
+//----------------------------------------------------------------------------
+void VTKPlottableMesh::connect_to_output(VTKWindowOutputStage& output)
+{
+  bool has_nans = false;
+
+  vtkFloatArray* pointdata
+    = dynamic_cast<vtkFloatArray*>(_grid->GetPointData()->GetScalars());
+  if (pointdata && pointdata->GetNumberOfComponents() == 1)
+  {
+    for (int i = 0; i < pointdata->GetNumberOfTuples(); i++)
+    {
+      if (std::isnan(pointdata->GetValue(i)))
+      {
+        has_nans = true;
+        break;
+      }
+    }
+  }
+
+  vtkFloatArray *celldata = dynamic_cast<vtkFloatArray*>(_grid->GetCellData()->GetScalars());
+  if (celldata && celldata->GetNumberOfComponents() == 1 && !has_nans)
+  {
+    for (int i = 0; i < celldata->GetNumberOfTuples(); i++)
+    {
+      if (std::isnan(celldata->GetValue(i)))
+      {
+        has_nans = true;
+        break;
+      }
+    }
+  }
+
+  output.set_translucent(has_nans, _entity_dim, dim());
+  output.set_input(get_output());
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkAlgorithmOutput> VTKPlottableMesh::get_output() const
+{
+  return _geometryFilter->GetOutputPort();
+}
+//----------------------------------------------------------------------------
+bool VTKPlottableMesh::is_compatible(const Variable &var) const
+{
+  return dynamic_cast<const Mesh*>(&var);
+}
+//----------------------------------------------------------------------------
+void VTKPlottableMesh::update(std::shared_ptr<const Variable> var,
+                              const Parameters& p, int framecounter)
+{
+  if (var)
+    _mesh = std::dynamic_pointer_cast<const Mesh>(var);
+
+  dolfin_assert(_grid);
+  dolfin_assert(_full_grid);
+  dolfin_assert(_mesh);
+
+  Timer t("VTK construct grid");
+
+  //
+  // Construct VTK point array from DOLFIN mesh vertices
+  //
+
+  // Create point array
+  vtkSmartPointer<vtkPoints> points = vtkSmartPointer<vtkPoints>::New();
+  points->SetNumberOfPoints(_mesh->num_vertices());
+
+  if(_mesh->topology().dim() == 1)
+  {
+    // HACK to sort 1D points into ascending order
+    // because vtkXYPlotActor does not recognise
+    // cell connectivity information
+    std::vector<double> pointx;
+    for (VertexIterator vertex(*_mesh); !vertex.end(); ++vertex)
+    {
+      const Point point = vertex->point();
+      pointx.push_back(point.x());
+    }
+    std::sort(pointx.begin(), pointx.end());
+    for(std::vector<double>::iterator p=pointx.begin(); p!=pointx.end(); ++p)
+      points->SetPoint(p - pointx.begin(), *p, 0.0, 0.0);
+  }
+  else
+  {
+    // Iterate vertices and add to point array
+    for (VertexIterator vertex(*_mesh); !vertex.end(); ++vertex)
+    {
+      const Point point = vertex->point();
+      points->SetPoint(vertex->index(), point.x(), point.y(), point.z());
+    }
+  }
+  
+  // Insert points, vertex labels and cells in VTK unstructured grid
+  _full_grid->SetPoints(points);
+
+  //
+  // Construct VTK cells from DOLFIN facets
+  //
+
+  build_grid_cells(_full_grid, _mesh->topology().dim());
+  if (_entity_dim == dim())
+    _grid->ShallowCopy(_full_grid);
+  else
+  {
+    _grid->SetPoints(points);
+    build_grid_cells(_grid, _entity_dim);
+  }
+}
+//----------------------------------------------------------------------------
+void VTKPlottableMesh::build_grid_cells(vtkSmartPointer<vtkUnstructuredGrid>& grid,
+                                        std::size_t topological_dim)
+{
+  // Add mesh cells to VTK cell array. Note: Preallocation of storage
+  // in cell array did not give speedups when testing during development
+  vtkSmartPointer<vtkCellArray> cells = vtkSmartPointer<vtkCellArray>::New();
+
+  _mesh->init(topological_dim, 0);
+  const std::vector<unsigned int>& connectivity = _mesh->topology()(topological_dim, 0)();
+
+  for (std::size_t i = 0; i < _mesh->size(topological_dim); ++i)
+  {
+    // Insert all vertex indices for a given cell. For a simplex cell in nD,
+    // n+1 indices are inserted. The connectivity array must be indexed at
+    // ((n+1) x cell_number + idx_offset)
+    cells->InsertNextCell(topological_dim + 1);
+    for(std::size_t j = 0; j <= topological_dim; ++j)
+      cells->InsertCellPoint(connectivity[(topological_dim + 1)*i + j]);
+  }
+
+  // Free unused memory in cell array
+  // (automatically allocated during cell insertion)
+  cells->Squeeze();
+
+  switch (topological_dim)
+  {
+    case 0:
+      grid->SetCells(VTK_VERTEX, cells);
+      break;
+    case 1:
+      grid->SetCells(VTK_LINE, cells);
+      break;
+    case 2:
+      grid->SetCells(VTK_TRIANGLE, cells);
+      break;
+    case 3:
+      grid->SetCells(VTK_TETRA, cells);
+      break;
+    default:
+      dolfin_error("VTKPlottableMesh.cpp", "initialise cells", "Not implemented for dim>3");
+      break;
+  }
+}
+//----------------------------------------------------------------------------
+void VTKPlottableMesh::update_range(double range[2])
+{
+  _grid->GetScalarRange(range);
+}
+//----------------------------------------------------------------------------
+std::size_t VTKPlottableMesh::dim() const
+{
+  return _mesh->geometry().dim();
+}
+//----------------------------------------------------------------------------
+void VTKPlottableMesh::build_id_filter()
+{
+  if (!_idFilter)
+  {
+    _idFilter = vtkSmartPointer<vtkIdFilter>::New();
+    if (_entity_dim == dim() || _entity_dim == 0)
+    {
+      // Use the un-warped mesh if dimension is full. If dim is zero, use the
+      // original cells rather than vertices (the vertices are labeled by the
+      // vertex label actor anyway).
+      _idFilter->SetInputConnection(get_mesh_actor()->GetMapper()->GetInputConnection(0,0));
+    }
+    else
+      _idFilter->SetInputConnection(_geometryFilter->GetOutputPort());
+
+    _idFilter->PointIdsOn();
+    _idFilter->CellIdsOn();
+    _idFilter->FieldDataOn();
+  }
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkActor2D> VTKPlottableMesh::get_vertex_label_actor(vtkSmartPointer<vtkRenderer> renderer)
+{
+  #if ((VTK_MAJOR_VERSION == 5) && (VTK_MINOR_VERSION < 4))
+  warning("Plotting of vertex labels requires VTK >= 5.4");
+  #else
+  // Return actor if already created
+  if (!_vertexLabelActor)
+  {
+    build_id_filter();
+
+    vtkSmartPointer<vtkSelectVisiblePoints> vis = vtkSmartPointer<vtkSelectVisiblePoints>::New();
+    vis->SetInputConnection(_idFilter->GetOutputPort());
+    // If the tolerance is too high, too many labels are visible (especially at
+    // a distance).  If set too low, some labels are invisible. There isn't a
+    // "correct" value, it should really depend on distance and resolution.
+    vis->SetTolerance(1e-3);
+    vis->SetRenderer(renderer);
+    //vis->SelectionWindowOn();
+    //vis->SetSelection(0, 0.3, 0, 0.3);
+
+    vtkSmartPointer<vtkLabeledDataMapper> ldm = vtkSmartPointer<vtkLabeledDataMapper>::New();
+    ldm->SetInputConnection(vis->GetOutputPort());
+    ldm->SetLabelModeToLabelFieldData();
+    ldm->GetLabelTextProperty()->SetColor(0.0, 0.0, 0.0);
+    ldm->GetLabelTextProperty()->ItalicOff();
+    ldm->GetLabelTextProperty()->ShadowOff();
+
+    _vertexLabelActor = vtkSmartPointer<vtkActor2D>::New();
+    _vertexLabelActor->SetMapper(ldm);
+  }
+  #endif
+
+  return _vertexLabelActor;
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkActor2D> VTKPlottableMesh::get_cell_label_actor(vtkSmartPointer<vtkRenderer> renderer)
+{
+  #if ((VTK_MAJOR_VERSION == 5) && (VTK_MINOR_VERSION < 4))
+  warning("Plotting of cell labels requires VTK >= 5.4");
+  #else
+  if (!_cellLabelActor)
+  {
+    build_id_filter();
+
+    vtkSmartPointer<vtkCellCenters> cc = vtkSmartPointer<vtkCellCenters>::New();
+    cc->SetInputConnection(_idFilter->GetOutputPort());
+
+    vtkSmartPointer<vtkSelectVisiblePoints> vis = vtkSmartPointer<vtkSelectVisiblePoints>::New();
+    vis->SetTolerance(1e-4); // See comment for vertex labels
+    vis->SetInputConnection(cc->GetOutputPort());
+    vis->SetRenderer(renderer);
+
+    vtkSmartPointer<vtkLabeledDataMapper> ldm = vtkSmartPointer<vtkLabeledDataMapper>::New();
+    ldm->SetInputConnection(vis->GetOutputPort());
+    ldm->SetLabelModeToLabelFieldData();
+    ldm->GetLabelTextProperty()->SetColor(0.3, 0.3, 0.0);
+    ldm->GetLabelTextProperty()->ShadowOff();
+
+    _cellLabelActor = vtkSmartPointer<vtkActor2D>::New();
+    _cellLabelActor->SetMapper(ldm);
+  }
+  #endif
+
+  return _cellLabelActor;
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkActor> VTKPlottableMesh::get_mesh_actor()
+{
+  if (!_meshActor)
+  {
+    vtkSmartPointer<vtkGeometryFilter> geomfilter = vtkSmartPointer<vtkGeometryFilter>::New();
+    #if VTK_MAJOR_VERSION == 5
+    geomfilter->SetInput(_full_grid);
+    #else
+    geomfilter->SetInputData(_full_grid);
+    #endif
+    geomfilter->Update();
+
+    vtkSmartPointer<vtkPolyDataMapper> mapper = vtkSmartPointer<vtkPolyDataMapper>::New();
+    mapper->SetInputConnection(geomfilter->GetOutputPort());
+
+    _meshActor = vtkSmartPointer<vtkActor>::New();
+    _meshActor->SetMapper(mapper);
+    _meshActor->GetProperty()->SetRepresentationToWireframe();
+    _meshActor->GetProperty()->SetColor(0.7, 0.7, 0.3);
+    _meshActor->GetProperty()->SetOpacity(0.5);
+    vtkMapper::SetResolveCoincidentTopologyToPolygonOffset();
+  }
+  return _meshActor;
+}
+//----------------------------------------------------------------------------
+std::shared_ptr<const Mesh> VTKPlottableMesh::mesh() const
+{
+  return _mesh;
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkUnstructuredGrid> VTKPlottableMesh::grid() const
+{
+  return _grid;
+}
+//----------------------------------------------------------------------------
+void VTKPlottableMesh::insert_filter(vtkSmartPointer<vtkPointSetAlgorithm> filter)
+{
+  if (filter)
+  {
+    #if VTK_MAJOR_VERSION == 5
+    filter->SetInput(_grid);
+    #else
+    filter->SetInputData(_grid);
+    #endif
+    _geometryFilter->SetInputConnection(filter->GetOutputPort());
+  }
+  else
+  {
+    #if VTK_MAJOR_VERSION == 5
+    _geometryFilter->SetInput(_grid);
+    #else
+    _geometryFilter->SetInputData(_grid);
+    #endif
+  }
+
+  _geometryFilter->Update();
+}
+//----------------------------------------------------------------------------
+VTKPlottableMesh *dolfin::CreateVTKPlottable(std::shared_ptr<const Mesh> mesh)
+{
+  return new VTKPlottableMesh(mesh);
+}
+//---------------------------------------------------------------------------
+void VTKPlottableMesh::filter_scalars(vtkFloatArray *values,
+                                      const Parameters& p)
+{
+  dolfin_assert(values);
+
+  const Parameter &param_hide_below = p["hide_below"];
+  const Parameter &param_hide_above = p["hide_above"];
+  if (param_hide_below.is_set() || param_hide_above.is_set())
+  {
+    float hide_above =  std::numeric_limits<float>::infinity();
+    float hide_below = -std::numeric_limits<float>::infinity();
+    if (param_hide_below.is_set()) hide_below = (double)param_hide_below;
+    if (param_hide_above.is_set()) hide_above = (double)param_hide_above;
+
+    const std::size_t num_tuples = static_cast<std::size_t>(values->GetNumberOfTuples());
+    for (std::size_t i = 0; i < num_tuples; i++)
+    {
+      float val = values->GetValue(i);
+      if (val < hide_below || val > hide_above)
+        values->SetValue(i, std::numeric_limits<float>::quiet_NaN());
+    }
+  }
+}
+//---------------------------------------------------------------------------
+template <class T>
+void VTKPlottableMesh::setPointValues(std::size_t size, const T* indata,
+                                      const Parameters& p)
+{
+  const std::size_t num_vertices = _mesh->num_vertices();
+  const std::size_t num_components = size / num_vertices;
+
+  dolfin_assert(num_components > 0 && num_components <= 3);
+  dolfin_assert(num_vertices*num_components == size);
+
+  vtkSmartPointer<vtkFloatArray> values =
+    vtkSmartPointer<vtkFloatArray>::New();
+  if (num_components == 1)
+  {
+    values->SetNumberOfValues(num_vertices);
+    for (std::size_t i = 0; i < num_vertices; ++i)
+      values->SetValue(i, (double)indata[i]);
+
+    filter_scalars(values, p);
+
+    _grid->GetPointData()->SetScalars(values);
+  }
+  else
+  {
+    // NOTE: Allocation must be done in this order!
+    // Note also that the number of VTK vector components must always be 3
+    // regardless of the function vector value dimension
+    values->SetNumberOfComponents(3);
+    values->SetNumberOfTuples(num_vertices);
+    for (std::size_t i = 0; i < num_vertices; ++i)
+    {
+      // The entries in "vertex_values" must be copied to "vectors". Viewing
+      // these arrays as matrices, the transpose of vertex values should be copied,
+      // since DOLFIN and VTK store vector function values differently
+      for (std::size_t d = 0; d < num_components; d++)
+        values->SetValue(3*i+d, indata[i+num_vertices*d]);
+      for (std::size_t d = num_components; d < 3; d++)
+        values->SetValue(3*i+d, 0.0);
+    }
+    _grid->GetPointData()->SetVectors(values);
+
+    // Compute norms of vector data
+    vtkSmartPointer<vtkVectorNorm>
+      norms =vtkSmartPointer<vtkVectorNorm>::New();
+    #if VTK_MAJOR_VERSION == 5
+    norms->SetInput(_grid);
+    #else
+    norms->SetInputData(_grid);
+    #endif
+    norms->SetAttributeModeToUsePointData();
+    //NOTE: This update is necessary to actually compute the norms
+    norms->Update();
+
+    // Attach vector norms as scalar point data in the VTK grid
+    _grid->GetPointData()->SetScalars(norms->GetOutput()->GetPointData()->GetScalars());
+  }
+}
+//----------------------------------------------------------------------------
+template <class T>
+void VTKPlottableMesh::setCellValues(std::size_t size, const T* indata,
+                                     const Parameters& p)
+{
+  const std::size_t num_entities = _mesh->num_entities(_entity_dim);
+  dolfin_assert(num_entities == size);
+
+  vtkSmartPointer<vtkFloatArray> values =
+    vtkSmartPointer<vtkFloatArray>::New();
+  values->SetNumberOfValues(num_entities);
+
+  for (std::size_t i = 0; i < num_entities; ++i)
+    values->SetValue(i, (float)indata[i]);
+
+  filter_scalars(values, p);
+  _grid->GetCellData()->SetScalars(values);
+}
+
+//----------------------------------------------------------------------------
+// Instantiate function templates for valid types
+//----------------------------------------------------------------------------
+
+#define INSTANTIATE(T)                                                  \
+  template void dolfin::VTKPlottableMesh::setPointValues(std::size_t, const T*, const Parameters&); \
+  template void dolfin::VTKPlottableMesh::setCellValues(std::size_t, const T*, const Parameters&);
+
+INSTANTIATE(bool)
+INSTANTIATE(double)
+INSTANTIATE(float)
+INSTANTIATE(int)
+
+// Handle std::size_t and std::size_t. See note in VTKPlottableMeshFunction.cpp for explanation
+INSTANTIATE(unsigned int)
+INSTANTIATE(unsigned long)
+
+#endif
diff --git a/dolfin/plot/VTKPlottableMesh.h b/dolfin/plot/VTKPlottableMesh.h
new file mode 100644
index 0000000..140338e
--- /dev/null
+++ b/dolfin/plot/VTKPlottableMesh.h
@@ -0,0 +1,163 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-06-20
+// Last changed: 2012-09-13
+
+#ifndef __VTK_PLOTTABLE_MESH_H
+#define __VTK_PLOTTABLE_MESH_H
+
+#ifdef HAS_VTK
+
+#include <vtkSmartPointer.h>
+
+#include <dolfin/mesh/Mesh.h>
+#include "GenericVTKPlottable.h"
+
+class vtkActor2D;
+class vtkActor3D;
+class vtkAlgorithmOutput;
+class vtkGeometryFilter;
+class vtkIdFilter;
+class vtkPointSetAlgorithm;
+class vtkUnstructuredGrid;
+class vtkFloatArray;
+
+namespace dolfin
+{
+
+  class Mesh;
+  class Parameters;
+  class Variable;
+  class VTKWindowOutputStage;
+
+  /// Data wrapper class for plotting meshes. It also acts as a superclass
+  /// for the other data wrapper classes, as all kinds of plottable data
+  /// also holds a mesh.
+
+  class VTKPlottableMesh : public GenericVTKPlottable
+  {
+  public:
+
+    VTKPlottableMesh(std::shared_ptr<const Mesh> mesh,
+                     std::size_t entity_dim);
+
+    explicit VTKPlottableMesh(std::shared_ptr<const Mesh> mesh);
+
+    virtual ~VTKPlottableMesh() {}
+
+    //--- Implementation of the GenericVTKPlottable interface ---
+
+    /// Additional parameters for VTKPlottableMesh
+    virtual void modify_default_parameters(Parameters& p)
+    {
+      p["wireframe"] = true;
+      p["scalarbar"] = false;
+    }
+
+    /// Initialize the parts of the pipeline that this class controls
+    virtual void init_pipeline(const Parameters& p);
+
+    /// Connect or reconnect to the output stage.
+    virtual void connect_to_output(VTKWindowOutputStage& output);
+
+    /// Update the plottable data
+    virtual void update(std::shared_ptr<const Variable> var,
+                        const Parameters& p, int frame_counter);
+
+    /// Return whether this plottable is compatible with the variable
+    virtual bool is_compatible(const Variable &var) const;
+
+    /// Update the scalar range of the plottable data
+    virtual void update_range(double range[2]);
+
+    /// Return geometric dimension
+    virtual std::size_t dim() const;
+
+    /// Get an actor for showing vertex labels
+    virtual vtkSmartPointer<vtkActor2D> get_vertex_label_actor(vtkSmartPointer<vtkRenderer>);
+
+    /// Get an actor for showing cell labels
+    virtual vtkSmartPointer<vtkActor2D> get_cell_label_actor(vtkSmartPointer<vtkRenderer>);
+
+    /// Get an actor for showing the mesh
+    virtual vtkSmartPointer<vtkActor> get_mesh_actor();
+
+  protected:
+
+    /// Get the output port. Called from connect_to_output.
+    virtual vtkSmartPointer<vtkAlgorithmOutput> get_output() const;
+
+    // Create label filter
+    void build_id_filter();
+
+    // Build the grid from mesh
+    void build_grid_cells(vtkSmartPointer<vtkUnstructuredGrid> &grid,
+                         std::size_t entity_dim);
+
+    // Remove values from an array if hide_above/hide_below are set
+    void filter_scalars(vtkFloatArray *, const Parameters &);
+
+    /// Set scalar values on the mesh
+    template <class T>
+    void setPointValues(std::size_t size, const T *indata, const Parameters& p);
+
+    /// Set scalar values on the mesh
+    template <class T>
+    void setCellValues(std::size_t size, const T *indata, const Parameters& p);
+
+    std::shared_ptr<const Mesh> mesh() const;
+
+    vtkSmartPointer<vtkUnstructuredGrid> grid() const;
+
+    void insert_filter(vtkSmartPointer<vtkPointSetAlgorithm> filter);
+
+  private:
+
+    // The possibly lower-dimensional VTK grid constructed from the DOLFIN mesh
+    vtkSmartPointer<vtkUnstructuredGrid> _grid;
+
+    // The full-dimensional VTK grid constructed from the DOLFIN mesh
+    vtkSmartPointer<vtkUnstructuredGrid> _full_grid;
+
+    // The geometry filter
+    vtkSmartPointer<vtkGeometryFilter> _geometryFilter;
+
+    // The mesh to visualize
+    std::shared_ptr<const Mesh> _mesh;
+
+    // The label actors
+    vtkSmartPointer<vtkActor2D> _vertexLabelActor;
+    vtkSmartPointer<vtkActor2D> _cellLabelActor;
+    vtkSmartPointer<vtkIdFilter> _idFilter;
+
+    // The mesh actor
+    vtkSmartPointer<vtkActor> _meshActor;
+
+    // The dimension of the facets
+    const std::size_t _entity_dim;
+
+  };
+
+  VTKPlottableMesh *CreateVTKPlottable(std::shared_ptr<const Mesh> mesh);
+}
+
+#endif
+
+#endif
diff --git a/dolfin/plot/VTKPlottableMeshFunction.cpp b/dolfin/plot/VTKPlottableMeshFunction.cpp
new file mode 100644
index 0000000..cfb5659
--- /dev/null
+++ b/dolfin/plot/VTKPlottableMeshFunction.cpp
@@ -0,0 +1,70 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+// Modified by Benjamin Kehlet 2012
+//
+// First added:  2012-06-21
+// Last changed: 2012-11-12
+
+#ifdef HAS_VTK
+
+#include <vtkFloatArray.h>
+#include <vtkPointData.h>
+#include <vtkCellData.h>
+#include <boost/static_assert.hpp>
+
+#include <dolfin/mesh/MeshFunction.h>
+#include "VTKPlottableMeshFunction.h"
+
+using namespace dolfin;
+
+//---------------------------------------------------------------------------
+template <typename T>
+VTKPlottableMeshFunction<T>::VTKPlottableMeshFunction( std::shared_ptr<const MeshFunction<T> > mesh_function) :
+  VTKPlottableMesh(mesh_function->mesh(), mesh_function->dim()),
+  _mesh_function(mesh_function)
+{
+  // Do nothing
+}
+//----------------------------------------------------------------------------
+template <typename T>
+void VTKPlottableMeshFunction<T>::update(std::shared_ptr<const Variable> var,
+                                         const Parameters& parameters,
+                                         int frame_counter)
+{
+  if (var)
+    _mesh_function = std::dynamic_pointer_cast<const MeshFunction<T> >(var);
+  dolfin_assert(_mesh_function);
+
+  VTKPlottableMesh::update(reference_to_no_delete_pointer(*_mesh_function->mesh()),
+                           parameters, frame_counter);
+
+  setCellValues(_mesh_function->size(), _mesh_function->values(), parameters);
+}
+
+//---------------------------------------------------------------------------
+// Instantiate valid types for VTKPlottableMeshFunction
+//---------------------------------------------------------------------------
+
+template class dolfin::VTKPlottableMeshFunction<bool>;
+template class dolfin::VTKPlottableMeshFunction<double>;
+template class dolfin::VTKPlottableMeshFunction<float>;
+template class dolfin::VTKPlottableMeshFunction<int>;
+template class dolfin::VTKPlottableMeshFunction<std::size_t>;
+
+#endif
diff --git a/dolfin/plot/VTKPlottableMeshFunction.h b/dolfin/plot/VTKPlottableMeshFunction.h
new file mode 100644
index 0000000..a6bbca3
--- /dev/null
+++ b/dolfin/plot/VTKPlottableMeshFunction.h
@@ -0,0 +1,80 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-06-21
+// Last changed: 2012-09-13
+
+#ifndef __VTK_PLOTTABLE_MESH_FUNCTION_H
+#define __VTK_PLOTTABLE_MESH_FUNCTION_H
+
+#ifdef HAS_VTK
+
+#include "VTKPlottableMesh.h"
+
+namespace dolfin
+{
+
+  // Forward declarations
+  template<typename T> class MeshFunction;
+
+  template <typename T> class VTKPlottableMeshFunction : public VTKPlottableMesh
+  {
+  public:
+
+    explicit
+    VTKPlottableMeshFunction(std::shared_ptr<const MeshFunction<T> > mesh_function);
+
+    virtual ~VTKPlottableMeshFunction() {}
+
+    //--- Implementation of the GenericVTKPlottable interface ---
+
+    /// Additional parameters for VTKPlottableMeshFunction
+    virtual void modify_default_parameters(Parameters& p) {}
+
+    /// Update the plottable data
+    void update(std::shared_ptr<const Variable> var, const Parameters& p,
+                int frame_counter);
+
+    bool is_compatible(const Variable &var) const
+    { return dynamic_cast<const MeshFunction<T>*>(&var); }
+
+  private:
+
+    // The mesh function
+    std::shared_ptr<const MeshFunction<T> > _mesh_function;
+
+  };
+
+  //----------------------------------------------------------------------------
+  template <typename T>
+  VTKPlottableMeshFunction<T> *CreateVTKPlottable(std::shared_ptr<const MeshFunction<T> > meshfunc)
+  {
+    return new VTKPlottableMeshFunction<T>(meshfunc);
+  }
+  //----------------------------------------------------------------------------
+  template <typename T>
+  VTKPlottableMeshFunction<T> *CreateVTKPlottable(std::shared_ptr<MeshFunction<T> > meshfunc)
+  { return new VTKPlottableMeshFunction<T>(meshfunc); }
+  //----------------------------------------------------------------------------
+
+}
+
+#endif
+
+#endif
diff --git a/dolfin/plot/VTKPlotter.cpp b/dolfin/plot/VTKPlotter.cpp
new file mode 100644
index 0000000..305907d
--- /dev/null
+++ b/dolfin/plot/VTKPlotter.cpp
@@ -0,0 +1,839 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet 2012
+// Modified by Garth N. Wells 2012
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-05-23
+// Last changed: 2012-11-14
+
+#include <dolfin/common/Array.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/function/Expression.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/generation/CSGGeometry.h>
+#include "ExpressionWrapper.h"
+#include "VTKPlotter.h"
+
+#ifdef HAS_VTK
+
+#include "VTKWindowOutputStage.h"
+#include "VTKPlottableGenericFunction.h"
+#include "VTKPlottableMesh.h"
+#include "VTKPlottableMeshFunction.h"
+#include "VTKPlottableDirichletBC.h"
+#include "VTKPlottableCSGGeometry.h"
+
+#ifdef HAS_QVTK
+#include <QApplication>
+#include <QtGlobal>
+#endif
+
+#include <vtkSmartPointer.h>
+#include <vtkCamera.h>
+#include <vtkPolyLine.h>
+#include <vtkPolyDataMapper.h>
+#include <vtkProperty.h>
+#include <vtkUnstructuredGrid.h>
+#include <vtkGeometryFilter.h>
+#include <vtkToolkits.h>
+#include <vtkRenderWindowInteractor.h>
+
+#include <boost/filesystem.hpp>
+#include <boost/foreach.hpp>
+
+#ifdef foreach
+#undef foreach
+#endif
+#define foreach BOOST_FOREACH
+
+using namespace dolfin;
+
+//----------------------------------------------------------------------------
+namespace // anonymous
+{
+  void round_significant_digits(double &x, double (*rounding)(double), int num_significant_digits)
+  {
+    if (x != 0.0)
+    {
+      const int num_digits = std::log10(std::abs(x))+1;
+      const double reduction_factor = std::pow(10.0, num_digits-num_significant_digits);
+      x = rounding(x/reduction_factor)*reduction_factor;
+    }
+  }
+}
+//----------------------------------------------------------------------------
+namespace dolfin
+{
+  GenericVTKPlottable* CreateVTKPlottable(std::shared_ptr<const Variable> var)
+  {
+#define DISPATCH(T) do                                                  \
+    {                                                                   \
+      std::shared_ptr<const T > t = std::dynamic_pointer_cast<const T >(var); \
+      if (t)                                                            \
+        return CreateVTKPlottable(t);                                   \
+    } while (0)
+
+    DISPATCH(CSGGeometry);
+    DISPATCH(DirichletBC);
+    DISPATCH(ExpressionWrapper);
+    DISPATCH(Function);
+    DISPATCH(Mesh);
+    DISPATCH(MeshFunction<bool>);
+    DISPATCH(MeshFunction<double>);
+    //DISPATCH(MeshFunction<float>);
+    DISPATCH(MeshFunction<int>);
+    DISPATCH(MeshFunction<std::size_t>);
+
+    if (dynamic_cast<const Expression*>(var.get()))
+    {
+      dolfin_error("plot object", "dolfin::plot", "A mesh must be supplied when plotting an expression");
+    }
+
+    // Any type not listed above
+    dolfin_error("plot object", "dolfin::plot", "Object type not supported for plotting");
+    return NULL; // not reached
+  }
+}
+//----------------------------------------------------------------------------
+VTKPlotter::VTKPlotter(std::shared_ptr<const Variable> obj, QVTKWidget *widget)
+  : _initialized(false),
+    _plottable(CreateVTKPlottable(obj)),
+    vtk_pipeline(new VTKWindowOutputStage(widget)),
+    _frame_counter(0),
+    _key(to_key(*obj))
+{
+  parameters = default_parameters();
+  _plottable->modify_default_parameters(parameters);
+  set_title_from(*obj);
+}
+//----------------------------------------------------------------------------
+VTKPlotter::VTKPlotter(std::shared_ptr<const Expression> expression,
+    std::shared_ptr<const Mesh> mesh, QVTKWidget *widget)
+  : _initialized(false),
+    _plottable(CreateVTKPlottable(expression, mesh)),
+    vtk_pipeline(new VTKWindowOutputStage(widget)),
+    _frame_counter(0),
+    _key(to_key(*expression))
+{
+  parameters = default_parameters();
+  _plottable->modify_default_parameters(parameters);
+  set_title_from(*expression);
+}
+//----------------------------------------------------------------------------
+VTKPlotter::~VTKPlotter()
+{
+  active_plotters->remove(this);
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::plot(std::shared_ptr<const Variable> variable)
+{
+  init();
+
+  // Abort if DOLFIN_NOPLOT is set to a nonzero value.
+  if (no_plot)
+  {
+    warning("Environment variable DOLFIN_NOPLOT set: Plotting disabled.");
+    return;
+  }
+
+  if (vtk_pipeline->resurrect_window())
+  {
+    active_plotters->push_back(this);
+  }
+
+  update_pipeline(variable);
+
+  vtk_pipeline->render();
+
+  _frame_counter++;
+
+  // Synthesize key presses from parameters
+  Parameter &param_keys = parameters["input_keys"];
+  if (param_keys.is_set())
+  {
+    std::string keys = param_keys;
+    for (std::size_t i = 0; i < keys.size(); i++)
+    {
+      const char c = tolower(keys[i]);
+      const int modifiers = (c == keys[i] ? 0 : SHIFT);
+      key_pressed(modifiers, c, std::string(&c, 1));
+    }
+    param_keys.reset();
+  }
+
+  if (parameters["interactive"])
+  {
+    interactive();
+  }
+#ifdef HAS_QVTK
+  else
+  {
+    qApp->processEvents();
+  }
+#endif
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::interactive(bool enter_eventloop)
+{
+  init();
+
+  // Abort if DOLFIN_NOPLOT is set to a nonzero value, or if 'Q' has been pressed.
+  if (no_plot || run_to_end)
+  {
+    return;
+  }
+
+  if (parameters["helptext"])
+  {
+    vtk_pipeline->set_helptext(get_helptext());
+  }
+
+  vtk_pipeline->start_interaction(enter_eventloop);
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::init()
+{
+  if (_initialized)
+  {
+    return;
+  }
+  _initialized = true;
+
+  // Check if environment variable DOLFIN_NOPLOT is set to a nonzero value
+  {
+    const char *noplot_env;
+    noplot_env = getenv("DOLFIN_NOPLOT");
+    no_plot = (noplot_env != NULL && strcmp(noplot_env, "0") != 0 && strcmp(noplot_env, "") != 0);
+  }
+
+  // Check if we have a (potential) connection to the X server. In the future,
+  // we may instead use a non-gui output stage in this case.
+#if defined(Q_WS_X11) || defined(VTK_USE_X) // <QtGlobal>, <vtkToolkits.h>
+  if (!getenv("DISPLAY") || strcmp(getenv("DISPLAY"), "") == 0)
+  {
+    warning("DISPLAY not set, disabling plotting");
+    no_plot = true;
+  }
+#endif
+
+  // Add plotter to pool
+  active_plotters->push_back(this);
+
+  // Add a local shared_ptr to the pool. See comment in VTKPlotter.h
+  active_plotters_local_copy = active_plotters;
+  log(TRACE, "Size of plotter pool is %d.", active_plotters->size());
+
+  // Don't initialize pipeline if no_plot is set, since the pipeline requires a
+  // connection to the X server.
+  if (no_plot)
+  {
+    return;
+  }
+
+  // Let the plottable set default parameters that depend on user parameters
+  // (like scalar-warped 2d plots, which should be elevated only if user
+  // doesn't set "mode=off").
+  _plottable->modify_user_parameters(parameters);
+
+  // We first initialize the part of the pipeline that the plotter controls.
+  // This is the part from the Poly data mapper and out, including actor,
+  // renderer, renderwindow and interaction. It also takes care of the scalar
+  // bar and other decorations.
+
+  dolfin_assert(vtk_pipeline);
+  vtk_pipeline->init(this, parameters);
+
+  if (parameters["tile_windows"])
+  {
+    // Adjust window position to not completely overlap previous plots.
+    std::size_t num_old_plots = active_plotters->size()-1;
+
+    int row=0, col=0, width=0, height=0;
+    if (num_old_plots > 0)
+    {
+      // Get the size of a window that's already decorated, otherwise the frame
+      // size may be not include all decoration (on X)
+      (*active_plotters->begin())->vtk_pipeline->get_window_size(width, height);
+
+      int swidth, sheight;
+      vtk_pipeline->get_screen_size(swidth, sheight);
+
+      // Tile windows horizontally across screen
+      int num_rows = swidth/width;
+      int num_cols = sheight/height;
+      row = num_old_plots % num_rows;
+      col = (num_old_plots / num_rows) % num_cols;
+    }
+    vtk_pipeline->place_window(row*width, col*height);
+  }
+  else
+  {
+    vtk_pipeline->resurrect_window();
+  }
+
+  // Let the plottable initialize its part of the pipeline
+  _plottable->init_pipeline(parameters);
+}
+//----------------------------------------------------------------------------
+const std::string& VTKPlotter::key() const
+{
+  return _key;
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::set_key(std::string key)
+{
+  _key = key;
+}
+//----------------------------------------------------------------------------
+std::string VTKPlotter::to_key(const Variable &var)
+{
+  std::stringstream s;
+  s << var.id() << "@@";
+  return s.str();
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::set_title_from(const Variable &variable)
+{
+
+  std::stringstream title;
+  title << "Plot of \"" << variable.name() << "\"" << " (" << variable.label() << ")";
+  parameters["title"] =  title.str();
+}
+//----------------------------------------------------------------------------
+std::string VTKPlotter::get_helptext()
+{
+  std::stringstream text;
+
+  text << "Mouse control:\n";
+  text << "   Left button: Rotate figure\n";
+  text << "   Right button (or scroolwheel): Zoom \n";
+  text << "   Middle button (or left+right): Translate figure\n";
+  text << "\n";
+  text << "Keyboard control:\n";
+  text << "   r: Reset zoom\n";
+  text << "   f: Fly to the point currently under the mouse pointer\n";
+  text << "   s: Synchronize cameras (keep pressed for continuous sync)\n";
+  text << "   m: Toggle mesh overlay\n";
+  text << "   b: Toggle bounding box\n";
+  text << "  cv: Toggle cell or vertex indices\n";
+  text << "   w: Toggle between wireframe/point/surface view\n";
+  text << "  +-: Resize widths (points and lines)\n";
+  text << "C-+-: Rescale plot (glyphs and warping)\n";
+#ifdef VTK_USE_GL2PS
+  text << "  pP: Save plot to png or pdf file\n";
+#else
+  text << "   p: Save plot to png file\n";
+#endif
+  text << "  hH: Show help, or print help to console\n";
+#ifdef HAS_QVTK
+  text << "   I: Enter interactive mode (and pause execution)\n";
+#endif
+  text << "  qQ: Continue, or continue to end\n";
+  text << " C-c: Abort execution\n";
+  text << "\n";
+#ifdef HAS_QVTK
+  text << "Window control:\n";
+  text << " C-w: Close plot window\n";
+  text << " C-q: Close all plot windows\n";
+#endif
+  return text.str();
+}
+//----------------------------------------------------------------------------
+bool VTKPlotter::key_pressed(int modifiers, char key, std::string keysym)
+{
+  switch (modifiers + key)
+  {
+  case '+':
+    vtk_pipeline->scale_points_lines(1.2);
+    vtk_pipeline->render();
+    return true;
+  case '-':
+    vtk_pipeline->scale_points_lines(1.0/1.2);
+    vtk_pipeline->render();
+    return true;
+
+  case CONTROL + '+': // Up-scale glyphs, etc.
+    parameters["scale"] = (double)parameters["scale"] * 1.2;
+    rescale();
+    vtk_pipeline->render();
+    return true;
+  case CONTROL + '-': // Down-scale glyphs, etc.
+    parameters["scale"] = (double)parameters["scale"] / 1.2;
+    rescale();
+    vtk_pipeline->render();
+    return true;
+
+  case 'b': // Toggle bounding box
+    vtk_pipeline->toggle_boundingbox();
+    vtk_pipeline->render();
+    return true;
+
+  case 'h': // Show help overlay
+    vtk_pipeline->toggle_helptext(get_helptext());
+    vtk_pipeline->render();
+    return true;
+
+  case SHIFT + 'h': // Print helptext to console
+    std::cout << get_helptext();
+    return true;
+
+  case 'p': // Save plot to file
+    write_png();
+    return true;
+
+  case SHIFT + 'p': // Save plot to PDF
+    write_pdf();
+    return true;
+
+  case 'm': // Toggle (secondary) mesh
+    {
+      vtkSmartPointer<vtkActor> mesh_actor = _plottable->get_mesh_actor();
+      bool added = vtk_pipeline->add_viewprop(mesh_actor);
+      if (!added)
+      {
+        mesh_actor->SetVisibility(!mesh_actor->GetVisibility());
+      }
+      vtk_pipeline->render();
+      return true;
+    }
+
+  case 'v': // Toggle vertex labels
+    {
+      // Check if label actor is present. If not get from plottable.
+      vtkSmartPointer<vtkActor2D> labels = _plottable->get_vertex_label_actor(vtk_pipeline->get_renderer());
+
+      bool added = vtk_pipeline->add_viewprop(labels);
+      if (!added)
+      {
+        // Turn on or off dependent on present state
+        labels->SetVisibility(!labels->GetVisibility());
+      }
+
+      vtk_pipeline->render();
+      return true;
+    }
+
+  case 'c': // Toggle cell labels
+    {
+      // Check if label actor is present. If not get from plottable. If it
+      // is, toggle off
+      vtkSmartPointer<vtkActor2D> labels = _plottable->get_cell_label_actor(vtk_pipeline->get_renderer());
+
+      bool added = vtk_pipeline->add_viewprop(labels);
+      if (!added)
+      {
+        // Turn on or off dependent on present state
+        labels->SetVisibility(!labels->GetVisibility());
+      }
+
+      vtk_pipeline->render();
+      return true;
+    }
+
+  case 'w':
+    {
+      vtk_pipeline->cycle_representation();
+      vtk_pipeline->render();
+      return true;
+    }
+
+  case 's':
+  case CONTROL + 's':
+  case SHIFT + 's':
+  case CONTROL + SHIFT + 's':
+    // shift/control may be mouse-interaction modifiers
+    {
+#if (VTK_MAJOR_VERSION == 6) || ((VTK_MAJOR_VERSION == 5) && (VTK_MINOR_VERSION >= 6))
+      vtkCamera* camera = vtk_pipeline->get_camera();
+      foreach (VTKPlotter *other, *active_plotters)
+      {
+        if (other != this)
+        {
+          other->vtk_pipeline->get_camera()->DeepCopy(camera);
+          other->vtk_pipeline->reset_camera_clipping_range();
+          other->vtk_pipeline->render();
+        }
+      }
+#else
+      warning("Camera sync requires VTK >= 5.6");
+#endif
+      return true;
+    }
+
+  case 'r':
+    vtk_pipeline->reset_camera();
+    vtk_pipeline->render();
+    return true;
+
+  case CONTROL + 'w':
+    vtk_pipeline->close_window();
+    active_plotters->remove(this);
+    return true;
+
+  case CONTROL + 'q':
+    foreach (VTKPlotter *plotter, *active_plotters)
+    {
+      plotter->vtk_pipeline->close_window();
+    }
+    active_plotters->clear();
+    vtk_pipeline->stop_interaction();
+    return true;
+
+  case SHIFT + 'q':
+    run_to_end = true;
+    vtk_pipeline->stop_interaction();
+    return true;
+
+#ifdef HAS_QVTK
+  case SHIFT + 'i': // Enter interactive mode
+    run_to_end = false;
+    interactive();
+    return true;
+#endif
+
+  case CONTROL + 'c':
+    dolfin_error("VTKPlotter", "continue execution", "Aborted by user");
+
+  case 'q':
+    vtk_pipeline->stop_interaction();
+    return true;
+  }
+
+  // Not handled
+  return false;
+}
+//----------------------------------------------------------------------------
+QVTKWidget *VTKPlotter::get_widget() const
+{
+  return vtk_pipeline->get_widget();
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::write_png(std::string filename)
+{
+  if (no_plot)
+    return;
+
+  if (filename.empty()) {
+    // We construct a filename from the given prefix and static counter.
+    // If a file with that filename exists, the counter is incremented
+    // until a unique filename is found.
+    do {
+      std::stringstream filenamebuilder;
+      filenamebuilder << std::string(parameters["prefix"]);
+      filenamebuilder << hardcopy_counter++;
+      filename = filenamebuilder.str();
+    }
+    while (boost::filesystem::exists(filename + ".png"));
+  }
+
+  info("Saving plot to file: %s.png", filename.c_str());
+
+  update_pipeline();
+  vtk_pipeline->write_png(filename);
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::write_pdf(std::string filename)
+{
+  if (no_plot)
+    return;
+
+  if (filename.empty()) {
+    // We construct a filename from the given prefix and static counter.
+    // If a file with that filename exists, the counter is incremented
+    // until a unique filename is found.
+    do {
+      std::stringstream filenamebuilder;
+      filenamebuilder << std::string(parameters["prefix"]);
+      filenamebuilder << hardcopy_counter++;
+      filename = filenamebuilder.str();
+    }
+    while (boost::filesystem::exists(filename + ".pdf"));
+  }
+
+  info("Saving plot to file: %s.pdf", filename.c_str());
+
+  update_pipeline();
+  vtk_pipeline->write_pdf(filename);
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::azimuth(double angle)
+{
+  vtk_pipeline->get_camera()->Azimuth(angle);
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::elevate(double angle)
+{
+  vtk_pipeline->get_camera()->Elevation(angle);
+  vtk_pipeline->reset_camera_clipping_range();
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::dolly(double value)
+{
+  vtk_pipeline->get_camera()->Dolly(value);
+  vtk_pipeline->reset_camera_clipping_range();
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::zoom(double zoomfactor)
+{
+  vtk_pipeline->get_camera()->Zoom(zoomfactor);
+  vtk_pipeline->reset_camera_clipping_range();
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::set_viewangle(double angle)
+{
+  vtk_pipeline->get_camera()->SetViewAngle(angle);
+  vtk_pipeline->reset_camera_clipping_range();
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::set_min_max(double min, double max)
+{
+  parameters["range_min"] = min;
+  parameters["range_max"] = max;
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::add_polygon(const Array<double>& points)
+{
+  if (no_plot)
+    return;
+
+  const std::size_t dim = _plottable->dim();
+
+  if (points.size() % dim != 0)
+    warning("VTKPlotter::add_polygon() : Size of array is not a multiple of %d", dim);
+
+  const std::size_t numpoints = points.size()/dim;
+
+  vtkSmartPointer<vtkPoints> vtk_points = vtkSmartPointer<vtkPoints>::New();
+  vtk_points->SetNumberOfPoints(numpoints);
+
+  double point[3];
+  point[2] = 0.0;
+
+  for (std::size_t i = 0; i < numpoints; i++)
+  {
+    for (std::size_t j = 0; j < dim; j++)
+      point[j] = points[i*dim + j];
+
+    vtk_points->InsertPoint(i, point);
+  }
+
+  vtkSmartPointer<vtkPolyLine> line = vtkSmartPointer<vtkPolyLine>::New();
+  line->GetPointIds()->SetNumberOfIds(numpoints);
+
+  for (std::size_t i = 0; i < numpoints; i++)
+    line->GetPointIds()->SetId(i, i);
+
+  vtkSmartPointer<vtkUnstructuredGrid> grid = vtkSmartPointer<vtkUnstructuredGrid>::New();
+  grid->Allocate(1, 1);
+
+  grid->InsertNextCell(line->GetCellType(), line->GetPointIds());
+  grid->SetPoints(vtk_points);
+
+  vtkSmartPointer<vtkGeometryFilter> extract = vtkSmartPointer<vtkGeometryFilter>::New();
+  #if VTK_MAJOR_VERSION <= 5
+  extract->SetInput(grid);
+  #else
+  extract->SetInputData(grid);
+  #endif
+
+  vtkSmartPointer<vtkPolyDataMapper> mapper = vtkSmartPointer<vtkPolyDataMapper>::New();
+  mapper->SetInputConnection(extract->GetOutputPort());
+
+  vtkSmartPointer<vtkActor> polygon_actor = vtkSmartPointer<vtkActor>::New();
+  polygon_actor->SetMapper(mapper);
+
+  mapper->SetInputConnection(extract->GetOutputPort());
+
+  polygon_actor->GetProperty()->SetColor(0, 0, 1);
+  polygon_actor->GetProperty()->SetLineWidth(1);
+
+  vtk_pipeline->add_viewprop(polygon_actor);
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::rescale()
+{
+  double range[2];
+
+  const Parameter &range_min = parameters["range_min"];
+  const Parameter &range_max = parameters["range_max"];
+
+  if (!range_min.is_set() || !range_max.is_set())
+  {
+    _plottable->update_range(range);
+
+    // Round small values (<5% of range) to zero
+    const double diff = range[1]-range[0];
+    if (diff != 0 && std::abs(range[0]/diff) < 0.05)
+      range[0] = 0;
+    else if (diff != 0 && std::abs(range[1]/diff) < 0.05)
+      range[1] = 0;
+
+    // Round endpoints to 2 significant digits (away from center)
+    round_significant_digits(range[0], std::floor, 2);
+    round_significant_digits(range[1], std::ceil,  2);
+  }
+
+  if (range_min.is_set()) range[0] = range_min;
+  if (range_max.is_set()) range[1] = range_max;
+
+  _plottable->rescale(range, parameters);
+  vtk_pipeline->set_scalar_range(range);
+  // The rescale may have changed the scene (scalar/vector warping)
+  vtk_pipeline->reset_camera_clipping_range();
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::update_pipeline(std::shared_ptr<const Variable> variable)
+{
+  if (!is_compatible(variable))
+  {
+    dolfin_error("VTKPlotter.cpp",
+                 "plot()",
+                 "The plottable is not compatible with the data");
+  }
+
+  Timer timer("VTK update");
+
+  // Process some parameters
+
+  Parameter &wireframe = parameters["wireframe"];
+  if (wireframe.is_set())
+  {
+    vtk_pipeline->cycle_representation(wireframe ? VTK_WIREFRAME : VTK_SURFACE);
+    wireframe.reset();
+  }
+
+  Parameter &elevation = parameters["elevate"];
+  if (elevation.is_set())
+  {
+    elevate(elevation);
+    elevation.reset();
+  }
+
+  vtk_pipeline->set_window_title(parameters["title"]);
+
+  // Update the plottable data
+  _plottable->update(variable, parameters, _frame_counter);
+
+  // If this is the first render of this plot and/or the rescale parameter
+  // is set, we read get the min/max values of the data and process them
+  if (_frame_counter == 0 || parameters["rescale"])
+    rescale();
+
+  // Set the mapper's connection on each plot. This must be done since the
+  // visualization parameters may have changed since the last frame, and
+  // the input may hence also have changed
+
+  _plottable->connect_to_output(*vtk_pipeline);
+  if (_frame_counter == 0)
+    vtk_pipeline->reset_camera();
+}
+//----------------------------------------------------------------------------
+bool VTKPlotter::is_compatible(std::shared_ptr<const Variable> variable) const
+{
+  return (no_plot || !variable || _plottable->is_compatible(*variable));
+}
+//----------------------------------------------------------------------------
+void VTKPlotter::all_interactive(bool really)
+{
+  if (active_plotters->size() == 0)
+  {
+    warning("No plots have been shown yet. Ignoring call to interactive().");
+    return;
+  }
+
+  if (really)
+  {
+    run_to_end = false;
+  }
+
+  // Prepare interactiveness on every plotter but the first
+  foreach (VTKPlotter *plotter, *active_plotters)
+  {
+    if (plotter != *active_plotters->begin())
+      plotter->interactive(false);
+  }
+
+  // Start the (global) event loop on the first plotter
+  (*active_plotters->begin())->interactive(true);
+}
+
+
+#else
+
+//----------------------------------------------------------------------------
+// Implement dummy version of class VTKPlotter even if VTK is not present.
+//----------------------------------------------------------------------------
+
+using namespace dolfin;
+
+namespace dolfin
+{
+  class VTKWindowOutputStage {}; // dummy class
+}
+
+VTKPlotter::VTKPlotter(std::shared_ptr<const Variable>, QVTKWidget*) { init(); }
+VTKPlotter::VTKPlotter(std::shared_ptr<const Expression>,
+		       std::shared_ptr<const Mesh>, QVTKWidget*)  { init(); }
+VTKPlotter::~VTKPlotter() {}
+
+// (Ab)use init() to issue a warning.
+// We also need to initialize the parameter set to avoid tons of warning
+// when running the tests without VTK.
+
+void VTKPlotter::init()
+{
+  parameters = default_parameters();
+  warning("Plotting not available. DOLFIN has been compiled without VTK support.");
+}
+
+void VTKPlotter::plot         (std::shared_ptr<const Variable>) {}
+void VTKPlotter::interactive  (bool)                              {}
+void VTKPlotter::write_png    (std::string)                       {}
+void VTKPlotter::write_pdf    (std::string)                       {}
+void VTKPlotter::azimuth      (double)                            {}
+void VTKPlotter::elevate      (double)                            {}
+void VTKPlotter::dolly        (double)                            {}
+void VTKPlotter::zoom         (double)                            {}
+void VTKPlotter::set_viewangle(double)                            {}
+void VTKPlotter::set_min_max  (double, double)                    {}
+void VTKPlotter::add_polygon  (const Array<double>&)              {}
+
+void VTKPlotter::all_interactive(bool)                            {}
+void VTKPlotter::set_key(std::string key)                         {}
+
+bool VTKPlotter::key_pressed(int, char, std::string)                    { return false; }
+bool VTKPlotter::is_compatible(std::shared_ptr<const Variable>) const { return false; }
+
+std::string        VTKPlotter::to_key(const Variable &) { return ""; }
+const std::string& VTKPlotter::key() const              { return _key; }
+QVTKWidget *       VTKPlotter::get_widget() const       { return NULL; }
+
+#endif // HAS_VTK
+
+// Define the static members
+std::shared_ptr<std::list<VTKPlotter*> > VTKPlotter::active_plotters(new std::list<VTKPlotter*>());
+int VTKPlotter::hardcopy_counter = 0;
+bool VTKPlotter::run_to_end = false;
+
+//----------------------------------------------------------------------------
diff --git a/dolfin/plot/VTKPlotter.h b/dolfin/plot/VTKPlotter.h
new file mode 100644
index 0000000..d0976c7
--- /dev/null
+++ b/dolfin/plot/VTKPlotter.h
@@ -0,0 +1,330 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet 2012
+// Modified by Joachim B Haga 2012
+//
+// First added:  2012-05-23
+// Last changed: 2012-11-13
+
+#ifndef __VTK_PLOTTER_H
+#define __VTK_PLOTTER_H
+
+#include <list>
+#include <memory>
+#include <string>
+
+#include <dolfin/common/Variable.h>
+#include <dolfin/parameter/Parameters.h>
+
+class vtkObject;
+class QVTKWidget;
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Expression;
+  class Mesh;
+  class GenericVTKPlottable;
+  class VTKWindowOutputStage;
+  template<typename T> class Array;
+
+  /// This class enables visualization of various DOLFIN entities.
+  /// It supports visualization of meshes, functions, expressions, boundary
+  /// conditions and mesh functions. It can plot data wrapped in classes
+  /// conforming to the GenericVTKPlottable interface.
+  /// The plotter has several parameters that the user can set and adjust to
+  /// affect the appearance and behavior of the plot.
+  ///
+  /// A plotter can be created and used in the following way:
+  ///
+  ///   Mesh mesh = ...;
+  ///   VTKPlotter plotter(mesh);
+  ///   plotter.plot();
+  ///
+  /// Parameters can be adjusted at any time and will take effect on the next
+  /// call to the plot() method. The following parameters exist:
+  ///
+  /// ============== ============ ================ ====================================
+  ///  Name           Value type   Default value              Description
+  /// ============== ============ ================ ====================================
+  ///  mode            String        "auto"         For vector valued functions,
+  ///                                               this parameter may be set to
+  ///                                               "glyphs" or "displacement".
+  ///                                               Scalars may be set to "warp" in
+  ///                                               2D only. A value of "color" is
+  ///                                               valid in all cases; for vectors,
+  ///                                               the norms are used. See below for
+  ///                                               a summary of default modes,
+  ///                                               used when set to "auto".
+  ///  interactive     Boolean     False            Enable/disable interactive mode
+  ///                                               for the rendering window.
+  ///                                               For repeated plots of the same
+  ///                                               object (animated plots), this
+  ///                                               parameter should be set to false.
+  ///  wireframe       Boolean     True for         Enable/disable wireframe
+  ///                              meshes, else     rendering of the object.
+  ///                              false
+  ///  title           String      Inherited        The title of the rendering
+  ///                              from the         window
+  ///                              name/label of
+  ///                              the object
+  ///  scale           Double      1.0              Adjusts the scaling of the
+  ///                                               warping and glyphs
+  ///  scalarbar       Boolean     False for        Hide/show the colormapping bar
+  ///                              meshes, else
+  ///                              true
+  ///  axes            Boolean     False            Show X-Y-Z axes.
+  ///
+  ///  rescale         Boolean     True             Enable/disable recomputation
+  ///                                               of the scalar to color mapping
+  ///                                               on every iteration when performing
+  ///                                               repeated/animated plots of the same
+  ///                                               data. If both range_min and
+  ///                                               range_max are set, this parameter
+  ///                                               is ignored.
+  ///  range_min       Double                       Set lower range of data values.
+  ///                                               Disables automatic (re-)computation
+  ///                                               of the lower range.
+  ///  range_max       Double                       Set upper range of data values.
+  ///                                               Disables automatic (re-)computation
+  ///                                               of the upper range.
+  ///  elevate         Double      -65.0 for 2D     Set camera elevation.
+  ///                              warped scalars,
+  ///                              0.0 otherwise
+  ///  prefix          String      "dolfin_plot_"   Filename prefix used when
+  ///                                               saving plots to file in
+  ///                                               interactive mode. An integer
+  ///                                               counter is appended after the
+  ///                                               prefix.
+  ///  helptext        Boolean     True             Enable/disable the hover-over
+  ///                                               help-text in interactive
+  ///                                               mode
+  ///  window_width    Integer     600              The width of the plotting window
+  ///                                               in pixels
+  ///  window_height   Integer     400              The height of the plotting window
+  ///                                               in pixels
+  ///  tile_windows    Boolean     True             Automatically tile plot windows.
+  ///
+  ///  key             String                       Key (id) of the plot window, used to
+  ///                                               decide if a new plotter should be
+  ///                                               created or a current one updated
+  ///                                               when called through the static
+  ///                                               plot() interface (in plot.h).
+  ///                                               If not set, the object's unique
+  ///                                               id (Variable::id) is used.
+  ///  input_keys      String      ""               Synthesize key presses, as if these
+  ///                                               keys are pressed by the user in
+  ///                                               the plot window.
+  ///                                               For example: "ww++m" shows the data
+  ///                                               as large points on a wireframe
+  ///                                               mesh.
+  ///  hide_above      Double                       If either of these are set, scalar
+  ///  hide_below      Double                       values above or below will not be
+  ///                                               shown in the plot.
+  /// ============== ============ ================ ====================================
+  ///
+  /// The default visualization mode for the different plot types are as follows:
+  ///
+  /// =========================  ============================ =====================
+  ///  Plot type                  Default visualization mode   Alternatives
+  /// =========================  ============================ =====================
+  ///  Meshes                     Wireframe rendering          None
+  ///  2D scalar functions        Scalar warping               Color mapping
+  ///  3D scalar functions        Color mapping                None
+  ///  2D/3D vector functions     Glyphs (vector arrows)       Displacements,
+  ///                                                          Color mapping (norm)
+  /// =========================  ============================ =====================
+  ///
+  /// Expressions and boundary conditions are also visualized according to the
+  /// above table.
+
+  class VTKPlotter : public Variable
+  {
+  public:
+
+    /// Create plotter for a variable. If a widget is supplied, this widget
+    /// will be used for drawing, instead of a new top-level widget. Ownership
+    /// is transferred.
+    VTKPlotter(std::shared_ptr<const Variable>, QVTKWidget *widget = NULL);
+
+    /// Create plotter for an Expression with associated Mesh. If a widget is
+    /// supplied, this widget will be used for drawing, instead of a new
+    /// top-level widget. Ownership is transferred.
+    VTKPlotter(std::shared_ptr<const Expression> expression,
+               std::shared_ptr<const Mesh> mesh,
+               QVTKWidget *wiget = NULL);
+
+    /// Destructor
+    virtual ~VTKPlotter();
+
+    /// Default parameter values
+    static Parameters default_parameters()
+    {
+      std::set<std::string> allowed_modes;
+      allowed_modes.insert("auto");
+      allowed_modes.insert("displacement");
+      allowed_modes.insert("warp");
+      allowed_modes.insert("glyphs");
+      allowed_modes.insert("color");
+
+      Parameters p("vtk_plotter");
+      p.add("mode", "auto", allowed_modes);
+      p.add("interactive", false);
+      p.add("wireframe", false);
+      p.add("title", "Plot");
+      p.add("scale", 1.0);
+      p.add("scalarbar", true);
+      p.add("axes", false);
+      p.add<double>("elevate");
+      p.add<double>("range_min");
+      p.add<double>("range_max");
+      p.add("rescale", true);
+      p.add("prefix", "dolfin_plot_");
+      p.add("helptext", true);
+      p.add("window_width",  600, /*min*/ 50, /*max*/ 5000);
+      p.add("window_height", 400, /*min*/ 50, /*max*/ 5000);
+      p.add("tile_windows", true);
+
+      p.add<std::string>("key");
+      p.add<double>("hide_below"); // Undocumented on purpose, may be removed
+      p.add<double>("hide_above"); // Undocumented on purpose, may be removed
+      p.add<std::string>("input_keys");
+      return p;
+    }
+
+    bool is_compatible(std::shared_ptr<const Variable> variable) const;
+
+    /// Plot the object
+    void plot(std::shared_ptr<const Variable> variable=std::shared_ptr<const Variable>());
+
+    // FIXME: Deprecated? What should it do?
+    void update(std::shared_ptr<const Variable> variable=std::shared_ptr<const Variable>())
+    {
+      warning("VTKPlotter::update is deprecated, use ::plot instead");
+      plot(variable);
+    }
+
+    /// Make the current plot interactive
+    void interactive(bool enter_eventloop = true);
+
+    /// Save plot to PNG file (file suffix appended automatically, filename
+    /// optionally built from prefix)
+    void write_png(std::string filename="");
+
+    /// Save plot to PDF file (file suffix appended automatically, filename
+    /// optionally built from prefix)
+    void write_pdf(std::string filename="");
+
+    /// Return key (i.e., plotter id) of the object to plot
+    const std::string& key() const;
+
+    /// Set the key (plotter id)
+    void set_key(std::string key);
+
+    /// Return default key (plotter id) of a Variable (object to plot).
+    static std::string to_key(const Variable &var);
+
+    /// Camera control
+    void azimuth(double angle);
+    void elevate(double angle);
+    void dolly(double value);
+    void zoom(double zoomfactor);
+    void set_viewangle(double angle);
+
+    // Set the range of the color table
+    void set_min_max(double min, double max);
+
+    void add_polygon(const Array<double>& points);
+
+    /// Make all plot windows interactive. If really is set, the interactive
+    /// mode is entered even if 'Q' has been pressed.
+    static void all_interactive(bool really=false);
+
+    enum Modifiers
+    {
+      // Zero low byte, so that a char can be added
+      SHIFT    = 0x100,
+      ALT      = 0x200,
+      CONTROL  = 0x400
+    };
+
+    // Called (from within VTKWindowOutputStage) when a key is pressed. Public,
+    // but intended for internal (and subclass) use. Returns true if the
+    // keypress is handled.
+    virtual bool key_pressed(int modifiers, char key, std::string keysym);
+
+    // Returns the QVTKWidget that contains the plot (when compiled with Qt).
+    QVTKWidget *get_widget() const;
+
+  protected:
+
+    void update_pipeline(std::shared_ptr<const Variable> variable=std::shared_ptr<const Variable>());
+
+    // The pool of plotter objects. Objects register
+    // themselves in the list when created and remove themselves when
+    // destroyed.
+    // Used when calling interactive() (which should have effect on
+    // all plot windows)
+    static std::shared_ptr<std::list<VTKPlotter*> > active_plotters;
+
+    // Initialization common to all constructors.
+    // Setup all pipeline objects and connect them.
+    void init();
+
+    // Has init been called
+    bool _initialized;
+
+    // Rescales ranges and glyphs
+    void rescale();
+
+    // Set the title parameter from the name and label of the Variable to plot
+    void set_title_from(const Variable &variable);
+
+    // Return the hover-over help text
+    std::string get_helptext();
+
+    // The plottable object (plot data wrapper)
+    std::shared_ptr<GenericVTKPlottable> _plottable;
+
+    // The output stage
+    std::unique_ptr<VTKWindowOutputStage> vtk_pipeline;
+
+    // The number of plotted frames
+    std::size_t _frame_counter;
+
+    // The window id (derived from Variable::id unless overridden by user)
+    std::string _key;
+
+    // Counter for the automatically named hardcopies
+    static int hardcopy_counter;
+
+    bool no_plot;
+
+    // Keep a shared_ptr to the list of plotter to ensure that the
+    // list is not destroyed before the last VTKPlotter object is
+    // destroyed.
+    std::shared_ptr<std::list<VTKPlotter*> > active_plotters_local_copy;
+
+    // Usually false, but if true ('Q' keyboard binding) then all event loops are skipped.
+    static bool run_to_end;
+  };
+
+}
+
+#endif
diff --git a/dolfin/plot/VTKWindowOutputStage.cpp b/dolfin/plot/VTKWindowOutputStage.cpp
new file mode 100644
index 0000000..967f959
--- /dev/null
+++ b/dolfin/plot/VTKWindowOutputStage.cpp
@@ -0,0 +1,642 @@
+// Copyright (C) 2012 Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Split from VTKPlotter.h, Joachim B Haga, 2012-09-10
+// Modified by Benjamin Kehlet, 2012
+//
+// First added:  2012-09-10
+// Last changed: 2012-11-13
+
+#ifdef HAS_VTK
+
+#ifdef HAS_QVTK
+#include <QApplication>
+#include <QDesktopWidget>
+#include <QVTKWidget.h>
+#endif
+
+#include <vtkSmartPointer.h>
+#include <vtkPolyDataMapper.h>
+#include <vtkLookupTable.h>
+#include <vtkActor.h>
+#include <vtkRenderer.h>
+#include <vtkCamera.h>
+#include <vtkRenderWindow.h>
+#include <vtkRenderWindowInteractor.h>
+#include <vtkScalarBarActor.h>
+#include <vtkTextProperty.h>
+#include <vtkProperty.h>
+#include <vtkProperty2D.h>
+#include <vtkTextActor.h>
+#include <vtkBalloonRepresentation.h>
+#include <vtkBalloonWidget.h>
+#include <vtkInteractorStyleTrackballCamera.h>
+#include <vtkCommand.h>
+#include <vtkWindowToImageFilter.h>
+#include <vtkPNGWriter.h>
+#include <vtkPoints.h>
+#include <vtkPolyLine.h>
+#include <vtkCylinderSource.h>
+#include <vtkObjectFactory.h>
+#include <vtkDepthSortPolyData.h>
+#include <vtkAxesActor.h>
+#include <vtkCaptionActor2D.h>
+
+#ifdef VTK_USE_GL2PS
+#include <vtkGL2PSExporter.h>
+#endif
+
+#include <boost/filesystem.hpp>
+
+#include <dolfin/common/Timer.h>
+#include "VTKWindowOutputStage.h"
+#include "VTKPlotter.h"
+#include "GenericVTKPlottable.h"
+
+using namespace dolfin;
+
+
+// The below is a work-around for Intel compilers which have a problem
+// with unamed namespaces. See
+//     http://software.intel.com/en-us/articles/compiler-reports-error-1757-when-compiling-chromium-os-code
+// and
+//     https://bugs.launchpad.net/dolfin/+bug/1086526
+
+namespace d_anonymous { /* empty body */ }
+using namespace d_anonymous;
+
+namespace d_anonymous
+{
+  //----------------------------------------------------------------------------
+  class PrivateVTKInteractorStyle : public vtkInteractorStyleTrackballCamera
+  {
+    // Create a new style instead of observer callbacks, so that we can
+    // intercept keypresses (like q/e) reliably.
+  public:
+    PrivateVTKInteractorStyle() : _plotter(NULL), _highlighted(false) {}
+
+    static PrivateVTKInteractorStyle* New();
+    vtkTypeMacro(PrivateVTKInteractorStyle, vtkInteractorStyleTrackballCamera)
+
+    virtual void OnKeyPress()
+    {
+      // Only call keypressCallback for non-ascii, to avoid calling twice
+      const char key = Interactor->GetKeyCode();
+      if (key || !handle_keypress())
+        vtkInteractorStyleTrackballCamera::OnKeyPress();
+    }
+
+    virtual void OnChar()
+    {
+      if (!handle_keypress())
+        vtkInteractorStyleTrackballCamera::OnChar();
+    }
+
+    bool handle_keypress()
+    {
+      // Note: ALT key doesn't seem to be usable as a modifier.
+      std::string keysym = Interactor->GetKeySym();
+      char key = Interactor->GetKeyCode();
+      int modifiers = (VTKPlotter::SHIFT   * !!Interactor->GetShiftKey() +
+                       VTKPlotter::ALT     * !!Interactor->GetAltKey()   +
+                       VTKPlotter::CONTROL * !!Interactor->GetControlKey());
+      if (keysym.size() == 1)
+      {
+        // Fix for things like shift+control+q which isn't sent correctly
+        key = keysym[0];
+      }
+
+      key = tolower(key);
+      if (key && key == toupper(key))
+      {
+        // Things like '+', '&' which are not really shifted
+        modifiers &= ~VTKPlotter::SHIFT;
+      }
+
+      log(DBG, "Keypress: %c|%d (%s)", key, modifiers, keysym.c_str());
+      return _plotter->key_pressed(modifiers, key, keysym);
+    }
+
+    // A reference to the parent plotter
+    VTKPlotter *_plotter;
+
+    // A flag to indicate bounding box is visible
+    bool _highlighted;
+
+  };
+  vtkStandardNewMacro(PrivateVTKInteractorStyle)
+  //----------------------------------------------------------------------------
+  class PrivateVTKBalloonWidget : public vtkBalloonWidget
+  {
+  public:
+
+    PrivateVTKBalloonWidget() : _force_visible(false) {}
+
+    static PrivateVTKBalloonWidget* New();
+    vtkTypeMacro(PrivateVTKBalloonWidget, vtkBalloonWidget)
+
+    virtual int SubclassEndHoverAction()
+    {
+      if (_force_visible)
+        return 1;
+      else
+        return vtkBalloonWidget::SubclassEndHoverAction();
+    }
+
+    void toggle_popup(std::string text, vtkBalloonRepresentation *rep) {
+      // This callmethod is only available from vtk 5.6:
+      //vtkBalloonRepresentation *rep = GetBalloonRepresentation();
+      double e[2] = {10, 10};
+
+      _force_visible = !_force_visible;
+      if (_force_visible)
+      {
+        EnabledOn();
+        rep->SetBalloonText(text.c_str());
+        rep->StartWidgetInteraction(e);
+      }
+      else
+        rep->EndWidgetInteraction(e);
+    }
+
+    bool _force_visible;
+
+  };
+  vtkStandardNewMacro(PrivateVTKBalloonWidget)
+  //----------------------------------------------------------------------------
+  #ifdef HAS_QVTK
+  void create_qApp()
+  {
+    if (!qApp)
+    {
+      static int dummy_argc = 0;
+      static char dummy_argv0 = '\0';
+      static char *dummy_argv0_ptr = &dummy_argv0;
+      new QApplication(dummy_argc, &dummy_argv0_ptr);
+    }
+  }
+  #endif
+  //----------------------------------------------------------------------------
+  unsigned char gauss_120[256*4] =
+  {
+  #include "gauss_120.dat"
+  };
+}
+//----------------------------------------------------------------------------
+// Class VTKWindowOutputStage
+//----------------------------------------------------------------------------
+VTKWindowOutputStage::VTKWindowOutputStage(QVTKWidget *user_widget)
+{
+  #ifdef HAS_QVTK
+  widget = user_widget;
+  #endif
+
+  vtkMapper::GlobalImmediateModeRenderingOn(); // FIXME: Check if faster or not
+
+  // Initialize objects
+  _scalarBar = vtkSmartPointer<vtkScalarBarActor>::New();
+  _lut = vtkSmartPointer<vtkLookupTable>::New();
+  _mapper = vtkSmartPointer<vtkPolyDataMapper>::New();
+  _depthSort = vtkSmartPointer<vtkDepthSortPolyData>::New();
+
+  _actor = vtkSmartPointer<vtkActor>::New();
+  helptextActor = vtkSmartPointer<vtkTextActor>::New();
+  balloonRep = vtkSmartPointer<vtkBalloonRepresentation>::New();
+  balloonwidget = vtkSmartPointer<PrivateVTKBalloonWidget>::New();
+
+  _renderer = vtkSmartPointer<vtkRenderer>::New();
+  _renderWindow = vtkSmartPointer<vtkRenderWindow>::New();
+
+  _axesActor = vtkSmartPointer<vtkAxesActor>::New();
+}
+//----------------------------------------------------------------------------
+VTKWindowOutputStage::~VTKWindowOutputStage()
+{
+  // Note: VTK (current 5.6.1) seems to very picky about the order of
+  // destruction. This destructor tries to impose an order on the most
+  // important stuff.
+
+  //log(DBG, "VTK pipeline destroyed");
+
+  #ifdef HAS_QVTK
+  widget = NULL;
+  #endif
+
+  helptextActor = NULL;
+  balloonRep = NULL;
+  balloonwidget = NULL;
+
+  _renderer = NULL;
+  _renderWindow = NULL;
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::init(VTKPlotter *parent, const Parameters& p)
+{
+  // Connect the parts
+  _mapper->SetLookupTable(_lut);
+  _scalarBar->SetLookupTable(_lut);
+  _actor->SetMapper(_mapper);
+  _renderer->AddActor(_actor);
+  _renderWindow->AddRenderer(_renderer);
+
+  // Load the lookup table
+  vtkSmartPointer<vtkUnsignedCharArray> lut_data
+    = vtkSmartPointer<vtkUnsignedCharArray>::New();
+  lut_data->SetNumberOfComponents(4);
+  lut_data->SetArray(gauss_120, 256*4, 1);
+  _lut->SetTable(lut_data.GetPointer());
+
+  // Connect the depth-sort filter to the camera
+  _depthSort->SetCamera(_renderer->GetActiveCamera());
+
+  // Set up interactorstyle and connect interactor
+  vtkSmartPointer<PrivateVTKInteractorStyle> style =
+    vtkSmartPointer<PrivateVTKInteractorStyle>::New();
+  style->_plotter = parent;
+
+  #ifdef HAS_QVTK
+  if (!widget)
+  {
+    // Create new top-level widget -- make sure a QApplication exists first
+    create_qApp();
+    widget = new QVTKWidget();
+  }
+  _renderWindow->SetInteractor(widget->GetInteractor());
+
+  widget->SetRenderWindow(_renderWindow);
+  if (widget->parentWidget())
+    widget->resize(widget->parentWidget()->size());
+  else
+    widget->resize(p["window_width"], p["window_height"]);
+  #else
+  _renderWindow->SetInteractor(vtkSmartPointer<vtkRenderWindowInteractor>::New());
+  const int width  = p["window_width"];
+  const int height = p["window_height"];
+  if (width > 0 && height > 0)
+    _renderWindow->SetSize(width, height);
+  #endif
+  _renderWindow->GetInteractor()->SetInteractorStyle(style);
+  style->SetCurrentRenderer(_renderer);
+
+  // Set some properties that affect the look of things
+  _renderer->SetBackground(1, 1, 1);
+  _actor->GetProperty()->SetColor(0, 0, 1); //Only used for meshes
+  _actor->GetProperty()->SetPointSize(4);   // should be parameter?
+
+  // Set window stuff
+  _scalarBar->SetTitle(""); // To avoid uninitialized-warning in VTK 6
+  _scalarBar->SetTextPositionToPrecedeScalarBar();
+
+  // Set the look of scalar bar labels
+  vtkSmartPointer<vtkTextProperty> labelprop
+    = _scalarBar->GetLabelTextProperty();
+  labelprop->SetColor(0, 0, 0);
+  labelprop->SetFontSize(20);
+  labelprop->ItalicOff();
+  labelprop->BoldOff();
+  if (p["scalarbar"])
+    _renderer->AddActor(_scalarBar);
+
+  if (p["axes"])
+  {
+    //axes->SetShaftTypeToCylinder();
+    _axesActor->GetXAxisCaptionActor2D()->GetCaptionTextProperty()->SetFontSize(12);
+    _axesActor->GetYAxisCaptionActor2D()->GetCaptionTextProperty()->SetFontSize(12);
+    _axesActor->GetZAxisCaptionActor2D()->GetCaptionTextProperty()->SetFontSize(12);
+    _axesActor->GetXAxisCaptionActor2D()->GetCaptionTextProperty()->BoldOff();
+    _axesActor->GetYAxisCaptionActor2D()->GetCaptionTextProperty()->BoldOff();
+    _axesActor->GetZAxisCaptionActor2D()->GetCaptionTextProperty()->BoldOff();
+    _axesActor->GetXAxisCaptionActor2D()->GetCaptionTextProperty()->SetColor(0.0, 0.0, 0.0);
+    _axesActor->GetYAxisCaptionActor2D()->GetCaptionTextProperty()->SetColor(0.0, 0.0, 0.0);
+    _axesActor->GetZAxisCaptionActor2D()->GetCaptionTextProperty()->SetColor(0.0, 0.0, 0.0);
+    _axesActor->GetXAxisCaptionActor2D()->GetCaptionTextProperty()->ShadowOn();
+    _axesActor->GetYAxisCaptionActor2D()->GetCaptionTextProperty()->ShadowOn();
+    _axesActor->GetZAxisCaptionActor2D()->GetCaptionTextProperty()->ShadowOn();
+    _renderer->AddActor(_axesActor);
+  }
+
+  // Create help text actor
+  helptextActor->SetPosition(10, 10);
+  helptextActor->SetInput("Help ");
+  helptextActor->GetTextProperty()->SetColor(0.0, 0.0, 0.0);
+  helptextActor->GetTextProperty()->SetFontSize(16);
+  helptextActor->GetTextProperty()->SetFontFamilyToCourier();
+
+  // Set up the representation for the hover-over help text box
+  balloonRep->SetOffset(5, 5);
+  balloonRep->GetTextProperty()->SetFontSize(14);
+  balloonRep->GetTextProperty()->BoldOff();
+  balloonRep->GetTextProperty()->SetFontFamilyToCourier();
+  balloonRep->GetFrameProperty()->SetOpacity(0.7);
+
+  // Set up the actual widget that makes the help text pop up
+  balloonwidget->SetInteractor(get_interactor());
+  balloonwidget->SetRepresentation(balloonRep);
+}
+//----------------------------------------------------------------------------
+vtkRenderWindowInteractor* VTKWindowOutputStage::get_interactor()
+{
+  return _renderWindow->GetInteractor();
+}
+//----------------------------------------------------------------------------
+vtkSmartPointer<vtkRenderer> VTKWindowOutputStage::get_renderer()
+{
+  return _renderer;
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::scale_points_lines(double factor)
+{
+  const double pt_size = _actor->GetProperty()->GetPointSize();
+  const double l_width = _actor->GetProperty()->GetLineWidth();
+  _actor->GetProperty()->SetPointSize(pt_size*factor);
+  _actor->GetProperty()->SetLineWidth(l_width*factor);
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::set_helptext(std::string text)
+{
+  // Add help text actor
+  _renderer->AddActor2D(helptextActor);
+
+  // Add the balloon text to the actor
+  balloonwidget->AddBalloon(helptextActor, text.c_str(), NULL);
+  balloonwidget->EnabledOn();
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::set_window_title(std::string title)
+{
+  #ifdef HAS_QVTK
+  widget->setWindowTitle(title.c_str());
+  #else
+  _renderWindow->SetWindowName(title.c_str());
+  #endif
+}
+//----------------------------------------------------------------------------
+std::string VTKWindowOutputStage::get_window_title()
+{
+  #ifdef HAS_QVTK
+  return widget->windowTitle().toStdString();
+  #else
+  return _renderWindow->GetWindowName();
+  #endif
+}
+//----------------------------------------------------------------------------
+QVTKWidget *VTKWindowOutputStage::get_widget() const
+{
+  #ifdef HAS_QVTK
+  return widget;
+  #else
+  return NULL;
+  #endif
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::close_window()
+{
+  #ifdef HAS_QVTK
+  widget->close();
+  #else
+  warning("Window close not implemented on VTK event loop");
+  #endif
+}
+//----------------------------------------------------------------------------
+bool VTKWindowOutputStage::resurrect_window()
+{
+  #ifdef HAS_QVTK
+  if (widget->isHidden())
+  {
+    widget->show();
+    return true;
+  }
+  #endif
+  return false;
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::start_interaction(bool enter_eventloop)
+{
+  get_interactor()->Initialize();
+  render();
+  if (enter_eventloop)
+  {
+    #ifdef HAS_QVTK
+    qApp->exec();
+    #else
+    get_interactor()->Start();
+    #endif
+  }
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::stop_interaction()
+{
+  #ifdef HAS_QVTK
+  qApp->quit();
+  #else
+  get_interactor()->TerminateApp();
+  #endif
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::write_png(std::string filename)
+{
+  const bool help_visible = helptextActor->GetVisibility();
+  helptextActor->VisibilityOff();
+
+  // Create window to image filter and PNG writer
+  vtkSmartPointer<vtkWindowToImageFilter> w2i =
+    vtkSmartPointer<vtkWindowToImageFilter>::New();
+  vtkSmartPointer<vtkPNGWriter> writer = vtkSmartPointer<vtkPNGWriter>::New();
+
+  w2i->SetInput(_renderWindow);
+  w2i->Update();
+  writer->SetInputConnection(w2i->GetOutputPort());
+  writer->SetFileName((filename + ".png").c_str());
+  render();
+  writer->Modified();
+  writer->Write();
+
+  if (help_visible)
+  {
+    helptextActor->VisibilityOn();
+    render();
+  }
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::write_pdf(std::string filename)
+{
+  #ifdef VTK_USE_GL2PS
+  vtkSmartPointer<vtkGL2PSExporter> exporter
+    = vtkSmartPointer<vtkGL2PSExporter>::New();
+  exporter->SetFilePrefix(filename.c_str());
+  //exporter->SetTitle(get_window_title().c_str());
+  if (_input == _depthSort)
+  {
+    // Handle translucency by rasterisation. Commented out because it fails
+    // (for me) with GLXBadContextTag error.
+    //exporter->Write3DPropsAsRasterImageOn();
+  }
+  exporter->SetFileFormatToPDF();
+  exporter->SetSortToBSP();
+  exporter->DrawBackgroundOff();
+  exporter->LandscapeOn();
+  //exporter->SilentOn();
+  exporter->SetRenderWindow(_renderWindow);
+  exporter->Write();
+  #else
+  warning("VTK not configured for PDF output");
+  #endif
+}
+//----------------------------------------------------------------------------
+vtkCamera* VTKWindowOutputStage::get_camera()
+{
+  return _renderer->GetActiveCamera();
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::reset_camera()
+{
+  // vtkAxesActor messes up the bounding box, disable it while setting camera
+  _axesActor->SetVisibility(false);
+  _renderer->ResetCamera();
+  _axesActor->SetVisibility(true);
+  // but don't clip it
+  reset_camera_clipping_range();
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::reset_camera_clipping_range()
+{
+  _renderer->ResetCameraClippingRange();
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::set_scalar_range(double *range)
+{
+  _mapper->SetScalarRange(range);
+  // Normally the mapper controls the lut range. But if the mapper isn't
+  // activated (no visible actors), then the lut update will be delayed.
+  _lut->SetRange(range);
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::cycle_representation(int new_rep)
+{
+  if (!new_rep)
+  {
+    const int cur_rep = _actor->GetProperty()->GetRepresentation();
+    switch (cur_rep)
+    {
+    case VTK_SURFACE:   new_rep = VTK_WIREFRAME; break;
+    case VTK_WIREFRAME: new_rep = VTK_POINTS;    break;
+    default:
+    case VTK_POINTS:    new_rep = VTK_SURFACE;   break;
+    }
+  }
+  _actor->GetProperty()->SetRepresentation(new_rep);
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::toggle_boundingbox()
+{
+  PrivateVTKInteractorStyle *style
+    = dynamic_cast<PrivateVTKInteractorStyle*>(get_interactor()->GetInteractorStyle());
+  if (style)
+  {
+    style->_highlighted = !style->_highlighted;
+    style->HighlightProp(style->_highlighted ? _actor : NULL);
+  }
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::toggle_helptext(std::string text)
+{
+  PrivateVTKBalloonWidget *balloon
+    = dynamic_cast<PrivateVTKBalloonWidget*>((vtkBalloonWidget*)balloonwidget);
+  balloon->toggle_popup(text, balloonRep);
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::render()
+{
+  Timer timer("VTK render");
+  _renderWindow->Render();
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::get_window_size(int& width, int& height)
+{
+  #ifdef HAS_QVTK
+  QSize size = widget->frameSize();
+  width = size.width();
+  height = size.height();
+  #else
+  get_interactor()->GetSize(width, height);
+  // Guess window decoration (frame) size
+  width += 6;
+  height += 30;
+  #endif
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::get_screen_size(int& width, int& height)
+{
+  #ifdef HAS_QVTK
+  QRect geom = QApplication::desktop()->availableGeometry();
+  width = geom.width();
+  height = geom.height();
+  #else
+  int *size = _renderWindow->GetScreenSize();
+  width = size[0];
+  height = size[1];
+  #endif
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::place_window(int x, int y)
+{
+  #ifdef HAS_QVTK
+  widget->move(x, y);
+  widget->show();
+  #else
+  _renderWindow->SetPosition(x, y);
+  #endif
+}
+//----------------------------------------------------------------------------
+bool VTKWindowOutputStage::add_viewprop(vtkSmartPointer<vtkProp> prop)
+{
+  if (!_renderer->HasViewProp(prop))
+  {
+    _renderer->AddViewProp(prop);
+    return true;
+  }
+  return false;
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::set_input(vtkSmartPointer<vtkAlgorithmOutput> output)
+{
+  _input->SetInputConnection(output);
+}
+//----------------------------------------------------------------------------
+void VTKWindowOutputStage::set_translucent(bool onoff, std::size_t topo_dim,
+                                           std::size_t geom_dim)
+{
+  // In 3D, any translucency in the lut makes the visibility test
+  // for cell/vertex labels ineffective.
+  // The depth sorting is slow, particularly for glyphs.
+  // Hence, set these only when required.
+
+  #if (VTK_MAJOR_VERSION == 6) || ((VTK_MAJOR_VERSION == 5) && (VTK_MINOR_VERSION >= 8))
+  _lut->SetNanColor(0.0, 0.0, 0.0, (onoff ? 0.05 : 1.0));
+  #endif
+
+  if (onoff && topo_dim >= 2 && geom_dim == 3)
+  {
+    _mapper->SetInputConnection(_depthSort->GetOutputPort());
+    _input = _depthSort;
+  }
+  else
+    _input = _mapper;
+}
+//----------------------------------------------------------------------------
+
+#endif // HAS_VTK
diff --git a/dolfin/plot/VTKWindowOutputStage.h b/dolfin/plot/VTKWindowOutputStage.h
new file mode 100644
index 0000000..ef991b8
--- /dev/null
+++ b/dolfin/plot/VTKWindowOutputStage.h
@@ -0,0 +1,199 @@
+// Copyright (C) 2012 Joachim B Haga
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-09-10
+// Last changed: 2012-09-14
+
+#ifndef __VTK_WINDOW_OUTPUT_STAGE_H
+#define __VTK_WINDOW_OUTPUT_STAGE_H
+
+#include <vtkSmartPointer.h>
+
+// Forward declarations
+class QVTKWidget;
+class vtkActor;
+class vtkAlgorithm;
+class vtkAlgorithmOutput;
+class vtkAxesActor;
+class vtkBalloonRepresentation;
+class vtkBalloonWidget;
+class vtkCamera;
+class vtkDepthSortPolyData;
+class vtkLookupTable;
+class vtkPolyDataMapper;
+class vtkRenderWindow;
+class vtkRenderWindowInteractor;
+class vtkRenderer;
+class vtkScalarBarActor;
+class vtkTextActor;
+class vtkProp;
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class GenericVTKPlottable;
+  class Parameters;
+  class VTKPlotter;
+
+  /// This class enables visualization of various DOLFIN entities.
+  class VTKWindowOutputStage
+  {
+
+  public:
+
+    /// If a widget is supplied, this widget will be used for drawing,
+    /// instead of a new top-level widget. Ownership is transferred.
+    VTKWindowOutputStage(QVTKWidget* widget = NULL);
+
+    /// Destructor
+    ~VTKWindowOutputStage();
+
+    /// Initialise the pipeline
+    void init(VTKPlotter* parent, const Parameters& parameters);
+
+    /// Get the vtkRenderWindowInteractor for the window
+    vtkRenderWindowInteractor* get_interactor();
+
+    /// Get the vtkRenderer for the scene
+    vtkSmartPointer<vtkRenderer> get_renderer();
+
+    /// Scale points and lines by the given factor
+    void scale_points_lines(double factor);
+
+    /// Set the help text, and (re)create the popup widget
+    void set_helptext(std::string text);
+
+    /// Change the window title
+    void set_window_title(std::string title);
+
+    /// Retrieve the window title
+    std::string get_window_title();
+
+    /// Return a pointer to the plotting widget. The pointer is valid
+    /// from after init() is called (if no widget was passed in the
+    /// contructor).
+    QVTKWidget *get_widget() const;
+
+    /// Close the plotting window (only Qt). The window is not destroyed.
+    void close_window();
+
+    /// Re-open a previously closed plotting window.
+    bool resurrect_window();
+
+    /// Start interaction, and optionally enter the event loop. In Qt,
+    /// interaction is allowed also before start_interaction is called,
+    /// but updates are only processed when the plot is updated.
+    void start_interaction(bool enter_eventloop=true);
+
+    /// Exit the event loop
+    void stop_interaction();
+
+    /// Write the current frame to raster file
+    void write_png(std::string filename);
+
+    /// Write the current frame to vector file
+    void write_pdf(std::string filename);
+
+    /// Retrieve the camera
+    vtkCamera* get_camera();
+
+    /// Reset the camera to cover the whole scene
+    void reset_camera();
+
+    /// Reset camera clipping ranges, if the scene has changed
+    void reset_camera_clipping_range();
+
+    /// Set the scalar range for colorbar
+    void set_scalar_range(double *range);
+
+    /// Cycle between surface--wireframe--points representation
+    void cycle_representation(int new_rep=0);
+
+    /// Toggle the bounding box around the main actor
+    void toggle_boundingbox();
+
+    /// Toggle the help text box with the given text
+    void toggle_helptext(std::string text);
+
+    /// Re-render the current frame
+    void render();
+
+    /// Get the size of the plot window
+    void get_window_size(int& width, int& height);
+
+    /// Get the size of the screen
+    void get_screen_size(int& width, int& height);
+
+    /// Place the plot window at the given coordinates
+    void place_window(int x, int y);
+
+    /// Add a prop to the scene. If it is already in the scene,
+    /// it will not be re-added.
+    bool add_viewprop(vtkSmartPointer<vtkProp> prop);
+
+    /// Set the input for the output stage.
+    void set_input(vtkSmartPointer<vtkAlgorithmOutput> output);
+
+    /// Used by plottables to indicate whether the scene should be
+    /// treated as translucent (which requires depth sorting, etc.)
+    void set_translucent(bool onoff, std::size_t topo_dim=3, std::size_t geom_dim=3);
+
+  protected:
+
+    // The depth sorting filter
+    vtkSmartPointer<vtkDepthSortPolyData> _depthSort;
+
+    // The poly data mapper
+    vtkSmartPointer<vtkPolyDataMapper> _mapper;
+
+    // The input port (either the mapper or depth sorter)
+    vtkSmartPointer<vtkAlgorithm> _input;
+
+    // The lookup table
+    vtkSmartPointer<vtkLookupTable> _lut;
+
+    // The main actor
+    vtkSmartPointer<vtkActor> _actor;
+
+    // The renderer
+    vtkSmartPointer<vtkRenderer> _renderer;
+
+    // The render window
+    vtkSmartPointer<vtkRenderWindow> _renderWindow;
+
+    // The scalar bar that gives the viewer the mapping from color to
+    // scalar value
+    vtkSmartPointer<vtkScalarBarActor> _scalarBar;
+
+    // Axes
+    vtkSmartPointer<vtkAxesActor> _axesActor;
+
+    // Help text popup
+    vtkSmartPointer<vtkTextActor> helptextActor;
+    vtkSmartPointer<vtkBalloonRepresentation> balloonRep;
+    vtkSmartPointer<vtkBalloonWidget> balloonwidget;
+
+    #ifdef HAS_QVTK
+    QVTKWidget *widget;
+    #endif
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/plot/dolfin_plot.h b/dolfin/plot/dolfin_plot.h
new file mode 100644
index 0000000..c620515
--- /dev/null
+++ b/dolfin/plot/dolfin_plot.h
@@ -0,0 +1,9 @@
+#ifndef __DOLFIN_PLOT_H
+#define __DOLFIN_PLOT_H
+
+// DOLFIN plot interface
+
+#include <dolfin/plot/plot.h>
+#include <dolfin/plot/VTKPlotter.h>
+
+#endif
diff --git a/dolfin/plot/gauss_120.dat b/dolfin/plot/gauss_120.dat
new file mode 100644
index 0000000..32a9ec5
--- /dev/null
+++ b/dolfin/plot/gauss_120.dat
@@ -0,0 +1,259 @@
+// Generated from gauss_120.lut using:
+// awk 'NR>1 {printf "%d, %d, %d, %d,\n",$1*255,$2*255,$3*255,$4*255}' gauss_120.lut
+
+0, 21, 255, 255,
+1, 22, 254, 255,
+1, 22, 254, 255,
+1, 23, 254, 255,
+1, 24, 254, 255,
+1, 24, 254, 255,
+1, 25, 254, 255,
+1, 26, 253, 255,
+1, 27, 253, 255,
+1, 27, 253, 255,
+1, 28, 252, 255,
+1, 29, 252, 255,
+1, 30, 251, 255,
+1, 31, 251, 255,
+1, 31, 250, 255,
+1, 32, 250, 255,
+1, 33, 249, 255,
+2, 34, 248, 255,
+2, 35, 248, 255,
+2, 36, 247, 255,
+2, 37, 246, 255,
+2, 38, 245, 255,
+2, 39, 244, 255,
+2, 40, 243, 255,
+2, 41, 242, 255,
+2, 42, 241, 255,
+2, 43, 240, 255,
+3, 44, 239, 255,
+3, 45, 238, 255,
+3, 46, 237, 255,
+3, 47, 236, 255,
+3, 48, 234, 255,
+3, 50, 233, 255,
+3, 51, 232, 255,
+3, 52, 231, 255,
+4, 53, 229, 255,
+4, 54, 228, 255,
+4, 56, 226, 255,
+4, 57, 225, 255,
+4, 58, 223, 255,
+4, 60, 222, 255,
+5, 61, 220, 255,
+5, 62, 219, 255,
+5, 64, 217, 255,
+5, 65, 216, 255,
+5, 67, 214, 255,
+6, 68, 212, 255,
+6, 70, 211, 255,
+6, 71, 209, 255,
+6, 73, 207, 255,
+7, 74, 205, 255,
+7, 76, 204, 255,
+7, 77, 202, 255,
+7, 79, 200, 255,
+8, 80, 198, 255,
+8, 82, 196, 255,
+8, 83, 195, 255,
+8, 85, 193, 255,
+9, 87, 191, 255,
+9, 88, 189, 255,
+9, 90, 187, 255,
+10, 92, 185, 255,
+10, 94, 183, 255,
+10, 95, 181, 255,
+11, 97, 179, 255,
+11, 99, 177, 255,
+12, 101, 175, 255,
+12, 103, 173, 255,
+12, 104, 171, 255,
+13, 106, 169, 255,
+13, 108, 167, 255,
+14, 110, 165, 255,
+14, 112, 163, 255,
+15, 114, 161, 255,
+15, 116, 159, 255,
+16, 117, 157, 255,
+16, 119, 155, 255,
+17, 121, 153, 255,
+17, 123, 151, 255,
+18, 125, 149, 255,
+18, 127, 147, 255,
+19, 129, 145, 255,
+19, 131, 143, 255,
+20, 133, 141, 255,
+20, 135, 139, 255,
+21, 137, 137, 255,
+22, 139, 135, 255,
+22, 141, 133, 255,
+23, 143, 131, 255,
+24, 145, 129, 255,
+24, 147, 127, 255,
+25, 149, 125, 255,
+26, 151, 123, 255,
+27, 153, 121, 255,
+27, 155, 119, 255,
+28, 157, 117, 255,
+29, 159, 116, 255,
+30, 161, 114, 255,
+31, 163, 112, 255,
+31, 165, 110, 255,
+32, 167, 108, 255,
+33, 169, 106, 255,
+34, 171, 104, 255,
+35, 173, 103, 255,
+36, 175, 101, 255,
+37, 177, 99, 255,
+38, 179, 97, 255,
+39, 181, 95, 255,
+40, 183, 94, 255,
+41, 185, 92, 255,
+42, 187, 90, 255,
+43, 189, 88, 255,
+44, 191, 87, 255,
+45, 193, 85, 255,
+46, 195, 83, 255,
+47, 196, 82, 255,
+48, 198, 80, 255,
+50, 200, 79, 255,
+51, 202, 77, 255,
+52, 204, 76, 255,
+53, 205, 74, 255,
+54, 207, 73, 255,
+56, 209, 71, 255,
+57, 211, 70, 255,
+58, 212, 68, 255,
+60, 214, 67, 255,
+61, 216, 65, 255,
+62, 217, 64, 255,
+64, 219, 62, 255,
+65, 220, 61, 255,
+67, 222, 60, 255,
+68, 223, 58, 255,
+70, 225, 57, 255,
+71, 226, 56, 255,
+73, 228, 54, 255,
+74, 229, 53, 255,
+76, 231, 52, 255,
+77, 232, 51, 255,
+79, 233, 50, 255,
+80, 234, 48, 255,
+82, 236, 47, 255,
+83, 237, 46, 255,
+85, 238, 45, 255,
+87, 239, 44, 255,
+88, 240, 43, 255,
+90, 241, 42, 255,
+92, 242, 41, 255,
+94, 243, 40, 255,
+95, 244, 39, 255,
+97, 245, 38, 255,
+99, 246, 37, 255,
+101, 247, 36, 255,
+103, 248, 35, 255,
+104, 248, 34, 255,
+106, 249, 33, 255,
+108, 250, 32, 255,
+110, 250, 31, 255,
+112, 251, 31, 255,
+114, 251, 30, 255,
+116, 252, 29, 255,
+117, 252, 28, 255,
+119, 253, 27, 255,
+121, 253, 27, 255,
+123, 253, 26, 255,
+125, 254, 25, 255,
+127, 254, 24, 255,
+129, 254, 24, 255,
+131, 254, 23, 255,
+133, 254, 22, 255,
+135, 254, 22, 255,
+137, 255, 21, 255,
+139, 254, 20, 255,
+141, 254, 20, 255,
+143, 254, 19, 255,
+145, 254, 19, 255,
+147, 254, 18, 255,
+149, 254, 18, 255,
+151, 253, 17, 255,
+153, 253, 17, 255,
+155, 253, 16, 255,
+157, 252, 16, 255,
+159, 252, 15, 255,
+161, 251, 15, 255,
+163, 251, 14, 255,
+165, 250, 14, 255,
+167, 250, 13, 255,
+169, 249, 13, 255,
+171, 248, 12, 255,
+173, 248, 12, 255,
+175, 247, 12, 255,
+177, 246, 11, 255,
+179, 245, 11, 255,
+181, 244, 10, 255,
+183, 243, 10, 255,
+185, 242, 10, 255,
+187, 241, 9, 255,
+189, 240, 9, 255,
+191, 239, 9, 255,
+193, 238, 8, 255,
+195, 237, 8, 255,
+196, 236, 8, 255,
+198, 234, 8, 255,
+200, 233, 7, 255,
+202, 232, 7, 255,
+204, 231, 7, 255,
+205, 229, 7, 255,
+207, 228, 6, 255,
+209, 226, 6, 255,
+211, 225, 6, 255,
+212, 223, 6, 255,
+214, 222, 5, 255,
+216, 220, 5, 255,
+217, 219, 5, 255,
+219, 217, 5, 255,
+220, 216, 5, 255,
+222, 214, 4, 255,
+223, 212, 4, 255,
+225, 211, 4, 255,
+226, 209, 4, 255,
+228, 207, 4, 255,
+229, 205, 4, 255,
+231, 204, 3, 255,
+232, 202, 3, 255,
+233, 200, 3, 255,
+234, 198, 3, 255,
+236, 196, 3, 255,
+237, 195, 3, 255,
+238, 193, 3, 255,
+239, 191, 3, 255,
+240, 189, 2, 255,
+241, 187, 2, 255,
+242, 185, 2, 255,
+243, 183, 2, 255,
+244, 181, 2, 255,
+245, 179, 2, 255,
+246, 177, 2, 255,
+247, 175, 2, 255,
+248, 173, 2, 255,
+248, 171, 2, 255,
+249, 169, 1, 255,
+250, 167, 1, 255,
+250, 165, 1, 255,
+251, 163, 1, 255,
+251, 161, 1, 255,
+252, 159, 1, 255,
+252, 157, 1, 255,
+253, 155, 1, 255,
+253, 153, 1, 255,
+253, 151, 1, 255,
+254, 149, 1, 255,
+254, 147, 1, 255,
+254, 145, 1, 255,
+254, 143, 1, 255,
+254, 141, 1, 255,
+254, 139, 1, 255,
+255, 137, 0, 255
diff --git a/dolfin/plot/plot.cpp b/dolfin/plot/plot.cpp
new file mode 100644
index 0000000..4971a3a
--- /dev/null
+++ b/dolfin/plot/plot.cpp
@@ -0,0 +1,172 @@
+// Copyright (C) 2007-2012 Anders Logg and Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim Berdal Haga, 2008, 2012.
+// Modified by Garth N. Wells, 2008.
+// Modified by Benjamin Kehlet, 2012
+//
+// First added:  2007-05-02
+// Last changed: 2013-09-19
+
+#include <cstdlib>
+#include <sstream>
+#include <list>
+
+#include <dolfin/common/utils.h>
+#include <dolfin/fem/DirichletBC.h>
+#include <dolfin/function/Function.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/Expression.h>
+#include <dolfin/io/File.h>
+#include <dolfin/log/log.h>
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/parameter/Parameters.h>
+#include "ExpressionWrapper.h"
+#include "VTKPlotter.h"
+#include "plot.h"
+
+using namespace dolfin;
+
+// Global list of plotters created by the plot() family of functions
+// in this file.  Used to search for plotter objects in get_plotter()
+// and to ensure that plotter objects are correctly destroyed when the
+// program terminates.
+static std::list<std::shared_ptr<VTKPlotter> > stored_plotters;
+
+//-----------------------------------------------------------------------------
+// Function for getting already instantiated VTKPlotter for
+// the given object. If none is found, a new one is created.
+std::shared_ptr<VTKPlotter> get_plotter(std::shared_ptr<const Variable> obj, std::string key)
+{
+  log(TRACE, "Looking for cached VTKPlotter [%s].", key.c_str());
+
+  for (std::list<std::shared_ptr<VTKPlotter> >::iterator it = stored_plotters.begin(); it != stored_plotters.end(); it++)
+  {
+    if ( (*it)->key() == key && (*it)->is_compatible(obj) )
+    {
+      log(TRACE, "Found compatible cached VTKPlotter.");
+      return *it;
+    }
+  }
+
+  // No previous plotter found, so create a new one
+  log(TRACE, "No VTKPlotter found in cache, creating new plotter.");
+  std::shared_ptr<VTKPlotter> plotter(new VTKPlotter(obj));
+  plotter->set_key(key);
+  stored_plotters.push_back(plotter);
+
+  return plotter;
+}
+//-----------------------------------------------------------------------------
+// Function for plotting objects
+std::shared_ptr<VTKPlotter> plot_object(std::shared_ptr<const Variable> obj,
+                                          std::shared_ptr<const Parameters> p,
+                                          std::string key)
+{
+  // Get plotter from cache. Key given as parameter takes precedence.
+  const Parameter *param_key = p->find_parameter("key");
+  if (param_key && param_key->is_set())
+  {
+    key = (std::string)*param_key;
+  }
+
+  std::shared_ptr<VTKPlotter> plotter = get_plotter(obj, key);
+
+  // Set plotter parameters
+  plotter->parameters.update(*p);
+
+  // Plot
+  plotter->plot(obj);
+
+  return plotter;
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<Parameters> new_parameters(std::string title, std::string mode)
+{
+  std::shared_ptr<Parameters> p(new Parameters());
+  if (!title.empty())
+  {
+    p->add("title", title);
+  }
+  p->add("mode", mode);
+  return p;
+}
+//-----------------------------------------------------------------------------
+void dolfin::interactive(bool really)
+{
+  VTKPlotter::all_interactive(really);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<VTKPlotter> dolfin::plot(const Variable& var,
+					   std::string title,
+					   std::string mode)
+{
+  return plot(reference_to_no_delete_pointer(var), title, mode);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<VTKPlotter> dolfin::plot(std::shared_ptr<const Variable> var,
+					   std::string title, std::string mode)
+{
+  return plot(var, new_parameters(title, mode));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<VTKPlotter> dolfin::plot(const Variable& var,
+					   const Parameters& p)
+{
+  return plot(reference_to_no_delete_pointer(var),
+	      reference_to_no_delete_pointer(p));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<VTKPlotter> dolfin::plot(std::shared_ptr<const Variable> var,
+					   std::shared_ptr<const Parameters> p)
+{
+  return plot_object(var, p, VTKPlotter::to_key(*var));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<VTKPlotter> dolfin::plot(const Expression& expression,
+					   const Mesh& mesh,
+					   std::string title, std::string mode)
+{
+  return plot(reference_to_no_delete_pointer(expression),
+	      reference_to_no_delete_pointer(mesh), title, mode);
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<VTKPlotter> dolfin::plot(std::shared_ptr<const Expression> expression,
+					   std::shared_ptr<const Mesh> mesh,
+					   std::string title, std::string mode)
+{
+  return plot(expression, mesh, new_parameters(title, mode));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<VTKPlotter> dolfin::plot(const Expression& expression,
+                                           const Mesh& mesh,
+                                            const Parameters& p)
+{
+  return plot(reference_to_no_delete_pointer(expression),
+	      reference_to_no_delete_pointer(mesh),
+	      reference_to_no_delete_pointer(p));
+}
+//-----------------------------------------------------------------------------
+std::shared_ptr<VTKPlotter> dolfin::plot(std::shared_ptr<const Expression> expression,
+					   std::shared_ptr<const Mesh> mesh,
+					   std::shared_ptr<const Parameters> p)
+{
+  std::shared_ptr<const ExpressionWrapper>
+    wrapper(new ExpressionWrapper(expression, mesh));
+  return plot_object(wrapper, p, VTKPlotter::to_key(*expression));
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/plot/plot.h b/dolfin/plot/plot.h
new file mode 100644
index 0000000..4ce4614
--- /dev/null
+++ b/dolfin/plot/plot.h
@@ -0,0 +1,93 @@
+// Copyright (C) 2007-2012 Anders Logg and Fredrik Valdmanis
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Joachim B Haga 2012
+//
+// First added:  2007-05-02
+// Last changed: 2012-09-16
+
+#ifndef __PLOT_H
+#define __PLOT_H
+
+#include <string>
+#include <memory>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Variable;
+  class Expression;
+  class Mesh;
+  class Parameters;
+  class VTKPlotter;
+
+  /// Make the current plots interactive. If really is set, the interactive
+  /// mode is entered even if 'Q' has been pressed.
+  void interactive(bool really=false);
+
+  //---------------------------------------------------------------------------
+  /// Simple built-in plot commands for plotting functions and meshes.
+  //---------------------------------------------------------------------------
+
+  // Plot variable of any supported type
+  std::shared_ptr<VTKPlotter> plot(const Variable&,
+				     std::string title="",
+				     std::string mode="auto");
+
+  /// Plot variable (shared_ptr version)
+  std::shared_ptr<VTKPlotter> plot(std::shared_ptr<const Variable>,
+				     std::string title="",
+				     std::string mode="auto");
+
+  /// Plot variable (parameter version)
+  std::shared_ptr<VTKPlotter> plot(const Variable&,
+				     const Parameters& parameters);
+
+  /// Plot variable (parameter, shared_ptr version)
+  std::shared_ptr<VTKPlotter> plot(std::shared_ptr<const Variable>,
+				     std::shared_ptr<const Parameters> parameters);
+
+  //---------------------------------------------------------------------------
+  // Specialised versions for Expression together with Mesh
+  //---------------------------------------------------------------------------
+
+  /// Plot expression
+  std::shared_ptr<VTKPlotter> plot(const Expression& expression,
+				     const Mesh& mesh,
+				     std::string title="",
+				     std::string mode="auto");
+
+  /// Plot expression (shared_ptr version)
+  std::shared_ptr<VTKPlotter> plot(std::shared_ptr<const Expression> expression,
+                                     std::shared_ptr<const Mesh> mesh,
+				     std::string title="",
+				     std::string mode="auto");
+
+  /// Plot expression (parameter version)
+  std::shared_ptr<VTKPlotter> plot(const Expression& expression,
+				     const Mesh& mesh,
+				     const Parameters& parameters);
+
+  /// Plot expression (parameter, shared_ptr version)
+  std::shared_ptr<VTKPlotter> plot(std::shared_ptr<const Expression> expression,
+				     std::shared_ptr<const Mesh> mesh,
+				     std::shared_ptr<const Parameters> parameters);
+
+}
+
+#endif
diff --git a/dolfin/refinement/BisectionRefinement.cpp b/dolfin/refinement/BisectionRefinement.cpp
new file mode 100644
index 0000000..53de735
--- /dev/null
+++ b/dolfin/refinement/BisectionRefinement.cpp
@@ -0,0 +1,181 @@
+// Copyright (C) 2006 Johan Hoffman
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2009-2011.
+// Modified by Garth N. Wells, 2010-2011.
+// Modified by Marie E. Rognes, 2011.
+//
+// First added:  2006-11-01
+// Last changed: 2011-04-07
+
+#include <memory>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Facet.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include "RivaraRefinement.h"
+#include "BisectionRefinement.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void BisectionRefinement::refine_by_recursive_bisection(Mesh& refined_mesh,
+                        const Mesh& mesh, const MeshFunction<bool>& cell_marker)
+{
+  not_working_in_parallel("BisectionRefinement::refine");
+
+  // Transformation maps
+  MeshFunction<std::size_t> cell_map;
+  std::vector<int> facet_map;
+
+  // Call Rivara refinement
+  RivaraRefinement::refine(refined_mesh, mesh, cell_marker, cell_map,
+                           facet_map);
+
+  // Store child->parent cell and facet information as mesh data
+  const std::size_t D = refined_mesh.topology().dim();
+  std::vector<std::size_t>& cf
+    = refined_mesh.data().create_array("parent_cell", D);
+  cf.resize(refined_mesh.num_cells());
+  for(std::size_t i = 0; i < refined_mesh.num_cells(); i++)
+    cf[i] = cell_map[i];
+
+  // Create mesh function in refined mesh encoding parent facet maps
+  refined_mesh.init(D - 1);
+  std::vector<std::size_t>& ff
+    = refined_mesh.data().create_array("parent_facet", D - 1);
+  ff.resize(refined_mesh.num_facets());
+
+  // Fill ff from facet_map
+  mesh.init(D, D - 1);
+  refined_mesh.init(D - 1, D);
+  const std::size_t orphan = mesh.num_facets() + 1;
+  for (FacetIterator facet(refined_mesh); !facet.end(); ++facet)
+  {
+    // Extract (arbitrary) cell that this facet belongs to
+    Cell cell(refined_mesh, facet->entities(D)[0]);
+
+    // Extract local facet number of this facet with that cell
+    const std::size_t local_facet = cell.index(*facet);
+
+    // Extract local facet index of parent cell (using facet_map)
+    const std::size_t index = cell.index()*(D + 1) + local_facet;
+    const int parent_local_facet_index = facet_map[index];
+
+    // Ignore if orphaned facet
+    if (parent_local_facet_index == -1)
+    {
+      ff[facet->index()] = orphan;
+      continue;
+    }
+
+    // Get parent cell
+    Cell parent_cell(mesh, cf[cell.index()]);
+
+    // Figure out global facet number of local facet number of parent
+    const std::size_t parent_facet_index
+      = parent_cell.entities(D - 1)[parent_local_facet_index];
+
+    // Assign parent facet index to this facet
+    ff[facet->index()] = parent_facet_index;
+  }
+}
+/*
+//-----------------------------------------------------------------------------
+void BisectionRefinement::transform_data(Mesh& newmesh, const Mesh& oldmesh,
+                                         const MeshFunction<std::size_t>& cell_map,
+                                         const std::vector<int>& facet_map)
+{
+  newmesh.data().clear();
+
+  // Rewrite materials
+  if (oldmesh.data().mesh_function("material_indicators"))
+  {
+    std::shared_ptr<MeshFunction<std::size_t> > mat;
+    mat = newmesh.data().create_mesh_function("material_indicators", newmesh.type().dim());
+
+    for(std::size_t i=0; i < newmesh.num_cells(); i++)
+      (*mat)[i] = (*oldmesh.data().mesh_function("material_indicators"))[cell_map[i]];
+
+    log(TRACE, "MeshData MeshFunction \"material_indicators\" transformed.");
+  }
+
+  // Rewrite boundary indicators
+  if (oldmesh.data().array("boundary facet cells")
+        && oldmesh.data().array("boundary facet numbers")
+        && oldmesh.data().array("boundary indicators"))
+  {
+
+    std::size_t num_ent = oldmesh.type().num_entities(0);
+    std::vector<std::size_t>*  bfc = oldmesh.data().array("boundary facet cells");
+    std::vector<std::size_t>*  bfn = oldmesh.data().array("boundary facet numbers");
+    std::vector<std::size_t>*  bi  = oldmesh.data().array("boundary indicators");
+    std::size_t bi_table_size = oldmesh.num_cells()*num_ent;
+    std::vector<int> bi_table;
+    bi_table.resize(bi_table_size);
+
+    for(std::size_t i= 0 ; i< bi_table_size; i++)
+      bi_table[i] = -1;
+
+    for(std::size_t i = 0; i < bi->size(); i++)
+      bi_table[(*bfc)[i]*num_ent+(*bfn)[i]] = (*bi)[i];
+
+    // Empty loop to count elements
+    std::size_t bi_size = 0;
+    for(std::size_t c = 0; c < newmesh.num_cells(); c++)
+    {
+      for(std::size_t f = 0; f < num_ent; f++)
+      {
+        if (facet_map[c*num_ent+f] != -1)
+        {
+          std::size_t table_map = cell_map[c]*num_ent + facet_map[c*num_ent+f];
+          if (bi_table[table_map] != -1)
+            bi_size++;
+        }
+      }
+    }
+
+    // Create new MeshData std::vectors for boundary indicators
+    std::vector<std::size_t>* bfc_new = newmesh.data().create_array("boundary facet cells", bi_size);
+    std::vector<std::size_t>* bfn_new = newmesh.data().create_array("boundary facet numbers", bi_size);
+    std::vector<std::size_t>* bi_new  = newmesh.data().create_array("boundary indicators", bi_size);
+
+    // Main transformation loop
+    std::size_t number_bi = 0;
+    for(std::size_t c = 0; c < newmesh.num_cells(); c++)
+    {
+      for(std::size_t f = 0; f < num_ent; f++)
+      {
+        if (facet_map[c*num_ent+f] != -1)
+        {
+          std::size_t table_map = cell_map[c]*num_ent + facet_map[c*num_ent+f];
+          if (bi_table[table_map] != -1)
+          {
+            (*bfc_new)[number_bi] = c;
+            (*bfn_new)[number_bi] = f;
+            (*bi_new)[number_bi] = bi_table[table_map];
+            number_bi++;
+          }
+        }
+      }
+    }
+    log(TRACE, "MeshData \"boundary indicators\" transformed.");
+  }
+}
+//-----------------------------------------------------------------------------
+*/
diff --git a/dolfin/refinement/BisectionRefinement.h b/dolfin/refinement/BisectionRefinement.h
new file mode 100644
index 0000000..35ff750
--- /dev/null
+++ b/dolfin/refinement/BisectionRefinement.h
@@ -0,0 +1,58 @@
+// Copyright (C) 2006 Johan Hoffman
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2010-2011.
+// Modified by Anders Logg, 2010-2011.
+//
+// First added:  2006-11-01
+// Last changed: 2011-03-12
+
+#ifndef __BISECTION_REFINEMENT_H
+#define __BISECTION_REFINEMENT_H
+
+namespace dolfin
+{
+  // Forward declarations
+  class Mesh;
+  template<typename T> class MeshFunction;
+
+  /// This class implements local mesh refinement by edge bisection.
+
+  class BisectionRefinement
+  {
+  public:
+
+    /// Recursively refine mesh locally by longest edge bisection
+    /// (Rivara). Fast Rivara algorithm implementation with
+    /// propagation of MeshFunctions and arrays for boundary
+    /// indicators.
+    static void refine_by_recursive_bisection(Mesh& refined_mesh,
+                                              const Mesh& mesh,
+                                              const MeshFunction<bool>& cell_marker);
+
+  // private:
+
+    /// Transform mesh data
+    //static void transform_data(Mesh& newmesh, const Mesh& oldmesh,
+    //                           const MeshFunction<std::size_t>& cell_map,
+    //                           const std::vector<int>& facet_map);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/refinement/LocalMeshCoarsening.cpp b/dolfin/refinement/LocalMeshCoarsening.cpp
new file mode 100644
index 0000000..7769a8c
--- /dev/null
+++ b/dolfin/refinement/LocalMeshCoarsening.cpp
@@ -0,0 +1,436 @@
+// Copyright (C) 2006 Johan Hoffman
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2008.
+//
+// First added:  2006-11-01
+// Last changed: 2014-02-06
+
+#include <list>
+
+#include <dolfin/math/dolfin_math.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/mesh/BoundaryMesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/CellType.h>
+#include <dolfin/mesh/Edge.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshConnectivity.h>
+#include <dolfin/mesh/MeshData.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/MeshGeometry.h>
+#include <dolfin/mesh/MeshTopology.h>
+#include <dolfin/mesh/TetrahedronCell.h>
+#include <dolfin/mesh/TriangleCell.h>
+#include <dolfin/mesh/Vertex.h>
+#include "LocalMeshCoarsening.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void LocalMeshCoarsening::coarsen_mesh_by_edge_collapse(Mesh& mesh,
+                                                        MeshFunction<bool>& cell_marker,
+                                                        bool coarsen_boundary)
+{
+  log(TRACE, "Coarsen simplicial mesh by edge collapse.");
+
+  // Get size of old mesh
+  //const std::size_t num_vertices = mesh.size(0);
+  const std::size_t num_cells = mesh.size(mesh.topology().dim());
+
+  // Check cell marker
+  if ( cell_marker.size() != num_cells )
+    dolfin_error("LocalMeshCoarsening.cpp",
+                 "coarsen mesh by collapsing edges",
+                 "Number of cell markers (%d) does not match number of cells (%d)",
+                 cell_marker.size(), num_cells);
+
+  // Generate cell - edge connectivity if not generated
+  mesh.init(mesh.topology().dim(), 1);
+
+  // Generate edge - vertex connectivity if not generated
+  mesh.init(1, 0);
+
+  // Get cell type
+  //const CellType& cell_type = mesh.type();
+
+  // Create new mesh
+  Mesh coarse_mesh(mesh);
+
+  // Initialise forbidden cells
+  MeshFunction<bool> cell_forbidden(mesh);
+  cell_forbidden.init(mesh.topology().dim());
+  for (CellIterator c(mesh); !c.end(); ++c)
+    cell_forbidden[c->index()] = false;
+
+  // Init new vertices and cells
+  std::vector<int> old2new_cell(mesh.num_cells());
+  std::vector<int> old2new_vertex(mesh.num_vertices());
+
+  std::list<int> cells_to_coarsen(0);
+
+  // Compute cells to delete
+  for (CellIterator c(mesh); !c.end(); ++c)
+  {
+    if (cell_marker[*c] == true)
+    {
+      cells_to_coarsen.push_back(c->index());
+      //cout << "coarsen midpoint: " << c->midpoint() << endl;
+    }
+  }
+
+  // Define cell mapping between old and new mesh
+  for (CellIterator c(mesh); !c.end(); ++c)
+  {
+    old2new_cell[c->index()] = c->index();
+  }
+
+  bool improving = true;
+
+  while(improving)
+  {
+
+    std::size_t presize = cells_to_coarsen.size();
+
+    //cout << "presize: " << presize << endl;
+
+    for(std::list<int>::iterator iter = cells_to_coarsen.begin();
+          iter != cells_to_coarsen.end(); iter++)
+    {
+      // Map cells to new mesh
+      if(*iter >= 0)
+        *iter = old2new_cell[*iter];
+    }
+
+    old2new_cell.resize(mesh.num_cells());
+    old2new_vertex.resize(mesh.num_vertices());
+
+    // Coarsen cells in list
+    for(std::list<int>::iterator iter = cells_to_coarsen.begin();
+          iter != cells_to_coarsen.end(); iter++)
+    {
+      bool mesh_ok = false;
+      int cid = *iter;
+      if(cid != -1)
+      {
+        mesh_ok = coarsen_cell(mesh, coarse_mesh, cid,
+			                        old2new_vertex, old2new_cell,
+			                        coarsen_boundary);
+        if(!mesh_ok)
+          warning("Mesh not ok");
+        else
+        {
+          mesh = coarse_mesh;
+          cells_to_coarsen.erase(iter);
+          break;
+        }
+      }
+    }
+
+    if(presize == cells_to_coarsen.size())
+      break;
+  }
+}
+//-----------------------------------------------------------------------------
+void LocalMeshCoarsening::collapse_edge(Mesh& mesh, Edge& edge,
+                                       Vertex& vertex_to_remove,
+                                       MeshFunction<bool>& cell_to_remove,
+                                       std::vector<int>& old2new_vertex,
+                                       std::vector<int>& old2new_cell,
+                                       MeshEditor& editor,
+                                       std::size_t& current_cell)
+{
+  const CellType& cell_type = mesh.type();
+  std::vector<std::size_t> cell_vertices(cell_type.num_entities(0));
+
+  std::size_t vert_slave = vertex_to_remove.index();
+  std::size_t vert_master = 0;
+  const unsigned int* edge_vertex = edge.entities(0);
+
+  if ( edge_vertex[0] == vert_slave )
+    vert_master = edge_vertex[1];
+  else if ( edge_vertex[1] == vert_slave )
+    vert_master = edge_vertex[0];
+  else
+    dolfin_error("LocalMeshCoarsening.cpp",
+                 "collapse edge",
+                 "The node to delete and edge to collapse are not compatible");
+
+  for (CellIterator c(vertex_to_remove); !c.end(); ++c)
+  {
+    if ( cell_to_remove[*c] == false )
+    {
+      std::size_t cv_idx = 0;
+      for (VertexIterator v(*c); !v.end(); ++v)
+      {
+        if ( v->index() == vert_slave )
+          cell_vertices[cv_idx++] = old2new_vertex[vert_master];
+        else
+          cell_vertices[cv_idx++] = old2new_vertex[v->index()];
+      }
+      //cout << "adding new cell" << endl;
+      editor.add_cell(current_cell++, cell_vertices);
+
+      // Update cell map
+      old2new_cell[c->index()] = current_cell - 1;
+    }
+  }
+
+}
+//-----------------------------------------------------------------------------
+bool LocalMeshCoarsening::coarsen_cell(Mesh& mesh, Mesh& coarse_mesh,
+				      int cellid,
+				      std::vector<int>& old2new_vertex,
+				      std::vector<int>& old2new_cell,
+				      bool coarsen_boundary)
+{
+  cout << "coarsen_cell: " << cellid << endl;
+  cout << "num_cells: " << mesh.num_cells() << endl;
+
+  const std::size_t num_vertices = mesh.size(0);
+  const std::size_t num_cells = mesh.size(mesh.topology().dim());
+
+  // Initialise forbidden verticies
+  MeshFunction<bool> vertex_forbidden(mesh);
+  vertex_forbidden.init(0);
+  for (VertexIterator v(mesh); !v.end(); ++v)
+    vertex_forbidden[v->index()] = false;
+
+  // Initialise boundary verticies
+  MeshFunction<bool> vertex_boundary(mesh);
+  vertex_boundary.init(0);
+  for (VertexIterator v(mesh); !v.end(); ++v)
+    vertex_boundary[v->index()] = false;
+
+  BoundaryMesh boundary(mesh, "exterior");
+  MeshFunction<std::size_t>& bnd_vertex_map = boundary.entity_map(0);
+  for (VertexIterator v(boundary); !v.end(); ++v)
+    vertex_boundary[bnd_vertex_map[v->index()]] = true;
+
+  // If coarsen boundary is forbidden
+  if (coarsen_boundary == false)
+  {
+    for (VertexIterator v(boundary); !v.end(); ++v)
+      vertex_forbidden[bnd_vertex_map[v->index()]] = true;
+  }
+
+  // Initialise data for finding which vertex to remove
+  bool _collapse_edge = false;
+  const unsigned int* edge_vertex;
+  std::size_t shortest_edge_index = 0;
+  double lmin, l;
+  std::size_t num_cells_to_remove = 0;
+
+  // Get cell type
+  const CellType& cell_type = mesh.type();
+  const Cell cell(mesh, cellid);
+
+  MeshEditor editor;
+  editor.open(coarse_mesh, cell_type.cell_type(),
+              mesh.topology().dim(), mesh.geometry().dim());
+
+  MeshFunction<bool> cell_to_remove(mesh);
+  cell_to_remove.init(mesh.topology().dim());
+
+  for (CellIterator ci(mesh); !ci.end(); ++ci)
+    cell_to_remove[ci->index()] = false;
+
+  MeshFunction<bool> cell_to_regenerate(mesh);
+  cell_to_regenerate.init(mesh.topology().dim());
+  for (CellIterator ci(mesh); !ci.end(); ++ci)
+    cell_to_regenerate[ci->index()] = false;
+
+  // Find shortest edge of cell c
+  _collapse_edge = false;
+  lmin = 1.0e10*cell.diameter();
+  for (EdgeIterator e(cell); !e.end(); ++e)
+  {
+    edge_vertex = e->entities(0);
+    if (!vertex_forbidden[edge_vertex[0]] || !vertex_forbidden[edge_vertex[1]])
+    {
+      l = e->length();
+      if ( lmin > l )
+      {
+        lmin = l;
+        shortest_edge_index = e->index();
+        _collapse_edge = true;
+      }
+    }
+  }
+
+  Edge shortest_edge(mesh, shortest_edge_index);
+
+  // Decide which vertex to remove
+  std::size_t vert2remove_idx = 0;
+
+  // If at least one vertex should be removed
+  if ( _collapse_edge == true )
+  {
+    edge_vertex = shortest_edge.entities(0);
+
+    if(vertex_forbidden[edge_vertex[0]] &&
+       vertex_forbidden[edge_vertex[1]])
+    {
+      // Both vertices are forbidden, cannot coarsen
+
+      cout << "both vertices forbidden" << endl;
+
+      editor.close();
+      return false;
+    }
+
+    if(vertex_forbidden[edge_vertex[0]] == true)
+      vert2remove_idx = edge_vertex[1];
+    else if(vertex_forbidden[edge_vertex[1]] == true)
+      vert2remove_idx = edge_vertex[0];
+    else if(vertex_boundary[edge_vertex[1]] == true && vertex_boundary[edge_vertex[0]] == false)
+      vert2remove_idx = edge_vertex[0];
+    else if(vertex_boundary[edge_vertex[0]] == true && vertex_boundary[edge_vertex[1]] == false)
+      vert2remove_idx = edge_vertex[1];
+    else if ( edge_vertex[0] > edge_vertex[1] )
+      vert2remove_idx = edge_vertex[0];
+    else
+      vert2remove_idx = edge_vertex[1];
+  }
+  else
+  {
+    // No vertices to remove, cannot coarsen
+    cout << "all vertices forbidden" << endl;
+    editor.close();
+    return false;
+  }
+
+  Vertex vertex_to_remove(mesh, vert2remove_idx);
+
+  // Remove cells around edge
+  num_cells_to_remove = 0;
+  for (CellIterator cn(shortest_edge); !cn.end(); ++cn)
+  {
+    cell_to_remove[cn->index()] = true;
+    num_cells_to_remove++;
+
+    // Update cell map
+    old2new_cell[cn->index()] = -1;
+  }
+
+  // Regenerate cells around vertex
+  for (CellIterator cn(vertex_to_remove); !cn.end(); ++cn)
+  {
+    cell_to_regenerate[cn->index()] = true;
+
+    // Update cell map (will be filled in with correct index)
+    old2new_cell[cn->index()] = -1;
+  }
+
+  // Specify number of vertices and cells
+  editor.init_vertices_global(num_vertices - 1, num_vertices - 1);
+  editor.init_cells_global(num_cells - num_cells_to_remove,
+                           num_cells - num_cells_to_remove);
+
+  cout << "Number of cells in old mesh: " << num_cells << "; to remove: " <<
+    num_cells_to_remove << endl;
+
+  // Add old vertices
+  std::size_t vertex = 0;
+  for(VertexIterator v(mesh); !v.end(); ++v)
+  {
+    if(vertex_to_remove.index() == v->index())
+      old2new_vertex[v->index()] = -1;
+    else
+    {
+      //cout << "adding old vertex at: " << v->point() << endl;
+      old2new_vertex[v->index()] = vertex;
+      editor.add_vertex(vertex, v->point());
+      vertex++;
+    }
+  }
+
+  // Add old unrefined cells
+  std::size_t cv_idx;
+  std::size_t current_cell = 0;
+  std::vector<std::size_t> cell_vertices(cell_type.num_entities(0));
+  for (CellIterator c(mesh); !c.end(); ++c)
+  {
+    if (cell_to_remove[*c] == false && cell_to_regenerate[*c] == false)
+    {
+      cv_idx = 0;
+      for (VertexIterator v(*c); !v.end(); ++v)
+        cell_vertices[cv_idx++] = old2new_vertex[v->index()];
+      //cout << "adding old cell" << endl;
+      editor.add_cell(current_cell++, cell_vertices);
+
+      // Update cell maps
+      old2new_cell[c->index()] = current_cell - 1;
+    }
+  }
+
+  // Add new cells.
+  collapse_edge(mesh, shortest_edge, vertex_to_remove, cell_to_remove,
+                old2new_vertex, old2new_cell, editor, current_cell);
+
+  editor.close();
+
+  // Set volume tolerance. This parameter detemines a quality criterion
+  // for the new mesh: higher value indicates a sharper criterion.
+  double vol_tol = 1.0e-3;
+
+  bool mesh_ok = true;
+
+  Cell removed_cell(mesh, cellid);
+
+  // Check mesh quality (volume)
+  for (CellIterator c(removed_cell); !c.end(); ++c)
+  {
+    std::size_t id = c->index();
+    int nid = old2new_cell[id];
+
+    if(nid != -1)
+    {
+      Cell cn(coarse_mesh, nid);
+      double qm = cn.volume() / cn.diameter();
+      if(qm < vol_tol)
+      {
+        warning("Cell quality too low");
+        cout << "qm: " << qm << endl;
+        mesh_ok = false;
+        return mesh_ok;
+      }
+    }
+  }
+
+  // Checking for inverted cells
+  for (CellIterator c(removed_cell); !c.end(); ++c)
+  {
+    std::size_t id = c->index();
+    int nid = old2new_cell[id];
+
+    if(nid != -1)
+    {
+      Cell cn(coarse_mesh, nid);
+
+      if(c->orientation() != cn.orientation())
+      {
+        cout << "cell orientation inverted" << endl;
+        mesh_ok = false;
+        return mesh_ok;
+      }
+    }
+  }
+  return mesh_ok;
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/LocalMeshCoarsening.h b/dolfin/refinement/LocalMeshCoarsening.h
new file mode 100644
index 0000000..f737b5e
--- /dev/null
+++ b/dolfin/refinement/LocalMeshCoarsening.h
@@ -0,0 +1,71 @@
+// Copyright (C) 2006 Johan Hoffman
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2006-11-01
+
+#ifndef __LOCAL_MESH_COARSENING_H
+#define __LOCAL_MESH_COARSENING_H
+
+#include <vector>
+
+namespace dolfin
+{
+
+  class Mesh;
+  class Edge;
+  class Vertex;
+  class MeshEditor;
+  template <typename T> class MeshFunction;
+
+  /// This class implements local mesh coarsening for different mesh types.
+
+  class LocalMeshCoarsening
+  {
+  public:
+
+    /// Coarsen simplicial mesh locally by edge collapse
+    static void coarsen_mesh_by_edge_collapse(Mesh& mesh,
+                                              MeshFunction<bool>& cell_marker,
+                                              bool coarsen_boundary = false);
+
+  private:
+
+    /// Check that edge collapse is ok
+    static bool coarsen_mesh_ok(Mesh& mesh, std::size_t edge_index, std::size_t* edge_vertex,
+                                MeshFunction<bool>& vertex_forbidden);
+
+    /// Collapse edge by node deletion
+    static void collapse_edge(Mesh& mesh, Edge& edge,
+                              Vertex& vertex_to_remove,
+                              MeshFunction<bool>& cell_to_remove,
+                              std::vector<int>& old2new_vertex,
+                              std::vector<int>& old2new_cell,
+                              MeshEditor& editor,
+                              std::size_t& current_cell);
+
+    /// Coarsen simplicial cell by edge collapse
+    static bool coarsen_cell(Mesh& mesh, Mesh& coarse_mesh,
+                             int cell_id,
+                             std::vector<int>& old2new_vertex,
+                             std::vector<int>& old2new_cell,
+                             bool coarsen_boundary = false);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/refinement/LocalMeshRefinement.cpp b/dolfin/refinement/LocalMeshRefinement.cpp
new file mode 100644
index 0000000..0c0d25b
--- /dev/null
+++ b/dolfin/refinement/LocalMeshRefinement.cpp
@@ -0,0 +1,70 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-02-07
+// Last changed: 2011-11-15
+
+#include <dolfin/parameter/GlobalParameters.h>
+#include <dolfin/log/log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include "BisectionRefinement.h"
+#include "RegularCutRefinement.h"
+#include "LocalMeshRefinement.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void LocalMeshRefinement::refine(Mesh& refined_mesh,
+                                 const Mesh& mesh,
+                                 const MeshFunction<bool>& cell_markers)
+{
+  not_working_in_parallel("LocalMeshRefinement::refine");
+
+  // Count the number of marked cells
+  const std::size_t n0 = mesh.num_cells();
+  std::size_t n = 0;
+  for (std::size_t i = 0; i < cell_markers.size(); i++)
+  {
+    if (cell_markers[i])
+      n++;
+  }
+  info("%d cells out of %d marked for refinement (%.1f%%).",
+       n, n0, 100.0 * static_cast<double>(n) / static_cast<double>(n0));
+
+  // Call refinement algorithm
+  const std::string refinement_algorithm = parameters["refinement_algorithm"];
+  if (refinement_algorithm == "recursive_bisection")
+    BisectionRefinement::refine_by_recursive_bisection(refined_mesh, mesh, cell_markers);
+  else if (refinement_algorithm == "regular_cut")
+    RegularCutRefinement::refine(refined_mesh, mesh, cell_markers);
+  else
+    dolfin_error("LocalMeshRefinement.cpp",
+                 "refine mesh locally",
+                 "Unknown local mesh refinement algorithm: %s. Allowed algorithms are 'recursive_bisection' and 'regular_cut'", refinement_algorithm.c_str());
+
+  // Report the number of refined cells
+  if (refined_mesh.topology().dim() > 0)
+  {
+    const std::size_t n1 = refined_mesh.num_cells();
+    info("Number of cells increased from %d to %d (%.1f%% increase).",
+         n0, n1, 100.0 * (static_cast<double>(n1) / static_cast<double>(n0) - 1.0));
+  }
+  else
+    info("Refined mesh is empty.");
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/LocalMeshRefinement.h b/dolfin/refinement/LocalMeshRefinement.h
new file mode 100644
index 0000000..853ebe3
--- /dev/null
+++ b/dolfin/refinement/LocalMeshRefinement.h
@@ -0,0 +1,49 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-02-07
+// Last changed: 2011-02-07
+
+#ifndef __LOCAL_MESH_REFINEMENT_H
+#define __LOCAL_MESH_REFINEMENT_H
+
+namespace dolfin
+{
+
+  class Mesh;
+  template<typename T> class MeshFunction;
+
+  /// This class is provides functionality for local (adaptive) mesh
+  /// refinement. It is a wrapper for various algorithms for local
+  /// mesh refinement implemented as part of DOLFIN and it delegates
+  /// the refinement to a particular refinement algorithm based on the
+  /// value of the global parameter "refinement_algorithm".
+
+  class LocalMeshRefinement
+  {
+  public:
+
+    /// Refine mesh based on cell markers
+    static void refine(Mesh& refined_mesh,
+                       const Mesh& mesh,
+                       const MeshFunction<bool>& cell_markers);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/refinement/ParallelRefinement.cpp b/dolfin/refinement/ParallelRefinement.cpp
new file mode 100644
index 0000000..9a395cb
--- /dev/null
+++ b/dolfin/refinement/ParallelRefinement.cpp
@@ -0,0 +1,402 @@
+// Copyright (C) 2013 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First Added: 2013-01-02
+// Last Changed: 2013-05-12
+
+#include <map>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <boost/unordered_map.hpp>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/common/types.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/DistributedMeshTools.h>
+#include <dolfin/mesh/Edge.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEntityIterator.h>
+#include <dolfin/mesh/MeshPartitioning.h>
+#include <dolfin/mesh/Vertex.h>
+
+#include "ParallelRefinement.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+ParallelRefinement::ParallelRefinement(const Mesh& mesh) : _mesh(mesh),
+  shared_edges(DistributedMeshTools::compute_shared_entities(_mesh, 1)),
+  marked_edges(mesh.num_edges(), false)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+ParallelRefinement::~ParallelRefinement()
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+bool ParallelRefinement::is_marked(std::size_t edge_index) const
+{
+  dolfin_assert(edge_index < _mesh.num_edges());
+  return marked_edges[edge_index];
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::mark(std::size_t edge_index)
+{
+  dolfin_assert(edge_index < _mesh.num_edges());
+  marked_edges[edge_index] = true;
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::mark_all()
+{
+  marked_edges.assign(_mesh.num_edges(), true);
+}
+//-----------------------------------------------------------------------------
+const std::map<std::size_t, std::size_t>&
+ParallelRefinement::edge_to_new_vertex() const
+{
+  return local_edge_to_new_vertex;
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::mark(const MeshEntity& cell)
+{
+  for (EdgeIterator edge(cell); !edge.end(); ++edge)
+    marked_edges[edge->index()] = true;
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::mark(const MeshFunction<bool>& refinement_marker)
+{
+  for (MeshEntityIterator cell(_mesh, refinement_marker.dim()); !cell.end();
+       ++cell)
+  {
+    if (refinement_marker[*cell])
+    {
+      for (EdgeIterator edge(*cell); !edge.end(); ++edge)
+        marked_edges[edge->index()] = true;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+std::size_t ParallelRefinement::marked_edge_count(const MeshEntity& cell) const
+{
+  std::size_t n_marked = 0;
+  for (EdgeIterator edge(cell); !edge.end(); ++edge)
+  {
+    if (marked_edges[edge->index()])
+      n_marked++;
+  }
+  return n_marked;
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::update_logical_edgefunction()
+{
+  const std::size_t num_processes = MPI::size(_mesh.mpi_comm());
+
+  // Create a list of edges on this process that are 'true' and copy
+  // to remote sharing processes
+  std::vector<std::vector<std::size_t> > values_to_send(num_processes);
+  boost::unordered_map<unsigned int, std::vector<
+    std::pair<unsigned int, unsigned int> > >::iterator sh_edge;
+   for (sh_edge = shared_edges.begin(); sh_edge != shared_edges.end();
+        sh_edge++)
+  {
+    const std::size_t local_index = sh_edge->first;
+    if (marked_edges[local_index] == true)
+    {
+      std::vector<std::pair<unsigned int, unsigned int> >::iterator proc_edge;
+      for (proc_edge = sh_edge->second.begin();
+          proc_edge != sh_edge->second.end(); ++proc_edge)
+      {
+        values_to_send[proc_edge->first].push_back(proc_edge->second);
+      }
+    }
+  }
+
+  std::vector<std::vector<std::size_t> > received_values;
+  MPI::all_to_all(_mesh.mpi_comm(), values_to_send, received_values);
+
+  // Flatten received values and set EdgeFunction true at each index
+  // received
+  std::vector<std::vector<std::size_t> >::iterator r;
+  for (r = received_values.begin(); r != received_values.end(); ++r)
+  {
+    for (std::vector<std::size_t>::iterator local_index = r->begin();
+         local_index != r->end(); ++local_index)
+    {
+      marked_edges[*local_index] = true;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::create_new_vertices()
+{
+  // Take marked_edges and use to create new vertices
+
+  const std::size_t num_processes = MPI::size(_mesh.mpi_comm());
+  const std::size_t process_number = MPI::rank(_mesh.mpi_comm());
+
+  // Tally up unshared marked edges, and shared marked edges which are
+  // owned on this process.  Index them sequentially from zero.
+  const std::size_t gdim = _mesh.geometry().dim();
+  std::size_t n = 0;
+  for (std::size_t local_i = 0 ; local_i < _mesh.num_edges(); ++local_i)
+  {
+    if (marked_edges[local_i] == true)
+    {
+      // Assume this edge is owned locally
+      bool owner = true;
+
+      // If shared, check that this is true
+      if (shared_edges.count(local_i) != 0)
+      {
+        // check if any other sharing process has a lower rank
+        std::vector<std::pair<unsigned int, unsigned int> >::iterator proc_edge;
+        for (proc_edge = shared_edges.find(local_i)->second.begin();
+              proc_edge != shared_edges.find(local_i)->second.end();
+             ++proc_edge)
+        {
+          if (proc_edge->first < process_number)
+            owner = false;
+        }
+      }
+
+      // If it is still believed to be owned on this process, add to
+      // list
+      if (owner)
+      {
+        const Point& midpoint = Edge(_mesh, local_i).midpoint();
+        for (std::size_t j = 0; j < gdim; ++j)
+          new_vertex_coordinates.push_back(midpoint[j]);
+
+        local_edge_to_new_vertex[local_i] = n++;
+      }
+    }
+
+  }
+
+  // Calculate global range for new local vertices
+  const std::size_t num_new_vertices = n;
+  const std::size_t global_offset
+    = MPI::global_offset(_mesh.mpi_comm(), num_new_vertices, true)
+    + _mesh.size_global(0);
+
+  // If they are shared, then the new global vertex index needs to be
+  // sent off-process.  Add offset to map, and collect up any shared
+  // new vertices that need to send the new index off-process
+  std::vector<std::vector<std::size_t> > values_to_send(num_processes);
+  for (std::map<std::size_t, std::size_t>::iterator
+       local_edge = local_edge_to_new_vertex.begin();
+       local_edge != local_edge_to_new_vertex.end(); ++local_edge)
+  {
+    // Add global_offset to map, to get new global index of new
+    // vertices
+    local_edge->second += global_offset;
+
+    const std::size_t local_i = local_edge->first;
+    //shared, but locally owned : remote owned are not in list.
+    if (shared_edges.count(local_i) != 0)
+    {
+      std::vector<std::pair<unsigned int, unsigned int> >::iterator
+        remote_process_edge;
+      for (remote_process_edge = shared_edges[local_i].begin();
+          remote_process_edge != shared_edges[local_i].end();
+          ++remote_process_edge)
+      {
+        const std::size_t remote_proc_num = remote_process_edge->first;
+        // send mapping from remote local edge index to new global vertex index
+        values_to_send[remote_proc_num].push_back(remote_process_edge->second);
+        values_to_send[remote_proc_num].push_back(local_edge->second);
+      }
+    }
+  }
+
+  // send new vertex indices to remote processes and receive
+  std::vector<std::vector<std::size_t> > received_values(num_processes);
+  MPI::all_to_all(_mesh.mpi_comm(), values_to_send, received_values);
+
+  // Flatten and add received remote global vertex indices to map
+  std::vector<std::vector<std::pair<std::size_t, std::size_t> > >::iterator p;
+  for (std::size_t p = 0; p < received_values.size(); ++p)
+  {
+    const std::vector<std::size_t>& q = received_values[p];
+    for (std::size_t i = 0; i < q.size(); i += 2)
+      local_edge_to_new_vertex[q[i]] = q[i + 1];
+  }
+
+  // Now add new vertex coordinates to existing, and index using new
+  // global indexing.  Reorder so that MeshPartitioning.cpp can find
+  // them. After that, we are done with coordinates, and just need to
+  // rebuild the topology.
+  new_vertex_coordinates.insert(new_vertex_coordinates.begin(),
+                                _mesh.coordinates().begin(),
+                                _mesh.coordinates().end());
+
+  std::vector<std::size_t> global_indices(_mesh.topology().global_indices(0));
+  for (std::size_t i = 0; i < num_new_vertices; i++)
+    global_indices.push_back(i + global_offset);
+
+  reorder_vertices_by_global_indices(new_vertex_coordinates,
+                                     _mesh.geometry().dim(), global_indices);
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::reorder_vertices_by_global_indices(std::vector<double>& vertex_coords,
+                                 const std::size_t gdim,
+                                 const std::vector<std::size_t>& global_indices)
+{
+  // This is needed to interface with MeshPartitioning/LocalMeshData,
+  // which expects the vertices in global order.  This is inefficient,
+  // and needs to be addressed in MeshPartitioning.cpp where they are
+  // redistributed again.
+
+  Timer t("Parallel Refine: reorder vertices");
+  // FIXME: be more efficient with MPI
+
+  dolfin_assert(gdim*global_indices.size() == vertex_coords.size());
+
+  boost::multi_array_ref<double, 2> vertex_array(vertex_coords.data(),
+                      boost::extents[vertex_coords.size()/gdim][gdim]);
+
+  // Calculate size of overall global vector by finding max index value
+  // anywhere
+  const std::size_t global_vector_size
+    = MPI::max(_mesh.mpi_comm(), *std::max_element(global_indices.begin(),
+                                                   global_indices.end())) + 1;
+
+  // Send unwanted values off process
+  const std::size_t num_processes = MPI::size(_mesh.mpi_comm());
+  std::vector<std::vector<std::size_t> > values_to_send0(num_processes);
+  std::vector<std::vector<double> > values_to_send1(num_processes);
+
+  // Go through local vector and append value to the appropriate list
+  // to send to correct process
+  for (std::size_t i = 0; i < vertex_array.shape()[0] ; ++i)
+  {
+    const std::size_t global_i = global_indices[i];
+    const std::size_t process_i
+      = MPI::index_owner(_mesh.mpi_comm(), global_i, global_vector_size);
+    values_to_send0[process_i].push_back(global_i);
+    values_to_send0[process_i].push_back(vertex_array[i].shape()[0]);
+    values_to_send0[process_i].push_back(values_to_send1[process_i].size());
+    values_to_send1[process_i].insert(values_to_send1[process_i].end(),
+                                      vertex_array[i].begin(),
+                                      vertex_array[i].end());
+  }
+
+  // Redistribute the values to the appropriate process - including
+  // self All values are "in the air" at this point, so local vector
+  // can be cleared
+  std::vector<std::vector<std::size_t> > received_values0;
+  std::vector<std::vector<double> > received_values1;
+  MPI::all_to_all(_mesh.mpi_comm(), values_to_send0, received_values0);
+  MPI::all_to_all(_mesh.mpi_comm(), values_to_send1, received_values1);
+
+  // When receiving, just go through all received values and place
+  // them in the local partition of the global vector.
+  const std::pair<std::size_t, std::size_t> range
+    = MPI::local_range(_mesh.mpi_comm(), global_vector_size);
+  vertex_coords.resize((range.second - range.first)*gdim);
+  boost::multi_array_ref<double, 2>
+    new_vertex_array(vertex_coords.data(),
+                     boost::extents[range.second - range.first][gdim]);
+  for (std::size_t p = 0; p < received_values0.size(); ++p)
+  {
+    const std::vector<std::size_t>& received_global_data0 = received_values0[p];
+    const std::vector<double>& received_global_data1 = received_values1[p];
+    for (std::size_t j = 0; j < received_global_data0.size(); j += 3)
+    {
+      const std::size_t global_i = received_global_data0[j];
+      const std::size_t num_vals = received_global_data0[j + 1];
+      const std::size_t offset = received_global_data0[j + 2];
+      dolfin_assert(global_i >= range.first && global_i < range.second);
+      std::copy(received_global_data1.begin() + offset,
+                received_global_data1.begin() + offset + num_vals,
+                new_vertex_array[global_i - range.first].begin());
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::partition(Mesh& new_mesh, bool redistribute) const
+{
+  LocalMeshData mesh_data(new_mesh.mpi_comm());
+  mesh_data.tdim = _mesh.topology().dim();
+  const std::size_t gdim = _mesh.geometry().dim();
+  mesh_data.gdim = gdim;
+  mesh_data.num_vertices_per_cell = mesh_data.tdim + 1;
+
+  // Copy data to LocalMeshData structures
+  const std::size_t num_local_cells
+    = new_cell_topology.size()/mesh_data.num_vertices_per_cell;
+  mesh_data.num_global_cells = MPI::sum(_mesh.mpi_comm(), num_local_cells);
+  mesh_data.global_cell_indices.resize(num_local_cells);
+  const std::size_t idx_global_offset
+    = MPI::global_offset(_mesh.mpi_comm(), num_local_cells, true);
+  for (std::size_t i = 0; i < num_local_cells ; i++)
+    mesh_data.global_cell_indices[i] = idx_global_offset + i;
+
+  mesh_data.cell_vertices.resize(boost::extents[num_local_cells][mesh_data.num_vertices_per_cell]);
+  std::copy(new_cell_topology.begin(), new_cell_topology.end(),
+            mesh_data.cell_vertices.data());
+
+  const std::size_t num_local_vertices = new_vertex_coordinates.size()/gdim;
+  mesh_data.num_global_vertices = MPI::sum(_mesh.mpi_comm(),
+                                           num_local_vertices);
+  mesh_data.vertex_coordinates.resize(boost::extents[num_local_vertices][gdim]);
+  std::copy(new_vertex_coordinates.begin(), new_vertex_coordinates.end(),
+            mesh_data.vertex_coordinates.data());
+
+  mesh_data.vertex_indices.resize(num_local_vertices);
+  const std::size_t vertex_global_offset
+    = MPI::global_offset(_mesh.mpi_comm(), num_local_vertices, true);
+  for (std::size_t i = 0; i < num_local_vertices ; i++)
+    mesh_data.vertex_indices[i] = vertex_global_offset + i;
+
+  if (!redistribute)
+  {
+    // Set owning process rank to this process rank
+    mesh_data.cell_partition.assign(mesh_data.global_cell_indices.size(),
+                                    MPI::rank(_mesh.mpi_comm()));
+  }
+
+  MeshPartitioning::build_distributed_mesh(new_mesh, mesh_data);
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::new_cell(const Cell& cell)
+{
+  for (VertexIterator v(cell); !v.end(); ++v)
+    new_cell_topology.push_back(v->global_index());
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::new_cell(const std::size_t i0, const std::size_t i1,
+                                  const std::size_t i2, const std::size_t i3)
+{
+  new_cell_topology.push_back(i0);
+  new_cell_topology.push_back(i1);
+  new_cell_topology.push_back(i2);
+  new_cell_topology.push_back(i3);
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement::new_cell(const std::size_t i0, const std::size_t i1,
+                                  const std::size_t i2)
+{
+  new_cell_topology.push_back(i0);
+  new_cell_topology.push_back(i1);
+  new_cell_topology.push_back(i2);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/ParallelRefinement.h b/dolfin/refinement/ParallelRefinement.h
new file mode 100644
index 0000000..669f716
--- /dev/null
+++ b/dolfin/refinement/ParallelRefinement.h
@@ -0,0 +1,114 @@
+// Copyright (C) 2012 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First Added: 2013-01-02
+// Last Changed: 2013-01-17
+
+#include <vector>
+#include <boost/unordered_map.hpp>
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  template<typename T> class EdgeFunction;
+  template<typename T> class MeshFunction;
+
+  class ParallelRefinement
+  {
+  public:
+
+    /// Create any useful parallel data about the mesh (e.g. shared
+    /// edges) and store
+    ParallelRefinement(const Mesh& mesh);
+
+    /// Destructor
+    ~ParallelRefinement();
+
+    /// Return marked status of edge
+    bool is_marked(std::size_t edge_index) const;
+
+    /// Mark edge by index
+    void mark(std::size_t edge_index);
+
+    /// Mark all edges in mesh
+    void mark_all();
+
+    /// Mark all edges incident on entities indicated by refinement
+    /// marker
+    void mark(const MeshFunction<bool>& refinement_marker);
+
+    /// Mark all incident edges of an entity
+    void mark(const MeshEntity& cell);
+
+    /// Return number of marked edges incident on this MeshEntity -
+    /// usually a cell
+    std::size_t marked_edge_count(const MeshEntity& cell) const;
+
+    /// Transfer marked edges between processes
+    void update_logical_edgefunction();
+
+    /// Add new vertex for each marked edge, and create
+    /// new_vertex_coordinates and global_edge->new_vertex mapping.
+    /// Communicate new vertices with MPI to all affected processes.
+    void create_new_vertices();
+
+    /// Mapping of old edge (to be removed) to new global vertex
+    /// number. Useful for forming new topology
+    const std::map<std::size_t, std::size_t>& edge_to_new_vertex() const;
+
+    /// Add a new cell to the list in 3D or 2D
+    void new_cell(const Cell& cell);
+    void new_cell(std::size_t i0, std::size_t i1, std::size_t i2,
+                  std::size_t i3);
+    void new_cell(std::size_t i0, std::size_t i1, std::size_t i2);
+
+    /// Use vertex and topology data to partition new mesh
+    void partition(Mesh& new_mesh, bool redistribute) const;
+
+  private:
+
+    // Mesh reference
+    const Mesh& _mesh;
+
+    // Shared edges between processes. In 2D, vector size is 1
+    boost::unordered_map<unsigned int, std::vector<std::pair<unsigned int,
+      unsigned int> > > shared_edges;
+
+    // Mapping from old local edge index to new global vertex, needed
+    // to create new topology
+    std::map<std::size_t, std::size_t> local_edge_to_new_vertex;
+
+    // New storage for all coordinates when creating new vertices
+    std::vector<double> new_vertex_coordinates;
+
+    // New storage for all cells when creating new topology
+    std::vector<std::size_t> new_cell_topology;
+
+    // Management of marked edges
+    std::vector<bool> marked_edges;
+
+    // Reorder vertices into global order for partitioning
+    void reorder_vertices_by_global_indices(std::vector<double>& vertex_coords,
+                           const std::size_t gdim,
+                           const std::vector<std::size_t>& global_indices);
+
+  };
+
+}
diff --git a/dolfin/refinement/ParallelRefinement2D.cpp b/dolfin/refinement/ParallelRefinement2D.cpp
new file mode 100644
index 0000000..cbf4cfb
--- /dev/null
+++ b/dolfin/refinement/ParallelRefinement2D.cpp
@@ -0,0 +1,302 @@
+// Copyright (C) 2012 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First Added: 2012-12-19
+// Last Changed: 2013-05-12
+
+#include <vector>
+#include <map>
+#include <boost/unordered_map.hpp>
+#include <boost/multi_array.hpp>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Edge.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/refinement/ParallelRefinement.h>
+#include "ParallelRefinement2D.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+bool ParallelRefinement2D::length_compare(std::pair<double, std::size_t> a,
+                                          std::pair<double, std::size_t> b)
+{
+  return (a.first > b.first);
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement2D::generate_reference_edges(const Mesh& mesh,
+                                          std::vector<std::size_t>& ref_edge)
+{
+  std::size_t D = mesh.topology().dim();
+  ref_edge.resize(mesh.size(D));
+
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    std::size_t cell_index = cell->index();
+
+    std::vector<std::pair<double, std::size_t> > lengths;
+    EdgeIterator celledge(*cell);
+    for (std::size_t i = 0; i < 3; i++)
+      lengths.push_back(std::make_pair(celledge[i].length(), i));
+    std::sort(lengths.begin(), lengths.end(), length_compare);
+
+    // For now - just pick longest edge - this is not the Carstensen
+    // algorithm, which tries to pair edges off. Because that is more
+    // difficult in parallel, it is not implemented yet.
+    const std::size_t edge_index = lengths[0].second;
+    ref_edge[cell_index] = edge_index;
+  }
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement2D::refine(Mesh& new_mesh, const Mesh& mesh,
+                                  bool redistribute)
+{
+  if (MPI::size(mesh.mpi_comm()) == 1)
+  {
+    dolfin_error("ParallelRefinement2D.cpp",
+                 "refine mesh",
+                 "Only works in parallel");
+  }
+
+  const std::size_t tdim = mesh.topology().dim();
+  if (tdim != 2)
+  {
+    dolfin_error("ParallelRefinement2D.cpp",
+                 "refine mesh",
+                 "Only works in 2D");
+  }
+
+  // Ensure connectivity is there
+  mesh.init(tdim - 1, tdim);
+
+  // Create an object to hold most of the refinement information
+  ParallelRefinement p(mesh);
+
+  // Mark all edges, and create new vertices
+  p.mark_all();
+  p.create_new_vertices();
+  const std::map<std::size_t, std::size_t>& edge_to_new_vertex
+    = p.edge_to_new_vertex();
+
+  // Convenienence iterator
+  std::map<std::size_t, std::size_t>::const_iterator it;
+
+  // Generate new topology
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    EdgeIterator e(*cell);
+    VertexIterator v(*cell);
+
+    const std::size_t v0 = v[0].global_index();
+    const std::size_t v1 = v[1].global_index();
+    const std::size_t v2 = v[2].global_index();
+
+    it = edge_to_new_vertex.find(e[0].index());
+    dolfin_assert(it != edge_to_new_vertex.end());
+    const std::size_t e0 = it->second;
+
+    it = edge_to_new_vertex.find(e[1].index());
+    dolfin_assert(it != edge_to_new_vertex.end());
+    const std::size_t e1 = it->second;
+
+    it = edge_to_new_vertex.find(e[2].index());
+    dolfin_assert(it != edge_to_new_vertex.end());
+    const std::size_t e2 = it->second;
+
+    //const std::size_t e0 = edge_to_new_vertex[e[0].index()];
+    //const std::size_t e1 = edge_to_new_vertex[e[1].index()];
+    //const std::size_t e2 = edge_to_new_vertex[e[2].index()];
+
+    p.new_cell(v0, e2, e1);
+    p.new_cell(e2, v1, e0);
+    p.new_cell(e1, e0, v2);
+    p.new_cell(e0, e1, e2);
+  }
+
+  p.partition(new_mesh, redistribute);
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement2D::refine(Mesh& new_mesh, const Mesh& mesh,
+                                  const MeshFunction<bool>& refinement_marker,
+                                  bool redistribute)
+{
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  if (MPI::size(mpi_comm) == 1)
+  {
+    dolfin_error("ParallelRefinement2D.cpp",
+                 "refine mesh",
+                 "Only works in parallel");
+  }
+
+  const std::size_t tdim = mesh.topology().dim();
+  if (tdim != 2)
+  {
+    // Note: gdim may be 3
+    dolfin_error("ParallelRefinement2D.cpp",
+                 "refine mesh",
+                 "Only works in 2D");
+  }
+
+  // Ensure connectivity is there
+  mesh.init(tdim - 1, tdim);
+
+  // Create a class to hold most of the refinement information
+  ParallelRefinement p(mesh);
+
+  // This refinement algorithm creates a 'reference' edge for each
+  // cell.  In this case, the reference edge is the longest edge.  Any
+  // cell with edges marked for bisection, must also bisect the
+  // reference edge.
+
+  // Vector over all cells - the reference edge is the cell's edge (0,
+  // 1 or 2) which always must split, if any edge splits in the cell
+  std::vector<std::size_t> ref_edge;
+  generate_reference_edges(mesh, ref_edge);
+
+  // Set marked edges from marked cells
+  p.mark(refinement_marker);
+
+  // Mark reference edges of cells with any marked edge
+  // and repeat until no more marking takes place
+
+  std::size_t update_count = 1;
+
+  while (update_count != 0)
+  {
+    update_count = 0;
+
+    // Transmit values between processes - could be streamlined
+    p.update_logical_edgefunction();
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      std::size_t n_marked = p.marked_edge_count(*cell);
+      EdgeIterator edge(*cell);
+      std::size_t ref_edge_index = edge[ref_edge[cell->index()]].index();
+      if (n_marked != 0 && p.is_marked(ref_edge_index) == false)
+      {
+        p.mark(ref_edge_index);
+        update_count++;
+      }
+    }
+    update_count = MPI::sum(mpi_comm, update_count);
+  }
+
+  // Generate new vertices from marked edges, and assign global vertex
+  // index map.
+  p.create_new_vertices();
+  const std::map<std::size_t, std::size_t>& edge_to_new_vertex
+    = p.edge_to_new_vertex();
+
+  // Convenienence iterator
+  std::map<std::size_t, std::size_t>::const_iterator it;
+
+  // Stage 4 - do refinement
+  // FIXME - keep reference edges somehow?...
+
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    std::size_t rgb_count = p.marked_edge_count(*cell);
+    EdgeIterator e(*cell);
+    VertexIterator v(*cell);
+    const std::size_t ref = ref_edge[cell->index()];
+    const std::size_t i0 = ref;
+    const std::size_t i1 = (ref + 1)%3;
+    const std::size_t i2 = (ref + 2)%3;
+    const std::size_t v0 = v[i0].global_index();
+    const std::size_t v1 = v[i1].global_index();
+    const std::size_t v2 = v[i2].global_index();
+
+    //const std::size_t e0 = edge_to_new_vertex[e[i0].index()];
+    //const std::size_t e1 = edge_to_new_vertex[e[i1].index()];
+    //const std::size_t e2 = edge_to_new_vertex[e[i2].index()];
+
+    if (rgb_count == 0) //straight copy of cell (1->1)
+      p.new_cell(*cell);
+    else if (rgb_count == 1) // "green" refinement (1->2)
+    {
+      // Always splitting the reference edge (only)
+      it = edge_to_new_vertex.find(e[i0].index());
+      dolfin_assert(it != edge_to_new_vertex.end());
+      const std::size_t e0 = it->second;
+
+      p.new_cell(e0, v0, v1);
+      p.new_cell(e0, v2, v0);
+    }
+    else if (rgb_count == 2) // "blue" refinement (1->3) left or right
+    {
+      // FIXME: more possibilities here - need to do more tests
+      if (p.is_marked(e[i2].index()))
+      {
+        it = edge_to_new_vertex.find(e[i0].index());
+        dolfin_assert(it != edge_to_new_vertex.end());
+        const std::size_t e0 = it->second;
+
+        it = edge_to_new_vertex.find(e[i2].index());
+        dolfin_assert(it != edge_to_new_vertex.end());
+        const std::size_t e2 = it->second;
+
+        p.new_cell(e2, v1, e0);
+        p.new_cell(e2, e0, v0);
+        p.new_cell(e0, v2, v0);
+      }
+      else if (p.is_marked(e[i1].index()))
+      {
+        it = edge_to_new_vertex.find(e[i0].index());
+        dolfin_assert(it != edge_to_new_vertex.end());
+        const std::size_t e0 = it->second;
+
+        it = edge_to_new_vertex.find(e[i1].index());
+        dolfin_assert(it != edge_to_new_vertex.end());
+        const std::size_t e1 = it->second;
+
+        p.new_cell(e0, v0, v1);
+        p.new_cell(e1, e0, v2);
+        p.new_cell(e1, v0, e0);
+      }
+    }
+    else if (rgb_count == 3) // "red" refinement - all split (1->4) cells
+    {
+      it = edge_to_new_vertex.find(e[i0].index());
+      dolfin_assert(it != edge_to_new_vertex.end());
+      const std::size_t e0 = it->second;
+
+      it = edge_to_new_vertex.find(e[i1].index());
+      dolfin_assert(it != edge_to_new_vertex.end());
+      const std::size_t e1 = it->second;
+
+      it = edge_to_new_vertex.find(e[i2].index());
+      dolfin_assert(it != edge_to_new_vertex.end());
+      const std::size_t e2 = it->second;
+
+      p.new_cell(v0, e2, e1);
+      p.new_cell(e2, v1, e0);
+      p.new_cell(e1, e0, v2);
+      p.new_cell(e0, e1, e2);
+    }
+  }
+
+  // Call partitioning from within ParallelRefinement class
+  p.partition(new_mesh, redistribute);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/ParallelRefinement2D.h b/dolfin/refinement/ParallelRefinement2D.h
new file mode 100644
index 0000000..21b46d9
--- /dev/null
+++ b/dolfin/refinement/ParallelRefinement2D.h
@@ -0,0 +1,51 @@
+// Copyright (C) 2012 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First Added: 2012-12-19
+// Last Changed: 2013-01-03
+
+namespace dolfin
+{
+  class Mesh;
+
+  class ParallelRefinement2D
+  {
+  public:
+
+    /// Refine with marker
+    static void refine(Mesh& new_mesh, const Mesh& mesh,
+                       const MeshFunction<bool>& refinement_marker,
+                       bool redistribute);
+
+    /// Uniform refine
+    static void refine(Mesh& new_mesh, const Mesh& mesh,
+                       bool redistribute);
+  private:
+
+    /// Used to find longest edge of a cell, when working out reference edges
+    static bool length_compare(std::pair<double, std::size_t> a,
+                               std::pair<double, std::size_t> b);
+
+    ///  Calculate which edges should be 'reference' edges for the RGB
+    /// Carstensen type triangulation
+    static void generate_reference_edges(const Mesh& mesh,
+                                         std::vector<std::size_t>& ref_edge);
+
+  };
+
+}
diff --git a/dolfin/refinement/ParallelRefinement3D.cpp b/dolfin/refinement/ParallelRefinement3D.cpp
new file mode 100644
index 0000000..f6fce60
--- /dev/null
+++ b/dolfin/refinement/ParallelRefinement3D.cpp
@@ -0,0 +1,424 @@
+// Copyright (C) 2012 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First Added: 2012-12-19
+// Last Changed: 2013-01-23
+
+#include <vector>
+#include <map>
+#include <boost/unordered_map.hpp>
+#include <boost/multi_array.hpp>
+
+#include <dolfin/common/types.h>
+#include <dolfin/common/MPI.h>
+#include <dolfin/common/Timer.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Edge.h>
+#include <dolfin/mesh/Face.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/LocalMeshData.h>
+
+#include <dolfin/refinement/ParallelRefinement.h>
+
+#include "ParallelRefinement3D.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void ParallelRefinement3D::refine(Mesh& new_mesh, const Mesh& mesh,
+                                  bool redistribute)
+{
+  Timer t0("Parallel-refine 3D");
+
+  if (MPI::size(mesh.mpi_comm())==1)
+  {
+    dolfin_error("ParallelRefinement3D.cpp",
+                 "refine mesh",
+                 "Only works in parallel");
+  }
+
+  const std::size_t tdim = mesh.topology().dim();
+  const std::size_t gdim = mesh.geometry().dim();
+
+  if (tdim != 3 || gdim != 3)
+  {
+    dolfin_error("ParallelRefinement3D.cpp",
+                 "refine mesh",
+                 "Only works in 3D");
+  }
+
+  // Ensure connectivity is there etc
+  mesh.init(1);
+  mesh.init(1, tdim);
+
+  // Instantiate a class to hold most of the refinement information
+  ParallelRefinement p(mesh);
+
+  // Mark all edges, and create new vertices
+  p.mark_all();
+  p.create_new_vertices();
+
+  // Generate new topology
+
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+    eightfold_division(*cell, p);
+
+  t0.stop();
+  p.partition(new_mesh, redistribute);
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement3D::refine(Mesh& new_mesh, const Mesh& mesh,
+                                  const MeshFunction<bool>& refinement_marker,
+                                  bool redistribute)
+{
+  // Topological dimension
+  const std::size_t tdim = mesh.topology().dim();
+
+
+  // MPI communicator
+  const MPI_Comm mpi_comm = mesh.mpi_comm();
+
+  warning("ParallelRefinement3D does not take care of mesh quality.\n Multiple levels of refinement may generate bad quality tetrahedra.");
+
+  // Ensure connectivity from cells to edges
+  mesh.init(1);
+  mesh.init(1, tdim);
+
+  ParallelRefinement p(mesh);
+
+  // Mark all edges of marked cells
+  p.mark(refinement_marker);
+
+  std::size_t update_count = 1;
+
+  // Ensure consistent rules are applied to all cells
+  // 1. The number of marked edges can be 0, 1, 2, 3 or 6
+  //
+  // 2. If three edges are marked, they must be on the same face,
+  // otherwise mark all edges of the cell.
+  //
+  // 3. Iterate until no more edges need to be marked
+
+  while (update_count != 0)
+  {
+    update_count = 0;
+
+    // Transmit shared marked edges
+    p.update_logical_edgefunction();
+
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const std::size_t n_marked = p.marked_edge_count(*cell);
+
+      // If more than 3 edges are already marked, mark all edges
+      if (n_marked == 4 || n_marked == 5)
+      {
+        p.mark(*cell);
+        ++update_count;
+      }
+
+      // With 3 marked edges, they must be all on the same face,
+      // otherwise, mark all edges
+      if (n_marked == 3)
+      {
+        std::size_t nmax = 0;
+        for (FaceIterator face(*cell); !face.end(); ++face)
+        {
+          const std::size_t n_face = p.marked_edge_count(*face);
+          nmax = (n_face > nmax) ? n_face : nmax;
+        }
+        if (nmax != 3)
+        {
+          p.mark(*cell);
+          ++update_count;
+        }
+      }
+    }
+    update_count = MPI::sum(mpi_comm, update_count);
+  }
+
+  // All cells now have either 0, 1, 2, 3* or 6 edges marked.
+  // * (3 are all on the same face)
+
+  // Create new vertices
+  p.create_new_vertices();
+  const std::map<std::size_t, std::size_t>& edge_to_new_vertex
+    = p.edge_to_new_vertex();
+
+  // Convenience iterator
+  std::map<std::size_t, std::size_t>::const_iterator it;
+
+  // Create new topology
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    VertexIterator v(*cell);
+    EdgeIterator e(*cell);
+
+    std::vector<std::size_t> marked_edges;
+    for (std::size_t j = 0 ; j < 6 ; ++j)
+    {
+      if (p.is_marked(e[j].index()))
+        marked_edges.push_back(j);
+    }
+
+    if (marked_edges.size() == 0) //straight copy of cell (1->1)
+      p.new_cell(*cell);
+    else if (marked_edges.size() == 1) // "green" refinement (bisection)
+    {
+      const std::size_t new_edge = marked_edges[0];
+
+      it = edge_to_new_vertex.find(e[new_edge].index());
+      dolfin_assert(it !=  edge_to_new_vertex.end());
+      const std::size_t v_new = it->second;
+
+      VertexIterator vn(e[new_edge]);
+      const std::size_t v_near_0 = vn[0].global_index();
+      const std::size_t v_near_1 = vn[1].global_index();
+
+      // opposite edges always add up to 5
+      const std::size_t opp_edge = 5 - new_edge;
+      VertexIterator vf(e[opp_edge]);
+      const std::size_t v_far_0 = vf[0].global_index();
+      const std::size_t v_far_1 = vf[1].global_index();
+
+      p.new_cell(v_far_0, v_far_1, v_new, v_near_0);
+      p.new_cell(v_far_0, v_far_1, v_new, v_near_1);
+    }
+    else if (marked_edges.size() == 2)
+    {
+      const std::size_t new_edge_0 = marked_edges[0];
+      const std::size_t new_edge_1 = marked_edges[1];
+
+      it = edge_to_new_vertex.find(e[new_edge_0].index());
+      dolfin_assert(it !=  edge_to_new_vertex.end());
+      const std::size_t e0 = it->second;
+
+      it = edge_to_new_vertex.find(e[new_edge_1].index());
+      dolfin_assert(it !=  edge_to_new_vertex.end());
+      const std::size_t e1 = it->second;
+
+      // Opposite edges add up to 5
+      // This is effectively a double bisection
+      if ( (new_edge_0 + new_edge_1) == 5)
+      {
+        VertexIterator v0(e[new_edge_0]);
+        VertexIterator v1(e[new_edge_1]);
+        const std::size_t e0v0 = v0[0].global_index();
+        const std::size_t e0v1 = v0[1].global_index();
+        const std::size_t e1v0 = v1[0].global_index();
+        const std::size_t e1v1 = v1[1].global_index();
+
+        p.new_cell(e0, e1, e0v0, e1v0);
+        p.new_cell(e0, e1, e0v1, e1v0);
+        p.new_cell(e0, e1, e0v0, e1v1);
+        p.new_cell(e0, e1, e0v1, e1v1);
+      }
+      else
+      {
+        // Both edges on same face. In this case, there is a choice of
+        // how to divide the face with two splitting edges. In order
+        // to be consistent across the mesh, always cut on the
+        // shortest distance in the bottom trapezoid. If distances
+        // measure as equal, use the global index to decide.
+
+        const std::vector<std::size_t> com_v
+          = common_vertices(*cell, new_edge_0, new_edge_1);
+
+        const std::size_t v_far = Vertex(mesh, com_v[0]).global_index();
+        const std::size_t v_leg_0 = Vertex(mesh, com_v[1]).global_index();
+        const std::size_t v_leg_1 = Vertex(mesh, com_v[2]).global_index();
+        const std::size_t v_common = Vertex(mesh, com_v[3]).global_index();
+
+        // Find distance across trapezoid
+        const Point p_leg_0 = Vertex(mesh, com_v[1]).point();
+        const Point p_leg_1 = Vertex(mesh, com_v[2]).point();
+        const double d0 = p_leg_0.distance(e[new_edge_1].midpoint());
+        const double d1 = p_leg_1.distance(e[new_edge_0].midpoint());
+
+        // Add 'top cell' always the same
+        p.new_cell(v_far, v_common, e0, e1);
+
+        // Choose bottom cell consistently
+        if (d0 > d1 || (d0 == d1 && v_leg_0 > v_leg_1))
+        {
+          p.new_cell(v_far, e0, e1, v_leg_1);
+          p.new_cell(v_far, e0, v_leg_0, v_leg_1);
+        }
+        else
+        {
+          p.new_cell(v_far, e1, e0, v_leg_0);
+          p.new_cell(v_far, e1, v_leg_1, v_leg_0);
+        }
+      }
+    }
+    else if (marked_edges.size() == 3) // refinement of one face into 4 triangles
+    {
+      // Assumes edges are on one face - will break otherwise
+
+      it = edge_to_new_vertex.find(e[marked_edges[0]].index());
+      dolfin_assert(it !=  edge_to_new_vertex.end());
+      const std::size_t e0 = it->second;
+
+      it = edge_to_new_vertex.find(e[marked_edges[1]].index());
+      dolfin_assert(it !=  edge_to_new_vertex.end());
+      const std::size_t e1 = it->second;
+
+      it = edge_to_new_vertex.find(e[marked_edges[2]].index());
+      dolfin_assert(it !=  edge_to_new_vertex.end());
+      const std::size_t e2 = it->second;
+
+      const std::vector<std::size_t> com_v
+        = common_vertices(*cell, marked_edges[0], marked_edges[1]);
+
+      const std::size_t v_far = Vertex(mesh, com_v[0]).global_index();
+      const std::size_t v20 = Vertex(mesh, com_v[1]).global_index();
+      const std::size_t v12 = Vertex(mesh, com_v[2]).global_index();
+      const std::size_t v01 = Vertex(mesh, com_v[3]).global_index();
+
+      p.new_cell(v_far, e0, e1, e2);
+      p.new_cell(v_far, e0, v01, e1);
+      p.new_cell(v_far, e1, v12, e2);
+      p.new_cell(v_far, e2, v20, e0);
+
+    }
+    else if (marked_edges.size() == 6)
+      eightfold_division(*cell, p);
+  }
+
+  p.partition(new_mesh, redistribute);
+
+  // Save some data about partial refinements to assist with future subdivision
+  //  std::shared_ptr<std::vector<std::size_t> > mesh_out_array =
+  // new_mesh.data().create_array("experimental_data");
+}
+//-----------------------------------------------------------------------------
+std::vector<std::size_t> ParallelRefinement3D::common_vertices(const Cell& cell,
+                                                               const std::size_t edge0,
+                                                               const std::size_t edge1)
+{
+  // Order the four vertex indices of cell so that
+  // result[0] is in neither edge
+  // result[1] is only in e0
+  // result[2] is only in e1
+  // result[3] is in both edges
+
+  std::vector<std::size_t> result(4);
+
+  EdgeIterator e(cell);
+  const Edge e0 = e[edge0];
+  const Edge e1 = e[edge1];
+
+  bool found_common = false;
+
+  for (VertexIterator vc(cell); !vc.end(); ++vc)
+  {
+    std::size_t idx = 2*(std::size_t)(e1.incident(*vc))
+                      + (std::size_t)(e0.incident(*vc));
+    if (idx == 3)
+      found_common = true;
+
+    result[idx]=vc->index();
+  }
+
+  // If edges do not share any vertices, output will be garbage
+  dolfin_assert(found_common);
+
+  return result;
+}
+//-----------------------------------------------------------------------------
+void ParallelRefinement3D::eightfold_division(const Cell& cell,
+                                              ParallelRefinement& p)
+{
+  VertexIterator v(cell);
+  EdgeIterator e(cell);
+
+  const std::size_t v0 = v[0].global_index();
+  const std::size_t v1 = v[1].global_index();
+  const std::size_t v2 = v[2].global_index();
+  const std::size_t v3 = v[3].global_index();
+
+  const std::map<std::size_t, std::size_t>& edge_to_new_vertex
+    = p.edge_to_new_vertex();
+
+  // Convenience iterator
+  std::map<std::size_t, std::size_t>::const_iterator it;
+
+  it = edge_to_new_vertex.find(e[0].index());
+  dolfin_assert(it !=  edge_to_new_vertex.end());
+  const std::size_t e0 = it->second;
+
+  it = edge_to_new_vertex.find(e[1].index());
+  dolfin_assert(it !=  edge_to_new_vertex.end());
+  const std::size_t e1 = it->second;
+
+  it = edge_to_new_vertex.find(e[2].index());
+  dolfin_assert(it !=  edge_to_new_vertex.end());
+  const std::size_t e2 = it->second;
+
+  it = edge_to_new_vertex.find(e[3].index());
+  dolfin_assert(it !=  edge_to_new_vertex.end());
+  const std::size_t e3 = it->second;
+
+  it = edge_to_new_vertex.find(e[4].index());
+  dolfin_assert(it !=  edge_to_new_vertex.end());
+  const std::size_t e4 = it->second;
+
+  it = edge_to_new_vertex.find(e[5].index());
+  dolfin_assert(it !=  edge_to_new_vertex.end());
+  const std::size_t e5 = it->second;
+
+  p.new_cell(v0, e3, e4, e5);
+  p.new_cell(v1, e1, e2, e5);
+  p.new_cell(v2, e0, e2, e4);
+  p.new_cell(v3, e0, e1, e3);
+
+  const Point p0 = e[0].midpoint();
+  const Point p1 = e[1].midpoint();
+  const Point p2 = e[2].midpoint();
+  const Point p3 = e[3].midpoint();
+  const Point p4 = e[4].midpoint();
+  const Point p5 = e[5].midpoint();
+  const double d05 = p0.distance(p5);
+  const double d14 = p1.distance(p4);
+  const double d23 = p2.distance(p3);
+
+  // Then divide the remaining octahedron into 4 tetrahedra
+  if (d05 <= d14 && d14 <= d23)
+  {
+    p.new_cell(e0, e1, e2, e5);
+    p.new_cell(e0, e1, e3, e5);
+    p.new_cell(e0, e2, e4, e5);
+    p.new_cell(e0, e3, e4, e5);
+  }
+  else if (d14 <= d23)
+  {
+    p.new_cell(e0, e1, e2, e4);
+    p.new_cell(e0, e1, e3, e4);
+    p.new_cell(e1, e2, e4, e5);
+    p.new_cell(e1, e3, e4, e5);
+  }
+  else
+  {
+    p.new_cell(e0, e1, e2, e3);
+    p.new_cell(e0, e2, e3, e4);
+    p.new_cell(e1, e2, e3, e5);
+    p.new_cell(e2, e3, e4, e5);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/ParallelRefinement3D.h b/dolfin/refinement/ParallelRefinement3D.h
new file mode 100644
index 0000000..918195b
--- /dev/null
+++ b/dolfin/refinement/ParallelRefinement3D.h
@@ -0,0 +1,55 @@
+// Copyright (C) 2013 Chris Richardson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+//
+// First Added: 2013-01-02
+// Last Changed: 2013-01-17
+
+
+namespace dolfin
+{
+  class Mesh;
+  class Edge;
+  class Cell;
+  class ParallelRefinement;
+
+  /// Simple class to perform uniform refinement in 3D in parallel
+
+  class ParallelRefinement3D
+  {
+  public:
+
+    // Uniform refine
+    static void refine(Mesh& new_mesh, const Mesh& mesh, bool redistribute);
+
+    // Refine with markers
+    static void refine(Mesh& new_mesh, const Mesh& mesh,
+                       const MeshFunction<bool>& refinement_marker,
+                       bool redistribute);
+
+  private:
+
+    // Full refinement of a tetrahedral cell
+    static void eightfold_division(const Cell& cell, ParallelRefinement& p);
+
+    // Work out vertices which are shared by both, one or neither edge
+    static std::vector<std::size_t> common_vertices(const Cell& cell,
+                                                    const std::size_t edge0,
+                                                    const std::size_t edge1);
+   };
+
+}
diff --git a/dolfin/refinement/RegularCutRefinement.cpp b/dolfin/refinement/RegularCutRefinement.cpp
new file mode 100644
index 0000000..bb13c08
--- /dev/null
+++ b/dolfin/refinement/RegularCutRefinement.cpp
@@ -0,0 +1,695 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-02-07
+// Last changed: 2014-02-06
+
+#include <vector>
+
+#include <dolfin/log/log.h>
+#include <dolfin/common/constants.h>
+#include <dolfin/common/IndexSet.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/Cell.h>
+#include <dolfin/mesh/Edge.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include "RegularCutRefinement.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void RegularCutRefinement::refine(Mesh& refined_mesh,
+                                  const Mesh& mesh,
+                                  const MeshFunction<bool>& cell_markers)
+{
+  not_working_in_parallel("RegularCutRefinement::refine");
+
+  // Currently only implemented in 2D
+  if (mesh.topology().dim() != 2)
+  {
+    dolfin_error("RegularCutRefinement.cpp",
+                 "refine mesh",
+                 "Mesh is not two-dimensional: regular-cut mesh refinement is currently only implemented in 2D");
+  }
+
+  // Check that mesh is ordered
+  if (!mesh.ordered())
+  {
+    dolfin_error("RegularCutRefinement.cpp",
+                 "refine mesh",
+                 "Mesh is not ordered according to the UFC numbering convention, consider calling mesh.order()");
+  }
+
+  // Initialize edges
+  mesh.init(1);
+
+  // Compute refinement markers
+  std::vector<int> refinement_markers;
+  IndexSet marked_edges(mesh.num_edges());
+  compute_markers(refinement_markers, marked_edges, mesh, cell_markers);
+
+  // Refine mesh based on computed markers
+  refine_marked(refined_mesh, mesh, refinement_markers, marked_edges);
+}
+//-----------------------------------------------------------------------------
+void
+RegularCutRefinement::compute_markers(std::vector<int>& refinement_markers,
+                                      IndexSet& marked_edges,
+                                      const Mesh& mesh,
+                                      const MeshFunction<bool>& cell_markers)
+{
+  // Topological dimension
+  const std::size_t D = mesh.topology().dim();
+
+  // Create edge markers and initialize to false
+  const std::size_t edges_per_cell = D + 1;
+  std::vector<std::vector<bool> > edge_markers(mesh.num_cells());
+  for (std::size_t i = 0; i < mesh.num_cells(); i++)
+  {
+    edge_markers[i].resize(edges_per_cell);
+    for (std::size_t j = 0; j < edges_per_cell; j++)
+      edge_markers[i][j] = false;
+  }
+
+  // Create index sets for marked cells
+  IndexSet cells(mesh.num_cells());
+  IndexSet marked_cells(mesh.num_cells());
+
+  // Get bisection data
+  const std::vector<std::size_t>* bisection_twins = NULL;
+  if (mesh.data().exists("bisection_twins", D))
+    bisection_twins = &(mesh.data().array("bisection_twins", D));
+
+  // Iterate until no more cells are marked
+  cells.fill();
+  while (!cells.empty())
+  {
+    // Iterate over all cells in list
+    for (std::size_t _i = 0; _i < cells.size(); _i++)
+    {
+      // Get cell index and create cell
+      const std::size_t cell_index = cells[_i];
+      const Cell cell(mesh, cell_index);
+
+      // Count the number of marked edges
+      const std::size_t num_marked = count_markers(edge_markers[cell_index]);
+
+      // Check whether cell has a bisection twin
+      std::size_t bisection_twin = cell_index;
+      bool is_bisected = false;
+      if (bisection_twins)
+      {
+        bisection_twin = (*bisection_twins)[cell_index];
+        is_bisected = bisection_twin != cell_index;
+      }
+
+      // Get bisection edge
+      std::size_t common_edge = 0;
+      std::size_t bisection_edge = 0;
+      if (is_bisected)
+      {
+        common_edge = find_common_edges(cell, mesh, bisection_twin).first;
+        bisection_edge = find_bisection_edges(cell, mesh, bisection_twin).first;
+      }
+
+      // Decide if cell should be refined
+      bool refine = false;
+      refine = refine || cell_markers[cell_index];
+      if (is_bisected)
+        refine = refine || num_marked > 0;
+      else
+      {
+        refine = refine || num_marked > 1;
+        refine = refine || too_thin(cell, edge_markers[cell_index]);
+      }
+
+      // Skip cell if it should not be marked
+      if (!refine)
+        continue;
+
+      // Iterate over edges
+      for (EdgeIterator edge(cell); !edge.end(); ++edge)
+      {
+        // Skip edge if it is a bisected edge of a bisected cell
+        if (is_bisected && edge.pos() == bisection_edge)
+          continue;
+
+        // Mark edge in current cell
+        if (!edge_markers[cell_index][edge.pos()])
+        {
+          edge_markers[cell_index][edge.pos()] = true;
+          marked_cells.insert(cell_index);
+        }
+
+        // Insert edge into set of marked edges but only if the edge
+        // is not the common edge of a bisected cell in which case it
+        // will later be removed and no new vertex be inserted...
+        if (!is_bisected || edge.pos() != common_edge)
+          marked_edges.insert(edge->index());
+
+        // Iterate over cells sharing edge
+        for (CellIterator neighbor(*edge); !neighbor.end(); ++neighbor)
+        {
+          // Get local edge number of edge relative to neighbor
+          const std::size_t local_index = neighbor->index(*edge);
+
+          // Mark edge for refinement
+          if (!edge_markers[neighbor->index()][local_index])
+          {
+            edge_markers[neighbor->index()][local_index] = true;
+            marked_cells.insert(neighbor->index());
+          }
+        }
+      }
+    }
+
+    // Copy marked cells
+    cells = marked_cells;
+    marked_cells.clear();
+  }
+
+  // Extract which cells to refine and indices which edges to bisect
+  refinement_markers.resize(mesh.num_cells());
+  for (std::size_t i = 0; i < edge_markers.size(); i++)
+  {
+    // Count the number of marked edges
+    const std::size_t num_marked = count_markers(edge_markers[i]);
+
+    // Check if cell has been bisected before
+    const bool is_bisected = bisection_twins && (*bisection_twins)[i] != i;
+
+    // No refinement
+    if (num_marked == 0)
+      refinement_markers[i] = no_refinement;
+
+    // Mark for bisection
+    else if (num_marked == 1 && !is_bisected)
+      refinement_markers[i] = extract_edge(edge_markers[i]);
+
+    // Mark for regular refinement
+    else if (num_marked == edges_per_cell && !is_bisected)
+      refinement_markers[i] = regular_refinement;
+
+    // Mark for bisection backtracking
+    else if (num_marked == 2 && is_bisected)
+      refinement_markers[i] = backtrack_bisection;
+
+    // Mark for bisection backtracking and refinement
+    else if (num_marked == edges_per_cell && is_bisected)
+      refinement_markers[i] = backtrack_bisection_refine;
+
+    // Sanity check
+    else
+      dolfin_error("RegularCutRefinement.cpp",
+                   "compute marked edges",
+                   "Unexpected number of edges marked");
+  }
+}
+//-----------------------------------------------------------------------------
+void RegularCutRefinement::refine_marked(Mesh& refined_mesh,
+                                  const Mesh& mesh,
+                                  const std::vector<int>& refinement_markers,
+                                  const IndexSet& marked_edges)
+{
+  // Count the number of cells in refined mesh
+  std::size_t num_cells = 0;
+
+  // Data structure to hold a cell
+  std::vector<std::size_t> cell_data(3);
+
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    const int marker = refinement_markers[cell->index()];
+    switch (marker)
+    {
+    case no_refinement:
+      num_cells += 1;
+      break;
+    case regular_refinement:
+      num_cells += 4;
+      break;
+    case backtrack_bisection:
+      num_cells += 2;
+      break;
+    case backtrack_bisection_refine:
+      num_cells += 3;
+      break;
+    default:
+      num_cells += 2;
+    }
+  }
+
+  // Initialize mesh editor
+  const std::size_t num_vertices = mesh.num_vertices() + marked_edges.size();
+  MeshEditor editor;
+  editor.open(refined_mesh, mesh.topology().dim(), mesh.geometry().dim());
+  editor.init_vertices_global(num_vertices, num_vertices);
+  editor.init_cells_global(num_cells, num_cells);
+
+  // Set vertex coordinates
+  std::size_t current_vertex = 0;
+  for (VertexIterator vertex(mesh); !vertex.end(); ++vertex)
+  {
+    editor.add_vertex(current_vertex, vertex->point());
+    current_vertex++;
+  }
+  for (std::size_t i = 0; i < marked_edges.size(); i++)
+  {
+    Edge edge(mesh, marked_edges[i]);
+    editor.add_vertex(current_vertex, edge.midpoint());
+    current_vertex++;
+  }
+
+  // Get bisection data for old mesh
+  const std::size_t D = mesh.topology().dim();
+  const std::vector<std::size_t>*  bisection_twins = NULL;
+  if (mesh.data().exists("bisection_twins", D))
+    bisection_twins = &(mesh.data().array("bisection_twins", D));
+
+  // Markers for bisected cells pointing to their bisection twins in
+  // refined mesh
+  std::vector<std::size_t>& refined_bisection_twins
+    = refined_mesh.data().create_array("bisection_twins", D);
+  refined_bisection_twins.resize(num_cells);
+  for (std::size_t i = 0; i < num_cells; i++)
+    refined_bisection_twins[i] = i;
+
+  // Mapping from old to new unrefined cells (-1 means refined or not
+  // yet processed)
+  std::vector<int> unrefined_cells(mesh.num_cells());
+  std::fill(unrefined_cells.begin(), unrefined_cells.end(), -1);
+
+  // Iterate over all cells and add new cells
+  std::size_t current_cell = 0;
+  std::vector<std::vector<std::size_t> > cells(4, std::vector<std::size_t>(3));
+  for (CellIterator cell(mesh); !cell.end(); ++cell)
+  {
+    // Get marker
+    const int marker = refinement_markers[cell->index()];
+
+    if (marker == no_refinement)
+    {
+      // No refinement: just copy cell to new mesh
+
+      std::vector<std::size_t> vertices;
+      for (VertexIterator vertex(*cell); !vertex.end(); ++vertex)
+        vertices.push_back(vertex->index());
+      editor.add_cell(current_cell++, vertices);
+
+      // Store mapping to new cell index
+      unrefined_cells[cell->index()] = current_cell - 1;
+
+      // Remember unrefined bisection twins
+      if (bisection_twins)
+      {
+        const std::size_t bisection_twin = (*bisection_twins)[cell->index()];
+        const int twin_marker = refinement_markers[bisection_twin];
+        dolfin_assert(twin_marker == no_refinement);
+        if (unrefined_cells[bisection_twin] >= 0)
+        {
+          const std::size_t i = current_cell - 1;
+          const std::size_t j = unrefined_cells[bisection_twin];
+          refined_bisection_twins[i] = j;
+          refined_bisection_twins[j] = i;
+        }
+      }
+    }
+    else if (marker == regular_refinement)
+    {
+      // Regular refinement: divide into subsimplicies
+      dolfin_assert(unrefined_cells[cell->index()] == -1);
+
+      // Get vertices and edges
+      const unsigned int* v = cell->entities(0);
+      const unsigned int* e = cell->entities(1);
+      dolfin_assert(v);
+      dolfin_assert(e);
+
+      // Get offset for new vertex indices
+      const std::size_t offset = mesh.num_vertices();
+
+      // Compute indices for the six new vertices
+      const std::size_t v0 = v[0];
+      const std::size_t v1 = v[1];
+      const std::size_t v2 = v[2];
+      const std::size_t e0 = offset + marked_edges.find(e[0]);
+      const std::size_t e1 = offset + marked_edges.find(e[1]);
+      const std::size_t e2 = offset + marked_edges.find(e[2]);
+
+      // Create four new cells
+      cells[0][0] = v0; cells[0][1] = e2; cells[0][2] = e1;
+      cells[1][0] = v1; cells[1][1] = e0; cells[1][2] = e2;
+      cells[2][0] = v2; cells[2][1] = e1; cells[2][2] = e0;
+      cells[3][0] = e0; cells[3][1] = e1; cells[3][2] = e2;
+
+      // Add cells
+      std::vector<std::vector<std::size_t> >::const_iterator _cell;
+      for (_cell = cells.begin(); _cell != cells.end(); ++_cell)
+        editor.add_cell(current_cell++, *_cell);
+    }
+    else if (marker == backtrack_bisection || marker == backtrack_bisection_refine)
+    {
+      // Special case: backtrack bisected cells
+      dolfin_assert(unrefined_cells[cell->index()] == -1);
+
+      // Get index for bisection twin
+      dolfin_assert(bisection_twins);
+      const std::size_t bisection_twin = (*bisection_twins)[cell->index()];
+      dolfin_assert(bisection_twin != cell->index());
+
+      // Let lowest number twin handle refinement
+      if (bisection_twin < cell->index())
+        continue;
+
+      // Get marker for twin
+      const int twin_marker = refinement_markers[bisection_twin];
+
+      // Find common edge(s) and bisected edge(s)
+      const std::pair<std::size_t, std::size_t> common_edges
+        = find_common_edges(*cell, mesh, bisection_twin);
+      const std::pair<std::size_t, std::size_t> bisection_edges
+        = find_bisection_edges(*cell, mesh, bisection_twin);
+      const std::pair<std::size_t, std::size_t> bisection_vertices
+        = find_bisection_vertices(*cell, mesh, bisection_twin, bisection_edges);
+
+      // Get list of vertices and edges for both cells
+      const Cell twin(mesh, bisection_twin);
+      const unsigned int* vertices_0 = cell->entities(0);
+      const unsigned int* vertices_1 = twin.entities(0);
+      const unsigned int* edges_0 = cell->entities(1);
+      const unsigned int* edges_1 = twin.entities(1);
+      dolfin_assert(vertices_0);
+      dolfin_assert(vertices_1);
+      dolfin_assert(edges_0);
+      dolfin_assert(edges_1);
+
+      // Get offset for new vertex indices
+      const std::size_t offset = mesh.num_vertices();
+
+      // Locate vertices such that v_i is the vertex opposite to
+      // the edge e_i on the parent triangle
+      const std::size_t v0 = vertices_0[common_edges.first];
+      const std::size_t v1 = vertices_1[common_edges.second];
+      const std::size_t v2 = vertices_0[bisection_edges.first];
+      const std::size_t e0 = offset + marked_edges.find(edges_1[bisection_vertices.second]);
+      const std::size_t e1 = offset + marked_edges.find(edges_0[bisection_vertices.first]);
+      const std::size_t e2 = vertices_0[bisection_vertices.first];
+
+      // Locate new vertices on bisected edge (if any)
+      std::size_t E0 = 0;
+      std::size_t E1 = 0;
+      if (marker == backtrack_bisection_refine)
+        E0 = offset + marked_edges.find(edges_0[bisection_edges.first]);
+      if (twin_marker == backtrack_bisection_refine)
+        E1 = offset + marked_edges.find(edges_1[bisection_edges.second]);
+
+      // Add middle two cells (always)
+      dolfin_assert(cell_data.size() == 3);
+      cell_data[0] = e0; cell_data[1] = e1; cell_data[2] = e2;
+      editor.add_cell(current_cell++, cell_data);
+
+      cell_data[0] = v2; cell_data[1] = e1; cell_data[2] = e0;
+      editor.add_cell(current_cell++, cell_data);
+
+      // Add one or two remaining cells in current cell (left)
+      if (marker == backtrack_bisection)
+      {
+        cell_data[0] = v0; cell_data[1] = e2; cell_data[2] = e1;
+        editor.add_cell(current_cell++, cell_data);
+      }
+      else
+      {
+        // Add the two cells
+        cell_data[0] = v0; cell_data[1] = E0; cell_data[2] = e1;
+        editor.add_cell(current_cell++, cell_data);
+
+        cell_data[0] = E0; cell_data[1] = e2; cell_data[2] = e1;
+        editor.add_cell(current_cell++, cell_data);
+
+        // Set bisection twins
+        refined_bisection_twins[current_cell - 2] = current_cell - 1;
+        refined_bisection_twins[current_cell - 1] = current_cell - 2;
+      }
+
+      // Add one or two remaining cells in twin cell (right)
+      if (twin_marker == backtrack_bisection)
+      {
+        cell_data[0] = v1; cell_data[1] = e0; cell_data[2] = e2;
+        editor.add_cell(current_cell++, cell_data);
+      }
+      else
+      {
+        // Add the two cells
+        cell_data[0] = v1; cell_data[1] = e0; cell_data[2] = E1;
+        editor.add_cell(current_cell++, cell_data);
+
+        cell_data[0] = e0; cell_data[1] = e2; cell_data[2] = E1;
+        editor.add_cell(current_cell++, cell_data);
+
+        // Set bisection twins
+        refined_bisection_twins[current_cell - 2] = current_cell - 1;
+        refined_bisection_twins[current_cell - 1] = current_cell - 2;
+      }
+    }
+    else
+    {
+      // One edge marked for refinement: do bisection
+
+      dolfin_assert(unrefined_cells[cell->index()] == -1);
+
+      // Get vertices and edges
+      const unsigned int* v = cell->entities(0);
+      const unsigned int* e = cell->entities(1);
+      dolfin_assert(v);
+      dolfin_assert(e);
+
+      // Get edge number (equal to marker)
+      dolfin_assert(marker >= 0);
+      const std::size_t local_edge_index = static_cast<std::size_t>(marker);
+      const std::size_t global_edge_index = e[local_edge_index];
+      const std::size_t ee = mesh.num_vertices() + marked_edges.find(global_edge_index);
+
+      // Add the two new cells
+      if (local_edge_index == 0)
+      {
+        cell_data[0] = v[0]; cell_data[1] = ee; cell_data[2] = v[1];
+        editor.add_cell(current_cell++, cell_data);
+
+        cell_data[0] = v[0]; cell_data[1] = ee; cell_data[2] = v[2];
+        editor.add_cell(current_cell++, cell_data);
+      }
+      else if (local_edge_index == 1)
+      {
+        cell_data[0] = v[1]; cell_data[1] = ee; cell_data[2] = v[0];
+        editor.add_cell(current_cell++, cell_data);
+
+        cell_data[0] = v[1]; cell_data[1] = ee; cell_data[2] = v[2];
+        editor.add_cell(current_cell++, cell_data);
+      }
+      else
+      {
+        cell_data[0] = v[2]; cell_data[1] = ee; cell_data[2] = v[0];
+        editor.add_cell(current_cell++, cell_data);
+
+        cell_data[0] = v[2]; cell_data[1] = ee; cell_data[2] = v[1];
+        editor.add_cell(current_cell++, cell_data);
+      }
+
+      // Set bisection twins
+      refined_bisection_twins[current_cell - 2] = current_cell - 1;
+      refined_bisection_twins[current_cell - 1] = current_cell - 2;
+    }
+  }
+
+  // Close mesh editor
+  dolfin_assert(num_cells == current_cell);
+  editor.close();
+}
+//-----------------------------------------------------------------------------
+std::size_t RegularCutRefinement::count_markers(const std::vector<bool>& markers)
+{
+  std::size_t num_markers = 0;
+  for (std::size_t i = 0; i < markers.size(); i++)
+    if (markers[i])
+      num_markers++;
+  return num_markers;
+}
+//-----------------------------------------------------------------------------
+std::size_t RegularCutRefinement::extract_edge(const std::vector<bool>& markers)
+{
+  for (std::size_t i = 0; i < markers.size(); i++)
+    if (markers[i])
+      return i;
+
+  dolfin_error("RegularCutRefinement.cpp",
+               "extract edge",
+               "Internal error in algorithm: edge not found");
+  return 0;
+}
+//-----------------------------------------------------------------------------
+bool RegularCutRefinement::too_thin(const Cell& cell,
+                                    const std::vector<bool>& edge_markers)
+{
+  const std::size_t num_markers = count_markers(edge_markers);
+
+  // Only care about the case when one edge is marked
+  if (num_markers != 1)
+    return false;
+
+  // Compute lengths of all edges
+  std::vector<double> lengths;
+  double L = 0.0;
+  for (EdgeIterator edge(cell); !edge.end(); ++edge)
+  {
+    const double l = edge->length();
+    L = std::max(L, l);
+    lengths.push_back(l);
+  }
+
+  // Get length of marked edge
+  const double l = lengths[extract_edge(edge_markers)];
+
+  // Check condition
+  const bool too_thin = l < 0.5*L;
+
+  return too_thin;
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+RegularCutRefinement::find_common_edges(const Cell& cell,
+                                        const Mesh& mesh,
+                                        std::size_t bisection_twin)
+{
+  // Get list of edges for both cells
+  const Cell twin(mesh, bisection_twin);
+  const unsigned int* e0 = cell.entities(1);
+  const unsigned int* e1 = twin.entities(1);
+  dolfin_assert(e0);
+  dolfin_assert(e1);
+
+  // Iterate over all combinations of edges
+  const std::size_t num_edges = cell.num_entities(1);
+  for (std::size_t i = 0; i < num_edges; i++)
+    for (std::size_t j = 0; j < num_edges; j++)
+      if (e0[i] == e1[j])
+        return std::make_pair(i, j);
+
+  // Not found
+  dolfin_error("RegularCutRefinement.cpp",
+               "find common edges between cells",
+               "Internal error in algorithm: common edge not found");
+
+  return std::make_pair(0, 0);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+RegularCutRefinement::find_bisection_edges(const Cell& cell,
+                                           const Mesh& mesh,
+                                           std::size_t bisection_twin)
+{
+  // Get list of edges for both cells
+  const Cell twin(mesh, bisection_twin);
+  const unsigned int* e0 = cell.entities(1);
+  const unsigned int* e1 = twin.entities(1);
+  dolfin_assert(e0);
+  dolfin_assert(e1);
+
+  // Iterate over all combinations of edges
+  const std::size_t num_edges = cell.num_entities(1);
+  for (std::size_t i = 0; i < num_edges; i++)
+  {
+    // Get list of vertices for edge
+    const Edge edge_0(mesh, e0[i]);
+    const unsigned int* v0 = edge_0.entities(0);
+    dolfin_assert(v0);
+
+    for (std::size_t j = 0; j < num_edges; j++)
+    {
+      // Don't test against the edge itself
+      if (e0[i] == e1[j])
+        continue;
+
+      // Get list of vertices for edge
+      const Edge edge_1(mesh, e1[j]);
+      const unsigned int* v1 = edge_1.entities(0);
+      dolfin_assert(v1);
+
+      // Check that we have a common vertex
+      if (v0[0] != v1[0] && v0[0] != v1[1] && v0[1] != v1[0] && v0[1] != v1[1])
+        continue;
+
+      // Compute normalized dot product between edges
+      double dot_product = edge_0.dot(edge_1);
+      dot_product /= edge_0.length() * edge_1.length();
+
+      // Bisection edge found if dot product is small
+      if (std::abs(std::abs(dot_product) - 1.0) < DOLFIN_EPS_LARGE)
+        return std::make_pair(i, j);
+    }
+  }
+
+  // Not found
+  dolfin_error("RegularCutRefinement.cpp",
+               "find edge for bisection",
+               "Internal error in algorithm; bisection edge not found");
+
+  return std::make_pair(0, 0);
+}
+//-----------------------------------------------------------------------------
+std::pair<std::size_t, std::size_t>
+RegularCutRefinement::find_bisection_vertices(const Cell& cell,
+                                              const Mesh& mesh,
+                                              std::size_t bisection_twin,
+                                              const std::pair<std::size_t, std::size_t>& bisection_edges)
+{
+  // Get list of edges for both cells
+  const Cell twin(mesh, bisection_twin);
+  const unsigned int* e0 = cell.entities(1);
+  const unsigned int* e1 = twin.entities(1);
+  dolfin_assert(e0);
+  dolfin_assert(e1);
+
+  // Get vertices of the two edges
+  Edge edge_0(mesh, e0[bisection_edges.first]);
+  Edge edge_1(mesh, e1[bisection_edges.second]);
+  const unsigned int* v0 = edge_0.entities(0);
+  const unsigned int* v1 = edge_1.entities(0);
+  dolfin_assert(v0);
+  dolfin_assert(v1);
+
+  // Find common vertex
+  if (v0[0] == v1[0] || v0[0] == v1[1])
+  {
+    Vertex v(mesh, v0[0]);
+    return std::make_pair(cell.index(v), twin.index(v));
+  }
+  if (v0[1] == v1[0] || v0[1] == v1[1])
+  {
+    Vertex v(mesh, v0[1]);
+    return std::make_pair(cell.index(v), twin.index(v));
+  }
+
+  // Not found
+  dolfin_error("RegularCutRefinement.cpp",
+               "find bisection vertices",
+               "Internal error in algorithm: bisection vertex not found");
+
+  return std::make_pair(0, 0);
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/RegularCutRefinement.h b/dolfin/refinement/RegularCutRefinement.h
new file mode 100644
index 0000000..8f2a400
--- /dev/null
+++ b/dolfin/refinement/RegularCutRefinement.h
@@ -0,0 +1,94 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-02-07
+// Last changed: 2011-02-09
+
+#ifndef __REGULAR_CUT_REFINEMENT_H
+#define __REGULAR_CUT_REFINEMENT_H
+
+#include <vector>
+
+namespace dolfin
+{
+
+  class Cell;
+  class Mesh;
+  template<typename T> class MeshFunction;
+  class IndexSet;
+
+  /// This class implements local mesh refinement by a regular cut of
+  /// each cell marked for refinement in combination with propagation
+  /// of cut edges to neighboring cells.
+
+  class RegularCutRefinement
+  {
+  public:
+
+    /// Refine mesh based on cell markers
+    static void refine(Mesh& refined_mesh,
+                       const Mesh& mesh,
+                       const MeshFunction<bool>& cell_markers);
+
+  private:
+
+    // Refinement markers
+    enum { no_refinement=-1, regular_refinement=-2, backtrack_bisection=-3, backtrack_bisection_refine=-4 };
+
+    // Compute refinement markers based on initial markers
+    static void compute_markers(std::vector<int>& refinement_markers,
+                                IndexSet& marked_edges,
+                                const Mesh& mesh,
+                                const MeshFunction<bool>& cell_markers);
+
+    // Refine mesh based on computed markers
+    static void refine_marked(Mesh& refined_mesh,
+                              const Mesh& mesh,
+                              const std::vector<int>& refinement_markers,
+                              const IndexSet& marked_edges);
+
+    // Count the number of marked entries
+    static std::size_t count_markers(const std::vector<bool>& markers);
+
+    // Extract index of first marked entry
+    static std::size_t extract_edge(const std::vector<bool>& markers);
+
+    // Check whether suggested refinement will produce too thin cells
+    static bool too_thin(const Cell& cell,
+                         const std::vector<bool>& edge_markers);
+
+    // Find local indices for common edge relative to cell and twin
+    static std::pair<std::size_t, std::size_t> find_common_edges(const Cell& cell,
+                                                   const Mesh& mesh,
+                                                   std::size_t bisection_twin);
+
+    // Find local indices for bisection edge relative to cell and twin
+    static std::pair<std::size_t, std::size_t> find_bisection_edges(const Cell& cell,
+                                                      const Mesh& mesh,
+                                                      std::size_t bisection_twin);
+
+    // Find local indices for bisection vertex relative to cell and twin
+    static std::pair<std::size_t, std::size_t> find_bisection_vertices(const Cell& cell,
+                                                         const Mesh& mesh,
+                                                         std::size_t bisection_twin,
+                                                         const std::pair<std::size_t, std::size_t>& bisection_edges);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/refinement/RivaraRefinement.cpp b/dolfin/refinement/RivaraRefinement.cpp
new file mode 100644
index 0000000..84b0408
--- /dev/null
+++ b/dolfin/refinement/RivaraRefinement.cpp
@@ -0,0 +1,480 @@
+// Copyright (C) 2008 Johan Jansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Bartosz Sawicki, 2009.
+// Modified by Garth N. Wells, 2010.
+// Modified by Anders Logg, 2010.
+//
+// First added:  2008
+// Last changed: 2014-02-06
+
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/Cell.h>
+#include "RivaraRefinement.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void RivaraRefinement::refine(Mesh& refined_mesh,
+                              const Mesh& mesh,
+                              const MeshFunction<bool>& cell_marker,
+                              MeshFunction<std::size_t>& cell_map,
+                              std::vector<int>& facet_map)
+{
+  log(TRACE, "Refining simplicial mesh by recursive Rivara bisection.");
+
+  // Create dynamic mesh and import data
+  DMesh dmesh;
+  dmesh.import_mesh(mesh);
+
+  // Rewrite MeshFunction into vector
+  std::vector<bool> dmarked(mesh.num_cells());
+  for (CellIterator ci(mesh); !ci.end(); ++ci)
+  {
+    if(cell_marker[*ci] == true)
+      dmarked[ci->index()] = true;
+    else
+      dmarked[ci->index()] = false;
+  }
+
+  // Main refinement algorithm
+  dmesh.bisect_marked(dmarked);
+
+  // Remove deleted cells from global list
+  for(std::list<DCell* >::iterator it = dmesh.cells.begin(); it != dmesh.cells.end(); )
+  {
+    DCell* dc = *it;
+    if(dc->deleted)
+    {
+      delete *it;
+      it = dmesh.cells.erase(it);
+    }
+    else
+      it++;
+  }
+
+  // Vector for cell and facet mappings
+  std::vector<int> new2old_cell_arr;
+  std::vector<int> new2old_facet_arr;
+
+  // Refine mesh
+  dmesh.export_mesh(refined_mesh, new2old_cell_arr, new2old_facet_arr);
+
+  // Generate cell mesh function map
+  cell_map.init(refined_mesh, mesh.topology().dim());
+  for (CellIterator c(refined_mesh); !c.end(); ++c)
+    cell_map[*c] = new2old_cell_arr[c->index()];
+
+  // Generate facet map array
+  std::vector<int> new_facet_map(new2old_facet_arr.size());
+  facet_map = new_facet_map;
+  for (std::size_t i = 0; i < new2old_facet_arr.size(); i++)
+  {
+    facet_map[i] = new2old_facet_arr[i];
+  }
+
+}
+//-----------------------------------------------------------------------------
+RivaraRefinement::DVertex::DVertex() : id(0), cells(0), p(0.0, 0.0, 0.0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+RivaraRefinement::DCell::DCell() : id(0), parent_id(0), vertices(0),
+                                   deleted(false), facets(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+RivaraRefinement::DMesh::DMesh() : vertices(0), cells(0)
+{
+  // Do nothing
+}
+//-----------------------------------------------------------------------------
+RivaraRefinement::DMesh::~DMesh()
+{
+  // Delete allocated DVertices
+  for (std::list<DVertex* >::iterator it = vertices.begin();
+      it != vertices.end(); ++it)
+  {
+    delete *it;
+  }
+  // Delete allocated DCells
+  for (std::list<DCell* >::iterator it = cells.begin();
+      it != cells.end(); ++it)
+  {
+    delete *it;
+  }
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::import_mesh(const Mesh& mesh)
+{
+  cell_type = &(mesh.type());
+  tdim = mesh.topology().dim();
+  gdim = mesh.geometry().dim();
+  vertices.clear();
+  cells.clear();
+
+  // Import vertices
+  std::vector<DVertex *> vertexvec;
+  for (VertexIterator vi(mesh); !vi.end(); ++vi)
+  {
+    DVertex* dv = new DVertex;
+    dv->p = vi->point();
+    dv->id = vi->index();
+
+    add_vertex(dv);
+    vertexvec.push_back(dv);
+  }
+
+  // Import cells
+  for (CellIterator ci(mesh); !ci.end(); ++ci)
+  {
+    DCell* dc = new DCell;
+    std::vector<DVertex*> vs(ci->num_entities(0));
+    std::size_t counter = 0;
+    for (VertexIterator vi(*ci); !vi.end(); ++vi)
+    {
+      DVertex* dv = vertexvec[vi->index()];
+      vs[counter] = dv;
+      counter++;
+    }
+
+    // Initialize facets
+    for (std::size_t i = 0; i < cell_type->num_entities(0); i++)
+      dc->facets.push_back(i);
+
+    add_cell(dc, vs, ci->index());
+
+    // Define the same cell numbering
+    dc->id = ci->index();
+  }
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::export_mesh(Mesh& mesh,
+                                          std::vector<int>& new2old_cell,
+                                          std::vector<int>& new2old_facet)
+{
+  number();
+
+  new2old_cell.resize(cells.size());
+  new2old_facet.resize(cells.size()*cell_type->num_entities(0));
+
+  MeshEditor editor;
+  editor.open(mesh, cell_type->cell_type(), tdim, gdim);
+
+  editor.init_vertices_global(vertices.size(), vertices.size());
+  editor.init_cells_global(cells.size(), cells.size());
+
+  // Add vertices
+  std::size_t current_vertex = 0;
+  for (std::list<DVertex*>::iterator it = vertices.begin();
+        it != vertices.end(); ++it)
+  {
+    DVertex* dv = *it;
+    editor.add_vertex(current_vertex, dv->p);
+    current_vertex++;
+  }
+
+  std::vector<std::size_t> cell_vertices(cell_type->num_entities(0));
+  std::size_t current_cell = 0;
+  for (std::list<DCell*>::iterator it = cells.begin();
+        it != cells.end(); ++it)
+  {
+    const DCell* dc = *it;
+
+    for (std::size_t j = 0; j < dc->vertices.size(); j++)
+    {
+      const DVertex* dv = dc->vertices[j];
+      cell_vertices[j] = dv->id;
+    }
+    editor.add_cell(current_cell, cell_vertices);
+    new2old_cell[current_cell] = dc->parent_id;
+
+    for (std::size_t j = 0; j < dc->facets.size(); j++)
+    {
+      std::size_t index = cell_type->num_entities(0)*current_cell + j;
+      new2old_facet[ index ] = dc->facets[j];
+    }
+
+    current_cell++;
+  }
+  editor.close();
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::number()
+{
+  std::size_t i = 0;
+  for (std::list<DCell*>::iterator it = cells.begin();
+      it != cells.end(); ++it)
+  {
+    DCell* dc = *it;
+    dc->id = i;
+    i++;
+  }
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::bisect(DCell* dcell, DVertex* hangv,
+		                                 DVertex* hv0, DVertex* hv1)
+{
+  bool closing = false;
+
+  // Find longest edge
+  double lmax = 0.0;
+  std::size_t ii = 0;
+  std::size_t jj = 0;
+  for(std::size_t i = 0; i < dcell->vertices.size(); i++)
+  {
+    for(std::size_t j = 0; j < dcell->vertices.size(); j++)
+    {
+      if(i != j)
+      {
+        const double l = dcell->vertices[i]->p.distance(dcell->vertices[j]->p);
+        if(l >= lmax)
+        {
+          ii = i;
+          jj = j;
+          lmax = l;
+        }
+      }
+    }
+  }
+
+  DVertex* v0 = dcell->vertices[ii];
+  DVertex* v1 = dcell->vertices[jj];
+
+  DVertex* mv = 0;
+
+  // Check if no hanging vertices remain, otherwise create hanging
+  // vertex and continue refinement
+  if((v0 == hv0 || v0 == hv1) && (v1 == hv0 || v1 == hv1))
+  {
+    mv = hangv;
+    closing = true;
+  }
+  else
+  {
+    mv = new DVertex;
+    mv->p = (dcell->vertices[ii]->p + dcell->vertices[jj]->p) / 2.0;
+    mv->id = vertices.size();
+    add_vertex(mv);
+    closing = false;
+  }
+
+  if(ii>jj)
+  {
+    std::size_t tmp = ii;
+    ii = jj;
+    jj = tmp;
+  }
+
+  // Create new cells & keep them ordered
+  DCell* c0 = new DCell;
+  DCell* c1 = new DCell;
+  std::vector<DVertex*> vs0(0);
+  std::vector<DVertex*> vs1(0);
+  bool pushed0 = false;
+  bool pushed1 = false;
+  for(std::size_t i = 0; i < dcell->vertices.size(); i++)
+  {
+    if (i != ii)
+    {
+      if (mv->id < dcell->vertices[i]->id && !pushed1)
+      {
+        vs1.push_back(mv);
+        pushed1 =  true;
+      }
+      vs1.push_back(dcell->vertices[i]);
+    }
+    if(i != jj)
+    {
+      if( (mv->id < dcell->vertices[i]->id) && !pushed0 )
+      {
+        vs0.push_back(mv);
+        pushed0 = true;
+      }
+      vs0.push_back(dcell->vertices[i]);
+    }
+  }
+  if( !pushed0 )
+    vs0.push_back(mv);
+  if( !pushed1 )
+    vs1.push_back(mv);
+  add_cell(c0, vs0, dcell->parent_id);
+  add_cell(c1, vs1, dcell->parent_id);
+
+  propagate_facets(dcell, c0, c1, ii, jj, mv);
+
+  remove_cell(dcell);
+
+  // Continue refinement
+  if (!closing)
+  {
+    // Bisect opposite cell of edge with hanging node
+    for (;;)
+    {
+      DCell* copp = opposite(dcell, v0, v1);
+      if (copp != 0)
+        bisect(copp, mv, v0, v1);
+      else
+        break;
+    }
+  }
+}
+//-----------------------------------------------------------------------------
+RivaraRefinement::DCell* RivaraRefinement::DMesh::opposite(DCell* dcell,
+                                                           DVertex* v1,
+                                                           DVertex* v2)
+{
+  for (std::list<DCell*>::iterator it = v1->cells.begin();
+      it != v1->cells.end(); ++it)
+  {
+    DCell* c = *it;
+    if (c != dcell)
+    {
+      std::size_t matches = 0;
+      for (std::size_t i = 0; i < c->vertices.size(); i++)
+      {
+        if (c->vertices[i] == v1 || c->vertices[i] == v2)
+          matches++;
+      }
+      if (matches == 2)
+        return c;
+    }
+  }
+  return 0;
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::add_vertex(DVertex* v)
+{
+  vertices.push_back(v);
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::add_cell(DCell* c, std::vector<DVertex*> vs,
+                                       int parent_id)
+{
+  for (std::size_t i = 0; i < vs.size(); i++)
+  {
+    DVertex* v = vs[i];
+    c->vertices.push_back(v);
+    v->cells.push_back(c);
+  }
+
+  cells.push_back(c);
+  c->parent_id = parent_id;
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::remove_cell(DCell* c)
+{
+  for (std::size_t i = 0; i < c->vertices.size(); ++i)
+  {
+    DVertex* v = c->vertices[i];
+    v->cells.remove(c);
+  }
+  c->deleted = true;
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::bisect_marked(std::vector<bool> marked_ids)
+{
+  std::list<DCell*> marked_cells;
+  for (std::list<DCell*>::iterator it = cells.begin();
+      it != cells.end(); ++it)
+  {
+    DCell* c = *it;
+    if (marked_ids[c->id])
+      marked_cells.push_back(c);
+  }
+  for (std::list<DCell*>::iterator it = marked_cells.begin();
+      it != marked_cells.end(); ++it)
+  {
+    DCell* c = *it;
+    if(!c->deleted)
+      bisect(c, 0, 0, 0);
+  }
+}
+//-----------------------------------------------------------------------------
+void RivaraRefinement::DMesh::propagate_facets(DCell* dcell, DCell* c0,
+                                               DCell* c1, std::size_t ii,
+                                               std::size_t jj, DVertex* mv)
+{
+  // Initialize local facets
+  std::vector<int> facets0(tdim + 1);
+  std::vector<int> facets1(tdim + 1);
+  for(std::size_t i = 0; i < tdim + 1; i++)
+  {
+    facets0[i] = -2;
+    facets1[i] = -2;
+  }
+
+  // New facets
+  if (mv->id < dcell->vertices[ii]->id)
+    facets0[ii+1] = -1;
+  else
+    facets0[ii] = -1;
+  if (mv->id < dcell->vertices[jj]->id)
+    facets1[jj] = -1;
+  else
+    facets1[jj-1] = -1;
+
+  // Changed facets
+  int c0i = 0;
+  int c1i = 0;
+  for (std::size_t i = 0; i < tdim + 1; i++)
+  {
+    if ( mv->id > c0->vertices[i]->id )
+      c0i++;
+    if ( mv->id > c1->vertices[i]->id )
+      c1i++;
+  }
+  facets0[c0i] = jj;
+  facets1[c1i] = ii;
+
+  // Untouched facets
+  std::vector<int> rest;
+  for (std::size_t i = 0; i < tdim + 1; i++)
+  {
+    if(i != ii && i != jj)
+      rest.push_back(i);
+  }
+  int j = 0, k = 0;
+  for(std::size_t i = 0; i < tdim + 1; i++)
+  {
+    if(facets0[i] == -2)
+      facets0[i] = rest[j++];
+    if(facets1[i] == -2)
+      facets1[i] = rest[k++];
+  }
+
+  // Rewrite facets whenever different that -1
+  //   ( -1 for new, internal facets )
+  for (std::size_t i = 0; i < tdim + 1; i++)
+  {
+    if (facets0[i] != -1)
+      c0->facets.push_back(dcell->facets[facets0[i]]);
+    else
+      c0->facets.push_back(-1);
+
+    if (facets1[i] != -1)
+      c1->facets.push_back(dcell->facets[facets1[i]]);
+    else
+      c1->facets.push_back(-1);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/RivaraRefinement.h b/dolfin/refinement/RivaraRefinement.h
new file mode 100644
index 0000000..a6f1848
--- /dev/null
+++ b/dolfin/refinement/RivaraRefinement.h
@@ -0,0 +1,114 @@
+// Copyright (C) 2008 Johan Jansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Bartosz Sawicki, 2009.
+// Modified by Garth N. Wells, 2010.
+// Modified by Anders Logg, 2010.
+//
+// First added:  2008
+// Last changed: 2011-01-11
+
+#ifndef __RIVARAREFINEMENT_H
+#define __RIVARAREFINEMENT_H
+
+#include <list>
+#include <vector>
+
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include <dolfin/mesh/Cell.h>
+
+namespace dolfin
+{
+  // Forward declarations
+  //class CellType;
+  //class Mesh
+
+  // FIXME: This implementation needs quite a bit of cleanup, in particular
+  // FIXME: the DMesh class. Should be possible to use plain STL data structures
+  // FIXME: in place of the DMesh class.
+
+  class RivaraRefinement
+  {
+
+  public:
+
+    /// Refine simplicial mesh locally by recursive edge bisection
+    static void refine(Mesh& refined_mesh,
+                       const Mesh& mesh,
+                       const MeshFunction<bool>& cell_marker,
+                       MeshFunction<std::size_t>& cell_map,
+                       std::vector<int>& facet_map);
+
+  private:
+
+    class DCell;
+
+    /// Vertex with list of connected cells
+    class DVertex
+    {
+    public:
+      DVertex();
+      int id;
+      std::list<DCell*> cells;
+      Point p;
+    };
+
+    // Cell with parent_id, deletion marker and facets markets
+    class DCell
+    {
+    public:
+      DCell();
+      int id;
+      int parent_id;
+      std::vector<DVertex *> vertices;
+      bool deleted;
+      std::vector<int> facets;
+    };
+
+    // Dynamic mesh for recursive Rivara refinement
+    class DMesh
+    {
+    public:
+
+      DMesh();
+      ~DMesh();
+
+      void add_vertex(DVertex* v);
+      void add_cell(DCell* c, std::vector<DVertex*> vs, int parent_id);
+      void remove_cell(DCell* c);
+      void import_mesh(const Mesh& mesh);
+      void export_mesh(Mesh& mesh, std::vector<int>& new2old_cell, std::vector<int>& new2old_facet);
+      void number();
+      void bisect(DCell* dcell, DVertex* hangv, DVertex* hv0, DVertex* hv1);
+      void bisect_marked(std::vector<bool> marked_ids);
+      DCell* opposite(DCell* dcell, DVertex* v1, DVertex* v2);
+      void propagate_facets(DCell* dcell, DCell* c0, DCell* c1, std::size_t ii, std::size_t jj, DVertex* mv);
+
+      std::list<DVertex*> vertices;
+      std::list<DCell*> cells;
+      const CellType* cell_type;
+      std::size_t tdim;
+      std::size_t gdim;
+
+    };
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/refinement/UniformMeshRefinement.cpp b/dolfin/refinement/UniformMeshRefinement.cpp
new file mode 100644
index 0000000..7015f25
--- /dev/null
+++ b/dolfin/refinement/UniformMeshRefinement.cpp
@@ -0,0 +1,109 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2010
+//
+// First added:  2006-06-08
+// Last changed: 2014-02-06
+
+#include <dolfin/math/dolfin_math.h>
+#include <dolfin/log/dolfin_log.h>
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshTopology.h>
+#include <dolfin/mesh/MeshGeometry.h>
+#include <dolfin/mesh/MeshConnectivity.h>
+#include <dolfin/mesh/MeshEditor.h>
+#include <dolfin/mesh/Vertex.h>
+#include <dolfin/mesh/Edge.h>
+#include <dolfin/mesh/Cell.h>
+#include "UniformMeshRefinement.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+void UniformMeshRefinement::refine(Mesh& refined_mesh,
+                                   const Mesh& mesh)
+{
+  not_working_in_parallel("UniformMeshRefinement::refine");
+
+  log(TRACE, "Refining simplicial mesh uniformly.");
+
+  // Check that refined_mesh and mesh are not the same
+  if (&refined_mesh == &mesh)
+  {
+    dolfin_error("UniformMeshRefinement.cpp",
+                 "refine mesh",
+                 "Refined_mesh and mesh point to the same object");
+  }
+
+  // Generate cell - edge connectivity if not generated
+  mesh.init(mesh.topology().dim(), 1);
+
+  // Generate edge - vertex connectivity if not generated
+  mesh.init(1, 0);
+
+  // Mesh needs to be ordered (so we can pick right combination of vertices/edges)
+  if (!mesh.ordered())
+    dolfin_error("UniformMeshRefinement.cpp",
+                 "refine mesh",
+                 "Mesh is not ordered according to the UFC numbering convention, consider calling mesh.order()");
+
+  // Get cell type
+  const CellType& cell_type = mesh.type();
+
+  // Open new mesh for editing
+  MeshEditor editor;
+  editor.open(refined_mesh, cell_type.cell_type(),
+              mesh.topology().dim(), mesh.geometry().dim());
+
+  // Get size of mesh
+  const std::size_t num_vertices = mesh.size(0);
+  const std::size_t num_edges = mesh.size(1);
+  const std::size_t num_cells = mesh.size(mesh.topology().dim());
+
+  // Specify number of vertices and cells
+  editor.init_vertices_global(num_vertices + num_edges, num_vertices + num_edges);
+  editor.init_cells_global(ipow(2, mesh.topology().dim())*num_cells,
+                           ipow(2, mesh.topology().dim())*num_cells);
+
+  // Add old vertices
+  std::size_t vertex = 0;
+  for (VertexIterator v(mesh); !v.end(); ++v)
+  {
+    editor.add_vertex(vertex, v->point());
+    vertex++;
+  }
+
+  // Add new vertices
+  for (EdgeIterator e(mesh); !e.end(); ++e)
+  {
+    editor.add_vertex(vertex, e->midpoint());
+    vertex++;
+  }
+
+  // Add cells
+  std::size_t current_cell = 0;
+  for (CellIterator c(mesh); !c.end(); ++c)
+    cell_type.refine_cell(*c, editor, current_cell);
+
+  // Close editor
+  editor.close();
+
+  // Make sure that mesh is ordered after refinement
+  //refined_mesh.order();
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/UniformMeshRefinement.h b/dolfin/refinement/UniformMeshRefinement.h
new file mode 100644
index 0000000..ae62b8a
--- /dev/null
+++ b/dolfin/refinement/UniformMeshRefinement.h
@@ -0,0 +1,44 @@
+// Copyright (C) 2006-2010 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2010
+//
+// First added:  2006-06-07
+// Last changed: 2010-02-26
+
+#ifndef __UNIFORM_MESH_REFINEMENT_H
+#define __UNIFORM_MESH_REFINEMENT_H
+
+namespace dolfin
+{
+
+  class Mesh;
+
+  /// This class implements uniform mesh refinement.
+
+  class UniformMeshRefinement
+  {
+  public:
+
+    /// Refine mesh uniformly
+    static void refine(Mesh& refined_mesh, const Mesh& mesh);
+
+  };
+
+}
+
+#endif
diff --git a/dolfin/refinement/dolfin_refinement.h b/dolfin/refinement/dolfin_refinement.h
new file mode 100644
index 0000000..3ad43c5
--- /dev/null
+++ b/dolfin/refinement/dolfin_refinement.h
@@ -0,0 +1,8 @@
+#ifndef __DOLFIN_REFINEMENT_H
+#define __DOLFIN_REFINEMENT_H
+
+// DOLFIN mesh refinement interface
+
+#include <dolfin/refinement/refine.h>
+
+#endif
diff --git a/dolfin/refinement/refine.cpp b/dolfin/refinement/refine.cpp
new file mode 100644
index 0000000..401344e
--- /dev/null
+++ b/dolfin/refinement/refine.cpp
@@ -0,0 +1,96 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010-2011.
+//
+// First added:  2010-02-10
+// Last changed: 2013-01-13
+
+#include <dolfin/mesh/Mesh.h>
+#include <dolfin/mesh/MeshFunction.h>
+#include "UniformMeshRefinement.h"
+#include "LocalMeshRefinement.h"
+#include "ParallelRefinement2D.h"
+#include "ParallelRefinement3D.h"
+#include "refine.h"
+
+using namespace dolfin;
+
+//-----------------------------------------------------------------------------
+dolfin::Mesh dolfin::refine(const Mesh& mesh, bool redistribute)
+{
+  Mesh refined_mesh;
+  refine(refined_mesh, mesh, redistribute);
+  return refined_mesh;
+}
+//-----------------------------------------------------------------------------
+void dolfin::refine(Mesh& refined_mesh, const Mesh& mesh, bool redistribute)
+{
+  // Topological dimension
+  const std::size_t D = mesh.topology().dim();
+
+  // Dispatch to appropriate refinement function
+  if(MPI::size(mesh.mpi_comm()) == 1)
+    UniformMeshRefinement::refine(refined_mesh, mesh);
+  else if(D == 2)
+    ParallelRefinement2D::refine(refined_mesh, mesh, redistribute);
+  else if(D == 3)
+    ParallelRefinement3D::refine(refined_mesh, mesh, redistribute);
+  else
+  {
+    dolfin_error("refine.cpp",
+                 "refine mesh",
+                 "Cannot refine mesh of topological dimension %d in parallel. Only 2D and 3D supported", D);
+  }
+}
+//-----------------------------------------------------------------------------
+dolfin::Mesh dolfin::refine(const Mesh& mesh,
+                            const MeshFunction<bool>& cell_markers,
+                            bool redistribute)
+{
+  Mesh refined_mesh;
+  refine(refined_mesh, mesh, cell_markers, redistribute);
+  return refined_mesh;
+}
+//-----------------------------------------------------------------------------
+void dolfin::refine(Mesh& refined_mesh, const Mesh& mesh,
+                    const MeshFunction<bool>& cell_markers, bool redistribute)
+{
+  // Topological dimension
+  const std::size_t D = mesh.topology().dim();
+
+  // Dispatch to appropriate refinement function
+  if (MPI::size(mesh.mpi_comm()) == 1)
+    LocalMeshRefinement::refine(refined_mesh, mesh, cell_markers);
+  else if (D == 2)
+  {
+    ParallelRefinement2D::refine(refined_mesh, mesh, cell_markers,
+                                 redistribute);
+  }
+  else if (D == 3)
+  {
+    ParallelRefinement3D::refine(refined_mesh, mesh, cell_markers,
+                                 redistribute);
+  }
+  else
+  {
+    dolfin_error("refine.cpp",
+                 "refine mesh",
+                 "Cannot refine mesh of topological dimension %d in parallel. Only 2D and 3D supported", D);
+  }
+}
+//-----------------------------------------------------------------------------
diff --git a/dolfin/refinement/refine.h b/dolfin/refinement/refine.h
new file mode 100644
index 0000000..fb7b583
--- /dev/null
+++ b/dolfin/refinement/refine.h
@@ -0,0 +1,120 @@
+// Copyright (C) 2010 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2010.
+//
+// First added:  2010-02-10
+// Last changed: 2013-05-12
+//
+// This file defines free functions for mesh refinement.
+//
+
+#ifndef __DOLFIN_REFINE_H
+#define __DOLFIN_REFINE_H
+
+namespace dolfin
+{
+
+  // Forward declarations
+  class Mesh;
+  template <typename T> class MeshFunction;
+
+  /// Create uniformly refined mesh
+  ///
+  /// *Arguments*
+  ///     mesh (_Mesh_)
+  ///         The mesh to refine.
+  ///     redistribute (_bool_)
+  ///         Optional argument to redistribiute the refined mesh if mesh is a
+  ///         distributed mesh.
+  ///
+  /// *Returns*
+  ///     _Mesh_
+  ///         The refined mesh.
+  ///
+  /// *Example*
+  ///     .. code-block:: c++
+  ///
+  ///         mesh = refine(mesh);
+  ///
+  Mesh refine(const Mesh& mesh, bool redistribute = true);
+
+  /// Create uniformly refined mesh
+  ///
+  /// *Arguments*
+  ///     refined_mesh (_Mesh_)
+  ///         The mesh that will be the refined mesh.
+  ///     mesh (_Mesh_)
+  ///         The original mesh.
+  ///     redistribute (_bool_)
+  ///         Optional argument to redistribiute the refined mesh if mesh is a
+  ///         distributed mesh.
+  void refine(Mesh& refined_mesh, const Mesh& mesh,
+              bool redistribute = true);
+
+  /// Create locally refined mesh
+  ///
+  /// *Arguments*
+  ///     mesh (_Mesh_)
+  ///         The mesh to refine.
+  ///     cell_markers (_MeshFunction_ <bool>)
+  ///         A mesh function over booleans specifying which cells
+  ///         that should be refined (and which should not).
+  ///     redistribute (_bool_)
+  ///         Optional argument to redistribiute the refined mesh if mesh is a
+  ///         distributed mesh.
+  ///
+  /// *Returns*
+  ///     _Mesh_
+  ///         The locally refined mesh.
+  ///
+  /// *Example*
+  ///     .. code-block:: c++
+  ///
+  ///         CellFunction<bool> cell_markers(mesh);
+  ///         cell_markers.set_all(false);
+  ///         Point origin(0.0, 0.0, 0.0);
+  ///         for (CellIterator cell(mesh); !cell.end(); ++cell)
+  ///         {
+  ///             Point p = cell->midpoint();
+  ///             if (p.distance(origin) < 0.1)
+  ///                 cell_markers[*cell] = true;
+  ///         }
+  ///         mesh = refine(mesh, cell_markers);
+  ///
+  Mesh refine(const Mesh& mesh, const MeshFunction<bool>& cell_markers,
+              bool redistribute = true);
+
+  /// Create locally refined mesh
+  ///
+  /// *Arguments*
+  ///     refined_mesh (_Mesh_)
+  ///         The mesh that will be the refined mesh.
+  ///     mesh (_Mesh_)
+  ///         The original mesh.
+  ///     cell_markers (_MeshFunction_ <bool>)
+  ///         A mesh function over booleans specifying which cells
+  ///         that should be refined (and which should not).
+  ///     redistribute (_bool_)
+  ///         Optional argument to redistribiute the refined mesh if mesh is a
+  ///         distributed mesh.
+  void refine(Mesh& refined_mesh, const Mesh& mesh,
+              const MeshFunction<bool>& cell_markers, bool redistribute = true);
+
+}
+
+#endif
diff --git a/dolfin/swig/CMakeLists.txt b/dolfin/swig/CMakeLists.txt
new file mode 100644
index 0000000..c167421
--- /dev/null
+++ b/dolfin/swig/CMakeLists.txt
@@ -0,0 +1,131 @@
+project(swig)
+
+set(CMAKE_INSTALL_RPATH_USE_LINK_PATH TRUE)
+
+# Remove '-Werror', '-Wall' and 'pedantic' flags (if present) when compiling SWIG-generated files
+string(REGEX REPLACE "-Wall" " " CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+string(REGEX REPLACE "-Wall" " " CMAKE_CXX_FLAGS_DEVELOPER "${CMAKE_CXX_FLAGS_DEVELOPER}")
+string(REGEX REPLACE "-Werror=format-security" " " CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+string(REGEX REPLACE "-Werror=format-security" " " CMAKE_CXX_FLAGS_DEVELOPER "${CMAKE_CXX_FLAGS_DEVELOPER}")
+string(REGEX REPLACE "-Werror" " " CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+string(REGEX REPLACE "-Werror" " " CMAKE_CXX_FLAGS_DEVELOPER "${CMAKE_CXX_FLAGS_DEVELOPER}")
+string(REGEX REPLACE "-pedantic" " " CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+string(REGEX REPLACE "-pedantic" " " CMAKE_CXX_FLAGS_DEVELOPER "${CMAKE_CXX_FLAGS_DEVELOPER}")
+
+# Prevent Intel compiler emitting warnings for SWIG-generated code
+if("${CMAKE_CXX_COMPILER_ID}" STREQUAL "Intel")
+  if("${CMAKE_CXX_COMPILER_VERSION}" LESS "13")
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -wd186")
+    set(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} -wd186")
+    set(CMAKE_CXX_FLAGS_DEVELOPER "${CMAKE_CXX_FLAGS_DEVELOPER} -wd186")
+    set(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -wd186")
+    set(CMAKE_CXX_FLAGS_RELWITHDEBINFO "${CMAKE_CXX_FLAGS_RELWITHDEBINFO} -wd186")
+  endif()
+endif()
+
+# Set common include directoris
+include_directories(${NUMPY_INCLUDE_DIR} ${PYTHON_INCLUDE_DIRS} ${CMAKE_BINARY_DIR})
+
+# Set numpy version define
+set(DOLFIN_PYTHON_DEFINITIONS ${DOLFIN_PYTHON_DEFINITIONS} -DNUMPY_VERSION_MAJOR=${NUMPY_VERSION_MAJOR} -DNUMPY_VERSION_MINOR=${NUMPY_VERSION_MINOR} -DNUMPY_VERSION_MICRO=${NUMPY_VERSION_MICRO})
+
+# Only set define for none depricated API for NUMPY version 1.7 and larger
+if(NUMPY_VERSION VERSION_GREATER 1.6.2)
+  set(DOLFIN_PYTHON_DEFINITIONS ${DOLFIN_PYTHON_DEFINITIONS} -DNPY_NO_DEPRECATED_API=NPY_${NUMPY_VERSION_MAJOR}_${NUMPY_VERSION_MINOR}_API_VERSION)
+endif()
+
+add_definitions(${DOLFIN_PYTHON_DEFINITIONS})
+
+# Check that swig interface is generated, otherwise re-generate it
+if (NOT EXISTS ${CMAKE_CURRENT_BINARY_DIR}/modules)
+  message(STATUS "")
+  message(STATUS "Generating SWIG interface.")
+  message(STATUS "--------------------------")
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-swig-interface ${CMAKE_BINARY_DIR}
+    WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR})
+  execute_process(
+    COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-swig-docstrings ${CMAKE_BINARY_DIR}
+    WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR})
+endif()
+
+# Get combined modules
+file(GLOB COMBINED_MODULES RELATIVE ${CMAKE_CURRENT_BINARY_DIR} ${CMAKE_CURRENT_BINARY_DIR}/modules/*)
+
+# Sort and reverse the list so la combined module comes early
+list(SORT COMBINED_MODULES)
+list(REVERSE COMBINED_MODULES)
+
+# Get all orginal interface files
+file(GLOB_RECURSE ORIGINAL_INTERFACE_FILES ${CMAKE_CURRENT_SOURCE_DIR}/*.i)
+
+# Target to copy all swig files from source to build directory
+add_custom_target(copy_swig_files
+  COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/copy-swig-files ${CMAKE_BINARY_DIR}
+  DEPENDS ${ORIGINAL_INTERFACE_FILES}
+  )
+
+# Target to generate all swig interface files
+add_custom_target(generate_swig_files
+  COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-swig-interface ${CMAKE_BINARY_DIR}
+  COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-swig-docstrings ${CMAKE_BINARY_DIR}
+  WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR}
+  COMMENT "Generating all SWIG interface files"
+  )
+
+# Target to generate swig interface files
+add_custom_target(generate_swig_interface
+  COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-swig-interface ${CMAKE_BINARY_DIR}
+  WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR}
+  COMMENT "Generating SWIG interface files"
+  )
+
+# Target to generate swig docstring files
+add_custom_target(generate_swig_docstrings
+  COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-swig-docstrings ${CMAKE_BINARY_DIR}
+  WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR}
+  COMMENT "Generating SWIG docstring files from C++ headers"
+  )
+
+# Target to generate swig docstring files with debug
+add_custom_target(generate_swig_docstrings_with_debug
+  COMMAND ${PYTHON_EXECUTABLE} ${DOLFIN_SOURCE_DIR}/cmake/scripts/generate-swig-docstrings ${CMAKE_BINARY_DIR} DEBUG
+  WORKING_DIRECTORY ${DOLFIN_SOURCE_DIR}
+  COMMENT "Generating SWIG docstring files from C++ headers (DEBUG modus)"
+  )
+
+# Iterate over the combined modules and add each as a target
+foreach(COMBINED_MODULE_DIR ${COMBINED_MODULES})
+  add_subdirectory(${CMAKE_CURRENT_BINARY_DIR}/${COMBINED_MODULE_DIR} ${CMAKE_CURRENT_BINARY_DIR}/${COMBINED_MODULE_DIR})
+endforeach()
+
+# List of files which should not be installed
+set(NOT_INSTALL )
+
+# Iterate over each sub module and add install targets
+foreach(MODULE_DIR ${DOLFIN_DIRS})
+
+  # Install pre.i if exists
+  if (EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/${MODULE_DIR}/pre.i)
+    install(FILES
+      ${CMAKE_CURRENT_SOURCE_DIR}/${MODULE_DIR}/pre.i
+      DESTINATION
+      ${DOLFIN_INCLUDE_DIR}/dolfin/swig/${MODULE_DIR}
+      COMPONENT Development)
+  endif()
+
+endforeach()
+
+# Add global interface files
+file(GLOB GLOBAL_INTERFACE_FILES ${CMAKE_CURRENT_SOURCE_DIR}/*.i)
+install(FILES ${GLOBAL_INTERFACE_FILES}
+  DESTINATION ${DOLFIN_INCLUDE_DIR}/dolfin/swig
+  COMPONENT Development
+  )
+
+# Add global typemap interface files
+file(GLOB TYPEMAP_FILES ${CMAKE_CURRENT_SOURCE_DIR}/typemaps/*.i)
+install(FILES ${TYPEMAP_FILES}
+  DESTINATION ${DOLFIN_INCLUDE_DIR}/dolfin/swig/typemaps
+  COMPONENT Development
+  )
diff --git a/dolfin/swig/README b/dolfin/swig/README
new file mode 100644
index 0000000..172c7bf
--- /dev/null
+++ b/dolfin/swig/README
@@ -0,0 +1,60 @@
+Automatic regeneration of SWIG interface
+========================================
+
+The SWIG interface of DOLFIN is partly generated automatically. If it
+has not been generated it will be generate automatically by the build
+system. Whenever you add a file see, below you need to re-generate the
+swig interface manually, by running:
+
+  make generate_swig_interface
+
+from the build directory.
+
+Extending the swig interface with new classes or functions
+==========================================================
+
+SWIG parses header files to generate the Python interface. To add new
+classes or function, the header file that declares the functionality,
+needs to be exposed to SWIG. This is done by adding the file as an
+#include to the corresponding
+
+  dolfin/{la,function,aso}/dolfin_{la,function,aso}.h
+
+file. Then you need to regenerate the SWIG interface by running
+generate-swig-interface.
+
+CMake might have trouble figuring out that something has been added,
+so to force a recompilation of the SWIG interface you can remove the
+generated files in the build directory.
+
+  rm -rf build/dolfin/swig/modules
+
+
+Modularized interface
+=====================
+
+Submodules
+----------
+
+The SWIG interface is divided into several submodules, each corresponding
+to the directory structure of DOLFIN. SWIG specialization files resides
+in a subdirectory with the same name as the submodule. Most common are
+pre.i and post.i files, which are include before and after the header
+files of the corresponding module.
+
+  * When ever a dolfin/foo subdirectory is added to DOLFIN a
+    corresponding dolfin/swig/foo subdirectory need to be added
+
+Combined modules
+----------------
+
+A combined module consist of the interface of one or several modules,
+mention above. What modules are included in a combined modules is defined
+by the comments in the main dolfin.h file. 
+
+  * If a combined module is added/removed, the corresponding
+    subdirectory needs to be added/removed too.
+
+  * If a combined module is added a CMakeList.txt need to be added to
+    that directory. These are all module independent so just copy one
+    from another directory.
diff --git a/dolfin/swig/adaptivity/docstrings.i b/dolfin/swig/adaptivity/docstrings.i
new file mode 100644
index 0000000..e8aeec1
--- /dev/null
+++ b/dolfin/swig/adaptivity/docstrings.i
@@ -0,0 +1,956 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=adaptivity, header=GenericAdaptiveVariationalSolver.h)
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver "
+An abstract class for goal-oriented adaptive solution of
+variational problems.
+
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::solve "
+Solve such that the functional error is less than the given
+tolerance. Note that each call to solve is based on the
+leaf-node of the variational problem
+
+*Arguments*
+    tol (float)
+        The error tolerance
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::solve_primal "
+Solve the primal problem. Must be overloaded in subclass.
+
+*Returns*
+    :py:class:`Function`
+        The solution to the primal problem
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::extract_bcs "
+Extract the boundary conditions for the primal problem. Must
+be overloaded in subclass.
+
+*Returns*
+    list of :py:class:`DirichletBC`
+        The primal boundary conditions
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::evaluate_goal "
+Evaluate the goal functional. Must be overloaded in subclass.
+
+*Arguments*
+   M (:py:class:`Form`)
+       The functional to be evaluated
+   u (:py:class:`Function`)
+       The function of which to evaluate the functional
+
+*Returns*
+    float
+        The value of M evaluated at u
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::adapt_problem "
+Adapt the problem to other mesh. Must be overloaded in subclass.
+
+*Arguments*
+   mesh (:py:class:`Mesh`)
+       The other mesh
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::adaptive_data "
+Return stored adaptive data
+
+*Returns*
+   list of :py:class:`Parameters`
+       The data stored in the adaptive loop
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::default_parameters "
+Default parameter values:
+
+    \"max_iterations\"     (int)
+    \"max_dimension\"      (int)
+    \"plot_mesh\"          (bool)
+    \"save_data\"          (bool)
+    \"data_label\"         (std::string)
+    \"reference\"          (double)
+    \"marking_strategy\"   (std::string)
+    \"marking_fraction\"   (double)
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::summary "
+Present summary of all adaptive data and parameters
+";
+
+%feature("docstring")  dolfin::GenericAdaptiveVariationalSolver::num_dofs_primal "
+Return the number of degrees of freedom for primal problem
+
+*Returns*
+    _std::size_t_
+        The number of degrees of freedom
+";
+
+// Documentation extracted from: (module=adaptivity, header=AdaptiveLinearVariationalSolver.h)
+%feature("docstring")  dolfin::AdaptiveLinearVariationalSolver "
+A class for goal-oriented adaptive solution of linear
+variational problems.
+
+For a linear variational problem of the form: find u in V
+satisfying
+
+    a(u, v) = L(v) for all v in :math:`\hat V`
+
+and a corresponding conforming discrete problem: find u_h in V_h
+satisfying
+
+    a(u_h, v) = L(v) for all v in :math:`\hat V_h`
+
+and a given goal functional M and tolerance tol, the aim is to
+find a V_H and a u_H in V_H satisfying the discrete problem such
+that
+
+    \|M(u) - M(u_H)\| < tol
+
+This strategy is based on dual-weighted residual error
+estimators designed and automatically generated for the primal
+problem and subsequent h-adaptivity.
+";
+
+%feature("docstring")  dolfin::AdaptiveLinearVariationalSolver::AdaptiveLinearVariationalSolver "
+**Overloaded versions**
+
+* AdaptiveLinearVariationalSolver\ (problem, goal)
+
+  Create AdaptiveLinearVariationalSolver
+  
+  *Arguments*
+      problem (:py:class:`LinearVariationalProblem`)
+          The primal problem
+      goal (:py:class:`GoalFunctional`)
+          The goal functional
+
+* AdaptiveLinearVariationalSolver\ (problem, goal)
+
+  Create AdaptiveLinearVariationalSolver (shared ptr version)
+  
+  *Arguments*
+      problem (:py:class:`LinearVariationalProblem`)
+          The primal problem
+      goal (:py:class:`GoalFunctional`)
+          The goal functional
+
+* AdaptiveLinearVariationalSolver\ (problem, goal, control)
+
+  Create AdaptiveLinearVariationalSolver from variational
+  problem, goal form and error control instance
+  
+  *Arguments*
+      problem (:py:class:`LinearVariationalProblem`)
+          The primal problem
+      goal (:py:class:`Form`)
+          The goal functional
+      control (:py:class:`ErrorControl`)
+          An error controller object
+";
+
+%feature("docstring")  dolfin::AdaptiveLinearVariationalSolver::solve_primal "
+Solve the primal problem.
+
+*Returns*
+    :py:class:`Function`
+        The solution to the primal problem
+";
+
+%feature("docstring")  dolfin::AdaptiveLinearVariationalSolver::extract_bcs "
+Extract the boundary conditions for the primal problem.
+
+*Returns*
+    list of :py:class:`DirichletBC`
+        The primal boundary conditions
+";
+
+%feature("docstring")  dolfin::AdaptiveLinearVariationalSolver::evaluate_goal "
+Evaluate the goal functional.
+
+*Arguments*
+   M (:py:class:`Form`)
+       The functional to be evaluated
+   u (:py:class:`Function`)
+       The function at which to evaluate the functional
+
+*Returns*
+    float
+        The value of M evaluated at u
+";
+
+%feature("docstring")  dolfin::AdaptiveLinearVariationalSolver::adapt_problem "
+Adapt the problem to other mesh.
+
+*Arguments*
+   mesh (:py:class:`Mesh`)
+       The other mesh
+";
+
+%feature("docstring")  dolfin::AdaptiveLinearVariationalSolver::num_dofs_primal "
+Return the number of degrees of freedom for primal problem
+
+*Returns*
+    _std::size_t_
+        The number of degrees of freedom
+";
+
+%feature("docstring")  dolfin::AdaptiveLinearVariationalSolver::init "
+Helper function for instance initialization
+
+*Arguments*
+   problem (:py:class:`LinearVariationalProblem`)
+       The primal problem
+   u (:py:class:`GoalFunctional`)
+       The goal functional
+";
+
+// Documentation extracted from: (module=adaptivity, header=AdaptiveNonlinearVariationalSolver.h)
+%feature("docstring")  dolfin::AdaptiveNonlinearVariationalSolver "
+A class for goal-oriented adaptive solution of nonlinear
+variational problems.
+
+For a nonlinear variational problem of the form: find u in V
+satisfying
+
+    F(u; v) = 0 for all v in :math:`\hat V`
+
+and a corresponding conforming discrete problem: find u_h in V_h
+satisfying (at least approximately)
+
+    F(u_h; v) = 0 for all v in :math:`\hat V_h`
+
+and a given goal functional M and tolerance tol, the aim is to
+find a V_H and a u_H in V_H satisfying the discrete problem such
+that
+
+    \|M(u) - M(u_H)\| < tol
+
+This strategy is based on dual-weighted residual error
+estimators designed and automatically generated for the primal
+problem and subsequent h-adaptivity.
+";
+
+%feature("docstring")  dolfin::AdaptiveNonlinearVariationalSolver::AdaptiveNonlinearVariationalSolver "
+**Overloaded versions**
+
+* AdaptiveNonlinearVariationalSolver\ (problem, goal)
+
+  Create AdaptiveNonlinearVariationalSolver
+  
+  *Arguments*
+      problem (:py:class:`NonlinearVariationalProblem`)
+          The primal problem
+      goal (:py:class:`GoalFunctional`)
+          The goal functional
+
+* AdaptiveNonlinearVariationalSolver\ (problem, goal)
+
+  Create AdaptiveNonlinearVariationalSolver (shared ptr version)
+  
+  *Arguments*
+      problem (:py:class:`NonlinearVariationalProblem`)
+          The primal problem
+      goal (:py:class:`GoalFunctional`)
+          The goal functional
+
+* AdaptiveNonlinearVariationalSolver\ (problem, goal, control)
+
+  Create AdaptiveLinearVariationalSolver from variational
+  problem, goal form and error control instance
+  
+  *Arguments*
+      problem (:py:class:`NonlinearVariationalProblem`)
+          The primal problem
+      goal (:py:class:`Form`)
+          The goal functional
+      control (:py:class:`ErrorControl`)
+          An error controller object
+";
+
+%feature("docstring")  dolfin::AdaptiveNonlinearVariationalSolver::solve_primal "
+Solve the primal problem.
+
+*Returns*
+    :py:class:`Function`
+        The solution to the primal problem
+";
+
+%feature("docstring")  dolfin::AdaptiveNonlinearVariationalSolver::extract_bcs "
+Extract the boundary conditions for the primal problem.
+
+*Returns*
+    list of :py:class:`DirichletBC`
+        The primal boundary conditions
+";
+
+%feature("docstring")  dolfin::AdaptiveNonlinearVariationalSolver::evaluate_goal "
+Evaluate the goal functional.
+
+*Arguments*
+   M (:py:class:`Form`)
+       The functional to be evaluated
+   u (:py:class:`Function`)
+       The function at which to evaluate the functional
+
+*Returns*
+    float
+        The value of M evaluated at u
+";
+
+%feature("docstring")  dolfin::AdaptiveNonlinearVariationalSolver::adapt_problem "
+Adapt the problem to other mesh.
+
+*Arguments*
+   mesh (:py:class:`Mesh`)
+       The other mesh
+";
+
+%feature("docstring")  dolfin::AdaptiveNonlinearVariationalSolver::num_dofs_primal "
+Return the number of degrees of freedom for primal problem
+
+*Returns*
+    _std::size_t_
+        The number of degrees of freedom
+";
+
+%feature("docstring")  dolfin::AdaptiveNonlinearVariationalSolver::init "
+Helper function for instance initialization
+
+*Arguments*
+   problem (:py:class:`NonlinearVariationalProblem`)
+       The primal problem
+   u (:py:class:`GoalFunctional`)
+       The goal functional
+";
+
+// Documentation extracted from: (module=adaptivity, header=GoalFunctional.h)
+%feature("docstring")  dolfin::GoalFunctional "
+A :py:class:`GoalFunctional` is a :py:class:`Form` of rank 0 with an associated
+:py:class:`ErrorControl`.
+";
+
+%feature("docstring")  dolfin::GoalFunctional::GoalFunctional "
+Create :py:class:`GoalFunctional`
+
+*Arguments*
+    rank (int)
+        the rank of the functional (should be 0)
+    num_coefficients (int)
+        the number of coefficients in functional
+";
+
+%feature("docstring")  dolfin::GoalFunctional::update_ec "
+Update error control instance with given forms
+
+*Arguments*
+    a (:py:class:`Form`)
+        a bilinear form
+    L (:py:class:`Form`)
+        a linear form
+";
+
+// Documentation extracted from: (module=adaptivity, header=ErrorControl.h)
+%feature("docstring")  dolfin::ErrorControl "
+(Goal-oriented) Error Control class.
+The notation used here follows the notation in \"Automated
+goal-oriented error control I: stationary variational problems\",
+ME Rognes and A Logg, 2010-2011.
+";
+
+%feature("docstring")  dolfin::ErrorControl::ErrorControl "
+Create error control object
+
+*Arguments*
+    a_star (:py:class:`Form`)
+       the bilinear form for the dual problem
+    L_star (:py:class:`Form`)
+       the linear form for the dual problem
+    residual (:py:class:`Form`)
+       a functional for the residual (error estimate)
+    a_R_T (:py:class:`Form`)
+       the bilinear form for the strong cell residual problem
+    L_R_T (:py:class:`Form`)
+       the linear form for the strong cell residual problem
+    a_R_dT (:py:class:`Form`)
+       the bilinear form for the strong facet residual problem
+    L_R_dT (:py:class:`Form`)
+       the linear form for the strong facet residual problem
+    eta_T (:py:class:`Form`)
+       a linear form over DG_0 for error indicators
+    is_linear (bool)
+       true iff primal problem is linear
+";
+
+%feature("docstring")  dolfin::ErrorControl::default_parameters "
+Default parameter values:
+";
+
+%feature("docstring")  dolfin::ErrorControl::estimate_error "
+Estimate the error relative to the goal M of the discrete
+approximation 'u' relative to the variational formulation by
+evaluating the weak residual at an approximation to the dual
+solution.
+
+*Arguments*
+    u (:py:class:`Function`)
+       the primal approximation
+
+    bcs (list of :py:class:`DirichletBC`)
+        the primal boundary conditions
+
+*Returns*
+    float
+        error estimate
+";
+
+%feature("docstring")  dolfin::ErrorControl::compute_indicators "
+Compute error indicators
+
+*Arguments*
+    indicators (:py:class:`MeshFunction`)
+        the error indicators (to be computed)
+
+    u (:py:class:`Function`)
+        the primal approximation
+";
+
+%feature("docstring")  dolfin::ErrorControl::residual_representation "
+Compute strong representation (strong cell and facet
+residuals) of the weak residual.
+
+*Arguments*
+    R_T (:py:class:`Function`)
+        the strong cell residual (to be computed)
+
+    R_dT (:py:class:`SpecialFacetFunction`)
+        the strong facet residual (to be computed)
+
+    u (:py:class:`Function`)
+        the primal approximation
+";
+
+%feature("docstring")  dolfin::ErrorControl::compute_cell_residual "
+Compute representation for the strong cell residual
+from the weak residual
+
+*Arguments*
+    R_T (:py:class:`Function`)
+        the strong cell residual (to be computed)
+
+    u (:py:class:`Function`)
+        the primal approximation
+";
+
+%feature("docstring")  dolfin::ErrorControl::compute_facet_residual "
+Compute representation for the strong facet residual from the
+weak residual and the strong cell residual
+
+*Arguments*
+    R_dT (:py:class:`SpecialFacetFunction`)
+        the strong facet residual (to be computed)
+
+    u (:py:class:`Function`)
+        the primal approximation
+
+    R_T (:py:class:`Function`)
+        the strong cell residual
+";
+
+%feature("docstring")  dolfin::ErrorControl::compute_dual "
+Compute dual approximation defined by dual variational
+problem and dual boundary conditions given by homogenized primal
+boundary conditions.
+
+*Arguments*
+    z (:py:class:`Function`)
+        the dual approximation (to be computed)
+
+    bcs (list of :py:class:`DirichletBC`)
+        the primal boundary conditions
+";
+
+%feature("docstring")  dolfin::ErrorControl::compute_extrapolation "
+Compute extrapolation with boundary conditions
+
+*Arguments*
+    z (:py:class:`Function`)
+        the extrapolated function (to be computed)
+
+    bcs (list of :py:class:`DirichletBC`)
+        the dual boundary conditions
+";
+
+// Documentation extracted from: (module=adaptivity, header=Extrapolation.h)
+%feature("docstring")  dolfin::Extrapolation "
+This class implements an algorithm for extrapolating a function
+on a given function space from an approximation of that function
+on a possibly lower-order function space.
+
+This can be used to obtain a higher-order approximation of a
+computed dual solution, which is necessary when the computed
+dual approximation is in the test space of the primal problem,
+thereby being orthogonal to the residual.
+
+It is assumed that the extrapolation is computed on the same
+mesh as the original function.
+";
+
+%feature("docstring")  dolfin::Extrapolation::extrapolate "
+Compute extrapolation w from v
+";
+
+// Documentation extracted from: (module=adaptivity, header=LocalAssembler.h)
+%feature("docstring")  dolfin::LocalAssembler "
+
+";
+
+%feature("docstring")  dolfin::LocalAssembler::assemble "
+
+";
+
+%feature("docstring")  dolfin::LocalAssembler::assemble_cell "
+
+";
+
+%feature("docstring")  dolfin::LocalAssembler::assemble_exterior_facet "
+
+";
+
+%feature("docstring")  dolfin::LocalAssembler::assemble_interior_facet "
+
+";
+
+// Documentation extracted from: (module=adaptivity, header=TimeSeries.h)
+%feature("docstring")  dolfin::TimeSeries "
+This class stores a time series of objects to file(s) in a
+binary format which is efficient for reading and writing.
+
+When objects are retrieved, the object stored at the time
+closest to the given time will be used.
+
+A new time series will check if values have been stored to
+file before (for a series with the same name) and in that
+case reuse those values. If new values are stored, old
+values will be cleared.
+";
+
+%feature("docstring")  dolfin::TimeSeries::TimeSeries "
+Create empty time series
+
+*Arguments*
+    name (str)
+        The time series name
+    compressed (bool)
+        Use compressed file format (default false)
+    store_connectivity (bool)
+        Store all computed connectivity (default false)
+";
+
+%feature("docstring")  dolfin::TimeSeries::store "
+**Overloaded versions**
+
+* store\ (vector, t)
+
+  Store vector at given time
+  
+  *Arguments*
+      vector (:py:class:`GenericVector`)
+          The vector to be stored.
+      t (float)
+          The time.
+
+* store\ (mesh, t)
+
+  Store mesh at given time
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to be stored.
+      t (float)
+          The time.
+";
+
+%feature("docstring")  dolfin::TimeSeries::retrieve "
+**Overloaded versions**
+
+* retrieve\ (vector, t, interpolate=true)
+
+  Retrieve vector at given time
+  
+  *Arguments*
+      vector (:py:class:`GenericVector`)
+          The vector (values to be retrieved).
+      t (float)
+          The time.
+      interpolate (bool)
+          Optional argument: If true (default), interpolate
+          time samples closest to t if t is not present.
+
+* retrieve\ (mesh, t)
+
+  Retrieve mesh at given time
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh (values to be retrieved).
+      t (float)
+          The time.
+";
+
+%feature("docstring")  dolfin::TimeSeries::vector_times "
+Return array of sample times for vectors
+
+*Returns*
+    numpy.array(float)
+        The times.
+";
+
+%feature("docstring")  dolfin::TimeSeries::mesh_times "
+Return array of sample times for meshes
+
+*Returns*
+    numpy.array(float)
+        The times.
+";
+
+%feature("docstring")  dolfin::TimeSeries::clear "
+Clear time series
+";
+
+%feature("docstring")  dolfin::TimeSeries::filename_data "
+Return filename for data
+
+*Arguments*
+    series_name (str)
+        The time series name
+    type_name (str)
+        The type of data
+    index (int)
+        The index
+    compressed (bool)
+        True if compressed file format
+
+*Returns*
+    str
+        The filename
+";
+
+%feature("docstring")  dolfin::TimeSeries::filename_times "
+Return filename for times
+
+*Arguments*
+    series_name (str)
+        The time series name
+    type_name (str)
+        The type of data
+    compressed (bool)
+        True if compressed file format
+
+*Returns*
+    str
+        The filename
+";
+
+%feature("docstring")  dolfin::TimeSeries::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::TimeSeries::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=adaptivity, header=TimeSeriesHDF5.h)
+%feature("docstring")  dolfin::TimeSeriesHDF5 "
+This class stores a time series of objects to file(s) in a
+binary format which is efficient for reading and writing.
+
+When objects are retrieved, the object stored at the time
+closest to the given time will be used.
+
+A new time series will check if values have been stored to
+file before (for a series with the same name) and in that
+case reuse those values. If new values are stored, old
+values will be cleared.
+";
+
+%feature("docstring")  dolfin::TimeSeriesHDF5::TimeSeriesHDF5 "
+Create empty time series
+
+*Arguments*
+    name (str)
+        The time series name
+";
+
+%feature("docstring")  dolfin::TimeSeriesHDF5::store "
+**Overloaded versions**
+
+* store\ (vector, t)
+
+  Store vector at given time
+  
+  *Arguments*
+      vector (:py:class:`GenericVector`)
+          The vector to be stored.
+      t (float)
+          The time.
+
+* store\ (mesh, t)
+
+  Store mesh at given time
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to be stored.
+      t (float)
+          The time.
+";
+
+%feature("docstring")  dolfin::TimeSeriesHDF5::retrieve "
+**Overloaded versions**
+
+* retrieve\ (vector, t, interpolate=true)
+
+  Retrieve vector at given time
+  
+  *Arguments*
+      vector (:py:class:`GenericVector`)
+          The vector (values to be retrieved).
+      t (float)
+          The time.
+      interpolate (bool)
+          Optional argument: If true (default), interpolate
+          time samples closest to t if t is not present.
+
+* retrieve\ (mesh, t)
+
+  Retrieve mesh at given time
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh (values to be retrieved).
+      t (float)
+          The time.
+";
+
+%feature("docstring")  dolfin::TimeSeriesHDF5::vector_times "
+Return array of sample times for vectors
+
+*Returns*
+    numpy.array(float)
+        The times.
+";
+
+%feature("docstring")  dolfin::TimeSeriesHDF5::mesh_times "
+Return array of sample times for meshes
+
+*Returns*
+    numpy.array(float)
+        The times.
+";
+
+%feature("docstring")  dolfin::TimeSeriesHDF5::clear "
+Clear time series
+";
+
+%feature("docstring")  dolfin::TimeSeriesHDF5::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::TimeSeriesHDF5::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=adaptivity, header=adapt.h)
+%feature("docstring")  dolfin::adapt "
+**Overloaded versions**
+
+* adapt\ (mesh)
+
+  Refine mesh uniformly
+
+* adapt\ (mesh, cell_markers)
+
+  Refine mesh based on cell markers
+
+* adapt\ (space)
+
+  Refine function space uniformly
+
+* adapt\ (space, cell_markers)
+
+  Refine function space based on cell markers
+
+* adapt\ (space, adapted_mesh)
+
+  Refine function space based on refined mesh
+
+* adapt\ (function, adapted_mesh, interpolate=true)
+
+  Adapt Function based on adapted mesh
+  
+  *Arguments*
+      function (:py:class:`Function`)
+          The function that should be adapted
+      adapted_mesh (:py:class:`Mesh`)
+          The new mesh
+      interpolate (bool)
+          Optional argument, default is true. If false, the
+          function's function space is adapted, but the values are
+          not interpolated.
+  
+  *Returns*
+      :py:class:`Function`
+          The adapted function
+
+* adapt\ (function, adapted_mesh)
+
+  Refine GenericFunction based on refined mesh
+
+* adapt\ (mesh_function, adapted_mesh)
+
+  Refine mesh function<std::size_t> based on mesh
+
+* adapt\ (bc, adapted_mesh, S)
+
+  Refine Dirichlet bc based on refined mesh
+
+* adapt\ (form, adapted_mesh, adapt_coefficients=true)
+
+  Adapt form based on adapted mesh
+  
+  *Arguments*
+      form (:py:class:`Form`)
+          The form that should be adapted
+      adapted_mesh (:py:class:`Mesh`)
+          The new mesh
+      adapt_coefficients (bool)
+          Optional argument, default is true. If false, the form
+          coefficients are not explictly adapted, but pre-adapted
+          coefficients will be transferred.
+  
+  *Returns*
+      :py:class:`Form`
+          The adapted form
+
+* adapt\ (problem, adapted_mesh)
+
+  Refine linear variational problem based on mesh
+
+* adapt\ (problem, adapted_mesh)
+
+  Refine nonlinear variational problem based on mesh
+
+* adapt\ (ec, adapted_mesh, adapt_coefficients=true)
+
+  Adapt error control object based on adapted mesh
+  
+  *Arguments*
+      ec (:py:class:`ErrorControl`)
+          The error control object to be adapted
+      adapted_mesh (:py:class:`Mesh`)
+          The new mesh
+      adapt_coefficients (bool)
+          Optional argument, default is true. If false, any form
+          coefficients are not explictly adapted, but pre-adapted
+          coefficients will be transferred.
+  
+  *Returns*
+      :py:class:`ErrorControl`
+          The adapted error control object
+";
+
+%feature("docstring")  dolfin::adapt_markers "
+Helper function for refinement of boundary conditions
+";
+
+// Documentation extracted from: (module=adaptivity, header=marking.h)
+%feature("docstring")  dolfin::mark "
+Mark cells based on indicators and given marking strategy
+
+*Arguments*
+    markers (:py:class:`MeshFunction`)
+        the cell markers (to be computed)
+
+    indicators (:py:class:`MeshFunction`)
+        error indicators (one per cell)
+
+    strategy (str)
+        the marking strategy
+
+    fraction (float)
+        the marking fraction
+";
+
+%feature("docstring")  dolfin::dorfler_mark "
+Mark cells using Dorfler marking
+
+*Arguments*
+    markers (:py:class:`MeshFunction`)
+        the cell markers (to be computed)
+
+    indicators (:py:class:`MeshFunction`)
+        error indicators (one per cell)
+
+    fraction (float)
+        the marking fraction
+";
+
+// Documentation extracted from: (module=adaptivity, header=adaptivesolve.h)
+%feature("docstring")  dolfin::solve "
+**Overloaded versions**
+
+* solve\ (equation, u, tol, M)
+
+  Solve linear variational problem a(u, v) == L(v) without
+  essential boundary conditions
+
+* solve\ (equation, u, bc, tol, M)
+
+  Solve linear variational problem a(u, v) == L(v) with single
+  boundary condition
+
+* solve\ (equation, u, bcs, tol, M)
+
+  Solve linear variational problem a(u, v) == L(v) with list of
+  boundary conditions
+
+* solve\ (equation, u, J, tol, M)
+
+  Solve nonlinear variational problem F(u; v) = 0 without
+  essential boundary conditions
+
+* solve\ (equation, u, bc, J, tol, M)
+
+  Solve linear variational problem F(u; v) = 0 with single
+  boundary condition
+
+* solve\ (equation, u, bcs, J, tol, M)
+
+  Solve linear variational problem F(u; v) = 0 with list of
+  boundary conditions
+";
+
diff --git a/dolfin/swig/adaptivity/post.i b/dolfin/swig/adaptivity/post.i
new file mode 100644
index 0000000..9554e7f
--- /dev/null
+++ b/dolfin/swig/adaptivity/post.i
@@ -0,0 +1,38 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-11-30
+// Last changed: 2012-11-30
+
+// ===========================================================================
+// SWIG directives for the DOLFIN fem kernel module (post)
+//
+// The directives in this file are applied _after_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of Hierarchical
+//-----------------------------------------------------------------------------
+%pythoncode %{
+HierarchicalErrorControl.leaf_node = HierarchicalErrorControl._leaf_node
+HierarchicalErrorControl.root_node = HierarchicalErrorControl._root_node
+HierarchicalErrorControl.child = HierarchicalErrorControl._child
+HierarchicalErrorControl.parent = HierarchicalErrorControl._parent
+%}
+
diff --git a/dolfin/swig/adaptivity/pre.i b/dolfin/swig/adaptivity/pre.i
new file mode 100644
index 0000000..15ae941
--- /dev/null
+++ b/dolfin/swig/adaptivity/pre.i
@@ -0,0 +1,53 @@
+/* -*- C -*- */
+// Copyright (C) 2011 Marie E. Rognes
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2011.
+//
+// First added:  2011-02-23
+// Last changed: 2011-07-05
+
+// ===========================================================================
+// SWIG directives for the DOLFIN adaptivity kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+//-----------------------------------------------------------------------------
+// Instantiate Hierarchical ErrorControl template class
+//-----------------------------------------------------------------------------
+%template (HierarchicalErrorControl) dolfin::Hierarchical<dolfin::ErrorControl>;
+
+//-----------------------------------------------------------------------------
+// Remove silly warning from friend function
+//-----------------------------------------------------------------------------
+%warnfilter(503) ErrorControl;
+
+//-----------------------------------------------------------------------------
+// Ignore GoalFunctional entirely
+//-----------------------------------------------------------------------------
+%ignore dolfin::GoalFunctional;
+
+//-----------------------------------------------------------------------------
+// To simplify handling of shared_ptr types in PyDOLFIN we ignore the reference
+// version of constructors to these types
+//-----------------------------------------------------------------------------
+%ignore dolfin::AdaptiveLinearVariationalSolver::AdaptiveLinearVariationalSolver(LinearVariationalProblem&);
+%ignore dolfin::AdaptiveNonlinearVariationalSolver::AdaptiveNonlinearVariationalSolver(NonlinearVariationalProblem&);
+
+
diff --git a/dolfin/swig/ale/docstrings.i b/dolfin/swig/ale/docstrings.i
new file mode 100644
index 0000000..6dec04f
--- /dev/null
+++ b/dolfin/swig/ale/docstrings.i
@@ -0,0 +1,121 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=ale, header=ALE.h)
+%feature("docstring")  dolfin::ALE "
+This class provides functionality useful for implementation of
+ALE (Arbitrary Lagrangian-Eulerian) methods, in particular
+moving the boundary vertices of a mesh and then interpolating
+the new coordinates for the interior vertices accordingly.
+";
+
+%feature("docstring")  dolfin::ALE::move "
+**Overloaded versions**
+
+* move\ (mesh, new_boundary)
+
+  Move coordinates of mesh according to new boundary coordinates.
+  Returns displacement (encapsulated in Expression subclass MeshDisplacement)
+
+* move\ (mesh0, mesh1)
+
+  Move coordinates of mesh0 according to mesh1 with common global vertices.
+  Returns displacement (encapsulated in Expression subclass MeshDisplacement)
+
+* move\ (mesh, displacement)
+
+  Move coordinates of mesh according to displacement function
+";
+
+// Documentation extracted from: (module=ale, header=MeshDisplacement.h)
+%feature("docstring")  dolfin::MeshDisplacement "
+This class encapsulates the CG1 representation of the
+displacement of a mesh as an Expression. This is particularly
+useful for the displacement returned by mesh smoothers which can
+subsequently be used in evaluating forms. The value rank is 1
+and the value shape is equal to the geometric dimension of the
+mesh.
+";
+
+%feature("docstring")  dolfin::MeshDisplacement::MeshDisplacement "
+**Overloaded versions**
+
+* MeshDisplacement\ (mesh)
+
+  Create MeshDisplacement of given mesh
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          Mesh to be displacement defined on.
+
+* MeshDisplacement\ (mesh_displacement)
+
+  Copy constructor
+  
+  *Arguments*
+      mesh_displacement (:py:class:`MeshDisplacement`)
+          Object to be copied.
+";
+
+%feature("docstring")  dolfin::MeshDisplacement::operator[] "
+**Overloaded versions**
+
+* operator[]\ (i)
+
+  Extract subfunction
+  In python available as MeshDisplacement.sub(i)
+  
+  *Arguments*
+      i (int)
+          Index of subfunction.
+
+* operator[]\ (i)
+
+  Extract subfunction. Const version
+  
+  *Arguments*
+      i (int)
+          Index of subfunction.
+";
+
+%feature("docstring")  dolfin::MeshDisplacement::eval "
+Evaluate at given point in given cell.
+
+*Arguments*
+    values (numpy.array(float))
+        The values at the point.
+    x (numpy.array(float))
+        The coordinates of the point.
+    cell (ufc::cell)
+        The cell which contains the given point.
+";
+
+%feature("docstring")  dolfin::MeshDisplacement::compute_vertex_values "
+Compute values at all mesh vertices.
+
+*Arguments*
+    vertex_values (numpy.array(float))
+        The values at all vertices.
+    mesh (:py:class:`Mesh`)
+        The mesh.
+";
+
diff --git a/dolfin/swig/ale/pre.i b/dolfin/swig/ale/pre.i
new file mode 100644
index 0000000..09ce5ca
--- /dev/null
+++ b/dolfin/swig/ale/pre.i
@@ -0,0 +1,28 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-03-06
+
+//=============================================================================
+// SWIG directives for the DOLFIN common kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+%rename(sub) dolfin::MeshDisplacement::operator[];
diff --git a/dolfin/swig/common/docstrings.i b/dolfin/swig/common/docstrings.i
new file mode 100644
index 0000000..812e312
--- /dev/null
+++ b/dolfin/swig/common/docstrings.i
@@ -0,0 +1,803 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=common, header=init.h)
+%feature("docstring")  dolfin::init "
+Initialize DOLFIN (and PETSc) with command-line arguments. This
+should not be needed in most cases since the initialization is
+otherwise handled automatically.
+";
+
+// Documentation extracted from: (module=common, header=defines.h)
+%feature("docstring")  dolfin::dolfin_version "
+Return DOLFIN version string
+";
+
+%feature("docstring")  dolfin::git_commit_hash "
+Return git changeset hash (returns \"unknown\" if changeset is
+not known)
+";
+
+%feature("docstring")  dolfin::has_openmp "
+Return true if DOLFIN is compiled with OpenMP
+";
+
+%feature("docstring")  dolfin::has_mpi "
+Return true if DOLFIN is compiled with MPI
+";
+
+%feature("docstring")  dolfin::has_petsc "
+Return true if DOLFIN is compiled with PETSc
+";
+
+%feature("docstring")  dolfin::has_petsc_snes "
+Return true if PETSc SNES is enabled
+";
+
+%feature("docstring")  dolfin::has_petsc_tao "
+Return true if PETSc TAO is enabled
+";
+
+%feature("docstring")  dolfin::has_slepc "
+Return true if DOLFIN is compiled with SLEPc
+";
+
+%feature("docstring")  dolfin::has_trilinos "
+Return true if DOLFIN is compiled with Trilinos
+";
+
+%feature("docstring")  dolfin::has_scotch "
+Return true if DOLFIN is compiled with Scotch
+";
+
+%feature("docstring")  dolfin::has_cgal "
+Return true if DOLFIN is compiled with CGAL
+";
+
+%feature("docstring")  dolfin::has_umfpack "
+Return true if DOLFIN is compiled with Umfpack
+";
+
+%feature("docstring")  dolfin::has_cholmod "
+Return true if DOLFIN is compiled with Cholmod
+";
+
+%feature("docstring")  dolfin::has_parmetis "
+Return true if DOLFIN is compiled with ParMETIS
+";
+
+%feature("docstring")  dolfin::has_zlib "
+Return true if DOLFIN is compiled with ZLIB
+";
+
+%feature("docstring")  dolfin::has_hdf5 "
+Return true if DOLFIN is compiled with HDF5
+";
+
+%feature("docstring")  dolfin::has_exodus "
+Return true if DOLFIN is compiled with Exodus
+";
+
+// Documentation extracted from: (module=common, header=types.h)
+// Documentation extracted from: (module=common, header=constants.h)
+// Documentation extracted from: (module=common, header=timing.h)
+%feature("docstring")  dolfin::tic "
+Timing functions measure CPU time as determined by clock(),
+the precision of which seems to be 0.01 seconds.
+Start timing (should not be used internally in DOLFIN!)
+";
+
+%feature("docstring")  dolfin::toc "
+Return elapsed CPU time (should not be used internally in DOLFIN!)
+";
+
+%feature("docstring")  dolfin::time "
+Return current CPU time used by process
+";
+
+%feature("docstring")  dolfin::timings "
+Return a summary of timings and tasks in a Table, optionally clearing
+stored timings
+";
+
+%feature("docstring")  dolfin::list_timings "
+List a summary of timings and tasks, optionally clearing stored timings
+";
+
+%feature("docstring")  dolfin::summary "
+This function is deprecated, use list_timings
+";
+
+%feature("docstring")  dolfin::timing "
+Return timing (average) for given task, optionally clearing timing
+for task
+";
+
+// Documentation extracted from: (module=common, header=Array.h)
+%feature("docstring")  dolfin::Array "
+This class provides a simple wrapper for a pointer to an array. A
+purpose of this class is to enable the simple and safe exchange
+of data between C++ and Python.
+";
+
+%feature("docstring")  dolfin::Array::Array "
+**Overloaded versions**
+
+* Array\ (N)
+
+  Create array of size N. Array has ownership.
+
+* Array\ (N, x)
+
+  Construct array from a pointer. Array does not take ownership.
+
+* Array\ (other)
+
+  Disable copy construction, to avoid unanticipated sharing or
+  copying of data. This means that an Array must always be passed as
+  reference, or as a (possibly shared) pointer.
+";
+
+%feature("docstring")  dolfin::Array::str "
+Return informal string representation (pretty-print).
+Note that the Array class is not a subclass of Variable (for
+efficiency) which means that one needs to call str() directly
+instead of using the info() function on Array objects.
+";
+
+%feature("docstring")  dolfin::Array::size "
+Return size of array
+";
+
+%feature("docstring")  dolfin::Array::operator[] "
+**Overloaded versions**
+
+* operator[]\ (i)
+
+  Access value of given entry (const version)
+
+* operator[]\ (i)
+
+  Access value of given entry (non-const version)
+";
+
+%feature("docstring")  dolfin::Array::data "
+**Overloaded versions**
+
+* data\ ()
+
+  Return pointer to data (const version)
+
+* data\ ()
+
+  Return pointer to data (non-const version)
+";
+
+// Documentation extracted from: (module=common, header=IndexSet.h)
+%feature("docstring")  dolfin::IndexSet "
+This class provides an efficient data structure for index sets.
+The cost of checking whether a given index is in the set is O(1)
+and very very fast (optimal) at the cost of extra storage.
+";
+
+%feature("docstring")  dolfin::IndexSet::IndexSet "
+Create index set of given size
+";
+
+%feature("docstring")  dolfin::IndexSet::empty "
+Return true if set is empty
+";
+
+%feature("docstring")  dolfin::IndexSet::size "
+Return size of set
+";
+
+%feature("docstring")  dolfin::IndexSet::has_index "
+Check whether index is in set
+";
+
+%feature("docstring")  dolfin::IndexSet::find "
+Return position (if any) for given index
+";
+
+%feature("docstring")  dolfin::IndexSet::operator[] "
+**Overloaded versions**
+
+* operator[]\ (i)
+
+  Return given index
+
+* operator[]\ (i)
+
+  Return given index (const version)
+";
+
+%feature("docstring")  dolfin::IndexSet::insert "
+Insert index into set
+";
+
+%feature("docstring")  dolfin::IndexSet::fill "
+Fill index set with indices 0, 1, 2, ..., size - 1
+";
+
+%feature("docstring")  dolfin::IndexSet::clear "
+Clear set
+";
+
+// Documentation extracted from: (module=common, header=Set.h)
+%feature("docstring")  dolfin::Set::Set "
+**Overloaded versions**
+
+* Set\ ()
+
+  Create empty set
+
+* Set\ (x)
+
+  Wrap std::vectpr as a set. Contents will be erased.
+
+* Set\ (x)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::Set::find "
+**Overloaded versions**
+
+* find\ (x)
+
+  Find entry in set and return an iterator to the entry
+
+* find\ (x)
+
+  Find entry in set and return an iterator to the entry (const)
+";
+
+%feature("docstring")  dolfin::Set::insert "
+**Overloaded versions**
+
+* insert\ (x)
+
+  Insert entry
+
+* insert\ (first, last)
+
+  Insert entries
+";
+
+%feature("docstring")  dolfin::Set::size "
+Set size
+";
+
+%feature("docstring")  dolfin::Set::erase "
+Erase an entry
+";
+
+%feature("docstring")  dolfin::Set::sort "
+Sort set
+";
+
+%feature("docstring")  dolfin::Set::clear "
+Clear set
+";
+
+%feature("docstring")  dolfin::Set::operator[] "
+Index the nth entry in the set
+";
+
+%feature("docstring")  dolfin::Set::set "
+**Overloaded versions**
+
+* set\ ()
+
+  Return the vector that stores the data in the Set
+
+* set\ ()
+
+  Return the vector that stores the data in the Set
+";
+
+// Documentation extracted from: (module=common, header=Timer.h)
+%feature("docstring")  dolfin::Timer "
+A timer can be used for timing tasks. The basic usage is
+
+  Timer timer(\"Assembling over cells\");
+
+The timer is started at construction and timing ends
+when the timer is destroyed (goes out of scope). It is
+also possible to start and stop a timer explicitly by
+
+  timer.start();
+  timer.stop();
+
+Timings are stored globally and a summary may be printed
+by calling
+
+  list_timings();
+";
+
+%feature("docstring")  dolfin::Timer::Timer "
+Create timer
+";
+
+%feature("docstring")  dolfin::Timer::start "
+Start timer
+";
+
+%feature("docstring")  dolfin::Timer::stop "
+Stop timer
+";
+
+%feature("docstring")  dolfin::Timer::value "
+Return value of timer (or time at start if not stopped)
+";
+
+// Documentation extracted from: (module=common, header=Variable.h)
+%feature("docstring")  dolfin::Variable "
+Common base class for DOLFIN variables.
+";
+
+%feature("docstring")  dolfin::Variable::Variable "
+**Overloaded versions**
+
+* Variable\ ()
+
+  Create unnamed variable
+
+* Variable\ (name, label)
+
+  Create variable with given name and label
+
+* Variable\ (variable)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::Variable::rename "
+Rename variable
+";
+
+%feature("docstring")  dolfin::Variable::name "
+Return name
+";
+
+%feature("docstring")  dolfin::Variable::label "
+Return label (description)
+";
+
+%feature("docstring")  dolfin::Variable::id "
+Get unique identifier.
+
+*Returns*
+    _std::size_t_
+        The unique integer identifier associated with the object.
+";
+
+%feature("docstring")  dolfin::Variable::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=common, header=Hierarchical.h)
+%feature("docstring")  dolfin::Hierarchical "
+This class provides storage and data access for hierarchical
+classes; that is, classes where an object may have a child
+and a parent.
+
+Note to developers: each subclass of Hierarchical that
+implements an assignment operator must call the base class
+assignment operator at the *end* of the subclass assignment
+operator. See the Mesh class for an example.
+";
+
+%feature("docstring")  dolfin::Hierarchical::Hierarchical "
+Constructor
+";
+
+%feature("docstring")  dolfin::Hierarchical::depth "
+Return depth of the hierarchy; that is, the total number of
+objects in the hierarchy linked to the current object via
+child-parent relationships, including the object itself.
+
+*Returns*
+    int
+        The depth of the hierarchy.
+";
+
+%feature("docstring")  dolfin::Hierarchical::has_parent "
+Check if the object has a parent.
+
+*Returns*
+    bool
+        The return value is true iff the object has a parent.
+";
+
+%feature("docstring")  dolfin::Hierarchical::has_child "
+Check if the object has a child.
+
+*Returns*
+    bool
+        The return value is true iff the object has a child.
+";
+
+%feature("docstring")  dolfin::Hierarchical::parent "
+**Overloaded versions**
+
+* parent\ ()
+
+  Return parent in hierarchy. An error is thrown if the object
+  has no parent.
+  
+  *Returns*
+      _Object_
+          The parent object.
+
+* parent\ ()
+
+  Return parent in hierarchy (const version).
+";
+
+%feature("docstring")  dolfin::Hierarchical::parent_shared_ptr "
+**Overloaded versions**
+
+* parent_shared_ptr\ ()
+
+  Return shared pointer to parent. A zero pointer is returned if
+  the object has no parent.
+  
+  *Returns*
+      shared_ptr<T>
+          The parent object.
+
+* parent_shared_ptr\ ()
+
+  Return shared pointer to parent (const version).
+";
+
+%feature("docstring")  dolfin::Hierarchical::child "
+**Overloaded versions**
+
+* child\ ()
+
+  Return child in hierarchy. An error is thrown if the object
+  has no child.
+  
+  *Returns*
+      _T_
+          The child object.
+
+* child\ ()
+
+  Return child in hierarchy (const version).
+";
+
+%feature("docstring")  dolfin::Hierarchical::child_shared_ptr "
+**Overloaded versions**
+
+* child_shared_ptr\ ()
+
+  Return shared pointer to child. A zero pointer is returned if
+  the object has no child.
+  
+  *Returns*
+      shared_ptr<T>
+          The child object.
+
+* child_shared_ptr\ ()
+
+  Return shared pointer to child (const version).
+";
+
+%feature("docstring")  dolfin::Hierarchical::root_node "
+**Overloaded versions**
+
+* root_node\ ()
+
+  Return root node object in hierarchy.
+  
+  *Returns*
+      _T_
+          The root node object.
+
+* root_node\ ()
+
+  Return root node object in hierarchy (const version).
+";
+
+%feature("docstring")  dolfin::Hierarchical::root_node_shared_ptr "
+**Overloaded versions**
+
+* root_node_shared_ptr\ ()
+
+  Return shared pointer to root node object in hierarchy.
+  
+  *Returns*
+      _T_
+          The root node object.
+
+* root_node_shared_ptr\ ()
+
+  Return shared pointer to root node object in hierarchy (const version).
+";
+
+%feature("docstring")  dolfin::Hierarchical::leaf_node "
+**Overloaded versions**
+
+* leaf_node\ ()
+
+  Return leaf node object in hierarchy.
+  
+  *Returns*
+      _T_
+          The leaf node object.
+
+* leaf_node\ ()
+
+  Return leaf node object in hierarchy (const version).
+";
+
+%feature("docstring")  dolfin::Hierarchical::leaf_node_shared_ptr "
+**Overloaded versions**
+
+* leaf_node_shared_ptr\ ()
+
+  Return shared pointer to leaf node object in hierarchy.
+  
+  *Returns*
+      _T_
+          The leaf node object.
+
+* leaf_node_shared_ptr\ ()
+
+  Return shared pointer to leaf node object in hierarchy (const version).
+";
+
+%feature("docstring")  dolfin::Hierarchical::set_parent "
+Set parent
+";
+
+%feature("docstring")  dolfin::Hierarchical::clear_child "
+Clear child
+";
+
+%feature("docstring")  dolfin::Hierarchical::set_child "
+Set child
+";
+
+%feature("docstring")  dolfin::Hierarchical::operator= "
+Assignment operator
+";
+
+%feature("docstring")  dolfin::Hierarchical::_debug "
+Function useful for debugging the hierarchy
+";
+
+// Documentation extracted from: (module=common, header=MPI.h)
+%feature("docstring")  dolfin::MPI "
+This class provides utility functions for easy communication
+with MPI and handles cases when DOLFIN is not configured with
+MPI.
+";
+
+%feature("docstring")  dolfin::MPI::process_number "
+Return process rank (uses MPI_COMM_WORLD)
+Warning: This function is deprecated. Use dolfin::MPI::rank
+";
+
+%feature("docstring")  dolfin::MPI::num_processes "
+Return number of processes for MPI_COMM_WORLD.
+Warning: This function is deprecated. Use dolfin::MPI::size.
+";
+
+%feature("docstring")  dolfin::MPI::rank "
+Return process rank for the communicator
+";
+
+%feature("docstring")  dolfin::MPI::size "
+Return size of the group (number of processes) associated with
+the communicator
+";
+
+%feature("docstring")  dolfin::MPI::is_broadcaster "
+Determine whether we should broadcast (based on current
+parallel policy)
+";
+
+%feature("docstring")  dolfin::MPI::is_receiver "
+Determine whether we should receive (based on current parallel
+policy)
+";
+
+%feature("docstring")  dolfin::MPI::barrier "
+Set a barrier (synchronization point)
+";
+
+%feature("docstring")  dolfin::MPI::all_to_all "
+Send in_values[p0] to process p0 and receive values from
+process p1 in out_values[p1]
+";
+
+%feature("docstring")  dolfin::MPI::broadcast "
+**Overloaded versions**
+
+* broadcast\ (comm, value, broadcaster=0)
+
+  Broadcast vector of value from broadcaster to all processes
+
+* broadcast\ (comm, value, broadcaster=0)
+
+  Broadcast single primitive from broadcaster to all processes
+";
+
+%feature("docstring")  dolfin::MPI::scatter "
+**Overloaded versions**
+
+* scatter\ (comm, in_values, out_value, sending_process=0)
+
+  Scatter vector in_values[i] to process i
+
+* scatter\ (comm, in_values, out_value, sending_process=0)
+
+  Scatter primitive in_values[i] to process i
+";
+
+%feature("docstring")  dolfin::MPI::gather "
+**Overloaded versions**
+
+* gather\ (comm, in_values, out_values, receiving_process=0)
+
+  Gather values on one process
+
+* gather\ (comm, in_values, out_values, receiving_process=0)
+
+  Gather strings on one process
+";
+
+%feature("docstring")  dolfin::MPI::all_gather "
+**Overloaded versions**
+
+* all_gather\ (comm, in_values, out_values)
+
+  Gather values from all proceses. Same data count from each
+  process (wrapper for MPI_Allgather)
+
+* all_gather\ (comm, in_values, out_values)
+
+  Gather values from each process (variable count per process)
+
+* all_gather\ (comm, in_value, out_values)
+
+  Gather values, one primitive from each process (MPI_Allgather)
+";
+
+%feature("docstring")  dolfin::MPI::max "
+Return global max value
+";
+
+%feature("docstring")  dolfin::MPI::min "
+Return global min value
+";
+
+%feature("docstring")  dolfin::MPI::sum "
+Sum values and return sum
+";
+
+%feature("docstring")  dolfin::MPI::all_reduce "
+All reduce
+";
+
+%feature("docstring")  dolfin::MPI::global_offset "
+Find global offset (index) (wrapper for MPI_(Ex)Scan with
+MPI_SUM as reduction op)
+";
+
+%feature("docstring")  dolfin::MPI::send_recv "
+**Overloaded versions**
+
+* send_recv\ (comm, send_value, dest, send_tag, recv_value, source, recv_tag)
+
+  Send-receive data between processes (blocking)
+
+* send_recv\ (comm, send_value, dest, recv_value, source)
+
+  Send-receive data between processes
+";
+
+%feature("docstring")  dolfin::MPI::local_range "
+**Overloaded versions**
+
+* local_range\ (comm, N)
+
+  Return local range for local process, splitting [0, N - 1] into
+  size() portions of almost equal size
+
+* local_range\ (comm, process, N)
+
+  Return local range for given process, splitting [0, N - 1] into
+  size() portions of almost equal size
+";
+
+%feature("docstring")  dolfin::MPI::compute_local_range "
+Return local range for given process, splitting [0, N - 1] into
+size() portions of almost equal size
+";
+
+%feature("docstring")  dolfin::MPI::index_owner "
+Return which process owns index (inverse of local_range)
+";
+
+// Documentation extracted from: (module=common, header=SubSystemsManager.h)
+%feature("docstring")  dolfin::SubSystemsManager "
+This is a singleton class which manages the initialisation and
+finalisation of various sub systems, such as MPI and PETSc.
+";
+
+%feature("docstring")  dolfin::SubSystemsManager::init_mpi "
+**Overloaded versions**
+
+* init_mpi\ ()
+
+  Initialise MPI
+
+* init_mpi\ (argc, argv[], required_thread_level)
+
+  Initialise MPI with required level of thread support
+";
+
+%feature("docstring")  dolfin::SubSystemsManager::init_petsc "
+**Overloaded versions**
+
+* init_petsc\ ()
+
+  Initialize PETSc without command-line arguments
+
+* init_petsc\ (argc, argv[])
+
+  Initialize PETSc with command-line arguments. Note that PETSc
+  command-line arguments may also be filtered and sent to PETSc
+  by parameters.parse(argc, argv).
+";
+
+%feature("docstring")  dolfin::SubSystemsManager::finalize "
+Finalize subsytems. This will be called by the destructor, but in
+special cases it may be necessary to call finalize() explicitly.
+";
+
+%feature("docstring")  dolfin::SubSystemsManager::responsible_mpi "
+Return true if DOLFIN intialised MPI (and is therefore responsible
+for finalization)
+";
+
+%feature("docstring")  dolfin::SubSystemsManager::responsible_petsc "
+Return true if DOLFIN intialised PETSc (and is therefore
+responsible for finalization)
+";
+
+%feature("docstring")  dolfin::SubSystemsManager::mpi_initialized "
+Check if MPI has been initialised (returns true if MPI has been
+initialised, even if it is later finalised)
+";
+
+%feature("docstring")  dolfin::SubSystemsManager::mpi_finalized "
+Check if MPI has been finalized (returns true if MPI has been
+finalised)
+";
+
diff --git a/dolfin/swig/common/post.i b/dolfin/swig/common/post.i
new file mode 100644
index 0000000..f6bf278
--- /dev/null
+++ b/dolfin/swig/common/post.i
@@ -0,0 +1,147 @@
+/* -*- C -*- */
+// Copyright (C) 2008-2011 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-12-16
+// Last changed: 2012-03-28
+
+//-----------------------------------------------------------------------------
+// MPI communicator wrappers (deliberately very lightweight)
+//-----------------------------------------------------------------------------
+//#ifdef HAS_MPI
+typedef struct {
+} MPI_Comm;
+//#endif
+
+// Lightweight wrappers for MPI_COMM_WORLD and MPI_COMM_SELF
+%inline %{
+  MPI_Comm mpi_comm_world()
+  { return MPI_COMM_WORLD; }
+
+  MPI_Comm mpi_comm_self()
+  { return MPI_COMM_SELF; }
+%}
+
+
+//-----------------------------------------------------------------------------
+// Instantiate some DOLFIN MPI templates
+//-----------------------------------------------------------------------------
+
+%template(max) dolfin::MPI::max<double>;
+%template(min) dolfin::MPI::min<double>;
+%template(sum) dolfin::MPI::sum<double>;
+%template(sum) dolfin::MPI::sum<unsigned int>;
+
+//-----------------------------------------------------------------------------
+// Ignore const array interface (Used if the Array type is a const)
+//-----------------------------------------------------------------------------
+%define CONST_ARRAY_IGNORES(TYPE)
+%ignore dolfin::Array<const TYPE>::Array(std::size_t N);
+%ignore dolfin::Array<const TYPE>::array();
+%ignore dolfin::Array<const TYPE>::resize(std::size_t N);
+%ignore dolfin::Array<const TYPE>::zero();
+%ignore dolfin::Array<const TYPE>::update();
+%ignore dolfin::Array<const TYPE>::__setitem__;
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for instantiating the Array templates
+//
+// TYPE          : The Array template type
+// TEMPLATE_NAME : The Template name
+// TYPE_NAME     : The name of the pointer type, 'double' for 'double', 'uint' for
+//                 'dolfin::uint'
+//-----------------------------------------------------------------------------
+
+%define ARRAY_EXTENSIONS(TYPE, TEMPLATE_NAME, TYPE_NAME)
+
+// Construct value wrapper for dolfin::Array<TYPE>
+// Valuewrapper is used so a return by value Array does not make an extra copy
+// in any typemaps
+%feature("valuewrapper") dolfin::Array<TYPE>;
+
+// Cannot construct an Array from another Array.
+// Use NumPy Array instead
+%ignore dolfin::Array<TYPE>::Array(const Array& other);
+
+%template(TEMPLATE_NAME ## Array) dolfin::Array<TYPE>;
+
+%feature("docstring") dolfin::Array::__getitem__ "Missing docstring";
+%feature("docstring") dolfin::Array::__setitem__ "Missing docstring";
+%feature("docstring") dolfin::Array::array "Missing docstring";
+
+%extend dolfin::Array<TYPE> {
+  TYPE _getitem(unsigned int i) const { return (*self)[i]; }
+  void _setitem(unsigned int i, const TYPE& val) { (*self)[i] = val; }
+
+  PyObject * _array(){
+    return %make_numpy_array(1, TYPE_NAME)(self->size(), self->data(), true);
+  }
+
+  %pythoncode%{
+def array(self):
+    """
+    Return a NumPy array view of object
+    """
+    data = self._array()
+    _attach_base_to_numpy_array(data, self)
+    return data
+
+def __getitem__(self, index):
+    if not isinstance(index, int):
+        raise TypeError("expected an int as index argument")
+    while index < 0:
+        index += self.size()
+    if index >= self.size():
+        raise IndexError("index out of range")
+    return self._getitem(index)
+
+def __setitem__(self, index, value):
+    if not isinstance(index, int):
+        raise TypeError("expected an int as index argument")
+    while index < 0:
+        index += self.size()
+    if index >= self.size():
+        raise IndexError("index out of range")
+    self._setitem(index, value)
+
+def __len__(self):
+    return self.size()
+    %}
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Run Array macros, which also instantiate the templates
+//-----------------------------------------------------------------------------
+CONST_ARRAY_IGNORES(double)
+ARRAY_EXTENSIONS(double, Double, double)
+//ARRAY_EXTENSIONS(const double, ConstDouble, double)
+ARRAY_EXTENSIONS(unsigned int, UInt, uint)
+ARRAY_EXTENSIONS(int, Int, int)
+
+//-----------------------------------------------------------------------------
+// Add pretty print for Variables
+//-----------------------------------------------------------------------------
+%feature("docstring") dolfin::Variable::__str__ "Missing docstring";
+%extend dolfin::Variable
+{
+  std::string __str__() const
+  {
+    return self->str(false);
+  }
+}
diff --git a/dolfin/swig/common/pre.i b/dolfin/swig/common/pre.i
new file mode 100644
index 0000000..3096280
--- /dev/null
+++ b/dolfin/swig/common/pre.i
@@ -0,0 +1,91 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-09-22
+// Last changed: 2014-01-17
+
+//=============================================================================
+// SWIG directives for the DOLFIN common kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+#ifdef HAS_PETSC4PY
+// This must come early.  The petsc4py module defines typemaps which
+// we will later use on %extended classes (in post).  The typemaps
+// must be in scope when swig sees the original class, not the
+// extended definition.
+%include "petsc4py/petsc4py.i"
+// Remove typemaps that check for nullity of pointer and object itself.
+// we only care about the former.
+%define %petsc4py_objreft(Type)
+
+%typemap(check,noblock=1) Type *OUTPUT {
+  if ($1 == PETSC_NULL)
+    %argument_nullref("$type", $symname, $argnum);
+ }
+%apply Type *OUTPUT { Type & }
+%enddef
+
+%petsc4py_objreft(Mat)
+%petsc4py_objreft(Vec)
+%petsc4py_objreft(KSP)
+%petsc4py_objreft(SNES)
+#endif
+
+//-----------------------------------------------------------------------------
+// Global modifications to the Array interface
+//-----------------------------------------------------------------------------
+%ignore dolfin::Array::operator=;
+%ignore dolfin::Array::operator[];
+
+//-----------------------------------------------------------------------------
+// Global modifications to the IndexSet interface
+//-----------------------------------------------------------------------------
+%ignore dolfin::IndexSet::operator[];
+
+//-----------------------------------------------------------------------------
+// Global modifications to the dolfin::Set interface
+//-----------------------------------------------------------------------------
+%ignore dolfin::Set::operator[];
+
+//-----------------------------------------------------------------------------
+// Copy Array construction typemaps from NumPy typemaps
+//-----------------------------------------------------------------------------
+%typemap(in) (std::size_t N, const std::size_t* x) = (std::size_t _array_dim, std::size_t* _array);
+%typemap(in) (std::size_t N, const int* x) = (std::size_t _array_dim, int* _array);
+%typemap(in) (std::size_t N, const double* x) = (std::size_t _array_dim, double* _array);
+
+//-----------------------------------------------------------------------------
+// Ignores for Hierarchical
+//-----------------------------------------------------------------------------
+%ignore dolfin::Hierarchical::operator=;
+
+//-----------------------------------------------------------------------------
+// Ignore all foo and rename foo_shared_ptr to _foo for SWIG >= 2.0
+// and ignore foo_shared_ptr for SWIG < 2.0
+//-----------------------------------------------------------------------------
+%ignore dolfin::Hierarchical::parent;
+%rename(_parent) dolfin::Hierarchical::parent_shared_ptr;
+%ignore dolfin::Hierarchical::child;
+%rename(_child) dolfin::Hierarchical::child_shared_ptr;
+%ignore dolfin::Hierarchical::root_node;
+%rename(_root_node) dolfin::Hierarchical::root_node_shared_ptr;
+%ignore dolfin::Hierarchical::leaf_node;
+%rename(_leaf_node) dolfin::Hierarchical::leaf_node_shared_ptr;
diff --git a/dolfin/swig/defines.i b/dolfin/swig/defines.i
new file mode 100644
index 0000000..984fe32
--- /dev/null
+++ b/dolfin/swig/defines.i
@@ -0,0 +1,37 @@
+// Copyright (C) 20013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-11-29
+// Last changed: 2013-11-29
+
+//-----------------------------------------------------------------------------
+// Include code for SWIG related defines
+//-----------------------------------------------------------------------------
+
+%inline %{
+namespace dolfin {
+
+  bool has_petsc4py()
+  {
+#ifdef HAS_PETSC4PY
+    return true;
+#else
+    return false;
+#endif
+  }
+}
+%}
diff --git a/dolfin/swig/exceptions.i b/dolfin/swig/exceptions.i
new file mode 100644
index 0000000..c5cca64
--- /dev/null
+++ b/dolfin/swig/exceptions.i
@@ -0,0 +1,73 @@
+/* -*- C -*- */
+// Copyright (C) 2007-2009 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hake, 2009.
+//
+// First added:  2007-05-15
+// Last changed: 2010-04-23
+
+// ===========================================================================
+// SWIG directives for exception handling in PyDOLFIN
+// ===========================================================================
+
+// ---------------------------------------------------------------------------
+// Function that handles exceptions. Reduces code bloat.
+// ---------------------------------------------------------------------------
+%{
+SWIGINTERN void handle_dolfin_exceptions()
+{
+  // Re-throw any exception
+  try {
+    throw;
+  }
+  
+  // all logic_error subclasses
+  catch (std::logic_error &e) {
+    PyErr_SetString(PyExc_StandardError, const_cast<char*>(e.what()));
+  }
+
+  // all runtime_error subclasses
+  catch (std::runtime_error &e) {
+    PyErr_SetString(PyExc_RuntimeError, const_cast<char*>(e.what()));
+  }
+
+  // all the rest
+  catch (std::exception &e) {
+    PyErr_SetString(PyExc_Exception, const_cast<char*>(e.what()));
+  }
+
+}
+%}
+
+// ---------------------------------------------------------------------------
+// Define the code that each call to DOLFIN should be wrapped in
+// ---------------------------------------------------------------------------
+%exception {
+  try {
+    $action
+  }
+  catch (...){
+    // No need to call PyErr_SetString if the error originates from Python
+    if (!PyErr_Occurred()) {
+      handle_dolfin_exceptions();
+    }
+    SWIG_fail;
+  }
+}
+
+
diff --git a/dolfin/swig/fem/docstrings.i b/dolfin/swig/fem/docstrings.i
new file mode 100644
index 0000000..0a8eb3b
--- /dev/null
+++ b/dolfin/swig/fem/docstrings.i
@@ -0,0 +1,2297 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=fem, header=GenericDofMap.h)
+%feature("docstring")  dolfin::GenericDofMap "
+This class provides a generic interface for dof maps
+";
+
+%feature("docstring")  dolfin::GenericDofMap::GenericDofMap "
+Constructor
+";
+
+%feature("docstring")  dolfin::GenericDofMap::is_view "
+True if dof map is a view into another map (is a sub-dofmap)
+";
+
+%feature("docstring")  dolfin::GenericDofMap::global_dimension "
+Return the dimension of the global finite element function
+space
+";
+
+%feature("docstring")  dolfin::GenericDofMap::cell_dimension "
+Return the dimension of the local finite element function
+space on a cell
+";
+
+%feature("docstring")  dolfin::GenericDofMap::max_cell_dimension "
+Return the maximum dimension of the local finite element
+function space
+";
+
+%feature("docstring")  dolfin::GenericDofMap::num_entity_dofs "
+Return the number of dofs for a given entity dimension
+";
+
+%feature("docstring")  dolfin::GenericDofMap::num_facet_dofs "
+Return number of facet dofs
+";
+
+%feature("docstring")  dolfin::GenericDofMap::restriction "
+Restriction if any. If the dofmap is not restricted, a null
+pointer is returned.
+";
+
+%feature("docstring")  dolfin::GenericDofMap::ownership_range "
+Return the ownership range (dofs in this range are owned by
+this process)
+";
+
+%feature("docstring")  dolfin::GenericDofMap::off_process_owner "
+Return map from nonlocal-dofs (that appear in local dof map)
+to owning process
+";
+
+%feature("docstring")  dolfin::GenericDofMap::cell_dofs "
+Local-to-global mapping of dofs on a cell
+";
+
+%feature("docstring")  dolfin::GenericDofMap::tabulate_facet_dofs "
+Tabulate local-local facet dofs
+";
+
+%feature("docstring")  dolfin::GenericDofMap::tabulate_entity_dofs "
+Tabulate the local-to-local mapping of dofs on entity
+(dim, local_entity)
+";
+
+%feature("docstring")  dolfin::GenericDofMap::tabulate_coordinates "
+Tabulate the coordinates of all dofs on a cell (UFC cell version)
+";
+
+%feature("docstring")  dolfin::GenericDofMap::tabulate_all_coordinates "
+Tabulate the coordinates of all dofs owned by this
+process. This function is typically used by preconditioners
+that require the spatial coordinates of dofs, for example
+for re-partitioning or nullspace computations. The format for
+the return vector is [x0, y0, z0, x1, y1, z1, . . .].
+";
+
+%feature("docstring")  dolfin::GenericDofMap::copy "
+Create a copy of the dof map
+";
+
+%feature("docstring")  dolfin::GenericDofMap::create "
+Create a new dof map on new mesh
+";
+
+%feature("docstring")  dolfin::GenericDofMap::extract_sub_dofmap "
+Extract sub dofmap component
+";
+
+%feature("docstring")  dolfin::GenericDofMap::collapse "
+Create a \"collapsed\" a dofmap (collapses from a sub-dofmap view)
+";
+
+%feature("docstring")  dolfin::GenericDofMap::dofs "
+Return list of global dof indices on this process
+";
+
+%feature("docstring")  dolfin::GenericDofMap::set "
+Set dof entries in vector to a specified value. Parallel
+layout of vector must be consistent with dof map range. This
+function is typically used to construct the null space of a
+matrix operator
+";
+
+%feature("docstring")  dolfin::GenericDofMap::set_x "
+Set dof entries in vector to the value*x[i], where x[i] is the
+spatial coordinate of the dof. Parallel layout of vector must
+be consistent with dof map range. This function is typically
+used to construct the null space of a matrix operator, e.g. rigid
+body rotations.
+";
+
+%feature("docstring")  dolfin::GenericDofMap::shared_dofs "
+Return map from shared dofs to the processes (not including
+the current process) that share it.
+";
+
+%feature("docstring")  dolfin::GenericDofMap::neighbours "
+Return set of processes that share dofs with the this process
+";
+
+%feature("docstring")  dolfin::GenericDofMap::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=fem, header=DofMap.h)
+%feature("docstring")  dolfin::DofMap "
+This class handles the mapping of degrees of freedom. It builds
+a dof map based on a ufc::dofmap on a specific mesh. It will
+reorder the dofs when running in parallel. Sub-dofmaps, both
+views and copies, are supported.
+";
+
+%feature("docstring")  dolfin::DofMap::DofMap "
+**Overloaded versions**
+
+* DofMap\ (ufc_dofmap, mesh)
+
+  Create dof map on mesh (mesh is not stored)
+  
+  *Arguments*
+      ufc_dofmap (ufc::dofmap)
+          The ufc::dofmap.
+      mesh (:py:class:`Mesh`)
+          The mesh.
+
+* DofMap\ (ufc_dofmap, mesh, constrained_domain)
+
+  Create a periodic dof map on mesh (mesh is not stored)
+  
+  *Arguments*
+      ufc_dofmap (ufc::dofmap)
+          The ufc::dofmap.
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      conatrained_boundary (:py:class:`SubDomain`)
+          The subdomain marking the constrained (tied) boudaries.
+
+* DofMap\ (ufc_dofmap, restriction)
+
+  Create restricted dof map on mesh
+  
+  *Arguments*
+      ufc_dofmap (ufc::dofmap)
+          The ufc::dofmap.
+      restriction (:py:class:`Restriction`)
+          The restriction.
+";
+
+%feature("docstring")  dolfin::DofMap::is_view "
+True iff dof map is a view into another map
+
+*Returns*
+    bool
+        True if the dof map is a sub-dof map (a view into
+        another map).
+";
+
+%feature("docstring")  dolfin::DofMap::is_restricted "
+True if dof map is restricted
+
+*Returns*
+    bool
+        True if dof map is restricted
+";
+
+%feature("docstring")  dolfin::DofMap::global_dimension "
+Return the dimension of the global finite element function
+space
+
+*Returns*
+    int
+        The dimension of the global finite element function space.
+";
+
+%feature("docstring")  dolfin::DofMap::cell_dimension "
+Return the dimension of the local finite element function
+space on a cell
+
+*Arguments*
+    cell_index (int)
+        Index of cell
+
+*Returns*
+    int
+        Dimension of the local finite element function space.
+";
+
+%feature("docstring")  dolfin::DofMap::max_cell_dimension "
+Return the maximum dimension of the local finite element
+function space
+
+*Returns*
+    int
+        Maximum dimension of the local finite element function
+        space.
+";
+
+%feature("docstring")  dolfin::DofMap::num_entity_dofs "
+Return the number of dofs for a given entity dimension
+
+*Arguments*
+    dim (int)
+        Entity dimension
+
+*Returns*
+    int
+        Number of dofs associated with given entity dimension
+";
+
+%feature("docstring")  dolfin::DofMap::geometric_dimension "
+Return the geometric dimension of the coordinates this dof map
+provides
+
+*Returns*
+    int
+        The geometric dimension.
+";
+
+%feature("docstring")  dolfin::DofMap::num_facet_dofs "
+Return number of facet dofs
+
+*Returns*
+    int
+        The number of facet dofs.
+";
+
+%feature("docstring")  dolfin::DofMap::ownership_range "
+Return the ownership range (dofs in this range are owned by
+this process)
+
+*Returns*
+    (int, int)
+        The ownership range.
+";
+
+%feature("docstring")  dolfin::DofMap::off_process_owner "
+Return map from nonlocal dofs that appear in local dof map to
+owning process
+
+*Returns*
+    boost::unordered_map<std::size_t, std::size_t>
+        The map from non-local dofs.
+";
+
+%feature("docstring")  dolfin::DofMap::shared_dofs "
+Return map from all shared dofs to the sharing processes (not
+including the current process) that share it.
+
+*Returns*
+    boost::unordered_map<std::size_t, std::vector<unsigned int> >
+        The map from dofs to list of processes
+";
+
+%feature("docstring")  dolfin::DofMap::neighbours "
+Return set of processes that share dofs with this process
+
+*Returns*
+    set of int
+        The set of processes
+";
+
+%feature("docstring")  dolfin::DofMap::cell_dofs "
+Local-to-global mapping of dofs on a cell
+
+*Arguments*
+    cell_index (int)
+        The cell index.
+
+*Returns*
+    std::vector<dolfin::la_index>
+        Local-to-global mapping of dofs.
+";
+
+%feature("docstring")  dolfin::DofMap::tabulate_facet_dofs "
+Tabulate local-local facet dofs
+
+*Arguments*
+    dofs (int)
+        Degrees of freedom.
+    local_facet (int)
+        The local facet.
+";
+
+%feature("docstring")  dolfin::DofMap::tabulate_entity_dofs "
+Tabulate local-local mapping of dofs on entity (dim, local_entity)
+
+*Arguments*
+    dofs (int)
+        Degrees of freedom.
+    dim (int)
+        The entity dimension
+    local_entity (int)
+        The local entity index
+";
+
+%feature("docstring")  dolfin::DofMap::tabulate_coordinates "
+Tabulate the coordinates of all dofs on a cell (UFC cell
+version)
+
+*Arguments*
+    coordinates (boost::multi_array<double, 2>)
+        The coordinates of all dofs on a cell.
+    vertex_coordinates (numpy.array(float))
+        The cell vertex coordinates
+    cell (Cell)
+        The cell.
+";
+
+%feature("docstring")  dolfin::DofMap::tabulate_all_coordinates "
+Tabulate the coordinates of all dofs on this process. This
+function is typically used by preconditioners that require the
+spatial coordinates of dofs, for example for re-partitioning or
+nullspace computations.
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        The mesh.
+
+*Returns*
+    numpy.array(float)
+        The dof coordinates (x0, y0, x1, y1, . . .)
+";
+
+%feature("docstring")  dolfin::DofMap::copy "
+Create a copy of the dof map
+
+*Returns*
+    DofMap
+        The Dofmap copy.
+";
+
+%feature("docstring")  dolfin::DofMap::create "
+Create a copy of the dof map on a new mesh
+
+*Arguments*
+    new_mesh (:py:class:`Mesh`)
+        The new mesh to create the dof map on.
+
+*Returns*
+    DofMap
+        The new Dofmap copy.
+";
+
+%feature("docstring")  dolfin::DofMap::extract_sub_dofmap "
+Extract subdofmap component
+
+*Arguments*
+    component (numpy.array(int))
+        The component.
+    mesh (:py:class:`Mesh`)
+        The mesh.
+
+*Returns*
+    DofMap
+        The subdofmap component.
+";
+
+%feature("docstring")  dolfin::DofMap::collapse "
+Create a \"collapsed\" dofmap (collapses a sub-dofmap)
+
+*Arguments*
+    collapsed_map (boost::unordered_map<std::size_t, std::size_t>)
+        The \"collapsed\" map.
+    mesh (:py:class:`Mesh`)
+        The mesh.
+
+*Returns*
+    DofMap
+        The collapsed dofmap.
+";
+
+%feature("docstring")  dolfin::DofMap::set "
+Set dof entries in vector to a specified value. Parallel layout
+of vector must be consistent with dof map range. This
+function is typically used to construct the null space of a
+matrix operator.
+
+*Arguments*
+    vector (:py:class:`GenericVector`)
+        The vector to set.
+    value (float)
+        The value to set.
+";
+
+%feature("docstring")  dolfin::DofMap::set_x "
+Set dof entries in vector to the x[i] coordinate of the dof
+spatial coordinate. Parallel layout of vector must be consistent
+with dof map range This function is typically used to
+construct the null space of a matrix operator, e.g. rigid
+body rotations.
+
+*Arguments*
+    vector (:py:class:`GenericVector`)
+        The vector to set.
+    value (float)
+        The value to multiply to coordinate by.
+    component (int)
+        The coordinate index.
+    mesh (:py:class:`Mesh`)
+        The mesh.
+";
+
+%feature("docstring")  dolfin::DofMap::data "
+Return the underlying dof map data. Intended for internal library
+use only.
+
+*Returns*
+    std::vector<std::vector<dolfin::la_index> >
+        The local-to-global map for each cell.
+";
+
+%feature("docstring")  dolfin::DofMap::str "
+Return informal string representation (pretty-print)
+
+*Arguments*
+    verbose (bool)
+        Flag to turn on additional output.
+
+*Returns*
+    str
+        An informal representation of the function space.
+";
+
+// Documentation extracted from: (module=fem, header=fem_utils.h)
+%feature("docstring")  dolfin::dof_to_vertex_map "
+Return a map between dofs indices and vertex indices
+
+Only works for FunctionSpace with dofs exclusively on vertices.
+For MixedFunctionSpaces vertex index is offset with the number
+of dofs per vertex. In parallel the returned map only maps local
+(to processor) dofs.
+
+*Arguments*
+    space (:py:class:`FunctionSpace`)
+        The FunctionSpace for what the dof to vertex map should be computed for
+
+*Returns*
+    numpy.array(int)
+        The dof to vertex map
+";
+
+%feature("docstring")  dolfin::vertex_to_dof_map "
+Return a map between vertex indices and dofs indices
+
+Only works for FunctionSpace with dofs exclusively on vertices.
+For MixedFunctionSpaces dof index is offset with the number of
+dofs per vertex.
+
+*Arguments*
+    space (:py:class:`FunctionSpace`)
+        The FunctionSpace for what the vertex to dof map should be computed for
+
+*Returns*
+    std::vector<dolfin::la_index>
+        The vertex to dof map
+";
+
+// Documentation extracted from: (module=fem, header=Equation.h)
+%feature("docstring")  dolfin::Equation "
+This class represents a variational equation lhs == rhs.
+The equation can be either linear or nonlinear:
+
+1. Linear (a == L), in which case a must be a bilinear form
+   and L must be a linear form.
+
+2. Nonlinear (F == 0), in which case F must be a linear form.
+";
+
+%feature("docstring")  dolfin::Equation::Equation "
+**Overloaded versions**
+
+* Equation\ (a, L)
+
+  Create equation a == L
+
+* Equation\ (F, rhs)
+
+  Create equation F == 0
+";
+
+%feature("docstring")  dolfin::Equation::is_linear "
+Check whether equation is linear
+";
+
+%feature("docstring")  dolfin::Equation::lhs "
+Return form for left-hand side
+";
+
+%feature("docstring")  dolfin::Equation::rhs "
+Return form for right-hand side
+";
+
+%feature("docstring")  dolfin::Equation::rhs_int "
+Return value for right-hand side
+";
+
+// Documentation extracted from: (module=fem, header=FiniteElement.h)
+%feature("docstring")  dolfin::FiniteElement "
+This is a wrapper for a UFC finite element (ufc::finite_element).
+";
+
+%feature("docstring")  dolfin::FiniteElement::FiniteElement "
+Create finite element from UFC finite element (data may be shared)
+";
+
+%feature("docstring")  dolfin::FiniteElement::signature "
+Return a string identifying the finite element
+";
+
+%feature("docstring")  dolfin::FiniteElement::cell_shape "
+Return the cell shape
+";
+
+%feature("docstring")  dolfin::FiniteElement::space_dimension "
+Return the dimension of the finite element function space
+";
+
+%feature("docstring")  dolfin::FiniteElement::value_rank "
+Return the rank of the value space
+";
+
+%feature("docstring")  dolfin::FiniteElement::value_dimension "
+Return the dimension of the value space for axis i
+";
+
+%feature("docstring")  dolfin::FiniteElement::evaluate_basis "
+Evaluate basis function i at given point in cell
+";
+
+%feature("docstring")  dolfin::FiniteElement::evaluate_basis_all "
+Evaluate all basis functions at given point in cell
+";
+
+%feature("docstring")  dolfin::FiniteElement::evaluate_basis_derivatives "
+Evaluate order n derivatives of basis function i at given point in cell
+";
+
+%feature("docstring")  dolfin::FiniteElement::evaluate_basis_derivatives_all "
+Evaluate order n derivatives of all basis functions at given
+point in cell
+";
+
+%feature("docstring")  dolfin::FiniteElement::evaluate_dof "
+**Overloaded versions**
+
+* evaluate_dof\ (i, function, vertex_coordinates, cell_orientation, c)
+
+  Evaluate linear functional for dof i on the function f
+
+* evaluate_dof\ (i, function, c)
+
+  Evaluate linear functional for dof i on the function f
+";
+
+%feature("docstring")  dolfin::FiniteElement::evaluate_dofs "
+**Overloaded versions**
+
+* evaluate_dofs\ (values, f, vertex_coordinates, cell_orientation, c)
+
+  Evaluate linear functionals for all dofs on the function f
+
+* evaluate_dofs\ (values, f, c)
+
+  Evaluate linear functionals for all dofs on the function f
+";
+
+%feature("docstring")  dolfin::FiniteElement::interpolate_vertex_values "
+Interpolate vertex values from dof values
+";
+
+%feature("docstring")  dolfin::FiniteElement::map_from_reference_cell "
+Map coordinate xhat from reference cell to coordinate x in cell
+";
+
+%feature("docstring")  dolfin::FiniteElement::map_to_reference_cell "
+Map from coordinate x in cell to coordinate xhat in reference cell
+";
+
+%feature("docstring")  dolfin::FiniteElement::num_sub_elements "
+Return the number of sub elements (for a mixed element)
+";
+
+%feature("docstring")  dolfin::FiniteElement::hash "
+Return simple hash of the signature string
+";
+
+%feature("docstring")  dolfin::FiniteElement::create_sub_element "
+Create a new finite element for sub element i (for a mixed element)
+";
+
+%feature("docstring")  dolfin::FiniteElement::create "
+Create a new class instance
+";
+
+%feature("docstring")  dolfin::FiniteElement::extract_sub_element "
+Extract sub finite element for component
+";
+
+// Documentation extracted from: (module=fem, header=BasisFunction.h)
+%feature("docstring")  dolfin::BasisFunction "
+This class represents a finite element basis function. It can be
+used for computation of basis function values and derivatives.
+
+Evaluation of basis functions is also possible through the use
+of the functions ``evaluate_basis`` and ``evaluate_basis_derivatives``
+available in the :py:class:`FiniteElement` class. The BasisFunction class
+relies on these functions for evaluation but also implements the
+ufc::function interface which allows evaluate_dof to be
+evaluated for a basis function (on a possibly different
+element).
+";
+
+%feature("docstring")  dolfin::BasisFunction::BasisFunction "
+Create basis function with given index on element on given cell
+
+*Arguments*
+    index (int)
+        The index of the basis function.
+    element (:py:class:`FiniteElement`)
+        The element to create basis function on.
+    cell (ufc::cell)
+        The cell.
+";
+
+%feature("docstring")  dolfin::BasisFunction::eval "
+Evaluate basis function at given point
+
+*Arguments*
+    values (float)
+        The values of the function at the point.
+    x (float)
+        The coordinates of the point.
+";
+
+%feature("docstring")  dolfin::BasisFunction::eval_derivatives "
+Evaluate all order n derivatives at given point
+
+*Arguments*
+    values (float)
+        The values of derivatives at the point.
+    x (float)
+        The coordinates of the point.
+    n (int)
+        The order of derivation.
+";
+
+%feature("docstring")  dolfin::BasisFunction::evaluate "
+Evaluate function at given point in cell
+
+*Arguments*
+    values (float)
+        The values of the function at the point..
+    coordinates (float)
+        The coordinates of the point.
+    cell (ufc::cell)
+        The cell.
+";
+
+// Documentation extracted from: (module=fem, header=DirichletBC.h)
+%feature("docstring")  dolfin::DirichletBC "
+This class specifies the interface for setting (strong)
+Dirichlet boundary conditions for partial differential
+equations,
+
+.. math::
+
+    u = g \hbox{ on } G,
+
+where :math:`u` is the solution to be computed, :math:`g` is a function
+and :math:`G` is a sub domain of the mesh.
+
+A DirichletBC is specified by the function g, the function space
+(trial space) and boundary indicators on (a subset of) the mesh
+boundary.
+
+The boundary indicators may be specified in a number of
+different ways.
+
+The simplest approach is to specify the boundary by a :py:class:`SubDomain`
+object, using the inside() function to specify on which facets
+the boundary conditions should be applied. The boundary facets
+will then be searched for and marked *only* on the first call to
+apply. This means that the mesh could be moved after the first
+apply and the boundary markers would still remain intact.
+
+Alternatively, the boundary may be specified by a :py:class:`MeshFunction`
+labeling all mesh facets together with a number that specifies
+which facets should be included in the boundary.
+
+The third option is to attach the boundary information to the
+mesh. This is handled automatically when exporting a mesh from
+for example VMTK.
+
+The 'method' variable may be used to specify the type of method
+used to identify degrees of freedom on the boundary. Available
+methods are: topological approach (default), geometric approach,
+and pointwise approach. The topological approach is faster, but
+will only identify degrees of freedom that are located on a
+facet that is entirely on the boundary. In particular, the
+topological approach will not identify degrees of freedom for
+discontinuous elements (which are all internal to the cell). A
+remedy for this is to use the geometric approach. In the
+geometric approach, each dof on each facet that matches the
+boundary condition will be checked. To apply pointwise boundary
+conditions e.g. pointloads, one will have to use the pointwise
+approach. The three possibilties are \"topological\", \"geometric\"
+and \"pointwise\".
+
+The 'check_midpoint' variable can be used to decide whether or
+not the midpoint of each facet should be checked when a
+user-defined :py:class:`SubDomain` is used to define the domain of the
+boundary condition. By default, midpoints are always checked.
+Note that this variable may be of importance close to corners,
+in which case it is sometimes important to check the midpoint to
+avoid including facets \"on the diagonal close\" to a corner. This
+variable is also of importance for curved boundaries (like on a
+sphere or cylinder), in which case it is important *not* to
+check the midpoint which will be located in the interior of a
+domain defined relative to a radius.
+";
+
+%feature("docstring")  dolfin::DirichletBC::DirichletBC "
+**Overloaded versions**
+
+* DirichletBC\ (V, g, sub_domain, method=\"topological\", check_midpoint=true)
+
+  Create boundary condition for subdomain
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      g (:py:class:`GenericFunction`)
+          The value.
+      sub_domain (:py:class:`SubDomain`)
+          The subdomain.
+      method (str)
+          Optional argument: A string specifying
+          the method to identify dofs.
+
+* DirichletBC\ (V, g, sub_domain, method=\"topological\", check_midpoint=true)
+
+  Create boundary condition for subdomain
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space
+      g (:py:class:`GenericFunction`)
+          The value
+      sub_domain (:py:class:`SubDomain`)
+          The subdomain
+      method (str)
+          Optional argument: A string specifying
+          the method to identify dofs
+
+* DirichletBC\ (V, g, sub_domains, sub_domain, method=\"topological\")
+
+  Create boundary condition for subdomain specified by index
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      g (:py:class:`GenericFunction`)
+          The value.
+      sub_domains (:py:class:`MeshFunction`)
+          Subdomain markers
+      sub_domain (int)
+          The subdomain index (number)
+      method (str)
+          Optional argument: A string specifying the
+          method to identify dofs.
+
+* DirichletBC\ (V, g, sub_domains, sub_domain, method=\"topological\")
+
+  Create boundary condition for subdomain specified by index
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      g (:py:class:`GenericFunction`)
+          The value.
+      sub_domains (:py:class:`MeshFunction`)
+          Subdomain markers
+      sub_domain (int)
+          The subdomain index (number)
+      method (str)
+          Optional argument: A string specifying the
+          method to identify dofs.
+
+* DirichletBC\ (V, g, sub_domain, method=\"topological\")
+
+  Create boundary condition for boundary data included in the mesh
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      g (:py:class:`GenericFunction`)
+          The value.
+      sub_domain (int)
+          The subdomain index (number)
+      method (str)
+          Optional argument: A string specifying the
+          method to identify dofs.
+
+* DirichletBC\ (V, g, sub_domain, method=\"topological\")
+
+  Create boundary condition for boundary data included in the mesh
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      g (:py:class:`GenericFunction`)
+          The value.
+      sub_domain (int)
+          The subdomain index (number)
+      method (str)
+          Optional argument: A string specifying the
+          method to identify dofs.
+
+* DirichletBC\ (V, g, markers, method=\"topological\")
+
+  Create boundary condition for subdomain by boundary markers
+  (cells, local facet numbers)
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      g (:py:class:`GenericFunction`)
+          The value.
+      markers (numpy.array(int))
+          Subdomain markers (facet index local to process)
+      method (str)
+          Optional argument: A string specifying the
+          method to identify dofs.
+
+* DirichletBC\ (bc)
+
+  Copy constructor
+  
+  *Arguments*
+      bc (:py:class:`DirichletBC`)
+          The object to be copied.
+";
+
+%feature("docstring")  dolfin::DirichletBC::operator= "
+Assignment operator
+
+*Arguments*
+    bc (:py:class:`DirichletBC`)
+        Another DirichletBC object.
+";
+
+%feature("docstring")  dolfin::DirichletBC::apply "
+**Overloaded versions**
+
+* apply\ (A)
+
+  Apply boundary condition to a matrix
+  
+  *Arguments*
+      A (:py:class:`GenericMatrix`)
+          The matrix to apply boundary condition to.
+
+* apply\ (b)
+
+  Apply boundary condition to a vector
+  
+  *Arguments*
+      b (:py:class:`GenericVector`)
+          The vector to apply boundary condition to.
+
+* apply\ (A, b)
+
+  Apply boundary condition to a linear system
+  
+  *Arguments*
+      A (:py:class:`GenericMatrix`)
+          The matrix to apply boundary condition to.
+      b (:py:class:`GenericVector`)
+          The vector to apply boundary condition to.
+
+* apply\ (b, x)
+
+  Apply boundary condition to vectors for a nonlinear problem
+  
+  *Arguments*
+      b (:py:class:`GenericVector`)
+          The vector to apply boundary conditions to.
+      x (:py:class:`GenericVector`)
+          Another vector (nonlinear problem).
+
+* apply\ (A, b, x)
+
+  Apply boundary condition to a linear system for a nonlinear problem
+  
+  *Arguments*
+      A (:py:class:`GenericMatrix`)
+          The matrix to apply boundary conditions to.
+      b (:py:class:`GenericVector`)
+          The vector to apply boundary conditions to.
+      x (:py:class:`GenericVector`)
+          Another vector (nonlinear problem).
+";
+
+%feature("docstring")  dolfin::DirichletBC::get_boundary_values "
+Get Dirichlet dofs and values. If a method other than 'pointwise' is
+used in parallel, the map may not be complete for local vertices since
+a vertex can have a bc applied, but the partition might not have a
+facet on the boundary. To ensure all local boundary dofs are marked,
+it is necessary to call gather() on the returned boundary values.
+
+*Arguments*
+    boundary_values (boost::unordered_map<std::size_t, double>)
+        Map from dof to boundary value.
+    method (str)
+        Optional argument: A string specifying which
+        method to use.
+";
+
+%feature("docstring")  dolfin::DirichletBC::gather "
+Get boundary values from neighbour processes. If a method other than
+\"pointwise\" is used, this is necessary to ensure all boundary dofs are
+marked on all processes.
+
+*Arguments*
+    boundary_values (boost::unordered_map<std::size_t, double>)
+        Map from dof to boundary value.
+";
+
+%feature("docstring")  dolfin::DirichletBC::zero "
+Make rows of matrix associated with boundary condition zero,
+useful for non-diagonal matrices in a block matrix.
+
+*Arguments*
+    A (:py:class:`GenericMatrix`)
+        The matrix
+";
+
+%feature("docstring")  dolfin::DirichletBC::zero_columns "
+Make columns of matrix associated with boundary condition
+zero, and update a (right-hand side) vector to reflect the
+changes. Useful for non-diagonals.
+
+*Arguments*
+    A (:py:class:`GenericMatrix`)
+        The matrix
+    b (:py:class:`GenericVector`)
+        The vector
+    diag_val (float)
+        This parameter would normally be -1, 0 or 1.
+";
+
+%feature("docstring")  dolfin::DirichletBC::markers "
+Return boundary markers
+
+*Returns*
+    numpy.array((int, int))
+        Boundary markers (facets stored as pairs of cells and
+        local facet numbers).
+";
+
+%feature("docstring")  dolfin::DirichletBC::function_space "
+Return function space V
+
+*Returns*
+    _FunctionSPace_
+        The function space to which boundary conditions are applied.
+";
+
+%feature("docstring")  dolfin::DirichletBC::value "
+Return boundary value g
+
+*Returns*
+    :py:class:`GenericFunction`
+        The boundary values.
+";
+
+%feature("docstring")  dolfin::DirichletBC::user_sub_domain "
+Return shared pointer to subdomain
+
+*Returns*
+    :py:class:`SubDomain`
+        Shared pointer to subdomain.
+";
+
+%feature("docstring")  dolfin::DirichletBC::is_compatible "
+Check if given function is compatible with boundary condition
+(checking only vertex values)
+
+*Arguments*
+    v (:py:class:`GenericFunction`)
+        The function to check for compability
+        with boundary condition.
+
+*Returns*
+    bool
+        True if compatible.
+";
+
+%feature("docstring")  dolfin::DirichletBC::set_value "
+**Overloaded versions**
+
+* set_value\ (g)
+
+  Set value g for boundary condition, domain remains unchanged
+  
+  *Arguments*
+      g (:py:class:`GenericFunction`)
+          The value.
+
+* set_value\ (g)
+
+  Set value g for boundary condition, domain remains unchanged
+  
+  *Arguments*
+      g (:py:class:`GenericFunction`)
+          The value.
+";
+
+%feature("docstring")  dolfin::DirichletBC::homogenize "
+Set value to 0.0
+";
+
+%feature("docstring")  dolfin::DirichletBC::method "
+Return method used for computing Dirichet dofs
+
+*Returns*
+    str
+        Method used for computing Dirichet dofs (\"topological\",
+        \"geometric\" or \"pointwise\").
+";
+
+%feature("docstring")  dolfin::DirichletBC::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=fem, header=PointSource.h)
+%feature("docstring")  dolfin::PointSource "
+This class provides an easy mechanism for adding a point source
+(Dirac delta function) to the right-hand side vector in a
+variational problem. The associated function space must be
+scalar in order for the inner product with the (scalar) Dirac
+delta function to be well defined.
+";
+
+%feature("docstring")  dolfin::PointSource::PointSource "
+**Overloaded versions**
+
+* PointSource\ (V, p, magnitude=1.0)
+
+  Create point source at given point of given magnitude
+
+* PointSource\ (V, p, magnitude=1.0)
+
+  Create point source at given point of given magnitude
+";
+
+%feature("docstring")  dolfin::PointSource::apply "
+Apply (add) point source to right-hand side vector
+";
+
+// Documentation extracted from: (module=fem, header=assemble.h)
+%feature("docstring")  dolfin::assemble "
+**Overloaded versions**
+
+* assemble\ (A, a)
+
+  Assemble tensor
+
+* assemble\ (a)
+
+  Assemble scalar
+";
+
+%feature("docstring")  dolfin::assemble_system "
+**Overloaded versions**
+
+* assemble_system\ (A, b, a, L)
+
+  Assemble system (A, b)
+
+* assemble_system\ (A, b, a, L, bc)
+
+  Assemble system (A, b) and apply Dirichlet boundary condition
+
+* assemble_system\ (A, b, a, L, bcs)
+
+  Assemble system (A, b) and apply Dirichlet boundary conditions
+
+* assemble_system\ (A, b, a, L, bcs, x0)
+
+  Assemble system (A, b) on sub domains and apply Dirichlet boundary
+  conditions
+";
+
+// Documentation extracted from: (module=fem, header=LocalSolver.h)
+%feature("docstring")  dolfin::LocalSolver::solve "
+Solve local (cell-wise) problem and copy result into global
+vector x.
+";
+
+// Documentation extracted from: (module=fem, header=solve.h)
+%feature("docstring")  dolfin::solve "
+**Overloaded versions**
+
+* solve\ (equation, u, parameters=empty_parameters)
+
+  Solve linear variational problem a(u, v) == L(v) or nonlinear
+  variational problem F(u; v) = 0 without boundary conditions.
+  
+  Optional parameters can be passed to the LinearVariationalSolver
+  or NonlinearVariationalSolver classes.
+
+* solve\ (equation, u, bc, parameters=empty_parameters)
+
+  Solve linear variational problem a(u, v) == L(v) or nonlinear
+  variational problem F(u; v) = 0 with a single boundary condition.
+  
+  Optional parameters can be passed to the LinearVariationalSolver
+  or NonlinearVariationalSolver classes.
+
+* solve\ (equation, u, bcs, parameters=empty_parameters)
+
+  Solve linear variational problem a(u, v) == L(v) or nonlinear
+  variational problem F(u; v) = 0 with a list of boundary conditions.
+  
+  Optional parameters can be passed to the LinearVariationalSolver
+  or NonlinearVariationalSolver classes.
+
+* solve\ (equation, u, J, parameters=empty_parameters)
+
+  Solve nonlinear variational problem F(u; v) == 0 without boundary
+  conditions. The argument J should provide the Jacobian bilinear
+  form J = dF/du.
+  
+  Optional parameters can be passed to the LinearVariationalSolver
+  or NonlinearVariationalSolver classes.
+
+* solve\ (equation, u, bc, J, parameters=empty_parameters)
+
+  Solve nonlinear variational problem F(u; v) == 0 with a single
+  boundary condition. The argument J should provide the Jacobian
+  bilinear form J = dF/du.
+  
+  Optional parameters can be passed to the LinearVariationalSolver
+  or NonlinearVariationalSolver classes.
+
+* solve\ (equation, u, bcs, J, parameters=empty_parameters)
+
+  Solve nonlinear variational problem F(u; v) == 0 with a list of
+  boundary conditions. The argument J should provide the Jacobian
+  bilinear form J = dF/du.
+  
+  Optional parameters can be passed to the LinearVariationalSolver
+  or NonlinearVariationalSolver classes.
+";
+
+// Documentation extracted from: (module=fem, header=Form.h)
+%feature("docstring")  dolfin::Form "
+Base class for UFC code generated by FFC for DOLFIN with option -l.
+
+A note on the order of trial and test spaces: FEniCS numbers
+argument spaces starting with the leading dimension of the
+corresponding tensor (matrix). In other words, the test space is
+numbered 0 and the trial space is numbered 1. However, in order
+to have a notation that agrees with most existing finite element
+literature, in particular
+
+    a = a(u, v)
+
+the spaces are numbered from right to
+
+    a: V_1 x V_0 -> R
+
+.. note::
+
+    Figure out how to write this in math mode without it getting
+    messed up in the Python version.
+
+This is reflected in the ordering of the spaces that should be
+supplied to generated subclasses. In particular, when a bilinear
+form is initialized, it should be initialized as
+
+.. code-block:: c++
+
+    a(V_1, V_0) = ...
+
+where ``V_1`` is the trial space and ``V_0`` is the test space.
+However, when a form is initialized by a list of argument spaces
+(the variable ``function_spaces`` in the constructors below, the
+list of spaces should start with space number 0 (the test space)
+and then space number 1 (the trial space).
+";
+
+%feature("docstring")  dolfin::Form::Form "
+**Overloaded versions**
+
+* Form\ (rank, num_coefficients)
+
+  Create form of given rank with given number of coefficients
+  
+  *Arguments*
+      rank (int)
+          The rank.
+      num_coefficients (int)
+          The number of coefficients.
+
+* Form\ (ufc_form, function_spaces, coefficients)
+
+  Create form (shared data)
+  
+  *Arguments*
+      ufc_form (ufc::form)
+          The UFC form.
+      function_spaces (list of :py:class:`FunctionSpace`)
+          Vector of function spaces.
+      coefficients (list of :py:class:`GenericFunction`)
+          Vector of coefficients.
+";
+
+%feature("docstring")  dolfin::Form::rank "
+Return rank of form (bilinear form = 2, linear form = 1,
+functional = 0, etc)
+
+*Returns*
+    int
+        The rank of the form.
+";
+
+%feature("docstring")  dolfin::Form::num_coefficients "
+Return number of coefficients
+
+*Returns*
+    int
+        The number of coefficients.
+";
+
+%feature("docstring")  dolfin::Form::coloring "
+Return coloring type for colored (multi-threaded) assembly of form
+over a mesh entity of a given dimension
+
+*Arguments*
+    entity_dim (int)
+        Dimension.
+
+*Returns*
+    numpy.array(int)
+        Coloring type.
+";
+
+%feature("docstring")  dolfin::Form::set_mesh "
+Set mesh, necessary for functionals when there are no function spaces
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        The mesh.
+";
+
+%feature("docstring")  dolfin::Form::mesh "
+Extract common mesh from form
+
+*Returns*
+    :py:class:`Mesh`
+        The mesh.
+";
+
+%feature("docstring")  dolfin::Form::mesh_shared_ptr "
+Return mesh shared pointer (if any)
+
+*Returns*
+    :py:class:`Mesh`
+        The mesh shared pointer.
+";
+
+%feature("docstring")  dolfin::Form::function_space "
+Return function space for given argument
+
+*Arguments*
+    i (int)
+        Index
+
+*Returns*
+    :py:class:`FunctionSpace`
+        Function space shared pointer.
+";
+
+%feature("docstring")  dolfin::Form::function_spaces "
+Return function spaces for arguments
+
+*Returns*
+    list of :py:class:`FunctionSpace`
+        Vector of function space shared pointers.
+";
+
+%feature("docstring")  dolfin::Form::set_coefficient "
+**Overloaded versions**
+
+* set_coefficient\ (i, coefficient)
+
+  Set coefficient with given number (shared pointer version)
+  
+  *Arguments*
+      i (int)
+          The given number.
+      coefficient (:py:class:`GenericFunction`)
+          The coefficient.
+
+* set_coefficient\ (name, coefficient)
+
+  Set coefficient with given name (shared pointer version)
+  
+  *Arguments*
+      name (str)
+          The name.
+      coefficient (:py:class:`GenericFunction`)
+          The coefficient.
+";
+
+%feature("docstring")  dolfin::Form::set_coefficients "
+Set all coefficients in given map. All coefficients in the
+given map, which may contain only a subset of the coefficients
+of the form, will be set.
+
+*Arguments*
+    coefficients (:py:class:`GenericFunction`)
+        The map of coefficients.
+";
+
+%feature("docstring")  dolfin::Form::set_some_coefficients "
+Set some coefficients in given map. Each coefficient in the
+given map will be set, if the name of the coefficient matches
+the name of a coefficient in the form.
+
+This is useful when reusing the same coefficient map for
+several forms, or when some part of the form has been
+outcommented (for testing) in the UFL file, which means that
+the coefficient and attaching it to the form does not need to
+be outcommented in a C++ program using code from the generated
+UFL file.
+
+*Arguments*
+    coefficients (:py:class:`GenericFunction`)
+        The map of coefficients.
+";
+
+%feature("docstring")  dolfin::Form::coefficient "
+**Overloaded versions**
+
+* coefficient\ (i)
+
+  Return coefficient with given number
+  
+  *Arguments*
+      i (int)
+          Index
+  
+  *Returns*
+      :py:class:`GenericFunction`
+          The coefficient.
+
+* coefficient\ (name)
+
+  Return coefficient with given name
+  
+  *Arguments*
+      name (str)
+          The name.
+  
+  *Returns*
+      :py:class:`GenericFunction`
+          The coefficient.
+";
+
+%feature("docstring")  dolfin::Form::coefficients "
+Return all coefficients
+
+*Returns*
+    list of :py:class:`GenericFunction`
+        All coefficients.
+";
+
+%feature("docstring")  dolfin::Form::coefficient_number "
+Return the number of the coefficient with this name
+
+*Arguments*
+    name (str)
+        The name.
+
+*Returns*
+    int
+        The number of the coefficient with the given name.
+";
+
+%feature("docstring")  dolfin::Form::coefficient_name "
+Return the name of the coefficient with this number
+
+*Arguments*
+    i (int)
+        The number
+
+*Returns*
+    str
+        The name of the coefficient with the given number.
+";
+
+%feature("docstring")  dolfin::Form::cell_domains "
+Return cell domains (zero pointer if no domains have been
+specified)
+
+*Returns*
+    :py:class:`MeshFunction`
+        The cell domains.
+";
+
+%feature("docstring")  dolfin::Form::exterior_facet_domains "
+Return exterior facet domains (zero pointer if no domains have
+been specified)
+
+*Returns*
+    :py:class:`MeshFunction`
+        The exterior facet domains.
+";
+
+%feature("docstring")  dolfin::Form::interior_facet_domains "
+Return interior facet domains (zero pointer if no domains have
+been specified)
+
+*Returns*
+    :py:class:`MeshFunction`
+        The interior facet domains.
+";
+
+%feature("docstring")  dolfin::Form::set_cell_domains "
+Set cell domains
+
+*Arguments*
+    cell_domains (:py:class:`MeshFunction`)
+        The cell domains.
+";
+
+%feature("docstring")  dolfin::Form::set_exterior_facet_domains "
+Set exterior facet domains
+
+*Arguments*
+    exterior_facet_domains (:py:class:`MeshFunction`)
+        The exterior facet domains.
+";
+
+%feature("docstring")  dolfin::Form::set_interior_facet_domains "
+Set interior facet domains
+
+*Arguments*
+    interior_facet_domains (:py:class:`MeshFunction`)
+        The interior facet domains.
+";
+
+%feature("docstring")  dolfin::Form::ufc_form "
+Return UFC form shared pointer
+
+*Returns*
+    ufc::form
+        The UFC form.
+";
+
+%feature("docstring")  dolfin::Form::check "
+Check function spaces and coefficients
+";
+
+%feature("docstring")  dolfin::Form::operator== "
+**Overloaded versions**
+
+* operator==\ (rhs)
+
+  Comparison operator, returning equation lhs == rhs
+
+* operator==\ (rhs)
+
+  Comparison operator, returning equation lhs == 0
+";
+
+// Documentation extracted from: (module=fem, header=AssemblerBase.h)
+%feature("docstring")  dolfin::AssemblerBase "
+This class provides some common functions used in
+assembler classes.
+";
+
+// Documentation extracted from: (module=fem, header=Assembler.h)
+%feature("docstring")  dolfin::Assembler "
+This class provides automated assembly of linear systems, or
+more generally, assembly of a sparse tensor from a given
+variational form.
+
+Subdomains for cells and facets may be specified by assigning
+subdomain indicators specified by :py:class:`MeshFunction` to the :py:class:`Form`
+being assembled:
+
+   .. code-block:: c++
+
+       form.dx = cell_domains
+       form.ds = exterior_facet_domains
+       form.dS = interior_facet_domains
+";
+
+%feature("docstring")  dolfin::Assembler::Assembler "
+Constructor
+";
+
+%feature("docstring")  dolfin::Assembler::assemble "
+Assemble tensor from given form
+
+*Arguments*
+    A (:py:class:`GenericTensor`)
+        The tensor to assemble.
+    a (:py:class:`Form`)
+        The form to assemble the tensor from.
+";
+
+%feature("docstring")  dolfin::Assembler::assemble_cells "
+Assemble tensor from given form over cells. This function is
+provided for users who wish to build a customized assembler.
+";
+
+%feature("docstring")  dolfin::Assembler::assemble_exterior_facets "
+Assemble tensor from given form over exterior facets. This
+function is provided for users who wish to build a customized
+assembler.
+";
+
+%feature("docstring")  dolfin::Assembler::assemble_interior_facets "
+Assemble tensor from given form over interior facets. This
+function is provided for users who wish to build a customized
+assembler.
+";
+
+%feature("docstring")  dolfin::Assembler::add_to_global_tensor "
+Add cell tensor to global tensor. Hook to allow the SymmetricAssembler
+to split the cell tensor into symmetric/antisymmetric parts.
+";
+
+// Documentation extracted from: (module=fem, header=SparsityPatternBuilder.h)
+%feature("docstring")  dolfin::SparsityPatternBuilder "
+This class provides functions to compute the sparsity pattern.
+";
+
+%feature("docstring")  dolfin::SparsityPatternBuilder::build "
+Build sparsity pattern for assembly of given form
+";
+
+%feature("docstring")  dolfin::SparsityPatternBuilder::build_ccfem "
+Build sparsity pattern for assembly of given CCFEM form
+";
+
+// Documentation extracted from: (module=fem, header=SystemAssembler.h)
+%feature("docstring")  dolfin::SystemAssembler "
+This class provides an assembler for systems of the form
+Ax = b. It differs from the default DOLFIN assembler in that it
+applies boundary conditions at the time of assembly, which
+preserves any symmetries in A.
+";
+
+%feature("docstring")  dolfin::SystemAssembler::SystemAssembler "
+**Overloaded versions**
+
+* SystemAssembler\ (a, L)
+
+  Constructor
+
+* SystemAssembler\ (a, L, bc)
+
+  Constructor
+
+* SystemAssembler\ (a, L, bcs)
+
+  Constructor
+
+* SystemAssembler\ (a, L)
+
+  Constructor
+
+* SystemAssembler\ (a, L, bc)
+
+  Constructor
+
+* SystemAssembler\ (a, L, bcs)
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::SystemAssembler::assemble "
+**Overloaded versions**
+
+* assemble\ (A, b)
+
+  Assemble system (A, b)
+
+* assemble\ (A)
+
+  Assemble matrix A
+
+* assemble\ (b)
+
+  Assemble vector b
+
+* assemble\ (A, b, x0)
+
+  Assemble system (A, b) for (negative) increment dx, where
+  x = x0 - dx is solution to system a == -L subject to bcs.
+  Suitable for use inside a (quasi-)Newton solver.
+
+* assemble\ (b, x0)
+
+  Assemble rhs vector b for (negative) increment dx, where
+  x = x0 - dx is solution to system a == -L subject to bcs.
+  Suitable for use inside a (quasi-)Newton solver.
+";
+
+// Documentation extracted from: (module=fem, header=LinearVariationalProblem.h)
+%feature("docstring")  dolfin::LinearVariationalProblem "
+This class represents a linear variational problem:
+
+Find u in V such that
+
+    a(u, v) = L(v)  for all v in V^,
+
+where V is the trial space and V^ is the test space.
+";
+
+%feature("docstring")  dolfin::LinearVariationalProblem::LinearVariationalProblem "
+**Overloaded versions**
+
+* LinearVariationalProblem\ (a, L, u)
+
+  Create linear variational problem without boundary conditions
+
+* LinearVariationalProblem\ (a, L, u, bc)
+
+  Create linear variational problem with a single boundary condition
+
+* LinearVariationalProblem\ (a, L, u, bcs)
+
+  Create linear variational problem with a list of boundary conditions
+
+* LinearVariationalProblem\ (a, L, u, bcs)
+
+  Create linear variational problem with a list of boundary conditions
+  (shared pointer version)
+";
+
+%feature("docstring")  dolfin::LinearVariationalProblem::bilinear_form "
+Return bilinear form
+";
+
+%feature("docstring")  dolfin::LinearVariationalProblem::linear_form "
+Return linear form
+";
+
+%feature("docstring")  dolfin::LinearVariationalProblem::solution "
+**Overloaded versions**
+
+* solution\ ()
+
+  Return solution variable
+
+* solution\ ()
+
+  Return solution variable (const version)
+";
+
+%feature("docstring")  dolfin::LinearVariationalProblem::bcs "
+Return boundary conditions
+";
+
+%feature("docstring")  dolfin::LinearVariationalProblem::trial_space "
+Return trial space
+";
+
+%feature("docstring")  dolfin::LinearVariationalProblem::test_space "
+Return test space
+";
+
+// Documentation extracted from: (module=fem, header=LinearVariationalSolver.h)
+%feature("docstring")  dolfin::LinearVariationalSolver "
+This class implements a solver for linear variational problems.
+";
+
+%feature("docstring")  dolfin::LinearVariationalSolver::LinearVariationalSolver "
+**Overloaded versions**
+
+* LinearVariationalSolver\ (problem)
+
+  Create linear variational solver for given problem
+
+* LinearVariationalSolver\ (problem)
+
+  Create linear variational solver for given problem (shared
+  pointer version)
+";
+
+%feature("docstring")  dolfin::LinearVariationalSolver::solve "
+Solve variational problem
+";
+
+%feature("docstring")  dolfin::LinearVariationalSolver::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=fem, header=NonlinearVariationalProblem.h)
+%feature("docstring")  dolfin::NonlinearVariationalProblem "
+This class represents a nonlinear variational problem:
+
+Find u in V such that
+
+    F(u; v) = 0  for all v in V^,
+
+where V is the trial space and V^ is the test space.
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::NonlinearVariationalProblem "
+**Overloaded versions**
+
+* NonlinearVariationalProblem\ (F, u)
+
+  Create nonlinear variational problem without boundary
+  conditions.  The Jacobian form is not specified which requires
+  the use of a nonlinear solver that does not rely on the
+  Jacobian.
+
+* NonlinearVariationalProblem\ (F, u, J)
+
+  Create nonlinear variational problem without boundary
+  conditions.  The Jacobian form is specified which allows the
+  use of a nonlinear solver that relies on the Jacobian (using
+  Newton's method).
+
+* NonlinearVariationalProblem\ (F, u, bc)
+
+  Create nonlinear variational problem with a single boundary
+  condition.  The Jacobian form is not specified which requires
+  the use of a nonlinear solver that does not rely on the
+  Jacobian.
+
+* NonlinearVariationalProblem\ (F, u, bc, J)
+
+  Create nonlinear variational problem with a single boundary
+  condition.  The Jacobian form is specified which allows the
+  use of a nonlinear solver that relies on the Jacobian (using
+  Newton's method).
+
+* NonlinearVariationalProblem\ (F, u, bcs)
+
+  Create nonlinear variational problem with a list of boundary
+  conditions.  The Jacobian form is not specified which requires
+  the use of a nonlinear solver that does not rely on the
+  Jacobian.
+
+* NonlinearVariationalProblem\ (F, u, bcs, J)
+
+  Create nonlinear variational problem with a list of boundary
+  conditions.  The Jacobian form is specified which allows the
+  use of a nonlinear solver that relies on the Jacobian (using
+  Newton's method).
+
+* NonlinearVariationalProblem\ (F, u, bcs)
+
+  Create nonlinear variational problem, shared pointer version.
+  The Jacobian form is not specified which requires the use of a
+  nonlinear solver that does not rely on the Jacobian.
+
+* NonlinearVariationalProblem\ (F, u, bcs, J)
+
+  Create nonlinear variational problem, shared pointer version.
+  The Jacobian form is specified which allows the use of a
+  nonlinear solver that relies on the Jacobian (using Newton's
+  method).
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::set_bounds "
+**Overloaded versions**
+
+* set_bounds\ (lb, ub)
+
+  Set the bounds for bound constrained solver
+
+* set_bounds\ (lb, ub)
+
+  Set the bounds for bound constrained solver
+
+* set_bounds\ (lb_func, ub_func)
+
+  Set the bounds for bound constrained solver
+
+* set_bounds\ (lb_func, ub_func)
+
+  Set the bounds for bound constrained solver
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::residual_form "
+Return residual form
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::jacobian_form "
+Return Jacobian form
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::solution "
+**Overloaded versions**
+
+* solution\ ()
+
+  Return solution variable
+
+* solution\ ()
+
+  Return solution variable (const version)
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::bcs "
+Return boundary conditions
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::trial_space "
+Return trial space
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::test_space "
+Return test space
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::lower_bound "
+Return lower bound
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::upper_bound "
+Return upper bound
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::has_jacobian "
+Check whether Jacobian has been defined
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::has_lower_bound "
+Check whether lower bound has been defined
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalProblem::has_upper_bound "
+Check whether upper bound have has defined
+";
+
+// Documentation extracted from: (module=fem, header=NonlinearVariationalSolver.h)
+%feature("docstring")  dolfin::NonlinearVariationalSolver "
+This class implements a solver for nonlinear variational problems.
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalSolver::NonlinearVariationalSolver "
+**Overloaded versions**
+
+* NonlinearVariationalSolver\ (problem)
+
+  Create nonlinear variational solver for given problem
+
+* NonlinearVariationalSolver\ (problem)
+
+  Create nonlinear variational solver for given problem (shared
+  pointer version)
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalSolver::solve "
+**Overloaded versions**
+
+* solve\ (lb, ub)
+
+  Solve variational problem with bound constraints defined by
+  GenericVectors
+  
+  *Arguments*
+      lb (:py:class:`GenericVector`)
+          The linear solver.
+      ub (:py:class:`GenericVector`)
+          The factory.
+  *Returns*
+      (int, bool)
+          Pair of number of Newton iterations, and whether
+          iteration converged)
+
+* solve\ (lb, ub)
+
+  Solve variational problem with bound constraints defined by
+  GenericVectors (shared pointer version)
+  
+  *Arguments*
+      lb (_std::shared_ptr<const GenericVector>_)
+          The linear solver.
+      ub (_std::shared_ptr<const GenericVector>_)
+          The factory.
+  *Returns*
+      (int, bool)
+          Pair of number of Newton iterations, and whether
+          iteration converged)
+
+* solve\ (lb, ub)
+
+  Solve variational problem with bound constraints defined by Functions
+  
+  *Arguments*
+      lb (:py:class:`Function`)
+          The linear solver.
+      ub (:py:class:`Function`)
+          The factory.
+  *Returns*
+      (int, bool)
+          Pair of number of Newton iterations, and whether
+          iteration converged)
+
+* solve\ (lb, ub)
+
+  Solve variational problem with bound constraints defined by
+  Functions (shared pointer version)
+  
+  *Arguments*
+      lb (_std::shared_ptr<const Function>_)
+          The linear solver.
+      ub (_std::shared_ptr<const Function>_)
+          The factory.
+  *Returns*
+      (int, bool)
+          Pair of number of Newton iterations, and whether
+          iteration converged)
+
+* solve\ ()
+
+  Solve variational problem
+  
+  *Returns*
+      (int, bool)
+          Pair of number of Newton iterations, and whether
+          iteration converged)
+";
+
+%feature("docstring")  dolfin::NonlinearVariationalSolver::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=fem, header=CCFEMForm.h)
+%feature("docstring")  dolfin::CCFEMForm "
+This class represents a variational form on a cut and composite
+finite element function space (CCFEM) defined on one or more
+possibly intersecting meshes.
+
+FIXME: Document usage of class with add() followed by build()
+";
+
+%feature("docstring")  dolfin::CCFEMForm::CCFEMForm "
+**Overloaded versions**
+
+* CCFEMForm\ (function_space)
+
+  Create empty linear CCFEM variational form (shared pointer version)
+
+* CCFEMForm\ (function_space)
+
+  Create empty linear CCFEM variational form (reference version)
+
+* CCFEMForm\ (function_space_0, function_space_1)
+
+  Create empty bilinear CCFEM variational form (shared pointer version)
+
+* CCFEMForm\ (function_space_0, function_space_1)
+
+  Create empty bilinear CCFEM variational form (reference version)
+";
+
+%feature("docstring")  dolfin::CCFEMForm::rank "
+Return rank of form (bilinear form = 2, linear form = 1,
+functional = 0, etc)
+
+*Returns*
+    int
+        The rank of the form.
+";
+
+%feature("docstring")  dolfin::CCFEMForm::num_parts "
+Return the number of forms (parts) of the CCFEM form
+
+*Returns*
+    int
+        The number of forms (parts) of the CCFEM form.
+";
+
+%feature("docstring")  dolfin::CCFEMForm::part "
+Return form (part) number i
+
+*Returns*
+    :py:class:`Form`
+        Form (part) number i.
+";
+
+%feature("docstring")  dolfin::CCFEMForm::function_space "
+Return function space for given argument
+
+*Arguments*
+    i (int)
+        Index
+
+*Returns*
+    :py:class:`CCFEMFunctionSpace`
+        Function space shared pointer.
+";
+
+%feature("docstring")  dolfin::CCFEMForm::add "
+**Overloaded versions**
+
+* add\ (form)
+
+  Add form (shared pointer version)
+  
+  *Arguments*
+      form (:py:class:`Form`)
+          The form.
+
+* add\ (form)
+
+  Add form (reference version)
+  
+  *Arguments*
+      form (:py:class:`Form`)
+          The form.
+";
+
+%feature("docstring")  dolfin::CCFEMForm::build "
+Build CCFEM form
+";
+
+%feature("docstring")  dolfin::CCFEMForm::clear "
+Clear CCFEM form
+";
+
+// Documentation extracted from: (module=fem, header=CCFEMDofMap.h)
+%feature("docstring")  dolfin::CCFEMDofMap "
+This class handles the mapping of degrees of freedom for CCFEM
+function spaces.
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::CCFEMDofMap "
+Constructor
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::num_parts "
+Return the number dofmaps (parts) of the CCFEM dofmap
+
+*Returns*
+    int
+        The number of dofmaps (parts) of the CCFEM dofmap
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::part "
+Return dofmap (part) number i
+
+*Returns*
+    :py:class:`GenericDofMap`
+        Dofmap (part) number i
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::set_current_part "
+Set current part. This will make the CCFEM dofmap act as a
+dofmap for the part of the CCFEM function space defined on the
+current part (mesh).
+
+*Arguments*
+    part (int)
+        The number of the part.
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::add "
+**Overloaded versions**
+
+* add\ (dofmap)
+
+  Add dofmap (shared pointer version)
+  
+  *Arguments*
+      dofmap (:py:class:`GenericDofMap`)
+          The dofmap.
+
+* add\ (dofmap)
+
+  Add dofmap (reference version)
+  
+  *Arguments*
+      dofmap (:py:class:`DofMap`)
+          The dofmap.
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::build "
+Build CCFEM dofmap
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::clear "
+Clear CCFEM dofmap
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::is_view "
+True if dof map is a view into another map (is a sub-dofmap)
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::global_dimension "
+Return the dimension of the global finite element function
+space
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::cell_dimension "
+Return the dimension of the local finite element function
+space on a cell
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::max_cell_dimension "
+Return the maximum dimension of the local finite element
+function space
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::num_entity_dofs "
+Return the number of dofs for a given entity dimension
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::num_facet_dofs "
+Return number of facet dofs
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::restriction "
+Restriction if any. If the dofmap is not restricted, a null
+pointer is returned.
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::ownership_range "
+Return the ownership range (dofs in this range are owned by
+this process)
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::off_process_owner "
+Return map from nonlocal-dofs (that appear in local dof map)
+to owning process
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::cell_dofs "
+Local-to-global mapping of dofs on a cell
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::tabulate_facet_dofs "
+Tabulate local-local facet dofs
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::tabulate_entity_dofs "
+Tabulate the local-to-local mapping of dofs on entity
+(dim, local_entity)
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::tabulate_coordinates "
+Tabulate the coordinates of all dofs on a cell (UFC cell version)
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::tabulate_all_coordinates "
+Tabulate the coordinates of all dofs owned by this
+process. This function is typically used by preconditioners
+that require the spatial coordinates of dofs, for example
+for re-partitioning or nullspace computations. The format for
+the return vector is [x0, y0, z0, x1, y1, z1, . . .].
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::copy "
+Create a copy of the dof map
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::create "
+Create a new dof map on new mesh
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::extract_sub_dofmap "
+Extract sub dofmap component
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::collapse "
+Create a \"collapsed\" a dofmap (collapses from a sub-dofmap view)
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::dofs "
+Return list of global dof indices on this process
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::set "
+Set dof entries in vector to a specified value. Parallel
+layout of vector must be consistent with dof map range. This
+function is typically used to construct the null space of a
+matrix operator
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::set_x "
+Set dof entries in vector to the value*x[i], where x[i] is the
+spatial coordinate of the dof. Parallel layout of vector must
+be consistent with dof map range. This function is typically
+used to construct the null space of a matrix operator, e.g. rigid
+body rotations.
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::shared_dofs "
+Return map from shared dofs to the processes (not including
+the current process) that share it.
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::neighbours "
+Return set of processes that share dofs with the this process
+";
+
+%feature("docstring")  dolfin::CCFEMDofMap::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=fem, header=CCFEMAssembler.h)
+%feature("docstring")  dolfin::CCFEMAssembler "
+This class implements functionality for finite element assembly
+over cut and composite finite element (CCFEM) function spaces.
+";
+
+%feature("docstring")  dolfin::CCFEMAssembler::CCFEMAssembler "
+Constructor
+";
+
+%feature("docstring")  dolfin::CCFEMAssembler::assemble "
+Assemble tensor from given form
+
+*Arguments*
+    A (:py:class:`GenericTensor`)
+        The tensor to assemble.
+    a (:py:class:`Form`)
+        The form to assemble the tensor from.
+";
+
+// Documentation extracted from: (module=fem, header=OpenMpAssembler.h)
+%feature("docstring")  dolfin::OpenMpAssembler "
+This class provides automated assembly of linear systems, or
+more generally, assembly of a sparse tensor from a given
+variational form.
+
+The MeshFunction arguments can be used to specify assembly over
+subdomains of the mesh cells, exterior facets or interior
+facets. Either a null pointer or an empty MeshFunction may be
+used to specify that the tensor should be assembled over the
+entire set of cells or facets.
+";
+
+%feature("docstring")  dolfin::OpenMpAssembler::OpenMpAssembler "
+Constructor
+";
+
+%feature("docstring")  dolfin::OpenMpAssembler::assemble "
+Assemble tensor from given form
+";
+
diff --git a/dolfin/swig/fem/post.i b/dolfin/swig/fem/post.i
new file mode 100644
index 0000000..064a8d5
--- /dev/null
+++ b/dolfin/swig/fem/post.i
@@ -0,0 +1,195 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-10-22
+// Last changed: 2012-11-30
+
+// ===========================================================================
+// SWIG directives for the DOLFIN fem kernel module (post)
+//
+// The directives in this file are applied _after_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+//-----------------------------------------------------------------------------
+// Extend Function so f.function_space() return a dolfin.FunctionSpace
+//-----------------------------------------------------------------------------
+%extend dolfin::DirichletBC
+{
+%pythoncode %{
+def function_space(self):
+    "Return the FunctionSpace"
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(self._function_space())
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Extend Function so f.function_space() return a dolfin.FunctionSpace
+//-----------------------------------------------------------------------------
+%extend dolfin::Form {
+%pythoncode %{
+def function_space(self, i):
+    """
+    Return function space for given argument
+
+     *Arguments*
+         i (std::size_t)
+             Index
+
+     *Returns*
+         _FunctionSpace_
+             Function space shared pointer.
+    """
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(self._function_space(i))
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Extend GenericDofMap.tabulate_coordinates()
+//-----------------------------------------------------------------------------
+%extend dolfin::GenericDofMap {
+  void _tabulate_coordinates(PyObject* coordinates, const Cell& cell)
+  {
+    // NOTE: No NumPy array check. Assumed everything is coorect!
+
+    // Get NumPy array
+    PyArrayObject *xa = reinterpret_cast<PyArrayObject*>(coordinates);
+
+    // Initialize the boost::multi_array structure
+    boost::multi_array<double, 2> tmparray;
+
+    // Get cell vertex coordinates
+    std::vector<double> vertex_coordinates;
+    cell.get_vertex_coordinates(vertex_coordinates);
+
+    // Tabulate the coordinates
+    self->tabulate_coordinates(tmparray, vertex_coordinates, cell);
+
+    // Get geometric dimension
+    std::size_t gdim = tmparray.shape()[1];
+
+    // Copy data
+    double* data = static_cast<double*>(PyArray_DATA(xa));
+    for (std::size_t i = 0; i < self->cell_dimension(cell.index()); i++)
+      for (std::size_t j = 0; j < gdim; j++)
+        data[i*gdim + j] = tmparray[i][j];
+  }
+
+%pythoncode %{
+def tabulate_coordinates(self, cell, coordinates=None):
+    """ Tabulate the coordinates of all dofs on a cell
+
+    *Arguments*
+        cell (_Cell_)
+             The cell.
+        coordinates (NumPy array)
+             Optional argument: The coordinates of all dofs on a cell.
+    *Returns*
+        coordinates
+             The coordinates of all dofs on a cell.
+    """
+    import numpy as np
+
+    # Check coordinate argument
+    shape = (self.max_cell_dimension(), self.geometric_dimension())
+    if coordinates is None:
+        coordinates = np.zeros(shape, 'd')
+    if not isinstance(coordinates, np.ndarray) or \
+       not (coordinates.flags.c_contiguous and \
+            coordinates.dtype == np.dtype('d') and \
+            coordinates.shape==shape):
+        raise TypeError, "expected a C-contiguous numpy array " \
+              "of 'double' (dtype='d') with shape %s"%str(shape)
+
+    # Call the extended method
+    self._tabulate_coordinates(coordinates, cell)
+    return coordinates
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of FooProblem
+//-----------------------------------------------------------------------------
+%define PROBLEM_EXTENDS(TYPE)
+%extend dolfin::TYPE
+{
+%pythoncode %{
+def solution(self):
+    """
+    Return the solution
+    """
+    from dolfin.functions.function import Function
+    return Function(self._solution())
+
+def trial_space(self):
+    """
+    Return the trial space
+    """
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(self._trial_space())
+
+def test_space(self):
+    """
+    Return the test space
+    """
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(self._test_space())
+
+%}
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of Hierarchical
+//-----------------------------------------------------------------------------
+%define HIERARCHICAL_FEM_EXTENDS(TYPE)
+%pythoncode %{
+Hierarchical ## TYPE.leaf_node = Hierarchical ## TYPE._leaf_node
+Hierarchical ## TYPE.root_node = Hierarchical ## TYPE._root_node
+Hierarchical ## TYPE.child = Hierarchical ## TYPE._child
+Hierarchical ## TYPE.parent = Hierarchical ## TYPE._parent
+%}
+%enddef
+
+
+PROBLEM_EXTENDS(LinearVariationalProblem)
+PROBLEM_EXTENDS(NonlinearVariationalProblem)
+HIERARCHICAL_FEM_EXTENDS(LinearVariationalProblem)
+HIERARCHICAL_FEM_EXTENDS(NonlinearVariationalProblem)
+HIERARCHICAL_FEM_EXTENDS(Form)
+HIERARCHICAL_FEM_EXTENDS(DirichletBC)
+
+//-----------------------------------------------------------------------------
+// Reveal reset_sparsity as bool in python
+// TODO: Remove this when reset_sparsity is removed
+//-----------------------------------------------------------------------------
+%rename(reset_sparsity) dolfin::AssemblerBase::_reset_sparsity;
+%extend dolfin::AssemblerBase {
+    bool _reset_sparsity;
+}
+%{
+bool dolfin_AssemblerBase__reset_sparsity_get(dolfin::AssemblerBase* obj) {
+    return obj->reset_sparsity;
+}
+bool dolfin_AssemblerBase__reset_sparsity_set(dolfin::AssemblerBase* obj, bool value) {
+    obj->reset_sparsity = value;
+    return value;
+}
+%}
diff --git a/dolfin/swig/fem/pre.i b/dolfin/swig/fem/pre.i
new file mode 100644
index 0000000..5eb8779
--- /dev/null
+++ b/dolfin/swig/fem/pre.i
@@ -0,0 +1,303 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth Wells, 2007-2012.
+// Modified by Kent-Andre Mardal, 2008.
+// Modified by Johan Hake, 2008-2009.
+//
+// First added:  2007-08-16
+// Last changed: 2013-10-15
+
+// ===========================================================================
+// SWIG directives for the DOLFIN fem kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+//-----------------------------------------------------------------------------
+// Rename solve so it wont clash with solve from la
+//-----------------------------------------------------------------------------
+%rename(fem_solve) dolfin::solve;
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of FooProblem
+//-----------------------------------------------------------------------------
+%define PROBLEM_RENAMES(NAME)
+%rename(_solution) dolfin::NAME ## Problem::solution;
+%rename(_trial_space) dolfin::NAME ## Problem::trial_space;
+%rename(_test_space) dolfin::NAME ## Problem::test_space;
+%enddef
+
+PROBLEM_RENAMES(LinearVariational)
+PROBLEM_RENAMES(NonlinearVariational)
+//PROBLEM_RENAMES(LinearTimeDependent)
+
+//-----------------------------------------------------------------------------
+// To simplify handling of shared_ptr types in PyDOLFIN we ignore the reference
+// version of constructors to these types
+//-----------------------------------------------------------------------------
+%ignore dolfin::DirichletBC::DirichletBC(const FunctionSpace&,
+					 const GenericFunction&,
+					 const SubDomain&,
+					 std::string method="topological");
+%ignore dolfin::DirichletBC::DirichletBC(const FunctionSpace&,
+					 const GenericFunction&,
+					 const MeshFunction<std::size_t>&,
+					 std::size_t,
+					 std::string method="topological");
+%ignore dolfin::DirichletBC::DirichletBC(const FunctionSpace&,
+					 const GenericFunction&,
+					 std::size_t,
+					 std::string method="topological");
+%ignore dolfin::DirichletBC::DirichletBC(std::shared_ptr<const FunctionSpace>,
+					 std::shared_ptr<const GenericFunction>,
+					 const std::vector<std::pair<std::size_t, std::size_t> >&,
+					 std::string method="topological");
+%ignore dolfin::LinearVariationalProblem::LinearVariationalProblem(const Form&,
+                                                                   const Form&,
+                                                                   Function&);
+%ignore dolfin::LinearVariationalProblem::LinearVariationalProblem(const Form&,
+                                                     const Form&,
+                                                     Function&,
+                                                     const DirichletBC&);
+%ignore dolfin::LinearVariationalProblem::LinearVariationalProblem(const Form&,
+                                       const Form&,
+                                       Function&,
+                                       std::vector<const DirichletBC*>);
+
+%ignore dolfin::NonlinearVariationalProblem::NonlinearVariationalProblem(const Form&,
+                                                                     Function&);
+%ignore dolfin::NonlinearVariationalProblem::NonlinearVariationalProblem(const Form&,
+                                                                   Function&,
+                                                                   const Form&);
+%ignore dolfin::NonlinearVariationalProblem::NonlinearVariationalProblem(const Form&,
+                                                     Function&,
+                                                     const DirichletBC&);
+%ignore dolfin::NonlinearVariationalProblem::NonlinearVariationalProblem(const Form&,
+                                                     Function&,
+                                                     const DirichletBC&,
+                                                     const Form&);
+%ignore dolfin::NonlinearVariationalProblem::NonlinearVariationalProblem(const Form&,
+                                       Function&,
+                                       std::vector<const DirichletBC*>);
+%ignore dolfin::NonlinearVariationalProblem::NonlinearVariationalProblem(const Form&,
+                                         Function&,
+                                         std::vector<const DirichletBC*>,
+                                         const Form&);
+
+%ignore dolfin::LinearVariationalSolver::LinearVariationalSolver(LinearVariationalProblem&);
+
+%ignore dolfin::NonlinearVariationalSolver::NonlinearVariationalSolver(NonlinearVariationalProblem&);
+
+%ignore dolfin::SystemAssembler::SystemAssembler(const Form&, const Form&);
+%ignore dolfin::SystemAssembler::SystemAssembler(const Form&, const Form&, const DirichletBC&);
+%ignore dolfin::SystemAssembler::SystemAssembler(const Form&, const Form&,
+						 const std::vector<const DirichletBC*>);
+
+//-----------------------------------------------------------------------------
+// Ignore operator= for DirichletBC to avoid warning
+//-----------------------------------------------------------------------------
+%ignore dolfin::DirichletBC::operator=;
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of DirichletBC
+//-----------------------------------------------------------------------------
+%rename (_function_space) dolfin::DirichletBC::function_space;
+%ignore dolfin::DirichletBC::set_value(const GenericFunction&);
+%ignore dolfin::DirichletBC::gather;
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of Form
+//-----------------------------------------------------------------------------
+%rename (_function_space) dolfin::Form::function_space;
+
+//-----------------------------------------------------------------------------
+// Ignores domain assignment and operator== for Form class
+//-----------------------------------------------------------------------------
+%ignore dolfin::Form::dx;
+%ignore dolfin::Form::ds;
+%ignore dolfin::Form::dS;
+%ignore dolfin::Form::operator==;
+
+//-----------------------------------------------------------------------------
+// Ignore dolfin::Cell versions of signatures as these now are handled by
+// a typemap
+//-----------------------------------------------------------------------------
+%ignore dolfin::DofMap::tabulate_coordinates(
+                                boost::multi_array<double, 2>& coordinates,
+                                const std::vector<double>& vertex_coordinates,
+                                const Cell& cell) const;
+
+%ignore dolfin::GenericDofMap::tabulate_coordinates(
+                                boost::multi_array<double, 2>& coordinates,
+                                const std::vector<double>& vertex_coordinates,
+                                const Cell& cell) const;
+
+%ignore dolfin::CCFEMDofMap::tabulate_coordinates(
+                                boost::multi_array<double, 2>& coordinates,
+                                const std::vector<double>& vertex_coordinates,
+                                const ufc::cell& cell) const;
+
+//-----------------------------------------------------------------------------
+// Add a greedy typemap for dolfin::Cell to ufc::cell
+//-----------------------------------------------------------------------------
+%typemap(in)
+const ufc::cell& (void *argp, bool dolfin_cell, int res)
+{
+  // const ufc::cell& cell Typemap
+  // First try dolfin::Cell
+  res = SWIG_ConvertPtr($input, &argp, $descriptor(dolfin::Cell*), 0);
+  if (SWIG_IsOK(res))
+  {
+    dolfin_cell = true;
+    const dolfin::Cell* tmp_cell = reinterpret_cast<dolfin::Cell *>(argp);
+    $1 = new ufc::cell;
+    tmp_cell->get_cell_data(*($1));
+    tmp_cell->get_cell_topology(*($1));
+  }
+  else
+  {
+    dolfin_cell = false;
+    res = SWIG_ConvertPtr($input, &argp, $descriptor(ufc::cell*), 0);
+    if (SWIG_IsOK(res))
+      $1 = reinterpret_cast<ufc::cell *>(argp);
+    else
+      SWIG_exception(SWIG_TypeError, "expected a dolfin.Cell or a ufc::cell");
+  }
+}
+
+%typemap(freearg) const ufc::cell&
+{
+  // If a dolfin cell was created delete it
+  if(dolfin_cell$argnum)
+    delete $1;
+}
+
+%typecheck(SWIG_TYPECHECK_POINTER) const ufc::cell&
+{
+  // TYPECHECK const ufc::cell&
+  int res = SWIG_ConvertPtr($input, 0, $descriptor(dolfin::Cell*), 0);
+  $1 = SWIG_CheckState(res);
+  if (!$1)
+  {
+    res = SWIG_ConvertPtr($input, 0, $descriptor(ufc::cell*), 0);
+    $1 = SWIG_CheckState(res);
+  }
+}
+
+%define IN_TYPEMAP_STD_VECTOR_OF_STD_VECTOR_OF_SHARED_POINTERS(TYPE)
+
+//-----------------------------------------------------------------------------
+// The std::vector<std::vector<std::shared_ptr<dolfin::Type*> > >
+// typecheck
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_POINTER) std::vector<std::vector<std::shared_ptr<const dolfin::TYPE> > >
+{
+  $1 = PyList_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// The std::vector<std::vector<std::shared_ptr<dolfin::Type*> > >
+// typemap
+//-----------------------------------------------------------------------------
+   %typemap (in) std::vector<std::vector<std::shared_ptr<const dolfin::TYPE> > > (std::vector<std::vector<std::shared_ptr<const dolfin::TYPE> > >  tmp_vec_0, std::vector<std::shared_ptr<const dolfin::TYPE> >  tmp_vec_1, std::shared_ptr<dolfin::TYPE> tempshared)
+{
+  // IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE, CONST, CONST_VECTOR), shared_ptr version
+  if (!PyList_Check($input))
+    SWIG_exception(SWIG_TypeError, "list of lists of TYPE expected");
+
+  // Size of first list
+  int size_0 = PyList_Size($input);
+  int res = 0;
+  PyObject* py_item_0 = 0;
+  PyObject* py_item_1 = 0;
+  void* itemp = 0;
+  int newmem = 0;
+  tmp_vec_0.reserve(size_0);
+
+  // Iterate over first list
+  for (int i = 0; i < size_0; i++)
+  {
+    py_item_0 = PyList_GetItem($input, i);
+
+    // Check list items are list
+    if (!PyList_Check(py_item_0))
+      SWIG_exception(SWIG_TypeError, "list of lists of TYPE expected");
+
+    // Size of second list
+    int size_1 = PyList_Size(py_item_0);
+    tmp_vec_1.reserve(size_1);
+
+    // Iterate over second list
+    for (int j = 0; j < size_1; j++)
+    {
+      newmem = 0;
+
+      // Grab item from second list
+      py_item_1 = PyList_GetItem(py_item_0, j);
+
+      // Try convert it
+      res = SWIG_ConvertPtrAndOwn(py_item_1, &itemp, $descriptor(std::shared_ptr< dolfin::TYPE > *), 0, &newmem);
+
+      if (!SWIG_IsOK(res))
+	SWIG_exception(SWIG_TypeError, "expected a list of list of TYPE (Bad conversion)");
+
+      tempshared = *(reinterpret_cast<std::shared_ptr< dolfin::TYPE> *>(itemp));
+      tmp_vec_1.push_back(tempshared);
+
+      if (newmem & SWIG_CAST_NEW_MEMORY)
+	delete reinterpret_cast<std::shared_ptr< dolfin::TYPE> *>(itemp);
+    }
+    tmp_vec_0.push_back(tmp_vec_1);
+    tmp_vec_1.clear();
+  }
+  $1 = tmp_vec_0;
+
+}
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Instantiate typemap
+//-----------------------------------------------------------------------------
+IN_TYPEMAP_STD_VECTOR_OF_STD_VECTOR_OF_SHARED_POINTERS(Form)
+
+//-----------------------------------------------------------------------------
+// Instantiate Hierarchical classes
+//-----------------------------------------------------------------------------
+#ifdef FEMMODULE // Conditional template instiantiation for FEM module
+%template (HierarchicalForm) dolfin::Hierarchical<dolfin::Form>;
+%template (HierarchicalLinearVariationalProblem) \
+          dolfin::Hierarchical<dolfin::LinearVariationalProblem>;
+%template (HierarchicalNonlinearVariationalProblem) \
+          dolfin::Hierarchical<dolfin::NonlinearVariationalProblem>;
+%template (HierarchicalDirichletBC) dolfin::Hierarchical<dolfin::DirichletBC>;
+
+#endif
+//#ifdef IOMODULE // Conditional template instiantiation for IO module
+//%template (HierarchicalDirichletBC) dolfin::Hierarchical<dolfin::DirichletBC>;
+//#endif
+
+//-----------------------------------------------------------------------------
+// Infrastructure for deprecated bools
+// TODO: Remove this when there are no bool_deprecated
+//-----------------------------------------------------------------------------
+%ignore dolfin::bool_deprecated::operator=(const bool_deprecated&);
+%ignore dolfin::bool_deprecated::operator=(const bool&);
+%ignore dolfin::AssemblerBase::reset_sparsity;
diff --git a/dolfin/swig/forwarddeclarations.i b/dolfin/swig/forwarddeclarations.i
new file mode 100644
index 0000000..b3df3c9
--- /dev/null
+++ b/dolfin/swig/forwarddeclarations.i
@@ -0,0 +1,69 @@
+/* -*- C -*- */
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-01-20
+// Last changed: 2013-07-08
+
+//=============================================================================
+// Forward declarations of common types in DOLFIN needed for template
+// instantiations
+//=============================================================================
+
+namespace dolfin
+{
+  // ale
+  class MeshDisplacement;
+
+  // common
+  class Table;
+
+  // parameter
+  class Parameters;
+
+  // common
+  template<typename T> class Hierarchical;
+
+  // mesh
+  class IntersectionOperator;
+  class Vertex;
+  class Mesh;
+  class Point;
+  class MeshEntity;
+  class LocalMeshData;
+  template<typename T> class MeshFunction;
+  template<typename T> class MeshValueCollection;
+
+  // adaptivity
+  class ErrorControl;
+
+  // fem
+  class Form;
+  class LinearVariationalProblem;
+  class NonlinearVariationalProblem;
+  class DirichletBC;
+  class FiniteElement;
+
+  // function
+  class FunctionSpace;
+  class Function;
+
+  // la
+  class GenericVector;
+  class GenericMatrix;
+
+}
diff --git a/dolfin/swig/function/docstrings.i b/dolfin/swig/function/docstrings.i
new file mode 100644
index 0000000..f34f47d
--- /dev/null
+++ b/dolfin/swig/function/docstrings.i
@@ -0,0 +1,1489 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=function, header=GenericFunction.h)
+%feature("docstring")  dolfin::GenericFunction "
+This is a common base class for functions. Functions can be
+evaluated at a given point and they can be restricted to a given
+cell in a finite element mesh. This functionality is implemented
+by sub-classes that implement the eval() and restrict() functions.
+
+DOLFIN provides two implementations of the GenericFunction
+interface in the form of the classes Function and Expression.
+
+Sub-classes may optionally implement the update() function that
+will be called prior to restriction when running in parallel.
+";
+
+%feature("docstring")  dolfin::GenericFunction::GenericFunction "
+Constructor
+";
+
+%feature("docstring")  dolfin::GenericFunction::value_rank "
+Return value rank
+";
+
+%feature("docstring")  dolfin::GenericFunction::value_dimension "
+Return value dimension for given axis
+";
+
+%feature("docstring")  dolfin::GenericFunction::eval "
+**Overloaded versions**
+
+* eval\ (values, x, cell)
+
+  Evaluate at given point in given cell
+
+* eval\ (values, x)
+
+  Evaluate at given point
+";
+
+%feature("docstring")  dolfin::GenericFunction::restrict "
+Restrict function to local cell (compute expansion coefficients w)
+";
+
+%feature("docstring")  dolfin::GenericFunction::compute_vertex_values "
+Compute values at all mesh vertices
+";
+
+%feature("docstring")  dolfin::GenericFunction::update "
+Update off-process ghost coefficients
+";
+
+%feature("docstring")  dolfin::GenericFunction::operator "
+**Overloaded versions**
+
+* operator\ (x)
+
+  Evaluation at given point (scalar function)
+
+* operator\ (x, y)
+
+  Evaluation at given point (scalar function)
+
+* operator\ (x, y, z)
+
+  Evaluation at given point (scalar function)
+
+* operator\ (p)
+
+  Evaluation at given point (scalar function)
+
+* operator\ (values, x)
+
+  Evaluation at given point (vector-valued function)
+
+* operator\ (values, x, y)
+
+  Evaluation at given point (vector-valued function)
+
+* operator\ (values, x, y, z)
+
+  Evaluation at given point (vector-valued function)
+
+* operator\ (values, p)
+
+  Evaluation at given point (vector-valued function)
+";
+
+%feature("docstring")  dolfin::GenericFunction::value_size "
+Evaluation at given point
+Return value size (product of value dimensions)
+";
+
+%feature("docstring")  dolfin::GenericFunction::evaluate "
+Evaluate function at given point in cell
+";
+
+// Documentation extracted from: (module=function, header=Expression.h)
+%feature("docstring")  dolfin::Expression "
+This class represents a user-defined expression. Expressions can
+be used as coefficients in variational forms or interpolated
+into finite element spaces.
+
+An expression is defined by overloading the eval() method. Users
+may choose to overload either a simple version of eval(), in the
+case of expressions only depending on the coordinate x, or an
+optional version for expressions depending on x and mesh data
+like cell indices or facet normals.
+
+The geometric dimension (the size of x) and the value rank and
+dimensions of an expression must supplied as arguments to the
+constructor.
+";
+
+%feature("docstring")  dolfin::Expression::Expression "
+**Overloaded versions**
+
+* Expression\ ()
+
+  Create scalar expression.
+
+* Expression\ (dim)
+
+  Create vector-valued expression with given dimension.
+  
+  *Arguments*
+      dim (int)
+          Dimension of the vector-valued expression.
+
+* Expression\ (dim0, dim1)
+
+  Create matrix-valued expression with given dimensions.
+  
+  *Arguments*
+      dim0 (int)
+          Dimension (rows).
+      dim1 (int)
+          Dimension (columns).
+
+* Expression\ (value_shape)
+
+  Create tensor-valued expression with given shape.
+  
+  *Arguments*
+      value_shape (numpy.array(int))
+          Shape of expression.
+
+* Expression\ (expression)
+
+  Copy constructor
+  
+  *Arguments*
+      expression (:py:class:`Expression`)
+          Object to be copied.
+";
+
+%feature("docstring")  dolfin::Expression::eval "
+**Overloaded versions**
+
+* eval\ (values, x, cell)
+
+  Note: The reimplementation of eval is needed for the Python interface.
+  Evaluate at given point in given cell.
+  
+  *Arguments*
+      values (numpy.array(float))
+          The values at the point.
+      x (numpy.array(float))
+          The coordinates of the point.
+      cell (ufc::cell)
+          The cell which contains the given point.
+
+* eval\ (values, x)
+
+  Evaluate at given point.
+  
+  *Arguments*
+      values (numpy.array(float))
+          The values at the point.
+      x (numpy.array(float))
+          The coordinates of the point.
+";
+
+%feature("docstring")  dolfin::Expression::value_rank "
+Return value rank.
+
+*Returns*
+    int
+        The value rank.
+";
+
+%feature("docstring")  dolfin::Expression::value_dimension "
+Return value dimension for given axis.
+
+*Arguments*
+    i (int)
+        Integer denoting the axis to use.
+
+*Returns*
+    int
+        The value dimension (for the given axis).
+";
+
+%feature("docstring")  dolfin::Expression::restrict "
+Restrict function to local cell (compute expansion coefficients w).
+
+*Arguments*
+    w (list of doubles)
+        Expansion coefficients.
+    element (:py:class:`FiniteElement`)
+        The element.
+    dolfin_cell (:py:class:`Cell`)
+        The cell.
+    ufc_cell (ufc::cell)
+        The ufc::cell.
+";
+
+%feature("docstring")  dolfin::Expression::compute_vertex_values "
+Compute values at all mesh vertices.
+
+*Arguments*
+    vertex_values (numpy.array(float))
+        The values at all vertices.
+    mesh (:py:class:`Mesh`)
+        The mesh.
+";
+
+// Documentation extracted from: (module=function, header=FunctionAXPY.h)
+%feature("docstring")  dolfin::FunctionAXPY "
+This class represents a linear combination of functions. It is
+mostly used as an intermediate class for operations such as u =
+3*u0 + 4*u1; where the rhs generates an FunctionAXPY.
+";
+
+%feature("docstring")  dolfin::FunctionAXPY::FunctionAXPY "
+**Overloaded versions**
+
+* FunctionAXPY\ (func, scalar)
+
+  Constructor
+
+* FunctionAXPY\ (axpy, scalar)
+
+  Constructor
+
+* FunctionAXPY\ (func0, func1, direction)
+
+  Constructor
+
+* FunctionAXPY\ (axpy, func, direction)
+
+  Constructor
+
+* FunctionAXPY\ (axpy0, axpy1, direction)
+
+  Constructor
+
+* FunctionAXPY\ (pairs)
+
+  Constructor
+
+* FunctionAXPY\ (axpy)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::FunctionAXPY::operator+ "
+**Overloaded versions**
+
+* operator+\ (func)
+
+  Addition operator
+
+* operator+\ (axpy)
+
+  Addition operator
+";
+
+%feature("docstring")  dolfin::FunctionAXPY::operator- "
+**Overloaded versions**
+
+* operator-\ (func)
+
+  Substraction operator
+
+* operator-\ (axpy)
+
+  Substraction operator
+";
+
+%feature("docstring")  dolfin::FunctionAXPY::operator* "
+Scale operator
+";
+
+%feature("docstring")  dolfin::FunctionAXPY::operator/ "
+Scale operator
+";
+
+%feature("docstring")  dolfin::FunctionAXPY::pairs "
+Return the scalar and Function pairs
+";
+
+%feature("docstring")  dolfin::FunctionAXPY::_register "
+Register another AXPY object
+";
+
+// Documentation extracted from: (module=function, header=Function.h)
+%feature("docstring")  dolfin::Function "
+This class represents a function :math:`u_h` in a finite
+element function space :math:`V_h`, given by
+
+.. math::
+
+    u_h = \sum_{i=1}^{n} U_i \phi_i
+
+where :math:`\{\phi_i\}_{i=1}^{n}` is a basis for :math:`V_h`,
+and :math:`U` is a vector of expansion coefficients for :math:`u_h`.
+";
+
+%feature("docstring")  dolfin::Function::Function "
+**Overloaded versions**
+
+* Function\ (V)
+
+  Create function on given function space
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* Function\ (V)
+
+  Create function on given function space (shared data)
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+
+* Function\ (V, x)
+
+  Create function on given function space with a given vector
+  (shared data)
+  
+  *Warning: This constructor is intended for internal library use only*
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      x (:py:class:`GenericVector`)
+          The vector.
+
+* Function\ (V, filename)
+
+  Create function from vector of dofs stored to file
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      filename_vector (str)
+          The name of the file containing the vector.
+      filename_dofdata (str)
+          The name of the file containing the dofmap data.
+
+* Function\ (V, filename)
+
+  Create function from vector of dofs stored to file (shared data)
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The function space.
+      filename_dofdata (str)
+          The name of the file containing the dofmap data.
+
+* Function\ (v)
+
+  Copy constructor
+  
+  *Arguments*
+      v (:py:class:`Function`)
+          The object to be copied.
+
+* Function\ (v, i)
+
+  Sub-function constructor with shallow copy of vector (used in Python
+  interface)
+  
+  *Arguments*
+      v (:py:class:`Function`)
+          The function to be copied.
+      i (int)
+          Index of subfunction.
+  
+";
+
+%feature("docstring")  dolfin::Function::operator= "
+**Overloaded versions**
+
+* operator=\ (v)
+
+  Assignment from function
+  
+  *Arguments*
+      v (:py:class:`Function`)
+          Another function.
+
+* operator=\ (v)
+
+  Assignment from expression using interpolation
+  
+  *Arguments*
+      v (:py:class:`Expression`)
+          The expression.
+
+* operator=\ (axpy)
+
+  Assignment from linear combination of function
+  
+  *Arguments*
+      v (:py:class:`FunctionAXPY`)
+          A linear combination of other Functions
+";
+
+%feature("docstring")  dolfin::Function::operator[] "
+Extract subfunction
+
+*Arguments*
+    i (int)
+        Index of subfunction.
+*Returns*
+    :py:class:`Function`
+        The subfunction.
+";
+
+%feature("docstring")  dolfin::Function::operator+ "
+**Overloaded versions**
+
+* operator+\ (other)
+
+  Add operator with other function
+  
+  *Returns*
+      :py:class:`FunctionAXPY`
+          Return a linear combination of Functions
+
+* operator+\ (axpy)
+
+  Add operator with other linear combination of functions
+  
+  *Returns*
+      :py:class:`FunctionAXPY`
+          Return a linear combination of Functions
+";
+
+%feature("docstring")  dolfin::Function::operator- "
+**Overloaded versions**
+
+* operator-\ (other)
+
+  Substraction operator with other function
+  
+  *Returns*
+      :py:class:`FunctionAXPY`
+          Return a linear combination of Functions
+
+* operator-\ (axpy)
+
+  Substraction operator with other linear combination of functions
+  
+  *Returns*
+      :py:class:`FunctionAXPY`
+          Return a linear combination of Functions
+";
+
+%feature("docstring")  dolfin::Function::operator* "
+Scale operator
+
+*Returns*
+    :py:class:`FunctionAXPY`
+        Return a linear combination of Functions
+";
+
+%feature("docstring")  dolfin::Function::operator/ "
+Scale operator
+
+*Returns*
+    :py:class:`FunctionAXPY`
+        Return a linear combination of Functions
+";
+
+%feature("docstring")  dolfin::Function::function_space "
+Return shared pointer to function space
+
+*Returns*
+    :py:class:`FunctionSpace`
+        Return the shared pointer.
+";
+
+%feature("docstring")  dolfin::Function::vector "
+**Overloaded versions**
+
+* vector\ ()
+
+  Return vector of expansion coefficients (non-const version)
+  
+  *Returns*
+      :py:class:`GenericVector`
+          The vector of expansion coefficients.
+
+* vector\ ()
+
+  Return vector of expansion coefficients (const version)
+  
+  *Returns*
+      :py:class:`GenericVector`
+          The vector of expansion coefficients (const).
+";
+
+%feature("docstring")  dolfin::Function::in "
+Check if function is a member of the given function space
+
+*Arguments*
+    V (:py:class:`FunctionSpace`)
+        The function space.
+
+*Returns*
+    bool
+        True if the function is in the function space.
+";
+
+%feature("docstring")  dolfin::Function::geometric_dimension "
+Return geometric dimension
+
+*Returns*
+    int
+        The geometric dimension.
+";
+
+%feature("docstring")  dolfin::Function::eval "
+**Overloaded versions**
+
+* eval\ (values, x)
+
+  Evaluate function at given coordinates
+  
+  *Arguments*
+      values (numpy.array(float))
+          The values.
+      x (numpy.array(float))
+          The coordinates.
+
+* eval\ (values, x, dolfin_cell, ufc_cell)
+
+  Evaluate function at given coordinates in given cell
+  
+  *Arguments*
+      values (numpy.array(float))
+          The values.
+      x (numpy.array(float))
+          The coordinates.
+      dolfin_cell (:py:class:`Cell`)
+          The cell.
+      ufc_cell (ufc::cell)
+          The ufc::cell.
+
+* eval\ (values, x, cell)
+
+  Evaluate at given point in given cell
+  
+  *Arguments*
+      values (numpy.array(float))
+          The values at the point.
+      x (numpy.array(float))
+          The coordinates of the point.
+      cell (ufc::cell)
+          The cell which contains the given point.
+";
+
+%feature("docstring")  dolfin::Function::interpolate "
+Interpolate function (on possibly non-matching meshes)
+
+*Arguments*
+    v (:py:class:`GenericFunction`)
+        The function to be interpolated.
+";
+
+%feature("docstring")  dolfin::Function::extrapolate "
+Extrapolate function (from a possibly lower-degree function space)
+
+*Arguments*
+    v (:py:class:`Function`)
+        The function to be extrapolated.
+";
+
+%feature("docstring")  dolfin::Function::value_rank "
+Return value rank
+
+*Returns*
+    int
+        The value rank.
+";
+
+%feature("docstring")  dolfin::Function::value_dimension "
+Return value dimension for given axis
+
+*Arguments*
+    i (int)
+        The index of the axis.
+
+*Returns*
+    int
+        The value dimension.
+";
+
+%feature("docstring")  dolfin::Function::non_matching_eval "
+Evaluate function for given data (non-matching meshes)
+
+*Arguments*
+    values (numpy.array(float))
+        The values at the point.
+    x (numpy.array(float))
+        The coordinates of the point.
+    cell (ufc::cell)
+        The cell.
+";
+
+%feature("docstring")  dolfin::Function::restrict "
+Restrict function to local cell (compute expansion coefficients w)
+
+*Arguments*
+    w (list of doubles)
+        Expansion coefficients.
+    element (:py:class:`FiniteElement`)
+        The element.
+    dolfin_cell (:py:class:`Cell`)
+        The cell.
+    ufc_cell (ufc::cell)
+        The ufc::cell.
+";
+
+%feature("docstring")  dolfin::Function::compute_vertex_values "
+**Overloaded versions**
+
+* compute_vertex_values\ (vertex_values, mesh)
+
+  Compute values at all mesh vertices
+  
+  *Arguments*
+      vertex_values (numpy.array(float))
+          The values at all vertices.
+      mesh (:py:class:`Mesh`)
+          The mesh.
+
+* compute_vertex_values\ (vertex_values)
+
+  Compute values at all mesh vertices
+  
+  *Arguments*
+      vertex_values (numpy.array(float))
+          The values at all vertices.
+";
+
+%feature("docstring")  dolfin::Function::update "
+Update off-process ghost coefficients
+";
+
+// Documentation extracted from: (module=function, header=FunctionSpace.h)
+%feature("docstring")  dolfin::FunctionSpace "
+This class represents a finite element function space defined by
+a mesh, a finite element, and a local-to-global mapping of the
+degrees of freedom (dofmap).
+";
+
+%feature("docstring")  dolfin::FunctionSpace::FunctionSpace "
+**Overloaded versions**
+
+* FunctionSpace\ (mesh, element, dofmap)
+
+  Create function space for given mesh, element and dofmap
+  (shared data)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      element (:py:class:`FiniteElement`)
+          The element.
+      dofmap (:py:class:`GenericDofMap`)
+          The dofmap.
+
+* FunctionSpace\ (mesh)
+
+  Create empty function space for later initialization. This
+  constructor is intended for use by any sub-classes which need
+  to construct objects before the initialisation of the base
+  class. Data can be attached to the base class using
+  FunctionSpace::attach(...).
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+
+* FunctionSpace\ (V)
+
+  Copy constructor
+  
+  *Arguments*
+      V (:py:class:`FunctionSpace`)
+          The object to be copied.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::attach "
+Attach data to an empty function space
+
+*Arguments*
+    element (:py:class:`FiniteElement`)
+        The element.
+    dofmap (:py:class:`GenericDofMap`)
+        The dofmap.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::operator= "
+Assignment operator
+
+*Arguments*
+    V (:py:class:`FunctionSpace`)
+        Another function space.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::operator== "
+Equality operator
+
+*Arguments*
+    V (:py:class:`FunctionSpace`)
+        Another function space.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::operator!= "
+Unequality operator
+
+*Arguments*
+    V (:py:class:`FunctionSpace`)
+        Another function space.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::mesh "
+Return mesh
+
+*Returns*
+    :py:class:`Mesh`
+        The mesh.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::element "
+Return finite element
+
+*Returns*
+    :py:class:`FiniteElement`
+        The finite element.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::dofmap "
+Return dofmap
+
+*Returns*
+    :py:class:`GenericDofMap`
+        The dofmap.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::dim "
+Return dimension of function space
+
+*Returns*
+    int
+        The dimension of the function space.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::interpolate "
+Interpolate function v into function space, returning the
+vector of expansion coefficients
+
+*Arguments*
+    expansion_coefficients (:py:class:`GenericVector`)
+        The expansion coefficients.
+    v (:py:class:`GenericFunction`)
+        The function to be interpolated.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::operator[] "
+Extract subspace for component
+
+*Arguments*
+    i (int)
+        Index of the subspace.
+*Returns*
+    :py:class:`FunctionSpace`
+        The subspace.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::extract_sub_space "
+Extract subspace for component
+
+*Arguments*
+    component (numpy.array(int))
+        The component.
+
+*Returns*
+    :py:class:`FunctionSpace`
+        The subspace.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::collapse "
+**Overloaded versions**
+
+* collapse\ ()
+
+  Collapse a subspace and return a new function space
+  
+  *Returns*
+      :py:class:`FunctionSpace`
+          The new function space.
+
+* collapse\ (collapsed_dofs)
+
+  Collapse a subspace and return a new function space and a map
+  from new to old dofs
+  
+  *Arguments*
+      collapsed_dofs (boost::unordered_map<std::size_t, std::size_t>)
+          The map from new to old dofs.
+  
+  *Returns*
+      :py:class:`FunctionSpace`
+        The new function space.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::has_cell "
+Check if function space has given cell
+
+*Arguments*
+    cell (:py:class:`Cell`)
+        The cell.
+
+*Returns*
+    bool
+        True if the function space has the given cell.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::has_element "
+Check if function space has given element
+
+*Arguments*
+    element (:py:class:`FiniteElement`)
+        The finite element.
+
+*Returns*
+    bool
+        True if the function space has the given element.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::component "
+Return component
+
+*Returns*
+    numpy.array(int)
+        The component (relative to superspace).
+";
+
+%feature("docstring")  dolfin::FunctionSpace::str "
+Return informal string representation (pretty-print)
+
+*Arguments*
+    verbose (bool)
+        Flag to turn on additional output.
+
+*Returns*
+    str
+        An informal representation of the function space.
+";
+
+%feature("docstring")  dolfin::FunctionSpace::print_dofmap "
+Print dofmap (useful for debugging)
+";
+
+// Documentation extracted from: (module=function, header=SubSpace.h)
+%feature("docstring")  dolfin::SubSpace "
+This class represents a subspace (component) of a function space.
+
+The subspace is specified by an array of indices. For example,
+the array [3, 0, 2] specifies subspace 2 of subspace 0 of
+subspace 3.
+
+A typical example is the function space W = V x P for Stokes.
+Here, V = W[0] is the subspace for the velocity component and
+P = W[1] is the subspace for the pressure component. Furthermore,
+W[0][0] = V[0] is the first component of the velocity space etc.
+";
+
+%feature("docstring")  dolfin::SubSpace::SubSpace "
+**Overloaded versions**
+
+* SubSpace\ (V, component)
+
+  Create subspace for given component (one level)
+
+* SubSpace\ (V, component, sub_component)
+
+  Create subspace for given component (two levels)
+
+* SubSpace\ (V, component)
+
+  Create subspace for given component (n levels)
+";
+
+// Documentation extracted from: (module=function, header=Constant.h)
+%feature("docstring")  dolfin::Constant "
+This class represents a constant-valued expression.
+";
+
+%feature("docstring")  dolfin::Constant::Constant "
+**Overloaded versions**
+
+* Constant\ (value)
+
+  Create scalar constant
+  
+  *Arguments*
+      value (float)
+          The scalar to create a Constant object from.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* Constant\ (value0, value1)
+
+  Create vector constant (dim = 2)
+  
+  *Arguments*
+      value0 (float)
+          The first vector element.
+      value1 (float)
+          The second vector element.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* Constant\ (value0, value1, value2)
+
+  Create vector constant (dim = 3)
+  
+  *Arguments*
+      value0 (float)
+          The first vector element.
+      value1 (float)
+          The second vector element.
+      value2 (float)
+          The third vector element.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* Constant\ (values)
+
+  Create vector-valued constant
+  
+  *Arguments*
+      values (numpy.array(float))
+          Values to create a vector-valued constant from.
+
+* Constant\ (value_shape, values)
+
+  Create tensor-valued constant for flattened array of values
+  
+  *Arguments*
+      value_shape (numpy.array(int))
+          Shape of tensor.
+      values (numpy.array(float))
+          Values to create tensor-valued constant from.
+
+* Constant\ (constant)
+
+  Copy constructor
+  
+  *Arguments*
+      constant (:py:class:`Constant`)
+          Object to be copied.
+";
+
+%feature("docstring")  dolfin::Constant::operator= "
+**Overloaded versions**
+
+* operator=\ (constant)
+
+  Assignment operator
+  
+  *Arguments*
+      constant (:py:class:`Constant`)
+          Another constant.
+
+* operator=\ (constant)
+
+  Assignment operator
+  
+  *Arguments*
+      constant (float)
+          Another constant.
+";
+
+%feature("docstring")  dolfin::Constant::operator double "
+Cast to double (for scalar constants)
+
+*Returns*
+    float
+        The scalar value.
+";
+
+// Documentation extracted from: (module=function, header=SpecialFunctions.h)
+%feature("docstring")  dolfin::MeshCoordinates "
+This Function represents the mesh coordinates on a given mesh.
+";
+
+%feature("docstring")  dolfin::MeshCoordinates::MeshCoordinates "
+Constructor
+";
+
+%feature("docstring")  dolfin::MeshCoordinates::eval "
+Evaluate function
+";
+
+%feature("docstring")  dolfin::FacetArea "
+This function represents the area/length of a cell facet on a given mesh.
+";
+
+%feature("docstring")  dolfin::FacetArea::FacetArea "
+Constructor
+";
+
+%feature("docstring")  dolfin::FacetArea::eval "
+Evaluate function
+";
+
+// Documentation extracted from: (module=function, header=SpecialFacetFunction.h)
+%feature("docstring")  dolfin::SpecialFacetFunction::SpecialFacetFunction "
+**Overloaded versions**
+
+* SpecialFacetFunction\ (f_e)
+
+  Create (scalar-valued) SpecialFacetFunction
+  
+  *Arguments*
+      f_e (list of :py:class:`Function`)
+         Separate _Function_s for each facet
+
+* SpecialFacetFunction\ (f_e, dim)
+
+  Create (vector-valued) SpecialFacetFunction
+  
+  *Arguments*
+      f_e (list of :py:class:`Function`)
+         Separate _Function_s for each facet
+  
+      dim (int)
+          The value-dimension of the Functions
+";
+
+%feature("docstring")  dolfin::SpecialFacetFunction::eval "
+Evaluate SpecialFacetFunction (cf :py:class:`Expression`.eval)
+Evaluate function for given cell
+";
+
+%feature("docstring")  dolfin::SpecialFacetFunction::operator[] "
+Extract sub-function i
+
+*Arguments*
+    i (int)
+       component
+
+*Returns*
+    :py:class:`Function`
+";
+
+// Documentation extracted from: (module=function, header=CCFEMFunctionSpace.h)
+%feature("docstring")  dolfin::CCFEMFunctionSpace "
+This class represents a cut and composite finite element
+function space (CCFEM) defined on one or more possibly
+intersecting meshes.
+
+A CCFEM function space may be created from a set of standard
+function spaces by repeatedly calling add(), followed by a call
+to build(). Note that a CCFEM function space is not useful and
+its data structures are empty until build() has been called.
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::CCFEMFunctionSpace "
+Create empty CCFEM function space
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::dim "
+Return dimension of the CCFEM function space
+
+*Returns*
+    int
+        The dimension of the CCFEM function space.
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::dofmap "
+Return CCFEM dofmap
+
+*Returns*
+    :py:class:`CCFEMDofMap`
+        The dofmap.
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::num_parts "
+Return the number function spaces (parts) of the CCFEM function space
+
+*Returns*
+    int
+        The number of function spaces (parts) of the CCFEM function space.
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::part "
+Return function space (part) number i
+
+*Arguments*
+    i (int)
+        The part number
+
+*Returns*
+    :py:class:`FunctionSpace`
+        Function space (part) number i
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::uncut_cells "
+Return the list of uncut cells for given part. The uncut cells
+are defined as all cells that don't collide with any cells in
+any other part with higher part number.
+
+*Arguments*
+    part (int)
+        The part number
+
+*Returns*
+    numpy.array(int)
+        List of uncut cell indices for given part
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::cut_cells "
+Return the list of cut cells for given part. The cut cells are
+defined as all cells that collide with the boundary of any
+part with higher part number.
+
+FIXME: Figure out whether this makes sense; a cell may collide
+with the boundary of part j but may still be covered
+completely by the domain of part j + 1. Possible solution is
+to for each part i check overlapping parts starting from the
+top and working back down to i + 1.
+
+*Arguments*
+    part (int)
+        The part number
+
+*Returns*
+    numpy.array(int)
+        List of cut cell indices for given part
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::covered_cells "
+Return the list of covered cells for given part. The covered
+cells are defined as all cells that collide with the domain of
+any part with higher part number, but not with the boundary of
+that part; in other words cells that are completely covered by
+any other part (and which therefore are inactive).
+
+*Arguments*
+    part (int)
+        The part number
+
+*Returns*
+    numpy.array(int)
+        List of covered cell indices for given part
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::collision_map_cut_cells "
+Return the collision map for cut cells of the given part
+
+*Arguments*
+    part (int)
+        The part number
+
+*Returns*
+    std::map<unsigned int, std::vector<std::pair<std::size_t, unsigned int> > >
+        A map from cell indices of cut cells to a list of
+        cutting cells. Each cutting cell is represented as a
+        pair (part_number, cutting_cell_index).
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::quadrature_rule_cut_cells "
+Return quadrature rules for cut cells of the given part
+
+*Arguments*
+    part (int)
+        The part number
+
+*Returns*
+    std::map<unsigned int, std::pair<std::vector<double>, std::vector<double> > >
+        A map from cell indices of cut cells to a quadrature
+        rules. Each quadrature rule is represented as a pair
+        of an array of quadrature weights and a corresponding
+        flattened array of quadrature points.
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::add "
+**Overloaded versions**
+
+* add\ (function_space)
+
+  Add function space (shared pointer version)
+  
+  *Arguments*
+      function_space (:py:class:`FunctionSpace`)
+          The function space.
+
+* add\ (function_space)
+
+  Add function space (reference version)
+  
+  *Arguments*
+      function_space (:py:class:`FunctionSpace`)
+          The function space.
+";
+
+%feature("docstring")  dolfin::CCFEMFunctionSpace::build "
+Build CCFEM function space
+";
+
+// Documentation extracted from: (module=function, header=FunctionAssigner.h)
+%feature("docstring")  dolfin::FunctionAssigner "
+This class facilitate assignments between Function and sub
+Functions. It builds and caches maps between compatible
+dofs. These maps are used in the assignment methods which
+perform the actual assignment. Optionally can a MeshFunction be
+passed together with a label, facilitating FunctionAssignment
+over sub domains.
+";
+
+%feature("docstring")  dolfin::FunctionAssigner::FunctionAssigner "
+**Overloaded versions**
+
+* FunctionAssigner\ (receiving_space, assigning_space)
+
+  Create a FunctionAssigner between functions residing in the
+  same type of FunctionSpace. One or both functions can be sub
+  functions.
+  
+  *Arguments*
+      receiving_space (:py:class:`FunctionSpace`)
+          The function space of the receiving function
+      assigning_space (:py:class:`FunctionSpace`)
+          The function space of the assigning function
+
+* FunctionAssigner\ (receiving_spaces, assigning_space)
+
+  Create a FunctionAssigner between one mixed function
+  (assigning) and several functions (receiving). The number of
+  receiving functions must sum up to the number of sub functions
+  in the assigning mixed function. The sub spaces of the
+  assigning mixed space must be of the same type ans size as the
+  receiving spaces.
+  
+  *Arguments*
+      receiving_spaces (list of :py:class:`FunctionSpace`)
+          The recieving function spaces
+      assigning_space (:py:class:`FunctionSpace`)
+          The assigning function space
+
+* FunctionAssigner\ (receiving_space, assigning_spaces)
+
+  Create a FunctionAssigner between several functions
+  (assigning) and one mixed function (receiving). The number of
+  sub functions in the assigning mixed function must sum up to
+  the number of receiving functions. The sub spaces of the
+  receiving mixed space must be of the same type ans size as the
+  assigning spaces.
+  
+  *Arguments*
+      receiving_space (:py:class:`FunctionSpace`)
+          The recieving function space
+      assigning_spaces (std::vector<std::shared_ptr<:py:class:`FunctionSpace`> >)
+          The assigning function spaces
+";
+
+%feature("docstring")  dolfin::FunctionAssigner::assign "
+**Overloaded versions**
+
+* assign\ (receiving_func, assigning_func)
+
+  Assign one function to another
+  
+  *Arguments*
+      receiving_func (:py:class:`Function`)
+          The recieving function
+      assigning_func (:py:class:`Function`)
+          The assigning function
+
+* assign\ (receiving_func, assigning_funcs)
+
+  Assign several functions to sub functions of a mixed receiving
+  function
+  
+  *Arguments*
+      receiving_func (:py:class:`Function`)
+          The recieving mixed function
+      assigning_funcs (std::vector<std::shared_ptr<:py:class:`Function`> >)
+          The assigning functions
+
+* assign\ (receiving_funcs, assigning_func)
+
+  Assign sub functions of a single mixed function to single
+  receiving functions
+  
+  *Arguments*
+      receiving_funcs (std::vector<std::shared_ptr<:py:class:`Function`> >)
+          The recieving functions
+      assigning_func (:py:class:`Function`)
+          The assigning mixed function
+";
+
+%feature("docstring")  dolfin::FunctionAssigner::num_assigning_functions "
+Return the number of assiging functions
+";
+
+%feature("docstring")  dolfin::FunctionAssigner::num_receiving_functions "
+Return the number of receiving functions
+";
+
+// Documentation extracted from: (module=function, header=assign.h)
+%feature("docstring")  dolfin::assign "
+**Overloaded versions**
+
+* assign\ (receiving_func, assigning_func)
+
+  Assign one function to another. The functions must reside in the
+  same type of FunctionSpace. One or both functions can be sub
+  functions.
+  
+  *Arguments*
+      receiving_func (:py:class:`Function`)
+          The recieving function
+      assigning_func (:py:class:`Function`)
+          The assigning function
+
+* assign\ (receiving_func, assigning_funcs)
+
+  Assign several functions to sub functions of a mixed receiving
+  function. The number of receiving functions must sum up to the
+  number of sub functions in the assigning mixed function. The sub
+  spaces of the assigning mixed space must be of the same type ans
+  size as the receiving spaces.
+
+* assign\ (receiving_funcs, assigning_func)
+
+  Assign sub functions of a single mixed function to single
+  receiving functions. The number of sub functions in the
+  assigning mixed function must sum up to the number of receiving
+  functions. The sub spaces of the receiving mixed space must be
+  of the same type ans size as the assigning spaces.
+";
+
+// Documentation extracted from: (module=function, header=CCFEMFunction.h)
+%feature("docstring")  dolfin::CCFEMFunction "
+This class represents a function on a cut and composite finite
+element function space (CCFEM) defined on one or more possibly
+intersecting meshes.
+";
+
+%feature("docstring")  dolfin::CCFEMFunction::CCFEMFunction "
+**Overloaded versions**
+
+* CCFEMFunction\ (V)
+
+  Create CCFEM function on given CCFEM function space
+  
+  *Arguments*
+      V (:py:class:`CCFEMFunctionSpace`)
+          The CCFEM function space.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* CCFEMFunction\ (V)
+
+  Create CCFEM function on given CCFEM function space (shared
+  pointer version)
+  
+  *Arguments*
+      V (:py:class:`CCFEMFunctionSpace`)
+          The CCFEM function space.
+";
+
+%feature("docstring")  dolfin::CCFEMFunction::part "
+Return function (part) number i
+
+*Returns*
+    :py:class:`Function`
+        Function (part) number i
+";
+
+%feature("docstring")  dolfin::CCFEMFunction::vector "
+**Overloaded versions**
+
+* vector\ ()
+
+  Return vector of expansion coefficients (non-const version)
+  
+  *Returns*
+      :py:class:`GenericVector`
+          The vector of expansion coefficients.
+
+* vector\ ()
+
+  Return vector of expansion coefficients (const version)
+  
+  *Returns*
+      :py:class:`GenericVector`
+          The vector of expansion coefficients (const).
+";
+
+// Documentation extracted from: (module=function, header=LagrangeInterpolator.h)
+%feature("docstring")  dolfin::LagrangeInterpolator "
+This class interpolates efficiently from a GenericFunction
+to a Lagrange Function
+";
+
+%feature("docstring")  dolfin::LagrangeInterpolator::interpolate "
+**Overloaded versions**
+
+* interpolate\ (u, u0)
+
+  Interpolate Expression
+  
+  *Arguments*
+      u (:py:class:`Function`)
+          The resulting Function
+      u0 (:py:class:`Expression`)
+          The Expression to be interpolated.
+
+* interpolate\ (u, u0)
+
+  Interpolate function (on possibly non-matching meshes)
+  
+  *Arguments*
+      u (:py:class:`Function`)
+          The resulting Function
+      u0 (:py:class:`Function`)
+          The Function to be interpolated.
+";
+
diff --git a/dolfin/swig/function/import.i b/dolfin/swig/function/import.i
new file mode 100644
index 0000000..9e3231d
--- /dev/null
+++ b/dolfin/swig/function/import.i
@@ -0,0 +1,2 @@
+// Auto generated import statements for the SWIG module: 'function'
+
diff --git a/dolfin/swig/function/post.i b/dolfin/swig/function/post.i
new file mode 100644
index 0000000..612956e
--- /dev/null
+++ b/dolfin/swig/function/post.i
@@ -0,0 +1,151 @@
+/* -*- C -*- */
+// Copyright (C) 2007-2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-11-02
+// Last changed: 2012-11-30
+
+//-----------------------------------------------------------------------------
+// Extend FunctionSpace so one can check if a Function is in a FunctionSpace
+//-----------------------------------------------------------------------------
+%extend dolfin::FunctionSpace {
+%pythoncode %{
+def __contains__(self,u):
+    "Check whether a function is in the FunctionSpace"
+    if isinstance(u, Function):
+        return u._in(self)
+    return False
+
+def leaf_node(self):
+    "Return the finest FunctionSpace in hierarchy"
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(HierarchicalFunctionSpace._leaf_node(self))
+
+def root_node(self):
+    "Return the coarsest FunctionSpace in hierarchy"
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(HierarchicalFunctionSpace._root_node(self))
+
+def child(self):
+    "Return the child FunctionSpace in the hierarchy"
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(HierarchicalFunctionSpace._child(self))
+
+def parent(self):
+    "Return the parent FunctionSpace in the hierarchy"
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(HierarchicalFunctionSpace._parent(self))
+
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Extend GenericFunction interace
+//-----------------------------------------------------------------------------
+/*
+%extend dolfin::GenericFunction {
+%pythoncode %{
+def compute_vertex_values(self, mesh=None):
+    """
+    Compute values at all mesh vertices
+
+    *Arguments*
+        vertex_values (_Array_ <double>)
+            The values at all vertices.
+        mesh (_Mesh_)
+            The mesh.
+    """
+
+    # Check that we get a mesh if we need it
+    if mesh is None:
+        if not isinstance(self, Function):
+            common.dolfin_error("dolfin/swig/function/post.i",
+                                "compute vertex values",
+                                "You need to supply a mesh");
+        elif:
+            mesh = self.function_space().mesh()
+
+    # Argument checks
+    #from numpy import ndarray, zeros
+    #if not isinstance(values, ndarray) or len(values.shape) != 1:
+    #    common.dolfin_error("function/post.i",
+		#	    "compute values at the vertices",
+		#	    "Expected a numpy array with dimension 1 as first argument")
+
+    #value_size = self.value_size()*mesh.num_vertices()
+    #if len(values) != value_size:
+    #    common.dolfin_error("function_post.i",
+		#	    "compute values at the vertices",
+		#	    "The provided array need to be of size value_size()*mesh.num_vertices()")
+
+    # Call the actual method
+    #self._compute_vertex_values(values, mesh)
+
+    return self._compute_vertex_values(mesh)
+%}
+}
+*/
+
+//-----------------------------------------------------------------------------
+// Extend Function interace
+//-----------------------------------------------------------------------------
+%extend dolfin::Function {
+%pythoncode %{
+def function_space(self):
+    "Return the FunctionSpace"
+    from dolfin.functions.functionspace import FunctionSpaceFromCpp
+    return FunctionSpaceFromCpp(self._function_space())
+
+def copy(self, deepcopy=False):
+    """
+    Return a copy of itself
+
+    *Arguments*
+        deepcopy (bool)
+            If false (default) the dof vector is shared.
+
+    *Returns*
+         _Function_
+             The Function
+
+    """
+    from dolfin.functions.function import Function
+    if deepcopy:
+        return Function(self.function_space(), self.vector().copy())
+    return Function(self.function_space(), self.vector())
+
+def leaf_node(self):
+    "Return the finest Function in hierarchy"
+    from dolfin.functions.function import Function
+    return Function(HierarchicalFunction._leaf_node(self))
+
+def root_node(self):
+    "Return the coarsest Function in hierarchy"
+    from dolfin.functions.function import Function
+    return Function(HierarchicalFunction._root_node(self))
+
+def child(self):
+    "Return the child Function in the hierarchy"
+    from dolfin.functions.function import Function
+    return Function(HierarchicalFunction._child(self))
+
+def parent(self):
+    "Return the parent Function in the hierarchy"
+    from dolfin.functions.function import Function
+    return Function(HierarchicalFunction._parent(self))
+%}
+}
diff --git a/dolfin/swig/function/pre.i b/dolfin/swig/function/pre.i
new file mode 100644
index 0000000..a3d8fb7
--- /dev/null
+++ b/dolfin/swig/function/pre.i
@@ -0,0 +1,220 @@
+/* -*- C -*- */
+// Copyright (C) 2007-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug, 2008
+// Modified by Martin Sandve Alnaes, 2008
+// Modified by Johan Hake, 2008-2011
+// Modified by Garth Wells, 2008-2011
+// Modified by Kent-Andre Mardal, 2009
+//
+// First added:  2007-08-16
+// Last changed: 2011-11-22
+
+// ===========================================================================
+// SWIG directives for the DOLFIN function kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+//-----------------------------------------------------------------------------
+// Ignore reference (to FunctionSpaces) constructors of Function
+//-----------------------------------------------------------------------------
+%ignore dolfin::Function::Function(const FunctionSpace&);
+%ignore dolfin::Function::Function(const FunctionSpace&, std::string);
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of Function
+//-----------------------------------------------------------------------------
+%rename(_function_space) dolfin::Function::function_space;
+%rename(sub) dolfin::Function::operator[];
+%rename(_assign) dolfin::Function::operator=;
+%rename(_in) dolfin::Function::in;
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of FunctionSpace
+//-----------------------------------------------------------------------------
+%rename(sub) dolfin::FunctionSpace::operator[];
+%rename(assign) dolfin::FunctionSpace::operator=;
+%ignore dolfin::FunctionSpace::collapse() const;
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of Function
+//-----------------------------------------------------------------------------
+%ignore dolfin::FunctionAXPY::pair;
+%rename(__add__) dolfin::FunctionAXPY::operator+;
+%rename(__sub__) dolfin::FunctionAXPY::operator-;
+%rename(__mul__) dolfin::FunctionAXPY::operator*;
+%rename(__div__) dolfin::FunctionAXPY::operator/;
+
+//-----------------------------------------------------------------------------
+// Rename [] for SpecialFacetFunction -> _sub
+//-----------------------------------------------------------------------------
+%rename(_sub) dolfin::SpecialFacetFunction::operator[];
+
+//-----------------------------------------------------------------------------
+// Ingore operator() in GenericFunction, implemented separately in
+// the Python interface.
+//-----------------------------------------------------------------------------
+%ignore dolfin::GenericFunction::operator();
+
+//-----------------------------------------------------------------------------
+// Rename eval(val, x, cell) method
+// We need to rename the method in the base class as the Python callback ends
+// up here.
+//-----------------------------------------------------------------------------
+%rename(eval_cell) dolfin::GenericFunction::eval(Array<double>& values,
+                                                 const Array<double>& x,
+                                                 const ufc::cell& cell) const;
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of Constant
+//-----------------------------------------------------------------------------
+%rename (__float__) dolfin::Constant::operator double() const;
+%rename(assign) dolfin::Constant::operator=;
+
+//-----------------------------------------------------------------------------
+// Add director classes
+//-----------------------------------------------------------------------------
+%feature("director") dolfin::Expression;
+%feature("nodirector") dolfin::Expression::evaluate;
+%feature("nodirector") dolfin::Expression::restrict;
+%feature("nodirector") dolfin::Expression::update;
+%feature("nodirector") dolfin::Expression::value_dimension;
+%feature("nodirector") dolfin::Expression::value_rank;
+%feature("nodirector") dolfin::Expression::str;
+%feature("nodirector") dolfin::Expression::compute_vertex_values;
+
+//-----------------------------------------------------------------------------
+// Macro for defining an in typemap for a const std::vector<std::pair<double, TYPE*> >&
+// The typemaps takes a list of tuples of floats and TYPE
+//
+// TYPE       : The Pointer type
+//-----------------------------------------------------------------------------
+%define IN_TYPEMAPS_STD_VECTOR_OF_PAIRS_OF_DOUBLE_AND_POINTER(TYPE)
+
+//-----------------------------------------------------------------------------
+// Make SWIG aware of the shared_ptr version of TYPE
+//-----------------------------------------------------------------------------
+%types(std::shared_ptr<dolfin::TYPE>*);
+
+//-----------------------------------------------------------------------------
+// Run the macros for the combination of const and no const of
+// {const} std::vector<std::pair<double, {const} dolfin::TYPE *> >
+//-----------------------------------------------------------------------------
+CONST_IN_TYPEMAPS_STD_VECTOR_OF_PAIRS_OF_DOUBLE_AND_POINTER(TYPE,const)
+CONST_IN_TYPEMAPS_STD_VECTOR_OF_PAIRS_OF_DOUBLE_AND_POINTER(TYPE,)
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining in typemaps for
+// {const} std::vector<std::pair<double, {const} dolfin::TYPE *> >
+// using a Python List of TYPE
+//-----------------------------------------------------------------------------
+%define CONST_IN_TYPEMAPS_STD_VECTOR_OF_PAIRS_OF_DOUBLE_AND_POINTER(TYPE,CONST)
+
+//-----------------------------------------------------------------------------
+// The typecheck
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_POINTER) std::vector<std::pair<double, CONST dolfin::TYPE *> >
+{
+  $1 = PyList_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// The {const} std::vector<std::pair<double, {const} dolfin::TYPE *> > typemap
+//-----------------------------------------------------------------------------
+%typemap (in) std::vector<std::pair<double, CONST dolfin::TYPE *> >
+  (std::vector<std::pair<double, CONST dolfin::TYPE *> > tmp_vec,
+   std::shared_ptr<dolfin::TYPE> tempshared,
+   dolfin::TYPE* arg)
+{
+
+  // CONST_IN_TYPEMAPS_STD_VECTOR_OF_PAIRS_OF_DOUBLE_AND_POINTER(TYPE, CONST)
+  if (!PyList_Check($input))
+    SWIG_exception(SWIG_TypeError, "list of TYPE expected");
+
+  int size = PyList_Size($input);
+  int res = 0;
+  PyObject * py_item = 0;
+  void * itemp = 0;
+  int newmem = 0;
+  double value;
+  tmp_vec.reserve(size);
+  for (int i = 0; i < size; i++)
+  {
+    // Get python object
+    py_item = PyList_GetItem($input, i);
+
+    // Check that it is a tuple with size 2 and first item is a float
+    if (!PyTuple_Check(py_item) || PyTuple_Size(py_item) != 2 || \
+	!PyFloat_Check(PyTuple_GetItem(py_item, 0)))
+      SWIG_exception(SWIG_TypeError, "list of tuples of float and TYPE expected.");
+
+    // Get double value
+    value = PyFloat_AsDouble(PyTuple_GetItem(py_item, 0));
+
+    // Try convert the second tuple argument
+    res = SWIG_ConvertPtr(PyTuple_GetItem(py_item, 1), \
+			  &itemp, $descriptor(dolfin::TYPE *), 0);
+
+    if (SWIG_IsOK(res))
+    {
+      // We have the pointer and the value, push them back!
+      tmp_vec.push_back(std::make_pair(value, reinterpret_cast<dolfin::TYPE *>(itemp)));
+    }
+    else
+    {
+      // If failed with normal pointer conversion then try with shared_ptr conversion
+      newmem = 0;
+      res = SWIG_ConvertPtrAndOwn(PyTuple_GetItem(py_item, 1), &itemp, $descriptor(\
+			std::shared_ptr< dolfin::TYPE > *), \
+				  0, &newmem);
+      if (SWIG_IsOK(res))
+      {
+        if (itemp)
+        {
+          tempshared = *(reinterpret_cast< std::shared_ptr<dolfin::TYPE> * >(itemp));
+	  tmp_vec.push_back(std::make_pair(value, tempshared.get()));
+        }
+
+        // If we need to release memory
+        if (newmem & SWIG_CAST_NEW_MEMORY)
+          delete reinterpret_cast< std::shared_ptr< dolfin::TYPE > * >(itemp);
+      }
+      else
+        SWIG_exception(SWIG_TypeError, "list of tuples of float and TYPE expected. (Bad conversion)");
+    }
+  }
+
+  $1 = tmp_vec;
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Instantiate typemap
+//-----------------------------------------------------------------------------
+IN_TYPEMAPS_STD_VECTOR_OF_PAIRS_OF_DOUBLE_AND_POINTER(Function)
+
+//-----------------------------------------------------------------------------
+// Instantiate Hierarchical FunctionSpace, Function template class
+//-----------------------------------------------------------------------------
+%template (HierarchicalFunctionSpace) dolfin::Hierarchical<dolfin::FunctionSpace>;
+%template (HierarchicalFunction) dolfin::Hierarchical<dolfin::Function>;
+
diff --git a/dolfin/swig/generation/docstrings.i b/dolfin/swig/generation/docstrings.i
new file mode 100644
index 0000000..1980df8
--- /dev/null
+++ b/dolfin/swig/generation/docstrings.i
@@ -0,0 +1,947 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=generation, header=ImplicitDomainMeshGenerator.h)
+%feature("docstring")  dolfin::ImplicitDomainMeshGenerator "
+Generate surface or volume meshes from implicit representations
+of a domain modelled by the abstract dolfin::ImplicitSurface
+class. CGAL is used for the mesh generation.
+";
+
+%feature("docstring")  dolfin::ImplicitDomainMeshGenerator::generate "
+Create volume mesh from implicit surface representation
+";
+
+%feature("docstring")  dolfin::ImplicitDomainMeshGenerator::generate_surface "
+Create surface mesh from implicit surface representation. This
+function uses the CGAL 3D mesh genrator
+";
+
+// Documentation extracted from: (module=generation, header=PolygonalMeshGenerator.h)
+%feature("docstring")  dolfin::PolygonalMeshGenerator "
+Polygonal mesh generator that uses CGAL
+";
+
+%feature("docstring")  dolfin::PolygonalMeshGenerator::generate "
+**Overloaded versions**
+
+* generate\ (mesh, vertices, cell_size)
+
+  Generate mesh of a polygonal domain described by domain vertices
+
+* generate\ (mesh, polygon, cell_size)
+
+  Generate mesh of a domain described by a CGAL polygon
+";
+
+// Documentation extracted from: (module=generation, header=PolyhedralMeshGenerator.h)
+%feature("docstring")  dolfin::PolyhedralMeshGenerator "
+Polyhedral mesh generator that uses CGAL. Volume and surfaces of
+polyhedra (closed surface) can be generated from polyhedra
+defined via polygonal facets.
+";
+
+%feature("docstring")  dolfin::PolyhedralMeshGenerator::generate "
+**Overloaded versions**
+
+* generate\ (mesh, off_file, cell_size, detect_sharp_features=true)
+
+  Create volume mesh from Object File Format (.off) file
+
+* generate\ (mesh, vertices, facets, cell_size, detect_sharp_features=true)
+
+  Create volume mesh from a collection of facets
+";
+
+%feature("docstring")  dolfin::PolyhedralMeshGenerator::generate_surface_mesh "
+**Overloaded versions**
+
+* generate_surface_mesh\ (mesh, vertices, facets, cell_size, detect_sharp_features=true)
+
+  Create surface mesh from a collection of facets
+
+* generate_surface_mesh\ (mesh, off_file, cell_size, detect_sharp_features=true)
+
+  Create a surface mesh from Object File Format (.off) file
+";
+
+%feature("docstring")  dolfin::PolyhedralMeshGenerator::cgal_generate "
+Create mesh from a CGAL polyhedron
+";
+
+%feature("docstring")  dolfin::PolyhedralMeshGenerator::cgal_generate_surface_mesh "
+Create surface mesh from a CGAL polyhedron
+";
+
+// Documentation extracted from: (module=generation, header=Triangulate.h)
+%feature("docstring")  dolfin::Triangulate "
+Create mesh from a triangulation of points
+";
+
+%feature("docstring")  dolfin::Triangulate::triangulate "
+Create mesh from a triangulation of points
+";
+
+// Documentation extracted from: (module=generation, header=BoxMesh.h)
+%feature("docstring")  dolfin::BoxMesh "
+Tetrahedral mesh of the 3D rectangular prism [x0, x1] x [y0, y1]
+x [z0, z1].  Given the number of cells (nx, ny, nz) in each
+direction, the total number of tetrahedra will be 6*nx*ny*nz and
+the total number of vertices will be (nx + 1)*(ny + 1)*(nz + 1).
+";
+
+%feature("docstring")  dolfin::BoxMesh::BoxMesh "
+**Overloaded versions**
+
+* BoxMesh\ (x0, y0, z0, x1, y1, z1, nx, ny, nz)
+
+  Create a uniform finite element :py:class:`Mesh` over the rectangular prism
+  [x0, x1] x [y0, y1] x [z0, z1].
+  
+  *Arguments*
+      x0 (float)
+          :math:`x`-min.
+      y0 (float)
+          :math:`y`-min.
+      z0 (float)
+          :math:`z`-min.
+      x1 (float)
+          :math:`x`-max.
+      y1 (float)
+          :math:`y`-max.
+      z1 (float)
+          :math:`z`-max.
+      xn (float)
+          Number of cells in :math:`x`-direction.
+      yn (float)
+          Number of cells in :math:`y`-direction.
+      zn (float)
+          Number of cells in :math:`z`-direction.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* BoxMesh\ (comm, x0, y0, z0, x1, y1, z1, nx, ny, nz)
+
+  Create a uniform finite element :py:class:`Mesh` over the rectangular prism
+  [x0, x1] x [y0, y1] x [z0, z1].
+  
+  *Arguments*
+      comm (:py:class:`MPI`)
+          MPI communicator
+      x0 (float)
+          :math:`x`-min.
+      y0 (float)
+          :math:`y`-min.
+      z0 (float)
+          :math:`z`-min.
+      x1 (float)
+          :math:`x`-max.
+      y1 (float)
+          :math:`y`-max.
+      z1 (float)
+          :math:`z`-max.
+      xn (float)
+          Number of cells in :math:`x`-direction.
+      yn (float)
+          Number of cells in :math:`y`-direction.
+      zn (float)
+          Number of cells in :math:`z`-direction.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+";
+
+// Documentation extracted from: (module=generation, header=EllipseMesh.h)
+%feature("docstring")  dolfin::EllipseMesh "
+Triangular mesh of an ellipse. CGAL is used to generate the
+mesh.
+";
+
+%feature("docstring")  dolfin::EllipseMesh::EllipseMesh "
+        EllipsoidMesh mesh(Point(1.0, 2.0), dims, 0.2);
+
+";
+
+%feature("docstring")  dolfin::CircleMesh::CircleMesh "
+Create an unstructured :py:class:`Mesh` of a circle
+
+*Arguments*
+    center (:py:class:`Point`)
+        Center of the ellipsoid
+    radius (float)
+        Axes lengths
+    cell_size (float)
+        Cell size measure
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+// Documentation extracted from: (module=generation, header=EllipsoidMesh.h)
+%feature("docstring")  dolfin::EllipsoidMesh "
+Tetrahedral mesh of an ellipsoid. CGAL is used to generate the
+mesh.
+";
+
+%feature("docstring")  dolfin::EllipsoidMesh::EllipsoidMesh "
+        EllipsoidMesh mesh(Point(1.0, 2.0, -1.0), dims, 0.2);
+
+";
+
+%feature("docstring")  dolfin::SphereMesh::SphereMesh "
+Create an unstructured :py:class:`Mesh` of a sphere
+
+*Arguments*
+    center (:py:class:`Point`)
+        Center of the ellipsoid
+    radius (float)
+        Axes lengths
+    cell_size (float)
+        Cell size measure
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+// Documentation extracted from: (module=generation, header=IntervalMesh.h)
+%feature("docstring")  dolfin::IntervalMesh "
+Interval mesh of the 1D line [a,b].  Given the number of cells
+(nx) in the axial direction, the total number of intervals will
+be nx and the total number of vertices will be (nx + 1).
+";
+
+%feature("docstring")  dolfin::IntervalMesh::IntervalMesh "
+**Overloaded versions**
+
+* IntervalMesh\ (nx, a, b)
+
+  Constructor
+  
+  *Arguments*
+      nx (int)
+          The number of cells.
+      a (float)
+          The minimum point (inclusive).
+      b (float)
+          The maximum point (inclusive).
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* IntervalMesh\ (comm, nx, a, b)
+
+  Constructor
+  
+  *Arguments*
+      comm (:py:class:`MPI`)
+          MPI communicator
+      nx (int)
+          The number of cells.
+      a (float)
+          The minimum point (inclusive).
+      b (float)
+          The maximum point (inclusive).
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+";
+
+// Documentation extracted from: (module=generation, header=RectangleMesh.h)
+%feature("docstring")  dolfin::RectangleMesh "
+Triangular mesh of the 2D rectangle (x0, y0) x (x1, y1).
+Given the number of cells (nx, ny) in each direction,
+the total number of triangles will be 2*nx*ny and the
+total number of vertices will be (nx + 1)*(ny + 1).
+";
+
+%feature("docstring")  dolfin::RectangleMesh::RectangleMesh "
+**Overloaded versions**
+
+* RectangleMesh\ (x0, y0, x1, y1, nx, ny, diagonal=\"right\")
+
+  *Arguments*
+      x0 (float)
+          :math:`x`-min.
+      y0 (float)
+          :math:`y`-min.
+      x1 (float)
+          :math:`x`-max.
+      y1 (float)
+          :math:`y`-max.
+      xn (float)
+          Number of cells in :math:`x`-direction.
+      yn (float)
+          Number of cells in :math:`y`-direction.
+      diagonal (str)
+          Direction of diagonals: \"left\", \"right\", \"left/right\", \"crossed\"
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* RectangleMesh\ (comm, x0, y0, x1, y1, nx, ny, diagonal=\"right\")
+
+  *Arguments*
+      comm (:py:class:`MPI`)
+          MPI communicator
+      x0 (float)
+          :math:`x`-min.
+      y0 (float)
+          :math:`y`-min.
+      x1 (float)
+          :math:`x`-max.
+      y1 (float)
+          :math:`y`-max.
+      xn (float)
+          Number of cells in :math:`x`-direction.
+      yn (float)
+          Number of cells in :math:`y`-direction.
+      diagonal (str)
+          Direction of diagonals: \"left\", \"right\", \"left/right\", \"crossed\"
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+";
+
+// Documentation extracted from: (module=generation, header=UnitTetrahedronMesh.h)
+%feature("docstring")  dolfin::UnitTetrahedronMesh "
+A mesh consisting of a single tetrahedron with vertices at
+
+  (0, 0, 0)
+  (1, 0, 0)
+  (0, 1, 0)
+  (0, 0, 1)
+
+This class is useful for testing.
+";
+
+%feature("docstring")  dolfin::UnitTetrahedronMesh::UnitTetrahedronMesh "
+Create mesh of unit tetrahedron
+";
+
+// Documentation extracted from: (module=generation, header=UnitCubeMesh.h)
+%feature("docstring")  dolfin::UnitCubeMesh "
+Tetrahedral mesh of the 3D unit cube [0,1] x [0,1] x [0,1].
+Given the number of cells (nx, ny, nz) in each direction,
+the total number of tetrahedra will be 6*nx*ny*nz and the
+total number of vertices will be (nx + 1)*(ny + 1)*(nz + 1).
+";
+
+%feature("docstring")  dolfin::UnitCubeMesh::UnitCubeMesh "
+**Overloaded versions**
+
+* UnitCubeMesh\ (nx, ny, nz)
+
+  Create a uniform finite element :py:class:`Mesh` over the unit cube
+  [0,1] x [0,1] x [0,1].
+  
+  *Arguments*
+      nx (int)
+          Number of cells in :math:`x` direction.
+      ny (int)
+          Number of cells in :math:`y` direction.
+      nz (int)
+          Number of cells in :math:`z` direction.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* UnitCubeMesh\ (comm, nx, ny, nz)
+
+  Create a uniform finite element :py:class:`Mesh` over the unit cube
+  [0,1] x [0,1] x [0,1].
+  
+  *Arguments*
+      comm (:py:class:`MPI`)
+          MPI communicator
+      nx (int)
+          Number of cells in :math:`x` direction.
+      ny (int)
+          Number of cells in :math:`y` direction.
+      nz (int)
+          Number of cells in :math:`z` direction.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+";
+
+// Documentation extracted from: (module=generation, header=UnitIntervalMesh.h)
+%feature("docstring")  dolfin::UnitIntervalMesh "
+A mesh of the unit interval (0, 1) with a given number of cells
+(nx) in the axial direction. The total number of intervals will
+be nx and the total number of vertices will be (nx + 1).
+";
+
+%feature("docstring")  dolfin::UnitIntervalMesh::UnitIntervalMesh "
+**Overloaded versions**
+
+* UnitIntervalMesh\ (nx)
+
+  Constructor
+  
+  *Arguments*
+      nx (int)
+          The number of cells.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* UnitIntervalMesh\ (comm, nx)
+
+  Constructor
+  
+  *Arguments*
+      comm (:py:class:`MPI`)
+          MPI communicator
+      nx (int)
+          The number of cells.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+";
+
+// Documentation extracted from: (module=generation, header=UnitTriangleMesh.h)
+%feature("docstring")  dolfin::UnitTriangleMesh "
+A mesh consisting of a single triangle with vertices at
+
+  (0, 0)
+  (1, 0)
+  (0, 1)
+
+This class is useful for testing.
+";
+
+%feature("docstring")  dolfin::UnitTriangleMesh::UnitTriangleMesh "
+Create mesh of unit triangle
+";
+
+// Documentation extracted from: (module=generation, header=UnitSquareMesh.h)
+%feature("docstring")  dolfin::UnitSquareMesh "
+Triangular mesh of the 2D unit square [0,1] x [0,1].
+Given the number of cells (nx, ny) in each direction,
+the total number of triangles will be 2*nx*ny and the
+total number of vertices will be (nx + 1)*(ny + 1).
+
+std::string diagonal (\"left\", \"right\", \"right/left\", \"left/right\",
+or \"crossed\") indicates the direction of the diagonals.
+";
+
+%feature("docstring")  dolfin::UnitSquareMesh::UnitSquareMesh "
+**Overloaded versions**
+
+* UnitSquareMesh\ (nx, ny, diagonal=\"right\")
+
+  Create a uniform finite element :py:class:`Mesh` over the unit square
+  [0,1] x [0,1].
+  
+  *Arguments*
+      nx (int)
+          Number of cells in horizontal direction.
+      ny (int)
+          Number of cells in vertical direction.
+      diagonal (str)
+          Optional argument: A std::string indicating
+          the direction of the diagonals.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* UnitSquareMesh\ (comm, nx, ny, diagonal=\"right\")
+
+  Create a uniform finite element :py:class:`Mesh` over the unit square
+  [0,1] x [0,1].
+  
+  *Arguments*
+      comm (:py:class:`MPI`)
+          MPI communicator
+      nx (int)
+          Number of cells in horizontal direction.
+      ny (int)
+          Number of cells in vertical direction.
+      diagonal (str)
+          Optional argument: A std::string indicating
+          the direction of the diagonals.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+";
+
+// Documentation extracted from: (module=generation, header=CSGGeometry.h)
+%feature("docstring")  dolfin::CSGGeometry "
+Geometry described by Constructive Solid Geometry (CSG)
+";
+
+%feature("docstring")  dolfin::CSGGeometry::CSGGeometry "
+Constructor
+";
+
+%feature("docstring")  dolfin::CSGGeometry::dim "
+Return dimension of geometry
+";
+
+%feature("docstring")  dolfin::CSGGeometry::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::CSGGeometry::set_subdomain "
+Define subdomain. This feature is 2D only.
+The subdomain is itself a CSGGeometry and the corresponding
+cells in the resulting will be marked with i
+If subdomains overlap, the latest added will take precedence.
+";
+
+// Documentation extracted from: (module=generation, header=CSGMeshGenerator.h)
+%feature("docstring")  dolfin::CSGMeshGenerator "
+Mesh generator for Constructive Solid Geometry (CSG)
+";
+
+%feature("docstring")  dolfin::CSGMeshGenerator::generate "
+**Overloaded versions**
+
+* generate\ (mesh, geometry, resolution)
+
+  Generate mesh from CSG geometry
+
+* generate\ (mesh, geometry)
+
+  Generate boundary mesh from the surface of a CSG geometry
+";
+
+// Documentation extracted from: (module=generation, header=CSGCGALMeshGenerator2D.h)
+%feature("docstring")  dolfin::CSGCGALMeshGenerator2D "
+Mesh generator for Constructive Solid Geometry (CSG)
+utilizing CGALs 2D Regularized Boolean Set-Operations
+";
+
+%feature("docstring")  dolfin::CSGCGALMeshGenerator2D::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=generation, header=CSGCGALMeshGenerator3D.h)
+%feature("docstring")  dolfin::CSGCGALMeshGenerator3D "
+Mesh generator for Constructive Solid Geometry (CSG)
+utilizing CGALs boolean operation on Nef_polyhedrons.
+";
+
+%feature("docstring")  dolfin::CSGCGALMeshGenerator3D::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=generation, header=CSGOperators.h)
+%feature("docstring")  dolfin::CSGUnion "
+Union of CSG geometries
+";
+
+%feature("docstring")  dolfin::CSGUnion::CSGUnion "
+Create union of two geometries
+";
+
+%feature("docstring")  dolfin::CSGUnion::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::CSGDifference "
+Difference of CSG geometries
+";
+
+%feature("docstring")  dolfin::CSGDifference::CSGDifference "
+Create union of two geometries
+";
+
+%feature("docstring")  dolfin::CSGDifference::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::CSGIntersection "
+Intersection of CSG geometries
+";
+
+%feature("docstring")  dolfin::CSGIntersection::CSGIntersection "
+Create intersection of two geometries
+";
+
+%feature("docstring")  dolfin::CSGIntersection::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::CSGIntersection::operator+ "
+**Overloaded versions**
+
+* operator+\ (g0, g1)
+
+  Create union of two geometries
+
+* operator+\ (g0, g1)
+
+  Create union of two geometries
+
+* operator+\ (g0, g1)
+
+  Create union of two geometries
+
+* operator+\ (g0, g1)
+
+  Create union of two geometries
+";
+
+%feature("docstring")  dolfin::CSGIntersection::operator- "
+**Overloaded versions**
+
+* operator-\ (g0, g1)
+
+  Create difference of two geometries
+
+* operator-\ (g0, g1)
+
+  Create difference of two geometries
+
+* operator-\ (g0, g1)
+
+  Create union of two geometries
+
+* operator-\ (g0, g1)
+
+  Create difference of two geometries
+";
+
+%feature("docstring")  dolfin::CSGIntersection::operator* "
+**Overloaded versions**
+
+* operator*\ (g0, g1)
+
+  Create intersection  of two geometries
+
+* operator*\ (g0, g1)
+
+  Create intersection of two geometries
+
+* operator*\ (g0, g1)
+
+  Create intersection of two geometries
+
+* operator*\ (g0, g1)
+
+  Create intersection of two geometries
+";
+
+// Documentation extracted from: (module=generation, header=CSGPrimitive.h)
+%feature("docstring")  dolfin::CSGPrimitive "
+Base class for Constructive Solid Geometry (CSG) primitives.
+";
+
+// Documentation extracted from: (module=generation, header=CSGPrimitives2D.h)
+%feature("docstring")  dolfin::CSGPrimitive2D "
+Base class for 2D primitives
+";
+
+%feature("docstring")  dolfin::CSGPrimitive2D::dim "
+Return dimension of geometry
+";
+
+%feature("docstring")  dolfin::Circle "
+This class describes a 2D circle which can be used to build
+geometries using Constructive Solid Geometry (CSG).
+";
+
+%feature("docstring")  dolfin::Circle::Circle "
+Create circle at x = (x0, x1) with radius r.
+
+*Arguments*
+    x0 (float)
+        x0-coordinate of center.
+    x1 (float)
+        x1-coordinate of center.
+    r (float)
+        radius.
+    fragments (int)
+        number of fragments.
+";
+
+%feature("docstring")  dolfin::Circle::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::Circle::center "
+Return center of circle
+";
+
+%feature("docstring")  dolfin::Circle::radius "
+Return radius of circle
+";
+
+%feature("docstring")  dolfin::Circle::fragments "
+Return number of fragments around the circle
+";
+
+%feature("docstring")  dolfin::Ellipse "
+This class describes a 2D ellipse which can be used to build
+geometries using Constructive Solid Geometry (CSG).
+";
+
+%feature("docstring")  dolfin::Ellipse::Ellipse "
+Create ellipse at x = (x0, x1) with horizontal semi-axis a and
+vertical semi-axis b.
+
+*Arguments*
+    x0 (float)
+        x0-coordinate of center.
+    x1 (float)
+        x1-coordinate of center.
+    a (float)
+        horizontal semi-axis.
+    b (float)
+        vertical semi-axis.
+    fragments (int)
+        number of fragments.
+";
+
+%feature("docstring")  dolfin::Ellipse::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::Ellipse::center "
+Return center of ellipse
+";
+
+%feature("docstring")  dolfin::Ellipse::a "
+Return horizontal semi-axis
+";
+
+%feature("docstring")  dolfin::Ellipse::b "
+Return vertical semi-axis
+";
+
+%feature("docstring")  dolfin::Ellipse::fragments "
+Return number of fragments around the ellipse
+";
+
+%feature("docstring")  dolfin::Rectangle "
+This class describes a 2D rectangle which can be used to build
+geometries using Constructive Solid Geometry (CSG).
+";
+
+%feature("docstring")  dolfin::Rectangle::Rectangle "
+Create rectangle defined by two opposite corners
+x = (x0, x1) and y = (y0, y1).
+
+*Arguments*
+    x0 (float)
+        x0-coordinate of first corner.
+    x1 (float)
+        x1-coordinate of first corner.
+    y0 (float)
+        y0-coordinate of second corner.
+    y1 (float)
+        y1-coordinate of second corner.
+";
+
+%feature("docstring")  dolfin::Rectangle::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::Rectangle::first_corner "
+Return first corner
+";
+
+%feature("docstring")  dolfin::Rectangle::second_corner "
+Return second corner
+";
+
+%feature("docstring")  dolfin::Polygon "
+This class describes a 2D polygon which can be used to build
+geometries using Constructive Solid Geometry (CSG).
+";
+
+%feature("docstring")  dolfin::Polygon::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::Polygon::vertices "
+Return vertices in polygon
+";
+
+// Documentation extracted from: (module=generation, header=CSGPrimitives3D.h)
+%feature("docstring")  dolfin::CSGPrimitive3D "
+Base class for 3D primitives
+";
+
+%feature("docstring")  dolfin::CSGPrimitive3D::dim "
+Return dimension of geometry
+";
+
+%feature("docstring")  dolfin::Sphere "
+This class describes a 3D sphere which can be used to build
+geometries using Constructive Solid Geometry (CSG).
+";
+
+%feature("docstring")  dolfin::Sphere::Sphere "
+Create sphere with center (x0, x1, x2) and radius r.
+
+*Arguments*
+    center (Point)
+        Center of sphere.
+    r (float)
+        radius.
+";
+
+%feature("docstring")  dolfin::Sphere::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::Box "
+This class describes a 3D box which can be used to build
+geometries using Constructive Solid Geometry (CSG).
+";
+
+%feature("docstring")  dolfin::Box::Box "
+Create box defined by two opposite corners
+x = (x0, x1, x2) and y = (y0, y1, y2).
+
+*Arguments*
+    x0 (float)
+        x0-coordinate of first corner.
+    x1 (float)
+        x1-coordinate of first corner.
+    x2 (float)
+        x2-coordinate of first corner.
+    y0 (float)
+        y0-coordinate of second corner.
+    y1 (float)
+        y1-coordinate of second corner.
+    y2 (float)
+        y2-coordinate of second corner.
+";
+
+%feature("docstring")  dolfin::Box::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::Cone "
+This class describes a 3D cone which can be used to build
+geometries using Constructive Solid Geometry (CSG).
+";
+
+%feature("docstring")  dolfin::Cone::Cone "
+Create cone defined by upper and lower center
+and radius respectively.
+
+*Arguments*
+    top (Point)
+        Center at top of cone.
+    top_radius (float)
+        Radius bottom of cone.
+    bottom (Point)
+        Center at top of cone.
+    bottom_radius (float)
+        radius at top of cone.
+    slices (int)
+        number of faces on the side when generating a
+        polyhedral approximation.
+";
+
+%feature("docstring")  dolfin::Cone::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::Cylinder "
+This class describes a 3D cylinder which can be used to build
+geometries using Constructive Solid Geometry (CSG). A cylinder
+is here just a special case of a cone.
+";
+
+%feature("docstring")  dolfin::Cylinder::Cylinder "
+Create cylinder defined by upper and lower center
+and radius respectively.
+
+*Arguments*
+    top (Point)
+        Center at top of cylinder.
+    bottom (Point)
+        Center at bottom of cylinder.
+    r (float)
+        radius of cylinder.
+    slices (int)
+        number of faces on the side when generating a
+        polyhedral approximation.
+";
+
+%feature("docstring")  dolfin::Tetrahedron "
+This class describes a Tetrahedron which can be used to build
+geometries using Constructive Solid Geometry (CSG).
+";
+
+%feature("docstring")  dolfin::Tetrahedron::Tetrahedron "
+Create tetrahedron defined by four corner points.
+
+*Arguments*
+    x0 (Point)
+        Point.
+    x1 (Point)
+        Point.
+    x2 (Point)
+        Point.
+    x3 (Point)
+        Point.
+";
+
+%feature("docstring")  dolfin::Tetrahedron::str "
+Informal string representation
+";
+
+%feature("docstring")  dolfin::Surface3D "
+This class describes a 3D surface loaded from file.
+The supported file types
+";
+
+%feature("docstring")  dolfin::Surface3D::str "
+Informal string representation
+";
+
+// Documentation extracted from: (module=generation, header=CSGGeometries3D.h)
diff --git a/dolfin/swig/generation/post.i b/dolfin/swig/generation/post.i
new file mode 100644
index 0000000..79fe065
--- /dev/null
+++ b/dolfin/swig/generation/post.i
@@ -0,0 +1,21 @@
+/* -*- C -*- */
+// ===========================================================================
+// SWIG directives for the DOLFIN generation kernel module (post)
+//
+// The directives in this file are applied _after_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+%extend dolfin::CSGGeometry {
+  %pythoncode %{
+     def __add__(self, other) :
+         return CSGUnion(self, other)
+
+     def __mul__(self, other) :
+         return CSGIntersection(self, other)
+
+     def __sub__(self, other) :
+         return CSGDifference(self, other)
+
+  %}
+ }
diff --git a/dolfin/swig/geometry/docstrings.i b/dolfin/swig/geometry/docstrings.i
new file mode 100644
index 0000000..d9b6650
--- /dev/null
+++ b/dolfin/swig/geometry/docstrings.i
@@ -0,0 +1,666 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=geometry, header=ImplicitSurface.h)
+%feature("docstring")  dolfin::ImplicitSurface "
+This class is used to define a surface via a function f(x) -> R,
+where for a point y on the surface f(y) = 0.
+WARNING: This class is experimental and likely to change.
+";
+
+%feature("docstring")  dolfin::ImplicitSurface::ImplicitSurface "
+Create an isosurface
+
+*Arguments*
+    s (Sphere)
+        Bounding sphere for surface.
+
+    type (str)
+        Isosurface type. One of \"manifold\", \"manifold_with_boundary\"
+        or \"non_manifold\".
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::ImplicitSurface::f0 "
+Signed distance function surface. If f0(p) = 0, the point p is
+possibly on the surface, which case ImplicitSurface::f1 can be
+called to check.
+";
+
+%feature("docstring")  dolfin::ImplicitSurface::f1 "
+For a point for which f0 \approx 0, return <= is point is on
+is on the surface.  Can be used for creating open surfaces by
+discarding with any artificial closure.
+";
+
+// Documentation extracted from: (module=geometry, header=Point.h)
+%feature("docstring")  dolfin::Point "
+A Point represents a point in :math:`\mathbb{R}^3` with
+coordinates :math:`x, y, z,` or alternatively, a vector in
+:math:`\mathbb{R}^3`, supporting standard operations like the
+norm, distances, scalar and vector products etc.
+";
+
+%feature("docstring")  dolfin::Point::Point "
+**Overloaded versions**
+
+* Point\ (x=0.0, y=0.0, z=0.0)
+
+  Create a point at (x, y, z). Default value (0, 0, 0).
+  
+  *Arguments*
+      x (float)
+          The x-coordinate.
+      y (float)
+          The y-coordinate.
+      z (float)
+          The z-coordinate.
+
+* Point\ (dim, x)
+
+  Create point from array
+  
+  *Arguments*
+      dim (int)
+          Dimension of the array.
+      x (float)
+          The array to create a Point from.
+
+* Point\ (p)
+
+  Copy constructor
+  
+  *Arguments*
+      p (:py:class:`Point`)
+          The object to be copied.
+";
+
+%feature("docstring")  dolfin::Point::operator[] "
+**Overloaded versions**
+
+* operator[]\ (i)
+
+  Return address of coordinate in direction i
+  
+  *Arguments*
+      i (int)
+          Direction.
+  
+  *Returns*
+      float
+          Adress of coordinate in the given direction.
+
+* operator[]\ (i)
+
+  Return coordinate in direction i
+  
+  *Arguments*
+      i (int)
+          Direction.
+  
+  *Returns*
+      float
+          The coordinate in the given direction.
+";
+
+%feature("docstring")  dolfin::Point::x "
+Return x-coordinate
+
+*Returns*
+    float
+        The x-coordinate.
+";
+
+%feature("docstring")  dolfin::Point::y "
+Return y-coordinate
+
+*Returns*
+    float
+        The y-coordinate.
+";
+
+%feature("docstring")  dolfin::Point::z "
+Return z-coordinate
+
+*Returns*
+    float
+        The z-coordinate.
+";
+
+%feature("docstring")  dolfin::Point::coordinates "
+**Overloaded versions**
+
+* coordinates\ ()
+
+  Return coordinate array
+  
+  *Returns*
+      list of doubles
+          The coordinates.
+
+* coordinates\ ()
+
+  Return coordinate array (const. version)
+  
+  *Returns*
+      list of doubles
+          The coordinates.
+";
+
+%feature("docstring")  dolfin::Point::operator+ "
+Compute sum of two points
+";
+
+%feature("docstring")  dolfin::Point::operator- "
+**Overloaded versions**
+
+* operator-\ (p)
+
+  Compute difference of two points
+
+* operator-\ ()
+
+  Unary minus
+";
+
+%feature("docstring")  dolfin::Point::operator+= "
+Add given point
+";
+
+%feature("docstring")  dolfin::Point::operator-= "
+Subtract given point
+";
+
+%feature("docstring")  dolfin::Point::operator* "
+**Overloaded versions**
+
+* operator*\ (a)
+
+  Multiplication with scalar
+
+* operator*\ (a, p)
+
+  Multiplication with scalar
+";
+
+%feature("docstring")  dolfin::Point::operator*= "
+Incremental multiplication with scalar
+";
+
+%feature("docstring")  dolfin::Point::operator/ "
+Division by scalar
+";
+
+%feature("docstring")  dolfin::Point::operator/= "
+Incremental division by scalar
+";
+
+%feature("docstring")  dolfin::Point::operator= "
+Assignment operator
+";
+
+%feature("docstring")  dolfin::Point::squared_distance "
+Compute squared distance to given point
+
+*Arguments*
+    p (:py:class:`Point`)
+        The point to compute distance to.
+
+*Returns*
+    float
+        The squared distance.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Point::distance "
+Compute distance to given point
+
+*Arguments*
+    p (:py:class:`Point`)
+        The point to compute distance to.
+
+*Returns*
+    float
+        The distance.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Point::norm "
+Compute norm of point representing a vector from the origin
+
+*Returns*
+    float
+        The (Euclidean) norm of the vector from the origin to
+        the point.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Point::squared_norm "
+Compute norm of point representing a vector from the origin
+
+*Returns*
+    float
+        The squared (Euclidean) norm of the vector from the
+        origin of the point.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Point::cross "
+Compute cross product with given vector
+
+*Arguments*
+    p (:py:class:`Point`)
+        Another point.
+
+*Returns*
+    Point
+        The cross product.
+";
+
+%feature("docstring")  dolfin::Point::dot "
+Compute dot product with given vector
+
+*Arguments*
+    p (:py:class:`Point`)
+        Another point.
+
+*Returns*
+    float
+        The dot product.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Point::rotate "
+Rotate around a given axis
+
+*Arguments*
+    a (:py:class:`Point`)
+        The axis to rotate around. Must be unit length.
+    theta (_double_)
+        The rotation angle.
+
+*Returns*
+    Point
+        The rotated point.
+";
+
+%feature("docstring")  dolfin::Point::str "
+Return informal string representation (pretty-print)
+
+*Arguments*
+    verbose (bool)
+        Flag to turn on additional output.
+
+*Returns*
+    str
+        An informal representation of the function space.
+";
+
+// Documentation extracted from: (module=geometry, header=BoundingBoxTree.h)
+%feature("docstring")  dolfin::BoundingBoxTree "
+This class implements a (distributed) axis aligned bounding box
+tree (AABB tree). Bounding box trees can be created from meshes
+and [other data structures, to be filled in].
+";
+
+%feature("docstring")  dolfin::BoundingBoxTree::BoundingBoxTree "
+Create empty bounding box tree
+";
+
+%feature("docstring")  dolfin::BoundingBoxTree::build "
+**Overloaded versions**
+
+* build\ (mesh)
+
+  Build bounding box tree for cells of mesh.
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh for which to compute the bounding box tree.
+
+* build\ (mesh, tdim)
+
+  Build bounding box tree for mesh entities of given dimension.
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh for which to compute the bounding box tree.
+      dimension (int)
+          The entity dimension (topological dimension) for which
+          to compute the bounding box tree.
+
+* build\ (points, gdim)
+
+  Build bounding box tree for point cloud.
+  
+  *Arguments*
+      points (list of :py:class:`Point`)
+          The list of points.
+      gdim (int)
+          The geometric dimension.
+";
+
+%feature("docstring")  dolfin::BoundingBoxTree::compute_collisions "
+**Overloaded versions**
+
+* compute_collisions\ (point)
+
+  Compute all collisions between bounding boxes and :py:class:`Point`.
+  
+  *Returns*
+      numpy.array(int)
+          A list of local indices for entities contained in
+          (leaf) bounding boxes that collide with (intersect)
+          the given point.
+  
+  *Arguments*
+      point (:py:class:`Point`)
+          The point.
+
+* compute_collisions\ (tree)
+
+  Compute all collisions between bounding boxes and :py:class:`BoundingBoxTree`.
+  
+  *Returns*
+      numpy.array(int)
+          A list of local indices for entities in this tree that
+          collide with (intersect) entities in other tree.
+      std::vector<unsigned int>
+          A list of local indices for entities in other tree that
+          collide with (intersect) entities in this tree.
+  
+  The two lists have equal length and contain matching entities,
+  such that entity `i` in the first list collides with entity
+  `i` in the second list.
+  
+  Note that this means that the entity lists may contain
+  duplicate entities since a single entity may collide with
+  several different entities.
+  
+  *Arguments*
+      tree (:py:class:`BoundingBoxTree`)
+          The bounding box tree.
+  
+  Note that this function only checks collisions between bounding
+  boxes of entities. It does not check that the entities
+  themselves actually collide. To compute entity collisions, use
+  the function compute_entity_collisions.
+";
+
+%feature("docstring")  dolfin::BoundingBoxTree::compute_entity_collisions "
+**Overloaded versions**
+
+* compute_entity_collisions\ (point)
+
+  Compute all collisions between entities and :py:class:`Point`.
+  
+  *Returns*
+      numpy.array(int)
+          A list of local indices for entities that collide with
+          (intersect) the given point.
+  
+  *Arguments*
+      point (:py:class:`Point`)
+          The point.
+
+* compute_entity_collisions\ (tree)
+
+  Compute all collisions between entities and :py:class:`BoundingBoxTree`.
+  
+  *Returns*
+      numpy.array(int)
+          A list of local indices for entities in this tree that
+          collide with (intersect) entities in other tree.
+      std::vector<unsigned int>
+          A list of local indices for entities in other tree that
+          collide with (intersect) entities in this tree.
+  
+  The two lists have equal length and contain matching entities,
+  such that entity `i` in the first list collides with entity
+  `i` in the second list.
+  
+  Note that this means that the entity lists may contain
+  duplicate entities since a single entity may collide with
+  several different entities.
+  
+  *Arguments*
+      tree (:py:class:`BoundingBoxTree`)
+          The bounding box tree.
+";
+
+%feature("docstring")  dolfin::BoundingBoxTree::compute_first_collision "
+Compute first collision between bounding boxes and :py:class:`Point`.
+
+*Returns*
+    int
+        The local index for the first found entity contained
+        in a (leaf) bounding box that collides with
+        (intersects) the given point. If not found,
+        std::numeric_limits<unsigned int>::max() is returned.
+
+*Arguments*
+    point (:py:class:`Point`)
+        The point.
+";
+
+%feature("docstring")  dolfin::BoundingBoxTree::compute_first_entity_collision "
+Compute first collision between entities and :py:class:`Point`.
+
+*Returns*
+    int
+        The local index for the first found entity that
+        collides with (intersects) the given point. If not
+        found, std::numeric_limits<unsigned int>::max() is
+        returned.
+
+*Arguments*
+    point (:py:class:`Point`)
+        The point.
+";
+
+%feature("docstring")  dolfin::BoundingBoxTree::compute_closest_entity "
+Compute closest entity to :py:class:`Point`.
+
+*Returns*
+    int
+        The local index for the entity that is closest to the
+        point. If more than one entity is at the same distance
+        (or point contained in entity), then the first entity
+        is returned.
+    double
+        The distance to the closest entity.
+
+*Arguments*
+    point (:py:class:`Point`)
+        The point.
+";
+
+%feature("docstring")  dolfin::BoundingBoxTree::compute_closest_point "
+Compute closest point to :py:class:`Point`. This function assumes
+that the tree has been built for a point cloud.
+
+Developer note: This function should not be confused with
+computing the closest point in all entities of a mesh. That
+function could be added with relative ease since we actually
+compute the closest points to get the distance in the above
+function (compute_closest_entity) inside the specialized
+implementations in TetrahedronCell.cpp etc.
+
+*Returns*
+    int
+        The local index for the point that is closest to the
+        point. If more than one point is at the same distance
+        (or point contained in entity), then the first point
+        is returned.
+    double
+        The distance to the closest point.
+
+*Arguments*
+    point (:py:class:`Point`)
+        The point.
+";
+
+// Documentation extracted from: (module=geometry, header=GenericBoundingBoxTree.h)
+%feature("docstring")  dolfin::GenericBoundingBoxTree "
+Base class for bounding box implementations (envelope-letter
+design)
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::GenericBoundingBoxTree "
+Constructor
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::build "
+**Overloaded versions**
+
+* build\ (mesh, tdim)
+
+  Build bounding box tree for mesh entites of given dimension
+
+* build\ (points)
+
+  Build bounding box tree for point cloud
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::compute_collisions "
+**Overloaded versions**
+
+* compute_collisions\ (point)
+
+  Compute all collisions between bounding boxes and :py:class:`Point`
+
+* compute_collisions\ (tree)
+
+  Compute all collisions between bounding boxes and :py:class:`BoundingBoxTree`
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::compute_entity_collisions "
+**Overloaded versions**
+
+* compute_entity_collisions\ (point, mesh)
+
+  Compute all collisions between entities and :py:class:`Point`
+
+* compute_entity_collisions\ (tree, mesh_A, mesh_B)
+
+  Compute all collisions between entities and :py:class:`BoundingBoxTree`
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::compute_first_collision "
+Compute first collision between bounding boxes and :py:class:`Point`
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::compute_first_entity_collision "
+Compute first collision between entities and :py:class:`Point`
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::compute_closest_entity "
+Compute closest entity and distance to :py:class:`Point`
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::compute_closest_point "
+Compute closest point and distance to :py:class:`Point`
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::_compute_collisions "
+**Overloaded versions**
+
+* _compute_collisions\ (tree, point, node, entities, mesh)
+
+  Compute collisions with point (recursive)
+
+* _compute_collisions\ (A, B, node_A, node_B, entities_A, entities_B, mesh_A, mesh_B)
+
+  Compute collisions with tree (recursive)
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::_compute_first_collision "
+Compute first collision (recursive)
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::_compute_first_entity_collision "
+Compute first entity collision (recursive)
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::_compute_closest_entity "
+Compute closest entity (recursive)
+";
+
+%feature("docstring")  dolfin::GenericBoundingBoxTree::_compute_closest_point "
+Compute closest point (recursive)
+";
+
+// Documentation extracted from: (module=geometry, header=BoundingBoxTree3D.h)
+// Documentation extracted from: (module=geometry, header=MeshPointIntersection.h)
+%feature("docstring")  dolfin::MeshPointIntersection "
+This class represents an intersection between a :py:class:`Mesh` and a
+:py:class:`Point`. The resulting intersection is stored as a list of zero
+or more cells.
+";
+
+%feature("docstring")  dolfin::MeshPointIntersection::MeshPointIntersection "
+Compute intersection between mesh and point
+";
+
+%feature("docstring")  dolfin::MeshPointIntersection::intersected_cells "
+Return the list of (local) indices for intersected cells
+";
+
+// Documentation extracted from: (module=geometry, header=intersect.h)
+%feature("docstring")  dolfin::intersect "
+Compute and return intersection between :py:class:`Mesh` and :py:class:`Point`.
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        The mesh to be intersected.
+    point (:py:class:`Point`)
+        The point to be intersected.
+
+*Returns*
+    :py:class:`MeshPointIntersection`
+        The intersection data.
+";
+
diff --git a/dolfin/swig/geometry/post.i b/dolfin/swig/geometry/post.i
new file mode 100644
index 0000000..78ad188
--- /dev/null
+++ b/dolfin/swig/geometry/post.i
@@ -0,0 +1,42 @@
+/* -*- C -*- */
+// Copyright (C) 2006-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Jansson 2006-2007
+// Modified by Ola Skavhaug 2006-2007
+// Modified by Garth Wells 2007-2010
+// Modified by Johan Hake 2008-2009
+//
+// First added:  2006-09-20
+// Last changed: 2011-03-11
+
+//=============================================================================
+// SWIG directives for the DOLFIN Geometry kernel module (post)
+//
+// The directives in this file are applied _after_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Extend Point interface with Python selectors
+//-----------------------------------------------------------------------------
+%feature("docstring") dolfin::Point::__getitem__ "Missing docstring";
+%feature("docstring") dolfin::Point::__setitem__ "Missing docstring";
+%extend dolfin::Point {
+  double __getitem__(int i) { return (*self)[i]; }
+  void __setitem__(int i, double val) { (*self)[i] = val; }
+}
diff --git a/dolfin/swig/geometry/pre.i b/dolfin/swig/geometry/pre.i
new file mode 100644
index 0000000..dabbc91
--- /dev/null
+++ b/dolfin/swig/geometry/pre.i
@@ -0,0 +1,50 @@
+/* -*- C -*- */
+// Copyright (C) 2013 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-10
+// Last changed: 2014-05-20
+
+// ===========================================================================
+// SWIG directives for the DOLFIN geometry kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+//-----------------------------------------------------------------------------
+// Point ignores
+//-----------------------------------------------------------------------------
+%ignore dolfin::Point::operator=;
+%ignore dolfin::Point::operator[];
+
+//-----------------------------------------------------------------------------
+// Ignore reference (to FunctionSpaces) constructors of BoundingBoxTree
+//-----------------------------------------------------------------------------
+%ignore dolfin::BoundingBoxTree::BoundingBoxTree(const Mesh&);
+%ignore dolfin::BoundingBoxTree::BoundingBoxTree(const Mesh&, unsigned int);
+
+//-----------------------------------------------------------------------------
+// Ignore nested classes. They are not supported by SWIG
+//-----------------------------------------------------------------------------
+%warnfilter(325) dolfin::GenericBoundingBoxTree::BBox;
+%warnfilter(325) dolfin::GenericBoundingBoxTree::less_x_point;
+%warnfilter(325) dolfin::GenericBoundingBoxTree::less_y_point;
+%warnfilter(325) dolfin::GenericBoundingBoxTree::less_z_point;
+%warnfilter(325) dolfin::GenericBoundingBoxTree::less_x_bbox;
+%warnfilter(325) dolfin::GenericBoundingBoxTree::less_y_bbox;
+%warnfilter(325) dolfin::GenericBoundingBoxTree::less_z_bbox;
diff --git a/dolfin/swig/globalincludes.i b/dolfin/swig/globalincludes.i
new file mode 100644
index 0000000..1ba9cb0
--- /dev/null
+++ b/dolfin/swig/globalincludes.i
@@ -0,0 +1,57 @@
+// Code snippets for global includes for the combined SWIG modules
+//
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-01-17
+// Last changed: 2012-01-18
+
+// Global shared_ptr classes
+// NOTE: These classes need to be declared for all classes in all combined 
+// NOTE: modules
+%include "dolfin/swig/shared_ptr_classes.i"
+
+// Global typemaps
+%include "dolfin/swig/typemaps/includes.i"
+
+// Fragments
+%fragment("NoDelete", "header") {
+%#include "dolfin/common/NoDeleter.h"
+}
+
+// Global exceptions
+%include <exception.i>
+%include "dolfin/swig/exceptions.i"
+
+// Do not expand default arguments in C++ by generating two an extra 
+// function in the SWIG layer. This reduces code bloat.
+// NOTE: Hake Commenting out compactdefaultargs as it creates problems for SWIG 
+// NOTE: to evaluate bool arguments with default values where another method with
+// NOTE: the same number of arguments excists. 
+//%feature("compactdefaultargs");
+
+// STL SWIG string class
+%include <std_string.i>
+
+// Include information about swig version
+%include "dolfin/swig/version.i"
+
+// Include SWIG defines
+%include "dolfin/swig/defines.i"
+
+// Include all forward declarations
+%include "dolfin/swig/forwarddeclarations.i"
diff --git a/dolfin/swig/graph/docstrings.i b/dolfin/swig/graph/docstrings.i
new file mode 100644
index 0000000..d8c7456
--- /dev/null
+++ b/dolfin/swig/graph/docstrings.i
@@ -0,0 +1,76 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=graph, header=Graph.h)
+// Documentation extracted from: (module=graph, header=GraphBuilder.h)
+%feature("docstring")  dolfin::GraphBuilder "
+This class builds a Graph corresponding to various objects
+";
+
+%feature("docstring")  dolfin::GraphBuilder::local_graph "
+**Overloaded versions**
+
+* local_graph\ (mesh, dofmap0, dofmap1)
+
+  Build local graph from dofmap
+
+* local_graph\ (mesh, coloring_type)
+
+  Build local graph from mesh (general version)
+
+* local_graph\ (mesh, dim0, dim1)
+
+  Build local graph (specialized version)
+";
+
+%feature("docstring")  dolfin::GraphBuilder::compute_dual_graph "
+Build distributed dual graph (cell-cell connections) for from
+LocalMeshData
+";
+
+// Documentation extracted from: (module=graph, header=BoostGraphOrdering.h)
+%feature("docstring")  dolfin::BoostGraphOrdering "
+This class computes graph re-orderings. It uses Boost Graph.
+";
+
+%feature("docstring")  dolfin::BoostGraphOrdering::compute_cuthill_mckee "
+**Overloaded versions**
+
+* compute_cuthill_mckee\ (graph, reverse=false)
+
+  Compute re-ordering (map[old] -> new) using Cuthill-McKee algorithm
+
+* compute_cuthill_mckee\ (edges, size, reverse=false)
+
+  Compute re-ordering (map[old] -> new) using Cuthill-McKee algorithm
+";
+
+// Documentation extracted from: (module=graph, header=SCOTCH.h)
+%feature("docstring")  dolfin::SCOTCH "
+This class proivdes an interface to SCOTCH-PT (parallel version)
+";
+
+%feature("docstring")  dolfin::SCOTCH::compute_gps "
+Compute reordering (map[old] -> new) using
+Gibbs-Poole-Stockmeyer re-ordering
+";
+
diff --git a/dolfin/swig/graph/post.i b/dolfin/swig/graph/post.i
new file mode 100644
index 0000000..a1f7bd7
--- /dev/null
+++ b/dolfin/swig/graph/post.i
@@ -0,0 +1,12 @@
+/* -*- C -*- */
+// ===========================================================================
+// SWIG directives for the DOLFIN graph kernel module (post)
+//
+// The directives in this file are applied _after_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+// ---------------------------------------------------------------------------
+// Instantiate template classes
+// ---------------------------------------------------------------------------
+%template(Graph) std::vector<dolfin::graph_set_type>;
diff --git a/dolfin/swig/io/docstrings.i b/dolfin/swig/io/docstrings.i
new file mode 100644
index 0000000..551138e
--- /dev/null
+++ b/dolfin/swig/io/docstrings.i
@@ -0,0 +1,481 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=io, header=GenericFile.h)
+%feature("docstring")  dolfin::GenericFile::GenericFile "
+Constructor
+";
+
+// Documentation extracted from: (module=io, header=File.h)
+%feature("docstring")  dolfin::File "
+A File represents a data file for reading and writing objects.
+Unless specified explicitly, the format is determined by the
+file name suffix.
+A list of objects that can be read/written to file can be found in
+GenericFile.h. Compatible file formats include:
+    * Binary (.bin)
+    * RAW    (.raw)
+    * SVG    (.svg)
+    * XD3    (.xd3)
+    * XDMF   (.xdmf)
+    * XML    (.xml)
+    * XYZ    (.xyz)
+    * VTK    (.pvd)
+";
+
+%feature("docstring")  dolfin::File::File "
+**Overloaded versions**
+
+* File\ (filename, encoding=\"ascii\")
+
+  Create a file with given name
+  
+  *Arguments*
+      filename (str)
+          Name of file.
+      encoding (str)
+          Optional argument specifying encoding, ascii is default.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* File\ (comm, filename, encoding=\"ascii\")
+
+  Create a file with given name with MPI communicator
+  
+  *Arguments*
+      communicator (:py:class:`MPI`)
+          The MPI communicator.
+      filename (str)
+          Name of file.
+      encoding (str)
+          Optional argument specifying encoding, ascii is default.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* File\ (filename, type, encoding=\"ascii\")
+
+  Create a file with given name and type (format)
+  
+  *Arguments*
+      filename (str)
+          Name of file.
+      type (Type)
+          File format.
+      encoding (str)
+          Optional argument specifying encoding, ascii is default.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* File\ (comm, filename, type, encoding=\"ascii\")
+
+  Create a file with given name and type (format) with MPI communicator
+  
+  *Arguments*
+      communicator (:py:class:`MPI`)
+          The MPI communicator.
+      filename (str)
+          Name of file.
+      type (Type)
+          File format.
+      encoding (str)
+          Optional argument specifying encoding, ascii is default.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* File\ (outstream)
+
+  Create an outfile object writing to stream
+  
+  *Arguments*
+      outstream (std::ostream)
+          The stream.
+";
+
+%feature("docstring")  dolfin::File::operator>> "
+Read from file
+";
+
+%feature("docstring")  dolfin::File::operator<< "
+**Overloaded versions**
+
+* operator<<\ (Mesh*, mesh)
+
+  Write Mesh to file with time
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* operator<<\ (MeshFunction<int>*, f)
+
+  Write MeshFunction to file with time
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* operator<<\ (f)
+
+  Write MeshFunction to file with time
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* operator<<\ (MeshFunction<double>*, f)
+
+  Write MeshFunction to file with time
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* operator<<\ (MeshFunction<bool>*, f)
+
+  Write MeshFunction to file with time
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* operator<<\ (Function*, u)
+
+  Write Function to file with time
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* operator<<\ (t)
+
+  Write object to file
+";
+
+%feature("docstring")  dolfin::File::exists "
+Check if file exists
+
+*Arguments*
+    filename (str)
+        Name of file.
+
+*Returns*
+    bool
+        True if the file exists.
+";
+
+%feature("docstring")  dolfin::File::create_parent_path "
+
+*Arguments*
+    filename (str)
+        Name of file / path.
+";
+
+// Documentation extracted from: (module=io, header=XDMFFile.h)
+%feature("docstring")  dolfin::XDMFFile "
+This class supports the output of meshes and functions in XDMF
+(http://www.xdmf.org) format. It creates an XML file that describes
+the data and points to a HDF5 file that stores the actual problem
+data. Output of data in parallel is supported.
+
+XDMF is not suitable for checkpointing as it may decimate
+some data.
+";
+
+%feature("docstring")  dolfin::XDMFFile::XDMFFile "
+Constructor
+";
+
+%feature("docstring")  dolfin::XDMFFile::operator<< "
+**Overloaded versions**
+
+* operator<<\ (mesh)
+
+  Save a mesh for visualisation, with e.g. ParaView. Creates a HDF5
+  file to store the mesh, and a related XDMF file with metadata.
+
+* operator<<\ (u)
+
+  Save a Function to XDMF/HDF5 files for visualisation.
+
+* operator<<\ (Function*, ut)
+
+  Save Function + time stamp to file
+
+* operator<<\ (meshfunction)
+
+  Save MeshFunction to file
+";
+
+%feature("docstring")  dolfin::XDMFFile::read "
+Read in a mesh from the associated HDF5 file,
+optionally using stored partitioning, if possible
+when the same number of processes are being used.
+";
+
+%feature("docstring")  dolfin::XDMFFile::operator>> "
+**Overloaded versions**
+
+* operator>>\ (mesh)
+
+  Read in a mesh from the associated HDF5 file
+
+* operator>>\ (meshfunction)
+
+  Read first MeshFunction from file
+";
+
+%feature("docstring")  dolfin::XDMFFile::write "
+**Overloaded versions**
+
+* write\ (points)
+
+  Save a cloud of points to file
+
+* write\ (points, values)
+
+  Save a cloud of points, with scalar values
+";
+
+// Documentation extracted from: (module=io, header=HDF5File.h)
+%feature("docstring")  dolfin::HDF5File::HDF5File "
+Constructor. file_mode should \"a\" (append), \"w\" (write) or \"r\"
+(read).
+";
+
+%feature("docstring")  dolfin::HDF5File::close "
+Close file
+";
+
+%feature("docstring")  dolfin::HDF5File::write "
+**Overloaded versions**
+
+* write\ (points, name)
+
+  Write points to file
+
+* write\ (values, name)
+
+  Write simple vector of double to file
+
+* write\ (x, name)
+
+  Write Vector to file in a format suitable for re-reading
+
+* write\ (mesh, name)
+
+  Write Mesh to file in a format suitable for re-reading
+
+* write\ (mesh, cell_dim, name)
+
+  Write Mesh of given cell dimension to file in a format
+  suitable for re-reading
+
+* write\ (u, name)
+
+  Write Function to file in a format suitable for re-reading
+
+* write\ (u, name, timestamp)
+
+  Write Function to file with a timestamp
+
+* write\ (meshfunction, name)
+
+  Write MeshFunction to file in a format suitable for re-reading
+
+* write\ (meshfunction, name)
+
+  Write MeshFunction to file in a format suitable for re-reading
+
+* write\ (meshfunction, name)
+
+  Write MeshFunction to file in a format suitable for re-reading
+
+* write\ (meshfunction, name)
+
+  Write MeshFunction to file in a format suitable for re-reading
+
+* write\ (mesh_values, name)
+
+  Write MeshValueCollection to file
+
+* write\ (mesh_values, name)
+
+  Write MeshValueCollection to file
+
+* write\ (mesh_values, name)
+
+  Write MeshValueCollection to file
+";
+
+%feature("docstring")  dolfin::HDF5File::read "
+**Overloaded versions**
+
+* read\ (x, dataset_name, use_partition_from_file)
+
+  Read vector from file and optionally re-use any partitioning
+  that is available in the file
+
+* read\ (u, name)
+
+  Read Function from file and distribute data according to
+  the Mesh and dofmap associated with the Function
+
+* read\ (mesh, name, use_partition_from_file)
+
+  Read Mesh from file and optionally re-use any partition data
+  in the file
+
+* read\ (meshfunction, name)
+
+  Read MeshFunction from file
+
+* read\ (meshfunction, name)
+
+  Read MeshFunction from file
+
+* read\ (meshfunction, name)
+
+  Read MeshFunction from file
+
+* read\ (meshfunction, name)
+
+  Read MeshFunction from file
+
+* read\ (mesh_values, name)
+
+  Read MeshValueCollection from file
+
+* read\ (mesh_values, name)
+
+  Read MeshValueCollection from file
+
+* read\ (mesh_values, name)
+
+  Read MeshValueCollection from file
+";
+
+%feature("docstring")  dolfin::HDF5File::has_dataset "
+Check if dataset exists in HDF5 file
+";
+
+%feature("docstring")  dolfin::HDF5File::flush "
+Flush buffered I/O to disk
+";
+
+// Documentation extracted from: (module=io, header=HDF5Attribute.h)
+%feature("docstring")  dolfin::HDF5Attribute "
+HDF5Attribute gives access to the attributes of a dataset
+via set() and get() methods
+";
+
+%feature("docstring")  dolfin::HDF5Attribute::HDF5Attribute "
+Constructor
+";
+
+%feature("docstring")  dolfin::HDF5Attribute::exists "
+Check for the existence of an attribute on a dataset
+";
+
+%feature("docstring")  dolfin::HDF5Attribute::set "
+**Overloaded versions**
+
+* set\ (attribute_name, value)
+
+  Set the value of a double attribute in the HDF5 file
+
+* set\ (attribute_name, value)
+
+  Set the value of a double attribute in the HDF5 file
+
+* set\ (attribute_name, value)
+
+  Set the value of an array of float attribute in the HDF5 file
+
+* set\ (attribute_name, value)
+
+  Set the value of an array of float attribute in the HDF5 file
+
+* set\ (attribute_name, value)
+
+  Set the value of a string attribute in the HDF5 file
+";
+
+%feature("docstring")  dolfin::HDF5Attribute::get "
+**Overloaded versions**
+
+* get\ (attribute_name, value)
+
+  Set the value of a double attribute in the HDF5 file
+
+* get\ (attribute_name, value)
+
+  Get the value of a vector double attribute in the HDF5 file
+
+* get\ (attribute_name, value)
+
+  Set the value of a double attribute in the HDF5 file
+
+* get\ (attribute_name, value)
+
+  Get the value of a vector double attribute in the HDF5 file
+
+* get\ (attribute_name, value)
+
+  Get the value of an attribute in the HDF5 file as a string
+";
+
+%feature("docstring")  dolfin::HDF5Attribute::str "
+**Overloaded versions**
+
+* str\ (attribute_name)
+
+  Get the value of the attribute in the HDF5 file
+  as a string representation
+
+* str\ ()
+
+  Get the names of all the attributes on this dataset
+";
+
+%feature("docstring")  dolfin::HDF5Attribute::type_str "
+Get the type of the attribute \"string\", \"float\", \"int\"
+\"vectorfloat\", \"vectorint\" or \"unsupported\"
+";
+
diff --git a/dolfin/swig/io/post.i b/dolfin/swig/io/post.i
new file mode 100644
index 0000000..ed9cefe
--- /dev/null
+++ b/dolfin/swig/io/post.i
@@ -0,0 +1,64 @@
+// Instantiate io template functions
+
+// Input
+%template(__rshift__) dolfin::File::operator>> <GenericVector>;
+%template(__rshift__) dolfin::File::operator>> <GenericMatrix>;
+%template(__rshift__) dolfin::File::operator>> <Mesh>;
+%template(__rshift__) dolfin::File::operator>> <LocalMeshData>;
+%template(__rshift__) dolfin::File::operator>> <MeshFunction<int> >;
+%template(__rshift__) dolfin::File::operator>> <MeshFunction<std::size_t> >;
+%template(__rshift__) dolfin::File::operator>> <MeshFunction<double> >;
+%template(__rshift__) dolfin::File::operator>> <MeshFunction<bool> >;
+%template(__rshift__) dolfin::File::operator>> <MeshValueCollection<int> >;
+%template(__rshift__) dolfin::File::operator>> <MeshValueCollection<std::size_t> >;
+%template(__rshift__) dolfin::File::operator>> <MeshValueCollection<double> >;
+%template(__rshift__) dolfin::File::operator>> <MeshValueCollection<bool> >;
+%template(__rshift__) dolfin::File::operator>> <Parameters>;
+%template(__rshift__) dolfin::File::operator>> <Function>;
+
+// Output
+%template(__lshift__) dolfin::File::operator<< <GenericVector>;
+%template(__lshift__) dolfin::File::operator<< <GenericMatrix>;
+%template(__lshift__) dolfin::File::operator<< <Mesh>;
+%template(__lshift__) dolfin::File::operator<< <LocalMeshData>;
+%template(__lshift__) dolfin::File::operator<< <MeshFunction<int> >;
+%template(__lshift__) dolfin::File::operator<< <MeshFunction<std::size_t> >;
+%template(__lshift__) dolfin::File::operator<< <MeshFunction<double> >;
+%template(__lshift__) dolfin::File::operator<< <MeshFunction<bool> >;
+%template(__lshift__) dolfin::File::operator<< <MeshValueCollection<int> >;
+%template(__lshift__) dolfin::File::operator<< <MeshValueCollection<std::size_t> >;
+%template(__lshift__) dolfin::File::operator<< <MeshValueCollection<double> >;
+%template(__lshift__) dolfin::File::operator<< <MeshValueCollection<bool> >;
+%template(__lshift__) dolfin::File::operator<< <Parameters>;
+%template(__lshift__) dolfin::File::operator<< <Function>;
+
+#ifdef HAS_HDF5
+%extend dolfin::HDF5Attribute {
+  void __setitem__(std::string key, double value)
+  { $self->set(key, value); }
+  void __setitem__(std::string key, std::size_t value)
+  { $self->set(key, value); }
+  void __setitem__(std::string key, std::string value)
+  { $self->set(key, value); }
+  void __setitem__(std::string key, const std::vector<double>& value)
+  { $self->set(key, value); }
+  void __setitem__(std::string key, const std::vector<std::size_t>& value)
+  { $self->set(key, value); }
+
+%pythoncode %{
+def __getitem__(self, key):
+    attr_type = self.type_str(key)
+    if attr_type=="string":
+        return self.str(key)
+    elif attr_type=="float":
+        return float(self.str(key))
+    elif attr_type=="int":
+        return int(self.str(key))
+    elif attr_type=="vectorfloat":
+        return [float(x) for x in self.str(key).split(",")]
+    elif attr_type=="vectorint":
+        return [int(x) for x in self.str(key).split(",")]
+    return None
+%}
+}
+#endif
diff --git a/dolfin/swig/io/pre.i b/dolfin/swig/io/pre.i
new file mode 100644
index 0000000..c104913
--- /dev/null
+++ b/dolfin/swig/io/pre.i
@@ -0,0 +1,39 @@
+/* -*- C -*- */
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-11-01
+// Last changed: 2013-02-21
+
+%ignore dolfin::GenericFile::operator>> (std::vector<int>& x);
+%ignore dolfin::GenericFile::operator>> (std::vector<std::size_t>& x);
+%ignore dolfin::GenericFile::operator>> (std::vector<double>& x);
+%ignore dolfin::GenericFile::operator>> (std::map<std::size_t, int>& map);
+%ignore dolfin::GenericFile::operator>> (std::map<std::size_t, std::size_t>& map);
+%ignore dolfin::GenericFile::operator>> (std::map<std::size_t, double>& map);
+%ignore dolfin::GenericFile::operator>> (std::map<std::size_t, std::vector<int> >& array_map);
+%ignore dolfin::GenericFile::operator>> (std::map<std::size_t, std::vector<std::size_t> >& array_map);
+%ignore dolfin::GenericFile::operator>> (std::map<std::size_t, std::vector<double> >& array_map);
+%ignore dolfin::GenericFile::operator<< (const std::vector<int>& x);
+%ignore dolfin::GenericFile::operator<< (const std::vector<std::size_t>& x);
+%ignore dolfin::GenericFile::operator<< (const std::vector<double>& x);
+%ignore dolfin::GenericFile::operator<< (const std::map<std::size_t, int>& map);
+%ignore dolfin::GenericFile::operator<< (const std::map<std::size_t, std::size_t>& map);
+%ignore dolfin::GenericFile::operator<< (const std::map<std::size_t, double>& map);
+%ignore dolfin::GenericFile::operator<< (const std::map<std::size_t, std::vector<int> >& array_map);
+%ignore dolfin::GenericFile::operator<< (const std::map<std::size_t, std::vector<std::size_t> >& array_map);
+%ignore dolfin::GenericFile::operator<< (const std::map<std::size_t, std::vector<double> >& array_map);
diff --git a/dolfin/swig/la/Indices.i b/dolfin/swig/la/Indices.i
new file mode 100644
index 0000000..c0ad1c2
--- /dev/null
+++ b/dolfin/swig/la/Indices.i
@@ -0,0 +1,354 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-04-27
+// Last changed: 2013-06-10
+
+class Indices
+{
+public:
+
+  // Constructor
+  Indices() : _index_size(0), _indices(0), _range(0){}
+
+  // Constructor
+  Indices(std::size_t size) : _index_size(size), _indices(0), _range(0){}
+
+  // Destructor
+  virtual ~Indices()
+  { clear(); }
+
+  // Clear any created array
+  void clear()
+  {
+    if (_indices)
+      delete[] _indices;
+    if (_range)
+      delete[] _range;
+  }
+
+  // Returns an array of indices
+  dolfin::la_index* indices()
+  {
+    // Construct the array if not excisting
+    if (!_indices)
+    {
+      _indices = new dolfin::la_index[size()];
+      for (std::size_t i = 0; i < size(); i++)
+        _indices[i] = index(i);
+    }
+    return _indices;
+  }
+
+  dolfin::la_index* range()
+  {
+    // Construct the array if not existing
+    if (!_range)
+    {
+      _range = new dolfin::la_index[size()];
+      for (std::size_t i = 0; i < size(); i++)
+        _range[i] = i;
+    }
+    return _range;
+  }
+
+  // Returns the ith index, raises RuntimeError if i is out of range
+  virtual std::size_t index(std::size_t i) = 0;
+
+  // Return the size of the indices
+  std::size_t size()
+  { return _index_size; }
+
+  // Check bounds of index and change from any negative to positive index
+  static std::size_t check_index(int index, unsigned int vector_size)
+  {
+    // Check bounds
+    if (index >= static_cast<int>(vector_size)
+        || index < -static_cast<int>(vector_size))
+      throw std::runtime_error("index out of range");
+
+    // If a negative index is provided swap it
+    if (index < 0)
+      index += vector_size;
+
+    return index;
+  }
+
+protected:
+
+  std::size_t _index_size;
+  dolfin::la_index* _indices;
+  dolfin::la_index* _range;
+
+};
+
+class SliceIndices : public Indices
+  /// SliceIndices provides a c++ wrapper class for a Python slice
+{
+public:
+
+  // Constructor
+  SliceIndices(PyObject* op, std::size_t vector_size ):
+    Indices(), _start(0), _step(0)
+  {
+    if (op == Py_None or !PySlice_Check(op) )
+      throw std::runtime_error("expected slice");
+    Py_ssize_t stop, start, step, index_size;
+
+    if (PySlice_GetIndicesEx((PySliceObject*)op, vector_size, &start, &stop, &step, &index_size) < 0)
+      throw std::runtime_error("invalid slice");
+    _step  = step;
+    _start = start;
+    _index_size = index_size;
+  }
+
+  // Destructor
+  virtual ~SliceIndices() {}
+
+  // Returns the ith index, raises RuntimeError if i is out of range
+  virtual std::size_t index(std::size_t i ) {
+    if ( i >= size() )
+      throw std::runtime_error("index out of range");
+    return _start + i*_step;
+  }
+
+private:
+
+  std::size_t _start, _step;
+};
+
+class ListIndices : public Indices
+  /// ListIndices provides a c++ wrapper class for a Python List of integer,
+  /// which is ment to hold indices to a Vector
+{
+public:
+
+  // Constructor
+  ListIndices( PyObject* op, unsigned int vector_size )
+    :Indices(), _list(NULL), _vector_size(vector_size)
+  {
+    if ( op == Py_None or !PyList_Check(op) )
+      // FIXME: Is it OK, to throw exception in constructor?
+      throw std::runtime_error("expected list");
+
+    // Set protected member
+    _index_size = PyList_Size(op);
+    if ( _index_size > vector_size)
+      throw std::runtime_error("index list too large");
+
+    // Set members
+    _vector_size = vector_size;
+    _list = op;
+
+    // Increase reference to list
+    Py_INCREF(_list);
+  }
+
+  // Destructor
+  virtual ~ListIndices()
+  { Py_DECREF(_list); }
+
+  // Returns the ith index, raises RuntimeError if i is out of range
+  virtual std::size_t index(std::size_t i)
+  {
+    PyObject* op = NULL;
+
+    // Check size of passed index
+    if (i >= size())
+      throw std::runtime_error("index out of range");
+
+    // Get the index
+    if (!(op=PyList_GetItem(_list, i)))
+      throw std::runtime_error("invalid index");
+
+    int index;
+    // FIXME: Add a Py_convert_dolfin_la_index
+    if(!Py_convert_int(op, index))
+      throw std::runtime_error("index must be either an integer, a slice, a list or a Numpy array of integer");
+
+    // Return checked index
+    return check_index(index);
+  }
+
+  // Check bounds of index by calling static function in base class
+  std::size_t check_index(int index)
+  { return Indices::check_index(index, _vector_size); }
+
+private:
+  PyObject* _list;
+  std::size_t _vector_size;
+};
+
+
+class IntArrayIndices : public Indices
+  /// IntArrayIndices provides a c++ wrapper class for a NumPy array of integer,
+  /// which is ment to hold indices to a Vector
+{
+public:
+
+  // Constructor
+  IntArrayIndices(PyObject* op, std::size_t vector_size)
+    :Indices(), _numpy_array(NULL), _vector_size(vector_size)
+  {
+    if ( op == Py_None || !PyArray_Check(op))
+      throw std::runtime_error("expected numpy array of integers");
+
+    PyArrayObject* array_op = reinterpret_cast<PyArrayObject*>(op);
+    if (!PyTypeNum_ISINTEGER(PyArray_TYPE(array_op)))
+      throw std::runtime_error("expected numpy array of integers");
+
+    // An initial check of the length of the array
+    if (PyArray_NDIM(array_op)!=1)
+      throw std::runtime_error("provide an 1D array");
+    _index_size = PyArray_DIM(array_op, 0);
+
+    if (_index_size > vector_size)
+      throw std::runtime_error("index array too large");
+
+    // Set members
+    _numpy_array = reinterpret_cast<PyObject*>(array_op);
+    _vector_size = vector_size;
+
+    // Increase reference to numpy array
+    Py_INCREF(_numpy_array);
+  }
+
+  // Destructor
+  virtual ~IntArrayIndices()
+  { Py_DECREF(_numpy_array); }
+
+  // Returns the ith index, raises RuntimeError if i is out of range
+  virtual std::size_t index(std::size_t i)
+  {
+    // Check size of passed index
+    if (i >= size())
+      throw std::runtime_error("index out of range");
+
+    // Return checked index
+    return check_index(*static_cast<int*>(PyArray_GETPTR1(\
+		      reinterpret_cast<PyArrayObject*>(_numpy_array), i)));
+  }
+
+  // Check bounds of index by calling static function in base class
+  std::size_t check_index(int index)
+  { return Indices::check_index(index, _vector_size); }
+
+private:
+  PyObject* _numpy_array;
+  std::size_t _vector_size;
+};
+
+class BoolArrayIndices : public Indices
+  /// BoolArrayIndices provides a c++ wrapper class for a NumPy array of bool,
+  /// which is ment to hold indices to a Vector
+{
+public:
+
+  // Constructor
+  BoolArrayIndices(PyObject* op, std::size_t vector_size) : Indices()
+  {
+    std::size_t i, nz_ind;
+    npy_bool* bool_data;
+    PyArrayObject* npy_op;
+    PyObject* sum_res;
+
+    if (op == Py_None or !PyArray_Check(op))
+      throw std::runtime_error("expected numpy array of boolean");
+
+    npy_op = reinterpret_cast<PyArrayObject*>(op);
+
+    if (!PyArray_ISBOOL(npy_op))
+      throw std::runtime_error("expected numpy array of boolean");
+
+    // An initial check of the length of the array
+    if (PyArray_NDIM(npy_op)!=1)
+      throw std::runtime_error("provide an 1D array");
+
+    if (static_cast<std::size_t>(PyArray_DIM(npy_op, 0)) != vector_size)
+      throw std::runtime_error("non matching dimensions");
+
+    bool_data = static_cast<npy_bool *>(PyArray_DATA(npy_op));
+
+    // Sum the array to get the numbers of indices
+    sum_res = PyArray_Sum(npy_op, 0, NPY_INT, reinterpret_cast<PyArrayObject*>(Py_None));
+    _index_size = PyInt_AsLong(sum_res);
+    Py_DECREF(sum_res);
+
+    // Construct the array and fill it with indices
+    _indices = new dolfin::la_index[_index_size];
+
+    nz_ind = 0;
+    for (i = 0; i < vector_size; i++)
+    {
+      if (bool_data[i] > 0)
+      {
+        _indices[nz_ind] = i;
+        nz_ind++;
+      }
+    }
+  }
+
+  // Destructor
+  virtual ~BoolArrayIndices() {}
+
+  // Returns the ith index, raises RuntimeError if i is out of range
+  virtual std::size_t index(std::size_t i)
+  {
+    // Check size of passed index
+    if (i >= size())
+      throw std::runtime_error("index out of range");
+
+    // Return index
+    return _indices[i];
+  }
+
+};
+
+
+// Return a new Indice object correspondning to the input
+Indices* indice_chooser(PyObject* op, std::size_t vector_size)
+{
+  //Check first for None
+  if (op == Py_None)
+    return 0;
+  //  throw std::runtime_error("index must be either a slice, a list or a Numpy array of integer");
+
+  // The indices
+  Indices *inds;
+
+  // If the provided indices are in a slice
+  if (PySlice_Check(op))
+    inds = new SliceIndices( op, vector_size );
+
+  // If the provided indices are in a List
+  else if (PyList_Check(op))
+    inds = new ListIndices( op, vector_size );
+
+  // If the provided indices are in a Numpy array of boolean
+  else if (PyArray_Check(op) and PyArray_TYPE(reinterpret_cast<PyArrayObject*>(op)) == NPY_BOOL)
+    inds = new BoolArrayIndices( op, vector_size );
+
+  // If the provided indices are in a Numpy array of integers
+  else if (PyArray_Check(op) and PyArray_ISINTEGER(reinterpret_cast<PyArrayObject*>(op)))
+    inds = new IntArrayIndices( op, vector_size );
+  else
+    return 0;
+  //throw std::runtime_error("index must be either a slice, a list or a Numpy array of integer");
+
+  return inds;
+}
diff --git a/dolfin/swig/la/docstrings.i b/dolfin/swig/la/docstrings.i
new file mode 100644
index 0000000..3a998d8
--- /dev/null
+++ b/dolfin/swig/la/docstrings.i
@@ -0,0 +1,4617 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=la, header=ublas.h)
+// Documentation extracted from: (module=la, header=LinearAlgebraObject.h)
+%feature("docstring")  dolfin::LinearAlgebraObject "
+This is a common base class for all DOLFIN linear algebra
+objects. In particular, it provides casting mechanisms between
+different types.
+";
+
+%feature("docstring")  dolfin::LinearAlgebraObject::down_cast "
+**Overloaded versions**
+
+* down_cast\ ()
+
+  Cast object to its derived class, if possible (const version).
+  An error is thrown if the cast is unsuccessful.
+
+* down_cast\ ()
+
+  Cast object to its derived class, if possible (non-const version).
+  An error is thrown if the cast is unsuccessful.
+
+* down_cast\ (A)
+
+  Cast shared pointer object to its derived class, if possible.
+  Caller must check for success (returns null if cast fails).
+";
+
+%feature("docstring")  dolfin::LinearAlgebraObject::instance "
+**Overloaded versions**
+
+* instance\ ()
+
+  Return concrete instance / unwrap (const version)
+
+* instance\ ()
+
+  Return concrete instance / unwrap (non-const version)
+";
+
+%feature("docstring")  dolfin::LinearAlgebraObject::shared_instance "
+**Overloaded versions**
+
+* shared_instance\ ()
+
+  Return concrete shared ptr instance / unwrap (const version)
+
+* shared_instance\ ()
+
+  Return concrete shared ptr instance / unwrap (non-const version)
+";
+
+%feature("docstring")  dolfin::LinearAlgebraObject::as_type "
+**Overloaded versions**
+
+* as_type\ (x)
+
+  Cast object to its derived class, if possible (non-const version).
+  An error is thrown if the cast is unsuccessful.
+
+* as_type\ (x)
+
+  Cast shared pointer object to its derived class, if possible.
+  Caller must check for success (returns null if cast fails).
+";
+
+%feature("docstring")  dolfin::LinearAlgebraObject::has_type "
+Check whether the object matches a specific type
+";
+
+// Documentation extracted from: (module=la, header=GenericLinearOperator.h)
+%feature("docstring")  dolfin::GenericLinearOperator "
+This class defines a common interface for linear operators,
+including actual matrices (class :py:class:`GenericMatrix`) and linear
+operators only defined in terms of their action on vectors.
+
+This class is used internally by DOLFIN to define a class
+hierarchy of backend independent linear operators and solvers.
+Users should not interface to this class directly but instead
+use the :py:class:`LinearOperator` class.
+";
+
+%feature("docstring")  dolfin::GenericLinearOperator::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::GenericLinearOperator::mult "
+Compute matrix-vector product y = Ax
+";
+
+%feature("docstring")  dolfin::GenericLinearOperator::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=la, header=GenericTensor.h)
+%feature("docstring")  dolfin::GenericTensor "
+This class defines a common interface for arbitrary rank tensors.
+";
+
+%feature("docstring")  dolfin::GenericTensor::init "
+Initialize zero tensor using tensor layout
+";
+
+%feature("docstring")  dolfin::GenericTensor::empty "
+Return true if empty
+";
+
+%feature("docstring")  dolfin::GenericTensor::rank "
+Return tensor rank (number of dimensions)
+";
+
+%feature("docstring")  dolfin::GenericTensor::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::GenericTensor::local_range "
+Return local ownership range
+";
+
+%feature("docstring")  dolfin::GenericTensor::get "
+Get block of values
+";
+
+%feature("docstring")  dolfin::GenericTensor::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::GenericTensor::add "
+**Overloaded versions**
+
+* add\ (block, rows)
+
+  Add block of values
+
+* add\ (block, rows)
+
+  Add block of values
+
+* add\ (block, num_rows, rows)
+
+  Add block of values
+";
+
+%feature("docstring")  dolfin::GenericTensor::zero "
+Set all entries to zero and keep any sparse structure
+";
+
+%feature("docstring")  dolfin::GenericTensor::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::GenericTensor::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::GenericTensor::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::GenericTensor::factory "
+Return linear algebra backend factory
+";
+
+// Documentation extracted from: (module=la, header=GenericMatrix.h)
+%feature("docstring")  dolfin::GenericMatrix "
+This class defines a common interface for matrices.
+";
+
+%feature("docstring")  dolfin::GenericMatrix::rank "
+Return tensor rank (number of dimensions)
+";
+
+%feature("docstring")  dolfin::GenericMatrix::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::GenericMatrix::local_range "
+Return local ownership range
+";
+
+%feature("docstring")  dolfin::GenericMatrix::get "
+**Overloaded versions**
+
+* get\ (block, num_rows, rows)
+
+  Get block of values
+
+* get\ (block, m, rows, n, cols)
+
+  Get block of values
+";
+
+%feature("docstring")  dolfin::GenericMatrix::set "
+**Overloaded versions**
+
+* set\ (block, num_rows, rows)
+
+  Set block of values
+
+* set\ (block, m, rows, n, cols)
+
+  Set block of values
+";
+
+%feature("docstring")  dolfin::GenericMatrix::add "
+**Overloaded versions**
+
+* add\ (block, num_rows, rows)
+
+  Add block of values
+
+* add\ (block, rows)
+
+  Add block of values
+
+* add\ (block, rows)
+
+  Add block of values
+
+* add\ (block, m, rows, n, cols)
+
+  Add block of values
+";
+
+%feature("docstring")  dolfin::GenericMatrix::zero "
+**Overloaded versions**
+
+* zero\ ()
+
+  Set all entries to zero and keep any sparse structure
+
+* zero\ (m, rows)
+
+  Set given rows to zero
+";
+
+%feature("docstring")  dolfin::GenericMatrix::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::GenericMatrix::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::GenericMatrix::copy "
+Return copy of matrix
+";
+
+%feature("docstring")  dolfin::GenericMatrix::init_vector "
+Initialize vector z to be compatible with the matrix-vector
+product y = Ax. In the parallel case, both size and layout are
+important.
+
+*Arguments*
+    dim (int)
+        The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+";
+
+%feature("docstring")  dolfin::GenericMatrix::axpy "
+Add multiple of given matrix (AXPY operation)
+";
+
+%feature("docstring")  dolfin::GenericMatrix::norm "
+Return norm of matrix
+";
+
+%feature("docstring")  dolfin::GenericMatrix::getrow "
+Get non-zero values of given row on local process
+";
+
+%feature("docstring")  dolfin::GenericMatrix::setrow "
+Set values for given row on local process
+";
+
+%feature("docstring")  dolfin::GenericMatrix::ident "
+Set given rows to identity matrix
+";
+
+%feature("docstring")  dolfin::GenericMatrix::transpmult "
+Matrix-vector product, y = A^T x. The y vector must either be
+zero-sized or have correct size and parallel layout.
+";
+
+%feature("docstring")  dolfin::GenericMatrix::set_diagonal "
+Set diagonal of a matrix
+";
+
+%feature("docstring")  dolfin::GenericMatrix::operator*= "
+Multiply matrix by given number
+";
+
+%feature("docstring")  dolfin::GenericMatrix::operator/= "
+Divide matrix by given number
+";
+
+%feature("docstring")  dolfin::GenericMatrix::operator+= "
+Add given matrix
+";
+
+%feature("docstring")  dolfin::GenericMatrix::operator-= "
+Subtract given matrix
+";
+
+%feature("docstring")  dolfin::GenericMatrix::is_symmetric "
+Test if matrix is symmetric
+";
+
+%feature("docstring")  dolfin::GenericMatrix::operator= "
+Assignment operator
+";
+
+%feature("docstring")  dolfin::GenericMatrix::data "
+Return pointers to underlying compresssed row/column storage data
+For compressed row storage, data = (row_pointer[#rows +1],
+column_index[#nz], matrix_values[#nz], nz)
+";
+
+%feature("docstring")  dolfin::GenericMatrix::operator "
+Get value of given entry
+";
+
+%feature("docstring")  dolfin::GenericMatrix::getitem "
+Get value of given entry
+";
+
+%feature("docstring")  dolfin::GenericMatrix::setitem "
+Set given entry to value. apply(\"insert\") must be called
+before using using the object.
+";
+
+%feature("docstring")  dolfin::GenericMatrix::ident_zeros "
+Insert one on the diagonal for all zero rows
+";
+
+%feature("docstring")  dolfin::GenericMatrix::compressed "
+Build compressed version of matrix (zeros removed)
+";
+
+// Documentation extracted from: (module=la, header=GenericSparsityPattern.h)
+%feature("docstring")  dolfin::GenericSparsityPattern "
+Base class (interface) for generic tensor sparsity patterns.
+Currently, this interface is mostly limited to matrices.
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::GenericSparsityPattern "
+Create empty sparsity pattern
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::init "
+Initialize sparsity pattern for a generic tensor
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::insert "
+Insert non-zero entries
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::add_edges "
+Add edges (vertex = [index, owning process])
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::rank "
+Return rank
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::primary_dim "
+Return primary dimension (e.g., 0=row partition, 1=column partition)
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::local_range "
+Return local range for dimension dim
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::num_nonzeros "
+Return total number of nonzeros in local_range
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::num_nonzeros_diagonal "
+Fill vector with number of nonzeros for diagonal block in
+local_range for primary dimemsion
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::num_nonzeros_off_diagonal "
+Fill vector with number of nonzeros for off-diagonal block in
+local_range for primary dimemsion
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::num_local_nonzeros "
+Fill vector with number of nonzeros in local_range for
+primary dimemsion
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::diagonal_pattern "
+Return underlying sparsity pattern (diagonal). Options are
+'sorted' and 'unsorted'.
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::off_diagonal_pattern "
+Return underlying sparsity pattern (off-diagional). Options are
+'sorted' and 'unsorted'.
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::get_edges "
+Fill vector with edges for given vertex
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::apply "
+Finalize sparsity pattern
+";
+
+%feature("docstring")  dolfin::GenericSparsityPattern::mpi_comm "
+Return MPI communicator
+";
+
+// Documentation extracted from: (module=la, header=GenericVector.h)
+%feature("docstring")  dolfin::GenericVector "
+This class defines a common interface for vectors.
+";
+
+%feature("docstring")  dolfin::GenericVector::init "
+**Overloaded versions**
+
+* init\ (tensor_layout)
+
+  Initialize zero tensor using sparsity pattern
+
+* init\ (comm, N)
+
+  Initialize vector to global size N
+
+* init\ (comm, range)
+
+  Intitialize vector with given local ownership range
+
+* init\ (comm, range, ghost_indices)
+
+  Initialise vector with given ownership range and with ghost
+  values
+";
+
+%feature("docstring")  dolfin::GenericVector::rank "
+Return tensor rank (number of dimensions)
+";
+
+%feature("docstring")  dolfin::GenericVector::size "
+**Overloaded versions**
+
+* size\ (dim)
+
+  Return size of given dimension
+
+* size\ ()
+
+  Return global size of vector
+";
+
+%feature("docstring")  dolfin::GenericVector::local_range "
+**Overloaded versions**
+
+* local_range\ (dim)
+
+  Return local ownership range
+
+* local_range\ ()
+
+  Return local ownership range of a vector
+";
+
+%feature("docstring")  dolfin::GenericVector::get "
+Get block of values
+";
+
+%feature("docstring")  dolfin::GenericVector::set "
+**Overloaded versions**
+
+* set\ (block, num_rows, rows)
+
+  Set block of values
+
+* set\ (block, m, rows)
+
+  Set block of values
+";
+
+%feature("docstring")  dolfin::GenericVector::add "
+**Overloaded versions**
+
+* add\ (block, num_rows, rows)
+
+  Add block of values
+
+* add\ (block, rows)
+
+  Add block of values
+
+* add\ (block, rows)
+
+  Add block of values
+
+* add\ (block, m, rows)
+
+  Add block of values
+";
+
+%feature("docstring")  dolfin::GenericVector::zero "
+Set all entries to zero and keep any sparse structure
+";
+
+%feature("docstring")  dolfin::GenericVector::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::GenericVector::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::GenericVector::copy "
+Return copy of vector
+";
+
+%feature("docstring")  dolfin::GenericVector::resize "
+**Overloaded versions**
+
+* resize\ (comm, N)
+
+  Deprecated: resize vector to global size N
+
+* resize\ (comm, range)
+
+  Deprecated: resize vector with given ownership range
+
+* resize\ (comm, range, ghost_indices)
+
+  Deprevated: resize vector with given ownership range and with
+  ghost values
+";
+
+%feature("docstring")  dolfin::GenericVector::local_size "
+Return local size of vector
+";
+
+%feature("docstring")  dolfin::GenericVector::owns_index "
+Determine whether global vector index is owned by this process
+";
+
+%feature("docstring")  dolfin::GenericVector::get_local "
+**Overloaded versions**
+
+* get_local\ (block, m, rows)
+
+  Get block of values (values must all live on the local process)
+
+* get_local\ (values)
+
+  Get all values on local process
+";
+
+%feature("docstring")  dolfin::GenericVector::set_local "
+Set all values on local process
+";
+
+%feature("docstring")  dolfin::GenericVector::add_local "
+Add values to each entry on local process
+";
+
+%feature("docstring")  dolfin::GenericVector::gather "
+**Overloaded versions**
+
+* gather\ (x, indices)
+
+  Gather entries into local vector x
+
+* gather\ (x, indices)
+
+  Gather entries into x
+";
+
+%feature("docstring")  dolfin::GenericVector::gather_on_zero "
+Gather all entries into x on process 0
+";
+
+%feature("docstring")  dolfin::GenericVector::axpy "
+Add multiple of given vector (AXPY operation)
+";
+
+%feature("docstring")  dolfin::GenericVector::abs "
+Replace all entries in the vector by their absolute values
+";
+
+%feature("docstring")  dolfin::GenericVector::inner "
+Return inner product with given vector
+";
+
+%feature("docstring")  dolfin::GenericVector::norm "
+Return norm of vector
+";
+
+%feature("docstring")  dolfin::GenericVector::min "
+Return minimum value of vector
+";
+
+%feature("docstring")  dolfin::GenericVector::max "
+Return maximum value of vector
+";
+
+%feature("docstring")  dolfin::GenericVector::sum "
+**Overloaded versions**
+
+* sum\ ()
+
+  Return sum of vector
+
+* sum\ (rows)
+
+  Return sum of selected rows in vector. Repeated entries are
+  only summed once.
+";
+
+%feature("docstring")  dolfin::GenericVector::operator*= "
+**Overloaded versions**
+
+* operator*=\ (a)
+
+  Multiply vector by given number
+
+* operator*=\ (x)
+
+  Multiply vector by another vector pointwise
+";
+
+%feature("docstring")  dolfin::GenericVector::operator/= "
+Divide vector by given number
+";
+
+%feature("docstring")  dolfin::GenericVector::operator+= "
+**Overloaded versions**
+
+* operator+=\ (x)
+
+  Add given vector
+
+* operator+=\ (a)
+
+  Add number to all components of a vector
+";
+
+%feature("docstring")  dolfin::GenericVector::operator-= "
+**Overloaded versions**
+
+* operator-=\ (x)
+
+  Subtract given vector
+
+* operator-=\ (a)
+
+  Subtract number from all components of a vector
+";
+
+%feature("docstring")  dolfin::GenericVector::operator= "
+**Overloaded versions**
+
+* operator=\ (x)
+
+  Assignment operator
+
+* operator=\ (a)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::GenericVector::data "
+**Overloaded versions**
+
+* data\ ()
+
+  Return pointer to underlying data (const version)
+
+* data\ ()
+
+  Return pointer to underlying data
+";
+
+%feature("docstring")  dolfin::GenericVector::operator[] "
+Get value of given entry
+";
+
+%feature("docstring")  dolfin::GenericVector::getitem "
+Get value of given entry
+";
+
+%feature("docstring")  dolfin::GenericVector::setitem "
+Set given entry to value. apply(\"insert\") should be called
+before using using the object.
+";
+
+// Documentation extracted from: (module=la, header=VectorSpaceBasis.h)
+%feature("docstring")  dolfin::VectorSpaceBasis "
+This class defines a basis for vector spaces,
+typically used for expressing nullspaces, transpose nullspaces
+and near nullspaces of singular operators
+";
+
+%feature("docstring")  dolfin::VectorSpaceBasis::VectorSpaceBasis "
+Constructor
+";
+
+%feature("docstring")  dolfin::VectorSpaceBasis::is_orthonormal "
+Test if basis is orthonormal
+";
+
+%feature("docstring")  dolfin::VectorSpaceBasis::is_orthogonal "
+Test if basis is orthogonal
+";
+
+%feature("docstring")  dolfin::VectorSpaceBasis::orthogonalize "
+Orthogonalize x with respect to basis
+";
+
+%feature("docstring")  dolfin::VectorSpaceBasis::dim "
+Dimension of the basis
+";
+
+%feature("docstring")  dolfin::VectorSpaceBasis::operator[] "
+Get a particular basis vector
+";
+
+// Documentation extracted from: (module=la, header=GenericLinearSolver.h)
+%feature("docstring")  dolfin::GenericLinearSolver "
+This class provides a general solver for linear systems Ax = b.
+";
+
+%feature("docstring")  dolfin::GenericLinearSolver::set_operator "
+Set operator (matrix)
+";
+
+%feature("docstring")  dolfin::GenericLinearSolver::set_operators "
+Set operator (matrix) and preconditioner matrix
+";
+
+%feature("docstring")  dolfin::GenericLinearSolver::set_nullspace "
+Set null space of the operator (matrix). This is used to solve
+singular systems
+";
+
+%feature("docstring")  dolfin::GenericLinearSolver::solve "
+**Overloaded versions**
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b
+";
+
+%feature("docstring")  dolfin::GenericLinearSolver::solve_transpose "
+**Overloaded versions**
+
+* solve_transpose\ (A, x, b)
+
+  Solve linear system A^Tx = b
+
+* solve_transpose\ (x, b)
+
+  Solve linear system A^Tx = b
+";
+
+%feature("docstring")  dolfin::GenericLinearSolver::parameter_type "
+Return parameter type: \"krylov_solver\" or \"lu_solver\"
+";
+
+%feature("docstring")  dolfin::GenericLinearSolver::update_parameters "
+Update solver parameters (useful for LinearSolver wrapper)
+";
+
+// Documentation extracted from: (module=la, header=GenericLUSolver.h)
+%feature("docstring")  dolfin::GenericLUSolver "
+This a base class for LU solvers
+";
+
+%feature("docstring")  dolfin::GenericLUSolver::set_operator "
+Set operator (matrix)
+";
+
+%feature("docstring")  dolfin::GenericLUSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b
+";
+
+%feature("docstring")  dolfin::GenericLUSolver::solve_transpose "
+**Overloaded versions**
+
+* solve_transpose\ (x, b)
+
+  Solve linear system A^Tx = b
+
+* solve_transpose\ (A, x, b)
+
+  Solve linear system A^Tx = b
+";
+
+// Documentation extracted from: (module=la, header=GenericPreconditioner.h)
+%feature("docstring")  dolfin::GenericPreconditioner "
+This class provides a common base preconditioners.
+";
+
+%feature("docstring")  dolfin::GenericPreconditioner::set_nullspace "
+Set the (approximate) null space of the preconditioner operator
+(matrix). This is required for certain preconditioner types,
+e.g. smoothed aggregation multigrid
+";
+
+%feature("docstring")  dolfin::GenericPreconditioner::set_coordinates "
+Set the coordinates of the operator (matrix) rows and geometric
+dimension d. This is can be used by required for certain
+preconditioners, e.g. ML. The input for this function can be
+generated using GenericDofMap::tabulate_all_dofs.
+";
+
+// Documentation extracted from: (module=la, header=PETScOptions.h)
+%feature("docstring")  dolfin::PETScOptions "
+These class provides static functions that permit users to set
+and retreive PETSc options via the PETSc option/parameter
+system. The option should be prefixed by '-', e.g.
+
+    PETScOptions::set(\"mat_mumps_icntl_14\", 40.0);
+";
+
+%feature("docstring")  dolfin::PETScOptions::set "
+**Overloaded versions**
+
+* set\ (option)
+
+  Set PETSc option that takes no value
+
+* set\ (option, value)
+
+  Set PETSc boolean option
+
+* set\ (option, value)
+
+  Set PETSc integer option
+
+* set\ (option, value)
+
+  Set PETSc double option
+
+* set\ (option, value)
+
+  Set PETSc string option
+
+* set\ (option, value)
+
+  Genetic function for setting PETSc option
+";
+
+%feature("docstring")  dolfin::PETScOptions::clear "
+Clear PETSc option
+";
+
+// Documentation extracted from: (module=la, header=PETScObject.h)
+%feature("docstring")  dolfin::PETScObject "
+This class calls SubSystemsManager to initialise PETSc.
+
+All PETSc objects must be derived from this class.
+";
+
+%feature("docstring")  dolfin::PETScObject::PETScObject "
+Constructor. Ensures that PETSc has been initialised.
+";
+
+%feature("docstring")  dolfin::PETScObject::petsc_error "
+Print error message for PETSc calls that return an error
+";
+
+// Documentation extracted from: (module=la, header=PETScBaseMatrix.h)
+%feature("docstring")  dolfin::PETScBaseMatrix "
+This class is a base class for matrices that can be used in
+PETScKrylovSolver.
+";
+
+%feature("docstring")  dolfin::PETScBaseMatrix::PETScBaseMatrix "
+**Overloaded versions**
+
+* PETScBaseMatrix\ ()
+
+  Constructor
+
+* PETScBaseMatrix\ (A)
+
+  Constructor
+
+* PETScBaseMatrix\ (A)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::PETScBaseMatrix::size "
+Return number of rows (dim = 0) or columns (dim = 1)
+";
+
+%feature("docstring")  dolfin::PETScBaseMatrix::local_range "
+Return local range along dimension dim
+";
+
+%feature("docstring")  dolfin::PETScBaseMatrix::init_vector "
+Initialize vector to be compatible with the matrix-vector product
+y = Ax. In the parallel case, both size and layout are
+important.
+
+*Arguments*
+    dim (int)
+        The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+";
+
+%feature("docstring")  dolfin::PETScBaseMatrix::mat "
+Return PETSc Mat pointer
+";
+
+%feature("docstring")  dolfin::PETScBaseMatrix::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=la, header=uBLASFactory.h)
+%feature("docstring")  dolfin::uBLASFactory::create_matrix "
+Create empty matrix
+";
+
+%feature("docstring")  dolfin::uBLASFactory::create_vector "
+Create empty vector
+";
+
+%feature("docstring")  dolfin::uBLASFactory::create_layout "
+Create empty tensor layout
+";
+
+%feature("docstring")  dolfin::uBLASFactory::create_linear_operator "
+Create empty linear operator
+";
+
+%feature("docstring")  dolfin::uBLASFactory::create_lu_solver "
+Create LU solver
+";
+
+%feature("docstring")  dolfin::uBLASFactory::create_krylov_solver "
+Create Krylov solver
+";
+
+%feature("docstring")  dolfin::uBLASFactory::lu_solver_methods "
+Return a list of available LU solver methods
+";
+
+%feature("docstring")  dolfin::uBLASFactory::krylov_solver_methods "
+Return a list of available Krylov solver methods
+";
+
+%feature("docstring")  dolfin::uBLASFactory::krylov_solver_preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::uBLASFactory::instance "
+Return singleton instance
+";
+
+// Documentation extracted from: (module=la, header=uBLASMatrix.h)
+%feature("docstring")  dolfin::uBLASMatrix "
+This class provides a simple matrix class based on uBLAS.
+It is a simple wrapper for a uBLAS matrix implementing the
+GenericMatrix interface.
+
+The interface is intentionally simple. For advanced usage,
+access the underlying uBLAS matrix and use the standard
+uBLAS interface which is documented at
+http://www.boost.org/libs/numeric/ublas/doc/index.htm.
+
+Developer note: specialised member functions must be
+inlined to avoid link errors.
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::uBLASMatrix "
+**Overloaded versions**
+
+* uBLASMatrix\ ()
+
+  Create empty matrix
+
+* uBLASMatrix\ (M, N)
+
+  Create M x N matrix
+
+* uBLASMatrix\ (A)
+
+  Copy constructor
+
+* uBLASMatrix\ (A)
+
+  Create matrix from given uBLAS matrix expression
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::init "
+Initialize zero tensor using tenor layout
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::empty "
+Return true if empty
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::local_range "
+Return local ownership range
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::zero "
+**Overloaded versions**
+
+* zero\ ()
+
+  Set all entries to zero and keep any sparse structure
+
+* zero\ (m, rows)
+
+  Set given rows to zero
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::copy "
+Return copy of matrix
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::resize "
+Resize matrix to M x N
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::init_vector "
+Intialixe vector z to be compatible with the matrix-vector product
+y = Ax. In the parallel case, both size and layout are
+important.
+
+*Arguments*
+    dim (int)
+        The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::get "
+Get block of values
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::axpy "
+Add multiple of given matrix (AXPY operation)
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::norm "
+Return norm of matrix
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::getrow "
+Get non-zero values of given row
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::setrow "
+Set values for given row
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::ident "
+Set given rows to identity matrix
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::mult "
+Matrix-vector product, y = Ax
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::transpmult "
+Matrix-vector product, y = A^T x
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::set_diagonal "
+Set diagonal of a matrix
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::operator*= "
+Multiply matrix by given number
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::operator/= "
+Divide matrix by given number
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::operator= "
+**Overloaded versions**
+
+* operator=\ (A)
+
+  Assignment operator
+
+* operator=\ (A)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::data "
+Return pointers to underlying compresssed storage data
+See GenericMatrix for documentation.
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::factory "
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::mat "
+**Overloaded versions**
+
+* mat\ ()
+
+  Return reference to uBLAS matrix (const version)
+
+* mat\ ()
+
+  Return reference to uBLAS matrix (non-const version)
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::solve "
+Solve Ax = b out-of-place using uBLAS (A is not destroyed)
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::solve_in_place "
+Solve Ax = b in-place using uBLAS(A is destroyed)
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::invert "
+Compute inverse of matrix
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::lump "
+Lump matrix into vector m
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::compress "
+Compress matrix (eliminate all non-zeros from a sparse matrix)
+";
+
+%feature("docstring")  dolfin::uBLASMatrix::operator "
+Access value of given entry
+";
+
+// Documentation extracted from: (module=la, header=uBLASLinearOperator.h)
+%feature("docstring")  dolfin::uBLASLinearOperator::uBLASLinearOperator "
+Constructor
+";
+
+%feature("docstring")  dolfin::uBLASLinearOperator::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::uBLASLinearOperator::mult "
+Compute matrix-vector product y = Ax
+";
+
+%feature("docstring")  dolfin::uBLASLinearOperator::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=la, header=PETScMatrix.h)
+%feature("docstring")  dolfin::PETScMatrix "
+This class provides a simple matrix class based on PETSc.
+It is a wrapper for a PETSc matrix pointer (Mat)
+implementing the GenericMatrix interface.
+
+The interface is intentionally simple. For advanced usage,
+access the PETSc Mat pointer using the function mat() and
+use the standard PETSc interface.
+";
+
+%feature("docstring")  dolfin::PETScMatrix::PETScMatrix "
+**Overloaded versions**
+
+* PETScMatrix\ (use_gpu=false)
+
+  Create empty matrix
+
+* PETScMatrix\ (A)
+
+  Create a wrapper around a PETSc Mat pointer
+
+* PETScMatrix\ (A)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::PETScMatrix::init "
+Initialize zero tensor using tensor layout
+";
+
+%feature("docstring")  dolfin::PETScMatrix::empty "
+Return true if empty
+";
+
+%feature("docstring")  dolfin::PETScMatrix::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::PETScMatrix::local_range "
+Return local ownership range
+";
+
+%feature("docstring")  dolfin::PETScMatrix::zero "
+**Overloaded versions**
+
+* zero\ ()
+
+  Set all entries to zero and keep any sparse structure
+
+* zero\ (m, rows)
+
+  Set given rows to zero
+";
+
+%feature("docstring")  dolfin::PETScMatrix::apply "
+Finalize assembly of tensor. The following values are recognized
+for the mode parameter:
+
+  add    - corresponds to PETSc MatAssemblyBegin+End(MAT_FINAL_ASSEMBLY)
+  insert - corresponds to PETSc MatAssemblyBegin+End(MAT_FINAL_ASSEMBLY)
+  flush  - corresponds to PETSc MatAssemblyBegin+End(MAT_FLUSH_ASSEMBLY)
+";
+
+%feature("docstring")  dolfin::PETScMatrix::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::PETScMatrix::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::PETScMatrix::copy "
+Return copy of matrix
+";
+
+%feature("docstring")  dolfin::PETScMatrix::init_vector "
+Intialize vector z to be compatible with the matrix-vector product
+y = Ax. In the parallel case, both size and layout are
+important.
+
+*Arguments*
+    dim (int)
+        The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+";
+
+%feature("docstring")  dolfin::PETScMatrix::get "
+Get block of values
+";
+
+%feature("docstring")  dolfin::PETScMatrix::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::PETScMatrix::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::PETScMatrix::axpy "
+Add multiple of given matrix (AXPY operation)
+";
+
+%feature("docstring")  dolfin::PETScMatrix::getrow "
+Get non-zero values of given row
+";
+
+%feature("docstring")  dolfin::PETScMatrix::setrow "
+Set values for given row
+";
+
+%feature("docstring")  dolfin::PETScMatrix::ident "
+Set given rows to identity matrix
+";
+
+%feature("docstring")  dolfin::PETScMatrix::set_diagonal "
+Set diagonal of a matrix
+";
+
+%feature("docstring")  dolfin::PETScMatrix::operator*= "
+Multiply matrix by given number
+";
+
+%feature("docstring")  dolfin::PETScMatrix::operator/= "
+Divide matrix by given number
+";
+
+%feature("docstring")  dolfin::PETScMatrix::operator= "
+**Overloaded versions**
+
+* operator=\ (A)
+
+  Assignment operator
+
+* operator=\ (A)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::PETScMatrix::is_symmetric "
+Test if matrix is symmetric
+";
+
+%feature("docstring")  dolfin::PETScMatrix::factory "
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::PETScMatrix::norm "
+Return norm of matrix
+";
+
+%feature("docstring")  dolfin::PETScMatrix::binary_dump "
+Dump matrix to PETSc binary format
+";
+
+// Documentation extracted from: (module=la, header=PETScLinearOperator.h)
+%feature("docstring")  dolfin::PETScLinearOperator::PETScLinearOperator "
+Constructor
+";
+
+%feature("docstring")  dolfin::PETScLinearOperator::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::PETScLinearOperator::mult "
+Compute matrix-vector product y = Ax
+";
+
+%feature("docstring")  dolfin::PETScLinearOperator::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::PETScLinearOperator::wrapper "
+**Overloaded versions**
+
+* wrapper\ ()
+
+  Return pointer to wrapper (const version)
+
+* wrapper\ ()
+
+  Return pointer to wrapper (const version)
+";
+
+// Documentation extracted from: (module=la, header=PETScPreconditioner.h)
+%feature("docstring")  dolfin::PETScPreconditioner "
+This class is a wrapper for configuring PETSc
+preconditioners. It does not own a preconditioner. It can take a
+PETScKrylovSolver and set the preconditioner type and
+parameters.
+";
+
+%feature("docstring")  dolfin::PETScPreconditioner::PETScPreconditioner "
+Create a particular preconditioner object
+";
+
+%feature("docstring")  dolfin::PETScPreconditioner::set "
+Set the precondtioner type and parameters
+";
+
+%feature("docstring")  dolfin::PETScPreconditioner::set_nullspace "
+Set the (near) null space of the preconditioner operator
+(matrix). This is required for certain preconditioner types,
+e.g. smoothed aggregation multigrid
+";
+
+%feature("docstring")  dolfin::PETScPreconditioner::near_nullspace "
+Return the PETSc null space
+";
+
+%feature("docstring")  dolfin::PETScPreconditioner::set_coordinates "
+Set the coordinates of the operator (matrix) rows and
+geometric dimension d. This is can be used by required for
+certain preconditioners, e.g. ML. The input for this function
+can be generated using GenericDofMap::tabulate_all_dofs.
+";
+
+%feature("docstring")  dolfin::PETScPreconditioner::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::PETScPreconditioner::preconditioners "
+Rerturn a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::PETScPreconditioner::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=la, header=EpetraLUSolver.h)
+%feature("docstring")  dolfin::EpetraLUSolver "
+This class implements the direct solution (LU factorization) for
+linear systems of the form Ax = b. It is a wrapper for the LU
+solver of Epetra.
+";
+
+%feature("docstring")  dolfin::EpetraLUSolver::EpetraLUSolver "
+**Overloaded versions**
+
+* EpetraLUSolver\ (method=\"default\")
+
+  Constructor
+
+* EpetraLUSolver\ (A, method=\"default\")
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::EpetraLUSolver::set_operator "
+Set operator (matrix)
+";
+
+%feature("docstring")  dolfin::EpetraLUSolver::get_operator "
+Get operator (matrix)
+";
+
+%feature("docstring")  dolfin::EpetraLUSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b
+";
+
+%feature("docstring")  dolfin::EpetraLUSolver::solve_transpose "
+**Overloaded versions**
+
+* solve_transpose\ (x, b)
+
+  Solve linear system A^Tx = b
+
+* solve_transpose\ (A, x, b)
+
+  Solve linear system A^Tx = b
+
+* solve_transpose\ (A, x, b)
+
+  Solve linear system A^Tx = b
+";
+
+%feature("docstring")  dolfin::EpetraLUSolver::methods "
+Return a list of available solver methods
+";
+
+%feature("docstring")  dolfin::EpetraLUSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::EpetraLUSolver::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=la, header=EpetraKrylovSolver.h)
+%feature("docstring")  dolfin::EpetraKrylovSolver "
+This class implements Krylov methods for linear systems of the
+form Ax = b. It is a wrapper for the Krylov solvers of Epetra.
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::EpetraKrylovSolver "
+**Overloaded versions**
+
+* EpetraKrylovSolver\ (\"default\", \"default\")
+
+  Create Krylov solver for a particular method and
+  preconditioner
+
+* EpetraKrylovSolver\ (method, preconditioner)
+
+  Create Krylov solver for a particular method and
+  TrilinosPreconditioner
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::set_operator "
+Set the operator (matrix)
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::set_operators "
+Set the operator (matrix)
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::get_operator "
+Get the operator (matrix)
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b and return number of iterations
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b and return number of iterations
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b and return number of iterations
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b and return number of iterations
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::residual "
+Return residual from most recent solve
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::methods "
+Return a list of available solver methods
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::EpetraKrylovSolver::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=la, header=EpetraMatrix.h)
+%feature("docstring")  dolfin::EpetraMatrix "
+This class provides a simple matrix class based on Epetra.
+It is a simple wrapper for an Epetra matrix object (Epetra_FECrsMatrix)
+implementing the GenericMatrix interface.
+
+The interface is intentionally simple. For advanced usage,
+access the Epetra_FECrsMatrix object using the function mat() and
+use the standard Epetra interface.
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::EpetraMatrix "
+**Overloaded versions**
+
+* EpetraMatrix\ ()
+
+  Create empty matrix
+
+* EpetraMatrix\ (A)
+
+  Copy constuctor
+
+* EpetraMatrix\ (A)
+
+  Create matrix from given Epetra_FECrsMatrix pointer
+
+* EpetraMatrix\ (A)
+
+  Create matrix from given Epetra_FECrsMatrix pointer
+
+* EpetraMatrix\ (graph)
+
+  Create matrix from given Epetra_CrsGraph
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::init "
+Initialize zero tensor using tensor layout
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::empty "
+Return true if empty
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::local_range "
+Return local ownership range
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::zero "
+**Overloaded versions**
+
+* zero\ ()
+
+  Set all entries to zero and keep any sparse structure
+
+* zero\ (m, rows)
+
+  Set given rows to zero
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::apply "
+Finalize assembly of tensor. The following values are recognized
+for the mode parameter:
+
+  add    - corresponding to Epetra GlobalAssemble(Add)
+  insert - corresponding to Epetra GlobalAssemble(Insert)
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::copy "
+Return copy of matrix
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::init_vector "
+Intialize vector z to be compatible with the matrix-vector
+product y = Ax. In the parallel case, both size and layout are
+important.
+
+*Arguments*
+    dim (int)
+        The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::get "
+Get block of values
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::axpy "
+Add multiple of given matrix (AXPY operation)
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::norm "
+Return norm of matrix
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::getrow "
+Get non-zero values of given row
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::setrow "
+Set values for given row
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::ident "
+Set given rows to identity matrix
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::set_diagonal "
+Set diagonal of a matrix
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::operator*= "
+Multiply matrix by given number
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::operator/= "
+Divide matrix by given number
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::operator= "
+**Overloaded versions**
+
+* operator=\ (x)
+
+  Assignment operator
+
+* operator=\ (x)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::factory "
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::EpetraMatrix::mat "
+Return Epetra_FECrsMatrix pointer
+";
+
+// Documentation extracted from: (module=la, header=EpetraVector.h)
+%feature("docstring")  dolfin::EpetraVector "
+This class provides a simple vector class based on Epetra.
+It is a simple wrapper for an Epetra vector object (Epetra_FEVector)
+implementing the GenericVector interface.
+
+The interface is intentionally simple. For advanced usage,
+access the Epetra_FEVector object using the function vec() or vec_ptr()
+and use the standard Epetra interface.
+";
+
+%feature("docstring")  dolfin::EpetraVector::EpetraVector "
+**Overloaded versions**
+
+* EpetraVector\ ()
+
+  Create empty vector
+
+* EpetraVector\ (comm, N)
+
+  Create vector of size N
+
+* EpetraVector\ (x)
+
+  Copy constructor
+
+* EpetraVector\ (vector)
+
+  Create vector view from given Epetra_FEVector pointer
+
+* EpetraVector\ (map)
+
+  Create vector from given Epetra_BlockMap
+";
+
+%feature("docstring")  dolfin::EpetraVector::zero "
+Set all entries to zero and keep any sparse structure
+";
+
+%feature("docstring")  dolfin::EpetraVector::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::EpetraVector::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::EpetraVector::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::EpetraVector::copy "
+Return copy of vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::init "
+**Overloaded versions**
+
+* init\ (comm, N)
+
+  Initialize vector to size N
+
+* init\ (comm, range)
+
+  Initialize vector with given ownership range
+
+* init\ (comm, range, ghost_indices)
+
+  Initialize vector with given ownership range and with ghost
+  values
+
+* init\ (map)
+
+  Initialize Epetra_FEVector with Epetra map
+";
+
+%feature("docstring")  dolfin::EpetraVector::empty "
+Return true if vector is empty
+";
+
+%feature("docstring")  dolfin::EpetraVector::size "
+Return size of vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::local_size "
+Return size of local vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::local_range "
+Return local ownership range of a vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::owns_index "
+Determine whether global vector index is owned by this process
+";
+
+%feature("docstring")  dolfin::EpetraVector::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::EpetraVector::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::EpetraVector::get_local "
+Get all values on local process
+";
+
+%feature("docstring")  dolfin::EpetraVector::set_local "
+Set all values on local process
+";
+
+%feature("docstring")  dolfin::EpetraVector::add_local "
+Add all values to each entry on local process
+";
+
+%feature("docstring")  dolfin::EpetraVector::gather "
+**Overloaded versions**
+
+* gather\ (x, indices)
+
+  Gather entries into local vector x
+
+* gather\ (x, indices)
+
+  Gather entries into x
+";
+
+%feature("docstring")  dolfin::EpetraVector::gather_on_zero "
+Gather all entries into x on process 0
+";
+
+%feature("docstring")  dolfin::EpetraVector::axpy "
+Add multiple of given vector (AXPY operation)
+";
+
+%feature("docstring")  dolfin::EpetraVector::abs "
+Replace all entries in the vector by their absolute values
+";
+
+%feature("docstring")  dolfin::EpetraVector::inner "
+Return inner product with given vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::norm "
+Return norm of vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::min "
+Return minimum value of vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::max "
+Return maximum value of vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::sum "
+**Overloaded versions**
+
+* sum\ ()
+
+  Return sum of values of vector
+
+* sum\ (rows)
+
+  Return sum of selected rows in vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::operator*= "
+**Overloaded versions**
+
+* operator*=\ (a)
+
+  Multiply vector by given number
+
+* operator*=\ (x)
+
+  Multiply vector by another vector pointwise
+";
+
+%feature("docstring")  dolfin::EpetraVector::operator/= "
+Divide vector by given number
+";
+
+%feature("docstring")  dolfin::EpetraVector::operator+= "
+**Overloaded versions**
+
+* operator+=\ (x)
+
+  Add given vector
+
+* operator+=\ (a)
+
+  Add number to all components of a vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::operator-= "
+**Overloaded versions**
+
+* operator-=\ (x)
+
+  Subtract given vector
+
+* operator-=\ (a)
+
+  Subtract number from all components of a vector
+";
+
+%feature("docstring")  dolfin::EpetraVector::operator= "
+**Overloaded versions**
+
+* operator=\ (x)
+
+  Assignment operator
+
+* operator=\ (a)
+
+  Assignment operator
+
+* operator=\ (x)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::EpetraVector::factory "
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::EpetraVector::vec "
+Return Epetra_FEVector pointer
+";
+
+// Documentation extracted from: (module=la, header=PETScKrylovSolver.h)
+%feature("docstring")  dolfin::PETScKrylovSolver "
+This class implements Krylov methods for linear systems
+of the form Ax = b. It is a wrapper for the Krylov solvers
+of PETSc.
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::PETScKrylovSolver "
+**Overloaded versions**
+
+* PETScKrylovSolver\ (\"default\", \"default\")
+
+  Create Krylov solver for a particular method and names
+  preconditioner
+
+* PETScKrylovSolver\ (method, preconditioner)
+
+  Create Krylov solver for a particular method and
+  PETScPreconditioner
+
+* PETScKrylovSolver\ (method, preconditioner)
+
+  Create Krylov solver for a particular method and
+  PETScPreconditioner (shared_ptr version)
+
+* PETScKrylovSolver\ (method, preconditioner)
+
+  Create Krylov solver for a particular method and
+  PETScPreconditioner
+
+* PETScKrylovSolver\ (method, preconditioner)
+
+  Create Krylov solver for a particular method and
+  PETScPreconditioner (shared_ptr version)
+
+* PETScKrylovSolver\ (ksp)
+
+  Create solver wrapper of a PETSc KSP object
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::set_operator "
+**Overloaded versions**
+
+* set_operator\ (A)
+
+  Set operator (matrix)
+
+* set_operator\ (A)
+
+  Set operator (matrix)
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::set_operators "
+**Overloaded versions**
+
+* set_operators\ (A, P)
+
+  Set operator (matrix) and preconditioner matrix
+
+* set_operators\ (A, P)
+
+  Set operator (matrix) and preconditioner matrix
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::set_nullspace "
+Set null space of the operator (matrix). This is used to solve
+singular systems
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::get_operator "
+Get operator (matrix)
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b and return number of iterations
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b and return number of iterations
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b and return number of iterations
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b and return number of iterations
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::ksp "
+Return PETSc KSP pointer
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::methods "
+Return a list of available solver methods
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::set_options_prefix "
+Set options prefix
+";
+
+%feature("docstring")  dolfin::PETScKrylovSolver::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=la, header=PETScLUSolver.h)
+%feature("docstring")  dolfin::PETScLUSolver "
+This class implements the direct solution (LU factorization) for
+linear systems of the form Ax = b. It is a wrapper for the LU
+solver of PETSc.
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::PETScLUSolver "
+**Overloaded versions**
+
+* PETScLUSolver\ (method=\"default\")
+
+  Constructor
+
+* PETScLUSolver\ (A, method=\"default\")
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::set_operator "
+**Overloaded versions**
+
+* set_operator\ (A)
+
+  Set operator (matrix)
+
+* set_operator\ (A)
+
+  Set operator (matrix)
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::get_operator "
+Get operator (matrix)
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (x, b, transpose)
+
+  Solve linear system Ax = b
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::solve_transpose "
+**Overloaded versions**
+
+* solve_transpose\ (x, b)
+
+  Solve linear system A^Tx = b
+
+* solve_transpose\ (A, x, b)
+
+  Solve linear system A^Tx = b
+
+* solve_transpose\ (A, x, b)
+
+  Solve linear system A^Tx = b
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::ksp "
+Return PETSc KSP pointer
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::methods "
+Return a list of available solver methods
+";
+
+%feature("docstring")  dolfin::PETScLUSolver::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=la, header=CholmodCholeskySolver.h)
+%feature("docstring")  dolfin::CholmodCholeskySolver "
+This class implements the direct solution (Cholesky
+factorization) of linear systems of the form Ax = b. Sparse
+matrices are solved using CHOLMOD
+http://www.cise.ufl.edu/research/sparse/cholmod/ if installed.
+";
+
+%feature("docstring")  dolfin::CholmodCholeskySolver::CholmodCholeskySolver "
+**Overloaded versions**
+
+* CholmodCholeskySolver\ ()
+
+  Constructor
+
+* CholmodCholeskySolver\ (A)
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::CholmodCholeskySolver::set_operator "
+Solve the operator (matrix)
+";
+
+%feature("docstring")  dolfin::CholmodCholeskySolver::solve "
+Solve linear system Ax = b for a sparse matrix using CHOLMOD
+";
+
+%feature("docstring")  dolfin::CholmodCholeskySolver::factorize "
+Cholesky-factor sparse matrix A if CHOLMOD is installed
+";
+
+%feature("docstring")  dolfin::CholmodCholeskySolver::factorized_solve "
+Solve factorized system (CHOLMOD).
+";
+
+%feature("docstring")  dolfin::CholmodCholeskySolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::Cholmod::clear "
+Clear data
+";
+
+%feature("docstring")  dolfin::Cholmod::init "
+Initialise with matrix
+";
+
+%feature("docstring")  dolfin::Cholmod::factorize "
+Factorize
+";
+
+%feature("docstring")  dolfin::Cholmod::factorized_solve "
+Factorized solve
+";
+
+%feature("docstring")  dolfin::Cholmod::residual "
+Compute residual: b-Ax
+";
+
+%feature("docstring")  dolfin::Cholmod::residual_norm "
+Compute residual norm
+";
+
+%feature("docstring")  dolfin::Cholmod::refine_once "
+Perform one refinement
+";
+
+%feature("docstring")  dolfin::Cholmod::check_status "
+Check status flag returned by an CHOLMOD function
+";
+
+// Documentation extracted from: (module=la, header=UmfpackLUSolver.h)
+%feature("docstring")  dolfin::UmfpackLUSolver "
+This class implements the direct solution (LU factorization) of
+linear systems of the form Ax = b using UMFPACK
+(http://www.cise.ufl.edu/research/sparse/umfpack/) if installed.
+";
+
+%feature("docstring")  dolfin::UmfpackLUSolver::UmfpackLUSolver "
+**Overloaded versions**
+
+* UmfpackLUSolver\ ()
+
+  Constructor
+
+* UmfpackLUSolver\ (A)
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::UmfpackLUSolver::set_operator "
+Set operator (matrix)
+";
+
+%feature("docstring")  dolfin::UmfpackLUSolver::get_operator "
+Return the operator (matrix)
+";
+
+%feature("docstring")  dolfin::UmfpackLUSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b for a sparse matrix using UMFPACK
+  if installed
+
+* solve\ (A, x, b)
+
+  Solve linear system
+";
+
+%feature("docstring")  dolfin::UmfpackLUSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::UmfpackLUSolver::numeric_factorize "
+LU factorisation
+";
+
+%feature("docstring")  dolfin::UmfpackLUSolver::solve_factorized "
+Solve factorized system (UMFPACK).
+";
+
+%feature("docstring")  dolfin::UmfpackLUSolver::umfpack_check_status "
+Check status flag returned by an UMFPACK function
+";
+
+// Documentation extracted from: (module=la, header=MUMPSLUSolver.h)
+%feature("docstring")  dolfin::MUMPSLUSolver "
+This class implements the direct solution (LU factorization) for
+linear systems of the form Ax = b. It is a wrapper for the MUMPS
+LU solver.
+";
+
+%feature("docstring")  dolfin::MUMPSLUSolver::MUMPSLUSolver "
+**Overloaded versions**
+
+* MUMPSLUSolver\ (A)
+
+  Constructor
+
+* MUMPSLUSolver\ (A)
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::MUMPSLUSolver::solve "
+Solve linear system Ax = b
+";
+
+%feature("docstring")  dolfin::MUMPSLUSolver::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=la, header=PaStiXLUSolver.h)
+%feature("docstring")  dolfin::PaStiXLUSolver::PaStiXLUSolver "
+**Overloaded versions**
+
+* PaStiXLUSolver\ (A)
+
+  Constructor
+
+* PaStiXLUSolver\ (A)
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::PaStiXLUSolver::solve "
+Solve Ax = b
+";
+
+%feature("docstring")  dolfin::PaStiXLUSolver::default_parameters "
+Default parameter values
+";
+
+// Documentation extracted from: (module=la, header=STLMatrix.h)
+%feature("docstring")  dolfin::STLMatrix "
+Simple STL-based implementation of the GenericMatrix interface.
+The sparse matrix is stored as a pair of std::vector of
+std::vector, one for the columns and one for the values.
+
+Historically, this class has undergone a number of different
+incarnations, based on various combinations of std::vector,
+std::set and std::map. The current implementation has proven to
+be the fastest.
+";
+
+%feature("docstring")  dolfin::STLMatrix::STLMatrix "
+Create empty matrix
+";
+
+%feature("docstring")  dolfin::STLMatrix::init "
+--- Implementation of the GenericTensor interface ---
+Initialize zero tensor using sparsity pattern
+";
+
+%feature("docstring")  dolfin::STLMatrix::empty "
+Return true if empty
+";
+
+%feature("docstring")  dolfin::STLMatrix::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::STLMatrix::local_range "
+Return local ownership range
+";
+
+%feature("docstring")  dolfin::STLMatrix::zero "
+**Overloaded versions**
+
+* zero\ ()
+
+  Set all entries to zero and keep any sparse structure
+
+* zero\ (m, rows)
+
+  Set given rows to zero
+";
+
+%feature("docstring")  dolfin::STLMatrix::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::STLMatrix::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::STLMatrix::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::STLMatrix::copy "
+Return copy of matrix
+";
+
+%feature("docstring")  dolfin::STLMatrix::init_vector "
+Initialize vector z to be compatible with the matrix-vector
+product y = Ax. In the parallel case, both size and layout are
+important.
+
+*Arguments*
+    dim (int)
+        The dimension (axis): dim = 0 --> z = y, dim = 1 --> z = x
+";
+
+%feature("docstring")  dolfin::STLMatrix::get "
+Get block of values
+";
+
+%feature("docstring")  dolfin::STLMatrix::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::STLMatrix::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::STLMatrix::axpy "
+Add multiple of given matrix (AXPY operation)
+";
+
+%feature("docstring")  dolfin::STLMatrix::norm "
+Return norm of matrix
+";
+
+%feature("docstring")  dolfin::STLMatrix::getrow "
+Get non-zero values of given row
+";
+
+%feature("docstring")  dolfin::STLMatrix::setrow "
+Set values for given row
+";
+
+%feature("docstring")  dolfin::STLMatrix::ident "
+Set given rows to identity matrix
+";
+
+%feature("docstring")  dolfin::STLMatrix::set_diagonal "
+Set diagonal of a matrix
+";
+
+%feature("docstring")  dolfin::STLMatrix::operator*= "
+Multiply matrix by given number
+";
+
+%feature("docstring")  dolfin::STLMatrix::operator/= "
+Divide matrix by given number
+";
+
+%feature("docstring")  dolfin::STLMatrix::operator= "
+Assignment operator
+";
+
+%feature("docstring")  dolfin::STLMatrix::factory "
+--- Specialized matrix functions ---
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::STLMatrix::block_size "
+--- STLMatrix interface ---
+Return matrix block size
+";
+
+%feature("docstring")  dolfin::STLMatrix::clear "
+Clear matrix. Destroys data and sparse layout
+";
+
+%feature("docstring")  dolfin::STLMatrix::csr "
+Return matrix in CSR format
+";
+
+%feature("docstring")  dolfin::STLMatrix::csc "
+Return matrix in CSC format
+";
+
+%feature("docstring")  dolfin::STLMatrix::nnz "
+Return number of global non-zero entries
+";
+
+%feature("docstring")  dolfin::STLMatrix::local_nnz "
+Return number of local non-zero entries
+";
+
+%feature("docstring")  dolfin::STLMatrix::compressed_storage "
+Return matrix in compressed format
+";
+
+// Documentation extracted from: (module=la, header=CoordinateMatrix.h)
+%feature("docstring")  dolfin::CoordinateMatrix "
+Coordinate sparse matrix.
+";
+
+%feature("docstring")  dolfin::CoordinateMatrix::CoordinateMatrix "
+Constructor
+";
+
+%feature("docstring")  dolfin::CoordinateMatrix::norm "
+Return norm of matrix
+";
+
+// Documentation extracted from: (module=la, header=uBLASVector.h)
+%feature("docstring")  dolfin::uBLASVector "
+This class provides a simple vector class based on uBLAS.
+It is a simple wrapper for a uBLAS vector implementing the
+GenericVector interface.
+
+The interface is intentionally simple. For advanced usage,
+access the underlying uBLAS vector and use the standard
+uBLAS interface which is documented at
+http://www.boost.org/libs/numeric/ublas/doc/index.htm.
+";
+
+%feature("docstring")  dolfin::uBLASVector::uBLASVector "
+**Overloaded versions**
+
+* uBLASVector\ ()
+
+  Create empty vector
+
+* uBLASVector\ (N)
+
+  Create vector of size N
+
+* uBLASVector\ (x)
+
+  Copy constructor
+
+* uBLASVector\ (x)
+
+  Construct vector from a ublas_vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::zero "
+Set all entries to zero and keep any sparse structure
+";
+
+%feature("docstring")  dolfin::uBLASVector::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::uBLASVector::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::uBLASVector::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::uBLASVector::copy "
+Create copy of tensor
+";
+
+%feature("docstring")  dolfin::uBLASVector::init "
+**Overloaded versions**
+
+* init\ (comm, N)
+
+  Resize vector to size N
+
+* init\ (comm, range)
+
+  Resize vector with given ownership range
+
+* init\ (comm, range, ghost_indices)
+
+  Resize vector with given ownership range and with ghost values
+";
+
+%feature("docstring")  dolfin::uBLASVector::resize "
+**Overloaded versions**
+
+* resize\ (comm, N)
+
+  Resize vector to size N
+
+* resize\ (comm, range)
+
+  Resize vector with given ownership range
+
+* resize\ (comm, range, ghost_indices)
+
+  Resize vector with given ownership range and with ghost values
+";
+
+%feature("docstring")  dolfin::uBLASVector::empty "
+Return true if vector is empty
+";
+
+%feature("docstring")  dolfin::uBLASVector::size "
+Return true if vector is empty
+";
+
+%feature("docstring")  dolfin::uBLASVector::local_size "
+Return local size of vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::local_range "
+Return local ownership range of a vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::owns_index "
+Determine whether global vector index is owned by this process
+";
+
+%feature("docstring")  dolfin::uBLASVector::get_local "
+**Overloaded versions**
+
+* get_local\ (block, m, rows)
+
+  Get block of values
+
+* get_local\ (values)
+
+  Get all values on local process
+";
+
+%feature("docstring")  dolfin::uBLASVector::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::uBLASVector::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::uBLASVector::set_local "
+Set all values on local process
+";
+
+%feature("docstring")  dolfin::uBLASVector::add_local "
+Add values to each entry on local process
+";
+
+%feature("docstring")  dolfin::uBLASVector::gather "
+**Overloaded versions**
+
+* gather\ (x, indices)
+
+  Gather entries into local vector x
+
+* gather\ (x, indices)
+
+  Gather entries into x
+";
+
+%feature("docstring")  dolfin::uBLASVector::gather_on_zero "
+Gather all entries into x on process 0
+";
+
+%feature("docstring")  dolfin::uBLASVector::axpy "
+Add multiple of given vector (AXPY operation)
+";
+
+%feature("docstring")  dolfin::uBLASVector::abs "
+Replace all entries in the vector by their absolute values
+";
+
+%feature("docstring")  dolfin::uBLASVector::inner "
+Return inner product with given vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::norm "
+Compute norm of vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::min "
+Return minimum value of vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::max "
+Return maximum value of vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::sum "
+**Overloaded versions**
+
+* sum\ ()
+
+  Return sum of values of vector
+
+* sum\ (rows)
+
+  Return sum of selected rows in vector. Repeated entries are
+  only summed once.
+";
+
+%feature("docstring")  dolfin::uBLASVector::operator*= "
+**Overloaded versions**
+
+* operator*=\ (a)
+
+  Multiply vector by given number
+
+* operator*=\ (x)
+
+  Multiply vector by another vector pointwise
+";
+
+%feature("docstring")  dolfin::uBLASVector::operator/= "
+Divide vector by given number
+";
+
+%feature("docstring")  dolfin::uBLASVector::operator+= "
+**Overloaded versions**
+
+* operator+=\ (x)
+
+  Add given vector
+
+* operator+=\ (a)
+
+  Add number to all components of a vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::operator-= "
+**Overloaded versions**
+
+* operator-=\ (x)
+
+  Subtract given vector
+
+* operator-=\ (a)
+
+  Subtract number from all components of a vector
+";
+
+%feature("docstring")  dolfin::uBLASVector::operator= "
+**Overloaded versions**
+
+* operator=\ (x)
+
+  Assignment operator
+
+* operator=\ (a)
+
+  Assignment operator
+
+* operator=\ (x)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::uBLASVector::data "
+**Overloaded versions**
+
+* data\ ()
+
+  Return pointer to underlying data (const version)
+
+* data\ ()
+
+  Return pointer to underlying data
+";
+
+%feature("docstring")  dolfin::uBLASVector::factory "
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::uBLASVector::vec "
+**Overloaded versions**
+
+* vec\ ()
+
+  Return reference to uBLAS vector (const version)
+
+* vec\ ()
+
+  Return reference to uBLAS vector (non-const version)
+";
+
+%feature("docstring")  dolfin::uBLASVector::operator[] "
+**Overloaded versions**
+
+* operator[]\ (i)
+
+  Access value of given entry (const version)
+
+* operator[]\ (i)
+
+  Access value of given entry (non-const version)
+";
+
+// Documentation extracted from: (module=la, header=PETScVector.h)
+%feature("docstring")  dolfin::PETScVector "
+This class provides a simple vector class based on PETSc.
+It is a simple wrapper for a PETSc vector pointer (Vec)
+implementing the GenericVector interface.
+
+The interface is intentionally simple. For advanced usage,
+access the PETSc Vec pointer using the function vec() and
+use the standard PETSc interface.
+";
+
+%feature("docstring")  dolfin::PETScVector::PETScVector "
+**Overloaded versions**
+
+* PETScVector\ ()
+
+  Create empty vector
+
+* PETScVector\ (comm, N, use_gpu=false)
+
+  Create vector of size N
+
+* PETScVector\ (sparsity_pattern)
+
+  Create vector
+
+* PETScVector\ (x)
+
+  Copy constructor
+
+* PETScVector\ (x)
+
+  Create vector wrapper of PETSc Vec pointer
+";
+
+%feature("docstring")  dolfin::PETScVector::zero "
+Set all entries to zero and keep any sparse structure
+";
+
+%feature("docstring")  dolfin::PETScVector::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::PETScVector::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::PETScVector::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::PETScVector::copy "
+Return copy of vector
+";
+
+%feature("docstring")  dolfin::PETScVector::init "
+**Overloaded versions**
+
+* init\ (comm, N)
+
+  Initialize vector to global size N
+
+* init\ (comm, range)
+
+  Initialize vector with given ownership range
+
+* init\ (comm, range, ghost_indices)
+
+  Initialize vector with given ownership range and with ghost values
+";
+
+%feature("docstring")  dolfin::PETScVector::empty "
+Return true if vector is empty
+";
+
+%feature("docstring")  dolfin::PETScVector::size "
+Return size of vector
+";
+
+%feature("docstring")  dolfin::PETScVector::local_size "
+Return local size of vector
+";
+
+%feature("docstring")  dolfin::PETScVector::local_range "
+Return ownership range of a vector
+";
+
+%feature("docstring")  dolfin::PETScVector::owns_index "
+Determine whether global vector index is owned by this process
+";
+
+%feature("docstring")  dolfin::PETScVector::get_local "
+**Overloaded versions**
+
+* get_local\ (block, m, rows)
+
+  Get block of values (values must all live on the local process)
+
+* get_local\ (values)
+
+  Get all values on local process
+";
+
+%feature("docstring")  dolfin::PETScVector::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::PETScVector::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::PETScVector::set_local "
+Set all values on local process
+";
+
+%feature("docstring")  dolfin::PETScVector::add_local "
+Add values to each entry on local process
+";
+
+%feature("docstring")  dolfin::PETScVector::gather "
+**Overloaded versions**
+
+* gather\ (y, indices)
+
+  Gather vector entries into a local vector
+
+* gather\ (x, indices)
+
+  Gather entries into x
+";
+
+%feature("docstring")  dolfin::PETScVector::gather_on_zero "
+Gather all entries into x on process 0
+";
+
+%feature("docstring")  dolfin::PETScVector::axpy "
+Add multiple of given vector (AXPY operation)
+";
+
+%feature("docstring")  dolfin::PETScVector::abs "
+Replace all entries in the vector by their absolute values
+";
+
+%feature("docstring")  dolfin::PETScVector::inner "
+Return inner product with given vector
+";
+
+%feature("docstring")  dolfin::PETScVector::norm "
+Return norm of vector
+";
+
+%feature("docstring")  dolfin::PETScVector::min "
+Return minimum value of vector
+";
+
+%feature("docstring")  dolfin::PETScVector::max "
+Return maximum value of vector
+";
+
+%feature("docstring")  dolfin::PETScVector::sum "
+**Overloaded versions**
+
+* sum\ ()
+
+  Return sum of values of vector
+
+* sum\ (rows)
+
+  Return sum of selected rows in vector
+";
+
+%feature("docstring")  dolfin::PETScVector::operator*= "
+**Overloaded versions**
+
+* operator*=\ (a)
+
+  Multiply vector by given number
+
+* operator*=\ (x)
+
+  Multiply vector by another vector pointwise
+";
+
+%feature("docstring")  dolfin::PETScVector::operator/= "
+Divide vector by given number
+";
+
+%feature("docstring")  dolfin::PETScVector::operator+= "
+**Overloaded versions**
+
+* operator+=\ (x)
+
+  Add given vector
+
+* operator+=\ (a)
+
+  Add number to all components of a vector
+";
+
+%feature("docstring")  dolfin::PETScVector::operator-= "
+**Overloaded versions**
+
+* operator-=\ (x)
+
+  Subtract given vector
+
+* operator-=\ (a)
+
+  Subtract number from all components of a vector
+";
+
+%feature("docstring")  dolfin::PETScVector::operator= "
+**Overloaded versions**
+
+* operator=\ (x)
+
+  Assignment operator
+
+* operator=\ (a)
+
+  Assignment operator
+
+* operator=\ (x)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::PETScVector::factory "
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::PETScVector::vec "
+Return pointer to PETSc Vec object
+";
+
+// Documentation extracted from: (module=la, header=SparsityPattern.h)
+%feature("docstring")  dolfin::SparsityPattern "
+This class implements the GenericSparsityPattern interface.
+It is used by most linear algebra backends.
+";
+
+%feature("docstring")  dolfin::SparsityPattern::SparsityPattern "
+**Overloaded versions**
+
+* SparsityPattern\ (primary_dim)
+
+  Create empty sparsity pattern
+
+* SparsityPattern\ (mpi_comm, dims, ownership_range, off_process_owner, primary_dim)
+
+  Create sparsity pattern for a generic tensor
+";
+
+%feature("docstring")  dolfin::SparsityPattern::init "
+Initialize sparsity pattern for a generic tensor
+";
+
+%feature("docstring")  dolfin::SparsityPattern::insert "
+Insert non-zero entries
+";
+
+%feature("docstring")  dolfin::SparsityPattern::add_edges "
+Add edges (vertex = [index, owning process])
+";
+
+%feature("docstring")  dolfin::SparsityPattern::rank "
+Return rank
+";
+
+%feature("docstring")  dolfin::SparsityPattern::local_range "
+Return local range for dimension dim
+";
+
+%feature("docstring")  dolfin::SparsityPattern::num_nonzeros "
+Return number of local nonzeros
+";
+
+%feature("docstring")  dolfin::SparsityPattern::num_nonzeros_diagonal "
+Fill array with number of nonzeros for diagonal block in
+local_range for dimension 0. For matrices, fill array with number
+of nonzeros per local row for diagonal block
+";
+
+%feature("docstring")  dolfin::SparsityPattern::num_nonzeros_off_diagonal "
+Fill array with number of nonzeros for off-diagonal block in
+local_range for dimension 0. For matrices, fill array with number
+of nonzeros per local row for off-diagonal block
+";
+
+%feature("docstring")  dolfin::SparsityPattern::num_local_nonzeros "
+Fill vector with number of nonzeros in local_range for dimension 0
+";
+
+%feature("docstring")  dolfin::SparsityPattern::get_edges "
+Fill vector with edges for given vertex
+";
+
+%feature("docstring")  dolfin::SparsityPattern::apply "
+Finalize sparsity pattern
+";
+
+%feature("docstring")  dolfin::SparsityPattern::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::SparsityPattern::diagonal_pattern "
+Return underlying sparsity pattern (diagonal). Options are
+'sorted' and 'unsorted'.
+";
+
+%feature("docstring")  dolfin::SparsityPattern::off_diagonal_pattern "
+Return underlying sparsity pattern (off-diagional). Options are
+'sorted' and 'unsorted'.
+";
+
+// Documentation extracted from: (module=la, header=GenericLinearAlgebraFactory.h)
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::GenericLinearAlgebraFactory "
+Constructor
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::create_matrix "
+Create empty matrix
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::create_vector "
+Create empty vector
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::create_layout "
+Create empty tensor layout
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::create_linear_operator "
+Create empty linear operator
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::create_lu_solver "
+Create LU solver
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::create_krylov_solver "
+Create Krylov solver
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::lu_solver_methods "
+Return a list of available LU solver methods.
+This function should be overloaded by subclass if non-empty.
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::krylov_solver_methods "
+Return a list of available Krylov solver methods.
+This function should be overloaded by subclass if non-empty.
+";
+
+%feature("docstring")  dolfin::GenericLinearAlgebraFactory::krylov_solver_preconditioners "
+Return a list of available preconditioners.
+This function should be overloaded by subclass if non-empty.
+";
+
+// Documentation extracted from: (module=la, header=DefaultFactory.h)
+%feature("docstring")  dolfin::DefaultFactory::DefaultFactory "
+Constructor
+";
+
+%feature("docstring")  dolfin::DefaultFactory::create_matrix "
+Create empty matrix
+";
+
+%feature("docstring")  dolfin::DefaultFactory::create_vector "
+Create empty vector
+";
+
+%feature("docstring")  dolfin::DefaultFactory::create_layout "
+Create empty tensor layout
+";
+
+%feature("docstring")  dolfin::DefaultFactory::create_linear_operator "
+Create empty linear operator
+";
+
+%feature("docstring")  dolfin::DefaultFactory::create_lu_solver "
+Create LU solver
+";
+
+%feature("docstring")  dolfin::DefaultFactory::create_krylov_solver "
+Create Krylov solver
+";
+
+%feature("docstring")  dolfin::DefaultFactory::lu_solver_methods "
+Return a list of available LU solver methods
+";
+
+%feature("docstring")  dolfin::DefaultFactory::krylov_solver_methods "
+Return a list of available Krylov solver methods
+";
+
+%feature("docstring")  dolfin::DefaultFactory::krylov_solver_preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::DefaultFactory::factory "
+Return instance of default backend
+";
+
+// Documentation extracted from: (module=la, header=PETScUserPreconditioner.h)
+%feature("docstring")  dolfin::PETScUserPreconditioner "
+This class specifies the interface for user-defined Krylov
+method PETScPreconditioners. A user wishing to implement her own
+PETScPreconditioner needs only supply a function that approximately
+solves the linear system given a right-hand side.
+";
+
+%feature("docstring")  dolfin::PETScUserPreconditioner::PETScUserPreconditioner "
+Constructor
+";
+
+%feature("docstring")  dolfin::PETScUserPreconditioner::solve "
+Solve linear system approximately for given right-hand side b
+";
+
+// Documentation extracted from: (module=la, header=PETScFactory.h)
+%feature("docstring")  dolfin::PETScFactory::create_matrix "
+Create empty matrix
+";
+
+%feature("docstring")  dolfin::PETScFactory::create_vector "
+Create empty vector
+";
+
+%feature("docstring")  dolfin::PETScFactory::create_layout "
+Create empty tensor layout
+";
+
+%feature("docstring")  dolfin::PETScFactory::create_linear_operator "
+Create empty linear operator
+";
+
+%feature("docstring")  dolfin::PETScFactory::create_lu_solver "
+Create LU solver
+";
+
+%feature("docstring")  dolfin::PETScFactory::create_krylov_solver "
+Create Krylov solver
+";
+
+%feature("docstring")  dolfin::PETScFactory::lu_solver_methods "
+Return a list of available LU solver methods
+";
+
+%feature("docstring")  dolfin::PETScFactory::krylov_solver_methods "
+Return a list of available Krylov solver methods
+";
+
+%feature("docstring")  dolfin::PETScFactory::krylov_solver_preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::PETScFactory::instance "
+Return singleton instance
+";
+
+%feature("docstring")  dolfin::PETScFactory::PETScFactory "
+Private constructor
+";
+
+// Documentation extracted from: (module=la, header=PETScCuspFactory.h)
+%feature("docstring")  dolfin::PETScCuspFactory::create_matrix "
+Create empty matrix
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::create_vector "
+Create empty vector
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::create_layout "
+Create empty tensor layout
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::create_linear_operator "
+Create empty linear operator
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::create_lu_solver "
+Create LU solver
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::create_krylov_solver "
+Create Krylov solver
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::lu_solver_methods "
+Return a list of available LU solver methods
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::krylov_solver_methods "
+Return a list of available Krylov solver methods
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::krylov_solver_preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::instance "
+Return singleton instance
+";
+
+%feature("docstring")  dolfin::PETScCuspFactory::PETScCuspFactory "
+Private constructor
+";
+
+// Documentation extracted from: (module=la, header=EpetraFactory.h)
+%feature("docstring")  dolfin::EpetraFactory::create_matrix "
+--- GenericLinearAlgebraFactory interface
+Create empty matrix
+";
+
+%feature("docstring")  dolfin::EpetraFactory::create_vector "
+Create empty vector
+";
+
+%feature("docstring")  dolfin::EpetraFactory::create_layout "
+Create empty tensor layout
+";
+
+%feature("docstring")  dolfin::EpetraFactory::create_linear_operator "
+Create empty linear operator
+";
+
+%feature("docstring")  dolfin::EpetraFactory::create_lu_solver "
+Create LU solver
+";
+
+%feature("docstring")  dolfin::EpetraFactory::create_krylov_solver "
+Create Krylov solver
+";
+
+%feature("docstring")  dolfin::EpetraFactory::lu_solver_methods "
+Return a list of available LU solver methods
+";
+
+%feature("docstring")  dolfin::EpetraFactory::krylov_solver_methods "
+Return a list of available Krylov solver methods
+";
+
+%feature("docstring")  dolfin::EpetraFactory::krylov_solver_preconditioners "
+Return a list of available preconditioners
+";
+
+// Documentation extracted from: (module=la, header=STLFactory.h)
+%feature("docstring")  dolfin::STLFactory::create_matrix "
+Create empty matrix
+";
+
+%feature("docstring")  dolfin::STLFactory::create_vector "
+Create empty vector
+";
+
+%feature("docstring")  dolfin::STLFactory::create_layout "
+Create empty tensor layout
+";
+
+%feature("docstring")  dolfin::STLFactory::create_linear_operator "
+Create empty linear operator
+";
+
+%feature("docstring")  dolfin::STLFactory::create_lu_solver "
+Create LU solver
+";
+
+%feature("docstring")  dolfin::STLFactory::create_krylov_solver "
+Create Krylov solver
+";
+
+%feature("docstring")  dolfin::STLFactory::instance "
+Return singleton instance
+";
+
+// Documentation extracted from: (module=la, header=SLEPcEigenSolver.h)
+%feature("docstring")  dolfin::SLEPcEigenSolver "
+This class provides an eigenvalue solver for PETSc matrices.
+It is a wrapper for the SLEPc eigenvalue solver.
+
+The following parameters may be specified to control the solver.
+
+1. \"spectrum\"
+
+This parameter controls which part of the spectrum to compute.
+Possible values are
+
+  \"largest magnitude\"   (eigenvalues with largest magnitude)
+  \"smallest magnitude\"  (eigenvalues with smallest magnitude)
+  \"largest real\"        (eigenvalues with largest double part)
+  \"smallest real\"       (eigenvalues with smallest double part)
+  \"largest imaginary\"   (eigenvalues with largest imaginary part)
+  \"smallest imaginary\"  (eigenvalues with smallest imaginary part)
+
+For SLEPc versions >= 3.1 , the following values are also possible
+
+  \"target magnitude\"    (eigenvalues closest to target in magnitude)
+  \"target real\"         (eigenvalues closest to target in real part)
+  \"target imaginary\"    (eigenvalues closest to target in imaginary part)
+
+The default is \"largest magnitude\"
+
+2. \"solver\"
+
+This parameter controls which algorithm is used by SLEPc.
+Possible values are
+
+  \"power\"               (power iteration)
+  \"subspace\"            (subspace iteration)
+  \"arnoldi\"             (Arnoldi)
+  \"lanczos\"             (Lanczos)
+  \"krylov-schur\"        (Krylov-Schur)
+  \"lapack\"              (LAPACK, all values, direct, small systems only)
+  \"arpack\"              (ARPACK)
+
+The default is \"krylov-schur\"
+
+3. \"tolerance\"
+
+This parameter controls the tolerance used by SLEPc.
+Possible values are positive double numbers.
+
+The default is 1e-15;
+
+4. \"maximum_iterations\"
+
+This parameter controls the maximum number of iterations used by SLEPc.
+Possible values are positive integers.
+
+Note that both the tolerance and the number of iterations must be
+specified if either one is specified.
+
+5. \"problem_type\"
+
+This parameter can be used to give extra information about the
+type of the eigenvalue problem. Some solver types require this
+extra piece of information. Possible values are:
+
+  \"hermitian\"               (Hermitian)
+  \"non_hermitian\"           (Non-Hermitian)
+  \"gen_hermitian\"           (Generalized Hermitian)
+  \"gen_non_hermitian\"       (Generalized Non-Hermitian)
+  \"pos_gen_non_hermitian\"   (Generalized Non-Hermitian with positive semidefinite B)
+
+6. \"spectral_transform\"
+
+This parameter controls the application of a spectral transform. A
+spectral transform can be used to enhance the convergence of the
+eigensolver and in particular to only compute eigenvalues in the
+interior of the spectrum. Possible values are:
+
+  \"shift-and-invert\"      (A shift-and-invert transform)
+
+Note that if a spectral transform is given, then also a non-zero
+spectral shift parameter has to be provided.
+
+The default is no spectral transform.
+
+7. \"spectral_shift\"
+
+This parameter controls the spectral shift used by the spectral
+transform and must be provided if a spectral transform is given. The
+possible values are real numbers.
+
+";
+
+%feature("docstring")  dolfin::SLEPcEigenSolver::SLEPcEigenSolver "
+**Overloaded versions**
+
+* SLEPcEigenSolver\ (A)
+
+  Create eigenvalue solver for Ax = \lambda x
+
+* SLEPcEigenSolver\ (A, B)
+
+  Create eigenvalue solver Ax = \lambda Bx
+
+* SLEPcEigenSolver\ (A)
+
+  Create eigenvalue solver for Ax = \lambda x
+
+* SLEPcEigenSolver\ (A, B)
+
+  Create eigenvalue solver for Ax = \lambda x
+";
+
+%feature("docstring")  dolfin::SLEPcEigenSolver::solve "
+**Overloaded versions**
+
+* solve\ ()
+
+  Compute all eigenpairs of the matrix A (solve Ax = \lambda x)
+
+* solve\ (n)
+
+  Compute the n first eigenpairs of the matrix A (solve Ax = \lambda x)
+";
+
+%feature("docstring")  dolfin::SLEPcEigenSolver::get_eigenvalue "
+**Overloaded versions**
+
+* get_eigenvalue\ (lr, lc)
+
+  Get the first eigenvalue
+
+* get_eigenvalue\ (lr, lc, i)
+
+  Get eigenvalue i
+";
+
+%feature("docstring")  dolfin::SLEPcEigenSolver::get_eigenpair "
+**Overloaded versions**
+
+* get_eigenpair\ (lr, lc, r, c)
+
+  Get the first eigenpair
+
+* get_eigenpair\ (lr, lc, r, c)
+
+  Get the first eigenpair
+
+* get_eigenpair\ (lr, lc, r, c, i)
+
+  Get eigenpair i
+
+* get_eigenpair\ (lr, lc, r, c, i)
+
+  Get eigenpair i
+";
+
+%feature("docstring")  dolfin::SLEPcEigenSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::SLEPcEigenSolver::read_parameters "
+Callback for changes in parameter values
+";
+
+// Documentation extracted from: (module=la, header=TrilinosPreconditioner.h)
+%feature("docstring")  dolfin::TrilinosPreconditioner "
+This class is a wrapper for configuring Epetra
+preconditioners. It does not own a preconditioner. It can take a
+EpetraKrylovSolver and set the preconditioner type and
+parameters.
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::TrilinosPreconditioner "
+Create Krylov solver for a particular method and preconditioner
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::set "
+Set the precondtioner and matrix used in preconditioner
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::set_parameters "
+**Overloaded versions**
+
+* set_parameters\ (list)
+
+  Set the Trilonos preconditioner parameters list
+
+* set_parameters\ (list)
+
+  Set the Trilonos preconditioner parameters list (for use from
+  Python)
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::set_nullspace "
+Set basis for the null space of the operator. Setting this is
+critical to the performance of some preconditioners, e.g. ML.
+The vectors spanning the null space are copied.
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::name "
+Return preconditioner name
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::TrilinosPreconditioner::set_ml "
+Setup the ML precondtioner
+";
+
+// Documentation extracted from: (module=la, header=uBLASSparseMatrix.h)
+// Documentation extracted from: (module=la, header=uBLASDenseMatrix.h)
+// Documentation extracted from: (module=la, header=uBLASPreconditioner.h)
+%feature("docstring")  dolfin::uBLASPreconditioner "
+This class specifies the interface for preconditioners for the
+uBLAS Krylov solver.
+";
+
+%feature("docstring")  dolfin::uBLASPreconditioner::uBLASPreconditioner "
+Constructor
+";
+
+%feature("docstring")  dolfin::uBLASPreconditioner::init "
+**Overloaded versions**
+
+* init\ (P)
+
+  Initialise preconditioner (sparse matrix)
+
+* init\ (P)
+
+  Initialise preconditioner (dense matrix)
+
+* init\ (P)
+
+  Initialise preconditioner (virtual matrix)
+";
+
+%feature("docstring")  dolfin::uBLASPreconditioner::solve "
+Solve linear system (M^-1)Ax = y
+";
+
+// Documentation extracted from: (module=la, header=uBLASKrylovSolver.h)
+%feature("docstring")  dolfin::uBLASKrylovSolver "
+This class implements Krylov methods for linear systems
+of the form Ax = b using uBLAS data types.
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::uBLASKrylovSolver "
+**Overloaded versions**
+
+* uBLASKrylovSolver\ (method=\"default\", preconditioner=\"default\")
+
+  Create Krylov solver for a particular method and preconditioner
+
+* uBLASKrylovSolver\ (pc)
+
+  Create Krylov solver for a particular uBLASPreconditioner
+
+* uBLASKrylovSolver\ (method, pc)
+
+  Create Krylov solver for a particular method and uBLASPreconditioner
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::set_operator "
+Solve the operator (matrix)
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::set_operators "
+Set operator (matrix) and preconditioner matrix
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::get_operator "
+Return the operator (matrix)
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b and return number of iterations
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b and return number of iterations
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::methods "
+Return a list of available solver methods
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::solve_krylov "
+Select solver and solve linear system Ax = b and return number
+of iterations
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::solveCG "
+Solve linear system Ax = b using CG
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::solveGMRES "
+Solve linear system Ax = b using restarted GMRES
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::solveBiCGStab "
+Solve linear system Ax = b using BiCGStab
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::select_preconditioner "
+Select and create named preconditioner
+";
+
+%feature("docstring")  dolfin::uBLASKrylovSolver::read_parameters "
+Read solver parameters
+";
+
+// Documentation extracted from: (module=la, header=uBLASILUPreconditioner.h)
+%feature("docstring")  dolfin::uBLASILUPreconditioner "
+This class implements an incomplete LU factorization (ILU)
+preconditioner for the uBLAS Krylov solver.
+";
+
+%feature("docstring")  dolfin::uBLASILUPreconditioner::uBLASILUPreconditioner "
+Constructor
+";
+
+%feature("docstring")  dolfin::uBLASILUPreconditioner::solve "
+Solve linear system Ax = b approximately
+";
+
+// Documentation extracted from: (module=la, header=Vector.h)
+%feature("docstring")  dolfin::Vector "
+This class provides the default DOLFIN vector class,
+based on the default DOLFIN linear algebra backend.
+";
+
+%feature("docstring")  dolfin::Vector::Vector "
+**Overloaded versions**
+
+* Vector\ ()
+
+  Create empty vector
+
+* Vector\ (comm, N)
+
+  Create vector of size N
+
+* Vector\ (x)
+
+  Copy constructor
+
+* Vector\ (x)
+
+  Create a Vector from a GenericVetor
+";
+
+%feature("docstring")  dolfin::Vector::copy "
+Return copy of vector
+";
+
+%feature("docstring")  dolfin::Vector::zero "
+Set all entries to zero and keep any sparse structure
+";
+
+%feature("docstring")  dolfin::Vector::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::Vector::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::Vector::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::Vector::init "
+**Overloaded versions**
+
+* init\ (comm, N)
+
+  Initialize vector to size N
+
+* init\ (comm, range)
+
+  Initlialize vector with given ownership range
+
+* init\ (comm, range, ghost_indices)
+
+  Initialize vector with given ownership range and with ghost
+  values
+";
+
+%feature("docstring")  dolfin::Vector::empty "
+Return true if vector is empty
+";
+
+%feature("docstring")  dolfin::Vector::size "
+Return size of vector
+";
+
+%feature("docstring")  dolfin::Vector::local_size "
+Return local size of vector
+";
+
+%feature("docstring")  dolfin::Vector::local_range "
+Return local ownership range of a vector
+";
+
+%feature("docstring")  dolfin::Vector::owns_index "
+Determine whether global vector index is owned by this process
+";
+
+%feature("docstring")  dolfin::Vector::get_local "
+**Overloaded versions**
+
+* get_local\ (block, m, rows)
+
+  Get block of values (values must all live on the local process)
+
+* get_local\ (values)
+
+  Get all values on local process
+";
+
+%feature("docstring")  dolfin::Vector::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::Vector::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::Vector::set_local "
+Set all values on local process
+";
+
+%feature("docstring")  dolfin::Vector::add_local "
+Add values to each entry on local process
+";
+
+%feature("docstring")  dolfin::Vector::gather "
+**Overloaded versions**
+
+* gather\ (x, indices)
+
+  Gather entries into local vector x
+
+* gather\ (x, indices)
+
+  Gather entries into x
+";
+
+%feature("docstring")  dolfin::Vector::gather_on_zero "
+Gather all entries into x on process 0
+";
+
+%feature("docstring")  dolfin::Vector::axpy "
+Add multiple of given vector (AXPY operation)
+";
+
+%feature("docstring")  dolfin::Vector::abs "
+Replace all entries in the vector by their absolute values
+";
+
+%feature("docstring")  dolfin::Vector::inner "
+Return inner product with given vector
+";
+
+%feature("docstring")  dolfin::Vector::norm "
+Return norm of vector
+";
+
+%feature("docstring")  dolfin::Vector::min "
+Return minimum value of vector
+";
+
+%feature("docstring")  dolfin::Vector::max "
+Return maximum value of vector
+";
+
+%feature("docstring")  dolfin::Vector::sum "
+Return sum of values of vector
+";
+
+%feature("docstring")  dolfin::Vector::operator*= "
+**Overloaded versions**
+
+* operator*=\ (a)
+
+  Multiply vector by given number
+
+* operator*=\ (x)
+
+  Multiply vector by another vector pointwise
+";
+
+%feature("docstring")  dolfin::Vector::operator/= "
+Divide vector by given number
+";
+
+%feature("docstring")  dolfin::Vector::operator+= "
+**Overloaded versions**
+
+* operator+=\ (x)
+
+  Add given vector
+
+* operator+=\ (a)
+
+  Add number to all components of a vector
+";
+
+%feature("docstring")  dolfin::Vector::operator-= "
+**Overloaded versions**
+
+* operator-=\ (x)
+
+  Subtract given vector
+
+* operator-=\ (a)
+
+  Subtract number from all components of a vector
+";
+
+%feature("docstring")  dolfin::Vector::operator= "
+**Overloaded versions**
+
+* operator=\ (x)
+
+  Assignment operator
+
+* operator=\ (a)
+
+  Assignment operator
+
+* operator=\ (x)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::Vector::data "
+**Overloaded versions**
+
+* data\ ()
+
+  Return pointer to underlying data (const version)
+
+* data\ ()
+
+  Return pointer to underlying data
+";
+
+%feature("docstring")  dolfin::Vector::factory "
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::Vector::instance "
+**Overloaded versions**
+
+* instance\ ()
+
+  Return concrete instance / unwrap (const version)
+
+* instance\ ()
+
+  Return concrete instance / unwrap (non-const version)
+";
+
+// Documentation extracted from: (module=la, header=Matrix.h)
+%feature("docstring")  dolfin::Matrix "
+This class provides the default DOLFIN matrix class,
+based on the default DOLFIN linear algebra backend.
+";
+
+%feature("docstring")  dolfin::Matrix::Matrix "
+**Overloaded versions**
+
+* Matrix\ ()
+
+  Create empty matrix
+
+* Matrix\ (A)
+
+  Copy constructor
+
+* Matrix\ (A)
+
+  Create a Vector from a GenericVetor
+";
+
+%feature("docstring")  dolfin::Matrix::init "
+Initialize zero tensor using tensor layout
+";
+
+%feature("docstring")  dolfin::Matrix::empty "
+Return true if matrix is empty
+";
+
+%feature("docstring")  dolfin::Matrix::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::Matrix::local_range "
+Return local ownership range
+";
+
+%feature("docstring")  dolfin::Matrix::zero "
+**Overloaded versions**
+
+* zero\ ()
+
+  Set all entries to zero and keep any sparse structure
+
+* zero\ (m, rows)
+
+  Set given rows to zero
+";
+
+%feature("docstring")  dolfin::Matrix::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::Matrix::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::Matrix::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::Matrix::copy "
+Return copy of matrix
+";
+
+%feature("docstring")  dolfin::Matrix::init_vector "
+Resize vector y such that is it compatible with matrix for
+multuplication Ax = b (dim = 0 -> b, dim = 1 -> x) In parallel
+case, size and layout are important.
+";
+
+%feature("docstring")  dolfin::Matrix::get "
+Get block of values
+";
+
+%feature("docstring")  dolfin::Matrix::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::Matrix::add "
+Add block of values
+";
+
+%feature("docstring")  dolfin::Matrix::axpy "
+Add multiple of given matrix (AXPY operation)
+";
+
+%feature("docstring")  dolfin::Matrix::norm "
+Return norm of matrix
+";
+
+%feature("docstring")  dolfin::Matrix::getrow "
+Get non-zero values of given row
+";
+
+%feature("docstring")  dolfin::Matrix::setrow "
+Set values for given row
+";
+
+%feature("docstring")  dolfin::Matrix::ident "
+Set given rows to identity matrix
+";
+
+%feature("docstring")  dolfin::Matrix::set_diagonal "
+Set diagonal of a matrix
+";
+
+%feature("docstring")  dolfin::Matrix::operator*= "
+Multiply matrix by given number
+";
+
+%feature("docstring")  dolfin::Matrix::operator/= "
+Divide matrix by given number
+";
+
+%feature("docstring")  dolfin::Matrix::operator= "
+**Overloaded versions**
+
+* operator=\ (A)
+
+  Assignment operator
+
+* operator=\ (A)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::Matrix::is_symmetric "
+Test if matrix is symmetric
+";
+
+%feature("docstring")  dolfin::Matrix::data "
+Return pointers to underlying compressed storage data.
+See GenericMatrix for documentation.
+";
+
+%feature("docstring")  dolfin::Matrix::factory "
+Return linear algebra backend factory
+";
+
+%feature("docstring")  dolfin::Matrix::instance "
+**Overloaded versions**
+
+* instance\ ()
+
+  Return concrete instance / unwrap (const version)
+
+* instance\ ()
+
+  Return concrete instance / unwrap (non-const version)
+";
+
+// Documentation extracted from: (module=la, header=Scalar.h)
+%feature("docstring")  dolfin::Scalar "
+This class represents a real-valued scalar quantity and
+implements the GenericTensor interface for scalars.
+";
+
+%feature("docstring")  dolfin::Scalar::Scalar "
+Create zero scalar
+";
+
+%feature("docstring")  dolfin::Scalar::init "
+Initialize zero tensor using sparsity pattern
+";
+
+%feature("docstring")  dolfin::Scalar::empty "
+Return true if empty
+";
+
+%feature("docstring")  dolfin::Scalar::rank "
+Return tensor rank (number of dimensions)
+";
+
+%feature("docstring")  dolfin::Scalar::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::Scalar::local_range "
+Return local ownership range
+";
+
+%feature("docstring")  dolfin::Scalar::get "
+Get block of values
+";
+
+%feature("docstring")  dolfin::Scalar::set "
+Set block of values
+";
+
+%feature("docstring")  dolfin::Scalar::add "
+**Overloaded versions**
+
+* add\ (block, num_rows, rows)
+
+  Add block of values
+
+* add\ (block, rows)
+
+  Add block of values
+
+* add\ (block, rows)
+
+  Add block of values
+";
+
+%feature("docstring")  dolfin::Scalar::zero "
+Set all entries to zero and keep any sparse structure
+";
+
+%feature("docstring")  dolfin::Scalar::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::Scalar::mpi_comm "
+Return MPI communicator
+";
+
+%feature("docstring")  dolfin::Scalar::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::Scalar::copy "
+Return copy of scalar
+";
+
+%feature("docstring")  dolfin::Scalar::operator double "
+Cast to double
+";
+
+%feature("docstring")  dolfin::Scalar::operator= "
+Assignment from double
+";
+
+%feature("docstring")  dolfin::Scalar::factory "
+Return a factory for the default linear algebra backend
+";
+
+%feature("docstring")  dolfin::Scalar::getval "
+Get value
+";
+
+// Documentation extracted from: (module=la, header=LinearSolver.h)
+%feature("docstring")  dolfin::LinearSolver "
+This class provides a general solver for linear systems Ax = b.
+";
+
+%feature("docstring")  dolfin::LinearSolver::LinearSolver "
+Create linear solver
+";
+
+%feature("docstring")  dolfin::LinearSolver::set_operator "
+Set the operator (matrix)
+";
+
+%feature("docstring")  dolfin::LinearSolver::set_operators "
+Set the operator (matrix) and preconitioner matrix
+";
+
+%feature("docstring")  dolfin::LinearSolver::solve "
+**Overloaded versions**
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b
+";
+
+%feature("docstring")  dolfin::LinearSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::LinearSolver::update_parameters "
+Update solver parameters (pass parameters down to wrapped implementation)
+";
+
+%feature("docstring")  dolfin::LinearSolver::parameter_type "
+Return parameter type: \"krylov_solver\" or \"lu_solver\"
+";
+
+// Documentation extracted from: (module=la, header=KrylovSolver.h)
+%feature("docstring")  dolfin::KrylovSolver "
+This class defines an interface for a Krylov solver. The
+approproiate solver is chosen on the basis of the matrix/vector
+type.
+";
+
+%feature("docstring")  dolfin::KrylovSolver::KrylovSolver "
+**Overloaded versions**
+
+* KrylovSolver\ (method=\"default\", preconditioner=\"default\")
+
+  Constructor
+
+* KrylovSolver\ (A, method=\"default\", preconditioner=\"default\")
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::KrylovSolver::set_operator "
+Set operator (matrix)
+";
+
+%feature("docstring")  dolfin::KrylovSolver::set_operators "
+Set operator (matrix) and preconditioner matrix
+";
+
+%feature("docstring")  dolfin::KrylovSolver::set_nullspace "
+Set null space of the operator (matrix). This is used to solve
+singular systems
+";
+
+%feature("docstring")  dolfin::KrylovSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (A, x, b)
+
+  Solve linear system Ax = b
+";
+
+%feature("docstring")  dolfin::KrylovSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::KrylovSolver::update_parameters "
+Update solver parameters (pass parameters down to wrapped implementation)
+";
+
+%feature("docstring")  dolfin::KrylovSolver::parameter_type "
+Return parameter type: \"krylov_solver\" or \"lu_solver\"
+";
+
+// Documentation extracted from: (module=la, header=LUSolver.h)
+%feature("docstring")  dolfin::LUSolver "
+LU solver for the built-in LA backends.
+";
+
+%feature("docstring")  dolfin::LUSolver::LUSolver "
+**Overloaded versions**
+
+* LUSolver\ (\"default\")
+
+  Constructor
+
+* LUSolver\ (A, method=\"default\")
+
+  Constructor
+";
+
+%feature("docstring")  dolfin::LUSolver::set_operator "
+Set operator (matrix)
+";
+
+%feature("docstring")  dolfin::LUSolver::solve "
+**Overloaded versions**
+
+* solve\ (x, b)
+
+  Solve linear system Ax = b
+
+* solve\ (A, x, b)
+
+  Solve linear system
+";
+
+%feature("docstring")  dolfin::LUSolver::solve_transpose "
+**Overloaded versions**
+
+* solve_transpose\ (x, b)
+
+  Solve linear system A^Tx = b
+
+* solve_transpose\ (A, x, b)
+
+  Solve linear system
+";
+
+%feature("docstring")  dolfin::LUSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::LUSolver::update_parameters "
+Update solver parameters (pass parameters down to wrapped implementation)
+";
+
+%feature("docstring")  dolfin::LUSolver::parameter_type "
+Return parameter type: \"krylov_solver\" or \"lu_solver\"
+";
+
+// Documentation extracted from: (module=la, header=solve.h)
+%feature("docstring")  dolfin::solve "
+Solve linear system Ax = b
+";
+
+%feature("docstring")  dolfin::list_linear_algebra_backends "
+List available linear algebra backends
+";
+
+%feature("docstring")  dolfin::list_linear_solver_methods "
+List available solver methods for current linear algebra backend
+";
+
+%feature("docstring")  dolfin::list_lu_solver_methods "
+List available LU methods for current linear algebra backend
+";
+
+%feature("docstring")  dolfin::list_krylov_solver_methods "
+List available Krylov methods for current linear algebra backend
+";
+
+%feature("docstring")  dolfin::list_krylov_solver_preconditioners "
+List available preconditioners for current linear algebra
+backend
+";
+
+%feature("docstring")  dolfin::has_lu_solver_method "
+Return true if LU method for the current linear algebra backend is
+available
+";
+
+%feature("docstring")  dolfin::has_krylov_solver_method "
+Return true if Krylov method for the current linear algebra
+backend is available
+";
+
+%feature("docstring")  dolfin::has_krylov_solver_preconditioner "
+Return true if Preconditioner for the current linear algebra
+backend is available
+";
+
+%feature("docstring")  dolfin::linear_algebra_backends "
+Return available linear algebra backends
+";
+
+%feature("docstring")  dolfin::linear_solver_methods "
+Return a list of available solver methods for current linear
+algebra backend
+";
+
+%feature("docstring")  dolfin::lu_solver_methods "
+Return a list of available LU methods for current linear algebra
+backend
+";
+
+%feature("docstring")  dolfin::krylov_solver_methods "
+Return a list of available Krylov methods for current linear
+algebra backend
+";
+
+%feature("docstring")  dolfin::krylov_solver_preconditioners "
+Return a list of available preconditioners for current linear
+algebra backend
+";
+
+%feature("docstring")  dolfin::residual "
+Compute residual ||Ax - b||
+";
+
+%feature("docstring")  dolfin::norm "
+Compute norm of vector. Valid norm types are \"l2\", \"l1\" and
+\"linf\".
+";
+
+%feature("docstring")  dolfin::normalize "
+Normalize vector according to given normalization type
+";
+
+// Documentation extracted from: (module=la, header=BlockVector.h)
+%feature("docstring")  dolfin::BlockVector::BlockVector "
+Constructor
+";
+
+%feature("docstring")  dolfin::BlockVector::copy "
+Return copy of tensor
+";
+
+%feature("docstring")  dolfin::BlockVector::set_block "
+Set function
+";
+
+%feature("docstring")  dolfin::BlockVector::get_block "
+**Overloaded versions**
+
+* get_block\ (i)
+
+  Get sub-vector (const)
+
+* get_block\ ()
+
+  Get sub-vector (non-const)
+";
+
+%feature("docstring")  dolfin::BlockVector::axpy "
+Add multiple of given vector (AXPY operation)
+";
+
+%feature("docstring")  dolfin::BlockVector::inner "
+Return inner product with given vector
+";
+
+%feature("docstring")  dolfin::BlockVector::norm "
+Return norm of vector
+";
+
+%feature("docstring")  dolfin::BlockVector::min "
+Return minimum value of vector
+";
+
+%feature("docstring")  dolfin::BlockVector::max "
+Return maximum value of vector
+";
+
+%feature("docstring")  dolfin::BlockVector::operator*= "
+Multiply vector by given number
+";
+
+%feature("docstring")  dolfin::BlockVector::operator/= "
+Divide vector by given number
+";
+
+%feature("docstring")  dolfin::BlockVector::operator+= "
+Add given vector
+";
+
+%feature("docstring")  dolfin::BlockVector::operator-= "
+Subtract given vector
+";
+
+%feature("docstring")  dolfin::BlockVector::operator= "
+**Overloaded versions**
+
+* operator=\ (x)
+
+  Assignment operator
+
+* operator=\ (a)
+
+  Assignment operator
+";
+
+%feature("docstring")  dolfin::BlockVector::empty "
+Return true if empty
+";
+
+%feature("docstring")  dolfin::BlockVector::size "
+Number of vectors
+";
+
+%feature("docstring")  dolfin::BlockVector::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=la, header=BlockMatrix.h)
+%feature("docstring")  dolfin::BlockMatrix::set_block "
+Set block
+";
+
+%feature("docstring")  dolfin::BlockMatrix::get_block "
+**Overloaded versions**
+
+* get_block\ (i, j)
+
+  Get block (const version)
+
+* get_block\ (i, j)
+
+  Get block
+";
+
+%feature("docstring")  dolfin::BlockMatrix::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::BlockMatrix::zero "
+Set all entries to zero and keep any sparse structure
+";
+
+%feature("docstring")  dolfin::BlockMatrix::apply "
+Finalize assembly of tensor
+";
+
+%feature("docstring")  dolfin::BlockMatrix::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::BlockMatrix::mult "
+Matrix-vector product, y = Ax
+";
+
+%feature("docstring")  dolfin::BlockMatrix::schur_approximation "
+Create a crude explicit Schur approximation  of S = D - C A^-1
+B of  (A B; C  D) If symmetry !=  0, then the  caller promises
+that B = symmetry * transpose(C).
+";
+
+// Documentation extracted from: (module=la, header=LinearOperator.h)
+%feature("docstring")  dolfin::LinearOperator "
+This class defines an interface for linear operators defined
+only in terms of their action (matrix-vector product) and can be
+used for matrix-free solution of linear systems. The linear
+algebra backend is decided at run-time based on the present
+value of the \"linear_algebra_backend\" parameter.
+
+To define a linear operator, users need to inherit from this
+class and overload the function mult(x, y) which defines the
+action of the matrix on the vector x as y = Ax.
+";
+
+%feature("docstring")  dolfin::LinearOperator::LinearOperator "
+Create linear operator
+";
+
+%feature("docstring")  dolfin::LinearOperator::size "
+Return size of given dimension
+";
+
+%feature("docstring")  dolfin::LinearOperator::mult "
+Compute matrix-vector product y = Ax
+";
+
+%feature("docstring")  dolfin::LinearOperator::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::LinearOperator::instance "
+**Overloaded versions**
+
+* instance\ ()
+
+  Return concrete instance / unwrap (const version)
+
+* instance\ ()
+
+  Return concrete instance / unwrap (non-const version)
+";
+
+%feature("docstring")  dolfin::LinearOperator::shared_instance "
+**Overloaded versions**
+
+* shared_instance\ ()
+
+  Return concrete instance / unwrap (const shared pointer version)
+
+* shared_instance\ ()
+
+  Return concrete instance / unwrap (shared pointer version)
+";
+
diff --git a/dolfin/swig/la/la_get_set_items.i b/dolfin/swig/la/la_get_set_items.i
new file mode 100644
index 0000000..b0ab8f6
--- /dev/null
+++ b/dolfin/swig/la/la_get_set_items.i
@@ -0,0 +1,577 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-04-27
+// Last changed: 2013-08-07
+
+// Enum for comparison functions
+enum DolfinCompareType {dolfin_gt, dolfin_ge, dolfin_lt, dolfin_le, dolfin_eq, dolfin_neq};
+
+// Returns the values from a Vector.
+// copied_values are true if the returned values are copied and need clean up.
+std::vector<double> _get_vector_values(dolfin::GenericVector* self)
+{
+  std::vector<double> values;
+  self->get_local(values);
+  return values;
+}
+
+// A contains function for Vectors
+bool _contains(dolfin::GenericVector* self, double value)
+{
+  bool contains = false;
+  std::vector<double> values = _get_vector_values(self);
+
+  // Check if value is in values
+  for (std::size_t i = 0; i < self->size(); i++)
+  {
+    if (fabs(values[i] - value) < DOLFIN_EPS)
+    {
+      contains = true;
+      break;
+    }
+  }
+  return contains;
+}
+
+// A general compare function for Vector vs scalar comparison
+// The function returns a boolean numpy array
+PyObject* _compare_vector_with_value(dolfin::GenericVector* self, double value,
+                                     DolfinCompareType cmp_type)
+{
+  std::size_t i;
+  npy_intp size = self->size();
+  const std::size_t n0 = self->local_range().first;
+
+  // Create the Numpy array
+  PyArrayObject* return_array = (PyArrayObject*)PyArray_ZEROS(1, &size, NPY_BOOL, 0);
+
+  // Get the data array
+  npy_bool* bool_data = (npy_bool *)PyArray_DATA(return_array);
+
+  // Get the values
+  std::vector<double> values = _get_vector_values(self);
+
+  switch (cmp_type)
+  {
+  case dolfin_gt:
+    for ( i = 0; i < self->local_size(); i++)
+      if (values[i] > value)
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_ge:
+    for ( i = 0; i < self->local_size(); i++)
+      if (values[i] >= value)
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_lt:
+    for ( i = 0; i < self->local_size(); i++)
+      if (values[i] < value)
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_le:
+    for ( i = 0; i < self->local_size(); i++)
+      if (values[i] <= value)
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_eq:
+    for ( i = 0; i < self->local_size(); i++)
+      if (values[i] == value)
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_neq:
+    for ( i = 0; i < self->local_size(); i++)
+      if (values[i] != value)
+        bool_data[i+n0] = 1;
+    break;
+  default:
+    throw std::runtime_error("invalid compare type");
+  }
+
+  return PyArray_Return(return_array);
+}
+
+// A general compare function for Vector vs Vector comparison
+// The function returns a boolean numpy array
+PyObject* _compare_vector_with_vector(dolfin::GenericVector* self,
+                                      dolfin::GenericVector* other,
+                                      DolfinCompareType cmp_type)
+{
+  if (self->local_size() != other->local_size())
+    throw std::runtime_error("non matching dimensions");
+
+  std::size_t i;
+  npy_intp size = self->size();
+  const std::size_t n0 = self->local_range().first;
+
+  // Create the Numpy array
+  PyArrayObject* return_array = (PyArrayObject*)PyArray_ZEROS(1, &size,
+                                                              NPY_BOOL, 0);
+
+  // Get the data array
+  npy_bool* bool_data = (npy_bool *)PyArray_DATA(return_array);
+
+  // Get the values
+  std::vector<double> self_values = _get_vector_values(self);
+  std::vector<double> other_values = _get_vector_values(other);
+
+  switch (cmp_type)
+  {
+  case dolfin_gt:
+    for ( i = 0; i < self->local_size(); i++)
+      if (self_values[i] > other_values[i])
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_ge:
+    for ( i = 0; i < self->local_size(); i++)
+      if (self_values[i] >= other_values[i])
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_lt:
+    for ( i = 0; i < self->local_size(); i++)
+      if (self_values[i] < other_values[i])
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_le:
+    for ( i = 0; i < self->local_size(); i++)
+      if (self_values[i] <= other_values[i])
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_eq:
+    for ( i = 0; i < self->local_size(); i++)
+      if (self_values[i] == other_values[i])
+        bool_data[i+n0] = 1;
+    break;
+  case dolfin_neq:
+    for ( i = 0; i < self->local_size(); i++)
+      if (self_values[i] != other_values[i])
+        bool_data[i+n0] = 1;
+    break;
+  default:
+    throw std::runtime_error("invalid compare type");
+  }
+
+  return PyArray_Return(return_array);
+}
+
+// Get single Vector item
+double _get_vector_single_item(dolfin::GenericVector* self, int index)
+{
+  double value;
+  dolfin::la_index i(Indices::check_index(index, self->size()));
+
+  // Check that requested index is owned by this process
+  if (i < self->local_range().first || i >= self->local_range().second)
+    throw std::runtime_error("index must belong to this process, cannot "\
+			     "index off-process entries in a GenericVector");
+
+  self->get_local(&value, 1, &i);
+  return value;
+}
+
+// Get item for slice, list, or numpy array object
+std::shared_ptr<dolfin::GenericVector>
+_get_vector_sub_vector(const dolfin::GenericVector* self,
+                       PyObject* op )
+{
+  Indices* inds;
+  dolfin::la_index* range;
+  dolfin::la_index* indices;
+  std::shared_ptr<dolfin::GenericVector> return_vec;
+  std::size_t m;
+
+  // Get the correct Indices
+  if ((inds = indice_chooser(op, self->size())) == 0)
+  {
+    throw std::runtime_error("index must be either a slice, a list or a "\
+			     "Numpy array of integer");
+  }
+
+  // Fill the return vector
+  try
+  {
+    indices = inds->indices();
+  }
+
+  // We can only throw and catch runtime_errors. These will be caught
+  // by swig.
+  catch (std::runtime_error e)
+  {
+    delete inds;
+    throw;
+  }
+
+  m = inds->size();
+
+  // Create a default Vector
+  return_vec = self->factory().create_vector();
+
+  // Initialize the vector to the size of the indices
+  return_vec->init(MPI_COMM_SELF, m);
+  range = inds->range();
+
+  std::vector<double> values(m);
+  self->get_local(values.data(), m, indices);
+
+  return_vec->set(values.data(), m, range);
+  return_vec->apply("insert");
+
+  delete inds;
+  return return_vec;
+}
+
+// Set items using a GenericVector
+void _set_vector_items_vector(dolfin::GenericVector* self, PyObject* op,
+			      dolfin::GenericVector& other)
+{
+  // Get the correct Indices
+  Indices* inds;
+  dolfin::la_index* range;
+  dolfin::la_index* indices;
+  std::size_t m;
+
+  if ( (inds = indice_chooser(op, self->size())) == 0 )
+    throw std::runtime_error("index must be either a slice, a list or a Numpy array of integer");
+
+  // Check for size of indices
+  if ( inds->size() != other.size() )
+  {
+    delete inds;
+    throw std::runtime_error("non matching dimensions on input");
+  }
+
+  // Get the indices
+  try
+  {
+    indices = inds->indices();
+  }
+
+  // We can only throw and catch runtime_errors. These will be caught by swig.
+  catch (std::runtime_error e)
+  {
+    delete inds;
+    throw;
+  }
+
+  m = inds->size();
+  range = inds->range();
+  std::vector<double> values(m);
+
+  // Get and set values
+  other.get_local(&values[0], m, range);
+  self->set(&values[0], m, indices);
+  self->apply("insert");
+
+  delete inds;
+}
+
+// Set items using an array of floats
+void _set_vector_items_array_of_float( dolfin::GenericVector* self, PyObject* op, PyObject* other )
+{
+  Indices* inds;
+  double* values;
+  dolfin::la_index* indices;
+  std::size_t m;
+  bool casted = false;
+
+  // Check type of values
+  if (!(other != Py_None and PyArray_Check(other)))
+    throw std::runtime_error("expected a contiguous 1D numpy array of numbers");
+
+  PyArrayObject* array_other = reinterpret_cast<PyArrayObject*>(other);
+  if (!(PyArray_ISNUMBER(array_other) and PyArray_NDIM(array_other) == 1 and PyArray_ISCONTIGUOUS(array_other)))
+    throw std::runtime_error("expected a contiguous 1D numpy array of numbers");
+
+  if (PyArray_TYPE(array_other) != NPY_DOUBLE)
+  {
+    casted = true;
+    array_other = reinterpret_cast<PyArrayObject*>(PyArray_Cast(array_other, NPY_DOUBLE));
+  }
+
+  // Get the correct Indices
+  if ( (inds = indice_chooser(op, self->size())) == 0 )
+    throw std::runtime_error("index must be either a slice, a list or a Numpy array of integer");
+
+  // Check for size of indices
+  if (inds->size() != static_cast<std::size_t>(PyArray_DIM(array_other,0)))
+  {
+    delete inds;
+    throw std::runtime_error("non matching dimensions on input");
+  }
+
+  // Fill the vector using the slice and the provided values
+  try
+  {
+    indices = inds->indices();
+  }
+
+  // We can only throw and catch runtime_errors. These will be caught by swig.
+  catch (std::runtime_error e)
+  {
+    delete inds;
+    throw;
+  }
+
+  m = inds->size();
+
+  // Get the contigous data from the numpy array
+  values = static_cast<double*>(PyArray_DATA(array_other));
+  self->set(values, m, indices);
+  self->apply("insert");
+
+  // Clean casted array
+  if (casted)
+  {
+    Py_DECREF(array_other);
+  }
+  delete inds;
+}
+
+// Set item(s) using single value
+void _set_vector_items_value(dolfin::GenericVector* self, PyObject* op, double value)
+{
+  // Get the correct Indices
+  Indices* inds;
+  if ( (inds = indice_chooser(op, self->size())) == 0 )
+  {
+    // If the index is an integer
+    int index;
+    // FIXME: Add a Py_convert_dolfin_la_index
+    if(!Py_convert_int(op, index))
+      throw std::runtime_error("index must be either an integer, a slice, a list or a Numpy array of integer");
+
+    self->setitem(Indices::check_index(index, self->size()), value);
+  }
+  // The op is a Indices
+  else
+  {
+    dolfin::la_index* indices;
+    // Fill the vector using the slice
+    try
+    {
+      indices = inds->indices();
+    }
+    // We can only throw and catch runtime_errors. These will be caught by swig.
+    catch (std::runtime_error e)
+    {
+      delete inds;
+      throw;
+    }
+
+    // Fill and array with the value and call set()
+    std::vector<double> values(inds->size(), value);
+    self->set(&values[0], inds->size(), indices);
+
+    delete inds;
+  }
+  self->apply("insert");
+}
+
+// Get single item from Matrix
+double _get_matrix_single_item(const dolfin::GenericMatrix* self, int m, int n)
+{
+  double value;
+  dolfin::la_index _m(Indices::check_index(m, self->size(0)));
+  dolfin::la_index _n(Indices::check_index(n, self->size(1)));
+  self->get(&value, 1, &_m, 1, &_n);
+  return value;
+ }
+
+// Get items for slice, list, or numpy array object
+std::shared_ptr<dolfin::GenericVector>
+_get_matrix_sub_vector(dolfin::GenericMatrix* self, dolfin::la_index single,
+                       PyObject* op, bool row )
+{
+  // Get the correct Indices
+  Indices* inds;
+  if ( (inds = indice_chooser(op, self->size(row ? 1 : 0))) == 0 )
+    throw std::runtime_error("index must be either a slice, a list or a Numpy array of integer");
+
+  dolfin::la_index* indices;
+  try
+  {
+    // Get the indices in a c array
+    indices = inds->indices();
+  }
+  // We can only throw and catch runtime_errors. These will be caught
+  // by swig.
+  catch (std::runtime_error e)
+  {
+    delete inds;
+    throw;
+  }
+
+  // Create the value array and get the values from the matrix
+  std::vector<double> values(inds->size());
+  if (row)
+  {
+    // If returning a single row
+    self->get(&values[0], 1, &single, inds->size(), indices);
+  }
+  else
+  {
+    // If returning a single column
+    self->get(&values[0], inds->size(), indices, 1, &single);
+  }
+
+  // Create the return vector and set the values
+  std::shared_ptr<dolfin::GenericVector> return_vec
+    = self->factory().create_vector();
+  self->init_vector(*return_vec, 1);
+
+  return_vec->set_local(values);
+  return_vec->apply("insert");
+
+  // Clean up
+  delete inds;
+
+  return return_vec;
+}
+
+/*
+// Get items for slice, list, or numpy array object
+dolfin::GenericMatrix* _get_matrix_sub_matrix(const dolfin::GenericMatrix* self,
+                                              PyObject* row_op, PyObject* col_op )
+{
+  dolfin::GenericMatrix* return_mat;
+  dolfin::uint i, j, k, m, n, nz_i;
+  dolfin::uint* col_index_array;
+  dolfin::uint* tmp_index_array;
+  bool same_indices;
+  Indices* row_inds;
+  Indices* col_inds;
+  double* values;
+
+  // Instantiate the row indices
+  if ( (row_inds = indice_chooser(row_op, self->size(0))) == 0 )
+    throw std::runtime_error("row indices must be either a slice, a list or a Numpy array of integer");
+
+  // The number of rows
+  m = row_inds->size();
+
+  // If None is provided for col_op we assume symmetric indices
+  if (col_op == Py_None)
+  {
+    same_indices = true;
+
+    // Check size of cols
+    if (m > self->size(1))
+    {
+      delete row_inds;
+      throw std::runtime_error("num indices excedes the number of columns");
+    }
+
+    // Symetric rows and columns yield equal column and row indices
+    col_inds = row_inds;
+    n = m;
+
+  }
+  // Non symetric rows and cols
+  else
+  {
+    same_indices = false;
+
+    // Instantiate the col indices
+    if ( (col_inds = indice_chooser(col_op, self->size(1))) == 0 )
+    {
+      delete row_inds;
+      throw std::runtime_error("col indices must be either a slice, a list or a Numpy array of integer");
+    }
+
+    // The number of columns
+    n = col_inds->size();
+
+  }
+
+  // Access the column indices
+  try
+  {
+    col_index_array = col_inds->indices();
+  }
+
+  // We can only throw and catch runtime_errors. These will be caught by swig.
+  catch (std::runtime_error e)
+  {
+    delete row_inds;
+    if (!same_indices)
+      delete col_inds;
+    throw;
+  }
+
+  // Create the return matrix
+  return_mat = self->factory().create_matrix();
+
+  throw std::runtime_error("Python interface for slices needs to be updated.");
+  //return_mat->resize(m, n);
+
+  // Zero the matrix (needed for the uBLASDenseMatrix)
+  return_mat->zero();
+
+  // Fill the get the values from me and set non zero values in return matrix
+  tmp_index_array = new dolfin::uint[n];
+  values = new double[n];
+  for (i = 0; i < row_inds->size(); i++)
+  {
+    // Get all column values
+    k = row_inds->index(i);
+    self->get(values, 1, &k, n, col_index_array);
+    // Collect non zero values
+    nz_i = 0;
+    for (j = 0; j < col_inds->size(); j++)
+    {
+      if ( !(fabs(values[j]) < DOLFIN_EPS) )
+      {
+        tmp_index_array[nz_i] = j;
+        values[nz_i] = values[j];
+        nz_i++;
+      }
+    }
+
+    // Set the non zero values to return matrix
+    return_mat->set(values, 1, &i, nz_i, tmp_index_array);
+  }
+
+  // Clean up
+  delete row_inds;
+  if ( !same_indices )
+    delete col_inds;
+
+  delete[] values;
+  delete[] tmp_index_array;
+
+  return_mat->apply("insert");
+  return return_mat;
+}
+*/
+
+// Set single item in Matrix
+void _set_matrix_single_item(dolfin::GenericMatrix* self, int m, int n, double value )
+{
+  dolfin::la_index _m(Indices::check_index(m, self->size(0)));
+  dolfin::la_index _n(Indices::check_index(n, self->size(1)));
+  self->set(&value, 1, &_m, 1, &_n);
+  self->apply("insert");
+ }
+
+void _set_matrix_items_array_of_float(dolfin::GenericMatrix* self, PyObject* op,
+                                      PyObject* other){}
+
+void _set_matrix_items_matrix(dolfin::GenericMatrix* self, dolfin::GenericMatrix*) {}
+
+void _set_matrix_items_vector(dolfin::GenericMatrix* self, PyObject* op,
+                              dolfin::GenericVector& other){}
diff --git a/dolfin/swig/la/post.i b/dolfin/swig/la/post.i
new file mode 100644
index 0000000..ad60b97
--- /dev/null
+++ b/dolfin/swig/la/post.i
@@ -0,0 +1,1009 @@
+/* -*- C -*- */
+// ===========================================================================
+// SWIG directives for the DOLFIN la kernel module (post)
+//
+// The directives in this file are applied _after_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+// ---------------------------------------------------------------------------
+// Instantiate uBLAS template classes
+// ---------------------------------------------------------------------------
+%template(uBLASSparseMatrix) dolfin::uBLASMatrix<boost::numeric::ublas::compressed_matrix<double, boost::numeric::ublas::row_major> >;
+%template(uBLASDenseMatrix) dolfin::uBLASMatrix<boost::numeric::ublas::matrix<double> >;
+%template(uBLASSparseFactory) dolfin::uBLASFactory<boost::numeric::ublas::compressed_matrix<double, boost::numeric::ublas::row_major> >;
+%template(uBLASDenseFactory) dolfin::uBLASFactory<boost::numeric::ublas::matrix<double> >;
+
+// ---------------------------------------------------------------------------
+// SLEPc specific extension code
+// ---------------------------------------------------------------------------
+#ifdef HAS_SLEPC
+%feature("docstring") dolfin::SLEPcEigenSolver::_get_eigenvalue "Missing docstring";
+%feature("docstring") dolfin::SLEPcEigenSolver::_get_eigenpair "Missing docstring";
+%extend dolfin::SLEPcEigenSolver {
+
+PyObject* _get_eigenvalue(const int i) {
+    double lr, lc;
+    self->get_eigenvalue(lr, lc, i);
+    return Py_BuildValue("dd", lr, lc);
+}
+
+PyObject* _get_eigenpair(dolfin::PETScVector& r, dolfin::PETScVector& c, const int i) {
+    double lr, lc;
+    self->get_eigenpair(lr, lc, r, c, i);
+    return Py_BuildValue("dd", lr, lc);
+}
+
+%pythoncode %{
+    def get_eigenpair(self, i = 0, r_vec = None, c_vec = None,):
+        """Gets the i-th solution of the eigenproblem"""
+        r_vec = r_vec or PETScVector()
+        c_vec = c_vec or PETScVector()
+        lr, lc = self._get_eigenpair(r_vec, c_vec, i)
+        return lr, lc, r_vec, c_vec
+
+    def get_eigenvalue(self, i = 0):
+        """Gets the i-th eigenvalue of the eigenproblem"""
+        return self._get_eigenvalue(i)
+%}
+
+}
+#endif
+
+// ---------------------------------------------------------------------------
+// C++ and Python extension code for BlockVector
+// ---------------------------------------------------------------------------
+%extend dolfin::BlockVector {
+  %pythoncode %{
+
+    def __getitem__(self, i):
+        return self.get_block(i)
+
+    def __setitem__(self, i, m):
+        if not hasattr(self, "_items"):
+            self._items = {}
+        self._items[i] = m
+        self.set_block(i, m)
+
+    def __add__(self, v):
+      a = self.copy()
+      a += v
+      return a
+
+    def __sub__(self, v):
+      a = self.copy()
+      a -= v
+      return a
+
+    def __mul__(self, v):
+      a = self.copy()
+      a *= v
+      return a
+
+    def __rmul__(self, v):
+      return self.__mul__(v)
+  %}
+}
+
+// ---------------------------------------------------------------------------
+// C++ and Python extension code for BlockMatrix
+// ---------------------------------------------------------------------------
+%extend dolfin::BlockMatrix {
+%pythoncode
+%{
+    def __mul__(self, other):
+        v = BlockVector(self.size(0))
+        self.mult(other, v)
+        return v
+
+    def __getitem__(self, t):
+        i,j = t
+        return self.get_block(i, j)
+
+    def __setitem__(self, t, m):
+        if not hasattr(self, "_items"):
+            self._items = {}
+        self._items[t] = m
+        i,j = t
+        self.set_block(i, j, m)
+
+%}
+}
+// ---------------------------------------------------------------------------
+// Indices.i defines helper functions to extract C++ indices from Python
+// indices. These functions are not wrapped to the Python interface. They are
+// only included in the C++ wrapper file.
+//
+// la_get_set_items.i defines helper functions that are wrapped to the
+// Python. These are then used in the extended Python classes. See below.
+// ---------------------------------------------------------------------------
+%{
+#include "dolfin/swig/la/Indices.i"
+#include "dolfin/swig/la/la_get_set_items.i"
+%}
+
+%include "dolfin/swig/la/la_get_set_items.i"
+
+// ---------------------------------------------------------------------------
+// Modify the GenericVector interface
+// ---------------------------------------------------------------------------
+%feature("docstring") dolfin::GenericVector::_scale "Missing docstring";
+%feature("docstring") dolfin::GenericVector::_vec_mul "Missing docstring";
+%extend dolfin::GenericVector
+{
+  void _iadd_scalar(double a)
+  {
+    (*self) += a;
+  }
+
+  void _scale(double a)
+  {
+    (*self) *= a;
+  }
+
+  void _vec_mul(const GenericVector& other)
+  {
+    (*self) *= other;
+  }
+// ---------------------------------------------------------------------------
+  %pythoncode
+  %{
+    def __in_parallel(self):
+        first, last = self.local_range()
+        return first > 0 or len(self) > last
+
+    def __is_compatible(self, other):
+        "Returns True if self, and other are compatible Vectors"
+        if not isinstance(other, GenericVector):
+            return False
+        self_type = get_tensor_type(self)
+        return self_type == get_tensor_type(other)
+
+    def array(self):
+        "Return a numpy array representation of the local part of a Vector"
+        #from numpy import zeros, arange, uint0
+        #v = zeros(self.local_size())
+        #self.get_local(v)
+        #return v
+        return self.get_local()
+
+    def __contains__(self, value):
+        from numpy import isscalar
+        if not isscalar(value):
+            raise TypeError("expected scalar")
+        return _contains(self,value)
+
+    def __gt__(self, value):
+        from numpy import isscalar
+        if isscalar(value):
+            return _compare_vector_with_value(self, value, dolfin_gt)
+        if isinstance(value, GenericVector):
+            return _compare_vector_with_vector(self, value, dolfin_gt)
+        return NotImplemented
+
+    def __ge__(self,value):
+        from numpy import isscalar
+        if isscalar(value):
+            return _compare_vector_with_value(self, value, dolfin_ge)
+        if isinstance(value, GenericVector):
+            return _compare_vector_with_vector(self, value, dolfin_ge)
+        return NotImplemented
+
+    def __lt__(self,value):
+        from numpy import isscalar
+        if isscalar(value):
+            return _compare_vector_with_value(self, value, dolfin_lt)
+        if isinstance(value, GenericVector):
+            return _compare_vector_with_vector(self, value, dolfin_lt)
+        return NotImplemented
+
+    def __le__(self,value):
+        from numpy import isscalar
+        if isscalar(value):
+            return _compare_vector_with_value(self, value, dolfin_le)
+        if isinstance(value, GenericVector):
+            return _compare_vector_with_vector(self, value, dolfin_le)
+        return NotImplemented
+
+    def __eq__(self,value):
+        from numpy import isscalar
+        if isscalar(value):
+            return _compare_vector_with_value(self, value, dolfin_eq)
+        if isinstance(value, GenericVector):
+            return _compare_vector_with_vector(self, value, dolfin_eq)
+        return NotImplemented
+
+    def __neq__(self,value):
+        from numpy import isscalar
+        if isscalar(value):
+            return _compare_vector_with_value(self, value, dolfin_neq)
+        if isinstance(value, GenericVector):
+            return _compare_vector_with_vector(self, value, dolfin_neq)
+        return NotImplemented
+
+    def __neg__(self):
+        ret = self.copy()
+        ret *= -1
+        return ret
+
+    def __delitem__(self,i):
+        raise ValueError("cannot delete Vector elements")
+
+    def __delslice__(self,i,j):
+        raise ValueError("cannot delete Vector elements")
+
+    def __setslice__(self, i, j, values):
+        if i == 0 and (j >= len(self) or j == -1): # slice == whole
+            from numpy import isscalar
+            # No test for equal lengths because this is checked by DOLFIN in _assign
+            if isinstance(values, GenericVector) or isscalar(values):
+                self._assign(values)
+                return
+        self.__setitem__(slice(i, j, 1), values)
+
+    def __getslice__(self, i, j):
+        if i == 0 and (j >= len(self) or j == -1):
+            return self.copy()
+        return self.__getitem__(slice(i, j, 1))
+
+    def __getitem__(self, indices):
+        from numpy import ndarray, integer
+        from types import SliceType
+        if isinstance(indices, (int, integer, long)):
+            return _get_vector_single_item(self, indices)
+        elif isinstance(indices, (SliceType, ndarray, list) ):
+            return as_backend_type(_get_vector_sub_vector(self, indices))
+        else:
+            raise TypeError("expected an int, slice, list or numpy array of integers")
+
+    def __setitem__(self, indices, values):
+        from numpy import ndarray, integer, isscalar
+        from types import SliceType
+        if isinstance(indices, (int, integer, long)):
+            if isscalar(values):
+                return _set_vector_items_value(self, indices, values)
+            else:
+                raise TypeError("provide a scalar to set single item")
+        elif isinstance(indices, (SliceType, ndarray, list)):
+            if isscalar(values):
+                _set_vector_items_value(self, indices, values)
+            elif isinstance(values, GenericVector):
+                _set_vector_items_vector(self, indices, values)
+            elif isinstance(values, ndarray):
+                _set_vector_items_array_of_float(self, indices, values)
+            else:
+                raise TypeError("provide a scalar, GenericVector or numpy array of float to set items in Vector")
+        else:
+            raise TypeError("index must be an int, slice or a list or numpy array of integers")
+
+    def __len__(self):
+        return self.size()
+
+    def __iter__(self):
+        for i in xrange(self.size()):
+            yield _get_vector_single_item(self, i)
+
+    def __add__(self, other):
+        """x.__add__(y) <==> x+y"""
+        from numpy import isscalar
+        if isscalar(other):
+            ret = self.copy()
+            ret._iadd_scalar(other)
+            return ret
+        elif self.__is_compatible(other):
+            ret = self.copy()
+            ret.axpy(1.0, other)
+            return ret
+        return NotImplemented
+
+    def __sub__(self, other):
+        """x.__sub__(y) <==> x-y"""
+        from numpy import isscalar
+        if isscalar(other):
+            ret = self.copy()
+            ret._iadd_scalar(-other)
+            return ret
+        elif self.__is_compatible(other):
+            ret = self.copy()
+            ret.axpy(-1.0, other)
+            return ret
+        return NotImplemented
+
+    def __mul__(self, other):
+        """x.__mul__(y) <==> x*y"""
+        from numpy import isscalar
+        if isscalar(other):
+            ret = self.copy()
+            ret._scale(other)
+            return ret
+        if isinstance(other,GenericVector):
+            ret = self.copy()
+            ret._vec_mul(other)
+            return ret
+        return NotImplemented
+
+    def __div__(self,other):
+        """x.__div__(y) <==> x/y"""
+        from numpy import isscalar
+        if isscalar(other):
+            ret = self.copy()
+            ret._scale(1.0 / other)
+            return ret
+        return NotImplemented
+
+    def __radd__(self,other):
+        """x.__radd__(y) <==> y+x"""
+        return self.__add__(other)
+
+    def __rsub__(self, other):
+        """x.__rsub__(y) <==> y-x"""
+        return self.__sub__(other)
+
+    def __rmul__(self, other):
+        """x.__rmul__(y) <==> y*x"""
+        from numpy import isscalar
+        if isscalar(other):
+            ret = self.copy()
+            ret._scale(other)
+            return ret
+        return NotImplemented
+
+    def __rdiv__(self, other):
+        """x.__rdiv__(y) <==> y/x"""
+        return NotImplemented
+
+    def __iadd__(self, other):
+        """x.__iadd__(y) <==> x+y"""
+        from numpy import isscalar
+        if isscalar(other):
+            self._iadd_scalar(other)
+            return self
+        elif self.__is_compatible(other):
+            self.axpy(1.0, other)
+            return self
+        return NotImplemented
+
+    def __isub__(self, other):
+        """x.__isub__(y) <==> x-y"""
+        from numpy import isscalar
+        if isscalar(other):
+            self._iadd_scalar(-other)
+            return self
+        elif self.__is_compatible(other):
+            self.axpy(-1.0, other)
+            return self
+        return NotImplemented
+
+    def __imul__(self, other):
+        """x.__imul__(y) <==> x*y"""
+        from numpy import isscalar
+        if isscalar(other):
+            self._scale(other)
+            return self
+        if isinstance(other, GenericVector):
+            self._vec_mul(other)
+            return self
+        return NotImplemented
+
+    def __idiv__(self, other):
+        """x.__idiv__(y) <==> x/y"""
+        from numpy import isscalar
+        if isscalar(other):
+            self._scale(1.0 / other)
+            return self
+        return NotImplemented
+
+  %}
+}
+
+// ---------------------------------------------------------------------------
+// Modify the GenericMatrix interface
+// ---------------------------------------------------------------------------
+%feature("docstring") dolfin::GenericMatrix::_scale "Missing docstring";
+%feature("docstring") dolfin::GenericMatrix::_data "Missing docstring";
+%extend dolfin::GenericMatrix
+{
+  void _scale(double a)
+  {
+    (*self)*=a;
+  }
+
+  PyObject* _data()
+  {
+    PyObject* rows = %make_numpy_array(1, size_t)(self->size(0)+1,
+						  boost::tuples::get<0>(self->data()),
+						  false);
+    PyObject* cols = %make_numpy_array(1, size_t)(boost::tuples::get<3>(self->data()),
+						 boost::tuples::get<1>(self->data()),
+						 false);
+    PyObject* values = %make_numpy_array(1, double)(boost::tuples::get<3>(self->data()),
+						    boost::tuples::get<2>(self->data()),
+						    false);
+
+    if ( rows == NULL || cols == NULL || values == NULL)
+      return NULL;
+
+    return Py_BuildValue("NNN", rows, cols, values);
+  }
+// ---------------------------------------------------------------------------
+  %pythoncode
+  %{
+    def __is_compatible(self,other):
+        "Returns True if self, and other are compatible Vectors"
+        if not isinstance(other,GenericMatrix):
+            return False
+        self_type = get_tensor_type(self)
+        return self_type == get_tensor_type(other)
+
+    def array(self):
+        "Return a numpy array representation of Matrix"
+        from numpy import zeros
+        m_range = self.local_range(0);
+        A = zeros((m_range[1] - m_range[0], self.size(1)))
+        for i, row in enumerate(xrange(*m_range)):
+            column, values = self.getrow(row)
+            A[i, column] = values
+        return A
+
+    def sparray(self):
+        "Return a scipy.sparse representation of Matrix"
+        from scipy.sparse import csr_matrix
+        data = self.data(deepcopy=True)
+        C = csr_matrix((data[2], data[1], data[0]))
+        return C
+
+    def data(self, deepcopy=True):
+        """
+        Return arrays to underlaying compresssed row/column storage data
+
+        This method is only available for the uBLAS linear algebra
+        backend.
+
+        *Arguments*
+            deepcopy
+                Return a copy of the data. If set to False a reference
+                to the Matrix need to be kept, otherwise the data will be
+                destroyed together with the destruction of the Matrix
+        """
+        rows, cols, values = self._data()
+        if deepcopy:
+            rows, cols, values = rows.astype(int), cols.astype(int), values.copy()
+        else:
+            _attach_base_to_numpy_array(rows, self)
+            _attach_base_to_numpy_array(cols, self)
+            _attach_base_to_numpy_array(values, self)
+
+        return rows, cols, values
+
+    # FIXME: Getting matrix entries need to be carefully examined, especially for
+    #        parallel objects.
+    """
+    def __getitem__(self,indices):
+        from numpy import ndarray
+        from types import SliceType
+        if not (isinstance(indices, tuple) and len(indices) == 2):
+            raise TypeError, "expected two indices"
+        if not all(isinstance(ind, (int, SliceType, list, ndarray)) for ind in indices):
+            raise TypeError, "an int, slice, list or numpy array as indices"
+
+        if isinstance(indices[0], int):
+            if isinstance(indices[1], int):
+                return _get_matrix_single_item(self,indices[0],indices[1])
+            return as_backend_type(_get_matrix_sub_vector(self,indices[0], indices[1], True))
+        elif isinstance(indices[1],int):
+            return as_backend_type(_get_matrix_sub_vector(self,indices[1], indices[0], False))
+        else:
+            same_indices = id(indices[0]) == id(indices[1])
+
+            if not same_indices and ( type(indices[0]) == type(indices[1]) ):
+                if isinstance(indices[0],(list,SliceType)):
+                    same_indices = indices[0] == indices[1]
+                else:
+                    same_indices = (indices[0] == indices[1]).all()
+
+            if same_indices:
+                return as_backend_type(_get_matrix_sub_matrix(self, indices[0], None))
+            else:
+                return as_backend_type(_get_matrix_sub_matrix(self, indices[0], indices[1]))
+
+    def __setitem__(self, indices, values):
+        from numpy import ndarray, isscalar
+        from types import SliceType
+        if not (isinstance(indices, tuple) and len(indices) == 2):
+            raise TypeError, "expected two indices"
+        if not all(isinstance(ind, (int, SliceType, list, ndarray)) for ind in indices):
+            raise TypeError, "an int, slice, list or numpy array as indices"
+
+        if isinstance(indices[0], int):
+            if isinstance(indices[1], int):
+                if not isscalar(values):
+                    raise TypeError, "expected scalar for single value assigment"
+                _set_matrix_single_item(self, indices[0], indices[1], values)
+            else:
+                raise NotImplementedError
+                if isinstance(values,GenericVector):
+                    _set_matrix_items_vector(self, indices[0], indices[1], values, True)
+                elif isinstance(values,ndarray):
+                    _set_matrix_items_array_of_float(self, indices[0], indices[1], values, True)
+                else:
+                    raise TypeError, "expected a GenericVector or numpy array of float"
+        elif isinstance(indices[1], int):
+            raise NotImplementedError
+            if isinstance(values, GenericVector):
+                _set_matrix_items_vector(self, indices[1], indices[0], values, False)
+            elif isinstance(values, ndarray):
+                _set_matrix_items_array_of_float(self, indices[1], indices[0], values, False)
+            else:
+                raise TypeError, "expected a GenericVector or numpy array of float"
+
+        else:
+            raise NotImplementedError
+            same_indices = id(indices[0]) == id(indices[1])
+
+            if not same_indices and ( type(indices[0]) == type(indices[1]) ):
+                if isinstance(indices[0], (list, SliceType)):
+                    same_indices = indices[0] == indices[1]
+                else:
+                    same_indices = (indices[0] == indices[1]).all()
+
+            if same_indices:
+                if isinstance(values,GenericMatrix):
+                    _set_matrix_items_matrix(self, indices[0], None, values)
+                elif isinstance(values, ndarray) and len(values.shape)==2:
+                    _set_matrix_items_array_of_float(self, indices[0], None, values)
+                else:
+                    raise TypeError, "expected a GenericMatrix or 2D numpy array of float"
+            else:
+                if isinstance(values,GenericMatrix):
+                    _set_matrix_items_matrix(self, indices[0], indices[1], values)
+                elif isinstance(values,ndarray) and len(values.shape) == 2:
+                    _set_matrix_items_array_of_float(self, indices[0], indices[1], values)
+                else:
+                    raise TypeError, "expected a GenericMatrix or 2D numpy array of float"
+    """
+
+    def __add__(self,other):
+        """x.__add__(y) <==> x+y"""
+        if self.__is_compatible(other):
+            ret = self.copy()
+            ret.axpy(1.0, other, False)
+            return ret
+        return NotImplemented
+
+    def __sub__(self,other):
+        """x.__sub__(y) <==> x-y"""
+        if self.__is_compatible(other):
+            ret = self.copy()
+            ret.axpy(-1.0, other, False)
+            return ret
+        return NotImplemented
+
+    def __mul__(self,other):
+        """x.__mul__(y) <==> x*y"""
+        from numpy import ndarray, isscalar
+        if isscalar(other):
+            ret = self.copy()
+            ret._scale(other)
+            return ret
+        elif isinstance(other,GenericVector):
+            matrix_type = get_tensor_type(self)
+            vector_type = get_tensor_type(other)
+            if vector_type not in _matrix_vector_mul_map[matrix_type]:
+                raise TypeError("Provide a Vector which can be as_backend_typeed to ''"%vector_type.__name__)
+            if type(other) == Vector:
+                ret = Vector()
+            else:
+                ret = vector_type()
+            self.mult(other, ret)
+            return ret
+        elif isinstance(other, ndarray):
+            if len(other.shape) != 1:
+                raise ValueError("Provide an 1D NumPy array")
+            vec_size = other.shape[0]
+            if vec_size != self.size(1):
+                raise ValueError("Provide a NumPy array with length %d"%self.size(1))
+            vec_type = _matrix_vector_mul_map[get_tensor_type(self)][0]
+            vec = vec_type()
+            vec.init(self.mpi_comm(), vec_size)
+            vec.set_local(other)
+            vec.apply("insert")
+            result_vec = vec.copy()
+            self.mult(vec, result_vec)
+            #ret = other.copy()
+            #result_vec.get_local(ret)
+            #return ret
+            return result_vec.get_local()
+        return NotImplemented
+
+    def __div__(self,other):
+        """x.__div__(y) <==> x/y"""
+        from numpy import isscalar
+        if isscalar(other):
+            ret = self.copy()
+            ret._scale(1.0/other)
+            return ret
+        return NotImplemented
+
+    def __radd__(self,other):
+        """x.__radd__(y) <==> y+x"""
+        return self.__add__(other)
+
+    def __rsub__(self,other):
+        """x.__rsub__(y) <==> y-x"""
+        return self.__sub__(other)
+
+    def __rmul__(self,other):
+        """x.__rmul__(y) <==> y*x"""
+        from numpy import isscalar
+        if isscalar(other):
+            ret = self.copy()
+            ret._scale(other)
+            return ret
+        return NotImplemented
+
+    def __rdiv__(self,other):
+        """x.__rdiv__(y) <==> y/x"""
+        return NotImplemented
+
+    def __iadd__(self,other):
+        """x.__iadd__(y) <==> x+y"""
+        if self.__is_compatible(other):
+            self.axpy(1.0, other, False)
+            return self
+        return NotImplemented
+
+    def __isub__(self,other):
+        """x.__isub__(y) <==> x-y"""
+        if self.__is_compatible(other):
+            self.axpy(-1.0, other, False)
+            return self
+        return NotImplemented
+
+    def __imul__(self,other):
+        """x.__imul__(y) <==> x*y"""
+        from numpy import isscalar
+        if isscalar(other):
+            self._scale(other)
+            return self
+        return NotImplemented
+
+    def __idiv__(self,other):
+        """x.__idiv__(y) <==> x/y"""
+        from numpy import isscalar
+        if isscalar(other):
+            self._scale(1.0 / other)
+            return self
+        return NotImplemented
+
+  %}
+}
+
+// ---------------------------------------------------------------------------
+// Macro with C++ and Python extension code for GenericVector types in PyDOLFIN
+// that are able to return a pointer to the underlaying contigious data
+// only used for the uBLAS backend
+// ---------------------------------------------------------------------------
+%define LA_VEC_DATA_ACCESS(VEC_TYPE)
+%feature("docstring") dolfin::VEC_TYPE::_data "Missing docstring";
+%extend dolfin::VEC_TYPE
+{
+  PyObject* _data()
+  {
+    return %make_numpy_array(1, double)(self->size(), self->data(), false);
+  }
+
+  %pythoncode
+  %{
+    def data(self, deepcopy=True):
+        """
+        Return an array to underlaying data
+
+        This method is only available for the uBLAS linear algebra
+        backend.
+
+        *Arguments*
+            deepcopy
+                Return a copy of the data. If set to False a reference
+                to the Matrix need to be kept, otherwise the data will be
+                destroyed together with the destruction of the Matrix
+        """
+        ret = self._data()
+        if deepcopy:
+            ret = ret.copy()
+        else:
+            _attach_base_to_numpy_array(ret, self)
+
+        return ret
+  %}
+}
+%enddef
+
+// ---------------------------------------------------------------------------
+// Macro with code for down casting GenericTensors
+// ---------------------------------------------------------------------------
+%define AS_BACKEND_TYPE_MACRO(TENSOR_TYPE)
+%inline %{
+bool _has_type_ ## TENSOR_TYPE(const std::shared_ptr<dolfin::GenericTensor> tensor)
+{ return dolfin::has_type<dolfin::TENSOR_TYPE>(*tensor); }
+
+std::shared_ptr<dolfin::TENSOR_TYPE> _as_backend_type_ ## TENSOR_TYPE(const std::shared_ptr<dolfin::GenericTensor> tensor)
+{ return dolfin::as_type<dolfin::TENSOR_TYPE>(tensor); }
+%}
+
+%pythoncode %{
+_has_type_map[TENSOR_TYPE] = _has_type_ ## TENSOR_TYPE
+_as_backend_type_map[TENSOR_TYPE] = _as_backend_type_ ## TENSOR_TYPE
+%}
+
+%enddef
+
+// ---------------------------------------------------------------------------
+// Run the data macro
+// ---------------------------------------------------------------------------
+LA_VEC_DATA_ACCESS(uBLASVector)
+LA_VEC_DATA_ACCESS(Vector)
+
+// ---------------------------------------------------------------------------
+// Define Python lookup maps for as_backend_typeing
+// ---------------------------------------------------------------------------
+%pythoncode %{
+_has_type_map = {}
+_as_backend_type_map = {}
+# A map with matrix types as keys and list of possible vector types as values
+_matrix_vector_mul_map = {}
+%}
+
+// ---------------------------------------------------------------------------
+// Run the downcast macro
+// ---------------------------------------------------------------------------
+AS_BACKEND_TYPE_MACRO(uBLASVector)
+
+// NOTE: Silly SWIG force us to describe the type explicit for uBLASMatrices
+%inline %{
+bool _has_type_uBLASDenseMatrix(const std::shared_ptr<dolfin::GenericTensor> tensor)
+{ return dolfin::has_type<dolfin::uBLASMatrix<boost::numeric::ublas::matrix<double> > >(*tensor); }
+
+std::shared_ptr<dolfin::uBLASMatrix<boost::numeric::ublas::matrix<double> > > _as_backend_type_uBLASDenseMatrix(const std::shared_ptr<dolfin::GenericTensor> tensor)
+{ return dolfin::as_type<dolfin::uBLASMatrix<boost::numeric::ublas::matrix<double> > >(tensor); }
+
+bool _has_type_uBLASSparseMatrix(const std::shared_ptr<dolfin::GenericTensor > tensor)
+{ return dolfin::has_type<dolfin::uBLASMatrix<boost::numeric::ublas::compressed_matrix<double, boost::numeric::ublas::row_major> > >(*tensor); }
+
+const std::shared_ptr<dolfin::uBLASMatrix<boost::numeric::ublas::compressed_matrix<double, boost::numeric::ublas::row_major> > > _as_backend_type_uBLASSparseMatrix(const std::shared_ptr<dolfin::GenericTensor> tensor)
+{ return dolfin::as_type<dolfin::uBLASMatrix<boost::numeric::ublas::compressed_matrix<double, boost::numeric::ublas::row_major> > >(tensor); }
+%}
+
+%pythoncode %{
+_has_type_map[uBLASDenseMatrix] = _has_type_uBLASDenseMatrix
+_as_backend_type_map[uBLASDenseMatrix] = _as_backend_type_uBLASDenseMatrix
+_has_type_map[uBLASSparseMatrix] = _has_type_uBLASSparseMatrix
+_as_backend_type_map[uBLASSparseMatrix] = _as_backend_type_uBLASSparseMatrix
+%}
+
+// ---------------------------------------------------------------------------
+// Fill lookup map
+// ---------------------------------------------------------------------------
+%pythoncode %{
+_matrix_vector_mul_map[uBLASSparseMatrix] = [uBLASVector]
+_matrix_vector_mul_map[uBLASDenseMatrix]  = [uBLASVector]
+%}
+
+// ---------------------------------------------------------------------------
+// Run backend specific macros
+// ---------------------------------------------------------------------------
+#ifdef HAS_PETSC
+AS_BACKEND_TYPE_MACRO(PETScVector)
+AS_BACKEND_TYPE_MACRO(PETScMatrix)
+
+%pythoncode %{
+_matrix_vector_mul_map[PETScMatrix] = [PETScVector]
+%}
+
+#ifdef HAS_PETSC4PY
+// Override default .mat() and .vec() calls.
+// These are wrapped up by petsc4py typemaps so that
+// we see a petsc4py object on the python side.
+
+%feature("docstring") dolfin::PETScBaseMatrix::mat "Return petsc4py representation of PETSc Mat";
+%extend dolfin::PETScBaseMatrix
+{
+  void mat(Mat &A)
+  { A = self->mat(); }
+}
+
+%feature("docstring") dolfin::PETScVector::vec "Return petsc4py representation of PETSc Vec";
+%extend dolfin::PETScVector
+{
+  void vec(Vec&v)
+  { v = self->vec(); }
+}
+
+%feature("docstring") dolfin::PETScKrylovSolver::ksp "Return petsc4py representation of PETSc KSP solver";
+%extend dolfin::PETScKrylovSolver
+{
+  void ksp(KSP& ksp)
+  { ksp = self->ksp(); }
+}
+
+%feature("docstring") dolfin::PETScLUSolver::ksp "Return petsc4py representation of PETSc LU solver";
+%extend dolfin::PETScLUSolver
+{
+  void ksp(KSP& ksp)
+  { ksp = self->ksp(); }
+}
+
+%feature("docstring") dolfin::PETScSNESSolver::snes "Return petsc4py representation of PETSc SNES solver";
+%extend dolfin::PETScSNESSolver
+{
+  void snes(SNES& snes)
+  { snes = self->snes(); }
+}
+
+#else
+%extend dolfin::PETScBaseMatrix {
+    %pythoncode %{
+        def mat(self):
+            common.dolfin_error("dolfin/swig/la/post.i",
+                                "access PETScMatrix objects in python",
+                                "dolfin must be configured with petsc4py enabled")
+            return None
+    %}
+}
+
+%extend dolfin::PETScVector {
+    %pythoncode %{
+        def vec(self):
+            common.dolfin_error("dolfin/swig/la/post.i",
+                                "access PETScVector objects in python",
+                                "dolfin must be configured with petsc4py enabled")
+            return None
+    %}
+}
+
+%extend dolfin::PETScKrylovSolver {
+    %pythoncode %{
+        def ksp(self):
+            common.dolfin_error("dolfin/swig/la/post.i",
+                                "access PETScKrylovSolver objects in python",
+                                "dolfin must be configured with petsc4py enabled")
+            return None
+    %}
+}
+
+%extend dolfin::PETScLUSolver {
+    %pythoncode %{
+        def ksp(self):
+            common.dolfin_error("dolfin/swig/la/post.i",
+                                "access PETScLUSolver objects in python",
+                                "dolfin must be configured with petsc4py enabled")
+            return None
+    %}
+}
+
+%extend dolfin::PETScSNESSolver {
+    %pythoncode %{
+        def snes(self):
+            common.dolfin_error("dolfin/swig/la/post.i",
+                                "access PETScSNESSolver objects in python",
+                                "dolfin must be configured with petsc4py enabled")
+            return None
+    %}
+}
+
+#endif  // HAS_PETSC4PY
+#endif  // HAS_PETSC
+
+#ifdef HAS_TRILINOS
+
+%runtime%{
+#include <Teuchos_RCP.hpp>
+#include <Epetra_CrsGraph.h>
+#include <Epetra_FECrsMatrix.h>
+#include <Epetra_FEVector.h>
+%}
+
+AS_BACKEND_TYPE_MACRO(EpetraVector)
+AS_BACKEND_TYPE_MACRO(EpetraMatrix)
+
+%pythoncode %{
+_matrix_vector_mul_map[EpetraMatrix] = [EpetraVector]
+%}
+
+%extend dolfin::EpetraMatrix{
+  Teuchos::RCP<Epetra_FECrsMatrix> _mat ()
+  {
+    Epetra_FECrsMatrix* tmp = self->mat().get();
+    return Teuchos::RCP<Epetra_FECrsMatrix>(tmp, false);
+  }
+
+%pythoncode %{
+    def mat(self):
+        "Return the Epetra_FECrsMatrix"
+        # Try importing PyTrilinos
+        try:
+            import PyTrilinos
+        except:
+            common.dolfin_error("dolfin/swig/la/post.i",
+                                "import PyTrilinos before accessing underlying Matrix",
+                                "PyTrilinos is not installed")
+
+        A = self._mat()
+
+        # Store the tensor to avoid garbage collection
+        # Need to be in try clause as this wont work when PyTrilinos
+        # is not installed
+        try:
+            A._org_vec = self
+        except:
+            pass
+
+        return A
+%}
+}
+
+%extend dolfin::EpetraVector{
+  Teuchos::RCP<Epetra_FEVector> _vec ()
+  {
+    Epetra_FEVector* tmp = self->vec().get();
+    return Teuchos::RCP<Epetra_FEVector>(tmp, false);
+  }
+
+%pythoncode %{
+    def vec(self):
+        "Return the Epetra_FEVector"
+        try:
+            import PyTrilinos
+        except:
+            common.dolfin_error("dolfin/swig/la/post.i",
+                                "import PyTrilinos before accessing underlying Vector",
+                                "PyTrilinos is not installed")
+        v = self._vec()
+
+        # Store the tensor to avoid garbage collection
+        # Need to be in try clause as this wont work when PyTrilinos
+        # is not installed
+        try:
+            v._org_vec = self
+        except:
+            pass
+
+        return v
+%}
+}
+#endif
+
+// ---------------------------------------------------------------------------
+// Dynamic wrappers for GenericTensor::as_backend_type and GenericTensor::has_type,
+// using dict of tensor types to select from C++ template instantiations
+// ---------------------------------------------------------------------------
+%pythoncode %{
+def get_tensor_type(tensor):
+    "Return the concrete subclass of tensor."
+    for k, v in _has_type_map.items():
+        if v(tensor):
+            return k
+    common.dolfin_error("dolfin/swig/la/post.i",
+                        "extract backend type for %s" % type(tensor).__name__,
+                        "This apparently doesn't work for uBLAS..")
+
+def has_type(tensor, subclass):
+    "Return wether tensor is of the given subclass."
+    global _has_type_map
+    assert _has_type_map
+    assert subclass in _has_type_map
+    return bool(_has_type_map[subclass](tensor))
+
+def as_backend_type(tensor, subclass=None):
+    "Cast tensor to the given subclass, passing the wrong class is an error."
+    global _as_backend_type_map
+    assert _as_backend_type_map
+    if subclass is None:
+        subclass = get_tensor_type(tensor)
+    assert subclass in _as_backend_type_map
+    ret = _as_backend_type_map[subclass](tensor)
+
+    # Store the tensor to avoid garbage collection
+    ret._org_upcasted_tensor = tensor
+    return ret
+
+%}
diff --git a/dolfin/swig/la/pre.i b/dolfin/swig/la/pre.i
new file mode 100644
index 0000000..5ff181f
--- /dev/null
+++ b/dolfin/swig/la/pre.i
@@ -0,0 +1,352 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Jansson
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg 2007-2012
+// Modified by Garth Wells 2008-2011
+// Modified by Ola Skavhaug 2008-2009
+// Modified by Kent-Andre Mardal 2008
+// Modified by Martin Sandve Alnaes 2008
+// Modified by Johan Hake 2008-2009
+//
+// First added:  2007-01-21
+// Last changed: 2011-04-20
+
+//=============================================================================
+// SWIG directives for the DOLFIN la kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Ignore warnings about nested classes. 
+//-----------------------------------------------------------------------------
+%warnfilter(325) dolfin::GenericLinearAlgebraFactory::NotImplementedLinearOperator;
+
+//-----------------------------------------------------------------------------
+// Rename solve so it wont clash with solve from fem
+//-----------------------------------------------------------------------------
+%rename(la_solve) dolfin::solve;
+
+//-----------------------------------------------------------------------------
+// Ignore the get_eigen{value,pair} methods (reimplemented in post)
+//-----------------------------------------------------------------------------
+#ifdef HAS_SLEPC
+%ignore dolfin::SLEPcEigenSolver::get_eigenvalue;
+%ignore dolfin::SLEPcEigenSolver::get_eigenpair;
+#endif
+
+//-----------------------------------------------------------------------------
+// Fix problem with missing uBLAS namespace
+//-----------------------------------------------------------------------------
+%inline %{
+  namespace boost{ namespace numeric{ namespace ublas{}}}
+%}
+
+//-----------------------------------------------------------------------------
+// Modify VectorSpaceBasis::operator[]
+//-----------------------------------------------------------------------------
+%rename(_sub) dolfin::VectorSpaceBasis::operator[];
+
+//-----------------------------------------------------------------------------
+// Ignore some operator=
+//-----------------------------------------------------------------------------
+%ignore dolfin::GenericTensor::operator=;
+%ignore dolfin::BlockVector::operator=;
+%ignore dolfin::SubVector::operator=;
+%ignore dolfin::SubMatrix::operator=;
+%ignore dolfin::SubMatrix::operator=;
+
+//-----------------------------------------------------------------------------
+// Ignore free function norm(), reimplemented in Python
+//-----------------------------------------------------------------------------
+%ignore dolfin::norm;
+
+//-----------------------------------------------------------------------------
+// Rename set and get from BlockFoo
+//-----------------------------------------------------------------------------
+//%rename(_get) dolfin::BlockVector::get;
+//%rename(_set) dolfin::BlockVector::set;
+//%rename(_get) dolfin::BlockMatrix::get;
+//%rename(_set) dolfin::BlockMatrix::set;
+
+//-----------------------------------------------------------------------------
+// Modify the Scalar interface
+//-----------------------------------------------------------------------------
+%rename(__float__) dolfin::Scalar::operator double;
+%rename(assign) dolfin::Scalar::operator=;
+
+//-----------------------------------------------------------------------------
+// Typemaps for GenericMatrix get and set functions
+//-----------------------------------------------------------------------------
+%typemap(in) const double* block = double* _array;
+%typemap(in) (std::size_t m, const dolfin::la_index* rows) = (std::size_t _array_dim, dolfin::la_index* _array);
+%typemap(in) (std::size_t n, const dolfin::la_index* cols) = (std::size_t _array_dim, dolfin::la_index* _array);
+
+%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY) (std::size_t m, const dolfin::la_index* rows)
+{
+  // rows typemap
+  $1 = PyArray_Check($input);
+}
+
+%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY) (std::size_t n, const dolfin::la_index* cols)
+{
+  // cols typemap
+  $1 = PyArray_Check($input);
+}
+
+//-----------------------------------------------------------------------------
+// Ignore low level interface
+//-----------------------------------------------------------------------------
+%ignore dolfin::LinearAlgebraObject::instance;
+%ignore dolfin::GenericTensor::get(double*, const  dolfin::la_index*, const dolfin::la_index * const *) const;
+%ignore dolfin::GenericTensor::set(const double* , const dolfin::la_index* , const dolfin::la_index * const *);
+%ignore dolfin::GenericTensor::add(const double* , const dolfin::la_index* , const dolfin::la_index * const *);
+%ignore dolfin::PETScLinearOperator::wrapper;
+
+//-----------------------------------------------------------------------------
+%ignore dolfin::uBLASVector::operator ()(std::size_t i) const;
+//-----------------------------------------------------------------------------
+
+//-----------------------------------------------------------------------------
+// Ignore wrapping of the Set variable (Might add typemap for this in future...)
+//-----------------------------------------------------------------------------
+%ignore dolfin::SparsityPattern::diagonal_pattern;
+%ignore dolfin::SparsityPattern::off_diagonal_pattern;
+
+//-----------------------------------------------------------------------------
+// Declare newobject for vector and matrix get functions
+//-----------------------------------------------------------------------------
+%newobject _get_vector_sub_vector;
+//%newobject _get_matrix_sub_vector;
+//%newobject _get_matrix_sub_matrix;
+
+//-----------------------------------------------------------------------------
+// Modify the GenericVector interface
+//-----------------------------------------------------------------------------
+%rename(_assign) dolfin::GenericVector::operator=;
+
+%ignore dolfin::GenericVector::operator[];
+%ignore dolfin::GenericVector::operator*=;
+%ignore dolfin::GenericVector::operator/=;
+%ignore dolfin::GenericVector::operator+=;
+%ignore dolfin::GenericVector::operator-=;
+%ignore dolfin::GenericVector::getitem;
+%ignore dolfin::GenericVector::setitem;
+
+//-----------------------------------------------------------------------------
+// Ignore the get and set functions used for blocks
+// NOTE: The %ignore has to be set using the actual type used in the declaration
+// so we cannot use dolfin::uint or unsigned int for uint. Strange...
+//-----------------------------------------------------------------------------
+%ignore dolfin::GenericVector::get(double*, std::size_t, const dolfin::la_index*) const;
+%ignore dolfin::GenericVector::set(const double* , std::size_t m, const dolfin::la_index*);
+
+%ignore dolfin::GenericVector::data() const;
+%ignore dolfin::GenericVector::data();
+
+//-----------------------------------------------------------------------------
+// Modify the GenericMatrix interface
+//-----------------------------------------------------------------------------
+%rename(assign) dolfin::GenericMatrix::operator=;
+
+%ignore dolfin::GenericMatrix::operator*=;
+%ignore dolfin::GenericMatrix::operator/=;
+%ignore dolfin::GenericMatrix::operator+=;
+%ignore dolfin::GenericMatrix::operator-=;
+
+%ignore dolfin::GenericMatrix::set(const double*, const dolfin::la_index*,
+                                   const dolfin::la_index * const *);
+%ignore dolfin::GenericMatrix::add(const double*, const dolfin::la_index*,
+                                   const dolfin::la_index * const * rows);
+%ignore dolfin::GenericMatrix::get(double*, const dolfin::la_index*,
+                                   const dolfin::la_index * const *) const;
+%ignore dolfin::GenericMatrix::data;
+%ignore dolfin::GenericMatrix::getitem;
+%ignore dolfin::GenericMatrix::setitem;
+%ignore dolfin::GenericMatrix::operator();
+
+
+//-----------------------------------------------------------------------------
+// Modify uBLAS matrices, as these are not renamed by the GenericMatrix rename
+//-----------------------------------------------------------------------------
+%rename(assign) dolfin::uBLASMatrix<boost::numeric::ublas::matrix<double> >::operator=;
+%rename(assign) dolfin::uBLASMatrix<boost::numeric::ublas::compressed_matrix<double, boost::numeric::ublas::row_major> >::operator=;
+
+// Ignore reference version of constructor
+%ignore dolfin::PETScKrylovSolver(std::string, PETScPreconditioner&);
+%ignore dolfin::PETScKrylovSolver(std::string, PETScUserPreconditioner&);
+%ignore dolfin::PaStiXLUSolver(const STLMatrix& A);
+
+//-----------------------------------------------------------------------------
+// PETSc/SLEPc backend
+//-----------------------------------------------------------------------------
+#ifdef HAS_PETSC
+// Ignore MatNullSpace not properly wrapped by SWIG
+%ignore dolfin::PETScPreconditioner::near_nullspace() const;
+
+// Only ignore C++ accessors if petsc4py is enabled
+#ifdef HAS_PETSC4PY
+%ignore dolfin::PETScVector::vec() const;
+%ignore dolfin::PETScBaseMatrix::mat() const;
+%ignore dolfin::PETScKrylovSolver::ksp() const;
+%ignore dolfin::PETScLUSolver::ksp() const;
+%ignore dolfin::PETScSNESSolver::snes() const;
+#else
+// Ignore everything
+%ignore dolfin::PETScVector::vec;
+%ignore dolfin::PETScBaseMatrix::mat;
+%ignore dolfin::PETScKrylovSolver::ksp;
+%ignore dolfin::PETScLUSolver::ksp;
+%ignore dolfin::PETScSNESSolver::snes;
+#endif
+#endif
+
+#ifdef HAS_SLEPC
+%ignore dolfin::SLEPcEigenSolver(const PETScMatrix&);
+%ignore dolfin::SLEPcEigenSolver(const PETScMatrix&, const PETScMatrix&);
+#endif
+
+//-----------------------------------------------------------------------------
+// Trilinos backend
+//-----------------------------------------------------------------------------
+#ifdef HAS_TRILINOS
+%ignore dolfin::EpetraMatrix::mat;
+%ignore dolfin::EpetraVector::vec;
+%ignore dolfin::EpetraMatrix(std::shared_ptr<Epetra_FECrsMatrix> A);
+
+//-----------------------------------------------------------------------------
+// Typemaps for Teuchos::RCP (Trilinos backend)
+//-----------------------------------------------------------------------------
+
+%define %RCP_to_const_ref_typemap(Type)
+%typemap(in) const Type&
+{
+  int res = SWIG_ConvertPtr($input, (void**)&$1, $1_descriptor, 0);
+  if (!SWIG_IsOK(res))
+  {
+    Teuchos::RCP<Type> *rcp_ptr;
+    int newmem = 0;
+    res = SWIG_ConvertPtrAndOwn($input, (void**)&rcp_ptr,
+                                $descriptor(Teuchos::RCP<Type>*), 0, &newmem);
+    if (!SWIG_IsOK(res))
+      SWIG_exception_fail(SWIG_ArgError(res), "in method '$symname', argument $argnum of type '$type'");
+    if (rcp_ptr)
+    {
+      $1 = rcp_ptr->get();
+      if (newmem & SWIG_CAST_NEW_MEMORY)
+        delete rcp_ptr;
+    }
+    else
+      $1 = NULL;
+  }
+  if (!$1)
+    SWIG_exception_fail(SWIG_ValueError, "invalid null reference in method '$symname', argument $argnum of type '$type'");
+}
+
+
+%typecheck(SWIG_TYPECHECK_POINTER) const Type&
+{
+  void *dummy;
+  int res;
+  res = SWIG_ConvertPtr($input, &dummy, $1_descriptor, 0);
+  if (!SWIG_IsOK(res))
+  {
+    Teuchos::RCP<Type> *rcp_ptr;
+    int newmem = 0;
+    res = SWIG_ConvertPtrAndOwn($input, (void**)&rcp_ptr,
+                                $descriptor(Teuchos::RCP<Type>*), 0, &newmem);
+    if (rcp_ptr && (newmem & SWIG_CAST_NEW_MEMORY))
+      delete rcp_ptr;
+  }
+  $1 = SWIG_CheckState(res);
+}
+%enddef
+
+%RCP_to_const_ref_typemap(Epetra_CrsGraph);
+%RCP_to_const_ref_typemap(Epetra_BlockMap);
+%RCP_to_const_ref_typemap(Teuchos::ParameterList);
+#endif
+
+//-----------------------------------------------------------------------------
+// Add director classes
+//-----------------------------------------------------------------------------
+%feature("director") dolfin::PETScUserPreconditioner;
+
+%feature("director") dolfin::PETScLinearOperator;
+%feature("nodirector") dolfin::PETScLinearOperator::str;
+%feature("nodirector") dolfin::PETScLinearOperator::wrapper;
+
+%feature("director") dolfin::uBLASLinearOperator;
+%feature("nodirector") dolfin::uBLASLinearOperator::str;
+
+%feature("director") dolfin::LinearOperator;
+%feature("nodirector") dolfin::LinearOperator::instance;
+%feature("nodirector") dolfin::LinearOperator::shared_instance;
+
+//-----------------------------------------------------------------------------
+// Director typemaps for dolfin::GenericVector
+//-----------------------------------------------------------------------------
+%typemap(directorin, fragment="NoDelete") dolfin::GenericVector&
+{
+  // Director in dolfin::GenericVector&
+  std::shared_ptr< dolfin::GenericVector > *smartresult = new std::shared_ptr< dolfin::GenericVector >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::GenericVector > *), SWIG_POINTER_OWN);
+}
+
+%typemap(directorin, fragment="NoDelete") const dolfin::GenericVector&
+{
+  // Director in const dolfin::GenericVector&
+  std::shared_ptr< const dolfin::GenericVector > *smartresult = new std::shared_ptr< const dolfin::GenericVector >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::GenericVector > *), SWIG_POINTER_OWN);
+}
+
+//-----------------------------------------------------------------------------
+// Director typemaps for dolfin::PETScVector
+//-----------------------------------------------------------------------------
+%typemap(directorin, fragment="NoDelete") dolfin::PETScVector&
+{
+  // Director in dolfin::PETScVector&
+  std::shared_ptr< dolfin::PETScVector > *smartresult
+    = new std::shared_ptr< dolfin::PETScVector >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::PETScVector > *), SWIG_POINTER_OWN);
+}
+
+%typemap(directorin, fragment="NoDelete") const dolfin::PETScVector&
+{
+  // Director in const dolfin::PETScVector&
+  std::shared_ptr< const dolfin::PETScVector > *smartresult
+    = new std::shared_ptr< const dolfin::PETScVector >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::PETScVector > *), SWIG_POINTER_OWN);
+}
+
+//-----------------------------------------------------------------------------
+// Director typemaps for dolfin::uBLASVector
+//-----------------------------------------------------------------------------
+%typemap(directorin, fragment="NoDelete") dolfin::uBLASVector&
+{
+  // Director in dolfin::uBLASVector&
+  std::shared_ptr< dolfin::uBLASVector > *smartresult = new std::shared_ptr< dolfin::uBLASVector >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::uBLASVector > *), SWIG_POINTER_OWN);
+}
+
+%typemap(directorin, fragment="NoDelete") const dolfin::uBLASVector& {
+  // Director in const dolfin::uBLASVector&
+  std::shared_ptr< const dolfin::uBLASVector > *smartresult = new std::shared_ptr< const dolfin::uBLASVector >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::uBLASVector > *), SWIG_POINTER_OWN);
+}
diff --git a/dolfin/swig/log/docstrings.i b/dolfin/swig/log/docstrings.i
new file mode 100644
index 0000000..61194c7
--- /dev/null
+++ b/dolfin/swig/log/docstrings.i
@@ -0,0 +1,400 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=log, header=log.h)
+%feature("docstring")  dolfin::info "
+**Overloaded versions**
+
+* info\ (msg, ...)
+
+  The DOLFIN log system provides the following set of functions for
+  uniform handling of log messages, warnings and errors. In addition,
+  macros are provided for debug messages and dolfin_assertions.
+  
+  Only messages with a debug level higher than or equal to the current
+  log level are printed (the default being zero). Logging may also be
+  turned off by calling set_log_active(false).
+  Print message
+
+* info\ (parameters, verbose=false)
+
+  Print parameter (using output of str() method)
+
+* info\ (variable, verbose=false)
+
+  Print variable (using output of str() method)
+";
+
+%feature("docstring")  dolfin::info_stream "
+Print message to stream
+";
+
+%feature("docstring")  dolfin::info_underline "
+Print underlined message
+";
+
+%feature("docstring")  dolfin::warning "
+Print warning
+";
+
+%feature("docstring")  dolfin::error "
+Print error message and throw an exception.
+Note to developers: this function should not be used internally
+in DOLFIN. Use the more informative dolfin_error instead.
+";
+
+%feature("docstring")  dolfin::dolfin_error "
+Print error message. Prefer this to the above generic error message.
+
+*Arguments*
+    location (str)
+        Name of the file from which the error message was generated.
+    task (str)
+        Name of the task that failed.
+        Note that this string should begin with lowercase.
+        Note that this string should not be punctuated.
+    reason (str)
+        A format string explaining the reason for the failure.
+        Note that this string should begin with uppercase.
+        Note that this string should not be punctuated.
+        Note that this string may contain printf style formatting.
+    ... (primitive types like int, std::size_t, double, bool)
+        Optional arguments for the format string.
+
+Developers should read the file dolfin/log/README in the DOLFIN
+source tree for further notes about the use of this function.
+";
+
+%feature("docstring")  dolfin::deprecation "
+Issue deprecation warning for removed feature
+
+*Arguments*
+    feature (str)
+       Name of the feature that has been removed.
+    version_deprecated (str)
+       Version number of the release in which the feature is deprecated.
+    version_remove (str)
+       Version number of the release in which the feature will be removed.
+    message (str)
+       A format string explaining the deprecation.
+";
+
+%feature("docstring")  dolfin::log "
+Print message at given debug level
+";
+
+%feature("docstring")  dolfin::begin "
+**Overloaded versions**
+
+* begin\ (msg, ...)
+
+  Begin task (increase indentation level)
+
+* begin\ (debug_level, msg, ...)
+
+  Begin task (increase indentation level)
+";
+
+%feature("docstring")  dolfin::end "
+End task (decrease indentation level)
+";
+
+%feature("docstring")  dolfin::set_log_active "
+Turn logging on or off
+";
+
+%feature("docstring")  dolfin::set_log_level "
+Set log level
+";
+
+%feature("docstring")  dolfin::set_output_stream "
+Set output stream
+";
+
+%feature("docstring")  dolfin::get_log_level "
+Get log level
+";
+
+%feature("docstring")  dolfin::monitor_memory_usage "
+Monitor memory usage. Call this function at the start of a
+program to continuously monitor the memory usage of the process.
+";
+
+%feature("docstring")  dolfin::not_working_in_parallel "
+Report that functionality has not (yet) been implemented to work
+in parallel
+";
+
+// Documentation extracted from: (module=log, header=Event.h)
+%feature("docstring")  dolfin::Event "
+A event is a string message which is displayed
+only a limited number of times.
+
+*Example*
+    .. code-block:: python
+    
+        >>> event = dolfin.Event(\"System is stiff, damping is needed.\", 3)
+        >>> for i in range(10):
+        ...     if i > 7:
+        ...         print i
+        ...         event()
+";
+
+%feature("docstring")  dolfin::Event::Event "
+Constructor
+";
+
+%feature("docstring")  dolfin::Event::operator "
+Display message
+";
+
+%feature("docstring")  dolfin::Event::count "
+Display count
+";
+
+%feature("docstring")  dolfin::Event::maxcount "
+Maximum display count
+";
+
+// Documentation extracted from: (module=log, header=LogStream.h)
+%feature("docstring")  dolfin::LogStream "
+This class provides functionality similar to standard C++
+streams (std::cout, std::endl) for output but working through
+the DOLFIN log system.
+";
+
+%feature("docstring")  dolfin::LogStream::LogStream "
+Create log stream of given type
+";
+
+%feature("docstring")  dolfin::LogStream::operator<< "
+**Overloaded versions**
+
+* operator<<\ (stream)
+
+  Output for log stream
+
+* operator<<\ (s)
+
+  Output for string
+
+* operator<<\ (a)
+
+  Output for int
+
+* operator<<\ (a)
+
+  Output for unsigned int
+
+* operator<<\ (a)
+
+  Output for long int
+
+* operator<<\ (a)
+
+  Output for long int
+
+* operator<<\ (a)
+
+  Output for double
+
+* operator<<\ (z)
+
+  Output for std::complex<double>
+
+* operator<<\ (variable)
+
+  Output for variable (calling str() method)
+
+* operator<<\ (entity)
+
+  Output for mesh entity (not subclass of Variable for efficiency)
+
+* operator<<\ (point)
+
+  Output for point (not subclass of Variable for efficiency)
+";
+
+// Documentation extracted from: (module=log, header=Progress.h)
+%feature("docstring")  dolfin::Progress "
+This class provides a simple way to create and update progress
+bars during a computation.
+
+*Example*
+    A progress bar may be used either in an iteration with a known number
+    of steps:
+    
+    .. code-block:: python
+    
+        >>> n = 1000000
+        >>> p = dolfin.Progress(\"Iterating...\", n)
+        >>> for i in range(n):
+        ...     p += 1
+    
+    or in an iteration with an unknown number of steps:
+    
+    .. code-block:: python
+    
+        >>> pr = dolfin.Progress(\"Iterating\")
+        >>> t = 0.0
+        >>> n = 1000000.0
+        >>> while t < n:
+        ...     t += 1.0
+        ...     p += t/n
+";
+
+%feature("docstring")  dolfin::Progress::Progress "
+**Overloaded versions**
+
+* Progress\ (title, n)
+
+  Create progress bar with a known number of steps
+  
+  *Arguments*
+      title (str)
+          The title.
+      n (int)
+          Number of steps.
+
+* Progress\ (title)
+
+  Create progress bar with an unknown number of steps
+  
+  *Arguments*
+      title (str)
+          The title.
+";
+
+%feature("docstring")  dolfin::Progress::operator= "
+Set current position
+
+*Arguments*
+    p (float)
+        The position.
+";
+
+%feature("docstring")  dolfin::Progress::operator++ "
+Increment progress
+";
+
+// Documentation extracted from: (module=log, header=Table.h)
+%feature("docstring")  dolfin::Table "
+This class provides storage and pretty-printing for tables.
+Example usage:
+
+  Table table(\"Timings\");
+
+  table(\"uBLAS\",  \"Assemble\") = 0.010;
+  table(\"uBLAS\",  \"Solve\")    = 0.020;
+  table(\"PETSc\",  \"Assemble\") = 0.011;
+  table(\"PETSc\",  \"Solve\")    = 0.019;
+  table(\"Epetra\", \"Assemble\") = 0.012;
+  table(\"Epetra\", \"Solve\")    = 0.018;
+
+  info(table);
+";
+
+%feature("docstring")  dolfin::Table::Table "
+Create empty table
+";
+
+%feature("docstring")  dolfin::Table::operator "
+Return table entry
+";
+
+%feature("docstring")  dolfin::Table::set "
+**Overloaded versions**
+
+* set\ (row, col, value)
+
+  Set value of table entry
+
+* set\ (row, col, value)
+
+  Set value of table entry
+
+* set\ (row, col, value)
+
+  Set value of table entry
+
+* set\ (row, col, value)
+
+  Set value of table entry
+";
+
+%feature("docstring")  dolfin::Table::get "
+Get value of table entry
+";
+
+%feature("docstring")  dolfin::Table::get_value "
+Get value of table entry
+";
+
+%feature("docstring")  dolfin::Table::title "
+Return table title
+";
+
+%feature("docstring")  dolfin::Table::operator= "
+Assignment operator
+";
+
+%feature("docstring")  dolfin::Table::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::Table::str_latex "
+Return informal string representation for LaTeX
+";
+
+%feature("docstring")  dolfin::TableEntry "
+This class represents an entry in a Table
+";
+
+%feature("docstring")  dolfin::TableEntry::TableEntry "
+Create table entry
+";
+
+%feature("docstring")  dolfin::TableEntry::operator= "
+**Overloaded versions**
+
+* operator=\ (value)
+
+  Assign value to table entry
+
+* operator=\ (value)
+
+  Assign value to table entry
+
+* operator=\ (value)
+
+  Assign value to table entry
+
+* operator=\ (value)
+
+  Assign value to table entry
+";
+
+%feature("docstring")  dolfin::TableEntry::operator std::string "
+Cast to entry value
+";
+
+// Documentation extracted from: (module=log, header=LogLevel.h)
diff --git a/dolfin/swig/log/post.i b/dolfin/swig/log/post.i
new file mode 100644
index 0000000..d801386
--- /dev/null
+++ b/dolfin/swig/log/post.i
@@ -0,0 +1,90 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-05-10
+// Last changed: 2011-08-15
+
+//=============================================================================
+// SWIG directives for the DOLFIN log kernel module (post)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Make progress available from Python through the __iadd__ interface
+//-----------------------------------------------------------------------------
+%feature("docstring") dolfin::Progress::_add "Missing docstring";
+%feature("docstring") dolfin::Progress::_set "Missing docstring";
+%extend dolfin::Progress {
+
+void _add(int incr) {
+    for (int j=0;j<incr; ++j)
+        (*self)++;
+}
+
+void _set(double value) {
+    *self = value;
+}
+
+%pythoncode
+%{
+def __iadd__(self, other):
+    if isinstance(other, int):
+        self._add(other)
+    elif isinstance(other, float):
+        self._set(other)
+    return self
+
+def update(self, other):
+    "Update the progress with given number"
+    if isinstance(other, float):
+        self._set(other)
+%}
+
+}
+
+//-----------------------------------------------------------------------------
+// Use traceback in debug message
+// Reimplement info
+//-----------------------------------------------------------------------------
+%pythoncode %{
+def debug(message):
+    import traceback
+    file, line, func, txt = traceback.extract_stack(None, 2)[0]
+    __debug(file, line, func, message)
+
+def info(object, verbose=False):
+    """Print string or object.
+
+    *Arguments*
+        object
+            A string or a DOLFIN object (:py:class:`Variable <dolfin.cpp.Variable>`
+            or :py:class:`Parameters <dolfin.cpp.Parameters>`)
+        verbose
+            An optional argument that indicates whether verbose object data
+            should be printed. If False, a short one-line summary is printed.
+            If True, verbose and sometimes very exhaustive object data are
+            printed.
+    """
+
+    if isinstance(object, (Variable, Parameters)):
+        _info(object.str(verbose))
+    else:
+        _info(object)
+%}
diff --git a/dolfin/swig/log/pre.i b/dolfin/swig/log/pre.i
new file mode 100644
index 0000000..844a476
--- /dev/null
+++ b/dolfin/swig/log/pre.i
@@ -0,0 +1,57 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-05-10
+// Last changed: 2009-09-23
+
+//=============================================================================
+// SWIG directives for the DOLFIN log kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Due to a SWIG bug when overloading a function that also use elipsis (...)
+// argument in C++, we need to ignore other overloaded functions. They are
+// reimplemented in log_post.i
+//-----------------------------------------------------------------------------
+%ignore dolfin::info(const Parameters& parameters, bool verbose=false);
+%ignore dolfin::info(const Variable& variable, bool verbose=false);
+%rename(_info) dolfin::info;
+
+//-----------------------------------------------------------------------------
+// Need to ignore these dues to SWIG confusion of overloaded functions
+//-----------------------------------------------------------------------------
+%ignore dolfin::Table::set(std::string,std::string,std::size_t);
+
+//-----------------------------------------------------------------------------
+// Ignore operators so SWIG stop complaining
+//-----------------------------------------------------------------------------
+%ignore dolfin::TableEntry::operator std::string;
+%ignore dolfin::Progress::operator++;
+%ignore dolfin::Progress::operator=;
+%ignore dolfin::Table::operator=;
+%ignore dolfin::TableEntry::operator=;
+
+//-----------------------------------------------------------------------------
+// Ignore DOLFIN C++ stream handling
+//-----------------------------------------------------------------------------
+%ignore dolfin::LogStream;
+%ignore dolfin::cout;
+%ignore dolfin::endl;
diff --git a/dolfin/swig/math/docstrings.i b/dolfin/swig/math/docstrings.i
new file mode 100644
index 0000000..f598e0b
--- /dev/null
+++ b/dolfin/swig/math/docstrings.i
@@ -0,0 +1,129 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=math, header=basic.h)
+%feature("docstring")  dolfin::ipow "
+Return a to the power n
+";
+
+%feature("docstring")  dolfin::rand "
+Return a random number, uniformly distributed between [0.0, 1.0)
+";
+
+%feature("docstring")  dolfin::seed "
+Seed random number generator
+";
+
+%feature("docstring")  dolfin::near "
+Check whether x is close to x0 (to within DOLFIN_EPS)
+";
+
+%feature("docstring")  dolfin::between "
+Check whether x is between x0 and x1 (inclusive, to within DOLFIN_EPS)
+";
+
+// Documentation extracted from: (module=math, header=Lagrange.h)
+%feature("docstring")  dolfin::Lagrange "
+Lagrange polynomial (basis) with given degree q determined by
+n = q + 1 nodal points.
+
+Example: q = 1 (n = 2)
+
+  Lagrange p(1);
+  p.set(0, 0.0);
+  p.set(1, 1.0);
+
+It is the callers reponsibility that the points are distinct.
+
+This creates a Lagrange polynomial (actually two Lagrange
+polynomials):
+
+  p(0,x) = 1 - x   (one at x = 0, zero at x = 1)
+  p(1,x) = x       (zero at x = 0, one at x = 1)
+
+";
+
+%feature("docstring")  dolfin::Lagrange::Lagrange "
+**Overloaded versions**
+
+* Lagrange\ (q)
+
+  Constructor
+
+* Lagrange\ (p)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::Lagrange::set "
+Specify point
+";
+
+%feature("docstring")  dolfin::Lagrange::size "
+Return number of points
+";
+
+%feature("docstring")  dolfin::Lagrange::degree "
+Return degree
+";
+
+%feature("docstring")  dolfin::Lagrange::point "
+Return point
+";
+
+%feature("docstring")  dolfin::Lagrange::operator "
+Return value of polynomial i at given point x
+";
+
+%feature("docstring")  dolfin::Lagrange::eval "
+Return value of polynomial i at given point x
+";
+
+%feature("docstring")  dolfin::Lagrange::ddx "
+Return derivate of polynomial i at given point x
+";
+
+%feature("docstring")  dolfin::Lagrange::dqdx "
+Return derivative q (a constant) of polynomial
+";
+
+%feature("docstring")  dolfin::Lagrange::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=math, header=Legendre.h)
+%feature("docstring")  dolfin::Legendre "
+Interface for computing Legendre polynomials via Boost.
+";
+
+%feature("docstring")  dolfin::Legendre::eval "
+Evaluate polynomial of order n at point x
+";
+
+%feature("docstring")  dolfin::Legendre::ddx "
+Evaluate first derivative of polynomial of order n at point x
+";
+
+%feature("docstring")  dolfin::Legendre::d2dx "
+Evaluate second derivative of polynomial of order n at point x
+";
+
diff --git a/dolfin/swig/mesh/docstrings.i b/dolfin/swig/mesh/docstrings.i
new file mode 100644
index 0000000..6c5bb65
--- /dev/null
+++ b/dolfin/swig/mesh/docstrings.i
@@ -0,0 +1,3753 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=mesh, header=CellType.h)
+%feature("docstring")  dolfin::CellType "
+This class provides a common interface for different cell types.
+Each cell type implements mesh functionality that is specific to
+a certain type of cell.
+";
+
+%feature("docstring")  dolfin::CellType::CellType "
+Constructor
+";
+
+%feature("docstring")  dolfin::CellType::create "
+**Overloaded versions**
+
+* create\ (type)
+
+  Create cell type from type (factory function)
+
+* create\ (type)
+
+  Create cell type from string (factory function)
+";
+
+%feature("docstring")  dolfin::CellType::string2type "
+Convert from string to cell type
+";
+
+%feature("docstring")  dolfin::CellType::type2string "
+Convert from cell type to string
+";
+
+%feature("docstring")  dolfin::CellType::cell_type "
+Return type of cell
+";
+
+%feature("docstring")  dolfin::CellType::facet_type "
+Return type of cell for facets
+";
+
+%feature("docstring")  dolfin::CellType::dim "
+Return topological dimension of cell
+";
+
+%feature("docstring")  dolfin::CellType::num_entities "
+Return number of entitites of given topological dimension
+";
+
+%feature("docstring")  dolfin::CellType::num_vertices "
+Return number of vertices for entity of given topological dimension
+";
+
+%feature("docstring")  dolfin::CellType::orientation "
+**Overloaded versions**
+
+* orientation\ (cell)
+
+  Return orientation of the cell (assuming flat space)
+
+* orientation\ (cell, up)
+
+  Return orientation of the cell relative to given up direction
+";
+
+%feature("docstring")  dolfin::CellType::create_entities "
+Create entities e of given topological dimension from vertices v
+";
+
+%feature("docstring")  dolfin::CellType::refine_cell "
+Refine cell uniformly
+";
+
+%feature("docstring")  dolfin::CellType::volume "
+Compute (generalized) volume of mesh entity
+";
+
+%feature("docstring")  dolfin::CellType::diameter "
+Compute diameter of mesh entity
+";
+
+%feature("docstring")  dolfin::CellType::inradius "
+Compute inradius of cell
+";
+
+%feature("docstring")  dolfin::CellType::radius_ratio "
+Compute dim*inradius/circumradius for given cell
+";
+
+%feature("docstring")  dolfin::CellType::squared_distance "
+Compute squared distance to given point
+";
+
+%feature("docstring")  dolfin::CellType::normal "
+**Overloaded versions**
+
+* normal\ (cell, facet, i)
+
+  Compute component i of normal of given facet with respect to the cell
+
+* normal\ (cell, facet)
+
+  Compute of given facet with respect to the cell
+";
+
+%feature("docstring")  dolfin::CellType::cell_normal "
+Compute normal to given cell (viewed as embedded in 3D)
+";
+
+%feature("docstring")  dolfin::CellType::facet_area "
+Compute the area/length of given facet with respect to the cell
+";
+
+%feature("docstring")  dolfin::CellType::order "
+Order entities locally
+";
+
+%feature("docstring")  dolfin::CellType::ordered "
+Check if entities are ordered
+";
+
+%feature("docstring")  dolfin::CellType::collides "
+**Overloaded versions**
+
+* collides\ (cell, point)
+
+  Check whether given point collides with cell
+
+* collides\ (cell, entity)
+
+  Check whether given entity collides with cell
+";
+
+%feature("docstring")  dolfin::CellType::triangulate_intersection "
+Compute triangulation of intersection of two cells
+";
+
+%feature("docstring")  dolfin::CellType::description "
+Return description of cell type
+";
+
+// Documentation extracted from: (module=mesh, header=MeshTopology.h)
+%feature("docstring")  dolfin::MeshTopology "
+MeshTopology stores the topology of a mesh, consisting of mesh
+entities and connectivity (incidence relations for the mesh
+entities). Note that the mesh entities don't need to be stored,
+only the number of entities and the connectivity. Any numbering
+scheme for the mesh entities is stored separately in a
+MeshFunction over the entities.
+
+A mesh entity e may be identified globally as a pair e = (dim,
+i), where dim is the topological dimension and i is the index of
+the entity within that topological dimension.
+";
+
+%feature("docstring")  dolfin::MeshTopology::MeshTopology "
+**Overloaded versions**
+
+* MeshTopology\ ()
+
+  Create empty mesh topology
+
+* MeshTopology\ (topology)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::MeshTopology::operator= "
+Assignment
+";
+
+%feature("docstring")  dolfin::MeshTopology::dim "
+Return topological dimension
+";
+
+%feature("docstring")  dolfin::MeshTopology::size "
+Return number of entities for given dimension
+";
+
+%feature("docstring")  dolfin::MeshTopology::size_global "
+Return global number of entities for given dimension
+";
+
+%feature("docstring")  dolfin::MeshTopology::clear "
+**Overloaded versions**
+
+* clear\ ()
+
+  Clear all data
+
+* clear\ (d0, d1)
+
+  Clear data for given pair of topological dimensions
+";
+
+%feature("docstring")  dolfin::MeshTopology::init "
+**Overloaded versions**
+
+* init\ (dim)
+
+  Initialize topology of given maximum dimension
+
+* init\ (dim, local_size, global_size)
+
+  Set number of local entities (local_size) and global entities
+  (global_size) for given topological dimension dim
+";
+
+%feature("docstring")  dolfin::MeshTopology::init_global_indices "
+Initialize storage for global entity numbering for entities of
+dimension dim
+";
+
+%feature("docstring")  dolfin::MeshTopology::set_global_index "
+Set global index for entity of dimension dim and with local
+index
+";
+
+%feature("docstring")  dolfin::MeshTopology::global_indices "
+Get local-to-global index map for entities of topological
+dimension d
+";
+
+%feature("docstring")  dolfin::MeshTopology::have_global_indices "
+Check if global indices are available for entiries of
+dimension dim
+";
+
+%feature("docstring")  dolfin::MeshTopology::shared_entities "
+**Overloaded versions**
+
+* shared_entities\ (dim)
+
+  Return map from shared entities (local index) to processes
+  that share the entity
+
+* shared_entities\ (dim)
+
+  Return map from shared entiies (local index) to process that
+  share the entity (const version)
+";
+
+%feature("docstring")  dolfin::MeshTopology::operator "
+**Overloaded versions**
+
+* operator\ (d0, d1)
+
+  Return connectivity for given pair of topological dimensions
+
+* operator\ (d0, d1)
+
+  Return connectivity for given pair of topological dimensions
+";
+
+%feature("docstring")  dolfin::MeshTopology::hash "
+Return hash based on the hash of cell-vertex connectivity
+";
+
+%feature("docstring")  dolfin::MeshTopology::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=mesh, header=MeshGeometry.h)
+%feature("docstring")  dolfin::MeshGeometry::MeshGeometry "
+**Overloaded versions**
+
+* MeshGeometry\ ()
+
+  Create empty set of coordinates
+
+* MeshGeometry\ (geometry)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::MeshGeometry::operator= "
+Assignment
+";
+
+%feature("docstring")  dolfin::MeshGeometry::dim "
+Return Euclidean dimension of coordinate system
+";
+
+%feature("docstring")  dolfin::MeshGeometry::size "
+Return number of coordinates
+";
+
+%feature("docstring")  dolfin::MeshGeometry::x "
+**Overloaded versions**
+
+* x\ (n, i)
+
+  Return value of coordinate with local index n in direction i
+
+* x\ (n, i)
+
+  Return value of coordinate with local index n in direction i
+
+* x\ (n)
+
+  Return array of values for coordinate with local index n
+
+* x\ (n)
+
+  Return array of values for coordinate with local index n
+
+* x\ ()
+
+  Return array of values for all coordinates
+
+* x\ ()
+
+  Return array of values for all coordinates
+";
+
+%feature("docstring")  dolfin::MeshGeometry::point "
+Return coordinate with local index n as a 3D point value
+";
+
+%feature("docstring")  dolfin::MeshGeometry::clear "
+Clear all data
+";
+
+%feature("docstring")  dolfin::MeshGeometry::init "
+Initialize coordinate list to given dimension and size
+";
+
+%feature("docstring")  dolfin::MeshGeometry::hash "
+Hash of coordinate values
+
+*Returns*
+    int
+        A tree-hashed value of the coordinates over all MPI processes
+
+";
+
+%feature("docstring")  dolfin::MeshGeometry::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=mesh, header=MeshDomains.h)
+%feature("docstring")  dolfin::MeshDomains "
+The class :py:class:`MeshDomains` stores the division of a :py:class:`Mesh` into
+subdomains. For each topological dimension 0 <= d <= D, where D
+is the topological dimension of the :py:class:`Mesh`, a set of integer
+markers are stored for a subset of the entities of dimension d,
+indicating for each entity in the subset the number of the
+subdomain. It should be noted that the subset does not need to
+contain all entities of any given dimension; entities not
+contained in the subset are \"unmarked\".
+";
+
+%feature("docstring")  dolfin::MeshDomains::MeshDomains "
+Create empty mesh domains
+";
+
+%feature("docstring")  dolfin::MeshDomains::max_dim "
+Return maximum topological dimension of stored markers
+";
+
+%feature("docstring")  dolfin::MeshDomains::num_marked "
+Return number of marked entities of given dimension
+";
+
+%feature("docstring")  dolfin::MeshDomains::is_empty "
+Check whether domain data is empty
+";
+
+%feature("docstring")  dolfin::MeshDomains::markers "
+**Overloaded versions**
+
+* markers\ (dim)
+
+  Get subdomain markers for given dimension (shared pointer
+  version)
+
+* markers\ (dim)
+
+  Get subdomain markers for given dimension (const shared
+  pointer version)
+";
+
+%feature("docstring")  dolfin::MeshDomains::set_marker "
+Set marker (entity index, marker value) of a given dimension
+d. Returns true if a new key is inserted, false otherwise.
+";
+
+%feature("docstring")  dolfin::MeshDomains::get_marker "
+Get marker (entity index, marker value) of a given dimension
+d. Throws an error if marker does not exist.
+";
+
+%feature("docstring")  dolfin::MeshDomains::operator= "
+Assignment operator
+";
+
+%feature("docstring")  dolfin::MeshDomains::init "
+Initialize mesh domains for given topological dimension
+";
+
+%feature("docstring")  dolfin::MeshDomains::clear "
+Clear all data
+";
+
+// Documentation extracted from: (module=mesh, header=MeshData.h)
+%feature("docstring")  dolfin::MeshData "
+The class MeshData is a container for auxiliary mesh data,
+represented either as arrays or maps. Each dataset is identified
+by a unique user-specified string. Only std::size_t-valued data
+are currently supported.
+
+Auxiliary mesh data may be attached to a mesh by users as a
+convenient way to store data associated with a mesh. It is also
+used internally by DOLFIN to communicate data associated with
+meshes. The following named mesh data are recognized by DOLFIN:
+
+Facet orientation (used for assembly over interior facets)
+
+  * \"facet_orientation\"  - _std:vector_ <std::size_t> of dimension D - 1
+
+Sub meshes (used by the class SubMesh)
+
+  * \"parent_vertex_indices\" - _std::vector_ <std::size_t> of dimension 0
+
+Note to developers: use underscore in names in place of spaces.
+";
+
+%feature("docstring")  dolfin::MeshData::MeshData "
+Constructor
+";
+
+%feature("docstring")  dolfin::MeshData::operator= "
+Assignment operator
+
+*Arguments*
+    data (:py:class:`MeshData`)
+        Another MeshData object.
+";
+
+%feature("docstring")  dolfin::MeshData::clear "
+Clear all data
+";
+
+%feature("docstring")  dolfin::MeshData::exists "
+Check is array exists
+
+*Arguments*
+    name (str)
+        The name of the array.
+
+*Returns*
+    bool
+        True is array exists, false otherwise.
+";
+
+%feature("docstring")  dolfin::MeshData::create_mesh_function "
+**Overloaded versions**
+
+* create_mesh_function\ (name)
+
+  This function is no longer supported. It is retained to print
+  an informative error message. It will be removed in the
+  future.
+
+* create_mesh_function\ (name, dim)
+
+  This function is no longer supported. It is retained to print
+  an informative error message. It will be removed in the
+  future.
+";
+
+%feature("docstring")  dolfin::MeshData::mesh_function "
+This function is no longer supported. It is retained to print
+an informative error message. It will be removed in the
+future.
+";
+
+%feature("docstring")  dolfin::MeshData::array "
+**Overloaded versions**
+
+* array\ (name, dim)
+
+  Return array with given name (returning zero if data is not
+  available)
+  
+  *Arguments*
+      name (str)
+          The name of the array.
+  
+  *Returns*
+      numpy.array(int)
+          The array.
+
+* array\ (name, dim)
+
+  Return array with given name (returning zero if data is not
+  available)
+  
+  *Arguments*
+      name (str)
+          The name of the array.
+  
+  *Returns*
+      numpy.array(int)
+          The array.
+";
+
+%feature("docstring")  dolfin::MeshData::erase_array "
+Erase array with given name
+
+*Arguments*
+    name (str)
+        The name of the array.
+";
+
+%feature("docstring")  dolfin::MeshData::str "
+Return informal string representation (pretty-print)
+
+*Arguments*
+    verbose (bool)
+        Flag to turn on additional output.
+
+*Returns*
+    str
+        An informal representation.
+";
+
+// Documentation extracted from: (module=mesh, header=Mesh.h)
+%feature("docstring")  dolfin::Mesh "
+A :py:class:`Mesh` consists of a set of connected and numbered mesh entities.
+
+Both the representation and the interface are
+dimension-independent, but a concrete interface is also provided
+for standard named mesh entities:
+
+.. tabularcolumns:: |c|c|c|
+
++--------+-----------+-------------+
+| Entity | Dimension | Codimension |
++========+===========+=============+
+| Vertex |  0        |             |
++--------+-----------+-------------+
+| Edge   |  1        |             |
++--------+-----------+-------------+
+| Face   |  2        |             |
++--------+-----------+-------------+
+| Facet  |           |      1      |
++--------+-----------+-------------+
+| Cell   |           |      0      |
++--------+-----------+-------------+
+
+When working with mesh iterators, all entities and connectivity
+are precomputed automatically the first time an iterator is
+created over any given topological dimension or connectivity.
+
+Note that for efficiency, only entities of dimension zero
+(vertices) and entities of the maximal dimension (cells) exist
+when creating a :py:class:`Mesh`. Other entities must be explicitly created
+by calling init(). For example, all edges in a mesh may be
+created by a call to mesh.init(1). Similarly, connectivities
+such as all edges connected to a given vertex must also be
+explicitly created (in this case by a call to mesh.init(0, 1)).
+";
+
+%feature("docstring")  dolfin::Mesh::Mesh "
+**Overloaded versions**
+
+* Mesh\ ()
+
+  Create empty mesh
+
+* Mesh\ (comm)
+
+  Create empty mesh
+
+* Mesh\ (mesh)
+
+  Copy constructor.
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          Object to be copied.
+
+* Mesh\ (filename)
+
+  Create mesh from data file.
+  
+  *Arguments*
+      filename (str)
+          Name of file to load.
+
+* Mesh\ (comm, filename)
+
+  Create mesh from data file.
+  
+  *Arguments*
+      comm (:py:class:`MPI`)
+          The MPI communicator
+      filename (str)
+          Name of file to load.
+
+* Mesh\ (comm, local_mesh_data)
+
+  Create a distributed mesh from local (per process) data.
+  
+  *Arguments*
+      comm (:py:class:`MPI`)
+          MPI communicator for the mesh.
+      local_mesh_data (:py:class:`LocalMeshData`)
+          Data from which to build the mesh.
+
+* Mesh\ (geometry, resolution)
+
+  Create mesh defined by Constructive Solid Geometry (CSG)
+  
+  *Arguments*
+      geometry (:py:class:`CSGGeometry`)
+          The CSG geometry
+      resolution (int)
+          An integer specifying the mesh resolution
+
+* Mesh\ (geometry, resolution)
+
+  Create mesh defined by Constructive Solid Geometry (CSG)
+  
+  *Arguments*
+      geometry (:py:class:`CSGGeometry`)
+          The CSG geometry
+      resolution (int)
+          An integer specifying the mesh resolution
+";
+
+%feature("docstring")  dolfin::Mesh::operator= "
+Assignment operator
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        Another :py:class:`Mesh` object.
+";
+
+%feature("docstring")  dolfin::Mesh::num_vertices "
+Get number of vertices in mesh.
+
+*Returns*
+    int
+        Number of vertices.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::num_edges "
+Get number of edges in mesh.
+
+*Returns*
+    int
+        Number of edges.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::num_faces "
+Get number of faces in mesh.
+
+*Returns*
+    int
+        Number of faces.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::num_facets "
+Get number of facets in mesh.
+
+*Returns*
+    int
+        Number of facets.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::num_cells "
+Get number of cells in mesh.
+
+*Returns*
+    int
+        Number of cells.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::num_entities "
+Get number of entities of given topological dimension.
+
+*Arguments*
+    d (int)
+        Topological dimension.
+
+*Returns*
+    int
+        Number of entities of topological dimension d.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::coordinates "
+**Overloaded versions**
+
+* coordinates\ ()
+
+  Get vertex coordinates.
+  
+  *Returns*
+      numpy.array(float)
+          Coordinates of all vertices.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* coordinates\ ()
+
+  Return coordinates of all vertices (const version).
+";
+
+%feature("docstring")  dolfin::Mesh::cells "
+Get cell connectivity.
+
+*Returns*
+    numpy.array(int)
+        Connectivity for all cells.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::size "
+Get number of local entities of given topological dimension.
+
+*Arguments*
+    dim (int)
+        Topological dimension.
+
+*Returns*
+    int
+        Number of local entities of topological dimension d.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::size_global "
+Get global number of entities of given topological dimension.
+
+*Arguments*
+    dim (int)
+        Topological dimension.
+
+*Returns*
+    int
+        Global number of entities of topological dimension d.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::topology "
+**Overloaded versions**
+
+* topology\ ()
+
+  Get mesh topology.
+  
+  *Returns*
+      :py:class:`MeshTopology`
+          The topology object associated with the mesh.
+
+* topology\ ()
+
+  Get mesh topology (const version).
+";
+
+%feature("docstring")  dolfin::Mesh::geometry "
+**Overloaded versions**
+
+* geometry\ ()
+
+  Get mesh geometry.
+  
+  *Returns*
+      :py:class:`MeshGeometry`
+          The geometry object associated with the mesh.
+
+* geometry\ ()
+
+  Get mesh geometry (const version).
+";
+
+%feature("docstring")  dolfin::Mesh::domains "
+**Overloaded versions**
+
+* domains\ ()
+
+  Get mesh (sub)domains.
+  
+  *Returns*
+      :py:class:`MeshDomains`
+          The (sub)domains associated with the mesh.
+
+* domains\ ()
+
+  Get mesh (sub)domains.
+";
+
+%feature("docstring")  dolfin::Mesh::bounding_box_tree "
+Get bounding box tree for mesh. The bounding box tree is
+initialized and built upon the first call to this
+function. The bounding box tree can be used to compute
+collisions between the mesh and other objects. It is the
+responsibility of the caller to use (and possibly rebuild) the
+tree. It is stored as a (mutable) member of the mesh to enable
+sharing of the bounding box tree data structure.
+";
+
+%feature("docstring")  dolfin::Mesh::data "
+**Overloaded versions**
+
+* data\ ()
+
+  Get mesh data.
+  
+  *Returns*
+      :py:class:`MeshData`
+          The mesh data object associated with the mesh.
+
+* data\ ()
+
+  Get mesh data (const version).
+";
+
+%feature("docstring")  dolfin::Mesh::type "
+**Overloaded versions**
+
+* type\ ()
+
+  Get mesh cell type.
+  
+  *Returns*
+      :py:class:`CellType`
+          The cell type object associated with the mesh.
+
+* type\ ()
+
+  Get mesh cell type (const version).
+";
+
+%feature("docstring")  dolfin::Mesh::init "
+**Overloaded versions**
+
+* init\ (dim)
+
+  Compute entities of given topological dimension.
+  
+  *Arguments*
+      dim (int)
+          Topological dimension.
+  
+  *Returns*
+      int
+          Number of created entities.
+
+* init\ (d0, d1)
+
+  Compute connectivity between given pair of dimensions.
+  
+  *Arguments*
+      d0 (int)
+          Topological dimension.
+  
+      d1 (int)
+          Topological dimension.
+
+* init\ ()
+
+  Compute all entities and connectivity.
+";
+
+%feature("docstring")  dolfin::Mesh::clear "
+Clear all mesh data.
+";
+
+%feature("docstring")  dolfin::Mesh::clean "
+Clean out all auxiliary topology data. This clears all
+topological data, except the connectivity between cells and
+vertices.
+";
+
+%feature("docstring")  dolfin::Mesh::order "
+Order all mesh entities.
+
+.. seealso::
+
+    UFC documentation (put link here!)
+";
+
+%feature("docstring")  dolfin::Mesh::ordered "
+Check if mesh is ordered according to the UFC numbering convention.
+
+*Returns*
+    bool
+        The return values is true iff the mesh is ordered.
+";
+
+%feature("docstring")  dolfin::Mesh::translate "
+Translate mesh according to a given vector.
+
+*Arguments*
+    point (Point)
+        The vector defining the translation.
+";
+
+%feature("docstring")  dolfin::Mesh::rotate "
+**Overloaded versions**
+
+* rotate\ (angle, axis=2)
+
+  Rotate mesh around a coordinate axis through center of mass
+  of all mesh vertices
+  
+  *Arguments*
+      angle (float)
+          The number of degrees (0-360) of rotation.
+      axis (int)
+          The coordinate axis around which to rotate the mesh.
+
+* rotate\ (angle, axis, point)
+
+  Rotate mesh around a coordinate axis through a given point
+  
+  *Arguments*
+      angle (float)
+          The number of degrees (0-360) of rotation.
+      axis (int)
+          The coordinate axis around which to rotate the mesh.
+      point (:py:class:`Point`)
+          The point around which to rotate the mesh.
+";
+
+%feature("docstring")  dolfin::Mesh::move "
+**Overloaded versions**
+
+* move\ (boundary)
+
+  Move coordinates of mesh according to new boundary coordinates.
+  
+  *Arguments*
+      boundary (:py:class:`BoundaryMesh`)
+          A mesh containing just the boundary cells.
+  
+  *Returns*
+      MeshDisplacement
+          Displacement encapsulated in Expression subclass
+          MeshDisplacement.
+
+* move\ (mesh)
+
+  Move coordinates of mesh according to adjacent mesh with
+  common global vertices.
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          A :py:class:`Mesh` object.
+  
+  *Returns*
+      MeshDisplacement
+          Displacement encapsulated in Expression subclass
+          MeshDisplacement.
+
+* move\ (displacement)
+
+  Move coordinates of mesh according to displacement function.
+  
+  *Arguments*
+      displacement (:py:class:`GenericFunction`)
+          A :py:class:`GenericFunction` object.
+";
+
+%feature("docstring")  dolfin::Mesh::smooth "
+Smooth internal vertices of mesh by local averaging.
+
+*Arguments*
+    num_iterations (int)
+        Number of iterations to perform smoothing,
+        default value is 1.
+";
+
+%feature("docstring")  dolfin::Mesh::smooth_boundary "
+Smooth boundary vertices of mesh by local averaging.
+
+*Arguments*
+    num_iterations (int)
+        Number of iterations to perform smoothing,
+        default value is 1.
+
+    harmonic_smoothing (bool)
+        Flag to turn on harmonics smoothing, default
+        value is true.
+";
+
+%feature("docstring")  dolfin::Mesh::snap_boundary "
+Snap boundary vertices of mesh to match given sub domain.
+
+*Arguments*
+    sub_domain (:py:class:`SubDomain`)
+        A :py:class:`SubDomain` object.
+
+    harmonic_smoothing (bool)
+        Flag to turn on harmonics smoothing, default
+        value is true.
+";
+
+%feature("docstring")  dolfin::Mesh::color "
+**Overloaded versions**
+
+* color\ (coloring_type)
+
+  Color the cells of the mesh such that no two neighboring cells
+  share the same color. A colored mesh keeps a
+  CellFunction<std::size_t> named \"cell colors\" as mesh data which
+  holds the colors of the mesh.
+  
+  *Arguments*
+      coloring_type (str)
+          Coloring type, specifying what relation makes two
+          cells neighbors, can be one of \"vertex\", \"edge\" or
+          \"facet\".
+  
+  *Returns*
+      numpy.array(int)
+          The colors as a mesh function over the cells of the mesh.
+
+* color\ (coloring_type)
+
+  Color the cells of the mesh such that no two neighboring cells
+  share the same color. A colored mesh keeps a
+  CellFunction<std::size_t> named \"cell colors\" as mesh data which
+  holds the colors of the mesh.
+  
+  *Arguments*
+      coloring_type (numpy.array(int))
+          Coloring type given as list of topological dimensions,
+          specifying what relation makes two mesh entinties neighbors.
+  
+  *Returns*
+      numpy.array(int)
+          The colors as a mesh function over entities of the mesh.
+";
+
+%feature("docstring")  dolfin::Mesh::hmin "
+Compute minimum cell diameter.
+
+*Returns*
+    float
+        The minimum cell diameter, the diameter is computed as
+        two times the circumradius
+        (http://mathworld.wolfram.com).
+
+*Example*
+    .. code-block:: python
+    
+        >>> mesh = dolfin.UnitSquare(2,2)
+        >>> mesh.hmin()
+        0.70710678118654757
+";
+
+%feature("docstring")  dolfin::Mesh::hmax "
+Compute maximum cell diameter.
+
+*Returns*
+    float
+        The maximum cell diameter, the diameter is computed as
+        two times the circumradius
+        (http://mathworld.wolfram.com).
+
+*Example*
+    .. code-block:: python
+    
+        >>> mesh = dolfin.UnitSquare(2,2)
+        >>> mesh.hmax()
+        0.70710678118654757
+";
+
+%feature("docstring")  dolfin::Mesh::rmin "
+Compute minimum cell inradius.
+
+*Returns*
+    float
+        The minimum of cells' inscribed sphere radii
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::rmax "
+Compute maximum cell inradius.
+
+*Returns*
+    float
+        The maximum of cells' inscribed sphere radii
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Mesh::hash "
+Compute hash of mesh, currently based on the has of the mesh
+geometry and mesh topology.
+
+*Returns*
+    int
+        A tree-hashed value of the coordinates over all MPI processes
+
+";
+
+%feature("docstring")  dolfin::Mesh::str "
+Informal string representation.
+
+*Arguments*
+    verbose (bool)
+        Flag to turn on additional output.
+
+*Returns*
+    str
+        An informal representation of the mesh.
+
+*Example*
+    .. code-block:: python
+    
+        >>> mesh = dolfin.UnitSquare(2,2)
+        >>> mesh.str(False)
+        '<Mesh of topological dimension 2 (triangles) with 9 vertices and 8 cells, ordered>'
+";
+
+%feature("docstring")  dolfin::Mesh::cell_orientations "
+**Overloaded versions**
+
+* cell_orientations\ ()
+
+  Return cell_orientations
+  
+  *Returns*
+      numpy.array(int)
+          Map from cell index to orientation of cell
+
+* cell_orientations\ ()
+
+  Return cell_orientations (const version)
+  
+  *Returns*
+      numpy.array(int)
+          Map from cell index to orientation of cell
+";
+
+%feature("docstring")  dolfin::Mesh::init_cell_orientations "
+Compute and initialize cell_orientations relative to a given
+global outward direction/normal/orientation. Only defined if
+mesh is orientable.
+
+*Arguments*
+    global_normal (Expression)
+        A global normal direction to the mesh
+";
+
+%feature("docstring")  dolfin::Mesh::mpi_comm "
+Mesh MPI communicator
+";
+
+// Documentation extracted from: (module=mesh, header=MeshEntity.h)
+%feature("docstring")  dolfin::MeshEntity "
+A MeshEntity represents a mesh entity associated with
+a specific topological dimension of some :py:class:`Mesh`.
+";
+
+%feature("docstring")  dolfin::MeshEntity::MeshEntity "
+**Overloaded versions**
+
+* MeshEntity\ ()
+
+  Default Constructor
+
+* MeshEntity\ (mesh, dim, index)
+
+  Constructor
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      dim (int)
+          The topological dimension.
+      index (int)
+          The index.
+";
+
+%feature("docstring")  dolfin::MeshEntity::init "
+Initialize mesh entity with given data
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        The mesh.
+    dim (int)
+        The topological dimension.
+    index (int)
+        The index.
+";
+
+%feature("docstring")  dolfin::MeshEntity::operator== "
+Comparision Operator
+
+*Arguments*
+    another (:py:class:`MeshEntity`)
+        Another mesh entity
+
+*Returns*
+    bool
+        True if the two mesh entities are equal.
+";
+
+%feature("docstring")  dolfin::MeshEntity::operator!= "
+Comparision Operator
+
+*Arguments*
+    another (MeshEntity)
+        Another mesh entity.
+
+*Returns*
+    bool
+        True if the two mesh entities are NOT equal.
+";
+
+%feature("docstring")  dolfin::MeshEntity::mesh "
+Return mesh associated with mesh entity
+
+*Returns*
+    :py:class:`Mesh`
+        The mesh.
+";
+
+%feature("docstring")  dolfin::MeshEntity::dim "
+Return topological dimension
+
+*Returns*
+    int
+        The dimension.
+";
+
+%feature("docstring")  dolfin::MeshEntity::index "
+**Overloaded versions**
+
+* index\ ()
+
+  Return index of mesh entity
+  
+  *Returns*
+      int
+          The index.
+
+* index\ (entity)
+
+  Compute local index of given incident entity (error if not
+  found)
+  
+  *Arguments*
+      entity (:py:class:`MeshEntity`)
+          The mesh entity.
+  
+  *Returns*
+      int
+          The local index of given entity.
+";
+
+%feature("docstring")  dolfin::MeshEntity::global_index "
+Return global index of mesh entity
+
+*Returns*
+    int
+        The global index. Set to
+        std::numerical_limits<std::size_t>::max() if global index
+        has not been computed
+";
+
+%feature("docstring")  dolfin::MeshEntity::num_entities "
+Return local number of incident mesh entities of given
+topological dimension
+
+*Arguments*
+    dim (int)
+        The topological dimension.
+
+*Returns*
+    int
+The number of local incident MeshEntity objects of given
+dimension.
+";
+
+%feature("docstring")  dolfin::MeshEntity::num_global_entities "
+Return global number of incident mesh entities of given
+topological dimension
+
+*Arguments*
+    dim (int)
+        The topological dimension.
+
+*Returns*
+    int
+        The number of global incident MeshEntity objects of given
+        dimension.
+";
+
+%feature("docstring")  dolfin::MeshEntity::entities "
+Return array of indices for incident mesh entitites of given
+topological dimension
+
+*Arguments*
+    dim (int)
+        The topological dimension.
+
+*Returns*
+    int
+        The index for incident mesh entities of given dimension.
+";
+
+%feature("docstring")  dolfin::MeshEntity::mesh_id "
+Return unique mesh ID
+
+*Returns*
+    int
+        The unique mesh ID.
+";
+
+%feature("docstring")  dolfin::MeshEntity::incident "
+Check if given entity is incident
+
+*Arguments*
+    entity (:py:class:`MeshEntity`)
+        The entity.
+
+*Returns*
+    bool
+        True if the given entity is incident
+";
+
+%feature("docstring")  dolfin::MeshEntity::midpoint "
+Compute midpoint of cell
+
+*Returns*
+    :py:class:`Point`
+        The midpoint of the cell.
+";
+
+%feature("docstring")  dolfin::MeshEntity::str "
+Return informal string representation (pretty-print)
+
+*Arguments*
+    verbose (bool)
+        Flag to turn on additional output.
+
+*Returns*
+    str
+        An informal representation of the function space.
+";
+
+// Documentation extracted from: (module=mesh, header=MeshEntityIterator.h)
+%feature("docstring")  dolfin::MeshEntityIterator "
+MeshEntityIterator provides a common iterator for mesh entities
+over meshes, boundaries and incidence relations. The basic use
+is illustrated below.
+
+*Example*
+    The following example shows how to iterate over all mesh entities
+    of a mesh of topological dimension dim:
+    
+    .. code-block:: python
+    
+        >>> for e in dolfin.cpp.entities(mesh, 1):
+        ...     print e.index()
+    
+    The following example shows how to iterate over mesh entities of
+    topological dimension dim connected (incident) to some mesh entity f:
+    
+    .. code-block:: python
+    
+        >>> f = dolfin.cpp.MeshEntity(mesh, 0, 0)
+        >>> for e in dolfin.cpp.entities(f, 1):
+        ...     print e.index()
+In addition to the general iterator, a set of specific named iterators
+are provided for entities of type :py:class:`Vertex`, :py:class:`Edge`, :py:class:`Face`, :py:class:`Facet`
+and :py:class:`Cell`. These iterators are defined along with their respective
+classes.
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::MeshEntityIterator "
+**Overloaded versions**
+
+* MeshEntityIterator\ ()
+
+  Default constructor
+
+* MeshEntityIterator\ (mesh, dim)
+
+  Create iterator for mesh entities over given topological dimension
+
+* MeshEntityIterator\ (entity, dim)
+
+  Create iterator for entities of given dimension connected to
+  given entity
+
+* MeshEntityIterator\ (it)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::operator++ "
+Step to next mesh entity (prefix increment)
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::operator-- "
+Step to the previous mesh entity (prefix decrease)
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::pos "
+Return current position
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::operator== "
+Comparison operator
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::operator!= "
+Comparison operator
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::operator* "
+Dereference operator
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::operator-> "
+Member access operator
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::end "
+Check if iterator has reached the end
+";
+
+%feature("docstring")  dolfin::MeshEntityIterator::end_iterator "
+Provide a safeguard iterator pointing beyond the end of an
+iteration process, either iterating over the mesh /or incident
+entities. Added to be bit more like STL iterators, since many
+algorithms rely on a kind of beyond iterator.
+";
+
+// Documentation extracted from: (module=mesh, header=MeshEntityIteratorBase.h)
+%feature("docstring")  dolfin::MeshEntityIteratorBase::MeshEntityIteratorBase "
+**Overloaded versions**
+
+* MeshEntityIteratorBase\ (mesh)
+
+  Create iterator for mesh entities over given topological dimension
+
+* MeshEntityIteratorBase\ (entity)
+
+  Create iterator for entities of given dimension connected to given entity
+
+* MeshEntityIteratorBase\ (it)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::operator++ "
+Step to next mesh entity (prefix increment)
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::operator-- "
+Step to the previous mesh entity (prefix decrease)
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::pos "
+Return current position
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::operator== "
+Comparison operator.
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::operator!= "
+Comparison operator
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::operator* "
+Dereference operator
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::operator-> "
+Member access operator
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::operator[] "
+Random access operator
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::end "
+Check if iterator has reached the end
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::end_iterator "
+Provide a safeguard iterator pointing beyond the end of an iteration
+process, either iterating over the mesh /or incident entities. Added to
+be bit more like STL iterators, since many algorithms rely on a kind of
+beyond iterator.
+";
+
+%feature("docstring")  dolfin::MeshEntityIteratorBase::set_end "
+Set pos to end position. To create a kind of mesh.end() iterator.
+";
+
+// Documentation extracted from: (module=mesh, header=SubsetIterator.h)
+%feature("docstring")  dolfin::SubsetIterator "
+A :py:class:`SubsetIterator` is similar to a :py:class:`MeshEntityIterator` but
+iterates over a specified subset of the range of entities as
+specified by a :py:class:`MeshFunction` that labels the entites.
+";
+
+%feature("docstring")  dolfin::SubsetIterator::SubsetIterator "
+**Overloaded versions**
+
+* SubsetIterator\ (labels, label)
+
+  Create iterator for given mesh function. The iterator visits
+  all entities that match the given label.
+
+* SubsetIterator\ (subset_iter)
+
+  Copy Constructor
+";
+
+%feature("docstring")  dolfin::SubsetIterator::operator++ "
+Step to next mesh entity (prefix increment)
+";
+
+%feature("docstring")  dolfin::SubsetIterator::operator== "
+Comparison operator
+";
+
+%feature("docstring")  dolfin::SubsetIterator::operator!= "
+Comparison operator
+";
+
+%feature("docstring")  dolfin::SubsetIterator::operator* "
+Dereference operator
+";
+
+%feature("docstring")  dolfin::SubsetIterator::operator-> "
+Member access operator
+";
+
+%feature("docstring")  dolfin::SubsetIterator::end "
+Check if iterator has reached the end
+";
+
+%feature("docstring")  dolfin::SubsetIterator::set_end "
+Set pos to end position. To create a kind of mesh.end() iterator.
+";
+
+// Documentation extracted from: (module=mesh, header=Vertex.h)
+%feature("docstring")  dolfin::Vertex "
+A Vertex is a MeshEntity of topological dimension 0.
+";
+
+%feature("docstring")  dolfin::Vertex::Vertex "
+**Overloaded versions**
+
+* Vertex\ (mesh, index)
+
+  Create vertex on given mesh
+
+* Vertex\ (entity)
+
+  Create vertex from mesh entity
+";
+
+%feature("docstring")  dolfin::Vertex::x "
+**Overloaded versions**
+
+* x\ (i)
+
+  Return value of vertex coordinate i
+
+* x\ ()
+
+  Return array of vertex coordinates (const version)
+";
+
+%feature("docstring")  dolfin::Vertex::point "
+Return vertex coordinates as a 3D point value
+";
+
+%feature("docstring")  dolfin::VertexFunction "
+A VertexFunction is a MeshFunction of topological dimension 0.
+";
+
+// Documentation extracted from: (module=mesh, header=Edge.h)
+%feature("docstring")  dolfin::Edge "
+An Edge is a :py:class:`MeshEntity` of topological dimension 1.
+";
+
+%feature("docstring")  dolfin::Edge::Edge "
+**Overloaded versions**
+
+* Edge\ (mesh, index)
+
+  Create edge on given mesh
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      index (int)
+          Index of the edge.
+
+* Edge\ (entity)
+
+  Create edge from mesh entity
+  
+  *Arguments*
+      entity (:py:class:`MeshEntity`)
+          The mesh entity to create an edge from.
+";
+
+%feature("docstring")  dolfin::Edge::length "
+Compute Euclidean length of edge
+
+*Returns*
+    float
+        Euclidean length of edge.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Edge::dot "
+Compute dot product between edge and other edge
+
+*Arguments*
+    edge (:py:class:`Edge`)
+        Another edge.
+
+*Returns*
+    float
+        The dot product.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::EdgeFunction "
+An EdgeFunction is a :py:class:`MeshFunction` of topological dimension 1.
+";
+
+// Documentation extracted from: (module=mesh, header=Face.h)
+%feature("docstring")  dolfin::Face "
+A Face is a MeshEntity of topological dimension 2.
+";
+
+%feature("docstring")  dolfin::Face::Face "
+Constructor
+";
+
+%feature("docstring")  dolfin::Face::area "
+Calculate the area of the face (triangle)
+";
+
+%feature("docstring")  dolfin::Face::normal "
+**Overloaded versions**
+
+* normal\ (i)
+
+  Compute component i of the normal to the face
+
+* normal\ ()
+
+  Compute normal to the face
+";
+
+%feature("docstring")  dolfin::FaceFunction "
+A FaceFunction is a MeshFunction of topological dimension 2.
+";
+
+// Documentation extracted from: (module=mesh, header=Facet.h)
+%feature("docstring")  dolfin::Facet "
+A Facet is a MeshEntity of topological codimension 1.
+";
+
+%feature("docstring")  dolfin::Facet::Facet "
+Constructor
+";
+
+%feature("docstring")  dolfin::Facet::normal "
+**Overloaded versions**
+
+* normal\ (i)
+
+  Compute component i of the normal to the facet
+
+* normal\ ()
+
+  Compute normal to the facet
+";
+
+%feature("docstring")  dolfin::Facet::exterior "
+Return true if facet is an exterior facet (relative to global mesh,
+so this function will return false for facets on partition
+boundaries). Facet connectivity must be initialized before
+calling this function.
+";
+
+%feature("docstring")  dolfin::Facet::adjacent_cells "
+Return adjacent cells. An optional argument that lists for
+each facet the index of the first cell may be given to specify
+the ordering of the two cells. If not specified, the ordering
+will depend on the (arbitrary) ordering of the mesh
+connectivity.
+";
+
+%feature("docstring")  dolfin::FacetFunction "
+A FacetFunction is a MeshFunction of topological codimension 1.
+";
+
+// Documentation extracted from: (module=mesh, header=Cell.h)
+%feature("docstring")  dolfin::Cell "
+A Cell is a :py:class:`MeshEntity` of topological codimension 0.
+";
+
+%feature("docstring")  dolfin::Cell::Cell "
+**Overloaded versions**
+
+* Cell\ ()
+
+  Create empty cell
+
+* Cell\ (mesh, index)
+
+  Create cell on given mesh with given index
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      index (int)
+          The index.
+";
+
+%feature("docstring")  dolfin::Cell::type "
+Return type of cell
+";
+
+%feature("docstring")  dolfin::Cell::orientation "
+**Overloaded versions**
+
+* orientation\ ()
+
+  Compute orientation of cell
+  
+  *Returns*
+      int
+          Orientation of the cell (0 is 'up'/'right', 1 is 'down'/'left')
+
+* orientation\ (up)
+
+  Compute orientation of cell relative to given 'up' direction
+  
+  *Arguments*
+      up (:py:class:`Point`)
+          The direction defined as 'up'
+  
+  *Returns*
+      int
+          Orientation of the cell (0 is 'same', 1 is 'opposite')
+";
+
+%feature("docstring")  dolfin::Cell::volume "
+Compute (generalized) volume of cell
+
+*Returns*
+    float
+        The volume of the cell.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Cell::diameter "
+Compute diameter of cell
+
+*Returns*
+    float
+        The diameter of the cell.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Cell::inradius "
+Compute inradius of cell
+
+*Returns*
+    float
+        Radius of the sphere inscribed in the cell.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Cell::radius_ratio "
+Compute ratio of inradius to circumradius times dim for cell.
+Useful as cell quality measure. Returns 1. for equilateral
+and 0. for degenerate cell.
+See Jonathan Richard Shewchuk: What Is a Good Linear Finite Element?,
+online: http://www.cs.berkeley.edu/~jrs/papers/elemj.pdf
+
+*Returns*
+    float
+        cell_dimension * inradius / circumradius
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::Cell::squared_distance "
+Compute squared distance to given point.
+
+*Arguments*
+    point (:py:class:`Point`)
+        The point.
+*Returns*
+    float
+        The squared distance to the point.
+";
+
+%feature("docstring")  dolfin::Cell::distance "
+Compute distance to given point.
+
+*Arguments*
+    point (:py:class:`Point`)
+        The point.
+*Returns*
+    float
+        The distance to the point.
+";
+
+%feature("docstring")  dolfin::Cell::normal "
+**Overloaded versions**
+
+* normal\ (facet, i)
+
+  Compute component i of normal of given facet with respect to the cell
+  
+  *Arguments*
+      facet (int)
+          Index of facet.
+      i (int)
+          Component.
+  
+  *Returns*
+      float
+          Component i of the normal of the facet.
+
+* normal\ (facet)
+
+  Compute normal of given facet with respect to the cell
+  
+  *Arguments*
+      facet (int)
+          Index of facet.
+  
+  *Returns*
+      :py:class:`Point`
+          Normal of the facet.
+";
+
+%feature("docstring")  dolfin::Cell::cell_normal "
+Compute normal to cell itself (viewed as embedded in 3D)
+
+*Returns*
+    :py:class:`Point`
+        Normal of the cell
+";
+
+%feature("docstring")  dolfin::Cell::facet_area "
+Compute the area/length of given facet with respect to the cell
+
+*Arguments*
+    facet (int)
+        Index of the facet.
+
+*Returns*
+    float
+        Area/length of the facet.
+";
+
+%feature("docstring")  dolfin::Cell::order "
+Order entities locally
+
+*Arguments*
+    global_vertex_indices (numpy.array(int))
+        The global vertex indices.
+";
+
+%feature("docstring")  dolfin::Cell::ordered "
+Check if entities are ordered
+
+*Arguments*
+    global_vertex_indices (numpy.array(int))
+        The global vertex indices.
+
+*Returns*
+    bool
+        True iff ordered.
+";
+
+%feature("docstring")  dolfin::Cell::contains "
+Check whether given point is contained in cell. This function is
+identical to the function collides(point).
+
+*Arguments*
+    point (:py:class:`Point`)
+        The point to be checked.
+
+*Returns*
+    bool
+        True iff point is contained in cell.
+";
+
+%feature("docstring")  dolfin::Cell::collides "
+**Overloaded versions**
+
+* collides\ (point)
+
+  Check whether given point collides with cell
+  
+  *Arguments*
+      point (:py:class:`Point`)
+          The point to be checked.
+  
+  *Returns*
+      bool
+          True iff point collides with cell.
+
+* collides\ (entity)
+
+  Check whether given entity collides with cell
+  
+  *Arguments*
+      entity (:py:class:`MeshEntity`)
+          The cell to be checked.
+  
+  *Returns*
+      bool
+          True iff entity collides with cell.
+";
+
+%feature("docstring")  dolfin::Cell::triangulate_intersection "
+Compute triangulation of intersection with given entity
+
+*Arguments*
+    entity (:py:class:`MeshEntity`)
+        The entity with which to intersect.
+
+*Returns*
+    numpy.array(float)
+        A flattened array of simplices of dimension
+        num_simplices x num_vertices x gdim =
+        num_simplices x (tdim + 1) x gdim
+";
+
+%feature("docstring")  dolfin::Cell::get_vertex_coordinates "
+Get cell vertex coordinates
+";
+
+%feature("docstring")  dolfin::Cell::get_cell_data "
+Fill UFC cell with miscellaneous data
+";
+
+%feature("docstring")  dolfin::Cell::get_cell_topology "
+Fill UFC cell with topology data
+";
+
+%feature("docstring")  dolfin::CellFunction "
+A CellFunction is a MeshFunction of topological codimension 0.
+";
+
+// Documentation extracted from: (module=mesh, header=FacetCell.h)
+%feature("docstring")  dolfin::FacetCell "
+This class represents a cell in a mesh incident to a facet on
+the boundary. It is useful in cases where one needs to iterate
+over a boundary mesh and access the corresponding cells in the
+original mesh.
+";
+
+%feature("docstring")  dolfin::FacetCell::FacetCell "
+Create cell on mesh corresponding to given facet (cell) on boundary
+";
+
+%feature("docstring")  dolfin::FacetCell::facet_index "
+Return local index of facet with respect to the cell
+";
+
+// Documentation extracted from: (module=mesh, header=MeshConnectivity.h)
+%feature("docstring")  dolfin::MeshConnectivity "
+Mesh connectivity stores a sparse data structure of connections
+(incidence relations) between mesh entities for a fixed pair of
+topological dimensions.
+
+The connectivity can be specified either by first giving the
+number of entities and the number of connections for each entity,
+which may either be equal for all entities or different, or by
+giving the entire (sparse) connectivity pattern.
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::MeshConnectivity "
+**Overloaded versions**
+
+* MeshConnectivity\ (d0, d1)
+
+  Create empty connectivity between given dimensions (d0 -- d1)
+
+* MeshConnectivity\ (connectivity)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::operator= "
+Assignment
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::empty "
+Return true if the total number of connections is equal to zero
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::size "
+**Overloaded versions**
+
+* size\ ()
+
+  Return total number of connections
+
+* size\ (entity)
+
+  Return number of connections for given entity
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::size_global "
+Return global number of connections for given entity
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::operator "
+**Overloaded versions**
+
+* operator\ (entity)
+
+  Return array of connections for given entity
+
+* operator\ ()
+
+  Return contiguous array of connections for all entities
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::clear "
+Clear all data
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::init "
+**Overloaded versions**
+
+* init\ (num_entities, num_connections)
+
+  Initialize number of entities and number of connections (equal
+  for all)
+
+* init\ (num_connections)
+
+  Initialize number of entities and number of connections
+  (individually)
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::set "
+**Overloaded versions**
+
+* set\ (entity, connection, pos)
+
+  Set given connection for given entity
+
+* set\ (entity, connections)
+
+  Set all connections for given entity
+
+* set\ (entity, connections)
+
+  Set all connections for given entity
+
+* set\ (connections)
+
+  Set all connections for all entities (T is a container, e.g.
+  a std::vector<std::size_t>, std::set<std::size_t>, etc)
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::set_global_size "
+Set global number of connections for all local entities
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::hash "
+Hash of connections
+";
+
+%feature("docstring")  dolfin::MeshConnectivity::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=mesh, header=MeshEditor.h)
+%feature("docstring")  dolfin::MeshEditor "
+A simple mesh editor for creating simplicial meshes in 1D, 2D
+and 3D.
+";
+
+%feature("docstring")  dolfin::MeshEditor::MeshEditor "
+Constructor
+";
+
+%feature("docstring")  dolfin::MeshEditor::open "
+**Overloaded versions**
+
+* open\ (mesh, tdim, gdim)
+
+  Open mesh of given topological and geometrical dimension
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to open.
+      tdim (int)
+          The topological dimension.
+      gdim (int)
+          The geometrical dimension.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* open\ (mesh, type, tdim, gdim)
+
+  Open mesh of given cell type, topological and geometrical dimension
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to open.
+      type (CellType::Type)
+          Cell type.
+      tdim (int)
+          The topological dimension.
+      gdim (int)
+          The geometrical dimension.
+
+* open\ (mesh, type, tdim, gdim)
+
+  Open mesh of given cell type, topological and geometrical dimension
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to open.
+      type (str)
+          Cell type.
+      tdim (int)
+          The topological dimension.
+      gdim (int)
+          The geometrical dimension.
+";
+
+%feature("docstring")  dolfin::MeshEditor::init_vertices "
+Specify number of vertices (serial version)
+
+*Arguments*
+    num_vertices (int)
+        The number of vertices.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::MeshEditor::init_vertices_global "
+Specify number of vertices (distributed version)
+
+*Arguments*
+    num_local_vertices (int)
+        The number of vertices on this process.
+    num_global_vertices (int)
+        The number of vertices in distributed mesh.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::MeshEditor::init_cells "
+Specify number of cells (serial version)
+
+*Arguments*
+    num_cells (int)
+        The number of cells.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::MeshEditor::init_cells_global "
+Specify number of cells (distributed version)
+
+*Arguments*
+    num_local_cells (int)
+        The number of local cells.
+    num_global_cells (int)
+        The number of cells in distributed mesh.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::MeshEditor::add_vertex "
+**Overloaded versions**
+
+* add_vertex\ (index, p)
+
+  Add vertex v at given point p
+  
+  *Arguments*
+      index (int)
+          The vertex (index).
+      p (:py:class:`Point`)
+          The point.
+
+* add_vertex\ (index, x)
+
+  Add vertex v at given coordinate x
+  
+  *Arguments*
+      index (int)
+          The vertex (index).
+      x (numpy.array(float))
+          The x-coordinates.
+
+* add_vertex\ (index, x)
+
+  Add vertex v at given point x (for a 1D mesh)
+  
+  *Arguments*
+      index (int)
+          The vertex (index).
+      x (float)
+          The x-coordinate.
+
+* add_vertex\ (index, x, y)
+
+  Add vertex v at given point (x, y) (for a 2D mesh)
+  
+  *Arguments*
+      index (int)
+          The vertex (index).
+      x (float)
+          The x-coordinate.
+      y (float)
+          The y-coordinate.
+
+* add_vertex\ (index, x, y, z)
+
+  Add vertex v at given point (x, y, z) (for a 3D mesh)
+  
+  *Arguments*
+      index (int)
+          The vertex (index).
+      x (float)
+          The x-coordinate.
+      y (float)
+          The y-coordinate.
+      z (float)
+          The z-coordinate.
+";
+
+%feature("docstring")  dolfin::MeshEditor::add_vertex_global "
+**Overloaded versions**
+
+* add_vertex_global\ (local_index, global_index, p)
+
+  Add vertex v at given point p
+  
+  *Arguments*
+      local_index (int)
+          The vertex (local index).
+      global_index (int)
+          The vertex (global_index).
+      p (:py:class:`Point`)
+          The point.
+
+* add_vertex_global\ (local_index, global_index, x)
+
+  Add vertex v at given coordinate x
+  
+  *Arguments*
+      local_index (int)
+          The vertex (local index).
+      global_index (int)
+          The vertex (global_index).
+      x (numpy.array(float))
+          The x-coordinates.
+";
+
+%feature("docstring")  dolfin::MeshEditor::add_cell "
+**Overloaded versions**
+
+* add_cell\ (c, v0, v1)
+
+  Add cell with given vertices (1D)
+  
+  *Arguments*
+      c (int)
+          The cell (index).
+      v0 (numpy.array(int))
+          The first vertex (local index).
+      v1 (numpy.array(int))
+          The second vertex (local index).
+
+* add_cell\ (c, v0, v1, v2)
+
+  Add cell with given vertices (2D)
+  
+  *Arguments*
+      c (int)
+          The cell (index).
+      v0 (numpy.array(int))
+          The first vertex (local index).
+      v1 (numpy.array(int))
+          The second vertex (local index).
+      v2 (numpy.array(int))
+          The third vertex (local index).
+
+* add_cell\ (c, v0, v1, v2, v3)
+
+  Add cell with given vertices (3D)
+  
+  *Arguments*
+      c (int)
+          The cell (index).
+      v0 (numpy.array(int))
+          The first vertex (local index).
+      v1 (numpy.array(int))
+          The second vertex (local index).
+      v2 (numpy.array(int))
+          The third vertex (local index).
+      v3 (numpy.array(int))
+          The fourth vertex (local index).
+
+* add_cell\ (c, v)
+
+  Add cell with given vertices
+  
+  *Arguments*
+      c (int)
+          The cell (index).
+      v (numpy.array(int))
+          The vertex indices (local indices)
+
+* add_cell\ (local_index, global_index, v)
+
+  Add cell with given vertices
+  
+  *Arguments*
+      local_index (int)
+          The cell (index).
+      global_index (int)
+          The global (user) cell index.
+      v (numpy.array(int))
+          The vertex indices (local indices)
+";
+
+%feature("docstring")  dolfin::MeshEditor::close "
+Close mesh, finish editing, and order entities locally
+
+*Arguments*
+    order (bool)
+        Order entities locally if true. Default values is true.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+// Documentation extracted from: (module=mesh, header=DynamicMeshEditor.h)
+%feature("docstring")  dolfin::DynamicMeshEditor "
+This class provides an interface for dynamic editing of meshes,
+that is, when the number of vertices and cells are not known
+a priori. If the number of vertices and cells are known a priori,
+it is more efficient to use the default editor MeshEditor.
+";
+
+%feature("docstring")  dolfin::DynamicMeshEditor::DynamicMeshEditor "
+Constructor
+";
+
+%feature("docstring")  dolfin::DynamicMeshEditor::open "
+**Overloaded versions**
+
+* open\ (mesh, type, tdim, gdim, num_global_vertices, num_global_cells)
+
+  Open mesh of given cell type, topological and geometrical dimension
+
+* open\ (mesh, type, tdim, gdim, num_global_vertices, num_global_cells)
+
+  Open mesh of given cell type, topological and geometrical dimension
+";
+
+%feature("docstring")  dolfin::DynamicMeshEditor::add_vertex "
+**Overloaded versions**
+
+* add_vertex\ (v, p)
+
+  Add vertex v at given point p
+
+* add_vertex\ (v, x)
+
+  Add vertex v at given coordinate x
+
+* add_vertex\ (v, x, y)
+
+  Add vertex v at given coordinate (x, y)
+
+* add_vertex\ (v, x, y, z)
+
+  Add vertex v at given coordinate (x, y, z)
+";
+
+%feature("docstring")  dolfin::DynamicMeshEditor::add_cell "
+**Overloaded versions**
+
+* add_cell\ (c, v)
+
+  Add cell with given vertices
+
+* add_cell\ (c, v0, v1)
+
+  Add cell (interval) with given vertices
+
+* add_cell\ (c, v0, v1, v2)
+
+  Add cell (triangle) with given vertices
+
+* add_cell\ (c, v0, v1, v2, v3)
+
+  Add cell (tetrahedron) with given vertices
+";
+
+%feature("docstring")  dolfin::DynamicMeshEditor::close "
+Close mesh, finish editing, and order entities locally
+";
+
+// Documentation extracted from: (module=mesh, header=LocalMeshValueCollection.h)
+%feature("docstring")  dolfin::LocalMeshValueCollection "
+This class stores mesh data on a local processor corresponding
+to a portion of a MeshValueCollection.
+";
+
+%feature("docstring")  dolfin::LocalMeshValueCollection::LocalMeshValueCollection "
+Create local mesh data for given LocalMeshValueCollection
+";
+
+%feature("docstring")  dolfin::LocalMeshValueCollection::dim "
+Return dimension of cell entity
+";
+
+%feature("docstring")  dolfin::LocalMeshValueCollection::values "
+Return data
+";
+
+// Documentation extracted from: (module=mesh, header=MeshFunction.h)
+%feature("docstring")  dolfin::MeshFunction "
+A MeshFunction is a function that can be evaluated at a set of
+mesh entities. A MeshFunction is discrete and is only defined
+at the set of mesh entities of a fixed topological dimension.
+A MeshFunction may for example be used to store a global
+numbering scheme for the entities of a (parallel) mesh, marking
+sub domains or boolean markers for mesh refinement.
+";
+
+%feature("docstring")  dolfin::MeshFunction::MeshFunction "
+**Overloaded versions**
+
+* MeshFunction\ ()
+
+  Create empty mesh function
+
+* MeshFunction\ (mesh)
+
+  Create empty mesh function on given mesh
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+
+* MeshFunction\ (mesh)
+
+  Create empty mesh function on given mesh (shared_ptr version)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+
+* MeshFunction\ (mesh, dim)
+
+  Create mesh function of given dimension on given mesh
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      dim (int)
+          The mesh entity dimension for the mesh function.
+
+* MeshFunction\ (mesh, dim)
+
+  Create mesh function of given dimension on given mesh
+  (shared_ptr version)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      dim (int)
+          The mesh entity dimension for the mesh function.
+
+* MeshFunction\ (mesh, dim, value)
+
+  Create mesh of given dimension on given mesh and initialize
+  to a value
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      dim (int)
+          The mesh entity dimension.
+      value (T)
+          The value.
+
+* MeshFunction\ (mesh, dim, value)
+
+  Create mesh of given dimension on given mesh and initialize
+  to a value (shared_ptr version)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      dim (int)
+          The mesh entity dimension.
+      value (T)
+          The value.
+
+* MeshFunction\ (mesh, filename)
+
+  Create function from data file
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      filename (str)
+          The filename to create mesh function from.
+
+* MeshFunction\ (mesh, filename)
+
+  Create function from data file (shared_ptr version)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      filename (str)
+          The filename to create mesh function from.
+
+* MeshFunction\ (mesh, value_collection)
+
+  Create function from a MeshValueCollecion
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      value_collection (:py:class:`MeshValueCollection`)
+          The mesh value collection for the mesh function data.
+
+* MeshFunction\ (mesh, value_collection)
+
+  Create function from a MeshValueCollecion (shared_ptr version)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      value_collection (:py:class:`MeshValueCollection`)
+          The mesh value collection for the mesh function data.
+
+* MeshFunction\ (mesh, dim, domains)
+
+  Create function from MeshDomains
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to create mesh function on.
+      dim (int)
+          The dimension of the MeshFunction
+      domains (:py:class:`MeshDomains`)
+          The domains from which to extratc the domain markers
+
+* MeshFunction\ (f)
+
+  Copy constructor
+  
+  *Arguments*
+      f (:py:class:`MeshFunction`)
+          The object to be copied.
+";
+
+%feature("docstring")  dolfin::MeshFunction::operator= "
+**Overloaded versions**
+
+* operator=\ (f)
+
+  Assign mesh function to other mesh function
+  Assignment operator
+  
+  *Arguments*
+      f (:py:class:`MeshFunction`)
+          A :py:class:`MeshFunction` object to asssign to another MeshFunction.
+
+* operator=\ (mesh)
+
+  Assignment operator
+  
+  *Arguments*
+      mesh (:py:class:`MeshValueCollection`)
+          A :py:class:`MeshValueCollection` object used to construct a MeshFunction.
+
+* operator=\ (value)
+
+  Set all values to given value
+";
+
+%feature("docstring")  dolfin::MeshFunction::mesh "
+Return mesh associated with mesh function
+
+*Returns*
+    :py:class:`Mesh`
+        The mesh.
+";
+
+%feature("docstring")  dolfin::MeshFunction::dim "
+Return topological dimension
+
+*Returns*
+    int
+        The dimension.
+";
+
+%feature("docstring")  dolfin::MeshFunction::empty "
+Return true if empty
+
+*Returns*
+    bool
+        True if empty.
+";
+
+%feature("docstring")  dolfin::MeshFunction::size "
+Return size (number of entities)
+
+*Returns*
+    int
+        The size.
+";
+
+%feature("docstring")  dolfin::MeshFunction::values "
+**Overloaded versions**
+
+* values\ ()
+
+  Return array of values (const. version)
+  
+  *Returns*
+      T
+          The values.
+
+* values\ ()
+
+  Return array of values
+  
+  *Returns*
+      T
+          The values.
+";
+
+%feature("docstring")  dolfin::MeshFunction::operator[] "
+**Overloaded versions**
+
+* operator[]\ (entity)
+
+  Return value at given mesh entity
+  
+  *Arguments*
+      entity (:py:class:`MeshEntity`)
+          The mesh entity.
+  
+  *Returns*
+      T
+          The value at the given entity.
+
+* operator[]\ (entity)
+
+  Return value at given mesh entity (const version)
+  
+  *Arguments*
+      entity (:py:class:`MeshEntity`)
+          The mesh entity.
+  
+  *Returns*
+      T
+          The value at the given entity.
+
+* operator[]\ (index)
+
+  Return value at given index
+  
+  *Arguments*
+      index (int)
+          The index.
+  
+  *Returns*
+      T
+          The value at the given index.
+
+* operator[]\ (index)
+
+  Return value at given index  (const version)
+  
+  *Arguments*
+      index (int)
+          The index.
+  
+  *Returns*
+      T
+          The value at the given index.
+";
+
+%feature("docstring")  dolfin::MeshFunction::init "
+**Overloaded versions**
+
+* init\ (dim)
+
+  Initialize mesh function for given topological dimension
+  
+  *Arguments*
+      dim (int)
+          The dimension.
+
+* init\ (dim, size)
+
+  Initialize mesh function for given topological dimension of
+  given size
+  
+  *Arguments*
+      dim (int)
+          The dimension.
+      size (int)
+          The size.
+
+* init\ (mesh, dim)
+
+  Initialize mesh function for given topological dimension
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      dim (int)
+          The dimension.
+
+* init\ (mesh, dim)
+
+  Initialize mesh function for given topological dimension
+  (shared_ptr version)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      dim (int)
+          The dimension.
+
+* init\ (mesh, dim, size)
+
+  Initialize mesh function for given topological dimension of
+  given size
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      dim (int)
+          The dimension.
+      size (int)
+          The size.
+
+* init\ (mesh, dim, size)
+
+  Initialize mesh function for given topological dimension of
+  given size (shared_ptr version)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      dim (int)
+          The dimension.
+      size (int)
+          The size.
+";
+
+%feature("docstring")  dolfin::MeshFunction::set_value "
+**Overloaded versions**
+
+* set_value\ (index, value)
+
+  Set value at given index
+  
+  *Arguments*
+      index (int)
+          The index.
+      value (T)
+          The value.
+
+* set_value\ (index, value, mesh)
+
+  Compatibility function for use in SubDomains
+";
+
+%feature("docstring")  dolfin::MeshFunction::set_values "
+Set values
+
+*Arguments*
+    values (std::vector<T>)
+        The values.
+";
+
+%feature("docstring")  dolfin::MeshFunction::set_all "
+Set all values to given value
+
+*Arguments*
+    value (T)
+        The value to set all values to.
+";
+
+%feature("docstring")  dolfin::MeshFunction::str "
+Return informal string representation (pretty-print)
+
+*Arguments*
+    verbose (bool)
+        Flag to turn on additional output.
+
+*Returns*
+    str
+        An informal representation.
+";
+
+// Documentation extracted from: (module=mesh, header=MeshValueCollection.h)
+%feature("docstring")  dolfin::MeshValueCollection "
+The MeshValueCollection class can be used to store data
+associated with a subset of the entities of a mesh of a given
+topological dimension. It differs from the MeshFunction class in
+two ways. First, data does not need to be associated with all
+entities (only a subset). Second, data is associated with
+entities through the corresponding cell index and local entity
+number (relative to the cell), not by global entity index, which
+means that data may be stored robustly to file.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::MeshValueCollection "
+**Overloaded versions**
+
+* MeshValueCollection\ ()
+
+  Create empty mesh value collection
+  
+
+* MeshValueCollection\ (mesh)
+
+  Create an empty mesh value collection on a given mesh
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+
+* MeshValueCollection\ (mesh_function)
+
+  Create a mesh value collection from a MeshFunction
+  
+  *Arguments*
+      mesh_function (:py:class:`MeshFunction`)
+          The mesh function for creating a MeshValueCollection.
+
+* MeshValueCollection\ (mesh, dim)
+
+  Create a mesh value collection of entities of given dimension
+  on a given mesh
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh associated with the collection.
+      dim (int)
+          The mesh entity dimension for the mesh value collection.
+
+* MeshValueCollection\ (mesh, dim)
+
+  Create a mesh value collection of entities of given dimension
+  on a given mesh (shared_ptr version)
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh associated with the collection.
+      dim (int)
+          The mesh entity dimension for the mesh value collection.
+
+* MeshValueCollection\ (mesh, filename)
+
+  Create a mesh value collection from a file.
+  
+  *Arguments*
+      mesh (Mesh)
+          A mesh associated with the collection. The mesh is used to
+          map collection values to the appropriate process.
+      filename (str)
+          The XML file name.
+      dim (int)
+          The mesh entity dimension for the mesh value collection.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::operator= "
+**Overloaded versions**
+
+* operator=\ (mesh_function)
+
+  Assignment operator
+  
+  *Arguments*
+      mesh_function (:py:class:`MeshFunction`)
+          A :py:class:`MeshFunction` object used to construct a
+          MeshValueCollection.
+
+* operator=\ (mesh_value_collection)
+
+  Assignment operator
+  
+  *Arguments*
+      mesh_value_collection (:py:class:`MeshValueCollection`)
+          A :py:class:`MeshValueCollection` object used to construct a
+          MeshValueCollection.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::init "
+**Overloaded versions**
+
+* init\ (mesh, dim)
+
+  Initialise MeshValueCollection wirth mesh and dimension
+  
+  *Arguments*
+      mesh (_mesh)
+          The mesh on which the value collection is defined
+      dim (int)
+          The mesh entity dimension for the mesh value collection.
+
+* init\ (mesh, dim)
+
+  Initialise MeshValueCollection wirth mesh and dimension
+  (shared_ptr version)
+  
+  *Arguments*
+      mesh (_mesh)
+          The mesh on which the value collection is defined
+      dim (int)
+          The mesh entity dimension for the mesh value collection.
+
+* init\ (dim)
+
+  Set dimension. This function should not generally be used. It is
+  for reading MeshValueCollections as the dimension is not
+  generally known at construction.
+  
+  *Arguments*
+      dim (int)
+          The mesh entity dimension for the mesh value collection.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::dim "
+Return topological dimension
+
+*Returns*
+    int
+        The dimension.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::mesh "
+Return associated mesh
+
+*Returns*
+    :py:class:`Mesh`
+        The mesh.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::empty "
+Return true if the subset is empty
+
+*Returns*
+    bool
+        True if the subset is empty.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::size "
+Return size (number of entities in subset)
+
+*Returns*
+    int
+        The size.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::set_value "
+**Overloaded versions**
+
+* set_value\ (cell_index, local_entity, value)
+
+  Set marker value for given entity defined by a cell index and
+  a local entity index
+  
+  *Arguments*
+      cell_index (int)
+          The index of the cell.
+      local_entity (int)
+          The local index of the entity relative to the cell.
+      marker_value (T)
+          The value of the marker.
+  
+  *Returns*
+      bool
+          True is a new value is inserted, false if overwriting
+          an existing value.
+
+* set_value\ (entity_index, value)
+
+  Set value for given entity index
+  
+  *Arguments*
+      entity_index (int)
+          Index of the entity.
+      value (T)
+          The value of the marker.
+      mesh (:py:class:`Mesh`)
+          The mesh.
+  
+  *Returns*
+      bool
+          True is a new value is inserted, false if overwriting
+          an existing value.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::get_value "
+Get marker value for given entity defined by a cell index and
+a local entity index
+
+*Arguments*
+    cell_index (int)
+        The index of the cell.
+    local_entity (int)
+        The local index of the entity relative to the cell.
+
+*Returns*
+    marker_value (T)
+        The value of the marker.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::values "
+**Overloaded versions**
+
+* values\ ()
+
+  Get all values
+  
+  *Returns*
+      std::map<std::pair<std::size_t, std::size_t>, T>
+          A map from positions to values.
+
+* values\ ()
+
+  Get all values (const version)
+  
+  *Returns*
+      std::map<std::pair<std::size_t, std::size_t>, T>
+          A map from positions to values.
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::clear "
+Clear all values
+";
+
+%feature("docstring")  dolfin::MeshValueCollection::str "
+Return informal string representation (pretty-print)
+
+*Arguments*
+    verbose (bool)
+        Flag to turn on additional output.
+
+*Returns*
+    str
+        An informal representation.
+";
+
+// Documentation extracted from: (module=mesh, header=MeshColoring.h)
+%feature("docstring")  dolfin::MeshColoring "
+This class computes colorings for a local mesh. It supports
+vertex, edge, and facet-based colorings.
+";
+
+%feature("docstring")  dolfin::MeshColoring::color_cells "
+Color the cells of a mesh for given coloring type, which can
+be one of \"vertex\", \"edge\" or \"facet\". Coloring is saved in the
+mesh topology
+";
+
+%feature("docstring")  dolfin::MeshColoring::color "
+Color the cells of a mesh for given coloring type specified by
+topological dimension, which can be one of 0, 1 or D - 1. Coloring
+is saved in the mesh topology
+";
+
+%feature("docstring")  dolfin::MeshColoring::compute_colors "
+Compute cell colors for given coloring type specified by
+topological dimension, which can be one of 0, 1 or D - 1.
+";
+
+%feature("docstring")  dolfin::MeshColoring::cell_colors "
+**Overloaded versions**
+
+* cell_colors\ (mesh, coloring_type)
+
+  Return a MeshFunction with the cell colors (used for visualisation)
+
+* cell_colors\ (mesh, coloring_type)
+
+  Return a MeshFunction with the cell colors (used for visualisation)
+";
+
+%feature("docstring")  dolfin::MeshColoring::type_to_dim "
+Convert coloring type to topological dimension
+";
+
+// Documentation extracted from: (module=mesh, header=MeshRenumbering.h)
+%feature("docstring")  dolfin::MeshRenumbering "
+This class implements renumbering algorithms for meshes.
+";
+
+// Documentation extracted from: (module=mesh, header=MeshTransformation.h)
+%feature("docstring")  dolfin::MeshTransformation "
+This class implements various transformations of the coordinates
+of a mesh.
+";
+
+%feature("docstring")  dolfin::MeshTransformation::translate "
+Translate mesh according to a given vector.
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        The mesh
+    point (Point)
+        The vector defining the translation.
+";
+
+%feature("docstring")  dolfin::MeshTransformation::rotate "
+**Overloaded versions**
+
+* rotate\ (mesh, angle, axis)
+
+  Rotate mesh around a coordinate axis through center of mass
+  of all mesh vertices
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      angle (float)
+          The number of degrees (0-360) of rotation.
+      axis (int)
+          The coordinate axis around which to rotate the mesh.
+
+* rotate\ (mesh, angle, axis, p)
+
+  Rotate mesh around a coordinate axis through a given point
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh.
+      angle (float)
+          The number of degrees (0-360) of rotation.
+      axis (int)
+          The coordinate axis around which to rotate the mesh.
+      point (:py:class:`Point`)
+          The point around which to rotate the mesh.
+";
+
+// Documentation extracted from: (module=mesh, header=LocalMeshData.h)
+%feature("docstring")  dolfin::LocalMeshData "
+This class stores mesh data on a local processor corresponding
+to a portion of a (larger) global mesh.
+
+Note that the data stored in this class does typically not
+correspond to a topologically connected mesh; it merely stores a
+list of vertex coordinates, a list of cell-vertex mappings and a
+list of global vertex numbers for the locally stored vertices.
+
+It is typically used for parsing meshes in parallel from mesh
+XML files. After local mesh data has been parsed on each
+processor, a subsequent repartitioning takes place: first a
+geometric partitioning of the vertices followed by a
+redistribution of vertex and cell data, and then a topological
+partitioning again followed by redistribution of vertex and cell
+data, at that point corresponding to topologically connected
+meshes instead of local mesh data.
+";
+
+%feature("docstring")  dolfin::LocalMeshData::LocalMeshData "
+**Overloaded versions**
+
+* LocalMeshData\ (mpi_comm)
+
+  Create empty local mesh data
+
+* LocalMeshData\ (mesh)
+
+  Create local mesh data for given mesh
+";
+
+%feature("docstring")  dolfin::LocalMeshData::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=mesh, header=SubDomain.h)
+%feature("docstring")  dolfin::SubDomain "
+This class defines the interface for definition of subdomains.
+Alternatively, subdomains may be defined by a :py:class:`Mesh` and a
+:py:class:`MeshFunction` <std::size_t> over the mesh.
+";
+
+%feature("docstring")  dolfin::SubDomain::SubDomain "
+Constructor
+
+*Arguments*
+    map_tol (float)
+        The tolerance used when identifying mapped points using
+        the function SubDomain::map.
+";
+
+%feature("docstring")  dolfin::SubDomain::inside "
+Return true for points inside the subdomain
+
+*Arguments*
+    x (numpy.array(float))
+        The coordinates of the point.
+    on_boundary (bool)
+        True for points on the boundary.
+
+*Returns*
+    bool
+        True for points inside the subdomain.
+";
+
+%feature("docstring")  dolfin::SubDomain::map "
+Map coordinate x in domain H to coordinate y in domain G (used for
+periodic boundary conditions)
+
+*Arguments*
+    x (numpy.array(float))
+        The coordinates in domain H.
+    y (numpy.array(float))
+        The coordinates in domain G.
+";
+
+%feature("docstring")  dolfin::SubDomain::snap "
+Snap coordinate to boundary of subdomain
+
+*Arguments*
+    x (numpy.array(float))
+        The coordinates.
+";
+
+%feature("docstring")  dolfin::SubDomain::mark_cells "
+Set subdomain markers (std::size_t) on cells for given subdomain number
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        The mesh to be marked.
+    sub_domain (int)
+        The subdomain number.
+    check_midpoint (bool)
+        Flag for whether midpoint of cell should be checked (default).
+";
+
+%feature("docstring")  dolfin::SubDomain::mark_facets "
+Set subdomain markers (std::size_t) on facets for given subdomain number
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        The mesh to be marked.
+    sub_domain (int)
+        The subdomain number.
+    check_midpoint (bool)
+        Flag for whether midpoint of cell should be checked (default).
+";
+
+%feature("docstring")  dolfin::SubDomain::mark "
+**Overloaded versions**
+
+* mark\ (mesh, dim, sub_domain, check_midpoint=true)
+
+  Set subdomain markers (std::size_t) for given topological dimension
+  and subdomain number
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to be marked.
+      dim (int)
+          The topological dimension of entities to be marked.
+      sub_domain (int)
+          The subdomain number.
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+
+* mark\ (sub_domains, sub_domain, check_midpoint=true)
+
+  Set subdomain markers (std::size_t) for given subdomain number
+  
+  *Arguments*
+      sub_domains (:py:class:`MeshFunction`)
+          The subdomain markers.
+      sub_domain (int)
+          The subdomain number.
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+
+* mark\ (sub_domains, sub_domain, check_midpoint=true)
+
+  Set subdomain markers (int) for given subdomain number
+  
+  *Arguments*
+      sub_domains (:py:class:`MeshFunction`)
+          The subdomain markers.
+      sub_domain (int)
+          The subdomain number.
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+
+* mark\ (sub_domains, sub_domain, check_midpoint=true)
+
+  Set subdomain markers (double) for given subdomain number
+  
+  *Arguments*
+      sub_domains (:py:class:`MeshFunction`)
+          The subdomain markers.
+      sub_domain (float)
+          The subdomain number.
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+
+* mark\ (sub_domains, sub_domain, check_midpoint=true)
+
+  Set subdomain markers (bool) for given subdomain
+  
+  *Arguments*
+      sub_domains (:py:class:`MeshFunction`)
+          The subdomain markers.
+      sub_domain (bool)
+          The subdomain number.
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+
+* mark\ (sub_domains, sub_domain, mesh, check_midpoint=true)
+
+  Set subdomain markers (std::size_t) for given subdomain number
+  
+  *Arguments*
+      sub_domains (:py:class:`MeshValueCollection`)
+          The subdomain markers.
+      sub_domain (int)
+          The subdomain number.
+      mesn (:py:class:`Mesh`)
+          The mesh.
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+
+* mark\ (sub_domains, sub_domain, mesh, check_midpoint=true)
+
+  Set subdomain markers (int) for given subdomain number
+  
+  *Arguments*
+      sub_domains (:py:class:`MeshValueCollection`)
+          The subdomain markers
+      sub_domain (int)
+          The subdomain number
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+
+* mark\ (sub_domains, sub_domain, mesh, check_midpoint=true)
+
+  Set subdomain markers (double) for given subdomain number
+  
+  *Arguments*
+      sub_domains (:py:class:`MeshValueCollection`)
+          The subdomain markers.
+      sub_domain (float)
+          The subdomain number
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+
+* mark\ (sub_domains, sub_domain, mesh, check_midpoint=true)
+
+  Set subdomain markers (bool) for given subdomain
+  
+  *Arguments*
+      sub_domains (:py:class:`MeshValueCollection`)
+          The subdomain markers
+      sub_domain (bool)
+          The subdomain number
+      check_midpoint (bool)
+          Flag for whether midpoint of cell should be checked (default).
+";
+
+%feature("docstring")  dolfin::SubDomain::geometric_dimension "
+Return geometric dimension
+
+*Returns*
+    int
+        The geometric dimension.
+";
+
+%feature("docstring")  dolfin::SubDomain::apply_markers "
+Apply marker of type T (most likely an std::size_t) to object of class
+S (most likely MeshFunction or MeshValueCollection)
+";
+
+// Documentation extracted from: (module=mesh, header=SubMesh.h)
+%feature("docstring")  dolfin::SubMesh "
+A SubMesh is a mesh defined as a subset of a given mesh. It
+provides a convenient way to create matching meshes for
+multiphysics applications by creating meshes for subdomains as
+subsets of a single global mesh. A mapping from the vertices of
+the sub mesh to the vertices of the parent mesh is stored as the
+mesh data named \"parent_vertex_indices\".
+";
+
+%feature("docstring")  dolfin::SubMesh::SubMesh "
+**Overloaded versions**
+
+* SubMesh\ (mesh, sub_domain)
+
+  Create subset of given mesh marked by sub domain
+
+* SubMesh\ (mesh, sub_domains, sub_domain)
+
+  Create subset of given mesh marked by mesh function
+
+* SubMesh\ (mesh, sub_domain)
+
+  Create subset of given mesh from stored MeshValueCollection
+";
+
+%feature("docstring")  dolfin::SubMesh::init "
+Create sub mesh
+";
+
+// Documentation extracted from: (module=mesh, header=Restriction.h)
+%feature("docstring")  dolfin::Restriction "
+This class represents a restriction of a mesh to a subdomain,
+which can be defined as a subset of all the cells, the facets,
+or possibly lower dimensional entities of the mesh.
+";
+
+%feature("docstring")  dolfin::Restriction::Restriction "
+**Overloaded versions**
+
+* Restriction\ (mesh, sub_domain)
+
+  Create cell-based restriction from subdomain
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh
+      sub_domain (:py:class:`SubDomain`)
+          Sub domain defining the restriction
+
+* Restriction\ (mesh, sub_domain, dim)
+
+  Create restriction from subdomain to entities of arbitrary dimension
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh
+      sub_domain (:py:class:`SubDomain`)
+          Sub domain defining the restriction
+      dim (int)
+          Dimension of restriction
+
+* Restriction\ (domain_markers, domain_number)
+
+  Create restriction from domain markers
+  
+  *Arguments*
+      domain_markers (:py:class:`MeshFunction`)
+          Domain markers for the cells of the mesh.
+      domain_number (int)
+          Identifier for domain.
+
+* Restriction\ (domain_markers, domain_number)
+
+  Create restriction from domain markers (shared pointer version)
+  
+  *Arguments*
+      domain_markers (:py:class:`MeshFunction`)
+          Domain markers for the cells of the mesh.
+      domain_number (int)
+          Identifier for domain.
+";
+
+%feature("docstring")  dolfin::Restriction::mesh "
+Return the full unrestricted mesh
+";
+
+%feature("docstring")  dolfin::Restriction::dim "
+Return topological dimension of restriction
+";
+
+%feature("docstring")  dolfin::Restriction::contains "
+**Overloaded versions**
+
+* contains\ (entity)
+
+  Check whether restriction contains entity
+
+* contains\ (d, i)
+
+  Check whether restriction contains entity (d, i)
+";
+
+// Documentation extracted from: (module=mesh, header=DomainBoundary.h)
+%feature("docstring")  dolfin::DomainBoundary "
+This class provides a SubDomain which picks out the boundary of
+a mesh, and provides a convenient way to specify boundary
+conditions on the entire boundary of a mesh.
+";
+
+%feature("docstring")  dolfin::DomainBoundary::DomainBoundary "
+Constructor
+";
+
+%feature("docstring")  dolfin::DomainBoundary::inside "
+Return true for points on the boundary
+";
+
+// Documentation extracted from: (module=mesh, header=BoundaryMesh.h)
+%feature("docstring")  dolfin::BoundaryMesh "
+A BoundaryMesh is a mesh over the boundary of some given mesh.
+The cells of the boundary mesh (facets of the original mesh) are
+oriented to produce outward pointing normals relative to the
+original mesh.
+";
+
+%feature("docstring")  dolfin::BoundaryMesh::BoundaryMesh "
+Create boundary mesh from given mesh.
+
+*Arguments*
+    mesh (:py:class:`Mesh`)
+        Another :py:class:`Mesh` object.
+    type (_std::string_)
+        The type of BoundaryMesh, which can be \"exterior\",
+        \"interior\" or \"local\". \"exterior\" is the globally
+        external boundary, \"interior\" is the inter-process mesh
+        and \"local\" is the boudary of the local (this process)
+        mesh.
+    order (bool)
+        Optional argument which can be used to control whether
+        or not the boundary mesh should be ordered according
+        to the UFC ordering convention. If set to false, the
+        boundary mesh will be ordered with right-oriented
+        facets (outward-pointing unit normals). The default
+        value is true.
+";
+
+%feature("docstring")  dolfin::BoundaryMesh::entity_map "
+**Overloaded versions**
+
+* entity_map\ (d)
+
+  Get index map for entities of dimension d in the boundary mesh
+  to the entity in the original full mesh
+
+* entity_map\ (d)
+
+  Get index map for entities of dimension d in the boundary mesh
+  to the entity in the original full mesh (const version)
+";
+
+// Documentation extracted from: (module=mesh, header=PeriodicBoundaryComputation.h)
+%feature("docstring")  dolfin::PeriodicBoundaryComputation "
+This class computes map from slave entity to master entity
+";
+
+%feature("docstring")  dolfin::PeriodicBoundaryComputation::compute_periodic_pairs "
+For entities of dimension dim, compute map from a slave entity
+on this process (local index) to its master entity (owning
+process, local index on owner). If a master entity is shared
+by processes, only one of the owning processes is returned.
+";
+
+%feature("docstring")  dolfin::PeriodicBoundaryComputation::masters_slaves "
+This function returns a MeshFunction which marks mesh entities
+of dimension dim according to:
+
+    2: slave entities
+    1: master entities
+    0: all other entities
+
+It is useful for visualising and debugging the Expression::map
+function that is used to apply periodic boundary conditions.
+";
+
+// Documentation extracted from: (module=mesh, header=MeshQuality.h)
+%feature("docstring")  dolfin::MeshQuality "
+The class provides functions to quantify mesh quality
+";
+
+%feature("docstring")  dolfin::MeshQuality::radius_ratios "
+Compute the radius ratio for all cells.
+
+*Returns*
+    CellFunction<double>
+        The cell radius ratio radius ratio geometric_dimension *
+        * inradius / circumradius (geometric_dimension
+        is normalization factor). It has range zero to one.
+        Zero indicates a degenerate element.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::MeshQuality::radius_ratio_min_max "
+Compute the minimum and maximum radius ratio of cells
+(across all processes)
+
+*Returns*
+    (float, float)
+        The [minimum, maximum] cell radii ratio (geometric_dimension *
+        * inradius / circumradius, geometric_dimension
+        is normalization factor). It has range zero to one.
+        Zero indicates a degenerate element.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::MeshQuality::radius_ratio_histogram_data "
+Create (ratio, number of cells) data for creating a histogram
+of cell quality
+";
+
+%feature("docstring")  dolfin::MeshQuality::radius_ratio_matplotlib_histogram "
+Create Matplotlib string to plot cell quality histogram
+";
+
diff --git a/dolfin/swig/mesh/post.i b/dolfin/swig/mesh/post.i
new file mode 100644
index 0000000..7bf84bc
--- /dev/null
+++ b/dolfin/swig/mesh/post.i
@@ -0,0 +1,523 @@
+/* -*- C -*- */
+// Copyright (C) 2006-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Jansson 2006-2007
+// Modified by Ola Skavhaug 2006-2007
+// Modified by Garth Wells 2007-2010
+// Modified by Johan Hake 2008-2009
+//
+// First added:  2006-09-20
+// Last changed: 2011-03-11
+
+//=============================================================================
+// SWIG directives for the DOLFIN Mesh kernel module (post)
+//
+// The directives in this file are applied _after_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Extend mesh entity iterators to work as Python iterators
+//-----------------------------------------------------------------------------
+%extend dolfin::MeshEntityIterator {
+%pythoncode
+%{
+def __iter__(self):
+    self.first = True
+    return self
+
+def next(self):
+    self.first = self.first if hasattr(self,"first") else True
+    if not self.first:
+        self._increment()
+    if self.end():
+        self._decrease()
+        raise StopIteration
+    self.first = False
+    return self._dereference()
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Extend subset iterator to work as Python iterators
+//-----------------------------------------------------------------------------
+%extend dolfin::SubsetIterator {
+%pythoncode
+%{
+def __iter__(self):
+    self.first = True
+    return self
+
+def next(self):
+    self.first = self.first if hasattr(self,"first") else True
+    if not self.first:
+        self._increment()
+    if self.end():
+        raise StopIteration
+    self.first = False
+    return self._dereference()
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Extend SubDomain
+//-----------------------------------------------------------------------------
+%pythoncode
+%{
+_subdomain_mark_doc_string = SubDomain._mark.__doc__
+%}
+
+%extend dolfin::SubDomain {
+%pythoncode
+%{
+# NOTE: This is a hardcoded check, which rely on SubDomain::mark only taking
+# a MeshFunction as its first argument when mark is called with two arguments
+def mark(self, *args):
+    import common
+    if len(args) == 2 and not isinstance(args[0], \
+                    (MeshFunctionSizet, MeshFunctionInt,
+                     MeshFunctionDouble, MeshFunctionBool)):
+        common.dolfin_error("dolfin.cpp.mesh.py",
+                            "mark MeshFunction",
+                            "Expected a MeshFunction of type \"size_t\", \"int\", \"double\" or \"bool\"")
+
+    self._mark(*args)
+%}
+}
+
+%pythoncode
+%{
+SubDomain.mark.__func__.__doc__ = _subdomain_mark_doc_string
+del _subdomain_mark_doc_string
+%}
+
+//-----------------------------------------------------------------------------
+// Macro for declaring MeshFunctions
+//-----------------------------------------------------------------------------
+%define DECLARE_MESHFUNCTION(TYPE, TYPENAME)
+%feature("docstring") dolfin::MeshFunction::_getitem "Missing docstring";
+%feature("docstring") dolfin::MeshFunction::_setitem "Missing docstring";
+
+// Extend MeshFunction interface for get and set items
+%extend dolfin::MeshFunction<TYPE>
+{
+  TYPE _getitem(std::size_t i) { return (*self)[i]; }
+  void _setitem(std::size_t i, TYPE val) { (*self)[i] = val; }
+
+  TYPE _getitem(dolfin::MeshEntity& e) { return (*self)[e]; }
+  void _setitem(dolfin::MeshEntity& e, TYPE val) { (*self)[e] = val; }
+
+%pythoncode%{
+def array(self):
+    """
+    Return a NumPy array view of the data
+    """
+    data = self._array()
+    _attach_base_to_numpy_array(data, self)
+    return data
+
+def __getitem__(self, index):
+    if not isinstance(index, (int, MeshEntity)):
+        raise TypeError("expected an int or a MeshEntity as index argument")
+
+    if isinstance(index, MeshEntity):
+        entity = index
+        assert entity.mesh().id() == self.mesh().id(), "MeshEntity and MeshFunction do not share the same mesh"
+        assert entity.dim() == self.dim(), "MeshEntity and MeshFunction do not share the same topological dimensions"
+
+        index = entity.index()
+
+    while index < 0:
+        index += self.size()
+    if index >= self.size():
+        raise IndexError("index out of range")
+    return self._getitem(index)
+
+def __setitem__(self, index, value):
+    if not isinstance(index, (int, MeshEntity)):
+        raise TypeError("expected an int or a MeshEntity as index argument")
+
+    if isinstance(index, MeshEntity):
+        entity = index
+        assert entity.mesh().id() == self.mesh().id(), "MeshEntity and MeshFunction do not share the same mesh"
+        assert entity.dim() == self.dim(), "MeshEntity and MeshFunction do not share the same topological dimensions"
+
+        index = entity.index()
+
+    while index < 0:
+        index += self.size()
+    if index >= self.size():
+        raise IndexError("index out of range")
+    self._setitem(index, value)
+
+def __len__(self):
+    return self.size()
+
+def ufl_id(self):
+    "Returns an id that UFL can use to decide if two objects are the same."
+    return self.id()
+
+%}
+}
+
+// Declare templates
+%template(MeshFunction ## TYPENAME) dolfin::MeshFunction<TYPE>;
+%template(CellFunction ## TYPENAME) dolfin::CellFunction<TYPE>;
+%template(EdgeFunction ## TYPENAME) dolfin::EdgeFunction<TYPE>;
+%template(FaceFunction ## TYPENAME) dolfin::FaceFunction<TYPE>;
+%template(FacetFunction ## TYPENAME) dolfin::FacetFunction<TYPE>;
+%template(VertexFunction ## TYPENAME) dolfin::VertexFunction<TYPE>;
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of Hierarchical
+//-----------------------------------------------------------------------------
+%pythoncode %{
+HierarchicalMeshFunction ## TYPENAME.leaf_node = HierarchicalMeshFunction ## TYPENAME._leaf_node
+HierarchicalMeshFunction ## TYPENAME.root_node = HierarchicalMeshFunction ## TYPENAME._root_node
+HierarchicalMeshFunction ## TYPENAME.child = HierarchicalMeshFunction ## TYPENAME._child
+HierarchicalMeshFunction ## TYPENAME.parent = HierarchicalMeshFunction ## TYPENAME._parent
+%}
+%enddef
+
+
+//-----------------------------------------------------------------------------
+// Run Macros to declare the different MeshFunctions
+//-----------------------------------------------------------------------------
+DECLARE_MESHFUNCTION(std::size_t, Sizet)
+DECLARE_MESHFUNCTION(int, Int)
+DECLARE_MESHFUNCTION(double, Double)
+DECLARE_MESHFUNCTION(bool, Bool)
+
+// Create docstrings to the MeshFunctions
+%pythoncode
+%{
+_doc_string = MeshFunctionInt.__doc__
+_doc_string += """
+  *Arguments*
+    tp (str)
+      String defining the type of the MeshFunction
+      Allowed: 'int', 'size_t', 'double', and 'bool'
+    mesh (_Mesh_)
+      A DOLFIN mesh.
+      Optional.
+    dim (unsigned int)
+      The topological dimension of the MeshFunction.
+      Optional.
+    filename (str)
+      A filename with a stored MeshFunction.
+      Optional.
+
+"""
+class MeshFunction(object):
+    __doc__ = _doc_string
+    def __new__(cls, tp, *args):
+        if not isinstance(tp, str):
+            raise TypeError, "expected a 'str' as first argument"
+        if tp == "int":
+            return MeshFunctionInt(*args)
+        if tp == "uint":
+            common.deprecation("uint-valued MeshFunction", "1.1.0", "TBA",
+                               "Typename \"uint\" has been changed to \"size_t\".")
+            return MeshFunctionSizet(*args)
+        elif tp == "size_t":
+            return MeshFunctionSizet(*args)
+        elif tp == "double":
+            return MeshFunctionDouble(*args)
+        elif tp == "bool":
+            return MeshFunctionBool(*args)
+        else:
+            raise RuntimeError, "Cannot create a MeshFunction of type '%s'." % (tp,)
+
+del _doc_string
+
+def _new_closure(MeshType):
+    assert(isinstance(MeshType, str))
+    def new(cls, tp, mesh, value=0):
+        if not isinstance(tp, str):
+            raise TypeError, "expected a 'str' as first argument"
+        if tp == "int":
+            return eval("%sInt(mesh, value)"%MeshType)
+        if tp == "uint":
+            return eval("%sSizet(mesh, value)"%MeshType)
+        if tp == "size_t":
+            return eval("%sSizet(mesh, value)"%MeshType)
+        elif tp == "double":
+            return eval("%sDouble(mesh, float(value))"%MeshType)
+        elif tp == "bool":
+            value = bool(value) if isinstance(value, int) else value
+            return eval("%sBool(mesh, value)"%MeshType)
+        else:
+            raise RuntimeError, "Cannot create a %sFunction of type '%s'." % (MeshType, tp)
+
+    return new
+
+# Create the named MeshFunction types
+VertexFunction = type("VertexFunction", (), \
+		      {"__new__":_new_closure("VertexFunction"),\
+                       "__doc__":"Create MeshFunction of topological"\
+                       " dimension 0 on given mesh."})
+EdgeFunction = type("EdgeFunction", (), \
+                    {"__new__":_new_closure("EdgeFunction"),\
+                     "__doc__":"Create MeshFunction of topological"\
+                     " dimension 1 on given mesh."})
+FaceFunction = type("FaceFunction", (),\
+                    {"__new__":_new_closure("FaceFunction"),\
+                     "__doc__":"Create MeshFunction of topological"\
+                     " dimension 2 on given mesh."})
+FacetFunction = type("FacetFunction", (),\
+                     {"__new__":_new_closure("FacetFunction"),
+                      "__doc__":"Create MeshFunction of topological"\
+                      " codimension 1 on given mesh."})
+CellFunction = type("CellFunction", (),\
+                    {"__new__":_new_closure("CellFunction"),\
+                     "__doc__":"Create MeshFunction of topological"\
+                     " codimension 0 on given mesh."})
+%}
+
+//-----------------------------------------------------------------------------
+// MeshValueCollection macro
+//-----------------------------------------------------------------------------
+%define DECLARE_MESHVALUECOLLECTION(TYPE, TYPENAME)
+%template(MeshValueCollection ## TYPENAME) dolfin::MeshValueCollection<TYPE>;
+
+%feature("docstring") dolfin::MeshValueCollection::assign "Missing docstring";
+
+// Extend MeshFunction interface for assign methods
+%extend dolfin::MeshValueCollection<TYPE>
+{
+
+  void assign(const dolfin::MeshFunction<TYPE>& mesh_function)
+  {
+    (*self) = mesh_function;
+  }
+
+  void assign(const dolfin::MeshValueCollection<TYPE>& mesh_value_collection)
+  {
+    (*self) = mesh_value_collection;
+  }
+}
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Run macros for declaring MeshValueCollection
+//-----------------------------------------------------------------------------
+DECLARE_MESHVALUECOLLECTION(std::size_t, Sizet)
+DECLARE_MESHVALUECOLLECTION(int, Int)
+DECLARE_MESHVALUECOLLECTION(double, Double)
+DECLARE_MESHVALUECOLLECTION(bool, Bool)
+
+// Create docstrings to the MeshValueCollection
+%pythoncode
+%{
+_meshvaluecollection_doc_string = MeshValueCollectionInt.__doc__
+_meshvaluecollection_doc_string += """
+  *Arguments*
+      tp (str)
+         String defining the type of the MeshValueCollection
+          Allowed: 'int', 'size_t', 'double', and 'bool'
+      dim (unsigned int)
+          The topological dimension of the MeshValueCollection.
+          Optional.
+      mesh_function (_MeshFunction_)
+          The MeshValueCollection will get the values from the mesh_function
+          Optional.
+       mesh (Mesh)
+          A mesh associated with the collection. The mesh is used to
+          map collection values to the appropriate process.
+          Optional, used when read from file.
+      filename (std::string)
+          The XML file name.
+          Optional, used when read from file.
+      dim (unsigned int)
+          The mesh entity dimension for the mesh value collection.
+          Optional, used when read from file
+"""
+class MeshValueCollection(object):
+    __doc__ = _meshvaluecollection_doc_string
+    def __new__(cls, tp, *args):
+        if not isinstance(tp, str):
+            raise TypeError, "expected a 'str' as first argument"
+        if tp == "int":
+            return MeshValueCollectionInt(*args)
+        if tp == "uint":
+            common.deprecation("uint-valued MeshFunction", "1.1.0", "TBA",
+                               "Typename \"uint\" has been changed to \"size_t\".")
+            return MeshValueCollectionSizet(*args)
+        elif tp == "size_t":
+            return MeshValueCollectionSizet(*args)
+        elif tp == "double":
+            return MeshValueCollectionDouble(*args)
+        elif tp == "bool":
+            return MeshValueCollectionBool(*args)
+        else:
+            raise RuntimeError, "Cannot create a MeshValueCollection of type '%s'." % (tp,)
+
+del _meshvaluecollection_doc_string
+%}
+
+//-----------------------------------------------------------------------------
+// Extend Mesh interface with some convenient data access methods
+//-----------------------------------------------------------------------------
+%extend dolfin::Mesh {
+%pythoncode
+%{
+def coordinates(self):
+    """
+    * coordinates\ ()
+
+      Get vertex coordinates.
+
+      *Returns*
+          numpy.array(float)
+              Coordinates of all vertices.
+
+      *Example*
+          .. code-block:: python
+
+              >>> mesh = dolfin.UnitSquare(1,1)
+              >>> mesh.coordinates()
+              array([[ 0.,  0.],
+                     [ 1.,  0.],
+                     [ 0.,  1.],
+                     [ 1.,  1.]])
+    """
+
+    # Get coordinates
+    coord = self._coordinates()
+
+    # Attach a reference to the Mesh to the coord array
+    _attach_base_to_numpy_array(coord, self)
+
+    return coord
+
+def cell_orientations(self):
+    """
+    Get the cell orientations set.
+
+    *Returns*
+        numpy.array(int)
+            Cell orientations
+    """
+    # Get coordinates
+    orientations = self._cell_orientations()
+
+    # Attach a reference to the Mesh to the orientations array
+    _attach_base_to_numpy_array(orientations, self)
+
+    return orientations
+
+def cells(self):
+    """
+    Get cell connectivity.
+
+    *Returns*
+        numpy.array(int)
+            Connectivity for all cells.
+
+    *Example*
+        .. code-block:: python
+
+            >>> mesh = dolfin.UnitSquare(1,1)
+            >>> mesh.cells()
+            array([[0, 1, 3],
+                  [0, 2, 3]])
+    """
+    # Get coordinates
+    cells = self._cells()
+
+    # Attach a reference to the Mesh to the cells array
+    _attach_base_to_numpy_array(cells, self)
+
+    return cells
+
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Extend Mesh interface with some ufl_* methods
+//-----------------------------------------------------------------------------
+%extend dolfin::Mesh {
+%pythoncode
+%{
+def ufl_id(self):
+    "Returns an id that UFL can use to decide if two objects are the same."
+    return self.id()
+
+def ufl_cell(self):
+    """
+    Returns the ufl cell of the mesh.
+
+    The cell corresponds to the topological dimension of the mesh.
+    """
+    import ufl
+    tdim = self.topology().dim()
+    gdim = self.geometry().dim()
+    dim2domain = { 1: 'interval', 2: 'triangle', 3: 'tetrahedron' }
+    cellname = dim2domain[tdim]
+    return ufl.Cell(cellname, geometric_dimension=gdim)
+
+def ufl_domain(self):
+    """Returns the ufl Domain corresponding to the mesh."""
+    import ufl
+    label = "dolfin_mesh_with_id_%d" % self.id()
+    return ufl.Domain(self.ufl_cell(), label=label, data=self)
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Extend SubMesh interface with some ufl_* methods
+//-----------------------------------------------------------------------------
+// TODO: It would be nice if this was inherited from the Mesh extension above!
+%extend dolfin::SubMesh {
+%pythoncode
+%{
+def ufl_id(self):
+    "Returns an id that UFL can use to decide if two objects are the same."
+    return self.id()
+
+def ufl_cell(self):
+    """
+    Returns the ufl cell of the mesh.
+
+    The cell corresponds to the topological dimension of the mesh.
+    """
+    import ufl
+    tdim = self.topology().dim()
+    gdim = self.geometry().dim()
+    dim2domain = { 1: 'interval', 2: 'triangle', 3: 'tetrahedron' }
+    cellname = dim2domain[tdim]
+    return ufl.Cell(cellname, geometric_dimension=gdim)
+
+def ufl_domain(self):
+    """Returns the ufl Domain corresponding to the mesh."""
+    import ufl
+    label = "dolfin_mesh_with_id_%d" % self.id()
+    return ufl.Domain(self.ufl_cell(), label=label, data=self)
+%}
+}
+
+//-----------------------------------------------------------------------------
+// Modifying the interface of Hierarchical
+//-----------------------------------------------------------------------------
+%pythoncode %{
+HierarchicalMesh.leaf_node = HierarchicalMesh._leaf_node
+HierarchicalMesh.root_node = HierarchicalMesh._root_node
+HierarchicalMesh.child = HierarchicalMesh._child
+HierarchicalMesh.parent = HierarchicalMesh._parent
+%}
diff --git a/dolfin/swig/mesh/pre.i b/dolfin/swig/mesh/pre.i
new file mode 100644
index 0000000..085809f
--- /dev/null
+++ b/dolfin/swig/mesh/pre.i
@@ -0,0 +1,284 @@
+/* -*- C -*- */
+// Copyright (C) 2006-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Jansson 2006-2007
+// Modified by Ola Skavhaug 2006-2007
+// Modified by Garth Wells 2007
+// Modified by Johan Hake 2008-2011
+//
+// First added:  2006-09-20
+// Last changed: 2013-05-22
+
+//=============================================================================
+// SWIG directives for the DOLFIN Mesh kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Return NumPy arrays for Mesh::cells() and Mesh::coordinates()
+//-----------------------------------------------------------------------------
+%extend dolfin::Mesh {
+  PyObject* _coordinates() {
+    return %make_numpy_array(2, double)(self->num_vertices(),
+					self->geometry().dim(),
+					&(self->coordinates())[0], true);
+  }
+
+  PyObject* _cells() {
+    // FIXME: Works only for Mesh with Intervals, Triangles and Tetrahedrons
+    return %make_numpy_array(2, uint)(self->num_cells(), self->topology().dim()+1,
+				      &(self->cells()[0]), false);
+  }
+
+  PyObject* _cell_orientations() {
+    return %make_numpy_array(1, int)(self->num_cells(), &(self->cell_orientations()[0]), true);
+  }
+}
+
+//-----------------------------------------------------------------------------
+// Return NumPy arrays for MeshFunction.values
+//-----------------------------------------------------------------------------
+%define ALL_VALUES(name, TYPE_NAME)
+%extend name {
+PyObject* _array()
+{
+  return %make_numpy_array(1, TYPE_NAME)(self->size(), self->values(), true);
+}
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Run the macros
+//-----------------------------------------------------------------------------
+ALL_VALUES(dolfin::MeshFunction<double>, double)
+ALL_VALUES(dolfin::MeshFunction<int>, int)
+ALL_VALUES(dolfin::MeshFunction<bool>, bool)
+ALL_VALUES(dolfin::MeshFunction<std::size_t>, size_t)
+
+//-----------------------------------------------------------------------------
+// Ignore methods that is superseded by extended versions
+//-----------------------------------------------------------------------------
+%ignore dolfin::Mesh::cells;
+%ignore dolfin::Mesh::coordinates;
+%ignore dolfin::Mesh::cell_orientations;
+%ignore dolfin::MeshFunction::values;
+
+//-----------------------------------------------------------------------------
+// Rename methods which get called by a re-implemented method from the
+// Python layer
+//-----------------------------------------------------------------------------
+%rename (_mark) dolfin::SubDomain::mark;
+
+//-----------------------------------------------------------------------------
+// Misc ignores
+//-----------------------------------------------------------------------------
+%ignore dolfin::MeshEditor::open(Mesh&, CellType::Type, std::size_t, std::size_t);
+%ignore dolfin::Mesh::operator=;
+%ignore dolfin::MeshData::operator=;
+%ignore dolfin::MeshFunction::operator=;
+%ignore dolfin::MeshFunction::operator[];
+%ignore dolfin::MeshValueCollection::operator=;
+%ignore dolfin::MeshGeometry::operator=;
+%ignore dolfin::MeshTopology::operator=;
+%ignore dolfin::MeshTopology::shared_entities(unsigned int) const;
+%ignore dolfin::MeshValueCollection::operator=;
+%ignore dolfin::MeshConnectivity::operator=;
+%ignore dolfin::MeshConnectivity::set;
+%ignore dolfin::MeshEntityIterator::operator->;
+%ignore dolfin::MeshEntityIterator::operator[];
+%ignore dolfin::MeshEntity::operator->;
+%ignore dolfin::SubsetIterator::operator->;
+%ignore dolfin::SubsetIterator::operator[];
+%ignore dolfin::MeshDomains::operator=;
+%ignore dolfin::MeshDomains::markers(std::size_t) const;
+%ignore dolfin::MeshData::array(std::string) const;
+
+//-----------------------------------------------------------------------------
+// Map increment, decrease and dereference operators for iterators
+//-----------------------------------------------------------------------------
+%rename(_increment) dolfin::MeshEntityIterator::operator++;
+%rename(_decrease) dolfin::MeshEntityIterator::operator--;
+%rename(_dereference) dolfin::MeshEntityIterator::operator*;
+%rename(_increment) dolfin::SubsetIterator::operator++;
+%rename(_dereference) dolfin::SubsetIterator::operator*;
+
+//-----------------------------------------------------------------------------
+// MeshEntityIteratorBase
+//-----------------------------------------------------------------------------
+
+// Ignore for all specializations done before importing the type
+%ignore dolfin::MeshEntityIteratorBase::operator=;
+%ignore dolfin::MeshEntityIteratorBase::operator->;
+%ignore dolfin::MeshEntityIteratorBase::operator[];
+%ignore dolfin::MeshEntityIteratorBase::operator[];
+%ignore dolfin::MeshEntityIteratorBase::operator++;
+%ignore dolfin::MeshEntityIteratorBase::operator--;
+%ignore dolfin::MeshEntityIteratorBase::operator*;
+
+#ifdef MESHMODULE // Conditional statements only for MESH module
+
+// Forward import base template type
+%import"dolfin/mesh/MeshEntityIteratorBase.h"
+
+%define MESHENTITYITERATORBASE(ENTITY, name)
+%template(name) dolfin::MeshEntityIteratorBase<dolfin::ENTITY>;
+
+// Extend the interface (instead of renaming, doesn't seem to work)
+%extend dolfin::MeshEntityIteratorBase<dolfin::ENTITY>
+{
+  dolfin::MeshEntityIteratorBase<dolfin::ENTITY>& _increment()
+  {
+    return self->operator++();
+  }
+
+  dolfin::MeshEntityIteratorBase<dolfin::ENTITY>& _decrease()
+  {
+    return self->operator--();
+  }
+
+  dolfin::ENTITY _dereference()
+  {
+    return *self->operator->();
+  }
+
+%pythoncode
+%{
+def __iter__(self):
+    self.first = True
+    return self
+
+def next(self):
+    self.first = self.first if hasattr(self,"first") else True
+    if not self.first:
+        self._increment()
+    if self.end():
+        self._decrease()
+        raise StopIteration
+    self.first = False
+    return self._dereference()
+%}
+
+}
+
+%enddef
+
+MESHENTITYITERATORBASE(Cell, cells)
+MESHENTITYITERATORBASE(Edge, edges)
+MESHENTITYITERATORBASE(Face, faces)
+MESHENTITYITERATORBASE(Facet, facets)
+MESHENTITYITERATORBASE(Vertex, vertices)
+
+//-----------------------------------------------------------------------------
+// Rename the iterators to better match the Python syntax
+//-----------------------------------------------------------------------------
+%rename(entities) dolfin::MeshEntityIterator;
+
+//-----------------------------------------------------------------------------
+// Return NumPy arrays for MeshConnectivity() and MeshEntity.entities()
+//-----------------------------------------------------------------------------
+%ignore dolfin::MeshGeometry::x(std::size_t n, std::size_t i) const;
+%ignore dolfin::MeshConnectivity::operator();
+%ignore dolfin::MeshEntity::entities;
+
+%extend dolfin::MeshConnectivity {
+  PyObject* __call__()
+  {
+    return %make_numpy_array(1, uint)(self->size(), &(*self)()[0], false);
+  }
+
+  PyObject* __call__(std::size_t entity)
+  {
+    return %make_numpy_array(1, uint)(self->size(entity), (*self)(entity), false);
+  }
+}
+
+%extend dolfin::MeshEntity {
+%pythoncode
+%{
+    def entities(self, dim):
+        """ Return number of incident mesh entities of given topological dimension"""
+        return self.mesh().topology()(self.dim(), dim)(self.index())
+
+    def __str__(self):
+        """Pretty print of MeshEntity"""
+        return self.str(False)
+%}
+}
+
+#endif // End ifdef for MESHMODULE
+
+%define FORWARD_DECLARE_MESHFUNCTIONS(TYPE, TYPENAME)
+%shared_ptr(dolfin::Hierarchical<dolfin::MeshFunction<TYPE> >)
+%template (HierarchicalMeshFunction ## TYPENAME) \
+    dolfin::Hierarchical<dolfin::MeshFunction<TYPE> >;
+
+
+// Forward declaration of template
+%template() dolfin::MeshFunction<TYPE>;
+
+// Shared_ptr declarations
+%shared_ptr(dolfin::MeshFunction<TYPE>)
+%shared_ptr(dolfin::CellFunction<TYPE>)
+%shared_ptr(dolfin::EdgeFunction<TYPE>)
+%shared_ptr(dolfin::FaceFunction<TYPE>)
+%shared_ptr(dolfin::FacetFunction<TYPE>)
+%shared_ptr(dolfin::VertexFunction<TYPE>)
+
+// Include shared_ptr declaration of MeshValueCollection
+%shared_ptr(dolfin::MeshValueCollection<TYPE>)
+
+//-----------------------------------------------------------------------------
+// Ignore MeshFunction constructors that take a Mesh reference
+//-----------------------------------------------------------------------------
+%ignore dolfin::MeshFunction<TYPE>::MeshFunction(const Mesh&);
+%ignore dolfin::MeshFunction<TYPE>::MeshFunction(const Mesh&, std::size_t);
+%ignore dolfin::MeshFunction<TYPE>::MeshFunction(const Mesh&, std::size_t, const TYPE&);
+%ignore dolfin::MeshFunction<TYPE>::MeshFunction(const Mesh&, const std::string);
+%ignore dolfin::MeshFunction<TYPE>::MeshFunction(const Mesh&, const MeshValueCollection<T>&);
+
+%ignore dolfin::CellFunction<TYPE>::MeshFunction(const Mesh&, const TYPE&);
+%ignore dolfin::FacetFunction<TYPE>::MeshFunction(const Mesh&, const TYPE&);
+%ignore dolfin::FaceFunction<TYPE>::MeshFunction(const Mesh&, const TYPE&);
+%ignore dolfin::EdgeFunction<TYPE>::MeshFunction(const Mesh&, const TYPE&);
+%ignore dolfin::VertexFunction<TYPE>::MeshFunction(const Mesh&, const TYPE&);
+
+%ignore dolfin::MeshFunction<TYPE>::init(const Mesh&, std::size_t);
+%ignore dolfin::MeshFunction<TYPE>::init(const Mesh&, std::size_t, const T&);
+
+//-----------------------------------------------------------------------------
+// Ignore MeshValueCollection constructors that take a Mesh reference
+//-----------------------------------------------------------------------------
+%ignore dolfin::MeshValueCollection<TYPE>::MeshValueCollection(const Mesh&, std::size_t);
+
+%enddef
+
+FORWARD_DECLARE_MESHFUNCTIONS(unsigned int, UInt)
+FORWARD_DECLARE_MESHFUNCTIONS(int, Int)
+FORWARD_DECLARE_MESHFUNCTIONS(double, Double)
+FORWARD_DECLARE_MESHFUNCTIONS(bool, Bool)
+FORWARD_DECLARE_MESHFUNCTIONS(std::size_t, Sizet)
+
+// Exclude from ifdef as it is used by other modules
+%template (HierarchicalMesh) dolfin::Hierarchical<dolfin::Mesh>;
+
+//-----------------------------------------------------------------------------
+// Add director classes
+//-----------------------------------------------------------------------------
+%feature("director") dolfin::SubDomain;
diff --git a/dolfin/swig/modules/common/CMakeLists.txt b/dolfin/swig/modules/common/CMakeLists.txt
new file mode 100644
index 0000000..29c7acf
--- /dev/null
+++ b/dolfin/swig/modules/common/CMakeLists.txt
@@ -0,0 +1,59 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-swig-interface
+#
+# Automatic get the module name
+get_filename_component(SWIG_MODULE_NAME ${CMAKE_CURRENT_BINARY_DIR} NAME)
+
+# Set project name
+project(${SWIG_MODULE_NAME})
+
+# What does this do?
+get_directory_property(cmake_defs COMPILE_DEFINITIONS)
+
+# Set SWIG flags 
+set(CMAKE_SWIG_FLAGS
+  -module ${SWIG_MODULE_NAME}
+  -shadow
+  -modern
+  -modernargs
+  -fastdispatch
+  -fvirtual
+  -nosafecstrings
+  -noproxydel
+  -fastproxy
+  -fastinit
+  -fastunpack
+  -fastquery
+  -nobuildnone
+  -Iinclude/swig
+  ${DOLFIN_CXX_DEFINITIONS}
+  ${DOLFIN_PYTHON_DEFINITIONS}
+  )
+
+# Get all SWIG interface files
+file(READ ${CMAKE_CURRENT_BINARY_DIR}/dependencies.txt DOLFIN_SWIG_DEPENDENCIES )
+
+# This prevents swig being run unnecessarily
+set_source_files_properties(module.i PROPERTIES SWIG_MODULE_NAME ${SWIG_MODULE_NAME})
+
+# Tell CMake SWIG has generated a C++ file
+set_source_files_properties(module.i PROPERTIES CPLUSPLUS ON)
+
+# Generate SWIG files in 
+set(CMAKE_SWIG_OUTDIR ${CMAKE_CURRENT_BINARY_DIR})
+
+# Tell CMake which SWIG interface files should be checked for changes when recompile
+set(SWIG_MODULE_${SWIG_MODULE_NAME}_EXTRA_DEPS copy_swig_files ${DOLFIN_SWIG_DEPENDENCIES})
+
+# Tell CMake to run SWIG on module.i and to link against libdolfin
+swig_add_module(${SWIG_MODULE_NAME} python module.i)
+swig_link_libraries(${SWIG_MODULE_NAME} dolfin ${PYTHON_LIBRARIES})
+
+# Install Python .py files
+get_target_property(SWIG_MODULE_LOCATION ${SWIG_MODULE_${SWIG_MODULE_NAME}_REAL_NAME} LOCATION)
+install(FILES
+  ${SWIG_MODULE_LOCATION} ${CMAKE_CURRENT_BINARY_DIR}/${SWIG_MODULE_NAME}.py
+  DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin/cpp
+  COMPONENT RuntimeLibraries
+  )
diff --git a/dolfin/swig/modules/common/dependencies.txt b/dolfin/swig/modules/common/dependencies.txt
new file mode 100644
index 0000000..f0c2882
--- /dev/null
+++ b/dolfin/swig/modules/common/dependencies.txt
@@ -0,0 +1 @@
+/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/common/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/common/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/defines.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/exceptions.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/forwarddeclarations.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/globalincludes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/log/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/log/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/modules/common/module.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/parameter/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/parameter/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/shared_ptr_classes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/array.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/includes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/numpy.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/primitives.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_map.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_pair.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_set.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_vector.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/version.i
\ No newline at end of file
diff --git a/dolfin/swig/modules/common/module.i b/dolfin/swig/modules/common/module.i
new file mode 100644
index 0000000..6882b6c
--- /dev/null
+++ b/dolfin/swig/modules/common/module.i
@@ -0,0 +1,114 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+// The PyDOLFIN extension module for the common module
+%module(package="dolfin.cpp.common", directors="1") common
+
+// Define module name for conditional includes
+#define COMMONMODULE
+
+%{
+
+// Include types from dependent modules
+
+// Include types from present module common
+
+// #include types from common submodule
+#include "dolfin/common/init.h"
+#include "dolfin/common/defines.h"
+#include "dolfin/common/types.h"
+#include "dolfin/common/constants.h"
+#include "dolfin/common/timing.h"
+#include "dolfin/common/Array.h"
+#include "dolfin/common/IndexSet.h"
+#include "dolfin/common/Set.h"
+#include "dolfin/common/Timer.h"
+#include "dolfin/common/Variable.h"
+#include "dolfin/common/Hierarchical.h"
+#include "dolfin/common/MPI.h"
+#include "dolfin/common/SubSystemsManager.h"
+
+// #include types from parameter submodule
+#include "dolfin/parameter/Parameter.h"
+#include "dolfin/parameter/Parameters.h"
+#include "dolfin/parameter/GlobalParameters.h"
+
+// #include types from log submodule
+#include "dolfin/log/log.h"
+#include "dolfin/log/Event.h"
+#include "dolfin/log/Progress.h"
+#include "dolfin/log/Table.h"
+#include "dolfin/log/LogLevel.h"
+
+// NumPy includes
+#define PY_ARRAY_UNIQUE_SYMBOL PyDOLFIN_COMMON
+#include <numpy/arrayobject.h>
+%}
+
+%init%{
+import_array();
+%}
+
+// Include global SWIG interface files:
+// Typemaps, shared_ptr declarations, exceptions, version
+%include "dolfin/swig/globalincludes.i"
+
+
+// Turn on SWIG generated signature documentation and include doxygen
+// generated docstrings
+//%feature("autodoc", "1");
+%include "dolfin/swig/common/docstrings.i"
+%include "dolfin/swig/parameter/docstrings.i"
+%include "dolfin/swig/log/docstrings.i"
+
+// %include types from submodule common
+%include "dolfin/swig/common/pre.i"
+%include "dolfin/common/init.h"
+%include "dolfin/common/defines.h"
+%include "dolfin/common/types.h"
+%include "dolfin/common/constants.h"
+%include "dolfin/common/timing.h"
+%include "dolfin/common/Array.h"
+%include "dolfin/common/IndexSet.h"
+%include "dolfin/common/Set.h"
+%include "dolfin/common/Timer.h"
+%include "dolfin/common/Variable.h"
+%include "dolfin/common/Hierarchical.h"
+%include "dolfin/common/MPI.h"
+%include "dolfin/common/SubSystemsManager.h"
+%include "dolfin/swig/common/post.i"
+
+// %include types from submodule parameter
+%include "dolfin/swig/parameter/pre.i"
+%include "dolfin/parameter/Parameter.h"
+%include "dolfin/parameter/Parameters.h"
+%include "dolfin/parameter/GlobalParameters.h"
+%include "dolfin/swig/parameter/post.i"
+
+// %include types from submodule log
+%include "dolfin/swig/log/pre.i"
+%include "dolfin/log/log.h"
+%include "dolfin/log/Event.h"
+%include "dolfin/log/Progress.h"
+%include "dolfin/log/Table.h"
+%include "dolfin/log/LogLevel.h"
+%include "dolfin/swig/log/post.i"
+
diff --git a/dolfin/swig/modules/fem/CMakeLists.txt b/dolfin/swig/modules/fem/CMakeLists.txt
new file mode 100644
index 0000000..29c7acf
--- /dev/null
+++ b/dolfin/swig/modules/fem/CMakeLists.txt
@@ -0,0 +1,59 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-swig-interface
+#
+# Automatic get the module name
+get_filename_component(SWIG_MODULE_NAME ${CMAKE_CURRENT_BINARY_DIR} NAME)
+
+# Set project name
+project(${SWIG_MODULE_NAME})
+
+# What does this do?
+get_directory_property(cmake_defs COMPILE_DEFINITIONS)
+
+# Set SWIG flags 
+set(CMAKE_SWIG_FLAGS
+  -module ${SWIG_MODULE_NAME}
+  -shadow
+  -modern
+  -modernargs
+  -fastdispatch
+  -fvirtual
+  -nosafecstrings
+  -noproxydel
+  -fastproxy
+  -fastinit
+  -fastunpack
+  -fastquery
+  -nobuildnone
+  -Iinclude/swig
+  ${DOLFIN_CXX_DEFINITIONS}
+  ${DOLFIN_PYTHON_DEFINITIONS}
+  )
+
+# Get all SWIG interface files
+file(READ ${CMAKE_CURRENT_BINARY_DIR}/dependencies.txt DOLFIN_SWIG_DEPENDENCIES )
+
+# This prevents swig being run unnecessarily
+set_source_files_properties(module.i PROPERTIES SWIG_MODULE_NAME ${SWIG_MODULE_NAME})
+
+# Tell CMake SWIG has generated a C++ file
+set_source_files_properties(module.i PROPERTIES CPLUSPLUS ON)
+
+# Generate SWIG files in 
+set(CMAKE_SWIG_OUTDIR ${CMAKE_CURRENT_BINARY_DIR})
+
+# Tell CMake which SWIG interface files should be checked for changes when recompile
+set(SWIG_MODULE_${SWIG_MODULE_NAME}_EXTRA_DEPS copy_swig_files ${DOLFIN_SWIG_DEPENDENCIES})
+
+# Tell CMake to run SWIG on module.i and to link against libdolfin
+swig_add_module(${SWIG_MODULE_NAME} python module.i)
+swig_link_libraries(${SWIG_MODULE_NAME} dolfin ${PYTHON_LIBRARIES})
+
+# Install Python .py files
+get_target_property(SWIG_MODULE_LOCATION ${SWIG_MODULE_${SWIG_MODULE_NAME}_REAL_NAME} LOCATION)
+install(FILES
+  ${SWIG_MODULE_LOCATION} ${CMAKE_CURRENT_BINARY_DIR}/${SWIG_MODULE_NAME}.py
+  DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin/cpp
+  COMPONENT RuntimeLibraries
+  )
diff --git a/dolfin/swig/modules/fem/dependencies.txt b/dolfin/swig/modules/fem/dependencies.txt
new file mode 100644
index 0000000..61b19f1
--- /dev/null
+++ b/dolfin/swig/modules/fem/dependencies.txt
@@ -0,0 +1 @@
+/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Hierarchical.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/MPI.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Variable.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/types.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/CCFEMFunction.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/CCFEMFunctionSpace.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/Constant.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/Expression.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/Function.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/FunctionSpace.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/GenericFunction.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/SpecialFacetFunction.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/geometry/Point.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericLinearOperator.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericMatrix.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericSparsityPattern.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericTensor.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericVector.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/LinearAlgebraObject.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/Matrix.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/SparsityPattern.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/Vector.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/Cell.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/Face.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/Facet.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/Mesh.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/MeshEntity.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/MeshFunction.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/Restriction.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/SubDomain.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/parameter/Parameter.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/parameter/Parameters.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/adaptivity/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/adaptivity/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/common/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/defines.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/exceptions.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/fem/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/fem/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/forwarddeclarations.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/function/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/geometry/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/globalincludes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/la/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/mesh/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/modules/fem/module.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/multistage/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/parameter/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/shared_ptr_classes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/array.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/includes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/numpy.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/primitives.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_map.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_pair.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_set.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_vector.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/version.i
\ No newline at end of file
diff --git a/dolfin/swig/modules/fem/module.i b/dolfin/swig/modules/fem/module.i
new file mode 100644
index 0000000..b4a9317
--- /dev/null
+++ b/dolfin/swig/modules/fem/module.i
@@ -0,0 +1,242 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+// The PyDOLFIN extension module for the fem module
+%module(package="dolfin.cpp.fem", directors="1") fem
+
+// Define module name for conditional includes
+#define FEMMODULE
+
+%{
+
+// Include types from dependent modules
+
+// #include types from common submodule of module common
+#include "dolfin/common/types.h"
+#include "dolfin/common/Variable.h"
+#include "dolfin/common/Hierarchical.h"
+#include "dolfin/common/MPI.h"
+
+// #include types from parameter submodule of module common
+#include "dolfin/parameter/Parameter.h"
+#include "dolfin/parameter/Parameters.h"
+
+// #include types from mesh submodule of module mesh
+#include "dolfin/mesh/Mesh.h"
+#include "dolfin/mesh/MeshEntity.h"
+#include "dolfin/mesh/Face.h"
+#include "dolfin/mesh/Facet.h"
+#include "dolfin/mesh/Cell.h"
+#include "dolfin/mesh/MeshFunction.h"
+#include "dolfin/mesh/SubDomain.h"
+#include "dolfin/mesh/Restriction.h"
+
+// #include types from geometry submodule of module mesh
+#include "dolfin/geometry/Point.h"
+
+// #include types from la submodule of module la
+#include "dolfin/la/LinearAlgebraObject.h"
+#include "dolfin/la/GenericLinearOperator.h"
+#include "dolfin/la/GenericTensor.h"
+#include "dolfin/la/GenericMatrix.h"
+#include "dolfin/la/GenericSparsityPattern.h"
+#include "dolfin/la/GenericVector.h"
+#include "dolfin/la/SparsityPattern.h"
+#include "dolfin/la/Vector.h"
+#include "dolfin/la/Matrix.h"
+
+// #include types from function submodule of module function
+#include "dolfin/function/GenericFunction.h"
+#include "dolfin/function/Expression.h"
+#include "dolfin/function/Function.h"
+#include "dolfin/function/FunctionSpace.h"
+#include "dolfin/function/Constant.h"
+#include "dolfin/function/SpecialFacetFunction.h"
+#include "dolfin/function/CCFEMFunctionSpace.h"
+#include "dolfin/function/CCFEMFunction.h"
+
+// Include types from present module fem
+
+// #include types from fem submodule
+#include "dolfin/fem/GenericDofMap.h"
+#include "dolfin/fem/DofMap.h"
+#include "dolfin/fem/fem_utils.h"
+#include "dolfin/fem/Equation.h"
+#include "dolfin/fem/FiniteElement.h"
+#include "dolfin/fem/BasisFunction.h"
+#include "dolfin/fem/DirichletBC.h"
+#include "dolfin/fem/PointSource.h"
+#include "dolfin/fem/assemble.h"
+#include "dolfin/fem/LocalSolver.h"
+#include "dolfin/fem/solve.h"
+#include "dolfin/fem/Form.h"
+#include "dolfin/fem/AssemblerBase.h"
+#include "dolfin/fem/Assembler.h"
+#include "dolfin/fem/SparsityPatternBuilder.h"
+#include "dolfin/fem/SystemAssembler.h"
+#include "dolfin/fem/LinearVariationalProblem.h"
+#include "dolfin/fem/LinearVariationalSolver.h"
+#include "dolfin/fem/NonlinearVariationalProblem.h"
+#include "dolfin/fem/NonlinearVariationalSolver.h"
+#include "dolfin/fem/CCFEMForm.h"
+#include "dolfin/fem/CCFEMDofMap.h"
+#include "dolfin/fem/CCFEMAssembler.h"
+#include "dolfin/fem/OpenMpAssembler.h"
+
+// #include types from multistage submodule
+#include "dolfin/multistage/MultiStageScheme.h"
+#include "dolfin/multistage/RKSolver.h"
+#include "dolfin/multistage/PointIntegralSolver.h"
+
+// #include types from adaptivity submodule
+#include "dolfin/adaptivity/GenericAdaptiveVariationalSolver.h"
+#include "dolfin/adaptivity/AdaptiveLinearVariationalSolver.h"
+#include "dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h"
+#include "dolfin/adaptivity/GoalFunctional.h"
+#include "dolfin/adaptivity/ErrorControl.h"
+#include "dolfin/adaptivity/Extrapolation.h"
+#include "dolfin/adaptivity/LocalAssembler.h"
+#include "dolfin/adaptivity/TimeSeries.h"
+#include "dolfin/adaptivity/TimeSeriesHDF5.h"
+#include "dolfin/adaptivity/adapt.h"
+#include "dolfin/adaptivity/marking.h"
+#include "dolfin/adaptivity/adaptivesolve.h"
+
+// NumPy includes
+#define PY_ARRAY_UNIQUE_SYMBOL PyDOLFIN_FEM
+#include <numpy/arrayobject.h>
+%}
+
+%init%{
+import_array();
+%}
+
+// Include global SWIG interface files:
+// Typemaps, shared_ptr declarations, exceptions, version
+%include "dolfin/swig/globalincludes.i"
+
+// %import types from submodule common of SWIG module common
+%include "dolfin/swig/common/pre.i"
+%import(module="common") "dolfin/common/types.h"
+%import(module="common") "dolfin/common/Variable.h"
+%import(module="common") "dolfin/common/Hierarchical.h"
+%import(module="common") "dolfin/common/MPI.h"
+
+// %import types from submodule parameter of SWIG module common
+%include "dolfin/swig/parameter/pre.i"
+%import(module="common") "dolfin/parameter/Parameter.h"
+%import(module="common") "dolfin/parameter/Parameters.h"
+
+// %import types from submodule mesh of SWIG module mesh
+%include "dolfin/swig/mesh/pre.i"
+%import(module="mesh") "dolfin/mesh/Mesh.h"
+%import(module="mesh") "dolfin/mesh/MeshEntity.h"
+%import(module="mesh") "dolfin/mesh/Face.h"
+%import(module="mesh") "dolfin/mesh/Facet.h"
+%import(module="mesh") "dolfin/mesh/Cell.h"
+%import(module="mesh") "dolfin/mesh/MeshFunction.h"
+%import(module="mesh") "dolfin/mesh/SubDomain.h"
+%import(module="mesh") "dolfin/mesh/Restriction.h"
+
+// %import types from submodule geometry of SWIG module mesh
+%include "dolfin/swig/geometry/pre.i"
+%import(module="mesh") "dolfin/geometry/Point.h"
+
+// %import types from submodule la of SWIG module la
+%include "dolfin/swig/la/pre.i"
+%import(module="la") "dolfin/la/LinearAlgebraObject.h"
+%import(module="la") "dolfin/la/GenericLinearOperator.h"
+%import(module="la") "dolfin/la/GenericTensor.h"
+%import(module="la") "dolfin/la/GenericMatrix.h"
+%import(module="la") "dolfin/la/GenericSparsityPattern.h"
+%import(module="la") "dolfin/la/GenericVector.h"
+%import(module="la") "dolfin/la/SparsityPattern.h"
+%import(module="la") "dolfin/la/Vector.h"
+%import(module="la") "dolfin/la/Matrix.h"
+
+// %import types from submodule function of SWIG module function
+%include "dolfin/swig/function/pre.i"
+%import(module="function") "dolfin/function/GenericFunction.h"
+%import(module="function") "dolfin/function/Expression.h"
+%import(module="function") "dolfin/function/Function.h"
+%import(module="function") "dolfin/function/FunctionSpace.h"
+%import(module="function") "dolfin/function/Constant.h"
+%import(module="function") "dolfin/function/SpecialFacetFunction.h"
+%import(module="function") "dolfin/function/CCFEMFunctionSpace.h"
+%import(module="function") "dolfin/function/CCFEMFunction.h"
+
+// Turn on SWIG generated signature documentation and include doxygen
+// generated docstrings
+//%feature("autodoc", "1");
+%include "dolfin/swig/fem/docstrings.i"
+%include "dolfin/swig/multistage/docstrings.i"
+%include "dolfin/swig/adaptivity/docstrings.i"
+
+// %include types from submodule fem
+%include "dolfin/swig/fem/pre.i"
+%include "dolfin/fem/GenericDofMap.h"
+%include "dolfin/fem/DofMap.h"
+%include "dolfin/fem/fem_utils.h"
+%include "dolfin/fem/Equation.h"
+%include "dolfin/fem/FiniteElement.h"
+%include "dolfin/fem/BasisFunction.h"
+%include "dolfin/fem/DirichletBC.h"
+%include "dolfin/fem/PointSource.h"
+%include "dolfin/fem/assemble.h"
+%include "dolfin/fem/LocalSolver.h"
+%include "dolfin/fem/solve.h"
+%include "dolfin/fem/Form.h"
+%include "dolfin/fem/AssemblerBase.h"
+%include "dolfin/fem/Assembler.h"
+%include "dolfin/fem/SparsityPatternBuilder.h"
+%include "dolfin/fem/SystemAssembler.h"
+%include "dolfin/fem/LinearVariationalProblem.h"
+%include "dolfin/fem/LinearVariationalSolver.h"
+%include "dolfin/fem/NonlinearVariationalProblem.h"
+%include "dolfin/fem/NonlinearVariationalSolver.h"
+%include "dolfin/fem/CCFEMForm.h"
+%include "dolfin/fem/CCFEMDofMap.h"
+%include "dolfin/fem/CCFEMAssembler.h"
+%include "dolfin/fem/OpenMpAssembler.h"
+%include "dolfin/swig/fem/post.i"
+
+// %include types from submodule multistage
+%include "dolfin/swig/multistage/pre.i"
+%include "dolfin/multistage/MultiStageScheme.h"
+%include "dolfin/multistage/RKSolver.h"
+%include "dolfin/multistage/PointIntegralSolver.h"
+
+// %include types from submodule adaptivity
+%include "dolfin/swig/adaptivity/pre.i"
+%include "dolfin/adaptivity/GenericAdaptiveVariationalSolver.h"
+%include "dolfin/adaptivity/AdaptiveLinearVariationalSolver.h"
+%include "dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h"
+%include "dolfin/adaptivity/GoalFunctional.h"
+%include "dolfin/adaptivity/ErrorControl.h"
+%include "dolfin/adaptivity/Extrapolation.h"
+%include "dolfin/adaptivity/LocalAssembler.h"
+%include "dolfin/adaptivity/TimeSeries.h"
+%include "dolfin/adaptivity/TimeSeriesHDF5.h"
+%include "dolfin/adaptivity/adapt.h"
+%include "dolfin/adaptivity/marking.h"
+%include "dolfin/adaptivity/adaptivesolve.h"
+%include "dolfin/swig/adaptivity/post.i"
+
diff --git a/dolfin/swig/modules/function/CMakeLists.txt b/dolfin/swig/modules/function/CMakeLists.txt
new file mode 100644
index 0000000..29c7acf
--- /dev/null
+++ b/dolfin/swig/modules/function/CMakeLists.txt
@@ -0,0 +1,59 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-swig-interface
+#
+# Automatic get the module name
+get_filename_component(SWIG_MODULE_NAME ${CMAKE_CURRENT_BINARY_DIR} NAME)
+
+# Set project name
+project(${SWIG_MODULE_NAME})
+
+# What does this do?
+get_directory_property(cmake_defs COMPILE_DEFINITIONS)
+
+# Set SWIG flags 
+set(CMAKE_SWIG_FLAGS
+  -module ${SWIG_MODULE_NAME}
+  -shadow
+  -modern
+  -modernargs
+  -fastdispatch
+  -fvirtual
+  -nosafecstrings
+  -noproxydel
+  -fastproxy
+  -fastinit
+  -fastunpack
+  -fastquery
+  -nobuildnone
+  -Iinclude/swig
+  ${DOLFIN_CXX_DEFINITIONS}
+  ${DOLFIN_PYTHON_DEFINITIONS}
+  )
+
+# Get all SWIG interface files
+file(READ ${CMAKE_CURRENT_BINARY_DIR}/dependencies.txt DOLFIN_SWIG_DEPENDENCIES )
+
+# This prevents swig being run unnecessarily
+set_source_files_properties(module.i PROPERTIES SWIG_MODULE_NAME ${SWIG_MODULE_NAME})
+
+# Tell CMake SWIG has generated a C++ file
+set_source_files_properties(module.i PROPERTIES CPLUSPLUS ON)
+
+# Generate SWIG files in 
+set(CMAKE_SWIG_OUTDIR ${CMAKE_CURRENT_BINARY_DIR})
+
+# Tell CMake which SWIG interface files should be checked for changes when recompile
+set(SWIG_MODULE_${SWIG_MODULE_NAME}_EXTRA_DEPS copy_swig_files ${DOLFIN_SWIG_DEPENDENCIES})
+
+# Tell CMake to run SWIG on module.i and to link against libdolfin
+swig_add_module(${SWIG_MODULE_NAME} python module.i)
+swig_link_libraries(${SWIG_MODULE_NAME} dolfin ${PYTHON_LIBRARIES})
+
+# Install Python .py files
+get_target_property(SWIG_MODULE_LOCATION ${SWIG_MODULE_${SWIG_MODULE_NAME}_REAL_NAME} LOCATION)
+install(FILES
+  ${SWIG_MODULE_LOCATION} ${CMAKE_CURRENT_BINARY_DIR}/${SWIG_MODULE_NAME}.py
+  DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin/cpp
+  COMPONENT RuntimeLibraries
+  )
diff --git a/dolfin/swig/modules/function/dependencies.txt b/dolfin/swig/modules/function/dependencies.txt
new file mode 100644
index 0000000..8b862d2
--- /dev/null
+++ b/dolfin/swig/modules/function/dependencies.txt
@@ -0,0 +1 @@
+/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Array.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Hierarchical.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/MPI.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Variable.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/fem/CCFEMDofMap.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/fem/DofMap.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/fem/FiniteElement.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/fem/GenericDofMap.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/geometry/Point.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericTensor.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericVector.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/LinearAlgebraObject.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/Vector.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/BoundaryMesh.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/Cell.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/LocalMeshData.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/Mesh.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/MeshData.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/MeshEntity.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/ale/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/common/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/defines.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/exceptions.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/fem/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/forwarddeclarations.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/function/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/function/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/geometry/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/globalincludes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/graph/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/la/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/mesh/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/modules/function/module.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/shared_ptr_classes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/array.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/includes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/numpy.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/primitives.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_map.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_pair.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_set.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_vector.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/version.i
\ No newline at end of file
diff --git a/dolfin/swig/modules/function/module.i b/dolfin/swig/modules/function/module.i
new file mode 100644
index 0000000..88144dd
--- /dev/null
+++ b/dolfin/swig/modules/function/module.i
@@ -0,0 +1,183 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+// The PyDOLFIN extension module for the function module
+%module(package="dolfin.cpp.function", directors="1") function
+
+// Define module name for conditional includes
+#define FUNCTIONMODULE
+
+%{
+
+// Include types from dependent modules
+
+// #include types from common submodule of module common
+#include "dolfin/common/Array.h"
+#include "dolfin/common/Variable.h"
+#include "dolfin/common/Hierarchical.h"
+#include "dolfin/common/MPI.h"
+
+// #include types from mesh submodule of module mesh
+#include "dolfin/mesh/MeshData.h"
+#include "dolfin/mesh/Mesh.h"
+#include "dolfin/mesh/MeshEntity.h"
+#include "dolfin/mesh/Cell.h"
+#include "dolfin/mesh/LocalMeshData.h"
+#include "dolfin/mesh/BoundaryMesh.h"
+
+// #include types from geometry submodule of module mesh
+#include "dolfin/geometry/Point.h"
+
+// #include types from la submodule of module la
+#include "dolfin/la/LinearAlgebraObject.h"
+#include "dolfin/la/GenericTensor.h"
+#include "dolfin/la/GenericVector.h"
+#include "dolfin/la/Vector.h"
+
+// #include types from fem submodule of module fem
+#include "dolfin/fem/GenericDofMap.h"
+#include "dolfin/fem/DofMap.h"
+#include "dolfin/fem/FiniteElement.h"
+#include "dolfin/fem/CCFEMDofMap.h"
+
+// Include types from present module function
+
+// #include types from function submodule
+#include "dolfin/function/GenericFunction.h"
+#include "dolfin/function/Expression.h"
+#include "dolfin/function/FunctionAXPY.h"
+#include "dolfin/function/Function.h"
+#include "dolfin/function/FunctionSpace.h"
+#include "dolfin/function/SubSpace.h"
+#include "dolfin/function/Constant.h"
+#include "dolfin/function/SpecialFunctions.h"
+#include "dolfin/function/SpecialFacetFunction.h"
+#include "dolfin/function/CCFEMFunctionSpace.h"
+#include "dolfin/function/FunctionAssigner.h"
+#include "dolfin/function/assign.h"
+#include "dolfin/function/CCFEMFunction.h"
+#include "dolfin/function/LagrangeInterpolator.h"
+
+// #include types from math submodule
+#include "dolfin/math/basic.h"
+#include "dolfin/math/Lagrange.h"
+#include "dolfin/math/Legendre.h"
+
+// #include types from ale submodule
+#include "dolfin/ale/ALE.h"
+#include "dolfin/ale/MeshDisplacement.h"
+
+// #include types from graph submodule
+#include "dolfin/graph/Graph.h"
+#include "dolfin/graph/GraphBuilder.h"
+#include "dolfin/graph/BoostGraphOrdering.h"
+#include "dolfin/graph/SCOTCH.h"
+
+// NumPy includes
+#define PY_ARRAY_UNIQUE_SYMBOL PyDOLFIN_FUNCTION
+#include <numpy/arrayobject.h>
+%}
+
+%init%{
+import_array();
+%}
+
+// Include global SWIG interface files:
+// Typemaps, shared_ptr declarations, exceptions, version
+%include "dolfin/swig/globalincludes.i"
+
+// %import types from submodule common of SWIG module common
+%include "dolfin/swig/common/pre.i"
+%import(module="common") "dolfin/common/Array.h"
+%import(module="common") "dolfin/common/Variable.h"
+%import(module="common") "dolfin/common/Hierarchical.h"
+%import(module="common") "dolfin/common/MPI.h"
+
+// %import types from submodule mesh of SWIG module mesh
+%include "dolfin/swig/mesh/pre.i"
+%import(module="mesh") "dolfin/mesh/MeshData.h"
+%import(module="mesh") "dolfin/mesh/Mesh.h"
+%import(module="mesh") "dolfin/mesh/MeshEntity.h"
+%import(module="mesh") "dolfin/mesh/Cell.h"
+%import(module="mesh") "dolfin/mesh/LocalMeshData.h"
+%import(module="mesh") "dolfin/mesh/BoundaryMesh.h"
+
+// %import types from submodule geometry of SWIG module mesh
+%include "dolfin/swig/geometry/pre.i"
+%import(module="mesh") "dolfin/geometry/Point.h"
+
+// %import types from submodule la of SWIG module la
+%include "dolfin/swig/la/pre.i"
+%import(module="la") "dolfin/la/LinearAlgebraObject.h"
+%import(module="la") "dolfin/la/GenericTensor.h"
+%import(module="la") "dolfin/la/GenericVector.h"
+%import(module="la") "dolfin/la/Vector.h"
+
+// %import types from submodule fem of SWIG module fem
+%include "dolfin/swig/fem/pre.i"
+%import(module="fem") "dolfin/fem/GenericDofMap.h"
+%import(module="fem") "dolfin/fem/DofMap.h"
+%import(module="fem") "dolfin/fem/FiniteElement.h"
+%import(module="fem") "dolfin/fem/CCFEMDofMap.h"
+
+// Turn on SWIG generated signature documentation and include doxygen
+// generated docstrings
+//%feature("autodoc", "1");
+%include "dolfin/swig/function/docstrings.i"
+%include "dolfin/swig/math/docstrings.i"
+%include "dolfin/swig/ale/docstrings.i"
+%include "dolfin/swig/graph/docstrings.i"
+
+// %include types from submodule function
+%include "dolfin/swig/function/pre.i"
+%include "dolfin/function/GenericFunction.h"
+%include "dolfin/function/Expression.h"
+%include "dolfin/function/FunctionAXPY.h"
+%include "dolfin/function/Function.h"
+%include "dolfin/function/FunctionSpace.h"
+%include "dolfin/function/SubSpace.h"
+%include "dolfin/function/Constant.h"
+%include "dolfin/function/SpecialFunctions.h"
+%include "dolfin/function/SpecialFacetFunction.h"
+%include "dolfin/function/CCFEMFunctionSpace.h"
+%include "dolfin/function/FunctionAssigner.h"
+%include "dolfin/function/assign.h"
+%include "dolfin/function/CCFEMFunction.h"
+%include "dolfin/function/LagrangeInterpolator.h"
+%include "dolfin/swig/function/post.i"
+
+// %include types from submodule math
+%include "dolfin/math/basic.h"
+%include "dolfin/math/Lagrange.h"
+%include "dolfin/math/Legendre.h"
+
+// %include types from submodule ale
+%include "dolfin/swig/ale/pre.i"
+%include "dolfin/ale/ALE.h"
+%include "dolfin/ale/MeshDisplacement.h"
+
+// %include types from submodule graph
+%include "dolfin/graph/Graph.h"
+%include "dolfin/graph/GraphBuilder.h"
+%include "dolfin/graph/BoostGraphOrdering.h"
+%include "dolfin/graph/SCOTCH.h"
+%include "dolfin/swig/graph/post.i"
+
diff --git a/dolfin/swig/modules/io/CMakeLists.txt b/dolfin/swig/modules/io/CMakeLists.txt
new file mode 100644
index 0000000..29c7acf
--- /dev/null
+++ b/dolfin/swig/modules/io/CMakeLists.txt
@@ -0,0 +1,59 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-swig-interface
+#
+# Automatic get the module name
+get_filename_component(SWIG_MODULE_NAME ${CMAKE_CURRENT_BINARY_DIR} NAME)
+
+# Set project name
+project(${SWIG_MODULE_NAME})
+
+# What does this do?
+get_directory_property(cmake_defs COMPILE_DEFINITIONS)
+
+# Set SWIG flags 
+set(CMAKE_SWIG_FLAGS
+  -module ${SWIG_MODULE_NAME}
+  -shadow
+  -modern
+  -modernargs
+  -fastdispatch
+  -fvirtual
+  -nosafecstrings
+  -noproxydel
+  -fastproxy
+  -fastinit
+  -fastunpack
+  -fastquery
+  -nobuildnone
+  -Iinclude/swig
+  ${DOLFIN_CXX_DEFINITIONS}
+  ${DOLFIN_PYTHON_DEFINITIONS}
+  )
+
+# Get all SWIG interface files
+file(READ ${CMAKE_CURRENT_BINARY_DIR}/dependencies.txt DOLFIN_SWIG_DEPENDENCIES )
+
+# This prevents swig being run unnecessarily
+set_source_files_properties(module.i PROPERTIES SWIG_MODULE_NAME ${SWIG_MODULE_NAME})
+
+# Tell CMake SWIG has generated a C++ file
+set_source_files_properties(module.i PROPERTIES CPLUSPLUS ON)
+
+# Generate SWIG files in 
+set(CMAKE_SWIG_OUTDIR ${CMAKE_CURRENT_BINARY_DIR})
+
+# Tell CMake which SWIG interface files should be checked for changes when recompile
+set(SWIG_MODULE_${SWIG_MODULE_NAME}_EXTRA_DEPS copy_swig_files ${DOLFIN_SWIG_DEPENDENCIES})
+
+# Tell CMake to run SWIG on module.i and to link against libdolfin
+swig_add_module(${SWIG_MODULE_NAME} python module.i)
+swig_link_libraries(${SWIG_MODULE_NAME} dolfin ${PYTHON_LIBRARIES})
+
+# Install Python .py files
+get_target_property(SWIG_MODULE_LOCATION ${SWIG_MODULE_${SWIG_MODULE_NAME}_REAL_NAME} LOCATION)
+install(FILES
+  ${SWIG_MODULE_LOCATION} ${CMAKE_CURRENT_BINARY_DIR}/${SWIG_MODULE_NAME}.py
+  DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin/cpp
+  COMPONENT RuntimeLibraries
+  )
diff --git a/dolfin/swig/modules/io/dependencies.txt b/dolfin/swig/modules/io/dependencies.txt
new file mode 100644
index 0000000..1cdb1f1
--- /dev/null
+++ b/dolfin/swig/modules/io/dependencies.txt
@@ -0,0 +1 @@
+/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Array.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Hierarchical.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/MPI.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Variable.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/fem/DofMap.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/fem/GenericDofMap.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/Expression.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/Function.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/FunctionSpace.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/GenericFunction.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/geometry/Point.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericLinearOperator.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericMatrix.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericTensor.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/GenericVector.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/LinearAlgebraObject.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/Matrix.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/Vector.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/LocalMeshData.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/Mesh.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/MeshData.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/MeshFunction.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/mesh/MeshValueCollection.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/parameter/Parameter.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/parameter/Parameters.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/common/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/defines.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/exceptions.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/fem/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/forwarddeclarations.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/function/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/geometry/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/globalincludes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/io/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/io/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/la/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/mesh/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/modules/io/module.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/parameter/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/shared_ptr_classes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/array.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/includes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/numpy.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/primitives.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_map.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_pair.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_set.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_vector.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/version.i
\ No newline at end of file
diff --git a/dolfin/swig/modules/io/module.i b/dolfin/swig/modules/io/module.i
new file mode 100644
index 0000000..aef26c2
--- /dev/null
+++ b/dolfin/swig/modules/io/module.i
@@ -0,0 +1,161 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+// The PyDOLFIN extension module for the io module
+%module(package="dolfin.cpp.io", directors="1") io
+
+// Define module name for conditional includes
+#define IOMODULE
+
+%{
+
+// Include types from dependent modules
+
+// #include types from common submodule of module common
+#include "dolfin/common/Array.h"
+#include "dolfin/common/Variable.h"
+#include "dolfin/common/Hierarchical.h"
+#include "dolfin/common/MPI.h"
+
+// #include types from parameter submodule of module common
+#include "dolfin/parameter/Parameter.h"
+#include "dolfin/parameter/Parameters.h"
+
+// #include types from mesh submodule of module mesh
+#include "dolfin/mesh/MeshData.h"
+#include "dolfin/mesh/Mesh.h"
+#include "dolfin/mesh/MeshFunction.h"
+#include "dolfin/mesh/MeshValueCollection.h"
+#include "dolfin/mesh/LocalMeshData.h"
+
+// #include types from geometry submodule of module mesh
+#include "dolfin/geometry/Point.h"
+
+// #include types from la submodule of module la
+#include "dolfin/la/LinearAlgebraObject.h"
+#include "dolfin/la/GenericLinearOperator.h"
+#include "dolfin/la/GenericTensor.h"
+#include "dolfin/la/GenericMatrix.h"
+#include "dolfin/la/GenericVector.h"
+#include "dolfin/la/Vector.h"
+#include "dolfin/la/Matrix.h"
+
+// #include types from function submodule of module function
+#include "dolfin/function/GenericFunction.h"
+#include "dolfin/function/Expression.h"
+#include "dolfin/function/Function.h"
+#include "dolfin/function/FunctionSpace.h"
+
+// #include types from fem submodule of module fem
+#include "dolfin/fem/GenericDofMap.h"
+#include "dolfin/fem/DofMap.h"
+
+// Include types from present module io
+
+// #include types from plot submodule
+#include "dolfin/plot/plot.h"
+#include "dolfin/plot/VTKPlotter.h"
+
+// #include types from io submodule
+#include "dolfin/io/GenericFile.h"
+#include "dolfin/io/File.h"
+#include "dolfin/io/XDMFFile.h"
+#include "dolfin/io/HDF5File.h"
+#include "dolfin/io/HDF5Attribute.h"
+
+// NumPy includes
+#define PY_ARRAY_UNIQUE_SYMBOL PyDOLFIN_IO
+#include <numpy/arrayobject.h>
+%}
+
+%init%{
+import_array();
+%}
+
+// Include global SWIG interface files:
+// Typemaps, shared_ptr declarations, exceptions, version
+%include "dolfin/swig/globalincludes.i"
+
+// %import types from submodule common of SWIG module common
+%include "dolfin/swig/common/pre.i"
+%import(module="common") "dolfin/common/Array.h"
+%import(module="common") "dolfin/common/Variable.h"
+%import(module="common") "dolfin/common/Hierarchical.h"
+%import(module="common") "dolfin/common/MPI.h"
+
+// %import types from submodule parameter of SWIG module common
+%include "dolfin/swig/parameter/pre.i"
+%import(module="common") "dolfin/parameter/Parameter.h"
+%import(module="common") "dolfin/parameter/Parameters.h"
+
+// %import types from submodule mesh of SWIG module mesh
+%include "dolfin/swig/mesh/pre.i"
+%import(module="mesh") "dolfin/mesh/MeshData.h"
+%import(module="mesh") "dolfin/mesh/Mesh.h"
+%import(module="mesh") "dolfin/mesh/MeshFunction.h"
+%import(module="mesh") "dolfin/mesh/MeshValueCollection.h"
+%import(module="mesh") "dolfin/mesh/LocalMeshData.h"
+
+// %import types from submodule geometry of SWIG module mesh
+%include "dolfin/swig/geometry/pre.i"
+%import(module="mesh") "dolfin/geometry/Point.h"
+
+// %import types from submodule la of SWIG module la
+%include "dolfin/swig/la/pre.i"
+%import(module="la") "dolfin/la/LinearAlgebraObject.h"
+%import(module="la") "dolfin/la/GenericLinearOperator.h"
+%import(module="la") "dolfin/la/GenericTensor.h"
+%import(module="la") "dolfin/la/GenericMatrix.h"
+%import(module="la") "dolfin/la/GenericVector.h"
+%import(module="la") "dolfin/la/Vector.h"
+%import(module="la") "dolfin/la/Matrix.h"
+
+// %import types from submodule function of SWIG module function
+%include "dolfin/swig/function/pre.i"
+%import(module="function") "dolfin/function/GenericFunction.h"
+%import(module="function") "dolfin/function/Expression.h"
+%import(module="function") "dolfin/function/Function.h"
+%import(module="function") "dolfin/function/FunctionSpace.h"
+
+// %import types from submodule fem of SWIG module fem
+%include "dolfin/swig/fem/pre.i"
+%import(module="fem") "dolfin/fem/GenericDofMap.h"
+%import(module="fem") "dolfin/fem/DofMap.h"
+
+// Turn on SWIG generated signature documentation and include doxygen
+// generated docstrings
+//%feature("autodoc", "1");
+%include "dolfin/swig/plot/docstrings.i"
+%include "dolfin/swig/io/docstrings.i"
+
+// %include types from submodule plot
+%include "dolfin/plot/plot.h"
+%include "dolfin/plot/VTKPlotter.h"
+
+// %include types from submodule io
+%include "dolfin/swig/io/pre.i"
+%include "dolfin/io/GenericFile.h"
+%include "dolfin/io/File.h"
+%include "dolfin/io/XDMFFile.h"
+%include "dolfin/io/HDF5File.h"
+%include "dolfin/io/HDF5Attribute.h"
+%include "dolfin/swig/io/post.i"
+
diff --git a/dolfin/swig/modules/la/CMakeLists.txt b/dolfin/swig/modules/la/CMakeLists.txt
new file mode 100644
index 0000000..29c7acf
--- /dev/null
+++ b/dolfin/swig/modules/la/CMakeLists.txt
@@ -0,0 +1,59 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-swig-interface
+#
+# Automatic get the module name
+get_filename_component(SWIG_MODULE_NAME ${CMAKE_CURRENT_BINARY_DIR} NAME)
+
+# Set project name
+project(${SWIG_MODULE_NAME})
+
+# What does this do?
+get_directory_property(cmake_defs COMPILE_DEFINITIONS)
+
+# Set SWIG flags 
+set(CMAKE_SWIG_FLAGS
+  -module ${SWIG_MODULE_NAME}
+  -shadow
+  -modern
+  -modernargs
+  -fastdispatch
+  -fvirtual
+  -nosafecstrings
+  -noproxydel
+  -fastproxy
+  -fastinit
+  -fastunpack
+  -fastquery
+  -nobuildnone
+  -Iinclude/swig
+  ${DOLFIN_CXX_DEFINITIONS}
+  ${DOLFIN_PYTHON_DEFINITIONS}
+  )
+
+# Get all SWIG interface files
+file(READ ${CMAKE_CURRENT_BINARY_DIR}/dependencies.txt DOLFIN_SWIG_DEPENDENCIES )
+
+# This prevents swig being run unnecessarily
+set_source_files_properties(module.i PROPERTIES SWIG_MODULE_NAME ${SWIG_MODULE_NAME})
+
+# Tell CMake SWIG has generated a C++ file
+set_source_files_properties(module.i PROPERTIES CPLUSPLUS ON)
+
+# Generate SWIG files in 
+set(CMAKE_SWIG_OUTDIR ${CMAKE_CURRENT_BINARY_DIR})
+
+# Tell CMake which SWIG interface files should be checked for changes when recompile
+set(SWIG_MODULE_${SWIG_MODULE_NAME}_EXTRA_DEPS copy_swig_files ${DOLFIN_SWIG_DEPENDENCIES})
+
+# Tell CMake to run SWIG on module.i and to link against libdolfin
+swig_add_module(${SWIG_MODULE_NAME} python module.i)
+swig_link_libraries(${SWIG_MODULE_NAME} dolfin ${PYTHON_LIBRARIES})
+
+# Install Python .py files
+get_target_property(SWIG_MODULE_LOCATION ${SWIG_MODULE_${SWIG_MODULE_NAME}_REAL_NAME} LOCATION)
+install(FILES
+  ${SWIG_MODULE_LOCATION} ${CMAKE_CURRENT_BINARY_DIR}/${SWIG_MODULE_NAME}.py
+  DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin/cpp
+  COMPONENT RuntimeLibraries
+  )
diff --git a/dolfin/swig/modules/la/dependencies.txt b/dolfin/swig/modules/la/dependencies.txt
new file mode 100644
index 0000000..d802cf5
--- /dev/null
+++ b/dolfin/swig/modules/la/dependencies.txt
@@ -0,0 +1 @@
+/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Array.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/MPI.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Variable.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/types.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/graph/Graph.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/parameter/Parameter.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/parameter/Parameters.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/common/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/defines.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/exceptions.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/forwarddeclarations.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/globalincludes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/la/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/la/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/modules/la/module.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/nls/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/parameter/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/shared_ptr_classes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/array.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/includes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/numpy.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/primitives.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_map.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_pair.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_set.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_vector.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/version.i
\ No newline at end of file
diff --git a/dolfin/swig/modules/la/module.i b/dolfin/swig/modules/la/module.i
new file mode 100644
index 0000000..25bfba5
--- /dev/null
+++ b/dolfin/swig/modules/la/module.i
@@ -0,0 +1,217 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+// The PyDOLFIN extension module for the la module
+%module(package="dolfin.cpp.la", directors="1") la
+
+// Define module name for conditional includes
+#define LAMODULE
+
+%{
+
+// Include types from dependent modules
+
+// #include types from common submodule of module common
+#include "dolfin/common/types.h"
+#include "dolfin/common/Array.h"
+#include "dolfin/common/Variable.h"
+#include "dolfin/common/MPI.h"
+
+// #include types from parameter submodule of module common
+#include "dolfin/parameter/Parameter.h"
+#include "dolfin/parameter/Parameters.h"
+
+// #include types from graph submodule of module function
+#include "dolfin/graph/Graph.h"
+
+// Include types from present module la
+
+// #include types from la submodule
+#include "dolfin/la/ublas.h"
+#include "dolfin/la/LinearAlgebraObject.h"
+#include "dolfin/la/GenericLinearOperator.h"
+#include "dolfin/la/GenericTensor.h"
+#include "dolfin/la/GenericMatrix.h"
+#include "dolfin/la/GenericSparsityPattern.h"
+#include "dolfin/la/GenericVector.h"
+#include "dolfin/la/VectorSpaceBasis.h"
+#include "dolfin/la/GenericLinearSolver.h"
+#include "dolfin/la/GenericLUSolver.h"
+#include "dolfin/la/GenericPreconditioner.h"
+#include "dolfin/la/PETScOptions.h"
+#include "dolfin/la/PETScObject.h"
+#include "dolfin/la/PETScBaseMatrix.h"
+#include "dolfin/la/uBLASFactory.h"
+#include "dolfin/la/uBLASMatrix.h"
+#include "dolfin/la/uBLASLinearOperator.h"
+#include "dolfin/la/PETScMatrix.h"
+#include "dolfin/la/PETScLinearOperator.h"
+#include "dolfin/la/PETScPreconditioner.h"
+#include "dolfin/la/EpetraLUSolver.h"
+#include "dolfin/la/EpetraKrylovSolver.h"
+#include "dolfin/la/EpetraMatrix.h"
+#include "dolfin/la/EpetraVector.h"
+#include "dolfin/la/PETScKrylovSolver.h"
+#include "dolfin/la/PETScLUSolver.h"
+#include "dolfin/la/CholmodCholeskySolver.h"
+#include "dolfin/la/UmfpackLUSolver.h"
+#include "dolfin/la/MUMPSLUSolver.h"
+#include "dolfin/la/PaStiXLUSolver.h"
+#include "dolfin/la/STLMatrix.h"
+#include "dolfin/la/CoordinateMatrix.h"
+#include "dolfin/la/uBLASVector.h"
+#include "dolfin/la/PETScVector.h"
+#include "dolfin/la/SparsityPattern.h"
+#include "dolfin/la/GenericLinearAlgebraFactory.h"
+#include "dolfin/la/DefaultFactory.h"
+#include "dolfin/la/PETScUserPreconditioner.h"
+#include "dolfin/la/PETScFactory.h"
+#include "dolfin/la/PETScCuspFactory.h"
+#include "dolfin/la/EpetraFactory.h"
+#include "dolfin/la/STLFactory.h"
+#include "dolfin/la/SLEPcEigenSolver.h"
+#include "dolfin/la/TrilinosPreconditioner.h"
+#include "dolfin/la/uBLASSparseMatrix.h"
+#include "dolfin/la/uBLASDenseMatrix.h"
+#include "dolfin/la/uBLASPreconditioner.h"
+#include "dolfin/la/uBLASKrylovSolver.h"
+#include "dolfin/la/uBLASILUPreconditioner.h"
+#include "dolfin/la/Vector.h"
+#include "dolfin/la/Matrix.h"
+#include "dolfin/la/Scalar.h"
+#include "dolfin/la/LinearSolver.h"
+#include "dolfin/la/KrylovSolver.h"
+#include "dolfin/la/LUSolver.h"
+#include "dolfin/la/solve.h"
+#include "dolfin/la/BlockVector.h"
+#include "dolfin/la/BlockMatrix.h"
+#include "dolfin/la/LinearOperator.h"
+
+// #include types from nls submodule
+#include "dolfin/nls/NonlinearProblem.h"
+#include "dolfin/nls/NewtonSolver.h"
+#include "dolfin/nls/PETScSNESSolver.h"
+#include "dolfin/nls/TAOLinearBoundSolver.h"
+
+// NumPy includes
+#define PY_ARRAY_UNIQUE_SYMBOL PyDOLFIN_LA
+#include <numpy/arrayobject.h>
+%}
+
+%init%{
+import_array();
+%}
+
+// Include global SWIG interface files:
+// Typemaps, shared_ptr declarations, exceptions, version
+%include "dolfin/swig/globalincludes.i"
+
+// %import types from submodule common of SWIG module common
+%include "dolfin/swig/common/pre.i"
+%import(module="common") "dolfin/common/types.h"
+%import(module="common") "dolfin/common/Array.h"
+%import(module="common") "dolfin/common/Variable.h"
+%import(module="common") "dolfin/common/MPI.h"
+
+// %import types from submodule parameter of SWIG module common
+%include "dolfin/swig/parameter/pre.i"
+%import(module="common") "dolfin/parameter/Parameter.h"
+%import(module="common") "dolfin/parameter/Parameters.h"
+
+// %import types from submodule graph of SWIG module function
+%import(module="function") "dolfin/graph/Graph.h"
+
+// Turn on SWIG generated signature documentation and include doxygen
+// generated docstrings
+//%feature("autodoc", "1");
+%include "dolfin/swig/la/docstrings.i"
+%include "dolfin/swig/nls/docstrings.i"
+
+// %include types from submodule la
+%include "dolfin/swig/la/pre.i"
+%include "dolfin/la/ublas.h"
+%include "dolfin/la/LinearAlgebraObject.h"
+%include "dolfin/la/GenericLinearOperator.h"
+%include "dolfin/la/GenericTensor.h"
+%include "dolfin/la/GenericMatrix.h"
+%include "dolfin/la/GenericSparsityPattern.h"
+%include "dolfin/la/GenericVector.h"
+%include "dolfin/la/VectorSpaceBasis.h"
+%include "dolfin/la/GenericLinearSolver.h"
+%include "dolfin/la/GenericLUSolver.h"
+%include "dolfin/la/GenericPreconditioner.h"
+%include "dolfin/la/PETScOptions.h"
+%include "dolfin/la/PETScObject.h"
+%include "dolfin/la/PETScBaseMatrix.h"
+%include "dolfin/la/uBLASFactory.h"
+%include "dolfin/la/uBLASMatrix.h"
+%include "dolfin/la/uBLASLinearOperator.h"
+%include "dolfin/la/PETScMatrix.h"
+%include "dolfin/la/PETScLinearOperator.h"
+%include "dolfin/la/PETScPreconditioner.h"
+%include "dolfin/la/EpetraLUSolver.h"
+%include "dolfin/la/EpetraKrylovSolver.h"
+%include "dolfin/la/EpetraMatrix.h"
+%include "dolfin/la/EpetraVector.h"
+%include "dolfin/la/PETScKrylovSolver.h"
+%include "dolfin/la/PETScLUSolver.h"
+%include "dolfin/la/CholmodCholeskySolver.h"
+%include "dolfin/la/UmfpackLUSolver.h"
+%include "dolfin/la/MUMPSLUSolver.h"
+%include "dolfin/la/PaStiXLUSolver.h"
+%include "dolfin/la/STLMatrix.h"
+%include "dolfin/la/CoordinateMatrix.h"
+%include "dolfin/la/uBLASVector.h"
+%include "dolfin/la/PETScVector.h"
+%include "dolfin/la/SparsityPattern.h"
+%include "dolfin/la/GenericLinearAlgebraFactory.h"
+%include "dolfin/la/DefaultFactory.h"
+%include "dolfin/la/PETScUserPreconditioner.h"
+%include "dolfin/la/PETScFactory.h"
+%include "dolfin/la/PETScCuspFactory.h"
+%include "dolfin/la/EpetraFactory.h"
+%include "dolfin/la/STLFactory.h"
+%include "dolfin/la/SLEPcEigenSolver.h"
+%include "dolfin/la/TrilinosPreconditioner.h"
+%include "dolfin/la/uBLASSparseMatrix.h"
+%include "dolfin/la/uBLASDenseMatrix.h"
+%include "dolfin/la/uBLASPreconditioner.h"
+%include "dolfin/la/uBLASKrylovSolver.h"
+%include "dolfin/la/uBLASILUPreconditioner.h"
+%include "dolfin/la/Vector.h"
+%include "dolfin/la/Matrix.h"
+%include "dolfin/la/Scalar.h"
+%include "dolfin/la/LinearSolver.h"
+%include "dolfin/la/KrylovSolver.h"
+%include "dolfin/la/LUSolver.h"
+%include "dolfin/la/solve.h"
+%include "dolfin/la/BlockVector.h"
+%include "dolfin/la/BlockMatrix.h"
+%include "dolfin/la/LinearOperator.h"
+%include "dolfin/swig/la/post.i"
+
+// %include types from submodule nls
+%include "dolfin/swig/nls/pre.i"
+%include "dolfin/nls/NonlinearProblem.h"
+%include "dolfin/nls/NewtonSolver.h"
+%include "dolfin/nls/PETScSNESSolver.h"
+%include "dolfin/nls/TAOLinearBoundSolver.h"
+
diff --git a/dolfin/swig/modules/mesh/CMakeLists.txt b/dolfin/swig/modules/mesh/CMakeLists.txt
new file mode 100644
index 0000000..29c7acf
--- /dev/null
+++ b/dolfin/swig/modules/mesh/CMakeLists.txt
@@ -0,0 +1,59 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-swig-interface
+#
+# Automatic get the module name
+get_filename_component(SWIG_MODULE_NAME ${CMAKE_CURRENT_BINARY_DIR} NAME)
+
+# Set project name
+project(${SWIG_MODULE_NAME})
+
+# What does this do?
+get_directory_property(cmake_defs COMPILE_DEFINITIONS)
+
+# Set SWIG flags 
+set(CMAKE_SWIG_FLAGS
+  -module ${SWIG_MODULE_NAME}
+  -shadow
+  -modern
+  -modernargs
+  -fastdispatch
+  -fvirtual
+  -nosafecstrings
+  -noproxydel
+  -fastproxy
+  -fastinit
+  -fastunpack
+  -fastquery
+  -nobuildnone
+  -Iinclude/swig
+  ${DOLFIN_CXX_DEFINITIONS}
+  ${DOLFIN_PYTHON_DEFINITIONS}
+  )
+
+# Get all SWIG interface files
+file(READ ${CMAKE_CURRENT_BINARY_DIR}/dependencies.txt DOLFIN_SWIG_DEPENDENCIES )
+
+# This prevents swig being run unnecessarily
+set_source_files_properties(module.i PROPERTIES SWIG_MODULE_NAME ${SWIG_MODULE_NAME})
+
+# Tell CMake SWIG has generated a C++ file
+set_source_files_properties(module.i PROPERTIES CPLUSPLUS ON)
+
+# Generate SWIG files in 
+set(CMAKE_SWIG_OUTDIR ${CMAKE_CURRENT_BINARY_DIR})
+
+# Tell CMake which SWIG interface files should be checked for changes when recompile
+set(SWIG_MODULE_${SWIG_MODULE_NAME}_EXTRA_DEPS copy_swig_files ${DOLFIN_SWIG_DEPENDENCIES})
+
+# Tell CMake to run SWIG on module.i and to link against libdolfin
+swig_add_module(${SWIG_MODULE_NAME} python module.i)
+swig_link_libraries(${SWIG_MODULE_NAME} dolfin ${PYTHON_LIBRARIES})
+
+# Install Python .py files
+get_target_property(SWIG_MODULE_LOCATION ${SWIG_MODULE_${SWIG_MODULE_NAME}_REAL_NAME} LOCATION)
+install(FILES
+  ${SWIG_MODULE_LOCATION} ${CMAKE_CURRENT_BINARY_DIR}/${SWIG_MODULE_NAME}.py
+  DESTINATION ${DOLFIN_INSTALL_PYTHON_MODULE_DIR}/dolfin/cpp
+  COMPONENT RuntimeLibraries
+  )
diff --git a/dolfin/swig/modules/mesh/dependencies.txt b/dolfin/swig/modules/mesh/dependencies.txt
new file mode 100644
index 0000000..4cea989
--- /dev/null
+++ b/dolfin/swig/modules/mesh/dependencies.txt
@@ -0,0 +1 @@
+/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Array.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Hierarchical.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/MPI.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/common/Variable.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/Expression.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/Function.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/FunctionSpace.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/function/GenericFunction.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/la/LinearAlgebraObject.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/parameter/Parameter.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/parameter/Parameters.h;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/common/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/defines.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/exceptions.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/forwarddeclarations.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/function/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/generation/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/geometry/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/geometry/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/globalincludes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/la/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/mesh/post.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/mesh/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/modules/mesh/module.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/parameter/pre.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/shared_ptr_classes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/array.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/includes.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/numpy.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/primitives.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_map.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_pair.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_set.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/typemaps/std_vector.i;/home/johannr/dev/fenics/src/dolfin/release/dolfin-1.4.0/dolfin/swig/version.i
\ No newline at end of file
diff --git a/dolfin/swig/modules/mesh/module.i b/dolfin/swig/modules/mesh/module.i
new file mode 100644
index 0000000..2af9798
--- /dev/null
+++ b/dolfin/swig/modules/mesh/module.i
@@ -0,0 +1,245 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+// The PyDOLFIN extension module for the mesh module
+%module(package="dolfin.cpp.mesh", directors="1") mesh
+
+// Define module name for conditional includes
+#define MESHMODULE
+
+%{
+
+// Include types from dependent modules
+
+// #include types from common submodule of module common
+#include "dolfin/common/Array.h"
+#include "dolfin/common/Variable.h"
+#include "dolfin/common/Hierarchical.h"
+#include "dolfin/common/MPI.h"
+
+// #include types from parameter submodule of module common
+#include "dolfin/parameter/Parameter.h"
+#include "dolfin/parameter/Parameters.h"
+
+// #include types from la submodule of module la
+#include "dolfin/la/LinearAlgebraObject.h"
+
+// #include types from function submodule of module function
+#include "dolfin/function/GenericFunction.h"
+#include "dolfin/function/Expression.h"
+#include "dolfin/function/Function.h"
+#include "dolfin/function/FunctionSpace.h"
+
+// Include types from present module mesh
+
+// #include types from mesh submodule
+#include "dolfin/mesh/CellType.h"
+#include "dolfin/mesh/MeshTopology.h"
+#include "dolfin/mesh/MeshGeometry.h"
+#include "dolfin/mesh/MeshDomains.h"
+#include "dolfin/mesh/MeshData.h"
+#include "dolfin/mesh/Mesh.h"
+#include "dolfin/mesh/MeshEntity.h"
+#include "dolfin/mesh/MeshEntityIterator.h"
+#include "dolfin/mesh/MeshEntityIteratorBase.h"
+#include "dolfin/mesh/SubsetIterator.h"
+#include "dolfin/mesh/Vertex.h"
+#include "dolfin/mesh/Edge.h"
+#include "dolfin/mesh/Face.h"
+#include "dolfin/mesh/Facet.h"
+#include "dolfin/mesh/Cell.h"
+#include "dolfin/mesh/FacetCell.h"
+#include "dolfin/mesh/MeshConnectivity.h"
+#include "dolfin/mesh/MeshEditor.h"
+#include "dolfin/mesh/DynamicMeshEditor.h"
+#include "dolfin/mesh/LocalMeshValueCollection.h"
+#include "dolfin/mesh/MeshFunction.h"
+#include "dolfin/mesh/MeshValueCollection.h"
+#include "dolfin/mesh/MeshColoring.h"
+#include "dolfin/mesh/MeshRenumbering.h"
+#include "dolfin/mesh/MeshTransformation.h"
+#include "dolfin/mesh/LocalMeshData.h"
+#include "dolfin/mesh/SubDomain.h"
+#include "dolfin/mesh/SubMesh.h"
+#include "dolfin/mesh/Restriction.h"
+#include "dolfin/mesh/DomainBoundary.h"
+#include "dolfin/mesh/BoundaryMesh.h"
+#include "dolfin/mesh/PeriodicBoundaryComputation.h"
+#include "dolfin/mesh/MeshQuality.h"
+
+// #include types from generation submodule
+#include "dolfin/generation/ImplicitDomainMeshGenerator.h"
+#include "dolfin/generation/PolygonalMeshGenerator.h"
+#include "dolfin/generation/PolyhedralMeshGenerator.h"
+#include "dolfin/generation/Triangulate.h"
+#include "dolfin/generation/BoxMesh.h"
+#include "dolfin/generation/EllipseMesh.h"
+#include "dolfin/generation/EllipsoidMesh.h"
+#include "dolfin/generation/IntervalMesh.h"
+#include "dolfin/generation/RectangleMesh.h"
+#include "dolfin/generation/UnitTetrahedronMesh.h"
+#include "dolfin/generation/UnitCubeMesh.h"
+#include "dolfin/generation/UnitIntervalMesh.h"
+#include "dolfin/generation/UnitTriangleMesh.h"
+#include "dolfin/generation/UnitSquareMesh.h"
+#include "dolfin/generation/CSGGeometry.h"
+#include "dolfin/generation/CSGMeshGenerator.h"
+#include "dolfin/generation/CSGCGALMeshGenerator2D.h"
+#include "dolfin/generation/CSGCGALMeshGenerator3D.h"
+#include "dolfin/generation/CSGOperators.h"
+#include "dolfin/generation/CSGPrimitive.h"
+#include "dolfin/generation/CSGPrimitives2D.h"
+#include "dolfin/generation/CSGPrimitives3D.h"
+#include "dolfin/generation/CSGGeometries3D.h"
+
+// #include types from geometry submodule
+#include "dolfin/geometry/ImplicitSurface.h"
+#include "dolfin/geometry/Point.h"
+#include "dolfin/geometry/BoundingBoxTree.h"
+#include "dolfin/geometry/GenericBoundingBoxTree.h"
+#include "dolfin/geometry/BoundingBoxTree3D.h"
+#include "dolfin/geometry/MeshPointIntersection.h"
+#include "dolfin/geometry/intersect.h"
+
+// #include types from refinement submodule
+#include "dolfin/refinement/refine.h"
+
+// NumPy includes
+#define PY_ARRAY_UNIQUE_SYMBOL PyDOLFIN_MESH
+#include <numpy/arrayobject.h>
+%}
+
+%init%{
+import_array();
+%}
+
+// Include global SWIG interface files:
+// Typemaps, shared_ptr declarations, exceptions, version
+%include "dolfin/swig/globalincludes.i"
+
+// %import types from submodule common of SWIG module common
+%include "dolfin/swig/common/pre.i"
+%import(module="common") "dolfin/common/Array.h"
+%import(module="common") "dolfin/common/Variable.h"
+%import(module="common") "dolfin/common/Hierarchical.h"
+%import(module="common") "dolfin/common/MPI.h"
+
+// %import types from submodule parameter of SWIG module common
+%include "dolfin/swig/parameter/pre.i"
+%import(module="common") "dolfin/parameter/Parameter.h"
+%import(module="common") "dolfin/parameter/Parameters.h"
+
+// %import types from submodule la of SWIG module la
+%include "dolfin/swig/la/pre.i"
+%import(module="la") "dolfin/la/LinearAlgebraObject.h"
+
+// %import types from submodule function of SWIG module function
+%include "dolfin/swig/function/pre.i"
+%import(module="function") "dolfin/function/GenericFunction.h"
+%import(module="function") "dolfin/function/Expression.h"
+%import(module="function") "dolfin/function/Function.h"
+%import(module="function") "dolfin/function/FunctionSpace.h"
+
+// Turn on SWIG generated signature documentation and include doxygen
+// generated docstrings
+//%feature("autodoc", "1");
+%include "dolfin/swig/mesh/docstrings.i"
+%include "dolfin/swig/generation/docstrings.i"
+%include "dolfin/swig/geometry/docstrings.i"
+%include "dolfin/swig/refinement/docstrings.i"
+
+// %include types from submodule mesh
+%include "dolfin/swig/mesh/pre.i"
+%include "dolfin/mesh/CellType.h"
+%include "dolfin/mesh/MeshTopology.h"
+%include "dolfin/mesh/MeshGeometry.h"
+%include "dolfin/mesh/MeshDomains.h"
+%include "dolfin/mesh/MeshData.h"
+%include "dolfin/mesh/Mesh.h"
+%include "dolfin/mesh/MeshEntity.h"
+%include "dolfin/mesh/MeshEntityIterator.h"
+%include "dolfin/mesh/MeshEntityIteratorBase.h"
+%include "dolfin/mesh/SubsetIterator.h"
+%include "dolfin/mesh/Vertex.h"
+%include "dolfin/mesh/Edge.h"
+%include "dolfin/mesh/Face.h"
+%include "dolfin/mesh/Facet.h"
+%include "dolfin/mesh/Cell.h"
+%include "dolfin/mesh/FacetCell.h"
+%include "dolfin/mesh/MeshConnectivity.h"
+%include "dolfin/mesh/MeshEditor.h"
+%include "dolfin/mesh/DynamicMeshEditor.h"
+%include "dolfin/mesh/LocalMeshValueCollection.h"
+%include "dolfin/mesh/MeshFunction.h"
+%include "dolfin/mesh/MeshValueCollection.h"
+%include "dolfin/mesh/MeshColoring.h"
+%include "dolfin/mesh/MeshRenumbering.h"
+%include "dolfin/mesh/MeshTransformation.h"
+%include "dolfin/mesh/LocalMeshData.h"
+%include "dolfin/mesh/SubDomain.h"
+%include "dolfin/mesh/SubMesh.h"
+%include "dolfin/mesh/Restriction.h"
+%include "dolfin/mesh/DomainBoundary.h"
+%include "dolfin/mesh/BoundaryMesh.h"
+%include "dolfin/mesh/PeriodicBoundaryComputation.h"
+%include "dolfin/mesh/MeshQuality.h"
+%include "dolfin/swig/mesh/post.i"
+
+// %include types from submodule generation
+%include "dolfin/generation/ImplicitDomainMeshGenerator.h"
+%include "dolfin/generation/PolygonalMeshGenerator.h"
+%include "dolfin/generation/PolyhedralMeshGenerator.h"
+%include "dolfin/generation/Triangulate.h"
+%include "dolfin/generation/BoxMesh.h"
+%include "dolfin/generation/EllipseMesh.h"
+%include "dolfin/generation/EllipsoidMesh.h"
+%include "dolfin/generation/IntervalMesh.h"
+%include "dolfin/generation/RectangleMesh.h"
+%include "dolfin/generation/UnitTetrahedronMesh.h"
+%include "dolfin/generation/UnitCubeMesh.h"
+%include "dolfin/generation/UnitIntervalMesh.h"
+%include "dolfin/generation/UnitTriangleMesh.h"
+%include "dolfin/generation/UnitSquareMesh.h"
+%include "dolfin/generation/CSGGeometry.h"
+%include "dolfin/generation/CSGMeshGenerator.h"
+%include "dolfin/generation/CSGCGALMeshGenerator2D.h"
+%include "dolfin/generation/CSGCGALMeshGenerator3D.h"
+%include "dolfin/generation/CSGOperators.h"
+%include "dolfin/generation/CSGPrimitive.h"
+%include "dolfin/generation/CSGPrimitives2D.h"
+%include "dolfin/generation/CSGPrimitives3D.h"
+%include "dolfin/generation/CSGGeometries3D.h"
+%include "dolfin/swig/generation/post.i"
+
+// %include types from submodule geometry
+%include "dolfin/swig/geometry/pre.i"
+%include "dolfin/geometry/ImplicitSurface.h"
+%include "dolfin/geometry/Point.h"
+%include "dolfin/geometry/BoundingBoxTree.h"
+%include "dolfin/geometry/GenericBoundingBoxTree.h"
+%include "dolfin/geometry/BoundingBoxTree3D.h"
+%include "dolfin/geometry/MeshPointIntersection.h"
+%include "dolfin/geometry/intersect.h"
+%include "dolfin/swig/geometry/post.i"
+
+// %include types from submodule refinement
+%include "dolfin/refinement/refine.h"
+
diff --git a/dolfin/swig/multistage/docstrings.i b/dolfin/swig/multistage/docstrings.i
new file mode 100644
index 0000000..f510696
--- /dev/null
+++ b/dolfin/swig/multistage/docstrings.i
@@ -0,0 +1,136 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=multistage, header=MultiStageScheme.h)
+%feature("docstring")  dolfin::MultiStageScheme::MultiStageScheme "
+**Overloaded versions**
+
+* MultiStageScheme\ (stage_forms, last_stage, stage_solutions, u, t, dt, dt_stage_offset, jacobian_indices, order, name, human_form)
+
+  Constructor
+  FIXME: This constructor is a MESS. Needs clean up...
+
+* MultiStageScheme\ (stage_forms, last_stage, stage_solutions, u, t, dt, dt_stage_offset, jacobian_indices, order, name, human_form, bcs)
+
+  Constructor with Boundary conditions
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::stage_forms "
+Return the stages
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::last_stage "
+Return the last stage
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::stage_solutions "
+Return stage solutions
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::solution "
+**Overloaded versions**
+
+* solution\ ()
+
+  Return solution variable
+
+* solution\ ()
+
+  Return solution variable (const version)
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::t "
+Return local time
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::dt "
+Return local timestep
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::dt_stage_offset "
+Return local timestep
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::order "
+Return the order of the scheme
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::bcs "
+Return boundary conditions
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::implicit "
+**Overloaded versions**
+
+* implicit\ (stage)
+
+  Return true if stage is implicit
+
+* implicit\ ()
+
+  Return true if the whole scheme is implicit
+";
+
+%feature("docstring")  dolfin::MultiStageScheme::str "
+Return informal string representation (pretty-print)
+";
+
+// Documentation extracted from: (module=multistage, header=RKSolver.h)
+%feature("docstring")  dolfin::RKSolver::RKSolver "
+Constructor
+FIXME: Include version where one can pass a Solver and/or Parameters
+";
+
+%feature("docstring")  dolfin::RKSolver::step "
+Step solver with time step dt
+";
+
+%feature("docstring")  dolfin::RKSolver::step_interval "
+Step solver an interval using dt as time step
+";
+
+%feature("docstring")  dolfin::RKSolver::scheme "
+Return the MultiStageScheme
+";
+
+// Documentation extracted from: (module=multistage, header=PointIntegralSolver.h)
+%feature("docstring")  dolfin::PointIntegralSolver::PointIntegralSolver "
+Constructor
+FIXME: Include version where one can pass a Solver and/or Parameters
+";
+
+%feature("docstring")  dolfin::PointIntegralSolver::step "
+Step solver with time step dt
+";
+
+%feature("docstring")  dolfin::PointIntegralSolver::step_interval "
+Step solver an interval using dt as time step
+";
+
+%feature("docstring")  dolfin::PointIntegralSolver::scheme "
+Return the MultiStageScheme
+";
+
+%feature("docstring")  dolfin::PointIntegralSolver::default_parameters "
+Default parameter values
+";
+
diff --git a/dolfin/swig/multistage/pre.i b/dolfin/swig/multistage/pre.i
new file mode 100644
index 0000000..bca6593
--- /dev/null
+++ b/dolfin/swig/multistage/pre.i
@@ -0,0 +1,39 @@
+/* -*- C -*- */
+// Copyright (C) 2013 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-04-23
+// Last changed: 2013-04-24
+
+//=============================================================================
+// SWIG directives for the DOLFIN multistage kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+// Ignore access methods to MultiStageScheme as equivalent methods are added 
+// to a wrapped Python class
+%ignore dolfin::MultiStageScheme::stage_forms;
+%ignore dolfin::MultiStageScheme::last_stage;
+%ignore dolfin::MultiStageScheme::stage_solutions;
+%ignore dolfin::MultiStageScheme::solution;
+%ignore dolfin::MultiStageScheme::t;
+%ignore dolfin::MultiStageScheme::dt;
+
+%ignore dolfin::PointIntegralSolver::scheme;
+%ignore dolfin::RKSolver::scheme;
diff --git a/dolfin/swig/nls/docstrings.i b/dolfin/swig/nls/docstrings.i
new file mode 100644
index 0000000..9cc4ab9
--- /dev/null
+++ b/dolfin/swig/nls/docstrings.i
@@ -0,0 +1,248 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=nls, header=NonlinearProblem.h)
+%feature("docstring")  dolfin::NonlinearProblem "
+This is a base class for nonlinear problems which can return the
+nonlinear function F(u) and its Jacobian J = dF(u)/du.
+";
+
+%feature("docstring")  dolfin::NonlinearProblem::NonlinearProblem "
+Constructor
+";
+
+%feature("docstring")  dolfin::NonlinearProblem::form "
+Function called by Newton solver before requesting F or J.
+This can be used to compute F and J together
+";
+
+%feature("docstring")  dolfin::NonlinearProblem::F "
+Compute F at current point x
+";
+
+%feature("docstring")  dolfin::NonlinearProblem::J "
+Compute J = F' at current point x
+";
+
+// Documentation extracted from: (module=nls, header=NewtonSolver.h)
+%feature("docstring")  dolfin::NewtonSolver "
+This class defines a Newton solver for nonlinear systems of
+equations of the form :math:`F(x) = 0`.
+";
+
+%feature("docstring")  dolfin::NewtonSolver::NewtonSolver "
+**Overloaded versions**
+
+* NewtonSolver\ ()
+
+  Create nonlinear solver
+
+* NewtonSolver\ (solver, factory)
+
+  Create nonlinear solver using provided linear solver
+  
+  *Arguments*
+      solver (:py:class:`GenericLinearSolver`)
+          The linear solver.
+      factory (:py:class:`GenericLinearAlgebraFactory`)
+          The factory.
+";
+
+%feature("docstring")  dolfin::NewtonSolver::solve "
+Solve abstract nonlinear problem :math:`F(x) = 0` for given
+:math:`F` and Jacobian :math:`\dfrac{\partial F}{\partial x}`.
+
+*Arguments*
+    nonlinear_function (:py:class:`NonlinearProblem`)
+        The nonlinear problem.
+    x (:py:class:`GenericVector`)
+        The vector.
+
+*Returns*
+    (int, bool)
+        Pair of number of Newton iterations, and whether
+        iteration converged)
+";
+
+%feature("docstring")  dolfin::NewtonSolver::iteration "
+Return Newton iteration number
+
+*Returns*
+    int
+        The iteration number.
+";
+
+%feature("docstring")  dolfin::NewtonSolver::residual "
+Return current residual
+
+*Returns*
+    float
+        Current residual.
+";
+
+%feature("docstring")  dolfin::NewtonSolver::relative_residual "
+Return current relative residual
+
+*Returns*
+    float
+      Current relative residual.
+";
+
+%feature("docstring")  dolfin::NewtonSolver::linear_solver "
+Return the linear solver
+
+*Returns*
+    :py:class:`GenericLinearSolver`
+        The linear solver.
+";
+
+%feature("docstring")  dolfin::NewtonSolver::default_parameters "
+Default parameter values
+
+*Returns*
+    :py:class:`Parameters`
+        Parameter values.
+";
+
+// Documentation extracted from: (module=nls, header=PETScSNESSolver.h)
+%feature("docstring")  dolfin::PETScSNESSolver "
+This class implements methods for solving nonlinear systems
+via PETSc's SNES interface. It includes line search and trust
+region techniques for globalising the convergence of the
+nonlinear iteration.
+";
+
+%feature("docstring")  dolfin::PETScSNESSolver::PETScSNESSolver "
+Create SNES solver for a particular method
+";
+
+%feature("docstring")  dolfin::PETScSNESSolver::solve "
+**Overloaded versions**
+
+* solve\ (nonlinear_problem, x, lb, ub)
+
+  Solve a nonlinear variational inequality with bound constraints
+  
+  *Arguments*
+      nonlinear_function (:py:class:`NonlinearProblem`)
+          The nonlinear problem.
+      x (:py:class:`GenericVector`)
+          The vector.
+      lb (:py:class:`GenericVector`)
+          The lower bound.
+      ub (:py:class:`GenericVector`)
+          The upper bound.
+  
+  *Returns*
+      (int, bool)
+          Pair of number of Newton iterations, and whether
+          iteration converged)
+
+* solve\ (nonlinear_function, x)
+
+  Solve abstract nonlinear problem :math:`F(x) = 0` for given
+  :math:`F` and Jacobian :math:`\dfrac{\partial F}{\partial x}`.
+  
+  *Arguments*
+      nonlinear_function (:py:class:`NonlinearProblem`)
+          The nonlinear problem.
+      x (:py:class:`GenericVector`)
+          The vector.
+  
+  *Returns*
+      (int, bool)
+          Pair of number of Newton iterations, and whether
+          iteration converged)
+";
+
+%feature("docstring")  dolfin::PETScSNESSolver::init "
+Set up the SNES object, but don't do anything yet, in case the
+user wants to access the SNES object directly
+";
+
+%feature("docstring")  dolfin::PETScSNESSolver::methods "
+Return a list of available solver methods
+";
+
+%feature("docstring")  dolfin::PETScSNESSolver::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::PETScSNESSolver::snes "
+Return PETSc SNES pointer
+";
+
+// Documentation extracted from: (module=nls, header=TAOLinearBoundSolver.h)
+%feature("docstring")  dolfin::TAOLinearBoundSolver "
+This class provides a bound constrained solver for a
+linear variational inequality defined by a matrix A and a vector b.
+It solves the problem:
+
+Find :math:`x_l\leq x\leq x_u` such that
+:math:`(Ax-b)\cdot (y-x)\geq 0,\; \forall x_l\leq y\leq x_u`
+
+It is a wrapper for the TAO bound constrained solver.
+
+*Example*
+    .. note::
+    
+        No example code available for this function.
+";
+
+%feature("docstring")  dolfin::TAOLinearBoundSolver::TAOLinearBoundSolver "
+Create TAO bound constrained solver
+";
+
+%feature("docstring")  dolfin::TAOLinearBoundSolver::solve "
+**Overloaded versions**
+
+* solve\ (A, x, b, xl, xu)
+
+  Solve the linear variational inequality defined by A and b
+  with xl =< x <= xu
+
+* solve\ (A, x, b, xl, xu)
+
+  Solve the linear variational inequality defined by A and b
+  with xl =< x <= xu
+";
+
+%feature("docstring")  dolfin::TAOLinearBoundSolver::set_ksp "
+Set PETSC Krylov Solver (ksp) used by TAO
+";
+
+%feature("docstring")  dolfin::TAOLinearBoundSolver::methods "
+Return a list of available Tao solver methods
+";
+
+%feature("docstring")  dolfin::TAOLinearBoundSolver::krylov_solvers "
+Return a list of available krylov solvers
+";
+
+%feature("docstring")  dolfin::TAOLinearBoundSolver::preconditioners "
+Return a list of available preconditioners
+";
+
+%feature("docstring")  dolfin::TAOLinearBoundSolver::default_parameters "
+Default parameter values
+";
+
diff --git a/dolfin/swig/nls/pre.i b/dolfin/swig/nls/pre.i
new file mode 100644
index 0000000..8e54a02
--- /dev/null
+++ b/dolfin/swig/nls/pre.i
@@ -0,0 +1,64 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-10-07
+// Last changed: 2012-08-09
+
+//=============================================================================
+// SWIG directives for the DOLFIN nls kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Add director classes
+//-----------------------------------------------------------------------------
+%feature("director") dolfin::NonlinearProblem;
+
+//-----------------------------------------------------------------------------
+// Director typemaps for dolfin::GenericFoo
+//-----------------------------------------------------------------------------
+// FIXME: Why are not the typemaps defined by this macro kicking in?!?!
+%define DIRECTORIN_TYPEMAPS(TYPE, CONST)
+
+%typemap(directorin, fragment="NoDelete") CONST TYPE& {
+  std::shared_ptr< CONST TYPE > *smartresult = new std::shared_ptr< CONST TYPE >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< TYPE > *), SWIG_POINTER_OWN);
+}
+
+%enddef
+
+DIRECTORIN_TYPEMAPS(dofin::GenericMatrix, )
+DIRECTORIN_TYPEMAPS(dofin::GenericVector, )
+DIRECTORIN_TYPEMAPS(dofin::GenericVector, const)
+
+%typemap(directorin, fragment="NoDelete") dolfin::GenericMatrix& {
+    std::shared_ptr< dolfin::GenericMatrix > *smartresult = new std::shared_ptr< dolfin::GenericMatrix >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::GenericMatrix > *), SWIG_POINTER_OWN);
+}
+
+%typemap(directorin, fragment="NoDelete") dolfin::GenericVector& {
+  std::shared_ptr< dolfin::GenericVector > *smartresult = new std::shared_ptr< dolfin::GenericVector >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::GenericVector > *), SWIG_POINTER_OWN);
+}
+
+%typemap(directorin, fragment="NoDelete") const dolfin::GenericVector& {
+  std::shared_ptr< const dolfin::GenericVector > *smartresult = new std::shared_ptr< const dolfin::GenericVector >(reference_to_no_delete_pointer($1_name));
+  $input = SWIG_NewPointerObj(%as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::GenericVector > *), SWIG_POINTER_OWN);
+}
diff --git a/dolfin/swig/parameter/docstrings.i b/dolfin/swig/parameter/docstrings.i
new file mode 100644
index 0000000..ff4cd1b
--- /dev/null
+++ b/dolfin/swig/parameter/docstrings.i
@@ -0,0 +1,562 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=parameter, header=Parameter.h)
+%feature("docstring")  dolfin::Parameter "
+Base class for parameters.
+";
+
+%feature("docstring")  dolfin::Parameter::Parameter "
+Create parameter for given key
+";
+
+%feature("docstring")  dolfin::Parameter::key "
+Return parameter key
+";
+
+%feature("docstring")  dolfin::Parameter::description "
+Return parameter description
+";
+
+%feature("docstring")  dolfin::Parameter::is_set "
+Return true if parameter is set, return false otherwise
+";
+
+%feature("docstring")  dolfin::Parameter::reset "
+Reset the parameter to empty, so that is_set() returns false.
+";
+
+%feature("docstring")  dolfin::Parameter::access_count "
+Return access count (number of times parameter has been accessed)
+";
+
+%feature("docstring")  dolfin::Parameter::change_count "
+Return change count (number of times parameter has been changed)
+";
+
+%feature("docstring")  dolfin::Parameter::set_range "
+**Overloaded versions**
+
+* set_range\ (min_value, max_value)
+
+  Set range for int-valued parameter
+
+* set_range\ (min_value, max_value)
+
+  Set range for double-valued parameter
+
+* set_range\ (range)
+
+  Set range for string-valued parameter
+";
+
+%feature("docstring")  dolfin::Parameter::get_range "
+**Overloaded versions**
+
+* get_range\ (min_value, max_value)
+
+  Get range for int-valued parameter
+
+* get_range\ (min_value, max_value)
+
+  Get range for double-valued parameter
+
+* get_range\ (range)
+
+  Get range for string-valued parameter
+";
+
+%feature("docstring")  dolfin::Parameter::operator= "
+**Overloaded versions**
+
+* operator=\ (value)
+
+  Assignment from int
+
+* operator=\ (value)
+
+  Assignment from double
+
+* operator=\ (value)
+
+  Assignment from string
+
+* operator=\ (value)
+
+  Assignment from string
+
+* operator=\ (value)
+
+  Assignment from bool
+";
+
+%feature("docstring")  dolfin::Parameter::operator int "
+Cast parameter to int
+";
+
+%feature("docstring")  dolfin::Parameter::operator std::size_t "
+Cast parameter to std::size_t
+";
+
+%feature("docstring")  dolfin::Parameter::operator double "
+Cast parameter to double
+";
+
+%feature("docstring")  dolfin::Parameter::operator std::string "
+Cast parameter to string
+";
+
+%feature("docstring")  dolfin::Parameter::operator bool "
+Cast parameter to bool
+";
+
+%feature("docstring")  dolfin::Parameter::type_str "
+Return value type string
+";
+
+%feature("docstring")  dolfin::Parameter::value_str "
+Return value string
+";
+
+%feature("docstring")  dolfin::Parameter::range_str "
+Return range string
+";
+
+%feature("docstring")  dolfin::Parameter::str "
+Return short string description
+";
+
+%feature("docstring")  dolfin::IntParameter "
+Parameter with value type int
+";
+
+%feature("docstring")  dolfin::IntParameter::IntParameter "
+**Overloaded versions**
+
+* IntParameter\ (key)
+
+  Create unset int-valued
+
+* IntParameter\ (key, value)
+
+  Create int-valued parameter
+";
+
+%feature("docstring")  dolfin::IntParameter::set_range "
+Set range
+";
+
+%feature("docstring")  dolfin::IntParameter::get_range "
+Get range
+";
+
+%feature("docstring")  dolfin::IntParameter::operator= "
+Assignment
+";
+
+%feature("docstring")  dolfin::IntParameter::operator int "
+Cast parameter to int
+";
+
+%feature("docstring")  dolfin::IntParameter::operator std::size_t "
+Cast parameter to std::size_t
+";
+
+%feature("docstring")  dolfin::IntParameter::type_str "
+Return value type string
+";
+
+%feature("docstring")  dolfin::IntParameter::value_str "
+Return value string
+";
+
+%feature("docstring")  dolfin::IntParameter::range_str "
+Return range string
+";
+
+%feature("docstring")  dolfin::IntParameter::str "
+Return short string description
+";
+
+%feature("docstring")  dolfin::DoubleParameter "
+Parameter with value type double
+";
+
+%feature("docstring")  dolfin::DoubleParameter::DoubleParameter "
+**Overloaded versions**
+
+* DoubleParameter\ (key)
+
+  Create unset double-valued parameter
+
+* DoubleParameter\ (key, value)
+
+  Create double-valued parameter
+";
+
+%feature("docstring")  dolfin::DoubleParameter::set_range "
+Set range
+";
+
+%feature("docstring")  dolfin::DoubleParameter::get_range "
+Get range
+";
+
+%feature("docstring")  dolfin::DoubleParameter::operator= "
+Assignment
+";
+
+%feature("docstring")  dolfin::DoubleParameter::operator double "
+Cast parameter to double
+";
+
+%feature("docstring")  dolfin::DoubleParameter::type_str "
+Return value type string
+";
+
+%feature("docstring")  dolfin::DoubleParameter::value_str "
+Return value string
+";
+
+%feature("docstring")  dolfin::DoubleParameter::range_str "
+Return range string
+";
+
+%feature("docstring")  dolfin::DoubleParameter::str "
+Return short string description
+";
+
+%feature("docstring")  dolfin::StringParameter "
+Parameter with value type string
+";
+
+%feature("docstring")  dolfin::StringParameter::StringParameter "
+**Overloaded versions**
+
+* StringParameter\ (key)
+
+  Create unset string-valued parameter
+
+* StringParameter\ (key, value)
+
+  Create string-valued parameter
+";
+
+%feature("docstring")  dolfin::StringParameter::set_range "
+Set range
+";
+
+%feature("docstring")  dolfin::StringParameter::get_range "
+Get range
+";
+
+%feature("docstring")  dolfin::StringParameter::operator= "
+**Overloaded versions**
+
+* operator=\ (value)
+
+  Assignment
+
+* operator=\ (value)
+
+  Assignment
+";
+
+%feature("docstring")  dolfin::StringParameter::operator std::string "
+Cast parameter to string
+";
+
+%feature("docstring")  dolfin::StringParameter::type_str "
+Return value type string
+";
+
+%feature("docstring")  dolfin::StringParameter::value_str "
+Return value string
+";
+
+%feature("docstring")  dolfin::StringParameter::range_str "
+Return range string
+";
+
+%feature("docstring")  dolfin::StringParameter::str "
+Return short string description
+";
+
+%feature("docstring")  dolfin::BoolParameter "
+Parameter with value type bool
+";
+
+%feature("docstring")  dolfin::BoolParameter::BoolParameter "
+**Overloaded versions**
+
+* BoolParameter\ (key)
+
+  Create unset bool-valued parameter
+
+* BoolParameter\ (key, value)
+
+  Create bool-valued parameter
+";
+
+%feature("docstring")  dolfin::BoolParameter::operator= "
+Assignment
+";
+
+%feature("docstring")  dolfin::BoolParameter::operator bool "
+Cast parameter to bool
+";
+
+%feature("docstring")  dolfin::BoolParameter::type_str "
+Return value type string
+";
+
+%feature("docstring")  dolfin::BoolParameter::value_str "
+Return value string
+";
+
+%feature("docstring")  dolfin::BoolParameter::range_str "
+Return range string
+";
+
+%feature("docstring")  dolfin::BoolParameter::str "
+Return short string description
+";
+
+// Documentation extracted from: (module=parameter, header=Parameters.h)
+%feature("docstring")  dolfin::Parameters "
+This class stores a set of parameters. Each parameter is
+identified by a unique string (the key) and a value of some
+given value type. Parameter sets can be nested at arbitrary
+depths.
+
+A parameter may be either int, double, string or boolean valued.
+
+Parameters may be added as follows:
+
+  Parameters p(\"my_parameters\");
+  p.add(\"relative_tolerance\",  1e-15);
+  p.add(\"absolute_tolerance\",  1e-15);
+  p.add(\"gmres_restart\",       30);
+  p.add(\"monitor_convergence\", false);
+
+Parameters may be changed as follows:
+
+  p[\"gmres_restart\"] = 50;
+
+Parameter values may be retrieved as follows:
+
+  int gmres_restart = p[\"gmres_restart\"];
+
+Parameter sets may be nested as follows:
+
+  Parameters q(\"nested_parameters\");
+  p.add(q);
+
+Nested parameters may then be accessed by
+
+  p(\"nested_parameters\")[\"...\"]
+
+Parameters may be nested at arbitrary depths.
+
+Parameters may be parsed from the command-line as follows:
+
+  p.parse(argc, argv);
+
+Note: spaces in parameter keys are not allowed (to simplify
+usage from command-line).
+";
+
+%feature("docstring")  dolfin::Parameters::Parameters "
+**Overloaded versions**
+
+* Parameters\ (\"parameters\")
+
+  Create empty parameter set
+
+* Parameters\ (parameters)
+
+  Copy constructor
+";
+
+%feature("docstring")  dolfin::Parameters::name "
+Return name for parameter set
+";
+
+%feature("docstring")  dolfin::Parameters::rename "
+Rename parameter set
+";
+
+%feature("docstring")  dolfin::Parameters::clear "
+Clear parameter set
+";
+
+%feature("docstring")  dolfin::Parameters::add "
+**Overloaded versions**
+
+* add\ (key)
+
+  Add an unset parameter of type T. For example, to create a
+  unset parameter of type bool, do
+  parameters.add<bool>(\"my_setting\")
+
+* add\ (key, min, max)
+
+  Add an unset parameter of type T with allows parameters. For
+  example, to create a unset parameter of type bool, do
+  parameters.add<bool>(\"my_setting\")
+
+* add\ (key, valid_values)
+
+  Add an unset parameter of type T with allows parameters. For
+  example, to create a unset parameter of type bool, do
+  parameters.add<bool>(\"my_setting\")
+
+* add\ (key, value)
+
+  Add int-valued parameter
+
+* add\ (key, value, min_value, max_value)
+
+  Add int-valued parameter with given range
+
+* add\ (key, value)
+
+  Add double-valued parameter
+
+* add\ (key, value, min_value, max_value)
+
+  Add double-valued parameter with given range
+
+* add\ (key, value)
+
+  Add string-valued parameter
+
+* add\ (key, value)
+
+  Add string-valued parameter
+
+* add\ (key, value, range)
+
+  Add string-valued parameter with given range
+
+* add\ (key, value, range)
+
+  Add string-valued parameter with given range
+
+* add\ (key, value)
+
+  Add bool-valued parameter
+
+* add\ (parameters)
+
+  Add nested parameter set
+";
+
+%feature("docstring")  dolfin::Parameters::remove "
+Remove parameter or parameter set with given key
+";
+
+%feature("docstring")  dolfin::Parameters::parse "
+Parse parameters from command-line
+";
+
+%feature("docstring")  dolfin::Parameters::update "
+Update parameters with another set of parameters
+";
+
+%feature("docstring")  dolfin::Parameters::operator[] "
+**Overloaded versions**
+
+* operator[]\ (key)
+
+  Return parameter for given key
+
+* operator[]\ (key)
+
+  Return parameter for given key (const version)
+";
+
+%feature("docstring")  dolfin::Parameters::operator "
+**Overloaded versions**
+
+* operator\ (key)
+
+  Return nested parameter set for given key
+
+* operator\ (key)
+
+  Return nested parameter set for given key (const)
+";
+
+%feature("docstring")  dolfin::Parameters::operator= "
+Assignment operator
+";
+
+%feature("docstring")  dolfin::Parameters::has_key "
+Check if parameter set has key (parameter or nested parameter set)
+";
+
+%feature("docstring")  dolfin::Parameters::has_parameter "
+Check if parameter set has given parameter
+";
+
+%feature("docstring")  dolfin::Parameters::has_parameter_set "
+Check if parameter set has given nested parameter set
+";
+
+%feature("docstring")  dolfin::Parameters::get_parameter_keys "
+Return a vector of parameter keys
+";
+
+%feature("docstring")  dolfin::Parameters::get_parameter_set_keys "
+Return a vector of parameter set keys
+";
+
+%feature("docstring")  dolfin::Parameters::str "
+Return informal string representation (pretty-print)
+";
+
+%feature("docstring")  dolfin::Parameters::parse_common "
+Parse filtered options (everything except PETSc options)
+";
+
+%feature("docstring")  dolfin::Parameters::parse_petsc "
+Parse filtered options (only PETSc options)
+";
+
+// Documentation extracted from: (module=parameter, header=GlobalParameters.h)
+%feature("docstring")  dolfin::GlobalParameters "
+This class defines the global DOLFIN parameter database.
+";
+
+%feature("docstring")  dolfin::GlobalParameters::GlobalParameters "
+Constructor
+";
+
+%feature("docstring")  dolfin::GlobalParameters::parse "
+Parse parameters from command-line
+";
+
+%feature("docstring")  dolfin::GlobalParameters::default_parameters "
+Default parameter values
+";
+
diff --git a/dolfin/swig/parameter/post.i b/dolfin/swig/parameter/post.i
new file mode 100644
index 0000000..8356bc6
--- /dev/null
+++ b/dolfin/swig/parameter/post.i
@@ -0,0 +1,331 @@
+/* -*- C -*- */
+// Copyright (C) 2006-2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-05-12
+// Last changed: 2012-08-09
+//
+// ===========================================================================
+// SWIG directives for the DOLFIN parameter kernel module (post)
+//
+// The directives in this file are applied _after_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+// ---------------------------------------------------------------------------
+// Modifications of Parameter interface
+// ---------------------------------------------------------------------------
+%extend dolfin::Parameter
+{
+%pythoncode%{
+def warn_once(self, msg):
+    cls = self.__class__
+    if not hasattr(cls, '_warned'):
+        cls._warned = set()
+    if not msg in cls._warned:
+        cls._warned.add(msg)
+        print msg
+
+def value(self):
+    val_type = self.type_str()
+    if val_type == "string":
+        return str(self)
+    elif  val_type == "int":
+        return int(self)
+    elif val_type == "bool":
+        return bool(self)
+    elif val_type == "double":
+        return float(self)
+    else:
+        raise TypeError, "unknown value type '%s' of parameter '%s'"%(val_type, self.key())
+
+def get_range(self):
+    val_type = self.type_str()
+    if val_type == "string":
+        local_range = self._get_string_range()
+        if len(local_range) == 0:
+            return
+        return local_range
+    elif  val_type == "int":
+        local_range = self._get_int_range()
+        if local_range[0] == 0 and local_range[0] == local_range[0]:
+            return
+        return local_range
+    elif val_type == "bool":
+        return
+    elif val_type == "double":
+        from logging import DEBUG
+        local_range = self._get_double_range()
+        if local_range[0] == 0 and local_range[0] == local_range[0]:
+            return
+        return local_range
+    else:
+        raise TypeError, "unknown value type '%s' of parameter '%s'"%(val_type, self.key())
+
+def data(self):
+    return self.value(), self.get_range(), self.access_count(), self.change_count()
+%}
+
+}
+
+// ---------------------------------------------------------------------------
+// Modifications of Parameters interface
+// ---------------------------------------------------------------------------
+%feature("docstring") dolfin::Parameters::_parse "Missing docstring";
+%extend dolfin::Parameters
+{
+  void _parse(PyObject *op)
+  {
+    if (PyList_Check(op))
+    {
+      int i;
+      int argc = PyList_Size(op);
+      char **argv = (char **) malloc((argc+1)*sizeof(char *));
+      for (i = 0; i < argc; i++)
+      {
+        PyObject *o = PyList_GetItem(op,i);
+        if (PyString_Check(o))
+          argv[i] = PyString_AsString(o);
+        else
+        {
+          free(argv);
+          throw std::runtime_error("list must contain strings");
+        }
+      }
+      argv[i] = 0;
+      self->parse(argc, argv);
+      free(argv);
+    }
+    else
+     throw std::runtime_error("not a list");
+  }
+
+%pythoncode%{
+
+def add(self,*args):
+    """Add a parameter to the parameter set"""
+    if len(args) == 2 and isinstance(args[1],bool):
+        self._add_bool(*args)
+    else:
+        self._add(*args)
+
+def parse(self,argv=None):
+    "Parse command line arguments"
+    if argv is None:
+        import sys
+        argv = sys.argv
+    self._parse(argv)
+
+def keys(self):
+    "Returns a list of the parameter keys"
+    ret = self._get_parameter_keys()
+    ret += self._get_parameter_set_keys()
+    return ret
+
+def iterkeys(self):
+    "Returns an iterator for the parameter keys"
+    for key in self.keys():
+        yield key
+
+def __iter__(self):
+    return self.iterkeys()
+
+def values(self):
+    "Returns a list of the parameter values"
+    return [self[key] for key in self.keys()]
+
+def itervalues(self):
+    "Returns an iterator to the parameter values"
+    return (self[key] for key in self.keys())
+
+def items(self):
+    return zip(self.keys(),self.values())
+
+def iteritems(self):
+    "Returns an iterator over the (key, value) items of the Parameters"
+    for key, value in self.items():
+        yield key, value
+
+def set_range(self, key, *arg):
+    "Set the range for the given parameter"
+    if key not in self._get_parameter_keys():
+        raise KeyError, "no parameter with name '%s'"%key
+    self._get_parameter(key).set_range(*arg)
+
+def get_range(self, key):
+    "Get the range for the given parameter"
+    if key not in self._get_parameter_keys():
+        raise KeyError, "no parameter with name '%s'"%key
+    return self._get_parameter(key).get_range()
+
+def __getitem__(self, key):
+    "Return the parameter corresponding to the given key"
+    if key in self._get_parameter_keys():
+        return self._get_parameter(key).value()
+
+    if key in self._get_parameter_set_keys():
+        return self._get_parameter_set(key)
+
+    raise KeyError, "'%s'"%key
+
+def __setitem__(self, key, value):
+    "Set the parameter 'key', with given 'value'"
+    if key not in self._get_parameter_keys():
+        raise KeyError, "'%s' is not a parameter"%key
+    if not isinstance(value,(int,str,float,bool)):
+        raise TypeError, "can only set 'int', 'bool', 'float' and 'str' parameters"
+    par = self._get_parameter(key)
+    if isinstance(value,bool):
+        par._assign_bool(value)
+    else:
+        par._assign(value)
+
+def update(self, other):
+    "A recursive update that handles parameter subsets correctly."
+    if not isinstance(other,(Parameters, dict)):
+        raise TypeError, "expected a 'dict' or a '%s'"%Parameters.__name__
+    for key, other_value in other.iteritems():
+        self_value  = self[key]
+        if isinstance(self_value, Parameters):
+            self_value.update(other_value)
+        else:
+            setattr(self, key, other_value)
+
+def to_dict(self):
+    """Convert the Parameters to a dict"""
+    ret = {}
+    for key, value in self.iteritems():
+        if isinstance(value, Parameters):
+            ret[key] = value.to_dict()
+        else:
+            ret[key] = value
+    return ret
+
+def copy(self):
+    "Return a copy of it self"
+    return Parameters(self)
+
+def option_string(self):
+    "Return an option string representation of the Parameters"
+    def option_list(parent,basename):
+        ret_list = []
+        for key, value in parent.iteritems():
+            if isinstance(value, Parameters):
+                ret_list.extend(option_list(value,basename + key + '.'))
+            else:
+                ret_list.append(basename + key + " " + str(value))
+        return ret_list
+
+    return " ".join(option_list(self,"--"))
+
+def __str__(self):
+    "p.__str__() <==> str(x)"
+    return self.str(False)
+
+__getattr__ = __getitem__
+__setattr__ = __setitem__
+
+def iterdata(self):
+    """Returns an iterator of a tuple of a parameter key together with its value"""
+    for key in self.iterkeys():
+        yield key, self.get(key)
+
+def get(self, key):
+    """Return all data available for a certain parameter
+
+    The data is returned in a tuple:
+    value, range, access_count, change_count = parameters.get('name')
+    """
+    if key in self._get_parameter_keys():
+        return self._get_parameter(key).data()
+
+    if key in self._get_parameter_set_keys():
+        return self._get_parameter_set(key)
+
+    raise KeyError, "'%s'"%key
+
+%}
+
+}
+
+%pythoncode%{
+old_init = Parameters.__init__
+def __new_Parameter_init__(self,*args,**kwargs):
+    """Initialize Parameters
+
+    Usage:
+
+    Parameters()
+       create empty parameter set
+
+    Parameters(name)
+       create empty parameter set with given name
+
+    Parameters(other_parameters)
+       create copy of parameter set
+
+    Parameters(name, dim=3, tol=0.1, foo="Foo")
+       create parameter set with given parameters
+
+    Parameters(name, dim=(3, 0, 4), foo=("Foo", ["Foo", "Bar"])
+       create parameter set with given parameters and ranges
+    """
+
+    if len(args) == 0:
+        old_init(self, "parameters")
+    elif len(args) == 1 and isinstance(args[0], (str,type(self))):
+        old_init(self, args[0])
+    else:
+        raise TypeError, "expected a single optional argument of type 'str' or ''"%type(self).__name__
+    if len(kwargs) == 0:
+        return
+
+    from numpy import isscalar
+    for key, value in kwargs.iteritems():
+        if isinstance(value,type(self)):
+            self.add(value)
+        elif isinstance(value,tuple):
+            if isscalar(value[0]) and len(value) == 3:
+                self.add(key, *value)
+            elif isinstance(value[0], str) and len(value) == 2:
+                if not isinstance(value[1], list):
+                    raise TypeError, "expected a list as second item of tuple, when first is a 'str'"
+                self.add(key, *value)
+            else:
+                raise TypeError,"expected a range tuple of size 2 for 'str' values and 3 for scalars"
+        else:
+            self.add(key,value)
+
+Parameters.__init__ = __new_Parameter_init__
+
+%}
+
+// Expose the global variable parameters for the Python interface
+// NOTE: Because parameters are stored using shared_ptr we need to
+//       wrap the global parameters as a shared_ptr
+%fragment("NoDelete");
+%inline %{
+std::shared_ptr<dolfin::Parameters> get_global_parameters()
+ {
+   return std::shared_ptr<dolfin::Parameters>(dolfin::reference_to_no_delete_pointer(dolfin::parameters));
+ }
+%}
+
+%pythoncode%{
+parameters = _common.get_global_parameters()
+del _common.get_global_parameters
+%}
diff --git a/dolfin/swig/parameter/pre.i b/dolfin/swig/parameter/pre.i
new file mode 100644
index 0000000..ad1d04d
--- /dev/null
+++ b/dolfin/swig/parameter/pre.i
@@ -0,0 +1,161 @@
+/* -*- C -*- */
+// Copyright (C) 2006-2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-05-12
+// Last changed: 2009-10-12
+//
+// ===========================================================================
+// SWIG directives for the DOLFIN parameter kernel module (pre)
+//
+// The directives in this file are applied _before_ the header files of the
+// modules has been loaded.
+// ===========================================================================
+
+// ---------------------------------------------------------------------------
+// Renames and ignores for Parameter
+// For some obscure reason we need to rename Parameter
+// ---------------------------------------------------------------------------
+%rename (ParameterValue) dolfin::Parameter;
+%rename (__nonzero__) dolfin::Parameter::operator bool;
+%rename (__int__) dolfin::Parameter::operator int;
+%rename (__float__) dolfin::Parameter::operator double;
+%rename (__str__) dolfin::Parameter::operator std::string;
+%rename (_assign) dolfin::Parameter::operator=;
+%rename (_get_int_range) dolfin::Parameter::get_range(int& min_value, int& max_value) const;
+%rename (_get_double_range) dolfin::Parameter::get_range(double& min_value, double& max_value) const;
+%rename (_get_string_range) dolfin::Parameter::get_range(std::set<std::string>& range) const;
+%ignore dolfin::Parameter::operator std::size_t;
+
+// ---------------------------------------------------------------------------
+// Renames and ignores for Parameters
+// ---------------------------------------------------------------------------
+%rename (_assign_bool) dolfin::Parameter::operator= (bool value);
+%rename (_add) dolfin::Parameters::add;
+%rename (_add_bool) dolfin::Parameters::add(std::string key, bool value);
+%rename (_get_parameter_keys) dolfin::Parameters::get_parameter_keys;
+%rename (_get_parameter_set_keys) dolfin::Parameters::get_parameter_set_keys;
+%rename (_get_parameter_set) dolfin::Parameters::operator();
+%rename (_get_parameter) dolfin::Parameters::operator[];
+%rename (assign) dolfin::Parameters::operator=;
+%ignore dolfin::Parameters::parse;
+%ignore dolfin::Parameters::update;
+
+// ---------------------------------------------------------------------------
+// Typemaps (in) for std::set<std::string>
+// ---------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_STRING_ARRAY) std::set<std::string> {
+    $1 = PySequence_Check($input) ? 1 : 0;
+}
+
+%typemap(in) std::set<std::string> (std::set<std::string> tmp) {
+  int i;
+  if (!PyList_Check($input)) {
+    PyErr_SetString(PyExc_ValueError,"expected a list of 'str'");
+    return NULL;
+  }
+  int list_length = PyList_Size($input);
+  if (!list_length > 0){
+    PyErr_SetString(PyExc_ValueError,"expected a list with length > 0");
+    return NULL;
+  }
+  for (i = 0; i < list_length; i++) {
+    PyObject *o = PyList_GetItem($input,i);
+    if (PyString_Check(o)) {
+      tmp.insert(std::string(PyString_AsString(o)));
+    } else {
+      PyErr_SetString(PyExc_TypeError,"provide a list of strings");
+      return NULL;
+    }
+  }
+  $1 = tmp;
+}
+
+// ---------------------------------------------------------------------------
+// Typemaps (argout) for std::vector<std::string>&
+// ---------------------------------------------------------------------------
+%typemap(in, numinputs=0) std::vector<std::string>& keys (std::vector<std::string> tmp_vec){
+  $1 = &tmp_vec;
+}
+
+%typemap(argout) std::vector<std::string>& keys
+{
+  int size = $1->size();
+  PyObject* ret = PyList_New(size);
+  PyObject* tmp_Py_str = 0;
+  for (int i=0; i < size; i++)
+  {
+    tmp_Py_str = PyString_FromString((*$1)[i].c_str());
+    if (PyList_SetItem(ret,i,tmp_Py_str)<0)
+    {
+      PyErr_SetString(PyExc_ValueError,"something wrong happened when copying std::string to Python");
+      return NULL;
+    }
+  }
+  $result = ret;
+}
+
+// ---------------------------------------------------------------------------
+// Typemaps (argout) for int &min_value, int &max_value
+// ---------------------------------------------------------------------------
+%typemap(in, numinputs=0) (int &min_value, int &max_value) (int min_temp, int max_temp){
+  $1 = &min_temp; $2 = &max_temp;
+}
+
+%typemap(argout) (int &min_value, int &max_value)
+{
+  $result = Py_BuildValue("ii", *$1, *$2);
+}
+
+// ---------------------------------------------------------------------------
+// Typemaps (argout) for real &min_value, real &max_value
+// ---------------------------------------------------------------------------
+%typemap(in, numinputs=0) (double &min_value, double &max_value) ( double min_temp, double max_temp){
+  $1 = &min_temp; $2 = &max_temp;
+}
+
+%typemap(argout) (double &min_value, double &max_value)
+{
+  $result = Py_BuildValue("dd", *$1, *$2);
+}
+
+// ---------------------------------------------------------------------------
+// Typemaps (argout) for std::set<std::string>&
+// ---------------------------------------------------------------------------
+%typemap(in, numinputs=0) std::set<std::string>& range (std::set<std::string> tmp_set){
+  $1 = &tmp_set;
+}
+
+%typemap(argout) std::set<std::string>& range
+{
+  int size = $1->size();
+  PyObject* ret = PyList_New(size);
+  PyObject* tmp_Py_str = 0;
+  std::set<std::string>::iterator it;
+  int i = 0;
+  for ( it=$1->begin() ; it != $1->end(); it++ )
+  {
+    tmp_Py_str = PyString_FromString(it->c_str());
+    if (PyList_SetItem(ret, i, tmp_Py_str)<0)
+    {
+      PyErr_SetString(PyExc_ValueError,"something wrong happened when copying std::string to Python");
+      return NULL;
+    }
+    i++;
+  }
+  $result = ret;
+}
diff --git a/dolfin/swig/plot/docstrings.i b/dolfin/swig/plot/docstrings.i
new file mode 100644
index 0000000..944428f
--- /dev/null
+++ b/dolfin/swig/plot/docstrings.i
@@ -0,0 +1,232 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=plot, header=plot.h)
+%feature("docstring")  dolfin::interactive "
+Make the current plots interactive. If really is set, the interactive
+mode is entered even if 'Q' has been pressed.
+";
+
+%feature("docstring")  dolfin::plot "
+**Overloaded versions**
+
+* plot\ (Variable>, title=\"\", mode=\"auto\")
+
+  Plot variable (shared_ptr version)
+
+* plot\ (Variable&, parameters)
+
+  Plot variable (parameter version)
+
+* plot\ (Variable>, parameters)
+
+  Plot variable (parameter, shared_ptr version)
+
+* plot\ (expression, mesh, title=\"\", mode=\"auto\")
+
+  Plot expression
+
+* plot\ (expression, mesh, title=\"\", mode=\"auto\")
+
+  Plot expression (shared_ptr version)
+
+* plot\ (expression, mesh, parameters)
+
+  Plot expression (parameter version)
+
+* plot\ (expression, mesh, parameters)
+
+  Plot expression (parameter, shared_ptr version)
+";
+
+// Documentation extracted from: (module=plot, header=VTKPlotter.h)
+%feature("docstring")  dolfin::VTKPlotter "
+This class enables visualization of various DOLFIN entities.
+It supports visualization of meshes, functions, expressions, boundary
+conditions and mesh functions. It can plot data wrapped in classes
+conforming to the GenericVTKPlottable interface.
+The plotter has several parameters that the user can set and adjust to
+affect the appearance and behavior of the plot.
+
+A plotter can be created and used in the following way:
+
+  Mesh mesh = ...;
+  VTKPlotter plotter(mesh);
+  plotter.plot();
+
+Parameters can be adjusted at any time and will take effect on the next
+call to the plot() method. The following parameters exist:
+
+============== ============ ================ ====================================
+ Name           Value type   Default value              Description
+============== ============ ================ ====================================
+ mode            String        \"auto\"         For vector valued functions,
+                                              this parameter may be set to
+                                              \"glyphs\" or \"displacement\".
+                                              Scalars may be set to \"warp\" in
+                                              2D only. A value of \"color\" is
+                                              valid in all cases; for vectors,
+                                              the norms are used. See below for
+                                              a summary of default modes,
+                                              used when set to \"auto\".
+ interactive     Boolean     False            Enable/disable interactive mode
+                                              for the rendering window.
+                                              For repeated plots of the same
+                                              object (animated plots), this
+                                              parameter should be set to false.
+ wireframe       Boolean     True for         Enable/disable wireframe
+                             meshes, else     rendering of the object.
+                             false
+ title           String      Inherited        The title of the rendering
+                             from the         window
+                             name/label of
+                             the object
+ scale           Double      1.0              Adjusts the scaling of the
+                                              warping and glyphs
+ scalarbar       Boolean     False for        Hide/show the colormapping bar
+                             meshes, else
+                             true
+ axes            Boolean     False            Show X-Y-Z axes.
+
+ rescale         Boolean     True             Enable/disable recomputation
+                                              of the scalar to color mapping
+                                              on every iteration when performing
+                                              repeated/animated plots of the same
+                                              data. If both range_min and
+                                              range_max are set, this parameter
+                                              is ignored.
+ range_min       Double                       Set lower range of data values.
+                                              Disables automatic (re-)computation
+                                              of the lower range.
+ range_max       Double                       Set upper range of data values.
+                                              Disables automatic (re-)computation
+                                              of the upper range.
+ elevate         Double      -65.0 for 2D     Set camera elevation.
+                             warped scalars,
+                             0.0 otherwise
+ prefix          String      \"dolfin_plot_\"   Filename prefix used when
+                                              saving plots to file in
+                                              interactive mode. An integer
+                                              counter is appended after the
+                                              prefix.
+ helptext        Boolean     True             Enable/disable the hover-over
+                                              help-text in interactive
+                                              mode
+ window_width    Integer     600              The width of the plotting window
+                                              in pixels
+ window_height   Integer     400              The height of the plotting window
+                                              in pixels
+ tile_windows    Boolean     True             Automatically tile plot windows.
+
+ key             String                       Key (id) of the plot window, used to
+                                              decide if a new plotter should be
+                                              created or a current one updated
+                                              when called through the static
+                                              plot() interface (in plot.h).
+                                              If not set, the object's unique
+                                              id (Variable::id) is used.
+ input_keys      String      \"\"               Synthesize key presses, as if these
+                                              keys are pressed by the user in
+                                              the plot window.
+                                              For example: \"ww++m\" shows the data
+                                              as large points on a wireframe
+                                              mesh.
+ hide_above      Double                       If either of these are set, scalar
+ hide_below      Double                       values above or below will not be
+                                              shown in the plot.
+============== ============ ================ ====================================
+
+The default visualization mode for the different plot types are as follows:
+
+=========================  ============================ =====================
+ Plot type                  Default visualization mode   Alternatives
+=========================  ============================ =====================
+ Meshes                     Wireframe rendering          None
+ 2D scalar functions        Scalar warping               Color mapping
+ 3D scalar functions        Color mapping                None
+ 2D/3D vector functions     Glyphs (vector arrows)       Displacements,
+                                                         Color mapping (norm)
+=========================  ============================ =====================
+
+Expressions and boundary conditions are also visualized according to the
+above table.
+";
+
+%feature("docstring")  dolfin::VTKPlotter::VTKPlotter "
+**Overloaded versions**
+
+* VTKPlotter\ (Variable>, NULL)
+
+  Create plotter for a variable. If a widget is supplied, this widget
+  will be used for drawing, instead of a new top-level widget. Ownership
+  is transferred.
+
+* VTKPlotter\ (expression, mesh, NULL)
+
+  Create plotter for an Expression with associated Mesh. If a widget is
+  supplied, this widget will be used for drawing, instead of a new
+  top-level widget. Ownership is transferred.
+";
+
+%feature("docstring")  dolfin::VTKPlotter::default_parameters "
+Default parameter values
+";
+
+%feature("docstring")  dolfin::VTKPlotter::plot "
+Plot the object
+";
+
+%feature("docstring")  dolfin::VTKPlotter::interactive "
+Make the current plot interactive
+";
+
+%feature("docstring")  dolfin::VTKPlotter::write_png "
+Save plot to PNG file (file suffix appended automatically, filename
+optionally built from prefix)
+";
+
+%feature("docstring")  dolfin::VTKPlotter::write_pdf "
+Save plot to PDF file (file suffix appended automatically, filename
+optionally built from prefix)
+";
+
+%feature("docstring")  dolfin::VTKPlotter::key "
+Return key (i.e., plotter id) of the object to plot
+";
+
+%feature("docstring")  dolfin::VTKPlotter::set_key "
+Set the key (plotter id)
+";
+
+%feature("docstring")  dolfin::VTKPlotter::to_key "
+Return default key (plotter id) of a Variable (object to plot).
+";
+
+%feature("docstring")  dolfin::VTKPlotter::azimuth "
+Camera control
+";
+
+%feature("docstring")  dolfin::VTKPlotter::all_interactive "
+Make all plot windows interactive. If really is set, the interactive
+mode is entered even if 'Q' has been pressed.
+";
+
diff --git a/dolfin/swig/refinement/docstrings.i b/dolfin/swig/refinement/docstrings.i
new file mode 100644
index 0000000..e53bad8
--- /dev/null
+++ b/dolfin/swig/refinement/docstrings.i
@@ -0,0 +1,99 @@
+// Auto generated SWIG file for Python interface of DOLFIN
+//
+// Copyright (C) 2012 Kristian B. Oelgaard
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+
+// Autogenerated docstrings file, extracted from the DOLFIN source C++ files.
+
+// Documentation extracted from: (module=refinement, header=refine.h)
+%feature("docstring")  dolfin::refine "
+**Overloaded versions**
+
+* refine\ (mesh, true)
+
+  Create uniformly refined mesh
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to refine.
+      redistribute (_bool_)
+          Optional argument to redistribiute the refined mesh if mesh is a
+          distributed mesh.
+  
+  *Returns*
+      :py:class:`Mesh`
+          The refined mesh.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* refine\ (refined_mesh, mesh, true)
+
+  Create uniformly refined mesh
+  
+  *Arguments*
+      refined_mesh (:py:class:`Mesh`)
+          The mesh that will be the refined mesh.
+      mesh (:py:class:`Mesh`)
+          The original mesh.
+      redistribute (_bool_)
+          Optional argument to redistribiute the refined mesh if mesh is a
+          distributed mesh.
+
+* refine\ (mesh, cell_markers, true)
+
+  Create locally refined mesh
+  
+  *Arguments*
+      mesh (:py:class:`Mesh`)
+          The mesh to refine.
+      cell_markers (:py:class:`MeshFunction`)
+          A mesh function over booleans specifying which cells
+          that should be refined (and which should not).
+      redistribute (_bool_)
+          Optional argument to redistribiute the refined mesh if mesh is a
+          distributed mesh.
+  
+  *Returns*
+      :py:class:`Mesh`
+          The locally refined mesh.
+  
+  *Example*
+      .. note::
+      
+          No example code available for this function.
+
+* refine\ (refined_mesh, mesh, cell_markers, true)
+
+  Create locally refined mesh
+  
+  *Arguments*
+      refined_mesh (:py:class:`Mesh`)
+          The mesh that will be the refined mesh.
+      mesh (:py:class:`Mesh`)
+          The original mesh.
+      cell_markers (:py:class:`MeshFunction`)
+          A mesh function over booleans specifying which cells
+          that should be refined (and which should not).
+      redistribute (_bool_)
+          Optional argument to redistribiute the refined mesh if mesh is a
+          distributed mesh.
+";
+
diff --git a/dolfin/swig/shared_ptr_classes.i b/dolfin/swig/shared_ptr_classes.i
new file mode 100644
index 0000000..d51a473
--- /dev/null
+++ b/dolfin/swig/shared_ptr_classes.i
@@ -0,0 +1,268 @@
+/* -*- C -*- */
+// Copyright (C) 2007-2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Anders Logg, 2009.
+// Modified by Garth N. Wells, 2009-2012.
+// Modified by Fredrik Valdmanis, 2012.
+// Modified by Patrick E. Farrell, 2012.
+// Modified by Benjamin Kehlet, 2012.
+// Modified by Andre Massing, 2013.
+//
+// First added:  2007-11-25
+// Last changed: 2013-10-30
+
+//=============================================================================
+// SWIG directives for the shared_ptr stored classes in PyDOLFIN
+//
+// Objects of these classes can then be passed to c++ functions
+// demanding a std::shared_ptr<type>
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Include macros for shared_ptr support
+//-----------------------------------------------------------------------------
+%include <std_shared_ptr.i>
+
+//-----------------------------------------------------------------------------
+// Make DOLFIN aware of the types defined in UFC
+//-----------------------------------------------------------------------------
+%{
+#include <ufc.h>
+%}
+%include <swig/ufc_shared_ptr_classes.i>
+%import(module="ufc") "ufc.h"
+
+//-----------------------------------------------------------------------------
+// Declare shared_ptr stored types in PyDOLFIN
+//-----------------------------------------------------------------------------
+
+// adaptivity
+%shared_ptr(dolfin::AdaptiveLinearVariationalSolver)
+%shared_ptr(dolfin::AdaptiveNonlinearVariationalSolver)
+%shared_ptr(dolfin::ErrorControl)
+%shared_ptr(dolfin::Hierarchical<dolfin::ErrorControl>)
+%shared_ptr(dolfin::GenericAdaptiveVariationalSolver)
+%shared_ptr(dolfin::GoalFunctional)
+%shared_ptr(dolfin::SpecialFacetFunction)
+%shared_ptr(dolfin::TimeSeries)
+%shared_ptr(dolfin::TimeSeriesHDF5)
+
+// ale
+%shared_ptr(dolfin::MeshDisplacement)
+
+// common
+%shared_ptr(dolfin::Variable)
+
+// fem
+%shared_ptr(dolfin::Hierarchical<dolfin::Form>)
+%shared_ptr(dolfin::GenericDofMap)
+%shared_ptr(dolfin::DofMap)
+%shared_ptr(dolfin::CCFEMDofMap)
+%shared_ptr(dolfin::Form)
+%shared_ptr(dolfin::FiniteElement)
+%shared_ptr(dolfin::BasisFunction)
+%shared_ptr(dolfin::MultiStageScheme)
+
+%shared_ptr(dolfin::Hierarchical<dolfin::LinearVariationalProblem>)
+%shared_ptr(dolfin::Hierarchical<dolfin::NonlinearVariationalProblem>)
+%shared_ptr(dolfin::LinearVariationalProblem)
+%shared_ptr(dolfin::NonlinearVariationalProblem)
+%shared_ptr(dolfin::LinearVariationalSolver)
+%shared_ptr(dolfin::NonlinearVariationalSolver)
+%shared_ptr(dolfin::PointIntegralSolver)
+
+%shared_ptr(dolfin::Hierarchical<dolfin::DirichletBC>)
+%shared_ptr(dolfin::DirichletBC)
+
+// function
+%shared_ptr(dolfin::Hierarchical<dolfin::FunctionSpace>)
+%shared_ptr(dolfin::FunctionSpace)
+%shared_ptr(dolfin::SubSpace)
+
+%shared_ptr(dolfin::GenericFunction)
+%shared_ptr(dolfin::Hierarchical<dolfin::Function>)
+%shared_ptr(dolfin::Function)
+%shared_ptr(dolfin::Expression)
+%shared_ptr(dolfin::FacetArea)
+%shared_ptr(dolfin::Constant)
+%shared_ptr(dolfin::MeshCoordinates)
+
+// geometry
+%shared_ptr(dolfin::BoundingBoxTree)
+
+// mesh
+%shared_ptr(dolfin::Hierarchical<dolfin::Mesh>)
+%shared_ptr(dolfin::BoundaryMesh)
+%shared_ptr(dolfin::CircleMesh)
+%shared_ptr(dolfin::EllipseMesh)
+%shared_ptr(dolfin::EllipsoidMesh)
+%shared_ptr(dolfin::Mesh)
+%shared_ptr(dolfin::Restriction)
+%shared_ptr(dolfin::SphereMesh)
+%shared_ptr(dolfin::SubMesh)
+%shared_ptr(dolfin::UnitTetrahedronMesh)
+%shared_ptr(dolfin::UnitCubeMesh)
+%shared_ptr(dolfin::UnitIntervalMesh)
+%shared_ptr(dolfin::IntervalMesh)
+%shared_ptr(dolfin::UnitTriangleMesh)
+%shared_ptr(dolfin::UnitSquareMesh)
+%shared_ptr(dolfin::BoxMesh)
+%shared_ptr(dolfin::Box)
+%shared_ptr(dolfin::RectangleMesh)
+%shared_ptr(dolfin::Rectangle)
+
+ //csg
+%shared_ptr(dolfin::CSGGeometry)
+%shared_ptr(dolfin::CSGOperator)
+%shared_ptr(dolfin::CSGUnion)
+%shared_ptr(dolfin::CSGDifference)
+%shared_ptr(dolfin::CSGIntersection)
+%shared_ptr(dolfin::CSGPrimitive)
+%shared_ptr(dolfin::CSGPrimitive2D)
+%shared_ptr(dolfin::CSGPrimitive3D)
+%shared_ptr(dolfin::Circle)
+%shared_ptr(dolfin::Ellipse)
+%shared_ptr(dolfin::Polygon)
+%shared_ptr(dolfin::Sphere)
+%shared_ptr(dolfin::Cone)
+%shared_ptr(dolfin::Cylinder)
+%shared_ptr(dolfin::Tetrahedron)
+%shared_ptr(dolfin::Surface3D)
+%shared_ptr(dolfin::CSGCGALMeshGenerator2D)
+%shared_ptr(dolfin::CSGCGALMeshGenerator3D)
+
+%shared_ptr(dolfin::SubDomain)
+%shared_ptr(dolfin::DomainBoundary)
+
+// mesh
+%shared_ptr(dolfin::LocalMeshData)
+%shared_ptr(dolfin::MeshData)
+
+// NOTE: Most of the MeshFunctions are declared shared pointers in
+// NOTE: mesh/pre.i, mesh/post.i
+%shared_ptr(dolfin::Hierarchical<dolfin::MeshFunction<std::size_t> >)
+%shared_ptr(dolfin::MeshFunction<std::size_t>)
+
+%shared_ptr(dolfin::CellFunction<std::size_t>)
+%shared_ptr(dolfin::EdgeFunction<std::size_t>)
+%shared_ptr(dolfin::FaceFunction<std::size_t>)
+%shared_ptr(dolfin::FacetFunction<std::size_t>)
+%shared_ptr(dolfin::VertexFunction<std::size_t>)
+
+// parameters
+%shared_ptr(dolfin::Parameters)
+%shared_ptr(dolfin::GlobalParameters)
+
+// la
+%shared_ptr(dolfin::GenericLinearOperator)
+%shared_ptr(dolfin::GenericMatrix)
+%shared_ptr(dolfin::GenericPreconditioner)
+%shared_ptr(dolfin::GenericTensor)
+%shared_ptr(dolfin::GenericVector)
+%shared_ptr(dolfin::LinearAlgebraObject)
+%shared_ptr(dolfin::Scalar)
+
+%shared_ptr(dolfin::Matrix)
+%shared_ptr(dolfin::Vector)
+%shared_ptr(dolfin::LinearOperator)
+
+%shared_ptr(dolfin::STLMatrix)
+%shared_ptr(dolfin::uBLASMatrix<boost::numeric::ublas::matrix<double> >)
+%shared_ptr(dolfin::uBLASMatrix<boost::numeric::ublas::compressed_matrix<double,\
+            boost::numeric::ublas::row_major> >)
+%shared_ptr(dolfin::uBLASVector)
+
+#ifdef HAS_PETSC
+%shared_ptr(dolfin::PETScBaseMatrix)
+%shared_ptr(dolfin::PETScLinearOperator)
+%shared_ptr(dolfin::PETScKrylovSolver)
+%shared_ptr(dolfin::PETScLUSolver)
+%shared_ptr(dolfin::PETScMatrix)
+%shared_ptr(dolfin::PETScObject)
+%shared_ptr(dolfin::PETScPreconditioner)
+%shared_ptr(dolfin::PETScVector)
+%shared_ptr(dolfin::PETScUserPreconditioner)
+#endif
+
+#ifdef HAS_SLEPC
+%shared_ptr(dolfin::SLEPcEigenSolver)
+#endif
+
+#ifdef HAS_TRILINOS
+%shared_ptr(dolfin::EpetraKrylovSolver)
+%shared_ptr(dolfin::EpetraLUSolver)
+%shared_ptr(dolfin::EpetraMatrix)
+%shared_ptr(dolfin::EpetraSparsityPattern)
+%shared_ptr(dolfin::EpetraVector)
+%shared_ptr(dolfin::TrilinosPreconditioner)
+#endif
+
+#ifdef HAS_PASTIX
+%shared_ptr(dolfin::PaStiXLUSolver)
+#endif
+
+%shared_ptr(dolfin::UmfpackLUSolver)
+%shared_ptr(dolfin::CholmodCholeskySolver)
+
+%shared_ptr(dolfin::uBLASKrylovSolver)
+%shared_ptr(dolfin::uBLASLinearOperator)
+
+%shared_ptr(dolfin::LinearSolver)
+%shared_ptr(dolfin::GenericLinearSolver)
+%shared_ptr(dolfin::GenericLUSolver)
+%shared_ptr(dolfin::KrylovSolver)
+%shared_ptr(dolfin::LUSolver)
+
+%shared_ptr(dolfin::GenericSparsityPattern)
+%shared_ptr(dolfin::SparsityPattern)
+
+// log
+%shared_ptr(dolfin::Table)
+
+// io
+%shared_ptr(dolfin::GenericFile)
+%shared_ptr(dolfin::File)
+%shared_ptr(dolfin::XDMFFile)
+%shared_ptr(dolfin::HDF5File)
+
+// math
+%shared_ptr(dolfin::Lagrange)
+
+// nls
+%shared_ptr(dolfin::NewtonSolver)
+%shared_ptr(dolfin::PETScSNESSolver)
+#ifdef ENABLE_PETSC_TAO
+%shared_ptr(dolfin::TAOLinearBoundSolver)
+#endif
+// plot
+%shared_ptr(dolfin::VTKPlotter)
+%shared_ptr(dolfin::GenericVTKPlottable)
+%shared_ptr(dolfin::VTKPlottableMesh)
+%shared_ptr(dolfin::VTKPlottableGenericFunction)
+%shared_ptr(dolfin::VTKPlottableMeshFunction)
+%shared_ptr(dolfin::ExpressionWrapper)
+
+// quadrature
+%shared_ptr(dolfin::Quadrature)
+%shared_ptr(dolfin::LobattoQuadrature)
+%shared_ptr(dolfin::RadauQuadrature)
+%shared_ptr(dolfin::GaussQuadrature)
+%shared_ptr(dolfin::GaussianQuadrature)
+
+// geometry
+%shared_ptr(dolfin::MeshPointIntersection)
diff --git a/dolfin/swig/typemaps/array.i b/dolfin/swig/typemaps/array.i
new file mode 100644
index 0000000..6b6f793
--- /dev/null
+++ b/dolfin/swig/typemaps/array.i
@@ -0,0 +1,119 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-12-10
+// Last changed: 2011-06-15
+
+//=============================================================================
+// In this file we declare some typemaps for the dolfin::Array type
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Macro for defining an in-typemap for NumPy array -> dolfin::Array
+//
+// TYPE       : The primitive type
+// TYPECHECK  : The SWIG specific name of the type used in the array type checks values
+//              SWIG use: INT32 for integer, DOUBLE for double aso.
+// NUMPYTYPE  : The NumPy type that is going to be checked for
+// TYPE_NAME  : The name of the pointer type, 'double' for 'double', 'uint' for
+//              'unsigned int'
+// ARGNAME    : The name of the argument the typemap will kick in for pass nothing
+//              and the typemap will kick in for all argument names
+// CONSTARRAY : If the dolfin::Array is of type const, then pass const for this
+//              argument
+//-----------------------------------------------------------------------------
+%define IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(TYPE, TYPECHECK, NUMPYTYPE, TYPE_NAME, ARGNAME, CONSTARRAY)
+
+%typemap(in, fragment=convert_numpy_to_array_with_check(TYPE_NAME)) (CONSTARRAY dolfin::Array<TYPE> &ARGNAME) (std::size_t size, TYPE* data)
+{
+  if (!convert_numpy_to_array_with_check_ ## TYPE_NAME($input, size, data))
+    return NULL;
+  $1 = new dolfin::Array<TYPE>(size, data);
+}
+
+// Clean up the constructed Array
+%typemap(freearg) CONSTARRAY dolfin::Array<TYPE> & ARGNAME{
+  delete $1;
+}
+
+%typecheck(SWIG_TYPECHECK_ ## TYPECHECK ## _ARRAY) CONSTARRAY dolfin::Array<TYPE> & ARGNAME{
+    $1 = PyArray_Check($input) ? 1 : 0;
+}
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining an out-typemap for dolfin::Array -> NumPy array
+//
+// TYPE       : The primitive type
+// NUMPYTYPE  : The NumPy type that is going to be checked for
+//-----------------------------------------------------------------------------
+%define OUT_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(TYPE, NUMPYTYPE)
+
+%typemap(out) dolfin::Array<TYPE> {
+
+  // Create NumPy array
+  npy_intp size = (&$1)->size();
+  PyObject* op = PyArray_SimpleNew(1, &size, NUMPYTYPE);
+
+  if ( op == NULL )
+    SWIG_exception(SWIG_TypeError, "Error in conversion of dolfin::Array< TYPE > to NumPy array.");
+
+  // Get data
+  TYPE* data = reinterpret_cast<TYPE*>(PyArray_DATA(op));
+
+  // Set data from Array
+  for (int i = 0; i<(&$1)->size(); i++)
+    data[i] = (&$1)->operator[](i);
+
+  // Return the NumPy array
+  $result = op;
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Director typemaps for dolfin::Array
+//-----------------------------------------------------------------------------
+%typemap(directorin) const dolfin::Array<double>& {
+  $input = %make_numpy_array(1, double)($1_name.size(), $1_name.data(), false);
+ }
+
+%typemap(directorin) dolfin::Array<double>& {
+  $input = %make_numpy_array(1, double)($1_name.size(), $1_name.data(), true);
+ }
+
+//-----------------------------------------------------------------------------
+// Run the typemap macros
+//-----------------------------------------------------------------------------
+
+// Instantiate argument name specific typemaps for non const arguments
+IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(double, DOUBLE, NPY_DOUBLE, double, values, )
+IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(std::size_t, INT32, NPY_UINTP, size_t, indices,)
+IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(double, DOUBLE, NPY_DOUBLE, double, vertex_values, )
+IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(dolfin::la_index, INT32, NPY_UINTP, dolfin_index, indices,)
+
+// Instantiate argument name independent typemaps for all
+// const Array <{int, uint, double}>& arguments
+IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(double, DOUBLE, NPY_DOUBLE, double, , const)
+IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(std::size_t, INT32, NPY_UINTP, size_t, , const)
+IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(int, INT32, NPY_INT, int, , const)
+IN_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(dolfin::la_index, INT32, NPY_UINT, dolfin_index, , const)
+
+OUT_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(std::size_t, NPY_UINTP)
+OUT_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(int, NPY_INT)
+OUT_NUMPY_TYPEMAP_FOR_DOLFIN_ARRAY(double, NPY_DOUBLE)
diff --git a/dolfin/swig/typemaps/includes.i b/dolfin/swig/typemaps/includes.i
new file mode 100644
index 0000000..9443e54
--- /dev/null
+++ b/dolfin/swig/typemaps/includes.i
@@ -0,0 +1,32 @@
+// SWIG interface file for including all typemaps
+//
+// Copyright (C) 2012 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-01-18
+// Last changed: 2012-01-20
+
+//-----------------------------------------------------------------------------
+// Include all global typemap files
+//-----------------------------------------------------------------------------
+%include dolfin/swig/typemaps/primitives.i
+%include dolfin/swig/typemaps/std_pair.i
+%include dolfin/swig/typemaps/numpy.i
+%include dolfin/swig/typemaps/array.i
+%include dolfin/swig/typemaps/std_vector.i
+%include dolfin/swig/typemaps/std_set.i
+%include dolfin/swig/typemaps/std_map.i
diff --git a/dolfin/swig/typemaps/numpy.i b/dolfin/swig/typemaps/numpy.i
new file mode 100644
index 0000000..7705bda
--- /dev/null
+++ b/dolfin/swig/typemaps/numpy.i
@@ -0,0 +1,505 @@
+/* -*- C -*- */
+// Copyright (C) 2007-2009 Ola Skavhaug
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johan Hake, 2008-2009.
+// Modified by Anders logg, 2009.
+//
+// First added:  2007-12-16
+// Last changed: 2011-04-29
+
+//-----------------------------------------------------------------------------
+// Function to set the base of an NumPy array object
+//-----------------------------------------------------------------------------
+%inline%{
+PyObject* _attach_base_to_numpy_array(PyObject* obj, PyObject* owner)
+{
+  if (owner == NULL)
+  {
+    PyErr_SetString(PyExc_TypeError, "Expected a Python object as owner argument");
+    return NULL;
+  }
+
+  PyArrayObject* array = reinterpret_cast<PyArrayObject*>(obj);
+  if (array == NULL)
+  {
+    PyErr_SetString(PyExc_TypeError, "NumPy conversion error");
+    return NULL;
+  }
+
+  // Bump the references
+  Py_XINCREF(owner);
+  Py_XINCREF(Py_None);
+
+  // Assign the base
+#if NUMPY_VERSION_MINOR >= 7
+  PyArray_SetBaseObject(array, owner);
+#else
+  PyArray_BASE(array) = owner;
+#endif
+
+  return Py_None;
+}
+%}
+
+//-----------------------------------------------------------------------------
+// Help defines for using the generated numpy array wrappers
+//-----------------------------------------------------------------------------
+#define %make_numpy_array(dim, type_name) make_ ## dim ## d_numpy_array_ ## type_name
+#define make_numpy_array_frag(dim, type_name) "make_" %str(dim) "d_numpy_array_" %str(type_name)
+
+//-----------------------------------------------------------------------------
+// A fragment function which takes a PyArray as a PyObject, check conversion and
+// set the writable flags
+//-----------------------------------------------------------------------------
+%fragment("return_py_array", "header") {
+SWIGINTERNINLINE PyObject* return_py_array(PyObject* obj, bool writable)
+{
+  PyArrayObject* array = reinterpret_cast<PyArrayObject*>(obj);
+  if ( obj == NULL )
+  {
+    PyErr_SetString(PyExc_TypeError, "NumPy conversion error");
+    return NULL;
+  }
+
+  // Set writable flag on numpy array
+  if ( !writable )
+  {
+    // Get flag
+#if NUMPY_VERSION_MINOR >= 7
+    PyArray_CLEARFLAGS(array, NPY_ARRAY_WRITEABLE);
+#else
+    array->flags &= ~NPY_WRITEABLE;
+#endif
+  }
+  return reinterpret_cast<PyObject*>(array);
+}
+}
+
+//-----------------------------------------------------------------------------
+// Macro for generating fragments to constructing NumPys array from data ponters
+// The macro generates two functions, one for 1D and one for 2D arrays
+//
+// TYPE       : The pointer type
+// NUMPY_TYPE : The NumPy type that is going to be checked for
+// TYPE_NAME  : The name of the pointer type, 'double' for 'double', 'uint' for
+//              'dolfin::uint', size_t for std::size_t
+//
+// Note that each invocation of this macro two functions will be inlined in
+// the SWIG layer:
+//
+//    1) make_1d_numpy_array_{TYPE_NAME}
+//    2) make_2d_numpy_array_{TYPE_NAME}
+//
+// Here TYPE_NAME is used to name the generated C++ function.
+//-----------------------------------------------------------------------------
+%define NUMPY_ARRAY_FRAGMENTS(TYPE, NUMPY_TYPE, TYPE_NAME)
+%fragment(make_numpy_array_frag(2, TYPE_NAME), "header",
+	  fragment="return_py_array") {
+SWIGINTERNINLINE PyObject* %make_numpy_array(2, TYPE_NAME)
+  (int m, int n, const TYPE* dataptr, bool writable = true)
+{
+  npy_intp adims[2] = {m, n};
+  return return_py_array(PyArray_SimpleNewFromData(2, adims, NUMPY_TYPE,
+						   (char *)(dataptr)), writable);
+}}
+
+%fragment(make_numpy_array_frag(1, TYPE_NAME), "header",
+	  fragment="return_py_array") {
+SWIGINTERNINLINE PyObject* %make_numpy_array(1, TYPE_NAME)
+  (int m, const TYPE* dataptr, bool writable = true)
+{
+  npy_intp adims[1] = {m};
+  return return_py_array(PyArray_SimpleNewFromData(1, adims, NUMPY_TYPE,
+						   (char *)(dataptr)), writable);
+}}
+
+// Force the fragments to be instantiated
+%fragment(make_numpy_array_frag(1, TYPE_NAME));
+%fragment(make_numpy_array_frag(2, TYPE_NAME));
+
+%enddef
+
+// The below fragments are created manually to dynamically handle the type of
+// dolfin::la_index, which can be a 32 bit or a 64 bit integer.
+%fragment(make_numpy_array_frag(2, dolfin_index), "header",
+	  fragment="return_py_array") {
+SWIGINTERNINLINE PyObject* %make_numpy_array(2, dolfin_index)
+  (int m, int n, const dolfin::la_index* dataptr, bool writable = true)
+{
+  npy_intp adims[2] = {m, n};
+  if (sizeof(dolfin::la_index) == 4)
+  {
+    return return_py_array(PyArray_SimpleNewFromData(2, adims, NPY_INT32,
+                                                     (char *)(dataptr)), writable);
+  }
+  else if (sizeof(dolfin::la_index) == 8)
+  {
+    return return_py_array(PyArray_SimpleNewFromData(2, adims, NPY_INT64,
+                                                     (char *)(dataptr)), writable);
+  }
+  else
+    throw std::runtime_error("sizeof(dolfin::la_index) incompatible NumPy types");
+}}
+
+%fragment(make_numpy_array_frag(1, dolfin_index), "header",
+	  fragment="return_py_array") {
+SWIGINTERNINLINE PyObject* %make_numpy_array(1, dolfin_index)
+  (int m, const dolfin::la_index* dataptr, bool writable = true)
+{
+  npy_intp adims[1] = {m};
+  if (sizeof(dolfin::la_index) == 4)
+  {
+    return return_py_array(PyArray_SimpleNewFromData(1, adims, NPY_INT32,
+                                                     (char *)(dataptr)), writable);
+  }
+  else if (sizeof(dolfin::la_index) == 8)
+  {
+    return return_py_array(PyArray_SimpleNewFromData(1, adims, NPY_INT64,
+                                                     (char *)(dataptr)), writable);
+  }
+  else
+    throw std::runtime_error("sizeof(dolfin::la_index) incompatible NumPy types");
+}}
+
+// Force the fragments to be instantiated
+%fragment(make_numpy_array_frag(1, dolfin_index));
+%fragment(make_numpy_array_frag(2, dolfin_index));
+
+//-----------------------------------------------------------------------------
+// Macro for defining an unsafe in-typemap for NumPy arrays -> c arrays
+//
+// The typmaps defined by this macro just passes the pointer to the C array,
+// contained in the NumPy array to the function. The knowledge of the length
+// of the incomming array is not used.
+//
+// TYPE       : The pointer type
+// TYPE_UPPER : The SWIG specific name of the type used in the array type checks values
+//              SWIG use: INT32 for integer, DOUBLE for double aso.
+// NUMPY_TYPE : The NumPy type that is going to be checked for
+// TYPE_NAME  : The name of the pointer type, 'double' for 'double', 'uint' for
+//              'dolfin::uint'
+// DESCR      : The char descriptor of the NumPy type
+//-----------------------------------------------------------------------------
+
+#define convert_numpy_to_array_no_check(Type) "convert_numpy_to_array_no_check_" {Type}
+
+%define UNSAFE_NUMPY_TYPEMAPS(TYPE,TYPE_UPPER,NUMPY_TYPE,TYPE_NAME,DESCR)
+
+%fragment(convert_numpy_to_array_no_check(TYPE_NAME), "header") {
+//-----------------------------------------------------------------------------
+// Typemap function (Reducing wrapper code size)
+//-----------------------------------------------------------------------------
+SWIGINTERN bool convert_numpy_to_array_no_check_ ## TYPE_NAME(PyObject* input, TYPE*& ret)
+{
+  if (PyArray_Check(input))
+  {
+    PyArrayObject *xa = reinterpret_cast<PyArrayObject*>(input);
+    if (PyArray_ISCONTIGUOUS(xa) && PyArray_TYPE(xa) == NUMPY_TYPE)
+    {
+      ret  = static_cast<TYPE*>(PyArray_DATA(xa));
+      return true;
+    }
+  }
+  PyErr_SetString(PyExc_TypeError,"contiguous numpy array of 'TYPE_NAME' expected. Make sure that the numpy array is contiguous, and uses dtype=DESCR.");
+  return false;
+}
+}
+
+//-----------------------------------------------------------------------------
+// The typecheck
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_ ## TYPE_UPPER ## _ARRAY) TYPE *
+{
+    $1 = PyArray_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// The typemap
+//-----------------------------------------------------------------------------
+%typemap(in, fragment=convert_numpy_to_array_no_check(TYPE_NAME)) TYPE *
+{
+if (!convert_numpy_to_array_no_check_ ## TYPE_NAME($input,$1))
+    return NULL;
+}
+
+//-----------------------------------------------------------------------------
+// Apply the typemap on the TYPE* _array argument
+//-----------------------------------------------------------------------------
+%apply TYPE* {TYPE* _array}
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining an safe in-typemap for NumPy arrays -> c arrays
+//
+// Type       : The pointer type
+// TYPE_UPPER : The SWIG specific name of the type used in the array type checks values
+//              SWIG use: INT32 for integer, DOUBLE for double aso.
+// NUMPY_TYPE : The NumPy type that is going to be checked for
+// TYPE_NAME  : The name of the pointer type, 'double' for 'double', 'size_t' for
+//              'std::size_t'
+// DESCR      : The char descriptor of the NumPy type
+//-----------------------------------------------------------------------------
+#define convert_numpy_to_array_with_check(Type) "convert_numpy_to_array_with_check_" {Type}
+%define SAFE_NUMPY_TYPEMAPS(TYPE,TYPE_UPPER,NUMPY_TYPE,TYPE_NAME,DESCR)
+
+%fragment(convert_numpy_to_array_with_check(TYPE_NAME), "header") {
+//-----------------------------------------------------------------------------
+// Typemap function (Reducing wrapper code size)
+//-----------------------------------------------------------------------------
+SWIGINTERN bool convert_numpy_to_array_with_check_ ## TYPE_NAME(PyObject* input, std::size_t& _array_dim, TYPE*& _array)
+{
+  if (PyArray_Check(input))
+  {
+    PyArrayObject *xa = reinterpret_cast<PyArrayObject*>(input);
+    if (PyArray_ISCONTIGUOUS(xa) && (PyArray_TYPE(xa) == NUMPY_TYPE) &&
+          (PyArray_NDIM(xa)==1))
+    {
+      _array  = static_cast<TYPE*>(PyArray_DATA(xa));
+      _array_dim = static_cast<unsigned int>(PyArray_DIM(xa,0));
+      return true;
+    }
+  }
+  PyErr_SetString(PyExc_TypeError,"contiguous numpy array of 'TYPE_NAME' expected. Make sure that the numpy array is contiguous, with 1 dimension, and uses dtype=DESCR.");
+  return false;
+}
+}
+
+//-----------------------------------------------------------------------------
+// The typecheck
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_ ## TYPE_UPPER ## _ARRAY) (std::size_t _array_dim, TYPE* _array)
+{
+  $1 = PyArray_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// The typemap
+//-----------------------------------------------------------------------------
+%typemap(in, fragment=convert_numpy_to_array_with_check(TYPE_NAME)) \
+  (std::size_t _array_dim, TYPE* _array)
+{
+  if (!convert_numpy_to_array_with_check_ ## TYPE_NAME($input,$1,$2))
+    return NULL;
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Run the different macros and instantiate the typemaps
+// NOTE: If a typemap is not used an error will be issued as the generated
+//       typemap function will not be used
+//-----------------------------------------------------------------------------
+
+#if (DOLFIN_SIZE_T==4)
+UNSAFE_NUMPY_TYPEMAPS(std::size_t, INT32, NPY_UINTP, size_t, uintp)
+#else
+UNSAFE_NUMPY_TYPEMAPS(std::size_t, INT64, NPY_UINTP, size_t, uintp)
+#endif
+UNSAFE_NUMPY_TYPEMAPS(double,DOUBLE,NPY_DOUBLE,double,float_)
+UNSAFE_NUMPY_TYPEMAPS(dolfin::la_index,INT32,NPY_UINT,dolfin_index,intc)
+//UNSAFE_NUMPY_TYPEMAPS(int,INT,NPY_INT,int,cint)
+
+#if (DOLFIN_SIZE_T==4)
+SAFE_NUMPY_TYPEMAPS(std::size_t,INT32,NPY_UINTP,size_t,uintp)
+#else
+SAFE_NUMPY_TYPEMAPS(std::size_t,INT64,NPY_UINTP,size_t,uintp)
+#endif
+SAFE_NUMPY_TYPEMAPS(dolfin::la_index,INT32,NPY_INT,dolfin_index,intc)
+SAFE_NUMPY_TYPEMAPS(double,DOUBLE,NPY_DOUBLE,double,float_)
+SAFE_NUMPY_TYPEMAPS(int,INT32,NPY_INT,int,cint)
+
+// Instantiate the code used by the make_numpy_array macro.
+// The first argument name the C++ type, the second the corresponding
+// NumPy type and the third argument a shorthand name for the C++ type
+// to identify the correct function
+NUMPY_ARRAY_FRAGMENTS(unsigned int, NPY_UINT, uint)
+NUMPY_ARRAY_FRAGMENTS(double, NPY_DOUBLE, double)
+NUMPY_ARRAY_FRAGMENTS(int, NPY_INT, int)
+NUMPY_ARRAY_FRAGMENTS(bool, NPY_BOOL, bool)
+NUMPY_ARRAY_FRAGMENTS(std::size_t, NPY_UINTP, size_t)
+
+ //NUMPY_ARRAY_FRAGMENTS(dolfin::la_index, NPY_INT, dolfin_index)
+ //NUMPY_ARRAY_FRAGMENTS(dolfin::la_index, NPY_INT64, dolfin_index)
+
+//-----------------------------------------------------------------------------
+// Typecheck for function expecting two-dimensional NumPy arrays of double
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY) (int _array_dim_0, int _array_dim_1, double* _array)
+{
+    $1 = PyArray_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// Generic typemap to expand a two-dimensional NumPy arrays into three
+// C++ arguments: _array_dim_0, _array_dim_1, _array
+//-----------------------------------------------------------------------------
+%typemap(in) (int _array_dim_0, int _array_dim_1, double* _array)
+{
+  if (PyArray_Check($input))
+  {
+    PyArrayObject *xa = reinterpret_cast<PyArrayObject*>($input);
+    if ( PyArray_TYPE(xa) == NPY_DOUBLE )
+    {
+      if ( PyArray_NDIM(xa) == 2 )
+      {
+        $1 = PyArray_DIM(xa,0);
+        $2 = PyArray_DIM(xa,1);
+        $3  = static_cast<double*>(PyArray_DATA(xa));
+      }
+      else
+      {
+        SWIG_exception(SWIG_ValueError, "2d Array expected");
+      }
+    }
+    else
+    {
+      SWIG_exception(SWIG_TypeError, "Array of doubles expected");
+    }
+  }
+  else
+  {
+    SWIG_exception(SWIG_TypeError, "Array expected");
+  }
+}
+
+//-----------------------------------------------------------------------------
+// Typecheck for function expecting two-dimensional NumPy arrays of int
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY) (int _array_dim_0, int _array_dim_1, int* _array)
+{
+    $1 = PyArray_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// Generic typemap to expand a two-dimensional NumPy arrays into three
+// C++ arguments: _array_dim_0, _array_dim_1, _array
+//-----------------------------------------------------------------------------
+%typemap(in) (int _array_dim_0, int _array_dim_1, int* _array)
+{
+    if PyArray_Check($input) {
+        PyArrayObject *xa = reinterpret_cast<PyArrayObject*>($input);
+        if ( PyArray_TYPE(xa) == NPY_INT ) {
+            if ( PyArray_NDIM(xa) == 2 ) {
+                $1 = PyArray_DIM(xa,0);
+                $2 = PyArray_DIM(xa,1);
+                $3  = static_cast<int*>(PyArray_DATA(xa));
+            } else {
+                SWIG_exception(SWIG_ValueError, "2d Array expected");
+            }
+        } else {
+            SWIG_exception(SWIG_TypeError, "Array of integers expected");
+        }
+    } else {
+        SWIG_exception(SWIG_TypeError, "Array expected");
+    }
+}
+
+//-----------------------------------------------------------------------------
+// Cleaner of temporary data when passing 2D NumPy arrays to C++ functions
+// expecting double **
+//-----------------------------------------------------------------------------
+%{
+namespace __private {
+  class DppDeleter {
+  public:
+    double** amat;
+    DppDeleter () {amat = 0;}
+    ~DppDeleter ()
+    {
+      delete[] amat;
+      //free(amat);
+      amat = 0;
+    }
+  };
+}
+%}
+
+//-----------------------------------------------------------------------------
+// Typemap for 2D NumPy arrays to C++ functions expecting double **
+//-----------------------------------------------------------------------------
+%typemap(in) double**
+{
+    if PyArray_Check($input) {
+        PyArrayObject *xa = reinterpret_cast<PyArrayObject*>($input);
+        if ( PyArray_TYPE(xa) == NPY_DOUBLE ) {
+            if ( PyArray_NDIM(xa) == 2 ) {
+	        const int m = PyArray_DIM(xa,0);
+	        const int n = PyArray_DIM(xa,1);
+                $1 = new double*[m];
+                double *data = reinterpret_cast<double*>((*xa).data);
+                for (int i=0;i<m;++i)
+                    $1[i] = &data[i*n];
+            } else {
+                SWIG_exception(SWIG_ValueError, "2d Array expected");
+            }
+        } else {
+            SWIG_exception(SWIG_TypeError, "Array of doubles expected");
+        }
+    } else {
+        SWIG_exception(SWIG_TypeError, "Array expected");
+    }
+}
+
+//-----------------------------------------------------------------------------
+// Delete temporary data
+//-----------------------------------------------------------------------------
+%typemap(freearg) double**
+{
+  delete[] $1;
+}
+
+//-----------------------------------------------------------------------------
+// Typemap for 2D NumPy arrays to C++ functions expecting double **
+//-----------------------------------------------------------------------------
+%typemap(in) (int _matrix_dim_0, int _matrix_dim_1, double** _matrix) (__private::DppDeleter tmp)
+{
+  if PyArray_Check($input)
+  {
+    PyArrayObject *xa = reinterpret_cast<PyArrayObject *>($input);
+    if ( PyArray_TYPE(xa) == NPY_DOUBLE )
+    {
+      if ( PyArray_NDIM(xa) == 2 )
+      {
+        int n = PyArray_DIM(xa,0);
+        int m = PyArray_DIM(xa,1);
+        $1 = n;
+        $2 = m;
+        double **amat = static_cast<double **>(malloc(n*sizeof*amat));
+        double *data = reinterpret_cast<double *>(PyArray_DATA(xa));
+        for (int i=0;i<n;++i)
+            amat[i] = data + i*n;
+        $3 = amat;
+        tmp.amat = amat;
+      }
+      else
+      {
+        SWIG_exception(SWIG_ValueError, "2d Array expected");
+      }
+    }
+    else
+    {
+      SWIG_exception(SWIG_TypeError, "Array of doubles expected");
+    }
+  }
+  else
+  {
+    SWIG_exception(SWIG_TypeError, "Array expected");
+  }
+}
+
+// vim:ft=cpp:
diff --git a/dolfin/swig/typemaps/primitives.i b/dolfin/swig/typemaps/primitives.i
new file mode 100644
index 0000000..36775bb
--- /dev/null
+++ b/dolfin/swig/typemaps/primitives.i
@@ -0,0 +1,337 @@
+/* -*- C -*- */
+// Copyright (C) 2007-2009 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Ola Skavhaug, 2007-2009.
+// Modified by Garth N. Wells, 2007.
+// Modified by Johan Hake, 2008-2011.
+//
+// First added:  2006-04-16
+// Last changed: 2013-05-28
+
+//=============================================================================
+// General typemaps for PyDOLFIN
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Fragment for bool (after SWIG 3.0)
+// Allow Python bool, scalar numpy booleans and 1 sized boolean arrays
+//-----------------------------------------------------------------------------
+%fragment(SWIG_AsVal_frag(bool2),"header",
+	  fragment=SWIG_AsVal_frag(long)) {
+SWIGINTERN int
+SWIG_AsVal_dec(bool2)(PyObject *obj, bool *val)
+{
+  int r;
+  if (!(PyBool_Check(obj)||PyArray_IsScalar(obj, Bool)||(PyArray_Check(obj)&&PyArray_SIZE(reinterpret_cast<PyArrayObject*>(obj))==1)&&PyArray_TYPE(reinterpret_cast<PyArrayObject*>(obj))==NPY_BOOL))
+    return SWIG_ERROR;
+  r = PyObject_IsTrue(obj);
+  if (r == -1)
+    return SWIG_ERROR;
+  if (val) *val = r ? true : false;
+  return SWIG_OK;
+}
+}
+
+// Include limit header
+%fragment("limits_header", "header") 
+{
+  // Include the limits header
+  %#include <limits>
+}
+
+// Make sure Python int from std::size_t can be constructed
+// It looks like SWIG_From_size_t is available but not SWIG_From_std_size_t
+%fragment("SWIG_From_std_size_t", "header", fragment=SWIG_From_frag(size_t), 
+	  fragment="limits_header")
+{
+  SWIGINTERNINLINE PyObject * SWIG_From_std_size_t(std::size_t value)
+  {
+    return SWIG_From_unsigned_SS_long (static_cast< unsigned long >(value));
+    return PyInt_FromSize_t(value);
+  }
+}
+
+// Make sure Python int from dolfin::la_index can be constructed
+%fragment("SWIG_From_dolfin_la_index", "header")
+{
+  SWIGINTERNINLINE PyObject * SWIG_From_dolfin_la_index(dolfin::la_index value)
+  {
+    return SWIG_From_unsigned_SS_long (static_cast< unsigned long >(value));
+    return PyInt_FromSize_t(static_cast<std::size_t>(value));
+  }
+}
+
+//-----------------------------------------------------------------------------
+// A home brewed type check for checking integers
+// Needed due to problems with PyInt_Check from python 2.6 and NumPy
+//-----------------------------------------------------------------------------
+%fragment("PyInteger_Check", "header")
+{
+// Homebrewed Integer enmerate
+typedef enum {
+  _NO_PYTHON_INTEGER_TYPE=-1,
+  _INT_PYTHON_INTEGER_TYPE,
+  _LONG_PYTHON_INTEGER_TYPE,
+  _NPY_PYTHON_INTEGER_TYPE
+} PYTHON_INTEGER_TYPES;
+
+SWIGINTERNINLINE PYTHON_INTEGER_TYPES PyInteger_Check(PyObject* in)
+{
+  if (PyInt_Check(in))
+    return _INT_PYTHON_INTEGER_TYPE;
+  if (PyLong_Check(in))
+    return _LONG_PYTHON_INTEGER_TYPE;
+  if (PyArray_CheckScalar(in) && PyArray_IsScalar(in,Integer))
+    return _NPY_PYTHON_INTEGER_TYPE;
+  
+  // No integer type
+  return _NO_PYTHON_INTEGER_TYPE;
+}
+}
+
+//-----------------------------------------------------------------------------
+// Home brewed versions of the SWIG provided SWIG_AsVal(Type). These are needed
+// as long as we need the PyInteger_Check. Whenever Python 2.6 is not supported
+// we can scrap them.
+//-----------------------------------------------------------------------------
+#define Py_convert_frag(Type) "Py_convert_" {Type}
+
+%fragment("Py_convert_std_size_t", "header", fragment="PyInteger_Check")
+{
+
+SWIGINTERNINLINE bool Py_convert_std_size_t(PyObject* in, std::size_t& value)
+{
+  
+  // Get integer type
+  PYTHON_INTEGER_TYPES int_type = PyInteger_Check(in);
+
+  // No integer type?
+  if (int_type == _NO_PYTHON_INTEGER_TYPE)
+  {
+    return false;
+  }
+
+  // Conversion if python int or numpy type
+  if (int_type == _INT_PYTHON_INTEGER_TYPE || int_type == _NPY_PYTHON_INTEGER_TYPE)
+  {
+    const long signed_value = PyInt_AS_LONG(in);
+    value = static_cast<std::size_t>(signed_value);
+    return signed_value>=0;
+  }
+  
+  // Conversion if python long
+  if (int_type == _LONG_PYTHON_INTEGER_TYPE)
+  {
+    const npy_longlong signed_value = PyLong_AsLong(in);
+    value = static_cast<std::size_t>(signed_value);
+    return signed_value>=0;
+  }
+  
+  // Should never reach this point
+  return false;
+}
+}
+
+%fragment("Py_convert_double", "header") {
+  // A check for float and converter for double
+  SWIGINTERNINLINE bool Py_convert_double(PyObject* in, double& value)
+  {
+    return SWIG_AsVal(double)(in, &value);
+  }
+}
+
+%fragment("Py_convert_int", "header", fragment="PyInteger_Check") {
+  // A check for int and converter for int
+SWIGINTERNINLINE bool Py_convert_int(PyObject* in, int& value)
+{
+  
+  // Get integer type
+  PYTHON_INTEGER_TYPES int_type = PyInteger_Check(in);
+
+  // No integer type?
+  if (int_type == _NO_PYTHON_INTEGER_TYPE)
+  {
+    return false;
+  }
+
+  // Conversion if python int or numpy type
+  if (int_type == _INT_PYTHON_INTEGER_TYPE || int_type == _NPY_PYTHON_INTEGER_TYPE)
+  {
+    value = static_cast<int>(PyInt_AsLong(in));
+    return true;
+  }
+  
+  // Conversion if python long
+  if (int_type == _LONG_PYTHON_INTEGER_TYPE)
+  {
+    long long_value = PyLong_AsLong(in);
+    value = static_cast<int>(long_value);
+    return true;
+  }
+  
+  // Should never reach this point
+  return false;
+}
+
+}
+
+%fragment("Py_convert_uint", "header", fragment="PyInteger_Check") {
+  // A check for int and converter to uint
+  SWIGINTERNINLINE bool Py_convert_uint(PyObject* in, unsigned int& value)
+{
+  
+  // Get integer type
+  PYTHON_INTEGER_TYPES int_type = PyInteger_Check(in);
+
+  // No integer type?
+  if (int_type == _NO_PYTHON_INTEGER_TYPE)
+  {
+    return false;
+  }
+
+  // Conversion if python int or numpy int
+  if (int_type == _INT_PYTHON_INTEGER_TYPE || int_type == _NPY_PYTHON_INTEGER_TYPE)
+  {
+    const long signed_value = PyInt_AS_LONG(in);
+    value = static_cast<unsigned int>(signed_value);
+    return signed_value>=0;
+  }
+  
+  // Conversion if python long
+  if (int_type == _LONG_PYTHON_INTEGER_TYPE)
+  {
+    const npy_longlong signed_value = PyLong_AsLong(in);
+    value = static_cast<unsigned int>(signed_value);
+    return signed_value>=0;
+  }
+  
+  // Should never reach this point
+  return false;
+}
+}
+
+//-----------------------------------------------------------------------------
+// Typemaps for unsigned int and int
+//-----------------------------------------------------------------------------
+
+//-----------------------------------------------------------------------------
+// Out typemap (unsigned int)
+//-----------------------------------------------------------------------------
+%typemap(out, fragment=SWIG_From_frag(unsigned int)) unsigned int
+{
+  // Typemap unsigned int
+  $result = PyInt_FromLong(static_cast<long>($1));
+  // NOTE: From SWIG 2.0.5 does this macro return a Python long,
+  // NOTE: which we do not want
+  // NOTE: Fixed in 2.0.7, but keep the above fix for now
+  // $result = SWIG_From(unsigned int)($1);
+}
+
+//-----------------------------------------------------------------------------
+// Out typemap (std::size_t)
+//-----------------------------------------------------------------------------
+%typemap(out, fragment=SWIG_From_frag(std::size_t)) std::size_t
+{
+  if ($1<std::numeric_limits<long>::max())
+    $result = PyInt_FromSsize_t($1);
+  else
+    $result = PyLong_FromUnsignedLongLong(static_cast<unsigned long long>($1));
+}
+
+//-----------------------------------------------------------------------------
+// Typecheck and in typemap (unsigned int)
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_INTEGER) unsigned int
+{
+  $1 = PyInteger_Check($input) == _NO_PYTHON_INTEGER_TYPE ? 0 : 1;
+}
+
+%typemap(in, fragment="Py_convert_uint") unsigned int
+{
+  if (!Py_convert_uint($input, $1))
+    SWIG_exception(SWIG_TypeError, "(uint) expected positive 'int' for argument $argnum");
+}
+
+//-----------------------------------------------------------------------------
+// Typecheck and in typemap (std::size_t)
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_INTEGER) std::size_t
+{
+  $1 = PyInteger_Check($input) == _NO_PYTHON_INTEGER_TYPE ? 0 : 1;
+}
+
+%typemap(in, fragment="Py_convert_std_size_t") std::size_t
+{
+  if (!Py_convert_std_size_t($input, $1))
+    SWIG_exception(SWIG_TypeError, "(size_t) expected positive 'int' for argument $argnum");
+}
+
+//-----------------------------------------------------------------------------
+// The typecheck (int)
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_INTEGER) int
+{
+  $1 = PyInteger_Check($input) == _NO_PYTHON_INTEGER_TYPE ? 0 : 1;
+}
+
+//-----------------------------------------------------------------------------
+// The typemap (int)
+//-----------------------------------------------------------------------------
+%typemap(in, fragment="Py_convert_int") int
+{
+  if (!Py_convert_int($input, $1))
+    SWIG_exception(SWIG_TypeError, "expected 'int' for argument $argnum");
+}
+//-----------------------------------------------------------------------------
+// The typecheck (bool) Needed after SWIG 3.0
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_BOOL) book
+{
+  $1 = PyBool_Check(obj)||PyArray_IsScalar(obj, Bool);
+}
+
+//-----------------------------------------------------------------------------
+// The typemaps (bool)
+//-----------------------------------------------------------------------------
+%typemap(in, fragment=SWIG_AsVal_frag(bool2)) bool 
+{
+  int swig_res = SWIG_AsVal_dec(bool2)($input, &$1);
+  if (!SWIG_IsOK(swig_res))
+    SWIG_exception(SWIG_TypeError, "expected 'bool' for argument $argnum");
+}
+
+%typemap(directorout, fragment=SWIG_AsVal_frag(bool2)) bool
+{
+  int swig_res = SWIG_AsVal_dec(bool2)($1, &$result);
+  if (!SWIG_IsOK(swig_res))
+    Swig::DirectorTypeMismatchException::raise(SWIG_ErrorType(SWIG_ArgError(swig_res)), "expected 'bool' as the output argument of '$symname'");
+}
+
+//-----------------------------------------------------------------------------
+// Ensure typefragments
+//-----------------------------------------------------------------------------
+%fragment(SWIG_From_frag(unsigned long));
+%fragment(SWIG_From_frag(double));
+%fragment(SWIG_From_frag(unsigned int));
+%fragment(SWIG_From_frag(int));
+%fragment(SWIG_From_frag(std::size_t));
+%fragment(SWIG_From_frag(dolfin::la_index));
+%fragment("Py_convert_int");
+%fragment("Py_convert_uint");
+%fragment("Py_convert_std_size_t");
+
diff --git a/dolfin/swig/typemaps/std_map.i b/dolfin/swig/typemaps/std_map.i
new file mode 100644
index 0000000..c53c394
--- /dev/null
+++ b/dolfin/swig/typemaps/std_map.i
@@ -0,0 +1,218 @@
+/* -*- C -*- */
+// Copyright (C) 2011 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-09-27
+// Last changed: 2013-06-24
+
+//=============================================================================
+// In this file we declare what types that should be able to be passed using
+// some kind of map typemap.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Declare a dummy map class
+// This makes SWIG aware of the template type
+//-----------------------------------------------------------------------------
+namespace std
+{
+  template <typename T0, typename T1> class map
+  {
+  };
+}
+
+namespace boost
+{
+  template <typename T0, typename T1> class unordered_map
+  {
+  };
+}
+
+//-----------------------------------------------------------------------------
+// Help macro for defining (arg)out typemaps for either boost::unordered_map or
+// std::map
+//
+//    const MAP_TYPE<KEY_TYPE, VALUE_TYPE>&, (out)
+//    const MAP_TYPE<KEY_TYPE, std::vector<VALUE_TYPE> >& (out)
+//    MAP_TYPE<uint, VALUE_TYPE>& (argout)
+//
+//-----------------------------------------------------------------------------
+%define MAP_SPECIFIC_OUT_TYPEMAPS(MAP_TYPE, KEY_TYPE, VALUE_TYPE, TYPENAME, NUMPY_TYPE)
+
+%typemap(out) const MAP_TYPE<KEY_TYPE, VALUE_TYPE>&
+ (MAP_TYPE<KEY_TYPE, VALUE_TYPE>::const_iterator it,
+  PyObject* item0, PyObject* item1)
+{
+  // const MAP_TYPE<KEY_TYPE, VALUE_TYPE>& (out)
+  $result = PyDict_New();
+  for (it=$1->begin(); it!=$1->end(); ++it){
+    item0 = SWIG_From_dec(KEY_TYPE)(it->first);
+    item1 = SWIG_From_dec(VALUE_TYPE)(it->second);
+    PyDict_SetItem($result, item0, item1);
+    Py_XDECREF(item0);
+    Py_XDECREF(item1);
+  }
+}
+
+%typemap(out) MAP_TYPE<KEY_TYPE, VALUE_TYPE>&
+ (MAP_TYPE<KEY_TYPE, VALUE_TYPE>::const_iterator it,
+  PyObject* item0, PyObject* item1)
+{
+  // MAP_TYPE<KEY_TYPE, VALUE_TYPE>& (out)
+  $result = PyDict_New();
+  for (it=$1->begin(); it!=$1->end(); ++it){
+    item0 = SWIG_From_dec(KEY_TYPE)(it->first);
+    item1 = SWIG_From_dec(VALUE_TYPE)(it->second);
+    PyDict_SetItem($result, item0, item1);
+    Py_XDECREF(item0);
+    Py_XDECREF(item1);
+  }
+}
+
+%typemap(out) MAP_TYPE<std::pair<KEY_TYPE, KEY_TYPE>, VALUE_TYPE>&
+ (MAP_TYPE<std::pair<KEY_TYPE, KEY_TYPE>, VALUE_TYPE>::const_iterator it,
+  PyObject* item0, PyObject* item1, PyObject* item2, PyObject* item3)
+{
+  // MAP_TYPE<std::pair<KEY_TYPE, KEY_TYPE>, VALUE_TYPE>& (out)
+  $result = PyDict_New();
+  for (it=$1->begin(); it!=$1->end(); ++it)
+  {
+    //item0 = SWIG_From_dec(KEY_TYPE)(it->first.first);
+    //item1 = SWIG_From_dec(KEY_TYPE)(it->first.second);
+    item2 = Py_BuildValue("ii", it->first.first, it->first.second);
+    item3 = SWIG_From_dec(VALUE_TYPE)(it->second);
+
+    PyDict_SetItem($result, item2, item3);
+    //Py_XDECREF(item0);
+    //Py_XDECREF(item1);
+    Py_XDECREF(item2);
+    Py_XDECREF(item3);
+  }
+}
+
+%typemap(out) MAP_TYPE<KEY_TYPE, std::pair<VALUE_TYPE, VALUE_TYPE> >
+  (MAP_TYPE<KEY_TYPE, std::pair<VALUE_TYPE, VALUE_TYPE> >::const_iterator it,
+  PyObject* item0, PyObject* item1)
+{
+  // MAP_TYPE<KEY_TYPE, std::pair<VALUE_TYPE, VALUE_TYPE> > (out)
+  $result = PyDict_New();
+  for (it=$1.begin(); it!=$1.end(); ++it)
+  {
+    item0 = SWIG_From_dec(KEY_TYPE)(it->first);
+    item1 = Py_BuildValue("ii", it->second.first, it->second.second);
+
+    PyDict_SetItem($result, item0, item1);
+    Py_XDECREF(item0);
+    Py_XDECREF(item1);
+  }
+}
+
+%typemap(out) const MAP_TYPE<KEY_TYPE, std::vector<VALUE_TYPE> >& \
+ (MAP_TYPE<KEY_TYPE, std::vector<VALUE_TYPE> >::const_iterator it,
+  PyObject* item0, PyObject* item1)
+{
+  // const MAP_TYPE<KEY_TYPE, std::vector<VALUE_TYPE> > (out)
+  $result = PyDict_New();
+  for (it=$1->begin(); it!=$1->end(); ++it)
+  {
+    item0 = SWIG_From_dec(KEY_TYPE)(it->first);
+    item1 = %make_numpy_array(1, TYPENAME)(it->second.size(), &it->second[0], false);
+    PyDict_SetItem($result, item0, item1);
+    Py_XDECREF(item0);
+    Py_XDECREF(item1);
+  }
+}
+
+%typemap(out) MAP_TYPE<KEY_TYPE, std::set<VALUE_TYPE> >& \
+ (MAP_TYPE<KEY_TYPE, std::set<VALUE_TYPE> >::const_iterator map_it,
+  std::set<VALUE_TYPE>::const_iterator set_it,
+  PyObject* item0, PyObject* item1)
+{
+  // MAP_TYPE<KEY_TYPE, std::set<VALUE_TYPE> > (out)
+  $result = PyDict_New();
+  for (map_it=$1->begin(); map_it!=$1->end(); ++map_it)
+  {
+    npy_intp size = map_it->second.size();
+    item0 = SWIG_From_dec(KEY_TYPE)(map_it->first);
+    item1 = PyArray_SimpleNew(1, &size, NUMPY_TYPE);
+
+    PyArrayObject *array = reinterpret_cast<PyArrayObject*>(item1);
+    VALUE_TYPE* data = static_cast<VALUE_TYPE*>(PyArray_DATA(array));
+
+    // Fill numpy array
+    unsigned int i=0;
+    for (set_it = map_it->second.begin(); set_it != map_it->second.end(); i++, set_it++)
+      data[i] = *set_it;
+
+    //item1 = %make_numpy_array(1, TYPENAME)(it->second.size(), &it->second[0], false);
+    PyDict_SetItem($result, item0, item1);
+    Py_XDECREF(item0);
+    Py_XDECREF(item1);
+  }
+}
+
+%typemap (in, numinputs=0) MAP_TYPE<KEY_TYPE, VALUE_TYPE>&
+  (MAP_TYPE<KEY_TYPE, VALUE_TYPE> map_temp)
+{
+  // const MAP_TYPE<KEY_TYPE, VALUE_TYPE>& (argout)
+  $1 = &map_temp;
+}
+
+%typemap(argout) MAP_TYPE<KEY_TYPE, VALUE_TYPE>&
+  (MAP_TYPE<KEY_TYPE, VALUE_TYPE>::const_iterator it,
+   PyObject* item0, PyObject* item1)
+{
+  // const MAP_TYPE<KEY_TYPE, VALUE_TYPE>& (argout)
+  PyObject *ret = PyDict_New();
+  for (it=$1->begin(); it!=$1->end(); ++it){
+    item0 = SWIG_From_dec(KEY_TYPE)(it->first);
+    item1 = SWIG_From_dec(VALUE_TYPE)(it->second);
+    PyDict_SetItem(ret, item0, item1);
+    Py_XDECREF(item0);
+    Py_XDECREF(item1);
+  }
+
+  // Append the output to $result
+  %append_output(ret);
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining out typemaps for various maps of primitives
+//
+// KEY_TYPE   : The key type
+// VALUE_TYPE : The value type
+// TYPENAME   : The name of the type (used to construct a NumPy array)
+// NUMPY_TYPE : The NumPy type that is going to be checked for
+//-----------------------------------------------------------------------------
+%define MAP_OUT_TYPEMAPS(KEY_TYPE, VALUE_TYPE, TYPENAME, NUMPY_TYPE)
+MAP_SPECIFIC_OUT_TYPEMAPS(boost::unordered_map, KEY_TYPE, VALUE_TYPE, TYPENAME, NUMPY_TYPE)
+MAP_SPECIFIC_OUT_TYPEMAPS(std::map, KEY_TYPE, VALUE_TYPE, TYPENAME, NUMPY_TYPE)
+%enddef
+
+//-----------------------------------------------------------------------------
+// Run the macro and instantiate the typemaps
+//-----------------------------------------------------------------------------
+// NOTE: SWIG BUG
+// NOTE: Because of bug introduced by SWIG 2.0.5 we cannot use templated versions
+// NOTE: of typdefs, which means we need to use unsigned int instead of dolfin::uint
+// NOTE: in typemaps
+// NOTE: Well... to get std::size_t up and running we need to use typedefs.
+MAP_OUT_TYPEMAPS(unsigned int, unsigned int, uint, NPY_UINT)
+MAP_OUT_TYPEMAPS(std::size_t, unsigned int, uint, NPY_UINT)
+MAP_OUT_TYPEMAPS(std::size_t, double, double, NPY_DOUBLE)
+MAP_OUT_TYPEMAPS(std::size_t, std::size_t, size_t, NPY_UINTP)
diff --git a/dolfin/swig/typemaps/std_pair.i b/dolfin/swig/typemaps/std_pair.i
new file mode 100644
index 0000000..0cc98be
--- /dev/null
+++ b/dolfin/swig/typemaps/std_pair.i
@@ -0,0 +1,255 @@
+/* -*- C -*- */
+// Copyright (C) 2011 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-01-25
+// Last changed: 2014-02-06
+
+//-----------------------------------------------------------------------------
+// User macro for defining in typemaps for std::pair of a pointer to some
+// DOLFIN type and a double
+//-----------------------------------------------------------------------------
+%define IN_TYPEMAPS_STD_PAIR_OF_POINTER_AND_DOUBLE(TYPE)
+
+//-----------------------------------------------------------------------------
+// Make SWIG aware of the shared_ptr version of TYPE
+//-----------------------------------------------------------------------------
+%types(std::shared_ptr<TYPE >*);
+//
+////-----------------------------------------------------------------------------
+//// Run the macros for the combination of const and no const of
+//// {const} std::vector<{const} dolfin::TYPE *>
+////-----------------------------------------------------------------------------
+////IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE,,)
+IN_TYPEMAP_STD_PAIR_OF_POINTER_AND_DOUBLE(TYPE,const,)
+IN_TYPEMAP_STD_PAIR_OF_POINTER_AND_DOUBLE(TYPE,,const)
+IN_TYPEMAP_STD_PAIR_OF_POINTER_AND_DOUBLE(TYPE,const,const)
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining in typemaps for
+// {const} std::vector<{const} dolfin::TYPE *>
+// using a Python List of TYPE
+//-----------------------------------------------------------------------------
+%define IN_TYPEMAP_STD_PAIR_OF_POINTER_AND_DOUBLE(TYPE, CONST, CONST_PAIR)
+
+//-----------------------------------------------------------------------------
+// The typecheck
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_POINTER) CONST_PAIR std::pair<CONST dolfin::TYPE *, double>
+{
+
+  // TYPECHEK IN_TYPEMAP_STD_PAIR_OF_POINTER_AND_DOUBLE(TYPE, CONST, CONST_PAIR)
+  $1 = 0;
+  if (PyTuple_Check($input) && PyTuple_Size($input) == 2)
+  {
+    void* itemp = 0;
+    PyObject* py_first  = PyTuple_GetItem($input, 0);
+    int res = SWIG_ConvertPtr(py_first, &itemp, $descriptor(dolfin::TYPE *), 0);
+    if (!SWIG_IsOK(res))
+    {
+      // If failed with normal pointer conversion then
+      // try with shared_ptr conversion
+      int newmem = 0;
+      res = SWIG_ConvertPtrAndOwn(py_first, &itemp, $descriptor(std::shared_ptr< dolfin::TYPE > *), 0, &newmem);
+      if (SWIG_IsOK(res))
+      {
+	$1 = 1;
+	if (newmem & SWIG_CAST_NEW_MEMORY)
+	{
+	  delete reinterpret_cast< std::shared_ptr< dolfin::TYPE > * >(itemp);
+	}
+      }
+    }
+    else
+    {
+      $1 = 1;
+    }
+  }
+}
+
+//-----------------------------------------------------------------------------
+// The typemap
+//-----------------------------------------------------------------------------
+%typemap(in) CONST_PAIR std::pair<CONST dolfin::TYPE*, double> (std::pair<CONST dolfin::TYPE*, double> tmp_pair, std::shared_ptr<dolfin::TYPE > tempshared, dolfin::TYPE * arg)
+{
+  // TYPEMAP IN_TYPEMAP_STD_PAIR_OF_POINTER_AND_DOUBLE(TYPE, CONST, CONST_PAIR)
+  int res = 0;
+  void* itemp = 0;
+  int newmem = 0;
+
+  // Check that we have a tuple
+  if (!PyTuple_Check($input) || PyTuple_Size($input) != 2)
+    SWIG_exception(SWIG_TypeError, "expected a tuple of length 2 with TYPE and Float.");
+
+  // Get pointers to function and time
+  PyObject* py_first  = PyTuple_GetItem($input, 0);
+  PyObject* py_second = PyTuple_GetItem($input, 1);
+
+  // Check that we have a float
+  if (!PyFloat_Check(py_second))
+    SWIG_exception(SWIG_TypeError, "expected a Float for the second tuple argument.");
+
+  // Get second variable
+  tmp_pair.second = PyFloat_AsDouble(py_second);
+
+  res = SWIG_ConvertPtr(py_first, &itemp, $descriptor(dolfin::TYPE *), 0);
+  if (SWIG_IsOK(res))
+  {
+    tmp_pair.first = reinterpret_cast<dolfin::TYPE *>(itemp);
+  }
+  else{
+    // If failed with normal pointer conversion then
+    // try with shared_ptr conversion
+    newmem = 0;
+    res = SWIG_ConvertPtrAndOwn(py_first, &itemp, $descriptor(std::shared_ptr< dolfin::TYPE > *), 0, &newmem);
+    if (SWIG_IsOK(res)){
+      // If we need to release memory
+      if (newmem & SWIG_CAST_NEW_MEMORY)
+      {
+        tempshared = *reinterpret_cast< std::shared_ptr<dolfin::TYPE > * >(itemp);
+        delete reinterpret_cast< std::shared_ptr< dolfin::TYPE > * >(itemp);
+        arg = const_cast< dolfin::TYPE * >(tempshared.get());
+      }
+      else
+      {
+        arg = const_cast< dolfin::TYPE * >(reinterpret_cast< std::shared_ptr< dolfin::TYPE > * >(itemp)->get());
+      }
+      tmp_pair.first = arg;
+    }
+    else
+    {
+      SWIG_exception(SWIG_TypeError, "expected tuple of TYPE and Float (Bad conversion)");
+    }
+  }
+
+  // Assign the input variable
+  $1 = tmp_pair;
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Run the different macros and instantiate the typemaps
+//-----------------------------------------------------------------------------
+IN_TYPEMAPS_STD_PAIR_OF_POINTER_AND_DOUBLE(Function)
+IN_TYPEMAPS_STD_PAIR_OF_POINTER_AND_DOUBLE(Mesh)
+IN_TYPEMAPS_STD_PAIR_OF_POINTER_AND_DOUBLE(MeshFunction<int>)
+IN_TYPEMAPS_STD_PAIR_OF_POINTER_AND_DOUBLE(MeshFunction<std::size_t> )
+IN_TYPEMAPS_STD_PAIR_OF_POINTER_AND_DOUBLE(MeshFunction<double> )
+IN_TYPEMAPS_STD_PAIR_OF_POINTER_AND_DOUBLE(MeshFunction<bool>)
+
+//-----------------------------------------------------------------------------
+// In typemap for std::pair<TYPE,TYPE>
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_POINTER) std::pair<std::size_t, std::size_t>
+{
+  $1 = PyTuple_Check($input) ? 1 : 0;
+}
+
+%typemap(in) std::pair<std::size_t, std::size_t> (std::pair<std::size_t, std::size_t> tmp_pair, long tmp)
+{
+  // Check that we have a tuple
+  if (!PyTuple_Check($input) || PyTuple_Size($input) != 2)
+    SWIG_exception(SWIG_TypeError, "expected a tuple of length 2 of positive integers.");
+
+  // Get pointers to function and time
+  PyObject* py_first  = PyTuple_GetItem($input, 0);
+  PyObject* py_second = PyTuple_GetItem($input, 1);
+
+  // Check and get first tuple value
+  if (!Py_convert_std_size_t(py_first, tmp_pair.first))
+    SWIG_exception(SWIG_TypeError, "expected positive 'int' as the first tuple argument ");
+
+  // Check and get second tuple value
+  if (!Py_convert_std_size_t(py_second, tmp_pair.second))
+    SWIG_exception(SWIG_TypeError, "expected positive 'int' as the second tuple argument ");
+
+  // Assign input variable
+  $1 = tmp_pair;
+
+}
+
+%typecheck(SWIG_TYPECHECK_POINTER) std::pair<double, double>
+{
+  $1 = PyTuple_Check($input) ? 1 : 0;
+}
+
+%typemap(in) std::pair<double, double> (std::pair<double, double> tmp_pair, long tmp)
+{
+  // Check that we have a tuple
+  if (!PyTuple_Check($input) || PyTuple_Size($input) != 2)
+    SWIG_exception(SWIG_TypeError, "expected a tuple of length 2 of floats.");
+
+  // Get pointers to function and time
+  PyObject* py_first  = PyTuple_GetItem($input, 0);
+  PyObject* py_second = PyTuple_GetItem($input, 1);
+
+  tmp_pair = std::make_pair(PyFloat_AsDouble(py_first), PyFloat_AsDouble(py_second));
+
+  // Assign input variable
+  $1 = tmp_pair;
+}
+
+//-----------------------------------------------------------------------------
+// Out typemap for std::pair<TYPE,TYPE>
+//-----------------------------------------------------------------------------
+%typemap(out) std::pair<std::size_t, std::size_t>
+{
+  $result = Py_BuildValue("ii", $1.first, $1.second);
+}
+%typemap(out) std::pair<std::size_t, bool>
+{
+  $result = Py_BuildValue("ib", $1.first, $1.second);
+}
+%typemap(out) std::pair<unsigned int, unsigned int>
+{
+  $result = Py_BuildValue("ii", $1.first, $1.second);
+}
+%typemap(out) std::pair<unsigned int, bool>
+{
+  $result = Py_BuildValue("ib", $1.first, $1.second);
+}
+%typemap(out) std::pair<double, double>
+{
+  $result = Py_BuildValue("dd", $1.first, $1.second);
+}
+%typemap(out) std::pair<unsigned int, double>
+{
+  $result = Py_BuildValue("id", $1.first, $1.second);
+}
+
+//-----------------------------------------------------------------------------
+// Out typemap for std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+// If we need should need it for other types, we can make it into a macro later.
+//-----------------------------------------------------------------------------
+%typemap(out) std::pair<std::vector<unsigned int>, std::vector<unsigned int> >
+{
+  npy_intp n0 = $1.first.size();
+  npy_intp n1 = $1.second.size();
+
+  PyArrayObject *x0 = reinterpret_cast<PyArrayObject*>(PyArray_SimpleNew(1, &n0, NPY_UINT));
+  PyArrayObject *x1 = reinterpret_cast<PyArrayObject*>(PyArray_SimpleNew(1, &n1, NPY_UINT));
+
+  unsigned int* data0 = static_cast<unsigned int*>(PyArray_DATA(x0));
+  unsigned int* data1 = static_cast<unsigned int*>(PyArray_DATA(x1));
+
+  std::copy($1.first.begin(),  $1.first.end(),  data0);
+  std::copy($1.second.begin(), $1.second.end(), data1);
+
+  $result = Py_BuildValue("OO", x0, x1);
+}
diff --git a/dolfin/swig/typemaps/std_set.i b/dolfin/swig/typemaps/std_set.i
new file mode 100644
index 0000000..851898a
--- /dev/null
+++ b/dolfin/swig/typemaps/std_set.i
@@ -0,0 +1,132 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Andre Massing
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-11-27
+// Last changed: 2013-06-24
+
+//=============================================================================
+// In this file we declare some typemaps for the std::set type
+//=============================================================================
+
+namespace std
+{
+  template <typename T> class set
+  {
+  };
+}
+
+
+//-----------------------------------------------------------------------------
+// Macro for defining an argout typemap for a std::set of primitives
+// The typemaps makes a function returning a NumPy array of that primitive
+//
+// TYPE       : The primitive type
+// ARG_NAME   : The name of the argument that will be maped as an 'argout' argument
+// NUMPY_TYPE : The type of the NumPy array that will be returned
+//-----------------------------------------------------------------------------
+%define ARGOUT_TYPEMAP_STD_SET_OF_PRIMITIVES(TYPE, ARG_NAME, NUMPY_TYPE)
+//-----------------------------------------------------------------------------
+// In typemap removing the argument from the expected in list
+//-----------------------------------------------------------------------------
+%typemap (in,numinputs=0) std::set<TYPE>& ARG_NAME (std::set<TYPE> set_temp)
+{
+  $1 = &set_temp;
+}
+
+//-----------------------------------------------------------------------------
+// Argout typemap, returning a NumPy array for the boost::unordered_set<TYPE>
+//-----------------------------------------------------------------------------
+%typemap(argout) std::set<TYPE> & ARG_NAME
+{
+  npy_intp size = $1->size();
+  PyArrayObject *ret = reinterpret_cast<PyArrayObject*>(PyArray_SimpleNew(1, &size, NUMPY_TYPE));
+  TYPE* data = static_cast<TYPE*>(PyArray_DATA(ret));
+
+  int i = 0;
+  for (std::set<TYPE>::const_iterator it = (*$1).begin(); it != (*$1).end(); ++it)
+  {
+    data[i] = *it;
+    ++i;
+  }
+
+  // Append the output to $result
+  %append_output(PyArray_Return(ret));
+}
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining an out typemap for a boost::unordered_set of primitives
+// The typemaps makes a function returning a NumPy array of that primitive
+//
+// TYPE       : The primitive type
+// NUMPY_TYPE : The type of the NumPy array that will be returned
+//-----------------------------------------------------------------------------
+%define OUT_SET_TYPEMAP_OF_PRIMITIVES(TYPE, NUMPY_TYPE)
+SET_SPECIFIC_OUT_TYPEMAP_OF_PRIMITIVES(boost::unordered_map, TYPE, NUMPY_TYPE)
+SET_SPECIFIC_OUT_TYPEMAP_OF_PRIMITIVES(std::set, TYPE, NUMPY_TYPE)
+%enddef
+
+
+//-----------------------------------------------------------------------------
+// Argout typemap, returning a NumPy array for the boost::unordered_set<TYPE>
+//-----------------------------------------------------------------------------
+%define SET_SPECIFIC_OUT_TYPEMAP_OF_PRIMITIVES(SET_TYPE, TYPE, NUMPY_TYPE)
+
+// Value version
+%typemap(out) SET_TYPE<TYPE> 
+{
+  npy_intp size = $1.size();
+  PyArrayObject *ret = reinterpret_cast<PyArrayObject*>(PyArray_SimpleNew(1, &size, NUMPY_TYPE));
+  TYPE* data = static_cast<TYPE*>(PyArray_DATA(ret));
+
+  int i = 0;
+  for (SET_TYPE<TYPE>::const_iterator it = $1.begin(); it != $1.end(); ++it)
+  {
+    data[i] = *it;
+    ++i;
+  }
+
+  // Append the output to $result
+  $result = PyArray_Return(ret);
+}
+
+// Reference version
+%typemap(out) const SET_TYPE<TYPE> &
+{
+  npy_intp size = $1->size();
+  PyArrayObject *ret = reinterpret_cast<PyArrayObject*>(PyArray_SimpleNew(1, &size, NUMPY_TYPE));
+  TYPE* data = static_cast<TYPE*>(PyArray_DATA(ret));
+
+  int i = 0;
+  for (SET_TYPE<TYPE>::const_iterator it = $1->begin(); it != $1->end(); it++, i++)
+    data[i] = *it;
+
+  // Append the output to $result
+  $result = PyArray_Return(ret);
+}
+
+%enddef
+
+// NOTE: SWIG BUG
+// NOTE: Because of bug introduced by SWIG 2.0.5 we cannot use templated versions
+// NOTE: of typdefs, which means we need to use unsigned int instead of dolfin::uint
+// NOTE: in typemaps
+ARGOUT_TYPEMAP_STD_SET_OF_PRIMITIVES(std::size_t, ids_result, NPY_UINTP)
+ARGOUT_TYPEMAP_STD_SET_OF_PRIMITIVES(std::size_t, cells, NPY_UINTP)
+OUT_SET_TYPEMAP_OF_PRIMITIVES(std::size_t, NPY_UINTP)
diff --git a/dolfin/swig/typemaps/std_vector.i b/dolfin/swig/typemaps/std_vector.i
new file mode 100644
index 0000000..97e9a36
--- /dev/null
+++ b/dolfin/swig/typemaps/std_vector.i
@@ -0,0 +1,688 @@
+/* -*- C -*- */
+// Copyright (C) 2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2009-08-31
+// Last changed: 2014-05-20
+
+//=============================================================================
+// In this file we declare what types that should be able to be passed using a
+// std::vector typemap.
+//
+// We want to avoid using SWIGs own typemaps in std_vector.i,
+// as we really just want to be able to pass argument, in and a out, using
+// std::vector. We do not want to work with a proxy type of std::vector<Foo>,
+// as the interface reflects the C++ type and is hence not 'pythonic'.
+//=============================================================================
+
+//-----------------------------------------------------------------------------
+// Declare a dummy vector class
+// This makes SWIG aware of the template type
+//-----------------------------------------------------------------------------
+namespace std
+{
+  template <typename T> class vector
+  {
+  };
+}
+
+//-----------------------------------------------------------------------------
+// User macro for defining in typemaps for std::vector of pointers or
+// shared_pointer to some DOLFIN type
+//-----------------------------------------------------------------------------
+%define TYPEMAPS_STD_VECTOR_OF_POINTERS(TYPE)
+
+//-----------------------------------------------------------------------------
+// Make SWIG aware of the shared_ptr version of TYPE
+//-----------------------------------------------------------------------------
+%types(std::shared_ptr<dolfin::TYPE>*);
+
+//-----------------------------------------------------------------------------
+// Run the macros for the combination of const and no const of
+// {const} std::vector<{const} dolfin::TYPE *>
+//-----------------------------------------------------------------------------
+IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE,,)
+IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE,const,)
+IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE,,const)
+IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE,const,const)
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining in typemaps for
+// {const} std::vector<{const} dolfin::TYPE *>
+// using a Python List of TYPE
+//-----------------------------------------------------------------------------
+%define IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE,CONST,CONST_VECTOR)
+
+//-----------------------------------------------------------------------------
+// The typecheck
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_POINTER) CONST_VECTOR std::vector<CONST dolfin::TYPE *>
+{
+  $1 = PyList_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// The std::vector<Type*> typemap
+//-----------------------------------------------------------------------------
+%typemap (in) CONST_VECTOR std::vector<CONST dolfin::TYPE *> (
+std::vector<CONST dolfin::TYPE *> tmp_vec,
+std::shared_ptr<dolfin::TYPE> tempshared,
+dolfin::TYPE * arg)
+{
+  // IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE, CONST, CONST_VECTOR)
+  if (!PyList_Check($input))
+  {
+    SWIG_exception(SWIG_TypeError, "list of TYPE expected");
+  }
+  int size = PyList_Size($input);
+  int res = 0;
+  PyObject * py_item = 0;
+  void * itemp = 0;
+  int newmem = 0;
+  tmp_vec.reserve(size);
+  for (int i = 0; i < size; i++)
+  {
+    py_item = PyList_GetItem($input,i);
+    res = SWIG_ConvertPtr(py_item, &itemp, $descriptor(dolfin::TYPE *), 0);
+    if (SWIG_IsOK(res))
+      tmp_vec.push_back(reinterpret_cast<dolfin::TYPE *>(itemp));
+    else
+    {
+      // If failed with normal pointer conversion then
+      // try with shared_ptr conversion
+      newmem = 0;
+      res = SWIG_ConvertPtrAndOwn(py_item, &itemp, $descriptor(std::shared_ptr< dolfin::TYPE > *), 0, &newmem);
+      if (!SWIG_IsOK(res))
+      {
+        SWIG_exception(SWIG_TypeError, "list of TYPE expected (Bad conversion)");
+      }
+      if (itemp)
+      {
+	tempshared = *(reinterpret_cast< std::shared_ptr<dolfin::TYPE> * >(itemp));
+	tmp_vec.push_back(tempshared.get());
+      }
+      // If we need to release memory
+      if (newmem & SWIG_CAST_NEW_MEMORY)
+	delete reinterpret_cast< std::shared_ptr< dolfin::TYPE > * >(itemp);
+    }
+  }
+  $1 = tmp_vec;
+}
+
+
+//-----------------------------------------------------------------------------
+// The std::vector<Type*> typecheck
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_POINTER) CONST_VECTOR std::vector<std::shared_ptr<CONST dolfin::TYPE> >
+{
+  $1 = PyList_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// The std::vector<shared_ptr<Type> > typemap
+//-----------------------------------------------------------------------------
+%typemap (in) CONST_VECTOR std::vector<std::
+              shared_ptr<CONST dolfin::TYPE> > (
+std::vector<std::shared_ptr<CONST dolfin::TYPE> > tmp_vec,
+std::shared_ptr<dolfin::TYPE> tempshared)
+{
+  // IN_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE, CONST, CONST_VECTOR), shared_ptr version
+  if (!PyList_Check($input))
+  {
+    SWIG_exception(SWIG_TypeError, "list of TYPE expected");
+  }
+
+  int size = PyList_Size($input);
+  int res = 0;
+  PyObject * py_item = 0;
+  void * itemp = 0;
+  int newmem = 0;
+  tmp_vec.reserve(size);
+  for (int i = 0; i < size; i++)
+  {
+    newmem = 0;
+    py_item = PyList_GetItem($input, i);
+    res = SWIG_ConvertPtrAndOwn(py_item, &itemp, $descriptor(std::shared_ptr< dolfin::TYPE > *), 0, &newmem);
+    if (!SWIG_IsOK(res))
+    {
+      SWIG_exception(SWIG_TypeError, "expected a list of shared_ptr<TYPE> (Bad conversion)");
+    }
+    if (itemp)
+    {
+      tempshared = *(reinterpret_cast<std::shared_ptr< dolfin::TYPE> *>(itemp));
+      tmp_vec.push_back(tempshared);
+    }
+    if (newmem & SWIG_CAST_NEW_MEMORY)
+    {
+      delete reinterpret_cast<std::shared_ptr< dolfin::TYPE> *>(itemp);
+    }
+  }
+  $1 = tmp_vec;
+}
+
+//-----------------------------------------------------------------------------
+// The std::vector<shared_ptr<Type> > typecheck
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_POINTER) CONST_VECTOR std::vector<std::shared_ptr<CONST dolfin::TYPE> >
+{
+  $1 = PyList_Check($input) ? 1 : 0;
+}
+
+//-----------------------------------------------------------------------------
+// Out typemap of std::vector<shared_ptr<Type> >
+//-----------------------------------------------------------------------------
+%typemap (out) std::vector<std::
+               shared_ptr<CONST dolfin::TYPE> > (
+std::shared_ptr<CONST dolfin::TYPE> tempshared,
+PyObject* ret_list,
+PyObject* list_item)
+{
+  // OUT_TYPEMAP_STD_VECTOR_OF_POINTERS(TYPE, CONST, CONST_VECTOR), shared_ptr version
+  int size = (&$1)->size();
+  ret_list = PyList_New(size);
+
+  // Iterate over the vector and fill list
+  for (int i=0; i<size; i++)
+  {
+    // Grab the item
+    tempshared = (&$1)->operator[](i);
+
+    // Create a new ptr while increasing the reference.
+    // NOTE: Const cast because SWIG does not know how to handle non
+    // NOTE: const shared_ptr types
+    std::shared_ptr< dolfin::TYPE >* smartresult = tempshared ? new std::shared_ptr< dolfin::TYPE >(std::const_pointer_cast<dolfin::TYPE>(tempshared)) : 0;
+    list_item = SWIG_NewPointerObj(SWIG_as_voidptr(smartresult), $descriptor(std::shared_ptr< dolfin::TYPE > *), SWIG_POINTER_OWN);
+    PyList_SET_ITEM(ret_list, i, list_item);
+  }
+
+  // Assign the result
+  $result = ret_list;
+}
+
+%enddef
+
+
+//-----------------------------------------------------------------------------
+// Macro for defining an in typemap for a const std::vector& of primitives
+// The typemaps takes a NumPy array of that primitive
+//
+// TYPE       : The primitive type
+// TYPE_UPPER : The SWIG specific name of the type used in the array type checks
+//              values SWIG use: INT32 for integer, DOUBLE for double aso.
+// ARG_NAME   : The name of the argument that will be maped as an 'argout' argument
+// NUMPY_TYPE : The type of the NumPy array that will be returned
+// TYPE_NAME  : The name of the pointer type, 'double' for 'double', 'uint' for
+//              'dolfin::uint'
+// DESCR      : The char descriptor of the NumPy type
+//-----------------------------------------------------------------------------
+%define IN_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(TYPE, TYPE_UPPER, ARG_NAME, \
+                                            NUMPY_TYPE, TYPE_NAME, DESCR)
+
+// The typecheck
+%typecheck(SWIG_TYPECHECK_ ## TYPE_UPPER ## _ARRAY)  \
+const std::vector<TYPE>&  ARG_NAME
+{
+  $1 = PyArray_Check($input) ? PyArray_TYPE(reinterpret_cast<PyArrayObject*>($input)) == NUMPY_TYPE : 0;
+}
+
+// The typemap
+%typemap(in) const std::vector<TYPE>& ARG_NAME (std::vector<TYPE> temp)
+{
+  // IN_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(TYPE, TYPE_UPPER, ARG_NAME,
+  //                                     NUMPY_TYPE, TYPE_NAME, DESCR)
+  {
+    if (!PyArray_Check($input))
+    {
+      SWIG_exception(SWIG_TypeError, "(2) numpy array of 'TYPE_NAME' expected. "\
+		     "Make sure that the numpy array use dtype=DESCR.");
+    }
+
+    PyArrayObject *xa = reinterpret_cast<PyArrayObject*>($input);
+    if ( PyArray_TYPE(xa) != NUMPY_TYPE )
+    {
+      SWIG_exception(SWIG_TypeError, "(1) numpy array of 'TYPE_NAME' expected."	\
+		     " Make sure that the numpy array use dtype=DESCR.");
+    }
+    const std::size_t size = PyArray_DIM(xa, 0);
+    temp.resize(size);
+    TYPE* array = static_cast<TYPE*>(PyArray_DATA(xa));
+    if (PyArray_ISCONTIGUOUS(xa))
+    {
+      std::copy(array, array + size, temp.begin());
+    }
+    else
+    {
+      const npy_intp strides = PyArray_STRIDE(xa, 0)/sizeof(TYPE);
+      for (std::size_t i = 0; i < size; i++)
+	temp[i] = array[i*strides];
+    }
+    $1 = &temp;
+  }
+}
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining an argout typemap for a std::vector of primitives
+// The typemap returns a NumPy array of the primitive
+//
+// TYPE       : The primitive type
+// TYPE_UPPER : The SWIG specific name of the type used in the array type checks
+//              values SWIG use: INT32 for integer, DOUBLE for double aso.
+// ARG_NAME   : The name of the argument that will be maped as an 'argout' argument
+// NUMPY_TYPE : The type of the NumPy array that will be returned
+//-----------------------------------------------------------------------------
+%define ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(TYPE, TYPE_UPPER, ARG_NAME, \
+                                                NUMPY_TYPE)
+
+//-----------------------------------------------------------------------------
+// In typemap removing the argument from the expected in list
+//-----------------------------------------------------------------------------
+%typemap (in,numinputs=0) std::vector<TYPE>& ARG_NAME (std::vector<TYPE> vec_temp)
+{
+  // ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(TYPE, TYPE_UPPER, ARG_NAME, NUMPY_TYPE)
+  $1 = &vec_temp;
+}
+
+//-----------------------------------------------------------------------------
+// Argout typemap, returning a NumPy array for the std::vector<TYPE>
+//-----------------------------------------------------------------------------
+%typemap(argout) std::vector<TYPE>& ARG_NAME
+{
+  npy_intp size = $1->size();
+  PyArrayObject *ret = reinterpret_cast<PyArrayObject*>(PyArray_SimpleNew(1, &size, NUMPY_TYPE));
+  TYPE* data = static_cast<TYPE*>(PyArray_DATA(ret));
+  for (int i = 0; i < size; ++i)
+    data[i] = (*$1)[i];
+
+  // Append the output to $result
+  %append_output(PyArray_Return(ret));
+}
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining an in typemap for a std::vector of primitives passed by
+// value
+//
+// TYPE       : The primitive type
+// TYPE_UPPER : The SWIG specific name of the type used in the array type checks
+//              values SWIG use: INT32 for integer, DOUBLE for double aso.
+// ARG_NAME   : The name of the argument that will be maped as an 'argout'
+//              argument
+// TYPE_NAME  : The name of the pointer type, 'double' for 'double', 'uint' for
+//              'dolfin::uint'
+// SEQ_LENGTH : An optional sequence length argument. If set to a negative
+//              number
+//              will no length check be made
+//-----------------------------------------------------------------------------
+%define PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(TYPE, TYPE_UPPER, \
+                                              ARG_NAME, TYPE_NAME, SEQ_LENGTH)
+
+%typecheck(SWIG_TYPECHECK_ ## TYPE_UPPER ## _ARRAY) std::vector<TYPE> ARG_NAME
+{
+  $1 = PySequence_Check($input) ? 1 : 0;
+}
+
+%typemap (in, fragment=Py_convert_frag(TYPE_NAME)) std::vector<TYPE> ARG_NAME
+(std::vector<TYPE> tmp_vec, PyObject* item, TYPE value, std::size_t i)
+{
+  // PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(TYPE, TYPE_UPPER,
+  //                                    ARG_NAME, TYPE_NAME, SEQ_LENGTH)
+
+  // A first sequence test
+  if (!PySequence_Check($input))
+  {
+    SWIG_exception(SWIG_TypeError, "expected a sequence for argument $argnum");
+  }
+
+  // Get sequence length
+  Py_ssize_t pyseq_length = PySequence_Size($input);
+  if (SEQ_LENGTH >= 0 && pyseq_length > SEQ_LENGTH)
+  {
+    SWIG_exception(SWIG_TypeError, "expected a sequence with length "	\
+		   "SEQ_LENGTH for argument $argnum");
+  }
+
+  tmp_vec.reserve(pyseq_length);
+  for (i = 0; i < pyseq_length; i++)
+  {
+    item = PySequence_GetItem($input, i);
+    if(!SWIG_IsOK(Py_convert_ ## TYPE_NAME(item, value)))
+    {
+      Py_DECREF(item);
+      SWIG_exception(SWIG_TypeError, "expected items of sequence to be of type "\
+		     "\"TYPE_NAME\" in argument $argnum");
+    }
+    tmp_vec.push_back(value);
+    Py_DECREF(item);
+  }
+  $1 = tmp_vec;
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for out typemaps of primitives of const std::vector<TYPE>& It returns
+// readonly NumPy array
+//
+// TYPE       : The primitive type
+// NUMPY_TYPE : The corresponding NumPy type
+//-----------------------------------------------------------------------------
+%define OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(TYPE, NUMPY_TYPE)
+
+%typemap(out) std::vector<TYPE>
+{
+  // OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(TYPE, NUMPY_TYPE)
+  npy_intp adims = $1.size();
+
+  $result = PyArray_SimpleNew(1, &adims, NUMPY_TYPE);
+  TYPE* data = static_cast<TYPE*>(PyArray_DATA(reinterpret_cast<PyArrayObject*>($result)));
+  std::copy($1.begin(), $1.end(), data);
+
+}
+
+%typemap(out) const std::vector<TYPE> &
+{
+  // OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(TYPE, NUMPY_TYPE) const std::vector<TYPE> &
+  npy_intp adims = $1->size();
+
+  $result = PyArray_SimpleNew(1, &adims, NUMPY_TYPE);
+  TYPE* data = static_cast<TYPE*>(PyArray_DATA(reinterpret_cast<PyArrayObject*>($result)));
+  std::copy($1->begin(), $1->end(), data);
+}
+
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for out typemaps of primitives of std::vector<TYPE> It returns a
+// NumPy array vith a view. This is writable for const vectors and writable for
+// non-const ones.
+//
+// TYPE      : The primitive type
+// TYPE_NAME : The name of the pointer type, 'double' for 'double', 'uint' for
+//             'dolfin::uint'
+//-----------------------------------------------------------------------------
+%define OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES_REFERENCE(TYPE, TYPE_NAME)
+
+%typemap(out, fragment=make_numpy_array_frag(1, TYPE_NAME)) const std::vector<TYPE>&
+{
+  // OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES_REFERENCE(TYPE, TYPE_NAME) const version
+  $result = %make_numpy_array(1, TYPE_NAME)($1->size(), &($1->operator[](0)), false);
+}
+
+%typemap(out, fragment=make_numpy_array_frag(1, TYPE_NAME)) std::vector<TYPE>&
+{
+  // OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES_REFERENCE(TYPE, TYPE_NAME)
+  $result = %make_numpy_array(1, TYPE_NAME)($1->size(), &($1->operator[](0)), true);
+}
+
+%enddef
+
+%define IN_TYPEMAP_STD_VECTOR_OF_SMALL_DOLFIN_TYPES(TYPE)
+//-----------------------------------------------------------------------------
+// Typemap for const std::vector<dolfin::TYPE>& used for example in
+// IntersectionOperator. Expects a list of Points
+//-----------------------------------------------------------------------------
+%typecheck(SWIG_TYPECHECK_POINTER) const std::vector<dolfin::TYPE>&
+{
+  $1 = PyList_Check($input) ? 1 : 0;
+}
+
+%typemap (in) const std::vector<dolfin::TYPE>& (std::vector<dolfin::TYPE> tmp_vec)
+{
+  // IN_TYPEMAP_STD_VECTOR_OF_SMALL_DOLFIN_TYPES, TYPE
+  // A first sequence test
+  if (!PyList_Check($input))
+  {
+    SWIG_exception(SWIG_TypeError, "expected a list of TYPE for argument $argnum");
+  }
+
+  int size = PyList_Size($input);
+  int res = 0;
+  PyObject * py_item = 0;
+  void * itemp = 0;
+  tmp_vec.reserve(size);
+  for (int i = 0; i < size; i++)
+  {
+    py_item = PyList_GetItem($input,i);
+    res = SWIG_ConvertPtr(py_item, &itemp, $descriptor(dolfin::TYPE*), 0);
+    if (SWIG_IsOK(res))
+    {
+      tmp_vec.push_back(*reinterpret_cast<dolfin::TYPE *>(itemp));
+    }
+    else
+    {
+      SWIG_exception(SWIG_TypeError, "expected a list of TYPE for argument $argnum, (Bad conversion)");
+    }
+  }
+  $1 = &tmp_vec;
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Macro for defining an in typemap for const std::vector<std::vector<TYPE> >&
+// where TYPE is a primitive
+//
+// TYPE       : The primitive type
+// TYPE_UPPER : The SWIG specific name of the type used in the array type checks
+//              values SWIG use: INT32 for integer, DOUBLE for double aso.
+// ARG_NAME   : The name of the argument that will be maped as an 'argout' argument
+// TYPE_NAME  : The name of the pointer type, 'double' for 'double', 'uint' for
+//              'dolfin::uint'
+//-----------------------------------------------------------------------------
+%define IN_TYPEMAP_STD_VECTOR_OF_STD_VECTOR_OF_PRIMITIVES(TYPE, TYPE_UPPER, \
+                                                          ARG_NAME, TYPE_NAME)
+
+%typecheck(SWIG_TYPECHECK_ ## TYPE_UPPER ## _ARRAY) const std::vector<std::vector<TYPE> >& ARG_NAME
+{
+  $1 = PySequence_Check($input) ? 1 : 0;
+}
+
+%typemap (in, fragment=Py_convert_frag(TYPE_NAME)) const std::vector<std::vector<TYPE> >& ARG_NAME (std::vector<std::vector<TYPE> > tmp_vec, std::vector<TYPE> inner_vec, PyObject* inner_list, PyObject* item, TYPE value, std::size_t i, std::size_t j)
+{
+  // IN_TYPEMAP_STD_VECTOR_OF_STD_VECTOR_OF_PRIMITIVES(TYPE, TYPE_UPPER,
+  //                                    ARG_NAME, TYPE_NAME)
+
+  // A first sequence test
+  if (!PySequence_Check($input))
+  {
+    SWIG_exception(SWIG_TypeError, "expected a sequence for argument $argnum");
+  }
+
+  // Get outer sequence length
+  Py_ssize_t pyseq_length_0 = PySequence_Size($input);
+
+  tmp_vec.reserve(pyseq_length_0);
+  for (i = 0; i < pyseq_length_0; i++)
+  {
+    inner_list = PySequence_GetItem($input, i);
+
+    // Check type of inner list
+    if (!PySequence_Check(inner_list))
+    {
+      Py_DECREF(inner_list);
+      SWIG_exception(SWIG_TypeError, "expected a sequence of sequences for argument $argnum");
+    }
+
+    // Get inner sequence length
+    Py_ssize_t pyseq_length_1 = PySequence_Size(inner_list);
+
+    inner_vec.reserve(pyseq_length_1);
+    for (j = 0; j < pyseq_length_1; j++)
+    {
+      item = PySequence_GetItem(inner_list, j);
+
+      if(!SWIG_IsOK(Py_convert_ ## TYPE_NAME(item, value)))
+      {
+        Py_DECREF(item);
+        SWIG_exception(SWIG_TypeError, "expected items of inner sequence to be of type " \
+                 "\"TYPE_NAME\" in argument $argnum");
+      }
+      inner_vec.push_back(value);
+      Py_DECREF(item);
+    }
+
+    // Store and clear inner vec
+    tmp_vec.push_back(inner_vec);
+    inner_vec.clear();
+    Py_DECREF(inner_list);
+  }
+  $1 = &tmp_vec;
+}
+%enddef
+
+//-----------------------------------------------------------------------------
+// Out typemap for std::vector<std::pair<std:string, std:string>
+//-----------------------------------------------------------------------------
+%typemap(out) std::vector< std::pair< std::string, std::string > >
+   (std::vector< std::pair< std::string, std::string > >::const_iterator it,
+    PyObject* tuple, Py_ssize_t ind)
+{
+  // std::vector<std::pair<std:string, std:string> >
+  $result = PyList_New((&$1)->size());
+  ind = 0;
+  for (it = (&$1)->begin(); it !=(&$1)->end(); ++it)
+  {
+    tuple = Py_BuildValue("ss", it->first.c_str(), it->second.c_str());
+    PyList_SetItem($result, ind++, tuple);
+  }
+}
+
+//-----------------------------------------------------------------------------
+// Run the different macros and instantiate the typemaps
+//-----------------------------------------------------------------------------
+// NOTE: SWIG BUG
+// NOTE: Because of bug introduced by SWIG 2.0.5 we cannot use templated
+//       versions
+// NOTE: of typdefs, which means we need to use unsigned int instead of
+//       dolfin::uint
+// NOTE: in typemaps
+TYPEMAPS_STD_VECTOR_OF_POINTERS(Function)
+TYPEMAPS_STD_VECTOR_OF_POINTERS(DirichletBC)
+TYPEMAPS_STD_VECTOR_OF_POINTERS(BoundaryCondition)
+TYPEMAPS_STD_VECTOR_OF_POINTERS(GenericFunction)
+TYPEMAPS_STD_VECTOR_OF_POINTERS(GenericVector)
+TYPEMAPS_STD_VECTOR_OF_POINTERS(FunctionSpace)
+TYPEMAPS_STD_VECTOR_OF_POINTERS(Parameters)
+
+#if (DOLFIN_SIZE_T==4)
+ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT32, cells, NPY_UINTP)
+ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT32, columns, NPY_INTP)
+ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT32, dofs, NPY_INTP)
+#else
+ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT64, cells, NPY_UINTP)
+ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT64, columns, NPY_INTP)
+ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT64, dofs, NPY_INTP)
+#endif
+ARGOUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(double, DOUBLE, , NPY_DOUBLE)
+
+// TYPE       : The primitive type
+// TYPE_UPPER : The SWIG specific name of the type used in the array type checks
+//              values SWIG use: INT32 for integer, DOUBLE for double aso.
+// ARG_NAME   : The name of the argument that will be maped as an 'argout' argument
+// NUMPY_TYPE : The type of the NumPy array that will be returned
+// TYPE_NAME  : The name of the pointer type, 'double' for 'double', 'uint' for
+//              'dolfin::uint'
+// DESCR      : The char descriptor of the NumPy type
+
+IN_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(double, DOUBLE, , NPY_DOUBLE, double,
+                                    float_)
+IN_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(int, INT32, , NPY_INT, int, intc)
+IN_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(unsigned int, INT32, , NPY_UINT, uint,
+                                    uintc)
+#if (DOLFIN_SIZE_T==4)
+IN_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT32, , NPY_UINTP, uintp,
+                                    uintp)
+#else
+IN_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT64, , NPY_UINTP, uintp,
+                                    uintp)
+#endif
+
+// This typemap handles PETSc index typemap. Untested for 64-bit integers
+IN_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(PetscInt, INT32, , NPY_INT, intc, intc)
+
+#if (DOLFIN_SIZE_T==4)
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(std::size_t, INT32,
+                                               coloring_type, std_size_t, -1)
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(std::size_t, INT32, value_shape,
+                                               std_size_t, -1)
+#else
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(std::size_t,INT64,
+                                               coloring_type, std_size_t, -1)
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(std::size_t,INT64, value_shape,
+                                               std_size_t, -1)
+#endif
+
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(double, DOUBLE, values, double,
+                                               -1)
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(double, DOUBLE, dt_stage_offset,
+                                               double, -1)
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(double, DOUBLE, ellipsoid_dims,
+                                               double, -1)
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(double, DOUBLE, ellipse_dims,
+                                               double, -1)
+PY_SEQUENCE_OF_SCALARS_TO_VECTOR_OF_PRIMITIVES(int, INT32, jacobian_indices,
+                                               int, -1)
+
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(double, NPY_DOUBLE)
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(int, NPY_INT)
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(unsigned int, NPY_UINT)
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(std::size_t, NPY_UINTP)
+
+%typemap(out) std::vector<dolfin::la_index>
+{
+  // OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(dolfin::la_index, NPY_INT32)
+  npy_intp adims = $1.size();
+
+  if (sizeof(dolfin::la_index) == 4)
+  {
+    $result = PyArray_SimpleNew(1, &adims, NPY_INT32);
+  }
+  else if (sizeof(dolfin::la_index) == 8)
+  {
+    $result = PyArray_SimpleNew(1, &adims, NPY_INT64);
+  }
+  else
+    SWIG_exception(SWIG_TypeError, "sizeof(dolfin::la_index) incompatible NumPy types");
+
+  dolfin::la_index* data = static_cast<dolfin::la_index*>(PyArray_DATA(reinterpret_cast<PyArrayObject*>($result)));
+  std::copy($1.begin(), $1.end(), data);
+
+}
+
+// Need specialized typemap for dolfin::la_index
+//OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES(dolfin::la_index, dolfin_index)
+
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES_REFERENCE(double, double)
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES_REFERENCE(int, int)
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES_REFERENCE(unsigned int, uint)
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES_REFERENCE(std::size_t, size_t)
+
+// This typemap handles dolfin::la_index, which can be a 32 or 64 bit integer
+OUT_TYPEMAP_STD_VECTOR_OF_PRIMITIVES_REFERENCE(dolfin::la_index, dolfin_index)
+
+IN_TYPEMAP_STD_VECTOR_OF_SMALL_DOLFIN_TYPES(Point)
+IN_TYPEMAP_STD_VECTOR_OF_SMALL_DOLFIN_TYPES(MeshEntity)
+#if (DOLFIN_SIZE_T==4)
+IN_TYPEMAP_STD_VECTOR_OF_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT32, facets,
+                                                  std_size_t)
+#else
+IN_TYPEMAP_STD_VECTOR_OF_STD_VECTOR_OF_PRIMITIVES(std::size_t, INT64, facets,
+                                                  std_size_t)
+#endif
diff --git a/dolfin/swig/version.i b/dolfin/swig/version.i
new file mode 100644
index 0000000..af2ea9b
--- /dev/null
+++ b/dolfin/swig/version.i
@@ -0,0 +1,35 @@
+// Copyright (C) 2006-2009 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2013
+//
+// First added:  2006-02-06
+// Last changed: 2013-11-01
+
+//-----------------------------------------------------------------------------
+// Include code to generate a __swigversion__ attributes, from defines during
+// compile time, to the cpp module
+//-----------------------------------------------------------------------------
+%inline %{
+int dolfin_swigversion() { return  SWIGVERSION; }
+%}
+
+%pythoncode %{
+tmp = hex(dolfin_swigversion())
+__swigversion__ = "%d.%d.%d"%(tuple(map(int, [tmp[-5], tmp[-3], tmp[-2:]])))
+del tmp, dolfin_swigversion
+%}
diff --git a/scripts/dolfin-convert/dolfin-convert b/scripts/dolfin-convert/dolfin-convert
new file mode 100755
index 0000000..40ab83b
--- /dev/null
+++ b/scripts/dolfin-convert/dolfin-convert
@@ -0,0 +1,131 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Garth N. Wells (gmsh function)
+# Modified by Alexander H. Jarosch (gmsh fix)
+# Modified by Angelo Simone (Gmsh and Medit fix)
+# Modified by Andy R. Terrel (gmsh fix and triangle function)
+# Modified by Magnus Vikstrom (metis and scotch function)
+# Modified by Bartosz Sawicki (diffpack function)
+# Modified by Gideon Simpson (Exodus II function)
+# Modified by Arve Knudsen (move logic into module meshconvert)
+# Modified by Kent-Andre Mardal (Star-CD function)
+#
+# Script for converting between various data formats
+
+import getopt
+import sys
+import os
+from dolfin_utils.commands import getoutput
+import re
+import warnings
+import os.path
+
+from dolfin_utils.meshconvert import meshconvert
+
+def main(argv):
+    "Main function"
+
+    # Get command-line arguments
+    try:
+        opts, args = getopt.getopt(argv, "hi:o:", ["help", "input=", "output="])
+    except getopt.GetoptError:
+        usage()
+        sys.exit(2)
+
+    # Get options
+    iformat = None
+    oformat = None
+    for opt, arg in opts:
+        if opt in ("-h", "--help"):
+            usage()
+            sys.exit()
+        elif opt in ("-i", "--input"):
+            iformat = arg
+        elif opt in ("-o", "--output"):
+            oformat = arg
+
+    # Check that we got two filenames
+    if not len(args) == 2:
+        usage()
+        sys.exit(2)
+
+    # Get filenames
+    ifilename = args[0]
+    ofilename = args[1]
+
+    # Can only convert to XML
+    if oformat and oformat != "xml":
+        error("Unable to convert to format %s." % (oformat,))
+
+    # Convert to XML
+    meshconvert.convert2xml(ifilename, ofilename, iformat=iformat)
+
+    # Order mesh
+    #os.system("dolfin-order %s" % ofilename)
+
+def usage():
+    "Display usage"
+    print """\
+Usage: dolfin-convert [OPTIONS] ... input.x output.y
+
+Options:
+
+  -h         display this help text and exit
+  -i format  specify input format
+  -o format  specify output format
+
+Alternatively, the following long options may be used:
+
+  --help     same as -h
+  --input    same as -i
+  --output   same as -o
+
+Supported formats:
+
+  xml      - DOLFIN XML mesh format (current)
+  xml-old  - DOLFIN XML mesh format (DOLFIN 0.6.2 and earlier)
+  mesh     - Medit, generated by tetgen with option -g
+  Triangle - Triangle file format (input prefix of .ele and .node files)
+  gmsh     - Gmsh, version 2.0 file format
+  metis    - Metis graph file format
+  scotch   - Scotch graph file format
+  diffpack - Diffpack tetrahedral grid format
+  abaqus   - Abaqus tetrahedral grid format
+  ExodusII - Sandia Format (requires ncdump utility from NetCDF)
+  Star-CD  - Star-CD tetrahedral grid format
+
+If --input or --output are not specified, the format will
+be deduced from the suffix:
+
+  .xml  - xml
+  .mesh - mesh
+  .gmsh - gmsh
+  .msh  - gmsh
+  .gra  - metis
+  .grf  - scotch
+  .grid - diffpack
+  .inp  - abaqus
+  .e	- Exodus II
+  .exo  - Exodus II
+  .ncdf - ncdump'ed Exodus II
+  .vrt and .cell  - starcd
+"""
+if __name__ == "__main__":
+    main(sys.argv[1:])
diff --git a/scripts/dolfin-convert/test_Triangle.edge b/scripts/dolfin-convert/test_Triangle.edge
new file mode 100644
index 0000000..6084858
--- /dev/null
+++ b/scripts/dolfin-convert/test_Triangle.edge
@@ -0,0 +1,60 @@
+58  1
+   1   29  2  0
+   2   2  1  1
+   3   1  29  1
+   4   29  23  0
+   5   23  2  0
+   6   25  24  1
+   7   24  23  1
+   8   23  25  0
+   9   23  22  1
+  10   22  2  0
+  11   29  25  1
+  12   22  3  0
+  13   3  2  1
+  14   3  21  0
+  15   21  4  0
+  16   4  3  1
+  17   22  21  1
+  18   21  20  1
+  19   20  4  0
+  20   5  4  1
+  21   4  26  0
+  22   26  5  0
+  23   19  26  0
+  24   4  19  0
+  25   19  18  1
+  26   18  26  0
+  27   20  19  1
+  28   26  28  1
+  29   28  5  0
+  30   12  14  0
+  31   14  13  1
+  32   13  12  1
+  33   12  11  1
+  34   11  14  0
+  35   11  10  1
+  36   10  9  1
+  37   9  11  0
+  38   8  14  0
+  39   14  9  0
+  40   9  8  1
+  41   8  15  0
+  42   15  14  1
+  43   6  27  0
+  44   27  7  0
+  45   7  6  1
+  46   18  27  0
+  47   27  26  1
+  48   28  6  0
+  49   6  5  1
+  50   18  7  0
+  51   28  27  1
+  52   15  7  0
+  53   7  16  0
+  54   16  15  1
+  55   8  7  1
+  56   17  7  0
+  57   18  17  1
+  58   17  16  1
+# Generated by triangle -e A.poly
diff --git a/scripts/dolfin-convert/test_Triangle.ele b/scripts/dolfin-convert/test_Triangle.ele
new file mode 100644
index 0000000..1620174
--- /dev/null
+++ b/scripts/dolfin-convert/test_Triangle.ele
@@ -0,0 +1,31 @@
+29  3  0
+   1      29     2     1
+   2       2    29    23
+   3      25    24    23
+   4      23    22     2
+   5      25    23    29
+   6       2    22     3
+   7       3    21     4
+   8      21     3    22
+   9       4    21    20
+  10       5     4    26
+  11      19    26     4
+  12      26    19    18
+  13      19     4    20
+  14       5    26    28
+  15      12    14    13
+  16      14    12    11
+  17      11    10     9
+  18       8    14     9
+  19       8    15    14
+  20       9    14    11
+  21       6    27     7
+  22      26    18    27
+  23       5    28     6
+  24      27    18     7
+  25      28    27     6
+  26      15     7    16
+  27       7    15     8
+  28      17     7    18
+  29       7    17    16
+# Generated by triangle pq A.poly
diff --git a/scripts/dolfin-convert/test_Triangle.node b/scripts/dolfin-convert/test_Triangle.node
new file mode 100644
index 0000000..090a93b
--- /dev/null
+++ b/scripts/dolfin-convert/test_Triangle.node
@@ -0,0 +1,31 @@
+29  2  1  1
+   1    0.20000000000000001  -0.77639999999999998  -0.56999999999999995    1
+   2    0.22  -0.7732  -0.55000000000000004    1
+   3    0.24560000000000001  -0.75639999999999996  -0.51000000000000001    1
+   4    0.27760000000000001  -0.70199999999999996  -0.53000000000000003    1
+   5    0.48880000000000001  -0.20760000000000001  0.28000000000000003    1
+   6    0.50480000000000003  -0.20760000000000001  0.29999999999999999    1
+   7    0.74080000000000001  -0.73960000000000004  0    1
+   8    0.75600000000000001  -0.76119999999999999  -0.01    1
+   9    0.77439999999999998  -0.77239999999999998  0    1
+  10    0.80000000000000004  -0.77639999999999998  0.02    1
+  11    0.80000000000000004  -0.79239999999999999  0.01    1
+  12    0.57920000000000005  -0.79239999999999999  -0.20999999999999999    1
+  13    0.57920000000000005  -0.77639999999999998  -0.20000000000000001    1
+  14    0.62160000000000004  -0.77159999999999995  -0.14999999999999999    1
+  15    0.63360000000000005  -0.76280000000000003  -0.13    1
+  16    0.63919999999999999  -0.74439999999999995  -0.10000000000000001    1
+  17    0.62080000000000002  -0.68440000000000001  -0.059999999999999998    1
+  18    0.58720000000000006  -0.60440000000000005  -0.01    1
+  19    0.36080000000000001  -0.60440000000000005  -0.23999999999999999    1
+  20    0.31919999999999998  -0.70679999999999998  -0.39000000000000001    1
+  21    0.312  -0.73960000000000004  -0.42999999999999999    1
+  22    0.31840000000000002  -0.76119999999999999  -0.44    1
+  23    0.33439999999999998  -0.77159999999999995  -0.44    1
+  24    0.37119999999999997  -0.77639999999999998  -0.40999999999999998    1
+  25    0.37119999999999997  -0.79239999999999999  -0.41999999999999998    1
+  26    0.37440000000000001  -0.56999999999999995  -0.20000000000000001    1
+  27    0.57440000000000002  -0.56999999999999995  0    1
+  28    0.47360000000000002  -0.33079999999999998  0.14000000000000001    1
+  29    0.20000000000000001  -0.79239999999999999  -0.58999999999999997    1
+# Generated by triangle pq A.poly
diff --git a/scripts/dolfin-convert/test_exodus.exo b/scripts/dolfin-convert/test_exodus.exo
new file mode 100644
index 0000000000000000000000000000000000000000..ab8b98b7ab89f0f6f1ddff8ee56900e4067ef8b1
GIT binary patch
literal 7180
zcmeH}d34R!7RN(mMl{46LJ%r4AVQE$q7qXEAwty6bfcG>dn382C>~Wq74?i&Mb*$&
zqt%!t)KsEk3eg~`l|e)zQA=q}t@r)j{O+x{p8o&-@LTI+?{m&R`|Rmv2^uoAo<-ef
z577|VYt=ecnjuxAn`}JjfPZbdr`71x&?7*DBz<}+C9pGSlGV7NPQgO?Y;@_#szgmP
zm-T@i*E)ToI<3xNDugZf)LJ!-_5%C5wJKiAQws~mW!#$<r%F{PnD-hhb{ZW`eT@6O
z@2I??N>Qi6ukparv>#_Ms9w52-^|qtIK-uBRPU-&(=>V=md3q$gXTumK)3my{Xts`
zvEMRDtB*6FLaG$KMrTk>*QX|`(lqa}KCB7-+XA~JjTW`3J9y~~s)dz7W6<&fKGrBA
zAw6DW=;}2#4Y7Dl)+DO+x-?C4N}68hm4MQDC8>3qgfy?jxYUFhJrh;a(&JJM>Qt{Z
zDr!%4H-A@eA1@zYub$rCef?d1dKx_=KS(=ZZ|u|bcl64mjFI&*eb!JAb6evK)YTkW
z)isQE%!hHl{Bb=WZgxW2C+PL5DqUQ%(qx{o7B7F?8-i_bNL%(^l^n;hVJv*#^x<Cp
zORzIw!%iKK>54O?E3-pe8<Qa<-vBo73!m|-lvI5Rn{TpXKGYj9G)Tr^IgHkS-wlCo
zgBeNH#2e>^Hmn(IXZjGI)n=HD#D;BxUZ+zh7-(#=HT{10mYp#-!;F-d`fD|2^srty
z<A-={k$1xy=vJ&-qH){k3und|tlKfx#rk^-3+IVJV*`hcG3~xe`gnVqn*OR|3yZ(!
z<JIRDK0W<=di#4DYw${wj92cyv^nD?{hw9V$k+!+Q@-p!`)d5%K(d~!Kl|4RGzN~K
z33vlIfu^7ta0bmm3(yj@0<A$C&=$CWcA!0Q1sy;~;08K@&Y%l$2VFro@FwUEJU|cN
z3A}(eV1Za__Omze1$}@Y=nMJ*f6yNc00Th)5HJV~27w?53;}O}p&%G=7Kef1U<Ba2
zjRK({41|LSFd9Sxj>K3H1;&ABFdj?*F<>Hi8%zQ!5DVf!JV*eEfMc2jCWCi?2224{
zffn#@H2*m2K?;}#Qb8IpfOPOKm<~81oPzhjOfU<~2LA$cz+CV?m<K)p^T7hJ5G(>8
zg2mt?ummgx%fQEAIrukN0ak)lU^Q3+)`CyKI`Ao24?Y7Mz(%kMd=55)FTfVC6>J0B
z!I$7G@HN;0z5$tFC-@e82X=w)K^E8z_JF;h9+CU_7vF37x(=`B;Pvm|_1}U2ufGF`
zhJUB)153~VSOIHb18jjEum=vHp#t?rpfPX+O~4z#2{Z-tN1JBA88iniKugdH@Vqr>
z18CD0xPW$`J#YmbKu19TZlDwB47vb!&=qt8Z-VZ?12E1Wz!P`@?t23t&=d3m^vB$o
zBj4){d_f=J2l!@R&=2^7{$K#0%|H+Um?z)mn*!*YZwvy1K_CbMe4qI<2KpHS=!>z_
zjy7)r+MDhTRrZ4+Sqs*IZ}FWFz_*8i;efUy0R6E3tTAI52}S|FPpC6i=E^#Uf-n#c
z=!d;vZ6g3{FdDG7tTW?dY?h!tV82*D_KY>8<lInq0PHVkgSj$(=IaU~0dwIy_JBPa
z1I7aOmNOCsm;>i(9Eb*-neku(;2zhEgZ^Ux-=K6=biQK+7!&)=8KxiR#C(|7L_k0E
z`8MFpFeb*qy08wDKwrQapfBdhdEuT4a6Z`ESit^rHh72g!TPiAoWVH2Ji7qq%9`_y
zc+dv$E%uDLGhW7-02nJJ>rXuqa7Nt}*-_CsOVpVcCHqI6`@A<8upjKp2tXU=-2|`>
z+-EIl&o$3z!!>o*p69H+Bj6eDssZPTb7=#3#=g-X=b%2Q2Y8P<Yry)l4m@YQTZ1IP
z9yC-W_o=fMtjT0WHdl1cuAQQ@7JQepXA2kyV_?jDmpW(v9l-hL-8Vr9=m)%jKhOa7
zjO$?_3=9WT0Q>3$*gNhs2lkDzvv-`GslXF(wkeq-^Wd6xK7e=P0rO>k?8#7NO`UNu
zKIYj1Fn7)c_gnyTreu!PIY*3dxFQ)Nb;igX_|_YMJ_Z5yh5h9W@Lj%1eF9*;*i*{J
ziq3kmZtO25`%OI<bO8J<Fc!wd-v)no{GITOP^V3Mz&ir~=Y@WJ0q=258}9W7+_wUW
zz*>>)F?HUjAKFmz9`){kwR2V^>qk8n1ORWqzEZN+v4H2SF?H6cDPVutCrbtDoIwrX
zea?$YSyPV%^uhbAH|tNGe(0kaZ~*K-b;dFYFb2lLHFf?*XwSFUGx{0?m<M}58Q22$
zB^q$9d51bB?@_0}SioEu3)j@?k8uqG%!zMM=bTWF0G$EnnmT8Ka}uP;u8PiHF`f{>
zIpCVQCzuMlC^Amb?I0PqDSpN|SxUkmoyd4PM@k}X-g^4uLn#VzpY5^pE2)|FQ>5Ri
z2Il`C-n|>qaq#TRQrX<;nD)Y-QuegP{$ndsr2LzJXy=J~DbP*yZt>!U6t|xqd#`!0
z6m3XZtPc#3l4ncq4_sR%6<-zJunTgLs;vc)rL|#lC*)qP+pa`8zkgWF7r6nFGo^CI
z(9qU$DsRE{%BXO;UQv-Ap+6y4TXkC5vzMzB?VZ1SV2O=f?exi}?J?nU%khsxUGue4
z)?)qb2Scw)fp+bt@md!t$gH2W!==Ae4XnudJ=;bq@^z<2&UBGGH|DMOm{~5hPQ63*
z_Djrp)m+(dD!<i5xtq8An?v*NOReQm^|=kRBuBr0_3YgtlGk}|p|0g5$v*aEb;XXe
zQgiEEu+M-|Qk8qbebdqisr6eh>Vw@Kq&UN{DsL9vALo!WL4QVywl~gy*I}PrLY48!
z*(QHJ*<!Ixaxc2wv}o%jdCB+xT34JdKX=b_d|0$ier|B~vTb3${IYLLue|36<W@%M
zn1`<AQkfv)XSK^5@BKP|rhjGci55;4muuzF@sN$Wq^EMH?nJ6P?Y?<@HD|*3$&r~q
z6r9PpETwH7v&RSjE|*?>8?ZL?kyPD#(5PE<AM?H2cMhLhJH=0GlzS$5OIcS>nf9Q;
z^j=b$&}xC3-AXxiajECoM-63fNbt(qbEl>JiT$#|ghF%P*OYsuSqHw}`Xoz^O!zb7
zQS_X;UDPFSpKqYLsN+B7XSTa>GI`#Ll4VkEU)Aj6=o%^WxE@&0=b%&^OnY{=Rhd*C
zi#o7*%O<m*ih`P6N1fJ*^1jKBNy_;$SFQh!Rp#}Dm`Ayp59gZiD|HrA-X(RGQZm_h
z{o>jfF|Ci)?VJ7;Wi93VhAfKytiRm;<N3^-388XJ_dGpphK*cVba!XqI!9AnQfz&?
zNBW2-QuJHV-P2c2%FVQKmL9G*<yzB`y|XvjO3mdZBbQq5lIod{_cyQ2mfFv~yUd9y
zmD&zVZvSNPmC|a5;7cbOOX)VtzjkiiE4QM2{ygk?U5c9)Ug-AmWhoB!{I&b=7`f(g
zI5=cnKdDS9jqK?Ay<BpQd7up(D+TUnYukBPOX1okP3|rFPAavLn?F52P^z6Gk6Aj2
zRLO`<He;GgMX~F~4MVob)w>T}7oTk`S3;L|9-rkd=faN;$XVqg`@RfJuiEx6bN**0
zo^0b5epxE+IqwMYvX|1w!>3uz9wJq-+NSes!lb%--1BmaB&m6!9=qPRlhiybe%t-P
zuTm{jSGfK4i&X8Y-*il7uAC|OFmbu>VL2L9mh1IXw(Pt3(TRD<SIm8?%`OaxdmJi<
z@-JpAbB&U`xXfnfTV_bv`)hlw+ZiG^r;T3jH|~8YS!0)x<s2)g=HEF#{<9c4G&0kF
z)B$UAe@(v|Q~&m6^{ULNI3u|;I<34C=5Frqu5CXqZ1;GqxqnwOOCww^+?4EaKfPb?
zEmHD4taSOF!BYFl&bbAb0{@QF>4TCp2d|p_nC8nQkN3~i-t{V%+zZPaUF&yGN)vxw
zoOshqN`LI)oWA&=)GRoYI5Tj$>Ap!y{?Q*UKD&@E75)3y%z3`XoKIzP&cYYlW6Zzf
zOLaHQYg4{AcI>N}Gv^PvwQ!HyitAIPw9GgEx0VB>qV<tSQ4aP}8F)M^a#XJQy=tfM
zA5O-$HRq-HHJ=yc1Rd%3e7*U+{OS7hHUqnx*Ci&)I%(d&u3A&uZc^lbpW^R>VsEnh
E5Ar|3sQ>@~

literal 0
HcmV?d00001

diff --git a/scripts/dolfin-order/dolfin-order b/scripts/dolfin-order/dolfin-order
new file mode 100755
index 0000000..e0150c5
--- /dev/null
+++ b/scripts/dolfin-order/dolfin-order
@@ -0,0 +1,60 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Script for ordering a DOLFIN mesh according to the UFC ordering scheme
+
+import sys, os, shutil
+
+from dolfin import Mesh, File
+
+def main(args):
+    "Main function"
+
+    # Check that we got at least
+    if not len(args) > 0:
+        usage()
+        sys.exit(2)
+
+    # Convert each mesh
+    for filename in args:
+        print "Ordering %s" % filename
+
+        # Read and order mesh
+        mesh = Mesh(filename)
+        mesh.order()
+
+        # Make backup copy
+        shutil.move(filename, filename + ".bak")
+
+        # Write file and gzip if necessary
+        gzip = False
+        if len(filename) >= 3 and filename[-3:] == ".gz":
+            filename = filename[:-3]
+            gzip = True
+        file = File(filename)
+        file << mesh
+        if gzip:
+            os.system("gzip " + filename)
+
+def usage():
+    "Print usage instructions"
+    print "Usage: dolfin-order mesh0.xml[.gz] [mesh1.xml[.gz] mesh2.xml[.gz] ...]"
+
+if __name__ == "__main__":
+    main(sys.argv[1:])
diff --git a/scripts/dolfin-order/mesh0.xml.gz b/scripts/dolfin-order/mesh0.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..3b629615d73c1e5fee1ee0cd6f9d02b3ab081565
GIT binary patch
literal 312
zcmV-80muFyiwFp6!Aem818rq<XfQ5#ZEOIIliiMkAP`3HeG0<;O7X8v1NLs8VD|ww
zGOZ+vjS#hc`c<&0u3PKP7~~xMWHRj3l?7^`*0NF@Q-6mMsH_rFT{!;!`usTHQ|ft4
zRK-~;)YD2I-GbxXnCp>{wr%}0D4A)$sxQRt5}bMnu@ZESGAIgjy8_1sO#PFCs4In$
zkR`{V<$AIYVPpmxX?gF-!}xyOfeuL}pyRkt=<3bZyRGB}Of5{e!NCNk@8EC}<1HL5
zGSk;^yvV!)CyUH0@P3i`2{ZC&z_=co_Gm`(Y{sO6la4ey_n`L3Cb0L@gu|bcHI+J*
zIyIQ7$+{ZM)X1r^Q}^p?I8#HXMw`@Vrp8W9HmUJ{U;V2xV(;C~4jG0g_1HL3srL&+
KW9g@^0{{Rz_@6ZZ

literal 0
HcmV?d00001

diff --git a/scripts/dolfin-order/mesh1.xml.gz b/scripts/dolfin-order/mesh1.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..79ef4a5a833c5ffc52c9537f8573b7ad8ebfc8c7
GIT binary patch
literal 247
zcmV<T00{pdiwFp6!Aem818rq<XfZB$ZEOIAkU?(4AP`0OoC3|ho<OpwB5-y+L3@D6
zo;XMtM+VtWPhSjnYE`nj88poM`hP}Urq=R-dT%<XK@<nz<f^VVuF>%I`SJD+my$76
zclKr+kF@jW+-SIm@Hium<5=9tnaUSk-(a31l#FxLlE3qctPRfxX$ZZ!y2cXl+O!&E
zf+7|Z1XGdc-h4;wwEQm<nz(T_O&VgnT%U8r9ZDoh{6onNC3dOf#_>fdTmvutyx|&N
x{)S)I-NYXb`4P!_kh25s3Pcu&ERcT$3X^X-G|rbUnOe?YvL6^CFN@m&002GobQJ&q

literal 0
HcmV?d00001

diff --git a/scripts/dolfin-plot/dolfin-plot b/scripts/dolfin-plot/dolfin-plot
new file mode 100755
index 0000000..04e81e2
--- /dev/null
+++ b/scripts/dolfin-plot/dolfin-plot
@@ -0,0 +1,149 @@
+#!/usr/bin/env python
+
+"Script for simple command-line plotting."
+
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes, 2010
+#
+# First added:  2010-12-08
+# Last changed: 2010-12-22
+
+import sys
+
+# Try importing DOLFIN
+try:
+    from dolfin import *
+except:
+    print """\
+Unable to import DOLFIN. The DOLFIN Python module is required
+to run this script. Check that DOLFIN is in your PYTHONPATH."""
+    sys.exit(1)
+
+def usage():
+    "Print usage of this script."
+
+    # Build list of supported elements
+    element_list = ""
+    for e in supported_elements_for_plotting:
+        if e in supported_elements:
+            element_list += ("   %s\n" % e)
+        else:
+            element_list += ("   %s (*)\n" % e)
+
+    print """\
+Usage:
+
+1. dolfin-plot <meshfile>
+
+   where <meshfile> is a mesh stored in DOLFIN XML format
+   with suffix .xml or .xml.gz.
+
+2. dolfin-plot <family> <domain> [degree] [rotate=1/0]
+
+   where <family> is the name of a finite element family,
+   <domain> is the domain type ('triangle' or 'tetrahedron'),
+   and <degree> is an optional degree for elements that
+   support variable degree.
+
+Examples:
+
+   dolfin-plot mesh.xml
+   dolfin-plot Lagrange triangle 3
+   dolfin-plot BDM tetrahedron 5
+   dolfin-plot Hermite triangle
+
+List of supported element families:
+
+%s
+A (*) indicates that the element is not supported by DOLFIN/FFC,
+but the element may still be plotted.
+""" % element_list
+
+# Check command-line arguments
+if len(sys.argv) < 2:
+    usage()
+    sys.exit(1)
+
+# Check for help text
+if "-h" in sys.argv[1:] or "--help" in sys.argv[1:]:
+    usage()
+    sys.exit(0)
+
+# Extract arguments and options
+args = [arg for arg in sys.argv[1:] if not "=" in arg]
+options = dict([arg.split("=") for arg in sys.argv[1:] if "=" in arg])
+
+# Check for plotting of mesh
+if len(args) == 1:
+
+    # Read mesh
+    print "Reading mesh from file '%s'." % args[0]
+    try:
+        mesh = Mesh(args[0])
+    except:
+        print "Unable to read mesh from file."
+        sys.exit(1)
+
+    # Plot mesh
+    print "Plotting mesh."
+    plot(mesh, title="Mesh", interactive=True)
+
+    sys.exit(0)
+
+# Check for plotting of element
+if len(args) in (2, 3, 4):
+
+    # Get family and domain
+    family, domain = args[:2]
+
+    # Get degree
+    if len(args) == 2:
+        degree = None
+    else:
+        degree = int(args[2])
+
+
+    # Create element
+    print "Creating finite element."
+
+    if len(args) == 3 or len(args) == 2:
+        element = FiniteElement(family, domain, degree)
+    elif len(args) == 4:
+        assert family == "P Lambda" or family == "P- Lambda"
+        form_degree = int(args[3])
+        element = FiniteElement(family, domain, degree, form_degree)
+    else:
+        pass
+
+    # Rotate by default in 3D
+    rotate = 1 if str(domain) == "tetrahedron" else 0
+
+    # Check for rotate option
+    if "rotate" in options:
+        rotate = int(options["rotate"])
+
+    # Plot element
+    print "Plotting finite element."
+    plot(element, rotate=rotate)
+
+    sys.exit(0)
+
+# Catch all
+usage()
+sys.exit(1)
diff --git a/scripts/dolfin-plot/mesh.xml.gz b/scripts/dolfin-plot/mesh.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..df60442e73cfa687f9048f4c7cf5dfd3f2ffdc6f
GIT binary patch
literal 20894
zcmV)iK%&1NiwFp6!Aem818rq<XfAkdYyg#g+p;XTjqJO>LZSDuiZ_s)usm<)3(om~
z344!65wbjCIp+5D2kh0EsMWPPi?SnZZ>zDZiUe^<B)~uX%YXm%=kNaW+uwiv>2JUM
z_<j2Q@%?w-e)-ei{`}J~fBEtI|M!3Y&p(at|K*Rr``sV@{I{R~?WbS9^I!k+>py?|
z;m7a){U87MkAME*hyVJo|N8yEef#C7KmGdqzy19$KYaYtAHM(N@4ox)4}bmk>%V{Z
zr*A+1{Ez?nk8eMI|Bt`_^sm4C<>znTfA{B~{`%wh`SBzFnZLn5e)`k5U%&hHr~mbz
z^){dX<oVCO{r7i2{qpB;|NZ0l{(|d2f8R=-xqScK|ExchY)3EO|L{g8K_(qmGh|Xt
z)85MDr%W|Vxjkj_EXT-iWeQ}9)jA+EQa;*SnF^U>R-=qBK<;m4+Eb?3m@{Pj<HlPV
zgG}=m+Ivig$VjP7EZdPwnr~$WKd054_O@q2CLJSn$dp#n`yD;_9Dg~!Tb(1n-_n#Q
zbR68%(t5A;y$}?k^wujC&PF-J>p>Gro}*)j%5+6|uL%jNkY{fP)U^6vVM4W`3)#Qi
z@OrgdOXBs6Lai8fspWd4_X?CcUvG>?p`J$--voUqsrQ1twWGEq_6Z76N}nAIVg9D$
zy|U(mhvJw=g^+J;6GG{$lVo$Y_bZ;M5N);wE$Z2g$$Krz<*T=IjcQW}RjS@mDi*Js
z>)!jl&F!mG+bxg&-f(4Fhk3Mt74J3m_Ff@!=W(hBx2b10L*kogAaX4Szv<{z*se?q
zQG1SWI&!l2mZ;D~jALyLg#3^1pHyff`m}`2wK1l!UnP9S81zZzyW8I@c`09gli5sN
zydJ$p9;MYyq4t%1bz>pc&c51OYo%1N4D=VXO&UF0hDkh$2Ey&+z!$Zdig2^E55q%%
zLQ7=hc&~Vs_QAI@V-;HK$MOE{YWiyFTJ2pNrkcM}@m8%iAr!GgccaJGD=KuLHq<tt
zLCq}J_ZF{G8EP7IXMW~YTvMqIWv1G=Nqq``QE49PoF~)oQsR@wmq+O+DpafUt3%t~
zZ)*$Fu<RWb=um-Lqb^Ke@4C0G4Z6?{cdtfI>qkPo9(2Kf*9Z6Lm@6uHD+Fa|rw93~
z&hdWX8kC_8_pMmCI%>`0?Vt?4)FUDeKYJozg)aDFap`I=$|p6bf>}?QLYAh`p9WQM
zA6XJ(sFrFGp)u6KrkjumyqfFXdm*TU`{qXH>>e{^@g%52Pl+z6OpkNk8!ju98HJlv
zdKQtcK^b~(DPq=I>ihLJC_^uE8bj(<`gp(I24(2gBT2s8Iv`>d`j<l4A1u~;@b!A`
z%q-GKBBZwY<=Q3Jj`u?S;LaYSav{>JT?j!P%*}VQz1Qnd2lK;SZ1eRB&)-q4Z$63E
zq0dUib4MWp-A?P!R^mdT;VS-K2nx~MIrHUo{?|YB;bTwVN49;Oes;Y7*>lftem0KN
z&)z?D5IZP2mvLIT_or{r==)mLka1uBe&I$K{d3}cxE*^h!(DatPH`rDkKfzk!EN=V
zqK5t)%hkLUVgxX&t17VoE9yy%07jZ6gbtBZ3<dx#CuW&z9R=pVc+kT^hIVdFJT86@
zIxrse^I8KDNwW)~$QRw+Rlc1s#Cvs^Oc-rOXqP=^7wRyXF#6lk`?*UKerz&d^nk0x
zfjz`|os0)Pyr8O9nas|}7T3S&UJj8_%m9<@$b66$p>&hEf%y_prq|rW%TXEXEX=e$
z8J;53P6xHYgPH@{;A=9f0->M|dFB;oA!tvg(2XMi1V2hl;#waHeK}4DLZXtpGnA0h
zQA4U3-q4MbiTzDSU<huF2ywWxp6@j&9ibK$hQ*VuCX&;1&`5Yj%9Zz^%1o_%n2A{<
zd+vFP<USpNG_DwznXt!{VhvANqpvk{5?4v38w4BOC=n&HludxADZs`tXNvSkS<Dn*
z<IKyXAP;nve{Y*pisZ4T5^!EonRg=G=ox2XY-EQkhQeJL6s#3w>Qu@hrJxzDr<NI(
zd&(x4kZFTQ9ZWmjU3a-#kvF(qrj*CAB0x$xBE^w%SPegvVhss8`e#+@lUpc>LNjyl
z*yCWR*gV!0OGw!9bENI>H^dU=$R1`qYGHw51&KS_g1qNRDyy}iX1E27YED{E(0d^&
zhNo-CsRlHKzfVLSJwaxY=ix#ZQGFuvxbpnd3%b=6FG%RI)tu|83Q|SZpPtwwey)C*
zKmAhJh9}BMvnqaBKmAfD)e}#o$q>J^Prp<v)<6AHoVoHT3;4azttU)~UkcSAHaKsR
zhD1Pc-2RdW_V$-d=x%?>c>ng7w9~i0q}RUvB?~~ezr<0y%heL0ySwBs5wpv;zf7OL
zNc}Q@S|#<%@@eJOFYBk>RKIMWG(`Q<K53o$W&fnf>X+l3CacrYJ|)!Z#M$xbm*Nxy
zJ-fFIfXwc#4S=$H3kG=X-YNnVySKDJ!tSj%;jdQQfiY`X7`H0f68~ytj)<;3(NoXj
z`LZ6!y@x`zi1i@?mi+H$CCB6VED9`%5SR;9=DDsu!-UQd1M|S}m`15SR4E$AanzYc
z1bOpN;Tl1(Iy^#wGaqFr1V0f5bJx?NoYPb)L=>zXvBPc}rV8;oQ{)xnB1&ErimW~g
zdf_?3!D#JRh@#L7fMou|85rkWSco_cgMQKz_d=oBm0A!%^IX@+x;Pf`KztT4v{Fk6
zAkj5T?G-_^x@vsE9Pr#<J&Sr#JVrB0jYE_t(ulHZOT>bjtahdm@Th+nOI5WU0+~+)
z(u$|I0fcxSAQyuHuZR98G$_kQ(O~30xfaDWLxsr%)BG@zPvWPgDr|yanw5olQmQGv
zAec55KFA`ouck`xh^AR9mEehG8=_2+h^P5Ct!m5D4A!iUJ^{6~h+}v`Pb36joQSAp
zxAPr)HT-M}FftKS^JKgbpigO??)O52rn9n6n2uxuXHEpwTzd|pkydjP#jZ?HZL#5U
zyk8qaEiyqh_gIB$;VEHJToi(8tKiiFnYAS9pP8Uqwp<1_tGA^1Kg84yD+h}yOGs>1
zCZ^^dA+cJ&lu3BUOiay<MJI1>xjBJYWnyY>aueUMwv@ysXJTp|l@z+iT)K%2J`+=0
zc+iNNW^0F7cw%b3<r!o$j|K!EF$aOKS>`79aj0r~Ca89JU=sLPNlBozIZ!n>eZ<Fn
zLk_jeDe%^k3E)jTij*SWT8<tBRkw@6(&RwZmZ>34pmjlF$OP4jxfX?A%~L*#s&O2X
zme4#76XcmpP|X$N2uhwiqap}m1l4NFDL~q!C{8(tX4IerSuqo#NzTF4$$bQJ+N&Z4
z6I5$8C7u&^M~cCgBgSw~K$N95#ZDxq))I*p9ypj{@)1$<li%q|Y@HY(6jZ)ds09{m
zNz|cpQ2EMHjH@@sA-6ZkTdfxAdUNX`Ua*`n_)Mba;s^_jJD0%VM+w63Dn}}+=DB<u
zNTF}9AVTC4T5*gNC3gP@>RCi|RxLK_<ykUN$>=kWyk=x|?je;FQH0SF_p5(!Y~M>k
zH4YDldGc)xQIO4K^-WhNu7#Og3Z^8B2#=*0HWqp8tyB$1;(H9mm~J{mXq*Y-&BKFt
z62N@trZ~d^>D8XeCUJ*QMZlE_@A;-C8X5N@CL-2cBgmL3C{xS+Dk-wT>*?@&m?P~p
zAwb{Y7TdM3d!g`z1IO%x<-TNHQSdXNK@Vr<!NfBq&!U7Bb))x0^PZ|Jlwv~DX!M@b
zX*DF*nDF6rTS~|8vABK~jfUrfeAZG8Wi$vYdU|lsua4ZiU_xa=jNPposZhR+O?m!+
z8$A%j!XK6nrMyHQS9QNoXnGJUga{O;qcAY3s}iK7n3%L#xfauHu!{Rh_-p;aIm4NJ
z9JRMnWc)3LZgAa3DeC-_^0x>dGeDEtq!fdUr5W7gy84fV6f;&27#Ib4<djsG0eOEZ
z<*=c?!$rV-nasaD+~G4jZY!A=Ql$R5-jPXMi!C7Qy%d?Co{TUK@~pJVXF)gIVOD~K
zZA{VRk}Z-}tE@<_b0#=6nb@aw58Ii)x2D(`Ip}}>uFP56oGNGy`rk_E2(!9hP<u@5
z)2-MHkJmgIRnH=p;n7Kp@MKiMam~a&JxFL|BF{7hM3Yb8r$3B&<m_D_V>!^zlna3!
zPcX6yG<xK$C6PVi|92B`OD6j15mO_$*cZ20EFsa)6}g6Ub<;1{(m4o(p4-wudC(!F
z<bXfjPX<$X)suw~HN#U3dgP@}D%=h9(^dR9WhPzOc%q-5m~e|ls1o>~5n4Z}yOxh6
zsAD;Jgzgt9<cCWIH9;gyi9x(&iRosdpVd8U4QFzw;Dq33_47is#TE-wSf`*8juBwG
zAIPjCf5M;jScxFCY0j$hT*99o;FdsJtjV03@TX_gGosyNs)#1|geA2|3f)JDB1R_u
zS^cyV$#fl*2QoN?a~u{3d{?fY_^0nyCv(iTeX8?F0My^;v2`E2wL(eJ5Jdpg-FCn_
z`N$%=E5tutml&DkMS&DDj6O?Gf!ezv6^6PH{Y)#3#`?{CDAHpg{OKW9VsXp5Yz-s&
z*_W<HpnEh?<|{{3OFVcadvQfy>IIpYBu{6kf^OdA8#4TKTf`mq19FI*x&-=JtaAxh
zBau+|LiBS%rc4$}^2A&;3=;h`%bCI5>VOmROd<Md<49cj?vazgTME(7#S{y;%AKq*
zpM~h>Ts<1m0N;y<oeI%U58;hGKN~|)+e)CHV}=9r3^og(s|2U;a7&xHhO4JmNHP4(
zIWt`t?pTD2EYZe1j@lwY_LNY37vWDol%y1zpGZMCD<}BVEg|!?<|&41TZL*QcUJU~
zM>9psEQCMPoZ(E|P^$pB5dU-o90uT+t*J&&0-*C)=`EGlGepr+N(eONa|`rbfT)mS
z(d4k$WKX2B=sGVs%I}tlXN(2=sqYGRk`wFHsbm3l6=I;P1tS`otA~>B9daQCI@Z5P
zl{iLMi%}x}^t75(3D0OmYEp=Sy3y>6P8J11S*Q|F*NI@^S+A<J6k?#=vk`_2o(4!O
zPYg6K2#;sdb4vMLG5WxL64SdPd;JPQ&|FvZCllm41!i3cgZkM$5yx}Mg0fqJ!B|i1
z)@1&+Vhss{x;31{tXFT7$Y=^-&{V7Opscofk&TyNIa-V18;3pms^3cm75UL%ikzz!
z!K5jKLB~h8DE#ZACG@=%b>lb=j$&Da0Z|1h!HRTCM%|d^!LQIm!k{aKXK8G8tf<8x
zN&Q%j*o>`nRbfL5)o^DX<dLRYw@P$7FYX6bK6m+sL_rq`JTT!lhgyt4K|P4%Q63(z
z2*P<G3hL2sk21Vxt@2qk8y<M^psaF>iA^R9>KR^e5`05U5d8~rP*>jQK6S&>MOIT<
z1RFEah`Rf$a>fG#(ZiGE8i#VJ^;;?8p#7MY)gAYFGDHa+v_Go+PZQ-nS%u}%`|K%7
zAO^Em(aupU(5~4TDlb}xT6yB2{&zq4tIr5vnkeiR;-LO|rwKO;!&Yw?!*q^HS80n<
zBZQ*2C5MoQ<V|@>!k~U86M^;NxslLa!k~V%VqVRxqblb`7<846sPU@?BJje}BX>O-
zqoL+ICx#^z;-GGxJEK=yl|Lm#tKk8PooaZB{#2q7dbZ4n(&HL|@D#$J?oW+Ka&}`S
zcqfH8sI?v)R(|-C+T$KZ!|i$u_nPwf69+A)K3k6qg$fb`bz9$Z5Rxn@q=6u4ZT?lX
zx_R}L3n}WwXff<&F@IFBcH)2@5q9~3QJHJ>QTrPPi)j%U)uUp1#tC*=v9C&nP884@
z{ny=9GpWUho~L6(H{6kna$LayZO17}wngI;QbfB}!y}JYZl>Jb83r9JblIw~si{2C
zQ9Tkn?-pVprdt%^pdL&{dCdF|0?{ndQ{78oJY~&2Q&QnfYy_DhO;wpFfrFZ*aCc@h
z`#%Apz14tEr)pj<0fequb~I{kL6jZ_5j0hv6OTZL3gZI^O^dQaAk?O4ye-jQ?Ezj;
zYE}d$2J{3Fx&Sp=sB~13p41Z(I$O-tc<?BM6tU3WS<YC_PUKIOP^d52sk^$DDOik^
zP^i_C$>#PW*+ueSiG?nDYs_NwxJ@9?m00Lll@FG7-Np%&tP%^gam)yW7AZ*#VImfq
z>`~mp8m1-)A(dF@vb<53oQkeig9tiG4`yLoWp5!xj>gLAV&YS4g5X*M3Z18>@$qo#
zLW)r6XoFIon;)XYSW`F@k9LX3mBn8XQpCGF2aQn??iqwbsWHy+u;>lWt|h`~R6?Q0
z=%?z*v?^k?N+@)CQdCb-d{)EF2!+ly0E*w`ajTj-Mkq9wBPKviPo|WuAr`vEu12ud
zQx_0VB^El`i7T{5V#+t9ZkT6KG}pf8Y6M#jnB4tA1OSgH@x2s5jia9TtBG=4B^25Z
z4+g^vjVz*}8g$TAwP$wHYnCratC4z-N<&^fYC?)u!$XY|EAf!eA{II<2c34c!>jKK
zEY!~vm3MI<ltK{;O|J9gj~7V@sf0rFc}{WrNWtDq)p%59{^Tm11xQv2h30&uQ$s=<
zYG_`GFti@j__PQ{YD^*FE)NY;B(AcjqY?^r{~zSD?0L0_H7cP{H|vp2num-cwXTFh
zJs%I0%wtkD+_pwzcgu;Sm6cekl|L~;ZH`!tF4eF`u#raCYhMoehB2^Xjuw#osDdz1
z0}6HjO0Vo9YG6kt6zWS+V=CvEDgmg3Ld(h<AeB7#Qr?SDX!gU!bZ7x)0@bL*LfcWJ
zfw9k_1`AhWq2<8>Wdu;F3fPE+nkyaw@Ab0k4T*(jYeC_0<E<KgDzVU>SN4uarK%P_
zdd@u@inhmeBtaLdghJ~`fn1LvtC}^&Ke{7ljW^9z02ES0HI6iM6b(&=@-5h1tFMxP
zcTvD_B^2ss@>J9~)Tr}HBy_0)EtDVQEGCguI~CVDxe$wfCeX=BBy>#>iYY&Rje`<W
z)C|upW5Q=zbxk1^T;Y1ey!^H}wnB>Ru55#dyeo1Ob=Mk5XdM=*ygNX_x2`b_a?F$E
zUA{qm7u(^jCc+_}|C>tKh=s1fdI4O!T@yklDAW_XC_<;IUNE50a=Htkjj9e;AfdBm
zl21qW^CK(`k<i6Tj{Lt2H3qN}3C(L#63<Ci(;X|3(B3RaVcAnWfojx1Lf!2|#+%p3
zFCi6(*EkXJoAmwxgnIr&48N@X7Me>ebhW53oLn^*!JDpug|0Lq;P@5(3Mp1kY-K~x
zT;F0*2dTtDb3er=ZDDJ|6cP+IH#IY=T~!t2E5T6zk`eP1-KHt1A;3`2E*MXCE9!QI
z8jR3!f;IfBW>!)Wg^m==>Ha`r-%ADJbt=f`HCs@e6M~_uuOo)(dY&lA8kJzE`=C6c
z9#@*$WrCqCEvi4`uB5uHYLG&04cBD+U#jv#(Gx$G_hvF=MWG=CLvxQ>vL}4%_!A0s
zWeCV{^)L$=`jT_0%fBg$IzuH8+EWaftZR(6njX#o)E9!_gj=+sg2G^gdSnt@w|uB!
z7%k>ZHnVUG*;IRGBM`bKn${=@uO2EP6+q~5s#>)n@`XkqboCR&NZF&R9=Apyw3iyA
z9M()sLE&jfK;%bAEpSrJIggh3e%6e%f><FHxycFO&0{K(b|VnFJb%2Q=d%KIX~!uy
zDHeEK8G^9hh=i`b8`|oU4mEVM#hA%nB2p`w9N&n9wlxbdj$~EW4YX*9U)+gkr#%Fu
z*#Zb%C|*GS>z)H4MIiJ+)Px~)vnmRPjX>y{vq`jjjl~f#Ln9FCCcTwYmZ9oaEn4E;
zxbP&8u1IT*IOrlKksdQm-2&5s5!z>G^OKw3Bm)0N7}R<>-FMNaY7=UNLESvf=$Tsg
z)Ck3hj`&ieyyH>86l8&x10pZcCg>kkl@bOFn#(+2j-aaQE#^$7HAsZPNmp%WEe1`_
zMsN4H1x1`K!k~E(_+r9BQW!(ar@C4vS17H<II$RnLAxg=Ie^-SVSFzYm)!Ijb6MI{
z?c*)l;%APDOv!o|W$Q*9)K-rV0qD8lI3X2AqqF{Gp23Pdtq}&D?zmXBE*{;ftJDaC
z7SB@of@xNDB#DB$P0TU0%;OsYOtiS`CZ$Yv+&qpVvb#nUG}jqM&HYgqS#_(Yx>_Tr
zW)+Ck8wLvM(SACig=&ObtAS^@Ut|E4M9|fUf%druf-{0Qg>*M!pbPYj>phMmsi2D(
z=(;$IjeD*yN#3UtoWBvR9iBQIg1y(GD?Y7B6-1x28sXfCfiAFw$ccxuS>#TwMrLv(
zB3-U9RXMH`23n(b>dr&}_>B;#$0o!jikw*3q9wkj06<r+p<E;Z(BbDcT1bu}UylIj
zY!(6XdO@+n1VCLY5)t(@hPpth1sBwh2+@1Dq*Ks@8v)SO-Wum|f#d2~F~TiHk9A&S
z`h*7}09w|pY(~iQQHXvk6+Q8``bU{ARMj!rh=8uyhLMRE)rHf73fg>QgIuid10n$G
zac(Ah=NWHSkz`Oomw9IvWJeKrbqfGA&1jAB*R2A4YS9wETF-*8GODP6w%~$#xDaKo
z+*JQlBLG@^$~1*zF>1u&4*>Lt$u^c00iqHA9Qmj*&cP3fiqnXH`tA%4sp!3{>OzZY
zprwxhK+J~vDgvPE9<w0s`U@)0-y>=D2%g_n)jcSU0BBwPV+?iEP_u1Xw8W1dq|V_d
zMlO7`ouoXY#$}2%(N0v*9^7Yh-4&F-Mg-Jj7~_%j2)3xap9rYOkuh~|MGK;=(};l9
z#{efLG+Ci{jR>eMeP?XqW=BO&L_imlAzHe}<1W|tQZ)=z^p99K`B~ACRE*nIr@T~-
z_-8+AjbRC+Rpo<%3|f8ViTKZ{SCBQ6Gp_47zw}(hKUeEBLDQa0ovnaB*VTkff)+Ph
zyddGvZbz8vvHm24s2A?uqQZ3?T}8S?Kl`a`XMqOttAac}d)(Y`$f!Ti&(*{o4R~4I
zanRz9o!lc4U-$J2qI#Prlq;ykZh(_g++c#b|4o7S*Q%g`69Afyn7HW{URVq}zO1vl
zJ5K7Bxg#>xU}ryOUke$!lEug5$*TDfp@{|l*-o=dR(r6xZIAG0UDfS?35S~QXM{g(
z9`&TSxd;zwam$YD4~KQ-rijlLG|*WFhmWp#CnDgoxMXL{M4sB}N>X1HLmzwe`MHiX
zbzfo7KvxfJTyogey>UkHv#(Ss$`O8ggkl8v>Dt72Ygs`7>lne$g{CtF$}=a?17bu!
zdu};y_&cnLnAJ`l@eeag%vAM&SaihuE1sGxvT`LB13}M20h?mq+i4u=tn&mP4-v5%
z!B3BKXN<NuhGO3t(N9mjqAAO@L^WkuG{i5Ynw`k*WYv|PClY9`0m4;zv9RTnW}Gh1
zp4Nr=G@_rjW-Ae&^+PS{??&{qk1=RIR~wD`EM}~(`@D{(`C15U(E|MJYknS4ovEJ{
zceYsz4%i%7K=2kM&|?}20^RMdNVhCVpyde6)DKq@p4Etc`m#qka?MLr1}f0cQjHLI
z_sm3KNEQw8C5^Z~sLS~UM)cD&j1h5AQ@4T|(a+*a$b7JjrWz$JF8Us&#H|v&si4&Y
z{yciXE#^6Z2s5li`TgWgQdVpUBl=m_UE0B-%j#MwBl_7^TEZNtJt{TtrJ~GQT3o<z
zOjYT(;DDal+-?@9x|lZF;afV`rqa?-9B?E4xn?NGHD$A!zzL1`XG`mTOJX!@imQ;K
zJE@NgGM;PbsY6q5NOzJ?mssR7raH;N0i8XFe(wC`CI`=N<S6Ny#AvLAKgs!oJspRN
z8Cpadr^?-GmJ}^k7WWI~F-{fuUIn?uf&$tt#kB*A+#<HCh0$m+MW?JOVM;0{kCzma
zZB_`S-jFe9$^mkFo}!>a3kWn%0zzv7wz$B?h=4BMIL}F$Luxz`P|uD#>llm7t!z9I
z(7M1KW>2dbNxUHuP|v+5`>V4jt)gUVgh0(#EjpzSlb#{E;XR>?F<R2!1q0M-Vy()p
zz3P)T3!7n~80(5xbw@V=(9%m~u(p~_)TQVFfVSuxUGsj#oD{RDzgx_hUK6_oQfMav
zXv)VaK~_9uiyOh$-4Yg-Mw<Az4{08aZrqQIy3*N*fVxz$9@mY$%2)>lbWO53`SGc;
z6C$9VV9)54UTCH`Ccyzs=UMEo8Y<h3i@{URrxB^S%9Rh^ct4RPdsf2>EFjSKXzj(b
zd<lhpiiY^|ATA(_&uV<81qn3u#DI6rI##Pe2-IbakV{QfLAw?giyyg;K*xJikztTP
zM~b_<tADSc2w8N*KbV=+jjRge78qzPr)#TiCPB+Kf}m^uGQ*nuxEn-Boo2Z;>S6A4
zD%}VW)RXHNLo$+@ykS8CT~xi08bvfPTTBLZe?>}{>!hL;TcDtiQ858%O59~e7&=Rw
zuTfQw7bs}X78BBEQP-PV+%w+G5sxz2VPV8Ui^s+!O!=u+<V+(Dx^B8Y<#@9yU}%2I
zT?2M0>N;N|4%+Mii3gk{m^&6YXge4Ej>q-&@1%Nk#C!4{aZNIHzgdrt_%b6VFN@Cn
z{wQ}Mp{~4z8A|Cn34o#p61qkfM4h`fVK(}4G8>t#qrON(M0uT1sP9jhdH1_j7}0*5
zTuP1R_S)1<Q9UjkUl(%|YpABiZ}hkvDF=n5uSxjtk5?xa>iTM@lKRMkblQUmnvN7x
zD!M6s3LdBjuP0W=p>F8vao@NbfN)+P&8P3BB0)Lz-j)6cn%_&&YIsaCBD-!)0A8I?
z=xL(0+g!zD=mbK?g5&vqtz=QB=>de6N8>E?J;~RLX~L~A(&+Lgh8~xVy8)&$JqG9r
zZ4V&y$bmqu<{eS5?k6C$))ax^RF{?YxERSjT-1^Bg1d!Obi-S~r*3oAT?{>LMw%_3
z#=mAYCAkL>+Iyj$DYd9pt{(01#ZLVTQx4wkL_*!O#+5~VUHl@>R@^t9%IxRLu1FgC
zsU6;G%-wr5bHA4g9%wrShOWmVXXpWhwp=0-T77q7;ZL_CS&V=6JYa~*ZYL1x5&02p
z5RY0!IkOW8^>>{tTdkQ#0>$s;RB#<}BV8X^u13IJIiI>zvI(kH4<xkK5&pO~<;9~L
zzSR?tX?776_GpGLx%IQ_7tKqZK&Xd=2V+UMG)<sgoj_=v>tFPCBdHZ65L(6&Gf3C1
z4{9-LXhuEpgw_qSLZ4zTXt&&=@|V@U54{H3HEWo)rn)OTaZp#f&cdH3PpYie>p99G
zu<lDylr5~0oRqk4V_nWCK)fEk@MSc5uDq@+63+@C^faKx6E0O_>~XjH8pFcfT4Rib
z5Ea8}^ujJ5B(jViFzA|88bHWUSH5+^psN)jlBd*~3b_b_Hs9p9U^lJCDIpamqn+mN
zC7GM_fI&we^<)ZVG=5@&wsz{UTJyRf^@ksp&`*E*_UrS{fBN?G&%b{6>remt?Z@xa
z8U)L~{U3k->0f{O%g^8N_q#6q=kf7h$)DyQ_MiFVUV$Ip%A^mO^dYkh?UGruzTV5^
z51GdU((~55`zMtTsr-CW|B$gy>-8#AKfT>!0@*_-DWUcuG(Lpp^OMRa4DD6MK4i-C
z<;I6h`_vo$D$_qd=R;&&a`;|ke2BEC2tH@3$IRy%Jhyda;2#f4YFm%bQY*9Aka}vv
zDA?KjT!^IJFg+Dw9f~FPsBkT@&&|*mv8P6)=hG&Z@KZE#k%CS<6=`<7qWrS<`B{(b
z>aq4kKJ2L%^SO)<;?Dh+rT$5s9$3>us>!4H)Q-m&u04agw@=iHix?DSK2J$6cv@G7
z`1rgce41X7{8W*T1x!yi@`l_~M<DhHa33F6l#XOr4e0R!jqJ(<WGG38*z;+1s2#{p
zEy-LHY+RB{X`jUmXS9E+5nRNcTJn6y`TVjx<T^r0o@VFKn)>*%E}!*OlEQVwu{o4(
zm8X)F0W*S^oN7S|yh?wn@}tr6@wlwsvOq};Uw1r}YmFEba!)NO+_!<XRL8VDwWK`X
z@^QcK$Jfb4fh|c1atGw31B8=lc*_abBp0)P-h(o?w&1BJl@6dlOzyx_Pbxlb!naT9
zr;pEKHE&5h)ucX6dF3lgsi%@unDROBFtuwHIs%iBuxUd+4Lb5%#|97ZnbmL+d+JEV
zUMH%SI^7j2@?1yw-!hbutR2VZ#o85V6Dm{$aa@E-@*STl(&!W60HkegPZep<tn^&S
zoYm7BObILy41)Z$hKM9%`S%_M9eIjnM5#r(`&M5TGQ<36G3dy^)9{jVw;Q|-G_u3C
z4rLHp|16f%mK5C00ZR_ks$F7xDoLgTMm8e7n?Xrvkzo>sitg;GB#oyH`!<wGu>4u9
zU;~=eWP54}!rez5?6D+OZMQwO#GVJBA<HoRZBH#R_%>`@m+_X_=WlC!pVmL0n}+3=
z$HtyY(y`g)`HE>MuWj%(PwUV1kReGwURM7prE`rA4S|VdKqA+pKQ+XjtN195e=NTG
zvR*!mJ)qr(SW{N3*Uz68FIkm~>WD`^r0|M5N$yYmFvbTktTL?Vup*4?+H<c>ugFtH
z3@IY5h|>K&Kfh#UvL}7^VDejVu#q)Lv|+&4)MqM{+H>E^q4sSsY{g<4(ruZ!4XDY}
z0T{A$lab7TA;DW_W+}@4jHjB+r&4AprN#t?eSVrDlCiFA!gwmmb43R62l<LHB!IB6
z9*2As0+Qzo;`P*4&!>tEL?Z>Uk3_y^`YZ;$x{(54Mic%#qID>>n#g^TqCfi2KOBuZ
zqw}dB9brX75F=l*eUgf}UkU*q0ffUSSE<x|>c+$y=BMq^7|uj2@?89ha7pU#1Uv$~
zXzV=e0}XkcX<}i|#ji5(`G~zwkx#+$H>t!Qz{c@}F4D8w_Te)mXmr4c0DJ)UreWWs
zetu1ataoqOKEEY2xmW!(L?a2_W-A{5Kq*csb3qg-ozzGAf5HQBxO0}M-2sq<K>{pf
zmH-^URwR3sAE!)E0@{kSp)%Q!YXY=20o%=)d4ql)@K(aR2qiU4k^s3PDo@t&fy#a*
zfUYPMr0_Ue?x`(!PgEstP-vj8h`LgKT4$3vM*{B3AP*V74Av5GS3`~o6sYO_1MmuO
z@MswSkkcUhQ(Zcr2g4#wbOQ1^o}Y&#N5_W=$m@7+USpasW2i*v75Gd-HK5)U5uhzk
z8_^N7Nl+~je8p<w^Qx>p5PT&<$=Z_MJt#|h*>#=8B>=GP8S6EICQ``&z(UCypk<R7
zK>`Accsn7H?lP4~L|}o5rUEU~>jDTi5#5BX&WE(s0AaBa3D&Gh$Tty%C7@RZ^h__!
zXN6(bsr3aYYzGcipZlKlz5|C%gwTQCuIpZv;Cy)?<Zd1aDE8y`>Erhw56p5SDzhJ`
zHc;H$bU_X}0~|L2$o+hq{8bP-LzI-Bvq^_rX=C77;5+lp6JcYR;5~Og$!sA3m;HFo
z<ADI3B@CPh&EkQmU+Lmp0yaC4QC94Jmud=dHUoLU9(MgaptFw&S|2MzDu8?-@mWCD
zsZeWlL6(*VT0<IvL=sY?rNOI4?j{`!VA{m^4k7(wRVYE28rZ1EtqUJEN~#T@S{lWS
zvRl=WD8O3kY2DLP!nMGZ6TsmtsSF8t?Z^K}z%m}@TNlWgCt({6m|>D91DI`w+=1<v
zh+G0_n^1p9K%k1uiW6Yl#3ZCaQ*~eh;5M<EKv+~3Arhcl=8y@=+2<?buY%AUW5f;C
zhgNaow~zx6uJQ8(1UC^u2VR`Dmon-N&J-|;+@z-V<7H7ZXbZ)p!2y!XZOpc}|D7lu
z_TRAo61Pu4bGaM&*xSZVH-+t}fMT-T4kEg6j2YWuH-b<cgqaC(X4c^ia9zG?#^Jb$
z+B+={Jr$@H62?!!c4-@HW|}804$)mIIjnKfkPhKp;_Cx8PU|Z1UEs;&g=joE4QdXK
z6>`g>p#ea=WZ6^}`Sj@+)Ev|z8H;I;GiY+24xlg&&(Z<_=%wk%h>Y*H1Db>Ln2{(J
z2@)sZy$LXJLGJc>X23;|pzrar8#h4}P+$7Eoc1gSfnO*bjH51$rTH4-l!Hs71z(fz
z0-)_C6rT)nuo)d|ssl$Lz}$?-&8QzCj@<r9y_vA8@NwEy0S0D>11evZ#ok09I1%!M
z<B)=xP;er8Nfwl3lK~25(ttNDl7o{01;eDmqH5|+1`^D~kCY#o_+>!BC)O3VP?o(i
zz~Df@P_L2TL<Sl>pEha|PSj#38;~zSc8vZ$RFznMfn}3`TLv85i6^4`A}wMD9Gu~2
z3ewuD`G5d~69ChadF-Wz0usiNK(eTbBsl<KAjt@&wL{G0;F70-{6uGqnKWD!jB0op
zWi2uw;lQo|3TM6fi3#}YHx^lX$YkSAaIsLGtunF6<l{o$3KyqphAfdAoWn}LrUj8o
z9iZQJ6x5p3aFTLKK|+F}VT~NLT)?i0`zSSs=x~G?_{JMS=2A#B@Qqm$h%+4&S%!R7
zy*SVuh8e(6t4xVADY^jCN}-@U#=wXpmL6NNbOuVCNdQDyPGT?_C~*P1t`hClCXO&M
zd7_NLwTUB4j5wnLplUL*$$*KU24}Dsp%<pTY<^*>S*C6oATc}?$Z`_P&V^ajb01je
z*V_PvA-)6y-b@|}V8lF48D#vT_m3bknJzd@n(2}W62mDLz|vJxT{1!9frF2YuQJ-t
z1c}=P(vopvCP<7578$3lOXCKRI1mO<UP{-i3R5$oZ3x?|OocK~;*SvLv8p)u+GPMH
zPAKCW`&uN2I#)U=yeewCt>_L3XwHPLCSsv-I{*|T$PCt!Bs*o`#2?|<DuDs(Z!(F>
z#EI#LfrT{f`H2%FZ7X1_)h>_!1t%`RLaVHxWa7jGCZ76cdTHpPka{PAHu^<ra6ml(
z65eiJ6lyb=2@_zHg2tGbo57`#yJ+cUGjfNg(YDd3H_&j@dNfLqffHwdZ}j^`N5ytA
zIAkwtg|pYFxFB<@l6aDd6UTNi7nY|OIPvpHMNgsL3uNB#HuS=hfsje`#R*2qTqg^F
zh;!oe$Of0{O^7&>1=bei4iX|B<ewv1(5W{eVzA6IySXG&DR%;W<7G|nUiGOntkZ*@
zp?jAy5MlsC#N2MgU~0f3IenmX-@u1iSKQ+cWx&H3O)Zr%nD*X)hojGjBqzC`M2BPV
zxir#w6CJ+988^os=rERM*IW=BW-A9c3|XH;g2VBNwxu)#huJ<0DC7o`8W*+6c~5Y>
zej}QtZ}g4ea6FNVBUcsR@CTrsemwD`_5K4L1}rssfaS@b`Sp3339Wu!c@^ZzNV)~|
zsW;Pp;{)5<mAMh5dxCKbPOIJv#KV)M^XIE}9i5UQoEc>zJvsENKGg<}lnz4@y9=P<
z96&v~b0mYM9O<$&Br(VyQeeX;Sc*OR`iW$dqyLCK7!q78gonxSh_abl({eDZAxK0;
zm94A5hcj$AL82nDo&tn8NZWe>aREe3GFf5DC&SYMjF_B~(umn9cT+f^0W^k!w5H0`
zy$~b@5SB?OlL%S?NSuK#1<Wr2%|e(MDo3<eSNIBG;>^Wi8B0cf1u$_2#ks;YnskkY
zFfmIRjHD%UQvegk6L~r$v%LT&F3_Bcp3#2ujqH%b;;_W4yUzg=f0SPmaEIH9TLDa*
zCeb1S)B1_9Ieb+>s8yn9B~x?wsx-%P9|I<a`;X$FepULa`LZ~=s9Z=R2Fy?ih)B?<
z5GIEIuZg-UH3u;9M@RW`a`YWHf((s;p&}Mv!_S2vVB!Q$DYrwj!wTm)%u7nFeFt#j
z%<3?REV`^*fD>nwrlLEvNGk`NIO;u>-bxF$7s0|VEeVMh@`(@95qLWE;!tzw=1@P?
z2bp*=BDn&<s7gLc0bZOzWU1_i(pHXmF_b(?8ZzcAz>72R{>O~M$2WF8ngg1{=4?Cm
zp2*S^P6t)4%k3au%(gU8pfp>n058tqz*QoYvY=gv7l*Nef4td_x4_?>AbEbI2ko5>
z;>DLT>WyGygp7S;NTxk9@L~#9lCETlsgPKVSe}lxO7d(0U>tROb`)se(Fo!ouO>#R
zeFp(!9%Q1TvQ49K1_TJg>@qY7ikFxIfhQ88z7a%1&HxFo+GH7~a1ulyTo5#=0Av<N
z@IWe?9<%f6t#;j9K*ltWFded*QV1DSkabj@1_CmUc6w0KOrl%`ka0o9sKHy^M94<X
zVZ#)TmE;N(qvoK4iLDGeV+Cq_qQlTw>BXVVVMqqkA?qTAz%hoFkjtn^2BlvkWW=i`
zzp+zuU>-rAD>@_taLfRykaw#!2f%Tmo7+Sl2pqFW1!Hxyk3fzyNI#W=vQe^dW(1ni
z_{1BJ4D6W3>QwuYHizJG2*Pw|9Dv+nRySdDOuGP}$6TBS$J(^!06oqi(N)9%P0m*+
z<Q9`aPsl<q4&dX$fq_IGw5|qx{90|gajb)Q&i79=4@5c%$(BLIVGM|KtPKFE#ToPl
zAeKeKfMrl|Fp`6{D($R@9<zcEknCo_9?)aHDLRCT_Q!yaPs1VTa`c-rCkJ2wEWb%K
zw~$**?jBmin&g)j;>Qqdk>|)m75MSB+AI$h@#CQSav+@+q_4u+0JwJdjq^pY5b2Qd
zaV5F<i;|<-jtT@B$a4%Yl+FB=b0)YplMhrHR{<c$Zg8-OJpL5`GLTMA43e8z2_Jtk
zu0Rg@JM2|(uWnp9ZGtUnoGhr9l!Hkw10nTnL88akf}9ovdW@-r9Tf2{d!Q=7<7+Uk
z%gvSGamFX2&t6x?YjBM5iF?J$O7IwZS|$q}`iYoxga?Lx%OQ$EF}_v~<@S?e9D=Nl
z>fHdJg57#s#rR5w@fQ!2OGD_G7*~w>ks}|;FphHUR{6gYI{u;nte^PQn|j?0Ek_d0
zZyV}bi5vp}&XXE0cM-@j+Ael?KVQ^lk26vM9A~u7o+hB`!Kw2i$c7X>I+Y0(8w|kw
zk>#;kXm8;9Ib~XAVimygWfHkA$X4=;zo@HfK~_1T;W5=-`eES46^U5KC+bA37Q4JE
zpC}z8aO30hg<6cHKPV~-hZ5kfWEm5sLaVkeRn|)EkNqrUiEBZqP0SOf?UzS`s4+%S
z6aX=rNmt1-zLX7$tW?$4`M_n*5fd{8y4moBU2g^_1fv>X*>5YU!j&9jPFrTzq(qD=
zFymZVreGhGR5)P9g;oQVG0pX_!7+a2QR}*KjbRipaC^-@H8A5#*-%cQsl<$p_{~-$
zOl{Pg3ob6J@s*hIrT0o#<10zVmok3UhJ!TYOMhUwc~xo-_L0^2n^m2!PuwdSRAR=k
zI5BWT(lIKhQLy(4iGP!0b}KPsCVm`RDbdYJ%$ODc=HFzhS&135GDcin;x`qTaRy=(
z%`h?#uf&X5G(aA%dF>ULF{jFG;&7GoD1iKM<bo!-R3m^xScFX<@^lb0ZuC{?-O!dC
zm@zB|FLjZ)PYuKv$C&da^%s(Ae8H%7&riKfqu8u(RwBj(42c-Y`ex-c3V4pq3Qi^4
zm=&D8zQoFD6xW)Oti@L%#+52g?<f}sh;eiau+2agxN8g>hN*(4>PZcih;gv0NUG7}
z{$FF9%|7o+!ZA{u2mtl%O+<{Zk>iaZq8t{RKmfgoIY>C>t3p@xxV1{caR_dW>Zk!3
zzZRQr1Sc&HE2`}JlPbq?6kiY(<awM|&Dk0&QDYtjJ;z=kPt2IZE)lJMzRB$>NSlK~
z45s|t_+wzkY&5Dw@U^cZW{g5iRL13yk4nxlxiL^V-L+dekm4e!mAnOJeBq7ADpe!v
zI7Y5)vEv#+V-RZzZ)*s@aVEvVY6Ejec@qcc6JNWqq$O`Lp%|~aH$<TUHZG*`V4AfK
z<s0WxU@kR>&C44yh#E8g<C5z4oG-f{u1b>QTigjpE*7~TTJW_jzRAaKK#d~<gge&F
zq7A6=HRsf3ya6>XKn@zPu`Z*dM#?d`kp@>~vYyfa8)vqD?UA?|DaX9s02r618@0G6
zj#)0Ou^jT#NIAYR6>kKA8yAF*?Aq5f&PLprZN|8jvPz`70XGi&&swu|jx8oruw590
zLrEKJ0FE<rPSUDnBG(8Uvn76y-_l4qhBXfMm)2Dx$Lt;01LPW!V^*mN0cbN$<d`EZ
zLQpDsTp$Od3PeU<ywXTHzBJPoeI7|UW+u;GdVOmsFOlOI_p${6G+rauh*rXnORjP&
zOvniy;Z>V7j~B{u(2e9}0j<#HKmias>bCzz@c24)QBoWmDaVZoIpZ;TIshKWY!a%R
z{zibu1;MJZI4S|MM({YucyIv{J7}aFL(nk0yvv@fR%vsf0AQTzD?c0IV>a-k>!jY?
zR7RTv!Dw@kDo6Mj5g<t%P2$dtl;g`79o<gf2p_Yvh6stwtQ+9tQ_Kk^*D)t4$FVpF
zS8krj2AS9Cc^Z;ygpcWw_prQ1$}uLt1mjdk9e|HdoGKb*=^xuwbJ&p~PY2-Rit(w2
zJon~w5I+8b{wFnulw;0A<E^pU1#n6QDso83WeuniJSK;acNa*4V*_|xVg~9Ksk-qB
zI*$6|JR}*95j*DY<4tewQ;ZQ6m)<c+#cRf_>N0*ydmQqO36Ib=%BHi%DHSj{^f)*6
zpV)CA0Qg49#cRPgzR*o26|(_5{-SZ<Mvw;QG8IL;W1`0ptWoEXM<WJRybj|qosj`O
z&R~C@#%@ZZ3iOzM`~wzVPt+<Gchr%KN#3|#RT!L03ZO4iZA6bLNTRBaa)}<t<UTel
z$yX)cn221k4&<r^-<ZRV7&+)CGRS%D<SLS=+{ia(SVe1m^Tc*};^yL9dK^G=YLYqF
zfF4Jli-EnmIidkQ4(y0MM>-w@dRzcIG+xXtDLHL2JiZiVG|WZ9F-JEdbZk20m`uq@
zSzxELRDih04wwuqfNA)M=y7J<f%6chB`11Jl_OtC2XaJ@X&ylWTOLpezS^9Ms+`GA
zt`^gb(FM%@ah=NpJ?;n{JHlhlJ2K9!z$J!-9YE5`85zfz;}p64jUa8#Gg`rAz$R}q
zFpjK<E;o|u^)13MIfLhT?7b<Y<5!%!%2^l2k;d?j9Q7<I#|G?}gWflX8XM8$AUVTV
zNhYrWKF$PI_9jjl#~Mcjz*Yryj1BPd^;Yd0xeHT$?<PwFdW?R9O@_OXa?INeaWXU)
z-v}NDJ9<+P_J$TNNX}Z2<k8pZL7E+H1dl`Ewusyoq+{}`k1autHAWHOv^etk6Fd&;
zc;6F*;*iX@ceA~bbWF<m7CqWXI%XWdN369>#ko>>wIG6HqN7`6Wdn4aVT(6e&h`cA
zm}?`=2B715{X!`R<e21GYMV3~WE_*nyGQ>w;Kl_8wZrsxiBlPIV+b0mD!OuHz>OO!
zN1ZL4GK4eW#swZc!W(_~fg2YjsxfF-PUAD+#uRKZkVgxW$VKkp7ForJ8(+A?H-a&$
z;xbHAM;pM6D;OXK3b2lEjks|P<k^~XV?jE8t#RK8vdIA<+#cn?INJC+$Kys2ngb#~
zr!i<orV%&3jB&UVL`nrqRnd*5XOkPRz`HPcH0j7VssgZK&>SW0*ho9(aNAu$4s&A`
z56zJTS>tTu>zu0_LAE)7t+Y3y+JGCMKy}W2mitKDm}AHG?olw(jxUq$?gZJy$r<Ha
z!)lDQV*(C)GiNNO8<Xe^m6Nw;8AnxI?(4Y|gyx{i8TE0=tgx7F%o6a{B@+hdxN;yX
z=n9%1V}y=l#KG1eW+UyGL-{ysUaK5w$JZhCH-eY?_+IVU2pwPO<2Qo52JbR>@Ma$Y
z9e+WPxDjMB&Qku?;6V%G@nu-ejbMFMfIV)l5jsBTJKCNgh{x9}SR`G+2pzNWXm4bt
zbpn8#Rf6i6tT|c`kFOm|(&hy5`1-2yiG+^7;BrWtGhV&bW(ScGI%ez99tqG$Jia!N
zNRFHVI*!6xOe@k)M4W?!yukwKs*`b6#g)q;+c_+V$FIXqbt8ar((&cSz8gV8#}Uk9
zl8-FO8KL7uJPs+6)|?<7UpP6EKWu=G$;oNhN4pWMFM`1zmcwcc&~Zh7T_a`Dv>@x_
zuUrmI=QBXZg_E^nexTkC*c|pOkk2WpZbstqb8VQf%0tx&9A5@G=`ZXt?3iSQO+i?k
z%l$T0QnET}$8d5S9i{0JowVaiB&U0%I+0^CIXK8kCi9)cj!AUh8?M?ptpezH^j6D`
zrG8LvI0+hOLqam0%wyEmT3j0<R~684MUO;_VwKX=ewkO%P^~mskLkpYp{o@+K$A76
zPUi8Yp|i?5cPI0hjk%-`%Km}QJMpgf)W{x*&Vd!YOKY#cwv&0xVO2OCCaWAhjaR|F
z@mQVAW6lnvRn@CX@c4SAj$T!Q#~^bwPAijkyc0aWa%5%b&^he*((7_3$iYf*t9y59
z^)HymTa@Ka=5b>Lz}^F?0C6YYZ|jomyc6#_vR2kdJDJDVi-WWvXI5N_hgHsi>bw*W
ze6`RVZ92*&vjPiHb89+>9bbsxcY>sIfs~00#!V9XJDJB(1Lj<2sQ^Tf$;u^xSXP}o
znaAwQ+N1OK!pw@5b=GpF1ptCvz;&xASaq2pcaE+2VwRVDA}`0|gfxz<l{r9<u@$e#
zqb4l&7<POa=PJA1dN7Y)iQszfWDn*sm3(WMW3Lx)wbw(^<8r*qK<695*I{mK&DS&8
zI+@3O)u0bZT?K+%3&Rx-1CZMR1Q~h*Z>*p8Is&i)uGF`<^|%@Dbzrrg0NFXT0-)38
zl!P9Gj(=M_PbYeOovf<^c@8?h@SOE1*ADa;@n6uRrOpsL1_i*F8|$S3c3gl~M@%I%
z)o%1tKvhWPmvq$*>=-Z(X%)I*u>(4;SW??eID&P2p+`z4XXnHUn((~|z@4mPMt_60
zUoR@i>dcK|9IIZ`S2xu-ky|S&pkpG34Pm3^)ptP0k>jGWt|@0dSjW%(hX<F8qYmIW
z;v&%ax(*rv92aH{u)|H>r`gFl4ss+%PRm{7#0q$~)|lYPUF7X}$Z$L0_^$I50LKmR
zpP?sHlg@i^jxRHAB~`6=Iw>YN*naI6c|jigYCz=G1kfJ9F&pHz8ge>-<G|F~UfKxY
z81N6`X_JiOPS`jihAkRzC*v4;vw3$!=LLBeTD`t9w#SI$*Pa92I?}I<;}|$Cqg&3a
zxZFFWr#N@ctGM>^N;-BYY|L<KS1?}|hYjmeQ|C1--s<G&lkgu4fNVO^ugZc0@*)^V
z-O1NE<Ct{(t<HfS<0{}&_nP@TM;u>S^|Ar112qoT5z0SJ((wjx<I?FG0XR$M;0VI;
zYumXVsy=`l*Ghnky=rP32XW)U5C^fiRGdM^F?)bxn2TN<m>hsV9oTr6u4)iB#yM_a
z@|g^&2Pwywi;=bcAHa=yCldkZCh7PiD8~>4#I2`*4pNT4XvmcN2;4Y&4%v|_D~^K`
zD~L8s0M62o58%c`8v=^ax*BtiF?hltDA~$`xG{*_Cmz3kB7$Syt;PGp^gaSNE(DFX
z%724*<b|rza_BduuVNSv#gWnY;Gkn>xO@FLgRt?XJLXQ1ibJ#s0iXn`2Vmo{jv&_F
zeIrc{`)X+b<lz8pOu=Y!k$vt1uyG~a*f|DRo@26(FP8`D<Y?qebj;3L>8u7}<4Yrt
zzRG6+Hm;qqDqM#Q$OehW*IP~`@pzDU44^vFY8j9X5|7ye2K?v7tP(a3LynYFvOouk
z$Cr}hjRzoX+<7|Kuq+h-uyF(aW4v8alE(&MV>~cnez-}p(%`UT^nmkTog2YQ#eoCh
z0YMSI?m5;*u3n;?LHtiHDpBL#)*UrsTm=Q&o**cIK#mN4yi4S005txJcP@94<0=Nv
zKVp@eCvxZj0y#jO`dZdO(3s|!?pTK$_0{6A>-a_xpz(*HNnmN;TO5GK@c-~sCTY$C
zurVsCiPLH%Z)`Ni#y~iE6lLqk0BQ`*Ia}OxkJI3&3SQ*5*Bmtn8uQ{XT2xv283c`S
z5N&Top);2&Rdh4f;Gl{x+P|bAKx6hd(hf`7@Bn69!BT0!w{BJ@_{IeAx7daw_{JQL
zRQCiqbo6yVw!Y|m#Hb29@z@k(cg$sOj3j>!@{LK1+~dX%j;cVk*@B9t_aC`<BHqL&
zN>$~k3edk<h|v@IMqG_|VQ}0CvTd9Wb*qnKkZ*h)adRU`CJv{nki#YI24Ul9aK`D-
z2@YXnoMQu@qU(T)d}9s)PxPo#0XXQmb33*=xdve4lgf=PL0*kV_-}7|_yBBNqH$o0
zQa8vqCZT3;j?(~ad>uNf$=CzHafJdjXpTt|-ym>&y^{Mz5Sml?#I2zUBlyOzx~jPb
zgM8!5*h$^TF=Eg$r)q4?M;*Ky?|S2$oL4+1H3#3gcd_!|s0xmc4lbTF9R!ZQxZ_fq
zj<_6;EN+|*S;ZRwj$_Qx-gSH<_{Oh;T=Zb20pyqmd2=Gu;HV06<H;M>Do5n_GC4%k
zKPMT-ms?Ww6DN@4I9BA1N(Go4RY4qoZwTZha(pG6-w49yWF#B}M<w}d5;?xmKXm#(
zc|RU4IW<QTP9~9K-sHE}95Fepg1ONiGj0MoE|+QEH-emX{7Q}29QVmt71uhBtQ<@+
z>R4+Wfa8iDmrYwW2^?QWIcnm-OvL{#y-GKNG&vO9V%1Lq#}}%?o!~3sc=JBq3FP>M
z#sJ2VteOerxMF@l<8_s?c04mRhx|5H0JR{BRh*DY=7_8uOd`i&9k)hu&KPwJpTpX*
zELKhuj)_!l6*(uTRa{5wO1C-z95*19r`eHu8{w-k0>m&^%Or3-2^<?O4k>(6kbGle
z+<UVeC;7%-^r~q=Dh{5=0eO=DHwhdEA%}u;A33oC*`p!o)T2BnFUjMn+MCKf3*%!%
za)je$d2|9e4#B-%l?mWD$SRxyEW0XZT$6XXvO=32@{Jjgp{%0mD)T*Zd?(1cqwJ31
z;z&o%i50A??NLrAugN0{z+_&l9Qno(0dTgeepNWD>(!HztvCrCV{tZb)}DZlqjVJY
zQF)NbHzw_9?|RKizA@<v2y-+gZ*tNxsv~Hu?mDgpc3gl}Z*s>b!DDLN-qgX#LC4oI
zu#)C5fgV@#DshLDX|qc7n8%Uz7+H{=9CXY`E+|>j<N!auQh;^O=>&d!YL6v%RK6<k
z<A#n*0|`h^9h@W`ljkyMkL5RV)bX|GEIaw8vFw0V1%9aODiZ*5L(`!V>z1>%CIDo_
z)d`Ng>+qQPG0%S_o%(_OMX)khy;++p3drLq(<9)=7MIp?>ZII8;K#MnkuzJBugZB9
zmkFtwuQ-7ppBUL>4@*@Aetf+N<W7+EQMjBve#GoFIZ)NT%LgY%9e**eQg6pw&AAgK
zmy3M0ty!LvwBx|Yw?=DD&a1f0kJo)%llbw4l65EeN?7m6kGejOoL6y~=dOE4C-Gwz
zk6~8z$m+>?6-K|xZ`6V$tm8alak?x$P2k6&t9zvUN#ZfxBYN_iq^nHg$3UG}29|vX
zljAC`eJ<Jo06wmCav-dl96UP7J3i*?6D13D0zPigaYM|ZX@`@%V{(9^UqvqJd@Vd|
zGF>O&<JxFeaU3OocoIHlOa89ld&SWyIpE_8*r~<nd9^s{0DfFCV9!vs?y~sok{8`!
z-YNUQT#{Djwe3{HIW7q#5ST>(LGnntB#Al5b%N1(^PTNANTQ_VX1gSP)^$5?-nPH)
zCqscdNuoNmuW;#iyFwi*zflrMa*X#xI?!bv;gU}sius<TOG&z<OOg@@UkQzGk`wHb
zNYIhl?MsqQ`buDJa)z->BJ7zLto2UPUcZxr`Xy)1C7(J(V(=cL*abOnoulE|Zh7;v
z^Kw-9nfjT$J}>6AGNV)xj7x%bfgzZiJr^$dR3XMbAi;DAoVy^qJZVc{g@#@rz{(Xf
zsSN;_=G?g?GOni_ks5hjgUh|P>lv`RE_qNciNHBVpb&Jwc~>Y<;0jyQb6gTO2!y>B
z4V(IzG0Wn$5mH~F;gXl$EBekG)g!vhh6eVR-0TYAWqf5I?>BOs+D}?C`FC3L053Nj
z6JryN<lnd?`^yn{?-7$-lBrjH*^^tzSDY}e8a3_zI28GK)q^`pPDN%%9AgVP71<@>
z#bCTT2tyiUbV+CsqmtlL>Zk-TGl7)daE4<o*xEvP>P8VN10ie*+i7nsEeBhWrNWjW
z$x(Jm1VRXBqDXZU@DXa}tsw-(ZbGO^FUF(@+bOZ;bZ|T}0)Ji{p&ON4l7Y}uFb1US
zlLEN8!C4!%_9kj;uU?GtdzS<Nmwc*_A)`9E`5VdCIH-eLsat?t((s+w6yw`!`_3WB
zgY(sqILZ=`OOktv@5J26HRw-DlIadBv^Rd<Z4Y5*s4eMLH`#`zSIL99kv0hco=+Vl
ze5O7sfjqx9yxvOI%QM;Ws`rx<FL(|0UcZY=a$559kReNv1y+|siJhGi$m2AE<dVP;
zzo6Oc(+T*QfzUDc1OY!Yr7~Q6*d=$(B@qbW7Me}wyGvdaX!4miZ;L?aiwhp~(sE=n
zhe86n)C1aFlI(Y+$a|yRT$1#6jua<n>Sk>@H5t$3b(D9Kz=W=&XeArjB`-YYy&Eag
zK_WA!bnUUcU6L(+2xwwgZX`LX3318Zcxaa-SA(R>wke5ln)K<y71E{zX!M7`dS;oM
zk{l0*q#>TEHJ*5MQ0Pg7zFFJ1ZRwf^>5}B7a@g}$UwS%#N%L(x<^*)vD&&%IWJpyy
zk{sPb=aOQIigws!HD52bzLO;32hZdP7Fi2*N$3zq@N7%IHdAblr*=uCWMNHgQ<8)K
zSt}%$Qd<*%(?N-%#_Iqq5uCnEn%3M#mwfHT*_@~2l4z-5|JPpm)+I?(g(NRHypy~%
zRYZwGT9b4zpoX`n|I}wC0i14y@E6bL&D-`DN#nJO`eY}LRlZUqbexdHe2g1O4p!!%
zlf7A`E_s=9x_2q33&NKH5Z~n1yJUG?Ti&oFZ>>oQ;55seorN69%1jC1bc6p4ij<@t
zyCi(sW$>sTTHunbtzH<tcaqSd>lBf@??gOwsps8E0-bIcK5Dc>I&Dp)JV%rDt|Wcg
zh1Myl%PEocd>LMTD@i69`w3yeBpo27%y{V9O>!d%9SSZXCA9@3Kz*GGaVPoO!M-^c
zFeL!gr0MS#S`#np<J{9NuAK{_&dTt16BAG6szO^c{#+8S>^kB@qo|1pb<CC88l3Ku
zP@(H|h&xGyL$6Ln^6gS0K23wbJ-L&7KjmE#nO&0YI=`*!!tFaN91Ll;+Ads@tzKaI
z?*?GOf+o#pi$9+dCuq>Xqb=!H^3{=@B(*8I5TQ3o`!2~UE5DN~r1c#Dbz+jeH)GNz
z>BuO#H7dv@StTPChAe9RogAb=7-Dd3wJjk)9XK=aSB+>U&R~X_j>ccfYfcFW^%u9I
z-${}zM0Nl)K~kb!l1bU6rgtYvy3l3Pyk@l|vZAl7mOII(4l#7=m;j-NvAQH3*(EHN
z1U`@Xju%bn0KvM3l@hP=0|46#LsYHt#yT16fqR9OM1=avIF`g=m!uuy`P^bEx+EuE
zA}Qm%;yXzsWe3x_y}D;2M$Hj9w3>I4uZ1$k7n<mv5-{p(mG-74lL%4+g6;61{l@bG
zq^5V+9O;%4r)*qjY)Z0oN&u<9AjI5BzA}aaR+4n*lz6dU08+LoX)ltS9cU>5q_$uK
zb3gT2=~p{M2H4Fr>C0ZniRwNZ&jZ=nLl({+Whjv@eZ3s|P7;Hm*fP0SVoSiNzv{Hm
zMl%T0uPsx0_LWO=Rtt{j-qfs=#%o@`OS4Sl)s^km>r;@XIXDkSQ<A1r0!DqIM%~EG
zS0iMcN2$wti3m07K!(t*-(=WCsDI=1+>}V1=4>$|GIaBu&>+@im>_AoS^`4-0f3}^
zqFdtV4NkOSnxhE~X;OnOuKrFEMu>30RzGt}WKUCRk<{yJa8l;<ji^PFw;?S_20(3S
zXE+TtmfM*DP)Ga~%~w)|G6Cu@*#1&&GXUy_aY4IGw|u<D)4R;YOn{m+oJ|5xCO{qe
z5nH!z*7h|g+vT+9<C>H0@o+K#YD3}k#6#7)5+j^nd8jveU`~vuU(c8hr!z-!@O18t
zVs=UTu`2~yp6h%ePqRhghCH2vJbf7)eD_SK5WjQ#Z3niKbG7#fJQ?^j-*&grAQPV^
zQHiur&CJWdr`a66$LPyIr%8$FxQ^?_17?z^8AEN7X)-SX%)hN$)g`Yj9D9VdoN0tE
z!*w;mDRV9dj`c37Dg&MVijJjC3DD_;K}jU6-AMwSHh6kt5~!(enX@_A{IN;o%7CX&
z+#f_Vx~7*)d0ipC?VV(OdFF|!q&0yA>MwXzH{bcxA!Jo4)4uCN27H>Hfj;F{5-NmF
zLSu{|hbFotiuDNGwk0{;`HKmUdQ&*01C*FuVoL@-{YAM{7qK(&X+Cqe{GB<c1MZsJ
zDet098Sr#0&?W^x1D-yS_xBhv8Su0P3ujkyTqMWlcg~kh*=7D@z|*V+ZjPjONrpnC
zXzn%E<aSXZvKe&6JqJ9E{oJh8=f+s*(vqwz(Yalq#l1_kQf{<DY*NUZ&+IRf1}N$V
zWX>c|^Nx|d*;FY9JdN+%EH`Ap)2D`~&9{x)0`az+tx}l;>T6T8ZlcYAr$e$662E!o
zb<h;oR$CKmue-vVU+yFs4Kdx_jQXw=>P^HXlS0iZ|0eE{2~QJi+3Ohh=!yOGWNmOi
zwKV}eO%#3?Ngz7SL$)_=#w7_1U9;UANvO~l#2>8)9OE$<{_k}>WuVh1x3V=>C1s-1
za1NdPeNFesK&Qd8j23rYcFF{&35ai&x-!7&cv(O#`XZo|$)JW;*_XUnp}iZOQU*F*
ze=G2xiB4aJ0Ng<kK&KnC`pqJC=1qbJl#k(}CW>UD(_ah&(<%gX`m6RMtwTVk1IF3~
zqkvCa0DZKX+L!>JHs(ic$k&CrJYT`ZQ_7)@3GnGC9z|={&3D#UNtT5*B_;!({-R)Y
zC;58+#cq#Z20k6YZQhk6K7FY-Xa;o#K;4-sSAxaTXchp}iHYE53RwtHe*sJ0Nah#G
z&3m3*5;{~akGv6NU-Y#BNg9&^eEO>fq#H@QND{t~#-sqB?i?+~3a#cwm1Dd-bGOl|
z0G~EoF|!M{6y7jcek1TvuG2kYZEqwwn&FzP$U|00p#Gu~eIp4oM3=pp@D>2n5z}l!
z0tEoIp#kaS%Crs<p#FmSqfG(<>R8)7qIltW53)82&8>bW$9pt7-n}%Z5THg-v)eIT
zINl>&%&ks23Lt8mzY*Lnyl^m_;2sa6aK1-q!qy}<mt;d31oy(?k}m;uO`DQ5L+P?9
z+L!>L{=(PaND`qAzq=O=m2xpdo2AwQgqpG2uCFf~@bN`?_eK)bMba7Q8?-F}Ky3$u
zp}nxUaKZ-!ccTjc)Tg*)(;)Ef!Jq=NDPJ3*LJfLVpc_Hp)8Tc|+;B4opa7qy2i%v;
zmuGTMv?bvfY4i(h#|XfuJC8LXLd}9M<WHlibzc%1bj`@LB_TddvlqH|BZ*S|pa$)Y
z4l9)!gr%+XBKe0O{`BqVpMPC{_`?r>{r2m>|M7Q!_~Flg`}yB~`sI(m`~RO|C|^#>
F0RZSqe%1g0

literal 0
HcmV?d00001

diff --git a/scripts/dolfin-plot/plot_book_elements.sh b/scripts/dolfin-plot/plot_book_elements.sh
new file mode 100755
index 0000000..fc7bba9
--- /dev/null
+++ b/scripts/dolfin-plot/plot_book_elements.sh
@@ -0,0 +1,71 @@
+#!/bin/sh
+#
+# This script plots a bunch of elements. Images produced by this
+# script are used in the FEniCS book chapter "Common and unusual
+# finite elements" by Kirby/Logg/Rognes/Terrel.
+#
+# Anders Logg, 2010-12-08
+
+ROTATE=0
+
+dolfin-plot Argyris                triangle     5 rotate=$ROTATE
+
+dolfin-plot Arnold-Winther         triangle       rotate=$ROTATE
+
+dolfin-plot Brezzi-Douglas-Marini  triangle     1 rotate=$ROTATE
+dolfin-plot Brezzi-Douglas-Marini  triangle     2 rotate=$ROTATE
+dolfin-plot Brezzi-Douglas-Marini  triangle     3 rotate=$ROTATE
+dolfin-plot Brezzi-Douglas-Marini  tetrahedron  1 rotate=$ROTATE
+dolfin-plot Brezzi-Douglas-Marini  tetrahedron  2 rotate=$ROTATE
+dolfin-plot Brezzi-Douglas-Marini  tetrahedron  3 rotate=$ROTATE
+
+dolfin-plot Crouzeix-Raviart       triangle     1 rotate=$ROTATE
+dolfin-plot Crouzeix-Raviart       tetrahedron  1 rotate=$ROTATE
+
+dolfin-plot DG                     triangle     0 rotate=$ROTATE
+dolfin-plot DG                     triangle     1 rotate=$ROTATE
+dolfin-plot DG                     triangle     2 rotate=$ROTATE
+dolfin-plot DG                     triangle     3 rotate=$ROTATE
+dolfin-plot DG                     tetrahedron  0 rotate=$ROTATE
+dolfin-plot DG                     tetrahedron  1 rotate=$ROTATE
+dolfin-plot DG                     tetrahedron  2 rotate=$ROTATE
+dolfin-plot DG                     tetrahedron  3 rotate=$ROTATE
+
+dolfin-plot Hermite                triangle       rotate=$ROTATE
+dolfin-plot Hermite                tetrahedron    rotate=$ROTATE
+
+dolfin-plot Lagrange               triangle     1 rotate=$ROTATE
+dolfin-plot Lagrange               triangle     2 rotate=$ROTATE
+dolfin-plot Lagrange               triangle     3 rotate=$ROTATE
+dolfin-plot Lagrange               triangle     4 rotate=$ROTATE
+dolfin-plot Lagrange               triangle     5 rotate=$ROTATE
+dolfin-plot Lagrange               triangle     6 rotate=$ROTATE
+dolfin-plot Lagrange               tetrahedron  1 rotate=$ROTATE
+dolfin-plot Lagrange               tetrahedron  2 rotate=$ROTATE
+dolfin-plot Lagrange               tetrahedron  3 rotate=$ROTATE
+dolfin-plot Lagrange               tetrahedron  4 rotate=$ROTATE
+dolfin-plot Lagrange               tetrahedron  5 rotate=$ROTATE
+dolfin-plot Lagrange               tetrahedron  6 rotate=$ROTATE
+
+dolfin-plot Mardal-Tai-Winther     triangle       rotate=$ROTATE
+
+dolfin-plot Morley                 triangle       rotate=$ROTATE
+
+dolfin-plot N1curl                 triangle     1 rotate=$ROTATE
+dolfin-plot N1curl                 triangle     2 rotate=$ROTATE
+dolfin-plot N1curl                 triangle     3 rotate=$ROTATE
+dolfin-plot N1curl                 tetrahedron  1 rotate=$ROTATE
+dolfin-plot N1curl                 tetrahedron  2 rotate=$ROTATE
+dolfin-plot N1curl                 tetrahedron  3 rotate=$ROTATE
+
+dolfin-plot N2curl                 triangle     1 rotate=$ROTATE
+dolfin-plot N2curl                 triangle     2 rotate=$ROTATE
+dolfin-plot N2curl                 triangle     3 rotate=$ROTATE
+dolfin-plot N2curl                 tetrahedron  1 rotate=$ROTATE
+
+dolfin-plot Raviart-Thomas         triangle     1 rotate=$ROTATE
+dolfin-plot Raviart-Thomas         triangle     2 rotate=$ROTATE
+dolfin-plot Raviart-Thomas         triangle     3 rotate=$ROTATE
+dolfin-plot Raviart-Thomas         tetrahedron  1 rotate=$ROTATE
+dolfin-plot Raviart-Thomas         tetrahedron  2 rotate=$ROTATE
+dolfin-plot Raviart-Thomas         tetrahedron  3 rotate=$ROTATE
diff --git a/scripts/dolfin-plot/plot_elements.sh b/scripts/dolfin-plot/plot_elements.sh
new file mode 100755
index 0000000..bac3e2f
--- /dev/null
+++ b/scripts/dolfin-plot/plot_elements.sh
@@ -0,0 +1,19 @@
+#!/bin/sh
+#
+# This script plots a bunch of rotating elements.
+#
+# Anders Logg, 2010-12-08
+
+echo "Plotting elements..."
+
+dolfin-plot Argyris                triangle     5 rotate=1 &
+dolfin-plot Arnold-Winther         triangle       rotate=1 &
+dolfin-plot Brezzi-Douglas-Marini  tetrahedron  3 rotate=1 &
+dolfin-plot Crouzeix-Raviart       triangle     1 rotate=1 &
+dolfin-plot Hermite                triangle       rotate=1 &
+dolfin-plot Hermite                tetrahedron    rotate=1 &
+dolfin-plot Lagrange               tetrahedron  5 rotate=1 &
+dolfin-plot Mardal-Tai-Winther     triangle       rotate=1 &
+dolfin-plot Morley                 triangle       rotate=1 &
+dolfin-plot N1curl                 tetrahedron  5 rotate=1 &
+dolfin-plot Raviart-Thomas         tetrahedron  1 rotate=1 &
diff --git a/site-packages/dolfin/__init__.py b/site-packages/dolfin/__init__.py
new file mode 100644
index 0000000..c5ccc6d
--- /dev/null
+++ b/site-packages/dolfin/__init__.py
@@ -0,0 +1,47 @@
+"""Main module for DOLFIN"""
+
+# Special module to handle import issues
+import dolfin.importhandler
+
+# Import UFL form language
+from ufl import *
+
+# Add log level present in C++ DOLFIN but not ufl.log
+PROGRESS = 16
+
+# Remove some unnecessary imports from UFL
+del set_handler, set_level
+
+# Import names from the compiled cpp modules
+import cpp
+from dolfin.cpp import *
+from dolfin.cpp import __version__, __swigversion__
+
+# Reset dl open flags
+import sys
+sys.setdlopenflags(dolfin.importhandler.stored_dlopen_flags)
+del sys
+
+# Repair namespace
+from ufl import FiniteElement
+
+# Import UFL color printing
+from ufl.log import info_red, info_green, info_blue
+
+# List of supported elements from FFC
+try:
+    from ffc import supported_elements, supported_elements_for_plotting
+except:
+    supported_elements = []
+    supported_elements_for_plotting = []
+
+# Imports from pure Python modules
+from dolfin.functions import *
+from dolfin.common import *
+from dolfin.compilemodules import *
+from dolfin.fem import *
+from dolfin.mesh import *
+from dolfin.multistage import *
+
+# Handling of deprecated interfaces
+from deprecation import *
diff --git a/site-packages/dolfin/common/__init__.py b/site-packages/dolfin/common/__init__.py
new file mode 100644
index 0000000..487eb2c
--- /dev/null
+++ b/site-packages/dolfin/common/__init__.py
@@ -0,0 +1,21 @@
+"""The common module of dolfin"""
+from dolfin.common import globalparameters
+from dolfin.common import constants
+from dolfin.common import plotting
+from dolfin.common import time             
+from dolfin.common import memory
+from dolfin.common import math
+
+from globalparameters import *
+from constants import *
+from plotting import *   
+from time import *   
+from memory import * 
+from math import *   
+
+# NOTE: The automatic documentation system in DOLFIN requires to _not_ define
+# NOTE: classes or functions within this file. Use separate modules for that
+# NOTE: purpose.
+
+__all__ = globalparameters.__all__ + constants.__all__ + \
+          time.__all__ + memory.__all__ + math.__all__ + plotting.__all__
diff --git a/site-packages/dolfin/common/constants.py b/site-packages/dolfin/common/constants.py
new file mode 100644
index 0000000..84f788d
--- /dev/null
+++ b/site-packages/dolfin/common/constants.py
@@ -0,0 +1,11 @@
+"""This module allows the user to import the following constants:
+
+* DOLFIN_PI = 3.141592653589793238462
+* DOLFIN_EPS = 3.0e-16
+* DOLFIN_SQRT_EPS = 1.0e-8
+"""
+
+__all__ = ['DOLFIN_EPS', 'DOLFIN_PI', 'DOLFIN_SQRT_EPS']
+
+from dolfin.cpp import DOLFIN_EPS, DOLFIN_PI, DOLFIN_SQRT_EPS
+
diff --git a/site-packages/dolfin/common/globalparameters.py.in b/site-packages/dolfin/common/globalparameters.py.in
new file mode 100644
index 0000000..73f5d06
--- /dev/null
+++ b/site-packages/dolfin/common/globalparameters.py.in
@@ -0,0 +1,62 @@
+"""This module defines Python-specific global parameters for DOLFIN by
+adding to the global parameter set defined in C++."""
+
+# Copyright (C) 2009-2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-09-21
+# Last changed: 2011-03-14
+
+__all__ = ["parameters"]
+
+import ufl
+from dolfin.cpp import parameters, Parameters, MPI
+
+# Set default form compiler
+form_compiler_name = "ffc"
+
+# Import form compiler
+try:
+    form_compiler = __import__(form_compiler_name)
+except ImportError, message:
+    print message
+    raise RuntimeError, "Could not import %s form compiler." % form_compiler_name
+
+# Initialize form compiler parameters
+form_compiler_parameters = Parameters("form_compiler")
+for key, value in form_compiler.default_parameters().iteritems():
+    if key in ["swig_binary", "swig_path"]:
+        continue
+    form_compiler_parameters.add(key, value)
+form_compiler_parameters.add("name", form_compiler_name)
+
+# Special case: handling -1 as "auto" for quadrature_degree in FFC
+if form_compiler_name == "ffc":
+    form_compiler_parameters.remove("quadrature_degree")
+    form_compiler_parameters.add("quadrature_degree", -1)
+    form_compiler_parameters.add("no-evaluate_basis_derivatives", True)
+
+# Increase log level for form compiler to hide output
+form_compiler_parameters["log_level"] = ufl.INFO + 5
+
+# Set prefix when running in parallel
+#if MPI.num_processes(MPI_COMM_WORLD) > 1:
+#    form_compiler_parameters["log_prefix"] = "Process %d: " % MPI.process_number()
+
+# Add form compiler parameters to global parameter set
+if not parameters.has_parameter_set("form_compiler"):
+    parameters.add(form_compiler_parameters)
diff --git a/site-packages/dolfin/common/math.py b/site-packages/dolfin/common/math.py
new file mode 100644
index 0000000..52b6766
--- /dev/null
+++ b/site-packages/dolfin/common/math.py
@@ -0,0 +1,18 @@
+"""Convenience functions that are useful in subdomains and expressions. Matches
+some of the functions in dolfin/math/basic.h."""
+
+__all__ = ["sqr"]
+
+from constants import DOLFIN_EPS
+
+# The cpp version of these functions are about 3 times faster
+#def between(x0, x, x1):
+#    """Returns true if x0-epsilon < x < x1+epsilon"""
+#    return x0-DOLFIN_EPS < x < x1+DOLFIN_EPS
+#
+#def near(x, x0):
+#    """Returns true if x0-epsilon < x < x0+epsilon"""
+#    return x0-DOLFIN_EPS < x < x0+DOLFIN_EPS
+
+def sqr(x):
+    return x*x
diff --git a/site-packages/dolfin/common/memory.py b/site-packages/dolfin/common/memory.py
new file mode 100644
index 0000000..2216168
--- /dev/null
+++ b/site-packages/dolfin/common/memory.py
@@ -0,0 +1,48 @@
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-02-14
+# Last changed: 2010-02-14
+
+import os
+
+__all__ = ["memory_usage"]
+
+def memory_usage(as_string=True):
+    """
+    Return memory usage of current process. Note that this function
+    only works on Linux systems. If the flag as_string is true, memory
+    usage is returned as a string. Otherwise, a tuple of integers is
+    returned with current memory usage and maximum memory usage in kB.
+    """
+
+    # Try reading /proc
+    try:
+        pid = os.getpid()
+        status = open("/proc/%d/status" % pid).read()
+    except:
+        return "Failed to get memory usage, chances are you are not running GNU/Linux."
+
+    # Parse values
+    vmsize = int(status.split("VmSize:")[1].split("kB")[0])
+    vmpeak = int(status.split("VmPeak:")[1].split("kB")[0])
+
+    # Return values
+    if as_string:
+        return "Memory usage is %d kB (peak usage is %d kB)" % (vmsize, vmpeak)
+    else:
+        return (vmsize, vmpeak)
diff --git a/site-packages/dolfin/common/plotting.py b/site-packages/dolfin/common/plotting.py
new file mode 100644
index 0000000..ccabd7c
--- /dev/null
+++ b/site-packages/dolfin/common/plotting.py
@@ -0,0 +1,145 @@
+# Copyright (C) 2008-2012 Joachim B. Haga and Fredrik Valdmanis
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Martin Sandve Alnaes, 2008.
+# Modified by Anders Logg, 2008-2010.
+#
+# First added:  2008-03-05
+# Last changed: 2013-05-29
+
+import os
+import dolfin.cpp as cpp
+import ufl
+
+__all__ = ['plot']
+
+# Compatibility with book
+def _VTKPlotter_write_ps(self, *args, **kwargs) :
+  print "*** Warning: VTKPlotter::write_ps() is not implemented -- use write_pdf instead"
+
+def plot(object, *args, **kwargs):
+    """
+    Plot given object.
+
+    *Arguments*
+        object
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`, a :py:class:`MeshFunction
+            <dolfin.cpp.MeshFunction>`, a :py:class:`Function
+            <dolfin.functions.function.Function>`, a :py:class:`Expression`
+            <dolfin.cpp.Expression>, a :py:class:`DirichletBC`
+            <dolfin.cpp.DirichletBC> or a :py:class:`FiniteElement
+            <ufl.FiniteElement>`.
+
+    *Examples of usage*
+        In the simplest case, to plot only e.g. a mesh, simply use
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            plot(mesh)
+
+        Use the ``title`` argument to specify title of the plot
+
+        .. code-block:: python
+
+            plot(mesh, tite="Finite element mesh")
+
+        It is also possible to plot an element
+
+        .. code-block:: python
+
+            element = FiniteElement("BDM", tetrahedron, 3)
+            plot(element)
+
+        Vector valued functions can be visualized with an alternative mode
+
+        .. code-block:: python
+
+            plot(u, mode = "glyphs")
+
+        A more advanced example
+
+        .. code-block:: python
+
+            plot(u,
+                 wireframe = True,              # use wireframe rendering
+                 interactive = False,           # do not hold plot on screen
+                 scalarbar = False,             # hide the color mapping bar
+                 hardcopy_prefix = "myplot",    # default plotfile name
+                 scale = 2.0                    # scale the warping/glyphs
+                 title = "Fancy plot"           # Set your own title
+                 )
+
+    """
+
+    mesh = kwargs.get('mesh')
+
+    p = cpp.Parameters()
+    for key in kwargs:
+        # If there is a "mesh" kwarg it should not be added to the parameters
+        if key != "mesh":
+            try:
+                p.add(key, kwargs[key])
+            except TypeError:
+                cpp.warning("Incompatible type for keyword argument \"%s\". Ignoring." % key)
+
+    # Plot element
+    if isinstance(object, ufl.FiniteElementBase):
+        if os.environ.get("DOLFIN_NOPLOT", "0") != "0": return
+        import ffc
+        return ffc.plot(object, *args, **kwargs)
+
+    if mesh is None and len(args) == 1 and isinstance(args[0], cpp.Mesh):
+        mesh = args[0]
+
+    # Plot expression
+    if isinstance(object, cpp.Expression):
+        if mesh is None:
+            raise TypeError, "expected a mesh when plotting an expression."
+        return cpp.plot(object, mesh, p)
+
+    # Try to project if object is not a standard plottable type
+    if not isinstance(object, (cpp.Function, cpp.Expression, cpp.Mesh,
+        cpp.DirichletBC, cpp.MeshFunction, cpp.MeshFunctionBool,
+        cpp.MeshFunctionInt, cpp.MeshFunctionDouble,
+        cpp.MeshFunctionSizet, cpp.DirichletBC, cpp.CSGGeometry)):
+
+        from dolfin.fem.projection import project
+        try:
+            cpp.info("Object cannot be plotted directly, projecting to"\
+                    " piecewise linears.")
+            object = project(object, mesh=mesh)
+        except Exception as e:
+            msg = ("Don't know how to plot given object:\n  %s\n"\
+                    "and projection failed:\n  %s") % (str(object), str(e))
+            #raise RuntimeError(msg)
+            raise
+
+    plot_object = cpp.plot(object, p)
+    plot_object.write_ps = _VTKPlotter_write_ps
+
+    # Avoid premature deletion of plotted objects if they go out of scope
+    # before the plot window is closed. The plotter itself is safe, since it's
+    # created in the plot() C++ function, not directly from Python. But the
+    # Python plotter proxy may disappear, so we can't store the references
+    # there.
+    global _objects_referenced_from_plot_windows
+    _objects_referenced_from_plot_windows[plot_object.key()] = (object, mesh, p)
+
+    return plot_object
+
+_objects_referenced_from_plot_windows = {}
diff --git a/site-packages/dolfin/common/time.py b/site-packages/dolfin/common/time.py
new file mode 100644
index 0000000..f05b3ed
--- /dev/null
+++ b/site-packages/dolfin/common/time.py
@@ -0,0 +1,65 @@
+"""This module provides a time class in Python. It is typically used for
+problems involving time stepping ."""
+
+# Copyright (C) 2008-2010 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-08-29
+# Last changed: 2010-04-30
+
+__all__ = ["Time"]
+
+class Time:
+    def  __init__(self, value):
+        self.value = value
+
+    def __iadd__(self, value):
+        self.value += value
+        return self
+
+    def __isub__(self, value):
+        self.value -= value
+        return self
+
+    def __idiv__(self, value):
+        self.value /= value
+        return self
+
+    def __imul__(self, value):
+        self.value *= value
+        return self
+
+    def __mul__(self, value):
+        return self.value*value
+
+    def __div__(self, value):
+        return self.value/value
+
+    def __lt__(self, value):
+        return self.value < value
+
+    def __gt__(self, value):
+        return self.value > value
+
+    def __call__(self):
+        return self.value
+
+    def __float__(self):
+        return self.value
+
+    def __str__(self):
+        return str(self.value)
diff --git a/site-packages/dolfin/compilemodules/__init__.py b/site-packages/dolfin/compilemodules/__init__.py
new file mode 100644
index 0000000..d2b8e8d
--- /dev/null
+++ b/site-packages/dolfin/compilemodules/__init__.py
@@ -0,0 +1,17 @@
+"""The compilemodules module of dolfin"""
+from dolfin.compilemodules import compilemodule
+from dolfin.compilemodules import expressions
+from dolfin.compilemodules import subdomains
+from dolfin.compilemodules import jit
+
+from compilemodule import compile_extension_module
+from expressions import compile_expressions
+from subdomains import compile_subdomains, CompiledSubDomain
+from jit import jit
+
+# NOTE: The automatic documentation system in DOLFIN requires to _not_ define
+# NOTE: classes or functions within this file. Use separate modules for that
+# NOTE: purpose.
+
+__all__ = ["compile_extension_module", "compile_expressions", \
+           "compile_subdomains", "CompiledSubDomain", "jit"]
diff --git a/site-packages/dolfin/compilemodules/compilemodule.py b/site-packages/dolfin/compilemodules/compilemodule.py
new file mode 100644
index 0000000..d025f20
--- /dev/null
+++ b/site-packages/dolfin/compilemodules/compilemodule.py
@@ -0,0 +1,472 @@
+"""This module provides functionality to compile PyDOLFIN compatible
+extension modules."""
+
+# Copyright (C) 2009 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johannes Ring, 2011
+# Modifie by Mikael Mortensen, 2014
+#
+# First added:  2009-08-15
+# Last changed: 2014-02-14
+
+import sys
+import os
+import re
+import numpy
+import instant
+import hashlib
+import types
+from dolfin_utils.cppparser import *
+
+# Import PyDOLFIN
+import dolfin
+import dolfin.cpp as cpp
+
+from dolfin.compilemodules.jit import mpi_jit_decorator
+from dolfin.compilemodules.swigimportinfo import *
+
+__all__ = ["compile_extension_module",
+           "expression_to_code_fragments",
+           "math_header"]
+
+# Bump the interface version if anything changes that invalidates cached
+# modules (not required for change in generated code, swig version or dolfin
+# version)
+_interface_version = 3
+
+# A list of supported math builtins
+_cpp_math_builtins = [
+    # <cmath> functions: from http://www.cplusplus.com/reference/cmath/
+    "cos", "sin", "tan", "acos", "asin", "atan", "atan2",
+    "cosh", "sinh", "tanh", "exp", "frexp", "ldexp", "log", "log10", "modf",
+    "pow", "sqrt", "ceil", "fabs", "floor", "fmod",
+    "max", "min"]
+
+_math_builtins = [
+    # math.h functions: http://en.wikibooks.org/wiki/C_Programming/C_Reference/math.h
+    "acos", "asin", "atan", "atan2", "ceil", "cos", "cosh", "exp",
+    "fabs", "floor", "fmod", "frexp", "ldexp", "log", "log10", "modf",
+    "pow", "sin", "sinh", "sqrt", "tan", "tanh", "acosh", "asinh", "atanh",
+    "cbrt", "copysign", "erf", "erfc", "exp2", "expm1", "fdim", "fma", "fmax",
+    "fmin", "hypot", "ilogb", "lgamma", "llrint", "lrint", "llround", "lround",
+    "log1p", "log2", "logb", "nan", "nearbyint", "nextafter", "nexttoward",
+    "remainder", "remquo", "rint", "round", "scalbln", "scalbn", "tgamma", "trunc"]
+
+_math_dolfin = [
+    # functions from dolfin::math:
+    "sqr", "ipow", "rand", "near", "DOLFIN_EPS", "DOLFIN_PI", "pi"]
+
+_all_math = list(set(_math_builtins).difference(_cpp_math_builtins)) + \
+            _math_dolfin + _cpp_math_builtins
+
+math_header = """
+// cmath functions
+%s
+
+const double pi = DOLFIN_PI;
+""" % "\n".join("using std::%s;" % mf for mf in _cpp_math_builtins)
+
+
+_cpp_keywords = ["auto","const","double","float","int","short","struct","unsigned",
+                 "break","continue","else","for","long","signed","switch","void",
+                 "case","default","enum","goto","register","sizeof","typedef",
+                 "char","do","extern","if","return","static","union","while",
+                 "asm","dynamic_cast","namespace","reinterpret_cast","try",
+                 "bool","explicit","new","static_cast","typeid","volatile",
+                 "catch","operator","template","typename",
+                 "class","friend","private","this","using",
+                 "const_cast","inline","public","throw","virtual",
+                 "delete","mutable","protected","wchar_t",
+                 "or","and","xor","not"]
+
+_additional_declarations = r"""
+%%init%%{
+import_array();
+%%}
+
+// Include global SWIG interface files:
+// Typemaps, shared_ptr declarations, exceptions, version
+%%include <std_shared_ptr.i>
+
+// Global typemaps and forward declarations
+%%include "dolfin/swig/typemaps/includes.i"
+%%include "dolfin/swig/forwarddeclarations.i"
+
+// Global exceptions
+%%include <exception.i>
+%%include "dolfin/swig/exceptions.i"
+
+// Do not expand default arguments in C++ by generating two an extra
+// function in the SWIG layer. This reduces code bloat.
+%%feature("compactdefaultargs");
+
+// STL SWIG string class
+%%include <std_string.i>
+
+// Manually import ufc:
+%%{
+#include <ufc.h>
+%%}
+%%include "swig/ufc_shared_ptr_classes.i"
+%%import(module="ufc") "ufc.h"
+
+// Local shared_ptr declarations
+%(shared_ptr_declarations)s
+
+%(additional_declarations)s
+
+// Import statements
+%(dolfin_import_statement)s
+
+%%feature("autodoc", "1");
+
+%%inline %%{
+int get_swigversion() { return  SWIGVERSION; }
+%%}
+
+%%pythoncode %%{
+tmp = hex(get_swigversion())
+swigversion = "%%d.%%d.%%d"%%(tuple(map(int, [tmp[-5], tmp[-3], tmp[-2:]])))
+del tmp, get_swigversion
+%%}
+
+"""
+
+def expression_to_code_fragments(expr, arguments, generic_function_members=None):
+    "A help function which extract a dict with code snippets from an expression"
+
+    generic_function_members = generic_function_members or []
+    expr = list(expr)
+
+    # Autodetect variables from function strings
+    variables = set()
+
+    for i, c in enumerate(expr):
+        # Find groups of connected alphanumeric letters
+        symbols = re.findall(r"([a-zA-Z_]*:{0,2}[\w]+)", c)
+        assert isinstance(symbols, list)
+        variables.update(symbols)
+        for sym in symbols:
+            if sym in _cpp_keywords:
+                cpp.dolfin_error("compilemodule.py",
+                                 "parse expression string",
+                                 "Detected C++ keyword (%s) in C++ expression" % sym)
+        # FIXME: Remove outcommented code?
+        # NOTE: A hack to get around an ambiguous overloading of
+        #       dolfin::pow(double,int)
+
+        #if "pow" in symbols:
+        #    c = c.replace("pow","std::pow")
+        expr[i] = c
+
+    # Remove any variables defined in the arguments list
+    variables.difference_update(arguments)
+
+    # Remove the builtin math functions from the variables
+    variables.difference_update(_all_math)
+
+    # Remove the numerals from the variables
+    numerals = [v for v in variables if v[0] in "0123456789"]
+    variables.difference_update(numerals)
+
+    # Remove any exponential representation
+    exponentials = [v for v in variables if bool(re.search("e[0-9,\-,\.,\+]+", v))]
+    variables.difference_update(exponentials+["e"])
+
+    # Remove namespace-specified variables
+    namespacevars = [v for v in variables if "::" in v]
+    variables.difference_update(namespacevars)
+
+    # Generate code for member variables
+    members_code = ["  double %s;" % name for name in variables \
+                    if name not in generic_function_members]
+    members_code.extend("  std::shared_ptr<dolfin::GenericFunction> shared_%s;" % name \
+                        for name in generic_function_members)
+    members_code = "\n".join(members_code)
+
+    # Generate constructor code for initialization of member variables
+    constructor_code = "\n".join("    %s = 0;" % name for name in variables\
+                                 if name not in generic_function_members)
+
+    # Connect the code fragments using the function template code
+    fragments = {}
+    fragments["members"]        = members_code
+    fragments["constructor"]    = constructor_code
+
+    # Return the code fragments
+    return fragments, variables
+
+def expect_list_of(argtype, arg, argname):
+    if arg is None:
+        return []
+
+    if isinstance(arg, (types.NoneType, list, tuple)):
+        if all(isinstance(s, argtype) for s in arg):
+            return arg
+
+    cpp.dolfin_error("compilemodule.py",
+                     "ensure correct argument for compile_extension_module",
+                     "Provide a 'tuple' or 'list' with '%s', for the "\
+                     "'%s' argument" % (argtype.__name__, argname))
+
+def expect_arg(argtype, arg, argname):
+    # Check the type of the argument
+    if isinstance(arg, argtype):
+        return
+
+    cpp.dolfin_error("compilemodule.py",
+                     "ensure correct argument for compile_extension_module",
+                     "Provide a '%s', for the '%s' argument" % \
+                     (argtype.__name__, argname))
+
+def check_swig_version(compiled_module):
+
+    # Check swig version of compiled module
+    if compiled_module and compiled_module.swigversion != cpp.__swigversion__:
+        cpp.dolfin_error("compilemodule.py",
+                         "compiling extension module",
+                         "Incompatible swig versions detected. DOLFIN swig "\
+                         "version is not the same as extension module swig "\
+                         "version: '%s' != '%s' " % \
+                         (cpp.__swigversion__, compiled_module.swigversion))
+
+@mpi_jit_decorator
+def compile_extension_module(code, module_name="",
+                             additional_declarations="",
+                             additional_system_headers=None,
+                             **instant_kwargs):
+    """
+    Just In Time compile DOLFIN C++ code into a Python module.
+
+    *Arguments*
+        code
+            C++ code which implements any function or C++ class. Any function
+            or class available in the C++ DOLFIN namespace can be used and/or
+            subclassed. All typemaps from the original Python interface are
+            available, making it possible to interface with for example NumPy
+            for Array<double/int> arguments. Source which is not wrapped in
+            a dolfin namespace will be automatically wrapped.
+
+        module_name
+            Force a name of the module. If not set a name based on the hex
+            representation of the code will be used.
+
+        additional_declarations
+            Additional SWIG declarations can be passed using this argument.
+
+        additional_system_headers :
+            System headers needed to compile the generated can be included
+            using this argument. The headers are passed using a list of 'str'
+
+    *Returns*
+
+        The JIT compiled extension module
+
+    *Examples of usage*
+
+        The following toy example shows how one can use compiled extension
+        modules to access low level PETSc routines:
+
+        .. code-block:: python
+
+            from numpy import arange
+            code = '''
+            namespace dolfin {
+
+              void PETSc_exp(std::shared_ptr<dolfin::PETScVector> vec)
+              {
+                Vec x = vec->vec();
+                assert(x);
+                VecExp(x);
+              }
+            }
+            '''
+            ext_module = compile_extension_module(code,
+                         additional_system_headers=["petscvec.h"])
+            comm = mpi_comm_world()
+            vec = PETScVector(comm, 10)
+            vec[:] = arange(10)
+            print vec[-1]
+            ext_module.PETSc_exp(vec)
+            print vec[-1]
+
+    """
+    # Check the provided arguments
+    expect_arg(str, code, "first")
+    expect_arg(str, module_name, "module_name")
+    expect_arg(str, additional_declarations, "additional_declarations")
+    additional_system_headers = \
+                expect_list_of(str, additional_system_headers, "additional_system_headers")
+
+    # Check that the code does not use 'using namespace dolfin'
+    if re.search("using\s+namespace\s+dolfin",code):
+        cpp.dolfin_error("compilemodule.py",
+                         "ensure correct argument to compile_extension_module",
+                         "Do not use 'using namespace dolfin'. "\
+                         "Include the code in namespace dolfin {...} instead")
+
+    # Check if the code does not use namespace dolfin {...}
+    if not re.search("namespace\s+dolfin\s*\{[\s\S]+\}", code):
+
+        # Wrap and indet code in namespace dolfin
+        codelines = ["namespace dolfin","{"]
+        codelines += ["  " + line for line in code.split("\n")]
+        codelines += ["}"]
+        code = "\n".join(codelines)
+
+    # Create unique module name for this application run
+    if module_name is "":
+        module_name = "dolfin_compile_code_%s" % \
+                      hashlib.md5(repr(code) + dolfin.__version__ + \
+                                  str(_interface_version)+\
+                                  additional_declarations +\
+                                  str(additional_system_headers)).hexdigest()
+
+    # Extract dolfin dependencies and class names
+    used_types, declared_types = parse_and_extract_type_info(code)
+
+    # Add any bases of the declared types to used_types
+    for declared_type, bases in declared_types.items():
+        used_types.update(bases)
+
+    # Filter out dolfin types and add derived and bases for each type
+    used_dolfin_types = []
+    for dolfin_type in dolfin_type_def:
+        for used_type in used_types:
+            if dolfin_type in used_type:
+
+                # Add bases and derived types
+                used_dolfin_types.extend(\
+                    dolfin_type_def[dolfin_type]["bases"])
+
+                # Add dolfin type
+                used_dolfin_types.append(dolfin_type)
+
+                break
+
+    # Generate dependency info
+    dependencies = {}
+    for dolfin_type in used_dolfin_types:
+        if dolfin_type_def[dolfin_type]["submodule"] not in dependencies:
+            dependencies[dolfin_type_def[dolfin_type]["submodule"]] = []
+
+        dependencies[dolfin_type_def[dolfin_type]["submodule"]].append(\
+            dolfin_type_def[dolfin_type]["header"])
+
+    # Need special treatment for template definitions in function/pre.i
+    if "function" in dependencies:
+        for dolfin_type in ["FunctionSpace", "Function"]:
+            dependencies["function"].append(dolfin_type_def[dolfin_type]["header"])
+
+    # Add uint type
+    if "common" in dependencies:
+        dependencies["common"].append("dolfin/common/types.h")
+    else:
+        dependencies["common"] = ["dolfin/common/types.h"]
+
+    # Sort the dependencies
+    dependencies = sort_submodule_dependencies(dependencies, submodule_info)
+
+    import_lines, headers_includes, file_dependencies = \
+                  build_swig_import_info(dependencies, submodule_info, "dolfin.cpp.")
+
+    # Extract header info
+    dolfin_system_headers = [header for header in file_dependencies \
+                             if not "pre.i" in header]
+
+    # Check the handed import files
+    interface_import_files = []
+
+    # Check cache
+    compiled_module = instant.import_module(module_name)
+
+    if compiled_module:
+        # Check that the swig version of the compiled module is the same as
+        # dolfin was compiled with
+        check_swig_version(compiled_module)
+        return compiled_module
+
+    sys.stdout.flush()
+    dolfin.info("Calling DOLFIN just-in-time (JIT) compiler, this may take some time.")
+
+    # Configure instant and add additional system headers
+
+    # Add dolfin system headers
+    instant_kwargs["system_headers"] = ["cmath", "iostream","complex",
+                                        "stdexcept","numpy/arrayobject.h",
+                                        "memory",
+                                        "dolfin/common/types.h",
+                                        "dolfin/math/basic.h"] + \
+                                        instant_kwargs.get("system_headers", [])
+    instant_kwargs["system_headers"] += dolfin_system_headers
+
+    # Add user specified system headers
+    instant_kwargs["system_headers"] += additional_system_headers
+
+    # Add cmake packages
+    instant_kwargs["cmake_packages"]  = ["DOLFIN"] + \
+                                        instant_kwargs.get("cmake_packages", [])
+    instant_kwargs["signature"] = module_name
+
+    declaration_strs = {"additional_declarations":""}
+    declaration_strs["dolfin_import_statement"] = \
+                    "\n".join(import_lines)
+
+    # Add any provided additional declarations
+    if additional_declarations is not None:
+        declaration_strs["additional_declarations"] += additional_declarations
+
+    # Add any shared_ptr declarations
+    declaration_strs["shared_ptr_declarations"] = \
+        extract_shared_ptr_declaration(declared_types, used_dolfin_types, \
+                                       shared_ptr_classes)
+
+    # Compile extension module with instant
+    compiled_module = instant.build_module(\
+        code              = code,
+        additional_declarations = _additional_declarations % declaration_strs,
+        **instant_kwargs)
+
+    sys.stdout.flush()
+
+    # Check that the swig version of the compiled module is the same as
+    # dolfin was compiled with
+    check_swig_version(compiled_module)
+
+    return compiled_module
+
+def extract_shared_ptr_declaration(declared_types, used_dolfin_types, shared_ptr_classes):
+    " Extract any declaration for shared_ptr"
+    # Check if there are any classes that is derived from any of the
+    # shared_ptr classes in PyDOLFIN and declare if any
+    shared_ptr_format = "%%shared_ptr(dolfin::%s)"
+
+    used_shared_ptr_types = []
+
+    # Collect used types which should be shared_ptr declared
+    for dolfin_type in used_dolfin_types:
+        if dolfin_type in shared_ptr_classes:
+            used_shared_ptr_types.append(dolfin_type)
+
+    used_shared_ptr_types.extend(derived for derived, bases in declared_types.items()
+                                 if any(base in shared_ptr_classes for base in bases))
+
+    shared_ptr_declarations = "\n".join([shared_ptr_format % derived \
+                                         for derived in used_shared_ptr_types])
+
+    return shared_ptr_declarations
diff --git a/site-packages/dolfin/compilemodules/expressions.py b/site-packages/dolfin/compilemodules/expressions.py
new file mode 100644
index 0000000..033810c
--- /dev/null
+++ b/site-packages/dolfin/compilemodules/expressions.py
@@ -0,0 +1,233 @@
+"This module provides functionality for compilation of strings as dolfin Expressions."
+
+# Copyright (C) 2008-2008 Martin Sandve Alnes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johan Hake 2008-2009
+#
+# First added:  2008-06-04
+# Last changed: 2011-04-18
+
+import re
+import types
+import hashlib
+import instant
+
+# Import local compile_extension_module
+from dolfin.compilemodules.compilemodule import (compile_extension_module,
+                                                 expression_to_code_fragments,
+                                                 math_header)
+
+__all__ = ["compile_expressions"]
+
+_expression_template = """class %(classname)s: public Expression
+{
+public:
+%(members)s
+  %(classname)s():Expression()
+  {
+%(value_shape)s
+%(constructor)s
+  }
+
+  void eval(dolfin::Array<double>& values, const dolfin::Array<double>& x,
+            const ufc::cell& cell) const
+  {
+%(evalcode_cell)s
+  }
+
+  void eval(dolfin::Array<double>& values, const dolfin::Array<double>& x) const
+  {
+%(evalcode)s
+  }
+};
+"""
+
+def flatten_and_check_expression(expr):
+    # Convert expr to a flat tuple of strings
+    # and return value_shape and geometrical dimensions
+    if isinstance(expr, str):
+        return (expr,), ()
+    elif isinstance(expr, (tuple,list)):
+        if all(isinstance(e,tuple) for e in expr):
+            shape = (len(expr),len(expr[0]))
+            expr = sum(expr, ())
+        else:
+            shape = (len(expr),)
+        if all(isinstance(e,str) for e in expr):
+            return expr, shape
+    raise TypeError, "Wrong type of expressions. Provide a 'str', a 'tuple' of 'str' or a 'tuple' of 'tuple' of 'str': %s" % str(expr)
+
+def expression_to_dolfin_expression(expr, generic_function_members):
+    "Generates code for a dolfin::Expression subclass for a single expression."
+
+    # Check and flattern provided expression
+    expr, shape = flatten_and_check_expression(expr)
+
+    # Extract code fragments from the expr
+    fragments, members = expression_to_code_fragments(\
+        expr, ["values","x"], generic_function_members)
+
+    # Generate code for value_rank
+    value_shape_code = ["    _value_shape.push_back(%d);" % value_dim \
+                        for value_dim in shape]
+
+    evalcode = []
+
+    # Generate code for constant members
+    for name in generic_function_members:
+        evalcode.append("    if (shared_%s->value_size()!=1)" % name)
+        evalcode.append("      dolfin_error(\"generated code\",")
+        evalcode.append("                   \"calling eval\", ")
+        evalcode.append("                   \"Parameter \\'%s\\' is not scalar valued\");" % name)
+        evalcode.append("    if (shared_%s.get()==this)" % name)
+        evalcode.append("      dolfin_error(\"generated code\",")
+        evalcode.append("                   \"calling eval\",")
+        evalcode.append("                   \"Circular eval call detected. Cannot use itself as parameter \\'%s\\' within eval\");" % name)
+        evalcode.append("    Array<double> %s__array_(1);" % name)
+        evalcode.append("    shared_%s->eval(%s__array_, x);" % (name, name))
+        evalcode.append("    const double %s = %s__array_[0];" % (name, name))
+
+    # Generate code for the actual expression evaluation
+    evalcode.extend("    values[%d] = %s;" % (i, c) for (i,c) in enumerate(expr))
+
+    # Connect the code fragments using the expression template code
+    fragments["evalcode"]  = "\n".join(evalcode)
+    fragments["evalcode_cell"]  = fragments["evalcode"].replace(\
+        "__array_, x", "__array_, x, cell")
+    fragments["value_shape"] = "\n".join(value_shape_code)
+
+    # Assign classname
+    classname = "Expression_" + hashlib.md5(fragments["evalcode"]).hexdigest()
+    fragments["classname"] = classname
+
+    # Produce the C++ code for the expression class
+    code = _expression_template % fragments
+    return classname, code, members
+
+
+def compile_expression_code(code, classnames=None, module_name=None, \
+                            additional_declarations=None):
+
+    additional_declarations = additional_declarations or ""
+
+    # Autodetect classnames:
+    _classnames = re.findall(r"class[ ]+([\w]+).*", code)
+
+    # Just a little assertion for safety:
+    if classnames is None:
+        classnames = _classnames
+    else:
+        assert all(a == b for (a,b) in zip(classnames, _classnames))
+
+    # Complete the code
+    code = "%s\n%s"%(math_header, code)
+
+    # Compile the extension module
+    compiled_module = compile_extension_module(\
+        code, additional_declarations=additional_declarations)
+
+    # Get the compiled class
+    expression_classes = [getattr(compiled_module, name) for name in classnames]
+    return expression_classes
+
+def compile_expressions(cppargs, generic_function_members=None):
+    """
+    Compiles a list of either C++ expressions of full subclasses of
+    dolfin::Expression class.
+
+    The expression can either be a str in which case it is
+    interpreted as a scalar expression and a scalar Expression is generated.
+
+    If the expression is a tuple consisting of more than one str it is
+    interpreted as a vector expression, and a rank 1 Expression is generated.
+
+    A tuple of tuples of str objects is interpreted as a matrix
+    expression, and a rank 2 Expression is generated.
+
+    If an expression string contains a name, it is assumed to be a scalar
+    parameter name, and is added as a public member of the generated expression.
+    The names of these parameters are then returned in a list together with the
+    compiled expression class.
+
+    If 'cppargs' include a class definition it is interpreted as c++ code with complete
+    implementations of a subclasses of dolfin::Expression.
+
+    kwargs propagates the default member values for any generated parameter.
+    """
+    #, which contains:
+    #    %s
+    #""" % "\n".join("        " + b for b in _builtins)
+    # FIXME: Hook up this to a more general debug mechanism
+    assert(isinstance(cppargs, list))
+
+    generic_function_members_list = generic_function_members or \
+                                    [[] for i in range(len(cppargs))]
+
+    # Check for uniq sub expressions
+    if len(set(hashlib.md5(repr(expr)) for expr in cppargs)) \
+               != len(cppargs):
+        raise TypeError, "The batch-compiled expressions must be unique."
+
+    # Collect code and classnames
+    code_snippets = []; classnames = []; all_members = []; additional_declarations = [];
+
+    for cpparg, generic_function_members in zip(cppargs, generic_function_members_list):
+        assert(isinstance(cpparg, (str, tuple, list)))
+        # If the cpparg includes the word 'class' and 'Expression',
+        # assume it is a c++ code snippet
+
+        if isinstance(cpparg, str) and "class" in cpparg and "Expression" in cpparg:
+            # Assume that a code snippet is passed as cpparg
+            code = cpparg
+
+            # Get the class name
+            classname = re.findall(r"class[ ]+([\w]+).*", code)[0]
+            members = []
+
+            # FIXME: Check for passed dimension?
+        else:
+            classname, code, members = \
+                       expression_to_dolfin_expression(cpparg, generic_function_members)
+
+            additional_declarations.extend("%%rename(%s) dolfin::%s::shared_%s;" % \
+                                           (name, classname, name) for  name in \
+                                           generic_function_members)
+
+        all_members.append(members)
+        code_snippets.append(code)
+        classnames.append(classname)
+
+    expression_classes = compile_expression_code("\n\n".join(\
+        code_snippets), classnames, additional_declarations="\n".join(\
+                                                     additional_declarations))
+
+    return expression_classes, all_members
+
+if __name__ == "__main__":
+    cn1, code1 = expression_to_dolfin_expression("exp(alpha)",{'alpha':1.5})
+    cn2, code2 = expression_to_dolfin_expression(("sin(x[0])", "cos(x[1])", "0.0"),{})
+    cn3, code3 = expression_to_dolfin_expression((("sin(x[0])", "cos(x[1])"), ("0.0", "1.0")),{})
+
+    print code1
+    print cn1
+
+    print code2
+    print cn2
+
+    print code3
+    print cn3
diff --git a/site-packages/dolfin/compilemodules/jit.py b/site-packages/dolfin/compilemodules/jit.py
new file mode 100644
index 0000000..be8913e
--- /dev/null
+++ b/site-packages/dolfin/compilemodules/jit.py
@@ -0,0 +1,126 @@
+"""This module defines a jit function that wraps the jit function for
+the chosen form compiler."""
+
+# Copyright (C) 2008-2009 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008-2009.
+# Modified by Garth N. Wells, 2011.
+#
+# First added:  2008-12-04
+# Last changed: 2011-09-10
+
+__all__ = ["jit"]
+
+from functools import wraps
+
+# Import SWIG-generated extension module (DOLFIN C++)
+import dolfin.cpp as cpp
+from dolfin.cpp import MPI, info, parameters, warning, info
+
+import ufl
+
+def mpi_jit_decorator(local_jit, *args, **kwargs):
+    """A decorator for jit compilation
+
+    Use this function as a decorator to any jit compiler function.  In
+    a parallel run, this function will first call the jit compilation
+    function on the first process. When this is done, and the module
+    is in the cache, it will call the jit compiler on the remaining
+    processes, which will then use the cached module.
+
+    *Example*
+        .. code-block:: python
+
+            def jit_something(something):
+                ....
+
+    """
+    @wraps(local_jit)
+    def mpi_jit(*args, **kwargs):
+
+
+        # Create MPI_COMM_WORLD wrapper
+        mpi_comm = cpp.mpi_comm_world()
+
+        # Just call JIT compiler when running in serial
+        if MPI.size(mpi_comm) == 1:
+            return local_jit(*args, **kwargs)
+
+        # Compile first on process 0
+        if MPI.rank(mpi_comm) == 0:
+            output = local_jit(*args, **kwargs)
+
+        # Wait for the first process to finish
+        MPI.barrier(mpi_comm)
+
+        # Then compile on all other processes (which may then just
+        # read the cache)
+        if not MPI.rank(mpi_comm) == 0:
+            output = local_jit(*args,**kwargs)
+
+        return output
+
+    # Return the decorated jit function
+    return mpi_jit
+
+@mpi_jit_decorator
+def jit(form, form_compiler_parameters=None):
+    """Just-in-time compile any provided form.
+
+    It uses the jit function from the form compiler registered by
+    parameters["form_compiler"]["name"].
+    """
+
+    # Check that form is not empty
+    if isinstance(form, ufl.Form):
+        if form.empty():
+            raise RuntimeError, "Form is empty. Cannot pass to JIT compiler."
+
+    # Import form compiler
+    form_compiler_name = cpp.parameters["form_compiler"]["name"]
+    try:
+        form_compiler = __import__(form_compiler_name)
+    except ImportError, message:
+        print message
+        warning("Could not import %s form compiler, falling back to FFC." \
+                % form_compiler_name)
+        try:
+            form_compiler = __import__("ffc")
+        except:
+            cpp.dolfin_error("jit.py",
+                             "perform just-in-time compilation of form",
+                             "Could not import FFC form compiler")
+
+    # Prepare form compiler parameters
+    p = form_compiler.default_parameters()
+
+    # Set parameters from global DOLFIN parameter set
+    for key, value in parameters["form_compiler"].iteritems():
+        p[key] = value
+
+    # Override with local parameters if any
+    if form_compiler_parameters:
+        p.update(form_compiler_parameters)
+
+    # Get jit function
+    try:
+        jit_compile = form_compiler.jit
+    except AttributeError:
+        raise RuntimeError, "Form compiler must implement the jit function."
+
+    return jit_compile(form, parameters=p)
diff --git a/site-packages/dolfin/compilemodules/subdomains.py b/site-packages/dolfin/compilemodules/subdomains.py
new file mode 100644
index 0000000..f85632f
--- /dev/null
+++ b/site-packages/dolfin/compilemodules/subdomains.py
@@ -0,0 +1,235 @@
+"This module provides functionality for compilation of strings as dolfin SubDomains."
+
+# Copyright (C) 2008-2008 Martin Sandve Alnes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-07-01
+# Last changed: 2011-04-18
+
+import re
+import os
+import hashlib
+import instant
+
+# Import local compile_extension_module
+from dolfin.compilemodules.compilemodule import (compile_extension_module,
+                                                 expression_to_code_fragments,
+                                                 math_header)
+
+from dolfin.cpp import deprecation
+import dolfin.cpp as cpp
+
+__all__ = ["compile_subdomains", "CompiledSubDomain"]
+
+_map_args = ["x", "y"]
+
+_subdomain_template = """
+class %(classname)s: public SubDomain
+{
+public:
+%(members)s
+
+  %(classname)s()
+  {
+%(constructor)s
+  }
+
+  /// Return true for points inside the sub domain
+  bool inside(const Array<double>& x, bool on_boundary) const
+  {
+    %(inside)s
+  }
+
+};
+"""
+
+# TODO: Support implementation of map as well
+"""
+  /// Map coordinate x in domain H to coordinate y in domain G (used for periodic boundary conditions)
+  void map(const Array<double>& x, Array<double>& y) const
+  {
+    %(map)s
+  }
+"""
+
+def expression_to_subdomain(cpparg, classname):
+    """
+    Generate code for a :py:class:`SubDomain <dolfin.cpp.SubDomain>`
+    subclass for a single expression.
+    """
+
+    # Assure we have a simple string expression
+    assert isinstance(cpparg, str)
+
+    # Extract code fragments from the expr and defaults
+    fragments, members = expression_to_code_fragments(\
+        [cpparg], ["x", "on_boundary", "DOLFIN_EPS"])
+    
+    # Generate code for inside()
+    insidecode = "  return %s;" % cpparg
+    
+    # Generate code for map()
+    #mapcode = "..."
+
+    # Connect the code fragments using the function template code
+    fragments["inside"]    = insidecode
+    fragments["classname"] = classname
+    #fragments["map"]       = mapcode
+    code = _subdomain_template % fragments
+    return code, members
+
+def compile_subdomain_code(code, classname):
+
+    # Complete the code
+    code = math_header + \
+"""
+namespace dolfin
+{
+%s
+}
+""" % code
+
+    # Compile the extension module
+    compiled_module = compile_extension_module(code)
+
+    # Get compiled class
+    return getattr(compiled_module, classname)
+
+def CompiledSubDomain(cppcode, **kwargs):
+    """
+    Compile a C++ string expression into a
+    :py:class:`SubDomain <dolfin.cpp.SubDomain>` instance.
+
+    *Arguments*
+        cppcode
+            a string containing an expression in C++ syntax.
+
+    If the string contains a name, it is assumed to be a scalar
+    variable name, and is added as a public member of the generated
+    subdomain. All such members need a default initial value.
+
+    If the string contains a class name it is interpreted as a
+    complete implementations of subclasses of :py:class:`SubDomain
+    <dolfin.cpp.SubDomain>`.
+
+    *Examples of usage*
+
+        .. code-block:: python
+
+            left  = CompiledSubDomain("near(x[0], 0) && on_boundary")
+            right = CompiledSubDomain("near(x[1], 1) && on_boundary")
+            center = CompiledSubDomain("near(x[1], c)", c = 0.5)
+
+    """
+
+    if not isinstance(cppcode, str):
+        raise TypeError("expected a 'str'")
+    
+    if isinstance(cppcode, str) and "class" in cppcode and \
+           "SubDomain" in cppcode:
+        members = []
+        classname = re.findall(r"class[ ]+([\w]+).*", code)[0]
+        code = cppcode
+
+    else:
+        
+        classname = "CompiledSubDomain" + hashlib.md5(cppcode).hexdigest()
+        code, members = expression_to_subdomain(cppcode, classname)
+    
+    SubDomainClass = compile_subdomain_code(code, classname)
+    
+    # Check passed default arguments 
+    not_allowed = [n for n in dir(cpp.SubDomain) if n[0] !="_"]
+    not_allowed += ["cppcode"]
+
+    if not all(member in kwargs for member in members):
+        missing = []
+        for member in members:
+            if member not in kwargs:
+                missing.append(member)
+        missing = ", ".join("'%s'" % miss for miss in missing)
+        raise RuntimeError("expected a default value to all member "\
+                           "variables in the SubDomain. Missing: %s." % missing)
+
+    for name in kwargs.keys():
+        if name in not_allowed:
+            raise RuntimeError("Parameter name: '%s' is not allowed. It is "\
+                               "part of the interface of SubDomain" % name)
+            
+        if not (all(isinstance(value, (int, float)) \
+                    for value in kwargs.values())):
+            raise TypeError("expected default arguments for member variables "\
+                            "to be scalars.")
+
+    # Store compile arguments for possible later use
+    SubDomainClass.cppcode = cppcode
+
+    # Instantiate CompiledSubDomain
+    subdomain = SubDomainClass()    
+
+    # Set default variables
+    for member, value in kwargs.items():
+        setattr(subdomain, member, value)
+
+    return subdomain
+
+def compile_subdomains(cppcode):
+    """
+    Compile C++ string expressions into SubDomain instances. 
+
+    *Arguments*
+        expressions
+            a string or a list of strings containing expressions in C++ syntax.
+
+    NOTE: This function is deprecated. Use CompiledSubDomain instead.
+
+    If expressions is a `str`, it is interpreted as a C++ string with
+    complete implementations of subclasses of SubDomain. The compiled
+    subdomains returned will be in the same order as they are defined
+    in this code.
+    
+    If it is a list, each item of the list is interpreted as a logical
+    `inside` expression, and the compiled subdomains returned will be
+    in the same order as they occur in this list.
+    
+    If an expression string contains a name, it is assumed to be a
+    scalar variable name, and is added as a public member of the
+    generated subdomain.
+    
+    *Examples of usage*
+
+        .. code-block:: python
+
+            left  = compile_subdomains("x[0] == 0")
+            right = compile_subdomains("x[1] == 1")
+
+    or
+    
+        .. code-block:: python
+
+            bc = compile_subdomains(["x[0] == 0", "x[1] == 1"])
+    """
+    
+    deprecation("compile_subdomains", "1.3.0", \
+                "compiled_subdomains has been renamed to CompiledSubDomain.")
+
+    # If passing a list we compile each SubDomain on its own
+    if isinstance(cppcode, list):
+        return [CompiledSubDomain(code_str) for code_str in cppcode]
+
+    return CompiledSubDomain(cppcode)
+    
diff --git a/site-packages/dolfin/compilemodules/swigimportinfo.py b/site-packages/dolfin/compilemodules/swigimportinfo.py
new file mode 100644
index 0000000..9700c6b
--- /dev/null
+++ b/site-packages/dolfin/compilemodules/swigimportinfo.py
@@ -0,0 +1,301 @@
+"""
+This module contains compiletime information about the dolfin python
+library, which can be utelized at runtime.
+
+The file is automatically generated by the generateswigcode.py script
+in the dolfin/swig directory."""
+
+try:
+    from collections import OrderedDict
+except ImportError:
+    from dolfin_utils.ordereddict import OrderedDict
+
+# A list of shared_ptr declared classes in dolfin
+shared_ptr_classes = ['AdaptiveLinearVariationalSolver', 'AdaptiveNonlinearVariationalSolver', 'ErrorControl', 'Hierarchical<dolfin::ErrorControl>', 'GenericAdaptiveVariationalSolver', 'GoalFunctional', 'SpecialFacetFunction', 'TimeSeries', 'TimeSeriesHDF5', 'MeshDisplacement', 'Variable', 'Hierarchical<dolfin::Form>', 'GenericDofMap', 'DofMap', 'CCFEMDofMap', 'Form', 'FiniteElement', 'BasisFunction', 'MultiStageScheme', 'Hierarchical<dolfin::LinearVariationalProblem>', 'Hierarchical<dolfin::NonlinearVariationalProblem>', 'LinearVariationalProblem', 'NonlinearVariationalProblem', 'LinearVariationalSolver', 'NonlinearVariationalSolver', 'PointIntegralSolver', 'Hierarchical<dolfin::DirichletBC>', 'DirichletBC', 'Hierarchical<dolfin::FunctionSpace>', 'FunctionSpace', 'SubSpace', 'GenericFunction', 'Hierarchical<dolfin::Function>', 'Function', 'Expression', 'FacetArea', 'Constant', 'MeshCoordinates', 'BoundingBoxTree', 'Hierarchical<dolfin::Mesh>', 'BoundaryMesh', 'CircleMesh', 'EllipseMesh', 'EllipsoidMesh', 'Mesh', 'Restriction', 'SphereMesh', 'SubMesh', 'UnitTetrahedronMesh', 'UnitCubeMesh', 'UnitIntervalMesh', 'IntervalMesh', 'UnitTriangleMesh', 'UnitSquareMesh', 'BoxMesh', 'Box', 'RectangleMesh', 'Rectangle', 'CSGGeometry', 'CSGOperator', 'CSGUnion', 'CSGDifference', 'CSGIntersection', 'CSGPrimitive', 'CSGPrimitive2D', 'CSGPrimitive3D', 'Circle', 'Ellipse', 'Polygon', 'Sphere', 'Cone', 'Cylinder', 'Tetrahedron', 'Surface3D', 'CSGCGALMeshGenerator2D', 'CSGCGALMeshGenerator3D', 'SubDomain', 'DomainBoundary', 'LocalMeshData', 'MeshData', 'Hierarchical<dolfin::MeshFunction<std::size_t> >', 'MeshFunction<std::size_t>', 'CellFunction<std::size_t>', 'EdgeFunction<std::size_t>', 'FaceFunction<std::size_t>', 'FacetFunction<std::size_t>', 'VertexFunction<std::size_t>', 'Parameters', 'GlobalParameters', 'GenericLinearOperator', 'GenericMatrix', 'GenericPreconditioner', 'GenericTensor', 'GenericVector', 'LinearAlgebraObject', 'Scalar', 'Matrix', 'Vector', 'LinearOperator', 'STLMatrix', 'uBLASMatrix<boost::numeric::ublas::matrix<double> >', 'uBLASVector', 'PETScBaseMatrix', 'PETScLinearOperator', 'PETScKrylovSolver', 'PETScLUSolver', 'PETScMatrix', 'PETScObject', 'PETScPreconditioner', 'PETScVector', 'PETScUserPreconditioner', 'SLEPcEigenSolver', 'EpetraKrylovSolver', 'EpetraLUSolver', 'EpetraMatrix', 'EpetraSparsityPattern', 'EpetraVector', 'TrilinosPreconditioner', 'PaStiXLUSolver', 'UmfpackLUSolver', 'CholmodCholeskySolver', 'uBLASKrylovSolver', 'uBLASLinearOperator', 'LinearSolver', 'GenericLinearSolver', 'GenericLUSolver', 'KrylovSolver', 'LUSolver', 'GenericSparsityPattern', 'SparsityPattern', 'Table', 'GenericFile', 'File', 'XDMFFile', 'HDF5File', 'Lagrange', 'NewtonSolver', 'PETScSNESSolver', 'TAOLinearBoundSolver', 'VTKPlotter', 'GenericVTKPlottable', 'VTKPlottableMesh', 'VTKPlottableGenericFunction', 'VTKPlottableMeshFunction', 'ExpressionWrapper', 'Quadrature', 'LobattoQuadrature', 'RadauQuadrature', 'GaussQuadrature', 'GaussianQuadrature', 'MeshPointIntersection']
+
+# An OrderedDict of all dolfin declared and its meta info
+dolfin_type_def = OrderedDict([\
+('ufc::function', {'header': 'ufc.h', 'submodule': '', 'derived': ['Function', 'MeshDisplacement', 'BasisFunction', 'GenericFunction', 'SpecialFacetFunction', 'MeshCoordinates', 'Constant', 'Expression', 'FacetArea'], 'bases': [], 'module': ''}),
+('la_index', {'header': 'dolfin/common/types.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('Array', {'header': 'dolfin/common/Array.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('IndexSet', {'header': 'dolfin/common/IndexSet.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('Set', {'header': 'dolfin/common/Set.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('Timer', {'header': 'dolfin/common/Timer.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('Variable', {'header': 'dolfin/common/Variable.h', 'submodule': 'common', 'derived': ['GenericDofMap', 'CircleMesh', 'PETScVector', 'PETScLUSolver', 'CSGDifference', 'EpetraVector', 'VTKPlotter', 'uBLASVector', 'UnitIntervalMesh', 'uBLASMatrix', 'GenericLinearOperator', 'CSGCGALMeshGenerator3D', 'CSGPrimitive3D', 'FacetFunction', 'GenericTensor', 'FaceFunction', 'AdaptiveNonlinearVariationalSolver', 'EllipsoidMesh', 'UnitSquareMesh', 'CSGPrimitive', 'UmfpackLUSolver', 'TrilinosPreconditioner', 'CSGPrimitive2D', 'XDMFFile', 'Scalar', 'SparsityPattern', 'Lagrange', 'CSGCGALMeshGenerator2D', 'LinearVariationalSolver', 'LinearAlgebraObject', 'GenericSparsityPattern', 'BoundaryMesh', 'SphereMesh', 'AdaptiveLinearVariationalSolver', 'Circle', 'CSGIntersection', 'CSGOperator', 'CSGGeometry', 'CholmodCholeskySolver', 'CellFunction', 'LUSolver', 'MultiStageScheme', 'BoxMesh', 'MeshDisplacement', 'SubMesh', 'LinearOperator', 'Box', 'LinearSolver', 'PETScLinearOperator', 'UnitTetrahedronMesh', 'MeshCoordinates', 'Vector', 'MeshValueCollection', 'KrylovSolver', 'GenericLUSolver', 'Cylinder', 'PETScPreconditioner', 'Cone', 'Matrix', 'GenericVector', 'VertexFunction', 'TimeSeriesHDF5', 'Rectangle', 'LocalMeshData', 'GenericMatrix', 'Mesh', 'IntervalMesh', 'MUMPSLUSolver', 'Tetrahedron', 'HDF5File', 'SpecialFacetFunction', 'Constant', 'Expression', 'CSGUnion', 'RectangleMesh', 'PETScMatrix', 'DofMap', 'GenericLinearSolver', 'SLEPcEigenSolver', 'Surface3D', 'uBLASKrylovSolver', 'Polygon', 'UnitCubeMesh', 'SubSpace', 'PointIntegralSolver', 'GenericAdaptiveVariationalSolver', 'ErrorControl', 'EpetraKrylovSolver', 'EpetraMatrix', 'EdgeFunction', 'Function', 'DirichletBC', 'UnitTriangleMesh', 'CCFEMDofMap', 'STLMatrix', 'PETScBaseMatrix', 'MeshFunction', 'TAOLinearBoundSolver', 'PETScKrylovSolver', 'EpetraLUSolver', 'TimeSeries', 'PaStiXLUSolver', 'FacetArea', 'GenericFunction', 'EllipseMesh', 'uBLASLinearOperator', 'NewtonSolver', 'NonlinearVariationalSolver', 'Sphere', 'FunctionSpace', 'Table', 'Ellipse', 'MeshData'], 'bases': [], 'module': 'common'}),
+('Hierarchical', {'header': 'dolfin/common/Hierarchical.h', 'submodule': 'common', 'derived': ['UnitCubeMesh', 'CircleMesh', 'SubSpace', 'SphereMesh', 'LinearVariationalProblem', 'GoalFunctional', 'ErrorControl', 'VertexFunction', 'DirichletBC', 'EdgeFunction', 'Function', 'Form', 'BoundaryMesh', 'UnitIntervalMesh', 'UnitTriangleMesh', 'CellFunction', 'Mesh', 'BoxMesh', 'IntervalMesh', 'SubMesh', 'MeshFunction', 'FacetFunction', 'UnitTetrahedronMesh', 'FaceFunction', 'EllipsoidMesh', 'UnitSquareMesh', 'NonlinearVariationalProblem', 'EllipseMesh', 'RectangleMesh', 'FunctionSpace'], 'bases': [], 'module': 'common'}),
+('MPI_Comm', {'header': 'dolfin/common/MPI.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('MPI', {'header': 'dolfin/common/MPI.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('MPIInfo', {'header': 'dolfin/common/MPI.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('SubSystemsManager', {'header': 'dolfin/common/SubSystemsManager.h', 'submodule': 'common', 'derived': [], 'bases': [], 'module': 'common'}),
+('IntParameter', {'header': 'dolfin/parameter/Parameter.h', 'submodule': 'parameter', 'derived': [], 'bases': ['Parameter'], 'module': 'common'}),
+('BoolParameter', {'header': 'dolfin/parameter/Parameter.h', 'submodule': 'parameter', 'derived': [], 'bases': ['Parameter'], 'module': 'common'}),
+('StringParameter', {'header': 'dolfin/parameter/Parameter.h', 'submodule': 'parameter', 'derived': [], 'bases': ['Parameter'], 'module': 'common'}),
+('Parameter', {'header': 'dolfin/parameter/Parameter.h', 'submodule': 'parameter', 'derived': ['IntParameter', 'BoolParameter', 'StringParameter', 'DoubleParameter'], 'bases': [], 'module': 'common'}),
+('DoubleParameter', {'header': 'dolfin/parameter/Parameter.h', 'submodule': 'parameter', 'derived': [], 'bases': ['Parameter'], 'module': 'common'}),
+('Parameters', {'header': 'dolfin/parameter/Parameters.h', 'submodule': 'parameter', 'derived': ['GlobalParameters'], 'bases': [], 'module': 'common'}),
+('GlobalParameters', {'header': 'dolfin/parameter/GlobalParameters.h', 'submodule': 'parameter', 'derived': [], 'bases': ['Parameters'], 'module': 'common'}),
+('Event', {'header': 'dolfin/log/Event.h', 'submodule': 'log', 'derived': [], 'bases': [], 'module': 'common'}),
+('Progress', {'header': 'dolfin/log/Progress.h', 'submodule': 'log', 'derived': [], 'bases': [], 'module': 'common'}),
+('Table', {'header': 'dolfin/log/Table.h', 'submodule': 'log', 'derived': [], 'bases': ['Variable'], 'module': 'common'}),
+('TableEntry', {'header': 'dolfin/log/Table.h', 'submodule': 'log', 'derived': [], 'bases': [], 'module': 'common'}),
+('CellType', {'header': 'dolfin/mesh/CellType.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshTopology', {'header': 'dolfin/mesh/MeshTopology.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshGeometry', {'header': 'dolfin/mesh/MeshGeometry.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshDomains', {'header': 'dolfin/mesh/MeshDomains.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshData', {'header': 'dolfin/mesh/MeshData.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable'], 'module': 'mesh'}),
+('Mesh', {'header': 'dolfin/mesh/Mesh.h', 'submodule': 'mesh', 'derived': ['UnitCubeMesh', 'EllipseMesh', 'CircleMesh', 'UnitTetrahedronMesh', 'BoxMesh', 'UnitTriangleMesh', 'SphereMesh', 'EllipsoidMesh', 'UnitSquareMesh', 'BoundaryMesh', 'IntervalMesh', 'UnitIntervalMesh', 'SubMesh', 'RectangleMesh'], 'bases': ['Variable', 'Hierarchical'], 'module': 'mesh'}),
+('MeshEntity', {'header': 'dolfin/mesh/MeshEntity.h', 'submodule': 'mesh', 'derived': ['Cell', 'Vertex', 'Face', 'Facet', 'Edge', 'FacetCell'], 'bases': [], 'module': 'mesh'}),
+('MeshEntityIterator', {'header': 'dolfin/mesh/MeshEntityIterator.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshEntityIteratorBase', {'header': 'dolfin/mesh/MeshEntityIteratorBase.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('SubsetIterator', {'header': 'dolfin/mesh/SubsetIterator.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('VertexIterator', {'header': 'dolfin/mesh/Vertex.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('VertexFunction', {'header': 'dolfin/mesh/Vertex.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable', 'Hierarchical', 'MeshFunction'], 'module': 'mesh'}),
+('Vertex', {'header': 'dolfin/mesh/Vertex.h', 'submodule': 'mesh', 'derived': [], 'bases': ['MeshEntity'], 'module': 'mesh'}),
+('EdgeIterator', {'header': 'dolfin/mesh/Edge.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('Edge', {'header': 'dolfin/mesh/Edge.h', 'submodule': 'mesh', 'derived': [], 'bases': ['MeshEntity'], 'module': 'mesh'}),
+('EdgeFunction', {'header': 'dolfin/mesh/Edge.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable', 'Hierarchical', 'MeshFunction'], 'module': 'mesh'}),
+('FaceIterator', {'header': 'dolfin/mesh/Face.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('FaceFunction', {'header': 'dolfin/mesh/Face.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable', 'Hierarchical', 'MeshFunction'], 'module': 'mesh'}),
+('Face', {'header': 'dolfin/mesh/Face.h', 'submodule': 'mesh', 'derived': [], 'bases': ['MeshEntity'], 'module': 'mesh'}),
+('FacetIterator', {'header': 'dolfin/mesh/Facet.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('Facet', {'header': 'dolfin/mesh/Facet.h', 'submodule': 'mesh', 'derived': [], 'bases': ['MeshEntity'], 'module': 'mesh'}),
+('FacetFunction', {'header': 'dolfin/mesh/Facet.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable', 'Hierarchical', 'MeshFunction'], 'module': 'mesh'}),
+('CellIterator', {'header': 'dolfin/mesh/Cell.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('Cell', {'header': 'dolfin/mesh/Cell.h', 'submodule': 'mesh', 'derived': ['FacetCell'], 'bases': ['MeshEntity'], 'module': 'mesh'}),
+('CellFunction', {'header': 'dolfin/mesh/Cell.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable', 'Hierarchical', 'MeshFunction'], 'module': 'mesh'}),
+('FacetCell', {'header': 'dolfin/mesh/FacetCell.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Cell', 'MeshEntity'], 'module': 'mesh'}),
+('MeshConnectivity', {'header': 'dolfin/mesh/MeshConnectivity.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshEditor', {'header': 'dolfin/mesh/MeshEditor.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('DynamicMeshEditor', {'header': 'dolfin/mesh/DynamicMeshEditor.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('LocalMeshValueCollection', {'header': 'dolfin/mesh/LocalMeshValueCollection.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshFunction', {'header': 'dolfin/mesh/MeshFunction.h', 'submodule': 'mesh', 'derived': ['VertexFunction', 'FacetFunction', 'FaceFunction', 'CellFunction', 'EdgeFunction'], 'bases': ['Variable', 'Hierarchical'], 'module': 'mesh'}),
+('MeshValueCollection', {'header': 'dolfin/mesh/MeshValueCollection.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable'], 'module': 'mesh'}),
+('MeshColoring', {'header': 'dolfin/mesh/MeshColoring.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshRenumbering', {'header': 'dolfin/mesh/MeshRenumbering.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshTransformation', {'header': 'dolfin/mesh/MeshTransformation.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('LocalMeshData', {'header': 'dolfin/mesh/LocalMeshData.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable'], 'module': 'mesh'}),
+('SubDomain', {'header': 'dolfin/mesh/SubDomain.h', 'submodule': 'mesh', 'derived': ['DomainBoundary'], 'bases': [], 'module': 'mesh'}),
+('SubMesh', {'header': 'dolfin/mesh/SubMesh.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('Restriction', {'header': 'dolfin/mesh/Restriction.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('DomainBoundary', {'header': 'dolfin/mesh/DomainBoundary.h', 'submodule': 'mesh', 'derived': [], 'bases': ['SubDomain'], 'module': 'mesh'}),
+('BoundaryMesh', {'header': 'dolfin/mesh/BoundaryMesh.h', 'submodule': 'mesh', 'derived': [], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('PeriodicBoundaryComputation', {'header': 'dolfin/mesh/PeriodicBoundaryComputation.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('MeshQuality', {'header': 'dolfin/mesh/MeshQuality.h', 'submodule': 'mesh', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('ImplicitDomainMeshGenerator', {'header': 'dolfin/generation/ImplicitDomainMeshGenerator.h', 'submodule': 'generation', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('PolygonalMeshGenerator', {'header': 'dolfin/generation/PolygonalMeshGenerator.h', 'submodule': 'generation', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('PolyhedralMeshGenerator', {'header': 'dolfin/generation/PolyhedralMeshGenerator.h', 'submodule': 'generation', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('Triangulate', {'header': 'dolfin/generation/Triangulate.h', 'submodule': 'generation', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('BoxMesh', {'header': 'dolfin/generation/BoxMesh.h', 'submodule': 'generation', 'derived': ['UnitCubeMesh'], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('CircleMesh', {'header': 'dolfin/generation/EllipseMesh.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'Mesh', 'Hierarchical', 'EllipseMesh'], 'module': 'mesh'}),
+('EllipseMesh', {'header': 'dolfin/generation/EllipseMesh.h', 'submodule': 'generation', 'derived': ['CircleMesh'], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('EllipsoidMesh', {'header': 'dolfin/generation/EllipsoidMesh.h', 'submodule': 'generation', 'derived': ['SphereMesh'], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('SphereMesh', {'header': 'dolfin/generation/EllipsoidMesh.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'EllipsoidMesh', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('IntervalMesh', {'header': 'dolfin/generation/IntervalMesh.h', 'submodule': 'generation', 'derived': ['UnitIntervalMesh'], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('RectangleMesh', {'header': 'dolfin/generation/RectangleMesh.h', 'submodule': 'generation', 'derived': ['UnitSquareMesh'], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('UnitTetrahedronMesh', {'header': 'dolfin/generation/UnitTetrahedronMesh.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('UnitCubeMesh', {'header': 'dolfin/generation/UnitCubeMesh.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'Mesh', 'Hierarchical', 'BoxMesh'], 'module': 'mesh'}),
+('UnitIntervalMesh', {'header': 'dolfin/generation/UnitIntervalMesh.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'Mesh', 'IntervalMesh', 'Hierarchical'], 'module': 'mesh'}),
+('UnitTriangleMesh', {'header': 'dolfin/generation/UnitTriangleMesh.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('UnitSquareMesh', {'header': 'dolfin/generation/UnitSquareMesh.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'RectangleMesh', 'Mesh', 'Hierarchical'], 'module': 'mesh'}),
+('CSGGeometry', {'header': 'dolfin/generation/CSGGeometry.h', 'submodule': 'generation', 'derived': ['Box', 'CSGOperator', 'CSGPrimitive2D', 'Polygon', 'CSGUnion', 'Sphere', 'Tetrahedron', 'Cylinder', 'Ellipse', 'CSGDifference', 'CSGPrimitive', 'Surface3D', 'Circle', 'CSGPrimitive3D', 'CSGIntersection', 'Rectangle', 'Cone'], 'bases': ['Variable'], 'module': 'mesh'}),
+('CSGMeshGenerator', {'header': 'dolfin/generation/CSGMeshGenerator.h', 'submodule': 'generation', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('CSGCGALMeshGenerator2D', {'header': 'dolfin/generation/CSGCGALMeshGenerator2D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable'], 'module': 'mesh'}),
+('CSGCGALMeshGenerator3D', {'header': 'dolfin/generation/CSGCGALMeshGenerator3D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable'], 'module': 'mesh'}),
+('CSGDifference', {'header': 'dolfin/generation/CSGOperators.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGOperator', 'CSGGeometry'], 'module': 'mesh'}),
+('CSGOperator', {'header': 'dolfin/generation/CSGOperators.h', 'submodule': 'generation', 'derived': ['CSGDifference', 'CSGIntersection', 'CSGUnion'], 'bases': ['Variable', 'CSGGeometry'], 'module': 'mesh'}),
+('CSGIntersection', {'header': 'dolfin/generation/CSGOperators.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGOperator', 'CSGGeometry'], 'module': 'mesh'}),
+('CSGUnion', {'header': 'dolfin/generation/CSGOperators.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGOperator', 'CSGGeometry'], 'module': 'mesh'}),
+('CSGPrimitive', {'header': 'dolfin/generation/CSGPrimitive.h', 'submodule': 'generation', 'derived': ['Box', 'Cylinder', 'CSGPrimitive2D', 'Polygon', 'Tetrahedron', 'Sphere', 'Surface3D', 'Circle', 'CSGPrimitive3D', 'Ellipse', 'Rectangle', 'Cone'], 'bases': ['Variable', 'CSGGeometry'], 'module': 'mesh'}),
+('Circle', {'header': 'dolfin/generation/CSGPrimitives2D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGPrimitive', 'CSGGeometry', 'CSGPrimitive2D'], 'module': 'mesh'}),
+('CSGPrimitive2D', {'header': 'dolfin/generation/CSGPrimitives2D.h', 'submodule': 'generation', 'derived': ['Circle', 'Ellipse', 'Rectangle', 'Polygon'], 'bases': ['Variable', 'CSGGeometry', 'CSGPrimitive'], 'module': 'mesh'}),
+('Ellipse', {'header': 'dolfin/generation/CSGPrimitives2D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGPrimitive', 'CSGGeometry', 'CSGPrimitive2D'], 'module': 'mesh'}),
+('Rectangle', {'header': 'dolfin/generation/CSGPrimitives2D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGPrimitive', 'CSGGeometry', 'CSGPrimitive2D'], 'module': 'mesh'}),
+('Polygon', {'header': 'dolfin/generation/CSGPrimitives2D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGPrimitive', 'CSGGeometry', 'CSGPrimitive2D'], 'module': 'mesh'}),
+('Box', {'header': 'dolfin/generation/CSGPrimitives3D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGGeometry', 'CSGPrimitive3D', 'CSGPrimitive'], 'module': 'mesh'}),
+('Cylinder', {'header': 'dolfin/generation/CSGPrimitives3D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGGeometry', 'CSGPrimitive3D', 'CSGPrimitive', 'Cone'], 'module': 'mesh'}),
+('Tetrahedron', {'header': 'dolfin/generation/CSGPrimitives3D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGGeometry', 'CSGPrimitive3D', 'CSGPrimitive'], 'module': 'mesh'}),
+('Sphere', {'header': 'dolfin/generation/CSGPrimitives3D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGGeometry', 'CSGPrimitive3D', 'CSGPrimitive'], 'module': 'mesh'}),
+('Cone', {'header': 'dolfin/generation/CSGPrimitives3D.h', 'submodule': 'generation', 'derived': ['Cylinder'], 'bases': ['Variable', 'CSGGeometry', 'CSGPrimitive3D', 'CSGPrimitive'], 'module': 'mesh'}),
+('CSGPrimitive3D', {'header': 'dolfin/generation/CSGPrimitives3D.h', 'submodule': 'generation', 'derived': ['Box', 'Cylinder', 'Tetrahedron', 'Sphere', 'Surface3D', 'Cone'], 'bases': ['Variable', 'CSGGeometry', 'CSGPrimitive'], 'module': 'mesh'}),
+('Surface3D', {'header': 'dolfin/generation/CSGPrimitives3D.h', 'submodule': 'generation', 'derived': [], 'bases': ['Variable', 'CSGGeometry', 'CSGPrimitive3D', 'CSGPrimitive'], 'module': 'mesh'}),
+('CSGGeometries', {'header': 'dolfin/generation/CSGGeometries3D.h', 'submodule': 'generation', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('ImplicitSurface', {'header': 'dolfin/geometry/ImplicitSurface.h', 'submodule': 'geometry', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('Point', {'header': 'dolfin/geometry/Point.h', 'submodule': 'geometry', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('BoundingBoxTree', {'header': 'dolfin/geometry/BoundingBoxTree.h', 'submodule': 'geometry', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('GenericBoundingBoxTree', {'header': 'dolfin/geometry/GenericBoundingBoxTree.h', 'submodule': 'geometry', 'derived': ['BoundingBoxTree3D'], 'bases': [], 'module': 'mesh'}),
+('BoundingBoxTree3D', {'header': 'dolfin/geometry/BoundingBoxTree3D.h', 'submodule': 'geometry', 'derived': [], 'bases': ['GenericBoundingBoxTree'], 'module': 'mesh'}),
+('MeshPointIntersection', {'header': 'dolfin/geometry/MeshPointIntersection.h', 'submodule': 'geometry', 'derived': [], 'bases': [], 'module': 'mesh'}),
+('ublas_sparse_matrix_cmajor', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_vector_range', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_assembly_matrix', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_dense_matrix', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_sparse_matrix', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_matrix_cmajor_tri', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_matrix_range', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_matrix_cmajor_tri_column', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_vector', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_matrix_cmajor', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_assembly_matrix_cmajor', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_matrix_cmajor_tri_range', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('ublas_matrix_cmajor_range', {'header': 'dolfin/la/ublas.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('E', {'header': 'dolfin/la/LinearAlgebraObject.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('LinearAlgebraObject', {'header': 'dolfin/la/LinearAlgebraObject.h', 'submodule': 'la', 'derived': ['GenericVector', 'Matrix', 'GenericMatrix', 'GenericTensor', 'uBLASMatrix', 'PETScMatrix', 'PETScVector', 'STLMatrix', 'Scalar', 'Vector', 'LinearOperator', 'uBLASVector', 'uBLASLinearOperator', 'EpetraMatrix', 'GenericLinearOperator', 'EpetraVector', 'PETScLinearOperator'], 'bases': ['Variable'], 'module': 'la'}),
+('GenericLinearOperator', {'header': 'dolfin/la/GenericLinearOperator.h', 'submodule': 'la', 'derived': ['Matrix', 'STLMatrix', 'uBLASMatrix', 'PETScMatrix', 'uBLASLinearOperator', 'GenericMatrix', 'LinearOperator', 'EpetraMatrix', 'PETScLinearOperator'], 'bases': ['Variable', 'LinearAlgebraObject'], 'module': 'la'}),
+('GenericTensor', {'header': 'dolfin/la/GenericTensor.h', 'submodule': 'la', 'derived': ['GenericVector', 'Matrix', 'STLMatrix', 'uBLASVector', 'uBLASMatrix', 'PETScMatrix', 'PETScVector', 'GenericMatrix', 'Scalar', 'Vector', 'EpetraMatrix', 'EpetraVector'], 'bases': ['Variable', 'LinearAlgebraObject'], 'module': 'la'}),
+('GenericMatrix', {'header': 'dolfin/la/GenericMatrix.h', 'submodule': 'la', 'derived': ['STLMatrix', 'uBLASMatrix', 'EpetraMatrix', 'PETScMatrix', 'Matrix'], 'bases': ['Variable', 'GenericTensor', 'LinearAlgebraObject', 'GenericLinearOperator'], 'module': 'la'}),
+('GenericSparsityPattern', {'header': 'dolfin/la/GenericSparsityPattern.h', 'submodule': 'la', 'derived': ['SparsityPattern'], 'bases': ['Variable'], 'module': 'la'}),
+('GenericVector', {'header': 'dolfin/la/GenericVector.h', 'submodule': 'la', 'derived': ['uBLASVector', 'Vector', 'EpetraVector', 'PETScVector'], 'bases': ['Variable', 'GenericTensor', 'LinearAlgebraObject'], 'module': 'la'}),
+('VectorSpaceBasis', {'header': 'dolfin/la/VectorSpaceBasis.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('GenericLinearSolver', {'header': 'dolfin/la/GenericLinearSolver.h', 'submodule': 'la', 'derived': ['GenericLUSolver', 'LinearSolver', 'UmfpackLUSolver', 'CholmodCholeskySolver', 'EpetraLUSolver', 'PETScKrylovSolver', 'PETScLUSolver', 'LUSolver', 'EpetraKrylovSolver', 'uBLASKrylovSolver', 'KrylovSolver'], 'bases': ['Variable'], 'module': 'la'}),
+('GenericLUSolver', {'header': 'dolfin/la/GenericLUSolver.h', 'submodule': 'la', 'derived': ['PETScLUSolver', 'UmfpackLUSolver', 'LUSolver', 'EpetraLUSolver'], 'bases': ['Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('GenericPreconditioner', {'header': 'dolfin/la/GenericPreconditioner.h', 'submodule': 'la', 'derived': ['PETScPreconditioner', 'TrilinosPreconditioner'], 'bases': [], 'module': 'la'}),
+('PETScOptions', {'header': 'dolfin/la/PETScOptions.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('PETScObject', {'header': 'dolfin/la/PETScObject.h', 'submodule': 'la', 'derived': ['PETScUserPreconditioner', 'PETScLinearOperator', 'PETScPreconditioner', 'PETScMatrix', 'PETScKrylovSolver', 'PETScVector', 'PETScLUSolver', 'PETScSNESSolver', 'TAOLinearBoundSolver', 'PETScBaseMatrix', 'SLEPcEigenSolver'], 'bases': [], 'module': 'la'}),
+('PETScBaseMatrix', {'header': 'dolfin/la/PETScBaseMatrix.h', 'submodule': 'la', 'derived': ['PETScMatrix', 'PETScLinearOperator'], 'bases': ['Variable', 'PETScObject'], 'module': 'la'}),
+('uBLASFactory', {'header': 'dolfin/la/uBLASFactory.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLinearAlgebraFactory'], 'module': 'la'}),
+('tuple', {'header': 'dolfin/la/uBLASMatrix.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('uBLASMatrix', {'header': 'dolfin/la/uBLASMatrix.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericMatrix', 'LinearAlgebraObject', 'GenericLinearOperator', 'GenericTensor'], 'module': 'la'}),
+('uBLASLinearOperator', {'header': 'dolfin/la/uBLASLinearOperator.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'LinearAlgebraObject', 'GenericLinearOperator'], 'module': 'la'}),
+('PETScMatrix', {'header': 'dolfin/la/PETScMatrix.h', 'submodule': 'la', 'derived': [], 'bases': ['LinearAlgebraObject', 'GenericTensor', 'GenericLinearOperator', 'PETScObject', 'GenericMatrix', 'Variable', 'PETScBaseMatrix'], 'module': 'la'}),
+('PETScLinearOperator', {'header': 'dolfin/la/PETScLinearOperator.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'PETScBaseMatrix', 'LinearAlgebraObject', 'GenericLinearOperator', 'PETScObject'], 'module': 'la'}),
+('PETScPreconditioner', {'header': 'dolfin/la/PETScPreconditioner.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericPreconditioner', 'PETScObject'], 'module': 'la'}),
+('EpetraLUSolver', {'header': 'dolfin/la/EpetraLUSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLUSolver', 'Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('EpetraKrylovSolver', {'header': 'dolfin/la/EpetraKrylovSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('EpetraMatrix', {'header': 'dolfin/la/EpetraMatrix.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericMatrix', 'LinearAlgebraObject', 'GenericLinearOperator', 'GenericTensor'], 'module': 'la'}),
+('EpetraVector', {'header': 'dolfin/la/EpetraVector.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericTensor', 'GenericVector', 'LinearAlgebraObject'], 'module': 'la'}),
+('PETScKrylovSolver', {'header': 'dolfin/la/PETScKrylovSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericLinearSolver', 'PETScObject'], 'module': 'la'}),
+('PETScLUSolver', {'header': 'dolfin/la/PETScLUSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLUSolver', 'Variable', 'GenericLinearSolver', 'PETScObject'], 'module': 'la'}),
+('CholmodCholeskySolver', {'header': 'dolfin/la/CholmodCholeskySolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('UmfpackLUSolver', {'header': 'dolfin/la/UmfpackLUSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLUSolver', 'Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('MUMPSLUSolver', {'header': 'dolfin/la/MUMPSLUSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable'], 'module': 'la'}),
+('PaStiXLUSolver', {'header': 'dolfin/la/PaStiXLUSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable'], 'module': 'la'}),
+('STLMatrix', {'header': 'dolfin/la/STLMatrix.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericMatrix', 'LinearAlgebraObject', 'GenericLinearOperator', 'GenericTensor'], 'module': 'la'}),
+('CoordinateMatrix', {'header': 'dolfin/la/CoordinateMatrix.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('uBLASVector', {'header': 'dolfin/la/uBLASVector.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericTensor', 'GenericVector', 'LinearAlgebraObject'], 'module': 'la'}),
+('PETScVector', {'header': 'dolfin/la/PETScVector.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericTensor', 'GenericVector', 'LinearAlgebraObject', 'PETScObject'], 'module': 'la'}),
+('SparsityPattern', {'header': 'dolfin/la/SparsityPattern.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericSparsityPattern'], 'module': 'la'}),
+('GenericLinearAlgebraFactory', {'header': 'dolfin/la/GenericLinearAlgebraFactory.h', 'submodule': 'la', 'derived': ['DefaultFactory', 'EpetraFactory', 'PETScFactory', 'uBLASFactory', 'STLFactory', 'PETScCuspFactory'], 'bases': [], 'module': 'la'}),
+('DefaultFactory', {'header': 'dolfin/la/DefaultFactory.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLinearAlgebraFactory'], 'module': 'la'}),
+('PETScUserPreconditioner', {'header': 'dolfin/la/PETScUserPreconditioner.h', 'submodule': 'la', 'derived': [], 'bases': ['PETScObject'], 'module': 'la'}),
+('PETScFactory', {'header': 'dolfin/la/PETScFactory.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLinearAlgebraFactory'], 'module': 'la'}),
+('PETScCuspFactory', {'header': 'dolfin/la/PETScCuspFactory.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLinearAlgebraFactory'], 'module': 'la'}),
+('EpetraFactory', {'header': 'dolfin/la/EpetraFactory.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLinearAlgebraFactory'], 'module': 'la'}),
+('STLFactory', {'header': 'dolfin/la/STLFactory.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLinearAlgebraFactory'], 'module': 'la'}),
+('SLEPcEigenSolver', {'header': 'dolfin/la/SLEPcEigenSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'PETScObject'], 'module': 'la'}),
+('BelosLinearProblem', {'header': 'dolfin/la/TrilinosPreconditioner.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('BelosScalarType', {'header': 'dolfin/la/TrilinosPreconditioner.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('BelosOperator', {'header': 'dolfin/la/TrilinosPreconditioner.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('BelosMultiVector', {'header': 'dolfin/la/TrilinosPreconditioner.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('TrilinosPreconditioner', {'header': 'dolfin/la/TrilinosPreconditioner.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericPreconditioner'], 'module': 'la'}),
+('uBLASSparseMatrix', {'header': 'dolfin/la/uBLASSparseMatrix.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('uBLASDenseMatrix', {'header': 'dolfin/la/uBLASDenseMatrix.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('uBLASPreconditioner', {'header': 'dolfin/la/uBLASPreconditioner.h', 'submodule': 'la', 'derived': ['uBLASILUPreconditioner'], 'bases': [], 'module': 'la'}),
+('uBLASKrylovSolver', {'header': 'dolfin/la/uBLASKrylovSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('uBLASILUPreconditioner', {'header': 'dolfin/la/uBLASILUPreconditioner.h', 'submodule': 'la', 'derived': [], 'bases': ['uBLASPreconditioner'], 'module': 'la'}),
+('Vector', {'header': 'dolfin/la/Vector.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericTensor', 'GenericVector', 'LinearAlgebraObject'], 'module': 'la'}),
+('Matrix', {'header': 'dolfin/la/Matrix.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericMatrix', 'LinearAlgebraObject', 'GenericLinearOperator', 'GenericTensor'], 'module': 'la'}),
+('Scalar', {'header': 'dolfin/la/Scalar.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericTensor', 'LinearAlgebraObject'], 'module': 'la'}),
+('LinearSolver', {'header': 'dolfin/la/LinearSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('KrylovSolver', {'header': 'dolfin/la/KrylovSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('LUSolver', {'header': 'dolfin/la/LUSolver.h', 'submodule': 'la', 'derived': [], 'bases': ['GenericLUSolver', 'Variable', 'GenericLinearSolver'], 'module': 'la'}),
+('BlockVector', {'header': 'dolfin/la/BlockVector.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('BlockMatrix', {'header': 'dolfin/la/BlockMatrix.h', 'submodule': 'la', 'derived': [], 'bases': [], 'module': 'la'}),
+('LinearOperator', {'header': 'dolfin/la/LinearOperator.h', 'submodule': 'la', 'derived': [], 'bases': ['Variable', 'LinearAlgebraObject', 'GenericLinearOperator'], 'module': 'la'}),
+('NonlinearProblem', {'header': 'dolfin/nls/NonlinearProblem.h', 'submodule': 'nls', 'derived': [], 'bases': [], 'module': 'la'}),
+('NewtonSolver', {'header': 'dolfin/nls/NewtonSolver.h', 'submodule': 'nls', 'derived': [], 'bases': ['Variable'], 'module': 'la'}),
+('PETScSNESSolver', {'header': 'dolfin/nls/PETScSNESSolver.h', 'submodule': 'nls', 'derived': [], 'bases': ['PETScObject'], 'module': 'la'}),
+('TAOLinearBoundSolver', {'header': 'dolfin/nls/TAOLinearBoundSolver.h', 'submodule': 'nls', 'derived': [], 'bases': ['Variable', 'PETScObject'], 'module': 'la'}),
+('GenericFunction', {'header': 'dolfin/function/GenericFunction.h', 'submodule': 'function', 'derived': ['Function', 'MeshDisplacement', 'Constant', 'SpecialFacetFunction', 'MeshCoordinates', 'Expression', 'FacetArea'], 'bases': ['Variable', 'ufc::function'], 'module': 'function'}),
+('Expression', {'header': 'dolfin/function/Expression.h', 'submodule': 'function', 'derived': ['MeshDisplacement', 'FacetArea', 'Constant', 'SpecialFacetFunction', 'MeshCoordinates'], 'bases': ['Variable', 'ufc::function', 'GenericFunction'], 'module': 'function'}),
+('FunctionAXPY', {'header': 'dolfin/function/FunctionAXPY.h', 'submodule': 'function', 'derived': [], 'bases': [], 'module': 'function'}),
+('Function', {'header': 'dolfin/function/Function.h', 'submodule': 'function', 'derived': [], 'bases': ['Variable', 'ufc::function', 'Hierarchical', 'GenericFunction'], 'module': 'function'}),
+('FunctionSpace', {'header': 'dolfin/function/FunctionSpace.h', 'submodule': 'function', 'derived': ['SubSpace'], 'bases': ['Variable', 'Hierarchical'], 'module': 'function'}),
+('SubSpace', {'header': 'dolfin/function/SubSpace.h', 'submodule': 'function', 'derived': [], 'bases': ['Variable', 'Hierarchical', 'FunctionSpace'], 'module': 'function'}),
+('Constant', {'header': 'dolfin/function/Constant.h', 'submodule': 'function', 'derived': [], 'bases': ['Variable', 'ufc::function', 'Expression', 'GenericFunction'], 'module': 'function'}),
+('FacetArea', {'header': 'dolfin/function/SpecialFunctions.h', 'submodule': 'function', 'derived': [], 'bases': ['Variable', 'ufc::function', 'Expression', 'GenericFunction'], 'module': 'function'}),
+('MeshCoordinates', {'header': 'dolfin/function/SpecialFunctions.h', 'submodule': 'function', 'derived': [], 'bases': ['Variable', 'ufc::function', 'Expression', 'GenericFunction'], 'module': 'function'}),
+('SpecialFacetFunction', {'header': 'dolfin/function/SpecialFacetFunction.h', 'submodule': 'function', 'derived': [], 'bases': ['Variable', 'ufc::function', 'Expression', 'GenericFunction'], 'module': 'function'}),
+('CCFEMFunctionSpace', {'header': 'dolfin/function/CCFEMFunctionSpace.h', 'submodule': 'function', 'derived': [], 'bases': [], 'module': 'function'}),
+('FunctionAssigner', {'header': 'dolfin/function/FunctionAssigner.h', 'submodule': 'function', 'derived': [], 'bases': [], 'module': 'function'}),
+('CCFEMFunction', {'header': 'dolfin/function/CCFEMFunction.h', 'submodule': 'function', 'derived': [], 'bases': [], 'module': 'function'}),
+('LagrangeInterpolator', {'header': 'dolfin/function/LagrangeInterpolator.h', 'submodule': 'function', 'derived': [], 'bases': [], 'module': 'function'}),
+('lt_coordinate', {'header': 'dolfin/function/LagrangeInterpolator.h', 'submodule': 'function', 'derived': [], 'bases': [], 'module': 'function'}),
+('Lagrange', {'header': 'dolfin/math/Lagrange.h', 'submodule': 'math', 'derived': [], 'bases': ['Variable'], 'module': 'function'}),
+('Legendre', {'header': 'dolfin/math/Legendre.h', 'submodule': 'math', 'derived': [], 'bases': [], 'module': 'function'}),
+('ALE', {'header': 'dolfin/ale/ALE.h', 'submodule': 'ale', 'derived': [], 'bases': [], 'module': 'function'}),
+('MeshDisplacement', {'header': 'dolfin/ale/MeshDisplacement.h', 'submodule': 'ale', 'derived': [], 'bases': ['Variable', 'ufc::function', 'Expression', 'GenericFunction'], 'module': 'function'}),
+('graph_set_type', {'header': 'dolfin/graph/Graph.h', 'submodule': 'graph', 'derived': [], 'bases': [], 'module': 'function'}),
+('Graph', {'header': 'dolfin/graph/Graph.h', 'submodule': 'graph', 'derived': [], 'bases': [], 'module': 'function'}),
+('GraphBuilder', {'header': 'dolfin/graph/GraphBuilder.h', 'submodule': 'graph', 'derived': [], 'bases': [], 'module': 'function'}),
+('BoostGraphOrdering', {'header': 'dolfin/graph/BoostGraphOrdering.h', 'submodule': 'graph', 'derived': [], 'bases': [], 'module': 'function'}),
+('SCOTCH', {'header': 'dolfin/graph/SCOTCH.h', 'submodule': 'graph', 'derived': [], 'bases': [], 'module': 'function'}),
+('GenericDofMap', {'header': 'dolfin/fem/GenericDofMap.h', 'submodule': 'fem', 'derived': ['DofMap', 'CCFEMDofMap'], 'bases': ['Variable'], 'module': 'fem'}),
+('DofMap', {'header': 'dolfin/fem/DofMap.h', 'submodule': 'fem', 'derived': [], 'bases': ['Variable', 'GenericDofMap'], 'module': 'fem'}),
+('Equation', {'header': 'dolfin/fem/Equation.h', 'submodule': 'fem', 'derived': [], 'bases': [], 'module': 'fem'}),
+('FiniteElement', {'header': 'dolfin/fem/FiniteElement.h', 'submodule': 'fem', 'derived': [], 'bases': [], 'module': 'fem'}),
+('BasisFunction', {'header': 'dolfin/fem/BasisFunction.h', 'submodule': 'fem', 'derived': [], 'bases': ['ufc::function'], 'module': 'fem'}),
+('DirichletBC', {'header': 'dolfin/fem/DirichletBC.h', 'submodule': 'fem', 'derived': [], 'bases': ['Variable', 'Hierarchical'], 'module': 'fem'}),
+('PointSource', {'header': 'dolfin/fem/PointSource.h', 'submodule': 'fem', 'derived': [], 'bases': [], 'module': 'fem'}),
+('LocalSolver', {'header': 'dolfin/fem/LocalSolver.h', 'submodule': 'fem', 'derived': [], 'bases': [], 'module': 'fem'}),
+('Form', {'header': 'dolfin/fem/Form.h', 'submodule': 'fem', 'derived': ['GoalFunctional'], 'bases': ['Hierarchical'], 'module': 'fem'}),
+('bool_deprecated', {'header': 'dolfin/fem/AssemblerBase.h', 'submodule': 'fem', 'derived': [], 'bases': [], 'module': 'fem'}),
+('AssemblerBase', {'header': 'dolfin/fem/AssemblerBase.h', 'submodule': 'fem', 'derived': ['SystemAssembler', 'Assembler', 'OpenMpAssembler'], 'bases': [], 'module': 'fem'}),
+('Assembler', {'header': 'dolfin/fem/Assembler.h', 'submodule': 'fem', 'derived': [], 'bases': ['AssemblerBase'], 'module': 'fem'}),
+('SparsityPatternBuilder', {'header': 'dolfin/fem/SparsityPatternBuilder.h', 'submodule': 'fem', 'derived': [], 'bases': [], 'module': 'fem'}),
+('SystemAssembler', {'header': 'dolfin/fem/SystemAssembler.h', 'submodule': 'fem', 'derived': [], 'bases': ['AssemblerBase'], 'module': 'fem'}),
+('LinearVariationalProblem', {'header': 'dolfin/fem/LinearVariationalProblem.h', 'submodule': 'fem', 'derived': [], 'bases': ['Hierarchical'], 'module': 'fem'}),
+('LinearVariationalSolver', {'header': 'dolfin/fem/LinearVariationalSolver.h', 'submodule': 'fem', 'derived': [], 'bases': ['Variable'], 'module': 'fem'}),
+('NonlinearVariationalProblem', {'header': 'dolfin/fem/NonlinearVariationalProblem.h', 'submodule': 'fem', 'derived': [], 'bases': ['Hierarchical'], 'module': 'fem'}),
+('NonlinearVariationalSolver', {'header': 'dolfin/fem/NonlinearVariationalSolver.h', 'submodule': 'fem', 'derived': [], 'bases': ['Variable'], 'module': 'fem'}),
+('CCFEMForm', {'header': 'dolfin/fem/CCFEMForm.h', 'submodule': 'fem', 'derived': [], 'bases': [], 'module': 'fem'}),
+('CCFEMDofMap', {'header': 'dolfin/fem/CCFEMDofMap.h', 'submodule': 'fem', 'derived': [], 'bases': ['Variable', 'GenericDofMap'], 'module': 'fem'}),
+('CCFEMAssembler', {'header': 'dolfin/fem/CCFEMAssembler.h', 'submodule': 'fem', 'derived': [], 'bases': [], 'module': 'fem'}),
+('OpenMpAssembler', {'header': 'dolfin/fem/OpenMpAssembler.h', 'submodule': 'fem', 'derived': [], 'bases': ['AssemblerBase'], 'module': 'fem'}),
+('MultiStageScheme', {'header': 'dolfin/multistage/MultiStageScheme.h', 'submodule': 'multistage', 'derived': [], 'bases': ['Variable'], 'module': 'fem'}),
+('RKSolver', {'header': 'dolfin/multistage/RKSolver.h', 'submodule': 'multistage', 'derived': [], 'bases': [], 'module': 'fem'}),
+('PointIntegralSolver', {'header': 'dolfin/multistage/PointIntegralSolver.h', 'submodule': 'multistage', 'derived': [], 'bases': ['Variable'], 'module': 'fem'}),
+('GenericAdaptiveVariationalSolver', {'header': 'dolfin/adaptivity/GenericAdaptiveVariationalSolver.h', 'submodule': 'adaptivity', 'derived': ['AdaptiveLinearVariationalSolver', 'AdaptiveNonlinearVariationalSolver'], 'bases': ['Variable'], 'module': 'fem'}),
+('AdaptiveLinearVariationalSolver', {'header': 'dolfin/adaptivity/AdaptiveLinearVariationalSolver.h', 'submodule': 'adaptivity', 'derived': [], 'bases': ['Variable', 'GenericAdaptiveVariationalSolver'], 'module': 'fem'}),
+('AdaptiveNonlinearVariationalSolver', {'header': 'dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h', 'submodule': 'adaptivity', 'derived': [], 'bases': ['Variable', 'GenericAdaptiveVariationalSolver'], 'module': 'fem'}),
+('GoalFunctional', {'header': 'dolfin/adaptivity/GoalFunctional.h', 'submodule': 'adaptivity', 'derived': [], 'bases': ['Hierarchical', 'Form'], 'module': 'fem'}),
+('ErrorControl', {'header': 'dolfin/adaptivity/ErrorControl.h', 'submodule': 'adaptivity', 'derived': [], 'bases': ['Variable', 'Hierarchical'], 'module': 'fem'}),
+('Extrapolation', {'header': 'dolfin/adaptivity/Extrapolation.h', 'submodule': 'adaptivity', 'derived': [], 'bases': [], 'module': 'fem'}),
+('LocalAssembler', {'header': 'dolfin/adaptivity/LocalAssembler.h', 'submodule': 'adaptivity', 'derived': [], 'bases': [], 'module': 'fem'}),
+('TimeSeries', {'header': 'dolfin/adaptivity/TimeSeries.h', 'submodule': 'adaptivity', 'derived': [], 'bases': ['Variable'], 'module': 'fem'}),
+('TimeSeriesHDF5', {'header': 'dolfin/adaptivity/TimeSeriesHDF5.h', 'submodule': 'adaptivity', 'derived': [], 'bases': ['Variable'], 'module': 'fem'}),
+('VTKPlotter', {'header': 'dolfin/plot/VTKPlotter.h', 'submodule': 'plot', 'derived': [], 'bases': ['Variable'], 'module': 'io'}),
+('GenericFile', {'header': 'dolfin/io/GenericFile.h', 'submodule': 'io', 'derived': ['XDMFFile'], 'bases': [], 'module': 'io'}),
+('File', {'header': 'dolfin/io/File.h', 'submodule': 'io', 'derived': [], 'bases': [], 'module': 'io'}),
+('XDMFFile', {'header': 'dolfin/io/XDMFFile.h', 'submodule': 'io', 'derived': [], 'bases': ['Variable', 'GenericFile'], 'module': 'io'}),
+('HDF5File', {'header': 'dolfin/io/HDF5File.h', 'submodule': 'io', 'derived': [], 'bases': ['Variable'], 'module': 'io'}),
+('HDF5Attribute', {'header': 'dolfin/io/HDF5Attribute.h', 'submodule': 'io', 'derived': [], 'bases': [], 'module': 'io'}),])
+
+# A map between modules and its submodules
+module_to_submodules = OrderedDict([\
+('common', ['common', 'parameter', 'log']),
+('mesh', ['mesh', 'generation', 'geometry', 'refinement']),
+('la', ['la', 'nls']),
+('function', ['function', 'math', 'ale', 'graph']),
+('fem', ['fem', 'multistage', 'adaptivity']),
+('io', ['plot', 'io']),])
+
+# A reverse map between submodules and modules
+submodule_info = OrderedDict([\
+('common', {'headers': ['dolfin/common/init.h', 'dolfin/common/defines.h', 'dolfin/common/types.h', 'dolfin/common/constants.h', 'dolfin/common/timing.h', 'dolfin/common/Array.h', 'dolfin/common/IndexSet.h', 'dolfin/common/Set.h', 'dolfin/common/Timer.h', 'dolfin/common/Variable.h', 'dolfin/common/Hierarchical.h', 'dolfin/common/MPI.h', 'dolfin/common/SubSystemsManager.h'], 'has_post': True, 'module': 'common', 'has_pre': True}),
+('parameter', {'headers': ['dolfin/parameter/Parameter.h', 'dolfin/parameter/Parameters.h', 'dolfin/parameter/GlobalParameters.h'], 'has_post': True, 'module': 'common', 'has_pre': True}),
+('log', {'headers': ['dolfin/log/log.h', 'dolfin/log/Event.h', 'dolfin/log/Progress.h', 'dolfin/log/Table.h', 'dolfin/log/LogLevel.h'], 'has_post': True, 'module': 'common', 'has_pre': True}),
+('mesh', {'headers': ['dolfin/mesh/CellType.h', 'dolfin/mesh/MeshTopology.h', 'dolfin/mesh/MeshGeometry.h', 'dolfin/mesh/MeshDomains.h', 'dolfin/mesh/MeshData.h', 'dolfin/mesh/Mesh.h', 'dolfin/mesh/MeshEntity.h', 'dolfin/mesh/MeshEntityIterator.h', 'dolfin/mesh/MeshEntityIteratorBase.h', 'dolfin/mesh/SubsetIterator.h', 'dolfin/mesh/Vertex.h', 'dolfin/mesh/Edge.h', 'dolfin/mesh/Face.h', 'dolfin/mesh/Facet.h', 'dolfin/mesh/Cell.h', 'dolfin/mesh/FacetCell.h', 'dolfin/mesh/MeshConnectivity.h', 'dolfin/mesh/MeshEditor.h', 'dolfin/mesh/DynamicMeshEditor.h', 'dolfin/mesh/LocalMeshValueCollection.h', 'dolfin/mesh/MeshFunction.h', 'dolfin/mesh/MeshValueCollection.h', 'dolfin/mesh/MeshColoring.h', 'dolfin/mesh/MeshRenumbering.h', 'dolfin/mesh/MeshTransformation.h', 'dolfin/mesh/LocalMeshData.h', 'dolfin/mesh/SubDomain.h', 'dolfin/mesh/SubMesh.h', 'dolfin/mesh/Restriction.h', 'dolfin/mesh/DomainBoundary.h', 'dolfin/mesh/BoundaryMesh.h', 'dolfin/mesh/PeriodicBoundaryComputation.h', 'dolfin/mesh/MeshQuality.h'], 'has_post': True, 'module': 'mesh', 'has_pre': True}),
+('generation', {'headers': ['dolfin/generation/ImplicitDomainMeshGenerator.h', 'dolfin/generation/PolygonalMeshGenerator.h', 'dolfin/generation/PolyhedralMeshGenerator.h', 'dolfin/generation/Triangulate.h', 'dolfin/generation/BoxMesh.h', 'dolfin/generation/EllipseMesh.h', 'dolfin/generation/EllipsoidMesh.h', 'dolfin/generation/IntervalMesh.h', 'dolfin/generation/RectangleMesh.h', 'dolfin/generation/UnitTetrahedronMesh.h', 'dolfin/generation/UnitCubeMesh.h', 'dolfin/generation/UnitIntervalMesh.h', 'dolfin/generation/UnitTriangleMesh.h', 'dolfin/generation/UnitSquareMesh.h', 'dolfin/generation/CSGGeometry.h', 'dolfin/generation/CSGMeshGenerator.h', 'dolfin/generation/CSGCGALMeshGenerator2D.h', 'dolfin/generation/CSGCGALMeshGenerator3D.h', 'dolfin/generation/CSGOperators.h', 'dolfin/generation/CSGPrimitive.h', 'dolfin/generation/CSGPrimitives2D.h', 'dolfin/generation/CSGPrimitives3D.h', 'dolfin/generation/CSGGeometries3D.h'], 'has_post': True, 'module': 'mesh', 'has_pre': False}),
+('geometry', {'headers': ['dolfin/geometry/ImplicitSurface.h', 'dolfin/geometry/Point.h', 'dolfin/geometry/BoundingBoxTree.h', 'dolfin/geometry/GenericBoundingBoxTree.h', 'dolfin/geometry/BoundingBoxTree3D.h', 'dolfin/geometry/MeshPointIntersection.h', 'dolfin/geometry/intersect.h'], 'has_post': True, 'module': 'mesh', 'has_pre': True}),
+('refinement', {'headers': ['dolfin/refinement/refine.h'], 'has_post': False, 'module': 'mesh', 'has_pre': False}),
+('la', {'headers': ['dolfin/la/ublas.h', 'dolfin/la/LinearAlgebraObject.h', 'dolfin/la/GenericLinearOperator.h', 'dolfin/la/GenericTensor.h', 'dolfin/la/GenericMatrix.h', 'dolfin/la/GenericSparsityPattern.h', 'dolfin/la/GenericVector.h', 'dolfin/la/VectorSpaceBasis.h', 'dolfin/la/GenericLinearSolver.h', 'dolfin/la/GenericLUSolver.h', 'dolfin/la/GenericPreconditioner.h', 'dolfin/la/PETScOptions.h', 'dolfin/la/PETScObject.h', 'dolfin/la/PETScBaseMatrix.h', 'dolfin/la/uBLASFactory.h', 'dolfin/la/uBLASMatrix.h', 'dolfin/la/uBLASLinearOperator.h', 'dolfin/la/PETScMatrix.h', 'dolfin/la/PETScLinearOperator.h', 'dolfin/la/PETScPreconditioner.h', 'dolfin/la/EpetraLUSolver.h', 'dolfin/la/EpetraKrylovSolver.h', 'dolfin/la/EpetraMatrix.h', 'dolfin/la/EpetraVector.h', 'dolfin/la/PETScKrylovSolver.h', 'dolfin/la/PETScLUSolver.h', 'dolfin/la/CholmodCholeskySolver.h', 'dolfin/la/UmfpackLUSolver.h', 'dolfin/la/MUMPSLUSolver.h', 'dolfin/la/PaStiXLUSolver.h', 'dolfin/la/STLMatrix.h', 'dolfin/la/CoordinateMatrix.h', 'dolfin/la/uBLASVector.h', 'dolfin/la/PETScVector.h', 'dolfin/la/SparsityPattern.h', 'dolfin/la/GenericLinearAlgebraFactory.h', 'dolfin/la/DefaultFactory.h', 'dolfin/la/PETScUserPreconditioner.h', 'dolfin/la/PETScFactory.h', 'dolfin/la/PETScCuspFactory.h', 'dolfin/la/EpetraFactory.h', 'dolfin/la/STLFactory.h', 'dolfin/la/SLEPcEigenSolver.h', 'dolfin/la/TrilinosPreconditioner.h', 'dolfin/la/uBLASSparseMatrix.h', 'dolfin/la/uBLASDenseMatrix.h', 'dolfin/la/uBLASPreconditioner.h', 'dolfin/la/uBLASKrylovSolver.h', 'dolfin/la/uBLASILUPreconditioner.h', 'dolfin/la/Vector.h', 'dolfin/la/Matrix.h', 'dolfin/la/Scalar.h', 'dolfin/la/LinearSolver.h', 'dolfin/la/KrylovSolver.h', 'dolfin/la/LUSolver.h', 'dolfin/la/solve.h', 'dolfin/la/BlockVector.h', 'dolfin/la/BlockMatrix.h', 'dolfin/la/LinearOperator.h'], 'has_post': True, 'module': 'la', 'has_pre': True}),
+('nls', {'headers': ['dolfin/nls/NonlinearProblem.h', 'dolfin/nls/NewtonSolver.h', 'dolfin/nls/PETScSNESSolver.h', 'dolfin/nls/TAOLinearBoundSolver.h'], 'has_post': False, 'module': 'la', 'has_pre': True}),
+('function', {'headers': ['dolfin/function/GenericFunction.h', 'dolfin/function/Expression.h', 'dolfin/function/FunctionAXPY.h', 'dolfin/function/Function.h', 'dolfin/function/FunctionSpace.h', 'dolfin/function/SubSpace.h', 'dolfin/function/Constant.h', 'dolfin/function/SpecialFunctions.h', 'dolfin/function/SpecialFacetFunction.h', 'dolfin/function/CCFEMFunctionSpace.h', 'dolfin/function/FunctionAssigner.h', 'dolfin/function/assign.h', 'dolfin/function/CCFEMFunction.h', 'dolfin/function/LagrangeInterpolator.h'], 'has_post': True, 'module': 'function', 'has_pre': True}),
+('math', {'headers': ['dolfin/math/basic.h', 'dolfin/math/Lagrange.h', 'dolfin/math/Legendre.h'], 'has_post': False, 'module': 'function', 'has_pre': False}),
+('ale', {'headers': ['dolfin/ale/ALE.h', 'dolfin/ale/MeshDisplacement.h'], 'has_post': False, 'module': 'function', 'has_pre': True}),
+('graph', {'headers': ['dolfin/graph/Graph.h', 'dolfin/graph/GraphBuilder.h', 'dolfin/graph/BoostGraphOrdering.h', 'dolfin/graph/SCOTCH.h'], 'has_post': True, 'module': 'function', 'has_pre': False}),
+('fem', {'headers': ['dolfin/fem/GenericDofMap.h', 'dolfin/fem/DofMap.h', 'dolfin/fem/fem_utils.h', 'dolfin/fem/Equation.h', 'dolfin/fem/FiniteElement.h', 'dolfin/fem/BasisFunction.h', 'dolfin/fem/DirichletBC.h', 'dolfin/fem/PointSource.h', 'dolfin/fem/assemble.h', 'dolfin/fem/LocalSolver.h', 'dolfin/fem/solve.h', 'dolfin/fem/Form.h', 'dolfin/fem/AssemblerBase.h', 'dolfin/fem/Assembler.h', 'dolfin/fem/SparsityPatternBuilder.h', 'dolfin/fem/SystemAssembler.h', 'dolfin/fem/LinearVariationalProblem.h', 'dolfin/fem/LinearVariationalSolver.h', 'dolfin/fem/NonlinearVariationalProblem.h', 'dolfin/fem/NonlinearVariationalSolver.h', 'dolfin/fem/CCFEMForm.h', 'dolfin/fem/CCFEMDofMap.h', 'dolfin/fem/CCFEMAssembler.h', 'dolfin/fem/OpenMpAssembler.h'], 'has_post': True, 'module': 'fem', 'has_pre': True}),
+('multistage', {'headers': ['dolfin/multistage/MultiStageScheme.h', 'dolfin/multistage/RKSolver.h', 'dolfin/multistage/PointIntegralSolver.h'], 'has_post': False, 'module': 'fem', 'has_pre': True}),
+('adaptivity', {'headers': ['dolfin/adaptivity/GenericAdaptiveVariationalSolver.h', 'dolfin/adaptivity/AdaptiveLinearVariationalSolver.h', 'dolfin/adaptivity/AdaptiveNonlinearVariationalSolver.h', 'dolfin/adaptivity/GoalFunctional.h', 'dolfin/adaptivity/ErrorControl.h', 'dolfin/adaptivity/Extrapolation.h', 'dolfin/adaptivity/LocalAssembler.h', 'dolfin/adaptivity/TimeSeries.h', 'dolfin/adaptivity/TimeSeriesHDF5.h', 'dolfin/adaptivity/adapt.h', 'dolfin/adaptivity/marking.h', 'dolfin/adaptivity/adaptivesolve.h'], 'has_post': True, 'module': 'fem', 'has_pre': True}),
+('plot', {'headers': ['dolfin/plot/plot.h', 'dolfin/plot/VTKPlotter.h'], 'has_post': False, 'module': 'io', 'has_pre': False}),
+('io', {'headers': ['dolfin/io/GenericFile.h', 'dolfin/io/File.h', 'dolfin/io/XDMFFile.h', 'dolfin/io/HDF5File.h', 'dolfin/io/HDF5Attribute.h'], 'has_post': True, 'module': 'io', 'has_pre': True}),])
diff --git a/site-packages/dolfin/cpp/__init__.py b/site-packages/dolfin/cpp/__init__.py
new file mode 100644
index 0000000..ce8e1f6
--- /dev/null
+++ b/site-packages/dolfin/cpp/__init__.py
@@ -0,0 +1,82 @@
+"""Expose names from the compiled cpp modules to the dolfin.cpp
+namespace"""
+
+# Copyright (C) 2012 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Garth N. Wells, 2013
+#
+# First added:  2012-01-29
+# Last changed: 2013-11-01
+
+__all__ = []
+
+#--- Imports the SWIG-generated Python code (C++ interface) ---
+
+# NOTE: Order of these imports need to be preserved
+_compiled_modules = ["common", "la", "function", "io", "mesh", "fem"]
+
+# Prohibit includes with these names
+_not_includes = _compiled_modules[:]
+_not_includes.extend(["ufc", "new_instancemethod", "SHARED_PTR_DISOWN", \
+                      "weakref", "weakref_proxy", "cvar"])
+
+# Import all compiled modules
+for module_name in _compiled_modules:
+
+    # Import the module
+    exec("import %s" % module_name)
+    module = globals()[module_name]
+
+    # Add the module to the global namespace
+    __all__.append(module_name)
+
+    # Collect all classes to outrule static class methods
+    _all_classes = []
+
+    # Iterate over the modules attributes and add names to global namespace
+    for name in sorted(module.__dict__.keys()):
+
+        # Skip some includes
+        if name in _not_includes:
+            continue
+
+        # Do not add an attrbute name which contains "swigregister" or
+        # starts with "_"
+        if "swigregister" in name or name[0] == "_":
+            continue
+
+        # Get attr
+        attr = getattr(module, name)
+
+        # Check for class
+        if isinstance(attr, type):
+            _all_classes.append(name)
+        else:
+            # If not a class, check if first part of function name is
+            # the same as a class name
+            if name.split("_")[0] in _all_classes:
+                continue
+
+        # Add the attribute to the global namespace
+        globals()[name] = attr
+        __all__.append(name)
+
+# Add versions
+# -----------
+globals()["__swigversion__"] = getattr(module, "__swigversion__")
+globals()["__version__"] = common.dolfin_version()
diff --git a/site-packages/dolfin/deprecation.py b/site-packages/dolfin/deprecation.py
new file mode 100644
index 0000000..0d36197
--- /dev/null
+++ b/site-packages/dolfin/deprecation.py
@@ -0,0 +1,36 @@
+# Copyright (C) 2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-09-29
+# Last changed: 2012-09-29
+
+import dolfin.cpp as cpp
+
+#--- Deprecation of down_cast ---
+
+def _down_cast(self):
+    cpp.warning("foo.down_cast() is deprecated, please use as_backend_type(foo).")
+    return cpp.as_backend_type(self)
+
+cpp.Matrix.down_cast = _down_cast
+cpp.Vector.down_cast = _down_cast
+
+def down_cast(foo):
+    cpp.warning("down_cast(foo) is deprecated, please use as_backend_type(foo).")
+    return cpp.as_backend_type(foo)
+
+#--- Deprecation of ... etc. ---
diff --git a/site-packages/dolfin/fem/__init__.py b/site-packages/dolfin/fem/__init__.py
new file mode 100644
index 0000000..3f29648
--- /dev/null
+++ b/site-packages/dolfin/fem/__init__.py
@@ -0,0 +1,32 @@
+"""The function module of dolfin"""
+from dolfin.fem import form
+from dolfin.fem import assembling
+from dolfin.fem import norms
+from dolfin.fem import projection
+from dolfin.fem import interpolation
+from dolfin.fem import bcs
+from dolfin.fem import formmanipulations
+
+from form import *
+from assembling import *
+from solving import *
+from adaptivesolving import *
+from interpolation import *
+from norms import *
+from projection import *
+from bcs import *
+from formmanipulations import *
+
+# NOTE: The automatic documentation system in DOLFIN requires to _not_ define
+# NOTE: classes or functions within this file. Use separate modules for that
+# NOTE: purpose.
+
+__all__ = form.__all__ + \
+          assembling.__all__ + \
+          solving.__all__ + \
+          adaptivesolving.__all__ + \
+          norms.__all__ + \
+          projection.__all__ + \
+          interpolation.__all__ + \
+          bcs.__all__ + \
+          formmanipulations.__all__
diff --git a/site-packages/dolfin/fem/adaptivesolving.py b/site-packages/dolfin/fem/adaptivesolving.py
new file mode 100644
index 0000000..91b7050
--- /dev/null
+++ b/site-packages/dolfin/fem/adaptivesolving.py
@@ -0,0 +1,222 @@
+"""This module provides a Python layer on top of the C++
+Adaptive*VariationalSolver classes"""
+
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2011-06-27
+# Last changed: 2011-11-14
+
+__all__ = ["AdaptiveLinearVariationalSolver",
+           "AdaptiveNonlinearVariationalSolver",
+           "generate_error_control",
+           "generate_error_control_forms"]
+
+import dolfin.cpp as cpp
+
+from dolfin.fem.form import Form
+from dolfin.fem.solving import LinearVariationalProblem
+from dolfin.fem.solving import NonlinearVariationalProblem
+
+from dolfin.fem.errorcontrolgenerator import DOLFINErrorControlGenerator
+
+class AdaptiveLinearVariationalSolver(cpp.AdaptiveLinearVariationalSolver):
+
+    # Reuse doc-string
+    __doc__ = cpp.AdaptiveLinearVariationalSolver.__doc__
+
+    def __init__(self, problem, goal):
+        """
+        Create AdaptiveLinearVariationalSolver
+
+        *Arguments*
+
+            problem (:py:class:`LinearVariationalProblem <dolfin.fem.solving.LinearVariationalProblem>`)
+
+        """
+
+        # Store problem
+        self.problem = problem
+
+        # Generate error control object
+        ec = generate_error_control(self.problem, goal)
+
+        # Compile goal functional separately
+        p = self.problem.form_compiler_parameters
+        M = Form(goal, form_compiler_parameters=p)
+
+        # Initialize C++ base class
+        cpp.AdaptiveLinearVariationalSolver.__init__(self, problem, M, ec)
+
+    def solve(self, tol):
+        """
+        Solve such that the estimated error in the functional 'goal'
+        is less than the given tolerance 'tol'
+
+        *Arguments*
+
+            tol (float)
+
+                The error tolerance
+        """
+
+        # Call cpp.AdaptiveLinearVariationalSolver.solve directly
+        cpp.AdaptiveLinearVariationalSolver.solve(self, tol)
+
+class AdaptiveNonlinearVariationalSolver(cpp.AdaptiveNonlinearVariationalSolver):
+
+    # Reuse doc-string
+    __doc__ = cpp.AdaptiveNonlinearVariationalSolver.__doc__
+
+    def __init__(self, problem, goal):
+        """
+        Create AdaptiveNonlinearVariationalSolver
+
+        *Arguments*
+
+            problem (:py:class:`NonlinearVariationalProblem <dolfin.fem.solving.NonlinearVariationalProblem>`)
+
+        """
+
+        # Store problem
+        self.problem = problem
+
+        # Generate error control object
+        ec = generate_error_control(self.problem, goal)
+
+        # Compile goal functional separately
+        p = self.problem.form_compiler_parameters
+        M = Form(goal, form_compiler_parameters=p)
+
+        # Initialize C++ base class
+        cpp.AdaptiveNonlinearVariationalSolver.__init__(self, problem, M, ec)
+
+    def solve(self, tol):
+        """
+        Solve such that the estimated error in the functional 'goal'
+        is less than the given tolerance 'tol'.
+
+        *Arguments*
+
+            tol (float)
+
+                The error tolerance
+        """
+
+        # Call cpp.AdaptiveNonlinearVariationlSolver.solve with ec
+        cpp.AdaptiveNonlinearVariationalSolver.solve(self, tol)
+
+def generate_error_control(problem, goal):
+    """
+    Create suitable ErrorControl object from problem and the goal
+
+    *Arguments*
+
+        problem (:py:class:`LinearVariationalProblem <dolfin.fem.solving.LinearVariationalProblem>` or :py:class:`NonlinearVariationalProblem <dolfin.fem.solving.NonlinearVariationalProblem>`)
+
+            The (primal) problem
+
+        goal (:py:class:`Form <dolfin.fem.form.Form>`)
+
+            The goal functional
+
+    *Returns*
+
+        :py:class:`ErrorControl <dolfin.cpp.ErrorControl>`
+
+    """
+    # Generate UFL forms to be used for error control
+    (ufl_forms, is_linear) = generate_error_control_forms(problem, goal)
+
+    # Compile generated forms
+    p = problem.form_compiler_parameters
+    forms = [Form(form, form_compiler_parameters=p) for form in ufl_forms]
+
+    # Create cpp.ErrorControl object
+    forms += [is_linear]  # NOTE: Lingering design inconsistency.
+    ec = cpp.ErrorControl(*forms)
+
+    # Return generated ErrorControl
+    return ec
+
+def generate_error_control_forms(problem, goal):
+    """
+    Create UFL forms required for initializing an ErrorControl object
+
+    *Arguments*
+
+        problem (:py:class:`LinearVariationalProblem <dolfin.fem.solving.LinearVariationalProblem>` or :py:class:`NonlinearVariationalProblem <dolfin.fem.solving.NonlinearVariationalProblem>`)
+
+            The (primal) problem
+
+        goal (:py:class:`Form <dolfin.fem.form.Form>`)
+
+            The goal functional
+
+    *Returns*
+
+        (tuple of forms, bool)
+
+    """
+
+    msg = "Generating forms required for error control, this may take some time..."
+    cpp.info(msg)
+
+    # Paranoid checks added after introduction of multidomain features in ufl:
+    for form in [goal]:
+        assert len(form.domains()) > 0, "Error control got as input a form with no domain!"
+        assert len(form.domains()) == 1, "Error control got as input a form with more than one domain!"
+
+    # Extract primal forms from problem
+    is_linear = True
+    if isinstance(problem, LinearVariationalProblem):
+        primal = (problem.a_ufl, problem.L_ufl)
+
+        # Paranoid checks added after introduction of multidomain features in ufl:
+        for form in primal:
+            assert len(form.domains()) > 0, "Error control got as input a form with no domain!"
+            assert len(form.domains()) == 1, "Error control got as input a form with more than one domain!"
+
+    elif isinstance(problem, NonlinearVariationalProblem):
+        is_linear = False
+        primal = problem.F_ufl
+
+        # Paranoid checks added after introduction of multidomain features in ufl:
+        for form in [primal]:
+            assert len(form.domains()) > 0, "Error control got as input a form with no domain!"
+            assert len(form.domains()) == 1, "Error control got as input a form with more than one domain!"
+
+    else:
+        cpp.dolfin_error("adaptivesolving.py",
+                         "generate forms required for error control",
+                         "Unknown problem type (\"%s\")" % str(problem))
+
+    # Extract unknown Function from problem
+    u = problem.u_ufl
+
+    # Get DOLFIN's error control generator to generate all forms
+    generator = DOLFINErrorControlGenerator(primal, goal, u)
+    forms = generator.generate_all_error_control_forms()
+
+    # Paranoid checks added after introduction of multidomain features in ufl:
+    for form in forms:
+        assert len(form.domains()) > 0, "Error control produced a form with no domain!"
+        assert len(form.domains()) == 1, "Error control produced a form with more than one domain!"
+
+    return (forms, is_linear)
diff --git a/site-packages/dolfin/fem/assembling.py b/site-packages/dolfin/fem/assembling.py
new file mode 100644
index 0000000..b0397ed
--- /dev/null
+++ b/site-packages/dolfin/fem/assembling.py
@@ -0,0 +1,453 @@
+"""This module provides functionality for form assembly in Python,
+corresponding to the C++ assembly and PDE classes.
+
+The C++ :py:class:`assemble <dolfin.cpp.assemble>` function
+(renamed to cpp_assemble) is wrapped with an additional
+preprocessing step where code is generated using the
+FFC JIT compiler.
+
+The C++ PDE classes are reimplemented in Python since the C++ classes
+rely on the dolfin::Form class which is not used on the Python side."""
+
+# Copyright (C) 2007-2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Martin Sandve Alnaes, 2008.
+# Modified by Johan Hake, 2008-2009.
+# Modified by Garth N. Wells, 2008-2013.
+# Modified by Joachim B. Haga, 2012.
+
+__all__ = ["assemble", "assemble_system", "SystemAssembler"]
+
+import types
+
+# UFL modules
+from ufl import interval, triangle, tetrahedron
+
+# Import SWIG-generated extension module (DOLFIN C++)
+import dolfin.cpp as cpp
+
+# Local imports
+from dolfin.fem.form import *
+
+def _create_dolfin_form(form,
+                        form_compiler_parameters=None,
+                        # TODO: Remove these after 1.4 release:
+                        mesh=None,
+                        coefficients=None,
+                        function_spaces=None,
+                        # TODO: Remove these after 1.5 release:
+                        cell_domains=None,
+                        exterior_facet_domains=None,
+                        interior_facet_domains=None):
+
+    # First check if we got a cpp.Form which originates from cpp layer
+    if isinstance(form, cpp.Form) and not hasattr(form, "_compiled_form"):
+        # Then we just try to use that one
+        dolfin_form = form
+        # Set mesh if specified (important for functionals without a function spaces)
+        if mesh is not None:
+            cpp.warning("Passing mesh modifies the input dolfin Form!")
+            dolfin_form.set_mesh(mesh)
+        if function_spaces is not None:
+            cpp.warning("Ignoring function_spaces with a dolfin Form!")
+        if coefficients is not None:
+            cpp.warning("Ignoring coefficients with a dolfin Form!")
+        if form_compiler_parameters is not None:
+            cpp.warning("Ignoring form_compiler_parameters with a dolfin Form!")
+
+    else:
+        # Wrap form
+        dolfin_form = Form(form,
+                           form_compiler_parameters=form_compiler_parameters,
+                           # TODO: Remove these after 1.4 release:
+                           function_spaces=function_spaces,
+                           coefficients=coefficients,
+                           mesh=mesh)
+
+    # Attach domains to form
+    if cell_domains is not None:
+        if form is dolfin_form:
+            cpp.warning("Passing cell_domains modifies the input dolfin Form!")
+        if not isinstance(cell_domains, cpp.MeshFunctionSizet):
+            raise TypeError("expected a 'MeshFunction' of 'Sizet' or 'None', for argument 'cell_domains'")
+        dolfin_form.set_cell_domains(cell_domains);
+    if interior_facet_domains is not None:
+        if form is dolfin_form:
+            cpp.warning("Passing interior_facet_domains modifies the input dolfin Form!")
+        if not isinstance(interior_facet_domains, cpp.MeshFunctionSizet):
+            raise TypeError("expected a 'MeshFunction' of 'Sizet' or 'None', for argument 'interior_facet_domains'")
+        dolfin_form.set_interior_facet_domains(interior_facet_domains);
+    if exterior_facet_domains is not None:
+        if form is dolfin_form:
+            cpp.warning("Passing exterior_facet_domains modifies the input dolfin Form!")
+        if not isinstance(exterior_facet_domains, cpp.MeshFunctionSizet):
+            raise TypeError("expected a 'MeshFunction' of 'Sizet' or 'None', for argument 'exterior_facet_domains'")
+        dolfin_form.set_exterior_facet_domains(exterior_facet_domains);
+
+    return dolfin_form
+
+# JIT assembler
+def assemble(form,
+             tensor=None,
+             bcs=None,
+             form_compiler_parameters=None,
+             add_values=False,
+             finalize_tensor=True,
+             keep_diagonal=False,
+             backend=None,
+             # TODO: Remove after 1.5 release:
+             cell_domains=None,
+             exterior_facet_domains=None,
+             interior_facet_domains=None,
+             # TODO: Remove after 1.4 release:
+             mesh=None,
+             coefficients=None,
+             function_spaces=None,
+             reset_sparsity=None,
+             ):
+    """
+    Assemble the given form and return the corresponding tensor.
+
+    *Arguments*
+        Depending on the input form, which may be a functional, linear
+        form, bilinear form or higher rank form, a scalar value, a vector,
+        a matrix or a higher rank tensor is returned.
+
+    In the simplest case, no additional arguments are needed. However,
+    additional arguments may and must in some cases be provided as
+    outlined below.
+
+    The ``form`` can be either an FFC form or a precompiled UFC
+    form. If a precompiled or 'pure' UFC form is given, then
+    ``coefficients`` and ``function_spaces`` have to be provided
+    too. The coefficient functions should be provided as a 'dict'
+    using the FFC functions as keys. The function spaces should be
+    provided either as a list where the number of function spaces must
+    correspond to the number of basis functions in the form, or as a
+    single argument, implying that the same FunctionSpace is used for
+    all test/trial spaces.
+
+    If the form defines integrals over different subdomains,
+    :py:class:`MeshFunctions <dolfin.cpp.MeshFunction>` over the
+    corresponding topological entities defining the subdomains can be
+    provided.
+
+    The implementation of the returned tensor is determined by the
+    default linear algebra backend. This can be overridden by
+    specifying a different backend.
+
+    Each call to assemble() will create a new tensor. If the
+    ``tensor`` argument is provided, this will be used instead.
+    Parameter ``reset_sparsity`` is deprecated. Sparsity pattern of
+    ``tensor`` is reset iff ``tensor.empty()`` holds.
+
+    If the ``keep_diagonal`` is set to True, assembler ensures that
+    potential zeros on a matrix diagonal are kept in sparsity pattern
+    so every diagonal entry can be changed in a future (for example
+    by ident() or ident_zeros()).
+
+    Specific form compiler parameters can be provided by the
+    ``form_compiler_parameters`` argument. Form compiler parameters
+    can also be controlled using the global parameters stored in
+    parameters["form_compiler"].
+
+    *Examples of usage*
+        The standard stiffness matrix ``A`` and a load vector ``b``
+        can be assembled as follows:
+
+        .. code-block:: python
+
+            A = assemble(inner(grad(u),grad(v))*dx())
+            b = assemble(f*v*dx())
+
+        It is possible to explicitly prescribe the domains over which
+        integrals wll be evaluated using the arguments
+        ``cell_domains``, ``exterior_facet_domains`` and
+        ``interior_facet_domains``. For instance, using a mesh
+        function marking parts of the boundary:
+
+        .. code-block:: python
+
+            # MeshFunction marking boundary parts
+            boundary_parts = MeshFunction("size_t", mesh, mesh.topology().dim()-1)
+
+            # Sample variational forms
+            a = inner(grad(u), grad(v))*dx() + p*u*v*ds(0)
+            L = f*v*dx() - g*v*ds(1) + p*q*v*ds(0)
+
+            A = assemble(a, exterior_facet_domains=boundary_parts)
+            b = assemble(L, exterior_facet_domains=boundary_parts)
+
+        To ensure that the assembled matrix has the right type, one may use
+        the ``tensor`` argument:
+
+        .. code-block:: python
+
+            A = PETScMatrix()
+            assemble(a, tensor=A)
+
+        The form ``a`` is now assembled into the PETScMatrix ``A``.
+
+    """
+    if reset_sparsity is not None:
+        cpp.deprecation("Parameter reset_sparsity of assembler",
+                        "1.4", "1.5",
+                        "Parameter reset_sparsity of assembler"
+                        " is no longer used. Tensor is reset iff empty().")
+    if (mesh is not None
+        or function_spaces is not None
+        or coefficients is not None):
+        cpp.deprecation("Parameters mesh, function_spaces and coefficients of assemble",
+                        "1.4.0", "1.5.0",
+                        "Parameter mesh, function_spaces and coefficients of assemble"
+                        " will be removed. Include this in the ufl form instead.")
+    if (cell_domains is not None
+        or exterior_facet_domains is not None
+        or interior_facet_domains is not None):
+        cpp.deprecation("Parameters *_domains of assemble",
+                        "1.4.0", "1.6.0",
+                        "Parameter *_domains of assemble"
+                        " will be removed. Include this in the ufl form instead.")
+
+    # Create dolfin Form object referencing all data needed by assembler
+    dolfin_form = _create_dolfin_form(form, form_compiler_parameters,
+                                      mesh, coefficients, function_spaces,
+                                      cell_domains, exterior_facet_domains, interior_facet_domains)
+
+    # Create tensor
+    tensor = _create_tensor(form, dolfin_form.rank(), backend, tensor)
+
+    # Call C++ assemble function
+    assembler = cpp.Assembler()
+    assembler.add_values = add_values
+    assembler.finalize_tensor = finalize_tensor
+    assembler.keep_diagonal = keep_diagonal
+    assembler.assemble(tensor, dolfin_form)
+
+    # Convert to float for scalars
+    if dolfin_form.rank() == 0:
+        tensor = tensor.getval()
+
+    # Apply (possibly list of) boundary conditions
+    bcs = _wrap_in_list(bcs, 'bcs', cpp.DirichletBC)
+    if bcs:
+        cpp.deprecation("Passing \"bcs\" to assemble", "1.3.0", "1.4.0",
+                        "Apply DirichletBC manually after an assemble.")
+    for bc in bcs:
+        bc.apply(tensor)
+
+    # Return value
+    return tensor
+
+# JIT system assembler
+def assemble_system(A_form,
+                    b_form,
+                    bcs=None,
+                    x0=None,
+                    form_compiler_parameters=None,
+                    add_values=False,
+                    finalize_tensor=True,
+                    keep_diagonal=False,
+                    A_tensor=None,
+                    b_tensor=None,
+                    backend=None,
+                    # TODO: Remove after 1.4 release:
+                    mesh=None,
+                    A_coefficients=None,
+                    b_coefficients=None,
+                    A_function_spaces=None,
+                    b_function_spaces=None,
+                    reset_sparsity=None,
+                    # TODO: Remove after 1.5 release:
+                    cell_domains=None,
+                    exterior_facet_domains=None,
+                    interior_facet_domains=None):
+    """
+    Assemble form(s) and apply any given boundary conditions in a
+    symmetric fashion and return tensor(s).
+
+    The standard application of boundary conditions does not
+    necessarily preserve the symmetry of the assembled matrix. In
+    order to perserve symmetry in a system of equations with boundary
+    conditions, one may use the alternative assemble_system instead of
+    multiple calls to :py:func:`assemble
+    <dolfin.fem.assembling.assemble>`.
+
+    *Examples of usage*
+
+       For instance, the statements
+
+       .. code-block:: python
+
+           A = assemble(a)
+           b = assemble(L)
+           bc.apply(A, b)
+
+       can alternatively be carried out by
+
+       .. code-block:: python
+
+           A, b = assemble_system(a, L, bc)
+
+       The statement above is valid even if ``bc`` is a list of
+       :py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>`
+       instances. For more info and options, see :py:func:`assemble
+       <dolfin.fem.assembling.assemble>`.
+
+    """
+    if reset_sparsity is not None:
+        cpp.deprecation("Parameter reset_sparsity of assemble_system",
+                        "1.4", "1.5",
+                        "Parameter reset_sparsity of assemble_system"
+                        " is no longer used. Tensor is reset iff empty().")
+    if (mesh is not None
+        or A_function_spaces is not None
+        or b_function_spaces is not None
+        or A_coefficients is not None
+        or b_coefficients is not None):
+        cpp.deprecation("Parameters mesh, *_function_spaces and *_coefficients of assemble_system",
+                        "1.4.0", "1.5.0",
+                        "Parameters mesh, *_function_spaces and *_coefficients of assemble_system"
+                        " will be removed. Include this in the ufl form instead.")
+    if (cell_domains is not None
+        or exterior_facet_domains is not None
+        or interior_facet_domains is not None):
+        cpp.deprecation("Parameters *_domains of assemble_system",
+                        "1.4.0", "1.6.0",
+                        "Parameters *_domains of assemble_system"
+                        " will be removed. Include this in the ufl form instead.")
+
+    # Create dolfin Form objects referencing all data needed by assembler
+    A_dolfin_form = _create_dolfin_form(A_form, form_compiler_parameters,
+                                        mesh, A_coefficients, A_function_spaces,
+                                        cell_domains, exterior_facet_domains, interior_facet_domains)
+    b_dolfin_form = _create_dolfin_form(b_form, form_compiler_parameters,
+                                        mesh, b_coefficients, b_function_spaces,
+                                        cell_domains, exterior_facet_domains, interior_facet_domains)
+
+    # Create tensors
+    A_tensor = _create_tensor(A_form, A_dolfin_form.rank(), backend, A_tensor)
+    b_tensor = _create_tensor(b_form, b_dolfin_form.rank(), backend, b_tensor)
+
+    # Check bcs
+    bcs = _wrap_in_list(bcs, 'bcs', cpp.DirichletBC)
+
+    # Call C++ assemble function
+    assembler = cpp.SystemAssembler(A_dolfin_form, b_dolfin_form, bcs)
+    assembler.add_values = add_values
+    assembler.finalize_tensor = finalize_tensor
+    assembler.keep_diagonal = keep_diagonal
+    if x0 is not None:
+        assembler.assemble(A_tensor, b_tensor, x0)
+    else:
+        assembler.assemble(A_tensor, b_tensor)
+
+    return A_tensor, b_tensor
+
+def _wrap_in_list(obj, name, types=type):
+    if obj is None:
+        lst = []
+    elif hasattr(obj, '__iter__'):
+        lst = list(obj)
+    else:
+        lst = [obj]
+    for obj in lst:
+        if not isinstance(obj, types):
+            raise TypeError("expected a (list of) %s as '%s' argument" % (str(types),name))
+    return lst
+
+def _create_tensor(form, rank, backend, tensor):
+    "Create tensor for form"
+
+    # Check if tensor is supplied by user
+    if tensor is not None:
+        return tensor
+
+    # Check backend argument
+    if (not backend is None) and (not isinstance(backend, cpp.GenericLinearAlgebraFactory)):
+        raise TypeError("Provide a GenericLinearAlgebraFactory as 'backend'")
+
+    # Create tensor
+    if rank == 0:
+        tensor = cpp.Scalar()
+    elif rank == 1:
+        if backend: tensor = backend.create_vector()
+        else:       tensor = cpp.Vector()
+    elif rank == 2:
+        if backend: tensor = backend.create_matrix()
+        else:       tensor = cpp.Matrix()
+    else:
+        raise RuntimeError("Unable to create tensors of rank %d." % rank)
+
+    return tensor
+
+class SystemAssembler(cpp.SystemAssembler):
+    __doc__ = cpp.SystemAssembler.__doc__
+    def __init__(self, A_form, b_form,
+                 bcs=None,
+                 form_compiler_parameters=None,
+                 # TODO: Remove after 1.4 release:
+                 mesh=None,
+                 A_coefficients=None,
+                 b_coefficients=None,
+                 A_function_spaces=None,
+                 b_function_spaces=None,
+                 # TODO: Remove after 1.5 release:
+                 cell_domains=None,
+                 exterior_facet_domains=None,
+                 interior_facet_domains=None):
+        """
+        Create a SystemAssembler
+
+        * Arguments *
+           a (ufl.Form, _Form_)
+              Bilinear form
+           L (ufl.Form, _Form_)
+              Linear form
+           bcs (_DirichletBC_)
+              A list or a single DirichletBC (optional)
+        """
+        if (mesh is not None
+            or A_function_spaces is not None
+            or b_function_spaces is not None
+            or A_coefficients is not None
+            or b_coefficients is not None):
+            cpp.deprecation("Parameters mesh, *_function_spaces and *_coefficients of SystemAssembler",
+                            "1.4.0", "1.5.0",
+                            "Parameters mesh, *_function_spaces and *_coefficients of SystemAssembler"
+                            " will be removed. Include this in the ufl form instead.")
+        if (cell_domains is not None
+            or exterior_facet_domains is not None
+            or interior_facet_domains is not None):
+            cpp.deprecation("Parameters *_domains of SystemAssembler",
+                            "1.4.0", "1.6.0",
+                            "Parameters *_domains of SystemAssembler"
+                            " will be removed. Include this in the ufl form instead.")
+        # Create dolfin Form objects referencing all data needed by assembler
+        A_dolfin_form = _create_dolfin_form(A_form, form_compiler_parameters,
+                                            mesh, A_coefficients, A_function_spaces,
+                                            cell_domains, exterior_facet_domains, interior_facet_domains)
+        b_dolfin_form = _create_dolfin_form(b_form, form_compiler_parameters,
+                                            mesh, b_coefficients, b_function_spaces,
+                                            cell_domains, exterior_facet_domains, interior_facet_domains)
+
+        # Check bcs
+        bcs = _wrap_in_list(bcs, 'bcs', cpp.DirichletBC)
+
+        # Call C++ assemble function
+        cpp.SystemAssembler.__init__(self, A_dolfin_form, b_dolfin_form, bcs)
diff --git a/site-packages/dolfin/fem/bcs.py b/site-packages/dolfin/fem/bcs.py
new file mode 100644
index 0000000..f8b139f
--- /dev/null
+++ b/site-packages/dolfin/fem/bcs.py
@@ -0,0 +1,185 @@
+# Copyright (C) 2009-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Garth N. Wells, 2012
+#
+# First added:  2008-10-22
+# Last changed: 2012-08-18
+
+__all__ = ["AutoSubDomain", "DirichletBC", "homogenize"]
+
+import types
+
+import dolfin.cpp as cpp
+from dolfin.functions.constant import Constant
+from dolfin.compilemodules.subdomains import CompiledSubDomain
+import ufl
+from dolfin.fem.projection import project
+
+class AutoSubDomain(cpp.SubDomain):
+    "Wrapper class for creating a SubDomain from an inside() function."
+
+    def __init__(self, inside_function):
+        "Create SubDomain subclass for given inside() function"
+
+        # Check that we get a function
+        if not isinstance(inside_function, types.FunctionType):
+            cpp.dolfin_error("bcs.py",
+                             "auto-create subdomain",
+                             "Expecting a function (not %s)" % \
+                                 str(type(inside_function)))
+        self.inside_function = inside_function
+
+        # Check the number of arguments
+        if not inside_function.func_code.co_argcount in (1, 2):
+            cpp.dolfin_error("bcs.py",
+                             "auto-create subdomain",
+                             "Expecting a function of the form inside(x) or inside(x, on_boundary)")
+        self.num_args = inside_function.func_code.co_argcount
+
+        cpp.SubDomain.__init__(self)
+
+    def inside(self, x, on_boundary):
+        "Return true for points inside the subdomain"
+
+        if self.num_args == 1:
+            return self.inside_function(x)
+        else:
+            return self.inside_function(x, on_boundary)
+
+class DirichletBC(cpp.DirichletBC):
+
+    # Reuse doc-string from cpp.DirichletBC
+    __doc__ = cpp.DirichletBC.__doc__
+
+    def __init__(self, *args, **kwargs):
+        "Create Dirichlet boundary condition"
+
+        # Copy constructor
+        if len(args) == 1:
+            if not isinstance(args[0], cpp.DirichletBC):
+                cpp.dolfin_error("bcs.py",
+                                 "create DirichletBC",
+                                 "Expecting a DirichleBC as only argument"\
+                                 " for copy constructor")
+
+            # Initialize base class
+            cpp.DirichletBC.__init__(self, args[0])
+            return
+
+        # Special case for value specified as float, tuple or similar
+        if len(args) >= 2 and not isinstance(args[1], cpp.GenericFunction):
+            if isinstance(args[1], ufl.classes.Expr):
+                expr = project(args[1], args[0])
+            else:
+                expr = Constant(args[1]) # let Constant handle all problems
+            args = args[:1] + (expr,) + args[2:]
+
+        # Special case for sub domain specified as a function
+        if len(args) >= 3 and isinstance(args[2], types.FunctionType):
+            sub_domain = AutoSubDomain(args[2])
+            args = args[:2] + (sub_domain,) + args[3:]
+
+        # Special case for sub domain specified as a string
+        if len(args) >= 3 and isinstance(args[2], str):
+            sub_domain = CompiledSubDomain(args[2])
+            args = args[:2] + (sub_domain,) + args[3:]
+
+        # Store Expression to avoid scoping issue with SWIG directors
+        if isinstance(args[1], cpp.Expression):
+            self.function_arg = args[1]
+
+        # Store SubDomain to avoid scoping issue with SWIG directors
+        self.domain_args = args[2:]
+
+        # FIXME: Handling of multiple default arguments does not
+        # really work between Python and C++ when C++ requires them to
+        # be ordered and cannot accept the latter without the
+        # former...
+
+        # Add keyword arguments (in correct order...)
+        allowed_kwargs = ["method", "check_midpoint"]
+        for key in allowed_kwargs:
+            if key in kwargs:
+                args = tuple(list(args) + [kwargs[key]])
+
+        # Check for other keyword arguments
+        for key in kwargs:
+            if not key in allowed_kwargs:
+                cpp.dolfin_error("bcs.py",
+                                 "create boundary condition",
+                                 "Unknown keyword argument \"%s\"" % key)
+
+        # Initialize base class
+        cpp.DirichletBC.__init__(self, *args)
+
+    # Set doc string
+    __init__.__doc__ = cpp.DirichletBC.__init__.__doc__
+
+
+def homogenize(bc):
+    """
+    Return a homogeneous version of the given boundary condition.
+
+    *Arguments*
+        bc
+            a :py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>` instance,
+            or a list/tuple of
+            :py:class:`DirichletBC <dolfin.fem.bcs.DirichletBC>` instances.
+
+    Other types of boundary conditions are ignored.
+
+    If the given boundary condition is a list of boundary conditions,
+    then a list of homogeneous boundary conditions is returned.
+
+    """
+
+    # Handle case when boundary condition is a list
+    if isinstance(bc, (list, tuple)):
+        bcs = bc
+        return [homogenize(bc) for bc in bcs]
+
+    # Only consider Dirichlet boundary conditions
+    if not isinstance(bc, cpp.DirichletBC):
+        cpp.dolfin_error("bcs.py",
+                         "homogenize boundary condition",
+                         "Can only homogenize DirichletBCs")
+
+    # Create zero function
+    V = bc.function_space()
+    if V.element().value_rank() == 0:
+        zero = Constant(0)
+    elif V.element().value_rank() == 1:
+        zero = Constant([0]*V.element().value_dimension(0))
+    else:
+        cpp.dolfin_error("bcs.py",
+                         "homogenize boundary condition",
+                         "Unhandled value rank %d for homogenization of boundary conditions" % \
+                             V.element().value_rank())
+
+    # Create homogeneous boundary condition
+    if len(bc.domain_args) == 1:
+        new_bc = cpp.DirichletBC(V, zero, bc.domain_args[0])
+    elif len(bc.domain_args) == 2:
+        new_bc = cpp.DirichletBC(V, zero, bc.domain_args[0], bc.domain_args[1])
+    else:
+        cpp.dolfin_error("bcs.py",
+                         "homogenize boundary condition",
+                         "Unknown type of boundary specification")
+    new_bc.domain_args = bc.domain_args
+
+    return new_bc
diff --git a/site-packages/dolfin/fem/errorcontrolgenerator.py b/site-packages/dolfin/fem/errorcontrolgenerator.py
new file mode 100644
index 0000000..1f23bd4
--- /dev/null
+++ b/site-packages/dolfin/fem/errorcontrolgenerator.py
@@ -0,0 +1,103 @@
+"""
+This module provides a DOLFINErrorControlGenerator for handling UFL
+forms defined over DOLFIN objects.
+"""
+
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-06-28
+# Last changed: 2011-06-29
+
+from ufl.algorithms.analysis import extract_arguments
+from ffc.errorcontrol.errorcontrolgenerators import ErrorControlGenerator
+
+from dolfin import Function, FunctionSpace
+from dolfin.fem.formmanipulations import tear, increase_order
+
+class DOLFINErrorControlGenerator(ErrorControlGenerator):
+    """
+    This class provides a realization of
+    ffc.errorcontrol.errorcontrolgenerators.ErrorControlGenerator for
+    use with UFL forms defined over DOLFIN objects
+    """
+
+    def __init__(self, F, M, u):
+        """
+        *Arguments*
+
+            F (tuple or Form)
+               tuple of (bilinear, linear) forms or linear form
+
+            M (Form)
+               functional or linear form
+
+            u (Coefficient)
+              The coefficient considered as the unknown.
+        """
+        ErrorControlGenerator.__init__(self, __import__("dolfin"), F, M, u)
+
+    def initialize_data(self):
+        """
+        Extract required objects for defining error control
+        forms. This will be stored and reused.
+        """
+        # Developer's note: The UFL-FFC-DOLFIN--PyDOLFIN toolchain for
+        # error control is quite fine-tuned. In particular, the order
+        # of coefficients in forms is (and almost must be) used for
+        # their assignment. This means that the order in which these
+        # coefficients are defined matters and should be considered
+        # fixed.
+
+        # Primal trial element space
+        self._V = self.u.function_space()
+
+        # Primal test space == Dual trial space
+        Vhat = extract_arguments(self.weak_residual)[0].function_space()
+
+        # Discontinuous version of primal trial element space
+        self._dV = tear(self._V)
+
+        # Extract cell and geometric dimension
+        mesh = self._V.mesh()
+        dim = mesh.topology().dim()
+
+        # Function representing improved dual
+        E = increase_order(Vhat)
+        self._Ez_h = Function(E)
+
+        # Function representing cell bubble function
+        B = FunctionSpace(mesh, "B", dim + 1)
+        self._b_T = Function(B)
+        self._b_T.vector()[:] = 1.0
+
+        # Function representing strong cell residual
+        self._R_T = Function(self._dV)
+
+        # Function representing cell cone function
+        C = FunctionSpace(mesh, "DG", dim)
+        self._b_e = Function(C)
+
+        # Function representing strong facet residual
+        self._R_dT = Function(self._dV)
+
+        # Function for discrete dual on primal test space
+        self._z_h = Function(Vhat)
+
+        # Piecewise constants for assembling indicators
+        self._DG0 = FunctionSpace(mesh, "DG", 0)
+
diff --git a/site-packages/dolfin/fem/form.py b/site-packages/dolfin/fem/form.py
new file mode 100644
index 0000000..23163ac
--- /dev/null
+++ b/site-packages/dolfin/fem/form.py
@@ -0,0 +1,298 @@
+"""This module defines a Form class that wraps FFC forms and UFC forms
+into a cpp.Form (dolfin::Form)."""
+
+# Copyright (C) 2008 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008-2011
+# Modified by Marie E. Rognes, 2011
+#
+# First added:  2008-12-04
+# Last changed: 2009-12-11
+
+__all__ = ["Form"]
+
+# Import SWIG-generated extension module (DOLFIN C++)
+import dolfin.cpp as cpp
+
+# Import ufl and ufc
+import ufl, ufc
+
+# Import JIT compiler
+from dolfin.compilemodules.jit import jit
+
+from ufl import replace_integral_domains
+from dolfin.cpp import deprecation
+
+# Note that we need to store _compiled_form and _compiled_coefficients
+# to prevent Python from garbage-collecting these while still in use.
+# FIXME: Figure out how to solve this with shared_ptr
+
+def get_common_domain(mesh, common_cell): # TODO: Remove common_cell argument after 1.4 release
+    if mesh is not None:
+        if common_cell is not None:
+            raise RuntimeError("Please provide only mesh, common_cell is deprecated.")
+        return mesh.ufl_domain()
+    else:
+        if common_cell is None:
+            return None
+        else:
+            return ufl.as_domain(common_cell)
+
+class Form(cpp.Form):
+    def __init__(self, form,
+                 form_compiler_parameters=None,
+                 # TODO: Remove these after 1.4 release:
+                 function_spaces=None,
+                 coefficients=None,
+                 subdomains=None,
+                 common_cell=None,
+                 mesh=None):
+        "Create JIT-compiled form from any given form (compiled or not)."
+
+        # NOTE [martinal]: I have a branch where I'm severely rewriting this, please
+        #                  don't modify this code now without keeping me in the loop!
+
+        if common_cell is not None:
+            deprecation("Form", "1.4.0", "1.5.0",
+                        "The common_cell argument is not to be used, pass a mesh or make the form unambiguous instead.")
+
+        # Check form argument
+        if isinstance(form, ufl.Form):
+            if mesh is not None:
+                deprecation("Form", "1.4.0", "1.5.0",
+                            "The mesh argument is not to be used with a ufl form, include this in the form instead.")
+            if function_spaces is not None:
+                deprecation("Form", "1.4.0", "1.5.0",
+                            "The function_spaces argument is not to be used with a ufl form, include this in the form instead.")
+            if coefficients is not None:
+                deprecation("Form", "1.4.0", "1.5.0",
+                            "The coefficients argument is not to be used with a ufl form, include this in the form instead.")
+            if subdomains is not None:
+                deprecation("Form", "1.4.0", "1.5.0",
+                            "The subdomains argument is not to be used with a ufl form, include this in the form instead.")
+
+            # Complete form with domain before sending to jit
+            common_domain = get_common_domain(mesh, common_cell)
+            if common_domain is not None:
+                form = replace_integral_domains(form, common_domain)
+
+            if not form.empty():
+                assert form.domains(), "Expecting a completed form with domains at this point."
+
+            self._compiled_form, module, self.form_data, prefix \
+                                 = jit(form, form_compiler_parameters)
+            # If we got no mesh, try to get mesh from domain data,
+            # to handle e.g. assemble(1*dx(mesh))
+            if mesh is None:
+                fd = form.form_data()
+                domains = fd.preprocessed_form.domains()
+                if len(domains) == 1:
+                    # Note: mesh here could still be None, depends on what the user did
+                    mesh = domains[0].data()
+
+        elif isinstance(form, ufc.form):
+            cpp.deprecation("Passing a ufc.form to Form constructor",
+                            "1.3.0", "1.4.0",
+                            "Passing a ufc.form to Form constructor"
+                            " will be removed.")
+            self._compiled_form = form
+            self.form_data = None
+
+        elif isinstance(form, cpp.Form):
+            cpp.deprecation("Passing a cpp.Form to dolfin.Form constructor",
+                            "1.3.0", "1.4.0",
+                            "Passing a cpp.Form to dolfin.Form constructor"
+                            " will be removed.")
+            self._compiled_form = form._compiled_form
+            self.form_data = form.form_data
+
+        else:
+            cpp.dolfin_error("form.py",
+                             "creating dolfin.Form",
+                             "Expected a ufl.Form, ufc.form or a dolfin.Form")
+
+        # Extract function spaces
+        self.function_spaces = _extract_function_spaces(self.form_data,
+                                                        self._compiled_form,
+                                                        function_spaces)
+
+        # Extract coefficients
+        (self.coefficients, self._compiled_coefficients) = \
+            _extract_coefficients(self.form_data, coefficients)
+
+        # Initialize base class
+        cpp.Form.__init__(self, self._compiled_form,
+                          self.function_spaces, self.coefficients)
+
+        # Extract subdomains from form_data, override if given explicitly
+        self.subdomains = _extract_subdomains(self.form_data, subdomains)
+
+        # Attach subdomains if we have them
+        subdomains = self.subdomains.get("cell")
+        if subdomains is not None:
+            self.set_cell_domains(subdomains)
+        subdomains = self.subdomains.get("exterior_facet")
+        if subdomains is not None:
+            self.set_exterior_facet_domains(subdomains)
+        subdomains = self.subdomains.get("interior_facet")
+        if subdomains is not None:
+            self.set_interior_facet_domains(subdomains)
+
+        # Set mesh if specified (important for functionals without a function spaces)
+        if mesh is not None:
+            self.set_mesh(mesh)
+
+def _extract_function_spaces(form_data, compiled_form, given_function_spaces):
+    "Extract list of test spaces."
+
+    # Note: Most of this function is error checking,
+    # look for 'function_spaces' to see where stuff happens
+
+    function_space_error = "Error while extracting test and/or trial spaces. "
+
+    function_spaces = []
+
+    r = compiled_form.rank()
+
+    if given_function_spaces:
+        # Given function spaces are necessary for assembling pure UFC forms,
+        # and possibly also convenient for other rare scenarios.
+        if isinstance(given_function_spaces, cpp.FunctionSpace):
+            if r > 0:
+                # Repeat a single given space
+                function_spaces = [given_function_spaces]*r
+            else:
+                raise ValueError(function_space_error +
+                                 "Superfluous test spaces given for a functional.")
+
+        elif isinstance(given_function_spaces, (list,tuple)):
+            if all(isinstance(fs, cpp.FunctionSpace) for fs in given_function_spaces):
+                # Take given list of spaces
+                function_spaces = list(given_function_spaces)
+            else:
+                raise ValueError(function_space_error +
+                                 "Invalid given test spaces.")
+
+        else:
+            raise ValueError(function_space_error +
+                             "Expecting given_function_spaces to be one or more function spaces.")
+    else:
+        # No given function spaces is the norm in pydolfin, which means
+        # they are to be extracted from the ufl form
+        if hasattr(form_data, 'original_arguments'):
+            # Get spaces from Arguments found in ufl form
+            function_spaces = [func.function_space() for func in form_data.original_arguments]
+
+        elif r == 0:
+            # No given spaces, no form_data, but this is a functional,
+            # so no spaces needed
+            function_spaces = []
+
+        else:
+            raise ValueError(function_space_error +
+                             "Missing data about basis functions in form data.")
+
+    # Consistency checks
+    if len(function_spaces) != r:
+        raise ValueError(function_space_error +
+              " Wrong number of test spaces (should be %d)." % r)
+    if not all(isinstance(fs, cpp.FunctionSpace) for fs in function_spaces):
+        raise ValueError(function_space_error +
+              " Invalid type of test spaces.")
+
+    return function_spaces
+
+def _extract_coefficients(form_data, given_coefficients):
+    "Extract list of coefficients."
+
+    # Note: Most of this function is error checking,
+    # look for 'coefficients' and '_compiled_coefficients' to see where stuff happens
+
+    coefficient_error = "Error while extracting coefficients. "
+
+    coefficients = []
+    _compiled_coefficients = []
+
+    if given_coefficients:
+        # Type checking given coefficients
+        error_info = "Provide a 'list' with cpp.GenericFunctions"
+        if not isinstance(given_coefficients, list):
+            raise TypeError(coefficient_error + error_info)
+        if not all(isinstance(c, cpp.GenericFunction) for c in given_coefficients):
+            raise TypeError(coefficient_error)
+
+        # Just use the given list
+        coefficients = list(given_coefficients)
+        _compiled_coefficients = list(given_coefficients)
+
+    elif form_data is None:
+        # Nothing to extract
+        coefficients = []
+        _compiled_coefficients = []
+
+    else:
+        # Type checking form data
+        if not hasattr(form_data, "original_coefficients"):
+            raise TypeError(coefficient_error +
+                  "Missing data about coefficients in form data.")
+        if not all(isinstance(c, cpp.GenericFunction) for c in form_data.original_coefficients):
+            raise TypeError(coefficient_error +
+                            "Either provide a dict of cpp.GenericFunctions, " +
+                            "or use Function to define your form.")
+
+        # Just use the list from form data
+        coefficients = list(form_data.original_coefficients)
+        _compiled_coefficients = [] # Is this correct? No need to store double references.
+
+    return (coefficients, _compiled_coefficients)
+
+def _extract_subdomains(form_data, override_subdomains):
+    "Extract dict of subdomains per domain type."
+
+    override_subdomains = override_subdomains or {}
+    if form_data is None:
+        return override_subdomains
+
+    integral_types = ("cell", "exterior_facet", "interior_facet")
+
+    additional_keys = set(override_subdomains.keys()) - set(integral_types)
+    if additional_keys:
+        raise TypeError, "Invalid keys in integral_types: %s" % additional_keys
+
+    # Temporary hack for getting subdomain_data from new ufl structure,
+    # assuming a single domain like it has been up to now.
+    # To support multiple domains this needs to change so we
+    # get the right subdomains for the right mesh.
+    domains = form_data.preprocessed_form.domains()
+    assert len(domains) == 1, "This code assumes a single domain per form."
+    domain, = domains
+    subdomain_data = form_data.subdomain_data[domain.label()]
+
+    all_subdomains = {}
+    for integral_type in integral_types:
+        subdomains = override_subdomains.get(integral_type)
+        if subdomains is None:
+            subdomains = subdomain_data.get(integral_type)
+
+        if subdomains is not None:
+            # FIXME: Add test for MeshFunctions here. Like this?
+            #if not isinstance(subdomains, MeshFunction):
+            #    raise TypeError, "Invalid subdomains type %s" % type(subdomains)
+            all_subdomains[integral_type] = subdomains
+
+    return all_subdomains
diff --git a/site-packages/dolfin/fem/formmanipulations.py b/site-packages/dolfin/fem/formmanipulations.py
new file mode 100644
index 0000000..1f34b45
--- /dev/null
+++ b/site-packages/dolfin/fem/formmanipulations.py
@@ -0,0 +1,145 @@
+# Copyright (C) 2010-2012 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johan Hake 2011
+# Modified by Anders Logg 2011
+#
+# Last changed: 2012-01-10
+
+import ufl
+import dolfin.cpp as cpp
+
+from ufl.algorithms import extract_arguments
+from dolfin import FunctionSpace, MixedFunctionSpace, VectorFunctionSpace
+from dolfin import Function, TrialFunction, Argument
+
+
+__all__ = ["derivative", "adjoint", "increase_order", "tear"]
+
+def adjoint(form, reordered_arguments=None):
+
+    # Call UFL directly if new arguments are provided directly
+    if reordered_arguments is not None:
+        return ufl.adjoint(form, reordered_arguments=reordered_arguments)
+
+    # Extract form arguments
+    arguments = extract_arguments(form)
+    if any(arg.part() != None for arg in arguments):
+        cpp.dolfin_error("formmanipulation.py",
+                         "compute adjoint of form",
+                         "parts not supported")
+    if not (len(arguments) == 2):
+        cpp.dolfin_error("formmanipulation.py",
+                         "compute adjoint of form",
+                         "Form is not bilinear")
+
+    # Define new Argument(s) in the same spaces
+    # (NB: Order does not matter anymore here because number is absolute)
+    v_1 = Argument(arguments[1].function_space(), arguments[0].number(), arguments[0].part())
+    v_0 = Argument(arguments[0].function_space(), arguments[1].number(), arguments[1].part())
+
+    # Call ufl.adjoint with swapped arguments as new arguments
+    return ufl.adjoint(form, reordered_arguments=(v_1, v_0))
+
+adjoint.__doc__ = ufl.adjoint.__doc__
+
+def derivative(form, u, du=None, coefficient_derivatives=None):
+    if du is None:
+        # Get existing arguments from form and position the new one with the next argument number
+        from ufl.algorithms import extract_arguments
+        form_arguments = extract_arguments(form)
+
+        number = max([-1] + [arg.number() for arg in form_arguments]) + 1
+
+        if any(arg.part() is not None for arg in form_arguments):
+            cpp.dolfin_error("formmanipulation.py",
+                             "compute derivative of form",
+                             "Cannot automatically create third argument using parts, please supply one")
+        part = None
+
+        if isinstance(u, Function):
+            V = u.function_space()
+            du = Argument(V, number, part)
+        elif isinstance(u, (list,tuple)) and all(isinstance(w, Function) for w in u):
+            V = MixedFunctionSpace([w.function_space() for w in u])
+            du = ufl.split(Argument(V, number, part))
+        else:
+            cpp.dolfin_error("formmanipulation.py",
+                             "compute derivative of form",
+                             "Cannot automatically create third argument, please supply one")
+    return ufl.derivative(form, u, du, coefficient_derivatives)
+
+derivative.__doc__ = ufl.derivative.__doc__
+
+def increase_order(V):
+    """
+    For a given function space, return the same space, but with a
+    higher polynomial degree
+    """
+
+    n = V.num_sub_spaces()
+    if n > 0:
+        spaces = []
+        for i in range(n):
+            V_i = V.sub(i)
+            element = V_i.ufl_element()
+            # Handle VectorFunctionSpaces specially
+            if isinstance(element, ufl.VectorElement):
+                spaces += [VectorFunctionSpace(V_i.mesh(),
+                                               element.family(),
+                                               element.degree() + 1,
+                                               dim=element.num_sub_elements())]
+            # Handle all else as MixedFunctionSpaces
+            else:
+                spaces += [increase_order(V_i)]
+
+        return MixedFunctionSpace(spaces)
+
+    if V.ufl_element().family() == "Real":
+        return FunctionSpace(V.mesh(), "Real", 0)
+
+    return FunctionSpace(V.mesh(), V.ufl_element().family(),
+                         V.ufl_element().degree() + 1)
+
+def change_regularity(V, family):
+    """
+    For a given function space, return the corresponding space with
+    the finite elements specified by 'family'. Possible families
+    are the families supported by the form compiler
+    """
+
+    n = V.num_sub_spaces()
+    if n > 0:
+        return MixedFunctionSpace([change_regularity(V.sub(i), family)
+                                   for i in range(n)])
+
+    element = V.ufl_element()
+    shape = element.value_shape()
+    if not shape:
+        return FunctionSpace(V.mesh(), family, element.degree())
+
+    return MixedFunctionSpace([FunctionSpace(V.mesh(), family, element.degree())
+                               for i in range(shape[0])])
+
+def tear(V_h):
+    """
+    For a given function space, return the corresponding discontinuous
+    space
+    """
+    W = change_regularity(V_h, "DG")
+    return W
+
diff --git a/site-packages/dolfin/fem/interpolation.py b/site-packages/dolfin/fem/interpolation.py
new file mode 100644
index 0000000..cf19473
--- /dev/null
+++ b/site-packages/dolfin/fem/interpolation.py
@@ -0,0 +1,66 @@
+"""This module provides a simple way to compute the interpolation of a
+:py:class:`Function <dolfin.functions.function.Function>` or
+:py:class:`Expression <dolfin.functions.expression.Expression>` onto a
+finite element space."""
+
+# Copyright (C) 2009-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-08-29
+# Last changed: 2011-11-15
+
+__all__ = ["interpolate"]
+
+# Local imports
+import dolfin.cpp as cpp
+
+from dolfin.functions.functionspace import FunctionSpaceBase
+from dolfin.functions.function import Function
+
+def interpolate(v, V):
+    """
+    Return interpolation of a given function into a given finite element space.
+
+    *Arguments*
+        v
+            a :py:class:`Function <dolfin.functions.function.Function>` or
+            an :py:class:`Expression <dolfin.functions.expression.Expression>`
+        V
+            a :py:class:`FunctionSpace (standard, mixed, etc.)
+            <dolfin.functions.functionspace.FunctionSpaceBase>`
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            v = Expression("sin(pi*x[0])")
+            V = FunctionSpace(mesh, "Lagrange", 1)
+            Iv = interpolate(v, V)
+
+    """
+
+    # Check arguments
+    if not isinstance(V, FunctionSpaceBase):
+        cpp.dolfin_error("interpolation.py",
+                         "compute interpolation",
+                         "Illegal function space for interpolation, not a FunctionSpace (%s)" % str(v))
+
+    # Compute interpolation
+    Pv = Function(V)
+    Pv.interpolate(v)
+
+    return Pv
diff --git a/site-packages/dolfin/fem/norms.py b/site-packages/dolfin/fem/norms.py
new file mode 100644
index 0000000..ddd1909
--- /dev/null
+++ b/site-packages/dolfin/fem/norms.py
@@ -0,0 +1,266 @@
+"""This module provides a simple way to compute various norms of
+:py:class:`Vectors <dolfin.cpp.Vector>` and :py:class:`Functions
+<dolfin.functions.function.Function>`, including the standard
+:math:`L^2`-norm and other norms."""
+
+# Copyright (C) 2008-2014 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+__all__ = ["norm", "errornorm"]
+
+import ufl
+from ufl import inner, grad, div, curl, dx, FiniteElement, VectorElement, Coefficient
+from math import sqrt
+
+import dolfin.cpp as cpp
+
+from dolfin.cpp import GenericVector, GenericFunction, Function, Mesh, error, Vector
+from dolfin.fem.assembling import assemble
+from dolfin.fem.interpolation import interpolate
+from dolfin.functions.function import Function
+from dolfin.functions.functionspace import FunctionSpace, VectorFunctionSpace, TensorFunctionSpace
+
+dim_to_shape = {1: "interval", 2: "triangle", 3: "tetrahedron"}
+
+def norm(v, norm_type="L2", mesh=None):
+    """
+    Return the norm of a given vector or function.
+
+    *Arguments*
+        v
+            a :py:class:`Vector <dolfin.cpp.Vector>` or
+            a :py:class:`Function <dolfin.functions.function.Function>`.
+        norm_type
+            see below for alternatives.
+        mesh
+            optional :py:class:`Mesh <dolfin.cpp.Mesh>` on
+            which to compute the norm.
+
+    If the norm type is not specified, the standard :math:`L^2` -norm
+    is computed. Possible norm types include:
+
+    *Vectors*
+
+    ================   =================  ================
+    Norm               Usage
+    ================   =================  ================
+    :math:`l^2`        norm(x, 'l2')      Default
+    :math:`l^1`        norm(x, 'l1')
+    :math:`l^\infty`   norm(x, 'linf')
+    ================   =================  ================
+
+    *Functions*
+
+    ================  =================  =================================
+    Norm              Usage              Includes the :math:`L^2` -term
+    ================  =================  =================================
+    :math:`L^2`       norm(v, 'L2')      Yes
+    :math:`H^1`       norm(v, 'H1')      Yes
+    :math:`H^1_0`     norm(v, 'H10')     No
+    :math:`H` (div)   norm(v, 'Hdiv')    Yes
+    :math:`H` (div)   norm(v, 'Hdiv0')   No
+    :math:`H` (curl)  norm(v, 'Hcurl')   Yes
+    :math:`H` (curl)  norm(v, 'Hcurl0')  No
+    ================  =================  =================================
+
+    *Examples of usage*
+
+    .. code-block:: python
+
+        v = Function(V)
+        x = v.vector()
+
+        print norm(x, 'linf')   # print the infinity norm of vector x
+
+        n = norm(v)             # compute L^2 norm of v
+        print norm(v, 'Hdiv')   # print H(div) norm of v
+        n = norm(v, 'H1', mesh) # compute H^1 norm of v on given mesh
+
+    """
+
+    if not isinstance(v, (GenericVector, GenericFunction)):
+        raise TypeError, "expected a GenericVector or GenericFunction"
+
+    # Check arguments
+    if not isinstance(norm_type, str):
+        cpp.dolfin_error("norms.py",
+                         "compute norm",
+                         "Norm type must be a string, not " + str(type(norm_type)))
+    if mesh is not None and not isinstance(mesh, Mesh):
+        cpp.dolfin_error("norms.py",
+                         "compute norm",
+                         "Expecting a Mesh, not " + str(type(mesh)))
+
+    # Get mesh from function
+    if isinstance(v, Function) and mesh is None:
+        mesh = v.function_space().mesh()
+
+    # Define integration measure and domain
+    dx = ufl.dx(mesh)
+
+    # Select norm type
+    if isinstance(v, GenericVector):
+        return v.norm(norm_type.lower())
+
+    elif (isinstance(v, Coefficient) and isinstance(v, GenericFunction)):
+        if norm_type.lower() == "l2":
+            M = v**2*dx
+        elif norm_type.lower() == "h1":
+            M = (v**2 + grad(v)**2)*dx
+        elif norm_type.lower() == "h10":
+            M = grad(v)**2*dx
+        elif norm_type.lower() == "hdiv":
+            M = (v**2 + div(v)**2)*dx
+        elif norm_type.lower() == "hdiv0":
+            M = div(v)**2*dx
+        elif norm_type.lower() == "hcurl":
+            M = (v**2 + curl(v)**2)*dx
+        elif norm_type.lower() == "hcurl0":
+            M = curl(v)**2*dx
+        else:
+            cpp.dolfin_error("norms.py",
+                             "compute norm",
+                             "Unknown norm type (\"%s\") for functions" % str(norm_type))
+    else:
+        cpp.dolfin_error("norms.py",
+                         "compute norm",
+                         "Unknown object type. Must be a vector or a function")
+
+    # Assemble value
+    r = assemble(M, form_compiler_parameters={"representation": "quadrature"})
+
+    # Check value
+    if r < 0.0:
+        cpp.dolfin_error("norms.py",
+                         "compute norm",
+                         "Square of norm is negative, might be a round-off error")
+    elif r == 0.0:
+        return 0.0
+    else:
+        return sqrt(r)
+
+def errornorm(u, uh, norm_type="l2", degree_rise=3, mesh=None):
+    """
+    Compute and return the error :math:`e = u - u_h` in the given norm.
+
+    *Arguments*
+        u, uh
+            :py:class:`Functions <dolfin.functions.function.Function>`
+        norm_type
+            Type of norm. The :math:`L^2` -norm is default.
+            For other norms, see :py:func:`norm <dolfin.fem.norms.norm>`.
+        degree_rise
+            The number of degrees above that of u_h used in the
+            interpolation; i.e. the degree of piecewise polynomials used
+            to approximate :math:`u` and :math:`u_h` will be the degree
+            of :math:`u_h` + degree_raise.
+        mesh
+            Optional :py:class:`Mesh <dolfin.cpp.Mesh>` on
+            which to compute the error norm.
+
+    In simple cases, one may just define
+
+    .. code-block:: python
+
+        e = u - uh
+
+    and evalute for example the square of the error in the :math:`L^2` -norm by
+
+    .. code-block:: python
+
+        assemble(e**2*dx(mesh))
+
+    However, this is not stable w.r.t. round-off errors considering that
+    the form compiler may expand(#) the expression above to::
+
+        e**2*dx = u**2*dx - 2*u*uh*dx + uh**2*dx
+
+    and this might get further expanded into thousands of terms for
+    higher order elements. Thus, the error will be evaluated by adding
+    a large number of terms which should sum up to something close to
+    zero (if the error is small).
+
+    This module computes the error by first interpolating both
+    :math:`u` and :math:`u_h` to a common space (of high accuracy),
+    then subtracting the two fields (which is easy since they are
+    expressed in the same basis) and then evaluating the integral.
+
+    (#) If using the tensor representation optimizations.
+    The quadrature represenation does not suffer from this problem.
+    """
+
+    # Check argument
+    if not isinstance(u, cpp.GenericFunction):
+        cpp.dolfin_error("norms.py",
+                         "compute error norm",
+                         "Expecting a Function or Expression for u")
+    if not isinstance(uh, cpp.Function):
+        cpp.dolfin_error("norms.py",
+                         "compute error norm",
+                         "Expecting a Function for uh")
+
+    # Get mesh
+    if isinstance(u, Function) and mesh is None:
+        mesh = u.function_space().mesh()
+    if isinstance(uh, Function) and mesh is None:
+        mesh = uh.function_space().mesh()
+    if mesh is None:
+        cpp.dolfin_error("norms.py",
+                         "compute error norm",
+                         "Missing mesh")
+
+    # Get rank
+    if not u.shape() == uh.shape():
+        cpp.dolfin_error("norms.py",
+                         "compute error norm",
+                         "Value shapes don't match")
+    shape = u.shape()
+    rank = len(shape)
+
+    # Check that uh is associated with a finite element
+    if uh.ufl_element().degree() is None:
+        cpp.dolfin_error("norms.py",
+                         "compute error norm",
+                         "Function uh must have a finite element")
+
+    # Degree for interpolation space. Raise degree with respect to uh.
+    degree = uh.ufl_element().degree() + degree_rise
+
+    # Check degree of 'exact' solution u
+    degree_u = u.ufl_element().degree()
+    if degree_u is not None and degree_u < degree:
+        cpp.warning("Degree of exact solution may be inadequate for accurate result in errornorm.")
+
+    # Create function space
+    if rank == 0:
+        V = FunctionSpace(mesh, "Discontinuous Lagrange", degree)
+    elif rank == 1:
+        V = VectorFunctionSpace(mesh, "Discontinuous Lagrange", degree, dim=shape[0])
+    elif rank > 1:
+        V = TensorFunctionSpace(mesh, "Discontinuous Lagrange", degree, shape=shape)
+
+    # Interpolate functions into finite element space
+    pi_u = interpolate(u, V)
+    pi_uh = interpolate(uh, V)
+
+    # Compute the difference
+    e = Function(V)
+    e.assign(pi_u)
+    e.vector().axpy(-1.0, pi_uh.vector())
+
+    # Compute norm
+    return norm(e, norm_type=norm_type, mesh=mesh)
diff --git a/site-packages/dolfin/fem/projection.py b/site-packages/dolfin/fem/projection.py
new file mode 100644
index 0000000..d0c7339
--- /dev/null
+++ b/site-packages/dolfin/fem/projection.py
@@ -0,0 +1,145 @@
+"""This module provides a simple way to compute the projection of a
+:py:class:`Function <dolfin.functions.function.Function>` or an
+:py:class:`Expression <dolfin.functions.expression.Expression>` onto a
+finite element space."""
+
+# Copyright (C) 2008-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-07-13
+# Last changed: 2011-11-15
+
+__all__ = ['project']
+
+# Import UFL and SWIG-generated extension module (DOLFIN C++)
+import ufl
+import dolfin.cpp as cpp
+
+# Local imports
+from dolfin.functions.function import *
+from dolfin.functions.expression import *
+from dolfin.functions.functionspace import *
+from dolfin.fem.assembling import *
+
+def project(v, V=None, bcs=None, mesh=None,
+            solver_type="cg",
+            preconditioner_type="default",
+            form_compiler_parameters=None):
+    """
+    Return projection of given expression *v* onto the finite element space *V*.
+
+    *Arguments*
+        v
+            a :py:class:`Function <dolfin.functions.function.Function>` or
+            an :py:class:`Expression <dolfin.functions.expression.Expression>`
+        bcs
+            Optional argument :py:class:`list of DirichletBC
+            <dolfin.fem.bcs.DirichletBC>`
+        V
+            Optional argument :py:class:`FunctionSpace
+            <dolfin.functions.functionspace.FunctionSpace>`
+        mesh
+            Optional argument :py:class:`mesh <dolfin.cpp.Mesh>`.
+        solver_type
+            see :py:func:`solve <dolfin.fem.solving.solve>` for options.
+        preconditioner_type
+            see :py:func:`solve <dolfin.fem.solving.solve>` for options.
+        form_compiler_parameters
+            see :py:class:`Parameters <dolfin.cpp.Parameters>` for more
+            information.
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            v = Expression("sin(pi*x[0])")
+            V = FunctionSpace(mesh, "Lagrange", 1)
+            Pv = project(v, V)
+
+        This is useful for post-processing functions or expressions
+        which are not readily handled by visualization tools (such as
+        for example discontinuous functions).
+
+    """
+
+    # If trying to project an Expression
+    if V is None and isinstance(v, Expression):
+        if mesh is not None and isinstance(mesh, cpp.Mesh):
+            V = FunctionSpaceBase(mesh, v.ufl_element())
+        else:
+            raise TypeError, "expected a mesh when projecting an Expression"
+
+    # Try extracting function space if not specified
+    if V is None:
+        V = _extract_function_space(v, mesh)
+
+    # Check arguments
+    if not isinstance(V, FunctionSpaceBase):
+        cpp.dolfin_error("projection.py",
+                         "compute projection",
+                         "Illegal function space for projection, not a FunctionSpace: " + str(v))
+
+    # Ensure we have a mesh and attach to measure
+    if mesh is None:
+        mesh = V.mesh()
+    dx = ufl.dx(mesh)
+
+    # Define variational problem for projection
+    w = TestFunction(V)
+    Pv = TrialFunction(V)
+    a = ufl.inner(w, Pv)*dx
+    L = ufl.inner(w, v)*dx
+
+    # Assemble linear system
+    A, b = assemble_system(a, L, bcs=bcs,
+                           form_compiler_parameters=form_compiler_parameters)
+
+    # Solve linear system for projection
+    Pv = Function(V)
+    cpp.la_solve(A, Pv.vector(), b, solver_type, preconditioner_type)
+
+    return Pv
+
+def _extract_function_space(expression, mesh):
+    """Try to extract a suitable function space for projection of
+    given expression."""
+
+    # Extract functions
+    functions = ufl.algorithms.extract_coefficients(expression)
+
+    # Extract mesh from functions
+    if mesh is None:
+        for f in functions:
+            if isinstance(f, Function):
+                mesh = f.function_space().mesh()
+                if mesh is not None:
+                    break
+    if mesh is None:
+        raise RuntimeError, "Unable to project expression, can't find a suitable mesh."
+
+    # Create function space
+    shape = expression.shape()
+    if shape == ():
+        V = FunctionSpace(mesh, "CG", 1)
+    elif len(shape) == 1:
+        V = VectorFunctionSpace(mesh, "CG", 1, dim=shape[0])
+    elif len(shape) == 2:
+        V = TensorFunctionSpace(mesh, "CG", 1, shape=shape)
+    else:
+        raise RuntimeError, "Unable to project expression, unhandled rank, shape is %s." % (shape,)
+
+    return V
diff --git a/site-packages/dolfin/fem/solving.py b/site-packages/dolfin/fem/solving.py
new file mode 100644
index 0000000..d20172f
--- /dev/null
+++ b/site-packages/dolfin/fem/solving.py
@@ -0,0 +1,456 @@
+"""This module provides a small Python layer on top of the C++
+VariationalProblem/Solver classes as well as the solve function."""
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes, 2011.
+# Modified by Johan Hake, 2011.
+#
+# First added:  2011-06-22
+# Last changed: 2011-11-10
+
+__all__ = ["LinearVariationalProblem",
+           "LinearVariationalSolver",
+           "NonlinearVariationalProblem",
+           "NonlinearVariationalSolver",
+           "solve"]
+
+# Import SWIG-generated extension module (DOLFIN C++)
+import dolfin.cpp as cpp
+
+# Import UFL
+import ufl
+
+# Local imports
+from dolfin.fem.form import Form
+from dolfin.fem.formmanipulations import derivative
+
+# Problem classes need special handling since they involve JIT compilation
+
+class LinearVariationalProblem(cpp.LinearVariationalProblem):
+
+    # Reuse C++ doc-string
+    __doc__ = cpp.LinearVariationalProblem.__doc__
+
+    def __init__(self, a, L, u, bcs=None,
+                 form_compiler_parameters=None):
+        """
+        Create linear variational problem a(u, v) = L(v).
+
+        An optional argument bcs may be passed to specify boundary
+        conditions.
+
+        Another optional argument form_compiler_parameters may be
+        specified to pass parameters to the form compiler.
+        """
+
+        # Extract and check arguments
+        u = _extract_u(u)
+        bcs = _extract_bcs(bcs)
+
+        # Store input UFL forms and solution Function
+        self.a_ufl = a
+        self.L_ufl = L
+        self.u_ufl = u
+
+        # Store form compiler parameters
+        form_compiler_parameters = form_compiler_parameters or {}
+        self.form_compiler_parameters = form_compiler_parameters
+
+        # Wrap forms (and check if linear form L is empty)
+        if L.empty():
+            L = cpp.Form(1, 0)
+        else:
+            L = Form(L, form_compiler_parameters=form_compiler_parameters)
+        a = Form(a, form_compiler_parameters=form_compiler_parameters)
+
+        # Initialize C++ base class
+        cpp.LinearVariationalProblem.__init__(self, a, L, u, bcs)
+
+class NonlinearVariationalProblem(cpp.NonlinearVariationalProblem):
+
+    # Reuse C++ doc-string
+    __doc__ = cpp.NonlinearVariationalProblem.__doc__
+
+    def __init__(self, F, u, bcs=None, J=None,
+                 form_compiler_parameters=None):
+        """
+        Create nonlinear variational problem F(u; v) = 0.
+
+        Optional arguments bcs and J may be passed to specify boundary
+        conditions and the Jacobian J = dF/du.
+
+        Another optional argument form_compiler_parameters may be
+        specified to pass parameters to the form compiler.
+        """
+
+        # Extract and check arguments
+        u = _extract_u(u)
+        bcs = _extract_bcs(bcs)
+
+        # Store input UFL forms and solution Function
+        self.F_ufl = F
+        self.J_ufl = J
+        self.u_ufl = u
+
+        # Store form compiler parameters
+        form_compiler_parameters = form_compiler_parameters or {}
+        self.form_compiler_parameters = form_compiler_parameters
+
+        # Wrap forms
+        F = Form(F, form_compiler_parameters=form_compiler_parameters)
+        if J is not None:
+            J = Form(J, form_compiler_parameters=form_compiler_parameters)
+
+        # Initialize C++ base class
+        if J is None:
+            cpp.NonlinearVariationalProblem.__init__(self, F, u, bcs)
+        else:
+            cpp.NonlinearVariationalProblem.__init__(self, F, u, bcs, J)
+
+# Solver classes are imported directly
+from dolfin.cpp import LinearVariationalSolver, NonlinearVariationalSolver
+from dolfin.fem.adaptivesolving import AdaptiveLinearVariationalSolver
+from dolfin.fem.adaptivesolving import AdaptiveNonlinearVariationalSolver
+
+# Solve function handles both linear systems and variational problems
+
+def solve(*args, **kwargs):
+    """Solve linear system Ax = b or variational problem a == L or F == 0.
+
+    The DOLFIN solve() function can be used to solve either linear
+    systems or variational problems. The following list explains the
+    various ways in which the solve() function can be used.
+
+    *1. Solving linear systems*
+
+    A linear system Ax = b may be solved by calling solve(A, x, b),
+    where A is a matrix and x and b are vectors. Optional arguments
+    may be passed to specify the solver method and preconditioner.
+    Some examples are given below:
+
+    .. code-block:: python
+
+        solve(A, x, b)
+        solve(A, x, b, "lu")
+        solve(A, x, b, "gmres", "ilu")
+        solve(A, x, b, "cg", "hypre_amg")
+
+    Possible values for the solver method and preconditioner depend
+    on which linear algebra backend is used and how that has been
+    configured.
+
+    To list all available LU methods, run the following command:
+
+    .. code-block:: python
+
+        list_lu_methods()
+
+    To list all available Krylov methods, run the following command:
+
+    .. code-block:: python
+
+        list_krylov_methods()
+
+    To list all available preconditioners, run the following command:
+
+    .. code-block:: python
+
+        list_preconditioners()
+
+    To list all available solver methods, including LU methods, Krylov
+    methods and, possibly, other methods, run the following command:
+
+    .. code-block:: python
+
+        list_solver_methods()
+
+    *2. Solving linear variational problems*
+
+    A linear variational problem a(u, v) = L(v) for all v may be
+    solved by calling solve(a == L, u, ...), where a is a bilinear
+    form, L is a linear form, u is a Function (the solution). Optional
+    arguments may be supplied to specify boundary conditions or solver
+    parameters. Some examples are given below:
+
+    .. code-block:: python
+
+        solve(a == L, u)
+        solve(a == L, u, bcs=bc)
+        solve(a == L, u, bcs=[bc1, bc2])
+
+        solve(a == L, u, bcs=bcs,
+              solver_parameters={"linear_solver": "lu"},
+              form_compiler_parameters={"optimize": True})
+
+    For available choices for the 'solver_parameters' kwarg, look at:
+
+    .. code-block:: python
+
+        info(LinearVariationalSolver.default_parameters(), 1)
+
+    *3. Solving nonlinear variational problems*
+
+    A nonlinear variational problem F(u; v) = 0 for all v may be
+    solved by calling solve(F == 0, u, ...), where the residual F is a
+    linear form (linear in the test function v but possibly nonlinear
+    in the unknown u) and u is a Function (the solution). Optional
+    arguments may be supplied to specify boundary conditions, the
+    Jacobian form or solver parameters. If the Jacobian is not
+    supplied, it will be computed by automatic differentiation of the
+    residual form. Some examples are given below:
+
+    .. code-block:: python
+
+        solve(F == 0, u)
+        solve(F == 0, u, bcs=bc)
+        solve(F == 0, u, bcs=[bc1, bc2])
+
+        solve(F == 0, u, bcs, J=J,
+              solver_parameters={"linear_solver": "lu"},
+              form_compiler_parameters={"optimize": True})
+
+
+    For available choices for the 'solver_parameters' kwarg, look at:
+
+        .. code-block:: python
+
+        info(NonlinearVariationalSolver.default_parameters(), 1)
+
+    *4. Solving linear/nonlinear variational problems adaptively
+
+    Linear and nonlinear variational problems maybe solved adaptively,
+    with automated goal-oriented error control. The automated error
+    control algorithm is based on adaptive mesh refinement in
+    combination with automated generation of dual-weighted
+    residual-based error estimates and error indicators.
+
+    An adaptive solve may be invoked by giving two additional
+    arguments to the solve call, a numerical error tolerance and a
+    goal functional (a Form).
+
+    .. code-block:: python
+
+        M = u*dx()
+        tol = 1.e-6
+
+        # Linear variational problem
+        solve(a == L, u, bcs=bc, tol=tol, M=M)
+
+        # Nonlinear problem:
+        solve(F == 0, u, bcs=bc, tol=tol, M=M)
+
+    """
+
+    assert(len(args) > 0)
+
+    # Call adaptive solve if we get a tolerance
+    if "tol" in kwargs:
+        _solve_varproblem_adaptive(*args, **kwargs)
+
+    # Call variational problem solver if we get an equation (but not a tolerance)
+    elif isinstance(args[0], ufl.classes.Equation):
+        _solve_varproblem(*args, **kwargs)
+
+    # Default case, just call the wrapped C++ solve function
+    else:
+        if kwargs:
+            cpp.dolfin_error("solving.py",
+                             "solve linear algebra problem",
+                             "Not expecting keyword arguments when solving "\
+                             "linear algebra problem")
+
+        return cpp.la_solve(*args)
+
+def _solve_varproblem(*args, **kwargs):
+    "Solve variational problem a == L or F == 0"
+
+    # Extract arguments
+    eq, u, bcs, J, tol, M, form_compiler_parameters, solver_parameters \
+        = _extract_args(*args, **kwargs)
+
+    # Solve linear variational problem
+    if isinstance(eq.lhs, ufl.Form) and isinstance(eq.rhs, ufl.Form):
+
+        # Create problem
+        problem = LinearVariationalProblem(eq.lhs, eq.rhs, u, bcs,
+                    form_compiler_parameters=form_compiler_parameters)
+
+        # Create solver and call solve
+        solver = LinearVariationalSolver(problem)
+        solver.parameters.update(solver_parameters)
+        solver.solve()
+
+    # Solve nonlinear variational problem
+    else:
+
+        # Create Jacobian if missing
+        if J is None:
+            cpp.info("No Jacobian form specified for nonlinear variational problem.")
+            cpp.info("Differentiating residual form F to obtain Jacobian J = F'.")
+            F = eq.lhs
+            J = derivative(F, u)
+
+        # Create problem
+        problem = NonlinearVariationalProblem(eq.lhs, u, bcs, J,
+                    form_compiler_parameters=form_compiler_parameters)
+
+        # Create solver and call solve
+        solver = NonlinearVariationalSolver(problem)
+        solver.parameters.update(solver_parameters)
+        solver.solve()
+
+def _solve_varproblem_adaptive(*args, **kwargs):
+    "Solve variational problem a == L or F == 0 adaptively"
+
+    # Extract arguments
+    eq, u, bcs, J, tol, M, form_compiler_parameters, solver_parameters \
+        = _extract_args(*args, **kwargs)
+
+    # Check that we received the goal functional
+    if M is None:
+        cpp.dolfin_error("solving.py",
+                         "solve variational problem adaptively",
+                         "Missing goal functional")
+
+    # Solve linear variational problem
+    if isinstance(eq.lhs, ufl.Form) and isinstance(eq.rhs, ufl.Form):
+
+        # Create problem
+        problem = LinearVariationalProblem(eq.lhs, eq.rhs, u, bcs,
+                    form_compiler_parameters=form_compiler_parameters)
+
+        # Create solver and call solve
+        solver = AdaptiveLinearVariationalSolver(problem, M)
+        solver.parameters.update(solver_parameters)
+        solver.solve(tol)
+
+    # Solve nonlinear variational problem
+    else:
+
+        # Create Jacobian if missing
+        if J is None:
+            cpp.info("No Jacobian form specified for nonlinear variational problem.")
+            cpp.info("Differentiating residual form F to obtain Jacobian J = F'.")
+            F = eq.lhs
+            J = derivative(F, u)
+
+        # Create problem
+        problem = NonlinearVariationalProblem(eq.lhs, u, bcs, J,
+                    form_compiler_parameters=form_compiler_parameters)
+
+        # Create solver and call solve
+        solver = AdaptiveNonlinearVariationalSolver(problem, M)
+        solver.parameters.update(solver_parameters)
+        solver.solve(tol)
+
+def _extract_args(*args, **kwargs):
+    "Common extraction of arguments for _solve_varproblem[_adaptive]"
+
+    # Check for use of valid kwargs
+    valid_kwargs = ["bcs", "J", "tol", "M",
+                    "form_compiler_parameters", "solver_parameters"]
+    for kwarg in kwargs.iterkeys():
+        if not kwarg in valid_kwargs:
+            cpp.dolfin_error("solving.py",
+                             "solve variational problem",
+                             "Illegal keyword argument \"%s\"; valid keywords are %s" % \
+                                 (kwarg,
+                                  ", ".join("\"%s\"" % kwarg for kwarg in valid_kwargs)))
+
+    # Extract equation
+    if not len(args) >= 2:
+        cpp.dolfin_error("solving.py",
+                         "solve variational problem",
+                         "Missing arguments, expecting solve(lhs == rhs, "\
+                         "u, bcs=bcs), where bcs is optional")
+    if len(args) > 3:
+        cpp.dolfin_error("solving.py",
+                         "solve variational problem",
+                         "Too many arguments, expecting solve(lhs == rhs, "\
+                         "u, bcs=bcs), where bcs is optional")
+
+    # Extract equation
+    eq = _extract_eq(args[0])
+
+    # Extract solution function
+    u = _extract_u(args[1])
+
+    # Extract boundary conditions
+    if len(args) > 2:
+        bcs = _extract_bcs(args[2])
+    elif "bcs" in kwargs:
+        bcs = _extract_bcs(kwargs["bcs"])
+    else:
+        bcs = []
+
+    # Extract Jacobian
+    J = kwargs.get("J", None)
+    if J is not None and not isinstance(J, ufl.Form):
+        cpp.dolfin_error("solving.py",
+                         "solve variational problem",
+                         "Expecting Jacobian J to be a UFL Form")
+
+    # Extract tolerance
+    tol = kwargs.get("tol", None)
+    if tol is not None and not (isinstance(tol, (float, int)) and tol >= 0.0):
+        cpp.dolfin_error("solving.py",
+                         "solve variational problem",
+                         "Expecting tolerance tol to be a non-negative number")
+
+    # Extract functional
+    M = kwargs.get("M", None)
+    if M is not None and not isinstance(M, ufl.Form):
+        cpp.dolfin_error("solving.py",
+                         "solve variational problem",
+                         "Expecting goal functional M to be a UFL Form")
+
+    # Extract parameters
+    form_compiler_parameters = kwargs.get("form_compiler_parameters", {})
+    solver_parameters = kwargs.get("solver_parameters", {})
+
+    return eq, u, bcs, J, tol, M, form_compiler_parameters, solver_parameters
+
+def _extract_eq(eq):
+    "Extract and check argument eq"
+    if not isinstance(eq, ufl.classes.Equation):
+        cpp.dolfin_error("solving.py",
+                         "solve variational problem",
+                         "Expecting first argument to be an Equation")
+    return eq
+
+def _extract_u(u):
+    "Extract and check argument u"
+    if not isinstance(u, cpp.Function):
+        cpp.dolfin_error("solving.py",
+                         "solve variational problem",
+                         "Expecting second argument to be a Function")
+    return u
+
+def _extract_bcs(bcs):
+    "Extract and check argument bcs"
+    if bcs is None:
+        bcs = []
+    elif not isinstance(bcs, (list, tuple)):
+        bcs = [bcs]
+    for bc in bcs:
+        if not isinstance(bc, cpp.DirichletBC):
+            cpp.dolfin_error("solving.py",
+                             "solve variational problem",
+                             "Unable to extract boundary condition arguments")
+    return bcs
diff --git a/site-packages/dolfin/functions/__init__.py b/site-packages/dolfin/functions/__init__.py
new file mode 100644
index 0000000..dae754f
--- /dev/null
+++ b/site-packages/dolfin/functions/__init__.py
@@ -0,0 +1,20 @@
+"""The function module of dolfin"""
+
+from dolfin.functions import functionspace
+from dolfin.functions import function
+from dolfin.functions import constant
+from dolfin.functions import expression
+from dolfin.functions import specialfunctions
+
+from functionspace import *
+from function import *
+from constant import *
+from expression import *
+from specialfunctions  import *
+
+# NOTE: The automatic documentation system in DOLFIN requires to _not_ define
+# NOTE: classes or functions within this file. Use separate modules for that
+# NOTE: purpose.
+
+__all__ = functionspace.__all__ + function.__all__ + constant.__all__ + \
+          expression.__all__ + specialfunctions.__all__
diff --git a/site-packages/dolfin/functions/constant.py b/site-packages/dolfin/functions/constant.py
new file mode 100644
index 0000000..5a3c06f
--- /dev/null
+++ b/site-packages/dolfin/functions/constant.py
@@ -0,0 +1,107 @@
+"""Create a constant-valued function with given value."""
+
+# Copyright (C) 2008-2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johan Hake, 2008.
+#
+# First added:  2008-12-02
+# Last changed: 2010-08-16
+
+__all__ = ["Constant"]
+
+# Import UFL and SWIG-generated extension module (DOLFIN C++)
+import ufl
+import dolfin.cpp as cpp
+import numpy
+
+class Constant(ufl.Coefficient, cpp.Constant):
+
+    def __init__(self, value, cell=None, name=None):
+        """
+        Create constant-valued function with given value.
+
+        *Arguments*
+            value
+                The value may be either a single scalar value, or a
+                tuple/list of values for vector-valued functions, or
+                nested lists or a numpy array for tensor-valued
+                functions.
+            cell
+                Optional argument. A :py:class:`Cell
+                <ufl.Cell>` which defines the geometrical
+                dimensions the Constant is defined for.
+            name
+                Optional argument. A str which overrules the default
+                name of the Constant.
+
+        The data type Constant represents a constant value that is
+        unknown at compile-time. Its values can thus be changed
+        without requiring re-generation and re-compilation of C++
+        code.
+
+        *Examples of usage*
+
+            .. code-block:: python
+
+                p = Constant(pi/4)              # scalar
+                C = Constant((0.0, -1.0, 0.0))  # constant vector
+
+        """
+
+        if cell is None:
+            domain = None
+        else:
+            #deprecation_warning("The cell argument is no longer necessary.")
+            domain = ufl.as_domain(cell)
+            if not isinstance(domain, (ufl.Domain,)):
+                raise TypeError("Expected an ufl.Domain as the second argument")
+
+        array = numpy.array(value)
+        rank = len(array.shape)
+        floats = map(float, array.flat)
+
+        # Create UFL element and initialize constant
+        if rank == 0:
+            self._ufl_element = ufl.FiniteElement("Real",
+                                                  domain, 0)
+            cpp.Constant.__init__(self, floats[0])
+        elif rank == 1:
+            self._ufl_element = ufl.VectorElement("Real",
+                                                  domain, 0, len(floats))
+            cpp.Constant.__init__(self, floats)
+        else:
+            self._ufl_element = ufl.TensorElement("Real",
+                                                  domain, 0, shape=array.shape)
+            cpp.Constant.__init__(self, list(array.shape), floats)
+
+        # Initialize base classes
+        ufl.Coefficient.__init__(self, self._ufl_element, count=self.id())
+
+        # Set name as given or automatic
+        name = name or "f_%d" % self.count()
+        self.rename(name, "a Constant")
+
+    def __float__(self):
+        # Overriding UFL operator in this particular case.
+        if self.shape():
+            raise TypeError("Cannot convert nonscalar constant to float.")
+        return cpp.Constant.__float__(self)
+
+    def __str__(self):
+        "x.__str__() <==> print(x)"
+        return self.name()
diff --git a/site-packages/dolfin/functions/expression.py b/site-packages/dolfin/functions/expression.py
new file mode 100644
index 0000000..49040e1
--- /dev/null
+++ b/site-packages/dolfin/functions/expression.py
@@ -0,0 +1,837 @@
+"""This module handles the Expression class in Python.
+
+The Expression class needs special handling and is not mapped directly
+by SWIG from the C++ interface. Instead, a new Expression class is
+created which inherits both from the DOLFIN C++ Expression class and
+the ufl Coefficient class.
+
+The resulting Expression class may thus act both as a variable in a
+UFL form expression and as a DOLFIN C++ Expression.
+
+This module make heavy use of creation of Expression classes and
+instantiation of these dynamically at runtime.
+
+The whole logic behind this somewhat magic behaviour is handle by:
+
+  1) function __new__ in the Expression class
+  2) meta class ExpressionMetaClass
+  3) function compile_expressions from the compiledmodule/expression
+     module
+  4) functions create_compiled_expression_class and
+     create_python_derived_expression_class
+
+The __new__ method in the Expression class take cares of the logic
+when the class Expression is used to create an instance of Expression,
+see use cases 1-4 in the docstring of Expression.
+
+The meta class ExpressionMetaClass take care of the logic when a user
+subclasses Expression to create a user-defined Expression, see use
+cases 3 in the docstring of Expression.
+
+The function compile_expression is a JIT compiler. It compiles and
+returns different kinds of cpp.Expression classes, depending on the
+arguments. These classes are sent to the
+create_compiled_expression_class.
+
+"""
+
+# Copyright (C) 2008-2014 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008-2009.
+# Modified by Martin S. Alnaes 2013-2014
+
+__all__ = ["Expression"]
+
+# FIXME: Make all error messages uniform according to the following template:
+#
+# if not isinstance(foo, Foo):
+#     raise TypeError, "Illegal argument for creation of Bar, not a Foo: " + str(foo)
+
+# Python imports
+import types
+
+# Import UFL and SWIG-generated extension module (DOLFIN C++)
+import ufl
+import dolfin.cpp as cpp
+import numpy
+
+from dolfin import warning, error
+
+# Local imports
+from dolfin.compilemodules.expressions import compile_expressions
+
+# Local help class
+class UserDefinedParameters(dict):
+    """
+    Help class to set user defined parameters in Expressions
+    """
+    def __init__(self, expr, **kwargs):
+        assert(isinstance(expr, cpp.Expression))
+        self._expr = expr
+        dict.__init__(self, **kwargs)
+
+    def __setitem__(self, name, value):
+        __doc__ = dict.__setitem__.__doc__
+        if name not in self:
+            raise KeyError("'%s' is not a parameter name" % name)
+        setattr(self._expr, name, value)
+        dict.__setattr__(self, name, value)
+
+    def update(self, other):
+        __doc__ = dict.update.__doc__
+        if hasattr(other, "keys"):
+            for name in other.keys():
+                self[name] = other[name]
+        else:
+            for name, value in other:
+                self[name] = value
+
+def create_compiled_expression_class(cpp_base):
+    # Check the cpp_base
+    assert(isinstance(cpp_base, (types.ClassType, type)))
+
+    def __init__(self, cppcode, element=None, cell=None, domain=None, \
+                 degree=None, name=None, label=None, **kwargs):
+        """Initialize the Expression """
+        # Initialize the cpp base class first and extract value_shape
+        cpp_base.__init__(self)
+        value_shape = tuple(self.value_dimension(i) \
+                            for i in range(self.value_rank()))
+
+        # Store the value_shape
+        self._value_shape = value_shape
+
+        # Select an appropriate element if not specified
+        if element is None:
+            element = _auto_select_element_from_shape(value_shape, degree, cell, domain)
+        else:
+            # Check that we have an element
+            if not isinstance(element, ufl.FiniteElementBase):
+                raise TypeError, "The 'element' argument must be a UFL"\
+                      " finite element."
+
+            # Check same value shape of compiled expression and passed element
+            if not element.value_shape() == value_shape:
+                raise ValueError, "The value shape of the passed 'element',"\
+                      " is not equal to the value shape of the compiled "\
+                      "expression."
+
+        # Initialize UFL base class
+        self._ufl_element = element
+        ufl.Coefficient.__init__(self, self._ufl_element, count=self.id())
+
+        # Set default variables
+        for member, value in kwargs.items():
+            setattr(self, member, value)
+
+        name = name or "f_" + str(ufl.Coefficient.count(self))
+        label = label or "User defined expression"
+
+        self.rename(name, label)
+
+        # Store the rest of the kwargs (parameters)
+        self.user_parameters = UserDefinedParameters(self, **kwargs)
+
+    # Create and return the class
+    return type("CompiledExpression", (Expression, ufl.Coefficient, cpp_base),\
+                {"__init__":__init__})
+
+def create_python_derived_expression_class(class_name, user_bases, user_dict):
+    """Return Expression class
+
+    This function is used to create all the dynamically created Expression
+    classes. It takes a class_name, and a compiled cpp.Expression and returns
+    a class that inherits the compiled class together with dolfin.Expression
+    and ufl.Coefficient.
+
+    *Arguments*
+        class_name
+            The name of the class
+        user_bases
+            User defined bases
+        user_dict
+            Dict with user specified function or attributes
+    """
+
+    # Check args
+    assert(isinstance(class_name, str))
+    assert(isinstance(user_bases, list))
+    assert(isinstance(user_dict, dict))
+
+    # Define the bases
+    assert(all([isinstance(t, (types.ClassType, type)) for t in user_bases]))
+    bases = tuple([Expression, ufl.Coefficient, cpp.Expression] + user_bases)
+
+    user_init = user_dict.pop("__init__", None)
+
+    # Check for deprecated dim and rank methods
+    if "dim" in user_dict or "rank" in user_dict:
+        raise DeprecationWarning, "'rank' and 'dim' are depcrecated, overload"\
+              " 'value_shape' instead"
+
+    def __init__(self, *args, **kwargs):
+        """Initialize the Expression"""
+        # Get element, domain and degree
+        element = kwargs.get("element", None)
+        degree = kwargs.get("degree", None)
+        cell = kwargs.get("cell", None)
+        domain = kwargs.get("domain", None)
+        name = kwargs.get("name", None)
+        label = kwargs.get("label", None)
+
+        # Check if user has passed too many arguments if no
+        # user_init is provided
+        if user_init is None:
+            from operator import add
+            # First count how many valid kwargs is passed
+            num_valid_kwargs = reduce(add, [kwarg is not None \
+                                      for kwarg in [element, degree, cell, domain, name, label]])
+            if len(kwargs) != num_valid_kwargs:
+                raise TypeError, "expected only 'kwargs' from one of "\
+                      "'element', 'degree', 'cell', 'domain', 'name' or 'label'"
+            if len(args) != 0:
+                raise TypeError, "expected no 'args'"
+
+        # Select an appropriate element if not specified
+        if element is None:
+            element = _auto_select_element_from_shape(self.value_shape(),
+                                                      degree, cell, domain)
+        elif isinstance(element, ufl.FiniteElementBase):
+            pass
+        else:
+            raise TypeError, "The 'element' argument must be a UFL finite"\
+                  " element."
+
+        # Initialize cpp_base class
+        cpp.Expression.__init__(self, list(element.value_shape()))
+
+        # Initialize UFL base class
+        ufl.Coefficient.__init__(self, element, count=self.id())
+
+        # Why do we store the ufl element here in addition to in ufl.Coefficient? It's available as self.element()...
+        self._ufl_element = element
+
+        # Calling the user defined_init
+        if user_init is not None:
+            user_init(self, *args, **kwargs)
+
+        name = name or "f_" + str(ufl.Coefficient.count(self))
+        label = label or "User defined expression"
+
+        self.rename(name, label)
+
+    # NOTE: Do not prevent the user to overload attributes "reserved" by PyDOLFIN
+    # NOTE: Why not?
+
+    ## Collect reserved attributes from both cpp.Function and ufl.Coefficient
+    #reserved_attr = dir(ufl.Coefficient)
+    #reserved_attr.extend(dir(cpp.Function))
+    #
+    ## Remove attributes that will be set by python
+    #for attr in ["__module__"]:
+    #    while attr in reserved_attr:
+    #        reserved_attr.remove(attr)
+    #
+    ## Check the dict_ for reserved attributes
+    #for attr in reserved_attr:
+    #    if attr in dict_:
+    #        raise TypeError, "The Function attribute '%s' is reserved by PyDOLFIN."%attr
+
+    # Add __init__ to the user_dict
+    user_dict["__init__"]  = __init__
+
+    # Create the class and return it
+    return type(class_name, bases, user_dict)
+
+class ExpressionMetaClass(type):
+    """Meta Class for Expression"""
+    def __new__(mcs, class_name, bases, dict_):
+        """Returns a new Expression class"""
+
+        assert(isinstance(class_name, str)), "Expecting a 'str'"
+        assert(isinstance(bases, tuple)), "Expecting a 'tuple'"
+        assert(isinstance(dict_, dict)), "Expecting a 'dict'"
+
+        # First check if we are creating the Expression class
+        if class_name == "Expression":
+            # Assert that the class is _not_ a subclass of Expression,
+            # i.e., a user have tried to:
+            #
+            #    class Expression(Expression):
+            #        ...
+            if len(bases) > 1 and bases[0] != object:
+                raise TypeError, "Cannot name a subclass of Expression:"\
+                      " 'Expression'"
+
+            # Return the new class, which just is the original Expression defined in
+            # this module
+            return type.__new__(mcs, class_name, bases, dict_)
+
+        # If creating a fullfledged derived expression class, i.e, inheriting
+        # dolfin.Expression, ufl.Coefficient and cpp.Expression (or a subclass)
+        # then just return the new class.
+        if len(bases) >= 3 and bases[0] == Expression and \
+               bases[1] == ufl.Coefficient and issubclass(bases[2], \
+                                                          cpp.Expression):
+            # Return the instantiated class
+            return type.__new__(mcs, class_name, bases, dict_)
+
+        # Handle any user provided base classes
+        user_bases = list(bases)
+
+        # remove Expression, to be added later
+        user_bases.remove(Expression)
+
+        # Check the user has provided either an eval or eval_cell method
+        if not ('eval' in dict_ or 'eval_cell' in dict_):
+            raise TypeError, "expected an overload 'eval' or 'eval_cell' method"
+
+        # Get name of eval function
+        eval_name = 'eval' if 'eval' in dict_ else 'eval_cell'
+
+        user_eval = dict_[eval_name]
+
+        # Check type and number of arguments of user_eval function
+        if not isinstance(user_eval, types.FunctionType):
+            raise TypeError, "'%s' attribute must be a 'function'"%eval_name
+        if eval_name == "eval" and not user_eval.func_code.co_argcount == 3:
+            raise TypeError, "The overloaded '%s' function must use "\
+                  "three arguments"%eval_name
+        if eval_name == "eval_cell" and \
+               not user_eval.func_code.co_argcount == 4:
+            raise TypeError, "The overloaded '%s' function must "\
+                  "use three arguments"%eval_name
+
+        return create_python_derived_expression_class(class_name, user_bases, dict_)
+
+#--- The user interface ---
+
+# Places here so it can be reused in Function
+class Expression(object):
+    """
+    This class represents a user-defined expression.
+
+    Expressions can be used as coefficients in variational forms or
+    interpolated into finite element spaces.
+
+    *Arguments*
+        cppcode
+           C++ argument, see below
+        element
+            Optional element argument
+        degree
+            Optional element degree when element is not given.
+
+
+    *1. Simple user-defined JIT-compiled expressions*
+        One may alternatively specify a C++ code for evaluation of the
+        Expression as follows:
+
+        .. code-block:: python
+
+            f0 = Expression('sin(x[0]) + cos(x[1])')
+            f1 = Expression(('cos(x[0])', 'sin(x[1])'), element = V.ufl_element())
+
+        Here, f0 is is scalar and f1 is vector-valued.
+
+        Tensor expressions of rank 2 (matrices) may also be created:
+
+        .. code-block:: python
+
+            f2 = Expression((('exp(x[0])','sin(x[1])'),
+                            ('sin(x[0])','tan(x[1])')))
+
+        In general, a single string expression will be interpreted as
+        a scalar, a tuple of strings as a tensor of rank 1 (a vector)
+        and a tuple of tuples of strings as a tensor of rank 2 (a
+        matrix).
+
+        The expressions may depend on x[0], x[1], and x[2] which carry
+        information about the coordinates where the expression is
+        evaluated. All math functions defined in <cmath> are available
+        to the user.
+
+        User defined parameters can be included as follows:
+
+        .. code-block:: python
+
+            f = Expression('A*sin(x[0]) + B*cos(x[1])', A=2.0, B=Constant(4.0))
+
+        The parameters can be scalars and any scalar valued
+        GenericFunction and are all initialized to the passed default
+        value. The user defined parameters can be accessed and set
+        as attributes or via the dict-like user_parameters attribute:
+
+        .. code-block:: python
+
+            f.A = 5.0
+            f.B = Expression("value", value=6.0)
+            f.user_parameters["A"] = 1.0
+            f.user_parameters["B"] = Constant(5.0)
+
+        A parameter can only be updated with its original
+        value-type. So if a parameter is a float, it can only be
+        updated with float.
+
+    *2. Complex user-defined JIT-compiled Expressions*
+        One may also define an Expression using more complicated logic
+        with the 'cppcode' argument. This argument should be a string
+        of C++ code that implements a class that inherits from
+        dolfin::Expression.
+
+        The following code illustrates how to define an Expression
+        that depends on material properties of the cells in a Mesh. A
+        MeshFunction is used to mark cells with different properties.
+
+        Note the use of the 'cell' parameter.
+
+        .. code-block:: python
+
+            code = '''
+            class MyFunc : public Expression
+            {
+            public:
+
+              std::shared_ptr<MeshFunction<std::size_t> > cell_data;
+
+              MyFunc() : Expression()
+              {
+              }
+
+            void eval(Array<double>& values, const Array<double>& x,
+                      const ufc::cell& c) const
+              {
+                assert(cell_data);
+                const Cell cell(*cell_data->mesh(), c.index);
+                switch ((*cell_data)[cell.index()])
+                {
+                case 0:
+                  values[0] = exp(-x[0]);
+                  break;
+                case 1:
+                  values[0] = exp(-x[2]);
+                  break;
+                default:
+                  values[0] = 0.0;
+                }
+              }
+            };'''
+
+            cell_data = CellFunction('uint', V.mesh())
+            f = Expression(code)
+            f.cell_data = cell_data
+
+        While JIT compiling an Expression the public interface is
+        scanned for dependencies. A user therefore need to include
+        header files (also dolfin header files) declaring types that
+        is used inside a method. The following example illustrates
+        this. Note the inclusion of the dolfin namespace.
+
+        ... code-block:: python
+
+            code = '''
+            #include "dolfin/fem/GenericDofMap.h"
+            namespace dolfin
+            {
+              class Delta : public Expression
+              {
+              public:
+
+                Delta() : Expression() {}
+
+                void eval(Array<double>& values, const Array<double>& data,
+                          const ufc::cell& cell) const
+                { }
+
+                void update(const std::shared_ptr<const Function> u,
+                            double nu, double dt, double C1,
+                            double U_infty, double chord)
+                {
+                  const std::shared_ptr<const Mesh> mesh = u->function_space()->mesh();
+                  const std::shared_ptr<const GenericDofMap> dofmap = u->function_space()->dofmap();
+                  const uint ncells = mesh->num_cells();
+                  uint ndofs_per_cell;
+                  if (ncells > 0)
+                  {
+                    CellIterator cell(*mesh);
+                    ndofs_per_cell = dofmap->cell_dimension(cell->index());
+                  }
+                  else
+                  {
+                     return;
+                  }
+                }
+              };
+            }'''
+
+            e = Expression(code)
+
+    *3. User-defined expressions by subclassing*
+        The user can subclass Expression and overload the 'eval'
+        function. The value_shape of such an Expression will default
+        to 0. If a user wants a vector or tensor Expression, the
+        value_shape method needs to be overloaded.
+
+        .. code-block:: python
+
+            class MyExpression0(Expression):
+                def eval(self, value, x):
+                    dx = x[0] - 0.5
+                    dy = x[1] - 0.5
+                    value[0] = 500.0*exp(-(dx*dx + dy*dy)/0.02)
+                    value[1] = 250.0*exp(-(dx*dx + dy*dy)/0.01)
+                def value_shape(self):
+                    return (2,)
+            f0 = MyExpression0()
+
+        If a user wants to use the Expression in a UFL form and have
+        more controll in which finite element should be used to
+        interpolate the expression in, the user can pass this
+        information using the element kwarg:
+
+        .. code-block:: python
+
+            V = FunctionSpace(mesh, "BDM", 1)
+            f1 = MyExpression0(element=V.ufl_element())
+
+        The user can also subclass Expression by overloading the
+        eval_cell function. By this the user gets access to more
+        powerful data structures, such as cell, facet and normal
+        information, during assembly.
+
+        .. code-block:: python
+
+            class MyExpression1(Expression):
+                def eval_cell(self, value, x, ufc_cell):
+                    if ufc_cell.index > 10:
+                        value[0] = 1.0
+                    else:
+                        value[0] = -1.0
+
+            f2 = MyExpression1()
+
+        The ufc_cell object can be queried for the following data:
+
+        .. code-block:: python
+
+            ufc_cell.cell_shape
+            ufc_cell.index
+            ufc_cell.topological_dimension
+            ufc_cell.geometric_dimension
+            ufc_cell.local_facet # only available on boundaries, otherwise -1
+            ufc_cell.mesh_identifier
+
+        The user can customize initialization of derived Expressions.
+        However, because of magic behind the scenes, a user needs to pass
+        optional arguments to __init__ using ``**kwargs``, and _not_
+        calling the base class __init__:
+
+        .. code-block:: python
+
+            class MyExpression1(Expression):
+                def __init__(self, mesh, domain):
+                    self._mesh = mesh
+                    self._domain = domain
+                def eval(self, values, x):
+                    ...
+
+            f3 = MyExpression1(mesh=mesh, domain=domain)
+
+        Note that subclassing may be significantly slower than using
+        JIT-compiled expressions. This is because a callback from C++
+        to Python will be involved each time a Expression needs to be
+        evaluated during assembly.
+
+    """
+
+    # Set the meta class
+    __metaclass__ = ExpressionMetaClass
+
+    def __new__(cls, cppcode=None, element=None, cell=None, domain=None, degree=None, \
+                name=None, label=None, **kwargs):
+
+        # If the __new__ function is called because we are instantiating
+        # a python sub class of Expression, then just return a new instant
+        # of the passed class
+        if cls.__name__ != "Expression":
+            return object.__new__(cls)
+
+        # Check arguments
+        _check_cppcode(cppcode)
+
+        # Extract any Constants from the kwargs
+        generic_function_members = [arg_name for arg_name, value in kwargs.items() \
+                                    if isinstance(value, cpp.GenericFunction)]
+
+        # Compile module and get the cpp.Expression class
+        cpp_base, members = compile_expressions([cppcode],
+                                                [generic_function_members])
+        cpp_base, members = cpp_base[0], members[0]
+
+        # Check passed default arguments
+        not_allowed = [n for n in dir(cls) if n[0] !="_"]
+        not_allowed += ["cppcode", "user_parameters"]
+        _check_kwargs(members, kwargs, not_allowed)
+
+        # Store compile arguments for later use
+        cpp_base.cppcode = cppcode
+
+        # Create and instantiate the new class
+        return object.__new__(create_compiled_expression_class(cpp_base))
+
+    # This method is only included so a user can check what arguments
+    # one should use in IPython using tab completion
+    def __init__(self, cppcode=None, element=None, cell=None, domain=None, degree=None, \
+                 name=None, label=None, **kwargs): pass
+
+    # Reuse the docstring from __new__
+    __init__.__doc__ = __new__.__doc__
+
+    def ufl_element(self):
+        "Return the ufl FiniteElement."
+        return self._ufl_element
+
+    def __str__(self):
+        "x.__str__() <==> print(x)"
+        return self.name()
+
+    def str(self, verbose=False):
+        "x.str() <==> info(x)"
+        return "<Expression %s>" % str(self._value_shape)
+
+    def __repr__(self):
+        "x.__repr__() <==> repr(x)"
+        return ufl.Coefficient.__repr__(self)
+
+    # Default value for the value shape
+    _value_shape = ()
+
+    def value_shape(self):
+        """Returns the value shape of the expression"""
+        return self._value_shape
+
+    def ufl_evaluate(self, x, component, derivatives):
+        """Function used by ufl to evaluate the Expression"""
+        import numpy
+        import ufl
+        assert derivatives == () # TODO: Handle derivatives
+
+        if component:
+            shape = self.shape()
+            assert len(shape) == len(component)
+            value_size = ufl.common.product(shape)
+            index = ufl.common.component_to_index(component, shape)
+            values = numpy.zeros(value_size)
+            self(*x, values=values)
+            return values[index]
+        else:
+            # Scalar evaluation
+            return self(*x)
+
+    def __call__(self, *args, **kwargs):
+        """
+        Evaluates the Expression
+
+        *Example*
+            1) Using an iterable as x:
+
+            .. code-block:: python
+
+                fs = Expression("sin(x[0])*cos(x[1])*sin(x[3])")
+                x0 = (1.,0.5,0.5)
+                x1 = [1.,0.5,0.5]
+                x2 = numpy.array([1.,0.5,0.5])
+                v0 = fs(x0)
+                v1 = fs(x1)
+                v2 = fs(x2)
+
+            2) Using multiple scalar args for x, interpreted as a
+            point coordinate
+
+            .. code-block:: python
+
+                v0 = f(1.,0.5,0.5)
+
+            3) Using a Point
+
+            .. code-block:: python
+
+                p0 = Point(1.,0.5,0.5)
+                v0 = f(p0)
+
+            3) Passing return array
+
+            .. code-block:: python
+
+                fv = Expression(("sin(x[0])*cos(x[1])*sin(x[3])",
+                              "2.0","0.0"))
+                x0 = numpy.array([1.,0.5,0.5])
+                v0 = numpy.zeros(3)
+                fv(x0, values = v0)
+
+                .. note::
+
+                    A longer values array may be passed. In this way
+                    one can fast fill up an array with different
+                    evaluations.
+
+            .. code-block:: python
+
+                values = numpy.zeros(9)
+                for i in xrange(0,10,3):
+                    fv(x[i:i+3], values = values[i:i+3])
+
+        """
+
+        if len(args)==0:
+            raise TypeError, "expected at least 1 argument"
+
+        # Test for ufl restriction
+        if len(args) == 1 and args[0] in ('+','-'):
+            return ufl.Coefficient.__call__(self, *args)
+
+        # Test for ufl mapping
+        if len(args) == 2 and isinstance(args[1], dict) and self in args[1]:
+            return ufl.Coefficient.__call__(self, *args)
+
+        # Some help variables
+        value_size = ufl.common.product(self.ufl_element().value_shape())
+
+        # If values (return argument) is passed, check the type and length
+        values = kwargs.get("values", None)
+        if values is not None:
+            if not isinstance(values, numpy.ndarray):
+                raise TypeError, "expected a NumPy array for 'values'"
+            if len(values) != value_size or \
+                   not numpy.issubdtype(values.dtype, 'd'):
+                raise TypeError, "expected a double NumPy array of length"\
+                      " %d for return values."%value_size
+            values_provided = True
+        else:
+            values_provided = False
+            values = numpy.zeros(value_size, dtype='d')
+
+        # Get dim if element has any domains
+        domains = self.ufl_element().domains()
+        dim = domains[0].geometric_dimension() if domains else None
+
+        # Assume all args are x argument
+        x = args
+
+        # If only one x argument has been provided, unpack it if it's an iterable
+        if len(x) == 1:
+            if isinstance(x[0], cpp.Point):
+                if dim is not None:
+                    x = [x[0][i] for i in xrange(dim)]
+                else:
+                    x = [x[0][i] for i in xrange(3)]
+            elif hasattr(x[0], '__iter__'):
+                x = x[0]
+
+        # Convert it to an 1D numpy array
+        try:
+            x = numpy.fromiter(x, 'd')
+        except (TypeError, ValueError, AssertionError), e:
+            print e
+            raise TypeError, "expected scalar arguments for the coordinates"
+
+        if len(x) == 0:
+            raise TypeError, "coordinate argument too short"
+
+        if dim is None:
+            warning("Evaluating an Expression without knowing the right geometric dimension, assuming %d is correct." % len(x))
+        else:
+            if len(x) != dim:
+                raise TypeError("expected the geometry argument to be of "\
+                                "length %d" % dim)
+
+        # The actual evaluation
+        self.eval(values, x)
+
+        # If scalar return statement, return scalar value.
+        if value_size == 1 and not values_provided:
+            return values[0]
+
+        return values
+
+#--- Utility functions ---
+
+def _check_cppcode(cppcode):
+    "Check that cppcode makes sense"
+
+    # Check that we get a string expression or nested expression
+    if not isinstance(cppcode, (str, tuple, list)):
+        raise TypeError, "Please provide a 'str', 'tuple' or 'list' for "\
+              "the 'cppcode' argument."
+
+def _auto_select_element_from_shape(shape, degree=None, cell=None, domain=None):
+    "Automatically select an appropriate element from cppcode."
+
+    # Cell to domain conversion TODO: deprecate cell argument
+    if domain is None:
+        if cell is None:
+            pass # No domain will result in undefined element
+        else:
+            domain = ufl.as_domain(cell)
+    else:
+        if cell is None:
+            domain = ufl.as_domain(domain) # Got only domain, good!
+        else:
+            raise ValueError("Got both domain and cell, use only domain.")
+
+    # Default element, change to quadrature when working
+    Family = "Lagrange"
+
+    # Check if scalar, vector or tensor valued
+    if len(shape) == 0:
+        element = ufl.FiniteElement(Family, domain, degree)
+    elif len(shape) == 1:
+        element = ufl.VectorElement(Family, domain, degree, dim=shape[0])
+    else:
+        element = ufl.TensorElement(Family, domain, degree, shape=shape)
+
+    cpp.debug("Automatic selection of expression element: " + str(element))
+
+    return element
+
+def _check_kwargs(members, kwargs, not_allowed):
+    """
+    Check that all kwargs passed is either scalars or scalar Constants,
+    and that the name is allowed
+    """
+
+    # Check passed default values
+    if not all(member in kwargs for member in members):
+        missing = []
+        for member in members:
+            if member not in kwargs:
+                missing.append(member)
+        missing = ", ".join("'%s'" % miss for miss in missing)
+        raise RuntimeError("expected a default value to all member "\
+                           "variables in the Expression. Missing: %s." % missing)
+
+    for name in kwargs.keys():
+        if name in not_allowed:
+            raise RuntimeError("Parameter name: '%s' is not allowed. It is "\
+                               "part of the interface of Expression" % name)
+
+    if not (all(isinstance(value, (int, float)) or \
+                (isinstance(value, cpp.GenericFunction) and value.value_size()==1) \
+                for value in kwargs.values())):
+        raise TypeError, "expected default arguments for member variables "\
+              "to be scalars or a scalar GenericFunctions."
diff --git a/site-packages/dolfin/functions/function.py b/site-packages/dolfin/functions/function.py
new file mode 100644
index 0000000..cf0aa64
--- /dev/null
+++ b/site-packages/dolfin/functions/function.py
@@ -0,0 +1,688 @@
+"""This module handles the Function class in Python.
+"""
+# Copyright (C) 2009-2014 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Martin S. Alnaes 2013-2014
+
+__all__ = ["Function", "TestFunction", "TrialFunction", "Argument",
+           "TestFunctions", "TrialFunctions"]
+
+import types
+
+# Import UFL and SWIG-generated extension module (DOLFIN C++)
+import ufl
+import dolfin.cpp as cpp
+import numpy
+
+from dolfin.functions.functionspace import FunctionSpaceBase
+from dolfin.functions.constant import Constant
+
+def _assign_error():
+    cpp.dolfin_error("function.py",
+                     "assign function",
+                     "Expects only linear combinations of Functions in "\
+                     "the same FunctionSpaces")
+
+def _check_mul_and_division(e, linear_comb, scalar_weight=1.0, multi_index=None):
+    """
+    Utility func for checking division and multiplication of a Function
+    with scalars in linear combinations of Functions
+    """
+    from ufl.constantvalue import ScalarValue
+    from ufl.classes import ComponentTensor, MultiIndex, Indexed
+    from ufl.algebra import Division, Product, Sum
+    #ops = e.operands()
+
+    # FIXME: What should be checked!?
+    same_multi_index = lambda x, y: len(x.free_indices()) == len(y.free_indices()) \
+                and x.index_dimensions().values() == y.index_dimensions().values()
+
+    assert(isinstance(scalar_weight, float))
+
+    # Split passed expression into scalar and expr
+    if isinstance(e, Product):
+        for i, op in enumerate(e.operands()):
+            if isinstance(op, ScalarValue) or \
+                   (isinstance(op, Constant) and op.value_size()==1):
+                scalar = op
+                expr = e.operands()[1-i]
+                break
+        else:
+            _assign_error()
+
+        scalar_weight *= float(scalar)
+    elif isinstance(e, Division):
+        expr, scalar = e.operands()
+        if not (isinstance(scalar, ScalarValue) or \
+                isinstance(scalar, Constant) and scalar.value_rank()==1):
+            _assign_error()
+        scalar_weight /= float(scalar)
+    else:
+        _assign_error()
+
+    # If a CoefficientTensor is passed we expect the expr to be either a
+    # Function or another ComponentTensor, where the latter wil result
+    # in a recursive call
+    if multi_index:
+        assert(isinstance(multi_index, MultiIndex))
+        assert(isinstance(expr, Indexed))
+
+        # Unpack Indexed and check equality with passed multi_index
+        expr, multi_index2 = expr.operands()
+        assert(isinstance(multi_index2, MultiIndex))
+        if not same_multi_index(multi_index, multi_index2):
+            _assign_error()
+
+    if isinstance(expr, Function):
+        linear_comb.append((expr, scalar_weight))
+
+    elif isinstance(expr, (ComponentTensor, Product, Division, Sum)):
+        # If componentTensor we need to unpack the MultiIndices
+        if isinstance(expr, ComponentTensor):
+            expr, multi_index = expr.operands()
+            if not same_multi_index(multi_index, multi_index2):
+                _error()
+
+        if isinstance(expr, (Product, Division)):
+            linear_comb = _check_mul_and_division(expr, linear_comb, \
+                                                  scalar_weight, multi_index)
+        elif isinstance(expr, Sum):
+            linear_comb = _check_and_extract_functions(expr, linear_comb, \
+                                                       scalar_weight, multi_index)
+        else:
+            _assign_error()
+    else:
+        _assign_error()
+
+    return linear_comb
+
+def _check_and_extract_functions(e, linear_comb=None, scalar_weight=1.0,
+                                 multi_index=None):
+    """
+    Utility func for extracting Functions and scalars in linear
+    combinations of Functions
+    """
+    from ufl.algebra import Sum, Product, Division
+    from ufl.classes import ComponentTensor
+    linear_comb = linear_comb or []
+
+    # First check u
+    if isinstance(e, Function):
+        linear_comb.append((e, scalar_weight))
+        return linear_comb
+
+    # Second check a*u*b, u/a/b, a*u/b where a and b are scalars
+    elif isinstance(e, (Product, Division)):
+        linear_comb = _check_mul_and_division(e, linear_comb, scalar_weight, multi_index)
+        return linear_comb
+
+    # Third check a*u*b, u/a/b, a*u/b where a and b are scalars and u is a Tensor
+    elif isinstance(e, ComponentTensor):
+        e, multi_index = e.operands()
+        linear_comb = _check_mul_and_division(e, linear_comb, scalar_weight, multi_index)
+        return linear_comb
+
+    # If not Product or Division we expect Sum
+    elif isinstance(e, Sum):
+        for op in e.operands():
+            linear_comb = _check_and_extract_functions(op, linear_comb, \
+                                                       scalar_weight, multi_index)
+
+    else:
+        _assign_error()
+
+    return linear_comb
+
+def _check_and_contract_linear_comb(expr, self, multi_index):
+    """
+    Utility func for checking and contracting linear combinations of
+    Functions
+    """
+    linear_comb = _check_and_extract_functions(expr, multi_index=multi_index)
+    funcs = []
+    weights = []
+    funcspace = None
+    for func, weight in linear_comb:
+        funcspace = funcspace or func.function_space()
+        if func not in funcspace:
+            _assign_error()
+        try:
+            # Check if the exact same Function is already present
+            ind = funcs.index(func)
+            weights[ind] += weight
+        except:
+            funcs.append(func)
+            weights.append(weight)
+
+    # Check that rhs does not include self
+    for ind, func in enumerate(funcs):
+        if func == self:
+            # If so make a copy
+            funcs[ind] = self.copy(deepcopy=True)
+            break
+
+    return zip(funcs, weights)
+
+class MetaNoEvalOverloading(type):
+    def __init__(mcs, name, bases, dictionary):
+        if "eval" in dictionary:
+            raise TypeError("cannot overload 'eval'")
+
+class Function(ufl.Coefficient, cpp.Function):
+    """
+    This class represents a function :math:`u_h` in a finite
+    element function space :math:`V_h`, given by
+
+    .. math::
+
+        u_h = \sum_{i=1}^n U_i \phi_i,
+
+    where :math:`\{\phi_i\}_{i=1}^n` is a basis for :math:`V_h`,
+    and :math:`U` is a vector of expansion coefficients for
+    :math:`u_h`.
+
+    *Arguments*
+        There is a maximum of three arguments. The first argument must be a
+        Function or a :py:class:`FunctionSpace
+        <dolfin.functions.functionspace.FunctionSpace>`.
+
+        If instantiated from another Function, the (optional)
+        second argument must be an integer denoting the number
+        of sub functions to extract.
+
+        In addition can a name argument be passed overruling the default name
+
+    *Examples*
+        Create a Function:
+
+        - from a :py:class:`FunctionSpace
+          <dolfin.functions.functionspace.FunctionSpace>` ``V``
+
+          .. code-block:: python
+
+              f = Function(V)
+
+        - from another Function ``f``
+
+          .. code-block:: python
+
+              g = Function(f)
+
+        - from a :py:class:`FunctionSpace
+          <dolfin.functions.functionspace.FunctionSpace>` ``V`` and a
+          :py:class:`GenericVector <dolfin.cpp.GenericVector>` ``v``
+
+          .. code-block:: python
+
+              g = Function(V, v)
+
+        - from a :py:class:`FunctionSpace
+          <dolfin.functions.functionspace.FunctionSpace>` and a
+          filename containg a :py:class:`GenericVector
+          <dolfin.cpp.GenericVector>`
+
+          .. code-block:: python
+
+              g = Function(V, 'MyVectorValues.xml')
+
+    """
+
+    __metaclass__ = MetaNoEvalOverloading
+
+    def __init__(self, *args, **kwargs):
+        """Initialize Function."""
+        # Initial quick check for valid arguments (other checks sprinkled below)
+        if len(args) == 0:
+            raise TypeError("expected 1 or more arguments")
+
+        # Type switch on argument types
+        if isinstance(args[0], Function):
+            other = args[0]
+            if len(args) == 1:
+                return self.__init_copy_constructor(other)
+            elif len(args) == 2:
+                i = args[1]
+                if not isinstance(i, int):
+                    raise TypeError("Invalid subfunction number %s" % (i,))
+                return self.__init_subfunction_constructor(other, i)
+            else:
+                raise TypeError("expected one or two arguments when "
+                                "instantiating from another Function")
+        elif isinstance(args[0], cpp.Function):
+            other = args[0]
+            if len(args) == 1:
+                # If creating a dolfin.Function from a cpp.Function
+                self.__init_cpp_copy_constructor(other)
+            else:
+                raise TypeError("expected only one argument when passing cpp.Function"
+                                "to dolfin.Function constructor")
+        elif isinstance(args[0], FunctionSpaceBase):
+            V = args[0]
+            # If initialising from a FunctionSpace
+            if len(args) == 1:
+                # If passing only the FunctionSpace
+                self.__init_from_function_space(V)
+            elif len(args) == 2:
+                # If passing FunctionSpace together with cpp.Function
+                # Attached passed FunctionSpace and initialize the cpp.Function
+                # using the passed Function
+                other = args[1]
+                if isinstance(other, cpp.Function):
+                    self.__init_from_function_space_and_cpp_function(V, other)
+                else:
+                    self.__init_from_function_space_and_function(V, other)
+            else:
+                raise TypeError("too many arguments")
+        else:
+            raise TypeError("expected a FunctionSpace or a Function as argument 1")
+
+        # Set name as given or automatic
+        name = kwargs.get("name") or "f_%d" % self.count()
+        self.rename(name, "a Function")
+
+    def __init_copy_constructor(self, other):
+        cpp.Function.__init__(self, other)
+        ufl.Coefficient.__init__(self, other._element, count=self.id())
+
+    def __init_cpp_copy_constructor(self, other):
+        # Lets be agressive in abusing dynamic typing shall we...
+        self.__class__ = Function
+        self.__dict__ = other.__dict__
+
+        # (Not calling cpp.Function.__init__)
+        ufl.Coefficient.__init__(self, other.function_space().ufl_element(), count=self.id())
+
+    def __init_subfunction_constructor(self, other, i):
+        num_sub_spaces = other.function_space().num_sub_spaces()
+        if num_sub_spaces == 1:
+            raise RuntimeError("No subfunctions to extract")
+        if not i < num_sub_spaces:
+            raise RuntimeError("Can only extract subfunctions "
+                               "with i = 0..%d"% num_sub_spaces)
+
+        cpp.Function.__init__(self, other, i)
+        ufl.Coefficient.__init__(self, self.function_space().ufl_element(), count=self.id())
+
+    def __init_from_function_space(self, V):
+        cpp.Function.__init__(self, V)
+        ufl.Coefficient.__init__(self, V.ufl_element(), count=self.id())
+
+    def __init_from_function_space_and_cpp_function(self, V, other):
+        # Simple consistency checks on function spaces
+        if other.function_space().dim() != V.dim():
+            raise ValueError("non matching dimensions on passed FunctionSpaces")
+
+        cpp.Function.__init__(self, other)
+        ufl.Coefficient.__init__(self, V.ufl_element(), count=self.id())
+
+    def __init_from_function_space_and_function(self, V, other):
+        cpp.Function.__init__(self, V, other)
+        ufl.Coefficient.__init__(self, V.ufl_element(), count=self.id())
+
+    def _sub(self, i, deepcopy = False):
+        cpp.deprecation("Using Function._sub", "1.3.0",
+                        "Use Function.sub instead")
+        self.sub(i, deepcopy)
+
+    def sub(self, i, deepcopy = False):
+        """
+        Return a sub function.
+
+        The sub functions are numbered from i = 0..N-1, where N is the
+        total number of sub spaces.
+
+        *Arguments*
+            i : int
+                The number of the sub function
+
+        """
+        if not isinstance(i, int):
+            raise TypeError("expects an 'int' as first argument")
+        num_sub_spaces = self.function_space().num_sub_spaces()
+        if num_sub_spaces == 1:
+            raise RuntimeError("No subfunctions to extract")
+        if not i < num_sub_spaces:
+            raise RuntimeError("Can only extract subfunctions with i = 0..%d"% num_sub_spaces)
+
+        # Create and instantiate the Function
+        if deepcopy:
+            return Function(self.function_space().sub(i), cpp.Function.sub(self, i))
+        else:
+            return Function(self, i)
+
+    def assign(self, rhs):
+        """
+        Assign either a Function or linear combination of Functions.
+
+        *Arguments*
+            rhs (_Function_)
+                A Function or a linear combination of Functions. If a linear
+                combination is passed all Functions need to be in the same
+                FunctionSpaces.
+        """
+        from ufl.operatorbase import AlgebraOperator
+        from ufl.classes import ComponentTensor
+        multi_index = None
+        if isinstance(rhs, (cpp.Function, cpp.Expression, cpp.FunctionAXPY)):
+            # Avoid self assignment
+            if self == rhs:
+                return
+
+            self._assign(rhs)
+        elif isinstance(rhs, (AlgebraOperator, ComponentTensor)):
+            if isinstance(rhs, ComponentTensor):
+                rhs, multi_index = rhs.operands()
+            linear_comb = _check_and_contract_linear_comb(rhs, self, multi_index)
+            assert(linear_comb)
+
+            # If the assigned Function lives in a different FunctionSpace
+            # we cannot operate on this function directly
+            same_func_space = linear_comb[0][0] in self.function_space()
+            func, weight = linear_comb.pop()
+
+            # Assign values from first func
+            if not same_func_space:
+                self._assign(func)
+                vector = self.vector()
+            else:
+                vector = self.vector()
+                vector[:] = func.vector()
+
+            # If first weight is not 1 scale
+            if weight != 1.0:
+                vector *= weight
+
+            # AXPY the other functions
+            for func, weight in linear_comb:
+                if weight == 0.0:
+                    continue
+                vector.axpy(weight, func.vector())
+
+        else:
+            cpp.dolfin_error("function.py",
+                             "function assignment",
+                             "Expects a Function or linear combinations of "\
+                             "Functions in the same FunctionSpaces")
+
+    def split(self, deepcopy=False):
+        """
+        Extract any sub functions.
+
+        A sub function can be extracted from a discrete function that
+        is in a :py:class:`MixedFunctionSpace
+        <dolfin.functions.functionspace.MixedFunctionSpace>` or in a
+        :py:class:`VectorFunctionSpace
+        <dolfin.functions.functionspace.VectorFunctionSpace>`. The sub
+        function resides in the subspace of the mixed space.
+
+        *Arguments*
+            deepcopy
+                Copy sub function vector instead of sharing
+
+        """
+
+        num_sub_spaces = self.function_space().num_sub_spaces()
+        if num_sub_spaces == 1:
+            raise RuntimeError("No subfunctions to extract")
+        return tuple(self.sub(i, deepcopy) for i in xrange(num_sub_spaces))
+
+    def ufl_element(self):
+        """Return ufl element"""
+        return self._element
+
+    def __str__(self):
+        """Return a pretty print representation of it self.
+        """
+        return self.name()
+
+    def __repr__(self):
+        """Return a str repr of it self.
+
+        Must use ufl.__repr__ for this"""
+        return ufl.Coefficient.__repr__(self)
+
+    def str(self, verbose=False):
+        """Return an informative str representation of itself"""
+        # FIXME: We might change this using rank and dimension instead
+        return "<Function in %s>" % str(self.function_space())
+
+    def ufl_evaluate(self, x, component, derivatives):
+        """Function used by ufl to evaluate the Function"""
+        import numpy
+        import ufl
+        assert derivatives == () # TODO: Handle derivatives
+
+        if component:
+            shape = self.shape()
+            assert len(shape) == len(component)
+            value_size = ufl.common.product(shape)
+            index = ufl.common.component_to_index(component, shape)
+            values = numpy.zeros(value_size)
+            self(*x, values=values)
+            return values[index]
+        else:
+            # Scalar evaluation
+            return self(*x)
+
+    def __float__(self):
+        if self.shape() != ():
+            raise RuntimeError("Cannot convert nonscalar function to float.")
+        elm = self.ufl_element()
+        if elm.family() != "Real":
+            raise RuntimeError("Cannot convert spatially varying function to float.")
+        # Gather value directly from vector in a parallell safe way
+        vec = self.vector()
+        indices = numpy.zeros(1, dtype='intc')
+        values = vec.gather(indices)
+        return float(values[0])
+
+    def __call__(self, *args, **kwargs):
+        """
+        Evaluates the Function.
+
+        *Examples*
+            1) Using an iterable as x:
+
+              .. code-block:: python
+
+                  fs = Expression("sin(x[0])*cos(x[1])*sin(x[3])")
+                  x0 = (1.,0.5,0.5)
+                  x1 = [1.,0.5,0.5]
+                  x2 = numpy.array([1.,0.5,0.5])
+                  v0 = fs(x0)
+                  v1 = fs(x1)
+                  v2 = fs(x2)
+
+            2) Using multiple scalar args for x, interpreted as a
+            point coordinate
+
+              .. code-block:: python
+
+                  v0 = f(1.,0.5,0.5)
+
+            3) Using a Point
+
+              .. code-block:: python
+
+                  p0 = Point(1.,0.5,0.5)
+                  v0 = f(p0)
+
+            3) Passing return array
+
+              .. code-block:: python
+
+                  fv = Expression(("sin(x[0])*cos(x[1])*sin(x[3])",
+                               "2.0","0.0"))
+                  x0 = numpy.array([1.,0.5,0.5])
+                  v0 = numpy.zeros(3)
+                  fv(x0, values = v0)
+
+              .. note::
+
+                  A longer values array may be passed. In this way one can fast
+                  fill up an array with different evaluations.
+
+              .. code-block:: python
+
+                  values = numpy.zeros(9)
+                  for i in xrange(0,10,3):
+                      fv(x[i:i+3], values = values[i:i+3])
+
+        """
+
+        if len(args)==0:
+            raise TypeError("expected at least 1 argument")
+
+        # Test for ufl restriction
+        if len(args) == 1 and args[0] in ('+','-'):
+            return ufl.Coefficient.__call__(self, *args)
+
+        # Test for ufl mapping
+        if len(args) == 2 and isinstance(args[1], dict) and self in args[1]:
+            return ufl.Coefficient.__call__(self, *args)
+
+        # Some help variables
+        value_size = ufl.common.product(self.ufl_element().value_shape())
+
+        # If values (return argument) is passed, check the type and length
+        values = kwargs.get("values", None)
+        if values is not None:
+            if not isinstance(values, numpy.ndarray):
+                raise TypeError("expected a NumPy array for 'values'")
+            if len(values) != value_size or \
+                   not numpy.issubdtype(values.dtype, 'd'):
+                raise TypeError("expected a double NumPy array of length"\
+                      " %d for return values."%value_size)
+            values_provided = True
+        else:
+            values_provided = False
+            values = numpy.zeros(value_size, dtype='d')
+
+        # Get the geometric dimension we live in
+        dim = self.geometric_dimension() # (UFL function)
+
+        # Assume all args are x argument
+        x = args
+
+        # If only one x argument has been provided, unpack it if it's an iterable
+        if len(x) == 1:
+            if isinstance(x[0], cpp.Point):
+                x = [x[0][i] for i in xrange(dim)]
+            elif hasattr(x[0], '__iter__'):
+                x = x[0]
+
+        # Convert it to an 1D numpy array
+        try:
+            x = numpy.fromiter(x, 'd')
+        except (TypeError, ValueError, AssertionError), e:
+            raise TypeError("expected scalar arguments for the coordinates")
+
+        if len(x) == 0:
+            raise TypeError("coordinate argument too short")
+
+        if len(x) != dim:
+            raise TypeError("expected the geometry argument to be of "\
+                  "length %d"%dim)
+
+        # The actual evaluation
+        self.eval(values, x)
+
+        # If scalar return statement, return scalar value.
+        if value_size == 1 and not values_provided:
+            return values[0]
+
+        return values
+
+#--- Subclassing of ufl.{Basis, Trial, Test}Function ---
+
+_ufl_dolfin_difference_message = """\
+When constructing an Argument, TestFunction or TrialFunction,
+you must to provide a FunctionSpace and not a FiniteElement.
+The FiniteElement class provided by ufl only represents an
+abstract finite element space and is only used in standalone
+.ufl files, while the FunctionSpace provides a full discrete
+function space over a given mesh and should be used in dolfin
+programs in Python.
+"""
+
+class Argument(ufl.Argument):
+    """UFL value: Representation of an argument to a form.
+
+    This is the overloaded PyDOLFIN variant.
+    """
+    def __init__(self, V, number, part=None):
+        if not isinstance(V, FunctionSpaceBase):
+            if isinstance(V, ufl.FiniteElementBase):
+                raise TypeError(_ufl_dolfin_difference_message)
+            else:
+                raise TypeError("Illegal argument for creation of Argument, not a FunctionSpace: " + str(V))
+            raise TypeError("Illegal argument for creation of Argument, not a FunctionSpace: " + str(V))
+        ufl.Argument.__init__(self, V.ufl_element(), number, part)
+        self._V = V
+
+    def function_space(self):
+        "Return the FunctionSpace"
+        return self._V
+
+    def __eq__(self, other):
+        """Extending UFL __eq__ here to distinguish test and trial
+        functions in different function spaces with same ufl element."""
+        return (isinstance(other, Argument) and
+                self.number() == other.number() and
+                self.part() == other.part() and
+                self._V == other._V)
+
+def TestFunction(V, part=None):
+    """UFL value: Create a test function argument to a form.
+
+    This is the overloaded PyDOLFIN variant.
+    """
+    return Argument(V, 0, part)
+
+def TrialFunction(V, part=None):
+    """UFL value: Create a trial function argument to a form.
+
+    This is the overloaded PyDOLFIN variant.
+    """
+    return Argument(V, 1, part)
+
+#--- TestFunctions and TrialFunctions ---
+
+def Arguments(V, number):
+    """UFL value: Create an Argument in a mixed space, and return a
+    tuple with the function components corresponding to the subelements.
+
+    This is the overloaded PyDOLFIN variant.
+    """
+    return ufl.split(Argument(V, number))
+
+def TestFunctions(V):
+    """UFL value: Create a TestFunction in a mixed space, and return a
+    tuple with the function components corresponding to the subelements.
+
+    This is the overloaded PyDOLFIN variant.
+    """
+    return ufl.split(TestFunction(V))
+
+def TrialFunctions(V):
+    """UFL value: Create a TrialFunction in a mixed space, and return a
+    tuple with the function components corresponding to the subelements.
+
+    This is the overloaded PyDOLFIN variant.
+    """
+    return ufl.split(TrialFunction(V))
diff --git a/site-packages/dolfin/functions/functionspace.py b/site-packages/dolfin/functions/functionspace.py
new file mode 100644
index 0000000..0088d08
--- /dev/null
+++ b/site-packages/dolfin/functions/functionspace.py
@@ -0,0 +1,674 @@
+"""
+This module contains functionality for function spaces in particular
+discrete function spaces defined over meshes in terms of finite
+elements.
+"""
+
+# Copyright (C) 2008-2014 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2008
+# Modified by Martin Alnes 2008-2014
+# Modified by Kent-Andre Mardal 2009
+# Modified by Marie E. Rognes 2012
+
+__all__ = ["FunctionSpace", "MixedFunctionSpace",
+           "VectorFunctionSpace", "TensorFunctionSpace",
+           "FunctionSpaceBase","FunctionSpaceFromCpp",
+           "create_ufc_function_spaces"]
+
+import copy
+import numpy
+
+# Import UFL and SWIG-generated extension module (DOLFIN C++)
+import ufl
+import dolfin.cpp as cpp
+from dolfin.compilemodules.jit import jit
+
+
+def _get_common_mesh_and_constrained_domain(spaces, fstype):
+    mesh = spaces[0].mesh()
+    constrained_domain = spaces[0].dofmap().constrained_domain
+
+    # Check that subspaces actually share the mesh
+    if not all(V.mesh().id() == mesh.id() for V in spaces):
+        cpp.dolfin_error("functionspace.py",
+                         "create function space",
+                         "Nonmatching meshes for " + fstype + " function space: " \
+                         + str([V.mesh() for V in spaces]))
+
+    # Also check that all spaces share same constrained_domain map we pass on
+    ncd = sum(0 if V.dofmap().constrained_domain is None else 1 for V in spaces)
+    if ncd == 0:
+        # No constrained domains, nothing to check
+        pass
+    elif ncd == len(spaces):
+        pass
+        # Error checking here is not possible at the moment because
+        # SubDomain is not a Variable and thus has no .id(), and the
+        # swig layer gives us a different python object for the same
+        # constrained_domain
+        # All constrained domains should be the same
+        #for V in spaces:
+        #    cd2 = V.dofmap().constrained_domain
+        #    if not cd2 is constrained_domain or cd2.id() == constrained_domain.id():
+        #        cpp.dolfin_error("functionspace.py",
+        #                         "create function space",
+        #                         "Nonmatching constrained_domain for " + fstype + " function space: " \
+        #                         + str([V.dofmap().constrained_domain for V in spaces]))
+    else:
+        # Not allowing some to have constrained domain and some not to.
+        cpp.dolfin_error("functionspace.py",
+                         "create function space",
+                         "Nonmatching constrained_domain for " + fstype + " function space: " \
+                         + str([V.dofmap().constrained_domain for V in spaces]))
+
+    return mesh, constrained_domain
+
+
+def _analyse_mesh_argument(mesh):
+    # Get Mesh or Restriction from Domain or Domain from Mesh or Restriction
+    if not isinstance(mesh, (cpp.Mesh, cpp.Restriction, ufl.Domain)):
+        cpp.dolfin_error("functionspace.py",
+                         "create function space",
+                         "Illegal argument, not a mesh or restriction: " + str(mesh))
+
+    # Interpret mesh argument. This is messy, the design could
+    # probably be improved significantly.
+    if isinstance(mesh, cpp.Mesh):
+        ufl_domain = mesh.ufl_domain() # Passed to ufl
+        mesh = mesh                    # Passed to dolfin
+    elif isinstance(mesh, cpp.Restriction):
+        ufl_domain = mesh.mesh().ufl_domain() # Passed to ufl (loses information about Restriction)
+        mesh = mesh                           # Keep Restriction here,
+    elif isinstance(mesh, ufl.Domain):
+        ufl_domain = mesh    # Passed to ufl
+        mesh = mesh.data()   # Get Mesh or Restriction payload from ufl object
+
+    # Check arguments again
+    if not isinstance(ufl_domain, (ufl.Domain,)):
+        cpp.dolfin_error("functionspace.py",
+                         "create function space",
+                         "Failed to extract Domain: " + str(ufl_domain))
+    if not isinstance(mesh, (cpp.Mesh, cpp.Restriction)):
+        cpp.dolfin_error("functionspace.py",
+                         "create function space",
+                         "Illegal argument, not a mesh or restriction: " + str(mesh))
+    return ufl_domain, mesh
+
+class FunctionSpaceBase(cpp.FunctionSpace):
+    "Base class for all function spaces."
+
+    def __init__(self, mesh, element, constrained_domain=None):
+        """Create function space on given mesh for given finite element.
+
+        *Arguments*
+            mesh
+                A :py:class:`Mesh <dolfin.cpp.Mesh>`
+            element
+                A :py:class:`(UFL) FiniteElement <ufl.FiniteElementBase>`
+
+        """
+
+        # Store reference to constrained domain to avoid possible SWIG
+        # director memory error (see
+        # https://bitbucket.org/fenics-project/dolfin/issue/71)
+        self.constrained_domain = constrained_domain
+
+        # Check arguments
+        if not isinstance(mesh, (cpp.Mesh, cpp.Restriction)):
+            cpp.dolfin_error("functionspace.py",
+                             "create function space",
+                             "Illegal argument, not a mesh or restriction: " + str(mesh))
+        if not isinstance(element, (ufl.FiniteElementBase)):
+            cpp.dolfin_error("functionspace.py",
+                             "create function space",
+                             "Illegal argument, not a finite element: " + str(element))
+        if constrained_domain is not None:
+            if not isinstance(constrained_domain, cpp.SubDomain):
+                cpp.dolfin_error("functionspace.py",
+                                 "create function space",
+                                 "Illegal argument, not a subdomain: " + str(constrained_domain))
+
+        # Store element Note: self._ufl_element cannot be a private
+        # attribute as we want to be able to set the element from a
+        # derived class.
+        self._ufl_element = element
+
+        # JIT-compile element to get ufc_element and ufc_dofmap
+        ufc_element, ufc_dofmap = jit(self._ufl_element)
+
+        # Instantiate DOLFIN FiniteElement and DofMap
+        self._dolfin_element = cpp.FiniteElement(ufc_element)
+        if constrained_domain is not None:
+            if isinstance(mesh, cpp.Restriction):
+                cpp.dolfin_error("functionspace.py",
+                                 "create function space",
+                                 "Cannot use constrained domains together with restrictions.")
+            dolfin_dofmap  = cpp.DofMap(ufc_dofmap, mesh, constrained_domain)
+        else:
+            if isinstance(mesh, cpp.Restriction):
+                dolfin_dofmap = cpp.DofMap(ufc_dofmap, mesh)
+                mesh = mesh.mesh()
+            else:
+                dolfin_dofmap  = cpp.DofMap(ufc_dofmap, mesh)
+
+        # Initialize the cpp_FunctionSpace
+        cpp.FunctionSpace.__init__(self, mesh,
+                                   self._dolfin_element,
+                                   dolfin_dofmap)
+
+    # FIXME: Sort out consistent interface for access to DOLFIN, UFL and UFC objects...
+
+    def cell(self):
+        "Return the UFL cell."
+        return self._ufl_element.domain().cell()
+
+    #def ufl_domain(self): # TODO: Do we want this?
+    #    "Return the UFL domain."
+    #    return self._ufl_element.domain()
+
+    def ufl_element(self):
+        "Return the UFL element."
+        return self._ufl_element
+
+    def dolfin_element(self):
+        "Return the DOLFIN element."
+        return self._dolfin_element
+
+    def __add__(self, other):
+        "Create enriched function space."
+        return EnrichedFunctionSpace((self, other))
+
+    def __mul__(self, other):
+        "Create mixed function space."
+        return MixedFunctionSpace((self, other))
+
+    def __str__(self):
+        "Pretty-print."
+        return "<Function space of dimension %d (%s)>" % \
+               (self.dofmap().global_dimension(), str(self._ufl_element))
+
+    def num_sub_spaces(self):
+        "Return the number of sub spaces"
+        return self._dolfin_element.num_sub_elements()
+
+    def sub(self, i):
+        "Return the i:th cpp.SubSpace"
+        # Fixme: Should we have a more extensive check other than whats included in
+        # the cpp code?
+        #if i not in self._cpp_sub_spaces.keys():
+            # Store the created subspace to prevent swig garbage collection
+            # Should not be needed as SubSpace is shared_ptr stored
+        #    self._cpp_sub_spaces[i] = FunctionSpaceFromCpp(cpp.SubSpace(self,i))
+        if not isinstance(i, int):
+            raise TypeError, "expected an int for 'i'"
+        if self.num_sub_spaces() == 1:
+            raise ValueError, "no SubSpaces to extract"
+        if i >= self.num_sub_spaces():
+            raise ValueError, "Can only extract SubSpaces with i = 0 ... %d" % \
+                  (self.num_sub_spaces() - 1)
+        assert(hasattr(self._ufl_element,"sub_elements"))
+        element = self._ufl_element.sub_elements()[i]
+        return FunctionSpaceFromCpp(cpp.SubSpace(self, i), element)
+
+    def extract_sub_space(self, component):
+        """
+        Extract subspace for component
+
+        *Arguments*
+            component (numpy.array(uint))
+               The component.
+
+        *Returns*
+            _FunctionSpace_
+                The subspace.
+        """
+
+        # Transform the argument to a NumPy array
+        if not hasattr(component, "__len__"):
+            cpp.dolfin_error("functionspace.py",
+                             "extracting sub spaces",
+                             "Expected a component which is iterable")
+        component = numpy.asarray(component, dtype=numpy.uintp)
+
+        # Get the cpp version of the FunctionSpace
+        cpp_space = cpp.FunctionSpace.extract_sub_space(self, component)
+
+        # Instantiate a ufl finite element based on the dolfin element signature
+        element = eval(cpp_space.element().signature(), ufl.__dict__).reconstruct(domain=self.mesh())
+        return FunctionSpaceFromCpp(cpp_space, element)
+
+    def split(self):
+        """
+        Split a mixed functionspace into its sub spaces
+        """
+        S = []
+        for i in range(self.num_sub_spaces()):
+            S.append(self.sub(i))
+        return S
+
+    def collapse(self, collapsed_dofs=False):
+        """
+        Collapse a subspace and return a new function space and a map
+        from new to old dofs
+
+        *Arguments*
+            collapsed_dofs (bool)
+                Return the map from new to old dofs
+
+       *Returns*
+           _FunctionSpace_
+                The new function space.
+           dict
+                The map from new to old dofs (optional)
+        """
+        cpp_space, dofs = cpp.FunctionSpace.collapse(self)
+        if collapsed_dofs:
+            return FunctionSpaceFromCpp(cpp_space), dofs
+        return FunctionSpaceFromCpp(cpp_space)
+
+class FunctionSpaceFromCpp(FunctionSpaceBase):
+    "FunctionSpace represents a finite element function space."
+    def __new__(cls, cppV, element=None):
+        if not isinstance(cppV, (cpp.FunctionSpace)):
+            cpp.dolfin_error("functionspace.py",
+                             "create function space",
+                             "Illegal argument, not a cpp.FunctionSpace: " + str(cppV))
+
+        # Lets be agressive in abusing dynamic typing shall we...
+        cppV._dolfin_element = cppV.element()
+        cppV._ufl_element = eval(cppV.element().signature(), ufl.__dict__).reconstruct(domain=cppV.mesh())
+        cppV.__class__ = FunctionSpaceBase
+        return cppV
+
+def create_ufc_function_spaces(mesh, ufc_form, cache=None):
+    """
+    Instantiate cpp.FunctionSpaces from compiled ufc form.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+        ufc_form
+            compiled ufc form
+        cache
+            a 'dict' with already instantiated
+            :py:class:`cpp.FunctionSpaces <dolfin.cpp.FunctionSpace>`.
+
+    *Examples of usage*
+
+        .. code-block:: python
+
+            fs0, c = create_ufc_function_spaces(mesh, ufc_form0)
+            fs1, c = create_ufc_function_spaces(mesh, ufc_form1, c)
+
+    """
+
+    # Initialize return arguments
+    functionspaces = []
+    if cache is None:
+        cache = {}
+
+    # Iterate over all known ufc_finite_elements
+    for i in range(ufc_form.rank() + ufc_form.num_coefficients()):
+        # Create a ufc_finite_elements
+        fe = ufc_form.create_finite_element(i)
+
+        # Use the signature of the element as key in the cache dict
+        fesig = fe.signature()
+
+        # Try to access the cache
+        V = cache.get(fesig)
+
+        # If the cpp.FunctionSpace does not excists in the cache
+        if V is None:
+            # Instantiate a dofmap
+            dm = ufc_form.create_dofmap(i)
+
+            # Instantiate the UFCFunctionSpace
+            V = UFCFunctionSpace(mesh, fe, dm)
+            cache[fesig] = V
+
+        functionspaces.append(V)
+
+    return functionspaces, cache
+
+class UFCFunctionSpace(cpp.FunctionSpace):
+    "FunctionSpace represents a finite element function space."
+    def __init__(self, mesh, ufc_finite_element, ufc_dofmap, constrained_domain=None):
+        " Initialize a FunctionSpace from ufc data "
+        self._mesh = mesh
+        self._finite_element = cpp.FiniteElement(ufc_finite_element)
+        if constrained_domain is None:
+            self._dofmap = cpp.DofMap(ufc_dofmap, mesh)
+        else:
+            self._dofmap = cpp.DofMap(ufc_dofmap, mesh, constrained_domain)
+        self._ufc_finite_element = ufc_finite_element
+        self._ufc_dofmap = ufc_dofmap
+        cpp.FunctionSpace.__init__(self, self._mesh, self._finite_element, \
+                                   self._dofmap)
+
+        # Store reference to constrained domain to avoid possible SWIG
+        # director memory error (see
+        # https://bitbucket.org/fenics-project/dolfin/issue/71)
+        self.constrained_domain = constrained_domain
+
+class FunctionSpace(FunctionSpaceBase):
+    "FunctionSpace represents a finite element function space."
+
+    def __init__(self, mesh, family, degree, form_degree=None,
+                 constrained_domain=None, restriction=None):
+        """
+        Create finite element function space.
+
+        *Arguments*
+            mesh (:py:class:`Mesh <dolfin.cpp.Mesh>`)
+                the mesh
+            family (string)
+                specification of the element family, see below for
+                alternatives.
+            degree (int)
+                the degree of the element.
+            form_degree (int)
+                the form degree (FEEC notation, used when field is
+                viewed as k-form)
+            constrained_domain
+                constrained subdomain with map function.
+            restriction
+                restriction of the element (e.g. to cell facets).
+
+        Which families and degrees that are supported is determined by the
+        form compiler used to generate the element, but typical families
+        include
+
+        =================================  =========
+        Name                               Usage
+        =================================  =========
+        Argyris*                           "ARG"
+        Arnold-Winther*                    "AW"
+        Brezzi-Douglas-Fortin-Marini*      "BDFM"
+        Brezzi-Douglas-Marini              "BDM"
+        Bubble                             "B"
+        Crouzeix-Raviart                   "CR"
+        Discontinuous Lagrange             "DG"
+        Discontinuous Raviart-Thomas       "DRT"
+        Hermite*                           "HER"
+        Lagrange                           "CG"
+        Mardal-Tai-Winther*                "MTW"
+        Morley*                            "MOR"
+        Nedelec 1st kind H(curl)           "N1curl"
+        Nedelec 2nd kind H(curl)           "N2curl"
+        Quadrature                         "Q"
+        Raviart-Thomas                     "RT"
+        Real                               "R"
+        =================================  =========
+
+        *only partly supported.
+
+        *Examples of usage*
+            To define a discrete function space over e.g. the unit square:
+
+            .. code-block:: python
+
+                mesh = UnitSquare(32,32)
+                V = FunctionSpace(mesh, "CG", 1)
+
+            Here, ``"CG"`` stands for Continuous Galerkin, implying the
+            standard Lagrange family of elements. Instead of ``"CG"``, we
+            could have written ``"Lagrange"``. With degree 1, we get the
+            linear Lagrange element. Other examples include:
+
+            .. code-block:: python
+
+                # Discontinuous element of degree 0
+                V = FunctionSpace(mesh, "DG", 0)
+
+                # Brezzi-Douglas-Marini element of degree 2
+                W = FunctionSpace(mesh, "BDM", 2)
+
+                # Real element with one global degree of freedom
+                R = FunctionSpace(mesh, "R", 0)
+
+        """
+
+        # Check arguments
+        if not isinstance(family, str):
+            cpp.dolfin_error("functionspace.py",
+                             "create function space",
+                             "Illegal argument for finite element family, not a string: " + str(family))
+        if not isinstance(degree, int):
+            cpp.dolfin_error("functionspace.py",
+                             "create function space",
+                             "Illegal argument for degree, not an integer: " + str(degree))
+
+        # Get Mesh or Restriction from Domain or Domain from Mesh or
+        # Restriction
+        ufl_domain, mesh = _analyse_mesh_argument(mesh)
+
+        # Create UFL element
+        element = ufl.FiniteElement(family, ufl_domain, degree, form_degree=form_degree)
+        if restriction is not None:
+            element = element[restriction]
+
+        # Initialize base class
+        FunctionSpaceBase.__init__(self, mesh, element, constrained_domain)
+
+        self.___degree = degree
+        self.___family = family
+        self.___mesh = mesh.mesh() if isinstance(mesh, cpp.Restriction) else mesh
+        self.___form_degree = form_degree
+
+        # Store reference to constrained domain to avoid possible SWIG
+        # director memory error (see
+        # https://bitbucket.org/fenics-project/dolfin/issue/71)
+        self.constrained_domain = constrained_domain
+
+    def restriction(self, meshfunction):
+        space = FunctionSpace(self.___mesh, self.___family, self.___degree,
+                              form_degree=self.___form_degree)
+        space.attach(meshfunction)
+        return space
+
+class EnrichedFunctionSpace(FunctionSpaceBase):
+    "EnrichedFunctionSpace represents an enriched finite element function space."
+
+    def __init__(self, spaces):
+        """
+        Create enriched finite element function space.
+
+        *Arguments*
+            spaces
+                a list (or tuple) of :py:class:`FunctionSpaces
+                <dolfin.functions.functionspace.FunctionSpace>`.
+
+        *Usage*
+            The function space may be created by
+
+            .. code-block:: python
+
+                V = EnrichedFunctionSpace(spaces)
+
+        """
+
+        # Check arguments
+        if not len(spaces) > 0:
+            cpp.dolfin_error("functionspace.py",
+                             "create enriched function space",
+                             "Need at least one subspace")
+        if not all(isinstance(V, FunctionSpaceBase) for V in spaces):
+            cpp.dolfin_error("functionspace.py",
+                             "create enriched function space",
+                             "Invalid subspaces: " + str(spaces))
+
+        # Create element
+        element = ufl.EnrichedElement(*[V.ufl_element() for V in spaces])
+
+        # Get common mesh and constrained_domain, must all be the same
+        mesh, constrained_domain = _get_common_mesh_and_constrained_domain(spaces, "enriched")
+
+        # Initialize base class
+        FunctionSpaceBase.__init__(self, mesh, element, constrained_domain=constrained_domain)
+
+class MixedFunctionSpace(FunctionSpaceBase):
+    "MixedFunctionSpace represents a mixed finite element function space."
+
+    def __init__(self, spaces):
+        """
+        Create mixed finite element function space.
+
+        *Arguments*
+            spaces
+                a list (or tuple) of :py:class:`FunctionSpaces
+                <dolfin.functions.functionspace.FunctionSpace>`.
+
+        *Examples of usage*
+            The function space may be created by
+
+            .. code-block:: python
+
+                V = MixedFunctionSpace(spaces)
+
+            ``spaces`` may consist of multiple occurances of the same space:
+
+            .. code-block:: python
+
+                P1  = FunctionSpace(mesh, "CG", 1)
+                P2v = VectorFunctionSpace(mesh, "Lagrange", 2)
+
+                ME  = MixedFunctionSpace([P2v, P1, P1, P1])
+
+        """
+
+        # Check arguments
+        if not len(spaces) > 0:
+            cpp.dolfin_error("functionspace.py",
+                             "create mixed function space",
+                             "Need at least one subspace")
+        if not all(isinstance(V, FunctionSpaceBase) for V in spaces):
+            cpp.dolfin_error("functionspace.py",
+                             "create mixed function space",
+                             "Invalid subspaces: " + str(spaces))
+
+        # Create UFL element
+        element = ufl.MixedElement(*[V.ufl_element() for V in spaces])
+
+        # Get common mesh and constrained_domain, must all be the same
+        mesh, constrained_domain \
+        = _get_common_mesh_and_constrained_domain(spaces, "mixed")
+
+        # Initialize base class using mesh from first space
+        FunctionSpaceBase.__init__(self, mesh, element, \
+                                   constrained_domain=constrained_domain)
+
+class VectorFunctionSpace(MixedFunctionSpace):
+    "VectorFunctionSpace represents a vector-valued finite element function space."
+
+    def __init__(self, mesh, family, degree, dim=None, form_degree=None,
+                 constrained_domain=None, restriction=None):
+        """Create vector-valued finite element function space.
+
+        Use VectorFunctionSpace if the unknown is a vector field,
+        instead of a :py:class:`FunctionSpace
+        <dolfin.functions.functionspace.FunctionSpace>` object for
+        scalar fields.
+
+        *Arguments*
+            mesh (:py:class:`Mesh <dolfin.cpp.Mesh>`)
+                the mesh
+            family (string)
+                a string specifying the element family, see
+                :py:class:`FunctionSpace
+                <dolfin.functions.functionspace.FunctionSpace>` for
+                alternatives.
+            degree (int)
+                the (polynomial) degree of the element.
+            dim (int)
+                an optional argument specifying the number of components.
+            form_degree (int)
+                an optional argument specifying the degree of the
+                k-form (used for FEEC notation)
+
+        If the dim argument is not provided, the dimension will be
+        deduced from the dimension of the mesh.
+
+        *Example of usage*
+
+            .. code-block:: python
+
+                V = VectorFunctionSpace(mesh, "CG", 1)
+
+        """
+
+        # Get Mesh or Restriction from Domain or Domain from Mesh or
+        # Restriction
+        ufl_domain, mesh = _analyse_mesh_argument(mesh)
+
+        # Create element
+        element = ufl.VectorElement(family, ufl_domain, degree, dim=dim,
+                                    form_degree=form_degree)
+        if restriction is not None:
+            element = element[restriction]
+
+        # Initialize base class
+        FunctionSpaceBase.__init__(self, mesh, element,
+                                   constrained_domain=constrained_domain)
+
+class TensorFunctionSpace(FunctionSpaceBase):
+    "TensorFunctionSpace represents a tensor-valued finite element function space."
+
+    def __init__(self, mesh, family, degree, shape=None, symmetry=None, \
+                 constrained_domain=None, restriction=None):
+        """Create tensor-valued finite element function space.
+
+        *Arguments*
+            mesh
+                a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+            family
+                a string specifying the element family,
+                see :py:class:`FunctionSpace
+                <dolfin.functions.functionspace.FunctionSpace>`
+                for alternatives.
+            degree
+                the degree of the element.
+            shape
+                an optional argument specifying the shape of the tensor.
+            symmetry
+                optional argument specifying whether the tensor is symmetric.
+
+        If the shape argument is not provided, the dimension will be
+        deduced from the dimension of the mesh.
+
+        *Example of usage*
+
+            .. code-block:: python
+
+                V = TensorFunctionSpace(mesh, "CG", 1)
+
+        """
+
+        # Get Mesh or Restriction from Domain or Domain from Mesh or
+        # Restriction
+        ufl_domain, mesh = _analyse_mesh_argument(mesh)
+
+        # Create element
+        element = ufl.TensorElement(family, ufl_domain, degree, shape, symmetry)
+        if restriction is not None:
+            element = element[restriction]
+
+        # Initialize base class
+        FunctionSpaceBase.__init__(self, mesh, element, \
+                                   constrained_domain=constrained_domain)
diff --git a/site-packages/dolfin/functions/specialfunctions.py b/site-packages/dolfin/functions/specialfunctions.py
new file mode 100644
index 0000000..6ab549c
--- /dev/null
+++ b/site-packages/dolfin/functions/specialfunctions.py
@@ -0,0 +1,227 @@
+# -*- coding: utf-8 -*-
+"""This module defines some special functions
+(originally defined in SpecialFunctions.h)."""
+
+# Copyright (C) 2008-2014 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johan Hake 2008-2009
+# Modified by Garth N. Wells 2010
+# Modified by Martin S. Alnaes 2013-2014
+
+__all__ = ["MeshCoordinates", "FacetArea", "FacetNormal", "CellSize", "CellVolume",
+           'SpatialCoordinate', 'CellNormal', 'Circumradius', 'MinFacetEdgeLength', 'MaxFacetEdgeLength']
+
+# Import UFL and SWIG-generated extension module (DOLFIN C++)
+import ufl
+import dolfin.cpp as cpp
+
+# Local imports
+from dolfin.functions.expression import Expression
+
+def _mesh2domain(mesh):
+    "Deprecation mechanism for symbolic geometry."
+    if isinstance(mesh, ufl.Cell):
+        cpp.deprecation("Constructing geometry from a Cell", "1.4", "1.5",
+                    "Pass mesh instead, for example use FacetNormal(mesh) instead of FacetNormal(triangle) or triangle.n")
+    return ufl.as_domain(mesh)
+
+class MeshCoordinates(Expression, ufl.Coefficient, cpp.MeshCoordinates):
+    def __init__(self, mesh):
+        "Create function that evaluates to the mesh coordinates at each vertex."
+        cpp.MeshCoordinates.__init__(self, mesh)
+        self._ufl_element = ufl.VectorElement("Lagrange", mesh.ufl_domain(), 1)
+        ufl.Coefficient.__init__(self, self._ufl_element, count=self.id())
+
+MeshCoordinates.__doc__ = cpp.MeshCoordinates.__doc__
+
+class FacetArea(Expression, ufl.Coefficient, cpp.FacetArea):
+
+    def __init__(self, mesh):
+        """
+        Create function that evaluates to the facet area/length on each facet.
+
+        *Arguments*
+            mesh
+                a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+        *Example of usage*
+
+            .. code-block:: python
+
+                mesh = UnitSquare(4,4)
+                fa = FacetArea(mesh)
+
+        """
+        cpp.FacetArea.__init__(self, mesh)
+        self._ufl_element = ufl.FiniteElement("Discontinuous Lagrange", mesh.ufl_domain(), 0)
+        ufl.Coefficient.__init__(self, self._ufl_element, count=self.id())
+
+FacetArea.__doc__ = cpp.FacetArea.__doc__
+
+# Simple definition of FacetNormal via UFL
+def FacetNormal(mesh):
+    """
+    Return symbolic facet normal for given mesh.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            n = FacetNormal(mesh)
+
+    """
+    return ufl.FacetNormal(_mesh2domain(mesh))
+
+# Simple definition of CellSize via UFL
+def CellSize(mesh):
+    """
+    Return function cell size for given mesh.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            h = CellSize(mesh)
+
+    """
+    return 2.0*ufl.Circumradius(_mesh2domain(mesh))
+
+# Simple definition of CellVolume via UFL
+def CellVolume(mesh):
+    """
+    Return symbolic cell volume for given mesh.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            vol = CellVolume(mesh)
+
+    """
+    return ufl.CellVolume(_mesh2domain(mesh))
+
+# Simple definition of SpatialCoordinate via UFL
+def SpatialCoordinate(mesh):
+    """
+    Return symbolic physical coordinates for given mesh.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            vol = SpatialCoordinate(mesh)
+
+    """
+    return ufl.SpatialCoordinate(_mesh2domain(mesh))
+
+# Simple definition of CellNormal via UFL
+def CellNormal(mesh):
+    """
+    Return symbolic cell normal for given manifold mesh.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            vol = CellNormal(mesh)
+
+    """
+    return ufl.CellNormal(_mesh2domain(mesh))
+
+# Simple definition of Circumradius via UFL
+def Circumradius(mesh):
+    """
+    Return symbolic cell circumradius for given mesh.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            vol = Circumradius(mesh)
+
+    """
+    return ufl.Circumradius(_mesh2domain(mesh))
+
+# Simple definition of MinFacetEdgeLength via UFL
+def MinFacetEdgeLength(mesh):
+    """
+    Return symbolic minimum facet edge length of a cell for given mesh.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            vol = MinFacetEdgeLength(mesh)
+
+    """
+    return ufl.MinFacetEdgeLength(_mesh2domain(mesh))
+
+# Simple definition of MaxFacetEdgeLength via UFL
+def MaxFacetEdgeLength(mesh):
+    """
+    Return symbolic maximum facet edge length of a cell for given mesh.
+
+    *Arguments*
+        mesh
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    *Example of usage*
+
+        .. code-block:: python
+
+            mesh = UnitSquare(4,4)
+            vol = MaxFacetEdgeLength(mesh)
+
+    """
+    return ufl.MaxFacetEdgeLength(_mesh2domain(mesh))
diff --git a/site-packages/dolfin/functions/ufc_functionspace.py b/site-packages/dolfin/functions/ufc_functionspace.py
new file mode 100644
index 0000000..5f54bee
--- /dev/null
+++ b/site-packages/dolfin/functions/ufc_functionspace.py
@@ -0,0 +1,32 @@
+import dolfin.cpp as cpp
+
+__all__ = ["UFCFunctionSpace", "create_ufc_function_spaces"]
+
+class UFCFunctionSpace(cpp.FunctionSpace):
+    def __init__(self, mesh, ufc_finite_element, ufc_dofmap):
+        self._mesh = mesh
+        self._finite_element     = cpp.FiniteElement(ufc_finite_element)
+        self._dofmap             = cpp.DofMap(ufc_dofmap, mesh)
+        self._ufc_finite_element = ufc_finite_element
+        self._ufc_dofmap         = ufc_dofmap
+        cpp.FunctionSpace.__init__(self, mesh, finite_element, dofmap)
+
+def create_ufc_function_spaces(mesh, ufc_form, cache=None):
+    functionspaces = []
+    if cache is None:
+        cache = {}
+    for i in range(ufc_form.rank() + ufc_form.num_coefficients()):
+        fe = ufc_form.create_finite_element(i)
+        fesig = fe.signature()
+
+        V = cache.get(fesig)
+        if V is None:
+            dm = ufc_form.create_dofmap(i)
+
+            V = UFCFunctionSpace(mesh, fe, dm)
+            cache[fesig] = V
+
+        functionspaces.append(V)
+    return functionspaces, cache
+
+
diff --git a/site-packages/dolfin/importhandler/__init__.py b/site-packages/dolfin/importhandler/__init__.py
new file mode 100644
index 0000000..da965d3
--- /dev/null
+++ b/site-packages/dolfin/importhandler/__init__.py
@@ -0,0 +1,52 @@
+"""The importhandler module of dolfin"""
+
+# NOTE: The automatic documentation system in DOLFIN requires to _not_ define
+# NOTE: classes or functions within this file. Use separate modules for that
+# NOTE: purpose.
+
+# System imports
+import sys
+
+# Import NumPy so it will not be screwed by imports after RTLD_GLOBAL is set
+# Work around for lp:1085986
+import numpy
+
+# Work around lp:956939 and lp:961946
+import io
+
+# Store dl open flags to restore them after import
+stored_dlopen_flags = sys.getdlopenflags()
+
+# A try to get rid of problems with dynamic_cast of types defined in different
+# SWIG modules. The problem rises from the dynamic loader not making all types
+# available for all shared modules. The key is the RTLD_GLOBAL. RTLD_NOW is set
+# by default. This seems to be similar to the dynamicloadmpi problem above.
+# See: for references: http://gcc.gnu.org/faq.html#dso
+if "linux" in sys.platform:
+    # FIXME: What with other platforms?
+    try:
+        from ctypes import RTLD_NOW, RTLD_GLOBAL
+    except ImportError:
+        RTLD_NOW = 2
+        RTLD_GLOBAL = 256
+    sys.setdlopenflags(RTLD_NOW | RTLD_GLOBAL)
+
+# Check for runtime dependencies
+runtime_dependencies = ["ufl", "ffc", "ufc", "ply.lex"]
+
+for dep in runtime_dependencies:
+    try:
+        __import__(dep)
+    except ImportError, e:
+        import sys
+        message = ["DOLFIN runtime dependency is not met.",
+                   "Install the following python module: '%s' "  % dep,
+                   "and make sure its location is listed in PYTHONPATH."]
+        wrap = "-"*len(max(message, key=len))
+        print
+        print wrap
+        for s in message:
+            print s
+        print wrap
+        print
+        sys.exit(1)
diff --git a/site-packages/dolfin/mesh/__init__.py b/site-packages/dolfin/mesh/__init__.py
new file mode 100644
index 0000000..a53f7ba
--- /dev/null
+++ b/site-packages/dolfin/mesh/__init__.py
@@ -0,0 +1,14 @@
+"""The mesh module of dolfin"""
+import meshes
+import ale
+import refinement
+
+from meshes import *
+from ale import *
+from refinement import *
+
+# NOTE: The automatic documentation system in DOLFIN requires to _not_
+# NOTE: define classes or functions within this file. Use separate
+# NOTE: modules for that purpose.
+
+__all__ = meshes.__all__ + ale.__all__ + refinement.__all__
diff --git a/site-packages/dolfin/mesh/ale.py b/site-packages/dolfin/mesh/ale.py
new file mode 100644
index 0000000..6f61fcb
--- /dev/null
+++ b/site-packages/dolfin/mesh/ale.py
@@ -0,0 +1,185 @@
+# Copyright (C) 2009-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-02-12
+# Last changed: 2012-09-28
+
+__all__ = ["compute_vertex_map", "compute_edge_map", "init_parent_edge_indices"]
+
+from dolfin.cpp import Mesh, Vertex, error, edges, info
+from dolfin import cpp
+
+def compute_vertex_map(mesh0, mesh1):
+    """
+    Compute map from vertices of mesh0 to vertices of mesh1.
+
+    *Arguments*
+        mesh0
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+        mesh1
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    It is assumed that both meshes have a :py:class:`MeshFunction
+    <dolfin.cpp.MeshFunction>` over the vertices named
+    "parent_vertex_indices" which contain a mapping from the
+    local vertices to a common parent vertex numbering.
+
+    """
+
+    # Check arguments
+    if not isinstance(mesh0, Mesh):
+        raise TypeError, "expected 'Mesh' as argument"
+    if not isinstance(mesh1, Mesh):
+        raise TypeError, "expected 'Mesh' as argument"
+
+    # Get parent vertex numbers
+    vertices0 = mesh0.data().array("parent_vertex_indices", 0)
+    vertices1 = mesh1.data().array("parent_vertex_indices", 0)
+
+    # Check mappings
+    if vertices0 is None or vertices1 is None:
+        cpp.dolfin_error("ale.py",
+                         "compute vertex map",
+                         "Parent vertex indices are missing")
+
+    # Compute parent-to-local mapping for mesh1
+    parent_to_local_mesh1 = {}
+    for i in range(len(vertices1)):
+        parent_to_local_mesh1[vertices1[i]] = i
+
+    # Compute local-to-local mapping
+    vertex_map = {}
+    for i in range(vertices0.size):
+        parent_vertex = vertices0[i]
+        if parent_vertex in parent_to_local_mesh1:
+            vertex_map[i] = parent_to_local_mesh1[parent_vertex]
+
+    return vertex_map
+
+def compute_edge_map(mesh0, mesh1):
+    """
+    Compute map from edges of mesh0 to vertices of mesh1.
+
+    *Arguments*
+        mesh0
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+        mesh1
+            a :py:class:`Mesh <dolfin.cpp.Mesh>`.
+
+    It is assumed that both meshes have a :py:class:`MeshFunction
+    <dolfin.cpp.MeshFunction>` over the vertices named
+    "parent_vertex_indices" which contain a mapping from the
+    local vertices to a common parent vertex numbering.
+
+    """
+
+    # Check arguments
+    if not isinstance(mesh0, Mesh):
+        raise TypeError, "expected 'Mesh' as argument"
+    if not isinstance(mesh1, Mesh):
+        raise TypeError, "expected 'Mesh' as argument"
+
+    # Get parent vertex numbers
+    vertices0 = mesh0.data().array("parent_vertex_indices", 0)
+    vertices1 = mesh1.data().array("parent_vertex_indices", 0)
+
+    # Check mappings
+    if len(vertices0) == 0  or len(vertices1) == 0:
+        cpp.dolfin_error("ale.py",
+                         "compute edge map",
+                         "Parent vertex indices are missing")
+
+    # Initialize edges
+    mesh0.init(1)
+    mesh1.init(1)
+
+    # Build parent to local map from vertex pair to local edge for mesh0
+    parent_to_local_mesh0 = {}
+    for edge in edges(mesh0):
+        v = [vertices0[int(i)] for i in edge.entities(0)]
+        v.sort()
+        parent_to_local_mesh0[tuple(v)] = edge.index()
+
+    # Build parent to local map from vertex pair to local edge for mesh1
+    parent_to_local_mesh1 = {}
+    for edge in edges(mesh1):
+        v = [vertices1[int(i)] for i in edge.entities(0)]
+        v.sort()
+        parent_to_local_mesh1[tuple(v)] = edge.index()
+
+    # Get common edges
+    common_edges = set(parent_to_local_mesh0.iterkeys()).intersection(set(parent_to_local_mesh1.iterkeys()))
+
+    # Compute map
+    edge_map = {}
+    for edge in common_edges:
+        edge_map[parent_to_local_mesh0[edge]] = parent_to_local_mesh1[edge]
+
+    return edge_map
+
+def init_parent_edge_indices(submesh, mesh):
+    "Initialize data 'parent_edge_indices' for submesh."
+
+    # Check arguments
+    if not isinstance(submesh, Mesh):
+        raise TypeError, "expected 'Mesh' as argument"
+    if not isinstance(mesh, Mesh):
+        raise TypeError, "expected 'Mesh' as argument"
+
+    # Check if edge map has already been computed
+    if not submesh.data().exists("parent_edge_indices", 1):
+        info("Edge map 'parent_edge_indices' already computed, not computing again.")
+
+    # Get parent vertex numbers
+    parent_vertex_indices = submesh.data().array("parent_vertex_indices", 0)
+    if parent_vertex_indices is None:
+        cpp.dolfin_error("ale.py",
+                         "initialize parent edge indices",
+                         "Parent vertex indice are missing")
+
+    # Make sure that we have edges for both meshes
+    submesh.init(1)
+    mesh.init(1)
+
+    # Make sure we have vertex-edge connectivity for parent mesh
+    mesh.init(0, 1)
+
+    # Create the edge map
+    parent_edge_indices = submesh.data().create_array("parent_edge_indices", 1)
+
+    # Iterate over the edges and figure out their parent number
+    for local_edge in edges(submesh):
+
+        # Get parent indices for edge vertices
+        v0, v1 = local_edge.entities(0)
+        V0 = Vertex(mesh, parent_vertex_indices[int(v0)])
+        V1 = Vertex(mesh, parent_vertex_indices[int(v1)])
+
+        # Get outgoing edges from the two parent vertices
+        edges0 = set(V0.entities(1))
+        edges1 = set(V1.entities(1))
+
+        # Check intersection
+        common_edges = edges0.intersection(edges1)
+        if not len(common_edges) == 1:
+            cpp.dolfin_error("ale.py",
+                             "initialize parent edge indices",
+                             "Parent vertices do not share exactly one common edge")
+        parent_edge_index = list(common_edges)[0]
+
+        # Set value
+        parent_edge_indices[local_edge.index()] = parent_edge_index
diff --git a/site-packages/dolfin/mesh/boundarysubdomainfinder.py b/site-packages/dolfin/mesh/boundarysubdomainfinder.py
new file mode 100644
index 0000000..b64f3e7
--- /dev/null
+++ b/site-packages/dolfin/mesh/boundarysubdomainfinder.py
@@ -0,0 +1,223 @@
+# Copyright (C) 2008 Kent-Andre Mardal
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+import sys
+import getopt
+from dolfin import *
+import numpy
+import operator
+
+def create_maps(boundary_mesh):
+    """
+    Create mappings between vertices and cells on the boundary mesh
+    """
+
+    c2v = {}
+    v2c = {}
+    for cell in cells(boundary_mesh):
+        for vertex in vertices(cell):
+            v = vertex.index()
+            c = cell.index()
+            if c2v.has_key(c):
+                c2v[c].append(v)
+            else:
+                c2v[c] = [v]
+            if v2c.has_key(v):
+                v2c[v].append(c)
+            else:
+                v2c[v] = [c]
+    return v2c, c2v
+
+
+def find_subdomain(start_vertex, v2c, c2v):
+    """
+    Find all cells connected with the start_vertex
+    """
+    next  = c2v[v2c[start_vertex][0]][1]
+
+    done = False
+    previous_vertex = start_vertex
+    previous_cell   = v2c[start_vertex][0]
+    subdomain = {}
+    while not done:
+        c0, c1 = v2c[previous_vertex]
+        if c0 == previous_cell:
+            next_cell = c1
+        elif c1 == previous_cell:
+            next_cell = c0
+        else:
+            print "None of the vertices were the previous vertex ??"
+        v0, v1 = c2v[next_cell]
+        if v0 == previous_vertex:
+            next_vertex = v1
+        elif v1 == previous_vertex:
+            next_vertex = v0
+        else:
+            print "None of the vertices were the previous vertex ??"
+        if subdomain.has_key(next_cell):
+            done = True
+        else:
+            subdomain[next_cell] = True
+            previous_vertex = next_vertex
+            previous_cell   = next_cell
+    return subdomain
+
+def find_new_cell_key(c2v, keys):
+    """
+    Find new cell.
+    """
+    done = False
+    iter = c2v.keys().__iter__()
+    while not done:
+        key = iter.next()
+        if key in keys:
+            pass
+        else:
+            done = True
+    return key
+
+
+def write_file(outfilename, mesh, subdomains):
+    str = """<?xml version="1.0" encoding="UTF-8"?>
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <meshfunction type="uint" dim="1" size="%d">
+    """ % mesh.numFacets()
+
+    for key in subdomains.keys():
+        str += "\n     <entity index=\"%d\" value=\"%d\"/>" % (key, subdomains[key])
+    str +=  """
+  </meshfunction>
+</dolfin>
+    """
+
+    f = open(outfilename, 'w')
+    f.write(str)
+    f.close()
+
+
+def find_keys_on_one_subdomain(c2v, v2c, all_keys):
+    try:
+        flat_keys = []
+        if len(all_keys) > 0:
+            flat_keys = reduce(operator.add, all_keys)
+
+        new_cell_key = find_new_cell_key(c2v, flat_keys)
+        vertex_key = c2v[new_cell_key][0]
+        subdomain = find_subdomain(vertex_key, v2c, c2v)
+        new_keys = subdomain.keys();
+        new_keys.sort()
+        all_keys.append(new_keys)
+        return all_keys
+    except Exception, e:
+#        print "done with finding the subdomains"
+        pass
+
+
+
+
+def find_all_subdomains(ifilename, ofilename):
+
+    mesh = Mesh(ifilename)
+
+    if mesh.geometry().dim() != 2:
+        print "This script does only work in 2D."
+        print "(It should be possible to extend to 3D, though)"
+        exit(2)
+
+    boundary_mesh = BoundaryMesh(mesh)
+
+    boundary_cell_map = boundary_mesh.data().meshFunction("cell map")
+    v2c, c2v = create_maps(boundary_mesh)
+
+    done = False
+    keys = []
+    subdomains = {}
+    all_keys = []
+    prev_keys = []
+    while not done:
+        new_keys = find_keys_on_one_subdomain(c2v, v2c, prev_keys)
+        if new_keys == None:
+            done = True
+            all_keys = prev_keys
+        else:
+            prev_keys = new_keys
+
+    for i in range(0, mesh.numFacets()):
+        subdomains[i] = len(all_keys)
+
+    counter = 0
+    for keys in all_keys:
+        for key in keys:
+            subdomains[boundary_cell_map.array()[key]] =  counter
+        counter+=1
+
+    write_file(ofilename, mesh, subdomains)
+
+
+def usage():
+    "Display usage"
+    print """\
+Usage: dolfin-convert [OPTIONS] ... input.x output.y
+
+Options:
+
+  -h         display this help text and exit
+  -i specify input file
+  -o specify output file
+
+Alternatively, the following long options may be used:
+
+  --help     same as -h
+  --input    same as -i
+  --output   same as -o
+
+"""
+
+
+
+def main(argv):
+    "Main function"
+         # Get command-line arguments
+    try:
+        opts, args = getopt.getopt(argv, "hi:o:", ["help", "input=", "output="])
+    except getopt.GetoptError:
+        usage()
+        sys.exit(2)
+
+
+    ifilename = None
+    ofilename = None
+    for opt, arg in opts:
+        if opt in ("-i", "--infile"):
+            ifilename = arg
+        elif opt in ("-o", "--outfile"):
+            ofilename = arg
+        else:
+            print "Option not recoginized"
+
+    find_all_subdomains(ifilename, ofilename)
+
+
+
+
+
+if __name__ == '__main__':
+    main(sys.argv[1:])
+
+
+
+
diff --git a/site-packages/dolfin/mesh/meshes.py b/site-packages/dolfin/mesh/meshes.py
new file mode 100644
index 0000000..4450b44
--- /dev/null
+++ b/site-packages/dolfin/mesh/meshes.py
@@ -0,0 +1,74 @@
+"This module provides a simple Python wrapper for the SWIG-generated Mesh class"
+
+# Copyright (C) 2012-2014 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes (meg@simula.no)
+# Modified by Martin S. Alnaes (martinal@simula.no) 2014
+
+__all__ = []
+
+# Import SWIG-generated extension module (DOLFIN C++)
+import dolfin.cpp as cpp
+
+# Replacement constructor for Mesh class. We cannot create a Python
+# subclass of cpp.Mesh since then isinstance(UnitSquare, Mesh) would
+# not be true.
+
+def __init__(self, *args, **kwargs):
+    """Create a mesh from a filename or a geometry.
+
+    A mesh may be created from a given filename, which should contain
+    mesh data stored in DOLFIN XML format:
+
+    .. code-block:: python
+
+        mesh = Mesh("mesh.xml")
+
+    An empty mesh may be created as follows:
+
+    .. code-block:: python
+
+        mesh = Mesh()
+
+    A copy of a mesh may be created as follows:
+
+    .. code-block:: python
+
+        mesh_copy = Mesh(mesh)
+
+    A mesh may also be created from a CSG geometry and a resolution:
+
+    .. code-block:: python
+
+        mesh = Mesh(geometry, resolution)
+
+    """
+
+    # Reuse C++ doc-string too
+    __doc__ = cpp.Mesh.__doc__
+
+    # Initialize base class
+    cpp.Mesh.__cppinit__(self, *args, **kwargs)
+
+# Change mesh constructor
+cpp.Mesh.__cppinit__ = cpp.Mesh.__init__
+cpp.Mesh.__init__ = __init__
+
+# Attach ipython notebook svg rendering function for 1D and 2D meshes
+from dolfin.mesh.svgtools import mesh2svg
+cpp.Mesh._repr_svg_ = mesh2svg
diff --git a/site-packages/dolfin/mesh/refinement.py b/site-packages/dolfin/mesh/refinement.py
new file mode 100644
index 0000000..79cef2e
--- /dev/null
+++ b/site-packages/dolfin/mesh/refinement.py
@@ -0,0 +1,80 @@
+"This module provides uniform and local mesh refinement."
+
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2010-02-26
+# Last changed: 2010-02-26
+
+__all__ = ["refine"]
+
+# Import C++ interface
+import dolfin.cpp as cpp
+
+def refine(mesh, cell_markers=None, redistribute=True):
+    """
+    Refine given mesh and return the refined mesh.
+
+    *Arguments*
+        mesh
+            the :py:class:`Mesh <dolfin.cpp.Mesh>` to be refined.
+        cell_markers
+            an optional argument (a boolean :py:class:`MeshFunction
+            <dolfin.cpp.MeshFunctionBool>` over cells) may be given
+            to specify which cells should be refined. If no cell
+            markers are given, then the mesh is refined uniformly.
+        redistribute
+            an optional argument (boolean) may be given to set whether
+            to redistribute the mesh across processes following
+            refinement. The is relevant only when the mesh is
+            distributed across processes. In serial the argument has
+            no impact. Default it True.
+
+    *Examples of usage*
+
+        .. code-block:: python
+
+            mesh = refine(mesh)
+
+        To only refine cells with too large error, define a boolean
+        MeshFunction over the mesh and mark the cells to be refined
+        as True.
+
+        .. code-block:: python
+
+            cell_markers = CellFunction("bool", mesh)
+            cell_markers.set_all(False)
+            for cell in cells(mesh):
+                # set cell_markers[cell] = True if the cell's error
+                # indicator is greater than some criterion.
+            mesh = refine(mesh, cell_markers)
+
+    """
+
+    # This function is necessary to avoid copying in the wrapped
+    # versions of the return-by-value refine functions in C++.
+
+    # Create empty mesh
+    refined_mesh = cpp.Mesh()
+
+    # Call C++ refinement
+    if cell_markers is None:
+        cpp.refine(refined_mesh, mesh, redistribute)
+    else:
+        cpp.refine(refined_mesh, mesh, cell_markers, redistribute)
+
+    return refined_mesh
diff --git a/site-packages/dolfin/mesh/svgtools.py b/site-packages/dolfin/mesh/svgtools.py
new file mode 100644
index 0000000..b145ad9
--- /dev/null
+++ b/site-packages/dolfin/mesh/svgtools.py
@@ -0,0 +1,104 @@
+"This module provides a simple SVG renderer of 2D and 1D meshes for use in ipython notebook."
+
+# Copyright (C) 2013-2014 Martin S. Alnaes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+def mesh2svg(mesh, display_width=800.0):
+    "Ipython notebook svg rendering function for 1D and 2D meshes."
+    c = mesh.cells()
+    num_cells = c.shape[0]
+    nv = c.shape[1]
+
+    # TODO: Can we detect display_width from current ipython environment?
+    # TODO: Extract boundary mesh only if num_cells is too large?
+    # TODO: I think this should just work with a quadrilateral mesh but it's not tested
+    # TODO: I think this should just work with 1D mesh embedded in 2D but it's not tested
+
+    x = mesh.coordinates()
+    num_vertices = x.shape[0]
+    d = x.shape[1]
+
+    cellname = mesh.ufl_cell().cellname()
+    assert d == 1 or d == 2
+    assert cellname in ("interval", "triangle", "quadrilateral")
+
+    # Compute mesh size
+    strokewidth = 2
+    mesh_origin = [x[:,k].min() for k in range(d)]
+    x_min = [x[:,k].min() for k in range(d)]
+    x_max = [x[:,k].max() for k in range(d)]
+    if d == 1:
+        mesh_width  = x_max[0]-x_min[0]
+        mesh_height = 0
+    elif d == 2:
+        mesh_width  = x_max[0]-x_min[0]
+        mesh_height = x_max[1]-x_min[1]
+
+    # Compute display scaling
+    scale = float(display_width / mesh_width)
+    display_height = max(mesh_height * display_width / mesh_width, strokewidth)
+
+    # Add padding to include vertex circles
+    display_padding = 10*strokewidth
+    display_width = 2*display_padding + display_width
+    display_height = 2*display_padding + display_height
+
+    # Build list of screen coordinate vertices
+    vertices = []
+    if d == 1:
+        vertices = [(display_padding + int(scale*(x[i,0] - x_min[0])), display_padding)
+                    for i in range(num_vertices)]
+    elif d == 2:
+        # Mirror y-axis because of svg coordinate system
+        vertices = [(display_padding + int(scale*(x[i,0] - x_min[0])),
+                     display_padding + int(scale*(x_max[1] - x[i,1])))
+                    for i in range(num_vertices)]
+
+    # Build list of edges
+    if cellname == "interval":
+        # Build list of unique edges in 1D case
+        edges = [(c[i,0], c[i,1]) for i in xrange(num_cells)]
+    elif cellname == "triangle": # Should in principle work for quadrilateral as well
+        # Build list of unique edges in 2D case
+        edges = set()
+        for i in xrange(num_cells):
+            for j in xrange(nv):
+                e = (c[i,j], c[i,(j+1)%nv])
+                edges.add(tuple(sorted(e)))
+        edges = sorted(edges)
+    else:
+        edges = []
+    # Build lines for all edges
+    lines = [(vertices[e0], vertices[e1]) for e0,e1 in edges]
+
+    # Render svg code
+    radius = strokewidth
+
+    svg_line = '<line x1="%%s" y1="%%s" x2="%%s" y2="%%s" style="fill:none; stroke:black; stroke-width:"%s" />' % (strokewidth,)
+    svg_lines = "\n".join(svg_line % (line[0] + line[1]) for line in lines)
+
+    svg_vertex = '<circle cx="%%d" cy="%%d" r="%d" stroke="black" stroke-width="0" fill="red" />' % (radius,)
+    svg_vertices = "\n".join(svg_vertex % p for p in vertices)
+
+    svg = '''
+    <svg xmlns="http://www.w3.org/2000/svg" version="1.1" width="%d" height="%d">
+    %s
+    %s
+    </svg>
+    '''
+    code = svg % (display_width, display_height, svg_lines, svg_vertices)
+    return code
diff --git a/site-packages/dolfin/multistage/__init__.py b/site-packages/dolfin/multistage/__init__.py
new file mode 100644
index 0000000..75ce1db
--- /dev/null
+++ b/site-packages/dolfin/multistage/__init__.py
@@ -0,0 +1,12 @@
+"""The multistage module of dolfin"""
+from dolfin.multistage import multistagescheme
+from dolfin.multistage import multistagesolvers
+
+from multistagescheme import *
+from multistagesolvers import *
+
+# NOTE: The automatic documentation system in DOLFIN requires to _not_ define
+# NOTE: classes or functions within this file. Use separate modules for that
+# NOTE: purpose.
+
+__all__ = multistagescheme.__all__ + multistagesolvers.__all__
diff --git a/site-packages/dolfin/multistage/multistagescheme.py b/site-packages/dolfin/multistage/multistagescheme.py
new file mode 100644
index 0000000..9441a8b
--- /dev/null
+++ b/site-packages/dolfin/multistage/multistagescheme.py
@@ -0,0 +1,750 @@
+"""This module defines different MultiStageScheme classes which can be
+passed to a RKSolver"""
+
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Patrick Farrell, 2013
+#
+# First added:  2013-02-22
+# Last changed: 2013-06-18
+
+import numpy as np
+import functools
+
+# Import SWIG-generated extension module (DOLFIN C++)
+import dolfin.cpp as cpp
+
+# Import ufl
+import ufl
+
+# Import classes from dolfin python layer
+from dolfin.functions.constant import Constant
+from dolfin.functions.expression import Expression
+from dolfin.functions.function import Function
+from dolfin.fem.formmanipulations import derivative, adjoint
+from ufl import action as ufl_action
+from dolfin.fem.form import Form
+import ufl.algorithms
+
+# FIXME: Add support for algebraic parts (at least for implicit)
+# FIXME: Add support for implicit/explicit split ala IMEX schemes
+
+def safe_adjoint(x):
+    return adjoint(x, reordered_arguments=ufl.algorithms.extract_arguments(x))
+
+def safe_action(x, y):
+    x = ufl.algorithms.expand_derivatives(x)
+    if x.integrals() == ():
+        return x # form is empty, return anyway
+    else:
+        return ufl_action(x, y)
+
+def _check_abc(a, b, c):
+    if not (isinstance(a, np.ndarray) and (len(a) == 1 or \
+            (len(a.shape)==2 and a.shape[0] == a.shape[1]))):
+        raise TypeError("Expected an m x m numpy array as the first argument")
+    if not (isinstance(b, np.ndarray) and len(b.shape) in [1,2]):
+        raise TypeError("Expected a 1 or 2 dimensional numpy array as the second argument")
+    if not (isinstance(c, np.ndarray) and len(c.shape) == 1):
+        raise TypeError("Expected a 1 dimensional numpy array as the third argument")
+
+    # Make sure a is a "matrix"
+    if len(a) == 1:
+        a.shape = (1, 1)
+
+    # Get size of system
+    size = a.shape[0]
+
+    # If b is a matrix we expect it to have two rows
+    if len(b.shape) == 2:
+        if not (b.shape[0] == 2 and b.shape[1] == size):
+            raise ValueError("Expected a 2 row matrix with the same number "\
+                             "of collumns as the first dimension of the a matrix.")
+    elif len(b) != size:
+        raise ValueError("Expected the length of the b vector to have the "\
+                         "same size as the first dimension of the a matrix.")
+
+    if len(c) != size:
+        raise ValueError("Expected the length of the c vector to have the "\
+                         "same size as the first dimension of the a matrix.")
+
+    # Check if the method is singly diagonally implicit
+    sigma = -1
+    for i in range(size):
+        # If implicit
+        if a[i,i] != 0:
+            if sigma == -1:
+                sigma = a[i,i]
+            elif sigma != a[i,i]:
+                raise ValueError("Expected only singly diagonally implicit "
+                                 "schemes. (Same value on the diagonal of 'a'.)")
+            
+    # Check if tableau is fully implicit
+    for i in range(size):
+        for j in range(i):
+            if a[j, i] != 0:
+                raise ValueError("Does not support fully implicit Butcher tableau.")
+
+    return a
+
+def _check_form(rhs_form):
+    if not isinstance(rhs_form, ufl.Form):
+        raise TypeError("Expected a ufl.Form as the 5th argument.")
+
+    # Check if form contains a cell or point integral
+    if rhs_form.integrals_by_type("cell"):
+        DX = ufl.dx
+    elif rhs_form.integrals_by_type("point"):
+        DX = ufl.dP
+    else:
+        raise ValueError("Expected either a cell or point integral in the form.")
+
+    arguments = ufl.algorithms.extract_arguments(rhs_form)
+    if len(arguments) != 1:
+        raise ValueError("Expected the form to have rank 1")
+
+    return DX
+
+def _time_dependent_expressions(rhs_form, time):
+    """
+    Return a list of expressions which uses the present time as a parameter
+    """
+    # FIXME: Add extraction of time dependant expressions from bcs too
+    time_dependent_expressions = dict()
+  
+    for coefficient in ufl.algorithms.extract_coefficients(rhs_form):
+        if hasattr(coefficient, "user_parameters"):
+            for c_name, c in coefficient.user_parameters.items():
+                if isinstance(c, cpp.GenericFunction) and time.id() == c.id():
+                    if coefficient not in time_dependent_expressions:
+                        time_dependent_expressions[coefficient] = [c_name]
+                    else:
+                        time_dependent_expressions[coefficient].append(c_name)
+
+    return time_dependent_expressions
+          
+def _replace_dict_time_dependent_expression(time_dep_expressions, time, dt, c):
+    assert(isinstance(c, float))
+    replace_dict = {}
+    if c == 0.0 or not time_dep_expressions:
+        return replace_dict
+    new_time = Expression("time+c*dt", time=time, c=c, dt=dt)
+    for expr, c_names in time_dep_expressions.items():
+        assert(isinstance(expr, Expression))
+        kwargs = dict(name=expr.name(), label=expr.label(), \
+                      element=expr.ufl_element(), **expr.user_parameters)
+        for c_name in c_names:
+            kwargs[c_name] = new_time
+        replace_dict[expr] = Expression(expr.cppcode, **kwargs)
+        
+    return replace_dict
+    
+def _butcher_scheme_generator(a, b, c, time, solution, rhs_form):
+    """
+    Generates a list of forms and solutions for a given Butcher tableau 
+
+    *Arguments*
+        a (2 dimensional numpy array)
+            The a matrix of the Butcher tableau.
+        b (1-2 dimensional numpy array)
+            The b vector of the Butcher tableau. If b is 2 dimensional the
+            scheme includes an error estimator and can be used in adaptive
+            solvers.
+        c (1 dimensional numpy array)
+            The c vector the Butcher tableau.
+        time (_Constant_)
+            A Constant holding the time at the start of the time step
+        solution (_Function_)
+            The prognostic variable
+        rhs_form (ufl.Form)
+            A UFL form representing the rhs for a time differentiated equation 
+    """
+
+    a = _check_abc(a, b, c)
+    size = a.shape[0]
+
+    DX = _check_form(rhs_form)
+
+    # Get test function
+    arguments, coefficients = ufl.algorithms.\
+                              extract_arguments_and_coefficients(rhs_form)
+    v = arguments[0]
+
+    # Create time step
+    dt = Constant(0.1)
+
+    # rhs forms
+    dolfin_stage_forms = []
+    ufl_stage_forms = []
+
+    # Stage solutions
+    k = [Function(solution.function_space(), name="k_%d"%i) for i in range(size)]
+
+    jacobian_indices = []
+
+    # Create the stage forms
+    y_ = solution
+    time_ = time
+    time_dep_expressions = _time_dependent_expressions(rhs_form, time)
+    zero_ = ufl.zero(*y_.shape())
+    for i, ki in enumerate(k):
+
+        # Check whether the stage is explicit
+        explicit = a[i,i] == 0
+
+        # Evaluation arguments for the ith stage
+        evalargs = y_ + dt * sum([float(a[i,j]) * k[j] \
+                                  for j in range(i+1)], zero_)
+        time = time_ + dt*c[i]
+
+        replace_dict = _replace_dict_time_dependent_expression(time_dep_expressions, \
+                                                               time_, dt, c[i])
+
+        replace_dict[y_] = evalargs
+        replace_dict[time_] = time
+        stage_form = ufl.replace(rhs_form, replace_dict)
+
+        if explicit:
+            stage_forms = [stage_form]
+            jacobian_indices.append(-1)
+        else:
+            # Create a F=0 form and differentiate it
+            stage_form -= ufl.inner(ki, v)*DX
+            stage_forms = [stage_form, derivative(stage_form, ki)]
+            jacobian_indices.append(0)
+        ufl_stage_forms.append(stage_forms)
+
+        dolfin_stage_forms.append([Form(form) for form in stage_forms])
+
+    # Only one last stage
+    if len(b.shape) == 1:
+        last_stage = Form(ufl.inner(y_+sum([dt*float(bi)*ki for bi, ki in \
+                                            zip(b, k)], zero_), v)*DX)
+    else:
+        # FIXME: Add support for addaptivity in RKSolver and MultiStageScheme
+        
+        last_stage = [Form(ufl.inner(y_+sum([dt*float(bi)*ki for bi, ki in \
+                                             zip(b[0,:], k)], zero_), v)*DX),
+                      Form(ufl.inner(y_+sum([dt*float(bi)*ki for bi, ki in \
+                                             zip(b[1,:], k)], zero_), v)*DX)]
+    
+    # Create the Function holding the solution at end of time step
+    #k.append(solution.copy())
+
+    # Generate human form of MultiStageScheme
+    human_form = []
+    for i in range(size):
+        kterm = " + ".join("%sh*k_%s" % ("" if a[i,j] == 1.0 else \
+                                         "%s*"% a[i,j], j) \
+                           for j in range(size) if a[i,j] != 0)
+        if c[i] in [0.0, 1.0]:
+            cih = " + h" if c[i] == 1.0 else ""
+        else:
+            cih = " + %s*h" % c[i]
+
+        if len(kterm) == 0:
+            human_form.append("k_%(i)s = f(t_n%(cih)s, y_n)" % {"i": i, "cih": cih})
+        else:
+            human_form.append("k_%(i)s = f(t_n%(cih)s, y_n + %(kterm)s)" % \
+                          {"i": i, "cih": cih, "kterm": kterm})
+
+    parentheses = "(%s)" if np.sum(b>0) > 1 else "%s"
+    human_form.append("y_{n+1} = y_n + h*" + parentheses % (" + ".join(\
+        "%sk_%s" % ("" if b[i] == 1.0 else "%s*" % b[i], i) \
+        for i in range(size) if b[i] > 0)))
+
+    human_form = "\n".join(human_form)
+
+    return ufl_stage_forms, dolfin_stage_forms, jacobian_indices, last_stage, \
+           k, dt, human_form, None
+
+def _butcher_scheme_generator_tlm(a, b, c, time, solution, rhs_form, perturbation):
+    """
+    Generates a list of forms and solutions for a given Butcher tableau 
+
+    *Arguments*
+        a (2 dimensional numpy array)
+            The a matrix of the Butcher tableau.
+        b (1-2 dimensional numpy array)
+            The b vector of the Butcher tableau. If b is 2 dimensional the
+            scheme includes an error estimator and can be used in adaptive
+            solvers.
+        c (1 dimensional numpy array)
+            The c vector the Butcher tableau.
+        time (_Constant_)
+            A Constant holding the time at the start of the time step
+        solution (_Function_)
+            The prognostic variable
+        rhs_form (ufl.Form)
+            A UFL form representing the rhs for a time differentiated equation 
+        perturbation (_Function_)
+            The perturbation in the initial condition of the solution
+    """
+
+    a = _check_abc(a, b, c)
+    size = a.shape[0]
+
+    DX = _check_form(rhs_form)
+
+    # Get test function
+    arguments, coefficients = ufl.algorithms.\
+                              extract_arguments_and_coefficients(rhs_form)
+    v = arguments[0]
+
+    # Create time step
+    dt = Constant(0.1)
+
+    # rhs forms
+    dolfin_stage_forms = []
+    ufl_stage_forms = []
+    
+    # Stage solutions
+    k = [Function(solution.function_space(), name="k_%d"%i) for i in range(size)]
+    kdot = [Function(solution.function_space(), name="kdot_%d"%i) \
+            for i in range(size)]
+
+    # Create the stage forms
+    y_ = solution
+    ydot = solution.copy()
+    time_ = time
+    time_dep_expressions = _time_dependent_expressions(rhs_form, time)
+    zero_ = ufl.zero(*y_.shape())
+    forward_forms = []
+    stage_solutions = []
+    jacobian_indices = []
+
+    for i, ki in enumerate(k):
+
+        # Check whether the stage is explicit
+        explicit = a[i,i] == 0
+
+        # Evaluation arguments for the ith stage
+        evalargs = y_ + dt * sum([float(a[i,j]) * k[j] \
+                                  for j in range(i+1)], zero_)
+        time = time_ + dt*c[i]
+        
+        replace_dict = _replace_dict_time_dependent_expression(time_dep_expressions, \
+                                                               time_, dt, c[i])
+
+        replace_dict[y_] = evalargs
+        replace_dict[time_] = time
+        stage_form = ufl.replace(rhs_form, replace_dict)
+
+        forward_forms.append(stage_form)
+
+        # The recomputation of the forward run:
+
+        if explicit:
+            stage_forms = [stage_form]
+            jacobian_indices.append(-1)
+        else:
+            # Create a F=0 form and differentiate it
+            stage_form_implicit = stage_form - ufl.inner(ki, v)*DX
+            stage_forms = [stage_form_implicit, derivative(stage_form_implicit, ki)]
+            jacobian_indices.append(0)
+
+        ufl_stage_forms.append(stage_forms)
+        dolfin_stage_forms.append([Form(form) for form in stage_forms])
+        stage_solutions.append(ki)
+
+        # And now the tangent linearisation:
+        stage_form_tlm = safe_action(derivative(stage_form, y_), perturbation) + \
+                         sum([dt*float(a[i,j]) * safe_action(derivative(\
+            forward_forms[j], y_), kdot[j]) for j in range(i+1)])
+        if explicit:
+            stage_forms_tlm = [stage_form_tlm]
+            jacobian_indices.append(-1)
+        else:
+            # Create a F=0 form and differentiate it
+            stage_form_tlm -= ufl.inner(kdot[i], v)*DX
+            stage_forms_tlm = [stage_form_tlm, derivative(stage_form_tlm, kdot[i])]
+            jacobian_indices.append(1)
+
+        ufl_stage_forms.append(stage_forms_tlm)
+        dolfin_stage_forms.append([Form(form) for form in stage_forms_tlm])
+        stage_solutions.append(kdot[i])
+        
+    # Only one last stage
+    if len(b.shape) == 1:
+        last_stage = Form(ufl.inner(perturbation + sum(\
+            [dt*float(bi)*kdoti for bi, kdoti in zip(b, kdot)], zero_), v)*DX)
+    else:
+        raise Exception("Not sure what to do here")
+    
+    human_form = []
+    for i in range(size):
+        kterm = " + ".join("%sh*k_%s" % ("" if a[i,j] == 1.0 else \
+                                         "%s*"% a[i,j], j) \
+                           for j in range(size) if a[i,j] != 0)
+        if c[i] in [0.0, 1.0]:
+            cih = " + h" if c[i] == 1.0 else ""
+        else:
+            cih = " + %s*h" % c[i]
+
+        kdotterm = " + ".join("%(a)sh*action(derivative(f(t_n%(cih)s, y_n + "\
+                              "%(kterm)s), kdot_%(i)s" % \
+                              {"a": ("" if a[i,j] == 1.0 else "%s*"% a[i,j], j),
+                               "i": i,
+                               "cih": cih,
+                               "kterm": kterm} \
+                              for j in range(size) if a[i,j] != 0)
+            
+        if len(kterm) == 0:
+            human_form.append("k_%(i)s = f(t_n%(cih)s, y_n)" % {"i": i, "cih": cih})
+            human_form.append("kdot_%(i)s = action(derivative("\
+                              "f(t_n%(cih)s, y_n), y_n), ydot_n)" % \
+                              {"i": i, "cih": cih})
+        else:
+            human_form.append("k_%(i)s = f(t_n%(cih)s, y_n + %(kterm)s)" % \
+                          {"i": i, "cih": cih, "kterm": kterm})
+            human_form.append("kdot_%(i)s = action(derivative(f(t_n%(cih)s, "\
+                              "y_n + %(kterm)s), y_n) + %(kdotterm)s" % \
+                          {"i": i, "cih": cih, "kterm": kterm, "kdotterm": kdotterm})
+
+    parentheses = "(%s)" if np.sum(b>0) > 1 else "%s"
+    human_form.append("ydot_{n+1} = ydot_n + h*" + parentheses % (" + ".join(\
+        "%skdot_%s" % ("" if b[i] == 1.0 else "%s*" % b[i], i) \
+        for i in range(size) if b[i] > 0)))
+
+    human_form = "\n".join(human_form)
+
+    return ufl_stage_forms, dolfin_stage_forms, jacobian_indices, last_stage, \
+           stage_solutions, dt, human_form, perturbation
+
+def _butcher_scheme_generator_adm(a, b, c, time, solution, rhs_form, adj):
+    """
+    Generates a list of forms and solutions for a given Butcher tableau 
+
+    *Arguments*
+        a (2 dimensional numpy array)
+            The a matrix of the Butcher tableau.
+        b (1-2 dimensional numpy array)
+            The b vector of the Butcher tableau. If b is 2 dimensional the
+            scheme includes an error estimator and can be used in adaptive
+            solvers.
+        c (1 dimensional numpy array)
+            The c vector the Butcher tableau.
+        time (_Constant_)
+            A Constant holding the time at the start of the time step
+        solution (_Function_)
+            The prognostic variable
+        rhs_form (ufl.Form)
+            A UFL form representing the rhs for a time differentiated equation 
+        adj (_Function_)
+            The derivative of the functional with respect to y_n+1
+    """
+
+    a = _check_abc(a, b, c)
+    size = a.shape[0]
+
+    DX = _check_form(rhs_form)
+
+    # Get test function
+    arguments, coefficients = ufl.algorithms.\
+                              extract_arguments_and_coefficients(rhs_form)
+    v = arguments[0]
+
+    # Create time step
+    dt = Constant(0.1)
+
+    # rhs forms
+    dolfin_stage_forms = []
+    ufl_stage_forms = []
+    
+    # Stage solutions
+    k = [Function(solution.function_space(), name="k_%d"%i) for i in range(size)]
+    kbar = [Function(solution.function_space(), name="kbar_%d"%i) \
+            for i in range(size)]
+
+    # Create the stage forms
+    y_ = solution
+    ydot = solution.copy()
+    time_ = time
+    time_dep_expressions = _time_dependent_expressions(rhs_form, time)
+    zero_ = ufl.zero(*y_.shape())
+    forward_forms = []
+    stage_solutions = []
+    jacobian_indices = []
+
+    # The recomputation of the forward run:
+    for i, ki in enumerate(k):
+
+        # Check whether the stage is explicit
+        explicit = a[i,i] == 0
+
+        # Evaluation arguments for the ith stage
+        evalargs = y_ + dt * sum([float(a[i,j]) * k[j] \
+                                  for j in range(i+1)], zero_)
+        time = time_ + dt*c[i]
+        
+        replace_dict = _replace_dict_time_dependent_expression(\
+            time_dep_expressions, time_, dt, c[i])
+
+        replace_dict[y_] = evalargs
+        replace_dict[time_] = time
+        stage_form = ufl.replace(rhs_form, replace_dict)
+
+        forward_forms.append(stage_form)
+
+        if explicit:
+            stage_forms = [stage_form]
+            jacobian_indices.append(-1)
+        else:
+            # Create a F=0 form and differentiate it
+            stage_form_implicit = stage_form - ufl.inner(ki, v)*DX
+            stage_forms = [stage_form_implicit, derivative(\
+                stage_form_implicit, ki)]
+            jacobian_indices.append(0)
+
+        ufl_stage_forms.append(stage_forms)
+        dolfin_stage_forms.append([Form(form) for form in stage_forms])
+        stage_solutions.append(ki)
+
+    for i, kbari in reversed(list(enumerate(kbar))):
+
+        # Check whether the stage is explicit
+        explicit = a[i,i] == 0
+
+        # And now the adjoint linearisation:
+        stage_form_adm = ufl.inner(dt * b[i] * adj, v)*DX  + sum(\
+            [dt * float(a[j,i]) * safe_action(safe_adjoint(derivative(\
+                forward_forms[j], y_)), kbar[j]) for j in range(i, size)])
+        if explicit:
+            stage_forms_adm = [stage_form_adm]
+            jacobian_indices.append(-1)
+        else:
+            # Create a F=0 form and differentiate it
+            stage_form_adm -= ufl.inner(kbar[i], v)*DX
+            stage_forms_adm = [stage_form_adm, derivative(stage_form_adm, kbari)]
+            jacobian_indices.append(1)
+
+        ufl_stage_forms.append(stage_forms_adm)
+        dolfin_stage_forms.append([Form(form) for form in stage_forms_adm])
+        stage_solutions.append(kbari)
+        
+    # Only one last stage
+    if len(b.shape) == 1:
+        last_stage = Form(ufl.inner(adj, v)*DX + sum(\
+            [safe_action(safe_adjoint(derivative(forward_forms[i], y_)), kbar[i]) \
+             for i in range(size)]))
+    else:
+        raise Exception("Not sure what to do here")
+    
+    human_form = "unimplemented"
+
+    return ufl_stage_forms, dolfin_stage_forms, jacobian_indices, last_stage,\
+           stage_solutions, dt, human_form, adj
+    
+class MultiStageScheme(cpp.MultiStageScheme):
+    """
+    Base class for all MultiStageSchemes
+    """
+    def __init__(self, rhs_form, solution, t, bcs, a, b, c, order, \
+                 generator=_butcher_scheme_generator):
+        bcs = bcs or []
+        t = t or Constant(0.0)
+        ufl_stage_forms, dolfin_stage_forms, jacobian_indices, last_stage, \
+                         k, dt, human_form, contraction = generator(\
+            a, b, c, t, solution, rhs_form)
+
+        # Store data
+        self._rhs_form = rhs_form
+        self._ufl_stage_forms = ufl_stage_forms
+        self._dolfin_stage_forms = dolfin_stage_forms
+        self._t = t
+        self._bcs = bcs
+        self._dt = dt
+        self._last_stage = last_stage
+        self._solution = solution
+        self._k = k
+        self.a = a
+        self.b = b
+        self.c = c
+        self._order = order
+        self.contraction = contraction
+        self.jacobian_indices = jacobian_indices
+
+        cpp.MultiStageScheme.__init__(self, dolfin_stage_forms, last_stage, k, \
+                                      solution, t, dt, c, jacobian_indices, order,\
+                                      self.__class__.__name__,
+                                      human_form, bcs)
+
+    def rhs_form(self):
+        "Return the original rhs form"
+        return self._rhs_form
+
+    def ufl_stage_forms(self):
+        "Return the ufl stage forms"
+        return self._ufl_stage_forms
+
+    def dolfin_stage_forms(self):
+        "Return the dolfin stage forms"
+        return self._dolfin_stage_forms
+
+    def t(self):
+        "Return the Constant used to describe time in the MultiStageScheme"
+        return self._t
+
+    def dt(self):
+        "Return the Constant used to describe time in the MultiStageScheme"
+        return self._dt
+
+    def solution(self):
+        "Return the solution Function"
+        return self._solution
+
+    def last_stage(self):
+        "Return the form describing the last stage"
+        return self._last_stage
+
+    def stage_solutions(self):
+        "Return the stage solutions"
+        return self._k
+
+    def to_tlm(self, perturbation):
+        r"""
+        Return another MultiStageScheme that implements the tangent
+        linearisation of the ODE solver.
+
+        This takes \dot{y_n} (the derivative of y_n with respect to a
+        parameter) and computes \dot{y_n+1} (the derivative of y_n+1
+        with respect to that parameter).
+        """
+
+        generator = functools.partial(_butcher_scheme_generator_tlm, \
+                                      perturbation=perturbation)
+        new_solution = self._solution.copy()
+        new_form = ufl.replace(self._rhs_form, {self._solution: new_solution})
+        return MultiStageScheme(new_form, new_solution, self._t, self._bcs, 
+                                self.a, self.b, self.c, self._order,
+                                generator=generator)
+        
+    def to_adm(self, adj):
+        r"""
+        Return another MultiStageScheme that implements the adjoint
+        linearisation of the ODE solver.
+
+        This takes \bar{y_n+1} (the derivative of a functional J with
+        respect to y_n+1) and computes \bar{y_n} (the derivative of J
+        with respect to y_n).
+        """
+
+        generator = functools.partial(_butcher_scheme_generator_adm, adj=adj)
+        new_solution = self._solution.copy()
+        new_form = ufl.replace(self._rhs_form, {self._solution: new_solution})
+        return MultiStageScheme(new_form, new_solution, self._t, self._bcs, 
+                                self.a, self.b, self.c, self._order,
+                                generator=generator)
+        
+class ERK1(MultiStageScheme):
+    """
+    Explicit first order Scheme
+    """
+    def __init__(self, rhs_form, solution, t=None, bcs=None):
+        a = np.array([0.])
+        b = np.array([1.])
+        c = np.array([0.])
+        MultiStageScheme.__init__(self, rhs_form, solution, t, bcs, a, b, c, 1)
+
+class BDF1(MultiStageScheme):
+    """
+    Implicit first order scheme
+    """
+    def __init__(self, rhs_form, solution, t=None, bcs=None):
+        a = np.array([1.])
+        b = np.array([1.])
+        c = np.array([1.])
+        MultiStageScheme.__init__(self, rhs_form, solution, t, bcs, a, b, c, 1)
+
+class ExplicitMidPoint(MultiStageScheme):
+    """
+    Explicit 2nd order scheme
+    """
+    def __init__(self, rhs_form, solution, t=None, bcs=None):
+
+        a = np.array([[0, 0],[0.5, 0.0]])
+        b = np.array([0., 1])
+        c = np.array([0, 0.5])
+        MultiStageScheme.__init__(self, rhs_form, solution, t, bcs, a, b, c, 2)
+
+class CN2(MultiStageScheme):
+    """
+    Semi-implicit 2nd order scheme
+    """
+    def __init__(self, rhs_form, solution, t=None, bcs=None):
+        a = np.array([[0, 0],[0.5, 0.5]])
+        b = np.array([0.5, 0.5])
+        c = np.array([0, 1.0])
+
+        MultiStageScheme.__init__(self, rhs_form, solution, t, bcs, a, b, c, 2)
+
+class ERK4(MultiStageScheme):
+    """
+    Explicit 4th order scheme
+    """
+    def __init__(self, rhs_form, solution, t=None, bcs=None):
+        a = np.array([[0, 0, 0, 0],
+                      [0.5, 0, 0, 0],
+                      [0, 0.5, 0, 0],
+                      [0, 0, 1, 0]])
+        b = np.array([1./6, 1./3, 1./3, 1./6])
+        c = np.array([0, 0.5, 0.5, 1])
+        MultiStageScheme.__init__(self, rhs_form, solution, t, bcs, a, b, c, 4)
+
+
+class ESDIRK3(MultiStageScheme):
+    """
+    Explicit implicit 3rd order scheme
+    """
+    def __init__(self, rhs_form, solution, t=None, bcs=None):
+        a = np.array([[0,                   0,                   0,                   0 ],
+                      [0.435866521500000,   0.435866521500000,   0,                   0 ],
+                      [0.490563388419108,   0.073570090080892,   0.435866521500000,   0 ],
+                      [0.308809969973036,   1.490563388254108,  -1.235239879727145,   0.435866521500000 ]])
+        b = a[-1,:].copy()
+        c = a.sum(1)
+        MultiStageScheme.__init__(self, rhs_form, solution, t, bcs, a, b, c, 3)
+                     
+class ESDIRK4(MultiStageScheme):
+    """
+    Explicit implicit 4rd order scheme
+    """
+    def __init__(self, rhs_form, solution, t=None, bcs=None):
+        a = np.array([[0,                  0,                 0,                  0,                   0],
+                      [0.435866521500000,  0.4358665215,      0,                  0,                   0                   ],
+                      [0.140737774731968, -0.108365551378832, 0.435866521500000,  0,                   0                   ],
+                      [0.102399400616089, -0.376878452267324, 0.838612530151233,  0.435866521500000,   0                   ],
+                      [0.157024897860995,  0.117330441357768, 0.616678030391680, -0.326899891110444,   0.435866521500000   ]])
+
+        b = a[-1,:].copy()
+        c = a.sum(1)
+        MultiStageScheme.__init__(self, rhs_form, solution, t, bcs, a, b, c, 4)
+
+# Aliases
+CrankNicolson = CN2
+ExplicitEuler = ERK1
+ForwardEuler = ERK1
+ImplicitEuler = BDF1
+BackwardEuler = BDF1
+ERK = ERK1
+RK4 = ERK4
+
+__all__ = [name for name, attr in globals().items() \
+           if isinstance(attr, type) and issubclass(attr, MultiStageScheme)]
+
+__all__.append("MultiStageScheme")
diff --git a/site-packages/dolfin/multistage/multistagesolvers.py b/site-packages/dolfin/multistage/multistagesolvers.py
new file mode 100644
index 0000000..b95ee7c
--- /dev/null
+++ b/site-packages/dolfin/multistage/multistagesolvers.py
@@ -0,0 +1,62 @@
+"""This module describes the Python wrapper of the cpp.PointIntegralSolver"""
+
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-04-24
+# Last changed: 2013-04-24
+
+# Import SWIG-generated extension module (DOLFIN C++)
+import dolfin.cpp as cpp
+
+__all__ = ["PointIntegralSolver", "RKSolver"]
+
+class PointIntegralSolver(cpp.PointIntegralSolver):
+    __doc__ = cpp.PointIntegralSolver.__doc__
+    def __init__(self, scheme):
+        """
+        Construct a PointIntegralSolver
+        
+        *Arguments*
+            scheme (_MultiStageScheme_)
+                The multistage scheme the PointIntegralSolver is going to use
+                to solve the PointIntegrals
+        """
+        self._scheme = scheme
+        cpp.PointIntegralSolver.__init__(self, scheme)
+
+    def scheme(self):
+        "Return the MultiStageScheme"
+        return self._scheme
+
+class RKSolver(cpp.RKSolver):
+    __doc__ = cpp.RKSolver.__doc__
+    def __init__(self, scheme):
+        """
+        Construct a RKSolver
+        
+        *Arguments*
+            scheme (_MultiStageScheme_)
+                The multistage scheme the RKSolver is going to use
+                to solve the PDE
+        """
+        self._scheme = scheme
+        cpp.RKSolver.__init__(self, scheme)
+
+    def scheme(self):
+        "Return the MultiStageScheme"
+        return self._scheme
diff --git a/site-packages/dolfin_utils/__init__.py b/site-packages/dolfin_utils/__init__.py
new file mode 100644
index 0000000..e69de29
diff --git a/site-packages/dolfin_utils/commands.py b/site-packages/dolfin_utils/commands.py
new file mode 100644
index 0000000..1edef2a
--- /dev/null
+++ b/site-packages/dolfin_utils/commands.py
@@ -0,0 +1,42 @@
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johannes Ring, 2009.
+#
+# First added:  2009-09-16
+# Last changed: 2009-09-16
+
+from subprocess import Popen, PIPE, STDOUT
+
+# These are taken from http://ivory.idyll.org/blog/mar-07/replacing-commands-with-subprocess
+
+__all__ = ['getoutput', 'getstatusoutput']
+
+def getoutput(cmd):
+    "Replacement for commands.getoutput which does not work on Windows."
+    pipe = Popen(cmd, shell=True, stdout=PIPE, stderr=STDOUT, bufsize=-1)
+    r = pipe.wait()
+    output, error = pipe.communicate()
+    return output
+
+def getstatusoutput(cmd, input=None, cwd=None, env=None):
+    "Replacement for commands.getstatusoutput which does not work on Windows."
+    pipe = Popen(cmd, shell=True, cwd=cwd, env=env, stdout=PIPE, stderr=STDOUT)
+    output, error = pipe.communicate(input=input)
+    assert not error
+    status = pipe.returncode
+    return status, output
diff --git a/site-packages/dolfin_utils/cppparser/CppHeaderParser.py b/site-packages/dolfin_utils/cppparser/CppHeaderParser.py
new file mode 100644
index 0000000..848716a
--- /dev/null
+++ b/site-packages/dolfin_utils/cppparser/CppHeaderParser.py
@@ -0,0 +1,2407 @@
+#!/usr/bin/python
+#
+# Author: Jashua R. Cloutier (contact via https://bitbucket.org/senex)
+# Project: http://senexcanis.com/open-source/cppheaderparser/
+#
+# Copyright (C) 2011, Jashua R. Cloutier
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions
+# are met:
+#
+# * Redistributions of source code must retain the above copyright
+#   notice, this list of conditions and the following disclaimer.
+#
+# * 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.
+#
+# * Neither the name of Jashua R. Cloutier nor the names of its
+#   contributors may be used to endorse or promote products derived from
+#   this software without specific prior written permission.  Stories,
+#   blog entries etc making reference to this project may mention the
+#   name Jashua R. Cloutier in terms of project originator/creator etc.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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
+# COPYRIGHT OWNER 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.
+#
+#
+# The CppHeaderParser.py script is written in Python 2.4 and released to
+# the open source community for continuous improvements under the BSD
+# 2.0 new license, which can be found at:
+#
+#   http://www.opensource.org/licenses/bsd-license.php
+#
+"""Parse C++ header files and generate a data structure
+representing the class
+"""
+
+import ply.lex as lex
+import os
+import sys
+import re
+
+import inspect
+
+def lineno():
+    """Returns the current line number in our program."""
+    return inspect.currentframe().f_back.f_lineno
+
+version = __version__ = "2.4.1"
+
+tokens = [
+    'NUMBER',
+    'NAME',
+    'OPEN_PAREN',
+    'CLOSE_PAREN',
+    'OPEN_BRACE',
+    'CLOSE_BRACE',
+    'OPEN_SQUARE_BRACKET',
+    'CLOSE_SQUARE_BRACKET',
+    'COLON',
+    'SEMI_COLON',
+    'COMMA',
+    'TAB',
+    'BACKSLASH',
+    'PIPE',
+    'PERCENT',
+    'EXCLAMATION',
+    'CARET',
+    'COMMENT_SINGLELINE',
+    'COMMENT_MULTILINE',
+    'PRECOMP_MACRO',
+    'PRECOMP_MACRO_CONT', 
+    'ASTERISK',
+    'AMPERSTAND',
+    'EQUALS',
+    'MINUS',
+    'PLUS',  
+    'DIVIDE', 
+    'CHAR_LITERAL', 
+    'STRING_LITERAL',
+    'NEW_LINE',
+    'SQUOTE',
+]
+
+t_ignore = " \r.?@\f"
+t_NUMBER = r'[0-9][0-9XxA-Fa-f]*'
+t_NAME = r'[<>A-Za-z_~][A-Za-z0-9_]*'
+t_OPEN_PAREN = r'\('
+t_CLOSE_PAREN = r'\)'
+t_OPEN_BRACE = r'{'
+t_CLOSE_BRACE = r'}'
+t_OPEN_SQUARE_BRACKET = r'\['
+t_CLOSE_SQUARE_BRACKET = r'\]'
+t_SEMI_COLON = r';'
+t_COLON = r':'
+t_COMMA = r','
+t_TAB = r'\t'
+t_BACKSLASH = r'\\'
+t_PIPE = r'\|'
+t_PERCENT = r'%'
+t_CARET = r'\^'
+t_EXCLAMATION = r'!'
+t_PRECOMP_MACRO = r'\#.*'
+t_PRECOMP_MACRO_CONT = r'.*\\\n'
+def t_COMMENT_SINGLELINE(t):
+    r'\/\/.*\n'
+    global doxygenCommentCache
+    if t.value.startswith("///") or t.value.startswith("//!"):
+        if doxygenCommentCache:
+            doxygenCommentCache += "\n"
+        if t.value.endswith("\n"):
+            doxygenCommentCache += t.value[:-1]
+        else:
+            doxygenCommentCache += t.value
+    t.lexer.lineno += len([a for a in t.value if a=="\n"])
+t_ASTERISK = r'\*'
+t_MINUS = r'\-'
+t_PLUS = r'\+'
+t_DIVIDE = r'/(?!/)'
+t_AMPERSTAND = r'&'
+t_EQUALS = r'='
+t_CHAR_LITERAL = "'.'"
+t_SQUOTE = "'"
+#found at http://wordaligned.org/articles/string-literals-and-regular-expressions
+#TODO: This does not work with the string "bla \" bla"
+t_STRING_LITERAL = r'"([^"\\]|\\.)*"'
+#Found at http://ostermiller.org/findcomment.html
+def t_COMMENT_MULTILINE(t):
+    r'/\*([^*]|[\r\n]|(\*+([^*/]|[\r\n])))*\*+/'
+    global doxygenCommentCache
+    if t.value.startswith("/**") or t.value.startswith("/*!"):
+        #not sure why, but get double new lines
+        v = t.value.replace("\n\n", "\n")
+        #strip prefixing whitespace
+        v = re.sub("\n[\s]+\*", "\n*", v)
+        doxygenCommentCache += v
+    t.lexer.lineno += len([a for a in t.value if a=="\n"])
+def t_NEWLINE(t):
+    r'\n+'
+    t.lexer.lineno += len(t.value)
+
+def t_error(v):
+    print(( "Lex error: ", v ))
+
+lex.lex()
+# Controls error_print
+print_errors = 1
+# Controls warning_print
+print_warnings = 0
+# Controls debug_print
+debug = 0
+# Controls trace_print
+debug_trace = 0
+
+def error_print(arg):
+    if print_errors: print(("[%4d] %s"%(inspect.currentframe().f_back.f_lineno, arg)))
+
+def warning_print(arg):
+    if print_warnings: print(("[%4d] %s"%(inspect.currentframe().f_back.f_lineno, arg)))
+
+def debug_print(arg):
+    global debug
+    if debug: print(("[%4d] %s"%(inspect.currentframe().f_back.f_lineno, arg)))
+
+def trace_print(*arg):
+    global debug_trace
+    if debug_trace:
+        sys.stdout.write("[%s] "%(inspect.currentframe().f_back.f_lineno))
+        for a in arg: sys.stdout.write("%s "%a)
+        sys.stdout.write("\n")
+
+supportedAccessSpecifier = [
+    'public',
+    'protected', 
+    'private'
+]
+
+#Symbols to ignore, usually special macros
+ignoreSymbols = [
+    'Q_OBJECT',
+]
+
+doxygenCommentCache = ""
+
+#Track what was added in what order and at what depth
+parseHistory = []
+
+def is_namespace(nameStack):
+    """Determines if a namespace is being specified"""
+    if len(nameStack) == 0:
+        return False
+    if nameStack[0] == "namespace":
+        return True
+    return False
+
+def is_enum_namestack(nameStack):
+    """Determines if a namestack is an enum namestack"""
+    if len(nameStack) == 0:
+        return False
+    if nameStack[0] == "enum":
+        return True
+    if len(nameStack) > 1 and nameStack[0] == "typedef" and nameStack[1] == "enum":
+        return True
+    return False
+
+def is_fundamental(s):
+    for a in s.split():
+        if a not in ["size_t", "struct", "union", "unsigned", "signed", "bool", "char", "short", "int", "float", "double", "long", "void", "*"]: return False
+    return True
+
+def is_function_pointer_stack(stack):
+    """Count how many non-nested paranthesis are in the stack.  Useful for determining if a stack is a function pointer"""
+    paren_depth = 0
+    paren_count = 0
+    star_after_first_paren = False
+    last_e = None
+    for e in stack:
+        if e == "(":
+            paren_depth += 1
+        elif e == ")" and paren_depth > 0:
+            paren_depth -= 1
+            if paren_depth == 0:
+                paren_count += 1
+        elif e == "*" and last_e == "(" and paren_count == 0 and paren_depth == 1:
+            star_after_first_paren = True
+        last_e = e
+        
+    if star_after_first_paren and paren_count == 2:
+        return True
+    else:
+        return False
+
+def is_method_namestack(stack):
+    r = False
+    if '(' not in stack: r = False
+    elif stack[0] == 'typedef': r = False    # TODO deal with typedef function prototypes
+    #elif '=' in stack and stack.index('=') < stack.index('(') and stack[stack.index('=')-1] != 'operator': r = False    #disabled July6th - allow all operators
+    elif 'operator' in stack: r = True    # allow all operators
+    elif '{' in stack and stack.index('{') < stack.index('('): r = False    # struct that looks like a method/class
+    elif '(' in stack and ')' in stack:
+        if '{' in stack and '}' in stack: r = True
+        elif stack[-1] == ';':
+            if is_function_pointer_stack(stack):
+                r = False
+            else:
+                r = True
+        elif '{' in stack: r = True    # ideally we catch both braces... TODO
+    else: r = False
+    #Test for case of property set to something with parens such as "static const int CONST_A = (1 << 7) - 1;"
+    if r and "(" in stack and "=" in stack and 'operator' not in stack:
+        if stack.index("=") < stack.index("("): r = False
+    return r
+
+def is_property_namestack(nameStack):
+    r = False
+    if '(' not in nameStack and ')' not in nameStack: r = True
+    elif "(" in nameStack and "=" in nameStack and nameStack.index("=") < nameStack.index("("): r = True
+    #See if we are a function pointer
+    if not r and is_function_pointer_stack(nameStack): r = True
+    return r
+
+def detect_lineno(s):
+    """Detect the line number for a given token string"""
+    try:
+        rtn = s.lineno()
+        if rtn != -1:
+            return rtn
+    except: pass
+    global curLine
+    return curLine 
+
+def filter_out_attribute_keyword(stack):
+    """Strips __attribute__ and its parenthetical expression from the stack"""
+    if "__attribute__" not in stack: return stack
+    try:
+        debug_print("Stripping __attribute__ from %s"% stack)
+        attr_index = stack.index("__attribute__")
+        attr_end = attr_index + 1 #Assuming not followed by parenthetical expression which wont happen
+        #Find final paren
+        if stack[attr_index + 1] == '(':
+            paren_count = 1
+            for i in range(attr_index + 2, len(stack)):
+                elm = stack[i]
+                if elm == '(':
+                    paren_count += 1
+                elif elm == ')':
+                    paren_count -= 1
+                    if paren_count == 0:
+                        attr_end = i + 1
+                        break
+        new_stack = stack[0:attr_index] + stack[attr_end:]
+        debug_print("stripped stack is %s"% new_stack)
+        return new_stack
+    except:
+        return stack
+    
+
+class TagStr(str):
+    """Wrapper for a string that allows us to store the line number associated with it"""
+    lineno_reg = {}
+    def __new__(cls,*args,**kw):
+        new_obj =  str.__new__(cls,*args)
+        if "lineno" in kw:
+            TagStr.lineno_reg[id(new_obj)] = kw["lineno"]
+        return new_obj
+    
+    def __del__(self):
+        try:
+            del TagStr.lineno_reg[id(self)]
+        except: pass
+    
+    def lineno(self):
+        return TagStr.lineno_reg.get(id(self), -1)
+
+class CppParseError(Exception): pass
+    
+class CppClass(dict):
+    """Takes a name stack and turns it into a class
+    
+    Contains the following Keys:
+    self['name'] - Name of the class
+    self['doxygen'] - Doxygen comments associated with the class if they exist
+    self['inherits'] - List of Classes that this one inherits where the values
+        are of the form {"access": Anything in supportedAccessSpecifier
+                                  "class": Name of the class
+    self['methods'] - Dictionary where keys are from supportedAccessSpecifier
+        and values are a lists of CppMethod's
+    self['properties'] - Dictionary where keys are from supportedAccessSpecifier
+        and values are lists of CppVariable's 
+    self['enums'] - Dictionary where keys are from supportedAccessSpecifier and
+        values are lists of CppEnum's
+    self['structs'] - Dictionary where keys are from supportedAccessSpecifier and
+        values are lists of nested Struct's
+    
+    An example of how this could look is as follows:
+    #self =
+    {
+        'name': ""
+        'inherits':[]
+        'methods':
+        {
+            'public':[],
+            'protected':[], 
+            'private':[]
+        }, 
+        'properties':
+        {
+            'public':[],
+            'protected':[], 
+            'private':[]
+        },
+        'enums':
+        {
+            'public':[],
+            'protected':[], 
+            'private':[]
+        }
+    }
+    """
+
+    def get_all_methods(self):
+        r = []
+        for typ in supportedAccessSpecifier: r += self['methods'][typ]
+        return r
+
+    def get_all_method_names( self ):
+        r = []
+        for typ in supportedAccessSpecifier: r += self.get_method_names(typ)        # returns list
+        return r
+
+    def get_all_pure_virtual_methods( self ):
+        r = {}
+        for typ in supportedAccessSpecifier: r.update(self.get_pure_virtual_methods(typ))        # returns dict
+        return r
+
+
+    def get_method_names( self, type='public' ): return [ meth['name'] for meth in self['methods'][ type ] ]
+
+    def get_pure_virtual_methods( self, type='public' ):
+        r = {}
+        for meth in self['methods'][ type ]:
+            if meth['pure_virtual']: r[ meth['name'] ] = meth
+        return r
+
+    def __init__(self, nameStack):
+        self['nested_classes'] = []
+        self['parent'] = None
+        self['abstract'] = False
+        self._public_enums = {}
+        self._public_structs = {}
+        self._public_typedefs = {}
+        self._public_forward_declares = []
+        self['namespace'] = ""
+
+        debug_print( "Class:   %s"%nameStack )
+        if (len(nameStack) < 2):
+            nameStack.insert(1, "")#anonymous struct
+        global doxygenCommentCache
+        if len(doxygenCommentCache):
+            self["doxygen"] = doxygenCommentCache
+            doxygenCommentCache = ""
+        
+        if "::" in "".join(nameStack):
+            #Re-Join class paths (ex  ['class', 'Bar', ':', ':', 'Foo'] -> ['class', 'Bar::Foo'] 
+            try:
+                new_nameStack = []
+                for name in nameStack:
+                    if len(new_nameStack) == 0: 
+                        new_nameStack.append(name)
+                    elif name == ":" and new_nameStack[-1].endswith(":"):
+                        new_nameStack[-1] += name
+                    elif new_nameStack[-1].endswith("::"):
+                        new_nameStack[-2] += new_nameStack[-1] + name
+                        del new_nameStack[-1]
+                    else:
+                        new_nameStack.append(name)
+                trace_print("Convert from namestack\n %s\nto\n%s"%(nameStack, new_nameStack))
+                nameStack = new_nameStack
+            except: pass
+        
+        self["name"] = nameStack[1]
+        self["line_number"] = detect_lineno(nameStack[0])
+        
+        #Handle template classes
+        if len(nameStack) > 3 and nameStack[2].startswith("<"):
+            open_template_count = 0
+            param_separator = 0
+            found_first = False
+            i = 0
+            for elm in nameStack:
+                if '<' in elm :
+                    open_template_count += 1
+                    found_first = True
+                elif '>' in elm:
+                    open_template_count -= 1
+                if found_first and open_template_count == 0:
+                    self["name"] = "".join(nameStack[1:i + 1])
+                    break;
+                i += 1
+        elif ":" in nameStack:
+            self['name'] = nameStack[ nameStack.index(':') - 1 ]
+
+        inheritList = []
+
+        if nameStack.count(':') == 1:
+            nameStack = nameStack[nameStack.index(":") + 1:]
+            while len(nameStack):
+                tmpStack = []
+                tmpInheritClass = {"access":"private", "virtual": False}
+                if "," in nameStack:
+                    tmpStack = nameStack[:nameStack.index(",")]
+                    nameStack = nameStack[nameStack.index(",") + 1:]
+                else:
+                    tmpStack = nameStack
+                    nameStack = []
+                
+                # Convert template classes to one name in the last index
+                for i in range(0, len(tmpStack)):
+                    if '<' in tmpStack[i]:
+                        tmpStack2 = tmpStack[:i-1]
+                        tmpStack2.append("".join(tmpStack[i-1:]))
+                        tmpStack = tmpStack2
+                        break
+                if len(tmpStack) == 0:
+                    break;
+                elif len(tmpStack) == 1:
+                    tmpInheritClass["class"] = tmpStack[0]
+                elif len(tmpStack) == 2:
+                    tmpInheritClass["access"] = tmpStack[0]
+                    tmpInheritClass["class"] = tmpStack[1]
+                elif len(tmpStack) == 3 and "virtual" in tmpStack:
+                    tmpInheritClass["access"] = tmpStack[1] if tmpStack[1] != "virtual" else tmpStack[0]
+                    tmpInheritClass["class"] = tmpStack[2]
+                    tmpInheritClass["virtual"] = True
+                else:
+                    warning_print( "Warning: can not parse inheriting class %s"%(" ".join(tmpStack)))
+                    if '>' in tmpStack: pass    # allow skip templates for now
+                    else: raise NotImplemented
+
+                if 'class' in tmpInheritClass: inheritList.append(tmpInheritClass)
+
+        elif nameStack.count(':') == 2: self['parent'] = self['name']; self['name'] = nameStack[-1]
+
+        elif nameStack.count(':') > 2 and nameStack[0] in ("class", "struct"):
+            tmpStack = nameStack[nameStack.index(":") + 1:]
+            
+            superTmpStack = [[]]
+            for tok in tmpStack:
+                if tok == ',':
+                    superTmpStack.append([])
+                else:
+                    superTmpStack[-1].append(tok)
+            
+            for tmpStack in superTmpStack:
+                tmpInheritClass = {"access":"private"}
+                
+                if len(tmpStack) and tmpStack[0] in supportedAccessSpecifier:
+                    tmpInheritClass["access"] = tmpStack[0]
+                    tmpStack = tmpStack[1:]
+                
+                inheritNSStack = []
+                while len(tmpStack) > 3:
+                    if tmpStack[0] == ':': break;
+                    if tmpStack[1] != ':': break;
+                    if tmpStack[2] != ':': break;
+                    inheritNSStack.append(tmpStack[0])
+                    tmpStack = tmpStack[3:]
+                if len(tmpStack) == 1 and tmpStack[0] != ':':
+                     inheritNSStack.append(tmpStack[0])
+                tmpInheritClass["class"] = "::".join(inheritNSStack)
+                inheritList.append(tmpInheritClass)
+
+        self['inherits'] = inheritList
+
+        methodAccessSpecificList = {}
+        propertyAccessSpecificList = {}
+        enumAccessSpecificList = {}
+        structAccessSpecificList = {}
+        typedefAccessSpecificList = {}
+        forwardAccessSpecificList = {}
+        
+        for accessSpecifier in supportedAccessSpecifier:
+            methodAccessSpecificList[accessSpecifier] = []
+            propertyAccessSpecificList[accessSpecifier] = []
+            enumAccessSpecificList[accessSpecifier] = []
+            structAccessSpecificList[accessSpecifier] = []
+            typedefAccessSpecificList[accessSpecifier] = []
+            forwardAccessSpecificList[accessSpecifier] = []
+
+        self['methods'] = methodAccessSpecificList
+        self['properties'] = propertyAccessSpecificList
+        self['enums'] = enumAccessSpecificList
+        self['structs'] = structAccessSpecificList
+        self['typedefs'] = typedefAccessSpecificList
+        self['forward_declares'] = forwardAccessSpecificList
+
+ 
+    def show(self):
+        """Convert class to a string"""
+        namespace_prefix = ""
+        if self["namespace"]: namespace_prefix = self["namespace"] + "::"
+        rtn = "%s %s"%(self["declaration_method"], namespace_prefix + self["name"])
+        if self['abstract']: rtn += '    (abstract)\n'
+        else: rtn += '\n'
+
+        if 'doxygen' in list(self.keys()): rtn += self["doxygen"] + '\n'
+        if 'parent' in list(self.keys()) and self['parent']: rtn += 'parent class: ' + self['parent'] + '\n'
+
+        if "inherits" in list(self.keys()):
+            rtn += "  Inherits: "
+            for inheritClass in self["inherits"]:
+                if inheritClass["virtual"]: rtn += "virtual "
+                rtn += "%s %s, "%(inheritClass["access"], inheritClass["class"])
+            rtn += "\n"
+        rtn += "  {\n"
+        for accessSpecifier in supportedAccessSpecifier:
+            rtn += "    %s\n"%(accessSpecifier)
+            #Enums
+            if (len(self["enums"][accessSpecifier])):
+                rtn += "        <Enums>\n"
+            for enum in self["enums"][accessSpecifier]:
+                rtn += "            %s\n"%(repr(enum))
+            #Properties
+            if (len(self["properties"][accessSpecifier])):
+                rtn += "        <Properties>\n"
+            for property in self["properties"][accessSpecifier]:
+                rtn += "            %s\n"%(repr(property))
+            #Methods
+            if (len(self["methods"][accessSpecifier])):
+                rtn += "        <Methods>\n"
+            for method in self["methods"][accessSpecifier]:
+                rtn += "\t\t" + method.show() + '\n'
+        rtn += "  }\n"
+        print(rtn)
+    
+    def __repr__(self):
+        """Convert class to a string"""
+        namespace_prefix = ""
+        if self["namespace"]: namespace_prefix = self["namespace"] + "::"
+        rtn = "%s %s"%(self["declaration_method"], namespace_prefix + self["name"])
+        if self['abstract']: rtn += '    (abstract)\n'
+        else: rtn += '\n'
+
+        if 'doxygen' in list(self.keys()): rtn += self["doxygen"] + '\n'
+        if 'parent' in list(self.keys()) and self['parent']: rtn += 'parent class: ' + self['parent'] + '\n'
+
+        if "inherits" in list(self.keys()) and len(self["inherits"]):
+            rtn += "Inherits: "
+            for inheritClass in self["inherits"]:
+                if inheritClass.get("virtual", False): rtn += "virtual "
+                rtn += "%s %s, "%(inheritClass["access"], inheritClass["class"])
+            rtn += "\n"
+        rtn += "{\n"
+        for accessSpecifier in supportedAccessSpecifier:
+            rtn += "%s\n"%(accessSpecifier)
+            #Enums
+            if (len(self["enums"][accessSpecifier])):
+                rtn += "    // Enums\n"
+            for enum in self["enums"][accessSpecifier]:
+                rtn += "    %s\n"%(repr(enum))
+            #Properties
+            if (len(self["properties"][accessSpecifier])):
+                rtn += "    // Properties\n"
+            for property in self["properties"][accessSpecifier]:
+                rtn += "    %s\n"%(repr(property))
+            #Methods
+            if (len(self["methods"][accessSpecifier])):
+                rtn += "    // Methods\n"
+            for method in self["methods"][accessSpecifier]:
+                rtn += "   %s\n"%(repr(method))
+        rtn += "}\n"
+        return rtn
+
+
+class CppUnion( CppClass ):
+    """Takes a name stack and turns it into a union
+    
+    Contains the following Keys:
+    self['name'] - Name of the union
+    self['doxygen'] - Doxygen comments associated with the union if they exist
+    self['members'] - List of members the union has 
+    
+    An example of how this could look is as follows:
+    #self =
+    {
+        'name': ""
+        'members': []
+    }
+    """
+    
+    def __init__(self, nameStack):
+        CppClass.__init__(self, nameStack)
+        self["name"] = "union " + self["name"]
+        self["members"] = self["properties"]["public"]
+    
+    def transform_to_union_keys(self):
+        print("union keys: %s"%list(self.keys()))
+        for key in ['inherits', 'parent', 'abstract', 'namespace', 'typedefs', 'methods']:
+            del self[key] 
+        
+    def show(self):
+        """Convert class to a string"""
+        print(self)
+    
+    
+    def __repr__(self):
+        """Convert class to a string"""
+        namespace_prefix = ""
+        if self["namespace"]: namespace_prefix = self["namespace"] + "::"
+        rtn = "%s %s"%(self["declaration_method"], namespace_prefix + self["name"])
+        if self['abstract']: rtn += '    (abstract)\n'
+        else: rtn += '\n'
+
+        if 'doxygen' in list(self.keys()): rtn += self["doxygen"] + '\n'
+        if 'parent' in list(self.keys()) and self['parent']: rtn += 'parent class: ' + self['parent'] + '\n'
+
+        rtn += "{\n"
+        for member in self["members"]:
+            rtn += "    %s\n"%(repr(member))
+        rtn += "}\n"
+        return rtn
+
+       
+
+class _CppMethod( dict ):
+    def _params_helper1( self, stack ):
+        # deal with "throw" keyword
+        if 'throw' in stack: stack = stack[ : stack.index('throw') ]
+
+        ## remove GCC keyword __attribute__(...) and preserve returns ##
+        cleaned = []
+        hit = False; hitOpen = 0; hitClose = 0
+        for a in stack:
+            if a == '__attribute__': hit = True
+            if hit:
+                if a == '(': hitOpen += 1
+                elif a == ')': hitClose += 1
+                if a==')' and hitOpen == hitClose:
+                    hit = False
+            else:
+                cleaned.append( a )
+        stack = cleaned
+
+        # also deal with attribute((const)) function prefix #
+        # TODO this needs to be better #
+        if len(stack) > 5:
+            a = ''.join(stack)
+            if a.startswith('((__const__))'): stack = stack[ 5 : ]
+            elif a.startswith('__attribute__((__const__))'): stack = stack[ 6 : ]
+
+        stack = stack[stack.index('(') + 1: ]
+        if not stack: return []
+        if len(stack)>=3 and stack[0]==')' and stack[1]==':':    # is this always a constructor?
+            self['constructor'] = True
+            return []
+
+        stack.reverse(); _end_ = stack.index(')'); stack.reverse()
+        stack = stack[ : len(stack)-(_end_+1) ]
+        if '(' not in stack: return stack    # safe to return, no defaults that init a class
+
+        # transforms ['someclass', '(', '0', '0', '0', ')'] into "someclass(0,0,0)'"
+        r = []; hit=False
+        for a in stack:
+            if a == '(': hit=True
+            elif a == ')': hit=False
+            if hit or a == ')': r[-1] = r[-1] + a
+            else: r.append( a )
+        return r
+
+    def _params_helper2( self, params ):
+        for p in params:
+            p['method'] = self        # save reference in variable to parent method
+            if '::' in p['type']:
+                ns = p['type'].split('::')[0]
+                if ns not in Resolver.NAMESPACES and ns in Resolver.CLASSES:
+                    p['type'] = self['namespace'] + p['type']
+            else: p['namespace'] = self[ 'namespace' ]
+
+class CppMethod( _CppMethod ):
+    """Takes a name stack and turns it into a method
+    
+    Contains the following Keys:
+    self['rtnType'] - Return type of the method (ex. "int")
+    self['name'] - Name of the method (ex. "getSize")
+    self['doxygen'] - Doxygen comments associated with the method if they exist
+    self['parameters'] - List of CppVariables
+    """
+    def show(self):
+        r = ['method name: %s (%s)' %(self['name'],self['debug']) ]
+        if self['returns']: r.append( 'returns: %s'%self['returns'] )
+        if self['parameters']: r.append( 'number arguments: %s' %len(self['parameters']))
+        if self['pure_virtual']: r.append( 'pure virtual: %s'%self['pure_virtual'] )
+        if self['constructor']: r.append( 'constructor' )
+        if self['destructor']: r.append( 'destructor' )
+        return '\n\t\t  '.join( r )
+
+    def __init__(self, nameStack, curClass, methinfo):
+        debug_print( "Method:   %s"%nameStack )
+        global doxygenCommentCache
+        if len(doxygenCommentCache):
+            self["doxygen"] = doxygenCommentCache
+            doxygenCommentCache = ""
+        if "operator" in nameStack:
+            self["rtnType"] = " ".join(nameStack[:nameStack.index('operator')])
+            self["name"] = "".join(nameStack[nameStack.index('operator'):nameStack.index('(')])
+        else:
+            self["rtnType"] = " ".join(nameStack[:nameStack.index('(') - 1])
+            self["name"] = " ".join(nameStack[nameStack.index('(') - 1:nameStack.index('(')])
+        if self["rtnType"].startswith("virtual"):
+           self["rtnType"] = self["rtnType"][len("virtual"):].strip()
+        if len(self["rtnType"]) == 0 or self["name"] == curClass:
+            self["rtnType"] = "void"
+        
+        self["rtnType"] = self["rtnType"].replace(' : : ', '::' )
+        self["rtnType"] = self["rtnType"].replace(" <","<")
+        self["rtnType"] = self["rtnType"].replace(" >",">").replace(">>", "> >").replace(">>", "> >")
+        self["rtnType"] = self["rtnType"].replace(" ,",",")
+        
+        self["const"] = False
+        for i in reversed(nameStack):
+            if i == "const":
+                self["const"] = True
+                break
+            elif i == ")":
+                break        
+
+        self.update( methinfo )
+        self["line_number"] = detect_lineno(nameStack[0])
+
+        #Filter out initializer lists used in constructors
+        try:
+            paren_depth_counter = 0
+            for i in range(0, len(nameStack)):
+                elm = nameStack[i]
+                if elm == "(":
+                    paren_depth_counter += 1
+                if elm == ")":
+                    paren_depth_counter -=1
+                    if paren_depth_counter == 0 and nameStack[i+1] == ':':
+                        debug_print("Stripping out initializer list")
+                        nameStack = nameStack[:i+1]
+                        break
+        except: pass
+        
+        paramsStack = self._params_helper1( nameStack )
+        
+
+        params = []
+        #See if there is a doxygen comment for the variable
+        doxyVarDesc = {}
+        
+        if "doxygen" in self:
+            doxyLines = self["doxygen"].split("\n")
+            lastParamDesc = ""
+            for doxyLine in doxyLines:
+                if " @param " in doxyLine or " \param " in doxyLine:
+                    try:
+                        #Strip out the param
+                        doxyLine = doxyLine[doxyLine.find("param ") + 6:]
+                        (var, desc) = doxyLine.split(" ", 1)
+                        doxyVarDesc[var] = desc.strip()
+                        lastParamDesc = var
+                    except: pass
+                elif " @return " in doxyLine or " \return " in doxyLine:
+                    lastParamDesc = ""
+                    # not handled for now
+                elif lastParamDesc:
+                    try:
+                        doxyLine = doxyLine.strip()
+                        if " " not in doxyLine:
+                            lastParamDesc = ""
+                            continue
+                        doxyLine = doxyLine[doxyLine.find(" ") + 1:]
+                        doxyVarDesc[lastParamDesc] += " " + doxyLine
+                    except: pass
+        
+        #Create the variable now
+        while (len(paramsStack)):
+            # Find commas that are not nexted in <>'s like template types
+            open_template_count = 0
+            param_separator = 0
+            i = 0
+            for elm in paramsStack:
+                if '<' in elm :
+                    open_template_count += 1
+                elif '>' in elm:
+                    open_template_count -= 1
+                elif elm == ',' and open_template_count == 0:
+                    param_separator = i
+                    break
+                i += 1
+            
+            if param_separator:
+                param = CppVariable(paramsStack[0:param_separator],  doxyVarDesc=doxyVarDesc)
+                if len(list(param.keys())): params.append(param)
+                paramsStack = paramsStack[param_separator + 1:]
+            else:
+                param = CppVariable(paramsStack,  doxyVarDesc=doxyVarDesc)
+                if len(list(param.keys())): params.append(param)
+                break
+
+
+        self["parameters"] = params
+        self._params_helper2( params )    # mods params inplace
+
+    def __repr__(self):
+        filter_keys = ("parent", "defined", "operator", "returns_reference")
+        cpy = dict((k,v) for (k,v) in list(self.items()) if k not in filter_keys)
+        return "%s"%cpy
+
+
+class _CppVariable(dict):
+    def _name_stack_helper( self, stack ):
+        stack = list(stack)
+        if '=' not in stack:        # TODO refactor me
+            # check for array[n] and deal with funny array syntax: "int myvar:99"
+            array = []
+            while stack and stack[-1].isdigit(): array.append( stack.pop() )
+            if array: array.reverse(); self['array'] = int(''.join(array))
+            if stack and stack[-1].endswith(':'): stack[-1] = stack[-1][:-1]
+
+        while stack and not stack[-1]: stack.pop()            # can be empty
+        return stack
+
+    def init(self):
+        #assert self['name']    # allow unnamed variables, methods like this: "void func(void);"
+        a = []
+        self['aliases'] = []; self['parent'] = None; self['typedef'] = None
+        for key in 'constant reference pointer static typedefs class fundamental unresolved'.split():
+            self[ key ] = 0
+        for b in self['type'].split():
+            if b == '__const__': b = 'const'
+            a.append( b )
+        self['type'] = ' '.join( a )
+
+
+class CppVariable( _CppVariable ):
+    """Takes a name stack and turns it into a method
+    
+    Contains the following Keys:
+    self['type'] - Type for the variable (ex. "const string &")
+    self['name'] - Name of the variable (ex. "numItems")
+    self['namespace'] - Namespace containing the enum
+    self['desc'] - Description of the variable if part of a method (optional)
+    self['doxygen'] - Doxygen comments associated with the method if they exist
+    self['defaltValue'] - Default value of the variable, this key will only
+        exist if there is a default value
+    """
+    Vars = []
+    def __init__(self, nameStack,  **kwargs):
+        _stack_ = nameStack
+        if "[" in nameStack: #strip off array informatin
+            arrayStack = nameStack[nameStack.index("["):]
+            if len(arrayStack) == 3:
+                self["array_size"] = arrayStack[1] 
+            nameStack = nameStack[:nameStack.index("[")]
+            self["array"] = 1
+        else:
+            self["array"] = 0
+        nameStack = self._name_stack_helper( nameStack )
+        global doxygenCommentCache
+        if len(doxygenCommentCache):
+            self["doxygen"] = doxygenCommentCache
+            doxygenCommentCache = ""
+
+        debug_print( "Variable: %s"%nameStack )
+
+        self["line_number"] = detect_lineno(nameStack[0])
+        self["function_pointer"] = 0
+
+        if (len(nameStack) < 2):    # +++
+            if len(nameStack) == 1: self['type'] = nameStack[0]; self['name'] = ''
+            else: error_print(_stack_); assert 0
+
+        elif is_function_pointer_stack(nameStack): #function pointer
+            self["type"] = " ".join(nameStack[:nameStack.index("(") + 2] + nameStack[nameStack.index(")")  :])
+            self["name"] = " ".join(nameStack[nameStack.index("(") + 2 : nameStack.index(")")])
+            self["function_pointer"] = 1
+
+        elif ("=" in nameStack):
+            self["type"] = " ".join(nameStack[:nameStack.index("=") - 1])
+            self["name"] = nameStack[nameStack.index("=") - 1]
+            self["defaltValue"] = " ".join(nameStack[nameStack.index("=") + 1:])    # deprecate camelCase in dicts
+            self['default'] = " ".join(nameStack[nameStack.index("=") + 1:])
+
+        elif is_fundamental(nameStack[-1]) or nameStack[-1] in ['>', '<' , ':', '.']:
+            #Un named parameter
+            self["type"] = " ".join(nameStack)
+            self["name"] = ""
+
+        else:    # common case
+            self["type"] = " ".join(nameStack[:-1])
+            self["name"] = nameStack[-1]
+
+        self["type"] = self["type"].replace(" :",":")
+        self["type"] = self["type"].replace(": ",":")
+        self["type"] = self["type"].replace(" <","<")
+        self["type"] = self["type"].replace(" >",">").replace(">>", "> >").replace(">>", "> >")
+        self["type"] = self["type"].replace(" ,",",")
+        #Optional doxygen description
+        try:
+            self["desc"] = kwargs["doxyVarDesc"][self["name"]]
+        except: pass
+
+        self.init()
+        CppVariable.Vars.append( self )        # save and resolve later
+    
+    def __repr__(self):
+        keys_white_list = ['constant','name','reference','type','static','pointer','desc', 'line_number']
+        cpy = dict((k,v) for (k,v) in list(self.items()) if k in keys_white_list)
+        if "array_size" in self: cpy["array_size"] = self["array_size"]
+        return "%s"%cpy
+
+class _CppEnum(dict):
+    def resolve_enum_values( self, values ):
+        """Evaluates the values list of dictionaries passed in and figures out what the enum value
+        for each enum is editing in place:
+        
+        Example:
+        From: [{'name': 'ORANGE'},
+               {'name': 'RED'},
+               {'name': 'GREEN', 'value': '8'}]
+        To:   [{'name': 'ORANGE', 'value': 0},
+               {'name': 'RED', 'value': 1},
+               {'name': 'GREEN', 'value': 8}]
+        """
+        t = int; i = 0
+        names = [ v['name'] for v in values ]
+        for v in values:
+            if 'value' in v:
+                a = v['value'].strip()
+                # Remove single quotes from single quoted chars (unless part of some expression
+                if len(a) == 3 and a[0] == "'" and a[2] == "'":
+                    a = v['value'] = a[1]
+                if a.lower().startswith("0x"):
+                    try:
+                        i = a = int(a , 16)
+                    except:pass
+                elif a.isdigit():
+                    i = a = int( a )
+                elif a in names:
+                    for other in values:
+                        if other['name'] == a:
+                            v['value'] = other['value']
+                            break
+
+                elif '"' in a or "'" in a: t = str # only if there are quotes it this a string enum
+                else:
+                    try:
+                        a = i = ord(a)
+                    except: pass
+                #Allow access of what is in the file pre-convert if converted
+                if v['value'] != str(a):
+                    v['raw_value'] = v['value']
+                v['value'] = a
+            else: v['value'] = i
+            try:
+                v['value'] = v['value'].replace(" < < ", " << ").replace(" >> ", " >> ")
+            except: pass
+            i += 1
+        return t
+
+class CppEnum(_CppEnum):
+    """Takes a name stack and turns it into an Enum
+    
+    Contains the following Keys:
+    self['name'] - Name of the enum (ex. "ItemState")
+    self['namespace'] - Namespace containing the enum
+    self['values'] - List of values where the values are a dictionary of the
+        form {"name": name of the key (ex. "PARSING_HEADER"),
+                  "value": Specified value of the enum, this key will only exist
+                    if a value for a given enum value was defined
+                }
+    """
+    def __init__(self, nameStack):
+        global doxygenCommentCache
+        if len(doxygenCommentCache):
+            self["doxygen"] = doxygenCommentCache
+            doxygenCommentCache = ""
+        if len(nameStack) == 3 and nameStack[0] == "enum":
+            debug_print("Created enum as just name/value")
+            self["name"] = nameStack[1]
+            self["instances"]=[nameStack[2]]
+        if len(nameStack) < 4 or "{" not in nameStack or "}" not in nameStack:
+            #Not enough stuff for an enum
+            debug_print("Bad enum")
+            return
+        valueList = []
+        self["line_number"] = detect_lineno(nameStack[0])
+        #Figure out what values it has
+        valueStack = nameStack[nameStack.index('{') + 1: nameStack.index('}')]
+        while len(valueStack):
+            tmpStack = []
+            if "," in valueStack:
+                tmpStack = valueStack[:valueStack.index(",")]
+                valueStack = valueStack[valueStack.index(",") + 1:]
+            else:
+                tmpStack = valueStack
+                valueStack = []
+            d = {}
+            if len(tmpStack) == 1: d["name"] = tmpStack[0]
+            elif len(tmpStack) >= 3 and tmpStack[1] == "=":
+                d["name"] = tmpStack[0]; d["value"] = " ".join(tmpStack[2:])
+            elif len(tmpStack) == 2 and tmpStack[1] == "=":
+                debug_print( "WARN-enum: parser missed value for %s"%tmpStack[0] )
+                d["name"] = tmpStack[0]
+
+            if d: valueList.append( d )
+
+        if len(valueList):
+            self['type'] = self.resolve_enum_values( valueList )    # returns int for standard enum
+            self["values"] = valueList
+        else:
+            warning_print( 'WARN-enum: empty enum %s'%nameStack )
+            return
+        #Figure out if it has a name
+        preBraceStack = nameStack[:nameStack.index("{")]
+        postBraceStack = nameStack[nameStack.index("}") + 1:]
+        if (len(preBraceStack) == 2 and "typedef" not in nameStack):
+            self["name"] = preBraceStack[1]           
+        elif len(postBraceStack) and "typedef" in nameStack:
+                self["name"] = " ".join(postBraceStack)
+        else: warning_print( 'WARN-enum: nameless enum %s'%nameStack )
+        #See if there are instances of this
+        if "typedef" not in nameStack and len(postBraceStack):
+            self["instances"] = []
+            for var in postBraceStack:
+                if "," in var:
+                    continue
+                self["instances"].append(var)
+        self["namespace"] = ""
+
+
+class CppStruct(dict):
+    Structs = []
+    def __init__(self, nameStack):
+        if len(nameStack) >= 2: self['type'] = nameStack[1]
+        else: self['type'] = None
+        self['fields'] = []
+        self.Structs.append( self )
+        global curLine
+        self["line_number"] = curLine
+
+C99_NONSTANDARD = {
+    'int8' : 'signed char',
+    'int16' : 'short int',
+    'int32' : 'int',
+    'int64' : 'int64_t',        # this can be: long int (64bit), or long long int (32bit)
+    'uint' : 'unsigned int',
+    'uint8' : 'unsigned char',
+    'uint16' : 'unsigned short int',
+    'uint32' : 'unsigned int',
+    'uint64' : 'uint64_t',    # depends on host bits
+}
+
+
+def standardize_fundamental( s ):
+    if s in C99_NONSTANDARD: return C99_NONSTANDARD[ s ]
+    else: return s
+
+
+class Resolver(object):
+    C_FUNDAMENTAL = 'size_t unsigned signed bool char wchar short int float double long void'.split()
+    C_FUNDAMENTAL += 'struct union enum'.split()
+
+
+    SubTypedefs = {}        # TODO deprecate?
+    NAMESPACES = []
+    CLASSES = {}
+    STRUCTS = {}
+
+    def initextra(self):
+        self.typedefs = {}
+        self.typedefs_order = []
+        self.classes_order = []
+        self.structs = Resolver.STRUCTS
+        self.structs_order = []
+        self.namespaces = Resolver.NAMESPACES        # save all namespaces
+        self.curStruct = None
+        self.stack = []    # full name stack, good idea to keep both stacks? (simple stack and full stack)
+        self._classes_brace_level = {}    # class name : level
+        self._structs_brace_level = {}        # struct type : level
+        self._method_body = None
+        self._forward_decls = []
+        self._template_typenames = []    # template<typename XXX>
+
+    def current_namespace(self): return self.cur_namespace(True)
+
+    def cur_namespace(self, add_double_colon=False):
+        rtn = ""
+        i = 0
+        while i < len(self.nameSpaces):
+            rtn += self.nameSpaces[i]
+            if add_double_colon or i < len(self.nameSpaces) - 1: rtn += "::"
+            i+=1
+        return rtn
+
+
+    def guess_ctypes_type( self, string ):
+        pointers = string.count('*')
+        string = string.replace('*','')
+
+        a = string.split()
+        if 'unsigned' in a: u = 'u'
+        else: u = ''
+        if 'long' in a and 'double' in a: b = 'longdouble'    # there is no ctypes.c_ulongdouble (this is a 64bit float?)
+        elif a.count('long') == 2 and 'int' in a: b = '%sint64' %u
+        elif a.count('long') == 2: b = '%slonglong' %u
+        elif 'long' in a: b = '%slong' %u
+        elif 'double' in a: b = 'double'    # no udouble in ctypes
+        elif 'short' in a: b = '%sshort' %u
+        elif 'char' in a: b = '%schar' %u
+        elif 'wchar' in a: b = 'wchar'
+        elif 'bool' in a: b = 'bool'
+        elif 'float' in a: b = 'float'
+
+        elif 'int' in a: b = '%sint' %u
+        elif 'int8' in a: b = 'int8'
+        elif 'int16' in a: b = 'int16'
+        elif 'int32' in a: b = 'int32'
+        elif 'int64' in a: b = 'int64'
+
+        elif 'uint' in a: b = 'uint'
+        elif 'uint8' in a: b = 'uint8'
+        elif 'uint16' in a: b = 'uint16'
+        elif 'uint32' in a: b = 'uint32'
+        elif 'uint64' in a: b = 'uint64'
+
+        elif 'size_t' in a: b = 'size_t'
+        elif 'void' in a: b = 'void_p'
+
+        elif string in 'struct union'.split(): b = 'void_p'    # what should be done here? don't trust struct, it could be a class, no need to expose via ctypes
+        else: b = 'void_p'
+
+        if not pointers: return 'ctypes.c_%s' %b
+        else:
+            x = ''
+            for i in range(pointers): x += 'ctypes.POINTER('
+            x += 'ctypes.c_%s' %b
+            x += ')' * pointers
+            return x
+
+    def resolve_type( self, string, result ):    # recursive
+        '''
+        keeps track of useful things like: how many pointers, number of typedefs, is fundamental or a class, etc...
+        '''
+        ## be careful with templates, what is inside <something*> can be a pointer but the overall type is not a pointer
+        ## these come before a template
+        s = string.split('<')[0]
+        result[ 'constant' ] += s.split().count('const')
+        result[ 'static' ] += s.split().count('static')
+        result[ 'mutable' ] = 'mutable' in s.split()
+
+        ## these come after a template
+        s = string.split('>')[-1]
+        result[ 'pointer' ] += s.count('*')
+        result[ 'reference' ] += s.count('&')
+
+
+        x = string; alias = False
+        for a in '* & const static mutable'.split(): x = x.replace(a,'')
+        for y in x.split():
+            if y not in self.C_FUNDAMENTAL: alias = y; break
+
+        #if alias == 'class':
+        #    result['class'] = result['name']    # forward decl of class
+        #    result['forward_decl'] = True
+        if alias == '__extension__': result['fundamental_extension'] = True
+        elif alias:
+            result['aliases'].append( alias )
+            if alias in C99_NONSTANDARD:
+                result['type'] = C99_NONSTANDARD[ alias ]
+                result['typedef'] = alias
+                result['typedefs'] += 1
+            elif alias in self.typedefs:
+                result['typedefs'] += 1
+                result['typedef'] = alias
+                self.resolve_type( self.typedefs[alias], result )
+            elif alias in self.classes:
+                klass = self.classes[alias]; result['fundamental'] = False
+                result['class'] = klass
+                result['unresolved'] = False
+            else: result['unresolved'] = True
+        else:
+            result['fundamental'] = True
+            result['unresolved'] = False
+
+
+    def finalize_vars(self):
+        for s in CppStruct.Structs:    # vars within structs can be ignored if they do not resolve
+            for var in s['fields']: var['parent'] = s['type']
+        #for c in self.classes.values():
+        #    for var in c.get_all_properties(): var['parent'] = c['name']
+
+        ## RESOLVE ##
+        for var in CppVariable.Vars:
+            self.resolve_type( var['type'], var )
+            #if 'method' in var and var['method']['name'] ==  '_notifyCurrentCamera': print(var); assert 0
+
+        # then find concrete type and best guess ctypes type #
+        for var in CppVariable.Vars:    
+            if not var['aliases']:    #var['fundamental']:
+                var['ctypes_type'] = self.guess_ctypes_type( var['type'] )
+            else:
+                var['unresolved'] = False    # below may test to True
+                if var['class']:
+                    var['ctypes_type'] = 'ctypes.c_void_p'
+                else:
+                    assert var['aliases']
+                    tag = var['aliases'][0]
+
+                    klass = None
+                    nestedEnum = None
+                    nestedStruct = None
+                    nestedTypedef = None
+                    if 'method' in var and 'parent' in list(var['method'].keys()):
+                        klass = var['method']['parent']
+                        if tag in var['method']['parent']._public_enums:
+                            nestedEnum = var['method']['parent']._public_enums[ tag ]
+                        elif tag in var['method']['parent']._public_structs:
+                            nestedStruct = var['method']['parent']._public_structs[ tag ]
+                        elif tag in var['method']['parent']._public_typedefs:
+                            nestedTypedef = var['method']['parent']._public_typedefs[ tag ]
+
+
+                    if '<' in tag:    # should also contain '>'
+                        var['template'] = tag        # do not resolve templates
+                        var['ctypes_type'] = 'ctypes.c_void_p'
+                        var['unresolved'] = True
+
+                    elif nestedEnum:
+                        enum = nestedEnum
+                        if enum['type'] is int:
+                            var['ctypes_type'] = 'ctypes.c_int'
+                            var['raw_type'] = 'int'
+
+                        elif enum['type'] is str:
+                            var['ctypes_type'] = 'ctypes.c_char_p'
+                            var['raw_type'] = 'char*'
+
+                        var['enum'] = var['method']['path'] + '::' + enum['name']
+                        var['fundamental'] = True
+
+                    elif nestedStruct:
+                        var['ctypes_type'] = 'ctypes.c_void_p'
+                        var['raw_type'] = var['method']['path'] + '::' + nestedStruct['type']
+                        var['fundamental'] = False
+
+                    elif nestedTypedef:
+                        var['fundamental'] = is_fundamental( nestedTypedef )
+                        if not var['fundamental']:
+                            var['raw_type'] = var['method']['path'] + '::' + tag
+
+                    else:
+                        _tag = tag
+                        if '::' in tag and tag.split('::')[0] in self.namespaces: tag = tag.split('::')[-1]
+                        con = self.concrete_typedef( _tag )
+                        if con:
+                            var['concrete_type'] = con
+                            var['ctypes_type'] = self.guess_ctypes_type( var['concrete_type'] )
+
+                        elif tag in self.structs:
+                            trace_print( 'STRUCT', var )
+                            var['struct'] = tag
+                            var['ctypes_type'] = 'ctypes.c_void_p'
+                            var['raw_type'] = self.structs[tag]['namespace'] + '::' + tag
+
+                        elif tag in self._forward_decls:
+                            var['forward_declared'] = tag
+                            var['ctypes_type'] = 'ctypes.c_void_p'
+
+                        elif tag in self.global_enums:
+                            enum = self.global_enums[ tag ]
+                            if enum['type'] is int:
+                                var['ctypes_type'] = 'ctypes.c_int'
+                                var['raw_type'] = 'int'
+                            elif enum['type'] is str:
+                                var['ctypes_type'] = 'ctypes.c_char_p'
+                                var['raw_type'] = 'char*'
+                            var['enum'] = enum['namespace'] + enum['name']
+                            var['fundamental'] = True
+
+
+                        elif var['parent']:
+                            warning_print( 'WARN unresolved %s'%_tag)
+                            var['ctypes_type'] = 'ctypes.c_void_p'
+                            var['unresolved'] = True
+
+
+                        elif tag.count('::')==1:
+                            trace_print( 'trying to find nested something in', tag )
+                            a = tag.split('::')[0]
+                            b = tag.split('::')[-1]
+                            if a in self.classes:    # a::b is most likely something nested in a class
+                                klass = self.classes[ a ]
+                                if b in klass._public_enums:
+                                    trace_print( '...found nested enum', b )
+                                    enum = klass._public_enums[ b ]
+                                    if enum['type'] is int:
+                                        var['ctypes_type'] = 'ctypes.c_int'
+                                        var['raw_type'] = 'int'
+                                    elif enum['type'] is str:
+                                        var['ctypes_type'] = 'ctypes.c_char_p'
+                                        var['raw_type'] = 'char*'
+                                    try:
+                                        if 'method' in var: var['enum'] = var['method']['path'] + '::' + enum['name']
+                                        else:    # class property
+                                            var['unresolved'] = True
+                                    except:
+                                        var['unresolved'] = True
+                                        
+                                    var['fundamental'] = True
+
+                                else: var['unresolved'] = True    # TODO klass._public_xxx
+
+                            elif a in self.namespaces:    # a::b can also be a nested namespace
+                                if b in self.global_enums:
+                                    enum = self.global_enums[ b ]
+                                    trace_print(enum)
+                                trace_print(var)
+                                assert 0
+
+                            elif b in self.global_enums:        # falling back, this is a big ugly
+                                enum = self.global_enums[ b ]
+                                assert a in enum['namespace'].split('::')
+                                if enum['type'] is int:
+                                    var['ctypes_type'] = 'ctypes.c_int'
+                                    var['raw_type'] = 'int'
+                                elif enum['type'] is str:
+                                    var['ctypes_type'] = 'ctypes.c_char_p'
+                                    var['raw_type'] = 'char*'
+                                var['fundamental'] = True
+
+                            else:    # boost::gets::crazy
+                                trace_print('NAMESPACES', self.namespaces)
+                                trace_print( a, b )
+                                trace_print( '---- boost gets crazy ----' )
+                                var['ctypes_type'] = 'ctypes.c_void_p'
+                                var['unresolved'] = True
+
+
+                        elif 'namespace' in var and self.concrete_typedef(var['namespace']+tag):
+                            #print( 'TRYING WITH NS', var['namespace'] )
+                            con = self.concrete_typedef( var['namespace']+tag )
+                            if con:
+                                var['typedef'] = var['namespace']+tag
+                                var['type'] = con
+                                if 'struct' in con.split():
+                                    var['raw_type'] = var['typedef']
+                                    var['ctypes_type'] = 'ctypes.c_void_p'
+                                else:
+                                    self.resolve_type( var['type'], var )
+                                    var['ctypes_type'] = self.guess_ctypes_type( var['type'] )
+
+                        elif '::' in var:
+                            var['ctypes_type'] = 'ctypes.c_void_p'
+                            var['unresolved'] = True
+
+                        elif tag in self.SubTypedefs:    # TODO remove SubTypedefs
+                            if 'property_of_class' in var or 'property_of_struct' in var:
+                                trace_print( 'class:', self.SubTypedefs[ tag ], 'tag:', tag )
+                                var['typedef'] = self.SubTypedefs[ tag ]    # class name
+                                var['ctypes_type'] = 'ctypes.c_void_p'
+                            else:
+                                trace_print( "WARN-this should almost never happen!" )
+                                trace_print( var ); trace_print('-'*80)
+                                var['unresolved'] = True
+
+                        elif tag in self._template_typenames:
+                            var['typename'] = tag
+                            var['ctypes_type'] = 'ctypes.c_void_p'
+                            var['unresolved'] = True    # TODO, how to deal with templates?
+
+                        elif tag.startswith('_'):    # assume starting with underscore is not important for wrapping
+                            warning_print( 'WARN unresolved %s'%_tag)
+                            var['ctypes_type'] = 'ctypes.c_void_p'
+                            var['unresolved'] = True
+
+                        else:
+                            trace_print( 'WARN: unknown type', var )
+                            assert 'property_of_class' in var or 'property_of_struct'    # only allow this case
+                            var['unresolved'] = True
+
+
+                    ## if not resolved and is a method param, not going to wrap these methods  ##
+                    if var['unresolved'] and 'method' in var: var['method']['unresolved_parameters'] = True
+
+
+        # create stripped raw_type #
+        p = '* & const static mutable'.split()        # +++ new July7: "mutable"
+        for var in CppVariable.Vars:
+            if 'raw_type' not in var:
+                raw = []
+                for x in var['type'].split():
+                    if x not in p: raw.append( x )
+                var['raw_type'] = ' '.join( raw )
+
+                #if 'AutoConstantEntry' in var['raw_type']: print(var); assert 0
+                if var['class']:
+                    if '::' not in var['raw_type']:
+                        if not var['class']['parent']:
+                            var['raw_type'] = var['class']['namespace'] + '::' + var['raw_type']
+                        elif var['class']['parent'] in self.classes:
+                            parent = self.classes[ var['class']['parent'] ]
+                            var['raw_type'] = parent['namespace'] + '::' + var['class']['name'] + '::' + var['raw_type']
+                        else:
+                            var['unresolved'] = True
+
+                    elif '::' in var['raw_type'] and var['raw_type'].split('::')[0] not in self.namespaces:
+                        var['raw_type'] = var['class']['namespace'] + '::' + var['raw_type']
+                    else:
+                        var['unresolved'] = True
+
+                elif 'forward_declared' in var and 'namespace' in var:
+                    if '::' not in var['raw_type']:
+                        var['raw_type'] = var['namespace'] + var['raw_type']
+                    elif '::' in var['raw_type'] and var['raw_type'].split('::')[0] in self.namespaces:
+                        pass
+                    else: trace_print('-'*80); trace_print(var); raise NotImplemented
+
+
+            ## need full name space for classes in raw type ##
+            if var['raw_type'].startswith( '::' ):
+                #print(var)
+                #print('NAMESPACE', var['class']['namespace'])
+                #print( 'PARENT NS', var['class']['parent']['namespace'] )
+                #assert 0
+                var['unresolved'] = True
+                if 'method' in var: var['method']['unresolved_parameters'] = True
+                #var['raw_type'] = var['raw_type'][2:]
+        
+        # Take care of #defines and #pragmas etc
+        trace_print("Processing precomp_macro_buf: %s"%self._precomp_macro_buf)
+        for m in self._precomp_macro_buf:
+            macro = m.replace("<CppHeaderParser_newline_temp_replacement>\\n", "\n")
+            try:
+                if macro.lower().startswith("#define"):
+                    trace_print("Adding #define %s"%macro)
+                    self.defines.append(macro.split(" ", 1)[1].strip())
+                elif macro.lower().startswith("#pragma"):
+                    trace_print("Adding #pragma %s"%macro)
+                    self.pragmas.append(macro.split(" ", 1)[1].strip())
+                elif macro.lower().startswith("#include"):
+                    trace_print("Adding #include %s"%macro)
+                    self.includes.append(macro.split(" ", 1)[1].strip())
+                else:
+                    debug_print("Cant detect what to do with precomp macro '%s'"%macro)
+            except: pass
+        self._precomp_macro_buf = None
+        
+
+    def concrete_typedef( self, key ):
+        if key not in self.typedefs:
+            #print( 'FAILED typedef', key )
+            return None
+        while key in self.typedefs:
+            prev = key
+            key = self.typedefs[ key ]
+            if '<' in key or '>' in key: return prev        # stop at template
+            if key.startswith('std::'): return key        # stop at std lib
+        return key
+
+
+class _CppHeader( Resolver ):
+    def finalize(self):
+        self.finalize_vars()
+        # finalize classes and method returns types
+        for cls in list(self.classes.values()):
+            for meth in cls.get_all_methods():
+                if meth['pure_virtual']: cls['abstract'] = True
+
+                if not meth['returns_fundamental'] and meth['returns'] in C99_NONSTANDARD:
+                    meth['returns'] = C99_NONSTANDARD[meth['returns']]
+                    meth['returns_fundamental'] = True
+
+                elif not meth['returns_fundamental']:    # describe the return type
+                    con = None
+                    if cls['namespace'] and '::' not in meth['returns']:
+                        con = self.concrete_typedef( cls['namespace'] + '::' + meth['returns'] )
+                    else: con = self.concrete_typedef( meth['returns'] )
+
+
+                    if con:
+                        meth['returns_concrete'] = con
+                        meth['returns_fundamental'] = is_fundamental( con )
+
+                    elif meth['returns'] in self.classes:
+                        trace_print( 'meth returns class:', meth['returns'] )
+                        meth['returns_class'] = True
+
+                    elif meth['returns'] in self.SubTypedefs:
+                        meth['returns_class'] = True
+                        meth['returns_nested'] = self.SubTypedefs[ meth['returns'] ]
+
+                    elif meth['returns'] in cls._public_enums:
+                        enum = cls._public_enums[ meth['returns'] ]
+                        meth['returns_enum'] = enum['type']
+                        meth['returns_fundamental'] = True
+                        if enum['type'] == int: meth['returns'] = 'int'
+                        else: meth['returns'] = 'char*'
+
+                    elif meth['returns'] in self.global_enums:
+                        enum = self.global_enums[ meth['returns'] ]
+                        meth['returns_enum'] = enum['type']
+                        meth['returns_fundamental'] = True
+                        if enum['type'] == int: meth['returns'] = 'int'
+                        else: meth['returns'] = 'char*'
+
+                    elif meth['returns'].count('::')==1:
+                        trace_print( meth )
+                        a,b = meth['returns'].split('::')
+                        if a in self.namespaces:
+                            if b in self.classes:
+                                klass = self.classes[ b ]
+                                meth['returns_class'] = a + '::' + b
+                            elif '<' in b and '>' in b:
+                                warning_print( 'WARN-can not return template: %s'%b )
+                                meth['returns_unknown'] = True
+                            elif b in self.global_enums:
+                                enum = self.global_enums[ b ]
+                                meth['returns_enum'] = enum['type']
+                                meth['returns_fundamental'] = True
+                                if enum['type'] == int: meth['returns'] = 'int'
+                                else: meth['returns'] = 'char*'
+
+                            else: trace_print( a, b); trace_print( meth); meth['returns_unknown'] = True    # +++
+
+                        elif a in self.classes:
+                            klass = self.classes[ a ]
+                            if b in klass._public_enums:
+                                trace_print( '...found nested enum', b )
+                                enum = klass._public_enums[ b ]
+                                meth['returns_enum'] = enum['type']
+                                meth['returns_fundamental'] = True
+                                if enum['type'] == int: meth['returns'] = 'int'
+                                else: meth['returns'] = 'char*'
+
+                            elif b in klass._public_forward_declares:
+                                meth['returns_class'] = True
+
+                            elif b in klass._public_typedefs:
+                                typedef = klass._public_typedefs[ b ]
+                                meth['returns_fundamental'] = is_fundamental( typedef )
+
+                            else:
+                                trace_print( meth )    # should be a nested class, TODO fix me.
+                                meth['returns_unknown'] = True
+
+                    elif '::' in meth['returns']:
+                        trace_print('TODO namespace or extra nested return:', meth)
+                        meth['returns_unknown'] = True
+                    else:
+                        trace_print( 'WARN: UNKNOWN RETURN', meth['name'], meth['returns'])
+                        meth['returns_unknown'] = True
+
+        for cls in list(self.classes.values()):
+            methnames = cls.get_all_method_names()
+            pvm = cls.get_all_pure_virtual_methods()
+
+            for d in cls['inherits']:
+                c = d['class']
+                a = d['access']    # do not depend on this to be 'public'
+                trace_print( 'PARENT CLASS:', c )
+                if c not in self.classes: trace_print('WARN: parent class not found')
+                if c in self.classes and self.classes[c]['abstract']:
+                    p = self.classes[ c ]
+                    for meth in p.get_all_methods():    #p["methods"]["public"]:
+                        trace_print( '\t\tmeth', meth['name'], 'pure virtual', meth['pure_virtual'] )
+                        if meth['pure_virtual'] and meth['name'] not in methnames: cls['abstract'] = True; break
+
+
+
+
+
+    def evaluate_struct_stack(self):
+        """Create a Struct out of the name stack (but not its parts)"""
+        #print( 'eval struct stack', self.nameStack )
+        #if self.braceDepth != len(self.nameSpaces): return
+        struct = CppStruct(self.nameStack)
+        struct["namespace"] = self.cur_namespace()
+        self.structs[ struct['type'] ] = struct
+        self.structs_order.append( struct )
+        if self.curClass:
+            struct['parent'] = self.curClass
+            klass = self.classes[ self.curClass ]
+            klass['structs'][self.curAccessSpecifier].append( struct )
+            if self.curAccessSpecifier == 'public': klass._public_structs[ struct['type'] ] = struct
+        self.curStruct = struct
+        self._structs_brace_level[ struct['type'] ] = self.braceDepth
+
+    
+    def parse_method_type( self, stack ):
+        trace_print( 'meth type info', stack )
+        if stack[0] in ':;': stack = stack[1:]
+        info = { 
+            'debug': ' '.join(stack).replace(' : : ', '::' ).replace(' < ', '<' ).replace(' > ', '> ' ).replace(" >",">").replace(">>", "> >").replace(">>", "> >"), 
+            'class':None, 
+            'namespace':self.cur_namespace(add_double_colon=True),
+        }
+
+        for tag in 'defined pure_virtual operator constructor destructor extern template virtual static explicit inline friend returns returns_pointer returns_fundamental returns_class'.split(): info[tag]=False
+        header = stack[ : stack.index('(') ]
+        header = ' '.join( header )
+        header = header.replace(' : : ', '::' )
+        header = header.replace(' < ', '<' )
+        header = header.replace(' > ', '> ' )
+        header = header.strip()
+
+        if '{' in stack:
+            info['defined'] = True
+            self._method_body = self.braceDepth + 1
+            trace_print( 'NEW METHOD WITH BODY', self.braceDepth )
+        elif stack[-1] == ';':
+            info['defined'] = False
+            self._method_body = None    # not a great idea to be clearing here
+        else: assert 0
+
+        if len(stack) > 3 and stack[-1] == ';' and stack[-2] == '0' and stack[-3] == '=':
+            info['pure_virtual'] = True
+
+        r = header.split()
+        name = None
+        if 'operator' in stack:    # rare case op overload defined outside of class
+            op = stack[ stack.index('operator')+1 : stack.index('(') ]
+            op = ''.join(op)
+            if not op:
+                if " ".join(['operator', '(', ')', '(']) in " ".join(stack):
+                    op = "()"
+                else:
+                    trace_print( 'Error parsing operator')
+                    return None
+            
+            info['operator'] = op
+            name = 'operator' + op
+            a = stack[ : stack.index('operator') ]
+
+        elif r:
+            name = r[-1]
+            a = r[ : -1 ]    # strip name
+
+        if name is None: return None
+        #if name.startswith('~'): name = name[1:]
+
+        while a and a[0] == '}':    # strip - can have multiple } }
+            a = a[1:]
+
+
+        if '::' in name:
+            #klass,name = name.split('::')    # methods can be defined outside of class
+            klass = name[ : name.rindex('::') ]
+            name = name.split('::')[-1]
+            info['class'] = klass
+            if klass in self.classes and not self.curClass:
+                 #Class function defined outside the class
+                return None
+        #    info['name'] = name
+        #else: info['name'] = name
+
+        if name.startswith('~'):
+            info['destructor'] = True
+            name = name[1:]
+        elif not a or (name == self.curClass and len(self.curClass)):
+            info['constructor'] = True
+
+        info['name'] = name
+
+        for tag in 'extern virtual static explicit inline friend'.split():
+            if tag in a: info[ tag ] = True; a.remove( tag )    # inplace
+        if 'template' in a:
+            a.remove('template')
+            b = ' '.join( a )
+            if '>' in b:
+                info['template'] = b[ : b.index('>')+1 ]
+                info['returns'] = b[ b.index('>')+1 : ]    # find return type, could be incorrect... TODO
+                if '<typename' in info['template'].split():
+                    typname = info['template'].split()[-1]
+                    typname = typname[ : -1 ]    # strip '>'
+                    if typname not in self._template_typenames: self._template_typenames.append( typname )
+            else: info['returns'] = ' '.join( a )
+        else: info['returns'] = ' '.join( a )
+        info['returns'] = info['returns'].replace(' <', '<').strip()
+
+        ## be careful with templates, do not count pointers inside template
+        info['returns_pointer'] = info['returns'].split('>')[-1].count('*')
+        if info['returns_pointer']: info['returns'] = info['returns'].replace('*','').strip()
+
+        info['returns_reference'] = '&' in info['returns']
+        if info['returns']: info['returns'] = info['returns'].replace('&','').strip()
+
+        a = []
+        for b in info['returns'].split():
+            if b == '__const__': info['returns_const'] = True
+            elif b == 'const': info['returns_const'] = True
+            else: a.append( b )
+        info['returns'] = ' '.join( a )
+
+        info['returns_fundamental'] = is_fundamental( info['returns'] )
+        return info
+
+    def evaluate_method_stack(self):
+        """Create a method out of the name stack"""
+
+        if self.curStruct:
+            trace_print( 'WARN - struct contains methods - skipping' )
+            trace_print( self.stack )
+            assert 0
+
+        info = self.parse_method_type( self.stack )
+        if info:
+            if info[ 'class' ] and info['class'] in self.classes:     # case where methods are defined outside of class
+                newMethod = CppMethod(self.nameStack, info['name'], info)
+                klass = self.classes[ info['class'] ]
+                klass[ 'methods' ][ 'public' ].append( newMethod )
+                newMethod['parent'] = klass
+                if klass['namespace']: newMethod['path'] = klass['namespace'] + '::' + klass['name']
+                else: newMethod['path'] = klass['name']
+                
+            elif self.curClass:    # normal case
+                newMethod = CppMethod(self.nameStack, self.curClass, info)
+                klass = self.classes[self.curClass]
+                klass['methods'][self.curAccessSpecifier].append(newMethod)
+                newMethod['parent'] = klass
+                if klass['namespace']: newMethod['path'] = klass['namespace'] + '::' + klass['name']
+                else: newMethod['path'] = klass['name']
+            else: #non class functions
+                debug_print("FREE FUNCTION")
+                newMethod = CppMethod(self.nameStack, None, info)
+                self.functions.append(newMethod)
+            global parseHistory
+            parseHistory.append({"braceDepth": self.braceDepth, "item_type": "method", "item": newMethod})
+        else:
+            trace_print( 'free function?', self.nameStack )
+
+        self.stack = []
+
+    def _parse_typedef( self, stack, namespace='' ):
+        if not stack or 'typedef' not in stack: return
+        stack = list( stack )    # copy just to be safe
+        if stack[-1] == ';': stack.pop()
+
+        while stack and stack[-1].isdigit(): stack.pop()    # throw away array size for now
+
+        idx = stack.index('typedef')
+        name = namespace + stack[-1]
+        s = ''
+        for a in stack[idx+1:-1]:
+            if a == '{': break
+            if not s or s[-1] in ':<>' or a in ':<>': s += a    # keep compact
+            else: s += ' ' + a    # spacing
+
+        r = {'name':name, 'raw':s, 'type':s}
+        if not is_fundamental(s):
+            if 'struct' in s.split(): pass        # TODO is this right? "struct ns::something"
+            elif '::' not in s: s = namespace + s         # only add the current name space if no namespace given
+            r['type'] = s
+        if s: return r
+
+
+    def evaluate_typedef(self):
+        ns = self.cur_namespace(add_double_colon=True)
+        res = self._parse_typedef( self.stack, ns )
+        if res:
+            name = res['name']
+            self.typedefs[ name ] = res['type']
+            if name not in self.typedefs_order: self.typedefs_order.append( name )
+
+
+    def evaluate_property_stack(self):
+        """Create a Property out of the name stack"""
+        global parseHistory
+        assert self.stack[-1] == ';'
+        if self.nameStack[0] == 'typedef':
+            if self.curClass:
+                typedef = self._parse_typedef( self.stack )
+                name = typedef['name']
+                klass = self.classes[ self.curClass ]
+                klass[ 'typedefs' ][ self.curAccessSpecifier ].append( name )
+                if self.curAccessSpecifier == 'public': klass._public_typedefs[ name ] = typedef['type']
+                Resolver.SubTypedefs[ name ] = self.curClass
+            else: assert 0
+        elif self.curStruct or self.curClass:
+            if len(self.nameStack) == 1:
+                #See if we can de anonymize the type
+                filteredParseHistory = [h for h in parseHistory if h["braceDepth"] == self.braceDepth]
+                if len(filteredParseHistory) and filteredParseHistory[-1]["item_type"] == "class":
+                    self.nameStack.insert(0, filteredParseHistory[-1]["item"]["name"])
+                    debug_print("DEANONYMOIZING %s to type '%s'"%(self.nameStack[1], self.nameStack[0]))
+            if "," in self.nameStack: #Maybe we have a variable list
+                #Figure out what part is the variable separator but remember templates of function pointer
+                #First find left most comma outside of a > and )
+                leftMostComma = 0;
+                for i in range(0, len(self.nameStack)):
+                    name = self.nameStack[i]
+                    if name in (">", ")"): leftMostComma = 0
+                    if leftMostComma == 0 and name == ",": leftMostComma = i
+                # Is it really a list of variables?
+                if leftMostComma != 0:
+                    trace_print("Multiple variables for namestack in %s.  Separating processing"%self.nameStack)
+                    orig_nameStack = self.nameStack[:]
+                    orig_stack = self.stack[:]
+                    
+                    type_nameStack = orig_nameStack[:leftMostComma-1]
+                    for name in orig_nameStack[leftMostComma - 1::2]:
+                        self.nameStack = type_nameStack + [name]
+                        self.stack = orig_stack[:] # Not maintained for mucking, but this path it doesnt matter
+                        self.evaluate_property_stack()
+                    return
+
+            newVar = CppVariable(self.nameStack)
+            newVar['namespace'] = self.current_namespace()
+            if self.curStruct:
+                self.curStruct[ 'fields' ].append( newVar )
+                newVar['property_of_struct'] = self.curStruct
+            elif self.curClass:
+                klass = self.classes[self.curClass]
+                klass["properties"][self.curAccessSpecifier].append(newVar)
+                newVar['property_of_class'] = klass['name']
+            parseHistory.append({"braceDepth": self.braceDepth, "item_type": "variable", "item": newVar})
+
+        self.stack = []        # CLEAR STACK
+
+    def evaluate_class_stack(self):
+        """Create a Class out of the name stack (but not its parts)"""
+        #dont support sub classes today
+        #print( 'eval class stack', self.nameStack )
+        parent = self.curClass
+        if self.braceDepth > len( self.nameSpaces) and parent:
+            trace_print( 'HIT NESTED SUBCLASS' )
+            self.accessSpecifierStack.append(self.curAccessSpecifier)
+        elif self.braceDepth != len(self.nameSpaces):
+            error_print( 'ERROR: WRONG BRACE DEPTH' )
+            return
+        
+        if self.nameStack[0] == "class":
+            self.curAccessSpecifier = 'private'
+        else:#struct
+            self.curAccessSpecifier = 'public'
+        debug_print("curAccessSpecifier changed/defaulted to %s"%self.curAccessSpecifier)
+        if self.nameStack[0] == "union":
+            newClass = CppUnion(self.nameStack)
+            self.anon_union_counter = [self.braceDepth, 2]
+            trace_print( 'NEW UNION', newClass['name'] )
+        else:
+            newClass = CppClass(self.nameStack)
+            trace_print( 'NEW CLASS', newClass['name'] )
+        newClass["declaration_method"] = self.nameStack[0]
+        self.classes_order.append( newClass )    # good idea to save ordering
+        self.stack = []        # fixes if class declared with ';' in closing brace
+        if parent:
+            newClass["namespace"] = self.classes[ parent ]['namespace'] + '::' + parent
+            newClass['parent'] = parent
+            self.classes[ parent ]['nested_classes'].append( newClass )
+            ## supports nested classes with the same name ##
+            self.curClass = key = parent+'::'+newClass['name']
+            self._classes_brace_level[ key ] = self.braceDepth
+
+        elif newClass['parent']:        # nested class defined outside of parent.  A::B {...}
+            parent = newClass['parent']
+            newClass["namespace"] = self.classes[ parent ]['namespace'] + '::' + parent
+            self.classes[ parent ]['nested_classes'].append( newClass )
+            ## supports nested classes with the same name ##
+            self.curClass = key = parent+'::'+newClass['name']
+            self._classes_brace_level[ key ] = self.braceDepth
+
+        else:
+            newClass["namespace"] = self.cur_namespace()
+            key = newClass['name']
+            self.curClass = newClass["name"]
+            self._classes_brace_level[ newClass['name'] ] = self.braceDepth
+
+        if not key.endswith("::") and not key.endswith(" ") and len(key) != 0:
+            if key in self.classes:
+                trace_print( 'ERROR name collision:', key )
+                self.classes[key].show()
+                trace_print('-'*80)
+                newClass.show()            
+                assert key not in self.classes    # namespace collision
+        self.classes[ key ] = newClass
+        global parseHistory
+        parseHistory.append({"braceDepth": self.braceDepth, "item_type": "class", "item": newClass})
+    
+
+    def evalute_forward_decl(self):
+        trace_print( 'FORWARD DECL', self.nameStack )
+        assert self.nameStack[0] in ('class', 'struct')
+        name = self.nameStack[-1]
+        if self.curClass:
+            klass = self.classes[ self.curClass ]
+            klass['forward_declares'][self.curAccessSpecifier].append( name )
+            if self.curAccessSpecifier == 'public': klass._public_forward_declares.append( name )
+        else: self._forward_decls.append( name )
+
+class CppHeader( _CppHeader ):
+    """Parsed C++ class header
+    
+    Variables produced:
+    self.classes - Dictionary of classes found in a given header file where the
+        key is the name of the class
+    """
+    IGNORE_NAMES = '__extension__'.split()
+   
+    def show(self):
+        for className in list(self.classes.keys()):self.classes[className].show()
+
+    def __init__(self, headerFileName, argType="file", **kwargs):
+        """Create the parsed C++ header file parse tree
+        
+        headerFileName - Name of the file to parse OR actual file contents (depends on argType)
+        argType - Indicates how to interpret headerFileName as a file string or file name
+        kwargs - Supports the following keywords
+        """
+        ## reset global state ##
+        global doxygenCommentCache
+        doxygenCommentCache = ""
+        CppVariable.Vars = []
+        CppStruct.Structs = []
+
+        if (argType == "file"):
+            self.headerFileName = os.path.expandvars(headerFileName)
+            self.mainClass = os.path.split(self.headerFileName)[1][:-2]
+            headerFileStr = ""
+        elif argType == "string":
+            self.headerFileName = ""
+            self.mainClass = "???"
+            headerFileStr = headerFileName
+        else:
+            raise Exception("Arg type must be either file or string")
+        self.curClass = ""
+       
+        # nested classes have parent::nested, but no extra namespace,
+        # this keeps the API compatible, TODO proper namespace for everything. 
+        Resolver.CLASSES = {}
+        self.classes = Resolver.CLASSES
+        #Functions that are not part of a class
+        self.functions = []
+        
+        self.pragmas = []
+        self.defines = []
+        self.includes = []
+        self._precomp_macro_buf = [] #for internal purposes, will end up filling out pragmras and defines at the end
+
+        self.enums = []
+        self.global_enums = {}
+        self.nameStack = []
+        self.nameSpaces = []
+        self.curAccessSpecifier = 'private'    # private is default
+        self.accessSpecifierStack = []
+        self.accessSpecifierScratch = []
+        debug_print("curAccessSpecifier changed/defaulted to %s"%self.curAccessSpecifier)
+        self.initextra()
+    
+        self.anon_union_counter = [-1, 0]
+    
+        if (len(self.headerFileName)):
+            fd = open(self.headerFileName)
+            headerFileStr = "".join(fd.readlines())
+            fd.close()     
+        
+        # Make sure supportedAccessSpecifier are sane
+        for i in range(0, len(supportedAccessSpecifier)):
+            if " " not in supportedAccessSpecifier[i]: continue
+            supportedAccessSpecifier[i] = re.sub("[ ]+", " ", supportedAccessSpecifier[i]).strip()
+        
+        # Strip out template declarations
+        headerFileStr = re.sub("template[\t ]*<[^>]*>", "", headerFileStr)
+
+        # Change multi line #defines and expressions to single lines maintaining line nubmers
+        # Based from http://stackoverflow.com/questions/2424458/regular-expression-to-match-cs-multiline-preprocessor-statements
+        matches = re.findall(r'(?m)^(?:.*\\\r?\n)+.*$', headerFileStr)
+        is_define = re.compile(r'[ \t\v]*#[Dd][Ee][Ff][Ii][Nn][Ee]')
+        for m in matches:
+            #Keep the newlines so that linecount doesnt break
+            num_newlines = len([a for a in m if a=="\n"])
+            if is_define.match(m):
+                new_m = m.replace("\n", "<CppHeaderParser_newline_temp_replacement>\\n")
+            else:
+                # Just expression taking up multiple lines, make it take 1 line for easier parsing
+                new_m = m.replace("\\\n", " ")
+            if (num_newlines > 0):
+                new_m += "\n"*(num_newlines)
+            headerFileStr = headerFileStr.replace(m, new_m)
+        
+        #Filter out Extern "C" statements.  These are order dependent
+        matches = re.findall(re.compile(r'extern[\t ]+"[Cc]"[\t \n\r]*{', re.DOTALL), headerFileStr)
+        for m in matches:
+            #Keep the newlines so that linecount doesnt break
+            num_newlines = len([a for a in m if a=="\n"])
+            headerFileStr = headerFileStr.replace(m, "\n" * num_newlines)        
+        headerFileStr = re.sub(r'extern[ ]+"[Cc]"[ ]*', "", headerFileStr)
+                
+        #Filter out any ignore symbols that end with "()" to account for #define magic functions
+        for ignore in ignoreSymbols:
+            if not ignore.endswith("()"): continue
+            while True:
+                locStart = headerFileStr.find(ignore[:-1])
+                if locStart == -1:
+                    break;
+                locEnd = None
+                #Now walk till we find the last paren and account for sub parens
+                parenCount = 1
+                inQuotes = False
+                for i in range(locStart + len(ignore) - 1, len(headerFileStr)):
+                    c = headerFileStr[i]
+                    if not inQuotes:
+                        if c == "(":
+                            parenCount += 1
+                        elif c == ")":
+                            parenCount -= 1
+                        elif c == '"':
+                            inQuotes = True
+                        if parenCount == 0:
+                            locEnd = i + 1
+                            break;
+                    else:
+                        if c == '"' and headerFileStr[i-1] != '\\':
+                            inQuotes = False
+                        
+                if locEnd:
+                    #Strip it out but keep the linecount the same so line numbers are right
+                    match_str = headerFileStr[locStart:locEnd]
+                    debug_print("Striping out '%s'"%match_str)
+                    num_newlines = len([a for a in match_str if a=="\n"])
+                    headerFileStr = headerFileStr.replace(headerFileStr[locStart:locEnd], "\n"*num_newlines)
+        
+        self.braceDepth = 0
+        lex.lex()
+        lex.input(headerFileStr)
+        global curLine
+        global curChar
+        curLine = 0
+        curChar = 0
+        try:
+            while True:
+                tok = lex.token()
+                if not tok: break
+                if self.anon_union_counter[0] == self.braceDepth and self.anon_union_counter[1]:
+                    self.anon_union_counter[1] -= 1
+                tok.value = TagStr(tok.value, lineno=tok.lineno)
+                #debug_print("TOK: %s"%tok)
+                if tok.type == 'NAME' and tok.value in self.IGNORE_NAMES: continue
+                self.stack.append( tok.value )
+                curLine = tok.lineno
+                curChar = tok.lexpos
+                if (tok.type in ('PRECOMP_MACRO', 'PRECOMP_MACRO_CONT')):
+                    debug_print("PRECOMP: %s"%tok)
+                    self._precomp_macro_buf.append(tok.value)
+                    self.stack = []
+                    self.nameStack = []
+                    continue
+                if (tok.type == 'OPEN_BRACE'):
+                    if len(self.nameStack) >= 2 and is_namespace(self.nameStack):    # namespace {} with no name used in boost, this sets default?
+                        if self.nameStack[1] == "__IGNORED_NAMESPACE__CppHeaderParser__":#Used in filtering extern "C"
+                            self.nameStack[1] = ""
+                        self.nameSpaces.append(self.nameStack[1])
+                        ns = self.cur_namespace(); self.stack = []
+                        if ns not in self.namespaces: self.namespaces.append( ns )
+                    # Detect special condition of macro magic before class declaration so we
+                    # can filter it out
+                    if 'class' in self.nameStack and self.nameStack[0] != 'class':
+                        classLocationNS = self.nameStack.index("class")
+                        classLocationS = self.stack.index("class")
+                        if "(" not in self.nameStack[classLocationNS:]:
+                            debug_print("keyword 'class' found in unexpected location in nameStack, must be following #define magic.  Process that before moving on")
+                            origNameStack = self.nameStack
+                            origStack = self.stack
+                            #Process first part of stack which is probably #define macro magic and may cause issues
+                            self.nameStack = self.nameStack[:classLocationNS]
+                            self.stack = self.stack[:classLocationS]
+                            try:
+                                self.evaluate_stack()
+                            except:
+                                debug_print("Error processing #define magic... Oh well")
+                            #Process rest of stack
+                            self.nameStack = origNameStack[classLocationNS:]
+                            self.stack = origStack[classLocationS:]
+                        
+                    
+                    if len(self.nameStack) and not is_enum_namestack(self.nameStack):
+                        self.evaluate_stack()
+                    else:
+                        self.nameStack.append(tok.value)
+                    if self.stack and self.stack[0] == 'class': self.stack = []
+                    self.braceDepth += 1
+                    
+                elif (tok.type == 'CLOSE_BRACE'):
+                    if self.braceDepth == 0:
+                        continue
+                    if (self.braceDepth == len(self.nameSpaces)):
+                        tmp = self.nameSpaces.pop()
+                        self.stack = []    # clear stack when namespace ends?
+                    if len(self.nameStack) and is_enum_namestack(self.nameStack):
+                        self.nameStack.append(tok.value)
+                    elif self.braceDepth < 10:
+                        self.evaluate_stack()
+                    else:
+                        self.nameStack = []
+                    self.braceDepth -= 1
+                    #self.stack = []; print 'BRACE DEPTH', self.braceDepth, 'NS', len(self.nameSpaces)
+                    if self.curClass: debug_print( 'CURBD %s'%self._classes_brace_level[ self.curClass ] )
+
+                    if (self.braceDepth == 0) or (self.curClass and self._classes_brace_level[self.curClass]==self.braceDepth):
+                        trace_print( 'END OF CLASS DEF' )
+                        if self.accessSpecifierStack:
+                            self.curAccessSpecifier = self.accessSpecifierStack[-1]
+                            self.accessSpecifierStack = self.accessSpecifierStack[:-1] 
+                        if self.curClass and self.classes[ self.curClass ]['parent']: self.curClass = self.classes[ self.curClass ]['parent']
+                        else: self.curClass = ""; #self.curStruct = None
+                        self.stack = []
+
+                    #if self.curStruct: self.curStruct = None
+                    if self.braceDepth == 0 or (self.curStruct and self._structs_brace_level[self.curStruct['type']]==self.braceDepth):
+                        trace_print( 'END OF STRUCT DEF' )
+                        self.curStruct = None
+
+                    if self._method_body and (self.braceDepth + 1) <= self._method_body:
+                        self._method_body = None; self.stack = []; self.nameStack = []; trace_print( 'FORCE CLEAR METHBODY' )
+                
+                if (tok.type == 'OPEN_PAREN'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'CLOSE_PAREN'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'OPEN_SQUARE_BRACKET'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'CLOSE_SQUARE_BRACKET'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'TAB'): pass
+                elif (tok.type == 'EQUALS'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'COMMA'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'BACKSLASH'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'PIPE'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'PERCENT'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'CARET'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'EXCLAMATION'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'SQUOTE'): pass
+                elif (tok.type == 'NUMBER'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'MINUS'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'PLUS'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'STRING_LITERAL'):
+                    self.nameStack.append(tok.value)
+                elif (tok.type == 'NAME' or tok.type == 'AMPERSTAND' or tok.type == 'ASTERISK' or tok.type == 'CHAR_LITERAL'):
+                    if tok.value in ignoreSymbols:
+                        debug_print("Ignore symbol %s"%tok.value)
+                    elif (tok.value == 'class'):
+                        self.nameStack.append(tok.value)
+                    elif tok.value in supportedAccessSpecifier:
+                        if len(self.nameStack) and self.nameStack[0] in ("class", "struct", "union"):
+                            self.nameStack.append(tok.value)
+                        elif self.braceDepth == len(self.nameSpaces) + 1 or self.braceDepth == (len(self.nameSpaces) + len(self.curClass.split("::"))):
+                            self.curAccessSpecifier = tok.value;
+                            self.accessSpecifierScratch.append(tok.value)
+                            debug_print("curAccessSpecifier updated to %s"%self.curAccessSpecifier)
+                        self.stack = []
+                    else:
+                        self.nameStack.append(tok.value)
+                        if self.anon_union_counter[0] == self.braceDepth:
+                            self.anon_union_counter = [-1, 0]
+                elif (tok.type == 'COLON'):
+                    #Dont want colon to be first in stack
+                    if len(self.nameStack) == 0:
+                        self.accessSpecifierScratch = []
+                        continue
+                    
+                    # Handle situation where access specifiers can be multi words such as "public slots"
+                    jns = " ".join(self.accessSpecifierScratch + self.nameStack)
+                    if jns in supportedAccessSpecifier:
+                        self.curAccessSpecifier = jns;
+                        debug_print("curAccessSpecifier updated to %s"%self.curAccessSpecifier)
+                        self.stack = []
+                        self.nameStack = []
+                    else:
+                        self.nameStack.append(tok.value)
+                    self.accessSpecifierScratch = []
+
+                elif (tok.type == 'SEMI_COLON'):
+                    if self.anon_union_counter[0] == self.braceDepth and self.anon_union_counter[1]:
+                        debug_print("Creating anonymous union")
+                        #Force the processing of an anonymous union
+                        saved_namestack = self.nameStack[:] 
+                        saved_stack = self.stack[:]
+                        self.nameStack = [""]
+                        self.stack = self.nameStack + [";"]
+                        self.nameStack = self.nameStack[0:1]
+                        debug_print("pre eval anon stack")
+                        self.evaluate_stack( tok.type )
+                        debug_print("post eval anon stack")
+                        self.nameStack = saved_namestack
+                        self.stack = saved_stack
+                        self.anon_union_counter = [-1, 0];
+                    
+                    
+                    if (self.braceDepth < 10): self.evaluate_stack( tok.type )
+                    self.stack = []
+                    self.nameStack = []
+
+        except:
+            if (debug): raise
+            raise CppParseError("Not able to parse %s on line %d evaluating \"%s\"\nError around: %s"
+                                % (self.headerFileName, tok.lineno, tok.value, " ".join(self.nameStack)))
+
+        self.finalize()
+        global parseHistory
+        parseHistory = []
+
+    def evaluate_stack(self, token=None):
+        """Evaluates the current name stack"""
+        global doxygenCommentCache
+        
+        self.nameStack = filter_out_attribute_keyword(self.nameStack)
+        self.stack = filter_out_attribute_keyword(self.stack)
+        
+        debug_print( "Evaluating stack %s\n       BraceDepth: %s (called from %d)" %(self.nameStack,self.braceDepth, inspect.currentframe().f_back.f_lineno))
+        
+        #Handle special case of overloading operator ()
+        if "operator()(" in "".join(self.nameStack):
+            operator_index = self.nameStack.index("operator")
+            self.nameStack.pop(operator_index + 2)
+            self.nameStack.pop(operator_index + 1)
+            self.nameStack[operator_index] = "operator()"
+        
+        if (len(self.curClass)):
+            debug_print( "%s (%s) "%(self.curClass, self.curAccessSpecifier))
+
+        #Filter special case of array with casting in it
+        try:
+            bracePos = self.nameStack.index("[")
+            parenPos = self.nameStack.index("(")
+            if bracePos == parenPos - 1:
+                endParen = self.nameStack.index(")")
+                self.nameStack = self.nameStack[:bracePos + 1] + self.nameStack[endParen + 1:]
+                debug_print("Filtered namestack to=%s"%self.nameStack)
+        except: pass
+
+        #if 'typedef' in self.nameStack: self.evaluate_typedef()        # allows nested typedefs, probably a bad idea
+        if not self.curClass and 'typedef' in self.nameStack:
+            trace_print('STACK', self.stack)
+            self.evaluate_typedef()
+            return
+        
+        elif (len(self.nameStack) == 0):
+            debug_print( "trace" )
+            debug_print( "(Empty Stack)" )
+            return
+        elif (self.nameStack[0] == "namespace"):
+            #Taken care of outside of here
+            pass
+        elif len(self.nameStack) == 2 and self.nameStack[0] == "friend":#friend class declaration
+            pass
+        elif len(self.nameStack) >= 2 and self.nameStack[0] == 'using' and self.nameStack[1] == 'namespace': pass    # TODO
+
+        elif is_enum_namestack(self.nameStack):
+            debug_print( "trace" )
+            self.evaluate_enum_stack()
+
+        elif self._method_body and (self.braceDepth + 1) > self._method_body: trace_print( 'INSIDE METHOD DEF' )
+        elif is_method_namestack(self.stack) and not self.curStruct and '(' in self.nameStack:
+            debug_print( "trace" )
+            if self.braceDepth > 0:
+                if "{" in self.stack and self.stack[0] != '{' and self.stack[-1] == ';' and self.braceDepth == 1:
+                    #Special case of a method defined outside a class that has a body
+                    pass
+                else: 
+                    self.evaluate_method_stack()
+            else:
+                #Free function
+                self.evaluate_method_stack()
+        elif is_property_namestack(self.nameStack) and self.stack[-1] == ';':
+            debug_print( "trace" )
+            if self.nameStack[0] in ('class', 'struct') and len(self.stack) == 3: self.evalute_forward_decl()
+            elif len(self.nameStack) >= 2 and (self.nameStack[0]=='friend' and self.nameStack[1]=='class'): pass
+            else: self.evaluate_property_stack()    # catches class props and structs in a namespace
+
+        elif self.nameStack[0] in ("class", "struct", "union"):
+            #Parsing a union can reuse much of the class parsing
+            debug_print( "trace" )
+            self.evaluate_class_stack()
+        #elif (self.nameStack[0] == "struct"):
+        #    debug_print( "trace" )
+            ##this causes a bug when structs are nested in protected or private##self.curAccessSpecifier = "public"
+        #    self.evaluate_struct_stack()
+
+
+        elif not self.curClass:
+            debug_print( "trace" )
+            if is_enum_namestack(self.nameStack): self.evaluate_enum_stack()
+            elif self.curStruct and self.stack[-1] == ';': self.evaluate_property_stack()    # this catches fields of global structs
+            self.nameStack = []
+            doxygenCommentCache = ""
+            return
+        elif (self.braceDepth < 1):
+            debug_print( "trace" )
+            #Ignore global stuff for now
+            debug_print( "Global stuff: %s"%self.nameStack )
+            self.nameStack = []
+            doxygenCommentCache = ""
+            return
+        elif (self.braceDepth > len(self.nameSpaces) + 1):
+            debug_print( "trace" )
+            self.nameStack = []
+            doxygenCommentCache = ""
+            return
+
+        self.nameStack = []        # its a little confusing to have some if/else above return and others not, and then clearning the nameStack down here
+        doxygenCommentCache = ""
+    
+
+    def evaluate_enum_stack(self):
+        """Create an Enum out of the name stack"""
+        debug_print( "evaluating enum" )
+        newEnum = CppEnum(self.nameStack)
+        if len(list(newEnum.keys())):
+            if len(self.curClass):
+                newEnum["namespace"] = self.cur_namespace(False)
+                klass = self.classes[self.curClass]
+                klass["enums"][self.curAccessSpecifier].append(newEnum)
+                if self.curAccessSpecifier == 'public' and 'name' in newEnum: klass._public_enums[ newEnum['name'] ] = newEnum
+            else:
+                newEnum["namespace"] = self.cur_namespace(True)
+                self.enums.append(newEnum)
+                if 'name' in newEnum and newEnum['name']: self.global_enums[ newEnum['name'] ] = newEnum
+
+            #This enum has instances, turn them into properties
+            if "instances" in newEnum:
+                instanceType = "enum"
+                if "name" in newEnum:
+                    instanceType = newEnum["name"]
+                for instance in newEnum["instances"]:
+                    self.nameStack = [instanceType,  instance]
+                    self.evaluate_property_stack()
+                del newEnum["instances"]
+
+
+    def __repr__(self):
+        rtn = ""
+        for className in list(self.classes.keys()):
+            rtn += "%s\n"%self.classes[className]
+        if self.functions:
+            rtn += "// functions\n"
+            for f in self.functions:
+                rtn += "%s\n"%f
+        if self.enums:
+            rtn += "// enums\n"
+            for f in self.enums:
+                rtn += "%s\n"%f
+        return rtn
diff --git a/site-packages/dolfin_utils/cppparser/__init__.py b/site-packages/dolfin_utils/cppparser/__init__.py
new file mode 100644
index 0000000..7555fc3
--- /dev/null
+++ b/site-packages/dolfin_utils/cppparser/__init__.py
@@ -0,0 +1,2 @@
+from CppHeaderParser import CppHeader
+from utils import *
diff --git a/site-packages/dolfin_utils/cppparser/utils.py b/site-packages/dolfin_utils/cppparser/utils.py
new file mode 100644
index 0000000..baf52d0
--- /dev/null
+++ b/site-packages/dolfin_utils/cppparser/utils.py
@@ -0,0 +1,179 @@
+# Utilities for parsing DOLFIN files and generaton of SWIG files
+#
+# Copyright (C) 2012 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-07-01
+# Last changed: 2012-07-03
+
+# System imports
+import os
+import re
+
+try:
+    from collections import OrderedDict
+except ImportError:
+    from dolfin_utils.ordereddict import OrderedDict
+
+# Local imports
+from CppHeaderParser import CppHeader
+
+# reg exp pattern
+_template_pattern = re.compile("\w+<([\w ]+)>")
+
+def strip_templates(types):
+    """
+    Strip template types
+    """
+    ret_types = set()
+    temp_types = re.findall(_template_pattern, types)
+    while temp_types:
+        ret_types.update(temp_types)
+        for temp_type in temp_types:
+            types = types.replace("<%s>" % temp_type, "")
+        temp_types = re.findall(_template_pattern, types)
+
+    if types:
+        ret_types.add(types)
+
+    return ret_types
+
+def build_swig_import_info(dependencies, submodule_info, module_prepend=""):
+    """
+    Build import and include info from a list of submodules and headers
+    """
+    import_lines = []
+    headers_includes = ["", "// Include types from dependent modules"]
+    file_dependencies = []
+
+    # Iterate over the file dependencies and generate import statements
+    previous_submodule = ""
+    for submodule, headers in dependencies.items():
+        module = submodule_info[submodule]["module"]
+        headers_includes.append("")
+        headers_includes.append("// #include types from %s submodule of "\
+                                "module %s" % (submodule, module))
+        import_lines.append("")
+        import_lines.append("// %%import types from submodule"\
+                            " %s of SWIG module %s" % \
+                            (submodule, module))
+        
+        # Check for pre includes
+        if submodule_info[submodule]["has_pre"]:
+            file_dependencies.append("dolfin/swig/%s/pre.i" % submodule)
+            import_lines.append(\
+                "%%include \"dolfin/swig/%s/pre.i\"" % submodule)
+
+        # Add headers
+        file_dependencies.extend(headers)
+        for header in headers:
+            # Add file dependency
+            import_lines.append("%%import(module=\"%s\") \"%s\"" % \
+                                (module_prepend+module, header))
+            headers_includes.append("#include \"%s\"" % header)
+
+    return import_lines, headers_includes, file_dependencies
+
+def parse_and_extract_type_info(code):
+    """
+    Parse header code and return declared types, used types, and any bases
+    """
+    
+    used_types=set()
+    declared_types=OrderedDict()
+
+    # Use CppHeader to extract
+    cppheader = CppHeader(code, argType="string")
+
+    # Collect used types from the code
+    used_types = set()
+                
+    # Iterate over typedefs and collect types
+    for typedef in cppheader.typedefs:
+        if "dolfin::" in typedef:
+            typedef = typedef.replace("dolfin::", "")
+
+        # Store type information
+        declared_types[typedef] = []
+
+    # Iterate over free functions and collect dependant types
+    for function in cppheader.functions:
+    
+        # Check return type
+        if function["rtnType"] != "void":
+            used_types.update(strip_templates(function["rtnType"]))
+    
+        # Check argument types
+        for argument in function["parameters"]:
+            used_types.update(strip_templates(argument["type"]))
+
+    # Iterate over classed and collect info
+    for class_name, class_repr in cppheader.classes.items():
+    
+        # Check if class is private
+        if class_repr["parent"] is not None:
+            continue
+    
+        # Get bases
+        bases = set()
+        for base in class_repr["inherits"]:
+            bases.update(strip_templates(base["class"]))
+
+        # Remove itself from any bases
+        bases.difference_update([class_name])
+
+        # Register the class
+        declared_types[class_name] = list(bases)
+        
+        # Iterate over public properties
+        for prop in class_repr["properties"]["public"]:
+            used_types.update(strip_templates(prop["type"]))
+
+        # Iterate over methods and collect dependant types
+        for method in class_repr["methods"]["public"]+\
+                class_repr["methods"]["protected"]:
+    
+            # Check return type
+            if method["rtnType"] != "void":
+                used_types.update(strip_templates(method["rtnType"]))
+    
+            # Check argument types
+            for argument in method["parameters"]:
+                used_types.update(strip_templates(argument["type"]))
+    
+        # Remove any self dependencies
+        used_types = set(used_type for used_type in
+                         used_types if class_name not in used_type)
+
+    return used_types, declared_types
+    
+def sort_submodule_dependencies(dependencies, submodule_info):
+    """
+    Given a dict of submodules and headers, we use original
+    submodule info to sort the content
+    """
+    submodule_dependences = OrderedDict()
+    for submodule in submodule_info:
+        if submodule in dependencies:
+            
+            # Register sorted dependency
+            submodule_dependences[submodule] = [header for header in \
+                submodule_info[submodule]["headers"] \
+                if header in dependencies[submodule]]
+    
+    return submodule_dependences
+
diff --git a/site-packages/dolfin_utils/documentation/__init__.py b/site-packages/dolfin_utils/documentation/__init__.py
new file mode 100644
index 0000000..6e5d460
--- /dev/null
+++ b/site-packages/dolfin_utils/documentation/__init__.py
@@ -0,0 +1,4 @@
+from extractdocumentation import extract_doc_representation
+from docstringutils import indent, add_links
+from generatepythonrst import generate_python_api_documentation
+from generatecpprst import generate_cpp_api_documentation
diff --git a/site-packages/dolfin_utils/documentation/docstringutils.py b/site-packages/dolfin_utils/documentation/docstringutils.py
new file mode 100644
index 0000000..528d328
--- /dev/null
+++ b/site-packages/dolfin_utils/documentation/docstringutils.py
@@ -0,0 +1,49 @@
+"Utility functions for docstring manipulations."
+
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Kristian B. Oelgaard, 2010.
+# Modified by Marie E. Rognes, 2011.
+#
+# First added:  2010-08-26
+# Last changed: 2011-05-10
+
+import re
+
+_compiled_cache = {}
+
+def indent(string, num_spaces):
+    "Indent given text block given number of spaces"
+    return "\n".join(num_spaces*" " + l for l in string.split("\n"))
+
+def add_links(text, classnames, link_type):
+    "Add crosslinks for classes"
+    for classname in classnames:
+        if classname not in text:
+            continue
+        p = _compiled_cache.get(classname)
+        if not p:
+            p = re.compile(r"\b_%s_\b" % classname)
+            _compiled_cache[classname] = p
+        text = p.sub("%s`%s`" % (link_type, classname), text)
+
+    # Escape pointer arguments: replace * by \* after class names
+    text = text.replace("`*", "`\*")
+
+    return text
+
diff --git a/site-packages/dolfin_utils/documentation/extractdocumentation.py b/site-packages/dolfin_utils/documentation/extractdocumentation.py
new file mode 100644
index 0000000..a5e9a67
--- /dev/null
+++ b/site-packages/dolfin_utils/documentation/extractdocumentation.py
@@ -0,0 +1,225 @@
+"""Script to extract documentation from docstrings in *.h files in the DOLFIN
+source tree."""
+
+# Copyright (C) 2010 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Kristian B. Oelgaard, 2011.
+# Modified by Marie E. Rognes, 2011.
+# Modified by Anders E. Johansen, 2011.
+#
+# First added:  2010-08-26
+# Last changed: 2011-07-10
+
+import os
+
+def extract_documentation(dolfin_dir, header, module):
+    "Extract documentation for given header in given module"
+
+    # print "Extracting documentation for %s..." % header
+
+    # List of classes with documentation
+    classnames = []
+    documentation = []
+
+    # Class name and parent class name
+    classname = None
+    parents = None
+
+    # Comment and signature
+    comment = None
+    signature = None
+
+    # Indentation of signatures
+    indent = 0
+
+    # Iterate over each line
+    f = open(os.path.join(dolfin_dir, "dolfin", module, header))
+    for line in f:
+
+        # Check for comment
+        if "///" in line:
+
+            # We may have either "///" and "/// "
+            if "/// " in line:
+                c = line.split("/// ")[1].rstrip()
+            else:
+                c = line.split("///")[1].rstrip()
+
+            # Found start of new comment
+            if comment is None:
+                comment = c
+
+            # Continuing comment on next line
+            else:
+                comment += "\n" + c
+
+        # Check for class
+        # If anything goes wrong, remove the last '<' after template.
+        elif " class " in line and not ";" in line and not "//" in line and not "template<" in line:
+
+            # Get class name and parent
+            classname = line.split(" class ")[1].split(":")[0].strip()
+            if "public" in line:
+                # Strip of each parent of additional commas, blanks
+                # and newlines
+                parents = [p.strip(", \n") for p in line.split("public")[1:]]
+
+                # Remove virtual modifier
+                parents = [p.replace("virtual ", "") for p in parents]
+
+            # Store documentation
+            # TODO: KBO: we don't check if a given classname is in the dolfin
+            # namepace.
+            classnames.append(classname)
+            documentation.append((classname, parents, comment, []))
+
+            classname = None
+            parents = None
+            comment = None
+
+        # If we encounter a '//' commented line we reset comment and proceed
+        # This means that '///' and '//' should not be mixed when documenting
+        # functions.
+        elif line.lstrip()[0:2] == "//" and not line.lstrip()[0:3] == "///":
+            comment = None
+            continue
+
+        # Check for function signature
+        elif comment is not None:
+            s = line.strip()
+
+            # Found start of new signature
+            if signature is None:
+                signature = s
+                #indent = (len(s.split("(")[0]) + 1)*" "
+
+            # Continuing signature on next line
+            else:
+                #signature += "\n" + indent + s
+                signature += " " + s
+
+            # Signature ends when we find ";" or "{"
+            if ";" in s or "{" in s:
+
+                # Strip out last part
+                signature = signature.split(";")[0]
+                signature = signature.split("{")[0]
+                signature = signature.strip()
+
+                # Remove stuff Sphinx can't handle
+                signature = signature.replace("virtual ", "")
+                signature = signature.replace("inline ", "")
+
+                # Remove ": stuff" for constructors
+                new_s = []
+                for l in signature.split("::"):
+                    if not ":" in l:
+                        new_s.append(l)
+                    else:
+                        new_s.append(l.split(":")[0])
+                        break
+                signature = "::".join(new_s).strip()
+
+                # Remove template stuff (not handled correctly by Sphinx)
+                # e.g., 'template <typename Kernel> CGAL::Bbox_3  bbox()' in mesh/Point.h
+                if "template" in signature:
+                    signature = ">".join(signature.split(">")[1:]).lstrip()
+
+                # Ignore enums, not handled by Sphinx
+                if "enum" in signature:
+                    # Reset comment and signature
+                    comment = None
+                    signature = None
+                    continue
+
+                # Only handle functions, i.e. signatures that contain '('
+                # (or ')'). This is to avoid picking up data members.
+                # NOTE, KBO: Should we also skip private functions?
+                if not "(" in signature:
+                    # Reset comment and signature
+                    comment = None
+                    signature = None
+                    continue
+
+                # Skip destructors (not handled by Sphinx)
+                destructor = "~" in signature
+
+                # Get function name
+                #function = signature.split("(")[0].split(" ")[-1]
+
+                # Store documentation
+                if len(documentation) > 0 and not destructor:
+                    documentation[-1][-1].append((signature, comment))
+                elif not destructor:
+                    documentation = [(None, None, None, [(signature, comment)])]
+
+                # Reset comment and signature
+                comment = None
+                signature = None
+
+    # Close file
+    f.close()
+
+    # Sort documentation alphabetically within each class
+#    for (classname, parent, comment, function_documentation) in documentation:
+#        function_documentation.sort()
+
+    return documentation, classnames
+
+def extract_doc_representation(dolfin_dir):
+    # Extract modules from dolfin.h
+    modules = []
+    f = open(os.path.join(dolfin_dir, "dolfin", "dolfin.h"))
+    for line in f:
+        if line.startswith("#include <dolfin/"):
+            module = line.split("/")[1]
+            modules += [module]
+    f.close()
+
+    # Iterate over modules
+    documentation = {}
+    classnames = []
+    for module in modules:
+#        if not module == "la":
+#            continue
+        # Extract header files from dolfin_foo.h
+        f = open(os.path.join(dolfin_dir, "dolfin", module, "dolfin_%s.h" % module))
+        documentation[module] = []
+        for line in f:
+
+            # Generate documentation for header file
+            if line.startswith("#include <dolfin/"):
+                header = line.split("/")[2].split(">")[0]
+#                if not header == "GenericTensor.h":
+#                    continue
+                doc, cls = extract_documentation(dolfin_dir, header, module)
+                documentation[module].append((header, doc))
+                classnames += cls
+
+    return documentation, classnames
+
+if __name__ == "__main__":
+    docs, classes = extract_doc_representation()
+#    for c in classes:
+#        print c
+#    for key, doc in docs.items():
+#        for header, cont in doc:
+#            print cont
+
+
+
diff --git a/site-packages/dolfin_utils/documentation/generatecpprst.py b/site-packages/dolfin_utils/documentation/generatecpprst.py
new file mode 100644
index 0000000..1872166
--- /dev/null
+++ b/site-packages/dolfin_utils/documentation/generatecpprst.py
@@ -0,0 +1,154 @@
+# Copyright (C) 2010 Anders Logg and Kristian Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes
+#
+# First added:  2010
+# Last changed: 2011-05-23
+
+import os
+
+# Import the documentation extractor tools from dolfin_utils
+from dolfin_utils.documentation import extract_doc_representation
+from dolfin_utils.documentation import indent, add_links
+
+import indextemplates as templates
+
+__all__ = ["generate_cpp_api_documentation"]
+
+def write_class_doc(classname, parents, comment, function_documentation,
+                    classnames):
+
+    output = []
+    base_indent = 0
+    if classname is not None:
+        base_indent = 4
+        output += [".. cpp:class:: %s\n" % classname]
+
+        if parents is not None:
+            output += [indent("*Parent class(es)*\n", 4)]
+            for parent in parents:
+                output += [indent("* :cpp:class:`%s`\n" % parent, 8)]
+
+        if comment is not None:
+            comment = add_links(comment, classnames, ":cpp:class:") #NB
+            output += [indent(comment, 4)] + ["\n"]
+
+    else:
+        output += ["\n"]
+
+    for (signature, comment) in function_documentation:
+
+        # Handle indentation of signature # Hm?
+        if "\n" in signature:
+            lines = signature.split("\n")
+            signature = ("\n".join([lines[0]]
+                                   + [(len(".. cpp.function::") + 1)*" " + l
+                                      for l in lines[1:]]))
+        # Add crosslinks in comment
+        comment = add_links(comment, classnames, ":cpp:class:")
+
+        output += [indent(".. cpp:function:: %s\n" % signature, base_indent)]
+        output += [indent(comment, base_indent + 4), "\n"]
+
+    text = "\n".join(output)
+    return text
+
+def generate_header_rst_file(module, header, documentation, classnames):
+
+    output = []
+    for (classname, parents, comment, function_documentation) in documentation:
+        output += [write_class_doc(classname, parents, comment,
+                                   function_documentation, classnames)]
+
+    text = "\n".join(output)
+    note = indent(templates.note_template, 4)
+
+    dictionary = {"module": module, "header": header,
+                  "prefix": header.split(".")[0].lower(),
+                  "title": header, "formatting": len(header)*"=",
+                  "note": note, "text": text}
+    template = templates.header_cpp_template % dictionary
+
+    return template
+
+def open_write_close(filename, contents):
+    f = open(filename, "w")
+    f.write(contents)
+    f.close()
+
+def generate_cpp_module(module, documentation, classnames, output_dir):
+
+    print indent("Generating documentation for %s ... " % module, 0)
+
+    # Generate index file for this module
+    module_index = templates.generate_module_index(module)
+    index_filename = os.path.join(output_dir, "index.rst")
+    open_write_close(index_filename, module_index)
+
+    # Generate .rst for each header file in this module
+    for (header, doc) in documentation:
+
+        #print indent("Generating documentation for %s" % header, 2)
+        rst_filename = os.path.join(output_dir, header.split(".")[0] + ".rst")
+        header_rst = generate_header_rst_file(module, header, doc,
+                                              classnames)
+        open_write_close(rst_filename, header_rst)
+
+    return
+
+def generate_cpp_api_documentation(input_dir, output_dir, version=None):
+    """
+    Generate .rst files for C++ DOLFIN Programmer's Reference
+
+    Arguments:
+      * version
+        version should be the version number, example 0.9.11 or dev
+    """
+
+    print "Generating .rst for C++ API documentation of DOLFIN-%s" % version
+    print "This can take some time ..."
+    print "Reading from %s" % input_dir
+    try:
+        os.makedirs(output_dir)
+        print "Creating output directory: %s" % output_dir
+
+    except:
+        print "Output directory (%s) already existing" % output_dir
+
+    # Get representation
+    documentation, classnames = extract_doc_representation(input_dir)
+
+    # Generate index file for library
+    library_index = templates.generate_library_index(version)
+    library_index_filename = os.path.join(output_dir, "index.rst")
+    open_write_close(library_index_filename, library_index)
+
+    # Generate documentation for each module
+    for module in documentation:
+
+        # Create directory for this module
+        module_dir = os.path.join(output_dir, module)
+        try:
+            os.makedirs(module_dir)
+        except:
+            pass
+
+        # Create documentation for this module
+        generate_cpp_module(module, documentation[module], classnames,
+                            module_dir)
+
diff --git a/site-packages/dolfin_utils/documentation/generatepythonrst.py b/site-packages/dolfin_utils/documentation/generatepythonrst.py
new file mode 100644
index 0000000..c5f589b
--- /dev/null
+++ b/site-packages/dolfin_utils/documentation/generatepythonrst.py
@@ -0,0 +1,219 @@
+# Copyright (C) 2011 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes, 2011
+#
+# First added:  2011-05-23
+# Last changed: 2011-06-18
+
+import os, sys, types
+
+from dolfin_utils.documentation import indent
+
+__all__ = ["generate_python_api_documentation"]
+
+class Module(object):
+    def __init__(self, name, mod_file):
+        self.name = name
+        self.file = mod_file
+        self.submodules = []
+    def __hash__(self):
+        return self.name
+
+def get_modules(parent, loc, modules):
+    for mod in os.listdir(loc):
+        f = os.path.join(loc, mod)
+        new_mod = None
+        # Add modules (files) to global dict and to parent as submodules.
+        if os.path.isfile(f):
+            m, e = os.path.splitext(mod)
+            if e == ".py" and m != "__init__":
+                new_mod = Module(".".join([parent.name, m]), f)
+                parent.submodules.append(m)
+        # Add submodules (directories with '__init__.py' files) to global dict
+        # and to parent as submodules.
+        if os.path.isdir(f):
+            if not "__init__.py" in os.listdir(f):
+                continue
+            new_mod = Module(".".join([parent.name, mod]), os.path.join(f, "__init__.py"))
+            parent.submodules.append(mod)
+
+            # Recursively extract submodules.
+            get_modules(new_mod, f, modules)
+
+        if new_mod is not None:
+            if new_mod in modules:
+                print new_mod, modules
+                raise RuntimeError("module already present???")
+            modules.append(new_mod)
+
+def get_objects(module):
+    """Extract classes and functions defined in a module.
+    The function will not return imported classes and functions."""
+    classes = []
+    functions = []
+    objects = {}
+
+    # Ignore classes and functions defined in __init__.py.
+    # This is to get rid of double occurrences of classes like FunctionSpace
+    # (included in __all__ variable of dolfin/functions/__init__.py
+    # and dolfin/functions/functionspace.py.
+    if os.path.split(module.file)[1] == "__init__.py":
+        return classes, functions
+
+    # NOTE: Dirty hack for Python 2.6, in 2.7 it should be possible to use
+    # importlib for submodules to test if __all__ is defined.
+    if "__all__" in open(module.file, "r").read():
+        define_all = True
+    else:
+        define_all = False
+
+    # Get objects listed in __all__ by developer.
+    exec("from %s import *" % module.name, objects)
+
+    for key, val in objects.items():
+#        print "key: ", key
+        if isinstance(val, (types.ClassType, types.TypeType)):
+            if define_all or module.name == val.__module__:
+                classes.append(key)
+        elif isinstance(val, types.FunctionType):
+#            print "fun, mod: ", val.__module__
+            if define_all or module.name == val.__module__:
+                functions.append(key)
+        # Anything else we need to catch?
+        else:
+            pass
+
+    return classes, functions
+
+def index_items(item_type, items):
+    return """
+%s:
+
+.. toctree::
+    :maxdepth: 1
+
+%s
+""" % (item_type, indent("\n".join(sorted(items)), 4))
+
+def caption(string, level, top=False):
+    markers = level*len(string)
+    if top:
+        return "%s\n%s\n%s\n" % (markers, string, markers)
+    return "%s\n%s\n" % (string, markers)
+
+def label(package_name, name):
+    output = ".. _programmers_reference_"
+    return output + "%s:\n\n" % name
+
+def write_class(name, module_name):
+    output = name + "\n"
+    output += "="*len(name) + "\n"
+    output += "\n.. currentmodule:: %s\n\n" % module_name
+    output += ".. autoclass:: %s\n" %  name
+    output += "   :members:\n"
+    output += "   :undoc-members:\n"
+    output += "   :show-inheritance:\n"
+
+    return output
+
+def write_object(package_name, directory, module_name, name, obj_type):
+    output = ".. Documentation for the %s %s\n\n" % (obj_type, module_name + "." + name)
+    output += label(package_name, "_".join(module_name.split(".")[1:] + [name.lower()]))
+    if obj_type == "class":
+        output += write_class(name, module_name)
+    else:
+        output += name + "\n"
+        output += "="*len(name) + "\n"
+        output += "\n.. currentmodule:: %s\n\n" % module_name
+        output += ".. auto%s:: %s\n" % (obj_type, name)
+    outfile = os.path.join(directory, name + ".rst")
+    f = open(outfile, "w")
+    f.write(output)
+    f.close()
+
+def write_documentation(package_name, module, output_dir, version):
+
+    package_version = package_name + "-" + version
+    dirs = [output_dir]
+    dirs += module.name.split(".")[1:]
+    directory = os.path.sep.join(dirs)
+
+    try:
+        os.makedirs(directory)
+    except:
+        pass
+
+    modules = []
+    # Special handling of cpp module in dolfin.
+    for sub in module.submodules:
+        if sub == "cpp" and package_name == "dolfin":
+            modules.append("dolfin.cpp (Swig autogenerated module) <cpp/index>")
+        else:
+            modules.append(sub + "/index")
+
+    classes, functions = get_objects(module)
+
+    output = ".. Index file for the %s module.\n\n" % module.name
+    output += label(package_name, "_".join(module.name.split(".")[1:] + ["index"]))
+
+    if module.name == package_name and package_name == "dolfin":
+        output += caption("Programmer's reference for DOLFIN (Python)", "#")
+    elif module.name == package_name:
+        output += caption("Programmer's reference", "#")
+    else:
+        header = "%s module" % module.name
+        output += caption(header, "*")
+
+    outfile = os.path.join(directory, "index.rst")
+    f = open(outfile, "w")
+    f.write(output)
+    if modules:
+        f.write(index_items("Modules", modules))
+    if classes:
+        f.write(index_items("Classes", classes))
+    if functions:
+        f.write(index_items("Functions", functions))
+
+    f.write("""\nModule docstring:
+
+.. automodule:: %s
+   :no-members:
+   :no-undoc-members:
+   :no-show-inheritance:""" % module.name)
+    f.close()
+
+    for o in classes:
+        write_object(package_name, directory, module.name, o, "class")
+
+    for o in functions:
+        write_object(package_name, directory, module.name, o, "function")
+
+
+def generate_python_api_documentation(module, output_dir, version):
+
+    print "\nWriting files for module: %s ... " % module.__name__
+    submods = [Module(module.__name__,
+                      os.path.join(os.path.dirname(module.__file__),
+                                   "__init__.py"))]
+
+    get_modules(submods[0], os.path.dirname(module.__file__), submods)
+
+    print "Writing files for submodules ... "
+    for submod in sorted(submods, key=lambda o: o.name):
+        # print "  Writing files for sub module: ", submod.name
+        write_documentation(module.__name__, submod, output_dir, version)
diff --git a/site-packages/dolfin_utils/documentation/indextemplates.py b/site-packages/dolfin_utils/documentation/indextemplates.py
new file mode 100644
index 0000000..2b30c4e
--- /dev/null
+++ b/site-packages/dolfin_utils/documentation/indextemplates.py
@@ -0,0 +1,91 @@
+# Copyright (C) 2011 Anders Logg, Kristian Oelgaard, and Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-05-23
+# Last changed: 2011-05-27
+
+library_index_cpp_template = """\
+.. _programmers_reference_index:
+
+#############################################
+C++ Programmer's reference for DOLFIN-%s
+#############################################
+
+.. toctree::
+   :glob:
+   :maxdepth: 2
+
+   */index
+"""
+
+module_index_cpp_template = """\
+.. _programmers_reference_%s_index:
+
+**********************************
+DOLFIN %s module
+**********************************
+
+.. toctree::
+   :glob:
+   :maxdepth: 1
+
+   *
+"""
+
+header_cpp_template = """\
+
+.. Documentation for the header file dolfin/%(module)s/%(header)s
+
+.. _programmers_reference_cpp_%(module)s_%(prefix)s:
+
+%(title)s
+%(formatting)s
+
+.. note::
+%(note)s
+
+%(text)s
+"""
+
+note_template = """
+The documentation on this page was automatically extracted from the
+DOLFIN C++ code and may need to be edited or expanded.
+"""
+
+automodule_template = """
+
+%(title)s
+%(formatting)s
+
+.. automodule:: %(module)s
+   :members:
+   :undoc-members:
+   :show-inheritance:
+"""
+
+def generate_library_index(version):
+    return library_index_cpp_template % version
+
+def generate_module_index(module):
+    return module_index_cpp_template % (module, module)
+
+def generate_automodule(title, formatting, module_name):
+    options = {"module": module_name, "title": title,
+               "formatting": len(title)*formatting}
+    return automodule_template % options
+
+
diff --git a/site-packages/dolfin_utils/meshconvert/__init__.py b/site-packages/dolfin_utils/meshconvert/__init__.py
new file mode 100644
index 0000000..e69de29
diff --git a/site-packages/dolfin_utils/meshconvert/abaqus.py b/site-packages/dolfin_utils/meshconvert/abaqus.py
new file mode 100644
index 0000000..9bb8d3d
--- /dev/null
+++ b/site-packages/dolfin_utils/meshconvert/abaqus.py
@@ -0,0 +1,475 @@
+"""Module for converting the  Abaqus mesh format."""
+
+# Copyright (C) 2012 Arve Knudsen and Garth N/ Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Simon Funke (surface export)
+
+import re
+import csv
+import xml_writer
+import numpy as np
+
+class State:
+    Init, Unknown, Invalid, ReadHeading, ReadNodes, ReadCells, \
+        ReadNodeSet, ReadCellSet, ReadSurfaceSet = range(9)
+
+def convert(ifilename, handler):
+    """ Convert from Abaqus.
+
+    The Abaqus format first defines a node block, then there should be a number
+    of elements containing these nodes.
+    """
+
+    # Dictionary of nodes (maps node id to coordinates)
+    nodes = {}
+
+    # Dictionary of elements (maps cell id to list of cell nodes)
+    elems = {}
+
+    # Lists of nodes for given name (key)
+    node_sets = {}
+
+    # Lists of cells for given name (key)
+    cell_sets = {}
+
+    # Lists of surfaces for given name (key) in the format:
+    # {'SS1': [set(['SS1_S1', 'S1']), set(['SS1_S4', 'S4'])]},
+    # where SS1 is the name of the surface, SS1_S1 is the name of the
+    # cell list whose first face is to be selected, ...
+    surface_sets = {}
+
+    # Open file Abaqus file
+    csv_file = csv.reader(open(ifilename, 'rb'), delimiter=',', skipinitialspace=True)
+
+    node_set_name = None
+    generate = None
+
+    # Set intial state state
+    state = State.Init
+
+    # Read data from input file
+    for l in csv_file:
+
+        # Sanity check
+        if (len(l) == 0): print "Ooops, zero length."
+
+        if l[0].startswith('**'): # Pass over comments
+            continue
+        elif l[0].startswith('*'): # Have a keyword
+            state = State.Unknown
+
+            if l[0].lower() == "*heading":
+                state = State.ReadHeading
+
+            elif l[0].lower() == "*part":
+                part_name = _read_part_name(l)
+
+            elif l[0].lower() == "*end part":
+                state = State.Invalid
+
+            elif l[0].lower() == "*node":
+                node_set_name = _create_node_list_entry(node_sets, l)
+                state = State.ReadNodes
+
+            elif l[0].lower() == "*element":
+                cell_type, cell_set_name = _read_element_keywords(cell_sets, l)
+                state = State.ReadCells
+
+            elif l[0].lower() == "*nset":
+                node_set_name, generate = _read_nset_keywords(node_sets, l)
+                state = State.ReadNodeSet
+
+            elif l[0].lower() == "*elset":
+                cell_set_name, generate = _read_elset_keywords(cell_sets, l)
+                if generate:
+                    print "WARNING: generation of *elsets not tested."
+                state = State.ReadCellSet
+
+            elif l[0].lower() == "*surface":
+                surface_set_name, generate = _read_surface_keywords(surface_sets, l)
+                state = State.ReadSurfaceSet
+
+            else:
+                print "WARNING: unrecognised Abaqus input keyword:", l[0]
+                state = State.Unknown
+
+        else:
+
+            if state == State.ReadHeading:
+                model_name = _read_heading(l)
+
+            elif state == State.ReadNodes:
+                node_id = int(l[0]) - 1
+                coords = [float(c) for c in l[1:]]
+                nodes[node_id] = coords
+                if node_set_name is not None:
+                    node_sets[node_set_name].add(node_id)
+
+            elif state == State.ReadCells:
+                cell_id = int(l[0]) - 1
+                cell_connectivity = [int(v) - 1 for v in l[1:]]
+                elems[cell_id] = cell_connectivity
+                if cell_set_name is not None:
+                    cell_sets[cell_set_name].add(cell_id)
+
+            elif state == State.ReadNodeSet:
+
+                try:
+                    if generate:
+                        n0, n1, increment = l
+                        node_range = range(int(n0) - 1, int(n1) - 1, int(increment))
+                        node_range.append(int(n1) - 1)
+                        node_sets[node_set_name].update(node_range)
+                    else:
+                        # Strip empty term at end of list, if present
+                        if l[-1] == '': l.pop(-1)
+                        node_range = [int(n) - 1 for n in l]
+                        node_sets[node_set_name].update(node_range)
+                except:
+                    print "WARNING: Non-integer node sets not yet supported."
+
+            elif state == State.ReadCellSet:
+                try:
+                    if generate:
+                        n0, n1, increment = l
+                        cell_range = range(int(n0) - 1, int(n1) - 1, int(increment))
+                        cell_range.append(int(n1) - 1)
+                        cell_sets[cell_set_name].update(cell_range)
+                    else:
+                        # Strip empty term at end of list, if present
+                        if l[-1] == '': l.pop(-1)
+                        cell_range = [int(n) - 1 for n in l]
+                        cell_sets[cell_set_name].update(cell_range)
+                except:
+                    print "WARNING: Non-integer element sets not yet supported."
+
+            elif state == State.ReadSurfaceSet:
+                # Strip empty term at end of list, if present
+                if l[-1] == '': l.pop(-1)
+                surface_sets[surface_set_name].update([tuple(l)])
+
+            elif state == State.Invalid: # part
+                raise StandardError("Inavlid Abaqus parser state..")
+
+
+    # Close CSV object
+    del csv_file
+
+    # Write data to XML file
+    # Note that vertices/cells must be consecutively numbered, which
+    # isn't necessarily the case in Abaqus. Therefore we enumerate and
+    # translate original IDs to sequence indexes if gaps are present.
+
+    # FIXME
+    handler.set_mesh_type("tetrahedron", 3)
+
+    process_facets = len(surface_sets) > 0
+    if process_facets:
+        try:
+            from dolfin import MeshEditor, Mesh
+        except ImportError:
+            _error("DOLFIN must be installed to handle Abaqus boundary regions")
+
+        mesh = Mesh()
+        mesh_editor = MeshEditor()
+        mesh_editor.open(mesh, 3, 3)
+
+    node_ids_order = {}
+    # Check for gaps in vertex numbering
+    node_ids = nodes.keys()
+    if len(node_ids) > 0:
+        vertex_gap = (min(node_ids) != 0 or max(node_ids) != len(node_ids) - 1)
+        for x, y in enumerate(node_ids):
+            node_ids_order[y]= x  # Maps Abaqus IDs to Dolfin IDs
+    else:
+        vertex_gap = True
+
+    # Check for gaps in cell numbering
+    elemids = elems.keys()
+    if len(elemids) > 0:
+        cell_gap = (min(elemids) != 0 or max(elemids) != len(elemids) - 1)
+    else:
+        cell_gap = True
+
+    # Write vertices to XML file
+    handler.start_vertices(len(nodes))
+    if process_facets:
+        mesh_editor.init_vertices_global(len(nodes), len(nodes))
+
+    if not vertex_gap:
+
+        for v_id, v_coords in nodes.items():
+            handler.add_vertex(v_id, v_coords)
+            if process_facets:
+                mesh_editor.add_vertex(v_id, np.array(v_coords, dtype=np.float_))
+
+    else:
+
+        for idx, (v_id, v_coords) in enumerate(nodes.items()):
+            handler.add_vertex(idx, v_coords)
+            if process_facets:
+                mesh_editor.add_vertex(idx, np.array(v_coords, dtype=np.float_))
+
+    handler.end_vertices()
+
+    # Write cells to XML file
+    handler.start_cells(len(elems))
+    if process_facets:
+        mesh_editor.init_cells_global(len(elems), len(elems))
+
+    if not vertex_gap and not cell_gap:
+
+        for c_index, c_data in elems.items():
+            for v_id in c_data:
+                if not (0 <= v_id < len(nodes)):
+                    handler.error("Element %s references non-existent node %s" % (c_index, v_id))
+            handler.add_cell(c_index, c_data)
+
+            if process_facets:
+                c_data_tmp = np.array(c_data)
+                c_data_tmp.sort()
+                mesh_editor.add_cell(c_index, np.array(c_data_tmp, dtype=np.uintp))
+
+
+    elif not vertex_gap and cell_gap:
+
+        for idx, (c_index, c_data) in enumerate(elems.items()):
+            for v_id in c_data:
+                if not (0 <= v_id < len(nodes)):
+                    handler.error("Element %s references non-existent node %s" % (c_index, v_id))
+            handler.add_cell(idx, c_data)
+
+            if process_facets:
+                c_data_tmp = np.array(c_data)
+                c_data_tmp.sort()
+                mesh_editor.add_cell(idx, np.array(c_data_tmp, dtype=np.uintp))
+
+    else:
+
+        for idx, (c_id, c_data) in enumerate(elems.items()):
+            c_nodes = []
+            for v_id in c_data:
+                try: c_nodes.append(node_ids_order[v_id])
+                except ValueError:
+                    handler.error("Element %s references non-existent node %s" % (c_id, v_id))
+            handler.add_cell(idx, c_nodes)
+
+            if process_facets:
+                c_nodes.sort()
+                mesh_editor.add_cell(idx, np.array(c_nodes, dtype=np.uintp))
+
+    handler.end_cells()
+
+    # Write MeshValueCollections to XML file
+    handler.start_domains()
+
+    # Build a abaqus node ID -> dolfin cell ID map (which is not unique but that is irrelevant here)
+    #                           and its local entity.
+    if len(node_sets.items()) > 0:
+        node_cell_map = {}
+        for c_dolfin_index, (c_index, c_data) in enumerate(elems.items()):
+            c_data_tmp = np.array(c_data)
+            c_data_tmp.sort()
+            for local_entity, n_index in enumerate(c_data_tmp):
+                node_cell_map[n_index] = (c_dolfin_index, local_entity)
+
+    # Write vertex/node sets
+    dim = 0
+    for value, (name, node_set) in enumerate(node_sets.items()):
+        handler.start_mesh_value_collection(name, dim, len(node_set), "uint")
+
+        for node in node_set:
+            try:
+                cell, local_entity = node_cell_map[node]
+                handler.add_entity_mesh_value_collection(dim, cell, value, local_entity=local_entity)
+            except KeyError:
+                print "Warning: Boundary references non-existent node %s" % node
+        handler.end_mesh_value_collection()
+
+    # Write cell/element sets
+    dim = 3
+    for name, s in cell_sets.items():
+        handler.start_mesh_value_collection(name, dim, len(s), "uint")
+        for cell in s:
+            handler.add_entity_mesh_value_collection(dim, cell, 0)
+        handler.end_mesh_value_collection()
+
+    # Write surface sets
+    if process_facets:
+        dim = 2
+        nodes_facet_map = _nodes_facet_map(mesh)
+
+        data = [int(0)] * mesh.num_facets()
+        S1 = [0, 1, 2]
+        S2 = [0, 3, 1]
+        S3 = [1, 3, 2]
+        S4 = [2, 3, 0]
+        node_selector = {'S1': S1,
+                         'S2': S2,
+                         'S3': S3,
+                         'S4': S4,
+                         }
+
+        for index, (name, s) in enumerate(surface_sets.items()):
+            cell_face_list = []
+            for cell_set_name, face_index in s:
+                cell_face_list += [(cell, face_index) for cell in cell_sets[cell_set_name]]
+
+            for cell, face in cell_face_list:
+                cell_nodes = elems[cell]
+                # Extract the face nodes
+                face_nodes = [cell_nodes[i] for i in node_selector[face]]
+                dolfin_face_nodes = [node_ids_order[n] for n in face_nodes]
+                dolfin_face_nodes.sort()
+                # Convert the face_nodes to dolfin IDs
+                face_id = nodes_facet_map[tuple(dolfin_face_nodes)]
+                data[face_id] = index + 1
+
+        # Create and initialise the mesh function
+        handler.start_meshfunction("facet_region", dim, mesh.num_facets() )
+        for index, physical_region in enumerate (data):
+            handler.add_entity_meshfunction(index, physical_region)
+        handler.end_meshfunction()
+
+
+    handler.end_domains()
+
+def _nodes_facet_map(mesh):
+    # Now process the facet markers
+    dim = 2
+    mesh.init(dim, 0)
+    facets_as_nodes = mesh.topology()(dim, 0)().reshape(mesh.num_facets(), 3)
+
+    # Build the reverse map
+    nodes_as_facets = {}
+    for facet in range(mesh.num_facets()):
+        nodes_as_facets[tuple(facets_as_nodes[facet,:])] = facet
+
+    return nodes_as_facets
+
+
+def _read_heading(l):
+    return l[0].strip()
+
+
+def _read_part_name(l):
+
+    if (len(l) < 2): print "Ooops, length problem."
+    part_names = l[1].split('=')
+
+    if (len(part_names) < 2): print "Ooops, part names length problem."
+    return part_names[1].strip()
+
+
+def _create_node_list_entry(node_sets, l):
+
+    # Check for node set name
+    node_set_name = None
+    if len(l) == 2:
+        set_data = l[1].split('=')
+        assert len(set_data) == 2, "wrong list length"
+        if set_data[0].lower() == "nset":
+            node_set_name = set_data[1]
+            if node_set_name not in node_sets:
+                node_sets[node_set_name] = set()
+    return node_set_name
+
+def _read_element_keywords(cell_sets, l):
+
+    # Get element type and element set name
+    element_type = None
+    element_set_name = None
+    for key in l[1:]:
+        key_parts = key.split('=')
+        key_name = key_parts[0].lower().strip()
+        if key_name == "type":
+            element_type = key_parts[1].lower().strip()
+        elif key_name == "elset":
+            element_set_name = key_parts[1].strip()
+
+    # Test that element is supported
+    check_element_support(element_type)
+
+    # Add empty set to cell_sets dictionary
+    if element_set_name:
+        if element_set_name not in cell_sets:
+            cell_sets[element_set_name] = set()
+
+    return element_type, element_set_name
+
+
+def _read_nset_keywords(node_sets, l):
+
+    node_set_name = None
+    generate = None
+
+    # Get set name and add to dict
+    set_data = l[1].split('=')
+    assert len(set_data) == 2, "wrong list length, set name missing"
+    assert set_data[0].lower() == "nset"
+    node_set_name = set_data[1]
+    if node_set_name not in node_sets:
+        node_sets[node_set_name] = set()
+
+    # Check for generate flag
+    if len(l) == 3:
+        if l[2].lower() == "generate":
+           generate = True
+
+    return node_set_name, generate
+
+
+def _read_elset_keywords(sets, l):
+
+    set_name = None
+    generate = None
+
+    # Get set name and add to dict
+    set_data = l[1].split('=')
+    assert len(set_data) == 2, "wrong list length, set name missing"
+    assert set_data[0].lower() == "elset"
+    set_name = set_data[1]
+    if set_name not in sets: sets[set_name] = set()
+
+    # Check for generate flag
+    if len(l) == 3:
+        if l[2].lower() == "generate":
+            generate = True
+
+    return set_name, generate
+
+def _read_surface_keywords(sets, l):
+
+    surface_name = None
+    generate = None
+
+    # Get surface name and add to dict
+    surface_data = l[1].split('=')
+    assert len(surface_data) == 2, "wrong list length, surface name missing"
+    assert surface_data[0].lower() == "name"
+    surface_name = surface_data[1]
+    if surface_name not in sets: sets[surface_name] = set()
+
+    generate = False
+    return surface_name, generate
+
+
+def check_element_support(element_type):
+    supported_elements = ('c3d4',)
+    if element_type.lower() not in supported_elements:
+        raise StandardError("Element type not supported.")
diff --git a/site-packages/dolfin_utils/meshconvert/meshconvert.py b/site-packages/dolfin_utils/meshconvert/meshconvert.py
new file mode 100644
index 0000000..182c899
--- /dev/null
+++ b/site-packages/dolfin_utils/meshconvert/meshconvert.py
@@ -0,0 +1,1449 @@
+""" Module for converting various mesh formats."""
+
+# Copyright (C) 2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Garth N. Wells (gmsh function)
+# Modified by Alexander H. Jarosch (gmsh fix)
+# Modified by Angelo Simone (Gmsh and Medit fix)
+# Modified by Andy R. Terrel (gmsh fix and triangle function)
+# Modified by Magnus Vikstrom (metis and scotch function)
+# Modified by Bartosz Sawicki (diffpack function)
+# Modified by Gideon Simpson (Exodus II function)
+# Modified by Kent-Andre Mardal (Star-CD function)
+# Modified by Nuno Lopes (fix for emc2 mesh format (medit version 0))
+# Modified by Neilen Marais (add gmsh support for reading physical region)
+# Modified by Evan Lezar (add support for reading gmsh physical regions on facets)
+# Modified by Jan Blechta (add triangle support for marker on edges and attributes on triangles)
+#
+# Last changed: 2014-02-06
+
+# NOTE: This module does not depend on (py)dolfin beeing installed.
+# NOTE: If future additions need that please import dolfin in a try: except:
+# NOTE: clause and tell the user to install dolfin if it is not installed.
+
+import getopt
+import sys
+from instant import get_status_output
+import re
+import warnings
+import os.path
+
+import abaqus
+import xml_writer
+import numpy
+
+def format_from_suffix(suffix):
+    "Return format for given suffix"
+    if suffix == "xml":
+        return "xml"
+    elif suffix == "mesh":
+        return "mesh"
+    elif suffix == "gmsh":
+        return "gmsh"
+    elif suffix == "msh":
+        return "gmsh"
+    elif suffix == "gra":
+        return "metis"
+    elif suffix == "grf":
+        return "scotch"
+    elif suffix == "grid":
+        return "diffpack"
+    elif suffix == "inp":
+        return "abaqus"
+    elif suffix == "ncdf":
+        return "NetCDF"
+    elif suffix =="exo":
+        return "ExodusII"
+    elif suffix =="e":
+        return "ExodusII"
+    elif suffix == "vrt" or suffix == "cel":
+        return "StarCD"
+    elif suffix == "ele" or suffix == "node":
+        return "Triangle"
+    else:
+        _error("Sorry, unknown suffix %s." % suffix)
+
+def mesh2xml(ifilename, ofilename):
+    """Convert between .mesh and .xml, parser implemented as a
+    state machine:
+
+        0 = read 'Dimension'
+        1 = read dimension
+        2 = read 'Vertices'
+        3 = read number of vertices
+        4 = read next vertex
+        5 = read 'Triangles' or 'Tetrahedra'
+        6 = read number of cells
+        7 = read next cell
+        8 = done
+
+    """
+
+    print "Converting from Medit format (.mesh) to DOLFIN XML format"
+
+    # Open files
+    ifile = open(ifilename, "r")
+    ofile = open(ofilename, "w")
+
+    # Scan file for cell type
+    cell_type = None
+    dim = 0
+    while 1:
+
+        # Read next line
+        line = ifile.readline()
+        if not line: break
+
+        # Remove newline
+        if line[-1] == "\n":
+            line = line[:-1]
+
+        # Read dimension
+        if  line == "Dimension" or line == " Dimension":
+            line = ifile.readline()
+            num_dims = int(line)
+            if num_dims == 2:
+                cell_type = "triangle"
+                dim = 2
+            elif num_dims == 3:
+                cell_type = "tetrahedron"
+                dim = 3
+            break
+
+    # Check that we got the cell type
+    if cell_type == None:
+        _error("Unable to find cell type.")
+
+    # Step to beginning of file
+    ifile.seek(0)
+
+    # Write header
+    xml_writer.write_header_mesh(ofile, cell_type, dim)
+
+    # Current state
+    state = 0
+
+    # Write data
+    num_vertices_read = 0
+    num_cells_read = 0
+
+    while 1:
+
+        # Read next line
+        line = ifile.readline()
+        if not line: break
+
+        # Skip comments
+        if line[0] == '#':
+            continue
+
+        # Remove newline
+        if line[-1] == "\n":
+            line = line[:-1]
+
+        if state == 0:
+            if line == "Dimension" or line == " Dimension":
+                state += 1
+        elif state == 1:
+            num_dims = int(line)
+            state +=1
+        elif state == 2:
+            if line == "Vertices" or line == " Vertices":
+                state += 1
+        elif state == 3:
+            num_vertices = int(line)
+            xml_writer.write_header_vertices(ofile, num_vertices)
+            state +=1
+        elif state == 4:
+            if num_dims == 2:
+                (x, y, tmp) = line.split()
+                x = float(x)
+                y = float(y)
+                z = 0.0
+            elif num_dims == 3:
+                (x, y, z, tmp) = line.split()
+                x = float(x)
+                y = float(y)
+                z = float(z)
+            xml_writer.write_vertex(ofile, num_vertices_read, x, y, z)
+            num_vertices_read +=1
+            if num_vertices == num_vertices_read:
+                xml_writer.write_footer_vertices(ofile)
+                state += 1
+        elif state == 5:
+            if (line == "Triangles"  or line == " Triangles") and num_dims == 2:
+                state += 1
+            if line == "Tetrahedra" and num_dims == 3:
+                state += 1
+        elif state == 6:
+            num_cells = int(line)
+            xml_writer.write_header_cells(ofile, num_cells)
+            state +=1
+        elif state == 7:
+            if num_dims == 2:
+                (n0, n1, n2, tmp) = line.split()
+                n0 = int(n0) - 1
+                n1 = int(n1) - 1
+                n2 = int(n2) - 1
+                xml_writer.write_cell_triangle(ofile, num_cells_read, n0, n1, n2)
+            elif num_dims == 3:
+                (n0, n1, n2, n3, tmp) = line.split()
+                n0 = int(n0) - 1
+                n1 = int(n1) - 1
+                n2 = int(n2) - 1
+                n3 = int(n3) - 1
+                xml_writer.write_cell_tetrahedron(ofile, num_cells_read, n0, n1, n2, n3)
+            num_cells_read +=1
+            if num_cells == num_cells_read:
+                xml_writer.write_footer_cells(ofile)
+                state += 1
+        elif state == 8:
+            break
+
+    # Check that we got all data
+    if state == 8:
+        print "Conversion done"
+    else:
+        _error("Missing data, unable to convert")
+
+    # Write footer
+    xml_writer.write_footer_mesh(ofile)
+
+    # Close files
+    ifile.close()
+    ofile.close()
+
+def gmsh2xml(ifilename, handler):
+    """Convert between .gmsh v2.0 format (http://www.geuz.org/gmsh/) and .xml,
+    parser implemented as a state machine:
+
+        0 = read 'MeshFormat'
+        1 = read  mesh format data
+        2 = read 'EndMeshFormat'
+        3 = read 'Nodes'
+        4 = read  number of vertices
+        5 = read  vertices
+        6 = read 'EndNodes'
+        7 = read 'Elements'
+        8 = read  number of cells
+        9 = read  cells
+        10 = done
+
+    Afterwards, extract physical region numbers if they are defined in
+    the mesh file as a mesh function.
+
+    """
+
+    print "Converting from Gmsh format (.msh, .gmsh) to DOLFIN XML format"
+
+    # The dimension of the gmsh element types supported here as well as the dolfin cell types for each dimension
+    gmsh_dim = {15: 0, 1: 1, 2: 2, 4: 3}
+    cell_type_for_dim = {1: "interval", 2: "triangle", 3: "tetrahedron" }
+    # the gmsh element types supported for conversion
+    supported_gmsh_element_types = [1, 2, 4, 15]
+
+    # Open files
+    ifile = open(ifilename, "r")
+
+    # Scan file for cell type
+    cell_type = None
+    highest_dim = 0
+    line = ifile.readline()
+    while line:
+
+        # Remove newline
+        if line[-1] == "\n":
+            line = line[:-1]
+
+        # Read dimension
+        if line.find("$Elements") == 0:
+
+            line = ifile.readline()
+            num_elements = int(line)
+            if num_elements == 0:
+                _error("No elements found in gmsh file.")
+            line = ifile.readline()
+
+            # Now iterate through elements to find largest dimension.  Gmsh
+            # format might include elements of lower dimensions in the element list.
+            # We also need to count number of elements of correct dimensions.
+            # Also determine which vertices are not used.
+            dim_count = {0: 0, 1: 0, 2: 0, 3: 0}
+            vertices_used_for_dim = {0: [], 1: [], 2: [], 3: []}
+            # Array used to store gmsh tags for 1D (type 1/line), 2D (type 2/triangular) elements and 3D (type 4/tet) elements
+            tags_for_dim = {0: [], 1: [], 2: [], 3: []}
+
+            while line.find("$EndElements") == -1:
+                element = line.split()
+                elem_type = int(element[1])
+                num_tags = int(element[2])
+                if elem_type in supported_gmsh_element_types:
+                    dim = gmsh_dim[elem_type]
+                    if highest_dim < dim:
+                        highest_dim = dim
+                    node_num_list = [int(node) for node in element[3 + num_tags:]]
+                    vertices_used_for_dim[dim].extend(node_num_list)
+                    if num_tags > 0:
+                        tags_for_dim[dim].append(tuple(int(tag) for tag in element[3:3+num_tags]))
+                    dim_count[dim] += 1
+                else:
+                    #TODO: output a warning here. "gmsh element type %d not supported" % elem_type
+                    pass
+                line = ifile.readline()
+        else:
+            # Read next line
+            line = ifile.readline()
+
+    # Check that we got the cell type and set num_cells_counted
+    if highest_dim == 0:
+        _error("Unable to find cells of supported type.")
+
+    num_cells_counted = dim_count[highest_dim]
+    vertex_set = set(vertices_used_for_dim[highest_dim])
+    vertices_used_for_dim[highest_dim] = None
+
+    vertex_dict = {}
+    for n,v in enumerate(vertex_set):
+        vertex_dict[v] = n
+
+    # Step to beginning of file
+    ifile.seek(0)
+
+    # Set mesh type
+    handler.set_mesh_type(cell_type_for_dim[highest_dim], highest_dim)
+
+    # Initialise node list (gmsh does not export all vertexes in order)
+    nodelist = {}
+
+    # Current state
+    state = 0
+
+    # Write data
+    num_vertices_read = 0
+    num_cells_read = 0
+
+    # Only import the dolfin objects if facet markings exist
+    process_facets = False
+    if len(tags_for_dim[highest_dim-1]) > 0:
+        # first construct the mesh
+        try:
+            from dolfin import MeshEditor, Mesh
+        except ImportError:
+            _error("DOLFIN must be installed to handle Gmsh boundary regions")
+        mesh = Mesh()
+        mesh_editor = MeshEditor ()
+        mesh_editor.open( mesh, highest_dim, highest_dim )
+        process_facets = True
+    else:
+        # TODO: Output a warning or an error here
+        me = None
+
+    while state != 10:
+
+        # Read next line
+        line = ifile.readline()
+        if not line: break
+
+        # Skip comments
+        if line[0] == '#':
+            continue
+
+        # Remove newline
+        if line[-1] == "\n":
+            line = line[:-1]
+
+        if state == 0:
+            if line == "$MeshFormat":
+                state = 1
+        elif state == 1:
+            (version, file_type, data_size) = line.split()
+            state = 2
+        elif state == 2:
+            if line == "$EndMeshFormat":
+                state = 3
+        elif state == 3:
+            if line == "$Nodes":
+                state = 4
+        elif state == 4:
+            num_vertices = len(vertex_dict)
+            handler.start_vertices(num_vertices)
+            if process_facets:
+                mesh_editor.init_vertices_global(num_vertices, num_vertices)
+            state = 5
+        elif state == 5:
+            (node_no, x, y, z) = line.split()
+            node_no = int(node_no)
+            x,y,z = [float(xx) for xx in (x,y,z)]
+            if vertex_dict.has_key(node_no):
+                node_no = vertex_dict[node_no]
+            else:
+                continue
+            nodelist[int(node_no)] = num_vertices_read
+            handler.add_vertex(num_vertices_read, [x, y, z])
+            if process_facets:
+                if highest_dim == 1:
+                    coords = numpy.array([x])
+                elif highest_dim == 2:
+                    coords = numpy.array([x, y])
+                elif highest_dim == 3:
+                    coords = numpy.array([x, y, z])
+                mesh_editor.add_vertex(num_vertices_read, coords)
+
+            num_vertices_read +=1
+
+            if num_vertices == num_vertices_read:
+                handler.end_vertices()
+                state = 6
+        elif state == 6:
+            if line == "$EndNodes":
+                state = 7
+        elif state == 7:
+            if line == "$Elements":
+                state = 8
+        elif state == 8:
+            handler.start_cells(num_cells_counted)
+            if process_facets:
+                mesh_editor.init_cells_global(num_cells_counted, num_cells_counted)
+
+            state = 9
+        elif state == 9:
+            element = line.split()
+            elem_type = int(element[1])
+            num_tags  = int(element[2])
+            if elem_type in supported_gmsh_element_types:
+                dim = gmsh_dim[elem_type]
+            else:
+                dim = 0
+            if dim == highest_dim:
+                node_num_list = [vertex_dict[int(node)] for node in element[3 + num_tags:]]
+                for node in node_num_list:
+                    if not node in nodelist:
+                        _error("Vertex %d of %s %d not previously defined." %
+                              (node, cell_type_for_dim[dim], num_cells_read))
+                cell_nodes = [nodelist[n] for n in node_num_list]
+                handler.add_cell(num_cells_read, cell_nodes)
+
+                if process_facets:
+                    cell_nodes = numpy.array([nodelist[n] for n in node_num_list], dtype=numpy.uintp)
+                    mesh_editor.add_cell(num_cells_read, cell_nodes)
+
+                num_cells_read +=1
+
+            if num_cells_counted == num_cells_read:
+                handler.end_cells()
+                if process_facets:
+                    mesh_editor.close()
+                state = 10
+        elif state == 10:
+            break
+
+    # Write mesh function based on the Physical Regions defined by
+    # gmsh, but only if they are not all zero. All zero physical
+    # regions indicate that no physical regions were defined.
+    if highest_dim not in [1,2,3]:
+        _error("Gmsh tags not supported for dimension %i. Probably a bug" % dim)
+
+    tags = tags_for_dim[highest_dim]
+    physical_regions = tuple(tag[0] for tag in tags)
+    if not all(tag == 0 for tag in physical_regions):
+        handler.start_meshfunction("physical_region", dim, num_cells_counted)
+        for i, physical_region in enumerate(physical_regions):
+            handler.add_entity_meshfunction(i, physical_region)
+        handler.end_meshfunction()
+
+    # Now process the facet markers
+    tags = tags_for_dim[highest_dim-1]
+    if (len(tags) > 0) and (mesh is not None):
+        physical_regions = tuple(tag[0] for tag in tags)
+        if not all(tag == 0 for tag in physical_regions):
+            mesh.init(highest_dim-1,0)
+
+            # Get the facet-node connectivity information (reshape as a row of node indices per facet)
+            if highest_dim==1:
+              # for 1d meshes the mesh topology returns the vertex to vertex map, which isn't what we want
+              # as facets are vertices
+              facets_as_nodes = numpy.array([[i] for i in range(mesh.num_facets())])
+            else:
+              facets_as_nodes = mesh.topology()(highest_dim-1,0)().reshape ( mesh.num_facets(), highest_dim )
+
+            # Build the reverse map
+            nodes_as_facets = {}
+            for facet in range(mesh.num_facets()):
+              nodes_as_facets[tuple(facets_as_nodes[facet,:])] = facet
+
+            data = [int(0*k) for k in range(mesh.num_facets()) ]
+            for i, physical_region in enumerate(physical_regions):
+                nodes = [n-1 for n in vertices_used_for_dim[highest_dim-1][highest_dim*i:(highest_dim*i+highest_dim)]]
+                nodes.sort()
+
+                if physical_region != 0:
+                    try:
+                        index = nodes_as_facets[tuple(nodes)]
+                        data[index] = physical_region
+                    except IndexError:
+                        raise Exception ( "The facet (%d) was not found to mark: %s" % (i, nodes) )
+
+            # Create and initialise the mesh function
+            handler.start_meshfunction("facet_region", highest_dim-1, mesh.num_facets() )
+            for index, physical_region in enumerate ( data ):
+                handler.add_entity_meshfunction(index, physical_region)
+            handler.end_meshfunction()
+
+    # Check that we got all data
+    if state == 10:
+        print "Conversion done"
+    else:
+       _error("Missing data, unable to convert \n\ Did you use version 2.0 of the gmsh file format?")
+
+    # Close files
+    ifile.close()
+
+def triangle2xml(ifilename, ofilename):
+    """Convert between triangle format
+    (http://www.cs.cmu.edu/~quake/triangle.html) and .xml.  The
+    given ifilename should be the prefix for the corresponding
+    .node, and .ele files.
+    """
+
+    def get_next_line (fp):
+        """Helper function for skipping comments and blank lines"""
+        line = fp.readline()
+        if line == '':
+            _error("Hit end of file prematurely.")
+        line = line.strip()
+        if not (line.startswith('#') or line == ''):
+            return line
+        return get_next_line(fp)
+
+
+    print "Converting from Triangle format {.node, .ele} to DOLFIN XML format"
+
+    # Open files
+    for suffix in [".node", ".ele"]:
+        if suffix in ifilename and ifilename[-len(suffix):] == suffix:
+            ifilename = ifilename.replace(suffix, "")
+    node_file = open(ifilename+".node", "r")
+    ele_file =  open(ifilename+".ele", "r")
+    ofile = open(ofilename, "w")
+    try:
+        edge_file = open(ifilename+".edge", "r")
+        print "Found .edge file"
+    except IOError:
+        edge_file = None
+
+    # Read all the nodes
+    nodes = {}
+    num_nodes, dim, attr, bound = map(int, get_next_line(node_file).split())
+    while len(nodes) < num_nodes:
+        node, x, y = get_next_line(node_file).split()[:3]
+        nodes[int(node)] = (float(x), float(y))
+
+    # Read all the triangles
+    tris = {}
+    tri_attrs = {}
+    num_tris, n_per_tri, attrs = map(int, get_next_line(ele_file).split())
+    while len(tris) < num_tris:
+        line = get_next_line(ele_file).split()
+        tri, n1, n2, n3 = map(int, line[:4])
+        # vertices are ordered according to current UFC ordering scheme -
+        # - may change in future!
+        tris[tri] = tuple(sorted((n1, n2, n3)))
+        tri_attrs[tri] = tuple(map(float, line[4:4+attrs]))
+
+    # Read all the boundary markers from edges
+    edge_markers_global = {}
+    edge_markers_local = []
+    got_negative_edge_markers = False
+    if edge_file is not None:
+        num_edges, num_edge_markers = map(int, get_next_line(edge_file).split())
+        if num_edge_markers == 1:
+            while len(edge_markers_global) < num_edges:
+                edge, v1, v2, marker = map(int, get_next_line(edge_file).split())
+                if marker < 0: got_negative_edge_markers = True
+                edge_markers_global[tuple(sorted((v1, v2)))] = marker
+            if got_negative_edge_markers:
+                print   "Some edge markers are negative! dolfin will increase "\
+                        "them by probably 2**32 when loading xml. "\
+                        "Consider using non-negative edge markers only."
+            for tri, vertices in tris.iteritems():
+                v0, v1, v2 = sorted((vertices[0:3]))
+                try:
+                    edge_markers_local.append((tri, 0, \
+                              edge_markers_global[(v1, v2)]))
+                    edge_markers_local.append((tri, 1, \
+                              edge_markers_global[(v0, v2)]))
+                    edge_markers_local.append((tri, 2, \
+                              edge_markers_global[(v0, v1)]))
+                except IndexError:
+                    raise Exception("meshconvert.py: The facet was not found.")
+        elif num_edge_markers == 0:
+            print "...but no markers in it. Ignoring it"
+        else:
+            print "...but %d markers specified in it. It won't be processed."\
+                          %num_edge_markers
+
+    # Write everything out
+    xml_writer.write_header_mesh(ofile, "triangle", 2)
+    xml_writer.write_header_vertices(ofile, num_nodes)
+    node_off = 0 if nodes.has_key(0) else -1
+    for node, node_t in nodes.iteritems():
+        xml_writer.write_vertex(ofile, node+node_off, node_t[0], node_t[1], 0.0)
+    xml_writer.write_footer_vertices(ofile)
+    xml_writer.write_header_cells(ofile, num_tris)
+    tri_off = 0 if tris.has_key(0) else -1
+    for tri, tri_t in tris.iteritems():
+        xml_writer.write_cell_triangle(ofile, tri+tri_off, tri_t[0] + node_off,
+                                       tri_t[1] + node_off, tri_t[2] + node_off)
+    xml_writer.write_footer_cells(ofile)
+    if len(edge_markers_local) > 0:
+        xml_writer.write_header_domains(ofile)
+        xml_writer.write_header_meshvaluecollection(ofile, \
+                            "edge markers", 1, len(edge_markers_local), "uint")
+        for tri, local_edge, marker in edge_markers_local:
+             xml_writer.write_entity_meshvaluecollection(ofile, \
+                                            1, tri+tri_off, marker, local_edge)
+        xml_writer.write_footer_meshvaluecollection(ofile)
+        xml_writer.write_footer_domains(ofile)
+    xml_writer.write_footer_mesh(ofile)
+    for i in range(attrs):
+        afilename = ofilename.replace(".xml", ".attr"+str(i)+".xml")
+        afile = open(afilename, "w")
+        xml_writer.write_header_meshfunction2(afile)
+        xml_writer.write_header_meshvaluecollection(afile, \
+                             "triangle attribs "+str(i), 2, num_tris, "double")
+        for tri, tri_a in tri_attrs.iteritems():
+             xml_writer.write_entity_meshvaluecollection(afile, \
+                                            2, tri+tri_off, tri_a[i], 0)
+        xml_writer.write_footer_meshvaluecollection(afile)
+        xml_writer.write_footer_meshfunction(afile)
+        print "triangle attributes from .ele file written to "+afilename
+        afile.close()
+
+    # Close files
+    node_file.close()
+    ele_file.close()
+    if edge_file is not None:
+        edge_file.close()
+    ofile.close()
+
+
+def xml_old2xml(ifilename, ofilename):
+    "Convert from old DOLFIN XML format to new."
+
+    print "Converting from old (pre DOLFIN 0.6.2) to new DOLFIN XML format..."
+
+    # Open files
+    ifile = open(ifilename, "r")
+    ofile = open(ofilename, "w")
+
+    # Scan file for cell type (assuming there is just one)
+    cell_type = None
+    dim = 0
+    while 1:
+
+        # Read next line
+        line = ifile.readline()
+        if not line: break
+
+        # Read dimension
+        if "<triangle" in line:
+            cell_type = "triangle"
+            dim = 2
+            break
+        elif "<tetrahedron" in line:
+            cell_type = "tetrahedron"
+            dim = 3
+            break
+
+    # Step to beginning of file
+    ifile.seek(0)
+
+    # Read lines and make changes
+    while 1:
+
+        # Read next line
+        line = ifile.readline()
+        if not line: break
+
+        # Modify line
+        if "xmlns" in line:
+            line = "<dolfin xmlns:dolfin=\"http://fenicsproject.org\">\n"
+        if "<mesh>" in line:
+            line = "  <mesh celltype=\"%s\" dim=\"%d\">\n" % (cell_type, dim)
+        if dim == 2 and " z=\"0.0\"" in line:
+            line = line.replace(" z=\"0.0\"", "")
+        if " name=" in line:
+            line = line.replace(" name=", " index=")
+        if " name =" in line:
+            line = line.replace(" name =", " index=")
+        if "n0" in line:
+            line = line.replace("n0", "v0")
+        if "n1" in line:
+            line = line.replace("n1", "v1")
+        if "n2" in line:
+            line = line.replace("n2", "v2")
+        if "n3" in line:
+            line = line.replace("n3", "v3")
+
+        # Write line
+        ofile.write(line)
+
+    # Close files
+    ifile.close();
+    ofile.close();
+    print "Conversion done"
+
+def metis_graph2graph_xml(ifilename, ofilename):
+    "Convert from Metis graph format to DOLFIN Graph XML."
+
+    print "Converting from Metis graph format to DOLFIN Graph XML."
+
+    # Open files
+    ifile = open(ifilename, "r")
+    ofile = open(ofilename, "w")
+
+    # Read number of vertices and edges
+    line = ifile.readline()
+    if not line:
+       _error("Empty file")
+
+    (num_vertices, num_edges) = line.split()
+
+    xml_writer.write_header_graph(ofile, "directed")
+    xml_writer.write_header_vertices(ofile, int(num_vertices))
+
+    for i in range(int(num_vertices)):
+        line = ifile.readline()
+        edges = line.split()
+        xml_writer.write_graph_vertex(ofile, i, len(edges))
+
+    xml_writer.write_footer_vertices(ofile)
+    xml_writer.write_header_edges(ofile, 2*int(num_edges))
+
+    # Step to beginning of file and skip header info
+    ifile.seek(0)
+    ifile.readline()
+    for i in range(int(num_vertices)):
+        print "vertex %g", i
+        line = ifile.readline()
+        edges = line.split()
+        for e in edges:
+            xml_writer.write_graph_edge(ofile, i, int(e))
+
+    xml_writer.write_footer_edges(ofile)
+    xml_writer.write_footer_graph(ofile)
+
+    # Close files
+    ifile.close();
+    ofile.close();
+
+def scotch_graph2graph_xml(ifilename, ofilename):
+    "Convert from Scotch graph format to DOLFIN Graph XML."
+
+    print "Converting from Scotch graph format to DOLFIN Graph XML."
+
+    # Open files
+    ifile = open(ifilename, "r")
+    ofile = open(ofilename, "w")
+
+    # Skip graph file version number
+    ifile.readline()
+
+    # Read number of vertices and edges
+    line = ifile.readline()
+    if not line:
+       _error("Empty file")
+
+    (num_vertices, num_edges) = line.split()
+
+    # Read start index and numeric flag
+    # Start index is 0 or 1 (C/Fortran)
+    # Numeric flag is 3 bits where bit 1 enables vertex labels
+    # bit 2 enables edge weights and bit 3 enables vertex weights
+
+    line = ifile.readline()
+    (start_index, numeric_flag) = line.split()
+
+    # Handling not implented
+    if not numeric_flag == "000":
+       _error("Handling of scotch vertex labels, edge- and vertex weights not implemented")
+
+    xml_writer.write_header_graph(ofile, "undirected")
+    xml_writer.write_header_vertices(ofile, int(num_vertices))
+
+    # Read vertices and edges, first number gives number of edges from this vertex (not used)
+    for i in range(int(num_vertices)):
+        line = ifile.readline()
+        edges = line.split()
+        xml_writer.write_graph_vertex(ofile, i, len(edges)-1)
+
+    xml_writer.write_footer_vertices(ofile)
+    xml_writer.write_header_edges(ofile, int(num_edges))
+
+
+    # Step to beginning of file and skip header info
+    ifile.seek(0)
+    ifile.readline()
+    ifile.readline()
+    ifile.readline()
+    for i in range(int(num_vertices)):
+        line = ifile.readline()
+
+        edges = line.split()
+        for j in range(1, len(edges)):
+            xml_writer.write_graph_edge(ofile, i, int(edges[j]))
+
+    xml_writer.write_footer_edges(ofile)
+    xml_writer.write_footer_graph(ofile)
+
+    # Close files
+    ifile.close();
+    ofile.close();
+
+
+def diffpack2xml(ifilename, ofilename):
+    "Convert from Diffpack tetrahedral/triangle grid format to DOLFIN XML."
+
+    print diffpack2xml.__doc__
+
+    # Format strings for MeshFunction XML files
+    meshfunction_header = """\
+<?xml version="1.0" encoding="UTF-8"?>\n
+<dolfin xmlns:dolfin="http://www.fenics.org/dolfin/">
+  <mesh_function type="uint" dim="%d" size="%d">\n"""
+    meshfunction_entity = "    <entity index=\"%d\" value=\"%d\"/>\n"
+    meshfunction_footer = "  </mesh_function>\n</dolfin>"
+
+    # Open files
+    ifile = open(ifilename, "r")
+    ofile = open(ofilename, "w")
+
+    # Read and analyze header
+    while 1:
+        line = ifile.readline()
+        if not line:
+           _error("Empty file")
+        if line[0] == "#":
+            break
+        if re.search(r"Number of elements", line):
+	    num_cells = int(re.match(r".*\s(\d+).*", line).group(1))
+        if re.search(r"Number of nodes", line):
+	    num_vertices = int(re.match(r".*\s(\d+).*", line).group(1))
+        if re.search(r"Number of space dim.", line):
+            num_dims = int(re.match(r".*\s(\d+).*", line).group(1))
+
+    if num_dims == 3:
+        xml_writer.write_header_mesh(ofile, "tetrahedron", 3)
+        elem_type = "ElmT4n3D"
+        write_cell_func = xml_writer.write_cell_tetrahedron
+    else:
+        xml_writer.write_header_mesh(ofile, "triangle", 2)
+        elem_type = "ElmT3n2D"
+        write_cell_func = xml_writer.write_cell_triangle
+
+    xml_writer.write_header_vertices(ofile, num_vertices)
+
+    # Read & write vertices and collect markers for vertices
+    vertex_markers = []
+    unique_vertex_markers = set()
+    for i in range(num_vertices):
+        line = ifile.readline()
+        m = re.match(r"^.*\(\s*(.*)\s*\).*\](.*)$", line)
+        x = map(float, re.split("[\s,]+", m.group(1)))
+        xml_writer.write_vertex(ofile, i, *x)
+        markers = map(int, m.group(2).split())
+        vertex_markers.append(markers)
+        unique_vertex_markers.update(markers)
+
+    xml_writer.write_footer_vertices(ofile)
+    xml_writer.write_header_cells(ofile, num_cells)
+
+    # Output unique vertex markers as individual VertexFunctions
+    unique_vertex_markers.difference_update([0])
+    for unique_marker in unique_vertex_markers:
+        ofile_marker = open(ofilename.replace(".xml", "") + \
+                            "_marker_" + str(unique_marker)+".xml", "w")
+        xml_writer.write_header_meshfunction(ofile_marker, 0, num_vertices)
+        for ind, markers in enumerate(vertex_markers):
+            if unique_marker in markers:
+                xml_writer.write_entity_meshfunction(ofile_marker, ind, unique_marker)
+            else:
+                xml_writer.write_entity_meshfunction(ofile_marker, ind, 0)
+        xml_writer.write_footer_meshfunction(ofile_marker)
+
+    # Ignore comment lines
+    while 1:
+        line = ifile.readline()
+        if not line:
+           _error("Empty file")
+        if line[0] == "#":
+            break
+
+    # Read & write cells and collect cell and face markers
+    cell_markers = []
+    facet_markers = []
+    facet_to_vert = [[1,2,3], [0,2,3], [0,1,3], [0,1,2]]
+    vert_to_facet = facet_to_vert # The same!
+
+    cell_ind = 0
+    while cell_ind < num_cells:
+        line = ifile.readline()
+        v = line.split()
+        if not v:
+            continue
+
+        if v[1] != elem_type:
+           _error("Only tetrahedral (ElmT4n3D) and triangular (ElmT3n2D) elements are implemented.")
+
+        # Store Cell markers
+        cell_markers.append(int(v[2]))
+
+        # Sort vertex indices
+        cell_indices = sorted(map(lambda x: int(x)-1, v[3:]))
+        write_cell_func(ofile, cell_ind, *cell_indices)
+
+        if num_dims == 2:
+            cell_ind += 1
+            continue
+
+        # Check Facet info
+        process_facet = set(range(4))
+        for local_vert_ind, global_vert_ind in enumerate(cell_indices):
+
+            # If no marker is included for vertex skip corresponding facet
+            if not vertex_markers[global_vert_ind]:
+                process_facet.difference_update(facet_to_vert[local_vert_ind])
+
+        # Process facets
+        for local_facet in process_facet:
+
+            # Start with markers from first vertex
+            global_first_vertex = cell_indices[facet_to_vert[local_facet][0]]
+            marker_intersection = set(vertex_markers[global_first_vertex])
+
+            # Process the other vertices
+            for local_vert in facet_to_vert[local_facet][1:]:
+                marker_intersection.intersection_update(\
+                    vertex_markers[cell_indices[local_vert]])
+
+                if not marker_intersection:
+                    break
+
+            # If not break we have a marker on local_facet
+            else:
+                assert(len(marker_intersection)==1)
+                facet_markers.append((cell_ind, local_facet, \
+                                      marker_intersection.pop()))
+        # Bump cell_ind
+        cell_ind += 1
+
+    xml_writer.write_footer_cells(ofile)
+    xml_writer.write_header_domains(ofile)
+
+    # Write facet markers if any
+    if facet_markers:
+        xml_writer.write_header_meshvaluecollection(ofile, "m", 2, \
+                                                    len(facet_markers), "uint")
+        for cell, local_facet, marker in facet_markers:
+            xml_writer.write_entity_meshvaluecollection(ofile, 2, cell, \
+                                                        marker, local_facet)
+        xml_writer.write_footer_meshvaluecollection(ofile)
+
+    xml_writer.write_header_meshvaluecollection(ofile, "m", num_dims, \
+                                                len(cell_markers), "uint")
+    for cell, marker in enumerate(cell_markers):
+        xml_writer.write_entity_meshvaluecollection(ofile, num_dims, cell, \
+                                                    marker)
+    xml_writer.write_footer_meshvaluecollection(ofile)
+    xml_writer.write_footer_domains(ofile)
+    xml_writer.write_footer_mesh(ofile)
+
+    # Close files
+    ifile.close()
+    ofile.close()
+
+class ParseError(Exception):
+    """ Error encountered in source file.
+    """
+
+class DataHandler(object):
+    """ Baseclass for handlers of mesh data.
+
+    The actual handling of mesh data encountered in the source file is
+    delegated to a polymorfic object. Typically, the delegate will write the
+    data to XML.
+    @ivar _state: the state which the handler is in, one of State_*.
+    @ivar _cell_type: cell type in mesh. One of CellType_*.
+    @ivar _dim: mesh dimensions.
+    """
+    State_Invalid, State_Init, State_Vertices, State_Cells, \
+          State_MeshFunction, State_MeshValueCollection = range(6)
+    CellType_Tetrahedron, CellType_Triangle, CellType_Interval = range(3)
+
+    def __init__(self):
+        self._state = self.State_Invalid
+
+    def set_mesh_type(self, cell_type, dim):
+        assert self._state == self.State_Invalid
+        self._state = self.State_Init
+        if cell_type == "tetrahedron":
+            self._cell_type = self.CellType_Tetrahedron
+        elif cell_type == "triangle":
+            self._cell_type = self.CellType_Triangle
+        elif cell_type == "interval":
+            self._cell_type = self.CellType_Interval
+        self._dim = dim
+
+    def start_vertices(self, num_vertices):
+        assert self._state == self.State_Init
+        self._state = self.State_Vertices
+
+    def add_vertex(self, vertex, coords):
+        assert self._state == self.State_Vertices
+
+    def end_vertices(self):
+        assert self._state == self.State_Vertices
+        self._state = self.State_Init
+
+    def start_cells(self, num_cells):
+        assert self._state == self.State_Init
+        self._state = self.State_Cells
+
+    def add_cell(self, cell, nodes):
+        assert self._state == self.State_Cells
+
+    def end_cells(self):
+        assert self._state == self.State_Cells
+        self._state = self.State_Init
+
+    def start_domains(self):
+        assert self._state == self.State_Init
+
+    def end_domains(self):
+        self._state = self.State_Init
+
+    def start_meshfunction(self, name, dim, size):
+        assert self._state == self.State_Init
+        self._state = self.State_MeshFunction
+
+    def add_entity_meshfunction(self, index, value):
+        assert self._state == self.State_MeshFunction
+
+    def end_meshfunction(self):
+        assert self._state == self.State_MeshFunction
+        self._state = self.State_Init
+
+    def start_mesh_value_collection(self, name, dim, size, etype):
+        assert self._state == self.State_Init
+        self._state = self.State_MeshValueCollection
+
+    def add_entity_mesh_value_collection(self, dim, index, value, local_entity=0):
+        assert self._state == self.State_MeshValueCollection
+
+    def end_mesh_value_collection(self):
+        assert self._state == self.State_MeshValueCollection
+        self._state = self.State_Init
+
+    def warn(self, msg):
+        """ Issue warning during parse.
+        """
+        warnings.warn(msg)
+
+    def error(self, msg):
+        """ Raise error during parse.
+
+        This method is expected to raise ParseError.
+        """
+        raise ParseError(msg)
+
+    def close(self):
+        self._state = self.State_Invalid
+
+class XmlHandler(DataHandler):
+    """ Data handler class which writes to Dolfin XML.
+    """
+    def __init__(self, ofilename):
+        DataHandler.__init__(self)
+        self._ofilename = ofilename
+        self.__ofile = file(ofilename, "wb")
+        self.__ofile_meshfunc = None
+
+    def ofile(self):
+        return self.__ofile
+
+    def set_mesh_type(self, cell_type, dim):
+        DataHandler.set_mesh_type(self, cell_type, dim)
+        xml_writer.write_header_mesh(self.__ofile, cell_type, dim)
+
+    def start_vertices(self, num_vertices):
+        DataHandler.start_vertices(self, num_vertices)
+        xml_writer.write_header_vertices(self.__ofile, num_vertices)
+
+    def add_vertex(self, vertex, coords):
+        DataHandler.add_vertex(self, vertex, coords)
+        xml_writer.write_vertex(self.__ofile, vertex, *coords)
+
+    def end_vertices(self):
+        DataHandler.end_vertices(self)
+        xml_writer.write_footer_vertices(self.__ofile)
+
+    def start_cells(self, num_cells):
+        DataHandler.start_cells(self, num_cells)
+        xml_writer.write_header_cells(self.__ofile, num_cells)
+
+    def add_cell(self, cell, nodes):
+        DataHandler.add_cell(self, cell, nodes)
+        if self._cell_type == self.CellType_Tetrahedron:
+            func = xml_writer.write_cell_tetrahedron
+        elif self._cell_type == self.CellType_Triangle:
+            func = xml_writer.write_cell_triangle
+        elif self._cell_type == self.CellType_Interval:
+            func = xml_writer.write_cell_interval
+
+        func(self.__ofile, cell, *nodes)
+
+    def end_cells(self):
+        DataHandler.end_cells(self)
+        xml_writer.write_footer_cells(self.__ofile)
+
+    def start_meshfunction(self, name, dim, size):
+        DataHandler.start_meshfunction(self, name, dim, size)
+        fname = os.path.splitext(self.__ofile.name)[0]
+        self.__ofile_meshfunc = file("%s_%s.xml" % (fname, name), "wb")
+        xml_writer.write_header_meshfunction(self.__ofile_meshfunc, dim, size)
+
+    def add_entity_meshfunction(self, index, value):
+        DataHandler.add_entity_meshfunction(self, index, value)
+        xml_writer.write_entity_meshfunction(self.__ofile_meshfunc, index, value)
+
+    def end_meshfunction(self):
+        DataHandler.end_meshfunction(self)
+        xml_writer.write_footer_meshfunction(self.__ofile_meshfunc)
+        self.__ofile_meshfunc.close()
+        self.__ofile_meshfunc = None
+
+    def start_domains(self):
+        #DataHandler.start_domains(self)
+        xml_writer.write_header_domains(self.__ofile)
+
+    def end_domains(self):
+        #DataHandler.end_domains(self)
+        xml_writer.write_footer_domains(self.__ofile)
+
+    def start_mesh_value_collection(self, name, dim, size, etype):
+        DataHandler.start_mesh_value_collection(self, name, dim, size, etype)
+        xml_writer.write_header_meshvaluecollection(self.__ofile, name, dim, size, etype)
+
+    def add_entity_mesh_value_collection(self, dim, index, value, local_entity=0):
+        DataHandler.add_entity_mesh_value_collection(self, dim, index, value)
+        xml_writer.write_entity_meshvaluecollection(self.__ofile, dim, index, value, local_entity=local_entity)
+
+    def end_mesh_value_collection(self):
+        DataHandler.end_mesh_value_collection(self)
+        xml_writer.write_footer_meshvaluecollection(self.__ofile)
+
+    def close(self):
+        DataHandler.close(self)
+        if self.__ofile.closed:
+            return
+        xml_writer.write_footer_mesh(self.__ofile)
+        self.__ofile.close()
+        if self.__ofile_meshfunc is not None:
+            self.__ofile_meshfunc.close()
+
+
+def netcdf2xml(ifilename,ofilename):
+    "Convert from NetCDF format to DOLFIN XML."
+
+    print "Converting from NetCDF format (.ncdf) to DOLFIN XML format"
+
+    # Open files
+    ifile = open(ifilename, "r")
+    ofile = open(ofilename, "w")
+
+
+    cell_type = None
+    dim = 0
+
+    # Scan file for dimension, number of nodes, number of elements
+    while 1:
+        line = ifile.readline()
+        if not line:
+            _error("Empty file")
+        if re.search(r"num_dim.*=", line):
+            dim = int(re.match(".*\s=\s(\d+)\s;",line).group(1))
+        if re.search(r"num_nodes.*=", line):
+            num_vertices = int(re.match(".*\s=\s(\d+)\s;",line).group(1))
+        if re.search(r"num_elem.*=", line):
+            num_cells = int(re.match(".*\s=\s(\d+)\s;",line).group(1))
+        if re.search(r"connect1 =",line):
+            break
+
+    num_dims=dim
+
+    # Set cell type
+    if dim == 2:
+        cell_type ="triangle"
+    if dim == 3:
+        cell_type ="tetrahedron"
+
+    # Check that we got the cell type
+    if cell_type == None:
+        _error("Unable to find cell type.")
+
+    # Write header
+    xml_writer.write_header_mesh(ofile, cell_type, dim)
+    xml_writer.write_header_cells(ofile, num_cells)
+    num_cells_read = 0
+
+    # Read and write cells
+    while 1:
+        # Read next line
+        line = ifile.readline()
+        if not line:
+            break
+        connect=re.split("[,;]",line)
+        if num_dims == 2:
+            n0 = int(connect[0])-1
+            n1 = int(connect[1])-1
+            n2 = int(connect[2])-1
+            xml_writer.write_cell_triangle(ofile, num_cells_read, n0, n1, n2)
+        elif num_dims == 3:
+            n0 = int(connect[0])-1
+            n1 = int(connect[1])-1
+            n2 = int(connect[2])-1
+            n3 = int(connect[3])-1
+            xml_writer.write_cell_tetrahedron(ofile, num_cells_read, n0, n1, n2, n3)
+        num_cells_read +=1
+        if num_cells == num_cells_read:
+           xml_writer.write_footer_cells(ofile)
+           xml_writer.write_header_vertices(ofile, num_vertices)
+           break
+
+    num_vertices_read = 0
+    coords = [[],[],[]]
+    coord = -1
+
+    while 1:
+        line = ifile.readline()
+        if not line:
+            _error("Missing data")
+        if re.search(r"coord =",line):
+            break
+
+    # Read vertices
+    while 1:
+        line = ifile.readline()
+        if not line:
+            break
+        if re.search(r"\A\s\s\S+,",line):
+            coord+=1
+            print "Found x_"+str(coord)+" coordinates"
+        coords[coord] += line.split()
+        if re.search(r";",line):
+            break
+
+    # Write vertices
+    for i in range(num_vertices):
+        if num_dims == 2:
+            x = float(re.split(",",coords[0].pop(0))[0])
+            y = float(re.split(",",coords[1].pop(0))[0])
+            z = 0
+        if num_dims == 3:
+            x = float(re.split(",",coords[0].pop(0))[0])
+            y = float(re.split(",",coords[1].pop(0))[0])
+            z = float(re.split(",",coords[2].pop(0))[0])
+        xml_writer.write_vertex(ofile, i, x, y, z)
+
+
+    # Write footer
+    xml_writer.write_footer_vertices(ofile)
+    xml_writer.write_footer_mesh(ofile)
+
+    # Close files
+    ifile.close()
+    ofile.close()
+
+def exodus2xml(ifilename,ofilename):
+    "Convert from Exodus II format to DOLFIN XML."
+
+    print "Converting from Exodus II format to NetCDF format"
+
+    name = ifilename.split(".")[0]
+    netcdffilename = name +".ncdf"
+    status, output = get_status_output('ncdump '+ifilename + ' > '+netcdffilename)
+    if status != 0:
+        raise IOError, "Something wrong while executing ncdump. Is ncdump "\
+              "installed on the system?"
+    netcdf2xml(netcdffilename, ofilename)
+
+
+def _error(message):
+    "Write an error message"
+    for line in message.split("\n"):
+        print "*** %s" % line
+    sys.exit(2)
+
+def convert2xml(ifilename, ofilename, iformat=None):
+    """ Convert a file to the DOLFIN XML format.
+    """
+    convert(ifilename, XmlHandler(ofilename), iformat=iformat)
+
+def convert(ifilename, handler, iformat=None):
+    """ Convert a file using a provided data handler.
+
+    Note that handler.close is called when this function finishes.
+    @param ifilename: Name of input file.
+    @param handler: The data handler (instance of L{DataHandler}).
+    @param iformat: Format of input file.
+    """
+    if iformat is None:
+        iformat = format_from_suffix(os.path.splitext(ifilename)[1][1:])
+    # XXX: Backwards-compat
+    if hasattr(handler, "_ofilename"):
+        ofilename = handler._ofilename
+    # Choose conversion
+    if iformat == "mesh":
+        # Convert from mesh to xml format
+        mesh2xml(ifilename, ofilename)
+    elif iformat == "gmsh":
+        # Convert from gmsh to xml format
+        gmsh2xml(ifilename, handler)
+    elif iformat == "Triangle":
+        # Convert from Triangle to xml format
+        triangle2xml(ifilename, ofilename)
+    elif iformat == "xml-old":
+        # Convert from old to new xml format
+        xml_old2xml(ifilename, ofilename)
+    elif iformat == "metis":
+        # Convert from metis graph to dolfin graph xml format
+        metis_graph2graph_xml(ifilename, ofilename)
+    elif iformat == "scotch":
+        # Convert from scotch graph to dolfin graph xml format
+        scotch_graph2graph_xml(ifilename, ofilename)
+    elif iformat == "diffpack":
+        # Convert from Diffpack tetrahedral grid format to xml format
+        diffpack2xml(ifilename, ofilename)
+    elif iformat == "abaqus":
+        # Convert from abaqus to xml format
+        abaqus.convert(ifilename, handler)
+    elif iformat == "NetCDF":
+        # Convert from NetCDF generated from ExodusII format to xml format
+        netcdf2xml(ifilename, ofilename)
+    elif iformat =="ExodusII":
+        # Convert from ExodusII format to xml format via NetCDF
+        exodus2xml(ifilename, ofilename)
+    elif iformat == "StarCD":
+        # Convert from Star-CD tetrahedral grid format to xml format
+        starcd2xml(ifilename, ofilename)
+    else:
+        _error("Sorry, cannot convert between %s and DOLFIN xml file formats." % iformat)
+
+    # XXX: handler.close messes things for other input formats than abaqus or gmsh
+    if iformat in ("abaqus", "gmsh"):
+        handler.close()
+
+def starcd2xml(ifilename, ofilename):
+    "Convert from Star-CD tetrahedral grid format to DOLFIN XML."
+
+    print starcd2xml.__doc__
+
+    if not os.path.isfile(ifilename[:-3] + "vrt") or not os.path.isfile(ifilename[:-3] + "cel"):
+        print "StarCD format requires one .vrt file and one .cel file"
+        sys.exit(2)
+
+
+    # open output file
+    ofile = open(ofilename, "w")
+
+    # Open file, the vertices are in a .vrt file
+    ifile = open(ifilename[:-3] + "vrt", "r")
+
+    write_header_mesh(ofile, "tetrahedron", 3)
+
+    # Read & write vertices
+
+    # first, read all lines (need to sweep to times through the file)
+    lines = ifile.readlines()
+
+    # second, find the number of vertices
+    num_vertices = -1
+    counter = 0
+    # nodenr_map is needed because starcd support node numbering like 1,2,4 (ie 3 is missing)
+    nodenr_map = {}
+    for line in lines:
+        nodenr = int(line[0:15])
+        nodenr_map[nodenr] = counter
+        counter += 1
+    num_vertices = counter
+
+    # third, run over all vertices
+    xml_writer.write_header_vertices(ofile, num_vertices)
+    for line in lines:
+        nodenr = int(line[0:15])
+        vertex0 = float(line[15:31])
+        vertex1 = float(line[31:47])
+        vertex2 = float(line[47:63])
+        xml_writer.write_vertex(ofile, nodenr_map[nodenr], float(vertex0), float(vertex1), float(vertex2))
+    xml_writer.write_footer_vertices(ofile)
+
+    # Open file, the cells are in a .cel file
+    ifile = open(ifilename[:-3] + "cel", "r")
+
+    # Read & write cells
+
+    # first, read all lines (need to sweep to times through the file)
+    lines = ifile.readlines()
+
+    # second, find the number of cells
+    num_cells = -1
+    counter = 0
+    for line in lines:
+        l = [int(a) for a in line.split()]
+        cellnr, node0, node1, node2, node3, node4, node5, node6, node7, tmp1, tmp2  = l
+	if node4 > 0:
+        	if node2 == node3 and node4 == node5 and node5 == node6 and node6 == node7: # these nodes should be equal
+                	counter += 1
+		else:
+			print "The file does contain cells that are not tetraheders. The cell number is ", cellnr, " the line read was ", line
+        else:
+            # triangles on the surface
+#            print "The file does contain cells that are not tetraheders node4==0. The cell number is ", cellnr, " the line read was ", line
+            #sys.exit(2)
+            pass
+
+    num_cells = counter
+
+    # third, run over all cells
+    xml_writer.write_header_cells(ofile, num_cells)
+    counter = 0
+    for line in lines:
+        l = [int(a) for a in line.split()]
+        cellnr, node0, node1, node2, node3, node4, node5, node6, node7, tmp1, tmp2  = l
+        if (node4 > 0):
+	        if node2 == node3 and node4 == node5 and node5 == node6 and node6 == node7: # these nodes should be equal
+
+			xml_writer.write_cell_tetrahedron(ofile, counter, nodenr_map[node0], nodenr_map[node1], nodenr_map[node2], nodenr_map[node4])
+          		counter += 1
+
+    xml_writer.write_footer_cells(ofile)
+    xml_writer.write_footer_mesh(ofile)
+
+    # Close files
+    ifile.close()
+    ofile.close()
diff --git a/site-packages/dolfin_utils/meshconvert/xml_writer.py b/site-packages/dolfin_utils/meshconvert/xml_writer.py
new file mode 100644
index 0000000..e54b43e
--- /dev/null
+++ b/site-packages/dolfin_utils/meshconvert/xml_writer.py
@@ -0,0 +1,152 @@
+"""Module for formatting DOLFIN XML files."""
+
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Jan Blechta, 2012. 
+#
+# Last changed: 2012-11-22
+
+# Write mesh header
+def write_header_mesh(ofile, cell_type, dim):
+    ofile.write("""\
+<?xml version=\"1.0\" encoding=\"UTF-8\"?>
+
+<dolfin xmlns:dolfin=\"http://www.fenicsproject.org\">
+  <mesh celltype="%s" dim="%d">
+""" % (cell_type, dim))
+
+# Write graph header
+def write_header_graph(ofile, graph_type):
+    ofile.write("""\
+<?xml version=\"1.0\" encoding=\"UTF-8\"?>
+
+<dolfin xmlns:dolfin=\"http://www.fenicsproject.org/\">
+  <graph type="%s">
+""" % (graph_type))
+
+# Write mesh footer
+def write_footer_mesh(ofile):
+    ofile.write("""\
+  </mesh>
+</dolfin>
+""")
+
+# Write graph footer
+def write_footer_graph(ofile):
+    ofile.write("""\
+  </graph>
+</dolfin>
+""")
+
+def write_header_vertices(ofile, num_vertices):
+    "Write vertices header"
+    print "Expecting %d vertices" % num_vertices
+    ofile.write("    <vertices size=\"%d\">\n" % num_vertices)
+
+def write_footer_vertices(ofile):
+    "Write vertices footer"
+    ofile.write("    </vertices>\n")
+    print "Found all vertices"
+
+def write_header_edges(ofile, num_edges):
+    "Write edges header"
+    print "Expecting %d edges" % num_edges
+    ofile.write("    <edges size=\"%d\">\n" % num_edges)
+
+def write_footer_edges(ofile):
+    "Write edges footer"
+    ofile.write("    </edges>\n")
+    print "Found all edges"
+
+def write_vertex(ofile, vertex, *args):
+    "Write vertex"
+    coords = " ".join(['%s="%.16e"' % (comp, num) for (comp, num) in zip(["x","y","z"], args)])
+    ofile.write('      <vertex index="%d" %s/>\n' % \
+                (vertex, coords))
+
+def write_graph_vertex(ofile, vertex, num_edges, weight = 1):
+    "Write graph vertex"
+    ofile.write("      <vertex index=\"%d\" num_edges=\"%d\" weight=\"%d\"/>\n" % \
+        (vertex, num_edges, weight))
+
+def write_graph_edge(ofile, v1, v2, weight = 1):
+	 "Write graph edge"
+	 ofile.write("      <edge v1=\"%d\" v2=\"%d\" weight=\"%d\"/>\n" % \
+        (v1, v2, weight))
+
+def write_header_cells(ofile, num_cells):
+    "Write cells header"
+    ofile.write("    <cells size=\"%d\">\n" % num_cells)
+    print "Expecting %d cells" % num_cells
+
+def write_footer_cells(ofile):
+    "Write cells footer"
+    ofile.write("    </cells>\n")
+    print "Found all cells"
+
+def write_cell_interval(ofile, cell, n0, n1):
+    "Write cell (interval)"
+    ofile.write("      <triangle index=\"%d\" v0=\"%d\" v1=\"%d\"/>\n" % \
+        (cell, n0, n1))
+
+def write_cell_triangle(ofile, cell, n0, n1, n2):
+    "Write cell (triangle)"
+    ofile.write("      <triangle index=\"%d\" v0=\"%d\" v1=\"%d\" v2=\"%d\"/>\n" % \
+        (cell, n0, n1, n2))
+
+def write_cell_tetrahedron(ofile, cell, n0, n1, n2, n3):
+    "Write cell (tetrahedron)"
+    ofile.write("      <tetrahedron index=\"%d\" v0=\"%d\" v1=\"%d\" v2=\"%d\" v3=\"%d\"/>\n" % \
+        (cell, n0, n1, n2, n3))
+
+def write_header_domains(ofile):
+    ofile.write("    <domains>\n")
+
+def write_footer_domains(ofile):
+    ofile.write("    </domains>\n")
+
+def write_header_meshvaluecollection(ofile, name, dim, size, etype):
+    ofile.write("    <mesh_value_collection name=\"%s\" type=\"%s\" dim=\"%d\" size=\"%d\">\n" % (name, etype, dim, size))
+
+def write_entity_meshvaluecollection(ofile, dim, index, value, local_entity=0):
+    ofile.write("      <value cell_index=\"%d\" local_entity=\"%d\" value=\"%d\"/>\n" % (index, local_entity, value))
+
+def write_footer_meshvaluecollection(ofile):
+    ofile.write("    </mesh_value_collection>\n")
+
+def write_header_meshfunction(ofile, dimensions, size):
+    header = """<?xml version="1.0" encoding="UTF-8"?>
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <mesh_function type="uint" dim="%d" size="%d">
+""" % (dimensions, size)
+    ofile.write(header)
+
+def write_header_meshfunction2(ofile):
+    header = """<?xml version="1.0" encoding="UTF-8"?>
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <mesh_function>
+"""
+    ofile.write(header)
+
+def write_entity_meshfunction(ofile, index, value):
+    ofile.write("""    <entity index=\"%d\" value=\"%d\"/>
+""" % (index, value))
+
+def write_footer_meshfunction(ofile):
+    ofile.write("""  </mesh_function>
+</dolfin>""")
diff --git a/site-packages/dolfin_utils/ordereddict.py b/site-packages/dolfin_utils/ordereddict.py
new file mode 100644
index 0000000..5b0303f
--- /dev/null
+++ b/site-packages/dolfin_utils/ordereddict.py
@@ -0,0 +1,127 @@
+# Copyright (c) 2009 Raymond Hettinger
+#
+# 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.
+
+from UserDict import DictMixin
+
+class OrderedDict(dict, DictMixin):
+
+    def __init__(self, *args, **kwds):
+        if len(args) > 1:
+            raise TypeError('expected at most 1 arguments, got %d' % len(args))
+        try:
+            self.__end
+        except AttributeError:
+            self.clear()
+        self.update(*args, **kwds)
+
+    def clear(self):
+        self.__end = end = []
+        end += [None, end, end]         # sentinel node for doubly linked list
+        self.__map = {}                 # key --> [key, prev, next]
+        dict.clear(self)
+
+    def __setitem__(self, key, value):
+        if key not in self:
+            end = self.__end
+            curr = end[1]
+            curr[2] = end[1] = self.__map[key] = [key, curr, end]
+        dict.__setitem__(self, key, value)
+
+    def __delitem__(self, key):
+        dict.__delitem__(self, key)
+        key, prev, next = self.__map.pop(key)
+        prev[2] = next
+        next[1] = prev
+
+    def __iter__(self):
+        end = self.__end
+        curr = end[2]
+        while curr is not end:
+            yield curr[0]
+            curr = curr[2]
+
+    def __reversed__(self):
+        end = self.__end
+        curr = end[1]
+        while curr is not end:
+            yield curr[0]
+            curr = curr[1]
+
+    def popitem(self, last=True):
+        if not self:
+            raise KeyError('dictionary is empty')
+        if last:
+            key = reversed(self).next()
+        else:
+            key = iter(self).next()
+        value = self.pop(key)
+        return key, value
+
+    def __reduce__(self):
+        items = [[k, self[k]] for k in self]
+        tmp = self.__map, self.__end
+        del self.__map, self.__end
+        inst_dict = vars(self).copy()
+        self.__map, self.__end = tmp
+        if inst_dict:
+            return (self.__class__, (items,), inst_dict)
+        return self.__class__, (items,)
+
+    def keys(self):
+        return list(self)
+
+    setdefault = DictMixin.setdefault
+    update = DictMixin.update
+    pop = DictMixin.pop
+    values = DictMixin.values
+    items = DictMixin.items
+    iterkeys = DictMixin.iterkeys
+    itervalues = DictMixin.itervalues
+    iteritems = DictMixin.iteritems
+
+    def __repr__(self):
+        if not self:
+            return '%s()' % (self.__class__.__name__,)
+        return '%s(%r)' % (self.__class__.__name__, self.items())
+
+    def copy(self):
+        return self.__class__(self)
+
+    @classmethod
+    def fromkeys(cls, iterable, value=None):
+        d = cls()
+        for key in iterable:
+            d[key] = value
+        return d
+
+    def __eq__(self, other):
+        if isinstance(other, OrderedDict):
+            if len(self) != len(other):
+                return False
+            for p, q in  zip(self.items(), other.items()):
+                if p != q:
+                    return False
+            return True
+        return dict.__eq__(self, other)
+
+    def __ne__(self, other):
+        return not self == other
diff --git a/site-packages/dolfin_utils/pjobs/__init__.py b/site-packages/dolfin_utils/pjobs/__init__.py
new file mode 100644
index 0000000..6d8df1a
--- /dev/null
+++ b/site-packages/dolfin_utils/pjobs/__init__.py
@@ -0,0 +1 @@
+from pjobs import submit
diff --git a/site-packages/dolfin_utils/pjobs/pjobs.py b/site-packages/dolfin_utils/pjobs/pjobs.py
new file mode 100644
index 0000000..d50cc52
--- /dev/null
+++ b/site-packages/dolfin_utils/pjobs/pjobs.py
@@ -0,0 +1,230 @@
+#!/usr/bin/env python
+
+# Copyright (C) 2009 Martin Sandve Alnes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+# Modified Johan Hake 2011
+# Modified Johannes Ring 2013
+
+import torque
+import sge
+import slurm
+import os
+import subprocess
+import re
+
+def check_mem_argument(mem, backend):
+    if backend == "slurm":
+        allowed_mem_suffices = ["k","m","g","K","M","G"]
+    else:
+        allowed_mem_suffices = ["kb","mb","gb"]
+    if not mem is None:
+        assert isinstance(mem,str)
+        match = re.match("(\d+)(\w+)", mem)
+        if not match:
+            return False
+        if match.groups()[1] not in allowed_mem_suffices:
+            return False
+        try:
+            memory = int(match.groups()[0])
+            if memory < 0:
+                return False
+        except:
+            return False
+    return True
+
+def sjoin(*items):
+    "Join str() of all arguments."
+    return "".join(map(str,items))
+
+
+def submit(jobs, nodes=1, ppn=1, walltime=3, mem=None, vmem=None, name="myjob", \
+           workdir=".", email=None, paths=(), setup="", \
+           keep_environment=True, serial=None, nice=None, dryrun=False, \
+           queue=None, parallel_environment=None, backend="torque"): 
+    """Submit a sequence of commands to the queue using qsub/sbatch.
+    
+    Example use:
+        from pjobs import submit, sjoin
+        for n in (10,20,30):
+            for h in (0.1, 0.01, 0.005):
+                dt = 0.1*h
+                jobs.append("pmpirun.openmpi mysimulator -n%d -h%f -dt%f" % (n, h, dt))
+        submit(jobs, nodes=4, ppn=8, walltime=24*7)
+    
+    Arguments:
+    @param jobs:
+        A list of commands (strings) to pass to the queue for separate execution.
+    @param nodes:
+        Number of compute nodes to use.
+        Default is 1 node.
+    @param ppn:
+        Number of processors per node to use.
+        Default is 1 processor.
+    @param walltime:
+        Maximum amount of real-life time the job can use, in hours.
+        Default is 3.
+    @param mem:
+        Optional maximum amount of physical memory the process will need.
+        The syntax is mem='100mb', or mem='4gb', with allowed suffices 
+        one of 'kb', 'mb' or 'gb' for the torque and the sge backends, and
+        one of 'k', 'm', 'g', 'K', 'M', 'G' for the slurm backend. Only int
+        values is allowed.
+    @param vmem:
+        Optional maximum amount of virtual memory the process will need.
+        For syntax see mem.
+        (not available for the slurm backend)
+    @param name:
+        Basename of the job, just for the queue system.
+        If a single string this will be combined with a
+        counter to separate multiple jobs. A list or
+        tuple of strings can be provided instead to
+        define separate names for each job.
+        Default is 'myjob'.
+    @param email:
+        Your email address if you want email when
+        the jobs are started and stopped.
+    @param workdir:
+        The directory the jobs will be run in.
+        Default is the place you commit the job from
+    @param paths:
+        A list of directories to add to the $PATH.
+    @param setup:
+        Optional additional job script contents for setting 
+        up e.g. environment variables before each job.
+    @param keep_environment:
+        True if you want to copy all current environment
+        variables to the job environment (PBS -V option).
+        Default True.
+    @param serial:
+        True if you want to run the jobs as a serial sequence of processes
+        instead of passing them to the qsub queue.
+        Default is False, unless the environment variable PJOBS_SERIAL=1 
+        is defined in which case the default is True.
+    @param nice:
+        Optional nice value (int) used for all jobs when running in serial.
+        If provided, "nice -n %d" % nice is added before each job command.
+    @param dryrun:
+        True if you want to test this script but not send jobs to the queue.
+    @param queue:
+        Set a particular queue to be used when submitting
+        (only available for the sge backend)
+    @param parallel_environment:
+        Set the parallel environment (PE) of the submitting backend 
+        (only available for the sge backend)
+    @param backend:
+        Set the name of the actuall submitter.
+        Available backends: 'torque' (default), 'sge' and 'slurm'
+    """
+    if isinstance(jobs, str):
+        jobs = [jobs]
+    assert all(isinstance(job, str) for job in jobs)
+    assert isinstance(nodes, int)
+    assert isinstance(ppn, int)
+    assert isinstance(walltime, (int, float))
+    if not check_mem_argument(mem, backend):
+        raise TypeError, "Wrong format of mem attribute, see docstring" 
+    if not check_mem_argument(vmem, backend):
+        raise TypeError, "Wrong format of vmem attribute, see docstring"
+    assert isinstance(name, (str, list, tuple))
+    assert isinstance(workdir, str)
+    assert email is None or isinstance(email, str)
+    if serial is None:
+        # Get environment variable to toggle serial behaviour
+        serial = bool(os.environ.get("PJOBS_SERIAL", False))
+    assert isinstance(serial, bool)
+
+    # Check queue and PE
+    queue = queue or ""
+    parallel_environment = parallel_environment or ""
+    assert isinstance(queue, str)
+    assert isinstance(parallel_environment, str)
+
+    # Check backend
+    assert isinstance(backend, str)
+    assert (backend in ["torque", "sge", "slurm"])
+    
+    # Shared setup
+    paths = "PATH=$PATH:" + ":".join(paths) if paths else ""
+    
+    # Modify options to make sense in serial
+    if serial:
+        if paths:
+            print "TODO: Not using paths for serial job."
+        if setup:
+            print "TODO: Not using setup for serial job."
+        if workdir == ".":
+            workdir = os.getcwd()
+        workdir = os.path.abspath(workdir)
+        if nice is not None:
+            jobs = ["nice -n %d %s" % (nice, job) for job in jobs]
+    else:
+        workdir = os.path.abspath(workdir)
+    
+    # Define range of names if only a single name is provided
+    if isinstance(name, str):
+        names = ["%s_%d" % (name, k) for k in range(len(jobs))]
+    else:
+        names = name
+
+    # Enter workdir
+    origdir = os.getcwd()
+    try:
+        if serial:
+            os.chdir(workdir)
+        # Queue sequence of jobs
+        for job, jobname in zip(jobs, names):
+            
+            if serial:
+                # Execute job in separate process
+                cmd = job
+                if dryrun:
+                    print "NOT calling job command:", cmd
+                else:
+                    print "Calling job command:", cmd
+                    # Pass process output to file f
+                    #f = open("%s_stdout" % jobname, "w")
+                    subprocess.call(cmd.split())
+                    #f.close()
+            else:
+                job_script = globals()[backend].job_script(job, jobname, nodes, \
+                                                           ppn, walltime, mem, \
+                                                           vmem, workdir, email, paths,\
+                                                           setup, keep_environment,\
+                                                           queue, parallel_environment)
+                
+                # Write job script to file
+                scriptfilename = "run_%s.sh" % jobname
+                f = open(scriptfilename, "w")
+                f.write(job_script)
+                f.close()
+                print "Wrote file ", scriptfilename
+                
+                # Queue the generated job script
+                if backend == "slurm":
+                    cmd = ["sbatch"] + [scriptfilename]
+                else:
+                    cmd = ["qsub"] + [scriptfilename]
+                if dryrun:
+                    print "NOT calling queue command:", " ".join(cmd)
+                else:
+                    print "Calling queue command:", " ".join(cmd)
+                    subprocess.call(cmd)
+                    os.unlink(scriptfilename)
+    finally:
+        os.chdir(origdir)
+
diff --git a/site-packages/dolfin_utils/pjobs/sge.py b/site-packages/dolfin_utils/pjobs/sge.py
new file mode 100644
index 0000000..b6f08f9
--- /dev/null
+++ b/site-packages/dolfin_utils/pjobs/sge.py
@@ -0,0 +1,99 @@
+#!/usr/bin/env python
+
+# Copyright (C) 2011 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+# Template for script sent to qsub
+template = """#!/bin/sh
+
+# Your job name 
+#$ -N %(jobname)s
+
+# Resources
+#$ -l %(resources)s
+
+# enter the job-directory
+cd %(workdir)s
+
+# Use current working directory
+#$ -cwd
+
+# Join stdout and stderr
+#$ -j y
+
+# Execute in current environment
+%(environment)s
+
+# Set queue
+#$ -q %(queue)s
+
+# Set your number of processors here. 
+# Requests mpich environment although we actually are using openmpi
+#$ -pe %(PE)s %(np)d
+
+# add /usr/local/bin in path
+PATH=$PATH:/usr/local/bin
+
+# Run job through bash shell
+#$ -S /bin/bash
+
+# setup environment
+%(paths)s
+%(setup)s
+
+%(job)s
+"""
+
+
+def job_script(job, jobname, nodes, ppn, walltime, mem, vmem, workdir, \
+               email, paths, setup, keep_environment, queue, parallel_environment):
+    """
+    Generate a sge specific job script
+    """
+
+    # Set default queue
+    queue = queue or "all.q"
+
+    # Check environment
+    if not parallel_environment:
+        raise RuntimeError("expected proper values for 'parallel_environment'. "\
+                           "Check available environments using: qconf -spl")
+
+    # Set resources
+    resources="cpu=%d:00:00"%walltime
+    if mem:
+        mem = mem.replace("b", "").upper()
+        resources += ",mem_free=" + mem
+    if vmem:
+        vmem = vmem.replace("b", "").upper()
+        resources += ",h_vmem=" + vmem
+    
+    # Issue warnings on not supported arguments
+    if email:
+        print "Warning: 'email' is not supported for the 'sge' backend"
+    
+    args = dict(jobname=jobname,
+                resources=resources,
+                environment="#$ -V" if keep_environment else "# No",
+                queue=queue,
+                PE=parallel_environment,
+                np = nodes*ppn, # FIXME: Is this the correct way to set this?
+                workdir=workdir,
+                paths=paths,
+                setup=setup,
+                job=job)
+    return template % args
diff --git a/site-packages/dolfin_utils/pjobs/slurm.py b/site-packages/dolfin_utils/pjobs/slurm.py
new file mode 100644
index 0000000..328b716
--- /dev/null
+++ b/site-packages/dolfin_utils/pjobs/slurm.py
@@ -0,0 +1,62 @@
+#!/usr/bin/env python
+
+# Copyright (C) 2013 Johannes Ring
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+template = """#!/bin/bash
+%(sbatch)s
+
+%(paths)s
+
+%(setup)s
+
+%(job)s
+"""
+
+def job_script(job, jobname, nodes, ppn, walltime, mem, vmem, workdir, \
+               email, paths, setup, keep_environment, queue, parallel_environment):
+    """
+    Generate a slurm specific job script.
+    """
+
+    sbatch = "#SBATCH --job-name=" + jobname
+    sbatch += " --time=%d:00:00" % walltime
+    sbatch += " --ntasks=" + str(nodes)
+    sbatch += " --cpus-per-task=" + str(ppn)
+
+    if mem:
+        sbatch += " --mem-per-cpu=" + mem
+    if email:
+        sbatch += " --mail-user=" + email
+    if keep_environment:
+        sbatch += " --get-user-env"
+
+    # Issue warnings on not supported arguments
+    if vmem:
+        print "Warning: 'vmem' is not supported for the 'slurm' backend"
+    if queue:
+        print "Warning: 'queue' is not supported for the 'slurm' backend"
+    if parallel_environment:
+        print "Warning: 'parallel_environment' is not supported for the 'slurm' backend"
+
+    args = dict(sbatch=sbatch,
+                workdir=workdir,
+                paths=paths,
+                setup=setup,
+                job=job)
+
+    return template % args
diff --git a/site-packages/dolfin_utils/pjobs/torque.py b/site-packages/dolfin_utils/pjobs/torque.py
new file mode 100644
index 0000000..17359b9
--- /dev/null
+++ b/site-packages/dolfin_utils/pjobs/torque.py
@@ -0,0 +1,78 @@
+#!/usr/bin/env python
+
+# Copyright (C) 2009 Martin Sandve Alnes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+# Modified Johan Hake 2011
+
+import os
+
+# Template for script sent to qsub
+template = """#!/bin/bash
+%(pbs)s
+
+# enter the job-directory
+cd %(workdir)s
+
+# add /usr/local/bin in path
+PATH=$PATH:/usr/local/bin
+
+# setup environment
+%(paths)s
+%(setup)s
+
+# execute job
+%(job)s
+"""
+
+def job_script(job, jobname, nodes, ppn, walltime, mem, vmem, workdir, \
+               email, paths, setup, keep_environment, queue, parallel_environment):
+    """
+    Generate a torque specific job script
+    """
+    if queue or parallel_environment:
+        print "Warning: 'queue' and 'parallel_environment' is not available "\
+              "for the 'torque' backend"
+
+    # Set working dir
+    if workdir == os.path.abspath(os.getcwd()):
+        workdir = "$PBS_O_WORKDIR"
+    
+    pbs = []
+    pbs.append("-j oe")
+    pbs_resources = "-lnodes=%d:ppn=%d,walltime=%d:00:00" % (nodes, ppn, walltime)
+    if mem:
+        pbs_resources += ",mem=" + mem
+    if vmem:
+        pbs_resources += ",vmem=" + vmem
+    pbs.append(pbs_resources)
+    if email:
+        pbs.append("-m abe")
+        pbs.append("-M %s" % email)
+    pbs.append("-N %s" % jobname)
+    if keep_environment:
+        pbs.append("-V")
+    pbs.append("")
+    pbs = "\n".join("#PBS %s" % a for a in pbs)
+    
+    args = dict(pbs=pbs,
+                workdir=workdir,
+                paths=paths,
+                setup=setup,
+                job=job)
+    
+    return template % args
diff --git a/site-packages/fenics/__init__.py b/site-packages/fenics/__init__.py
new file mode 100644
index 0000000..559b8cd
--- /dev/null
+++ b/site-packages/fenics/__init__.py
@@ -0,0 +1,6 @@
+"""Main module for FEniCS.
+
+This module is identical with the main DOLFIN module.
+"""
+
+from dolfin import *
diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt
new file mode 100644
index 0000000..ca1d275
--- /dev/null
+++ b/test/CMakeLists.txt
@@ -0,0 +1,58 @@
+project(dolfin-tests)
+
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+# FIXME: Temporary fix for whitespace error
+cmake_policy(SET CMP0004 OLD)
+
+# Set special link option, see `cmake --help-policy CMP0003`
+if(COMMAND cmake_policy)
+  cmake_policy(SET CMP0003 NEW)
+endif()
+
+# Find DOLFIN config file (not used here, but checks that tests will be able
+# to find it
+find_package(DOLFIN REQUIRED)
+
+# If config file is found, add all demo sub-directories, else print helper
+# message
+if (DOLFIN_FOUND)
+
+  # Build list of all cpp directories
+  file(GLOB_RECURSE initial_list "*/*.cpp")
+
+  set(added_dirs "")
+
+  # Add each C++ demo directory only once
+  foreach (cpp_test ${initial_list})
+
+    # Get directory name
+    get_filename_component(cpp_dir ${cpp_test} PATH)
+
+    # Get last dir name
+    get_filename_component(last_component ${cpp_dir} NAME)
+
+    # Only process if last dirname is cpp
+    if ((${last_component} STREQUAL "cpp"))
+
+      # Check if the director is already added
+      set(already_in "")
+      foreach (dir ${added_dirs})
+	if (${dir} STREQUAL ${cpp_dir})
+	  set(already_in TRUE)
+	endif()
+      endforeach()
+
+      # Schedule directory for compilation
+      if (NOT already_in)
+	list(APPEND added_dirs ${cpp_dir})
+	add_subdirectory(${cpp_dir})
+      endif()
+    endif()
+  endforeach()
+else()
+
+  message(STATUS "Could not locate DOLFINConfig.cmake file. Did you do 'make install' for the DOLFIN library and set the appropriate paths (source <build_dir>/dolfin.conf)?")
+
+endif()
diff --git a/test/README b/test/README
new file mode 100644
index 0000000..f32784c
--- /dev/null
+++ b/test/README
@@ -0,0 +1,44 @@
+To build the unit tests using CMake, DOLFIN must be configured with
+the DOLFIN_ENABLE_TESTING set. This will automatically be set when
+running the cmake.local script in the top level directory (see the
+INSTALL file for more info).
+
+After DOLFIN has been built and installed successfully, make sure to
+update the environment variables, for instance by sourcing
+'dolfin.conf' in the build directory. Then, to run the complete test
+suite, navigate to the build directory and enter
+
+  make runtests
+
+This will build and run all unit tests and (almost) all demos, both
+C++ and Python versions. The tests will also be run in parallel,
+unless the environment variable DISABLE_PARALLEL_TESTING has been set.
+
+There are also other make targets that can be used depending on the
+type of test that should be run. Here is a list of the most commonly
+used targets for testing:
+
+  make run_regressiontests  # run regression tests (demos) only
+  make run_unittests        # run unit tests only
+  make run_quicktest        # run Python unit tests only
+
+Type 'make' followed by a space and tap 'tab' twice to see a complete
+list of make targets.
+
+To run individual tests, enter the desired test sub directory in the
+build directory and start the test from there. For instance, to run
+the LinearOperator.py Python unit tests, do
+
+  cd build/test/unit/la/python
+  python LinearOperator.py
+
+Similarly, to run one of the C++ unit tests, do
+
+  cd build/test/unit/la/cpp
+  make
+  ./test_LinearOperator
+
+Modifications of tests should be made in the source directory, not in
+the build directory. After a modification, simply run cmake (or the
+cmake.local script) to copy the tests to the build folder. Then run
+the tests from the build folder.
diff --git a/test/codingstyle/test.py b/test/codingstyle/test.py
new file mode 100644
index 0000000..c59d86d
--- /dev/null
+++ b/test/codingstyle/test.py
@@ -0,0 +1,136 @@
+"Run all tests"
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-11-14
+# Last changed: 2011-11-14
+
+import os, re
+
+cpp_tests = []
+python_tests = []
+
+def test_codingstyle(topdir, language, subdir, suffixes, tests):
+    "Main function for performing tests"
+
+    print "Running tests for %s coding style, watch out..." % language
+    print "----------------------------------------------------"
+
+    # Iterate over all files
+    num_errors = 0
+    num_warnings = 0
+    for subdir, dirs, files in os.walk(os.path.join(topdir, subdir)):
+        for filename in files:
+
+            # Only consider files with given suffix
+            if not len([1 for suffix in suffixes if filename.endswith(suffix)]) > 0:
+                continue
+
+            # Read file
+            f = open(os.path.join(subdir, filename), "r")
+            code = f.read()
+            f.close()
+
+            # Perform all tests
+            for test in tests:
+                result = test(code, filename)
+                if result == "error":
+                    num_errors += 1
+                elif result == "warning":
+                    num_warnings += 1
+
+    # Print summary
+    print
+    print "Ran %d test(s)" % len(tests)
+    if num_errors == 0:
+        print "OK"
+    else:
+        print "*** %d tests failed" % num_failed
+    print
+
+def test_dolfin_error(code, filename):
+    "Test for use of dolfin_error vs error"
+
+    # Skip exceptions
+    exceptions = ["log.h", "log.cpp", "Logger.h", "Logger.cpp",
+                  "pugixml.cpp", "meshconvert.py"]
+    if filename in exceptions:
+        return True
+
+    # Check for error(...)
+    if re.search(r"\berror\(", code) is None:
+        return True
+
+    # Write an error message
+    print "*** error() used in %s when dolfin_error() should be used" % filename
+
+    return False
+
+def test_raise_exception(code, filename):
+    "Test for use of dolfin_error vs raising exception"
+
+    # Skip exceptions
+    exceptions = ["meshconvert.py"]
+    if filename in exceptions:
+        return True
+
+    # Check for raising of exception
+    if re.search(r"\braise\b", code) is None:
+        return True
+
+    # Write an error message
+    print "* Warning: exception raised in %s when dolfin_error() should be used" % filename
+
+    return False
+
+def test_uint(code, filename):
+    "Test for use of uint"
+
+    # Skip exceptions
+    exceptions = []
+    if filename in exceptions:
+        return True
+
+    # Check for raising of exception
+    if re.search(r"\buint\b", code) is None:
+        return True
+
+    # Write an error message
+    print "* Warning: uint is used in %s when std::size_t should be used" % filename
+
+    return False
+
+# List of C++ tests
+cpp_tests = [test_dolfin_error, test_uint]
+
+# List of Python tests
+python_tests = [test_dolfin_error, test_raise_exception]
+
+if __name__ == "__main__":
+
+    # Set up paths
+    pwd = os.path.dirname(os.path.abspath(__file__))
+    topdir = os.path.join(pwd, "..", "..")
+
+    # Check C++ files
+    test_codingstyle(topdir, "C++", "dolfin", [".cpp", ".h"], cpp_tests)
+
+    # Check Python files
+    test_codingstyle(topdir, "Python", "site-packages", [".py"], python_tests)
+
+#sys.exit(len(failed))
diff --git a/test/documentation/README b/test/documentation/README
new file mode 100644
index 0000000..acf0de9
--- /dev/null
+++ b/test/documentation/README
@@ -0,0 +1 @@
+Tests for documentation.
diff --git a/test/documentation/test.py b/test/documentation/test.py
new file mode 100644
index 0000000..12e3f40
--- /dev/null
+++ b/test/documentation/test.py
@@ -0,0 +1,38 @@
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-05-22
+# Last changed: 2011-05-22
+
+import sys
+from instant import get_status_output
+
+tests = ["verify_demo_code_snippets.py"]
+
+failed = []
+for test in tests:
+    command = "%s %s" % (sys.executable, test)
+    fail, output = get_status_output(command)
+
+    if fail:
+        failed.append(fail)
+        print "*** %s failed" % test
+        print output
+    else:
+        print "OK"
+
+sys.exit(len(failed))
diff --git a/test/documentation/verify_demo_code_snippets.py b/test/documentation/verify_demo_code_snippets.py
new file mode 100755
index 0000000..17a781a
--- /dev/null
+++ b/test/documentation/verify_demo_code_snippets.py
@@ -0,0 +1,188 @@
+# Copyright (C) 2010 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes (meg@simula.no)
+#
+# First added:  2011-05-22
+# Last changed: 2013-09-12
+
+"""This utility script will find all *.rst files in the source/demo
+directory and checks that any code snippets highlighted by the .. code-block::
+directive is legal in the sense that it is present in at least one of the
+source files (.ufl, .py, .cpp) that is associated with the demo."""
+
+import sys
+
+from os import chdir, path, getcwd, curdir, pardir, listdir
+from sys import stderr, path as sys_path
+
+# Make sure we start where this test script is located.
+chdir(sys_path[0])
+
+# We currently only verify demo code.
+chdir(path.join(pardir, pardir, "demo"))
+
+# We have C++ and Python versions of the demos.
+directories = ["cpp", "python"]
+
+# Dictionary of code blocks that has to be checked for each subdirectory
+# including information about file types of the source.
+block_source =  {"cpp":     {"c++": ".cpp", "python": ".ufl"},
+                 "python":  {"python": ".py"}
+                }
+
+def verify_blocks(rst_file, source_files, source_dict):
+    """Check that any code blocks in the rst file is present in at
+    least one of the source files. Returns (False, block) if any block
+    is not present, True otherwise."""
+
+    for block_type, source_type in source_dict.items():
+        # Extract code blocks from rst file.
+        blocks = get_blocks(rst_file, block_type)
+        for line, block in blocks:
+            sources = [sf for sf in source_files
+                       if path.splitext(sf)[-1] == source_type]
+
+            # Check if block is in the list of files of correct type.
+            in_source = block_in_source(line, block, sources)
+            if not in_source:
+                return (False, block)
+
+    return (True, None)
+
+def get_blocks(rst_file, block_type):
+    "Extract any code blocks of given type from the rst file."
+
+    blocks = []
+
+    # Open file and read lines.
+    f = open(rst_file, "r")
+    lines = f.read().split("\n")
+
+    code = False
+    block = []
+    for e, l in enumerate(lines):
+        # Get start of code block.
+        if "code-block::" in l and block_type in l:
+            code = True
+            block = []
+            continue
+        # The first line which is not an indented line terminates the code
+        # block.
+        if code and l and l[0] != " ":
+            code = False
+            # Join the block that we have and add to list of blocks.
+            # Remove any whitespace.
+            blocks.append((e, remove_whitespace("\n".join(block))))
+        # If code is still True, then the line is part of the code block.
+        if code:
+            block.append(l)
+
+    # Add block of code if found at the end of the rst file.
+    if code:
+        blocks.append((e, remove_whitespace("\n".join(block))))
+
+    # Close file and return blocks.
+    f.close()
+    return blocks
+
+def remove_whitespace(code):
+    "Remove blank lines and whitespace in front of lines."
+    return "\n".join([" ".join(l.split())\
+                      for l in code.split("\n") if l != ""])
+
+def block_in_source(line, block, source_files):
+    """Check that the code block is present in at least one of
+    the source files."""
+
+    present = False
+    code = ""
+
+    # Return fail if no source files are provided
+    if not source_files:
+        print "\ncode block:\n", block
+        raise RuntimeError("No source file!")
+
+    # Go through each source file and check if any contains code block
+    for sf in source_files:
+        # Read code and remove whitespace before comparing block and code.
+        f = open(sf, "r")
+        code = remove_whitespace(f.read())
+        f.close()
+
+        # Check whether code block is in code. If so, look no further.
+        if block in code:
+            return True
+
+    #print "\nError:"
+    #print "\ncode line:\n", line
+    #print "\ncode block:\n", block
+    #print "\nsource_files:\n", source_files
+    #print "\nin directory: ", getcwd()
+    #print
+    #raise RuntimeError("Illegal code block.")
+    return False
+
+if __name__ == "__main__":
+
+    # Loop categories/demos/directories
+
+    # Get all demo categories (fem, la. pde, etc.)
+    #categories = [d for d in listdir(curdir) if path.isdir(d)]
+    # For now only check la/pde
+    categories = ["documented"]
+    #categories = ["pde"]
+
+    failed = []
+    for category in categories:
+        chdir(category)
+        # Get all demos (Poisson, mixed-Poisson etc.)
+        demos = [d for d in listdir(curdir) if path.isdir(d)]
+
+        stderr.write("\nChecking %s demos: %s\n" % (category, str(demos)))
+        for demo in demos:
+            chdir(demo)
+            for directory in directories:
+                chdir(directory)
+                stderr.write("Checking %s: " % path.join(category, demo, directory))
+                # Get files in demo directory and sort in rst and source files.
+                files = listdir(curdir)
+                rst_files = [f for f in files if path.splitext(f)[-1] == ".rst"]
+                source_files = [f for f in files if path.splitext(f)[-1] in\
+                                  (".py", ".ufl", ".cpp")]
+
+                # If no .rst files are found, that is ok, but suboptimal.
+                if (len(rst_files) == 0):
+                    stderr.write("*** MISSING ***\n")
+                    # FIXME: Enable at some point
+                    #failed += [demo]
+
+                # Loop files, check if code blocks are present in source files.
+                for rst_file in rst_files:
+                    (ok, block) = verify_blocks(rst_file, source_files,
+                                                block_source[directory])
+                    if not ok:
+                        stderr.write("*** FAILED ***\n")
+                        stderr.write("\nFailing block:\n\n %s\n\n" % block)
+                        failed += [demo]
+                    else:
+                        stderr.write("OK\n")
+                chdir(pardir)
+            chdir(pardir)
+        chdir(pardir)
+
+    sys.exit(len(failed))
diff --git a/test/memory/dolfin_valgrind.supp b/test/memory/dolfin_valgrind.supp
new file mode 100644
index 0000000..583cc66
--- /dev/null
+++ b/test/memory/dolfin_valgrind.supp
@@ -0,0 +1,2483 @@
+# OpenMPI orte_*
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:orte_*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:orte_*
+}
+
+# OpenMPI ompi_*
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:ompi_*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   fun:ompi_*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   fun:ompi_*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:vasprintf
+   fun:asprintf
+   fun:mca_base_open
+   fun:opal_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+}
+
+# OpenMPI mca_*
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:mca_*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:mca_*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:strdup
+   obj:*
+   obj:*
+   fun:mca_*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   fun:mca_*
+}
+
+# OpenMPI misc
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:opal_*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:nss_*
+}
+
+
+{
+   <insert a suppression name here>
+   Memcheck:Addr8
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libdl-2.7.so
+   fun:dlopen
+   fun:vm_open
+}
+
+# Swig & misc
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PySwigClientData_New
+   fun:*_swigregister
+}
+{
+   <insert a suppression name here>
+   Memcheck:Cond
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libc-2.7.so
+   obj:/lib/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libdl-2.7.so
+   fun:dlsym
+   fun:vm_sym
+   fun:lt_dlsym
+   fun:open_component
+   fun:mca_base_component_find
+   fun:mca_base_components_open
+}
+{
+   <insert a suppression name here>
+   Memcheck:Addr8
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libc-2.7.so
+   obj:/lib/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libdl-2.7.so
+   fun:dlsym
+   fun:vm_sym
+}
+{
+   <insert a suppression name here>
+   Memcheck:Param
+   sched_setaffinity(mask)
+   fun:syscall
+   fun:opal_paffinity_linux_plpa_api_probe_init
+   fun:opal_paffinity_linux_plpa_init
+   fun:opal_paffinity_linux_plpa_have_topology_information
+   fun:linux_module_init
+   fun:opal_paffinity_base_select
+   fun:opal_init
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+}
+{
+   <insert a suppression name here>
+   Memcheck:Addr8
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+}
+{
+   <insert a suppression name here>
+   Memcheck:Param
+   writev(vector[...])
+   fun:writev
+   fun:mca_oob_tcp_msg_send_handler
+   fun:mca_oob_tcp_peer_send
+   fun:mca_oob_tcp_send_nb
+   fun:orte_rml_oob_send
+   fun:orte_rml_oob_send_buffer
+   fun:allgather
+   fun:modex
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   fun:opal_event_base_priority_init
+   fun:opal_event_base_new
+   fun:opal_event_init
+   fun:opal_init
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:/lib/libdl-2.7.so
+   fun:dlopen
+   fun:vm_open
+   fun:tryall_dlopen
+   fun:tryall_dlopen_module
+   fun:try_dlopen
+   fun:lt_dlopenadvise
+   fun:open_component
+   fun:mca_base_component_find
+   fun:mca_base_components_open
+   fun:opal_paffinity_base_open
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   fun:poll_init
+   fun:opal_event_base_new
+   fun:opal_event_init
+   fun:opal_init
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:opal_paffinity_base_select
+   fun:opal_init
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:strdup
+   fun:opal_argv_append_nosize
+   fun:opal_argv_append
+   obj:*
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:opal_argv_append_nosize
+   fun:opal_argv_append
+   obj:*
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+   obj:*libdolfin.so*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/libc-2.7.so
+   fun:__nss_database_lookup
+   obj:*
+   obj:*
+   fun:getpwuid_r
+   fun:getpwuid
+   fun:orte_session_dir_get_name
+   fun:orte_session_dir
+   fun:orte_ess_base_app_setup
+   obj:*
+   fun:orte_init
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:tsearch
+   fun:__nss_lookup_function
+   obj:*
+   obj:*
+   fun:getpwuid_r
+   fun:getpwuid
+   fun:orte_session_dir_get_name
+   fun:orte_session_dir
+   fun:orte_ess_base_app_setup
+   obj:*
+   fun:orte_init
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   fun:orte_ess_base_app_setup
+   obj:*
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:orte_ess_base_app_setup
+   obj:*
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:opal_pointer_array_set_item
+   fun:orte_dt_init
+   fun:orte_ess_base_std_prolog
+   obj:*
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:vasprintf
+   fun:asprintf
+   fun:opal_output_init
+   fun:opal_init_util
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+   obj:*libdolfin.so*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   fun:opal_event_base_new
+   fun:opal_event_init
+   fun:opal_init
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+   obj:*libdolfin.so*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:opal_class_initialize
+   obj:*
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+   obj:*libdolfin.so*
+   obj:*libdolfin.so*
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/libdl-2.7.so
+   fun:dlopen
+   fun:vm_open
+   fun:tryall_dlopen
+   fun:tryall_dlopen_module
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:realloc
+   fun:_opal__evsignal_set_handler
+   fun:opal_evsignal_add
+   fun:opal_event_add_i
+   fun:orte_wait_init
+   fun:orte_ess_base_std_prolog
+   obj:*
+   fun:orte_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:strdup
+   fun:opal_install_dirs_expand
+   fun:opal_installdirs_base_open
+   fun:opal_init_util
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+   obj:*libdolfin.so*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:opal_value_array_set_size
+   fun:param_register
+   fun:mca_base_param_register_int
+   obj:*
+   fun:mca_base_components_open
+   fun:mca_pml_base_open
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+}
+
+{
+   ADDRESS_IN_RANGE/Invalid read of size 4
+   Memcheck:Addr4
+   fun:Py_ADDRESS_IN_RANGE
+}
+
+{
+   ADDRESS_IN_RANGE/Invalid read of size 4
+   Memcheck:Value4
+   fun:Py_ADDRESS_IN_RANGE
+}
+
+{
+   ADDRESS_IN_RANGE/Conditional jump or move depends on uninitialised value
+   Memcheck:Cond
+   fun:Py_ADDRESS_IN_RANGE
+}
+
+{
+   ADDRESS_IN_RANGE/Invalid read of size 4
+   Memcheck:Addr4
+   fun:PyObject_Free
+}
+
+{
+   ADDRESS_IN_RANGE/Invalid read of size 4
+   Memcheck:Value4
+   fun:PyObject_Free
+}
+
+{
+   ADDRESS_IN_RANGE/Conditional jump or move depends on uninitialised value
+   Memcheck:Cond
+   fun:PyObject_Free
+}
+
+{
+   ADDRESS_IN_RANGE/Invalid read of size 4
+   Memcheck:Addr4
+   fun:PyObject_Realloc
+}
+
+{
+   ADDRESS_IN_RANGE/Invalid read of size 4
+   Memcheck:Value4
+   fun:PyObject_Realloc
+}
+
+{
+   ADDRESS_IN_RANGE/Conditional jump or move depends on uninitialised value
+   Memcheck:Cond
+   fun:PyObject_Realloc
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+   fun:_PyImport_LoadDynamicModule
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:py_dl_open
+   fun:PyEval_EvalFrameEx
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Cond
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libc-2.7.so
+   fun:_dl_sym
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlsym
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   fun:lt_dlsym
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   fun:mca_base_component_find
+   fun:mca_base_components_open
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   fun:lt_dlopenadvise
+   fun:lt_dlopenext
+}
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+}
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libc-2.7.so
+   fun:_dl_sym
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlsym
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   fun:lt_dlsym
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/tls/i686/cmov/libc-2.7.so
+   fun:__nss_database_lookup
+   obj:*
+   obj:*
+   fun:getpwuid_r
+   fun:getpwuid
+   fun:orte_sys_info
+   fun:orte_init_stage1
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:strdup
+   fun:opal_install_dirs_expand
+   fun:opal_installdirs_base_open
+   fun:opal_init_util
+   fun:opal_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+   fun:*
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_Z41__static_initialization_and_destruction_0ii
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:_gfortrani_get_mem
+   fun:fd_to_stream
+   fun:_gfortrani_init_units
+   fun:init
+   obj:/home/hake/local/lib/libgfortran.so.3.0.0
+   obj:/home/hake/local/lib/libgfortran.so.3.0.0
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:_PyObject_GC_NewVar
+   fun:PyFrame_New
+}
+
+# Suppresions from swig/python
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   fun:opal_event_base_priority_init
+   fun:opal_event_init
+   fun:orte_init_stage1
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:set_conversion_mode
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalCode
+   fun:PyImport_ExecCodeModuleEx
+   fun:load_source_module
+   fun:load_package
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+   fun:PyImport_ImportModuleLevel
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyThread_create_key
+   fun:_PyGILState_Init
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:_PyString_Resize
+   fun:assemble
+   fun:compiler_function
+   fun:compiler_class
+   fun:PyAST_Compile
+   fun:PyRun_FileExFlags
+   fun:PyRun_SimpleFileExFlags
+   fun:Py_Main
+   fun:main
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:*
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+   fun:_PyImport_LoadDynamicModule
+   fun:load_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+   fun:PyImport_ImportModuleLevel
+   fun:builtin___import__
+   fun:PyObject_Call
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:vasprintf
+   fun:asprintf
+   fun:opal_output_init
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   fun:opal_malloc_init
+   fun:opal_init_util
+   fun:opal_init
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:half_richcompare
+   fun:instance_richcompare
+   fun:try_rich_compare
+   fun:PyObject_RichCompare
+   fun:PyObject_RichCompareBool
+   fun:tuplerichcompare
+   fun:PyObject_RichCompare
+   fun:PyObject_RichCompareBool
+   fun:tuplerichcompare
+   fun:PyObject_RichCompare
+   fun:PyEval_EvalFrameEx
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyThread_allocate_lock
+   fun:PyInterpreterState_New
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:strdup
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   obj:*
+   fun:CRYPTO_realloc
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:CRYPTO_malloc
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:__nss_lookup_function
+   obj:*
+   obj:*
+   fun:getpwuid_r
+   fun:getpwuid
+   fun:orte_sys_info
+   fun:orte_init_stage1
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:/usr/lib/libGL.so.173.14.12
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+   fun:_PyImport_LoadDynamicModule
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   fun:opal_event_init
+   fun:orte_init_stage1
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:tsearch
+   fun:__nss_lookup_function
+   obj:*
+   obj:*
+   fun:getpwuid_r
+   fun:getpwuid
+   fun:orte_sys_info
+   fun:orte_init_stage1
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   fun:opal_poll_init
+   fun:opal_event_init
+   fun:orte_init_stage1
+   fun:ompi_mpi_init
+   fun:PMPI_Init
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:calculate_path
+   fun:Py_GetProgramFullPath
+   fun:_PySys_Init
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyList_New
+   fun:do_mkvalue
+   fun:va_build_value
+   fun:Py_BuildValue
+   fun:PyImport_Import
+   fun:PyImport_ImportModule
+   fun:_PyExc_Init
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:_compile
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:function_call
+   fun:PyObject_Call
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyStructSequence_InitType
+   fun:initposix
+   fun:init_builtin
+   fun:load_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+   fun:PyImport_ImportModuleLevel
+   fun:builtin___import__
+   fun:PyObject_Call
+   fun:PyEval_CallObjectWithKeywords
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlclose
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   fun:lt_dlclose
+   obj:/usr/lib/openmpi/lib/libopen-pal.so.0.0.0
+   fun:mca_base_component_repository_finalize
+   fun:mca_base_close
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+   fun:_PyImport_LoadDynamicModule
+   fun:load_module
+   fun:import_submodule
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyInt_FromLong
+   fun:analyze_block
+   fun:PySymtable_Build
+   fun:PyAST_Compile
+   fun:PyRun_StringFlags
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalFrameEx
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+   fun:_PyImport_LoadDynamicModule
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:PyList_Append
+   fun:add_subclass
+   fun:PyType_Ready
+   fun:_PyExc_Init
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:_PyString_Resize
+   fun:PyString_Format
+   fun:binary_op1
+   fun:PyNumber_Remainder
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:function_call
+   fun:PyObject_Call
+   fun:instancemethod_call
+   fun:PyObject_Call
+   fun:slot_tp_init
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:realloc
+   fun:PyList_Append
+   fun:add_subclass
+   fun:PyType_Ready
+   fun:_Py_ReadyTypes
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:_PyInt_Init
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+   fun:_PyImport_LoadDynamicModule
+   fun:load_module
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:*
+   fun:_PyImport_LoadDynamicModule
+   fun:load_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+   fun:PyImport_ImportModuleLevel
+   fun:builtin___import__
+   fun:PyObject_Call
+   fun:PyEval_CallObjectWithKeywords
+   fun:PyEval_EvalFrameEx
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:*
+   fun:*
+   fun:_PyImport_LoadDynamicModule
+   fun:load_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+   fun:PyImport_ImportModuleLevel
+   fun:builtin___import__
+   fun:PyObject_Call
+   fun:PyEval_CallObjectWithKeywords
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:float_add
+   fun:binary_op1
+   fun:PyNumber_Add
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalCode
+   fun:PyImport_ExecCodeModuleEx
+   fun:load_source_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyString_FromString
+   fun:PyType_Ready
+   fun:PyType_Ready
+   fun:_Py_ReadyTypes
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyString_FromStringAndSize
+   fun:do_strip
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalCode
+   fun:PyImport_ExecCodeModuleEx
+   fun:load_source_module
+   fun:import_submodule
+   fun:load_next
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyFloat_FromDouble
+   fun:_pystat_fromstructstat
+   fun:posix_do_stat
+   fun:posix_stat
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalCode
+   fun:PyImport_ExecCodeModuleEx
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+   fun:_PyImport_LoadDynamicModule
+   fun:load_module
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:type_new
+   fun:type_call
+   fun:PyObject_CallFunctionObjArgs
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalCode
+   fun:PyImport_ExecCodeModuleEx
+   fun:load_source_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/tls/i686/cmov/libdl-2.7.so
+   fun:dlopen
+   fun:_PyImport_GetDynLoadFunc
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:_PyObject_GC_Malloc
+   fun:PyType_GenericAlloc
+   fun:type_new
+   fun:type_call
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:_PyObject_GC_Resize
+   fun:PyFrame_New
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyObject_Realloc
+   fun:_PyString_Resize
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:dictresize
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:PyObject_Malloc
+   fun:_PyObject_GC_NewVar
+   fun:PyTuple_New
+   fun:PyType_Ready
+   fun:PyType_Ready
+   fun:_Py_ReadyTypes
+   fun:Py_InitializeEx
+   fun:Py_Initialize
+   fun:Py_Main
+   fun:main
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:SwigPyClientData_New
+   fun:*
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalCode
+   fun:PyImport_ExecCodeModuleEx
+   fun:load_source_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+   fun:PyImport_ImportModuleLevel
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:*
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalCode
+   fun:PyImport_ExecCodeModuleEx
+   fun:load_source_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+   fun:PyImport_ImportModuleLevel
+}
+
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:_Znwj
+   fun:*
+   fun:*
+   fun:*
+   fun:*
+   fun:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:_Znaj
+   fun:*
+   fun:*
+   fun:*
+   fun:*
+   fun:*
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   fun:g_malloc0
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:memalign
+   fun:posix_memalign
+   obj:*
+   fun:g_slice_alloc
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:*
+   fun:r_object
+   fun:r_object
+   fun:r_object
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:*
+   fun:*
+   fun:r_object
+   fun:r_object
+   fun:r_object
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:*
+   fun:*
+   fun:r_object
+   fun:r_object
+   fun:r_object
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:ompi_op_create
+   fun:PMPI_Op_create
+   fun:_Z20VecInitializePackagePKc
+   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Cond
+   fun:*
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+}
+{
+   <insert a suppression name here>
+   Memcheck:Cond
+   fun:*
+   fun:*
+   fun:*
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+}
+{
+   <insert a suppression name here>
+   Memcheck:Cond
+   fun:*
+   fun:*
+   fun:*
+   fun:*
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:memalign
+   fun:*
+   fun:*
+   fun:*
+   fun:_ZNK6dolfin6Logger5errorESs
+   fun:_ZN6dolfin5errorESsz
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:PyObject_Malloc
+   fun:PyCode_New
+   fun:r_object
+   fun:PyMarshal_ReadLastObjectFromFile
+   fun:load_source_module
+   fun:import_submodule
+   fun:load_next
+   fun:import_module_level
+   fun:PyImport_ImportModuleLevel
+   fun:builtin___import__
+   fun:PyObject_Call
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:*
+   obj:*
+   fun:*
+   fun:*
+   fun:_Exit
+   fun:handle_system_exit
+   fun:PyErr_PrintEx
+}
+{
+   <insert a suppression name here>
+   Memcheck:Addr4
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:*
+   obj:/lib/ld-2.7.so
+   fun:__libc_dlopen_mode
+   fun:__nss_lookup_function
+}
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:/lib/ld-2.7.so
+   obj:*
+   obj:/lib/ld-2.7.so
+   obj:*
+   fun:dlopen
+   fun:py_dl_open
+   fun:PyEval_EvalFrameEx
+   fun:PyEval_EvalCodeEx
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Param
+   sched_setaffinity(mask)
+   fun:syscall
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:opal_paffinity_base_select
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Param
+   writev(vector[...])
+   fun:writev
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Free
+   fun:free
+   obj:/lib/libc-2.9.so
+   obj:/lib/libc-2.9.so
+   fun:_vgnU_freeres
+   fun:exit
+   fun:(below main)
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:opal_paffinity_base_select
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:opal_paffinity_base_select
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:*
+   obj:*
+   fun:opal_event_init
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:ompi_proc_all
+   obj:*
+   obj:*
+   obj:*
+   fun:_ZN6dolfin17SubSystemsManager12finalize_mpiEv
+   fun:_ZN6dolfin17SubSystemsManagerD1Ev
+   fun:__cxa_finalize
+   obj:*
+   obj:*
+   fun:exit
+   fun:(below main)
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   fun:opal_event_init
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:opal_util_keyval_parse
+   fun:mca_base_param_recache_files
+   fun:mca_base_param_init
+   fun:opal_init_util
+   obj:
+   fun:PMPI_Init
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:opal_paffinity_base_select
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:*
+   fun:dlopen
+   obj:*
+   obj:*
+   obj:*
+   fun:lt_dlopenadvise
+   fun:lt_dlopenext
+   obj:*
+   fun:mca_base_component_find
+   fun:mca_base_components_open
+   fun:opal_paffinity_base_open
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:opal_paffinity_base_select
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:opal_dss_unpack_buffer
+   obj:*
+   fun:orte_grpcomm_base_update_modex_entries
+   obj:*
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:*
+   obj:*
+   fun:opal_event_init
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:strdup
+   fun:opal_argv_append_nosize
+   fun:opal_argv_append
+   obj:*
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:opal_argv_append_nosize
+   fun:opal_argv_append
+   obj:*
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:__vasprintf_chk
+   fun:__asprintf_chk
+   fun:opal_output_init
+   fun:opal_init_util
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:__nss_database_lookup
+   obj:*
+   obj:*
+   fun:getpwuid_r
+   fun:getpwuid
+   fun:orte_session_dir_get_name
+   fun:orte_session_dir
+   fun:orte_ess_base_app_setup
+   obj:*
+   fun:orte_init
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:__nss_lookup_function
+   obj:*
+   obj:*
+   fun:getpwuid_r
+   fun:getpwuid
+   fun:orte_session_dir_get_name
+   fun:orte_session_dir
+   fun:orte_ess_base_app_setup
+   obj:*
+   fun:orte_init
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   fun:orte_ess_base_app_setup
+   obj:*
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:orte_ess_base_app_setup
+   obj:*
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:ompi_attr_set_fortran_mpi1
+   obj:*
+   obj:*
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   obj:*
+   fun:opal_pointer_array_set_item
+   fun:orte_dt_init
+   fun:orte_ess_base_std_prolog
+   obj:*
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:PMPI_Attr_put
+   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+   fun:_ZN6dolfin11PETScVector4initEjjSs
+   fun:_ZN6dolfin11PETScVectorC1ESs
+   fun:_ZNK6dolfin12PETScFactory13create_vectorEv
+   fun:main
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:opal_hash_table_set_value_uint32
+   obj:*
+   fun:PMPI_Attr_put
+   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+   fun:_ZN6dolfin11PETScVector4initEjjSs
+   fun:_ZN6dolfin11PETScVectorC1ESs
+   fun:_ZNK6dolfin12PETScFactory13create_vectorEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   obj:*
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+   obj:*
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:opal_hash_table_set_value_uint32
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:calloc
+   obj:*
+   fun:opal_event_init
+   fun:opal_init
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:opal_class_initialize
+   obj:*
+   obj:*
+   obj:*
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:realloc
+   obj:*
+   obj:*
+   fun:opal_event_add_i
+   fun:orte_wait_init
+   fun:orte_ess_base_std_prolog
+   obj:*
+   fun:orte_init
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:ompi_free_list_grow
+   obj:*
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+   obj:*
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   obj:*
+   fun:opal_dss_open
+   fun:opal_init_util
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+   obj:*
+}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVectorC1ESs
+#   fun:_ZNK6dolfin12PETScFactory13create_vectorEv
+#   fun:main
+#}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:malloc
+   fun:strdup
+   fun:opal_install_dirs_expand
+   fun:opal_installdirs_base_open
+   fun:opal_init_util
+   obj:*
+   fun:PMPI_Init
+   fun:_ZN6dolfin17SubSystemsManager8init_mpiEv
+   fun:_ZN6dolfin3MPI13num_processesEv
+   fun:_ZN6dolfin6LoggerC1Ev
+   fun:_GLOBAL__I_LogManager.cpp
+   obj:*
+}
+
+{
+   <insert a suppression name here>
+   Memcheck:Leak
+   fun:realloc
+   fun:opal_value_array_set_size
+   obj:*
+   fun:mca_base_param_reg_int
+   fun:mca_btl_base_param_register
+   obj:*
+   fun:mca_base_components_open
+   fun:mca_btl_base_open
+   obj:*
+   fun:mca_base_components_open
+   fun:mca_pml_base_open
+   obj:*
+}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:calloc
+#   fun:g_malloc0
+#   fun:_ZNK6dolfin13FunctionSpace4evalEPdPKdRKNS_8FunctionE
+#   fun:_ZNK6dolfin8Function4evalEPdPKd
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:calloc
+#   fun:g_malloc0
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   obj:*
+#   fun:PMPI_Attr_put
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVector6resizeEj
+#   fun:_ZN6dolfin8Function4initEv
+#   fun:_ZN6dolfin8FunctionC1ERKNS_13FunctionSpaceESs
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   obj:*
+#   fun:opal_hash_table_set_value_uint32
+#   obj:*
+#   fun:PMPI_Attr_put
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVector6resizeEj
+#   fun:_ZN6dolfin8Function4initEv
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVector6resizeEj
+#   fun:_ZN6dolfin8Function4initEv
+#   fun:_ZN6dolfin8FunctionC1ERKNS_13FunctionSpaceESs
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   obj:*
+#   obj:*
+#   fun:PMPI_Attr_put
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVectorC1ESs
+#   fun:_ZNK6dolfin12PETScFactory13create_vectorEv
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:_Z15PetscStrallocpyPKcPPc
+#   fun:PCCreate_LU
+#   fun:_Z9PCSetTypeP5_p_PCPKc
+#   fun:_ZN6dolfin13PETScLUSolver4initEv
+#   fun:_ZN6dolfin13PETScLUSolverC1Ev
+#   fun:_ZN6dolfin8LUSolver5solveERKNS_13GenericMatrixERNS_13GenericVectorERKS4_
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:_Z15PetscStrallocpyPKcPPc
+#   fun:PCFactorSetMatSolverPackage_Factor
+#   fun:_Z27PCFactorSetMatSolverPackageP5_p_PCPKc
+#   fun:_ZN6dolfin13PETScLUSolver4initEv
+#   fun:_ZN6dolfin13PETScLUSolverC1Ev
+#   fun:_ZN6dolfin8LUSolver5solveERKNS_13GenericMatrixERNS_13GenericVectorERKS4_
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:_Z9KSPCreateP19ompi_communicator_tPP6_p_KSP
+#   fun:_ZN6dolfin13PETScLUSolver4initEv
+#   fun:_ZN6dolfin13PETScLUSolverC1Ev
+#   fun:_ZN6dolfin8LUSolver5solveERKNS_13GenericMatrixERNS_13GenericVectorERKS4_
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Addr8
+#   fun:_ZN6dolfin15SystemAssembler8assembleERNS_13GenericMatrixERNS_13GenericVectorERNS_3UFCES6_RKNS_4FormES9_RKNS_4CellERKNS_5FacetERKNS0_7ScratchE
+#   fun:_ZN6dolfin15SystemAssembler14facet_assemblyERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RNS_3UFCES9_RNS0_7ScratchEPKNS_12MeshFunctionIjEESF_SF_
+#   fun:_ZN6dolfin15SystemAssembler8assembleERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RSt6vectorIPKNS_11DirichletBCESaISB_EEPKNS_12MeshFunctionIjEESI_SI_PKS3_bb
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Addr8
+#   fun:_ZN6dolfin15SystemAssembler8assembleERNS_13GenericMatrixERNS_13GenericVectorERNS_3UFCES6_RKNS_4FormES9_RKNS_4CellERKNS_5FacetERKNS0_7ScratchE
+#   fun:_ZN6dolfin15SystemAssembler14facet_assemblyERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RNS_3UFCES9_RNS0_7ScratchEPKNS_12MeshFunctionIjEESF_SF_
+#   fun:_ZN6dolfin15SystemAssembler8assembleERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RSt6vectorIPKNS_11DirichletBCESaISB_EEPKNS_12MeshFunctionIjEESI_SI_PKS3_bb
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Addr8
+#   fun:_ZN6dolfin15SystemAssembler13cell_assemblyERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RNS_3UFCES9_RNS0_7ScratchEPKNS_12MeshFunctionIjEESF_
+#   fun:_ZN6dolfin15SystemAssembler8assembleERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RSt6vectorIPKNS_11DirichletBCESaISB_EEPKNS_12MeshFunctionIjEESI_SI_PKS3_bb
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Addr8
+#   fun:_ZN6dolfin15SystemAssembler13cell_assemblyERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RNS_3UFCES9_RNS0_7ScratchEPKNS_12MeshFunctionIjEESF_
+#   fun:_ZN6dolfin15SystemAssembler8assembleERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RSt6vectorIPKNS_11DirichletBCESaISB_EEPKNS_12MeshFunctionIjEESI_SI_PKS3_bb
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   obj:*
+#   fun:PMPI_Attr_put
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVector6resizeEj
+#   fun:_ZN6dolfin8Function4initEv
+#   fun:_ZN6dolfin8Function6vectorEv
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVector6resizeEj
+#   fun:_ZN6dolfin8Function4initEv
+#   fun:_ZN6dolfin8Function6vectorEv
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:PCCreate_LU
+#   fun:_Z9PCSetTypeP5_p_PCPKc
+#   fun:_ZN6dolfin13PETScLUSolver4initEv
+#   fun:_ZN6dolfin13PETScLUSolverC1Ev
+#   fun:_ZN6dolfin8LUSolver5solveERKNS_13GenericMatrixERNS_13GenericVectorERKS4_
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:_Z15PetscStrallocpyPKcPPc
+#   fun:_Z25PetscObjectChangeTypeNameP14_p_PetscObjectPKc
+#   fun:_Z9PCSetTypeP5_p_PCPKc
+#   fun:_ZN6dolfin13PETScLUSolver4initEv
+#   fun:_ZN6dolfin13PETScLUSolverC1Ev
+#   fun:_ZN6dolfin8LUSolver5solveERKNS_13GenericMatrixERNS_13GenericVectorERKS4_
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Addr8
+#   fun:_ZN6dolfin15SystemAssembler13cell_assemblyERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RNS_3UFCES9_RNS0_7ScratchEPKNS_12MeshFunctionIjEESF_
+#   fun:_ZN6dolfin15SystemAssembler8assembleERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RSt6vectorIPKNS_11DirichletBCESaISB_EEPKNS_12MeshFunctionIjEESI_SI_PKS3_bb
+#   fun:_ZN6dolfin15SystemAssembler8assembleERNS_13GenericMatrixERNS_13GenericVectorERKNS_4FormES7_RKNS_11DirichletBCEbb
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   obj:*
+#   fun:PMPI_Attr_put
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVectorC1ESs
+#   fun:_ZNK6dolfin12PETScFactory13create_vectorEv
+#   fun:main
+#}
+
+#{
+#   <insert a suppression name here>
+#   Memcheck:Leak
+#   fun:malloc
+#   fun:_Z16PetscMallocAlignmiPKcS0_S0_PPv
+#   fun:_Z20PetscTrMallocDefaultmiPKcS0_S0_PPv
+#   fun:_Z18PetscCommDuplicateP19ompi_communicator_tPS0_Pi
+#   fun:_Z25PetscHeaderCreate_PrivateP14_p_PetscObjectiiPKcP19ompi_communicator_tPFiS0_EPFiS0_P14_p_PetscViewerE
+#   fun:_Z9VecCreateP19ompi_communicator_tPP6_p_Vec
+#   fun:_Z12VecCreateSeqP19ompi_communicator_tiPP6_p_Vec
+#   fun:_ZN6dolfin11PETScVector4initEjjSs
+#   fun:_ZN6dolfin11PETScVectorC1ESs
+#   fun:_ZNK6dolfin12PETScFactory13create_vectorEv
+#   fun:main
+#}
diff --git a/test/memory/test.py b/test/memory/test.py
new file mode 100644
index 0000000..a82ba46
--- /dev/null
+++ b/test/memory/test.py
@@ -0,0 +1,189 @@
+"""Run Valgrind on all demos."""
+
+# Copyright (C) 2008 Ilmar Wilbers
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2008
+# Modified by Dag Lindbo 2008
+# Modified by Johannes Ring 2008
+# Modified by Johan Hake 2009
+#
+# First added:  2008-04-08
+# Last changed: 2009-05-19
+
+import sys, os, re
+import platform
+from instant import get_status_output
+
+if "--only-python" in sys.argv:
+    print "Skipping C++ only memory tests"
+    sys.exit()
+
+if platform.system() in ['Darwin', 'Windows']:
+    print "No support for Valgrind on this platform."
+    sys.exit(0)
+
+# Demos to run
+cppdemos = []
+for dpath, dnames, fnames in os.walk(os.path.join(os.curdir, "..", "..", "demo")):
+    if os.path.basename(dpath) == 'cpp':
+        if os.path.isfile(os.path.join(dpath, 'Makefile')):
+            cppdemos.append(dpath)
+
+unit_test_excludes = ['graph']
+
+# Python unit test to run
+pythontests = []
+for dpath, dnames, fnames in os.walk(os.path.join(os.curdir, "..", "unit")):
+    if os.path.basename(dpath) == 'python':
+        if os.path.isfile(os.path.join(dpath, 'test.py')):
+            pythontests.append(dpath)
+
+pythontests = [test for test in pythontests if not any([exclude in test for exclude in unit_test_excludes])]
+
+unit_test_excludes.append('meshconvert')
+
+# cpp unit test to run
+cpptests = []
+for dpath, dnames, fnames in os.walk(os.path.join(os.curdir, "..", "unit")):
+    if os.path.basename(dpath) == 'cpp':
+        if os.path.isfile(os.path.join(dpath, 'test')):
+            cpptests.append(dpath)
+
+cpptests = [test for test in cpptests if not any([exclude in test for exclude in unit_test_excludes])]
+
+# Set non-interactive
+os.putenv('DOLFIN_NOPLOT', '1')
+
+# Helpful env vars
+os.putenv('G_SLICE','always-malloc')
+os.putenv('GLIBCXX_FORCE_NEW','1')
+os.putenv('G_DEBUG','gc-friendly')
+
+print pythontests
+
+# Demos that need command line arguments are treated seperately
+cppdemos.remove('./../../demo/undocumented/quadrature/cpp')
+cppdemos.remove('./../../demo/undocumented/method-weights/cpp')
+cppdemos.remove('./../../demo/undocumented/stiff/cpp')
+
+# Demos that are too time consuming to Valgrind
+cppdemos.remove('./../../demo/pde/cahn-hilliard/cpp')
+cppdemos.remove('./../../demo/undocumented/elastodynamics/cpp')
+cppdemos.remove('./../../demo/undocumented/reaction/cpp')
+cppdemos.remove('./../../demo/undocumented/courtemanche/cpp')
+
+re_def_lost = re.compile("definitely lost: 0 bytes in 0 blocks.")
+re_pos_lost = re.compile("possibly lost: 0 bytes in 0 blocks.")
+re_reachable = re.compile("still reachable: 0 bytes in 0 blocks.")
+re_error = re.compile("0 errors from 0 contexts")
+
+dolfin_supp = os.path.join(os.path.abspath(os.getcwd()), 'dolfin_valgrind.supp')
+vg_comm = 'valgrind --error-exitcode=9 --tool=memcheck --leak-check=full --show-reachable=yes --suppressions=%s' % dolfin_supp
+
+def run_and_analyse(path, run_str, prog_type, no_reachable_check = False):
+    output = get_status_output("cd %s && %s %s" % (path, vg_comm, run_str))
+    if "No such file or directory" in "".join([str(l) for l in output]):
+        print "*** FAILED: Unable to run demo"
+        return [(demo, "C++", output[1])]
+
+    if len(re.findall('All heap blocks were freed',output[1])) == 1:
+        print "OK"
+        return []
+
+    if "LEAK SUMMARY:" in output[1] and "ERROR SUMMARY:" in output[1]:
+        if re_def_lost.search(output[1]) and \
+           re_pos_lost.search(output[1]) and \
+           re_error.search(output[1]) and \
+           (no_reachable_check or re_reachable.search(output[1])):
+            print "OK"
+            return []
+
+    print "*** FAILED: Memory error"
+    return [(path, prog_type, output[1])]
+
+failed = []
+
+# Run C++ unittests
+print "----------------------------------------------------------------------"
+print "Running Valgrind on all C++ unittests"
+print ""
+print "Found %d C++ unittests" % len(cpptests)
+print ""
+
+for test_path in cpptests:
+    print "----------------------------------------------------------------------"
+    print "Running Valgrind on C++ unittest %s" % test_path
+    print ""
+    if os.path.isfile(os.path.join(test_path, 'test')):
+        failed += run_and_analyse(test_path,"./test","C++")
+    else:
+        print "*** Warning: missing test"
+
+# Outcommenting the Python unittests due to troubles with valgrind suppresions
+#
+#print "----------------------------------------------------------------------"
+#print "Running Valgrind on all Python unittests"
+#print ""
+#print "Found %d Python unittests" % len(pythontests)
+#print ""
+
+# Run Python unittests
+#for test_path in pythontests:
+#    print "----------------------------------------------------------------------"
+#    print "Running Valgrind on Python unittest %s" % test_path
+#    print ""
+#    if os.path.isfile(os.path.join(test_path, 'test.py')):
+#        failed += run_and_analyse(test_path,"python test.py","Python",True)
+#    else:
+#        print "*** Warning: missing test"
+
+# Run C++ demos
+print "----------------------------------------------------------------------"
+print "Running Valgrind on all demos (non-interactively)"
+print ""
+print "Found %d C++ demos" % len(cppdemos)
+print ""
+
+for demo_path in cppdemos:
+    print "----------------------------------------------------------------------"
+    print "Running Valgrind on C++ demo %s" % demo_path
+    print ""
+    demo_name = "./" + demo_path.split("/")[-2] + "-demo"
+    print demo_name
+    if os.path.isfile(os.path.join(demo_path, demo_name)):
+        failed += run_and_analyse(demo_path, demo_name, "C++")
+    else:
+        print "*** Warning: missing demo"
+
+# Print output for failed tests
+print ""
+if len(failed) > 0:
+    print "%d demo(s) and/or unit test(s) failed memcheck, see memcheck.log for details." % len(failed)
+    file = open("memcheck.log", "w")
+    for (test, interface, output) in failed:
+        file.write("----------------------------------------------------------------------\n")
+        file.write("%s (%s)\n" % (test, interface))
+        file.write("\n")
+        file.write(output)
+        file.write("\n")
+        file.write("\n")
+else:
+    print "All demos and unit tests checked for memory leaks and errors: OK"
+
+# Return error code if tests failed
+sys.exit(len(failed) != 0)
diff --git a/test/regression/README b/test/regression/README
new file mode 100644
index 0000000..1e6f3d3
--- /dev/null
+++ b/test/regression/README
@@ -0,0 +1,7 @@
+The regression test currently consists of running (almost) all demos.
+
+Ideally, we should also store MD5 sums or similar of the output from
+all demos (VTK output etc) and compare against this output when running
+the tests. For this to work, we also need to add an option for storing
+solutions with limited precision so that round-off errors won't affect
+the tests.
diff --git a/test/regression/test.py b/test/regression/test.py
new file mode 100644
index 0000000..0b3c624
--- /dev/null
+++ b/test/regression/test.py
@@ -0,0 +1,253 @@
+"""Run all demos."""
+
+# Copyright (C) 2008 Ilmar Wilbers
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg, 2008-2009.
+# Modified by Johannes Ring, 2009, 2011-2012.
+# Modified by Johan Hake, 2009.
+# Modified by Benjamin Kehlet 2012
+#
+# First added:  2008-04-08
+# Last changed: 2013-12-02
+
+import sys, os, re
+import platform
+import instant
+from time import time
+from instant import get_status_output
+from dolfin import has_mpi, has_parmetis, has_scotch
+
+
+def get_executable_name(demo, lang) :
+  """Extract name of executable (without extension) from path.
+     Name should be on the form demo_dir1_dir2 where dir1 and dir2 are
+     directories under demo/[undocumented,documented] and lang (cpp or py)
+     should be excluded.
+  """
+  directories = demo.split(os.path.sep)
+
+  # Search for "demo" and lang from right
+  directories_reverted = directories[::-1]
+  demo_index = len(directories) - directories_reverted.index("demo") - 1
+  lang_index = len(directories) - directories_reverted.index(lang) - 1
+  truncated_directories = directories[demo_index+2:lang_index]
+  return 'demo_' + "_".join(truncated_directories)
+
+# Location of all demos
+demodir = os.path.join(os.curdir, "..", "..", "demo")
+rootdir = os.path.abspath(os.curdir)
+
+# Demos to run
+cppdemos = []
+pydemos = []
+for dpath, dnames, fnames in os.walk(demodir):
+    if os.path.basename(dpath) == 'cpp':
+        if os.path.isfile(os.path.join(dpath, 'Makefile')):
+            cppdemos.append(dpath)
+    elif os.path.basename(dpath) == 'python':
+        tmp = dpath.split(os.path.sep)[-2]
+        if os.path.isfile(os.path.join(dpath, 'demo_' + tmp + '.py')):
+            pydemos.append(dpath)
+
+# Set non-interactive
+os.putenv('DOLFIN_NOPLOT', '1')
+
+print "Running all demos (non-interactively)"
+print ""
+print "Found %d C++ demos" % len(cppdemos)
+print "Found %d Python demos" % len(pydemos)
+print ""
+import pprint
+
+# Push slow demos to the end
+pyslow = []
+cppslow = []
+for s in pyslow:
+    if s in pydemos:
+        pydemos.remove(s)
+        pydemos.append(s)
+for s in cppslow:
+    if s in cppdemos:
+        cppdemos.remove(s)
+        cppdemos.append(s)
+
+# List of demos that throw expected errors in parallel
+not_working_in_parallel = \
+  [os.path.join(demodir, 'documented',   'biharmonic',                  'cpp'),    \
+   os.path.join(demodir, 'documented',   'biharmonic',                  'python'), \
+   os.path.join(demodir, 'documented',   'csg-2D',                      'python'), \
+   os.path.join(demodir, 'documented',   'csg-2D',                      'cpp'), \
+   os.path.join(demodir, 'undocumented', 'adaptive-poisson',            'python'), \
+   os.path.join(demodir, 'undocumented', 'auto-adaptive-navier-stokes', 'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'auto-adaptive-navier-stokes', 'python'), \
+   os.path.join(demodir, 'documented',   'auto-adaptive-poisson',       'cpp'),    \
+   os.path.join(demodir, 'documented',   'auto-adaptive-poisson',       'python'), \
+   os.path.join(demodir, 'undocumented', 'dg-advection-diffusion',      'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'dg-advection-diffusion',      'python'), \
+   os.path.join(demodir, 'undocumented', 'dg-poisson',                  'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'dg-poisson',                  'python'), \
+   os.path.join(demodir, 'undocumented', 'eval',                        'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'eval',                        'python'), \
+   os.path.join(demodir, 'undocumented', 'extrapolation',               'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'extrapolation',               'python'), \
+   os.path.join(demodir, 'undocumented', 'meshfunction-refinement',     'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'nonmatching-interpolation',   'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'nonmatching-interpolation',   'python'), \
+   os.path.join(demodir, 'undocumented', 'nonmatching-projection',      'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'nonmatching-projection',      'python'), \
+   os.path.join(demodir, 'undocumented', 'smoothing',                   'python'), \
+   os.path.join(demodir, 'documented',   'subdomains',                  'cpp'),    \
+   os.path.join(demodir, 'documented',   'subdomains',                  'python'), \
+   os.path.join(demodir, 'undocumented', 'submesh',                     'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'submesh',                     'python'), \
+   os.path.join(demodir, 'undocumented', 'time-series',                 'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'time-series',                 'python'), \
+   os.path.join(demodir, 'undocumented', 'triangulate',                 'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'triangulate',                 'python'), \
+   os.path.join(demodir, 'undocumented', 'restriction',                 'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'restriction',                 'python'),    \
+   os.path.join(demodir, 'undocumented', 'poisson1D-in-2D',             'cpp'),    \
+   os.path.join(demodir, 'undocumented', 'poisson1D-in-2D',             'python'), \
+   os.path.join(demodir, 'undocumented', 'compiled-extension-module',   'python'), \
+   ]
+
+failed = []
+timing = []
+
+# Check if we should run only Python tests, use for quick testing
+if len(sys.argv) == 2 and sys.argv[1] == "--only-python":
+    only_python = True
+else:
+    only_python = False
+
+# Check if we should skip C++ demos
+if only_python:
+    print "Skipping C++ demos"
+    cppdemos = []
+
+# Build prefix list
+prefixes = [""]
+mpi_prefix = "mpirun -np 3 "
+if has_mpi() and (has_parmetis() or has_scotch()):
+    prefixes.append(mpi_prefix)
+else:
+    print "Not running regression tests in parallel."
+
+# Allow to disable parallel testing
+if "DISABLE_PARALLEL_TESTING" in os.environ:
+    prefixes = [""]
+
+# Run in serial, then in parallel
+for prefix in prefixes:
+
+    # List of demos to run
+    if prefix == mpi_prefix:
+        cppdemos_to_run = list(set(cppdemos) - set(not_working_in_parallel))
+        pydemos_to_run  = list(set(pydemos)  - set(not_working_in_parallel))
+    else:
+        cppdemos_to_run = cppdemos
+        pydemos_to_run  = pydemos
+
+    # Run C++ demos
+    for demo in cppdemos_to_run:
+        print "----------------------------------------------------------------------"
+        print "Running C++ demo %s%s" % (prefix, demo)
+        print ""
+
+        cppdemo_executable = get_executable_name(demo, "cpp")
+
+        if platform.system() == 'Windows':
+            cppdemo_executable += '.exe'
+        if os.path.isfile(os.path.join(demo, cppdemo_executable)):
+            t1 = time()
+            os.chdir(demo)
+            output = get_status_output("%s .%s%s" % \
+                                       (prefix, os.path.sep, cppdemo_executable))
+            os.chdir(rootdir)
+            t2 = time()
+            timing += [(t2 - t1, demo)]
+            if output[0] == 0:
+                print "OK"
+            elif output[0] == 10: # Failing but exiting gracefully
+                print "ok (graceful exit on fail)"
+            else:
+                print "*** Failed"
+                print output[1]
+                failed += [(demo, "C++", prefix, output[1])]
+        else:
+            print "*** Warning: missing demo"
+
+    # Run Python demos
+    for demo in pydemos_to_run:
+        print "----------------------------------------------------------------------"
+        print "Running Python demo %s%s" % (prefix, demo)
+        print ""
+        demofile = get_executable_name(demo, "python") + '.py'
+        if os.path.isfile(os.path.join(demo, demofile)):
+            t1 = time()
+            os.chdir(demo)
+            status, output = get_status_output("%s python %s" % (prefix, demofile))
+            os.chdir(rootdir)
+            t2 = time()
+            timing += [(t2 - t1, demo)]
+            if status == 0:
+                print "OK"
+            elif status == 10: # Failing but exiting gracefully
+                print "ok (graceful exit on fail)"
+            else:
+                print "*** Failed"
+                print output
+
+                # Add contents from Instant's compile.log to output
+                instant_compile_log = os.path.join(instant.get_default_error_dir(), "compile.log")
+                if os.path.isfile(instant_compile_log):
+                    instant_error = file(instant_compile_log).read()
+                    output += "\n\nInstant compile.log for %s:\n\n" % demo
+                    output += instant_error
+                failed += [(demo, "Python", prefix, output)]
+        else:
+            print "*** Warning: missing demo"
+
+# Print summary of time to run demos
+timing.sort()
+print ""
+print "Time to run demos:"
+print "\n".join("%.2fs: %s" % t for t in timing)
+
+total_no_demos = len(pydemos)
+if not only_python:
+    total_no_demos += len(cppdemos)
+
+# Print output for failed tests
+print ""
+if len(failed) > 0:
+    print "%d demo(s) out of %d failed, see demo.log for details." % \
+          (len(failed), total_no_demos)
+    file = open("demo.log", "w")
+    for (test, interface, prefix, output) in failed:
+        file.write("----------------------------------------------------------------------\n")
+        file.write("%s%s (%s)\n" % (prefix, test, interface))
+        file.write("\n")
+        file.write(output)
+        file.write("\n")
+        file.write("\n")
+else:
+    print "All demos checked: OK"
+
+# Return error code if tests failed
+sys.exit(len(failed) != 0)
diff --git a/test/system/parallel-assembly-solve/solver.py b/test/system/parallel-assembly-solve/solver.py
new file mode 100644
index 0000000..f6bb0d1
--- /dev/null
+++ b/test/system/parallel-assembly-solve/solver.py
@@ -0,0 +1,121 @@
+"""This file solves a simple reaction-diffusion problem and compares
+the norm of the solution vector with a known solution (obtained when
+running in serial). It is used for validating mesh partitioning and
+parallel assembly/solve."""
+
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Garth N. Wells, 2013
+#
+# First added:  2009-08-17
+# Last changed: 2013-07-06
+
+import sys
+from dolfin import *
+
+# Relative tolerance for regression test
+tol = 1e-10
+
+def test_solve(mesh, degree):
+    "Solve on given mesh file and degree of function space."
+
+    # Create function space
+    V = FunctionSpace(mesh, "Lagrange", degree)
+
+    # Define variational problem
+    v = TestFunction(V)
+    u = TrialFunction(V)
+    f = Expression("sin(x[0])", degree=degree)
+    g = Expression("x[0]*x[1]", degree=degree)
+    a = dot(grad(v), grad(u))*dx + v*u*dx
+    L = v*f*dx - v*g*ds
+
+    # Compute solution
+    w = Function(V)
+    solve(a == L, w)
+
+    # Return norm of solution vector
+    return w.vector().norm("l2")
+
+def print_reference(results):
+    "Print nicely formatted values for gluing into code as a reference"
+    print "reference = {",
+    for (i, result) in enumerate(results):
+        if i > 0:
+            print "             ",
+        print "(\"%s\", %d): %.16g" % result,
+        if i < len(results) - 1:
+            print ","
+        else:
+            print "}"
+
+def check_results(results, reference, tol):
+    "Compare results with reference"
+
+    status = 0
+
+    print "Checking results"
+    print "----------------"
+
+    for (mesh_file, degree, norm) in results:
+        print "(%s, %d):\t" % (mesh_file, degree),
+        if (mesh_file, degree) in reference:
+            ref = reference[(mesh_file, degree)]
+            diff =  abs(norm - ref) / abs(ref)
+            if diff < tol:
+                print "OK",
+            else:
+                status = 1
+                print "*** ERROR",
+            print "(norm = %.16g, reference = %.16g, relative diff = %.16g)" % (norm, ref, diff)
+        else:
+            print "missing reference"
+
+    return status
+
+# Reference values for norm of solution vector
+reference = { ("16x16 unit square", 1): 9.547454087328376 ,
+              ("16x16 unit square", 2): 18.42366670418269 ,
+              ("16x16 unit square", 3): 27.29583104732836 ,
+              ("16x16 unit square", 4): 36.16867128121694 ,
+              ("4x4x4 unit cube", 1): 12.23389289626038 ,
+              ("4x4x4 unit cube", 2): 28.96491629163837 ,
+              ("4x4x4 unit cube", 3): 49.97350551329799 ,
+              ("4x4x4 unit cube", 4): 74.49938266409099 }
+
+# Mesh files and degrees to check
+meshes= [(UnitSquareMesh(16, 16), "16x16 unit square"),\
+         (UnitCubeMesh(4, 4, 4),  "4x4x4 unit cube")]
+degrees = [1, 2, 3, 4]
+
+
+# Iterate over test cases and collect results
+results = []
+for mesh in meshes:
+    for degree in degrees:
+        norm = test_solve(mesh[0], degree)
+        results.append((mesh[1], degree, norm))
+
+# Uncomment to print results for use as reference
+#print_reference(results)
+
+# Check results
+status = check_results(results, reference, tol)
+
+# Resturn exit status
+sys.exit(status)
diff --git a/test/system/parallel-assembly-solve/test.py b/test/system/parallel-assembly-solve/test.py
new file mode 100644
index 0000000..74ac47f
--- /dev/null
+++ b/test/system/parallel-assembly-solve/test.py
@@ -0,0 +1,53 @@
+"Run solver.py in parallel"
+
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johan Hake
+# Modified by Johannes Ring 2011
+# Modified by Garth N. Wells 2013
+#
+# First added:  2009-08-17
+# Last changed: 2013-07-06
+
+import sys
+import subprocess
+from dolfin import has_mpi, has_parmetis, has_scotch
+
+if not (has_mpi()):
+    print "DOLFIN has not been compiled with MPI. Test is not run."
+    sys.exit(0)
+elif not (has_parmetis() or has_scotch()):
+    print "DOLFIN has not been compiled with ParMETIS or SCOTCH. Test is not run."
+    sys.exit(0)
+
+# Number of processes
+num_processes = 3
+
+# Run solver.py
+output = subprocess.check_output(['mpirun', '-np', str(num_processes),
+                                  sys.executable, 'solver.py'])
+if len(sys.argv) > 1 and sys.argv[1] == "--debug":
+    print output
+
+# Return exit status
+if "ERROR" in output:
+    print output
+    sys.exit(1)
+else:
+    print "OK"
+    sys.exit(0)
diff --git a/test/system/test.py b/test/system/test.py
new file mode 100644
index 0000000..d4d11d6
--- /dev/null
+++ b/test/system/test.py
@@ -0,0 +1,52 @@
+"Run all system tests"
+
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johannes Ring 2011
+#
+# First added:  2009-08-17
+# Last changed: 2011-03-09
+
+import os, sys
+from instant import get_status_output
+
+pwd = os.path.dirname(os.path.abspath(__file__))
+
+# Tests to run
+tests = ["parallel-assembly-solve", "ufl-jit-assemble-chain"]
+
+failed = []
+
+# Command to run
+command = "python test.py" + " " + " ".join(sys.argv[1:])
+
+# Run tests
+for test in tests:
+    print "Running system test: %s" % test
+    print "----------------------------------------------------------------------"
+    os.chdir(os.path.join(pwd, test))
+    fail, output = get_status_output(command)
+    if fail:
+        failed.append(fail)
+        print "*** Failed"
+        print output
+    else:
+        print "OK"
+    print
+
+sys.exit(len(failed))
diff --git a/test/system/ufl-jit-assemble-chain/assembly_derivatives.py b/test/system/ufl-jit-assemble-chain/assembly_derivatives.py
new file mode 100644
index 0000000..5f478dd
--- /dev/null
+++ b/test/system/ufl-jit-assemble-chain/assembly_derivatives.py
@@ -0,0 +1,271 @@
+"""System integration tests for ufl-derivative-jit-assembly chain."""
+
+# Copyright (C) 2011 Martin S. Alnaes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-20-09
+# Last changed: 2011-20-09
+
+import unittest
+import numpy
+import math
+from dolfin import *
+
+class IntegrateDerivatives(unittest.TestCase):
+
+    def test_diff_then_integrate(self):
+
+        # Define 1D geometry
+        n = 21
+        mesh = UnitIntervalMesh(n)
+
+        # Shift and scale mesh
+        x0, x1 = 1.5, 3.14
+        mesh.coordinates()[:] *= (x1 - x0)
+        mesh.coordinates()[:] += x0
+
+        x = SpatialCoordinate(mesh)[0]
+        xs = 0.1+0.8*x/x1 # scaled to be within [0.1,0.9]
+
+        # Define list of expressions to test, and configure accuracies
+        # these expressions are known to pass with.  The reason some
+        # functions are less accurately integrated is likely that the
+        # default choice of quadrature rule is not perfect
+        F_list = []
+        def reg(exprs, acc=10):
+            for expr in exprs:
+                F_list.append((expr, acc))
+
+        # FIXME: 0*dx and 1*dx fails in the ufl-ffc-jit framework somewhere
+        #reg([Constant(0.0, cell=cell)])
+        #reg([Constant(1.0, cell=cell)])
+        monomial_list = [x**q for q in range(2, 6)]
+        reg(monomial_list)
+        reg([2.3*p+4.5*q for p in monomial_list for q in monomial_list])
+        reg([x**x])
+        reg([x**(x**2)], 8)
+        reg([x**(x**3)], 6)
+        reg([x**(x**4)], 2)
+        # Special functions:
+        reg([atan(xs)], 8)
+        reg([sin(x), cos(x), exp(x)], 5)
+        reg([ln(xs), pow(x, 2.7), pow(2.7, x)], 3)
+        reg([asin(xs), acos(xs)], 1)
+        reg([tan(xs)], 7)
+
+        try:
+            import scipy
+        except:
+            scipy = None
+
+        if hasattr(math, 'erf') or scipy is not None:
+            reg([erf(xs)])
+        else:
+            print "Warning: skipping test of erf, old python version and no scipy."
+
+        if 0:
+            print "Warning: skipping tests of bessel functions, doesn't build on all platforms."
+        elif scipy is None:
+            print "Warning: skipping tests of bessel functions, missing scipy."
+        else:
+            for nu in (0,1,2):
+                # Many of these are possibly more accurately
+                # integrated, but 4 covers all and is sufficient for
+                # this test
+                reg([bessel_J(nu, xs), bessel_Y(nu, xs), bessel_I(nu, xs), bessel_K(nu, xs)], 4)
+
+        # To handle tensor algebra, make an x dependent input tensor
+        # xx and square all expressions
+        def reg2(exprs, acc=10):
+            for expr in exprs:
+                F_list.append((inner(expr,expr), acc))
+        xx  = as_matrix([[2*x**2, 3*x**3], [11*x**5, 7*x**4]])
+        x3v = as_vector([3*x**2, 5*x**3, 7*x**4])
+        cc  = as_matrix([[2, 3], [4, 5]])
+        reg2([xx])
+        reg2([x3v])
+        reg2([cross(3*x3v, as_vector([-x3v[1], x3v[0], x3v[2]]))])
+        reg2([xx.T])
+        reg2([tr(xx)])
+        reg2([det(xx)])
+        reg2([dot(xx, 0.1*xx)])
+        reg2([outer(xx, xx.T)])
+        reg2([dev(xx)])
+        reg2([sym(xx)])
+        reg2([skew(xx)])
+        reg2([elem_mult(7*xx, cc)])
+        reg2([elem_div(7*xx, xx+cc)])
+        reg2([elem_pow(1e-3*xx, 1e-3*cc)])
+        reg2([elem_pow(1e-3*cc, 1e-3*xx)])
+        reg2([elem_op(lambda z: sin(z) + 2, 0.03*xx)], 2) # pretty inaccurate...
+
+        # FIXME: Add tests for all UFL operators:
+        # These cause discontinuities and may be harder to test in the
+        # above fashion:
+        #'inv', 'cofac',
+        #'eq', 'ne', 'le', 'ge', 'lt', 'gt', 'And', 'Or', 'Not',
+        #'conditional', 'sign',
+        #'jump', 'avg',
+        #'LiftingFunction', 'LiftingOperator',
+
+        # FIXME: Test other derivatives: (but algorithms for operator
+        # derivatives are the same!):
+        #'variable', 'diff',
+        #'Dx', 'grad', 'div', 'curl', 'rot', 'Dn', 'exterior_derivative',
+
+        # Run through all operators defined above and compare
+        # integrals
+        debug = 0
+        for F, acc in F_list:
+            # Apply UFL differentiation
+            f = diff(F, SpatialCoordinate(mesh))[...,0]
+            if debug:
+                print F
+                print x
+                print f
+
+            # Apply integration with DOLFIN (also passes through form
+            # compilation and jit)
+            M = f*dx(mesh)
+            if debug:
+                print M
+                print M.compute_form_data().preprocessed_form
+            f_integral = assemble(M)
+
+            # Compute integral of f manually from anti-derivative F
+            # (passes through PyDOLFIN interface and uses UFL
+            # evaluation)
+            F_diff = F((x1,)) - F((x0,))
+
+            # Compare results. Using custom relative delta instead of
+            # decimal digits here because some numbers are >> 1.
+            delta = min(abs(f_integral), abs(F_diff)) * 10**-acc
+            self.assertAlmostEqualDelta(f_integral, F_diff, delta=delta)
+
+    def assertAlmostEqualDelta(self, a, b, delta):
+        # Keyword delta to assertAlmostEqual is not supported in Python < 2.7
+        r = abs(a - b) <= delta
+        if not r:
+            print "Not equal within delta %g:" % delta
+            print a
+            print b
+        self.assertTrue(r)
+
+    def test_div_grad_then_integrate_over_cells_and_boundary(self):
+
+        # Define 2D geometry
+        n = 10
+        mesh = RectangleMesh(0.0, 0.0, 2.0, 3.0, 2*n, 3*n)
+
+        x, y = SpatialCoordinate(mesh)
+        xs = 0.1+0.8*x/2 # scaled to be within [0.1,0.9]
+        ys = 0.1+0.8*y/3 # scaled to be within [0.1,0.9]
+        n = FacetNormal(mesh)
+
+        # Define list of expressions to test, and configure accuracies
+        # these expressions are known to pass with.  The reason some
+        # functions are less accurately integrated is likely that the
+        # default choice of quadrature rule is not perfect
+        F_list = []
+        def reg(exprs, acc=10):
+            for expr in exprs:
+                F_list.append((expr, acc))
+
+        # FIXME: 0*dx and 1*dx fails in the ufl-ffc-jit framework somewhere
+        #reg([Constant(0.0, cell=cell)])
+        #reg([Constant(1.0, cell=cell)])
+        monomial_list = [x**q for q in range(2, 6)]
+        reg(monomial_list)
+        reg([2.3*p+4.5*q for p in monomial_list for q in monomial_list])
+        reg([xs**xs])
+        reg([xs**(xs**2)], 8) # Note: Accuracies here are from 1D case, not checked against 2D results.
+        reg([xs**(xs**3)], 6)
+        reg([xs**(xs**4)], 2)
+        # Special functions:
+        reg([atan(xs)], 8)
+        reg([sin(x), cos(x), exp(x)], 5)
+        reg([ln(xs), pow(x, 2.7), pow(2.7, x)], 3)
+        reg([asin(xs), acos(xs)], 1)
+        reg([tan(xs)], 7)
+
+        # To handle tensor algebra, make an x dependent input tensor
+        # xx and square all expressions
+        def reg2(exprs, acc=10):
+            for expr in exprs:
+                F_list.append((inner(expr,expr), acc))
+        xx = as_matrix([[2*x**2, 3*x**3], [11*x**5, 7*x**4]])
+        xxs = as_matrix([[2*xs**2, 3*xs**3], [11*xs**5, 7*xs**4]])
+        x3v = as_vector([3*x**2, 5*x**3, 7*x**4])
+        cc = as_matrix([[2, 3], [4, 5]])
+        reg2([xx]) # TODO: Make unit test for UFL from this, results in listtensor with free indices
+        reg2([x3v])
+        reg2([cross(3*x3v, as_vector([-x3v[1], x3v[0], x3v[2]]))])
+        reg2([xx.T])
+        reg2([tr(xx)])
+        reg2([det(xx)])
+        reg2([dot(xx,0.1*xx)])
+        reg2([outer(xx,xx.T)])
+        reg2([dev(xx)])
+        reg2([sym(xx)])
+        reg2([skew(xx)])
+        reg2([elem_mult(7*xx, cc)])
+        reg2([elem_div(7*xx, xx+cc)])
+        reg2([elem_pow(1e-3*xxs, 1e-3*cc)])
+        reg2([elem_pow(1e-3*cc, 1e-3*xx)])
+        reg2([elem_op(lambda z: sin(z)+2, 0.03*xx)], 2) # pretty inaccurate...
+
+        # FIXME: Add tests for all UFL operators:
+        # These cause discontinuities and may be harder to test in the
+        # above fashion:
+        #'inv', 'cofac',
+        #'eq', 'ne', 'le', 'ge', 'lt', 'gt', 'And', 'Or', 'Not',
+        #'conditional', 'sign',
+        #'jump', 'avg',
+        #'LiftingFunction', 'LiftingOperator',
+
+        # FIXME: Test other derivatives: (but algorithms for operator
+        # derivatives are the same!):
+        #'variable', 'diff',
+        #'Dx', 'grad', 'div', 'curl', 'rot', 'Dn', 'exterior_derivative',
+
+        # Run through all operators defined above and compare
+        # integrals
+        debug = 0
+        if debug:
+            k = 2
+            F_list = F_list[1:]
+
+        for F,acc in F_list:
+            if debug: print '\n', "F:", str(F)
+
+            # Integrate over domain and its boundary
+            int_dx = assemble(div(grad(F))*dx(mesh))
+            int_ds = assemble(dot(grad(F), n)*ds(mesh))
+
+            if debug: print int_dx, int_ds
+
+            # Compare results. Using custom relative delta instead of
+            # decimal digits here because some numbers are >> 1.
+            delta = min(abs(int_dx), abs(int_ds)) * 10**-acc
+            self.assertAlmostEqualDelta(int_dx, int_ds, delta=delta)
+
+
+if __name__ == "__main__":
+    print ""
+    print "Testing DOLFIN integration of UFL derivatives"
+    print "---------------------------------------------"
+    unittest.main()
diff --git a/test/system/ufl-jit-assemble-chain/form_operations.py b/test/system/ufl-jit-assemble-chain/form_operations.py
new file mode 100644
index 0000000..e28e821
--- /dev/null
+++ b/test/system/ufl-jit-assemble-chain/form_operations.py
@@ -0,0 +1,58 @@
+"""Tests for DOLFIN integration of various form operations"""
+
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-11-14
+# Last changed: 2011-11-14
+
+import unittest
+from dolfin import *
+
+class FormOperations(unittest.TestCase):
+
+    def test_lhs_rhs_simple(self):
+        """Test taking lhs/rhs of DOLFIN specific forms (constants
+        without cell). """
+
+        mesh = RectangleMesh(0, 0, 2, 1, 3, 5)
+        V = FunctionSpace(mesh, "CG", 1)
+        f = Constant(2.0)
+        g = Constant(3.0)
+        v = TestFunction(V)
+        u = TrialFunction(V)
+
+        F = inner(g*grad(f*v), grad(u))*dx + f*v*dx
+        a, L = system(F)
+
+        Fl = lhs(F)
+        Fr = rhs(F)
+
+        a0 = inner(grad(v), grad(u))*dx
+
+        n = assemble(a).norm("frobenius")
+        nl = assemble(Fl).norm("frobenius")
+        n0 = 6.0*assemble(a0).norm("frobenius")
+
+        self.assertAlmostEqual(n, n0)
+        self.assertAlmostEqual(n, nl)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing DOLFIN integration of basic UFL form operations"
+    print "-------------------------------------------------------"
+    unittest.main()
diff --git a/test/system/ufl-jit-assemble-chain/test.py b/test/system/ufl-jit-assemble-chain/test.py
new file mode 100644
index 0000000..e27a10d
--- /dev/null
+++ b/test/system/ufl-jit-assemble-chain/test.py
@@ -0,0 +1,41 @@
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-11-14
+# Last changed: 2013-03-04
+
+import sys
+from instant import get_status_output
+
+tests = ["assembly_derivatives.py", "form_operations.py"]
+
+failed = []
+for test in tests:
+    command = "%s %s" % (sys.executable,test)
+    print
+    print "Running tests: %s" % test
+    print "----------------------------------------------------------------------"
+    fail, output = get_status_output(command)
+
+    if fail:
+        failed.append(fail)
+        print "*** %s failed" % test
+        print output
+    else:
+        print "OK"
+
+sys.exit(len(failed))
diff --git a/test/test.py b/test/test.py
new file mode 100644
index 0000000..bd0290b
--- /dev/null
+++ b/test/test.py
@@ -0,0 +1,49 @@
+"Run all tests"
+
+# Copyright (C) 2007-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2007-06-09
+# Last changed: 2011-11-14
+
+import re, sys, os, subprocess
+from instant import get_status_output
+
+pwd = os.path.dirname(os.path.abspath(__file__))
+
+# Tests to run
+tests = ["unit", "regression", "system", "documentation", "codingstyle"]
+
+# Check if we should enable memory testing
+if len(sys.argv) == 2 and sys.argv[1] == "--enable-memory-test":
+    tests.append("memory")
+
+failed = []
+
+# Command to run
+command = [sys.executable, "test.py"] + sys.argv[1:]
+
+# Run tests
+for test in tests:
+    print "Running tests: %s" % test
+    print "----------------------------------------------------------------------"
+    os.chdir(os.path.join(pwd, test))
+    status = subprocess.Popen(command, shell=False).wait()
+    if status:
+        failed.append(status)
+
+sys.exit(len(failed))
diff --git a/test/unit/adaptivity/python/TimeSeries.py b/test/unit/adaptivity/python/TimeSeries.py
new file mode 100644
index 0000000..a2a6be8
--- /dev/null
+++ b/test/unit/adaptivity/python/TimeSeries.py
@@ -0,0 +1,102 @@
+"""Unit tests for TimeSeries"""
+
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+#
+# First added:  2011-06-16
+# Last changed: 2014-05-28
+
+import unittest
+from dolfin import *
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TimeSeriesTest(unittest.TestCase):
+
+    def test_retrieve_compressed(self):
+        self._test_retrieve(True, False)
+
+    def test_retrieve_compressed_all_connectivities(self):
+        self._test_retrieve(True, True)
+
+    def test_retrieve_all_connectivities(self):
+        self._test_retrieve(False, True)
+
+    def _test_retrieve(self, compressed=False, all_connectivities=False):
+
+        times = [t/10.0 for t in range(1, 11)]
+
+        mesh_size = (2, 2, 2)
+        mesh = UnitCubeMesh(*mesh_size)
+        mesh.init()
+        V = FunctionSpace(mesh, "CG", 2)
+
+        u = Function(V)
+        series = TimeSeries("TimeSeries_test_retrieve", compressed, all_connectivities)
+        for t in times:
+            u.vector()[:] = t
+            series.store(u.vector(), t)
+            series.store(mesh, t)
+
+        series = TimeSeries("TimeSeries_test_retrieve", compressed)
+        t0 = series.vector_times()[0]
+        T = series.mesh_times()[-1]
+
+        self.assertAlmostEqual(t0, times[0])
+        self.assertAlmostEqual(T, times[-1])
+
+        # Test retreiving of mesh
+        mesh_retreived = Mesh()
+        series.retrieve(mesh_retreived, 0.1)
+
+        mesh_test = mesh if all_connectivities else UnitCubeMesh(*mesh_size)
+
+        for entity in range(4):
+            self.assertEqual(mesh_retreived.topology().size(entity),
+                             mesh_test.topology().size(entity))
+
+        for i in range(4):
+            for j in range(4):
+                self.assertEqual(mesh_retreived.topology()(i, j).size(),
+                                 mesh_test.topology()(i, j).size())
+
+    def test_subdirectory(self):
+        "Test that retrieve/store works with nonexisting subdirectory"
+
+        m0 = UnitSquareMesh(3, 3)
+
+        name = "TimeSeries_test_subdirectory/foo"
+        series0 = TimeSeries(name)
+        x0 = Vector(mpi_comm_world(), 10)
+
+        # Test storage of only one time point for the mesh
+        series0.store(m0, 0.1)
+        series0.store(x0, 0.1)
+        series0.store(x0, 0.2)
+
+        series1 = TimeSeries(name)
+        m1 = Mesh()
+        x1 = Vector()
+
+        series1.retrieve(m1, 0.1)
+        series1.retrieve(x1, 0.15)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing TimeSeries operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/adaptivity/python/errorcontrol.py b/test/unit/adaptivity/python/errorcontrol.py
new file mode 100644
index 0000000..7e1dfde
--- /dev/null
+++ b/test/unit/adaptivity/python/errorcontrol.py
@@ -0,0 +1,131 @@
+"""Unit tests for error control"""
+
+# Copyright (C) 2011 Marie E. Rognes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-04-05
+# Last changed: 2014-05-28
+
+import unittest
+from ufl.algorithms import replace
+
+from dolfin import *
+from dolfin.fem.adaptivesolving import *
+
+# FIXME: Move this to dolfin for user access?
+def reconstruct_refined_form(form, functions, mesh):
+    function_mapping = {}
+    for u in functions:
+        w = Function(u.leaf_node().function_space())
+        w.assign(u.leaf_node())
+        function_mapping[u] = w
+    domain = mesh.leaf_node().ufl_domain()
+    newform = replace_integral_domains(replace(form, function_mapping), domain)
+    return newform, function_mapping
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class ErrorControlTest(unittest.TestCase):
+
+    def setUp(self):
+
+        # Define variational problem
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        bc = [DirichletBC(V, 0.0, "x[0] < DOLFIN_EPS || x[0] > 1.0 - DOLFIN_EPS")]
+
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)", degree=1)
+        g = Expression("sin(5*x[0])", degree=1)
+        a = inner(grad(u), grad(v))*dx()
+        L = f*v*dx() + g*v*ds()
+
+        # Define solution function
+        u = Function(V)
+
+        # Define LinearVariationalProblem
+        problem = LinearVariationalProblem(a, L, u, bc)
+
+        # Define goal
+        M = u*dx()
+        self.goal = M
+
+        # Asserting that domains are ok before trying error control generation
+        assert len(M.domains()) == 1, "Expecting only the domain from the mesh to get here through u."
+        assert M.domains()[0] == mesh.ufl_domain(), "Expecting only the domain from the mesh to get here through u."
+        assert len(a.domains()) == 1, "Expecting only the domain from the mesh to get here through u."
+        assert a.domains()[0] == mesh.ufl_domain(), "Expecting only the domain from the mesh to get here through u."
+        assert len(L.domains()) == 1, "Expecting only the domain from the mesh to get here through u."
+        assert L.domains()[0] == mesh.ufl_domain(), "Expecting only the domain from the mesh to get here through u."
+
+        # Generate ErrorControl object
+        ec = generate_error_control(problem, M)
+
+        # Store created stuff
+        self.mesh = mesh
+        self.problem = problem
+        self.u = u
+        self.ec = ec
+
+    def test_error_estimation(self):
+
+        # Solve variational problem once
+        solver = LinearVariationalSolver(self.problem)
+        solver.solve()
+
+        # Compute error estimate
+        error_estimate = self.ec.estimate_error(self.u, self.problem.bcs())
+
+        # Compare estimate with defined reference
+        reference = 0.0011789985750808342
+        self.assertAlmostEqual(error_estimate, reference)
+
+    def test_error_indicators(self):
+
+        # Solve variational problem once
+        solver = LinearVariationalSolver(self.problem)
+        solver.solve()
+
+        # Compute error indicators
+        indicators = Vector(self.mesh.mpi_comm(), self.u.function_space().mesh().num_cells())
+        indicators[0] = 1.0
+        #self.ec.compute_indicators(indicators, self.u) #
+
+        reference = 1.0 # FIXME
+        self.assertAlmostEqual(indicators.sum(), reference)
+
+    def test_adaptive_solve(self):
+
+        # Solve problem adaptively
+        solver = AdaptiveLinearVariationalSolver(self.problem, self.goal)
+        tol = 0.00087
+        solver.solve(tol)
+
+        # Note: This old approach is now broken, as it doesn't change the integration domain:
+        #M = replace(self.goal, {self.u: w})
+        # This new approach handles the integration domain properly:
+        M, fm = reconstruct_refined_form(self.goal, [self.u], self.mesh)
+
+        # Compare computed goal with reference
+        reference = 0.12583303389560166
+        self.assertAlmostEqual(assemble(M), reference)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing automated adaptivity operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/ale/python/HarmonicSmoothing.py b/test/unit/ale/python/HarmonicSmoothing.py
new file mode 100644
index 0000000..94cc745
--- /dev/null
+++ b/test/unit/ale/python/HarmonicSmoothing.py
@@ -0,0 +1,112 @@
+"""Unit test for HarmonicSmoothing and ALE"""
+
+# Copyright (C) 2013 Jan Blechta
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-03-02
+# Last changed: 2014-05-28
+
+import unittest
+from dolfin import UnitSquareMesh, BoundaryMesh, Expression, \
+                   CellFunction, SubMesh, Constant, MPI, MeshQuality,\
+                   mpi_comm_world
+
+class HarmonicSmoothingTest(unittest.TestCase):
+
+    def test_HarmonicSmoothing(self):
+
+        print ""
+        print "Testing HarmonicSmoothing::move(Mesh& mesh, " \
+              "const BoundaryMesh& new_boundary)"
+
+        # Create some mesh and its boundary
+        mesh = UnitSquareMesh(10, 10)
+        boundary = BoundaryMesh(mesh, 'exterior')
+
+        # Move boundary
+        disp = Expression(("0.3*x[0]*x[1]", "0.5*(1.0-x[1])"))
+        boundary.move(disp)
+
+        # Move mesh according to given boundary
+        mesh.move(boundary)
+
+        # Check that new boundary topology corresponds to given one
+        boundary_new = BoundaryMesh(mesh, 'exterior')
+        self.assertEqual(boundary.topology().hash(),
+                         boundary_new.topology().hash())
+
+        # Check that coordinates are almost equal
+        err = sum(sum(abs(boundary.coordinates() \
+                        - boundary_new.coordinates()))) / mesh.num_vertices()
+        print "Current CG solver produced error in boundary coordinates", err
+        self.assertAlmostEqual(err, 0.0, places=5)
+
+        # Check mesh quality
+        magic_number = 0.35
+        rmin = MeshQuality.radius_ratio_min_max(mesh)[0]
+        self.assertTrue(rmin > magic_number)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class ALETest(unittest.TestCase):
+
+    def test_ale(self):
+
+        print ""
+        print "Testing ALE::move(Mesh& mesh0, const Mesh& mesh1)"
+
+        # Create some mesh
+        mesh = UnitSquareMesh(4, 5)
+
+        # Make some cell function
+        # FIXME: Initialization by array indexing is probably
+        #        not a good way for parallel test
+        cellfunc = CellFunction('size_t', mesh)
+        cellfunc.array()[0:4] = 0
+        cellfunc.array()[4:]  = 1
+
+        # Create submeshes - this does not work in parallel
+        submesh0 = SubMesh(mesh, cellfunc, 0)
+        submesh1 = SubMesh(mesh, cellfunc, 1)
+
+        # Move submesh0
+        disp = Constant(("0.1", "-0.1"))
+        submesh0.move(disp)
+
+        # Move and smooth submesh1 accordignly
+        submesh1.move(submesh0)
+
+        # Move mesh accordingly
+        parent_vertex_indices_0 = \
+            submesh0.data().array('parent_vertex_indices', 0)
+        parent_vertex_indices_1 = \
+            submesh1.data().array('parent_vertex_indices', 0)
+        mesh.coordinates()[parent_vertex_indices_0[:]] = \
+            submesh0.coordinates()[:]
+        mesh.coordinates()[parent_vertex_indices_1[:]] = \
+            submesh1.coordinates()[:]
+
+        # If test passes here then it is probably working
+        # Check for cell quality for sure
+        magic_number = 0.28
+        rmin = MeshQuality.radius_ratio_min_max(mesh)[0]
+        self.assertTrue(rmin > magic_number)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing HarmonicSmoothing and ALE operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/book/README b/test/unit/book/README
new file mode 100644
index 0000000..8d42993
--- /dev/null
+++ b/test/unit/book/README
@@ -0,0 +1,28 @@
+This directory contains unit tests for the FEniCS book:
+
+  Automated Solution of Differential Equations
+  by the Finite Element Method
+
+These tests ensure that the examples presented in the book
+continue to work with future versions of DOLFIN.
+
+When we do need to break the unit tests for the book, those changes
+should be listeed in this file:
+
+* DOLFIN 1.3:
+  - Move parameter "linear_solver" from NonlinearVariationalSolver
+  to NewtonSolver and PETScSNESSolver.
+
+  - python/chapter_1_files/stationary/nonlinear_poisson/vp1_np.py: change parameters
+  - python/chapter_1_files/stationary/nonlinear_poisson/vp2_np.py: change parameters
+  - python/chapter_10.py: change parameters
+
+* DOLFIN 1.4:
+  - python/chapter_1.py: change "UnitFoo -> UnitFooMesh
+  - python/chapter_1.py: change "UnitCirle -> CircleMesh
+  - python/chapter_10.py: change UnitSquare -> UnitSquareMesh
+  - python/chapter_10.py: change UnitCube -> UnitCubeMesh
+  - python/chapter_10.py: change "uint" -> "size_t" in MeshFunctions
+  - Add MPI communicator to vectors
+  - Change UnitSquare to UnitSquareMesh
+  - Change 'uint' to 'size_t' for MeshFunctions
diff --git a/test/unit/book/python/chapter_1.py b/test/unit/book/python/chapter_1.py
new file mode 100644
index 0000000..2475035
--- /dev/null
+++ b/test/unit/book/python/chapter_1.py
@@ -0,0 +1,188 @@
+"""
+Unit tests for Chapter 1 (A FEniCS tutorial).
+"""
+
+# Copyright (C) 2011 Hans Petter Langtangen and Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-10-20
+# Last changed: 2014-05-28
+
+import unittest
+import inspect, os, sys
+from dolfin import *
+
+# Try importing runpy, added in Python 2.7
+try:
+    from runpy import run_path as runpy_run_path
+    has_run_path = True
+except:
+    has_run_path = False
+
+def run_path(path, args):
+    "Replacement for runpy.run_path when it doesn't exist"
+
+    if has_run_path:
+        sys.argv = ["foo"] + [str(arg) for arg in args]
+        try:
+            runpy_run_path(path)
+        except SystemExit, e:
+            if e.args[0] == 0:
+                pass
+            else:
+                raise e
+    else:
+        status = os.system("python " + path + " " + \
+                           " ".join(str(arg) for arg in args))
+        if not status == 0:
+            raise RuntimeError, "Python script failed"
+
+def run_test(path, args=[]):
+    "Run test script implied by name of calling function, neat trick..."
+
+    # Figure out name of script to be run
+    script_name = inspect.stack()[1][3].split("test_")[1] + ".py"
+    file_path = os.path.join(*(["chapter_1_files"] + path + [script_name]))
+
+    # Print a message
+    print
+    print "Running tutorial example %s" % file_path
+    print "-------------------------------------------------------------------------"
+
+    # Remember default DOLFIN parameters
+    dolfin_parameters = {}
+    dolfin_parameters.update(parameters)
+
+    # Run script with default parameters
+    run_path(file_path, args)
+
+    # Try reading parameters, might not always work if running without PETSc
+    # and the parameter file specifies PETSc to be used
+    try:
+        file = File(os.path.join("chapter_1_files", "dolfin_parameters.xml"))
+        file >> parameters
+        print
+        print "Running again using stored parameter values"
+        print
+        new_parameters = True
+    except:
+        print
+        print "Unable to read old parameters, skipping this test"
+        print
+        new_parameters = False
+
+    # Run script again with book parameters
+    if new_parameters:
+        run_path(file_path, args)
+
+    # Reset parameters
+    parameters.update(dolfin_parameters)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPoisson(unittest.TestCase):
+
+    def test_dn3_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_dn3_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_dnr_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_d5_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_d1_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_paD(self):
+        run_test(["stationary", "poisson"], [8, 8])
+
+    def test_d3_p2D(self):
+        run_test(["stationary", "poisson"], [1])
+
+    def test_d6_p2D(self):
+        run_test(["stationary", "poisson"], [1])
+
+    def test_dn2_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_d2_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_mat2x_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_dn1_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_dn4_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def disabled_test_vcp2D(self):
+        # Disabled since it depends on scitools
+        run_test(["stationary", "poisson"])
+
+    def test_d4_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_mat2_p2D(self):
+        run_test(["stationary", "poisson"])
+
+    def test_membrane1v(self):
+        run_test(["stationary", "poisson"])
+
+    def test_membrane1(self):
+        run_test(["stationary", "poisson"])
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestNonlinearPoisson(unittest.TestCase):
+
+    def test_pde_newton_np(self):
+        run_test(["stationary", "nonlinear_poisson"], [1, 8, 8])
+
+    def test_picard_np(self):
+        run_test(["stationary", "nonlinear_poisson"], [1, 8, 8])
+
+    def test_vp1_np(self):
+        run_test(["stationary", "nonlinear_poisson"], ["a", "g", 1, 8, 8])
+
+    def test_vp2_np(self):
+        run_test(["stationary", "nonlinear_poisson"], ["a", "g", 1, 8, 8])
+
+    def test_alg_newton_np(self):
+        run_test(["stationary", "nonlinear_poisson"], [1, 8, 8])
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestDiffusion(unittest.TestCase):
+
+    def test_d1_d2D(self):
+        run_test(["transient", "diffusion"])
+
+    def test_d2_d2D(self):
+        run_test(["transient", "diffusion"])
+
+    def disabled_test_sin_daD(self):
+        # Disabled since it depends on scitools
+        run_test(["transient", "diffusion"], [1, 1.5, 4, 40])
+
+if __name__ == "__main__":
+    print ""
+    print "Testing the FEniCS Book, Chapter 1"
+    print "----------------------------------"
+    unittest.main()
diff --git a/test/unit/book/python/chapter_10.py b/test/unit/book/python/chapter_10.py
new file mode 100644
index 0000000..37525ee
--- /dev/null
+++ b/test/unit/book/python/chapter_10.py
@@ -0,0 +1,1014 @@
+"""
+Unit tests for Chapter 10 (DOLFIN: A C++/Python finite element library).
+Page numbering starts at 1 and is relative to the chapter (not the book).
+"""
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-10-20
+# Last changed: 2014-05-28
+
+import unittest
+from dolfin import *
+
+default_parameters = parameters.copy()
+
+def create_data(A=None):
+    "This function creates data used in the tests below"
+    mesh = UnitSquareMesh(2, 2)
+    V = FunctionSpace(mesh, "Lagrange", 1)
+    u = TrialFunction(V)
+    v = TestFunction(V)
+    if A is None:
+        A = assemble(u*v*dx)
+    else:
+        assemble(u*v*dx, tensor=A)
+    b = assemble(v*dx)
+    x = Vector()
+    return A, x, b
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage4(unittest.TestCase):
+
+    def test_box_1(self):
+        x = Vector()
+
+    def test_box_2(self):
+        A = Matrix()
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage5(unittest.TestCase):
+
+    def test_box_1(self):
+        x = Vector(mpi_comm_world(), 100)
+
+    def test_box_2(self):
+        A, x, b = create_data()
+        solve(A, x, b)
+
+    def test_box_3(self):
+        A, x, b = create_data()
+        solve(A, x, b, "lu")
+        solve(A, x, b, "gmres", "ilu")
+
+    def test_box_4(self):
+        list_lu_solver_methods()
+        list_krylov_solver_methods()
+        list_krylov_solver_preconditioners()
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage6(unittest.TestCase):
+
+    def test_box_1(self):
+        A, x, b = create_data()
+        solver = LUSolver(A)
+        solver.solve(x, b)
+
+    def test_box_2(self):
+        A, x, b = create_data()
+        solver = LUSolver()
+        solver.set_operator(A)
+        solver.solve(x, b)
+
+    def test_box_3(self):
+        solver = LUSolver()
+        solver.parameters["same_nonzero_pattern"] = True
+
+    def test_box_4(self):
+        A, x, b = create_data()
+        solver = KrylovSolver(A)
+        solver.solve(x, b)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage7(unittest.TestCase):
+
+    def test_box_1(self):
+        A, x, b = create_data()
+        solver = KrylovSolver()
+        solver.set_operator(A)
+        solver.solve(x, b)
+
+    def test_box_2(self):
+        A, x, b = create_data()
+        P = A
+        solver = KrylovSolver()
+        solver.set_operators(A, P)
+        solver.solve(x, b)
+
+    def test_box_3(self):
+        solver = KrylovSolver()
+        solver.parameters["relative_tolerance"] = 1.0e-6
+        solver.parameters["absolute_tolerance"] = 1.0e-15
+        solver.parameters["divergence_limit"] = 1.0e4
+        solver.parameters["maximum_iterations"] = 10000
+        solver.parameters["error_on_nonconvergence"] = True
+        solver.parameters["nonzero_initial_guess"] = False
+
+    def test_box_4(self):
+        solver = KrylovSolver()
+        solver.parameters["report"] = True
+        solver.parameters["monitor_convergence"] = True
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage8(unittest.TestCase):
+
+    def test_box_1(self):
+        solver = KrylovSolver("gmres", "ilu")
+
+    def test_box_2(self):
+        if not has_linear_algebra_backend("PETSc") or not has_slepc() : return
+        A = PETScMatrix()
+        A, x, b = create_data(A)
+        eigensolver = SLEPcEigenSolver(A)
+        eigensolver.solve()
+        lambda_r, lambda_c, x_real, x_complex = eigensolver.get_eigenpair(0)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage9(unittest.TestCase):
+
+    def test_box_1(self):
+        if not has_linear_algebra_backend("PETSc") or not has_slepc() : return
+        A = PETScMatrix()
+        M = PETScMatrix()
+        A, x, b = create_data(A)
+        M, x, b = create_data(M)
+        eigensolver = SLEPcEigenSolver(A, M)
+
+    def test_box_2(self):
+        if not has_linear_algebra_backend("PETSc"): return
+        parameters["linear_algebra_backend"] = "PETSc"
+
+        # Reset parameter again so we don't mess with other tests
+        parameters.update(default_parameters)
+
+    def test_box_3(self):
+        if not has_linear_algebra_backend("PETSc"): return
+        x = PETScVector()
+        solver = PETScLUSolver()
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage10(unittest.TestCase):
+
+    def test_box_1(self):
+
+        class MyNonlinearProblem(NonlinearProblem):
+            def __init__(self, L, a, bc):
+                NonlinearProblem.__init__(self)
+                self.L = L
+                self.a = a
+                self.bc = bc
+
+            def F(self, b, x):
+                assemble(self.L, tensor=b)
+                self.bc.apply(b, x)
+
+            def J(self, A, x):
+                assemble(self.a, tensor=A)
+                self.bc.apply(A)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage11(unittest.TestCase):
+
+    def test_box_1(self):
+
+        class MyNonlinearProblem(NonlinearProblem):
+            def __init__(self, L, a, bc):
+                NonlinearProblem.__init__(self)
+                self.L = L
+                self.a = a
+                self.bc = bc
+
+            def F(self, b, x):
+                assemble(self.L, tensor=b)
+                self.bc.apply(b, x)
+
+            def J(self, A, x):
+                assemble(self.a, tensor=A)
+                self.bc.apply(A)
+
+        mesh = UnitSquareMesh(2, 2)
+        V  = FunctionSpace(mesh, "Lagrange", 1)
+        u  = Function(V)
+        du = TrialFunction(V)
+        v  = TestFunction(V)
+        a  = du*v*dx
+        L  = u*v*dx - v*dx
+        bc = DirichletBC(V, 0.0, DomainBoundary())
+
+        problem = MyNonlinearProblem(L, a, bc)
+        newton_solver = NewtonSolver()
+        newton_solver.solve(problem, u.vector())
+
+    def test_box_2(self):
+        newton_solver = NewtonSolver()
+        newton_solver.parameters["maximum_iterations"] = 20
+        newton_solver.parameters["relative_tolerance"] = 1.0e-6
+        newton_solver.parameters["absolute_tolerance"] = 1.0e-10
+        newton_solver.parameters["error_on_nonconvergence"] = False
+
+    def test_box_3(self):
+        unit_square = UnitSquareMesh(16, 16)
+        unit_cube = UnitCubeMesh(16, 16, 16)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage12(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = Mesh();
+        editor = MeshEditor();
+        editor.open(mesh, 2, 2)
+        editor.init_vertices(4)
+        editor.init_cells(2)
+        editor.add_vertex(0, 0.0, 0.0)
+        editor.add_vertex(1, 1.0, 0.0)
+        editor.add_vertex(2, 1.0, 1.0)
+        editor.add_vertex(3, 0.0, 1.0)
+        editor.add_cell(0, 0, 1, 2)
+        editor.add_cell(1, 0, 2, 3)
+        editor.close()
+
+    def test_box_2(self):
+        mesh = Mesh("mesh.xml")
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage14(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(8, 8)
+        entity = MeshEntity(mesh, 0, 33)
+        vertex = Vertex(mesh, 33)
+        cell = Cell(mesh, 25)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        gdim = mesh.topology().dim()
+        tdim = mesh.geometry().dim()
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage15(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        mesh.init(2)
+        mesh.init(0, 0)
+        mesh.init(1, 1)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        for c in cells(mesh):
+            for v0 in vertices(c):
+                for v1 in vertices(v0):
+                    print v1
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage16(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        D = mesh.topology().dim()
+        for c in entities(mesh, D):
+            for v0 in entities(c, 0):
+                for v1 in entities(v0, 0):
+                    print v1
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+
+        sub_domains = CellFunction("size_t", mesh)
+        sub_domains.set_all(0)
+        for cell in cells(mesh):
+            p = cell.midpoint()
+            if p.x() > 0.5:
+                sub_domains[cell] = 1
+
+        boundary_markers = FacetFunction("size_t", mesh)
+        boundary_markers.set_all(0)
+        for facet in facets(mesh):
+            p = facet.midpoint()
+            if near(p.y(), 0.0) or near(p.y(), 1.0):
+                boundary_markers[facet] = 1
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage17(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        # Note: MeshData no longer returns MeshFunctions. This was
+        #       necessary to remove a circular code dependency.
+        #       Accessing a MeshFunction will now throw an error with
+        #       the suggestion to use arrays.
+        #sub_domains = mesh.data().create_mesh_function("sub_domains")
+        #sub_domains = mesh.data().mesh_function("sub_domains")
+        sub_domains = mesh.data().create_array("sub_domains", 2)
+        sub_domains = mesh.data().array("sub_domains", 2)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(8, 8)
+
+        mesh = refine(mesh)
+
+        cell_markers = CellFunction("bool", mesh)
+        cell_markers.set_all(False)
+        origin = Point(0.0, 0.0, 0.0)
+        for cell in cells(mesh):
+            p = cell.midpoint()
+            if p.distance(origin) < 0.1:
+                cell_markers[cell] = True
+        mesh = refine(mesh, cell_markers)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage19(unittest.TestCase):
+
+    def test_box_1(self):
+        element = FiniteElement("Lagrange", tetrahedron, 5)
+        element = FiniteElement("CG", tetrahedron, 5)
+        element = FiniteElement("Brezzi-Douglas-Marini", triangle, 3)
+        element = FiniteElement("BDM", triangle, 3)
+        element = FiniteElement("Nedelec 1st kind H(curl)", tetrahedron, 2)
+        element = FiniteElement("N1curl", tetrahedron, 2)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage20(unittest.TestCase):
+
+    def test_box_1(self):
+        element = FiniteElement("Lagrange", triangle, 1)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+
+    def test_box_3(self):
+        V = VectorElement("Lagrange", triangle, 2)
+        Q = FiniteElement("Lagrange", triangle, 1)
+        W = V*Q
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage21(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = VectorFunctionSpace(mesh, "Lagrange", 2)
+        Q = FunctionSpace(mesh, "Lagrange", 1)
+        W = V*Q
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = Function(V)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage22(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        A = assemble(u*v*dx)
+        b = assemble(v*dx)
+        u = Function(V)
+        solve(A, u.vector(), b)
+
+    def test_box_2(self):
+        mesh = UnitCubeMesh(2, 2, 2)
+
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = Function(V)
+        scalar = u(0.1, 0.2, 0.3)
+
+        V = VectorFunctionSpace(mesh, "Lagrange", 1)
+        u = Function(V)
+        vector = u(0.1, 0.2, 0.3)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage23(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = VectorFunctionSpace(mesh, "Lagrange", 2)
+        Q = FunctionSpace(mesh, "Lagrange", 1)
+        W = V*Q
+
+        w = Function(W)
+        u, p = w.split()
+
+        uu, pp = w.split(deepcopy=True)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage24(unittest.TestCase):
+
+    def test_box_1(self):
+        class MyExpression(Expression):
+            def eval(self, values, x):
+                values[0] = sin(x[0])*cos(x[1])
+        f = MyExpression()
+        print f((0.5, 0.5))
+
+    def test_box_2(self):
+        class MyExpression(Expression):
+            def eval(self, values, x):
+                values[0] = sin(x[0])
+                values[1] = cos(x[1])
+            def value_shape(self):
+                return (2,)
+        g = MyExpression()
+        print g((0.5, 0.5))
+
+    def test_box_3(self):
+        f = Expression("sin(x[0])*cos(x[1])")
+        g = Expression(("sin(x[0])", "cos(x[1])"))
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage25(unittest.TestCase):
+
+    def test_box_1(self):
+        t = 0.0
+        T = 1.0
+        dt = 0.5
+
+        h = Expression("t*sin(x[0])*cos(x[1])", t=0.0)
+        while t < T:
+            h.t = t
+            t += dt
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage26(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(8, 8)
+        V = VectorFunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        f = Expression(("0.0", "0.0"))
+
+        E = 10.0
+        nu = 0.3
+
+        mu = E/(2.0*(1.0 + nu))
+        lmbda = E*nu/((1.0 + nu)*(1.0 - 2.0*nu))
+
+        def sigma(v):
+            return 2.0*mu*sym(grad(v)) + lmbda*tr(sym(grad(v)))*Identity(v.cell().d)
+
+        a = inner(sigma(u), sym(grad(v)))*dx
+        L = dot(f, v)*dx
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage27(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        f = Function(V)
+        M = f*dx
+        L = f*v*dx
+        a = u*v*dx
+
+        m = assemble(M)
+        b = assemble(L)
+        A = assemble(a)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage29(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        class NeumannBoundary(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] < 0.5 + DOLFIN_EPS and on_boundary
+        neumann_boundary = NeumannBoundary()
+        exterior_facet_domains = FacetFunction("size_t", mesh)
+        exterior_facet_domains.set_all(1)
+        neumann_boundary.mark(exterior_facet_domains, 0)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage30(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        v = TestFunction(V)
+        g = Function(V)
+        h = Function(V)
+        class NeumannBoundary(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] < 0.5 + DOLFIN_EPS and on_boundary
+        neumann_boundary = NeumannBoundary()
+
+        dss = ds[neumann_boundary]
+        a = g*v*dss(0) + h*v*dss(1)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        class DirichletValue(Expression):
+            def eval(self, value, x):
+                values[0] = sin(x[0])
+        class DirichletBoundary(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] > 0.5 - DOLFIN_EPS and on_boundary
+        u_0 = DirichletValue()
+        Gamma_D = DirichletBoundary()
+        bc = DirichletBC(V, u_0, Gamma_D)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage31(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u_0 = Expression("sin(x[0])")
+        bc = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        A, x, b = create_data()
+        u_0 = Expression("sin(x[0])")
+        bc = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        u = Function(V)
+
+        bc.apply(A, b)
+        bc.apply(u.vector())
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage32(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u_0 = Expression("sin(x[0])")
+        bc0 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bc1 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bc2 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        a = u*v*dx
+        L = v*dx
+
+        bcs = [bc0, bc1, bc2]
+        u = Function(V)
+        solve(a == L, u, bcs=bcs)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        f = Expression("0.0")
+        u_0 = Expression("sin(x[0])")
+        bc0 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bc1 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bc2 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bcs = [bc0, bc1, bc2]
+        du = TrialFunction(V)
+
+        u = Function(V)
+        v = TestFunction(V)
+        F = inner((1 + u**2)*grad(u), grad(v))*dx - f*v*dx
+
+        solve(F == 0, u, bcs=bcs)
+
+        J = derivative(F, u)
+        solve(F == 0, u, bcs=bcs, J=J)
+
+    def test_box_3(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        f = Expression("0.0")
+        u_0 = Expression("sin(x[0])")
+        bc0 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bc1 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bc2 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bcs = [bc0, bc1, bc2]
+        du = TrialFunction(V)
+
+        u = Function(V)
+        v = TestFunction(V)
+        F = inner((1 + u**2)*grad(u), grad(v))*dx - f*v*dx
+        J = derivative(F, u)
+
+        u = Function(V)
+        problem = NonlinearVariationalProblem(F, u, bcs=bcs, J=J)
+        solver = NonlinearVariationalSolver(problem)
+        solver.parameters["newton_solver"]["linear_solver"] = "gmres"
+        solver.parameters["newton_solver"]["preconditioner"] = "ilu"
+        solver.solve()
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage33(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        f = Expression("0.0")
+        u_0 = Expression("sin(x[0])")
+        bc0 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bc1 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bc2 = DirichletBC(V, u_0, "x[0] > 0.5 && on_boundary")
+        bcs = [bc0, bc1, bc2]
+        du = TrialFunction(V)
+        u = Function(V)
+        v = TestFunction(V)
+        F = inner((1 + u**2)*grad(u), grad(v))*dx - f*v*dx
+        J = derivative(F, u)
+        u = Function(V)
+        problem = NonlinearVariationalProblem(F, u, bcs=bcs, J=J)
+        solver = NonlinearVariationalSolver(problem)
+
+        info(solver.parameters, True)
+
+    def test_box_2(self):
+        mesh = Mesh("mesh.xml")
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage34(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u = Function(V)
+        mesh_function = MeshFunction("size_t", mesh, 0)
+
+        #plot(u)
+        #plot(mesh)
+        #plot(mesh_function)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u = Function(V)
+
+        #plot(grad(u))
+        #plot(u*u)
+        element = FiniteElement("BDM", tetrahedron, 3)
+
+        # Disabled since it claims the terminal
+        #plot(element)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage35(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u = Function(V)
+
+        file = File("solution.pvd")
+        file << u
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u = Function(V)
+        t = 1.0
+
+        file = File("solution.pvd", "compressed");
+        file << (u, t)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage36(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        matrix, x, vector = create_data()
+
+        vector_file = File("vector.xml")
+        vector_file << vector
+        vector_file >> vector
+        mesh_file = File("mesh.xml")
+        mesh_file << mesh
+        mesh_file >> mesh
+        parameters_file = File("parameters.xml")
+        parameters_file << parameters
+        parameters_file >> parameters
+
+        # Reset parameter again so we don't mess with other tests
+        parameters.update(default_parameters)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage37(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u = Function(V)
+        dt = 0.5
+        t = 0.0
+        T = 1.0
+
+        time_series = TimeSeries("simulation_data")
+        while t < T:
+            time_series.store(u.vector(), t)
+            time_series.store(mesh, t)
+            t += dt
+
+    def test_box_2(self):
+        time_series = TimeSeries("simulation_data")
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "CG", 1)
+        u = Function(V)
+        t = 0.5
+
+        #time_series.retrieve(u.vector(), t)
+        #time_series.retrieve(mesh, t)
+
+    def test_box_3(self):
+        M = 100
+        N = 100
+        info("Assembling system of size %d x %d." % (M, N))
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage38(unittest.TestCase):
+
+    def test_box_1(self):
+        info("Test message")
+        log(DEBUG, "Test message")
+        log(15, "Test message")
+        set_log_level(DEBUG)
+        info("Test message")
+        log(DEBUG, "Test message")
+        log(15, "Test message")
+        set_log_level(WARNING)
+        info("Test message")
+        warning("Test message")
+        print "Test message"
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage39(unittest.TestCase):
+
+    def test_box_1(self):
+        matrix, vector, b = create_data()
+        solver = KrylovSolver()
+        mesh = UnitSquareMesh(2, 2)
+        mesh_function = MeshFunction("size_t", mesh, 0)
+        function_space = FunctionSpace(mesh, "CG", 1)
+        function = Function(function_space)
+
+        info(vector)
+        info(matrix)
+        info(solver)
+        info(mesh)
+        info(mesh_function)
+        info(function)
+        info(function_space)
+        info(parameters)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        info(mesh, True)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage40(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        t = 0.0
+        T = 1.0
+        dt = 0.5
+
+        begin("Starting nonlinear iteration.")
+        info("Updating velocity.")
+        info("Updating pressure.")
+        info("Computing residual.")
+        end()
+
+        p = Progress("Iterating over all cells.", mesh.num_cells())
+        for cell in cells(mesh):
+            p += 1
+
+        q = Progress("Time-stepping")
+        while t < T:
+            t += dt
+            q.update(t / T)
+
+    def test_box_2(self):
+        def solve(A, b):
+            timer = Timer("Linear solve")
+            x = 1
+            return x
+        solve(None, None)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage41(unittest.TestCase):
+
+    def test_box_1(self):
+        info(parameters, True)
+        num_threads = parameters["num_threads"]
+        allow_extrapolation = parameters["allow_extrapolation"]
+        parameters["num_threads"] = 8
+        parameters["allow_extrapolation"] = True
+
+        # Reset parameter again so we don't mess with other tests
+        parameters.update(default_parameters)
+
+    def test_box_2(self):
+        solver = KrylovSolver()
+        solver.parameters["absolute_tolerance"] = 1e-6
+        solver.parameters["report"] = True
+        solver.parameters["gmres"]["restart"] = 50
+        #solver.parameters["preconditioner"]["reuse"] = True
+        solver.parameters["preconditioner"]["structure"] = "same"
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage42(unittest.TestCase):
+
+    def test_box_1(self):
+        my_parameters = Parameters("my_parameters")
+        my_parameters.add("foo", 3)
+        my_parameters.add("bar", 0.1)
+
+    def test_box_2(self):
+        d = dict(num_threads=4, krylov_solver=dict(absolute_tolerance=1e-6))
+        parameters.update(d)
+
+        # Reset parameter again so we don't mess with other tests
+        parameters.update(default_parameters)
+
+    def test_box_3(self):
+        my_parameters = Parameters("my_parameters", foo=3, bar=0.1,
+                                   nested=Parameters("nested", baz=True))
+
+    def test_box_4(self):
+        parameters.parse()
+
+        # Reset parameter again so we don't mess with other tests
+        parameters.update(default_parameters)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage43(unittest.TestCase):
+
+    def test_box_1(self):
+        file = File("parameters.xml")
+        file << parameters
+        file >> parameters
+
+        # Reset parameter again so we don't mess with other tests
+        parameters.update(default_parameters)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage45(unittest.TestCase):
+
+    def test_box_1(self):
+        parameters["mesh_partitioner"] = "ParMETIS"
+
+        # Reset parameter again so we don't mess with other tests
+        parameters.update(default_parameters)
+
+    def test_box_2(self):
+        from dolfin import cpp
+        Function = cpp.Function
+        assemble = cpp.assemble
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage46(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+
+class TestPage47(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(2, 2)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        class Source(Expression):
+            def eval(self, values, x):
+                values[0] = sin(x[0])
+        v = TestFunction(V)
+        f = Source()
+        L = f*v*dx
+        assemble(L)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage48(unittest.TestCase):
+
+    def test_box_1(self):
+        e = Expression("sin(x[0])")
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage49(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        c = Expression("sin(x[0])")
+        a = c*dot(grad(u), grad(v))*dx
+        A = assemble(a)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage50(unittest.TestCase):
+
+    def test_box_1(self):
+        parameters["form_compiler"]["name"] = "sfc"
+
+        # Reset parameter again so we don't mess with other tests
+        parameters.update(default_parameters)
+
+    def test_box_2(self):
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        a = u*v*dx
+
+        A = assemble(a)
+        AA = A.array()
+
+    def test_box_3(self):
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        v = TestFunction(V)
+        L = v*dx
+
+        default_linear_algebra_backend = parameters["linear_algebra_backend"]
+        parameters["linear_algebra_backend"] = "uBLAS"
+        b = assemble(L)
+        bb = b.data()
+
+        # Reset linear algebra backend so that other tests work
+        parameters["linear_algebra_backend"] = default_linear_algebra_backend
+
+    def test_box_4(self):
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        a = u*v*dx
+
+        # Only test when MTL4 is available
+        default_linear_algebra_backend = parameters["linear_algebra_backend"]
+        if has_linear_algebra_backend("MTL4"):
+            parameters["linear_algebra_backend"] = "MTL4"
+            A = assemble(a)
+            rows, columns, values = A.data()
+
+        # Reset linear algebra backend so that other tests work
+        parameters["linear_algebra_backend"] = default_linear_algebra_backend
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestPage51(unittest.TestCase):
+
+    def test_box_1(self):
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        a = u*v*dx
+        default_linear_algebra_backend = parameters["linear_algebra_backend"]
+        parameters["linear_algebra_backend"] = "uBLAS"
+        A = assemble(a)
+
+        try:
+            from scipy.sparse import csr_matrix
+        except ImportError:
+            pass
+        else:
+            rows, columns, values = A.data()
+            csr = csr_matrix((values, columns, rows))
+
+        # Reset linear algebra backend so that other tests work
+        parameters["linear_algebra_backend"] = default_linear_algebra_backend
+
+    def test_box_2(self):
+        b = Vector(mpi_comm_world(), 10)
+        c = Vector(mpi_comm_world(), 10)
+        b_copy = b[:]
+        b[:] = c
+        b[b < 0] = 0
+        b2 = b[::2]
+
+    def test_box_3(self):
+        from numpy import array
+        b = Vector(mpi_comm_world(), 20)
+        b1 = b[[0, 4, 7, 10]]
+        b2 = b[array((0, 4, 7, 10))]
+
+if __name__ == "__main__":
+    print ""
+    print "Testing the FEniCS Book, Chapter 10"
+    print "-----------------------------------"
+    unittest.main()
diff --git a/test/unit/book/python/chapter_1_files/dolfin_parameters.xml b/test/unit/book/python/chapter_1_files/dolfin_parameters.xml
new file mode 100644
index 0000000..c7bf4f9
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/dolfin_parameters.xml
@@ -0,0 +1,69 @@
+<?xml version="1.0"?>
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <parameters name="dolfin">
+    <parameter key="allow_extrapolation" type="bool" value="false" />
+    <parameter key="exact_interpolation" type="bool" value="true" />
+    <parameter key="graph_coloring_library" type="string" value="Boost" />
+    <parameter key="linear_algebra_backend" type="string" value="PETSc" />
+    <parameter key="mesh_partitioner" type="string" value="ParMETIS" />
+    <parameter key="num_threads" type="int" value="0" />
+    <parameter key="optimize" type="bool" value="false" />
+    <parameter key="optimize_form" type="bool" value="false" />
+    <parameter key="optimize_use_dofmap_cache" type="bool" value="false" />
+    <parameter key="optimize_use_tensor_cache" type="bool" value="false" />
+    <parameter key="plot_filename_prefix" type="string" value="dolfin_plot_data" />
+    <parameter key="refinement_algorithm" type="string" value="recursive_bisection" />
+    <parameter key="std_out_all_processes" type="bool" value="true" />
+    <parameter key="timer_prefix" type="string" value="" />
+    <parameters name="form_compiler">
+      <parameter key="cache_dir" type="string" value="" />
+      <parameter key="convert_exceptions_to_warnings" type="bool" value="false" />
+      <parameter key="cpp_optimize" type="bool" value="false" />
+      <parameter key="cpp_optimize_flags" type="string" value="-O2" />
+      <parameter key="epsilon" type="double" value="1e-14" />
+      <parameter key="error_control" type="bool" value="false" />
+      <parameter key="form_postfix" type="bool" value="true" />
+      <parameter key="format" type="string" value="ufc" />
+      <parameter key="log_level" type="int" value="25" />
+      <parameter key="log_prefix" type="string" value="" />
+      <parameter key="name" type="string" value="ffc" />
+      <parameter key="optimize" type="bool" value="false" />
+      <parameter key="output_dir" type="string" value="." />
+      <parameter key="precision" type="int" value="15" />
+      <parameter key="quadrature_degree" type="int" value="-1" />
+      <parameter key="quadrature_rule" type="string" value="auto" />
+      <parameter key="representation" type="string" value="auto" />
+      <parameter key="split" type="bool" value="false" />
+    </parameters>
+    <parameters name="krylov_solver">
+      <parameter key="absolute_tolerance" type="double" value="1e-15" />
+      <parameter key="divergence_limit" type="double" value="10000" />
+      <parameter key="error_on_nonconvergence" type="bool" value="true" />
+      <parameter key="maximum_iterations" type="int" value="10000" />
+      <parameter key="monitor_convergence" type="bool" value="false" />
+      <parameter key="nonzero_initial_guess" type="bool" value="false" />
+      <parameter key="relative_tolerance" type="double" value="1e-06" />
+      <parameter key="report" type="bool" value="true" />
+      <parameters name="gmres">
+        <parameter key="restart" type="int" value="30" />
+      </parameters>
+      <parameters name="preconditioner">
+        <parameter key="report" type="bool" value="false" />
+        <parameter key="reuse" type="bool" value="false" />
+        <parameter key="same_nonzero_pattern" type="bool" value="false" />
+        <parameter key="shift_nonzero" type="double" value="0" />
+        <parameters name="ilu">
+          <parameter key="fill_level" type="int" value="0" />
+        </parameters>
+        <parameters name="schwarz">
+          <parameter key="overlap" type="int" value="1" />
+        </parameters>
+      </parameters>
+    </parameters>
+    <parameters name="lu_solver">
+      <parameter key="report" type="bool" value="true" />
+      <parameter key="reuse_factorization" type="bool" value="false" />
+      <parameter key="same_nonzero_pattern" type="bool" value="false" />
+    </parameters>
+  </parameters>
+</dolfin>
diff --git a/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/alg_newton_np.py b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/alg_newton_np.py
new file mode 100644
index 0000000..6a8bb1b
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/alg_newton_np.py
@@ -0,0 +1,111 @@
+"""
+FEniCS tutorial demo program:
+Nonlinear Poisson equation with Dirichlet conditions
+in x-direction and homogeneous Neumann (symmetry) conditions
+in all other directions. The domain is the unit hypercube in
+of a given dimension.
+
+-div(q(u)*nabla_grad(u)) = 0,
+u = 0 at x=0, u=1 at x=1, du/dn=0 at all other boundaries.
+q(u) = (1+u)^m
+
+Solution method: Newton iteration at the algebraic level.
+"""
+
+from dolfin import *
+import numpy, sys
+
+# Create mesh and define function space
+degree = int(sys.argv[1])
+divisions = [int(arg) for arg in sys.argv[2:]]
+d = len(divisions)
+domain_type = [UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh]
+mesh = domain_type[d-1](*divisions)
+V = FunctionSpace(mesh, 'Lagrange', degree)
+
+# Define boundary conditions for initial guess
+tol = 1E-14
+def left_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]) < tol
+
+def right_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]-1) < tol
+
+Gamma_0 = DirichletBC(V, Constant(0.0), left_boundary)
+Gamma_1 = DirichletBC(V, Constant(1.0), right_boundary)
+bcs = [Gamma_0, Gamma_1]
+
+# Define variational problem for initial guess (q(u)=1, i.e., m=0)
+u = TrialFunction(V)
+v = TestFunction(V)
+a = inner(nabla_grad(u), nabla_grad(v))*dx
+f = Constant(0.0)
+L = f*v*dx
+A, b = assemble_system(a, L, bcs)
+u_k = Function(V)
+solve(A, u_k.vector(), b, 'lu')
+
+
+# Note that all Dirichlet conditions must be zero for
+# the correction function in a Newton-type method
+Gamma_0_du = DirichletBC(V, Constant(0.0), left_boundary)
+Gamma_1_du = DirichletBC(V, Constant(0.0), right_boundary)
+bcs_du = [Gamma_0_du, Gamma_1_du]
+
+# Choice of nonlinear coefficient
+m = 2
+
+def q(u):
+    return (1+u)**m
+
+def Dq(u):
+    return m*(1+u)**(m-1)
+
+# Define variational problem for the matrix and vector
+# in a Newton iteration
+du = TrialFunction(V) # u = u_k + omega*du
+a = inner(q(u_k)*nabla_grad(du), nabla_grad(v))*dx + \
+    inner(Dq(u_k)*du*nabla_grad(u_k), nabla_grad(v))*dx
+L = -inner(q(u_k)*nabla_grad(u_k), nabla_grad(v))*dx
+
+# Newton iteration at the algebraic level
+du = Function(V)
+u  = Function(V)  # u = u_k + omega*du
+omega = 1.0       # relaxation parameter
+eps = 1.0
+tol = 1.0E-5
+iter = 0
+maxiter = 25
+# u_k must have right boundary conditions
+while eps > tol and iter < maxiter:
+    iter += 1
+    print iter, 'iteration',
+    A, b = assemble_system(a, L, bcs_du)
+    solve(A, du.vector(), b)
+    eps = numpy.linalg.norm(du.vector().array(), ord=numpy.Inf)
+    print 'Norm:', eps
+    u.vector()[:] = u_k.vector() + omega*du.vector()
+    # or
+    #u.vector()[:] += omega*du.vector()
+    # or
+    #u.assign(u_k)  # u = u_k
+    #u.vector().axpy(omega, du.vector())
+    u_k.assign(u)
+
+
+convergence = 'convergence after %d Newton iterations at the algebraic level' % iter
+if iter >= maxiter:
+    convergence = 'no ' + convergence
+
+print """
+Solution of the nonlinear Poisson problem div(q(u)*nabla_grad(u)) = f,
+with f=0, q(u) = (1+u)^m, u=0 at x=0 and u=1 at x=1.
+%s
+%s
+""" % (mesh, convergence)
+
+# Find max error
+u_exact = Expression('pow((pow(2, m+1)-1)*x[0] + 1, 1.0/(m+1)) - 1', m=m)
+u_e = interpolate(u_exact, V)
+diff = numpy.abs(u_e.vector().array() - u.vector().array()).max()
+print 'Max error:', diff
diff --git a/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/pde_newton_np.py b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/pde_newton_np.py
new file mode 100644
index 0000000..aee746e
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/pde_newton_np.py
@@ -0,0 +1,109 @@
+"""
+FEniCS tutorial demo program:
+Nonlinear Poisson equation with Dirichlet conditions
+in x-direction and homogeneous Neumann (symmetry) conditions
+in all other directions. The domain is the unit hypercube in
+of a given dimension.
+
+-div(q(u)*nabla_grad(u)) = 0,
+u = 0 at x=0, u=1 at x=1, du/dn=0 at all other boundaries.
+q(u) = (1+u)^m
+
+Solution method: Newton method at the PDE level.
+"""
+
+from dolfin import *
+import numpy, sys
+
+# Create mesh and define function space
+degree = int(sys.argv[1])
+divisions = [int(arg) for arg in sys.argv[2:]]
+d = len(divisions)
+domain_type = [UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh]
+mesh = domain_type[d-1](*divisions)
+V = FunctionSpace(mesh, 'Lagrange', degree)
+
+# Define boundary conditions for initial guess
+tol = 1E-14
+def left_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]) < tol
+
+def right_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]-1) < tol
+
+Gamma_0 = DirichletBC(V, Constant(0.0), left_boundary)
+Gamma_1 = DirichletBC(V, Constant(1.0), right_boundary)
+bcs = [Gamma_0, Gamma_1]
+
+# Define variational problem for initial guess (q(u)=1, i.e., m=0)
+u = TrialFunction(V)
+v = TestFunction(V)
+a = inner(nabla_grad(u), nabla_grad(v))*dx
+f = Constant(0.0)
+L = f*v*dx
+u_k = Function(V)
+solve(a == L, u_k, bcs)
+
+# Note that all Dirichlet conditions must be zero for
+# the correction function in a Newton-type method
+Gamma_0_du = DirichletBC(V, Constant(0.0), left_boundary)
+Gamma_1_du = DirichletBC(V, Constant(0.0), right_boundary)
+bcs_du = [Gamma_0_du, Gamma_1_du]
+
+# Choice of nonlinear coefficient
+m = 2
+
+def q(u):
+    return (1+u)**m
+
+def Dq(u):
+    return m*(1+u)**(m-1)
+
+# Define variational problem for Newton iteration
+du = TrialFunction(V)  # u = u_k + omega*du
+a = inner(q(u_k)*nabla_grad(du), nabla_grad(v))*dx + \
+    inner(Dq(u_k)*du*nabla_grad(u_k), nabla_grad(v))*dx
+L = -inner(q(u_k)*nabla_grad(u_k), nabla_grad(v))*dx
+
+# Newton iteration at the PDE level
+du = Function(V)
+u  = Function(V)  # u = u_k + omega*du
+omega = 1.0       # relaxation parameter
+eps = 1.0
+tol = 1.0E-5
+iter = 0
+maxiter = 25
+# u_k must have right boundary conditions here
+while eps > tol and iter < maxiter:
+    iter += 1
+    print iter, 'iteration',
+    A, b = assemble_system(a, L, bcs_du)
+    solve(A, du.vector(), b)
+    diff = du.vector().array()
+    eps = numpy.linalg.norm(diff, ord=numpy.Inf)
+    print 'Norm:', eps
+    u.vector()[:] = u_k.vector() + omega*du.vector()
+    # or
+    #u.vector()[:] += omega*du.vector()
+    # or
+    #u.assign(u_k)  # u = u_k
+    #u.vector().axpy(omega, du.vector())
+    u_k.assign(u)
+
+
+convergence = 'convergence after %d Newton iterations at the PDE level' % iter
+if iter >= maxiter:
+    convergence = 'no ' + convergence
+
+print """
+Solution of the nonlinear Poisson problem div(q(u)*nabla_grad(u)) = f,
+with f=0, q(u) = (1+u)^m, u=0 at x=0 and u=1 at x=1.
+%s
+%s
+""" % (mesh, convergence)
+
+# Find max error
+u_exact = Expression('pow((pow(2, m+1)-1)*x[0] + 1, 1.0/(m+1)) - 1', m=m)
+u_e = interpolate(u_exact, V)
+diff = numpy.abs(u_e.vector().array() - u.vector().array()).max()
+print 'Max error:', diff
diff --git a/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/picard_np.py b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/picard_np.py
new file mode 100644
index 0000000..e895d5e
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/picard_np.py
@@ -0,0 +1,82 @@
+"""
+FEniCS tutorial demo program:
+Nonlinear Poisson equation with Dirichlet conditions
+in x-direction and homogeneous Neumann (symmetry) conditions
+in all other directions. The domain is the unit hypercube in
+of a given dimension.
+
+-div(q(u)*nabla_grad(u)) = 0,
+u = 0 at x=0, u=1 at x=1, du/dn=0 at all other boundaries.
+q(u) = (1+u)^m
+
+Solution method: Picard iteration (successive substitutions).
+"""
+
+from dolfin import *
+import numpy, sys
+
+# Create mesh and define function space
+degree = int(sys.argv[1])
+divisions = [int(arg) for arg in sys.argv[2:]]
+d = len(divisions)
+domain_type = [UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh]
+mesh = domain_type[d-1](*divisions)
+V = FunctionSpace(mesh, 'Lagrange', degree)
+
+# Define boundary conditions
+
+tol = 1E-14
+def left_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]) < tol
+
+def right_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]-1) < tol
+
+Gamma_0 = DirichletBC(V, Constant(0.0), left_boundary)
+Gamma_1 = DirichletBC(V, Constant(1.0), right_boundary)
+bcs = [Gamma_0, Gamma_1]
+
+# Choice of nonlinear coefficient
+m = 2
+
+def q(u):
+    return (1+u)**m
+
+# Define variational problem for Picard iteration
+u = TrialFunction(V)
+v = TestFunction(V)
+u_k = interpolate(Constant(0.0), V)  # previous (known) u
+a = inner(q(u_k)*nabla_grad(u), nabla_grad(v))*dx
+f = Constant(0.0)
+L = f*v*dx
+
+# Picard iterations
+u = Function(V)     # new unknown function
+eps = 1.0           # error measure ||u-u_k||
+tol = 1.0E-5        # tolerance
+iter = 0            # iteration counter
+maxiter = 25        # max no of iterations allowed
+while eps > tol and iter < maxiter:
+    iter += 1
+    solve(a == L, u, bcs)
+    diff = u.vector().array() - u_k.vector().array()
+    eps = numpy.linalg.norm(diff, ord=numpy.Inf)
+    print 'iter=%d: norm=%g' % (iter, eps)
+    u_k.assign(u)   # update for next iteration
+
+convergence = 'convergence after %d Picard iterations' % iter
+if iter >= maxiter:
+    convergence = 'no ' + convergence
+
+print """
+Solution of the nonlinear Poisson problem div(q(u)*nabla_grad(u)) = f,
+with f=0, q(u) = (1+u)^m, u=0 at x=0 and u=1 at x=1.
+%s
+%s
+""" % (mesh, convergence)
+
+# Find max error
+u_exact = Expression('pow((pow(2, m+1)-1)*x[0] + 1, 1.0/(m+1)) - 1', m=m)
+u_e = interpolate(u_exact, V)
+diff = numpy.abs(u_e.vector().array() - u.vector().array()).max()
+print 'Max error:', diff
diff --git a/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/vp1_np.py b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/vp1_np.py
new file mode 100644
index 0000000..6d67314
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/vp1_np.py
@@ -0,0 +1,105 @@
+"""
+FEniCS tutorial demo program:
+Nonlinear Poisson equation with Dirichlet conditions
+in x-direction and homogeneous Neumann (symmetry) conditions
+in all other directions. The domain is the unit hypercube in
+of a given dimension.
+
+-div(q(u)*nabla_grad(u)) = 0,
+u = 0 at x=0, u=1 at x=1, du/dn=0 at all other boundaries.
+q(u) = (1+u)^m
+
+Solution method: automatic, i.e., by a NonlinearVariationalProblem/Solver
+(Newton method).
+"""
+
+from dolfin import *
+import numpy, sys
+
+# Usage:   ./vp1_np.py m|a |g|l degree nx ny nz
+# Example: ./vp1_np.py m    l   1      3  4
+J_comp = sys.argv[1]  # m (manual) or a (automatic) computation of J
+answer = sys.argv[2]  # g (GMRES) or l (sparse LU) solver
+iterative_solver = True if answer == 'g' else False
+
+# Create mesh and define function space
+degree = int(sys.argv[3])
+divisions = [int(arg) for arg in sys.argv[4:]]
+d = len(divisions)
+domain_type = [UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh]
+mesh = domain_type[d-1](*divisions)
+V = FunctionSpace(mesh, 'Lagrange', degree)
+
+
+# Define boundary conditions
+tol = 1E-14
+def left_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]) < tol
+
+def right_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]-1) < tol
+
+Gamma_0 = DirichletBC(V, Constant(0.0), left_boundary)
+Gamma_1 = DirichletBC(V, Constant(1.0), right_boundary)
+bcs = [Gamma_0, Gamma_1]
+
+# Choice of nonlinear coefficient
+m = 2
+
+def q(u):
+    return (1+u)**m
+
+def Dq(u):
+    return m*(1+u)**(m-1)
+
+# Define variational problem
+v  = TestFunction(V)
+u  = TrialFunction(V)
+F  = inner(q(u)*nabla_grad(u), nabla_grad(v))*dx
+u_ = Function(V)  # most recently computed solution
+F  = action(F, u_)
+
+# J must be a Jacobian (Gateaux derivative in direction of du)
+if J_comp == 'm':
+    J = inner(q(u_)*nabla_grad(u), nabla_grad(v))*dx + \
+        inner(Dq(u_)*u*nabla_grad(u_), nabla_grad(v))*dx
+else:
+    J = derivative(F, u_, u)
+
+# Compute solution
+problem = NonlinearVariationalProblem(F, u_, bcs, J)
+solver  = NonlinearVariationalSolver(problem)
+prm = solver.parameters
+info(prm, True)
+prm['newton_solver']['absolute_tolerance'] = 1E-8
+prm['newton_solver']['relative_tolerance'] = 1E-7
+prm['newton_solver']['maximum_iterations'] = 25
+prm['newton_solver']['relaxation_parameter'] = 1.0
+if iterative_solver:
+    prec = 'jacobi' if 'jacobi' in zip(*krylov_solver_preconditioners())[0] else 'ilu'
+    prm['newton_solver']['linear_solver'] = 'gmres'
+    prm['newton_solver']['preconditioner'] = prec
+    prm['newton_solver']['krylov_solver']['absolute_tolerance'] = 1E-9
+    prm['newton_solver']['krylov_solver']['relative_tolerance'] = 1E-7
+    prm['newton_solver']['krylov_solver']['maximum_iterations'] = 1000
+    prm['newton_solver']['krylov_solver']['monitor_convergence'] = True
+    prm['newton_solver']['krylov_solver']['nonzero_initial_guess'] = False
+    prm['newton_solver']['krylov_solver']['gmres']['restart'] = 40
+    prm['newton_solver']['krylov_solver']['preconditioner']['structure'] = 'same_nonzero_pattern'
+    prm['newton_solver']['krylov_solver']['preconditioner']['ilu']['fill_level'] = 0
+PROGRESS = 16
+set_log_level(PROGRESS)
+solver.solve()
+
+print """
+Solution of the nonlinear Poisson problem div(q(u)*nabla_grad(u)) = f,
+with f=0, q(u) = (1+u)^m, u=0 at x=0 and u=1 at x=1.
+%s
+""" % mesh
+
+# Find max error
+u_exact = Expression('pow((pow(2, m+1)-1)*x[0] + 1, 1.0/(m+1)) - 1', m=m)
+u_e = interpolate(u_exact, V)
+import numpy
+diff = numpy.abs(u_e.vector().array() - u_.vector().array()).max()
+print 'Max error:', diff
diff --git a/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/vp2_np.py b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/vp2_np.py
new file mode 100644
index 0000000..dfe241f
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/nonlinear_poisson/vp2_np.py
@@ -0,0 +1,114 @@
+"""
+FEniCS tutorial demo program:
+Nonlinear Poisson equation with Dirichlet conditions
+in x-direction and homogeneous Neumann (symmetry) conditions
+in all other directions. The domain is the unit hypercube in
+of a given dimension.
+
+-div(q(u)*nabla_grad(u)) = 0,
+u = 0 at x=0, u=1 at x=1, du/dn=0 at all other boundaries.
+q(u) = (1+u)^m
+
+Solution method: automatic, i.e., by a NonlinearVariationalProblem/Solver
+(Newton method), with automatic UFL computation of the derivative.
+"""
+from dolfin import *
+import numpy, sys
+
+# Usage:   ./vp2_np.py m|a |g|l degree nx ny nz
+# Example: ./vp2_np.py m    l   1      3  4
+J_comp = sys.argv[1]  # m (manual) or a (automatic) computation of J
+answer = sys.argv[2]  # g (GMRES) or l (sparse LU) solver
+iterative_solver = True if answer == 'g' else False
+
+# Create mesh and define function space
+degree = int(sys.argv[3])
+divisions = [int(arg) for arg in sys.argv[4:]]
+d = len(divisions)
+domain_type = [UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh]
+mesh = domain_type[d-1](*divisions)
+V = FunctionSpace(mesh, 'Lagrange', degree)
+
+
+# Define boundary conditions
+tol = 1E-14
+def left_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]) < tol
+
+def right_boundary(x, on_boundary):
+    return on_boundary and abs(x[0]-1) < tol
+
+Gamma_0 = DirichletBC(V, Constant(0.0), left_boundary)
+Gamma_1 = DirichletBC(V, Constant(1.0), right_boundary)
+bcs = [Gamma_0, Gamma_1]
+
+# Choice of nonlinear coefficient
+m = 2
+
+def q(u):
+    return (1+u)**m
+
+def Dq(u):
+    return m*(1+u)**(m-1)
+
+# Define variational problem
+v  = TestFunction(V)
+du = TrialFunction(V)
+u_ = Function(V)  # most recently computed solution
+F  = inner(q(u_)*nabla_grad(u_), nabla_grad(v))*dx
+
+# J must be a Jacobian (Gateaux derivative in direction of du)
+if J_comp == 'm':
+    J = inner(q(u_)*nabla_grad(du), nabla_grad(v))*dx + \
+        inner(Dq(u_)*du*nabla_grad(u_), nabla_grad(v))*dx
+else:
+    J = derivative(F, u_, du)
+
+# Compute solution
+problem = NonlinearVariationalProblem(F, u_, bcs, J)
+solver  = NonlinearVariationalSolver(problem)
+
+prm = solver.parameters
+#info(prm, True)
+prm['newton_solver']['absolute_tolerance'] = 1E-8
+prm['newton_solver']['relative_tolerance'] = 1E-7
+prm['newton_solver']['maximum_iterations'] = 25
+prm['newton_solver']['relaxation_parameter'] = 1.0
+if iterative_solver:
+    prec = 'jacobi' if 'jacobi' in zip(*krylov_solver_preconditioners())[0] else 'ilu'
+    prm['newton_solver']['linear_solver'] = 'gmres'
+    prm['newton_solver']['preconditioner'] = prec
+    prm['newton_solver']['krylov_solver']['absolute_tolerance'] = 1E-9
+    prm['newton_solver']['krylov_solver']['relative_tolerance'] = 1E-7
+    prm['newton_solver']['krylov_solver']['maximum_iterations'] = 1000
+    prm['newton_solver']['krylov_solver']['monitor_convergence'] = True
+    prm['newton_solver']['krylov_solver']['nonzero_initial_guess'] = False
+    prm['newton_solver']['krylov_solver']['gmres']['restart'] = 40
+    prm['newton_solver']['krylov_solver']['preconditioner']['structure'] = 'same_nonzero_pattern'
+    prm['newton_solver']['krylov_solver']['preconditioner']['ilu']['fill_level'] = 0
+PROGRESS = 16
+set_log_level(PROGRESS)
+
+solver.solve()
+
+print """
+Solution of the nonlinear Poisson problem div(q(u)*nabla_grad(u)) = f,
+with f=0, q(u) = (1+u)^m, u=0 at x=0 and u=1 at x=1.
+%s
+""" % mesh
+
+# Find max error
+u_exact = Expression('pow((pow(2, m+1)-1)*x[0] + 1, 1.0/(m+1)) - 1', m=m)
+u_e = interpolate(u_exact, V)
+import numpy
+diff = numpy.abs(u_e.vector().array() - u_.vector().array()).max()
+print 'Max error:', diff
+
+
+
+# Define variational problem
+#v  = TestFunction(V)
+#du = TrialFunction(V)
+#u = Function(V)  # the unknown
+#F = inner(q(u)*nabla_grad(u), nabla_grad(v))*dx
+#J = derivative(F, u, du)
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/d1_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/d1_p2D.py
new file mode 100644
index 0000000..33be9d8
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/d1_p2D.py
@@ -0,0 +1,45 @@
+"""
+FEniCS tutorial demo program: Poisson equation with Dirichlet conditions.
+Simplest example of computation and visualization with FEniCS.
+
+-Laplace(u) = f on the unit square.
+u = u0 on the boundary.
+u0 = u = 1 + x^2 + 2y^2, f = -6.
+"""
+
+from dolfin import *
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(6, 4)
+#mesh = UnitCube(6, 4, 5)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary conditions
+u0 = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+def u0_boundary(x, on_boundary):
+    return on_boundary
+
+bc = DirichletBC(V, u0, u0_boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+a = inner(nabla_grad(u), nabla_grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Plot solution and mesh
+#plot(u)
+#plot(mesh)
+
+# Dump solution to file in VTK format
+file = File('poisson.pvd')
+file << u
+
+# Hold plot
+interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/d2_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/d2_p2D.py
new file mode 100644
index 0000000..be89753
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/d2_p2D.py
@@ -0,0 +1,61 @@
+"""
+FEniCS tutorial demo program: Poisson equation with Dirichlet conditions.
+As d1_p2D.py, but chosing linear solver and preconditioner is demonstrated.
+
+-Laplace(u) = f on the unit square.
+u = u0 on the boundary.
+u0 = u = 1 + x^2 + 2y^2, f = -6.
+"""
+
+from dolfin import *
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(60, 40)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary conditions
+u0 = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+def u0_boundary(x, on_boundary):
+    return on_boundary
+
+bc = DirichletBC(V, u0, u0_boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+a = inner(nabla_grad(u), nabla_grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+info(parameters, True)
+
+prm = parameters['krylov_solver'] # short form
+prm['absolute_tolerance'] = 1E-5
+prm['relative_tolerance'] = 1E-3
+prm['maximum_iterations'] = 1000
+#prm['preconditioner']['ilu']['fill_level'] = 0
+print parameters['linear_algebra_backend']
+#set_log_level(PROGRESS)
+set_log_level(DEBUG)
+
+solve(a == L, u, bc,
+      solver_parameters={'linear_solver': 'cg',
+                         'preconditioner': 'ilu'})
+# Alternative syntax
+solve(a == L, u, bc,
+      solver_parameters=dict(linear_solver='cg',
+                             preconditioner='ilu'))
+
+# Plot solution and mesh
+#plot(u)
+#plot(mesh)
+
+# Dump solution to file in VTK format
+file = File('poisson.pvd')
+file << u
+
+# Hold plot
+interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/d3_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/d3_p2D.py
new file mode 100644
index 0000000..5fa499f
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/d3_p2D.py
@@ -0,0 +1,61 @@
+"""
+FEniCS tutorial demo program: Poisson equation with Dirichlet conditions.
+As d2_p2D.py, but LinearVariationalProblem and LinearVariationalSolver
+are used instead of the solve(a == L, u, bc) call in d2_p2D.py.
+
+-Laplace(u) = f on the unit square.
+u = u0 on the boundary.
+u0 = u = 1 + x^2 + 2y^2, f = -6.
+"""
+
+from dolfin import *
+
+# Create mesh and define function space
+#mesh = UnitSquareMesh(600, 400)
+mesh = UnitSquareMesh(60, 40)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary conditions
+u0 = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+def u0_boundary(x, on_boundary):
+    return on_boundary
+
+bc = DirichletBC(V, u0, u0_boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+a = inner(nabla_grad(u), nabla_grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+problem = LinearVariationalProblem(a, L, u, bc)
+solver = LinearVariationalSolver(problem)
+solver.parameters['linear_solver'] = 'cg'
+solver.parameters['preconditioner'] = 'ilu'
+info(solver.parameters, True)
+
+print parameters['linear_algebra_backend']
+cg_prm = solver.parameters['krylov_solver'] # short form
+cg_prm['absolute_tolerance'] = 1E-7
+cg_prm['relative_tolerance'] = 1E-4
+cg_prm['maximum_iterations'] = 10000
+#cg_prm['preconditioner']['ilu']['fill_level'] = 0
+
+set_log_level(DEBUG)
+solver.solve()
+
+
+# Plot solution and mesh
+#plot(u)
+#plot(mesh)
+
+# Dump solution to file in VTK format
+file = File('poisson.pvd')
+file << u
+
+# Hold plot
+interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/d4_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/d4_p2D.py
new file mode 100644
index 0000000..f7aa188
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/d4_p2D.py
@@ -0,0 +1,82 @@
+"""
+FEniCS tutorial demo program: Poisson equation with Dirichlet conditions.
+As d1_p2D.py, but the solution is checked to coincide with the exact solution
+at all nodes.
+
+-Laplace(u) = f on the unit square.
+u = u0 on the boundary.
+u0 = u = 1 + x^2 + 2y^2, f = -6.
+"""
+
+from dolfin import *
+import numpy
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(3, 3)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary conditions
+u0 = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+def u0_boundary(x, on_boundary):
+    return on_boundary
+
+bc = DirichletBC(V, u0, u0_boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+a = inner(nabla_grad(u), nabla_grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+#plot(u)
+
+print """
+Solution of the Poisson problem -Laplace(u) = f,
+with u = u0 on the boundary and a
+%s
+""" % str(mesh)
+
+# Dump solution to the screen
+u_nodal_values = u.vector()
+u_array = u_nodal_values.array()
+coor = mesh.coordinates()
+if coor.shape[0] == u_array.shape[0]:  # degree 1 element
+    for i in range(len(u_array)):
+        print 'u(%8g,%8g) = %g' % (coor[i][0], coor[i][1], u_array[i])
+else:
+    print """\
+Cannot print vertex coordinates and corresponding values
+because the element is not a first-order Lagrange element.
+"""
+
+# Note: u_nodal_values.array() returns a copy
+print id(u_nodal_values.array()), id(u_array)
+
+# Verification
+u_e = interpolate(u0, V)
+u_e_array = u_e.vector().array()
+print 'Max error:', numpy.abs(u_e_array - u_array).max()
+
+# Compare numerical and exact solution
+center = (0.5, 0.5)
+u_value = u(center)
+u0_value = u0(center)
+print 'numerical u at the center point:', u_value
+print 'exact     u at the center point:', u0_value
+
+# Normalize solution such that max(u) = 1:
+max_u = u_array.max()
+u_array /= max_u
+#u.vector().set_local(u_array)
+u.vector()[:] = u_array
+#u.vector().set_local(u_array)  # safer for parallel computing
+print '\nNormalized solution:\n', u.vector().array()
+
+# interactive() always be at the end
+#interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/d5_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/d5_p2D.py
new file mode 100644
index 0000000..43d6b1c
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/d5_p2D.py
@@ -0,0 +1,111 @@
+"""
+FEniCS tutorial demo program: Poisson equation with Dirichlet conditions.
+As d4_p2D.py, but with computations and visualizations of grad(u).
+
+-Laplace(u) = f on the unit square.
+u = u0 on the boundary.
+u0 = u = 1 + x^2 + 2y^2, f = -6.
+"""
+
+from dolfin import *
+import numpy
+
+# Create mesh and define function space
+#mesh = UnitSquareMesh(8, 8)
+mesh = UnitSquareMesh(2, 2)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+
+# Define boundary conditions
+u0 = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+def u0_boundary(x, on_boundary):
+    return on_boundary
+
+bc = DirichletBC(V, u0, u0_boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+u.rename('u', 'solution field')
+
+# Compute gradient
+V_g = VectorFunctionSpace(mesh, 'Lagrange', 1)
+v = TestFunction(V_g)
+w = TrialFunction(V_g)
+
+a = inner(w, v)*dx
+L = inner(grad(u), v)*dx
+grad_u = Function(V_g)
+solve(a == L, grad_u)
+grad_u.rename('grad(u)', 'continuous gradient field')
+
+#plot(u, title=u.name())
+#plot(grad_u, title=grad_u.name())
+
+grad_u_x, grad_u_y = grad_u.split(deepcopy=True)  # extract components
+grad_u_x.rename('grad(u)_x', 'x-component of grad(u)')
+grad_u_y.rename('grad(u)_y', 'y-component of grad(u)')
+#plot(grad_u_x, title=grad_u_x.label())
+#plot(grad_u_y, title=grad_u_y.label())
+
+# Quick summary print of key variables
+print mesh
+print u
+print grad_u
+print grad_u_x
+print grad_u_y
+
+# Alternative computation of grad(u)
+grad_u2 = project(grad(u), VectorFunctionSpace(mesh, 'Lagrange', 1))
+
+# Dump solution and grad(u) to the screen with errors
+# (in case of linear Lagrange elements only)
+u_array = u.vector().array()
+if mesh.num_cells() < 160 and u_array.size == mesh.num_vertices():
+    grad_u_x_array = grad_u_x.vector().array()
+    grad_u_y_array = grad_u_y.vector().array()
+    coor = mesh.coordinates()
+    for i in range(len(u_array)):
+        x, y = coor[i]
+        print 'Node (%.3f,%.3f): u = %.4f (%9.2e), '\
+              'grad(u)_x = %.4f  (%9.2e), grad(u)_y = %.4f  (%9.2e)' % \
+              (x, y, u_array[i], 1 + x**2 + 2*y**2 - u_array[i],
+               grad_u_x_array[i], 2*x - grad_u_x_array[i],
+               grad_u_y_array[i], 4*y - grad_u_y_array[i])
+
+grad_u_array = grad_u.vector().array()
+print 'grad_u array:', grad_u_array, len(grad_u_array), grad_u_array.shape
+
+# Verification
+u_e = interpolate(u0, V)
+u_e_array = u_e.vector().array()
+print 'Max error:', numpy.abs(u_e_array - u_array).max()
+
+# Compare numerical and exact solution
+center = (0.5, 0.5)
+print 'numerical u at the center point:', u(center)
+print 'exact     u at the center point:', u0(center)
+
+# Normalize solution such that max(u) = 1:
+max_u = u_array.max()
+u_array /= max_u
+#u.vector().set_local(u_array)
+u.vector()[:] = u_array
+#u.vector().set_local(u_array)  # safer for parallel computing
+print '\nNormalized solution:\n', u.vector().array()
+
+file = File('poisson.pvd')
+file << u
+file << grad_u
+file << grad_u_x
+file << grad_u_y
+
+# Should be at the end
+interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/d6_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/d6_p2D.py
new file mode 100644
index 0000000..ddc6299
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/d6_p2D.py
@@ -0,0 +1,125 @@
+"""
+FEniCS tutorial demo program: Poisson equation with Dirichlet conditions.
+As d5_p2D.py, but with a more complicated solution, error computations
+and convergence studies.
+"""
+
+from dolfin import *
+import sys
+
+def compute(nx, ny, degree):
+    # Create mesh and define function space
+    mesh = UnitSquareMesh(nx, ny)
+    V = FunctionSpace(mesh, 'Lagrange', degree=degree)
+
+    # Define boundary conditions
+
+    def u0_boundary(x, on_boundary):
+        return on_boundary
+
+    bc = DirichletBC(V, Constant(0.0), u0_boundary)
+
+    # Exact solution
+    omega = 1.0
+    u_e = Expression('sin(omega*pi*x[0])*sin(omega*pi*x[1])',
+                     omega=omega)
+
+    # Define variational problem
+    u = TrialFunction(V)
+    v = TestFunction(V)
+    #f = Function(V,
+    #    '2*pow(pi,2)*pow(omega,2)*sin(omega*pi*x[0])*sin(omega*pi*x[1])',
+    #    {'omega': omega})
+    f = 2*pi**2*omega**2*u_e
+    a = inner(nabla_grad(u), nabla_grad(v))*dx
+    L = f*v*dx
+
+    # Compute solution
+    u = Function(V)
+    problem = LinearVariationalProblem(a, L, u, bc)
+    solver =  LinearVariationalSolver(problem)
+    solver.solve()
+    #plot(u, title='Numerical')
+
+    # Compute gradient
+    #gradu = project(grad(u), VectorFunctionSpace(mesh, 'Lagrange', degree))
+
+    # Compute error norm
+
+    # Function - Expression
+    error = (u - u_e)**2*dx
+    E1 = sqrt(assemble(error))
+
+    # Explicit interpolation of u_e onto the same space as u:
+    u_e_V = interpolate(u_e, V)
+    error = (u - u_e_V)**2*dx
+    E2 = sqrt(assemble(error))
+
+    # Explicit interpolation of u_e to higher-order elements,
+    # u will also be interpolated to the space Ve before integration
+    Ve = FunctionSpace(mesh, 'Lagrange', degree=5)
+    u_e_Ve = interpolate(u_e, Ve)
+    error = (u - u_e_Ve)**2*dx
+    E3 = sqrt(assemble(error))
+
+    # errornorm interpolates u and u_e to a space with
+    # given degree, and creates the error field by subtracting
+    # the degrees of freedom, then the error field is integrated
+    # TEMPORARY BUG - doesn't accept Expression for u_e
+    #E4 = errornorm(u_e, u, normtype='l2', degree=3)
+    # Manual implementation
+    def errornorm(u_e, u, Ve):
+        u_Ve = interpolate(u, Ve)
+        u_e_Ve = interpolate(u_e, Ve)
+        e_Ve = Function(Ve)
+        # Subtract degrees of freedom for the error field
+        e_Ve.vector()[:] = u_e_Ve.vector().array() - u_Ve.vector().array()
+        # More efficient computation (avoids the rhs array result above)
+        #e_Ve.assign(u_e_Ve)                      # e_Ve = u_e_Ve
+        #e_Ve.vector().axpy(-1.0, u_Ve.vector())  # e_Ve += -1.0*u_Ve
+        error = e_Ve**2*dx
+        return sqrt(assemble(error, mesh=Ve.mesh())), e_Ve
+    E4, e_Ve = errornorm(u_e, u, Ve)
+
+    # Infinity norm based on nodal values
+    u_e_V = interpolate(u_e, V)
+    E5 = abs(u_e_V.vector().array() - u.vector().array()).max()
+    print 'E2:', E2
+    print 'E3:', E3
+    print 'E4:', E4
+    print 'E5:', E5
+
+    # H1 seminorm
+    error = inner(grad(e_Ve), grad(e_Ve))*dx
+    E6 = sqrt(assemble(error))
+
+    # Collect error measures in a dictionary with self-explanatory keys
+    errors = {'u - u_e': E1,
+              'u - interpolate(u_e,V)': E2,
+              'interpolate(u,Ve) - interpolate(u_e,Ve)': E3,
+              'error field': E4,
+              'infinity norm (of dofs)': E5,
+              'grad(error field)': E6}
+
+    return errors
+
+# Perform experiments
+degree = int(sys.argv[1])
+h = []  # element sizes
+E = []  # errors
+# Changed this line so unit tests run faster
+for nx in [4, 8, 16]:
+#for nx in [4, 8, 16, 32, 64, 128, 264]:
+    h.append(1.0/nx)
+    E.append(compute(nx, nx, degree))  # list of dicts
+
+# Convergence rates
+from math import log as ln  # log is a dolfin name too
+error_types = E[0].keys()
+for error_type in sorted(error_types):
+    print '\nError norm based on', error_type
+    for i in range(1, len(E)):
+        Ei   = E[i][error_type]  # E is a list of dicts
+        Eim1 = E[i-1][error_type]
+        r = ln(Ei/Eim1)/ln(h[i]/h[i-1])
+        print 'h=%8.2E E=%8.2E r=%.2f' % (h[i], Ei, r)
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/dn1_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/dn1_p2D.py
new file mode 100644
index 0000000..ba0322f
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/dn1_p2D.py
@@ -0,0 +1,69 @@
+"""
+FEniCS tutorial demo program:
+Poisson equation with Dirichlet and Neumann conditions.
+The solution is checked to coincide with the exact solution at all nodes.
+
+-Laplace(u) = f on the unit square.
+u = u0 on x=0 and x=1.
+-du/dn = g on y=0 and y=1.
+u0 = u = 1 + x^2 + 2y^2, f = -6, g = -4y.
+"""
+
+from dolfin import *
+import numpy
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(3, 2)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define Dirichlet boundary conditions
+u0 = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and \
+               (abs(x[0]) < tol or abs(x[0] - 1) < tol)
+
+u0_boundary = DirichletBoundary()
+bc = DirichletBC(V, u0, u0_boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+g = Expression('-4*x[1]')
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx - g*v*ds
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+#plot(u)
+
+print """
+Solution of the Poisson problem -Laplace(u) = f,
+with u = u0 on x=0,1 and -du/dn = g at y=0,1.
+%s
+""" % mesh
+
+# Dump solution to the screen
+u_nodal_values = u.vector()
+u_array = u_nodal_values.array()
+coor = mesh.coordinates()
+for i in range(len(u_array)):
+    print 'u(%8g,%8g) = %g' % (coor[i][0], coor[i][1], u_array[i])
+
+
+# Verification
+u_e = interpolate(u0, V)
+u_e_array = u_e.vector().array()
+print 'Max error:', numpy.abs(u_e_array - u_array).max()
+
+# Compare numerical and exact solution
+center = (0.5, 0.5)
+print 'numerical u at the center point:', u(center)
+print 'exact     u at the center point:', u0(center)
+
+#interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/dn2_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/dn2_p2D.py
new file mode 100644
index 0000000..fdd32b4
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/dn2_p2D.py
@@ -0,0 +1,87 @@
+"""
+FEniCS tutorial demo program:
+Poisson equation with Dirichlet and Neumann conditions.
+As dn1_p2D.py, but the Dirichlet boundary is split into two
+parts (separate objects) with different Expression objects
+to set the conditions.
+
+-Laplace(u) = f on the unit square.
+u = 1 + 2y^2 on x=0.
+u = 2 + 2y^2 on x=1.
+-du/dn = g on y=0 and y=1.
+u = 1 + x^2 + 2y^2, f = -6, g = -4y.
+"""
+
+from dolfin import *
+import numpy
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(3, 2)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define Dirichlet conditions for x=0 boundary
+
+u_L = Expression('1 + 2*x[1]*x[1]')
+
+class LeftBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0]) < tol
+
+Gamma_0 = DirichletBC(V, u_L, LeftBoundary())
+
+# Define Dirichlet conditions for x=1 boundary
+
+u_R = Expression('2 + 2*x[1]*x[1]')
+
+class RightBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0] - 1) < tol
+
+Gamma_1 = DirichletBC(V, u_R, RightBoundary())
+
+bcs = [Gamma_0, Gamma_1]
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+g = Expression('-4*x[1]')
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx - g*v*ds
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bcs)
+
+#plot(u)
+
+print """
+Solution of the Poisson problem -Laplace(u) = f,
+with u = u0 on x=0,1 and -du/dn = g at y=0,1.
+%s
+""" % mesh
+
+# Dump solution to the screen
+u_nodal_values = u.vector()
+u_array = u_nodal_values.array()
+coor = mesh.coordinates()
+for i in range(len(u_array)):
+    print 'u(%8g,%8g) = %g' % (coor[i][0], coor[i][1], u_array[i])
+
+
+# Exact solution:
+u_exact = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+# Verification
+u_e = interpolate(u_exact, V)
+u_e_array = u_e.vector().array()
+print 'Max error:', numpy.abs(u_e_array - u_array).max()
+
+# Compare numerical and exact solution
+center = (0.5, 0.5)
+print 'numerical u at the center point:', u(center)
+print 'exact     u at the center point:', u_exact(center)
+
+#interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/dn3_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/dn3_p2D.py
new file mode 100644
index 0000000..581164d
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/dn3_p2D.py
@@ -0,0 +1,111 @@
+"""
+FEniCS tutorial demo program:
+Poisson equation with Dirichlet and Neumann conditions.
+As dn2_p2D.py, but the linear system is explicitly formed and solved.
+
+-Laplace(u) = f on the unit square.
+u = 1 + 2y^2 on x=0.
+u = 2 + 2y^2 on x=1.
+-du/dn = g on y=0 and y=1.
+u = 1 + x^2 + 2y^2, f = -6, g = -4y.
+"""
+
+from dolfin import *
+import numpy
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(2, 1)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define Dirichlet conditions for x=0 boundary
+
+u_L = Expression('1 + 2*x[1]*x[1]')
+
+class LeftBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0]) < tol
+
+Gamma_0 = DirichletBC(V, u_L, LeftBoundary())
+
+# Define Dirichlet conditions for x=1 boundary
+
+u_R = Expression('2 + 2*x[1]*x[1]')
+
+class RightBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0] - 1) < tol
+
+Gamma_1 = DirichletBC(V, u_R, RightBoundary())
+
+bcs = [Gamma_0, Gamma_1]
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+g = Expression('-4*x[1]')
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx - g*v*ds
+
+# Assemble and solve linear system
+A = assemble(a)
+b = assemble(L)
+
+if mesh.num_cells() < 16:
+    print 'A = assemble(a); b = assemble(L)'
+    print 'A before incorporation of essential BC:\n', A.array()
+    print 'b before incorporation of essential BC:\n', b.array()
+
+for bc in bcs:
+    bc.apply(A, b)
+
+if mesh.num_cells() < 16:
+    print 'A after incorporation of essential BC:\n', A.array()
+    print 'b after incorporation of essential BC:\n', b.array()
+
+# Alternative creation of the linear system
+# (symmetric modification of boundary conditions)
+A, b = assemble_system(a, L, bcs)
+
+if mesh.num_cells() < 16:
+    print '\nA, b = assemble_system(a, L, bcs)'
+    print 'A after incorporation of essential BC:\n', A.array()
+    print 'b after incorporation of essential BC:\n', b.array()
+
+# Compute solution
+u = Function(V)
+U = u.vector()
+solve(A, U, b)
+
+#plot(u)
+
+print """
+Solution of the Poisson problem -Laplace(u) = f,
+with u = u0 on x=0,1 and -du/dn = g at y=0,1.
+%s
+""" % mesh
+
+# Dump solution to the screen
+u_nodal_values = u.vector()
+u_array = u_nodal_values.array()
+coor = mesh.coordinates()
+for i in range(len(u_array)):
+    print 'u(%8g,%8g) = %g' % (coor[i][0], coor[i][1], u_array[i])
+
+
+# Exact solution:
+u_exact = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+# Verification
+u_e = interpolate(u_exact, V)
+u_e_array = u_e.vector().array()
+print 'Max error:', numpy.abs(u_e_array - u_array).max()
+
+# Compare numerical and exact solution
+center = (0.5, 0.5)
+print 'numerical u at the center point:', u(center)
+print 'exact     u at the center point:', u_exact(center)
+
+#interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/dn4_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/dn4_p2D.py
new file mode 100644
index 0000000..84cfa70
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/dn4_p2D.py
@@ -0,0 +1,127 @@
+"""
+FEniCS tutorial demo program:
+Poisson equation with Dirichlet and Neumann conditions.
+As dn3_p2D.py, but use of KrylovSolver instead of solve
+(and control of stopping criterion).
+
+-Laplace(u) = f on the unit square.
+u = 1 + 2y^2 on x=0.
+u = 2 + 2y^2 on x=1.
+-du/dn = g on y=0 and y=1.
+u = 1 + x^2 + 2y^2, f = -6, g = -4y.
+"""
+
+from dolfin import *
+import numpy
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(40, 40)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define Dirichlet conditions for x=0 boundary
+
+u_L = Expression('1 + 2*x[1]*x[1]')
+
+class LeftBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0]) < tol
+
+Gamma_0 = DirichletBC(V, u_L, LeftBoundary())
+
+# Define Dirichlet conditions for x=1 boundary
+
+u_R = Expression('2 + 2*x[1]*x[1]')
+
+class RightBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0] - 1) < tol
+
+Gamma_1 = DirichletBC(V, u_R, RightBoundary())
+
+bcs = [Gamma_0, Gamma_1]
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+g = Expression('-4*x[1]')
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx - g*v*ds
+
+# Assemble and solve linear system
+A = assemble(a)
+b = assemble(L)
+
+if mesh.num_cells() < 16:
+    print 'A = assemble(a); b = assemble(L)'
+    print 'A before incorporation of essential BC:\n', A.array()
+    print 'b before incorporation of essential BC:\n', b.array()
+
+for bc in bcs:
+    bc.apply(A, b)
+
+if mesh.num_cells() < 16:
+    print 'A after incorporation of essential BC:\n', A.array()
+    print 'b after incorporation of essential BC:\n', b.array()
+
+# Alternative creation of the linear system
+# (symmetric modification of boundary conditions)
+A, b = assemble_system(a, L, bcs)
+
+if mesh.num_cells() < 16:
+    print '\nA, b = assemble_system(a, L, bcs)'
+    print 'A after incorporation of essential BC:\n', A.array()
+    print 'b after incorporation of essential BC:\n', b.array()
+
+# Compute solution
+prec = 'jacobi' if 'jacobi' in zip(*krylov_solver_preconditioners())[0] else 'ilu'
+solver = KrylovSolver('cg', prec)
+info(solver.parameters, True)
+solver.parameters['absolute_tolerance'] = 1E-7
+solver.parameters['relative_tolerance'] = 1E-4
+solver.parameters['maximum_iterations'] = 1000
+u = Function(V)
+U = u.vector()
+set_log_level(DEBUG)
+solver.solve(A, U, b)
+
+print '\nRandom start vector'
+import numpy
+n = u.vector().array().size
+U[:] = numpy.random.uniform(-1000, 1000, n)
+solver.parameters['nonzero_initial_guess'] = True
+solver.solve(A, U, b)
+
+#plot(u)
+
+print """
+Solution of the Poisson problem -Laplace(u) = f,
+with u = u0 on x=0,1 and -du/dn = g at y=0,1.
+%s
+""" % mesh
+
+# Dump solution to the screen
+u_nodal_values = u.vector()
+u_array = u_nodal_values.array()
+coor = mesh.coordinates()
+if mesh.num_cells() <= 30:
+    for i in range(len(u_array)):
+        print 'u(%8g,%8g) = %g' % (coor[i][0], coor[i][1], u_array[i])
+
+
+# Exact solution:
+u_exact = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+# Verification
+u_e = interpolate(u_exact, V)
+u_e_array = u_e.vector().array()
+print 'Max error:', numpy.abs(u_e_array - u_array).max()
+
+# Compare numerical and exact solution
+center = (0.5, 0.5)
+print 'numerical u at the center point:', u(center)
+print 'exact     u at the center point:', u_exact(center)
+
+#interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/dnr_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/dnr_p2D.py
new file mode 100644
index 0000000..86952b2
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/dnr_p2D.py
@@ -0,0 +1,97 @@
+"""
+FEniCS tutorial demo program: Poisson equation with Dirichlet,
+Neumann and Robin conditions.
+The solution is checked to coincide with the exact solution at all nodes.
+
+The file is a modification of dn2_p2D.py. Note that the boundary is now also
+split into two distinct parts (separate objects and integrations)
+and we have a Robin condition instead of a Neumann condition at y=0.
+"""
+
+from dolfin import *
+import numpy
+
+#-------------- Preprocessing step -----------------
+
+# Create mesh and define function space
+mesh = UnitSquareMesh(3, 2)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary segments for Neumann, Robin and Dirichlet conditions
+
+# Create mesh function over cell facets
+boundary_parts = MeshFunction("size_t", mesh, mesh.topology().dim()-1)
+
+# Mark lower boundary facets as subdomain 0
+class LowerRobinBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[1]) < tol
+
+Gamma_R = LowerRobinBoundary()
+Gamma_R.mark(boundary_parts, 0)
+q = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+p = Constant(100)  # arbitrary function can go here
+
+# Mark upper boundary facets as subdomain 1
+class UpperNeumannBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[1] - 1) < tol
+
+Gamma_N = UpperNeumannBoundary()
+Gamma_N.mark(boundary_parts, 1)
+g = Expression('-4*x[1]')
+
+# Mark left boundary as subdomain 2
+class LeftBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0]) < tol
+
+Gamma_0 = LeftBoundary()
+Gamma_0.mark(boundary_parts, 2)
+
+# Mark right boundary as subdomain 3
+class RightBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0] - 1) < tol
+
+Gamma_1 = RightBoundary()
+Gamma_1.mark(boundary_parts, 3)
+
+#-------------- Solution and problem definition step -----------------
+# given mesh and boundary_parts
+
+u_L = Expression('1 + 2*x[1]*x[1]')
+u_R = Expression('2 + 2*x[1]*x[1]')
+bcs = [DirichletBC(V, u_L, boundary_parts, 2),
+       DirichletBC(V, u_R, boundary_parts, 3)]
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-6.0)
+a = inner(nabla_grad(u), nabla_grad(v))*dx + p*u*v*ds(0)
+L = f*v*dx - g*v*ds(1) + p*q*v*ds(0)
+
+# Compute solution
+A = assemble(a, exterior_facet_domains=boundary_parts)
+b = assemble(L, exterior_facet_domains=boundary_parts)
+for condition in bcs: condition.apply(A, b)
+
+# Alternative is not yet supported
+#A, b = assemble_system(a, L, bc, exterior_facet_domains=boundary_parts)
+
+u = Function(V)
+solve(A, u.vector(), b, 'lu')
+
+print mesh
+
+# Verification
+u_exact = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+u_e = interpolate(u_exact, V)
+print 'Max error:', abs(u_e.vector().array() - u.vector().array()).max()
+
+#interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/mat2_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/mat2_p2D.py
new file mode 100644
index 0000000..0f7686d
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/mat2_p2D.py
@@ -0,0 +1,103 @@
+"""
+FEniCS tutorial demo: Poisson problem in 2D with 2 materials.
+"""
+
+from dolfin import *
+import sys, math, numpy
+
+nx = 4;  ny = 6
+mesh = UnitSquareMesh(nx, ny)
+
+# Define a MeshFunction over two subdomains
+subdomains = MeshFunction('size_t', mesh, 2)
+
+class Omega0(SubDomain):
+    def inside(self, x, on_boundary):
+        return True if x[1] <= 0.5 else False
+
+class Omega1(SubDomain):
+    def inside(self, x, on_boundary):
+        return True if x[1] >= 0.5 else False
+# note: it is essential to use <= and >= in the comparisons
+
+# Mark subdomains with numbers 0 and 1
+subdomain0 = Omega0()
+subdomain0.mark(subdomains, 0)
+subdomain1 = Omega1()
+subdomain1.mark(subdomains, 1)
+
+V0 = FunctionSpace(mesh, 'DG', 0)
+k = Function(V0)
+
+print 'mesh:', mesh
+print 'subdomains:', subdomains
+print 'k:', k
+
+# Loop over all cell numbers, find corresponding
+# subdomain number and fill cell value in k
+k_values = [1.5, 50]  # values of k in the two subdomains
+for cell_no in range(len(subdomains.array())):
+    subdomain_no = subdomains.array()[cell_no]
+    k.vector()[cell_no] = k_values[subdomain_no]
+
+# Much more efficient vectorized code
+# (subdomains.array() has elements of type uint32, which
+# must be transformed to plain int for numpy.choose to work)
+help = numpy.asarray(subdomains.array(), dtype=numpy.int32)
+k.vector()[:] = numpy.choose(help, k_values)
+
+print 'k degree of freedoms:', k.vector().array()
+
+#plot(subdomains, title='subdomains')
+
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define Dirichlet conditions for y=0 boundary
+
+tol = 1E-14   # tolerance for coordinate comparisons
+class BottomBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary and abs(x[1]) < tol
+
+Gamma_0 = DirichletBC(V, Constant(0), BottomBoundary())
+
+# Define Dirichlet conditions for y=1 boundary
+
+class TopBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary and abs(x[1] - 1) < tol
+
+Gamma_1 = DirichletBC(V, Constant(1), TopBoundary())
+
+bcs = [Gamma_0, Gamma_1]
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(0)
+a = k*inner(nabla_grad(u), nabla_grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bcs)
+
+# Compare numerical and exact solution
+u_e_expr = Expression('x[1] <= 0.5 ? 2*x[1]*k1/(k0+k1) : '\
+                      '((2*x[1]-1)*k0 + k1)/(k0+k1)',
+                      k0=k_values[0], k1=k_values[1])
+u_e = interpolate(u_e_expr, V)
+u_e_array = u_e.vector().array()
+u_nodal_values = u.vector()
+u_array = u_nodal_values.array()
+import numpy
+error = numpy.abs(u_e_array - u_array)
+print 'max error:', error.max()
+
+#coor = mesh.coordinates()
+#for i in range(len(u_array)):
+#    print 'u(%8g,%8g) = %g, error: %.4E' % \
+#        (coor[i][0], coor[i][1], u_array[i],
+#         u_exact(coor[i][1]) - u_array[i])
+
+#interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/mat2x_p2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/mat2x_p2D.py
new file mode 100644
index 0000000..2c2c98f
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/mat2x_p2D.py
@@ -0,0 +1,97 @@
+"""
+As mat2_p2D.py, but the boundary conditions are different.
+Here, u=0 on x=0 and u=1 on x=1, while du/dn=0 on y=0 and y=1.
+This yields a solution u(x,y)=x, regardless of the values of k.
+"""
+
+from dolfin import *
+import sys, math, numpy
+
+mesh = UnitSquareMesh(4, 6)
+
+# Define a MeshFunction over two subdomains
+subdomains = MeshFunction('size_t', mesh, 2)
+
+class Omega0(SubDomain):
+    def inside(self, x, on_boundary):
+        return True if x[1] <= 0.5 else False
+
+class Omega1(SubDomain):
+    def inside(self, x, on_boundary):
+        return True if x[1] >= 0.5 else False
+
+# Mark subdomains with numbers 0 and 1
+subdomain0 = Omega0()
+subdomain0.mark(subdomains, 0)
+subdomain1 = Omega1()
+subdomain1.mark(subdomains, 1)
+
+V0 = FunctionSpace(mesh, 'DG', 0)
+k = Function(V0)
+
+print 'mesh:', mesh
+print 'subdomains:', subdomains
+print 'k:', k
+
+# Loop over all cell numbers, find corresponding
+# subdomain number and fill cell value in k
+k_values = [1.5, 50]  # values of k in the two subdomains
+for cell_no in range(len(subdomains.array())):
+    subdomain_no = subdomains.array()[cell_no]
+    k.vector()[cell_no] = k_values[subdomain_no]
+
+# Much more efficient vectorized code
+# (subdomains.array() has elements of type uint32, which
+# must be transformed to plain int for numpy.choose to work)
+help = numpy.asarray(subdomains.array(), dtype=numpy.int32)
+k.vector()[:] = numpy.choose(help, k_values)
+
+print 'k degree of freedoms:', k.vector().array()
+
+#plot(subdomains, title='subdomains')
+
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define Dirichlet conditions for x=0 boundary
+
+u_L = Constant(0)
+
+class LeftBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0]) < tol
+
+Gamma_0 = DirichletBC(V, u_L, LeftBoundary())
+
+# Define Dirichlet conditions for x=1 boundary
+
+u_R = Constant(1)
+
+class RightBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        tol = 1E-14   # tolerance for coordinate comparisons
+        return on_boundary and abs(x[0] - 1) < tol
+
+Gamma_1 = DirichletBC(V, u_R, RightBoundary())
+
+bcs = [Gamma_0, Gamma_1]
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(0)
+a = k*inner(nabla_grad(u), nabla_grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bcs)
+
+# Dump solution to the screen
+u_nodal_values = u.vector()
+u_array = u_nodal_values.array()
+coor = mesh.coordinates()
+for i in range(len(u_array)):
+    print 'u(%8g,%8g) = %g' % (coor[i][0], coor[i][1], u_array[i])
+
+#interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/membrane1.py b/test/unit/book/python/chapter_1_files/stationary/poisson/membrane1.py
new file mode 100644
index 0000000..bc435b6
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/membrane1.py
@@ -0,0 +1,78 @@
+"""
+FEniCS program for the deflection w(x,y) of a membrane:
+-Laplace(w) = p = Gaussian function, in a unit circle,
+with w = 0 on the boundary.
+"""
+
+from dolfin import *
+import numpy
+
+if not has_cgal():
+    import sys
+    sys.exit(0)
+
+# Set pressure function:
+T = 10.0  # tension
+A = 1.0   # pressure amplitude
+R = 0.3   # radius of domain
+theta = 0.2
+x0 = 0.6*R*cos(theta)
+y0 = 0.6*R*sin(theta)
+sigma = 0.025
+#sigma = 50  # large value for verification
+n = 40   # approx no of elements in radial direction
+mesh = CircleMesh(Point(0.0, 0.0), 1.0, 1.0/n)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary condition w=0
+
+def boundary(x, on_boundary):
+    return on_boundary
+
+bc = DirichletBC(V, Constant(0.0), boundary)
+
+# Define variational problem
+w = TrialFunction(V)
+v = TestFunction(V)
+a = inner(nabla_grad(w), nabla_grad(v))*dx
+f = Expression('4*exp(-0.5*(pow((R*x[0] - x0)/sigma, 2)) '
+                     '-0.5*(pow((R*x[1] - y0)/sigma, 2)))',
+               R=R, x0=x0, y0=y0, sigma=sigma)
+L = f*v*dx
+
+# Compute solution
+w = Function(V)
+problem = LinearVariationalProblem(a, L, w, bc)
+solver  = LinearVariationalSolver(problem)
+solver.parameters['linear_solver'] = 'cg'
+solver.parameters['preconditioner'] = 'ilu'
+solver.solve()
+
+# Plot scaled solution, mesh and pressure
+#plot(mesh, title='Mesh over scaled domain')
+#plot(w, title='Scaled deflection')
+f = interpolate(f, V)
+#plot(f, title='Scaled pressure')
+
+# Find maximum real deflection
+max_w = w.vector().array().max()
+max_D = A*max_w/(8*pi*sigma*T)
+print 'Maximum real deflection is', max_D
+
+# Verification for "flat" pressure (large sigma)
+if sigma >= 50:
+    w_exact = Expression('1 - x[0]*x[0] - x[1]*x[1]')
+    w_e = interpolate(w_exact, V)
+    w_e_array = w_e.vector().array()
+    w_array = w.vector().array()
+    diff_array = numpy.abs(w_e_array - w_array)
+    print 'Verification of the solution, max difference is %.4E' % \
+          diff_array.max()
+
+    # Create finite element field over V and fill with error values
+    difference = Function(V)
+    difference.vector()[:] = diff_array
+    #plot(difference, title='Error field for sigma=%g' % sigma)
+
+# Should be at the end
+interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/membrane1v.py b/test/unit/book/python/chapter_1_files/stationary/poisson/membrane1v.py
new file mode 100644
index 0000000..91dad40
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/membrane1v.py
@@ -0,0 +1,80 @@
+"""As membrane1.py, but with more Viper visualization."""
+from dolfin import *
+
+if not has_cgal():
+    import sys
+    sys.exit(0)
+
+# Set pressure function:
+T = 10.0  # tension
+A = 1.0   # pressure amplitude
+R = 0.3   # radius of domain
+theta = 0.2
+x0 = 0.6*R*cos(theta)
+y0 = 0.6*R*sin(theta)
+sigma = 0.025
+#sigma = 50  # large value for verification
+n = 40   # approx no of elements in radial direction
+
+mesh = CircleMesh(Point(0.0, 0.0), 1.0, 1.0/n)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary condition w=0
+
+def boundary(x, on_boundary):
+    return on_boundary
+
+bc = DirichletBC(V, Constant(0.0), boundary)
+
+# Define variational problem
+w = TrialFunction(V)
+v = TestFunction(V)
+a = inner(nabla_grad(w), nabla_grad(v))*dx
+f = Expression('4*exp(-0.5*(pow((R*x[0] - x0)/sigma, 2)) '
+               '     - 0.5*(pow((R*x[1] - y0)/sigma, 2)))',
+               R=R, x0=x0, y0=y0, sigma=sigma)
+L = f*v*dx
+
+# Compute solution
+w = Function(V)
+problem = LinearVariationalProblem(a, L, w, bc)
+solver  = LinearVariationalSolver(problem)
+solver.parameters['linear_solver'] = 'cg'
+solver.parameters['preconditioner'] = 'ilu'
+solver.solve()
+
+# Find maximum real deflection
+max_w = w.vector().array().max()
+max_D = A*max_w/(8*pi*sigma*T)
+print 'Maximum real deflection is', max_D
+
+# Demonstrate some visualization
+
+# Cannot do plot(w) first and then grab viz object!
+import time
+viz_w = plot(w,
+             wireframe=False,
+             title='Scaled membrane deflection',
+             rescale=False,
+             axes=True,
+             )
+
+viz_w.elevate(-65) # tilt camera -65 degrees (latitude dir)
+viz_w.set_min_max(0, 0.5*max_w)
+viz_w.update(w)    # bring settings above into action
+viz_w.write_png('membrane_deflection.png')
+viz_w.write_ps('membrane_deflection', format='eps')
+
+f = interpolate(f, V)
+viz_f = plot(f, title='Scaled pressure')
+viz_f.elevate(-65)
+viz_f.update(f)
+viz_f.write_png('pressure.png')
+viz_f.write_ps('pressure', format='eps')
+
+viz_m = plot(mesh, title='Finite element mesh')
+
+#time.sleep(15)
+
+# Should be at the end
+interactive()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/paD.py b/test/unit/book/python/chapter_1_files/stationary/poisson/paD.py
new file mode 100644
index 0000000..b178426
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/paD.py
@@ -0,0 +1,53 @@
+"""
+FEniCS tutorial demo program: Poisson equation in anyD (1D, 2D, 3D)
+with Dirichlet and Neumann conditions.
+
+-Laplace(u) = 2 on the unit hypercube.
+u = 0 at x=0,
+u = 1 at x=1,
+du/dn = 0 at all other boundaries.
+Exact solution: u(x, ...) = x^2
+"""
+
+from dolfin import *
+import numpy, sys
+
+# Create mesh and define function space
+degree = int(sys.argv[1])
+divisions = [int(arg) for arg in sys.argv[2:]]
+d = len(divisions)
+domain_type = [UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh]
+mesh = domain_type[d-1](*divisions)
+V = FunctionSpace(mesh, 'Lagrange', degree)
+
+# Define Dirichlet conditions at two sides
+
+tol = 1E-14   # tolerance for coordinate comparisons
+def Dirichlet_boundary0(x, on_boundary):
+    return on_boundary and abs(x[0]) < tol
+
+def Dirichlet_boundary1(x, on_boundary):
+    return on_boundary and abs(x[0] - 1) < tol
+
+bc0 = DirichletBC(V, Constant(0), Dirichlet_boundary0)
+bc1 = DirichletBC(V, Constant(1), Dirichlet_boundary1)
+bcs = [bc0, bc1]
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(-2)
+a = inner(grad(u), grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bcs)
+
+print mesh
+
+# Verification
+u_exact = Expression('x[0]*x[0]')
+u_e = interpolate(u_exact, V)
+print 'Max error:', \
+      numpy.abs(u_e.vector().array() - u.vector().array()).max()
diff --git a/test/unit/book/python/chapter_1_files/stationary/poisson/vcp2D.py b/test/unit/book/python/chapter_1_files/stationary/poisson/vcp2D.py
new file mode 100644
index 0000000..f3378f4
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/stationary/poisson/vcp2D.py
@@ -0,0 +1,170 @@
+"""
+FEniCS tutorial demo program:
+The Poisson equation with a variable coefficient.
+
+-div(p*grad(u)) = f on the unit square.
+u = u0 on x=0,
+u0 = u = 1 + x^2 + 2y^2, p = x + y, f = -8x - 10y.
+"""
+
+from dolfin import *
+import numpy
+plot = lambda *args, **kwargs: None
+
+# Create mesh and define function space
+nx = 2
+ny = 3
+nx = 10
+ny = 10
+mesh = UnitSquareMesh(nx, ny)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary conditions
+u0 = Expression('1 + x[0]*x[0] + 2*x[1]*x[1]')
+
+class DirichletBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return on_boundary
+
+u0_boundary = DirichletBoundary()
+bc = DirichletBC(V, u0, u0_boundary)
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+p = Expression('x[0] + x[1]')
+f = Expression('-8*x[0] - 10*x[1]')
+a = p*inner(nabla_grad(u), nabla_grad(v))*dx
+L = f*v*dx
+
+# Compute solution
+u = Function(V)
+solve(a == L, u, bc)
+
+# Compute gradient
+V_g = VectorFunctionSpace(mesh, 'Lagrange', 1)
+v = TestFunction(V_g)
+w = TrialFunction(V_g)
+
+a = inner(w, v)*dx
+L = inner(-p*grad(u), v)*dx
+flux = Function(V_g)
+solve(a == L, flux)
+
+# Alternative
+flux = project(-p*grad(u), VectorFunctionSpace(mesh, 'Lagrange', 1))
+
+plot(u, title='u')
+plot(flux, title='flux field')
+
+flux_x, flux_y = flux.split(deepcopy=True)  # extract components
+plot(flux_x, title='x-component of flux (-p*grad(u))')
+plot(flux_y, title='y-component of flux (-p*grad(u))')
+plot(mesh)
+
+# Alternative computation of the flux
+flux2 = project(-p*grad(u), VectorFunctionSpace(mesh, 'Lagrange', 1))
+
+print mesh
+
+# Dump solution and flux to the screen with errors
+u_array = u.vector().array()
+flux_x_array = flux_x.vector().array()  # ok if deepcopy
+flux_y_array = flux_y.vector().array()
+# if not deepcopy of flux_x, flux_y:
+#q = flux.vector().array()
+#q.shape = (2, len(q)/2)
+#flux_x_array = q[0,:]
+#flux_y_array = q[1,:]
+if mesh.num_cells() < 1600:
+    coor = mesh.coordinates()
+    for i in range(len(u_array)):
+        x, y = coor[i]
+        print 'Node (%.3f,%.3f): u = %.4f (%9.2e), '\
+              'flux_x = %.4f  (%9.2e), flux_y = %.4f  (%9.2e)' % \
+              (x, y, u_array[i], 1 + x**2 + 2*y**2 - u_array[i],
+               flux_x_array[i], -(x+y)*2*x - flux_x_array[i],
+               flux_y_array[i], -(x+y)*4*y - flux_y_array[i])
+
+# Plot solution and flux
+import scitools.BoxField
+import scitools.easyviz as ev
+X = 0; Y = 1; Z = 2
+# Note: avoid * import from easyviz as DOLFIN and has already
+# defined plot, figure, mesh
+
+u2 = u if u.ufl_element().degree() == 1 else \
+     interpolate(u, FunctionSpace(mesh, 'Lagrange', 1))
+# alternatively: interpolate onto a finer mesh for higher degree elements
+u_box = scitools.BoxField.dolfin_function2BoxField(
+        u2, mesh, (nx,ny), uniform_mesh=True)
+
+# Write out u at mesh point (i,j)
+i = nx; j = ny
+print 'u(%g,%g)=%g' % (u_box.grid.coor[X][i],
+                       u_box.grid.coor[Y][j],
+                       u_box.values[i,j])
+ev.contour(u_box.grid.coorv[X], u_box.grid.coorv[Y], u_box.values,
+           14, savefig='tmp0.eps', title='Contour plot of u',
+           clabels='on')
+ev.figure()
+ev.surf(u_box.grid.coorv[X], u_box.grid.coorv[Y], u_box.values,
+        shading='interp', colorbar='on',
+        title='surf plot of u', savefig='tmp3.eps')
+ev.figure()
+ev.mesh(u_box.grid.coorv[X], u_box.grid.coorv[Y], u_box.values,
+        title='mesh plot of u', savefig='tmp4.eps')
+
+# Extract and plot u along the line y=0.5
+start = (0,0.5)
+x, uval, y_fixed, snapped = u_box.gridline(start, direction=X)
+if snapped:
+    print 'Line at %s adjusted (snapped) to y=%g' % (start, y_fixed)
+ev.figure()
+ev.plot(x, uval, 'r-', title='Solution',
+        legend='finite element solution')
+
+# Plot the numerical (projected) and exact flux along this line
+ev.figure()
+flux2_x = flux_x if flux_x.ufl_element().degree() == 1 else \
+          interpolate(flux_x, FunctionSpace(mesh, 'Lagrange', 1))
+flux_x_box = scitools.BoxField.dolfin_function2BoxField(
+        flux2_x, mesh, (nx,ny), uniform_mesh=True)
+x, fluxval, y_fixed, snapped = \
+        flux_x_box.gridline(start, direction=0)
+y = y_fixed
+flux_x_exact = -(x + y)*2*x
+ev.plot(x, fluxval, 'r-',
+        x, flux_x_exact, 'b-',
+        legend=('numerical (projected) flux', 'exact flux'),
+        title='Flux in x-direction (at y=%g)' % y_fixed,
+        savefig='tmp1.eps')
+
+
+# Plot flux along a line with many points also in the interior of
+# the elements
+# NOTE (FIXME): Strange artifacts at the end of the line!!!
+n = 101
+#n = 10
+x = numpy.linspace(0, 1, n)
+y = numpy.zeros(x.size) + 0.5  # y[i] = 0.5
+xy_coor = numpy.array([x, y]).transpose()
+#print 'xy_coor:', xy_coor
+flux_x_line = numpy.zeros(x.size)
+for i in range(len(flux_x_line)):
+    flux_x_line[i] = flux_x(xy_coor[i])
+flux_x_exact = -(x + y_fixed)*2*x
+ev.figure()
+ev.plot(x, flux_x_line, 'r-',
+        x, flux_x_exact, 'b-',
+        legend=('projected flux evaluated at %d points' % n, 'exact flux'),
+        title='Flux at y=%g' % y[0],
+        safefig='tmp2.eps')
+
+# Verification
+u_e = interpolate(u0, V)
+u_e_array = u_e.vector().array()
+print 'Max error:', numpy.abs(u_e_array - u_array).max()
+
+#interactive()
+raw_input('Press Return: ')  # some curve plot engines need this for a lasting plot on the screen
diff --git a/test/unit/book/python/chapter_1_files/transient/diffusion/d1_d2D.py b/test/unit/book/python/chapter_1_files/transient/diffusion/d1_d2D.py
new file mode 100644
index 0000000..705758c
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/transient/diffusion/d1_d2D.py
@@ -0,0 +1,59 @@
+"""
+FEniCS tutorial demo program: Diffusion equation with Dirichlet
+conditions and a solution that will be exact at all nodes.
+"""
+
+from dolfin import *
+import numpy
+
+# Create mesh and define function space
+nx = ny = 2
+mesh = UnitSquareMesh(nx, ny)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary conditions
+alpha = 3; beta = 1.2
+u0 = Expression('1 + x[0]*x[0] + alpha*x[1]*x[1] + beta*t',
+                alpha=alpha, beta=beta, t=0)
+
+class Boundary(SubDomain):  # define the Dirichlet boundary
+    def inside(self, x, on_boundary):
+        return on_boundary
+
+boundary = Boundary()
+bc = DirichletBC(V, u0, boundary)
+
+# Initial condition
+u_1 = interpolate(u0, V)
+#u_1 = project(u0, V)  # will not result in exact solution!
+
+dt = 0.3      # time step
+
+# Define variational problem
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(beta - 2 - 2*alpha)
+a = u*v*dx + dt*inner(nabla_grad(u), nabla_grad(v))*dx
+L = (u_1 + dt*f)*v*dx
+
+A = assemble(a)   # assemble only once, before the time stepping
+b = None          # necessary for memory saving assemeble call
+
+# Compute solution
+u = Function(V)   # the unknown at a new time level
+T = 1.9           # total simulation time
+t = dt
+while t <= T:
+    print 'time =', t
+    b = assemble(L, tensor=b)
+    u0.t = t
+    bc.apply(A, b)
+    solve(A, u.vector(), b)
+
+    # Verify
+    u_e = interpolate(u0, V)
+    maxdiff = numpy.abs(u_e.vector().array() - u.vector().array()).max()
+    print 'Max error, t=%.2f: %-10.3f' % (t, maxdiff)
+
+    t += dt
+    u_1.assign(u)
diff --git a/test/unit/book/python/chapter_1_files/transient/diffusion/d2_d2D.py b/test/unit/book/python/chapter_1_files/transient/diffusion/d2_d2D.py
new file mode 100644
index 0000000..e8ffd95
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/transient/diffusion/d2_d2D.py
@@ -0,0 +1,72 @@
+"""
+FEniCS tutorial demo program: Diffusion equation with Dirichlet
+conditions and a solution that will be exact at all nodes.
+As d1_d2D.py, but here we do all assembly prior to the time loop
+(for increased efficiency).
+"""
+
+from dolfin import *
+import numpy
+
+# Create mesh and define function space
+nx = ny = 2
+mesh = UnitSquareMesh(nx, ny)
+V = FunctionSpace(mesh, 'Lagrange', 1)
+
+# Define boundary conditions
+alpha = 3; beta = 1.2
+u0 = Expression('1 + x[0]*x[0] + alpha*x[1]*x[1] + beta*t',
+                alpha=alpha, beta=beta, t=0)
+
+class Boundary(SubDomain):  # define the Dirichlet boundary
+    def inside(self, x, on_boundary):
+        return on_boundary
+
+boundary = Boundary()
+bc = DirichletBC(V, u0, boundary)
+
+# Initial condition
+u_1 = interpolate(u0, V)
+#u_1 = project(u0, V)  # will not result in exact solution!
+
+T = 1.9       # total simulation time
+dt = 0.3      # time step
+
+# Define variational problem
+
+# Laplace term
+u = TrialFunction(V)
+v = TestFunction(V)
+a_K = inner(nabla_grad(u), nabla_grad(v))*dx
+
+# "Mass matrix" term
+a_M = u*v*dx
+
+M = assemble(a_M)
+K = assemble(a_K)
+A = M + dt*K
+
+# f term
+f = Expression('beta - 2 - 2*alpha', beta=beta, alpha=alpha)
+
+# Compute solution
+u = Function(V)
+t = dt
+while t <= T:
+    print 'time =', t
+    # f.t = t
+    f_k = interpolate(f, V)
+    F_k = f_k.vector()
+    b = M*u_1.vector() + dt*M*F_k
+    u0.t = t
+    bc.apply(A, b)
+    solve(A, u.vector(), b)
+
+    # Verify
+    u_e = interpolate(u0, V)
+    u_e_array = u_e.vector().array()
+    u_array = u.vector().array()
+    print 'Max error, t=%-10.3f:' % t, numpy.abs(u_e_array - u_array).max()
+
+    t += dt
+    u_1.assign(u)
diff --git a/test/unit/book/python/chapter_1_files/transient/diffusion/demo_sin_daD.sh b/test/unit/book/python/chapter_1_files/transient/diffusion/demo_sin_daD.sh
new file mode 100644
index 0000000..0b9297f
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/transient/diffusion/demo_sin_daD.sh
@@ -0,0 +1,12 @@
+#!/bin/sh
+
+# Clean up frames in movie
+rm -rf tmp_*.png  
+
+# Should have kappa_0=2.3 or 12.3 and kappa_1=kappa_0 or 1E+4
+# (physical values for the rest)
+python sin_daD.py   1   1.5  4  40
+
+# Make movie as an HTML file
+scitools movie output_file=movie.html fps=2 tmp_*.png
+echo "Run google-chrome movie.html"
diff --git a/test/unit/book/python/chapter_1_files/transient/diffusion/sin_daD.py b/test/unit/book/python/chapter_1_files/transient/diffusion/sin_daD.py
new file mode 100644
index 0000000..3b87c26
--- /dev/null
+++ b/test/unit/book/python/chapter_1_files/transient/diffusion/sin_daD.py
@@ -0,0 +1,197 @@
+"""Temperature variations in the ground."""
+
+from dolfin import *
+import sys, numpy, time
+
+# Usage:   sin_daD.py degree D   nx ny nz
+# Example: sin_daD.py   1   1.5  4  40
+
+# Create mesh and define function space
+degree = int(sys.argv[1])
+D = float(sys.argv[2])
+W = D/2.0
+divisions = [int(arg) for arg in sys.argv[3:]]
+print 'degree=%d, D=%g, W=%g, %s cells' % \
+      (degree, D, W, 'x'.join(sys.argv[3:]))
+
+d = len(divisions)  # no of space dimensions
+if d == 1:
+    mesh = Interval(divisions[0], -D, 0)
+elif d == 2:
+    mesh = RectangleMesh(-W/2, -D, W/2, 0, divisions[0], divisions[1])
+elif d == 3:
+    mesh = Box(-W/2, -W/2, -D, W/2, W/2, 0,
+               divisions[0], divisions[1], divisions[2])
+V = FunctionSpace(mesh, 'Lagrange', degree)
+
+# Define boundary conditions
+
+T_R = 0
+T_A = 1.0
+omega = 2*pi
+# soil:
+T_R = 10
+T_A = 10
+omega = 7.27E-5
+
+T_0 = Expression('T_R + T_A*sin(omega*t)',
+                 T_R=T_R, T_A=T_A, omega=omega, t=0.0)
+
+def surface(x, on_boundary):
+    return on_boundary and abs(x[d-1]) < 1E-14
+
+bc = DirichletBC(V, T_0, surface)
+
+period = 2*pi/omega
+t_stop = 5*period
+#t_stop = period/4
+dt = period/14
+theta = 1
+
+kappa_0 = 2.3  # KN/s (K=Kelvin, temp. unit), for soil
+kappa_0 = 12.3  # KN/s (K=Kelvin, temp. unit)
+kappa_1 = 1E+4
+kappa_1 = kappa_0
+
+kappa_str = {}
+kappa_str[1] = 'x[0] > -D/2 && x[0] < -D/2 + D/4 ? kappa_1 : kappa_0'
+kappa_str[2] = 'x[0] > -W/4 && x[0] < W/4 '\
+               '&& x[1] > -D/2 && x[1] < -D/2 + D/4 ? '\
+               'kappa_1 : kappa_0'
+kappa_str[3] = 'x[0] > -W/4 && x[0] < W/4 '\
+               'x[1] > -W/4 && x[1] < W/4 '\
+               '&& x[2] > -D/2 && x[2] < -D/2 + D/4 ?'\
+               'kappa_1 : kappa_0'
+
+# Alternative way of defining the kappa function
+class Kappa(Expression):
+    def eval(self, value, x):
+        """x: spatial point, value[0]: function value."""
+        d = len(x)  # no of space dimensions
+        material = 0  # 0: outside, 1: inside
+        if d == 1:
+            if -D/2. < x[d-1] < -D/2. + D/4.:
+                material = 1
+        elif d == 2:
+            if -D/2. < x[d-1] < -D/2. + D/4. and \
+               -W/4. < x[0] < W/4.:
+                material = 1
+        elif d == 3:
+            if -D/2. < x[d-1] < -D/2. + D/4. and \
+               -W/4. < x[0] < W/4. and -W/4. < x[1] < W/4.:
+                material = 1
+        value[0] = kappa_0 if material == 0 else kappa_1
+
+# Physical parameters
+kappa = Expression(kappa_str[d],
+                   D=D, W=W, kappa_0=kappa_0, kappa_1=kappa_1)
+#kappa = Kappa(V)
+
+# soil:
+rho = 1500
+c = 1600
+
+print 'Thermal diffusivity:', kappa_0/rho/c
+
+# Define initial condition
+T_1 = interpolate(Constant(T_R), V)
+
+# Define variational problem
+T = TrialFunction(V)
+v = TestFunction(V)
+f = Constant(0)
+a = rho*c*T*v*dx + theta*dt*kappa*\
+    inner(nabla_grad(v), nabla_grad(T))*dx
+L = (rho*c*T_1*v + dt*f*v -
+     (1-theta)*dt*kappa*inner(nabla_grad(v), nabla_grad(T)))*dx
+
+A = assemble(a)
+b = None  # variable used for memory savings in assemble calls
+
+# Compute solution
+T = Function(V)   # unknown at the new time level
+
+# hack for plotting (first surface must span all values (?))
+dummy = Expression('T_R - T_A/2.0 + 2*T_A*(x[%g]+D)' % (d-1),
+                   T_R=T_R, T_A=T_A, D=D)
+
+# Make all plot commands inctive
+import scitools.misc
+plot = scitools.misc.DoNothing(silent=True)
+# Need initial dummy plot
+viz = plot(dummy, axes=True,
+           title='Temperature', wireframe=False)
+viz.elevate(-65)
+#time.sleep(1)
+viz.update(T_1)
+
+import scitools.BoxField
+start_pt = [0]*d; start_pt[-1] = -D  # start pt for line plot
+import scitools.easyviz as ev
+
+def line_plot():
+    """Make a line plot of T along the vertical direction."""
+    if T.ufl_element().degree() != 1:
+        T2 = interpolate(T, FunctionSpace(mesh, 'Lagrange', 1))
+    else:
+        T2 = T
+    T_box = scitools.BoxField.dolfin_function2BoxField(
+            T2, mesh, divisions, uniform_mesh=True)
+    #T_box = scitools.BoxField.update_from_dolfin_array(
+    #        T.vector().array(), T_box)
+    coor, Tval, fixed, snapped = \
+            T_box.gridline(start_pt, direction=d-1)
+
+    # Use just one ev.plot command, not hold('on') and two ev.plot
+    # etc for smooth movie on the screen
+    if kappa_0 == kappa_1:  # analytical solution?
+        ev.plot(coor, Tval, 'r-',
+                coor, T_exact(coor), 'b-',
+                axis=[-D, 0, T_R-T_A, T_R+T_A],
+                xlabel='depth', ylabel='temperature',
+                legend=['numerical', 'exact, const kappa=%g' % kappa_0],
+                legend_loc='upper left',
+                title='t=%.4f' % t)
+    else:
+        ev.plot(coor, Tval, 'r-',
+                axis=[-D, 0, T_R-T_A, T_R+T_A],
+                xlabel='depth', ylabel='temperature',
+                title='t=%.4f' % t)
+
+    ev.savefig('tmp_%04d.png' % counter)
+    time.sleep(0.1)
+    
+def T_exact(x):
+    a = sqrt(omega*rho*c/(2*kappa_0))
+    return T_R + T_A*exp(a*x)*numpy.sin(omega*t + a*x)
+
+n = FacetNormal(mesh)  # for flux computation at the top boundary
+flux = -kappa*dot(nabla_grad(T), n)*ds
+
+t = dt
+counter = 0
+while t <= t_stop:
+    print 'time =', t
+    b = assemble(L, tensor=b)
+    T_0.t = t
+    help = interpolate(T_0, V)
+    print 'T_0:', help.vector().array()[0]
+    bc.apply(A, b)
+    solve(A, T.vector(), b)
+    viz.update(T)
+    #viz.write_ps('diff2_%04d' % counter)
+    line_plot()
+
+    total_flux = assemble(flux)
+    print 'Total flux:', total_flux
+    
+    t += dt
+    T_1.assign(T)
+    counter += 1
+
+viz = plot(T, title='Final solution')
+viz.elevate(-65)
+viz.azimuth(-40)
+viz.update(T)
+
+interactive()
diff --git a/test/unit/book/python/mesh.xml b/test/unit/book/python/mesh.xml
new file mode 100644
index 0000000..f19b7a1
--- /dev/null
+++ b/test/unit/book/python/mesh.xml
@@ -0,0 +1,26 @@
+<?xml version="1.0"?>
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <mesh celltype="triangle" dim="2">
+    <vertices size="9">
+      <vertex index="0" x="0.000000000000000e+00" y="0.000000000000000e+00" />
+      <vertex index="1" x="5.000000000000000e-01" y="0.000000000000000e+00" />
+      <vertex index="2" x="1.000000000000000e+00" y="0.000000000000000e+00" />
+      <vertex index="3" x="0.000000000000000e+00" y="5.000000000000000e-01" />
+      <vertex index="4" x="5.000000000000000e-01" y="5.000000000000000e-01" />
+      <vertex index="5" x="1.000000000000000e+00" y="5.000000000000000e-01" />
+      <vertex index="6" x="0.000000000000000e+00" y="1.000000000000000e+00" />
+      <vertex index="7" x="5.000000000000000e-01" y="1.000000000000000e+00" />
+      <vertex index="8" x="1.000000000000000e+00" y="1.000000000000000e+00" />
+    </vertices>
+    <cells size="8">
+      <triangle index="0" v0="0" v1="1" v2="4" />
+      <triangle index="1" v0="0" v1="3" v2="4" />
+      <triangle index="2" v0="1" v1="2" v2="5" />
+      <triangle index="3" v0="1" v1="4" v2="5" />
+      <triangle index="4" v0="3" v1="4" v2="7" />
+      <triangle index="5" v0="3" v1="6" v2="7" />
+      <triangle index="6" v0="4" v1="5" v2="8" />
+      <triangle index="7" v0="4" v1="7" v2="8" />
+    </cells>
+  </mesh>
+</dolfin>
diff --git a/test/unit/book/python/original_tests/README b/test/unit/book/python/original_tests/README
new file mode 100644
index 0000000..768798c
--- /dev/null
+++ b/test/unit/book/python/original_tests/README
@@ -0,0 +1,5 @@
+MD5 checksums for original book unit tests stored here to make sure
+they are not modified by ambitious developers...
+
+6a400ea13d4bbf6ee83d1b89e6e89dd4  chapter_1.py
+8c177f285453978ba68c728898796fad  chapter_10.py
diff --git a/test/unit/fem/python/Assembler.py b/test/unit/fem/python/Assembler.py
new file mode 100644
index 0000000..d3d3298
--- /dev/null
+++ b/test/unit/fem/python/Assembler.py
@@ -0,0 +1,679 @@
+"""Unit tests for assembly"""
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes 2011
+# Modified by Anders Logg 2011
+#
+# First added:  2011-03-12
+# Last changed: 2014-06-01
+
+import unittest
+import numpy
+from dolfin import *
+
+class Assembly(unittest.TestCase):
+
+    def test_cell_size_assembly_1D(self):
+        mesh = UnitIntervalMesh(10)
+        self.assertAlmostEqual(assemble(CellSize(mesh)*dx, mesh=mesh), 0.1, 12)
+        self.assertAlmostEqual(assemble(CellVolume(mesh)*dx, mesh=mesh), 0.1, 12)
+
+    def test_cell_assembly_1D(self):
+
+        mesh = UnitIntervalMesh(48)
+        V = FunctionSpace(mesh, "CG", 1)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        f = Constant(10.0)
+
+        a = inner(grad(v), grad(u))*dx
+        L = inner(v, f)*dx
+
+        A_frobenius_norm = 811.75365721381274397572
+        b_l2_norm = 1.43583841167606474087
+
+        # Assemble A and b
+        self.assertAlmostEqual(assemble(a).norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(assemble(L).norm("l2"), b_l2_norm, 10)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_cell_assembly_1D_multithreaded(self):
+
+        mesh = UnitIntervalMesh(48)
+        V = FunctionSpace(mesh, "CG", 1)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        f = Constant(10.0)
+
+        a = inner(grad(v), grad(u))*dx
+        L = inner(v, f)*dx
+
+        A_frobenius_norm = 811.75365721381274397572
+        b_l2_norm = 1.43583841167606474087
+
+        # Assemble A and b
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(a).norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(assemble(L).norm("l2"), b_l2_norm, 10)
+        parameters["num_threads"] = 0
+
+    def test_cell_assembly(self):
+
+        mesh = UnitCubeMesh(4, 4, 4)
+        V = VectorFunctionSpace(mesh, "DG", 1)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        f = Constant((10, 20, 30))
+
+        def epsilon(v):
+            return 0.5*(grad(v) + grad(v).T)
+
+        a = inner(epsilon(v), epsilon(u))*dx
+        L = inner(v, f)*dx
+
+        A_frobenius_norm =  4.3969686527582512
+        b_l2_norm = 0.95470326978246278
+
+        # Assemble A and b
+        self.assertAlmostEqual(assemble(a).norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(assemble(L).norm("l2"), b_l2_norm, 10)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_cell_assembly_multithreaded(self):
+
+        mesh = UnitCubeMesh(4, 4, 4)
+        V = VectorFunctionSpace(mesh, "DG", 1)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        f = Constant((10, 20, 30))
+
+        def epsilon(v):
+            return 0.5*(grad(v) + grad(v).T)
+
+        a = inner(epsilon(v), epsilon(u))*dx
+        L = inner(v, f)*dx
+
+        A_frobenius_norm =  4.3969686527582512
+        b_l2_norm = 0.95470326978246278
+
+        # Assemble A and b
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(a).norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(assemble(L).norm("l2"), b_l2_norm, 10)
+        parameters["num_threads"] = 0
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_facet_assembly(self):
+
+        mesh = UnitSquareMesh(24, 24)
+        V = FunctionSpace(mesh, "DG", 1)
+
+        # Define test and trial functions
+        v = TestFunction(V)
+        u = TrialFunction(V)
+
+        # Define normal component, mesh size and right-hand side
+        n = FacetNormal(mesh)
+        h = CellSize(mesh)
+        h_avg = (h('+') + h('-'))/2
+        f = Expression("500.0*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)", degree=1)
+
+        # Define bilinear form
+        a = dot(grad(v), grad(u))*dx \
+            - dot(avg(grad(v)), jump(u, n))*dS \
+            - dot(jump(v, n), avg(grad(u)))*dS \
+            + 4.0/h_avg*dot(jump(v, n), jump(u, n))*dS \
+            - dot(grad(v), u*n)*ds \
+            - dot(v*n, grad(u))*ds \
+            + 8.0/h*v*u*ds
+
+        # Define linear form
+        L = v*f*dx
+
+        # Reference values
+        A_frobenius_norm = 157.867392938645
+        b_l2_norm = 1.48087142738768
+
+        # Assemble A and b
+        self.assertAlmostEqual(assemble(a).norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(assemble(L).norm("l2"), b_l2_norm, 10)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_facet_assembly_multithreaded(self):
+
+        mesh = UnitSquareMesh(24, 24)
+        V = FunctionSpace(mesh, "DG", 1)
+
+        # Define test and trial functions
+        v = TestFunction(V)
+        u = TrialFunction(V)
+
+        # Define normal component, mesh size and right-hand side
+        n = FacetNormal(mesh)
+        h = CellSize(mesh)
+        h_avg = (h('+') + h('-'))/2
+        f = Expression("500.0*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)", degree=1)
+
+        # Define bilinear form
+        a = dot(grad(v), grad(u))*dx \
+            - dot(avg(grad(v)), jump(u, n))*dS \
+            - dot(jump(v, n), avg(grad(u)))*dS \
+            + 4.0/h_avg*dot(jump(v, n), jump(u, n))*dS \
+            - dot(grad(v), u*n)*ds \
+            - dot(v*n, grad(u))*ds \
+            + 8.0/h*v*u*ds
+
+        # Define linear form
+        L = v*f*dx
+
+        # Reference values
+        A_frobenius_norm = 157.867392938645
+        b_l2_norm = 1.48087142738768
+
+        # Assemble A and b
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(a).norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(assemble(L).norm("l2"), b_l2_norm, 10)
+        parameters["num_threads"] = 0
+
+    def test_functional_assembly(self):
+
+        mesh = UnitSquareMesh(24, 24)
+
+        f = Constant(1.0)
+        M0 = f*dx
+        self.assertAlmostEqual(assemble(M0, mesh=mesh), 1.0)
+
+        M1 = f*ds
+        self.assertAlmostEqual(assemble(M1, mesh=mesh), 4.0)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_functional_assembly_multithreaded(self):
+
+        mesh = UnitSquareMesh(24, 24)
+
+        f = Constant(1.0)
+        M0 = f*dx
+        self.assertAlmostEqual(assemble(M0, mesh=mesh), 1.0)
+
+        M1 = f*ds
+        self.assertAlmostEqual(assemble(M1, mesh=mesh), 4.0)
+
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(M0, mesh=mesh), 1.0)
+        parameters["num_threads"] = 0
+
+    def test_subdomain_and_fulldomain_assembly_meshdomains(self):
+        """Test assembly over subdomains AND the full domain with markers
+        stored as part of the mesh.
+        """
+
+        # Create a mesh of the unit cube
+        mesh = UnitCubeMesh(4, 4, 4)
+
+        # Define subdomains for 3 faces of the unit cube
+        class F0(SubDomain):
+            def inside(self, x, inside):
+                return near(x[0], 0.0)
+        class F1(SubDomain):
+            def inside(self, x, inside):
+                return near(x[1], 0.0)
+        class F2(SubDomain):
+            def inside(self, x, inside):
+                return near(x[2], 0.0)
+
+        # Define subdomains for 3 parts of the unit cube
+        class S0(SubDomain):
+            def inside(self, x, inside):
+                return x[0] > 0.25
+        class S1(SubDomain):
+            def inside(self, x, inside):
+                return x[0] > 0.5
+        class S2(SubDomain):
+            def inside(self, x, inside):
+                return x[0] > 0.75
+
+        # Mark mesh
+        f0 = F0()
+        f1 = F1()
+        f2 = F2()
+        f0.mark_facets(mesh, 0)
+        f1.mark_facets(mesh, 1)
+        f2.mark_facets(mesh, 3) # NB! 3, to leave a gap
+
+        s0 = S0()
+        s1 = S1()
+        s2 = S2()
+        s0.mark_cells(mesh, 0)
+        s1.mark_cells(mesh, 1)
+        s2.mark_cells(mesh, 3) # NB! 3, to leave a gap
+
+        # Assemble forms on subdomains and full domain and compare
+        krange = list(range(5))
+        for dmu in (dx, ds):
+            full = assemble(Constant(3.0)*dmu(), mesh=mesh)
+            subplusfull = [assemble(Constant(3.0)*dmu() + Constant(1.0)*dmu(k), mesh=mesh) for k in krange]
+            sub = [assemble(Constant(1.0)*dmu(k), mesh=mesh) for k in krange]
+            for k in krange:
+                #print sub[k] + full, subplusfull[k]
+                self.assertAlmostEqual(sub[k] + full, subplusfull[k])
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_subdomain_assembly_form_1(self):
+        "Test assembly over subdomains with markers stored as part of form"
+
+        mesh = UnitSquareMesh(4, 4)
+
+        # Define some haphazardly chosen cell/facet function
+        subdomains = CellFunction("size_t", mesh)
+        subdomains.set_all(0)
+        subdomains[0] = 1
+        subdomains[1] = 1
+
+        boundaries = FacetFunction("size_t", mesh)
+        boundaries.set_all(0)
+        boundaries[0] = 1
+        boundaries[1] = 1
+        boundaries[2] = 1
+        boundaries[3] = 1
+
+        V = FunctionSpace(mesh, "CG", 2)
+        f = Expression("x[0] + 2")
+        g = Expression("x[1] + 1")
+
+        f = interpolate(f, V)
+        g = interpolate(g, V)
+
+        mesh1 = subdomains.mesh()
+        mesh2 = boundaries.mesh()
+        self.assertEqual(mesh1.id(), mesh2.id())
+        self.assertEqual(mesh1.ufl_domain().label(), mesh2.ufl_domain().label())
+
+        dxs = dx[subdomains]
+        dss = ds[boundaries]
+        self.assertEqual(dxs.domain(), None)
+        self.assertEqual(dss.domain(), None)
+        self.assertEqual(dxs.subdomain_data(), subdomains)
+        self.assertEqual(dss.subdomain_data(), boundaries)
+
+        M = f*f*dxs(0) + g*f*dxs(1) + f*f*dss(1)
+        self.assertEqual(M.domains(), (mesh.ufl_domain(),))
+        sd = M.compute_form_data().subdomain_data[mesh.ufl_domain().label()]
+        self.assertEqual(sd["cell"], subdomains)
+        self.assertEqual(sd["exterior_facet"], boundaries)
+
+        # Check that subdomains are respected
+        reference = 7.33040364583
+        self.assertAlmostEqual(assemble(M), reference, 10)
+
+        # Check that given exterior_facet_domains override
+        new_boundaries = FacetFunction("size_t", mesh)
+        new_boundaries.set_all(0)
+        reference2 = 6.2001953125
+        value2 = assemble(M, exterior_facet_domains=new_boundaries)
+        self.assertAlmostEqual(value2, reference2, 10)
+
+        # Check that the form itself assembles as before
+        self.assertAlmostEqual(assemble(M), reference, 10)
+
+        # Take action of derivative of M on f
+        df = TestFunction(V)
+        L = derivative(M, f, df)
+        dg = TrialFunction(V)
+        F = derivative(L, g, dg)
+        b = action(F, f)
+
+        # Check that domain data carries across transformations:
+        reference = 0.0626219513355
+        self.assertAlmostEqual(assemble(b).norm("l2"), reference, 8)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_subdomain_assembly_form_1_multithreaded(self):
+        "Test assembly over subdomains with markers stored as part of form"
+
+        mesh = UnitSquareMesh(4, 4)
+
+        # Define some haphazardly chosen cell/facet function
+        subdomains = CellFunction("size_t", mesh)
+        subdomains.set_all(0)
+        subdomains[0] = 1
+        subdomains[1] = 1
+
+        boundaries = FacetFunction("size_t", mesh)
+        boundaries.set_all(0)
+        boundaries[0] = 1
+        boundaries[1] = 1
+        boundaries[2] = 1
+        boundaries[3] = 1
+
+        V = FunctionSpace(mesh, "CG", 2)
+        f = Expression("x[0] + 2")
+        g = Expression("x[1] + 1")
+
+        f = interpolate(f, V)
+        g = interpolate(g, V)
+
+        mesh1 = subdomains.mesh()
+        mesh2 = boundaries.mesh()
+        self.assertEqual(mesh1.id(), mesh2.id())
+        self.assertEqual(mesh1.ufl_domain().label(), mesh2.ufl_domain().label())
+
+        dxs = dx[subdomains]
+        dss = ds[boundaries]
+        self.assertEqual(dxs.domain(), None)
+        self.assertEqual(dss.domain(), None)
+        self.assertEqual(dxs.subdomain_data(), subdomains)
+        self.assertEqual(dss.subdomain_data(), boundaries)
+
+        M = f*f*dxs(0) + g*f*dxs(1) + f*f*dss(1)
+        self.assertEqual(M.domains(), (mesh.ufl_domain(),))
+        sd = M.compute_form_data().subdomain_data[mesh.ufl_domain().label()]
+        self.assertEqual(sd["cell"], subdomains)
+        self.assertEqual(sd["exterior_facet"], boundaries)
+
+        # Check that subdomains are respected
+        reference = 7.33040364583
+        self.assertAlmostEqual(assemble(M), reference, 10)
+
+        # Assemble form (multi-threaded)
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(M), reference, 10)
+        parameters["num_threads"] = 0
+
+        # Check that given exterior_facet_domains override
+        new_boundaries = FacetFunction("size_t", mesh)
+        new_boundaries.set_all(0)
+        reference2 = 6.2001953125
+        value2 = assemble(M, exterior_facet_domains=new_boundaries)
+        self.assertAlmostEqual(value2, reference2, 10)
+
+        # Assemble form (multi-threaded)
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(M, exterior_facet_domains=new_boundaries),\
+                                   reference2, 10)
+        parameters["num_threads"] = 0
+
+        # Check that the form itself assembles as before
+        self.assertAlmostEqual(assemble(M), reference, 10)
+
+        # Assemble form  (multi-threaded)
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(M), reference, 10)
+        parameters["num_threads"] = 0
+
+        # Take action of derivative of M on f
+        df = TestFunction(V)
+        L = derivative(M, f, df)
+        dg = TrialFunction(V)
+        F = derivative(L, g, dg)
+        b = action(F, f)
+
+        # Check that domain data carries across transformations:
+        reference = 0.0626219513355
+        self.assertAlmostEqual(assemble(b).norm("l2"), reference, 8)
+
+        # Assemble form  (multi-threaded)
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(b).norm("l2"), reference, 8)
+        parameters["num_threads"] = 0
+
+    def test_subdomain_assembly_form_2(self):
+        "Test assembly over subdomains with markers stored as part of form"
+
+        # Define mesh
+        mesh = UnitSquareMesh(8, 8)
+
+        # Define domain for lower left corner
+        class MyDomain(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] < 0.5 + DOLFIN_EPS and x[1] < 0.5 + DOLFIN_EPS
+        my_domain = MyDomain()
+
+        # Define boundary for lower left corner
+        class MyBoundary(SubDomain):
+            def inside(self, x, on_boundary):
+                return (x[0] < 0.5 + DOLFIN_EPS and x[1] < DOLFIN_EPS) or \
+                       (x[1] < 0.5 + DOLFIN_EPS and x[0] < DOLFIN_EPS)
+        my_boundary = MyBoundary()
+
+        # Mark mesh functions
+        D = mesh.topology().dim()
+        cell_domains = MeshFunction("size_t", mesh, D)
+        exterior_facet_domains = MeshFunction("size_t", mesh, D - 1)
+        cell_domains.set_all(1)
+        exterior_facet_domains.set_all(1)
+        my_domain.mark(cell_domains, 0)
+        my_boundary.mark(exterior_facet_domains, 0)
+
+        # Define forms
+        c = Constant(1.0)
+
+        dxs = dx[cell_domains]
+        a0 = c*dxs(0)
+        dss = ds[exterior_facet_domains]
+        a1 = c*dss(0)
+
+        self.assertAlmostEqual(assemble(a0, mesh=mesh), 0.25)
+        self.assertAlmostEqual(assemble(a1, mesh=mesh), 1.0)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_colored_cell_assembly(self):
+
+        old_mesh = UnitCubeMesh(4, 4, 4)
+
+        # Create mesh, then color and renumber
+        old_mesh.color("vertex")
+        mesh = old_mesh.renumber_by_color()
+
+        V = VectorFunctionSpace(mesh, "DG", 1)
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        f = Constant((10, 20, 30))
+        def epsilon(v):
+            return 0.5*(grad(v) + grad(v).T)
+        a = inner(epsilon(v), epsilon(u))*dx
+        L = inner(v, f)*dx
+
+        A_frobenius_norm =  4.3969686527582512
+        b_l2_norm = 0.95470326978246278
+
+        # Assemble A and b
+        self.assertAlmostEqual(assemble(a).norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(assemble(L).norm("l2"), b_l2_norm, 10)
+
+        # Assemble A and b multi-threaded
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(a).norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(assemble(L).norm("l2"), b_l2_norm, 10)
+        parameters["num_threads"] = 0
+
+    def test_nonsquare_assembly(self):
+        """Test assembly of a rectangular matrix"""
+
+        mesh = UnitSquareMesh(16, 16)
+
+        V = VectorFunctionSpace(mesh, "CG", 2)
+        Q = FunctionSpace(mesh, "CG", 1)
+        W = V*Q
+
+        (v, q) = TestFunctions(W)
+        (u, p) = TrialFunctions(W)
+
+        a = div(v)*p*dx
+        A_frobenius_norm = 9.6420303878382718e-01
+
+        self.assertAlmostEqual(assemble(a).norm("frobenius"),
+                               A_frobenius_norm, 10)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_nonsquare_assembly_multithreaded(self):
+        """Test assembly of a rectangular matrix"""
+
+        mesh = UnitSquareMesh(16, 16)
+
+        V = VectorFunctionSpace(mesh, "CG", 2)
+        Q = FunctionSpace(mesh, "CG", 1)
+        W = V*Q
+
+        (v, q) = TestFunctions(W)
+        (u, p) = TrialFunctions(W)
+
+        a = div(v)*p*dx
+        A_frobenius_norm = 9.6420303878382718e-01
+
+        parameters["num_threads"] = 4
+        self.assertAlmostEqual(assemble(a).norm("frobenius"),
+                               A_frobenius_norm, 10)
+        parameters["num_threads"] = 0
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_reference_assembly(self):
+        "Test assembly against a reference solution"
+
+        # NOTE: This test is not robust as it relies on specific
+        #       DOF order, which cannot be guaranteed
+        reorder_dofs = parameters["reorder_dofs_serial"]
+        parameters["reorder_dofs_serial"] = False
+
+        # Load reference mesh (just a simple tetrahedron)
+        mesh = Mesh("tetrahedron.xml.gz");
+
+        # Assemble stiffness and mass matrices
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u, v = TrialFunction(V), TestFunction(V)
+        A, M = uBLASDenseMatrix(), uBLASDenseMatrix()
+        assemble(dot(grad(v), grad(u))*dx, tensor=A)
+        assemble(v*u*dx, tensor=M)
+
+        # Create reference matrices and set entries
+        A0, M0 = uBLASDenseMatrix(4, 4), uBLASDenseMatrix(4, 4)
+        pos = numpy.array([0, 1, 2, 3], dtype=numpy.intc)
+        A0.set(numpy.array([[1.0/2.0, -1.0/6.0, -1.0/6.0, -1.0/6.0],
+                            [-1.0/6.0, 1.0/6.0, 0.0, 0.0],
+                            [-1.0/6.0, 0.0, 1.0/6.0, 0.0],
+                            [-1.0/6.0, 0.0, 0.0, 1.0/6.0]]), pos, pos)
+
+        M0.set(numpy.array([[1.0/60.0, 1.0/120.0, 1.0/120.0, 1.0/120.0],
+                            [1.0/120.0, 1.0/60.0, 1.0/120.0, 1.0/120.0],
+                            [1.0/120.0, 1.0/120.0, 1.0/60.0, 1.0/120.0],
+                            [1.0/120.0, 1.0/120.0, 1.0/120.0, 1.0/60.0]]), pos, pos)
+        A0.apply("insert")
+        M0.apply("insert")
+
+        C = A - A0
+        self.assertAlmostEqual(C.norm("frobenius"), 0.0)
+        D = M - M0
+        self.assertAlmostEqual(D.norm("frobenius"), 0.0)
+
+        parameters["reorder_dofs_serial"] = reorder_dofs
+
+    def test_ways_to_pass_mesh_to_assembler(self):
+        mesh = UnitSquareMesh(16, 16)
+
+        # Geometry with mesh (ufl.Domain with mesh in domain data)
+        x = SpatialCoordinate(mesh)
+        n = FacetNormal(mesh)
+
+        # Geometry with just cell (no reference to mesh, for backwards
+        # compatibility)
+        x2 = SpatialCoordinate(mesh.ufl_cell())
+        n2 = FacetNormal(mesh.ufl_cell())
+
+        # A function equal to x[0] for comparison
+        V = FunctionSpace(mesh, "CG", 1)
+        f = Function(V)
+        f.interpolate(Expression("x[0]"))
+
+        # An expression equal to x[0], with different geometry info:
+        e = Expression("x[0]") # nothing
+        e2 = Expression("x[0]", cell=mesh.ufl_cell()) # cell
+        e3 = Expression("x[0]", element=V.ufl_element()) # ufl element
+        e4 = Expression("x[0]", domain=mesh) # ufl.Domain (this one holds mesh reference)
+
+
+        # Provide mesh in measure:
+        dx2 = Measure("dx", domain=mesh)
+        self.assertAlmostEqual(1.0, assemble(1*dx(mesh)))
+        self.assertAlmostEqual(1.0, assemble(Constant(1.0)*dx(mesh)))
+        self.assertAlmostEqual(1.0, assemble(Constant(1.0)*dx2))
+
+        # Provide mesh in measure and as argument:
+        self.assertAlmostEqual(1.0, assemble(1*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(1.0, assemble(Constant(1.0)*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(1.0, assemble(Constant(1.0)*dx2, mesh=mesh))
+
+        # Try with cell argument to Constant as well:
+        self.assertAlmostEqual(1.0, assemble(Constant(1.0, cell=mesh.ufl_cell())*dx(mesh)))
+        self.assertAlmostEqual(1.0, assemble(Constant(1.0, cell=mesh.ufl_cell())*dx2))
+        self.assertAlmostEqual(1.0, assemble(Constant(1.0, cell=mesh.ufl_cell())*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(1.0, assemble(Constant(1.0, cell=mesh.ufl_cell())*dx2, mesh=mesh))
+
+
+        # Geometric quantities with mesh in domain:
+        self.assertAlmostEqual(0.5, assemble(x[0]*dx))
+        self.assertAlmostEqual(0.5, assemble(x[0]*dx(mesh)))
+        self.assertAlmostEqual(0.5, assemble(x[0]*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(x[0]*dx, mesh=mesh))
+
+        # Geometric quantities without mesh in domain:
+        self.assertAlmostEqual(0.5, assemble(x2[0]*dx(mesh)))
+        self.assertAlmostEqual(0.5, assemble(x2[0]*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(x2[0]*dx, mesh=mesh))
+
+        # Functions with mesh in domain:
+        self.assertAlmostEqual(0.5, assemble(f*dx))
+        self.assertAlmostEqual(0.5, assemble(f*dx(mesh)))
+        self.assertAlmostEqual(0.5, assemble(f*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(f*dx, mesh=mesh))
+
+        # Expressions with and without mesh in domain:
+        self.assertAlmostEqual(0.5, assemble(e*dx(mesh)))
+        self.assertAlmostEqual(0.5, assemble(e*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(e*dx, mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(e2*dx(mesh)))
+        self.assertAlmostEqual(0.5, assemble(e2*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(e2*dx, mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(e3*dx(mesh)))
+        self.assertAlmostEqual(0.5, assemble(e3*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(e3*dx, mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(e4*dx)) # e4 has a domain with mesh reference
+        self.assertAlmostEqual(0.5, assemble(e4*dx(mesh)))
+        self.assertAlmostEqual(0.5, assemble(e4*dx(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.5, assemble(e4*dx, mesh=mesh))
+
+
+        # Geometric quantities with mesh in domain:
+        self.assertAlmostEqual(0.0, assemble(n[0]*ds))
+        self.assertAlmostEqual(0.0, assemble(n[0]*ds(mesh)))
+        self.assertAlmostEqual(0.0, assemble(n[0]*ds(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.0, assemble(n[0]*ds, mesh=mesh))
+
+        # Geometric quantities without mesh in domain:
+        self.assertAlmostEqual(0.0, assemble(n2[0]*ds(mesh)))
+        self.assertAlmostEqual(0.0, assemble(n2[0]*ds(mesh), mesh=mesh))
+        self.assertAlmostEqual(0.0, assemble(n2[0]*ds, mesh=mesh))
+
+if __name__ == "__main__":
+    print ""
+    print "Testing class Assembler"
+    print "-----------------------"
+    unittest.main()
diff --git a/test/unit/fem/python/DirichletBC.py b/test/unit/fem/python/DirichletBC.py
new file mode 100644
index 0000000..a65dcb7
--- /dev/null
+++ b/test/unit/fem/python/DirichletBC.py
@@ -0,0 +1,143 @@
+"""Unit tests for Dirichlet boundary conditions"""
+
+# Copyright (C) 2011-2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Kent-Andre Mardal 2011
+# Modified by Anders Logg 2011
+# Modified by Martin Alnaes 2012
+#
+# First added:  2011-09-19
+# Last changed: 2014-05-28
+
+import unittest
+import numpy
+from dolfin import *
+
+class DirichletBCTest(unittest.TestCase):
+
+    def test_instantiation(self):
+        """ A rudimentary test for instantiation"""
+        # FIXME: Needs to be expanded
+        mesh = UnitCubeMesh(8, 8, 8)
+        V = FunctionSpace(mesh, "CG", 1)
+
+        bc0 = DirichletBC(V, 1, "x[0]<0")
+        bc1 = DirichletBC(bc0)
+        self.assertTrue(bc0.function_space() == bc1.function_space())
+
+    def test_director_lifetime(self):
+        """Test for any problems with objects with directors going out
+        of scope"""
+
+        class Boundary(SubDomain):
+            def inside(self, x, on_boundary): return on_boundary
+
+        class BoundaryFunction(Expression):
+            def eval(self, values, x): values[0] = 1.0
+
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        v, u = TestFunction(V), TrialFunction(V)
+
+        A0 = assemble(v*u*dx)
+        bc0 = DirichletBC(V, BoundaryFunction(), Boundary())
+        bc0.apply(A0)
+
+        bc1 = DirichletBC(V, Expression("1.0"), CompiledSubDomain("on_boundary"))
+        A1 = assemble(v*u*dx)
+        bc1.apply(A1)
+
+        self.assertAlmostEqual(A1.norm("frobenius"), A0.norm("frobenius"))
+
+    def test_get_values(self):
+        mesh = UnitSquareMesh(8, 8)
+        dofs = numpy.zeros(3, dtype="I")
+
+        def upper(x, on_boundary):
+            return x[1] > 0.5 + DOLFIN_EPS
+
+        V = FunctionSpace(mesh, "CG", 1)
+        bc = DirichletBC(V, 0.0, upper)
+        bc_values = bc.get_boundary_values()
+
+    def test_meshdomain_bcs(self):
+        """Test application of Dirichlet boundary conditions stored as
+        part of the mesh. This test is also a compatibility test for
+        VMTK."""
+
+        mesh = Mesh("aneurysm.xml.gz")
+        V = FunctionSpace(mesh, "CG", 1)
+        v = TestFunction(V)
+
+        f = Constant(0)
+        u1 = Constant(1)
+        u2 = Constant(2)
+        u3 = Constant(3)
+
+        bc1 = DirichletBC(V, u1, 1)
+        bc2 = DirichletBC(V, u2, 2)
+        bc3 = DirichletBC(V, u3, 3)
+        bcs = [bc1, bc2, bc3]
+
+        L = f*v*dx
+        b = assemble(L)
+        [bc.apply(b) for bc in bcs]
+        self.assertAlmostEqual(norm(b), 16.55294535724685)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_bc_for_piola_on_manifolds(self):
+        "Testing DirichletBC for piolas over standard domains vs manifolds."
+
+        n = 4
+        side = CompiledSubDomain("near(x[2], 0.0)")
+
+        mesh = SubMesh(BoundaryMesh(UnitCubeMesh(n, n, n), "exterior"), side)
+        square = UnitSquareMesh(n, n)
+        mesh.init_cell_orientations(Expression(("0.0", "0.0", "1.0")))
+
+        RT1 = lambda mesh: FunctionSpace(mesh, "RT", 1)
+        RT2 = lambda mesh: FunctionSpace(mesh, "RT", 2)
+        DRT1 = lambda mesh: FunctionSpace(mesh, "DRT", 1)
+        DRT2 = lambda mesh: FunctionSpace(mesh, "DRT", 2)
+        BDM1 = lambda mesh: FunctionSpace(mesh, "BDM", 1)
+        BDM2 = lambda mesh: FunctionSpace(mesh, "BDM", 2)
+        N1curl1 = lambda mesh: FunctionSpace(mesh, "N1curl", 1)
+        N2curl1 = lambda mesh: FunctionSpace(mesh, "N2curl", 1)
+        N1curl2 = lambda mesh:FunctionSpace(mesh, "N1curl", 2)
+        N2curl2 = lambda mesh: FunctionSpace(mesh, "N2curl", 2)
+        elements = [N1curl1, N2curl1,  N1curl2, N2curl2, RT1, RT2, BDM1, BDM2, DRT1, DRT2]
+
+        for element in elements:
+            V = element(mesh)
+            bc = DirichletBC(V, (1.0, 0.0, 0.0), "on_boundary")
+            u = Function(V)
+            bc.apply(u.vector())
+            b0 = assemble(inner(u, u)*dx)
+
+            V = element(square)
+            bc = DirichletBC(V, (1.0, 0.0), "on_boundary")
+            u = Function(V)
+            bc.apply(u.vector())
+            b1 = assemble(inner(u, u)*dx)
+            self.assertAlmostEqual(b0, b1)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing Dirichlet boundary conditions"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/fem/python/DofMap.py b/test/unit/fem/python/DofMap.py
new file mode 100644
index 0000000..f0ef784
--- /dev/null
+++ b/test/unit/fem/python/DofMap.py
@@ -0,0 +1,299 @@
+"""Unit tests for the fem interface"""
+
+# Copyright (C) 2009-2014 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+import unittest
+import numpy as np
+from dolfin import *
+
+class DofMapTest(unittest.TestCase):
+
+    def setUp(self):
+        self.mesh = UnitSquareMesh(4, 4)
+        self.V = FunctionSpace(self.mesh, "Lagrange", 1)
+        self.Q = VectorFunctionSpace(self.mesh, "Lagrange", 1)
+        self.W = self.V*self.Q
+
+    def test_tabulate_coord(self):
+
+        L0  = self.W.sub(0)
+        L1  = self.W.sub(1)
+        L01 = L1.sub(0)
+        L11 = L1.sub(1)
+
+        coord0 = np.zeros((3,2), dtype="d")
+        coord1 = np.zeros((3,2), dtype="d")
+        coord2 = np.zeros((3,2), dtype="d")
+        coord3 = np.zeros((3,2), dtype="d")
+
+        for cell in cells(self.mesh):
+            self.V.dofmap().tabulate_coordinates(cell, coord0)
+            L0.dofmap().tabulate_coordinates(cell, coord1)
+            L01.dofmap().tabulate_coordinates(cell, coord2)
+            L11.dofmap().tabulate_coordinates(cell, coord3)
+            coord4 = L1.dofmap().tabulate_coordinates(cell)
+
+            self.assertTrue((coord0 == coord1).all())
+            self.assertTrue((coord0 == coord2).all())
+            self.assertTrue((coord0 == coord3).all())
+            self.assertTrue((coord4[:3] == coord0).all())
+            self.assertTrue((coord4[3:] == coord0).all())
+
+    def test_tabulate_dofs(self):
+
+        L0   = self.W.sub(0)
+        L1   = self.W.sub(1)
+        L01  = L1.sub(0)
+        L11  = L1.sub(1)
+
+        for i, cell in enumerate(cells(self.mesh)):
+
+            dofs0 = L0.dofmap().cell_dofs(cell.index())
+
+            dofs1 = L01.dofmap().cell_dofs(cell.index())
+            dofs2 = L11.dofmap().cell_dofs(cell.index())
+            dofs3 = L1.dofmap().cell_dofs(cell.index())
+
+            self.assertTrue(np.array_equal(dofs0, \
+                                L0.dofmap().cell_dofs(i)))
+            self.assertTrue(np.array_equal(dofs1,
+                                L01.dofmap().cell_dofs(i)))
+            self.assertTrue(np.array_equal(dofs2,
+                                L11.dofmap().cell_dofs(i)))
+            self.assertTrue(np.array_equal(dofs3,
+                                L1.dofmap().cell_dofs(i)))
+
+            self.assertEqual(len(np.intersect1d(dofs0, dofs1)), 0)
+            self.assertEqual(len(np.intersect1d(dofs0, dofs2)), 0)
+            self.assertEqual(len(np.intersect1d(dofs1, dofs2)), 0)
+            self.assertTrue(np.array_equal(np.append(dofs1, dofs2), dofs3))
+
+    def test_tabulate_coord_periodic(self):
+
+        class PeriodicBoundary2(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] < DOLFIN_EPS
+            def map(self, x, y):
+                y[0] = x[0] - 1.0
+                y[1] = x[1]
+
+        # Create periodic boundary condition
+        periodic_boundary = PeriodicBoundary2()
+
+        mesh = UnitSquareMesh(4, 4)
+
+        V = FunctionSpace(mesh, "Lagrange", 1,  constrained_domain=periodic_boundary)
+        Q = VectorFunctionSpace(mesh, "Lagrange", 1,  constrained_domain=periodic_boundary)
+        W = V*Q
+
+        L0  = W.sub(0)
+        L1  = W.sub(1)
+        L01 = L1.sub(0)
+        L11 = L1.sub(1)
+
+        coord0 = np.zeros((3,2), dtype="d")
+        coord1 = np.zeros((3,2), dtype="d")
+        coord2 = np.zeros((3,2), dtype="d")
+        coord3 = np.zeros((3,2), dtype="d")
+
+        for cell in cells(mesh):
+            V.dofmap().tabulate_coordinates(cell, coord0)
+            L0.dofmap().tabulate_coordinates(cell, coord1)
+            L01.dofmap().tabulate_coordinates(cell, coord2)
+            L11.dofmap().tabulate_coordinates(cell, coord3)
+            coord4 = L1.dofmap().tabulate_coordinates(cell)
+
+            self.assertTrue((coord0 == coord1).all())
+            self.assertTrue((coord0 == coord2).all())
+            self.assertTrue((coord0 == coord3).all())
+            self.assertTrue((coord4[:3] == coord0).all())
+            self.assertTrue((coord4[3:] == coord0).all())
+
+    def test_tabulate_dofs_periodic(self):
+
+        class PeriodicBoundary2(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] < DOLFIN_EPS
+            def map(self, x, y):
+                y[0] = x[0] - 1.0
+                y[1] = x[1]
+
+        mesh = UnitSquareMesh(5, 5)
+
+        # Create periodic boundary
+        periodic_boundary = PeriodicBoundary2()
+
+        V = FunctionSpace(mesh, "Lagrange", 2, constrained_domain=periodic_boundary)
+        Q = VectorFunctionSpace(mesh, "Lagrange", 2, constrained_domain=periodic_boundary)
+        W = V*Q
+
+        L0   = W.sub(0)
+        L1   = W.sub(1)
+        L01  = L1.sub(0)
+        L11  = L1.sub(1)
+
+        # Check dimensions
+        self.assertEqual(V.dim(), 110)
+        self.assertEqual(Q.dim(), 220)
+        self.assertEqual(L0.dim(), V.dim())
+        self.assertEqual(L1.dim(), Q.dim())
+        self.assertEqual(L01.dim(), V.dim())
+        self.assertEqual(L11.dim(), V.dim())
+
+        for i, cell in enumerate(cells(mesh)):
+
+            dofs0 = L0.dofmap().cell_dofs(cell.index())
+
+            dofs1 = L01.dofmap().cell_dofs(cell.index())
+            dofs2 = L11.dofmap().cell_dofs(cell.index())
+            dofs3 = L1.dofmap().cell_dofs(cell.index())
+
+            self.assertTrue(np.array_equal(dofs0, \
+                                L0.dofmap().cell_dofs(i)))
+            self.assertTrue(np.array_equal(dofs1,
+                                L01.dofmap().cell_dofs(i)))
+            self.assertTrue(np.array_equal(dofs2,
+                                L11.dofmap().cell_dofs(i)))
+            self.assertTrue(np.array_equal(dofs3,
+                                L1.dofmap().cell_dofs(i)))
+
+            self.assertEqual(len(np.intersect1d(dofs0, dofs1)), 0)
+            self.assertEqual(len(np.intersect1d(dofs0, dofs2)), 0)
+            self.assertEqual(len(np.intersect1d(dofs1, dofs2)), 0)
+            self.assertTrue(np.array_equal(np.append(dofs1, dofs2), dofs3))
+
+    def test_global_dof_builder(self):
+
+        mesh = UnitSquareMesh(3, 3)
+
+        V = VectorFunctionSpace(mesh, "CG", 1)
+        Q = FunctionSpace(mesh, "CG", 1)
+        R = FunctionSpace(mesh, "R", 0)
+
+        W = MixedFunctionSpace([Q, Q, Q, R])
+        W = MixedFunctionSpace([Q, Q, R, Q])
+        W = MixedFunctionSpace([V, R])
+        W = MixedFunctionSpace([R, V])
+
+    def test_dof_to_vertex_map(self):
+
+        # Check for both reordered and UFC ordered dofs
+        for reorder_dofs in [True, False]:
+            parameters.reorder_dofs_serial = reorder_dofs
+
+            V = FunctionSpace(self.mesh, "Lagrange", 1)
+            Q = VectorFunctionSpace(self.mesh, "Lagrange", 1)
+            W = V*Q
+
+            u = Function(V)
+            e = Expression("x[0]+x[1]")
+            u.interpolate(e)
+
+            vert_values = self.mesh.coordinates().sum(1)
+            func_values = -1*np.ones(len(vert_values))
+            func_values[dof_to_vertex_map(V)] = u.vector().array()
+
+            for v_val, f_val in zip(vert_values, func_values):
+                # Do not compare dofs owned by other process
+                if f_val != -1:
+                    self.assertAlmostEqual(f_val, v_val)
+
+            c0 = Constant((1,2))
+            u0 = Function(Q)
+            u0.interpolate(c0)
+
+            vert_values = np.zeros(self.mesh.num_vertices()*2)
+            u1 = Function(Q)
+            vert_values[::2] = 1
+            vert_values[1::2] = 2
+
+            u1.vector().set_local(vert_values[dof_to_vertex_map(Q)].copy())
+            self.assertAlmostEqual((u0.vector()-u1.vector()).sum(), 0.0)
+
+            W = FunctionSpace(self.mesh, "DG", 0)
+            self.assertRaises(RuntimeError, lambda : dof_to_vertex_map(W))
+
+            W = Q*FunctionSpace(self.mesh, "R", 0)
+            self.assertRaises(RuntimeError, lambda : dof_to_vertex_map(W))
+            W = FunctionSpace(self.mesh, "CG", 2)
+            self.assertRaises(RuntimeError, lambda : dof_to_vertex_map(W))
+            W = VectorFunctionSpace(self.mesh, "CG", 1)
+            self.assertRaises(RuntimeError, lambda : dof_to_vertex_map(W.sub(0)))
+
+
+    def test_entity_dofs(self):
+
+        # Test that num entity dofs is correctly wrapped to
+        # dolfin::DofMap
+        V = FunctionSpace(self.mesh, "CG", 1)
+        self.assertEqual(V.dofmap().num_entity_dofs(0), 1)
+        self.assertEqual(V.dofmap().num_entity_dofs(1), 0)
+        self.assertEqual(V.dofmap().num_entity_dofs(2), 0)
+
+        V = VectorFunctionSpace(self.mesh, "CG", 1)
+        self.assertEqual(V.dofmap().num_entity_dofs(0), 2)
+        self.assertEqual(V.dofmap().num_entity_dofs(1), 0)
+        self.assertEqual(V.dofmap().num_entity_dofs(2), 0)
+
+        V = FunctionSpace(self.mesh, "CG", 2)
+        self.assertEqual(V.dofmap().num_entity_dofs(0), 1)
+        self.assertEqual(V.dofmap().num_entity_dofs(1), 1)
+        self.assertEqual(V.dofmap().num_entity_dofs(2), 0)
+
+        V = FunctionSpace(self.mesh, "CG", 3)
+        self.assertEqual(V.dofmap().num_entity_dofs(0), 1)
+        self.assertEqual(V.dofmap().num_entity_dofs(1), 2)
+        self.assertEqual(V.dofmap().num_entity_dofs(2), 1)
+
+        V = FunctionSpace(self.mesh, "DG", 0)
+        self.assertEqual(V.dofmap().num_entity_dofs(0), 0)
+        self.assertEqual(V.dofmap().num_entity_dofs(1), 0)
+        self.assertEqual(V.dofmap().num_entity_dofs(2), 1)
+
+        V = FunctionSpace(self.mesh, "DG", 1)
+        self.assertEqual(V.dofmap().num_entity_dofs(0), 0)
+        self.assertEqual(V.dofmap().num_entity_dofs(1), 0)
+        self.assertEqual(V.dofmap().num_entity_dofs(2), 3)
+
+        V = VectorFunctionSpace(self.mesh, "CG", 1)
+
+        # Note this numbering is dependent on FFC and can change This
+        # test is here just to check that we get correct numbers
+        # mapped from ufc generated code to dolfin
+        for i, cdofs in enumerate([[0,3], [1,4], [2,5]]):
+            dofs = V.dofmap().tabulate_entity_dofs(0, i)
+            self.assertTrue(all(d==cd for d, cd in zip(dofs, cdofs)))
+
+    @unittest.skipIf(not MPI.size(mpi_comm_world()) > 1, "This test should only be run in parallel.")
+    def test_mpi_dofmap_stats(self):
+
+        V = FunctionSpace(self.mesh, "CG", 1)
+        self.assertTrue(len(V.dofmap().shared_dofs()) > 0)
+        neighbours = V.dofmap().neighbours()
+        for processes in V.dofmap().shared_dofs().values():
+            for process in processes:
+                self.assertTrue(process in neighbours)
+
+        for owner in V.dofmap().off_process_owner().values():
+            self.assertTrue(owner in neighbours)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing PyDOLFIN DofMap operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/fem/python/FiniteElement.py b/test/unit/fem/python/FiniteElement.py
new file mode 100644
index 0000000..adfe006
--- /dev/null
+++ b/test/unit/fem/python/FiniteElement.py
@@ -0,0 +1,146 @@
+"""Unit tests for the fem interface"""
+
+# Copyright (C) 2009 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-07-28
+# Last changed: 2009-07-28
+
+import unittest
+import numpy
+from dolfin import *
+
+class FiniteElementTest(unittest.TestCase):
+
+    def setUp(self):
+        self.mesh = UnitSquareMesh(4, 4)
+        self.V = FunctionSpace(self.mesh, "CG", 1)
+        self.Q = VectorFunctionSpace(self.mesh, "CG", 1)
+        self.W = self.V * self.Q
+
+    def test_evaluate_dofs(self):
+
+        e = Expression("x[0]+x[1]")
+        e2 = Expression(("x[0]+x[1]", "x[0]+x[1]"))
+
+        coords = numpy.zeros((3, 2), dtype="d")
+        coord = numpy.zeros(2, dtype="d")
+        values0 = numpy.zeros(3, dtype="d")
+        values1 = numpy.zeros(3, dtype="d")
+        values2 = numpy.zeros(3, dtype="d")
+        values3 = numpy.zeros(3, dtype="d")
+        values4 = numpy.zeros(6, dtype="d")
+
+        L0  = self.W.sub(0)
+        L1  = self.W.sub(1)
+        L01 = L1.sub(0)
+        L11 = L1.sub(1)
+
+        for cell in cells(self.mesh):
+            vx = cell.get_vertex_coordinates()
+            orientation = cell.orientation()
+            self.V.dofmap().tabulate_coordinates(cell, coords)
+            for i in xrange(coords.shape[0]):
+                coord[:] = coords[i,:]
+                values0[i] = e(*coord)
+            L0.element().evaluate_dofs(values1, e, vx, orientation, cell)
+            L01.element().evaluate_dofs(values2, e, vx, orientation, cell)
+            L11.element().evaluate_dofs(values3, e, vx, orientation, cell)
+            L1.element().evaluate_dofs(values4, e2, vx, orientation, cell)
+
+            for i in range(3):
+                self.assertAlmostEqual(values0[i], values1[i])
+                self.assertAlmostEqual(values0[i], values2[i])
+                self.assertAlmostEqual(values0[i], values3[i])
+                self.assertAlmostEqual(values4[:3][i], values0[i])
+                self.assertAlmostEqual(values4[3:][i], values0[i])
+
+    def test_evaluate_dofs_manifolds_affine(self):
+        "Testing evaluate_dofs vs tabulated coordinates."
+
+        n = 4
+        mesh = BoundaryMesh(UnitSquareMesh(n, n), "exterior")
+        mesh2 = BoundaryMesh(UnitCubeMesh(n, n, n), "exterior")
+        DG0 = FunctionSpace(mesh, "DG", 0)
+        DG1 = FunctionSpace(mesh, "DG", 1)
+        CG1 = FunctionSpace(mesh, "CG", 1)
+        CG2 = FunctionSpace(mesh, "CG", 2)
+        DG20 = FunctionSpace(mesh2, "DG", 0)
+        DG21 = FunctionSpace(mesh2, "DG", 1)
+        CG21 = FunctionSpace(mesh2, "CG", 1)
+        CG22 = FunctionSpace(mesh2, "CG", 2)
+        elements = [DG0, DG1, CG1, CG2, DG20, DG21, CG21, CG22]
+
+        f = Expression("x[0]+x[1]")
+        for V in elements:
+            sdim = V.element().space_dimension()
+            gdim = V.mesh().geometry().dim()
+            coords = numpy.zeros((sdim, gdim), dtype="d")
+            coord = numpy.zeros(gdim, dtype="d")
+            values0 = numpy.zeros(sdim, dtype="d")
+            values1 = numpy.zeros(sdim, dtype="d")
+            for cell in cells(V.mesh()):
+                vx = cell.get_vertex_coordinates()
+                orientation = cell.orientation()
+                V.dofmap().tabulate_coordinates(cell, coords)
+                for i in xrange(coords.shape[0]):
+                    coord[:] = coords[i,:]
+                    values0[i] = f(*coord)
+                V.element().evaluate_dofs(values1, f, vx, orientation, cell)
+                for i in range(sdim):
+                    self.assertAlmostEqual(values0[i], values1[i])
+
+class DofMapTest(unittest.TestCase):
+
+    def setUp(self):
+        self.mesh = UnitSquareMesh(4, 4)
+        self.V = FunctionSpace(self.mesh, "CG", 1)
+        self.Q = VectorFunctionSpace(self.mesh, "CG", 1)
+        self.W = self.V*self.Q
+
+    def test_tabulate_coord(self):
+
+        coord0 = numpy.zeros((3,2), dtype="d")
+        coord1 = numpy.zeros((3,2), dtype="d")
+        coord2 = numpy.zeros((3,2), dtype="d")
+        coord3 = numpy.zeros((3,2), dtype="d")
+        coord4 = numpy.zeros((6,2), dtype="d")
+
+        L0  = self.W.sub(0)
+        L1  = self.W.sub(1)
+        L01 = L1.sub(0)
+        L11 = L1.sub(1)
+
+        for cell in cells(self.mesh):
+            self.V.dofmap().tabulate_coordinates(cell, coord0)
+            L0.dofmap().tabulate_coordinates(cell, coord1)
+            L01.dofmap().tabulate_coordinates(cell, coord2)
+            L11.dofmap().tabulate_coordinates(cell, coord3)
+            L1.dofmap().tabulate_coordinates(cell, coord4)
+
+            self.assertTrue((coord0 == coord1).all())
+            self.assertTrue((coord0 == coord2).all())
+            self.assertTrue((coord0 == coord3).all())
+            self.assertTrue((coord4[:3] == coord0).all())
+            self.assertTrue((coord4[3:] == coord0).all())
+
+
+if __name__ == "__main__":
+    print ""
+    print "Testing PyDOLFIN FiniteElement operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/fem/python/Form.py b/test/unit/fem/python/Form.py
new file mode 100644
index 0000000..127ca81
--- /dev/null
+++ b/test/unit/fem/python/Form.py
@@ -0,0 +1,397 @@
+"""Unit tests for the fem interface"""
+
+# Copyright (C) 2011-2014 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes (meg@simula.no), 2012
+# Modified by Martin S. Alnaes (martinal@simula.no), 2014
+
+import unittest
+import numpy
+import ufl
+from dolfin import *
+
+class FormTestsOverManifolds(unittest.TestCase):
+
+    def setUp(self):
+
+        # 1D in 2D spaces
+        self.square = UnitSquareMesh(2, 2)
+        self.square_boundary = BoundaryMesh(self.square, "exterior")
+        self.V1 = FunctionSpace(self.square_boundary, "CG", 1)
+        self.VV1 = VectorFunctionSpace(self.square_boundary, "CG", 1)
+        self.Q1 = FunctionSpace(self.square_boundary, "DG", 0)
+
+        # 2D in 3D spaces
+        self.cube = UnitCubeMesh(2, 2, 2)
+        self.cube_boundary = BoundaryMesh(self.cube, "exterior")
+        self.V2 = FunctionSpace(self.cube_boundary, "CG", 1)
+        self.VV2 = VectorFunctionSpace(self.cube_boundary, "CG", 1)
+        self.Q2 = FunctionSpace(self.cube_boundary, "DG", 0)
+
+    def test_assemble_functional(self):
+
+        u = Function(self.V1)
+        u.vector()[:] = 1.0
+        surfacearea = assemble(u*dx)
+        self.assertAlmostEqual(surfacearea, 4.0)
+
+        u = Function(self.V2)
+        u.vector()[:] = 1.0
+        surfacearea = assemble(u*dx)
+        self.assertAlmostEqual(surfacearea, 6.0)
+
+        f = Expression("1.0")
+        u = interpolate(f, self.V1)
+        surfacearea = assemble(u*dx)
+        self.assertAlmostEqual(surfacearea, 4.0)
+
+        f = Expression("1.0")
+        u = interpolate(f, self.V2)
+        surfacearea = assemble(u*dx)
+        self.assertAlmostEqual(surfacearea, 6.0)
+
+    def test_assemble_linear(self):
+
+        u = Function(self.V1)
+        w = TestFunction(self.Q1)
+        u.vector()[:] = 0.5
+        facetareas = MPI.sum(self.square_boundary.mpi_comm(),
+                             assemble(u*w*dx).array().sum())
+        self.assertAlmostEqual(facetareas, 2.0)
+
+        u = Function(self.V2)
+        w = TestFunction(self.Q2)
+        u.vector()[:] = 0.5
+        a = u*w*dx
+        b = assemble(a)
+        facetareas = MPI.sum(self.cube_boundary.mpi_comm(),
+                             assemble(u*w*dx).array().sum())
+        self.assertAlmostEqual(facetareas, 3.0)
+
+        mesh = UnitSquareMesh(8, 8)
+        bdry = BoundaryMesh(mesh, "exterior")
+        V = FunctionSpace(mesh, "CG", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+
+        BV = FunctionSpace(bdry, "CG", 1)
+        bu = TrialFunction(BV)
+        bv = TestFunction(BV)
+
+        a = MPI.sum(mesh.mpi_comm(),
+                    assemble(inner(u, v)*ds).array().sum())
+        b = MPI.sum(bdry.mpi_comm(),
+                    assemble(inner(bu, bv)*dx).array().sum())
+        self.assertAlmostEqual(a, b)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_assemble_bilinear_1D_2D(self):
+
+        V = FunctionSpace(self.square, 'CG', 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+
+        bu = TrialFunction(self.V1)
+        bv = TestFunction(self.V1)
+
+        a = MPI.sum(self.square.mpi_comm(),
+                    assemble(inner(u, v)*ds).array().sum())
+        b = MPI.sum(self.square_boundary.mpi_comm(),
+                    assemble(inner(bu, bv)*dx).array().sum())
+        self.assertAlmostEqual(a, b)
+
+        # Assemble over subset of mesh facets
+        subdomain = CompiledSubDomain("near(x[1], 0.0)")
+        bottom = FacetFunctionSizet(self.square)
+        bottom.set_all(0)
+        subdomain.mark(bottom, 1)
+        dss = ds[bottom]
+        foo = MPI.sum(self.square.mpi_comm(),
+                      abs(assemble(inner(grad(u)[0], grad(v)[0])*dss(1)).array()).sum())
+        # Assemble over all cells of submesh created from subset of boundary mesh
+        bottom2 = CellFunctionSizet(self.square_boundary)
+        bottom2.set_all(0)
+        subdomain.mark(bottom2, 1)
+        BV = FunctionSpace(SubMesh(self.square_boundary, bottom2, 1), "CG", 1)
+        bu = TrialFunction(BV)
+        bv = TestFunction(BV)
+        bar = MPI.sum(self.square_boundary.mpi_comm(),
+                      abs(assemble(inner(grad(bu)[0], grad(bv)[0])*dx).array()).sum())
+        # Should give same result
+        self.assertAlmostEqual(bar, foo)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_assemble_bilinear_2D_3D(self):
+
+        V = FunctionSpace(self.cube, 'CG', 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+
+        # V2 is a FunctionSpace over self.cube_boundary
+        bu = TrialFunction(self.V2)
+        bv = TestFunction(self.V2)
+
+        a = MPI.sum(self.cube.mpi_comm(),
+                    assemble(inner(u, v)*ds).array().sum())
+        b = MPI.sum(self.cube_boundary.mpi_comm(),
+                    assemble(inner(bu, bv)*dx).array().sum())
+        self.assertAlmostEqual(a, b)
+
+        # Assemble over subset of mesh facets
+        subdomain = CompiledSubDomain("near(x[1], 0.0)")
+        bottom = FacetFunctionSizet(self.cube)
+        bottom.set_all(0)
+        subdomain.mark(bottom, 1)
+        dss = ds[bottom]
+        foo = MPI.sum(self.cube.mpi_comm(),
+                      abs(assemble(inner(grad(u)[0], grad(v)[0])*dss(1)).array()).sum())
+        #foo = MPI.sum(self.cube.mpi_comm(),
+        #              abs(assemble(inner(grad(u)[0], grad(v)[0])*ds(1),
+        #                           exterior_facet_domains=bottom).array()).sum())
+        # Assemble over all cells of submesh created from subset of boundary mesh
+        bottom2 = CellFunctionSizet(self.cube_boundary)
+        bottom2.set_all(0)
+        subdomain.mark(bottom2, 1)
+        BV = FunctionSpace(SubMesh(self.cube_boundary, bottom2, 1), "CG", 1)
+        bu = TrialFunction(BV)
+        bv = TestFunction(BV)
+        bar = MPI.sum(self.cube_boundary.mpi_comm(),
+                      abs(assemble(inner(grad(bu)[0], grad(bv)[0])*dx).array()).sum())
+        # Should give same result
+        self.assertAlmostEqual(bar, foo)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class FormTestsOverFunnySpaces(unittest.TestCase):
+
+    def setUp(self):
+
+        # Set-up meshes
+        n = 16
+        plane = CompiledSubDomain("near(x[1], 1.0)")
+        self.square = UnitSquareMesh(n, n)
+
+        self.square3d = SubMesh(BoundaryMesh(UnitCubeMesh(n, n, n), "exterior"), plane)
+
+        # Define global normal and create orientation map
+        global_normal = Expression(("0.0", "1.0", "0.0"))
+        self.square3d.init_cell_orientations(global_normal)
+
+        self.CG2 = VectorFunctionSpace(self.square, "CG", 1)
+        self.CG3 = VectorFunctionSpace(self.square3d, "CG", 1)
+        self.RT2 = FunctionSpace(self.square, "RT", 1)
+        self.RT3 = FunctionSpace(self.square3d, "RT", 1)
+        self.DG2 = FunctionSpace(self.square, "DG", 0)
+        self.DG3 = FunctionSpace(self.square3d, "DG", 0)
+        self.W2 = self.RT2*self.DG2
+        self.W3 = self.RT3*self.DG3
+
+    def test_basic_rt(self):
+
+        f2 = Expression(("2.0", "1.0"))
+        f3 = Expression(("1.0", "0.0", "2.0"))
+
+        u2 = TrialFunction(self.RT2)
+        u3 = TrialFunction(self.RT3)
+        v2 = TestFunction(self.RT2)
+        v3 = TestFunction(self.RT3)
+
+        # Project
+        pw2 = project(f2, self.RT2)
+        pw3 = project(f3, self.RT3)
+        pa2 = assemble(inner(pw2, pw2)*dx)
+        pa3 = assemble(inner(pw3, pw3)*dx)
+
+        # Project explicitly
+        a2 = inner(u2, v2)*dx
+        a3 = inner(u3, v3)*dx
+        L2 = inner(f2, v2)*dx
+        L3 = inner(f3, v3)*dx
+        w2 = Function(self.RT2)
+        w3 = Function(self.RT3)
+        A2 = assemble(a2)
+        b2 = assemble(L2)
+        A3 = assemble(a3)
+        b3 = assemble(L3)
+        solve(A2, w2.vector(), b2)
+        solve(A3, w3.vector(), b3)
+        a2 = assemble(inner(w2, w2)*dx)
+        a3 = assemble(inner(w3, w3)*dx)
+
+        # Compare various results
+        self.assertAlmostEqual((w2.vector() - pw2.vector()).norm("l2"), 0.0, \
+                               places=5)
+        self.assertAlmostEqual(a3, 5.0)
+        self.assertAlmostEqual(a2, a3)
+        self.assertAlmostEqual(pa2, a2)
+        self.assertAlmostEqual(pa2, pa3)
+
+    def test_mixed_poisson_solve(self):
+
+        f = Constant(1.0)
+
+        # Solve mixed Poisson on standard unit square
+        (sigma2, u2) = TrialFunctions(self.W2)
+        (tau2, v2) = TestFunctions(self.W2)
+        a = (inner(sigma2, tau2) + div(tau2)*u2 + div(sigma2)*v2)*dx
+        L = f*v2*dx
+        w2 = Function(self.W2)
+        solve(a == L, w2)
+
+        # Solve mixed Poisson on unit square in 3D
+        (sigma3, u3) = TrialFunctions(self.W3)
+        (tau3, v3) = TestFunctions(self.W3)
+        a = (inner(sigma3, tau3) + div(tau3)*u3 + div(sigma3)*v3)*dx
+        L = f*v3*dx
+        w3 = Function(self.W3)
+        solve(a == L, w3)
+
+        # Check that results are about the same
+        self.assertAlmostEqual(assemble(inner(w2, w2)*dx),
+                               assemble(inner(w3, w3)*dx))
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TestGeometricQuantitiesOverManifolds(unittest.TestCase):
+
+    def setUp(self):
+
+        m = 3
+        self.m = m
+        self.cube = UnitCubeMesh(m, m, m)
+        self.cube_boundary = BoundaryMesh(self.cube, "exterior")
+
+        plane = CompiledSubDomain("near(x[1], 0.0)")
+        self.square = UnitSquareMesh(m, m)
+        self.square_boundary = BoundaryMesh(self.square, "exterior")
+        self.bottom1 = SubMesh(self.square_boundary, plane)
+
+        self.bottom2 = SubMesh(self.cube_boundary, plane)
+        line = CompiledSubDomain("near(x[0], 0.0)")
+        self.mesh3 = BoundaryMesh(SubMesh(self.cube_boundary, plane), "exterior")
+        self.bottom3 = SubMesh(self.mesh3, line)
+
+    def test_normals_2D_1D(self):
+        "Testing assembly of normals for 1D meshes embedded in 2D"
+
+        n = FacetNormal(self.bottom1)
+        a = inner(n, n)*ds
+        value_bottom1 = assemble(a)
+        self.assertAlmostEqual(value_bottom1, 2.0)
+        b = inner(n('+'), n('+'))*dS
+        b1 = assemble(b)
+        c = inner(n('+'), n('-'))*dS
+        c1 = assemble(c)
+        self.assertAlmostEqual(b1, self.m-1)
+        self.assertAlmostEqual(c1, - b1)
+
+    def test_normals_3D_1D(self):
+        "Testing assembly of normals for 1D meshes embedded in 3D"
+
+        n = FacetNormal(self.bottom3)
+        a = inner(n, n)*ds
+        v1 = assemble(a)
+        self.assertAlmostEqual(v1, 2.0)
+        b = inner(n('+'), n('+'))*dS
+        b1 = assemble(b)
+        c = inner(n('+'), n('-'))*dS
+        c1 = assemble(c)
+        self.assertAlmostEqual(b1, self.m-1)
+        self.assertAlmostEqual(c1, - b1)
+
+    def test_normals_3D_2D(self):
+        "Testing assembly of normals for 2D meshes embedded in 3D"
+
+        n = FacetNormal(self.bottom2)
+        a = inner(n, n)*ds
+        v1 = assemble(a)
+        self.assertAlmostEqual(v1, 4.0)
+
+        b = inner(n('+'), n('+'))*dS
+        b1 = assemble(b)
+        c = inner(n('+'), n('-'))*dS
+        c1 = assemble(c)
+        self.assertAlmostEqual(c1, - b1)
+
+    def test_cell_volume(self):
+        "Testing assembly of volume for embedded meshes"
+
+        volume = CellVolume(self.bottom1)
+        a = volume*dx
+        b = assemble(a)
+        self.assertAlmostEqual(b, 1.0/self.m)
+
+        volume = CellVolume(self.bottom3)
+        a = volume*dx
+        b = assemble(a)
+        self.assertAlmostEqual(b, 1.0/self.m)
+
+        volume = CellVolume(self.bottom2)
+        a = volume*dx
+        b = assemble(a)
+        self.assertAlmostEqual(b, 1.0/(2*self.m*self.m))
+
+    def test_circumradius(self):
+        "Testing assembly of circumradius for embedded meshes"
+
+        r = Circumradius(self.bottom1)
+        a = r*dx
+        b = assemble(a)
+        self.assertAlmostEqual(b, 0.5*(1.0/self.m))
+
+        r = Circumradius(self.bottom3)
+        a = r*dx
+        b = assemble(a)
+        self.assertAlmostEqual(b, 0.5*(1.0/self.m))
+
+        square = UnitSquareMesh(self.m, self.m)
+        r = Circumradius(square)
+        a = r*dx
+        b0 = assemble(a)
+
+        r = Circumradius(self.bottom2)
+        a = r*dx
+        b1 = assemble(a)
+        self.assertAlmostEqual(b0, b1)
+
+    def test_facetarea(self):
+        "Testing assembly of facet area for embedded meshes"
+
+        area = FacetArea(self.bottom1)
+        a = area*ds
+        b = assemble(a)
+        self.assertAlmostEqual(b, 2.0)
+
+        area = FacetArea(self.bottom3)
+        a = area*ds
+        b = assemble(a)
+        self.assertAlmostEqual(b, 2.0)
+
+        square = UnitSquareMesh(self.m, self.m)
+        area = FacetArea(square)
+        a = area*ds
+        b0 = assemble(a)
+
+        area = FacetArea(self.bottom2)
+        a = area*ds
+        b1 = assemble(a)
+        self.assertAlmostEqual(b0, b1)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing PyDOLFIN Form operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/fem/python/LocalSolver.py b/test/unit/fem/python/LocalSolver.py
new file mode 100644
index 0000000..3cdb1f9
--- /dev/null
+++ b/test/unit/fem/python/LocalSolver.py
@@ -0,0 +1,59 @@
+"""Unit tests for LocalSolver"""
+
+# Copyright (C) 2013 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-02-13
+# Last changed:
+
+import unittest
+import numpy
+from dolfin import *
+
+class LocalSolver(unittest.TestCase):
+
+    def test_local_solve(self):
+
+        mesh = UnitCubeMesh(16, 16, 16)
+        V = FunctionSpace(mesh, "Lagrange", 2)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        f = Constant(10.0)
+
+        # Forms for projection
+        a = inner(v, u)*dx
+        L = inner(v, f)*dx
+
+        # Wrap forms as DOLFIN forms (LocalSolver hasn't been properly
+        # wrapped in Python yet)
+        a = Form(a)
+        L = Form(L)
+
+        u = Function(V)
+        local_solver = cpp.LocalSolver()
+        local_solver.solve(u.vector(), a, L)
+        x = u.vector().copy()
+        x[:] = 10.0
+        self.assertAlmostEqual((u.vector() - x).norm("l2"), 0.0, 10)
+
+
+if __name__ == "__main__":
+    print ""
+    print "Testing class LocalSolver"
+    print "-------------------------"
+    unittest.main()
diff --git a/test/unit/fem/python/SystemAssembler.py b/test/unit/fem/python/SystemAssembler.py
new file mode 100644
index 0000000..3b7cbed
--- /dev/null
+++ b/test/unit/fem/python/SystemAssembler.py
@@ -0,0 +1,314 @@
+"""Unit tests for class SystemAssembler"""
+
+# Copyright (C) 2011-2013 Garth N. Wells, 2013 Jan Blechta
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Marie E. Rognes 2011
+# Modified by Anders Logg 2011
+#
+# First added:  2011-10-04
+# Last changed: 2014-05-28
+
+import unittest
+import numpy
+from dolfin import *
+
+class TestSystemAssembler(unittest.TestCase):
+
+    def test_cell_assembly(self):
+
+        mesh = UnitCubeMesh(4, 4, 4)
+        V = VectorFunctionSpace(mesh, "DG", 1)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        f = Constant((10, 20, 30))
+
+        def epsilon(v):
+            return 0.5*(grad(v) + grad(v).T)
+
+        a = inner(epsilon(v), epsilon(u))*dx
+        L = inner(v, f)*dx
+
+        A_frobenius_norm = 4.3969686527582512
+        b_l2_norm = 0.95470326978246278
+
+        # Assemble system
+        A, b = assemble_system(a, L)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+        # SystemAssembler construction
+        assembler = SystemAssembler(a, L)
+
+        # Test SystemAssembler for LHS and RHS
+        A = Matrix()
+        b = Vector()
+        assembler.assemble(A, b)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+        A = Matrix()
+        b = Vector()
+
+        assembler.assemble(A)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+
+        assembler.assemble(b)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+    def test_cell_assembly_bc(self):
+
+        mesh = UnitCubeMesh(4, 4, 4)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        bc = DirichletBC(V, 1.0, "on_boundary")
+
+        u, v = TrialFunction(V), TestFunction(V)
+        f = Constant(10)
+
+        a = inner(grad(u), grad(v))*dx
+        L = inner(f, v)*dx
+
+        A_frobenius_norm = 96.847818767384
+        b_l2_norm =  96.564760289080
+
+        # Assemble system
+        A, b = assemble_system(a, L, bc)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+        # Create assembler
+        assembler = SystemAssembler(a, L, bc)
+
+        # Test for assembling A and b via assembler object
+        A, b = Matrix(), Vector()
+        assembler.assemble(A, b)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+        # Assemble LHS only (first time)
+        A = Matrix()
+        assembler.assemble(A)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+
+        # Assemble LHS only (second time)
+        assembler.assemble(A)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+
+        # Assemble RHS only (first time)
+        b = Vector()
+        assembler.assemble(b)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+        # Assemble RHS only (second time time)
+        assembler.assemble(b)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_facet_assembly(self):
+
+        mesh = UnitSquareMesh(24, 24)
+
+        V = FunctionSpace(mesh, "DG", 1)
+
+        # Define test and trial functions
+        v = TestFunction(V)
+        u = TrialFunction(V)
+
+        # Define normal component, mesh size and right-hand side
+        n = FacetNormal(mesh)
+        h = CellSize(mesh)
+        h_avg = (h('+') + h('-'))/2
+        f = Expression("500.0*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)", degree=1)
+
+        # Define bilinear form
+        a = dot(grad(v), grad(u))*dx \
+            - dot(avg(grad(v)), jump(u, n))*dS \
+            - dot(jump(v, n), avg(grad(u)))*dS \
+            + 4.0/h_avg*dot(jump(v, n), jump(u, n))*dS \
+            - dot(grad(v), u*n)*ds \
+            - dot(v*n, grad(u))*ds \
+            + 8.0/h*v*u*ds
+
+        # Define linear form
+        L = v*f*dx
+
+        # Reference values
+        A_frobenius_norm = 157.867392938645
+        b_l2_norm = 1.48087142738768
+
+        # Assemble system
+        A, b = assemble_system(a, L)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+        # Test SystemAssembler
+        assembler = SystemAssembler(a, L)
+        A = Matrix()
+        b = Vector()
+
+        assembler.assemble(A, b)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+        A = Matrix()
+        b = Vector()
+
+        assembler.assemble(A)
+        self.assertAlmostEqual(A.norm("frobenius"), A_frobenius_norm, 10)
+
+        assembler.assemble(b)
+        self.assertAlmostEqual(b.norm("l2"), b_l2_norm, 10)
+
+
+    def test_incremental_assembly(self):
+
+        for f in [Constant(0.0), Constant(1e4)]:
+
+            # Laplace/Poisson problem
+            mesh = UnitSquareMesh(20, 20)
+            V = FunctionSpace(mesh, 'CG', 1)
+            u, v = TrialFunction(V), TestFunction(V)
+            a, L = inner(grad(u), grad(v))*dx, f*v*dx
+            uD = Expression("42.0*(2.0*x[0]-1.0)")
+            bc = DirichletBC(V, uD, "on_boundary")
+
+            # Initialize initial guess by some number
+            u = Function(V)
+            x = u.vector()
+            x[:] = 30.0
+
+            # Assemble incremental system
+            assembler = SystemAssembler(a, -L, bc)
+            A, b = Matrix(), Vector()
+            assembler.assemble(A, b, x)
+
+            # Solve for (negative) increment
+            Dx = Vector(x)
+            Dx.zero()
+            solve(A, Dx, b)
+
+            # Update solution
+            x[:] -= Dx[:]
+
+            # Check solution
+            u_true = Function(V)
+            solve(a == L, u_true, bc)
+            u.vector()[:] -= u_true.vector()[:]
+            error = norm(u.vector(), 'linf')
+            self.assertAlmostEqual(error, 0.0)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_domains(self):
+
+        class RightSubDomain(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] > 0.5
+
+        mesh = UnitSquareMesh(24, 24)
+
+        sub_domains = MeshFunction("size_t", mesh, mesh.topology().dim())
+        sub_domains.set_all(1)
+        right = RightSubDomain()
+        right.mark(sub_domains, 2)
+
+        V = FunctionSpace(mesh, "DG", 1)
+        v = TestFunction(V)
+        u = TrialFunction(V)
+
+        # the numerical answer (initialized to some number)
+        x = Function(V)
+        x.vector()[:] = 30.0
+
+        dx = Measure("dx")[sub_domains]
+        # the forms
+        a = v*u*dx(1) + 2*v*u*dx(2)
+        L = v*Constant(1.0)*dx(1) + v*Constant(2.0)*dx(2)
+        # test cell-wise assembly
+        assembler = SystemAssembler(a, L)
+
+        A0 = Matrix()
+        b = Vector()
+        assembler.assemble(A0, b)
+
+        solve(A0, x.vector(), b)
+
+        # check solution
+        x.vector()[:] -= 1.0
+        error = norm(x.vector(), 'linf')
+        self.assertAlmostEqual(error, 0.0)
+
+        # now give the form some internal facet integrals
+        a += v('+')*u('+')*Constant(0.0)('+')*dS
+        assembler = SystemAssembler(a, L)
+        A1 = Matrix()
+        # test facet-wise assembly
+        assembler.assemble(A1, b)
+
+        # reset solution vector to some number
+        x.vector()[:] = 30.0
+        solve(A1, x.vector(), b)
+
+        # check solution
+        x.vector()[:] -= 1.0
+        error = norm(x.vector(), 'linf')
+        self.assertAlmostEqual(error, 0.0)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_facet_assembly_cellwise_insertion(self):
+
+        mesh = UnitIntervalMesh(10)
+
+        c_f = FunctionSpace(mesh, "DG", 0)
+        v = Constant((-1.0,))
+        dt = Constant(1.0)
+
+        c_t = TestFunction(c_f)
+        c_a = TrialFunction(c_f)
+
+        n = FacetNormal(mesh)
+        vn = dot(v, n)
+        vout = 0.5*(vn + abs(vn))
+
+        # forms:
+        # a has no facet integrals
+        a = c_t*c_a*dx
+        # L has facet integrals so we end up in facet wise assembly
+        L = c_t('+')*vout('+')*dt('+')*dS + c_t('-')*vout('-')*dt('-')*dS  + c_t*vout*dt*ds
+        # but have to use cell wise insertion because the sparsity pattern doesn't support
+        # the macro element
+
+        A = Matrix()
+        b = Vector()
+
+        assembler = SystemAssembler(a, L)
+        assembler.assemble(A, b)
+
+        x = Function(c_f)
+        x.vector()[:] = 30.0
+        solve(A, x.vector(), b)
+
+        x.vector()[:] -= 10.0
+        error = norm(x.vector(), 'linf')
+        self.assertAlmostEqual(error, 0.0)
+
+
+if __name__ == "__main__":
+    print ""
+    print "Testing class SystemAssembler"
+    print "-----------------------------"
+    unittest.main()
diff --git a/test/unit/fem/python/aneurysm.xml.gz b/test/unit/fem/python/aneurysm.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..7660eb8bf038d0b7eb3e781618527e0bc2d844ba
GIT binary patch
literal 703208
zcmV(&K;ge1iwFQ6^h!|x1ALWRZsRZvMgM0Nh8Lic6e&_g)2?NZxYG>Mq)3eEWA&rh
zru=2)BXA&{+{>q*UcTN>-M`^_J6_Ja9s~3*&%d4ym(%O<+?BKQ?Q#CG>)*!l<MH9)
z^Yb&j4(H?k_Hn)Z9rk0mT>tdXzq;<}eYm}K`{8sNzdwduKMv#d_uFu|Ue0}YIKJ=t
zINd8Zi{g0P54Y}i{3$mTA}&YE;qcWR&xhe_*F)cxZ;>D>+IQdO83Qq=zWdqrIRIp|
zzI)if(Qy-|8HbQK(}Y`jw3xPWay$vFI0!B30x9t}9%noSCQK8~7Gjc##uzY3!#mHk
z2B27BS|UdZ8C14uaqX;9wUODig`p96s)0wRbI4H_@f4J-A+BrQkUejRTyapvZQL9u
z0(Er;7RQUJ2A*e}LpGk(Swe(3t5Zos`80Y4oL93Y`0^Z=s*?ueR@D)mXM<dMQgQt#
zNDZEx2eKvn6eNL7e8hnH{=b`ibl$R7USp2V3vtUoSKh04*Duwdc?b&D;+NK=5<e~R
zQ^2VWXZ<Xs4L&)a6z8eq!kDf8QCl;w&Z~O<ur#vrs;`aSM{^!6vHK@k+V8Hf)QUf^
zJl6P&=c;cpH|kH|gU@UFBw{T;r`(u5!n!wdl$!py+6RRePgS0M`tGG5^YZ81$Ua5K
zi_4llC8*VBjj_Qm-B<Pnn9Y1FohUf-B^0(s_t4yZWnqwUaz2qb4yiFal$=)b-YdH@
z#prl((sHl9cFXGuefO9WIWHMn?yatETV7a&Png(wp5}Oy&y{Da`l?j@V_JLvKjYPQ
z-B1j|R>Hj5f3cGEBIhIJbO0T&5EA~9SkRvE#d}@)lxj;nh>uNxZy!YeP0LpQ5nu19
zL;ER@bvHbGL(6O)iDG(6eA%mwJyGC`pdHeR!832kAvbi7VR|Nt`d+lL=fKNozmrRE
z|5>@cKZgAi62Qx>ZrAtiT9U-{8146qA)W}`$``~FV|-oSKBgDBET2MrqzXJm0bhNu
zE%--#^;!~}@wND29q|_OpLia;*92dO@Ojv8AK>j+R6%)~_NDiLeejyLs7G<|^-&4+
zc7)a7Nw(>!4L-+syJa(ow_|S+zxu$-1;*R0pnYDgLt%ZL4>9a@)Pp|WszZ80W4w+2
zAippD4G--l*_|C}pt{<!dIs&e-uk`y_w~HhHyEFm;O0ByyM62HmK%o9<x-HRVrc)A
zFE@k9eg17fT<m|^HE8b;oxyva`+Sp)z7OYfIEN9+^Cms>t6WBPp-OCyZ5O9q>7{}F
ze9Q0`@4hUKJ=*J!0S?aImO<<5l336+XwLbl@rwqmt>t#FIgM>JUy01)Q&V1OJJ%h`
zb1t|hSMuP~>$~gz@L_F9f`lOKMpG)t<7j*PMJ4q73<pTjtsy3P_=WEuq7|3I;^+K$
z{;v=H6HmZz+4@<IUGrT!!zPb<2jluwoBUi}UcSZ}b#X`1@X5~_#K4EmN_>!Fbe2m5
z^JDV__{ETIJ=H@a+oHg4tlq)9BtGI^r`lrp{4iEYz7g9x^7!Iccz3_=z^e=@{Dxya
zvArX|4&X(RR>zN-Pv9qYVOuBgb|3eLpKHDC;ZwJCj$0r7_z36X!aEm!QrB~6l`KlL
zv|~x;jli$98|BneKAQAPxglL~e%?7=E#<T8O;fw>%IE#5cjqTq|GB@mAsFxYex~l(
zRW14OJ<Icw*Z+H)x72_S&XsAR?ce#g6`3ag;+r*JzQdW7Y4<oF>hLyzU&xDReQZAd
zg%on<IW6fI63-<bBjeTyo~+I8+xq%JLQ|kK9oJ3$)|{OY;7nA~Jz+Y|GjNUUpLnjG
z%r|{aL8h%Ue{|YmDSgNl|E}Cb)_&4=3{;y}OmKK(CU*iKE;Z+eq;;!f3OL&aT5hNL
zrkix0#UAtSZ9{lt3$Kd3=_*}MW)8f$zSF0pVqnhc{5sd+19&1O;CYY2M~3e3RW7s1
zgmOhZ|K@AQ9xw8_!Ze+h6y%N5x9;KdV&5KG$~i3i<@2KO>S|K{&zBV)Pz*!Bm531b
zU+mE${doq+H9<Ldt&;*Z?diei9obli>NEaSKVG4Tcb%t2L;g&z&Im13Es#DBG&FuY
zEz?R4t|$e_!L^-_joH(iz17D_>+4R3#=dV>=V7t-`GtL6&-C*+&o16%VkweS$fR%j
z<nbIv04xB}Bz_Lysd&3rY~h=E0_c4gI7eTIu9QM`r~ovD0HJ5E?35ZALbWV_?cJ9q
zfPIH2H-N0<evV5xO2xoea?o~Y=pn4n4ZN@M_ynmSZmk$ls7xzwpnFY{3qtQ6sJZq=
z8f*25t-yG68@dn=;HfO^?BQO9sxW4;3sIpwt`NGkJTCJB9qkIZW>5Zy;jwY<KN_3!
zn1nJsB$%?+4HVCN1AL_1$*?HLLt+JK09t|tunDGL0k6|`kUIvPmW2b@#DNgI4vC6{
z`Zl;ShDd&XjR4&X&neM7+{Hufw~g8lVz0nJMdMHCAL)5Hr6ib454_4V6p!?k5Ysh5
z_Q|4S7F&8IkiLOWlU+BEXUzNuXbFZ_@_}IWf^FOFJ%!-<9=NSv;OuwR3y#?Ig6n+f
zCj?rn0LC9Oxt4gXk2l?EJgR8Dzy!u8Tp4Cr8=vrXE}wt&KR|CITT%fI07?<f0aVTy
z1HM91twUZ@n%g*rE7a}mN2r-4Nf3fS^hO=Bx!nI^jg}-IGesXjqNEhaeEzpStr(4=
z;24r4*863v?lO<GBjPHJPv9S4KV_9E#4&6j7+#QBpMSu%<$QG&6M-1~486?j3BarJ
zV<;Gi-=t~qaYN5@zjfh#J<8!@eP8|>lLd!bcn^TV&?pGt21+y{fRr{q2`0luQA{?$
zy`#n60+o$jfPlM(lkNhq-(tevmD(tCU|`smerRi#19<?oN)=L|kd6Kbve^FzAo>Hf
z-UDDfRF<B$*44$lTpCus1_cb+7JR~#KEl`8CPmrR1n&^iR_xwaZ$0z?e9ZZG4&MNh
zg#fbWOcLzZwK@j@L^eXZeRT(buj*})%4!fq#K&?OV8NC=s+9Jmk|aNf2<>A89LMED
z2GzeLo<2%RGne)<gLsM{AUd7^9l)_lWk*nqhb^YN?PwfB_<q5nG6e(fu#F^|oK!}B
z90Hirt`hMDu8fiiwn}AEk`XzL>^aAD5_h-2R&Bvh52xmPn!!QjWml8xHyVy%SA#|A
zIx)ePm9tIK5pTbs$}MDqoR?JPixl)_(FQiQ&Zu_zL@OJ6@)4#9zCttckZ}1X#L$;L
z9iVHA1^`iCm0YD{B(Bv!h}hc79B`RLH0D9KF@O0qvm*gQ5DI3rB_4qJC$`{l?9aXc
zbaV<8y7}aCX$nSil-iQ)G0HRSn>+B#72b#E_5!-MVP$Hv?1_W4jJOg+={U4hvq1em
zjCRnb<ZLe7W{aLl>WSf5Y*j+Sr>+wU;^pj(Cpt=8aX3X9xy*#kcF3V+q?9Fgoye4;
zt)fNy&xEg9+7h=lQn>c$sx90N{~_miswd?^C#eO%wnXA~b?X%M;hS&L^;{9|pj%{C
zV<S5sB}`tj`v3UO4^Q`)B(-ydw2*J16eeCINc*O}$~O=k-o^6ZqGpu&?SA|Og@AOi
zyeou8RH_z^OJH+j`w|-c|D6%!_hrHKIE0BO<@YwWE#^*EEx<z%#>ATwlG|A{ofIAp
z;9;>I#>DU6+1yxZlrgy%=GRgoxG8f>`)?|mE6}mw3N*R<*U1=L7~IYR+IC85vb?*7
zatk)7Ca?zsMNwLlhwEzmIpsZA;W18a;!m<h5I+H`$(}bf9~9<fzo)n0xjo60@Lw*x
zOT(Rb6ufT8Z-V)kp05GBG$Rg&mBf*nxvO5$ui_Qcg%?5ElksCa(3;?eIeqLx(NPM0
z@)Y6j2_idoBg!zX(Q1>nGOudwnMIa&O~O(;1j+;G-RNsop5_Dt2f;7jW^^q<2*S{o
z1ay?rUiVKN3G=flK#%LJN|Fl%%CcUdZw4qDup_OG9nRs=^cPxbx3<+F7id}LxC?ig
z3sPFrINTFFD(n+hgz`)=R8<RJfpE8^A{6bbSl2XPdstQ!_4b|?`Wy`lNaHfthvO~&
z9zSxtX|D`rrO1q5z;^%w<;nOx<Wjo_If`7N?~x-vZn=Uz!C0BX?IO1`=uRAU;Tt#n
zU3~M(gC3SFHE+EDnwBch<3*Zj+dV>o<w{ai2W&f?x2}^Xk|2gG-y|h6AF&T{UOIE=
zq$|*zz)pO2KjZjdvqr~Tj_+-0DSZX8PP<epMiC#V3O&)k9+nj|-L#=9T=HR%dJ3!%
z8iOM1C<|L}1+Bv@iCzZEP2U*h>|hxU>0Td*snab$in3B6?tir397y)xK_B`Byn1y8
zCeRaX-w6ggh$>LY&2k6!sh;Ed@1YHtQ=pZih)s0t^gM_fAjhKIKMKQT4IzfwE$wxe
zIKnP7trTU#E!jF@=5?G{(eDYWb3}_`w3)8oN%!d{!ZzI3Rxbp$q4j1Ch7_p4HdL%Y
z0>G>03FpldAC+7XZ4wz4DW9>EB;Z(G{G%=mG~L@s^m_vTL<l$uGwtiWf<aStRosTl
z-0CuWATajx^u7rHd|O=_!ypK|l7d*h|HTF!guN^WsGn^WLVo@%0A2Y?-{ooL=$gUC
zv2P$4ll4BRW_wmgm~lnuE5K4XFyqX?gBTHxu;iSSj1s4}3;HQfX6)u+eOXFIIe|{w
z8MGAuTNh(aMUbHLHex+zp9YsIG==lD9H;OntX*?rg!yPeY9YnJ6*7Ezlf0hoqx2MX
zLA06^Ls>sfSSjskKQhYd1sq$!jelNV{r>`>Yre{5IupTs`VI!)fwU-_r@#w?Ra0=(
zDtFK*6X4-4*3TDMQWJvzPbz7Ow!v#;pd`rnr7L$Z2gOFB)|6FhQC=KPlI*bHvY99=
z+IrrTLryqmWYjm9o7yWyaSqRWc)ttmjW=+>L;oTQ;+bjBeN~~vR+05kHff4BJbce|
zIW#6rCgW}zC~J5)FA(m{rsNmF7X1PX^-y-XT%x~}!Q(MHq{sq$ZPpeOE$Y{i#iV&m
zS<PP8{x#Ln_j#XpXfa!WhXQ}bh(ITV^|P4{BMTl^k<Rn#PylSZe1Ud1JR3XkkxQYA
zPYUlA+Ok@~vv6qTu<y|15t{4!$(MjN^x{4*>fyagKO*WO%zAz$Zq3Smrzo=Ne91V5
z=XGT$H#A+N@UR0W4(_mkoNQ^n0W(HgNsB0O`+fL0qb!L*5C~pLK|t<*v6ZZ}`?Gz3
z<e5wckt*==LoZORV>7b_#hz~HDX&_fNUa84KSJTktLW4VZ~;y|frPIAwV0quq}0a^
zfDw!4hKAfwLr}f9o+VIaZ2Aq_>nq09qXnI+8!sBl4Ltcoa_FA6y3Zm@x@U379#2Nm
za==$StEXMba_LDiY(qj4(~*?Lpda9+C!Z9o`yDbTMDY~59bbA<R`Q-e53UO<&`AUF
zr6<2y_J(jgI;*Q~n!ke8H!vIUomC7KJK>v|qjWv|%Ko1++`_mQCubRj!?@n5aF){?
z#`PXSe+4+#YPa5_Urdu;f%22OqjtS#8}lb5xT55>l~!9GKgqll?ZomeF?%;zbR>tw
zcmzW2$#$1So^$FB+F{-Zr5gDY2m|JCHP~;O*9E$a%@Ry~`g{`#c(tG*%Dm+49@1Pe
zq9Eyb4e73vZx#RwM)vhq|K1>U(?>8+s5Z^MLy7*u!TcqnVzcbQ&<qFFS5`Wec+qer
z?DN&;ZH43SZ}I;PFlIr<JEIK?Kz*m$sWe2%LYY93;)%vHolLfqhA4USfEM^O9ulXS
z-K8jH=$Ye$60hy>Y^m%w==PIwvgkjf8Zay2MEVu<2^2S&4HJt1_T_8PkLZVxbIWod
z1cB(5Py}WF8=IzEtNaPG0CUWV;c+Qy!E0dzV979Ji)Uqrw(Nq>px2*ZdQ-bO$_s#A
zKY0wOLG`?W979z#$-2}voaKIFn|)r&NU(qngOUQjH4U@;A1{cnyEG{6`p$_@XkT?S
zz9uNmpi&D60%mHmtCY4!C?idg&OASbvK?bIE8F}%L3wHO!uhAk#(D85FQE8<IQhg9
z({YPO%Rsb8DEacba*j9mZ;%;H%EF3!D2_#nR1|EDR<i3+_E&-KWFC{L*ET{y@8>@^
zV0RJ|z7ZWOz;AM@&M#_axx?4z0xB^nb8-+G`k+WGCNA);RsFX8faj6<2_&AN5btnk
zRa&VK)>ub0x470YOX{dXjaR2s&rd>(ZJ_h}JelF>IR9y-_64kpr7DnkeSRYwpC55g
zD)3{J-@vF9^vmuGU3T*do2uX$j(N~=Qj>-ckgB#+q5Fql0<E<}LDKhD4a8NbteFCV
z*4o01o~B==dkJSKu8wFLPI^CDRT5|u(k><YZlQF*s0Ml3*d*)XA5lbUV^G`I^iv%-
zY6{{EFy4;c%JWoS%Z`Sxk5?RGxNKF<XWH-z%~>2jHNC?$ZdOZ?%1xAZh+%?`?${vc
z{kTv45prz_4uc@@N<mQJ{uf(G!;p`5_5g9)u2JUseE~4n6F@z67XjJx33vZq;B9L_
z3?uxxQZmCpz290I%6a|g?xWyE6?{0{-wU9D>qGE9>^+=@$u%&js->YwhCi?o&q&_@
zVKL%Y2Ox@F4(GEkgQ9zm2=*fmK$LBxM?<MT6Ujn2`V|0C&R;@`LF-z*F^<wt(AEZM
z+F2X8;x(MIm$5Yzjd&ULstYP{FaHXi&07J8GNNGG%CVc>Y6IQ|@y=K4R%mI9TFvy)
zP}0>R8(?`=D@@u?HybT<ARQm06WSt<jP&F`qINu9t6jn~4%a>_r}v^_K-~T~RL%nP
zYL^nHEL3qMUPIciSN$Nj&54CPwN;ceQFXBFK}o49Q+I~8h+?MTeygBi$kY4r`+1y*
z(>j}HwF^d~R{A^|8XT#xY%2)wf)F+ys$v_?BEIf&pSqR&pP;xZIvN~ho(ErxpkhRv
z?&H!>lCSeFMvH1!%E6T$$p)OV@gLkP;8Z(@89NS5I-mJyICeKRZ7jg74Qfptc14W2
zL5*eOwVJl8z(JiK$gdRziZ$s1*nu*=D{jD@M+RBg7H$DWW1?i^yh89QUQS;^Tdh6-
zXnXNZ>2>6f_h>k}lrjGJIJYcCVi<<*XpSF=o$P;OgP|<fPip}Lnhq63lCK;*1msdI
z;5uXek5h5ceE)ofdgv#ZuHjM`UJ$3{yBKrtePahMbNmT%6TRi1hxzvcgC<1PuBK3)
z=g2Am3sn`{rZ~Q4j0NuTeWn8bUcg@|*Z>=>Tf0R9V5BMEGp4*}xYH4%RUAxz#+{*P
z@j&4hohuMVpQ{UdkaUKk|3nqKX4}S0TkcK21K5VPC)AJo@~jr!i5ucDL*6rCs9c&E
z-ADi?eICGwAuc+fh1X@SpU)UdnE7;sqEBR{jK$Ci)DxHeXy!^C^i&napyC?4Qo`;Y
zy#Fy)TlPTB>-T^A<;k~|VIfrbB`Ma+G{XX(PmmTRkmx>+{hE-SV#X0f`Wp177`USx
zKRJ=Ucd1~R(gP`Sq@^Lm=t#Yg2bY4qV_FUCiPYD36Zx~i3JP8GfMau4f_!0d8eEYS
zTILg?m>9a>A&EKdt3pwspx0br+v<2~WI|Cz*voB1SxonQ^(F61jbPh2LCX}0kt7Wt
z@h^jweu5c=Qket6o<W?CxOW;Td!qE3G7*Z&n9sr8hK^85%x;`%rc>TtRMsWPagnAo
zOV#;9$#kU)%&Dw%&xK=_6ddMx|MPW5Ns_}L48747G1$QUFE&fYNckBK&|RIRgRvx@
z@elZ9&l^8firc9EYd|v$C$d8Fs+MnKKk7{ZP<onufe&cx&!k;zFwp@2CjYgA^?C}^
z-3vlP_yX#Ec*Sjr`PUPfnSl}_J&NZqWqgF~ZU*Gm!?m<0u_`7xY6Qf0Ee+V&ve;D4
zf@2`sC4LYr3bCf|$TPOZ!Q?-ZSv8P^TbO&y)F|B(v91Ae$968P;+gCdrF~+`GQ0_!
zSZgvdH8Gi-uUmQ%T)v@kn2v8?BKYr4_~Z7(#_G((>O}J2+XAd^1P)T=;m3!VD1&<$
z+L`qnjFhU3g_t8K#xi;uSyE*rN8vuPJwBh!>57e9i^d4ezV68{HIY})Hfl+Kb4z&b
zlL}RsL!pSnXiH{}UyzL6+vXHcavJU>{QM2BmQPTW;P8dd&$$wlhYTqH5@-<%Ntp&X
zOc1$_o}sCrY2z{~D(55mTDTlHim))~O(Uz#x{aSlHO!`<Ry5!t!fEfxKr)iN+_ANZ
zed7eH*2QUqX~G?{I8>h8edb7(>O5Wnd2+6xuKZu5y#sPbM}D>h&kbQhPy4)=8ixxR
zA0iJf$%L8g*2t1#kxv$uk>n-FWR%L<4o>w~--`aj*SX*}48t(=MuYW<EnjV?-_+V<
zfnhvA-869>eaNT33m9Rf1Oi@3$nU$kN`AkCWjm<Ipv0~HRYNWSQ)o;OB_I3^8kV8n
z$!W+;Vh}ho>%LOscXOziFh9B{McqGOzAq%W+{Wyl*oQgY9G{mphBVlqHek{XEaB{w
zm`ft?3!0W-AJ*aI>Qs5jTex8bD`xn<htZ3sTFL3eh2RRhD_m&*r1bEl<1ma`oE~&G
zfpv&FCB>ikB%hl>!AbD#)eKk9(CG@T$<T1z+@=-$s^FN;I?V!@ag7Tm?Gwu69e4<4
zJnrn4nvKKMZOK;YTQJF%Jgw-b4K&Ah(3J~mok+S*Y~RpuG&*eGxm#Q12I&k9FO~V}
z+R#bR%{5sz9ism=oE)^X2`#=PWFlkGlRBLkHN)4(qvYZl*n<xW=3P}NoTMSyv>6=Y
zv{*2$H6cfMKaKwv;1nkxPA+qiGa(H`8A&966a{*dc;3_t5Lr{Kcg}fTSTCrW{0R^=
z%rKzA-;J=-yOL)q$C(6lIeh_1Jn`Q0A+Sml^rw3v!E#qsqU1o69UoH>)`I3bOU1^?
zi6$Nk9JR+bVH;CP6f-HS0dA#xPXn-xl+&0potlnfiQsiGe*f@wWyg-gFs!2;9Uvw3
z-`GZp3Haxs0Z-yEqDWjni7JNu1hbYL*`O^+FANnooyew|fR_St{658t$wHoCV@<%G
zOzh-}BWvY7!iMO94f%7im2Lu+<`&n%%f5hBBuUvUe_gv23)9`60bol$XT3E3LE*yg
z!+r&V$gM2$zed|fb)0U*!-JjNKVRAT-FwwbAKtcY$?;|xCQ;}npM<^bSrQ7FkUsvL
zdWTmMV9(>2(q70bdo*xa1-EfVAt%>!hT4T)X3gJ$*`~{cd>W*W&z1ZirwxKc(6go$
zPxM+X^~uAyH@CEhB2HvA-p}hKv>-l&nw+f~>`*S(wqD-|al5Ggxh2FjN?3{{1e!!s
z9%by*oy;M?NKPhabRL9dI`k=^1xHFkp(Zy-XYmb2%8M{8{)j?N?y^m!B&zU!lz;mG
z&L(3fIhuK%ZZvL>u+vq>YvoRD`Yid&&80kczDyaezkn<B@)g|=3Hk2_kjSv6((yLw
z()*vk6{fN#lrZ&kHF%u6?4}6$0+Ex=EZZcA-0ijvi@dHw$D6OYEVB`J*dK9;@jp97
z&1)T%(ee)%oX=X5sQIOe?sn;mMausiA=w0CiPz;QidZt${Lj~!9U&0IFtnu{zS4hV
ztQTzM2Nghu8J5^9TTcstE7mb(d6g>t2CZA$k~WrW!?K^!M15RRktf-WDxO0tDrat7
z(u(R`l6M>+F;6G{I5mDq%}qvHw~#S;tT)qKsoLc&Tz5+osroc5#GO$h<Qkn+OY@R`
zqBnJe{t*L7ciwPZE7C_IJ%ctyn4BCFaFeE7G)h{J1GnLv5YCSwuZ#{qBs%qJ*V6ue
zA;}$`LZkAE-IW;`1{d3vIx~1wV07x!kcvLZ$c563vrbUO74WW8cagr_x5|e0P0cqF
zf$3Eluu?UG-Z-fzS^{8K0oYYrGTm7xXk;Ed$+g+{GM0ZT!E-=ten4A7$0z{W%lh6>
zyJ%If@ky@cmGqx0@2i&~2HhB!8lU81S^bQe=TgfUdC}81GyuHhV6(~;GuT7XNpg_7
zxNX70g!ngeT9x5Gu>ho5HjH%N0{8y_AZr4c=%bhW#MvBM4#@vKI;hTc&Ri{{55W~V
ztNnTL!gr-)$;2wf@MKLm)2k~;2poOC(s7NEFK4;@e8owDTZ0~OB_87!@MiNque-+D
z3LP74-hKkka%ASR%TzHt8IHhk83$-yYF*KxkiFY8VAb0`<>(I{`NP+_B}xo}Fmy|T
zqPYK!-Rc#>&tw79>BC}`<RpKe&Uo7!f_wE${C0DC1uG7a!3&o&z7v%`8XW>90|nml
z<<C=mhJy;d0(6qYcX7W4dkQ4K35}frtS8aAxSFWkFjY=~GdNFt>|CGp0BRlpT4&YV
z&^y^u3{<{W(W<jsAh}U9a-&8{{_1>Gz~2WLNb>9X8pL;{eM|gF{~tkk-t!S?m|6eP
z_lq51LXRN`bP8DeIWMJmFlXecC`1R*6S6cJN+VoBxL!NExS}<9e$YXXqwt%xz*tB`
z!r4Kll}HOSX&^!+=EJk?JlG1$v`|8N2d3ne5<QK1HXB(<f1jW>?c6WCL9p}^3akdB
zsI@}QqF`79yQ?MWTpl0hW%^MAlOY1dH)5chKp@GhIhrRe5*5F>MMDvBnmV+a>O!EZ
zrdr%h24IS`oNFD2IKTvK-X?P*T1|mhM2o%o;4JWzeO((;;L-gUSI-o+z^FvlfbL3d
z;nB73v}HT%f?CHQEQX1-HA(T@$!KVv=!DW*JLKxNX(@o`#N89}EhGBCN2NsHWHe7U
zVjtF8KvW2QgdH8cDozaE(5dW`EiVkF69HyC$z!*1(EkX#qGN|a7`D+nY^(tLFZK$F
zrTo+#04}8=V9AooK<P=`-wn$3T(l9Ks2WW1kSC`*(oAH&5%;%NMq*2I5-VFuHURyo
zPEM#-c_4(ng3WqPFh*l8nU}H+gugNZNh7WVJ@@$XNDNjdi|<ey(!br-n%{><u3*2y
z)EE^@I7urfc$tJK+PL{(i!91`Jp>WMmQ41s?BREyk2+PHJvB%g`0TwPd4#gUgmfn@
z1}FHG>3o7(R*ux292ulsi{?`t9H^%P-T^{}6HXS?!Ua}&#lS)7C!Y%j*Kow52+?Q7
zzyXA=dwNW7kj`RCn_pfEM4lkwuDyunoS@a8bFn9$QqcW3cG+B9y`oQ$^hy5<JwPxt
zVm`5Z-^cSk>}d{g*056mH=@D`0G`P+cf#JuZW)qj{$mY!Cf|K*PeVh>PPSaTzMVo9
zib>snXCvQ5S}Q3mT*M4lpA1&J`vq^<wU-_L5QSo6hRV!fncGGMJwwWq7-~sC6Zn05
z5q+P49oNowU4K%3({aBXua<@>uqJHre%;INEL`*#Mq(A4#BUi{e8P3AuYrUoJ(@|L
z|JW{V^DD1R+;FK#!OJ5;A&aoGPL=QkbiCgWqbQ^ntNaB@Y3%=eok?!RFbqSl<UxaV
z|BE$BY|%jRx$DZvPvc3X9v1+`2l|s<SDKov-Vm6sbvhk=4=^k*t?WBQ0*W66BPVt%
zrs=c6(y8S54g=7fkMz5FEqqPi8p?YUkUE-}pzQc1eElAvK15rfh0ng-vUxI~%_|BG
zMNaDZGk~3$@b0lJ>r&k=XGw`LBKwk)QX0*H(bIgA8KJOB2I8QcN(g!~P!bt`;lB_^
zH7Ms={qh-l*+N>N=oOQ`fmL^93qiS{NO*a9VKZrURD3R9$~>+L-;GJX2e=yXMrj~l
z4%jz<^TQ43UC*)rM1xe_)+i%Ff$xgdpePrDEn|Tu{ROBSLI(4~7G+Z}e}xc~Mc_{A
z7n9QHwhR%)rC0I%gEDN$wXxoOUFEI0^FKx_F?3MZxUOQzHNh(w9UQ*rU&tN+9Vptv
z5%Rd7;8_h9P0CcH$j3lhXcsMJ{&TWn6FJJ^H4E3Ce|N<b&@CxS%Uj)QL7!&T9#8qm
z8c3he-3axr3Weq!!o*D73d$?_%|ejHxn-n^6m%un3QCros|hE2njEI>N!LO|$%pib
zOfncF7F9D9Ve(q&r|d`7iaS-KO99g4eT)law@Wr7Q_<L#W)1NZda7n=-1Nf!==wJm
z{|LJh<cL8S_9feZfd7B2brU2yopnFpf!%~)S;wyebh+-Wk+JLON71@#Q%zhF6dHY-
zVsBF+)veq@`(u`#ki`bs|NEaUNS7R2HfkZ{(JPV~G)6I#LqN1nmY92#3&833r-N+@
z=4P{Lt5WsC2-*Ncs7-UG^I5CTLl_x0)`L&7FJpmL+WtcxUh>3D!>0Ez$o%I~u0Vs7
zY05}E)656NuNI&|${+xp;cTy*EPI4<stv!ol+Ax}nX^FjiX8%P@_S#DGDSP8!sEL9
zxq#9q4pnUYxLOK#Dnm%%#BCnGv!g2PR|1EZTOi$V9>0~GWaCAy@|I9CpW&1y$GBXB
zjw~_RGRw*pNDM_Avb3i-WVMmZmFiV+a=oU>nzPUMb`=?aSd9S?^t<*ghRN=m2&j+h
zl8+#}VW0b5LM21oYl~_Wf*`vASXzOD1!ny+N{BKHS8#4fT3NCl5nY%;@Q%B#8{Pv+
ze=eZ>33DpS)|sWm_cwdb@<$ZA!A{Gcjo)N}hyC)o0ND*sV9JY|Y-QY)AS!}5_RWs?
zKB}iY1<MC9h+~f-k-cB^jMBIt%0WS3D&)?HgYQ|Xi6AY?V~YAtbL?$Y@@rQr8=-MZ
z9EM3wM!J9Tbw)`Nf<O$tQUgtZ`(JDqg~Xr90mjl2l}XYs>lj)+o3m4J?3BHbQ>C#j
z2Q9grVb6d=%1F5x|9c|h@Vd>Lp^?>4C)5aZ6LULbk#3`p1|h$LgLP#rJ_*%E?$89T
zspSJpF0_>3e=lxLC?yh@(3teHSFo6vyV})$9nHeX+pzUsxPD5Ufai%&U%qGCxJCO_
zNrqohg0@_%;xbM<9||?0)Kw{7y&s4(i!t1wHq?ZY1cd&76wnm)3FmAgQzJ!5XLAsG
zF%CWU_W}54Wwb{A{-AWU6(PG#K9<TuLY%CAZ5`4u)8B;;Y&hyi2WHJ%rhOsFQ^~7^
zKby>?`qllTkcv5ICBLZjqaea=^g9>g91XH}L0f7(kHzl;d=_HmTvnY|IoU<D&fbN(
zP_kWy(!)zxcbD74c`^{nYu@?Dr(7$!O&&IP2-Ts~x)=eTaaGhu3b&V_6n3d9@{Zf4
zF?Zs?o&iJ<3MM_G+%WwH^Q65C6mRD0UnQACK|Y3!PVwet&R_B6s6QJfX0>c|syC$w
z|NbVm-UBRu2@vPCbQREcbs)IB51=B7(mCE2ZE6}|IeZA9B8n*p5+%ePqwaQprb2nF
zN+~=qhG~bs%*6j6U)Pr8FbKo01P&4S{ukSI5=;Hk0h*aM6pWtr08NM~9QQtxohoS&
zG(eGZ6dJ4wDW+o`!_KIHWX#H>3zCZk0oaACEU%1nWCu_gcG%!<KxXBXyX&Iqzxaf-
zUm<0APsN9HJY`*5oaY`tlu8PLyJN9jDy;AfvZWxUKAc!QnTG>{u~|ehwv0V@E($ok
zQUY7)>l2iqjy8GDC+5s8<jwu?jhp$h!@KgaGCD8&62+*D1;U^+l6wKR9desdDRXOz
zoMbX#SzMfM3~EGK=MwhP$=fv{rX7zqb=U!wNsq3jiKhY2Z6}-S@PbrFC%!B1|BpCq
z*B->FWVcB_x3yrP(*JPd7UEB&7g?REkiL0q$8;1ij=~!f6z}2c5c|S0?S6DLA_nA*
z>3X6l2+h6)<$5jra0&>y<N*7CTS21}vMM$uu&WlqJ^()qE4S1=KzmSxosT|R<yrs1
zqkS=@vmh|{Upn+hom7kNTi4nCBEOD!XMWkJPf_1ttq%_4^3&0@%7buFs?cT1g~VQV
zI%;Q1e3|Pnezh|NfZ4u2BvY@unf`jZU{8O3Syu;=U1e{s?ME>;NBta;j$1?Orb68j
z%2Y(T$330)3aNNGEUK9?HtQhbkFYDdk{E<xE%^Y1`)_QMnMLAfy#<5^1Y*b5(bvC3
zOtB16ZjD!Yx6rFq%n$SEjD9?>xP_Q)awb}eEeVUw0Bexu)*b@3m`Clao}ZK>+AWS2
zYN|wvZ|daDKZm2bxC|520lWs5uFS-`n1tgi|5k1;NPak31=+p>7~Ofs@eX~K9X2Sz
zk*x+lY{=dx1eHk2&sWX%c^N6Q!CG%dcZ6IjyLbST2f+3vUv~Lnj1~<JV^p3;ef|Rg
zJfQwJ&+2Fq5I3c^4Qa{PL0VwUb^<J9)2!}gRZKQSP+eyaE^D5xLxin<#+Y6G5Pk_?
z8-F!32D5@5I0ki800ni7-~h`<y9Dv0mVDu9@f05nNp}yNr_eE3N%uIwuV*%G^$mxd
z@*1UONV~f(xJtE~xFp2l{FW3+Ua!G}w=;m`cqC?1IWDzXZ})(o!*8kOH>fY;0N=#-
z?*XW(<OTNW=h4vc`HuxI!ldyRWY0f84@tF5@2VycJ7v3kvR3LYW_FD+1XYzBSB6}J
z2MO&0NRe{72>a_*MvhZhSARrE%O()=G?!W@cD4gd@>OeGriV!dg=o#J5i$_9BGw_s
zB~XWU0#HMze)zh!YlmSFwo)(<@cxV4xQ!)$^lE{gG{rTb7ni`3eCRtBSE49R@hC9Y
zEDQ`t?~vbs+W87NO^&P$XFPSLTC4JlMvdvm>I|}FD@9!^0xH)QntcSP1-;}m^{JD@
zVEHd``la0DdzP2;u}pO-ce;P)!53k^ka^1|h$Ag+9E1~0yI+3z{~wS{Rp*=)6N=AU
zUP=z@>li_$8_IAQO2~gRM~-dH_g-ISxsBMt&Xf-TIK_%Yheo2wQ&G}mubev@(EnC0
zeW5v=5@W9*u6HqWuj;~#A{V$tYp*JUVX1FM`BQ~{E8bNRO)*&NEb-@ikj9EFR5cXN
ztyNQH*6>2P<&0KGth|qd`eyh5?~rehBv>Q3Je>SRlcy*SY`KwFXGo}8&hTpWSb@!9
z;zG-XEhGN3r|b#>RhZV}5IdqP=&64Lva#o8U47CXV{=W$ltr+y6n_nrcAAAlE7)pf
zRNL8WN$ofwcrcfxTOP!O1NM~;ZHONtrMqN<p3X3c!Hv(@HiL_wf6G^JV0!yLSo)Y(
z-m-)dm%P%Ff>9)$^`ifA)SgOxUU^tJ7zgD>e>{dVc&h~4ruPDRrAoz?$}N{C+1@5p
z0TvT=XouSGt{*$AKf=!F%9Rj?p)Fw>F!bNpTW?~CpVccMbCOBIfF)f$7r@?-bgSA}
zU8CPe4L_57ubcB}HEFX<g_o2NksFgkzifwJjg2jl)z!o%N%-2`1^nBA5QyC_llOpx
zFWXeqt_6}_HeB9=iMF^#c2+z5p3F|m_Q>pd`N}02pfqbA%p3NQE9!=(7jd1>B*z6l
zXq3M%0RFITy7JFux@5~0b)ztko~ivL;A@N^|BIAT90GkMLL4)2xt=D#uVYQjUOzpQ
zUm;{FuS_Ovup=YL#OZy-D0r~?3K&lLIk{tB;l3Uiy*wgNN}2Zfg%G?gK~2tl7*4Ur
z2D`$s7#t-^W|G8ih>3NZa@9VbAz#jlD6&LG+b?T)Wbzl#GD__~s7ufI;>BueC%r<M
zq|99|#~(HPTgp8Z4=0mtd4P$`dZZz^t51ms!|OGgHMq)XGZ7gb3YnV69w7)@Gas$v
zRESxvBj?F22i`z*U!Ip<Egz{TsK(7lkZjjp4MAOg0@m2N8Pi1_U$2g0`5mwv<)pvL
zIQ&|YB%jn!R!*F-a>gYlPj1i8W3xG^fHj(>QW6C6X_jA>WGFOu){Bd;mQv!q9JjD6
zCSL@#-Txrg@^WhkcSL#X1ETIfzOL-ZVi<&Vv}1e${WrGZ#g_7=1~LxgghNPj$uaXw
zO{u&^M+Ccu20wO<ocCm>t`Hy4a^VCLN%I^WosLBuYC?oT%ItY!xuFL&JLkChG>c)O
zzJml`G_vCoJk16y|8|po`oU1%<!j(bZ-sM6X2WF&-fQ@ZnsMK3IUZnA#oG^xQhe*N
zI+3gin%kNoPr!S)2g~!t$*F8{qG88o5leguEPP1XC@c<!Qi)?3G~)JU9oHx=6pj=h
z5M?z)AfOFZfQtH^Mnhrflg1v?8u;@TDPIBn`3USln;YQROtl{pB&KxZ1pnozo=#tu
z_d#oU`}F#`Pifn0QEJE-VtTzs=4V3%8L6p!5VV$eV@3<R5JIbRPlhll$g<I9rr-6B
z+C`KhFpO*LF5{Pu!`K*J54CF+hMY`q`chb=5pzflgSaS4c}-EJZj&37rY5&xxP@11
z@i#2lXpf{?WEjb!mMm&8>!|Y&d451B(aAP-l-BcaDc*S4{w!@KHAgqvtD*Y4F#oIs
zkokUvr3!(OXl@u?lsmQfeL$3`N6HsS8ln@$^6Sb`0g!fm(NPz|m7^lK4R?4+nY|z*
z<+*mw7S}roYVs96jFc({{|P&@BZpxahPEVA2f_Xu+h`pD`a%k@Cvh?~1%eM}BEDwI
zSK)dJgt)IErp@9A3N|tj!9rN01QMYIeX~%?J^^yrbIC9nOC*uBha;T%$u_6S8q<+{
zon?jn3PRef)HJm(`irV}`x~$n4#I;sB685_W}PL7s}dGH0Y&F<{i+0=E6a6JII0@s
z1SahDj|@_!K!xK!-+F^B1f7L2^6II+bzpz~W&gw)p7f9}1?#Z2$_Ma5vy%o0gQAeC
zu(2l4E=n=1Z99ci_z5eVLu{{4O=3&MY?%M0^J$+zO1V#_A<UDTxZh<qjT;B<wT)cg
zt@Z!@s!^%3BRKTB=w!4VucLJR3}ME&oHd<jt`~Fl+B$ODPjIun&gHEKT_NG7PY~Ga
z^ZsSL5DrNG*>Ma`?t~Um`r%T&ggh>ypxd5u+{{;&k#z_n`-oq*pV9Dy)1xg=eh(J0
ztx2|{8;os4Z%gb3syyN3S`6Yto=_r4OJy!j+f59Okwc#A)~<fWsyrAHX-Zy#ca-*h
zl~@=NPAJNwNRYjMl-$Gd7DG&)j$0_|jc3CbU21Q@I+&0~vW{rKZ(w~nm;yIoNiu&L
zA3>$9<bQl!*^vby2+U|pMG^B)Y#%D!{tN-ERXfiE=<6aU-du)xws!>v)7+lwAM64r
z?kT5t*6H4i#UO@~nx2Ben$Rdk64Yew%ay(b14#h=c}!FQ;PtdE86di9=YU{p;onPI
z4bau=Ff%W&s6>0deH*fySj%J8NxRfY1#uj^lym`TP$UQ;{uVS6I!-|M_X604BdjiW
zk}6r}=X-oFAW*?D&;De--h#-|0YOMms;ehB@SZX9UpKkwdjXJYv<X@}p+}&m*2|`_
zZD?yeHQ{CW`6rZ_{s-V&p8`HuJyof~$&LX{y^0Q+N5`~vI7KPj#`N^6=+67!tBOp$
zpe#@mw`~`U{I$~orq;AAn4A=X3gGV7A?)<BJo^B%QK!x%@RL7&89A0d=u@7QF9?il
z_-VO^%}5)IiL0=M4(bF-AR_Cxp|evk9}t<d${MZJmJp2eM}W1QJ$?r^o(D05?rc(y
z7yWG<$?IB?U!~KC;L`TuWNn@WELB0-L{TVVisnN<UC4N9X{?JGz`MT6pkJ#YN#I15
zeJ_B!utf^;Mk1M2*Cpd3m^EToME}+*AShN%s}h6Nrgj=tj#+?Wub%d&2JetQ<YD_R
zsJwsMFkRrO3j_VybEXxv{aS*|@K4y4AV~<qz%M0&B>Dfxb`a^NYIb`cpi_gGVEX#~
z27}D1B1sagoIb7e<st&W>*$Fy1D78Mrl%B4M!9$R=d8^eLcE@2ZMhE+n70%guXk}Y
zu+uUWvnUG+<u#kwO00|1Mw9PCIe~)?YLg+{WvajB8c=^?qa)zv)7DW=barJ@fU+=-
zbv8q|%iKuPBryvE!#K3D*KkDJ-@30C28OW<%0mfZw8|yLWLemWSJ1C?IJmOiN<Kvd
z%SReGhJZnz)IK>WD6ko}vDtiq9hWz0PM1VZ!pKp)v%zejNffmV1+kq2!wl$0x}3L_
z`S--Jzmu<5X<rI{Dnn!LN7~pOH0ZOghOT9FVn0G9Jhop#{__lqre4FgbMI_RuLNd(
zfH#+a;XdqBYIl`B41F!U<RX&LkaUN;qH*R}L*5`*Q3FSV(UPfoO<fKvB_p#ccRJ0S
z--iBq2v7{*&!>pz08v$@_LUnCck~T$%37DR_TSh0VYYxg?nQ}Pc34gFwacjq?NGuk
zxMv*>>rx0}d1G)Qp_4n`QaF)x=`&DUequ+;)Z>PQXp@vGrt%{ss?l#^XIe}_ll(|4
zAC#!?O+44FVGm1rbvc->!)RFh!`B%dKn#K~bR|Vl*?+M+s*wIP3wUi$MIq!JssBCP
zv6$|?T$F~x1W6k9a-*hd-phx*mvQolgAsJ9)Jopd&TGN`CT`lps(vN3q0*&VLQhiS
zitGAN_`R}|m1prJHViFo+gwtOSksKY!V6+M>Kn9b&)y*wVLO2U-PoHV+j0Me5Sr?y
z0~i{_fdn@zqPG}3AG=JLj;#G6a+gq5X)~Kk$r)Bsjv|h4aGEIC-UT=1R5m^48Fv!=
zmqDY?4|hYALQ0t4tZV2@C_vO<=GAr8C8@2H0z7e+{R6jn5??CYdLsZVobQd#LR3%w
zC$tHgG}4aCmA*phty`a^uw4CyGig^K^F4s3>x#Tkx|+S!kuGtePk;hS0(Oqbbd{ch
zr5!z+Pdu`%H4EE-9Ha5yU)4=0*v_?RV<EHHbbt+M7Wg>UGG#VzUHy9iFJY8=`FySf
zrbWt&GKyTG?edQHosBBwv8VbTpd3REz9J20!7DRr1MgaPuRV>A<FcNps;HxCqfY<}
zrP&LhdHkB6wb*R2goy(zzbBTGjoi&1r#2Rq^_{XQMS)s!F(SN7`U(&k+N-m+B@_Cw
zQ(-e1US0=fe%E3`ME?U=r&C!m6C2=-vaJrczP}ULKf<m6$6*+ReJLR!g#Ul+N*7F|
zX}%9cYL`*4u^k6sMp^wpkAWJ=K|H#gou{7%D6qqk`sz1NJ_+?Ov0xk5u4oVMpd#!D
zhWLU_S*~)K@1Qm6dO)9Wtfl#xUS3|3;^IK-u5zTq=qmt#{q&a@R8<9GPi-rGgi7|7
zfqV3HRG4&!(DqOf;ApUFkg|vjg|^TkNv#4_9GK0NIzT9=?TR7g=_%z(A4Em_IP?EL
zz^_%yg5FHQ>MM1__rs)ofDHg1y_GVyIeiC*Nr{m($Fw)4rj0`J+0L>rsWrV~lXS20
zFrrQN!kpq>?{KCPDzpbC^nfyz+XdZ~rtxXjC@bv?6>;o|Kci>1M;Mw>0g5kN#H|hb
zk(oB+A?fQB@>sZt>+;~<b5{~5|2D5(#w&FV1~OtI)R=bZhfIk@<Ed!#U2{F=^-g95
ztwQG8F5C<SG43H_bKC&h47oPPlZpr?V9`%=xp_%1H?P(embbF$XUPEC%q%B?610ZB
z=|-(vyxhEoru$9Y{!^3RJ$9!DXhk3zbdk1m(0EF<vsF2_ayLx(=hx2YJVFnhDE}3$
zI5k6iVk!0S?Y~*0+`K#`+JTjL;$A{M;oL5h%?2i6r<CiZrs*GHW6f*J@UJ}9Xp{f=
zy0T-5K^WGO4dGD#jlDRFWqzItz`K)V0LwaLBrY~7HfvO~N8)yb%E?}@@=@%v#ha~&
zR&uI}5}`C7oQS~}Imb=v7qEFQ^HdFUw{mBc<N#bgUMSDumc3q_6EYecn<Dv^)1*)S
zR8P?LPO!=IB2z8sF2}6aKR;)=eiJW9?tdV6y^(0Pn|=f!KjN|(m;=St8_H$?XOI$L
z*KF0TT3xZbB#PmRm`BMMFdJ=`e+Kpc7ifv$dxoh7?A;P^Xh9p3|A6#{j?z@ljZ54s
z*YhjvG#%;ZM^6FBy)g4paJjL4F7TXcPJP1$`3=4o*?v3y<UU=L1YkkxwXF)$+`VNY
zE&#}vK%ULhOGNTGD#B1t0V*HmM+izWlyf^@rlL9ADrMehHoUP34=>XXrGs%Z-Vbe;
zgU`Dmmz@~Ye(+Xct1_zVf6}-lM7Ij}c-OO2S)|~9Gwo4!14@J7W~4d54^bm1UwaVx
zfJ6}8YMioCRTfAz23>@@1To!gUboamFua|w$wODtbp@Wy_Egt9dh*V~0LJvY+-1Ho
z=&AoB@_iLLO!a(k1zen+nH72(FGRwiE6R%7nX7y=&F*FBUhxoJ8alb1$x2Lfyb$fd
ziz?K3^j-c(*p+2l41%yNfhgksH}<ZrCjH9WfTvX)fDEALtwzW8m!AAy4_)4nFWU5Q
zb)EH#p47i^OBs;P+}VlcE`tDaN}lL%06J83w(4WB8fX%H<wj|*yxgSWWXSmzO>8n2
zsO?qr6aaQDtareXBVB*P=dnoa4D9s0Z<`Cf6lk!_F+p#c)u`Dib(q~6@|JaBbo<2#
za>j1>haLgs`C70`p0~fT4V%;D0oPDeOz3;<_GG|%=Z#u10@(BOTBhtgC}G(gO-BRm
z=Np{37TZK_$HrHTK*__ROq$;d|IyVbJ&#HLcH$fSYP&yzBr+hW@?|wXg$TNBOuY{E
zv8SZ2O?EsShlKFBUDuS&5TnKBn~xq%YzfMA3xFTiN*075arJnK%V`WG(nhP)b{&Lb
zo@7W2fN-4S+_$^VStpHs1O`&>%7D{oP!VK8d~*#siGf(0_u;l1s9;I>J{@H&#-PZ*
z!`1C~!ngZ!o7VLoAQmkK$ggu0j(Dpjw`2gAXvGR~-RAW!M@aQYw?J{R8!>I=7bN{V
zq4hs})NP7v6F=eXkDHF1$J1}=k9I1EYnkjmFX=z??%j8Uxz_l|(?EML{<*Guqv>o%
zG^`6J@?TyhWro~(Fd^QX<Bza&Npctlf#{8<kjzKi|6&<ZRyQlM%PQq4vVaD?zT=Gs
zO~FUv))H+B<Aw>f-;|-q5@&v=*mQYr23qs#>(csb@bQc%v_fOl6wKDyy@^}4r}E>!
z024NrY)<F3Z}1=AKzlQk=5=)<+HBi=I4Sk+CzYB%t^RV&&tN<tEiu?6icq(7+|$Nr
zeccMb&=o3NXU}g1TQB=KGN-j~>qQGqJO2ifVF}0G8DM|q8F!PlXdPI^^%#ud&q(K8
z(tK2!C(-$`CteQ`8)GGXR7}ZAIq<Kj>|;J+jpa3m5_X&$Wu6&jxP<2P5p03oLLh5b
z%?YfL@qjxZ<)|${3HqG#H2fC~vHw52z<yNcQ0EXEPc*R*M9lotJ=Y@azF0flSP0ZI
z%o)e+zhqtH(^g7gTGDl{W?Tu*7s4(e+7|jl=XIcsg*CIe&CNJxZX|&De$WEaJO2HA
zk;C&7Q20(y&Ko+o?WS{a?aUs7ikBxxkKN{jg%?^f93EGBNyDpx=p5>zso%nj;@j{H
zqrLf(=&pN+G9Cxc(8uPNDt5CpA;Dj+U0OK|`xqkv8*)AGGL*(3FAA%Atv_^*z{J>=
zMez0;u0M>OZMMW92t&6d0)qSB*c+Xa^cV9s;OU308c6PSmsvl6LqcA<86`#Vp7-m0
zFtE7x(AVZKNEZBjRQ)9cG3n+kXDt>YemzI%;A1e^FL5Bs)7{*UfF0yeWlc^Z$ad-f
z(KNUC(!~n9qIJ%-zXsN02E2|ZxipY-Y1V62PetaY^Oj%JpKABFxB!hna=$9lpG*@o
zav{oQK33gFZOLATO`st6D~VlW$N!AKGU#xb8qi9XlvZ*qGS>d46TonPF5zx{jbw`G
zCCmb>oC&qyewH%K-AO(A5waeGTA`xPNtZEsnf<PT=z86ZA&{!Eo<ospJ00k9+0!@m
zznA4K`d3jlm&umcqwAx8=|VBvyVx)oWUv=-6|nlU9{MM_(a-2kFsDesWs%;mcm&ux
zKCIIfx{)}j)*sEtTA311QgfD-`(jJmb$c&TCSJ)bB}g9%TK0Pn;#NK<4<3@&K$^1t
zcopPAmY{t?B`Vncl$^A`2jZtHxzg>4&%4R)V_H}979ns2tq*>Yg1cn-)t(K7z?E-6
z;bSN_L5U@!BcX{5tlElD>ZAD#j?il^LXLg7!;?Ni_&m6b)ec}-GL0GkmVp%4=w&A%
zb!BW_uX@`=%8h*X#eamIQIhQ-2t>DJi;C=jV>4tzcis>0|5mDQG>Aa=>7H<etHl->
zaX>Xh^h@CqFR9@cq06Dg>X+hv07B3h3T-$~Yj6&zM`IKnq-IKT&eNuF5X>Gfv|uWZ
zShVTWA4vQ%ju@Aqh%F0qw_VFpzoZEJW9GTVh+Njj7Q9`W$0?89-;n#<y!}do@$oO^
zeP{a&As@!}b_dAmU7oOEm#EPdZLI?Zv>%yYXk@!6+>bnT_b<Vj`xFlAQR9C7+uGa*
zrGZIc_mLzM;1gzRl<@n*s3%w)`h0`xhn3yrb~8-YA+hYpE<#!|8_~W8F<ADH#CcTJ
z=gH>!uWE9<>=wZ|XF3XPmYt^A-byf8hrEo^Db9kps}}8ANC{)d$Q~HDwDI~+zYLPX
z#Mb;e2$o8^$mrjsFntaNSuAP2`*s;7Z6ikUZ}V%cam|N4=k1qSaQpLCDc%hgbhbRL
zof{xQjGHluyg~A5tp2RB4>3|GW|S1-8N%-)WGP}YzgW!1ed@?I_jW@XuQfhCkTVW7
z<N$XcUaCzq(#?q3xS{^VO+7}tr6r2-bzC8C(j3rtI~;;))!1(+^D8kyu=X={AE1l`
z)5BALzr!l8p5gv;G5R6wTyPu)VIX>=6$abD{V%p5jb|cNnqI(7Q;PrdzAa4dWGtc-
zmero(nycw=f$>`}y3fgssw({f^GXBk)fCP5^lDZ`Pj^ryEjXOEw~4woalC(eKE+;O
z7ATk>TTdynx3hyOUxN4Vjn`Wh2t&-Sb6jJmW?)tD@)|9XlIRDZio~dr^5vfVsUu!-
zPb_`Gda(5wWx(Ji&K02#f@4X`bED6LEd3-jsecCCj@L)cx);`9McAZHpqXQ7H3lJ|
z&8Q(Bx(96zj%f>mIc7{e!<@1XX~C@oNOs<&lSQ<L%<C*5Y7#A8q@zI=YRHm{MJMBB
zaByuHRtDXtyxquXNm#hG0~cMLc9ww{()%XNbHBtO@`nY+kR#*8%;G$N>(`LviB4Q@
zbJVU>JAttNF#)Zz!fTvRy5JPIexCkc2V%$%CGBxlzJXhhu4BljRdX{e8OJ72i18;U
z0F8oUqc(8Q)5J@|Rd+5e$&(Day47p6<BF;y<=-m%3o|_^h|nMdyLH*f5(jegJW_)5
zT-Q1yNhg_=+Ix{migL<nP%F`~bBIfpJkN3D_MwG-k4e;Z-&_zdB$vDYumD<1L~tG3
z=4--UX)6B{c5T-Vgdnh&TY)Gd^xxQxMrQmX4Q$TpMv!@ZUA=N0lVtN8vc2zvuii_>
zn;LZrP{kk5nG!pc#XP^H#U5^jF>b?36j&}+qbH&r>)<w#LA6#r?zmXZ=2$m=(*m=b
zPaCyLUaVZKW{+c?L&TN#S!2^8>lQMxngat%qCHb@v6<U$rk*@42&=uZ@9;smXPT7%
ztCY>`THguxz{zgE-K_Tl#-O9ECmB#_^Zlb#(1`4FwOf$xq|<}wH7F~dKqs>G?1ebq
zV*cphh}MJ!Oqx+^;!`S0%98lgL~?4Afch9WMz(lBC;d&SEsnfpZ|jO)uH(gOPU|rs
zWOEJB{_V#&)}gSrc&<g+i|<ybj5`%^STlx_;GyO;k+OOo>ku!DE(9syo4;<NN$~^>
z#!U@ozkS_{)vo)!uG;Q&ebC8-xq;Dm%=(04n2Wr`0MHwDR#VBml4$gGQ~tNJr9Z9<
zbxWU8n*F;SyE%iDOdEAe9{47^1O!Q=-FhR(xVl`)KmsofSKB_{p<tM!z8^BvrD>3E
z^YErtnH(w-xM;Il?7nN#MPIdE2Z{^HQf@=(##4i!LafHbDS>Dtc76lGizhfro-;vq
zrvLIdgwy&Z;_siZYs<0_gkf81(}H&Y8=FC;;VX9o96<%r=CMD?-I!l@sN()|E7`n*
z!7dSg(cg`4;+A1?4s+6F{D2j+?SH4qFA~OGGVaFuw|y<Ab)A|@dhf6xI2yghfzd3o
z_5`B|#b77ck_5EO&<`+}X?=L=Y@OxmfR3q`u?dk?yiQ-6<ohtte!Ph8)zm>WuKG}F
zElwZwEGVcM`^bI5jm9pTm_BU4gqLZD$ZU>Xdx|M@?j7Fw8jjiKJhelO7qx8Y0h%!W
zwshYCrrVCD{-1+vwSZP-SL2GMK>1Egf847eM+h=@m{VibXy0@-6wcCkq%&$K8x*{P
zB{4!9H>TSmoTb6fCDVQ!K8g0p-H)KVdky_tQc^QXESN=nmNJ?5^#}Z#Ug_+V#NM4A
zS+-sV+BZ&PhFvq2*U0jm0Q$_fZIb`+t(jILodg_g))e~o6x-e9$sN(lh)(Ctq$5P<
zHZ8u+b?Zk6VodrP+c?|^G`0eg;!j$%cQ1Mc<e8pCSAIM!8L4R``AU=vw0j;67}tEh
za)B@OJM^183**%W)sbyb9hba?f|43W@63f2M{9aa?@sL1Bml<oRV!F^!2w^dW)&G;
zqxC<+&NkbD5QL#yQWTW^Z|prfC7EC820WdQG72}z(~G?R3Zs*EVSzyNV6f#AbI{?e
zx;QP;6+F~<wk__hLz;XS7CllBdS0}(-(JD5JRI7B;&6m96fgnWtSJXIw)_<ukOYnr
zNaWSxC|j5uk_;{4`@jWnXdSODSc)E0H!t&b?3_&hg3FIYFia~5EFHW0N#b*Dhj(Fj
zeXaA6$q9im1LpBf{HmE}qQ=jow=H|Vte*gEpJV{WkqH|AE6_Y@4Cqh2Vdu}^<LDLe
zLb@$%osjTYjVw)u+A9jCFQSNwfaWpol#k*&tEmHAe<o_*c@p(8<eAELa1hPD_L*cd
zHMMS>)mShM#ys&lX%n#j6)uPAuYO4eaBCY!zfMW8Ay}Nkpn6P~@_M77W)7+#!tS9S
zT0-OIaI3g2D}SyX)1IwGxYo0pD)OXt#++y?Kh0UO0(nT=v@?q_Us>?-PC7+iZ7Nst
z(`iUY`k_KF8k%{B^VD9xi|ohKP1ku3#=&m@9tU}cWmLBHRUDcnBs8qIlT)9NEd3kU
zh(sH)D7wzo$X^_u`O73=1DC$hv6<B<mt?6?STmuJsyyCS=9Ium!ZsEtl9_~UKJB1C
z!p<=1b`XT2TT-ZqOMAP2L%)*vD|Z9V)V2x%PI@1f)G{py^4T2H_oVZq{m5}iHp|@b
zjEj59U%$*iK|5MMt8Sh7NiOjYx64m5P|(h{-K&ynn|hZ3=UVTeO$^EuMfRDTRh#;R
z3QFTmW3QvtoBcWpvZwbk=}ylc-8PCTsMXL?K^&UPFDRMW9g(xT;A9QdzG}^jd6+or
z&){_X{Bhs0S~G(bV@E?`&C=?hV)KJsh83Q}kvoqcPvPJYZ#z6@A84U}h-R_E!<iDs
z9?Lcob)Py0+jm-nD6oB(N?6@G^w{jt4f0D@qgY;WrECVYjWE&ylo@3%in_jOVuS6A
z6fnV7_qN!sW<Z@0Y&MNIZm&d}p0hdy9Fr9S%gfI)5J2VAs<eF<fLMXE*|x7vzJ8Y_
zh3Tszk=Nun$ywTOHYdu-M0Oonf)sEDXmOT=*`}7y64t7J6ySyn?LJ$E>nxkNvwVv#
z|329IgYlv;t-mEypPAP$5%3kADVt?1F$jA#R1Rb5FkHu92~|9Byw#oG%!pCG33`Qt
zNOrF4l;=LWh7}l*XT#zuc{x)Glf@!CNVAcgtwIS0U@)<?Tycy55yL%^{3HC`s{e#t
z+mXaD2x}>TAJBheckIQIKW?-Igt0TkF$hT_04|Zg|Cw?5brW9rl8+?SWH@<)qv+Qy
zld15(_B3pv4)?JujdC3UEU$40Eg#Xspz*x~<h>}rx9NGXNhp4nt}Y9X(`B^QV;gk6
z%JCusTrOcY?9FGwa7CB|yMm0Ggx_&vRS!u1Qn~Fn00|7x73u^2P;o!LN+}~;(>_!o
z+;%yS=hkaLHvaX;-`B7&I6ma;S3JnZ$jcvY6KP64aTE`b?DWDo;sl!By^qilAO~r7
z4LZl+4>SrU2gZXi&5UzIcb_HkU9U&t@j*(>KHkZn>DqUgaJTyT&}(2uk_fwfky)fu
zI*hEt#m0PWp7P_7-G(r*4(A8}xF~2o(3gA*1`h?Jq0O9!d)d-3ruP8ZiW&=hz>IQ}
z&gD>N5TqHk7IiD=d6`<=C=N)|XeT$Z4|3V1<qEw9Tp#Oljm(00{T%vvTpryj=sH;x
zz9>245|-@CA0LH2RgdkXe^bf|yUfrDq|f6;VGVZ4zI-@9L*JB6pZ-9XC#A})g_D<!
zvaUUe$S!xi0#q|I*P=es`@Hov&}D!?NtPE0WTC7a_P<E$4`J7J1u+Q2R>H_&v;Sfj
zazV<Mvj8uJB5V~7;AenXPS7*3NR<Bj6cr=Lh0j2@1bYtaz9R|B+8g?m0sSN`)sN5X
z-N34Mh0fb`v&A)OE_2K}7{wqpO-z-v+sc$hQ@x}*ry~NK(8x(E!QM&)3n<tllI|NF
z3Y}~9oenUGtJHhV5hBP$eNZW4=DGn%`{|Rw$5#n_05-96NIe?20V<jI^)sl8-4#ij
zZ88qvZ^TuMz$rPikw)n8U?<xmh^YU?6s`2ksEz*zNueJ^A*fA*(UdSUo9+VTvN~;=
z!^Jp8Rf`RdR+@ktKwC(sSa0tWU^w!qfjnHckm&5$tz+_ZXQGyc4mgdb*uK4qPx=UD
zw5~x}GjSlpj=E^U+MR!(7N;#FOnmR~WYsGB$4j^zKor!CR3Im!KC7HoD$9&u9vw{Y
z!m441bCdi>GBCO+PwvnKiObEwLvP{o5Xpn)@fdFwBczD)(huY*NZ<O=dTF~VK1%Z=
z`);#)OHnok>pe5yH<BQ4-bcMf4wD9Ak>#8NgrFB1E&rvQ&sKXyEX-hVd@BR_3<EEp
zQ3e!H198jaKfZ%2xLvX3eORcDS|7SU!mcdIVh{x0Xi7yu?|-owCZYR%^}9eSi$SC}
zM-O=sb30z(>3I)JGXl(kWbeJeYaJ73>@N}q`v{)722#V{zK{6&n7VzU`Ps?^D`#Kt
z74l!Er0)R|hTF!91w{88wer)C96?$P&gBiq%hfJP1<h-lO$*jYM#WlQB=gzSTTP%w
zo*h`z9@HN^;F-7r+Q`RP^;r$G?a8YPTzb2TO$hd&3$#Y`R|R<MIvpTGK1qfz>~{ya
z6+=dsOrrtX#Z<kr?C0Tzr~isbMu!l3wBeUYle)f8RTJy78+Pj3Q$s}-sFABD(nS#M
zH269rr=;Lnk}uxo;MF>8$J{1dvfeF`VSU43;4$E{R4hsTEt2fqwE$i^g7)T*me^Zj
zNzP8PsgX%@$DY(b`CBBGWDNVLvOPtth%0>ow2|{{s0Y9>E~GysT4hPMsh!T?(Jl@p
zm)9#Y5m;!GhE>CxB5Xyc)b~K0SMyxzh;iN-TrudzmrrpSqI>WjJm2>)XW<U&0%!1u
z=xBc+DXuZ#mq8*mHTw>n&wM0s=+tPsQB<?rDWDYc-Mmy%+t!=zG5(lzN8FoCmy^0k
z9<VEN_b{_E)-R_|R~N|x0@??$!PZNGtA|*wAL6Z%zl5Dpw!<I@M7N}X3j5#KD|unY
zFS3AoTAK*Ma3_b8Y>|sIQNN1Q&K9XdT(PT%yB=q)^9J4YvTWZgXYFUvQMjCCvL4r8
zOFRgAr}e;G8*-o1%f&Siw4H(Cmr4o#hyHwwNr|$^rHmz5=d|<<4PhS2!R$rn0_kgj
zSC?iw3Fo>2EFC?gQp1>bT)K(?C}7$6*acp*jWoU?5Z%k_GoK(vg>g!XNu7fOWA@(w
z@!ATb@^Fy7Zil~Iq*YUD@L5FlDyhf|CYavq{xx9e>cScxkT~hM*2XCt7=i^cB0CLE
z{9Dgku<FxjilMOr?uJPl)fV$)?9<FTm>zTFsFb61otwrkjj!0GL9bdsc3%~@VZ0&V
zf(C^MQ1xRQS9Q^k9}4jFppxkyKVoBn7#Lq2h1`D#G41JW14G$(DN_uxIS?Iv+GK;l
z+9n2p_jzlf{wPlRjSNCIF9SajM9STsOh)jT4!ODuoZH-OP1+`?KEKzWNl%$2Wi7Am
z(bxpk2i=L(^HwSK5ujPWf?~Q%I76~rAm97<=V(^ItYL|SvH|?=ft7)F^LgB6V(2x8
zyg_@=k4ItBec@b)&SjVY`Cx<FBwW0_6LPlbxp4jwc1A}MgD?#3=mu<qasQ3okSr2k
zN&}fJOTb|1>6uJXAA^AGuF3)RUjd#w{&fCBbWFx(P_z!XiJqHW`9;x2^Ja9Pp5w6{
zY@VJhSHe1Js~IE-mQhVARg_`KO6u6Ac55gW(@3U%hf7jHGf<rR*ET>wZggR2V%zY#
zbeI^2($#CwNi&gDZ2LHiHu$T=7EhR@5f-Ai;yB~?fy(7&ZWz3;H5N*aG1<fpt*Q;f
zjC|?tzwT=>HQP<fwZaI7ypTG8TkgeQuaCr@*<=wv?aE4$`J_FZX>zsrSyXc}sY^e>
zm`O4Tc5I#UzmH*XFe}=#@f|L978wJw(GxV&j5Y=v96XXO*B`gDk6i?euM-rs9pTpX
ze}MvWnN#c(IH3E-R^wPAqp?BJi@Rk{U3~eX3FJ5?^JhGK4Q6YkeuttMly|xLv$*X;
zs?IlzKmpmQADoMsze_uKBTztQo@l`BpH3hv+;r6u%)j=DqM@Cho$b34JsE=Dg_VS6
z6#QkWQO?19n!Iq*<(U`STQ2lL%+&d+-a9KlJ(j84UBNERf;xGN-3_;(ri<9)rrEM4
z{)jf6T%eCppc%VUe76pIcXMDKu;f2sXOt~52*S`Ufk4&$Z|ohakiMVH20SxU$07+g
zWCajZ#(3}~yo11%Mv<#SrCH^k%P=?{;A`@nAOC>QR6a2ht1sy5$LSOU&A<D%Ole?S
z*FG-Po$S#Zz9`q%tJ$H3e0Un1N1u=rCc@PSm7I&G{9lhi<$<XrS*{46rH(5H`0VH{
zH?+y_>uzK&#^x)aB`zD@;HarfyAecW1+>HsLeXwLKYLlc0*k(4yJ3z+1lW#Pbojxq
zO7o6^m$&!HLpGZ7X?%eusFcw>fjSD0ia4*Hu1Iq%scqF61*%HDjHcV4gn?@T#3;0_
z(L*Rd=;Z!5wiD)%!>#|>+c*CR(G0uVkU5V(2l#KQe1-0ai{E#CcDu|Qw`xDmd4$wR
znOu?xQ#ir2lm_p1K%)^`3iWh1b?ne#$O;He(us>v^=#gPp8gCa(ImwXa(?fI1kr4M
zOi#d^_2L9yH1xGrXf}hW<=zoevsTs8Ip=k~J|pj0{GB}wzANq0#Tyxxmcq@y1ro9!
zm?3Qf!Xi!`OAe7H+DJIw1YSsXd^^m(Xg`mA{Ab{}OyReZ+13i*U4<TE+j$he`Ne2r
zxND)0c~Jakg~=)Dj#(NR3jwS(ZkPq~Klbe(VON49K?nkWv_XUh{{OKZ+qP<w&C(w*
zof$<b>iD|?wKSrR*(dz&7v$0Zjtr@Z6A5?A*&Spb?H|I4KoC3gw)IDp0oTu~jSa9f
zqWPRZ0c5hv)-G`N0)C~@k*5HqdRctg3ATHIS{lP3d_ke%+>iaqJ|h}gUe3X38EL6%
z-hTs1qzWfh9)@|_+XDHevIAft#l%X9c0OSVzkAn!1D#AXH8Xkut%O#9le*FI6lq<9
z*wz5WioA*<JH!Nb(x2<2ziNv43p6-4XYx}--xd|buNM+jYZ3a8D4bV2>$1X~T_crZ
z=wpB~moImF>zC7Mi!>d?BwnxYw*px_nWdZNC=B`X^eJvfM7phc-NOaYB|Gzeg#^v{
z`1mal?@)#Aez^ztpDE4V+!vZ;F9E4EXA8kO<uoJd%f0)t$KE{K3hP38Zc?HaInZW%
z@0;NQC~`x8&!L!yBQx(Z->xtz^*h-Ia~13pvlFx0lkI{MnMxp0=0h@GY?mwhZ-Aa=
zB-Jn(0&k>>mapWrJ<FkZcnr{U_0wUtu&@iDNG+1iCzMJ0vrYAz6{x3yq0JJrOyCV$
z9o(!yivT4-_Zorr?j^9%Ijh-t-!aCXs1EUu=l(BYXOv|z2*S`E%|S3w_rI|j+nUT5
z-GHaB^@#+y;R?J)2CcSZn^G`TcweW0xMyxf!^U}}>2c2mc)LQ#tA}G4lXbT(yR?TS
zh7L(n2{viTJ6}7}W(8*2HHM;1B|RJ>s$YRy@&O~iHwVZCB4PcDEWw4u@<T3pkfPsE
zgVw~4soq<)N({L`w16XMsHP06mc-(Q%Bvl>gHw#mIVtMaadq?gc|<u$DzP9N37yoD
z{f}^0L48WvUPMleY`g#A4BLZs;Ki`-8{^h~NuRoZQOoqx_3qo}x}7V63k+#u#;#?|
z^}X-*hK6biN-!<olK#$6qx!cfP^q~<F7{?M_xxL{hC<vkt2HzOdlJkoBW1q=Z;_9m
z{fjqRrw&_N|7iabVe&mM!cwmjt#-sj+vkiBskCHY@Bn|_qoK``A@JGB4sS&^+2xX7
zPe9@4FWW6475|yLWUJdCrc&I=p`3(M1`M?MC4w{AIW$_7et3lTGd^Nfq)G%vg0R`~
zV7S@y{R-+loAD2@Ndx-Xd%7Vmc{RGmS&AgT>N)KQA_DRX>R-8Npk+O671QLcviKpc
zLwvm<>#cwWfzOB-*u9wYR{5Yw<0;kr@^x)T41^%CB@_Yezp+G57QeOuCl?(=_Vsl>
zihbxlVeur3qWbpuo~hL|*5NX`Z18Uwa3f6e+sW!os3xvGHdz7Cp^nmLg=oe54d*+7
z<2b}enbqTk%n^AT@#IxPi7fWOz(ysoR#1&6a(D=M3YbJi_;0|_XU&T6TCae0@iy2n
zhg6%dcoQ(N^Q+E^DGrv(o(|kUvL96u-3Y^N?U0pk#lpqB{x_903YwXL?Gx*vbM`1%
zxl&fFmF?M=v-C~RzM6HlQ7iZgsE;ekdbbZpG9IU6nmv&qirJN?^71R!d@IVyS?ao7
z=>>QcvAl;Zq(&PS7_hn8DTl@vSZHBIL7SSbk_)8q*QLX#^c&k|0IDGE(Smm!WqKCc
zV9`Ef;5{;VR--w_K9cX#&6~2Tl-q}M^5;ZBHIc?^8wE_e)x(VCTj9`Uiwy8HJRM)p
zTy63dz7x55Ay5u%`{sLH9>YdjpBydZ(7*$?EeF^$8n4pndbS(!X2t(<G!3TwzVxR?
z8vF<)8<*DprG^S9te~36MBPpBookiHCNFVOaQ1}euuF#7ZnrP~B)U+|zT8s^d?Ldu
zd%bfWot2tK;iGcmaP2x}MPHMDMA0jbkIs*<t2=`bgkdXDpp@>v*a;^IPjP|!Jgl~+
z`FXL1eDRLOh}51D9#`&WceaY7<?UabN)M=D<9Mtub=BY~u7goLkaB2+DTi4NOqbLq
zc+QBL=kP8E-~jPHTsNDzlI7@k`ZrR2w?*=qh~x)Jg(Xfs;?I2}^c76<#alGSqEw`2
z7Sk0y2}Cx+`}LS&Z`QMhY%bHY^HH?y@J<-*8fioS02$-ytVeqnpml3EWi?Iu`V>wc
zqgTKs-E=)p)?@1&0U;`SZsnBNx=-?bIumLFwq;A3qhC)m7-4^FSsMPu{CK-iP17e+
zQR2vHc6|KDIiMs<p>0`f4YDNHIt)+hveOYj?=|^u&@OtOm?I~OdJ{&N!qs#=WF_O8
zX=Gu8%1a%-?g?ked9r>MMWejX)i&?c4|gIG#Etw2hlcg(;QAba`-F{7Uco_xR~nOC
zU^*o=H3O@^cDzpaDd<j-kYz)Huz05a*0gQ4k3Iz;<GmRuk#<~d)<mx@Ks+%=KJ8^(
zOH|B}HYJ!kD5@Dq@!Enx*a3bdK8|8+`*txBCp;T$NW^2DZOt?JftO&NoJt)lH%g-?
zHN&g?Q2BQ3vP7N+S2d%u>DPsD{|LLHEQvu7b|nRgc(pzKj#Ewg#ay7TwTeJUa;7rf
zR=tcNfz82^;E{d*yUH&06U6ayl?0KE2ixoIgbUStR%~dlAn3ERsqQ6gh6~kfMal_<
zr*6_>ne|F8UKKML;6B;7OuS|pT+pS)m!aay7n`B0{s_@(Ml2%gxL#)C^r4CeP+vT6
zVf5`%G-l&g%lD$Yn#x8N0`gcTe)iL<*%*-cSp<{<4w)_bEJ0Ls?nnex?Cet2*0&!x
z$_KE}eq3PAw9YyaGB<8y^`Dqh(u<dV2ktw>4<ZD*q;o?tc6d@Os@Hlj=r8Qh$j~26
z`f1Bc{1W!EZx8Ch*wv)z`>>Rm2c&)mW*)oJzP={A+AQxHm^_onP}*kaoSkoVsSY7E
z_Hv~=&8NP1R(&Rnjh{A>Nu<Ty(VG@pM`=Mdi8&;3d56Y#yP>?YA*d!CI#uhY!uz+D
zV^1(%*^OWi9!0ogpwP?O4o2WGiH2{uaWan$&w3%(Yx1415Z5tjV-#NY*5OT|fg;9c
zB7m+MEP_)Ta&jVao7hSmGFk~7Lh5JfqSs?)N(_3|AMvvAni6yAVwOj35Cf^7J-%xv
zZ-AUAW<41Ssh>T})ANMvT!)eUpRhAZju-}E=#{Vy818?umf1wwpQ;yNympcWBR%A6
zNn4HW*hHo}BG`ZXfL6@`oN>ymz^^dPQqIGhA9P9vFclC3`YpW=NFtXtQsH~aC;tdW
z{*K__IUh(O&-C;$RM&JHHXXqGy9$;Pui9S&gXB(fOidPzF$HMWoUH!P(^=C&OGrSa
zI{<!JmZYQ9?zM?=>leE<>O}o+I-f}lgPr**0gL+4w;t&%Y%XPJz5{}t(B#&9J2rbX
z#kBr;B0_1YOFBj;EtF?76~r#rV0sP6BNwR70}l(f?^+6WGMGn(7pZ=Qv&hg15D{o~
zS=bzN4zWski<UIke7+UWzvgY8g_bL4K=QLU$%3Co%p>4hTStJ#!uR5k<aaRdM9`^d
z1c#$E8+eDE)LyPP5{B4=&ebTj4~{|_<uhPD{7vqmFSTtzM}$j4Q3fdE$5~XogzpJp
zp_kBvxfD8xwHx1t4(Sg{PN}Khh>-7K;E7<aBP@amPtxqw0BD@61CYoE6`VhM*(ZX@
zi{(r{j$P!Yaxh#UDKAap&+5zJZRerkjpj(2dosU}rGaN5Y-1NbcZDKCQVVF`X(X=K
zExCpt!p;T9VGstQR{~><egBJ9PQZiIYI*_GO}eS$`MjSez^7YyJWb+YnZI6SEjgin
zwBeP>YNlE~>7UsJYE9F=U{t|%lt#mchVnBXdg1YK0I#pGb%8grgBt=*r3&@y*t!}b
zN8L+zbuf>p^kxeUk)r{Jp@=09zLB+scAq|KoQ}X>@uGIg3A5U<d(ELp+UF(VGvK<a
zrXcLgL@Tp%Dc6vzX#wk$73wh8{f&QyT8_`TuE|9%XDGiD0jwJ|0{2;MC`<X?X3I6H
z@|}{(@jyyy`4mdCtacbRsh*EIL6#I!*SHXCTdv8mZ|zsiR3n>Ig~gcsRvbo621x~d
zp&E!_^14rRMa6bQx@Q4z?7^Q;UcPaQR;C~Cg3w&!&qy~QyCI#m6J|}r1;-nkmw>2K
zDh1FF^yuL=^AXU|q8q64c+0`}8cz5y?WnL&gzashtuvhZT`aKsQ9R<bUwK+;4z(y;
zb_)a`+rhd$Bq{!$i)@W_Odcwr?SxXSo1Jh?<QBEYuQ9Do=p24&N3PK=WADbN^G1-H
z?*8XGRO!?!^zDDm-Q<xrc3u;1hg6fs>QPM|Zw_~NDsv2%1xi%}EU{JJ=`5rDUh;nk
zyB1>!LJ-!H_yhZI>^)o{dvi0n2Ao|*MG}&a5g=jlx+}``(eI7@V=+M+S5Wv@ws_w{
z4n1cz@EW&=KJb>?SrNV7STqaNz-#U;CpD8ZPX|BycqvZ<ukkS4AG$0>!7^S`)m8}N
z$S3B|fGyG;gz}%X6*cmdbk<HAg6q@EKVa1dWFzUNPg#jZokMq(Ht^5}dMM|@FU)3q
zDG`wAK;?U}rqK!In=b?ca^j3#=rC$L9<@Q%d7=CymYOPVLQnUlN+H^FqqAnev0$!T
zuL5SIfO%eBZ`X30hJqBJZRu*^m*h_AS5FS<>rMqk-4`T2_o!z3M|_=(fcp3{Bo3#S
zZh}qz6Y$>5+s<2LX6#Cb_%|&TsFZ{I?yDs6x<w+Y*Ta;L0Aggy+bp-Cw^S_ckHiES
z0TLE!Whn7X>f@cH{DG))zEtDai?Hm)cB9~%cIfh@C9RuUbjfd!A0{W->!CeI2nAg)
zg(#`I=p^rX(_Sx|K4)nOxAgCH9d=GVQUEq;twh9zMe5-V@Lb_W0ohn~le!F9lE*#J
zgfd067lf#(F5?(t7Ra6Kuzt)#$*OFLL(*Y~;DE`05@>@@gTmHqR!H_ZWW{}ZXdbHQ
zty#?u<}qqdZth0A5B~@|w=0H07>2F{#>TM!Vy#J#`lT+w33(8(<g1>>ECz7QiYM0L
zdEOyQ(>Z92v;_q*Z_T2gGLXE6!Gt+$Kv3+vPL~BfWV2WfBM0|7uu2J^h<bUrCt`%b
zOp3evInlhx#hrha*}+m|ZgfC~O~{xYk~Nf+Y|zen+9vNDa!WjRQm{$KP1v`QwATZY
zKHH>Tvrx+X{we&9P)L2(H-X@(r0sggi-zfS{0;peHY>X9m7fb@?$QyU=~yAnH(*Ck
zzsloW>RpyB(mN-?cL5Z#8o{LVJDrJMvCyPsckfc}^XPgO<A+Xzifnt?4R-T)!~jrh
z;x6+i!|8?2AJ>okrpQ6d!BC858!ohm<0D3x{HB~h;)Ya>r{_itklX?KPe1NUinNoD
zDnBX59`bvhplj#?Sgpt;rmtbsjE5s`&yD!?7E)EufCsH1!l|Hm0dqlU_*MqV&dFo;
z)ARmDzz@B1VRwy3V+rjoMOKcz4nfGP)ErfSP3mS4_RURC0xmRbOtR_-{cfc_$rmzU
z)a_s_mLDJ|^=Q31#bhcOal8xutx9m$Z)89{95=$Vj<^)8Ml?N%MYr)l4wbdt38(pU
z8z3GU@ex>~Pu{lPN>5lU{6pBa9We~Tu$6!Wg!f;pbpjG!$^yQWOR;0U_*qob7Q5*Y
z>^>F3YTl7~@d2mI0mI|CP*_dt<*+P}@xtZflOS=;YwoxNxwXhJ-Mivp9N3}2$D)Ir
z{`++3f|O|$XO0&q@dbvI5RJRgEpkez#^=9d93c#cyt^Kc@G;5@s%a$Pr&<iE;8VjP
ztfrE6low<daOZ{k02_9JqO^h;^eG;++$kI`Xt$u2*2S{*Zvxn^5v2-6#t;O1`wEJe
z3y7Cc1rU_x|JKT>QTF81qp88f^>GRuA3?fw@_ai1f;YIuR2Z_$99)=?otg@l@VC6M
zntFIo%-G&rDW<TR5@3oce3Q4-2n5dzBeL%_Xg6M?b6Zj4x|Ck&w_h8qNil`?9eo=%
z<ug<ZA7aYf8C$WI5W_|Liu>bNOumz)K-?*I-1v7~zj~6mCZg&j4-1Vko3C)ovs36_
z-1-&MyXs+sHTgxMgKUi`$9qwj0-PZ`)F@s$(}Ea=-*-q`Q|YXH?zR8T(-VFmtcFfS
zPqS*IOv95qv3=0~<I~PgdN#t1qFj6o9t*2^4BQU!;8Fo(fse6aVKsR-$KC?sN7%Jx
zI}C!r9o-{}id*aIZ-_GZHCaHZNgE@~>nOi|$BOf#LQT5zz|lo}z#Oh4<G0~pH4b8n
zV!U4<>wWWP>2noWjlWd}Zls2{pZ~u($#n)+;}Ap2dvs)lsl3e&u;!@{cH=H-uGef_
zDdBk@u*T0TniZrRY0R5FLQPy}SfK@%VpnKD-d-jb?e!N-RjkJ@>7%d|2J<vi3#_Ji
zFiA&&o>sOh^Z;cAT86Ne@dEMnJH?QE8mw_y(Oyoc%eIJ|o*XN(0wKd{>8iKd@pP%~
zXU3PHR~&10mmMoGo?&GvtkG6r1frqSsxI!N8?2Sf+S$Oh5u_)%0n^7_NQWQ1CLF|#
ztML0vXVR8HO)D4Gc&4&hd2?ui)I6`GJj>UWqT-Kfhshn{o;=}RVE(XA%cKH&ni0;-
zufjMk!t-1^Uqgl+LJQl2BI4rSNre<9I71GLh`#DOWvoD-PE}|H(0!0%<xtVW0I(Z>
zrV^*w&gbC@(=dG#ZhB=0r}2Z2jr6RVNw4jL?+SwWB#r1I-)gTMtB*OV9h}B1%*%h`
zB8@Nm_$f1t!7_EHw4UyUywA6aBcw@60Cup#an!4nyJhvt2dN{ag974Ik;N+@ALNz*
zC@f_4@1L+MJC+~>ff>CL1%><*d&{`c^VORG<(z_jIoESIa2nUs2g0M|7?}XdDZY-#
z8tq)P_`4|7tuTddmX64pVHN(9tflXGD4r>6^o;^eBb|&}a+>SC6&(3<05vDP?IWZh
z)F;t_Uj*nrTf2ab-AgbIS2?6LpZ4vY{nIXL+%40A(~Pyi@wHYceY#ZoC|4gt&I3ET
zZSs-_@mG4i=4|ar-(WK&+`qzCGjt>1IvP7Ra=R(R#DUUyIlv~Nu`K-4^<DXH2M@I4
z+B}(|h@_odi0Z4cY)AOe9O$F(^hXNxl)d`&EFDaW6Ohini!Y(4?AY4UYOVJ1v4r3S
zIv>RPFD>xb$>ngKvBLyS50>C!-H0!K=;GSS!#LW3HM=~_9(EpmouI0j2Pt`0K9|oY
zF1$j|*jLqYzw1zag)Gy56JQ#Bo97oRArHSeFVun4?DlR=PJ!V-c>JgUq1Ohh(*sKw
z!3!L06W-(uEAxpwN;7Kz<-lonS=-!r;_7|Uq?<p9fDCnY_jI?dXALqq+T;csU9J8r
z^Vz<jU1n18NG~^e@&8X%*r+hCjT5N=(zp~cA}w{k1HttKp?4CRniIH_ajXa;Ly)rk
zPuR5`F$}`6m59Nw{TFLZvBgKvS%6E@LKI1s{;vQOX;h^-;^&BrVZImegBY}*=5l_E
zjN9}GBJln$>WHL_&<Mj2pPgxu4A(;!){7G^lL}4Gu%tMF`u~Gn(~DJ{=yG^O-xY}M
zIn6LvB*D)E&4;1L&o&Rv1T}MuYXzdClY9X=OY0vqfw>~RTfB`WT8g~2vlJ!-jX+QX
z5A-D768v_})u>gw?vg}sJHx%*SOOwanbD3*_{#0ym>8@XM2?bSy_DpB0Sq1zQmcN|
z#+jtsx)DwEnzXO@36nDcuq%{$wm@z}WC`jkZz2THJ`cqN9qxj554uFyB|ZAN25S^G
zn9Go)tE=_EnHG%v?!^)?d1=*wy7XvV2{9Z69L9qlD3$&nt)*tKN&<=6ZLUfOd$?Z#
z4Ix}m_<2@cg7*ZT9kC`9!yFa+CHoQZQ-4Gru_heNnM|_@`BmxA-oJA*1ud#xQ2xj=
z3PsMo#>p}TZO0<QDotGd9_%mA(Q^f+Gi)|P6Fx(GJ6f&>^ftgLTLm0)D#_bp(4VoX
z)kN}KQK@d(X0<uZc2`+B#^+e@d(*6&ptnny`5072bs-FWK*sjr_XerPlXnScDHrwg
z_Y3#K*R>rn48pLDdgfuU_g}1qg2a~wfFqX#u=RSzJ5dty0IeVE`(K3{E<w}?1cdx*
zvqxC%&a^(Mq>YQzoXqiq=tK2ajv<$rAUMJ3Pt%1<&_GSl1T8KjbLU76ct4CG>1UB>
z{FoJ#htySX4XE586OA7?_A=8Zgse>)eMi#40-C!;R3;uir~V+54i+Qm`e{x`USA?F
zP?PjP+j((=!a)t8#szBf15cJE6muB4dFWf{#c9@NjH0GF9wDb5jvxjLL;ub0HMsSY
zMj&QDOtIa9VrPSNdd6$GE9ijsSDT(PeLfmeofVU2Y$|7eG&y(=e|4&u0gds%i>RwY
z4frY#sb)!|Z>c>$Rb!l1FH)(N#y(^=($8*&`3{KF6M!yWz)M~2!0Q>hX{Guh0M*n<
z7qxJs{8A%sX$U>658@Ub=Zp`z!{$M1c6{g|SF}xREXW9!^=TfUW;bfMfEGOIx*VPe
zue8Hz-H2Z#&pCPPN$P3l4d7h2xKrad)1DQ{n3@@ksp;T`EY}P9Ef<tBt<t8TULDG^
ziwN0sN~Y9!R)$%0a_2Pmn}rR?31Tn!42$@ty|J^vYRY>&4!jNjLNBJ5fLi8D*qI$c
z48kz9B`~M^Z)}&t5?@LKo=gG+TlUi_-Q4nF<YOBF_YvXsU_b;qqBUKt@l2;fqe26X
zXFGXi{Ur%>o*6l%jcf0c>sq7oNHCm?DfdBDpd&fYx}xre<#>#~j{-fX;nI~{=7er+
z@`=&Y-98ZDv9b1qd=JJZpX84%+lc<=k)(j^6ljjWVHlGn3JX5<Bhc%xca+q-lRuL5
zz0HluHMkk;o@5|KeArg{6=?Qo9g=_)qs$8~m}R-hjg8^~n%ZTvyQ>zsLEDPBVMQJp
z<gO?4L7Jar(Kr<vGc3p!i(yr2v^3#`D84!|`Y<1o-mwxC5gr?_1|(t11u(x;;ujHM
znEgK*piPV#1h+L@FHhJ9eKyG<K3Kh5qtFaFFR%rv)(dYejzq%K)Db$3MXb`SIx~?d
z`Yj-p8BZ1vT<Z;?`v`zk=6~ShS9fN#?h~}3-y?e}dVB0Y=~(nZuJuQu$&*4=0kJ~6
zf_UYmp(lE$58_fkz-eA-y;+|xSvw+h(|hU)G)pRNw?AfG)n>*#xaFZE01ps;w!3F7
z`a1qU8a+YcwXyS#y?Z4lfVbJA4uFf}=+Tb4PL`*>ko5suadUKzw5RGn!mjMdVGxS7
z1ekaA-`EBlB)+r-gkdsZKqtEO@}Fk}`I&x<hU?2R*~9u<&~i(WpP6-tuH5-PAHdLc
zg=rZ+kCyj=ed@N`-r`~e<W+>RLTmU{)}v>D<!C2@<>lZH^0<T+U5|jYioio=nQwPa
z=+bnCUQLIcSy11#t=oXo{7H#%l+pNVNw1_G(VEY$fA7?RUiLVM-drbimZ1-%s-uK;
zwu!im7Sg9!maH2pK<Rxr+(_S*PK;1|54MMfC`bRoG=0dBnR$wNW$l;*-*^K3sAWYB
z7|VrLB?At^^jh%i`WVGpySgG0q&%mb*#Ny?(&hw^oi_Cxt|Hh60K?3aF0h<oQukJl
z_4s9>@3XQcgKV^=y-3b{NxYi^_XD54`80YCR{=u<VixnH$gC0c6xfwLu1q0ELc;Ii
zC%>>xt`IA7-KYmF%qe-53UnOyNj*g!hU#fsAu2}bY=9UT;p=@o#i4phlbLy10rd+z
z){CWW)!Ql_0<b+OGT*Gm(#@G<8!M17HEI|GGZM^7*C|&;BaLMcW|&ZCx76oMI8)w<
z5}<kg4SJHPwH0wCV=~of%%noR^dHG+0CzrU+J^1??S1?s?8>qn2tnYL5OLvXbNgwG
z6#ep1IY3C#EvQfn&54B-DJcjPL%V)KLQ%GUB*jLJG^q$9c~x<>>^v`bL42APl3>mh
z?FfM>9s$iqlL>KgOPL7$VNB<{tg=-~oIF`oakk}+Y~Sekcpjsl2q1r~z%uYlehp_d
z?YfWo<W22%gbMg?D7kwKXJ*{j7eJI;&&PLhv4I~9Zc;M)&!gl|5=|dB!J4+0UTjn0
z@AAd$DlalOVE5FixPaGirt~$RukC0=59dWTXEX6GU!V6@y>OZl4hg<xWjHQrt8#qN
z_?5_ejqn><XQnCh?$@uHL@4Q$;W#xk*z|Z9{m`{g1~op4deP)cr^Ic5ON6>(J&IQA
z%yPffW9Go0Br2r5u<re0AwvH}`EvAfUr5Q?NK3gr$RnA_%e?!y!Sk_;yioU0Fd1ya
zRT0$3wQIaHcFG7o8!@$_{c!m%lL%bL6>xjQ36Qn_o&Z|>k=uF;HK1|t$5AgRUjGAI
zy%VP5O$={oq~S*EqsnVGqYL<=weBv_(%qLtC>o7BAmTO#>Z8)hh>F0s{ZrZh^5lv!
znNcvRih#B-OQvhW^D-#fKLUWYFlXs|`pZ(TYv+Fg<<Z97s)8muz*<%RYBc;4b|p3v
z!yvFF4Dr{0V;2%&td(w3z@o%i8w2zF1OSW13=Nxc@I9$n(W|c<1@b<Og7&!J+CKRs
zXcmVh=jiXy47g%?|GOg;$#BDFai!{rSC`ZpS*2A+y!8@iZ{@n~hV-o4qH>til$^E$
z2cviAJtvyzUiGCY(XWGXnu+RZ(0{x{LBywFTdthiKCH`+2&F21f0R<#k}0XUwuI`e
zs$fR5lGyKxYq_bK1QYoG2v9p4+e#8?X|f)?!rDB-QDpB6#-FJzwI5V3jQ|0@5)HYF
zwDjh4Z)2+Zc1JKo*oE7(R1tKR-)!_Bbr{qXePjggGQ8B}qWcPJXRQH2xm&D*K6=*l
zYijA-zeLqEHA%^i>3Ni|<SYf_Ir{-ismqTven2T`uUc@kbX@YM**x26wS8<UR8l2|
z6W)qbx-pLt%|OOB?IlopS2uJKFr#@9#tAC{_qS92u}aKnyeDDf&~KULs&c8)BQj<*
z4$kQlz?7zNRryF(F{JUnhIXvOrNsr}Dm1TgZq&$%eur9&NL((BI+~~$yxYgd{c9zx
z*e~Y%5m3_PJ=obFK_6*8s^F={Kzz-l@96CO`J(g_6+2o!+X`qul7f9_TjggHCNw)Q
zZ!MT)Z*AHay)yg}c12eZgCJ}rQ9xboroW>V;#Y2gK3lC~5|RdrX02U8Y9r+c5x7hh
zoV{H=G&&Vk@S*E|yTwb^lP6pS<Y5Lvx;V0jCZs~V3RZ<VXsa>2z8Np|+GvPbZ(1D-
z?pk;BmPAvm1!_Uqn_kK7THNcfgJSkTPK-|`^1H6Iq%|F)2;<wE7A`(Fa%G0DiVGK`
zCzWmhSEKMd%YM%%4ufwDXrhrDNF8aW9WTe11Da?oz4k-PT&}$u$+~<DQ2EGm<nfxo
zdbrc?U>E2EclMEV*W=hFd<+16Dzf~^zpbfI<ChvU<Z!@$@9m`jBs|UE;)2BmA=6So
zsIJb3fR=>;Kv?A{QKL0{4!Xrz<z%}HESRnEV3)~<u&ZWB2bssx9X|yRpy<sTpsy)V
z>A)7V|5=faBiqKEd0x#Udp7zONz_DE!YIh)cgZRpr~bL<dmY)^K-9dRq?zc;D?o?M
zeI<u3Xei_OZbH}7A!_1pd@=zK51l>j&m8glp+f@MR~f*(rum16Hoj5&6$S$RTo!N<
z5Z(A!fdAfvG`goxeh`tp^C#?zku4Quq*k<2zX`t%On6n4w|bbBXeAc7@%n8R>a#cc
zF4n!tPL6jRqUOuk8C^>Zf<Uw-B#O{~V=p9O#xM3Y;EC=g2n=(xJKz&najmiZhYZ&z
zxf=>`S#iACbnx@G7^|}9k(yOzW(7;SL+;e*H$mZ<4-}5fzS>m=?YP>vY9pud%jtar
z)3rq0N`DN%66+Kkq}2$_PrnP54J@(x#c?K&!>yvf1@0jJRM2jME>}}l*XLDEpL=*2
zCYt(d4<wejwXak0apbtD?XOS#rm1&nPr)Irur+9SyN$MQ+JB{;AP`ddqB{CnjQe#6
zM<<)YGgCXDF41pdaRi2^VBwH`c{?(oQhl1dy)Hlxe9@G0x%Io)$nC^oDj9>M$k&Fx
zSpj1Umkd(ZFQ#^Lwr`amc*B8Bm~%RA_D?`C4O$#o&iy1V!xMJd{tyMG$-65BrL*LB
z$)xCu9l?NIxTYt}pwqO+Y$JZPX(SWM$^UZ|V^iGG-yqqhF-V0xO^CHBSG$#(-z%_9
z11rUJLjMc^AJ33JB?+<(BS@2zps}Vz{|t=R2b(Z1D0{6nm%10==W#Jm+4WBpoJxS*
z^~&^LZLpi7AiUaQ>?otNWT7Y=<HXAu>d`mPc7=gSOZl##`3I<u+go0?b_HcG{s1Oa
zyiTxe>jrtRaPVK@FZxH=l^shA!my6sAe+PV-`Imqkoa;6SZ3HHV9PrGo^0BuKZSd~
zi>iiXk~4KK{EZ-{yb426)@C=_w33prR*06i6F3r@^{d0n^&e=&!lwrEO;Ge&!)PEF
z2m0FYW*_;Zh|`f&?_D`;jdgTHdOkvKXVr?S0Cdw`m%mV8m%R=YF>5jJY{7g5cG(@O
zI_fA_GGHc%GDu7FNDSU#e6L*vV9i%h=0dy>;4UZodtGAZSEZdkG^&{g!rPz4eBs!&
zf~O8w2F+@$S6cXu%UPh!{Ap@dQ_ASl)HimAC?8K#G1;R*lzHX}TRw0CLP8Wm${vbU
z{@8(1X%1s*qaD+D#x_rHJ6I7Ade!nc^pg3J6<{#B0(2Xa4UpDa{vz@Pj1$}w9rpVa
zL-e<l3%OQMC=He5n>f}a!mepYgKJFFq&YP*LPw6vLrR)*#;4nHf09vPmP*kLQqruN
zfp(DIO{Q_Rq#uNaG?R`-*bty7_oe6mBQc-q;n#eEtpC)0*<i$cCTph+YY&!hktU%S
z{EB}S0%##(tfltL28Vp>tZN!C&VAIhgoLCtqXeg)?Norj(4e%Zf)g08rgq{nWO-F2
zAD6!Kg<Q=O83B(m{@%quVOL-yF$}_13Ly#U{)>HSgI(!g{s9j4+K7NLb|wt@DLAEh
z4WbUJJqE69w|^pVx67%#ayN-68~T!vjnS26^o<kQn$e$8E+BWK+L;HZc5N4MmCHd*
zrbxQdTs+dg8v=wJeHu+^_GtDIuB*Cb>B5I|nzl|qlG-CBcDoXr-Z}z!kVe9L#Gd5U
z>fifEt_{L3v8gFAmkuyK)!#4Eu!pWAKjNS_Hr>6)m%1m>BBRP#AT5m}TynC?(6!^B
zq||cwu*7!sbS@2+?g$vrbnNctwk<{7r|Z1LHJTlirtf9)lpUhfP431C&9zAKxr+rO
zNTDyv$)O>v+IzB-KwG=?Y{R%n)AsinY6IC$+btq^T{3ghPuXh2?(xx(h`OB#&9fj$
zIJ^j3iS}%now-I+V0hZc^)iWS_hk|KHIn30^g+wBIV-@M`a}TEuh#^F@%6eq5&WMB
z=w+_xu!gi6z4`;d=s$7QTl76~PdbQm*|5q6-_Cp{DYfl_2&17JN<~f`0MKI_e1yA(
zL%HA)Iszy@(;LmXBOvvm>ppJLG$-*c9GT@6G!g*@w>|sEk=pScVud`73((_hwsA5`
zts^Dm^#|VcL)aA^OAdpumW+vQ=)bWGdyC}vqiw*GaS}ivq(3LXjb>ff7?Zn}Q|i1;
z+vtV+a-8rqD6M)>Mg`7hRy^cTHkGuRE~(KRXESq+d9g52d+r~%(8HM`rXOlz1@`mY
z^tW*EHO>sma#?`Jc{It%4l?yw3#^jd?Tz_{DA`Lln$bM1l3Rp|4X4vLLP#=$9Re8;
z399Y$P1Y}-8(TN54x;0*#0hVZ$?oC0CQ8}4_+~dMb*>AH9~XHQj#T?tPtqdl=n9-m
zH1kvWf2Xd|kgn=yIUh1E(WFz%3AB)kn?I09z&~!=C4>Z#+VkIVKpcSa^<x~9c^4h_
z@vD&65QH+eDd1?$uc`Pr^fNe%H`{bKqNdf*Pe8A(n;X+VMV)mtDh<*p++p`MdvZK$
z5~^_st!U1r?)skA>aOWS1KVH$x#-umKm(ZH&Vx81x&gWXr9fK0{mYdq3M3p<%ENx@
z&nan@IwA4zJ#Ku91~*C3Hcn@jxAb#myU~oVqEN|qk;ZqCc!t%Jwo2Yx7Y)5fQ>*+5
z24k9`eHmlPGPu2HqEZ}E?lPxundY`wf&+<C{9|aeCl$sts!U2ZKbN<6_Wnl!4V`k6
z(#`O<EI<(m4nyUue}tXUk;EVjLwmUjupk)vZ|p)6B<4PJ4R{zf3pTc%eqKG<Hzbrw
zJt_xmo^r`vy26}YQ1cl3zqzPP;qxzH&h8|IO`>a?nAA11Z@&i=JwVb(W$Ee*g$JYA
zokURsI|j$CUeYI3$bJnvB{v28!JNq@{WaAv5jf<Nw2fU&k(~g=ms6Ms#O_6eNIID;
z?&|D*A5_*{hfik?o|9=^!+;{KA>SaE61}tS*!++W3g^x+C)a>>h1O7g1a=Jv0WNDi
zVsnue!6E!U$O0sb+OKS$KINJH9=;~cW7_e}`8-e}ses=L-9(53_$HsIHh9`Mf5ISG
z+01P`_WI(~J(n>p_wJ4$LclDdQReq5j#V?;jg0oU%zbFD$zK8;eg!fB85J^99-I{a
zcOOX;uX$3mvG1GvoUpehPC1Qc%?H|^w9XOTui+rvt4TBZenMQW^x`*Cdh8N;P_lyZ
z2j5=+m`cv`vJkheSojFAJ!$%yp5yCNf~9)+qX7b_Oo$Pi5`bX(1<3Vvc6l0-!g&9}
z7Lx!Ryff+!wy*hT?mcYw0(EIRwrA?nJ``#$-*&Qz(3Q;|5r`aK1xxc0RN55X+GFRU
zkCI~e2<v<NCG6Ug7zAP9l^`$R{ugUevddRIfSJK+OtY`!us;xYH5!o9m)2JlSX>AP
zr1_F2+I#y{PQ!9Qntk`Lkj?yuxH(7K%OfZv4M&a*n+CZu21QTHDk?yZow|XC(ArU8
z)-7K3GC#pUKYLmd`A0gXh=O!BrqfT|Y2eqiekIg-hJXaP30A3PzLJQ-NBm_Syw`VS
z7R)O%Dk^|e5hh^RtmPn@k68~L6w(+5pS{6th-{S_@e{q`k(9)_Xf%cIb#Eg?^U9|V
z6JSjkBl)bKN278<<l+(p^8{<fq!^V8VC;{RCv+-!{aYCJ;?slCK;4v~(j`<ShP`+Q
zdQ&%MAxF(sk}HsA3MT1h6FkZlABW&(+y~M>k|*?7-qxcyk(vx^*l1bCb^Tj^kGe4&
zpytWApXB%uFSL*AA;lg-^JsU4MlZB}Ege=BYM1qMV@~`kcX;A(^NGd+ukF-%r=(<2
ziVKtGFOHBa(W+6-JPtFTVRV{k87H`bg1+jzU}$bLg3T$vl>evkqqQVV)AlkHjEL3^
zoZRRi6~M_23%bT-s?S4BDG5HpESeW<IM``MU2OqLd{iKU9gUv}gopS6Oo|FXu+5Y4
zZ$HA$>^6cJhM^q=mTVpFzp-QnW71zt1IA*Y^&ydbAM*2Su7@-sd*VHl-8d-fB-^k2
zk=PCQZ&34wdu5P<JV1=~D!DP_mEVk}GJ=c!^(M)^iIbYOC$Wr8gIjF<qDo3CoQ|fj
z1#AA2L>~7<MeemAgRD3jooCo13o==dn{(^{MQ^xt;doMSwjKKFJj#^6EAT4QD>VIa
zPVCu6-bUHb3(&IAXvWsDTRtrU-9mJ7Xre}NP*Z5O^gpFgQ25x+i}8742>U<JgO@X$
zig<KrykCdDKJSZ0Y)j*l?#wvGXXF$su;EiX*mN4u&F$FwJ1{L58Pw}(RpG#&txuY|
z$RDs7jzbooFDF}n2BhU?#JW<|?GkzGpU@P<PN<t_Hw61Om;R8O+Pz#f@+5<F^rfYl
zzh{NNwH*-6tJZ3{$v4~LZ8)*L9piy*a(d|uJ8QTE=Qn}-@aU;qC5;Dmfk*hrqnvp3
zsq2X(n)Y?o^o2*4FhF;XYNiEf53x>G#p7X>11qPE=I>?5X09<GwDkS00sk<_Q773*
z^LXXN3M6b!jLb%ShvgI5wsZ@#QIJ*h0#2OQ#KXywDjVmZX4t@sW<=xS@=MsYWjhRl
zz%2=4l&#&>-(bRwKP4OBG}g4hysnZmrHRw*d?zXuY0PP5CeU2~9pp%E$F>@4$ojf!
zFkHRUUf^P0LSGP;>DOn#eSA8NgbtH{7+bHBr>=x)+?f3~J=x7O)&zA0a>SD?6#v;h
zP4=U8syiQNO8Wt_%#0_G3T@UW$rjS6C%=+at8qJ9UBMZM2#m$kuQoJ(tNelMjphJG
zjHQk2Vnd8jewn=;$RQ;pQ_@Oji$S!kpt*H=T<Bgny$OuE9(7Am0n)Ce!suH!2Cmvi
z1&-K8^m57qk<ew;=P;llhLMfEa+1G;3RhIPvKe3g3Za9Wk~{G|S@rrUkhyS=wTB$s
zxqfR}-v{K!^+8|qk%5LAfAjh&Xu+4x=KIxTIQWCE|E?hP;FC$sW@d)PjVg1d?g~O;
z>v5@Hj)+ENLj76@`ba}uS6C<uG)c485O*qRL<yi8qzeHq)E7zsW}6<2`7~sVy{gs)
z=ux^T8$CpJl~2ERA-MwBL<Ejacspr1-}V=w*`6y7SESLB5wNq;XITO1NVc#H7MmCi
zKis9dARoz_)1S&5qhb4aA(%;H*8sI*t+Yby;U-cZgEDiWrCu^NSB?s%1j7FbyS5|<
zVGwqumH@5yzt~!}i61+70cKoT3(f0q1)bR`33A&&)nZzgF--<#(zH$QxKh-fE0>ke
zIm`VL##`}wD}7#ODAaM*@GXqm*UWbe$q;iZ%KZ@ba!(nYLT&3t&$$6LWgY@)Mw183
z*c9WlLK(neFzLFcNbecW;itwYVC=}-gX95_4<iIUdwH3Qt)yuWfd6>uY=Q}{NaeDC
z@`p2}-f+AE=)A5#?dx=@st(G@W8uH$KO1aFT6SEvMyk+I@~!}7Vt09zhRoS(XH6ia
zAF-4(fH9244fTs)JI-UO!uB{_EN3sN+5r8fNN`z`^uC0g-@QO#7u7_UMo&3@H(j8p
z@N)Ap1yk;?(;7fN&Ppd}cn%#y%>Y)gS<d2cnx~AB%zK3yt<}#(qx`lAr3w0NtW96q
z{`?prC8m+;bZI1?J-uIa#`<><t0G+J>mWulEUkWukYh(EI?OtKE$<Z1qC(2JH|8sq
z+vKfT_k(k*>C~dEK#jpjmm2PZYs+pOVy6ga`9ON$itS1<WR7%2VtWbuA$Vx_?A(h2
zlCF+kw?oiX9Q(LifaQ*xTK7<`RJb7+K|Jt^ISSCvXZ(vh{SkIX*A9a)3|%Q8FlPV7
zUYv(5zSIRcX`6zv<g0rHuziKgno(}+uGw*z*DN*$Wj|`T&!ZQ(bVHD0GuSJT;l1wy
zMp|rckzXcY%l8pOA2k$e-ZQBa;+FzLNFUM^idl|vzvt|HQ*Ihle+nAUoL8FWL~CM8
zYX`1qni@m4sA9@a*)*X5Mmj(u8KZh#++_7hVGLbx_V;_TOM<xIvXcp`*Kw}SvSD(N
zc|&$9V1pdNSq_(xJnhyZut5HnDbyfBrU>h=6t}R4$j&&DcNUqP(;5BsR5*_Rs6wr<
z;{PFvXQrk?u|r1Gd#sUj-}hy%W!C1<S2JVVr)S6H{VS#C>Pvo*EnzI;Dw5P1cz|gH
z`Yg#{!Qu<~U=q}Ij{R^EjvvoZR-a1tj=--)vryNr1S}A3Ih{9LlF7F&z!r<h)$5md
z<|+(~>+yb&ct#*&1YwUFg+`ZCk4UX%y!#?Y)eK%S#!JiLAo0x7y!H(^@uIDRW!@Fa
zocn(hIkWYi&oF-kfpi?PCTg{()xBmW;Awn;q4Ik;YE4|H#wv5JmC9k-&Ixaf|01t!
zWpLJK#+3b79Ia;fnch8>Y{FV2C|-|~z$@Eu<6KI<AnRTvnyo!g_#^DvjwA+QSW7mT
zVES+D);W;)xYHJ}o=n2xhh&LZO&j!|&Dl5;p1RM@tFbW*B7ecQ4Yj2HmI-pM8OCP`
zS#hg$r(eU>X1iYiCfAXtP8D>f>GP5Sd>j$R{PH51v@wVLqzxK*r0aTq@rqnT4?oQ!
z@}1|G2;lqpGpHlj4%$<fth}BMSW_2SptXt&1jr!)@xCCzH)xNTW|zr&=trQrA!Nl%
zcQ*&MLv+Sn7>vi+Vy()hQy_Giz8TiT|3n}{JNhN9_TzPDMXYAD$I0p3!}(SUdb)~S
z;6o;ugr!=140g&aQ}<@XY9iRHuY*RHT~C*lN6?&RMP8tMLp|?ZR*^xlW_VyBX0CH0
z>v`mn47>O~j^^x_g1xm0q^({H1L0>qL{Y8pZ1u7_<?n;*QD;>xt3AAwjY0-M5!omG
zwZ|d&7JJNw{t)n{X^ZY(mVvFH?sA7Cj4AshyNVFNfv0u-2+*x~ARbp9$WGM>?O+iG
zer}IHY^&lJfc_uBxxCQmn{YTHua|*LG_i4-YDBxk8K%J`yhziMBN7{^Dc<5y&F!xN
zJ-6-j_GN6Krb_s1psdFk@K>Xtja|ZdAd}LTP$_-A(&ffqI0!%Ehp=l)au|eRR|>Xb
z@cl2gB^#uEsTc4}ftp~wE~PxSG-h^wh8L;Xv$`Y;uo$6HTMpnil1R;e!uw0x*L4m5
zHpJlf<7Cq1p5QfKmp(){Fz6GomMUD-mTzwq%acKT1%Z5B5@1_dmtV$Ua~yP=-PFCH
zzO20t7a<Sl(e-snFhlL~dP4}PsRhXwc-1{hQrlkTc(!ma8CL|S(!;Y#5x1aA!A)_9
z4f()szCtOxHHqNn-6fDC{W{D8dG!K`GI0#vHy&^29SEMtt8|{mt$9az4`+lVuzkz8
zZ4xE<5xf8aHLI7BrBC3~w%WJER^$+?RBj2Y^(xEocV&i12@qn2)Xc_rhEzKC$r5?;
zaAeUGZK-2ODD-}D8S996KgGOx9g^RVi=oW<=B~f!XZiLjJ<X>P-WukLH9sCu%v6{P
ziIj`ri9mY_{P+>_%mp-0J~EPRb>#`ZNH)j@T8=o;GK2AZ3A)^KOn}GYoP>hv@D&C}
zUt|>QX?)!pzuA`|K=o@~V$H|d%&mT%mfHd3mkprOt<N7j_DOADK^?MY$R?F6zBzv^
zgXFJ6fl)mr@T$uK6p-^-GSB$4fr<Jf?AnqXhC$ekc4C9U-2Y-*r$Ne>dI4tACSa^r
zBR#28`P|VU=jJ(lv_H|TNAo5sye#<UdpCR$mLy5o3Dk@r&&IaDkUw34lA5>8z|4eE
zL7E;EbUypKtaXnx9G?8rZF)^ce)8k~W*R=@PCJYHLcZZ;t@k??AVsc^Bn9}wHRO)O
zxnb30#P*cysS~N0`4Hca_gSNtCq?Z?fuOf}B2>9{2X-F9_m2um{L{cONg$|qNVj~a
zDXE#kiCfu6xOLi#u23}J;7viG!o8i!ryx=jSy&E7HZSzhru5W~!I4S!K5T8yy^*%&
z@qm>|JA5A6Q-j$zhe~GRc>v5dGxSLAr?<Vf{3rrbyM`0`>tLBPZA@N6dPma?X2IQF
z3lq|!OEWY)m;n27@3`Orce9rCQ=m!iixjpn%InkgNjB(Ok<_#lOyFuS{ZACO%h95k
zvs2K)*mdBhKS<4K$8+O%v=yjeLq9{}7@0vb<7ZIALG3C@b@oK|!n(?sLOTFaxVCom
z1VcAxVCH7$rJo8~cjz=gOYC>28m}vc7Fl^R-*7Xf@iQ_Z=J;w(L<PudEEz4cvhY>7
zzV=DHkY8^2Gp($xT=w5TVds`CK?uUo9o-TEk^OJ%jy+A{7qbDY`eh>tCqIa%R!Ys8
z>|rcS8mgb++24f(mM~~K7n`7eNK1{i4ZqL2m=#(rmt+2l*5GR!%nA)g9ce{mpWE2m
z@NB~}zSK55>+EaGk0Nk0d?C|l*DfQUA7Qlp>l1)BLau`i7LcBZV<ps_QH(hmNcWEA
zoF@^{-v;&}FN23p1xqG&zc=h46flsH=w-^3Cttc>VG~S9{6{^B2kX-s`D|m0RKgC1
zgX$f9#G+j~%_biGJ1~y?i1uAb;P@g1O&6O%1$OlXTypNvUX|n_hi<Yv`s7nfrH;Ij
z4n3+0mDAhp588<$QY#_xjvkfy_x)~~6`XW)0(4_0(jQz~9oZ5a<V0`&*h$$mvEDvr
z8Pv>lk}AEZL`U{l0cPo17qiq7W7XNmep-T~f~NA*Tc<IhXOsK5ib!+DOOtFkqTOVD
zKsx;P1mFMVV(%#Wj)M<qho3hC|7@u*TOT!bwJYG2G`W~x^=0d?=DZK&8?Iq+706rw
zI`5tk?gN9_3pSP0(Q{~r($l$pz+Le<*5D#Wr8Le%*lEwG&Y_y3Giu>PUSmTq13PDG
zTnJ-9hQwJxP|yDpc5O!v#2~CC1C}5CH+IL~BIV<TG~h{yV{A!C|F1wOa-R>Qbb58B
zdu2-<!h}UmVUZG<q*Agy9AMm$5g*~F4sy}4S|S)PSCb%v8@ZZEwkJuieotFSB2txn
z#x^H~Q*Ez+sG7a@QD$eAF?PS3j3;E6sGePp%=1yRMZ1FX4Uft=*lTjy#`_{rG>+jK
zt6>pxYVb=H$Q=d%U4)DB%EZRoZ-y(hU@+y!>{cvF%rBooY|Z<w%7dz=P%~#}v<8)M
zX)ETY53oxQxqDG3+;zh0+OTHvB$>b664`KCO%1`RXJ|XyZC?Y>OwBlly>6AM;uCc<
z`xQuK`w~2F6Y^N<f5;EtGsg1WOc|tQ*c^SYb4e@85iz?21?PQOIh@zW->%74xk{sK
zPj+kjpR9?R3<fj}J=W2d`u7$>L?{VlfaV+f)NGXR9=<~egESENikg7P-Q35~A*jv;
z4LTF1zg*$;uMtGZ^<OSiR`zp=M_LQ4Bj|Yl7c%oI8MiSQ@LFF-NLp(IQaA1tkox6I
za01rX;UEYQ3?sg?oft$BHR)UNUO-bscsE`6&`Y%uiX&bUbdL4T4&)2FkGDoBY*YT?
z>ja;5ot^U!VOL@!APmDcIzihcbhVrQ2sC!3lgt7Y^v&ZZ2N*<)hm(`DdFr)G_N#0F
z3+dD%4CtKpObg^%4&W-Hdf|Df%KR%2RZRT}oz7Xj;(g&$dWykxJqu$qL=Fy61;qQ;
zv=fH0PXk~^=2XzVxWhnM_p;TdN!(y`x;mG8?8~Q?ksI4Ivl(h{4tiCJ;Dug^i`31I
z7H-TXC)18JD%XE8OOWQZlvvvdV57u`NG^+QZJO4dQhrR3&r>3%toSq!<;00fxDa~X
z%OaDB;?rcH(ohwD_49vMTl?cLHnjN3dP`rC{GF8z&3m-!)AS$2O)1^G6>PNBf!W4i
z81z3V8pp%<)2G6aVIOFqrt;jue!8~AGo$}&u~{<9$2Fah_m8EZ)>H`+K7u5LdCzA@
zzu5-XVHB`6UnpdT?eo?54V_E4PcNB)M9^uWb|a(aepCEEHsX%oK0+UApPd_!&^H;n
zmvSaXz?N)B=S<dqIMcUD-}D=&ro^DLw2J~>8W`vu<tRh459~{%e#vi49ZLIVC})Vp
zC%8pd%JRxf&V%lNV5djTLRMIH>_YXk4(8-Y4e7}Q`O>q1viNY8Qb$bSS`RHDVnM<C
zt#df8#%}o37gSa${|Gx5+lXNphHg|Oc4$faFV<5Mi3VEm7C4}3KC(zYzAn0Mht4Mf
zJ$fvYJU>|5E9OLyTj3qbnVNS1>q8BQgFeo;7B6iDnl%q&XZzv?aLg`!hjtj_m1%Oz
zhS7r8=L=2*iDtIqm1*)EJ6PgS8U0%vkU9^{NE96Goxh@+OOG#KZS&3K+`n)+I)Qqf
zaw!elcznS_dJ#_(6(!{^c)uZMRb1y&Igj>MTqZ?3_(}287}CdJaXs{9aN2#!Tzd}=
zq(<mTxbifKqnRzA&bo|w-qsZ{cvYGk2Q<6rJG!1FGgI<jaQqE%WK`=tA*Y<L$>8u_
z`HV$Fz-QdCmKQW902}*k5h)mJ(qXK1Y<RDHF5d!PSB=6smwmYz`hJ|)>Q^g^lCz<f
z+z>>mm~~^iRU6s8jgs*y1S4LfO9Q-kStmYYs5As1_{FX)%A*t1wnJyDK=zq0GA>)4
z$mE#o=_^{sKC2$){srGE*{1#*Knk73)}+f}-1VCwwwlAB{#u$_u2glA2DXZtHEdfa
zM}6zQWCy@J&9K#)+hhKFoH`>8eI0@i=6^|)v^dBe<RbiRG(zP38R!VbI^?@y9Zd-s
zMKaD|hyTl=^Em5h?^zKle+j#?Yl}e;*pi@*QrheOT@o4mA`Rr2O@Z0`S2QvD*wqAI
z1V*E2HSdK_M4dm;p(SjHkkdSrw>wac0Pe00j&ML4w?&dGl1&Cr%f8G18jS>9S&cdn
z!-+m{W9*H34J(iV38R5$ls;%y)mBNmLL;$ajHc;2W@J{VmGfXUevo~y1gpaF!HchY
z<blYi@n<e+?XzbJd99o`KuE2SZk*fv{xBwzptkLYa1?3V2m<fWmj7z;4_9gkxjs`C
zpX6xS>yKIm0l7l5m6lmekHlV{;F|KQ7H*QSeDD}g^o&bfyS@pe%0H>jSlUy1S+8KF
z20~bh_YT4|QZt?)*=ApHi-YBt1M5<+fz%2cX*TsXGVjd9b~%y71=FmNqwO=xbXS~S
z@3Bg5MF;pQ-@t<R3RCLMK{XvfI$a}X3pD<*8!bO+WtY7!-w7tN`2ejH*h7=*gVR>I
zda#{-;PLD%M+G=QjlVxTge5<yhmq6SP3kout}vIf6ozIgY_&)WO3k4~hQnjvk<L70
z*XNybkHp&9;>tyBRjr>xw%K-R%crc&vZ!~sL~EewdD??~?~}wjVj1aw_Qr?&McYrZ
z^!zw0F8{OL$+iZf5Oq=R#}$%(7UqtAZeaWqc5YV^gdh-22}MBiPi&XAE&8h_0Z)&I
z;aOf5#L|3Z<UOw0v&pRiX+$wkDMiE;l}%pxet8PC=<9x{b5L*swlq~R?&NJeo3Htg
zKrhnn3i`@_;?<ap;!P$u2Y>=x2WkS9iKXAF+(~LS1LTsaYmbIw1ZqkJ9==f6*l668
zWMfx__ac44OWK;q17+C<$71}1_L5Ut>O6N-jwbh#pNBOjJwcp~mlS9HAUR>(&P{Vj
z{%_S@^2CFG=e~YHUy-I=D&L@4J!1dy4Y0|Ken2@zVAPYZA@v2D^gW<$(7Q_2w(t+Y
zK3L$fpG;Kn_A$A@))x#iq#N{OO^6AdZwGdh1|~SxP3IeIO7hA*q`@2oxP;QOIi3wl
zY<>a+k%IEhKj^U1Jn@KWXhg2j4>&`634-$y)9nNIN!;VfijJ3-&120wuBpsX8mtow
z61of?Fb!E`U>uz#GXN{<|HtubKpGkM34=Y92D|-zOK#7GpndxIP*fsd8dn^-b?XP1
z@hIhWf}X*pgx=GdLqNR~?Tu3V@UzGX=tbHzn8R|{UPw#-RSt-5gaF`?*i$%bPEFms
zYd15k@&8wQU#{*)-r(IEAJX|#1l-&HBkbCeEe2uGmNY7f``_5T_B7yE`rmOnt*<};
zuTOn&gCrz-sK5mtcOQwi03?`e<D%6qNBGD}gvgrF_tZONb@sH;ms3)7&5F&VW~43P
zxs|qhhXVJ=Ukc}IBC;es466@q#nk|cw20Of)ACUjD6VFiBBa*f02ZaM4P2#m7VBq~
zrZeGVXIwT!!j%n@e#WQl-aTVf*Q|Y=;Zqn`P>_oZ-8MTGPUUpC9MIS|beyAJ0IB0m
z5G+O@9vMwOxQjtp2RO0%XOgg)zNOW-&Nho#YY&lx&HwJ~(vc3&UcA$jhWb0mF91P_
z6A0cMQ@;A(52b@#BB>rq2iY|f3wfX|R}jLoH8iPf&>@77-!5tcq1K^#n~clac?uiu
zP>jK>7nYPY!K4;H{o5mN!(O-aAqfA3yAp3OAz#0bcaR=-I?o%l&g`J5H6f6+#?ff;
zgM^n)2vaS9L~u?vUSN(o8i{-?d|bnVt!PHB;IS*0<ZYD9I+C<GPY(KqX8ZjA0BhFw
z;Z1YrpEc)8;o-^)tVu*{Q`(=VWXpWF#~P+y7Mm#f&*l8BbS<Xnin4zR64$iRw+a(C
zS>e_{^AgvD`gROjR?kNLN7%I>Q3}GaE76t`xc|lWp^!MUv)u#eh$#IeP5ynoq@DR&
zJxH40pQ83>8wa!5UCeQo5RaWF%>pe-SbQvgkHcj=KD#!e)x%<A(S&nG($Xu2TEnQ%
zCup?BF`0ZMi=$n4m!eZ>v~bVcrhjtaDb3F)<2J5g%{I<7&1c)k0khYO2-X!~RnUA%
z)(=rX0X^n|<bb_$3RUJRX+vl!8kyTin((s`WzfbQtl0!O8Jl$*#B8#L-_SV7Ft298
zGXvt(53?+BaWo0(GVDJSy_$2c<s;CRnjT_$<d~cS2rFARkXw!Ei=JZ<34LMf;sz|X
z7sZmc%u^D_Ts1Tgxz#kgTe1D%dB{hZxxlE%mvJ(eeb}}G;B8oZl!XoK<LGr*77qvM
z#Qfa_2-I&O1?`gvxBO(|zmlTY-Au@?#+*dkw}e0LlQqc#235I9gWz9yB*9_kf8GKy
zZFJ}v><)VEbUf-sEC$Pz25yea{QjM`R)VpRUyVV?{0q3fM+2-Z&Y;N}nED0Q8kunE
zS>J(mjWdVb=i6z~+ZGTj*`08Hk-k0wd$yFHL)o){Ae)!MbK-6HkVQ!yCp<-9XVwv(
zkh@2jIzcLE>!Y`1y;HHt{vOWxL)f()Nf3g-ln_)f|HN*bk#6tfxCE@yodu;|zZP)Z
z{|2+{6?xINC$;rC2C_NSVC;9#eoSY*iNzEsN@1O$u3o!*y9p~S#b&Y69OrqO)pA@v
zc+D1630W3q6C|=P*05MXa|KU^!tM>LBS<PD>Rnh~8YFX$H;%nJB1)b<QGQMbuh}xC
zp+o?$oMW%iH#bZpn;3hxHC!9CrY|`YYx<%u-<pc@;<W+48<=PyZof_-$T9ews*45a
zU(uG5w;iw$vs&}!l-G2`J&!Yi{8o@v&QzWHnuYOrI~dJZpS%`^cqezf2mjhrfigrr
z5%mrS3z3Ffs5OV*d7r&r!Qi5i1?r7Tyj;j?eYR6!<AYFYw0sfl23&s*RM@P=JS|aW
zMx503B_%c+H=HytU4jB*qV+lOT@wn_Ns*81n{ixzlL^^81!f4;2%21vJ$qQQJ_kr_
zW-uKsRsbpRR)Q6tkj*v-6#Osrc5SaS$bBFh)_cQ1Q<^jMCQ8nW56pf7Nlx3u_e?CF
z1}r-3T^Iu>`CGj7;{$~L^D??Hn+S-$`bd_;vj^$*F`#XC;ZW7G@xSJkCGzA~XiZ`j
zev$@1!Il5>uwiD6r6TneLSCj%e?kpEgk9Nn#2^f83DAZ5Z!E!v8RsLS0li&gqic>G
zfnc;wO*(<u@x$GzPvWCtv1JmM%^2ON{Bp&4BdK-ceIKIo$#`pKU4K>%&X+p*pbq1m
zv9fOY7#x>m9;4s~oQf8+*YKrquwr$xbZEyAbv3DVA?omjZQXE9PdG_k^>M;UXXq0p
zy^hnE$ZDDDrvS>A8FjYj6sVZBSvLg^eP=aViMlJMR~M1Qpk<9W@)#4FtA$ak|3uOO
zi9<Y_fkykCFa94Pz8*@PJ|!bquU{uFZ2BP5BT|VKY4!CKF!k!10IEiCxqm?y#NOCE
z9zTtqrh5|k=+M`xCQwH<38UI~1IS`rE*I*c4WoObQXo2V)B*e>cusK|8X2V2ZAoB*
zm>~Tx#`d7wvRM5SXzFEbwdFI4l&I_RzzgZgYTDz_|CZ5KooS8`+R}PYeA(%OYWhWK
z6%h#gF>(RiVS;&qiUb{NH2(<FAy0^uFxB9;=C#XyvmM^(F}47D5dlkWlLU+`04rQa
zRJUgnzK5aO3A31xS!{ke3P-Aejrp3w8C0WQ@_P{>PK1z-*P(mEyr5}4Qr+8{HIp5b
z7xWp>D$-$fgx^#9A?)0)AO=Ao+7d)j=)bYm7zV#)8}Q_zg2LSS>cRahl~~r>-k7}>
z1^=5Nb-(VI4=duLOJWFri<H=G5wDjj7P{K~c06$i&`VnqdEcIwUbd*T-ZKk@mfMr1
zn)jT}qEk<<d6Cde@h4_n#TpJ8npLa`fc&5JMYNS5!TEQ@9(h(mYJ)T6ZiW~SxiPC3
z4g(y5##t05$_MZYRt+qSNVdzX1>osZluTQ_H1}qZ)jGYDbpb0fyx~u@DD3A!4U!Rx
z6$w4*Hex7d(~v(S;C6g!&8Mb@sDGg1WQ6i^$F)gp^&~n(gNtJQ@~qLqxvj8)9gdr4
zyOa~><+$uo5wmmQnWx5P!^vk!?#1CpIvTxFb(!U=T2|<7fDYJrRo(?|#lsz%igmgG
z=Gx}qj{wga>AiYxrl19Da<H*0&e^B?>}$aqcQQ?*l`FEy13CVjg5@JHY*vr_8R02<
z7P8Q^RM?co==>d8MjGn_wPe#kd*&a*8P`kD5El}7Vm=y=xL%eu2PB*dz*4)fr5kjF
zfqt1Qg^PEVeEGZ?{|=atZUA1+47jgf1kFQTF(Gk6eR}}}FR{{7y1^-SNVfu6=#!l6
zU7@D~Jn&FDFxDSo=XNDA2*c2p%v<!|*p3;H=1bc^P7X;3wxz3En)SjV=y!f(uE0Nb
z6pb*sj7JRbZ$UD&5cYGg8;_AW0Nr*>AcM`MQ9K#0&pY?2Rl2Q7pwya)fG`%fG|O$q
zAB9mF6B6$bnG-~fAhE*!?NI5{j=E?QqQfTTh1JS!AQsv;E%C0yE$+(c2ib3;5<Vp;
zU3Mi4+YSEshPnmw_@M=L^^KYhL4rbS`mUq~)HiHNDZ4kFp~<ApU)9M_V5?wPi<*S&
zHDiKfiiyT!M_)Dz6pg*{Q6w$ckNni0?Z#YzJ0!cxr=z=?!0lG}gf@hL7$Vt@COx3f
z0f5FeV3I&~1RtmI<p0=@qA{zu2ZW&*n?-K;iUN0Db1F=QrF^zU2wo8WS!~%s>4ThP
zm*(>LU$(|IF@p>FISBKm{^xDz<nzUTU)6DvjHgiDo=*e0YZm4ZCi~WxnPWa}Jpj3D
z=2V7wpZCj5hfnj{w5B!v$*yzs`QC;kCBmN@?zASWv0aJR>#^CF-pg+<U8=|sDSN%9
z$w{ZRfIf7oEPj$sY7l_Gs=ot)Rf@`@H6G75pX>Ik@RRGc$`3!4lE`f(Xc*ig2ZRkM
zbjM`cgtb~>aD2#lbe2V_>-!_@N{%1~VOUFmgDv`RYzG1opLH7W<OFP8`$ZI_I!bi9
zmj;2iWsS{$qUIC}bkk1ZtYAf)NY7(}(WTO+)M_p+WV@K<8?HiY-gEyJI2U7gSkr+C
zx(mQmka~p7bbYk^5+tu7rEwYSo&uIb>gdoP5f_F3oLf9T&J0&%&2ZA^aX`0ag_}Rd
zjnu4tJ|Hu-hf;NqbTAH=Yrxqq*Qy$_Oo!*!&;&-Sf;AJ5?xQ7<6`E1{H(Pc$rC_Ff
z8(dasiWZ9)EHHBYA|$RU9$ekJ7iCH10v|YyEO59}D+LP#K&^jN2tG(Mz%ZTGiOEM!
zRe_+IS2KDNvG(L?4Y~7g+Ar&=t`4^qCOHjHkz~jV%~8m(fbE?ItHn(hmta@Zj-kiv
z3mh_&P4RF9_iSfpHCg*k`-C>~WjfT>)Qd~k<>ZR`Q9*rn6$@<~@NZ_#)qK~Nx~3MV
z9c?=k-RT(Vsn7`_8d@#<s%v><%lqW>iVLnG+ju5nD%If)G)^igJ-a(kKb?obDFVpP
zp~2a>H*t3AVIIw!TL{Si3J{<@3=+QWlkB9wd&*sca%=iCNFy^pP84MlR@1wHX5$3{
zw8x-l_>ZtFORgA%VK-`70$BIISf2@&_^ICoJd=&svX+(yD4J36RjN|fK0_THIZB>G
zZYFd*1Q~8P6Kc-t;>7&RI{TWPks@<oiw)uiob$t8`<faIc*mcbQbAGje%ka-3ZNe}
zJ}<`#G$~+ghU?@W74sZ0+hZ5`>j0@rKnQHmI1@iDXNVfa9lusaPhV`I8dhF`WL>MW
z(V|tf1MFWOCYpe}MsC0}wAp_Jz)1xe2lOkecdyhAfjxI7F^E2n#_$`|1Bqh$bETh!
zOwnMR@IW6`7b&EiK!cRpF&k|~#o|Sjn$Ox0_+!f732BQX5%Ws{ItLgQGh$m29nbOr
z9|JRD2l1!oqdx-$FjA5QWQn$(i~JN#RNYptNGk{)pSqDFazcDk%G0A!7+O4^+2z1)
zWL|#}5TXzupJQH}V<VZ)a_dWkz{XcT5()Ltg*X{22X9cw*2R<|{}Yi=JFhowM^QLz
zKQ)Yx97&C}lSf6Y{8=cQAtZ=ym^i{-#gE*yuZI*i({#SvIYd1-CV><-Yg}{YXndM)
zT*dztDu3LqFIv1{oh_u_$n?*TO2yafN_a?ItB|nr<or(5ro`XguYsMgY)$ibP?@9s
zIU6J|o`sWY*{qn~Kf<mBN1_mfT}coW?tigeU2RP!%Ur<B`21i?+y6&kj`np0S*2v7
zK)IL5Nm5}G9zovfxHRvKva*^@8LVb$>R|{A`5i5-o(B3nqv^($vjy(`r~^w<Xov3&
zaAIIVuHR6?7AfpRllHhQ2i12{zD-iWYR|#W>v7$t_cpILg$fg187eieBUxM7Gv(<*
z&c=q}W7>^XmmM%!E@?_^X5zLoIY{2zW7Pv-LHc;|57S`fHKPp5NTmo-^TD@yG+516
zq(X!^gl<0q8;BK|R__XBjy7D9mr2_Zb1v8+N=uH^#|__u?@R+qAFV!JNZPp4N4~k!
zg0pVv%gfp<%8WrmgOTPV%XZ=HLNBn1j~UWwWv?X)m7RG?&L|=u!yg{99sy4q(Jq7?
z3~O4Xu3kD2$%JpwYVp0bOY2{z5gei_L!~?$T9=}3P{@uuyLC3?HMojwjZXa~&^+$K
zX!y9~m#jB|)c+#zJj;WM?kYZUx_r5C4`Z`Yth2NC`Id}Lo+UG%hBDH6XTJRbkaUIC
z*YjwAf2>hfYd0@=8wQoK+BAk}KlbUJij2?_6iw=D{%GjKe9e6N`RcmEupG@B-0e&p
zT6O(U0R9kmF1QiHAP~J$z<k2}FIJJ%GghUN3s@U(g7E-v{;WX15FtxLwV2S)PPt`h
z9<M7&RFi}_oH|Y_6)kLB6!l!$wkeOb^*!$cs@nIxoZ*R2@%G;gE3mA6)KXuN)9<N2
zo4=G38~OVay2LFC3~791!hTFMEa6CoEm~2|`8;bjhB0mLloScvjG`|;FczE<s%@ay
zN#v{^l>-{-a^G~i4V<`MBYB{l&`4;*t?KcskeL4n@Tb-lO2s0Md(p>35YV?fBfSMg
z;O%4vR+obrskV&$>xZkr+>Tc)+7z5$8XRq~^jtYAU=`r1l*G}2B{=hK#w=GLMAprX
zjNIg=_Es1>Ba8kul{?5bM{~Q*b<f2p+*CmN$z=CZZ6C*HUOnc0u!H9T|3BERwG#NT
zkx+iZon`UOm+3HV9}f{!EbMUD;+LJe<`sCYQ6>0WK;*x4&Hw{%q-=fsEiYqWehyB7
z_!z46WG5&($8Nq#yp7iq=W%;u6Ln_8RHCH4b|KWB8>L|=MCMHV@UDSZNO%46itII?
zmZYI6pt_6g%B}9&*r!{G6Z<k+b?oazd%DlaraE9~sLMYX3Ut}NEXsdZ_~Gm7&L9Rs
z*h*MXVgJRh_B8P+1DxNrQhq~Hb6n1ej$uzqKJ7n=u&7B?WP^i_D~Fv;7c>+3<3O1C
z`c6*Gy3(()nEo|<lYSTipS8)RLtPRU2^Gc#J>w#Sl_cpYQlVuesjtqUWQDq^tBHIF
z^rif@C#PQeqr8aF#=tXJ4Hn2vLdYuV9D#~l9NXKV7oTpJ{tsySOb^^ddnm6uQinPc
zp;?^NYgu>T1S|a-FO+U)LpXLL^qWVAzDgM6pG$amOAhLL8K>UHs4T9OP&wvLuluD8
zual6-rz#^a-e4;=ciQr%VHUbqQ5Wx2Pl}rsb_d(gS5c5a^b@F7Y&qN23jnOIqAu2P
zCy)K%{#=`kp<95Iuj#&>bpIC4fL76S{VJ|!J00X(*8{trUDqSrtclh^`qZ&0AG^^k
zPJl&vFmp0%=o*=ZK2;@2pE%?Qr~Guft}Y80iwVB&MXJ$=HE|WI+zc?Z=R#(BB~GxR
zh8%9zSQA|wIlu$1+9Kou7sR5FiO)UiS<qRj?eHGJY4*HCxSv3@>qD^>xf!O}<En{T
zYv4UsYIAM|%+EyT^R=xS?m_Msx!JflH(`&4Vbf~8$luS4tb6<jyRvIbLJ*h|iVNhQ
z*fc7|{dqMBaM~6(s0HL~^|D5#aKbM_HEG7L=6P@RE}VQGN=~=DdanoF+1$Qa5Sj_?
z=Xt#lp$VvqK{KGgp|uihnzQZ<>7Emwdy7XX*tnFhL(7u(iqCOAib}`1ps{HCfv;N7
z%~?nPV&9%+UMfunY-tMQw=SH9L;x99-Ea-w2{jIM=@PoEvrVH>;zIFlsY0{!n<GAo
zN=YeG(W|$9W^>qbx+tnmV@dUjxk%X3F*T$)-SDFEy{k+xJJ#iOEB!k{c4^{7QJ_>b
z-3X2VsL*f7E=`#AH87h+Q?e<T8IvYd2S0nwa(f%iAOYsG_$cbgUWzx(Ox1%xW_G7L
z<m=N!BHNFanrHRxcr()7p_I^cn^xCu6jh#@*WAMY6)l+Q#C<qsP|x!J><%3wKW+|F
zP|H&4I0AuuGA)lwOE2%ZhOUi*%cAHCl@9Wui32!(d%F*{t^BZ2sgg|{cN>=GLFnLX
zTcH@xKt7b`;*{zSMiWYl?UlPjG{4$g+aXU&s~ukiMcWP}rEs<AC;?uY42b|$701Fl
z!2MlK+)a~O@va$oAI7{qntIo01M^V;@S}5hNen8;s7kMqDhfZPHhfjxXri<}DY5vA
zU}f&`BK#xlI+7d+Vc?Hk0+jgw$JQ87bLzeMM9o+OD0KLt&ySsC|NhR-pP`1?-=G0P
z?{|gqne?^+x5nHHG1N;tbWvuEuh5D$H@uWPwVmQ@@ua9M%Mg9Q72t7N14>1yea;Xq
z$GMGE+WTr&$3hOZm8<}{$QXqu%%0`E7diO<V9%ZTs2#!O)siP+3d^~R5n0%MaQBqD
z%WwL~5eT#gmsyDC#aL=|TWJEcG;vpmBt!>z`l4m<WuD`)2t$2Gbu@-p&9djat*%Y%
zVu^SDQG;HS0^roQ<n>Dhb>)Yo6$A}F+Uv*_7@bA(w}7T@SOMv_?$_p=W%6iRHGi5a
zTv~OO(2sO}-B_iP?M@F@^Ul$LN)7%Dl}ZMTv}asYz|yWt9tt>VXVl<M;!c9sT_Jo0
z&>0HL_tPpU06fL141s%1mUGPFewEyJOkQ3&gs1Xx2KAFq_l1p9`Y}ACno&(SZ}E8D
zHX4UZubH0>B0aodxi#iu!|~(=^cpk**L+_g<j+q?uR^<DDYYF3n1Ls+t}v-d?*(1I
z+Q$E?ZVq{b&;%)*dlbVb#^8?taK)4fg&n&MumwKiE0i*ysoB$>M;e)fN1{&12&iYx
zQ*8ecc5PV}gCJ~2b5N_u{x>$oN7A3kEZ}l(TSOiqSxk=-;L*&%VNrm*>YTNtRIOAR
z*?RCNwlqekehIi%`V=xDcQ(gwv7Iu=egLwWcu4YvX3qAw6a5vJ>ai{5KK&FZwx3Qh
z$pB|l<dj?9cV}F)Csimb_GZzUTK!Y#I%rjzO-QWnNOLSqodlkFO<I@%v`xLjRIi1N
z*Ax~eh1Kn|aetZ1E!7tEn+$qXa5;HGs${$8-v%xh+S<DyJ@V*$h9b}QM0eaC(7-}d
zYAGe?3X#G!cH3x4i80R6UVfnq<%ughpiR0~YmobtuKxmAe$ZEbj^fTq=Uqp*JFZFM
ziVx#AV0e)TCT)S;@maA>TI=aql=dSxi<?olX7gijUx+xf=$a5u*RKJrD&_&C%;N(I
zT<Gg^QY7}aBNz3Rf9B~rf8(^KV^2NtOTCdHM|Y0`h4v^F0JQf<&ZSzNcLX82wNO>z
z%GSJJ;u+E(gWbrF(p$%e^r6#WZq?Yl<M32>^Q+|j-s3tnajV9xx6d3Gm43+mq-IpD
zaU6-1x9T`l^`9y`pc3-L1OZqdSHfrk+oXXBenLVUYDH-4)}%WJ+CBwZQW*;Xjqsu7
z$gOavrah#iD^Ae+R>WHtehIsh<c47w_M?tSYW@GmYB?gHLyO#Uv1aU8v`B1!uV8Rp
z?_{j^0F?bnD-a7X)eFgD@zV&p)vB-O6cXWy_43huUXWJ>DOP}ODWoVHmslKJRg;y?
z3Z{@P-7;TA@L_a%`NFe)Rv`6kIpC@o8AY{07uR>eM25}}Z8mkU?WMe&0U>38g;?V3
zr=7hxWpiu=AL<q5n(a>rX{Q9!pF;s)!$q1-YH42o(jp&$QE}Mgmf3^9H$$R^W>>`A
zVso9P)yHW|#0o)%GmTScN)Pt_9uh0EgVXGfYfl&5ZKp=<=B!h%z<H1Jw6Inn^x4YL
zE0CJoXhbs8xPGTNNn!T0!XQ1EZ$oPZ0U^`B{1+52yzUB#;ClM4Pm_iPVTSU!ih(m<
zO2+;5T{h*$rkuu0;Ow_5Ek}##^5zJKozd`(usP714tat$_iIc+zxBoL*z}~tZaK}M
z(^3*`HXl%f1Ll>AW;WQZCZBVQH=BNt<W{t()JA1_itXJc%Zuam7~luTW-nqWF4M5W
z=z#VK12~Ok92D2~Z`Y3jZ{%kva!3i5{?>1`ll#h9BVpU{?21{}MJbhc5ooZ7b70ff
zg$;znNGy!l0L~0`IL68SAEM1KVP}x+Fbu-bD}e#qx&Os}Ne%L*`nzuGnWh;GNId$0
zUV6AjfEe2QCsS0W>7N=FXbZN9niWAKt3rO+V4P;IfDy2fES9AJKLKRtv0$y8s|Aid
zls|_is#Fs+*+xDwI-s;~rM6%z-Dqi}g{cqi!>aYAt-Tc^FKujLl0m!bYVAJzd~Daf
z)<Dk4AwK#TUC_uiMU0ic@06<(ig}t1ETEK%oRw(^4Y3Yp=>^-|MG?t({qQsx1T<M|
zUJC=gu6^57vQr28zVf$JMRazj#1>Cp9Mn>Q`|P_5_FS0H=6}USEp=>`wTnx$c_s`3
zS~zO_Pudlg$IeBoTXpn%Bzk7iTI||NyP)b1__Km3+))fQJ6k1xpAbEg9oylWDz@R<
zo1XNAjIOW0{-r}~nCH^hOh|Z5f^9X?j`Q?N9T9mXij2pWuq%b@ilW(u`tF9H2Q(#M
zDu6J{3g?n`dfEilfc<PhOJ4!dxcw96!9W`W$oHx(M@oVG`xlU}%wvf+pN)f2p)F7a
z0?iA2@q#W}LVlFTmZQ*Q(p@5S&gY++<^?VC-!NM;^d54{g*yw&{&@B_@irE(>IK8V
zBjXg_@i_tg@C#oiL!iA59-_Yr%^zWBmTXA~0?{oASRy-n%kRd4^egWMjIaj81oEu!
zc{*CA6!no`G6803qM)vJOnvY8Dh*Ae<VU*}Nqx1=O(Y#WJdUSZT;98#-Ow_E=kmh=
zgFwB{txl?@{IDEo^cmkX(G9hPQxi?#e`XVg6H-p+xe0zj^#*<bSX>fg0GrL#4u}5O
z)d0smRieJSw&((iwtKBqK6I1~oCwt)1qB+bcbNzF(eC<B5mj!1Ci@@+ShQ#4u~FmI
zjl=sp*oj{B@ULA}e+h9kM#KKh?+Oe0GX)0?&mbM5PrEI6dg>9YoxuM;AHKqTqP)Ql
zuU!~df*bkUtdZ<Cw6fS;INJyAXIv{d6`E`aiB{tWZgox99|z48=%^2Dx!T{dqo2q5
z>webrei}d!bZo+vZvu{dO%)aaM*~a`li(Lr)M#8BX@|XToAj@kaGI*Y%^Y65L*0?A
zIr>GO5>0;7QTXt7#flWzmG;I8CTez^*iT`%(k;6z@80-R062RN&`D&Lv*AZ4{7qnf
z)(elD_Mt#IOnx<t27Y+M+-7`*@!VPtS)qW3@<nZ8B9{+7eIOv!%*tX@v#~m}U3rKM
z@Z};v^Lm(M?wzkt6WN>Q^pCJ>J7O3HVJq2SFy4Q$mL?#7sRP89OE6DKyzKh8q&tM7
z0p{r%d-c5>Y0{@gr-Mp&JS%11mTo}FMRXy9JAY2-B(emy^RE;gCNW==Qc)%dHBWRX
zxcBPf@a#Xo;#_RK4!IWKl`BVt%D602yQ{ndyG3{^EdxciE$n?f){GoV<9)EdbuCe*
z&nj@!UsF{>6%cBcVZE-$yml_qY+gpk?BmgH9vX59zM<VS8DM1lZV$N(%`XdDph^vD
zvONSJYXynWAM}mCLuZlE*xp^@{i-kYhCB~-$RbxIC_}7)A<BV}GI}$JRj5j!ya#4Q
zlPT$`%<lT^1KHJ6t%k&%@zJMToEju>x;6-?PQAQfQ_YaF=*YBBDtU6FXeXK77hhX?
zzufRz4f5Ms!cTxf+NI>;XI*R5`3dbIy;7fK4DPvsH2U))9omkN2=GhCcY5#>cB8)h
z^bFV3x(~THOj>4uD>r(0=%q9D6GEk262YiuqbL!1eS=tj2Koxpvd)j7z$-^n8g!5R
z7d_x2c|n-b@7-|1uT@QIQalfhb=UR`-<Uy7x&}4+HGtKKgr(t^3=2PDwVX}Ci!*8K
zx!u<wod*hm6rXNTqLbzFA?yllB!)rQN(2%}_FwFeUcr%G@(obbrY#}H*tOgJS_TZ%
z3|KjYSQD<?c!ty#8jk~SUDxtSPQ5PU>#+Y}%K2r1+IyTQxJ&o!j7z#>1)Kuuu}Dq8
z?N!L{$6G``b~!x5!L3H>i_D(Oep|^q$DHViLalRTjW#`_<x(zGYdOCjJjhXKY~rdQ
z`h0~TNCc>iYheYCze&wcoXuYZrfE(g^XVI1ha&r&4ETl(*|Vl{9^h}|F+HKF$-p|(
zDnXwvjaLLw=Pwc{<kF7t?ZkZ}m^ojChJ8lFMf!hXAKj_&MC-RH*e;=SwFin=q3mKs
zo5q0#dr=V6++@&$oz50f83NgSGwacIUHnZ<L*-=1uy9dW981+XuPPWiE~^Si`B}uy
zh9P}l>fnvWrbr>}HR*JuXz6htZDY5Q3Xk-kg6i3EX>vx?89N0?!udU1US7T7&+;R)
zM{JW`56v^PW}17H`*{uyQs$aM^Gr<w5l*0#r>M5BagFhI1YOqmFgTW~=+a<pAUO$m
z3gKgyx^7$?9tu4WostuqKSfuNaNkVR<_2ShgR%N{X;S-50!V1%;-3iX$1SwreGF7i
zW?)#y*Pr;0u(QFj7zBavl@yep`(JF=ZDmL{Z{7t=5L;UqzWKO-V+>|SD~m(NXvs5y
zU+jc;(-I7DC?zzh>;yr0B@`+!KAMByR0b|&gTJj5m@ftYhBa`e1`MS1PH>zkl1Fhn
zHF9c~APD=cWQGfmqBwkyt?GLm#4C!;<soAA3HkgXUD|wLCpCB!9qd!vkh>PxUmglj
z&s<@4^ZQNKT&#E|9BOw3dBc&*#U=Y<kot&Lt7j~2LGWUQf$LKuyu&J6)&8`}Zz~_@
znf0G+t@nIPe%E*nz{*6|Ep$(uC%!-p8}>1lQG*A1a!C)QE4Z~lEUkG}o%$*p$qKML
zbVKX#PNx5D108;lMm{r0$9&@T;z`Te0`l2(Es?UDL#pHas(?|AmyGWe9}_DqUas)2
zJ~MzucOVL-M-uF_N6heMGgj4}9&@SBD+D|kyl4x%CTR7*=4mpc-jUlOQ#L~~lk&+`
zqDgc?jn%}PKKV$tG@qIaggG0T6$DqD3(#jN=;H1imCC_u(gO6E0U$DO-|vuEzTDYi
zD7e7&sH7Rk%Zuj`r?JiE$8M%a_OBQIL)evNIS_)tE2+5P{Vz66D^;DJnhWquVgR9*
z-v~~jDmu*6@x>uZP-$}r``Ds@Fy1tA1`WV#xu@Be{(MW7jY$UxT`o82*n_&a)mx+J
zzfRJm(o|YV^hNgTG(Geom1b~!H{P6;j3k}iHjqB05k=^!&>5?u?K;B92*7GT5$2?+
zZ2;ClDZgoY`j!?oFCiTJ2}7L-85aGQxNDkd98>!vBA|JCsY)_{1FBsMSW$<|dEuC@
z3(em2PN+m$TheKEOmfs2tk8YI3g~4s@pAzeAF}(h0w1qKG`Nt^<OH3e+K>_G<F!aC
zIwOj!Eu<w-?8B&mn`;koNIHQ@<H$3rO&vT#sp>wAW<RdKNtEp8C4)NgJm6<Wm_>gG
zWXQcpD|+f41d>czE}pS_5^6d!T&lDOb9E0Lz|s0F=fi3gU<wZSNJQ9)N@!&PRq75g
zXg!y=3Y{q!XvH1u6ShrVIwYH=KTR|{mAW0UgAMwE1b5iSpJveS$SP!*wQ`7YOEUqB
zXu%Z&nWbob0jsoLFv`~UZGb{PJ?4}VZh~yFL;x<LU-Cj!POth1GXv~?A@kw4ko{wS
zfnV}6-6hQ{<v6j<KR@3&!<zqG2J8*{=&*)4EB2IBl#il6!p<#;Vi1I(TM~nc``_5T
zSRwtQ8|c`_P$l66SETWBGL)VD$S2n0vMh_!RcTH!j?c;YJ|j6*QhQv`X+G;L^TPtm
zI6NJuyo=5cvgste#FB$N$E?@DPm+90L|gqpY(E|YS<aIYflrtJPUdU5fkPjJof=zs
z<MsfZcVOjC9G!N^?An}WQBtvMEggN49CEEb4}oQHE`HZ<!gv!St*ukSUF)Z<k2k@-
zcx=Vpdxj`a9+_7*0RcvDMylMv9RoPh<&;*APyiX>t}o`lSd23J9;Pe~#GYA19J}sh
zfzgv)Ll!`pX6a7y?PJb7R~UV)dI>zzghFxB*n03Omq`7?#tXzZ7wNkep-sI$k^r25
zy{e(>pq3KyS|7Cqd8R?U1}8Kka(({`*!2pS-;R}5q37s+uFzK9g#?jjt+xc&Va-^B
zty*OPWg441vt$twg$IIKKSveD;z=xFw)+^w$AjuBPv%(<^zQMoMU<M8%<2nJHMEy0
zHHIdAlz7(9QS)<D*{M7JOSFdHyh*)zQ(7TaQ#UkG>W1~ULm4R7B!@r*IeMV=Y(A7n
z?95m8V`f~zDY&K112w{(h<t5KUYNCO44VBOWHZ=pF*B7*-BR8JWtz6ekFaw)q8J2$
zXh(M<2x$L}T}=Y(*QS6t(L6*J&K8WvlW?#mG5E1e0X%b=n1t5#*7)_6?uj(?-P&nJ
zPB*NKzt0e99FE~5D~;MdFVcbrwGK!EypkTg{WC%Y-y#f7+3vNBk4M~7tJI8kHK{ou
z#xOsP%*yW(IA2OFKsUb%malmr+QsG({87N)P@CgO^=`IzRRs^;pwe`+N+-*JiN%U-
z>1PSx*@IboYf=+EBEH)V={h(}U?;p2*6q|Rl=o(-%Mtz+lE@NbED4k&BLL?kb3%uH
zlfiPkCGlAtN_Hgxr5K~T50z$()B)hLiCl0xM6VHi@Gsl_;61?js*R%GJ+<p(go+^T
zI@-#mALfGmCz~?O)&tPKYE2JN7mxpZ!p#Fl7^P%iKkAdcf)3cz6cc-kjT5MQ%I(l-
za3BM<ZJm{?CSkUZTPW4AJFEdc_o}Ts@~%ydQVmB(9itTSU%q;9HJ}<!sg7=Ij+}Vs
zw_qr^f{pFW7PGr8iN6bnJB_Emq5je_YU={RH#@k~h(fBmLTeRxwg#;<!zUc^%1C#w
zE~O+W1RA?qN2gxYlML#0v_e??AFrdxx&!k55yB3<jtwp4b4!(f!p<nmVi1I(TM|K$
z{cmgrrx3p~8{oXwK5GfNsRGJ-9S~?d9?xYcOzARsg??ktVLj6j0lh9b)LYLpc7_(F
zEbvQYQ-7F3q6rA64vA;euD*hGwz`*`Ta4go6y9?>{k{%En%&$7!YMbu>LbzgM8sUu
zqo5H~=TaoooMtSfOtpHt*(aS%R<O>FJDjHu@bF&-C#fJf{&{ywmbHmxa#EQ-`b<aB
z<@V~0E<Tg*Orb!R42*nr=6g<Z@(=uI%>5|Cqz1ru*$p%PkBCle*UGlJE$~37%jSz&
z3eE51v<7&&r~B#Zi{D7hRII*_zDuo(59&w?w0<pO-EjJY+7zLRf7HQ8;|D7d+gqRs
zqbp%0(4-R{D`97D#5K`_xD9+>SAuO`g{i{rNCj*gj~#m>X2^?cB*~38TH$rSI`Y<M
zYa3?@zY42va+tTR-KKW%)jy<t`ve-h;GTAuNs&Pl!A0M7_6anX2D+QedA#_hl2YQP
z6)<;ZOW>WTW^&^9g#U(97a`T^NWY^N87axblmCXO3hD=N(Td^7_7OdLSxGcG(*(q-
zeY^afN92!mDKwXo+~!$1$oMvT0JTq`xm2*xnAlk+mOC18)!!e&t}MG@7zEy^Pi$K5
zf3XHvF#c$#2M8~*<rtXl?+Vt~gjgHs`SH$<Q2u1Qw0+7h@3^!C*l<=_i#Bgw5Y70i
zU37jPk|?1>0GAdmj0ax31)$~L!Y?AMDiof>QZi~yZYzHtq_>ab9E5A1vYylI1Nlkl
zW%yVd)=)CL!sdK`hlnO#jI$}y2CK#$q+Q|OETB1A3G6hpSqA?OJzXz@c0;9R<G4A8
zqyltZ^0MiQ%SU}AHFP-k!e<gn0I}r9grrCrl-%OlaqUuR1rL*RwHQdp<lmvknOK*i
zlWW*fxMxzv`I%Ov8=7>5C>itTw)j7<D(wz3%Ahp#8a+J~f_o&mf^k-xl9N#=tJZ&E
z{B>&s1!^Yyv`z&dOA4CkVYui_qETkB@}Axl$m#q|XC0Ij0l!|G_Ht>Z_u;}bnY1)Q
zG1`LjHa4|Fbigw*XM>({E{W0~oguxG)(zxtW=baVj;2aU@UwtW8aY#5snGpQ3`!+%
z>j)4#9_atz^tv{`j=*QML4mz5p;nRwMu!OpJmU&2(2y(m%nHFTBQj}zoQJN-L)1Pz
zt(WPR!U4}9E+J*BrF2Z6Rl3!8;4`b~3@N0q^`m?y3*J8hpjiVuc`LWGk^hyy{D^PD
zuI$Ky5CmqlB?^l9C$_~?y5|cMpqz_Q`uY_3;MayJtoHj&gkRb&&!$RzM(j)KHRzGt
zW_=qb)s`I}_F76Y_<mI23EN0OwDkFkO;CSa1+%e{);|6|lF{{8!6p;c`ImqgJn{!h
zyin<OHb3D&l1b~q)v8Ub)c{{FICk_fyTDOEYAUE2j@TX1gmHjKE`r3>m92pgjibv8
z&0>GXJmtJaO*!ij#FuT)eY9MTaZ$lYXtmD(vVkQu9)C*%qhcGB{hq_SW5iJ}f!T)A
z5Q;PXip!!;JbEl48riAd4GshXk!_dCE+s-UpnGUc0*=9#m1-a*LSvhTXU8z*PQFGt
zs!$>{+i1;1zp^JWSc%Z=y+G<Xy1E<jxJp<+iO?+H!Z_l56d`RX2Z%b+Bi$Op$2_I4
zziqzPS3y_t(GVNa?-HW9=;Jm_Iw;>)`iHgfHXQbMQDN~>C{n&Pr}Ckxv3m1EA<Z%e
zJLV{9k2S#5#|wofDQO*NKZE$R_Y7>atU$}N=43RiX3#;O-$qdZO;V6d80M<Cy+rq&
z^`KzU5;7y(qk`uW<PjpGYY@!u;Ffs1MDf7NYCftiB|&C_<TG;cBw>|aE#aTAYq7By
z24O3agap`su`7MWu5=PzAgWS@pN*}y|3Rmz5nmjik$NJn$buSK6?4IOVxFZhFur|O
z#xbPB@x3-zQ=qh8NLOyr45MsF5ynP3%Jq-Rg7J+eBtPZZ$AqMBkqOaUi5?maKdIlR
z!Hs@e!X+B9fKJ44r#Iure{j^0ekK5DLz|w`jD5<cBaN2mZbI1bHB5QPeg^5vHhtlQ
zp-(lwa+2C-J7P2@M1NHYI+}jm1Byu1@hUtP2>UMmqjD@`JF8I9Y2>N5TchfLu(jAy
zxihc>T=~;GW~tK!WJ|nMXz&f*%M0j((<D-Org1F3F_J#gPp=-F=C)m<X@O1B?Rz?^
zmf+c)7nOFzicgsR28ov7Sx(~x5`NXECoSOgIlo|<#L*89fce8sPVTGF08c#1S7#Lx
zTPL)!p-`IKPApAvOIv3nH+l5;2%h*aqC6~b2{NqD$DeSJ-FG?QTGGxiK06;M3vrq#
zm96B02AFTFr*&*$n?1>wsyg`UaIH5(*#Z<>2(d)D&|Sglc#90|0%=CBVx5<k_TdRF
zBVr4zh}8x<GrL23X(Y6p6I-CaXF-vLYOAur9ns$chCV};5($&>agMgZ-GZUdj{Qg2
zl^shA!myTXzy|tn?8Qlt^0Rskcs9o}u}+eH`{Of||A;VVRd_@0T*BUVeF~bs35&uK
zHe36qTT>GQaTuC9O!j2umjSnWT=Tyt9E#?e(AMNNFwHUb%XBE3a^-!Ru{+fW4+|$I
zpk#9g6FaO=C-^4m+c+FeeJ2{$+rAnmbp0Thb=J@tTd!cpW*C~}31^@<Vfjn~h&$v7
zAD$G-Cm3X;x5OJwC<aWX)005XWc>07J%BAqn>l5H61+R<Og{%Y7Th80c=RkMM^S=C
zL6W8!L;9y5ZAz6;NeN^$6dJbUX0N<sbMSR(az&4qq$yx#A7fd`=3r;?COMjTIhq^U
zS<asT7thp+h<GWQdWTPCLv_9(BkbBFmg~Fl>3q%PRtR!q*gt0zD`^&N*uCO^7iDvj
zqKU?BW;y`GXS+IrFMT+%lO|dq+h7c)>~~G0$A_aa!k}#<Wuj@NQgmbbGAn7UvD>?6
z>Iux=8|+(MHsCmY7C$io>vgW>MDHBplF()G(L0$YqL}lGq-wk-`X{JjVznIhy1L3U
z(Dflr6U~}b{Ex%)cv;hzz6!P^Az}U|2RK24MnN0R#z#Zxvd#YpJJ)Q9K@bM-=$?vz
zcK;i@gQJPRG8^#pVUZH}aw_vS^~;>>(jmZk^pm|6aZSf3>NL^V203D%RV6QIQdl^B
z4FS3T1p3~cqzk<rod4Kw<V7dIac8<599yTUb9!21W5$jSU!0(P4wo%W?hLSMXL-DJ
z%7{!S(#}C_kWZGN41Qmi4CtUv(<di!Vl?3Me%=K6d)Yx*eb?{JUg6Ps16^r)B)+R>
z?8Bl}i>Cgr9M0I;s4u*a!`C`>PeG7)W`o0$y<q`QorcD9+4~@ycR!a<NxoFFBj9dm
z4<YyOz#qxbJ|Gdsr!XnNI#=jZN4P+rIQ;bb-xp!AFTwPS2sTzU!&j9@&R-^OatI|T
z(>Sa)ONKsGqvZ!IH)OD}0!GFq=r{PjK0g+?zyOmAymVtuJyjoDrddRT3ve2z-6@Jz
zrr!j}03$I^4x9Bg@UQn{0u9jY^qtM!r?q*xF6S*Hkwp&AYo^`btI{B2Y$A(%&$wi{
zE1uM&Dw3w7G-Votj9hG@oj8<~tsA$3GEE#0wiTWNwFW7eMUp5!CI$^{oLcNBb<smn
zaa5Wr6&exuu*NC*N2gDT4cTD>Ttbnf$GPirNrF_7Mp8whJ9sXZ;y+>MV#6>D0@0NK
z8w2|<*1C!BB2^*_Ah&ffpX1S5sAD0NuEFil&h}VvE6(uX<SQ_QL4u$CNW86s4CU15
zfCkU;Q`l94Y7DRjX#-_YoA*=o^Z5NU5g?RSYB0N-80Jy!BbUH^)FM4^R$wN|d)lnC
zOY`-Lgb2>Wze=pX)7(q5>`{3diO417<)=ViBWgH9h(XUO+Gl4$X09y4Iaw7CYc+fx
zB#I|DQ(rqpj?}yD;Cjmc=G9F<6r3TwPtG2Vno-=kaJ+PWZ%I4O<LuM;WIH|{ihz0v
z;F2&O;}P_Lbhd)32dz4BXHyc(>@YXFr{(+dS7NiFE<V|k=<`^w+w$aM!<-P%g)c;3
z*=MM1(o7|>Bf}s)^U*(ci3qahq}F^=KQ~@{Y=SOjAzb`m5UWe{N8m7xL#XqOzGQ)L
zFKy$|i^SX-4;15s0bT7VjF&yi74Y&JXFt$hjHdmEz;#?RfqA&Z-4|{{S~Y+drI2Sg
zk8ce5of~eu(Q5d-;2$rl{VnaNTlTf5y!$A)7Sl2+JK~7`cZ2?=T2Y)dtic9J9>~KG
zt^RAIs$wM!=(<ZTKbBlym@f`@K?*SQZqe)zD*xVy4`FAN<S-1v&>QUlwuOEFi*205
zQoiT`$~0}_Qjng$uZLDNF&d4tlR<R3C!wRP@WI<VE5L(V%B*ikn2gwj?`?O{q08?O
zswfMPy*If)-U>iUm3;mvKxdbyWM{bs1$@y;Jp#0&!QndXewY<*KXm;b<m`f{q;H)=
z?N+~@<h{8*$hp}_-W#Pl8OERL2Az%E9`D)Ps0%Df{+<1Xe-iIoxfp<(hU$x~4L7Pn
zM(xmpyZHKpt>YsKd^NSLv`)ZzG#ZX7ccb?Fz+<j%yxj4?g-uDtJ@huuGktx!v#!tu
zEk0R(_SX*Q_O>5JeHBXofM{(Qu4Kj-bp>v)-L*ZQnOws!D_Og6sUV>f9w%3Ot1D}T
zG!#cO4#035AMD++T;GKu>k7OhV<`eSdt<ne)tggjOM@7^AD$uc3+%|U14byP-I6fL
zHjRYUo@L{OkaOW!h;KcqHbv;Aj~YSi0)H#-gmUBA@PqM%;0f6dN9Rt=TypTv`nmX6
zX(o618OE6PtWiD){=x1|eUqn7m->6iGbwr6y%(ZL&#3<*Wgs~2v6GR0T{jNA<!*+1
zU13Sr3xRI=OtqSZ35C%l6jZ=b^j;;FT7-LY`%l=F*f<b_z?RJN*zUivTN1-qiZs^%
ziZ%%I%u~}jc3v~0Mf1KKaT1|X;$E@<{v3h#Q=GVjb|_wJi<Y(;g-!nG4Fr$S1#*cf
z3d2$ElX2{tNQ4WMySn9gn<c5IX7Fh!6vK6!->#%1M>~5vrEdfbY2I{d_@54kk+Dwx
z9l$jljl6rF!}v^^pYzV^@}t>ss`7oX?uj3q^hy*EI(w`#GFg_=5p?sEv=+A?55`Ih
zXbwAvaz<TfKB&`1h6vVXLunr$*2Gs=u%J!7)lrT2z#!7N;^t_@V9v?N_-FKAuA>~5
z=653VSo|mSeddc0KGXTEU9=^ym?p!y&m<Ab9EXXsgH4<gx3G(Ip0Rz2mPl$MfXYM9
z3So`$8G<(aK7tSK85`c?%=?~cH-M#plh9_a$P^A?QniLQw_1k04Q=pY!ohqsZE{)2
zNodLK1y3i}OHdPI;X2$|N&W%PCkIA+4S?-;+okR=q@P6aOU<&q;=P<R@@_L1kI)C2
zSw?z^qAR>rb}gJK7=B4X4#3PO(Dw76(%=iCo=>;Zv7`S@=Mb6jeI2U0ogdXoOY+3%
zh#t|jh4+O*gxa=9N+;88ON9K|ou=XDLEpVa_Tj}L;MpbnkFaaI5g3GFD<wRVu>WFL
zdc{UM$+rL>E#zg#_G^vVIYgB^0}+^r=WG{dm`OSEE+2Q`N>*!_fyNQl-0I7zYjG~p
z*hR6ff?2$q{t7__m<8^fn{({d^uwefO|yXo-Z}y5WnAfe$vv9F&gQr*&bQr_uH|V+
zbJ>TCqmQ*SpXnAiFH*&&$$n<?uk?a0Lz6roqdI`iPu=v5*}4YI_ScO0$#(}H**QoT
za0y%NJjm&b>%j0KwADc*>=wKmTmqg-47kFt+PgRbO}3Q}a&*2La`U5gN0La{?TEy_
zqIGA1_mvgYC*+x^cPBW~%E4~wY5GSLIjw74rm=$#BGOwZlH&Gj0D+#du=M#<u`)n@
z0L|voW`jI_w*XG{loRqh6fkUG1_7AgS>A_q>8*n(F24>32hiOyzcX!@71b}rHQG+h
z0(GserB4{}jkPLTJ`gOk(wDl>V;hKPyS+o053Oh(g|W{%1GL@Zp1x?m@}`3<Eoo+F
zkRB~T3DqjtQ8YEQNhQWL=nM4E0hE_&g!1zkl<)dWdwvBWn$fvjRwp*>6NbLh3r$VX
zV9CJw-*gY%;x3vHw?w9aa><sv(5Y&{gt#Y)d9No2{t$L0ITFMm>_;QW0^$E3o2DwU
zBejOP^$Ddb3kfzh#45_pFblkCdibTCw-ZgW_i9-ti~02`>ZxNxuhLrW!ony`-)Ley
zC(KI6s$X^iO2vqNIj2!?E&llrpj1HKDg&&}#<1G{*Ww1SQC2qy9K<GQ{u#jq+N6qv
zot4y!GFFT6xG4J$DC;RoLqgMXQ@NmXVKx+$#U^%TtNW<^U^KGHNn4xL7f5HZv>pPq
zNg-(dYzaq`-{%%we@Oau;ocJI_z(wZnl;?!0tnlJD{>4PbBmOz$^|LgIww>5Km^xW
zf62u$u!^{PXM|yO1Ohcn+vNw1+LhHs8z)jD5P`|xhvk#h-trdeN>9T<|F>zE``Yw6
z0#i1qC7n(Id3AYwXp0CuBggT`lmw|r4xS|&z>nZrUg0{M?3A7~Q|cki6JRuU3cfZ$
z+ZLx5sCR_`-#OtvD}YbC#PxeU1Y~UO4#$ONyV~#|4P~xzrSI#Y{aSNF5m0NFb=SB=
zB|G(QcN51a!mtv(^u~7V(YPXYlMq`T+9g=zr=4a{GB>9JB7jN8^m+^+p1sYJ8#Fsm
zc<xdwr{dr=kBB&so>$}cy-Ryd?R83?HNRk%IAo{w6TgIAfsMo<3|k38z_9;f|7n{T
z=_UUHh|@ty?AX@9j4(pur|-Z1PGKD)?*!#EzAisUzjbzc2i0XyZ}j@wt<!o$A4sbM
z=|rB+$nShSnE#vwN?$i!+bm-zejhF^Q3IKpw?j%~{S&!`wqHlcfmBT&XVYKcl*xXB
zH1q+*G-kIPhY_2vI904Lu4wHV(nk3=yUQvTG(6j5GUPMEi6Wy@m*N-%#?Pu^zKY23
z`fB<{jPeFpdoa1oQyBHzb!v?olBfv=ms60<z1-=|rv4|WH}rLNcF8?Pe>(IEWNJXT
z;<c1ZXH9(~sio=m$uDALD<`fVB3m-q@N!RSsY!n#TeFG`2<V?ZRH$LY4g1WR`kz`-
z4lmqiHdfOpk=lcw$n)@VHL-_<x)om9&zNl3dJpuga0-dtcBf`hVkYn+4_^}RI}f;g
zN+G*5P)xHi>d~I_qhX`MHRxYKTk*aZ=MYKv9Nm`qHC(aF>fz-0+hdd^v2~EGSqA2*
zWavWR+EagE<|Xe+Gr_nDr#MtIso?;FX+~w41PI%zetI8Lu>u`^D$AtDTT#)7K6EwB
zWSX6EdXFaCD&G+%n@lj7=Jo3M0RD9j*}tr0e+av>Bnx2>c%!KZ36T3=Y(%BopNAJn
zMYBMlmmeb_YM&7XaLQe>-l-Mzv8k6+qFrGFVla=L=W33A1a@lxzDiIa4V70P_t$>8
zJpo#<^`Q>zzw@T=^Kqlp{ZN{<!{@v(ip>ZIdAK83ULT;hhxN}hdwC_%)!A)<oqih=
zG$Wu}BZu&Y0#PnS6#9epl05@fMvJ1KC`aon4(!!zndleYc52|s_5Ts=Lkkfy!~#u*
zt<ui{8xp*v>rezF5vTSW^6A#(Rd!55hC<jW>CeQ|thvm#3O04AjKMp0XrIK9PviP*
z$VA{5QSL}nj}}hoPRvgksw8)?^wp2-Zud!;zqFhW7!z)r7(wR891ymLI;|5JwY^^m
zN6?0L$1V7eBQZWcVbuWP6V3|)d!7uKEgI1s#mGuLk~tEO;+Q70wtt~IZIXnCDkjya
z*X-YyMW#s`7D`iY-YoJ_ZE(<E2Q(*g`6-p^(Z3D@{MXGIoE9n|lc!$2&S^}uHa`Jq
zNc$pSc(5{VgB}`I1vF2@N&6ewsj1}aT8CoEWewtE3TV`b5s>Nb_>I;Zo_aNEG~I{E
zBGGbcN;qW;-1oqCl%<%%Hgf&!hm_$zVdr)wF$lxZmN4K~|BdZJK;p|&Ksb|}46%`Q
zg%z+p+C`Y?VxA#sQ&j5u?MbHbz;s1irDbIW{`gD;Ysec|x+(t-lyi&H80E>Caai@1
zo#I9l?x>Y=0dzH~{9b>@i^o0Sbs<bU&FIt!j9hTHy1Ap9Mv@LSxGwhuQz<2TzKu3M
zb$uvm@j5@v6FG8jivCisdv*0&^#+>|vsFo~m^WTW^f(EM71+`YayRs%VB~*)tZjDw
z*lD7}blHQ_;gEWPCu#E;k97x8XVhv>G$w5tgS!N(*-FW_ashe9Wc;F9TL2gP{|w4O
z>u6-CIOF){RJ@N?mydC@ntdK`kkjYoO)M$1RI;Ptb#yaK&Fk=B_H3)4<15uL?(>`|
z=Z3D;Kf%bN>43!Btr&76#_OlxC>aJp4WY-5vY2P}@mJhjnpjuG!-Pz7*UIY?*BhM!
zgUGWs%8x_{A<jzIXnVE=&9dYOA;h`y7Um5E+yz}Z_Z5$$W>94LhUvZ)yiNoRfpj=0
zG&jixvXR!I)<Nc3;7EI%Y`(7<i7Y3rLvRe)2Qe~cP9JmKP=y#bSVLneJ&7o-BhZ4`
zG>$B~e*Q=&X1)Emi~T<S5q7QF8iF8jOA45<|Bc=3#!SEF+kmIEj=;SBQ*RUdu&2Si
z#HS<@<^)66poI1_dqG<l+C(ouf||+H)!~lJ)a?>MO`FVw-n3pD8@z%TmtNr$-9^&+
z=wQPCXV7l}<S>hqin-n*^vL^DvaQo7fGy`>J3Dsuh`aS!7+gw`1b0k$E;@fKeNntX
z&EwngY8KB5HAxxQZCx5#n!21G1^rvx+c30;T^c6itA~gW@9JuX#~!k9Nh=z6FwpLb
z!b!MJbxx;CX&4+UqHXl%afKdwg~`a$cTR99d0y@5JzUd$@~f&bFr90RW?SEvzTO81
zXFSab{PmpR8NSGBK0oO+04W~GgCS^IW|od3GK)oISU_f0B_W3Fbea<f&g_Lo!=LY4
z0(a>o`~(?rg~ZU~u2cFE(A3mm(xiV7RIkv7N#8Rwh>J!Is17Y;YnH@n;xd#T@IXFo
zx&#lCwr6fZpk)X90WFEnAb9uzIqrKB*S4819RfP9Ipd<vt2?v1*VLZc8B7CN3kv<&
zlD#u`GRZQ@7pi#@*a)bHEn}vMoWEs&Ua`jpId#M1=`h-U>;r_^vu*IsN3;!p=62mw
z1m`}CU)>!-YwOp<BLf_?`^x;|>)ehU3Sk)9(GCyWnEo5v@daD_L=D_YLJ}~Nj%v%4
zfer5%C4N6a3oSlI;i$Xga~wQZ<630#<HJaIMXT%F#;0W0a#yJD@@Mpn;(mdB>RWf@
zYEGy&ztgxDKV4kp3FvEoKrUOX?0}qT=n!g#O$D((xBYSJa>x^ahEywGz<PS4_MUt#
zkzy$2FBUUtTY-h6P#)JBY!0vZdKwEh8iYl@mUS<_Odflx0QqlxMztsDC2)U@94lHV
zk#s4Ls@Z*2K)s39q`mo#g+r*BEd%O-aK1;d&wawD)GO4S?{p~)31j~HiTSo~f)Q~%
zS4Y0U@}uD*w<1@FuG%VO!EmkIIOVC-gsld-nlVsH+%{FS-3sh8`|}!9p;vKUfm?xn
z90$>+1HbIWuPjoj(Z5Vm#NX4*m5BR1>hbUtYFY@ll^}2f8B&G+&8JWkvJz@L+x6iE
z9*J8Ud_C|ADXjHrdb)v<NdxMRcACD?HZGQ@>95v-e+;1Kb}fjVX)g?3v(4WH=9(<O
z3dBLin!`rLGkboe8hK=nQ=U+lnVkzI{?yZKsas{WyvB>e7(Ye=d}agCe#@T47_PYL
z=4*qOii&C(tx6<h@wo(IO>@-1{u6d3NDhP`@Jk|y@c)nPI-}iIr9vJMD+gh)>BEiN
z9xDmc5va&8^0(yZ!`Ir)>Zes)Em8o(4Ge+nqE&y9p@cJ!(rayW4GtXcvwjbkl3}2z
zz3*~(0E1G_5lpDDaIB2{Xrmubk-EbL7(Wt>FKAc<$F|iiPMCx}I<aXnaLC+C#!m$G
z*(c?CUGR`!|BOQQZvps6oB0)@3WfLUaQyv*L`k|DVKC)`-@K&1M`D2}#s))X!TOWc
zz)5xna!{C}hdZ@s-&y($Me3))_d|HbHd(X=m#MCiU=-{W^te{%h(*$kPtHSEw}xUP
zaa!7BMq-eZi~00k7WTTN)+Go1&pc5LiMa0m`Y{x*zjBH7@=``@yZ>mBOsM%ESCnE3
zXw6<O|JMVO>lzt?tJRna3yt2(8891L<QUN7wnkG!v63T_XJ6A6riyYj_z<sUiPfJ%
zX(LB>?>0AVvP|5xgaWe}86IqrvmGVGS{js%J{u77R0o4UVb61vI>iajA&^<y6N~+y
z0?K4c&A5hPX`CXxlo(|TCU;U=a|D=uiBe~M01C3htyH&b=!-^*l}$S3ij`}y)5~Kp
zE)PermnV=oo)_sFcl|%Y&MZk{5Qd>Q>WUW(zW>FhA+eSDQD1<{0tr}_-Y1-X<x`Ny
zw@?UN)wR8o|DA5YQm~C&(9}oKesoVxD(mMf1Ff4Xx8C(Ah}-(dOY|v73#iPiBe;0O
zje}F7Q$RV4=zixZPY0Tw(ine|6Mhc#`C3;a&!&{$1<YQsadxb=?GOhl0j9h<(2z|t
ziUYB|LcwpM6q{p2X}ACP!h2a=RF=;&)|@)*ghPC_EoNRnE}<C=QKsU<guA+gHX`^n
zG*!;EYjEyJJXLOhOm&<HIw`57lI<Mi>1C-9v=u7m-DLVW=9J2ysqyOZ@Se~PAV&(H
z3))-A5jao0Uc*ZM5b=35MFg9R!K_9P6sfIf>&kYA%aHC`nu8YC6KahG_%7D5*t=Xo
zAETkc!r+C~;#VE76Lo2&wToeh^rG~NQr?Mv&L@L4Hfc<2MB!zKdvfmPNNa9V7P5S=
zhy|PdCA7Gn22l1@caaaZ{tmWToPm`V0EU<3ln>(P9>J9l(EsZw^W)ClD4_3Ywl@AM
z0LmWomDXfU)1`V-S{KHbMNftS`qU5PW_m-DmOyBUS$p95ae6q-7oet6h<6RjDuQjd
zUDE?mLa7-Qw0SBn&yngo!u*FD|0C=Svm^#V7<{9Bh@$5H7u&kk#2>TF1$;Bs7J=~P
z!wQ;Ua6xIhDO}Io`3a53(GQ_$NjXobToQUqD=s*l8vJ0CDRaHcrzdT*Kr=P3-hY>r
zTcb1H9BDd(#zELoWIkonsr`S=L6Q|TcW6b7qo6?7@*77J+b4vs2s$&zCJO(*LJ&4p
zn)3oWE@zf6GkXY4c^$d<s(v0<;w5y>ThR#8rreDpktY}A-3^f@h6u{VU&rnJR+;fP
zc<zRV5Z(uB)U*f%nm+S=VC(StIEgmZq|lADAdI+7U=Jz&IT#%BdLBhih=dw7BTCg3
zc9u&vpKs*U$Q~%8D}5J@${%tx{})h~B*@yVzHdG&VVr5t3|*`M0`KEVCn_hiz2pH`
zof;o%n$2UjSg=W=$qIhWsxhl-=ha?@<Ccf)u9DAXc|^Cy<>plLZMZzV8ZS@e&o1w&
zv~-5ffNiy0HieZ23?tXxqZ2Xi$Jy==U{W~G@&&btPFvz$on73wPQL+YGk*}wX8_4{
z-r&2{);aG0{XzwpGDBmPz*>HqhBEA`B!74ni8$|GLj1D`C;7{dnHs)%TtoOXR1xpJ
z89T5&mnC3OGCnA`zK89~l0bbv(7$}0i*3X(3_~|6{Fk)<Vm;+7GC)x-VC0gEBU9pI
zt-x`g2IpjhlOsuuTB#ua3}oya<fA*h>*RnioUd&<l-!sc7wRE(`7j2-KK%O&ec08X
zu<TptAHhgDC)lR%vcW!RUAakHkX8W8;jl?mK-2fJx-@BqH+-u4X)wwA);mMt&vK|B
z$geFpV}7>U(ANOOcpC@)EL_58mp6SMnNPEQK#AQma0%<kF}(1X;^R0?jKLI$p)n-k
zP<+m)=4Fml-r<Zqq|4gL39eX9Dfga6vJ!9lQ0AEQIWYipITe|i-wTcJ2#15ApLlVA
zUjPv4MF|J4v@IHeF|{>szRCX!kbU+=BwRJRB&#gsj_g85HE6Q@GkTj4^=&_<j{;<$
z*&=H`j=xfV<bx#p4Bn`Gqh{dm+_!!wZ+j+nu2UW4bEzS97xdP2`!jitDo1u|ZG8Y1
zf0k@A1@mcM4`N#YEi}89!*6>gnf<T0%(fgPm#)X&BS5^5%FBF`8E@H?>ciGLE;}^%
zGdwBR69c|YKFrnFqVd_O<H9!CZu?5C(Alk9c(1Ka`B{0Hnl4%GWvOxIJBJ^7kyR!C
zO(`$2WsbkoN>2j&kSmbrJUJ-+t&P7cd^QPvBk%V3OW2jzNDzatmhwOXon862nJo55
zC;1vcJ6ZBzjC~AdCLT_?(`nindLb9hPa|IiGRU>w)%(#}b!d(Z&BREH7hH17vLz!x
zkk4MQ{(?`=`kKm%2=F*uYf=9es$b76v0TXxM0`TZ_-v7mDcH!aBLIXPHU?+340e^_
zA@kwYr0E0wHm{rFp#g50lbww5*Uq#U^vW^0E7+r%?Io-;I2t7Ra~C4{-gb>}viD9p
zrcOw9Xl9~;oGtK%jcqa)I(a^elb2VH_Zz{t{t4juWGv!$g%gbDoOc-^|5{YXDTz={
zG^s#xG%fIgOk#*v<hqz+TV@kYY79o(=ZmNYb4N8q1YX+C4sw>+_o+@pL8+ez^Cgr?
z7lq+QicH9r9AM{~Q#j0uVth2wQh$VVz&@xvHcK}DSkIXLh?|jDwGBeV24$d>!ix7u
z`}v9+Bns@9jS<$+zaT1t?}cLEg6%a-{7*74At#&IpZ5;<F+EHkZxbvZ8?+LOY1mfR
z%s@oA3Hd0r<|NS2;C^cUPXuaB)g;J?HVjwpr5uO|lkZRiXw=Ir=aA2(CiEu)gaTrd
zxnF<9F-ew^Th=IlR?>_Qsb$yM67G5t*uw6Gs{aypZAk)xFziYN`hfdiY-N?i{n&T_
z8E2F}(k97AQ0~UPmg@*P0E&A}rilZjUTMOl@V^^pG&x!)Q1C?QZLRD&Pf+~qwh}zD
z6$M=VW^Vm|f&=rh@z$+a=qbiW1?P>nZf_PU-3O|4XmCVGL)DNQ&1L2C5n~-cq^-ga
zY1WfQU?#8jVbtuw2$lN>)V2L#_=pp*cV^J>-5%2gQgX^m<;i_1E3Qco^k%oelQ^Nc
zkHAaSz%sjncP#xkpoRq7Zlm!Nm``6HuYeLVS`H4(3bUqYB|l{tjkYK7l7cdIJX0TW
z0thwPDM*teSUsibcL1Sg7B5A!2}iZ7P17f^(LR@Ack0;1+_c=3nIaG&*Ri_UjKAYi
zy@!Y<Z&g6@KKdV9ILM%seu0GbX9N~8BL}D~OFs_^Y-TpjZyiS8*R_=uWK4E;#iiQh
z3Db3Z${Ee<lx(%?K(6N0RV>*wt%9`4QAn04*R5{P5tvrOi_9hje9Lt^az-?LGmtxV
zXA4B$)pP;L5skyv`1iAbq%RF(Zr1pjgAYbWtT%5UMaS2~6x#+Wr}o0ct2G%OU#e$D
zpn<5qOXBDCJkoX68gv>jCb}QOuIxHu7zDN?5aQ@8<tMVmpqCF^!FpwkIOgb!o|HV>
zk6moVB)C0f|BolY1kx@Uz{D?Z6+qVZ3~N90LP?I|**g6>ZC&rthSH^YHj9t#DU?N9
zkGj95O7YB1fh$otUlcuVH|;lhF=;TTc$NvCOd6NbW|mse1Y~FbDxeI8XGTE%NnRo<
z3w_}m!-s5W{Y7W+++1FguM{OgLfYT81_)#j1L{PNTtIpS_1Bb@$`n8mTZ>t1$0KcO
zGThdd0rgt)t#WskHXPESX7>z?RX!z5eD@d}?KAl00$cR_p>@|PQJdWy`SBeMCFe3X
zr}6nRy+kY0#9<HSmtinJMxPwcj%NQB2gc$>TA0yamS;orNdF0j;<6ZB9mmHxqI`t=
z6>kcWmDi*6hfw|t#&{9B96j0m$PJDaw)-qu?MVgdjeeF}s%J)5lC}d>-}I)BswIm3
zYEqO-mGa~8z9Y&l4Q-|Yv>G%@h)=Aq83F;RvS#^E0P5a57sv?c@Qq^d3J+8*Oxphk
zbTe-kdlq)ic5Uq1+!Cb^AoG$pVwB<5PdWmE6$=(Me~qQ0d~K0VZ{YqMNe2bWDBv2k
zvrM!B9c8|tT3CBd2iEmpY4w+|Yq6CWgkdY;gzx@~y@rBa=}EZ-q8>eHuw(mw1)1Hu
z6je-b*r~!<-vkBJw6>H<chlVBO|BHdMB(vhQoh=y1!7{%dtSh#r@AjP!hO#fA91`n
z{D?w09ADp$8?0w>w@RTB6rPSxw?oVdcQmDL0A!>U#9%YuIfk2^1oFzJNuL5;(hZ@o
z4h(UxKNgY=<V`CNvIb`?B<yB$kOD;shu3qgZGNmVd|~{kuoUca+qZCNXMPt}+Cc(E
zY}?V$Y{8-N5o+qy`eNW0z|@wQOzDY#cm672;>w5+yeo1rhWuy(csdTqZ?=d<U*`D}
zR7Ki-@_g-*w;sHLrxlupItGzDj6xw$v7SGJ7{e~caMr?c)R}s>Re+3PCu$bLLhwF;
zH0`JY{6kuEqGonIMxU!`N$+F;6Ap(9<#^rfj@3j>nKBr?0j5c;S?Dpk%}diCA=5Kh
z|5%otD~&~3p5+y&p)rc;8#J0y)4MSwpy|bFH@2p+fLn?X!05ua+_|T~Pu-SN<jdGt
zVM@T<Zklg&e`$>E`&~c#x^*a!<jRkqy^;<(RUCq5PqfQhpviV5&77(*j#P}UsLIy~
z>C9ll^Hm@{Gf7fKLV)u^RFQSCe}r8NuEQV<yAmOW!2K`wmKE$uPs$FkYAv69?AS2p
z{rDbpd}_oiJ5qlIr+Zgu5NPjs=}4ELfH^tha|FRYtP^LFh&EAfNGDu4Ojw=u;6(lW
z^&g~hf0a+Z9(%ZsD2`py8BFlZ+F-Qwi#VDc?fT*g+>rf+Kd(kc#l(-7;Qjb$@Sd`8
zG@glAb;Nh7OSNFjDd^vtqrY{a(GX3eQ)EiVcIv-GZ{?N-0c@ukZ`wJ_+HaPMX)uk^
zppoZ}ac~Vw>CjbvN4$n!J9R1jx(oJ}6ytI!;bLS6Yl{KVg8Pq`z%|0f)KFIsmB*`>
zJtKpBK!~nv0oX}cu{w9c)J*>Edp(%TN#1;wM*^heKH6!|KZtp|cc18A;u;2eE<CFJ
zry^P;1p`*E<W|nnL`98G)!qH$SYNTTr1XNdv1AB8*<UMbV;dZKwYax@rvI*$L>=%i
zIFqtLr`_`vYzelUu*#;D4JD9NMt9+j{i}&oK7fXsHlTt0V1bVseYU~;(Kpm$ke{Bn
z`u9`F@k?#3jj6HUItw49Q;;T~Ckmnw>=yMptpB!Ib|hzVFJwhl->-w^^_-ji?7$6F
z+0HKe942(8&ovdO?sQ!)WL;k$bmps8_(#~e9ZL*@FtjBTV}tu|>|Q)U%9pl*o!LAb
z5Yk~og^f-bUK+BTvl+)TCxbkrm`H)It=qZ{i}=`trX24a&?sD{yqgU>E3E8-Sh8$k
zg6>m)Xb3xt91L|KaT@=>y!F4pyfA$cseM?*4w+zf>kLgN1Kww{<HMI&uTPf^$>*GS
zh*wxhg8PrIs)sZ;IFA}Kn`&8#ja)A17WAAwAA54s(Mz%k>8P+UdJ*gc6I$pEw?x;u
z1*o|_Vkxa+bs(x}nYta|kOuU;3mAP@<J8(F2?}!y<P0}9c4h&YPnXgo^eG$sWWyR<
z>tqjdVW}O`79SU+Z5kr-<B$%0A!&oOg;&#IuqlhKe5Qjv_IQ%4S3@D3+9hP47)`Ic
zyg<PYRh34syTgPE=}rPoM$f7$9V6$4mZaulRb=g(f4Eac`cW;B>q<CU%MbDL_N^u?
zS}7pyY#G(u(PG8*z#VxZ6QcM+2Dv`9j+o%lr%RG`kDYqWpnH4dM^|8pm775r;~Xp;
zBJ>fNFjY*av3K`dRi%f_KDZ^Cn&lgZi}e_~+yp<`q9ht%I2F9d(ADS%`W?|!$<<4d
z%gxe_+08I$1@IlwREBACQPD<oSW=uW<_}}96CCM3!p`hCVi<;@9c6gv?7y){YYWiF
z1}R`UKGv2@5O|vu$~S{vvnRf3rqL4Loaoc%RVOMG{+sNI+vs$ycKt|9PKh%m?7SU6
zfr$F&jT1(O1-l(c(Fa|xABfo*5;2_H&_R0ZKRxl|quEj=?L-w6jdg5IKh>{B^Wh*9
zPHlip=8sH;S{Df;x#@%oMoudEL$*P~{96uCKYjVFEw~iogGpyL8i9OuBILnSuJ~bW
z`V7i#mK08H>XTp=Bt*+i;_Xaw9CGUv1{-$i1EJ*Y<ffDjO)B~%NPis_*sOK}!M$$6
zT#*$n+k&HWRc(N;(`x8rz!tLSMTV&p-7~$D4ughmWnROBn2mlWzyB`acBPCtVF4Xd
zl}m8Ls^FIehT?6q!jKS-RpBCcu~ooffSrjfHNT*V=JCM3efj?OgLhDDroIkXug!0C
z7Z}|pJBV@RoDql|?r5Y|?V1Q@Dgg3!$7RXiJT|#+3h&qSV4~-9Xal}8v!=d`1KEG|
zGWAEmFwm<mFp-^n0nmC-y`4>0cr}{6UvqXlS~3DrV}@1*Oyp)590#*DOyoWURZ$_1
zI1t$=vgANx-b<4=^O$IMh!H#U>)QlUeEB8p+L9y)LD-d)hsymgwo9)Bzp@8ts-~w!
z2q970kBC^0NSfe1qUoqElm7~kAlGhE#qstDcjswdz^WLgvu#uT5&7bIUI0TLS!gHD
zJ=nPp;m%*fBfNJ&<<x2ozbT9G*U<XSh!81M3+<IXX;&pWIzmADc$V>ek{X;gB%)9T
z2#emgT*dM^3Fp!Gpwjyv3fyPLZ7#n-4bLyCy?5F&incd)4nlZ-QQ+cZ*5{D9X75KW
zm;M*epr(vvQg2nR>(tEZlvh96{)PfKIk^qV@AE$R<G8VhU8%EdRQ2{Fi6{%tPuk{&
zd*RNH%j~eU(^CF5#Up14hi|c3Ez9*fiiOG@(<Ij92eVJXvHWZUc!XIItn~l%GYN!(
zVAwwqFgP4wX3V5wLWt+DG9(eScaVF3M9XbGD`BUNne-OT(%vTz!+soJCzoeRa~w)O
zHc>l`ZTu$y@o~BRL>BgPA;g(*E*;=XYn?@@|K*)AYgm;62Xp~hTI(!Ij?%xvLn=b>
zi>Bu^v3uyZwfz-`@KfzTe1@xZ4XWN?3C}DocDC$hw=5yN&UI4p_}ApXAd7;S?M;)N
zrtmZ6PzLyOv%cP8`(n9im1#V`y0u_iAUExyn0@+w+le2-&M4V+5Qd>UdIJU<*#E{}
zO=Bq^chm)xNfQ!4mXH1zfhfqJmfJ>k-ljuF{+_P00=!;Cf5m<7AH<GnzDPYb_*uW_
z$p>e2e*6b^(L{sPVd(Hn)k5z<E0bn0a&%mbN{245xd0aMRqWsyJ6^R*H`ya-f%%A(
zfaDpu^GqaFD+>n6%?VtaJ-e2Z86>h|W`XS2UL5anS!<_ct8em=7-6!4{JhtBxH(me
z&nKZbvBA1wumPk@-noP}{TwhKTbUTspxceXsV>{|EI`U_zG1iWO5sf$W$XGHAV7XO
zTF(e^5Om;2@4VPZ)57+v4+bCDX42DOPmN|?bP{-P8>|ffCz*Ah0iZx)6P*2hlLJg?
zk2ZqNmct*j>O|B(`*<k?+Zyy?cKR^q%QH6hU0e`+X2oP)aPLC@@(&-Su|U(-fMn#m
zn)(w(t_Oeu33v31jXHAmlI0m&;N)&*N^d}uZ+%{00VZQW!AxuWf~4Oiq-@%P8vZ%q
zqqs7_5=z}n?>II-j;kBy0uoSq0-B@_Ya1U&uXOI*vp5&JrQd3nXW&h_DVw$0XY9Kc
zYhLA<MLpah!)Bh~(Ie26+lj{C$6hy5zts$*iB9NUOot|awsHgfC+y5}BZgrZdZR*H
zB<ubcD?AyK{;7I_Ac&Jd3&|Ho7)@OGlBbiz3H|3V(O%av{(dIQMxBw(M{%J)5*EEY
zQMp@9pliMbwllSy$O=I?LfI&TG)A3O3EFE}Un{$Ae%p8w%>g9dhP_cY5-aB7kNX)f
zh8fvY@O1q%tU3Fc4}Y4C1S17<{xQ%&qvpoCOPO*z&w85JkDF9_4en-;P1qH426)M*
zu_9Aw1lhdugF~BOI@eR&u0)N3FQbR%xw2U!9iexra}nNn8|x&c?V(FH(hJ|{ia)R5
zf?-d$5FHYf>#t{=1iRpMe30mr8*+drxz@OuaJpy^=ouwoO_Yp^GiS<K=SgGV>AnZ(
zv*&^1ki!L%vv6evt)=v}jY|PP>zPePH+1*b24`HV%m;zo=5<Wmds%mYWBX;Oo}U9e
zhSiDwUR0nm>e>9^f_b=FV1z2koHWldGsS755nGI?sHEZ4#tEojE*c~3D_rp$B1gTJ
zb3tRMqSw!>MteVs7^xfK-v!NQVf+0scc_FeSgN!}?VKzAka3YA`$X;TVatm79)d+M
znH3(?jJ*)H;R;tjqbPmi=ooh;KbMfMK(%K#_`45X`TfXzm<2)VFJb3)B{2xY(3bE6
zaQbg-mjoofGzAPNWWvL?d^HYNYI$KB+BbeAg2UkX3L)f2RDd|9bXGr%?s4<}D^8(l
zi4*k>=O|+T-*`#1ynsqmx5S6TJ+7RDhHOAYWa!@`{a7QBa+;Yaw|(R=F+vdc(L3Ez
zJLmBHm;+IejmeVH2FdjDA|3RiX+EHDeulFPrpW|k_+aA$W1`HCkmS)z!Y4^<4+89A
z0A++O_=SVJH=9GLKD;`E0llXDp*nf{WG!axA++{Yf7Z`%dC@pkZ`Jo%^GY)HNkKE3
zFA&<*6&L{5A~(xr8N5PPUOK0V0bGVO5kc!WV}U15N7K?dm7YZ6z?>aj{nHyzw>4$r
zEG{n^GJNux(1lEyv<i07{I5hO6Ml;a7rsz-Fh?MsvFNZVZO5(EUOt$93HTn}+0$>w
zK={3i5B&@`2Qul;G>~lRCB>*g${9WQf*$LOt)*piLCRUt!`RH}YpJPwk;p$jLHdgo
zeOz+t{c)FP-rb<F+Y;`atMDp=)5yFSI0Q+K!lL?8vSI`t*oZ9`VAsKc)V^&QyF#-*
zfut_jj^V^=K%M$?*cF;pIkyIw__rNwOP!MKyKy>cY}1mz5%Q0)E5Q*M1c6^t5s?3X
zY(pzdlg-Y4z}SXbWG*Yo=FW&vUJg-vc<rdJqWwsl-o>P<Q_%rq`L)2E^MJ=c|J5jz
zU9Rg_aN5K2pxCQu)6VQ;@~W}>XXRW7Es)ZTPP)pENxE~{|FnS6(x?D*Jlk57^a^vx
z3SE=2qk*F6W;&aDel^lY4Q)&u4+DOdG5G<bZE$~LcTH}w=4JfD%ase$Wc@E#<nOXD
z%wZbmHw)x62iIh?n!v4V82a}DHUPzgB6Cc8h3V8~K}t<Ca@=%~P>us;QmLRAt~Kib
zYO;IArMQcxG;JxE=CQ$S($*W={;qJSDY`&Qqo2Xefs5nfqk_U{B%`3)X<~GG@W^-;
zdeB?vy&i#yVh7MYc{awM!9SD;1@gISh!{E#U!jS)ws9*O;s|WuO(Z~?*EjLbq}w4s
z1^>L5yvy;G;@-<)fi!6=Irxi29L=^GL;AgHzQQWk!S}F`y`c`q7KEpp3(N#SjeZPP
zcZ)9`JvaTX9fR=_;3moAYSQ(QH}NfW6KTtv-x6iAkl|}ikxRKiO)7_5L6VVQjznys
z_RaEfI~%k8pNB&<uw?M3fc&+%A<q=H_$`qyn3qHJ9*W|eM|*+L@k7{^Wl0Xguq&|`
zu<w7dX{WKo{HQO$t5i%d)|Pq(xqwr-P^VoEz)s^lwadBobV$2uTjh6oGdnFzw@(i9
zW~*(LO~@#puLKx$Ni&ef><K4d^vcyFo$1U+iv14v(YR=1rb(P;H0G`P@kw&=(JO4`
zty0w<)sBDM5PeuW^1AviOQN)vyrkAd`L&_syg*HEW@OrUZp(?puc7PFgRSu6m|+9F
z3j1U1L$|a4JX$Rl<B9ZB1XDJR;gF|on4<r@7g>=(BpY61IgPvDr;j5c!SorZ$WQA5
ze<=seTHo{o1-T|e5l=gGf7X3)nVrqw0G=x$Ih7!i+-v<N15+P!3SoNZ4b?*uoaYls
zvjUT+RR`{;gI)3){n(wgy4+>PlEW1<w%*tQDBHp@$YiGWPDP4(6V?#=dWtIkt$<Q!
z@)_&`H5o_{gDT{Wa^6~-0Ifh$zh)Pw$>z-)Ns!1r%UBmVnzswp<WGS4Ud|8$mg-Xz
zE3DzXJ{Pu2E%3TX%}T|g?8B`=i|xT|^EOM~HvUjsTIpz#s?=z`d<KTOL&wqB1#0q`
z8H-6%V<Pd@*3tihlZn|uAl!8$>R&_K<qC8=i(ux&vInS<cL5_%<K3SS6D%;|ZN2^x
zb|ps+10gUa2AVnYPi%!OXg#)20+h?f3`ZaT1fW5ZqlQz@bw?mE`_m&vt$nV-uwOp~
znfbfzd+^+8Vj#^$!7WJYTq26~5sHevrc^WU2d}GJ3v$78rwKV%e_4aqRy%M*-sbe6
z93=gJ_Yjuo(Xyg23V3#vg957CPETzKouEDfP1=u^1k99VmyOV>ZT}U6dXUZw#as!-
zjAeD(xIpW{rbNOyTIx{ncCbS-X#y&^>297>!@KEdSMyLx1Nf?iF3K`?d`Tog%Y%4L
z65KT9DsH2LJ|SsG^Yb`+fI3Rl)zpvA;FM_)Le;@j&-us(CD*VdRALCx0%Pu8LIui<
zH0IM*seGE&uEvp)XD8-UYW7a0hV<wIFd>E7BSy6`*Y*gEmmkgHUfU0yM(0PBwwh>U
zvwJ(Q`Syb;2&;@-BE&-CA<11|>5rDvM5v5Jsx(A_b9x>8z^YAzDv{d<<#1B!HKJL&
z8Hbfak{zL@&+^)g4{NvcuzIxxa`@g2g3o%02Y9SmIi?4Rz%0K>IlUtw$fcow$1T*3
z68q|*U!Wz;PLIl)Q1Vo$p!)T!a)7V)I-7i+2fr2%z-aq<fMD@S>)ES+wp@73|G1}r
zgk9OO#2^go=uH4ynEo4kOD0J9QVIyOS%~qW<Gn%`z5gO=skbMYZg*Z}&qJ^?PQ1>w
zsU!R>*08OD2qAu6KE_Sco&|qb1Vtf{8k=<jt+#Eb{}Z4>UursiCJVFjljIPYCYn5L
zkR?UNk9{bq$gr-e1&Tng@acR=J*9)dh~EhslxFugc3wKq=eyn*hY7Vi>?>$YgM}eM
zM_t*&Q<5U-K|H$Z+i@tox7w(Ee(?DcW@=rH`v~9iiKId)N~$AAeR%_qyf9Ow(2#At
zyh;}vU+|#+(2QpFQw`K#3X;0K3Ss1w336k7oM*Jqc4V@8xsflwuIhqjEU|gYCtn)T
z(1Z9sfS?d!_{jE*Xm%}jO2a#AEV|%TT0}uW&|GG3`9R(t-`Vil8yFkog_$3C!oqI_
z4{QxcJ7q|VJI{!w->fLR0FPq<s?kSDxx@<^1sEFxDzQ7CpC9KL;u+>-pJC)8{O<b5
z9zl81w}}b$5q4bZcDfNLT@c_-l7PH(77ySH@UHIATf`E=rA>=)30cwv4I4ID;1VzE
zvJ{S(vX5KE40L7_Qaj;)0~?UZ*4d^}pKix(3~a;OGo$$@?257&20_@B6anG>7u)ER
z^eel7Z?AO)l91Q~mttcxdO7Ud1XCDQx4r^fJEMI}%$A#jZ+b|YXMY9Er%wQY-xKHu
zZuf{S(|XJgS1?U`@h90N&AMxPPyhbv<rjypV0VUOZL3X&)*FfPpV0MMGZSr(^tNIu
zWtudaHq2`xQ%HJ4SGCMb`3VgK$ffsVkZX8RNR0A|eOa0!^L2t77|o=6^1cNujc+KW
zw<GV~{|rTe{VvURS(rDuY?i=~I-4u}&O$8_d2s6810iudIC`X6!xhSTL*^E5L8FVd
z2HdbC5NRk}NT?Aw0j?c((*U0cIOP`#L$=s!|6n^@+vvvu>ojAa3;uac9!E&7_ST%>
zSlnO5qMzfR=@cYQh;G=sOP?T%19&hz+o`YK<*t;kQ-8?`jf-pUzE0vt-&>#>H;mN;
zk$q9bVp4C^XhqNpb$3#v(x_VtRBT+!*|OlL7cv_dp9v>wIL?-LhVyrc7?6mTE6Ghs
zDw8YWWji6Q=!~OEz|a;vZSH_<ho^bm3z5dWWj2vLjB<7crl!r6%KRkzfBCy-<N(~r
zSQBwmh{aZ;9EBaGrh4HHUMQgcYE-TSo16e2=W4+|gq_*3B_Rw$Gn&E%8%XU%KTS7C
zeCZ}Y-32gSbabX`4ZZZwcU&xhPPW-ZcG>#w#=rNiUI6pC(=WSwqlBWR3|3J(sg`-!
zbkerV`;UKufB*pSRzrE9-SiwV{TZ0nj6lVvkG-YWGqTBQY#42bXLBNf64o}lOA-b_
z_Pm@vCluYwN=pWcFsBo;Uy|&7!Q~<Z=rds;1dJoYeFt<6Lx5cyYlp$~HHK4J1bEyN
zYBVn_2tA8=8ZB#RZYKp#j+%N$8dZlFFsc8(H}c<xGY|a{U_<;NF!!u<9QxeKJZ0r7
z40ZATwy$?3bP%qoCmF*q=>sC;y5`~VQx*_d?k6v#S?5)A>8L!pOU^;im?ls(dEu&f
zf2F>ioSH-H5OVaBCO>DQx@<lM6*bXl!JC7)hpNYof{L0ftU~%A=fF(ncj1WH76q7i
zJ2ae?oVmUm91^d3j`kW-%7%%~I=lWI*r^$~rR$X#O-<Jfhc9+skH}_M<L}pgg4Jd_
zzNst9782U4o^lClY6f7|%Pw*wYghZSOZ{e0Q!{IY3^rN;HO;GR7X_JTouJb^wt_3_
zXVnX^^kc;dI<0ip{_!0+e3piGlMObkKFOI_Ay`tzW_lylf5NUMSz-_bUP*;Uy#K}C
zGtnlip53fcnN)&6|K8VP%JCA$4swy9yaR{gR+bD2v7kU2>yt+v=v}vUxX}NAikg@C
zd5Ez$abS<m+Bq0jZ{x>nA*_?vkX=r8@Dd!xcdNaqsQLdbzX+$`aH3WPEjuUu)Ok;E
zCNI1e+GnVVayA-6s+-_e7V`xTJX@r<gPcE3ssd?{W!1GV+O^#^wG|C6O4GNyCMPqP
zF^ptJ>c>F3I7N>;JZg<{qHg*YDk+Ij_;%+Z>^O86?6j<C?4$Q88<k6_#iMXGkgYXd
z!LB~5?_G{G3BZMEPRD&+PIDCjPd>zp()f-TEtQ%_DL+kje<;h`nRE$QpXI)On=eYU
z`9-q?Af1Kf1+c^goEt>{lr~>veWli@0c;+}Gy)t0#}sos3H16NxbQ)g!zo74J=s%o
z*8mRK-*Cp>K@-AU`j9Fm&04k9Za3Oym!=;R5x5tRR?~>zT}OWwfbvO3g@9xo_hUH8
z>e)?Sf#tD%O7yf~)AGZ40~JgIHVivE%x9Uf$jujm820kX!Vs4n{E*G%R~dz2lU?kG
z=5Z$MF1;2IHP5)Q2_8v%QiN2=At+t2kIVgkPhSa>?R*t~gk1@e!!QW@lCdoV|Nq#o
zlUhn=XUPM~G-*n}y8f%64Vxm|%d}sk+bR(X2&u6lNe~Zg_V_rWzL6>2Kzjt%53W?L
z{wZCKkZE)_@<)Xi13kEDZfQJ&9B!l&^g6y4N~NK*(dKV`2G}dKvs8Y<X`|AV=oiPr
zd7qEh5o!=j6A;_|_baf%4SW<8=%PXnVgCwrhL=h~_)=b}^p42Mh$6R_3a*P-M8f^>
zVr{e7OIj;j9`|Wv*0vBl5p|38eE6CZddx%a-85?}PeBo+RUl0Xx{rME*-A7XVbVTy
z&W|@*Lb7;SpeufC&?Bn#Hbko^F*}5w#}3-2&6I0eog#u@e_ThbxSJDJ$cL~#BnUo_
zW|NHhWxNTad3_B;vMm?ST3S!W=|znq<B>^&j7N+xmt)i}Q;_GG&5!<e%O_88>z3d4
zdYK5mvCWkZwC4F=?wpqrkB2~-7?MTZpSpJe8>RaQk`1y2l#`CdT$>km2U1K(n7aIM
zzN=Op@QvgU=~uTrynT)x{<2@^)Ceed&O3baR*~F{nW6%TkUdQvqcpSGPilRZE8{Z-
zU~J0}?Utw&k4WV%VDc*LSOi>f*WV8LL)aN)K@5U0^h!XL>isV^L)E0KbUO>DwmwBj
zKJNhrO>#K$=eS`?&#4dWNruYUAEJbvr<?KfRi(rv&G;4!1-CfD+G5<t)FY5GWiRsD
z;ZV<g*%kwEJpwZNFymN+_Rx=j^@uunsRnoORX405(}!t|TuIVwmIYvC<xOw%X}r{g
zBLQj0WmicQ9W|tpF_i)GZ}tvc#77{VhR%kkeETS4IvZX|QEjqBGvVL$+(PsEI<4#f
z=Y?ht98?`W=$iJyq#JhyZfzb%09dWS<gSo((x6Lw0qF-?9o)J<QPM~gK^^8qb8r9Z
z<(JMjo9HKaEg{|!*vLA5dLz|xQb&0;ARW7XJOX5Amr>5pVVx)-iA-guQ+Q^HPJCB%
z^vL|*uU(Gt(m@V{;dww4^|P*Xr4LFmN!c0$%egnx1E7Gt(9=8h_hMrXeILrO7x5Ms
z%Z~C)r6QXg0MX-OEABMIAc-(^x+MeQqql$!2IA<79`zLH!=8!w)lcHDE`=r$qZtrX
zEEvOP&5n6|{e{8RbHLuXa?VGRvEzk0r8F%ggW)4ETe)!yFbwEf+!O#d?9Z?hJ=W$+
z&w}gm_^2P;91`l&KVHLHk3Yh$>^fi&hHcab*f_BNVyzP_@ue=n%fVr+Yo<?EAgjt3
z@)pLD7t=84UcW5faz(F-XK6ZW6f%=;E1M7SFpBSUF%~0?3&dxZaxcrasil%(MiU(x
zl3P`6sjc#^M*w!+FR0KF*ZQ|4-`0f~VHSQ~hg53Y7P&dC%PV0NHk0=DhA`({pE1cf
z`dS+HT*;E~b)VMJsoA<=6;#l)R`edD0pOEii*h|2Z00klgA%-h7?av+sR|2k)I4mq
z?JU6e|2u5uZ1PTbQPexW;7ia<e*{NHds`bu8LQ$obF0>5)+l7Ao!?iqy|qcYlWn_j
zhzxg-n`7;)%A{y7eM~v{kKNfwE^hNnp3?h@qt`RmCFDky;5-aGF#;7`QOi1Qm`*Qy
zWg}BI2%^B5Jlt$Btrg0Rri-3(I(yQvhlyhV*>-}j@(Jd}5oapUo(J3+*-h6)&jh*0
zg60U_3_J$cRvS^^O!^jGOo+Ohzbt1xohAvn*IOV3Z=^AlKBlJA_GF=gEz`N-|MC8U
zMrV!?<?%BfC<dD8^0UyHWQA|cCa+G-OX8Q(jbI#2x5j*>N_gsNgRB?!M0^|zuXK+a
zS8(ps^Jz1a+tGvl0;A3bIrU{E$TmY6|Lo_Nuq!*37zSY-z3~wP?!U3OBti0*(tszs
zIS`-&%DSb)<IETyS6PC0`@r4IBR3K!K+@ILVx`)~YtS8`O;(9o_TB6vXu?+0&Al<J
zYfmgCX8B5GPxtXk7-o;nIIcqWTgDlF{S82mZgU^e7bW%lA-9iT0kYX(<U@l;{*^9@
z`dNr0Z51&n@cT$%nGV%4<1pN&)4IjclKpx;`CdBUW3TPbGqnQ%4cEBE2_TPVqz^;#
z+6PC<{IJW#02PGZvGP%u_tKAkW??^cm8;Vu3zHv6CerM|QFMo=c^due1L#gVz_TwF
zYHn7B9=UNh)3yVK+x1q7%&cu6Cpc))m~*5P;WpM=-46MgW=H|dDi`cb2GYYOr*BFj
z(7X|aqf;HHr=P~<%=V5PX2i){uaZ?9&}l0`LrnwQt^X}ev$7bR`*pzRx!$HOZIVp)
zWI^LSS|flYmAVh@fn$LWr2C=;b!*Is*U%|oQZbG|n=o9#TptHefIX?kpA}h~so-1R
z2bOE(DgMf4@nA=OSoCd(Bjhw#tx>G6t{=wOBtkd{Qc(alDFmTm)4Q0-Nn4b;Lz0tU
z*pt9?N-BkIn5Ohfow&WMI!s05?w|h&JHsRkVGsu2Xa}%u<o*}iSCz#5vAhd(tU6Uf
z_|mMvdM2Qd`S7F#6+JL`rP2&dHZQN==y63fwMR>`zK-L3rDZ`jeY8^_t1xG~MY&$Q
zxv5RGe2JA5!tKRPzGEUDyz7_3Qi(J+LGdwjl^E||8VY%euP-3ySORg6e&}N<kjCDF
zx3fMI7gw~q4KR8svZ~v0*+|H;wB8#I6PUD$+jGaVF!ti?iFHsOO_p%CXTL{i6a5r7
zjLeifhNhfaPy}9#eiJ+&=SZr!Ve0#4&&P*aGY9=e@pEe^Pn)i%LctV1?E05qbwpk+
zDevzCE9|JGsQs<0iPg`uxMOXb6(m2_5YUz_Mg^4~-vk?IekRJ;vR8=56S7<I*-B?{
zli2ZUcxKSvlYJO9{KW;JqvJd$>xt+yx#0`|nK7k@v!3t`x<b3cp%p-@*73?&nmvCS
zPR+*|`?a=;DIVtNAExGKRHXaU-+Nxke)bpDp)tJ<yGj>6u#Y~2D}cDr@>}`xNpH>Q
zCk5ay5+v9^x2bEezB>X>VYtDLXT+iz;wDr6zd}%hJTj?>qmb%hpKEI+8-)C3HEDS<
zwI8(n&Xu;-qYk0Y7&f(AwTs6z?2n}VOW2j*Mht_%F9m}Q{QqN(xA9D*s<R)kayW)C
z*WU%8Rw(FAcZ_l)O6Bfu^(CNa_l#F`7*iigyFcduKiq6K9W57NqThHLu>v)Qi)4m%
zBw@Q1vM(?5mC>GqCG+V+bGOp^K^C~peWaTA;|Fu^dT?d2LZ21x{t3jEfa~y<am!5X
zq<&`f>p?nW<V>S9>7eA^KLG%-D}xefje@6R3>olI+zgRI_H7OQZ95bTb$%)~dRu->
z(YGs<zJ_3eFAYvR9-jKAY{=a}0nIqw%bq=+*w>G2RvHVWBloqSnz%MU7jRe2)-Mx^
zu90RmJ|^V$+tr8_D54ooMuIt`y>(Jk`pXv}F?;fUl#*Nfp}pagK#gCHQjr}mnvsO<
zGSEnJ_B0;A<C%YHldq)HS(tJDH7+=vO`V>R6wz3+i}Mq+{sBVueh8kDW0G^$7~*y4
zemd}{4dc7L0_k3^6HhZ1@c{y`ZX~#@FJ(UvZCKe5j3T#n18D2gH^E@+*_2c*LvTb7
zear@FJ{H7DUeVfjRh2t(qK_=dhj-It04d5OCpIU{Q)bYm-wTJs)WV0HgGP!Rq1`o?
z3FC4zO%!c29~{9Ad{oyzJoO*K&L~M@5Coz(+7bo9`(JEh61x4EA{U^>IEmQM4@6Mj
z5J`|}IWM8ddqpWC7y-;2tb^9#y`FL-X`@-e1{s-eGwQVsS0-HknT(cK>qZRYTO{$D
zU|X*tIDzfRLlbD(Hv+NFzYJMq^M-?>8)TQEB}3XL>7*(sc*W|_#Xq=nJ|RTP(eouL
zOs1_wA3JGhFf{G5QL5T)o6O2rYC`$xh_E}u6R&WS_{vvm;>7lBkG?guw{xwJhY(o=
zfCt-9CAn7K7WyJuJ)zPk0r%SAIS5bB!JfZWizXaNGdSygt;EjB-!o*l2ta)Ep?^t!
z9_7jab=8Xi6+jm`|IyR^u@mG{*LH6N(AYc-Q5;KM-}GI64Qz0ae&j9XB3P%fVIYl-
zuHdRm-4^VmosHlq;h3a+T}f#D7!>3c7dQ=90_tySd|AG9$F0V)G5E1gLw)kP+~lm)
zjBI1Pe~+^#z&|2T92ZK{OIsZ5l`_DAxKFgfJ!76*@gacGN8@9m%jE&%zqVDYldpgl
zsgs2IWfb9NT`uwvS|?Zs?(*t3*Vn~IorDHX>?MTQxHgE9O-u8IvsTkYgAU}$aRVPI
zBxz@6ZSkr;Amh!bPt34?!p`i-VHk#?9qq`vNcP{@hLH*A3n{>waiqw+@PJVp=log=
z*4K|nORTVI7#cj(qhU_mrbIfLUjXMuOTQ<8C(x)^yZSYaF1~$N(PaMht``V|v4ex!
zj+7)VJoMixfGC~i_nFfOz%uP$j-htZ&Y<&)48W0+*w&vb3Tb@4+ORK(xx^PIOAybG
zYrGiIQxqR7$0Ua9Ujbt5#|$m~S>lT?qDg-+-)>E&(?#D)WOEpeGMBD~2BOIAgHq~h
zi03uEbnH^JvsB+W!0NNyU$Z`_ZKaL0vsHsG$p$E?;gb{ZuJ;1{nq84>a<!`4l4wm0
z2=&HxHcVl@`Q?H#KjhuuZ@(sY(BAWO0NkjVOc}yCl{CE&fGfk|{Q|N+x3Fy2c)MJ?
z28s<wD|LzuyU82U2|HV@p=%Wu7@JzL^$Lr=gnbee);Ojzhu#UGD!Sb&<Ul#}hmV}o
zn8xR{t3D5_&b?(x)|=DXX3#;S10dr~(gD0di#?1=l+Sr253<X7A7{5_Ila<jlag?z
z!o&*5Yt9DNxDMXodrZaigq>AeJ~yS8q$xY}Q@_Jt=t2jMS$AyD4D-?NK$OquivvTG
zx_a#t;13R@!GbL^4)u#FF8|mMu1GikC+ys=BM4y_+7g(DMgNUuoh%YxN&|ED%ramk
z`$~cDBU4T5enHBv84}kUrKcix+9Mks@;M-6E{)hIyrJD(y3Xtq9Oqu^x?VMxWb05w
zlW-IyL&X8*ujP^42=Y_VR!Z4Uc}^|-Z(tRP&CdI?v^9LbT)P^A$*-+xlaA}PRO1V*
z-hh~*gC0B=MAE5p`xO~WKJ4Omd2S+06wcTBu+Tt_nkp-*d@@lvy^aXc&N`DwKIhIP
zOJ{F;BS1j4^q?5Z>)q!@aJH=*5J$30r<D0OS9aZG%eaCjYI4MrOW1@54O=&0bV1+F
zb702ZrMu5+!ZmA((0-_`uLSL$dHjDVv*w&HDZf6_%TFmg&GYv#ruHWdiN(!(iki@}
z3_uL_M7A{ro+GKgio@=ouphR$0v?wb1L0LTT(@S_aN5%L@(gs(>Hka!jG1~uYFKV8
zUx8h>ro5%4+GR4Du-jH;%q9dgU*lg$_4l~5lrB6YH9gtJmfu@;B~ke3SWGg-^LGFL
zVi1>@mL4^RIixC61<d^oW2qKjub4ozv%Ozv$E0dAviYCD{V^XdQnGxj8pMhXm|Tr<
zh7t!B*k-chpBKs1xcN;*A<lmYJG1i$LKp_O1Q;Lm-&mGxM)FHE4e;&ZVSGrx5ejZn
z_+GmK`1T?P5l*+#Im3o1GVK8Feh#O0-}d|eCvYpxIL?_HBpz2PEn6<-lc~6a^J>e8
zjgv~5@+KG$w9nkh5Y%exqNAp)VIG2s&wPnT$K3GqNSx*>=Z>T))z(Gg+2;~OE}yV|
zt~>UT(d0oT-VBavlA@*a@?W+kNra15SA6@+FImhw4Bx`eARfwfP2)%*sXD)S(m)<O
zbeUekMkKP1D^*PbA%~plSHQzCbMUD!&t_ZHp8+8`4G+aIZi@=7R<37ObCnzc-MY;Q
z-Fl=HW>z%8PtlNqg(%m<sIMmy&*n;26ku~+;+3u_IIQ{HD45*YI9S5*EqBEU*+$Vs
zBQ^Nk3SAxs7lHVOvnQT<p#Fd`;sCUL)*jio!ROIlO+EFh99*25s0VO6+}L`_zLLwa
zpT5yAXa7JN8af~oE{46pMc+><ekWOa<3S|?GK-ki42Pd&P1h&zjs&>lti&a4Ll<`R
z)O;bCkM=9j79Sc9T1gi}o#2k3%_X|28&7Rg6SbN$B5CE-y@uo)+p19||HAP$gRFiC
zJGU%{K^TT^$&Uog{x>#tf-UApSwJ~GDJ9sJuK05V(C4bus{{wn>LKc&z5PHgO*4to
z1bM?cDZ#sEfmlOV_?sMQ@9U#s5{-n^MtA%+WZ)Y8b!`YpA_V|EziUI<MvapdP|~<6
zqTq1M>*NIqd^Nwva8M=T0q~EK<}lXG8*YpRU(2g?B`Zv*2}{C1lh!s`-}<#eKzNSW
zD(Tp&gpbkrV<4DDhJsS1J+~YDr4QuU)tJ+yF>f0}9yFXf5t!7h&eSuMWlxY7FS3`R
zq`<|)I&vy$B)qUH<k_=#d(d)FPDPY|h2D@p9XB|$L%7ag*+8CYy{qzkvQP*^d3_7y
z*?Wa}dp0`vut$?HNW~2S<e3Eo*P~i4mK<4r`PrkIwh<S!!7#WR#(#<ySokgNi;gHb
zQEJg>2X0j`O{zpLO!Ws2hgZTxR%o-=s?gHx0{Sk_u7?C@bcKFt$HXx!#VO6vUC?&w
z!mtLxsk*(Cg`cCn%q86$7dz&-H8#uMlPLcVy(e#+k<ympXa0E61<>}H2RGtA3U#NS
z2iHf|5oa6#DsrR$k^`mU9aZkJ=|q}hMB@*kPssO=uw_dX!7={lkNpvLM#&L_FbusC
z27=N3FV;FO5+6I-3oywf%f`lf@52H?QPMt8n>XG6kBNE#Cw6y1gu-H%KQ<MT$MfYH
zx`cM(I0Gs$ZG{TOYBDD?oEbXf81DqMS%Je9yFVIXJB+7-<=Fo^#B(_hSdeUqmi`I`
zv%sQr9*gHRlZPb57@htS*cG1y%DmkZ_FRS^3q{Dc+4=<!4kE*l!#_zy4@cYpk4`P1
z52E5|Y3f5^aCb`*Wk!jp{0bq>(M7Xv49R<qE`&Y9BOBiHsJQ%#7?>3l%%1X6XC^yO
zzg3le5`Aj=e_wqcTBVo&azekT;-Lg5d4^?+@;|D6p#nr7ZY1}XqR0XbA?{gQf`UJ%
zk=bjS3jQwG6py1Kc?a)90@%^~T|n)xhnxI7&a2v6d_)R^p!;#P5piC~Qt5UZaDuEf
znT>T(#_ICg*ft=<K8p~$Vqx$odWC<f2Wcvq5(@W2*sRULPme)f8rEiYaC88drP!V}
z8jT?l$jXbg%0t`+iwA;IHEV`Q&P~dyFE$e>RkLG@KfD+71Je&JVQ`P^vuQ42ZuZu<
z&!OU+)6Ck*bZ*C~%yOgHegl-MStl`9<;Cgg7TNK$j^u~1E4yMCgkdXj7$5sD)<+T~
zzSIHAYX}f*T^xai0i?H%{&m0hWuWVcv~dxxjk)&|1dZ1(PmF-*g_Z=8$7F1QyS_bL
zqMBmVQVYiVE$zowcKJ;W*iW=WR^AT8S}InC@P#M_$0LpIY4MwWilC*RGj8)x*v6MD
zCkDu~wfpSQxo1-6ZmDOX$eSWZxB4Y6>JoP=ifViq4O3?W<;XR=q884`yiT}&6e-&u
zG9)5j2d&v&2_0`@CL8=qn-tYTE3!})?af$h2}>nKEue>4)Hlt>US@=@?H0oq%<#eU
z){{B7dS@@EEjOvk&5c-#cCe@gitb`0$~>&hEnU<StD>%k3vx?>k5&ECp4HPp;o%%4
z@SoWBxw+uFy!^nLC%yIP7{D)SIrWbjY?#+=el(gvcZtOpahfou$BsM=yzSnrZ-9<A
z<d|Gb%L>Qiu+;y-xDtw0z7<wN{3%a;U0iF>Y$Cw3X*$5R93SjAYa6!?m{<IJ6D+YA
zlQ|EVzBxNO+NNlJW&pA`XXjYLY-eHF0W62vR0J*J-5HKkOE!%vAo5D*2rVhY@CrQw
zfI}aJ68pX7f6GZ%mmf^?BkbI+BnDv^+LFQGNB@m&m;{NRH4ShkOagw$S3e}S^C3E|
z=&aY51mS0?O5oKnyiG4%q*wv(<J3k?fuI@gQ9r{smA$5a1(~6a0i91?a_nQG2B;=o
z*bjpdT-`5AI@9bb=(1xAw97KR{slpu&@m5f1DkLun>q3sPe6=k%Jv~1@8S9X0zp=(
z^~04~!O`=Y#FDh7G0nq>m~nj6zONb3ohi6seI4~+o3|`mO&MgBro%8m?5iFwSWf*#
z1$~Gi6<XJ}qIzgvAJ8$6tS;bDxdH8KP%e7CkwzbpNw{Q3qbXXQVAGf8#e03n<DSo7
zpHxj%%%D^}Hwbx+87hdYPvB6mz~P0?d?*LoWqJv_*ra)O%&?L2@lx9ozt>R{n>32v
z=T>82AL<o&J`Q%O_AT*qbg6H;MC{o1M*d=GLCHt5KHd@~pF#RAhW!@BzYg0H6-bd!
zr@dt3Eu4V#x(J#?1oUQy2L=Ksz5NkvV-Nalo|ElyDFxG(Cc+@a^cc)cFF753X~HMw
z<ZNq07A)VZY-WnkY13&CK9i+b%}VGqMOYG_T)~7jqgIL<o)y63%K@Es+y0ENkyyO|
ztlASe8UG{f%91DsLD-c9#pV7Nd(}P?ztRgZ9TzH)WlPA+tSjZn?`6=W58N^uPEpt=
zq_kp`0(J2y?$_@Y1`<|XuOn3ghI5kcsbsf4p3zY#e%6C8r`NCiKe!yBzkzyuMk0!@
zpuM7WoO-=!|1Be;Lmd6&@d0;wZVa%H6UdCsE3TLFhRdz6ySzrv$;Q<Vmb~t_Nt#}A
zLD&~y5t~O+<uVws;y#_6#|95wmt5i~q|?M`sPGF=shdaA<)ygjG)}REj@H}Ga32w<
z=R6$p;O`kat+z1OxxvVQO&8n);Oc-fMqPRxfUB5x!3d4RSF25L1>m`5ks#kv?emDm
z>l{fw%`3s2RS_NMqkKd#puO{2JWr1vhT71JUP%sWJUOhp-cQvC+fCJ>zX5~8TIMBi
zG=YY+q0_9>y{iuN_H)>D$e%jBkWW+b!`t3=#^-pKr{NMmD|9f+6nV7bWrie~hOW+g
z$W~FE`clM!C&J9aY^D#zmdi>XxBUW;<!KbBN`Mn?KKd=0Z!$s!I5!{{`rKw9$2QWZ
z$erYrCR$tU<feqk5mJ#`$tg{rB<KUr`2?6Dk7I?G90X~0FE}O2kG$`cdA>GMi4Dsz
z5>)Xc?A($i20<XYqgyC~y8n$`jnbW;A^%fUCQ(Elr{^64NDLV9NP};|Fdrr#TS}b>
zIVQvb_Ic9!>1v7+%@$hF$@y0Wr*j2^`6IA1w{hN3D(eE80z^y{mzwp<fn7a`MLd#~
zzb!OQWH(|^Mz09qT+?mc&<a^*Hx_W2y&FB<5e<E39Xy(?-W5mwgM+oy0zyc^z~Ym4
zV0&?@Qn@U!$)}JrRi<HBaF(8aiCdxB6ZKAonj@fb{bT!h1|-A{fXe0T0vNGl@mcb3
z2@g4itg6=OTW0@w2AtR?1hJe+`&+oI`DxkMEba)NYCxe&w66a)U~GkqbK=q3o}o>x
zXPz^$fJ=>O^A{8ve<BsdGqK8aa;=<rRPZUix75Rud?vLZpDd+O48!yIjS@AgQH0*2
zJ3+MB!nEmvG_WB@t^UGv(#2YSvAPwST@MJM^20dokd7K9w*VJuUG+sPCBoNx{u)Ni
z>WxUuKZ~#dy>UEHVqr3yJCwyTL9(ExbLA#4jT&K_^ufa1t6A<M{e_xh6XFWd(Fkc@
zj{sWfX|KOoKowkS-1B=n%QS0g4FbLkBowT-)K5DV+b2nST_U$X|GcCt(s5)T7Gr2|
zRm#>!$?%`AGdhwW1c7Kuq9T%iVmCNK&&O>iU~SDJq7AQqEU+>dv|;Y@McF5Zg;&9=
zOhJ}eF{RCrV;6-jgvD)Ev3+aJ;{bOW92TdW0^>B&@dzm1F>E&n{g4=^k-X_g9XrwM
ztrQ!k4dXO3?Wbng+}vo060q?C&d_|eTER+PE)4m}PwGyytl^rS`t9*fw=_zWH6~x7
z$Ud4*Innx;B)gCcgx7Ewsp%h%@JyTUV`R$Htd)^h`yfc9<j<!N9i6WL8QU>^VBkGa
zYM3^|OXQOMF(62s-&(wMflJLqH-V`a@#_`RelGy2=GjP<Vx_uLpKl;M%|oj3p-8cM
z?{;Ak!^_yK)EvO2Rilsz=8}v*8|{ilb=;5l-Z>>VO!)t>=Vwp#B3<R4da5Aryb^{|
zv(~OIYtj3*F2~uG{|1;av_gOMw8uXFe*B*VWlE)Xl%^BzG2P({z%xmtKzt*6dnGi)
z%~!yAov^J_24`Dr6ts<gM%dI?Zpov+YE76m;YBQTn%--osAz({g#bk3*^3ac+HKPg
zi7G`BkA?)gC%wY)MWDUGq<WRd9l#5o+WZTdLWhp-I`D1rfc6SUX*lY9-t)SL%c1kn
zuz-*2b<2Ne3~z$|-`MVturtcC7zAPHmH<U%{~McUt4Y5y8{o7(Rz%1RBVcnh5cBu&
z-2hkUp9NVkIjqJq-;#uYko~TA((G96+*bBJ21h46cgW4jjU`R9kM#4>2p?)}$_TiF
ztn0zG*Ar;<zx{Cx{S3(0tC9-ZBXRTJhA|XmAl(4sYagHQx^>x}^O>e!0!$yDRB*(_
z$8GBYIgy%fOxHzlT6)31)KaEvH?$7RI*DQZ)HJc7*z$7Uji&8I{7AP2sh&QyIQuj(
zlI_n>@<L_ThJFOjR%Bv5In~rnS~aFS7UZ<``7ckE{!H@em++5i`@L4LV=MFS^R5%F
zQ%f`FLc$%Z-LZu1Hsop`_iWvS`?y7S9Ac}cehZ}RhH_xTDGg>Am7yarWls(OMl9@+
zuhLpXzyY#1``lL0aq{)Q77->*X83E5W8tu+RZ}+I{KGw?8!iD)^Gp<q090ff=}PlT
z)O<tM<;A*(5zW2O(l3-%`&i%Qcchvo=y_@PCNwtfTz`ciUc6{O+WfS#V|Pnrb?HGe
zWOSUw@3hbsBInQnI*B?1J(9d`-&-lDzhc6jIXK4nI&7ectRoDj3C@Gs{Rj{HO|ON(
ztPl8_k6scN^G&K1^8v5?5q4$S4TCW7N)|#Oj@H{ZIB15CzUc)>Y%tnpfjl{TkYf=I
zy5zmkprGQnV#c~uJ7gAZ&g-$%OE&(hWr4P4OBrR(h~^FQe|66MKo!IafK^y7a%YQm
z`XZ%e7Hm!&WRh4P+4&yzpvg$2c~+;t9}%h2fi=v71rfjLW{cMIQergh%xFG8^?8r%
z7+HcbVA7~N%n7R?r+p6Mv%dn9Vu8zh!8m}f>Us;<cfA0rYb!XxYsPx;2(|?dn!MSl
zceZR%3g@}R@~6&OI$g3SjfSAWx0$a)N2!uLo5!Z<Sb@0FVNj~Rg>|P8G@(YG3Gzm!
zzMwk`>`B1CrK6(BDT@K?IFSpA{d+fCCp=l!Bi08y+H9k)4lTq-da8ugjAnDoIQaB*
zh#@Wu{SbiWW}DcG0cp%#Duvz(5WCzjDMQ%XY;|VY@iB^?`DM7&`Xnc+=_6S~nwmA9
zG&%#s19zQz1;Duhp@!{C%)gL2+LA`&{scP>=ml#p+AzA)M2Rfyl4xFZ?$ie|fIJ&O
z3cdSExKq;~1!*+j9`reo<;}OrijpY!bu&Dtp#?&|j{%{Fe+nAXXa*X&uRU*6uVPFc
z@`HEeo5%h95_WD`5`-WO-IDk~-P){v3QLmuN-v-}cD)n=xfhYMv)U2rhJ2i;(L5hk
zm|U%v`ACT3vgTt~q&e_8XbUa*$|tF+^4M`TnotMxacajY9owDjjK~{(jV5xcZUZdZ
zZu;!SNg7Wi?>NPdakbL`Q0X<01M9cD_qf1a?bL(3paUSmZktAcrO*JcH2qHaq$MMJ
z-`EuqCZ|hBfC=BM_TeRU!nd>zZq6d4(YI|o`|qmjq-@g1`O}r!$A_RQ{rcazfV4Sv
zXjNsgwYK~ymk?0n*sSciCIepiZ#hszXslHfOdphfzmffPjpzuZf$U0`_$+;eNm7%y
zf)Y*37xVbObX4Dpu9kd;X@Fu2_0Hk<TDv|2()6r4d6jcH*6@0ViwJ~)w88l@&_rU-
zu6hlh&a;LIU>kQN$U<XLzo$miKrMJax0zO1D5Cm#{Ae`E(Ky8S%aOHcE|7m=an^9B
zyb*bQN`_Br_#>mBNVArM0z2!i5`=MEnffwx!W#_qhXvU(j%9k&Uo?fxyef7(Phxnz
zh&2(xvu(dFcBGaCdrsX|VL43`x7?B0mE>i<6PJ1g5U~ODjV*t(+ET{W5oma3v=tvf
z`<<Q<c_%hTvCAM}ryr^D@1L+UxMCQDVdzTO;9&M&tc8HYNg1HLrqBSg{Pk|WA6o7J
z=zcWT1`@2*MVORNG5CUXwt+Bfa_TU8E=Og&pk1+12FikK<G&3wcr~v~Z^%ZJpv07h
z4MO;!+5FeQIEV2`3or5&Ij*=QrrPaZzgc`Odb7LQX@YIYBa?TUs=q*9=w2vi|49ME
zFLdqH*iF*`qL~-PLJFV^PYu7aY2X2z`XB1(Rr)%-7%!KUQA>HyOY@Qj#R!b1sZ=Z8
zo53DIhTDV_clJ0rgpX~9jMw=qxEz6isoJl*;ofg&f>@U?X=gXh8xFj48oeXMOv9P}
zBRtpX3#-8o#LpL_QqN^4O(&WBe)z*vGRdKzg02c@lx}9Q$`kVQBm)GAj`lQIq`S%c
zts5k9!|QE&WRDs=g<WZVbF<4~!}H%+4Qtntl}l$cO>bn3W(G=4SwEfvE7Dto2-xaA
zx6E_7_UO2wkPVylY=CVrwaV1ba0}Mr3$P=_DzTK>nd?NJwbMJXqP3r3P|?sMbOd!D
zR_j8oIfEW012BBoXxc&tA;qj51K@0g`Iv}t9>NdYX?4&h{Ghe!zolcxwg~7Y*$U*2
z)SXq%Xqxs=!Fwq}2idW7$RA<XmSr&r!nP#f1NXnNQCku}=F$a}Q%_rqNl1QIfDp0^
z!7rbTZGRl&lY6+#Q`G1`T$ICEsgzQcxOi7Mgbq<ib01tZsn9N4@Cphz%y?vX#VHP{
z<Y`7|b5B-yO!#j?`C}E>A_Z|t$EK{|9!84JE5m6<d=^Kb5R}`dq&0t<lNFd^p>eod
z|J-L->~{s@vBm`o<2m1hx}GG4bQK(@aZ^Onp&efp^2?P$MHXL`1&jTJ3+5|;X>N%G
zioG=m^n)MJyc$%Hy-j30kJzJ66l=|Ip<#auBf)i*wt@!I{bLc>A$u9*ieM<@ukCA6
z0cmnG(A*R9R2d+V(^YERAw$8pB_)ib8~*VoK<G17Fh=4n2(PxYP10L<nVRDZ@8JC)
z)7h+D8n*N#@V*ry+-6IhBU5;Th^aPM>31fDb5S-0BAae0JD?<LR`<+<8H_F0b4?xi
zRt3V4QqXsJbH8kf(gMJI8oWPNyAy)>RiN0&p9D`dm6H3`8IWi>^re-KK9kVAah|7Y
z-pyC%%qD#jx*%*^B~_;=M`^0`%S_SvzxDK7r>$I&4S=g!UZQ8~O!5=5((X*y1sjmB
z-Q%b4Goxv|TrDUZocB1wKdP}m!mcFOf)E7W=tn^i?|-qcKCS8%t~(*dc7huCMj*>4
zIDmpZ`Jm1TL7Jv0s`m?h)<rYVa|t62ax|!Sr8meW{gD|O8zlwXz?q)qTvrdaJS$^k
z8jrh}Vy-KJf;fui5$JW+48p8mE%1&Z-%<ypS=Z}TxUJ*y!aTcac*;Q(hlR8H(N*b&
zgJI`AgQW}lf;4jsqIkr@`D1f59}xs&7z*iXA01%2JvNo|!X6DY#-dEiQhJIwXpp9Y
z5!f}TTBNg@pYcw20Qv?STI1MhQ=9~FN_nV>>aF1&-re&_V1iv}(-4XPZuvz=jHcm$
zUfv}IMqk=fWI-G#cBjNHt_*q!sq>tyBb`w=4{wbnZC+E;4<SHPD(xueF9G*&Jhl`8
z8u7vt{z^Vq1W&P7AwZ)RpZ;YBwv@#xOrZ(60L>N@Iw9y=$=!n1^jCHxvx7HffwR)0
zeC5X*MKl)5b}9vL;Me<;8k#!9S*K{s&^4b0c$3O48109%K{M*RsFXxNeqDR}Jb|fh
zQ%U&<av+)o%hZn$8WH+m$?ur}&Bwnw!(gvZ&6Tebp!qnCmNFv<H0>qlOUZ#~R^_x0
zG*k{}gb|Nvm|y=1JC_3pLJ)?w1fnSYH@539@x(OXVLrPINnVa(cq1h9+omdpztQrS
zf;k%1@uax}nJO>&E_i@d(TkDi7z$3Tn5RDu1JT!_5N{p*jI$3pH6fNkR|VP?m!rY1
zN4tJ3zDPX7#%INt$+!>AZ$%(zxGj^1?sO@D%lDq@L?z&=7}pN4I=%xZXymuzMro$g
z>%hLIF5~15_mA=G*3#Hf3NK;mi3wUhxEzgU#Q{6PAvX}TmYDe}mRTBSvCWP<Y#X80
zd}Tz5W@`Y~CVu9(GAmf~jdp+z00PV$8{`Tc|4${!zw4;dcr<@fdN{#9{;q=ASFFzL
zq}q-FFXh)Y6E1w7nn(piT4%C8(i2eFKA?7$li@iD-rQ7b0_Rzg$1x>LR;5(PT?KHt
zy#x%vU_93)=_74aY1#u+ltva#k94bUETwS(oaZ7nI$5tHKY`tb!Z>$VLH9#Xt1ka1
zkm%Fe(}C7;8DylPBx5g)3&qm{Nazf6q{E8|R*+KT!2^(3+r6YWlhCtGZMd3S#U%Uj
zW|}JBZ2~JQYWZYlQq$*wI*q`l>}QnOirGi>z!Z;UbtB~SeCU@&ZAdR9n`v0wFpD#c
zB^o)Rzz98yA7NK^Trms+TS9<9^xs&_$gutiuK~u<QxL}<B;bHBYPeC>e9LO=88IYd
zxpr<jNb?_`(64ql>PT4*S)s7`mjF7KFt8v6^OJvEhQ>nj0jj~sp<g_Dd_Py0fRa%N
z0s2R6HE522sZV)b?wn*pENs?o6DXeDcIXD6LOHKYkz;=-;L^y3YAwr~;qn_o<_O4<
z46wJCnJ*{Pd&Eo$<IyJIB1$Bb^E%B*7F!xN%mBHr^b=tz&j;xrU<3o(@fO4RN9_4N
zad$Rm3zqR+Ooxp1m%KX~tzPs#6kp%cJ45(Cf^=VFf~UqD5(nxd6IqH+lUp`u%!evm
z+~(v|TbgXGsLSzHYC36Gpf*Pks56}=WOG5LlHD_!EnN<M!K6>?-tvC4{L`tEjiewE
z&|i<YrsIisj+pyDnKPtdZRpaP8(y+$xr5{%=YUCMDKfS^_KiS0=5uIcnv3+PX1@kE
z$<&^2Lv#VBkd<8RPW^n2jax&}wo1BQJ=LqLKsa|UBDIC?d3{{agcqz+#|BZfXFtjy
zVT5uo7}k&SNl`^EJlTGt6%}d8d=4Lmm%;eTqW`zU<|M0amGtBx@bh<3N&Lmd4H24A
zb6WaC{s_CaB!@v5cB36Y*uecSws8tFKUFWlgeC>sdWHURrLssDKPjns3Xi*l%eN`p
zJEWq<dK&(-)qal`=uL1IX*2yx%odN?rp3(2WSTNS&QnQuOw*!87`YW#;7u_aNGolo
zZ!06W!jSfH?u|^uVp2VdOHs3OGVRQqieTTSpMhx28lBS1atg4J66)T}IE-wy(S>C+
zKj-wET5g96t!c-{1-n0g9|7w}-LTP`xM6ysV}xT6b~71h@~kk=3aI_EvmtT64c!<W
zMa}xF1mv-UK{j6q5`Ba-3}n=LMLVZ0kWS(-IM2v>UPTZhPpn=T2uu9}JQZH8^JrMp
z_(4KTYT)UcdwHcY75RmMi(Vn~7lvPsVU<Wn{jrJk%|%iX7u)1;O3?oa&!nV&5mYu3
z9n5{x4S`?u+(X<7r=>l8dRAyMINsoNQDJ)-ZBg>JhAsUoEXI$ecU<wD+I;4_-xnCn
zNor+Xd`i#cgD!z!Y`Eslt(}>%T~jGHT~9m)vBP@!xq%&)LaTZ}m-B;8rO&5N1k}y~
z!90<e6Vmbw)j5&16OZ@-u=FPA5kTCn1k)oW)sU0`403&pPJ*vf7Q@5Pb@8;(nrH}U
zs91v8N{!e*VONwTF$lu0goqaIf3Y2QYT{Ss0>0W>1VWM@MfQUf(qOywuO5uw`ildK
z6(Dv0_2NGCEDv7!a$spDF6>W9iNLVVcy8lnS`d5Y#b2OFq;qC!Z~Yqb*7PBL!6V6T
z*A)frY08WcW?Y6Onv60JTGPG5eL2@J^v^z7tbT@t6{6@|pB2<=&@uX;HBIuQ9dJEK
z7Yma&)d6d)ExWLZh0xGCFglA(z}e3JzFj)?tMoOIP`b~UPN6FU3~NKj=t5DmbF)?8
zgUwXka;eL_izhmv9?~QD`a=|?oWqT<*)Uw#W9#CuV7BSbLY?9r-E0oM3yh0@=V{;Y
zWDG7#Q`2Xm4><v&w!7tIY=}qi0ynlTww@~SSGk6ZCb611*JX~#7M@1#W>M1TGENx5
z@iqNh*F}ImX-|*y9STS21U3lM>@(!jgPHl}pYE@ouUG+1@l29Hs$MYLJ2Zt}!8yTK
ztm>%!;q~JY$XzI25)(y!A5w{Tg~g@l=sXCtQQKqd7fJf-PTE!#6>Dq#*ahmDQCA|5
zG`s_y<a7twG`=1j=g+}J`llV6Rv4O)Pi_Q;@;#`#dk>rc5q2%f4ul}^N`j3J_rKT+
zHP3DrDRO|YFb*pH`%-}yNZ&Fhn$ws+5xwjZ#xZ1gUU)j4jjVT)hF$4hkY&Y6IhgEr
za)k?~Sqit_1Sm?<(_TSw$!UCF5XYvu(HL!Sf^eGPd!#052GO2cMkXvSxJr=$8WX&<
z(WZc~>~-O%p`r9{lPUwUJadML?BYh+5ij^`8yrlE>~Q%P<NwRFGWPL)Kc&Ks4mY-Z
zIgPB&jsDyA%d|q8?l+S6t&q{TIOmZ)E)ra1LO^o68>FY15JzNfse*nG_u)LTpJ7W`
z!c;b8_KN@+Nk1~%_y6{U^((#$f@wBH*0FWT^V?*<PX)zyN#Ae#m<N|H-sqQ+=e4Cg
z2IBB@>tF3<<&c<WJOW8_9@c%y7up#lB&JzQ8MG1d7+C$t2a`y)6KooFe`f_)D@(!=
z)0FGATI3u~PQc5aXev;@uo!$_crG(ldMyhMPV?Esnf(2mV0DZHXI}vn$A`Q>EX0h+
z-U$Yi7s#=uST2WfRKqv(ejUj_`*bHMs?V0Lp?Gh-i%A!i2nnOc@kamcEQG14_#?62
z9*d8n?ft!B@=bH63nux9UQd#*JMxdPbGw2V1c7KvB2W8oY*!;pzDNU}O_r!Ia3@!Q
zP%{R|;_T@`wre(RN+N=(Y_At70!x&jkDpMSQu4tso?%^|K4d$QI<q}c1)abV_QY9%
zO5=uSn8Fw=_x{7iJdM0e>u1$Vj_+t2PMD{OgdiUvPN1hC+R~R?mF8>*D{JDB3hZe=
z|9Fk%-j$g9gJIS}(a8E(U=`s>ytv>~q^7g9XDSM?XO#SrgO;>{w^={8DOy>L(+m_L
zy~NMacQcAkm_{Y=Yj<9!<<mB|>o*r=5KJ;LitCp647AK%r4fbYrlVxT3i`+YV%Kgi
zT3cjwmOf<g2|8u}U264=|1)zCzwUXt>&%1uhX6KL83xnIx8wsSYy(PPY{;k;bWshN
zQ7gv_ylEB_7VxN~X0<gRv6o4<Rlm}Iv#p!7_C4cb2*?6rpYi(YjCee?niY^{2Sbim
zgXl*swpIW>3qm-l8LA!e@f6r13IBv7TIkruw=@1?igE*i_uwz*tTq;`PHbkNq}70y
z<kjaiP-z}s)RjK{rkC4<cJ;SV3s@alb$6ufsK*VsUjUZGbmLKvyHQ%QY&)ekAbsG-
zr`LC_z*~NlD~?R_BkYWFBnDv^dZiLVLXNh#-_jNvX(jL9{0w3!Q$pfAZ<aLpO0l=o
zT=Wq6zos*d1q3RsefNpFSHbnwFqss$g8D7@iM?i^J7RqI)GTpru$b=?^$GhY>c~N^
z5c6-%I>EIXVdsfEO~BtUR=`D=j3)kjCQZzk54Of8FKrb*JdqWT+?0YP{bLeRb4Hy_
zHK;D!SJKxl`OB+MeN;_|A>Sq0t!^!k%#)nMJR-;jyyb-h_fbR2g=C%PqRnGo!DB+N
z0<mZ1%p!IxJ065y1;{EA!i>IjXh#uRzoUsg>t-aCIyXbtWFena=Q>9SPhh5Ar!+AF
z)wy*r6}y2m^%}m25pbsoXBeB4{N6c3|B52IgMLo~xc*qq<8p)o*Qf6=bZOysM)$!w
z%J0K)vtM9*X8DGbUwSjLMpM?=TVD)&yh}Z&7gRnzSmntPluKzil9PEh4y;hGWZ}~O
znFHd-fH%$axoD6rE5Obg%^NR&nN$mEY)t2!>IfhMFNQYhfsw8Q$iji0<J(O4Npn9U
z+p&CheV<^R#xB}c`35nsIp{{Uu`4wz(?>s(dkes`eQLt_xEi%a;eTsQD=3rQmxJK5
z@rXx%ehE9XBZ)y6h-S2<6XE<5o5eP2zS;o{HO2=zUbmhsy=IqvoCl#P4onAWz8Q2N
zQT#7-N>g2nUG7%!Ykh!avO;dQ;~H=fj;2FaHb4W9d^<G@_um|%PfTBp+pRw63h>S~
zs9ALD%vP6#+tH+e&K(9B$8;Q49Q8>kYBazUT<tEtZYE{;QU$ycM9n%!e`DigC(){r
zQwXxLhPz}>H&UC<^}w_vL~ybi3`SRQ6jR~a|B%DaVWs@*klM=Z$mjseKs3MqFb+c4
zoT7}Whjj%UM5Z|U@%&yY1Pq7b&lLIPhnq~IQzO#~Tm#Hbh3XelyD;t-_~2?u&Z_$q
zzldgiLNN)WHZ!$mi19budS?4DOhulpIb1H0{H;0#HC2ZbA8>JQ6_8NWm|%rx<jV_2
z@B=RmxVUEr<5xi9UUl((fO+mE7%5U{Uw-T(taEepe8bw~yZ$5TESg@X!MI|!nalP(
zTVUtpn}`&<F`ZRnp98ku!B^-2(gfsLC{S^k$uFUwMnA+^32$-^LZ%~p9Mbbd=030M
z9>_&Mua1fBg%x(E>GlMn50ZBUa@3p8+zHYC{em_5CA7m-9%!+(?XLg*2s@)Bhd~&I
zUWtHh!u>C{afv1Nqv`>|q?3eV%hHqDhL=LKQl}!Aa5i+DOdH(16q?L_WJT4T(5+h|
zeta<JzLA<5#Uf7Kvq@8v4^%T-f_SSsBqiL>L)E)8oir2OzpQNR2!+%O@UQx^ARdQ9
zXFEXQ`wDh~Kv0tHVe1m0Wl!CW=GR6$5Hbcn(H#=I<wn?Myp6MjQTtd&4zykYkv=hr
zI_lPN52krdemH5Ytjzaw4>b&sNELa#A4eVo!)+M?p7sp2SOG8Ow2qN6Ga|xGOVDlr
zfoz?klBlUoxaN<!5#4q5d34T3ZSZ!>?w>RBY*pCS$2j`V|6SKhasR#ojWk;@e}fXd
zV{;ip{|Y*3c>IjrqbVStE{Gf@_KsA4_ou1^(nzCI{M?~pTTmES<)2O4=8vMxk1<F{
zhP-@#9pZBMy5iyjYj#BVMYw(r=s(_Ng30r5&AO+ZMK?;E0!<?|H7Xo5&rJHOc7}={
z!_5O|oQ%n7`VOENwh|^%{vVBLj5;IL1MSBS14_<&cQl;h#}^SKZT5xtxdAZVk|ivk
zMBsJgnE10xtc7EnYlMaer*bDxJ>zCn*3d$}Q=l1iZ^TXYcl|3P{s_Ag90@`Y_$5&h
z`2WXt*&eD)CQCnHCVkkT)b;&))JNYEUn-jHIez-*NV|$1m>7vU;(4a8{wYvKV|5LY
zBU$8)`dIy4c&RrEn#kpJ49;)1`Zr0Lq4~v34#WU!PdQV@(mckoHF+CCE9>^7GPG+s
zqz{H)c40lvr8cj94@Y;v3lrvOl{{*Ty0D<ff;gmUTUtew8aO^@QxzY>FQ=@&VVg3?
zO{s#JoCA9gj;P@*qjfAz1;Y>^*dE&d19-UzGfoLZnL?(KO<!A#71EilW3v|IA7Ihe
zH@iq@%mq}dkfJpD>8reR2MO&(;&tV7m1nh<&!7yZc?gk(G8q_z)^8vkE7HO#=DytH
ztandQzY8Rpb7qJs-!I!>x}F6HHt8Y*d#BxpUg-y*NqL(DKFmGQ^4HM*MKEj={Wi_@
zt4*x8cy4uLxX!>9beU`>VDtkknx2he^nN>JyYDmmYruk>5tm6lp@pe^nGa4Mg?>H)
zB~DH$TBirS5Sqn&p5oV}j>cNLyat0nwqQu$2r$dl(C=IVkl}#Seo7}dZ~=Xp9mc*K
zKGE$?<)O%WbF$IExX0^k_|PLNjqdkr`$tIq!`B%lNf3fC^h%(Da{r5Mv%3(!a)7a>
zt1TK0d8rj(#jZ9u3vLluzK1(v{6AdCmUm&AU{{i_a{#hMpRrFMSNiOYI{%FChQ9Fe
z2F(AuC$JrqY7;Jf|0tCnku6|h#eX$NdiUpo5-9*dUqK+TIBllAB%18hAo~4{W|#lM
z_*1kO`#jJoU%M3(14BU%E<IN9wse*K8p^(W+e&MkgL-CS2q(NF2ABSPK=_(tQ=X<g
z6Fu6vIDlujiLnXCJQutT{{Oo^u8V61yCpeBMm1i#Lev!HUO3XU{F`bKRXtsMGph7=
zN-m7Ee~(EPXvF;q#U$vK7GA&JmhPl~aVFor|I4OX5{rJ9SqzJMfqdF%KoR^ZQ_IK3
zNB4Z-&J=7Y8Mh2UPh}1ljlQ9~+R(r`0NG)qc?x=P^eky|7dC$t7YrI50k&~QnhM_y
z5B4;SLxjq>&gO3-Fq-TzE!4sAJE!nW8DBkdwr)Ty?7VnQu|eqyVEN2RfEWg3PU-U1
z4WwI)RA_GmpmEBn4;PK$t^y@KQw6Cm;OpRQIBW}(YDqgMUn93mFaddx$SmBv>&ub#
z37(@GMAPH^OIHHT4`J7K#4rfMRx%h1*nhDW0#d%51#;=73D(2XY5{pY%z5?eKitl#
zTvSnzXlkswHu04u{qb5=QjnO6^{x=Y^_gx?z)eJI4aJpp$<H-EXq*%zVs^z#-9>7A
z6_vv!VAsOawlSq)ttO|#7j7|)30CcC$5q{$r>@~P)9lU>7OI3fb8tQ~M&SfCc(n<8
zyb=yZI*UV_G%qVbWts4bE%5wNbQycagmwqhUQ5gGfMuIz<j$<fa@O$iAg0I)6|y{O
zStp$!^(Ld4-ibj9u@2#~k_$z+wKO|P3F@{!GS6-)O!aFtwqv(;K9Ng!uj+xDbL78*
zG0se^-6S&TuX*;Sk}GJ{u$L-Gb3U?b@nNJ9S!jeb!C3F9s`Ikkh%>(jLK@Vdx%jb&
z9Ltxb@-3RSv3<%k)+c{Ou5Ump&3^)<0TJVTo^~u#KD$Vz8Mh>S1x1YOGmnyzhzOH{
zEL1l8@tL<(YL;I>cxH6+cMnK>rdZ20XvEu3K_t*Q1<#&O;##5!M&~V%51uogn-LJQ
z_fUcE14KiXdz_$Nn&^@iMm3d3q?|kg+Psy;$p_`W`Z4z0oHJW1U3?>-N})5!=X;Jg
z63sf-?|*sMUHu5VvSf#05OyUm7~}h2?3FY~{(0&Jm}%k?EVK*&kYnlozF?QzYKxvu
zGL<(Uk5!lKZP$vXNa|^Nwt&O-?~+<nxFX~X-k|ldKB>)-Bz1S-J#B4TgPN6Qp&yOp
zIwdsST3jJTr6doN_@ldB&g_T>s>760bnT(z6ws_f7@mZiQ<fpF!_%A#8t-%|8>{^3
zlisUe!!G({b@$w^lmSl4+I7ICI~pT0l0IjtuL=i$f&%nY<m?FX$^}LD`7&1iudu1;
zib3eF!oA1it{@ALYG&LQp8j_CEU+Zx<rL63(8s(XPI!sOj{=w+w;Pk93TH{0#gc0U
z-&e#Y?Hxw_hD>bN4*{94vq;SkleWX0%cq`rxSg@M{*r|pCZ>7xU54A4R^IeqR_!Sn
zQJZ>R*&v%Wum(RBtaePF$y}!x`#y}vr1_u)?c%o9IC?Zf(Ffye_@Sq|OGUm%XTT7t
zw8Kd7X-)U07$m}yDTU6EDxj?~r%OQtTdBvP9UGn>aJUCfWNh9F+nJa?hZd~*rJ(Ui
zxoH)!xA%(z&Vb8?jG|Ut|4a>C`XUer*=+MLdTbl6*V973%qx|K9TF?>bQsW|x_3YG
z%m&O~GdswqoVNUruq!zZ7zTkY0XjhaHx}a<R+Go30Y<WABVZ2}0rMGAby&X67N;_y
z<CT5-7wLkY{x53(H-Zjc*`Dr(&+dZ0%221k-6p&neg=FxC%oRHvei@6(bI(S%yVhI
z#E1&c@VZXW6Aeq6F)L%I%E<SV)zqb=Q}hi_8sDe8(boAg0dN!^voW4A85a=<_CPiU
zkAR#V0p~B-Z4Wf&<huamY+W4c0ztlPXgZg0f#HImOYdX0s^_B38W$L~s{&smE8uaY
zGyp^a%C9P^NF|V;)H?fT2{?~&MNqE@X~S@61f0m#rLh!ZED?;frgJErX@Kr9<5PvQ
z>=rD(f|djjzaoe<5LA>u1iy&rT}<p#<-KHS!Z!h%&5vA{_rG1=l;lI;d+3b4>$`rd
zd#m^G6yJ0}<JuWJ7Jzrs<d^vVQzQb|Grr-UrXQ%oQpJsCY=_X<4phg_S2^%5`Dws}
zX4q<j^HCN4a|JYxCGcxP)80U@f?ew-ub{UE$B4#VIzr43q5Z5uZ1d;PC3gEfCC%bn
zf+cF6G9?}Knbqp}ulo0@2ut}M;!<bm71W%{5-t>c1t7e3%PUP;Mz27*TCc;8W?kgt
z6Q@(%_*>Ha5OyuN4udf4N<ac3_rKUHqu6ND^DYq4v8E9Jz6w-27!H0b(~vw{v~ne=
zo=H!dj13^S+iq4AAfLiIaH^Ta`<m(IM0{q9PNNOvl|Fw*GhLxWynIaIR|N}rwN;&R
z8I;ddsvc?tQ(N_!A&AfP!2;){Tvn3yV<TWBZe|y$caWZwKXxKdg$mP^B}xPpwROD_
zR){g3B$s7>_jcIvX)N+*q<{wT0R51=`*YLMe(qryg>Sjjz8;s8RR0-XhJFOQ+*x53
z*H4s;fAk7^4Ss-?8jb;K0bIC%Cpr8JL(sy20A^jODs|*7^;7V3orXd7gm$?sTLak`
z?COqWv!(}*ZkrS;D!`c33hn(JSy}y!qZ1V{fE<k)nmyiqX)QVsCoXsfgxIG)Ud}O9
zg2zFRvvCb_r@<s`=)lx);MaXlHrNA7ERK1T)4y;~a%blW76H7=nnCO0!kwgEuAzXO
z^StjmxFa0oo-&xK*y^R?(FTY?4b6m=QF(2RULvTbafS!=fvjM#hgeNV_h^RE<cWz|
zIs@qOm!4Q302xN(IZ0V-72t7b5Iy>31W9sBL`8B(Y5J|8h9;{sI;|zvu;Uj0sqjbG
zxn)5J!Z3786eubC-`I%S#IMc<I6hFINp8;wT|F`})cH&(NULEVP>7~Gq`ZzMo_XC~
z5+BYPXSE*_9w|I?uKGD}%^s$vtBA(L>0?_eMo_NHnhdSxA$)WFUATI+y9rJ|d?>bC
zx_sav*>ehdVv~5R>(i`9;32z(a)MwZmg7{e-=<J!510Q{@-gW1nRQ7Ql4+bxNUpzJ
z>lD2HB$BX5%Z-n@WTs#KX;@lc!;k?nWW>Dn*605aUV65$KKn?)(zYqO;QP;AsPNM^
zUA1ecV%8tKZZW`8Wm{FiNTyO8VY;rEEKbQaof5PqFE?%huf7HX?k({Ocfh|VCTv9i
z^C~`wdvTr67q=g4)XOGxuo+I&*yA#NN3gQ?1ek2vbI9PVEl||$4)7IgKrNmPw)csr
z)C(`9WH;lJG<%cGXN1y$hwMpnOj4kw6w6q|Yo$XPsn*=c7v`co7w%JgnDrGbB|!2I
z7YCNIX{wm@ei%@>VN*X{=wu53b?peM{7k1`o@gmM_5FHEL#~Q6eVu(oMi)+^s7}d2
zu(Osu1@E&-BwETk>e5fp3mLFbd!WRnot3|y4bf$O6Jl$2oh+_rQof7pQ1&D2%B~}b
zVNgq!4_PWL-DkWTgMPv^pf{&&0fGxZjfAfCS)X9pwzbTAldO6EY~+QGYX^A<$d~;p
z7`16d%Gd%GV(O1Nyx2J+hh$kb^fvuA8Q6{ljFVW9w?JPnH^K3)>2&-En3Cu2`U<#2
zHs^`@PWPV)chh?=$r^_$^?>~jl3}E7whLK<NtWlz?N6$GKsdcPBv(i$k~puyyybI<
z)A&=;pR_wF_@e5*Y5$j9*qVOTK5;^Ufkl3u!bOEeY@5yUxEPrAH@(p=hG%K0&~KWa
z*-1Ip&jGvkykP<7;Lxr}<a3abzc$&Ld6fa@<ghMD&`*n|uK~e^-IL97rg3^yqPo$5
zk0+ebk0dl_X-#AS`kk#_s5b*<Ftod8(C;ifm{<zC+C!tty&_20tmJ8UPfozPR6Rw5
z`Ygv-^io_1TH0FO8;ujNS+W%e=KFohp~+}8xd(D$M_Eg{Mm9FVahe1te>kgRYo4;X
z3eq*J=!*k3)?F(~qtW5M&*D$dhw#;({9nNuTZ%ysmrck)4~K=7fo%3>Oz`-SUb;f3
zrR5@$hw-$WP2a+xaLbFuDkB%%Wp5V-Kgj&N)Sq9%&L{~&5Qd>wf)+}+|HXDuNcgH3
zU>p&FHhI~1+^Qv+76MU;gB%yS<ke&CuQ?Y(q7qk8iqZ8ct<A!%TRs9yKX2c4yI<>I
zxuKVmkHGypa8xRT;1OFwvh*kqnQ6kVo|&;#(|W4Mgb6Nng)t8=!m{Vtw-D(}Ih~Kr
zzaRBjF2aM|UnAe*iCeHmUr8^>5a;Z@h3=UgPW_ta%wQNhhp?a$k>QZGVvN($Htb3v
zb}<gDQFmqj@eI<RRdaFKk2U}4?x%}Nu(N5weXbr!=Thg5k2k5^TF?$Vky{UbF1-uD
zSQ~GI<u0gt<0H&GQ4ng@boo|iy;>!?HWz+{b_q2*0vw^{`e3-sT_ImoXT<scK>V?;
zo#w8hbjj%lom`feBYlsjTNC?-^eVp)!Oq`XqfSPkAaZsmBMYWTn#d(4aH`MTKos}?
zq$62DANgELeb%<L;fc?!jEefWW8-vd9yj+S4!lpwI!B~_aQM8a=#qYUTp*itvlH;F
zG^GmGLeMPoumd!uZ1TwQ*u2<;oq4t+8mo}w0Miz00&+o@e8X>q<$^BiV3P9xEIjjR
zXe>e6R5v|lqZj<6dWXiccq5EwRjrPD;z!sOWl0Ewuq)XXN_w?D{SFQge+CaA&#J{j
zLh_14L+XD$F{{Lvk_DY_Y84QIhbg}NwLv-QA*c58BA)&qjBw)2;0(Ia-vYT6spa?y
zP<oh=^nPE@IT{ipQor$g16Qvf4Gz*!`owXvodIOEl`RO<KsE^`**Kfdy6=;l63k9G
z{66(W|8crVQ`=;K3X@xa3r>buMoQ_+A}TwIhR4&bAXvYtv7`^MQ`qTXkeYi)?pVDB
z4RV&o57APo?NiF47P0zWsg)chcZ91@Vi)|mdY?~dadVM$C4Y`a#kDi~RRl=m4VuH;
zBBej={sS#wh5%{&Gghq#gOZloTOuMb8t<=7sgFU+GR&vm`l4``8YD{c<C9>gF+jhm
z0;2JpD4-H}D#-Xdw*G?*h{n$u>#7I_<5;}5L>mM~;}i&+rIDax);+widy(Tb-dWl;
zoAs4{{fnuT)2{;g98UI&9N;=vP1#|#{9pt|<28BCFL*(l70s=q(*Lgmqq*G}qZ;rC
zixJG)MlOtUxknbAXD{JNyftux(bF)qgQVSTOttU+UD$&S$wurNq^Vpl^{vUnw}PFH
z#EJaivRm6%*aJ3Xr$XmNOPXGS4}@u^3LQZ3P}U4F#DBuh?Mi|W1fnVVM94p}Ra>k4
z*_r^xV>{h|P+b090U00b6diRUs-pk+Go66^XMD#|z^(B_x^>kD#T5_GF<*V|S|Lff
zk2~l9?GjivIk-aT5<};`oZ<@0l|5nsv5o723+{zl?RZ5dP|<}>>^nPZn)PQ72}PRR
zwWa4wnwrT2`bc)4h0-&|-5+Kyzf14<eZ-GvV8`KeyR?>QWrr+PxsONI0MYyOk|_EO
zJ?p^z(dP~n9#a{BN`{%<!z~*k0KJ;2yeE^$GYmGrb_Ag9_CDlYdXn~)<(V0<q4at#
zg?Y`d*S7Jg&Va--qb0)zT$VgNknM51Z}Mt<J@$PrFq%&1pW4j!i1gOu0%SG=PbWZw
z;p2rrFDXbla;Yt>)C(Ydto0n?igdyl{1u%Aj==zQpsi|LiuQ7U&Ga#VO=@O%h!O?I
zFdc_}mk>Ute!)(@60&IRvL-KeLC{$TmVM)BD&bNxV2DI#UC7=;<3X*z+UkR#GY(>&
zu8orfzY#%V0lbm9lTJUs1K3tGStX0qh(zazrs%9|B;8OH3HNL7oQGH;w^~xCrdKfH
zgqZuwnJjQE5(@UxeCW&L>}$rbuIm3@CjJOJqicsj7>2F{HV|w7#a<!U%9q{%<&>l)
zu_a%<D-d=TL?pC?LE5PW^u4V5`Zbf>Uqi}`zZHf??4wt^C-{`}S&?P-$aXlW&N!#J
zJv~OhFVL1WD5D$GzBuQ%JeV_}pD;*yW^2ss>5pioFyWuSC4*?}VW=Z|=iupby^G1|
zGVTJ2s@<^tfL@`@;-h^!>gy@=vFmASTzzJoDPl5OXB#xm$zvM5%;Hv8a@&&UWMw$@
zy{J4xZ>{XX0orTe`gF0Xuvd->?nbUx*4ENyD_9lSNLa-=nR^N7O&9sFs<2nN?#~md
zxa`aH9y}N5U=mGKHu*j><QOuj(7<d`Wg?1kY7rksz&(AK)d$}Cmvj*z^_hJZulhBG
zGjw8wv}waWXi_gqSfmg0NG<a7!I31A^A;thsY_#Ab!N-{{UN2{VrpN#N?yY&&YV$!
zD884c^nB)UWgi$<ojK83$$#0oh+dmmQ>t9ZVVZ4B>tw3iQ*-&_k&H1U=WKBDb-(zm
z`v!hcTY3|NE~#l`AdW;gFYO|LGkX~ES>Ouj8~&_g2H=F-*K_I&3MBJm=q3l8)}D$b
zI(|+DD2J>hK+M^TDZMgTpG-{Cp*-*c<=P)%=XNYH2*c2hcEH#M_utqqnILh0bPGr(
z4+4&nj{Z#X1FW{uWCOF#=FGPC(OniNs&yj_LpC{zyEAoKcYa)&FYZFCILnP(&x=Oh
z3r$q-dO$if;uBg_<}*El4%wq9=j<4c$<2!Elw0XDz)G`>uKHOEd1a}kgXI^Tw44G;
znsIDMS5q;LCLxmg)v!Ie;pju(1@(`^uY`BQlPuSj_ysyk3RBvg>~d(GRb5sZV+3EH
zfiqZ>|MwLrA=AcUf?i@!d)FT~_h@=JR?D)t6n{ES@?{1k6+v;#Q8R3Nm|iG?IG+QI
z+s9j=<u#{7YF3agg+#{<2RhJ?$5pHE;bJ!vPT$+R+}cihbbSWqe^fAuWxXyKdvcTX
zt0d3|A@R@aBTUEiEE^D<<!BJy%}C0W<nh@UP1FV*EP<ec-`63ZLUyMAb|O0(UC2XQ
z7K*ep_p5!0fApuUmjgPXezdlN$(W7A-WK{AoR-NVDgu-2CT{4$BPqze_|KORU`{>9
zW-^A4W@;}QyV7+9Nf%8I#%(!RlI^qp84c^&{YBW;(HQm3rPOtJ-n0rL{{1MUx3x^}
zY!m}&W==eXFJb3)B{2-b(3T8-LH~{Il8GgMDGhKYP6o_N*AM=~OZH2r=p@q2##;74
zWqGL^ei%Rra;zTQG<;=2{TacNuafN<pM*L_dzX<O3-aPZy)z$-677uVc<tLu5$oK%
zLv|x*3J&t&3~3ACe~jKSQDL3Pua7aM+{m!~lGopMWo51-)ux({y?@JxjlMyQXj2~~
z<;2&KgY=484!EW3`d_q5{m!`-mdC<>cB_;8;8K?v_?YuhM&l`A$zwR}nbHlP@bYn_
znJVOe_}IW5vKbrkzoNst1MH!ng1fH}KPg=7paiuZNXQ_geQnSV`cWyUX7Z5Dg$(Y#
z9(qTWip(zya^@^!6TV?Y`z)>tgf0CWaEaVLxqrJCH1dCl4`Crm!ke6K?vvmP?H#gl
zOo-Kv(<tjTekPm0nTXj9c%uI=<4C4Guqu6xO)3OHaiV73IN0%92@w`9L{bvbz6UB-
zzCJAAi|l^2kDYg);j-<SIVq@!px=!IlBqWiGEo(0pfJEr%VWDfM&vY`yakUSM5QhL
z1OYZB;OaGgW`nZ9+QlZnMzaevH2|mF(mSozu(DvmE{%iOT7%c2EilV&{Q^ZD-!lLB
zy0T;kLJ)YP6rwEN|6(shZQfU3fQlK%5qc{qE@%aCAPvo7eX||^gAb;Hb`g*u4e9FD
zC>ja~o2$DBL<<8ZrT=$B&9^7707uApmTNy6#*;A1$(SYu+DtqbDum=yjJnZG!-Evx
zn{*~@P9^Umyb{P5htcJtG&SSM0r*s4=vW|@@n;E=&&n(1uCL3BF|MZ)i~fcIl23+U
z5E*(?4a+f0_>SyQ8j-*lQB7cFJ%f?FT?W3{3qB3scRO0sm302)GH^m3AE$fFTR_C3
zLAP|vXx8rZj5TL=Mttx;vMp3*;trVBL7z^=yWa{pAxCtB>dkIWszy3qLQlI38)?6A
zSE)UzkBmzjo;mWQiw6O<=eZ1$0vkbk+k23yi6w*yUBbg?_UFV$JYk!_CQInG#pQuC
zyX=s_7!wsJ)5Pf_w8!FUU=-*J3HXh{_<nvMjeVZ<w<d18#UCL|zU*=_nrehH!2Vli
zz&DOn4XI$SpBN*6mg)0$pLX5<Nd@#YV|Pj?T**s}E>7PFg=issXltl%uy=Ju&W~6H
zFE^}Jit5oy%izbnA^;@SI?Xwus2`iIVK%K|8(?sFN}fvteXE~}Mk@!gW1jFNDjM48
z0Xwxd1I@J(1R<AsT~D?D2)nW@$zc$7qkdo(oBLm^<LZ>;j~RS`;#C}nO+x(B0{6#F
z;<xFF5f&SLm@v#O)D%71Z$SMtFHaFv4ko>17)K|h&pM2PkUEMwS%##cWe=u&ff{*2
z-E_h%lk2XeKLjZ74X6k{7Yha+&!CqV0SCD<h_Zagz&{dv-R~U)NG@2~o!EgnAPsFD
zgDbCsQc@fg?fMzf{{^Oxkz7u`PASEX+nmA~8mmJ8?{BE+74ot66dl2O8r2=tk377h
zy-SYzdW|AhC0zMh7w6^xu}c<0-BVseYfR&Ekf^U+=VHqzlgll=b<qyoaDBTa`=hiR
zbn@1}3iQNPC+Gx;4NaSS(^oVh>{I|r7uFIc{bdNcN97LVN=0E=)(3n-H1k+G3xsBK
z0s30vfM@_3?$jG8$Gl_=LFZ^hHxx=``jU<s3rHTJg6)(f*w9^jl?c$}!D^m)oI%UH
zO9>P+Zj{a&8H-yTv%QQ#RjC;0!`e~~w)G(<ib$7Yba<_o+&%0K{QtK=owHHYhR7l^
zA(!ugI%g9@+`hRw7_N)9gPD>X>O!~YGiV13dU=`LM>8p$r;ri)a1k2=zl5FHwZt$8
zLt6qbEd4k39+?>VXEY7?Byqd|(#6CUbipXlgdvVdI+M2HU4|%Q_SRN<N*)Vclrx1+
ze<dD)d*e)wgC;Ljt-g+)cTw7piHI|TFSx)}w*x!O*M#K-dhLiV1D#HjYD-LxgC;<b
z9#!+|HDSSbS9GKqSIyG4p#vT@<eQ*E^MCaBIR#QkNwl3#g+r99AjN7ssLS}vFVQg2
z?33qsG8O<BZXOSzLW30Q)0Ob*e@t&Zu+Mm8i}h!>c$)me0mPYfWd0~126{vd{sw3q
zw_!KX6UnH()&nv^OMJZ9JEaPlef9fH@b?iyPyio@t@lDF7vVcY^kEGPc>O?Oz{K)s
zC^{MbS-(fQ2b1ClenLjT?Q!~bb@Ps8#^Q(V)sIGYe}@olxR-3B{{!qZnXv%(dR0ON
zN%Kj6Ncd;&3#cD^UztF8vIvATTM&Y(gJV6Fr&>;RrmV89wU5&%s^k!A{2dxmv0Is3
zr8aP17IkBpWQ)%9#>_T_s03ephdt$)0#9GUH-SQ1?Z*h6eDubv7HDI(>6Nw}Gsy`#
zECM2YhRVSu{gB!G=9v(Q`veMUEgnl;)tNuSt}IJ}5QJSx5Lxbjv1z+X;?JZnz^g@3
zLP)|cCO{t(F?nHG-7YMTt3NXlA^4s^e@5Ic1l2$+DSk|#L9@D~+RYkm1U1a~uYjgh
zMBjY;s_?5AYwc6McaEH~{PHGW@O!1#H@OUHuBii<-tKJ2xBxCgA=?L?wugH4Mo5aa
z$bh9`!n3Oihkj6z`v=B2XwA6(MGEx2k_K21P|U<~fZu@`O%5_(k#y+E&(QK!Q7rxp
zJ%*jO;1+OfaUP4Dq7m{$(0q@p-SHiPK}(*e<#cFv<$(UmFmy*Adzt?u2rwU580#24
zcWb=GBO+j=&d$?*Ohh&ZkvfICh{8Ab717xkzn$C5d}l#O1kAi@wBJ>>{^1u3=5JxR
zIe;XsZQ-VG<{}Z+)#I6nusVWK0U8(SEI9|})2s!g=MP0Bm&=q!ApF-1=e^C9uZHf?
z<k2(wI+<W!W&HRIg&J3(sZ?NPc+l&(XxG_rUDzn*1Pk%UzS1V1MUH+3DeL0Q%jv#?
zEzNXPMpfFdx=<+|7ln9=2bO~?ko}~2T0zYXyIx{7XDg{V{3pWYLkvCg!<X9F7uDNv
z(QA0&y?Xrdb!Ar)gdi{_5fBM&v)^`A%Ac(Ont46#NnHyjG+Z!^FHdkf+iqYNEer6@
z_&r<t<K&~D#nz|%qg(L*5mvc9YB*(sJHjR>{9i%Q_!;p`?0L64?@9L>Se;GlPd-qV
zOTW@wna!9uv&v`rM@v}o3DWteKr)TF7XQw@-3s5z$v*|uG#hOExgBmh`8wZk(94x*
zEs>xhF0RTb?W#0-oED%o+bZyI0B`pxzjco$XbeFz&1@m4aLAO)_AL17qL6o8Q}mT&
zk#Z|c=P<Ou>nuZ&1U%5q40;k305#UKn$jENKVv#*KUE%}W<qROLcc|EHae}KrfKs5
za06y#V^G9ROab6pc{}OMf_fU&$$b@IRFR-4S3sox@#pD?w1?;e05&@W-NWfMRct(=
zRTWksdDK<QyqU90#E=4_qekQwGVTfzoxjC=awA~PIkMX8GKIed)C&Sj%Imk$mz5uT
z+~JiQQIAiXb*C_DVmQPFYU-%mi31xhfsOIO<o)qSEsK7UbF=c*fT7KK@rQO+O+YPX
zuP&^Lzd{`$aZ_K-Y^jq^P=|x<*nW`5QTuJ{QiqP=e49Wd%}AVLtv}?uR9>OHa@9a^
z&UW>;zl2>`mct+nyHN+T*yjEho45^9zLX2}LBnFKtxOP`UJD6M!^364;9p&@3w>Qu
zO4A!>5glC2(7ZJxQWHT#^*GJ>GBfY`IY6XlM?=`>UJJPuSLLI}zzXsp;UxiScL(iy
zlGxD2Jdv7lK#IydjUyr%_f`?Vz_f*qG?+Q=0?_(PK%|><LGFPsu|bL`$g9b3>13Uu
zHD07~1~sMb;+X@;-cGc~vhh{4LeB!?E_<+aX42Dg<;(v7LH1Q&fJ$k8>wv$WVY+Y$
z+}M3g%%U~68}`<FJ3!4{))~|UdDr;(%Mh?4&3VQjzqL{5Zr39KRP!rvj`oz~;5l^X
zC>|vwQ>A}tJ~t`hWe9xI%tR&KjCSHvS^~KRTjP_Nr;gL5_Nd-fv^rbhhg4$ZF~TnQ
zUVT{wT9K3immcJ9X7;QWoU9;Ya~3^mX}%^IsrpevHO<(}HarkPQ7d#~+LHcKi#@y;
zEr^=w(kU4vH!05Qr|_vU$f!%Vq{0295zY0u2(Bl|;In)PV0pR(Ao*`ljXb8Gfi!f!
zyUHE7mzeAB)x+&<Qv?!-M_iwu4S@KC;0u*DFpZHB!}NWZSdr0)GWce;VSeod|NaR(
z7vqLu7>2GyQnEzuzgVp}0@S+}9w5B<NAdgczXdV^I&WlTp;gjN2VjLD(ms`ky-f3~
z^`<Qx!;n;5m^CSU;qt@eGEFA;c@D%tGZ_Msc}DlN$a!qF_)E>E(9DiO#OX9@6+E0C
zVS)RG!y4x~FN!P5x3LZ>Vu)q!cD&m<r}RT$f_+qT`=l04<;#n3XwgiBP6qn&!oldr
z064(7_IUD2VfcHgN<G5h9CQDJH4zX;a@%AK8|H^spqyamLeY@?z7cjvzXmfhCs9*>
z4M8QEJ3k8u@%8T+F<0$C#?fKOuX76(T*p}M0?U^i6b~-acx$NF*sdpkmeUk4ZG>SN
zJ9$R5#AwDN)g*q8geHxeWeKQfF0{)fEx<R9BcT}=2c&z2z6PAuzJWgLBJ4mCy;vaa
z41>Lkeq&D8D9_p;?(F%FzJH;0SjbPJDlCvyVccP{(EuojOLkzxiBIvtY5Cqj9?2<#
zw{Y;p_ZZ<qY|Vm!r$H(Vuy5FkP|LZiHTT8oT5cS2G^1lfE`i+ebyKy4NgZKh?3ROs
zSM8k~`AnZ2Bdj81A>``pZ2_|tZjSW!_GxW<$X<U(@;`)KTeia>2;33^LfrqxZf%ko
zf9`YxoW?2&%;SyVsApnO*C>-CmfN>oL>QEm<V63nYStsEBltlf1`Mzq0YZa)+-d(|
zlz&D~{EJVPQyzC<D^^mD=d#1@OQ%?>owbuS&{hZYwe&~OtSg)!5sQ{(A>SPC?D<3x
zCj$fDFUVEz2K0Q^$^*5JpD?8CaXE=J9YNKPd6-+ua>fG*GHijq(T6sCOnp(Del#Rf
zdks_qmq~1fb4W9063U2{_(r_y^b~kMCNBNG8ya-*Y6*<+IP~`n)rcQ9#ula5flQh%
z!p&dZ<E=@g`*$8iGB>u<XZgoLRn*JCC*&(Ov6XCIHSv7C%S8l^4HxIw^O>aYKF;;y
zpP*btH&J{G=0u*dqwZ<!wsagihKSH63v7QzG~1Qj28ez(o|<f{CH%-v32N5}!klZp
z{^DC6R2BnH#k0hvzhR*XSm@FNT&LvO=X#-H2DxFGmtM%pK@$N52L!K8zd=tf4c)SC
zD~IP`>rSjE66EwEBH=~Z?CMybN>XWhl4m$^s(t-f1Ej~Xh_M+#h18oq_J4#4EMyF#
zQ=%8hJganGxF<A!gq>j)gD?n#uSC-p+WTK@Lu=wMJizwe)L9_O$0fGK(+pS&*UvWU
zOnH@;ank3*?l`NCHAqD=l-^oQwlsEJ8JU&?s}@_W{`^pwhXlZWRMW(!*11;*cGhi)
zj~b_7$UQe+np-gWFpjl|J=q3U(d(m<e-xUGG4WwC0sz;^M-^Yd=t5tzIJXAsRDIVk
zcx7q0A0Ue@iKZV44_w@oDSF?X2RW($$`CYMY^jg}zV@IgBfP$siqhN?>=EI)J?`QW
zmQRzvraj@x(txdie;g97(^~kyn+$Pe(_No)K1EehD*=Tk!mPd%E`QAwu&p;)Q@nJo
zL9Dag2UVu_EE#RN!M8plT<L{PDih-L*M7}X>mMN)<U{FCzjQk<x1=kyx^xTW3{4Ta
zdwOuFOkR#)5o~9`v}A_tz!~hWgR2Ny#eEAW8JrU2FsdXpAYPn`7f2EG+}DXuNS^Vr
zrGdvOqObW=>5V}!X(*~wzMV|YmRcx-^qFR}sfgY(V(wO7$Iu8>sElSxa@QggB+vZ+
z)~+e8l38nf+)5gJI{JIJrCe*Z01fS;S>$NvkJuc@Pp?ngC6o^)FGI%`N2jj+B+o2H
zVeH4)mEcGYgTOD@fI0sEu^o3h6w*kw^MNRByMrm}xY48s(MEIzE*Q_OfFx+=?qvw)
z7-qKiHM7xh3vd2lIi*_3h@#o!Fz7l+Hlp)q8CseRNxQz>m<P$_Pr!jR#4xWniSM2#
zNxl_mXA+~^Ite<e^BZI~1nDt!^+SQXsK>qwyv}wjN3UJ#V5jh6SIEOgcbq$$)~m)V
zP08r-{g=(_^T(z;f%#16av*2ft6;@jfr1|-1RT*GUHYH!-^ViZ?MC1;p|1y_ei$Bn
z9noHkjRa#GGGzXM!SRW1$?Qe{u2Ti4M@s?kF$1+2VjL+BCd2DY1fZ37Na(r;gS~<-
z#JvV|qm|NJ(hw?y(beZsO5j@8SIBigF8m!Zz?QwCe%<Y!e2i{|B9g`gByTk&5Eqx$
zD<Wy0E7!MJ*>1STd7)6uXlg^_7GLJvmHj34Wm1@(orN!hY=k6<DE|>~-%DU`;P{-c
zeFJ$yqT&vez@$cp%$K3SRFV$Quu*Zd==Do6q><xDzCF0WIdwI6g_b7LNA6kt6)8|m
zY5aJX+<JwZA2Y|`zhZnNp-ca{SATZ%A7NL58!-q2e^lWk98c@-Tfp{2tu*_9pg;`l
zj_0^+1o|nYLN+Ct0NeAe1wZ=aMp1JplLE!X0Vm5qEH}+D=_bI$`vL?hFC!c-Au$<1
zY&ryH>h%tvK4l$|Z8kx$PMxu>JD)=lD&$cNu<CR&8p+sAD+J_8i~Q51!>{?rcrj@~
z;#bb~9d-p;5qSP#Qz@ifihkS5Z7F+2gug>cyCms<8+P)jrp<z!bR89j;)zzAp88DL
zLgV~w(+Bc2O=hts74*67dGa{S0rGr3eqYfyeRi-SuV&=Y^o-lue=}$FZudqtdfggS
zG~;zDs99yL_DA?E>Myp`g}u)<h#eaj6PdjLas2d3AMHc@r-kqq(TwpwZDD(=^Lxq^
zq1<4L-Axc%iZ22*G)pjmBx&w<5*M{6BUCXqZ>1I(E2yaJxZd$)EO&d&Ww>24ixFf_
zUeD0bc+FydWlH^ao1oc1-4IE0vzUV6W5JW!h8N5EB;Y3AkxjW~W<!p>sp-LD2xvE8
zZ==U8rN>5*e#~gl93P^9TTV9Qc%>@RW$*&TU4TXpodtXir9>z57b6$K`Y34Ku+`+x
zL(}Eega0jU&jH$?<QhYBX85d(_-2US&_6fr4`JtmBQXfW&>O7)1EKf7*fxA@q}8Se
zC_)_uN@Dx{89{0@vfHK{f`p`$!onG<mg6YO$FGfZSpN861R^%a$pxJZ8UpB68eTAf
zmgBX-W^73Om}1)aMY1Bk8UQ=*w`^PfJDYBy2^uX)*=+RZm7b5*$~)`fdQ^kveG4j7
zKv5GdPPl?hG?u{in3+ayUl(ksLDOovkcL7ejUFnU(5m!a(#eyj?XK>ydWXj2dgOY^
z+!bOtK4#DrrX!8|!PNVSQJ?sy<o;+y{NrYW<g<^eJWh+oU779ZoZfSW&Nz#kb!a5M
zGUNeMuE+mGM<@}3JT%RUG?e22MEt%PpH%YDr1Q<;x~<*qD{$~_JcV*)dNQ&t9~@1Y
zeyDH&?vI1j8fOG;L9ibZh-(C0fXz~rjh{e(a7EatLciqU?PNP)$FpWXcSEBlt_ICG
zIs*3^?lNw6uR!>`sl^1I_U{#!Gsp;wj}VLIF-4tONkjpzjLKjH?T%Fy3J~MB(!BqF
z-pIo4ruO%V>X;6<PzV9z)@WU5B*NpS89V-ZwQ?m)uxwW!@N;2dBZ3ilk?9BU<QH7q
z_YilxKJoT!*J6a2K53u#!|U{+2^^;EJxc7KpQit`)p&2TU&5{^$zl+MT}een?tihB
zzLM~>^a2diR*DHEn8qE#S=f7*2E1@DrF9CBg8Z40MjJ1f#`s}cMTA4QuZ|8FBTjCP
zq#rpLS63$NmE?UBy}hPc{|7kfXU!B^_&|4GHmqAWZqKYq!-=W%6;hpbgfwlIDod~m
z-8=I7V3VFPYpBo`_9Zt$?eV$gWOpQu9JUEG-H+8ZKJhb9O?j-+-#*^YRY@|*;r)6K
z7;mU_JcnC1>l~EjNuj?t(8K!oP(v-`XJjazq=x6%@M)hK2tKJqCLnkyc&fI`^<zo=
z4D|PWTQ|^0bIFP_2Lt-p2P3R~;3mCR$$N?oA{E<`)dICPYVj8dhQ?Vw=AcG3$a<tg
z3^(i*qb1K+>bs8RLX}!lhGNtN7;lAI55X3I(O4hM!pqQj?;MM_-a9t~@@5}Ug`rBC
z^)wt!S$A!92WS+`O-nQ(6niVw?Vaj3VU$MLu-l3`_vd7noy+7B&E5&cT@$_2y_W4V
zLQgVbY{kP9(GN(uaWJWMW?0pH_Dv@)`Q`s^HVR8^q3j$4C7sPKi_6SAG)nzGOsRJl
za+5LwE!vYeQJVu$vdYJsz|h$qS$1v_w<^KxNq**!urs=L7zSbJN;Y7F_h0Ni+C=h~
zx<F2wIF3QmWx%f$&kT*nrCw9tNa!=vMmkN+h+>_o7XzpOwHb)26@ZCb$!<qnsI!ZG
z9FzG#*VdAtK68SGEw5p;L`d^pP@gd$SDKx0`MFYGf%;6)v6abLS6T8n9g`WuInX<E
zUvQJ=lx2Qg0!@;sR7po`xr~bjS!V`-U%TEnVA^i7e;1Qn0F))23>&0C>zrXwqB-w2
z-M;}2nf`4@-$|~?!S2@=YW!@|tK_R`q~_v2bO)|B4F!5l8hk$A#_!|$g30^y1()vy
zMVed}mVDc}T!ivjP^7`s*Tn-=`xvDcGwd>+af4d#De#kM(rcQmv$`ZhgDtl8wjWP|
zXsMZu`DILQ^+R6)=SX5tY5;?1+W!}ZSl0$osRxK0Smn3gTa4V4Sfs6y;9T<H6FwLh
zaCXk#W<{4~nv)Suiw{Lp$Nahej_dEOUrW*81wEN>AGO~|eFbzNJ)Ux)uV9ZSqk4!&
z>OT>biS}l3_vFyKxZ4ud5m$ufFgN?1K>rY(rrubn(WC?Ya$e}~>A|bA#0_dR6$_`g
zgHr#$rqR~BV1y=fLFM@)>`bmChhZ3+k|l!_mD)t##V#ArWzY%msTRxJ@NscQ(`}pO
z&!C#-0=o^Fk1}m^*TuHgArZ|r-|BGp-uvJgJl+&gon4B6H8g-8HWkMKI-4mX(paLy
zTi-K4kcwN@6%{uv7nZk)0tBgukkLFX5$8i6F%d%Iwz&>?j3Qj&BZ!wvpZ6{YlFA2<
zcL3G_Amm=jcLDUDdfg^K9e)NA=W5<$l7}B$LQ|Tgl&GN&&jR7t4|M<k5rUn_S?}w*
zA2Gbm)Nd|g0vvsxog(!=srcsz!#6__>WU9F<_pih*7)6RvF`~DX*R@U8Z}6Wh(CS`
z4QW2<jdF43UX9Qj{tPT?YHoE3$dK-i68ssYq!DI+Q+eCBw_OZ@gfyz{8lSy5tIF~v
zNys5-X?2bsoqY!HmI^6pFi-D_Tl_(Pze!1hkj>M5vaP&15Rx^`P4e;YZZSVZ_$e}S
z9)fmWE>$J%gl$A3iQY?X<qldHS3{lrw;;=|kcDxrP37%ZWnv<PjBmA&dcC((4=#Nt
z6C$0(A$!ewg$vb7vG#6AfdR+}YX)92!Y7gU5oC!imgV9jwf*1{DF@=xn<}o&1Q0)j
zT?>xIAPBq?A_(07V!O1;n7o8ufLOIEFrVlj(MAyZr^*CO>`E>BD<3jvaui;Z6NO*u
z#X~g#N);fG)D6~!S)e{Z?MAvhkZBscTDhMDXo)lAU01DRUc&uOfXvy;LED+>+;~{d
zf3@9=V9}^XSs<VO1V7C9_Lc#OMg*o~C3?)V*(^<jDnP11Xl<_j5Kq?Q`dCRIAl>1p
z7*@qMnl1cLyl7oa9=}Q1NXMP_h~Ir0S!e)f``u4!8;L+`zhd`k()XqC)szjdB5X#l
zt{}TllVezWEgs_as0gOge}$Yeu<aZFv0{|!4a~MIFRnP;MqGr=O3;^nM5yD@g#a~T
zt_abq<_TytLO|3SDc-R2V<O?vK44v@B|wu9;l3j6a5S7;#Wyca^_fEF?HB?=kjiD9
zJ0l>8K3nq)2@tz9O1fDtomuZa;3RNi7fOc{EOs@U`W!hXoE<NDtA+C2>m}br5YW@$
z%&11U@^b$b;2Mg<+fm_#*8@}})}`_l^%g%)%EP``^#ZLkn@7>e3)K3b4v_W_>2MIC
zPeJ)eF}*{O@iC9^TaZ!s5Ib%OiSOv?K#D#MV6my!wUg{@!BXX?e}r9&jm01gTZse=
zbpOTfLLo-Fle+-o(Z0|){`|j!o$_L%WO=a+JNWIZ%Fui8<SSK6#?vu*SP}Mm2k9kl
zZ8O)Fm-t|Gn9DaBg(b4kjT|Wl|9uiu!X4OinnmxKsh32$;KU$JQpK_7G%Jd*G0nwx
zf4V%q<);TuCQZP8Ei-9GJxzA3Q1m%uCe2Gt+2P=J8vQV-ocbIxljh~fzAHSZ#f@(%
z4T@tAY8Lv*1y0ueG6s@h1uXeK^Py2~J9PII=+@){v=i@i{CJKDPE_nEr*^P<g+{Qm
z8(^8&FQhdhSEN$H?P?7rt`DPGu2sJjBy<d(`em@r$kT_YdiPFCbNT%Qnw|NeODz0J
ziJa?<br>gymE+HTOy6R7**;caZWo4K%7NTNt8)H{%k8Yu;}xCC0fU4J;G7&f&B{6>
z)Y>C~BRIvcY3teIcE}m-m{V`zvfry$XOvs8uPso#&}nht>Dm$YM*2xyQkrRlhD1Hf
z6Z~Tjgduy+OW&~-a&I)VEG|^j)J%^JKpiP+`XHdelP(T(-ukvx=@x={*`8rfYU227
zD&&Cuw_3~yT^#nPrY$g)l=r@S{RIK(A5pWhLD|&*h%-!PYYB1q--G-i?A)#-24NW5
z61EYK{u|qY1c{$@8t@4TV~<}~w*@Dk%3OPXCq>-a_4%iGdo}yB8&BcUX`$w;rwH-^
zYKRBkO>251FS;POz|e+(X+gs1(uS$|o8*<$I?PJ_A${)g@eEy;x|n!p#ujeL`OSzS
z5cXtoeO%OxI`bDfFUTpw)fl1est*q*O&UYd)H|v?y{G9Ju3inP8H=^ixg$37MhPmz
zcDrhDe(EMGQ=Vzf0Y{YPaLHcb)2Z5x=dyr!n>BUyDurJTVFbfleh3a%%n&&)ShQG}
zoSr`d=g-h8r~mz|9M(@=9GsP!jj3>XD2-glUZzYejAP-!L%tSDrDQ^D`F)!5vI5lq
z3@F<4+{HmRa&#uCP7$|V(@kFkOmk0QwCR3PB|U990ixzw=Y0|-f04{QKLx`!<|K0r
zrnKT&l1?lLq7qUAe#j~36nT0ErrMK)(Cu1<N2>WR6Jp%gn|r1%LwNpA5}ZL(O>_}I
znv`_M$JeBjECF$SE<}C#xKQ)rJqRSI+BEWoKd4({oR5unZuu0!(q=N$tr=(OaD`8k
zh2nY0yo6~&Vo|?e1&4L4|KBV5<Llg#ECxX!x+M@1*#E}nnnc=~kKTY)F}{H2^fLnd
zU)#oQuTH#%LwU*p+_Qy`(7;3Tw<+kaT;Mp%mE}Le^XIbRXXJtaO`^AU4nwrg!(8~%
ztcka*OpsQCQ+*u1G*;(9E*Gm|AN0!Su_GIAg~d){t}eY5N3A-*XJ8ZU)>nv*UJC~@
zf?o9Co4nCgtK!Hn4+Pt%fAj4p@5Junv@Az&&2N(@T5(qkZiHjzJ+4mJ2{qwq<{eu>
z%rCq^C#)erdrk1(j*j8{(v7B8WL>Jt6XMyUzUCuzw5{oiq-u2uFgT;r1MXen1Gau3
zjVjMTp=e`W_K~g37-vxz7alp#XQRah8^m(u(fCU=8^t$OdVn|ysJ*Yad6(y{`3dNJ
zy*0KnsDR58=3P_J)ojw4lMKEZ5@%#&!PF0!&iD2tBQ$Di!Cl8u(Kh3OP4*EPYFF9>
zI2#U$_eAo?FbU!i6b_C@_w4037Vzk+6j!zxUknA{D!LcTtDi2;?RmW9|1@sdxj4i!
zJlKaTjVbU*E9CkHD)MmH(##gI&9CY4lYDdamZM%{B~7ldxFGS#kCv}q^GDbj9Z3wr
zFtjC%ZGro5?2b)r@#Pe-%t9s!MAFlveDPAU9&z`NN2)cpVN|4}A_P<W*F=<p7~@j!
z#Hd=u=;u&d$fqpfb-_*cWP1N}3|e%N101*ZV5>7eCQ;{XU#yQ<da<Ba>#@b)<B`w@
z*-Rk#?td?&v)g5`V5JIrBoD4;nxNf#EN0c#i2gqmsC2p1Bz$hL9lQM^3&v{R9m8=6
z%w2WJ=o7(6vF6uC^qfwQ`8*5#{x7P0EaQ8|9*5~Za|DZ3DCiIH1yZXyfG@8zwnkF!
z&n#MI1X8P!!;J6}N=A<0=ce>_gveQJL;VMvuV3fP!dm?isnz^IXP)a28nq6yf6YLI
z^^D9|iAmiO))TEE#ktqmWzkh73>tkx9jvA?z4V@7)wyZE43<#s?F8j-p^?vf<2qio
z=Ij!X66OJMpyF~fJ}w2pka6WWl(^N=lS)CgW+?&bp~an;^J5u`E&c>w@@*?+xba?U
zfshQTD%|#X?H_j^AqB;n;m$H*U&X$#UWWxEHKR&de(B4Cw8w7WG??YE(7Y>t#|at|
zwU-Dmm7*2vJ|Cn>s>!W}iCH$Zr|l{OQmZ~*#T@+zesvu^Bm5C|WycbOFsvoOcmIv;
z<0WhPOWQyu3<=n>j*CRP^q(pA;~n~wl)<rm(s#d+q0V;`q{za+=gHK5o)Fw6$)T$$
z#4@i=c)YB(&9|b^;hug4v5^tU-2`3MQ05Fb=cP!xqy?M{(vkwJhzPhc^4`#8<jKW|
z!9W6paR$E&NIz=LHU6tkdlk9q$jGHX$uk&zGSW659|7`&=IQQ*{`3jf{_05iuPNY-
zpN%<1qK5n7Fyt85=qcz1vjWKU;j3sQ(z1Z!H3R>4uEkf;$7DqpaXxEdo*?TO*CblA
zFdH#uyoS>~RHTK8cD4R;(<a-IPLs9+szLC#w(vh&$3#1EM(S#1bn+pCYeN9+Koh^?
zj+UZLK5tqg9a*`8gSHLg%Wu;7)%Ng{K@o4*m(^wW!d06CHm(6+eJiXd-Zh-d(4!Eb
z4_!^-wyWLSaE|ef9I!Yt8Z{H!z~dMEoz&b&5?R2lD&XwRxqSXkYW}lI;g^rx)GICE
zR~2+Mdxe30k6`FfDzb8e-Mwm`kE+@DopE18M?TF00Jx4eH<W8R9QibQ4n~KKr2fQ=
z+#F>`Kfu}qIX{G5*^z}X4C`pexop#aV@n8;vL7o7cpk_LI9S(R!1XQQ8@tes8ixHj
zVIF-86lKFO>v@j%;qBwQY@k_p2!SWNCNPffLr#p`?Fh5Oc>xjQ`QzG;&}n>@L8Y7R
z1l-94*Pr-DG!4%iJsN&LG-KSEOyfXkrsK!9V4kE<ecspz&Ar}@k<!r*>{Ro%-02aJ
z^xTT=PB|;+E8sM|Qw@Wi=r0vc6aYYTzd}z%HZH)1?hcN<SV|`_k%RNgDj6>B2=1yu
zN%fKZwGg!b3xqKkaWGx{z=%wnI(h&x?48*Wwo|X3lp^^@M5S#8w?cOZ<hW2XQ2~A0
z>C{karHRUDdKJ*7EjukjgD+N-L`G*WjUCRGE!gBnNxh7RO=%?Qm=2E4M<SpHh-bD#
zSLZUYz(T)7fjmG@j2JEkR*j<fbD&YjBN5#;3x+1ynlv5r1T!}_g#Lt5Zc)$FLdXXq
z549mSW7L-<RIfJ{PZT&#jkNcyP;J`OcE}Esjb?yQgfGv{r3m+r5k=Bssuw75myOTj
z|1D1wQ2}2u;hYxL!ZFF^O;;c`lZ{-2%aX1i5}|T}Ghx(c4dYp1$;kdz_$BPRjx2^j
zU`rARF#R`ng9FR`>}x<{$+k!v{;hz-(HvGy3v?R!aSRY~PK>X2!y(F2gcni?A->O{
z{4VBX)Iq!voY0usI-^8@3&Ydjlp%8fYsCgsluABDb9#<&je}h7!-trXp*=fsw01JC
zu{n52p1inE;2=NE*>ktlyDS#t0Y9gJ3gqMZe!AUH`7Q!_*qUJU0E?NNPvbeXO05S2
zVRp6H|Br+0^f3eoozpb68bs4SGgkL{j>B&BAw0bo6zzBgRL|_=pH>oNFM98>$xONe
zB6jyL%ivGuctz+6I()Z!#N(Yb$P3CNE1Utg0=Q)%SkXpLEC@r&hS`$`E|+Ee96?@C
z9Y7~XNhroo0lmjI>#Y9(dB-}+cL9h`K;~dc1WLk-KLf1V<DHvUMyqd|rH+J~HO1}^
zQrnrZ3|%H)ke0@=yZM-U40Y+(XDJc@?J>j#<1iqJy|VEXaww)FcK045Ms@C|F+vv?
z6O4T@_e62+%kV)7bzY6#QQHu5k6f4$(L_4Ne8wQ^`0V@}KPP_?(BbR6p;WHWH&i~D
z2(W3QVQ)IHF<LAT@+$ubJEJ3pVGxF{1Q;8<|6(oI1o5Q~P%cS*7-R8tVldAPb4l5R
z_A*B1$py@_G+2SC?e2Mr{)qrcz<7(RHpp!}0IEnE&<oSfkSi#LC2&8Jqv^HURr)pf
zBN2K*x~@jxnPyiWzG)>JfS!qg#w^<pV1o4KG%!vheeYRI0G9&az;r=bpy?Gkys`U?
zEJCqk0dpFcffol6ap&fb06XH;3xY}X<U#z|vsdeK0gA5;CVR%rxo9mwKD!qY@)hmZ
zl$t1i2E*xYjJF30uw(RG60oO{M&i_*VP|QTKQDnj`(n5HO(Z;(EcYFVF-;RVCBt#P
z=9TzfgX@_WzFS|RmvmO|i{_^V4diwx?+!X99+$sFLhyyc;fD-(I#+u5e+lwgK3<nw
z;H#nqD&l$CAvz0C$I`8fm%PR!^ro#L==<b`Z|UJF4%0OHOmGwj&(G^f@-0I6hx9&a
zn^<Gg&pVqQmEfp0Bpf+1T6K2A4QA*3_k$4tX|cBvT%osU2QLQq?5=^j%GM(sE>#NL
z(5zOSm7c`A5BWo`lL!fqN4xNuwC<|&3eczM3|*ImsmgV#-ivpX#y*5yTb6|&4BHX~
zN?>cV`nf1H{fZ0Fqa2jBdHrfgR)EV9=ftYIj=fSE+fhS<)zgTG$D+GKc+`-d=E>n0
z`>P>M{~0`v>^k{PjQ|||-RI&40bj2q-{>K}*cw9p1WsZJb;L*v9q+oSagHGe$@Z4y
zX_}}6;xm`{w%359;G&%tKoQNFwAAkHOx1UfrV&ecvby)=K5`EH{e9|WYA~CoCzeqQ
zs?<LG^)gaM)5~O&K9i-+&_C#e(ezTO8zs`!wXZh_(zIm#Hs}{NP0rsy*E4SxFHsA?
zz<AS-;K}hdj)<Go*`CZ8dHtZFPWq^Ch}x$2m>iygAWaFl&fX;H!!fTCK*tCVzSlMX
zi2MdBt*AeiF)$hu?Kjif$ne(DE+9zLl5C?hs@)}Q3&zvf4L$G;*B#*a$>ETbeSk^C
zJ_GQZ*ST$na#+`Qh~4P0D0;kr&PG#CF+mAUZHSI&1!HZ~m8O0MN@zIoS(LwgBpZSl
z&1$PL8}amHI|KNm-e5XSxx>2${X5rNX&-CA-H5@E%CIckQ)XR3W05Bx!<vegI$ODh
zRL{)p?X+fPS1BzPFiGs`l_m|34cXs6Vb_-2FbD&$BoMJy_rF+6F<Sj}a{(q98<6*T
zAOdY!4KzJ2RRnAB>w1_}KL%)e4VIj*NtgmAr4)fh7g1|&FnT7Y)@KJZ&)C#%yJ@lZ
z^`k93!OSx+so8iVQ{S1#^a0Dvv+(TF!^&BO>(_yakPqnGMHAL&;Efzj&F~w+d??L1
zsN(-Cu$bo5C*KGd;*aV2(>Mncl%w@QM+>siqhGRip;EFo+(!G#37Z!yILp0JbI;5|
zy_Rknid+<{F?Dx3f{3{36>5511*vaE#hdDQ2o`x+=EDvRBk$;|D4O4gDK`ZzG;Bee
z-s(`alROf%;It9?)(X14bhKEZUdYupwwG~tU;c7i!sx=z;0%28rFPauNarrBE^Kdw
zbl3X3)1kC$0!GU#sj`!R@m7{X5}#l(P5%YB{XSdmGbFhITg)`d;2`hBoAS$_;Pi-A
z&toXC2R8JRr~}es1qb;>@GvCJ1Z#3LnnmLiwZa!f9IctAToc=cJ!=RK$U_>IyzUrG
z?#U_Gb=(F>(HsrmYnpw$fZUG`-o>cTYyUe@Za5~mGqo-nm!cVs0Nzy9Gntb0SwDoG
z*^vYx3`0`_n?vNE*bY67MD2$r0g9?V43?~CS4d@>k1A)yd%LYWj>Ny!$~;RBJzxj7
zfh%~E4U~B{P7vVdC|$9b_aCs*04njXIW$B4mGTb%6@G;&;ZgAjGwE@G@Asf8&F5yN
z&)(#cv7I+m;o39Q@i_*-C!)dDTtpGlMWJcgA#Rl&!$HUe2|1fbRtA=(Hxxizn&cEV
z6lh&Hns)g;=u(4`qEiQRkW2Zog2*%#5N)Y47oav<@gR|A$mPCH$&CGG*p4_ZFij8Y
zM4#uE+=7QKL6K)`N;Vv{A?|QRUo3(^;;&x)riD!~%()c*Q3T623Q@d~?^hLDgtn(2
zB%3~8#QL$9fK8tqb{rikVEg+*?vRMnl*fY!_gi4qE~Su8)9QN;-Ry?&U-l)@^g(E6
zoZ;I|pzzR6WD}O<s@jddis8k4B*_btK;eBM(_y;*IC~`jkh3iDaX_?SYc~D`g40x{
zx1{_|&u!BREJ)D}>6m){Z%c`3%kM$=?9{O2n$o(u&mTr((eCq_M<=p#U%BkaCz{NV
z<vPlCwv$`2##(5Erk$wOhn&#WfAf#BNyUcJ4O$8%_fLrbBkatMB!pognvySBQvQkU
zcn9>T`Dg-w!ca)I`ue?oVNQh|cCL~+HjUlJGW@Y7k$ec_EL}eVu?rg%-L@^(u=PuH
z$OJ(&p=XgQdP<-yR<V4d;wO%u5%Z3we~1O^jO)$sY4kYorTmTtfbDop_`@n+OR2&-
z*hpsxy1amabUCsK;F<C8tKH2?G^;lppffE=evO3zvuSN$0MB?(8}EJB(Vl2UTG&I)
zH4JhL^28U*-7q{VI+bla3IDFEiZOxgcl6gdp_zGMrV%gI)rwCMkD&3nT7^?D(~Z(<
z_n3FA^O>V|(yf<-He$1R%<8o5E=!+H_zV9qkkEYUN=?LDyZ)&DZ#N<jhPz6mZwK4(
zn}B%q#1bhB@R<=0Qb>(_PSex}Lu}6aqC9>xrmkk)r(Oj<XXy`-rI)S1e5vre1co+o
z@%fq&TnFUtdKHem4^i0~6JBrXBNawxp7^~rBa@}4Zgd!(&2scU1fA9a%XGi@hJP}m
z-A}36DDov#6$oi&(rlyN!@m4<#2p5mhF;|}NyjlM`whod%3!9%#fKP2-jaF|)v(i|
zY<TuYyS$sy;`|YIZpjhDAP~F~NJ4`9Uo25MrpXUJz^c4{3Byd!?+SPfjijU~w`8=9
zP%qgu2hG_Cay*WFT+0I^!V8QD)9l(GE06@Tz;VZnJch7#PUB@xlVO?HlS1^XwIXeI
zWVr!NdoA=i<Mf|(cxnD|&LkGRkB=1?)SQ#M{wUY7#|OGYsZh%WtYFTx&&qUXh@A--
zdUwyP<WC<A?aXP071w|`KJt%0vESf^=iL3B#{jsy`iMvO+_Y6dj%W}!(B4ZJX*BS>
z%4<n_W>x)#B-v1Dt3L_quh^@vJDAc)%xrY%dcOs3$EXFgI#U`O1=OFvpZz9*jYf|x
z)X`wHy_YX~OlAwSV1R~}h@rN819Enb6<?O*CSh~*$6!2Bs5r&Jw(QZDK9R4-l`x}g
zfOdK{t(w3Cy;->zrWnt|M+=lx8rx$7hnSNwQC|la8;z5NvPBEDxK-!`HX2<gW3yZh
z3gm9*w;{L|jJicdb2Jb;`W1@ej0Ceh4d;4TqFn&a8O|`#nRU<ZEAbG3DTl15K$@~v
z+qer!2BfB){<7SQ0CKf2hG0f>VG}=moePe{APhrqw1RvHzW>EmY)f2eB_Cjrrlk;w
z{oFvNqM)E$cI+^ELQZG!gyDnT)1^2@D{^b`qNKW*Kf)Q;53(oZqC|YPBkDw?NId~&
zYkbfYM|)dm_d!Z)8R(+PJ*fj7*7alRIvTSPKAV^Nj%=V)CG?;89%)!}Y{mfZko{lK
zMN{K0E{A|fna~<ipn{oXT=2eT5K(J7GZm8)vX}XI@RM)1P3xLL%Gs#VHSl9!xQWjC
zO?ChX@GkPlp=Yl$`b0ME(hmVm&8zC1CRBFHQl!+qfs`|RuEXm_5&PYA#0cc>74=%n
zSD!|p#Q-4XtZwetpT31BqQ@d6M)3cfwBsxzA1t-w0LBE6!5q1O2mL4d%eIzPtj&EQ
zrx{0()fcQi3+wg;4)kQszDwSwcRM4iBE1+gP7m?3(uffVw{J(&A^K3DvUS4_#x}Nd
zjob)ITy*9G{6lW0e`H4yr=-73XG#)g!~b~9w>Otqj9`}o)a|;1)6Ty2$&e)=*r5rd
zwd~59|IqY$x1)(BI2X2ayIeXj6i(e)keQds<!Ndl6P$2>Sd`!0(g{Bv`u7x7B!xzH
zik)A=&h0v45C)<xfdRqv-&pKytgHOYHlVX$mWSr`$}aks3I}(6LQnVW3i@RGec2&L
z`Zll32)NfUe`_5JfonFxxoPFb#ZBHXX26-IhF&y@lus~_UrNQ`EYs7T?ufF&(ef2|
z(YzrlpHaL8rhnjT(t+$mHH`F$>tF1}gn(vUZR7RZa|~0K{wDyM;6sE6_1Txd15dg=
zISCIxyG0Sb`lWzvb8+B4bb>vJQou7x!{hsWEsWS5w(}?OnU!8d*8^B%^VY3eRI3-D
zY;#hcq$!10uLy&)5A*fU;bAoP_vSw(5Y3rFoYy7+P1CAJL=??B?^EF6FHCmF>A&Sd
z^D2DAyBNj!h0{z0WZ1OSXHSob%VVBeyU3T}<i_d61l-TUDMF-N4ZV<?y%Ug@3UCY$
zv-Q%xw8{?!H1ScJu#vxE%*$8k><lntTHx^DO;Htjd%PzcZ>)iR%ty{^D&+Qf?`ZUa
zUuMjM{dz*Iq9|S=#%v{U>r*}jJ`;_G(HaYDSpO)D?Dm|J(U3tpTK=33)La7<`Z)~1
zn`9`8rxac2wh@&5e+vB&c5b;2!Y~lsQb^+1-v7pKDc}>Sy2Ed!B0wRr$Mg94KQQ=$
z<#qWY-FVlbD>f%vlP+XVufF;vZ#Mnd5*~nQs_Z;ptu8ygsE^pupS_fokg92Su*Bi4
zZF1eYtZWOLOEPVGHP(GuY}U91^^7T17m3H&74mf7Ls`0>BvSnlWOQ|0X*(%|7i=Uh
z0MKJwA5?*}-+8B8PRwPz^yA09KRo&B`jlfX)3#zE!6#fYv@#kmfjr1h*?<5?yWJ&Y
znVdNObz*y6Mnoh-nHH!UZH^kzwbb=L>Y3hGy~UPMYbmrramIv0FsPV}@V!HKK~YJs
z2|tVQnUjm552!%s>i9~;6SnsCxzJVHW^gtzILn1vS96mxf)j4`jbo2w*>x)yoYS3=
zG1fb$I8iUA1m>9mgSB9u@9%PR%LD73YN_3b5gMBHm}qC53}~yZ?Q=+V$)U}}aL>Ic
zEw=oz0a#P}<z?1#>`!K|wR2>=@a%iJ2l^Q2vu?4fRCvJ!kj_{dOgXC%pZU^{=03FE
z@+=QfaIKY1v@=#j;P&}E<^X%uJ3Q$#u^9{x$FBNH%l_{Q-u?(Xm)wS85Q=W4J18Gx
zK<aLy3?gNgSyx}bs^K!C!$=8{-^VuiaxQvjQXAu#qehWFEfP+^n=#x?iKtLeKDq{<
z08sXn0O8VPz|K3yLpmo?sO1a_ee&9Okx$h&C(zAQKqTD++hL9QIvV6jS<S9adqKi5
zrS>O6t=5uOtF;RVA*MPH!W;a&w$D~p8&^@C<_J{?KO3h))w%fFhv#g1_8bB2g`w5x
znX=mP|1?9MKLBr!;9%%wZRP(s_MQkhDBRLcTv3G1aSM7PG(;{0oB@)3toio}+6y|;
zR(U9%F|f^70nOKreLP3P0%!Rg!5UrzC@A78lf>S0gx%zB*aRn@NKG4`X-2y%qsg*3
znAhTK<J`bKooVnNf}llooSxu6!`k{?c~w5LQpZ6Ew77&Cwq;2%c>NQAAwzAV>}Z*F
zj$;r3(-dQ1KnGQAoFE11%<@_-lb~W4{aKx)5V;Zo4(B_!|Fv-R@uh_K%od!tMpH4k
ztnpb86dv14WgCcG8Cmj9V4JyXSubZvw5~jr=Q|Mqi+QsZRp3NNhLV$@4xTkXa-zu~
z)|8q$;ZR1y0Im*o5X74T;Op}W@VMPyf1hvn=kxXPdVJrnFaI!hHmMB*F%-T_PhdTb
ze`e9c6dK5?g%EuH#?hNMI1E*G-sl@i`6L^R$??D5I_iG8-@dMw@7wQBJMVGWK7D>X
znzGyRiPo`Ic08{hS?>P4I_<&%!~$Xgfe5n*OF}>pCZ-VtD11)BJ;FW0ON95+w<Nqo
zc!}`dflY*(5auAvYU3tIZIENn{0mtEvIJxef^s;&m>q<#5xz#a5;)>WKtkApu(c{+
zg6Ow6KdB8MH6WFciHM#>$!wyN)@<lm6hSg0tT|~arU)Z5ka=ko)7pSIAw83HI4Gyl
zPV0HBf@Fpo6}6&rR$;m#nWjchO`;N_Ogxj+XsJ<CQyxbsA(^U1S8Z*1_#})>@yu7F
zuvP~c7bX>s%32e@4ob?j$Mn+LHh}f*)`HH0;<xeZ!{?dyps#4VSj*TYy{F5V#zJ=m
z*G_cZ6+9CkbQV6qbm21fF`u)64@ydNSzcPpzQEsaEu95N5G)40BiZ<YzJiWmQ7N*d
zq?XWDENZKKE%LQJYW;Cu2DTByPzYVA4UpdLzgVRT^X1AXu3aD^_T!Pfp3JrUuHa=}
zuSwGChsCRVb4`vA%hnq#V$)%US>|@wIt=VtmI%fsJ&AdR8NufvNBt5pt;p^$yfVD9
zRS@PCh8}(hvO8?Z!@R=vLw1KLA6xlgVv*fpe9!C-8~8A@F!(U|qX9MSX<lLMksJ#2
zYS7cfBD<puhC+%O_`J?p@OVE7_9S@xC&wZ-Uu+7qN(I%xr_NbMN<GQFCmALECC4H*
zDo|9QR8UO?G_(9ToXR|=HJQ)-m3Shhy^?-Y>!aoS%*xEtMp=3sDXG~+=9RX|C`lPF
zHJ`}DGIOrXm!`+fC|W;THVQqXoFw&U%e>My;p7Ohck_u%EHk4Dvv+RiuDA2G!?yG|
za;%_f@#^|<RFJ{ATLEQSIV$)$*l$kE?FwNShM_A#lSt0~i}B+J4FQ!7Kn|9#B%j8Q
z{Tan89?N!I+CDFD2hX#xeQvg+WJM4=H`_`3K}7+a+2PxXAgEA++76u8;r6RYLTyJG
z5b=E=FKX0w5_~8N!kHcI=QGNJ;4)IXGm?Fgwq2KYVK$%WmwDx586}S#w9BK=i5+?5
zplxJT;Pcq~_-!2JVzxz*e#67;ALASwRpdBhpKKLMGTDf;A{9x0BpZX)@hjP=@}4WN
zzT#>?$t&mCe${_(zES40AQl@BXK7Fcq&@f2RufBM?KlfNctci;gykn}%o?TqFTrep
z?`dC6OohEg#(HHS?=>d$RE1&j4K{B_W)v`eOht-0v+!67P0D^$p=8c0yfP}1n8Z>Q
zhRqja=Yrcn41~}txtq$s{V&#P%V0HHi5$Qqync*7NQsMN!$6otNI_#(W_G)y46&y<
zqIDCQ*KOGL(UDUD8*DPMJKjM~1q>-{-qGuAI@YrB`E<VjE7^FMPSs&zHy);wLk^pF
zG|bvN+eME3Sl{f2S9=HX4nr)PcVuD_?=Z|V-eL2O++~ro60-|3z_C8NFGCA^5Z8m4
z`u@MZ-oA{_D7ZfUF86Oe+)C_1cs|Ik!TSEc%q+|-vS~1z2J7?xGPcNG%3L-Wa8)ya
zWpXiDmGMWks73(G*uwN9N)+~06M!|TSMEK^WnWn%y=t9-*Xv9>;P_B|olP!n03IbF
zPCd9Xx6BKo!oNa{D!G$@(LNe89{N>1H1QWr?s1~hD^=N@1dKV5D(zB-m`d-2U^KmS
z-{xq!|I4$~Fu63j93}TySE=ky2*&B$f1|G%?K+j-$-!uP>DH~IrII@#7)`E@lHajE
zoSgxR12GH(zZ7SC3I6}b4jPZl(o$XT0Ty1YIH4M7saWrlf#uK_UDA1|8|z+Tuq^jx
zZQbl%eCArt&2nybCrc{UyF_7m>5G(hj&_W7FKJkod$Trgb}!bsL}6LZ&F+M)`~2Ha
zqf*{YMX!VR!n3+`ta}N=vfP`sd9!=5&Ls`Ya&C4fQ!3WG1Y*h0Jg0h6T{_miWMb#i
z5AN;B<$GkTc`uO%?B3Ds{7A<dm|*Obhsr1ACFIco@PmPg2OD^FKi0y8W2ZW(o>Z5P
zwJ{0VDG!xT%8!r*U4oSC-MrQp^I9+STK}3CIKo(;=4A<-ATB%4lHgr2c^n)Wd$=yy
znO998bin}Ik~r~@pLM<j1Z+j$+Y>qDW_La-v~)b76=Y^iN?_18m{<^-h2Wrf#M<_F
z5Ybr(5Yp!9#pCfHqO%YnBtmG<ZpR*U^0N>nv;_xjaYFkKoY20ZaPiBj9o;w#!!Q`0
ziB=O`_h0OQ!2AUyIIz6|WavS%oAN^&>2nSzCuo8j>51YxYa>T!(i6rt(4ez9a*QU_
z5$tIC$?E6;g?T-v9iTvGcH}%wh@l1xT;=<qxS$8)>;+w3i#7ek^>n5t^A@dXhaYcI
zxX8hp%!hXQa``?eu7$%jL5NU0Yx;>>;c!h5qBZTX6j2b#37c$pcKLGoJ}C1!53~i3
z*wR_jS0;2GXABRTuSteG5*|5f)8adXl=>>)2gQLtVU8YXEKf~8ahx5u3CvT|4!3Hw
zJaXoy;%kJ+`YPWC#esJ2COA&{mapk2j<a(&6%2IR;g*jgM-JXp-121C{h9%a1AYGd
zL1gO-A$z`WM7I7VWF5h2jL_n>m^UyQA@!Z?!UYE%e$b9b+15yPKD&wBNDbTN&*piN
zAxC{=>dG*CNwGcvn~uOn%_w_CF*Z${-4BrROUWJJFbu*l0Q^$TQd0i^u}PC`BD&7(
z0~G`s=zQA!Ioiv*6Drb9g|}&y4VcU6NLK3!`~iWvlcjY6Hwm0JX#}%5gnl-gN3zn!
zv{VMy>Ude@X&U`~h3TA*^=TRlDYhkMLWgKyfV29br8{6s2jQLIyB@PPw(VR}=zP^f
zpGl{VQ7c5is1Bj;$Ws?FDUs~H&fLsWJmQH0IBBs77}tSmDr9g{+9bQ@=-SM>7j|tz
zg{o;2{LepdR7EOaIJN~T7}`noO`Y4fT_2d+O_Nu&RogasV00(N_FC7;Gd7HspcN|B
zw*?wTtjkm>+qJ(;V<i$CPT^9vb1}ZtU<#Nzx6ucN_VD=PB-GctU#aWCJ(fxN(Tv4l
zmPzds%*G6_PU>~5j-OOxjJE=06g+I<{jsoL6g<4|IUA!qoW~D^oZVL^9=p08^XA;#
zk`M@CAb2Gih3Ne+=7*IIF6!VOU@5XB!(%#L)phAdRqySDsw)k>*4s~2x9unC>8%yf
z_bDh{?#JBeI#CZwSFcU*9;g4oCT!t7(bopP2i`TMvRy7Z+u*yX^B5&wcDZP61FU*|
zuKfHpQ24H;>-V_EA93B5xW=it=y4lA<Fa*{CSR6&3gHC6`7sW7@I=71eHl!PZ$jYO
zx<_oR)Z;xOX7i7HrNhT$KDAKzxu~rw*cNhZLj}|4tL)1%pIA7XeYzg2e8S=G`$aCY
zxPZ9IKCbu{h?7X;RKX&k`8yVhlMrQgP@ZJq;=*!q61P2`WFX@LGA_a|SIY9J&RniE
z3}g2Q9KTUlBc_AuSU^r#ejsuIA{SBXWfKU`Z}1FK$1jGl>V@MssP&o-;$=xWrRDeJ
z<cx9{gkczZC5RA7?|-rFC(oVA<Zc(J+SrK-esIFdC2(27%B5x0g3M2pnm`?vv34f$
zy9Mg79iEIVs1`(iH?J>>*B8KQX`!qj^OIf*<$uttmO38~digT9pYwRoi`$%~=b|$|
z;d9HeJUkcI`Sn=0a2tOtQojib%)gG+eoiiz$S&3G*dX?!Jep#_g}G6mwsSHziaJjP
zvSWkbFNr2}n`0Sk!;25<b(v#3*wBJ~LGqXAUf57n((uBMPx@?<E4TTxAor78xe#a@
zauNJxE(qErm&FZ(<PYAEF4a)Av|*6@HEwtoQ$wVbB@Tn&ub3KwrGO68LWe=}2X)9)
z)ljv}VUYVFducn^c|-TMbJ1QxrX>9E{|;zB!yZ<*m)hNuhe7UF{M|v@>Gmp19|pl+
z(OyITIatWH7s($4A|P*RKW`CUl$?tVgFp;JSLzukx&0TbRO*+0<ubrUX)q}#za)gQ
zoDCq3>U2b$sAr77YCWSLFvN-&qHzA;5W#t8=M&|O?`I5g%uZ(`PSi8T-$c)lQw6D1
zm%M&re;e0XPmk+}iM#dpyiUFz+x7c4u)_yk9@vp>zYnCb`&T3yWy=quvAfp^piy{!
z&3b|t?Q9;Z$a>1AAD0}^>n5-B6$i)9$mp0{1@=~7d{kI|le@s)>f<&4qs+*dI$JyN
z*Y!u4-IWcFj!Dz$DvvB3*7neKFt7`Jv?4w#Oh5P#cT+XZofpht`58l1)7(qfCpNEQ
ze-Ho0OBZM*P!y1TKbdQkyQ#XF=ACMG{bUSPFx>?!SCK-MZ9hSw7K@{b)loHap||f~
zx1I>|oXz!>>lR4t8LV6O`~(ww9G8zjepKG+<E1`^Vr2+b<Wmuel`TJ+K^5uTPe0<s
zm(;f3aeUl3IinneVHk#9sd3QA?td|Uunl9ACl0X6>XJ5<pRCWp&)*BhF5OkljQ1gg
zin5;Aqq}OE%~h78VvYzZ=>0*=%ZMo(L1h!M7ts9!ITMilL|IR4E_#0;`H8X|HCH4*
zLHiFPKS!L&zy%ZwS_U9F9FYBlS?EaNfc76s%jiKW2XK(rVLc0^c*@2Zv7ZxJieBp?
zvu<wl7`^Jis>~mub-i%Ni91iNi#by=01pv*aOCC<F^}&EJ=FF`f?h9`@%F>bY(iP*
zh91?i1Tj&p{I|0n9?RTh2*8;SIeCv&#(I&oU$pA;$lx^XKR7y0v3%AOW5H<t!O47<
zqnR+0wN3XA@C#crp*XpTY;Dv217|0Ytp%(n=7W{80(o4(a&(JEvbO2|L1gWCb`th7
zk*#gof1EAB(-bCj<7C<N{y;((CUkvE<d8l3e=wozYeJmd+=$wn%iCD_pJ%u6i<2|D
ztr&)3;7*iNu=_98pYjysq2+5A2qZ(6?C{LzXFi|PSpLT}9#PKzZ5qGf{zpA0p!8JD
zE>Djq)f{42bTOX|r*2cMF9C)PQ(;g!cmKXMzr?mOhuztD>Mq6nGQ_ZE!{KnyZT#@R
z1kyF6oI$YMjr?%I3`wJ)G=j)?MQH{n%t+A!$TwoNs~A0)VFK40Ioin4uAJNK(?0^r
z_*zQ0p1uc5%+OO>N_P+6m7f}1F_+TiNrxe*e05vQ`RR$=Ew6f&oPGKC@sigc9>~pH
zFL|v8@oj;6UMc916$&>jKwVd|Vg^&!jAck&Lst0e>yvth)HQI0p<rA|-H8r(%PY5&
zGw<gW6_9uYaCy(Gh7%o7AZGWxcEi^O6d_Q7%oKE3XP2k8pU8j;IV^BggP6I3!xJ4)
zfWro_Fnon8Iy~okT;G(ws%@+4%R@Qm^n7+M^PT#Scn<aa-G9C~IRhMqK^O*pX?4cv
z{{OLQTJ6vj$#f5(A`t|ocJ5dXE<ZlxS-3jTe3w~Qk!97I=YldI=<<O~KD)eg`^!^x
zd7kAh{4EEUA0M(8wQZNUST`Eh<Dw3z{XnjxF)qIyo@d#P#<+AbtnVmV0mOqoStNeW
zHtj(f5HwRE33S=BTQ^lu2ShUHkk>2Ev)@oJ&3~_B3k%)9M8ICB7RL79-YtoMnpzn9
ze=JWe#H;?%(3^87DoKEPawcK<*^rP1I0>t(#IJ-EWoV&Q$nygB`dNJ1eKNG*chV~6
zc^F!FEDt{f<v&5ik5ZA~dEekr`KwtuQN?{;_H$lNSn)fVdC#fuLqs+!RQ{Be_7C>G
zZ<mNB+;<-lwLftkQN70=>=@Mj()>9?J9^^!vs#ZwxMN?o9tV}bi^mo>?7s1p{XU$X
z0dB+~3<SS~>?oN3f2>l~o#oPNP5Xd5VM2(_4Dh1ZhV|n=7`7?y7xs@Wx%uOJ&>-$V
zP!%DD9c(nHgWe&j&?sh~!RN2P{-+(tMN&bsG|5gl;H_H8HUWQ*OU0v;(mpP*pV|}7
zNw>KA=8#mZH*rx#w9;<^{=~yW+u6doWXr=-*e|5~2FgL1hqumeiu?u6Z<&W<%T+7=
zrq~}xqd^ek*iB1uKg=Q@Ft{C#)@C@ho{HOkI@&sR+*06AYEejt4sTLv#iE4z$%l^n
z`gXEewK{Zy{cht`k3qle{ml^?%r}>&XaR#6wOSuKp?){r!-5m$URB>ejAe^gEI1*w
zRx3m&+|O}oE_8x?5Z8RPC(yI^xccU3YR1pr<Kks+1?`0UxzOi%t>Z%f8skx*2fp}T
z=(pEw494?%Q|SA7wU<ha_z@e=ag2?xkxy(q$3L*~CHxn2{DzI|gR(O^f*1sWXiXtR
zvH!;Ii?^9GGn;fE#shTs9d^nE^xyd7@4u*#3H!%8+JhYF>HC!YHy$wl@mh{d^uP9t
z$K-QS0n4w4ewok3I~oSkvdKA-|L}_!4$>-pE<33Z{ZDaqnuo%95f|!TuP0_c#O0UM
z#~J(jJuc-j`+Gm~|Bim{cVat*2KG-x?6u#}FCW&}@5He)vGz`!=zqMMcgGTHSi+Aj
z;xu=$m}B?!EWaF%GtZuq6|nc0wfCo{-Ej=Ndd+%G`X=gM`|@K7mScaGpU1>;)*mmh
zK{5_oV}61GZY=aIE?>Pw0UldiA4up#{!?63ulol1xVqbD;2^rXhng148zkyq^9E5m
zKBOOu8zl0da08sSh1Ir}-=IFw-O5J;2T@v&P0tL&Yu+GA%ON{k+#od(k90^gU$WZT
zTS21#HE<A}R)cD>EN_tK`J?QNk{E<RAbO>gV0G_*v3~K$#ObVFAOmS6+T91WOqCz#
zE8&pU@WaaLZ3EmuSY*X#fh=&4=zj$qL;(k(j>jHn)W6~lLLJUz9ebXU{~9;IA}dU(
zvcN&2{}pf$1ssGr9($Zo|H>g7>TtfSW6v}4ABK3*8C9bXkUh}of1Ou7U&`lsq5fgo
zZDakCmk+02H`-ah<aM!-eZJrTV;job9d`UXI1pg&9l6%gzCM;)N3M0auO4^gO2ogL
zStPoqrr+di^NIxc!W*kdqWys{TrFy1C6&b&67jF_g{Yz$)Kpn~A(8$HUkLC8fiKA7
z3yJmzz98@gfiLLe$1cuWUJPN?i@b7+Ct%9fynHxSo9V{A=0z2=97Ll2otr?=+DrOf
zJ~w@!+f1~~;HQS7{dJp())|iHe}d<se^<_2Zc@89-?7~|bGb-gTsWov&Cxekm(+tF
z>qprcpgIi0F!V~xm-idr|6+rIo=Z2T?E)o%RB<fH${+GjBMXFNuZiX+jRK*9{Il0Y
zbCJ?W=;$>m2td3hO(&u8nsoG<6da)a9kO#zbK^vJN0|bY-5r_>2VHYVdq+V7GGe?D
zHaGr`&QC#@K>Iu75#zeedU9T?N5R|(OrGU{VShQY)l=peG2RH98%1eHMQI&Zbk-um
z`3G<|9jHZ$^BZiAE|EGQvvH8F*%$v;Zur3o?rR05NlM5Mo#TF~pfpJd{X+$1PEb@n
z<E%baP`UVl6nqi5>LifPpV^n1MJIjq_X5{Cn3$*!0@sd8tTHKRldboJiY8-*=|Cd}
z#pVB+>M|n6<|Lz`SyNvQV&vs;lv$ADw+B#_*JEUMYgUMH8of#9&g>>3owp=<lcrbP
zx!E_vKl#;-gp);)W1cqx4OAZeGB~!Q<D|?7YRzEXJNp6&mE)^@l<hc?dvqFPR*tWJ
z9^?mSXPE0S2*cnj^<mN}_rKVF?Ae~eroavWN~esH+F!!ee_TDd`hTDH<WUDu5hn>h
zmyVv6IGL0L>p*%8Y|o>glml6tVBm*&^pkQRL=NBXCF<G)eLV4n7{}Nj7di7T#5mOG
z{)8BxR0E+#_n(OIM88qRr$DR+R;l__PNg!B9*b1MAhLye;!-Z_yR|roRLA^md7Mxm
z&?O+KWZ#Krlz5<u{VW`2v+$r)yVVpPlx?*Xk^@btEw}idQVY?5W4Xn@Q)=y~`0K8>
z_;*Te{}vyY5}JoIeWdU^r!|`e)j*Ikf?qi@n`Mg`1?51%e|MER(+S=F&>HerM%fMb
zz-zzmh9>+~$H&nyyO0*>7I+_~+4Y`}kQlglM}U)UX0eU{zc@#NVj#?NJ?s<HVc424
zLonbH5R9a5#PcZez(nd%I80{P2Bq3fX3%`yy`P+&0dB-V2m{}AXSg2!|5&A}o{h3;
zo%R8Vb`b~`8}sXr@MdRZQt~PgVoGjffg&fb`e0SwF(<ddK+*CUa`LR49D6>EBItR)
z{XsrBTG>e8E-QN637?HqyL#~JAHt$-D3I0gkH2dow_!l0DEewMe74QU&yvW?I(IIG
zD?5*(bkFec#3{gj;>hkDFgrX<t4!p3xA0^-yO?>f^ThGJ)?>SupC+37_tNup9)U0%
z@0E|^G6RI+crWr_L>O9U){$JUXbm$*F~>FvC|+(X{rLL&`#AYOE;CsA@kZWl*4r)8
zjv5?r5nWwA)qSFCg94hMs=6Y&#;`C9sJbG$Qa;7mj%EQMf#GsRYmHKl3!{K4o^G}6
zo|#CiX~Tf3+IG)OuYixKqId<mj5o<pG>s;*bJ{4NOfnQbqhSbeBFV4|f2NE_WqBYO
z&MO-lhjzeQGey156XTsFfHj|#ozZmzF$e@}x^PR5{u|2|gM3QfDh>F7jU}<G5$(WC
zIQ-o$<)$0zgySyjd~vI|ta+lg0z*(R{r{Tf$L~9B1V-;Wp$UhBkKc9#dxFWprd&A%
zWDB~j!1xdguSG2M9}yp7;kAf`&#_o2@V`YYd^WMrk8BhVfuhd!>rtWmctWCP0AR21
zx_=pvXbWdtz?t0lwM`_f^m#pRm9NFQP#%kX5{29gk8;=eED58elIP_^N}2n_WtkD>
z^|~Pzjnu>-HTHg(Z~=v9JMW23UiNp#1{|bjZm>XC)VB}lPxK@fq{h}yzR{CdkeYM!
zMA(1}QnRBcWsw@;19o0PUO8Wn&#TLsyg+J-yy_q?CPE<Yl2<Kx*(DVpuzUZY_s@yP
zu7*&7wAwl0a6s_AHZ~y7=oh_zO|xzJ3gH880mbY%2l3pmcw#o3e}&U0jhvS}X$jyx
zYB-i3%FZZ<VHkv=SK7o#%Kb04FF#k^CU+O8q7+DoZT#~?n42i!r5mZ`^~8MNgtN-e
z@^Xmhs2b@_Jky~tfO?ofJyE97;DB@}lD?J8Pwr3-%+qjS^Kyvi$g^)jfrYwj+@V0U
zpC};c<Kmx&^;zw@ZJ^fn0o3o>_2HnFjn5h^5IMs-nf3U0#e4@0lzyN#s&Vg5OfNx!
zwb6}}Ud+Ru$d7NZK=|>)K<qI=HS*(IV4$jov|Z)t_qk{Y2qZ;4{GOVza*o;v5IH<G
zV>wADf9QE>2Wk_9bH5n?2jt4)66Uia-&ueH8KOTvEPQE+to8;B<Q-Jx_&T2V-$4Zh
zmdNo1IsWtxI(dH-%#h<x@1WxiirEetC~|y>9AA**Cz9jahJb7j*c;^dnY=$L&5+~A
zW2jB!jO6&mM9|M31!`CBQ5Hi%=~19|{nMi?z(A;7Uwf2D?OKnk$4N;tTbw!B<77Qv
zCr00!vn$A97=&S8DzJLv{~sIDuv3v%Zg=a2h@=6cI8J{5Yfm#yd`TZR`SYG;oT#R+
zZWgBk(ZIl|7#hY5hRs{&y`nHNgW-TudGC=s<Aj;qrIz1NzYKYUqhUi{lx>YLgQM{v
z<OR{d795Qn@(#W1xey+hTC25S^x5Prga*FkhMzxLtATJ}iy0NUwc60DSwYjE`Redx
zZ+h5Ky%1f_M3Tik0qa=CW?ohf?`APiP}L2cg}~#>o0*Zu1d_8(){%(=ezHd8zGVah
z9yBT^rm-3&QedPsdb!OBL`^A;UJ@nHr!+tyu=U`o)itFt^s<humY|93*rJo(4ZZfO
zjL##gBPtgA9Q1mU^Ffs>Gt5whYY#_$TQR(sRpH7~s^97<$KIy`16fNomsc*Ig6xG#
zG*EUX4W_B!7T(N)0?C4Ds<%bgsjws%2n*B<55)KcHsl{)%W3~oc1B4I!XOa6k`{`|
z{V!H$beELqK>qp@#wCdfeF6`L?)A)DDj1avWlPdcDjE=#3{^|MWkO{{f!#ZEIl|+#
zryqWs*c*FuT{(I)IbL<GkT;VSbu~tBYr1-vuFjWXt5271;c=w5I9-*eAqng)PS-X3
zHk57)pg_n%sI;aEOL>14b^c0U%*24RsB3sx6c=+x%i#McRoqZdGwIy`6i|`dqqv}6
zqi;L8d)R!KZDiOIV%vSza|gAETajU=p8T8QRwD&;_v{h3R{R4DNL`Lw{~VO+Vp~8Y
zEh%!Jbn`A&>0So~R5#;otbD8Ib_903jTKL>!BBbxk_LLwXX^Tti#{7!;N+gM=yO4r
z1^<jipO+kTOp%E|m)0YbZwp0@m8o-MWRknNLzg~8CcJ5+2_wd&z^VGLdbhgt>j5JR
z#J{`e=pScibOa#?#L$*dxUBZy*nMq+h!eB{hX@1cCT~Bme*vy%bvqQ@mUk9gl?Lh!
zj!a!xh9iTuK<UB+j_h@%g|1)%N0u&og(4S}EU1JyRl)sjGz?h_l$%O$f4S^!u>vdx
z3hpnPy{Z+>uR|{A$QRA|;tvFyEktmC=6ta&+s-?J|Dw!dU}Lk2va=7Gz9?<B5V7BM
z<@u$X^MbBAjHhj7qRS7bWi6*nbn*PMAw|S*gg)mFC=pbx<pVLonyc8d9rW2hCkB_;
z1^Rq0+r+^BfaLe4?NPeCYYprUn65|Zl55Rl6~I~`b;-3BG{r3FI<^O1#H;DbO5jA+
z8(IVy3!F^XJ6Y|q0ba+rvWEpJp+aThLjydJ6527YCJpdT|Dd>Kg(7#2Z8<9h<^nV0
z)09Z=vO;z_XEm@Xk=$j4wEbL<oj+%1l*TX!!r&_nWToE!VtY!`={D#tz-O$j*nt0s
zK=1?kzd0$(+vem!GcYO3H+Ql&6^}_{+c$S|PRS~h!}*mEf6G0YD<S@qds1J=ddwg0
z36bL+_k_KH8w35Ss~%4-2=uG2J^}rZ8z@~wW9fM{bj<}>&(nL@XcOy`t${eahm93j
z-#EJ`+`up)$91SwvT>Gye9>jP`)%IPHNKMOsjGpSPjLe0s_PbOK4Aw2wyyvfGGqpp
z+gHL240NN15tr&rGDkf>__<-^r8=|B!3SUVqbK~pFn-9m4mBPx!|?OWb*SO+wJ0l0
z6Lw%2linftFV|t&dz-u|6n_)Ka?#ab_NMtZJxuEC?9UJEzz~p;fXM3v)w)>fj6i5j
z4i!2#!XS6X?jA1aGb^3T?LA=#h70=4Qs>Y*e3pT7)AjgA*ZEe}@Z#)@k|PFT7<wfN
zO0;|bi*<h_bxB*Ly+8(KumNkH{e!L>%X$8yYaRD>$rptB5I~O|<PBHb5KyilgeD_?
z>2m(5XfkCB!gDW&C)kbUbGefL%&5S<a|yl-K<uBv*0=-{|L9vn^MMnWZfnn(K&=US
zo?8_XiLdi^4U%#Nk@)g&PTuJ8C0h`l#5s~T5?__Ir+h(`Y^2GiS1pLrZ9=8UmREXZ
z*D5BLcd{+7G|Nsow7v+qyp?t2=mbO#zzWAxh9CsT!y`Bc9HAACrz}Bu2IoKqyt}MX
z;dsgu{CIGq3=xie^xt!Clp(^Ak9nIiq%1*%BOi083}3qX_IYer7Id;>-KVlBM-bw_
zu`W>7YdLiv$`iy21!a2(*@rdMWeP&|M+g8%GIOmyQkEdZe<O(*zKK=*n{ox=*`fo!
ziX9G&ir*5r=sKl~f6#So>%rnTy83dIm{k^g(`A40y)gF4*%{y<48t(+OIyim`2WX1
z0^5aAx$uBZjh01fE{?yxND0ll!A4ZMphi_ONCk_Hs4CTsLv<rIqChNIqB@(*>$XD)
zoqtquLB*xIQTuvaq=Gt6$r53VD<6mXEKh_nF4c`V0S9uySNh0b@>m}60*N3#%s1ag
zykg>LL#Wr{4<lY}*?towf;vu}W6Gz&%u;kbOcWEtIM7kGKTJh&OjWKW6?s;<qJOGf
zODghTRIcdC<2F~hKJqWWsLjNj<IN=g57q|O`DU^%<pgoycr($+P`|C;Oe7B6_v!wV
zjPW3C;CcUvF<z!`kTg*HPmJ+?*?)q5otb-F+(?hw9M~&ROUbrBtUVxUpuX4DlfYKz
z<nN^wp&|qv>??aC=UPY_*hB;Ejch)U>yL1ty^(FEVICL(3djSgeWPNnw4<R%;Ty;T
z+5LV#-0qy6QI5kP5JRt2q6vokUu-Mw&YK9jb=trD1c3r(h_Rh7|21PLbCQ99MMEFe
z5Y?PVRcR4v6lehQUZf#}fq(`eUm}egpdpHka}#M?K*NLlz)~YoHLLHydr7|dh6~K%
zJBTP178dfgH@ZNAtc8b#f^)X@un?hvgI$NkHEt(qD9OMG7S~vlG@jkD-#yvDs32=h
z-yfaDWiNdQm(ZPNh!1|pLk2=K#QcV4NH#EHzM~oZDR9h<X6RpxE6Ko?Z0U<}J)i9K
zneE?k{l0#8T;&p)K$hMmQI<#ktetFNq*gJ?@hE^XD^^s}fpHe=%Bi$d#QUmlo=Xwc
zaCN<i)_i|3)@ZwEt#H+MN4sdPfVJNittt7y#-&Ak*4cODe;2|A;<H|%oEV|V-Xa*#
zffdV%5sJz+*@_GY!GV>)lXzH`M-ShhV@b}5ay+`^1{}5>=JW9)fv50r1?V5j&M3)Y
z5Qd>wYKRHy{V%rtsGliKSIGq!7>ohSlD-Fu#bh?}QyMgVc#m0u2Bw5gAn=04>}xu*
z<K%k-ffr$D_c-eQ^7}P@ur;DAlb?QBTG$#<mdQ8R8UhV0%j7e*h82ntLZM?3E{)>r
z`{;oixRVWwJJ~MFmI^Si7k83y4zi(@tr6tF(yQIp?ecoHLMjw&sTy!6z1qW$)7R~q
z^=gkB+w~4-{F}0~IG}h9ONCOo2Iiv|ir2usNw%+8i3J7}uknD*QsDOR@$-qDz$3qd
zo(O`V_TTu4=aH-ZgP*`7zkr`8p}-BZ(L~7SE7`^}o`L*yrYm{7{M8Xi;B+N#-+!Iv
zC)8IH!yp%4H!)OOO)#UMnHbtL0TS5HObja*+T;urnA6FsHClb%oI#DuoK<V2`i|*H
zxOb`&3k;Osk81cBRIRO)lXheX@&VPThE^2XQ?XN|`|w@<<Lr!*7=%F}dZpA5g7?2z
z`{C}+n6|4PAWljn5*8jCRv*u?_UZjJc==eqVfn?$%LO@bW!i`4E;qlQaYEWhz8(<m
z3u<7bR6N!hcKz|zjX@4%!25-&;RD|4zo{AucrSRvzW)w*?@%?0tWb8vpy?w7CAZ0}
zq8Nxi%n+4aJu$Wsv#17&N<OIjPi7LP-w>Nn;Kq{YP$7c#ViW_D=TH%XoR~K=LXA|Y
z!32OX4dpk)v4MEuS&t_KbNKzt#XL$x?KkWL=bTDJ?W=(-nXJ?$h>Qf_Num3IZF4S)
zfuJWv^7y=%kFfNlq8bRo*|B`X^5a4F>qS=RLQjgkPEV@QPxPe7C-kHmJkNjVNuS?k
zKZIkP#=4*`D`vYq*QKBcav)30whVUh^H>U^V9d4*cG)}6PkB4zJTsw=a`Mpq*5=cT
zJ%Xs-4qb1RPPgUT1yL}l=`_xaXeuXPRGl|xXOx663<A+JiLuc8U(65PM{GK?84u8m
z!9ajzH|s)=tHiMSYqN-#JwC^Jn$H`FVQc2&M#SrRbDr%n6e_6kcARS}|E;qN5yZEq
z>Oc0o2*<Hj|FO0ad^rh2Pz7AP*cOPFFW&$Jm!8k(>)oag{6KV*E90N8k03$z)lH}z
z`}=|*NE0f@bzfUQN4Z9h>%QhDl!ZD=kYK=A6hm;d+N>oAmH@#JL2$I#Y|oZjeqad`
z9NCC+GfZjMSd^eZ1wjem3?=5VAVDR;S$}(SCpSjm-86~K+{q_*a&u6;qe2nnZL>*)
ziJHj<XE4E@DelRJ+^^vZfV(Ffaw+1<DnC>Kamzp=IuC+;Spsf>2{K?xkgw=R9{oDX
zH3;$*{mLV8!w307kwDn1O68VZ_ij;Z<_yHm)1DitbCEiOmB(w%ox?BmJ<qa^Vn(%y
zmp9G%Ynso;@uuvIavX$VAbKSdTw>q<VvDq$=L)(S_OCy&(gaN6v7a^g>DovSjBJY6
zZE?=6@`fmO)qNn=wYl~3Q3T0>12jT)?1<o+)swUKYjf*G9APzi+rmc@L6B+&ZPs|q
z;msmhUz;^<7~aDsW~IcyfE3yo-lHKy<>w>EEcdR+T6S|Gzg6<e3an)}7h-J=zrZ?V
zWH%RLbvnP<rXm!W&=-^jeY7A-FDu;EcE!;}642nH?YV6wB`}hJ1~={e_-LgywExxZ
zD7tsW%g-k+&4svU|Et$gp#&aqCqJ6H?2m8Sg%qerR;WTX`le*#SVdu=gxlzgl046O
zu-dF0J<ecDH@TkQ;cr938j@$GaC_i0I2_nC!x~U;aT=TrNHbivPP(K82At4En&Fb3
zGlvxw3r?seG*tjKyL0n{`P?BfXjF4Oro<FlAWe93t}mDv|G((8rWZq`(5T*a`(98O
zC{k#U=rcr@I)8<=qvu&%&G+!B;cr9VzsNtFol$awFbqVmRK*gB?tignChSuR?JVgZ
zKX|+#u&rIK-Um81!AxzMbNn#V&qx1f`C;bRVdhLEU1d;PUAM;FU5W;ZQ{3GWDDF;i
zr$}*kcemp1ZUtH_I0Sc!Q`}uH?|1)XKQlSWOfq}cK4+~*z(bs_fw6_q#2yj;-iFIi
zI1~}2T&2phvy+YA(TVx~eYfKtLSNbM)wBD%Thrzg?DsX`Iq-_EIvX@O^{v2Z<1OsA
zp5`Nu{sFZb9EJIfOs@u#Nb7Cja5B>#DzS4b!0mSVs!bwLzgW@mb(1cKh1Co3r;mt>
zzH*IYF_<-_M*FRQuc-q46X6^?6ZJb;n!jx&tjYiyD?v1Bd$T>cz5oVX`!)>gYfknQ
zjQ$7nIN3ZJ6Ya<W5<2-fP$z(gScsZ?jjYjT>{`&hB;+CjNqlvE7D+%qoJaI^W*}7Y
z;P&!$jz(uLp+>2bxfz-Iw{))l<D0Q`gvjH6*BP+>g}vSWI$D%9KiBKl5O_PdW6VC-
z%he~EH^&#v_ltd6h>}!n8y0da3)Ipkamdb#E7alWTnPnk<{13J?q@^N8`)(<`WXKL
zV}}#J7LZYjFh#NxaI7eu_bYa-6p<jca;g7BiQ(`}^vl17PTPfchZ;j=9=SgKQvbUs
zU!)($*3}k+VSt2~-K=aVP20r~9ZdoaHC3DR!dUV8_sLua+~+njYxAbbxPo6*M9T=O
zDDzh&aas11CCV>n!FGVkKoA3-sE-Ay^9`)dpF!k6iB9C&rg6kM2==0t0Qrvg;H{?*
z=3E$iiT2I|^`*^X`Y2&!dMvHs#}|HpSE@_rG+5;0^7`h@UpE>XihVP`^f^6*%j>zm
zEYkGy1mHJLv!TTHWaWp9JmIMk=k&wopnNtp_5N2BfA!s>wjslo?FBT(-?c%ed}oBD
zV~U8UbS@Us_Sh+y-yB60?@Xyp-p-ewBhR6SvsOe-WIm`}gheda>pcf!Iu<xQac}TU
zMrRX9>0LaUx6ENCG*JIvfd;UDq(CvDpL*$jY~<G~)47=46GKWAe7qp^H@@M}uvKp7
zE*b7j>Y;(qkYA!0f`hi5zz#<q0{XP{1#x4(R2Mj<m2ZFL(lo8Jnby&eNRl-FQK<jp
zAt<M&^}mp)U;`9XBBH%`>VxV_cuzR+hJE35yiQg+;?{{9Z<aJJx)=}Knqh$|$rqii
zdvQ;GjK-C<U!t-e1s<+%rB#w2Msw4iy(l%Tm~0R-obMA|3kWY=>-aQwADb`5@EJU5
zOulb3u@>8YhWl4lJCjW6hECoNQi?Os@oEGLU+AAaMc<f_V%t$VuO;N<Y@SZQp*VmP
zYXgUiNO}A%ot@F8L>!1*oSP<=dp(s-ZNpZt$HpS^h4PCs?JeD<29a|eHUg(>H(&O3
z09sB`W$36!zgfcxnVOhXxsS}%mG^CsI(>6ZmvS+kTcEdkCL8Qvs;_0ig~+E1Lk0E<
zhhETVJ&#gPdmnciG#{o*UbJF@k^hY)<U3{gGlN!O2T&qPCnP<rQPwZ8xq*L6n3{9c
z3BJ2<(%NAaCTeW|ss2SCuA-nFiP)s7onAjPfww52WAQCo^U3a4Ql)1iD<`}xgDcoh
zzNgYILKQXJ5<@oA>PSX}s1n!54CXHN6z=FB9n}w6Dn`zTqTCW3X8@&?)hFLkRpf~w
zu{rXB@0nNEKKr2C8#<bpnqZ{HIbjmkz6A+5og<O#j)Dzo5Hhx0?5LYVpR}O~Kd-aI
zMI4=nHyXe|{hWFr<S)EW%uNf=$ubh?Y)R55LzF>eY7;QOfw6j}6+Dh)+B~bZKBto~
zjbwWAugWjCrA`uYpkY(@O~^l6bIRYR0*keUdEp3sj7GA3u2K6~GHmW^>@O_Sp2LKg
zA}><_d$GCg>sY;D<>Hh5;=fqpF27aR{l_-b#g&_SIDtl}eid)8rO(re@I-M|$1c3o
zl4vJUd@u1$E`kn}VaDISrk&0kyr-IfW+$L{%l`}yO7rmv4l#={9N!SgFW8w2xxiZ0
zKCnKzMX~@9VK&6J%+5tGgAup~(#0J3snS!zql5hg1BXjoZ>osTHk(}0>>>h($2{H_
z1jym2zf811zt_0hQT8#f1Y#f?QEf35qm2ETH>s;h?ZpRpwLD%&lO356cI)=O+dW8Q
zx;9y37t|j99zzhK!G+A>&W~^~^<EgG?C0H1Rll!VPj!9{$oTnHRaa)Ew8au1TXgPI
zxA3&4B*uvfrBqVB|AJ`KThlD_N>Ic<I9h;=y5&9dl1W4+dk{G&x!ZCCBL+#jP5z1I
zQpcO%6e=>qz|s-kt5Byt7+?~aNj?l`JC#I6gFP;hZFG(@!@SZXLLc&}q@>O+?*#YH
z<OOaDn=E>V1v+vD63;gWrnq!`u<Zgi1?9^&bs7DnIM1<T!6139zj9(-_y?i?ishhH
zz&XK`-{`@W#?OB@ypdDR`9IUtR0%anpZDlfu%=SQD)B5VpQ#WuY~#nY(vw+`#6s`A
zxnOrHEIZi8q5a6#>{uBM)kqB`@^8OgN>d*mqK;@3Choo&SEJvbDA<v3&n?@@C(>M!
zfI)4&!DUPAfxs*J?(LUd>=V5LrvT=Cy2QT=%(X*lwV~ux7X9&Q6QRo&gN+CcR2at5
zM$FGfo2_V#RBXv;MeDO5%6t+=zL{T&TpEpuB18totHI@RrNKKJ!ty-38;jZkm<4tz
zRD-LS6D8MJa$5fmHYQLQ`9R5IKcc|PNH$gpPYE>hTm0?0fTSTZzBa@y4!mDB=aw+U
zN=kj^j2^^Caj$7YDauZw$W)(H0KRymd`VbWA%3Ury}al-D)k$-uad_`Mk`$r2{PnQ
z@Wy#h0(XRvTYaq5z#j3(5~Ce|ycs^_6ME5GLFDJf4eL<uQI2lDZh#_s|50~?GcbqT
z)^;zxiSxHOWk}%PbnS$lkIn@bL=l(IehTrEiYm&#)~4PCe)o}z+QHN{3>|HMjt>oG
z!ZaQjGdLV|?cb|Y(pfP~_#Er=)V=$oA|ny5S7j@(sDBnW(<`ZhzXGF?RweIJC09t)
zgUiI5RjYD}FX-Yk7t4Flgpl4gA(_$EcoPG<rKa&4mcX^$Q}ARpOq}{y2%E{yF-OD~
zZ^z;k)NF6m-G2f&k`WUV@NPYm5z#J;<s8j(D_`F)-h!~})U;d=E)aqf)7{mP?9SPU
zx_WSvoM>dQdAAw`Ni1pJbd7$Do!R9GHkQacoM3>7f89{{Sy5cdIl2YH>dqj>bK06T
zDcBd^V~R{xPa?>lw9HFD?aHsQmh!$2mMBy4=~`)3UEOUZ+5K83!q-h~!_+dnWQwr;
zCGmX#`tF2};0NX~z_5Y^L!Hle(<wixS-{swTbVYdht>ke9kcTOep9IYXNrONM>r7L
za}qYz(|i1>F)xFfMcFO1fF>f9LUN9~mxQ%8J8HKk$<zW<Si$#yy2qnh5%O}}E&ncc
zkB`0^;#B-#a6_IV8_}*@gqPwS{juo6S6tB0CrG_{2pTFbY?yFwy8yYvSzB7eCm@6p
z{4C)IF{LiN2REmeT(b3T5%Qq5vPZqFCfnm#cPpq^?R;Uzyoxo=E}Wh`FLvE<3&M*!
zxm?oG+Vb2Db6?m~#C~MNU2UJ=)5Lz2Hc+K^HW5#oll<hx3P4yP6RHTO|M4#Z_2*o`
zl8geJ9Ozf3D&Tvt_z!?@J_7jX(2Y_a#S@4J<B2tvVZpfq-r;e9zBRGuYunqx=CQx~
zs21@*nV<9If}9ptn}`)d;K_tc&B;n=JmdC~@n#||HBct>T1!e7V%NlkxT~UHApj{f
ztH_3bcu$ThK;6_uoduVFQA{VUl4@t>7@1$%bkb%G@?VXRAVLT{OqD}Z=y)HTvv${V
z!h5-<Bc=*z)_L-n<W$R}He$LLv}tDGD4J{6bny5Q*IU>iBAm}17wny<G|1c^HB`y2
zcU_TTuKg#M!u6Y)4PF6bIaczLB}AKB$Y_>pBOsZ;27R`i>k8rJZ^>-5wX2w_jZpbe
zZ^lqFf$M(wLPU@j_@}FDM&+16ECmZp$j%X)tD0N&PNEzD0)AFlR=Hey`1<BRyeDqn
z5@#H7B>V_;6INXJ>X)!64mMll?>R33w0OAAWwa*<G_hj_lOSeg2vlnl>G|fXSm3FL
z@1aPY3H!|}u5cRJ1$@20G#W=^+=+M<{Kj0(4#Dix&S*h4wU{REzn<^$5MQ`xIjHje
z@cGm)ue(F%D2gVc+3%aVTJ)q4*cq@LA7Bt1JhuBa1Tv3-I}i>x!sXV_z5KQK5O}E|
zQb!yjgL;Q5k*0C!YC6AQxk=?)*V00Yxm?lm-F<SBO-q6Zu1||mqxr)-_Z%!hk==>B
zOO`KFE$x_*S?BPe)2oL$|D8vBXNCGJU2)aWHF`d_G3$@M+LKQLiH~QYKg^HCaEN35
z3wX_lbFosXm~h>8!az%mlA8O+@;0%+Vh*!FLpDN=#Ey*EUPcKLgGv?F20EavLtH0X
z;3RzuUHZyLE{aP*CmOWX0EwmC_1~tq4%KdJ36fI@Yhbwpo34J5)90K^ET(59i)dri
zc$EVnQS2YPOOq@_lRF|;_`sfum1ff=)Ov>-YZ#Jv<1fFnl0H{A*xsYomzGCzoi+^B
zB4-$<q(iTPyd$4*gC-eZ+Y{e#DrPlAi~de121nu@jW%hXi_XdDikN-FWwP;!nHC6j
zOI23EnBcuiqy&CVQj43&Ln7ssQ#p*a$R5fAFSmktP&cLCgeKF0&Ma4!pNAp*w$@28
zqnkOgO$7I2ugmZFD=T){{-FfupWwoF;-~w7qRkA`PD3yM^^hn-#EHC0c)EtXK90Y5
zp`17jS4>LSR#h5g^mHT^(k*ZM@EirJWh6`?1y_}#-=Eq5q+5Yyk-F-xsVri^C8`8^
zqO*!DDJq({`VYjgL{+JS2jddc`0itP`C|P~Pwxts@tk>41hvj8PucT8A@RGiC;YzE
zP~v966=QgSD>p*u$(CyTwCb#3ovv71oXdpg>)&Aw7yI&XsxYNEeeTM{Cw;X=JQBFI
z^a9_{FlPo<sBrr5`yPb4IF9KOf^BZiR0ykywV?H2WvIB|b&yubafSZ96<$D5ht&e&
z_|LJn-oFr!i(!6e`@sTJ=V5-A(^OFttyyp<4Pdf4>y_qKHXZ4H!(LB|7RA?8`Fvfq
zgMT6O9_1GVy<2`%EyEBn4~*zhQl&hoU$UoawoiiTc%)!RfN|oQxf5haXue1~j7pdX
zQN0MyrAA2gd=8DFu+$0&7DMXq*+tMid#9Kku=S?uuzLysFimnC(jQ@CmCa9l&K$M7
zy=cOD^z)BXuZ#1dz07EvE>wZUw1*PJ?;u*KlcBSagZ-z6G;5Sd?0=UUx;FfDmMNJ<
zI62z;N?T-TRw2;WYS^PrT@^dtiBoWb)M^&6q2Xws5*q<pma|Kj`4@0Bo_0oGbtz9q
zuCLl<I9n`~Wcvply^p8cRYKJrj+YDR`9^@sR;2JEqF$vAS9LcpHsNX#hZy266_;b$
zBqj5*6Y)YEkqTOp8Nk>K;yHRpN(J(`jc~3EE4R7s4e&_HAdt<pmL9eMf)%ZWfh=aW
zwuaMsL-o-oHsjn3+1ZF8Bn0VYorW<#<?M)=zc6q$Zj7s_)fg(~pjcyP>3NZ2CpI#W
z=##I6!d4Pz_W?W<UHtN1-ab{ly;cZG<S0;mGL$4qQCP?R<rt4Ap4D(ndN2DAn<41s
zr^PRZE*w%g6QWj}_CfGzFA->t=ZK0HZ93wUZ{boyi=TAmmtk;&hF!{Jl5dFaZB{-|
z&T>RVB5&^)ab8ew34lHca~2tIcls2B_W<JK&gEtzEW9*9^(tPmZFZ)bIjifk#kvDk
zxK-ayKjBx1*#30F;|@+*p_&w7hrJnE(2>M)JwMU4LcE!5#Wf6o)$=RZj}$-L$t6~E
z(wY;#l=+0MIe`%eWe}51S{Lyf?2UJ5vVLN@Yo)&;L4j{|w0Tf}tp$k52Qy&cg?IP*
z+;7_8;Drb~FTISpzfa&`WyFGDC~97d5V$1sYg7HdNlH%`v%wu@jL*3cVLc3Em78*M
z8r09n$bX7gxLNpdOJp-w*mlmhwsgck$H)0)aVcJc!Wv>Ww&Ax>H%DUh+`<0jU%c?`
zrvL8_H#g^#UIntRyp6@pduG<WI(Jv@w#SV<aKovd5WKT3IKvnhD&njk1MG?3k!g~-
z0L+DFF~0KcM>lf*PR07~7);Sw{-_nc$zL$l)&mghm+R+D5I3ehr?tZiZulgzViDSu
zzZPAf-a?3fk}%a_?=h&J>wY5WIN#G&YxE`c<k~k?K)$~v1nZW^*A_oNy=vQ@BqmVc
zcMm=FQ7A-NlNDl7+}<J|zq~*E%hM+WbSZp0xb}=b$TmALrBxL?0wgBT+$}sv|7wy2
z^+-XDXx9+ymB+Kv+a{RB{GqIpHVv*tNy&7oB~;!w%_SXujT~KT4-Kk&3NfE_svQb9
z8jcqvZzW2M;VJUNU)f=iK(06s0Y$`*WiZ^Ho6zJCevdOx_nYkum5%-lZv5Ky54FG1
zlnO`CzOW-i(YS^D80*ON2RY<RN^D{55FqsKFeO1ukJT6Gid=z3K?cC?{|0UhStEgv
z_pV{Iy1&1PbdcF8krwyh&v(jSU!^%fjzh)Qw2?7rA#ouu$}w~LOdsC?t$U3*I6NZv
zP;{d2`2VsYtMdOSfIRkonNSRSQ0lK?JaMN}`irD9e~Wln0o1<JE|Lr2&BL86oNTmM
z;DQLd^eYWHWBKRjyx;o+(@V>EmgYFlV+Hfj)`K0Bb*{K&$tFBD#k^>uJnejJ;|P9T
zMYUHbP$2DV*s*nXz7}p<k#9nVohi&sndHR&#XwmO?<FcXp57L5B6045`Q`qAOQauv
z-Sf!XQ+ihUSEG+6OPd##QDGB0uNkB*>n57bbeclh`od`b=xSL?0W6xHXtW!wY_qie
zjGB0Hs+o+XI^J$C!D)~I^2c>L2fwcq$H+VJ)HBYPdLP-!!a%455E3iUVK}Gwsh2?g
zk-xFyL^;<-Gq)UlC;q5eQUsOixim7&hxFfW6ISE*(X^w#@xzr3)%asc>S^VP)u8V~
zeo69=es9@D0x^`0l{W$i`U<m2k@>O1M<qW6mYZ;I=K_Z-&kH3UE>(nGp~R?PJoJ=a
zKW5hsAAdJxr)nfF>_=xVe)PPsc`gi^(SROq`&#(G-Vnhol|&DYAXJwrAd%$-h<Q;2
zvdw0+<9~n%xbx)V+kwz8OvhH0s*Px^ebzuT+D6G-BILBz%xEAA|70%D^z=|zPn3*n
zD|3}GkvgqbvQSfsx1IY@k=`$L@_)eG@>@IYPQ@x`?Bg3wLXoOOZ-B@2e<0ZW!c%xz
zH`<YTHg%ObLh1VVGnA<BiQ?Bs(Wh1i)c8G%?36`4N5(asJ=RxGmByk7br9oB-lHlO
zFgM9t(N2V_k$v%_o+3U68ptLA8UtL+aG3Z=bU-bXMV25bj_#x3$t6e`j_jObWYZBJ
zO}!X!8AYiF*YP=Ka~9XVMJ7gRn)dbn(E@M3XozJ91BSFgb(H#^C>1t5mTyXLoC4#Z
z^h^|i^(b&+vmwTz*ge%No^QeB{3yGLb2Jbu<i8rhj{nh*TOYV_g-17kzXM7vY0qX(
z?%3xp919a<UbN=lx8GY01z3*PhHY@hn@0ZKft2(`PMb?CZJ!Nog*g1X8jv`OJ4|CW
z5&(QBdqrm`<e4#`GsHrw`VWM|u(z?fs#gE2l?;M%R@;}C*b+9md9)Wekg)%;i49B*
zduZdCG}86~=9RV24`uZ_fd<GM*nYt_1XND3pmm&D!BJFW+-s#sy>ETYRb8r#jiqj=
z3Lx#59>0t1;_QPn>uKM-9x5eq4!nd&2eExL&VDZ+y(tj@KXz|1aj1VFpxn#tLDYL2
zY0^?L<osa(JH$negQ<o06DVf)vlS)v?IBkJ(TG9Nho9#w=nNxZYjlAY=)5-su;JTZ
z%OW{zHFb*I7e{}8lgoizR)!f(mCZYv#P_G6J(=177fy%sMHP8&wocX(NhAJaR)j~F
z6o0sISwnd=UnM9WpqM&{`vw3{B~BKz-uTqsTH>{uE?W*PZi*YJ!(vEyFzvzWno>od
zw(nHcQ38idZBir;->7o%D}elB$(o^4&catYK?p*q3c7pFyX^46XKR~v<)Q8PPTOds
zzyD15FUT$N=}&w3gd36yj7R;tLhjDevGyr~ovJdY@q3zPIut_SBrlseia<OR{3)l_
zSER9$d@y)hH^XJEAw|bh{mH=&o$T&}itL{I)XGvaqAQW=Kvt<K<nx-e@D_$MIq}4F
z+(bB7h7GomoH+P$nH}wVk)3GTW4u8AtY(#b@LS>JjD(UPYwFPI&xWTi5+t7#LXHJo
zHbZo())Qm(<q{p_mYF9hC4Vj5UpyX9+PV{pl0!QcT!F&5GZJ-^Cw!WUy#g+a0*f-H
zdpA{_M!&W5FEeKACNq4Utq*!{#+Hd`WzmAfZsZ6GAs@qk(N>S{9UAy$*nvWHDx~#?
zh8aFQTi$7uDDL#DOVlhpTUx6{WQC}f^l54<V5s>Jwuv*Jji>LRiik{>Fhr5p)9t6F
zU@WlojJty;vUM-Ab=DJ&_^z0ZT6ENPDefw<FJdhsIBzc$yX<l}gmGsVe8PSFNJ&?A
zO>YJ9RPECY<iUtmHhm4$<e(SIzWfoikjXrMov9OdllW5?O3k>qejdBwPe~sVY^5eN
zp+ij{5^iOh<DMw@cf^L?x?_p~zxYy9qeZ|+dvcJ{o96Ca#EAB;%f+`-RAMzWoj?Ih
zYL!i-8pNacv0UMhTx$YISXf^Ix>O^iA+F7Xp%ltmtptoGDg(BO-&!@31nTQ$pGRn#
zztBd@2r^4NUCrc+|1uOyHiSGZT%A}giDQSa2oIhpHr`T9PC|u?6NMCN%>>bZ99Bsz
zLh@bkYtRcR<A-0~Z?6r3pBq<kPA2(|hAJ>O6Fmf`_>L04tUQfP*?|wqYf56f&&aHo
z;%u$+^6tM1mdzl9zm=6FBH}jztjGjmuB?QBfnpE=H#nN{C(X7v`~wJf0%GC*C}N|g
zj=m3^A$0Nn10{D?AzysJT)jF>Cp9;yW=oi4x)Vwjm9k~dFfZ)UW6V(S9WvxLE}W-9
z+U6x<A=+};eK0#cr0=8OYL=P4v<%@s9p?CQxf~`DYi3BDT#C57Fk=;yBmXBF4a2$Q
z_qSg|3aQI+Yn(8_PFAxuJyyjB8SF%sGK*=vu{LNj{eB_ikE*(`;}ABA-jp<b#j0jg
z*3-TLKkcjuXW{LC<EMeTV4oi!7Bki7v7tn^-+sw#8zl>CRhs+rB>=dKSz<gSB{??O
zF{pWEUP`Hs(YxsdgFm5&6Ga&Q1HkXT5k7xjAy#FJ5#+@}j3p586`tMwphFKA>orbr
zCe-)V6(jcozG)H8v}<V<FIT<3RyE@=cZ}%3r-C5ew2MOT85pPwhPuvmOk0<2e@{zj
z@5$@3ygxp=WE|`o=3x-fzRce+iB+pbPJR+CUjrbrPTc0HpS%*Ww*!eOKD5NU|A2d1
zISPY&$SOF&_B;W6Jo`o?feR0BGF*PwCH|rMwua^!Z|1oa;)MH+JnRKP^l6|ymJ8E3
z(FbwlDL;a+qeuCfp42s-e_Q%&>xo4A*D$9D^NgXccopy_@^;R~92oR!tRVgbK_^Ki
zLnewoBO}=hXX^s8-U`2YQrU~D`AItXr&vIDbSIQjwnZOM5Y8a%w$e=WE~EdUU%6Gz
zy0{4>6i@#q*DqzD4frcfkIrd~xZFv3N^*B_g62s2k;?l(E6CXY_HGWlkcdK!rur0s
z(t13gN>Aax`D)Gc8Yy{gHuYA7SuEnfV8W%ugNc0?L_{MxBeX0eZPh7%!<$C=+JF(s
zb4VIX?*J%#eI&;?ED;MEBXY;>k;M1SLKhS!X!~4hYPR_gx+=ay3e0P$knl2WP7B~q
zPnRaKE55JMEla}gwDnc4k~{*W@BGTSKWN%SOnL#4y@s#ri1xlm&xyXed8xCKbUr+k
zV};HGIcIIC1TI~}_rSUlhB51i^CTxX+By4mYNRoT?_as%bM~EbTy37SzjCp8Xe2N)
zPHoG17r#j}-6oDUwa<``2tE_NylyO8$M4ph3NbzH<1U@6D7Y%Ck-Zw&-7B~zJR!N(
zL;l|7k{$S>lG2DeXEJ559Gn?PlW#?_;f|ifXfQ}az$$6>qyIuxQ@#cKAt_Le!a)n*
zFF|tJSXOnlfo;X}Id^(j{*Tog{K4u~RZqBkBRmGK589AiKneUE$Y`%W_qs?MEx!AB
z75IwI3t$`DtB}FH7{G>kRAE%&_6nH&avk-BQ{#aJCUpp%^UH=s>ynWKl^6$&gk-lY
z4ZezAe!&J{8=5x1fU&WdXXsr*Qmx|85nAjPx^KpI{okJ%i1FM{eS<oG*6E^*nx`p7
znn-t;hAbo9P@r*m{lZj<zI!)6^eBaXvCE-6@oMf9t!~GYp%NuwSVEZEJAYtT`(<7r
zN+O?*j=wRKR7v2?$}|TIma?oar*`RV)h<#Sj@P80nO69vQf%7*Dx0Q=L?cjtm^|DX
zz`>?maKB+QK63JJQ1#21?jQ9kNV-4QIE?oO<+>kNM7%vA=OHwcpu}H-<N8+INff}a
z44x#hjn|3Zt;6WCpRuv>>^ce{54EwP&$*9CS`qH+YSH&3b3j%|j;^Q<z(Doc(M?(w
zFNpF&F6#1wcXGmA)Rm?Pd%K7k8(j+5E_iaTh$3!kZa^5uVSYsajEDBr6q+C7)xIt?
zs#JP?w3AY}z5bZA<Ngir7Ce?PgE2voSVC8^xf<~DI(&t};*b5TaaD^#y5!gqUD59a
zmv3y$S#G>vPu?^&7H@N+?Zb5ff9FK^59YLy(n$PSc;YRDAluJ7<j(EwSi*&2e0~Wv
z>#O-~Vg<>n73&n8KdJbmid|91$z4&+==;k^7YZG64>rKnU+kZrj&F60%@2(ykvty?
z4H-Zuqp$mOk0gQ{&m0BIwNRhv#5fuJg38{{SbvhVSd?^?OHVEQJs_;gTRq`YJntj4
zxA_>-EdXC2MGeCC*X~AwioNeH$6;ftMa%^57MxUCNHxW6Y{HyCBo6HyZqd;lAhV&d
z@8kRoSHn(XJvCkY&>R#6L*weCFq7BlBKRQ^4E!dCz=AU=+VEOm<{J7Pl^=?p903iW
zuxS8TFBcmmOQMkc5qy|ov4v>v{p(M{8&R&WLW85$V^?XP)z^~5^E2Rz?oEgv0fJ!K
z?!n>6i_p>Xl;o2s76%ren&nfIj&bv?b@IkF6l=3f-ulk2s7L^+)+M9kpZHeBLQCD;
zZfMqaxZz2c(#az1f8C3Bw@c2S3L^CftI853ePeDmcD{#{B?d8WgXNAw<-S#jP4rbi
zO3>D;=a<e`z+v37<Cj}wGKvR29uw8|+02{Mygif<^Z@*tM0IWNBFgQbt0KMzp!qJl
zKh|E|>#p)vymF0|+Tz#QeXr8uG4QrbJw-~$MGR>Y?vG<K=+9IA4hZRY#Lx9^!U6ir
zixC9kKXl+B>BL<!YC-siL?fyt6b3AgYZP4&Y8&cjNT_2=(R2Z*6PCsSH@o1wL+0l3
z;l{qZjH{iQ!owZu;9}vK{6pE6CucVVzK^ni*F95xQ}l6D(8%QzGZZNNJ8iVm58>VE
zMyOPZHP6QNx^rJ7x+~v!9(;7O5lXkZQwYtvd}Y?v<elh|@4Y|b2H_Rb(Y}QU3XwVb
zOm87q3D;6xVNB`AthDxDbAfntbI}2@WdIHTH8z+k;k2RI#7ciFqR6S{QQqwT(AGa9
zy4U)nov38Zwn&;Fh4UiEx__h@T#Vd2V+C&#8$F9Aw5qbBthi3z`no=+dZ&q0B<W$v
zME^Run8oE-YEGS*Te{ejP5#)#%Qwv3^y`Gd7vQkZFY-s9Y#oYxjs6ah&>FMDQKwkK
zKX}nTi9dqvItrA=lAx7<Rlf~1crlW~5l<QcdZzP=$R%{@zCF;ZvG;8NJ&9-(kGO{-
z{@8>xk1Hv>JX!d2X~xozP=1nnh*aUma&F{rDZ0w`%X@crtNov7qDS=_ru%*Hspu@c
zXf{X~N`6=hXE{_@Xs^R9u{jiif@`eoyn1!VD|xFTgh|1UND#tP=1KGb2xjHAGW?=W
z0K~Y@gc|m?Y7$1VH<ZXeotjqGeZpU<B9y>wti7sCmI-2OBz&Q_{14!e>4bifdMH9P
zHakG~lmk3MO5asXE6Q{!_fblLKV{%V6`$C(u!OBjMo2jn9(M4~PwLMbMa5Qv%HHf{
zQERQNrFR+&2isr6QL_l^&p+O)>+}5#g_GM7*gS%p%gsp-c&(b$U3Ia>HN87Busk(2
zn%Cjnu{zda^5u%xwHU;#jQ5g^dyv>x$<DLeimxp^G~P6Szf4J&Mu$?p&$4X;G;6jm
z{@QFsileyKHIEMwm9dKTK5dpwot|6r&SD(jWDnvB#aFo~azZv>0;_DiTR60h7VIFu
zrpuiwL+vs&D{zAzJ=NUofoQ>Ob|qJhxvw85ml6l!sSX+CC+ff@f+Siir*W%aPlQ%|
zA;U8_U#7LcRUw1EzR&XsxF+lWtLfRXP7&Sy257tT)IXiI|MMkV7<q;u=AKB#9@&<X
zQjk8v0j*gZ57Riu^N?MQnh5ekyfo4O6LS=>3oldhfg<!ZDdKE8#OWpBV|h!6&>cWO
zO^cA5KI|31@V23-C@sI&eX6^<P-2%pyqiOKgDlV13p*{VVH(FL1nd%sC*=;U!n9po
z49on7Jdc~ttSyTvW<8#blO`;fB+Jc{{RcL!41R}<Bdq}zEe+RGTi~xy30W-e@Npcs
zdWMVVX%n3evM=_rO`3X=++CP!Sif3foI&UmGCm+~);xd;2m1b(*mMb4s;a^g@wQz|
zxNJ~rRf5D=;-Q+(H?A!s3|WCJQeXr;DT8wy_Iccj%>KmP%I&7X-{n7ZR9GssbyYeV
zr}H=7h4{H}`gqiTFbK#g5Uk)+f7qIXxrO9JUnXu5`%SLD8h6%3pKC^nfY5b~ilkrN
zeEnT1@0U1h*o#|09xVuip~pqW5nNomQCw>*TtnD_`(ec$(y)dfyO(KJIjXro|F}nq
zT*T0WyD@e1!e%bxT-AGjp1xVj+UiR;iD1R!J^R_36%SS|ip#Og_25O80~ZO9H>=@u
z;9DeVtdL($4Ln+)pE&EYhAlMeKaF%NahB&$0>@ynI^-~-=xr-#x<J3VuH&o^er=P*
z_h$2OGAS~;Gr4B6^TosR{tMxE$wY0#!EKl_w9;!x#156hkg-6XuN7TFx|Z4<B`L(9
zSSE2JeD1TTEvDM_Rb^gF^xRO_Wwp4kP+4p4_c8){b|QmY%CEzpD-oLD?jf_5RN3_M
zHHG9NOja_EI{kBul#n6Cl8gRj;yt#H?Rq089n$_$3ho90QJSHrFc7P>=A|J&0|wcw
z5DZUI8?l;-2F19Dz0COlUA0)|pO`h*>@Y2*SvqinS+S|jgN11>3tt+_ue{wSpKzjA
z94B$ks*Frj2oI{SU$Tk(n>*-wa5|iFX~86|bUh;9wjEvvw8TX}04R>>vc>qIXqSR;
zT}2{ctTuPbt}!0hdZE#_L_lB@C@X5S%>60nYu5a7ONg|pE8nyR+{^5&htwljMhp8w
ziHKcasi^s79OHp*jj?t{BM00+_yUlU*?2X)Q#}}EGnzP@zGzHmq~7tl$9+09|Dqv<
z;O@`mhm*{8r@OL#xX@?xwafQSb!F+lMN8N2uT8*1g6uq$*5C~w0y9w^zIKK968i+O
zH40y=OC{2D*{s%;g>Gi{od${B_9k9dMCL9&2$ORKXxkh=BEopsFml8dV(F*3XS;%6
zL5o&$;m&p3zl?9rjuuqUwEPhmm1jpmYOJ(M;vMi9)`NnRG(MIiNr*Br<d!xQA`uX8
z#nal<)B7&{`K1IBK%#OFAcISF-5!eTq+nSGUu){+`B{SFQSO`VITv0(`!tiee_jWz
zTJ2rDIz-<wcZy%I+ZPEM+T%dLkrZ*Q;+TkWf#h*_A0m*Tc%KLox+P}Z)(fnXJ4Ue2
z(TQnKn56jWyufqDK}Nh|biRVfKL7qKug^I4p=ngvfZcwY2MWk91~UHjGKKM^MKq!;
zA)bLgCg22Ui&;>^o4vH7VPy{B3X1nHNYyHUf6`{i$R*C^{3)#+?(lVdDd$oir8}Wv
z#CMl@JQ43{e5nsMX{CzNVmRisGllf<^>BPiM7AT9`jcohc3$zC+$ajFlJ0$1sZv<!
z519zzpFCl$c27R^f<<cxCRh=MBeACaA9AXSl&c|gQt|hz9sFSTRCd!aBg{^jusbbC
z8EotsI99&D)_TT5ftuBf#7!ZYM+3jk9sSnHdZx5;d!^-RzUL=0303B&C4p(psA03;
zrG-j#`QHHEYxxSZZ3{@q2EtuzEbA4OUmo-h<K4%K?yqVO5<{UP4<J)d{@LV@M93>K
zoOj781L#&F8DBZoqTo)S(-$#ETa|<E3^x^$Onc-28aLq-cEt`wSJM>6+=!%}`o6k5
zJCicxi?NGbOA(x}iTzHFqJqrOq+Q=-gX{aT9dBrnfB|bcQn9^uFD@1}4}9zKe_pgc
z$zWJ<U%TIcK@e#4{ml{Vv#KD3Ypo=K=|jH(Y>v_8A)oBJ&aBe{(b{s0)%^tD-EzNJ
zN2B#mjqx;2!6PKghX4K2xebiwTxyPr?#fwr7!)4r7DB6J<jm_Lny2lPHD}VO|Kbk8
zN*{5Dsufw1>U5!ZUqr>pjcRc@*{*S9!+8`m^x96aobBMPI>l{%?S#acHmmPllMOxW
zl!BY!{|oD@ZjKDf@eqT!BQ)=a;@{dvm(R|sYAgfT6QFChpl=&x@vW|t1zwSN4uH@r
zPgIKjefN)FR&EwX?C`?qKeEX)n)*Ih@Dv(X3iDAFed(&Fc1Xxc(3fUAIjyQ+G~-#Q
zBf4{Q@GH9L`iznkLX(KWohB#20o4&`p(UX?gM{F`nwkJWgSsX+!iDGOmJoGnDe+jl
z!uG<2=1=U-_gE8x!6yj$f=&$}PxN^6yj)T?k{%$|T0M2ew*0unv1R>jNWp49@Q~z^
z*Fj<qvj%JAi|^4jg%xgp$u;)MV%ZCNVBoI;U;kb-1-#t^xPzG;BMj(uRHvKoQo4R)
zTY3G_JcQSr><MGUfqia8MNI40&anl(UgCn6bAI7>yZ`AZ;6AA6B^=)(K6DhKb{iZ^
zB!}>yG_i1bJoTp<WOWy-Ph|ll{1nCWsX9Av7}<90YU<fqv))7r?Ixx9Zfs3g@Wceg
z4Ug%6CT4>4JybI>hoCj-gNHGPauGleSlw%wLoQ+=u;0*!#y!|rO{6h0ouH}{&48hb
zY8vZ7Z1sJ4(sSzS;kG&VqMi@&B^BiutL=#pa#TQ+p7pj&AOU-<2K2)fk>ClKAa*~5
zEAQc%ae7!3^RP+-O62W@E2|EUds=IdpxWK~aW4FIn2Drhc}Q^k3j7qyaws@+Bp-ri
za#w)8cW|S4zcWVHxC;sy_gr=WhopUqOfaFF52afEZha8f?3e8JMu$#6_ejrTv?62l
z-Hcl0U|u69Q&2hXeQDXEVE|)~>Jc0dT|w^ksr+cg>bhk8plSfrsE*j3R1JAWDv9Gb
zq|(s?HF$Zexgqc%^|N8=M-I?B-5H_5Js5JOo?uLus}H!oygolzgZ;E|OD0j<@Ho&l
zO`+am;w)M3`EE3z-lFu9Ank1U=+MrL->o@>aenu*32dCi$DUbjh;?`##>ehk85XQv
zk!{E0;+|pdxy=<glB1ZRh9DH}z-mLrkx9s(c32~Loe&s{cCaW_2C~Iq+i09H;b+J*
zG#5AS2+yp}8|Lp;V?VEgH||!Y({l-FW+-A$m538T+2?+1@yV{mkj6(;OV<M?Q3Sxv
zP;0a58&D!J2k#wgkt>w`)02~^3@B@RQ(k4xQzpyQFGR_1w9qiZmS3VjJ-1vdcWaBt
z^)U5|PdB^Zr=9U%PYV%t1qUNmFI_!qrcs)vz(Ba3PprBqtIybbdq{|85kKZy&i8sl
zugGA0Q!VYI-lPMYM`u6pQzki6y9LXwdSjUAOl!%mI~p#Jj*OV{Y9b}fdYZfUn5dn}
zhzRLZz+Vk6r~VZ~3jY12B`WRl9n8}eR#4$uAo5!V1iSaanR(e{kEm9&KZS9S0iW>B
z^NjjE3rI1qhEWHv=-Ssd>J!W@D96#2J6${TY?uVXQr7gj_4MQCvq$)=hm(%l6RL7-
zw1SbMO_`boiXv$AL+JW;S2}0--l(!gqk!0dNJq`oYb6t>#st6yx~tnR+G4r~?O$!}
z<_7TL?A|=wtYcFwCouvCzUYka3pa+;*jWwan=jooIK360Sf2Pr<J4OG-X{?fAM1Ne
zP6;u$UlVA(-+>7s-!*J`Ttkzf(4wMza6%~1qH~EdnAqB(DX|tQ3EZvvIdh{R2Rovr
z@m|cuaM{wj1z3iTIC7_2ffIz{Ar^bBl{`LyLY5chF|=J<f_6JY`8xg^A*oK_^3UTa
zm&CxN<*eMeJO-nvqCAtH0sF+pQaw?hq39x^zYzK#ejcx1B6a`uwvmmA;DU^7l6cVH
z-!tMSSa{-KpP(`js9O=&Mt+U@2t+l>oU3ed;-^K9`FTavwPwY`4*-40Kb@{5N4_-2
zWAS_XKhw%QJ2&^?46uMAi~iYMJDZVIvfbknf?6pQh7&!j5#zQ|kRL0_%<TWl;$KM%
z5qZwc%Q$?!wpHxz0^8^zJXUJLJ)(4smlZwKAzf+2vdKR)KL2Cr0ojNUXli9lIP+h7
zWcJN@F^^kx<UEpgXn(RD)-srUi8Zj>v2r2~^w9t*%u20`-K^?TOP$<Ko?uG#PP9<$
zL<*>#J5fH_v%YzFz3mvCDkjS$ZwFzlBCi?Y-h-<9B>o3;xi}NK_2%G8eN%lkm3~ti
z-C`>Vs}etAD+&I7ehRu@ml49nY=-e`!=6e4zQ|7iw|vWyrwjkF|4ATwUW9Vp^;g9f
zSU|e%d?hS=s}aHQ?^m1yrcr26fHmJL<84GR1bmgA5iJjb)+o_nAxz8pzn?xDiSovI
zoYU&mhyj;Mo2kwIhv2oF*;kM3p0d_CQYr8P>+Jnp+V|3P^x$}#G11w3Y6@mPo=WMg
z^ky&H`cu4=#0DTShI!CA@emp6sC~pAU?M&-8e)V9y8T<Twg0bB>b|lHDe51h0yx-y
zn@wT^e~U<Tuq&Vadqv;WvEF0LV!0(2_zHu%98Ofwb@~Z2H@yCY5&7VK8iNLEvi;$A
zelZ@u11dhNHy_m~F7w0)kMe~*<;aUp3EWeniBu+Imo2jWW-m;@b$#CH#!#ehl^|YQ
zGD_EF-?|sB3?fCKn6C&uG_&SzOS2vJ?TzY{O_N5qlYWX79&M2bGJ8~bxHc&;zEDYE
z2IeV|R!po~g+suudLrv94euwSud_9|V6ATM;P|zb$Jc8;TqVI@G^^Z0^-_N#+3x61
zNNC2Oy(RHZvi<<Y8$V6+4m8`se-F6>-n)Xg7GBssS_()Xs@EP>NrkT;K98>Be#eKH
zd{FWXAy|gb4l<5L7Lr`%GAX0KKHYOZ`f)jDGKv_+J?o&lC5*=mX;d8nh!003=en*)
zA1yWOuCQVsBu}Dc@})0Tmi)6tq&5fN^eRQ-viE`>oAw_#sq`-S{b6_{L7mhykxNV6
zUP-5AG}{R^4f`G}@_Je|FDe)mi9=IEmdAddM5y$eV^LKH!Rm;!rI?WKiY=0=w@&mr
z*V7=yuuGbwrlBVd1v7IZrJyEF471aUUCA5RC#+Wj`-L2+;p7Dv$O~6oR=kfJWtP#<
zg03W2#|hidkQNKbSypoA%Py7LDY2|NryS<vHlTlj%WVcmm{rehA;xTZMU9Y)-1m^T
zY=|z9wzRoDE1xqa)p5aRuE(puSCW<}t+c>T8bCQxW35ecV>Id7yUodOPa?xi68%?;
zC98}AJ68I_fyg?7r{0d>PnYrT*Jc$L)&7X10vF?i@!QEELiX<g;v9>Dc{v8i7#|9t
zXH^uMqWAZu(u&p+b$mNakQ7ElF#m9P+>-?PujTP$e2PkcO)e=DX1oN^KA)se?P{sF
zJWnj-P_{g?9VOf=QBquJOTgj@$#)`umKvwTNqcKN2IN<PuT2fIDN=sAx<E>{gpnZw
zU0t?!mO?6=2v<Q0*9n2^hoV~F@HSU;wBjEV)NeD~$_XRWxIT;e+-J6uwkHeG=UG)l
z!nxr(qB4|}vl=@;-!z6k0q4H(jMY)U+EcC47_|I74kviofx%PIV)6Ltw*V6uApe2L
zMgLeyvEUGa7Mx94dG5U?o~D<c6FZjHj!JYL>Yk=whGv-Oop;iCNJcSXuAo}Zpjupp
zZ+P91n9<ozKXJU;H6Nh|eyb0c7Zt4G*xaqxwak3+z-5?EtOlq!;FJg?y?(~3j}S=W
zhtAe_Rml@Y0{v}4em_!WlZUNoxCOjaeTA@{G};!mzA*PxS`i(PIzMWCsI8!J`YDl~
zlN1|1_|P?7S>K!l56P9|9anY&Xz~<3zfUYU17+YX*C!*P`Uz4pUg&GbBxVJH@<Di7
z7L}&NHlo!E0+ty)E@01b<2!UgV1`n)!ep>=n6mOqc8hF{UyaPxJWFw{NO52UO=g5w
zg+F`<#1y=}-3X&oMG*hSU3kTKp9d{Zu1{Ssf#Vq2Es>5|<&I&4H8Y=fAcvxnDkk-y
zW16nGgl*hpc_UVu&2C$SadOf*xVADGtQ|6q*L6QpTO&s)OH@(RqKV-7nQ`Ofy^7s~
zIaml6|GP!qm*;7#r}hZmrsech%WYAt7;;WuoC}jwOJ}$ZM1=UDJ=(p@Pd2oPFaEAf
zX_n6Asc?wCB2&8({=u45-@mLGB8dm*GTa8ptmK#M8x<|c#}QaXHu4wH{2{5cG&O&-
zp%Fpv{oVK1iOyBtpp~e~v{SmeI_~jRO&6TvWmv#ooMc4W%xk%5qR)=huZc3mUjJ^g
z$C|h%VFYmvcyP?Y1hw7(a~iA53075;3E<?qm(p}6GtmS^6Y|N?u?#}r<hXQYk+8@j
zflJuZMX6FKbZZBdiJo@NNuWJA5*!`EG`whQHAlZ0g*&?}C;F^e&FiveI}YeVYhP}E
zj+e!s$I{nj#F0Z}4-4D7OKJ=T0q9~vBp7kRsWZ8Igp;wkdf1F5g2zgjCWQIi%JFWo
zQ?Emxi#0{>NwddZhd2|yzYgucAM*Z8Jfr1?jT_uIWZ_n<tYcZuTmjTNqcq={S=!X`
zMf)T}MM80Np&@R>YT$}VV#S9o|L$tA39g8}-i#PGHJwLLGtG0vPJ=sQpI%q+4ptAU
zS$xDNzB#2#7;FfgbHcvE`bI8jPk%hv056BqB_<N%ntzXwfM1JwGs(v%3^R<fiQrX(
zBu0<{zOc`~?|2h7MCGlhS&&(303J@t)NzB|AvqC7F|mFpi@ijGgdd|!tcY55lkKGs
zni6P2_(}x@mPluqg0FpNFyXfd{dq80)XXI<<)(+|7x3wum^bKA&8bfk_gs}FF2<j9
z&-u~;w3mq>(-v#l%{LXJkP0phuR+egm!*gy6biA3drSC0v$Ch5=nUgOZ~pM*&iy?~
z+w?2CqW_D;62G-o$lX>1r^>cZNp$&5xHc3WnUIRecxCkatFiSM3q!Cva6-0I6bf<^
zM$`;WIKvd08x?@>qAKvcprgZ0nw)tJWvS2!fz}BpHre?}_bM~5;twcr!jxwQTcVHt
zhm@-?1@{XYDo)y=!Z4{5r%$Iau{kLa6G4Y}oYn_wj@bW?5cO|OAFa(!iY8qbW69{u
zM}x>dNBqkaMpi>`|B%F02za3#qkcpJ*$*bI4`bG{*i&V*U#rFLGZvXjasz%)GLfpf
z%J>q4pWp+I7E?9qcQFfP3A5%$rIObtpY{t;A;o`-{H`IPR#%I%Mw7L0k>W&fehhHx
zSMTvHYE97!r((|me1$bsCoP7^hiE*0gPxk!%$z8zBFaGc4z=7HcdvD{DN#TGS?cgf
z{^CT0-e`jk^cnrP?9CLno0s64tCr^An_4;R-(<Hi0&VYd{rYeK5Xqi^G*{?m3x~L!
zp4rjC)v^cyIiyl8UD%oC5IF&L-g4u{HO)7_841V~(-_(aOd(jdVjo$Mv+fxmICzS?
zozHAnzCW~!L)(0-sb<UD!bcy2AKS#=Puuwmvjzd+W}~<OupB~vhNXSj7C?OvL-Ef*
zS}?`Z$+xi3ssTcs(#fup0pq~wzB%AD1HFzjg7Sg*kE!F6Xp@oHwCrLv?SfFYyCt>?
z<rxOUV@vBtH>q`iVnIr{r&N#b)@g7nqmONj&mKeb?F%uscg(QXPYJ#FwzT)xwt0*w
zd0o1<lrC|FyhWzOg-Fp*V)Z~ElNd$rLo!BTf$?4gp#w4{x;r*jBe9I@e)*cw!Jj4K
zzaJ)uA4VrE(>%`~4>XaFG2e8rpy60psp9O7fPFxnxdiEXVMSb)O+QGyxJUVc^)!(`
zc}+dYCOV%ztx6jW<vrDuU<;5zhWDmPL@37e#EuXun${JrBIq(Vc?Wu*-a7x$JnH)7
zYqh*(btgN?kSM|)yps2if?V&XCq6rSfEM+iH^(yD&`l9liu-UugZ@!-CLb$^u*uHs
z_HF+Gt0>i=Xp|q?camabMG?0j@f%zq$*!;JJh6nNGt&g0Hkwm|3ATy~N=0(tpHP$~
z@99aWiGD1iwWNM&SppLw(W7(6h{dPoy-vr+EzSLoC>lml#(m`LmTGN1py+CpVU+nK
zy)PCuM!jd*dk9ugD^$yS`)wzBMGV1sEGJk0+j6e^gQ+<`K^RAR-{c3XsP0x8($RcI
zz6j7M@{NHRoBeCw3GE}eG43U7KxBxPe54aYS&v>uT9iBqal%c@G{<-JM4%mcbDn6E
z=fIlbfx`Cthh2xP306pumM(G8$?F%Mikj&ubCGWtl;&vSus7FJ(@YSeDUaw&0}@jx
z5g8^H8{nkLRA;i=Z(&uQZ#88k)}*e%<sx4CGB+`8MDN-*)pwIeKfKHOL6W&=tvj;n
zlb8zpwzi||VOPex>Sef+^AUCtwQ<G!l*5jmr;Bss;8d#qy{ejhN76<#Vpbyx8;rUS
z&%IlAFKzvgf&SG{%!MrsjbRAusT~}s9O#gkfi$ZKKb+-D<QQM<Q?zif@<>W7S`Qw6
z=%D1Ze~nEs!lUs0qhxaq{FpZ5n5y`y<3a22wSs5r&`+?<w)i9tZ;e_C_+lKzhp?qX
znCCVlUK6fSBRRZ`TRD1SiKRKR4Kr#&zAP6lXDEBz5s1n@fx6i?v`?9~X0=}K_&Z;@
zg<th?uQBr_+KeuK1m|;9#vk613jaiu&~Tq4X%q1SUGR0jHeFlw$_9cVr|&WW2S0^>
zPP7gcDahi_`Rm;6|Hn@G2v&HY?M$eDc{fdE^sHW^ZCS;n<U`K8tX>SHAQY*`Zl1te
zQCXD6zi^Ts=i#&hcK%+V()&ZvO&kkWKKWy7pF5NWGy6Bg6A7SBWxGcA0GJYa`8^q6
zK6fqxAHe1J&GI+L)s{O61;cI?h_RnwKoHoo;Lh`~qtzbdaWK57U*1CnP1)_TYg;?;
zy;#wfMyS9sg*Jw=-0lQvXI`2}9DX9q;x$Ma3iMr9(wZYTbACa1Xy#Y7S*Iaq<YBes
zcwCV=hIrkTKx~mTPf*8ep_Zq)aMPve%=J+YP8{K+i2VFkL=P}O!qr`|q9OuDY^77M
zjD~>!mJ9+G@BZ+9cg<S-SYN>Th73@}!v4f_T{e)8AhAM0$uAalJ!kTNC=#QWk4pt@
z%Lnn`W^~3CAx`@VuKaqGpfjWiE|S-%-u($fsU3yEUZ-YXal|k9@5`2mC~%n)Ag-T&
zH=zknRNpo~96)jU{&TffuZs<P_m{U^vBP#m63LI@)5T$J(;}5#t04`Me~=1+`L}>B
z5k;(&ZHp-2#i`KN60#!|?&na$GfUIj+NM`E!Sz)y+J@#c5ewt{bMfut|FLvV;gN3L
z7LIM(w$-t1+qP|YY&#v>NyoO`v2E+r{-1NT#zoy!)rU3L9CN%t#Y_U?M*)P*Se6Q2
zPOXZbgoWI@1>J|^O%am5B}l7n8mQ)1pK<QwD|Zx=I3Sa6o-7mZO^Q}XbgK{1Crxk|
zVPGA&4y{!2#4qV@<jsx(Bch=q*Nm<b9E6cbFl2|{!ak;sVs_a9o5VufcN0#6wL`Qr
z#DdSNkv#fd{JoWmL=krrw7O8lLeBl(pF%E*r}0BA@RkTse_L%F?PXocK{ip?Acge9
zvWLEe%&u~N-ty@~`)MssSZ5894%M=%A(Po59gt<3wGuRn$455LdUlb~-$}!I5qXQE
z1_<vf0V~>fE4g~30k0sV4i2QJxoW^35WdGN4E$}AA{yz@G$51eKh(;toS@a<k3g$c
z6=Qk1^admnJE|%0FOJxN2T6UgefTrb1fDM#)B0Wd2UO;|S{V*H&rlB=nH(e}NzGfT
zoA1^9ieVicBvWR7sp+x4T1F>MVXstk)7=%$&yam{up>2SZgdaeQx#T}pBi8xm|zz0
z#ytxT23rs!IeQQYlWI_*CzKo86b<q;zuG$O0P*NHj-L2Ue@5SW%Kf$OTVN<t;n#wq
zzvlyxf(h}Vh?O7w&Y$2y%*4KA`tcb7huo+;ZJ@1=3Mtwt8jv)%ij}`wS^*%(Wu{S+
zUCU}SGGvRcl;Vz<X2>TfFlQQ4J8H>H77#FiZ38yD#Q`g^@YyH3rB}lWZOq<oC0d}N
zMO4QGD=S)yxW$$djsQAG{Pmy~wgwe~Qe<){);)#R$kDm^kS2);PF*O$5o>jc1#N@|
z$XU+LnCXx5CPPK;g+U2L(M}zVA5~W?S%eXiJNd6AM1Yt2DxM7S8sQLxfZ7ZvIMhve
zqqE2sy?i>*@*=#EeFw;xb-*!s7$eC_rnunsc3(~L;-Le!QIH<vSu3GQe|=>`FX4ga
zYCwc#gkRrkr8Z$$Pw+96$wp&j|2N&mjSvJQ-icN=g1P_in8)wq8!64elzE2`987AL
zqp^(l$h%HX24w<{-hrk+)A7GkBywtCoR2AMe)espYQiletSBnFqnrHTV8|-IVw!3c
zFX+j1xMOZ>Ps9JBvqL2ykn*xOkgi)FihG8DoK4r7Rtb@Qo`OqSieur!uSQ;^=KfgV
zf=Pzh3_VS(An0D>FjFPeYP6>9w(@YyDr5mK^zpZrry|i`9#u=q1$y((uu&xx9si~6
z-h2qpf~0>4seN7&eJ~&dIUIediE<uEdTAc{t$`?)B7#vWc$ii01bH7!w%#5(214Qx
z0C*lG0jfi>Iy5m3=bztp78^fna(_UtfL-SzlYWA3cCectm&dSV^<bQ5|JMFtRZ56#
z840S(wX0bf<^8w*y5W^<{nW`F85I;mDrNwzc~-CwD84^(A>If+LVn>MNjOF}^ePhN
zi=QkvIH0AJ;u*=AV{gP;EqEDd4;H=2gYD)EJ?Up}r5_uN0r8q^W6r(s*6lh$KD3Y#
z)$QI9j;*?z6y?Kue&PtQ_rMZlQ%UZ;LItTmqu1ySwKv_Z+tOwcEUeiSA$!9iufEFG
z)%b~`9d4CKK9(EJ<6!;<Ni9KyS7r;APMZBI4%KY_wJa*siI8-GNunr)6YD|-vJgf9
zP9qg!!e;$CHY5lEKoGFkk?o!=oMWNDDAS2T86xHti=z}r1;UkzfY&J<GkNDCni&&;
zrjqFZWtEe8kwzClDZ4?+^dbqJ?<u9@XF!b|*&=`aE$87n-(W`t#h#e+iu*YNyx)ib
zU6ohz3j%t;`z<}^(wGZ=8B)@cJXqFaQvydyn~{t}(hKbM&z$r&DG*3PwlHmzM4u8{
z8%|^yGC&G4c7BAlLeM3E(;|~;A{`uPxWW@DeKLr3>#6ZbFdvl*{E$dpZuQ%hWb%_H
z9g%Y&ql}rq$4I7e-cDo*1wl1tntCn3r1lq}WD8)IxEA?DVe%-o$AlfIQ(Cj5pbpf?
zFIn>@nD+@Rrr==~lAEhiJWX&nL*Ao93FQfYtk#tX|AsdE(AO`pO%R;met<EftY#&K
zKLnp3*v^DbfoGAdl+WQbIZrX{QO^woTF|;6eww)R<lNKgWkZ%E493}duQ0I@?gb%{
zWN)wU)74HqbpQsDgq<oyw{|c}Y!62ZQneB*Z=|sHbL622F3}`w$II5H^O1uaq!nNo
z{ev;7AHhO;_w0s|IO&H!0Y^VN#25>wd8CYUAMxhwPXC|B>QNd-^U(O$Pm&pLObx0>
zAVtC-4BuYRbY=HXCByWeL*-73W0yJsUFi^HB^2^`-6WYtc1hCAXkCSaBwP3eNv_u$
z@^xQU!!LdXE~AB-7V38J`<~)mjBsF^VlzjXt0>T}3zqg$1n177zX+h}ij|2ZoXu(F
zmgC_#FcY65m&D29KYJp~q6wH}>zY>eCO1#BaG)!&wD9h>P%c!!Lfjx$Opl~gE>K9S
zo4?*0jDnUjnXoE$q9#Qki9-HU;$8zpxbn6o{<vGvA<&n7u4+k2+!f^t=-8=0F!$8B
zws*wqG<`9AI=V2nv-Jz@_`E&-TRY}3NrXm_@$m+O)%F6*P-F>M;%rmr0|@>CF_L=~
zE$1&<5jEp5H`v-TK>W%Zoh_t85)-yXCjP?OQ1^91n=jeO0>tp5r?UrjoMsj&fbeRN
zd0I7|)}wFC&G;>Blp0uq0?}&bfxZKunA(3x2BcY5ziEqFA{%c0p)lGFn04(ocE)KV
zq=!)mz%W#4$FG?DvAfpBb<5g$p~zBF!U%$@o)Vd^Rol211P1(38~4_=M(b&97utmV
z2~#4rLBz;N>K~xtj{^i-0euPnt7lP`vlA^fz8G1EwcUqJ(zWXiQx;)1slFIwLXDQP
zvE26MCTxPh3v%vEN^I|1Ohc=Y;PE0PU)X8)z2-7Yl5C9VM8Neu8%2CeP$hzuXNU0Y
z0JzwFm=-gPFr!{z251<)clfqFCed+ZgG{$$%p;DHg8P)7vWLfPh_+&IPWmBDL{)Vp
zNQwGkW%#CUg8VakOZH1-<Aac4<XJqOiSbvE&Xhmhnh}^(!;YJoNH8ERhESDgYX~QC
zAM~6Skn{)C7K{W27y>|l1N??I$y;7*-yFAy1;8HYP8oZnE$_DmpBouuu69Q#>~#Aa
zBmkjZCZw)VvI&)O8cx&PVR`euJPIaM`Boe~eDn9h9z=tXB$!Z*R(`=F-v7A5qi34*
z!e_()XGiWs_SIy;;HjSiuG~AfP~iMo(*KH$>n<zSZh#=<bHmDUf1Im+MAq7w2yJmb
z6zmL}J<=+e0AFrw92g|r%WJS;wSU}e!~n@Xs|1fVrSMZRBRX|JG1hDUKhde!RL5jC
zKwwhHlv-<+s$ddO&`UG%zS`G9XHfkDc{v(nqt!iT;y`+Y`iuozz==fLxzG|W^|?Wj
zj5g0gZw+Q66fa~7=DP-Vu>}=7KmZzcE?2*eje8NSjry8#Kk0aS0(m|O@r8`=^(o@p
z;XlUlsNpq<qecDwTf~6S_A$WMBNj40&Ss8q=LneJWm>^(FF?17G^=lPl`D#*f$H`T
z%yV{=%Os#(9dw#D0;Tla+whiAE3@G*X%2ix3dtwfU&DB^)<}tx`*!VaA~z&Yf-CGM
z@6`f#^;N?+yG$u%Hb$=>R{Cg}?}c8Y7z$+QH&|uKcm5Yf#MigKL#)@R%cxqQG6R0>
zqs`Ht;*Oc=+B?F<g)yh3b`1NsIadzf1RutXvX83aFQ1gNT_)Hc$;7Kmr9WYVvK)$g
zWbkhlv=Hk2QYYPWsJMUErDLFrXG+}|KS|BjM${qNR_<(`g?;P{*J)=$oj3aBXJ-As
zrpfpbN}KzLzxe|M@t=Pr&q-Y)M_(W-ZIBU-9!O(|tCzLlI5aRsG(Qld`%C!4iJy+}
z$Tp%ear~1A;}LvuC!mxah;cKgehXp?os;8o!@RwRvIH;5a5(Eyk$%kOna~THQDCHR
zIQ`&B`NDZI441l2dDI{!oJa4bx>5`CIb87rZk>gj#ALwp`G%60-tbN8M1k^Nbuix`
z(cpjS>;FYqYV*iu1IC01v#(%ykP#F`6;qp;z5Mkh^JMnbG!Zl~ywDq=mPZZIp~Kxb
z@VgX6l+~BePA}uGNR**tu{W>RYDqYn4HOPIE8~T4rxTxq>+%;4L`=7!dZbNPv9vgY
z9T*$&pmRn+$6Y!|E#L1viM*^uYU&lI$P}LPHzCGR(FjB2I=Q2UTI?5u7UNY=-uU(9
zND7`aTCbIp?P;U>p5t%&Gmq`RH8m|<|432K76$zdW`zeBax+d7_<dad^lxNBp%J2I
zK`o~{5U2`I1}XZz9R~^1B2^N9S2_?-v7uJdMwHx1WHFF4=9GPg&cXgNChR&JUh&A+
zC2Kg=Cwer0aDdm7(+*;+e?|=+mO!`tUTCg9U?@Br{p035pjU*6v9Hl8>k-ox3OT)M
zNi_6^$dF|hLJuPy|A2f|D2B|PGk^1TMC`}a6-)+UMD$3GIy?j*3`HOy#k#HX7vv_$
zuVP?iY)9=ETaRns1S};9y;XG!EG5xLfi6dAv*^U4?jWxdzKvZsN8#Dq|0Y~dc$7>Z
zBObSGT0+eh6}-9&G|s4g8ncP^oCQTA^niSOwrRGV&MDU;wQix(jlkL&DqE?WZ<L?L
z7qLd2dxc!MB(_UAZZZyscNbV_vgDrx)3F^3zSo$xhzi@Tw23`{mbz<D`ekWM3~6~c
zmG)Rpi&K!w>CrqrH{mOVZOP>!Jx6w1sSHx}&G&7aLgn+<9${5LJ{DzX)dH7X@M!+y
zW)hChi70Ei#jZ#GgqmKT6EbxaIrC-b4kWWt13$0mO!Iz^dQJ4jiYG1mHpLS|$(NUE
zK6gNc7avt(|G1K+zY;`x3pk~nMAuoYyH!62x|O2fj<a>eFq*Z0>SY9ujY<G!L+<$;
zwHeXEB0GfmKWfO`9v;AZbrZkZ3PA>kNF)`)Fx6P5YcZpr+KjW_64Xs&rE{qk@+E0(
zFXZ-^bTFhF@}`+VtmCXOHBGOGzsK)A&d2=n^QmXC%1CxO%87NG)@%|8e8R{CFkiW)
zJcj~Hl=K(xImH5o7*;?c*uw=H3+IQj2BtwAIR1^wpxQ`t`mnKG6v2NmU)*mHO@r>x
zO^sq&>DR$qITDgjUpz_S>{a3Tc4M;G-1TdOyp1{9Ha)Yvc3#Kq@@KWA_iJEWv3sx2
z`2SgD!tbPp?_fJtvHEH5Ul!(1buU8?FP$$I3goq4rjlX+|2FUUH6_VSI!wX>wIL{<
z_gfMZ5`tJjS4d)Ai%)WY$FyQ1j9)xiP&WMNo+&L=cQ3)mSILol8xgS!q_$@xjL(z%
zHjG{soBTPr)Kvt4*#HR`Q@s=bx4NOKvy{&MB@nDrTc)v=LT`xi!XSez;5+kli1@?B
ze74*3L+vFF^xd4IX8R}flgg4X7M$Uq9~f5GaP3ixo7vGnd1nzGr0(fz^14LFdxX0%
z<e{$&^X^q$wR*M=J3iMYe^i)cx=(%`$_5NETqS>uS1V@qcIDHNYtyH=e>cbClK#h~
zbE5sU_+V!L**$DO8j&n~WBpD{K1jnQJsV<_jRVZF<oxMR;hoOw{$7zZFq6(RpX3N{
ztIlUXtCD7b8{bT#_6loLI*%`T<yX9>Ej{~n)U!Slb{P&~`HXn9ZRH=jL|Cr`Z|%At
zhRfWD*%|bpwYWxV^D9pz0MC&>KOYmN480DjD*1h=k}07{IG(3!fLK5uWGEiDswjbo
zV2%*FyS<*K7J0vs|Lh^nYG%QjGl_aJr}WA!3-VDS?K#6rpXzFI9eo!-xh-HM*CL+y
z5pd_x>n~$V?&d2{%3P_0fV0)t#H8M?CwKU{8Z|$O#I;&WYP)&bNLSBp3~2`>=dL2w
ziK8dCojs~~z~B`e{Q^n(^b9taD*?0PE6_rFgUbRNyM|*po2{R<h#TPE7bg=K<j?2E
zLrAEaP5FlU@I7|q3XF~5`-v_{ClvdbE+0h@uL8Q-(2n|M)vjJeX*d|SyqlL%HEdq%
z5CW~OD|oXx^hT^Xsk7A%;1#?`R96aW-A*-SDA-OMpKpzu0{2x(95=Ebl1Z7K)h<~&
z^7DDTC-s#fu$~g09l+0=eO5eJ9>wNN`615jsRX|7@%P;IvofBRA0S0m{#Nr%fEt%H
zNDV+Q6CL~9^LVF`k4kv1n;DS0kC7ZF)0IWlVh_ug%tLMmrzo=KT|7piuMuE?yj}NW
zGR73J(4qoHaeuYB^>AM}?HJ7Og}VXV^C^RXH1IiEC3fgNz`hmofwnjs$30Memx#&9
zIzQjv3X-dxlj5^R(f@I@L}fO#S1CY8VIUlA?2r3&9)Fag)|y0j;-ge3&UBXBrMTmx
zQ=}qkqU+{4iK=9XC?;vkLuDO$Wg2H>?YlOA|7pfkOO9aWKb%oQa(s7ZOq|vzA0t9u
zajdyM4kuBLI*Z}KTl5hQCsU4il`ZgKGUSD&Xs9D{u&*h*tw=zRFvBmS{Oa|sc|iO<
zXo%J0;`NQqo#w9%xv+cCq3kOvn6oMo3a-&WK2d^Gd6!z{2-t;C9F?u9Y7M$QJO>H4
z2x5{;?TaQP9{626s_4l*i}(Ujf4Py{2NGFS0wx0W@y&Cf2oGD=PWvfjgl=#A9MM*f
z<Ct%sIJs~qF+qhj|LI-lJ3%iIPx>nJh67gj>JPB8Jn_O;JklA_kCMhCyJ)AQ&;pS`
z3V?q%$OIr?vyCzz0BTmym0K=X+!DS%u?@E9lHziMbV-|+bV(VoE2|H*hZfrY-aBsb
z1bGrkYlG4JsN(lR^ze1)Z#unb{q{7%aij$jht;(Q!`JRK&q<&K@@HNwKZ6WVHfdYX
zF{{td90A|&CzVwoZHk0JK0@m!+-84vZ+?))cHh8igGXQUt=n|qLwa4_v$rX>Pn#Xy
zOhE(*(!V+C?rm(w$diP6{I!?%N-L(z&?Uf!6W17K3K*w`Yz)vERDT)hZzG-%*=r;3
zBw#<0PvM3y8hgGV651?ZY4y{~S8<~VAL85bi})ssmPaNN0TgnJp$qi7L2;%5Uo}c{
z4)1r%+1e4kuAQ1>|F}pF*`Q{DZ#?8L^BmP#Xsh@a<oV&q+g@?eu(!&lYBQ=ofAMg&
z(%ueOP*qT%S|#IfqQ-%gpLcv_2>E{$0aPxd9&e&KmdS$Lme~;v7n%WHimPfr@dCA<
zSU4iFUpD#3mcv@j{-4YSU!7k7mXK1?5D}DUT?vJ7`_FKzJL{Jupb3FkfL=^8=lbBI
zmint8umyP*%1`$OZHVukRl%>ikYCxy5XR#A?usmQca(gqq?Cy)2F{c|+Z2Q_y(oc+
zB>@$?O&lrszA`Z=XRN(HV3S?kBA8GibCh+Ow1^Y_f$H{7_95~V{@96a%EYh^xx1e?
zjx9d+H(;OMndolk68Dz^7kjrDpkh9e@7dku2wGh={|FfK7e#1C4ucEWi=F=&rCLy{
zJ8&h86qbr4<#SUms`8K4JvG6y;yF*h;TVp9k*Unw&MgORfl&+*C$x_EiqsAxR!g4#
zv2KAOY$pK@$&;X8rl}p-NlT}{IaMq%&qh<d!t3Z86-mspV^Iv}EoJ{sq!H&>*4p^-
z`Ly`4;8XGSTlm)3{t|QfyIpj$Q2VWNC`_0y6Cxhv@K0-lY%ikdH`pw1h29f7@~dZ|
z=dsk4^g_`x>Y1sJa#vD|<glck`T<p4r8$sT{B1z9gj<S+8p|!`XG9b0*#GhnGyfr|
z0saE>#Pb6RSWCp+zZREk5X5JT1a4+Kfb5C*ifq2~BII}5?(?2Qkxlay2J;eWKL;jO
z!u49S5^4YVsd7d$s6DmRPl5`i6|beAuY!1gk=+&A#<_16lsQuSZW7oneWZ}gH+qsr
zMXX09`))tj-*Ef`1qS2pG29{g;RG6u_y-dO1`_#vP?t(hW^?%mvlUMiNZx|njteK7
z<#Q3F5X8nhP4CMvLIFR!48k7EhOa)Kg9ke*7sX#C33jH#mX^X?<9Y8i?eUy?_bnAU
z&z9xV9;qTF<#jt$$&<UJHB6d`#}u7>uQNNt0vw$4SF8U7)lX~fi#F@BLu?;GVpv|W
zDCQw1mUtUA5Q1axiYIB&L@_zCX(1<X8Y53bhRj`3S=<n-U~iEnY*1r4MGo`}Rj~wk
zM9m2Cjx6{hk!Ru|ab$tMgc6J$pGdpC2lF0qPqjF|O}@i<VV{;kul!|qez<?N;R3j&
z(X~rUePMuEBn3Y_A+jz#py6ngU49?cAN1{ji)>BB%eBRGV<Dx_u{gdfBv=d(A+d*p
zW)V89sDkdsg@0}d7w<OBdIv9T+Cux33mSyt7j<`omh${rBK+c+qNXo^*#Rp55?PYQ
zkB;iP0mf{=3Fq}mtG|rgv<WKuVR0E{AzCkY#r+P{w?xW5jEs7fM&d-rD0Pz2QXIpA
zI+rj2-x!Z^R9-rNtkh`z6WjXiyi_(1b5!npe}`k|GVcLvPag0g&$nN6gRwMG*>!sK
z&xCWSN;~5B_r$!L5I>I{+SzaaVrtzOCxN7XPzoB9J?GK_2z+DwY2-x5Xpr#%RN&vb
zdGsd|iQ{DkYrk{6ZNV($dOrJDT-4QO_-dg$aSSQ?wTkO!_W^C4@=raYeeN2H3<-~?
z9?S&K`pS+f4UjPi6hv(|M{UM`4NL;=5wX3KY!Dxc?zP;2UNT(Ig61MG!0|@bCl4)v
zf>3XbfM0q3Itk#b6*MoM%$1_*DZ{v)Dxc%1Sz^MqyCl2`IiCq2LJ)GZe*$&fmaicC
zv%JR*Maj%)O?2$>$^SFtwdXh_B}S50utQvlGRBBlRGD=D?5|VUnLn#&u;acmzJkXI
zxua??MkS+4g)Fvll#tj&hL%3+IPGkrbhs6Ung<hM^WZpQCT3|5F}!yY%0x3m#K&9O
z<!KaFefIa&C!wF<pAA^GESZAg6`6B&Orm*b1gkB+{76?7%Ddgw#~(S6sw7g>w3Dx_
zZ;x)qjg@Kq=?lh+m0)8S|1J#XEppIh86ikkZLq{L*L71Q(~J*wOkhGTfrTf+!%zl7
z6>3i)RPFDF-IE`x5$56-3=Q+uZ9{40s5n$xqkW&RF>Vn=`_oZJiGEKb>taF}5D#kP
zxU^Tn0JKPVklbAi;FM!>ji=p7otyy|98y|X1pb$l-_NMFU={ZhFom63+Nw4OIR>_$
zkTkjF2a5*dFO`p$?ngx)kHb7?Oj%dE%SX<ma<B^G9@8NdHFNp5^Djau+mZ9$GWd*&
z0)nuc+y2Xht=#DKP|)n8t=ypcd$+wCk-aDwE8CYo=XXNv*J@YAJkIb;d`oy)BF2wu
zVQ#5XnP^`ewPNeH2C3tyl+N$p{>^yR1oL61*0)Re^pGkXEiDLWm?W0mju?CaKhaB6
z%20iy#i*c}vpwnp+)4#;5G?t2@X6}SV}FtKrXRG&7|B@#aJo1UD`K<1QnL^=$JDIh
znM5ON^-Iz$B`I5g2=Wh4Btqc+u!uA)k7h00FlS6m4VmB8<FE_6rb6<YNB%B=spp6*
z79>DU%c}P}BYFCb3Vz8&VXNOM31Cu@BK^N;^uo<<?Y0<+{ueM|OMr3cKT+M5_lkC>
zV$KNLi~RW><5~tdP6x!)0>TVH!pH&s!IB#HN+#$VV4^Z>DWatp9|~QxAe$fSW#94r
z%Z;0mIyZKM#t6bWui|UlU+x6YCB%w9gTCYQ9-rUp*7+{ezp4t^E%Mnf*br%KU2`!j
z*-0a3c)^6)o1&ekE$K|p=$68~;r%3}_fwA~ETfBBoVNW?$pW|i{<h9#5ayS75VLiv
z?4SQ?!a2bnXykw@7E&i=@^@6j6;?OdM6M6>@g05r(D_A){D@CENs3p^V`Gb2N$QG^
ziJ+d#gfh8r2@@<%th9CTYov;frtFF)H;jlnQ(f7ziAws9S~vx?cB)lsAvwN`p*Ht>
zoGVr5t$E#NnF!S<LlV3;vy(R$TBhO)`D23}f|&RLSpUel1+Ac|{R)X+*Q`gVpZ0pS
zSPXnbwe8BBdkhvXD-Wkl6?Brg8J~#q(366th7wxCK|Q$;7e*9*M7Q<~8E=W2?T6Hw
zt9IR2;}u|nk%0p+YKNppE!c1VGfbm)-vlnqr3ZARoW=FeK}TYx*ez*Q*fwB4Rql+`
zxDsjertUH?kfTi;<UyYQ9%RE)p1cHDTiCTAg`dAs$VW}2vY0_tp#^m3RHX-TeS~M<
zBaZ(liIbOh$mEtfefciuj+(Z1w5Q%Ej;_CwIyK%s0xz>kp+cv*a|!f=jqi{xWa`k5
zLa)*?mJ(*H%T+4YqxwH7xsl4=&=6(>22OT0F){OPCcdRkGfA%Y$Oo*wA8l(;d;>k_
z%hU6-Tyh0iS2*V!`Lx+8oX&;swYzXdQkT?<m%?^i!e0ud_Jci*6=-xc$K%CNMMCGq
zRc7YA_caz-oB6i|vvHgGzk|ikX&g2X2gk-Z1uC)$u*FAKK2yqzl+CcPbskhGS*^$j
zBuDtYE7WWPgqje?R%YhT&kCMp0Igw3xM0OcY0H{az}XpP=6A&6IK(j!PC-Sfzvm@x
z?oZds==(6ck_I>x&SQGS!X^v`_2i#k-V}WxF%B3AC-&e4*n%-j<cu)HlEcwI`pa$c
zT{c$}I%?@d62hT2H%CWUUOw&abw6;*!|aC==099F8<nU{7)xp=dO8L})gUL<h5QTi
z*hAHe`+Bq)CFY>$c<zE{7C?wF7>Thl64-v58QkcrwG#M#n+4p!(zCE<>0o1}znsnr
z*I0ds1v~E+O?gLi*5~UV#y#y1N#Y2i!>3LEX1?^aAC8KgYzW1cV`m!p*LEz8hQ!IU
zvh)IT9?)@>se_^pS1{Mt48t{Kn&kWg%2gWL_rxq|N^>A1Km+E4UD85pKm*~wW6-n+
zl(*u{db=ve9dE77NLb|rnN;(1r-=~OZ^K$2t8<?{a^pm}&R8GobssIy%->=lzURGU
z?mlYa_HgIcTqzY{={eHhY3bqV9WE8!#%1Gp#oJ}+<);eB(Gx-#V1oNl&Ps~|lrcm#
z?wvr=Bk;t_(G_T&-tIkuPx-87?(Sh(;=U>t79J*lVuWJ;)*l2l?ii1jNVDAvIlCT9
z8C|UPL5|O7od}h_frbgi=>o+9!32uc0)@#44xQ%g=<3#IMVw;!B}^B=sw2LbAJK<#
zNN!6j+iMLTM>A-K5Jf#~-r61fUVaPvZH0)@+oIplV|~y1P9*kf-(ubTmK)THy>u{O
zM=NEzP0T4E%>&GEX-$qFnw7W(b9N=UK3$OKG|&+FgUx$^8YkBs_MvcuXux}c;ZH-A
z3|oLKnEASyxSlQ4vZK~5u%27VrrrYdT|N;{;|a0DnE<1fCt##V1xdmKaq{Yo_d{1d
z7)u0DI6tlhAZ^&T8#dj>e#?LCY89pD(6iaxr~cuXF(^78;OJ01@WD<LIkA+mJ<CG)
z+AkRMmoGsuDlpjuKV!}Cdpo%^NdD)b?^Z4k0suM9C8h_NTaXavWI2-&6U<)5?jAlo
z{wm>IG3U3+BdOj$V~yf9N@au!Dhc^bv<@i5zK?I!&K*IbEmW7Cnu6!%6(s-6tut2S
znGDr1EFZW^#)%$$eKo4adw`%D?OYKz3Zs)-$aBjjc?gS?BxXH!&V<uKb~tuR=7)07
z-AKC}0k}d3RHZ_Np47n>B6hu>RdM|-*9J$f($)ow0iRX6Q5s-`c4$Lr>ln0$uQ-#u
zD`*<tOF8!#a2moGd-o+Q7LSH&HB4%ubhmHtl%#|3i_YS`qnl=3eXA}}yc)fIs}c%^
z(D^OU283?kV!jjxUc!pb*{{MyOxuhhNt;7uvW0@<ZlwCi`O0C4+s?#iP#0qkvAR~G
zwcxS3gbEp!hdsRpD`RdZnZ=!y81APHCNL^J3MAter!b3;x`&7}GYpVHNDu=Wm1tUk
zNJ*=ruMt8xy&Yfc4Cyp?Dpp1-Z;{p6Lu!oEca0*NQ%_MV68O_fSu>j;Ho^WU<Xz#w
z@Y>!oh93qrHCTRXEJ1c|LG(w2gWH{|&YyD&^<@E#C%D_u%GV+jJ6a2xai+NLR!7Gg
zXh`67Yc3D(z0HAa>2~$O&c$J2wDy&d0q`4nO!$5;-sgkjM9yq_+~z88w>NV1_ogT=
zqMFXnBvS}g%jL3XZW^IRQ01zgUJ6(`@(AUbj#aj%7KOJZj+1{jI2+0nFDKjo>4P2I
zCBb6Mq&&jMoJLHpB@h_+LD2(X%SiCZE=I?N<Rr0LEs~pIsT;i}5(h39x$D+GbxoAw
zomQYxS>>RA2s(i#G!+I4fxjmsT(_X+I+jZ>Nb0yG0^@k4I%i-%9qRj~&>ZLpf%8sb
z3X>>r3<i7|>k?qWVB_hKk6B?132lseZ~@!0116+_K1QLOYYM=&L8^?U*4tX>C9uF&
zIx)oLLxlVmMk`OWlUGDd4VgrbIwj4F-=)Dg5wkXARJAepH~R0t4&<nvn5|o!o?=jT
zLJP-S{vmQbY079@nU251U>T;cJtpaBqAz8cvob)<%XQKvz?EgZ4YP~<H9?x+rI+`P
zjN2w1ebe1ZJ#382hzuKX3_&$H3EZu51(AKd$WNtu<Vt~;K-9ryEr5M+o57>6{19QT
z+JHh&o+R`HWCaz$u*7oWW-0K3=3p7nnR2ltYJPHSJ!ee(xVHq8tH(Zld8(2m%0yhw
zwnE;dRHSkKrF{3;Kuxx#Z;AXENHIl^!FsOqdFpTbQ5SF(5L8aat#NxQPC1q{=onK9
z8F9Ch8%FarB$qH@K-e&y$huGPfx|rf9x+@fE#u;X(;G8hs=>gZLMVV4NO;;k0mTF)
zW*1S7JkZs98<C+8<Q(Fm87DNQVjPoEh0Jsj_C*xJBpO+U_;dX##)B3H%tKdr3pV-v
z{GJ|-tCQ`5p3?7&grNaflR6m0i!IDsAjUjDO20U@zDhuPtaFZ|uM^=l<+uhP%sU%}
z$=5hp6TccAQvgvS?`kvC!R>-P9ly34S0}1m*L041v%Y+XyVVBut*%=AR4j0%Z&6Uy
z%fKwcM-8VTq{2Lot#UUe&2!C$N1An7kGk+|Lz-17cWJ7{IESPEn{2jG{UKh?igr+c
z%|5Etzt#{(Ir+Y87bnpac&^z-G`sc*AVvq=;`m1(l~VnAy@Pak=o%5;LUiwNRA&8n
zbS6%r%3YcYF{l-CCX~*j^Fo@kV|#H!lz|e~#A!-(=jEYUW{OwLd*+Rl5j3{pXjQy7
z74jk#GB$dBO*N|u$3eWZu;G||O085t`^ua{pEyeWtgx9r27F8_(Kk7O08M0CoXVj7
z#2^`E;#ZB-)@Vt}OD~1l8Y}YO0&yGX{;B(5K!yjnB)|i4DWe|U47jxa)_@^yW%3u~
ztW(8`3nRKsv0>?q6ggPd7iAr2yUc^bQ$*L3EOwK{NL-f>#Fj%B`p)qF&<jrU2EZrm
zz7_h`0+G~F1#(QLjw#kO>#mdPX_@$fn06$MDUx-qgy~{qcb?GK`bO`_V0eaO#74<}
z5W*DG>|txOQLyy;HD4MWVPrB`ri6Z3MrnBc6gnND{$}ZB;jxz^I?)j4q?5A!*<qhP
zrKz3z0l7V$gE_SGILZC@W<&g30MBRd;e1j@tOcudy^Cuz4}%8pOL;Z3L;8hZ2I}D-
zZKX*7Sidz6T)hiOJ02KE&n~y#e8?>5<XJC=DDYP^LJhGQJoarryn5ar4)@&SLuul;
z2N#YPuU4KrLNR7ERm;gid5x9ql!3*4Q`Lb>GU#vj2F%CE;rR2h%#@Cc4EH;?S7DAt
z*3s7hzUz7eci=xZD&GONl7k#H$w_>M>_{7PYfiz3a{m;IF08PosK`!KhZoqDr56o(
z*-S+9R4+Z{2?mTcw%{;eB<h=Uy7}NRbl1>(cGn3YU~4Z%=y2(BBpahv!DU|3%cg<A
z$!_+(ADeL{jWZOG1qyX5Z@q2PM-)wldLde{Rq0fSk2f>DQX+(N1dA-WnUCtsN(Oc^
z(R1;d1As5V+KVP<F`{_Zi{8=kTR)i__TFfD%7xUTuGa|Xg=lgFicO^K5i1&!N|9Lu
zJZwElMx@ii(JmrMcc9~Xl1hoE-!Tg$)A$QB4$oB@!}GFn9l`Oo>*|B^vOgR+#;Fd0
zSam-!$KRcBUE&6k$gWHD<+99v6(7e#aWvZ^TBs`dB(zcV*`G{ft1S^2rsXQ(w)$x$
z`C6iD+lkpV6slRafgdq6!@D<MHWFdnh?(9iTcWw^3-INt=0NF4#o&c6{*xSvs!t#C
z1T;cX@Bp&~&*V8%j{qiydufH;A6030!Z|2X(f$#HD_<qdeP~|~Mrd&ONW9smpqN4p
z-eB5COO7l~ao26Qi>7(rjkqVU5o@;i;YNMjX;c)Rw`g<>$}O-W-=VC8!o{4hY{8P8
zXm$(W$sF(HmfzoN(^{8L5JZ`ar>#GQ2R(LMpU`?W*@HAEs5}?P_^#2NJN9~Mb{&0*
zvCR0KH{tY{`8V0ev7zkpTqp#;eTrLk$;zF2ru|;$+w5tS9^jym!~LIXvZXUVEN$fr
z7ok-$YeD)!G%6r^{&svCVCdsx-rDySZ%q$W9e^C(5w_gI*yO~)5;eV3&&9w>h7JVR
z4nn7PVb)=;;o#ywP4l)4A+l#6t*TzQL($)fz*7vdOSR%km`Fw+9wPdJtH)E0zI;x#
z-$p<eHF6&e@QA?cV#{pmqZj~Qm@jQ{E9_BqcT25p`mrhOv&?N*UwfC<O;`{@YpH0I
zfPGr)H}TmeWIOC_utRYoTZP8JKCOQ7$_gQIzkg;(32jMmViz>@ChC;#AjuyMge1@7
z&g%88L5Ts^34sJK3LWT0>K{SZ5GKC~_8-9vF3p8ENC|2MPnYZE&zI>JIE!GPjz8;g
znI@8MlrPcb)8|RYfu?NZ-36Adnk<#Imiol-Tf$42q9Q+FV6<SLNs5};3$Vxn|FAeO
z9^l*l)eH-ZZC^I04-4n$`lvRh4}&z>p#Bbv9@5%@(<ZJlWw7C;)thJ*)*d%h*X<!w
ziW&+XuYRqsPEgm@t)wrAxr1E7WyxUb8!i1Me2((tMQu{l#c(O_-nqD(s|4E$BF26-
z!zJw$o?N7iJj_n#<nbpi>IRc)dryhX??N`Glkb<7KTb@1F2c;B))}FETCr-km7@I&
zjrA>{g|`Oq_tvLF6~=u3tW{by6fYonK*H@sHWK}MZczPqSdo1K44z2t`jE4C$y->^
zxHgSgsA}jl7fCGI&4N(~8;kXa%gBx+d!Nl9zrv7(QPv43W}0K~4p)^z&M7NhK-TGB
z@FX5{J^${vxTV_{GGy{N3Np^ZehN;1RN7oZd3rRNpiiz_bGZ`9c^D!%at4A-34ev9
z3@XPV<(3!9ym0ZK(;4~<S;4`yq(HraRyk$Q)79hxm38I(#|x=>DeBKG)g~WSZCX8#
zVz=ynmc6|J))GF|p|pR0?u)N3j4)s^9tPdE3ad=EA|NBY!fHvlWraA;Lu*NXT@rUT
z{aTR^hvd+)aiMD~VD@0)%}6fgT%q8-lrk|^bT2U3LK!4Qqq+CqM;>;a7WQG=gGVQ$
zSY(I&0#M$o7un-e=gQ`Y;9Y}oe~wpPROT|Ew~*$#sege2U|LvE{!&8q-#;d9Binf<
zR;UDm;l&)#9fz+RWGGF9b-ky?Kd#jQ^UKh#mW$Hj#gmIq$CL&KpqLTsM<?D7zw7)H
zDZU4Wjoj@8WJ&ce1oVF0<;&xl6E9Rau2+NPM?#P=Rp@a1?)$YsK9Oe3g!^^lFFm3*
z*+_<P_Ebe-W0{$B>GT=Op_WL`lp%<VZi+ewgGM3b8$!3M7LD;^D+YHgNN}T_pECN3
zez^>3YqYPLciYO^r^qE_36H0g>N*~$@b^QVvq~9$flGiY1U@wkUlf>AC0GkNKS(K+
z{bGTnVs;lw`Wg!L#0;E@i%wC9X9g#FVrGb34eT^erkt1cBIuFivz&c28TfS11ZdwD
z=ux5hjunibwr)Gs5B_r2T1YxNVr}PCocZ*0P+bG@$TjDX6@9Sjgg^ti9`n&L+M%HP
z_HScGN|Iz$koA^Ne^H13(rASNejSS<krY5|Vz%!lu@WaAkc@OpP-+h!<_3k?==%df
zY04d<JW!WmijB*pKy9&5X2}WE+N*&-5bi-;B*mY=*immsKa@4gf(YvH!?0#7;*Qk@
z9V__+S*fZfHb}{ylvY_FDN0iB6kef(f3z)`F{fJhz{J?e$S=wlIpl;$N$~Xf<dAw(
z#61CpjL16?Wo(R(@ONLK{1S`O`PA4S@`PJcVGbJ{{8=w-YEe7Q{V8G;g`!%OMT(NK
zdZZcNd*1k^vXZHG%|q$jR3+3_=msQ=Oz@aPBKxHyciNghl7Cg@<Yme9iGDS~LLX3~
zEoLkXg<l|EM*uJ8DBF1|*tX{@%7#dzTe%~$T>AyOQ+Q_T<g%zOnMXRf6l8XI+w_!A
z7hLF0t^cDn`eQ->K2tEA5oc9UNbN@TmCX}(&+w(Mx4s|83c+wyeLcF4eG0&&3qGbd
zF9rYnn6NtiLnd;52e#R;OOp1v`38PGH%4lGct+7V3a;Oxn#ZFqs;T$$^Rt4_#JGXj
zBcv)CKi6!kVN^f@x_HN7vCCru`V>=6vE+aQBAm}3Aa>J?_$Fg`LH~G&PVv^gM*Hp<
zIij#xYbO0<WeS4YtJ|)(x&tlx*vd#nfjQyc*ooD;t3ci`h~v26wr%h01pQYS>hemJ
ztD>-BRE^cBG>Z-?v&W<!vt4E(5EfA<&yJ`V?5X9rzrOh!$?8U0M4F9NS-J{U&Qz3@
zR2xYOx^#OAs&p$Kb2_G0@_Ww8n5EJ+%PA(8f};3_M^4%5g8l37B5zo=Go;Dv9--l-
z22tSS7w|~lN;Wjc31|%8Jg4Ssk#lc>GSx(Iw3?=31J5$ulBv+h1UR~ZO=FCt_Nit^
z!TyqIP1ZdjAmreH32JDLwiJv7(6O(gx#DdL#jrqB3{_I)Kk)L0PYpP%MrGa-D#>k<
z_R=T*^DD9$6?fTltfUrObR#OZGQ(bCgITu1-Yvy^nkt;ZTxu~ihT|B;<mGPXM&KiZ
z-s+1s=bhN%6-T}s)6E=X2JDWI>q#GwXsubJ$K~O^(}LP&s)f3wny&YSU{yJnLme;)
z#<sljokoIk1rUc0RwIg5g>oc!nX-v0I(m8zZUvUKnX$HR=&)l(bRHb$)>T!Wf?(Aw
zt)10Y&UWifZ88fvGO%RYX;4<WTGj05n^adNBBH+!B}r{uMhJ#DEU*}&H(2U&9(*qQ
z7Z^qFxP9h4xyc+^pWL?muEz&6Q3RIQ56($Zu0-{GWcZktl%Ay|kYDbJXcxJrEYzB4
z7{k?3bC250eHFY_i0PBZ%o3sE+{|2NC(KRxc;W!eVwSn&CffcWfX&<hMG5lfr-41Q
zv|3}xFA&}g#RT8hf(Ykx^VjCnA%~-bq?1us9tGq})0KC~eo!vDn9u-xHyg$i_~~0m
z^njG^z)+o`3H9=PWur$3A`*@T=WF<*to<!8aUQ4rEj&ycjbsQVnJAhH&S**=L}_op
z?X{$Y0}O@b+2>^>bd)*|MDUvyOQur~rkOAZOk=H_`K~@&bTL_Mr$(8rDMS#C6i-{E
zrzLWE_v9C!G-%7sdyf=@wHH#&@^cFA^u%kOmCuB5qxoo_v3fJ?c$S?)MO;w{BB&vC
zKnXA#9$%T{`Y7<wu3)qgAtX{F%%$U$gCZN+(`|~|Zk1I09&Z@_XUdR8vK|NSMr0!O
z;sN(|{bD*lPhO*;#1n7cfaG@0diTZG<;3F^6EXl-hP_tPh^KpLntxPq$)A(kj{so7
ziUd>)hnWHH@B`y6l(5h(_vj?4#Uh^Ps(QQ`>79=={RTXsiELx;spb%#$vwKIy5<nt
zN#Zj6oYYpxv_aWlW4%<nK}U1v<H`v-4?J76X`s7E+RYMaB1Sy?Wr_})9X#B3bmB%_
z1m%uS&ih)DCTC&Y<M-yLz4D&7H~I>^pht4CtxzsiF&x)}|9G{Dr{Ifs;-6`z;Fma#
z-e6I=C>{*I7fTzlDI8^wg|IcW3ricA5GN+hK_rX{%UU~FJHJFUTr${tF|~`dlAUsl
z=KdOEC6+k_cbaFg)?tZTZsL1|VunN6HNPO;pr4nYcsU~3B|FwBihR{~Q!<(s|6y=I
z*!02cME4@U-tleI-rhgCQBTP0=p0_{Qrp8ITw(RAsV#WYXnQTlqn2J<*(6M13ba06
z+2kX?{8Y6((^MJo&(Vv52ZSH$K#w_veqq|EEpzObLjgLu%4+Se9|UTMJ+MON807=e
z!7I7I`#wq;K@)T^+8)OdO>ck8`Vf<EP|0r1ydt}TS6-lf#gi#gqG?_27}eP7GihDr
zWVV5L!lqI57PDU9@E6H^rAyljFJ|~|9iaJ>k&!s%rn?D51+h-2vj3Q?9npXkU8-$C
zaJVol-xnut@G9R6NGw1cWlAd@Hf<-fL2xwftM7UDQ4h@o{R%T`T0`J6Tg$x99diy;
zJ)WLXsPu?Fan#uTC}9zLFmhX$uV0^i9{|?1EV1G6Lp+r~hn*HQZyX)w<NKEvgo6p1
zewIgIuh7!28>G=xWG*MR%2PSAl?TD^qUGVTYsS8iDY7;Fq_7nmHKXgP715au#50$P
z|6OXoF>&AB#mR)7Y`*M0blxZpsj@W+oEgpTC7`CAQ8{o4in(+WhzU5t8e)P1bQZ<>
zB7c4~Es_S-%h4YKS-4q>D{|UaD{@A;-{m2v#(9_{>@u|W)`5<|BHvIvOCGR+@8|{9
ziEx1XIp)art*X715y}^>s^7mpEUS4qrJC#u&HPZSW&qQD`O&~6|H^ghGC3B=m_l*g
z%!(CKA<m^&%M*C=7~J6Ni5r*H-au{Fbj}mlFZ#l}`Z(%??8?2!rTL%1(ml51HPLDG
zigodU*Kn;;+|Qx<wzE8zmS?hVEDW;_R(u;W|3v2pSrKSH%({`klxn{3#k22xr=+{R
z7w+~P_W@0_+aqE8TeZE%J;w!YHmp30Y%2ujfy|r8p-$5(-$evDP6lz9?a}BX1e+Qy
z+-&5K8)puDBMb1^MXZg7J)DEAj1;2W5kilWW5ag6Cs0E>SK&D>FZ!c|>^9zE>z@uT
zLhn|!IByFJFzOQlO3v^g1CSy^K+U-!(rpg4Gy|Ez^GHNy@$_8sdI&c>P>HG$2>X^1
zEZ|e0GmF0qHFocOepCGE5H|<4v?Nq)R?7+&z#*yPSv0~DdBh^ppFfPoPFCNLWhk?E
z)j@mhT^&IHOUt@ya&OuMP>iU2t?Dz-!zkty-nQ_3X#qLogVU{ygTWJVPYD6pR=Aj|
zyJ`R?2rNzKoCPysbv!H$cb)W{#g{}2tgeSOPxoSbMy>FH@|?x!*|DW=Fh8v2M@1oT
zJc(%Uv5E+{=dy5R=@l041o7MqTMDP$N$isK?wDQh5)D@K0kx1deeObrt*~`2Z>hNV
z%`qtFgi(1*Fx9OlD~^Vxv=x_e*aSMV%|glo(-1>0ZAWs&ibHXx&EWVv5$%gWF?wiW
zL{@w;{p6G-1E68<*pliV6RgBI%ccO!-B+~laCHm_<|JZ<3K6`Ona6_$WN&TEqzsOz
z&LJ`ll#e_9yZ4IUr*sCQ?<kxewO^_Ob?WZWScEX>+9XAUdwbnFR+r=S#>cwHQ>cuR
z&_=%J&Oa2d8@kyHm3uM|BHU*iC$Yx>q7*;j?6U`MjFAuYND-nlpoC8@^Hk9Fp|<Zt
z70)lwHrhBYQWTKS5G@=5uYA%kG`+4|x-YK+N#?ZaIIoP!7y<upxf0g^r*M4785VPo
zVvlC>a!JKMi|M#L{J|OST5pLecCDYnoHj`z`ZCRA^e&<zr+aXOp?5PZ+&nSNj1MzZ
z+-*La+asX&o;cW3%;@YWPjcp9Qz>noR#Qfp+pbEg$eyO)fvh<T^X>H`b7n18ICA1#
zgEJu$`h4T@OG9~?Q3MgV-ghXSpH#QNh`%XEmP7kHO-Hb!L|W;Efrzt7eFMZeGt&nl
z47fIF(XB1l0~!L(qV&K;rxAe$fGg<beNQaL`^IW)xS3#5@jr1Ak#eo>!w2Du*g#zt
zGAR@Se7KKOP%V{{bA7|)xu->^1~=y|cUG4m`}7lTx=(KC|4rLO`KNEP!+0dK^VIzm
zOEySVu#3>L!!&_}x6=az>_b-&Y)vSMB`&k??&+@oYZH?qn4PV%^;d*`v?Hej4Evl+
zjW9mq<AO&Rj$qbN5VDnEYoXILuJ|F)dfqIl2z9fm=rtR#0W%3QhJ|bSP~CRrV0?pd
zcvnRZSgzk1w^<2vU~v}D`<#tRjv#X!|DHX<JUqQjQ(k0be_CnmJp72vh1LevR((&R
zdkIo=t$$DHE4AfZz4@f=7%_xh_RE9NS(8l1VS(NGiB4>UHfsI7c<x{oSnPCFC$NT9
z#bBy$1$}hgwa9u0U?TUws8}g=&i{;|e=vSYa|j_aL8vYJ#t`l(YO019;UQWfvVm%_
zM>OR3aSQ`RkuR#rk<Muc12?C~2dzL_SZeDicZS8f+O?LDnVB&#$U~P_PfY0IcS)m6
zz?4|ytWvVmDmPu-kw*N@I#(}g-+G(!`Ku6QD(6zu@&L5FUbAKsCGsXd3?G>z<0ulr
z;Pw#%YLqEMbUy#|aj6ReC8D$ZYnaoBw}7DEOs*)yUoD-8xiIEu8G0zCa;Ehh%-CC9
zZ;N^V1c6M!aEKW0ssnZ0BF2+Mb<_KA9ndtWsn6fNM)TrqIR^UVJJxTa_VV?^1r}}r
zF(8GKp{@4ucWMZ(UdTH>U^1Ht>@poo(n+RgE2Bo+bKRM<J?D|()w%M&ig!;B2y?uB
zdWIylI&&FF0!d@ZV7RC`Rn-1uQIx?ZD_GMI)60ig+Vjk`s(PP!U5#(|5XHq-dUHy5
z51fEX^H$v$DZIby9~k)(9^iWYm>;R#%}w$E4YUs3fZ+eNF1jbp;fJBB!1_k<64&SY
zXCPk=L>$Bd=556DaryArG<9bwkd3mLc=H%pVR<P~HMA8ykLKA6mTV{k%va74mhQ5m
zqp#loJsb;NQ*$lPTyj8?$`)9CfHZZ5)BF{fwvb6pk>(~9`&niGUanSk!!5OT??}y<
z=8D?tt4%Gs2-VN+r$IvT;gby)zv|=0P`o={%i~9=qIoLhrBK9DsO;?~!#4X_Ew|+}
z7`4kT`Mmbd&8?@hi}JOXXWMB6xT@<)Oy9o;hKEzksA5cI#YEq2H&J?$B>s(w?NT+G
zw|@FK!(dsBr5~9yC!oA*WOdnycJAY{x8nC_%A0;v*`FoBNn}>4RF261Bx$%BQC^?w
zhWjl>5Z;RAd)~>@<oIU_(cm@3xNAx5z$Ucpc??C-^Sh!ugd{=;AUs}KP{{`{ocrtG
zr^LzQi+~7$i=NEab1E7Oq`jrv9aoW)c61&`>{|Tl83hD*Nv;Ut+-9$iwmc-VG2vWB
zOArC1f<H-YvdAGA&%Wf{Z=RE@J4&l6={M=w7S=#m+bH|iU)(|YYpbA>S<oIv>3akh
zWGa4FG`MX6Pn5N=4bbN4IPZSn?YmD~wCxDT8GD>fbXpn2RHIth0R7YKUM#Z?Dh-y2
zd~q#?2|j=~SpGVw7Ov+DL+LqPo`{~ukd^R|DgZm!=WYs;d)&Zzu`&TMvbg0p4)nZk
zCgOXK2``Zoj|J+9ID#)}mS7WHW%jA6Fk~~bnH5MOV}ZT9d0Dt{GkHNB%zA}EfYy+d
z)Hq3GwiPlZxdQ#Y8K1q$jq0?oR#<U8P^r`8P;~tRG2W2aIPJj9Iv&<Qgywm+=o<GX
z=pX`;JFs8!b_-oZuGeVe-s|WuO#LH%haG{OT&4f=u|#LVpvwV)rvVd#Qk#O_pa7?W
zp8LzmHJeYz%=L=c{Gs!Au_X%#$I)LUHY?D;e`C`MV#(*A-D%TR!s|tWDvCTHX0Yaq
zMZPWpoPLdLl^zM%|90f^=wjsDt{v*LZLegc&aS2d(o*z%x3m`8Q4IuWs9p4VmV+c3
z69N~lR6};~G|6C*x&Du(a|)Ae>AH2<HoI)wt}dJ1W!tuG+qP}nwr#5mf9~&`t2I~V
zO=dn3xgutaF<$7<U(w>m#<2#Z^6(+Dz~+{<;+h=qRy-1#h!L9$JaI3Q{F%iB)&Wh6
zKOpAN>qV0Ka%4RA)~r--^UNg)@rqK32G38y)mBPb8R6eJJx*rZ%M8Lk3y8Pcs%Vqt
z5O_GGr6Z0UZzeMS0%lz<ks>k2XsTWhYxvI`gMml92T`X9q~2l|BsXpI4WyEV$Xha+
z(i7}>TyQoekOH}ifg``*Oozk|Zj)N*bxOs#3uF&Lhl3*Wg(~}n5nUYpsuC?|(uG`o
z_@o#Bez9@=|N2i3%5VTq@Qb0kyv$kEHY{U*QrkS}Ia30&k*$*KDzXpid|3<9w<rEO
z2XF)KI+pqWD>!-C8f=xEP)!|pB5ucJoYN2N&~_8kcf7^#SvR*5(&Ls7BaKSXHoM{n
zQ$4fM4@X!e5p-{yF{0A7y~}yqYq9x(tj+d7VV>=4f~-S?;43PutxqeN1a$VxD%gLr
zA=qk1!1VczOl9I*c7eY`COjy$H-;p^JsogS#1DT{G_=!WMpT<pB;zcR`ZOV1@$r<y
zVOH#T)X54awOvcl-<TZ6KVhg-5AD%d6zI=b@y2~eJfa^DWk^zsF6k;#)t#qHW+c`M
zif75@k#i7{KG<AXmE!ubl0Dj7TshTSW^?>zT|V`T+rl_+;_9Dj<iByK2HBnkX`l2~
zC#sjp&MltX3|RKewVUQ$wR~EB8uE70ti4xR)Vy@o&ZX-26&M06VCnzMV;WFLNsb0M
zovvk$2Q7H^GUc&Xh@b&|(NXG4U#&}2t?yk#f&-X~p+K&Ey&>dFaX*YO)S2JBOglig
zwIO^^JRvj=s}_@;W&06CSE6=}wsB`$-^wH{(9aILdzItBnGP>z+N0DktkHOk50e70
zcxM;Y@~3|t3>h!Jj^+30)C*(4d+wW~h$)$R_i^up3y~eFqqv~Qu`rgSss>_Y6}Ldc
zEyR?F$la&i%%;PFo|JG}c$hxRGAAgXrKKy~M*e=6g{bmK-^UoL9sOCT_~>|slR8-E
zO<Ur|+Tg{}=jArBOBwy8V=~j;fg<OW7d?Ymq(K$IRHevGJHc{lWz%4<lfbJ~szF6M
zr7{>_C%>R20-yR%b%5X8u{?x>)T-TPL#tvxaC;%HUo@C}hLwz80{E6wS<Nf}QK`?K
z-1%<*AWUus%#N%lgIHxOt(QB?YvLpmUyii%8K{1J247AmE88*#;EN8N1xp9M@oo63
z-+!!70^a~dQ%&EyYih+K%x5nVX(M7=N`Rde|BZ_ZN&au(9^+<{PDb8=ffv!gu44G-
zoS&~UIjr&f`&%P}k0DLuJYfcyQG4ixrOXMG1<~!CxFyud&g24~(+s{s&`|KXYhZHy
zwy11;p|&2z`1?xLibTlX4KjL&>reDdx+`OXTe1Hm&K<j*>~yaDv<%Utw5As6I;@e9
z3M$i^W#49>8XP}iAzP{&<Ct(w#_Yk`?rkuQ$eput+d@alIsH&CjQZSs25Ljv*kv0m
z%b}!`IEz*&{ZWx;TiYcSC#J&!A20V4HkY((_a9M`Jr#+TvTL+0^&>{gj<l!W7+f;Y
zGgPROdZJuYU42Lj3mITyQekrGW;=RNXzbT_zXl=nU~Wv*N-2dg&w$`+CDEE4N<g9h
zm{*6E)BxLpt}el;J+WUNj&skD?t*B~tzBVWK3(eFn>JX9b$#q#ML1CYcUGlPa`46Q
z!cRWDkFv(&SHwn+n*@?#Rgi3ZNz0;a;U$?SVHr23JV~gem`LMp!ISq!H+@k)ZjxxN
zTV`IZAS*J*Lc!1Q8zoF-22G~JPZ?~7Iwsl|-+_FPGN8XqhJA#@M}pe4A;Lg5TNTNB
zQbxj{!Z=6WiC}g&zKuuY^rwx~T5^7*iT^z<c-&rhgOGFm4J&xuD4sM%B}Oq#21Dwh
zkP%W9(qay`6O7y%u9U;&ZIL!yVilI>(>z7~YNPRBRmJ7(4{So&8+_Gr6I}1V2wgfl
zA$S_14u-ewQ+0KvaFXy!W0Vz6F9UXb!gGp7xL*?KUq)*2mO2SxMWD)cbZFC`0ammx
z7YMXVOL!G92}~?%BV0><BFYrUwU4T^wGu2bPWVe0Mfx4~AsUWhA>$*s&0vJqEzHYq
zh3xY&XaYq9#-@IFfMCKt2K2?e$sd808Lg%nvek`OAS^~AL)yR00oY|22hPk7$l5GL
zMxP0WJR_l_ud~rho+th19(KL%V)zs!X&XWw`a3bGv(A;K2gzLSw^?pAgx$^9L4Ay&
z;Nr2+1E_e)%dQCWvQx7zjP^=+%kF+~20gGzlqgLg&D$VkS0nszXuY<l<d8<6zthdw
zdVrNs9XZNT=<Y@}_Qgh+IG(034N$1;Si}r}-|)3u!5ot#&4+0?{T^XTy@mEWb9{3w
z7-3^dYPUOt<@^+qHz}(xa(n*c8hpoOx~s3<W@e-QRg#P&=$tJ1Nbc0E1V*{cdFh&|
zkona^CFOm9&mfXc@w=R3=e`>KoZ$8?v0!P3vuQMVt0E6JQY{stRTUM4$V-J=J7I(S
z5~W_rE=4Xi+->$~wj0O1{C;X0E&B-Q^hS&opcX^0yP=OX&E_oLqwSnL_zO|d%wxz`
zMqwfpOTGN2nQ<1{z#<g`AgG=tOBgZ&R&31#m!-6lkk`NidZU5i#S$7&w8~%b-z`Pq
zQ8d5Jv_O0{7eq5oubWAj9g15pEZmC6aG-M|)$WpsH@(aEq97xzda1y1y_T-<c5Yi#
z0w>%nXs&mC_0zgXk_w{XCBJS<lm0T6m>G&l{lHPdZ~VcC8&B~d%be@NANGxEn+!pq
zSoVg#{`y>vY6Al(KXI8!uCGVkOr4z$_kMd8R=|g64+$toQBHX5q49^-7j`(vA8oQa
z2Q#;rdYzb6f&yX!Qkad{OXx)~ZLmBjm9zmo&q=zu;;N)g5vLL1(}a@Pvl-h5G{pJr
zR?)xn&$AgSY;1qj<Ww<S$}KG3Fw5w(EfV@@e~QZ(DT161dy{CN9>^f#&FYB`c?)x%
zRH65fnP-&wuH}LKQ-PNlAmZKXJ)iSLjaxns-cdd^KM7C&4L0OWnl;&KwUYbXU%yNa
zGZ>rd(EtYYTrx~?+D-3TYEQ=LMNLN$ETOPDBWVkPSV30c^~wN)&n17)V=ZR#Bnjg%
z@aktuKWrTFMapOa?GYS8fmtvG)<w#+6Uc=QJQXLpOVSfld3eJuUB^V$fh>~ouBMYr
z`RhQ^48VL;da2D&pvjsqIApa2V;8&bsOp^_wl1R#dc7f92Gn28jBEFblQ#;qT1+w8
zso0!!f>;{T&Ajlozf=dBZE9Q|!%!N6fA%?14!~R(19NyN0`dLSM6XN8ow61Rg09JT
zVx5{U7hoIPRf`OJ5w8{wBz8@+dgFUS)%87MCQX$BmDU;t1LYfW3$}eTfJS{7kFvB7
zovb1yY6PnfEMjM${9P)-c(OX4{uFj;$tQ2#GmTuOIrfl_AU=VLV?27o_I*(6gHjyC
zbNGmQGDu#fE3JVMGl4z6vq@J^U1o)~yvdgP8M}LV5<dRfJukYsmVBf&?Q~$?-iXqo
zM|v6s*j5Fh2I?5#;}pMt>L<yXq?b6Kfa%LSfGyS4{3d{Cmf}N|G=md4dEtmgOdrT#
zNtt=%MeLgK4S@Ir;QO8awRRvd`O(8a$4lc25ih2@&uD)ywHKbaL)NEl9m>adv&kTT
zjF=YkX3>6m^gO(ivF`e@&%m0kH760@=o<nD?^~@lfT%#MHCy^ynM$WR7o>C}OFeo~
zLmsgpmSi7R^fmEb3UV*ntLkMW)EvKZ7c51BEG9Wk>rgTZNja9Kj?<m0j9b0)!;rE<
zCc0J_w452)7%^Z^mj|pD#Fsx^yZ3`p$&y7PM!$DSVK8U>@_mzSu+pLgU7t>|LqbkQ
z=a_)ob=!Ybg6YX8Ddf6_)}BrG1uJw9tXbtas~DoZs)5N=v2JJM9y1x?roXS27OvA5
z0(PIakZ}SpgR9H44!WQ)dx6JsJ$!+ptF_%{_JpnO^?&(62k4SD|I;ORDrs(zZT%P!
zR=2?7ON|f+{2A9fC#m-qt~X}zjwYgv%~$Db#;7Zv#wCc{Y?jMkN6kaY1Kta2KoQZ8
zG_WFkbO_GbT}EZnk1c3-jU%4Doh|esCbb#vkH`Xo2V&`b`y!J^6;d?zou)@c^~fB4
zy>dc{k^GRWUMJ(p4%$4Fb7908>Rwam9%7U<NSK=6yb^gvX(SZ`Q63j9`r&kW5(7c4
z)yNz!1lu`R0tY^d+&UnrS)Da~iq~krk1J#8EKzGIO_GWxw>p5M=6Sy(i~EohNb=k<
zbN|R!Hg7?|zHiR<!OBE!&&c#txs{*gQCxRbLEVcjQ<-3ph%dop&?%qWx5{$XHR6Na
zhB{#LH_3<$Fv-UT&Ym>@mnC=xVDms&fsB%uz2{gl_<lo=63{x|gY^`SpC^!T{W+IV
zIjhGDSGH^U)%8fCm@geOgt8u;J92CL<YD~zU2p{#2hhC`z7=D^=K%WUJhGg4Y~TWY
zQ%vQ*<x*NDm<{9FYppErdCpwOwavf5uo%a_r5v>m4gO6mm@5AY&pM9nxau7WA~MCi
zaInO^n7T)s<RUPP@P_i4vHqj{XT!exW*fOj<XynfaK-_^Z{1r0k}nginV_M5!TpLT
zG$2~t@~pFV<SF}u<*df3J<2Y->Ul?CEaE*|NsEA~X5`PF-I4RPKM*0~f`IAB7mS_`
zc=^YhW9fN{+n#WGN%bb;v6u3hw>X_!_HAAk@9m<(`y?5PFO!qe`8$_szwvOW|CbS1
z6R)&SX_Tl5g5b+l0P_MoJ{Tp5!s6r7rD+LAmIRpa-b;CkX$f1_m@WvX^0DS1p(i_X
zA6S7r&Mm_-Bx63xrHjMvS{41=)Bsaaxw?3d1F5`3BR4|9fXz9uvxU3GZJmX+LL>Yn
zWRtlqnIrR;>yr-vazhFQ*x%_$TA>5P%Ga|G%!M}rkaZ*o&B1Y`1V1y?%k4o=S4e+<
z^&lCR7UpmxFtMt-F)Ld4JTLDH!^wWW!$mTx@2{UN`MKa===TibCJX3Nz>e9U=*d(w
zZBJN6(FpR$PBX1)ns+Xx69Q|5PQ#3m@fp_gm5Z2BjNf7Dkzga`dBZ8V{iWyw1m?P}
zcLMppcyGliJN~)JE{?%<ut1pPD~QbsVKu`a4pfMYie5akB0Fe54Vsy<TndWCD7=?i
zH{tpV$)CXMfO~2hkd4Z(!I;w+tVVrHLsLIPBIKPK7BN|EwgfBGQF`Foj?N^hsLPzf
zYNl=TTSiGj1aM|kZLL*+diKTM<qqCWaA@hbW6AS9bgE)j{f6?ut5A`~jjK>mhKnN|
zce=Fhrxg5hxBf>;z$uBkDO5GTdZcu~*G{LrT+G|#S#)H;RM`*dIQ>IWpga$-wF6q$
z|1U)70~oat(3B{BoTMLiDS|9hmLZRj|K(2VGfe^A0TTfh^r9YuH0F3=IFpcYRi5@Q
zzRMzXhZnuE7C*qMX<WHqX12Dc6vUrTyogatua9o7US6+{d&d7jll}as>)zzoa;w$C
z&pX>kk1?LBq9CFdR5cUA1lsZ3XDAo(y-fZ)vt;&MfLjK8c*(GqyTYNsU)6^$h&rsi
z$|HaC)&kKmakj35t+t$)z8t8$$W68O*_>12JPI4lZGPTy&R5m`yeRf|Z?`0SgO_c7
z!uO;}8T?@9{?dJB(D71kn8m_GEtBY&0i<^$g1yU@;zGN@!a%~@EosE_d*a2-+oF9H
zI?egYub)p<)Gl8aAwJpGw|1~u#}{zRJ7TYYXz3i}W?r#T<90L+j^R=3cd_x>%{#~P
zjIj=BV%@MRvs78)d@>cT>xaB!^3noP8dDTmuSQsi6En|YfPvf3lB_=W9r;{SZiFCV
z1p$Tm3<-~tdqu~VT4wbOuA!nQdMc*Nzo3r6YF4JmwWz*ORI91Ko6dV8q_)<os7_p~
zqO*ifa}`OeN^xgiNDsoF4=@fx@DDF(&+aXjbMM<;;T^OXs2RQ1!Ucqz9<~^W8L3mp
zgKWZ}&ekBD)F=>#GgkOCAd=^#&#Z~zc<I7jlxP<V)%=mr$SD>oS<7dQ<oVHIWy!0u
z$ra>bN^>?L7yJuZ);YT;m-_W14ZpeseBr}?|Nc{p??#qE#ZD?^_ahE}xJ`kgaGh5!
zugVm;9U}T}Cs38DHfMktZ`VIl^{vTtiB{#(DoZeEp|`Le(s@r)l|oEYjQNLdecMeS
zUT_li&Z)UWZs^HSj<%3(G&~K1{+|if3V?2$ZPjK%cmifP1AO}7js=K<9s&e#L)3^$
z_Pu;ZHY*)=f)%V8`Kf6IA-(lr-u)syGUZV>fLeG4-c1PF5_D>rclzFZqs0w#O<K%~
zj#g%*i=bVbiSBQ*ql=j8aSX=~fB?*+4{0am>v6h{p~2AdCf743XnfJ5od=hrPs(Mx
zdjupIxNS=*CcGTJ`i(KO%OVVf*<WGNDCg(o9>c@vM8SNaQzyKy+y>Is5~Tq~0i8$f
zqZ}ZmoSmtZ+wHoRTlq$Ec0295G?|K)29ldcKGjuX+V;H}jai+OSh$9&el<-)n6`o7
zA3-%u;D}A<S6X76&*Na(!l%Rh{F3Wmoch#Cl2eKbwdbYKfvvD5lw|g4lsW0(Jv?4y
zS!9}4o@|5oTY<D<)+gcyvoTza<?PffKLP^Zls!K2t6=f{MRHW0I_c&!mM)8-@2e?k
z(+MkAx)U>JPzHc$PM4oI^o`5oYsAL}jH|abZ-llsn)72YIV1L<OKGX`9ZARMnfilc
zEW22W_2ft)uS>O_*a1Y=*+1;A;QD*qhFxoMq04AC%7_5AGuEDn#U6!l{iWG%aP8zG
zbO4<!lVH;YG0uu(kw(;gzSOU3YaI90PEZZuV$HkuN#Y?t2KaAy8BHW^UH&8M=(Hc-
zTw8J8BkQeB-+@cci$upd%(@%Eol}aZ@JdSyc6s+H0!}KRpqUTKLPZ#y4=NmvP~_Jn
z1nEW6Jy&KaR|KiRTzizBnCLgod-iw_$A{*7wg{bwJx3u;^_Qvfpdg8swIU-T9z9fv
zS^Y;)f9NDXX$tEvG8a?_eMAtud;V|z1X}Blx-t!r&Q*4AE50i9m3F@##hs}`S9S6T
z@U*_~3<r-}DEAFb@v+!O7H)(8_FGb<{ouE~f8Ohd^l>uj_e6>%0R%Mb;!Qy2#djhU
zc5xM1{$ByqBVejz6c2$y1?M=(AQhNCPo^V%l?S5afRs+uBO<u+D5c(U)W)u<ybWon
z(;!|ZDd*Z)rqDp78A{`7qibPdjzL*{nN^HR7SqPe-4a4uRo;Q-(M$A4cJ#gK2#Pjh
zaH?>MwJBMNLHCz@*3MfK?<kjrqww7W6PueN=<K1WCU7VY`z;v3Ehc0ev=7c0P2ezG
zi8ioN>!gAF{1$X*SKl<<?gPw{_RNVJGgK-diMEut{H0u@06n6sn3O-*O9xOG1Aup^
z34bNGXU>&w9pjI)*ebiPv?@~YeG}IGI}yvaOH5TXl`!#M5z^*mOG5eKDV5INqSX7E
zG{H$1(r*vQ0ad~(J3i%Qs%SaeoY4`}@lEG@ah#pXDXmo4PHmv+^T!Gj(yeIJ`1%>0
zF;ZvD82<1>o;P+;+p~GjJEu*faHVfWaS6lY^g*4x2B}D1CSY#%p#M9+$J(NG&Kh1g
z-=`xkWa@IC@(+7|Oi<Y`qjzs-!Hknp!6?rRM!|7a1Ix3bw6<sV=eM3e(SEL@JilC9
zmD=%VdSMD`ru2YuGxhz^A#gBr@jgoD9wby|B=~obv@WZ9w>9)U@OZLR@@#kpntFVA
zK?-W6`2EMWsCy(T_eG8|s!^`-5-8My*E-m`iXtYTFT|M+tk4VW9jBl|9ADl9Hzl&>
z`7p%q@rLTp5~1Z&ErYyaXdhp{QQ(8mz3SLUUvjU)n{k{!{Ok|V;I(9E)v_}Rtaa9P
z*23!>K?<js+nHHWu^FGglz90q2>EvH7ahG+09+(GtN6xLU}sbgzC5S>RhIL0`0fYu
zD5iQIT*I<86CtMhPNoqog_lFXLKGcBpVEy?fp+|hfn4{P4kP=>)6c}ue4G_Fv)!?x
z?ZD62Lj2x0?#2-#lvbJdK+MHp+<l(vmp#e9idL4KTuE{M#QQ44Hb+jD8AftE)>pk#
zvyzQQikCfTo^7u5@|&xTz}O*b*|m1Watt3{77>e5qVAj@eTjzE3ThW+4bDEP@QO6O
zQly!M1I?4_w+#=PHB0mR>JKx_fpAT)ScR7M)()I(db%FeW{Jnd3%I3bx8VcMjw$F1
zjUj_Cg3BT8ncuW4t<DoNGYk~B7{cZEvYHxQY{b?bRqB4Ok7~3@IQf1;E$OWtPqHa`
zoZs4M%~u)qjFzI@{8P0*gi{vau5{a&?X6u?4Bu~B+e%3leP>YpDDU9TbcFasX(;u<
zgx#u3&1Ln)oXq}Ck?YdgOUiPLp+nTl!%}r>6pv1VRVe6Ub((MnmhCz4T9~TWIlu`J
zHEPDS&mZ0{v4b_f{x<;F2?8K9<=?`cQ{s>Bl?=J@p~~GaJrR~dRI|Up$y_{77b9!g
z0#|d@os&1rS56g|<ee6!9WiU~s4BQ93~PKP9T02rOd+^&u$+Tzco_-GmTgE}8h-|_
z6B7C8<s`MnCKksyq$WhwPD>t|JiQgpR^lR(OP&2%7p7B7jfKaR*HoKF*9}AAh-=s4
zeT^!7ufwu84n^0(GnAFWVoi}6HbZlTNXxjMv4a|3{belouthI)X~cyf-2?(H_GtZl
ztF@q1BbMR3-C(vLm9DE6E{7FDMb1+mj(xc(x%BUV$~U`vD16t&sT<?Y1TlY87A*!X
zt^Ob<tOTG)X=4=?3pm$YR0ydaF2#IxA1>uk)te(@b2US9i=H`7Wp6YK4Y^v_O0dF~
z&tgM|Cdo)}pA}UD;L7a(gH-n<5dHxWRa=TstJXd`VB;W3DnE}7lZ$u>xUpT-mNpFj
ziBJf$UpG;h7-+)PbuGb#H54RTL)nIxzYJ}$Bn08<TK-o$NhyJ&ES_eUTxjXHaYL0i
z%)m(7&8a5CiFSiS;_s+jaS|Np5xB8eyn=slc)8n#-@raC0%_ze_SHWVF#ag#DHFK6
zK&cdVP|m&X^2Bq=8T!}Q9u!4_Xp3YKo=yz8q0dfZMycoXU!%!SkGUO#6_ub`ksLm=
z`n7D8&+=%iI3N`A`5-G^sGDhGQMHu~{F^m3TKk5x;{f`13b$EE;9mwCa{XPa{0KJK
z&1i*PvJXRt-GXP=<{470K;Vfm9h&fM&L5ZZcd6kWD4hFO24d*765%wY_nI)NZVhM)
zlH?!;F_#VWmhh*Y3q%`AAix2e(AEKPR=fbfk+W6P!ml8rbJWHm`^>>n)s{BsAm4J#
z_`A@8xpfv<rM0EM6Efzv&w0J8A~MuIsYnbjacJ_kj4MI}4g=buzq*i<I@B^ylPtsn
zPq8b-1C*xc>Yew`CBFG1mkYLfdg8Y|z39w5PVv{f1qeHF_b7~Bzfsq>+3%EBa~i!#
zbfMU}d9$x^xmAQKXm|MMW`D<Z!Yvu^F{ArV9y(jNZk8wFTe@--jxWmPU&(fMj_`zK
zRR=Zff(VLF!y0oamr@A6W%~k5MOeF^G{@n-k59EpyPulSQ77HW)!#K$7x)Bo;b$<<
zuEwfUp3+OZ@lEJXe~U<ENj95?DlS5O>6P5(Z+$1aht05`Srjr|`9|iWuybet75=v~
zxdQ9;KX|W#z&HsU^Y^V5`7~8)#646aYi(5GZ}?Ap04yCTfD!2vrK;@hCpLS0JPC;6
zn18OW$l}_jlg|6VjOJtpgC?Rvx8D{onb^|$_c8;j|Ge*XOa&IX$}xx16rv9(Z~jRs
zwaQtaVdVhF>zY)3#&;Bc4|;4hTD~y+Zq2+ZmvC{zc(>VZYv5_DB8)idUI0-*u{b=I
zS>JUG1fHmwAbc3Y74BX<!j$e%FcdgGi*MzbL*t!K7(J(yf!Q1~x2F58AO-HX=rdl$
zQBggs?QrD&tO6NDG})tJ8b#?Jt4cw`@lULZBi_^ei6j=?BV_(@d)0IBTr2%N$laa&
zL^?RFLD$cz3NnIVo`rRj<vEG|WYza!iTyg;6(@>5{EG|Lrae@$dJz#CTww5A%5WO^
zYEXhoYxEW!E3ft4-OrV1q-%L}W6-Z00LidC2go;z8W|=PgE}~>i_x{?5z$orKat=-
zkBV|UfcRwXN|SHwa`1~#91V{p2tj5YGzz?ILttU%urmDa$VxNDd4FFO!gL!2VckkI
zN88wHMfz2Hp!jgS7(~iOnf`fiq1|Vj%x#@m^c3Hpm($8onH-3%ptO+&+RBX5F$YpC
z)P<eQ{|oLLh|p0O?GEbn)btI6a3?7!h)S6&lPspGD_<Hbp-z^=$=En|14#RQqYRC^
zI~GRC_VW)G`csQz&=GzN%tTQwVhes0%mdiUko+&nd8ir&eG(EW^X1&REab0X8RjwC
z9@l>m6i6yXzm0P`#6qb7RqpX=rt1I^H1&cbpOv@TZ<vJqPF{0g$GIoTf1ds+bKe0S
zv%pPc*9<Nwq5~+4w<sxkj<OJ5Wz}!S11M1$QS7%d!p|tdWLRw2vR}-SX~KQ0X_T2@
zZVVGObbze+5bf}eE<kSszWRvBEb={@RT{xy;y}+ARFa_vldLEmKP(dE@DJrE0=GmF
z44E1&(mRbol;=P%1PvkE?kLu)lW*^AJG6^&l;;Hy5)kuExzI9^{-r-Ya^13Djk*iH
zZlr$d0Gdg0_Aoh*qR{hIR^ZvndV0O}J7;HepqVJQz|0I+81vNulITlc3>2}Y;CXU3
zc)b19gD28DJ<s#+tFKh^i-#u;Ob{_<URlM|SG#tzg&hwf_!1wf(=A{^An%!u?`+g(
zmJrtWd12guK0^FN0=lQ!iR<Tq_jxg+%<{87d}_)w_?k;o2&DVP77kg4`D!c!Pt=S(
zbBFQx(`#7+PQ!`PH^G0`vWe0&&bPD^rYM(5Mf-gz#I8mlW>dFLL=N=2?5N<i%3)cs
zX>8lYC}h15F3T>?Eo<R7f34L^y`K)RqW;U!0%S@Gnfn8>FT7Z1@r|WBU_~36^p$Wu
z#nintWm2x%1=Ww1q4PvuSk=vM-ED$oed5=#nzlQP!)<HAq<mVh(o{}_*Btwn=r%tW
zfu>Pss~-At^BWDd?Dt%q#$!PV5-(hx&QTzL35~K4RhBG;^nDTcxu8GN;excnj@iIk
zK}GW=s!!W(m%tO<>6%jto@DG`9vk)qq`Kd>Gjxn1-Ms*9Q*Ehj8$!8NFv0%$-7sJ+
zkiIo#cv!m6Fb}rrvdI+XK}Sh6bU<!zFwad(E`*nZuv?Hk-jpp!R&gRycCrbr@_>}0
zEti*oUW1dDAjhBO{d{&&HE}ffKBvI;&*$>OstpEV7bqE1I~!iTKVE0QW`@Zkb1qx8
zz_*V^phF^f_Li9LZ+Z)?mwboBDCNyAGe_?dZFLdckJBRPtn?Cy31@mHC_y&5W#$eb
z)B@$db&e9O#?ueMCLgV&CVu~ypCJ~Hv4jL+hzNlxM`iGk<{7HrTW}zw1kjQpD}{LV
zFCaSp3$N7+;JJt9g+qMfwS4EjCQdnK+KVBR&?Wyt0|@MuKNopV&CfDJnsNHag$tt7
z*;oGSYjD|QH%@eO^H#KhGh$AxxSJxOt~wLMJ*x(`D#r<@q&=&8F*u{I7-Y5K*Yts0
z7jj;=uavo^Z9r{Y>O1+iDSy5z<t*4qA%(YTw@@O(9r*T{z;d!Q4P+2#?@te+PN1rn
z>CB$NtCt1x-67Ppg=o}4a4`3LE-|AIO<5o9UCYNVtg`qEQ^j4~e}z*khJj~#IHl(0
z6_L>&N1cGn86|YmGCAfojA>&u5Z99n8Bb|rED+<iPyU7!*_6H%2x+<SBA;MoYm!|y
zH#VCTo}TyS1Te$^gEFiJjETtjXE<W%LnleJ`5Z(Ift26$-;P4WEV`QT%(#tN{izY@
z28!%LTIevy`k_)|=0aEtVFu|7Zk1NzaN}HRo!e9k!G}jA#fmA7z_EaLNsz;W?)`@o
zAYHC@q=mvHx5gv&8z<A-#H-HiGvsM?=1MxN0s(F}aye3I5o)(H?j?N|8Un7rRVRFN
zl^lx^Y**^Vatq)K;S8^!nAE1tTFPg2kVxzN!-;nx(^WIp;_ST(G7MYv?4I~|Hv*Bk
zJ0)#puREAzy$L)59;K*B!t`!!v}w_3gep{%`Pm{$MW8re`yssj>t`~fl~euV50FGT
z4}~)=5U&bkyCYa2hjAil4$Y_~SfJ%s^x7;IoDb#$5v_G^GxOr2<pJ(IPZn$z4^Z$>
zcvm;{48G3*Xx2aNGPs2m&ey1>cdGAvOfOw1+nE}mRRAwZTT*bV>t|T!f#SMg(&z^y
zh(1y!|9FrJA>K6pTLI~AB!^Jo1`!<C_DWA6J-`ovqLG>rwFh|0Xm~oL2SikjPN?Y2
zM%r)BNUI?kWQ{^ZpX$nXzn_1f(hA8Pqk*6d-kfR+<to%$t_;4?jt~$fFCvng_&0fj
z;3z4)%1YH_=O`&f-2{iu#@0bfGbx?QkAL^|H@F9OJmRZ&7_VwxD)JOl;k5Hb4%NWn
z3k)Gt9<pB0#%@&Mrn!(Vyz?zi@LT3z$-31uXPk>1gL1vogG15nz%kTDED}F4KYw~;
z>YeHAs0~w7is$ajc6`!PeoY>2;1R`U0o^mZ$}<Rkpb~rRy`7Em81DVc(r-kax)f#I
zId^%lhnIkvfA`?pQ3PT|HO9!Bt1@|cCt5dC-N)z!jGI5lPp!c#J!)YCQ;!;+kuemn
z)&Lf!l1+!_J~ZGF0QBFJ$Y0kYvu@x=fZZI`RE>N88dwBc#vE;wok9p=fd4FRF&oTs
z<wZ#GuhzP;HF#~9bgfuz*qF6IIXe2x6WJYT{ANMNcxr4-W0krdh{tLD<8k3NE#mUD
zGh6K%B-4Qr!dRB4<FDGE@#bI{X4VQXYzox|!xYvrFD6J<DV0z`=nJ{LweWJ1JXerm
zm~kY^m=<}E;Wx!Eas@nm(Cl5giG`WP<~J8<fgY{S3C>;qEN5vH9Hm~6MA5zVjU1AU
z5A-rp;;+M5#Z^t6`K8*dJI`}<5Nb&*byZLCZIf_p*@x)At#k5{Q-a)b<sVhRO<N`I
z2maKHgiMB0sE(Tq^mJ{NT~SinsVQ4EC)BsOzHLpMJJjLD6pUKSEj6s(D~wt$XNgN_
zC;^>1Hpe&#S`A5A=nGc~#aAFkb9UoWOx%zTx9^DU9RB>`CIj&8uafJ@055M~UoxB)
zzUj}fM)`4_u+kN{g6JZaqwbfn5YJDz=b=oQy}N{`PlcpMJt1fx>G=|A_nH^A>_X&>
zq5fDseYfC{2OzZXV8iB)kC0=B#?>p<V@_~wYXW}PaHDtC*Z6#0i#+OwGx0gOg<!Tj
zW7=5FgRSPj>x+l8&N*cKFFNHZ4_N`f7E6z(T0al};iofssvFHHq_lfX(Le7ix)1^R
zbatxAXieLeTId$D-5(f#Zqbz%TuiSX0U2P{1Wu2~*z<1R%OFma$UlrIN5B$aTo+tW
z`tFltJ9*!DS%Dq2Ne+{mx|?_;o&@FePFv=!B$@<N4Bu*(YfM7<!meOSZnN;0B%Ej;
z56#nO_GHAI3bxir?>YZfdGTBty+=br$@;<t$lN&U#Ff(RQ>gA9`P#Y5tg3%<bk0^x
zYqQV)hdl!99tH1Y$@e$`XKclZu4mdxLbt#|WU7oNsoPI)QG$Q2^F6sP3xzn(L^{*f
zoi~2x=gF^ouhRGA=OGCwfjm@R;n5JyP|F4TH7V0DwU@Ht<rC7B#;v%s3Kw@FRb`{a
zNnjmY1#$n{YPErOktyE#at!F*YQ^cL{w8k&{Ui}Wo@V2k?JyT4P(z&2<}_Q81$}2c
zImzxg=dx-q%e1e|tb8nB<=XYfN`)Z3z;?z0&d;~**Gu?$d}F^Ur_t6Ei&3)|q!@H?
zT1xaXT~s!Z`}b%ZCSX!syB8pYc;2c*6CHKWP<E`TO?cM4FpBj9!YXPa+wQ2J=U$1j
zj$LN&WWxX=h#U`WhPS0HCL%Hd?kflN1WVJK6jz@icq=S`x$#`FJGkcmRC(VDeW3on
zGn<*Sd&%Pb4)Kq5P?x9qQs1ZA!{;`U%;fJ}krQ8`k>yjDFuy7FDvKn$hE8QWcFsl1
z2nx$8C=Uu_yLbD4;!3~)QBZ+q1scuz&&W=w$IVg`Vh7Nz3<^<*2)!$n4}!+*O!||4
zMAFv6G{=h*xpx|Iu{2dInxZ`Sz&%(d$mKe^&HK(Fb#!$eE_VUiggCDI%&|2?YquB7
zZy~eX0cSx)^Qgb(vjYeOGHQxd3L5!{1+M`p#pvuM^N{nM24uTwgz|-m1&i*uIOTD#
zLY!lX&=2ZaNZsh4_SpoywVc==TD?gRf3Uxd&ZPTV1e5dsasG`%l4F4x2QSz&%z`q7
z?qUfB8L;QIp8kYDKPZom>qP<M6A%KAkp(Z?yKfT#6o5O#>!)u5l`&0RzAH@=^N)<0
zqLgV~Njh1A#ol8K8Eg2cZ>shnOdAyee3UvivyoG$exm+E=M5ZMf7j5UfNK9kb4zv`
z1Zbg&$SwJyKnx5kT$xqZdG`d!23l*`|Ed6Mk$qKKY0ZmJ8TMQdX=;Hr5&qeXH3Cz0
zJwR0EfQ|*B(-DBXXx<;QAv1@sph66WMe$~+6${ByPqdnzCK&U%E)xZ7P4v~B8SbuM
zguO*k@HqU89~*!=k+Zc^A1*uH>gvRto4KZ9b4xiyo-Pl?6j9JXGnjX$E^!tyf#8pK
z`&rr55cm-kHpNP)ua_b9m<0YDzN+w;1;nK(q(7W@an6$E$GO>#rZ5Rll;|qRyCUxr
zPST22#`2*CLj}dSGq$P5^Pwss1oQwACoCk<-!_gxiMW}INd$fiuFRxp|8t&gMqj8W
z<Z09O&qw!lrgldb)YpxJeuqw+zO6{r9<hibR%^-TTh%9`sB~jmV06-HHq#4s;Ze&b
z0pZPc1=3)IttIW1ZZDBT@{uXUKDs)mH9U=^j5joQ#pbms18KZs_0}AlQ=TYERXn#}
zIdu!o(H+Pc(r_fS+9tRz!WAuE>!Tnqv>=r%mBUm$;J@FsCuweO?#I_ELv8cCKKKS$
z$WH-<F|CzwfoQ`xTvDGj$-U(igtvXDh!G{Cq1!#-1c+C>cm?+nMQS~kjIL1WF%4yh
zYi;%C@4~@K4ESb5imS_n2~3MzRbw`6FZJ3=4>?$M=|n9|OYY<PLM`Z}s2>BV!MfQW
zVJWZs*;A(-q0MojfA6QiKqe#~%;*HGTddq)%uc%~F!OFeVxH#1!OLdc<pT>LKF(%B
zG9=t0I4O{ojRyFJRM}#!5IhZp8$-(~#$IuugYU2rnN;KNQc*Lkdrn579hAuIVq;3k
zSV5i^Cze^i-A>?|<boU-qXmAwQk3jJjD+^x!vu}YqwWItWybttXN{hT(3RC{_2Up3
zJfnS6-D$CwE*n}SKdhyywe+Al{U+})m%5U8z;<$*Lgk_8Feg;o2FC)sDnO|bRs>hE
zg6}S@`E?+{3DYd%6w~1m7Wj|;7FS$1N!uC&pla`25WPSAkL1HH$?*?{&yV*o2_0mA
z6$uPURfL!8Cc*m*!&EF=Hpg#-?)e^O<6~2ifTw9Hq|fT5UPQSxs5*#DA+t?NE?CD<
zu7uPEB~7+e__lth?z;(1mvr@6j8>;?PE+d##GY2p2X(!&_<)0&-%}b7wZmWKpIE=?
zDVKXzr-S+00Adyd9E2Qt?i!-s0UCEXO|OVJlY^&l>ihKyD&Ur4PH_Zd7$w^Hdc^Q!
zs2K$zq|up6$3!rMmaK)8Kn_BGED6u{bD0!*v-vj|!+tXzaob>OIMmvvd+03+ve6yW
zMA1MJ8}JcH40?%HceX4LcBz8C#S56Ai3-lCl7qyZQU87v8*Y{gMO(_GjJ4cA4b$?0
zVJ4prCsgMJ_9(bJJ=x~CSHw=eQe`+I6JxdvZ@xnb&SA1>2qbN3zFi5<AUcEsOHHPI
zT^9P#Wjo;eOYr+}b%Njl1Q0J|=@_kmRx`cg#^f~A2f#lx0|#R**G2qihHl7IX!z#0
z%SQVPZNMRzWYKSc6#1z|O`_$*{JdoPx2<8}j$=Dl*x}KKyJ105&QkXsTRqu~fiknQ
zw)B0lfij+{RX`T71{kNvF;L*4)x^gYxdnJ2kzM`cfb0{L0^4}dl2xeFc`AoZ0aOa=
zJ%=Exy6Z1Jnon3tGwE$+W|9)YU?pm-ne3r3ssyJ=m>~(IEc+l+qmy7z8O2TL^?Nt`
z^*0e0{vW*cHp>#;`h$Tsvl1;gd({l8!fiMEFIHt3apSpkm+t;hov|gCKt$4e={LrG
z9+0j+%!|JrLgU5A8|>2zSOy%&3sBcb7Xk5@Dh3=>^JglfXAb61!W9KKM_?r4K}$n*
zUIFvt)(*mBYfS92j3=nV^s<}D1%erRM`7bRjYz-XPG5`plm372KH)$Q(6-tp<Ivzp
z1r?b4GccB<#LLsJ;-^`_92#&4(+cB9fM{GVJa%RQ>jSeNX<sQAlKX+$)E4y)f`d*^
zT#p#+9_ly&;uaQFO?&4_LHgIQ%SecJocY#HZfPlbr$q!Fx+WHByKETp;fCD6sZfnQ
zKt&%xJ$KPT^>hA5v*V!ZC`L{~dPw)n7iis_%g}MrSsT-jvrkpo11=ca8%q^^>ozGd
zQ9P>X?aTQ6_=q%*6xnHuI~j21iITGW2Kus7^1*V1Wtgw-c_8zJO_?4730Oam4BSB4
zA*zIAzp^8$hh;CB3L_{O_^0)+q&&!!0mD4$(<#D=Vz3GN^H(Y6ltY)j)RE?71^s5b
zm9%o8l^Xzg{%LCD2Mzu~ANwiIeh%VB{j6bS@LeObi3|~%;cywDd&G9});CSN-7yMf
z;-ELMjbkX-S&y_j0QfRbxB)J>H!0bSwoO3%4*_g$qlA2(D==7C2?D|i>oD!9vm^dV
zS0ZNpDOyb)m*-WyHiQS(A7G3wnC9d)ZKkb{Of|D97If0nHM>eOoOjLU0O_UoCNUDx
zRC`N$<GfAhn=IvAn^nHxtbd%P{M$92S&v=(@y*u-;P-O@cB!nlAT(!k%*Xb5XN2sk
zD9;Gbh%qx*e{CLG;s!7SORQt#kI8Le?>QCt8>;4g0yn)3`gN$dAG6<<mS^uQ`297O
zX773+Qp)itJseN1qnT<NR#a&F97?ztF8}>io^Ksd@29!YI<x#(G4t-F2sIY+KtMa#
z;YBT+cR98_V)LV`0s9lIzosOCR`<IOX0UEJIc_k;{p(!iGR2>YlWp^SiTMt(RO=jd
z?)>3MNLvnxrcB-%2JQ2`=z}%qgwyma#edhnYXB}guJziC>shusP`S-7nBxJpVer~K
z(zbFB-GjzP{&H}w{a6hyh|x(JzCGZ|*ZAwqF3N#sA3jeK?6Iyt1q(CcnTI!fY*S1s
z3U=6|e=#;*jSh7*{PR)YPV7&RJu#yD=D+Rxcg(#jm47*LtDT3BU||S*E?xk<*DscG
zu;6(nz(rOY8m72#bZVzCl`(JZEEi}VSdP+A^;$L3rcV%rOX86ITg8XOpOYG_0~i7&
zjablLMbF59*uRt9dSb%yEh0Y8`Mt*=UEvGoy5f>Rx1LX^*jBUb)yJ=bZNs=rJQMVK
zq*f`jvkCNNq}B?gY3Z2$9th^0{Tnqghv*qlsik(>%bQ^&k^4wmgV_u=bKIMHQz>Qv
zK86-qgy=TAL}0>fI{k_q4q>~n<s&7(j1k-&JkAr&aA<gx3~kf_Dttt*Dv-)5We*=}
zp3rCoBjq9_cjZDE1%mNMUp+M_SX^H<Tvr<vF9>iJ;uUnh32jb%uHZ6{e*AO*KM7xd
zg|b8C?bGM+6-*3(o%BZ<0m0?0x8B=M!t>3gPz#uGY>*TOR@(Op>;VMx6ZuJV_!-S(
zP#PLsGFOp9*?nZJrEfkJ=_1W9@QG=4mOFcZt&fiYYdyr6+0l{#wFPH0f5rwp+o42X
zllK*u`<LX{X^cIZ6WpS)U~7O)Q*6w*xFJN117&R@CtSbxK^h*C2(E}-;i@Fwejp^%
z5=4dE0d(L2D=;A!_s=Eaih`#yVUCK(zCxCQXX4P~4kTe-h{it%MlB%D9w0bhAjWAJ
zLDDil(6o@IWF1^oH{+|<+v5cdYni?5`a)m|R`P{0?G+J2anPG;Ci|Z`&VA=hOSAmj
zvlz}`?&oefAdb~b=Lr0*S%}_CQUI0?oL_1befWG<)-ROd1AX{n7F*j*U@OO|BX~J?
zkTrGjI$&9M;k?C!_arcCG>Cd4YV=cm#Bkw+J^lWz;7ZGp5FnNGD#lQc2efH@tESQ}
zFn9$e@8g@`9_!QZ&B9Xyw1P77tQ(}e7ER}~ORkQLvM<Pa{yLY+xLg-6riH-BiY_!S
zro}`g${B(msC_)InB(DYIh($19bx`Fo*MzKt_RgBNH(RPE;|#VJ~fdmHuA(7bHgaE
zR27v4qy^ARhC+!30bwO7zj=_#3E5zL&8vs=yY@h4{E2uDMwus%zP+FJpzjUELOqFj
zyqV?2fbN0*o`iQ$YjkHBVZI`;JRMjhbdX#8uT+q!V6s;y3YQuMh)@zQrn@6=VeeYL
z-FL|0VC7A`pe6>&;sz4eAEIE$c3SR?5;%<9JHk3hHMY<e=S-<}l)I|QQ^sRCKV*Do
zBLxI*v_IP=`IbzXV}K5TM|Q}B&vkRQ!DJ-vu9}`GW^F*o@$Rph)<9(XhURqrfYR=Y
zuiza1gL}P^jTsqy{={BOkf>LufbJj?`a?C9H*Myd*>xKG`C{DOKpKk!&o_<2ovip8
z`-O@+#WxR%OlnF`wX;Y_h#K;+Jp*wpIo;3cmX?s~Ejt}9fraXH_^B>tWw^8Ff^jan
z1o^llBAh;wm$qMTGTinbSjjG9Np?T%*|(HvOx4u0SSB_eNs<L67RL`^f{U0cLFZ4b
z#tmm-YGFmt>WW~nq;0#40E@sbD?3b;r|>6!<c(I3!&#UUYdErtfdp3+Lz~McV&iCZ
zD4c1(zDJ)=A~+S==VC&2GkI%UmG*n{;}m1#J!!c4x6eYV#R8H%R|st3kx2{kW17h$
z0uls?u^0Zb;6jt$TNz21PP_WiV@FiaR||eNx~!XC=EFbL%Z)`>bNIPQ2&vmxc@y0>
z65U1y^h_N$8CraG@IHP<5o`!vr)fl2^nyC^l!TxqxsJ1@CMHnN-X<ubCB1hGg2>zg
zKpj$m{-ghywg*U{@ZC4&rFf<lwPK1+pZ+`(C`0G|kvq3Rw>rgX7E~F@oapu`a1*yk
zo<9eKi;~+;*;pt1T~Sn5Jm($B?TQUbFJc?(G%`oHm{1}AlT!}ON6f$P0Rrzwf?p`M
zd~pI7o9ZnU+SDS0mzouD2txNS2@?uwWY3`!KwD!f5P^Bi4(@1rEB0AahVDz^UIBjG
z(TNfH2amaoP-Ps~62mI@BOKRd$O`JO*76@BJN!=^#vftd<iEG93lP6#lX@TngZ)BK
zAz-fq`-KGuQ{gZox->iaDY5wHa1r2!TIU#aq9eF?XmsG&pfs3FDef(x>Q5y)WxH?!
zxOj%dupyjlNBm>5(Q88tCQiTime;}pRV6y{yK!)FTuyZ0pPM%8%1GkHX)Ahm0LIt<
zv=XAVM){q4|1Aq}A(YJfb^73<>xb-ry&6prR@}$h?^u_~@5WJq|Dpt%H%BYxN7@3O
zPN3}4r{}z4CslM~!@Nj6wSb`HUB4#}E69Psf8|ONDXT}>K2`XJeX?wH3N{vJT-BJ1
zi{|DkIPoHerZgKJkwa3@_b$N2l|+cUw2_(q&>{=Y_oI_^h(|L4v5{IZCeIT`{ac*t
zu*8I!LWwXX>77!RaqS+!Eu4swQno^qubG}yC;IhW_N`#zC7i@9Mz69uXEd0RO^jK=
zB57)f$$7@EVmf*pZar6V<9Lt8*snLMtkB4J%tOEnUb72!NradKa>(4iPgS;_6JFNG
zZyTNgEtahtUQk~*i><zeT&QD9MQ~-#$~BSo6hdw}PUW~Dl-T*O;`3jo4S+PIHSP!c
zUmSk(vv#q9RfAtJNzT}7HFYz10s;pYpWs4td5-aDfP|Cl^&cd@*?_tY*X`^&!YO_E
z=XNJd91S69tl47t^c-Ok8VTs&eW&|LXfiY4h?w5e3A8-q!NHTdQz@(07s;uJ>nLFb
zm`xK;;ue;V?HP!VlC2<X<%2}=J;(YA?q?%a4^7oz{N?=$M!kF4XF7%MzE+j4N<VK8
zvKjwaJyge|ML|-nK5|t}1Nn8|wIgLh*i5V_TkRHCdu|uvO%~2w2hNtb>tr`h6Aku;
z?gtjUNP%`@li}atO%Zw%6B16RVxo9Pj7G+DzT}GG13tb>&U3yYC#U!B_D87O=-7vU
zJ;Q2^ZB`0;e=SPNj+XS!Y*oql`s5y(ARE!dJ*%Q}z~;#dwSfH9Ez*DG)a(cHficD|
z?ENneI7lBWM5o*`l?~tw7Br|Yb)h}~e#@643<&tbOLIfULAeCJxS;r8`6=&R%dyOb
z;6H8YeEU&Lep$kQ%TjUuR~MLZpI|9nhK@&hKxW&jKyg5Zj(4_=VL?Y`E34{|S9USu
znOSi$?&(=hjq$E(a$8M|?=bFJnIvec<X+fF_sAuK^py8RW-DP_3~_N2_~>^5`PuWY
zWk}JQP(Gs)t&`S|0tR>~o4ZqHYy4G__iXK%3f1Mo^INixREqmMMa8<jh(AT;+E}u!
zsqe@_Vv%l6mX^Jp`e@c+obSj8g*%+0aZzt(oYV;<jg?7mNg#R-T2CqC??D_;@b_PY
zogjM#7J98%+kqm%_R>YrVru0hx)>-`m^=i1^^-B&g<ZOkx@GXWn---(B_fFSX1e=t
z_W<InAel!?#^eZ6okxCQ-BaLYL^r=4e!x6#5FvsRX(dIx4g0tIN8m%Eikr;^G=}k6
ztuIkVdKm1gU+x=WEfUX{Se8dmegYMF4t)(5rC2l-R3R*eJ*OKNG<EFW^l*OjtyN|J
zEZFznwp`8WCuQuOg2Q-t^)5+ve?!SD8ZpztRQ`VNDe+#2to*(ve<+o}N$N(~-};W5
z>xV54xEO46&n2L?4z~P)h4x=>pDumgKtuead|qF24+;mRo!*C}Za6$l6=_638!lQ}
zctXJ=Yo{RopbeOwD34_<7`Xj<3{aFA<rjDj6Xy?Dlv&x=I2#P3!O<t`J$R<E>%MVg
zuy(nulPYBmWoT!3jS`qtc#UsC*h`YG!VtnoqQZRyu?COGF#h8#e8iiM;BRD41VI8`
zP}Zcz7@U!rWJAbL^D<L>wy1k-J!JOeUWd?uZa}%8{99s~rFRDxOh)IwzeK?N7O4gE
zuXqErO=c~`<C5!ORUBE(Ev<SPi!&r{{l8{`^bQt0!}GW%x`$N!9}xS%jAhpUVmdkz
zZ4I@eN>9xP+g<A^u)*waFqcJfzvuPyotL~Gc(=k(`z?@IXr<t9CqlsHMNc-&JBKAn
zwr3!%`L4`m^@!$!RQPTDdBR_w6Qr$qV*6%TEK~Zp=`%e;bMt!+<j%`VzNFyEC1Rpc
z$OGpGZ8ZAV0#wyy2RjQ^0VZXmPs-R&2e#i9-`Agel+<S$dIP24jG(mHEH5eKQ+6{Y
z;#w%`Clz&(k+`%Ax%TL1m4NdC@z^W<>jbe=7fDB)(HAOKI!GPrkpS8|?IK8F`)^P~
z_up8x6d`DZ5oUc8g$7Y@N>7v~9|dUV2GL5FIw$20_QCzq4?7n!Nq}bOPTI^*^1r||
zp$^L-rvA)Ql_J`{rx#5rIXY2gtk9zpY%8x67!>2G^hDW%7Ni|0p#n#B(>%kD%5MQB
zhvv#zHl+vJIy@@q!Y<*_2Kyf)Ij<=RKXY}C6axibC)&|nZhVJm5<H~Ek&=7Ou1jRh
zZu=G9iPo-0@(Ws0=J&%YPRoJ|m_@UE)5f^}<LMovE9;`A;n=p-vDvZJadP60ZQHgx
z#);FhZQJVDPRB+kdCzn2cfVh&_8#ZY8DsCg)~s2xidMrxbnbL>`F2UO!+ND=27;wy
zf!N$K1Q=?~S_AJ>Scxvd$s8{f&Z9<YmuYhVCgoSB0bEqoBe0SGIou}+f)>FBR2I!6
zi>kDEDKdilvutVhO8*v=F@FxJn=k_@nFNn3L}A*eN|Jw<_)N=%%v0|*`hRMK&f?XT
z;hZbJ<oqn7*=xk1e{}z_4%E7t07I9ML?l5*JK*IwjQ6n!)WShRBUekgE|s4JPF!Ui
zL$n{zFM*=hjxLaX(L#Zw5>#mD&R;Pf>X=e01HFObQaB}6`UhW50OL592ziy<3V5aJ
zlH8f{`0SoN_p5P+gbiMmlTF2XCz|tkax5bv*||9}A(|qB2^E8p@>Oq@SX#vGDK5jm
zu1HX$)4|*>$QhBOQi75;u41mFc(yP+$g<%RytW^th5Rr)_OTecz($N}hX<HJg3B_}
zWLY=63Xz#pQ$YEG8XI*gnMKNUl&q?m4FLY|U}7A@z)i`(?@pcO4XKA7Y7BTv_)-xs
zH1P2)JX6hc0fCJ^-BC&h5GG9%S|Z10UH+S(+etQ&ZAu(_`;FqkRn^1U=ud8kqm<Is
zWLCM{UrPA5+X7}MgR~On-@5xzzK^c3dS-YmhmKM*Qv`gm%2BWfa<eGk)b_0!#yrPE
zIb_`=1xp0o<X=xb-0)eLN<gIj|B}mC>)~M_ayf~>F}(<+{{6#P-9J3^k1Um|laOpi
zQRj?r=$l^;k<;!swYRwA$n?&<1nS!;q+4g?e7SwZfACA#k}_Wj*_o1F({T{gO=Q>}
zhf+$Ie0|gIf~_VsaNE56un^8aKjtVrPcHEKMg~PZFp}CL6x2<wOWaVSdyN50=v?l&
z(XS-@#6r?cd3AF3OtbJ_ZJ6%x&6{SL1!R+4%0`7HTX4S+O!u5Ine5;xBPxF~Ebv-e
zA-W0h)RZtRE!X?Nr3$)hUk)^xOZO;_!#lNo<M%#If$N-QuddTrz))nU`cb09U<=l1
z6^4x<TatmofjRXXd$>D21#{nV_Mced*55tsXni<#oEBKP1vWHOM%$flWtw?zp3?kw
zrX$~+Q2tSNzg6)TnD!ie`0|4yFvVz8VrVuj0SnseEM}U<AoIRK4Kd`8CxZ)bjFzGz
z=>Z6pI9WvZixm9z9ZfnO@iQMcBK(cjYHFP2>;Hg4GJ>?R%G=NW^xsy1f_s;d2-e}b
z=?WtF4DHk*<)?{ADBo84^vFp%?HRM53!H28Vd0WDi`{vx;~n4kT@V14nx-155oyLB
zk+XDE`x;)Bbbl%}shuW85U4sXcXzS6o>+ObUX0~F=$A=vy77s+WR2=JN5H4y1*2Bl
zE{Nuc=2h=dPQ7U{)5-IyLD#oYuyn4U3PTD(K0k)sR`(?~y*DwPh+DX$+A6WUozd+%
zEt}W?6o2;rLKB?k&yI{m;uXc6qdPds=EEQ#(<>|QcHrzYDH_mz8ZOsOwC#MybQ@8!
zuZwxNYy2G&qFLevLKnBWHAY<iXZZnQ$=J`kb;BDN>!oF|u$R8KiMlv7`M_Q!I@rtg
z-5s?pRI`=fL1nmsnnMGSNW#29+G!%&F%Z2IN>$&+OUI1(x}bxr?y9`1;q!C5ZK4Ba
zd;nUQQsC*Psv);zJ-nuW`b;7M8~XuOug#;@bkF+K@R+lJ@ST5jZ7e^FEpvx=W*i?O
z0BR++K^z;W&b9Z1%+K7P;}z?N?k=61gHf80dTT|oM*O=0^pT5GrL1kqU^SmyDn|>z
zsd9T-qft$e(GWo-1iC7GeH)w^hZVEWzipgve>?}wD!bN)Xf)p*zgGMG!igxPLw<#K
zhsDSXEm{;<XDxWLkGG`#o+3^cTy?2@rkALP;)ZK#V>xP(RvM_82rQY9x{)d4<bv(B
zxJ(X}QRP4NV`H_F8KTM`JOW4nSQANq<ZZGdbXcC@;s{~8$|-ihZ@nZZUx|-)(A*M9
zV4O!L936Qef%X|mUMx_+fo!nq8c1j>Ph_SPxBvOnIMN|6N(Y3rnln})cGB=CN9-`o
z8~iD(Th`&kz5td}afN`*KT11pfK&wN16t_6O12-<G5ssFE!4e`-wAlmMRU`XjNH}I
zl06e7Cjrv{E2WVL!?^g1E*byh{udSEyYPsvsPtltaPYgI(!ei6Au?J{@(f}0rfj8#
zF(k=AQ?@z(%TRhwiaL9+Dlp^;bgd#f`=#?;*g)*vAm=G{fb>`;shVG~YU{Vbv`y4=
za6{-D)Cw>J#jUlMJ;;%d4l+NE0E*-qP%pps$LWCC!ec#981Zr?%x8Y47n~<mf=&e2
zI@(2U6&1-A5XhXuXp)DwiX}brc^<=0u!=RgO8nKJA7YMx=zqbp8p!NAlE4eRnS|_x
zxd}2ji{`XXdF`zfBzkxdsP6%#JO6b2A7_mrQjn^#n@VZD+X})5HgOJ`Sf_rgR1irI
z(Kgd7%Z$wx`TpUvNgDH;7^;k(kIzst#!dbYYv`A6bh&4SeXNJVM!(rUaJ%rZvs8d|
z_Ya}Zu?E0jp5R%fG+h?Tz^&^is-SOTD{RWZ?z@L7|FX|Yn;g1zT{*4QHh7kBKr?<z
zGqBhir8snlxvn~_;g-8^-DeQhEHogDb%Y)gPUZwF(nO$ay@Ye@M?gA@Hqs;Hnn#({
zdd=h7pW5p=5!qMr6pp=n`8)vwniB-mmBYEOIqC#<-s$TAsPi^}$kXC8;zz=tK9}{B
zsL&Sk#@?WnJQ)?0({PrQ6d~*|`<EtbEtOLQE_av9!fd7INCCG6@s3y5ovG#z7}2rd
zfl{CRzeFj;nL;9U`BB@8uz`YguZ~m?P<4wwd=PcEVEj)za)FO~p5<y_{(GKY(Ch>$
z2z{`llXv_mAoG%oU!eIJ5Q`@A`S6KrWB${<TC2b3wMmtIsUK_yq$404o%ALH8!eCj
zPD}nT_}#jn=}o?CCUq6(U%FF_B3wW$rapji4q1+4e*c@2XYz|CcrxO`<66iMsecL#
zf1pbOuwL#4tydngNIl(9BuK%zf{G#Mf3a`!ma_c4isZMWMkxofiNNkF9z2*S{cw}s
zw0aP|Vwx`21{@F>tSw_Ev)_VLErM+Dx6{9P9;Pvq(RLW`$5k#3s4_p*6SPUy0&q?K
z(#6L(>Kep$LoW>D{RBz8D#VRPd@HEb9Wd_U^C}S2MUpa-8K<P9)&v6oM!TgVIBwR}
z;28>-cNHHi1S)B1>Q#|Pr#{9v#~KUDM{)m2Ph3MaVk*)?RBfwcCSX8MK)hhU{Ud4h
zidD*Y)0RQ3?6CR!_9jq^#Z~osLrToc=5~dqRb+4D3CGjPT~Zq<nDs)|5c=>FH~V^;
zQhxL2Q){izdEF8<B_RZq--av<4rpAg--D&8>~7G*!AZsKZfnCW)2H9#8VQ>Isz=Eh
z-S$HE_T37spr{JQZm=EII)8kHN!fBx5B#cuz~4PktUQ{c9K3z{NkkA9jlKkg7AU?y
zi$qbN(YI<Vv=npBL9ieN&LJ;2Dy<P8=XtA*_>EnW#Zac`Wj65t_@+Ho<F7tRQcfyF
zPK60etWCK=YQ1JrX7byAw;-VI2ZRoSI1anVs=OQ{|LYVGiL9w1J59s=oW15TeTh=9
zAKW6{sahcI-z<knfdKYMhxXz?{hV!0HkZPQSh2k<e(UcuUA*((N@8PR;$FfB>rm6S
zd-u>hv?D*KFFr4wKkp3q1M{a>?VPQZt(HxF$S_u;C|o_xYv;4trQJn(C(#VRzeB-I
zpry;hEzt(A(G}c~^mW6wZht-PgK`u>93|dMiLq=xC^bgiBW^mlN#+_d$z2EjeDy%%
z$M6=S6pg!#0<9^e4fx3rvzIEXcR~eWXK@xQ?T<#eE0q(m0E{LX{TZmwa_kb}_v7Q7
z7bUi)a%?B3t!dudyb;g6W5yovqn{s!u0a*1vcZP`?su~l)d3VxjJLm0q3Lb0$wlT)
z`~-#)W^wc7%TV=3;Z9;9&#QG~?=}eB^6t)<oQN@T(rp!w7PD(iqH1lzME-L7b&TrY
zI|B_K&is4kONWO`gtlhC&K7&VI2~4uCL4(|PH*Fme#+$@^+IL4CGy<1{VSeF@3zOD
zb*Ib)2Kac##6`VAJ;H>2q5D2si3y1|i<+hnjX+vH%JBXw8|Vd}tv9@-Wjwm&d=R2~
zZohl+LG#mTa582}7-cbI%qoVX{d4DumJ*I`z_A;nlr56ws^U^hC@xJHABXjZ^b#6B
zQalG!BUE{%92&3hjArJ)^CHiJ2jr9U-HT{&skb8w2MsLZo-eJwv*3`$k;V~(r9j8d
zMY_EuRn2HGME$`Lctr$kl_ya-DSZaps;#~3TbTs%C5W*qX^d9fW`ai>S+T-pq~Di~
z)KZuQjSI5GHyBw>AO6V-K*9AsOG$=~>zKo&oMZ4)XS8ga^Z8yAE!?5;&Z2jU&bu=Z
zw5(D&yx;xE<jPJ*5+_%x(=)6{J&a>xJ*3F6-yi{WuXDesTA?rgTj$lEJscg6oSmM6
z;()`zXaAk0nOn|Ub*LLPJN;EzXPylj+0}<@ck$GL6po;5vJx!@$)C#ul5~>Mm=ITK
ztGcU#Kbal%Vd)rdy5+m{1gA2dVZZM)p<O)I{j6c%J5uBF8dfcA7shea8);t6NW_T5
z9Olk7xSj9qOU$)P-}B2KG*>=s64!}==xJo%ho3N+Vp{cUFXz&OXq=#1BcrN4gqqFX
zOnJQ)eB6YI=7d2!{`x6EIcHGzszfd4ueyHF<a~ojZE2u{@o02Ku9K0UK^}RPF-IFT
zrfVHHGhojV99Mp>zh<=x2G<kxreJW%a-;uIS`xUzWI}gWS~?Fx#YN#BqHNsglfLZu
zo})-hV$rJ<%2E*1Bm{I73)v6H2{?3aIo}UQj35kU$(d<B6W1kuxCqTXA9-5xvX7KA
zxxXxbjxC+A?6MMi$YoQ<XYrmzfq$-;u3NIR;;&gplG{pOKYZ!>Dy`O!y|oSE!$KMa
zQZ@1EsIunxDgOug5ur^C9@Pb0ht_~$!SyUTc;{Q%v(%@#^@WCkBZiWkV#BsU2r!mN
z%BmRleP9tbgel<GvI7RJeOrWIBy4h@`=xDzyqS-dDUI-1_vf%lTUZuWoW(~LIeqrg
zjYH<sf8Z{(pcE#IjP=vt(BpL7A(G{k%)lvrm<h*uE3^ouzo3~mkb2Q`*94yh&}M(%
zp^b@QFL_UGAf2f>T?HvqtJUOL>%NRXEGfIC7Yg0MuOx^>(wJBfi5a$f#gFIw#&WS~
z?86W#%Z)Qfye7T!l@F4Co!B<XY*yZak8_lJDxx6eRZOsA{Ji*JJS8Vyapdd~WSSb~
zB1%R%e#gYHKG|`Ef)=t2I0*f=G?U{{AnAwqcZlDTTyi{E1J{yV^i0n3W?3vq-&zU=
zwWy(X7I7@6+z2af{O2}BeeDWzv+s9m8?U&~aFybq8kSS<cXZ;r@Jq~&b!69j$d2`1
zQP}$ArcX-#RQGI{l87mI`|*+MrJ^Onv^k!&XP|d7$%6|U?dDvcb85yIVa}tu6o##3
zMPgU~+2{<V7Wd3|nH*0ks7qCS#GF^ogG%zQ%r@__lfpXS!Vldz|26u3AEsT0WvyEv
z;=dhw#GNj-yZjO(g`Kf)tB2Yhct+cJUKatobk3RFQY5CKo_&J6{DY>@Vt6nHGPHG|
z^MjAD`}^?x@*fW{{w2{7PKCQ_H6#@*TA#(8iSiZZwEN$^B_eCG0SDFptvheowb6qk
zZ_i56gYjdH^`CyFJey&#s|hU8gVTt*%0y3we8@()<}+mi*|^&~WPHFj6p7rE6P5|i
zZn*G`OYMA>eCeRZCHj<K&Up-Od%#ky<kS`P9;BG>C0VpV#wTH7Ot)Cpg-{4JAP<oR
z;+0idksMJYp%!*{0R@qq%-#`=*8n!m`6$-@HH$|&GNC)b=!q(q$(0u0vcKT6`Yvf{
zFc?L{6kC8R&Wj*2Y&MSRiRG98jSGcD#H(zv%<(wkl+9=2y|vIeSH?_u%#8R<Wpvb}
zpE+a3%$TLFg#RiSIC0o9gx#+fBS<(2F%#jto!l;ar!u`_YKDj*mx!N;S&NX#ojJal
zqf<mFgp{Q@zH8?h`FCew-!5CL<KY?eobQ^&=x`cq7(S)f)^_<oS=cYKb68r}0rlL1
zHz(GXay(!vm~WWF@r^CmyQ7d9F2{hj;pA}lzrrM{dG7sKn!L+%Cg+PVFXNR3;3H81
zxzD##f(!Q_ogUY&)WS?sJlESmnDgxd2n3vEzlT%U@%l2b-D07}aM&{Zm<a|>@Bx{q
zWA-`IU3PV?)QWv$<*wNEy=?+$@dJ`FMTQGcG};>lpVp2>2L!c#EHm*f#_VV6;`jk^
z=#F+Thk>(Q;QF1nL7=@<#A3Zuqw)=5n6LclF&dSjJWB_c<lP6Qt&2Qr2bHA0(tguU
zcL>_9NNQK|lHE#g2y+Wr@5b{$mV~e_V@VCs!Ph(D=2Yz+>!=3S{-Q{7P|SLA1W~mP
z!5>Z;Pfsw9y>ao2C!CV|d*_r;8x*A-_ty0yS~q8Gg&a<F*rWKg#ls>Fy1y@nIb5!0
zJ8}~)&IvCPosdRriz2BmI1t}E$8a@fQSf>vS+0ivC+dR?338rcFN4zYE2diQCL5=t
zc^F!XXCIUO-~=s8)4K)pMK4kx>vRp}?-Lp;l+f8)EqQPz*4|)SndF+Kh#!-*PFof~
zHXQiU3S3w0rn5)Y^oZ`Q)UFvVnlW_wJ+lSgZD3aenEMVwFQJjGzYc921vAr<w@#V(
zZok-LfCAv&?T-Q=y^$_|kuNW!nAyW6bq68UK%`V9(b(FBawD6y=Rx=wr8T0PH*04g
z_`SwM?UN7fBrSc3d`>K%0O#R`$A@yL1EYn=T#E$lzK*A}FqpFg@0GPut#o=~L?gC1
zq+-(PO{j^+B6<E572~P?ro6EC9`sj!!sP&7O^{C0FgsQA!}{n_1D>upgt$&Ob$tm~
zHsLqi=3eO>ftmVk^om-iCjNPuGYPiaqZd;zSV+e@LC|=yO7AMWgh;=Y$=Y<Vc{V&X
z$SjV<(F;CMX6SMn=MJrg{(+r<#wMYqLHZusl0e9e58S^+lKYMrDa?IF%p)kjO0FS#
zOY=TfP=+^TcwkYP6tfI4(kc)MY0NSZ@bz?_T#1Ty?aaRG>>j`kQ5Een>FLn6${bvF
z+r%J)rQFtk)}sRU2kU75lEzy{E0qV#bq=d2fNs-Cb0yA=6iyvuDn!s_4-C&-fq;Uf
z*G{kURSVWogtWDLo&t~CPe6Ve47)DoIZn_VNt>fxN_BBD(y)Dhm<<?Aj%u%D<P4-Z
zizezB4eP_y+2#fL$Jm_94hu9{%Gt_XA5XYj>O;|<#bd;~<hr_ln?V}`l~qR=*w$t3
zdr4kQis@|e4Y!``LSV?T3Gs18F=fn6!scJTsU#Xb3x+q=2xKBo1hbyF83$?gZFn<+
zVSAQBAFc{#6r!fSfy799y_*GngKGhRh}v0jx}lM0Oc^Ms5|<F<YZ6&=i0Yg?%ok9y
z+7(m5naJ#j5UJ%Ge}GhSILz>T9ySK0<zNw4@OB+_dp2Pp<D0Uz`fO=zn-ylfV+i@L
zz;6>TSfThlXq{!Ibc&{+yUa8Hi2;r3ASlcV4Z$tuaS*<)N>1YB$}cJvRVN4+{DeIT
zh0tUUf(c@#q+t)^Yj|YB;#u$xdXC6Yd&PuyrSowWOH+}ag9|-N2nPE<lsYEwcqH%L
z+QpbUhNa0|z;1H7^>#Rz&mpidSI^h8=~`Zpe7E>lN?bZ#R{KP>hC@DD{sFkZ<!6FI
zKY&8mqGPm7PJN-JIuYE1Iax(Bpx9+(6PJsqMBEx?E`IFjC2+xA?d_~%3Bd`gMT+ec
zEqV%71_r{)w=RJTb_cT?UmUYKF+Z()>S`=>h3u>T{<NOaI>C>5-sc{_N5z7E3LV``
zSJgs>f<7JA+3a95wSN~;4%Gh#e)GxdZpVuj3Zil1-BUoL=I)s3X{WG6hGQ=jKkPcC
z(;Zw!MY}V;Tl38M-(`9+A;XHsO{sP$U0r{LF#Jn;;*rr~EMarKVMOIpY-@``ks}^}
z&_!|<$Ud!GBFECzW%V8MREiYZJ!ki26nP*+ThG?}9O*FBVX4~b_!sBa|DD1bI=}>}
z^N=|<@#hV9%>{JJ+)26f4bqdLkK$H@XD&Is>Tj`lxG+Yl+!H9S+*N!O8J-=DeJ?<n
zR(lwISGx@Q*qv=K8;!c>_@)7`7})vN6&Na{D{5VYMOfyY2NQ|Rh#3G=glbM8ZjzF^
zj%}gP3BQh+4ct=^Zo~|l4Sei_BXXM7r-5!0;a$X^K{k&w9KjmxH7V)+q?k=jImGa7
zimHRG#o{^ZzSoy!2eL;0g-YXia;+J4N2Z*87I*e`E*<#;o8HCx9M_&TJ_6$c2#LG6
zO}}{AR1g$n<&blk+gM3nu7epC<Uo8|&T)C$+2+g3U-bXYx-CT|gFX<jkAf1F$Lr7(
zv5W^VGYJ(i7%F7Z6~bfFJhCz<DryUg_H|#eU?+aUpL2y*UV)vYq;Q2=@^nmke@Ubg
z=E{%N6!(nkG6<SW7TeYA@adG{n};n+U+yg;?0G&B(fnUuFm^LWRGV4AQQTXAV8f71
z`nNT_hAVNiGGSRw7pB4Xz6F_ax5#0hl}<Ns$aW~~Mt&c=CwXEWx;&<IN7mgLI2aNv
zL=7p<RL{lz<cRQv3H!P|C~Zz-e{v@0s4bV3y33;smTB`!!s8q4<TooSa_imgB&-TB
z8!MtM9!PJtRRE_|x!(K5Fl;7GOH`qXu}f&?ODe5{o*S=<87k6Stbhn7HEpNA(SoZV
zvb*6@`f1qd%e7GUWkg!F{?Jn!AjD|+Xw&V8OBF)jF_M2&dMXQLH>E8k(MsroBQb|M
ze>tU{12QNY7JU8QJKcyTK*v8wi6DvwXCUL1?*`)5gzGm_&b+~4h-}ba(%K7B@b_t%
z&s&KRpa-0hPDYfL9QZjA+K9x<cYeVD)k;fF<FC&-3zI7rM_-Az%-#6-^OH_BO?nnG
z+iL<`*S>7!HS2T=jD<!*U7;^$N!=OLrbbtp^gv`yi*Pwiwvb(UKc9x*Z)tHZt>J=<
zvi|*ain4ybQ2WNKTrH;}*2J5I(O<K^a$M&SkE%4I0`IwT4I&@D$tD9f^zXTl=`DsW
zfiq0H1Ov7<=@5Fe<Wm~*5o?9=SR#K>(`7P7;_m=p-AJ|!fiUQE65A}0X)rYoiZ}E^
zuqzI?@F9OiAyTBnURq#QLZE2(5glJzivaulB*hx5V6W_Z)Wx}t$cZcne6=x=DwBk-
zg@ug{WCkjK7t7B-k(6Ab<+6DX90De4$o?C0>y8SR0VT0~w;Hq$igx@9Kis3dwwf8<
z@KMX6=BDHMO?i#83DdXoDw-|{@2o~-z=z^?UN7iF#SOyJHcLpBQtXPxN^^D;*)Y^S
zudM@|@{$}>VI>lV4XH!rPuN@KDtlWjCtu2$6)5DXZOf!Mi8ox5%8NbGM6uid_^$p6
z6A3_Rk{34{gzsWUPDTFKv#PwLiS(^U4tQP-T~^^2l+_)9vG|Ej)A7-cKt=siK1i8j
z$z^g?zi`+UOLk}(#?{x}KeA>cuV!Kfx}#yGAU|ybx}y-}<<@Z($ZlWCX!O<`0Cn#^
z<~4=!iRuY+1)(iwxomMymj;@d`rRcgYeU<?^pH1B_n{4+U&OF9Z9^YGjXePg`G`du
zCY+2!b-xbz?G=p4ZG5ycPb8U~Q<>6or}mlfdhq{(DFJ<QuV3{FKTR~vn2caKqv-%x
zwlwIpo=Uk%`F_1hq<{_PUoAlXRmJr-rX-9Vl)q(hMfug!9(AIPb|rBKfk7iG!ti!P
z!H*IFj=DH<`GegD4XeQi7?)f;%)E*L(@s%_f}No=GtMGKa2U9{-<2%{^HrcQ_?{&I
zT?bc0Q?n<hGv0G20W3e1_8LEgeGdif0tQZ^P}DH(19n|>1~jkzYIF+ln2dIyfceEj
z31E{#nwGOP5t}`nFS?Zhm~K2{vlY{LZbKIL(|Bml+S0zir|~k2)?xo!?chmETATFl
z&i+t!15dD~Xw(dK7j%A|MPYo~U!>}$%4RmUnn4WKpJNqxR;?6~IorI6%@=$xSI;j@
z+5SfP6Pj1l<f$J$Um_4vZ$IBrq2dQn*0a3$$E{qhtZ!*CqZ6ucA1pzS5cqZqP#a~C
z6(o$p%E7q#VEL1fkxB24AS9w}fUEw!@#1FK&kIkF-}n`pjb&8*<$*#8<<=Yn_xkzX
z1UCIk_Y@)y@rW&dIMC?VRBv|u0~8Pr2g}EkH3$KaqUoDfO3R>-k0>Ng?GVLMGbO%q
ze5G2VJZWZU{l-XRT%;UQQLU_4{GA(tE7Cz*afyLtg2Z)-V5j(AlWGrDPgJJt&)1wC
z9egT`vKd&#wE4*<*Kf{1fS!CK2lTi04lO?;_uq!0=lh!%RsM>B1Iq1!BD%DIyGF34
z0hK?GsQI_FI^d>%IJVtoV~G_g!!Y3#@>B5mvwqZlyJ#QMGJ+5km;F<B+zT74qA64%
zO(2yMgQB(o_ZQ-RWl1GGQkK9-kE~Jt?u&s>B+M;niakiPyRJPN`_!##u~~y>(HNX>
zacg$vOh~DN%`o8#v~6vPfHIU*-^jv2R=sD5#sQqxsyHGq`KLs}clr~@72vr&MHS$x
zn9NEBYFvrDezpT~6)>)E80}UjFiX|ggApDfIo;QB*dr9Wq+7^<Cq=5Ir)2&%48E~d
z{#0cXjQOWn;+oKzIqOo+ygrx}(Fo@>rFWS4#k5kUxj4TLY~~Pp>7OdShd)#v;#VZ&
zA9^r*v2b`7o*~wV=yYMA<>V=RtEueIwRde8*<|(zF?&WZk~w^tLkZ|q=z`|0m7@B<
zEa`$4qf_AC9ax+0RTUWk6ibk$*t&43?MwsdtgS(OmZ3_=Em%U?H}i=B(X%uszhXml
zr<+%pRjws#j(?f@Qt5|TOf2gzF(){4IpV9m6iQa&`vOEmBr6BfwVDu?_kQuf?aUXd
zE5lXiuyYIcef3_Enw=Pfo<GR>RI)_Gi(V}T>?^e5RiwlTnuXnKm-|X$h&8Jk$iud+
zK}MHbt>GLw@}m%e>_W&UO>pt#e5Z4k_;t=?TSFXXdE^n5Y;(?{gHzUU&$gg+ehb$n
zW8KSmEJqAi)^q*C_E-S$RR1APYOR!pg89*Grc{Hfl;}+h(eD;#v~KnZr{8KWsG+Ft
zdPpZUzYXD?vzu%pp7<$fSXpI4ADWN(#q}C08gPsrNnCOvzsu1W2NRvB0plG@&mj4O
z0n#cZWCapivYEXunM*o4F-}Gdg<l>c>N|=&hVws`8>HmWt_um@QA#hU-#rG^_`?z|
z@`8}K#6Kh-259f6E?+B!cRVwmvdM&)5qnejEUU9j>w6LKlRNMZ4f4iK+JAgLR$TiC
zZhV=hN@@D_lHUCN>%gbU7CP`}vxnG*ur&Zwr7?z!qPdquBm8GjT0~WUrQn3Si@w6$
zpLhdR;pt|DH~lD<X4iSK%qYu7n_Ift5;Lb|YcLj!chm?aG$Zb*E3$<9!g%BMr=icH
zJ7>4DH!66D_X$iTziBKCA}HiSS|TVI4?Fgl;LmgBZGiQcS1_KL2K?hA80#<W7Q2ET
z5-^m4r(QD20w|tPdRQ<ZVXEu|%k25&(vy7%g2E~BZb?rUq(F)RS-C(ZOCCs9TzD>5
zLfusR&{$A)E+))x-ppctmW=3S)%&?HTd`O~ZD+Qi4Ux1yQH)7V0iLW_LZ3nnWJTv?
zKT|_1*3Zjq!q+boXyhct+QQNXN}^2k{I}lbi=DDwQFQIBZ5!LN{leZhNV#Mh!AVNJ
zQlP~mX<xfEg_5JV22=9sbm#z*Pxl1Zz7Rm^2RfICC~Beo+<xBqUvVu=&}k~A1}lhC
z6;APMu?`Uw$=n|@LcaJG(A$U&5^8_c1o#A|floZL@E1!TFd)K^;u#Rz(B8M-r{20T
zVr$^gPGlCw<jnY9d49{W2ub<(eP)10uONkV6^DNwd#o1B+7Yh3kRg#YKYXD`*2mIb
zRoZ9b&OD42LbOQm$SY({doI^Hj^H;p9I!8H1cf6ap_7rOTNu%mIBX%FKSlJ9%)MXA
zQ}A{~LbiLTpvWYcPuZ<c)m2&44`bq6y5Sf4(ETfD5P(ZE6}Y?HKlr|-H!7zYBISff
z`e2*rPALqlR?=NJK7E$pET+D$eS{N+>3y2;v`F8&`?pN_-xBF^-vadOps_&Rp<g#m
zfGv2%A!<a@BvCs|8cC9{Sf?0nJyKf0Ld+TE0!u?><U_`~pSyID{<!@o1z2Zu09aoV
z6QK1e<ZI(<1Prvp1R;ZBCZRMDVD>@eX*EKR5;%HeU~0NN*6oRhftBCb7uS8)^@&l^
zzRh;I+-eqc$P$U}bV|q5u62(ZuBzmGX3g;TzEagfjzN;kZx5OD6)Y4F-IJqc6=mBJ
zr!-kPzMD~#y2WH*iuf#K?jsTkWgxg0)C%e+YfBZ>-t=wkD{bq_iWwMoIHi)haF1l0
z$?xz$78>!Rmukf^-9&w&=rkq$*1{L6eRyu5<jemUUkHj-2hbU9yo!uu6Iqo*T8Yv+
zI5%BFqYOI!yUhB*?9a>qgTPZVZQ@6Otd4@^I8ocTr{C;E=fs?9_kF5F0%fU{W|TXc
zXr38Zp$qj}v01+;0DZMYHSU|0?p_<*W~3_R8#m3|tZS0h4n}}2hHDZBvGsZ@R2gMQ
z8C8uzW?`W0A=o8!L;kM_x{lR{zR&dAaQ#utZj-M7=!T1426Eh|0G7G>FVdNrQy5Sj
zRRIS$Eb}{yJE=ztdbz|pIQ<?RcH|zf$1~}j1W=RJ9;`TuE%QVew9YW_%+f(R<ARmn
zBgm47AV50v{`T0fGy3UJY{pv6O293v!&*&e<*PDO_GsS~9DlaLYen27*4fF$_uF7X
zmF~nI25DrO?E{c2TmD&_gNx5s0BFsx$t|}5cf(#bQ`Tg~<*wj3r!TE>K>8GQJ4OA4
zAVTP>OyrG3UxshDN`ab|6HFhiNpT0pDN1!YC~4jFDnYO(p<Ad{DEU*SO4(Ut18E_e
z#K=5a0#>by(s2XQ?Hr?xa_$q#N=!M=zJLm7B$odUzeS^CC^Jnx+P<zwE&P1~yXjJ)
zOBEV8t5vvj@=6d_E%kM6fEA^h{rUMI3D+O6zP1gkp!5vPVO>AGqIpwfg=<APj6i==
z<fyNlb5SPozXipH9bLr!0wv0V6lrvAbkDu3{+0xqdUPZrBPXmH^4UaZvilcu!<g0~
ziH+#yxyibY3gHneu&ITWUkA(+-|2Hcj+X_>z_xaV^hBadBjlr$G2pZ?2PYEu*Um9_
zc@V(};JP7o{b1&511ozW4{dTRhS6M6%`4>g%YO88=xYB5%edinG{&I0r_|Cjex|e7
z49H`r2xLo5cXtmivZOxsotW66TcY}Izax=)cuV9-;7S;A|CFH(&fh+pw^v>@>C)?+
zO^a{krG$2(lXw^>xP&>4D*4C#MroazeUz+(=9SN=9<8i$Bl8=ea-kL)?X09WgNaU`
z{|Eo*9}JV~%+_aNc~0rvIljV?F9y>Hkhk7~-g9D!#6c!Hhm^tMedzMdujKac0?Sj>
zJH!Zd!&8)Fj>AOP&TgE;x!hVRndpD+`A+bcU&1Xjj0###b{`_)v1KI%@UDsyYacfz
zo&7ADWiHJBR_!fWUNUFskSBPLfys`{g8{yYyqNzB^E-sE1;|{e_jJQWAE}u7Ym3NT
zm@9)<DB;63hQnpo;GEUBo{{k9cxCDi(nLq2I3()6t{0AESw=+C6-S%pxWTtQ&QhRb
zi0`22qq4NzaTq_%xeM;KDrmccZrEr1v8m>G8Fob4@J~vjt%a~;aaQpy_*s3ysh9S|
zGu7qneLgGl*NTLcx9&BeyGi0sY7qpT(8rTwwhwDHNYC5qIuVHwKzcPIicXQ;#Nyk&
zEA`z(M;t7+s8rm9l&i5IyFdp%7LvV$*!&?E>DTw1-)+%tEZOF75b|Yv;sw&%EqKMc
zys}Q9Dvb-q3IYo<a)b<C&k1{N=CrZgOCSg8qdIqk1m8`Z6%C&%2d106>`Z(Oe@g^u
zfYr4GLw5GR#5vxJio>iruz??vW%VDv(!0%YUF1biP>KYT7E!>AMoL!h9K(1)Y<{-F
z`Au$P8bhj@dfE-aXyD<_9g&|@_IcqO&i9h>()CWs$E}SN!ETdYXj^9G$9N+}A<1r@
zIS79#|K1GGC?+t=8}bzH#6Bsoxn1$GTJH;d`e9;+x4Sw@JQ(Chx)%NUh}PA&+@2^o
z*Z#4Q;E;>3jW8o+6Y&toL_Lv?f8%i22N<wxZk;y<{@}3iC_>QXu~0Z<sdKv=Xr3Wz
z8c?|m*S{XOvLQw>9WCgK3$(kz+6Ix4Cpx3eAEjz>od3dw!cf&U%~wHlEgTBd&EKX&
zSw^hL1ZFJG?&d%J2sFe<fqm35{K{7(z_6fu)XE6f6p8~!bjEkVR=qKf{q$7`@~7j6
zWP}j~>F;G67eGCx4Ukn^^&2hj>9=g9Vk%+H5<ydh?+p`*6#DF{Xi$e5uT2mG?2x%o
ze)-D~gU(<|6!mckNjCr5sN3;-`szYs^Pj3}DQ$(6nJt$zVX~E^@?fP(&zPEv6Wa47
zlO3}Zv4rjJMQKrprC+fpNve>OZ(fDIN!2XgZuU=FfVxea2#{W)bcsnjl@Mppes;4E
zmDBHP`M3{KyV_(db&@%_KA6L;0yBsa9jE`QeGz$BD7`VIc~Ve#SnBvQcvB`2>4Rzl
z>KNgQaUYJ${(W=op?7lb-h|WTrJqEaIK0NmM@X~GeCW4aHe<NrYFW(V>$QcRmTX^J
zRSc+L)}i{IErfeict}Z<h@Q#yXsbLwAsK5ae**NO%P%O4M9--eYr2c&6F717Cy7g&
z-IKWgBATh}b4H;_K{@Z5cxAddzCf}i1C2AZVU&b*yt6$0K<o6Tz`zSkpDL<|HrcTj
zb|hxG)!{b4a@HdDV{+G;UxD>gK(UcB=svS)V$(lw+(esR=WQOf?^&&awwnhb|BXNQ
z<$`7Onx;xw%`Vm~w-s-y^iJcY82z+mmDdXN==77ov62lMzqb2GPkObPG>jn<kbv$+
ztt{sta<!305!&s@IsTjRtUd0<!Fz0NoMWT}>0>jY)YxKrADpOqd%REsvCEsS_IxzS
zn0uEqB@HFJ(9$#|)rN{_+Wjlz270m#f-wa?3Qg5Fbkm^BVn1~1s3K8zA8XxQXfx4e
z6e;tBv<|6Fl<<N|#1+f-Wv(jXi<f6(Kl5MC;!RjoDq5bYt7y=I3x(t;h_ypvmr>;L
z9nRXGRCv~!SX9hi1FN5p)jF@gm2j-Q<|5j<P?~-S`WgBFORuH>&y@#m*l9JOUbeYC
z=AtYS+?yW9tzxrPbWhQuqe%rhU^mR{v$6o!6}K8Wu)=bBJPBrt4_rUy4^dEi95!pi
z^z-;NF78&sd2!(Ux%5%&lwkQo(?=Qoeb@~&j=Jc65gCV=OaHGyRQmNlMFe0Rdg9Jy
zE`k;C`QXaJ6+KfPqO#A<U2vMAzpkwKCR1Heemz+6h5V{v--@G*d*q~?$O<%`#MB|8
zEGJiS2eSl|FB@nDh)h4`fDwRU(i<ox7GEgv#oJUG(mzo1R*ENpkg)?`7FgjQGlgs-
zj@t#3ugbMDz$>#*R)ma^gtC|?Nj7+<!uh043>-9KjUKt{<iG>)@%aeUkDOG-E24%k
zrFNFDDjYT+*18jKE4$Yc5+r9iar>YQb4lyRIB^%8jW2Qu-~og$m9ms4UBZCX1*leH
z$o_p|S&2IX&fo5e`cYr#6~_7#5x&^`>He=OI-kn|jd}VxP@mZd8^ZQ!5@WI^I)XB4
zg`lehOhTo_C2a}zIWxJ1*8WMMN&GL=ehh0GfZ_G-M~}Y*xX2>h()uPIM!BDyrl3(E
z&b#A$dJajIZk|ydUCsJyvcLAg#X$&N6zoiMzPxS=^^8ZPu_O1O@JF<en{uKo?pCf<
zRUS^t;iKW}$ycOXp)oyVoGg(scT5Fa0;NlqlJ1c~egvwGrGRr*#Qjo7WqU(kiO@g)
zviK2pnn=ivHaynTO@i^9vkhFhg3j_Ck68%Gm@8_S>rS4Xkr3~WaCuc!SRL)(72m57
z(mGXF$E!z6$Kwhp=|@jR3|$*SwHd=HMK^p30?Fw+n&RO?J0{Z07&%EWnl^eCd+0?G
zjSE5hCBqF4>J0y(sKgTc5cj2_+Ze8Cq>;qZdjEN1E0U8aKc1L`LN$dgSG=&{PdGHL
z7J^a2-%N&;cr)tTtkoUM%%hBq%cSr3Wv>Ps?|}c@O+j9<{{ZUN2_VOatfr}~9QaMx
z@0N@;jJAS@$_iNy8Y>9N$MFOm+FOvy2EYsiNo!11l_M@;U|B)L*`3-^DoSG)^pFx;
z>dVV-7%)Y>+*cV?uBAfkv9u@aHOWJ5jwWTD^~xh0(a-5-F=+&1J$rP@-I8uT17h*Q
zf}6dV1*FFDBnDrhGe>v?Gf#yIEt7U>AP0ptxsNNh&6FkCm>DW6o!T!?wGM|H7*R&s
z<bQcy%Kf7(UP$o}OQv4P4KnY2yQ1p52bKk$WwAo@0JXflGCaI5ZhF}0034)TFK?<t
zj)R#<%Q@P0LkGu-pU^mNqLXfXbk?GU=G)u*v;{bS$cbs5VR!ZP$Z3gPC5M;inpDEd
zew@a27DVk~ss}-S3;U@B>;)491J$xLp;)qKffN16iUSO4C^tjHX^X6gf;hzkxqoxS
zd2nfS^6#9O4MLS8CzZYDi#<@9GxpEL{}eyplLyf8w;qCG9^mxh>$RjnRVzJq<>*>5
z(tE2x#V~53x#RsurGJu>SkQnT;y=dWn9am>N3rMfm$tB0!?zWslPA#x9aqHS-rq9Z
zg^MmdB5yW1O@%g$Ze5bxNS@mfdot{^5ig21x_9^FJ*qcdioTr3$1s2*#ZE_txUZ&X
zri{kDf$F(_-Rwq0QqG)&?KzByw;BSP%*zn!!2nq4M@KvEb4oYy{a?De8_37q-z$)W
zXl?6lz;_UJZ<i&pNL}F|d&-c{dF<2}*_?2jMTtwPj~(;~S;fTtZmExJt;K;0Y+_U?
z?e@Dk;Em)ddm+{)#H`i;F>Mo*I8*`=5L%PtuIo5ooFX}<jNr4M;2mGQxW1@X9-W4D
z`BiEZ3KLima7@`-#fbpA*w=nl4i@!e60EfP{n|FcI#yd2eHI65e<tE8nhs;tR!t!;
zwxD|-kih^>jO<YMITu%OUgOpN4U78D3>$z<xBp8}ea8Sue0?>zRZ?&1qOPMJrg*Et
z!;_W`18yf_o#bMg^-O_@F;}R6xmz?@$y+~Q&TYhMMt&S|E0=DmuMh@7puS1l^peJ>
z{aNqK@l-yZeG;*`h9Fs@9^?jdg@`@Kj8yNo&0L@N=`fps=A`WoP<RhXqr;6w;i4_l
zJ3s%hfu}{W+B*QgLZ?^M1s_1PTk;;^>Q<!uzHzD=3opEb_=aOw`VXU4cCuN&6K_X*
zk901~TLmv^{o<;tWW^nv*t)UP1?&_Gk5GOH!3tR0g1ijBs`r5L)glr>0tOAn2R>4P
zQ9pnUBhK~aYfTIWNsnIXE)#Nbs*?rd6l93SIR@4y7t+>8x59%}QkX6=PiE<~RDhQ{
zfExLRcpAJ)wG17tV&aA78nhU=wjYD-r6RB9dIT#`UNmx+aUj02o^Rv2bQYyvjocw6
z4a{|zb6fLVB?t3_?4spgAp}*lFttm%&R!rs@cr8-ksgC6uE+@t_;6qzWCwh2gYPNZ
z_kWOv$CV>4f6t&iW07g(ryT-g9MwM|%D#T{YgjFnmtWC#4<*2|RS4-G6nd0m*42cP
zZ(*8&K6h|h)QD0<0^O|V7bl0T`Ji;R!2wG;MHEPqg*6rw&&^4@b5A?Sbfk-jn8B2>
zdD-N89@l6r9j+%ZSMiu{rRVunT*D34`^mKWL!S<y-`To4-BP%#owaSjNL$b)#qnnP
z5E8{vsXl#!f#q6vEHj$%$J4z~<~C_pQ)M*kFaTf%h#E@iG}4VY^Di#}StYj?@Fp*F
zs%`<t#F}sv(zQl!#s)KwB-^p1N>jA!siQc#sQR-!Ue3I@y*Waj)47rgFC~`qav$6l
zkd;j{SugD;;+I!wRzNkFOw(Ot6{$w;2H}UR{p6Gns-F*p#487Y-Jz(T6R5mJUv*KK
zc4PP-!A}J6a(S(OF7C`fKzd`eZos#gz7H0S(yVmFWsvcOIo!9zS#yutw6HdmX3xCn
zy4*H^F&~y%_ip3g0?xT(TyO=IBomLTlzG|_8fROFXdGdNW&WP6A}qqFqJ3hOwrxJN
z(tept)o#0RqG&l=;fx=_XLddx$EYc-;xVqZ&v)Rk@<`1q-P@BW%wq*1+;Z*<KKO0|
zb3WPz1|bEbnaMMF=R?0HE}5I(R+!IX3;f&UgoKBt?f|sA1Dk-ifBCE!9atE289ER(
zo0z=#rtQJ)RJ#*;lmITHXtH6%KrB6IGie32V074$V|qOP3S%S>e~r@+S+X*0leWYD
zs4uc1QJ}hesD}tIrWw+8aLu<a$O*cXUdBDWAzBgMu)Fj<y~1MziyC1S+-*B*%<%JS
zkN0P<>puq9D3GXKCiw$&H^@IRuePZge;?pF;JgZoIZKsgja>w@wHC-&gjUEMKHp2u
zL%WGWn|II&>&dQmfgF?w!$t9)0DuOu&j8!x->YS=3agNCnB~YVCTVVksIUQJ>HaSQ
z3D_^<BS#dz!L#@BHII#8H6LIrAFKW5xVBpfU-`q*n+dR{8kRZvelT*|iMys{8?=ds
z1-{>*c<|4^hw?^3JCXsETgj(Hq0+U>vstz$r99dm8=mjf6a#<ZHv2#7ljJ@tA{;Ho
zdc*&qxhrgMDJBB%hU9rwLj>DEaJ(zG2X7+GJ4f!*JyPy><FFUrwI0qdEd?je3oFEh
zRcC<V6};nJa;eZD_l*`+jDR~C;b39psyXfBwJj9qXI46Oo)A^fol|f>A_5MC5q=cx
zPROve94P<+&%R6zj~+qSzwh`<?-Z2F>X9LlEOrvBxm;)aAMifsdB3aCl8y?$%AIVY
z?XM!5Ry+Sob`g&>q0#wU?Wo44iLT$!p98d_uc#}nCsDIKn_k1;m4yotd5{I@B!bR%
z3ZExN`%;c9hO&}!nfT^ey=%0+(iZ+ZWm2wFV;=^K?0oY{*@bRYOhKN^Md-*yV&y+e
z?5oGeM)vyABrZHr3FhOLkosI;rSd*?T>F5Fqyzj-pQ$vPuT)*)C)qc_!G!RVgyNxh
z7B+{NhBTDmqH&(}qN@aQvZlhaXEDeSp<;xOxA3c8kIZ8$E6>czYuAk*CtY5+oaXO&
z2@@4Z$9j&y%bhW(zL_`xWXb5OeL)|$EOOrra>t!A&&}ylv;7}9!xIpMTgL9VQ^8z-
zs>4M8Z1-zZV&$3U13&)Cp{5I21VmmxK8j;pAbDCBW9%#j`8rh5cQD!r4Yf825xNIN
zIutlv42_0v#yS)@`{I)RR7MON*)iF4O#a1J1aTFsLSXMH6Ba8ee|}BXr^sDZylRJ;
z_0x?;yN{3ia3v(hduDA}B`=Scn7h5^<_n9t1$Si))xsk1FDod7k|D`;diN9eeIeXH
z`JHNkIKQmr5Bdd<Z<?5C!553=2+7)+>dRpAmY21bs3~Jo!tlta2VElvd)ip5aje>{
zK3Vj3YI6Ho$c^0yhKUlEN9Y~ERui#nLM{o)tn=s1EuiF*{zLJGH^g?^Ug^e4*Rq9i
zDwq#XehX2uZfYi-enn*YRBlkrh#Wquj6iTPPOU}=VQwEHt{?0$+Gftwy#g$}Fx0$T
z`Rf-L6&*y=^}XA#!xOn$Uak)6F+}Vof`fQv<X89wvAC*|wOku*pr}?EdNZdxjqsED
zmb3J!sZQaawI4sPkg1Xvy-H8tJ%L3lVMVY1P$^}!@y{a<Eroc<E}p3cX5MAKC9=}f
z#Ch&05(I_cUKEpO-zU1ccy8A$C3+*+%4yto>6I5e%!N0$ZZV$hOpN3qw&7$nkLS|9
z=4^}NdbrvpC^FM<R-a}G?$VX+P<NPX7Jf=TkAfcPA0TDhjhuq2>>bDx%<3Ai(7e;>
z84^xf9pQVwYT54C-g*eH>sTf|R>)}%9twYh!W(;MAk(p0j>m?TJ}`Vxtnti09WYKz
z1dzS__1}uBI-!C2ol!8+DlogYR#t81Mg8i<^|8rNZ%2;Y>8j23(bdq*+L*~MC6VVj
z7p5v!!PZm2?r%kV{csMfqod^5i^A@z_^$j$9VC7)zH<!xE}3d99k#eb{b4jHD2A)t
zNOc@cDf00C_b>3g$!yt~fsqaLyxDA7EMKQ69gRDA0X%ap2#*{VL9dUI;!}gbui`&>
zScDF!e5Y6Ph<Wk?aKx^sIb0P$>+ge@(LiP1(GUo|Y9*BOjCnRQc9N99nJby6CMET@
z1Aj$IpY>9qZ);x1<4BwQzq;)wRP@?!kB|601tC&VPvcAYR~$~d{Y0J-@(VY_&uy)M
z-rCeRga1iiLEPDkZ2vzl5T{FhX{1y{an>mks-liw*XxT{%25*vDWCr;KL`a=WzQOP
zd{4?6<Uxl*Sh(C;Np28Bf7=c_;pxtGXrnUJq#lz1%c@se^=#(6E(HB4OU~SkhAm6G
zbt*@hVz?r@qbWvLG|TPx5Gk;vc`9TYu0AVLm^nNyM0-^3K^8P`StX}cMZV62YR3LY
z&l@%?N`0Bs@BEf@q6mB*_59~1YvDsk2la!s)YgmLtgTT3;^zG&e)I^X#&*oxpIqeL
zeSq;8FTWs4J@x90oN?tTMV`qh)!Y-Wi4Tq;KXcIW>UfeQ8}pu?tTgU#N#2H2#B?;D
zYSG>5g*q48H$IHi^A`1mmDKQQTlI|xw-Tdnf%(?`DN_aUDzZ4K)}g`?g^Lt})KuRK
zto<!^2EMAzA;kk>Y_HZ`;RO7~k&QBc2n*2h43`K-3=Khl9JS^OBp0A&y0^81=mtYS
zp!gfo&xF2c#m=#PA*DGL;{f1P3NaJb)$_&o%#LPZYHQ67Ftu>KviPSOKy$y2Ja%(s
zV60NiBII{5D7;l1rT)s_{=8d;KAC8QS#2~8t@LPwPj8FgfEB=g3Jgck370?fjzsm&
zgSGDnRz{!Z7*P;bD7Xqy-rMpURG7spSm;oEi^|T``$DOwV~`HB0r#lq#~a119M!)>
z`6K)!`>-+H|JJR^3#;<X)t7X(NNE3?Qhtri&wFs%QrS@<gMh|fDkS(XaCDk8WwruJ
zCzvWk)tsVVqo@>XGDZxXYL%g$-udx=5P(s0U-z~6q_sef6Q^PT(;Q6*+N6M1_nVET
zFHeLaBUYG=`6WgyRXufpLGfMjW^`_oSo~0->lC)oSy=HMr3(GrP@h>PPJUN;0byqK
zU54V=`<{WEa#0pqTWJ95%uHXn5gt@9!!jk?e+{#xH&WiDem$_WR45^cc!$6aA>iW&
z#J>VmUgESOx3*cZ{0Sy$9yo+&d@!{!)iCbv#csSBPYNac&C(;u_Qp{Mh9CeO6+=*4
ziWY|FCiFgF|978@@rzr@`vd#HHKt|LYwGc$MQ~muHpP6;jqGz+J3_{+Z?B@1IF|1N
zwN~ObcyR#5t#1x9+}Y=ZFoB_C9^6@c$T2T@HzI4B5tfWSV<iKrB!<2JFRW0KEo`YI
zXK8sfW-Sd(Jjn&VN!eAbVSmbWTt!X}!JP!Gqg$N}+$N3>N&^1bVW_>ryfeHKk6?3z
zYi}*E<}eY4f5K(VPz3&DvJjWlb2pInbaT>S*Ou`@ST6!6aoe=jVpZ36gY;;jgy%ll
z)netJ_%3f5V0(juj*}|N5k@XT{PL}68g~~}JO97E#S*n0B<Rh58ss4SG42jtEU$;S
z>i?-5wS`C_1*cI6bQ2xIgRly@GhK)yi__;l8qdnostMzyr`7B4GK2VkJe^Z?C0!e>
zW81ckj&0kvZQDu5wr!goJLwo5+jesH_m6YVRn1XVS9?^|9_w9mK66hP2R)@uPVnMW
zj16otj`b=7OL92bXD^+EjDtBLl2WAtFRWS!y2N^+RFTV-En_nXF6gm@V9t|YZhNFN
z^)FN~4q`=RcLyxG4j^_*?7h*Y*w}P@5+Km%$VL>AMF`oGE;8djFjOdBTF?#L2}uP{
z)y+kNdxLp77nXdLAXyFtLn232l7;(6mP}VPOHo=4IYqa`=|~7#e?#Cemz81#diNO&
zg$O2u2P;1NpAA<Lj-&<7*GDCOw<8Z|d5lN6KEI$X(qg9#+gE*Q9ZZSzQOm8TE1NfE
zSKb4f`SRRj)hYNB|KXvjeoOh*6NZQT9T}?=7KYi&&VH{q|HEB=LKG{|j%x`6AscGP
zFDLZiq6OIkwsMpS7@1sJ%Nc`||4UYyGaah}RQrB3-pO%nqIm;@jzUe|o>owJ<F}OQ
zkz9q={9$7Gw@Htv<t$KPW!lq@TNB9!E6(M!{u4Z)*AMIa6%(v>lCK6LW(FyvPV55=
zI5wU~;)#)mI667X#m95+aK5JW3I3rfVYKErgXR3KaTYT@2p-{--FGM^dPP$CWm51a
z^YeR<ZzCk2a7fwvmhsoWSBqVYr*WCkU9l{gy~Dow|CBYgF0n9H2oE+YOF;#<@F9q(
z68ZL%Ix&5LS?7$pqeIL>ItR>#5hx6HSZYqMAdji5Qz!>be>66HG#xB+7ldSTPcT)N
zuo=(@kTnba)T9C>xw6r6Mw*$^JgxfOlW|sY{ahG9FVfB#%vB#hrd;xM0ljX%_^vj|
z6~e~Ulh#^w?A?pUCCQhm`)g*vSTu>1MA2#{zW+N9J50CycT?amMxq&^?>Cnvft+06
z|IAsS{Y#;yrGU(0nLOTl5_%V6ftKuGWz<(OTD`Cz4I+G~8`&`-$=RBq<``4z0R%}B
zdr<;nb^sy#Z)j~1UYazMKj~hd+`pXsn4(%bm(ktvtyd$ojdiG<2z60_m+BC2Kq$LV
zC_y5rOA1shR$u0|#4D07z`N26e>220%r_qAiIl_socT=>E4(VeI*1&tmE+wn1aJdN
z=Q<7(;=lj0<%)dMsMW!>IRIa}v9IZa$fhL81a9I7UTrRDW0eHABx$lIUC+|{f=Xx`
ztyfU2+<>R5CaAMVa(}!u0e0z=<7{uHcd{D$^?Z8VDasNF^7N`4720OKjk`z_*~5IA
z+*T$S=%WbDP%5)7+r=?C=D-%&y8J=$-%lg!ej?<LbrGNbsyuWO+~1;Z$1CJI^GVly
zM0M|1Rkw}mO&*U~e4dDs@O`|N03x7RfJNAADY!BYpy69>qoKJ)xd)M`LOFGG*GA0h
zE2x=W$n6D1Qpk%ur&Y;y$3(wg(j=^zJ^FgL2gY%QR+YhVB}$K5IlMXC#KhG&Jx+J8
z2BiDfr|C`-ZH}99Iy-swJv@C71t%k-dnG(^IY_pPF2SYpA068vy(3X*w^zgg#N>l}
zpUSa06DgXrZdNtQL)EW0S2$m}31P3@6A`yt{G7NTMf`8k#!JB_Sg+zC+UZuMB)xH5
zu@I(bQ_ONMhJ{i~B!~$HhEQu6KSJS)pQBV3n4t?3H=kh}&KW1dD$oP9>N<8N!?is}
z|I=kjtsPu<PIn3X6~qEd9OmRs!g<$?gO&ER$js?3N+%<TF{5}HcFF!k8Soryz<oLZ
z6{XV38k(Fy+xdt)Kocm*0MBUmYeA*o5OS$8&<To<tz-f7GmsmD2>~w*$rVYmn2(t@
zz8GoQ)^jua)l;h2tu^wkftKAq<(ebLVX}^VRR{}0pW1!vS0A8zgy2pVt!l$z%o@y!
zD*TPli7ESF%tV@DrIHBoqChN`xl^+o!$7L*u&Dq+TXk0-6~PSQYqQ(YuY%)5@p!(!
zcYQkRhn$I;gYFtu5Y$l5(1>(+Em-rlw!@XFh<W=&{Dmq;29gw~R#(?sXhK9bLV?4_
z$?B*EX=Eg$V|D$ak~CnBy+b0E`vPjW12}D={z%dN*_#0fKG3?pJP6lr$yllOq5<Sk
zo6g1;aYWxy6IkCDk-mmI95Vu)s6`Wy-Y>`#nfa6R&q{Pz>!l30$oWiU*-QIxeX;LM
zX>M=A<LwU6vc4p$*Q2n#?@j=qpXhoa_U2;|R%`b|_B~#IJoct}NNeN~<RdwW!8v>)
z4i9>X>Wsu9%XVv$wLC_avzJMZ-Tnx=t3r@8o7W7e_W_vmoCPQ(sKtXHc#ImfBMxR0
z<{+jx8NnWCtXB7x+jcNEt`<vc&YpF-2Wx$o@C)?S(H;ChO3|gvqId#;3xl|bhMay5
z+GcWoX^5Mo`)6hr#LkoILYXBzI|{IGOHN=9!F{}8H;#IGamtRxdLEl4+CGBQDj?DB
zRcw5EZ#qYJAkNWb5k4j1$Gzd&WP#ArXR>wL24W0egsX?ekrnGb2^kNWB{H7n1(K;G
z?Y@mW<gk6=oe0S>-I^D()3qAwD_w9R9$OW=iRxM@U68<E#1lX$5rM2ndkehHkF!?t
zJ~99?xitJfH(<_JGpMzY85B!mZwP84_NEwNfOa_#o;Sh2@Kt0OfzV>8`E!$lay1`>
z0e1w>tz4Alhw<bR-!$2(i&=+T>wm4JuEiNs_lBs*0rL@R2R;nbqI^*Y8uFrHtUJK-
zz^KSx^>KIkP2LK2dt~v#SSaB%j1SupQ!>F#4uK~Y+E2vT#buXaKV&eGjy@LO#L8U+
z04*BIAVM3yJ6wKc@IWZWL1c)ElhfJihZmu9%cYmlwsHFQzuD~;3ABjlQ*;QZS&{pZ
zN4k$o2Ok#6B3&gQqKYPWV(38}JY+gRJ%ql&(rDAzAVEDa`AJo@Nr~O%JINaC69nGo
zL(_0uXjJEut%e`c<SiQ6BZ++YSg)4;4&_V7t3A()Zzwk8*!zRcyL3=gSFC#?)zj2p
zZnIlhvEqePznf)`UiGwF=pq@<qkuq-NUZeF11Bl=zRx0%7DDmJ4}%G9N<9P2d!DF9
z8#GLqY(4~{EBS>4xY`Z^zJ+pA0TLdADMg5$IT2-vl0q0!3>Z~Q$B^Vvk#|TG;};qY
zZN1mt@J4_Cpm45C{%jODeg7@QL6zmruyC^!ogWxwTC398q9nF_3IjwC1Mwf>vm^)N
zZpPB7{Qnwjk^T#SlQlvCj0^sXGWLbTXFx|a^Q?GH`5R7$i44c~RK=~CHNCJ}{0f~c
z?ZTPWy)Fl_jT>yp)ppmR*Sel2qswm}4^~VDo~#_g_2j8IP}~nmTM*k}hX_EqrAZx}
zklUQx7r+yI{Z96wNsnxtRgGZpEbT%OWhVBV1{Kh5p1Zz<By(?oQ);Rz74`|~R8<CP
zqs9D(>7(>SuBC`OG6!6KJ9o}Fm>kA2sAtZ{6cuG7Bgv*6x>B++IzXrQ=%|yGI=fOh
zz+JX9R|;-d9P}y+UeMZQ;DOg-+c@-p!<!;+1?R6a1m*~#yYO}L3T!yQwr3wR$b;)T
zVPTy6q<G-p&$qzX>LSi7N^Zz9DB@u_;I<z?2qjV%AU%Y#KVlUxwqDKNC3R1~1R}Ig
zMj8KZ4bwd^fFrv~rC|f4b*@Vj9Dvsb92Z6eNPCA4?7jf345s}(#D-~In3meIiafa*
zP+fi8^ffMrg(aVVy=I?crLMx<G7B~@x<L;Ki1ZBzN3INGrf!|K!rbOs6^)P7Gt2Rt
z(}%2n7}DN4Aw_uT!jj=Nf>>`*EUN=l(_gxU0Ytv?^QM2Q7TyfYW?#)+*pd7IRslGo
zp57PUC~)iUJn2Co&S|IFO3s+mz_?H&ayw<}E3z^7F%(d%nKwg#FvK0m((Dx+*^`!F
z4<@Kati3qUFfFbKVG{@<-Xx64DJa3KnYy}wl^jPF9l)d~{573!htsnT3xCw>OP^CX
z;+G~Yvi>jHFJEl*M0jRT=LdIJoj%@=ie3wzAMHbpRI7D4LU|)g?XYIHbAV^yP$UWs
zN??^|<OB56U-<K%HyctEPj2gsw4g3cGgVMEmVX@zQhIc(!nEr(x~&^@OXC9U0@rqJ
z8X+LT038JI&}nSI1U-FYK5UkdT2FyvofE;5`FT;TlM;^Goh;=bj<XE#*wt}~1QjNj
z1$t=nJH&ogf-?jO7jCBXZKRmA-tsK;ik(%<ajAQWw-1$c%$MU;^A=}&x8Hw-k(^?h
zdmj3rf3w<k#)$W=BCz7^pG4o3ewjUU@4&*q=`n8lgtEJSsO+wo;Vuek2yfa4%`{i?
zxy6B%&L8FGNAReeMAE>>{ZmzN4n#@8!O7~O&W9>U;qWT1*R6}8)A+@T)}dPfMU#|^
zWFY;UF5!~ModMY(`Zw=Uo^2RNeP93WD;I|6XLAe<_Bgqs(dkHBfSVCI^J5_Wr6=wf
zWq99ETm)@F&1{!xc<;R{Zf^fYcmC@`7=!P%_Kr=Uw_h|*KtIg_2T~I$?2d_sU?sdJ
zRD9^7>_e-Rr@dr+=)SC3%(%dK=!vs3B;m{@*$++rQfw1zR}c|ckflsfjO9=4b_9!y
z5^5tbNnZOt5TclgWw14cAvTt#%2Qny^;#!L8gLWgp8-?3?Et<8mpwvEHKsS_eZqxK
zy9m4a{`sOwh|Pk46+%PYXxmeRL=Usm%mcB1lPmL+^Q;bH|A7B>7qO}G&1OS1;buVo
zYS3sCq>gzxh<1E6*c}~WS{TlpY9pa8-C=HxcCFauSynn*VYOh`=~u}^Aa_oVq1lP?
zq1Y^%Y=6VlL9^EGo9Q<)RMr3~)Abts!^oz4MO75b`#F!FHU9(!fRgN`U;V?V5IqUD
zjEvY}Vq%Q=*g>RLT6KMMRLDa@hqdg=L*lbb5&8>nr@F~LS#ZX0kLGlmaCl*4D<bG6
z<WsTqXAOe1<m;Mfp%ZV@FtkPBx1A!HxE>ZS_zDIR1RuROObyo!JBlV~?$kgQs>2S5
z4VgHrys%Xl`{p45Cv@yBmtMDBcn~3AFbhCo0tT~kt}cL;m%y8J`*_MAIEHi)mdwYs
z0B2M!cfM7&kDwK3lNGMIpLigMUnUe1DIw1319CxVA5Ljh8@V4klwQh3r#ls%)`21=
zDWP;7K8yqgF-Q8Vr;uA+Dv~a!G;RVtv0+EC=vemvNz@p`wI$IlP68&CLeNVfc+hL1
zJReeMqF{OwR;iv5CutCa8A!%pg9J7>ukx*18Aduz-%9CvaU8v{j4iT|_^&mZF$^i&
zRLubU0gTKInjoR`HIh{IH4<a+u2lXt66q+V&p`~OeO_;o-Gq%Q_hJq~Lu<8;d*eq4
zDA#J7v6c}WS7OBp-%S^B!|pY=%NyH70TFX1C=9Cs4CYIpV0scA!U*>34>TRoEGZZ_
z8aKJ^e@COBZiJn8gk~BkBTP^sb*jaq$N%9jL1x`k^@$XGvtxw<Q#U}nq&VtQCd*@Z
zQDAP`q$Je$BnyOFZtb&OO^*^A@|nH&ZpjTaH1hIByK5C`Sc{n<I%MRnK9~d3JtgI>
zmP(+0__9t&xJs3h?<u%Ol1a(?OwQ;2?Xo^IegW^Sy;#UUY~lI>PJ#JK#$IENK#Vq)
zLff1JL|G&FO*Ob$NHXCJ;!68KeGPFaVp?o}Oc9Zo&Qd2sbaYC4Otf0!J-wlppjwIN
zeX*kzp<)y6E8Aenb}~LbQWLIh5rS)@8>6X*<_XUKG@E4DCF0|u#9bel{WB{!CQPeY
zwz;b%Qi<QW2H?=4gwo|(0c&7rvdg6U?so%wNhA>)^hfc`<MlhA__JU(M!Nsc%g^tk
z>PNnb1<9KT!HzvVnC6JpxaEG|+0e7DfX-y>Toxn4SS-M|^XWhT@gVJ8M+ab5^>Pr2
znwSR#`m1UgqlnvAoF5h99FV)X;kr3|T5}QitIYe`(5aMv!^Qe;TF#AWLdTTNBIE|q
zyI}k~Y{9+CMMUNlHqf$|`v=Apc%gt}<MfTWybQ<DC5KPoHjv82x(b*Bl4C(s9)9>(
zFT;93&y}gZE$`=6<Z2<l@t@Tb)K3~2(Aw^sA_1fpcov4{1Mdl9!gB=`SDll5DW*ws
z-h`8)&!dv$DC}zIQyvvrK<8}#MYFC2lzZI+jpK}4_(rj+Mt5zV$NgHz+WlLR14Wv`
z*i7vE@o*S_3`T6l3(e87jQF<FP4xiVIsT)B7<`3VfmP6xcis;8lSC9>-M09VL&q4C
z&ytWQ>8od6MC9IhC$cXuekg~N##&L)Fcuqw3(ehYix`J^>{O1oB@fwBZ2EL%L|X_R
zYk6Nz?gBC>F_fr}6nM0B%g^Y2qDeXz3urn-hDfm%7{TlkbmQ}{48%Xr$~9MAVyk?%
z9*yp}Z-qksuFQ#a70<sGlwdXoXOHljPxB@D$7I(TalSrqDn2;=G>4vk&I$OqJAFia
zpc?iltqa6nngrfKyfBuNRvetb<mt&961E4U?3*rVnrv!pKH=#2<@>~5ne77VkL)MY
zW2GZNSD>%cdo;v2JWmHkRdO34N&7441iW)NO<*B3%fX%6sP*TED-3hFoze)i;O`b^
zc;NrV4k=9D7i&_SY$N$K$>a3k7QKX3d0Fg-c^ayRCg`Xkd7a|o*FX`sM|<uL5wiR(
z#<F6Hgf!>U(_gJAAE|$5ZZ5o6v&8>mYYsxI0dbO!2ZNLv^#0W>lt~D#8y@Rl{qpX}
zCgz_a=T_~4gn0cJ><#!S)+;;VBC$JUkH$vti~r78>C_`yoOlB|g8%HMf`mdn8`K0?
zM?s)uGYk+Lj0X|E%kCgsJnP}l6{0jVVpO>!re^qc7iI~$YH4EG2A&R_EzouI%Mx{M
z`MI!-i=<C;FsbXg`}ya=s1x=&do85<nHY?VcoZ_Gw-w*yJT}7mYV5#taS8x|&Wi!g
z-vQwj#-#Tzfib)XG1&70867D#7C~5>S39YraSC%Qvg-6U7YP?8#n_{=vC1t?NAlAq
zq=im+H*b_DcthJ-vtWENB-jO2JW*H{>10M<gk3e>8$K}>7)H77<<JBnpQx6+(>cy@
zq1PlT?|K9YfDQTnnnsFQ*DF-{Bo*nXC?a!&iJFu!6!1;L2vU($RUaMBPYg?y_!!Km
z#7&BjDc<1$l}l(M_3HRVad-L!%Gw~7nJu}$U;{MyL)yTbHG2?-9scoaE27zD&<HEk
z=rr}!i~%rAEvs$pUQ{>*#xYV2i%d8vR=gTwg)_g?l7lLoqLg9s*~f;sNq8m+i2ilj
zjPZ)jWSjbkJ*ZSziv!hV6ZoYL{`l6CI7g2ho=m%%ax<2;`=xZSSvN^;=B;q@(XO|a
z5%az+TK3|4yjf=-q-a)dj|}Q8pS!~h1MF2$x1F9xB=jPgi>D`izSTa?IwW%pPcsby
zJ@`>fbI0z6{UB5_j4GtzrX}@(!l;_=74X<P;qjK)<G)u*=LgJa*5X>|Fe!s=d>Xfl
z!fZ~ui(={i3;y>ymm~D>JlpKPWlgy(lldTq)rd30t;#fny4eXx0PsEtWaKr@Zjj*E
zA{WQ_CrZJCrNYY+k!MJXR@H-{!Z58^Q%bu8G=^sX&zv%F0}x#<J@smvEZu}pu`#}H
ze}Kz>D1Z>6Tj|tMd;k#hx!BBHMJ^1mZ-N?Sr2m5_#Z8(ILD`F7d-;%yv{o^ZVKy6O
zZ=$d+9xxHr2V-gyzEGZX+AYXMi8G0o`$zElN{R&z41bOZ>B_;{i0JftYiA3b4#xC_
z<Mbd5ML10<7zL!Lm=?!53I(LFxP+LIn%D=2g&*~()XI6~{Qy!g+2wjJAtR@0G54bz
z=J4ZU4$||xhAeIf6pgbh67B?aS~Oh5ysO8Je?Z%m6NJ!A-Hz42TE?g~A(P=}xw=JL
z;j<b%o?+4Y3(rdu2RL3E%02g=&*<BkPcH)qo}2a!_E<TGlm828&~Am3uQ%#R`clF0
zD;cM>@Su}qxzxkYG~W~EL{hS1LING&7BU%mVIip|u;AiEi=9)Z!e=HFi~F;pl0C%g
z+9NSPYMx@U|02`+)NU7n0DO%<8LyYkjUa+z856b%DH(m@Xi~0`DLZ;qf*w)v@rEG2
z?35xCL&-@K9nODBTzc9C6A{%d#Z3M8Mjg;g3tfQm+bFg641W50uu99Dh23?>^dxoH
z;ud)|Zhhti;7YF{w;gc2JiZqxvhvwDNxVIoa9P|IOu!^&RDwvgf&!WF^hjSIBjU{7
z48MZD%YYJ8zOzFM)!P(ovC70b3osMe#3$#)bu9aaf;;Nish0cAPcQXE-4HX&#ChF1
z-$PjoG?p2*=q4|to!W8v)I5-$<1zH8G|z0i7o2I!7{UR5fmk4qsy|Z5?@_L4bcdXd
z7EJlQKrtUU7f4$qsk9c~v<u*9gmEGY3kIfzyksHWoCVLnFk`m6pl_uk8X8J9g7rHZ
zdSZIfUA*zJGE>x8tN{cc#O|(-`)w0-ie=v_WdiF@ly2M{>v{%%)0<f*|MzldLQ!V`
ztQ3T`_`@5C*FZ7v^X#RZjpZSe3syQQq~pCc=5wWlQNowgK3ctbb8`kiG<F77HTrWJ
zz$QU8tE^<<N!M6UjNH<NM$vu}=}aTyl7$?u7%C3f+}9Wj8XyEVeqH}IHl+oviuUl!
zx>rf)M|JiSmufSP1xiLdJtLOC=EArwf5c9(yS`;lZccB-PJR|+$^8keVXYs0-+8G*
zg+)>(8}o-w{OY|2CbLWg!sa9{g-ON;(1b(c=<z?%@pRDJGH-F){L-Nxj#A8j#a5Kc
zN2zq`dR;hYIMqh3e2wB#1-fHTcd(0AWBfb+X9%%ZAOrkJV@T&XaUK=1AIn84cXKK&
zgZJuLMhgQqH9sN1aT<*>^lw24Xc^1(??*gd7d<n0?CsoDHF}#B)CS$%2;7gZCH7xo
z;pQIn=eMSh!b@34vTz|l6$;^S$j?vXvbBgtOB%#IaEg0TAXoIxg&v&hUxx49c%8k>
zx`46A;rLBY7x@doffJ#sguz=&mCD}KzTLav0k7SLza_DA`#ea!(DNu$2Qm+rV`Osx
z3iRcOSAfQ(zKF<xvu8$s<g-E*=*knI#1@oc2yPlhQ+lI|O2-dU!NglYJj@!B^!Px%
z&R4LJ@iUbF0)-|A<CcAME&T%8Gc~61fSZoQ`Hdr%eXm}9o6jP-0K;)qw*p>Vc1w@c
zbPBG|WQ}G&I|REGAsE8)C|zJK3STl#?bz0%v?Fwy2l4}#0<IseeeE##!TUOvR-VE)
zS@7>9NPyieg?>(o+e~pUUJi+_ahc}TWc4@IZ<#jSo@B_H@xIdsb*87cqPcZa#Rbgm
z4kb|?q@qw;s-<~e>w*}<<+M5F3?^6s8Vb>N=j>=ya}#xDjdC1IOwop9vncV{J%Jp(
zL1X~AUWZyRWD9`!piJu!H2w?Dd1!-g6qLe=I3c8Ag5jXL>`Bx#oKZ@P)wMtrErYJd
z9v5(iCIqVo7Q-tIjno)Za2Hi!O&%z?Ua6K31ahQbjVHL}3^q8OWsS=me2hbdrKMsg
zk8I1=NRBW~t-FGVh@dx{;xwZN>UKZWBF3~%DWa!H5JR?~M4fbzPm|<1rJvZaOMk`q
zFW5`B@0dPHuJ-|BbC>><@zqj4Z72epaC?gVZv9ZdZ5T5K?HHzFLfh|^DF-e*E*m&M
zoZwITp6Rb&I;usgEOSrH->rgA;B}DI%wpvrReEZMAQ>CzrT&H>P}@<F^eM71RKUU>
zBz<m>M4MccWmlT(gp_IfrD-N+0W}eZcRS{{bE#jA1i^M|gt+AML*^sDGm#C8wASPQ
z`xghS$WK#Ky3PSBM!Ajq$_(%qkWpee)2UmCI(6{^V6)M779c%jOTo+|K_UgAZsBq^
z7L|i=lmNP5c12LHPc&}1sAAVM1A_h__$4C$&-w2cTW^nZmKgTrh=MkGzwMTZ<;wbf
z*T17H)TD7U9X&}g`+Grb|HgB9fyM4F2WY+%V^I1jIo%D>f5yciF9o5vG?I#>iz)95
zROZDw-uX3iPN}*UUXIR7o_c+mzzM)r1T{pQFlChv=J>~{TmfQAhzZ;k<J{rN1*pV<
zZAGUNa_>>y<%#GMfry{zLP&5B#U0wt0E{4iybBCb#0aOiQ(R9u{sWAPOJnU$4=z^^
zw>P5}fgs|VMF^gop8*w7M2@0@cq~1cyA__xKN&hp$)mQH5?f_z{3Wj<Yqqp3ZO?n|
z?fCMyJrRH(+J%BdW%@I6UA!bttu_Sjh%COm{A-WvRxmLq`(w%{&a7hO#{-zF9sUAS
z;i>W|hQ|-Nzk=w*{t?;<0@=?pio!QiPR5vm#QgK1A0@Y&%$&mW0(lIZYN1n*%st%b
z0i!HHR(%V;RB+)lU$89Z*dZv%m$0PZ#2)M)_&&%Tb*_`<&;fmq8+;86d+uGhWwZOJ
z(ei-)o>l*DEo~s$Z;nS)8&#&!u+7`Fpw#YoB1K&UwMM9#j~AEY1x(5jk_Pjjd$dTB
zhR3rw{(bIu_=x=~@(hPzF{opjE1fN2Cd4R_KTy+wi;{CAu<I5ORA-%6O$;{-OmE0R
zwKyvZGayIQNY5%o^=fRv2QECCYH~XVg%?$yF8M_~FgEH;5AN&)Ri|<GZC|PdJ$9G!
z1?^V?|G(Ee7)cx8Y?4dH!Hta#<tu=yR)u%=^<pgL2|AKAG;lz~N~-`nAh$>S9bv3l
zgz|f=(fzJLlvMa-(XB?W_a5~g4tk-9BzVGKvOzcY+VbcKI7pUD5DXW(3q43y3we+Y
z!aB3Nc!?6oKIcqCT6MB@frCY+HMWoVNp#0$1zhe9^#GPDvxEBIZk&81<FIL2UTeqx
zsja|^gZZ`gpRg8k_M_Yw{c(g#sR?n(rN--61Y4;nalv~LRvnTd@Da8o!ss5kD5XEg
z*Hp``KTDk)+#Bk8vZ;+S?&t4`+>Cl#u#Hhaz`H)SVHvo^>~{hKK9HN$WAgEXn0Eg#
zAL)qt22da40^qJ=;wbu;t#a0xJ;eGeRSH~G&PR*ngJ$_uPw;{GXUajoIA`AC47R_#
zhVoBF@)Zd0vU@vo9{AE&?O$S=Sp|i$z>Ig(sg4TXe#Y=pW$21@KY*}8auNRal3k!$
z*xI`*^DJPjnG57ENNIOFOPZ0?`sJdK^iM!ydbo?WGvCpaH~FWHiyrxzyR6&z-9#dM
zI@$g1Imb2KA;R$jw<uDLuzgu#o*DYCXl7djjyjdiO?4I89?XswK^slXnuZJ7EPR-s
z{H2_nDbzsi*r}*lHw_moCri4$;u7wNH|hIg{uwzH8Y|et6X*1)n+kQ#966mILYMNN
zng{YOK>?l>PF2VmXJl2819=-Jf{`nejxm|0oMpQe(zI6`&B8hvwNWV@c^4vraf9Uj
z7{q#PXl?z$r$NEz3%ohv%Q5;Ya)FaZH8jZg^IHOkQdZ3TxRIjmzl<eZ1o;-{1kIJ|
zHgyC$UptyEI|uj?zlKx=ulwXKXCpb(Kv}z4D_ts`x><9A7iYiF-ghshZ2^12yV7mc
z;5Yr6q@`P>g(xksL?S3WuLS-YE}KwrkJ=Sv$M$HG5Zg}886U-pv0`Buzv|T8Wf^@v
z3d*_NR)Y2=a<JeM9Ko>_WquDq04cT%+yK#n{L<MaMQbS-$St?vE}t2#8W??&J!z3L
zKdlncGUt(J5&3YH#|09k+=~M@%<Xn~!{00*a0S+cBsdA>De<qgjKlpalKwYO`;@H2
zjmlGV_xaf-SX)3yTDYGaYHU?KI0;qtjd8GpwOkE_S27f)ZaY$x|GJ9<)*|r1Y$x_J
z@5S5*8rzza;M{x<%FIhGgJA?rr`q^}OC>m6Ewx`+q9PZigf74(*pgIew_xbs1`vYN
zZQ#-ecWEIKB{d{sL;JJ02@pcnyp63Z;bstmlwP&irVA1%v)&zXg_=oxp+wys9KaLD
zJ?vAg-Vz+AV*Ho*pA&?&pEMHWktWq8v$RQr%+77m<!|TzHr>5T6Mk8_0GNo2Lk~;t
z!QWSqU}|942+sx@f!|9R`kQ(fG)g7|Lf!FgSzz-81iS&{MfbG7t=?T!)*G}A>Sxm|
zH|=R~4IpjaQ9Xnf4i~d6jzZ&lCP&Yz^zS#xw%-}}0zw&%Rw6DZ2{26-4*5+rO182l
z5IVPxDvQ0%EJ-#J9b0C-BpxRdM1Qf{Uq;TEt0-}}TH)61I%YY!IT1Y)S3EF2+)-3`
z!CP~A5~f%>k1SIgQ!l|zMhbKt6o9&s=oy^)yA7+sU@L9wTl%Y=i$+b7Af+5@l**TE
z$`ri;2V=~T6;!aVu!|QF00m>H$H%tD7G@6r-h?BnXl!Htm2CLrsnB97sHp$&m7o_@
zM8g1O8~F`Tg;nJfb<a&R7s`{)j^y3Z%^?)4ouM8AkXsSev9DO1-*0Rj9QF2nno#>&
zYw%B$?^AtUUnIy;K6%CYJ%;Jl+Ys}bD13vB3Q;S$&j2I<SbH#5XrTs4f*D}YY4cRh
zt5NGO#3x8XPK?XW-uko!trSs;=A1ajv<+=!N7-f)<!`LtxaWePRpe=M)TE2Rf0957
zGkgi~tLF3Fp{M?*17E$hOp2}v^DKPh$M$6_`R3xtpS{8f+#k|Uv^??U(Zcr;Z)YCp
zbP>C~uTZ{touPAn@CYE^K23b@w6m(J-~4?QAiwU+u6dh1DgWxWU!qx<xK?g~yi&7@
zSq3hQI|2Jo${=GHLVem^rhy3%le`5}pXBVt+G+{sD|`s~%sm_MEpH;IZGlgd*)^79
z+_yS5|8p<MH%IvyFKLj${e!C~^aq_(d;^Q&F5bI}>^H3)T>2~I&&B8rG(@!GIuup1
zkYnCxe&Xc3AtvM=b!Ag`V~o-${Jx5^neu)=?j1CoHLe`?t#SFV9f!TKv<Q698nx4=
z?nw8YB=2J2Y_`#X0dVw{2B|12^mb)zBWrpKG4@B5feB{4v-O0tZQs(urqz1^fFOYP
z-?L6`LW#BWW4xIeT5kJp<Q>RDp1cMUR3a!9!eX?gAQlV}D{MXSNP2t(WR<7H=*uJ(
z93E0k8J(Q;Q1wa99o<>s4S9;aTUYUXs$bMWkEwVnNMyDE!-<3P%d`SI+}L9U*3OeF
z9H)l6yZN7KMW;Y0u}~$-=z;Mq;UpM#IKMqaz$&yKx_vnL`2G#|9*pA-+=oWApQ4Dn
zGn{!vr?ADP09MBQAa>1LVU+M6nw-JK5x#j_@gk#K&v=aJxe^gf5khH)adI0(|0H<5
zN&9iKn8J8zcViK=q>=fECZ6YAhV^-0#1i+NCM9cqFZdOmt3D<7S0l654=c?u_HzXJ
z`-qLNtyO#oY@8Dv_&y6cv#_c^nvi1feJ92<Paj1%pTDrfj*VyVcl&XCZ82^53yDPZ
zo@+b<8+(zI#&15a51M<C7S8>Ala;78VUe%4#|Xh0Hk07+xsd5Z!+Yy$^*xmngD$5c
zJ%MLo1E&pz%|vUk8(<T@l-$L+;6jOzdKa54^{xXNuO+-py5tHliG<M-GY9|ObWI_J
zkeJ+w_|oPPsE<JtEg>S;?dmy)iF3){u#?+b-UX24dc^*vb(@>Yh|TUs?K-skG{#Zw
zEk=RxqxbS)hL2|40<2yaiB+2+eIDSvR+&;66&oRS8Qma$YyDaDj@+QA%?I`=z-Zkr
z3xx%5?)fCPZdNLv6%`Ws5lOf!t1i{mNy19`&7ntcwv6+X2n?1x+aMv)!cX+PiVtSO
zZ{Kz;EMT?!uY$)T4e6AC%AWQxyH+qZ!XwGyI>_1+k|9M-!y2P}%&yu9Dvhh&xXdOi
ztIlo4cpyLJjS$oV=XDD<*3Qw7%}!VXaYL=x!UWnsT%Mq%njV}(KF=okM8r>KaC4#>
zGj;bwnGgQLMA^|>PXU(&;Im+^<kWj|{e=OJoF4sGO#w2}g;Mo^)<qoRd~P^%*Wys^
ziPd3tR4okQQR83E!6&K1ySED<<Ow%Kgx0%Qu?Xl|v88w?l;Kcm1C_j2qdEfpk;fxh
z`}zxGmC~WmLL59J&@U+hhx&v~mCfc&jMvL+;4(~cjA~ieHosGFWqW_~GM`l|0@HGW
zX&IZjkJ4h-S3(IYaagOncxA`Rpi;64nW<s43%ByO9g*ecm*ZC|xC+cc8UOM{>;dJ<
z>Q;NyU5OJgBNw57N>}hj^xYP*fp-C{btj}RzT7<c@~entAWsg^wM{?z_S?#(^y|u!
zR_Xe(BDfoh<xc;v?z-Y6sJRsD9iKdxI2apX-KKZ1c`oi6xaHWVk7rqBJYsc<07yu^
zy`mfb1E1foh=eYmq}O+?fYr$X!H!iyoI<<&GP7hZ!hxqu;qN_WbjkXY?7Vt)$y$r7
z;NJ{3Aq1U|4GD8mPnVVco2;hFDgR*8Hfp?`uq{~>ReL#Q&9a2mvNn_&TxWc*{2KD$
z*a<Cs{QD`xvfe&=0hVjPKmjRIzj9^&1n@mCOKi`L!@mVGGDZra>$a5zhH~SY5AZ5t
zpG$Nk%8Y*D6%ez_6G8YrXJ{UbA(}?hOJZ#EJZz>ptS~QBT>O~V?T1OUUm%3Ey4&m)
zG2j4d6Le?c@#<1cq9+?7jAHb6sy_OW#j%RSFSBT%NQxMdIww(5XTKIpmlzU3IHAJ|
z8ZsJq(o~AnJ`0cY0152tm!zE>LJrIz=Qhw+NpBeod{WKlJKS9z$Y%{$Gcn6rXX%_M
z6R1B9Nl32F`_eB-nai*@LW$n#Ro*!5f}r4H2GB81Yay)F9+yLC+*kGn3@l1mr~~`Q
zEQW{rkj0gXes8&{fl7T9MyLavUiGiAw&i({gBb)&R}JtKb1@RqaM*V>fErOkN7B=+
zb<hEyu9;gPz8R=RDPz}G5;qR;h9T9nE=C>saG3gyyAmVn1m8#Id6&ZA7Bhz_AvBZO
zQyj!dRH&%!i^2o(?)5FVj!ndc6fAfv6McIABal|DbJeM<9ON6Qtf7Tgw!RZ5-AO#)
zW-JNDM1*#Zw43!g6xseJ6|^W>#dCABBsmgWQWs6I<P}gZE*)E9t$VAxjQOa_`(s7s
z2I=r}xnGcoRuQzyM#)Qh#j7*4Bw8lxDZb%#kHw4HZ`#m7_s(uOHjro7abEU|s;|_E
z?_E0IQf#B}NhrT#{~|Fe=0iNc!<8@kDJq=iQJL0x(oyQ+S<OV|TRG=Am!r-h`tNVi
z3c~ybcwY4KRump^+ImN>cVi7ka`^NQX1Cs;z|<edPB5@b7S%%ktV$S$7cgKMS;Zdu
z!tO(3po39~dBrdcV$yjFxVT-*J8iWv#snv>V3G02L?&>@snV>_ZLyKj-y(b>=-#*$
zSPdqI2EeE`rMG6pOk(+*Mjo-AtU11x)yCBfkLfWzp1v7MVHoa~#az!UjcTYN$^yDs
zk=biiUG$W)z}wtWBpHPGhzDt}z9*^3#}Z?MkxKspdWS-qSqJ``M((D=kf8xgno`xb
zat*1jgpvD2!GlpQgwSlNxNrnV`dq{yg^M{U6Xn33g(Yjt7r{5Am0#Ju>Jn71J?H+}
zi>SWr0+TA&#|?9&NE7MK91;G`0qsEiN?50qFCL%<+Y#In$RCYlZf@JUYL~#ic2egs
z2@-*x%EnCcVm-HNP^aJJ)c5}unK;rEL;_yy*uAKV=o`JW-eOF#I4zh))ld@)u`$#g
z`VUfBibYEO!tIw1Nf!M@RzV53Zsv&>#pjm|aP*2+X$lt1;Nfc<*52dA)6HUZ<mF%!
zZ|XTTZHX$iP_MYF1u-WkOux1;T}uvwiYFI?XP4PO5Rk+<Ocy9tioT;m)69TZjAa7E
zgr`|Fr~3LyOrkElQvzG@E@?jqA!N2ly3u7Jxy^<?WH8b?G7wxRLzgZ8foQ>R+!q1N
zuK0j?g*SPYpa@`UzEhuiVr5I-D_A0#Ac(j5I8PfG3v@;R!_D0jD^jf?cibQK7}xn{
z{NqI`B9Vx}u5hg#p_yNGEv(CzgvLaVE50s>Sp>OVeYDG&AXPzhpPEi=i`eIw$fO>q
z9?aw`qQ@vKZ{dZPcFA1*6n&SOcBv!^R-l%%izoJ=Q@q1YumqX^U=a=6fHqO{f|Wr|
z$uUI|rK5$dS0@;}6mZ36Yg=(djJ9ArY^5^)!VfwGTiaCRVo8B!Iq%i5_iSHTpi;Hl
z)^c@<h+R-QfHe5d&cWGN>Tql~?D}68oxwQcf|N(Ep6Q#gf3AZMneY|in_F$HfDGc@
z$rVMnb(G{6MR!%}ovizq18x@UXJT6+bj(EA5zOsU_%YnbQYmvvL67Y$#CBG;DJXHR
zZa=(`C*$oP$|_=@s|eCR*ifcA12PC85Xt{3Cg9gq#qWdv+{6$<RNkdQYJ1<9I;bB4
zW!oT|z+{%I=x?`@a!)t<c57Ej8VA?QqubvL)o;7@3diKS7h6{@=uHg2D~q(s5X<yn
znAKb(#DQ2dJecb_rl`Od`2p&Cg)}e|T*WX_oN#p)HZo|~*b6>ZnNSZR6ao#R?v_>H
zk?5%JwvyQtH7$ttb6S9HUcyA!f~XLIz2F3uTS4Y4D3p6G@cJGUMLHyPs>w1PQL>_k
zPP;IkMi|h!66S%^C`<<Hmf~m(z0sOzm-Ht}LFTXx$-^!*Thc^UH&VYKo}H6T$@;KE
zEE-ccn3KCupVLMrXT+<PNM8`oEiH}H<^hM5oR5)SDY7_vpm}dl?zGQ1tO0fM^dWNP
z{vG>i6I<`%hqEMzfKnC<Z84jt+ygU@f04eY!6oNaJD^qY#9^W=+I{whf-34$V=C1$
zjAl}x^H!=*RKtC>A}U+~hT3~mf3RF!PL){9VY3<8)_Ot?7`)efyB`4bA%hY^iq@wt
z6$U)j+nKQvTDYEpc>Zb80|#&fid6bW<sUbkEWwayk?D4{*tdanXw!qYO?pQl1oNIH
zb}8nNyHZxqUYmC>N?8;Ti<nlo0V<1BzUC`*PCee{GDAiFAst@EF^9zV!hDubJs4hr
z9U~70lLE=!wX7J+gCwu6%@7j<<=uiu&%F8abgx>e>NTpouuNf`i9&Rb>%F^~D4oZ-
zJNwQUPDBhRg8+%A+eNP5fp9)c6;?VoZsU;xA|HMsgFUhiM)~I{R}rQ$nHb|UbZP?#
z#CcN%Ra3oj-Xa8Y+-&aV?I4;WulJnIIR#8)O{+V-dW<$Gj9*EEsAzifVe8?(sGi)P
z?*{t4pnihCIG%RcglvRflg?HBS7RjVt1A<k9dL@6u5rB}lrKXIxFXIOw~)61Dq|Jm
zd9+uS^|~pw(|sYJxE-)KCweV4#N+w;8Pl#bVsBCta_AhsClX^e*V_M$;#F1zws~?k
zjoHK|UEsIFC=pdf$$dv*C4O0fIj@Q!oPmscUT}nCJqC=)#fS5A^WkA8@I(08X*c2C
zG88vzJ@_Vg;RY!`_Wc~Rq5(RKqivdg{tYun$tyHQS75bhw^d%)jGK&I7xn<O(jGo*
zujrYb17%*<?D7;?=U9kK+xXPhROs}D3h(vylzsV-5<sR$N<;SXS5^xpMqN|7S%7UT
zr4o#VupNYOmC|*`fQ2xfjuP`PXPEpS>wY6$k^wDARi-|*8ZgcYRp~}=yTD}SOk*|R
zk`*r|%H<B?B#WyCyaerXCo!_W8-r9eXJL8^GRRhsy@D~|_W8A+0Z6U0LFzY#C6|Aa
zIabf#)?XASQdZvu3b{G>+xsG_hA`L7*Z5-_XcW_%PU;jGK({^~RFazr&k1$<`Zz33
z(k}nY&eD@}lAHbDb`uIo$o`GX?FPb%kuats>vMZt3H117kQRUU>Sjb3bKDaV`dEmj
zw8Kw=1BH?gP8RJ_An`kPti!LLk}(Jzj`G@XX|e4HGe<#yMA59L*-zzTU4@uTCqpM_
z=M*MLeYPL+vn&{<=2F8oEMwR{D_4J>8Wxv}4+Bb2!&UlE`1%<PH@Zr=^FPIF*(&An
zp<%l`<-A-5{i3pHT~7>Sc7;_2WR;OAhsUEGAmr>dqgb8>U#aN7kFQu7K1_nfzch5O
z_=VAR>Fl7Lj$e1TJ6{0iR8e#Gnx&(1H@5yXH-A_b&zt1-xGueTyHb7_;#|UV{PV7l
z!4kDNo_%H>Ojg9QnWEz~gK0R==@75xicTkH7uxCUusjUAAK2~9GN=B9D+~GBaII;c
zu3SH55ljJm-4{&A-@zd^ME7tX&Pp!6hr2ip868$L2wB`2OLtEbU&WWY4*xyEJxL*V
zHa{cpq<gb0O2n{4ajI2UA@Ti%aKP3pq)P26tHu|N-b?h$Yy?WIVOjEe2gs?oCoJbH
zL7O?cjT-{H?A2Zw$;t5Bd+cHd*ugOK^sCQ6?Ou?czn4X+xRN&7TYV=h-|grbN|$Un
zsoQO>Pp`~$WJsuS!JFiz=?b=PpJ?q%YK~2fe-6Xz4e%RK<SK9x4EnhZ$+_=e-@A@8
zQxZ~up1o+OTT1>X_O`5SEo_`TzbOMX18ex%I8b?a%{lVaZg278<7jJTyD`vsc}xlv
z_CLamJDPWwu^)VcVZ~z@pRLU)`0)!Sx?7OPtR$k`tqx>jyVBWp6O|XkZP1QMvMxl5
z8=R|LV4oJLa-hSSCjrNvu;>7=V@ne1!^gwSREuy5W#hsMd1dMeEvhQi4y;OHr-kx`
zsGFaV|2%SZ%z)O;C6c0lKgKtH8S@OYf{2P12W#|X8J_{fr%-(NJO|z`IA(;7FChfE
zKRs`&g2YzxTbJ8&uz5S?Xkq!G1gQ6afj1^cD8ur+0^2H9(h6n_EbWKBk#T${i3y8)
zdL(Cc_LjqvItkElAeBOg1?3AXw}=r&LTBma3y;naVCY@aLmvWV@5MH3LI4S)DTFiN
z^kMp{-JuM%@`iJ%CA!`Xsv0mHUEb)dR*hnw9XxPfTUIR}HgP3|_@Y@GMs)V9?h+!G
zuRzMMXb_xZlj7;C+SQ2IqWs!o)E=7p*vSPpeHHa{1&m-fZ~r@)N|S%-VTQT(u5`3`
z)Y6#*HGgB{%<}M35RGVur^UMNLg$>V6{yYgZn4isQTnj(Oz~3QBN6F1Lx8%&^VDh@
z=7-Og=9{CZ5K==Lgy(1&c-E?3YGCA4n5CSBJ&r=iV8mPittAYc2q6H{1`4OVF<>lF
zhvu2go_cu=PKRg>%|sX=v}!m)b4tV(RyP>^6=~m#$+EqAHzX<0uT@B0mxUu2;qT9C
zPNP#ut!p<0WO>-72Tq}u9>9xP8zt~``3+r<d0E*fIkPFu+y~}iZCALDx=nZ6r%3L)
z#iq2MJ!RD(Kc7f@=a=rRE+66+ijeY}SS^Jo?_xj`s5PJ-1Z!9a;^>s+YBoa%G$*aG
zX;KSzD+;ZuO&b8jD^+P+YYp@=7Kxz|9@Z5tOpWDhrddI&e4(9Zv^UvdHqJ<@T?gV4
zGV$VymlLX*IqeRqpTS!)>G8JVxM@TSFI-jBFi3TTp<{)ljLy-n=f9pFlH4f{k=p=I
zp#8vUC{Qvq^up$8NnTIx%s*(vSr3v6(gq`IB>CMRw2wD5_Q-ay(1v+?r?Yy%*A$h2
z(1xD1{}^mbBI!=pKKAkX2tC2IRulI#sDnmHTF_VUv3dRx)8rx)_n%iOlfC0VyU4Zd
zez|QE{Uq>^rqL_b`l5HqC+;?XU~HY|Y$dnSifl=W(uz$u#O!ERR0<1B5zJ^7wleCF
z9B}WsDs5XL9_9{opA^ixw+~3YsCwJgd$IiKkY{v4w}k_TtMyKcf66a`$`a*Dtnxol
zpoHrc(j%Ps5YF+Pb*GWc4j8wfy<;V+(+z=$o(jNZRT_`qKtw&1O8B6@KrKaC`=RgX
zyZi$S(jDI#sQLjZBG~qXyxZ8_j(2&Sx#TRJSfo7i7D_D^&N~CxTJjc~@lHEbE2x$_
zUgEr=qv(F$pfeprf?ob16y2DRILkC+-=SJS6v;QptKBMhxtidH%$)&!?EyF%A^SX#
z7Bb53&q<28gWYI5(7%Ma=QeP(6LUpf^IAPo6uakeV6aGne{0G7)3W>`UNw2|PE-f{
zfYQ-kjwAAg_3$vDd^*0e|MI__{~t021qK-4W7^0}Yo}kM@CIVlf?(_4W@^qzLHqat
ziOi-vy+rBiD`?I>6_x&unN3G!ZRL)S(j8n{WZk6d%e5oXU|M<d=9R8%SU9cu-N!cL
z!(r#e?<@0GE)&+kbf}!EM<W`BsaG^Glr*{0;-$UHvb*%^EkhFy1WuoN4r!Ry;-3Q)
zM&dt{6us`N0!CGIZYniGB{<PnX%gJt{)NE{W~(GE5Qdo`%>iaRw_BJ>5X{k)JKcwu
z;yX-q#|WG&f22r~pvfD-vX-s)iOe%m2$Dub(QnYz0s@<(@Wr36p!+rn+={NDFHaQ;
ztA3BPMMxej&)3{OKyGX{ZwaA1duba2wFGG^0l=?OP7x(_aeT*5h!>+;I!{=42F5Pu
z>LvS`0b@EtFQBm_Lg$jpJ-_X2;iJz%nw%to3PFJ^(7MqUya=q*ardwsfG`-6DG{$Q
zCffUj2u;;66A=c!zJrIPL4%pL77UTEnm%d^3eL+M>%{BlX;NlyOnp~hT%9#RIG5rM
zcv@+Kb{=MFZ6h6wn6|G~Ff_^!w~4TL%$gNLlFf6KIG<=rXX^(rd+z6iKnabsUq^|^
z;S--iyAbGPd055bAN|R_!?&>7P~?N681_mFH;a?i<t{xkO(HGb+oKuUx1Uala=;;|
zBcZznH*(@o-@r6VjJc<uCx7%J$%#P(cBLc;E<Rrg6}bY%XAKp<Bfed+00N{~Hcf|o
zKecx~4$h$wBD57jRqi#Z-h2ERN;g&iQ+QFPvCAEJ)*=fhl4Pm8>ag>?$nv&QbLtW=
zwG%D!_9qMHr+o=lJhihcYTKZh&z5ev=ZA158hD@+igdz$QF8U15J`oaV7>cKQVAk<
zR2alcM;Z`Gu|Be)l#Rfz0q@>bzGncqd>VjV0=hsiG&y|s&Ef7Q;0uu|?amRnA3i@A
z&-x(@tqA-Bcz63<a|sgeTA1YntZwt0+mKY#IKqC()>@A(RTsiFx4n_YPQ_JX4mtA0
zu3amPEydKOgL4$`WmM7G7D4}mcyO|ICkt{kh&uqpM05)78Z%_3D!B-s13P_VRamF8
z2B*tno6p9zn;YkOe>b1$>g280oNS27sRWtzW?r(-)>ZmWW>GBI!MwMht`rvZi>@kF
zn=krD*=x+lmflJX0@)=HBGJ`$6BqKfN%;%Tx7e2j^1K+BSPfcjPXoJv`_G841Q#6_
zyeI-ipgptH7!)+N{7;qe6+$3PXl^v58!0oN90l~gTg+9NlNk^Z#n$Zo_VoK^`2%fj
z3U4voDYpzTC4{@cXUsqL&}F<AUwbK?J`{#$=IeOIMi`f8zjcmC6xCm!C1$qh_>#R(
ze_jrs<i?p3KaqW$v)SjNv4Q(aPdI-Y>;gh_13_3|LA&Wo7&U;%GI=_SjV<aKWTY-{
zRmY`hMX&k1sWk3<1dm`0kVnN=J_P|=ZnAN23gQ0bu$0pLtjrs6ohc*P@vCfE3%&y6
zGe|Mm*bc1)=DF^}LE1N)fGdq9u>OOLZVYp&-%R{lx2pewuqj?U)Um6vWC!6G8w7WZ
zp*&?;s3X14zKVBj>X8qmB{I>}eXHlbYn8B>5-J0)5<1pd%FlEtY`Qf`bH(#;m<*dy
z-dGs!?riY4N71@S_H*y|YQ}kv<@0=5?uS~ixx*iV7ON9~w!fDzo6+s^jd0dHD==9`
z*lS2$pPIB4nh>>=2qFjCw5R{s_FTc2P0J&TsCsZ}lfaagj#OfXU>hD}(Y9%ObopE1
zqU1%DYy(gXEh4txjKx)PQMve<t4!D~D$nWsSxE0m>O~@pUPU~--mf`A#=1|SLS^Vd
zrVQ5%`R-KCkXQ*g?Vf->Yr`Ij0mBEX|FNnmH2;J0P#AuILT6)YvZxMsJ=d0=hyP83
z0tzy_77V!h#h|C-tBYerNKXjPA20LAHPWiw=`8O{xs9ztu-ySZOMGgxa8R%amyQsp
zrU*j<=Wu4WeV8!2nreW%;qqnnm<Fcd+KC+#j&{)>Lvu}+pBXOHLmJm~X&LP;c!LPd
zD0`8HRT|f~>!qD`(^T9lq*zeZ9E{X<CqDy@fh>C%Nt23Vjipl&2}v=6*5CF2@brzr
zk#*tL9ow8>V%yHd_QdAIwr$(&I1^)HYhv3I+s5tpe)!XS)#<9!UDeg6_Fm5dNs8h4
zw3$*QT^%<hq+A`vh3_S!Jj+Gm*0BZS8EJj<k>!m&*e9Zz#2dqc_g90|#PU%=Qvpvi
z8`p-v=JDG^&|xP`m$IRP{hN16UGA0e)t<{MHHf9_O+AagwbT;CfKLNE!Eo{W^&&^D
zDf4#TJq?+8Dl41)xO%{LBbrNmMkSdgCy`8gW?qm|F4R((K{xHW$dyHWMSbY?LCptY
z8vY;GPE!#C>QVT}RNroq_v=Go4ulQ-eLmM=F-ty6i5ZFKB!aO0sDQmZ_%kvg$Nr5p
z+xuHa=^kXr<P!G!2K%)p^dY_+f9lwanw(D0i)4%#?^!<je9eqWytAm>dSO#F2;E7@
z@pZTDrdIty@JTpTUKT&%hQQ(FCHGozo&9!A@`<%m0305hHH;r7_rk0tcoC5#8l4vI
zWV-U&lTv$wpU-yhip%AG8R}5zQ7mxUs(w&RC#Ps+phcz_M%FvaPhG|S7Cu)3#QO6F
zF6k{ihbk>IZ-bw$y+h3)GH(`%Y;Ia4syR~*9_mg-Yg8dr{}$;!-)ml=vZXvrvgrp$
z>;pE(a?+A*@y`x$5<I7}=Vj;yRg5Ady9y}I-Bjf9h;B6}u<1d40@^n9FMYW?pg6iK
z%{2;JTaXhM%P_DQ*S~AUK!$joS{ho#4IM=tC{`i*0SkB}!2PBY{Qt8u4uX0TdsL<1
z?!SomPGp7`8NK%(!NlQ2C|2ql_2F-*Y+r`!+<&URwfLkzCmUUrmLnsnt#AL0_;CdV
zkFcO=h#W3;uJ%Tt<~dP2C3aA&JPFkuA@hK+oJRJ*dygP*^TvOHtp`tN+HX4FWUu0o
zxp7(!tPX^087w^IJ&mw73@VB5L=V6bI}tX~ukYR|d%_QWZ`3rno=-XTR@&@fc(#;z
zP``U`8oyG9^bzPG*&&1~f3%YBHGdrYBHg)oRScRP#vMgZ1`VGxswo0W3S_>82=vt6
ze0-!#5YS>VXH+{brwA!mUuKG-l%^D9#6FBNV*I==Hd)be3sIdGTVy%aaf32^N;4{H
z6eTZvLOc=9{4?kcy}thQML3ho(uDOzxhDi)`QV!;6Z1MVy0UmUj_o7mn>=xHi+$r0
z*efXrVu0~z?1eM_TNm~N@ZdaV!~Ky($-C$30f_(r8X%oekw!xa{Q>CtkZnPf{Xo}>
zL)<-RG2T0Y_Ltv(?=HeLZ`o%K{z%b&*~dGOm5A4p=veDH?riX$Jsr*9xY*YrB{w6F
z)=Rx`GD4wp++mM;Mk5e{`D?Zy8M+{Beu}NvqI8{O=WRyQgSG>D17QK|q&wsVmhEql
zKq}7V*l}?`b(o>zfstTRyfH3s1?t+K^|mFGL&{tyCJgR~Z^%$)pn20laCMjht<hSr
zc@xXpsVCcF3$7wnYS^ke%6y(WK-Z)Lw?~q`eNNE2?XJW22;fxWyA-wnF=`u)JwYxh
z)D1COf{JD(OZBlsM)Hq@h?NHI+t=-ZyzKgWoV~bd%5%iiJMP=RfF&J)%w=O?cDL_d
zZwiOi=lr;|6_0f-{<-eoi?3C6W##Pv0z}PCoOS@;E(8uC0kBsuoIG#|o!qOf-fjKX
z-A_k12`*5M6slh2APzmqL_$O{jaJyO2&KRRmFzUtk@zH_tMbp4ELv(ZVQd|ou_6tn
zkpyZ-@Qd{<)~2up#ykOE$HS^rvK`vop(su_Q^X+*Vgzf7JtT*N+XS=t@Vy4D3qS*>
zIH-zB3JiK9kR2qBjQ0t@Aa<fqPz^*UI<Jf0*uHm=dE?Y5AdXP2nQxoKf^ErgC`E9F
zic_l;<_DVs#S0O5{t8m8Qe{u?ZZ#Pkz|2B`k$l^W(<7KO5h=XxHB3boN`qm->qI;Y
z%}u!A!Qx#{PEnP1a)_22d?csvg|e%7hZ&>|O>sfEr%|GyXge`e`zYz{uN=0=TxhR+
zr*1Pzt%3Rs4Z5{VovJCoCYF^#4=rW(RcYSQ1W#&};y(^uPo6|Li8>NL6i$$G&iEtx
z7m2^J<yIzI#pS-b+e~?cTI#{v_m5CM_`|D1LQWrBxBj@vc*d7ENL0YqD@+^$+BRT%
zVSj$H$Tv08;ynrqX;ZkwYpn$=DiNt9p+zr$KJqS7r!Uj-)O$F3U*vez%}q(=ngo?m
zolbB^JtVnU(JXu;bIrP$g{BvvJpC=WmWR-pwnhXGB^!)p9Wkvm5d9I+Os|?{0fGpz
znrux}u};CuU^w!HqTc#3@@jRe!f^340(9lwJ1hs1O32@3H7jm`6o>fV8*i&}6<}PG
z22}s}*QM_jV=D7M$DnrMQ5HfbLx1-vt=4CO6L4bVTzDR>mUYV;ujXx+a{C;$#lwOY
zd8PY9vue2yO=9c8u2WM}Vzgl&k#KmbjTaOB?F~oU^DNrhl9}mO3`R{!NCKzAorFot
zcc)dnA8+-fI|<`%&#>I$Qa8DlS+jiLoS%K~M2pb}Ys#@#<%6x$5*$62w=fxk!pV)q
z6*VSgs?U`K_{;T~NsP2UYH_ZF-bd#$pecpXO8W3D^nZ~j`1M-CL+4<z%;>gwM4cf$
zZVtua2)x>X$53nG_M82@l54Tqg)N(dk{thD0+?WXfCW<K&q3Bn96m=3y~W*g#5P#B
zvJ-G~S9d+_>VxTnC|3=Ys?d68Xt=y8E_ziw;$z~IE*)b<W65?npr5@%y&uxxMe>g|
zvGkiXj&B8DGGm6ca}kp(>xuSJHJ+wQYoHG3vsJn30x5E1Zr5bY0*-uBM!MDr4gx8M
z^dA7uo2ykM4Rk8Y@VhGNEm6rh-9P398tCA^Ymmvq@1on21&%y;_57ZWoi85dPT}vz
zuprw&8T$-9ZWl^<kO(BZm~oAyc7-8)#Yu8a=~B)4VI&3>$FBUS;`q6fjqO7y5!bZ$
z-p7SxG6JPUeK4k%6>`ia@-sCAIz@f1Mzv4vk=Rb7WGh845DBC>_l``ka|NY$X2Ej;
zvyuc26N6-=&Yuxnt2z+_1i>m(;U=&vrj3XaOs)y?Z5*)!q<j*=ViMgX98I@mC4O!W
zN$~->RpR<yfY6OUXqW8`lF~IcAMjHWUz0i$TExmnlX2K7n2H(DXj3}(F<mWuE+@a|
z?y8;73RfvL3ACF(9$Tyc@c}=GDzOP+#LncTQ!rSa#->xmiqQ`s!>x|x4vGls1YY5h
z7cC|PXvR)n-XSI)k4Ya?rUi;k=>|s(+PyAGXtMYCoT(|9OnF1-1Rpo5>neH5?3QGa
zmme!Cvx#VdCyj23;(9N1IBtrI;#jT+wZAvVzdXWxmCpsMch#^<q>qmTx`%v7zxKN}
z|LIIny#_zGe;ie0{5r$&pe+bX;ZFs-&L|6F9E;|?WKZAQT!#Mx@djMx{ud3i^R~V;
z8BZX?57^#r!RZYUL4MfUZh_bd>JM*lmMubsHabqje3N?Wsef~novY{FfzH^oprhc~
zx7JChTHhBlbu7LS5V$FCt-=9qQ@6>wm1R2--aTiZzu&~-sde07!qo|Tp;kDy`n}QX
z$((r5b+boAV^=elus^VI)YEpK-`{bOa%h*F(sO19AkDd|`6@CuR$g%W$~$POb&iw^
zS3=Uon!MYoz`c@Nyp~Q5=Z1R5t#Bb}OHU3HhP|LLSM>}6`w7E%ATnS^`<ZtIR1Tj4
zUgb(8r!M1ObsJ<01WBeYMcwk1@(sfmxRuoV_a&6cjp4XVDN2~zlriD>?)ptpo7SnL
zLUKEpc^p?#G@wr${7s>SqnsoYki*&h$P)Uqfdk_l$!uDT$yw#g*km;Erf7}l1Ga1y
z<P4<0R{hp}1_$XQ8qThpzV-6=`XKEMOs@kqW{1#^f~%ThLjeV;3%ctZpzoKVBWtXj
zb=bewa%wF7WBDrnRC2X>MFz3IE>%Xw57gaI%va}4qnH6z#7zw8W{i63XJ&SZR*;5O
zO!fquptWi~eJ+v;>i}8zO$bI4xMoGblXZnEZflz$70V`h-BLm!x<38H{(8~B(K6?S
zz$R&FZ?|5M44x0fI6@>cRgt8cf;Yf<Cg#0lymr0A@G+^yK?UQo&zCs0F}UxSkf<T5
zVB;qWS*H?kk6rkdhZ1^5l~M^gT=jzhrWT^#+N$`&h}%QFd%VHHXU<`{@VD-BU*5<O
z!+FK$-d*oF4kbk|aGTNNrN4Nz3szd~bJ`4To2!>w@6miKMG8k;@!OMc$#D*8$z{OX
zr`9Y@qJn}E<nvHEqyku6$FU@3^M2_Q85eA^Y1+ot$0&FsWX~qQv)3b8u$GLB%Eh+b
znW&3^n-0_L#kxM;q?^Vu_cS#*2h<$zBFE=+(noy#{|h#tJBxbUUeVi|`nTsR1cr_Z
z9PI_@NFmqA_W`|qO}Z>UbXsypj)a@NMX_&xw#fVF!=edE;s?r-Ie1EOdYb_)I7t6P
ze3y4o>cx79H54010vqXHM4@q8d(|Gss_RhrWAv~^YP_Ffb%nj2Gw`#5E5`+>hJBth
z{GVbk64hs_W4Q65o)je@?)X)^o++gv^Ql>ZSE~LB%Me}Zk7A?K_5e><?zBFBXd{h<
z3nHIESC^lAg@^E*bGKJ5AUWW+iVAd)v*!ecpCaQu23_H<ii^3yAn>)i>9g=c;B*Ct
z5*qSpmwWAEmJdkrgiKDf`cj?IE0WL`76FI&m9@;rh%*i%cOTf4o7hOBziE+&F;I!<
z?G#=2)A^71tR3>uy%$-kuJR4fUmnyJ^fS8l@wNZV$+|M^r;#hu3la;2k%-5~@Ssv$
zp$97hj>N*Xizb%E206z46SAbaW!Kc2gvS?DEMe^VoS>t55TF1V&d*zoaG{GBq<75j
zw>1UjI!h+WL-2YnIGV)I!6s%mm&4-28~hG03B*;OV^SYJ7QgR^qA?_`{#`=H<#-zW
zxqC#aBWrlCXP9<+q*A2KyKB#@WoA9SUmQ-(oAAwVKtrZT<qgK5@Iq?$48L1s{RWkY
z&fxk{4_?yR(@s9cm@lAzRy$8;R+$x0s14t^Ovf9w|8;k<c=5W`T7p0Y;fl@>6Ha;B
zZqKS{zS`>AZQpLm)oZ=oTJrXb?~5)07i)fX;f$yH`~|}#i>Uh7w56F5ulJt3a8rm2
z2ZAPM#`DznjFK4s>d=8pn0)`Gv)in63}YFa4f+-M$vllXyA66{@6n0e3c2opYi*A$
zF^!K*%q1u4?)Zuj=!(0~v<<QT`8YTaL0<CU&q++<W;AxHz_KB5&qvN@R;@pm*iw(Y
zTanvx<%QH=WaW2(5-Bqu0>v|EgD*m4A`gF@o<L^@C>SGLP#(&u|KtZ#805Yuvluu|
z#A$^#7N6Umh+sp6glfmAihdQ@P3n7GhpA7fI!2zj$@(#rcB%;r#H5;1f!a50|6tAq
zZ(~n32Ex*(m~b6LtfuTowK;FAR*F1Mj*5cu^_A+~w4lc0h*}KVa=_H$Cq#Mi>?4$6
ztd7>t(o2|tRCP|Mgjk6hOxCtFoQ?^}J-NKj*3|O>R%g5ibhb@SOoB;H5L8Jy$LR6=
z**81(jy@UW%#TdU=2O%d^@{}R@4ksb3i_l|E5Eg=-)>E}eRmY-d?=)#mOe4^E#TjW
z>NI#Q;Aa{7VgnNZztST*mED=b<%}lp^cA;ThJR>mA@@IoZvQ>I3W>r6E36hTvz=Ar
z&mhu6etXq-Dq1)LgLrWiXTp0i3Zt{La|~G}=~5v*8{b@CV=7vjmWRx<f^j-q`rq+p
zZSiRW%H?ky0YUlKKj>o#Be!lUg0}wC^}&G(*!87Z3fjJgepO-XPlI?=o&Y@wjL~pE
znm|G@x<H#vUbiJ03+6}q<80!cYL>^kD7@rl0GRy(u72!aI`!Fdh#Sm0^wI9sgvvSH
z<crt_)@Ml_6Lre6^0BcUBHM5q`!g`0^NdJ&X+WybXU~I1x|(W9o30zGZq6T$q&G`<
zF==>BI2SaE<lvcd(zpNaMb!G8quuL1R^v_)0)O-LUJ(hiwsgMNgHx$9>k7|9-N#6t
z&ve7QwjFKGG1^Xa%9pb$nB(GAA^=XweMhIsQ2q=&=(qQ=xY7?=zcqojFZ!mXD@Y~x
zKi+m<zTLSJOdUs$n9tb~d~JGVg{%WXI_`l$eEeUxQQ(~J8qx!w;#26#%M}Dfn1W$Z
zP59fDh&boTowLMx!xh7_xr%tj<J?%jc>9>j%Vs%IFh~u7mU*bIvCp2=!b%Dq-471N
zScKu|kOxh{&#Nm(pgWPABJY`(RO6U|vaneG<K1T)njJtkgugZRugixfOhN<{@@D(9
z4~tqH?=#VYV5xa0ci+lgs%k$eVavTiRh7s1wK_Y^FBR{Qnm>O`%6o}_sQQ8bp4}+G
zOU&Cl`3|sV=b}!@e-JRuC<0#hL#|!1{%EQV<pwsv(iyxhh}lzXy%-svG$_j7hnW~`
zm3_B*qr1F3$6g4HEauDK6yKW5dVe}+yv@teTd5O2!E`OmW3f7un62B5YM;U9ZoZGS
zTg6TjTZO9P?E5O2!7ou;7gZLqZ_M^oy0JM3NN3g-KlpX4a)@C#JBf%Pm0n~Xy*l~Z
zpd`d7rkz@`u!ATgvr9i!s=aU<l9^2@kF&~In0yn0d|H8L>sg-Lz?C{H$^yYT538-E
z%Ld`B@Hh(FKx}<#=5XV*vz;6G&utxdEoU!!U!<H94pb)jGw|rjV_zrm!DIhB?I#*8
zlMdGN;W>N)IkfOfIwp4|i1B^+B|B%iDRKo7a}uEj{@0+~^Cn6;qTWgu174p62*p%6
zW4!3Gk=JRgJ^lkTTzr>bwl-t<d%(S8M|cuK`+U)s=57q7m(Ic%LRk~F_jP|})4=9!
zEZ|p@=!nct@<r}apC|24IUK>&ElWZh>RX&{tSTmO9AnYM{M6}p1KNMks50N}!KSK`
zM&J#F|C;!Rw_E{!fQ<oy@d<w*OyWuE*c$0nY;af;*fxW5CRRlg`GW8owmGbw@H|n>
zaD0M;xvqAG-U*KEu#bNyu%DtF$2fCgx$Hs$lD!u6_7o0OG|}96<Xkz~q2OMR*}wkK
zjWb%nqqEP^RC&IzAoeI1P7OspB#V@P4!+L%xQ*Y1%Cwt)41V>!#zKcJ%s?1oFuAX7
zKD`&gge_3U(GbAq3IGItlqw)rh#yeYoaO^ydil+QNU((AE=Rk7XlLn-bpH|RMg~rC
zETF=0#`MOaR{9+QArm<CI;`&EJ*^d(dunu?u{ytT7=f%eo@3?8y5ZNj2Vls=2f@9?
z(QnA6sI0<+JUF`)%B;eR71)Vm#0#Thbar$gORDQ2xUj41hQ{TVhEMSKHQlW(X{SOc
zeBtczaXw2%DZb|ZgIFHmSz-uKPnK%#K#V2W=1%BbO>C9LvJSf|1HqGhMJZ$xV<<Bq
zmZu5TWtA7FM60v8qTboAkQD+0PtkU4Y+f3EU(t4{H^j|1{8#9!<QpA($De{+(Cb%7
z*b&y)aw3d{`NcoaXBZgT87pf1WzUG^Y5-D}^JBF$=b<(BHZuGSYNO=^6?+x#x_+V7
zN;~+ZhQ+ylD;&~(S)hcg7@D~{X;MDyL>XBWw==qzTMxW)$k&g|q?u;_vk?VPOt1@S
zi?Do2AFV3k<mT0oM;P|{|1$0Wf#yPeOkha$AQv62-Zghn)8hjeF^Vv%$%;JWLOM%(
z;pPD)dhj5I`Mx>4q!CrHD!K!8Si9=zUsv-##@09bXSc0s_fyDOuFOz!d&SELc{Rg5
z5R^FuP1o;tVAqF`sbDU?8_7EA)$fo}lRp)7dPbr&zSw1eahg3NGVaa!pS3q~*FjX~
z*g-v_H$R>cLH42rChV{Hslzq{dcT6R$YPNL1ihzXQc?3CTP?FjwbGA^R>r_aZF4Rj
zKd0KNmvib*r(lkaG53rN-HRg?ocKR#yiW<IfvGyQ#VsN1>tCqokrb=a;(m_>$Oh;y
zk&8Sq=y-m^Goh<4gFg*hQ%R$vn6sJX#|c<lDQk!s0<5!$SQiGrE)y6kDQl6Kv9QMI
zZ`S~kl@-GsdC_~|)Sclfi~NSo+GVHaowU1jTGgGOKD`~hqkC#rx%ME!aYPswI>;dE
zV$cEf6i}nhRO6{Z_URo{GPQ00g|wx-1B%kzy9oKVS)3gdN)M!KwL_r7GuUZAAmkPV
z3R&!RJ59zobw8+Cls3$a!YofX6#v>Bl}~K_o9-32w9)))>r~|jRr}-`S^J5T-BS0A
zxUEyxtpn4s2;~uYZXu}ciaTwACI;C3CyQTUPp`e7`})F(K1Jmj)d^#pF}wwFi76<S
z%^==mxQzbmIiE?p79Roo2x_~dmzO9^kVmz;kn05Y#MOTH-}Dk{j!TG3YNdgz_+AoH
zVvWk{c&nd!YYzCiX6+LID>C}Y3k+A?yEbgn6YQC>4w+k&?hs%x^`cJZJKdG@<%5-l
zaTtQdUOJqkhp0b{bsjddnt|u+#=>1S<XrVOe$QPvUucuS)e!P0AH@~(d0&S&#YOgg
zcU->z{P_V?S%`xl2HF?YU}B8eftW@${H?+zT2rt=acV<BcYisSy%bj0a4BKZ<u=xb
z@sz=c?>|VFRZ6!czMo8RQ#c9i>TeGgE0uGT<3?%h3ez1NMrpiO=WhdoH9~Q0gHdn-
z(!rb|Tmz^l9NT7!%Y?VGyh(7&=Su!Vx{MQ@p3C4Qmjz9fxNdNH2eVVZ*}Poo0f+i5
zXZ(lt0P5OXf4QAOETPM_sS9YKd{<;9eg%fw0&ug?_5rHgGB*v>K-TK(xc+cs_aRqk
zMu<abMzd7@fwuw-m*A)`N?!Y{pVzfBT7^53OfI2Q1rm&f&PCW)l!%(_KM<Pi^Swx5
zkF%rs(OeP?HMhVlNC!8CVc^1Cw~!_KRNtJe?y=f~NJM->ktv=;`pO;6g~C(bT0^I@
z8Iy*PRM*M(8NM7@ug?RmvqOH5tI~nu4u<}44wzN8w%jRb+*KTTIJrUn*GhIS3xRd;
zMbsg?V9d$2@}0O)0x_rrHiNKRsy6_leIPs_a(5m<(C!wFsC4&xR1Cb&PEbb0zGVKa
z5XwBgm@?cxi}9E0D)&ZA5&EdfpqtQ#ZMc;MtHcv@L8X5oK86c~5{`sBz_1Ol5IXw-
zzoQi+l}5wh$WkQHh(tS{kXD6@2GgMFiB7g>CKa7eT7cE=C_~-lFy>L<AVclzG<LX)
zzJ)AR{Vh0=2X$;GaH?%|4z~o($LOygJl}euuYi%j^n(eo(*CcCi;wZ&7Ukoq)PM>n
z5y@Ay&Cb~eFv4cC9hEN0Wu(E`Z;9ac-+uND5;4H(4lIV*kyPXnRNEPDz<lmD1-AY)
zGQ{1nG|afQjyaC_b>JNk3BJDd{N0cX6((Z}5FUsEU`w%?lNiB#82h^UaCEETLG33-
z?MAPAbOlw6$1}3U+Cn}7(1!=hCp0MO)sT5gGc@*c>AwZKzA;oTJrT?g+Rx_Uj=8Am
zL8oQbyb9>4r3W5FyDZlDZa{s)XW&R7xH!8A<v$1MaZJ$3iV(#G!vA42)YpQ~Khz{z
z+RKW^K$MmG6?pQ4Vi@ikRF~MVRoJVlp$R~;4h3ITlhveSmZGUMHWzcYrl7h`bZxu+
z9UX^p=JYYpPM!XbSJUU0p7vf%e03EDPww%U1NOa`0+Zg*ep95~eiQTWBP1T%%LL@I
zBUNtv!Ei~-$kOBQ!bF1n8MJ!VMVL5~yKs;q8qytuHg#>%?Z;$mUkXGhqpQi?8K`Uo
zFaoD!Yx%QB3q{^^hzSf+ikX8;QEk#=?<;%H3!Q#@6!lEDF-RQ3+T;m1uXFk6>2vF2
zxt_ES7sI)B2B6awoY8-i85!b9kez3Kwr(AbVF4n<h_5+V%OgYjRqzX;6<9Kucn=O*
ziUaw6PLPYM_<Fil<it&vu&9Qopv#(+Cd4DSM#UOy+gA)=QV;8v)Oplb-G9Tk0gqON
zkH+bc$xkgrX9ADLxl{XPMvcvM!vu{@1C^)VyoC-Mecx2Ih_K+naEeLl)FpJFy^ta_
zBt;qnY|rVP#VEY4P0<l0ahTzrd*+jqV1z`*lia||LW?+ozaIOoRp;1BdNUDwX219A
zpAD3y8Jz8#c)o=2%F)o&6-j^V8guYMnQAIQmzd12c+wKzPd}NlP@Udm#}DBVy*%<H
zk;o~*0LnPEmOVkhE~Ev<2(8XJM1(zNh>vdFn0nvf7R%i42J`X(jD>DEn@ID;TF9h=
zG&Jtc-lb2Bh`vvF3BaqsNmSR)gfjKap;T5l!(%Dm8OSj*7K<7NinTBnU3msMq?+}%
z#3nf(ALE&#h0!qhcV9eHnPwXq>NT0w=*6<8O<1T1bD;#&&I?JEe(T2aQ+a1VVPBqV
zHiT;xEH}dRK+KV47!W%H{J-|=O;a_`Sz)f9Vzp3|J#^qw5k9+F&PYs=yXvsjyTAAX
zdA7eg7FJ*}w|mGPMxMUph-oV1C$L$DPpB~;z4Ruqg+WMeB5fnNqn}Jd2J}{(2bLfi
zoD2$a*cIe3HGh>e8FK(`8sww6A>vzpulHC^)mxDC%*Y8;^6_c6A$qW5aE4gp2Dy~X
zo8bmA<t$=ygh<7636ogNv(%P&e*H)Fls9sW!%%Tmdp@|C>tJ!&r~guYNnc*;3{-1~
z`aXnZ9aWgH<qH^zhMd<I%{wh9B`m$SUvE}5eng@`>r!XA8O`D_vzKYA1^_353h7s&
z)CU?9SRWcMOH-AjFjp4_>|9!mQ3e!P`XJP8OOmlnb4S2YNsx(`c@7K9X?m1>pJt1)
zP0nDJAp3$&GVU*{=)h~z{vd|-#Y=h<sctG@Loid+p3yDG<n4Sk2OmgxfI01XR$``P
z_JMaV05=84kc1&K8xKTJfJ4mh9}3TVl8IE5GJioPx-^h7Z|hxV%X8r0IV*0I+Yzm5
zVt0CG?F@dG`zJ7<Ucu5C9HR2Kis(zIMdo8}pOx5d2mT7~XR9*Niqo%vENYt>T0Jn;
zh67VT3tU0k2fk3g`Jlc;IS-1+#302ZD{l$Dm;zqLFeE9JRb;$z*#cSTxztiDA9LLG
z7ESeKK{LyHAPV<x{uWhr>@12)?`2*C#i`xgf!hpNhxaFvuF0~a)~T;b!FuR`>(vex
zDsw7~j~;sIDf%`@12Yx~3XVQboe4?-`6B&W>?5pO9>51Jg%UFb!F%`Z?~%YsKP7k6
zG}-PG1>ri=y3n}&A@yZLDm1|VHK9?;&7VQ}cGaP2pOvZ3EvGNbnynOr)@@m}S#zW0
zSDHHkznyrvB!+D^Jl|p%_XPqB%Iv>BS1(Egm5LcQly_Zh3!~wuT)yAaO?~nk=~4D_
zHW8XD&R%3V<y7E7;P<{tVbB?PS%8hAv!<@+=wLtT1A{4eG=hRKQ7GIHJJscm13WKD
za^?sjz1&=Kv>3^o&8bsJSg5#6rkgA31FdUNT1Q22d6`J+0?pIyhhzGkdw<5Lo+U!G
z%im{UhaoL-3cf!yt^15VGZt#nO}gZZe7SBnf`~wOa=0Yz(!XHA{7}yw|NA!0cr0JJ
zyJTN2L|1mR3a858-9%39#;gWaUa?7_L@DQ-Fsn*<dDAbw_&@$W+#Trnpqk4T6?jXG
zM}u<(tGcTDKsT_E?2Smn;4&qr{6&@4IKJf6DXsc2-)yy9>lHL1exa5yHLZNpJA$jo
zRE#L;xnP@adjr!uT6(<}nAOg~>@F-|F;>tCLV)%jXO2_KJ)#3j0<;v>EV5Z~vmzju
z9_uliZyWiO$i%Tn3njVOhyS^Z^)Va6Jy4fM_v?27g5-2-(zB|AHY8m|DO>NC37eph
zQwazO^wuTC_)qT35bnSde<wz%(=&DD?bB8N_=H5!Dp8pE6+qVehVi>No|m5HU4K@y
zWk{ZhLId6%0dJhs-YZgzl#YF|t!`}@#A=2avUO|h$iO*(fjy%W4|Wg(Y5^@7fQ5EJ
zfQ|MxAS4=LFj1$X>?UWhR0c|`J=F_uy020uRjd%YA>|*>Qk|1e{kuopoc2AaV`_yN
zv0uo6q8D=R1IN0g@`<{%&or<+zJPV*DZUqC`ghuCm=H;cOEBoPw8PtZdRO72S0!A~
zUqxyy-sqBq!Qq7i$r%jlODMW!Tp5kzy(r)65c14SDFSQS4oS5tUqOh$Mb4;GVRB$5
zfQ389xC(le+c{||Un%cmgVmtrv~q)nut{llafY6s<(e`a*MM{=WeNbS%`h==!5T{C
zZxRP&zY3K{%2%`_{z5$s5Uh)-95;k6q~t8A<~p8XoFrZtEM;d54#X$8m@A@5Bprm%
zG!>vQ4k%Fr3utZ5lZ!0w^)G)dS@{o=Ljh{SZ>p)N>h|BIh)qw(rG&uAgu$1_{R6#)
z!5^(N-I9LC{-I1|Y55g{)Ux1Vqw>u}Xt=i5<mZzaqGjVYO2~M|)<&&U=yCS{ni3%k
zk5e&i0zv=izqI+L)eznRXj{e%SnoYqsqZvmiE0(7SY2RQ4;rD=UZqG$Z!UW}G=n*}
znM@MXDGENRxKk!OLe*_SY~edKyZq4D3$!=YDWH6@ObK-Y@DKpK85Wy?6NH$$=?e!B
z@}wT1GK7uf0`SUEoSAGS7xJNeIfp>=(yPJEZOnxI`(6~`3qzgv(YQ}0ery)ryPivq
z@RB>;-N6q6?r}oVLGNyv=v+L1r@aM<Tl6L98^pj^$UfPD04t}qqNpBN<-C&3AII8n
zhTeElw(r-{P25k{8@f$*S#hmO%ByXq9pDQm@5a!c2yhL-@Z%Fc5E4L43%_4ZA3o5u
z1w&fEerC2#uE4ZE$k6+4R9Q`rVYa;*P0btxzUx$4<k|yzV5bg@IhSJ?5DNEX6EYGc
zGrC(uQ#B0#rTFPpBnbWeU}}-3cvP*VJh%T5%`Bq!y#;7G>Sg8d;V&`AjgF43h(wzf
zZvggdq;0tH6-ke0U(utWYZSkG3;lT*p?j<4x~~R#ke8pv^*~hmdMp)G-9dOd77niO
z**uuMr>(r=8=&C_mGQh+bt`-Vx4JU0p=Z3A@tSdOdC7<wH{|Tj&_1ylI#!?C*6~_^
zd5p-_9f|xms;j^{6XA!!497g7%e{gm2l@WQJm2P?(lH}E&)t6)if<${>^in6GQlcg
zG6+APm)d?}mZ8r=8J?=n5JoZr94oJCpKFd=5CWjj%zmze9V-&5*gZT%lyoSra{cAo
zlX@-=CRta0L6K_1K-8*UkoP|LfowzM81{Q1tJi(&#!>N*vb+BLuTO9KYH|f`lHktU
zYI0^DRq=(2TgXNzhZ{eO#_I(#In(cYK0KKv!JJ$KCs44dXss#!?G31mYwEY>+Hh|F
zBRF2lAhM?Bz7jc8GRpnFkflf+7VH{!s_e`B>@Yp*LNl2^x=(cF!C3ydJr^uv02;tG
z$c2s67O#|KI0Tp}o6VS-a_39?h12_rdz-7rC6npEp6%7zrT@~g8`_7^`7Eh4elMaB
zBXx@N1#6Y5ps;cK%Q$`0Zem>vKn6&&NjVZhm(IlgKoGWmX|h<hn9bcmC{UQmhs5dq
z0V~64Y=TQFr7F3LREdWrT*O;$^;-yal^SssyB9W~84^M1>HA_`tRW4p)tnK&u=wKL
zFY0tD_&z&We>Z<2B`%q8Qy5O=zZ-3lG1e31mvP^W)9Rt`?jZdew}w3aY6iFSsgFj8
zkat;JJ7zJUywL8W7s-+xC=-H`WFP+mdGp_~d#5GU_T0t4^|gINU=HY>f60T`^k2cv
zYfQI6?BVWc0r?AY-6%pLKrHb^cmi|4`Y9A|=|2n0?@cP!3MMrp>A0dUVXD_niT+UW
zVJa46J%Kpqn_N!s5KInaS3y)~XxWU;y2?#On=apE%;M;x)EAzH{N__TbTF&SuVin}
z&V<5L0m^$^0n3%*8vqvzw8G;}Bq2*QJ-`|3dp_pM4Z$wnXZZOhdp_Cl?l#L6(rO3)
zv0M8)<Bp(Y0twVh5K=FuO*eo&)ef))^$uWxuz?Z;s6xkxb*5lDoGBB2F|^49dx<|J
zed^54(jl>^GMy}im+SN7Rd!wYDuZQxIUV2huhy5fS~ULK%4C7fw2m@7D^=dlEgcN8
zjuN^uXfi>aIhhqxyAdL|LB6)Cic;nrM2n26Y`Pgxrk&h+Qa2=xv!R8^C8X#smaW?A
z<MS?jjk$Cv77_m2fzVC_GQ9;0!HUi@@GzIueZ^Xm=ExqB5PrQ|tyw_YT>)_-6sZPT
z!1U3jNf}~b{9sd6h~ok<kvFca8>a}5HW8(Edp`sd9^T<Qce9fqZfn6H{5_>)m|*si
zh`uEdp0E?!KZirak>j>KQ7^)sk1x^f5K3FBS7NLzrwG?!^Iu8H2xHHs2rKPJ)C;EQ
z@LXQh97dmCWPN4Ccj?)5du1`%KW_VMEWSk^+-};=z%QA~<43EcU)Tk!6Js5(xh<P^
z$gYLSLbXTkcUH?Hi6TDleDfD{B2pO(EG6zVoRJ*v|0DGE2rhpy5)-OV91A`h17)H^
zo4|!%k@5gGYRy!?V3e?gG5YqRx>Vxw^G9IkHuy*BcWSk(j#J)P2aSuB)D%*bj-&^>
z11I%jGg`-zh<c`6Df6+9e*v%wQ;0^EDwjksgL1qGDPvR_ew4Yk?$nRjAbHgPn&Pt!
zCm})X8l`IvT5Q;h(1Iu}&5A;!$}$9M*$R!}Z;&>5#xV+Nbq?~HaR*{=!|eTAa6tD6
zMojf2Kunqx?|oQl@t*ez*r!}fZe+7~Hj(qx{=*|2`nsh%&x%s$sKQE1kppArUiIy#
zd_fj`!u_3IFATva;8i|#JX{S0xJ{g;zUrg-Fk{=>%@Tfi)esqG2Vr{0(o$8J1*$Uu
z8#DLu8L$X&>R)F1SGY#hEr_JVDf1V0021D5xCHHOjmlTVpQfZRP2#+YIk4ZNyu8$m
zAlVP<l=}K@*K$3*Qc-9lKRlrLqIF6d>}i=N&?*bu_^SzE61z*Ow-vbyU1T|TP=;GG
zf4~ujqo&ES(a88i?C0|W$+OJe^(*xP5dxH+V~eqLDLtl(xK4eel2qw(c%!u}XqsuH
z5tZ#B3$k8eX-gN%*LU>vYt~7WXMTS){UQsdjH;ukB!vTZRTRNey&3oja0F{$7DAg^
z*`KBXRxSaV7k+RFwCIhSbOG2@!Fow2;037{NWFKJ8uSjol|sUAR2~L-3h)Y5P}Xu_
zMn6Aj?EWgr!q`qh=z@q7pxF?odAR0S5`i<KxrL*+k_;hO|2I7N2JRonGt%Z3#OX0_
z@+vb915`)b)pX}XlvY;Ldb`}jn^@Gz4Rkp$omcQF(vh|4UpupBYI(C4ijF_aWZH$?
z2@)j37r_d$`49=!d+^#YdSD6?9}B_2vRVh4WX_MS<DnrPjN;~KW&RHL;e<=IQ;*@9
z$CgD^E*DKfd{ReUImQJ$iMwMt$31)tmsk@j>-c1yX;(Go+$>BOgQPf8F=8hdK4_!7
zoNH6fKuUzO8h=0h2&&P7-;DqN2@SmP79i6wXSIVy^=8rqggRj%xMSV4&`-8@Uz0zB
zY^N6mae1o@2RLp&2`@M&)rnZQ{zfSHqyRevO*@m(<mc(9BJ3i7uBT5B1#$r_`bj$)
z+t04vK|QnCfs&ltj4P>PcSvUUQF`?+X+}qcDdXU|zsO+!qy;z~hHhcDXfXxMO2*p{
z<6RnOH*@4Re#@6u)f>=*y;b|8P$?Hy5HG29nyZ-!(Kn$nYfqwnC{)LnMev2mzEP5{
ze^XJj3ER<nj(53dtJ8tzmNQ{uzy6Dp#xaafC=*~JLfw5?m>}bDV5;s&uZU*a?92*O
zNB6PQzex)fk*Owch1j<qvf`pGslaDBMwKjK$DAwmjIlG5C?Qu^%DPlQvI3;QF}FlO
zrf4ybn+KW6+URzZ3Sex2-9n!6^?_Z(2oFe4%FJS}Ng}{emwhA3`M>(Iijc%!P(b1u
zUI%znhyd!Y6lOVLcIga(wxPPrdsopJqpr>y*-J#}Ok~SjD|@Odz7NBVcLt`V-VF!s
znX!+|vfhrh>Qe5`PjhLQ1%N6tZRFFlbqN7A1Lh+jKep3JiD?)b1k`vm(VsW2hf+yI
z4e&j%ajcwydB^9)%I(7DvOtyNi93~DTdxyn{h|Xz+XW;+Fa7k^g_RxPkt<IxOqi+z
z3${&9R7mZ2gBUEt3d6U+?q}>)*`Y34)_ELvup4l#SCPI1J9Sr-+Y*fjZ7Hl6^t_tN
zNnl7&p;i)Yrm~1@m}+Oz-we?}nQ2U?P+k-~>HxmELMxvc3oX+4OYl9YhC-p!`|^(%
zmoa+y^JB)jiaasiir<Bj4?R*;u5Kx1Z$n%vfj6$uM2u%XWPN#PWgRO=vG=9tx=EmJ
zQc%zwuEi>-YV21cG{ur?RyP2O{vE9F53G2k7t%fasmm?VUwo}tA}yr5+~34ni?P#o
z>PL6O=FoMBGhH`ex$e@{D#yy<+E8y`0<XpD)i4$gf!}>qs@w`B9R!!Gf8)rwwihL)
zqIXNVw(qSSry@LAKtErqRrM<E^7jdeYg)h_^#N6a0_|{i-|L|v0+%}eL_2)qx*G(?
zZ^Y*<$XfeipTTh+cUC=UDKTwUT=^}T3!ks3`;r7aeA&qJ1-M?9tJ=zMgSEGm!g{Y|
zO##+hN=K1sJXlPb>TR2c-GA82Tu`)BOXR4RsfpU?OzLSbRx(MRm0wkAcf|A4G@D%1
z2lCQ9$i6FYgOwV3eZ+y{4ruMn0pkEYf7Sh@CeCMw@RViE9WwV~8_X)YLeVm1kRD$L
z86<CntX0*A2E~?rRG80~A}KJT)?=&0z_{6_B=h3Mix#q;1|`F9?EL^+981takmIe(
z2Uv9#u77N${9_aiCF@9iP%&2iC#qLLe_F~P`h5|>m#(qgv(VmhF7ai-IvXQEmls8Y
z*RMJfV4A$m$n+l^IvDKw!u0DP>{;4lUs0>geZt=y4Tk#+_f_<#=A^1GeeF;}xXq)%
zEKm*API$@=JuPIU2gk&fBt2Lgk<&7qEA8Z_{1|WZPt0&0wN97*+9NEYV`7}mJfX0B
zH#*eXlw-#als@CH${x5{_^Wt&cs(srvH(R5W#W>o%zDnratSZzb!<R)o@V+W_eGn&
z3Ex4X^)b_PS-paozS-)(%ZhK4v;MTqL{D5XZd>PQ6Ydy4k$yadKjKFG$3}4MGqMDV
zGPV7&tUZINMb<TP04wIcs{OO(^6zTf4maX|_2h;+pP;DS4!UefJdV%{upr(DT4c67
zIGNQss5vP;>i8SCSZN@#cqL=Xh)2g<MJ9K=d^}uT#}0Su1$g*!O#GolBJw!erqI<j
zdgy7FvWClRzC<(E@%>gg0k1ma^RT{gRH6yUh$*-!y{2({Tn~@vXM?<424h?>Ld*P|
zp0npMQz(gKaB;@xVLoAPFn#QYqJCq;2<j+8D4zYswFZsO4I4hZNi2=3I6ib-_q2h8
zeoHTDTwEZL4JW4%Xbh!rF802}X4SNISp7}>=-Pz>+g>8Z3n=s_f10audo~xGDR!)o
z&9~;J8zZ<aE<=HxMfq2KbdRp2EL9Ytg7iB%RrK@R&vOTdDW)5uU$}Je?Uc7j?M68k
z7%u?|#-CPFphZ_UUD!RWb7jQUL{`GIYU+92%dlZQDQ0l#<6QzLUne~Kyl5&1*Egyx
zctpE>cUj_V%MTO-EsPG@Xuc)s<@^E-alK~9<FpHX1NgENwTTnXbxyD~8_F<Gfi?$b
zffU{{t7BC+uQ^SlniRGN2Y&0n<M%RZmT<1Fs~=uTe>ZpsD-u;;3py4Jm(?!BKaWN>
zgf}@6yM;YepY4znwL4Y%h8<L6Wdj|F+AqQutFf{w4VJPrLPwR<&ADb0Vx6}P3WaSi
zvDtG9h4n6p3hO)im-wiA6I~X+0qr^m*r~(mEe8GwbRT6t*r(H5sGK+;@}-4@)1T5M
zLO!HYdz)BP<2z0UC2fYewJKGwAfXq8m0Ipzya=*~wVZpQEavL_Gc+JI<d2-%oz`-_
zE)ou#xmo|%QQhP)PTDV<=>i}3zizsZKL9gW;=z>=+>t#nB=pfoQuAgwbgH;g`m;=Y
z$#&>Ob6rsX{2NCF^`FX)u*r?3@Fp*QxP~ayb&a4u`19^Ld<-$9(TWUl%HC)6N3K-R
z-ufQ60C-Sn6P(CF`Wp`z@8wa}KGe?Khc4gK-+c{e8u}Zm9#999FoJC9K3C<x#>$_i
zaQ|wtdvh&=-VisqPyo>;+X-(z0L@l=0)TT4AdNO35cFolZ!R0?IV|)~`W&mc;4&db
z_@8uLP@HMZzIm-HAB2rSujlZJKWsvN#Xe3z$A?$dF|sdsYh&d+gc4N%Uls2%;IVS!
zcioMI9=bMu+$9Sgx}aNSZb5UPpVN>!pYrKR(SH!iifY#J+V#_UkjjCd3E`Qz41Wh0
zS<$}J_$RjbO;ztYG_@jVR(3l8&B;45CqTY{=1ojlFliL7x1pQ2L37vJ*q{e6{>sZe
z&$FcX6;J!i^sPpD@vVFcKqLVLk15XJdOdD3-<o?J2reMC(GrBeQVaPJZUZ6q$0DR}
z>c2gbEiN>OFe1R0yYz36j`r-SY!P-3AoZsjF76$`d51A^aL!$f#3{BD>|=)J!au2%
zXjQ;g1uvWaf(tp^yF&?ls_BskS@;m%>H3Ee$c`hNL#VKs>X>D{XOjTyi>Qm6VYzcp
zv$!0a&_0|YLT0$4%eAGs=()~?vuwy3eqTL2BtBi<BJ-LCUNo#OypY;m5-|D>;hTvR
zitAHVHzZZ#zLc^-iq(Sq*EKIsd;pyUF%YYBXQWqI<LzN0%t~4G6DrEYTDkN1mPv^~
zYheTFi!{sbG#jL@f$;TxSsqXGo;{g=9$f31VdXVY$RDN}>sly__bES`I5aUV4FuLc
zs_u(2O*d3|q`Uk2BWi>lzDX2bzW90rL*~s$U5h1WBpw#bmh!K{OQM7v(m5U&78u%9
z(O|EfEM(j+W`^b|l41*KRx4qD4>a=mjU0I2JH8a^EAQS4$mo9JfD|0-%!mWMOls;@
zvtM7Dft;jB)49#QLd=20QgWxQge8;5&q(P8twQ*+_<*zUFG|L)nTV^o-|_vPYwni$
zV6K)=Y?qcVippwk2FOf^GGs164^SWDJ{6crl_XJ&J)tnkXfl=RmzkEKcz1pB0<=MF
z`FDMNShJ<yvHCJ|54O##xI$*la7?(zdsczQsZ@biPS``|kb6FkNS6_pko`bLRMHa_
zV*XDu)MOGoI_ci_g3fB@F^!~Nfr5hoT4?~vBES^48?9+8OMznwcv<$5>GBJ<X=;dv
zZy+-<jv7+CCnMmJ9g*(zelh9mV#yL0zR7PGmKaI-J3M&1lHQ4&Ww;en-l<2iTkg{y
zNd)6!z1J}tsKaf^Y10sKo@wFRrr`ng&x~SU#R$6}Wz0t1bKO*8e{^c+yFqtPA9Fi}
z=QA@rIF=x^23noIqPSjxF-=V!!y2Q81TlQ0_zqGw`;s&2x{&Ha#7whD^#1t-)(~kG
z6yf|~&%Bi)C(J}5X9;Dh6<?w>$3EdW>rX$*Kyvj&RDUl_R=!9iUwAKc>P{pl1&-O1
zM`rDj!-eKqzs7N{>VUsW_?K_%PPJnEjLkdaOm}uMhUQGq{IMXse>YVghV*fS)LN~4
zvX8_~U<RFN@MF1Tb&8Rla3Me@7GmU;N*j?@JAWmGu2-*I7lD2RBijjPR6qzbyXao(
zu1}}-aWogB_0#S+aZT4V(9*odl$1Hv84GR2nsI+5GO0{xFv->L_lhV6g<@a?g>G*-
z2P%9zlo<UkyhO=<=F&OMg}|JIKHt21OK+tW(<?!&V8Jw?{n(lPmBH6I9x%g6YKh@M
z?7C_AQ@c2_ICecnBVZku2-eJxRHl7~Rj}3R!*z@aBsC0X#_XS=^Ibg}_)z@ia>;RM
zZHPlm$5sj~d1v5o56CFD10M{ldHzEL(6~63k}m!MV4U;N2F%9d!VvBU@otcvIw~~~
zdnF`ZIm8<hu%E`fFHFvge-CWD;=ITC=`6{vLI6aOpJMch|4j(|8&$3i)!iu6p=MFM
z^M?6sr-qPkN`~&xj0HXEhfh|il3~z<4Lu!K0l6VjD`tYedi+`+zSNI*zTz60$Ys$D
zrYi|lwdq3d4W(*Xtl9uD^4H&2!X(fER=g2;2H~<I*S3-)io*!@ASXi#<-LI^+<g7{
zh4SO(Dh68$Vk!cuEXp{&OFxB83=zRce`;~!24BX3GwT8VA@^Eq-A76MNY<WqKJq{~
zHN7YQ$@M&=r-=~8o&}<mdm@?*rGUGlT=>VDT|0-nqYR7A+Q0+tuKz$oscrKjtBFlT
zUa}Bx<G*40%f&M)bBzEH<JsT6pjG+&6@OtTGH1ngESO;3`W-&8&IJ}Hr~=uDZW~UY
zHv}$7w((|;#7At#)-`jf&<1&+ak}wLO#5h%I%V=yJ{~L~H(V{EcyZhwf*RTIeUC3D
zy11F>$MeOFHtWH}F;dS*v%u~$j^8ngz&=c3lhSu<f+68K*%UNX>5{+a!u)`Vb*gS)
z?oyokIrOf|M&1+gQgUsLLAcC70+Bkx!U~Ku3zrv06<9+2BFo4a;4=cteW9>bd8&Xm
zPjZ+>q7A5UXu|=pnU&hBa+y+xRw5wIt=6SeoAAC&q3l!K^Hdx<rWO_Va{-$UsqDe_
zYXUPbXMNXY#`-}DNi`TaXDge7%9uVT5p5%t94Zy5XpCRltC6SFX*_b&fKWQ7%)KB5
zE-Q5cNB(|Xo(P$iFn5E@txP7&grzBBEP4y5+vK>3kK0ww$NGuOgV)7nc4R!jj0irP
zi5f`=(j2L%ZMC`TjDn{TCBFaN?Ks+bsGwa`!LlmB{}6#PK9S)PL|810#+045>B^&L
zkjboD#ibT6mYwR1lSU0opT(6%lZey63`=iVt=Y~Kr!5&w&ocowN_bfoB*(>0!7^Pe
zTKdd&L3_}t#>e5)OwLVZdus@3Z_*RW5G>;T4q(qJ8Nh2KmDC2a#FY$R+F6?>lWTK{
zYUOk9ZP%cmc+`eV@K!HVzn#Y-#;Gn*C+t1<|2y^j?+=orL_M+uUKNI1Q5|ZOKL`CR
z_&-%zFZ(u8@Z<g-oh{^Gp1fpFo%u2;$@a|fyy-_@t{vz2UQrT)qgVSea-C6tH6JEx
z)BXoiOJ81_H44&d;L6!2$0ysn9bl{~NcDRlIDZ}ZgIyr++%WAud?&U91OpNLMn{Gm
zdm4279sUc%1s$Z`Rgy|AKR^fh`84N6x!?;3sZwQO!*g?LZJhfA1F$v3>ra15kv7Q@
zPBhAt-{Ayrlu@n~U~7F>k^$NT?}C5{?&p&RMm>N&;X69us9hEHoc7dW)6JNrPk|F3
ztH1LRgRPHIkP~fv&h7^b#yNa{r#Y!=&%gDx8zMo!GlB@8{<6GhzkdjV5040fytu7|
zgtRC6x;y_WJ69JYPFx)W&0mwKOV#HY7_a3F40)Et*w~j#kO*U~@DN{R%zpz(T1phK
zp7p`zDvWjDyWInHDp{Y2uiZw~{0gX1hvdZS={MVnsL{ochLwE8s5@d=;WUC-*x!Zz
zl?7y6nr7caZCFIc5IwPfTd(6*r<6YmvehK8E~N>dbdxx+8`E~@`xq9Lcu8B3Jlw-w
zAt?1gps+rf`n#h(Y1GiK!vAeyE6owEq8(X(k9Q#No;2#>?|3k1r2c;j$YkJ}Kx+Bd
zdLtmZ@)5X&y*3v%-(#kf*CV#P{!+2I(e2)Xba1&Hz^b;ANqG}6A@0ie&t<(W62#<5
zl8~)Cv~tFJ5bi#*s;XRVWJz=)uRDZf+Z-*qNS0FtDcjk}BS@y=<gzTViF1*wn3S6f
zxx;=*7A8ozz=#T9@lMQ1GMe(d+<!y*=vTJ6D9TI;^Gl(G&38UL!E=XD%3>Dq-R@x(
zCGV;w%x~*;w|}1a>C=6^E0Vg8Pf8<;X>A=Xu0^fvVo}`OJXEB+f<rr@pHYDj?PO$d
z?0WpmP_mSfVFfJTu+Qy0QNkw~N@v%a55X<2mg(Q2$Z8?w@Z<^^hdO0}fh8W7#%{GS
zijeR0fj`XqOLtFIm;~NJlY)<k{Qt1^m0@i*(YCld1lLmBi@SSqcXxMp0!0hO-HQ{v
zxJ#kM-QC?CZu*`3oL}eHyGGyHd6JpT%-(BNihqiG49}bgpL_NefJ5rELXU*N8_)>}
zn>2-uNn{SX3|-<z!DPi(Rl2;#CxDH3ze3g-IN*lZx}{Z?{<d49hm*(=H92~`t;Vok
zgobu*=~?{=^(fHnhhm^Av?NQ=;|Nib`$@J(!T9lg99ewZm$zcYb~D092(GM!$z)M_
zLb5MxnJ4sN>bI7^&DWw?z14l_`ik-QsbTV`-KrIXovZDM>^va-%Tmbh$K}64-(E6m
z>wUpbljBC4>~G9>t3gSQ_M2g4!WgwnroUWg_g>hu3baAL{k2M$^OOVO63BJk4zYgC
zeq}d3yG&cj!Ci&N^1)6j!#7%iOwKE!teL^;g>&J7O)a+rnG7+@bs3h!1Zy3;E+nUe
zi*yR5IxlgpPFq`)90#aqDNlX~r1^R$OJDuR<Pv(264F?arIz8cEZW0xJ!EDz+i+8J
zQw>cR?6Vam`k&9%r(Ljw!Cd+Ep|zehI(d>LDq_~DY1%?_tyX>XRZ&C?X7zL+gykwN
zw5~E9xqRGk`V_1iWc|*QSq`RVhalE6-d~z7qr92`m2H_SZU25DgO|`J^C1?rJQdEl
z5q6OVhy#a9iJ!Nb<zA1f8OKJK<!%B5{yPy$Cy(eGyYW!rWT>LOgbvoG>cmj_6tvn!
zs2+VRxr0VkQfxIUG_Tq@3y*oC7HOe|zXJPds1yOKWu>E6h=lSP>P=@6N|V}z%n3QY
zR_>S@+LOxwT`c-28Rpw<p_InfvOX%Dl{Iluys00Xvu~K29c;L1;aoM3^bWUVS6AgT
zQbA#$xQs`k1uK8)U=ATODT9;TvF^%!n#S`7nMQq{FCq3_c5A;lw;v9KijavYnS+?M
z>dUYA`qQU`K)Dd^vd1%U)X|iAH?zFB$)ic@*Z-blGhq!3BB2;CAx8Ac&|tAFJ1HH$
zv(V=rH2Kt_Q2zYW4$~lUR8=PNE>pPy^GaelCh<-_in#&b>v(tlt0QG)+lNVvr(j#`
z_8p%Y2H$k@HRQF+BtoYmny{&qJawO*367~Df0Z%dH1pL`NotHObF$~s^xP`+XlZPI
z<DX_tH(tXWkLrRM8;lx(D5UwAQqh(#(vrH^tv`VIzLnwVeHIAIjkm+-#L9&+!aa{+
zhHJhm`worJDAK);u)7ZHQt%K2BECeN1~@<y_qcc-KTe_X*78EUs86dQiE=n;yeiO}
zl7(P0c%nQeTfb1UkB6mW2-&>qW>EkTdk(_;xWPkY3yQ@Z!>ghjMgvRb=m!H$nRS!m
zUIh~jpnCqdMsz-65zLOR-DkYV__Co5cQwhS=ijiDH^<FQOo~b6g`rVC9t*mwB5FKB
zj_LGmswdQ1Mx$WgP4GQ?h*2Q{#xr;g%FJXh%90Tdwhs>;kj*~O#B)sgGcWFXwqJi2
zX3%GG!bp-sdyT-+!hMYyr4Vg|{GAjoo0+mz!n!1*tr$~Z(RDP1dK#f10`4b8h|_j+
zB#!D~LKk=9%<m<^PpGpwzioEyeMFdxm8nTn`^t%nn@8VI#2c*XGQ-6kV`^Jypp=s*
zk?3g{-x-|&TU5$TPQJwQmaO}~@AkB9)BJU5UEp4u<%O8$a!*z94-IDp0+k{qcYSUL
z@&HyUoI;ur*qTVE*m*RZQU4(Q>D=SuL%tYfj%ZwpAzCuu$MEO{^6a}SAt)uUb2ctY
zEN>g{ZBoU4#^>NLt)9KNW{__;BrzNDj_C>~{Q1aTo*=R7D5nAD^9MYlT>^1o9eE%A
zE?qv)CJ)bI`7B4#i+`Ru@=`-3e&PCC!P#o}R#|Qe-zvA&LZ~<eN?*<A(?4%4_g`~y
zcCsrCgB#7+h-SH<3ONTb1{79@f~`^6B=&;vH{?s?Up>yADc*fql0k88G2K52HAuHX
zMJhP$$G8ON?omtPo*+Rs)4nsJiPUZUM+p2nmCSEb&|J9$KRqocUw3)n29_F;+h_NX
z`9%w@(|Gyo_COWXS$~(_kZVr|9&$$X3`1m5Pv=SSHas;&RH6A%f>J_ozAM!BUus=(
zmm;cE{1vqrm{ZO_hM=dc*{7mCY|_{9#ZhK)UQEYUxY!x<@+M>DHd^XSvGb<LcIt8n
z81EPV^+}-0q-4Rc17jd9uXB$k@I)u%o6r@qG;)Ly;giS9&;<9(IpmU3udcH9=R%B{
zodRG;4>VeW1?8gT<0lwW=U_$}roYeZKx-9v3zGm?PaJ9(_mLj7gvPG|KLf#(FW@6)
z1W8bFArp8x(wo2jeN1?SrrgJkoBTbGMV_mGNdHob)`)6S)PH*2#LaN>Zmxsxteoor
zw&a#WuCIh^?;jXV>Ie?5;kTgIa_7y<zEy86L{3}QCL6I!$o+jFMft`W5Q_E%fvE<|
zMY2F1>vD3N9#ada4Th<vZGEpG_XI|Nr}MYTW-LP#lSK{ZzByhTlxpFO83|X;^=qB-
z@WT-hX|zG2DDtgIS<%Ols8d=Q5k=j}4=P7#YA?#$D%W?1Loiiopt>+?B`264m4n-P
zei>Vl;+x~cp*bC@C1B_Vo=+4Y40Oz!M67s3pUTP7e;qHo+EKx6xJ#)+s*rf~QXjOZ
z@uF^4iv^U>Tk?-2ebiL{(U~Jq0$)DFcW>S)*Wo`r?#@WGexZ7JM1%J6XA{HgR79J_
z)cK+V8ZH}jKw?U~=WxkCU%}D+bY>Hv;^{a7=wn4$Q~gT*{mrS0tW#(dHRls91h!9b
z{_oW7!BWZ8)~aJ=yl@D<N-=m<qHu`mB%a(Aa;OnENc>pTa@0PE^dD9VgKotP+LyEg
z{<s1=+Y7{gPV2i-ZYNKS?crjQJ}ETg)iiDLZj*DUBqocLOuYim2SZO9RJA(U!gGom
zh}M6iA~Z^fJ;og%pT7`IC)Y6)Pb2!6_&s&5IzYwQ*{}RLcm|Ow+xf|6s7-#U6eXSr
zNhPGoKrr=2ZnRycZ6>UqJkI)L^4)JVBU)+`xyG9KZSc$M$db_z?EELIii7w01VP7%
zk*C5_^SfV)(Bye8dmO(9Vgv>ZQG?G68Llz-m!LJPpV2Pe!m2gVdg?wP@di0M3XxEP
za0fYFMFE*A6^8ExND6GIa2g`lvlXVK+`;n|=F_gL5cL&i$p<uz3q(Cqqi2(sKcFwc
zTm*IC2;-1Lx!xe~R!BvURD&4sMI>QD&c3gg<UG2VF*oVS*+)TQ+u$MlZ{!~vQ{AX+
z6reu0=m`fKlWYAV%oz$NxBoif1IorS%GLShV1ze4?e6+k);eKYkJawMwv*CYKN|3O
zpul*xv_fx@LRq2MW#9;M)@pdA9TQ1*7TdsouF6-GhR0P9IGo;aEBwfzq98%?fR;DE
zgV^PQ`DD%2IX&{zEb2S^cq5PJuO#`RNZojeAK)DZO^VdU&duwAqtfRrsUWC0Di1d(
zIZ^iOBmkTB3p7&$`HoOV!&?Y7{@|cnGrd$mMcU`YRJ-Fmxlcd1Df+U?g6P-7@jsN=
zE|zNHi5z8P8nb0yvB;zKs@jg4z)_Hy!Q9PpP-`zwuTo>E29;(jV7K0J7mlyM)E2Qj
z&mo*{)^obs0l?@l>|@^{2lzoI3Azo%mXnbhP>a7_?1wp@e6itHPSgtbWK2DSOz6L`
zw&_`2@G5m?B0t?Uo*5X-hJu6*_0Aq1S&DFB*K>z6%GKA7^6EPp>IKX9J5eR#n~aJ&
zaYO-%TLnfh4}y!i9pKaKyE$<<PkjyNofI)KblXb7J+bxe=HQMpzvNAy6-o3R68MRy
zYukZ4M!AwV)##N>kR$1=H$hYo{bd1$$0)6)vuLP5yUyO<pzS_hZe(NrXEWr6Z0IRf
z2jkz7?_-l^c7Z4!A7NnqNS{O1KTw7QsB1C32BmP$*Vu$@cwv85F~)lEl;F}@DR|DU
zSX+L>(OxM$c|jXC3zxp~PZ7NG--aE+tTDWk<Y$(|>E`^1{^LtXI&ojx$OlvjRE4#*
z_UHk&08Ii_;pD2(+A#N*AOP(n6P!iQr_}W?yjRn4YwjKHv4(ARSr;7xKY$=hhiALo
zhOwcBzK{vuC|P0f+=>+jzP{^LPl5pJ>&=z#)=(}E1a3xn5M#Qwwgk8IBt#q0NNlCX
zuUq<S34zr!V#!h*v5mKyFA<b8&~?utJ>>0?fA<+c<U;v~WMSC@l6>(ah-el`RZ;ra
zN?G+kFUozdj;crKKZ^)JPx9SnT@@c)W3)!qzFNxlK7K(L>Yww81}XVR6o*>*6O-^A
z;E;Ap5(_0IEZ6V?#YObVGt?G=CN0}8DJ&04c~F$TWrM0b(bHgk(pU$HzVQhFxq}2j
z&ll*_XEJhr;jQ_eUKs{GJ?!AxrcLAGl<I0{yU%D+#3Z^Z9Rv64K=Gh$Vb~LP^4H+e
zo?94lUE#V43TMc#RY-{~qdo3W^+VWrgRmvacWp%*d0y^Eobrr_zoOSUBbYlatN5sK
z!+#@vsB#wBVXZg*P^QOgJRS;(w4Q_SoAcv%tC;{3%;OP-o8W(|N#=o~d0~-KIq_;#
zUSc%fQw^os81@3bk}e15vWOy!!}_enY3$|1(NlWa5JpUJaW1D5N4v=X*-8vw3B%(-
z(#GM5c;fBK7Z2L9ySxGTPZsnoTuQ!2q3h|xc)Sgz!Fy!XJCD5f{jR^Wes(Fr5qcjS
zwJ0LP&T6@)%N31`H#Un!DevrIo0!-@aX+LH(Km`+mxI`I%w1^bgJgWIn!l@2gcv6C
z0zxNy3KZWMoo2E$ngO@u4!RdPouXgpl2yMTx9_8_0r)<0k@J}jl`j=EXHl!ED|?W8
zc{5JLvqrvVggz~Vq3jigJF+Nump#g(ubT!a8>e%)F84_Qqapi?rltrFP}1oT7Ot$_
z8;4ALT({z%+DL5|)N;2p&^Q5O+eVK(v-cL)R#oKsmx9Vq?e#~<j}j52pvQ7fRZN<V
zwHs+-^+Pqg;!ETf`Gu@s1S$m=P~cPMK^`-Vh~9R0sJ{NF2cs%4h1(}58T3-<9tsl3
z;l691Ul&)kX$kC@N0B(uvL(X#dO<8(p(p5v%S5^N@a_(u=z)qLmlXP=eKq=Z><p|%
z<r_Ne3#rORGeK;$mc%HpBCX{qBlGQ&$k3WNyBMz<yv^bWE}d$4dE=GU`C;$mkY|!*
zUZDvr7oSH84Q6-JjW`(DEdlk`$?^w+tC<!dL;>5~OFrVO8JV=|0pNib18>^JBu$4z
zw5skQyh=#C?*opCP*Ksk;5WH^JDGywASB!gRh9)8pO`O`Vt6h#X>r&VpXZBE$8lL>
z5rc+|Dtfwd5&f*nt<%XN?e!+6KQ<4Db7-tr5!!}6!YBmIFj>_KR~99x!oG68UVmk6
zRxbElqYJfM5QW2!C%0Vz><l!T*u~~}hQ6`>9H!7mBi}Z((OaDsez^o-e-o4T+w}N5
z+x&b7maZXT1GAL5Q}sZef|YTlPYw)c2F9UyW1NE%5`_JNv)oxfnt;}-_|9p9H0#|`
zeQATizr<u|#U%U*6h6b%l%+`fM<M6sQzD)jSQ2C_IccSuCPV2_z$xh8#;PD$heypz
zAr=y-1NWF@zQ;rH<to*7!JeovYNp&V>4x<A;(SjTsc9f3C^&y03QoNt-C8>k4u-p;
zgG|O2340WPIpo4!l#9^=pc!X20Jiq5z%breuCg{~14qUkY7gaSBhrdXWg$@MjLbi&
zaV7F{^+(GKYFiC3%9#7Gtp@&3|Am;;IM7~~-)nLYa({dDpl)i6?+}62sTE*^Ayg9P
zSljQ+$U&E%bW%udgH}=)ucng35g94j%ZUf4h*n9hoYyxLe17!veQ&0Rn(e-|#7O^E
zf1Pn0jMD>#Mi&4J0uESa-<PZ|gKads%+sg_^In*b2A5ht^Zs|6-&;@K_Ay8eXeT4E
z(idyEfz$X!b!!Ldg(`dbRc6V>E<yF8c!#U7qHS1gSoXrcg(S+L&4OyQbw&1Ubwq55
z30Y;|Z1V|0sV-?73Hld%y|ONBvXr-_XJQwX&IVFl3Tla3+T^!qDf7J(yDrXzai2w^
z`>fN69TO820VfI_B8G$^z>lUY78$_{<P4S((|gCw4wh^sg&fmwFg{V)*G}mZdCkqa
zSI(b?8St%yNmEiARoD!Bd5Eqr{oDA-HnDhtHZ;5opLkRLe&Ssq+if1Ez0KZ8;wLOi
zqFlcbtJ$F?g>{@j{#7M;QYWF%n>#S$<IkRzR!E|NbiiFK(ojkMX<6+X)Sx3~g6i_8
zMM0^ddE1-0{ZIopv@EMqo2am*6VO;G7GhSrCQmxa{xAzYqw^0=6VGL*dJy}~#$T+d
zNRUR^AOQU6J&QYxY+&dO!GJL}f`W4g2e*4-7ig%I2j(wjQXPK%PVnQq73waE&(Ww(
zQGY}I?^Gse)=5NeVv^htPB3!u;X%LPidd$;EqO?)hvWcGz24+9jO9q#lb2Z!#G*|k
zZi-S;WBj!Wg^ycg2u&v4SNRzQYXdOMvAHV#ij6!i_r2z_Tdc+5s13Z7C)*6Qo{wn$
zR858t?Lz3T5W;ZZH$#FEM1cuF%tN>zqn3(flTLLk`lW+UVp<n9Vht@rlCMB<P?`bA
z`zD7Pux6Vcr;EdE8kzHyYp5S~nLjGni7Hb1EBlBu82z?owHTf^&yH6OV0mx<Xg&i0
zm0)X<JO9equ!RjN)097#r~rKf@p&gO>3hIuT6dfGf^ETGgS4Mw7&^bSI*V8k`w$L@
zr9Sl{AyMG1|J{6Ch4=)a3UA&2dzgQFc&QZ})Db4)P8HM>51vd@puD2g5T_xduM<j^
z{m;jh?O~sK`bF6`qPI3OAHf?Z&k$$I&YL@JiVo0|4B(0HbDvr{AE`eH*4BbLl~`+i
zs(fFKlrZey*5Mzu+YaNBHW<&UGw6)(EC5fwBY6d3R=Ke7t}*$J1s`QI?E?F<YdFva
znFXYyf9v-?+lJ9`FSuIeDD@>#Ct69=)ZrEZzHO0y=sJO+JrxA~afw3b00MndVBem(
z52L7;z5A_#U(7GhjYcDXf(?#Vgmt0EaR{5P=tRJdS`e86&Tp(RK`4+?5UGNC5iYYR
zXCO(`FF~3L6=bjc=wX%bl`7i~6Ew>Yv){Sx+v=7sK7#u_G0vHU4}GI9m{d*7V+d^0
zza#y{;2<@`<`6=jUxBqmh~8=%@NLh(Ld5n0vrY$J4O*=d<!K3VO%Edr-3tDh6x87E
z!iu!@t8n!96#r26l#)gXV?{A2r;7;xH>d8<=uQ`+V4%4OnKH^Z$J6^v7(lCtbFt52
z&uiq1ToO>^5ga2De$$OB`hhOr>y^~eb}c0oTe8gEH5$B|_1H2-_6GjLRLivM?H7Xn
zhYQ^(Z*6K;vV(JjgsJ#ho#<-b(yQ?f`-^hGkJCJ40XInQrSG4G(b-Z9g!Hac9qo~#
zg=ekh*FOzSBPb{4iGo3W#gymU0mB`-P_Y4S7uSyXvIq8tkZe2iCGT{N4AiY`AhQ$y
z4>}q?KSlojrFeCEGdKQNGbHN1smip1r}uY#8<I@fAhgMGCN{_E(9~5Le$&NWcn&jh
zy0rWwxA2J30>Vg%;36!$)hsh!QxXX0yf{BMMroYf#S=g5=YL37ra!1UGCUW8@wmAI
z{xV&T8xJC9T0!Ci)tPpU2jXN$a*2S77rZdt$`#`~gPm~SWZse^&KEl&!US@L`ciSA
zBPWsTdp43GejtxCO6AiazbZhIAC5_N^*DX$(11WlH41}$*U8u1X-(lN{@Y&gC+M)B
z)Z$rWA+UVrF|@`3NM8`sG~m791uG*mr}tjv#0KL**KKlKed9uxfIck<|FzRYh*>od
zFWvX6SZi|sRCtYRY1Gc7o%nEyq2{Lb&EjNlbq)0BAvN`z33m9@*R(PQFZkwkU@rcc
zdsG|oo4O;1*`YwYgh6~@w86m)GB7&Cnxkf8@=k1n@8IKb_C9&C8Z~D*muw1{?=yJP
ztLlub-;3-O9o|y1iCY$W<D1~bmAPLa!D&_<L~@x5yGQli=P>%*xVpKBfdifmwdAXp
zJAxR!$26<@q4KzL86jWuABtmlm6l-A6WZ(nGF}H9=KKXnr-MSV67znsOIp)2Ui^~1
zh{B)wN{(|`!jS7uci@SDoDC&Z`BLs%-fwU?NCq`?xh&-wEPk%pm(l(`KUy@#X{(Uj
zl;yU;4tp+S0jNU+4BT&czUQm`W?ndJZEm1PhKcZD$ML88lY?g#f8RZuRdW~XhA+{4
z<QP1_1?Q70CHee_l|LTk#N9p>TX3lr<InLBdGdg1?n_-Xh+Sn(X-*y;WX3il;VUG_
zHvD25#O%>k6xc)4gj|V^Jo7iB9uy6}TqhV?BQF8Gzmr5Ee!;aO+~Nd{%e_T!)EMmQ
z<dT0N>`Mmh<`tj{^40O(Jq#Nhw|iplLXg-wIJFJH@M_H-GOhRcp-Q!YmnT^xtAP*d
zH4y-#U((2SzU&tqz+Pqap1Kub`7M;QLHy_l8}U?`41XA{r2M<i!jmA{9<Mr}bOhBD
zai-=0Vwgp0p`fhb;g-C%dc;rTR@B%m)mp~53jyZ(rn1L1!@C;LUZ(B;$vp+n>L3(+
zKMKCmXEOhM`;NEL$T>0BhS-KozKSl#%7u_k(uFW(amg)Rv*D@ld{M?6*3Ap&uR>Mn
z1LZx;fAvY^tSxQ>B2VW|VD_G9lV5~j^OGdMT2t05alwmgS1%qFANLZk*h5CF6f)fr
z3iO)Q7s3*U)bCc$g_7-uII{q}t(-Z4(WS;LfSG8O9eg9lCp7AtW``KlWsN-kntb-S
z$%XW_l!?cnh6-54Q#*s3&Afp1ll`VSUpy{wq{8EKQc6`ZqQmkQ>-(r&=46C)8#}x0
z@|N;%IaA(r<ax*KU#UTPG595l<!DOPyi7PSyZOmm<(#F2YqZHG)>Hjx3pq|Aclx1R
zLSK;7C#0=`;hKJ!b2pfTFE%$^RV-5Oti;wFG$`GIl^sEfNA5I?${Ccy-#hrXFbbQ0
zc0E8eL!Fx0CPvzlJ;G_}W&J|FT!b7QONI9kdAJ@8aQ1ZIMd)Wem6P9S$3K9dT8dC%
zA_#gd{vp1g9%tsqu;*4NG+B~;{uxP+*j*^a9lB@@%DyYwvW%V&e$W2!ov`fCKEjoG
zEaDubz!eix@{E{6P%`DzxAR+)8Sk+TbfHQY+}^j~@f~T?OdN;md#bJ_4mw##bY$RR
zEcX!2fKsUHl^5@vQ{47e80-X6<m&6YucT7)q3Sy}$?!AF<PrjoqE7I8VHWbh)D~@|
zi5bmPzkBjaL>%C4lDUbCWRJuCFK+^kY-U4m*Ug}=tpig6txV%4K|lzz!#jiTpu{26
zS}b}|rKeOHEs`&`0hQL(<0+DUGEyYV8#^#(5(=B@$1z*}{qx?%XD%^r*W;t^Rq~UB
zb*bxhxlOts7v7s#RXxJ<^CKC(SEsiZr^H)9#qcZ)<lRXxb23wl0mpuO__T!9Z3w55
zXj$)ZP-994Fo)7#cF2@Q#}6a^aSbp~4e)q_FHKdh6y>JH;K~MM%kAARYy2=}Zm?}A
z-7q#}<qzD<k+zE(`Cz7Ip8S(j3BC#1aEzuT_uCEQh2?vw#*4Rj81i@JXO8AtcX<9x
z_{Q(&r)#HHCHuyWxix>_6f!RZxF+a^B`g;c3^}2nlmYnCVSKRbO;gfHK_r~1a2E@X
zO(afIOm&5N-Zpb1)iazSQ=dIN7%Zom1^(nnDW=RXanP5arXY8z{_*&m7q(atqJEq%
zVZOB2n1|TYiFIy2uFyHmIFYnhn+Th-GI!sTHxHs9EHTkz`k*poGXCaCeJ<E=ww%6M
zPlK_myNbS%HMt+-#Jt_RpVy8!C*+S36e+U!Pkyyd^8@=3!vA2|fnLxth53^?v6!F{
zoRi(o-<hZE;d|-4IqN_x)LYp+$OES%ey3*?z7P2TFfHC-1eoEbkRdUc#r$KCzG;_$
z6M+b>XS*u8rS-ckDPb=oeqng+*cagm%)g-&a)-<MVor56WBG!ESgL804Gmt^b;rYS
zXRVYHgkWmStv0G5TCPAvgJ;3q^J!y&qv@;H7-k1<MV*bDT#O05Un6uU?K5P&7S(pk
zIe~l03RSqj)|my6Ga*wYK=(0*OF%1%sY)Se0UumB(tKk9S!3qknbECS!a|9#JF*Bj
zD*5qH(sVKMyr=`Fu-XEq=?iV2<*M05n!F$|X)4wrV*yFJr)Zmoc@V@?uW=6Ot{yyi
z%>i)?SCVO!{jGIp`V!3p@@HlLV3|~AWj}VwGnr6<bEPlT_e(t(M~>t0nxSVF%s_dt
zAP#-j_Ln%<zNAaL@vgX~8wR6TdbT#_M~AOIaak|nMB0NNF<jdxvWQ;X&H{TQh)P+8
zqdJRV5+--BFHiqu3L(nR({63y9;MD=CPlnS3V5tg^Th3gG*MX~(8y8wt+21p3CdhU
zTl%7kr<xvezEN(uAFBb$VneyANW&G1(QWL0Vq%J4k1-Qg8Ok_-{Jv7EGhe9+dDmHU
zhDr#r?7CAEo7{lmi*xxL)MJt6m3#%Y@6Ma7ri3gb(Oqc0l2`qw=+v>mymRwSK2$yI
ze3+ihf+&?c?Ct`54YUxoThp`}9F23z5CfZxQtojeRy$$>bFxb_?Fk}<S>){ETmCFU
zwAvhcd0l<(sgcIdGTidIy4UFJ3csSFtemG-#j%U4%CF_mNgIpeO?j_FB!Pj5YG(yZ
z+CuVk;!jmuc6R757$t2VT;T0I>p?e7`Hx%w&t-8=ymcP8M6+VI1ELC1=OqKa-*RUU
z)nx1|WGH;OnkGO9u{9jy0l=2?8_A`nHIaYJt`!in?H{HOE(0~eNDV!7QhYKy(z?ZC
zVJ6v&JosXQobV!lw+BW=GXuge3O);96F@UeBs}43^HQooF_4%a#GaC9my@>(3v$8{
zwQQDOJ;&w}ia!n}mJTHb+97mnd)uC_PjGbfvdyym+T<cET&V;Il#l;IVcMd+rJ9!R
z7~WU;pWQuFy|*X}fHjxbp9QMfbm?%BKmpv7_<uv6IQo4s$^sBS*3E^C`1Eiz`V}|V
z)Koa_2TB2w?Fn&@@4}M{To>P?Uk|+T^u2e&H9o~t<+UI)3%HWfctNK5Z>QY!q!Wo_
z;u-RO$$#sUxba6|mJPTaXK<F2M|gIFMeA&UV_q8r=<?L0hE<rc<X?UkUK#>a@Zm?X
zG`c7v3#*g-9bn0>N0bzV=KI=!Hbr$4Win5=_P}}qj*X}KC;NLVM|tkv@iB5u(UB|X
zz+{P@z|6`MjoO$vWVCMZfVU2Ki8_7GC-PWj<%O?534P1P`M%D|yKwz2F>uER?OY7U
zHgU(u94=rbCK}?64v`t=IP&{=W!k3dR9-jZ?EBl3Sf>ykJ>+|xa-fJimy{q1Xpap&
zU!Yt}M1z^+>mx6%4d9mMjua6CHbMFA3F?gw>`CdOvRLtsuCK@~i`B2m*1WrU0`*ZY
zQtSAoc|g`wxK-gYPYlrzw;Ne+E)Uf`aP-*Aq!LCw2v<BfT69)j$1ynkxQGNw9c2P1
zIul86&WO+E?LQ<bw)QYL;^ti0$O%~pfmQL{(=Gq1uL2m>42HVG+&vKFNaO|2)(^z1
z^icA_wEz0anODL-QMwb=o0I1MTISuc2B89h_#d`?KML30_@Bh#jHsi=`Zx_5)>)EX
z%7#BF+C33GwR%cbColiPN<;`g9B9^0<@`P7PI{b7Z2@A9QREWp*gOmA?j#sqxz*WO
zZ15x#KQr|YZ+8tqu`E4vK3@SNc=Be}eJk8{k{TDU{=*^z?>j*8@CA~<lVmsuji;uH
ztLH8lU0dgDcnp#*n^;!ENRxl;&ynU#_uOCQvb7^kE5a#cWASPf;PS+79_pl0Flq@H
zkGx~n`D9vZ5Fj;SXO-G$YWh|6e!|d7BGlJx_qfX`SVm=d&cCRnsZ!>zMCZ6m(=ZHB
zUM$GG?FBCD1Wev!Nti@Nw;*`_;j-kHo^Zhgl8kyT4bkp_-?Z0fqsbqT(1LLPCmy~b
z8AwJ?&E0qy#(W^qs`6N%d)sTFiKCcX$?~c^|Jxxr5X!zxpXafFyDF3T^dT4!NDDRy
zzDoIJTSvVtN6A_+$cg!Nl1Njb>p8bJQ%jR*6I!z@z-8o{ycF{RcyT(576o&*GBi=t
z^?^Uu(t`^0FhpeMLT%dKR0XCl%-;efCLy%E=aM1*dV4_TFA4oXfU0fgF3UL67yca@
zQ37fnwqswJVvr}hf7G-RZOS+!zFpiQ(wWpesNE~1ogwI#D!Ht%?JOkYuvbR{AvG_&
z6SdM465ocNana8ad~K!Y)2|dYXZ(%#TSUH00TJ^XieVbEh94UlH&kNpiK&`c<#4E7
zmMjb}bs<Q?`D5+=0XmRU+sQBTY$^%inr~spVL(ZYa>xaHe*U=ippc0JACoM#OBUv&
z_2Af&-v~Pi;mfD@zI>^>KqTiH2x7z@A9S!4N|5uPW<D0*VV#YP`Ns<KAX+PIY9KgP
zzz=GO6Fe({_>?VV<7$+hjMKS5c>*bU2>PW;=wO!7aoQ2EKUsm6Z8luu3s}y<g>-#Z
zj|$J2mD0r0e2Z=NxiSW=dP3aYFKEHmIzXw7mdH&UWMnWKv%YNF*V_>|>k|`}RWneY
z$M@kpi4DKU(fF0;_ud}K-{t#{KV1W??2q-sC%X5fn?6fRSwyxQ7#2ZRe~5HKJX3mp
z7gc2vbeI-GoZSiI{|ru*Bo6X1AxHfR$y7NqNzfrsMcX*@Jiw^ye($#q47o+9#mLWr
z^rih*X^+YqeR3Q^Fj?9UXF0<h>zk(dy;CnRgahlFrN!Xq9XuigXq(T(s~P5=&U;!z
zvVV4iV{P|XT3kegaHuLtH+_4+L%6q3g8owR^!8ay2DOV<5T|q}Sc73gG`l$Dh7Swv
z9OyYAntCYJ*V{Q6=<0k2RW_+QT$OIFs#FhkR&^OW`<X%MU|Kav2S@mE6lr2kxKGQb
zJcF!noOUqeA8Bx=ORBZ&M~nx>{Y)wIrLw3ava7i|X7D)Ls4)Hah6eS~&kt2!^hJv5
zS8__mnZ==PA>u}NP8n0g^ItBN_O&%giLJ^b^JdL7h}8eVo78ql&S0s%UYArk>7)DW
zySfT{6{~W?E+I{z<V|X2cFFioJlre<VanP$V@lkT0^;=j=5Cx0uY3uNjh{1*W2-CT
zkL;4^8~=aZSo}&ViFWi;u<5NFuBcxbQRQrcMJ<Empl{D%)VO&p_}@APtaZYm|EV(g
z-a%UVEb_0Z?f4h&d^l&7C&q@~s!q=y8dt|Bq8k5o>bB8{XCzWoxFTGyuHfMJ&n#Vn
zyHHma!Mg~M#+wC>W9jgW);u1!kLLQw$8S~M`T1Z%ks?p2t@~ffO^?BvC9!>H9N$iw
z=(|>K+GD>nYUmSn{i~rUwdJYVIzYcLmJ4>GP>CL3MG>FCsSNY~NOB-ZFBOaAYY2Lx
zhgy+~G0c1@vP`ZVQAHiKP-YIa@u-=9rEMcgme1FR+MAAb<<zMVZABT~i>_z|TaF3_
z^c?|Gt(lB-|0-aeMuHos<<jF@EtYNaodaUoU)4qH)farLHU+}W%i&nv*uq>Q2w3gv
z)$!Qzt(4mWa>2!T>}Br!>^#txIgEG6ibt<r-bJA!sw@EiH+Zn>qWZ!KWa(^O0sR`O
z#%b79rI|Qj4efs4luV!y%mf2&{X#Ag-LuYN=9I(8Nv)P18@MUiK7E!Rd){$4ba$wb
zYP;s6a^4}J)i9D!LKr$u7V7v^XiI8UukIGs!cyTKl8x9#E#LI0A1Z^%{mpI&ECrsz
zF2@j=Tve7ioWaOh3I^M-u0Q+0MsB+yegdk=9oUi**Q-OP>k#*=sjtBu{EO82#~!ws
zRpY7s02U)EFK9>+(XAn?MR7Ili_Ny9z4ts9Q0Ha9RmA-ZKJwUZ2~SjQAxnX62q~!$
zB+uIUk>>WVfd0IF=lz0Y6D6gRBy|*a(<&IW0by09e^#qr;2JejXKVGZfS!7|A_qX^
z`d?T3E#VWF*v65gnu|TEg98g=C=bv-G@ARsomH`N>TI#A|HBnO6*k#%G_@@l?Ek8Q
zsGq><-m*fL<&NcVEJ^;$bB<P7@jI!R22Dp7cABJKPQUI&HEY#<*57>B%u~|X88u>z
z9vpA2ol@?KLrRcR<kJ<!_A07eQ5iM<A$tFaQ82f&DsXfVzvSQG(;9Rth~5g(Yj#@c
zg=^IzW18Y)=#2<)(HS+6jb`IWwe@|KwcO0s8e(*30xng|Q;(hC?An5=US5~cwb~u4
z{5+@Zfn!^?rTlIdAhhnv4kL%u=lxSOw|`pn5JpEHM=@*vD6zQs39CX3AOM)(5`<My
zovnk1{el;i-$wEo0p-Xb(qxp3!b1)GloBxkL@@-JAPu9!QPlzt;v<l2)cuN%4!uMx
z6tjxM0jd3@&T$4dhF{HzHJ?1w?X2Ogc4?`5s&2<2TR~|+6TduD_K$ufW@kB5)&vV!
zhSJkY108y#A$I-PIKaT)kun9G*afnHaaGt5W!Ci#KA2BnD%AmSwy_E94gX9vw!XFD
zxau0UKrhKpd5dxjuozs40^`@qHkAij^)6u$&$A~EeRn}oIV0dHsOY@tKz4VhSz%Wy
z%lPZE#QQAuVT0hsvc$#nA*07C54@}RWa5*K76|g5JHB3hF(!I7Ja8Jn6OYQ^Oz630
zYpip#59v5HbK!D-J?USNJq7~!Yspx?`u<_&P?*u_{nJ=jgr_&I4H_<3XZG7>kGuu+
zSYj{1D4@!T*g+V*MUW@IbM`2BB?!KFCFJTHU3+6ZS3YN-dYwUWNf~bK@@(F7LV-hl
z)~$SqPLO-6iVyJjE_gEHN#<D~4ap(h3tBp-%Dt%YMU03`T^-y~mjeVAvPmdCEjeF5
zdD11Hi1_l`u)<}uT=L0WWhc2l4M{O$Gr4N*IfBrGwvi<JhXucMFnjW`vcO2N8XON*
z)@D(igY>=X%!!nNXnlo?+>*S4Rzg(|op>Bl;n`*~q$0s)a)Ff5)Y-e20FMQlm4;m2
zX-TNszO$x`QJmVSAw7?U2oW5Q#q4I`Y00%&6S083UV@!7SiS`k&y9z{aNG7DhTkwB
z;3jAV9XtL?<I_m6QaRBm4Sl(*&x5Q1WHY~jwS|7iff*n+)9Py=V!*Lt=yj2h^{{K`
z7|kWl=-DanKMGfR>GA-p5&8tB$scLQi9;LA>AjMPC4rs!1?6GL@h1VI;%Xml`3>si
z6GvAQ+C~<?)y7rHoSGDV1`C{QR%e%-AN2~`54OUls&f%om5byi`DmyKX*jCX&yMs|
z(B)Mmj8g9~rohS$4qZaAR-WV&?8k8Vt4~I}@_OF~YANqX5|L^oI4*ckMNA-Bp16T0
z0HxQ-KTavt6FT&VN2`ZNOtr=Jcf9gzheufWdYh@EhvnHNzBMiSqKYX~YP|9u>>@w#
z7WGIt!Wz`CP(wRYvM7p5T~p~n$)+U5Ibi%r-eGd4nLW5uLrO_9bs2Aid{HkXSM$Hb
z>5KIcM)Utsi%8G_$_yF&1w1n^@0^-ZGP0k5`KXD_jb>~TReIT0H+BNQ{7u!<a|9C{
z^&pf)&<=R$Uc8478a3x1^jV>ai-g^l!0IWnl~+P0=MoXUTME1?8Csir{2P#pXJq?+
zB6QNQrhlAw-r#dCB=1&!L9cnC%&$_n|F=DQj(;|{T-%LzrTTGCb%3>Ti6L;NYgVb0
zmgrJI@NIL<j(6oqD@+OZ2<PlWv_&0NNT*mWdE6PpvqhcvG>onZ;qgFr5l{KHl8N*k
zmbOd?w5i%O*bj?Al%M|`Xu%A)i`TxR^@E%j{W7_t^ADw(&HWMrcl1Ywn1S@R6Yk5F
zDiBW99wUXw6%_KdMZHc;-5YWdbahwh6yRJ=C~&ys$4Owt?H6U7DIf3vg<?RA1Yerz
z#UcVJa1XT`*+4?4<y>u1yn8w~g_u^c`Hbm4<y`gb8X*q|V;(FIgg~lbv1(CwAaR8p
zfTJzz$_Bp<O-B?pLTN6IUB3d~z5KE~`z!#puLNoEg1aXMOmgXhj{p|sC9E0(J5at%
z?Y7!#nk*xe<FK((3TLz9SUC?R5i-pMi$pwf4uC8%%BECNuk5}VK|<M32NE&OVRS>m
zV13KC-2PQmvj0(y(TzqgEUwmBx{L@=CuP#mMUZR~f5p|UNLIe-T?(-4);Y=kDlH$-
zuu)}n%FVA!KXCDJpLNqaVt71<bGx+&3o>sC$P6Wg?BarTXjEU=5#w_pAJZL)whj6d
zeV|%`k6T~(Ylr1n&VZ^CIHB0I!$N<>s>0X53d*)UV2<uCTiTyQ(dE{yxWeOHA%<$4
z|NjXv-(G0Q?0*S24Tj9vA9JgqN!7Td(v+(7adzu9>vAE{6UrWNq>b2E4uvi~ze~iD
zXZjh?j!Cz|q?yE$AKS{Z8EmdeGrNm1IVbzd+C;l3=-G7gA&}&@A`ebbw?e}!>|OH5
zhl(d$GipC8#%c++#QmS=HyU{$^+S!F#3>ZIs`m_sccHNSmM2w(VkmE=hWgo+ak?#T
zZ00hJvMZCybvbZjiM4`z{krIK+7`ANKNl?=P^7uNjHEm3<r%9R6@zOoo1|2&{l4ZB
zLsbM-G*b_sq3cb$K60se9#x6g$SSB7^e`al)t>#V#H2rwtHO4VXBNZ+IaI!Pk~3hr
z=>WgJ&fv1;2f-7$K0e%o75p-9T6Mg+qK}USlO5m3?%r1Pe1LQSB1Y~KHc)lo=57AS
z#!H%Wi$B}%py%E8)5h~!e<5Eb1oBO7`x(Bnu0nZEm1S%BPh^q7NngtS%O6sR_ZM*y
zFHJ21xpd;x@M>;HUj!skdYIxIFW_#>B-OglN{?46cc<58Ru@Gm;%??k6$G-Ga@t7`
zPRsRnSmXG2pDiej?^6nQF8|5PRzuz(dpZG-h-5~olmWl$pq^H_V^dBfbm#sjp2dpb
zXX7v}@)2ZT(YVBsKkq{xjcLf&v;W4pD>y_Mut^l$Jw@$I6rdRinP<jTX(m+Pp73DZ
z$QL2ozEur`Hu4HtIc$`QrF2kFVlAAD_Ip!IXG40h{p-iT8Y<50++MOrlGXn@X=Ahm
zD^$309Ok1GK=^nlw$8mT2y44ZNxjp?@W2;cKa@Mmc3}~BQkD3AuSSY}LI_1xZU_{j
z#^w4tKdf)HH;w8p`v-qQCtcmteso0?(k`TK>nwqF8kNV|TnNa})kCoi8L9Kpi7`U^
zU<+h<*F<?i<`os+tZj#6b~B;*b{RJ^ZWq7c;1h-gVjDhb?lfUCyl)JqG*;i<<28gV
zVj4VQWW{CR!HMm~eM~?5*-!jZ(_zz#w>VAi=bi$1lwq^8VR$*11pBVng7@<wn_m&a
z&ff6EMW>81ajy(|qSeg0o?>3|%*pC<yRS~A*Mf(ns}`S53AUK?1WjcRAR79inF)Jz
z(%cn~1HPfBQ-6q$2g)8?!m1g#KS`z6#kLJcDA=_Au$<-?r7b$YGD#!8i;s=>bRGBx
z;5R%xq>?r>;He|P<2?>2LwN%Nkoyy+U9C5`j^z#Q5y@EUC?N+XrHoPt^yrx22O%Vu
zhMcnKdjGgftmUXEydD6gs~&`AFz&BdNv9@_E>^dO`~3%Mw}vq*71dA~O0-(#@0@K@
z+R_ZigyJ}3xo+uG?Y}^)HdQPYP7MWajUctM6ik(nk~rM5eATI&DlzGW++G3~jN0lt
z_jp4||C;KqwMZkL)0%qFj0Xi6u=nK_H89`3_!{oY<gq^Eji0*C_qxUMTaoCzJPpLw
z=6Uc;sCa<vkWO@l7eml#tc;;4z#-!)SfV|r-HVmJCU}QoPq2kQ<FF3r-uJC<H3mp-
z4^{&s-kCHF%Y_f_iH<i+%g;~XUbOJv47+-Bgom!-IUVcv8!87eh?K_H%%rW|HWL!L
zxE<@%AN29u<2M6&PfXXu4_ZDLaLB0AW-efD%C%^_<Z32)2?ceNoBt#>gdu%lkT%hE
z_B^#*iX@Knh?+SUix!W^HX{fyZ5NW)=Fb9py9raMt~@agYzFp?xR9<wS3!5SOkE7x
z4${&Jgmh&POHpXc?;#coP!yFp&kwex-G+ZHr4=l9o(DG23W<VTe^;)yvfzM9ba>4*
z(dLfb6pFp8S4RtU4G55>s$S11CJ(It4ky1ht$>2Q!su2VWl|oPbsH(hzm69$!!?=@
z|9oDK)vogMtv6E(s0*^d2U~~ihxVcsNXwr_3<uuj8%DwCZ-Gxuh@M09ktbjai$~Mr
zUo+x#M=m)1(ASej1AU*5^KreE7+;Q#kUKzvW#H@@*9(k#M_8})P!Q)iKK9@9C$yAM
zUCHXg`CC{;nE$e;PQ~Jx&RHuq?fVx9!(vA)A2zjM{m_l<`j$Esj9&A~j4!tA6!_Ye
z&5_R<_!j*hb$1fku1<%l3efIJyXLLy<MhPS&1ZYp!OhzvzM0@&TY1zzTsA!rC|TZ)
z#&!z6w9yM#p*$Zi`F&(0-YoX|WS8o;GWb&mcwN_rwu_DFRbzMahv-PNI2+GhXm<%c
z4~CqD>=#6U0!|`Eo0twGY#((S{|tFI{3N0Wzr2GtB1x*F3au8SYhK$a_HHO_io}@0
zzxrw&|03>ky$qT$9K^X#WYUGXPvj8{{5KFUO94&Ga8L=Tvd?X(nB_8;1~!mAke9!R
z7#v_0k&7sHxC_2remfK@3L$9q3n{AzC8<qX#XQ%Rs<Cyb<j4{D8X$YHaqx4D$;_zu
z2%qn(T3FS7m&{Ctk~<K0!AjAt>9YBz+wdaWQ~D9U6nJg;N*nt#6`68gdA*;6Lp8;F
z<?=^UK}RIn;7Ui9IX=E%^1~(N1+^@LMnniu+y@=^o%2^SRw*z9c-SPlq8c^Bx@v{r
z8f~a|sw6}FAiJST_^=#dsK=;Gi%YA%;6-qN+1bp>p|#)@0yHs3^L3~bqhMRJqV0}l
z=Rot`;Qc;vN!r<rKci36K{iAn2C5!ki`HO@0t&}*Pf>R^qcvq`isbm|4jKNrvm-Jw
zo^vhl=x!!}lV>`ZHJY|VH$3?f7sOY$ugRX`|N6aSo+;%4#A0|ttjOq(WIV3V3ZIt}
z#+xbHVT>lkz*@?m&Ytq{SQSY53Xa32Me7$q@lU#{@Ou6jmfPa{QjD`FWIW%i@=1O<
z00g_w@zHhIG!$mOZH6YLq=x4`k<-pi?4zpn&+v6;a{-y{af88}Lpg8U?=^_pyyE^y
z-_ONBoQMoJr!!l+YMb=F)lu3Guh^eVOX!>do%8&D{<YGz%44Lxeqx$v>pOReNUz}f
zbPQW}m~;%~JyDI6a5SV_n*4@&+iQx#+s>6FPB?WV5qfXCtL$propJruv$IXzw+@%*
z@EG0mnesbu>>oRdI}r=Iybtfwt)jN`Z4$_7@cM!r{oAWW3z;^bggC_CM>IC^e5>J^
zg8zQUr}+eU1RA~+)a+SjC>R_z&EEa$6FvqHB7>LhK*D@~)){QFbj{5u|IglRN+rKN
z606#V9>m+_%Xs!BpBS(F1wv3E!Tz@Y3=(Kt40N}<daxAsAPML6w!hl_w3F1pQ2Q?g
zmxT$1{rba9@7HJzQsq~&TJmV}-gwBSoJ|zcOzfAys}P&Crk^*8%#qtFCk?k@NAU9g
z)qgo@jMDjZ^DvC~k0U;v5Nh(CM0kdKtSKje6vl*qy0Z#sp>{f1H+t%8760t6_SovE
zA=w&lOMaOCQ-@cAMxY2v81=hHs(@6_;^7oI?y%}m&nnY$wuQKEk|p_~4K2bMeD$t@
zW;r+;{7Z<hkf_7jXCP>2hb+{_zr!SD3cGU{^<W3}gtw)O`}#LS%>|Jr$u?(0z{55W
zdBbb)&kE&D?oHFkhbY!4$kLeY;z?9S>}k+%C0&bl*ACmC=HL_;-;aalo_C4Tk6|`N
zFdDR1<yfeAZ(Swt&%~RvL+Z0Yn5`HknuaU;@}NFuemEWdsC!qKKpK3o@Tb=_=SI?7
z&C^mA?BsybiN(WHeICRXxH-bUC9Y3CL)E0lG@k@GZtt_IHr`k<;%}VK-g_pi_E<9d
z<L_|CQtfexngKd9(zP3R)vBKl2oFWfNs)pv{Ff_fMYWI11E_+|(Z~QfkklE+jaNV`
zC}e;JjTmk#mjew&$wEPZXN`~&&i7@s+e%oY%CR7L@jaq9Tlm~Xa8alD=LqYUwopDu
zBd}24au@Tl#3mloqi(MrXJ^q=t5=U+%9E~d=H;i6JBA~heY>kqQ7t*mT=f4icXoV}
z`Qa)*uTs@;;*g#H9pR&G{rpXj7AOQ%BYZh`&AJl;3Oxu0)j$|kC!**{8&+Q)*FX$c
zVWP@k^i=Yjx`%z7>8?M_65H_y#CIk6t<q4-`F@+^ph>p|TaZWX?*@(Cne_0xYnXe1
z<-!j<v_$#|j?|09hHN|cd=|!=ChyVk(yD4JBmoPHu6tiM@UI>PiVed*sSbQU^r21n
zyJ}9g`7QXfD_&An|MZ`yAnL~gPFej8Z-xvl8Q<XHoL@hDfO+1P^@esoPobTfpng_W
zE&M1_<h|}HB<6i6C4O>D+KG0(ZM9NTjQ_(+Etqtt>q&B5V@9l{tW~|>Tgn<A<3@Ih
zGwOTBO4)Fty-o-7s;mR*9BvxfXr!%a8}bm?%4<1vyOh^i_vqoQ4ql@_X<}9FW0l-#
z3FQkhWFS`Ki2rjSREB-n6e_8E-C7z5%c!aYy0hn8l|I&@X#n_E8%x4`EdJFbsr>{r
zWOy95Y_`=-MDtERZjYm0Ps_42B^q03Xs&$Py9)Or8xuSVs9xwhT9k1seK-q_q&sQC
zk3r}XzkWeFr}VAf<cHaqdW3iH@k+kaeT*Lx$$t`VgYGK&yP)bu_^$G|FlCn5Z}{2K
zj9GOyTkib6U_pqtJ(Lpc^w6xTtcrKmt^EQ~PBoS@4eQ=RU`B~ZErtz6-Is0_I@lCx
zQ*1id%6eonurSS;<Yw{^h+?YY&s3g0(@92BDLT$(bi!}`#BUuW?Hq}6)l|Gtsp$24
z?#G?$>cSCPYcWZU2sg}4)3ulKJKE@mN=P^Kww){pkCPdJL5F3}?}=aTJ>J$3WQ_hq
zv}Dwo!V#k4MAda)^y>%prKOWamu6;9UZ+MrqJ;2=%;1sA@K5$LneoPW4H`a-uI^$v
z_ri4lGm*#lq*1;pBp&faqnBO+RX2O?e~{npRz#b(pS+9Oh#zDA0n!~!a>v(jVR!LV
zQqJ~zePP*){8c4MsmqgGe{L7xooL*3|GG}u?9hFM`|0n35OL*;(S@MtbrbZ~apy3S
zfNFjKP5Y3Cb^P?-3&i;X7m~gomWIARks6P@^Mt?}3uoWJGw9hgV(srKunWnv3P$-_
zB>3aRrA8C|O~*L?*DaThCyP|sbb>F^aIK7Y7cX9H{UOgn>B=_Vh0gHBVGrM~<8ypv
zcj_ClfYXr1Ta%-_FbyVk&{>T!s;j-iLD#LD*ky>%Mr4QYH@9j&>5tWqwnGZfm3{9V
zUc=)cpQEPQ>zm$+57>rrKLqW7^@{=19C2YIgob%TUx!a9pYk!V?67NjBK<E3=*jS7
z**BR7a}NTZdaxjY2`A5Q>-W=k*d`d@gf@k7UC@SyyG=yx%$g*%vB^9NHYAYTE<#BA
zAoktO%&sa2TdXGjtby5gyX>%V{e7967<5!9WV+Qt@|d&}us&>v7kk&){Qae)M#6hd
z+QA^_q3hHve?nu6pwMuol~DS17&GVL3Rr}^;g3FAvk4}4jHs5_!7~0BJa;ipYi@JH
z`?gz#gce02@!EqhkBANq#%LXB@WUhWaVO*xhw)LI%97d7<s?+>(!R(eg`33)qFk-Z
z_O}pb=$`6g<7;poU>ngwYj9;TItW&2xaKlKlQN)D&ru%Rax5)4fL6Z%#I)zkMi&EO
z1S0v{@-;taX%GF<ywUYJ;>Q0D%MxI1$iIKGS8`!o70_j9_-yyIOw$SQL3`?)(Suy_
z>)*h9ULPIlTz}&{s{ZYU5{Kgsc6?I!uJB7ajs(-%Fl+ZKUqst(R{W?J+3Nzuh0Gfb
zw<mHwLu1@T2Wu*9o{zQRiZLU0o)0|bNkDQGIFnFcG17XE#p}8|`@9xkS8g_7wR46f
zRTtOu|FQJlaY=XY`<0qGsm!gYkEKtUD>cPgS=v&wp4@>WCppQ13Z`b}*33~kGBYy=
zn&L!ouN1c^?ui?mfH;2i`TqX9c*E=P=FNGXbME`T?&~6dg%@v@4&B(C5@uk322*c)
zd;@+8OjoU_{aHj^O)3~Ra;w@lNjRKcxA|)YE);mh<y;XnPp4Y^`|8V-a<01;{{^qo
zwu&QQyuWM3$BOY<zY~Ym6hjTx6SSx0MCwcCYp)fFq<GI}gi`^|aibCu6Q~-t>xlhi
z+(oeqJ8>bs$4#P-AO(xiklDDr>5E4ZXK|^B1lzpFA}LtI`NE2+n{n$w|5;o$zzK+q
zQC*hf22`_faHTQ$TZpJ@_m*ueooEY87U|TF&$7-G3T)E73*2s*FATv{9WWU?@3Ppn
zb@Ni$Yd{kco$Oxs93bT$<`HV@vcc5MH3Yy1W`X;t!-JGZybQn@Hoo|8D=7}S@gUA&
zCyAd-I7?uZ(L3s&<a&X{>pa;6d<Uv-(9pJ~k=T@`Z<SjM)@Yy0!E)h{81G?bG@yEI
z{?6vx9SzqOTuvlB80Kft$rG-0zW(CvXeBDnLi5?qNUN*!pk9b8M)FqC_j{GAJO<TL
zJ-HD{N65;|>}4ZOKu?+P`eBP}jv|+?p7JG9-~8BXLm9mHoXa-a_VB<;o1RYRFj$1n
zcCth73k}Y?0ao5G@HpIztM}%;3K{PdJ}dTn8;z$2c%gWL!-Cwsb<H&A*|NidKHj<l
zM`%YEgSXr0MiI_nwOvS?h~_An1;TTbwtvSNxE1so7#;ZLA^n$10xTr!_%4IbK@-#Y
z%Cn6NlIJuff}&U3J$73{%{$tD$N7B)C_TmgItXeP2sZ9AUy)i;5HZ%y3Eud10VKcc
zI4hcKDt&R609I<-$rgg5UeMWccOdg7u^ZB{+d<VEl4tu~4E0@z>O@Mkoa*w-m45n8
z_ts7Nk*3ya=W&GYE#W|MI2^bC<HgXItY!IjvuSjUF;|vfe+*N_CF%S-yX6!Y@85IB
zf?p(-YM$*k+eo@Sv2RG7oVJ=dg6nJpxjcS`V|c}hHAHxT#H{Vb60;F#eS((~wgelF
zVD4Spn!yl+B4hNn{A)Rlg`1J<+Wl|zQ}?W39eBRINfzfDh21)E@j-t;x<2o*-OGA2
z%phy_yuW**W6tR*F5SrMF$&~;{-Lm5sXyQT)bV8Vy|nD05`Zx3D!v&6kcNYa^|k&H
z^y2eDzG~Xk1?^Z|q<K}iHX8^~bF{8g=&2neGE=WzXwqxXKF0kUEQbl5=ot(!(Q3T2
zhMo&TH;Bz68iw6&P}!D*$em8hl3#8o*C;CG(-m5Rh@sOjMxbdxb{)LAP8OqPlQSrx
zv!)?v)4(R^E`x`5#}Xy4l;0rc@Ooy2z)Fs(i41quE)%Et{03Xw@@9>`OIv$cRZLLO
z2?GtI0x|orN&ZUU35cn34SQh!zbAX+wlR?zn!k9`dERzmv)2AYsHOz{!JqQ)gaHZ3
z9#ggU<(#{7&|$ux!3$=~9Cy1=8zk)&eUq<Sh`d9hUq7D)7knU5;&<Dg!vO&Hx{aUu
zX)MxP_{4n$?Ha#>>VEYKU<3D5=CT1*M#xQPKOuFMt<+@$Z0Je{pS~UvQ<Cw{a`W6Q
zTj=@vtm20ms(pm=l*4yFSGb`z<KN1_bV-niTnhnAle`i)Y#GTsF0fy9ExICc*>-}Y
zwxOHm0p?Tcg&Q&WR^dkHA%CbsMu#^!!CxdHUtXu<8Dg8c;^Jp>m_mmnF9~_^v&Kgs
zz>g*$*4$47Lzm4YAzDbxGF6bVcqc2htyaE%zf~(DG5-o#ll#T#97MdfJe(laHdxSq
zfh*>t8!v%3@?IFtYFMm9+&&4fMrs}to>V&DEcrUm%+I@=se&7Hw`--vH}qH1#n_%u
zR0vm={zj>wYjehTzpn(|PrZZPnjPMS-_38KGM#=j9B+Ix|M}hgytZL*<YQx_v2ekK
zp$aNN!R>QELRKRywniX8aVpnYX}^bUS_M5rWs=iAw2_r((((G(f!Dit$u0<EBg3P#
zAA@1jg=E#t@2FuL7frHWZ$~|Z{6%G7t_HHU6dOmrteJa+<`Ia-I{bOWRqE9c)bIZa
z?rLi{!`RrWuS!Tkj$^0aIv9)Fcw|7`6P%wyiwT+pBG5$R8REl<?<PViO^#$G>nj?v
zkr=Lu|KxA<XsK`nnyEtm+!l-u^Sn!hcLeyx(A^qw7f~Ks0Qh*TlT9Xj-6-*xnC9)P
z;8(_0eXv)b9rNPVjN3r71^^x#QIfFM2;8d#%Msdr*G&nj<$Jm7HVJ=s8qCEO0CU4W
zkWHyhd|LJf<*zX$xx3;o-wm?W0i|Ey@NmAib2lMVki(xdTClT#Fc9;$s@WNQIUhXU
zg^w9Zv09LVm>BOo?-)%yfNFz!{3F(^Z!f88?GX+1ZXD>=pg4ngkI;N|T4}!jjZPW^
zZ}{qBPiK!#HeoeiS+;+gd|@(@L`QcVtnsUWf{kPXSTgBoCOk|y>-m+7Jc0O1o()lD
zUL{{*J;_aYUUh~v`(M>R0Qhd4N1hijc>Q%@)Q;q`nQ1_F_;t@Zum<4j(62R+`<(Vd
zBS>DRJ~boKrq}hyp+ZpS@FF(wL!qc+r#n_o+s8LT1@Z*tu2@sMtHyESdK&0sJbk|6
zjQ~4b^LB`PxImwM=iq}-4na05RX$Za^KM%J=i};s7v9^Zs!U12z(*%M_Z+8pct7o2
z3!EFFF#Ef?c$pnY`Y2Uhk8)=5{INaqvE+hJ=+FO>9%Qs(6C5%5hLy<Oe>4^(&HMFr
z8PTu&N6!Y|dkfsYV_ac~{pYg{>2<HgmiCT%<*fvhDO8>eZlL#pn~#zI0cdD}qr`1h
zU5%cOjOPvPXk%<zp27ljKxtdpFY1ldP@PiSD$8!@7D5TBM!s2fOYWYEFR#V2jeNlN
zDXve1Z*@;83vEp^la=WN0qvR^-YIunGEA7<GcD+;)nDY<S@Rl;3QMz&-2CHf-1w(h
zkjih1x5JHyJ+2A)9{DNRqK)BmVu4pA3su|-GU|qg)J6xrr3>06@E=NSp>&`q_btN;
z!rKsegq6-9cyJDbvfe<y!KIPV0RdzF&=}NdfFc|Woi5gCVlL8ib$PA6#w!c6S5BY|
zxtgHusiX6CfX&GurQGuj^tx`fKRL@ZSZf&INc!B&q#n<xxVN7F+m2+hhPwC|rg%Q(
z+N@nW{={P82#pHF_o_Du%h4gQ`NooAS*3>DVL$k^8DRf1dAv>bJYe5?ioM1S;a(MD
zoDcN0Ff27mN7c{Ds24eCHy8~O&#no{d0fOKMPNt3LuxZ;y7kO{w;hX~92mUcQp`c2
zdxOi<)>IB3EkU_LWV~uVCyZ#A+mtN*Zd<PFBaGOLoKsLgV{CQDe5zYow7khvtB>$-
znLEyMw#vu^_7#;9-1`Yj>Kk0Isg<6wV})=5!l&G}aba3-Fw?nJzsZwI0F@8KR4Sve
zviBTWj`=$}f_Bka;p!zjThF^qxDF=RAZt}F%6dIV5&hQxEgLVtfGc|T3j|dE9L)C$
z@GGT??V5#7y`Z3XRdcH}({HD@Z0oSs4>xk(!Ebzhr&;T>W476Q)yev@+K@Um$jQ3;
z9n+5H_6O!uWyM`8YrD@hsi=MWt(~8wR9BVp<I=~DfLn1X(=eQ$TV?Ck!G~!rt2x#I
zg0~iIfuynZt2e+s!X-kFDe2+d*$Zzge3u)M-OQb#xdn{GsLprifUPM;BZ+D6s4lxK
z-vc`I%fq*TYV8d(JXfgDR$0B)E8&srl+I^6(7))qE?fu^Y^h1^WzW{8kf9oD-#l7%
z2L^*zpi>#;35T1*Avje}<1HV1ldST;z$(~K7Mwxd^}~<vT+nmY+zO;9SKX-y>xu7v
zkX25B4UHF&a_2)_ksC1HDP*=kX(lhAV|6@h3k3=&2;6w<TJX8zpi<oA_8xJcX21J_
zvc^Xaj&E;2BKG@Ii_aIAqGJzZ0+|81O$Owi$J4U_Q2xQC85Y&5nE_dK<pc9)d&DJy
zSIh@c?06VCBLxWP(2HEv*M!9)E&)J4_0HCa>3Bqzm+Zxf-s_>%mq76Nf7$K+a_#=H
z7WJp%gcxr~IlLczLLa`1Ef|HD_~h0eS=EkOjeAs^^2cdq6Y$Q{G@uS&g!B6&;+sgZ
zm$|Hk#%w?zJ#A{H<zfh5fa|r=FoyEp&Fp*`5p>`9#26}0eVXdq<m_3_89a?gx@&io
zBu4OKe^zz{H})z&nhpl}{}c%BuYd$?@pt$3hoKUer2ZU=P0~11$}1ntkItLKZOSD`
zh*&o!8<PoBF0bU%RPj1lyB?Xa8v>e`fg|+xL_$Gx;Xqvqp!X<U6LUbBFjtKyb2Ft&
z9Hi7g3Ict;ZqZ`wGS&%g5%dXJ$Za-=>KKYg^_|)WakG2U476R`%g6|W6xHn@fSiTP
z&^?D)VSAj}dL27xfin4vV*F?y8ZPET^JvvFiV*W@(&wEnwv~z&`_1WJ*n+yE5|Tyi
zPv`nXe~G&}vwSvoOedQ;c`q_$bXcZe){X9-NQCP<vt3oXR+V+bw9V*}wb^?PY4*V(
zC`*E+>k_-fr1EQhqx#hJ0A%ChYY#2ur0AexLDJ1B3x{32|Fz8m|Cu<oyuBN9a(iG9
z9CV;{MmNdd89YF0Aa6m8HkBNgm9_Y(3$W_uOKQzmor{j+l@0v;x#o+65-uD!p2HbZ
zX&es1we5IBkIpqnx>SOtG<9?pH3^bfRJJzXj);@+>2Rq0k2D{w`g&Ym@8vdV4kT5d
zk<`1Qxs#Cy_L$@BZ3KY6r+v}b%3uyZ9&Nf4h+Mo9TaRB8nibDgR}3&-;+X%aBobuz
zAX`OGEwt^#f?;B03+`jBJWPbBhSJkyN(%^;fn6ViSRFJ;^Qmir^|p`qK7!V+=)F|>
z5!kgW6Bc2r`7(eP+!)$cEVfx!HeDXln&Tbh<!4aCtf_O?KQehT&ap9dVlUUX-ft8Z
zIt9V9awLk~`PkCjlmv-_;Dfx3*+{e_&I2mZW4HLMPGPO$vUMi|&9ctbma$j-!G?|G
zB^NMKb%t>k6E=!U>60TPVatrO6Q~*J@X=BqHG)yxsTUX25i$Nf1^y!;dQ7%$M*b~I
zelyRz_g91U-dE?mNpk&8*74gQR}SoSCKacVKUlunMm_C$WgqJ4M2EWeMpz=@xYV(*
zfvl6yiv(V*XWOYP{j-d-<^G>(M8X(~YHk^obYyj?c|EvYh<?S(ST0S7u@uO?J#~Oi
zKC8Mnx*Eot^}63(_j-ofS3X<^!^~6l>x+cj#tj7HjM=Zi`d$K`wdUFpPyh>RzDqWr
z&{yaYYOwlK(mtcNaAakV88pP(2Os4mtPAlWUczyHv5#V*2OZlw3v-{?NxzhDG1bf%
zJvFsDe@kx@%wDed;DVy-PpNvAXIhYo%Wkzh(QmjP9&$U=7Ea-{S+UVTA9>g*XW;Iz
zB)iZaIZE8cD)oTx!I1`r`ad+3z(*Mr(OIyfocSrijwG@kRsfHtR01WU60|_M<a%ln
zty;%n4zd7R*1_+`PPD%<?B9ms0y}nL>Di+X0G1d5@GWJ}-y2fwm^Zo$paj1K_gQM0
zSGMwdeRgb0t=vq<6{qx};B}PFU-WaDUBf4a@XfVmH^^(@0W+nTJwMTxTep2|zm&t5
z{Y0-lQ=wb?=NezPs(Qc%s9U>%YjjiU_(5<Ob?Pt%arz#(`okd?()|VTAKlL(8!ZBG
z{Jr3Xke(5<8NNC6?&*o6|2Fv_tXl0RPX0wXB}RUF=zxt@j2PmSzn;;Xn92Zo?UmXF
zi^f5jnFs2J#5;ny4TER1c3EqM<iU(xSpl8&gotsoZF284of$dQx33*K=+;g`xNcIv
zt;c>4V+z3p=GF4NXU^lJ(M;;-??F?=#Ky~&{4b*{+Z}ZS`6p~VvKaGofYOB}P9p=4
zlUcEyEjk-M>I9{;C|z5_hksBepb;6Om+2i(g7QO)AH{Yz28-uvHt$KbwbzfeAL+*e
z$eYh&;q41k{F}Mv4?p{dV5a$z=Cqj3FLifjpzI+aWq3!<rDLDlkV4PK8Jy+}s;x?L
z8%;y;(jHBRT{<pILbZnY&YFt`Bc66wvmxAhSAS_3PI~4*IS+^zNUshgEzM&PA5oLL
zw||$^CbZV1p(bOKrtCcOqmlv@QE&1c`wlPne43e<cNJFE+jhNr;I{zX7#BUv)hS*c
zPeM)7ZoV`r_Y?%PFuw?*5DWu=S*`{|bPzTd&QC$h88-KLb5P=IgiTnIzR^(=08RmO
zsnnJs`KK@a1NpN~nHf`C@>A9l+ePciVKlVD|4!p`$bx8occ$)>+O6?V4ZP9MJ#{Z!
zlH{9tS}u0C`pAG5|J(}}iV_d-V<T@i^yCF-iP4BTyr(?XQsMkmAl9$JI?fTi8yv9&
zTtc%*eE-SPVa>0yQjHrCM)sMj+|*7v1JMe@iX08lA~~}Z*{NBU^e_fbuzPgPoe4<L
z<S->RWPEh^Jl#r7E-<401&=p4CImmgZqxH?nf?zXsArAt`)YAdgS5vts|WWcf6`M3
zZg5bv+T~0_MMwen#qrP>q*ijE=k%<HoABHZa{5$|_Nd;WL;+s}{u144N*lAhFlJ}*
zP2#sEyoCEvE~5?ZUc&t+#`t(_0gZS5SUjfdfPd99u5$C0(b9Z^%DeiVNnv<oEMUND
z<T)twTM4!sT3qO(nQU?Is5Xea_*$myXJJIVFr63<q}!UW>>3$uc}^p;nXO+nSCpA`
zCCX#CR5dfw>i?S8=l78-K$6ASz7yJeZ6m-f*pPRXD&p1f>GX!yZ!%iCGlG)n2#M_O
zwUY^|053Vr$=k}*tzqRU0v$(ac9k&zLz5y<u~0KJUGAR<OW*ihBuLN7fTf4d)Jww+
zcZtsgGcT+P+qH2X=fnjX*F%k%^y|?xp7|3HXtAroPv^H5&=2sA*29c<Rm`48){~n@
z=+*;i-G!K&X_)zH!aLmxQ1Q^a%8i(t`G)TQS}SUV?w8nDyvIk#)3N*0VpaZc)8}OZ
zI!JJP0}E1h6dk<~ba*OF_+q2F9nhx{P})2$GtGWd$^44?&@a7@n*ir`&pxCKbV=Y3
zmpfs5dKq*(J*TEmX?s>0JI&Wy)bN;PRGxZY{mwF4jiSN<^l?_GCYA2;-%MRb`EHc$
z%Ze6WK^x9Kvklp;cQCBt+|MZ>U^TRIMI)JKtjz(AjF#w+Ox*{Bjl^Wzzsm~e|9dxR
zAw%E&5t{P45OJI3&j2>f13j&#6z-hTMVLZQ<49Dt4fQqJ5b`9uwB$&JPBhXkd}LKK
z<vy>M-*Q^e<fAA1k)IfzINzI8#h3M5Y%WR@+Kb@TF0^%eGP7}=G-V#>uH>&<VV>uy
z1x@haCl(G=*{x{#j}Jh(AnhEFvJd@)Kfk^Pk^4bA9-nBy%)DQpUOJogj-=YEpViHy
z&FGqFcpF(X_Wqt()olNs+hynbW@&pOZtDhS>aF^1xrHKHV<MjQ8q-x9$trrgW_B-!
zo@p<HvhY^DSvRv-^PLPVl&rgg#|&COhgKbXo8=Db2?TBw8SEt($6Wz#e-E)KHqB^A
zV_*3wVM{4doww}vP5z6#vXrKB!Xhy|Q~Y>7+Uc(9M{-+<b=7i+r@1?I+gsn)V||zz
zDrWk5plp`8ph~(U6yzk9&Rn=4^`G~)_L5Am1jwh3f7$gnSZlFkLtuw-y&Z|m%(gga
z&AQ{Gg$lfW{m9;=v1*6o5o829wz0c`u{_{(3T7tYD&F9=^6O->ZeO1Q1?&t_ib2vg
zW&4r><c!8g<I7a%w{m8bptq61vHo^Ba>4KbHXU~04Wumu2tH^AJl;oTYGW#Bp;v(5
z&jB4ub$%EpZT5gGd&6m>m`%`|v82W#v$$HSSi|~#Cv=b!dm_A}coXQIt?3#<>*>^f
z2_2}HN5Y~EGl~fNm9!r5WhKr4{W+{zrtayga?BqI3hrgSfQK_Y4L2bhR$B#z-dv#=
z|GmQx<Rt3RN9mIUO3|go`?xBBQ@s!IWgn~@<2jh%g8Z%1y$>mg2|b8m^ut~bzt4*d
z;-*y|sgynU&Fw49O5&(!kWyG<$wOU&UvC*Nv}iNpcDyIE=exu1{Mm2v9CqFhPvZXS
zcs8nc)}D@wxGjl-k8h(=QVXo^$FF4IoHpitJC*xy)NfhUDF(=B7k=!W^I;aNb!ROd
zJN{TZc&;ZbqlLG(voMDH?X$6jOg@?>TpR!jm9O`URm^C3C_AEVY`YlP!0~Dl#h=Vt
zFWtI+BmFX>`^!|4y<gM=`(<$+0H}5SV)8;B$ZlPH8QqAB4xPF%$Iz_jr$SlkrCX?Z
zRaST`VnSmk`yAY$6f`3b+)fk}MZ${On*$S0=(YWNt5c|Qpxpk{5uY8^S7qsF5xFq|
z!_a#2wodNm5<bkgdMXSzTY&Iirfq&j3hy;|mOR=6qrH9upOZ65*GBp-r>@q!<*0yT
zEL=1Xvj-`*MB2@vyg-OH;U7ah=xlrOqdnw>7#Qz*!p%`=9QaEqL1f>sdDJDmeuR>E
zQcVV)4&vEwKg@B&g0xsBqM6FN-~!)=`ihl1o&zJK`zM9l(`?^9oRKP1#z7k&=|gSx
zd);hC$~m`x?Ire?i=^!pX~U#{8X4~-MztRWH?yBR<ihN4cb7*1ZfTz--s1t+ZJ&PM
zUKY~8?s5Qiw$$(4I+vywFz(Tdl5dx`L2eT?l8=5*54Jx%7V#?9+UDr3VzMST%N-P~
zzTAFg4WQc^kiVg$re*1Wj?kN5U=sH%)pazqCLmnL?>$JpK&um7iXz48wbqGQUwxDL
zuko=#U*4TFsa0018JB_1^`im9`zE4|#cn~RW%va>Ji91Y@W18#WUBh{zfLL9buL#x
zpO39f8E&MyKGD_hPImy7S{A1Q_2tKfXx9RYXGrHZqpSU2H@t8?fU^1Do6xe-g@$La
zfaNyD<+IUv(Cw_{`OqCnLWJRO$X*jXk#vM?fxGM`wmyFApApHsOZ$9GEIg7ZfW>BN
zd);L|<8U$Nx_cJc`6GOk$=s=pY%RS%_-3<MR{uJyrD;o4@3$%c1F;a<k@B1cqzyhu
zs630uTd!mRS+t+iUpMkaWCN8M*q6R;g&GJqAX_<$9A!%E7j@M<1SEDF1wevQVJW~j
zpuzh~k7-agF7MZVcWq=1E;6M-N^lS~KLOLW7t*BY4I;0Yzrc+?vX+i2EXlG6x^WrJ
zWAbVY!nO9`H^Kc?zzt5|?-^EO#^=#ii_@~DpMlzrH}nE!MA{?sAA6mlYCEz4EWOT<
zwH=|CPXu?wOu6p$Y^gl%BV9VSiu%l=xS?&s<?JN@S3DHo1wpHqie`#@7kQ`M9#=O<
z;P#E@hsts<0Dr3)i{o6^j}D5yp0ze`T4qX9v@(eQgZ1zvD=z^=yl|i=__7n{X?;}f
z&XjjQOZCaYZ}y$Jb?(0ltt9PAtw%W1g`j`%`Xvtc8t-5C7c`C9vVwJEf=>jfMdL#}
zz89%q=CjIq#S}KG0U2Hn;5v|*rPi`3<aRvp0J>PukE~%sZP<FMeVGUPt79tbt2hsR
z9KehXBRxoj*3_<dh&&1O>jbmHf?|F&7Xf+GE`-tFmzobRbDnZ2`pQ%%LuV-_l&yzH
zEv?Z+9K3-W^sct*619Kkco{os9z*ZBF=hd;BOoObSqxjFZ~`aJMsLP!-A<G8CytDI
zaSU0Pco8DuRhWY_D^0En8p=L~+{Q){qCZEnRk@8mU?)9(79X_jmSkSfdxf5LY&9Eu
z-WR<QETJL&?%0YSo<iJh6YdXv^lG&lDVSyAi~poG9YL{5nMYbwfwIqGUOIqd(u%kQ
z-lP?=V0D(zOX8(IvwRy1qHm6^8oMG)DtffScA6R^i!!PGnC2pF%1|r=TI2s{BJL;R
z#FTx986$W|GV|QEPq|KiI1;SGk-(tL?lbrQtN8KY5QA#1krgeASi-&DjH4zY-NW}j
zu4X32rMHPeq9QYf5@$ciZvp>Ua^d(jD_VkH8eA3=Z-UhQ4-E<WVyTowSt8R*sL;!}
z4lMwer5K4=Zi#QCx7k=l;B`P*F6}QB<l}_9zCpf})~V1!hPpA0ZPykFXQ_93y5;2l
zP*#TeYSI+n)Tjn)x^@o>91}k%s`STOu-mL%1bnjbT0DFY-JtP5JR(|%5;Q@Dt~w0*
zzW?Dw?mYQt+3~vRF|TJr&4%f5{GiT=mf#9pHX+&O`v;tv|Mn;>sYnZSL=*^87??NS
z9QrgPC5x^oe8&DYTVT>M1{9$nK4(4pTwVF~IiOGYBY_vbe6Ks;RVk1{V&$&)`$_i<
z#X~dzA!hGCEqibdP{UJJM}8rZ>F*L90wC13d=m7hG2n=QnWV_~x6d;p-bci1%yKod
z2rvEOORS(|%6W%SczJx@QO2P*d=qz0I&}-5gf-KqUXXHP{X)tbAiN83l`^uVC}1+l
z0|-SUOPgA**8f)9CUjc$<3aus7wip$%3?piiR2C!cb^dm*BNi3+O^vH2f9W?Vr)z2
z88e45-%vUfA;GlA)U<i`q+%SYFu*#1-sOyqu4;9{9&Bxn39S!nX2nHeQ$JPgyHT}8
zli|fefpJ+{Dz5rF$=%Sglev1UeMDyP3YJuV&Chh~#Am8-PO5##H1?dbbgYH(CfT3-
zu?bFb`=(R>jFV*7t92#lWL{eplWiNVRnNPNR<Fr7n{5)QNyFY$aN}3FUZd`&RztSy
z{zZ^VweWW`nv<$(!Y;;s*3&$?a|kuT|D-$EO=~)T-&70vjthht%pc!@jOPt+1d{G&
z`=wganUr$PZ|Bd3+CGZD@Zcn_K6nGPs^ZL|9{W!e$NCY$J_Hgx-hKV%X4jYgAc8N1
zi<IMSK2?i#cgU6oZtIlvb$=5y$F=c)wmiH<sP%$~b{>pAhtVQGWk>NA?`@vu8N7iF
zxCJQw;t6X>X5Y<l1y%f{ngIK}D!T^4_}(ize)mbyS;7FETujN&K#f4yv!1K^F-HiW
zcbI~ue`RZPu7E$!*&{Ah!Mx|@aAs;&6UIHEDLa^tR4=U+KKbEgP!;S&I`dzteE+><
zK(=<npyUQb^r}35(N@kJWVH_a00WJ7Js%))%hPom!jlv~SX|u+!sfJsegr4AJapYg
zsky}mbX=K+(+Qip(k?EG*1edes^$*VUNyD58FDnFqF3>edQ|L;&2XMZ744j(70M#*
zM64)@EXS)+ke@qEH>RYi=+hy4Uy=OU>DL@K-V@-3^O~M}^Xr_6LT7J}rd=;*KRj`O
zRVi#0?bz!ja>?K0yf|W!43`U0^&BouB+-1PuCYSUu!^ns+d~EmAV)_BwN?YjsD*oP
z8%@u8kODctJ#X&vu3Wk^npF(qWT5-fH;#+F5)|*uv?4b$(@dey<{hOKb4QjG6c<2!
zY5It{7%#i4%&O=6!uaa0jH?mVUC3hTk~?2ipXkS5n!CmvL5622G5mn<Y6e<yw^;1+
z<;l%_J|Z`#;xen>0YtV!`0Imzwz|Cax+84$Sbg=nO_d;8v%^_->lAxj<$&y*l;VMo
zQ%S)i1EY&q4D<mt)1W`;$$>9Q?1rt2o3&-NoFhDc4v=BLVFJ^BoTQsn!Zz>*)T|o;
zVEaQ>lN*r@0F0$j-v<EP2WE6$jubuB82lMI;VSvHJvxXpn{(z%xymhjA=c2Dw2vZT
zOwt}SxklwjrL$gxM(j7A(!&aLUJXuxo3#;Q4LtI-le|uk(SBK)b*4y`YvJ@qmAk+j
z7A686EJ~hpcMikA&`|ADJ2EeIp3lm&1AQdSLCt^6=C18p<;%q3f+Wl%%8lv;&~gYH
z#Ij1S&)lJvn`WpDJ4vp3P7wne1+e_M;ym+qTY@=`t<~nx>rue72r4TB+8CjuiQ+~)
zBils&mYrCtw~k~(`xo*ANCZ_GbN#8ec6Zs&9OoEGF80zImz+yN!>xp>GoM#${Ujjg
z{LH4rql*!E%nG!)+zY5<uw(>*);D1~JJ;$*L=f-TT^|>rJ(_<T$V=+~u^Bu=JoV4$
zwxZQ7)9uHZ;2^>o&bj)pY!$bKcYN#jJ1Z+nZj`K5P<m@A_|qZi86f8&-R)^GIrpqn
z+kx0_zRp!G7EvZ$?_9}C$vDb!Oy2zs1na*C*D2AW(c*f}+<;fyz@?h+tyX!SA7)(&
z@OH%m>iuF#+|I>I-JXJ*{;1Doc9e04Wl5_p@l~BH7h%RPnpGx8%b!;h@~L)3QD8v<
zZMQKcLc9P8mOk(2T+*rEL$CL<0l|M}>cVu+Iy?zM=L_i>09Q%RV%H(ySkaP<qc!(f
znwkB3Ej75C;_Hh4NMBQkT!4|ZoGZASTT2~i;ei`iEf1u;ju2jQrEWxnT}6^5D~5W1
zYLmt(+!oY=D(>c3r*U=)f9IaZ$>Yp0TCg)vpr@P67J55!+aiGa`cP^~if~B_C6wnl
z1X9QP*&RUIN1cC!h~_r#0-E=w+IZQQS}g9^(3^G;d%n2mLROATbR_2<YGyk)*YZ(p
z?R0e3nfmzaco;e&B*TH3qGAza?&)WdQ9q!Mj!()$SxFp1D&s6g)jhvd3*rhwY`$=+
zi{*vvYE<$Wu1IA2EMO!wxe8#_`M$a8|9wa0VF6QDUvKNi9bjF+G5L<N<m7|@{{rCH
z*ITe)e!S0a(bzyF6n=nozEF)r8ry-b{S(T0r2O9U{OM5afzIByk<!U-F9XhVuF!Qs
zn%?yd*965xEhZbD>akDbEyad=y+^>vj=7&mUR{qBFEOwG^w=e;F16d)_81}zA3r<H
zC0ihux$~?0{a?!}^gtDN#p}5t(`B}^37wx{tz{s_zj_N?@o|V<jS;@~HeKDtfAwBY
zN#<dNFVO@=7#$ctV}#1T6va!a<;=nu=C<2Ci-9c7H8pHI|G<5?cTaou9g%{3?<*(m
zoQAIUHF_fD(@*nr6>fRb1rODo&Fxv3D#T`*XXyKo^=oKnL&N`SUYu%`kLFgE*{wOH
za=;WZ?N3@d!zzDrq41Q$_nJ3AOfH*l;}JS<+IIcU$scVGCBNMXwOBQ~yCHMR1_ya|
zgl^lCrruv1^wuMEcnzmsp#lDTi%7${zu>J6|7-oFZpJ&9ukBqP>E(CaJ80e>jQ%{+
zQ{wZzjws1q`W{S1b%*aW{VFC#<S0?_q-i@od8a;Ar;tb1JkZQQZ-GY^5@^OLOA2<^
zC2aAKa$)Eb*ozBO88O=I<PN<|hVbk`LemSOiFpoB;Xu^w@c-(zB^qHG*=Kp4E|xe7
zZex)j&KCF(Zjc69c|Le!Q?aF@vC%iXlpuA@_uW6f>*s6xnm?c)n*?Q}=^Q-G=Qz2r
zgZ7AZtTFrdVbME_BCTtiVr>^!dDl_mTo9e!y}b3<c*%3Og@}KiOU~60Lma9gQL^jC
zuNqFb1Kuudk-5%KF^{Wx7IR#-^}kxw_#mg&hLK-!>XgJ;L_mjW03R1%42%Ihjn5#+
zOhpcgAqZCEi_22UWI31OI0iK5Lcs##4s;{Tpyj}y;I3!|%{O@YulHVNM77r$@enri
zgHt*_f5GqbY{oMPfmN}>(1`oSGeupD&%K9DfkK4men`8Xxr?+2CkjDx_f#`n-~e=I
znox~PWoWr^yb=zL2*_UK$agv`@U5Ysrq?Z0USD9YtH5-V>x9_)On?qD>WdONLd$Q%
zh#GaMj$T*k8pW&aWw51<CgjWCH(#u%c!Rmbxh=mebk}_iSEfNTwH{h9?y##w)P(T_
z*{w({X}H<0ID`E1oSHB<|0G>U$Qy3MX6!yK?#!=qr;0IG!GlMqZGz}0663%R`H#Ph
zJ@;9Qk}7FWy>PKEgqOPSwR(zzE*#^V7<YJf-MOC98#*Zb#lAmg)=QHnW#VR52$v4W
zbro1P5)`ykI1lrJT!b?08VCYey|s~NnZi&mlV|i6VlY#<rA&;b?ha8}yE7)x_z9$S
zt)PDf9Zpum?FSi5XdQ1mx7^#MZMR+PX{uL|R`?b{o_+m2SED$s3^xN^du_bjy`rVY
zMk8v@W-JvqfM#c+1n{nI;uP^F5N}rBA+a+fTR35=<0{rHD_qcXAuR`Gw1xf)wAtgR
z4sJ+!_=}Zd4CZ*i`l_O#XUcdrt&M))Gi6&}H+bTAgU>yA_ha(B00+d{w&q*v&Hh<`
zP*4~mfwXfsa@w{=!Fgk){VqgwS4Th%>$s~U6YSmxvFLWQ*ws<U#VO4~*C=LF(hC>t
zP7LNlS^)IO;|!*~(7znFnKF3h->gN}j}(_8X##ASi)TKyT)pDdIsU`DaXpZ=Y?<66
zuB%kn9nOJN+(`s<D_96D@v?u;AqG03UJPk`aPDBB1=T*+rw&_$j6(gP-+NtMin<f)
zt#h+l?6aDSM(Wg-hDYw>1rfZ5Vmoes%89@X#a%0sW5`Q_(4r%7+s0T;6V)J5!%;t?
zCZO_?A?>Wz#Bu$wm~;9T<EQ6?>v+VhsEfp2Pg$6j)%<u6Ea9vF+o7QHs3T(WR(67C
zA_g)Z4*Idcm?BFB`UGEfHgWsjdqIc(<;!t2B|1fWd<44408VyIZxuHprV-P*)^si1
z>J^o~8xi1fJCxDk85yf3?uy60nZZMX7<t~T^+s$;AN2oVx0~FkKQsLt^joD+KFIp|
zgSdHruvWNM?;3#p&<`xjO9Rf{WXBYQ99Zixb4r)bGIwlb!Go_|Cwe3JbN;5KuzeO`
z1)hgIV_NX1h>(RJ4C_zHks14b)--F5HG7=E^`mvqh<bUYn;FMwMX#kXLt~MMBa7fJ
z^AQ)5ZDwJAM1v9PDq>1qc+aZywe$I<Dc5uq+js(Y#*j5-!#QgS+L+pSxNm^RT&<ZF
zSo_5l*Hyb8MBW*!eM>TT<%%PRV0wG_0Aot+t4zmSNE3IAEbupE$M^1X*;|!odr)j3
ztHg!f;5@pO_0XzH+#*)ygF%6e+fmMzol#;WcSt`X*!jk9Vb-=H5Ch#-=da>W`7enP
z%}955>K4c#7y9g90o2&tJnvr|4!rUZJBn(3vG&z4N;x%AaTm(G)MlZr!XeU+;u$h$
zvK0=G^M(YMpe))8xAcnnv4d}qm_a3Xb}X>b@GbBW4Rs2*Ex?q&Iu&{6Jd+Xef#)xu
z$MZ}D>*0^U&{lbsXI%$M5<J&EyH!mdZg?y9c(p}-T8g@Elea%3Jg1$1uk=Dr`%^c_
zF)3hJ3ENdx0@^<(;qw-}29)qAGNna^g1HoE{QOp@_6J!N0!ot+0C`)AvDMpsn+E|^
zCi{ps>MAX@kTPEKaAP(yxXJnW>+$kS5jnKUI1sD#scoedh`o*S^|BDt-I-`cJt)vQ
z$O^Jm7fZdq9x6<QdTLz%q#OExMwY}0X!`sxnGxlEq_j>D;97gUMtuCm_0C2P!TyJ-
zgxiJPPiC)%BLi7QFT6x_bm8S>bHCsD!WXdEC{uqEwZ0Q&uAuZVED6Hp9*^<4@$kd8
z`whC(PB6c}xr~HY4o*hz<;07eNbd#uuK|cguP|a-dh~tYwBce6@Q|D@#&*K6-5Vt*
z2hrz3Bw_=L2OsH?shufebzlZ_G4*1af-`eTwlU24>GwJP#Xl~oj9bq>%K<n10{6~X
z^me+B76_h=$^Qu%-yr4sMXdkhpa)U-j9L^0?W>OUl1Aq+{5#%SyNFjANjJ7l8BhR1
zLe%+thsb?nj79rGy;XX`q;@t8^&wJwt59;_17u@`;BGgmm>3z`XRL!4Hd}O1dsUVt
zJ+=RqZWA}f@sw_>ONg)9phbkzZ9s&IwqS$kd;_ZP#xvY%3l`g6IJg|RMbuTTE!>)$
ziZsq{4oX39bi_jjNEEQ6yVmz!<=5YAaRRrU(sn_g1=UvhY;k@~@ANhVvw5<mfIiQ4
zQ$t26!s~>v?vi>&@ihtm=2RMWykUUco6cjc+)}9L0FE}#%uohwZR4x!adcybMZnJO
z9klIq^oh~PR4{Yw#<5$Q2CpUvL)>Ovc@(<0pTPs}uv^UDuUG#LF}b;V2LrC+vVo`1
zzWp}2{wUsxC=q0}{|$T_apxr1eJmz0PHVlO531JPlT+p+Q~7oJE=}qSGmdXt?Lv0c
z+WVH1)D$cx>w05O&@X>hHfI-z5GT0Z^lv~IKdMf-dwhF<YRG=zh)*OxS6yKvW6$tB
zz9-IynlS*^)Z-0J@T?eq_~M;hp-K2aqplUI)xqyI>A|x!uGgjokfO5TVznkhU|exl
zNk7)q9GW3*DUIM<qGLD3%GEk8uw(=&y?8cAjn0!ph(6AEzysgOOvXfZ6XsN=JFY@^
zS@8|dV4rwd#(k5S*T!v+_mf~If6=>|>94X+meI01M77QUFa_NWm6+|steOi>8vb;6
zYaz%VEKg5Bz!U~D58D;Cq3Wc6G8go)W?tC!$lwnrG#`bhec3xX%zT>|vxHRp^n!tL
z1+ymaDiLw;#zElxb@Kwpf$y(tHzy4TQ6hzL_Wh(M)N3L7yZsL)n+efl@8gW~3mD)|
z@;S&K`oFI=@mmk^?SUJNd+~y57d8Zu9r&$pGD}D{P%6oK(l&v8C+SlGp|dvD0oY>y
z1FU66(HWt~L?QnXn?9#3bL}wEIsOc!9=KS2v#7G4ty?VFH*`9eD;>0b^V$ql?J%*2
zjoCOy)@Ked4U4=w9XWI6!^xe)#OGP2X9RDZ42PPO3n1`3g0_lW75UDxW${K-=*9{M
zAbA<-h^?GC6CiCr=_%_hazMoGcBr&pHggYL_%zR_^P8fd1=<W;xNgXhn*P#@=>}X8
z>Za)LkIf2S37k<;+(mC|n?db29;F8B)1(w};tF1;f?l!OBp0FN|03E3h4Ub22fg@d
zedbg*bTx#+P-l8oGo@RYKI*1txacSCH(kE~`hWT8z43C@7m?kkT5j!Tp5!3xRk67=
zA|r4QyE7G-$r9U-N{cW(0x7CGHU88{!e>1}nz+B8`gzx3r15@MZcWWy2Z7i&@v|pZ
z-Zc5wRZn}(M8uFY5Ybxef?l1@Pu#qE3j0SVC+Q215Asuz8BK(<;HmLbxjW$Q%vUV2
z0dUc2)4&dYCdhsyG)7%Wk1m`$)0G|)8xw%4zNYZC?~=b;#~f7O=9cSm*-t4gn^VW=
zRaqRpY?T`X)bM@|ff0n8SlWL{<wjoD%Nz=vblWtJw{%|u$;G}St&=Pntn(j8uef#-
zBfOVEP`m#yhE=vRo@gy<&S$#y#<GAAQr5H{Hyn>|{(yV_9yR%WG7hi*Xz5I>%75nh
zJAEH&-Z<PQNwp9vUn<NjzXtl;Kv90IPsB47t|W;UEzZmzi`Gdzz`KRPoG0HnUB3SD
zJtElt${{f##Oh1HZz#czmhZTRTic7aCCH8cklv1`V8Btp?K7gojh4PEzTC2@ULDa_
zGU4zUjk346G`#j`%EdngghPCp;?n$}Sfi9PL$+OY$srmNl<aUrqF${3LgO>VnG|-a
zxlmBeC7i&qA4NeV&8fIwe?Z^hi>gA8)v>j($k(wwkG-)*C1}Fes&*gyMwRbX;dNf6
zeB#EQj{xxP<M)CcU#n1qQEE2<%ik2K9W0u&1OY^iD8R)KqOb@Fnm_$wcadAcF&ZL@
z*r`d4?|4jN)ZWa7uDpM|#h*cxa33uHJXe~r7Mk^Z8*IG=SvUW~be879?VksiWaLsH
zZAYy^?jK<-LAL@xB(WIa4ThMVc>{04(ohT;Jj!3%%p#stt_9j=Aiv?FH@mK`cL65D
z^q5@7{}XDoI>WKg6tz!q%5s|bFr4C2diP`Wz9e$|12SGie3RF;$x?TFvRnf6or5ZE
z++M9U17+#vd@))T!QipY;L=&ReMIYQzp>ihMVoWTESr}OE)FhIIbLy45b`-!J}?Dm
zIl0zD;QWhLw1v{2N1=xQqI2aU#_KEkKT3E4&+y?(<7z8spy62!Z&hBc5<N)%ti89n
z%Et63c3F)bWO99Uy+L-ahF}MlG`Su^R-j58TN<pi;sbD7O~A%ufUFe>Q`mF3CK%@H
zLN0K8L<bgyPt7WS<cjkQqZ424mo<eNZCLmmkE53zrlx=y!^7>@SENu|f!3q%&GqI}
zC`#j7A|Y!6Vq;phY|nQJti7y93G)ALp@%w>kDChA-#n96fsC(~|3hLeGYL0TSdmJG
zg^kMY?Jq8f?It>S={@y?EMy!vsMRxBI9Hgb&iBVpQ|?nvLW(k7>k>G9%{;SiTn{++
zU|+c{I_bitKk^1oW>6_)|E_byjCz!FtmH6R9BItFl>e%ve~jVx%e(HocecyKrt5z=
zztEjqykCWrY%(pnrR3QAxSuw`y?jm`qCek$r~!DvG*~aBBzBs^RqmtRBO`>i3A!_H
z3M+ZI%0$E{PjHpN<Z*GXvZmAio8#!Lp(4#VW1UE(yK8P6R820R!zE*=NIP!Z`bzyN
zd{R|-+{EQiIFcA#D;=BS9lr}rt_okV_Kt50$zJ<vx@N_7c;}G=sAP?A);zaLVLQXU
zueuObYQ6S>{8FOkWz5KPo)E(hW{xwYUV8Kp)uFwO)4fo#gS(^s(lr>Nrd&7jNMuX6
zavr%SlBs!1G{CjKZBasT<H1<X)GekDNI;%;$Cb&DGDb4ecsv9D;*{Ngd2brm-IGX{
zD#A=A!yaWhEHL}yp5rT)KwC1-B6ZrbKu~fDse#}$yt!=o+|^x^t`jV;-Cgm-m`fKR
zjjenp4Ku0D74;Povv9$s)=E<=8eM`5=b%AE+v}(~-&abhhM4QIL{!T0FOLA<z0<Ly
z<&ZDF&4q=4TbPXF`rX93gHtV!)G^%0$}`Z23%G~;<{oyjb&$a({#;VpcE(miK<QwJ
zkhTx=7J90E4^9m{?%_39wemy$Qhla2@3emSb~lk-rPfktg++)+ISu)e?)~R8hmF!P
zwJ>itmJp^4ZYgXeln6QSp`1pq;mD>Rqrt_ngl~C)I74N549>8h8OefRn(`k9n_8Az
z9_>)Omv2rz-?RNZFX$_ec6knX7qmD(-;zbnI+>pV(`m~uh8cT{On%+@w|0_&dBoqN
zOge}rC*%AR^AlQEqN~%tV+$J$i=!unJgBGCcfYN~83$JXU`E{jgDj)7Wb@6~!Fi1n
zl|=*r7?2Y@wcE*p563Vg-0D8r$ekx2sP?FdX+sTwl1-Ry&5V?1aM$|j4PB=uTY>=!
z&0aw=x~c0JDiJXwMO|5b=5*ZB{AmYTw8r6#J^mz(_1M#o=iEGX2c^?#ie<SAGTR|<
zO)HFaO=drNWM7l*klng^{8n3ffJOI5A2g<BB<sS8Q`Fwq-pc_UvY?xI<t}f{g;9-m
z3D~YqBuu;0`!4Cdhwm8l9oi>>cmH1|=M(zw(c4;s_iFl<sN&2?_-kD^wJ5cCt5XyF
z$98ArZ><xW)K_-ET<H%R)Guf+q!hdrpv0E8aJn^VFTgj3r?T5>J+CYQlf`sG^yneh
z-8w`;?a?pK!qeI&auJO>G5x8a1<}8570gY&PY(SZ=yejq!{O#!amPvU{pv3VI#zpp
z4k@?EfAyv0_49)_xUIWMiJ`Z$S1P>r8ijCDTZvLXuD~~6N?Pdh!8<;U*BGg4dfH2D
z%0Y`fH)HmQMP<BHN7q-r3n+zd(z1;~+?mg)7jt-@p2O$iAqfKhsn8{qOlmr;WdCPb
z{lNREw*7nqB)Kyv1FAZuvxa7ij!b8N0@-K>rOjC(axGQX(KTk=c$WWA{G=Shk}+4B
z{QRWD@7^aE!=>C}n&}RDPUm;8PHTd3cYC1wD~6EXKB!qg7p5>$tV%9967NoqG-U}7
z=parvYQtTo#N*`;K;6kZ2)2_!-nce(=NphZzmvji2`k-%ustH00hzn@gHH51RD9)M
zVs9^%CBCO%eqlihRmKh9ZmLOE3Q&>+zz3|)&)I9heO#F3?bj`>v<-RMQ$GWy0oY&p
zhKSOpBgIO<jBwmTn4+zb@IB+OjT4LY;v1T-+gkhBX8H@0LomWHsF|#{)#qQqj`W;>
zbfF@W0ULN45Iuc!lVb&1S6VSWqBCo&+}rr2Lf%;Syi6(#TTT9C@)3XR-DC6*XovYB
zEk^rd<KMTo^tu3WdL!%D7Zy8PVWiR?7O68^Qt4#&47wTEG;CeF%{t;6&=jFkeg_gW
zh4^P7!gg)4a38&GMD}`PyumZQdkrDau-a@2RVs`1ypQZC+~<>0d>gem1Vo}Hio3<$
zXw^o*WR{^RJ%h8Sx+XdE!J1UBQ-{jdKf!0&8vyi?pyby}dIIzH4^pr<GwBJAe=^nG
zrni$$EGj4H>hy%?baeidPUPX;IDdWLK|+bjg>61Wo<C|GD&1-Q;{*$ddpQiuD&O1W
zAgf_^Gp8~SiR`GIf5ao^eZgadIbZPi+(hu~pRtq~ro~FBqMFp(eP-IOLgA*>*uo}@
z07yjedhDF<R1QJ2_md{RQx<tC;5`+(;(23B8bM|ShJn}k^af<le~xcTpy=b<j&JN<
z!`r^C+Yt|Rzx74y0_ObG(Uk>Y;6{|~Ey|q$hpWo_g}wS4ky$}qTDkzlw*HUyu`bf>
z<)A6liv#VM<HT+EXQ&qxhoM?k<adc1G-bCJ>U8BCLe{xyy0>8I`kdqG6OQbuX&`56
z$bkuM_xL6`l;fDMri?s4=jhG7w06GKewJVt(spjLYr`=1Dn=)<4{EOL^v7D6*VcQf
zG=9{RA!EDIU@vaCm*%ik{j{CMA~$eY87Ag?Y2VD1*4v0lC=O{G{j5ah3*5+1#7>t@
zcM9%WwTz1N7X1jms{EVmUsSl{CRFzMO)DG%Q;V%>KiocFO38K*U42jABZli~XbFmO
zFzJh6*DpU5>Q7qzF3&jXy1ZOEBk=LOTG{-%MRUVHn`3*ChJH@~I;F88@99KsXOr+i
z7ekHGAEEaq)VJN9NE;sM8wdCIUO4tyUc8ujN8Jg^3eoESb44>^z~r^QqAZR0YMuL<
z9yX3RIWzej*^!Clt!@8qCS;KPpp}4+=Adm5A<$(Y8{`X*xX%V^@;!%xfX!)7{%*YD
zzIE}OT`bK$WW&mZ%WO-jo9z%Z?Tsb#gU-+0Eu}`E(_3(k^Uz`xQuN~u%uNy9`%~?~
z{mUXux#@#+MUfYi%MP4+FUzc7ofVVAJQvcn4nx&zpu`*X6lqrYwOh1B%r+D}oQWZ}
z-vbYO!qMhfLKVi1^6eL$$Yt`UrE2h#q1m*qwmjc7J}4`-2>{yKz)&iJF}dFC_jf@7
zmY21C=<Wd75XZ%!O}<^20ZG@6(h-I-IsoOuvX@UXGNJJ;lHB2_3LY6QCN<%BB{=on
za7QNB*Hpuc?Pr+>5~MK$xe*olu;kN4?aTG^IYDm~Dd&TWqcur)2;QcGGTvvfW^J69
zMg;<d!|V-;-?Q}3URv3m50Nv_=R=_I9gSdMGMz{Uf4HI{J{&xAWsHIj8#EnDXo5)$
z$xzU9nRI!#?bCwicM;=Ms7bLshu+HF!qExTy>|ZuicR4t1$_;3VXMn({6wf_7}To~
zO2)Y9MDYzWvdUkq#qxzZ73NcQY#MB*t;_Qk>iQgfAhS5%3@v)ek)3!xBfV2|zqc%Y
z5Yg?tHabPM)g`r`o-%gh+az?+z5ARmrYm+PU?PjmGhqo&P!~4K!YoEdqy`mR3M*o@
z%(fHuwL&FsY~GS3-bPi<LjP2=WV+;@SUs59oNk6xlxSieCT9gT6Gom#nim}1Gk^Mr
zsrFJ>LG~{`5z?yqJ8jQ_qom>=F!OlB_n$;Kg&dqQJA-W7+?SV{dQPNBLAo7~%WNGc
z;6`nyaFm+j$LxvYCm#i|w8Vnq_<0C8osvw=o8qhbwDvQHhiy6w=`IY7ym@!R*k1mK
znSbu|;2=rQrt;Gi>4|V>O(x-XHRs{frv-f`UHNC^Y73A>8#0J0ZY=r47c@a@YN>?K
ztWI+MEBpY*(lnyTR6jBEM2KRbc0?QiA__C7luHfiiQ}WUCmY4OQ)t6^Q^_VuB&7WR
z<LRu!ntb1|FCd^&Uqw15f}ql=BUKbs1jL|W(#RwyF;b)@MkqNz1O+8VIC5-&bc|+_
zBL<^4y5W6%fA8`B^<2l;aXf77zS(_U=lMCe)u$O3zfZZ!WG$YEWTyfi?=Sj$W(i4y
zf3l;pjn}Ilh%L_OA3vl#6l;h5bqD_h`4zI?FXDi#_~TdNrf<fP;*Pi&y>#w^F3PeN
zEfF~DE_11T-CKzZhJ0ZgRhN@zqxTAY?;+(bws`w5`~YXTx!{81T*Vwiy3$=m$<|Um
zwISfbkFJh4JR|(uyG=O!=(s%F)UTM3_EuSrpYG57b2k7}PTw0c4ATF^HJ<~VDh3VL
z=v6(g=r<&P-x6%8kn`f?+A^KLQ1bW?Vi~7lWG>dE87C@r2;OH%oRe&d+7UETJm6U<
z^!;tUW3+R3k8#Ji8%kMrUq>yM^=VpWWZm@NY#y}Z_W$9uc`$PtnLqW$E0G}^lS&ZH
z@(me%@=4#t@lVQjJXf8|>h&8Ziwa)1qT$YNySfT5*-Ls|Sfv8?_SGA9M#mnRvP!+D
z{T>#n{$at;%26o!7+T{Bb>SFzps+qZeAZk1z%)`tJ=KiEw|%GW<zj|KUL3=)jL)ST
zYPMbp%Dk@zeq}68e+&X0tMvWKSiSzGf38qHd+t*x-TI8_zgKmq`aM1vnu%l@_A|%d
z35I|L=kBwCr?0iV$G$!U>-z1pXK|bX%>?sJR9Hx;<(OnszoC+o%AsPLJm^B{7&v^F
zd3*;xInUk7Q_-in0FQ;>OXwr4{|mKvJ15(B1X&GOFwGs+nWVoUBg_1@i#yFv5^}1|
z)lo08cr3DkW;}}8e9Uz#HbAe2@aPaZobpDTaw3;MQcg1BIdS65+HX<Mk2@;N53|>~
z3-Lj<95_+*aon<JiFhs|G`JBq4LTa*^kt_CsZbFC&U0%bS8;AcE|0|=$PN99(!ErY
z=7MU3YEOalBOSQ|%jmS%Un`Tgkk2<Co%*>6tv6q{Vi4|TN;*WVls!&ud}GP|qd8K|
z)}xefK~zg3@wsLLK@@FYs$)MXl|~haLbXVxdDht;>$9)>5yd2~>~MT?W-`uupJ6@m
z)!C|=3C*1|&OCLKR2VILeyZR-XluBIn@8v1V;mWsJN};v1Ewcx@Ukx$;n&^!_I~Se
z9y#*hE$4`=#**Eq1mnC<yaU!n?3_Qph1YU(;8-^!{UtHCRJ=uiabBe5Mfo>TM-Yj(
zn}+N)#@<p1#Wa|)UP!F=v2?Ccl}~$wzwPfWN6(aCHHHIpM0Z7$p*IH`*PKc+T+&1y
zApf#-xs9MrwI)6r8cikO531++6wRiPa<c;sY1TwZS1B+k$rB8R32Bf(BO3v<V$x|B
zS_OMBN*%V48|=YZZl};RLP=uOJ^hJk5`!i8B9uL=NjQ6A`c~*RTHoJ8#ydh^FrDy8
zpLO9hPG4{l`g7x{8`x*uK6dk^<MGjpIXSnQYQ8h<P_-A<7cvcw;0+oZgwM29MZ6Ra
z2uigR+>N4f=<3VT>Oi#!J2s5gR?``;(Be|O`_BPBf%3+Awk7BWO^W_jf_DP!j+JFy
z`>@(}b6V4UOjhI%@ocW@i3!*D^OrZn=B29YN>l~R<KSx(7Did!d4r=y8=6uFZ!_x5
zu^sx+i&z7B(B>dAh<*vWr8&wo4}9qYf*G&2Ujz05(PGsKG-#dv8%x-gckjCDRHT4s
zXQCN<d1jd#i$e9e1;5e-thLrLWw-Bs@CMC7=~iXOzj%AEukQ;vkbC?Y{hG(6k*-34
z?H5sQ(`#J*OhEkBe1y4ANGQ?9ZG@GqB7`+OG=1AiI+>Y<3=p2a<fM)d5R{E2{hir<
zKMwK!Ht-pIbUDB|v89siePK^=H+~y!78v11B+wyZbB;}a*V3R$$==*J@kUsmcRYNz
zMx!XJfK@%ANfr!E>k#LLcv2TXXE&w)E9rHZ97OdO_zw#|0Fr|w?|j^g8n$jQMvT(w
z<tfwuSwqxY+^$YA9TsExI?(whj&9WeTdGHlM$Nkn&ok+8w!dFDoP`<{S3I!bz@ID*
zbq1+DlRR!~tyx>N0%oNK_Dba4LPrgyTuy)IKfS*kHROWAUKUO{Ca@|Hwt_j|HW8+Z
z2nfy&6O=0v2Ug+wC(gN4a(<s3z)KW=UPgu&$XQ(bM02CHm*Q`Nl9nEr^35@8^i40#
z62-8Jlh}hTRjkx>eFPX*IxeZz_7Av*?a_=RZCG0N0Sss2uaiiFOM)TyPywF|n!T)>
zAsMot{szecfU1{b5q9q7%=p8AnP=NbhrjEpVOtlo{n4eC0W-JS+fC$M_*BCdp(mDd
zTE9O$JyG{vHgxW%Eg*JDv@Aw*x>19WJh?{Js+<h8o=G`VO57I`PECE8hQ>SZ-MvkY
zKA!qlEJ{m|o+YT-!WSW)9yK3ZdBHfPBcn`nyw{--onX0g4N`3z#p$%}o(5U*MvXtO
zF8u;ebKfAmVEn+OlI!X-Nn3B222%?OxVn6fUdt;Fm#iYE{wD`a9=q*8JLyDHmm{aE
zltb<6@9u&BRbneY8?qzIHU}0Fg3GmyI!tf(P8WOGT`<2N1ii<&-UlLG)+(*8F?^J~
zctyDQ$W;QQWq;xBJtY?Iy>FC<9^Qcqk2Maga7g0Yp6UX#ejQHZcOKLqH4y~_23HAy
z!Y;2n(|dIXO-)#HctBCtPT#qnojY~1TeLZ8usE5E9r^o%{C=qJPML1K*BiWE9|P|=
zJy~oB$|b+JyWXymdjCG8&UesGNy`4YyJ!J{wR^OO`Fi*z*YM|nWKl{Pr+y-soy$Ww
zi1rql`&QEDqiqi?=QsH!rS-zmXRnXrLG>>tw5w~43{bI$rhAu5*1xY;jcMc6%qMjw
zDPwKdD~AcZ2(}t++@lPiSCD8iiYkf8NL2~it3tkCST~zsZrZ37vtv5ic<9-#^=|fZ
zz*@~nv~Qa=BiBk8*2`8{%Bytc^@IShO52HTU=Q!BC)hGeK63kHu$Zf54?w#sy$nCX
z2F<9o8Ocj+?%jbCGww84M=P$}AjJN)d?%}@5rkODD3`AWP8C+u&%7ogM}x`&-&xYA
zbxORc4*pi~Ep8y9daneCl-~fjS=bS1L|QpmCI2POOVKSf%u6r7`}3`(j0Qsb;4OK(
z+9@~X2PixB+KCi#0;JLZ_cXL$uXBfMt3TN5`jHT-V(VSDOz*{`BGPD3EpblXEHi0e
z?Gl!gfzp;+X6d7_yza>wh+t#3Ok{FhF|5rHyU4%7vHzjVS29b)ttjP4G)gS04?4+M
zJ#nW@>`8OkrTP)SDo*(8W+M;jHZ|ayva%?GY9a^<+W+r9*F>kGOU_*tnM3SPK<t3n
zVlC7pFYEDPDgf&_CVujz&0ffBGa81mGBXj!M1XEyQ|a@JyX2UA;sAbgJsB3xlbnFj
z{DxRk)9Ahybu!*qPt~+%c(O`t^}buf<?d?eJ*}d8%opO|TF?0-$d_w;^E57WDMi_#
z8iS+z0r<`L=7C8oA28e6ztQFCv;mxdKe%XrZB?!W{WmL;ENLJDDmx~IEOiICQE#Ur
zT;|aE48!KdcN7Z7j>k5=hqQTLO`cM~AhFc#9-{1BP$M+LGyNwhC7>h;i;6KzFj|8-
zXD)~kb0aXTFkK=^@5ERbF12u#AvMlZrN6I^*8F!Pbl&tTOFfhM_ERT=6`|Z5Z;n*_
zd;F6rE?7IRqEtgQwvBfUCa~(f9luB7PYfs#5dW(=jn>(%@hakjGVjJ01+hu_ijgD1
zdy6%THZT52$dXyB0HVF{iV%~!+=RU|8Odrr3@fVXu32zNY`IRXGwPbmqgECq6eakv
zPH~1+J?bwko_;oHoUaw%Ubt|=z<XZ~H?kkUn{)XUjk?H+5ER6FpI-e{uqd)s9Jl%1
z+ZVx`4>@=dL^6_E5h^^}6+g3_JM()Cm<}!?v8b`2n+1>PabAbm+XC{zsD*v(O_hp&
zoZZN*i~RZp07xZpp!dRa?|E873Gh4g>*91jXJkVo9L+=7b8>G`vEE58qq3rtg7nsX
z+UB=Y#l7U_1in|vm9nF8vA9ox1!AfO5xCn_(``-turQpH+k1M;3|q5j$FJ|!7K67u
z2h7&glubpxV0ZiGimK#%&!dU~!_9D^U_T+QKtie9{%@6Z2<$d>thGLOcWuCx*jf*~
zpTS~Jma1H-&fm8zs8@Y-qJ1l@u~+pZ-;1#mxw2^aMLN=={C4<!Z*S|<kGnpu_oodx
zaO!p<XHM(`fApl|I1!w%c5xW4H<cEpyQ$*g#?U~l;yDnYMP+)BXM}KFnOuisA-E2t
ziYqmqV?)yW^b0O()>Q3DmPq?vmdFE$nMtCU{uMEu7hwcJ)hAl;CLZpvPPQ6MvoWk(
zp*cJy)q3kP9JqTJO8xp7(!!twpeEG4P+9h>IcrIMXv1a+@;I35;w_MWBA`MsR^Bs7
zVsk6e^cK+S<r;#z2HNfl+*Ao9#anh^>Fj2-y$)HI(Knei$`9j~->9ATj$x=}322^9
z&A><)_2r2DbJQcN%)!t{c-g}>$Igo)`XVD?y~q43d$Z=ep6YHThCHJ)7)@Qk(ggdp
zdDVyQjSuMK>DXmosbMg(-}6u*lJc7Drd73E6Qj)d3wAfR%i`K=&$tA4&b}IbsfX4U
z+50YhW9EI3=m~MT%W)4=jazH-Eu*_}*%!30Ka-f7fCfpPtaoAJX5Q?$!Ub|&NuHsb
z@m~nChx%}VoD(#XhEd*L2;u9F6+Xz~XIc9$F?%s2_b1`oz{_OHE|Zlt&zV3b)?-R7
z>$~LLwnpVsDj^ew7dZW9=|@IxCE--@OKY&Rxgq=AJq;~_`B>En!r3561Hf*I0P4Tp
zAIqE>05M<9vFXxW=*c<Fw8g853Uj7wH_i+wVS1;+izqdPx{S2d0k3riSNa~!g#fcL
zyi_is#`O;Kzrq_u?=03%cnVW4?C(c@^j|A#{gD=;7ds0zu^H@cY~lT4q`v6XOUZ<b
zxj7xH?s*oMPKrycMhC=sBwSMiQ{FN#GT=4sW4WBNjXj<C-HA4ehHgPa=L<KQ>*1E^
zOkEh_k(6&%&eVKNKtH4o_TxqP)O@vci2V73G3NR%1G9$iRvG(J&C@YG#I2%%LMZj^
z^FYba*S?-AYCqg}zpDe3OR265W5w!cududohoZGY7FRUS8cM<y00Y}G=$2#Zd7<q?
zI=-M6X;OL=vt`)dByE;7Un?KbxgD^g?J|8mo0YB0y{-5=2Mazyuh^!KDJ_KL!w2wA
zQpQosNlJzI<B$I_SV3+-*E%_Ct7H`Gf6-Q5r6!vLWG#jk*_7eP&v?iSeO$NI8v2=}
zn54l@)mJc4Dg43WN@0a9{*tg~KG)y<W&1i`&9O$1;8ZT(%>LkFSJs!%$Z{({VNVG1
z-quYMyP{lvXA#Y0&N^w)sAxSJvl2sPlfn>`acg<4o#fO9MK`C0q6F?QmH53x7*|uu
zgl|qdxGuX;R9v+rw!wPYP!e~M_B>`e0Q5I|aA|8Rkmv_R%6FTP>zrT|Ow^rq&A5Uw
zezjM19=mO{DFl8F^O3CjdoI<X6=ZeWg~zT0Y0GP3g}&rU8<c8IgLAf-Am8-~_$E`;
z<Y(i0DoN!;Z;Ua^znL~jUx0yP*x}lsTOia;_)$?=LrhW3L#iF}w`IY%pK%sB=Y$s!
z49(|^0-HR$tMM0ls{@f1!7RWq!S9wxo(}L?Okz;tEnHZqVH${J;8#g8o`w$g*IiMC
zJ@4|IQTd2+Zbx}-nuihN6Cps7CpO3`+{nPy?t$J1lx{cm_Hyz5>CVymdL<P-Z6y;e
zS-+k2@(vk}@EwLyz$cR_N|ra6FR)xtzsz8G!MKm`z}vb{Lv+D_|2ygY35;8Mf2xsg
z`{oVH?jw^f0qQxmPa9V@nF8CX<vy9Ee{E9N?Pj#FoF|2;^))^wuP*qVhh$h~q&zAM
zLNj^dXCs*PuWVlfQ`+;X`q6;`s5?!uKJyM3h9-@Tk07}kQ4iQw7H7mJh!&DTTCi8!
z04zdWcz!Axyb={W&2IJPR+)yzPJ6N7DME0RWed78L+~Xn-YAORf_kfYY}e)tx`%+|
z2=fQdh|XH;LB(P}Ob*mT7*e<DKBySw*If*1kd>Y`)cC-+jovOi8DKky8xwONB%hbP
z&{Xp9J{Pci?&fATtBbAC^A|kh=$L~SW7_DRqYNAAsueej8xrJJg?|$;pQ{THOWKx$
zwN1VwQcdauIL<MsC6&qe1zFMg!f7TW{s(&%E{RF-u1lXLURKZB!)N-T{LI9<du`I4
z>9q8g3>7$|x<h<^i0O9<<`#5DAPN1H2%l!s`T4pVz%Y}8r6opw4VW3QrI|L`L4JR{
z<0<*)lDBE&+oy3mUpbJ?84?f7Qwee<U)9ffe4eGnDHX7N;7>Xg(5w!!SQHXFQE4Y9
zdBo)I4boy4RVeu^a9iUU{L#-_XGf4AYGArg+Edg$HCyY2C3o<ALG#WB9UJp8@OIs1
z)uwc{!ktYh`{B9No}GKWMok)wTc&OAN*H~y-_$=)>t#@D!QLOfsh{%`&oN92D9$d+
z?EB5%nQ?O;&0fi#p8Ut7$?Fu@H~%SrcW+#KN(TU_e!WHKhs#x%=^Mm6zq;CbAizX1
z^)cPOazNC3iSNqZQts`m+EiYL2V6f+;yUu{RoN+6s`kJwvbR@p?5cm&OKlqV2$I|b
zD!1(4;%e+<Xg?XKV3d#n@^-pRYfIOfb*QCEe*;z~y(!4k?9IeLgXvPoon?#wiRQsx
ztP{O&F(3R~w^^f2?rl$W1<=@k-F9@@6J6^@$srh$r6|HnhL<mCEgEk7|6sdv9De<3
zj7im{eU?W<0s$8S+fz4?)(T-de4fDx71yt{_H)W-)p1K6p)4^SS!Yh-Lr@eP`}1ts
z;LFx#*x9nm$7S8I&bwK%>zf|J>)iPmWO$jh5BSZH4|o~9k6^1XBNO^g-k642uCy8p
zA2j}Bas1C~dn@tAoqxOIqdB4YuNIY6Nbbf9%-}rj{<!2r{xZ9E)!)B6`wp9X-vTLu
zr{a|xf%VuqvTZv`;D|9WuFBG_fl29B%&61`4RR-)Yvf+a{<--I201FUu9>kw9{Tm0
zK=Da{1tNd{SIJRLiRMg1Eftz^&@S_z<)w%bh2ILeWL0oYoKz3W^Y{LGhyMGGfE#I&
z!Wx(N(H2x#Vt4W;`x%j?y8*TK!eSrseaB<@TW=1IGB8$HQkU~6`{h0&_U!LIqE(~N
zIMBHp&|PmdBg@B^WnsL2aSMcHy;bFC>{V7tn`}T$jph=(RC9H;!m$A$B|J)}(kLLT
zxohJ3j!pN^rEAM7*$w{bYpR;nX!!eCH@`P6j&qB7Bk<+%FiqV!HINRc)B+JGt*fyq
zrRZ4%VCy_@l3ut`T<r3E-nv_%Jfl(;94Dn#(NY@&S+0jbht-4s0?=U<WgjpBdfDsR
zdpv8;#Py{=L|%OuxuMf;$@c)|Y=2MMTES1ZgJ;aAeY-NkCXeB{TX?soU|a(4z3s}7
zs)9bK-wV1(occU>QUI8;VOGOHRgwHjLnTyFO#Rb7f{IBcVG$Ft#7lv{{R!$Hfy{x)
z>Lot%48xt1VfW)+c=hxT#uLA^h-Z*>E69f}@x`u=EvU53s+nxbo<ww=ES{b5Sh@A9
z!;S5+fewxB3^BI_02OzP-jA>pkHK-gIP2?sKlLX~8)Q0<VZ-kt$tLg6*qIV$XWzBM
z1`BZF9za9jn)s6IfVbe0V>|d5_BX&rsTX+gcxAD~)i_df5k0vR99A$5DV`Prb?cS2
zno>KU^bUT5(4JQ7bqwr!pK%zjaylsmM#~a(A_Cn2RV?Z&D1r~r9|f~lQFh_=WbUHC
z7hVk2mjM*-@qkrB9$*s_r?=1jsF%TJEE`Y%PF_?!0q^6Eg={pv6-o{pPreNFCZHP2
z?oagcS*>NP7H?Ca;<EJnqE%rX*>0^XhrM^wIIT_G4nz$Ox#HT1+&_9RM<w!U+nW0H
zT#kBxtwh~j`2Am36H?n|bqAXa(^K6ClR7hDdbeF~1hUp_UezHUNDbR0itCqcxAe-6
z1ni!~O+=}wucN~QH?Wo7C*y=bZNXO48<6poDGf?{NYHry5hI(4Y@t@RT(vmJL9nGQ
zFOat9r*+WX^xQqPqaMeR@K3O(g2UH6C@B4;o|4Y!p^I04cs3S{h{Y`0fXe+}1r^ft
zehRqR@=S50`K!A2v#t<CKfl>YG(zad_jwx^_3+eW=>UF}qsq*?wRrEJdNa-auQdeP
zMtXyD3j>v<@75Z$6D*qr+0tKTu=@=ijp@Pyf!L9MboYOdlgKFd+B56<kf%~2YB!h`
z8?>XKbNM-6iQs7=l>j;eKMb5KayDkOQPp{h{xq`eI=?s*@p_WzRQ;Ii=DX+nJ5^&3
zs+syx^MV~|#ElZoaT^IFygAzM)!i+NmDITwwM2R8Rwg(r#;ty)*wY3R>gkT<Wae^h
zm!;c@`VX&mh(6u9#dm2JFlRl$e?COF)3o1v!}8+-krhu!3~u0Mc4*Y>e-OyVhH6f|
zK_?V?w6aF<Czcr|P{z??o|yHGfI7qO4c<%ovz|p$k>Axfv{p_15hiDF;Y*a<SXGj|
z>qC4U6HaK(Uvf%yb=p*=UL=ga0Z^X5tGH9%+(*a05K%;(NYV)x<gOWM%HY++ja+f9
z!*@G`K_}72p`bN+f~j(0vQN7@ta!_0^0V4(kmO2OxQWHcyqBFtH6`|RefJPxpZ!lG
z@ZyQ%FF?_v$zDF#6hBJD{-@>KNgKFMv009~z10Nk#q#^Db5P>@Qsj{YWsD;J)M<db
z$=J>ul_%>p5=}-w5yq=jTPA7+IrRL75Hw8W1KRxFghEW@rF@tr<_U2o@~nv9c*Q{h
zGX(q#6VDBkTsdj#)kWF6ZSdEPHgBi|``B%DeluRmMd3(K#rImz3r!boHrJmvhh7#L
zlHQCL7LB<!^4iX_I^tP)RuV^yT21Mh+}0f;ArTVHT>rBFvAXCk$#$`<N^*OGg^V7$
zJ0}F?HBz;8{CpUuG$W)rC&*S4!~rs2$tpYy0I9t%@#JGt*R;3yV>Vy;HT2q{9uW++
zNK2EP2vd|6_u9+S0$fO5dk=FP)?I849@yA>i`(>j)9SrBbPYor?S^%uT3}}Yoc!JY
ztn^Rz*KvPypim>Xh-X}-P8a{vb+fcSO+Y@fo6H5YNkJkG31@~6)|>gs^;KcoM!S^&
zTY|C6Z0oNmf;D;XN1M-ayE##@@VUP*%-I{a`{KfLZh3-kUsJ90sW418Ij^*8?z1><
zInPy9%Rfa@HTjq0_pr7XUCG+p#m`fiv@^I<ObWVq4$&mLME5jVF3o8>uVQ6cDftEK
z4=F!or0NVaR0RQT;6v<gK_xZyi(*1klZ}gAoA4%@M1L2E7||B9(=CN$i0z(((@cH(
z#?h7~1gFXWI3fT0VVnaW{OZXw%}nzG8{R|ow1N30FYyA^PbDqBtjnb7|FQ=YdttAu
z$*P;^nKNduCEc&G5S89H<cxbu0@=VKdF#(!eJ7+I8g}armyOSt4EY5p?h;^rXaV|0
z=f8<xzB1l%8jXH|^mb7n_|A0gxml41b$!OgC2Dr)t_HDZ?ec0}%|jH+8ky=P0^3|Z
zu7uWL1UiryCyh3^3JKEnuhQ<mV565+iwb*`xw&Dh-Y-gqg+@q#^cUE5B?8DA<v#7J
zi%MnN!j==uqQ1pWn4L;Dr_VuanN{={XK56sT;j(X$Tiwk!u{d2XVIz`phoZM&<UI$
z&{I0RjbWW@m2c5hUk7MBs@J!%PTPJy?XxB4{cCKc$Zkeg>XrUVewdMSGcvskFLns;
z0;nRhL0}kodrTI!^dk2Qmntb#rHHo;6NCL^S;(7FZQGqz#M=)g>zdv}njGqISGh!4
z*4YB3UuX#rFY)z8Je?smlv9Q)`#Vu(8ii`tjg3RK-!Tj*ai?-@IKAV-eb7DZ>*Dn^
zV(pskqaJy!1hy>$4y2drpEGH$gk1ZN4tE~8OFaV>$`7-kf5(E_eLAn1OI-{^cbm|U
z6}L=N`TU*j@VEP1ByUl!+u%~LoVr@ScSloThpAL_rz+o}hvQIecZGns`VmmwdE1zY
z<@YakD%!NDG08nl9Y^pEjshoEJ*Q^}CB}*idl=#g6>^Lr3KT-N0@*^x;W!n}6Xe6f
z@jiSPWg|$`k!cC~vbSaO_Ao4n+jyIDKq%?fCX|q$(nZ7YaFp7AV^MBzJn6(mPYb(+
z$O31>+{f{0n)tM{W&1bo_>Q!*+ZFVajo-5A_QnM}s}ePmwy>$a2@VevG}!l?Lx^z$
zD7Y@;1C`4Ym>--}G)F+&1Ep`6=7B!%(BpU$_RT9@jb@|9>;r_v*wm1!a=d73EoxK8
z1}AOT)B`q7Z<Anmi95ma9swgUx;qhj+7_;EFav_PgK>vYU}6739Ln>Iw8|VK4oseF
zUz9!B1bWDoAfInf{KRTMu-VRDpd0u^P;Q%OS~;|fJ80<2$n{qh>wUXvb@6SIa#>$*
z!pObH8J`8SH>9p<QkcK%K1Jx8(lMMp#X~i&s1+_{%IPWlq5c%G3kkSc=Ri;5WDeQ&
zB$m}`N63IE`F65_5uLzg|AbGQkq&)UGv5PQ;mz`oP3cm;X#22c-5=ns{@muaaH01W
za;bYqv2_d{x53hZ+l?|plm;8s&3ysD1+y*iwN9f^Z=`bw%Kj4(w?47Q2vJ;4!9$lk
zi~JSuRJ(dunpN)^`xsg3O)|=iJRHGoEMHclDzE#*UN~!v_G=%wD1t!0CC(H@tt7OK
z{iZ|~yGIeB#LIiCBQKD~zxH6}`;X~W4+~BC%76vwC+_neA*1jy#<lM0ndKR)|0Jig
zhK=sm2!BCGlWz3}H);TmBD203<k#r$;l=O|y$QtMJnZ^>c2>setjgX%U%MtLCah<h
zKD!>b4xKz{4%2W@l8Dv|lwMXlMUIwA3<c7$;8+j&?G3+A<>*_9>=n4otFvU&GXE0q
zQ+X=r@uy#4pJ`ZymesCNbG<H*h1)?|uHESD%aC+0%K0~YZ{S#Wcw)fXCK81IS1OG?
zi6@rW)u+hnVCh_6d2iNt6A~#6e8ZA9O2+J2knu$UNt<NMg8`dggidyVLf@+fC#0kP
z6&6{JFK{HGy`EKGYEgJrgZKgHsN;&?LV~c8VGiLmUOUhsiaxCzQ1scJAI5FAd)BW1
z+_O#iK^e<S(L@OVRsF?!bH;S59D-hIvaU1%X;Vt~!>&V9eY-1XNhU?b&;zjzUI<L<
z641e!mty;%Vz3&Ur4$?d=OJl;H&<VEc>FLs1Z5-YCyqy{t;pUvz&5RzHrA#@#Gq`-
ztI}8WVM$5q4h;|ZRT1L{%M|%SHoy!SW%b|rZ$>YEMgjp5NBtPx@$UC98c~Kv!IL*Q
zs}-t0SG<Bek{|Af$cr%lg_67Dc9WAgFb^^wS*Yv&Wh+(B{5xd)su37*F<&FI`YF!K
zLy(=NPqpRsAH*zSVSmHMAt<a7z%`>cfvV*em*??Ki@$#m?wyZ1tOhoOYfFcKC2FQs
z^YP_N;{hE_prUmpdaNrPqAOnc<x#LRTi_k(4X9$_t6K4Gz1qeN<_+lgx)*MAiiJac
z78il1O*1$d{(Nu5jC8z8IeN&Y^gTxmgLD^UviSQsJd5f<XNEtc&8`Sd;rsiMeP!Fq
z$->{L&Nz3=VkaO!ph$Lo;w@Tw<bqMkof>p&vGR}K(GBF!)xoViW9f4j)$^NKK6@o>
z#7&Lu%`%izW?rz;^<Ev&R4?Tg$V^W;;gkPLd@0Arsm!Tvf3HoUl>0u;YowQX@f`V-
zTTkGe8c77TX0|7+%oel>^hzA!SMFT^G_5RY55oXWg%PjMLQ3qog;Daow>q<b155Yo
zL5C+z<ea~E-0fvHHP`o5uUba#Z-nL0)iDOF?JD*2EG5LA{k{q*#BAyzy2nMBUBj<J
z#+MQ{;E_5G&*;R}0|ckC3tn&D<j;=4_z(yGT!mkq)f-r}df~rT4g63r6y7RV+Lw9t
zko7m)tkvfH1ef1iM^N)05#)Q;d_X@*aA|xP879-aI8nc_=XP~Aq5t}qoEp6)XzyyU
z-<E)q59u>V&NQ#bd%tis_}$vy`@T<%u<#`nV|QD7!oqjrarf#{fqyVHh%u^rmH7`@
zVFt=K+Ni6()g9mmThBVE_g_dm+GWVL@0NWT*bddVy59UC)nSz(dD)UE<n+aVPX_bx
z<pFvENbh883bC8y+CuJRrCullG^7TQS*Sj%#<Do8hJJwa5Q0At(3Hj#`%{BvIQaE+
z8wgHSTO)jL-rH1dAu8nC4Y<Rt7r#7S7VSBaZhfqoEqvp#l#1bHt$RVMuHz1GJ4oN#
z-b}4A+n=k!d6}=c<U4#=EUJ8C3)+%xwFAMTWk=gS11(u@9Z7^t6S={J#k;2(Cp=w5
zIyL=Q(do@RJEdeste&#orFY;aT+4Vh0#%vR->3Z{Kz-w&vrCv|O7&_;V@fKq18in+
zv^<xdMOPyRNYCPnSs0LuaUK*4IEgHi7U(mJ>8Riga;DgHz;EtD5efcct%+ODsRThy
zHV?s2OEbOQ_y_>gFSvNA2{OK3cSJ1gb*(d}k`$}!x_q76BG~jTYw8GZs$MRlxm3ZY
zIcMzZSuv!5wBEP23R5t>xh>@+2j0^$t^<$Q^`59g7KOJtgi0>{@*304d8f?@&SSNy
zgTSNCuA7cDYG7deh<tFL>0Xd3Eu_ZwR8aEV$;Le{wIme~yuI~r!(vgeD>w0TW=8_O
z5VPh>YuWG)jWTc#`_>8D_2803zMCn<^Ji6e_uk}La<$I9c@^kv7(*9hSpOL!E_Ifw
zDBUo<$#^uzU9mtP+2u;=3EM??GCeODS7n3KG-4~I-E(>O5>Dp4u;{KSwNW$Yw{k`D
z?$wA@Q2$JYH=;lDEOP48sEuZ!$`?laZb8ih^k(eG=!8Y9fxhMNO{hxRD)2$a8sI0+
zYmo8~E<qJJOmpuKA8ez4rO4pbvzIyO=T<9*y8cvu0zC^MxF3~pdtV4}{=d~Uoy#i6
z^*t^khkrw_57i<{HJkg0&AdGM=%O%14Y&?(+4Go}1F0hZMh(?@NnXogpv@Y9!%r8(
z=$aOfRRRiqSDr5M8-EF+wIAYL$p&oGLpp)&-9{*Hj<|7!si^v=^`Y*I6J|S|AAt*m
z@+%|(v#IHN#YgQ);gOx#N!Mr%ARZ0@bSx&Cw}5!;jG?8PW$kib8ij$FQ0{SpF~;Vb
zr+Uk<^SWsG2>b&<&)qY_`<X(_c!M4-W_OYAf~#Kj7g@IdrqMKU{7uEI*kCOSdKAly
zAtUkLQWLKlv(MVi19LIIFR<}X^eBE}`c?11cJf$37!~?*;y@@HT2IIA_ib}FTWJyG
zDgFL<@LMH$M|nRVzVe#9bExf8VL6TdZp!ViZO@T;hn_n2P+zEDWGTngaT`62juO4-
zFeYe)u%pW5HWpKVNcE@|aPn5D(^#6N!=Fn&>{5(Li-;F2Uq9zq6K*evQ~~^Mon<L&
zc5(2=h;@(ORG}pyBI%}odsjjLu7RxCb$xNN3k>=m5tIC=uZ|Gf>rh0vt!BGW<n&Fk
z@7Lbj=5MGkyQa}bdOfoC0fy8umyOP!;KjswH|r?ivHK|!5kB)EVM8Qrh;n#B%=S3`
zr+#N`0)miUL_!|}y{uxd8C_1JWhz0sODpV|wZjzI7~TsEJy2Tm(o4t}bCA%jjJalO
zb+MYl@j_`6-s8A;heRVtc?+L7lB^glJvtl9q3_?}!M;b69nrx&Fx(YGtT;fG_3b6`
z<mqsQ`=pH`F{zr^_g0Z9x3Y_^7Mq&cOyIH^*rCPw?}5(Jic)YeMfk*Y_~sdkMx~`N
z0RTOPH6FIt2@D=^4xm^@+5}j;Y}Zl;J9NlkH&qiA(G{CJcO{<Sypm35nGeFSpzza9
zsWbj<wU|Vq6FVf(xHi4(;}9D7s1)pTOT+fy-Ao<r%ibc{OWABcvYZsQd?(X<f4Kwy
zOrO;cotP>tjP#Lew`?4{S7$RxlXLGjZm865VdCoAMrU=rws#xmB$f!DI8Y~ZQ>}D{
z{vJ5Pqqh3krcd6x2%dqxS-keBhL?@kT^n)5M8Xl_`1u^0ol*Qh!^YG@!tbRs4JDBV
zJ-&Mjl`pTReEbHk%!YnJqbizW3|6Ag$T6X1S4Upp3m1-A@#nUsuX;UX_IIA<ScJ46
zv)VDd2`r995*vBGigWulwb#ex8VTfTI7sUA+~|byufTPAZa~VDV*}gy4t{&&W^yg~
z9SXgy<Ji8m7Q#vdrXc7o$t5bs8pZ&^<iZNzE(+XWS^&%BPj@Eco%~Fr&6gJ@_<ME!
zL<T$~;Z=4!_`D{b{k<ViMaTIOOXswt1z)bK9mgXs@!kGh*mTfifDbGRSi`B>ygH<X
ztoVTFwA==MU=V!-hM4KRSU<x{tzS{}g!5~fVL>zhZMSP_*gAr4A2UT%BoA=yk3p3V
z8t<GGxCP=ukL<ct-nw$vZSs%vX*oVph*7f%H6)2^>BC{|jpLM#N>a}W08;pW)E*@f
zNuc*HDx1j|*|ADzU><d4xa_2E#0%ee^y;qtG8pUw&@hTE<aWmTkTw&52JQAs*UU4k
z&seX_J#L%im*VTP>l}h_n%Q`IOX%4`uNVpHK~~9MIc~Yn+m;(C2W(^smmr_*Hqqs%
zoS6dWoXqXG-AGyH%=h0=!|;nX%@tc?Qrvr&BDOYVKA~Q-PJN@u3hsA(-$qAc+wLB9
znPj;E_m{+<diaI0Y2~9DP&Ogr5gFnKo_7Oe$v4?^NQ7Y5&tbB?%AfW(V_%4V%*lPc
zjUFClyw+B+SQr7b#MmUxnQRYloYNI<laE+HatNjcobynv%Sq^L%xVI5=S#x!KVV#m
zkh<?OayCsp-*bfUKfz*f$b2k9^^c1Wa{jaa*WK{xg>=>Jn7aS4N`3jSlOnQq!(%EU
zP{pEbYW@-5^<h&1`3ruhh}DvIS4WI%9+!i|XFgeG+J5ntziG|DS6%TNN3HIr9DA;~
z|L%&vdt<*p&UtKFD!z#y4Q5Mf59@}`XI9XG81zg;iSj5(M|Howq)Wz7yHoZP^wAUg
zB6MZgq<$S4O<%Ob=sG*8FDbVdzY|YX`6(!CfBcDuZzs~-PHcE;g-v$Ta*|+uOgj2w
z+PHb*80Rpn;zjl&A{KlGAU#7elN5fK>JqAH36Wm*2(%@Wjp{+J`0hT7q3SthfC(vK
zd|lb?;1SIqxXz-b^7sXFC|v~q^n`_XUt#P+*T>yZeS!duJywv(-ykQV=$t$RktRKM
zJ%=o{k8XCvJupbNepdkj+DtJ|fQ|KGnhi!`qVjX;cR0>3^7L1DI!g3i0wrS0qo++p
z+0zmOqqTr4l(%guvsWHc0t0{<O<*Ic1vTEJaSU)%LB*ey0=4a77mKgTq9$#--v%tv
z`MY~PQn?UvZ#88)-0tWMG<fs3$g{yMct=b5nyt~;Hx+KUl<tAykXcS)a!8r;>AA&U
zo}$Mz*RaXzwM=civw5+nXezoE(fR21#W;@Fz4aamo%k{(viDnnq5_bLih10J3tC`r
zw=K=&XMIN6`W_2yPYh}zPFC{vOu0?nLKnb0Tw0no=MIF3Rz;7kRJ~#*hz_!q6v0=h
zLbaLufJXFyh0eEWUbWyJma}nhBT@T5GPt!y;U>;-%kPlx-YI0*M0&^Xgw3K3^b9tl
zbCP8lNh*GDdM-SUwi7i8qqe@j!^k#37;wFyeIU-rHVY*`vw9V2V)aI0mwgucv$(NQ
z?ZW~jypn+gZH%$RGih*WNjlV5_ok)C7zo*i8FVf7GeM5_gUh(560Sk~BFeTCn|xfj
zyGS<&xKV3$Hemfzth_!Re@*8B&;v8#WwG`<i{AMre@0%C_(i6L3t7`%ef1r#Ef1;N
zPD0d@1q_1T|B0B$U5B@g=?ju%fE)nQw=BUV4+HO56|Nog89%9Isgta!FI;=S{+eIO
zh$KiIlY;*Gh?0j9Tc+>K_dD46dh=tMG!DF#miG?1Djv6DwPzs{dm*Ps#Pmgnuo^?^
zkH!dQM#r4XMvl#|n`p*n(Y*mZI7K2MkVr6}(Ky<~;z|>0KK!9@V-VBmKc<XhoEEM9
z!TNV0(Up%<+!fGq2}O^Pnuv9~VjDMYMzz|2zWjUmDig-%8j>9c&Cp`Hg6toH#xEGp
zp~Bc*Bz)hD(9j}L<8blbti7^TcP6|brZOt6cGZ1rHDvEHrZRdjfl|#bzjhzt@+ZRo
zREFY`X|7u@LUCM49lMYcR^62R_c1c}M^^Pm&&_);Q8SwMknz{22v<B_h5(EQ8jY+)
zbjN`s*U4A^taG{x7T3}Z7-C-nM_})=s?OaH2`Xmu+s!@=?U}`6mR86+h}OTMW%X1?
ziCuKrMVmTbg;s_A#pPwcwc_e37ErxPZ{bQHz9+)tY@k5JUk_2pHvg+Mo8uj*vx%*y
zomCXIR8T6Tj3%-FZKr(beX@bYZ#^)=Hj?vvAabiLJ=Oqc<<<UkD-Cgpm{xDT0B2X9
z#CULqPf~apm*g(G{z+Yn-^Y4CZuR^d0g_XBjZ<o$-ZABiF{lUoD6}qZ;E;U?fx-=<
zA%L8_><FcGEn3<R-9?j@&QBR9Wu@Xrxim=lqOUQD4+gXGMbs~lE==qXjT+%u+s{LN
zU<Ws{kPFX^IBX?VlVR>f>KWr)wbKwtR+)E)cZ;zViIUMfu=%vo=f{EXoKXfc+?bQx
z3}=;*Jod{-I)@u2n({FTsOO8&qlk$HG}p--kdyWgiH>1nj}L8sf7UXseRPW;81aS%
zGKhJnli)Hb=x!r&7VSxFSSXTbOL-SVs%wY+--_8Sl_a5H*=2H5A$y)z6wK5JeWWhr
z|ELy&{aD9|F-*$(lBx|=XQaG8Z|SF<F;mtrmc7ezELeDq<z#uTd&JOmgUM$+OtAb%
z0NqTY3EitFMTNZxz&6jNrLNI(WLnb}!HEtC^mX(8yfOA9Yb#I73n4wtnsNe-&F|QH
zOa!8n&!fJO6R^@griCP;-y|2e_*P_!!K|dA(b*X5oqFjN@#zf?pS5>W<3=UcOg?Bk
z%x*)~-i4FMQiS{YvM~o71R=Y5BuO0$8wa0l9Th9#Z6<_~)tUX=h^^D5L-$bxANU@9
z88yIocTS7--bw0e+rn0$Fyq%i^Ie-w+;UM^wU60j9AF1Iflfk(Uo**W#NVWvPO(Xv
zMh>0~PoF%O^lc}JQqosjMmhfea~7s3Hz9%K@(fWYeU_wd!N^&q&<{`itv;{+3{LQu
zB%jw~S}T`1ksA>{F#Vur7rR&ZbH}mSDEga<e(^qhd~O+^e+V5V($s^$tRFA=`;CAj
zf2s7I#x0PJ!ij-BW;cl_%#otx@f_C*|8r=#{Fn48&$~zQK*V4_@;lq=Q2)<U(*?&j
z2HGlM<*R!I=I3DVVVlid5HtLxaqhW5Lt`5S{H0r1udsxTc`JXZyM`@JE^b9nu*sOk
z-)>~%SYr-Iw7FYR%<KGCk}7FqntxIg9N~KK=fJXv!dC2zohM^hxhq^N#Me>0(;aXD
z|E{xE$5l-dbl%AJYD^ZSh$4SUYlk~#a34W}h8d_afSCBWhh1AvwYR@H)6AJ?kN_sT
zqgkXkNKb0@<{0PfWQ3E44fe_IFV~&f)l2_K$A6zb%5w*rwtfwx=5KGnm>%Xm75Zdj
zc51j;S?Zf)d{RtuE+e~!IYw8tgy6o+JJZafztlg`#nZgldXRfZ$g(ia@5e%zioEv)
z)OQH{&!6tezq%3oXyp`{%v;)IbN9BJfga5aTEScX?Fq&oWCX;uH}wiGe_oz%Mky+M
zycg*F%i#)cx6fj+**Y6QuzQvE8WdaV1w6U)OR~;3NjqxGg&j34HA*s&+X-vMW!mlB
zOgn6<oiU)@fOc%;C7<5=R*O$&kKR)=-W&Rcy-fy(C#$!kbf0VFdt||uf)v(~s+2L1
zW_B%^n{Nzs4X2bRd$g0cd|68(*YKq$Xccx<2knH>{HaDd%(8jpjy3Y@Ez_pLL@c}b
zwL>*LLfyoD&3>1!CPmDwFvL6j?JU=qDh`&xv|LlOT~E@1UW=RfE5>+$KB+u??&VT*
z3Fy{NzDNp>t2>LGWLr%8`n9lwL4xnTttzT2ZfA5}3l?|(MYJEQ%7G(ZcG@Lzl{Af}
zixrz<Ca-Q}Z?|L(_A^wPZYAXQMpFU`6+t}eNwljEYYG0g`_GhnWBqN1%eEgW?I_p`
zrJTgi5dF0FzSzEmcB0hUhr?C|ONx2=%^JbZZt;3|^VO!2zmP_(+UN0a#X_FbFg|I8
zc4)2I{`cwVBw<x_8qIhb=3^6ZKqnILc7r$dgy#2*;@4lG({rX6hATnmI8?(TDC4#<
z!=txoh(>IdM?d=t`m!%kOgko<eTscx488_LUD~(|0AFLT0D1${qMB~e1md}m1t}Yp
z7{W*lKEP2&v`$gNMkK%@TCkNjnI`*I|DSdrXK&Fa^rF=jmgv=pRlXSTmgD5@8qW`e
z!;|unV*ikfQz&H&Ir3Qh)H_uk<m1J0ICiwt_WwZ*m~@XLX|JGx-WsJZNV9Wk1>f2k
zk_y1iGh1%lWq;*A$EhBu%4E1KwhPsJZNlFuStytH(*bjipJ6`3U(Rb7#F}z1qA#Av
zHtG+ZKeJmz1Y2g5sQtN|V}7~Sn=(C%9Uiu^_o@o?c<<J-RsVzkXv8mo6TD0I1A`ZS
zSI@IZr+B--wMV?!q*IKlFtM($eVr{QH|<^8rvrou-sWMM#_YgUffq>pqR)mk33)H1
z{c_S%v@Y|0aaezrUN4azvVz%zRHQuW;yW>FXEU+nWYO1g*BtIJP!Hbrn7BQxx?r{K
z0sK+`DhdJb>+;k@#a<Uos(mUgM*N7#38wd5qc!?T7A)~?Q@nm0qT?sFTE+=qd`oHG
z*U$@WU-e!LY~v(cP6B!Ok(DJ}=Wmi#2tuxQ(JPTTgg|iJm49ZHY8|l)jURvo|BIz2
z_g-EulQHtkL$CFjVVB_Ab*_2LCw_|=jUOQ>T`}@&(xS4Lx=>J42Z58cIF-Io_~2+E
z^||;n^3(3}o1QD?`&07r--edV@3+UeZK4~vugfM&#wZ<Hr6(UnC+t08O23zn<4oHb
zUGn^c7h7G|!|sk8RbC=n<P5*?g=C#*YH)v<I{F5gkv@wLL9NLqKf;}l>DF8*nf5W1
z?Yd!S^cBbH9c<g}@pGIbG%y&|lRE$65$<;O>m0~7;rgCSLWpg|w1Ia8nLn@aBQk`P
z+{&M4Xr;l}(MaH3f2Tk?zsnuw&38Ih0uj&}Urv#h85@#jnJd!N!r}GuzhX3}p=>rv
zhTNX*vP{RhA*itAY-Q2~f$Y3_Zz{Su64uXk%{r!{?cCWLWyzxVQhaFj`jK=&x?uU^
z>Y^!RCJk%ozhPotbkpG(Vsc(JU-a9pzz=!pAAYZIXGNF;BUYq<phu6lD(RJFhQ2CE
zW+5UGvztPigd$@oew$+@T89S`v9m%t!YBSAyenT)DziKa-+o9*CZShuRi&3;6xv=s
zw`B5j77AjXH*A4hZu2C1_k|s0e;tF_&Z#9527sQqP#njq)WlUb6J|Ag<H|qmCoa>i
zr;jZCMvN_;^7gEx5WKM`I;y0SR{s8*f*uBtL9Me~-;7v?UVmrm*+YdLrMY2cKcOvj
z<K)w=ZzfjX?|K7pmY-XfgA^BKjgb{02c`#w_YuL$$r3>vf*#L~<$Dhzai(%e@@o(P
zSNW|<8WB_gGDan(c~u0<e<t`9V`&WM1(r<|ri9_n5rx&LH!zNus<yty_5pOv?i@hw
zslk;HnF|k5uQZ1NjKxmw5;lfpGsq<KuKSvBSA{(4k+5aCZtOCQnpmu$T+a{SGPE$Z
z$y%pJAF7fB&w;Yt#S~C17;ym*NG-{oG9%>eMP5qN8-AU8Hh}R;Ap9lmY;`(V3O9k^
zjhdVk*&S)hf1qp3Q#RQ??L&U5Y}Q=h9rd4kK7!3s>C5%~WD(Uc;LUp{0UYe4#iVzk
zExrRsmt(DDTIzP801HcNTm@C=7-NX<8hTt$fL&d=wOu@?{%@#feLITgFjj{9EB>TY
zjPCtIN8AM^It4{km~QRBV(F8YM`-cb(kBA39f8FPO`?;-++n)6M;4kH-Tvl*H{wxE
zjMbyJ{8Y;D|0_Uz{vU=gUe@vw3d--okv{FO=bG(H6?VVL_Cn3(B7lr-cka;O#V@oQ
zx4QvU1?VmDYog&FdWrD=LY)`f+dc*%^z(fX9KeBr-kWxKRXpOQ=Bdxj;M@Cb&w6(J
z))RpegP8buY_JVodvts1_T<*}p9ccHD-m2v7yJjDcK$@aHxKv|Epm(w!R+>`jnJTS
z#bB<)s9tueaxKsOj)@~A9V$2DGHL5!so@5Jb+c{ITyDScb(EH*gwd8!^s%f}O{c2u
ze&M52$7E;|<h5%y@Ay|e?9Yu!RKTPCA7vkvYq~W9`;1GHw0WWPoYmM)i_=iEYe!Hc
z%e8LF3(JLo&`gB#wYRFRkmF>`#3pE3RfM;#Gd1%r+Zb<(;9WLTo{ElBPeCRdPQ5Kr
z8^c|~fC~Igw-(Y~_jD{w)=xW<rvga&@ox)meQW+iV)y9Z)mr+QLisw;@4bOeoiN5a
z;0$yI2JGm7f{(#6YMW;NlxtjC&hgK6Z|UcXUv59JL6|_#@OhW!1DLDn@ssN$Gdsgu
z6SO}5_<(M>v$_0;`pgDP`O{4FD~~GLERIoYz1Srbi;tmgv|a27HkDu>&ZQ_wEs6<J
zpFssI8*zxAEH9!Vua60+CQU=kc43^M0X2RQ)z`6U*~!%R#^rko<{XbHbL`v=>3g<t
zGxF;lFdY#&_EB9s1haYURlpH|x8Gkl&t_7*2&+tjM^qRd7Mm_C<12hh>R^`gM@Tql
zuV+LD6odK%clIq&d1g6fRLrYAN=RN+blTokjMmQNg+Y?FEh-K>wS8}S|AiXHwz<0a
z*3BD)zMMPgx$0V_`ss#C?X-}%e8_dM3!$#VO`&J3s_90?K5cTfZ4)FKn6m3|hL31d
z<3ZK7!6W20<}<)vIt}FP%20L0`wY&2uig*689L(+?!DrQQquKMZ~evwZyfxabzdE5
z4ptTrr0kIg{zco3MIBQaboc|~r4ZRU2{33zD2dGztsQHi{(DXc#}G@>oC!qVpL>9a
z+!G%xQ2BA=B<u+;N)@8waR8E&M6(_rL4Vk7#ytTD>nnKNT$<J%`Pm&_okX*=2>+b2
zyH%eQPN!f<am;G8$lu8)C2s`F0}{^HWxz?^GB($?;^~3XcAuSi=5!^xcKDLGPd$~%
z@reY>6rBq0oRe78-iHFh`Y~-m=41V1+K0eROpNlsw(^d@w=_by^>LR(AJs3L%yC*B
z#oZW1&EpXF^DBO+GdS(6+Vlyl?#Tk$$XPvg`8(RI@{C!pzFC^3(ur?h)9t}-b=0aF
z>4BbAP%r_LAA?wT#(s`^PhnlQ8_h}I0F}?ph~R&t=B7uh9%s?Rc^%Kpn8PeT>>tZS
zS8qL#JcjuF0W%qm@Xbk(YE;PRztVE};W24EwDGRd1d2B|TyWH9VcXZ%LGSAgwao$~
zxEmOZxBvM*D13D2WoCYTPP!@#W+^W0ZdUZ7SjF9}0cWwPes?P#&i1CCXkeUjX#wrj
zPrNT(eTMfpv=Wr#UZUR{rh2cMa$#i^t$q_JuvaoDHCf)N#9?lSH_hV(O1S~@f&w=b
zTff|W+HUOjdDRpVS~h=k6umxu6TauIz<;AI8FVbrXz*ggyFi8wto&5{SRm|#SJ?Bj
zv0BPILhY5-<Xl_AK!cCh=U3eB*&%5&ZcIGBgSTU<+ur{xQWc+@5H9ifrn=&8^UH5%
z{fo&4y6Bpyhg&@Vs7F6zEm$57S~NWUU4|A4w1f`-Y~v7<A<V_G`>brh9W1;0z16TY
z=bah@Bm>g$MQIsr^6r&0C{O#I3DvA_wVt6HOb9WUzS-0q_;+dc+&<+3qBg$DLL;qq
z8pR@21eA^E)+F5p-67D%(7LN4SEWXhM1H3_JjT85He&G{c37D1`$qi4e`ocY;(oDe
zZrFj^-#m1q>wKT@!Ul_^D$ypna$9|<ncRLn_GOQzC^&S_%2A*~`dm@4(G;WP|KaJp
z<C1#+_g|JH7x^~#%FHbH-lMd%GPUJaaGR2o9EhWGWv<NJsHK&a1I=&?Zg6X<xF?Fa
zKv8k~JAEF%$M>)EIw){Z&N=t}y07bbNn*1?j5tpvp7=a-JOziQes@p*-mRJy;wFA7
ztNDw9eA1NV4!+5F3jWXi4GrDHvOGJ}szrXkSN0ns&|nnJbM&-kI)#%2K&1HVbGwDt
z@k7IEI{c);Ea6TA!{iS5cD-<-AV+TI)&I1pD_Jw<sd2}m6-p73E@L7#z7VMjCDcjQ
zsK~gt78L?0%ouJ0nPO5L&-T}_nOB|qA6|`Ru?x9#!D5_NDn8@K_Jd6%qtA~mTF>uO
z-h$ivNoHrExG?jF{WoA?PQG&FY%c19p;}#qOY?<IBNBBMIb%5nqPon|2qk*9zQTqT
zz))1ULy*n<NV(g=Mal~g)^>g!SW2`q{5_=9K(|?96H%(X!-{%YDY)=Rr&VfJnr9C@
zRhAaCR+Jh}EHl?W^cYTluvoltkOEng=qSu3mli$XQgP`HyN2PC2k~i_yVdsZ>dA1D
z#rDv>BMK9tFBA9`=Qxhhsx(u-AbMoJ;TmKFQe0C{*9SVOSGy*g<sQKry?4F5Qm>AC
z>HG+r+|3W0nQ9GZ2HU7~brya=u^r1Zfc6E|jtWiHQSPo4ccAWIriB;oVeVT6C%`a0
z3+-ck4x+%dZ~MN$op>5HQ=3muGloHK0H>*{pL1=-d6-&H=`C!lV}TvaKl0y{{UEF;
zEN&asEiC?MnSlB5;LwLL+ZT0jI={jj7y9W!b&uZ-2rWEOMn6Liny8T(HoAHyhx4Px
z;l=3i^#r%u>57?QzIjkA8AcdC$_#tSX_csDL`93~YMf3m07O^w<j}2&BT#;5qRP(n
z8)x0x$ihK`@Ta?vbn~{VnVm)c68g3_KVZ$vlO2&b*I6H~wZa+~(=ex6nlRW4ouSiE
zFbgRTWz%lx0a_)(V4wZ15vINyoqRu#MthLd&2<NiMVPMkS~b%;D<4_%*rs9LHp(M;
zz=<!@E(9M3w5wg>Ebgn1-VVVpzZbW;Au5~@X|hakyOr})J2O@t)S>H%;g+_HUVI7(
zC>Nxn&8<v#%sn?e7Fm#m2a+nZOX;?!)xar!_TMRf4*TKVm6lVzDi29j$>#yIv$qFE
zzE)_=py;Q53=ik0W(HiJ2@PB5zt^K#_xA+pyY-H<lASUs5z(i!AdS=}#<;UL<|cc-
zSV2qSynZ~It%**JZTP;)fs+vo@p?(tg2FOyFpbA4VFQ0J&7PGInEt?@WvLsYQ91bx
z)@8Ha#jIN_Gg^#i4o9WU^v9PtY&LK=rkBhXkruaaIE>uVJ+oA7zbqjbvi?CYYTq+9
z*$giNK(*rcJsG7k_YL&j9@gLhAV|JSLBGPGdEtPw=JvQ(BC*z3B}q3{xLT7}z<qpM
zVnTm_OOOVI{><kkD~C+Jy>WQIK_vFXD%cD+YIfayCZi-~R>#8a%G0?ZP@`%vV{#S~
zS6->XsO1<@_i1odaI!gk+5n}ao_`ZG;9ETwwI7uc&4MU<*ugBxquNm3f0nG!2@yKQ
z@wi*QJO_MHF>R`E_D+*?<Hkdp{MtdvWuEEJy?DxotQf$bgHyQ#W5U*70*r$9Ed<q0
zX7FNhK51>&JI^_(F|Bt=V=*Gh)~aVoL)>CXgL`CJQfTD*q@+%H=wmUZn`nM#|Kb<u
zj>*O6I*J#yw~?jg*TWcI8|7D~MNKzryTtN%#LJ#*jy|peQeHk4%YbGCx6az_iOivd
zC;?ZbDd_4@dnUQP7R*SBfwkhH*mmZ<ZyYD%oXsz1)mqRj7f-zQpw;KG=K6^>g~BcD
zGm5Z6&zyc@4dDev+_ztw*fo7C(RO+N0i(sO#Ol~~POSMZdo;?l$l);ecrHtg!wxPx
z9ndP9s>Xpl@mj3?*8gf_@bAo5ti^J2mS*(0r!cE#<~c}kviR}R>g|F3*H~`gc!;a5
zW3@n6kxt=-xGrPVF^`m_uc6&T6P|MUxJz%Elk<QWk2`s}obmN{=M@(eHjq}6cUG9C
zC8|6+!+AWeM}2RazVlWXV0p81!%rL;)k;J2<jNyE_a)r}DLbKadTyFjE3Mv>A`2a=
zRXts|b0YA&Fnje&W$+RcD28@WDwGI<$o{u$(NnF;_=j(<y!v;g%We1Df8K^bZqY14
z(phskvc_y(;eS_|I>gjueYGPuYjy+V`xOL|p%A0mEvpBy;FemW#ftxgLQGg_(8#$8
z&)B@Zrr?qo+z+7;`&Ww<h7jaj8wP&KEw>Q9o@3<ebR!uL<ym@u^2b>jZsb2((RF8f
zP6cJc4!x!Tk9EhO=}#5fi9*7N==%-D*#uc(QjMW%D?<9P<{hY1_`9DDLiblliAY!9
z<yau0@-^g#A5-V4p2g=6*0*f}V5=U{g_i`^gz`Zv1`5Ma(8wLkeG|=G_lR%aK*gp9
z-~CI}7=p@0-~7ZHot$35^B6T119_^Xrfc`3IL3!an->*PQyuv-+c&vvGtt#CPH_b@
z%L)`jhXpEEjT6`_i=pdSXJnSWMS@qNpIe|#!luCKN#Ad^J(~Tho%`$q9qRmyfReA`
zHDN{Y=K@46qx5kCr|B%EsQr~s8NCiQMo;D&L3nS;W<UwzI705Ldw(jXL*;TiE(>cJ
zg(+h#^6pHfGKM~ARpZ$rtmK6v(HXD13pQ-D6q0P<&1xBS5<z`7E9iNYp?Shzs%1Sl
zX6pwpY!T%KHBDHfWuKjD^EXd8ojKf^uTR%4wp>|zh{=wzkT=kGkKHm?zZ+v#)MVhz
ziC|-YJUr&dZ&RzddMM|AW;ixMm!`P+uJf!i*-~l#w>1w<qY&gKAiV+vu{g8>qi-->
zrT)RG^Td!-;n(p79f#g$uRr^(an8*?TXtxIm;P$Cjc~~|_X{T^>V17-@!JN(DD|`N
zz75o)sxI=*@o^q{#FocsAp*N6T13^nctm|K;?INIBR5DMjtdhSAIM7;dv&M<4Fyhh
zYjenRtTjH64#!gkwzv;=@zuMCq-GZ5L-fKqoct0RNPS?z4QRRe3C1}u3mv40(MpLD
zHXSCX&n5w8>iU}F$VrM)XkqNDqjwo6DPv}9j>r>^E|mFkK<gl-#AhIUoeh_}lYy%c
zPdXHi@c+zSJNx7Gb?Eihf$3Y}cypCA0r-HUkEe7`Ne^S~b^^;8<lSP<P`gOS=2}!O
z<^Unz4PZR1<^DUmj=ksb#60`Oxp>_xLjewbpFvSDo=J6-#e0a6jD}p(=Fc-UXhtag
z5<R}V1#kK6orofpZkoxgudJ!#)y0_7^QIfGj(H9<Y}TGoC9-5MwtutxmO9!FX`U_o
zbUc2~EO5W#KWF}W?>EvU@q~L**U1e($OezqR^E#gN2ibl{e{Lfuw7b1vu*Q7VWcBT
z@<TDgAZs|?8X?IPd&Xag4G9U@P(4JS66r&pAm9}cE$<oRzCHMcuKRytI+5Npf(vV3
zVx`R%t|k1Ag2@|x7aDR4zC(dB9-<2?iz>?=YqexzjUG$*Qi=8<$+f5PF`u&d9k3Qa
zP3nxy{_eP}!$5@8L&vq~0;6baxsU$%>yiQ{oOiZt^5IjvRv_woVSi?4(t}y`QD=G@
z^w!K$v87B~Ez$~!TQg_zlZ6-YVlV7KzelU{>?kbUWZ9In;7+(G7xX4Y`|ETxm-7RX
zeekiibLbuQCiN~;zH-d?jmRTtMP5*s6F>6$5NgqMOz!{4<B6Y@7XjYI=a#I*3t6Ds
zLgk<1oCQqB5*%Pawjq3xrQW4WgB_(^_ks>5PI{vSF~!6}ijiU)p%un%$JNbHv&nru
z4cuYk`ZW@=hB{I^qP1~Ui4<!{7uFcukcI1M1VJd{=TS0nJ(=KmjR2;GD&p}A0Ic2u
z7D+sH#%?NU_r7D(YfT85>Uk%!&*wJepCu}xK2yo(kH@AX*z0(kk9A{V{T$%#aP|`q
zrIr$*4$Qrmggzz~j`=s`SffJA>-)B^f*y*b+KnQuWlqqM2bshc28I#j0TVcf&0bNy
zJO=V-X<MFthFQqIZwDSTE)+Puu!|_u(HG=6f?YtRRXtEt`&513y-H`a-+GQA(38;$
z7;uKM1;^Nj@gHg|*L+dJokw{&oZU+8sH|v2l8r;~v&m962f=z_nm(kl%A%JiJkw@M
zExNP-C!md01aRFy5P@@lK<bswg*l*ik=(+0Z`|7NteMkgPjP8;$+nVNH$7K*Nbz%p
zBeIW%t0@+ILaRpp+&G+Zzl*Z>?;4<U5-XBE*SLEzVkSCyzABOAgxOtgG4h+x&X@yT
z+!IyXNKMT;{x08FSRwJ5a39LtC<enOjeOo8AJED>3NnKFt3TSd*>W_D&IFe9&sD2H
zq)r93>xn5-NFT?H{MQHVaH6f1VCnbOAa)YRDe{V3*g}%`i>1<8%ZZ`Sh3_?T7_iyP
z=){K9`%BMTP)nz9iL7OGT95Tswk}u4bE@mmTb@|fz#&x~F==)UW8Dhpr!_D<d!UPG
zHGFH3CAOqt23U6ngkyWbroH7|&_B&MAi~BNxO;CO4Cfu&Q2eSP6b;hm5Zy?C@`fmB
z2>OM-WHmUAP3AHbj#@AW+q^_4p-)D%0%?*V>x7`m-&#L^k|#u5NlyQUpo3}If>&Kn
z+ifn8gzk6-*f;%5xu8JvJA4)7qT;=F-5N;Ljuj5#6vsUBoDO=Oai_>~EOjvXs+@1J
zDe9+0;lih)S&@V$sK_)eUKp+@l`z|P6%Z5YY`IwQPSYmdlj!vrF@km{O8UdRNX}Vw
zSxUq7xw(aW{$^-r@s-e#%*A${*m@-N(rL-1$;I>F`cy*S#_SEi<_D&{+r;O+E;I(q
z>@kW_#(~EK1UYuwBq;*#H*GZJmW=k{;&2lu1wGm0UA|9F^fO*Z??~BPlKK!1Nef@@
z0+f((<><icY6E2SE4N30Kw(;BUfQJyTtJ_(gO1Oz;5c~u(8_H9GK*e1_i|1kB4O{$
z`wd=<ABIKbax>-2dJ@%s@65c=eP3N`h;alP0iTzjz70IJEJa5z@nq#u;>KYvjRPDD
zolMOO4yQHzEt1n;fr|+R>1Dp9U`dJ0s4%}khE9$sdDf%fuN}34SOUe^PxX?u*K5~1
z(cMmtV$!)xkxbOv!4b~o;APQ;WbF;5*wfG}BB_&xpnc5d`Su{_%6Hm5Oa}Q9-biOh
zx91z9Pa!iVaMsV-)=ov_T#qBBs;b6Qx4?sM*@*BTxz|WpM$T7dK<4@}G%LtQS!QBd
zCv&Dud|FA$iQLzKSa)gs24gS7a4f}9fZThdeH(>X;o4!CnLHzAx4>xQOGb4_LGySk
zVfS~pKu<I0FS?V8ZPamC#%`NP1Q3Hxf@Vdmshk94SWwW7$UBc&26Z@wG$`mwJA|(}
zSb2;_L3_za$ko{&p0NZp-?FpQL&YQhT4RvOnF)~0M#=V{dk3O><KRi_zeUb^mwMh_
z3iVnoqP7doFi5<%PN|!uAtzR}t#}v?AoKtMUi+OvfS)&`CJ5Le$&3j&<}vw{oWaV@
zkcRq|*1vPXX_*d5Cup^UGf1I7wCK*P-H#(`fWYhDU|~S&EJq<gjJ5Ef^gR2Lb-dpF
zmd{x<t`~2ag%}F`q}<l`k0AWSZl_}~o<%SEn_3dgt^-IKl}a)nU&;<tR~=UP%Qrt^
zy;-39o|6aWaZgwlsS%g==~FlB4phqBw1q{Xd!}s^k_dmGEY0WTaNS+;AoLYx*RfHT
zNnmxyhEObaR0-aOW-YL6<M&V<)<~UO;d&lUSx>IFDE7tOgV+u*FiWW(Sw@DJ&c8is
z8+>C-CM-!L5sT*>(inkF1x{gP+_`h_GMAfh$#~%b+FZ$Y-vaU6)a2HIjhpaO#Pgv`
z?9NM~6a#Lf`8xJhog}ZsVzE%z_I!&TsRpL4@AE<3YHucgaz7?%{-7<lf50ww8YM*g
zmGqE7AE$^h`U}O?gM>b@MkTo(72Shq`3dd}f5fc#C8(4omHQtF5ppUkn=61wOG;Xo
z*)ZS(^+_F0?r^L86Z9(Xr2@X`A_aXbY{%QVp!oVED*gmnO!hnKER;-YsqZ?mnOEls
z6>WIqyh!6RnpwykycFR_2JNk<V$FBhS?b;bJnS{Czr$K<l!+Eh>TOW1-1<b^EWnvj
zISZXSG!44~Iyj5Z(#K0|QLx7<m4?HR&QO_?Y^Iq#mgyhO6$Ozl7NIuGRz%wJ<t(mz
z2At&bWpOIH!|o+WedJcY{&muPqdQJ~M^0`dh{;B~Gqkjj%Wjg~1Sz~ha>^Igl4U&M
zPlR32lI6ryZIYiY>s&kibn!&UI#gyyZX0{8^)z05QVy~F#pFDM>F0^1&6?_TKqp{a
z`l*m#=kg^Yf>;d8t>3j73;rYi<QL&TOjSs1BwxDQ!X2`&&5r0FGSrzYlw|zP%Y73q
zMayNvT)c+*xCfm=P<NNnvI6x3{U6kHh*U>06->nO&KzK{2aIHwgTI{VW&ysj2b&J*
z=~d&~blg?Qmus5`Ud4jCj~6DaR`Es$==KncGM$1jEjk^kTFC0S*m!koh(+_n?GXd8
z=9NGC_S{QT97lyvy)nlZrE2W8;uR4>bt3|?&jZz$bHAN5iBe^66Ex?;(7lA86R!_`
zXa<cNz2_wA?3j<%-xI-%)nDFS7Hyq2VF|E)1Eh9gM(P_JOV^zP%MP?4%dk74pOy*Z
zxcbv%xl2?u>OLxTc(PmGnA=z0DMIGp!N0fvS~@EX(2(Vg4W|k1X3B{~J716K!VNyN
z6@TU$8*9**Qr^(w(=tX)Z_n@<s!saqWN&Iip=)lFxdEnEbOI+;VV)H1r3+rT*H9As
zTm<FUCPl3fs=XiHJC>_%IR-HfH(>!t(Oq&oWU7H}nddJ?szCu{qSrdhU_%~s)?NGn
zU9CZ6r#kelB%iiP0AsTSz--ebS0Spr2E;!7=ITfr)v6VFbNALzyt6HOwv<5$lwJ8-
z&|ky-H4VuVULeX^PE+Wv0WM#*Oy}0Zj!G$c#!B1rfYep1-rM|*z2nZaHL=ijdevHQ
zH_I0@TBGMNyDc!v0w$J}lTj%<C%Du(w|^}!a!Lc@EV%miTcMGUJq7*9C>f9?y%;e!
zN={WPjti<L6fVI40r8BGn)*2Y-QB;?W*V8fLQ1-9a<7pX+u*nT<6?bF9gJ0w4KmS8
zOy(1}DBY7QJpW+B#ryM~jq8V(o!IW{of%uD9~AmRljNT$Z3qG!zL0|f7v=r){HGqv
zQ0T1dAd!;^>qTMyeq<9y)!AO&)4qBzUL<UAU{j1cT;|A+^+80Ta$SOlXG`YC()zT%
zZlfbB-@02$R*wxlx*F;=H<soSyfa_IpJ#soGBF^g_BVxw)R$v4`-t-TEk@ReP9poF
z^tSQ90w;?%z>&U<x>TOn351*6U&oAjR}FvWxp`J$R$k;(kR_~7>{J&o#J=+-A#fxw
z%#3YdPXyu7$f^x=VNP(@4CMH=`A=|9g%$Zi24^eKmWkQlck&{Qn0rIJ2*gPb3i_N^
z$ZxgsG?m#S+h)SGuyeN7=brrm8AxPP(45+)FOuo8jY8V<s9Xv&P^HDs9Z3NphvCFh
zJJ#T6jy}QFoig*Xev<BYt)O)<s#bSKtOv&wSZ3zEeyC5oE+@{bsQvf?1o0B5UUo3N
zILi^?C1`oPQgBT#QTWIA6ZA5STV-EkW7(23!fQD!Ed-q&(#A)UJQ+VTfgTbwb=H{q
zqD}9q(TIACVkg-}qqt(0;$~KaV<?0lxW^C$mmRD7i=tAtG1a0wR&Uo!!mt_=Ct60+
zuq6>#4{&t-Go(G0*E%@OHrqM2&>v?9&hzt~(nAhE-1|9jz92t1<K9*?060|#x-{GO
z&notApYTA@Ed8Hvr~Sc(TRY$XFAA5(WlRzbq5GSksd(>qvnP+>f>F{IUx#H<&MPj6
zhIh5P=ggm?kCSNzR=rKX5A%F*%^Ehe2Qk-#meHq7^ii4@H7$6pkgx#}7XISU5|8EN
zTf+V+xHBTqf{L%7Dj4ASt(9y1&@N|(J*&c@FS2fTk?NWO3fQVDmZWVjfiYG9@d^9v
zQ@<#av~ZF)U0;`iy`P7Gg^=kQ1H~eCcxlm73Wq^?<tt7z$tQ714;l4I%R_gBw<rYe
z5H2&p+|$k45<-u{MhQ>IdXIuGp?l#CSU^-HQ(duoY0hDISgwl|RglG0AK4zpuGH|>
z?FwGbvxma`7Y(&1Lk>&p<}1sRD8}{;<YX2R=n7mJ<3SW9^-VV2a86(IF60p#faX6*
zml~S_^|EP`5C5sa1x5b_OWeAd3Ak*I9jG6wK5#U?bpO!lmgstqhCb+Tcxe``D%l1<
zJKj)qMsDT7dBu;2k6{->*S+)k6+dd(q=-|#bA)=OoShncD?L)Tb6$*!=zq6fXuD^`
zsPyO)Dz~BDXk^A*ba!K9388l|yu~`ETc@*ZIY{7N7&+8a_*pb?c&@|M#4{Jfn-LHZ
zoq~YqB6cmigRZC}R-t40*Zs>-d^_e+dtMWuEaYmjz5tgl`ZaZYVn(>56gf8fU%~|0
zI#x*l0_W`x$4eX-`FDM_HYx`c-{U(qaM)-T$^m?RZ~SksqdR70IL8^2o(ta~RI5oW
zXU#%0?#(zR6!vS__+v9kB^~Mq$kv0Tn{twS<4(K5Rx^VM3VSmn2Or77BpER(dRc3u
z!S%ne*k3xq-8HB88(gpMUNZgV{o1HQ?S5xaDSq>kwql;WzSx(znUi_oZpIr0;9|a%
znq2+|gEGjM=(twNa+~)oTcA?}>P~*7yXDU(=~@Scz~$v$zS1bmMbMcJ`I=unnlmW1
zgtKNFQ>c?BUJCJsa8q+lGpRgTJ8LkvXPPY%_uwzOXW2ARghA=U`gZg(I&~_xnbp;2
zi(eiy_#3(dDNg9_63C1Eer)4vm#%&Cw@}ENsWDJ4c&l@oJRfrf>8>B*^;f7MqYw)+
z$muqjLG+E=5V(TrV_UmBL2%c05w4COzC-?bak}JIJEs@Bj{XrxP3nXD(h0wz##)3;
z5yM4-MJ{@#BBMbXX+teJ76zW+0L9+WBfig|Z<ss~VU|GMSd1-szH)_>tt-(|E4zn$
zEVCt&X0nb%FQY*RNCyTF=&&LXay>2qV}5d?5iFUeQ1ougAU(n~m8WUaS*tPb=v_|3
znI&O?Q>5>n{<e+d?N)63qeHaID8%7*Ys8~K219lLAhWh8RnEpV6ye<2unF!UM)a{g
zlcu{}^#XB<lZ+q*8wS4<J053GJwMZwCw~t~zP3V`7Z~LP3|bR&lBzq<f0aO)Q@~O6
z#Jgm7S(~Z6ZAv0MRkfpFc>Nv-GG02b%|i=Q1YKUY7$iSiLmZ&*&~!9~+_+{U&>dlB
zSZ;>2%&YF_b8Zc{8I)y<a|XFaG+p($F~g|LCwgkM&D?hg@Qxpm1u0hoT{ICYJnX?7
zT8aoDEJ<zi-CQd9uv#$JD$E+yFNiDL;fMGO(smSKF6`DSZeJK~20c#XSNe=99XhjY
zDyj0d)txyQ-?P=vgyV9|!#TFKkR&Kl{g|J533)G`Z*8tgt$KV6P}-iT7*5+!rbuOw
zVwywVmdZ?O!Qs%n&bev&V;eZU_36Rvv<7(kQ}}xO(`*iJ@O1AOWVuu_kBJbv?J{?a
z(c@QvHyOC;+Gu0`-iG-%CFk?FlLCRM+qvd+igDYqT89x{IFcUeaWl2oNHP7zYCalI
z5bn}F4<AHKQ8w>b>%6*Am=eGeioYR7@=C5KO+Z!$@f~K1{66Ba%uN+x-a^Y!af2gA
z?-U|f_unyAYV265L?{P(7L=SIqXxG~0BSJm(TQNHU$1R%1Ya5|x}uv_gTpseb<;BC
zr%OmbAiO?XIyUHW#8+w8Und4VP$fe}*J}%V$Qu)GPy2k!v0bK@bq2lH9vTjV`L$kc
z-`2_lG_^}l7g@(7a7q#HrX)M^^k)t7wigvU9Jd!=!@WAx%P>gbEi4iiR=U>}RWY<g
zEq4}n9XqomF|8VGAh%sWO`d7t%04C`qI3h*zVpK3n`N}S45@ag|5LS2fT5d66F%tn
zpIQrdm)*1YAnku~9RLy`1{{YLmjNi;S9t@!y5v-{Jhh_xj?Y(%@?uyJ-U71i4}{K5
z@_&)@42$-jZC@)6I>#37<&3-hmqB(>`T%`T&9^q`l`rE<NVlmq#I^;=HI0gbtY%df
zHlfhVgr85A_Rw!3Pzu!ECrN`?&>^>vAmlvRqN%P`b~v3(GlVQEZJg_gM6xa(+c=6i
zyf&G#bQNi;i4CPGLL?f<=U6{wcpP%8l<BE#yrQN;pPrP~#3DVkJ^B6m$0$D0Nb^?i
z`OX)6aBg)yytT@6QSj3@tI~6bt5|N^H;r>MKh~oYBkGTBJc%$3@XN1$*MJCAWzT-D
z;6>9ycMucp!XBFKdBv|}>GF2g<MCg~57;Ya?+MV}jTv2wtr;>>-9rof%mr2FN7|LX
zTUXwKPKC4kql>im0ic90FYwpf6K4?r^3VCj@qFZA@7lSP$<l9EcklFm%W1dMsQKIT
zEuLR$$$%od&~sLxIP-V^+=&fR!=aVN3^rDW0sl2(N~69o*HK^55q8;t0R{9UPCaKB
zw}GfeJZ=iRA`l%SGiRGbwJ9ewMeii)|A-hi^>^%sK{luj=M(=lsBSNY&^OBA;OooX
z@MygQ|4hPT=eh7=lf<1Yl4;_9{ZpB!M1D2+hN19QyUt4H-;Wa6AAprYv|*lBNWq1$
zm(r9;fK)V?yvq!KO7S@}*CPtbg1KzLc9q}9J_zsAcYeHKfF#H&U!%a36UB*&QaW|6
z5*Z#y!tX*`Cs`#HVSA_wpd982Hwt-CTrf!2O$Q#8>x%>kwo3A1Zhetn@?s@udQ$Th
zC4CAHKNZ~oGC3NSN$eq*9+`WF!U7pI*duRVJo?W;NeD>2zx$|)pI%jKjZs=NCG2B}
z=X_HI#}YaxA>+6>E1^)P<Y-GcUCct5GTx1_QY{I+y0qVN2vsWy)gC`91qv?h=W3MW
zgORqTmoP5dwb_cNh3N?k&C@s23KJ$t6q%C1_fhskS+K+zggm*k`8mjN3Eg8yJHQGj
z%%bUy7Kp1K^EoegiwCd&uktNUKpD8Mlg>}xe*!6!$lGZbQ*`agEspqmITwDLxNoD_
z1$Z6V-_N4es6sT5(sQ8=u;I1BW14T!Bs6+IDcd2&2~)KImg)(58d9LL=^ejs<4){5
zRt9d;xkBKHgg7Cv6DBZc&`vqcZ}a^4Iw49xcj3aN2GvPgJ6p1Z{NipZ+{-IJuPJBh
z2Ce)0CaIEgKE!912yfz4SHxzF91d5f67P-iiHowf+}ytZ?ms$U!M|^4L(yb-u^+|C
zA{j+d&1c#=_ACdpnEh8iyL!CxutO!)(EX&Qh-1gb{bcWB1@pdhdBl2TN7vD#!8akL
zm3j|Id}mHL>54dsP_6zmlzfK>UJpBM5^DqFN4+ytc2~PRW!<vE&lRUOM$d*u6b?xb
z7dAAL>hqTmIUBa!$0(d^g?iUEJl$&#<MM=!PMs>iTGmEi)o%1*x=!w5xWmHvN1NPS
zrp_nMLIwU;v9~=|ZUK$G3$oKm>}PV9UOdeU^}46iF@vRV5aK?#OTTZkX7DN~)FLP(
z0rwcySaYTrUs?`A|LC#2I#QZ3nQHGiHP1Ukf;vw9+Ru*5DI_#4g*Jn-8tT=|)*4#s
z8CTHL+7(pdR51mZR|CD<lLQCL^I5r|A*e=~cOc<<63Yyt^3FnhCG213BOqaXeL)?V
z+4GxsYG1PPST2)_zt@QqrXJZ@@;3aMoOrUpCAz`H!f)RH2vX`s$i-$l&mJYyFnX#^
z3b>nL==QjP>*<;H2fI@&6$xQ_NR*Bn*vLLBKOKq6CDkWW|FFs$wiuMHi2s2FcwrD-
zs5{QkX9?noJ8Cm71IrYXpC*DSw-)$kuFi?JZeZMH@(-i3(^72xFcz4Wibs`?lLY(F
z?lVvR6~T*1h6lelXjLoM23d}aI}mrnz5XcG@f=tNwJUBI1>>VnhV3h|Yv?<6-a`&u
z?FT!dr2*|Qd&{VZ5%aX7Xl2#SOWTc}LyJF)&2E98$b~tfGyp+RtldEyxOgkOfL}wA
z1Z@WwXA2$0IaCrJQ=#pRQgLdrhDC1Cka%Dla=T=8CtKyW*lRV?vkwp!go$(oH5|pV
zhVF^W;0CN*^s#`I>yss&jW6JjGvUX}ewNyhz4+IpB=kS*2XUP#Xu2`$8X^5(<sQA-
zqfmxm4fW`)UD^Bna?)|~Wb4bTW1HM!^V+SL!96|C2pRIkQDard1=3{fN2+dRy7t|k
zJbvn#mw7PaExLS|`h>@JY*TnC(zpHq-}6Y_RJ|NhU!44amW}i+9yBtvjzlERu=F!m
zA=vI9a+1$31o7{oE%@dAzmB=|yh>5({gZ%jc)lxUrYP*E=kM}s_hR9!nsdF#m=kMW
zlWgI_h1&}Tvggb`wp$tHHQh7ZKz$Kdy?<f)=c`UX=T9BTPl0V;G*gvsoAf`QHJ{5<
zdhzqsHx0$ENaapEIdkjs4sW8M6wzQqp)1lw;dfCJ852@HFWdm@SVUXYHrj^$-~ITz
zo(1eQ-s|yPbm`^V`kTa<H(&Qh`B)Zz&0<TJ2`fitg4~!Hi{3r6H{o7$8_#mXTt3Np
zP6`2?m0AALD9rUBBSp8#ONVIp6Z0`8L2knhC=pTsK|~h6aJ#K-x6VUwoD;FDaL2Pg
z_Pu-?{A{f*F5GLG{vs_t<m~;h?8w?dmhvTs58EX?zFCoe+jJjx-R)v!lM>^@Woq<u
z+_`v;ZGORJsT#Gr^j^Yuu<4;Y0eul%9L2R7HNk|IL~$pTRFvkVRRKimU)7R0oXuJM
z3BpoV@nk#95X3{(2*~f_t?2^D=w|Lwl~5}ybumBC>57Ta?1BMb)h<c1soa5Z_EIPw
zwU=~I%>MDcg!f+QNRH-B#ph|A5Q64Sn@z$Oh(N$g<^66g=fg#2**Giv1!nH!@uxG$
z+*N=Zd@<6}Gg$LbZbXD$fd1_R?s9hhKX}Yxjatd<JQBcj@s!NARIa$3bpRj6)y2!0
zK(|+%yv4mG2;b^nH?Oz7j<x%#UPtTXXB1W>I}TcxO6Z=+B)l!v-g>us)|Ss$*gto)
ziyg$*16^p^=tDKIw{4dID5l_m#Y6(fnAm)<(3_m_o{uN`MIxMjD>&Bq=eax1SGxM=
z?4O%g)*W0^o966-`oKMoBA)uxQFB}OZR9PRzSJ#$;j5*~BorLdOhjKqe@$a6rR0l`
zcm`NI4TP>YKw_m8K5tK=zEa$<%Ov8u-OJ`DFE>#3z4RYaYtOuiEvbFE<t=;00Nky;
zJ`cO<gWoJ{ZrCmIeFVH#6|Dp20*;^N9KED(`OK!nCkMXX6a(UnoN{U{Ttov(yZ?Wl
z+FY0Uw`_NH8CKNd68MVAGE{$Uw6P_F@o<?9fPZ{BdUwdWR8qdpT*Zj6_zMGL<@sT?
zC4iS#Jrv}eqX0BNfM&5EW@4W1^+`8H-FThwmWAm+Zjq1Q?xw{QEm~T2FX<JFd>ISI
zg11<iN<6aSZ71B%G3`s1mu2YBprDb2mwqX#QyQpd5Ik2ys1b`4t}In5;-q*0Q<lF#
zmy3Z<+!Z_f0%`N4Y~uYbIUX~`{`be@tRWg6lbMHQrXq<V{<{%_X^lOFE!N$&WyiW=
z-c8FcZC`ewu~g3p*S1A&&W`Jrq{Sg8@_D`DR><jq_8O6%w}0ST82dQg)*t?Gi@Bb?
zS*R^pf|<X%uw`GHpZsjk#?d8XOQAz`QOeHY*A|!m#D;<-q`3_rA!Bz_V8h(af`R8<
ze)v}J|H1?#%jH~e+ygWwRrgH1EG&BeGD<&4>2hp|Yqz@7|F-((2djW3jb-ai?z?Zy
zn`xN@i=*lYUu}OP)~bihiOX_b6|9!R#ZjUPr*MS%V|EY?iaS1Lm%;1_`(tMOF5_uh
zg4FSkLc%2?VYjr_CQ(8qB03(iCi8f0T<XYp)8P5i0vI@F{YPI!sS_dCem$GXZ0)r!
zX=uhQDg?mGx6AgFUM!B$z1bQheZRyBJMtQH5pnj-aKRAT5ggxmrp@yc=HZqlwz^m|
zFh`|+x7eO@F3uhg^E_*`EZiD&X+?B{;50Jyt@1UuGmo3eIqJA!F4r&K<r|^*r(_*O
zH#TF0Lzo#`h~FF>QG&IC(;CO~-yFO;At}y~t&HQ@(NwH*l1$@{%TSqg<IeWd8tZdj
zhF82bkLjXuhjJF*A4atOX?yX?QuYl~`)J3b)@iVd&OL-cUaVkco-D$)Go)n@@L^vQ
zqjTQR7~C1R?RetoBJ7VHo<X0<X{^&AT<Mu_{Pn!jvf7MSmwB;vYi(GF^LNnewc+-C
z<^-00G~Oy4QI`8?%dYhpo#OWg#<qfH)R7)O%4w~%d&CRJsGTlRq>Vtv|7}FP3h`RV
zWn41bzOaxZ)>8mp1x9Qc!&SV0Q6@*p)-v*eCM$jx*)thR?B>SdkRj-w_;I_6fhW8B
z5j6Gq+D98)pX4ePaBN@Y(+8f6WG*lO34?i7@}M!Td5eVmMuOjfblWiw3B{^WHC*4C
zy<t>9gG<jwY2hJM$2qVf>3)aw7Q8YkBf&a41&&`EvQ^X#SZTbWRrn7!4NThpV<rNp
zDr1{rdB6s}bnTz2hq0tjt{~yD??rHFP;Q8iP6zTyVfFrx(F@NNQf)WhT10dEV=_Bq
zTZa5^vA|4wh)+agTad7*8GR!9Mp3RKQmam_`17JxYp^8o;XA&Lz6Mn>7I~sjB3U!a
zJ-H!p4C4BgvtIZ2$qzA9W7gl%fDIHgIR**$l5Zy*o4aY!J()})fE}johIhT&{6Iw1
z$QUHv`?hUedd}9`>U82WV}k#xTpfoHTt<g`<8tFRQ+U$8PqO$_7ik%*!%jaX2FH&U
zmwsPA#(&+WYEW%<U0!ZN$}Nju$Y@c=+566I*vi;<(=kqV8f?sprYfEO7F$C2FPSBO
z^<Bz^um2syXA!jLr!Sm{B$C*DJMH!(ZiAuPK`)J$W)H6|PBtH+XWzqbMd185E@BKC
zAn`|=-Vn_l;Vm4<-96I)&?3%Cbq2qzKW(1|S;v3;8uIFzI0KL6;jLnCmV6(F701(W
zlzn6v-UX=c>gK<X+#Dr*<+tZXo_%}=+!rOwf`aFrt$Q8)TKC-S>G<0Q<edz9_m|K0
zWqYA;%IG`XkhUz$)N*g0<Cx}9VGr-=LVWuvaq%$ewlLJd?Bjfj2GMJYAk2IW=Gur$
zgG_KqUvddA#bE*|qv0pL&Xov5^6VqWZOy}Xa@rW@ZOv1ZD}&%nr>z?{&X-4Z_f0v^
zIeVv`m+p%V@}%1YxMlgn<x1q%gI_GknP<z%1KP63G;LI>(c)T|F0etsz=vI%()fVc
ziK@2E?c6YCSGU*fg8f&Cn!rbFJ};!67uTQBbUt8Lv=ZXIlWAXDI2PLw0>I6Jr7Lk|
zly<RN?~}G#%-_LdSfGsR#mI-x#7~Ehd9+fgO;u#+fLA;U9)&M`^8!jj%96JWNOg};
zuKhbHRUu^p+v8^<Uc45${0C@$76N;1m<I=wMQXt<(`rkG%~;LG=7mGAIf2(;sN;i0
zp^o6z%r05OWwdMbpgFzR3n`>!qnKHe>G{P5VByjzPcWB>L!%BnCb##SPLtz`{|g<s
zzpMSS*VnJkJ84oOMz*_YPyWDnowg&s4O*I-kW3)^HD8d_cLsr4aQwnd__Ul9$a)l|
z3r&knIQ~yz9@+ZfKez6ufv)C`++_4gS3syl0>X>KZE6pxAbND|n;q`%7wp!9=~>vN
zgdM$(IQQT3HlcmjfCGGDL21)ziQGnNjJm(-&#EyBe)n#WH?J0_8&47hYA!*%j+?9f
z<_Ih|iz`7^teA9QFgCpOkSVfU%FFpD{4`#N6P^20yZ$uhSNIvu>x0}hT_UY-&9Oh=
zUJLBAu)hgVeX^ij3r#K|&}G0NH%*Ld1~NLr&Z^McEoyxgsyfJ7aQ!sN&8@Dl#~6_L
z$z2$xIek7tZ&|cjzG&fFE0Yd2wp4KGMFV<N345bzAit8PCy3ylMhrpS1+`Ak-4%q+
zj_!*%q=-?GInFWHI%66^U-txi2unRa0^^F+{TeFKdS0L8*bpLXyBZmin{ez0S}~*D
zQc7VA3p~jvsVN{Y0{i?E*f=Ruq|S6e(J21pWRiA}B=j1K3zZ4X*K=a@JbS;-MKw<7
z8~sq2I1mHNR}*T+nZzu+D_V5HX!h}z+=?hj(2v_>;y)bsuWwT_J;BU2LpYT+Y_<Ht
zJ(-mP;)AMKzJ8bBq>^5)vpg&4wneZ6ti;StudnY+wbMmls`2{bvyjvHb!bFbneH%g
zo$ir=hwr`Tdbkw<iQPVDnS9Q}w_G6Yk#UU*i=+jrsi@@al{n)uB!Cf(ioewJ@=s2;
zvi!B<@t`QvsG2KBZ7YV-OEB5B39~*NtpumW;9D+tf|ejT)AOEzP!^E@FOlJ2C63B^
z;WSun<KPds`}(Ub!ABr`{XNe0zVU<1$!{9J4NMO##2@H}^_D$XsuCo@kCcpj``}0E
z&T1pz5WJbj?%tE69_MSCcb&cYnR?&SV?<zoZa(8=pH|*IHUaU0o1!8m$W-4EjB0XC
zG}gS6v$>gb8_IKHA#Qda-lkG$DA!BE$Fs?>jOYph&=~HBXhNB}y-rv}^mF4wa6lS0
zC4va<Ktw@ooA>d0{uxGbk=R*+>J-Y;FbF@>6`TwJ#gys{PAuvm0Z#UZn3$u|7uc>w
z<P+>jg$^OLZ0EQZa~&|}zPZI)^_XRtV;8bEaA8gG6_COeUF7w)q7nC#2Lc@t-?LFG
z;SViM$q!tD9^1`AEmxT${Jn&_8}m_r0;HQ6Lu-?Mho+$J=q9)>zra(o%E`?Hn;6sB
zY1R&1qhO;yAo$+Fizwxbn(2y=f!u-o3&OXe8}zwD9&Dj!_kEMb>YopaeRGV4^)Tw%
z_KDrq#7PJAu{!mc9f(tZWZm*&j7H`sQS$korbS3C5!m|%Tp7#{l(-xtteKr}+h5S_
zo#&<6@xZ2zc)!%?m*t3v)%F-KcYa5GS<0SC;_MA*J-8i)dkmA&Hn0Gz5bhAf)TAc}
zci7^sEOS>2Vitduh4k{LC%t2M{ln42DyV@lSMxHmUP`ClcPrg`%KlLZ=Yc3{qpSvj
zZ>eO%jKI$il2hD6!#1!V0FMyh#5F(>FYA#bD#WFJoqyUz&!45D_&k>2Q%V7&@;I&z
zOC{~B@ZHMUxxa999yVmZ(&y0yTU0P=l&tysap@b6%$|ktv|SUKw;WVT&2DH$C2oiJ
zt1tB-B!aPlqliXt`dV;cO$FH85ep7%s-_cZ5_=-Yzl&25`S{Gw^eiIQF+y1}zwu*x
z1Ls<@;gZr=%3JPWJUgwlEY3YZX+7PBC~Br%e80UOMoJ@fiS_^Z_r6;tZ@I~7N|qV!
zQrpCq2!oEJ@t#Vq5dS_KDYDMdctU7#n>DmgyJSD}4xr|4HOT+Nn@B5Je7yRp-y@+z
zv-JC}2Jn=jzGTbnL&1#5k6hD;p76xj0xs-G&9F27u}xVD>p-u{7FZ*UcTEWYmS+!g
z2WZEHXyV^W$gN*$;1mOCI5J#VOHQ4>XYp%IRLt9EL65oy*zIQlav9)qG5MY5cN+g{
z`GEDoGj5)8D?QOt`$K-Ih=>IvLnO6+<xl_=6@jUEVp;vfeu@XA6lNq>Q3aHQV4=P*
zf%Ya-q!%lmTEoNMi9Guj0wEgy0q1n!?2Ig!bi1jWW+(cYDhJ*}`g`Ly&GODQPIe9F
zj$N>{ibo~Bf*9E%wC1=ZyO+-bvxNnu;qH?Hnvh4yg-x`Jo_NU2E0G5=n|e>THHsxb
z@bk^_=`i89EsTP_+6~YAge6<WmgDX;lD9R8((@e3jThu9YWg2tYe^LBf3Fs)l)QY&
zn;4wlz&A^W43X0#UMYT>#k9P4uvBv41%7+bdj7?B+2p^K!OFJ3%l7b>t|f7@)Az|;
z=cN5KJEmh$UcrYduD#DdY|g@S(43!czhYy`6LhX(xO=tpd^zVbjojC)X>}R4<m&uC
zuM7z_mCVxw)2K6|JS~Gt8dlr1ZH>c;MnS8-I&#<kpzypdqdhLNQmF~ZmUUcCyKc+}
zjFFZm<l%2&gDl%|D2uyYKFSi@JA%Dr2Z+%()JP{V#U3MY5X){-wGuE%cc-gu#<~Vo
zlF^S5C5GYR0S|heONWI2)(fmnh>tkWfaI?Xsl1*7UDP<V*v|H}%t!c*WFk-=w?_|z
zk_eZ+hxI|Xw9YI>ZIbb%teNKHjD?`vyJO_plhy1Qj(O3_YU%)4K18c9Ej7EfvfdK5
zO!%=xSqn!m4WQPMPXZsp(pC7$@!_Rb+(fe>)1)`eKdqb``}27@s-#&W^%Pc&9iwEr
z=}MySE(mz8^ou&5vk|Kui9ubQ7d3!hC1eLR&mC2_8!*(4L~9d=_!BGj5xL9$Lhw5o
zi1d3It9V2mV1~wX+OsENB!&IcMg}()e=HH+)+>@$XyKF@tG(Rfg_w%m;w|VW(!B6&
zr9m((kp3=Hr2LxkuO{i!(@d@CsLrA1BFid*t9MyC5se=j9+Fx5&QPF|6dsuzUxtqn
z>lDQmj?ml76;TH&K<hp~pEfz)UfKku&(8-&(lgb}CSMp%@M^9tC-V(~Ylp(kMp0mL
zbeP@}dZbBfd4^*)*<9mrK1}9Vi|(kRAcA}!75PueJ8&ugNb7Bjhytqj#%a^&gKyE9
zggnRR+!^xTEFErsoD0s)ZyK~c>!K8NsVf{wyyynszV9B*R^LD$ed&9kV;Kf=y%ON!
z?Zt1g3DXO0&>{r7rP@S?=xGco`$)681fEDocnA~mDv+8Cw@d<qhJP<U9x6A4=z%)#
z9c?q|UfH&4IcaH7{j_v-%cyX=@F8p&Vtn#!2oZIX(IWCa_W8exKs^0cVyV^HZ7P4#
z-~HrZgYN|%%IP$A!4SK^Hw2Lt3c(+u8a~Dz5!dW||CfCteyvF!&<WUnr)cL}s36Wt
z#a(>IyVf9Yz`i$LrMEO##OLqLZc*D`Xr@G*v{)KU`J5kV>W~(0Dr&?CJp}_HP5O=F
zjo@>0dOMoJ2gL0OzoGfnRBZXd6glX!-A*SPc7|{PUzfk5`8Sm`VBd#-6oOAZoEl%N
zE~G%3DZ;#RW1LI^ObQ$f>6{tcWKQt(vJq86^?3I)zgi5`4!$xB_J1+|9%Xy{uJEK+
z{2cW3-}cKF!7*}{jyF>1&cT`bNP3@kVf)XZmkj!_-Di8_SHjLHU(9|{$`-DrznX_g
zI>2>VuMP=gb|0QvWqs*99b6U>d(ofeLl=J}GOVXs2&SMtRyObGi(Do?8OaS%z}@~|
zwHc@~J<Jg5g)b^uSRaQ!aqjUvhq2K3&+;~;yJBjApNSyYSTn%!w_k8SXltbNG>#t9
zeK6i}a8USv>s@z^n1J;z)l#HXKz0M@wjzCYTL+w++Cpj`g*2en4Nj9<NU!#p`%W}}
zky-K?m!xL*kK~nA&O)@7zp#1GZJLk`<z#{(TAwepsWtvFUIq4uvD&jDjFWN7uljV(
zLJ-Z@$s2kKU8mtEEziPm`z(bG^)d;2q6-FN%38d=q3M;oL|V2`f}8H9+=B)Cn|Kgk
zZzy+#vexK;QZyhcUH}Ij#XcfK&4VTtLIM~=*Le~Mb*(LT?c+17#CeAoaylA+(9nDA
zmXAT5#?Li*|B|j!tt9N4E*Xm9E<w5<obSz*^RHDAObE!)f)M?U-6sYlWA<$PYrj;M
zVo<5wbFs+!{vqgU%z@@p5FbK6bbW*^m&3_uZ(D(F>R}V1tXC`_*i}aqbYRb6s^%Og
ztJOlU!bt8)ePW?rv6gq2`uYv+5$aGmAw}K0iNcD4R)QVJ;y{0&9<>wVA84p{F;bq@
z{(ID=nq!{&WZ`fLF41b1+X3c3F5-5zlaZnehx(9sy)%Nk82Y|OZcLyjG@Q%HqQ;Yr
zu`pPwVVkG6?r#HP6J2aK)n+_1%9&{4U0WBIagu5`#kz^Ua~gMrjLu$JM4m?NjlZ_E
z|B+Fc4m0C~*gk0#L{ok!spmF<YLnPHeEX`l(NYP1BSyT3Y|h9X@s4$E(!FUrL)#u0
zHyk#iT_lpzP>Y2p!D2LPdz~W{5_F=QK=4-zzlvrZOVko9qt$o^Z3lCnu@4L!^EX}y
zm9hT9misFt)p7FAEHvlWtG%3e=9);Fc>c{mEd!g+Pxj?wBOiq&ZOb1&)n%>E{p)a*
z?9$iCSfBg5^=YIQa9`E76q|TG_Ks@zo1pqrMj1=0Z5d5uK6)q70Rhzh!VXC4VRGng
z%!mJ<9ryi$an}iu9moCreo?Qs!`!8BO%)2n^9+g?ALBXvmeGHZHyQNDN01-E@vKq5
zd|>)k$vRkH!Bcj`IJZ&Xp>ruAx=^tUGqT#EP_+^b^CGTTZ?h*}Njnt8Kn|Pu`1tSS
zRn1ugcFsav>BZ2?LwRCrG_$1}mos|c;Ze!v_zc)GdYgAUDmh@QjTv18&Y@J8=2>kF
zwv5Msp*5T)0Q{vh^;3eB&(2D!gjn@TK$#%RoQ+(f*amDsjxdVl@3DWhB<W8#_OF`D
zkv%0i7lH-;S5^#C2iWTuZN%aa8sh{*%60_03DPV2HAEXJ>!IWrZDLZmKhY-Q;)<4}
z;O2B(J1D8k`j^mVWMOM8%CASjC>9ivAr=}#(RG>CWkh^p(YeAFBBT6QpYrOVm3>o7
zSYI%-7Whb)j2!I-pn9egfCTHMt>{Gn#2FA&JPT+BuZ`2f)jSljJeO}i^mB-@&G|s{
z{64`)WC>p{r^y6pHJiB2^8`Rv0$=AeY-6}ae{S?PqPr@mZf(pFs;o+b9diypT4WId
zUj-;z#aem2G(yegiqwF%N@vshuS4_@%rY~~V2uzVsgRgVf@*{Rwx&0WS%O%3z`DW;
zftc>XT}U0DpZVdLtU&FCdkqUOc+FL)oU`55Sc}MA(fNUfUsL!^`bPUUvh*EeH=hxZ
ze6sQ#BY27@Fh3WXWUuOXge2MLE6wtjc;q{q$dlFAVDCc*NtdWet-84EJ=W(tGvQ%s
zry@T40qfy9+$VE9)N$|fB#+Xc5Z<0@U}wKTtc6yA6F9=5m-?(jrH|(I43X{a4ONJ>
zBiuv_r}INdAG9&<vT0c!LOlFazL@Fsv*}<?(WcISuLMNu0Y4I6GnCm!FT__Ub)^6z
ztmU*oflN1mb8PJ~r=xtlNq^;S0&}1fqTiAGUYXdw&uVOfoMCqWWrqFds^Q;QX~J3e
zJAw8?EVj0&V}wmD%_+^UYgXqekbDJH_h$@lp`5-GHcn9HbK_hVr7reF)di}rZ!$4x
z`|d7OyVht+i$6a$3L(8?v!#`(rBQ?93+Bz(M;oyVTdiB>MOHUl3;#wjjwTB>oGCsK
zB?qlHot|J@4mw=0HKc(Bi$3~g>c#CEE-HG_?xils7fp7-eyt(powGc2!~WM;H30Q-
z6Y(Y!i9VL{hYzW9Vm~GA>h;&e9xtOC6)J!lc&Rg-Pfi7YK1rh9)pKjw<O*32LmC|@
z^qSu5D-7{cYNay+<KPeE2m1q3z7v*u@2vio@C}bxs3=SEWj+wiQHy0<e);4LX0yG4
zYhT`=<TqCH-1_GMXsp$jh=8iRhO-ts24DYIIjPii%QWt`{vQ|Qi>NZ-?_i)?GZ}kV
z4|>Y`N%HFE{vN4b$-TdX0t=#_hJV4}8dU!(J*V_J$Nr|z|CACtIh%`P|MJIuG_BGQ
zUS?RP@=r!0-kQgsB_ZQ7N_KZ0#A|!FjT-YSppIK6rm?B6udBVb3BL(#tjjm1s~mw-
z_hphrs7cvmG*L8iRmlqV8tP>~h!1-(bY|8@!0q?fp<*Nfcr5eYgag~<AxI{{d-roi
zeSx3$vo+l!g|~(-$0kshKC|M+q^mU38f?KZ*yufiq}0gX13gzi5+^Kz5RzT95eUXl
ztj}PE!adhsM@--ime|FW14W*Yp)&mS$y*rZL`tqaqEaTBmKk4=LOXsOoZPu)@=C=4
zI4HoOA(g7~ks>TJf1_BLkd?*0g!ZxivTtee_s(S>^*Kw6?=1Ci87HWB0DUXKHvBjL
zVlw`x8+=sG;hI|eQYFK)Ks}r_dD&Ls{}J`y@oYWrA2;4s(Nfe~sjaGLYi}`&qOH|M
z%%pZJReOYp+FHA62St_E2qm^CDt3$__9kk@7Gm6|pYQK?-+!IgBj<RWlRS<yuIqI@
zUw_h6?l*PMaEvZW8D-t1U=rIA_OH_0$qKOE=?_28ZJLtdwEn`n6(iK}4OLUB3A45P
zWi(w?(E9B{gu3DBcuad9FH8fX44>RHWsM7J7?Fzmd!pk&)J<)_wg=0c>0sctg3(Ua
zzk*Es8jza?0r9bEU&3~|w}iX2X)c|ElZe_`nie3rxR$)7kL`8tPIbXd)M+nRI$#Wr
zCc`zcAC87^RQkqtdg=F|g*NTLD(=7pKh$8d6Yu4zL67>iR^k3oDQf9&&{a}sqvCC=
z=7``P=BqpLRHPq?T&%PzsSlc}a?}@_PgfQDzH0{FjVJiIHYwpf?o0o*NG)Pm#w;KQ
zN@ull(0RGWfxGm=$zd%L*C@p&Eg$UNa1y{*==}N1swOVD=O_8Ow|EtED{#y2<QxBR
z04=`wQHA#tRhRfJ6hpRF+U<K}bH_Fb|I20*2%)AZO9lVS35RRNWM1FPoq(hD^tZpE
zu6pGqrkf1Q9?_k(;O_Lb3yJjDkwYgl4`=<X$)YWceJ@7pXe+ZK*nA{uK?~luZM9FT
zNN;cktf;=jtQF6Ww{rBIoJV}KjpeXf1?O?iW^GJqqMgX;nVcfE>FR;$>@BSrx%mL)
z9wtG5XtCR`zo~q=)pT1x+_)N}?DNGkZroz?+aMuQD*lp`kZ_()?^iZNi4=&Vu^S|M
zQRpVZnTkr*)8ha%b(Q8l+IhwL<1R)U;?Tc)6<fub4ogV+@b2CI*Ab*sf)a<~a>;G6
zPeMdww6Kf4*r2|&t1Pr33G=9l)n@t$^dx?63#~e&zI@RxK&+x{crTsyks_j*VDbmX
z`(OzxpjdQ?sOZ5aK~H2~e-Dn|$LzhqOO4`D49Bv-MtRll%c23}#|s8~5rEqRn5hM>
zy5oi`#Iu`RckU?b)44me|7gj-9p<P&Fl|TU>P(Ja2%H`+nJvHti~YC8V{ow0P#i~X
z;X<51vv$mpc{`u(Z0<+leqVr0vvyn8TVK}{n3{tKoE9Yy_*ObHEg9r(i7&!CR-EVL
z@Iwf*LLP=bDKq5`*fzHh#`ekKFw}{*w(zC$FPO-&8iHFlT(?@}FwBdjD6LZ0!7gea
zXarH78_>qRN+8hj-dPiT&Ar~4^(PV`rfR_z^U1N>m)Cu0Ma3c=mooWSpcU*cJfgMv
zHDQhjh}yotD{Z*9x3J2e&slm1x$nRS$S3xu*N(=!rj4Xp-68ip)U#zo30FQGne(?k
zU(o<oMxVm|YK+^NhVNwRK<Ycou4PS~ezHCS9!Wvhfmo`>Ppm(Df!b<&Db=$o4*!cX
zvcK8CxolOemWp%=EqQio$-f!WM)>z>G0Jrny?vgE+!%KJ=DVkSsX%Lz<qtXrsXObr
z{)_Y!*Z>u~(Gw>nH{SKva`rAGh^OsreABE{xj;bEuJ%XLISPMx8LLCaP`_n3s0TM&
zlrq1KF`qJh0w|vH&#OqWX?HQ}d-S`>A<&GK9iEi0rT)W94J+lPRXe#s+oD@t9FUhK
z!W<Q96|1xy6?E9D$i8B~Pf~i5(B)lJmR*mHgSH*R-4k;{{>reaKn^{kBv;rb<^|Z=
z?-Ihf*loIqTD5ujZpKWIDn|j5_QYI6&0*Q++Wh%zp2LtCDV*ZA@+^=Up`w>PG@NLO
z^#9&HB6>P=6($}y4dug^iqUFbkF<LH>OMeB+R&LY0n4_jH*u!3YkrFZ+5W{k8oly7
zxu8RPsgUq(g?zDw^p%sx?<wC;hqy_f=Th^uzdob6{jrQuw(uRV$ULdTwi`y=5eS|y
zkc`4-cAM7U4QhKN%PO0au^Znkg&YyMjH^R1k<$x^K-P_~bXqgG%1KAI-SLla9NFAD
z2&)h)h&`J|qqo+hhl-9=2~j~wn|=GIPFlpSbK*GjG)k{-*eHYk_#rryr<>d~8li6>
z?7^#A`1ie^bHCQufTxYL%I8M_X|jTUG@WrMqUXd`sb@)NC+;cVj<vW?r+Tte&r<w&
zz?qv?nMe2+2$wOB#_Av;i!TIlx%E#jmJuTYB-@&wt1s*Gr15B^XRs@;Yc!g06O*Ct
zb}pX}>bw-$TES7#w6WU$Q%c<b=zIT%Q@VWP4^Y@E8H{X9DwUy3fIoX)xxO7mG@T^*
z^lE%me(&&24W$}^aLx;iaQOBl19I)0F%m7<dfVAA!N=8o#3>sVtq?ZM*-4OhH%I{r
zKv)3dZI)LfRG@PJTk6EabEC4>uR}8iV}$EvjBZ#oZrh<b=sB&*pp;}nv6lR9-2i_R
z(SGGdnSs(Gv$a(OFi7ag*6_5QxG^vf1FfNyu-a_g>x6@Tqv$Jwx1*KcvxsDaG8e!N
zUSF$P{yqR4r}57-Ks@Z6cRHG?dQps=r`EiNkbQqhyMkpmJ+VP2G;n8LRd^38p!wm-
zLZIwOBiX#S^0S(7)E}vl`xH$59>@$8>tL?57Df6$<y6AyC`Q3J6IIiZ7c-Hs+Gdx3
zA)O1L58{rXNz+v53X-GfG%3Ufy~oR5Kol7vno$=2Uw^-M$z#BQwPE{8fRo?n<^#ov
z>qWckC*~^cix9CP7wvcNIQ=nSp!6G0KV@W07L`QE_=`?XHcT7f<qc9YsA7fBeSb_5
z`7{9jdKX#O1+owpIMkpL<I$PAfjJrGxO|LhOisannLpu8ia>eNBr(Y=g#fttLsqXl
zoSBr{j;6Y~3HoL-Se6}_3uou&zf->l3svp1W<<1%0+ev2aw~*z>Aj(XywdQ^9uYR)
zqbq88%JRN;mdK5mTJhDpV>YGyO(r~oA|4yPdhiYrkARGn`~;-4J@2)8t2W;%$(>gZ
znoJt*a`erxzJ=V_feHKY+K4w4w)zGGa6@l<Z)c}Pc&v2&e=%)G+22$aAKDHarQ}Ox
zMLROMEm=eh1G^`0gl@lWJ>n+PFO2CtX77^#UU~kFrv8!$W1}UXx68jNX}zoOz!!NV
z)clvDqgj-nGu`IEJc<R5X=xHT!LSjz9l9?c7EUI>P#&pbERzDHj_Z5Qp74$;d~$-R
z_ETVXtJ||Uw`C@8zIml?4*iznCEwUw?8Z9C&Kf<kV~Wnw61P~BTZr#Y-1zMGb`7*j
z3Yh0QlMQW3t}|Y!pPc6Qs#KhrA-Sh{B)G4bbk$obk07xt&vr6zonVf*{U`T!gZ#w&
z8}1{}DI)?xezfq~%EW=l<vblXPso-b>FG!mxBGpT#*hZoY~F*SHSVqr-icH#(8jaQ
z9M1|qRflDxyQ)h2=ALO*YCDUdt0yUcpcX&kRE`Q-_N@#wOFR}k(RA%r8q1wiNPNH-
zhr*r!*H$HeXOGPgUEZC{M)^#Nt0THm@&BKOP1pP{5#v6?`ghOFv66zjF+ctT0<&T<
zMh*IrVDSKuZS{pgEtAHt61tFYV6^;Ncg)mWoSzx#?)i9bExMsWE>3>uKZuB`+VMN>
z*PHcR<vYXBO5F~D;0+17zx;i0ufAvMX!0gdeg!ukXB}Kw!xoJGRvxG|C`O@>>=c&K
zy(U6*96M~V)){g58#bX6omAt$#QlY{g8w?YaX`P<U|btl8-r-A{^ULI$>Dw^LH_vf
zjeXF(1&5`=6?EpVQg&5-Lzf(ycP_hOlz2_Q4%oS7+|r`lLHw{SjgM#N)P2LatMiy<
zo~bW7d44^1>np*&&izKh_emX-0|vNawjK0Rz!hD6)SAO&#DfMlK*8LR(`VP4Y?5T%
zN;{AKGO~yhIqjE|hzsN>FylPt2SE%y`5g>jOj<kh#R8U8nYtjrWxn!6>`kWkdE4f~
zf67iz`)aA5if(I2svz5y9KJ0b@csF3p5Fznua{RH6BL1x6tfL`b9Iwovfb(Bk?et3
z@|69FALup1Z?kT9GT_t~2?suyD+2<Rf$7`gJMsC?YU>IUC>W{rkNTXAmaI(h5yizH
z1qrAA?({!uL?)j}r0j~j{USM9jdr}9G1WnSh_GByhcqY%Z+?6cIDj@_KVMZfpH$}F
z?<9jsZVB5=+wuOSa_vao=1tXL<i=wo;f#uL1|!-XSR$y%Dl2y2FbqiZB(CpxCNCEQ
z|FxX7v75O#X%A197)ITj^Zde`adYx<dCz?KYT7w}fd95CdNCft^a{nlGPP!mRsY*(
zqrXulu!EdocSA$VL|jbusEOQQ^}JY>zCiR8XFs}EHn@6J?f<)#XxFTt-L%Lr^;R-n
zT6cjyLO)kdjE`u$%eRA>Ib-kIgh(q=oPpbdVq(g*uCQS<*biHzNeu{JtR%FeCA6?j
zA1K{b@SavjQBLG2{$}*6-Y#3anU9q5{~AUzD}r!`5H*02y@_IYdlh|K(*Ke|mc+x<
zOogmd2$lo3o>ai@vrOq1$>zv}fP$Ie4%Zspqn;fm?G}5@QSN3JCU%aYH#|j{jvjg)
zetW@^#8m6HY<^h&&W|sq=Qpy1Jxcn)rvxG?>7oO!N}1z<+G5(aC4X}VT;%wbe6e(G
z!cw?OP?5f2L{?(JFq$C^#n_n8wYbNhSRRf_w0rC6y-%wnLhOiWcy$fbZnNH``nmnw
zMbGyxKc6%S9bi>q@t8?4+#R3PDbm-S$)e%XReI~H&2^f9$F>H003W5bw7(>c5qXP+
zahUN6;{0N0y=@t>py8Ela|CG!#uB}JdU-*VOUJ@R%24Vy)7bXALj4t!tva*2{>@;u
z9E;{Phjp_X?$!aH+AXIa*!I~_6Zq{I6i+c**D1Y4QAqYMj|j+`f|2O4^=QiXE%zQR
zh~>CTi@Jo*Jxk8LaXX0}_j$-d?M-;?LgR8`3dNvIPGfoLlAkk`(KK#S=}W<{MB2S^
zT(z2^x-`PzQVLs-miKYO9Bkf#Z;tolpnSAhA0~X;?{BS;j$rkzcYYhO+r>mBIzJV$
z-K0FqV{%oV9oF4b9m4{JOEMj49=_;CED80bbKyjp%v#9l5!a%h^Sa-Gcl`2Ajo|Kw
zaY+~Y@e>BzN*S$9TGfI4_*f6GHy*}Yx3%-%4ZD?!JC~09e`cZ}E_t8}(Z|=%JexL8
zeMQj8ZUb9B!cW#(K{{haNF7=_3J$*aU{mz!N~wK1YPBtKI$QCuo~<V`>gG0T0*Tpw
z0v5k{52k*0#Ndf?PU~tvy&+UgX~0`NH!=Us9j3ImOB?#$VI|SC{4NeZQ`Tu^#x$Db
zO^pO81!?QInBe^#C#&CasXjI?oM9*TR|xOqq?>-c`8_Fd+_1FW^f3hatRGzhK0)Ie
zpwr5i#c6^gCjE^j=)lmN62XRvMShZWoj}G*MTrA~&6a6*LA3b#c-dnG4y&AZmyQAJ
z+{Ek8((feC(QX|zZ#cU@rR;uIcWOwfuTPWky0Em#ctA)$dQLk#b$VoTWoBgsZO`+o
zQ?Llaw0hwSl#4Qc)G>%vX(V@)OSI{RqxVtcqeyjp>2Dgq!%=brO9L1T4DXMwd{O#C
zotyqcHkpO;QrCM0vq+cb7ZJu%dZAJN1*xpemHLI>4loSZLuB9N&YRBJ)8EosR;X;g
z3&b1ljWg)@{f%Nj9n(8!7jWnMRU#drES2IwR~-z=_&f1o3N8?M1EHLW>=?~d*wH=q
zrmNpIRJS9`EFFs%^yCnB8oWXFgYakQsm0IR4YJXDFFKlPZ_k`d9A90+&mo=pNx!)H
zNG*EJkw+9$sfovDkEZz%T0Lm1iWd&i!A4&^n!F>n?<%+HSx5~!o?Tn`O2|#oGMfI+
zUuX`}hIH04LV_dnG|_^4`u(tp)VNL7`NDqKRU$P|Icrs%Qw3to?oRShFutV_{#ZKN
zzA!b~T~N+{0yBB8MwWV;TE+a0T>-9}gz!BSaNA8gDFM=6$gbYvia;FQwZ=i5#Q%J}
zkuh}RlaO0a?tC1)tR8VQW2WC?EEjFCbswXPeMA#b;>PH@rQOxV{c4V%gnh)}apCU-
z4lAF3oTmd`7TN<|v{#nAif})N6>qD2FMmfexL?WCJ;9o<03`ou+Lkp~X}Ii|VEL6B
z`mQn!GixC0ZAJ;aJI6@UkqP89oe;fsOJW_Se2h}4WJ*#KeZn-GN}MgOYVl`<=yaKd
zVXIiDi?*a&%nZ7kF8Ow-`XzGkYloWU^=JGBy6<a?c0Lghjd^pfeGIBL0up4oHs`Xd
zz(xcim&}bKP&wAjeiwG)MbhrL5##Soe>L3-cz?)}Hs9NEhk28m7+4ar`#|Wbclf2&
z(GIO|Gu$U#F-U{pkzOTGP(Q~Y`UBGANndC{iS^9Dib6!zJrPPQ)-5lU(Be1fBuZ#t
z8)1PB?fl?c`wJ8em;TRc05j(VZ23X#6(V&(-F#5y?=*BZa3fU{(0(*e!%K(=xPe_`
zTor?dsI{gx?7FupIA%SC=#dZ$4dZ^|zC>V_Cq?)4YrCXc+$(^7Zfj??!c4_<v?BHM
zY*-+b(A92EyS)1`j<pL0EEjD9kVca+<{RVfb>K2m<a>CDB}3<Vr-nnyf)hXqYm1{v
zvvQYHJb8T=Em#pHPSQc{ZQeXFi>e*o=BoAd>sqY-m;t0LTXYH=2y40?Ff8ENy4I`d
z@K}DMvE`xL=MW!5myJZ`A^8RTz3|iVgU&1CBBKbQ*G&f<cc+1K@s&*QuLcv<<z$(@
zuGME06VPt)s4W9=ozhcb6DMc$x53^0^WLYxUiYUEiygmYf2_M-1GLZGpV~hea0Ig?
zk8Tw!iAp^@+9@tA|NZ5392`dL=;%rHZ;U(X?$sfRkvHGdj1X6Mm!P{kNgp|hwdE~*
zj$Q#fgLL9)-=$`1?QX`z5;*7iZ*mfA>`afcT7ACZc#;EpOk3xu-tUh8pAJF1Uzr=q
z1;+AC0h!m*X(Eqr^zE3;>=SjTV(6o)fo7O3(zyE|r4CrHZ=`W`OdZ*0bTV8fVzi-k
ze7)Ft)pNHxbi+)XW7yG&t}Dbpp3kL$@$6<*mQG3IY{s>i65?ev)jU5_)r{F3UcpUv
zKI_foZ}?NSpRM1Ufxd(r@8`H4{RLM=rr8FQqYi`~y&EqIVHY0}J&Js-AF@Ha9Zw%~
zk1sl3ikI_+TI%DNBfLSAFPQtClDh~(@>JrT(r>MAKK48_XWg{6DD=?uRS#254#>`X
z<$#2O>s?!)Xf4gU4WaXqh`Y)mf|oVf!_Pk5pc^|sm&zQQvZEcks$kSuNIke0Ci*+K
z*naadSC)e-q^M$H0Ia)-;xQY+D!GG{i?PQY=-#FEr%>ncz)Ob>CZwFfv==66r*@4I
zpOl1lf8DRhCi5O6q|f3|1QQ2!Y9G_v-?zOA*iKV-YH#i+rAlRuxY+cFt`=!dvc6@L
zQ$(w7LVS%Q>j8uP-!K#b+1bKsf$M6~4(tV$+jPHmn9~I8>FTueL(vRX*D9eCk{(sO
zXT}j@)Efkwee}n%CD*E3ywaydHr`9H_9nVb!t=FA{3)YTZq`WisrgUKko3aJ*yS?I
zfu(lQijjd1cV{=n838u62dm=kDs&M{@5Qq;)6A%t)E>BPy3g~cSduSj`+$fWc=*Qa
zK+hc$hI3V&laWqf%*T)s5Br`7Wj*k6cLmDtu;&nvY5}VbgawxlHthRr){GZvmqQ15
zc<bl_$lPmFVOJynRN~K~nt5Wfau8S8w&a{wM-xO#t{5;+pLPkLNQFR?_EC@nxIM88
z4*lWLzrO1Gyi;#**65D!Mi+~f(r5G);+XY1`UVqdF0lxIZ@gMZEM;r(CGp0F1$hzY
za|4oLRWr<^20Ageomqfd$i8S3CUEk^jP*o`uXD^<*^Uf^^@e79SjsxkPTqyZP>6{3
zirjaBy*^*J#vdr}bR%??e6&{h1Jg*46dwVs@)Owirr*M(SHd{XG;|vn%-;5T2#WK_
ziD+;j_FXBzjVg~m6>RYCSHF)o+`f_iN1YBml>{#Er879SRfMyuE;>)C%J0WD2jC@l
zQnto}@N95n^3%yoA0|jqL)~|I4ae@zq7{CZ7QSse3Hb2nVGAtolgIpv>OVWzy5QSK
z8r2oPG$1wgiWUC8D98TD1==Y*0RK6^zS}XF>_%pJ;p_bO&sQ;-ZuQ0D@)=%K<^ThL
z9?=3T{dlkhG`G*TEU$V>S6}#4^dM2OoM_g=zi{#N$DiP=LLq4VpC@oUnyTamyeYX6
zWPF;Rben9R6yR0D^k9nFb?|r;eR3A$cKMti-sBzPmU=Tr(y3X|fp7K(&}5ge{VD+-
z*<_UTYf3&#=^CHHu}|_-2+5fGn1p(sp8G!r0IS4a;@k8LTRxC)9yQb-l)^&k$UMOc
z&P==YsksX`9X84LM*{$fqUAND2Tr56pbAec#F_6>SBU)NbvJ{)E3Oa`XkMu)SQgpg
zK4AUNNVS>p<3uMhL(wDz`=L0(auF13d}wg#)ZYMm(B@K&UFc$oCMO;8fZw@fEf$Zv
zE*&g`=DNaoci04Y`#EssHovKkZwR=>(eAO?mZ^WGZ*rG?{BCaMBGZc?p%1e#m;cF;
zJ69{^n^2h(AKE0ZJ+%0lPtG~xnn0s!XRixQytjTZnk*aliBH;ZQ7`KbgVp;SUGW1<
zC*KQX9K9Mm-@}CapQv3Ph@G*045iPu+<kqd`mK4Q)D9WA+jOiM<yrpcYRI|q2mE!h
z!8SwT#TYrB=s}L>MLRgns3BA!KeA&rVPd0=WyQLfxAr*@ZZ_Qf;%S^pbw~n82+6aW
zP~hI2Sxu$BC>)(|O0TnrY3b0P69JYzH?kznWy0z@s_RHAkZRi3{ZY%Vo3ED$En-(1
z>S+->)~@s)1Dt24RA&?8_^=;5l9xd&=M)v#@R5wwPE%inNt$l;o5`YeSfEo9+%tpn
zqU2|_lM8$ImVv|p#)v%${mPpA^j9GwERKDQ;9c`Ehnr3MOG>k`=pH7gfkpbuKBIHU
zAHX;8>0*h`YY~#2GJAWF6d_P*KB8e-as=5<*8N{c>tB?wp5~)}b=$nP-68uV|DZ>u
zcQ0}EY>(75*DT9K_t<8kG&?KMVjN_&5=zsN5wtab^#p88Q3`PWM4~!39>)5LfC~a2
zq78g&`AKreISyOyB3?5eRq2j%gdq6Nut8Yg_?>iL5F8D{Tt#+NJi3_)juzt<7o+qY
zURv002_YqcqqA>{&vdsa%40=V;>M{1K`za<^W9CA^k+-;HYXD+n4**z(nr5%c{C5u
z22;AzuZqKC8@>|WNtzt>D6<d1!pgfG&-if%6$_xWw7{x`+DfQi?DU3jcw(Mz)7bVk
zhviJ3KDpFBYj0}4tuCbVnqjOCy7%TG>+{2e4<F`#U-szuPU!#^bY6-sa}nHoCR-q@
zLr;{S&FXaL@3=UBrSH>S9iSBq@Zs}D*6k&P#1xt}Wu%QNvR&53n1ZoVxxm?WGvz=X
zJB`Y;hy@53m(dStaQy&fAlIre_SQ2cN;|l_%8q7vz+P<Cq{m106swA&y<$_chB@>~
zdbMi5#!2wvp*uIb=_Qit7vT4vcW4V*^4>~#74u?StXh)tUbp|s@x!Gf^PK@MUX9kQ
zhR15-KshrwTov9cb4?}K4tSK$rH1LaBJa;eee`o~PG?4C2h(Gzi#f)aYC98KsTHUS
zsF-Y@p`CXwIQKdBJ-Y+HK!9x=skFj!12LZhpY6i>rjxXC48v-Cw1ZvtWtEMlx}vwg
zIO=7g+h7kIqW!&*k1J0yJr2BjvN8+8`F!7RN-Y1aYj1ZN=~3{X#LTLt%6ZHzoXK7)
z@oQ>V50f~Egr={(*`VB=@Bi=hQ2>c@*N-<+E89b>K6&Oaml&j2d8{V1b~{jgL4tTJ
zaQ+4+Y`zw?8%%jn+>3|RZ*D)W$pYtU^CqT_Eb`i;Kle$M2oqqPs$GzKzbo4_CKs3-
ziNV}b|6qF5yFh}v$v3G!F;B<g#`iSJ*HRxP2ii7U$W@BOs7l$OO)k<0Fs4Uv%02jP
z8g|Nx?081?F#0ubB_c^iN0#ZYF2k4KH3tE25W0Kr4B5*?B5QQm<YV6KWtYp@{0Wyu
zS1DcurC_nk1b&g)cHKLERD_<l(6xob!r#74ctXe*B4D3IfLdseg3*|0rsuEYx2!mf
zYm`No>&8kOyUC0xduL6Zzq{%W#21uLZWWH#e=uIr{t-b->GdxZ7R34amd!LoC{0fV
z(^7ut;@^CLd|lgmg|<>`nuReKeG1P)h{oYmKK>M+#^i*Usje~w_bD@PI+MrC$<DfE
zVYB1P7wOd(Q=6R0L|GO2(4z?!kw!e&;jAhd{nj7LJr@Er49}WR$EWm(NMVz)TBt5r
z;ZV7}(8GMI<D`h8ue9`4TZ8-YCC$8yEr@^L96=<45x&mZMcdqm-bImf0iWSN^n+ji
z_TPWG)W%M59sBeKdQ<iR+-2dh^7+3x4a}<#T~$8|o8&HSc||VtWK_DbI|d(*-;S+7
zu4vYjUyHR;D#-cYI?02q!*PUOhHLe6rl-Q+o<aTjZ(Lt}SX0(Qt{P^7FVnk(Dlxwk
z6;RvUg~7Nd6J}boq5d}C<F5GF?dV$_4bK%vAsD@utd5MAnRw<<=uyfsV(#_cKB#<$
zwmlym*P3u>?)H{kb-vi)zrntvv){<{T*-7Ov*WN(?a@7#&u*K5>0?jhi34p>c)pTp
z!0xTEWjxH`smxyEF+Xgx!GY%cxs%e`C;W#3+V9;JUZLCP^FaTGm2W^_sC{%^fP!(Y
zoEO-~tP@(EZ4Zn~timS#s~#wNo#;7|e{BBOxbpG+cglXor}6Fdv5TGg;MP&f5yS!)
z{YLPmM~rY8NXi+G-pCLxdq#hD60U}_in`i%>zd_bgWYI~#6f6!)F_?fO+`*gdH3uF
z+rL^Ych7XN%%%okgtjm_#<GbRK8_Nb_F%(iyN&k8MZR)0-6KfuD{ahVWb`RUh@u=p
zDcvHdkx+l@3weJWnb}sj_y8u*4i@99B(1sKhsppNv+mg1uIr-X^u)gTsigGMd)WM`
zB#+)<+V^(3vxBVcik>0hJ}#F9M=B*}Q=+FbW|8#X@*nNL;i}x5sFk@~E+<olZ@@cP
zYe&w)YngFog42ju7?ivry^-J3<C7E+<9OoT{t1H%+RE2ikqS8LV(|CkI*7V26UcFp
z6vF2;DnS?Lcusx&lpRsBHh7u0kIQ=K5z3ed^XM743JPLKf8i9%h-GV>`T}a>7E}LL
z-3ndHItzNr4Qw`fI17`(JH5U{jJ`FGXohm7{{jg-g31O3cHyZNZ2m>l($NsM0mD{O
zU4U)dgoFFVJKS8%%dIoz<Fs*Kux^+Bd<X4l(L`LW5s5>@L&}|$(MD>Irs4a6h<HT_
z8C}Gsz|$KxbGMq`lsYu<1F4xIp%D<d%G<p)MY9+drbegN+P^iFVw5gIxbn>l)2RaY
zvkLmPj>mHVY0RDAANUO{dW^aVXlBG+$~6I#33vU!U3|+O+%M{ORNGOwv52j4)%NTw
zOzvO%F4EuK2w?Z+5BE4&F|34I&xS=F>`6LkU4$spLL!5N(FY>zyB`25wkkY-T42&T
zPnc<I{7Iv3P3zubgj9QUf1|E~t`YLlA?%e0zq;M(5AP&AQtekYRf9?WlQ}j~vbU1Y
z?VT<$Q}TuG(!sgKD|{78*lr7%Fj;Kg9%c}~OM<|U>l^%k6NVEPdFFn0Pt>vWkT4#3
zL+E({cTz#W?EvA2&VoR0CKu^=-vDqEJpw#1TY3gp>bK70tn!nke3I_Z(2D-l%eyXo
zpq#vlx_bUd-LHE9clu<Rl$Zv0E2hd^mfpOK*Z^~{Jt(N{r;}Iw_#WMO{Zgpq6`yDv
zi5hA_58EBmBIYpC7x8BKt*BUDDJ_67k<C4M--XU(`Gw=Pn6@z)5L$TB*jyGqGv4sl
zKZSjBnPVpY1V*c7pP>`K^JAMq(4(Wr8#m6c#`kvpbCO%>w_~+2XNQ8fMFBDA%vkwU
z|F;$!QQ(km-j8hr8q{7|z_J!q^W0Y|tUOFj_WDOiJDJ@_)34)&nthKqvWxIQvHWYG
zM5FE-v#s#QwDi+YI4fKYVj63aic-k)Rkj=cgExbVEc&(1FzH3cc#ic}#eLvgz62E0
zo6?a^fI90j3{}t+59R9a0PUa!aXC{*=WV8gO)f4{y!hI2i|FypYMZZt&=qsxMqR~B
z_sz>^81nP!E49~4k$CtSfbaiB1HAtR0bwwIHr2=S0{u!~{?4GjO&#{iru~R73dvOP
zqTgsJH(m0~dKRX9Xe|_2%b0BfaI5xH*0$c%G1;y(<rZ$%dc?4qoVnL>jDjhcJ>x9G
zQuo>EJLLdYY}K{KPF8C^X7NVUwpt5eo*__sRQEE03k$fVsT09}JC~RjU%8XV@2l3T
z1piumhH`|0<8Dd99~osCih6dO)Zg6b^@5voV(6e2l?sHVHy=#gJe)KYb+eLRE01M#
z_ZIq-&6n8Ii4EPr?=RbD=An`<)5i?0UnWP*5*5kguk(yTH_Kj!BNPKJVNHBYWwq3{
zq9r%WP~~0H|77ZB8N1BlFQznZ7vdr$_DE6~9E(S({8U{ezcb|B!Zc4$s?Bkixo|dK
z$9iYGGWvA=msuF%k^X<`uA*?J4;R*ZhwdA(VTVr5w%kR#uXdO2%+;Gl@fv`ZJ{dIq
zM59)9h#ogrW_h!;PIV=(#DL#Xv#V&*mzp*U6byE)U_3`v6u4gZG+KXiey|jJc>R#@
zsX33pa$xti%ZHPQ+4F13iVkXif&C+i&RoRcXg14LHp;Sp20e$kwbR%{H2$KI-{pdi
zI@U-`8YmcH%XCBSp`)s76p$mSoFOZj^;}mF?H-U4*k3rgq_Bf2zA0Ne^-uJ_-g@w=
zQ8vcHW~vxp16oqJ$hW1mu&k*3%;qRGV`1GcEJG&lGuS0T_6eN&FiCf?qv4}_>^DAX
zS?@it9$JLcc3I#PyHT62U7T?#M;{*_^BmkreKB0^DDSMz7dY}l)c|nev!c`FRqdGK
zMiX?Ftc`=>klvpa#cpavlb%bivEtgDQ33k@)Y(Jd#(VY2-1OG$-uXlK`hg;UNGOgM
z6Y1vT!a5xA=+^m8&vABK_@249x8Py0a6qok`KfAAFT0oc%QhOFyU?QZavR+1tSE$G
zTXcCvN>ldS<jnxOJv7!%Wmo#7=nI7MX&WIl%3)N<lor5qQ?9HrT6o@E(tCq6`de`n
z>KpLtTF80uaXeHqyv~v*dI*+erZODV?=DbrWffCUGoGyHFwkkQ8PFk?5-t4O)`q=e
zMQd|j33)VZxGBX%o98LAy1B^v;sgu==<3Onwja+wZ9?$1c#ehBwOhE!mJYQrWY3{s
z^da#Hdj$>wZ6WKA)}YN1h)jQ~bKgr0e0;ZfJ&Lm)9FuRyI2s3Z>|Fjy<R9%@^u46f
z$hMti%i}7!tQ+g~O1PbFPq4kqiXj7J^1z?3Lxy#Rr)NZ#SepW|K=?>n{8<HDSj`Fl
zb77_KB_04hx;MsI%-RAnHzQXsh<)F%bN>cfn^$+lnfdgKkkwm0E~&JaTlXx0qxZDb
zu-2kFR$QwQC-2J<5bIEMz}EHl2mVA~8>+w(@;LK$VuYe>(}7AgI8;%f*pyKRv6SBW
zTp>C?F#41pd+<r(_^EfVHPBQhv4cZ_r^4t#{yf^kNq(ch@tIz3arYSCK8X<JE83op
zLT3*0cenp=ndoRd!H~N$Rv9-32e*=F5za5Bnyt)*RIj6e(MfX$yu%>X+;boHqaXIr
z6xq58tocn!Bd~n8<`k}@utf-V(~gvBp$DSw7x>@x1U#yFuZAL~x`wZG&Rsfwn$5Yu
z^{I(X{0r0m_Z)9Ne7%xFbmuj63i})^kpp7Ht|y0&jcW34H%+azwtkzw(0S6HH%YWe
zvR)x;BE<anzDt|{!QQUdX@YL~3D(zC0%xVu*In6HGQL4Eww4yD(Ck@ndsRn<Q<H!e
zAFzpewg_!>^VGs^+_8n$RUJJojy*yw`%SseK}}Up>Vrp)7kpeAbQjRtuoyHqPjn6@
zR%tsaFGK_8OzzS`h_U<NJ7DacTFcQY&88?Bcd?u7^p1A)d7f`}Mr12TVi^62^~7_?
zVUYok;?BrREf`PIAw`C$p%iu)ss@vB*jTN(W1(|&L8Co?w{~UwrP_mjx9?NpI2ndO
z=YPs1dv0p>k0!$TEts8&7<~<@-0b^VFnS&aECQvH`H4XRmfi3xN3gMWGkgdpZXV_c
zVp`8zcm~`m?R^SVvc6+yGIE%Kp@DmGjz36;-_|#KYb9<#Gl;4Wvab_E)w+EdKcF+M
z-wv|<Ly!b-%gr_agLhnMEtAl&^g97U1H&Bz%<rc#J={;F`>;V~)!D|B=u0}ZYH{xn
zy86I7BItK7Pf5GKi=viKAaCY}PmRkO>ol<PH5Lx<ndLylu0HlYI(l|JQtk4)G~?)X
z*qFsqz!yOeKam{_obPq#s708Eu1J%Kx%7ca5UZG3JUS`X<^90mHucf?MO;*DUu&c?
z?qO4lv<{xs=5h%6TFJo;t6Uh1@-*3M%EK_#K5cpu>(v`|qr{V4cdVHgr_{;FrX!$C
zwkYx%Yi_Ce%!7CjK!M-ZuYx`)2T4uPoMMdo60)>it1^o{-ekQvGB7MX>942K5j%#Z
zeYjO3R}tMG&Et3rD)LX>f+pr+!Vmb*<>cbgkImOw`-dK!jd#~pDeLT7Hjv=Dfr`ph
zqM-nYBI^T9CUCB8g3=EdM(H76;_l)H%d$TcK9A%h;<D>;kmiP#a9q`<)b7!<6)B)W
z=@vhK0?dBi-j0VO7b!d+LhhgdUy=Owk^^TL?*(cj&JYRVH^oMXT7wvLkVcZJQG(mO
zk~P(zS+^HHtvyeDa<@Iz?TxdY>QxnyestzeaR=9PUz5AeC2on1)LiZ=L=_S3JPIZZ
z(bF<kC6~ReF=rcmgh4qU(k-(d>uZd%G;4Vq)qy3^{n?-vkCs)dg(If3vljvZMJt`U
zF~gx*+;fCjPBa}CC)|jCN4e*4b&hmhD~;-xO%~NM;aLAh!py~`-H#{cO-8XDq{zdq
zu%nwDT80&jo5Kb%d$2eY0%zY$QW^L!!B7^$DlcoZ@r<3cqsL1f9C1>#wX{AS3wZrU
zpS(xW0(>H-$j|e<1)dkPryyK{e!h-jUa^;+stJ{I9|mi2x@tvS8yW%&2xU7|9?wIn
z+2FYE$-AltDhn^yEYsaqJp5SBN3+#TLKAqd9>J>5_R1lw@6HBR0E5)fE$y4<k<@%5
zzX|VLkalQ^266%sdu?3=n+%z9KOySU9GPF9-T_CwD8eqGrCZxNp<ySOE~tHYxB1!q
zTw&3O2k8SX?&DCddwefU@sx%qUF|oLGt?wtxZ44YQV$3`X@2@e5?G?=RKoXm(UuE1
zm-<H$D$`0eMSDM7XA)xSm5;__D13+I!nR6$Yjb<~rx-^-jGjk&D+UaEs*TKnYwnYY
z0!QOxTKZPH#lDgJfhC?D+ud4kXFuc~avyt=<zIf)D#ZozADQ?1=9?oN%}ixJqNe~?
z$G=qLYnPimf9jCWyEp%Hi$KK}BfmUmXlbeXvw-_~3mD|*_w8^ni(mNF_6VCofiaPb
zMv7vl9|)GuzW49TQMi8QlndS<$oo;vp&9+;M)T(Q^DY(+$gNp^p!w32%sJJI`S|+%
zV(A5@qt(t8<}TKpcDgfX3Wk-p2RCLN!?E@1G824Zy$mPI<iNB#Y2Q?JlxZ0;!%Occ
zXL@)5OXD)FwKy`UyyHWCV!mmDWU+tu<rC&3)IT$>b@Bnc<UWY6h|*={C^uJn5=`SC
zdpdsAXDRx+2lz5mS~{Fyrn*pCSar@_uN0WL@Nj0vqh~LGQtZLKAMh#f)I7B>e+b;;
zIEEI>FHP%n^8Zf{w!F*1f52zo#1`k3Zo7k3B4fNZ%ELjtu(*A<*v;yl^SjHp;X;}Q
zBTk2~CX|&%EWk;nbYtKDN40SdObR;N`n(@VZ*==<b5Ao!@jw@QNrpN0_zsj`NZoGQ
zVz?ebokyxgTLqIo45{KYr}`Q5NM6v4y7r(lp_Z-xJj!%tm_ju}<(P5$o34wf#JZfr
z7kKyg%iIe*Q!53(u(Yy7+2i}10et~tUqA%|;DmaiRz8`P2>sX}u#%p8yNbNTI+_+*
z-3sxuK5Ih`kawt>k>ajXB5&e()t?HHuir18Enk@;d~*apda)ZN`E$PY*ZuY37Rx)w
zW&;&4g-z=(0VNH;2L)cwuMD#~_7OiUtP57Lo7T8aUccGr7`Na(pkr+Bi&+Sgr<)|0
z*!w<n6m-7vqjkGxrFf-pi1}?MYYp1U<{U}cIvcu2V?sev`kB`!XgiqF4taRyjy9<1
zcDum#7N5D|%nHPp)c!5)E!a;5)fYQ$O~%+LRB>iEP#{L#sdLv!Bm|XdT?#bdL(rE$
zm;oJlfAufk!(UW=ZbmLfYM2n94nm|Tov2Rw?f4>GQ0Lm4m(xG`F8HrxvMj#M)DfG~
z`=cz}F}A7(mBAbIpN<!_;OPcLRGQk)o3tXGNA8M`{m?naEPiTq@~p9oB<DV}ls2+W
zwqnpYFt19QVta*^?|^ih_*kHlakkTmQtMTU>V%f8YyIdXTqbBlvFvNYuBu1zI^hct
zS}1#jK?r><-{&qGLl*%TQNJf|=~YA|p&53nf>m7=(xygVpc$k0`&Q$bZ1>c>jQH=T
zM0->wQm9YIQ;<`vY{y}>P@^#DaXvBYu+s}2g80^5Q*hxJqjWwmK3N|ea7MiyPkH;P
zr=E!jjgZN>3)M4uvI>b{e~CMH2J(N9k8PDxjs=_K+bWAsf68{D1I9AliDgru<G2c$
zF3k1IHY>^3Y2r^^)&o=&8$X2KP>`H^C?H@z9uLtgee`7Mh4&ND#wtmAHIYSQ>rEb9
zmQZ8Ww6czX)@@lR1vlEwZ0j$5u#>=?{h(4v_RY~svcpLf%`RqVu}$}|DR`rkYe$Q*
z5_EELv2%^QLgQD$PLje(<r1cC-?A6wMCtT$;r!Z|1<pV{yT+Sddm86nAPitFIeW;r
z2kqIl!kvD2fZkXu-7k&@hkdsIVa5fFbX6aGM#dMgbfNQUZ)NDhm8P@8A$sz0JDx*S
zreiA4+Vg0AZ7coWC(B2#UKG{YGne{7t7!KS-D~HvoO}ArY#UeKg>W88(|l&quv{HO
za`GqJ;_2YVWv5a=9Fn8eJqUZI*FDl52)kKILIwLEERY?vR)b>}AgLmGVrqA?WLtj*
z#s>boJOU>mRnzaE#X;wRZy)6m=|&efsh)}D$K%{iK7>uvS;55y%l1sISGs^e4YoI?
ze#P;`@Lk?u^l+{D%z)ynJ-oJh1dn)2p+{JGt03@jB$b*S`SD)#Q6sd5zz+H&QB0_X
z`aUG*K}~;n{AYC(T#CY?5`i?CxSX@+=n$Wh7lB?_6Qa`XhjEf_;`<(c3{M-BIS<P@
z>VN--Jy_uNJYYl)I!a@KzsU31N>qDc=u2C0z<<b5EzmNiJW6(HCD1LzG$no5j%Z4f
zG(R(`#bRwyd(}_K<_ML;b>Nu=+0pgkHUOVlA7I$blX6Td+R0L_YYwo({{X4_kj*zL
zG_$MP9kV)**cgw;Y1s!dhoVU)@8(OkL?oQtz2C|f98ArxzVHqi*uK}T0rhWFB!4zz
z-wk%#x|i`gvaip(;E(m;cwAb#!v7mjGw?L;e@&rRV1|qy@$1a8&gQ{0FG{L9{>C?&
zc)KeV_;%2a!R!<MNY(rmhId4H{B1<ROV89&rn{Z9=*J1X>D_Ma_p|D^A&fnQuFOHd
z?lHJ+R><u*M?l~`el&+@d<QA_!SR`~o*qlSTk+j!-k9}!z@_P+WBoh9meNc+x{+`W
z+t1YMlbdNC;>9}#lcZ|FUyAlhCC_{m4~J(;2cPjfP)``sEy0$a_NtmQ8sCLx_#>2F
zX7aXaCC4SH98U4BO;oU_uxr%Ft3>&dVQJcze8LwqP&j4w4ydwYZk}cj-GWa&CuZD7
zVo9-RE&uW^CW<n?_dJ+lK20dx>I>+F8wym<qGZA%7Nnz3um9H4c^un)tNM#<!AJsk
zibnW!udF9eO5`Jzfg(rwzY19^5kEz`{$V4)mnJR%p)?Z_cl1%{#s|;^kHl|xj!Lwx
zj%xiAyNqrKKJQj=87$Rr{Io69*6iOg_(=6t^y{y#l{cdYAGJvyFyw8Yi$o>V?bt`C
z_X%}9t7iMF=dq!ZaaVV$vNaA7v5Xxl<g2^SUD0AJvNf#-?dHKsuP3tSqp2a1=I_sg
z$LMv|1j7atNEnSxw;OjF2)6>nYTKWc!O`#-6|{4yRRaNKscTo-mW$pv#Fm;V#JZhi
zSA(N-u)xDlqm6#=gzIXTFzt(o%})svRTpTfh^O3Bf&$gf@qwQ7LrU@z^dTpC7A?e!
z?+&r|z0!&R4u-@sp{oLd<jI5&UYxpGiB5vj`ZO6@Ib5@)01%?nM#4iw(S{ih8#LV!
z%2e?P)kP`N*(_hNicz7!u|69}KFQ>WDN;m*%mZLfDQGsuuY_y=oUfkB>pA|piTYDZ
z`kXssnG<IBSz^M*(D~1@GjNyU_H%HH1o5?B=Z{KrrF4_W0TC|cVb^|MD9*&OEb6g1
zeZF!cVW67jH@p4v7^cg~2Ui(h;)ktndt%pc)ju>c@9q_IA0%!OXuNX!E1n#@@LGMi
zs9Z2TYLuh^S8U8--zqss;rs)w?~_&1zptI~I#j~R$&N2Ent_~KFthxsfPFs;E`}Ju
z?^Yy~&uwWB_rkb}pCiZ(7rFc5QVCV*lO<iM@+!}DPM-vBBrSMnJw>zN1B8e(yZBm_
z@|ecTh0tAIh8O@Y5q4^ISB=NC1}|QmN+|vNCn$_Q&*zPy%iZ1hkSw6sE*7AqBc7H@
z_=Xdk&&Qz%xQ7cic8vFT<7qi>O4F*wXc)<+#dIR)4bG}V_Llxf8MMBo$U?1becpCI
zX_5Ed%YeG~f}&3>DFIEfUI@Z;%$2GG@mc=7#`@dqFp{Q<T_eb*?1im2vDX@+ycEUB
zlC3QPo#&UC!S%V~Q#^Dw2w6LSYW+>Fq8DU6O`01_P9=8aZd)Q)7ABe-k`Y$S5TDQ(
zMB73%gTd@3$DD2MRm;qB_Viz`n!LSmx8K!y=?ow4d3<zo?>$1*|2Txm!3RTfvTe(P
z^NR4bfpJ&qrP}Dc&zSaiwx*Pv0(^ZzSPTAh^NrJw3`W==<%eA9g!wt+POvjEJOW$>
z^}npl@md*EM49tDiEeAuo%n7wr9s0n?S-qSV=}9++dumjbLGJBtt2|;Tm46x4^zwY
zd-3&~s+@Na)gM*9Uklgsobo4wa)5Q6vl(}G$A9@C+x+g+s4JxrN==QZ`R+yRe`aB-
zT~HvL*{BNcj-yPQUxQb+8^3Yx0+sOpU)qV}`_5CNksnT3B00lKfv23Ta`&$BQckU+
zuvMv6{1)F(tlZ=-uQkjJT_&9un0yx7$vNjc9k4<9bE-BH-e}f&2*jx!mdmdj?BwYR
z_T5AlG4Q3GtUTM(8rao_uGR9Jeu_cXf0FY)BSoDh^bmI@pMI$?^2pX&_IRe}P)>as
z-wzXZ-1)1ox2qi@Q`-+KkP+*>xuicGy#B}x&C`Q+7jm)FMXCs%k7!o6w68YWQW$}q
z4wn18o#9{D)<0m(A-wyi_NJvi7c)aa07fIVLi$`PRgVSU0h4mHKNEm#@vdX;s~`5<
zYVKa2KVf|xu89^q&Ux%&ueQUwr=^L`EY)V4$Mhx|I>m&<A)I%=wo|G71da>){yW^g
zlnVNOi;$jn+FA?QxF}<x4)1U+1uLhHT_u|1wY--Z#$Aepm4MAlPOFr>79UcQ_Q#dH
z>>NnbeNIoi;T?yZ^{S^tPUz>%i?M*4j_TZ9;=$E5=kxP&lREooPeK>vqR6cq`lwWr
zDfzuRjwt6X{Rdsz2RqTODcA9hb>w68WlZ;^9!K}XyvU_tf$#(V6{}~h9&{wRJ~b2;
z7UB^HQ8rP35mS;qiR96MXrp;7)N4<bItGH0zgMY$`=@||{;9JHTFE63H5|GQU(5<R
zySoe{ekES)yFzHvnFSTT$*P#1C=Fy#p=Di>H22%cupQj(?@=4_+x7Y~2OFnF`EZ_K
zH+VoSqQ~)bht8x&C*hyB{P)Js=Q+KmKk5a}+c2JcTkg%IoL9}BuK4ImMo28fsLwx9
zJhozsLjw(V{j-go-fW@ijy*h6i7K;;49R^?*HiY#Z;PMZ;vT7X{O{%wwpO{=#i*Ti
zl83f#c&Dl9x)Z;psYcf5NqlF~$*|;Bn87NGCOTiujekh9rtDKAaZ&-{)!I@alIoSX
zZ+_;C1lXdGQl&u1XJ8~PRPxG0^vkfpe`vY(5e1>rvF%F_$7!yIr=3?t9=7CDQ#Myd
zJgF*-GnIr#Gj*%K(Wf}<k$-%pxW0!b#eLWe*)|zNPl>Au)iJ%Y=Hb&LsSN~Np!eS%
zC}&mRi>SE{J-#AtU>WJdCnFDdEGy!m^b&|0j2xxH)}5Lt1-#D(^$0b1<Sxx*m6UF2
zZXCxt&40q-Wp?=U>lDlf`Te&aK|?~}@?Ia9YVR#S&G=%FX~@g@o8n>QXEtg?->oY^
zaDq(yJ}REfX#_2lF#ff;=kwad5Y?x%$vy-cryp%Q0$$!$Uz6htj@@(oRr(*g;`O#6
zhrVAvJSg>Y+R@0Q(tY|vg5VX0AM0}zBfV~6Fd){yt9#eo;x9%@9|FA=I2+s%w@o&C
zLFV=?X_KIBa$(=COdoU>TK+}i+LQWo1Wp|SIigJ24*s<43`DZ@z|g4VJ#e#3fMWfn
zJ3t-jAYbW={XZCz!hd#!%}jfib7jth4+kpuo@8lq?o0U_=rxOUuNm-F5Gq5#$v;V(
zUdt2un@`M-b&lm-Y_ZdbjIiS<3Pub%rJ(jc^U+ZYa^qq3Y>n_l@Vg)%U$N<7!w7fn
z>R;a@Cb!x}T1IYL`WScI+#2UN?{+tz4FsLQlzWM&v-!ZISfzrEBq%dYFERIbZXeU>
zCGzr@v*!+4zhHU(9!~=W@fSZMa`2s7c19?wt=?xy!Wn$#G!n{2KD3tKtcNm>98Ud%
zE1{Ln`MyhuY=NnKo$dQlq}JZYK4SC3N@5Q?ZhAfh!d1XKVM?@Wq8tI^V{@qT&xj-m
z#pnSe-Cx!%C*iH^r=H2KsggsWy+3YSuM|Ce1P@b*PhB!9+BKay1lcxK9pl2rrB&Kz
z_QBWDVnfMuAe(o$UwHtY2BkUvCj0>q3a})9?H?a4*4Y?;Dp6&P;jIuGO>IJ6H4!kS
z(SA<i2=gfA;&p$7-U^LC(R%UCf;Pe<)`wCK2oUms4@imlF<Yt31%#vGG37;PaC-%+
zc1r=Z#}WMkMT^Ga3A?>Hgzm|WE!Q{XS|7=<R6|jO^|lA;6<rQT*qlZD&47|)fyO+C
z8x<Vv`qJoLLsB6}n{vx$9M0;l`eMtVcPNDUz(;lyolf9&oJ-AassRrKg$3DuJ0Jw#
zl=pn~%wI)UpJ+K0uzlm-rrxpLk%CA@veSKCNs$7VJhbz7?&jj(Vy1?%4IaP9;WgBH
zAf^5MT2_+8UsEj=yS&YOpqeW8TWk3=$xw6}#Lp|ut1(#4S<&;G310G$%XC-w4O`QR
z&RI+tzRbJO`wbfv+QTuzsf)=B^N|4mq72G3=a~h$@~-ftOhw9|&d>H?eYxHOhBay?
zq<AbFuQZl=yyEqSPEYw+NBI)qYz_fN1vTeH9%~O!pl>^W@ac^>qw6o+`*y#Ba<AGQ
z<pRpx@KMlR#!&ZtiQ<OwJrN~i{^~OKT#^TWt#e;)SmBqUA62^T7`kMC2gUL|qQU==
zb#9b-1o;vhwVS1Cw_;8y^>6|oT;Da{Bb$WU>c;PrFCk0*h<N%P4lRg0$*dq^<R?z%
zIrbK3Pom|pzBHMlysUgYJ+MDAg<<DQ95-TWjj6K#EK_G$l1m-332V_`&^J%U!74}D
zYt&6uE!2E?F6m>?i(mQFyW?|vZ&rwR-c2NBq3tte`qO4Gs9ngY)`ze&)yZ^Ry~{=7
zyB2@XuK<l7OO2{;E|Hp>QZOF@&2|nXOD$_z9Sc_>4Hc0dI<czTMJ-baejWc)<ld{6
zTPs5#;6rjRPg-8t!4^!!XWTgUMeUz{Eo_&YP}bwFff;wy2gkZJfd-aV7VG^uCOrNw
z5ZexLJy%~pnFV;q-;x|Fb33R0ADYfPEUCwR|CO2LqO#m#W@cq>O>tJ5zRS|e+zOgo
zGFR?Z&dRNs3oWzKa^S*=;NGF;z&%miAgG`?ey7jx`u^j2F5n!FTyVzo-1qBdzG|t#
z|4KXro7E*>i8IRha5?{Oj!4MQO|&r38c&IP?^e(wS`Hz)q^;*$`+$#nx*t3O@~Chr
zqKfvKuAB)U07&W3r$Yt*J&pv6r3IFD>-?I?3k}A+OeMQgIzgT80Qo3uFjOp1`_4vX
z1Z)x9GE0(233G*{2C^TV*qO7A=$ivGY2F>qxw{6YPI#HusZmjrWW>)Uc-!!Z=N1C2
zfBYl3(<qaZ@uYQ_pWoC4;}hvYS?1?egsE-~Yzem;bAzXtb+n?pe)?{7a&9&Wt}UP3
zZ5d5Xjyuw*<jJF!2p#9P%q0%MfyZ&I_AivN4TgnK+4zw8J32eG4(V7<{5xoUtMXoz
zP%IhJYxhF#>p&81a~lvCQoq%Q-U`AkqTvJZfuufQ<x+2g9p(-{|JoYp=zpGI03jXl
zBeA>{$hp`p+j(}=YH{<_4gJJN9CxDK!~-87d~XN44xi|~c^ad^9c_7NzHR(YT2s&y
z^S4&|jd;aD*A~l-Cu5rkcoEGgQ*LPy&B$bHZ%0q=0duq=$Phuq&(jm7st5_`{9k3r
z=$@s&I5hV}88Uu1r3lpi=4R80J7CNE4O68kwLjL1`MwIkur)7$t?f874#JdHxHeW^
zakf+X#+I`MXT}F}V%>2@UaTF}yOrYM8PR|G{a7{aE*n4th1*l6xLtUF<?w4Zq7ZQ9
zJns68<kb4{w^x`OKjJd=@l?SRZLE(>b@2zOx8vUhCKH$OF5lR`noMU*=-ck<FT;D7
zY#f#5<E5-CWImS&mT+600H58HJF<xomOHF$Wt!uf6X=2P1mQ;AWTO7QR|Ni2F6c<|
zYVC>Z&=D=i5`e<d>>`s0aD8xzFT05WyPbL#1W!)Tm%4k-?9#IRMjs3kPq-r-{q=Z}
zj)(qoyLjQYsP^qSrB;j&;g#xDQ=PNY59jJxvAf!iA)iB8YIM2io18$LQ_i``ye41a
z`w8pDR7C3)J{4*n`Ehrs$iaBjQrzW^iZ|M)|D276!P~ZO3niVY_P@1r>PyPF>4he_
z`-Fm_9ujeUvr<xb#ge+9KjBHR{F`me81MG@*2VT2)_ozQ*v&L{U6>=7B8AQqQYWyu
z!E9guRk|H@kqxG_biIN8jcns!=($c46c}ee6Kc_0wu?##Y^V~v?0N<nEEyn_YAX$U
z^b0zBX|}9tNI*_ca3;4m3Vi?{C`7ex6`!3;$sG!r4^JZvQ*V7?U&5T4>DB}B0hDlO
zj}a8x`AvlbICcpBpnt6m^Eu!_gyt%sgU&D=UA`N8WV6S7)|a0#?xr3qtCSRwuAvdY
zYx|mF3mV+o^ABY;=>B&^;El*NaT&b744m2?TIA$8q)cLiAIN@GX|xUvFs84Rx?P@Y
z%?XJ|-yN-HU9xVTWnX)dBkvMv&3T=`d{G}w-kOZ?fXVXL*)hZP(14ax;{(qTimP3n
zv_+9=20To>!oj^hmn>6KY(FAX9q;T9q^Y&{G<61X{;S4ftd#Og;^?8sDC3X*fPbVg
zH<dz%4xzF!mSy3(4Z-{YT4L&iEf^yNH8V*&)SGT<r|AI+?a_NV{q5(zRJ)L6+Cnx^
zU8;TrSkt-{Z(vj;*poxb8u_&E<DOtRTY;UF<WR*+jr<mnH%s0=q?h=HF0yM=j;O#f
z8XR0R&gFR-7mdqtweQ}w_$e1^{i?7kHZqA6Y*O54soTuV+pzIB#8nQT<bLvpd6PeE
zmDtF9sbXZE@26qC@ATox<I(ENc`5Quc-+>hh0#3n{P4ubq>M}mlv8I#r$Jd&;8GOe
z0EPW32{r;~wM`+(9k<1%m|6K2a<7MQOMj(KBjqMIg|X1P#D*Dp=_`VJf;0Xn4fh*X
z4?<>jCV%O4Sa{_PL<o2Q#C5hfBoC*;)%--voLag&Nof{eq6~@(#Ih1anpufW>svfT
zky04EAcG$>u)&aAFBy6~iS+J0nfQby!R_&noU^@N|4PzfGf^^kHxd>&!DQj|Vz=??
zlFouF=<(m>2cn)b9sC&`t(>yK66LE>i<<A$t_MqalB6bmjDjR6iP=GrNuM8XKZZQX
z@Lx&tky^lzu8Uyh^y-mxW^i7T*@GtwH`HeyyLZV*e+s}5gbe;wc76CK1t*gcjqi>w
zOx_@~N!x?}0O?@e<#)M#&em3T7TjjDi`LCzxg9ebQruGQQc-?8;#EM%!8nj%`$j+(
zFgaPN+_R%ygCDnjJSF)>8Uu1T+4Sb3S-ds{57!AQjAycaEN(mr5OaCy&-od{cx9O=
zdgppt^aUuS&qK&^>H@9~qe%|Y3myn+WVmi8whasY6`%3Pw!Hs=8NSBzG3MG-y&t5k
zlZHV38naovAKr)GhA%SC&(Hn{dOtYJTe+R+8$09)<Xj$%&leSgc;mctqYp^ow5Vr}
zuBvN)j{}{VTfFNZReU^y{56b>T=RL@B9>y>u5@V#qNjMG?2Qj^Fu@qh9ZbobRLxmV
zsoqB^*7_p$34{IUmDvW(oi3stE#Bv4F#}B!9tRrl#P_f)zca49)UFV~d}7mUi@hC7
zhHuq=PT2o>K>=a9Kz=r(5Js-e(J%6MIX&kUXY#qJ%V|Y~M-iev($*WEBtDD(Yirf3
zmMD(!{)K_{suf(%?-*}qD6XynJ+Q`m=c8UOr&`<IC56hyy+Z0;`yTKvN|Q+6ug7cT
z@tUu-$=59j`7Mb`207>NLHw4oQAKvhOd!5;+N?)TQ`}F=uTwmSUkyZ36vP%+H5!T%
z@hXG%Mfe~6v|#s=%xJZdLWxhg{hA$wT4hop*yS-D<{7f_1c=zPF}7v=_Hdi{qUbp-
zY$uwtUC5<(d-+KacK16h+w>&@)`dZCLqvND{;dyZpPm@jh}?f++t|rXgS)}6b;$o7
zP_x7T7f(!341lt&{ZcNx^f{#2>5>{@zUaB>z6^iiXYCjbmd{7`mZA_w{F7#vsOA;h
zs83kaeP9osgH88cIWSr{WP{C0=%tsRF+dls%h5Z?qidwmQEU_M@=`r%SZ1#%Ok-Tl
zuEuVSP;pDsy^G+#;qY1|nDe-{dUo>{;4X~4;&91TDMd*+?~fLkfdTfFJn#tJB8|gI
zve}$}pKDPrbE@JvZm*4_3SsMh?w65#!sNq6_%Br-{+3^=>G(|r9RXeb2`$^ot^D?Q
zmRX!)@BT0oFE+9lzQqLtf6b<!19Ejh{os)1{m@GwvsZlnl%|mQGV#n_IFA8t{rgAB
z1wYTN#Ek40W%j={bX#;&ka1n>x3s(@=rHN<u~c$mN3#kM2kMn_l$PWHQ`VW@LwGYS
zAcyBDC{iuxX<a~q%y##pnsiY7zlt@Z&1D;GNHymTh^(LWo-^Z{(WRi&+gSBi<4?`B
z`t8n(c)|S>L)l;7iK3SHEEX??>RN8Q_?xu+s_w!|@sFjc4x5s8`k{G-AW0friGSs$
zAAhae<#q2H`SPPDeO(CpxTg@IB`u>`m~Dq-8xS`6B9-xjWiW2<>F!ql=-hjROD}_S
z(KxR{D+9nUD3ojM87}<m*8U4rolRps{T|4(TYKDc3qSqCMRWF^GmAh3KEaf390Hdl
z>Y{%VLSE92r}r)(KQKN>rZ?PVpbDjD-#;~p(6TL^Y0)Zap(YhS>y-fQN*|bKyPS|k
z9_%&+F^?gwV%tTVNqemF)(Wg(%1C;>QME}Fv~iIqq<D3=yWf^m&)`6$52>h?0J$v`
zdc$V<!_oLDq^%O{b@tT6W6w+m{7+hV0_4xwc#8KkVq<OuiSge3Aik?^oLcwW`a`a)
zW!hf)q1l47m8kWHE;YiBt$#ZOQh<&?{KTJS=V`7Arjk|#sfk8XtB4H0jBUJm-Z))n
zp=J*MJB}@`LA<OxvYk_2vEMJDt#*V&N2tzHXfzUivuu=<t=d}qnStEX@Quy#?|eDJ
zPJ>ZDsqS9k_Qp{{Vj>bAYd(g5(3zg;nPL0+Bk;kai!my?GLlmg&kq`oX7WOBs4`tU
zV{`s&NY~J{&SOnuN0;3<nIlvtC9z!hGs+QdjNpQ_SG}cnUnRX@J(FdAeM!5zUnN_h
zWbP=W94zZy6?<S)R;4ClMoirfV6@KPI;7DAtvjBhdAI>t<J%jYpARq#g`zsq^S`;o
z(~+(Lv?p|zZ&TUrp%ww1=U`7N>mkS+xUm+miyN<T63f!;9VA6qVE06wZcUd%>xc3u
zn-^YxL%U9iszqB(#~t`#Isy{ff;R48RCmv-)791U;Tur~Pmz+#$pc>d_mq`W=D3zc
zczphQfl-|o`{HzFWZ&L4GDQ=Wbck}Ne2DX2`S<GVQBxid&z^RT0da9nm+01c>kA~d
z5Y7DzseM9x9R0A<nJ3uOFE?ed0I#n&`em$O&)lQ-R~)DD9^5wY<$^QDI6$V?_tP+5
zg~YaF?!e9&0f>16mN;IQH+!+l=lsg?#~tZDA^sVwUHV7#qdyW+V+CwFA)iJozjjS9
zf2)CCtvesuXF97fixKoC`zfi5<r-K+E#@8s>yqEg_^aG^?LhnJ{P%wLg3U-?GS8B6
zx+Yk$j-ndx#^02gq|lD`89qDGo4~I(PM7H#HL1WwI~$LZ#!RT~(Y49_UbE5cBQvqU
z%Iz1Yjn?rLjT6VmS5=iIcHa9-Dz~z!^3qOT;`FG91fmOcD&w>!zdMFDj5V>DD47k6
zHT`)sQ&V>is%FQ+W;x{`i_E@|vu^F_EiHyj$JhC;*Lz7f&Ru?WADWI=p`8+hHa(m0
zPj`okVY!3SFQ9^TpVrp>aS0(V#%cT)qa!9w?oRXl=H_3!y}ou&6fK(Odw<}pCbQpD
zZ@KW!W+Rs@AlCOxQe+HOyX$^muCQEfowC6tx$ut{;jj2fZb_OziXorie2Pw_)?{o*
zXT6T+`viW?PuY6OfVx&2dHR&z?xFOZU#w{T$lC!vX1`wPj&iK_nXyeh{Oa3bn-`89
zmzf5Rrow7>I(@Rc)f>RJn!qgxI``M)Ae$z}6Em?4uP=9?^bRXhLMmjD#cE#OsWjE@
zl@BVO-g;*8I|-Ikug>Ad($y}8{)~^mD)<=4@7Z!(UDglF;r-)h@W~ygv354#<=ZE>
zVrdNri32N*9)ZJ-cZdjEIb`HQ)veZ&QgXwV=4W@#3W!=kvV1zLt*bn;__<GMsh}EW
zqE<IZTLY*xwu1(nJn15|4N&R7bv6f9&aJ?S8HF)0^T1e48pgP`j{aliRcGh$pX-{0
zU@JpME#cZaoOc(fwk3i4i(v01+%yo^BdM`x$9<l%D?d^N5PU1%UI~91MCn;Z3N#G=
z2;TT^GNAFjEb2QlGWww8e0}pcUZoF8gg6P$CX1;NSQk`*k0$fz=)XeMXyi&Cpj2`8
zCelZ?u_2JYqa)m{RF>xY=Dwo808--gzxF}!uO)r}_<6_KTJ)WYukia%3h&#m??Q}U
zL4U9v(_0HGtq4Gx#@4LSxL}Z?`-0J}qXF_Q*R);u%DcfXi<5s@?`(=}p$Nq%oS9Sd
z-2Dn?Lpi@+e*9V=of;n6wyQ6~99(?`*WaX#g7s8zcto{o7kX8N`{7#ibR!f*V+G?d
z#1L0=G#Zwb5AD+r^&r`8aUgb9W724(K!Lwn4h{SBi`hX24QEzG44K~8F-Db2-vvpo
zd2e&PS!LcrvCP~Z?&&ELEZxAziwMv}D`ACWk9a9zuBtO-8@zI)4*M!O8M~(-h{udN
zm*LlT9ZuykhZ$lFg43UQlb7&zkgL_pG;otQNHmt}Gz1>%%cx+;c4TIo)^wHO#-@6b
zf{Hzhs12kAL2Ai`Pd%Fa_r91?wr>0K-)rw>*+PlOeZ9yM_x0Z}{4|h~)Gsl{?G7+M
zM?gW|mmTJzR|c<yRXwR|ccImw?PeAt^Dgqt(8g$fbECihoFmzez@-IMQIOEKq`J%F
z4i#wOfgGQ?U~L%uGffn@u|GyN=P0kCn40dAxooV@!AT)BsF%ZkXev~-RPGBGoP>I=
z$=XrA3zhJDCV{bI88I}`=jin^{`@sXqm)1A+H&T>uM|!Zx0g8@vm3u8#ND39l<zKg
zXDq5O@Me{ge&KP-XDZNQ@n!1&mN3s&P%Tw(OC=%hAlN8JbjQ30af<fz#}{XwqbW%`
zZVvo=TYe+M@ad)q@TC--8qjnRT+3d#OOLkQf19S*LI2MbK_k|#DyGM1gRKp5!$tUS
zuCECv%d!2x|Gn8A%84<UlT(&eCll}f_(RK<!Kd*t0g@g+kn?Lb2b+b;=MS{$TSf<-
zK2eZM%~#klf30P<0GW{9P`R?zKKd?`=1->%Jc@g_8#!ju<iLB#>9DIv$TrP5j7QU!
zTje`~c2z0Uq7*qktX3&3rY<K~;&;gpx5zr)nMdnQ)%W9xp_o)_Ecb0$Z?d(H6rV@c
z93EgqCFw;?8ZN!6S99-546HNB(Hm)X4AGCHH}|cWXTStV2Z9ojD;`aKkV~c^`dsVy
zs}j(p%QFdg(su;5HgZBFm+m+CFiDip!)=%D(@_B%XN(E?LaZJ2d9vPZfmZxoQr}j`
zN#5D4!mD90fg0j8c}6L@38!X~^>|&;<hU8SX3i=JE5)~_gV(|ut{eO9n&Zm@t%%%*
z#k#+xu%x*Jb@MqIx!yP{uu^Vg&P!e2KPpU>Dju5BE5B}jvN!_(qPBETW~32B+#pDY
zJM*0<4n2I%n6iffsFP&Z%VYrG>Go*e&bEn-kfiazX^jMvq$Ji7i$Lo0$K!4Y!+=Z5
z`9?h~;Cx^aLoNP%5(G(hKf_B&6m?Yr)w=Ac5gHG2Z-PCCoA)roa3QpLK<w2aILD58
zYYZ3^`N7XyjbJz@56#pileUBlJz(C1uE@HATqu0fM980F%oA6%4kL)DQV0e4_M3$w
zh$jGbx2_*_H(|Wa54nR|u(!Ie`L+zomf*kmxIu04!hv9K^HgVs?#ym-gl~a+iA62V
zrv!1&soOV8%}y6|(cwHlg!+8_S@rlCaGqV;!qLP+?$^L;Aih46E|B`B(DBhYE&V#3
zX4J#LbPQ2RsTf^R5Z~53`mNqf-X&>*SHIrpajT|*HLg=i4K5-HAJFGUyYIcOlkkmH
zpBn4V4^xV)9*HTJZv+mFHnUkSPHe&x45c^^op25slhH@*q1G+?N0rwPP&^(PdxGt#
z0|yOI2P#DVi>5fc{FkhCB#P8}D5zGZ*gs_-TFii?PFDqs-_z7x5;3Xt9BXM7n9Z>o
zvTGRe7|U-Fs;F72Fo;$K&ws?2s85wOZK%=Td{a#(IXbwErlM}zS-_+qF+qLtTjgt;
z6X(9Dmvzz1``_FOu5BPrcMhocPeo#lr!Q2)7m=Yu@*o<?X%1;*bEhG2=^a0$zkBfz
zH6;%k>U3IU-G>0dodv4<C4ZdTyr#nIw5DMe)`+><&5#+14?Swk4sQ-IX$`OM;oe0D
zHAQKb<C8-R5Ub;&fvyo8Gj`zeF*pv=lUae!L}Pa?>l0+RGrRYR@wTY?UM-CEGRO3@
zUXhly8%t(ms>1XnF_L_QfIUeKovXnN(Or5Ez@aUu8gpCU{}C7eXAZqEei|@`=3ajF
zHFfD|L*k=i@f&4-%#wEGOx2X1b2e{HIsP=%ywH2Ix9LNJ4m7h-@D=Ky9jdj|-YR%$
z6#kkFM^0cO2yextuN>dO9gW-y+&w`(Rl@4Bd$-VthJFjR`2#*rIW;+pzi)fgPx8wL
zAa2{LV1>F_Uta%C5Px<^^mmV5Vr!SB70&x@WC3DgR-`4b)6m%Yiirtiuu&_g{L$9!
zH@#{Rp07cG5O29BXtKxb#k$6S!E=Y;K>A4sZK>W;ll@z>p*FN!nHCM3j=Ou{wI`zc
ztFJDY0a<-J?MfL6kAj<!i&m0~;1!OU)@6Kh^`Bsg>8u;aHt}frqrgaSoR#%KwK+nI
z6P;o^lF2ac4xA&yySScsuivqd(R&UVOozdHnX9wK$2HFNNz+j_h;yw6+741R<O7xN
zlB8g>9bf*nX%l3roZ%15EdJ$m1iwY3w4;gjKQ<#YtpEDPal#Y+-kh^pkA+KJPTx@W
zjy<l@Y6=TUn2f$raFR?a-44;l-eGk)v3;2y@+vItuQG@)7zo%BI2JPAL~>y~ojUtZ
zwpaVWYD=-BNUI`~@Tj8VwEP{H{zP9q8v`7m-+C3R)$awQ!@qwJ!m=X>(4W-omV5yW
zpAtoN64=`K!td*DX<<gkLxf)Q&n}+ZaI+M7xPQg<eC%h(f=|HI4AGtQ7F+d6E-*=@
zd71gfnl}#m{hhV&>9H8Q%`wqb$RqI0JnS8>gWdlg3YvsSgmxy?{^1N({ELV-B)9S}
ziKwnh<NW<ZV*~Gx!k!HxqT_*e{c+(<u(h3|KU*@3?76V|+0hGkl)>^H@5m9N+krh}
zH!nMOW`->~-wA5tE3Zn*p6A}Su$mnuHS+*qOD5T~r<$bs25td_#vQ2*sdI7FyG#Pk
z&#!jMr8Rq}aZwJ_KPY+)nG|Ih_VCQa6!EPDMh16gC|2w>%pw<GXPE5^jP(AB41(>4
zDGvVrX3sYAxbOk7RPZt*v8A??bT@XqHj&f?Eaxo4W*VY`JENvWr<1x!i7#6%&A+e#
zw*%3KCU7ZJc`kKdll@5fy>979*O6Yc<kU;H3%v)>SOVVDL8Ifw9$A7WLgdW@!TvU@
zU8ic>#|8EMtWOq4c(E2Gxk&<mrTuhV2(Easw=hnz{2MbA608DJ%l@`~i40}54&K~e
zxp6E?6A8~ZTpk>oTS1uTycC?1s^-d@Yw(Gvw~QZ%s7Guy?272H`PPa!<%TBsd+w_S
zeKlV0uD!jdD)<UNz=*=OG$OrAt+1?s2XW^gpR7sZ-edoD?C4J4n5Eb6-cv@gw=T%+
z9UyFKW7Rnp1AggwsX(pNhkrn_2kUe)2l-ys-tro$@nRvuyB4uoXB|Y7$L!trNN&N$
zfw#*wJJ<QwgJYUlP8^OubiiAaEItPD^3Kc$>jUT)%ZGVX&NJP}#ej#lUzE+H_fdaG
zyLJWw{Q37dGipIz!>xA<&QSR%aFZwO5x*x{!j%9J>&q)I0GV<~<J}WPIP$?yF{&IO
zRnc7tl3NRv3-3Nz0j9vKd%q^9@8~!@)%}#;-T+e{<W-~<hAOBW-nt4^czyW$#{~l)
z-#2Bq{q(&?r@q1_+R9Bu%j)wW{9G(Sw!XSCOq|NfFx8bZxt_Bxf8J>cJ$-2Iz;~~A
zNauK<Q*QMNsP;^S<g#W}u6(&659Hm;gBV$XN#Qu9*XKcIv17A9QqgOi8v8PSM0x@w
zjKj4>*_=P~P2ydG0s8o*t5IojO>w-Gd-u7p#xIVAznok6Do#&;Mqq5V$w4oD;kK3J
z@Tp=|<lVCRcb`Y6>Zq*I>#t2iivwQ>g$BIgq|@g-WQZ=aB8~}pBccg--*(O4f`=3R
zstchv5%NcKYJ_Yi3)b?>BT%v3h(&ldyx3ScxE&Ss2RYnmjI&(RAJP>iC(7gNSgPcx
zRvQ`?kAKUDH6!F+3dKcRW?#6p^y$N*DsRF<3qr0eNOz9-Ngd@7P@nea1x5M9j*sp#
zQj(^8*RMW7=RgamHSO{C#}$ir@l1{Wof<6Cfvt)ks#9rrhXgm~Y1_0*Yc)TQRt6Rz
znKdI1V%J)V@@RN|eBEgF!xoi`|NaF7RTGPObI=lwK!tm4$o!uD3Up<s;n8W${u?rN
zGhR?uP&e+xhkNJWzk}V<Rt6xo<9v$u2K4ET9JNUS+~p6868l(niyelNNfG`hTW;&l
zd}w;Ya)`1|UtCr_x5&(kr5Sl~s^{dQPyF$02haOU;)rWc0|(x3s=?Hd_So+p$WkCf
zt7NOdeIqSD$tym+uZ|1IwwLEgj-K=ue|lS1_DeRc3J33cvHDVDP5-Nhn*eGGzw>Fv
zrlb%{^krZ3q{H6#SuN;DjlB$Ex%z}Jf}(ldp2}+}+z*rZVslmWM(2)4P}F%)M(o!s
zR5Ohh_ucb{DCf@o1x6AE5}okjM(F-!t&uN=h5Cojj}~08Kh;_$Q~8E?DC`n`(1|vq
zb*~&7*&1J91GVqIwkO+)D4pNNJ5>6{Ii1PpQ$q&#*O-tMKSuW+)BXB_%@z#fiQ9+E
z1ivE}SJF&EnxKI#h(nDa?MU>o_}8;fo&PT^?~n(sIj+T|&$cgRt<9PE-z8x;NRBR5
zbl=>)S1iFuzC6;l9BBkDbg;9J@u%&)lBW<DC_<UJVsl?pjBd`a@DLQcbk6b=k550+
z7{}B%<g^3flGdKi3wo0sayfV-i?)%NU*m0jV6~7-bL|A}ea0*tmFjq^NtdG|MR@#G
z&h*{lKWdO6Ts2^cl@?^L{ULwtU&YNnw!GMn=gzSLS+4!)P^i%;ql-|5pC|CSYqLLA
z_<?M53^^@$p=QK>S&ka^#c;=9+LCv?@e^iO%uQ;^`>XAf75JQ48(O0~OK%qy>6o^Q
z`t8A+W7UQ6X^`IQ*%=7l2<glVz)BbDY#X0+h%~T1*1-E_`3N|wBZik%Gp!)$sZDx4
zV%Vy&)Nr#VJqcSM17H)fixd9FqKxrRZbYapXCCa&m*9<mXP8s6?7$huYT>#o&<0g?
zTKzm8v7>QC>huLgRV4pCT*A)*fDtIpx+k>0_(^4sF@8UUB@j~h0drm{q?qPutOYCB
z_8c|ur#Dl$6*s*;D=9v@?e?m}(l&XKV-pTLu&z;kc3|Cjj1u!>7C*FZ40fer|2x3j
z@gc40$K%tkKeqA+_7ZWpr2&PjE^qD_7>fp<Iy|$Id6OL$G3co0SBOE{AO1E0x$E?=
zrIFw(fBMbicJx+GcFXn^Zae%!@5>`E%q5_gqu13+Ev&rz-rpiO-qo}VnAV2Y8qM7i
zs+vvxa={L#2%zS5Bh-+BQ4nE=UV9+7s7PZ^2Eie=CsVqM;D|fB`0+|#lr>}3r_HT6
z=KGfEq&e}m33=@k1{fOu<D3JcGV-Tn2CPU}vQOcw(_c1i*^g<nW;oL|NuRbxb3HbV
zd`x-Cbc_cD85hIb@~f~5In~N*W>U<%fJlI`>_38z?cK2Q8+FuB0q;Iix5FTNI|9MG
z_d$@uq(H&YJyD6B#DyBN?q~UwLKs~%CS!6e6}}GF)1~TYv6cC({$_t&F^c~Po%mIF
zpSm=+ZB9pJ*Zn>*h!{`Ow+fzToLI_j3XPz0dE#P%H{$EXWI&w0dMhxtX>DuprbqQQ
zL4(MPrf6W0UwE@=E^GczWLHQ08}7)uK%}L0f<idmQSL)*0a_plolP%t=FQ8JtI0Ly
zc_FA)Vr<|E^pS=EeY%J5*x7YQqL1(Etn)fOwQ$(}Od}(RB2n$|mfMj;?Lr1+o<tmr
zY$xVp8V0P&_I)UDr8)`2nL9oiZb0fQ(B6soX7c;~@Dz~v_R{~2_gIMU$z+3<C}BT8
zO5$9JLO|7~hlwEAGhq^|&vo4CfzNzcD~#x<T0gBA#KnU)Hvr4!gw16s%a?WQKaGx#
zZKtA#)#Dn1#sWX;I8S${M5A5MwX`9F9rMkN^?Pz^%(<E!UYI+9iDBoIL<P$t7)b%H
zA3}OX@5i0hy*(!|wMCk1B1;vida1C2+JE7VS5c}|8M5`O8(_Je@oazId?^)jVvG!E
zft(mvepufA5oF!1>No|<Qgw7Z?H^h!4&oDT^dl0E%<YLqx(!v^%W*10P({`~exE=1
zto99K%t3g&YggLOBww69a>t3Sej@W?45Vd%+lRJ3odGT<TRj2Gt#9(>>YUD)+IWUk
zcP^Ts8!jw#s~mrS_A)zg1a1-s<U@Q<+5-T_@hUUVsGE&?Tz*1140y^yRQ1#^kgMj>
zjT}Ta+iQT;rj67t6^aH_O+TvC^8UP5*go~X?CzDm4lI12PqtEmtX1qedA~+01-Wq)
zF_0A@3uIGQeb@@>Sl*c7&2Ss;VVrP_EU7vd0EtF=m#?0w1H!LLZmK<A6cMKu_xB9<
z#+@(sJB9IS`Y$K7gR}iD(!0_ZEG)x%JlqJ=YcP&IFi8zyJ~D3+a54*c>n|KV%fU`J
z@A=Er%TSg=U%g*qaNEC=s=?{dc3ecx7c$;`aGc}s^+m?v7OIaW_TkUusI5Ai$GfPQ
z3)sv2Q#i9?cAp1K0Hc1AAsH^jQDfC@R;*@sAd}D2mnL9Fl-(P*eVh=WE0103jV_n2
zABJ~jBuxHJoAFu_ommrm$sW*2K>h__46Q!7L;$%Uu1?4sa15K-1b%Pv6bso7u0xmV
z%#Pnfg-d?P4ebn5-r}1(SH%-)WitE~ZR>NvLC<_%*K)MToJU`@{a6-!9D~x#KKJ{|
zsO4Sqt#{g6vOVVe_|F<S?k+XLqH)n4xL0Kl71craIQ<bwSNu2Py{g`8a6V!`^@@dq
zr9_P?0x86IueGq4_=;lHn<{{;%BheG3p;LQ1DW-i{d*?m0O$zCS(WEthC2PFTNdNm
z9c7R*l*AdQpl<hv3eS;Ngets;tK}N2=fq$;1mBL5@|?I#(C!G3v|J0*yFMX3XPyAq
zrr36>=+E;e3mD<;-q+xNSmN|RAN~^!iQ+j*Sd10-HGfJJSVdXk{5<nL@Y7v;!z0C=
zNKgDU0!B=7x)$0uu^KQ6muyk)|F2>9e^ojvEC_cS@-7thwr#>?O#TZ3){D;(KO_ui
zwR8F<gojEpcD|L(sXH)Gcj7om1BcxTxFx+YgM&A#0<i8}=!A^r=6KM}&>0X33yg=o
z{s4jy8*=ImXFtG-%%~Wzd?;SQ_G0ueH(Rna%`HhF5-Mkx0s*i;XzZp}x>rrdU@7Ba
zH-s2O>q+!dz>=YCSaygbUb@c{N0%o0p|O2l@t!3!kPaVD&S|(|+-#3Czq(87L{~{W
zH{J7>&fG?8Hlw>K!*Sy-_TdF(sy<i_&a(f6RhfEyudS9+$nxv0yqn&}c}lQEpVzP~
zy#GdaVVObhnK-pHz-8yA=v4WL^ZCr*_v)J2US8+$0XJsuhvJgli)*WOx*oHE`1ot9
z+kI+A;`hd<J2$01=*%e%?GGZebS5b9Yy6V*AI`1E>KXHs9o^Y4y49}};XDqfS4A`C
z^C^;)OHYM~88V^~`=e`K+$)8<CC@S*c#;!&u<K_l{>uR3N&Zhz=ko574-l|1ULbT~
zBm-zrG#6+&dmOwhzNp~I-9<|KmIS%VhgeIb`Q=PB*RqBb|45|Ki~EV05kxls&d$K~
z%YTjT;Q|#V@y{1*c5-zHA{Gq;^sc{0CNch<TyZlBugyeBaNhuz9N9<gR20Lf<HoOU
zhA1V`F*Z5Vm{)A1o8;|H3d2YV;2#{fQtILdGzTQU7ly5Wk?F;U<pvy;H?lqD{XNoI
z4HQ?j6mK4$rY5qf*IB35VV=@K4OOa3MGMSl8IcV04um)Q?d7E+S%5!&>Uyu)LtD;6
z7q25k<zM7HrV0|O&wA+cEJu1tgm`Ixc>Vy=oYA6Y*D)3FyDVOP=|$d<?NyNf&jEX#
z|M<5Ka~}KP%3fm2$xr62!E!{?B<GASJ7EP3L^bbU`gK%^c5-*aCU!K~5}wy=^pj27
zBSQOWGgZx){c%sScp$N3Jl517Z(2O}LuU^^e@`?v=Ntu@?WEnFtaF4+4ITffBp2wZ
z>|cgWgI%vJeQ;bEW+=VqS1!&nCQRv3L&!HBB4ViLGkxFd8J{7ZjAPK$xaO0MJddX#
zTmxsM%#y@@`bW2jwI~9f&J^Y2`?iF}qA$*G(s$km^xtr3$baS~F)gI(ZyZOfYI1n%
z*SWo91Ea^dQ&bQEbJL;O7bqXCX|VUfy?P-hhd)#H4`w1a04oPNJ~wRvJTotKyHhJ?
zD8$INeUyPyP(cyVKEGx03M0#LyyJmt+|xq+$K#Dtj%73*1+)?%s-+dFxM^?ds%pdl
zPY7o8*}eMILWo>K{qkiwE*pv6J6Qa`ZkQNr6CBVI83~L!y-8hxVXuN82)Mjtgi20%
z71&Dh<n%>#@D(60FW}r*V`3j1(Iz--O;J?>?KezqZVy>J<heppTzVdr%l393MS<om
zIi@$rZ_5BAC`HYd^{Ls0rJ@*WdZbs7rO7va6+T~BDNNvBnHi8y?J`R{@bVMS2R;AB
zea?LZ)fc;SGmoPGnvVk}tX*f@dNJ=Haizg{vHowMbs1kUZz;^;UmZ2WTKsv-qBCS;
zfS6$(IVqvAf!><A7wp;(+WRQWS9cw-+_a@9rt!+kUMB#_d`mca#xEH!<63Go6-@LB
zz2Tb!$r-5y{SlG>SE<m3)43jy@Hw%?#(9VKZ(LjlL*ion?Xl@FRk<Z+teOtaHj2_s
zCFq^uB^KU7su^JHzOYITE;7I~|Fd*nIe+^2FVER#@X@iY>$mmsZw@OgQs7@4p6k6{
z#VYPyyR5Y)rL}fnvBv5n<p*PV%2#`W6TVb;`9-_blRS_z1EMs@2YI2*C&?5c9GGj~
zmU5uC$N8rb(eS~qv)k9{j86M2Uf&z{z;b-Y9UFU(btBiRPDC+i;s!eJRVNX|TjAoO
ztwKwDu?t-%{5$QQIiB7-p{C?vIy8&s7MbZ%DJ`h*0CRNumM6ofXeVmBeCH3Y`{fLp
zF@3<)K5lO}Pp*Jc@SJAd4b5{%#Ur*Ar2S_~L1G}Ys@{kHv=Yh=$MTj?6NU-;&`X(k
z=(chi&x22}4tiH!2rgCNxDen#TN1i^B6Nj3QYDB*g3eb>IG5lV*=Z@ka;l&`xWSsD
z9r4f3_+|wawq~!!Lq(<1z;K#9c&4sCzn5Mj26Xu~J}us~ZLdJ#v&#SPe8Jnd4oHd<
znjK%<`qOY%`})Z2wW{NeZeO&zDB*Hb$HcM-$YC)FcR2jAx0|s93*1D0F0wLR5NKEt
zshG$>u`wJ%Q7uT0KQ<pLbLcv%$F5uOn93aT_rHQaA+#7@90ggtEnafgu&=uSMTRp4
z&vXc8gUjhC1IS;kDo<^Ye@_ya(gOe|xL3@csWu8J1|v)-16^2Z7Cy=VF>|&J3-KR!
zU4Qua)i8x@_>}A%jeBn6m`hSaB_Xegp3^V@q@}BHzT~X5r}i;)R2`swCp0&0&g0K`
zN$fp)J5^scsCLmyLisiamcr=^=N0^%^gXn1+V-h%)<H<t1vX28p^ocV7zPrRK<r2R
zc<ehyps)7skH(qqY;#MjrgX5ml_gc?f7S3uOuuYba=f-dJgs5B7A(EdIe_pg4#6oE
z_PyCJtz13Won(aUmnt|s(F7V2x<HTY9qilpwtx8%gWh~Izv`12@7}*KIy>tZKg*uy
zGp&4^1tSri<8E4svWWk)KI;g{gu#8t>K**=Og>f}sRIs;aKS&WQoQ|e()lA#l@!xu
z5|8GFP%iQ;-b`dR-`T5y7~6aMZ>ysO1oUBV++fXxj&xZ2>uSYuJe<Gwt*<FG73?+h
z2Vq3n7!b*FThxfI@8Bb6+JzJ|1UJF?d&Up{lnKlECJY7@wqUX!78#MENh)M<p7F4p
zp>uRp_@3+KfD^0Q%+!gO7~@Fr+mLVRGbPqDBLT>%rN6h1sA3gqrccH9>9cwc(q+4i
zX^*X{A=yH~+b~%9HQhIzJ(_j+eQ}lGH_q3OPoq6K)GUEm)A&BE#5^KAqq^?u_T{<a
z1-4z?C3qGso+3o~;C7GPFpJNO8zn~wOsk&C4qK0oO*<k_ziXGYIRpaQ{KOkRhwKoG
z*bKz|S^!?-a&W%C3Rc<|kZ;}iALh@I)rTFp^eG<M5^ydw%0KMkxmZ<pj!7OFtgvsw
zg|7OZujLjnh*gnxY@kH{1RqZ<Tm=g~X*i7(%0-vXDDGge2<nd`L<oLpf;-0&Hwx@p
z^qZTc(EZM!jVf|e$KG#=BNqt`Mvde_lkO^QTRr|<ANq}2+JY!>I)(pOs2$bK`~3M|
z^})fG4e9;T$#X_LIN_neECHjm>Uj=YFKKD|-gd6czBP}Y*wom1u9~lZSA&1+EVTYU
zTEcxL#<wlK_~8;ft@2u1y<BVk%Oc=MEIFMjGJW}ID!ZB+ZG7O#5vnhrw@L01^K<nI
zRopk8@2}4uJ%e=JE^f_@Hf}*@R|Js9P0<r;gvZae_amsUXPS%k)wnC(HPvs-Zk~f$
z^qx7xA2GY>rQ(>nH~!XFtiX&}&BES2`I?{W(+XC<s$2FwrqXk$eEfdd`Hp7!a7TJ)
zkn8)v;?AxW!yDpJjc~`Ll)?O`3o+$h^<}&f@0|2_N<EgbWryb+`zi9ySHjNnW%<uF
zI27xV(zA>B(0FbVCTg>qQ<I>b&*aODnS2xANgm%btdcn7+0UIucyGm@lXm^4yZL0S
zL?^Bt=wjs|7dD+>OPq^%u&*vd(^p%?mnEc=!|iY4(teF<ER`8*0YbTBc{n}tn#o*}
z2Z{KS0j<e`MgxUxeo0M&IvxXCX0W;S*&)u6$1nLl2#nAiVBdW74*zqP*U6yGs%-ZL
z`t$8O9wwE#S`yFcB7IIK*Y9ssj}H{fKLe`VrZu}+<&3jN6vI(sPC%&LRd&ayn=ASu
zCeTJMO3<AV)YiDD^z1o*4PrF<?I~pN{hU7kMdpay2e;->32NullLmYv3`tG!w9?1h
zLS+=Tk}H~a|BCj@?2|xRBs5ESYI!l9eVLsY`UInhWMBS{tqy>Y&F$~TEc}F)6nWq5
z;JSSm`kqXha6jUyNkyNZ89Ph>CY2t%X8;d$;|Hdr<Bov3>lF=#!>={oo+{sRu$ilL
z$Cb+{KU+oluXOtc41VFpRkw5&F2e`%Irg<f*WJjp_PuXV)z3kbv!skg{`iFD;{H|e
z`jVN5u#m;J$RPEKtM&8fbNMA-10=^AzjJbJt0|8+z65(h10n~TVXoGE0g=G^D3b`w
zbk)hK@Qm+BF`gyP>f(m0`cjt75d87NU~|oFL=|RcV?>P*$9Fv55|&^?juhIv4n;eY
zBlXdlhbYRk%u&1_MB{n&MUn)9Ya1!m!A*oJN1HK;P2(FO#r~bW{5Ot-wUj#=2ZTC8
zUpw`tF-(<eayfTI)-<@w#B~K|Wm-gxav{NKs-tC3iXLd=>BA@Hr^x<z8i>tVmwQBZ
zacaj7i2i*jEa#`#NMKRFy4cDVTufPwNWi3-s78`HqS2Y{StGTforRD!9jNOn%5C>!
z?ASz{#=uW#4>SqJ2Evs%vE1j4I80_Djsn9WtMUPU$HzMxIhk6_jux}PYu-XFnD`}v
zgqY2NPaBmWrlTjlzQ)@`{2I!*-hM2dyYv)kWh;0#AodqNnMK(-s$k$E=zKm9fjK<I
zbNK8pdy5~=Y`f!~4E0&lIF%u*7!=OalBl&A79~6hi<#8n<cR3vxQPb`i}yzhLf2Z9
z1)v3xNmy3H)xly_pEG6CY_+Z)3pD!%lJo(l=@7-?NXeU_2S@HRH+(*nv1nn)I@;C$
z1##(rIW?Wob(1|}#qfNI`jSW*;nMXmvF0G-NR@X-=B-Y;Gn(z4do+etEas-^j)>08
zej)GHq!wdwukZ!o>9Zq~dQTKr)5UvBF5%Qf52;pYH<!u8C$C&DsaLg|`W|#^wbQs;
zU-2(}yR}QT6Mgef6GcqOgxMk&N2|+}3x}w62~rbdxnDnm(Rnn!t;+zu!*`$G_?Pm`
zo%?h%R5trE6mhur#r+-bN?3ZObS84x(qCym&rppp#Wby8G96l(&@ME!jjj6T-54<M
zTM%W)b_mwD&PDE4H~&?Ml^^Q&+Ep*RrREcf(jiv#3H<bXHWKR<HI9~Piz#=APoL*o
zhID88zc&KN(B#33*ebYiK2B7lydohJnXQrlh|O)4JPo+Op67z>cFR%%RoK5sSHmpM
zs5HJXzBzVtc;F-%o?rgRM%VbwTX)<YHNq*?@^4HL<&UDN*}O9iGbV>><Pa__H_6vX
znHKVIw^;_$YeP&-;R@4S^CB>a1#+KySFZ<p<XL4L>4h`?82uPyWDmV0RKby#b~~_P
z5ZrdbV|sv&5*`OGR&~d1cWa8aU>gJGqKA-rQ0?QbuC9HyJP>3Ho=+#(9ky+1m0ZB_
z4@aYeBdtdyTg43)fH}Tp=S?^hmdW8zX6ZW@cGqg|;aDvJkTKrfew0p;rD07a#Ly2@
ze`l`Om7j8!ky#*Kxj%J5U-RvjB{?ztNQ=wZY7USo-j10J*!W>!HhU6u0Mq|cu8rhS
zn|*hz7u@}G?xevEatch=`%<ozt=8_eE;}beWc!nd7W&(r#l@z1-Cy;4s+aH-0?h$}
z{I6R6v+yT)+C?o5XPn@o#s#MQ9b46nBf8^^&5nlrIJ1jm`TJf3Z(OWki@W@!j(b7<
z8=ljnm<3#|J6#_UZMm!Bp+n!D=5WmJ6c8sr2&MHQkKS^n58<JZ*N5%r-YCC52ddS^
zdYnQEDmlikd(pwsenN!Y)u4oVkr@2F>5?bwijJ63VxxZnP!&UTikPK~4Hq&>@#HK8
zN7#F4p!V6TLqc<Eq5@QA(BAv=+6Ai35S<0hvYl~LBf+VS4A}OK6`YW8zy^DEwE#ax
zxen)5hRxS~=r+GBwbb*0S^7!c@YBt&$dWvZhe#oy1$%?Vh8HmCxr~=6(6GG1Z)Yms
z5<K4BFwWiColmXMqOCR;BZ5ys3)S<RiV5Pk-M$5Fl+~z;ebmWEUV{ldQ^?tuGre1N
zgWr}Kiw2H*BW!He@dol1+-#k9x&>iHMy7A&JJLA5RIsx72|BUoefAWWIf#Ub@yt3|
z{y>^U9{qC9lMdpnJ>fh_Db&%qm5R*nzWS$0<zpGY+4oDx>~QZ(wvqPy#HSQ>f>=9i
z529#6#^u5ASzS#21t^>D(KlK4ctj9rFQ)yis0BaK&0#dvpd#JIGjyY!(GKgCX@kpq
z;~(P%AI}G8V_1<J9XTd(4zPLSK&WEQKI_8cp3cH{Utlk0;lP{G5$!p7zCuxbT~JSP
zrkoKnL}&Bb9`Gfo=M2(!?2|px>c;=9xj!-4(j2tiQn0f>rFm18M*t9vyx;tLjw1St
z1}jRvLUPI-wtvT^W33hR<pWt3?i<k}(N<fs5jX-qYk!qqv0I50Lt0wOIp`ww;}#q^
z=XPGCEhQc#W(YM*{}CbXH5=Tky-L63U_ZxSUt2&YzBx)tjV!cGnzP=@mTy=E9u%4@
z@Q^P(T7k<4@an<@l=jDC9S<`xcYs@2w*Vp{$k%WJu8?E20^bUUY;>=1b&<nAj3etk
z_q88++n9jqB98PEH;30sCTE!<4ie|Q-z<u@NcWyWivE5RH7QL`Uxl^N4cPWX3^pGb
z9^dNLy;CD0OG81vXN4<$V#&GIp5auA+#p9$8dC`0v*aCI7gVF!5gXsL76fNktWkP#
zPY`=;{97k^9FKms4+$0><+oqMp^X;k+4kG*Zfs^c15yx8mga!Z&zxYY%4=VV?8^Bq
z{jZt#$6Fc7tQfmUHDhA%BxRv(jE?{?n(vbJn4;2wD~H|0r{E8Q0lQ2|_pT{#`0Nd+
z^j~U4rx1eKwG5vQ!!vx7(FyN<%Cwk?21iMITn?X#feQkQLwwCrlQpO^o)0TC`XF?}
zRAoQf{F}G(9^NEW(qI3ZcVZ~yPz%UUyI8!?Qj1j6#Z@d<-vZHpXH-lCDzPIIq%gEX
z2i#_$(<c_o_Guna?M9$ezgO@eanoO=UA=M*^<*P*?12GRUfkFO(JK|O57#ehS$_^V
zDt0=QGpwBb8oitP-botXb~%cEsaz|4h-&*LHL~|sa-p=~-!tAC$}mV*UbY$wxIBz+
zVM1USh_sG#Zi_t5;nU+1?rnwL$n&|niu(VhLi%g^KZM;z(2kj__(;9+Yeb-5r!>P`
zvuQ?p6(G4&BaYX3GziRnE^8+mmg;?ps!78pAx)b{jr8cLjpY+Y$REbj%=H37*1RZB
zdocW338o-b6@HMnZutrjKV7N27`h6~QGZ<Td;KuW_Fbp=g;EH^hK_3W4w^H}<L0q6
zMSJ2$e^R?555Zv1hdW`^6M>R!@Ke}3o?vUF2j@)$OAAsGGzv#(;rwNCXIj&d9Q-yK
zBo_jhYl-?pM=T*^JCxsGsiI(j;q@NgFAv*N{S<H(dxt_Nt0E$A6iaW)N`ypLoM%cf
zFyq=)EeWTIci69}mNW`Z#`aK}1!ED7=q5phmTI|xrM_B9IG(Jb8llDyrno~T4+&E<
zS1vh(^!j%a(t*;h<e`mD`pyGeYqO^o&iozS<zJ&b;>>}3mm!%F+0xse_|Jgl9#8-6
z-8<21spm0gkwHC~UVFVHs4oz44tqz;p`@!z9^K)A<-xTE6~iM8EAqE?B=<>U;w1`I
zjAM_V<dBWuWjp8}Ng8&$jDQg#dxQq8Sc!3%QX&5+9uVj)r(O(fA^?pFeG!9+Ph&=m
zjx=$~-Tz*hsn|a2_;lt5_~Ng_BWgn)KNY14zW8CfN}<ixmtrK*4(-)kBJ^bNZmHTF
zB?UED_x91oT{4l2IoD$$<1k7jSgr!p;2>S`g{ysLZJa$8XjB4oxBI<kO^R$<FB+WG
zfB=*?X9roJqghdMcqXr+q~kYspJ{=-V^X-Yac04E$K*-uGO?E*CXItcO1%=~)R_*%
zaWP|MID_8zjAEDZ+y~8H9n%rwa&hVbyKs`s?tSW5Gp}o#-vc^}&JvsrL*i&hiZ2MT
z?q$EH-3YbYlv!y_4lPy-*sA((3oI17UCckteRDcbEg<eNW^a66<IR5-I^*5;L0a4J
zRB4;XXnu6iuyibh5hT3_7&kjwV~PvBzuFwUe<Q<LS+I2~!~3Uvv*H(rB8eYq+)n1t
z#q%9fTj;)DqY+k)l;F1X1rC#~uCZD%)$?I@-{>vCb#}33S-(4-<sS}j5c;H9pMHu~
z_+~V-BZhD|x@Erq4a?2P6Pbm%&DRw9q_?Ew7RhKQOjmXj$pOmP+Z^?IJ9fFPRCgaP
zP$gvT^S}mEZ#&Vf6+$fhEAf(|ND7i<#gf}XA5%P=4mSEje-4&zNTDmc>$7X)4M{$-
zIBlMs`}>&u>5W#WpdvwxGVMUp?|H#Po4Fa^aN~Na(N)K*=+0&Gg9c-7+7lfhFvlig
z2=2=#emJox!57Ij+QrZh@;ngiNXvsxL^(X1Cw@iJv0q3kL$JbwTl=i56CQjt?T)^O
zYU!tP7%{Q!X2S>OEAW)9eI3}p?I1z>a(2A|u8^kwEPq{-QcH`C_N+U~wB|(?>0(yV
zdI6#yAVb+4`SvuW`L~;DP+Z_Eqb}X*@Zidq604}x<3bij!RW1z7bMszkoCNmg|o-2
z&KnB{=QTMk+BLgNn4^K)3M=Q9lK?_Roh!KbqwEy(S^GiPpz-=*j;aHug^Tys&5*%O
z@7?}uIjccX3Ym#lioNN`LQm`>O(bz;&(r>JulF@s?j5fy-$tN3=Y-?-%yr`w3*tJ_
zq+9FAZa~yI>Q76Zzszh)oJt#if3ZD?f*k+q<E~FeZdUcD>1@p2J}As9?uI_lbl^T3
zZfPE~xH38)B<bLd%)Dn9Vjnud{yXH{9^(~3O9#fXH073g?;|X|n$^80_IBpkoMt8M
z!||jCTuoe)a=F&q-#*OFhJTQ;;<Bl}Y=C_wme%HE7?P_QZONT?8H;8k+8R$qH%=l`
zdhR#ZoLo3QviGy7l{Ju>#7ga$qg7-5J;^mU-FR_$ekx(sgGt!a#FMoE?<v$&9o%xG
zNOTnyi@%)rqz#U?u5?6e$3g>(f5lV=?U*0mP^}mIaE}+T=f0~-1je!^nJbQ`o$$fg
z(LmBLHKt+wCCI-NHHNBs^>D_e0<J#lxvBj{mOFcmnw5|g*jG!C#u*iRaqOcyV$0;B
zw+>RbWu^U!zl=U>y$Q|Qiqqd9s?nf``OB^`Js*T_f|JBGj4LIjUUodo_IidNVSr-O
z<PB`0^(}tR*IjMUJhAii(3qq{#Qo4PTBnj%<orRkVQ{b4$kLuE9oHRangxMVgCsw7
zgcbgwT7*2qbGs0pEAeL8NEnB5@J_IWwmrMUJFzOwCK~AMuHfTbo`Q7neU)n>^~8rV
z9Fe!R&Z*<4-D$%0WY;irT}O&1dUae|Nya!<=k-OhNW#%`gYBS2B<5vA=u2{1<TFxt
ziof~oaf1PlSh9%Hibd|>C7}`(V#pT87<h2*cM4|sIB-+a4;DDcHDz<#khBHN4)uJ1
z+2Qi%6I@`%%;@0_$jkfr!y9MR{vS=}9?#_e$Nfq|PDyemDJtg>b1W+=A^AGwG+B}J
zVa|-4i!pMRLr$q2Mw+uZn;hnB&gWB3vpEbK?yKK@-+%4>Fx$1q9=opV^Lf8tujeaS
zR7j>WpIp8`)6tUoJ(9Rrb<dajF}^|0*Szv*Gakw$dYw#mQuALj4%;tQ>U$h?&?%--
zBRr<+Ze#gn=OsL{oEHEf^s#dJ*Pe!!=hHy-@Ge~Qc+F<0x%sVn8yinjE{cPb0hPvp
zsy7ss+J?=&%iSVJm8o<TvPGX|+(LHyTFEK4smh`Z8^YLF%3q_rtm>butuMa;OfeMc
zwKw;V+2u3pe@FIYasXAn0hFrOgz6>ZTBBZW(?`#~sRyUyfAPxq7jbmBlB_MY8y+AY
zSps?6kxU&;g0J^U(j7yxcRtHKOT>FvH!H`Bd?INymRWREf&DtGSe93~hx4D^kJ(il
z18b%@I#RW&pSB;W-AD2Bp0P<@t$jNJf&uSDsLItg@>~g6Jvk5$l)#vQcUe|0zZ*iH
z=4~>0a9s@MI@acMzj<~BHOs}^Urj!y;k+Dg<&Qrt4i_YeGzibZi3`ub1o~zCB~?}*
zV*XyNeE>KHBe&0@R}<{oInvx&KawxjBvj<B2=vNuZ%Tg{zIkjc?e{o$nFGq?Q&Y(G
zrz#|+uDLqDxtrE+i@Bqrg$A)h-UG%ixK`-(P&#^&L!`|rO&{;E{m@awQY7D!_bm)p
zdZxl@6%7FU;5ElKDG#;)O}@|#t40w-`<#--5gJZu0Zeo*jZ2K(pg{wJT6a%=#9_g}
z|0<AHp7-rnftR~RmidZSo@Ab^8zW5duXbWc(#}9&6^ELP--bq&(#fF+Vk7PwbQAvr
z-=RoY6Si>adlM|>vArf=dK91)?q}q>d*t^OFXF<!9Fow7Z}I(7+^wK_|9O`65*$U%
zQAXhWt$TyGlGNY6S;9n0-9qMm&N(ivodxc+xJ!{5fC$xC<7FVAFSpIz6K;+pNtP8`
zd*nG(#g5GSZ{>ZQ$T@!O<ELMk^#R2^`1iZuy+cl=vm6|rg-g$;Xr2!^J<vNwt)R-x
z`Z<S4Sfb0d`XpFvIE8PT;?=9y;-ahsPv1j>`dv0=$PZoK?eUYqqiUH78k=l0fs=>c
zOve+f2wzrcmdr|!%>C?&HWPltnlA2HYfF#OPnM1cb|$HA+C4qW-nl#IbcPo_Jqljg
zynRIi(e)wrFQib4%N+kfw^s^|{I{SwF`1k7MY@)QNunwt-(mT1S9=f<UGr-7DaCc3
z?QH;T&S5#5T}mb7zg5M04GH!R)9!38&uoM43wiV1L0Ef61ZkNp{eWon1ctQ0`u+X@
z?Co_wqWCFt)blO6*_R-^J9PAd@N{-D252@z&&d~A>-uawvK+8J+_(rd6m^>n0Cd`e
zA1szmgC|W9^1ro`X-}c;L`z<+m6hM*pQ6A6sX;Dw4K#J<QFd7rhUYnduiD$aPoJz9
z-^^59UDr59bHL><VPZGs@6P^~VTt87Zssj;mD|SKnA5sk<145ZCkw&E7-I#)e!LF<
zfF@xEsxI3wjSX!|?v-pl&%RL0ht3$Pstx15-VN^@cGsP~tfwQFlPr6TZj-N4Q&o&|
z<M+?|ym&pOOkq7{1OvL1mG0z{*x@z;>Uoxe`5il$X<l+!ixg<b&)$5!rR^#y>u3Vk
z&{J>6H}x_4UOmu7_cuSG)4DC`(c|f`(k!#+e!e@%^=;wRT`&*O<>#Hj2}BZP!u&?o
z@Rq79v(T5Q8E|tg>n!v%!r6;f45I}V{8gyd+@tq*T(9n;_$h($bR_FUZjZs(Jp{wy
zIZv-r8yjT!ol$~-zrJF!`%OS#hx46nBEX;poMI*4gvU>$BChnfm>x-Ue*D-r`1{j|
z=8l@s(TTvfEbk^dzGSP>ThzFcAU;<Ut99CmhvTf{GgbKA0a<Djr82)J3z;>)2<Od2
z9txSA9TqQQk5ZTDS0nvgN}OdmnK4d#XrF`!F#UBnDSKz?=e&1D`DK^ErO5~g<7A6K
zMfT*YP9V0@vThRUwTHPs9!h4I2c$n;Z>zA5E{`(HFh<)lw&YBH>e^Rq;wrj=f@3*-
ze0Xr~S?n%QY4&pqy`xJhMtQ2|@HcAVN4{s5VZ5+}0Z%lG&+;F_&w|p?^QijMA4P{k
zd8lw@Lc?#JXT{KEoIlb94B=g4dZ)hRcC3nHw){}D+dzAQ=hKeGXHijnC8&mjC5Kpj
zLbM<W$@dpt!Pi@*M3GXBu3d-M<ezCk%!UmK-D&$NQ&r)D?*0%Q!g99CmX08j?yAxd
zEri2*7Xx4Mhe_ZoZju`Bal8vOYCp(>E?ES-30@H&Hgt?u!i*+SV~72ZD4mph{<*PV
zXTC&E)uVoiUXFDZ-FE=KeV4}pf*rrH?_TCjquR-DUih24>oLlinXV0fQ<bbKZ1$fD
z9@PSz3@IvNq#l{qoRk^FxK?ZyEvtR3Zzqz^*FT^9WqA$W2Z|)4e2*J5+j3`GZ-0?)
z|KjgN$MZZb5~20173^$sS2g6UUjzB9F)tGK7?z$PL;N@RjrywGvSH3uUjX>a*)8e(
zTPhOO6Z6%ff4yVZ2xnh}Yvoo1)mKuds^*1)df0lw$->7OQa;i)7bQ}Yn=^jT38ip9
zV*GX+HmF4^ncm-q!JqW=3+>lP4xl({vDOwn(E^#n3_hJZ5vBCC!fo|JNhe((l&SCq
zm+xL>lE>&TH6NT%uc-MPYkA9oB@NFx1yZsYxtcMk#p#3-;InD0|FN{jcun%M1ugjo
z!n`E!04O!4hF4JhCqS}QQf7F$`%ahSOV>L`oyjwoV2j7s-Se8XRxr<3BE-DE4Wz(F
zIyISQ$BqA@ZX0vH)?;ASoLje?)tJ5fTF)xG&wTpjC<ZgWD*Nxb!ra$65Q=bU*Hw(j
z?a;0{fKiEzV0DxV?fQI_I=6o5fNw=h?Cc^H?Y0|PoDh9+J3#wggHIobb6Z88*5G#z
zB3xNdr@8Y9&-0iQyDYxl@Gg~_Ws}uE-Dl~dRZFT^!IeL|S7xMl@V_)|C{Cj$8I9yf
zo+L;0qJx)t$f+OYJF|<MsXj0tm+Y=_eGF;kf&;PwOpG#_&tgwa!;Z@kS0Y?(FEn1C
z$dg&zED`FO5Z;ZOM}^0N?2tl-4kg$5VS@s#NPhm^ZG0t*^W6Ak%aDv+LtNz4WJ`$*
zsVVG*wpL^E6pt_~ldtrJDjUTUw0BI2TEjQacdH@7|H7cf^rtQWW>T-;xqVE<zgI5k
zv#Yr;DrVX0z=o|Ye5W^-`Q$H@0&~GF&WD1#3N6uo<!7f>EaNkJ;orp9m>DpYn<p0~
zi^Ip0&Kk1S$`P>sM2VhK5AyQo)oS(QqIa1r%5|SlfA-^(J(V^$-Ge+4`3HNjvGL{8
z^@oM9i^_E#1NabF@lZ3$T=f$zu3VR{(LI=vW6fhYD{%P&XO~juIX!x~ldlbimuAPw
z<xfq2rU&#x%=FH|MP>~45-v@du8)2L;i`sRGC!R?n^$H<Nnf!1ZwJje>q}*dv^>NS
z?B_B-F7BGuM>x7&5&JA~1feX_*!Pmkp+GNwqP0kchGmv*@7iyk)lI-(=G||gcwsBq
zXyw`p#nXn83DuiH8It`h+&9gF3{e1V&gDcOC9XyBnGnW#zxATfnt$uZOSb+i$A=WF
z#ek(uuZiISbUAkFv&o@Z$z~4qEd_`$pVPb&3M7?*_&%?k2^I}oMy#hhH;{wrUp`<Q
zi!c@}3Aj*SxnQXFi>@!4lj6{g4Wlz4{t5sfV2iy2=fxCOYP97=cRnQ1x#%j)F#J_8
z5~v5Auoy}1Or*aKTB0#gTj3DAv7jj+5yL1*Af6Aycu5|7XT@mQK=)V1o@B`$3eb6K
zO?oXy!Wuhamw-|=JYOJPQ{vtpx@cskX+l55BEs^~9C}t%MN#O0K~FH|%!{tdz78M%
z$SHhu%i&dDqwQapy8kHCs&&Uj7Jck9<wc~77_-|v^=$j4O66KE^5e!Bf^l(r#k(ER
z{{RRu8MES8&g%G@9PO_@aI<+?YRitNK`sZyKO7*t_#ugxcmb8kO;?;jomra|6Z}^M
z_5isJ{rJ;4n)eOubXR;Nh)TQXi+%RR)E*v~skLD9ZTA7J;)>G$APEoOYXEX4GIYmx
z;)@9Rg8r0|Tw82w=^<AS?UFmm8Yw!9|IpnNu2-=OZ^pA!_vAnLQDBPugjU<-nb;6P
zSXxfFpikfYXF2^tX9s+}<FjN5mL2f}1YU`38v9H1TvbcVAX{y^9-eHeEm`H`Kp1@k
z?|};d9U{fUjw(om@au5JxBx?J-ZR4hUD1Y|G@LI|@V;7M!c4zdOCXY^<G770({KN-
z=9U;zkgNNLF%f(kQU2Xn0?~snWmMD2+V64J3GHS&obWtORc=va^AcYa2jGZ&1SJ2P
z40_%?qM$YAI$~g8Ri(Yt7pb<&+i_16wL#YrqD+(??28v<GTk_+%<l6&=)vcroi~}D
zA2oCF#5b|ll*`^B{&*&L6O>`g>JqL=wh8>66UqS2<K015sU+=OW0k8-87i_M^}Uh0
z$}_E<_570e)g83d2}$tXYVwryl?%;cZ-UFK&)P|BPJKp8?j4+8!|VmcY4%(K4Jk77
zF1)L4KS03~NQNL@or&+0xB|S0_*8dGxwttH7F@bIjrC-OZwdQtb$!C@muF<G9Uad>
zo8J%vRL*|=AfK|V+~aXvH~!gZbizNb@BlqD8{Y#Cy!GPZ!l#nP)-@XKLv+RZ<Jsde
z&CK^WVl!4maO)^lLGVk!UX@xDL~KR;Mc7r*QANf9he-cB&ofLMLFE28toTf4jKp@1
z7YVb67brtKU}0p+aQkOv;f)OUv3?+s>bAnPk@deyQT%N3-rmGp95o?TrQf8G->i+?
zwiMi<BoU~^Q)xneUp%znUAD~}gU-k2CKas+$+fm0Lp+Oo>1|qQi75uVFCX!{w^lwB
zGwucR_Qd2iK3FROX%kpx(DPLPb=dQNRR$>5>y<XDL0qNGRh$t&EfXQpYj8NfiE!qM
zcmy<O$A)ze0LQ_P*(dJ*S=61oAg>|GM_9_d{~#-Ak@gkCnSf-mkI`bHcN9_C##yDP
zTyD<z;ul-P@q>DSR0~VX6UK^-tQ6w3t?KZhU`5dmioZzj_Z8@Mm+0+1h6A)vhxp8O
zRpK9Mu8P|N_y1R3fsW4Ar1*4N(>5OPG}I3h$UI4S>Ae@X1%6SL+b(CRkI=LFX1%|V
zmJsQ)9r2)H3DTXRQa$wJVTw)99{`*-_4mK8+E88ReT{7gJ!(1+buHT7wKp#&YiO_0
zsJvgL$v`okU3-^Lj&<i+>^Bq5><^KAq~pZ~o`sKGmO-?D<=>Lo?eWsSZM`w0fV(T@
zhSVPeg5fG<0h3(sTn8F?zdQn)?ERs+yu7*cv#LZ>v5-8SVJJ+^@T^E>zhnrcHr2a2
zY&o#24vA`*v6Tuqt)&5J)n9M7Dpzaw$uUd3h997TLD=n2fS)?Y`!55DO$4~7P1rrk
z4SV*)`?YVecnDPWi_zi_KhIat6^jCFOouB@Xd5hG$Fv_O5wk=vJ`g~P+0y2@T-XAu
zm1b~sW{5!5m`$WIIMz?VPrI3HX>s_heSZkwa@84^b!3e9>?Sx_RKm+AdnZ2!-nq2w
zV{EkXjJKW-u;q0Y`E&<b4y@jug)5<^D3c||S+-QCew5*?_cI`ZNB!3jnfAZcwSZzY
z>KOB8?|j^n*~o-KLK?Doci=l51QClV8k+~jJX2Zm%ac()Lyw^N?R(yqsK%_3o9nY;
zvj)%y%^w1{L|ZuXCO1QUmDSXtPx{u9>CIxSWNYWt-mb_m#P!xYD=vvhMS?Yz=y=GD
zif>&pm46FvZ}p}9EePI4YY(1g=u7o}PqW@w&DRbq(JWidXQM1W8|N4UhPP!Ym*uaV
z2012NdcdD<Bk*zMV?<9gP7mWsH4+rY9BC|X#7RAtm_72dYSYI&X#CCh(jtbYQSLt?
z=x0&+Q30qH0+hpv`o@yeE{fy_`)HH;cgGRL`zuCqg6@0Fi)f#2uA}tb3EF?v+(oEC
zcB?<-x+ZYdJZtxrkQW!$$YRs%b(6MtZYRXoy4#tw{MGr6YAA^RJQHQE<$VlH#W<qP
zwNf;@qR_jb%oBSvYi@J8lQ?Da9LH8omcY0-gXr}W*zeVJHTm%RXZKeo>9^qD1EjDn
zX8xs_XW(JHd*n$S_-%GVX(<1}TzzFx-#mqq{9j%SB|fk-jX*Ga6=ReQ9X31`!Y(ae
znh@1gtj{>Wzf!-2I2TJYR6v}o4DjXh-S)(Mf711g(v-1#`-~44zgqm4{Y`zJ8;)~!
z^+n%DHlaRxn#D6&A`n;n|AsPdhugqJJiH$K^*Nqa_d&jnH2Ke=kd&zc@x0_-K*Xqo
zHbhLVDLhN6NNaI2g<?t_6w#=suh1%#47f0mSWpZfW*Yaw05VlHGF?cFb7~CR%(pwp
z^txtlLTj<nbvRFQyJ=LQq;_s~j-hJrJL2<pF<jmMKTU>uQxul?#Q-J-X`UZWO!U(2
zeSDa0VDR}6)N?-3po3D*Lx^pGZzbd(>|8qz)I2@C5D|PkOJlaLleJ~(?$jltnZ8bT
zA<K&tg!xkBRDO3@WbtO<d@<)Nh(qAluj~kqG@R^tb**u|sa|x)_`M8tWOk_NGl`w$
zorm<T3Hi5{YnxMAX@queF@y@g@_<CsY0N#l>iRf6r{wOM1HN`)bKvJj#;la8q^CU1
zhMIp^-QXVYFTY!>bQZpSzGRVxq8u?PfOwPP?J`LB#;-te!w{%GU6Be|);Z4k{}Sf{
z7VC7tgY>1+I&aW<1qESqmS=lGJt#rz@kkvOee0-SMX~VkpWeG9Kq_{NX}rARkZ{JR
z)?*5*ltqkt0I86#9dKTkRtGa)J6zib%~?GBVq204|4yB2!DO#r;Jp5Bp+$gWw5H4o
zbN!@;v&%)yZ1?FZ9Q|i<rtNl-*vx}ez!`SCsG@3`Ns_w_yj@(Ir}38~wqbNkkP)^V
zXIqe!Vfz-Ud%hmk`%(`lOOovCGU4>?d}6y~k;UQfUfA~rlf2=lzWh3`MiMuxl_k%z
zaeSB=<k0?lQ9ozzG9!;0h9dE&p5yiK=(H3Nc(zi~nJcgz*xD)oNad}2Wc#m=!_=R|
z$x@JAz@V+^Natym+E9`vml}H;7}HNr8WfM|!5jHqHXHKJm$LP_{1UhzC=aFxSA7MY
z{PgL31c}XvtlUtZX+-_o+5*nF)+Pnos~SLaMrXpyCQ)aFMt?AOa3VI(#J6KGd9Wtk
zlSW(YZ~`dg-`LG(6p_HXiu`4<iifH^vz!52=cTT3eyuO&A;T;Q^rH3sUD`gndh(Uk
z=R#%0j~%2&1DR(ok4_Xd8fD$8=Ws4<IGkWrBgXDnKwWe#H;U1hDxx-dO*gJW7;QMH
z4h3j08`f)qoy|a6pF^*}dok1&GK=aQqx$y`%HCsd3CMzq<|z;*+qY>w-hGnR%l?TF
z)x66QuqCE(<;~G!pEsAkxHYB--Y0(&a#He3@Y-fS6jGp!{eb`1SXT}t3}jAd?bk`Q
zxs!7Hq=^;Qg2vmRt@<ZKuz<3xt^9`6PBOQy_<qucQ+QR6)k^WM(OB5(oCKKFty??D
zbJRh7b-(^o%nwZ|DG$57lb@Q)Nt&}R^O40oW`2<4z@U-Cxy`9kVfr^*6R$>BWcFrF
z)S8SLzOXv+^fv=ptu2Et;vN_NjHK?W3Cd=ehofRZgk3jb$CI^Xt7W*FK-is&X915{
zYyP<Cs=m_+Z0zt3LpiPAbs$laW;4ozKA{R`0YKv{-<f;sABN+SpK5HAtM7uareLH&
z_Cr?Ccdf<nIyRQ%^2)+f*gb;hs(&g4+h4TRj>p*8Q5$VW7-@o*93wh{Qi3G>z=y&v
zVWIDOI0Gb3JL!Zj&%5e$_~kcVkG*+;f118pr0_wQfcw`x-X&GOCu&2V*k+>Y1@A&E
zwu*35NPlyg@0|BEUCa+NUrPOl;4xO(*Elq7uV%}=qV_S~zhs8yyWr~+yGxDJ17OQ_
zEu$a_>VfnOi}&HgLlksJ!0Nl;_>WJykr_MuL2aqs^UC>=RDng!!y6r5Sf4AW?80j5
z%(}MEcDW@^wyoxkG5JS`WHlF#p(uR}>-)d>X}EAk#Uk8%HZgO988FR-8ZYQy9SbU_
zcxH<YEKbqJnHM<mIohf_Y}btqqul#!i8%!)MtenXIj6nKxlin`ZNb+lk`MNaWMV3I
z@b(y<9W6PtkyMnXK8qqXp6Tb$qjkrQ*Ao=i=J+&}E)n}K!*c)?TVhnO@w9c3dkX*a
zU!{_zTcY_%2OsaFVptSgDx4UZvG~=3D2)sCdcwuO^*qtD=}@=s>XOjx@67iy>n2ja
zGxgE<n4@)*FO?NsrihmUB%n$--FUvrf0LCvQ)6TH2)^;7o@G(_k$}4`-d%6m^C{SF
z_#PRpnuHf(zJ2!luL|lb){zboi<SM|cyL}=K#zTKN_v495W{9E2G?zNNm@Xk`G0GI
zm|YGmx`ukE>%3+UCZj(g4UaRvH56*X|3DZ!E^7rw#}icfju@ake4s=i&{f8m5=?9z
zt1*`Wv>Ro&ub6b4C?tdX#eH#ac*p2iV)rNK8<V%IesX;sK{%_Fon*|Iy9YTrSl`o0
z?enpYN%xOXoMT^+%^H*Z_L&H0I$~O;EzA-=aPr1+!Y=y^gEuE757Ki0`BPE9{>N8i
z#Gk}^fC`N)b_k<R;sl8JU!^5Gby_YK!?2%y-kWX%tq{#@sd*v25rV;yaK&4kx0%XY
z-(lje{0M;=>DK~|wMs_#>?dnY&pC;zEH%SnTD?El2Ns{%T5MQUgeX({Bi-zce0Sm!
zlzjd1#Y|_=1ysyn)F(ofsHcc_w4!Z4V^bc+Do9S4v-fWHn`LQ08ZOM)0K7Huf06Zz
zqpusRIJpVJClj6<#g=8!oyr+w-aoTo&5v#pZX8$)4J@1mcJg-CoA(l9Jgh-S4)RjQ
zumDK-){xAM(7r=7ypALH+5urr#h;3ff>lr6thSZO<T@85p^{p1rNC;}iu6jAPBLwQ
zkGj3F!xaD|d-Bmg;-U{^cx*~N!%Ehy6*Ek|+ouV8qEYTx*od95(d>VfS1#&DDJoYP
ztd^2XPT^6uWjX7#nBpKU;e7l2ojlx(I}>0tE}FBE9{?s#Gq3cs%4;;uV?`DxU3BHb
zg~|`@aP_fwN7q?iejh<wm-uu}oxhB(jY5y|&mCBr6{Z@^e<+MkVI09n)c^I7@l*L^
zw;)89<x6sZ#`j!Q;Ua5IQ$KrE#W(w|4B!1vlXqEsK8M<kdM{1iGc+&~buMh3WFf|R
z;|x`HNneJy5$!;~vz98dzQv;}$t>Wm1Nfr6n0<$0)YjwQ<q&-eWj1;$Ozk|}rFY^|
zc-kv|$u0CXM+Pu$86MAZt1Znn9B@q(?KQJk4b9EcsVw>VruVT`0z!^FB5T49taG)0
z=rCggPhMMs`Jf64iB1ja)m-xk`EUF73)ZgJEjRXafF&3p<hW7$>gq>+LL=AH?}V2I
z{hq;{x)1lsGiMd{yTk>4Rl&x+xGL{NWR^uy_N>0z3>-__w=;&?>XB{O^|diZoJ^SP
zl;pc;2&SD(U|(P**Fk&nw)W0u{#G49AAu+Rk!W^3rqEsXJ%<tKyU|rx$TXCB3;&B#
z+MZCZBr6{*;2z()r+In@^F5)p3^K_}3_Hvn9KXLu07ibFSgyi4$2s)4W&x+Q@cbnK
z*_(OQlsB8bK;Yl!2u5%9u`geA%@0RV7WKkY4;M7F&cw!0Nywcl7m8vZbxT{2|J3Uv
z#D9L#VAix7JC*uqt6z%mN$jR{Xh@)w168CmzMUy*ehN7MmO8C3(ZVhdb;ehqd$l%e
z|2*j$?ens5i+@qq;UYP>dhtti;+l}CskOro%)JMm+_w6CuYaPVbbzxlgYrsMbl#kE
zpKra0utsek=U95kbRkCyWY14ILvH1;coh9z2>fsj%1(PJ2#OZf@+xqI?b#Z4ea;(9
zTG#|zx^DKv<zoY?e7EWE_vqhx7xX$^DWoT!e_NUVk+aI`SA1<B|D&kJt$F;6q7m+<
zlY3i+kZt^Rz628MYxsPsV)QMy$Aa#fB3F3a*O@buyS$rG;Sm8sOAonVIyz0cS)tU&
z9toE8;69o2MbKDu!x7T3S!tH4g|QPqMB>!m9wSFiNrIVy60pmf{O8C{LWOgwDET~=
z53gNUu7#xqHXfnleRmXRA@renJFM^aRv*(P5i>%?U;l^<dD8e`UXq7`5!i7EhsCy{
zo+LZo01oV}|7I4Tz^l&u;d0F83vY-bJCs{O_{gIh=B^od?FExKFv~Pv<u^8iPwB%~
zir*s^ZUHXkjWo8qAqQ)zsCTxivNv!4#**eYd;Wo|fbi(+p$Y$h1k5fIB2gj@=Sbkr
zmdUY!V!gdMsZIOv>E<j8qJ#0!c5R{8GX?wh&P*O!)8pxJi<Cj|Oh4FC1|qiR<c-zR
zX7z0k&;emEa#xO}tugtQMSKv^QvTsP8GMjZKc{I@tPEo8Ufz^+$LYs-zY;F!S%OUG
z>i3kO6H!yB!oHl}QG%ZnF!9X+DUNhEDkJu0^FWFNhuJ;yPO)c~sSVqwAu`2v*$Rl9
zx+<>SwmbY?g^1yj{z1XRjAr#hCamOf91#>6#6nQ}xd@YkbgM^tpQ+6&cJF}Jgra3e
zH;oKp`>fvvZ51A9WpPJCjn5iTdYX1YCgg$|ce#+YWz?P=eqB13QH(hyM!<FJSk~{z
zz^_wmMostqM%bd1ZQJBeyuEQNZC-_$cp9p~de~V8>837&Q^RmUfN&;vU<rG%@glt=
z@eJwtjm1B6>=}|(dg3DEt?E`AmHaBxiAeW7?~X&b`rlaq<E<5BTd(P}><`tY62Z<>
z5DU+V9MfiN1n*+M#fFaN(Fd$;hh-+uCG{n`4okyUfZb1cE$BOm*57@iv?08T_Wazq
zb6#&0D~>z+9?-bbFw^vm3h#Ceq#WHY{k77-nL>^GR3sksZMxdSvTi*GPwy1t3ZK+f
z1v<6jK?&b1wRBce=3U&~EsOq@_^;U2J*B-sr-fbVHR8a=Q(M6pOmelU%?wvV^-kZP
zdYOBr^TkLKI6|gBG3Kfn;&An=R-hF^darX8q%LbIe25@{zu9uE#Vc?FNh~WotUq-$
z_t5;TKSevP>Y5Y7%O6i$KlUCRLwzQQd2Y#VQ?fGfEF^eAX=cvJPoh)d0ccGSOd0u~
zS^3e8i@C<84}*cIisKyIEoX-g%MUvf%(*@HQ-v8P>RL`r?_ZKDbm9K%f<CiB-0g9Q
z-knGye*7w{dq8H;xuGgKKFequvOAF}kg{eh6SVir+Rf$Kv0;xOe{IgS-?Z|JI4<ah
zI`>~nKP%$y6tTEQUD~EYOmpoTUpk#uW0cZ-2&QZf@+CHq!?Pu{JPd|}ciN;1(?N3}
z%**6-?+)ob41wzl*<l`g98(?!a%c6o67PxU0OBx4=V#|rX7J_4GT*+2Z#_CW+0RsA
zl&701H5lU_2vwpT=JTn;IoP(XgjklkH6|l^x@#daE1y$xvd`tEa#AudvI1<l)jX2=
z!9t!|b$5tm^|uVEHA2n5s>Ae7hCi>j-hpfggzc@~!M7j@(t`4RZgjl~p(;Gy_b#E+
zsa$&H=w#zx_x~k*3y=kL`R48^Cq-mVOop286Ktb%DYnLo|4s1XBOQTy<=+O#@i*XE
zwz_rytzjqt8q#`j94@53w7NCJHW=Cu8|n1lLqp9c!}8cU$tP$X#e0&AxPh~YVBy-D
zl4933RuG3uwtRL1(e}Q5f>n^yK!9#X_A}Yu4#!7dQ6p+m{Vyt3U<mlNV8LIC-xSr|
z^MjCD2VskFbtRK!b!<dg6WbY|%CoCkKb*3v_op&5z6K#}@5%Nu=RiSj@nqWA;Q{?6
z<X<ZbLiJ~Aqh{<Sqhy?GNBL)VmQl5NlRuws$5K(M=&IKOn}^l6p~gmEQAu<hsu*y(
zAU5>g4)|M&*VA1Xi@;`w_nj0nce>ji?#l5519qOtmv7?>RO_%MUdgub^m&(|pHYW%
zRvhNRUE{y6bDE1HR+N?^&DUN}(*rEo8w@~}CH&8mC&04kpv-9@F_xW7!{qi{yZKgC
zB<IQf@Cqz2`ItIF4A2TV#6c(_1Aj78q({Sm2lckplM=^)J`l0$@|w_OZg#>+$+tmD
zWoF}u`5r7RFoZIZQqMF+CxLqE%WY4QlUiH-S}E#B`k?7`2R&V0W#6xnK_ie-oh|(S
zE!_dSkzVj|nR1J#rAV7b(5#z!;ck7IEZ_6u<F><3Bq>c5^1I0Lw9m$~R*qf~@qTux
z&HYFYGNFhRyFIK8)?+C(YuB}<uWfy#x-^Mgh_dny+sHHsGg-<+Fn8o+G^8+hJc6^+
z3Ll}H6u-N;N3i*I#!grUc!Jms?Rlva?Zzpx`T<oIEn|a?N$BH+BC&v~iXe%TzzrpK
zLlUWQ*2Tg$7s%$B7k)#1<)vA39uNaG48H$w2hgiHtsf&ajnf)WueCq@F6Xrwi$bea
zp2p8R=+)Ozwn_p%2EK`w9>o5Zx^&WVspI)J`wse^yJxe>LHpBV_B;vCm@h+V(l(y+
zG=VTBc1^tD`9k4CQ>gehs69X{f@qixcDXaK`d(!X)^AGq3wx{n_V;MtamHH$))XI_
zrBb9V<wyEaDm;$rqlJ1O3?*lo-*@qZ!KRNh5_Y-XUw9JeRHe4Mr1BXac&kBcTr_U?
z>A}$(xb9bEvVHs7c%%+udlspH2=3516jHa|+XRQPsfyGm$;R-)L{;ZK<{UEZrc#yv
zhTFoMlDd!3Pp<RUB<5wfa7>-w0avmP%5T*XLT?>TID`iU#9^{S2>nZu^@les#M;!J
z{t_fv;9dOsA&6%d=q1)(uD%$mkWOHyIsp!_P9FdpA*PH^D(3^w+D*~(84=&*Et;a(
zKGHRA(T4S%3L%A0O;y^kxga_n?7&gK1M&%sC0&=kyGB%Q_3PiTGPzZ*zALAuiV?M;
z1oy{Pxq03l1Ao_a{-W7qExgN`Wr+Cg!ICw`E7&o9ag4(Vgb^F({BDmnA0X&(4VDaZ
zTDc_>9v``HsydT074ca!kyeea3IG1Wf@OxRfWA2X2ml>0#!x@qVg)h|R~_Crc$Pv{
zjKPPi=IfpY*KhhG_i)D0pqoU%h<NQ#{Sju$G)6T%v9WR+ikafgX{d@0HtYzfiFm1d
zQ5hmh#Cz3v%f^n>SZ*l9b~RKej*4jooc9KOF1+$qw(Y(>Y@<kfTl6|8cwImdU8A7U
zdVkxHihd7c&dH#!d;nl#$$Z^UhRPLl@y}%wzYW3UaJPe;)D)FD`N9CJisg^L$NGQ;
z>sDNrm{HU6g%N?G>+y<SlfXvVSL;4XBHWR2gyrCVHt)E4-@;6hS6K?^-VqW<)(-64
z^of0bn)j<OhQF_vJQc~Dmqdy446reG7gXtRsbMWd^pspb<MR@{bn<DXUTa@wpn&<9
zJvt~>zlsQseWW|SkS(0;yGX80HOpb2mhl3MrXLCsxRlir1r|M_o1oLT`PtyDJ4?>A
z4LPp%fblbYs^sZ?$+}|^&8_PEKB2{5MJ^$;P(|Bb?~aLOyj$l}L4!bk-VSN1(yQGG
zX6PO4(3`iGW;^ULPi$|W;NN8w)VrTleLmHG9i%xuT7O+IKlluvm~}T}bzvqUp&Xi_
zS^1>$Alz-#w{6S?;o~GA8|&?~nv4A}xhij~#|sa=*R7m#+OTVm@;{r~H2=Tr!<4LZ
z+zBlwQlrlqTy7>AfxTb9W|EmB9IADjp)(scdujxZKq!^tLkG(vfJQ(;ry6f>8B>7#
z0t|$uLqv^s9JJ2-f~vKc_5K%Zm^bwh`3r`q%KI^Uj|fZvzbo`tGtL7OQAy`P9Yh<f
zO{cagHCb0B$m)e#f+<%yVIC$0esC^h;Zio`2E;7F@tk6NolklUu<F@DG@D<weqQZ(
zPU||+-;Gm3I%1J^08-b&rLcX|)?%Lq+OJR*9q;$TW^RY2VLwbsZPl?gGC;*s;K!nH
zCI9s66cT#KW}Sm#DQnA|HS{RRDXsSSbiq=hC&<GiDZnXsQtD%kpn>tm{NeVF5S<Je
zy1ssQ-cOLZF*%?_+G{=Hfy`&r*6?+4X`64tVi>5(ZAYu(rT7hR#OqAi#~80*Vq#fv
zxhfD5@AQud4@NycymNTUxp4}ZcPGbx`k%j4!%Vz!wEWEtwIdia1-0q>J%X{X&&Xl`
zz)?zamI2VIB7E&xtbaHj06@-Pe6W0;#NylXQ%o2638Fk-+CvLm`&g~&hjtuRLvjF{
z%?ExvX<zUz`u*n7R$_xOL^$JN*4Ew1*(;*`hkA4PS12%ae*9paR-Fz9?qhnD*%Qnx
zOverY!1#LJvN$&R-qB<c*>MnkjX1xW!w2Hh60Vms`6vbt2SZ(Om<8j8{PM+TX8SDw
zi6mCE#P2mvXpMV4N$9M+RaBv#)P&+E38v+}?~>&{g<gcSz^>`|icqn3Jz|fK(UBdu
zomW$Mhz{*r0eR)TQ@D><L7uwm%w$a*MN=xp!SLPG&*pY|>IB`cU03zUV(F+Nu!R3I
z8#yjEZ2pEEF4#9>IEaE*p?)fJK_Ti67G(Gj@`*b{4_A5)n8Ag?8R9RWoMA`J<Q*sO
zZqtB-iyeZmgkUNUS-jR(#^4U41dL{)Xze*KpubqU*z)-iXH)5)u>o4HBel2B*)2Yl
zkZX9G8<VAJPTTbH@)$;KQ9cgYIhoi8uET9X?vGWm4wHpJ-oI^e@fSex0lLkN$`f$@
zKeLS&K*50$3Q~WfnwWE}X}1|Eam;Z2n;W30_cvnu@mF8>5jDSC76i{eI7ZKzuvH5=
zx~fFLRNG{HN`bfp$ZAxZK3yzr`mbrlT$d4hyMVKlMl>rX+x%utRG`zY@}F(H41H~}
zYl<lp{BfZBqu%Kg-CJ>xe!P;_lQXvj;bV0AyA~M~1*w@K$|rk_l!@Ir(qEe%8h41l
zRi?Ms(z2_T*>L??ncjcmbnZ#os3$+^r>^9h-V!FGXt7}pZxKgpTw1&;eXbBeK44}j
zg)40W$ea-kkA?D=&ag&5l434{zp*~94xRrvhH+@8_<M4t`HH}$)*Nidt@j?@>B{<w
zxgL-tKyNl~ZCs+_b0bj_iC!0=m(YiFAFVNHHh;;vz3w2&rF^Er0L?s9Y12ZeZ5pmO
zJ?InOLk|b{;_}42o$R7_*Qy-~c1^7N)pe!s9b=Pg$rG@gphW43@_uz^Yq|BV_`=0C
z!5rhx*Uj|PpYnpjEQO$!INdiWF9Mpy0z~rAJwSHV_T#O+Zgb0v_qV3@vp#}+NxjV=
zXwkYEC3aR6fC@*JzVT{LyUpE|_1*=cccG0FK~x9lw%&RB^!I;57Z!~o+6*^7i1GzI
zo}*#OGH40&rzfD<uwPcEI0Pg`sj;4OAlkGJZ`#b&CRXl^bdsTyg=e#Iou|a%Iugh#
z0*nrTY3D2A7m#><oI%<DG&DzhOn+0%DgCW@wmYcspgI-hwGQH+#>Kmct%FLfmZp#a
zX8L`ghQ2C^u(~qa*(g8U-x1fxKDh6UXF^hhjbBd*qSDVdNJ|CdVKVp;@FD-S2!fYN
z$(qr-s=3mo7Z~fg_lKrr&Zet&uAo5lj<?6+l$riPG^~$*T9KR<<hdN{l`TEmK>ZZ&
zThw3<brcT!*G^>RLeevG$@b;2yqp&*9JS#%2uzg9DEX?Oka)r)D<!ekE8$kTUB1b`
zcp~=e40x^BBub|8B?(n-0advvZq+usUaV?_RW9H;m43cOY;U}dh){n~fV#0|JSxMh
zRJ+GPdLcJI9V~F4t3)QdGD;@(%LYVRO|hfVx<G(LhoIAb-SM=s^6Rr#{jPTpM}3T~
zo3*tuQb%EV_<2tAF<x6hBqsAOae(;D#2rZ9eJXe0_}6Qy=0iL9`|_e<5W1|dIneqB
z3R-6LcwBF;AsNxy_%2Kx>%s*&a}Rf;_EldKkUpJrV##_~j0#aHD&71udyLP$#OiCb
z*HiZ!v!>mBlxsVawrm=9WDS?tSn*PSh`fTk+zH0)(1_EHuu5zHt`Pi6x3Q81;IQAo
zCAd^KwKX?kEzVqD<j8@oV{ry~GWX8}Y{j4!=XMF<XIEw%QZ&Lfw8IPJ!(8Nc;{ZAQ
z%lAKAr(WNM39h=K%f`6F-3;sTlHu&a9m}m3OKN3r3QtC=S`{Bznu!M3-S&4mNKSK|
zR->fZJb_D4F_FMqd9F}4$#A>!QWe6r;#@ov6*F{AQ(YFb4~2IrRt6RuBQ(@UUynB)
zgv6hi$ZH<Qx!H19wT({~-j@s{G=Hq9(;GG0GHnDXLhit1f~N5;_+!FZP;utxV&~X8
zBRuQ-E4V9;<JQf7JKz;FRXG=0tvt(A5?HOBXs+nD@k)?X<2qd1)i1c)%<8Kp#);h$
zjva=D)E{Kg)RB%r$SG!VlIcvsw{OyHBFQ;o`6~{-6uYnGEFQFl-{S5HvMoFf@(>pM
zx!o2|E?Gl5FM$jEJ-BQ=o>$cpUa;p((;M@hVPp&TChQ5IK!`cw#2Rxzi~TeQTRJgS
zw4^_qztbp3%3;wOIqdqFx8k787dioD!_K=VIzQPe|G0QXi_QTunsj0UeAJtOH@8K9
z<6fSv*krkDaqy|)u@)bQKwMzx?S1AgsL7WGpn7`edv`)z-*B(~+?!xlFA{19&5~Hf
zg$a_blWuV{Vx@ogBwBU{euDOgE^Xl}U77sienSMbMqqMCarL6P-tp<Ci6CO^<}qFk
z4uSk5GXb}9n#RXhpZ+~l2cihKO3S+TX!K)7Sr($x0B?^>=owmUJbpTtm4~tZgJI0!
zbSq=3-HV)6XY|zj7kg8;V}McWeO5La_O%di>kL#3SL#F2-5X_UMo_B@nLXew#us1b
zPfhK`DF-j1yj)#BG!5*RGc|W_$4vSd-C+M%@AS90>B#hcaOb32CPyNC{x0j$7;3b&
z_3Xd?KK>mCZ7BsFgPl8wT{L?P15#t~qsm+Ro(9$7&LdOz&LvoCws1fm2(n==wXzxq
zHX4nl@ck=R{O<MvVXuDtw7W>>Nc_@s6iuL0Gc`|GwuQaHH28c~2XL#OtS%A)opE)+
zg26TqRN!J$%Ci^MCfpaynw9N(BD@QdEq2diI0E5fLV|M^-6$TXRn>RVJT&O_pcpsY
zxF4{ospk0K#!&BA$n`AR>D7FJSjk(j^NiXO_D)z|>@fzW0wB$Ep}&HZZ6vo2mwJ$K
zY%&M<j?EYR^lEIEl6P1JBB_t)6u+TdZz2MIyROdR0epe5*0N+93cj?4WznKeFlu>x
z(24EACvQHoj!elZNSk}c8|YLB>+c_Qk9^E9kNdRAc6YDzYtR7b&R_N(`~tU{TcQd$
znuH@RaR0yT4_2*!qBPLHlxm^#TY<2iAGE5$$u&;*SwZX@Et%{;R^xm-(@c)zzA*Ly
zVtZXqYgFYX;k^cKddI;Z{Z3DF5%N3CT@rHeR_^o(qs7OTECi%@u~f((wRvyLjOTvf
z)+ehQ)R8!C_U%u}v*e-(b5q<?07-FT4!!<F-FT`mX;*r3)t>B|8a&7TC@WItI1c3t
zGV^f1EoG|;v#VTNN~xb3J39oA*ZdRDJoG3S!_fiquAe_KV1}qz+ABy6$1=jPnvu%P
zpU6Pa$ypw|@^^g8cY&&R9kt|Y9qvqlsyIPXSo!j+2JrEOX24_7%%yODZ?19jT7H5+
zm4&S`f?#Ys9VK9q>Et2WTT_>Z;$K1U)8#3k0vlPG5v}zI%FBgFan0Xzjckq`k0JgS
zSM^n&7Q?yR?hN1`?B6Iq$Wfpbc3z!}qykBq3gHvi*E>H6{^Fv{IW%;95A4|uCn{$8
zW=bI<14<+`sn;$vvdG~%Pu&f1r#Bl#M=cM#Ih4xmafGLV$VPLHK>oIg>1wmvft@tM
zCq>Z+A;I{qm;oQ&=X+=a&6x<54!^Z{QP771E!{nI0-sgCurlaj7i(Jj@4Ze3(8JRW
zv^7&Zi#sTRXkC0#ZYe!VrU1&g%b#ytd^48v{!08=kR$6vn1$zq<6zxI>1&g>P6Qp4
z;ZoLsoT7nn`^<m&iNt3=<RxRabi6&P)DOvSJfH}O4~z)<n9(JYcOID@=MXOQ-8(2M
zo~*jRox;VODJO?&XyH0x>&P&RnOfu)wjF#w+*{KAsU4PGK@z@jzlE*)`{Xc?9aD+d
zID3!lYMpZeI=Tjy@iXxduFQH8hIP9nO$I=X@tQt=2~mdj?2h~>_$_U8y!yht-C*mx
zwi^i$&x{ElqJfwF<kt%0MCVC1a^)cpu0o;3UdVFEOW6znK*DNDSf!~GCY7m6(vcp6
zvF24V9|_T&TzlZhNrVetn!PxTkB#w<Kg6(h>NPi2CsOL|=Y!IdfJkuX3ADN8N;^eh
zFC{cUpp*Ch3ivCg^6i<xI%kwEn&-sd)v_os$Hz!)Um9rHo{I!HiNTQd=e%9mgVSfl
zs=`*C({$o|9Ph7U-PXfvhNE%!`oBD_7%3jZhC{o~-1A+MvK2Mm6f5as^;Z<{yA;&&
zDR&Hw?N-Q%8aJ`}La{y?X8r%AFfLAigM8_~E;q8QA)9pxFt4=B6dfr3aXT*-2s2OD
zU+ms<a8V3o6H)w(HyR<NiD6TUBSH&~RZRs0{&<DW1j&({j)WGqjlh<x@8QK`Rbtq<
z(b^YoQ@FknHeJ5V)ypHWt|Z}A3}}|&NXVd3&nK$Tkirx**3HVTNBnJ{EkvfYD;7;a
zx=*oE8Upkd(QlTJJ@|+NdAIE$v2Tj*+XEl3plGn`Q_DMG5lgz*q`C}FslPIRB8~P-
z`mL`mnsE&iSOdZDWyXS`(|?vDRs5{@g;>K*3DRXd;F;f%%Mnn|Q@eCj!+f=Hy?Ta4
zFf(v-@wa>U_22T_Zdfx+$A<N>o9UyWv2sK_C5~M+)H2ArO(6cyY*bwx5supH9LAHV
zEj|5X!eXnO2STEo1M&x*F?DrG6AF8Fcvi%-BS9Vb)+Ojoh;GXmO~+%*l#phmV3F30
z@X@)hBVfhhi(I0q=HC&36%uHqYoE;Ik+vA&PPE<ymYC){D%d}bqY7NR`VEeuGLe3E
zTw<h!K+-iCuY!Yqv*l|txt!>mQ{Ys*F4sV`sht*AxmJElP+hLp19#={I-1=H%Wfs*
zqsLt3VSYyrnVAUsqfcM^bibmem*hPVewMzy(WYIC^<6&;<lcWQOpDDe=oyQgVxDQX
zDIy!l+#TJW;hX`_$(e<28`ngt9Gb=ad%d6fba`nUzN1yUrznWLQ!88#a60)SfZw0x
z4=a-~ARRdH_k)`wHeSJZa9Shh4koR9VvcnKii%nuv^vaTP!d$S?>W<#dqfrFG^nOq
zMm^YJ^>c{n%aJp)0F#y{XZj}yKCcZ4R|`O)l8<vyc6BJsaeC?H{ZcDR`d5{=Ze90h
zyXF%!(U_eQ5#6-rDjvnFv-S&#PQ((NDRo96i}Rqkya53?Lu#Kv{omMH-X@lmUhb~v
ziy`6NSB2}g{bmWr7aj&V{UwY*rH?KwC{X?uj~F4Fml!|3=M|vohfMBWqCQ%DlaT=a
zm+6wUxMGLM*9SS*@f-!I`%b$9&_+vz9n8U9=z}Fs*%?X*8Qql{6G%;xVFbc>h(rCx
zF<c#`A54ep6O~ok^kBeAY`V<Cx+3IYnWdREOV^inDDZXa)HE#qS;$Ym9eLCNc${PI
zA$?1kR1PmU^$coz(?K7XA7GV}w3eU8&k-TjxU)5PVtP2DStxZD3n_VoYIkgYNNMr8
z!!_B04`Y+<<$=K4KhA^&JmWGz!Ph$XDx#SA$K!yz!b!39NIY#L3p7vyCo00v9mqf5
zRqNP1R#s|(=&6cwL2M7!t}ArZ0exSfm#+jLlF3du%N2QR13^niBK(zZ!#xO>^F)p9
za~kyor}gK1E<<M?kC8hv1lN$6YP&s8u8z_+90)=<Ol#UWsd0ad!;LV1Qd-pup}44;
z;GTODEmf`Mgf!mH;=vG5(YIlZpuXZ)Q{BZeWaY5cwN!)7nYUlz)^Y_3&l-{gbhsn}
zqERN&riWjo*n~+;yW(5oF*Q&7<Lg3XD3l*$&$Z6Xn!*-JR$wO!e~m0T5i@!LvImYR
zd{;0lEEjdN=OfqN#PddMQ46vHR{rmTxc1yGL*&g_`@@iWS&6S=jE_~jOI`(SOR!!{
zeKh)d!Hikuiq)k*gn=<tW@=nQ#{o)nJ#{OkqxVS9pz$D7Q|3R_7+~E!0i9qR+hLbK
zRbGnBIJoeD`uK;ck~avrUKO>oZ~L}vVC<&|K(nzu1O7wR-UBxgOY|EWL$v|T%V$va
z_U@sNg6{3J3T~yM;tv2_Pvb$dBA)#^FI>MBDOI}y6A^z<kH5M)(dmCA)XH4ndr+vk
z5@$;(CB{c+mL42gEbfLe^6WR*#v-Zr9D?pd4A4Xi%`jBZ_B1n<TVzsmA!eze+}3r2
zgtZR77fc6T^SwzUvM+eN3p)TGkk9QHia^T3h%S%!ac)!!fZsV<e}<2!f|Qhn#$<VX
zghW?C+GTSq{7ut$%_pit_|1vDA)ll(y+59q+KHz#)PIk!w-wpZ9p@fX0_-dvw+G|y
zjR%#_{=~xe6P{yeuZ(8CJO>q&#&l&6`E98kho9!4#c-!DYp95T)%lCxhU&CgUt@M%
zFTk2by=O26-pl*R+SEH)q)Y|HU<)!@I}kQlVU1be)b)VyrW0i#P9#qlCT|ARWBesx
zI^Xu)Fay;gfwzynL)uwInT!@i3`?;uPDsCM+_nae<A1**YJq}r)y|$eG#<xmx*ehD
zkx{Nh<IMVgZQeoARmc-tHN><Fq#m{-rvBzd;VPK*C`{&Wyeb0Pn!4BNEo0OW)RacZ
z<V_}-tPhRTz6X+5*nU(I5?x|)Kw~v1{<W9($(8+ljzfPOwtQozq?LSc`*lK>B8XyA
z;80ah2&3lVKsNn@jwKAx94t9yvuKz07)pR|8J~URbnc{?_|DGFE43B1(-`DI;^FOR
zH`|uf{M&*NrUHxcr$Cz873x)ursFdt+TdN^y%JmXxU?t1x0XJ;AbNL}Z}zHlnLV%K
z8o=i=nhdk1jawHeo~5k#j6$i^reoWtq53CrbwQ1<JEueV)g$)M(k!HN0(mR=tle|U
znxd>%)+1G{>Qm_G0a3Gar3vV`C|Qty5dTw(TZ#W@pdua;^Mn6n#7c9@zWKm7G_X_0
z|9z85hH5@};yiRf;1^d4JM`IK^^O<jW=FB4WktfQ%tnF4dfali+YCydu&%|sQ9z!s
z#8v^vZ}D2;^49t$sk2{1(_z092drw(Lk&-Uwwvf74EKu^xPO3w1S8_`>l}g)Ijr_~
zdyt+>8UsAi=88>T)r<Fm62~mPH+uGx(=scrz_+r>H%xfXQrbUaDhGI@_m8dQ4z3W;
z#dtbsLxts<gYRlLQlPM58#HqV;f;9+p`-%f{PU&%Yw-Se<0SyQ(7CrIyMdqWk+f=m
zc|lGDw}~FUb5AX6oLg$zfkvG_Kt)s?3>DBmxni8Fw$wgy+LqM6THMhNqJ!(cP>X&q
zzy#L?F7U-l$ROl!`qh)ied*1{;>RCfIy~QF=QoTDez(bQpuXg<nj9siD4<;j!>qzf
z6b~xTI@o~W?2aIIt%F~ri!OFx_o~*6*>pn)%z;|*lT<B7Qawe}2nENvgo){KQC>bx
z5kYpxWVEXNR(5kkP0w-d|0(CgWob4f6R%=}%cL!_35(%7YL?fr_xMS@GWmT!e0mk#
z^ij-zVfQR$+tB<h$vBWtuQc+@9td|7O-8pR0ld74SLVmt-3g1=jJ@1-OY~wNsiy`5
zqh7eKF>b&wk^C(l_8os<r`qLj0K%Fe_rSV`A%sZx*wMWB#<fV5nJLjRU>CSAI9pcg
zw-sF>+vUUs@Ng{rLNt>l0K(Dahf(CC&&-Zzq}!>QR=n4q2pnvDAQs#x|2M0#a?D_#
z0KgJ~o%{cZ)OjGgpz@~-y?C#`0!i4Y?Ew&BInulf`h@&_>fx${!f{X<{f@h?h=x7J
z=wFrn?k3R6m|u35W#hAS1_nHVjSJccW%PmzqJ%pw<_C2`tizaAaB&^)tX#`t=Mfq(
zkfkdzLtcRGC=otI49>%zD=meWC+sV*V4`rfqrQ-sDPNL@T*Vj@++z@xx%BtFO?eJd
zH%~N^1fKanB%OOalkfk>D@h_MVa`eN$@!3&W2LBsB$nfx#d1Egku#Z7avqYTa#(22
zoAV)uIh*sDId6``9DaA--(S17Js#VAKOXmeU)S}1zh2MR?D^ir{B4iIz~CL;tYaoC
z1tsvwm?Cm?UI0m@wc0;mn$Ll9**S-^Z5udg7j3L}lZ&qv1aEZ5Z>z=1vP*9DXK$zJ
z%op3>yo>|J6Sn*L-ql~N+d$1pRVk9=#E;9f+0>`N2Rd*1IxkvrOfiDnd`%M$h#&e)
zAj$#qiXq$p+5A$#&xaQl0b*}b^@wg$!+KHvf3Ytv=5e6ko(_Yyt1k|JNQkJt&#Ck?
z>oOf@qO-drt$QJsM{*?Q6q6^Er3hM|7P3&4(wwUbX*hin@4FdJHR_silogioQ9m1t
zQTK_C;uN#zo;n?jJTxk7<CxMPH2XLt!=9VF|2FOld(+)R@Y-}z)E=l3q&A`fgl_y@
zLlP`d=%;4JW)blzzz6f5jH)x9@|!TV?03ojv0wV+b}%`_SGo6mF%#}T`m~RJk(OX9
z?DdG8&yY<@gB)2BorR#0ick%PK4i6Y&2FMHP0-E+-erL&aPMFig`Ks#S!Ubr>fgu9
z<u9@46knE(Zfj7(xvJw<VxGk`a*Vn{xmKUXED7y3!X10xWvvO?H&alaQ^h>f5DAyR
z;<L3U|Fr*rt`FpwC+;}rdKMitvaht<+{FiFV|s0GN%;G;O820@T~I_Ld)U(RH#sjs
z(;!yGQEdd9*$Qqr9aB1L(~Py)jk|~451zNDd}wjal+W^FKK`rg&)0il`LN?F$M#94
zQXZjyXO?C1+J51AItIS&uN=}wAO5h+pC(;rX~QGtps}olM<G_AfW#+g>>Owz!-sp+
zxdrv}W+r$+3FQ8L0pWO0!M)wr96uP7dHLrFCIkqO^QPVK29@Oi-CDswPt=mz!g9DC
zwe5|Bywl|Xti$0_r2u@mbM9@P@x7*0FgUA-qL^zex;QNYNx&K}tHnl07i@x)4C&5z
z{N&`gMe)=Q(nv?MRC-9#^qzt%P@*)$9yLpmslUv4HTG358i5tM`uq5<GQT!hRG$r5
zS&s9GA9MNbQKu2u95T2NBDG&5M1mcfp>?e0d??r~lxbf~%PmIZd+e9BDA0A4a~Y6L
z;T^U}mv8DV4PNM{(?4KM?e6-Efx&=6;jM(_t^l$(^W~X8$@kSHfzz4y;u-Y|pW9q4
zqp6;nnQeN%#F5opH_dU{4a3Th#rK2{xfg8wMvoyy!r1)HZ|_eFE@Azzke&duj!(7~
znZD~29XC|;5OW%=JIgDuPCMVBd<A4RFQr=9CV<>kTdGAjN19eilh_erQkD?BFW(EX
z1LDkP0GIOf54u$~YEa{V^{ct@rtHzUeP$%D1_;fQ+XjH*NmUt|4hdvO5em~XOpKHt
z=z*4$ei0g2C0OSLfPY?k70{jbJyKm*c_iDbfFHvKhXsCLI-?XodZ{f4$A0E2_^1Rq
zb!2C>8zqg>9NBqll{I^Uf?^wI6h6CSh{v3)aD!eVBxK6L!IExF2f6<>>LhR7#Q7Gm
zAF6%5!$g(vQr$cP-%$Q*dTz++>9h03C0=uypgwoG!;gTDff52dEU6esUYn7A;sCoR
zJ~j^_GPJP!G{X|ylczxEnD+f`zk(dzaUVv-a=i_y8EQFee2sbwr&LF8*Zuy@C6B6M
z^=oIZ&OC4q6gXZILXym=nDuT?kN<R#>L*VD1Zm24{adpw44-6jb4rA+it4+>Pwr$^
z`_5D$z5_yee8h?E_wef8zhL82gA9&4tBq=MlkF@SST~QQ&JGZd#6(WOMh9rCQTA|^
ze*U56`xZsywulCCc3A8OzmBriC3t(C0oW+Zuj>P|kj4P|s_$wJjY@l8nS9BDU8M6Z
znH?eZ2x>c=2Snw<eT#sbuSZER<N{bS!_qM}l4~i+sp}KKMRMHYO_M<N%ekJ)JO{8|
zjrS0Vy@oIsow{;Y6%`AlDsdiw26YAj_x()L(FYHIpf3?nU->X>0{igW&-nBkZMfkv
zC`gf#+XiB8#h+Amv`<`dv`bMvj4xP|bTG>hs;XWfaMn200Bjl)({0$Ij#KSq$jKPL
zqE81%z38|D#DGlbF!mzf7VsDHS@AwJn*Uqlna_rZg%|0CC8*>pU{VQLqZt}uZU*v4
z)Hq#{O{CT7{B0}$B~@)u=5ZTn38T}>f7WMdJ^dp6;XXNWdx=rY{2f3gGBB7z-4AMY
z(wd1teU=l_x<$%KMj0(Oj8tq3<sOqd8RnhVn?ko?LP$lbB(DI1$uAMf_8>9L_$u~!
zJ2S_m*IkB+uX6USrd)<9LA&Q-&cMs%#y}U)I5X=G-9}i6Q@GG`Ni+|hLABtj&W*L&
z7u7PntWLy5Nj8u6{P1n>wN>MmHT$nQ|5QP8j3JWOOzAI3{XLD|%UxBzIk5cpoNGJ1
z`MS5S=%LER5@8_fSvj#!lY{P%yCkc6HSJP~Lvu3;TYkwzdMmuw=f2%W57AGHleyA*
z*zak-Prcv(&=+T=3>r3+^<%w2zFnzDfD(QZ*7nA3v5O(F;1}ne)xzd7X}7q(7x;!h
z?g>3o`#A<OYf5Zj5Rq@v;1Jcd>9q}R@ZSh-5RX}^^|Sn~Ie#}qd4|8u$Ktm?=i+>n
zME_H0)yPvknC@&W8s}CLeHVI1L%<c<0&QWB!nxTMD%y*ZA(Z>8*z$U4H|MzICZ=yK
zFlPEXJZ6{haoksHTA<d^PBfF0Pr5!;4wpt%MnrJ0BI>Q8D!uplv4nl9mX%m+t54tC
z&aBpi`>V&8BHd$uB|DAhm|-1KH?tiiLk)=FF1~YthoU-4<u89i&hrTpG>zQMg%L`A
zWV5t2+b2_OWtYJ5KqAfec;fp4E|l#vW<&Tkt$KtG(<Tf8qEo2~lRBGEbhZ@Td9MhY
z?t5T6K7%N#bzwnNgpYc;ZVLuzXLy~D*HM?jL2J>bhbK337b($WQ&LVxCzfOYx6Y(J
zExC;=|K+XoYjHVub9b{Et@UqIJT+NK`mh^Ms(K#hGIjmP3GV~FrD~TGsDtDP_qzUS
zO3Li|1Ib~bR^C|#bsV+Oa11=z9kvtrMAS!eVVnIu+5DEW^;9?QSsV>>>xxAsS}Px}
zB<ufKC;Yl51>=q@z8rwNt-LcN0B>jCiy!|Y)PZH)i;vE+3A&~larl+jjbk?r1^<c9
z!P8(wFH|!~P9dHNk$u|U#^z|8x_XH}zX2@Eu{UDpnJIN6q6)q*6cdH>Bpw=yez>9T
z7dw<K6>z(@Ufuwy5ek*ef@`ar64BMOK?B^pdK8Qc50{Cf$WHfh9@S_S5pu@q!ZYxb
zvdkainz$*s^DE-IvbF8BCN8uu9g!C?K?2EA{SL?aeC3s2kl&682mbxF)q~YJ*1j@D
zb1YbJFf6YUor!P^3;8*5ZNBX7z^pkQQ6#x)YMiU;2O=I73pC29lS~1Um4?O3%AC2~
zw$HJbWi^x@zR+m?0se~;;JuY6@VML6=R;`EBN~r(xof=UoSa`W0oL~(v$_nFD$}YH
z$_^U;xD`oeXvJ%V@5f~-@+iIG$wDC<8<j8Nf|67Qxi`1wpcxate+P#8uZQQGX#nlL
z9)~|}O`ujr$=kzlQ_1lA4`bjl|H&cwufDR+<O0$8wa4IimiZ$pV{@I)biFRA11to_
zi9D7&cUxD0ySP{k{n=&Eus#BQJ_PxVYDA`VD6<k8CZ<>d+I2ru&k=%J&H3DP1av!l
zKw>i_h?LvrED0@Held`59fp>C;Bg*|JV9BR>-b(wh>HI!b@`CLQy}u?#YK?MTwUxB
zn~o<Vea+QM!8a6s%kN|Mc5Js2spc+{<BCm3&SEtyDazCrb$`%#&`YG6F?2|etCu^T
zw`yDYjqy^o$L8$K171!C!Tt6egkw{nKIV^x_JT9rk&y-Cakzn02cL|Sq*K&H5ojA`
zhve#sx(Vo&d2N>B`#^&ip&$c0rcvLxO<X;H+e`$b1mPrDO&g`3ap1q!e<@hX+jPO_
z1=r=)2R_O+M~f`~UJq}mdn|Sgh4tKXfy*YyvV7;(QS2Gh2_sEtPs9!Pl<gZg#9lcx
zjK;C4jO|Lim-5n@jr)g9;{G2KC1J!I03av~Oe&RFYqroTCEVpJS$}pm{Bbc{;xO_p
z{AtF4@V)}?cFWmV?xc0eqQmi1;p6x^>k_Q+h~fK|+GJFzcNo#|y`ZY~{$J=jRjH*}
z6s%_3voUpD!yi5rDm5y^4&_zfcmEux<hA5KWBP}4w4tT8oM(63=W5|QwVDzcXcvqI
z9mMMR&Utq{obb?w$~6y;?goHtY)GPLc?8G`Z<!%wWcWU*-(9`f>91yB7o$LW6T4sR
zAEQ!JHI7j2?7IN@KkC(`oIgft**^-`s{9;I|3eN}c`5m(aOAp4qbLA4I7}DJk*=x$
z+EOc?RU54c53l`_$D#7MrPd3!&GlF_cY0GBDxzwAEEN(!t!VTQ90Eg3q*jZ)j-|Aa
z;7R%|)?bSg^rwW6=vQLC*2eG{?jFZlgg=r3nFgT7Kn1;zDOB<@Rj`e_9Y7?d`TSug
zrmbe^d=reedf4!JB!vq5$?n+|%iRn5Z;O2o6FZtPvX{~uU7R!1!C-=z`)~F!)=SO#
zJot3(#wnn)`6S?l<YV)Q)i(8Yy+0M#Yiy$@?=@nnQhgd0g?cRP9iiv_+IiuLHovcG
z@s;8&z7z{pWMpSgB_q{>cfPTzt&8}+E3paM*hTz+8y+Fd?%=j>9w}Vd8*8!S2`ELY
zMUkwgAX)2ckwOZ`fRtwImrd>1UtWvEx?-<V&C`zoWr>-m{qn<SyfrO_Xq0An)<b?G
zFR*`3vb&%hboJ!ri(;C+F<Kcq9_KKREc)3(brg6Ldin`~Nv_CooA#clFI?4d-k@*$
zMJN}Y&R{J*iFv~vF-QGH2oSsf_IIgE^TG{r94vbNA=ay@w$0*WQ9#Jrvi*q*AmP0p
z3P^Zw1ig|5nChy(R0eGH)3Ejb#j0PkY}=ae5GXDmj&RM<v{L`YhSE;4!zNPEWwB;$
zHBAM%ngRB0HS;<=j>nX3HSzuKq=U8sZ#uYRhsMIyR+l3d9V(qwyGC<E<re1Zi9<lR
zE)}-5fg0a5|0A*jXTW(49DOlusE|RWo4_5v{u@0gigOK+f@+!|I#L*sW+uB*i<+0z
zTUa}zU_77@idB0`SK~8Px{WI;vg4Bp+I;75UgbNR&+H+{w9-aqLvM{2HT}+;vHhn;
zOC3Z#G^o3B2A1vDQrR*TbA)Rq%tdq|8+zEqB|la)N{D$ZG0OAM2?W^Z$k^4d%>1<W
zaWv3V{onAu$I|DmqA)L7r{Z}D%9@r!hdhJ<w{MF3wWyEF5`eBpVY`8baArEZROZJX
zfQLBu7f@3LK^vLA;m=fu)6Cx5JR|*@qLYr~2aT8Bcc(~CErjuI*US8n3V{s9H>Ea7
z?8bAU2EK-Kcg>O}4cU(<KDTR|d_W3Lc>x<-NV=@cysfTHJ~L5du~x$#u&sD{=1$V!
zVt7Kd!85rlf!3>Txy>w|cy^`#AGPp-QCL+2q%mwG5R`^KIcx-EGBUk<b*zEr6Md59
zlHcJOKV_a4dTV>nS^b1^l}v$6w@UKMpa`sc^_*4DNrs|Oo1>|qS%jp~n&s4sS|$r?
z)5#gno2M9d<lovPA09UK?XgjGw~FV)Cz+C~xlrSu6lK57<8d0NH=vW8Pk~}*`wtW4
zIQ=%6TEz^IK|<6j1FrexifVeQAksi9XPHn6ZTyiQTm@ZjyrI}0fd`RSlN3ur0>ln`
z1(}p>*MC?3ep+YXx*QZ2RQcP08&HY_Z|#zNUVDjy|1Bo5nmYAuUMRr3q@UOIM9Lw;
z6cVZNtNo%3DZKz6=^tKJNXYE_T!Qacgj@Y7+6%5Lm(oOzN{>VfPxB^HV51}k2^&ex
zm&+8bCH`yzFL-%dy^d6&eyTVe8hzESuFH&O-XpAU)i21kQ6r})g}s$NkdB~fg?z0+
zcf#XOWjcU`oW{1`te&kUsqXWHoHE%=2LbX|Lc7;Zb$c`XF)CNm&Ft=hMZdoVw@+-V
zzxkD18C5z@CI_&>UiCez9Q-3O4PYAXNxp~S-i}`xTw5NM9(Dur;atr$TSJtCGLT!l
zqT(E^J(fUTUCXncudVGWVQY1qF-}hwUI~-vQ3Ul|uIu2>AlPL?oquGt!v#?EXvMvQ
zNf|$jZv@B0>qHFky(-A`AU3TXFltpFvgInfLsaV4_r3$$L;;|XQTuv9$oZ`0%Adb&
zYR3_#_19?I@)Mt}7N7qCVVP!?LSs#IUZLk|`XR4%B++84`f$jpb|oxvW=aMvt3Kzj
zx1MlCYLy34Rz3<UtNh{K`+#eHv$!sJ`u=fzivQPx$Tx>vFYwZQEMl(@xup4I4zg{5
z8LC^Bq|qwmLPuS)R$b7(N?z1#rO2}&=i5`HPP52y@NSxU*|l~^cmjntt1+Cw@7Jz8
zbMLb1!qvdXyYbWyH8;pY3n!TW4PQ@*e43!&e=u)fl`#eKXZYjP$UJ)ZiL#U98NHq7
zXH~1?vnbLK$yYj&;(w5;l}$Y1eBSfXcjN84N05-hL<++}s->BT&(|gd7%pY&Ce%yd
z%$@(GA;D>BqG1x&S`VC+QbjcrasW3R)cSB4)>hh9h+(b;2YG3B!BmH5^)zI>`DA)$
zJ9ozZW|VD6!FU45OEVGgk*c3f8Lj{&jhfddZ&Ikx^@fqxX)00d*Yv*e*na|JydywW
zXwSAwR<C`)pRcwa*yV;N9C71gqd6|qL=<)b>vjphdvr``Ww{S%tunyY_}CZOInDgJ
zI-r!AbM*6=aatdRQQ9ZG+ZX0X#m})Fal>VwRq48~KHjicDR|_k-A<w}y+qG;CUdc>
zO~F3i4YH|k8?c8c=rPp~U^O@+z-AyAzr$~%R|59_m>uISdRB6H9vpRqWzlTH{NF{y
z;N136{Yey7f03h(QTI)jte2X3W(Ss{gE}Zn#z4pNtF7W)OyB-Aj6`Rff2&L8Xyq8R
zQs*uGWP#)dqC9-t6D-z)d0C>BtiACXer!of*1b^Uztd<*&d*~NSJedq(H840>Q=VR
z_tcLVN%*te^$9nTOF^LOy!wl;Nr6^Lobv9@!NO(d83ONcf>d$t|7lt?Rfgn2m~5if
zrN{o}yjkL>8~vuI6Ci*zEarSW0n_8c%#2)h{M-+%nHkaJvT;SSw`t4GiEAwR+n#f+
z=uhIci~yj5>B_HH_?L>!CyJVJ2JDIkwjWw2e{mc=9$M?ZJ~^LYc*NG0O{}`q7?SHL
z?$Mr>m(A@?uwEy#9u(mxqP3Ydo6bO!^6V!VA>S)k&#XND{C2}9?VKD3KGk5*RDHR^
zWKb)ADLuk8_CULrO;kRd(J^R*ATB?3nTvZXvv<dxSUp%LhdAa57cv-y`jed=t9)NR
zjGA+~qZ0&w+1J7*IIYDUdlV-yr57!5I>sF9qaz3Ihx#XA%NO2Rqv->SmQgJ`dM#ap
zqM}QvLo@knt4~1bzE);=bq4OL9-q!U1(3dt2jQi4`v-Xd1Ol*kf~s$%rT{&&fIB8E
z{meG!nO@V=-sub~nd$kNEvatm3kIk<H-{lSLQrPpX_Uk!hVAer>ip|@vw}j2eSZhO
z?d|VSfeGc&uoB=I<Xca={yxT~j-R1UU=L&d=Y@0g=N)$BGA79+;9yMh?jyyt1^y;N
zxKu(XdJ8j*wW%G>>7IS$27I1j#wAM_{2kAbLF?$G&MVD(N8+Gd&QV*w6A%m6uK)55
zFuzG`37B4QuIw)Gm>rK*vKA6a9gBF(M?-H#M9B=Bz3a<=zsLJuOPDhkcKE9fhv&_f
zrUB7o<}kBP(;Oe4bTC@jI}8uDiw}}q<wG{g4X#B4b-2K}f|G`2A?R&&c>CJb)*FaH
zHHLQ`TrZa~ySmI`U#=eQXxWGc+MmDb{3d%RgiVsFB()T+W>qZR+Msy1>bL=7{{FG}
z8S=>J;0p38Uv@L0h;S;e$if}|_*$gd&z2KF&;M2F<;nAW>^Y0OmmazJEaGzP7Iz9l
zs9RXAnS!F;7)vx4Wqv|Ka_v69cJryxW}APE(Pykv$H|CxX8mg?c2F1vZNQB4LLLg?
z#%NpN<UEUA@IrbdIPZW<T9HfZFKLCK&EPGXYMd&SPan{7W~9o}8C(@MlzR<-(XV|-
zwuRlOi4djRE(8Ew$+BY0@V(u?gi<myw2SyVqNTU=w~u>@<k$QU$zf09E+Db@KqBQz
zOK&8-?sL}MU>JqgSXuYTx=V7l1{`<_NK8lx2P8}<vTuS$-HR5W0&~g})QMbuFHZI_
z|0B$jd)&Xj&fEKT@O1hLPerhbt=(qdMV<<&{-EoVHH!tY3GO|rSAc6lxY`?-$Kj5k
zzEsvjOYI=T(#SAfW1BqQE6UcE7J~-hr=%y5VHv!ognz^4fS*NKzKtPeWepafi#g<^
zi?9X&b$-`WHF-p9g4WC@!5|>in>bEnj&;lgEC?zKLa{Lu!VRwGf167Zj2&IM-`4in
z@ABnlsfl_Q?&O&DqA@>+*E)F?)I3eIL2sME&2DtnPO__D<&dGfv2(<1Zr`{SqIc|&
zW~<P;VjF`+h=BXzdYwe(+u}x7>{)<$&f0L)qA>Sgi}%Xt-ssTjrUdTRNU8CJ86Y1o
z(X??gp-fY#CbY(iAbw;p!LzPeb8X7~Jbm`HZ6jO0-F<q;1Bhj~jrmhl$R+;M7Di1^
zon!Z9!h>DDG>fWhQ&fb^+x@0u`8JfP$|x(b5(de}_hoX>5Hj80%yGw1`UV&8-+#k0
zEkKPAoBZ}QC#Qq*gTC%;nIL@znii;eE@ngEAxgFhi}z*7+z+`yxpsv4|Ka1nc9yq&
z71H-Z9tTEFp^6Z5Eu&S7|5SqH7Y*8yKw#j821o9PF-P$aN-w%#8;c;n4RLV>w`b8J
zo303TpBs=VD`_-m0FT9l)s>wT-3X;sgyziNO(2a%ER>Y$=h&TY>wsu?Olf^w(P6~r
zHoo=7js4XB2xb9C-`<K(@SgO8TOe=4HFn2%tY)y^rD74<F-axyYQr~Mt0lFa#Q>UF
zSzU6)+F0XqqjBfSLjYl9gC8F>GCAQT*oD%$=J83N*y}Dks%*Wh4fSPJUEoCVjndr7
zm9@Y>LMy+8CH7Scp*xNu%`%X!%D#E*CRR%9>T~Hkx|X$@uHA>1bJ-xKJJ(yaoxgmJ
zTgD_*|2IVrb1xEEv)U)jU4_aM{8qn;qb&NFM>Vjh`JHQq^InIfl3p0muPRCRN6MN8
zAbkT7{lGy|C-D}jwZ%8B|G1?z{FiC^M1Fn<11?E9L!TyLsd-w?h#wCXv!P->SNfl8
zQtQ_%<n7#6V0j4hedBM5UQ-g=FiOMOD(mTCfiCil{b)?MXOOm)8}Hsi(<<8YhQSJJ
z(d9y#vRp9J<Z~BjW8tf?-jx~;$0eINqFs<zutE;-@eXtgfoL8368#{e%sI|?gSTH*
zT=IL<TZvta2=e)n27?vO;$^=ouK9;=(Q*Hnn0tBXRvjdus8p;SCB`pSx#g&HhzZd#
z3qM07x1}Y3sYUwE;1Us}MG?ZkUVgFp-!9y2X%*MhUR&O=lO{88*Xgr+vKo|H@LO*d
z#OkLrIHLIY81=y}jJR`NRRP>X%g2%pWO96z!dOlWq!RFJtSGIqf;|N^$Um&p&k(ew
z*(6eVXVLo$gM6mZuKU95<Ga+)ro?qjBA;~iIUB;?rbT}AanoqkjQr)Me~DdifUfI_
z3A4ME_tNjYh{WUn(ne$kEpZR{YJW5h^xJ`IObHl$c^QYbxf-;Jq(SZL(;aI*SPpUh
zC}oeWn!Bv}<0)X^bk6CNDp)%}RhL3h?&P_s+UfP2&U?tc4xjd;44e0A!_#!?f@?h~
zWHnxnY1X@-m7Y;*n!&tNQtx7Dz+LF=y5t)D$0;Hxp>(&3IqZX+PF6fiQEx`^G88u@
z^F7Sd9=Xy{seceA1<zg2l7cLvfa=!n))4RMf{$_)IeP}nh7KxftcHwCRU~;zIS-Nj
z+yL$+=Z}ub%)>DOfs=DxvoOFgFPYsMkO|7}p|tvoQ9Uh1S*SJ#{Q2!vF`tWJD*VeY
z%gJ>T6BTONk+lHMEv3$=*4PtB_*?%arWE|y2#5xdF0<n}oJJoq<j%Aaz5bod)_jc(
zT-Qrb9@q@6Yii!&25KI6uf8`LSqP~AWgq&CTL@BE-GjA4drBiVC+VU|{!8uU-Pi)d
zsG)!!)=R-U7r_w8WlS0;>^C#V4uUpj=nG-roKJd*`r1n0GRbdaH_6VA@oOnFnBnb;
zTw9A=zH66vY_#*{y|xj!yHISfb8&`l#jhPPIqLbst&_aw)j=3t@c9Oz#*v<U6#LOl
zg{7{Zw<ot5MFkD0LGyz}zt!~TFJsxJ7e{jZX8(h;?~ZY!X*7JEesnRzSL(D+?wGCp
z_xNQ!bgdGSVnnz7=leuK7Ukcd)nESy4d?_DWG20jQdxLgKGqwR`<hD{9Vjo3;g1qH
zlA0wl`0!ov?oPb{9ig5hsm&I192^$XpC#<XSHW6;3(-u`v2Wkk^jH1fbXMthbB_1a
zD2vb`m4yNhBFXAK(R1$L`~QF#K_EZD;d4OML*#tVy_h!?G*m$8<Fe?;X>6W%`?67I
z?m}>)#X9Tl<FVVkr?f&=I{})KeyOQH-S@f8pFUG;Oh<E03sa5od#6L%$fc?oj{cpe
z-3s!MciNk6Q6;_k-IrC=_c1?n_d?m`t~qa31nfqVVIoG6YPDcEqveB5Zonj$!9^bE
zy<8ofAh7}S-k^q-T+H7OgHk_~OgP+Suu_&vHtyaP0_YK$hfh-Mu9daTpcqt}#CvYp
z#+^r;n|HJu#Ie=6)pFW~=8Y~cn5kr)NA5MJM(F8$0V4TAUDe4uc?idxis0yPa6^!Y
zzewc{`yPAsZ?GMZaH0HfB-2<+DuPS(a2%{QX6h^y(9YKxoMPslMa79C0Pnyccuqib
z8p8ea{ou=WSVQIQZ#=WiNI1o>;MqpTH*hL9auvpswZ2~A?93XYn2vA^R-7hhX5)wS
z)>c^N0aZu61z?z(Nx5+GAMWirjrh=*lLg;z%O|>=A&9uefOZwNWCjiTu6Vu9ls&gt
zw{(8GVFv6lxWhi&q(Xi!CEPCMvVwF~_0Vk?=?oLV{9Ok6R401Zt(fqsz<6ujVb|?@
zko(uFz*rUcH$&}ydv>uj79sOne_d}MH}p+tG%G((jw{~sDp<IjOpPq8S+Vs&&)ze0
z`*JpiDB_rcap-)i#pSp?`Q71e`t(itYJX4l-9}Z<5>nDc#2!iIT5HyiAm<DUCfM8h
z*8$ZHQj%A1CcBi%8VL39-k#jcWIbVF$bR^5OxLL7et{S&Ro4dD3eQcxDG#Ypa_7G6
z8oP{fd2^iR1^xup-1ptQI{C|9iF*7DAP$B*wJ6#zjt}!LFDfALzhJi)!X!Pzo|*1_
zB8eYZZMyAFENzEbl|9T3G4pRLNl*-2I+$BWei8sWzJ7vSa~G%2EKf!b?1lb%4Vis-
z^fKK1;c}VSZqZ{o+m+7ee4}aJfct77B~e9sCwA$$B7c>8DXvSg_h`Ih1iVoOmBMXl
zpGLY)`3mWPc&46bA2PItz)2Q&rkN*`A34YR<mn~Kpp`HAx$pA26C63(B!(!*eBP7E
z7R137<wi7uEOOUfqz7Gn<Y{ye2c0-?=ai&a^E>0uLmZV=%lpEpsiE&z!bilCcgz&W
zgxX!erMCQ89i1QqNO9dfUgSckchzHKlbJyfpx`D#k#vI8X)~}RlcD{NPTt6Vz(t8W
zU-zIg=v4vXy6o((@$|(#Wo*vlh{_Rv?(T-jO&b5rmMMXf>F^TbKW2{9FxTPkQ0spu
zV|(fbwV_g-J_2+*MstEl35I}Lg=u9a9)}M<@K{GHh*T=!HO)n(ChlK|7|vU%ghpa#
z&KM>B?sDfavmG%RnE%!K#Gc=K1B69M383zN{C*$@l|%gs%Rze=xmn$J<m33Mn8V%^
zx<!uT>@Brx)w2jn@DZa5xKGBOTs&hP;S<z#&KtbcZ)djEXK;apCD$dZ?0k$Xf9z;}
zi|^qbQ;q>M73q%@Js+z<PKz!HAYcTvMd@Pi7Vv(`7zlkmGtP#tnCl9ylZaAM0o3W#
zY4_xL@giSUm1y8i-VnPw!^AYh))+^wqkUA#Bxr@9rsEmHk!KIyhHhm<t52HL6D8})
zV||Pu@j1Pi3nccfF+KjATWUEy<d5%chV?Dhz2S%=V)ca{skJh!b{MUHQUSKQk=?&f
z=oLa+R5@5_`pzr%TV_yAl#bFga7KS!S>`Y(q0*lE(TZBPto9AO{E|<x^bNF@RV?vy
z-yJe{6af!%?Akh(0d`9?|6KT&0`7J9djSIDTMhU~{h6&G;bdWj8^mL(=y7TX?8V|r
zZ-HZL=6}bjKb3g)rDYZG5k-%|ZM<)_y0s6SF<k!Ue`}NB1$pWM)2qp{xOZ=GN%^i>
z_l2idf2rf#mlNA&Lwx5ullp{omN4h#UT{~uD6PHf^hO%Z+NQ-g?|SU*E$<XpHugMs
zwSU~g9^i>q?|MDUg|JhyD%3bzQp%=c@!r}Ik7R-C*c?4O7^VYM?Lr&O4$P}(-F1B0
z&xc^i4IZU>>M{Y4S$_2D6?tPbQ|eFgw=^kh{Ww;Cck61#{X_2IhfIezKaWN-bDTW^
zDMo`o+eI>im!nF{-nQcOKSpr>t_caaPc@iK-C2}Eci*8{<hYJUY-wo+Y&`y-(3YCt
zN}xY`7s^FT4D#Jbc45tMholj_;P6rNE;q<{cNH|<xFL11SUBSdKbkZndAaGg#G^5>
z4ZwDxrM&*}mL&CqzVZ9eR_zzB|FoSbBMf4}&nEWr2cgS^tmUEW9@t)Vm>JD1Gq$pB
z|4v-3Retm*DM=mvxLO_Oqb8+NFeS+u;%nWI;naC*q-rZ|5c|Aujc4z6o8WZL@?ygL
zCz6lqTqM<hmv46TMfn12C<X8!r%ozgdw&~Ai6?VCt{axz;V7$-vGqQ40Mo+axDUmS
zkXAW-1I6-JRCGmFK3eT*aF<YW=ClV_(y}Qp9pk3O*w+00mV^wZFOE#{=!4n!eZKY(
zuD`#{*i#$47?i6OH!fd*zdntTrNh=s4FR5Vhh7G5#o%Jd;uKw1n%xrTo`XAV$}$IU
zvBc?VA)G3MKAtXvMps|U8mP4{POAR>U7&5zWL*Hp?JmzwZD072xyE|bzA$o41^Pd~
zGbj{$^OouIS)AkR5HZJ<rS<bS_4@ipKuH>2>uATpPeF>a>nm!#pTI<zqK|i1mdX!7
zJs%Yyon)vNIm2oZpcu+|0jkJ(syI_Ora*ai63bdNNnHDQizu=jVRD#$eSe2_1iDt3
zquotIykHU;rjoC>Q(tv%Fur$MqX`k~Dt=D++!2*=(WFhWl^`MS{h8Ys)Hgk#!G3sK
zJuz$kpq*Wc6XB5u-{MV7=X~dpsZ{DFzV7&4o$yycPj82M!m578z1^-K_dKTf%LZc^
zZR?IIvW0-ZTmcGGO#OWjE_KA#iX-=Vl6k6T0VccJgAnG*#YPS9%Ox{3PF3VSo*BiP
z$oVM|pDg{hRFYXk7vVd^B_17C?mo*}xY+sESkOy#$Q_v&5ce2YPcXaAc)j*^SHNR1
z1WTI#HZ8Dkvy@mS^84R}F5xLfdvs=%@n=|FFtdv{(&g9V&m*z-U#sITcq4P=R&KXS
z`zPK7@i@N*q$%d_=h%%vYh`RJdft|gqC?*$dKHvGYQ8_cK*VG!_q~jMgT&FxqiL%^
zGiKke=en}Lh8DnMK%Fme<QJ03_n>U*Pa0iwB@Cl!W4Ywf8@uMyMt8X7a<e`hyN?K^
z<iAdlOWtyJH&Z0X`xeJ=>M&bn;xW4OU~+tsyFJvm#_CvIe$PM~S2_Jli}K_RF0OSd
zU8it9KnHbw?&Hif3yNTXi*x-!)IQ@TBDjy^SN1%HQVT#o(Kaz@7NPo9ub~;{p$=}$
z0-lTdsE3;t{N8z-+}B;qI;+XZYmkd|;)AC~Zje7#&pl_IG7Gvv6(>4KAYwhxf|01m
z8wZ;HZ2Bm<<<{kzPhxk6fL-M=G*R4^EzK07GRuGS!YnGj^IdIuObT<WYfTmN-TDh1
zJD6?+rsDT^L}SBJFy)=f!uXC_T**1k2#$v1SH8INq{F{$o!L8^_Za5lDTLEJ3BPji
z0DHhnbe7{O8W%h1{juU)%Kq_}0)tMGEtW=@B2c=Z=8z0O+NVCBcwklobAfV@SR!1a
z6+fjR+cpgw4-dLnBIKL1o6-i)hZ5%cvB}m%QO2Qz5gMixX};}0xCiW05Or7eTR*AE
zMA*+VeEC3+p`gimdL46mv}x?jF?%DJQ4`yw>HZfRJ4xx^%(qD)DsLMwFS@BkZQ4-C
zUAMc>ub#ve-cj+xCAU`8fNR319t5AXmjVB#+wFiDz56F0nKXhW8&%SA4~hy(j6(#g
zg2`hl&2oeJ{_$O|<*z3nQW{}3-qjvdeIE^a<4*z%=ncIyuyK|nbd~O{^Zniw@>n<S
z_X#BB%q@ml$FiUiR#NdCzBx2VY5#8W`6WDuJf^)xZB(w-g#N|_zlGHfAA0G+B}Wj!
zd>m-=&5BUM*M@z}?L}rAyZDK7mx1t|^W{$u&e}TulzpwJu0W+ev>ts_eqgA%TlsTu
zng?6XR(4wuUcWYzhbD28iAH2Zt%{1W_)U|MS?Y;P&&xDV-K$eiUU>{ZMh`VgXwjKX
z(p-HXhgW9tD_WA62tli5`%5tA5SHjval)(qRm4YNMVM<`+P>xv^-9W<cD11@mZxa!
zTj9!HsRfk<&G8tYC+Kc9Ra?P;@${yu+(f=?GynCLrgb$#Qsw)}NT3QcF;EiY{Dyv-
zHD;J1y_rUf-g5)ec+)c#t#`+iR*s^N%&bnL-Fsoqhe?Hd2U$mExgqqsW0#Mfr~y>Y
z1^%IT3$Z(^+;wV7$E~lA))fyPqp|)Mp`Ck>zD{U9M#F_KR-?zpp%Sl4$Fhu(D>qFX
zP%~UX?c3Mt-dM&M9%L-g@f@n(H>u1GiE@N%&7aOIE0lAU$y#6^)DC~6Y#L-7$Mz}s
zyO89rcbG*A?l{~(=4HX|^RkyX23BPtOgd$2Mf?3WW&>nXfK05>BBQJL=euK9YE|zn
z4QvYGVRE+L`u&O!tn<;OFikh$83ef?pa^)2#S)*)<qjC`UEmO+J>-WNjcuSNFnAoQ
z^2<a{rr7GmrG)^GhTfi_-FQvvxt%Ts&&?(>)1^bBcRKe|wtGKp&%0!KBHB>3p?yqC
zAK+r2I4|Erd>?$@zG`s`R~`wzykP|W#gNhG{Sdw}bGGEA`PUs?MQXh-AifO%w2oN1
z;$ln=@lLI2x1iDLG3vW-c)Cv>i{uBv#Vp@RZ20V;c&mUz0iRoY9N#Hw-?{z^U(dab
ziLY2Y-5Y88yo!?iBk&04b%!+1H5=2n@HG4F8De<PHA2CEp&yAxnKF8GyQlvlEN6$C
zn~Z+n+3?*=fiot<E5hB<=S41TV>l*U$9-i(DP24R%L$KgY;iQJrdGV@{+rXY=6{Z1
zA!bvGNr7bhu%%i7>R4C>QDnn#=#}H#LG>fQ_HEXNTzj8s{>cqnA76nt(|S#n3ho+D
ze>`|j<dN;k(Kf%NydKyhv5gu1OTZ=ea*+tf7I&`zZx3UuBB8Wy=1Ie4Z>9^TV+WdE
zX?V9enDZZwZCQ7ycHsZhumpwXKwi97O9!5Kx#c}P_7EcgoBr;89)0<FD9N?*EGsMh
z9j%teGKO<kS%tBUQmM9#p<Y<v`cx8JSwZnHJQm+Jn~8mYY8oZ++O|Om_}0i}bJj57
zZP#mC8@XD5f|XmR;xmC6Ub19eTC&D^1t$#fhVq#>+OU}{V_YTuIT=o*uqmP<?uC!h
zlVPPqZIi?`Y(>ut(d___d81=#f!+)Idi+AYFwgWl=cUDBAQ)G)i*N;NAO!dDP%{16
z<hjn0dn3BmyT{(A&iTQgs`p{a`P*>E>Nw|yL=7QGF8YP&Dk@yU=B}UP7}3ta%Znbn
z|MPZrL8Kz2?icX8L*y;wBWJ%6%6<Krzl(=s_ogvZ8~IKXx<7?#nZY)WOjs`~U3{Zx
zmk9&bixB3bc3RH&;IIRILEQjEI1)v@>#yq7wiQ`!zd``-Mjjh#^fYF18lthv6Pr9=
zBETSg)D3l}9m?Q>g~Y^(HDbB&7>c6Mh;mNl$Dg#=hvDvr9dgU3?wYlDFfRr$B)vV1
zo~O3c+mfB$965`wQor+c;02#s0-+X=U~>*Yl5|(rUip_F+x)uU(??%U65dCHs|Ua9
z?C@~XI*HG~Jf)^DBCI*+DiOAeyixAQ1{hPFVn^lS!Y(twjkuOREwkJD&8fz^uJmki
zAXEo-@aF}R9;%7YZ!lU8TKv(x(51%v?!oJ}d`<K5FqO<_K(td_c|co3-6k{%F*=pM
z*8is~iFi)VkQEBU89;s~uQ8PQn>iXReF{4qi^CaebZ=02!B(H~%LgjtxR{Am^Ej}`
z^b{$}?1iqtZ2*pYb4vIK^RAQ*1L9vBwthMwfA`=dEK^<vNjF`v%@>TGY?b0W-f3Vc
zYWn18u-{UXuWp@_%ZrC)i=Iwn-jkS}r0Wa4vYp@Ko2P2npKH0KWt#k%t5`u#(v`Vs
zmG!dfZt(tvHT>O~0k1YgX{k222lxz7*P>1v3ujTO#DS3yZb{{%;%KCtPwb(QEM?V}
z6WYCa+BQL3tkgva5dNwVSx+7N@m2_pG3BA7@VID|xv3v%*E_HuK+44P{DQpWn4#2v
zMt^l6kjx`RdnWEj84wt+PTDp3qx`}2)-&$F|2}<X$OzadIM8Zudnu%;+6$XKXr3&l
zOBgJxZkm=j@LzS5)=Q**b2oDTN>)ClLLQTU6t@xO6fo~rFjB()8@~B-1pyZ`Kq{1n
z=$Ky?mL=$7bH~mftnF%3Vea>j5NPWjso@8HMHf`k%dD=FLuU(Ot_DICrqgim3dyNW
z4Fz({hv)aj0`zsKSiy$H07lE;f!alRjiI)5grb#>Y0YeS?}hfqU5jL(>6WORuK1>B
zw~?~EUa*XDH^I&aseE4VYvmNiK5)y8Hp?<8)F5&{Mqge1V_N;LG2<H&BX$I{t26S&
zvisWGeZ4wwc%q!u`=#8C99miD)io{$K`2b@3DN2NnAQ8CVh~0iYNUQo==*PXOzRT$
z`;^n*rgnHq`YAcX<vU{MqQboXK|pZbGOT}3UACz$A1Jr@?EPXLjJ8vFH{grjOB`pC
zuEF<jo*lJ91G?79(68ao)kGl9q@K2X*pLcePtWOr^*W;q;5fc@AlT+p0#JxeKZlkK
zW{sVkb4akFQLJy0+51I&DUXY-L!or?2)`P1>R)9^i~^zBr0duR(R%W6CPMqHq<M>x
zuK`en?Zgu3)|0Q%3e&wMYhXX3Lr=&{xbq=ylRCQ1U?&JZy^V8rk!;zrw-oul!^eJ>
zz<tTUwaj~RCj5=xhA&UWFX~-Jd8vAj0LTg^mv5`#s4LSLeEJw2mi=ll?bVlV*$};J
zevWt6uTY-MBR)&XJkBF9tuD}rxj)&k8p4=v<cqC>n-_!wZ5aMQt$N~Kp!MHq?Rrc^
z8_{{bv~rG7*ix1{=MVdoRqC<yi5{Db5E{eYj!I5bXUfH?9I-kfW@3eU2axg_nZ8%L
zUM|98zVLnL!alolK&7?Qms(Oj+_8wb8kl58l^{-4<?`T7moZkPE$d=S<C+K76Jgh(
zu<_d(58yh18~-tZFO@~ByN*}e?jQeYsY2tbWN3=Kxr`5`M_6f(PlSzkX%}vzJ#DLm
z_p9>5QRLJNO&Pz0Q;=fr0uXf&Zbl!ucn7H3rj-VKS2Z>LkT!X~Z7b256@ArKjqd_^
zmu1kO$R%v%FIT+BCE+pt4&lbhZP)@MmC@L~Exd>68&ar~sw8|`6M%;cC*Kn)Gi!nA
zd8&NxrIyxNDO6<&n~6xd+j&pI#O1D%l0On!AJu(iS8CtH511<i6U_D;&$gPr&`H{k
z2NRg&r{69_4dY|-8v_sq-R>7o96k#PwA&kq6AhQ+?RpBuj}4X!Q3|@X`z;A}yRn*^
zaoS=xcc|U#3BJ1~?;IGD?;T@mKu>GEo(~_s>xSspKDgxjHHs3H_M_4K=Ib?5nqiLr
z!b|_}4A5+S(n*yf9Xwtw?chJ8^X0&e&6Dv_8Sg0xFwk@2RwC5gH;%J9U4bwY4P6Rs
z71q7Fo6D95xjnN(v~OlMVvLQ=2kE!tNBO1Hv&VmbSlM-Jfz2zCk3~l&984p0bIaCF
z8kmMw(<%wy%ZM5+Fx5kR9Z9+H-p?>?+fXur=?I1G%gX^zs+VVfQi-T}Oxn65Kot)=
zBQyf@2(7Fo=+ak+n`O*xpekv4+0W>|&nvW#ftGVt_LQCHB%NV#$zLI7ZoLweouCol
z=J<Ss???ork`Woxa`v%dqCpEaVId2p+P}&;T9p~-%&$#<m>bwY;3Y5j`Vf63@&jkl
zSp31aE$de-oxMzJX#vo6%)9?06s5M!cah>TX<s((QEy69UnxvKtAp;;`SEOdFL>c`
zWDG5DH;OT-{(vz%b_TZ6XOw9tD2q$42-#{NY~oGnYj>)9*%ikAONe-x_0A+Cpogb5
z&0h2v!@Tn!(^R_5$*KI>v&me&S45rVUUzGkG)^4brd-I;6^EhT$jC#?bEX4jAMMjM
zmC(BV-BCyw8s+QGaS5Q7j+NP&JyeZ8Y_DQe(ds7H2IXZ2pd+f7r?9z)Mh!bZjq1`l
zGn4e72QazAyBQ{o+YEd1R4-R_3rmJ_kE9(>Q}2C-K*w3udw#p&Fe5xTztt}C!75UM
z#qo0pJN|e~;{A^vXtYe?P+dBDh=<C4s=tm2>?TqH7=0qZ_rC=fRL|o9LhSZ54qo1^
z(Z{m?7G}D>Oou9q^xq74m4OOqAKgi8A=oNzg`M*9lv?{t-U!@~rKV6G(NVCOR7>9N
zGzdehTsx23_O+dO#c9`|jF)~OJ3B8nXbp|y&F|+7GTto>kgXSHVWWz5SD@W@{d9@l
zhJ%!M|BaqiMqgfioQq>W9jjN&*4Kc&3HTf`y++0?>TvbVM3A$>XCrib3EI0a6FEkA
z?FW89!s?Qz5U(<jv32v(J}NCfZsCE0xF&g#>`IcR#Yx}<q=m4lVMe|(!!m(jAc~Sv
z=5)K3m;5)_CwrpY4O$R0x#sNS_}d2^ixY&S?c*o88sc!-fz<9>$C$^8+_FtJcd{7i
z<aD=yY6Ia!d%r0j#zP88jX(`jx?YT8xfHC`c5WSvaq)rtpWf((chsAE%*r%VGV&xQ
zFqS8+OUHb(F!Wr6nQ)IzckO^Ppj#DmXHbv_!`t5D5!Wf1Q<<ZDuG{f_&J2MYN)*qd
zSUGe%Noot2%V*?)cKq&(7{`~u`ikx6o_o5fV?O&s-HRa`hh&@q1=Bq{K=@=V8Fr+y
z;fh8eik6<9M32cuqbF^Q<1@5XL#J1-?VcNji}8B8#ordGkkMLZy@B%@%w!9}mG5Z1
z9Hkt<a(!s+oNo98?CY|Sfdep<p_nqtXYth<ci`lFL|l^OUObT2%Lv^DW<nV61`Ar;
zS&wwX_cF}WjFWhsXWEb?y7UU4doo1{dT{dT`B(El6--sX$)EfQ=}SKgJ--MF@Fh~x
z3->6GRUS4HZ2gbKHYxMrOy`AWV8+gFF5cu=;(+g-YtgMlYsmt^j9nCTkP=mwj2mV#
ziP>bm*|l{>4*1Fwa2aJ$URMq;w10H+G+dL(rf5G&r?mN3Ebqkl$9&aU*wtxLvv;HM
z)s+i9DM8Z?IdtaYDdw{`cT?%1ohQpaY!a0DpEC$5EN;nTnUCF5TX=fW``9lhnbkpg
z%Pcid5WX>|bg8WEVa@G5gFe5PO>!DeLIISmwz{(%U=9}m*!Kr{=I`lF&q@-<{7`qX
zUeq9#h}-p3lUq9#+w47Rg|;%6r`i1+yY@9wQl>Lv1P{#nw}2pPukA};3|_ev8v1QO
zUhK}-L?lVGkD=YPzW{nx_q#He|6a@gGHch{V}F<Xn0|aBt^=&==lI3jM9G-TmXJIw
zJH7Tb;B%bB=XHZ}v*={|MK!OTrOtb6U$dJg#1sjLyHsM;3DJ2mB<NcApKl~su(M(x
zER74KGJL|@0ZuykwWBho7vf#%dqw<2;}{&``IK_d+mTcup|r56Y_z84bs93BmPb&J
z#rrgd1lij^))x9p$daW_Fpt1eUKYMKPC#$Gmr?e1?pe9%feVdTSI31=Ao7^t8L{?Z
z7_)=Os^h*$`MtH^I1b6v*)H!o@-rJ!PYprnHZO0-$cv)-W20KytgT(P|70$g?T)QX
z#D$z9yu=??MYI#fRt;t5BSw`PO&OSd^|K_*ty<<xmmg;<^}*OtMFsmcy^M9}wWnkM
z?t&2DE{Kg00+6W2_FTNWrjAkj7k<Pb8@eKTN?N}UIWF_%Z7rNy25x+j;0{_bDciaJ
zeiB_m?y*M<5K6t*7PF3Ifky<Z^XW@5UpQ^8+6+d-?b%AmeP^YD7oyW12Qj?oaDNM3
z$~~L{>=Q@l!^#Z~p_YM;+lYYzyxXSnidH>L!{OWG2<J8}7UOme4euKmHH`=eSIHmY
z%3ztc<}(p&upLU@(B^dUXT=qj4_v&DG~Ch|>@Fb0lt0i<@3K`D%_cdcwbbC>)jRro
zer?w*lh{ue=*o=X10rL3Iq1xveAT|Uz6|^v)F2zxK0u3|&rI<ig6Yj*>Ljw**=Yjs
zN_xh6QM3|QB~F42D8rrlrvg5X+ja6RULUDA>FkG4SeF)~S=;-Q^AO!=EVGN$`+7Tv
z(|VdWGZ?&6G^=-xVQmGm5Jhc<t)xBC+R3Ui{lT*mv3{!4^C*Z=oP2bDck{)m13w=@
z==9`J=<GD2ROV69KQc+u+|y6)XVI8z$F0X<+7h>3KC`rcfGE(PgQd8|FO&MFCDa67
zXP~dzYloPujTo{q-`KYkBU8Un92Yd)#Upe?4q=qq%nopo+Rim~v0ci$B8ggK2tA8f
zZt~Jt)OU47t{pxTJs!ANy4dE%4AyxC#W3};M(r>)k>k55zAV3opHHTbx;n)hF7agn
zEw&dnfr;qp^)cHx`XWSfK9bPT`InOQvN9_9y$8S!GUDk%?6f;3Ncra$U>q8ZbF$xt
zm>_@pw)>D~VM%%dI_mL)UP<o7K0CCGv#DKbc;2}&_(pCe9Ji6l951q%k)bZOfBc@u
zt%D_cUwmL@QuEYkw?HecXFY;LUE92YpzXHAAi8l$0;RsBHH%jEc3K`^3M8QzaOGtc
z>Xj2S0Up~5FW?)k4s9bR1d>hy<3%fjA55|I;S*cN&q-XvRqgcOdN|I<!9$ceu_m5m
z6fLD@#Q#P1e3zu>0W6KLk7faIv;JkaAzA_iyyjlh)DL%3<R=5At_hN^B-NYVav0JP
zC+_T!FuR%PYu;`|Qr8E?!z+!@jJ;pUc3T48od+6(b*tApy>c9beJ!bdtfyn89+cjo
zw2$HryWxYM7-~)n#y<oyuN}*xkG;i~r24c+DwtJ{T~?zmsoD**sOB#qGXMbq;gc3m
z5#BlOk$0)@pWU%%UKIS>5nsu!N-bh_Y20&Yajx!7X*pE&HEemW#2p<!p;vX(f>z39
zW<zVvruB}UeRr|>?16GU<-T@}Sd6n=gbn{OCc^(^xin#sT%L4lWD8LTsMV4TFv)A7
zW|~*8iBZp`_!t=ZIewdx@*&ZQ^6J|a$t!EzqvW_Qg4NITX<p*v@HL!5bwgj;yvfE_
z?MM&NMKYs&U+t1kHFC3nEvcuMPJl(EAzwrUum%&5RkKA1`$xzqitdh$esZtQ$uv3Q
zo#mg8p!YFAaP8hq-%`HIT$R|=|F^=D>ANCH`E)GBeZ`c<W%HG7{@{2B;N*1#U9y}>
z;x01y11yFvXvyB6iIc=W{7`G{@RuhbKx~P!c;>Y=y=0c5RIvps;H~*=S}|2W<IT*>
zp}ljHo7`fT?UFvUdn`FGA|KR+AYO6fDTQhdNBEBgOVt$LiV*c_mlGpQJyoddbK68u
zc0~qyI{`eKQjjca;|ZGg5#Ds2VD_%+JhSiradaMzRQ>-SuM}lg${wlkDP)gpR+7p}
z%62ai=_cbE*SsMlLS(OyQN|5j^Sal_=GrdTxb`)#Yu;;Jzw`b51Gwip=e*v}*Yo*!
zQc4VX{49H5ly6hT5^Ku~F+D*p94T&U**m0jr>l{?8JrWy%=S)wPx;xy>G2e_?sm$X
zB{r~_e$A(GQNVLYyywFx<;{Avpk@-HC)B8}ndn4r0+shuX}LIrO;)YAs-@ebWg~t!
zGqLwCM4c3ZN|U@4rY})9mdk9hN#HIsP+_BnRH|1$<cOf(?Sq*;(EuMdGbHrrg|;j2
zb=-}4WdA$+D1a2OzGD-KaRMrIdkUmCd2Tz!q!80j9uPa5-v2i^K#A*n%+Lr@Tti>o
zh=TYl`ABSYk~^1eos4Oy5gb>F7iRAt@Q?4oFU!g>kmT@G;TN61`)0jgrCYS^<VOzG
zxZQw480ngZmYT2$q5gRR+-K?Co<t$%I?z$NGyCl;6}Sr=>@Q^C?hmO8L~~%2I`v0-
zK&rfz>^?7Ms7F~m4w=~Sq`GIBR8@`Bs!#yi#d;7iz7y1}Xdo_sv-pDykH@(!E0AWU
z<Ti{;lbO7%t&)%<)zOP*<ozK|*fsI*sKd@cx2*fv+rOB~W~hh##44@G-dDcHB9)qO
z<@+{1*I;wOKFI%dCN<3#bzo$M&O3cZBe-hZ$I>Ot{XTv|zH!BhF=qZ?*vQO@#pMS{
z)Qv4azfP|2@;y42&GUA1nUuiT+5f!Y7&Somy!qqRU)3vL)E6|H-mNSd$NDKR1<oQz
zw6<lpE|dHyvDOrna$3Y4`oMttOOrm1dTn3k>l_}F?{-kx|Hus7+el46rxhpp54G>M
zt?u;wo?2$<rj7be0g)T>>~vW#{xOO1B4wGnxc$FL6Nqa9?^qU|6u|gdS~q9#`{nBT
zg_|J)ujR4Xo8_YZh{FsQS2%A=dtXERNd<=r%(BJjLhox2yvQ1~4{bAJ8W!83=DSXG
z8X(1CzcRY2YUf^XiYY;AR5qIfvZB_&b%*TYroLe5>J?e;jI`@Lrst40aQmk0qL93L
z<bq&rUu|!In=D1!(2sMRqju)~x2K{WQ{b~qPnV&y@n63d!V_UX<I`?nP1~wVi3RPf
zG*B~#udv3pK|Knzd3{+}C#clR78WnXNP6&KQ-VUMqv&yJa-i)wX!@&V{@XgU1qpBd
z#=n2JS7`L3l1X#t5>VRcGG_K|@;<TYWks1hzAJT|31Q80Z(XRfE=#oq>p1X_^kB-X
z59F>cwMJO@clVdH2KlVgX*>RpmTv{5kUSuP##5~HKt4arF2gsxmi}%^pOO5b0*g=k
zBP<t)`^4gZRCpn1q5=S4`!{E&pzY_Xr6`tc_TiMXhvHPRb4bBn@aNrylc);$C-ML9
za=IZ~bpW)7#N{iZDw!4;eqBraSiWHD9wEE`3f__M{*f%7#J_!cj5I(u#0bLk?o~va
zs;%i{hPoatSy*XGko2{YY&1}8-@!myzpyl^p}%w{{lADe?q+T(b-e*DnXse0zP}0y
zv%@J1_zyJw?8D1@tKPu+Vue{IQAlxioFy|&pg~FTR#<gH<><DTg5Snt;dpXcy}ueU
z@a;5nc=s>Z>rN|~jJ;fpG`YhqaH%&S&4kDl*prTmu#^1I<o!;6mte7=#4XSJ=S2p3
zTMVmYQW<<=RFGA^zl;)@o{u+;VRV!k;}`M>+ZQ<0M}cXuv;)FZ%)<oH@gugQyaA|L
zfdA%~gAEyT^}t<1Pm4-7-y}44+PKBGS<%m>s869C(s%r>5Cc5n?`eUfiPt=pkI=E;
z`uzi8`7QO^hgB_q*G03=rCx*^a(=z}m2Reoe05JHZTHjlb@(J7P;$n^<<>|%h)X{p
zL}q#WIcsHPK8OL($LFz+{+uNNgqtVhFJr~N0q=5<$Q9YPv5i&y!S6%V@MiJ9x9?rw
zG4DdfgG!7v;k~uh05P~cYvwMadf4m&rU$RNd)?!T_-h{kI>}-;ZGG^FLZ-YEG&#@+
zDxu+&r^ztbXb9(jhVtO|g{!3D9yO;BkajulbVUu)gKx{1W_7$13P)VMb7~z0k7ci2
zu1~Jv>HQqG3-yt8>^%FAFJ-ahI^~_u@z9J&%Ye&c=^tF0T5gXD$n0=tyX8kLLfg6;
zX&Jw0t{jD$<sbGkL|j*ER218#N&cnveTqBI6JlRKyOU={d=#DtR(a^QD-VtXE_RA6
zr__7wu2`yJ^k_h-I{Nd#)2Z8;mCvx=x`lD+JnLH_cffl;`f}RL&_e>HuVo>{K51lv
zVYaKjQ|v+S8I6$K-Qu+iEj7>l^cx~52-e+V!`P6Z(s$0ZFUJ^kpJiHQyN)5dS$QYt
z1JK8v4WK2FR@{E+L}X*qL*V@D8}R%s^=QD?yTO#|aqanFy7d{ht338TW{4JdmSfaY
ztfeXdQ4+SuZ^Bf;%2E=kdf~sfr>2hxAo-x(n-`7<0ly)wre&5zlR#Rh_x8c8Wqscr
zEsq%yCCA)|K_V%UU$KAsx|#7|K|bUFlislO7*j6+<J?D8%U|&D%1?bb3X64&vS~C9
z&~Mt|TtvPRYT)9%npbf}i)dfv-7=8{*{XtVLJPkcxEKdHWJy0LPASFi7gx$x-kg}5
z91KKrsfRU4AUyX1efB(XUP;&_4M^zFx&u75Km9hHaDhMQRd#5^*e67a14OM<fnz^S
z@s{&Y!ZCp{s*Y(7niJ~2XiXVpv<#vP8*!|xteD|+V#M{kL*K75RAtLmKHEoi&l>$$
zTi(-Twj5KacX(=<7nI}wlBOSt-TyW1-w?ad^2wu2Sv^db`FoeillpEi?aEias$KGS
zJ)1r!+gd=X6c4}!bIfuTe)a;mOX&?N@1=rNn;VvAOAR*EUETf*#oQ{T7M&htzBd~S
zf=6UlTIb-qw0&C!Gz6q7Q;^sDPO>5<qb<8!#5R2vKV<$D6W^@fmr(v~<bIGUELS1L
z+^}yR^ijL^rq>+MAtThVAI=0zgT9*`9`rGadHI}0&{4waYuDDl!niqLc+)p5otKB+
zuy4z=^d0f^JAFEIXV;Sau3pY9#Y@kr?FUfA#%oL7PA}QSu!e&-lGR%-b1=50F20iN
z#osef?N<vC_~j#hfZ`$v)M#cNEkC{&pD_EX3)wJU&56xGx#r;uD)?r)zdrEJ+!0cQ
zNDyyjG%5*i0OtN}#MdUttC~EdvZ^|=EJzng+QSksK>r9=M&sknm{XP@90am<T(&}c
z2a~6H<R4p-tC;j_9%BU`yT0nd;}nb2WpEyi>vvmBOqNl+6zoHP0{x@5MGqe11Ob1~
zjQSsp^^qB~7Skryy!h($E0=sQ*PpAOSZTPvuuBLpBbt@ax7X{yL;NddJM`$JSH3ig
zlcy)|2I;$%|G5UGBBJu^$Y0kO3&m0)>3^bBT^EGr%2dk#wF^L;m{{$jWYd>X;{JOs
zL4;Cz`%i3D7t9jw(~sSd!Ch@oQmr&8z(o1~9iXNI4i;C4pjCHuX_k&S*ItGVQ%yy{
zl%Q3WuJQo%$ckfYtMja|^DykHkjG$gv3zNhvyfrdnBT_EpT~&FfP&>$b@iMQGi(OO
zXDH#6k7|5S_PxaU$`H<!?epwT8(Vi8!9&s0>T`@tcV<P*-kBz(zSKE>)e`zW=SV}p
z`{oogTTdtCL3R$Avk(I%WvphPfJ<Kx73e=_<33h>iQ_;SXl14rCoH&@&{M@N*UbZS
z@ff)_qIr*tBi*|hqhXu>cc}!Bl4yCYzbrh{P-am(vGp<Ig-aidr5_o={(gLf)L;>M
zHih+Mf92G0b+aq90@mchb3SA_QARR~O6QLHo~CR%d3T5fu+#-C)eF_d<R8eXztBOr
zuq^3;W>y`P6`q7)tA1-7>TttxR)Ms=>O-Q?Uht@D#`Kcq{DAJ2<?x?aEjIE`3f^1g
zn6(D73+V<i#6{?DuKc&1I^DCH_-i3r4-mLa`PXVp<@`@VkZcw3*UiD-l!pcNXP1yV
z6Tb|(r*s65qv(V)?eAw&e0NW02GWteN?SNr8_RojQc0B@O?bz<QA`<6)9yQE)+~xt
z;s;ygR%*dGfAuXZ#l7-eEGbJVQ+{X(iriU<U3y^iKI3dg;6+T;b&Jm?ylu;!nVW0p
z+k0s1&wC#fMujD`;P0l}{rGh$OSaVMQF0aKgA37h|Chd=lQpd?-|3m}&kkm9+yZb$
z|H~tLu164ZU;gi(3y`CuDQ2OzCLr#s+3(^b=V$`{>CvY1;TjB~a3VZgDj;A&w^SXk
zKPC@~B=1B6DMjz?DW{oQ&CH!uprM&ZjhjCLSf-E%FA1DBoW3^8*_s!*XnXJe?eK{w
z*PiNVd;`-Sq7~VbtJ+{pF&=7&bXPKX*tdPfp|)yiS5Ob2pRuCyk}b*Wy0|;C$jrIa
z83VDM9M7IJY?4c+yV|QmWxX2vb{fgMAXi^gO*4M;3pOsToZVnI6{>H^CPT5N&lo~W
zd(fUsO<d+rKk3Jn1CqQ0Mk75`2h2A;^mOTmUl^<nVaxUogbrTMbftZ3H|Dr(PAg?j
zyMIzOi^VBA+PZHhPO(91`bpp4PrllYL&bVIE6-sdw`|&A-y)(5*R#SMmxi^ZYuv%y
zUhLp+VlIW-;xX#Jwuv^~E>q7p>oJ=)nqOAcx&6~u>^$NT7qjlDk-`jv8w!7KN?2Ro
zW#{sBK4kxPpzbN21OtcqNJ?9~RQo10rma7o^itq;(tt|S-2RMKD%Fl}p(Wz2SfI9d
zIBNe}dwL34ujXs>-SBl0)x(N=RNYlyN?p5H61X|Qz0X2)?ZkXg`_o1GUz>>gjsKbB
zxvriA%(6a3Zz@)wMIePgkDYUN6FBPJ_=zDk1ny@-%9rtE0$!C`z9-T*T4Mec{j8y@
zmIF>!`tEuj>oXmD1p+TDF<<_yPvd;M?7Nx};elZcD%tgH>^upNG!)?q&|j7Qlk=ai
z*l#xs>oL76@KcoRmq{b5a>~K@Se3zFNoMP@vUU4akwVh@cL~i>Jg>&ucab{K#{F6<
zyVIKLwvd_RX^XsCi0jLDV$f{gy(Kjc?s=+~fePetW=nw7<gTqv^O1Y&L-9Ck6`xqe
znOc^V<}Zmf4MonqK<!&clL_GRc;E|>RoCnW35s%)gG$wQa!b}qy&e6-+Rb%#<FAo#
zomdvbgFkj#;BXQ?9VX&&<E2pqpMujkw`x~9%GR0R1fHYfif|A$o!89Wj7kd1?m5<<
z{V;??{mWyqHa~RM=?q&I(f!4Nkl5VMrp}Y`mJ^`%bC9kdMEBab%~Yg;;f>?BNZjUi
zk{3X|P*MSqsMjzrE)cqaH)~uN(n?{=h5JU)4XMpOfgr;@!G(W(0^b~)54XDlYxbF2
z_7Pqw6mk=^eTm`asDAds3--l8U+ln>R$;zhid>jKy0ZZj5{nyohfAL?p1!3J(x>0`
zWEyOgt-I`^j0N00$`I=ZN??AMZ0Bz@@2m_#6F=%A3rj($qpVg%Qdq;rGV8#K07X{K
z&%x{+h(dU(^$1*G<caN@4uY11A`C<E!DcpZithSfMDNdN*0oH~b=0tJtK2{ip#(z5
zbfJqjo2s`wHlAj4bqSqAHuODraVWY=EC*o2g!3QH`Y!ef{8Ti})h(kB)Wn9H<Yfph
z;Nyw10`x~Kh7Z$#yJJT+;pm~~;&_<ly<(g*?R}H>2l(<GqAYZ3KJnZs3pnlLg_839
zI#(`k8^=a}&-@rhq{}2j<0AF#@R_cu=PS?^HABy{?8JZhPLIrD!d1L&R17@_?V87f
z0e12|-heZLM*ha$_mtRMWLRxFtB#F<7K0~NT8wz@mV350%J|x^3LjXq*ziH`@RuiO
z#C7{VK1^X_6Roup1qo*!-3r+F-Ib{eF;^KXFsA;}6w`31u;JGHPSroH<+27%v(mPD
zZwgn-tO6>Y;^CR!{=3xP6_F_9NzbF_OW`?})ba5U0$ninvi*-^ODF7iS5Ym^nlp~6
zt-ipLG3G*j>%kZWyNR<otF^G8`InD~p;;OgR%fmfVINv%g@+rwba5Qyh1L|b#_UWZ
zyFIo8xnZSzZBj=YvoZyWNWnA0!fyDiwY!Qfp|&q&tg;zXXLrqJp<BuRn=d9he`&3A
zt1gsL?}Cl~JfWgTYDZ~K04tIys7Td|1HylV)!@(A{fN|P9zQz4Y{E4<t(FFvo{)HV
zq?wc$(al%u7k3Bm1-SfZf3)M4Dlv(FbR9CWSRNe1ak8558*QTplW@c)PFKlYiB^NW
z0jrrFC;|1J5Y!L7TP(^08cLqdd)?z(KY-Z1;3uG_I)7{?WgTH(eP_Y^+?4krUYbSc
zf`K|R?UhQQ-|K2!V#cK-fly>V_sZ)4#D-2<rE1#Jaa?ycxmj|1FvC@$!HVBfCyXRd
zBgjY2El}`=-`Phr4=+1@^-pSD!`Epkx!J7~%aImSP;SSER+NXNW$_rXo{Dz0;pMoC
zyI~>}lxcv}>CvEuqgP$cw)L*&%$>^BNy^}PW+&H~3}euY8%)nN-k{$Ih=64!8U_8)
zgI3U?xH<6Jy1^Id!}|DU_HoHgn|M5b;P%A&W<DvTni-ds;i#K!AK?LJ5SEyBteX==
z-_11JLgj}xG3}?bw`HLJt{&NFW(o}~WQ~EMG#q`QjA=u%3t8D9=<Lztaq2fV4o+>_
z;~_}>&;}o^%iiwe+g}-hi^PP1Ck3LZzXmmW(Zn4gBx4g5wimY}L;@}arEa$ROV^mn
z`E@7-WoT5wpH<OTW?ECvPbXyU2Y0V)r=VzrvEuowy`eeODS8tpA|ul{=6_=*@>7#-
zz-iPg<L1hWiCAOlk5``+ZIlzy_zG#v&a!huXT}m#3a8<xYd)fS7jbQ0sG%x=q6ACL
z`WJR5V<Zo+snF^ZI}sinmxG=^?jA(^ez$39$*tfV8qpI}i(K{n&&Ylj$Gb~3flN^r
z35K=8JC-a$a$cadd`07S>#iW<zVTKk51vzos%SSrB~EKf5)pHy;lr=WCnBUI@eY_<
zzmT}gL4c!le86)#H9}D)Uw~0a&X1shMIa`I#dGf*g@N^4n_MN!p;B`KH4;AGx3?M6
zO^W1s)faBW2(6!dJe&4Ry(wVhwo!{2RcuR>1O{=6BLR?&U+Wn$e?}W<Cfb`9%m#lU
zTGIOxBeF{{JrM)w!g-q7wJZZr-K1*s7WpGU=PVlGQ(w5gTQgu4_cZ%0H+?7t*?KzA
zkjNqAn|75u7yrS@^b@=}Wk_~WzfqeU8IH(;mZWvRTs^al%7dFaRgG`FUA)&SCQt93
zc_rPZ*)#kWGI|*2EmU=-<^JXOk+U)Cd&Crmtjel47ojz0=eAx?!iA$wzzvGJTC!_1
zVRpU#$0)aJM6%f2)K~eh>I?UGE{o&EpEW#r({qVN5FtB+Bq)1D@xsnwl;9kqf#S5E
z$$7D4J!-~bvet&Z<i0;SjE#N$oSp<}-F)Hm$E~jkpqeVV?7|&EZgT>><M-NV#+a7k
zO<76^)0ELfW89J7>XxMQP^Pl5Z^xS3Am{s|MW20i@1{LqPl#<QZm`YR4@qX~GmoX9
z-kQzjD!Vl&Dl=%4DX3MS*fqK#KfBUxOcLzvTpmxCqnn%lG3t&`!LOk(f!o@ygVaz>
zaZ-NS3(~3OLdGCVmQQSxlEO_vj48qHFeo2u)Xp(93mxf|?+`tjw}`?jS;X>7zsR*&
z!A&&$G`Zhi=>J!aZ%Ac`f>#>#*6WqtPVM4l31rvM3dPjEj%8;Ok3i}e(XFPvM?HeL
zgCyV>wk%HcbxmR_q|GmHJ^I6q|Ho6Dzxd{~mHd;lZ<)a16Z}L+;dZ&bR{P*_md{0-
zR^fa5^9bHrw|Ue_NZ%*Mx2ACBp<gU0$kB7|X8vvRZ;GXY(n4ha)>MUK#|+ANmR;V7
z**OE`8**Z~i+!BW_;!%VZ8}C2>)~v%UMcM+)SRl38<C;o6iXJ|K`!kwM+G2eCE{0g
zItSW>bToi19eO++D)Locd=x|NIeYkIBxU=HGCe2pl<%bxJ@ytG{gDnw?fi}jm(MHW
z@~+G}9@oOeAyt0BENn@Mt7d;8Tul7?rl3ibg<|Pj{z|5$x;(``B&w<xqya}wHU6}p
zM-gG*9+s8TM!DoB<;YyXoI73mbdcrbxwN4q#ZqR}ec9f_tdggECf~Ww%|@B%Tj;|v
zi!veToW*fVPv`u%qec2F>AT~Z+D5m3kFHYOlUbJ(JCI;Q-)e+5eH+>Fn#~=Fya1Lc
zz2?42F+Uuow%H^iTyjyo>+leX=sd^6=fDe>`Jc>XmpfSw8}CoQikv?RxXQ%J_UH=#
z)zhV3fL~<t76{Q<4+!722O9=MK$GX#cD0iY>jXB?X%YIz*U{Qdn8Bi2;PDag@tU>y
zH;xf+%q^18w70yq619Po;XjJ}aU~as_&}@o^X3JPgLU{#KX6Q7Chj04J9PRP<(fBr
z(Ed6dWv|H3LX=9GTbYDV;>6QhJEJdx^L0B_sDmt_cL~M2CBlv@=Q%(JS}_tx8wN&y
z9#FO=WJ2>r@kw>$VswDj94129GtTN271}*+20Ql)SuuK_o08e?17Wf89gRqhaCtkd
zgRL6gI-e$NT<k>_IEF?Vc+BX^_FLuWFmS3bOl930W`V^Of}BEvHl8i9)NaN?t7dW>
zX?006?5^q;2cEW=bjSrE$@p9i9p&VvgNkX(U6hS@-v}XXZOW8~dh#CYv8umZ`pCeJ
z2S$DfDK1NoyOsU6EZG<`Qi9<5v9<c<JMgLb!?KXH7*46hpf-py;EQUvyA1fEZni1?
zuLSG2QeV+qvr6v!2G1JzkLh3*h&heZ7B-P_{DLe(v7ARpl5PHW)m+=Z8`Qx@Or*~+
zPiI?{)_Xj5JwWZbv@BA)O0P_FA6hE>i*$X-S92uLWl0b8Ic~mkg=|S7H1b13@TT5V
zFIN32mhTb_T?Qpux)akT+rOQvFb14~2N=w#^BfZXL2VngmHy7Gy_m+Q?o^I(x;0)P
z&ia=Q;wv^gJ$=<aN2cCGqA1$zOCBu3&pgEqYM}%8kf(@#4gdazJ^>ToHp8!%v<MPJ
z=C9v9fPxw8?8m1now6y<I5@>Q4j%H4Nl56eOf^9_X1R7Xe2N2>5{Zhp5kyf6jTK!L
zFc~trbh=d%eN4E(B!EcxudMIoyN@LS#Wy%}0^ap!Da}UX=0sX-E_pC?A`R@8KFpxP
zjBmrl0t|PqqN7*?U06KBcRMas-}pZL8_0W{u61<x+?g>=a(4*+&fS-E!DACC+=jc+
z4xDR)As)9u9)RBisB|*_Vg9{3E99ovoAH|w*lZmHBHm{Z4lSZ?><*;izdUF?R817M
zz-@K}vLB#WTwXT+h6UILW4-@~F{T}a#5!j}xA0k%#eZTha_Fx9TBZZkT1eREHmL#K
z>YPeuct>rY;3X?iZRPK8IO^*UC~CW3M@6iYI}+(}n8Brdx3lqE0i#s72@IH)F!+%{
z2AOpEW5HnTeq32nw0m!(!1VJ*ZFW!c1>qkv=aWqGTD3pCDe^GA%+y&s!NrkUQWDOl
z)sd&dDrFG|nHWX}$GFZRSX*4Lr{U)gI-7jcVQG2UpIhr9tj;7*GZzE0?SNJR;0GQI
zEwjW%KK|G5(*A<1oojL#8Jd=WtLHWf&Jvi~e?-#E2uk#I(KmnnT0?OAsoEyXN#GVS
ze2oD)U;7Kl)9)b+EkuRXbrHgpIDh{`NOr$2V!@SPkqP0le&8LimhDqP>#ax`8dJM>
z&}HQ3QE_DeY3PJNW461*{Rz5NYe3_#w}dQ!(?~LBWuy|vMqV|iChp%#V0<2OO%4uT
z$>0RKoMBus7|M*)mJCjfeOKSJH80h5q1%N?mmAg-nwOW7pD4#yUkMq!^Mjfnn<$Ad
zSt>yVRov=auS@gY?0G;EtOa~HRwrcJo+Y<y3nF@b=OJoI9`B+L%oN}fzLa6RSlzBB
z>I0!|ZseJmpmvE*htMsalIKRewCR)tCOQF0w%xX!_GCIm>aeT$ZQ~lMfM4nE6WfCC
zV$s~<ap-Efikl9FeOX843!#;LwM7t8nt!}KQ9dCL1a#^1mV=}?$Y-%Q$@2Fr>Sj6F
z&*=bleAT<xNs^m_O7+uK;DG<^>PP~7m(<jzXraN^6k!4m<|Su6^RtOFSm+0@{J=+~
zOS_ePVF1?iz8ZCdCe!|Y;jv)!uk~17oU$j4ke=S4y0?6RiCb0k%SWVW#0$F1;&X7>
zR6A-03c^<5r0LE(^Xqter*Fz6l#?yq%kVQ&r|*$#Z_T0b>3?eV0ugqXFG4z%X5xS#
zM)Af{deLvfI9~J7H<5cXTI!q4n~L|JKqQ23qhCDp?<&|S=`2a&n{h}g5Y!9jy3+`4
zkK}%xW5kJZId)}&yC@zDY!Dwq(pS_aq>bF?Y6dO~f5{urVmu_gZFR@`C6M2^EosB0
z(3SxQl~vo*kwB^NVncvgqg=P@Q8@lvhQ^+Tsx#odp^5Ze&`mxt>q_n^O1=4=O7nV-
zm<=;8+;OSIn)<UY+X;1wWb=_4M$=s{vSuG*GF7@bcm)^{#AkN2ZeQdv96S#pwPt1K
zfX>jVk>KIZOZ)gGTjf22Je-Ez+jQ+iOGoES8dn@AR{txqFBjQB&S*DERyKXoN1Eg$
zKv<^B$67pwaQy0FXOL1`n^pmwxM|8_Yz9)pgKc$Lil|nIVM4w^5Mbcr2o3{Bna2VH
zc<<(oPYlyN*9;4R7Q6{=yr1-O6^EmC#E{SAE{X!1`znq!VYsb%lR{%`I4T1?v8^=^
zZZPIbo%N45I#K2l+t&a!$(Qi=^DsmN9VM9?mdaR~u_yRASGTp%Pk?P%Gj^ZTmA~(O
z6hoP@nUZ=XQ4;MK9Tbz>=U-}>LlW#M9UOb`;zxDvV|H{lB@G1QB>8+J=GhHwcd5dH
z-WhAp-+_0iopPf$IzU+4_y5h18h=Z88dxdm^+dL6is^5?$E^%%E^KPleGMx^`>=ee
zUB*Q>FSA`bwd7fsrF@>~2a+1fSLmqS!E=zQ#t6}jOp_*UF4WPePy;2-hg9nX=HGbr
zMf|P5lrXOP*0`S4Brf^tHj+N@8=7z;pzf!&k-z~epLwjYjllg}g}qkAKgkL`oj)u5
z!$-EO|8nsjYFD+$4yRnFF_&@lB#6UGtiPr4HVCVYQ<ST=^q&X;@t`M+a>*_wzFRjI
zqJ@|aKCxyc`hh11j*7%;%oz3h4k4t{tDotKM~|G}#Jf|=UGjXdzpcj-54D_xdaKi6
z0DksCN|fp%nG?yjYue{D2Uwu=K3rx5#AV68n?Qqu=(Pc;8g7t2uP0h?pLJ;B;N>j;
zbsXkjpPdwqbGw0mahN5mncP`9lds|Tk#Dnq_&De!YtLsf>A0TDSDYd%v1Q}iktc&&
z{)$)HITDL1^~Lz91}eZ^=G%Q%*vmHe18(_9^yAyEoeH_k4C)UTal<#xK@XprD3u0o
z><F=eV*_I~EG-`6Fz0L<>7=zw;%<Fs-|?n+N-n~isXECP7Tz(WS}u$+&B%Ic2xdfn
zdxrt7)Cx1(=i~*i^w9e8VyCg4wP|jFA0kYS_HxahV4OoOBJ#`tmU05;M5(pgVkQp>
z7!Vc}gHOEOV!J6nn0HYl@MXm`^EZjA8fV}x--0X2bJIDQ%71%<F<k4)16GTIICP8e
z#YOy}QOBBkj1L;e5GbYEBJDV_7?|$8v|h`#lksVj-|b-b`LuvQ_%Y!(e2aeZzybt2
zvy0lk8f8o*=KOYhhd4Ht-kzG++IvbN3|f<SRzrb87k8ddfd7ooo*!_(?%&#j4L{!S
zl>YeS;bpkG>)pI$`GP+ffd=pCl2;_0&l7uNtSkEqD%W$Eur@EW@$Y*s4vp`QTI*qS
zN;Q3?M0H5i$^Bx3W(<}qW+GD<#PPt)ZI|$h`qzpb&i)2WE1k*kxTo*8>EZGQyfy+m
z36Lv3pXXF+$_x0Y<F$K)HYV+UqP~Fn$LW?h{oV6-N&Z+$+>YXoB;)Z>gn~4VI&Mv`
z<M<}x{yPHFo-3RXIEPjAX@~gNMH)>jWkEfu&*^~uDKqbbn^~H(b4c6jGD^NkcYZ2u
zSSa}p5r})#7c?GiFGYsSm>#i0!Q-{Pe-iO8mvl4=EAOMTuLy_zxKQIoX3!{X=XX`B
zawEZZEj{Gg+S=c7-z)h;wn8qxzq*jA4`&wXEnZE@OF@I6kY1<~Y8!J1uD9!{BB=&Z
ztm|8u+D^mskuvm?1aP{Wp~<f%6?F%R={SJbeNTn`f0)!4Axswm0D4)~n$z&J-i32X
zgCS@8kijPvrV!?x2}?W^W5EJjSckWlW9~ypl-aXFQgj{ZQ<FIN0ZRTv{G5SB&tNdG
zJdY@NqPzQb2#4ad^U#b73wpoHQuPZoleE8S&_ioD7sQ_0X2lM64=mXEnh4R8lKb&$
zlU+Mjau>y-(X+3G6R-2Q4p#H6FC=<L7g^ibYlYxr7A#NIJ}4S?btG(8ah=dZstuOL
zL%Ol|Nc`ONuv$|!KJ@k;FC*gNZ;%+Td!nFq>czGaz~{+u?4G@~$0V<LNh@r9An<*f
z`4WVY>qZj*tf?hgew|aW(%?f^^{Q6)QP*eORh&vwNR3!=eq)C^^s&?jXgRs_=(_)r
zgU|-8nK^Kywkti@m%Z+zjLOd7-YdO>+c51g{OC!sO5OU#hnd_}imVmRc5b+Rx{8dU
z0SHc(!$AFM@@UX`q|Jha<R7Bx&f8GfZ=p@iUVe<m3a7gYYQ~=KMF)y87ixle7(?!C
zow+Y}`tR7hyj^rn*5lmoMAKL22Vm;;BIcZ+?{@1Y=K$rzc2>41q*sa*!;0)Jo=?}+
zTq!;1_Pw`wCqwJNV^!8|d+{8&zW@0>Z^2ec<%|O%a6KuAgyP6Yc{v+*U1`z|m<f1m
z*j<aCL*_G(ytZTgx3#k0y!B)N>zO$(E|O7)^qVGkDEM3{_#NgfQZp4$&X$p_xAu0o
z=q<Od116`|CtkijE8+mG3|-|V8?b+-r?{n-qX~+C$u6qq@P^2DG9d!?r}%iHt(L`C
zRW`o`8tNu{uWBd%bT0skf;vvS9t-K4l;v&-Nh5oYM|{J<F%8x#@|@@@N>S9U*jq8{
z0lI!c1i#I#p1Pw*Nm9uxAvqXM%;(LIOX|4)i3{v}UB%g-!=!ChV7rSb7>C059{s0e
zH+l5Uvq%>MY(vEx6)0N)rygdzwTz))$V(SEb{>EnRyg*u1}m2rNaxX2%Mrh9UF8;!
z6dlhTLSe^o04EsWfde-HgVI;P>-Q~w>D4tZlf2q9&!o@2!N&?hZV|aRx;!c8>4cHa
zD`!cc0&H<7`RWdf+X-HV99#OgZvD3m^j*>5YUeUT_PmR*-mt|!gB^0W0HPK)THfB%
z1dai@gnNw!zU~o?t}Wkmqpa#8N`b#zd*SnBIQA9=FP1enJ|jG?p*jvNKOns4Cl;z4
z*UNH%XqcZS%cqN;&yF&@*B^27K4_T{X22w6tvRJ159a4^1}?VK{kSlkG6@v?OX>Vd
z|H*)jc{KDmeVSl6-R_1lZs=X@&L9f?l5{FO15s<O4>ee@;|(_ynSpYTRp<Fz+l=er
zEP7Bg0*67B{T7Mth(#udp6d-8`7TbE$KF2i5&A-qjy|938MBMWW$dSLVNmbjW42I|
z-Z4s)gC%f~`v8LzlAi@Qv|Wrr3z*@NnE?B_DT1r6L>=FE8-<L@j!O>Wd<JzQOYHX5
znSfijXIOJ>rc|I;TQgt-2+Z38vL-`QV*D7y_Oz97mlkb#JL5ubQUB$MQ>t;T=iTIA
zeFG2KZY`l?iX3kFYfm%-8ru}@V2nF(`%AWw#u13#cRSeXM?(d2D?P{W?l2=W>i0bZ
z4bTkyb0z)(@gH-ExF`qjs7XCsZvTSm7ddRwdm+;4e@1O3*GC@~&M0Hf;3CatgOFJQ
zZg4@hz*@@5@8s!AOQt!#G8`_2cgDIZ*#oSj>bS%%O?nE`(k$(`egH_jg}j3)p$yP2
z>@HE4?GOZS^6wEg3fowZG~EY$9DZWc(xT8tX8C|w<W&4gFv)2q@U7Jw$bzN}NuC^*
z#k;S&2pslWt!Hmg&k7Nb>om%AFxN@{1f4L=w~d$ZRa!}{q#!((ITwH+w!s{EPG{0%
zno|?#mOKyKN)v_l1_RF_N}FQ$Rm_I+G{=Kup-o?(37hX%t&CXOwcTAp4U;_->da!E
z%!1~S8vO<H!tvs270>It<C7V!#N_xFU35ZsM{Lk{fKF5<yBp!)JGbZ0k`d)6=34@h
z&%C5B>wF$`IDW51xFmmJx4n%h%TQ&qi&x#LrC7JT_Ka^3TSHOK=mBiM5i!;1DqvH5
zdpYye<(~L1frGUC&c~5S-q^*jlz3@}O3q;0e}mX)#<KOjtPlp#xJCm`w5FGHL$g|;
zx1mzUxw|v7E^YW>`56Pi23!`~Bd<vPdqqRK!NZWl!>laaoxc-PgJ-W`?0G#Fb&Znp
z5NYFvS~T?LQN94;xXE#_AJ_rnfOo|oeCp8Vvf!c_`fVDq0N4bL&W7~e7huZ5rBhKL
zdO%k=HYIl!0T3m>ofMYXrrYxnd5fqZ3C{)1Wkd!Up+9=_G|N@N;&uKCFQg&~tN~xb
z8cvUVI*l)}O1)yYU(?1hS=A3+WSwuHC<#4A%7eH+oS+uAw$P)M$kPH05-QtwCnb#(
zK)k8@D7fvn6bEku7yE%E_2vbv$Qmj($)dNxdvgCN;*^UHR4M{kLmAfN7rJSGPfpw8
zcr-YIKg}`>DS1Kp)JT$aYCTCP5W1MTUZ`2(#QK-$*IjG4hs`*>>$mZKnc0$aH?O7N
zv*KUh_-53RU#g1|eP9^{tt|hoWS=Jn;w@IA<{t`a4VC5H>Wr`$s^!YKzo;lUH~mfG
z1x`L55@qx^pEj_@loa$OBH(QmZ-adWUNul3-qCdI-JzB9{t<~ExW>D2oeJbof{)7o
zY=H3v3|dYz$xz&3NJPLy^r?!)YHYv-$7+EXs}BuItujIzTI_G$VYnC{HnrLs413~G
zlsFdGrXPKt0}&Zn|EVwhGfQ8CQ(vp>{d*oG?!O@_Y#}K$&pQC^{IcoZIr&4${cym<
zi`_3`^<k!3w0b6b0Y7(|Yv%u-`~;{l2d`A);1IkEUPl=c&o?OX$>Wz}^<ayJT1*XG
z_u61z=;8CL)(}9NV6v9aq8Zq>M9lg=fp;(v?Ki*#5b8wThle=N)L<Gt9u~VfQ5{GE
zB0Zd+fk=-i1m_)piYR&F;uu^tSjBPUp;+Vibmob=p0D^8j{mpc92+kxA_84>@<J%(
z@1Jn9pJVtrXxA{JJv+bv)hQtkvoE2MEV`;6#`5-v^Off2Y?SmKXGN>*2?jfM&oW#C
zvIA$Xza7d42{H;-&WJ$%>>^t#{Q^+42$Tsj^0C8?dO4-eWr?%RW&|)RH;Y<HuBdsd
zP+1_g-msn$E<TFgx||wjZ8Lvu?2lyCfR)#0PL&Sf=DafNEB54xZD0rME=+$UhecN5
z24U<}Jy5xxBwh}8Rf}n<GQ~~iekQ%V53^75ljYo71(JFN@Hqzlremmz&ucpP=(W?^
z(Vzx@Bdlgv^0CO;_)qNs{eA7-4t#3<D?Sa#JTlX$XE?nCzAxDJzJ3v@6ZPQnQ}Le9
zX}BZ4T|pAH*v^>P6W-k4tOPie>tfp1Y`5o(UG4AT*P)#my}szW+8WLnda?AjVGP$k
zc;Um>%y9Bn=wDd**Z=i2KHG|Y2JCR}8*B05B^s+(c#@+M%x|`mP#K&>2#-5q;5BrN
z9azju_X23=As}3MTq9*X-OxOzRokJxzwTUoP&jTP3pq+!d6+fA`d7@W=0neuULYE_
z6QEncMHi@SwJnq+af=-l$GT4cx8~dcg2^0U#e4%~(Ea~?sjaO`Ahu$}k3uayuL=CR
zJ}g7<+eqf$*qJClfmk{`zD<AVi}9Xy&l7)!c=ct}!*FKDve2N3RJ_bbJ;?HV5@oHk
zJ$QGPaWw_G=qovv?pVP@$e6)%1r|gyWxU5G%7iL(Tv7<_?|EO@dd|gg2`|L!v`b@`
ze*DL50Lmmp;d3nV_Dq=>7uqLs(~mSb*LL33$3rKNvc^rmJrJdaXC+SR;y{0-?qLLV
z+2iAnKA&QmpoGAL@q32@MipGJMYycO3}f?8zD^9$Z)0`1Lpc@Qu)@ukGK0r#841*`
zJj03g;HTBKIf80Ga7}P*E^`28KtN3X91J;k&Je)T7(SDpfBEw3rsl^q=J+=oduSv|
zYFtiv|ID6QbLVq$?)@~g{&1hgkGB*V5IHGGLE1Y#h=M7~0cnX`WMw1Egi%+Y{y<nm
z#huptbcdK^B*0E)8}6m9*3}`^m7-1^JE#a!DUE$Lw(P0K>;a*LwfUq)-Q#&eLPWq$
zy4xlt6M3P*g>9#6E0SQQcdFUBJ~)PPxa&*oTjpIMwm4)jkgnBy5cO+&kR-t>y?W_r
zk`ocr54F>}Wb+^-85EjT-=R&GvB@xaXJjx~dDU;jZl80U)oO}9sQduw)o^#004`cQ
zN343uwO`vI?TLA6M9y7CEij;0s}O(aw~sd0{DcPni`RGm7O@`vBRyHT^yyj1OMo&U
z6lHWx&_dKUI!b+^&R-~%wI7;gL`vUwms&$D$G#0`Gct&0y0uHVG=Y-ke*Q-3^&d0o
zhJAb2bi(abUA<zX;8Xfy&&eBjDRwQQ0@j&x`FzMs;(gnX0M=is@m;9v0Jt&bQrB_a
z;T~|<p}o0hxG?%pj@tlN32aEB#Y6VbGH10tUf=X}X{b}-m=vT83J@du(ffXD-zJ_D
z|EWMuHq6RSkhY{8RWGI;LbHWva@4cF-=G8T9YTT4SbB0*)j}0VIj1y@ipt*GA4QcA
zx@bmk!QBm0%L&|nIXWqEpEZpj6x-~TJZbn0#Oi9A&R@k#fu-{zSAZw>WTIa$EVl3U
z3ebIoZe^}ZP}*}*qXPGL45IxbjF2zvafnI7PkULuJT?>qvklb>N5GvI&J4B$5K?0w
z2y-^P6$fiibKxv>AZl|)hFM4saCeTc6i}G(xf=K0eKG_7jr7T!Yk0y<wjzPyb412r
z=UZ!swheCEe_6g#gor)%bS4ItfnO2-w1YMuYowrYA708J6TLA*{8zKlY~tYK%}#@>
zM+<YcR-iLGmSaDqy3H1v_F>a3SWfT8Q2B42usJvq5ROA8?*EU&+~n8Wcp^ReM5<4L
z|J4wS`Gf7N^9O-t`4Nx}ueYps{fAN(nUSqgOxZ(tUU8uxhKSOL_R|@*A>Woy?xeT#
zC<a&BgZ+b)x6sjz;Z?W58JCu1C?#+xWpiZmVEVvj3%7yJqp<IqPBp3x3mqM04-Y~t
z@<-`lng|J#XTK#hhkM$-_LL?fjmgRA0WA+bR&^R?DtSsnv}*kkn~e})Lf#@CEP&Wp
z^%o<ek$Y@TLSVw%@WPtA*eV)i#?)R`m;dOJ3)*|PbmcV5IS9_Y9``jfk)n<9F1=x|
z?qNTOB-ck<ZZUD^?P{~P-Q9-nP-NKQsDRiZ&@J^aovPN}(_8As?FnXy5dUSlZmU|j
zprKL6P~F}{Q5g9=HYfb_1f=VeH|j^JvTrrvn4jcaz=IdQdj$wF9^?W}a~8A`A7N?x
zOzGr(ZJ(PI0y{D<bT+TnkZJQW+$B$Z8F@|qAo4<hEHKUhhbLg15efbSfQ2)M?a_A|
zMuqR+&3*qweg71?xD}Y;ka!o?()sf)&_-_0J{_B^t~7Y?b(mUDRhf8^q&(>g+sA-U
z&Ysh7{4o)vdLh6D8rTtJ`DcfH!a5BfzXO|{jpumtfyc*F9p{G{>U-d?%m&WMZKx>x
zmQ!8tXwVj<qXh)F^TuB*B|qjUI0u9kE@0bjOPz$8@F?6N{VRLhYGl$jv{OBucK+U9
zV|HnP9iV+Ul4J348r3Gq29ZD-I4`Lw-gm{Nn(MZ~z1+pw#9GFsaVHxam{V<T%hv8?
z(zO5=leYL8u{XU6PNjiFX*slq{7JP>=@36~>E*Xng_q6j?qn)^h|*J*OVVmMHyTXj
zMO81zY6Vn_*Tpz5S4nhkMQ0ZC8yqW@e1>7-4}&7@Ks&-Mwoqn__XaEScD3)!kh(CA
zY79`L&BS^4y>`ZA$jI0o!ZrT4Jy2*LRF^EY{ZE2cZCKd1+inb;T0gY2wcKZ27rkzN
zZS(#<F-1#~+}WbfYQ)zcA#^*e^(+Fy@<E4wUZ^W84_IsX+$1bz|G>_xUdV=~(dJPd
z*oeY6Gp+Zt|9E~Z!f?`s?Q9eLg&7eq{}mYh7uCYLuRsDVjcN@?DGq43eS($tB7{Aq
zAcoq?dBzk%c-4tHX=FljaCZ5Bn;1o;Tg<iy(pp%;$K2u+)e7wl=QvKmfmwh-{N<b^
z{(_mxqIGeOt~~yq-)UpL92@(sC8(O<rvXH2i}Io2_e9Q`v8V0w5Z;S1!uNadrqY8`
z)F)z*JAKI`t~%bz^vLoGoIQ_#MWnQgsS)qmd1Bs>NKQ${eFdMTv<lDKA>SC76$`|-
zW)o_stiBV1j}J5F^SFpbCWQS5cj;a&&C#A~JBX%&`K#;Rjudk{2Q`)6#!+QYSH2F;
zp=3M8AL?~K!1s9WTOLCBQ<YJLfd?AQ!g5q_lvV*3L-*`5XfSKQoQ}-%)IU+@Rjd4;
z`So+v&!`9hhNLx`S5CMw^zjNyZl_xrvF|RiXwE3ZAFCIo@O_6sl;;<8`4REa_|Y6o
zw_#H(sggTJa>U+av$pstSJ^k@4>;odp{2dq8s(Z2SbcCj4>^^oAx2zo{$?=qysZhE
zZ8*B(F#iX&mlci~r6@nGxZU1nVx8JKbn3_?t-f2rB=EEBxU421Fzr?N-3Dz6CmV$j
z#%+W~<C@HYgq8q$bihg@fu@o`+c`BZa-k3&g_0WNl$8{3qwQx=(i(Cp3e(?AQe~T<
zvuvfSf-?axmfp`q^pwrp`Lf4by!znu5g)Q5iN2NXY%8R{O{yFt37n3M3|yX&;I;-y
zW2kOw3^-GUA>-|#+-+!IG^i8}2RhSgXUYexK&Y>prMwu4b6TqViDsCqK?)hZ&W>HC
z>I>a0?xLv=o;liw;K`o~&$wPZ$@9q(s{9(|`XUGgKh~?Axdc8EW>h+d3zgV}&zcV5
zqCsrveE<kAs(bOD4CPsLJHs5EyPK(|!J_H~Ve(`9wXvjp!+D4V01Ah{?yD;sZ5&Kt
z05B)FImwMIS&LqJ?XLNQQ2dYT5Lry@)>q}{G^m!FIe4dJLH%ealiO|R*}d2YK}{@|
z{Wdb(h9!h;g%(Cs8|vHO02<+vbb=*rOA!Ecg>tN$Y1pCL2cfRb#KnAv>K}^C^HxRQ
zMza#<(>dvu`<-gtH-TZ$Csu7z%KN|6d_}Ah>;GUm1}c)kB*JQL(b7SGzJl^$A1#Vb
zERF~k<!v+k(GML6O13?5p?GFUzRSTk2R`vj$=JwLMt}G+-5wngqrUZ2+Fmnf6guF^
zwG&x(RzN7FL!13w4_oX51?`a{@!?|vuKiyGg1mrKB}t452My#oY0p}ljer{Fy?0Bz
zD}-HoVAmFix}^7l9Ec6TTb@I;p{unXbzQn0+U2)T%5x<2osQ_I^}2+YzdZ1udJbns
z{@x?3US9%WOVaEFK&1KD0w81?rQcls3`Eq#Tw1calzfGYEcyOx#T{%#hwn!Pt(x{s
zXIO4#Y6^ND#O;X7H>YS1LbZ0a9G@g8Eh!yAJH<9^+g^O8^5Ebbb?r;dh6jUOW3Z_V
zr=Lb5sh8?Di;dicx&RkD>94yV%g<ikApN)qNh1Skx#&d5+WKM<e$JqK;oy_{lkVEl
zjnGpGq@<7p<m@2ySMSJvvmwROZOQw~tqK%qo3=z)dlaS!?i6}`7`V8x;Oohw@uDLX
zar(^4FRR;G*kyRt3Q;;%z0uJVKFf6fZhOLX;<6d0Q^2tF1(NMBPjAxBL#QGn&76oT
z(6Rt1U23%hg=hR^|Gib<xp;%4c2@`lzPPulN*xKJyi06NdMwQI7+ZmJqGUMh_lo3+
zwGH^ly+A!9_IqNqhoKYTJV*?tcpo~fu>*bZf%ICq7>;t536WXtuLjcnZ<y4M{8v%X
zQ&%UVe~<p;9kt5&a6pi$dK4MaMCXqZzbX8krtQWc;Qz>KtaWj{W5F;EVWga^bT453
zt-_P0GE)jFVRE+(TxQ^t$XK~7<Eq#nfBld2;qphdE504Oim&!TQHbB^UViGubDNEv
zdP$f)F{d~S<b&*4GAmy@IbMJb_dIy|(Y#4SfR_MR&4CiAhs!1YZsw4!S2Nq9@@ixO
z%k4k|L1L#uUvdwbAwyoP(zUSOEx|t)yFcky;240|xp1Cf=Ypx?RtfM|AMgH}Is^FW
zT?K#p$69on#;Cr$09n%%TuU83<PKD=z*eagvukkDH?Gpm7u6jcCD2dShU<(1)uW~z
zx6i^kY)%#Q^pXN}_d#eiW^fno<k_K`1Hz@$O?)B!$3%>`HVwMbq6K#NxWBD4T{Q!R
z^aMm`CHuslbt*~+Sj7oGn|T_AcPM|Jv?JF2XD1f}&&Z1&9rfZd;@m;8%T<N7#6~8u
z96jyoslv*qsih$$wk{a&9Fo=n=c_REUx(8-7}FjUOE=*1W~^fSC&OypS>=F5oxau?
zpvyiPOd_9qygk7G<w=&Nzi^6;;Zz=;eOr)$Ymd42(N{no5pa7n)ATRoQZ-xn^fYC2
zwyd#Vt<--XFDD**70<^p=(Yr~&15_NG`bJ1%Vr!EA4*%^FH`juo)y6^b}wFne8|H$
z_dS*4y(8=a`^&j&c{mcO>*HlUJni!@`LWiOE{Vp4%os+~xzGRQVd#l=<E_U*RV4IV
z@Sj_SO|4_gC~Zs5`Xuqqc~%na`d)s6RaY>Iq4d{3?a|3c7B=PZ=!17CGlXHY$J8+i
z+O}!_Rg+0j>|YpL?_ifo6ktJor+3iKMDBW%A$qC-Hs8&WcMQzIgD;W3A3>X?+zvAU
zW$1!@$Z`MkQg2d8Jy|XA@3wRK+Ko-{GAi>3It8vkf48&1SuAw9(jSd(Owgx!juKty
zNB2r%q)XfTjw44hNv(83@y@zkynam!?zs4$Hm*I>N%(uF1v8+CJwiHkZ|4FvePQv+
z!S_>-_qr9@xGEg${c6ANH(9U*vD0p4*$^S5Fu?q*84NFY-2Cb`$&Y_$WOX5N-VQx$
z!M5b#Ofh(NfEq>`Hf)j%*ulYg`bMWzjMdaGileV-eK^tvr#wi6RV&LEb8R(C<TpaM
zKIx&KlKMEPg$YXZWMBye$?mR%-q9QUJs=|NwzM##y>QtopojU;zh*Ql8te&^V2#eb
zhxRsf%nhctXKg=|#Q|GW_3TAZk#fb}^u29p=z)giPgkq{nu#HEJ(8vnc-R2MYsm2t
z<2|4&ER)%rj#N|R3v^*3ewZt02`wk*Z9^IEwLOHffhSm_QIAhe#IN2%sGfY<McLX$
zp~yTb<&YT^wEsv>PfaBD@x1;={L;;O^6vp(#x$LlgzA3$?`h%VcT7Pt;u#H2L6B|G
zo6(#Snj7w)BDSvprlmq%RvR3bUSZ8Awyiy-7q?ifHDR-Xt<#0}2mb?a-TdcH0b&fr
zZ*~~3UpMeS`)FuJB@3c^bb}tqNB#REXhU=-+Oh-f#wRd!72Hj~yCeo$Y_;F@pot{B
zxmIGftPew9mLO{e2WVp<?23LqS)y4Xe?TgAY+3cN521J=w?{FI^qOuxqOUZ(W3tpS
zfON?WC^QK;x3WlK>gZkBY=XjiRq341`si6fuT|Dit0&g#Deqw;k&nryuu*7-a6)Ag
z$Rt@BTPe;3R*T=f0(_B!ynJ8=QFKxXmMyl@B-?ZK+gCrMAQ#A3=NnV2u1Et?!$M&r
zhWkT)YSEBU2Z!%$z_&}nANg#;!)xvZb!@H9#%u31&mOlO#NE2yTpBI#i?3_zyuFQ+
zOS0J?d1~pFC(?yeFf90%*@x<Y6b&+lC*qrwX%~{s545YTp*5Qh<i`y#EpLPPj$esa
z7c@eZopnOe<Xb^rS=To!O*DrKuftv9Uhy5g>HAKB(di9<v#hlZaF*pr-1&kaAj-LF
zcJc<U{l_gs5JO3Q3pm{Ek*1x&S<XFHTq^fqpY``lNoqYNOj0A&)c%jBbB|~G{r`WZ
zsGKUvnWU&B<T%GlsGKTqgcv#2a>$(7Bq2GI^C{$%!yKBkIiH!cIgU9^PMZyz&Efa@
zeE<0U>9(60o7d~Qp4a1XzvB<?JWQzwh(&Z7ieye$?Myb@ls$=NVn0kVd7I=0Y<`;e
zXIk+}_Ds26Zx6eHYf$&$^Z7t^UrV&tH<7QIT`BVKzpGoTXnXf?uzngo<;?~TM>G5%
zb<5xeaszuq`SrKeI=lZ<{W}al+-5z{&IXE<axc(VES*AtsBx21?NRFBSm!qxte<xe
z2Bm%KWfrerJP)?my`#~nCewkX1Fuv6;Y~w93%8Vzp+D7@^fGBrOKZ<sTW=Vk1nkhz
zS7g`8lo+JTW#;b9>{^BGU(sn+hIkx2-8b3A#x8i)W+0Ot6nmVvQwci_#*Q_}N&m_Y
zB0fUPvh|;7HYTS*D5Z09g~J0Y>Hk3iPHMu-ZfvWc!y=GB{Malj3%%VqBmK1n0C19=
zv>(Umx8-es_)%0BSRTH!UA(PtTodKL9S+buVgbeKV#1v8rC#8}{#^M#ZQ|9TcP&fS
zEw$Sp5A=z@+tTpO%Jq?*nYi+3TB+TQj{^grTGKPT{~E)=h{-LTlpdo4$Zo#8c<p|f
zWbJE?CeMekc%f5>OH+0C3)aU@U%@RY)~^OZStplETcsWjl>I!W>sU7>dZBGkUzdN4
zjt$EzpsXb%?Q;?IF8E6L5L7dwG0#U$o&^RtSqIP?HxYzJ1<u!5a)u6*^~=neBQ>1s
z$R?^#-Ew3PrNaKbbo2`e1*-|5TQs#9ZSsH$DtFOb@R|;rA8NhZc4E9Lrz3B$vkYg`
zs@TFjQuubj_ee%Amg6gP|H-Qg=U`*3wrHYN?XTlE{S)m+h>m?T;Fm${*WBnboremR
zz3uLYfQBD!H%vfo5mrxBE53;ip2WQAp0MQAoT9XTYEJFBbOhnU;)4Vi`dnYA07Tu$
zltY|Pe6UaksQYX|h@jA1p*7nmD$2Nr-&H2!n5ETsh624V)O7H_rdlL7W8fl~c8*2<
zGZ3nTq)DZ_E6rC6J-$>aUA{#cll)XFCi||(MD;>IASUY1VI1r_2*<c{{bWQL>#~+|
zIpC9prh+hBuDN<o@79K{uA;Zju%6H)9paayu)q8(q*r1ty9?5Kj$c(=c1q^WcaB9Q
zl&ogF!#9r9nfiR_wCO!9(Ael;ve<stMdD~Clc{{}bo#0SOXK9ZIf2Nnt&E312z-dV
zB&}_=-sZCO(_D!)Lfx$6r*{HoMhMThIHW=9)hbtDBX#S3+OcCe)ZjFe_PJ~8@F~t&
zq4~zKk=uYr+dps|A&jz~FG&Ljj9wRFY?c>QVsA2JFY$kIqJ)K*J=74lyDQBEl-KJ2
z1z%VZ9l9!e5-Mkzw&>qfFp$P|b1HRE##W1qf4WId{##8oamMP#vQ}_e%9=)ZXh<MN
z-`5!OT13VK;9Qn@uTBD>S!d@+SJ70kd0lU5<1yXB^<I)&4KpI+g``B`Sj1s^%#kL1
zNNw`wTKWpAK)gB%!DQzUw*s&ZS|vSn3S)t{;q&>s;pOaxbBgzD%M&f{Z>F(-VZ!0V
zcp*@@h_CoTSTAqto+ogh*97b6Kk*F~ZkqVaZ4*hwg{i&g{_sA-Pnb57hw5&@I5|qn
zPKxZ$++%n26-@PKC<U5<S8E=>WBGSC|Ef!W^9@E${PHTwt*Rrv!c%>%&Xj>Yx;EF+
zyTk4|IGo8n=MdD<={k9ZHdAHw#d*FLAI9(IwbrQ`ni&d(5@@%;iit9kRFFXCQ!&9e
zL&m&*!uvB?B~rwDX|5(_|M%7Ytg^oc%fdSr2g?;gXNXImL5n1R*L;$1DK$8#cA2wT
zDtE<2Zi)~-_ljEA9l^T*S5iRk$Q3_ifH`&Z#d5E0Xf@EG={^9Uq+wKJfBP}>j=%OX
zVHa;`kzIJKMDaVs$h#|@Wj9r;=ugJH5UNCpK$HvB<;AL>f|=RZfVNxbVQoYMp$ucZ
z)8K;pY}$FKnBgTU_((3JtARkuKWQ$D3HX`O>(mJ>am=sjl^!c3p1-=lO%2uMy<)3T
z{Tw|xj9JQxZ&(8>i1!X?{s=)Gd@9$aj`X#F(9N%CGbcs6KOH*8BB7^k5HaW(TK07<
zoQg<2hktbx`r~uSjV)$C?Xc#%FBK-V@Vo#BSu%H}LUZ~%*t>{NXqMtFsj^~22CSKe
z+RLFV4yf+O;pf$^qazT+8Reny4bFf`vr<{RVpICYo(AcUMzQ!w(-?a!nAzb(KPoGg
ze?djcLBehRvi8nEuOwk`rB)NLwDIWljrsV<D#_&^#k9Vq$1#0f6Ya8KwoLOzcu>L0
zMh4st`|APfyHEMog?5uY{ueQCZ%7jBeO%>eYp>nT?h_~BSzD7tsu?rYQCoEVnCyf<
zZ&Hrss*k4$I*6-m2dFuZu%TYRaJg_Q{zFosf$RhfM#fhN4_qpFLw22naK^4J5HLn=
zl_Kai`P3yr2^@ZSzWxkEf(l|9yrm>i``U&N`9k*a-m8EKQ@talF0%II0G9*)tBCN$
z^CRM~hkyB<h7XE9MChgu7_Xgsc6GLT)2lRCvSco8aXJ`#zsD08v_7==58o04K}A~N
zt4C&vfmANbvS5?rACvc0zN#pk4XwlVh`fcMMkd|e&+Zkg);(OK3|wd1gdCb&^xlah
zL;gYYA?}fLWYcqqRsV^bUXW3QC^aVa7`oN`N87Xfgffyaj5#=FoA+2H!o;Wj_K@Mn
zN;tYc6{R{YNu2r6XzWNV3Cn0bJcn>{h4rb}s(1gAyzcEJLT{WN8=c$BoD(^s4}N%f
zGWH|A)91EaH@xRSVOn)fYUodtZS$7M*Bx8BX=Kn`OBIuc(H>|3#-)_8?68W3$Eh?k
z_0P!!e|ENXS}Gv=HO}xooX(VC-FVh=Cq4o*V-w`Xm(^m_T4TJ3WM&&RBTLWf*IsxE
zZtz48fm3HYQzRQ3g2)pYn_4IG{IUOBw7)bktJ}_3Mhw4+n~1SGI|HPBH#%yL|Fl3t
zXEY48@^@)Jb5EAGbX~9i@8C60QSB*k{n7k-55aw2)&J&G4Ya3MU3Xg+$9`)2Y0^Yw
zk-y&_{Src?=fYg7`OOmT(1PIy9cv8laBZm|GK%a^)H9Yz_-0lYi|{~alQKEVsze6U
zkJad?dTZ824QwCf$C$t(#_WqvCheVMrTHES{yPs9rFlA|u^j#lYE}ih)kj#$gpQ|X
zUe68H*Jm3@00l<Xb@N5KSPoMMDEB0l6jC{rTJ%5=234`$__16sSA`c`2kU6e(j{G4
zFPixHHCb`yBT)O0<=ca&t;`TDl)MBO()^(q=HJGfV>w&07&i1{VCi`7#^jY_h&nlB
z^k)V3AE@!LPjVf^$nG<oG}_4XUpeD>*hGE6_EzIv{@cl}cLp!Hg_IXkY{9D!YZ8t#
z0V?JERqC_w`h=zFM<iq}ESma}*#LSEzufKbG?+)xMn$iV$3~xyL@Vf?=Xr04Qr(|H
zXGTpBx?QGI)%(yl8vs6gph?>o8#jR9$ES5P8hmnrbS>`7lgV|mS?}p{r_nr@c1Hk1
zimNeO8YjBMd%X!c;a<VqHzceVuO9XHc!W>+mTt8DHj(Ze$v~fauOnx}$9wgQ+70ao
zD8v~0!Ha19(<CZ~bvjp9kh7e1o1Sm4==2S(EXTXe2kKD|=e}Zi{D850YySnZeM_)h
z@=M^H2})r&N(863c5s0(SE-Py_KR)mf0M;Vi+Xzzu*AQ*pH2Qt<0b=1tNVLSvQqmp
zdHaG1vk~|L+!&6>9JGM(`>-l3_{eW%XG;@cRKNW`KEffmz>h{MHiJi5aQQ+57i}7e
z7{(@B*aULY(_#BdDE|hCv*Ds;H(in9v6{h8h6$LmcF}70XFidBu+X4|CISMY!;tvH
zV$UwBciszSi1x(7R{a)JzlVQS=slF5cQov~PW6#L>f#Y{oTDlXqIYT{ZUa~Z7QT%<
z$M)t{$vSMm^}@d3f)aZMP+7a7f1#~UZvHR5dN=DFr8zn6`2x3G1)t<&`G)U#2pMvn
z@xVQnMvU>CvV9nK_(538V-X;fgvtHZl(GHse`-%{h_uW?hqY&aqu&~IF?tlByvC<S
z%X@Egp^ksg9FpO&bgAAsD|^e-%EUVLhpTGW-Jt^$Ii_1F4Nr+?AK*$pB{qu&nIlKZ
zdq{Al#KF_5WGia^k=ew`$?JIf{V>9JlxL_V&UblKZGf*H6ogS~Y{waEW)`Jnwk4i6
z9s3ysVMw#ade{-N1(WyEJ621-cg(CW{brkoA9!!?zOE*|Ry&lc*+`c-^?US0VT)@!
z(av|4DjXd+#BfX(){0#e;DnWKq6GGjp<?NTS`G*g{^N?5qnb86dRAu02saxKy|p$s
zQFXrv{{v>wv?0245~l;=fb4q-^#zvsKk$uKtq{B4IJw-Mi^zZHdeGrAM1x2iwt4zX
zTdiJrm};fO3EQ?U3;HCuFE+;^_gG>aq%ROTIasG&tq`!lWaIFKPxuNjudHC3t~@<`
zn<uEOwf>vN5X)A3H!Oaa@^%k7Kz;U51;-WjD>G)_Ect5xv4|@8QTO=G1)()WeZV)d
zR25*e8hkn&O^9XUC*I`hJ3*pY_beqE%1s}vQ6A}hf>`ODT&C)3<SzK-M4M_uHB`>c
zzg$OdTd;g|gSro;sQB$bn9Mj(iw81|Usc6hH8Ra}6|J2-d$BiqUH)ceTfLfgVS~F%
zWdT25(OJj7JXh|5T>N?U0%DqsO*^^GDp7QArftl-f>}8wz-U+`oNneFy->?7WY7~}
zvpZh}e!FEljquNG4Oq{{C?OsN;Z(~Oqn=VRqvSywia^$Yf7RD`ilflbriH;@9*16k
zqop!_m&^}phSOP+g=dE$n}6As8@|jpMDzGl){%1$4(te4JDP~QH&BC<EGczdHRj?|
zlGjg=Oq85Qn9z(;vlk`4ei%72A~gEHN=){9Nhd$``H4YrhK7KJz>4G!giqezMU+rl
zJ!zkXt$>4+Irsqh{l)6*Y>KX@k$0}yPgY*Di)V~cC&C)YKBbLAS{^DVNszsNgH~JG
zM==Z*V;w=TYY0#LyH0kW!jrs|$BmikrV)kfeIpHGD#poMpbTyfnA0?wgH^8!)KI=>
z+*Or?s(!iIrMk4gGT!_Z?$jn-s6yxeAsrbYact&&7XOnlx){sOgUog$vQXYRt?dlj
z#gX$yOfJ%pk@dY+rMHBL8;#wKe)$`MU<@ZQGy<9ccWRPanhB83-$MdQ==-8c232Ii
zXk`Xk&e&CknUR0MP=+`^(M~YeX#B_k#(brhQ#{pHBJUU|+8jJw$FzAmEgc<ocuEMv
zC1~0c(71PdxD{inuu$;PRe=*1ndc+B-MSS%!-Zh#2ed~omvP057Bv76vUF(=>9T|v
z<FU^Gbzyf%ku&@2EC(VW5^g1D17lgcNLLl4VdR(TFa4kK&V}}Rv1{b8I7p!BWhYlo
zw;z_JRn*`xo=fx*K&?x*_d8O50VMlEtgiscKH)q6Ywu*#tI%E>C3*(F(3v_XU%j9n
zUN5Oad(1T1XKq>;HVQBfll;_Yrh_xEKgn*j3-j^q8FQ|pnnMmmWZlX9Rp~wCym<WO
zf#a@<%gD=M`l6oiv%%>6bX7Wqn)Zsq#JdD72j;6p<R$s>INkFqxHrTsDeBBfPx`!|
zLvCeILpk1gHFU1EdN+h%3`agay#R(dswn%StaiQ&4_qc9BUO_x6a-<u{1#U@is5Q#
zU!9h#QYrkFdU0*$m~Bv>U5blRxadYiQf;D;P3rLHoBM2+JfczZwcUm96hgI)v9i<|
z(#s;<Kg?CNL`huZBBb|x6G=T_`kuGAxawonn!Jft*rJ6kK&}X)l<fXzuST6&I^<`q
z$n`Qg5M)Kkx0H~c@5I8NE{?Ilw%h1I{ww4TW$!4WkOj?b?XP}ms)<?zNnjZ#@Rgxm
z`}PHiyjG0T2{^2~dAUaQXPpfh>C9gDe2Z;}fb9XYAN?NO=ijd<o@u`Vs36V5T-QXl
zOB>F9d(~#6qIRM*>D%3`zG+m8FfK?8u}qs*St`*}vzJlfVGSsKNg~YVu3__KBuyi3
z7O$ab4iZ+^kN4JsLeoDz*g*;0c;7Pu6sbkIM0o4!MW7xT6;lKQr^4KZg-@~D7reT1
zqIzfAB_nKwdFyT=afm^+k&<}H6Q|JPyGO_s49eIUg;Q0svBO?cT|Cmr(f-Yi2Xc*G
zCVOjj4iBlS2<MgOMmWTsvD)^K=7zF)O9&1jVJpF;Hu>umJF@o8QrzwBGkJqxX5};)
zNfL{JWLHMcn4-*}O2&Pll2F#2+#As{`w0fdsC$UkiW_IVD8j@!yd5&-8-Lc`gD?IX
znhuk4QlVSzshZSWZc0>GK>x+!ub7Q(p&O?NMFt%m%P9j-Y@%=YO4NTXOBK9V>B?#u
z3jDSV)}@=Tb@)Qm^;R(GWzMktfxh?A^4J{U2^TtQYh^N&?T`LP2w`cHx?*ujQ7q<|
z3u2V&_1tLICh$8^+H*%CaizYH;wqSKw2|KV@*^8<W~6rwhvhodxWsNciCG$J<VUyK
z7+*w(d=ql3!B=gX)Udy~0NKSV;2GO2KA^EI2hZW#4_%Xey1ewCxVTVlqnl~`_Nc<4
z5o4ju+f-BJ*&9-EyiK?O7iXoawziTOV#r?@F($3a&e?8I1+&CIc8J{CZP~oHOW~x=
zRLF=AV1K)~u2CM_+$7GV){%K_-%NDW4AmdINDybjqb6#BgX<-|`+G>S{zas=1G(gc
z{ld^y^%ZM&E-H8@*N?=X0cJ);in(~GTrq1YPS{5#Z9&&&mbDHJ@3(fR&vEi_S(M_L
zrKG0Wc{22In^o2I*}K<){%>XyYWPqpObpQiVb-0Qd0bYkc`8d6UN#Et)+%;mv?j6!
zV(Qo2$+=9bKELXWr@4$5$jZ0a@_@1FigUKK)XCjDen5$BgzTXhh`3B&+|rHWzG!_j
z`P%cR4J%p6Ldlu;XYH89S{&Hj2XqneLZbe6Fy9~O@Os>cx6#Le;ZwmumBSS-^3&qE
z*)53N=JUTtHL~R3lM#mFrq;t&bD6^4G^5O1{}6hULwCI+dGplhUnv0Os+Ak4UT({^
z?0xKdgyd+tWLjpBgQtbuci3mA931uM?vOAW*nE?6c%06fMx)!o2Zhwbt4v42T+PP(
zDjNt9^n0%(WNB}669n8qZZTY2!nDOa{|Ajz8ELa@#bJ1PUoP<Wed(0HZ+X=Ltdn))
z#eud-rqQZCA6W<eZ%R!{Qi`u39NZ7RU8R;`>HgnGQiln4Dx(E(oku!bi*67hd3pwK
zZ#s_Y_^BEEi}@EjV)G;8O^Rwg6?qmBRyX&HtJJn#`DErrm)4x4;ELv-Be5yWeKKgy
z5(b^V4+Q~B%aK<2`rjyfunyasmH>axI21=LJoCa(jA^J_FH!A*Di%@o5bIZ^Aeg+*
z<lqpK`--J~SRCn*mJf7x%9BwyAB)H+8(+M#;qspD1FIUErb07!&OE8nT-8q>(nNW-
ze6wMH1sj!)lwlGirMvrp1wc3E3hh>u|5I7%QRn6>P;TY|{1R6`%;^!&d$zmeL^^k#
zoY;P5p7P*EnE?mW*UaNnTyk+<L1_<Z5c8i*DkGY>cx4LUfzuFc=$ZU`X?Y=Ktdhn;
z@S3yjTgS3=W3u}&Xn(@oFY|%kj{7+Loax@~Wl?^W3u2r3#TfXW8NyQe0=}uoyp@la
z8dB-on&GFv3N%x#!amFkMDQb`AE~WhrUwlDT?vRTlZt1%MCzGM0nW<AEVJ5oD)wYe
zvo;&mY8*t`M{#XR512XGQ*^g(nq-!{Bta>`p^Z3N$&zQAzh|SZ(y~)hHLpcpIw;CP
zXB`;?DjhL0JEFU<WgF7{DhtxVEBb;#e?H%c11vDfQCvaq3>A4%`i*Wd_`S;uP}q6)
zy85XdReUH=ODhE~?28Fs<jw<e`HiB!+Kv9u1m<TizP)`rTa}d-3;WQj226@L^6g}b
zqXgY@#A6Um1ERqqkE~_VTU>7KnMoU%QRbTxc}`m`@8TgNhw^n_JQu$(rLeSWSb9l1
z8Huo04K}_eKA2R6pYe<Nk>bF)7c=pea*$ue<yrY$T+!fSQ*~=3@5<X%5Rb$mc(WOi
zO9ihs(qEA*F+mGnjU@UXoZ({xC%Nw*T`M&^8B7-g>*&pneF|ALZGsJIV{2Sy$*~R>
z)NETd4l=6-qeF7js3Ff#2fYvrwA#Q5A5IGd9W=|>lQ#I(P%Kk(cyP1yY3`Jii2kdw
zXQ;&bWAj{ay52Y@2;<vGG7I<LURC;b+JCs+VVG+UWb;!oof(9fUPWae1li-^gCi72
z0Q!>b<yeG(*Y@4Y0=dDdi!{(v#J1ygjrGg+GPgGYU-umD#c98pPn*Dv!x>VEoo_V9
z=|`Od;A0h)PaZK0xU0;?ANqv*yJc7h17Pl%GH%$Fx&KDlFR<|U<4;49P2uZ@Ec0P4
z5R<K>Ei2kge;xC#hT!_$9y)C9$~&jX7RYRzq_0zBb~|Wx1(Qj|ztU!^nt?0eVe{jt
zzz}Zi6(qsQHRimfGMR<-wLu~0LI+hX4%|SyX*a|q>U4PXlKP6wKC+FeQK9h-f5zV%
zjW>2&TRyjIxR?!%Hk|CfI8l9Z68Ya#IP3<{Ud~pUWl(!ub<({Baab~5ehUNyXG5Z%
zzDB+7W+LP`Q}2C0n)$UbX=}_ZHoTkt-zT-j*YF$(JVyXWsmqYrQOvHyW9_T1`oL?w
zZvmRKZe;9P^O-2_;vK;-dOM9b#-uoMPa&?SnGkzu#Y|0(ULU~~1gJ5cHok`9vb;A~
zbhZa!fzqh@OYT;$Y}AB1ZA(rn<`B&`VbaZ#CH&wM(n)PWRo4cjoBnR+1@Cbaa{;+w
zCo)an;x0AVl0DwrshRYU-%OTq+)XPai56nM51bR;?ESy&@cYLMxKp8iYmDlDOF`*k
zR!Pzkzm3~0dV^w}R1h7Z52z^r*^Cq6(8xO^B<sWJ(yTcmNxT@tdc3>z>ZD<Q4h4=y
zH2u?7s}+x86eS^H*>*ch^vU^op95-4xB+&Nw0!k5txq#Rf+gvR@$HdViIDI(C|WNd
zlo862Yhtnjp^OmFmOTRbJZj>==SdFS)X4qO+qx9$z8eFgi{dAOf*seRZ-MDAy^RBz
z8rO8uYEMwrvXd<o?$;`>msN8x2VV>x9-Vp3Z{ZNBP)FjzDx;hVil3|_<-`#5gSq8i
z7+;fTd-C9@ri03Q&1fDb@u3pK@$1eY=_B1+;506AO=i|+%n_F8;n=CLpb%iw@3?Ou
zI`=!;1CWQXI79}ea2|h%_t)NkS5Tz|gI1s0am6s86W0-XCm)!bayboJQ|`5BU`r}$
z+xOV>+MkSmjqW|(-O~CNxVSa40y+H~sbJ^u)m#|BpNre2oX4MVLGEneC9|vBFWma}
z{JX>UUv8}8<4llpI$kOI!NzMy)2NyFu&|eumz(ta>z0mN+bfWo_1f!nX*Jrph$dDr
zUphxA=R=ce%`U;qM1I*o!@TY-m-46<7mtIiLvWYES+JiS<JViC<0ont*zuMZ!Lz-7
zKYNxwOkDanaJdt+#3hiDl`DRH+09$+f}&`O0^c#_p89|*3PJV@#mvvGW{prG2H4(!
zI8NtM1MS)W-8eAlOOsDdI?^Zj9FJ<^5%YR0GOK2EGZ#0LpZ?qV6l*V~>E7m=BY!0W
zReM};o}nv=Z~@HcK3LKYKTk;rqGxXGKC24GhdOW2JE&fzn<I6BCM$lacE(b&w*U>F
zZNMHoOt#5cD*#v$pf{wsSGW=bdRj(}8M<}1=bbz4a>Ts$M2o32hJr;Z&~G(bA&G$f
z=?>jy2|`Pm+Sy`vkk|p)s(E3Pj6LKOA^(7WNpPgMOhKvfAqD(1<1A2vWnpL@zm}eO
z8t^IpSJDTmUiz6oSN?u@pJm<u%YnA&(PIh#?+yhDzHW_^+QnSZ^@RkJp<||Ev?=Cy
zlCc9*=H}v-)K2ur{rTLYX?&#l;+&Ati5U&tI(;?J1-*_h<N_8{YUS5c$7B_6-4EFA
zpnm~d|ICuiaA>{M!7-bhpr9!CNX5>KJo9NYVBiW!Jze8NDRaitVTT#(bR*}g*IYm)
z?2FzH)T@Dci3LO-*c`-D&bUZ>t83Y+Ay`ThqDv4kDRv(RAq!~?9>S`@ch`QkT3jX1
zOz+mmM(ZLp+zuxC5HMS8%LjR??$=P2VOk6C@YH6&&)t$faWMw5U9aJw&u-t5MzA3P
zpXyMTHbn?dnCbMD&E!u<cPKOyxk0}z4wtgYV1WI7opw=>6m+urAIw7Vy@SOTWzL$`
znklm8kDd-}mhZhco8z8CWr;+E0j1xFEo}HIjlJe^0=NNd5_dKu-n0d`MZo}ev+0y6
zMV9u*<w?aYakV+~0XD6zlTzOUt(F<je*<o!%>fJgun{{?hR~7P-BJD0VFt@oAh)3*
zXk(p{q`n^}$K%J>=n0kyZgEgkO4i>&n-QUl1L4!25Hgb_ERqjUv|~_o6_x_aMdPrf
zw{~*GW&^xllo08ePRhV)4#}NGE&nCBAFJQ!V*W_O^J6ox01x)r&>z0=rJ`^B@V`T(
z-)CzE_Jh#}y!5M$2Zj6$ZfVLqN!nhMKhgyA(TIgTsdI?=KX`_kKTY#(MaLaF5%7k}
z&h^j|GPC+hF0N)?ocTO!MPT5iM$b3&n_T{(1-}MOndg3_N9d}&%b~h;xjbl0{FIsO
z7`x6nS|@ZtQg2zt{6WW|9ZY)<S*5bM8(lWgwbq!+W$6cM%i@Ont*`>;1GmLdNrEXU
z6VB`Id-(_pa(bebUgUr&9;*fBBZhR$df6~m@hDdIAOv(o_LGYXgE5!ixkq^v44!5B
z;8}3cy%1grtpg$nKplsq?bdkuUiB}W#q7ErSC25;r_k#{U`pGvy74oA*VOi8klxWu
z-S2zrJIo?IM9#`_hv(SK#}L`$aNg6NJAeyHq~xq@acb1$6O_E1VNm`TLZ;n-w%DN=
zO$hqS#yJy6f@VDUY~6W#n$T1rH|7H#z|WyBp=V+kZMMK9NJDMA!zu53Pt#5BJwIx&
z#|Tolp#R5CqvRT42qf!icp!W_Yy$n<Oc?l{?uWi>4;wucHKu1CrUaS7yAAp;s550I
zJi?SLL&fNaCA-;mUI%TX7U(*zHVtRuS<#3tX2e`?!5zSvu{O6`x^vpob#kZqV4w{R
zcmGo4{INhtG-=Oo2ULD+m7nO5kHhR-{3}a6vtEpjaDM2v>b|!##w35Rdv~;VBcFs+
zul4FuvRwKS&dE}RT5RR6vMutL0DT}`9<smIkfyW?@oSsT3B8kQ|1901Vxiq|%3c1)
zi}$6=k)iy=m_yN@HII&>fYtk#O(0M?EPhs47*H;N%_fpQmYy_P{Cdh~bEi5>b)*!1
zh$)G}zNV}F^pI%uBI;G2{(SA_-E+xM1t%-y@}8;6lB(LK5yDDv{n$9AX_%s#Xc;aF
z!?BI|$p3_LHhKOM;Zs3%W+tE0?&!tvzRN0R2kkmBFD#b{8Z=&*J6u<R=E?MkgXt|N
zHyb!d1sIzWQD1WT7A0JeKj}c_gH7bFUjy{;g5C^(ZTB}0@^Q~`No#5ROoNE~nd$Bl
zxT{c<_Vj;f4kPNy$V{o9%&vi=gZ1TzuEz+E69_~fYrLxb(*vgye(IJY89?cF$iTy#
zW!uBpc~I%hWO|{$gkPJs+TN{uSzLHki-3$zkrwv;ef2%&yYK}AA-6qJ`eh}zUl<z5
zu>3Z&^WKl-#h@@x{CWG99l;aLA&=|q(|-ak2FO}Qh*EQdPG(4~JYFkC{%(O!I0e*1
zQQNxq8m`a$?{2<_2lO7Dm+?{z6w2J!o~~PyztZ-Y`m(jF3P5V@Yxm*rn#zqa-@Ngm
zRd8sz?ndKZW(y9*!-VZq&MvcUkw?U<AHXcGq6}b8cu$ZQozZWc8?EpLfBr<*D(BA{
z7w_qE3g&)Kopb5VEfX(3B%&*WT~UoZ7c7&GEF=V-#Ihg)**<aCg8;%Yhx!V<<{xKY
z3oIDr`IX^a#>lMCb+iRF4lM3(GKv4Bk4CLSc5nOe@4V#X*5%p%(}U1FP0mPZiZjh0
z3BO-U03i+%dr{4!Aju}k@3@HmFs>m(iG2?VqMzG686~cw&mafz0E9Vm{6Y<fUWuVL
zGi)2{U7JpR;}Bs^f9W<)>_PR?#Cf=Z>j4ax)&h1yh3!wqfzuYxr0F)j3dnseV+Z%v
zW<+u4ol<G*1CTTs@Dn}MaN*E)IuLJ@690RvS>MVhy#-Zvr`9VdGa8=eqYd(~#$z4{
znOO-0mld&C#1CUUt2ad(9^%Rr|EIOGU~g29YM$dKR-cl@0F~OiPkbSP-1Tt}GVc1F
zcE0&FoO_jvwd#viYampJ6kGM@cr(L6folLT`b{=HMT8oNZF2T`==%jk8xCB*?*03}
zWt{1jWA&B+pLm@Jio?FgyDapOqFSW4D9o-BUM|1sKB-F@3=A!K!YDkAM+2KHzh_xh
zP3-7T58jS9|BDnFBB2s#*nzZq)S>=QGE33w@VKnIl(-KN*^{h1sa-aZ?pIJ69=|B~
zC}K<Lu+;NF;1XGD3zE?(`mt`J5XJxoD)v7t;=P((^>gPD0~(?-^c_{X0#Oj8%_?+L
z28SOOzfG3(0YkFTli%kaDa0M;HX`g8$NI=dFkI->lNpbkv)ao37%ow---y+c_kvAZ
z(ia<l0;Sql2K=E=p~V}wPX$QWJ`iIX=5y=v=8GXF_Gy2T@uYTIG|%`MDuh{UdCs@)
zO;xC3-SVWcR|>~Ph09GY{{^Iks+9V;YF(;xezAaqZSPp$mJOu%uQX?EYW{z@%cYo#
zy3@}4PHp6}sXt@PzaC%V9wI;=xE7;U?XdS!<k_|QBJuFR_JNWuF^8yimMVg2-ex2}
z8@uUim6g$dTikCIRZ)+<+K#D8vsu0gf|adVKxE^~*n^KGTJ$3#TW6+;rP7aas<v?v
zz*`!S!XppU^KpE6Bn_=)9uuE0Ihv0iC7!nwZyo8xKQRI7%%CnpYSu`<a;380t={u@
z!X<iIK6vQ=4?#1N>-PPh$8CaHXs$Rg|HAfpldutm4%?AUmo58eyo^pQ*ELyDVR2+Z
zf-|+49kUD<S6m1dBGuPus#U&kvR*P0J^|f;Uv`<}T<ZyFOt<9q-oBzL{<mHXt}%%k
z>QfdrWIs(05zJTia8Jbks8~;v{V3X<_QX`}78P4cS&nb}XYX=ZeFZckS7E8WN(OBL
zPyRv(`UQi+MKc<g^&uppo@*2{Yh&ui?CDFAH9OgCUbUe8^WNL7ma4|=_UW5D+zaj{
z>OV8g0ch)WjhbhRU(=3VN`!>F-^du&@jZq;Tlu=Zj5phtldOmLgahN06z2X6zED_B
zSlMGBjx0_+f!A+J(u8*JQQt9>8E<%u2i52gfmT9^vh4V^pDG-CM^olsxPnme6G5i>
z#F!EH>bNnNI}S2{X{f)+nW9{(_m*b+9V~8IT!oMESXTCx)ID;0ipW?uc4q>I9m24J
zt!9+E8!k^+8{0h~N(tV~z-)KH6fpjwU9_8zX|{PR|9W4(s8xH!p3<<*82>xDH(u>B
zvOsbhX(cXHj``~IbRFqY58>%zR73Hk&wF^I17)HQW_xelBfjrBG)s1crW!aCTuF6P
z1SY!br;s)V%O?jw$ua{F{Ki}FxJudl@Rz_glzs%$<TD;7_-m7l`;Ra0ly@s!Z&Y?q
zX3%$$$?$b*Te@V=(W)W8S)?cP;+ejZk7zQ%g>6;T!@`W?XnnCvqx&!bY<S#Nb?q4G
zEiG?dq4D-8yl5|f>z(U^Z`R!2d2yoOu&3|EORH`Eva6;r|GK;`S<yW-q@<>rIV<8(
zb{v3g2RW@`UN+M@bj;DUi#88GE1Q~V_$YNXL?6X1oHZEVr~vMVU%}oivh3-4Gqflw
zO9Ci7@qzU#55?s;!g<xTUnh4m6RI%qP0ZvAftG(5`Qw=pslCNdFVtg0v}*ogx+J0#
zJQ6(Gb`ul;*eHmHi$;%Q?DeJ?;{Eo{U;s(Yk)OjtK3MtZ!V@P)*U-9%hNsI2AnsvE
z!1Ss>XvivH$DFV$+Wl)6!+3N_TI5G+TV)p#L-$#}cUOdMAxx&G7ZF^Q@ZwmF7OCA-
z;Qe7UAm6fcfU9mXviabPq(ZNaKx%Y|b73!n^`n22%*E5A7tQqC>=CCUqz-Rij-{e|
z&7(B{d7hXY<O(#&r!l_9ZAtCj_X+o4;@X7S7Xlo5i)R}O3r$OLjfi*_N!kZ7TG-k4
z&J>LmjJ=LzfiD|!W_Efdv<j+R1~8i(b>7}Q4<ww}*&SfZww3XWD)6t3LkrQG3oi_7
zG)E=>U?1Zf<!k3sq?cz-+e$8@j2EtC`~oGBs1YDul)OeQKi1IOE0iulih-h}DAVg|
zUQ!fb>*r|lw2r&48@OU8tY81?EI7&U!7i&2{<=>?i=e#7Qv7rE<A7Tj;%Lv=t}Q|G
z^Vxo%sC|tSjQ0oTbhh=ci0wT_#&om{qP?!`Sk<dmlBWC>%L_S)Yp%w%jy2MTU-1%v
z%t0X5_E+cndQ51x(SuziQ*>s~!1r@}ZuLGNm&Cd9zht?DjhUj4bMScYGO_93(U}o$
zYnP6YPbgnx2ZfKnRh6}2un`Lm=%Ry}*Jxn-`IP~}8eQP3>mV=8UMFN=YS38Vm1Cm5
z?HeE%o+)Jan(QRT`x3Aul47{%HZNVio}9RqM*$zIEH)koM|Zr`U+xRwG{<M8Htn-r
zct^oMSnnt|P9(eOsXrA$xiF+1p#4)S*zcH@v-Qq}59p0F#@%}JyYlqC#NtN7dB(WS
zb4PZ)<ErXI^*D-4y7g(0%qQwh(K`sr$SpJ}I8P21;s{8DE<M^y_s@6sg+FZy^oB3O
zlgNlpFkL0HlV1~Yk$=kF{vNwee00h>ELaAlDC)n>LN$9N5zfL@AXA8gU|OpUeKg`J
z%bw+I)ET8@$B}I_iw!MVbnX$-y9_7{iox{$ZGl#V@i_PQ*~PHToxlV%&zk_J*xhJ*
zR7**I)xt7j!b0(7)$l;546{XQZG0)5d#@OMqAB?3*guRS+pAQgG(_tJhieN&$$2*@
zTlDJ%NLc=E4(WTLVV6#s#F*k6gcgI@l`KBSLpNNZB+QzG@*}>eiQNL^5y1ZMMa^iq
zh%bZbZJ0H^;=;0K98ro2(MaYLxR%y1yyQ;Aj0Qpvv&#g|lvJ}=n8k<ki?}2!)9A%c
zw9N-Jh(c{|*Fwcq3d_(^7nslRRQs>(ipRI?;`va(s8QZ5Mo!;8oZO}X-Lw^{|1*`!
zxBj0+EtPh)C`-3tv(N2*sFfA=9l{93PL=c6G2Y|Uwc>UFB86)N6SVuOW~71D&D$!r
zVCatd6(}(y$^SctAc^HY+X+(Jjy8Nj*IHspRreZc!m!aqF>tyMADXG(6iuhLn%pi1
zGq-bRWjW3XDd1*fBWbXf)0~GGqRGW<%+F$A4|qLOR>)i+A3rd8WwH%%^qcvYq?yX=
z)j2PJI1AS1ko-B|Z<)&SL8r#jJHBgZt`nqwgr~i<66i1&;Rj&m=ePuT=1PCVI{Q@~
zd->tUfA1~GBxyxtZq8P4a!sCBGfYI?z%J8yvnnP1;Rk;VT2ivgG3VLd<RBze2i_e!
zNeaE!WRDjUtZXWx&#;3Y^WrmkNq28}9Fi~j=(lNLb;4KjcHQ01-~<4e7^P*w5*vo9
z-jP~0;&n}><Zp>5Q!Hc(+KIhyeS?cu+<?bQ{Zf^o{sXc?1q3%B=tqPJR1dUxopb?f
z9I1=vp6tC`e5eRq?DanSKmdfT-`V%KzAA$YPG6fJ_Vo_igz(Vr5MHkcFT;A?^7t0S
zFQ7|IeiFW+INWy}><u4a)-cG+-OrX8qo$KJ1;Fv^h+|jwRW^bk8gx~m*+@_h^OZq1
zD0E~AQdQNg6+>=OxsGe>?#+BGsn89cId|a@G;rC;qXDI)Jr94a`ERtPcUS!e<}c42
zViBS|uVP!5KiQl<p?>=axem4OrZi~dR)9H$G4-6<=jJH9cCQcnkV4N>{sf5AqUawL
z+rR%l|I5%0AZ!5?aVCqKd=619*GGrf?{_P+5ntZ&fooXJvatb*YGqXnaPH*W$3GZU
z3FzXjhQp##OIZZ9OqDLU&8=&lKTVxZ$G15oy9d6jPweG;B*o1M*71C;>};CmP&|S`
zDpBvJ++J_~rrpFh7e>Sg^6_4kU5qcIO1VehV)q$Wd1i0ok?=<ul5mpQ^yj!Mqi3-O
zQ0QP(WpP4TJrux_+3R#S#CkE|y}Ef8P~0(9VGoj(nA)ko{G+AfPAqS|&uAyysZ&hi
z%+5<dH4oQq`~el`dwuj2UlnCw-Lz%it6Z|Bhu4kqdODO8WICf$o&1@L(L;YDDj%O4
z1?NtA$hjP(RpB$X!OpAMs!=Ah`IablaQXAO$ORGKZ4b0b3$$76&^g~SEVM*ra{hEv
zGpLbcidd?uu~z(Vj&hY?)<V7<oW(#v`;JW^1O}jSGrw1nf@q4-!rtEyK4h}05{M`7
zct%2q#ZOFXFTeG}!#%UZvsS`?7{9v%THG1I<)p);Tyvv0_?Y%e9Ck$fnUYKQ2*l+Y
z!2p}^Z@_98Vwh4@1Ulo-Q2+=@E%uBz)9HTX`FStIb@k90E<|*t;f$5cbzi6cWzUZT
z$y*uk(Dd(?Y29Nb5qZUCbDa2+xXpaQkOx<ihZ-`fF0&s7=F1RY>F<7IHGm2<c}lJx
zCwkI)52fFF0EBE_sjqB98;2M!V16(w#R3GJ>JsgAfPfRzCy?{S;Y#|Kk@L<E!dEV3
zCbUMC{Fv1}(EbzMyJdxE3$j$E-mveXc$dm$_yXgBM|`m<Rp12iAxGO9U>(LX41Qp;
z56jREn5g?48c*I8Cj1yn(m+_)GE|MvcF7PNudgF}KZTd_i(~he=ah#bI8t{#DW?J`
zp!O7U9nRcOzN+DW=4d6PARl<_{d#lL!EJ~2tuR2qr|v89RwZmF6YT}Kt{A#_9L(AT
z(4LcD1ELpfbL=t$MVm6bnq3}r3^$UZ-+tFb84K3*3e;&dnK=ZE3<-1nn(-3Y$ze1s
zqIDU*b;t<Vy`FlA)JSiEbWw$(cjPB?(5=j~-mtjTx!yO`BqWt8j~`xxCA?+;z(rFl
z^Ej<+9=O3>|At9O0Q&G3cq$d_w~a{VvJvSpX4~{?J!|kN+@E<h%XR8^q$RV+-Jtq%
z9ktgE0Taxb6Zt1@Q}cQ#PhD?g^&#r*ZQZ!*j9<B_dDzI4Q|aV#WxJ5}@5y`xmm|`!
zFJD>|X<*=Tg_>}QxdzadcxblCIn^&)h=eBg74Mm7eyL5PZRJ+=^EJQN@bXNAiX4ru
zTy*kVAd#VVXCa*5U~>-F>hHx4{6|ZjbX#NP>$`345I$!|!~Ivhb3U8DJkgloCw8lw
zGPHrsdrf~&{;9ECWBGVVUuK}JDL>=Vr=*Za-dey~F?Urmld!9Hp5|Bw?w^;Zr5jeb
z{UZcPTMLrVeH-h|v_OjRF8NZxc7~mFPmEO-M|!L#d|RlA^td7CAa?f1xY$2-_5ls)
zL4hYVEv|Mc>SV^!`PcZf&niG<%m9?NCwjK3mDkFDKkmqqmT~HBf8G)*Onz2=8h4DG
zV;yW29DC65rBj3s0aU7n2q-?&b|Vb#G`l(c*8Y>M!=5OTm>`M1JR2{)=2rGxN^~8Q
zx*OoIo_&W|WupzOV?XSw23A1GFS3OL-vmoOfj)x2@qAdv+WtQ}pG4SCpVM$T#{q>4
z{4Mbo#!s!xuXi3=Q2yrmM3I{dDduKZ|Mji<;Y%j=;i6S+m6hm&C%#qff|w28=<exF
zlWfh=xsIv-<tZJ$OP(e`)Xj5`YA0Ly7ZWeU0W4G~zBtcUvTXlMzyn{7T&5OwpZ*~M
zp?QL$9CDHgAtrUX(y&^(>OOIXn-ra||2zo42kJxQ4GG(*7~*4~o?kFpn`_qu;LZm&
zdE`d@M;CV$`BoN35K6U<fj|om_Ot5l11oNo;&X_|U?$GYA^L5GZerD+#RiPu(RVTk
z5}77OXkoX%DD+6G{3)2vmGIQ^ec#&WkFws|%0?uF{-U%p(KSp6KfT~4bWR_7oBt(~
za?vlWIOQ)Wka=i4nNhtSAg|kN#10S&8to#Exrx$zxjg}g#v8E66r(^)=3EW?zS|zh
zYI-zP*kEt=^?+c)pp8}Y1<Qt>R*{9{_g4lFykPGDDE@MfjQmXLc|4RRNrITzgpiXe
zp~{{>nAlOridlGn;q9ZO&8mTz=sbq^x}UaXMBi@zJn5gJkT5^`BYfSNLaUlr5Efov
zOa~R7B~Dd<ny;cf=Tq!IJ1;2x$BL>pY+`p@!<AN>!~a$_w@BA9u(%G~5}Cz~DNQ(B
z)GvE*EMw`;TSGOIqVR8c2Gc!U&#Vdy?Qg}zF!oMUmLR>Z_dcYyer!*HB!sfqPk4Wy
zz^zjCX%Rvey8}6fFld*;U+T>GgVf;DiX~RYD(XxNf*5_kI;_UGto*OWjQT9IGsB-l
zaJvMiT5rMbW6&GnT5sXEi(IftD_In9YAsR|Sg!jS8c}_7eE^-dHvX1ABV<-Nt4iy-
zpg45FCGV5Bthr_q1y_<pgZO0#xMK$M$)C7=<1PKS5p!R~OBdUe(s@izW)^kL37<u$
zYxFby+A;bn8+_zfUp;=u@&IRMySD@w1P0c<M?kY12u-Ncuna4D+sz);iLuZ5+~8($
zQa)p$n7^B)AxO%TJqAP!iq`;0V$-!4FyLa>`#rB>vi;op;TK+Bq*eJb9&skXJhiCk
ztv>;0$GhLuDo#krba^TEik|H4<K;S#8FpvEes8W<6*agiCwdZHrKb98Rp$`;fXJ_6
z@l~z#FV!01slQt~#UZg|-peHUxj7jVb*7p9pD@(KkPxeSVZ&%&3gw_Qh!{AY*@rD;
z{)b$UeVk|R>R(o#7EtPac9+EbUB*OVV8sN@BWW$LvKevjn>3;+S%hm3#;O+w?}}+3
z)({j`%W{t?gbhK1Ig4`?+*Li!ndq%;(e2%$A3l)z*N+paDv&}aPyEo#U=ZA%rQibG
z()Mc1Di(PzXWbniv5@l-r8J;i+6b#jb(A@iJOz%5wf<=2FV=+~leTEN0US@Nx7BK0
z!>HDa^sA>cE+<l?bUkYOw>lz!W6+49<LFs~j93)F=&GlD?2in;9yaF(1C$u+SYp_-
ztQ%_!2Qj;>b5-%ynbfrwM5#r+xT9(XLna`$$qwb;1xA<AB8=8I=i;t(eFvn}>{~AJ
zA~Msmi@5TEOWQhX?2anIBB%2R`@ggckaO)Oa5F_ZQmrCiNX>bbUTe1)`k?H6bBb^f
zInNNNrja--_E1ky4cWOpz$K>Y_koLwDmuc)8X%#!VH{e0F8YFk$T5K^&lv5`%{;?E
z{1F!E!q-^6(%g4sDR^2HL3;x)RViGI_bOj-E`<oz6|f#j;}FJP2Pl0t5Om;`x^y~i
zRK-CM{-H0R1khT+Bz%)YQ&J?~le}43mQ7dGVu03{rpX`U42Q6!F4*@bgt3}s+F8p6
zQNfFjX*I>;nXQVO^=ftE8q*AW$rN|A;~rA;bfS5chwT9C6D=krvzRaDzwoZ>)Dz=l
zfI2sQ11g)PlNg9P_zG15NFP1tozO0~DS;Gj!rV&0(K-tbSv1GH21*B0>;P^*rcdFe
zU=>$m_9t{bsi#~Led*u4pVH=%W%z+`o!6G6m5r5_o(d3l|Nq#DJC82|oJ9E#OA+}m
z$!cHBv_fsf4pNHKyu*w>G)E9V7Xl*p;^O)ny4Vb_|16kKX5h%vLx#UMn-6;K%^q!h
zF{J(%ppG$P2W@bvtd$*(DuEaMRM0<j%Z_A47z#8432FW@wPVQ_vQ|s(sN2?>Wo}B&
zH)-|?$)Gl~rEz+d5vLR9@LzJ7o3~q%N`lEzd&2EbV*GA7!27A5NYXDnj4N4<)az>#
zr3yP_7g#Lv`>vTNpf@HVo6h3`%nR;+NoHthEd7_?bM7+&UBo+(K%vUoY(AGaZt#!T
zF0%p5<QsXp>3hssh6QDv?1x=s`$daqYh4M}TU_v-*ghvV+UmNGV;A8&K*)Tq4P@l+
z$+&5n-38R_Q+1o$V-DhxW@npjWF4w?A|9@l@(Z3(U%C5lXHP4T5Za!H3-w3e(zB0E
zc4Aw`CR+MADlNAbOixRC>(XF4upP$|A0EPUxP;7x64>S0{J&s1B8EN-=+*$L6TpN%
zdeb5;53Dc^xVW>{U(CaAzP$g@swvX~Pv5}AA=5n))B39ZxNwSv<JtE7On|?y?X1cL
zaw_32x>20ac?chRU6Mgc;R?R`+cD?0kJzlal{r|h@rPQ-tL9|D6Sl}YIDfKoba7w&
zWiz3?V>mZuEJe=;p#qcYKOU{2Yp&)~!r|MUmJoX}KFIGk&~=RHQToz=j5&u1umvR}
zZ97=qRJ2|3X?-XQ72BO1DSLsTpn@EHi-xnlR<Bz8slSB78M}bn&67Q{A)VyHKSQ)P
z?jRbnqRC5q@T4YMB`wo>0r7xMvCdhl(0S^&UY)sJIx2g$e0x^n@0$L%(^qcj-or!@
zO;6&wo+$_Q`XcSw;%o@nRlI(#gx^4U|B?ZT(>YITh-4ELP<gevhiltpAF=>J_ci^5
z=<h>P7OGQsJEDtVBJZYNAc~R|at~xzYq~>q5$V(Rq00wXzN@Ph?;tyeo>1&22NOKl
z*+Ind7Qc78#<RMU>_fiN|HpWey7KA8%_lF{n=5Q}p+h!zav^7gmULRq`Z1A_BsR3F
zhDw~ziu=aOofFu}LXB$VN!X21NJDbsIQ6OJP3w-hW~2GWsr5_gp`Q)TtE_N!o*p|x
ztBX9|4Uu!2D*)L4^tH6VF9DoiqW5K1`AL+?suRv}6sRTRFzzk?rCvyCPJc`FmUj!*
zFMFKT(0axx&@x>6ox1fGcv&vFX<Y-W`tyb4^ev&rI<F5M_x;}&rL{1{u=iV!e`GkF
zSwZu>U$-F9x3wPZN;AXOzZsy0JXI*4kW;=+Wk8F=&qqFl#AYLqham+7;B-I-^yIPH
zT!yA<BIK#K5J^ZWqERFnp?C0&yGn=`qFAvuc)I)3Qrx+q%4E55BBm(pq1Ycvn*Cg`
zIbs{S06K0{ep_NyV98C4!5^$=Kt9qTsA@ik=VWAg_&5cy1Tbb5Y353@>hU&{q$fhR
z(w+8Zo(%o#i{*8%H42iR1X%3x@BVfPVO6@6mcV`?Ywp*a$4|rv>^|G<AMjt70ao#d
zc<1M>Z$PI0^{k2)(owmPtNhH9@@}%v<PY_fC%xoUR;OQI5WI&-s~#JD?+><x=%VpI
z{6mdI;3QNx?*?#{|JW<!#smfT(KWMz*cK|iH9D^z&dKo5W~Nd*V~NnI!Fwsc=CMaH
zxb?VM{$n=akQ_4dgM|qU`)!Mo&FoX90k;KjY^_^#0{yWleTNw~QTOL4^d*?tK3L4f
z_ApK_8*B$QKb)=G4f8vkb&xnP9?$?SzW?>l#iA$}edXjM(V)s!%QHL6mFV~A<)Tyb
zEB1wmU<2e7M!vF0$LqZu=JMP*8!%s&N9%SvlmD63>1a64s0PVyX}a6?;3I%%#S1#7
zWyM#d65x}!DAvoM>5+oqRt`?jRpUb>oev0LH3K31bnZRSYQxh^+|sON_B$>-Oc~X2
zoke}+%#f)i6^3mgL>`%yiSsG{cxIA$?zH~^C7+@>WOHuo>Q0|9@mc8s(j>i91NR9)
zu{hUV4U)P(KRRW_LSJ|*euuw6=A*|yM(Xzg5sE1!Tc>~2lLXdDgxp^!ra|gLXV8(n
z2vYcczq>^9&tA1gNnYy1pLqP8a+SRo+qE6!u4g1Tp$;;?K}2uJ1nLV1n|6YgDHeRw
zyA{Uyac)|`2+;e{QlM&%!!_AkH}>S?Ar=JsnrrhpL8m>;s5HFz-jLkSkY>-Xt%}&t
zOO|)tA2+mOmW1K%5n^w*|J#WQZT4I~1BF_7v4>9at;++X7|~?M7#YbGrv}zN5b}n%
zFo+zh=Z*h_I<TKb=qDWrMc2>vP@-y!*>~#4;sC5T>tjLEl+s9I^qjl9l*OUt%7P5V
zHh_N##RyjR#{bfbHpM6X607OcfE!uzW>if`h`NR(o@jgZ#SRhuBz)(4Uh>%9jF{Mu
z&{Ckz)Y1GLUj09g&OMN+|NrBaqH^n#qFmF3%KhG4D@C~`xwBPdv|Ms$LlP?YMD9YU
zTt>`&=6*MKbKfxLZfw|W_?_?XPycM}%sKD(`}KT29s`Aib74eLnOTU-)`p0`b2Fj|
z_tCiGC;P8j$4gxJyWCeb5<>4t_9T?cYV9Tmu5H2J*e}X}zC)riPR6tX-+Ihx(fgF+
z*qNsl3w6a6J8Xad=3JQfV;)-(uX?!ZihJ@x=&}_bq=Sp8TuVbq^1I;_Nw30!szCYM
z{Z{OCa4CDkMr|YKlzwLGfaJRSs?&B{!Ik6QJi|q-z%FiAs;Y*}{O;+a9<WhtlezxV
zl4J+ZF5BG34S8mH-a)1ZHq(I`fYF#m!G87JX@11cGESm{(x7yDzgS_)nW;^V6F_$;
zuPID<D;31(AluZmUi#u&QxhII{ZCf9lqHySQ~#n*{BZe0q+vaGs*rH0-`}WRGh#;R
zCi`ATxOi;_`U0BQ&TAyR$w>LNB|h@#&{LD^pVT+WTxVy`c~Q)SJVu;#otqRB1&-v_
z5;*+QD3BbJbVpcz_b_>6kTxtCjatn(cUM@x-uecQVotnoj=#au)~juUf*3Bp&b68w
z(5DekmkgtJ0jR?rbP^q2?H~~?Y@oQkRfCh?udcgCz{2wuw>o?1;Axl&#bd`!g`PUg
zSmlO7y#V%B>p)`Tvx@*S_c=?y*^Wse`?WLi#A@HlEEsU(DE!=k35@&YAhn4?up4`D
zr1Qm<p16#7Mb`pPL}r!W#RfJSokp6KOE;FAP}vg>0iVK5mZfQ-Mc*eb$>fep^_3eb
z!#)Q890@3mW$({S>wQDk*%=lWLxC=Z90^j%Gl>+agH6;2t?qi>nCVCikW2l@$R(hz
z<MrST?sV3`w>#g~HAtBgYF<MYs|%~!w-{%TkIU~tcIV{Of*8H}qm=!z)*Q~8J+}ul
zeq-yn7eCn8Z6-)aNLaFi)vC5;JU-z{YLm9~O7|i4dynj2;?>5^-^==?%R2W(+^r*6
zsq-Mg0Wu!cZ@lKH+NEK*3~N)driy>vHCF;mulwnvIzom)F2AZS)|)ejRnc5o$X_u@
z>#_dohZwF!t8W(%tmpP=$R%sCb^MmJd}xKg%kbG*U5fQmWh4VsviPw9N!Ip}iiqfO
z&)0w6a}KOFx7kNx2g7j`^i#ERLAH?pWsjxn_<+QB{KJE**@zcneD^~JD&M<gA<gLK
zp8FL)3mzYUBrgVa`h6oBP-S~P!YwjBHSB4dk0r+KV!P#Mk<qxlpKdCv8uhxcEnuj<
zO#kN=WVH8p-^lJU1g==>f!)jD2Jx$h;M(P~tgJxE?87OTZyHOjH|i8K1(1fi?9xC*
zE_OYEIoYkK>@oAJXlrs+o3KgfoS`l8_({<_(U)-%nnc>j?H=(sh3|fhCLV9EOU>N=
z?`C~C>iu2>BrmBWw_6{(O{kkBd--m@Zw~!azq3dE`Oi=GZs0}<=uh8T=Xh<t0TlZH
zqBi%X<Tt1`Fr?s*h;dfLNtumFJzMA$q2z46PdWv6Tn4A0LnF`E`-J#TL&XA80Xdm=
zegS%BE$qiZBs*+f^+ix;*rEBXjM|mLB|?O{t5q<u_OWwX1|ImhLes}75HRmUh}r}m
zx$z(|5^ZaV`xs#hP7@$SVhw`uHGq)BQH7)V{sotFvD>4;_7A@LX<xj~$w~fC*-wLn
zhl05M3-Ps+Tnz!t6HP_H$j#RuSKni^+Ix6Srccw^5ye{nn*iJB`t4;4F54goa6)V*
zJjtw;OSWqcm<VK^S~cHJWidoZA{jVb-~1-Y8C0jf{3wn9!=L|G<p^Usb$!HI0Y_xN
zB3<lcCH9($N8`9-=JH#SwWOB_qUaO`{oY5N;s%r5_afYL`+aFatm*i@WtKv)FOToP
zeuBmjq>!`ZoLe-iMS=YMtGa`CMaxTP8Vs(#d7iIf3@&PCMexvQDk8w#n6ccHMaA~M
zqsQQlRAa0Q&6=9*q8nLO4tTynj{s~w^vMyfOk;u1P*#G1!lGG1t(@rkAHNv+6`Bs)
z9!kpXKQJ%#+Cg=k$S!{vS|PB{Sq-uSo`4b`L{)YyLSw*PN0WM*`E*5E$0M7c6Ahjg
zn)ifg8>iWliFXE8hK#VKk%%1y5*0{bE<OQ1ajLZEsnT;jhce3Xj((T#pkM4m8se^*
zl-f<L0lBbJ{6ZO{g7Sw!N06*3OBMpluR48??fWryu))Y33|@g~`^BxG$qd-<aeI!m
z^qa(<KnnSB7CqgFG*V3uf}4=ybVV~qpCJh&0IXc=rJ<QsPXf5<w<oWEcrUQR$}ly4
z0gI*C&v!|bysp?gX(9IuiT3jihJ%}7Q=UfU30uNtFG#JN!IJL6;R^6eV0|$s*feUS
zAwuq0kBS;9+oNa1C?!JJW04*OoSQ(14^*=~3GO7n<=eV`ueKeb6iGFQ=gTg3+03&*
z+D;=m6<LYC6`=<`^i9))$*-iBpG{jb#xlzB-q>d`mxQ4^>vzZe2XQ%<uX;~IQLLMp
z1Qa(S@W@oa7Lp}NyYu1cLV<f{TGO`a6J{LL!}llq@_ahKLc?h!P=DSi0d|$s&Gd!=
z+{d{pD>BAH^B+pry)bfLifQH^=DDDSNzY(+1s<)Bkf)>G6M(RH-nu68o1WUrnP-}D
z<C*w<)clgo2e6_90}(-~Pqv?@rweRt&ilBM{N?(a)I1P0{151%;+U#y<~&GWU|iVm
zD|@|9J#6Qu_O3y3;EGq&)+4+{l#(Wj+fP?@-_lPi^>O@~ScQ%AGF@?e|0%C4fh{4A
zF4q7epg4sg(;%Cx;Q(hFmoq$geV=L))N$d!TK?<}ac|K;7h{sJ1hO7N>4wSxY{dPu
z;Hkz}gm33IoP9{O<NI#LvrcI2g@cYoTU@P&5s4{IdSMT#$+&2FUtfdZ16&)LOADr-
zD?Ip$cQ)X-I-w>S@z{ZIZ}!(I;0y9)<Ftb0JM41&EySs=EvK#WLl1fNGLMCKk^Wq$
zuDf<8(wA14!vJEdJiGC@fwHySE@`+JQQz3zR5iGges%?iih;{~74Q0qeIH=rJo6Sm
zBq7Nh5@edtL|de2Qn7d8<r)Ou+l|HJ`@y68TIm^)F0I!tJhD-}f-GaWNt&E>tB(Ah
z_UoiW3jQA@auvP?%Wx^%oD9`$G^p`YGmp>@H{Z_}|Jv^ycZ&|<U7Kw<lcse7`ic;8
zjTy%c<$h=Ntv)^hbsj9C_<Ro>+OIfK>((KEoGC01^H!&_Z6vKnO!q<M!TLrzxA5MF
zANvNOe?Mj2AWy<67~L!%vJrc!SmNOj(DPVMWVf;SnSpDDZQKDn)bU!)#uro%;D%y@
z=Bq<)i0|T(Ao|89?LJsSzT`vRWZkz9Uw~LCJcKaXo@Mv~#=EVK^VKbP4?tl)Jz(DT
zj@AVO0_umKO<4rL_grE+BrNOHmB+BzSobAe`B)W1O&;uR3z&t|xQ7rt7x7Lw3ND*b
zgt^9sgw3JGeBUvVC&k@QXWmo|KDd)E(7}m@d+5m2?@fhbq_~f)>^%z3OpMqS_&YOY
zR@3bSuA~<dP$h=l2i6s?x;sWJNSDHfEYH2?#*fg7%s5?7NJ(b>N3DCn)AaP~E8*Zj
zF7hkAhcc|EcA{F@!r7xN^}6Pvb+sGIfgABQ4J)Murjp;@8;_7?zY6EGqJWHR?<{U?
z)5^uJ&tbicDj=^3oY%@~eKDGovg!2)TF36RA&uF>m;a<VTwas{!V~-M@}PL_dJcTz
za-fS5BDb@$)BEk#rn<hT!GS1t^}587$EM5%Z2OklcY#g~xdKly>j;Fa*JfzFM|FP3
zrPZ}^g3&CKwhZg?dI~)PG8lFWXtCSedoP41u={>7++Z);V}GBp9oU>&E5UHIaIsz*
z8z?Jq-P0U|>lr9H9n?9rtV4Kg=X9G>7({?2SWDB8iJ8->+kh}WJ17k#W}D!RUx<h*
zpcS(CFKIGIe5nn4x8<Juy_59!RYM6PT)KKr3GK8NVz&*sX_Jw5!{O{_>DwU6xgD62
zcx-h4o!z%rqaHXxY<gcNZ@av)c}KFcBV9^e`jE%5ofGcsKy6SqUB8pMWb5=Oy~cJ6
z2Ag+#ZgYSXfI>t67d$3Nn8^MD;(%gki-s4B_<Fl*{E9qJ*T)G$*x=txm>Z%7@6*KQ
zCw1>%``Gc&Z>ER)6@dO#Yr^TWC<E0#=Zbn;749ogR1X>#4Cu^*NzGmTPL_+l`mYh7
zp}}>Bp94BXogzDYr0^04;*Ngsy!&gH`n?lK&ei7IZg1`Lf10a1td2en#J}D8B~Z2u
z<KvHZYC+z%YjbW*oj#<mn<}RbOz4r+<`=Hg%2=;RC?qFguP(e1uMEAKiQb#ZsMD2k
zp*+&^yDxKtmzh3;<5I-7zwWrNlO?tX6F6v4@E`u25-!*Af{x2E)|~4l-H!Pj&qKq>
z%LvN-Uc4(F1^S>2hL`QfXa%)k89SEUi|HoI*Ft<hD2*Z>w%0#n^EOH<xvsI(XVD6}
zQC|@z)^%hTdC1kHs|T2)>$yBG2Pa={XM&eSjhUy!YR7o`q;>7J*KtYh6Kbw6uGm`6
zL8g3XA;@_x%}W5J!1pxLa8n;QO?)s>b4`WglpIx$wUreQ<P;Lf#C(NfkCWV?!F5i%
z)EU$H9**&DfRNg>`wCp5ssYg-TU3o$zjQ^~(YjJ$LIxr3^m0!rg(tb!`z(44Cr@gs
zsr`a2aD~tjP^)^e*^bZ(k$UaJy-Z!XPBMQwr^dNA$6)rXxoFQ5Z}aud&2PbtAw343
zKNv1caiQh9bI7n`Gl%gX<>MDc3M;`j9kUGfD$4y9<OijnP3fnOI<W5wteVap>jRss
z<4L2E&wExKFZ9RSZ28f*J)K1Yc;5)`j6Du6JxrJQHr;XEm_$ol(=mG2+BPr-6Hj?i
zo@-;L&Z_%wf7!g$?N4qGbJ_FOTC*Ff_t?Wn7Ui}RJ+{qelMlENn+&1{U|ru{C=|Nl
zb&G%UT|S!p;v>KBJ8#C_f!Z2_0f$Dj617<R%@+N6I5(beD+#fr`4Mqu0upJyiPp*(
z6xh(9B=6a7rP|I+Q-2+OjOZ;_owKsb9KB47_=MS`GFuO&j)90&%>O*%lNVo7)-Yun
zH`U*Ki>wUEIQQyH8L^-ovnP^S{0M2+v6e96(N!}UNikeoTxk2fv)vW>iacE|QI)dZ
zciz|Ut<UT@k5Jab-whFkXK|CS5*#gNp9YgMTAx?8d1T6MFMnfv*sJ@!n9l6@4lYDN
z(MJoSByHs7{;zeX&>a`ClfxaYk#b!JYs5p<Ks@k<oUE6@Yv1O-@H38<QCCBuw(eb>
zudZSzb8$wiNT>8dVxn3N;c1Y|6WII_jaYI8Zl><g7c%$5^jIQ8bNI7w%!nZtc2mzz
z^9<?gwy1)BN;f^k)0)#zH5NRTMk^#2B{?=_0E@0oZHD`)KZ}w+4#Ma?Y<5WmFei1L
z`)>jZw-sS+UIN1hw~-u93%w7JQsl0VIGvL>rs%H52Ox=A&v2aAoJOQW5g!E=>R<R&
zXol{lR`a9_v0=|8QfwPkW0H<<{!vNyX(Sd?Q?94)Hpia(0hxXER!l<Sb{8@uqWrSf
z5VlPR*hXbb*~uq}Qt?-w)cMC)p4P$LzxgakV5;A}F)P7s#<12?GiY8^Yk!m$5|K`X
zh3+>`?;wJmPPPYp2dB}5Sq$06?kkd1hNh;skhW{_w3H$8w_5=lpVkr_jH@&=+}q!l
zmQ4yM^TMX+CAT0`iCfRciX++V*Fg$kwb1J|3Y_wXb49>`U&9`JC8t0^AxVL<X1VHZ
znuQ(u6=`4vg0j)AnZz`x#7fugP+Yv}^lhqQ{nwNIccbbb=HQlU`B*jgpT(fmw#0}q
zZRY5mN_o#w5D<n)^H8PM_NhUO<0HEAaGU;TmVRvR8-YcCfD0QwjMx@`5^{F$x`?h^
zw)p*i<7?F>ksP;j3iRc%(5c8CX+7$s3K$l6L!@L4X<vpP&bBU0Q~hetUMv9T3fM^A
zHO88MjhOb=PQnEY)6<XFn$M|28H0uFxr3cp?(Mj3zD@Ogh=;f~ebQ&tXxUhzz#buq
zR*w0#0Z23(-(O&TP599)#zj09SzGxVWnwIz5_BS)_u;?2am>3u4`mk54=>xrX_Gu6
z9*`rE-Jc83`xtP`{{oD;NzJSzMWyN;4`1>ui)8hO)?A4-l+(*$+xzgL$X~^{+1jj<
zcK<YV*ZIAD4`KOKs*OzvTD}8R3)pn3jpW%PNtv_7tt4rhwUB!_jh*d?@e67a!6<%N
zGFYsN(_0z@TENt@p{JvavCBcOvVLNn+R{7X<ZBv4dd2Rfl^Po&rYS1cAn!8KxD&B)
z6E|5SL9N}@3qsN-PzZR{8SQj0$DV*<rIrw#rry8bc6$y{SnVbCn~X>O#0Fk4ho>Q@
z-HYYeraDf@6g;qmXO;HIM!&?HiQk&-W8M_Ld6^FCvAgEb!{K?UsV*7}??H(5>(SzL
z8{YsvhIhhr&CtQ!pDNFYqAglRjPT{<4Cu~G30*w+BW1zHJBlKH8WPF3w{|3YSu^aZ
zrWk3%Ux-`rd?JnkQ09^r{uj=XXdAn+39v>*zC=7`UzdlUWO3nmkkpxN`T9`C(DRIX
zScq`KdclXb1S7k!2zByD8B0<}&aB$ur#;lVC7TBQiJ#C)`eld}Cr^-3SL{0{uSn)(
zbA(n`x{y<Dy03NEQnFvkpMCulC}5`AYpCp48ljrewNNcsE0Q?=*Q+Zk__8%G?CY2s
z(D#&8aclaf4mwsQ>y<FIVIjW1lpsnP>%}A2YcR9uD*4sB>JC@V@`>;K1<_umSDED@
z#9!lcAVS^p@|%HrS=yQ+L510pPf3`F2*Ep2?VEv&OS-MqJm=U1+pQX7HJ3fZP1(0`
zIr{Ma_=gKirL1=o8KqF|_i>SrWU8VvUd;jET>SGODdGAR>i)c_ak2{WiowdG49y6p
zwc>Y9mWsBEaF8#mdY|YZxqYeifxP2pTZ2!tP>jwNBh~nz`FSt~8td0hjHsEl3C`T@
znf=RyM=n@N`gL~Mx^4@IV8u5B|K}3?upoPurAg*NqcSiroK%~)`U6_&W&4|d>t>NJ
zG`K>VdM^1tXuYUCSim0;MwVe09A;XyGpA#v&CkCZT255j4k*2v^QEtpOa2YeF!d5M
z)_@l3S7BdR0<^QP=UnQwEp0JHMdub_gBAr?^JTGeDw=?oSeO{7%rpKTB!lQ&IZpNJ
zoBmF_D=^!M+vI^4Y<QHvF;bQ8^Y2gbkIpPQX#u%k(XI4V;PICBft=euVpPGc7dDqZ
z>(<1FzBkGx*yCTk#h|GqJUHHi&6nRL&O`%ty$2nxGUI}Fj^SsJv3DTsb#-5?vabG_
ztc_h8beSVt$jG%xFwh6E!AoL-zZA6cox$uXhi{Mi%=gYS#yr4`AMK>R!$%A3vz`PO
zSk|(>?RfX`6>cs1g$}72%_*y+EofJ;R_E8oiJg07ovW0|!Y@C@M9|#k$$b-V@fpxn
zAB}Z&1;5Th1z+wrul@7Qu$}B$`G_3tOh+0hF>sgS<!1^^3ps%5Ec4>63!TSW%Fa?h
zTn!TUPd<|P%Rg0SA!4acfLoMK8_b+H%1$a4Fxfusvji9c&{qof>mp3u7Y%*^6r5jv
zm77+dyHh@3NSThHmTyN7O~+o(o;RX;JsKVT=I?#|_Lf9t$s3Q$TbcKpvW5p?p0lgT
z)A2lfcaziUlOiD3U>~Xv)p}>K<olumBdHhK6gk+XT@q9E@>hxMans<*28dtIFoWRm
z&hOJs6!G+sp-ZGd?a0?Ek^7*+2bjygg|AXl_{oE(l)sdbya)Ev{DlnXDp|A~mkx^5
z!?*)&{M*M7LS(VA0eQPl_w8>%y?Ji2Pi5{gR!?P;PX*%}4fKc0UP8<|$K4NL;^o|&
zB?|_ZKxN2(NgE&~zf<D1ALYe27FWRV>3};CrM&cgP9ZVq>vHx-G&lJ6RzrRaX>JVn
z;tY0X1*ud4)KN_vvbD*)v>{lry#2E#P|BSWYR0_)sadKrL0BLeah?%i;^TUUs|6U0
zJb%}P8$D7Pd;T}~)!9c!YZgyGnh4@M{-aM`MhXNK3sDu>(dJ}WqUyiF;`(>KC9vje
zp9<k^eJT+9z<4Ao1QK%<?KNcc(<IP2BseEon!fI9U-A`EywGp5*uB!hoZVOm9*kfX
zu%$~2BXTk%tDhs4yi7c2Q9Uc?qOhq1^@v%o{nfMoLKS?YY5fs&lUI(<Urnkz8&>x@
zz`kd=%PY26ETlheL(Y^&El=g!`*_#d0z{JG$7s)zprAe$Wx$bv-qtyz(7{g<yBh@b
zDf_`N8){E6tM<e4YFAsnHGP<{tlsy4;=wga%GYHCl`|R(EL8$`niR)0=+^JUd!zOy
z6Lh`C?t)r=qtAgkv_)2JEp|m0CML}%Wk4<Mz7a(<^AKeVgo8REnj`YvY^jto(*=Qw
zcGCn1_cg~Jdmfm5+bUg)Wt7g+0d{S8g(q=TldT`Iqh^c3U{w3rgSiA*JpC@oCbhTN
z273BPS96Bmzkt3NK2rvSa`L{lr9JsF`Bdh^J6XpG`i%Wx|MrC3wkMm2bx4dE0Yw{?
zb|(h?yrb`@ZB0z17=Cc;q2~++Hy>Ej_Lqz+ey0dGspTLK(|<gb;v;*$pcHG#ZLBQ>
z89h(?fCFbD&l!gVVV}uEXs1<mSHsp?R9RCwLU3S#gd_iOM>o%^^9KfZ8K;}0Rg2`v
z88YMASma~M4Q5fNNbS|P!7*oKq9rd39)A=m);ro4KuSSvd9CtJk<=2(CU-T2C#F1~
zz1c9|F^q%Qq`Cd;ZaCw<#3P~-f}6ZCb@eaa-=VOnn0zm7`tjqKkW<)tfEuI~7M`VG
z1lMGP*JZe&_6IUlJ#i4f?es3h91B<0pY8gq)Li(@HNOT5?RQu4@XF6B0BICr(LFdl
z;|so@(PgC{w1EJ@b}{9=fg97by=Ib^)at`q-ikq;V_Nez0}fB$itW3s0S#~I`rm0m
zbMZwt4kp=Wx*iK@a8*z+RQ4>OsSgyZF0f!OS-vJ5i@@@}zRz3r!m{Puy#8vtq@!W%
ze)+?-`?0Rr9s@-QCTbtl;zYpj9VI)208W^2%)$G6-rv+$FMK{mk9{Hqtv35CvFlDT
zn$qi*akK2w?bk6ZMtzqxat~3xc^R2lCl4W^A|MIZCm!+VCf-6GdW(rtp=&SU;j=1#
zPm*!2(1OOSWZKf*!Ar|HY%YFnwU@!=Y4I_b>M#?@A%j>P5&Mr1@K%iWwdd%D-~;Wt
z6uzcTt7}62-W%yR=pLZPy1K0DG08W(YC?mgGRKEjB%;n>WV?EK)rmQo*VNt^Ai_10
zRR%r4bjOlV{u7#x72Jc!H?GTeHS;dB#^c@c+;k5NFK4@L)`uTrOw^gWDFkRwapp^A
zc{|c*(^k*xL#s{hBAroQ;G!-WW}Ze|?WUuMPdJ<2mqSGV1a={dTOQn{OslEhzg2tg
zX!2mS&ycwpt@Iy4dr8!@@}Ugk9?$Iql*3#@Vac|FOo7(yAy6HEU~~<rjwkMvqkw~i
z<x9-zW}`LRYb}zZ4pJ*C`_>uwxIjcKD@%5By9d>}MZkO4VcE_pC9%H^$ZN>G#uC{%
z-|<~}VbtIwJ7pAYHpe5i*oc76-qm>W@#NcHVRraOgcSeUhG2Q~8gM&3!{#jQ80&Ni
z?Xl$0puCwZQ`M=UbviWAEK>u~8!35jrbI}?<uVo?28Q>y-CGqkUlY-2O`BL)UicYd
znT_L5U$RhZPw<@N3Xp#UEG!Dm_F8`ZC?e>aE~6j<PWb6A+)210InFJhn`1M>e@;ke
z8FgdJpeQeJKJ-6e5e|YVArP|u7K{F6TZ!n9(hJ*P%>M^ZsNZf5n8uhpj#$hE+Dt&y
zUOSHZdgPLK_-F>JppI!;?#j|!@b8>6XVJX*c~(8ly>lvhL|8CwaX^hcdQeqK+p;d(
z!adpe0p~h$lJI+UDWKTD2Q+-`Mw^x8vhW3U;vjPdvdkmaB}w)K5IxP2@q%Ow3jaU)
z)7t+h5gxqzAKdj&I#uQD-9u+zyT@lvzF$vK=|>Ha8vmy8%qZ7f_g3AH)Lgm)=1(<!
zgXLHF+73x8)cUVusHq;^Shn{e822zDYX8!n^?RKXWycgLVUMqHoYtb`-e>MzTqC8W
z+#0L2q`;HineVzA7rk#nvEHGx*1Bv576&qb635oT=vyYrNYjA(UPv(qykboDV{@|7
zZYu6BEMII|ZAGqtl2Hvn_a1brZ(Ip5kA`t<%O$Q{uavKK(YBbP!TR-ernw~Y8ft*@
zvNl@Rd3ZZhSO=NgrmbVFnVd-axo1e?r_bgtx&gi;E<gT5h9eLYla7#wwiT%aoEM5s
z&$=&e&Bp)hEGf8Hl{B3>{qaKoO!6C`vL^&-)O=+<1W!*ZPojYemH+dMLobYHsPYF(
zfmWZQt>p-KwXF-3Np3J1w~z?&Yf|etWF%7NR|>FlSm(a_O4fRpl}p4xcdRUM00IGB
z9Y8{Qmt5f+B5$Bc)4&3MK*Cw{@d|Km?`W;z_buoeAK5Sd)`goNj*)GG@{~f#o*Fn&
z4qjoRl|)4~fgTx)Hzl`NK}@z%qnvyVPnY`&I|6PEd*Kr<*8=y`vA*ge^r;Bz@5~L3
z(6!ru5d{AV(UtG`HYOWia;bqW?RNQgC;OnE&JIlA*yl^AiL$Y0X8d6$N|lXqxEObX
zbH+9vVq>RSz?`C<8k+cDP|8{_!<mH(luiMJaznn2By~^usB&#Oips(5J$Y}((S26K
z)0r(RH8R(}#a@|>ZwT2JDF@A|;>T%`P&NX%97r8|!?RS_0b+PSlJ{^jhLt;OScWtW
z1hQWCzp5m-%^z0jD36^!nDmhw=5O}6we^H_b*nbE&-Zj1hu?`p9|$?QcjTSAsr{Zz
zg$;^~!3YQN2o_6Dd#SepTN!N~TTEu?$>YS?)bZX?pPlZ7a&vdt##1C&7R>=I?4N@{
zKgcqSN7yvb*MpqY)-#CY^fHWQ+}$?dHqH|n!k!5O*cI6pZ_{HFfGkd^l<}K4KVA85
z=bigw-xYw*x=ftSc5};GrljA8$$R8J4{&L-=&5gRJicrs#EGd)m>a68`vGvLRy5=x
z0;%x_C`>9}gPDkEl8S0p`PLjx{+K3q+@8;D*g~{77&Ac$sm@=Wqp&3A@N@t33*SKZ
z5(k&57Kss2y2J}CwUOuEB4nu6)!a&zn9}wS8ibLCUR);JIlYkfwipbc@lzy)GtFQ%
zraf{HfoYLk1yix$>~hQiV4HKt$P4hG&8^ag<a=HVMNbr`cVi-^>ie7HiQ9R*8*_f<
z6=Iu0+WWdByeK+p_SuWYUQ^>M{;@SN`eXEFEz$na1cj_#oL<j&{3p-(8euHF4Jw5r
zTUVLjGBTGxT7U;&D#izoQz$r-04Zz#mDHw40m-gM$PGU)IAKah!OKI~!;S%p_I{TR
z;i>}t@W^e?N{@PkEaqgzX4|gO2rKIM)cB?WmMbs?x8nc<Q*d)bzl1RpwaqheVNarb
zHMjOrWc<QJ&O)%G#qlAYVMc^8p5?#GLSDmN(vbngC4sx%>sv9PgJ@gRY}{V4Z*Q2J
zlZ!EB#l0yKA$3*VUpUh?J%ZF^rC;wMFS!Z{ToJQtw_g2k0+St~LRXVGQuKRy3(dPU
z;SgT`T;U3-2CL%fu^qqGo?hRH`!>3vu<}Ar4j@ce|DaoZ!<$S0jA8(*+Gyz#fx|*W
zA!vKb=W4%Kx&wBfe)M*o`M!g)fu+`<R}|_jdtMcVabG=to4wNd8Uutp&%dAHVkXxQ
zKL-r)H3P+7;%-AmojCrW{IB%#VUNa$lx1i0f;ZW?p*$IpUQ6;!3#gC?!`xOeHq=Fz
zl3~%Vn6KWio<HWP(xC|20~eRi?jU|Ez#<(*CVjqf22ycH;`Ov4fW3@rItes$%M^|5
z_bdS#-BxyDH?Eyi%kc|D!bSSH!1q#MXYqHs$v)dwNB`jg0Vp#I0_o#`TNgv+_A!=u
zZ~a4Sr+g~-?%xz0m&I(^FCvA1Cho+01OJTwGZFE_-GkCaH~vr>TKj7>-_#jF4U6{u
zi!|7SDni_VK&hXLuvOkpmis@wwMJN1gozK(BakC!e>JW)(*w*09Up##LoME6wNHE3
zT@@rhgcNE*FQr-@FsA-Ei)NmhB@>)?_${j_n-rztdyOLS1*4`e#gb^;QY*Lrpe`~`
zc=)$-Q%&Va&z;EV;M?h_?pkj7vo(e2>b2x{J8N%`nei>t08JXPWhHl8yPZPEYub!%
zSqP2K&1AT<*O!sClOU5N&ZL^LKSBgl{E$POeQCcCDBU`;VUG-bc;hlz&i-D1XOI@r
z8(aTtMh|Lepjh_O)9=Hqc1>S<X8HD{$l*8z`!_+T9(~nO0kL&H(8Y%MX7=SvGJ95X
zQ&m|bOnjD%{_Ya*^f?+T*uDLNb#6D}82vxT#F_T)dRF>*K$k4l0o+_dEcEVb{Q_ET
z?C%t9-<|)yafTT`Zglf`3qRI+zkbJ*UxFfQguiKn%%B-czuB!~Yq{#Ns=EX84$px;
zmhN~+bq=UA_k5*Gsl<H<KDOG_t^`)>vkMYir7c26)JcAaCqJ(WQ%@Ehod&8(uSJ`s
z_3nKS=LYdn%w;bqPc)tUfqyl+Sc^k-JK(BvyRF!bUc!n@h$f#cY;?Bd5+VA1DnO+~
zEWOG9$s$hP?N$bN12T`Y_&i2jvXx(Dc0ie${RlXB=`2K#@j>u!R-kJrt>Y8ivo|!(
zRGjE2hyx_*PAMa?rc8KC==WvR>t(6>Gg)-na|$ZGL*YeBDJH5u{}D0_CNw=*w$daR
zUJ}=h90iBHk(;y12$zup{_KUOL$fsrz|6V<U+v(*Ot)iJN3`Kb81aV8;-^b6K01PJ
zH_q`OH=T6L=w;cK60*_SD0U0bG|itBX9$YyRLm~Gj}8;c%bVgaoPR}5L}*<DXgCU1
zfe<L}X)F4~m%(cl6&j_J52cuKd1pj=!=^ufXNo@r7KWi*xbJt6A<g?h-)hpo$D3_I
zC$?l+{ziLS@aqmXTe!<DoKz>$Wykd89_J##?BF!8-fhivg<?=4c|jsWiEP3X-NPxy
z_s&yM)7Lov&G+~8u5vzqgy^zZ{=qSNv490qw;(r_%3KuQ79yh>_OhS4Qf_YH?jG@o
zHuxMygii&{$p=$kSD^+nWbL^YTb8AZ<?#iGR~CCbSEAI^vMiR;+i;mq)7dTf<lGJ(
zTj{ytvA~$A)j?MY8NxH@^w{&vZ1OTK?T52fQxRD^X4jZ9+eH`EDxSyi58;B^iul1z
ziPi*=m`rA?E)mi0yH*_>d#7Qni{sSVm33K@akb|`oeuuon~!Ra<@@!DgC^*mpVI^a
zo6k=+K7y>V2uW0#2!Si+Q7JpxNl4@JU}qM9oejaa3i3?vv#6wmSrd|-9;<p%d1bn>
zw{%}$06bu)1e{in_|hJ?_eTofQR2IQ`}(=XgYEjHav3IS@k^f*M$Lb-Wq=PT?9a#<
z#cZ+}QY!Y$NJo!gsc90rKO6~M-oYEUc(~AAPU%ba+CbLO3suNO)YNG=(|ErgO=1Uy
z__*KGe~FygU$b5wS~j9fNQ`&&4-%&pWYXPVPJs1T+}Im@e(rNF89YTkx#G*C1Y!66
z_ec{I;6Z{EVzqU+@9VlrlPh!EE+94p{kjJ@cdOj_ujsVlj;?<qZNjS=JHcLim-}qy
zOgdx&_6~F-(91|WK5q7Oqhpbb82!rt!Y{_#3(S9rkat9_syoQyZ-#0le^Cu`Xu`Q3
z-1c#ve!dtnF^RP<*4L)oPm&P&!MIWl?A!1FO0fJG;hanUo?&Xerh99*miIvLK)$Bu
zme3x9-_HiP)W7M657L698^k~)_J*Vs_)z&c<DVm{ds9tRU@hl83wM|t<T7F-YV1y&
zHfUM6bWBfC$*GY7;`tvW<QovQXF)nFuq_|)*(f&^J52n&9Zb*p@T?O0%lXh~p?DX@
zj%|3mhd1?&`*O{bJ%>^2`G{~g6Jo86H!4}I9cvI>tw3qTT%;O43UUcSo2O2|s1_{6
zPswpv;?=s*^?Mx+m;3$1`k#R5LtZ*z`r*EB_I|Pf3SMsNq$^%IGxZZ)atZbr6F1SQ
z;`)Fb=-<H03P%NhJbuqjwU$Ef>3RJ5^;3%hI*c^ni-**~xgd^t16gO8pdEx%O)Xg%
z`Q>Zn-=SDss;{F4>ftTEJFmvr(R=p>jPw|5=roN#fK9sGHy!h`W+%$D3s4Gfs&Fl~
zwYWrnWUN>daX$4cp7h0~lL;0fCD(wNI&aj9_o-l``9Fh0Fr?7ldq^Qh6_xGAcJ(6v
zQge=PsT-wXiGvyTx?zmDjPq`urM?V)gxoa<4!Jy?0R$boQjmuvL5+2BJZz`o9%;OT
zgfPjJd)2~@u9SoHq<SWC%dW9Nii>a_;2DP?FM7TYv|&#}dp_cyLZb_SLnHiHwft8M
z@c$aEg(7*!leteno}c{pL?~?v)U_ph6x)jfFHGI=knwF8fEf?Q8f|a2Ny|6fprD}5
z_d*Z<8!3zlhpcS{VTHEbQQ*2(aeQxv;8G9_v?a`SkK>uVG^FAu$qH6vwggK6rn@0$
zoiBCx@4LU^10O~6HkP-ySQS3jvcCFhd5Rn!UJkrRKQCnovB{HUoc#;O_5SVZT9IMF
z@o0dHBT2I4qtY{O^$=F$>;V{CdSf<+lgCKQ3cx)B6WzG|>3>d2hX&d#qfSm4?<>BA
zL<(8Wi?Rvo`CI7B64H5rX`Wi|8EB;XSYmj-=@1O0hHd{5ZrrrWQUOlm!Qbfp90u)C
zi-@T%b!hW6=0WbsD`vb!E02rM2ArQjrQ=LrHdI=t!R3b_>L!ROEE?EaxCQa_70mr7
zSKo3=SpL9XtVU^B2vf6ntXYUVOp28u<PG+}XC?!``}(Z-{7*_>HbRr+yNmYmIo1ri
z{Xb#As|#OCJ~6hNjv|%JQgwgnDOsJk6B8DFoM@$EFW2(oz+x4a5>dOD23IE^e+`R0
zTkXW>D>ke8VkJx^Q0nT%jR;TcwLzL_XhDYRa5>WP$fxOs+I3HnPDLHYhpOH`Iry>K
z&HdNNfPlMFj>+9=Y6sS2m*`$!HrUQX@cp023=7P@zw@v3qM^+^lz3GNqJip!XfFqz
z5?orf5YG*Q2K4)^=k>!Oa;UT4x1WsY?u>KwNz81n;N3?C4Vnd06q6)BDbj`1HslWa
zx3AXQcni(0t`AzT){&?7B=qZ*3CpbD*Z!_s`>Q6AHDgrW$X{sakKUa_VX1rm7?3Yj
zgWHM~4CF&!qg6BA?U7q?AviI%FHFUF#sGVewyxBUk)Q$emU4&6-yM;aeHKC1dY=z<
zHiZcLpX`nMF-M6<!0Cc!cj}>^{mkYG<N7j(Wmra_R@a#=>X*v9C~z>XkX6jZ#1c-n
z_IRuaajzU$x#TsZD-}_<V?|Q=U%vsEpA1TXUdjT`;b`SKklA0K9Q289whQA5ZnFxZ
z@;9V^l`Y#eed;mzp(*UpY8DzXJ?O)KG}*+w=rL00vK?k~!gtYK|4@)UkgKNe#_!<w
z!IuJtMhT*74GG~sd2=Q*-AwDl$wR+ZVVBYiU3a|~YY3vcV{ulow``%KW)h3}km&kI
z50QVO%#M#nqLatT|1m6Su(`B*42v(lThH39DM6JErBhODGT-R{h`{JyROj@#heqwr
z#$X<*`u%O#KWyIdSvEn=Asuc^Q93~ITL)%0YG{1W97A*9*(RSoB78&`N#7JQ4kvF6
z12a5CiSSYOYgGzI*zOa|n1z;9xqIx_%2j+x5*<~zwCQ({!Q9vsD{?tN;SLMSgH5!}
zv0=b8Xh!u;a4?i-6~fz`vhocABLd>q2P(wu-g8tCWl2GO=ytzw;ZBT5b?FGLy|>qD
z5da~XnzE2CHGIj@FAT?2-r|YzT{o^^j;edAL;e>9WDy0TfDW>(dq;e0dYo=KC6^2X
zPJS<4B5kX;%!gb~pO%9vjKv+`GV8Z`7MbEzfma!K12!JZ+^D`{Pq=(_<{mJKP7oB)
zP-$2T%nZT!2%C2&3pswO;91kcMr0<rTQm#}%eMn0m)8l+Yt==`ajus~YC5#+&FF%g
z4MflD0Oxk8VV;GO|0Sh1+Ol}>B~xa%aV4NmfOO+%GVtv*SfvL)>9rbISH`D@%*bNK
z>LA16lAHU$i`d|oHYsvjW!3mdc!y=(AFhe3k*Y+ULq0_Q#UJlf<sRT8Oxe}=g3bi^
z^=+*0>mvJ5{x;jQNqk)|$Do(!g6d@t0*$&LYpp-1)^FKa)x!)k)sxCd1Z1H7m6pkM
zL<hJ%lZ87aAYYCsa=pKz=d&4g@{I8V{x)f6&-UqD+*{6QEADV`-hVvvqFLz-js4O$
zyl%;h%#s8EkL^2Ma5i&%5V7eVet`QLQ52-gCz<)CsN)Bip*@jed542VuHqJCd;Cy^
zwPzlAA?EfO0$<~{9Dm^91`oN&{IJli_lx_ccA)S?m9ff_1Y^wFGYQPdt5RUjVpD<p
zE+~`u6w)LA_fB^#cw9q#AQ?iA<Jr2fpPgxiDJplnO^QG#@f(<PfAi$Kg)!HlJT-Vf
zL;qS91SnygQvNobCM{1yDX|4_<WJwHFLee!nPbK-bZ#K>k@b7qSEsS5WL(lSA)W@e
zP8)lKE_JdKsLAqhf>X^fBE-bVf)B_)k)g!&tuEw@9RK#%6AQoFXA0~`?ODCjMsl|a
zAm%dg0!N!X8)I(A?O`*oJ8srAhM{9oV+_sZb0eCcGWVYNsR^+gUE_xpZq+`#w+pAk
zy3~29ekQR8SR2w{5lejQ+yQFG!+)^t50O$tH=LO#Qk2z6WiLAqS6MXso7;+WVgf+K
z2Jc96EhgIZKh8SknG;v0IM}VSRzqlhE&!N+KC`E#2QrRo1ONk@!2k1&+wNfjzVVtK
z0orQ5`knpf`l+UrGQ2u^CzE2%SH4oz6{b<(*C~|r7&6`Q2N<);LF&3*r4;T2MQUXi
zv15`nlXHi;pD~>l*TH~9x&-1OJZ-(bWx9V$`!#i*^PFma9%M>)6JmkupSbaHkLDYc
zYNM73_li@~a@}n;A6vwfMiM>?j;bhz!SaGIIRO#dr@lr0r<Y+*L$M01y`1fKTX%h9
zN4*nAp?oV|4~Nu&S}u{iEEijD_v4z?9xO~z@8+;@yo#-?#54#|--R8DlREnDb|^qO
zbb=xfb0OzA?y4-oZXCm7i@Jm`%Bciyt3_P%M!IsQg4U4LNKq!^uOWevW3T)s>l!8r
z#GI<JpVK-YsO?Ha<*qXNYKwMmr@9vp$<47iDEIHejEl8v#t_&uh|IjB@W3@7Kj*b0
zR7xF`v%kIeu!Cb~CZTP31<e?7Xs+u+xF}L(lHH}?^c&&sBHO^F+24fJZaFopQMCaC
z=KZsw00Q&b&r#siOvQ>(_C-rjX27Y{=RAcx7}y&YByji)K3n~4e;Fn&I5XB_aL=Y&
za=0VVHB5NvVcP2SObTx4_0bhSll~)-umgUo+?+yoaZSEaS%Fb3Oi3%^=yd8DOOV&o
zeiQ=~CKC*==BPH&ZsGxk+<9#^Wwvm<v_f`6vn%7#;j3P3-le_eF(9NDS<L=~MK{e|
zWT%m@QiD2h{pxJIUhwD?cg;2*qc!J;qZm{B{Q@3R#1LsW$Osk@rjg<>8Y;TJ?d$J^
z7u8(T6E@J{NMjf*=^O*#2i_dMHCH1L*n4MMO+5euNsoORe7Tp{t@hEA++iRez=J;}
zlPz`;Va&BnP!pc8)_Ws$knG<0=S$J`;N?quW<c@Ir@bt>FJ9)Z!(ku}C?;>7##8^Y
z%*G9P?)Rqo4vs^0SrPeG%{3V#8dqM<W$)iDq}BmRHt~tHUix*26S+ABr$cDdc5`y)
zlFDXVC`L+AQ4GyXCQb(;_i6#6`c2)CE8#g7U+vXe4rO$n#z7xtZ_4-->D{~=wV|bv
z6^4~1csEWN(Rl2}8P=6)GVQK;7P2#ZEu31!ZUsrCc)eui`fzYoo2`Ju+$Oz-XVkF)
zka#JH?{M0O!HTJ2ixC{b&5n#OTCWHw@*~LlK+t$L5{)Dq5ozDbKB<_`pyegvAaxT+
zSD*9DN~H0_Xl!$Fa{RE{(V+cpsH7c8le@Q*JdINLh*MSg_k%b6c(P<fkUV+0Z4vLQ
zk@dl3d|5@akr-9@_SIc{j}~PHIad_#b_P;%&if;Ca&TL3yIYgHo*Je}BB08C4+<S=
z&?>+6lUTu#?bmqA%@(iT<!8}`sBu*h3=>Q=DRPMlnVJQ@vMoP(n`H#0N4_+}%01!<
zEOGX--+fO77FTt9{fU}A*M67E!z1$F!8tEai-ObAf2kmz>D6A;e<+Nu{ZFz5XZ@ZH
zuZ=x4(XK{j#|V2gOIbHWyx;Hpv=7AMSyPV;wL+jcCQBOJ-N&(tlSS@=%hQ`b;8eV&
zrXX4_{WSltkTdUwFZvo~0OYZnQc8Q58qG~0<LqTJs{B)$t-3|mk^3H;X0597b@Tgw
zUiWSK8F?Bc_pMH2mk~+m@pAx5*4<(d)dJ<P-|W%`yVJ~8MGlUlS|)S1apz5+{Cj>r
zT|GnX-vP|+@NWQb<R%cy+S!&Qr`u@L^Hr?ef_&}GeUHBd>g%4vAHFZ`&<I`+izhy7
zK1?b{x_Ufn^({@a9csE_{jU)szz#W~p%rRyD<X}Z4x8)lD%>!H<mWE1)2#arA4VVs
zk);_m;@nnhjgBf$17HFClrs=Do{Y<WigtM!ScZvzXR1tTN3QEzHUZV4I|N3XMNk*_
z0-*u0D@B}-LU#S}-;LJDRH6$Fewo)W(_Hd#PiUbCYjLQ1RF!UcV4HnELgR}<<no!?
z?b8z6{+=SIAbD&^#>ABEIf$CF_0coqt6RDY(y25Ux0-3}F49hV4u%Y?eEDrVxKoN|
z4><&~nD1_czxp2vmR<+Y>fAf+OK{iMPw5DD8c8O^ZrP9G{VyG_BlCA)$lw}HLfVss
z%1ksRk%-fIR#;VjN?3iZM(nuIX^FjEQjn~UWjy?$%!tqokY1V201b82D^j%8ljr|;
zuZ2ozYqr2*N|iB%+K0^~rSC+X^f*}{c(TdYqp0k=TO0av)X&G^e;1I3OcZtTpt`|X
z=;%|+r@|LOQj)Ds%b0;3wIJe63~!99(A(?U^<2;xs@!(1RK{?Ht^nh0vo@DHF1yIj
z^7Y~fZlj?RfX0Y(LQ2$Nb%A?Zd>Vs7?n}{iJFSqqL43=gkdqgb-#V%lGWBxQd+Y`?
zov&^Az2s`pS7R=|(7@~I8f?K*Mc*xqSD@Sz0~+~$okJzJF_rIujns)R7#}b+Ij2DO
zqMfxNRB|=b0L=;XBiIFWif4CV+mX+C7z8yCmhn*_4=#c2>_)nn8~*GdrX{%-?@Nh~
zS!z$?eE#{1*{<<By$#xa6J+9}qjCX2irD=*`7rg6uZ}TS^L*>(zxyNRPtRADL10Zd
zR!!H)*~9ELr{XgZ_OUYZezeWjcs0=3H^kb1Gh1D|#@64r2yoc>|0Q`Q?^%#)#`m4%
zbe;inI&Y;tKE%e~Be~q2DpSoTYHF|$dsjrIGG4fNesd&@jB?6-{X}19&(sH-%ib@V
z`zal^fSGCXETUOgUDN%GP!rnp^+8y0XgS<-W)s-)zq9af8%@@3XtK~&IQ+ZFk4U|P
z;f>`y=+HGckLalw0Q`YpW7DMi&Unq593_X=^rqDq^lABI!Wx*WnJMk!K|(-jcH8u)
zh+aL;`shSHeR5<%XMy!di65*E{P3uX(@5Bi54)J5Q5NjPzD)nkt~PlpZAV{$IrLU~
zSRblX?uj?vDJJXJ(cE(XIKL7yM-;nt;2)*5yRuEb3PpOm?|c^{J7xAe*2^Z}?{V`N
zdMRs;*r>|?V;$q)V7pA?pWwx#e(AFm&b&l1M1WJ-bq)`}%?5y^9{rP|1G&sokzCOg
zY<nyqMZ==Fc`^e<w24<x|EJ_fTbb6~L9H+E!C8TxpEj1kE-W8tXyqn!ZRKvpREh=P
zfrfu!%KX8)$UmjB5ekdiw+WztMx>n=#h44B9RS|btXIhymGgaf+0rB0Sv;}U+i@v@
zZN!Yw8SI8_Wc}q@+b8<D5w|#Hu8keMEaii`ymgxz0D#)o|DHsa453^%tksT@L9-pA
zV(09(J@1in{W>Az@qB7ZKbrosGbdF&UOIU1W-Kj(h%gpS)2{-z#_j{^&O;QN@8W>m
z8lMo4u!qZr`oO5Wx;A#}G5%cb^rya`fgk3av~?SJH{ydDi0ijWb)g8Cw@0rVvPx~I
z1}o=87gmaFQbasbxccuBajq+3hs2Ry*M({6#cm{ti*~$JHDw<c0x4WKPsqI@n*}Vc
zh&WdDGkbx97RQ;Q3wGl}o-aqs3a|JcXtZ7>!pd6(Qbp2J*J!+fKwPQ|U|Mj@JZ~g4
z0%<93!tG(T4KtO-ORUdr#ug~nv^*u}v``M@62nFJF=R^baQ#OTC|zTTFZhG>VPz=k
zCo(X=$9e2hknrOX1*D;$to~HP;mOGqH-YjU)lP3Ungtkvk)J!QYPpeubLHw7x}nc-
zKW<$6-3#09h)UbSy-q@coBRM%rtf0eb3EQJ_!7y*co#KtVq`yB#bMW+Tg!pEX_tO~
z6x5E+qTx+-@h`PmHubKgFR3O{OlRfx!z$c*XFxJcxxC?QWJc_|ILVh&@%e(j*vAF5
zx%jSzhQ|s5GvM%R8zRsPE2xhgsI$QKtf)PtSd-0Gn>UWu=ZWv*Eu^y?Ws@%nYkV!^
z4JeG9aAOfC)eCARR}*9JU|DLe&wu_^uImxBTxHgCtNJOwrtAB~tXU0g#@UKmv>7y(
zkWBkbY?@Xe|97>m214HI$_OU9DfDpUwsSD!x>$ISJ{B+De``9jiS&2rI?BXVj3iG%
zTsO8KPo@x*0nGzh|J&~y%;S#K=Fy_LD}DKgCtkITJ@5cA;6(?|p?7;*dRs*%l10A$
z4d4<6|3RD$tSAp})s{}z{!+q{WC=5pr0%D=$uIW_#f&JEM13$mL%Dvg4r&&ic3GBf
zbPN%~zM%CMv%}7<G&E&NEoRkdv6D$>KMa&6)d*XZ>~i-V{ATIp2Do2{jS1rb<c5xm
z6aT@NxL}vRZ0$kFt9L@tyfmCqg#@KF>@sPDhMBYj3j`050CGmIGL3tSaJCQU!S?KE
ze3=`y1Poe&4Bwjycr@f9X3kIEb|iPgiqYg&ZATem%{TR8n=RTZ&>pgG<7UEc@Oz4r
zX*%8bjMR^wY-cw?U-GRy4M(Qeyk3t=u>FbcJ6;`X<_gum+KUs*e6SN|S*u{R1%Tgg
zw4D%Au?@0!8AiHvSxNNW3Az;P{<>@bf%Ri`m4TXq!33@Y6pOO9Hh>wL_t;}tTDWCe
zokxhh6~Yg<0{wj(j}|~`f^>+_5eBA*YJX5q=40nirIzJ({yOpc7y^se*WoU2#p_6@
z1SA{K%wN}jE_);$Zk84o(VOB~pjIE?uq5B17^K^Wla~M3*&wypa}{m&4bT}ZeN=$1
z7&ZL~tXnD`STaJ!bt7E+{M$`QBfnUe=lhy^D`)vU#SJO3X$oxUmI)ppO5I~17r>&7
zQYcSeMwx0h{OJ{V`=Q5Q$0L{K(<!4eU^z?}BM!p0qUL-&Lfk6P?EZ-V^F0;$#{37P
zdDUG$)l?xHXWpm@l|B({<gLB+ggW_gzi!}H%8IXFQOYe>$_Hq5CdWDLU<0Z(v!PpN
zJpru9;UYZ<L$2ce&x@cxmM5*kSDQK2@)p?Kk79|U5ZyEZzpnP1o&$ukqmo-%Vpi()
z40M~Y>_K)FeX=n(67Spf!*PAI$)DTanQ!(s6Vg*XWwZoqi~BroEK^jz6|rPQ#Bj@F
zUrMPlf|i9%8Q>#9kLmO}F6yLK%=lUzr*Dw(p8x+4Ue*7F-Ukp~tu0$XV#G|@&HQP_
zF8D;)&1+ZSnFWK$YX`7b_@xx}07oSQXi-qHC>!jyYKrt55dOXGZbuSb`;V4%fg^zG
z6SaKZ``*3E!%K6QYTrD5?~teLCFcuL6le#m&l#@C<lPPnHtW)EFSNYJatTYE8Hf)9
z+axG8+9{G>e^S!DcU`|~T|9&NWzIb!49p<H)vF~w&7HdxAVr`0Sa4zaeBbsnU|6%g
zWcR@0nm`#RX(m=6)|lGDv2$54sSp@xN39!Pp$*^mD|x*v1hlrVtPwE(N7A{+GyT7B
zyb=moedLtGk|H7J9Oh7|R753bSwhO3&uj=GIiGSS=gMJ;VeH_LV+=Vg$B}amo70TV
z{N8<kfA5d&G4^`juj{_9=LPb-`(g0t^8=A>3<%p8Ne#|F)a}Si*++G=KVD2*vU%OB
z5YXkHh5D@L#r8S!$i_``K5%a7vR&H>-DHvYCzD*GGkiX0$;nKV^b_2qbjsF6W7XrA
zV;4@Nn_uMH(+Z7afi5L`sm?!smp>?r*&$Ugvg3sXzkY-oE~6rHV1X@gd&9_@$N^YB
zZq7^)i?=HP;JWV}gCQ|McUX;Z<o~+E+65Yp+AURP)gNASp#9|kdplOJ|7ki;`zo*r
zgN@G9lmcdPQziW-zz=rsGzd$HeSEMiNXKb;NbKnTVrEekh*MKS7Rgo?(~eivzA688
z(wh@pN|g6QF2jy6x+KYofGCQtVQ5Nth`NtS_ua3{Fm{10RPb(`V1xoPqTl<gB)1l6
ze*)b2g@~e@lj>FEfuEREJ&lb9O1kF#|EQafj@dqM4muOG{%Mh`p)E}v$}_EJXJf@r
z-Zapo+3Hd_V+Kf89Hgr>b<uzqNk?k$P>j4=zkAi98p;-m83~6T;H>2=2_=pz(3URb
zuFq&7x9d`4+kN%w4ouw@P1*2l(T3>9cmTf=W5y9=d&{rTzr>syOc_Z5`J<E;O<RRK
zGKh7dc?lYWGknS|H9rT4ALB!m{cW%G%NscW!t*t46?^f(%`<q*pS1TUM+fr-sSlRP
zz>QQ8`+&pnA~QmFKYk6~AdoZ&IWWY9Eo^pO!+P@mTW@iPUp#-O{+;~WsiThZ+Q5#;
zQo$p}rE7tq5G2I<u1g3*ApyS<1noATK`rucu!cY}H+b@8P3ZSR)B34xMG9!(c{ga4
z7S^xHX#HFTTuIqMn(Oxk_FuQ8I1YcPZtc(1_KUTz;Eqfni)cQnRe3tVe%9Y56n~8h
zol9o@uL89UdtMZ^D-R+r+l%gjFMPqxmtDbdKi`7!8@>=)bdiLyAB=Zf%+5(2j^IO{
zvy$@|<0tZ7kvGs&Un7=bFopW&AkPE!2XS>^MQiY!ZsiJ__GQX=bV$5bdtcl`Pepqj
zd+*~Spt%n?-)otA)II+XZR#V(=q3;HJg#Tn;tgWYJoV&NVl%9=Wg@5A{*3<C)Lhi0
z-_nO?fx2gqsWWtdf6Q%AIidPN$>6Qusi4X`pnx^bBmG+&;RD3@ZE)j^>1%MICdU{E
zJy7#fB+H)d%HiwN+KbUTJp$$tN4)ERgR=zxbzMzITMEK60dT-i)%|eXFFxwH)cnW!
ztWfvY<GK><b1T#)o<D9-<_wnz#?-y83U-@Pm#M_+U%3_)>zIzVC$O4rX`QrbYJi!M
z+;S={l7p0O;ETtyW$NS*lgYpi0t$n!_6XjVJbdcRpj(CXl2OgP4|lBBWwXn|#F5O)
zARuoHRz5Uq&!8xT2c1Md7m-uIoaMLv&R0pK<$47{9^n7-H=>*EOxpq^caEh6%?p*X
zTAK?ZS@o{#sLdGpqfQ`Eqm=_nKC35A$Tk4xl%K+9xEHjs<X!8Qz)<1^JCQyO#NRve
zx}(ZQwr%(_Nk?qzu-py`)s(;nk&4KC{kW*?ki4HTFT+i+3tKs*WB;vm!UO2cy&0==
zI%xf6<YfJ-mgx24asWaE4T(Gy&CN}=p8>w`{Xy&>7DA5ZEQu3iii1R|TVcu{VD+Fe
z<S7Ammh3ara~zt?2po0Dpa7|-#5#uxpMDqnAFTdA(h1pZ@(R9+=dcf;P^<kzC_FqX
z!~#5LrCqjOrBx1h+Z@{sKQ^J{Mi`syu$sdJ&5HT?n;vhw(nw7Q?9aWc8)`nYI-))S
z!8v5LjmB}00Xalzd0(_BkKv5-^6{=J2p9H&B2cVYXZbg$S=?bAxvOWDSR%Z;-5WqG
z>p*jW)PG>U9Ll*qtMYa93t2;cOd_VzU_>!l!C*gTr|Y-s|3p3Yu|>#3ANOgH9W@(h
zb}=`~dh*$5WBAP<v7@Xfi7B^8#BMa<iilz`tKuo$fb)h&`kMBPH!mNfzOoBq(Z!v`
zRSQ+TN7{e|C10#2C2mQtrgUQ%C{r}t)S&pu>{f7*O#v$?mIRw0oa^S&0i@{V%pd9c
z)3`T5*QfV5*-Tm-3)zhg*9jQk!thMW9r{z3g^G5%C|NgLmd6U-`Wsl$1Q>CdzjyrW
zX)Th9gz?6P92opU>uJqsN$jI&U><Ioz@tFVxtwMwJ=BAW%bG9o4o2#iCEEYSUxg4S
z*lu4uRsZ97%?wjW|9q5N1$_?9mKf`dff#w({>=AaZwgyOmJ}5$@W-#a68Um`rm&6M
zxiS+*uui<0-$}=$vbR;HuNAt~;L`7Lc@a#eLvHIJ37??=PxQJ*8#h8uTyA>LHE?VX
z*x+9~$fBK5@h&v;hVG<+=E~P5Fy)Zu$q_(gWCqpa+vo#ags^%`LdIRU+uE-{-;^_v
z3wT}1#w8xtlNzkE$jWf3XJw8a>Z;cUwm5NACrY6|i==3{bk_^wER2&p8s%H!Z^pC!
zVG;^|<>|7MfxtW6+iSPck0M(753e*B(70QO*AbZ$@F>Wqv`Mp2{w(mHjrF@(-4@ie
z8o$IblRU35L1TjMjXYh_q>?PYmuLv<KEQ4poQ{_QSWr}K{l1tX5X#dy)xKdP(*Nhw
z_rsF_clVv9kvEDx^BhpLu;UO`^2Oil-qti2S9iy?ad~l!r9%97y$@~N$?>|3rUTxM
zdrE3BNP%>u5d1%!0x)0RG5bY+?E$p<)NU4?WA7^AJoR0+`+Nd|_$67WY<pXY49gh|
zr!kYm2h06F1Ve7>#G`CS=lI{+NY|1^a~x%+J}9wQVlaP(mhE^CQRN$Nen^CjWL;N%
zxQu#or1$$SX#^d^9Pj#@a*t&WLmpKk2*m`p8MOBgynF)tGZzr7C(AG&+z$@(vU~K2
zSjQ^<9<j54bD5{T3vmGnILg2J$?hiSXybmui}ai83B2ot9*5{w^90IsV*O9TTCen%
zqb$FVzgt1Q4OU-(2vLT{7IgaMZKTU_e(Gx^+9gJ{80h(hQhZadTLwjTs8{#w9d|Qh
z@LuR`@qT&CzpJn`a<AkTK`R#v1POP^?^SzGIob@9@(<rA-Cg4pD)(EO;#cKZe}{?w
z8tenHo1&@rJ0;yhb!nF0)sDZLqs#S;a%SxZ)b@4ee?gLK1-Eir4R^#O2`zZvnvH}R
z?b>K^uK(>3xAv^}TT1paZH`ZtQRhHCgkyklCo&Y;$R-SgARuq}B}Pm%&_<u%U5s1b
z46oVEO<i-YSw@~wl;JUY<hi5<c><L9Lf6X=DhD80+uR~p)142mxAJ|7cXO3OkC@8|
z5ZT=^7I#xSHBuM4OwvvSv_K7Pz;U<ex<1Jp>TneTe=ksp2J&bf6PgxDH+bbVI!rX@
zx9F`Lk)ThuuO%N+)hV1yV@g-{?)0GXGh$}bU#AP!HWx)ML9Ox@M`JiSbvgsU`bdXP
zJyN%;4t=`3WB)cXt|ncddAA0EYNK!ic2HdW`te{A_De;M81r^xyKBXH^(ENhf^zvb
zUaNb>T<O&cYNyO6ZNspX)D`2T3D=x!HL|fbZ%dHcLa8@!%6-4&eL+r_^K9UHXJ5^}
z`f(83qs|%M4+xjO`87#bY~QG%_cA!a^;5O)5*X0f9Bum4Y*ycGzfib&H^fDs;c2#z
zWP3({c{=W|G!$gm*Z+0w$8VNI<n!b8HH)o(d^Ku-M0$u6gn#~jV`cZn%m2tN##Tme
zat&|rzi?*bw4lSi!R+S8d`@TwTs6P>2c=*RbI?)PyqUqV)G|nnU&CK_UQD-{{n0*M
z<xqd9$T(iXI3BrWJ+?F>>lLK#_<R9zT3A&MGdj>{^6GIOvcNw@!(Ub~oxcg)=2~aa
z7uYn47-aDdB=uB2ncmdybk^H<RzcLIV*9lnRsLSXNx#U{W_1m9qh-9Fsz@7k2~KpF
zZ<_L40xb?kSoyT%cXI*-VC-`dv(iV1H0V!+isy~<_nxbiq_Y5_A*Gzm&q;G%ULRl?
ziD$GW_IxE%f=*`zlOn7(`=hRZLR@X~Bo-n|?g=Rkdbks>Aq@1OoH~xp{hQrr(y#rm
zfeA)uE?_bnQywc`K7sKqP<U<B2*rsN7y{KuD^Z8r@!^_nJr?H!Q;s2B{6lIZd_^m)
z2QRS(cS);*2EPoZSog>-8~zbEg7@0kRDbPsPR04w<E`(yt@2d8ylg|C(!9cV(?}H8
zZO7|GXj3@=QYa661lYo6(sr^xdLPAHN&MWQsdFEmo+f|qWA2Jk5PUH~^?9hCJ%3<#
z#j2%hX-xdRO~52E;!uGiYgx_r5I0-Q$7DsYR6Kg}eeY)>FLe_{S8oNMGcjo8`I`>Q
zdDs#&8!4i+bc}%0L(29Zck0dyXaN00Uq`&@HDfXCP~v+(L*y`(a<1M>chFAgU_K0%
zeZCaRcJJtG+RyWhaSseD6u-1I7P)Ggi%K>NCbZrK`S-_P)RiV)0VEoYE}7P#Q*%>d
zG?e_qu;7%8?qMax7^mIRL)V7B{otIAy?2(>R_;J=h^BnCS)5YiEI!Injp9O#yy4iZ
zaR+z9k%JXbfxe8`%50&85++_5PH+B<o1KJvO7@a%1<z=zfJ2V@QNPkhyRFNRzS@+M
zl|o`^X-XsAzj^=Mz9sdCd3R2`5iSmm>>_@B#m;NMuPCFaEH8q+@lZ_f+-k?NY{%LY
z>{O5lqy8ZwVQ%$te{k=-Okqr6XoSZ-;L%%e6$Kb&t5Q1@UC4NIou^>7dj6|5H$%_g
zzO*T|jan9+0QSti9z2Nk6>Sbz947>iL$w&pAS<!RVC7~r{%nYQa;CtVg!_x|D*py_
zUGfnucxprB@XjC<azgYT1tq6(ogGe?Iug*FTZHMqHe9OogK0KY-Vxo(A{5po{PA}O
zoyPg16T+-lqiwFw+S-T69-P(~gQF)d4U_^-y!~rq>})ol?IqTbSCGDg=k%zR*Tx>r
zz)*Yi8_fzr)&YM;co8n^LAxZGAD6|g7ACJM-t0atY%eV-k{*WC;+*C%syNh*b_9w;
zhOlFNf{xy9RKeG_tk809HeHEsdx_*&3w02B5~|;+hDkdSYlJ;quaxrE1<O6}kv<ht
z*<6tY=WD5x9$N@J+WL^=eQCG_B8i6NL}7foRGsO}*lvRcV%)}YceJBGY@?U0B>EeK
z{A3LW1l@sQi!qR4?{dQrbdqecM=Uf^cJ+Mwa|A@1%>M4x;v#S|Y&nf9@;HDJ`SKxv
z=Zc9E`q+0f=Gq2h)Pj=u1zYpnXt7f|^X>wA^zfRXhkx?$v1}gyN|ft(AZ~O}=3bN7
z4vKpD4dqcqw2Sx`t$oxmY-1{s1DkWAUnrDVxPl+53*J-r&$)u&=?;*bK?F-QUrpTs
zX8gZv3bR}3FS&I5!MV_wbXN1lKFa-S0{|j~AMdcKir?z1_y%ydHg7I3S4te-Np>i<
z&A;i%bt9kQTdl6D|98$}*>J!i89vUr-zB>ba>4j2JWDV8g{#VEA7<nfQx8F+y}Oq1
zxMM@-fZU(9gz!0$(HJ(2SSZoA_R^|LV0RTToDUHHz*V~^GuoPJi*42v`cTteQ4*x+
z%*nYF+^DD{HU0-(9IXd%x!`oS)tjK9l-#TPs3>gAz^FBKAck<MKJyS8faq(0f7(BH
zVCkD6z300t5muhDlL4ePd+XyR-9q=&2*uREp}yQv>yVOvU!BsJG(?)dY;)9`0C>c&
z{(JfYH4kk60m=fksLjhnIk}1dChxPe@7K$!7dP43aDhLM*HcXv#LD;dUmgCm;bB^?
zOv0&UgrM`Viop46(<Dw?!iC0o^Y!jYnnw3{)r_-<L4^{#roX<`mV+gUwg2oC^}MQk
zB|jI^e6Cw`*<G=bCeIDOm>MN)U&<DM`o*H=C$I}tko4~)se{FH$XOIH+V8Q^Nx!}R
z&P=&|E_9Qh;w&W$qTMF5tYEt>qo6v#qO9ALeAkCN>(zlsi?%`>?w^+D-%}iLF{JgE
zrv178v+?KE%Y61IdIBoOd>&xR{q^d?ns{zARX=<k2y_25Xsx5SilEWa(u^i--BWR2
z@YV3j@7Fr`o5GmO)m$M?A0p^BO;2SWIO1qz$%E5Q(CPCPGKW8)RzL21-U@58P-YZH
z<LkIGY8EKOczNnb#robp?Kvxa!w>HpTj|K5I9vECB#9?ui&!Xoe~Xq1VZ>~2>x~IY
zKu(=dpgsI_lfvYOD}nZZjWX}ceVhCAJ<&ON&vKcoJ6d+~u9eq4>+d#m1yZoS$!<B(
z>)*kOqDQxRtSZeKl6PCdHQF^yHtbwZcVH5f^SWamGH-D)EJP@1{j%fW(lR&G<b-VU
z05Mr*I}Y{%a~9BMZsm`zpm=e<_fWAU^4QL=Sfgi@=wefGeNPgkDta_-lATq9qlJiD
z{Gj=2sPmkEL)U@jE5nhT31^**7e|WF7}0yI{lhC>hEHPx3~1{blTkgOEUp$}9(8wC
zOG8cx?FKY;wjc<$M<Z-NXOrnAJT<1X!*kU9=<$qdaUYTTq#Gg@^4UtrJbCF4Lg%*`
zmXxBZdLrim1=Z_3Ri)nPD`d0EI}<UESkJwRB9vPZi*2Fp#iKNg-{cS+sD{xFHGUxL
zvd(yM{mhx4DDs<!{(b<hwrB#9x7#YDJzMM(DC&jy6Cr2rvNP32G(AY{aw&DwLx+YT
zQIQ!~cd0119LE0Ck%w<p=ebt-v#zHnzVjWp$*B5m*4uX(%q!1;FUA%JY4yKMP@m;4
zVy$=GkfEKCTH|TJxm=kxpW&!%{&LR0(qn$Ru6(KmC>wDZPf=ZSP`JUE^!bUrBJTQz
zYfCc&694egOg>BLHVN@0!e?PJ0;aS1w`k`5vx6LpwGeITa`1+oc)bNpET!{8xL|1!
z(qu)(pJS$Lv`j%7bDh!(uf=`TG8UKg9U#>MJ!&}LlUga*oxzx|zeo`LN5o#o(dG|h
z#-Z|&X3U}1Brlm$Xdm%)_*!rmenvi<ej8w<=SNXEN^uXj0p-ZX-KjYV;%5jHRW8Hm
zZ&|pF#0Eap0tU`iSpFnI2>j_!bwLD?-~ogiuLxe@%`u{hSsi8Uly?(?o^8OlU^*-I
z;9zbgE_F7&&^Za<kp0xi$IMWg3gLA+fw@5wrEf9c3oh4l3Pf}v*Ex%5gm;J~oz|MK
z?u!mVF3Ao*oK;@A(va73>CLX6C$d}6Dmtsom};-SIG|mRl6FGk24K!i8{btO^exHd
zq_F&FzqlVzxm^G*t?tB^3e<y3XJ9Nw7BkZLh$Vr;Hzv#HKQx_{`*r&#`L#D^h|ASB
zwN2^TX+QPD307zmWEByrh0C}^%r~7ELq2evyKKi-r74Us3Fyk5KwrmzbS<Ph)jJVn
zr}r#%S|=XWDCxx@pTBlG5Z0ydt`0C7`L?yxT|<4<x@bBRV{(f*F9@f1FY#JPb?BS~
z2%q#9Y>x>m>kNR=rZ1w;%52Y>+gUl!9FM#4JnPjyEH@{r6$%+vAP6m<IBJZG|2h7*
z{wW)rxw>e<9XW|`d4(TRESpZ~<%#qwUq)6EUL#Pek1{4+FH%=6=kJ}_L@g_%h0jlx
zTd7Gju2cOqH*#j(C26n}LQUwALW@^jo8M<VwI#+gekOy@ZMRET8*?|pV%AT!b_H-m
z3`)s(%kx`k4$Uskz~q8>q73a`y;b%f{0~}gh>h;_nhQ~8pnQ~<5=}a}+>7A|?=l9U
z<JX;Om*=wXhCXlu<YeXDbDy8QvuM6A+?FJ>MLV+es1{6p62><9QfXcn`g8IjbNy0H
zb<Pp@KI{t_Duc<#cIsj(YYq}+KYn|_Ldt0vCHI>t0KJS73bT>ljbq2_0g1%Wf1>BD
z=*~t$f$A3}B=0K1VNe{j;IBdQu$fHrps5dbg>Z#SS~}V^NpBt|gT&olTp;tbWB8b6
z?jb>4M_+x3>Jf{8TK;;WBFzk$XfLC(GiYe4+YN<m5xj48);HDg?P-mNJqt?M8=m#$
zV~%quyL#+xyy*pVhR6!qkbE|1+2QrzaDd+x<Pr{gTg9jKwvG8Y9-!6qiNy=KAq?Z6
z%_7%_JyR}xl701}ZQpug*g~Ctw<^0q03;*2GY?nCi!bFN_Ts3natmQXdqA%uYPO~M
ztB|Y?B{hwKa(4=Rf9`VJ`|3U2B_`#?vhAgTWOXw1N{DQ%bHfV0b}iubm>aPWN2EJ_
zmLLWlHR5qsA^bxBE?iY71;WOF0HVuQ)io0zi;I^|gXidnA$$yB2mk8GV*W=g{C%UU
zazPI5=@L2uj@C1#_BV-ddG1F#na@4Vvu!yN#hwsO${^H8Xt8Qum__pK`<gE4cp}?j
z+q!e;A90>Ieg-@+fdzY;h2ICW!-Mf{4L?rOp8EY9L_Kc<-}HJ}ZFD}M!F;ZePykhH
zD2wCZn;GV*-nYvGDmINvR}(UUj&|R<YvmLl-+|5wHrKS{Ai=(u36CZa=G)qz$;MtM
zz)AKlkR`jTOM18ut5IzIpC3_lMRz#a199Jf^m|Nu%(lc+Lz|WhM878?6Q4JxJQw=i
z;~`!z0rcIg;Ncvq>i2;vJd*{7U!9l19kW%J55_y5E4RSR(t;-f^cJ-=Bj&bh5!1Y%
zy|}n^=rn>9WT<;OXv?F>C~uw^JQ^`x)H0Q;r5D^KeuJ>m>l^NswG0z-)H4cTO`$)|
zaqGwOCB$_zIC2yEIW}*N2`;Gpk68Dnm1~j7KXEv#{@<@Ec<ATCGZEE?4025u@rGzI
zv7#u*?9^!aq~GoM6ZlC#1GOaNuHcK-H^E&`B`%bA5e*&9Z=@6>_(fV|9yv_?)h2Ub
z5~K$xCO#BN2Db{JB|+}s>Sliiv0*{q9(1Nv@Ov3(Zg1FnK+z`*KMlYnWkfBI5ozC(
z>1P8gZ6<A%2$X2Haiq<@<s!6qK~wIT=SN+n$eMazMYxQE*%ovaA-mLC9kPe-4~yfS
zAF{{R(J3XojMh8gU!ySCdh9J78lJ<=@k&j6Rf=tF8QVuDrpg{WV@JT_IwdLDpL3OD
zG`Hoy_x-+4kZ^%ssIfc<PS04n4CmIIU$j|8`Q_WTstt|8;D6vhjHc)J7kMd(0L-MB
z>eX*F2hZtdE-=T}0|d-w#~N)LF2f0$aPWqNsve$RmfXK^7%U=)v0CMPq_>P}uP~j5
zt*_ocNMZ$L8ibH2L7RL#Acv(e0Qe20%On2#mxiNz2Yji0vwi*X;I)Vs5bA}V#%A&u
zo^Ki!ci?IER~qM`fq+L0ou*kLg}?lw0}RX7*uaz8mn_ORa^AFCNeQN(b3=o+<&{$@
zrUh&2?ZiJU+UoT}+g$}SgT2H;b&(QDsHtPr<Gs*?Q#S9F_SfT~onvAQ#3;K~Y0_Y}
zwpE$p_EJrk%PWbwzh*IP-Dy66n`Z}VQLgn_&UgdJ#<?i!q&jBxn`oh*md|7aEH&+U
zs(85^O%7ed-&pe25L9c+NHMLouin&`)`^%ec9fF~S`bn7$rp9RZb2%Touw7!_<-fy
z06Qa1$8-X~y647a`Fj`p(tN}bqu5XR@3Vl58>W_#K4#2n{1z$8_}Q&V=Q(<bqkeL9
z@|X6L&v+c@NwciAFGAd@5_N3Vxf5I|s0r4{Xu(&`>_PU&L*>?-cht3NR!fsPakDV~
zjFH=Ob=_ol<58b)AqAO|B&R=>lM$J*XP`pe(mC)}X~@EpAXOk07X_R*1!g^dzW~04
z<>{^1*Cv_I&EDTT{qA?Lc87E<Y&}4S6ZW24IG6w93Zrwq-(sGNe=Xq|$i}C`W+~(E
z+frk>zu|6!GC8E0{1?F@>(XV^)k*$<^6S$#aO+>SbsaHV!BD$*G@gVF*eVL!7fjBE
zto(_pe<4Ub*zn=0VOk)qenG8fEZL`gUb<*xd5`Kaa#FY#x4iztQcDi6Y2`hiYUv0t
z`~`*EhEN!{Sz_ds85JSwm*)2ylj?h}#h=1i(vI<PKlRE3$}!^VR8~$YxKTx4@P=bQ
z&cpPcOy{}@e7B01$mPdU&6u0f=`!^;kcIY(WKrI#mtLbc_ALpMI`|jPGXcwNZEAzC
zm3_fbe$$}H_#5dv#L>I`Dw(S`D-Z>SXS5CE_foAGl>Lx{U=5(msQXSv7)Ban;M?NK
zAjud}O@-A==(N8Sv}uDm(m(pnuQEyMXN*nx?t96za*-+0MmyvD`|+3RwgSC?riU|a
zH@Ps$E|pg{nf%g;=DOl<jyLk3+L>Lhz8q!LVDGdMG(cLL=qkUug=&I0c01IiaCsya
zJ*MX^IcGN+zeqkgeF8{m*U*lRZUnBwBgi-?X2pMzCogP9%&&$p*u$<F@lNE+Vjeh<
zYuR>e#-i^c@$wdme#@2n2IK8s25oXAcz>h2dTR<`^p1S3>z_8R(do$*0<`u%T^o|q
zZVBi)Por{Cl@Le}$}U=b=24^G>LtIIi%N|np?dR=zhC!^gq6BKYPDh9ZVBYrQEt%{
zl@FU-y`c{}fV{JT3>Nq4UiUj>b+hNSHmBx@RIV&gq8;VGk`MEoy^ze;0Aa0{Ud`sn
zekg)X_9-BaJC3Ns)@vR%*xyE8iGuQwKak{km%A=O^|dQIdWbgD8Or&kCB*4%k;zB%
zICL{n>;Tpslb4dWs=dy0hWgsSD{dd#^anntl{!i8CQkpZUqv9gaDd1jOdQ>{0`&V^
z$$%5^B>o-ishy*Q$`o_i^gYFHSxNr*TW|0E4LEEqlS%b^7h;4Vqd{>2<(<#+B3#oP
zJ#})FB(`mOe2Q%#@amWWE}_OSX}a%Ulq=`QyH#S)riR?xy)F1U_PGltk`EdGIqkR6
zhgbpu_uE#<Gp8)TNEUA6Ui-EUKidNM#XfS)O~)iy;6NurE)Bron+s0XK6#Hv0RReQ
z4o{F6exI==qMBoz@nuIKc7ZgXxr|haQcXRWyUCyX)Vc)kyX42nED|cGWz7Hj9aX`w
zP2K)`P5YI$v>H$ZME%l>y!-ruO$fK7dy#|h0zogtr5~~-D6bfzQ|T>jYbe90d`ea;
z;zNsV4RWN*EF*LM|F+Z$(^MX<TX4!Y=P|pMc8?o+887nh)7Ow9E+g8{wAgw=!2KF~
z(%~;Hrh*k#BUGLR%3`hNe_eNM>ld*Q;0M&_mgOL1$<o0`IW7llYQNlevrgsgb7E>v
z>%ICyD&aF$+O7J_+M8w6FgM=fX~@3-5OC~ABHt;@xC0%BPICzlj2-GY&Ev9P^d1E+
z8cbFeDnZ*pW1k~ZG~4hVyfuu(dV+jpx|^g|DL3D@O-nD$FgA0E%x8nMTav+DPC0Mp
z?XNZfTcR9*uZx{zB@eFJOi<h(Y{6FHvA;gNJ*;B8o)t~_R;xmz2lmxL=y!uF3-oYm
z^{Bv7?$LL+kHS8C57@+nr$%P7?F;KqkOkm|qAc+fukAsX{VOFWcYgc~I~s)e*;B@i
zRB4-^!jz1RuIC0{+U%T1<Ycoj!#T6dYxn}CX~(!bWtTJWl^xxNX494p#bB8RC$-=q
z89>^O;^lOsm?HTH0|lD1ijYB%C9mWjPATOE6iUpXTJ{=d_^<W<ra*&+=gBtQa%LDe
za;}{zT)Q5anDTPo9PP;Ch+$<HcgnMMW+RW@<-&HbrU;@#;BG{6uA_Z?bpOiZ{ar(4
zTEw0uKT4kRr64%%-V_8jxHJ=U{DxziE~a=Ba1*r3A+A+CwOy+E)`{xTvp=c=ddI>h
z<xlAjN>`t<1;jOn|90kw-)wswKa=vd`9R1o%8~k(^2!pGK}sRrx|dT=TijMp^_k`5
zEZaY`p}i=!7JXoZuh)o~CRaZ5f723yQc@x2h}p8$C{WFGBJ@i|G2AV9_mQ3)u)k^V
z@n0dRhw!lA1is0a&*4YZPUo9y6Z}DyB)|uYxIa^3@g~zRtY1o?{j{k~*0-u*A~(HK
zY~zLGT%r?7Rn$=(@0h0)p)`EZ2PG6O?d))TJOJR+W*g7LC-zzQTp<WvCiY-Jft}5l
z4XK-ntg>85_x(f%mg-%5?>vch0o&!fF>E00$kG_~Yg&WJH0lMOXYEda(M*(c==S<r
zJG&&%7L?yQb<ThN^J^)q#U}zJk>_7b+yvjvv#u$(ie?oippwguv2_G6I3U$wIKKSK
z^{U;!>Q`ybl>piZP&jJzIurUIt?We;ORG-Hym+SBl(jWMCk6e<eE<2COeG-Oh!^?g
zNRD6dUTEE`<E4yCN>ih%y{bKcB<}LV(4qwFzdCc8!t!x;*MSSQFQYG^w|O%*yPN2q
z1W|Ajr;!@NOngDmmZ7(aY8UnVY81{X(6M(es1m{3ofQz+lbhiDVwZw4VK0|E<1rUr
zJFW(&jbBU%dmj55adp)**o;wD^qH!{X2c#?P&<vH<d}U9el$n-r;Q8mY;3<M+>k;D
z0-g*PeW<?S*v#5Q002wZ?4G_1TBF}iMWVt-cFnfErlGvFmUmv@P2G*-a@TaEoouhq
zWq;hlgZwkvX7N<X9LPy%Q+-lhdd61L#FF=)hYM-!<CQ{qF$yo6#0+fEem>DPUbVEE
zho&a7zQ>O>Nos1h>2zY*v%pWAv*PN+M{7VYhD~VWsp-;!YTX6}ZY+Bg6eqdxli?ky
z?cNsRC9s7TbRU_VzA`KauoC<n6XbMjxXbvp5bJPI<QR20Tk6bY5mHuOA=Br4pkKLR
zB6LExv9v?UB<n5<&oXRo2XVL5gV)DLeLMPPu#R>ra2)-AH9?&&u;5yKC^T)KW}1sV
zcKh8iDr07|&yo4Kc=I}d&v+Npg4OC$FehXSV@%Q85lb`C!A)h`A`AH`ppcZa#6Y#}
zR(8amlhOd=M~Am!j_P6uOwM{m35IU2JdnrDMQ_+64@;&3R)-c<ePn~X_CyuOZ|-Xv
z*csi2TJ1zWoSypSs%|$Dj(=!6`snDl(OgI>SWyMqCbynQN*v<RS_tX4a-}bu&JInc
zdjy9Pul<B4snk3T6qw67hI}+)I*ed_^?G*_xFDJJ@h5nx<m8Q{5)v&7w3I$_trd@-
ztpD%h15@2u@t5`v*p3s(yJacM%@?fOlL(mKdo&+!1}8}El7|5KHY3qZLw<w1wh{Tg
z!-78NcIIb6u(u^lCwO+5jSTk~iaR<N<nl}P!N&TrklMh66k(%pq%gN+O2w}hUcgHA
zo%t>;T>6gcM!Z$<dY)Md@{g*TrwSv{Yi0_oUX~6Ia@{)!=?o;(!94^SVDbcb3?HJq
z0k#+Kt*zdtX)AKKPZhlTowwfORmS!fUSD$wnx6(9&(iSNvqL4g$>k(0!(xa{8^lZ(
zq{Yg<2HLfkJm>~*`|0z901!zwKaN$+@|*(KT=hCevE-~W0`;i`X#C2$ST86F9+yQf
zQ&K!#_bA5Aot04?$2LBE1E0avg;|x1S*dHQJT%O-T88BZo9-7YBu>K$KCaGR>J$E>
z3G0<vHjK=h3G1uWw-*exlKPzk&^Sob9Anw@uIPbnK&=b;QY2ED&FND+8-=mos-Jxe
znJ&Iw0oR2JF>ZfvHx#tFU6*0?;Q%+c8vg2BRYG&VfDI3wE7GPm_Zzy44}L@v+DElG
zewh9`Yc)VZfm~-$!_d`@U6n<ior&AeU(ZHa2k-ZC;zofN);iM;{c{+0)X$i7lG5(O
z+wAv5@1FBCpKONZ?rYT)9PJc_*Z9qf!R^?>jka6v2M3vA$px_=w@6y{>jm_?I_Dcn
z$p+?o6I#Gu;8>^a+4rH)m$p&>HyQG!S<S^zgT(&$;oIchaj)-$O;_H(^JRG{Ll%3x
zN%=L;b;0}U@gc9JJ<AOZ^Lf#2kI=05f>gS6H+F_oi`j)Eo$B*qv?KI`x?UQ4<$qg@
z5l(8;oY-GlZK|X9e&V8`7A`^l8{OKHuRyC(ix?=8NG)6n$|^nHnW6Ims$aJihki0L
zx5()5!n^HQ@++pLhEhDKMKn}>9=oFK7i44&cn}5?TY9DrI<mELzBEL)9?{Cu#IZ>S
ztNHQlj2pT>(?J#F)W=?&vre;-w&BrSF{M;r*rmUP(qr_lO{Av(3b;OcczHF)ZQgm-
z5&h~tAYJtzufNx5qGl(h>hx47Y_>#ma0SyDo&H~ZAU<ywzJ$?3ikN84qy>uQC>Du|
zP+%)2lRxqU4Tp9`&-BSF;?(^gq1#%_+m-`PF;G(Z1p@k$3r>C=FQ-5rJ;kBjq}kXs
zkXD?*&&mo^QN^J;-+l(aO8HF|9#HSV6yVzAndGnqT9>3c^#7ecW@7!PzWN3pe|P`A
zNdK#4SorvHqK2X03OPvb#qmhos2lSbb6Dq9$zyN}?64W;l{*+*>v%_s95MYt&_F(&
z(`o#1V6U(o=xep|p(^Ow7w%Bv=qL7z@QWwNt|i)a;H|$wa=BwGx9(nVXzm31DwGnI
zo+~do8^(PDVzuo^s@K6~+6_z9P_WB-)a3reaKU1)ThD$3_&ZWtvP&8-T#rz9J=~Y^
z)a;&=XDmpdQ+3gx*{EKfd2XmH*&w}O?erFx<J`uuo>S-bUIieh_S*{Yg0!ZbrEp6x
zX4EK*Qkl!@Z?|kFK=3eODLF0D;X^4MM?{64VolFF7@@8U)hDkC`LWUr1bZ~Xh;>I_
zXFXoUJ-K>#2UUg0<?)YJ&sn_sMr0}5>X@Upx!xDmFNX_miZhmyHc~aIWLBG)=^i*U
ztxxVe0ltH>*O{vAdtT2g8tW4*>s4wgu<CfOd8qUo*^w?qQ~F77%_roo?2&idf1^L$
z1MK=c4`F&A=l@ZVqDeQ6d#sz+!o>BnNI@R~Qzk=LX2ydJt@Jz=A{HcT@pEuBt<Tud
zh}#CT*=`Q@Xl~)kg+nRl*@8v<pD1lRL~S?yt-n6gy_T(ahSIyyLHDPOk35P$kBL`l
z7xH9^W0V7un`N)o&dg%o%o8_Su2-gB>F!-Z=&~aZO+UA>H@jW!zSFh-FNs)O^$HNm
z+*;iK)p~trFO=NZwFe<`n4&@JrhGz>3|Yhknui@ZB6_ifqBI~=H>9Tz<>WhNq#UIf
zo)hr71oA}mE(XzD6B`J!5n5C5`M9_~Mz9c)F%Cv7?`PPyj-kVee^hs9Kc+5dHnb5S
zwF~)eO=qee1MZEbiRqrr^Lz2nFNivF8+i+3d@DoA99U~b;^;z7yJ$*%k=3Lvf-{H7
z8RSxgblE}4233Zyyd^3Ufo$!ZSyM@fazn1}!MKjoti2iJCz|K**I9nyp5lAZpXxD8
z?fLT0GG`B3LpF#YJI9xk7r9smKmOSAX*lZ0IZgRk%>x%2xPRl+n|_!~5>Q{c82?It
zUeE09(kYzpdBHe)i}MJV#9Jn<&?c**n9dg-IMORcId2Y-ya1-mQ`^{R(F7TE-jTCC
zRO*}2Ng6h5R~-_xu#*~{_kG4jnr5je9w?Zu<k*m`@@usY@4!m(8q!mgLqvN2t-N)w
zj?8g<1Hh>+b0%PRz2aCBhW!{efD{0>@Sz@#?jcfu3iwM+@0sg{dJjO}g<(jS-Q!RZ
zK-?4c43(1ED@!6z6p}baw%pyk;H#E4-AAXO5b)yF3)pRUNom2DJTNXHo1EYed-W;q
z7XbA^fV=ZQ*>&f3d>DOyJ<h8j0EbdA)z3Ta{RWdTS|Y0)Dos&&K;s(RL`#ke*2p$T
zo`jYQNj?H8Sgu}-+HwYKD~Dc!9Sd>sVmf_WvIds?LjqvN4U6|m&2?8+z5H=q6W0+M
z52?UZ)#Uo#@G+JC&JOVReS+@PuWpw3;h5?vI)I&4IQo{rso>Lyv$Ug5-;#HVMbWib
z@J+!8e}s3sPXDFpnl_v|Ls(!<s@Jx{zl%}?!M%;iYiiy-t+WNF`v0-r54wP{x*hCB
zNldY>O6xoZifIny2#;bgg^WpdXW0OCxNR95wEkYm`2Aon%<PTmj3r!wnKt>O+lyL%
z=>Cj6eO6)VKb)RkzA;*Ex9*9w!4<<)JYVTTm=ftLAFsL8;<5s$Uq$;{8~oZNeH?)E
z$b;a_QDuH(>wxS2UH(&B@5>)8Sw^h~tiSeGWP=--g=bzHHtoPr+lN9R`wk&ltOxX|
zqYpRB5(#;$Uvd_9@HA0dW$qoGaSQi5rt9cZ{6nqc-XShgPi*Hcg1z)nfzWp?q|c(M
zcJlsNjq=AE*O-<&^D0IV&8HH}3bI{ZFStK~)+Pfa7-ebrk3kg_POm>hr>~@kM`^}D
z8+P{+Y<lV+{_U^PfIOrg7S?OA1(izmCY=dcx0i4!!5ek<Oa8dcK#hGhy%{x`*@VY*
z0<6cY|DMMMW?{B$T>w!3sb7Gh)tiN{{9StIFUGDf?Kv*M{GNN1PI)e@O!7X&DDTv^
zU|G)eE=%{H1qmWwCUKg}-#l~AH*&{PqsF#W!t1SpcsPGO)3Pz3(H}Jl$*KlYXM5X^
zde0jRyDi;7yz$r>&s^eGl2m8p?yLx?e|U_mqc}%T9X^2GWZNJ2SR8x+UUlyEs;ki}
z$5Uw)AGmCi(AUE&8AL@|26}0i)TFvqsIZ_9gZ}L*U|KS}=~wW=fl)QcUr>FVoq;(E
zN~hcJBw(?XsF@v<{mm6WeU6eS_bNem`szMst_6GG`a_H#MdRtT?WzThYz+K7oM>{+
zgmF{cN2PT?UhVuhQ(ZE^2O;DQ*;>SA6FdF)=3#@jineGzW{!(J*UM^>s)G1TN*l_C
zFnJPNhpM+WPGc73dY!_4)c#QIzt^*3zHPE&S^Zg+^iDH%0<ClXfNL;HqGG05^6&B+
zF)ZJ!A6K~55NI>)#eYzJafMTD&2p#)F$$m$dCT&6YgHn^pX;vbi&b}q=y2jq!p-1=
zc;v3<Xz-j^+jI3yzvjsPSHoJG_D&{WERmOylMSG_UnC`DUytHJ0u#pz+CPsK`(14R
zRK2(A#z8s;ib*w`CXalG>P0{PCUeqQGba<!+J9X$#M~c|>|epmeTAD39}3Jj>FpQC
z)mQ_7ijdg-(Q6vo3{%Z{pS-hzSP<(THCF)j0e>Tdl~OsiH8j6gK2Ll|<L#2}A2-Vl
z3JX|Ad3PC=>RA;pEyX*p4Jrl0n&CW$a<4R2a*8qmRh)BnDf@L)*^pz_d|Hj((yx0{
zEA|O;%>kqShgHUmD9gUAoZT#>a~>TVqIPNdPSjxk;1gkY&A+`_cfd75j-D;L+Ub7f
zMG@<vz77{;L`8<Ru;ceie}1%en@noQn5JdMRowvW9a8~%-d!-)D;e&CgCiQ2<|Dw~
zE=WczK-5aEFTixcpUvjsLB@RF8#R?Af1}xww2u`|FPqvB!2U~^{r11+tQV&Md1&3K
zDd3B;%L4jX)}<cFI;eJnNuvp~152X)s@T7#v-ru+Jud-7l`GR0+ZjKjOLqQ#NnRER
zHa|t?8X1j{)Zc+hr*%7L^vaW@q4PaMHCKN341Ey;81eSQ?euDX$DfpFz%jWn^p&mV
zbBo%Zu*s2S$6rA8X*4nS0;eBJUo$q<h%E?>M!1~!Te!unMwmt}JzGZEXCHl$=y$Gh
zwa+#=gsH9uC)tL2NEC5j+_5ZigACa6S@bN}ON~riu_|JLyG(VDo)YzRIDlq8Tq|eO
zyR(cciDAnbf?MBh(cQRZvs1x2hZl6S_wkgJHx76H)PZ}#WAYbe_b1bB1j5QBej7b$
z{W~4S0gpRMoNEXCo(BDlj3-QbppFLVF2S9uAL;KosxfW20+Fj!OC^}^xEPXrXU;{l
z)qhfl7dYXOa4~hnZ`jYzF4DW>Qkaz}2oD#PbXtB<6l;o^vKyM<jZ>i?G9UZ;J~##V
z9&k?;9$nqTXT&GEf!)1>w!g3pM<yQ9aeN2^4{}#BBSDC_0K-#zpGV|wcT8sh^;fPp
z7IY{{c>$ia=HI4=YwFU}eNyvH0u|1amXdN-?G16u3#CJJ!~LZJyD$gWEBVHD!1&5(
z5J=8!{jt5+YfVD~y@*1A5gSEDX{~AGjY)B|YmIB(N6=sFwhM1cAToBdI5<sHHZBMV
zt807+_0<p7<(@t_gF;cBtN+&Xm$%Z`J7pBAR4XYU;Nv48oOBWITVYlDbN7nJ;x_@Z
z9%Vf3m-eTjmTid~jifBQ)`EGiZmSNBiDg(yg+D_>0;tk$!E)}P{%8*07EhZ45p+)>
zr%GI0D_s@R;l&=JEwH`h>D)29y$r|O3;n3Z{uaN6cYRXOmcgfN{w`7zm*ySsf^!L$
zQ%mOs2VyL;7IEAmmzrUq{pdfdMHtezJS^e_iqAY?TR}P&ZT$)PXdxHT+RWAGqimDS
zDcbv1|D&}THdssj-@pF9%RqNDPt^3$OA~&E_3@`s*qe7)zv$TY(}PUQz;SZ;=d0@@
zX{7hA4m7@<t#t7{6VFlsRZS764C=eGxi3UQWcu%{d8ld7v4sk?el%EpO<Q#s+>3^<
z6AP=U#3TRn@!;>gelg=;9c%<1Ek_5Y8oh8jZpSMgKed1M&p_i}Q|4FgV@G?fHl=e>
znw#NY)CHVyhc^y2%ZmgRhcwsz^ed+|VL#Bn5wtSo1+F~rKK>MW_|jM}Fl6n{-|*v=
zn*7YYG5p?Er#&I)hVAIM*$8T`LysRRxq=>mjR7(^>pN)=A?(NTYq7xu8PZkTrA}j{
zR^dzWYs?i9cb^hk!>kZ%TMV|e`?`NaA#18l4Etw?O8Ls)?|b%83h5mN7h^Xw+EX@q
zEZTjt(?z5@+wP7fdG3t!_Hye5@GsOm^#mDUZ%`(<UwMa%_CEdn64#z7Hp}^ZnC}1W
zXt{(~nC50G%yJ;{5UjL2u8=I~4agnJBmHm$&~%^&RC}Ct=~nzN9`OCJXV>ScMLoJO
zbBybC$)SMY*YxcE{pp`gr`EXpd%EukV6}qwkLGjYRgjgrfhQ_AQuzyuiUefyPB7;w
z$A9F1ql)UxUnb=SxO@zh=MGNA@!{Nx%zn3UyqRB#ElqeJF)}&tQHoCUFoOrrDtpCG
z%9Ts#L7T$s^?Hzev1>2NgSEb6^oG+BtaC;%|2H(PuV!#SzGF<L1h{-R9b`|e`Vtpl
z>AIOIu99k1L#n;+P*IYTAGa6G7;)@TL1O#Bn+e)w@kB;-9Kh}rUN)S0>lVa#JCqzC
z8=Md@)8v`DWj<sMdm1uJZlWDCwmER2ByN`?7szk3MO#q|IYs^)oPI#7hsobfbvXVY
z!yiq!s@UHw?=ox<4OT?YsEQgqCPlR@^uO1`Hp*4FkFdI8v$k~a?LlVHs*MJEWhpS5
z>=gXR*oJGlMPB4VA{+Uy^iI_^I^qJXpq`^a+g>L(FVl@cI0=kA03xQ)Ukq43UOTht
zRVE^Z_c|_p>1`<9C12J7v!#XXepRWLox`bjZLS@obI>%SS0B7wFnrt0RYg*`?~>nM
zWf#8Ehv~t8ND}FQ;OhuH=?}fV68+P8Hc;Awf}Z@(7i@D_WE(ggCERrE-Tf2;+hB5&
zQaSY~wWR^rX67Dh8TAl+0vTZ>%E{RDW;{BH86714SqR*pab{F+E2dd?XJ5sAoByD>
zJW<dqM;SjkWHFOagB4HHYNU)q;RQjH`^8xI8*(l<;#RZY-LDQ51^z|}+8`2ftiY`Z
zsWt2497kH@4nO2Lu<Qh>&z`A{th%Eqtv5AcxgKTh=!tpi+;ZH^(?|qUceo&t88^T3
zLp^nq<KS$dfFwU=iCDnsWKb5|px?>v+MS?GRRR4`aY5{6(Wj<L6S8{IR+i##GnSyN
zKc|-fht|HYC0$Pr2jdtUjt6`4srIx)U7zlv&hrABPLv%=QtoI_ga3gV%O_;S(#Cp(
zKxay=7rGLl0Kd>rMHeqHg?=u)5olJIvAIAA<#P_DXRdVJSiB2X%**O+)2n)Gc3pg1
zd}q8_zawaOuHPLia3OfT5P$aLo(fi)5ON=&_4u2;_}qHU#}{!MIdz!Mo^$v^k)X9d
zK7->hE9QWXn-DNF{;i4^Lb!7;qqvX>UBo|wk5(YKG!C%h*bsaF=s{YD@+%|UjZGzo
zq0JD?if6+m;5}ZlE9GTnOciZc%r+jTn_SyM3DWNLZ#-#-%Pc{T<8PGWDFHUj<%uro
z&l~(T=cvXl{3y-)VNfB~pY*j!mC2!o-0gOB8Eoc3gNpq@y_cyFcq@4Q4rFlX7ux6(
zv1&fAZI2nIGG}izvU9IM=Z}YR$`YqIsOVJ)*ju@<&!u+D)7Nwv<<0#eZ_$!={<?aN
z4!pNRH=utFri^f;_Em)g#!79iOWdlDwS<jodA`p?MB;PdJIg5fF}%b5Q`oxSO6&d4
zHvszPeNVvPHj^%Y>NNAH`cY45no9QgW?$JeL7qhAtWkQjfH5UaC{WgUK^j-Czlrsh
zo~?R>^~Kl27bmKQX%u4Kxj!p*aad+ah1oYUItsDR1vT37xf;N(IUn3yU=1(aUGRbI
zb>s07NMRcn@-R)};IZ-aAYSRW&Z72JF5j3n<Ja?VeETb{ZMQ5RcX~4l&jc$w#{cTK
zrzFBgX^1^*X@rC>(xul&TK;qLQAuz8cMoT+?U4B{n^Zr85Lu;L2_?CVEzoI4V0t|<
z^!?uGoh6q1+AARSqXY=Q?%%lYw-BU^w(lFAWlQ{lmB8L|-g-*XvNVoHzywU)pGOn`
z&X;V?aXI1o(7k7~TH_ghhBd_9_`Kcavj=1si6c?BGrhwVM(+mdfm10ZvnRGh`&W7S
ze8MuykW|+)FDpnlv|R@l_3aIq%CrXxe-Q%N^Qa-R=tt2jbGK(90Ig=LmLmk^@aWl>
z78&g53VyHNauZ<SiKuevDtx<Q^XUsy$V)<*KXX~vokcikU<dNH-L^MbU+}eP$8Mt+
zd4|tm#{ii%d0H*BGyO~TXh=t9)y*1}-^5nOU+*#l2gM~D#j254!23!QlUkk;Nm}7G
zpS?H?)Rum11y{acUZJ8YmHO2oEBz8d#ADrlJ_j!SMYbtVS!zGMdOABjH}#)SfnZ#8
z$o++nb7Pz0M~qO2ACBFz!1$BdRUDKj-|&<1S*GRUJb{18J4y}uYz;Os=)7C0dzec%
zZ16Mll=LUt{%r8;M9RZwNTydhc^*BI-YJ}Skl2=+Mf%vhYTsr_aD$u_?cc&K?Y&=O
zKO{Qel9dF2v(9fegM&K9lDA=B6#8^G78@$(n|gKmGHX~RPH&IA6)$w+R>ShHbybFu
z_4t|oe7KaqxwiQIeW$IeWT=&)X`8$62PM`2v`Q&Nn<2qD_sQNP4ku_e^3a(74{xUb
zOZcZue){;+nUW+~Hck&C7jS=A`r=rT7v;sMBwbHstJ2VS3h2<f2Mn737y+)?vVif2
z@EJ4HrH6T|boXjOH_o~#c3?2KB1ye1l-)PuXa9xpO!Had-{hk|2FG6oUFo+|FMFGR
z50nQ_`hIjyTS9Qk#@jWcJ9~0(hnTEyJcMjUk=Jarg3X7iNmFf#EJsghsBMHF*ADTu
zvT>^oPq0hNS82j|#`MMuU!d<3>|SYxhVzJs<hXF+>mt#tkOL;I4LNdiDbcIUNbgZy
zjoJ5m{v4w`YY{(%DR)=~ppfqD_kth8co8RYO%xcaMfR=2YEA7}H%gUV_>eXH@9z9O
zJ)I7ldeoO^hkNiV_Yz|~+oD*XxOED5w;i!=Nsa1Swp@C)1?<qfj84T@<)}WO3e!=l
z2FV)RP;uLzud_JyJCpY_dOu5w=mX^6nwd2yv}UIJf)Gh0zDu1>c`%D5n59|MSvfsE
z;VH#~5`*w;09#q4$5FK_vHc=hC5t6qVyVgZ*8>#0jFSSC?kbLW`p?b@*iD{4cxsSa
zd-U?mufGa6xl%2fzp=LA=JtH3?p`l#M2>S`9Q6B+wW=oasfWt?OU}UPo<y)n`p%Qs
zhk56M2%CSkCCwa_KFx9ZvjY9T4(sw+>~Ql}p0Yra(iJl^0~HUrw<!F5r>_h}*n>$r
zLRBrfFrmwLkT=UNCM7)hD6L-Rh8{I*E_*Oa8gj5Vyr2~T+FCdXU7fUTY3d(3{Z(Yy
zi4{7L@dyy>77UVS);5WTNlh=g_RFgrW|1xg4sG-G1)Cn&<^C>20@>_!_XX=AE;U47
zHbdBV(39WlyB}r~Wq(qgb8so`1;@M?XfJfO#cIveEV1k&Z9FcdsYs5oE04jcpLSJ@
zTdGJv4`?H<&>s(O>w<r`5^Ecf#r5~v;bhU5Oc9>k+l61ApqI*igZJHvuIMuouF)$8
zw5W$k&xgZhI7f1?pAk+WI~jcgoU_?Bl+G5jqq9Su5Ax}Imh-J)dVY@Il#D8x?SQvc
z2v&on3%v&{R&{se?LHlKP;W92(dQk7ZjPV)_<tmwhd-6?|HqT0%t}aBDpd9e$E<`(
zXp(vCgJU1-7)J=nCVM4CWt_yZonvHg;@HPH9NV$Zah!wS{rUd>03HvQbKmE>-q-8(
zeEOk7y!Yp--QM(_eH&mNy&aHG=BG-z)Df{JssW<W1bZ<yotNX_X6#XT2W+k&JtDGA
z463%eouLK88A%tXAjFp0<k^dYswQo|q<}(fUzBs1ATUgs5)9ygdaBg4IKg?FJ!2sh
z@T`r+g8EWS##<%|F=I*FbNUr?Gwcvz9ap34{0OMF2@(-iJ0`{>`4uzPoFK}tv`SxW
z%f=L3s)Nh|)v*b}i#TU(c2TNSndYSh)n7>&zk<{(4Q&g*!hd&9L?BTcck;<z`Nif8
z$gDXiw}7>$*Ju~~hr=CI^Y)H!OzMeH<uwa9sTY-xIW>jdqoH^=%9HILR^{EBDeFEl
z0byS5hfXm{CCRcI!`YiPh8sa*HBx~t1Pw^x3ED2MlWK8rKJG5Szd#VaK<*Jc^#wfH
z4NAzpO9RdsXNwkDkJTnvw5zXy_GXzfe(DSChV`%gD0UU^V*;SSrv(6njqiNOjY-{m
zXL!%AV9K*U6Wb|wGNETc>#VceS=<t41KQ=HGq(Z~vAJ6zFFVA4??XLP7x~cq(*5@;
z#w0pt+7O%0y&pHmzcpXn*nHyb23SDf{4?qazm-JO?f^|;EY%#%yjad+6xk;NA~wXo
zKK#M+ujB(lf)*ut6yG!192LBY*u)+GSww~u?#PP?cdDFYhnKhBl)IG5v(bE7u8g!J
zM5>MHs}Y{i5M*fH#6;Ls?RGXpq-@s+9^rC;eiQ&1)hdCF?)+SpWeUjHIA4aZ9Sm~#
zr#vU0X2rjNuN{kQoFk}8a8LCdp>k?B<1CgB*>#L&kvacLBDUYwtVSU-BLiC?lhd5}
z14TT4(X#9rG>@0OUr(>Kc|O9BcugsvjlG4Hm`@tJ4I*^i4VpAvd+C2PRjLktR7oO#
z#1&i?MQgTYZVVZ_7jXG!Y?zs@OGPbttzt7fIvV&&LRR7;BA-i?rnL3aldemEif6X~
zbs1X=z~jOE9s9R=aw?OcJ;0IN6li(&b9iO>fScZ2x60)}4#)IpnNUauFT;8i)d3Rn
z<`qXDn!^i)X1vj=+uZ-+5X#K9^bP4VoBv}g%bUslj^Z`R{#~|)Cx0-cTt*)eQ#9!2
z!vPs~p2n``nL)NJ`L45xd(hG}&B*CmO@Xf7bL_Qh#I>aRBR`{fq_4jv4tLt-*+%zS
zNxdRYEh0y?^HxZv^U3-rf>6wo-B-rJ<@$~X8u@?Nj1{>K`UCTR|9JcFSXl%8Y&sJz
zZ`zD7oyE4$VekynHgR~>N)jp!Fy&E}K*||(<5=aqcwbZ2D$j-BtEzZ=%-II{^aj!L
zWkN+<R-wIkoN3mE%2$hz7}CPFbTDV1Vav0`W7PiJhP@e!Zmx|HTY=r`W1GL4smCbk
zJYVdw>Pm5!Z;8S7>UZujE0;G!Hg6mbnGrZFdSZhEo*3weU@qp+tgAMaHYrI9B$iyC
zjbsY6H0bV^thTyzp~a|0TmYCLkKK{Py?HtshogOPh8s8c=VgO+wcU!4C;RJ9oH!Bv
z%TWliLY1up?(<wUU`*n8`ba5+InFec=UGQb43dA@V4qh`Jp{|<$4}qqoness@7J1I
z@jm?S3?DJ_Fg`@Ykfdp$j;m%@+kNK5*-(|`)*|4a(3RV3v_zX+rkQNT2NwAMNhN@^
zB!wa1$`GX5(Y6Umw*a~DFkCb$sX-(kIofmzg{gFW(C`q!eMI|&VD*oVv&XRK4}cqX
z^*$0rnK9`8Je8?|w1F>jafReeN18P0CLbq6Q;hNrY{tsZnmvRy5LQ`eMtKJA2}#D+
z{Who5_Z^5=<MMg48TF1A3|u$w8VBEkOL=DPn9~K*a!Cza(p`viNEFT{SgE*jYaifh
zxPWl{d>L}DnWdQ|2DZCurZdM)B4K5Kmzf>TSz&VM$$?AZS`oC<u!RY{W5(@Y*uHdR
z0!@_6oeSq#JAZPAXu^4*RW_CK#7rgeFdl_gQmN(z`l1)AzKPyF0JxjCS@{>;EsE%b
zUR=q-d-{$UCvse%kIc#R4d9QkQ0cnth<Aa!GuHYk0~pzF?NRVlAA8Mc_<<krJ)BIt
z$Xq7r9rqh+bqIwx`3e@#C(4Gq*~xiY{nS&%X<)yutL3JgTDetq2E0K7*yM3h%s&4F
z*nNftApwu)R?j1l9*HULCQv69r@Ug2&gY{z-43B*1EVj;B_4<gcJB!wTpCxTmqh#H
z^+>~PI5q#`oQs89|G~~J6~4}!+8GuTXIK#u14t$gFW*63LH`pyrIX2Yoiw6dA@Sw&
zdGTek8o(MacF=p~^Q{#ru_4Dg-YiV!R{Ilap)2s5IC7I-UUUiFZ*e_aa52ZepkVLf
z{r8K=#v_&PoIH_od%ni8AKN2c=oxBs^h2c&73qW*a>oaPPLHJ44xuyYQ~|vr{n_~3
z&(u$<4617vtKLQNU!Dha0bQ@hQ3KtBVeGf?+8}?IeI_2Mq%pDoO_2XfG+RVjs<4qU
z<AzRf4m;H3D#J~t_BK-Bz66nMS|Ah9VPrw))<5Xzx}U%<{iK<;!?OCFhv0Xis3{;N
zV_(?qal!V~E^@T~Qf~iE!zmN)V?N5BhhQ?yOWHJOKiPDzTi(wu-*KX7k5|gSbGKJJ
znHx7^++R0_L`PL>Bnk9N`&qJL6y_NIHX#G=5U!Pf3YMUCs50^G#->fQS2y7dwr(}b
z@0YB3ZWSz}rgfH99yap#&*JtIhQ6M!K>esL&h{SV5X{+Cm)a3*ose>8a_{~`JD3Ul
zk%8^MZ7}D1WiFz7ZcX6?^$@3Mk`3K#+{v}HP-!xWzvv6aqTFVWf^kU#yN{?o<YDW4
zw}t&G72?ig6<N`PszBKoU#ms1DUE%Um7}v^j2Psw19i(@FO^apaI4wl|A!iWePNaB
zh3~b!NqdW)EZU;j&X|Oy&y{`<Q~X^E`%rk3;KZDm{N7})Uvwho6JL(ub7`a+C-^u9
zsS(5i_zk%EA|Kv}u(;dA@*g1P`{wR6=Wuu9nODQ|8S%$7vbfS*q@w&$OY}M4@l};i
zw8{58A&Sz2!Amv{%j+9ZxzDH9+((9PY;I;V=sczv?lbA3L4?Ln06n@1sY@hWpAY^%
zgazt6eur+l0ip^&N5p<3ITg)kDWwAKKZAC#=QCg12ZHKIf&GnyAY5mS>criQZdGW%
zG4X0A^AlOguClC|pFtDYPbptB%}TC{N>z+wWy5#?77R%`uB_@6dN+dL4;DD^L~Cw9
zi^dbBPoi<<DhEz+VtdXKm7jVa=k!)|*Q~8v<Zz89D`iu)az@&iL^R*-IcQ25{Zxju
zTvx)r`;FzB@hL}2cz&!-H>Wp<*qd(EbQKH;_mGj`4|XX>wzbL{7AZUo-d@RYnx$oz
zmS{Lqaxz-3O0l|x)Tk39jux}qR2jj`H+up`PeQHCx{+$Ar}DDTCdX(!ep{j-4Tn3?
zwQl*1%tay)aQ$F5IwNEI`3KU#G+Aqc2M^c{WQe*SSdDj2<55>OYVKW0H#NBY#^nad
zKhQk-SY4^r-CS)H3{_P*Ps<Khm-aUpeVrPyoqLE{85$DnxZWr~q?v&*gId@JJ*wSJ
zuy8OllFb{j)KTb{{{4!tU3&rB?dz8L@MfChCV;dNo%y$32Ja20I1mKpzq@qr_Za;+
zP4HfBMQ*NTEviAn!tnbc!m4<43lZ`)>s3>%uv(<^jfzj*W-8BnK7*&IdZH^{0FK(^
zAXG|k@|L+=KSD~tQ>Kj(PS(7vjN6WFbT8Vzjjd<NP3(HI1YLJNI37*4zu#s1K?alA
zjU_<^3R^Ev<Pd-)|L#}*pabWFIHv=I8FSo)qrd6I?Y1^|1b7MSnmrRg8(#tOfH!YE
zqnRAd=-d)Lj?+!u#}2>TJ$|#D&WIKMw7grxMa#b7E87<LIM1E*h&D-Q3TlgSK;};2
zq17Vo;&OBO*>O8F241~f`*R*#=HI`Ap!tNk){hSl7FTKI;_5LuQLI4DT+1l*sA&Vh
zBcW7vT)v$!T)G*>PeW2s8zNI@UFo(T--US+O&|)74S&9c*xmJI*hkGt&suO14`)C2
z;!ygH1B>%XA#M<^1B;&knu~Ed^fpp;=+!-cayVL{6!tM*U|FWA^z$s8Mb^{fM@H&9
zF)wyG*S;b*RXh_KyUg_GxVii!rt2>pDdeWU+WygxRGY4^1f=WN>E|s>8Ikur6P@!W
z7T4RgC6mMmZ2_3UTfBVkeki7~H*=`os@Mq<qwm}M(cyx!$2(uO>PR|vrQWR`VFkRK
zx`o-?>NgL2jTZSgpw4z+MTDatn_;Ef(J9p?1l#|VD@zfRaP(aj*iQ8E$!QaK7O+D5
zac7a<l_4h%jSi5%5>^t_lL+gOdQ)%1pG22ra8?9*ali8U7XPb0I;1yIDAM#2;dC~o
z)~%0pS!S$7<w{9c%F%tSufDOQlm0xorrMK41ID(S8)7VKz0!7I-k``+&$IK~lUh_F
z9#F{feh9hY|9ujgH4gwwzJE}B{K9*MLHzQ=%2`SSct9DrLRYQ({bw-q>c$dKQ&2Pb
zvZ^`-+yY7jqMsHmU9CWdQmX)6VM&SIvbY+%T<0sMMp7@!Wamwn!;&P(es)-Olfdm<
z4~D(QPONKdPT2Bs%L?n3;hMW@2AzGP(U)6K9uB0|xn5KH{b2m=Z2@<0s>}ramzVq2
z3KwahN62tauu4e=Kf;80T=gq^Ex&o0TijqzHEZ&{!DYbMTA@)?+ghV$S@dJ$byM0{
z=iZK5+<P6NeUm;PE4v~3lcTdIs!)p~=Jmt8!xbr(S-=nBs=&@a@d&BsPgx3-$c`DB
znYWg>L1_#`y4Y4L^Kk7~zQ0^F>9#BdgXY?@e6Z*-_ZsY*Q(HE9*#BY$6&+V`x)y((
z+jURERJ?1gJE*gv*yX6PL*w!x-3N<+U7sYiW97}R<O-sVK+XbcWy-L*kWHSc8M(QC
zuSLt>t#`dM=p_4~Z-U2G@xou}{bww40?|N*Du^MtDC_a2q?mw^s=N5=`f>RhIxkx7
zzXZvJYK_Ik@^PCn8Yi8g+{(048Z3A;yW%K=-n0-Xsb+}QVX7Ki3#cqRg}ll!nUQ=K
zdpHLgI$vHpc?%e<Hw1i#!?=kuvClJ}A!8YEAGY>1WUs&V-?UYr_%h~aMzXvP{BmCl
zEM;R<Tz!msDxx4oXvj=6B>!y-#F-mUO#nxmcEQF9(C6P+FC|=J5F2{aK8Mjlwj(+}
z)-?sslB}*-!=Rt~3J+ba{`6$OgF9ycgd_=J%c^Q^nKhcEeH?Fsc^L(WA&l82TV7jI
zyD0j?VdLCV0t;mIu3$W;ZS^E$SWzL#a~1y$70}<j2uu`>v1KQBj-VaQa*;gA<iRob
zxNw6I@?r)}@Fvo-4~&P3^89?5nk1Q!P_D^EnOsH+tmQ&?zeb=Xj-XjqF?p+0j=Gfj
zhp$#q@%<`aWM`)D$nz6?KSTzO#!xD$v~HdgViyLOGnj>2-HC9$E0xziaoTP<$Y;cG
zk=%Dp=z+Y4H8>BqJ=#?^2p;cB-aEY>CFvz7OD&lA*H2%GcLoMi!qFkv+jVPKwtkA3
zRjcnbtt?eDrf%?$)XLkd_IWikuRI+1DWZ0hm{?!?Ibhc5PA4v!G6{c2|0N^yAc)8^
zk5$MUsR?jSxi30IK16}XvmmD6?%AsdmzkM&E-mjRr*~2^0(JIE|5oVve#4I9C%BZ0
zNYstijE_$%Xp@M|aF9xL?R^q4Ea(D;bR)7C0F&*1;JtH*awq5rbr{XP5>fv{go-wf
zr5Mlj7|Rn8sN>1}M}mUcf`REa3>gpRu}S<0%&<;><Lx6T73JpGa^f(%{f>RS3>c!J
zSAJ{_sR`gqDvyH9)l4IDA=7wuTTjE&gBjpYf3H}rO!l<(($PauFJ{#teqT3{Gf<|O
zje$(%-Y)Ck1BG9~3up=M;)oeYT)o0Aj1OlXwEA>Bg3w)k-p>Po>|X|EYc7snQdBo_
z!K@&&zYiYN(=|tm4>ZG{JE2-IW6p=x2I7Z!wU5k82#M?NiS;T*?;bjT{i9DOq2XT}
zZZAf`enM;t7@clv1?EYgygkfesa(Yy(&zn=OGXjJ2-(+SEhx&0l?<Vgfi*f6cG~re
zL1muDh?ijxryLPp2BfrfgRDc>)t77qhTJm+b2s#^#flEnUpSp?2km^8DzZOT3qosd
z`%=};4=|satUulq@`xX}O~tmn_WMQVRK=r+*G~Uc;gVlsa4&W@6is9+#r_Gft9@ef
zrvnOz(LuV;T_q;QyG(jh3WV2VL7H1K8CEalxVc<J(Kq{0lkY=r00Td2^xnymlJdul
zbL<mAL&lr0AlI8uU(Os+gRI2r5y2K+-m$^Qkz2o`{}I3uJN9wbrh+*RURs!{DY26t
zLQ$tm(z-QnalnZ2{8_nIul}ThZsz&tA0u!TkpNut;-|lWI}U>{2wFK6G#!u9rRR7;
zpcgrpyf5_gNGMi4R|~8=dx>R*j^01DS0grP^J*@X90*b0nYg6}hz|Z(#z_775f*?v
z$8B~9%~I1?N!T1QR)cZv1=O&+({Hl!3B$JQ_h9{e92WL(?58q}Gwa|>9F1Kft?#5r
zfyz`9=;N&#SHYRiMPodn$!8NE97RK>j{ANLa)BLlmMu+3i){U(pcJ!XYD?iy0t+Uv
zOs;yOVu$94%9cI8<HH$@pI+3g`O9G0`9YW9AfuF@8NJBHA@7naQb+RT$Q+=giL+Qf
z2CU{x>o6iulAX*@wtdZB3z%8w_^VB&TuRL{M+P~ZjYn{NUxPK*%D|TUt{E<w<D-wA
zhv=(=b0;Pc2F2Z=>OC3Aa&0GF5s9Bwo3COsX`IJt+z7pzICS(S0~ckSIgT}y|9s$(
zd8-7h=l4y%SMJ07+Z`-dB`wOhv>&Z7*UzY2+|x)pmB`K@+%%wLJrtq0O4IoNmMD<b
zf5zgm0KDFxBq%;{F07Z-ePlkhXJaT`^P9mUix}~!A^&HEB0^J2!`2@RWRvEH>-O{=
zf^jPV4N@$!En_6&DEr7#G^N|eJGZ>)+q{iz{o>EhRzxG_28B+W*conh1Z$b1=64dA
zKSw^@3bLh?y^W#<&;(##ULucY2kiZFjD~SxFaN$dxkPr@m==4xoiUT46&54By)lnV
z7HSUeh$44*TeQ2~S%nchMclTW@3P=(b=HnsOfxbIrh#tEwBP1CQ))u_-`Bv&GKV6Q
zLcI|T-v8Qt7q-StL3Nu5AO#+vSG60tE$Sh7h{|>8GS`x>9~_559l4QZ1`e`-Jj7pn
z9<_3I@a93N;O2C}F7)Tn@sj9~0oRj!q>IB5qw=SAv#Fd$J_>3#ox#YDQdlInmycv<
z)nF%~n^h~b5od#3d@76FtJvV&#se2lEgIrFk!4+jpROKFYO%i%K33o}hd>xCRO<X3
z$?#)<?0bvR>c+?AKbPH~+)_UM8v`AJ*5gB8p51%ceB*%P!%@J|mrcj!#pLzlJlSP$
z>e-5n_qY)o$wB|RpjOwk)f{wZk29}8bU*|z6iHR7(I|6x?9|iy2RThGPIR0QscZX3
znY_afISM3AO;>DF(c>LV>=nu8m7<3_{B`TN-0n1h=Mz9c)#>Dzr#BBPgL&sbL;lNp
zAM4+W@LD_yHo%N7XJ@9ksf5WjV`qKEM_Jgu$S&WIxPH|AIz46W5UEwM6!<;{tG9*Z
zr!M~*#6kS4KVV3a*v;wQjt^M9KPS1)8oxV2F+REu6k%3=kLUnmlhY!l5pz<A1NEWZ
zcom}{rPk&f$fXTkGF(C~GqX5kv%cU%T#wi)85fzC(S{c7Ik-`=-s*cL!?=O0V$4M{
zeGAij)@zNEl3Am(m+kL2_Gr~mph<6L_-a6E$sy{$Bl>^sX$m*n<yIV_ky|&!H@ATx
z__!fUtF*f?g*V`|?P&0w&OU=f&HGEY<D7MGN;Ud*a*P-k|J$~5<EpGnnXJm6QJ$5e
zlOQS*I$P60zUwO8?8dOK(@^L-qSWWy@#I6b>nDo|7-VyT5<-IRE>%kNYwKB=YgY(Y
zJ>)KPofLDpz4C|6|6Q=qwaBT}i2GHyP0jV0o(g^16uLfAjoFsBZl>I&W=)I_o}XPC
z$G&q{-ML)*cV$$yHn{-EQ_RZlHcaeCR_&P`3UQae9t$^O+Iv3J$+3X_N^fdyHy<)s
zy|c9xnGHp?-T}S&mn!fWSw1;Z&%33`3a_~aMUfbp&m9jARaO0~LbqRM7wo=p4B*y_
z_RRM3C~wPu26$LUK{{vil|iu1R!ZbrvhORKuLNEMyYu5VZlBkRR<3tGqB6_fbir9H
zD^*36b-g!OMY#};$;K>!caYI09kR1QB&g1WyWlHE5-72AuRTf&cMnsriv{j?_KZkS
zjcU<!Ng)9SLX_)<<^<9uI`9;@qFs7&;lC)pZFw?qH8^r*e)No>c@Q15xUD$0J$Hn+
z+NBk0S#hR+qbNd~i7n}meRi-*SW%N1>oPWUn|F18y|nt*3L;sRztz<K))|7pOs?|k
z8xma7hAR|%9)9(1TqkfER9)9V)z~CW)O70qv^<=lYy|{)GJ9#pHM?3*Cn(wnE=Z?I
z@#G%xd_NLsr?Lm^Ex8e^$gxG{YbQw5!hIvr2?FEMraQ@DA4R{_9m+TYBsL5&?XPd4
zM%Of;->M=H__r?&G=2)G24v39)!?k}d6LTIqh$)hRF=<<JOr!2%hY3M7b98HFoHr-
zPOGIcId?m~O>O5}%;yn#qpL=h)!<FbvW0M^R=AF*AlJJG55>;n6m$3=9GT1<p51sn
z@v&_+&9BovQj;fbcn-APi5Q5xtEXYiDylOFmDnQRl?qatYoQGPY&%BxMEfT##l{^-
z9|3O^NnphqsF*-8h-e3UEwh|BUj3UizfGBaV_ysKj+gkaj}>Yp`!xISe{-9&6;JkU
z0_fh{6Fn@S1;KD9-7>K=BhY8mMo|%1xT&tfijA^=Va!tmuFV?iFg<5_pK#h@5R&`o
zcSq)_JBuXh#oUG9EsZ}|`L=WS7jlm$Ll{TdHnEby+8(tmIo{VZAFS#PzTcjwNm6jF
zKHs%-4_%~+*uTIf8qRoV{VI--nZ2xmzry=6MycGs8*Ug--oTrCn~2~~C3lt9dA<(`
zmVf?YnQ4CC3G0{FQO};RJMpJ~Q4QHADRKTdfWq~8B+c|w0DMeP!#+YgPzLD|?(==H
ztSMWq1d`uzd%$?I>%vibpVE}Bnc};hhQ(WHyxP-p$hKr7)lbjSQ++=ZGq7V1<GSMN
z8uojBQqr+bCx?T$3dlRhzvpO^T!&@OJEbR<MYf&naJQ{TJ6dhaGFwy$jJzk<i5%f;
zt4wY@MBzE&)f{Qcg(LA1V3omL166ndF_uXbJ+5+hAMe1~CMRA5LACAB+<nTPvV;QJ
z%cQ8sOTekMXs$YEw_wWR{pB|ovVxk@UQ3<n8-QP@I&o_d9_ZwoecOd47Q%WCtBnJ8
z3gD8rU{zIRd<N}FkuuX(K>Qr{PqfIGaH-J~8h1!&(!(9F|3uDBYjq(T=SI)_4v9PM
z_5hK2#|0BcHOF0j@#i6k&3@yl&dj?cWFyFChCJEuc@Jj8lplDFF<u*7Ouf{I3)M6}
z4(K1~wYzrRTJ_TBTMTg-ILh;Z@*msG4GAn%+s2rUy{<9DjMd=2=yXc*(QKza4`F8-
z_WAUqHb3|sV^~zF#H4)#Hq+_3=9Fqctkg#0bSW$Ngz4a04(O|x5&ulr<MB3(MojtG
z5qchzNylbc3II5dv3WF*A=v3Xhw~G@+qZNYZys*#oIX>19lUNAafEUskjk^C9OsHd
z1a}z#eQ2B@HSqErh*90tJ;5_svguvG5_VSL;YhUyer_mPVarfR!?wY%NwhGTILM#`
z<HH??RlptsX&kGS6zS#HTfyae+<yAWIc1Z~ey_e*>ZTq%9(=Tz;VPh%`&n*iUh8xv
zOsIo)0Hr97^~2h`#B#Sk86Ul+!~z#kE`4EjKKlmN&Dg4@$E#EAk?)531<O}D{&sL^
zv{v|j@+352?P>391pb8CFsVoDh-3Wg8UnHHSO0ht@SWQkLCmSCYW8eQr<;9P<=ly_
ztPzjp<odyadW*IR6}~`;qs{AeAUnZ=vZc*0zQQ3k_q<D+v0q0^K@IEHRba#Zdz7Fm
zvDB*cl!>An(?cuJ(tnEHCYvpj)OvJfqWY??+_F$)HB@H+lI!J$U2;_0iz2c`sO0+y
zKFYDrLYluWfav%8&%YiMY*F{m4)7z-qK9rt4fID5nvNBen21P2U;*4RwYFO9{pM=k
zM@>EjGoOrNcAb>0+p-_HgX$fvvo5Cp;H0ta{B~>5)W_Mp@_avtHEHaBR6=j@ulRSo
zFc|fOVIX#RCE)qlc$!%xV23+X9dhY>DEMp)EBQ43{uMuQ;gmm{j4vK<v7it7mt!sn
z7_4DGTDRQAh^;qzxSlQ`V+;2UD{5Z$u9z&{Y=$S0a{c4k7V85u4yKt8pj_Ns7Nt9-
zTnedGV<&TkMqFDraps+>^?&1GWIO$kZ9F^Qx2+Zxd|QXO{v3^c;26aP7!@<8?pZM6
z5>iY)VtkrK4)D!~O|KOM?Id);57y#Cj1)V2ElQbB0WoNl`qga5nIZkpDuu7NGuEZk
zQ&T+dO2ehFv<+_Y=zp2cBkWptprvG$_sN%i^-o5M?luCSzFpQ@Mb*DqaL{VTonV($
z6#iCG(Q~W9*{frVDm?BZ$r|OaM?lY4k<cNmp~i;@jh%Yrr8Osa%mC$)3jgSkRp(11
zC;dQAtBg$=FZY;=|K>u!JOoaF3#L@i3wRd8J>{iU?IflD0Cp3wX~u;O?pzjJ{BC`x
z%EM||FEP#P>$(%jZpuU4EWYk-o_+V;K?9Xic2jXU7EWHLQV#)7;`j}q`{wn1*+z6W
zSSG<lgPwEY-Hlhj6dDf^v8wopv_B~wasvT!+$ShNPwS<<!(Y0a@mXyc42_0y;=0re
zb4}g*{^Hcm=LC10#W7RJ1E?mDJDu0{EK|qjaNiW5-f+&9cpRMBbRNu1Lgo0i5XwrF
zmvU+d+6Ssej1510a1qE@HMj9^UWR4a#bRivQB3am>$Y8JDIVJA$u_5LP?GHS=PFA=
z;3ldf_1*eDjj!apCHQdiVWIHshz2D;0>h;j8$cR6tXjMKnxv!wYMn5ecc?jISNI-7
z($dw&1UPopdCs<Chqu)O4sx|A-QjLO4kx>(^v(Q)-Qu6mp45&Niuxq{JeOCcx7{32
zrp2a2;fP4p=p0n}Tz~dt@<J}Ra&a7a{sqzKjimShAdJ!yT)*Vy$QoRlC_FaD+0V66
zk^D?)dmh?oFFlHUA#m4D0D$aRRTJ(LKOejxIpFVw>ZN-RDnjz7p*vVo9}POXF{HKK
z8df2v>v`>*^-4<2yX(NqCvaTVPDJjh3b*^j)$l}<9!kjrXlxl5xak9A?IPG-h<)ND
zzr0&<0$~)~V^BKaWShgii&2N1Gk={0<GLipe<f@-GY0*lU(<D#OwGOk>%6sRK{5@A
zoSW{6;q?UpH9B#uyU(|ZryMZbdF1yIyU$7%C-Gt)T%X_)#{Y~07U602Lj%}wOzO!d
z3D2E^%E>qg9SAvf8Zno%eJSc?sI0W@iv@4C$6H<#mY-9e+g{C<;1qmEUoTc}LBgK*
z2cd_K`FYe$a<RkMs}9TD6Ei%{!ZcLzqDp@JC>5=>%qwQD&A}cWU>zT*u$nS(fLZpM
z9n1!DCgbFGM^^F7o%(3_<^@93SIl-@KKZRo*^+ChhTi<?iv@983o&w$8k}pQSh&I>
zYanB45oB$Hm)S8b{V=A37m5#(;(NP~4J}=JR?>JfeAl_;#WXTu(BLE7#pMvHs1LOq
z%AJq+b~II?#MIaqTk_f0*cxD)wpCdH6?CzQ&rdR_Qe!vcW;xwI3DmuRf9;CqE<#!N
zguF2NHBs4bYBgIJ(T^?`o$zjH8vaQJ{13bDFyN-!@%LjY=I+j!%Xd+_mKBx%vqE}&
zg0#8vVmgYmRp?FywtoNa)#56X^Zol}HqTw)sFs6Y-+abz({$d8S~w!-A=)zN%5Y@j
zU---~UeDsSN)X$TNgsc~0vM+A1<4x7tPUmQxM3({y4jb0KIZ@UB2PJ2pvcX)M%5~P
z>n;U313qZA26<W+*dp95xOORE#qK?pM9H>tUG5qm>CJ--;a(RE?Hv<O?-iY95)+z7
zUa6`tMPE1h29zW=0>F%LJ&vGF*&21=n~}Jg#CXRf5twk&SxmWiU1<!sC)!Fe$Qm}4
z_|u@M{@E4_;!8|GbAeBEGX?zubyR@B>qeuQevK_r?^kxF9F{}y)poSOp0v-DP*ACA
z46lK1Wt}$HQ~)^;(=kJpRC=;I2>V@l$s(Fy35}0p3^;zZ4NNV$r~gYwSwvlv#sgcQ
z(GQA_QNJ9e-us}8tp~_d;}+PUP~@&<=WP#r(BUMvWCfWkcuqD<70;mu6IT4ybe{*_
z>03CqBxEtJFtC;rZMjTE<c=zqdan}-i`7~vX8SyBKI-x}8Qd!F%Oyqzmeor`=gsT)
z!3Ed&wDu{*X@3$oA-%=sL8AMv<-VQ8ru;10ftv;7tF-9pI~^RnhtQ!LsDjYDPqum6
zeLrJ-yv2o&M!zMi6@}<T9-4SkDlT$_)63Degn}h9p7oxo9yo<=yU(J2s%v`R{MZUP
z?@pThHsHSb75>~$j22h{AOp#2D!tLOx1maqyQ0K#dG?F#iYzXWk4TBh>OGAadS3z3
z67!t^Ql#o%Hj>gxHPcBvVOqI@KPO-iOic}cH~9TNW8QnDaQt@S{BGx0h05O#gC*+U
z_R--yE}Y8dQirN(QMTNAG(-K9$Kq&GVl}Hkj(M#*n<OK6s;Pil2fH`pot8}PFc!?t
zG5-&K@d0_R>gn8nYcGK-Nqxq1AYt(2;l=S>3{2t>L~fo!EXo;^2PI}M8rOuRiA`k9
ztXefeUkjY>PeDDol&Rt9)Bq}LkGNCeR&RpnUci#NbA0So!HQvk(g*q#G<BTUPzaQD
zWPWBGR!6En$bqvRO~#Rcpn}=m0$Zh11;5ft({Q&p5W{tcYT)s?d+N|1mB##`XZ-?k
zvL*N{6Kn3SYz_|#qVpob%2{GKylB{)*JS1a01PwSi}$6?<J8MW^<qEo#OVe}1Q=-i
z+Y#OFe@^!wqr*0ubHW;V?x+JbXetAcB<86X`%o~%Q?RaKV3%oxT%9jOf(EMsn@GZI
zhod84KvX{kXT#ef+uXz=0Dg}x%Pb;GO!ss31C97UyG<eo*sBA_6jQx@6sH3bUrv|S
z+pNXWkZQ7p^}g|<0$;W*fPIBdsj=;4ZocEM1YMd><liH93iOOqAA{@1sS)<&^KB#Q
z{&=bG{-*yRk0D~0`I3I0T5CDM;v7cnm>V2~LQks)@}M%9j`d~!^oeg0<1a4+yR55{
z|A_p?8}}Ifmrim1kY>+i&1x@g4Q8eq%4SuXOlADDMg*rP&cJ;K#m@P2%p>{n3i0&%
zb5_Sr?h(sq!yLH}BE$i;JR+8hdS|d%o@8iu8~a`AxS-J$;wd<RP1OS{)d>%N1csS;
z18JS!#iZP^6?Fv?Q#j%R*Uj4d1;VFB!HaBpK=%Ck2YlW6+PZ8PPwy<AFI{kXAba%`
z+W)b&m^aYCK~eG7G(1oY<F4y80Yr_=ns2oQ+?g+Pz~PoXZPz4VwKqEUe%a*-p$jQN
zr=EOH%51@7Uy*iF&&oc=t?D3N-3uNI4UWf_j`*gpCm(h*u*180Y}0C`#|v;D*?1&*
zCbD+TT$$0#;TW#iDczKc0w3M`t~W7NUpKwjc7kCb$NKGWNQ?ZY0V}EN`(KklH-9VC
z#*=>J>7E|WZ8*ErpR>9XD4dUK0?M^^-Q?7ozBKdq*WQ>Moge@O4m!%H{)gt8OzeLX
zx@Sg`0xX0NZ&jM0x59llU?}3rwHdhNu6~t)UURX;{M2YR`A+Uxa!0J)ELt*6G`oV_
z3+oiPR<GXvIq!!|JR5N`nQ!3{GT|`G%ch-MDEN8c<D>}%-(p8%!mSjelbZVAvQNl(
zn0Aqus4b%#`-e;MNFHDEC5x$nNb;o6wkdru3(-VA*Y_(#C-16h-hSN}2hx1A$XRBw
z!C;BDF=3;BBBaV_q#S^u^2z@VKXsCkDw(Hg0u`K&$tFSGqsi7eu5-Y%#qRQH{g&(J
zA)6#{aj)F&veSE0R(d4sF0`XvCA30%DHxZ1vTln2+q%Aha%WTQdj&KpC{~P)^l$a%
zk!-30qVv!iUwecJlsT(`|C{XVDrxL}ATlyR-HTUcIs_Sg2Lc6V)i!FfyqHxLmbfQh
zkd3lklG*WawuVV0n&b^UVN4b-EwT5|$gF|=<_VrTg-b1f8*%P{KkYQQq%^eSrGZP;
z@tG@KbP)&rC+cHivtC<<DZWWV*U|H8oc^0H$vSF&9Kx-$-PKnBVdn`c+UDvid@myA
z{s#-*D6R*yPpSI0hn#QxH`OVkqQU>VFzW%3IQSmTwsbQ`B>!2mp9&Xwa%lE-dYJni
zeyJKFw*4`E0I0g2bRR9{*SS#5z3s^edesVNbP(_?&1X4${#9dg_29DqW>>D95f0iV
zq;Pb#vfX7M;~!q8LoiU(NkF!dAzBSG1l^Q=5ROrpfSnJJFHw%}0e;)B+5Ns+mJ4gY
zXiL>L_eB$~-`Ea(pVI%XFTAflZMTKnvM&)W@8!EIn|C{@ZxD8(Lo>{g(2i@S3+NkS
z3Ae~{51RAFKl4A!N{XBW>xu--F$~y`sjOdaB(1I;uI2<P9dMsa_A_V{WDK+pFr4y<
zp)uYKhbnPn?^xNR=Y-hhSCa*1ik&!$4IXYHIeR6Kk+{c3gdAxd^xJX)jO&gd06g*p
z;t7wDA0AwQokn{XR^<*WjEHkvhK7}YI}Wm7p1v25o@U`CBen4?h}~ixe?PI+Qw}8{
z5VPAbclV3U{bdkcyumz<ooM174(i#<FfRRfYrET<_aBEJn<v4nJ7b(AmDk07_?%wD
zc9|R>wr-I3S{UL1Sh$Bm;FP;W*MY)~p;eWYnF=I7z23%W1h+Ta?7LF`Vq=qMOTjTX
zWtu7MbcML{I=#Ds5xFG!xR|%!<k?p1orY8pe1NC7fha8J7*CDwaE_D{g!1|I`cs5D
zR3s<V=aS&920{VF4k3jslBZm27lEJ7O;6#m4Rgz!gRRY>_$4uo_<l0|_7g^AqoLIy
zg^g!|OUPlSfm5(T_NVfF_~P^Q-@utr$u*)7BWUNU<mb|N$TfZTkNNivOHmBK9j+{a
zon`efYw_)5Mt-;dw11WSUS;~Tnux`E4mzy2qQh~6^pMF)A|P3>&-gp;WO+2mtoU`7
zG-GGR4=JTO@aG)!IAHBRAg}%o0f<KulONoC3Jh}^4!W3rJ#iiYSM+~mKg^B98=w)K
zK8Afi7!2l{V3+h^c?Pl&jt0X$1!Gn$$I(DI_<BQ!fMvvno<+NJN(*$}xS3;9h|SN#
zDIcllIHPc$Yay7G5S&de!KC}iCAbXnVJiQ!Q*MCsor5+p;tGo~bEsdO8v>fSilhIb
z6L#NTW#`F#t9Tf0+_f{UezUk@E-1K?F?XPLXR;^dX#aWmR8+21cD+PH)yEFSp&!XP
z)*H%Kf+Q*&3=cV4BCVAme7?_*;v+r6Au0XjmwpoIR?^t2#fxq#>kWGmh8j@=s+oVR
z9AuMdCVws$Y*J*#Yx9mtSd$GH$@d5MyyI{`uhR2~-O|ocyVKEmId2=Ov|+4k|LXnK
zoB+=q%WRWFo9-ewIlUO}%3kSu(L!aVi#ltt&+Xf}MmLB>Zx*b|1n<ltQSFf9!Az}M
z;EG&y9LLCa`_Dpnt5SB;Uv?00Z3tc?xA#3TbGQ=;)C~c`!X*cwZfN*(A;U%Rz=ux0
zPT`zNmAL?D9w3VM+}i}~n5%&RYO3v4Sa59N1|4DJ2?a+sh~E%V75xP0%=&*7vj!fl
zF*8GX)IfnQ&Tx#SWABQgW?0$^bbwAY7UFc<w|HdYmLHpUC}rh*WbmGKJhW6j5>y-#
zygyDW$jJ-?N|ZO<U{i-t$|(08l#yCtyf*R$m#?P^M6Gl*0|P!?Jl$3clt8)vkjkdB
zSlJIB#x6X4l-vKKB_YR+H^{}D9H+kX?5_KgzP|H9B;TB;`w}+fp>`BXXSH<jmal3|
z^W$Qa4v~*`bp;ktSrkWhX~B|gE%bRvS=^`{VEk-0_fAuey?aEa@;(4s=8_%?EgH_R
zuP@g*oIIBNRU%F+$<8dGO<vlT1hZ^)0!W+AAj@U17Ir=PHLDe?E9fej>YPkR^@YfW
z<g4Ilh?6JV(!buYy@n5j!K~gz6~Xp7{VPE(iG;l`WEWt^!=U)+KiC(O?e5O8l;O`g
z!pxsxeJRWQOQDOD5TNdM4M1o8lKP+_BnwHK_W+V0;Sbo836C|?K&2*hr_n010$(6~
zk8^@`R-qH%?}_&egmrES(-LZ<*M?y^_$wB0QGJPJa=q%GjGe^z>73w6U4%s7nJuPn
zcz=q-0V?&xQ-9la@7vVIgbSiH<@ngvkhjYb%@@4|&);DU!6LdxCBQMRhf()-O!_$E
zH~P9~oPe%=bWr?qT?&qLvuEm88@hv9;CWZaE}G}aMA(A5FvH)q7|@d`a|CdDZh+_C
zyL}y2@Fmph`$-e0ch;|!qJ<XKwido$WD_Rbo9?%AXMT)uIc>_j6WptweQ*;i(QQ+3
zc*a(oC%uvhsm1+e8mxR}WN0GW1kfOUjQ;|8<#8vrv5vfGmUHM$Q~o}?zSPiB6#wz8
zMmkB*O#`6wCHDaNX{)BQsm*YJ=5G+U^|3GLf_m*}Pl}+ds%-;SzAMMAAMgpX?Y?`R
zM$w$$8CPO?B;%Eqb>^%Hu<d-C(gVBwtK0m{{U6WN#}OyV6?GCrcTx%2k3@VneB&Xz
zF-Hl(W&s-Drj0dXLgQG?K?ftbO!WG=vZ6iqn@;1`dB7c$b7JCkt&8F!i;YZbjAT~v
z(`lu1b00C12JpqUa`iQ*CigUcD*(wPajb}^-bx@7Nf#(l{?VYJ!}-!f12}3iRZ1P7
z1m~Iz&`HNF!3ML98F%}|jS3*Q!R!63B<MoLJvn3MQ?<RnbrnxEdy6lcYA*{F%(LU@
z2LbN!Gys7G93H;n{C-AP&W8fpRye+&TI>!<`7gc%MRyU<g_f9XWH?XA$&a(T;E=)s
zf9JXt;zm!k=6!g(TkY=7+^jH$SwkcnJ}-(fdxfpOH6i8axOL~Jw8TzUZ(<4Rpw67%
z_0%_>z@Gg8;5AgZ*5YKRbuQDki(yOIGdnwapwl0g5=uAytlnDM%!Bxw;ZLe9))DC>
z(nbT|4dS~9<iIT)7j(`810M6sX4-qn%V)VBiOBfW)+?d+!Zn^>hvOz^q}dfZr8stb
zOr%PE-wisHP)M&tC)$5CXb_E`pCs-z>As=}WMI`%=htXV{!E`NOh^r>nc0(g!yhJQ
zkqI0d*tl7v2ZBvRukw6V?(DMxC64<E6V<QmVO<TRXb9;D`c8nfV|^+!q#1!C8N=`&
z%eqnmvW_R+-^pI9rc)_d*%9{dWQz=Jy1`R_liR!^R_heq@L<}heQjk_@_xKa$rf%;
zP5Fe$U0R69vD){&nd{3b=NQaa*bq>7yH-q5)<crPAyfJ!XhDAzb?m;YInvaZmszrO
z4cR3yuBr3*s44?{J+ndEJe^2>#x63X>6$7o*kIOR*(JMztDb$agGTIb>CGin979*X
zgU~nArp8K7zpHYq=lb1z-XFD<75KTqO$~2wvet5vwpz+8hBx}KkSwDK5*<hKx9J!x
zYjSMY!B-VrZJNL5H~NU=R=A_O`wh+q>gRxVI{xRZJS(&R?A$U3@PBwVwHtx>rws7j
zKV6p|-<!Vft7&T`%=!Yc*)B{4=S~-6QU$n{Bfl=DWc?{?(Nx%Sf-DVRpN-meX$7J$
zIQwQ@n|tWcfE^i-o8a&BmY*V<B#1!3)R|{l>((z(n>*XZTd-92)(NNa38VvV4H@2p
z*>v<Ol5bY=@at?m%KSxu<Uqd%h>!!<q0b`ihRXKugAfwv(OUrr)w3fg=Q5h))^?YU
z;*nRVH;VZ<P+&6*@=;W6FEnkn7l<lDyfj8xEcm(=D-W<DnW{r)4pH68z$bF2X|Cl6
zAC&V+p&7{^9rAnq;vqRH_kzFR`MTe`&r@JV{n9;1ej;<n#VNOhDS_dN-Dt)tvK<rE
zW+%bOzDGHSH$um%444pSz74$neOndZknnaNe<Bd?y_l4EQS~ZoQ=m&2^OUl9`F#yr
zCfHyGQjf-_eDDcSvQ8~whjlaXRYM}a=EOZ?(&vB%51;c@mjPp<*(zt&4)nB*X}|RK
z`^q~b3};1USh~LXy;SW{(|FwIuRIV60CQp8#Wh9TI(kwk6!E~$ATG(Rt1Hl)45-8!
zbvG#}@Wqr-G`3?<ur1JKzzysbu9I2mk51j_6l4C7q1DP*FbpNTvine9-VHoKOEvn)
z7m$^R)UWJ)USn-$poZu6-h`Xb8!THtXBQ2rNm=Sy{2R9CE;e#irB4oAJ=7Z}sxcv4
z&NsdtG~Fq=05K=9Pau-b1jm;Cfr!w^xu@7;>=ylus(L<_6l?~k?P)B#w9EA@Dll%)
ziP`|A@Gu^(@w;n$ilW8(Kt}C&Q8fB+Z*wt3=P|q(cHSb!!@UfhEs&v#=gx(X|I6w=
zFsDZB#qIebGBewj@x9EAK0djjCL>RsK!kuqj`5R=`yF%oUOWhqW@Hd}ylg*k@o9U>
zpLIT3x}OozCYP;Rdj*xI_L7DAP(m@s8B?)8`4nxIM~0<DzS7qojIt=EechP$<Ub#B
ztxos`hv-JIO=De%9A^*+mvSlg$@`u0NI82eoIWeA#*G=V`B30_PGEZCwZq`^zfW$}
zjg}ytZW++IeL32S;XD-F`J5<fl61??!SWH3^LS{#7W_1|pk35PycCzs%HGrG7RLm-
z*~=VHz#*qqN(kNyU3a7}BrEz7vI~Zdw7V=9OJlCslpHO{#aM2?ueE~HrvTAwWm(*}
zd1F;yh(&BreenF}@N(?0mY^qb4;vQeKsK@7NS`LwZ2wZf>d{yW*|%$CI3ar9)gxH`
z2m>7Xh77fzI%haKt{DEBh7M_U#a=%^6(a=O-vOreR`x%a+;-o+tzfSW>_-{O_%r{L
zJ<Y9~-v1nnuPj#VPRIU(2HOfL8+$(smZ<gJk9yWssNkd-3J!SF&%vqfwtH3|VnOWQ
z$=%9$nuI9cQVlqQ`L9hKd_UpT)_bD|Mdbh3xw{fpKD(I;cXSZ_ClfC^n_VGN=6yQ1
z5#!1CA>^9BaMDvVU~}){Yc>1k>lORcBhH_k;mtN0r?0L)PQ9Y0>^FAZzw#HxXD}$Y
zr0Btv`Yyp2vV=BtkK{BfUcfZ+s%XANr)GQMx;_nd)Wwi>v@jbg%H}szwx{~hngIT)
zWHyg@V?NJ)c7}ny_N}jUW(!2J$*)k0BD1R2Cy?5D;7zLM#XjDG8mt8^ZVgTt)|@;l
zNAf#N^_~$F=<Yj;+oyf`p3kk0CwvTa`34cQP7zF=iGt0<Zw}`(ZF{s_P?jC6hNR@a
zHZg%GSh6X@=2x(6qu8S~q#=DU8~?B0cJ_`;^QzDZtZUa5m67vm$qb_Po#_RP0mZhT
zI-VoFpN}W@WOS_}&1n|&>hJ>JVjh+kv2J{cYpj167kfd(gw@EQCsGkUO80v*08l%c
z=v`?olmxIAIK*~QLqy}B@5**8Bay~|y>Yk?GZ*WSBgsO$sJ1ts41-FjVcBtWLOMr!
z`p;;2YzeUa`J_6vVt>^U-utVRd2w$@dmt_Yz-m_GFIe3;Z*dW0OFiM%ef!5Xu_@A%
z&WZasPyDysf+CNy##K!}{V?a)PVC7W0tRbi=Mw)7kZWwV#b`rV9{0(IK|w~dg41_A
zFrPPyb&$tO+8Ai>+16{pUdGKRARaFFER!H+w(Nb5yuO0^Gy8I)pok&@)bRpK<0L1s
zKSkAF^9~!c-UQd5>uIStxo0un6m}bMAJ7iye>4wfb@>8oAI>hF?P7m2$Wr-yW*OUZ
zaF>_>GDW4(Iw&hWdgRA_{!U%6Z+WkOWK{7y^iv5d`KSsEy}VoUZunj)zjPm&R=bx)
z?g{F(WKBeJQZ}dH7tmdthb2IfaHniv5>vb-B#J3k^BRJa-mZUrcCGy;xEQq>oO2yE
zxB2`XAvBUUmIiZkxQzqAS$eZUf{moSJr=u0QlFHLftAic;&hiSI2=5_(|lX}aXwbx
zQ#l$nvk}fJ%L7DE=V78a85+OSQ-cr+%KHTsfXHnAyP$d#oSid~NH4_l_;u*RCrYP(
zNn!H`0+RKO7hjP0Sk~m0kXpP97Jl1~uD<R`kqw!$5+H;3LPd#r$wU<U{u#}8nY5`M
zW9aUtgOplsdwuE2B;D3j7r8B94R4K4(zluq`VkBle07ZSI?jiGoLCP-_x=SJ&r+CA
zE)N_SUTQRD2Jm$nEk!eHrH!c`f;-r;A%ojk=&k%}?Z4xqc%-@QOYoWsU7q_gfY9z<
zgwCahnaQqec=l)PWVOb#6(;nn-bQn6J_{498+@Uh8TkRJw;OSuKxLEUjxbVOLI#EQ
zl#+&~Lohy}+&-17<~;5F@KB&72hQ<B_;+wX-47YSS-o4$w3@l@oZL32U|5qVJaFyK
z>iImwSiZ|;Y8FJk-B1Ha>E5*NNUufu)MB*^*|Ef%$QMZW6x|iy`%!xACL?X5_#wh8
z<^>K36C8kP3<Sk2m`;6*y+`m(<ZYWSAG~X}AEFlH`vbuDA5uOc!rk~uZt||cY+=IX
zFQ6wjO?on919T2U&mrXJ%q^$SXgKr#bB{YUnImI!NaX`h7jp_Hg4p)h{=nn<cjSNT
z%<QAwnSEf9jPD}L(SuknM5k|ju)8OHG3U{w^580;?fH4oieE2N(B>J&xiWJ#IkTle
z>RDI^*!93UP7Pl&dND4_?cZbe*UbEF^MO+Cy?Uh%+h4!M`<yI#&oa_R@w2ltay$tB
zHJXY1-<w9?ye%E~&sbaN8sx6XR#1vZ(o>2LP<}eO#9?KPQkHn*wp-h`cg&3$xLfB(
zKfzrVj4@JDe<x+Ywr$b0NrP=RRmPs7+)wb*uQ-19QZmI}!v}~|57dxI+o0xJ6MYFk
z$BPD6)j_rQIonyDd#EdgY^GcRS>Vfm9Ve(@xL9h-g*w)sf>e*IvQ6*`$(zbGkwj0_
zerLDe95@IO^_-jW^vd3(cS6UrD(K#ly)tU7Ro8h@V@H3WXsUsWmJ2r_8Xg9;1^ql|
z{V%Nc{~~moY#^+*_s}o=pM+kY*%{%FZG{T4_jfKlN)|%G_L){o09JW)wTWjL7`405
ze9hOSlQFwCxKq&oZ=+oQ+j$f{pS{f?9Xh8PHtPnMn5J^^KcwWFNna&t2~%4$ZRW<$
zPOAH5mQOkX(E=3jrm@K07!ZPO;q{kGma@2K9bk5>Ja#x(B<w$QV{y2vS&Wu&>o4OO
z9T9`Nnf`ag;hGWU+}j?9I9}963hFMu7_~fXb-JDE1b8NEJ~2q%W7WNWXp;!0nopTI
zWW`dRQE-b7-#UEU(R9@hiWijio1CZ@tDb1mXKGN8+EHEz!w$t{=d}PcBkGURQGOFJ
z+dyLzbbYXHXN$MHS<Xph7s{yqq+-!PpG}tsZkduzc98wkI<c_j{wGzJf^x8)_d#!2
zLN%06Kh8cwb&Z~4qYDo~rqoNO+b7Du#c`ZAGX_VK3-uzPwSUj&v%zyfY9dd4PVY$G
zhF$M4JqJ<$cYS4r6OH57_@7PU#-+zdTbuC^AeWp3ovnHHHr7An&Zi3-{bT~f16NTr
z`ay6vCZk~raQN70vdhjqDBRBYDT-sJA?B?dy<W|4r>D>?`Y-+!ZB*ltinA6b%$`gx
z@ZYSiNOpvaKv2_=m07rak)@&9;L!zO*Dz*~dEiUPP>Br-Xn}Y3XAnvoMb!R=EI<5%
z>*jeghX?i=53oYU!5X!&hP{v;;qin)T(VL0SY3O6`|#yCvZufw6hk&LIq<zh?hSUz
zeeO_h|Hvp(Wgk}ksUA5;^Q4hfUwW(A()RyoI`?p<|NsA2lAP<U9LgaHZ%NLF<x~lY
zsN~F+$Z0v`%!ZI8a?F_tAvr8G=gleSa}IOf9Ot;rabv^p_5S>>@1HKmYu7wqkLUey
zzu)dT^Uah7GT@&R^Air}s_*M}#n|OlJ-L^1Yb9%OP;K~pRTvUY-cu#LYy35Ze;STd
zzX$HQ*%XgHc<it<siFF0U|+f^xerS`eI^dwb#88KGOHA6!&dLm9*0E2*v@Tz?$UBg
z^)ef3O*Bb$dIZpGf%harNNruJrMoCVlBSv_3xbHWoW(<<ZGNw23)z2mbiAroM0VfM
zvXU8>hIjHf62his*nkQrP=e;)V`-&tB|<gd%_nV|e;A7-i0*7xr_fQqur7`l_Vc3?
zT-BuMsOSE{=N!(@Bs=uU0YdhJ<Ewk67YHR;bz=yu#u#&4MsY6l5{KQ`8Ac}S!|5Ui
zaRO7FTM1q#SIYdX?)Nm2$X(6PsUJfwYRY+~x#MutsG$Nqq3qYUhaEkMGD}#8pUNLP
zo*ohn<BSeb(p0gEu2sdklF8A|@7M>X^p`88xn~D`DSWL{^n`rk=u%XZX<*&Gl`W0E
zE?7`QinsF@i;+AfXCeDt`y|5$P0_)^xZmJ`DjXrW^xc^JQ{KQ7ghV=a-DYB95#TpD
z8CI>$V3YNghHAgCIL0j$<TCLtA$*rZL5^XKo@$y)<7(NmcXvUYbCd>z|IfIPsvl@n
zERP^Jv1{Fj7o|rGaJ^Of^;Mkc@z41>!$au2TA$15U&43)E^!}@L%8vs3gYHFdIIuH
zX3P4v=*iR#R%O5bD=1jpagXEC!hhrD1zRBKc23CvxY2&8o(H+mWP2E&J-op?y}Lp&
zUn1GIN~L*htZ+d$b4@o8ftDVT5`g)GIE)=w`1He^Vae>vQ9c=Y75?6IkWu%~{QDBK
ztSUP(sm5!0J7OJvo6C-$Qim62#3E-t%2Lp9p`p+5RqJ$8_MG9qC1uonEtk#ZUjGpN
zN2<F#3il`c7w=?my0l8Ds#shF$n7}@<9(o{wp0x(L(1d(9mASjW+ES<ee;A7PHf-?
z$X&?5;e=#dvGm|(@S+YM0r=8T$eI1$YOB{jdw00x(8s)ZR(L`bi{wrBg_&aBsytrq
zTrV~8@A3n0`7a&cT1Rz$kZPNCDOOQ*j$u@0A)WOn`f=weLUxmm-(5)Q6gi0ef!&GI
zSbX^VF}d{X0DQ}*iL7&laPT2$x-~%8zl(}k8OlG(&pYy3Et#DvD-l`HbdZCy0l*0F
z^y6<ue4MbN!6&282=MQGiz^gY-I5YKxM5!_)o^hu`s<SHM%{^uYCb<J;2r@N|Ng@c
z1kHng3FI@C@En}GdTvz7ci|8w<!#`QNpbk-0&9tSO1E_Ip?v$ec4B6=th%17oL#^8
zZSd!}%v-yt@WAO^ROGHWOTAuVB%7HZr{h@vKGM`1XOH2QmdCF(?#U&o+2_Q0YOFNu
zUT!+*Vf_@ceeN%P3T8@9zeF!#HyOVM?AY~59!6+<|C{)tU+*-O##@atlN*?WrS6Eh
zj;Fs${)yKV3+Q4n+>CIo@N^l~U9OuTDc3$;;@+I|dKmyY{1wt(#Nly(39(_FV?Ivn
zhbinY{=4+7kQiv_Jt!%YW7=h60FX68TGRkQ!Du|De5_k~&tOu$>DS*(AU5pLl0U4k
zw8+k*)~@bY^^r}>=f$qc0sk(vzppw+$LPy#6m17OmMUIW7ijCl@9$MW$P-FR7gC_`
z+S5#^(-MSF9suI&6HeHKC{`I8b)d38WM-wJT6k!>ak5N$Z1lAB4i@MuXzu`8xN{{Z
zV>SCuqEWR7Ayx&abjC3F)u=1oq|Tp^rq0~~$|uah?M%nRV8#=W<-u7(6FWseHt^4`
zbI<|>z20gj>n}b8gkUb*UV1UEnxUNwC?a``cb<A&sS?9}GP-eWrY+eD-ii*P2HaU!
z=grwhMpW0OEM<S2Gj6i<Lnxf)zPC%xnr_@U4`V?-*(KRrQPbT;MO&`gOjw<i`~&M+
zTC?7|eSokQ*%w5wW}beCX*us>vPU7ac!B&*VjX|tq3tuzCnjB%fae57k~$SplLMkx
z$?l5s3c+0`X=eskvaFRUpcW0F-t@Za*TwfjH<^q=<30gJ(CnuvYo3GG!9Z2J|7RnI
zC1<08RS<$~x=N<;3#B_gS^sbx-{N)eP^<0uQJ8#o2T45roBz0U<woM90H!*Js=g5Y
zeCSVgbB^9BG;{YbhFxGl*l?itgo1}$k0WwvE+zH>OOLoUgYyo<>LRD}37mfioFX4w
z`kdSJ{r&6H)6QxGb<ukJ*@G1>SsnaCcO%WX_PXl5Of&nv=eKbBX2%uxj5;me>V@Q9
zKyz~xywWirVIDV`gs6H{9~osy0hWNdsG)=)L;aQbJ}pEx=ScAS#w9g-bA~~2$}_|y
zw<6h^HDt@Qv?5XbsgB+Pfh({Kebe=U86Hv02+bv9GZNGfUjK48>eifZ+*u=0{!s+s
z<}hanct)S!n@BX}JkiAo9wNPg+H1|gRxJ1#!9RKiOU*^f$rx`H7<BynwO*(>nUFDG
zkgeGKzz`NtGXx-DU-S>ugbki=OS|Vtc^bse8XTLYjyFIbw5t~mLCxeYzuMs-{N~<t
z4vTD@*zjG4cf#WcN<a(NXV+!)N)%h`x4SRrn{X3QNs8wx3$w9a#1W<(3y&D@KYcO|
z99Sgy*=U%dz8p7(YcCgE#@Bjs(dA4o7Q<Jvzboh!Ami%>0um2wjW04b3xUnZ#}A{j
z=QQA<Kfh}H15+P}ZKtab#>2QZ{bfQA{-s-bHoZ|NRAR2Jg2E!-BE~{{r4hRQONblp
zj5zGcVmcVdL~<fPyNhHQPKLkKhFP#BAh+HG8&;Wl=-jS705Yw(@+fheUwXQDtL{Tf
z&$A05S%?QL^^HKU;~L$9phoNbU~_9XzWZi>eUoa+0rSe0Ju1q^VYP*b!P|))a!9G*
z`_z3a{2WiyeuYIq8n*xajHan)8R?f}4~a>{Xp0TsB7JYL$2nVzw`t1J0q-x9t4$8d
zYQ?iiyu?=aa`Y~$&uB(wqt}MLJ8)qes;th}z%jEIwv`GWAw#8qD^%^x(w>PQe%S;5
zK3AwrmYGb$%_AsJ@YL$j@t1B`Yw*@PY0)EWRcvf6uP0`F>JoIvLCnL{^UfZBVDPw%
zUmE?{w*uy-Y5>7}mT87gTgn_Ksy?6qSJ@@of4&&)VcjT2bxn)Mh4AM96zy{O{Y$RQ
zLU(!(aOU4%&1HG>yqP&u`K#X%bNy8A0JtVPV%+Q<DStFtylx*kQn-TCSlPtbW@<Qq
zR$X136R9I;`-SCTga)CpGgnOmka$CJJn${2zfn(W(1PAMsdUuLp=V;Rbhe4guFn7{
zU~gC+l=&~rRgpmZ$$7d66RfPn##AgJ-=I0EvF~X<fuC40-0A_4QjiCAeo5jAeCs9R
z-{6uK*zXh9Bk1%k{iYGS`=qwt9jy?3w+BT`?(ZTcL`EvVMwa$D{?1;v>!0uAIYvpa
z|7DFU+M^73i3%=+M=hAGCcz<{oW^9-vHdvii~n?7O!@fGvlQx7jI_Yd!*5!7U0Qed
zFxscj>`2sozGKz#{TiWwoEKYn{`>=B)u^~YfK@7ukQJ{6bP3#*$A9O794?m*1I9St
z*zE&Nr9FcI^Rp|#^L7!q3#TpvHp0nq7WO*-#*y~FWftvZ4#rpU2Wa)Su+BrfuLF0X
zK-&DKbv*BRV0aNVpr!#+d-hHD>}vV%=rj4BSSI^52D%iz;`Xwe8B{sazKv4v80%{x
z%VY*wKyK`VjiNhV=Yq>5>{2SeGnyA7v_f3Pt4ew|+APbMr7dQtD5qs=P=OvS%;efC
zs>9MJ;P4PDn6AzhC^b3TZ?wODJLy)1X#uvpYHYbYz0cxsSq`g6UHN5di#Jftmd-o!
zEp^BIK27V$Ra?45$!*K15TZvs2ywllcJpZfOVh8x@DodwJ7#iyeNEzaB2}k};NF?k
z!cEQrmMFCd^T4v{1-*v+V-9on;{B_mUR_Iyp7|WVab^(?ssORxc<$d5fl=AxzP_Lk
z!uZTlf>z@WqVDcCTQNgvhKcflK|-<m$67Zh@n4k}NWNk<@+n}Lou2Pb{65;qLk;!-
zsi*>=l>~aNWYDDPiq#r9xl3L8l1mn%3Uq?`lEllv*&k6#<5=Ew*cC#jW?F|U9yJF$
zhYa33bVCMXY-MhB<?zCA2g~%3F+rO{gI$ouW7UQwz<hZD5+!7(1VnzELkB1O2EJ9h
z2khMXpfZtIKr+4^oK6tLeOflMfo`n&TCVnG{=+ILM_~5Q$R8X%ukpTU8t!`HA?BE}
z0~gC_Jkrf+94T?l5^rRNhO|K~V1q&q-@lq4u60h4tEt&S8=m)14y)&TeN=Y0ahR{D
z!6jPk!PZJkObLoaz~OmW8&lFJ9@#{XH~Z@>W5ROUz*{ZG??o1#ln#A4Dyr^#9cIY!
zkJnRwMU@Hngx9$_;qG2K?oI>eq7e@e&Cq;9c`ZnJ%W~5PdOKW-zWRK3xygwacnK7#
z5y@FzTXl7a0d(%=Xn35?Gk=H3rm*+!z$f>)gG=#U7~EnBE6z8no_o+j1wa4JBAH^|
zMY-PQw=y!b&3b9QbFJjKeB0gM`Y!6Ue(WT!qKhJZG^}c5zKUc4hZx%hj>)Xr$!%Ql
zo9O>w-352e4S}$ubrmidbOUB#r;v%URy(z$h}NJ`tlVks`byOEZzD4iL2)4fl>MVf
z2(T*w`aoqa(f<*B@s)lWH|Er8`<c6|uqKObBG=xsA**aMa;24J5EIa~M`1l4o`1&T
zNOUg19x*!*N|?yu<6n!_q~XpcT=NaEzB2jtkwyy5GOnM$(ccd)&oBp$CQUI$*RMmr
zIM_w(G!B*Z<ZqC>7Z<MU;G+tY!LS;IF@|r+npfTz`I-M<-m`=f$!`Tf`|@cDJ5U~V
z<43UW3A1Dv+e#VW;a%;DlpnTho#Ft1S|I|pzxqwGp2T&-r9jb$zT<_<78Mbe+Q|NU
zOphHMhQE*$xaOvT-LZEG4SPGbtK+(2#6GXbxhlt_T}?+*=RT~V1GlX`6DXRJ`NBM|
z4BHwZI^v(6gf8BTAjfl=lK1As`E!1dHRT`;-D=a>&lhHCEU2kNREYh3_sW3R%!(CV
zLH~vrE^r;cJ(yn;p;j0@sve+J8eLQz1{UDsi!qRZzf<b1Umn&}4w(Ibr|AYSPeWV2
zcn&;L<^wM>j2{L`(Lo(>%Ya9(<;{XWzThHXA*;cGNPqWb00oXtocKTh^y8jy;#mI|
z#BN4v^9|Phah*W*LuHcg9!j(-V5jUoXF>egt(D~!p;;@>AOlL=TxojKUKawS*)xk-
zg$^?|OJ}9Vh`uR1X%T6dQTVf1uz8G!&-(~^?L>3_O;<Xp<qqOd7xSO;1HEyJ!Y(i~
zX*$9XS&H?ngt-xM8GjZ<#XrUQybt?ZIO{I>)n?9jTah2WT#3M=6xY|?dDu<`pPs&)
z%fq9nK5x&T&|^Ky^mz_~$Ne;imj&w4m+G`ken6^bT@(T_Hf2^XH#$)&6j^;QYJ{Y=
z<=CD20?a|P*=3CN%5L(_8R0#YBGFEj4Xx@PQMl)cM-^w56wG;kcQ6|di{$s(2`!%)
zE-E7(*N#W4j!q!c?CzG@257JnSb@Qjv~~LCaV;ab;k2G~6q`CA?XBO)J@Zp`u%!VO
zBasy)67-18{SMI3CO~|W!vI#DUoG@Suw^Z~Y}W$PRT2|oy!r4uf_?@-F&su#$amTP
z50SiiMu&cC_k|^9MC`@ExbfJ_^D$V}4OQcJhuZU5w+VJT@moY3=14B$+N%xJm(BW=
z#@{8T<)z4N+=hzg7KT4#U^ApKh$ql>%U{BlBQYtrPr-<|oMkdYGgDCcy5#rBY#?_@
zSX?s$#7jhFaD;=cMjEuU+wQzoy^<YApZd%sJ(%lMNK-Yvy+{JRTy=Gf8~pf7tP5GD
zyQ0||@V@NM{zsjoo@|ic%B#H9&8}bXuw^j;N#P(~vjJf`Dz#3y^2zQjcUq(V)hu{Y
zCPFFXOOG<M5nAbx(w$;kuC+FHFVJ-slVq|jm`N`N#F?bX7)Y)c>ED^Fr4oa+8(9N)
znuePOgYqtts;~QS)Vb}MF}Q^$R$Ou0Zoc?1QjZk=O{5`V(K*1#j)Si-vAGK@xjJ1E
z^s1E+^yXX<Xy#)pMjd-h)0kgHl^OSLsqT31NOKgBLlPjcZTtAEaghbg@Es32%5ddv
zvAtev?48!^L3J-7pcV1?e?~RHB*@NNd)i+8qBrx$aXR|`*GrGz#vK>_kWauG?g@*S
zUG(pY^hZ6PM#O>H2z&%(nw^0P=T5cEgwWMK?A`u1d3-%p+vbBn*CE=}VB0#Q%@6Ue
z&EXQ(l5J>hkg>5`8!}ZE^;3C0pIDn=C<C!l=8-yLg-D3PUSB6%7WAA;Zy%rp#}piW
zr~q@KtB<KK4CnGkG%v5Bq6$aE`!4=|Z}%sn1-?~?J^EIW=r<~RG7WsxihB~E8=jCo
zKV$YhReuGF)T!8B;Tr%J7i`FUvTE_2{c;r=>nw}VLe&rTar$7$W3{E;TYSu!-an0U
zuRAtCiRbU~#poRJ>F{kZavpY1J`_qE@Qa~z!KKu1UR@$a*Lr|txdL7DD#We<6D!W6
zTrrsUqMneamZbamlyT=R45xy#?6piTfGSQbz;G!1x}6hAFDGCYR}&#g6Xs6h{S%ZO
zWO4{ook<(%R%Vs>ALIA7@Vd2pBUy(pw4+s2$oK5C{~7bopZ?`}B_nox+IdZ4JFUTV
zz3}+V-*<X!2gHH7l4FB|k?bexa>++n)G976ByhIedR1~-`nW4J<xZDPl+VRek=?0q
zHs9U#D8YMvlBGNG^9{NKS9P92BiIh~<vj=?CgW!u4KO8`uV~#k<~Ha%p=+C|@y>i7
zo5nW~9eiGki26!M7Rh)QZzzyK&G_ymOrQF~)vzD0KXPZ2=frZu-@I0YC$g3~P^>qg
ztc^R<HPJ^y($3U^HP-RyoSSm9{)Oc4Fo2L7tu~BMPm4S<DFMR!T6>;EIP24)ZNA;9
z2rx%%{i3W&4s2Q3^c0ctvD}w@%u?X{cGt4@rUewuJ9I9SP(Caz=)*~!j#FE=<wDrL
znWIa|FD%T2ELzRWn%hv;vY-hfVU*wdJM%S6mfCF)D-^fj#JIjZ&s=V^d%FSC$DgXD
z{#?KPfF>x9KvbjFSjp9$__o(4c<91i%WLGqO|wR<D`D=P2LG|%Z0!EF_7tDJEL#{5
zLeKl*0W=gN^)$*XKKyPdhY!BK#OL6!9qi(fS%VjN_j0$-atXGV-zLs&lQS!O;44L*
z;_}lJ>un-*b0Gq?nxWSl4OY5QwVG)g@d0ICmj3gInP$X23K@$2cvold>6N&|M>ZFm
z#)mKdv$Aa2$NnbJITY*3$t<XHPVBhc%njQ*_-s02<n(dsrbk;KDFK7b!sWA2tL<Hq
zhO`_o9%hUayF8Y!qfXGx$mO~53xmIO`xWFIZ_=S#Mr;N#bqfCXB9wQU^KV_%rK04$
z1-n2W#gpI6Y2i_L=V@g9f^$Q7_m<_V#LFWtM|YYQ($`_&4^vZhD{>#A@<&(us6Ys9
z!VokTH@A>Bxp>Bp0L$v@jTm<jLryi0a&6BM@ho}i>Yl`T>(nl;I0u(M@cr7CwQer|
zT-%JY<~>1mWIN0_Q{D7lW1jKP{<yZ!!~a^6ldQW<mXtp27@qEl9468sPB(tT(6QTj
z0J!VYM_b;&f|ZfC=+pN5*Mic|FnfhYJ(#pqJ&-?&*Zn>I;A6y$o?wr9qGY60$|Oju
zt@jEdVhPH04D!Bh0?q4TOKd^*qltFgvrJxEckS8U4#zQ@QD&;1pN)I{ai_c;*`IC1
zO4X_<f6Aq1+KG%vpS=d*_$|z{$1H>%4Ap#;qiV2Na(qZY9n|OaH?JY?*M=GoorV7n
zZgR9`?WkqCW*|Z7q8~pz&697nJ(dVATLhHUrhY;EH*t^eJ9R^{=?`{h`JU^YJYUU)
zgIQz6t!t)E>=5Jf^*y96Ys+6vkyk?$YAjUzsOAuritUyt69?PbAukop*2Js<FOydR
zO$QvQA7{{Xd-73ZS?SmT)GGV|SGN7p?v?TLhf|2EdOvphVw*n!+Ti}lBIX10?O(;x
zn(OV_uccEx)F|o$!pE`ub6!XAqJ)<GULO|0G%HF0pnI+=7ZaCL%l8YI8q+`pgwgYw
z{oBy8LDOHCIcfP;by@JO8~V;_tl|78N85(5XMk<zKUTPP_kw<9<>_limyOjz?Up;Q
zc%!&Ba+bF1O=)A@Cu%rV$;6q|N{+E5<?l!N?i_Jl`3(1{o84HBqZP5NjJgS<m?cYC
z`PJFctg~*GkPKS#N`sDVTo?MOfscl|f0vB4ea_V*JDDP8bhS!STw4PNNj#C1fDoF`
zRqH!w)90p|q4uXNsj}A*k!y32Db~?hwl&y{6XCfykqPzBCzcaJKHM|jbOUCZ)*d!v
z%MmdKYNW8w0Y&4eV*|gRJDKhBYYh4b={?KZHdNPh_#Xj8SmX>#ux+|UoR~nLz(b_X
zxb`H^-AXH|dZac-j(j0Vu^+sFN3(NIq93;|Ru5ebl-XqlygBkG6pM0scge0l03}X+
z-OO~=QE21YuW3_15(8g&nbj=ETrY#5S_$wA=#WoXCY?peLv;;6w5Y=!&-lS*^g8Za
zA<^Qg)i5QTLmG>MDG0)v#KZa5>7EApMihK2p!M!UTF~U_ew^b*bfs6n?WOZ!<YaFf
zZs5^-q($%e@H-v+t>SiNpK((=3|B6oC8j*v5-&o@Y7W0EvOl2gh;X7BPK-2DPx@@4
z3N_lgr!??F!$;nP`qzs!*N<qKG_S)gCu)y)0Ltl{R`$yQwX+bKhLz|>Ld+ykMoF+F
zw}!Lvz?;h0LM#;y*?_41JxPZ;4`Qlkesgt_bqtdhF|uWs5$-x<7K>AtM&u`5ze+|u
z@J%@AWafz1DSUCo-%!_4l)oxYldkoACt34k3vSEebTylF9*9j7GG^wNO)>k!9W}p#
zm(G_zdLl3GQGD5bF33$V+!(<Yj*B%5*&^y1ZaaUh0euEJlIJunMx&FJX(P8;1mq4Q
zm~|7@Eq%u?!KE@rzUR0r66-QXZg5(FzW!xr_w26E9gK<<+&y>tTFF_h({n|dI(0U7
zay}9dg=P)-yep4jRVk_rTWj?pBk#_AR(rm$>B0_zMIJ$gtnW&zw0)Cz3Ldrt814DD
z0Qkj6FmsGBfDN3^mQpKtsxgYb@5mA*T)nq<Vx>j_xd$_j@pmFGbyAn!7RbG9T6`O^
zf^v%Q!NWfsU+(CWA!9H2;eM>X>T1^0g7EerU1yf%+$YQ1*N}2ZSM90!-H_vlz-kop
zetb8H8O!cVx%U)DpKgMDd*I6gczdUdJTr$aOR(>3>#otd8chQs{p9?%uIh2Y*o*0t
z5@Oax(u6GFGG*kQ=j1*8HKZ#batVpHuf#?g_&RQFV_VO-?tLsY=N>R%0`jy%dUM_J
zE4jQIio*p7rz+kMDI7Heh}Zo|O`jgg5$Jg9+7XgfPZ;vbS?`r_ANWzy2c?~unzNyJ
zdc!OVN3MrO_SKBNU_IViEO3848l{f3`A#sC%JN&O8ZmB$lo+5ZtBfn-b1m6JbU#HJ
zWUIWA=Xbg~GNntUj3TF|%TiP3OVK+}N_Hd3F|Rvm{+H6U7O;yzXp1WCLUkLcP}?^7
zNMWyhY~*GUpzEJu{x1#(NxV=FRPU{^ZRxZRQ$u653$00s{XSB2FmHkO%_Z}b?FwM=
z?|5&P?R=oK)wkl|{y>9)R`G%2AZoYZ{P|X=J5`!P3_lXp{|<&qd65MYH?mSTD;8<l
z1Rg&9@V(5P^bY`RjH?&!^q^!SSxwr@);23S0CmjCQILjhl@U}XrP6$>b?GP}1$_8M
zUboL--MHf5GyCI7ahnG@dQ_;@p<Bd2HvfX1(YPhfF};m_$l>Px4^p_-IYGHPw{V4t
z#{+8nT-{YjD2MF+&yA=*;!?Zu5r(!Wad8jXj80QF-|22Jh&YXdOjretL`mx{HFgNd
z8|mfGSSh^3#gH;kfA+~wb!=3T0TpTn&DeHNihc?6;4xWjl!mpWuYC*n@ht@T@dP6u
znVu1;EBf(*L~YxDD`~~>KY=c?eYf<2vC4vSGxPEfhy+WYe*07}^VO(o`?3?^98TAx
zr5mophX7aGIwwK$T_vAdQgDzNDJvWLUmgg^fPy~&^7FXi7Y$KohsrHRg_F=<Lzp>i
zeel}Vd;VK$y-h<Zke}*e)+Z4MSGMRf4iHiB^?YiCy_Ld2#7Ld^6G$ekaLdu#-t!NJ
z^o1t5J+*~D^ul!6OJlm7@o~3<wix1&E$EU%jTp=AjHa@r!xN|Wvwj$8;^jy}f2P`6
z+mQe5?Wv*jMr{qW4`v(w@{gDJxOo<D8>x7HO5L>~|0T<4lpi2%GRRus_GvN4=SzCM
zLwqhT=a^xhzl&JQ2c0)bCc#~Guq!8AstnqbtU}N=MIN<Uv&C8$CE37>jlN^_Wd2!;
zN$&Z^vJ3T|wb=;`mQo2pZkuL6gmn`?e660#B_dRj8PEjA`YnTYZl%xnouLX#;<|8}
z%D=>Z)%6Bw<{=9r3lpb7-C6sAKj`rzr%*yH?l5kPv(a@va;8}E+RV8<fmo$y5!eO3
z;bCm-zof_cH7!tg)A?+XF)$%ZHFDlgYCv6eiNh2_j@Y_Tb01KLv~@b|wETq!m^4eI
z|NdW4;%3Y)a1w1iQE-3OknAwV`sjS<mVIytQZe{s+7oPCC2sv!wF`+(w)X>E%gv>2
zW^xSgu~XqLiCaf}X3wd@gHh6_JC?f)<#|Kc^&6=>p?u>^wGF^`G;8DDgq7PP?n5M1
zcH{as4Q<$oE{tHSj^->?AcvT|IZUt|9H!Cz$z|nN_c-YBOcY=p_{iNv52(lz7+rNn
zo>i+XNkpZQ(w7VInG+><$&UX7ce(o$O;$2*oep(CX%*`2O^OMAXg`E48Bn~G1_bOY
zd{$Z$sN2rfxO%Z2Ic>p-<Sc-B!Qn-!<}S86^=G8!leK&=7=lW^QpU>drS?qO2MJrG
z>A|E%-2D*%(T<+d42lHayeAl+yT3X6AVrDlK=Oo^A0UHtagjzW)!_@aF=FNp@<Q@!
zaR*v+pbN)0G96VY!p(>FnoBlbIy~}Rjj^}v^zbMn#J?0zIh^tjE<CDjPHrYCUjk6g
zpk>kn|M%L<*}rc4FQoDo@x11C75e_~>v=$|oMPFuO4@dFeZ_(+3yXuUl~Jyg>!~8z
zy*&)5Q?5QD>-Vw4Xt(88a4J+}lBU@E^vJt>^lK*yOwdrRDw#lzk7jWI4FF2`b73))
z_obCfaS?;@f<E^yGVukPnaz(_IyNq1OitSXg!SL6IlJT1mO`u43-GN_hZ1r&yn~Np
zCqBvIt^-U03+o!j#kFI_0*HEqx8rXSgOk!bSGY|xS6$?X<qPBqcw~0Fg$){?`eGy5
z{q+n8Ajgx@{V*%>-48yPuFK5Fd%R9~dGAWZ1-NUXWAfOXLwzONou@!kY%K`>SM@|#
zSNZ$u9MjHOw=`8tp?s}}RHzqWTD|KE6PHw*h$wYx!1HP?@|;jfOZ4p_34B!lxWzl3
zlwnbcBj|8u-%aD<sX@n?k}za8Ic^5hLnO%8Z=8peyuSM=$E%s|o}&pF)rym4Ff1B+
z{dOSamhSoTEI1Bp47MKOc|!<W1mM-fl4tpnfXkO_0lWK8V$lfj?zecQ)>MOA@AKOH
zqFsm>`nvxea5CI=L4D@S35sOkNNk3-e22a(7xcHdb)?_}aEHyT2IPQkZ!yr<R^NC1
zVQP1SNILB&76)d)aWKeYb%8*jJ9Vv&d1g<9{NP0=6Mx??3yA*HzHdyI{LAF8*F_52
z9MiuOw<6iNW#%~`PUbrA8=$|1)B~(mK9PMnWwdgUTYc0HB5R2SCzprW2OtooEI}1p
z;VFNgBLdXId3)8s%zkEa9a&C7t5kE0@ThLhaZPw37u)IE?)v7k6h*{<q;6Btt&P{Q
z-Lq$Pm$q-CDf&@`21{6uM!pUV^i3SQ_C_US3cfE@J3Ak{)p0_!TEfPb`C)7EnF@sQ
z^NtFKsAx(xsD8w&?-lsp9cbh+Y2LSo;DWCJq&%ZT8LDeYN<_&Q>^NvPWPXJHRXSsn
z$7gVEM7M++-JMJq!Tj=wY>#notpfZc)}A8&-M>VwQbzlL=RjVCP;~d5PecZhZRx~+
z6Jsd>t;nY;6`?7ZJ(o`J@q{2F((KI|OYP%c(DYxeyDHdZA^N!(cQya5!I3X>B8tP(
zYjxLg|Ek;9e#N%1sb&WL=F)X+^cqb)3Tj_73U5m!LnGdJ^2~kep5y8OKWzuGbKf7}
z8C|~XSQ-X<(!@N+U`(I#=vW_#egIYt=QUP*PPnV)@0ts%Iepr+TTr$2M~n>R5+Doi
zyw?f2ndS2}_TpS7*}R~av|1}lx1590F1A1Coj4xu2>1X|{n5+rJ=4)$=6P*@tkmCw
z{E;f-6eT5Y#06FzgzF`pZ|d`{y~*69)SZ9~=X0ZA8kBnikVklvCyhV(JL>XFgzUZ?
zk<8aS`8m-XYw{Md%`MOx?v*Wp#vc|EDe|6-<SEuT74M9OlhM+cH0DMnaX;Ik65iI}
zFFqe2B}b1IBrCx?><TMj`V`Lu|E^+Pezv8h5?s<df3D)aI{?=NdO!bzYjR=VkwRo|
zKbU)T<NI2yiRkBwH-jXb5}ng0bg!jt>A_F<*tNbbsiu_4vlmRwVE7sVs_;lY$!N8V
zyuddSK>2Ica(Yge=w#G8Ia_rC9nD`(n)ZE<^@XprN1)T3W5q<c!LZZr;WqrnNGft4
zjRmaphr&qQ_HBo)p27j|bzuK;#1g=mL!}*fU>09#v=$G8r-$@ZkAqt~&nLM#Wwsl8
z>?AM*xfT)F_DyP^zf&1p2ySvCrjyMaJ9B2p58235>W;EayTN4!2WOC5z4~wW9!CG^
zpWW7v4mds$GQQ?R6&tWA|I>LZ(wy&rQ5U-g$`ta<CzJ|Y&`jI)aIkzg*s^<go~FJW
zJwN)BZ29J~jL`M^LWTbUO6CPp6%d<w<FtonhAFp>a^Lp&)gbnh9I3XK(1anbxo4wv
zj4Li$(7Ih}WTIG_O4(#-?U9^fi2HIMa-E!>K@|g{kFu&ukueVM@K@oZ(N*#-u0Zi2
zKGoYpd;3&Ka_FU2&4p|Cgl@!}dt4#P`rAs9oc5+>eDLpJUG_CgSS8+rMplN|ClLne
zZ!k)UuC~fz58IXP$xttflm84iMi;qR9S$>;^B7`79+xDOp!4YHrkH<hc32qW%G=A7
zdoBb<cCG!$i`F^1GIdNDJ_u)vW+Vv4o~5kLsAD|Y-5rV(YFe?EQ)tM(&;VQ0bri$L
zKigxzjeg0r4_#P8UsPU^#Y{d>XXozNA964Gk#gHkPw5_RvFf#^?Alq%LqVNAVNN0@
zsr(-0_?z+*UF6lt<_KL%YgQSZ=V}n3TOUhnu6Q@nb9)Y3<Cu*Cef>)%HSMJPS|j;o
z8i!UsD4E$BOYWi^r5*R4Syo<qNe)?CMVXO$$Z?I50O8y=%*|h1s=;0N4fiocSDtR3
z$@O3AUV(M5lX&ti6|#zAz?f{T%BZUECKE1_?CnE1V4mhW4SW2%Gf9l6-Tgrcz-op4
z1F%~8=LYl8v2;r9ZM833hpWXi?_XaIn*-PWi@5bLM2ISkbL1;yQV-Z`oKMPs-ifnk
zrr5p5I%J+MB{BI+&6y8(@A&S?XccoYA+yW;^Ym8kgrFvq-%W~#++-7sNf38EH-07G
zGx)R67r*Drl8+Z(<Aer^L4k}#I*|&LQQB^GJsszFvi$YGp9+R0eZknNb(JxbE!FOy
zf*-i6?6?b+^#!#~hUG`&7C%6x%0v!P1Jga*Qnh`l-&ilw<F}b)8jtf5xKxwtYPQ!J
z7B)tiaqRHNAgv|rR557f3!LK0S-HRvw54&+bUNRAc^OblqgtVHj;U|v<Cfj?X5w_v
zMZtV?P<oxN;TwUHIaLhZK6wR>7rzFy5{HOMl5UbXf8VqX@bZIi^gLZ-9mZZu^M1xU
zeBomrBj+9}xqVzE&b8$!Pc7qv;4-0^pla=EDBAXG#^OPNt{d>E8n6A}a~@fCa)KK9
zuaIN<6X2UF|Js%EVykIFz++fsNbs3MDExy;p}}W<dPMNP$DHh`JvLck_phDheg+AX
z=3_j*BYzq-3g1e>U9uGVH51noEe3Z5<4q8fUD=S--PkX_jCYgJ`ORXnI?CNh*R}M(
z16{dWJ=-S0G{nvmPoB;o{W^*r%@T$)`S0_;t<2usz138`{qXJjRo189yg1H4t_w>G
zo>2adS)vAUg4Y?5&sq((_PYA8)hecYT-vdLsxYbGF4=n&0Qu4>u^(>6ZsS@AKerf7
zkl&XZkoBTYsoJjGIwl5;8!SW`eEiee<N;+DFx31`pX&ZJ?HK-)+~L9$(t>?L`9$iW
z=`2}+HWCh}>~)^hDGtiL<iZ>zmZu07rX_J~SW-X5*HwUwCsGx@8lro4uHVZ7+ft|8
zRgQcEs^0wu5Whhcg84)50q0fmp`~2-()46svQ-*0Mk$S<jkc(fYc+Cw43nDAI>Z4$
zqwD;v4|p#^^qT(@a1LC*x`R!*I?-pI=M{LLJkc%D*BoXSngz0k7Yax4NkuDM9l@bk
zw=bvfvQZ7cA7_p*+-X#L5*y9=f^lT+0+ZSh)-8(XreDPHOS5dh?}K`WwDJI31qb55
z@wPrhzp1|4Dt&ht-*WyC<*`zAN3ahRanJkSKn;tLa4$Pp6|!W_<i90QeyIx6eDz$T
z=~PCjLq+`LDw%q&(f5vFe^FCT2&#X!Mb6H8myOb13__D*cZUP+!kddJW%86{BGyu0
z1HX_IO`?e@%XBCX$}DGc9Bix_hS33CEl1?r%#3P`<wdZSY0C5Sf-kS)!rZ9b=Z~h8
zKD_bWWAT^g&1!Du1g)7hROWoA`5XbW7)$IOL;2mPwuYs5QvNKfJ&xI@JNwM!sRuUM
z4aBY;xY7X_ASag+a1I@QOD-Da+6dvg{;Lq^a&%#+2-A_J_ftKw)%1Z`(}*BzeLC%e
z7#f4LvAALQ1+hS&6Z<)x9l!qn3Gy=A2mqAY_=zVRuPPaDF+Tf8yTkvZGSk}iXx3i!
z&m)Isb$$=4&Bcu}XnC48<YUS|fn}AaQvv6ZA*e?Cj>c!j*w0yVHpLY##m&fTuA8VQ
zXr+5qzte;Jz6F>4{ydFJvvVk)HuSVm(>VA|EY%J{p323vA5XpeE3fF#^{aw^_Q_NC
zwEblhx|o+%88z)}QjJ=_$D_LhfkAuuTlxn6)hVp6vS+`f|G*0`icTAjEEfaNK9|_o
zgLmVy^S3o(P_a#erY@uWPYHEDD3d^cn7O*%lj)5`HM8aVgogIFkFnISmb*L9-rm!@
zq?+rLgnh{-rNcCT((A;e`7Bi+DhC>jx~NjrSK3+(A;(+247Nl>ejsWH4yZch$R}1*
zBwd63mD$wLT}3?*66nkCma}|Y(|`)x{u@?$VS-JjGO_|tXMGoxCDhA?Lx2`0@Ac#N
zLSG6+;HXI1!ROL$SKxK`{C>H|5lbVa%eIX?bYe~4YUT&GXlbk@Rmk^z`5)Tuv4hNi
z^JLstWl7i3qjL!pqUV1dvzfhX8MKvZWaEwldg<<M7X4A@0tZJL=QjkfEZMHII&r*k
zbBwvpAxbInSV=vao{za4G7wRIzouO*AMugNS}4%fBe=1Pa~Sz53#yH&20hm6e1RN}
zRerLHvYYqPB>Zk1trJ@WMBZ#3g7A(2XT{2}`Imq=FfB2JO`%Pk`H)n#5}m^jF0*9y
zK=^omBvZeuHytl6$6TKMeDb?yF5~Ked(-Lb^DP3tybo?dROcmbk$godOC1&uCi%%#
zj;}+6l8E)wU2UJ>QnazY{vhxDWAwIWBJ!$$=o2beA1qR!I0gwO!@TEMh@a;>uLQd0
zww<3PXvYPr(6S!Y+?GQmfkHo$R;M2#3#w!{WRh3ji?7RsJpv+3I3CMG`<Pfxi%HCH
zV)gr3fim~&u)ep5bB;^9W$fco9={>ESU0t=;U@~iLBu_4Ac1zRQ~W1Jxj4VS%+}-F
zehK#EneSaCwpN)-vjtpBj^dLc71a^}I=5Zo7~{`qWl@Q9RwYwZ!b=6bAH7SEZfX9O
zTn27Jc4={AglR3?Z}lT2ywrf2qKp=Wm1!M-#P}ApYZ)FikTKqMe`p-o=!JtkZQb4^
zd@0zxnuZ0x8<pJ1H-+p`vega5#V@%(eQ~s^j#Tfum#z?FQo?<rFb`zcIaZwc22k^^
z15c!Nf&Rpi@Ef)3tSc6#184bjgs;`e&EL#ze{2%~UiDH5w}8$kl&mV()(Zx7EsbV*
zl3rDa8ke_YfV>XDO5P|(#5q4p&0b5~MP#C-CFqjNSf@5-<_3gAz~IF?bg=Ap`V&;V
z^W-+Cgkl8&<)a`sulBob^utche_GiZPmDe(tfPM(Yq%niRNDVJr0Xk%+K=4#T;NM=
z`nk76g@ORfiI7!G^k{*jQAk|s-(dyXoFCk~B?QUXnIu^ChrjTA^i!ZS3R#vl#xdZ+
z?hr3Q>%?Q-n!*^du8H}o(K~{K#qJ3{ybjwrpoZx_cM4!)Fwy7D*Du&*8WI-ex0qh!
zOgWj<99?FTIrs#Im1K%9EsBhgW=QkGsn1T{HJ3(eO=jU3g{qn+5`a$0wYUzxFJP<T
z$W_@(LazcUo61E6clNufB=&0D=76QgqkppFII;>U!*#m(*jV*AqJ2v$!{Q-PX25CB
zQmsCpaqgT-fBwC}4|K}R*(Fg{2h#y%+=sYsL8fcwpQY^l%`T`dRry83nJi|f@#Snl
zsvLF;d&O9TadDQLlaC}2Q&knx1@x*yp*bY*<-`1J$7J{xI%lkwrA}-O)i#+AXMtVt
za&4N?;y=x_0O5#xSi~u6x&7z$f$XT0sb?3E?@nKz0G-r8U5#Xy{igg;TF6sJ!&tCt
z`j~0uZm5zOo3u`=)<BO1uYKmWJP2Mm6S&nh>$CIL$L?<GDr(rL+)$;z=d*!b+3ZFN
zEx74kcQCf6(vi5fN56H9>bnyAcK3Y?(LQsx3;VgVhJ^9nEuH%%4Lt^yS^xVtu$K7K
z!9fEQom-BNN)9Z}<aU)sod)HUd8%Dkdk&Y8iLrUr`bH9R4SvQm_+!<Em_Mn~zbi*=
zIO*m+SfnSov-9mIg9AN4f^vR1+om<3Shd3e9hu0#*aFR7Ma`7mg^3T7dtG~A`_iC_
z(bVK39Tj8&mS_QM`qdB=&16t(-;{Fr!QDwbHAZDw8911gh_q?1zdwoYj%%pRo9ruG
zI>fe1ym#w>B=>qC_BhmZz{dL`c;gYWjQ=%VY&cz*Qa+01MEg3tD-Lu`0r#H7Z_#mH
zVBuBMC@?fs==}-rFOjxn$~pz3?p&2UU0KEf?5xDLpMHh8a&rP*7D!Oxd^#@k1y{Qk
zc$ZnkY$>s!Kt`&nGg}K(gbsQN8^lQYk0jA8OJcw~Bm7O>s)IyQ)etll_s4}3cdTb<
zk%z6m^HCNzEK{jGe_g&C$=(?fm$K&HocVX;b0pnlq=G5KFcAWa2dSFQY7U(Pf6b2m
zuLbLo*-gf`j;HOG5<RN7zAx3kPcFPqKGZOiS}~0%&zd{_YV>Va)7QgbdF^~1euk9k
zmAc`zxGL7Duuohr9n*%ecKE$d5^@@C3xH4pjLIKhG&WZ_9`}lhjL{VVA&T8Ia#i(K
zP?APp!Dl%V+qj;tpp36cG~VIxc(0UgSqfXxI_r?!7g^dsnt(sjX_I#C${!AZXn{1T
zI#)HU4&w+<6Cu486KmQ9LOTNw>G2G1FULB#j>}*K<<B9~?5q><mF<Q_<95MYiK5P%
zxzDdNNo<R?OD?|_L65g`rh{{j5cA7U-#xpL5mlmeRyGh@j5I00)iGs~6&F@7TOuiO
z2tbAzYsXhd@>+~9I%?hx?xHA{4SgNEkHqiE7zZr3c6a+EnPP{&E-xXp3@scH<I52$
zS(X+384KZq+!N2d4n&SDJ<Y|gHEMd9zu2|3jr$v&m*DxUGpna&p>AlN)BDQSSs2|D
zIPNb3{y`fF&FSuwXyM_Ny4w%c&6~p>a?#*IE?Yrc-2%w#A|Um!S|P?#rN$?d<?e<<
zc4Z%x)il0(usS&KG0)W`98Jw;dQZc5f`3@k46Oo7BZ%h>cfY4X@x#VztOD7>yLJLw
z(py^AJJ79Ii^D1P!%(pL_!I#x-@tTgBExIElL3J9hBDvtTsw3IU$GvTFHlqowVz13
z>aLYucJnZe>@}4AG7w@m0O+|(d<Q072@f4tdq9`>K;*MAL6Ne4f1bI_7sXSQ>T!ML
zRxF4%jBokqr6Qx<4@@GB)3$!rZq{m2>Do3eg2s^PmcL!dr*9v3<6<9&7^vytZ<p_J
zx%T*FQRrJ<t?J%?4|=VEo{FGZAF6mbZOES`CpyS=(XX!&7eT;3`xT2uDvD5kU#Zog
z&Bf;JEpgEiupfa(M&D0=0)(=Ygnd82xaasn?Ib)%%KGH_kekT?QR*w<&F0~FWaK-1
zZViA3r316*1*REk%rA&T+W(Zx`xk*M+_v5gAPs6&+~50K1U1L{?eP8Mx1GTdR-uG$
zu)xx1Z_nB9sB>>&JJ!cs$_a9VzRTD|<CT1cqESp(th+p9`Yle8b6KbipH@WX_ux9p
zML&Uw(>uL(^}RfW5O<xW-Tmj;1ol99P_+DSR>yz#mS_|Gy?NxQB*hi4N)o}6dj9T;
zHrI8zBL&rRxHNz$<yQ6U97}q12v+o4u#ce_LF72i4tO;1>3$0u^CRRFnPoN`z?ipn
zeh{=LaCasy0luZ+?MyaBj;5#U$!cOB#-(c%L5HH<JaAHdYv<uxrCHhzYQ;gKAv;d^
zv^`?W46<cc>H!m1H&(+<uJ+7c1S^|^;<7*$rYHoymz}MCdDOE<wcJQ5UD@URsdM)^
zOm+5-Xq)oqzAw%_Ct=6}v6>e8Gnap#4v$^fMM<LUcUw8<(S?0~F2Ktcf#Wlb-J7W2
zJR@>A1>&%%_192_Uu}4n1eo*t)~8l$ENt4DB#xBT3;RzZYK|5+**rx5XDxS?_)3Gk
zO(N~MjM{gGoXvZ5dnjF*QZZ$sN`E@2v>tEmb>QE1bzXxBV$9{@{TI3A6kp2I@Gn?q
z@1KyZKZ|P&Zuh1JnvBN>D~9Z@1-yDNzH=uh_gD2Amctu9I)>~qR`;{tj<?-DzYq1V
zSkI8*4(#hm{LtO7eEq4{Ut~}Z$-mRtP!eo;*n?G`_n5hYvu@S;$R4s(D>&Gm?w;8*
z(}{9iUE7qMca>Cc`wp?%c$fFIW=BbKW4Pl>KN*L%{)==CO-(cyDpkDYbTuhhs`M)t
z6aU~~LMIh^hmJDM%2+mAot7|r<PW6Tf-3$r=IkUyTOealN2rQ*vl;>4TX&*`(TiM0
zp|HZ8dI=goVDr2C#sHp9AF(E15<i(T-yM71Z`S)-m)PTFf@A5pbF|8lIhq`j!6PK^
z4mS{i-AE2JYD%GHr8xyv%R<Oae+fRWOmof6l<B8r-dk!*-Ra1ycGd8+sa{)=mGaGi
zl4grf&3fdydK&V!`9*eE^+X!ydDn!V%Etmtnyf;e{lIoYE~&9^wid8B?L5eC7Lm)G
zugt3d3~nHg=^V~f!3x{Rw9m&=7L8kJidCQae)(tJ3kB2OXk3PuLtku@swPx{jHSQe
zy*A0n-O^nfTyQ}HeLYSO{632`K{KTbZQFeg@{5H0SmifbS4U^z-*XnNe8YaeQ!RR6
zZY!_y);||37^Un24T7nyEhkbCATc&{-QsYvZ0CQS&8u740Hlz>Tcv;kvx>l^i8i-_
z_J~=4qr}2`f@h7=^Y1VN23dKSCT^Yc7n)BIV$b<eN#j>jEYNE@z?Exs9&XLIa!*T(
z?Y1Uas$^-1V`-D`>~ww6sk!s4f;%4;tJmk=?FE<RM}MYI>Dx{{ODjKoq&AeHaJuj*
zCi8+rBLq<X9lFB3R5PzHXT?>~_!~9sIn^@9J|9~~H9TCtuyV;-n*dgA7;KToDn@Sh
zd#nK9Ctt&kd!4$59RVYUfQ^A+1`zQt1b0V?TAiGBT9)q0I?2YYF~x|P*z0}oY8t$W
zThvW(TEp5SyVKd(caG!1QaF)QyK9ZVUpH~Hr$Q7LbJP<4K2%tMx*)9s^ZuMiC+C}(
z0Xxd50)OX#?F?DZ`3@*->u6)0bl2_ch@`=h<(TLCh}*kr7WF0JJKxB?eX58}M)38d
zH1p#ip_PK>9g@WY;aP}JAg_vBY>xNSZQ1z()b_G`tMNtn>xkX#1==+bQ==)^LI6G0
zp#kw)&q{=V1V#OsaBXbRMO3Ip;cq^~<tLn8DucC)!C@6I>^ce}D}qxG*y>a{#vpj-
zA}`ZQ9*-T&lpn?S3#Cr)kygXwqcp>u3*hUjINjD<wJuPRF~b!)KXq6Xd1s8PH%i*O
zS)Tgw+??+m`L@&nG}2peg^uS?RU5X<uzQi|y+<`9>WZ6g16cab&8ap`1(<hWNpEo3
z3W)mr8S-Ni>#!Dh^Q&HxpHx6h)51y1WIA4n?ZdOZCv9&(0%;Z(F2R&4Y6;K%3dI(N
z5E?kzD~FP$K3~A-Z+TJB5$wO!4J)(R^}eN^BMzoLV$odIsKqPdSD~CLRvtkJHA2EP
zW!e%LP&6H}Y;7~b9;7^z0Zyt?BS#y}?jlKJ2&;5paJsJ?^#{t6{w>;IF)1XMnZD|j
zylBCzjbI))Rx(4p!%&a#vZ^!N#_=v?(yEdUOOXH`f4oGf(x;YpRU0KAib(<cAGE(W
z7TKdY&5+VnS4&{{Vuiw;2A7b*pqn7K204!_VBPoF*r{IaH=%$_E9fTB=5WyJyymFL
zsqhCaiAsa+5>@B9uP`~Io*{r5#cOH+{f+9bY?}kDRR?I57QE0m0q(h`%Y2E0oz@Lq
z8PC0++R}dV*u?cMHEEm`D_hlWn_ITp+FJ~-LN&Z#6}s$AT~b2kn+@dc#84%8k78%)
zI5iJ5XF_Ti8V}N_bIawv_xQjpH8%pcWG8#)gRJU8n`kt^JR%AT<^7avwu2i71m%}$
z!Rqmh83K|#&mz_mj`VPYH#No0zthS&{q{5lXs<Dms*`(vKBGIGS3O&iWsx`~i`R+)
z8sW0f4zPJq+{D%KTJf0j3&RjrFZ7e0={}GlA{h_$()}<q5Fl68o8~pzbyoMZRj58A
z4RY!{ts+UJCF}+T>v-?DI>Db{xK|uo=x>Q87LF}e!=Y7`A=lLdc^kvXP*yL)>wRK%
zMX%7(2c#;}_ocp3p{4UcDxCgITfdDbDB%%gu!r9xNbZ92EVdhCLPb?2PAYaeU70j*
ztIKagW^;XvKvZfsCGWH455SFl{fMjF^$RsEh@T_V{CuZP(ytwQ47OeE?IeyZy$e5H
zFdm|2sWV1EV8httrDE>U>g)#vK)~)V;TYsvzWe_0a<FSYSMD3}bBDu*aiJa5nRl69
zc@_yib1^nTK(5cF&j1?>ATJ{{=DjOfF)1@)09E{?x#l1EmQ))r?q{xqidqaAn#7>G
z8X-=MI&K39Yd6@=J=l9v(0dMc8twdYPN7(qOM2+flYckih$IHdy{St{pO1r|2+7qx
zjsTbNYg_Gwhz6e_APV7I<JuxMJR(c!oP;cq;H}pjXSnuM+STO$b3M*n3vTAtR|}o9
zQ3#>Dm*?`q2&|&?1Etiz_FPgGcp!?d9uEH#j9V%OWh+)-gG3^Y2FP++zI(Ax{69J^
zpK6wr0>(13?GyUc*6C+n|LQJYm4JwATS~C3^>1O$Z~I>X%s|B9H;Q3k<l<m)uAm1z
zj@}V_q7u^x%f+_V5gU;NJ}m^(;&doDGlKKuoxk@PR7V21(a(!x+4qDeBy9aj06MIV
ziGfDfA_Vu#mQe~C#|G-#!4$N(<%-9NF5H<0&a?pw)%)}NK50R+%TA{23N0O$stN^e
z6(CJ_A7-0<$?|^sE_n4?bNE+p`8#b^&-R3)Nq~ut^ee#Sw%Gvspq3V|dyj-TMi|b8
zgGL${<{wPeEy?_kJ#xPp51cs(7YBblPj+tDU`hCQd6BQ_c^xBWZ|X}$LUHdK1$aco
zJUPBB346t&Agept6a4>JI`43*|NsA2Lb58^D-Dvp9qUv=nUx~*5IJ=0V~-<Ak`=Ny
zp)yX!u^lU$V>{W~v7KWb$Km+B-k<O9AAfPVj&nJ$=kxKn-*314rmD{!sgnkQdb1XL
z1tQaz_}67@Y~tif1I^yRHSzEoGwR(~iU4;{!^fD~_eQLl{_ROd-z&PCv#28KMy93}
zjQ-$vx{>|SL6?~B6)O=qxnaP;?D(_0WPO~p#0Ig**<JkWbnKAw*OvpF>G0b)Tqf3o
za)YA2h7y}O7NkuNlmG4~aE8)ntSwvR5fM5{Pr~ad27b0J<Vb(0@-#64`UHuZcUpp<
zi+45;!D23HB~dDWdfpAr!Rbc>i?1UrP@AAbcN^*0h`vLHhDA#BTdhN$F~vjgZ2?bf
z`xKgeyWi35?CL4TO;Tb@6pnpq2g}WL7V|d^U&Z!%D&~{+^Rdo-Czk6oAH|ji)Iu{K
zBjv{J%Qqh!jvY)V`9>$qfeKLyX!3PXS(xN_RN?c&5$h8@%l~L2e{Wq=M_#7t1`y)o
zW0wX@Q7;=BFK7?qD>{!R;2Sb?1g@f%7ajpsd(5*vByl{?3I<T4v7D#Bjm)p36{1zR
zs8b&~JtB%nEk7gXQtVHsqg2*K!;mxgt*P$?*hp$1y4pB&>R9mPTUy#R&){hK41v?5
z4UVYzZ>Ywz)%`cXxALqFQ(s26^%L!UqC8J-(xAWk+zP<urBS2VvQq2cJB{SQmd8cK
z2B3CJp0thLdltf&H`BYcfdTj~7Ds<w=uXS-z|=+?R?9`rMpYZq8~E1UnSI>r6?6xH
zE-zO9qAS^!+~7kSk#f(Gug6p=x_aJ%H3gDKYY&Z?ToQ!Lilew0XSX9YN~e6=rVmti
zZcc>Gai8A@FVkm@JR9e4{4)!#f>@rUPeBIQYn_kZivC!%AZ|fsK>Q0ZLqwNVZh~mH
z2L|X*<;*VVqwkyhu4AV2lv@mP3`l!R#^gw(9o>2fejrvTd`~%DRj6i8NU6=D2>d+*
z=0z=VC8YYt2jrPcF;VMGy0ALNgDRbq_0g?vmWZ1pc&8JTn~(R0G#K7VOX29c+H%8T
z>jT%}2(-U*=eR0ytUJXyb6@*fKGeRL{RG9*aKE9gwu|13qn0k9tMD(hok3CY>*`;v
zb!=|T^um(JM(7Md;1HH{EcAzU^kzYY<>JM{L>kDXt$w9)*_}}3mazHqwZBYMBITx6
zp~)_(uc(}xu6KA3A)TxYQc{qw0^f3>8PSP6**8Z%jew>US?*E%?W+E6w(0i2$AF~^
zKOnX(hpnwO|C;#YQC4pw0#9EZVj>=rM%V(bRu}G<pzA%gl6<U(3ef*nFHf15r3adW
zr+(LXvW$#VR_X;$K?{GG7GQ-ZSMC3{==lxT2+@#KU6wiKQ$MYHWB#r|4z2l4jPjn%
z^^~!?pqxBfpwjz)+VD972;G36!Z8%%O!X!s#kRJ-(?OMH$)i|=Q?QKVXv$s-tK;<0
z0c>IGH{~RYxd*ci94SBLid>J>1LEK%%dTI($IOa9M~S<AAlH?}kI&cQ8G^CEd@ip-
zA+L75=iCP^o0-;F?P*n5O3-a%2F<H#_DfPBFh;uPC&jHW8>zOtMD~;DMiw&3WSiwn
zp`tH*VD`zHF+qJcJ!!^Zo+bHUNIkhksVT9q;?cnOh?AFIlE(sCF#fpo$T0DTK71{(
z###=!J7K7#&6~3h#{$ZM2c=#TVTDrw*oj;XF2GV?mpRY|D_gKq6!icvvj1-9!!G)#
zRLH|glPHXbLr{GF0eT`pR|OO4?L?;ffp=7}G=uV6dh&;mXJ7sVmQkL;A}V+-MY$f|
z9AqPqD$6aoILD^4Fg(f33DK}AJrmhgU<BK$9PoKtFH#}QTm7#z$j_Uggy=lM7AKa|
z#I+v-Cs87Jy7V5*)rKngn}0IfbO#vg7w;2z29`XL2%OVi*!Nnt!0i@GjFLn}Er&Mq
z2ekZPz1AUQ({+!5IcKK@w!jn?uiS+9zbPBxu#BbQs{rWL)V0>vfS^d+1p#2SnEI@D
zs&YMY#k@JhhWgV{n7+^t*resZCMHV}J;#9k{7kuEbXBv(GqXPUJW~ku>E2C=Q~n|B
z5gn3^SEM1@p?+^_WG=*P;oWuH1Wf^M0zni=-kudxw@GB6=27t}V_ZF~*InwL7aa>o
zl>4SL@N`O)7~Ad4qa-NHjI&;?EG6^6`w}Ls{u))cQRB~bV(NCk{rW_4kui`Xsj9w6
z`J&*E&CiwK9jTy~!XJ}OkoGU$DoO(hsy&UWZx!3op6obB_qtq}p-WG-sBOzehURe(
z{~YiP$xHLXPfErYL>AMWjMc23{75^6>$|i%+KVbOyOqGSlhACDt%4J2%QU77mYZv^
zPBxm3lmgM+R&S5IffjzNg4tNUir3?E6!#~HWC2EM3$SHG(m?LO3nr-=*3@<fOHwpT
z$y4=sH`is`tT*-Lr6af>e+mX_#@C0j6l0dgx!-hSsyuhyOT%P+8lM;KsUvoVAU`sK
z|Ler52RR7PeLp`h)6?>uKn?egoLzY7psly{Pt)_Xlum#>fFqzJR@G`cHe|Xa3?C#*
zHMeATE#bV2bnjT0p<)>4;cn15#w<t;PPX>iog-(qm|2kH=h)s~0{lDgD``zP`>B5n
zb4#znpkT^Glfv;NT8fm?T6g+{kes2dCkd&qjlZwzyV8G_KE;o{g!`UY49BUTztb*h
z#h#4UDj)Z*2Z>dZ+)DO3i%otkt(x8HyWKecu{w22)s!L^TyDn}S~nNqB&+ym&(Hlx
zr`C*<gvwi}j;e+rBX0!9SM_5x7yRG9{S}HK=am!BVzvsa&u;9X#yhs>V(s52n)Ri|
z-oVfSG&3#dl}8#`=3S}2C2}sRL({5768^cX`8pylD@sE6$(#5_kYc9`TBNWocTGZp
z0bO-(pLdMdt}sJ=_NfJH_mai+X2KA+aD$cve=L>x7wBJ))gK9s14VY5{R+Qj%~TVh
zTYziiR+4nxzUqVjHto?uP@G?gBm>n#!rP_MbxOnwx;<X-H6GDxkH%`McB$vQcj4M~
zwX!uYg3(6_O}}@&NC-)+2_D{M!jrFJwC)jEuZM7QK|iDZhYXOKZ2n=hgfe!sI;Rf$
zShwM0<M|EJYq@js;DL~QvqnaRbDF}FvsU%p=NXFWT#Uegg1hIh(4ToHW$&NKuzc2*
z-rH+=z0K8BfnrL3a5oR|Sys?@Thl<`<N49*cQ28^^R?)gS$SJ}N4nEFv6zamu!cdO
z+}^)ruS`r|A&^f%e56=XF03@Lw8E5IQs*6GZ3a6iY6Tubhb?VBoHdWLk$M57g!q<e
z!qe<?KejrSL!x~P?VHtDjLDk*Kio|dLd%SPVG<QGaP#a@zf=QQX*o=n84pEh(fT+!
zXSS*g(PWa;qoHAV(*+|k*yw)eND7d*Ep3i5sNZIvts>M9V#VEIKj!!j+(*_^2C<p<
z&=TpszRy9sswbwW$Ig2Lbavi%)N_}@v9rR;NdRjKa5M=EdN~5Hsh6)+v~nY?J8%4c
zyGTM1@5??VHV|j4Ed~uZ0>qTdxq;4x0<I_Xb5qr%F@juDDk6>fULkRY>TcjaHLf;)
zvl95DDbW(|+X~(Z9PSAmTJl{=hA&n>CjQLGTY&9bl?wiopMd40uk6Lrb3fA@EHeLB
z8HLQR-+9QdR}H(*!2tZ0JzJzFY$nfLuoFU7cM2kbY-K$3vp-TbWA}JB_!3<Mjvq7Y
zn0jR`Jlvh~HF9n0AwT8Y`+77V+#B1H`B8tgoG&oN*6~x+FXFobR8t~UwqbrD-`gku
z^%6+sj$dE<Dc472H_+%%T;=Ew&Jp8iP5*!_IqW)|@be5c&yqc!R10GKQ@O^(^RCng
zcUg)2Er<4l2)oaV5ad}rEYM<w{;Y8b0^3p#Hh?Ocy!}|(_S=7^Ifc!Cvg6$YVmm0z
zqOv&;c1Y4m1}zH^`%F9{2Yi;or1rikCjrHj@o<cG3Ir=b0Z18++@Gy))x|yCu-R^U
z^RWYgy-nl3e(B>K5$SHS#YCy?ONXYx3?8NeD$BGD)?*jq*;vE3Q`5avnz|3z{(wE9
zbd-{k!}v=}7E4cS*KQ#7F}#0It?&_m$gjh<!dy_nW_+*0_W3}>(~j(*QSbU<;+L$}
zcEkIG<2BaL3y@=T;54eZ&r;k#KSv1&y5}RN)?c`>Z6Kc;Z}SI`K#;D6o^M3Rxt-Ly
z*oXyO0t`9Ub}i@bJ8MrMW{YntkFlz;+Z|wNc6h#^!YSNHKERqeK)<`2V|2N9@Q-cV
zIa&vLB`Y8=-yDNjDEuIv{nsKE96toMV=>6V-w5d>_CjY(=+z2*V(eSEQ!4tC!v#+!
z(_A`}*ED)TMLkF{Ny*isU~IucC(#@r_mr2@Op0x^O53Rm14i*%e-$1e;o#Qhk{jUV
zA6ljAlMmnbd1OW?(GGlh<P5*OKeoMv4QN|kBk6zNf$rAB1@TQ1ir@S4*k@;Ye+KeL
zX3$3ipEysDmzVwt1B5T5Twl%5*SJg99b(H=!D0>acqL%}Qo{ec|AgOn7o=m)hJ5pZ
zU`~$|lZJ{AIz>+d8Rrgu9jUXORJLy(Z;9$V2fu)uLZ(18qhm$j0s`;LX=y(*mob$W
zML-0I#vgQ&?#TQc8YB^G%!I6R8_JmdyFge6vP~VssU_MKL<ol03{W!L`fAZMBHJ&r
z`-u4tzZm5SxHMq9o(1Jy_P)yp-J*wXvPLTBA~jgZrJ&B#l4erR+Ab@(+UV~4?JBJ}
zxg~pzO8jJu<#9UeV#kzt2>bzlvg|lH7Dg*0U(=R0GzUDp6^jNVt~v*Y6bkPJGyjRF
z7q79^JbT}8v^dm-`5GDb4Xzc?JfUUa{$=d+waw=j4bE>KqLsY)APl&vi<bV)q3@t_
zaTHiq2QNR+9%xdnt$Vj@-ZU`DZ|D7o#SaAa!VaGE%rq=>asfzfB;z55H*>7@l5{#J
zO@r5}s__rsu6-@>6@Gv&_<u>BdsR|E7JU1?+3eGj-_b{xUR;&^mpQj&vIYavcQF((
zpJoO|2GOs(XDPUYdHoQWssya@c(%xrTEu{GlL4Xs6f*T&iru@D6lKI~vFwwZHbrgl
z{bbW62CWKn-Jws90U5f3l`N@(`Q7hP+<np+Poh0GBuE1B334ed_r1{>l<R@pQOLIh
z{>i?oFqGvn&K@CQ&}&3f=?0wBynA7{EM>T-HUKMH!bOWPehbgp%~;O;Lz8{I^W?s7
zF4DiMP)B$;-o9bMab}Ol!_ON(`6MKXmP*H=M_k<n@cF58h^V@YpD<D3=nqhIxXO01
zW}ES@_sMR+TN9o27!pdGu)(9Q!#R%%2iL9&?!Vl1-m($tWDy4gy0rwe{cyxchKk9?
zdCf={^0lR1a7N`Sh{ld%9+hB^=rXmmy4j}0vQ{$xrEh6B%|9Fp01!?lm&~501va#=
zcw-vzrZwyIvv(R3@;xJ-LFzkT(I<CQ&(@QUd>et0a?&zz{{L+GEQbORVr0rl*$(v&
z8+v=<6}g_>C0tMy*(Hh*TXQnkT9+Kn23pw@Q#`;N4cpL<m=D0PBcf+DwqPRJg_eYJ
zYI_lh&GOaqJX%Y~@~O$GT75Ag&J2$JO>f%VPD}KE?h=92AadBhf1o6Chu@Bdgjy5A
zs0sSsjLuY<hv~F2*J=-ZqD?T2XvKb|nsWUds#L<wU@3`g<jGX?c0c9g_B569=mJc@
z&22sf;AZ<!hOxy4iH*t8phj@_0I!&d0;clb+)wi&8K_c{&h|Fex|r^Ga)g_nkJGu7
z31?Ef0|1>7i4H1MXs;pot}hcxytI2=M(iN@So5`q<Xry`DzuRte_%n;a6KxcV*)TH
zzKOjPf)}xrO~&rno@hNUbc67YfWm+$age8svHdWW;@Rs}l<m{|#7CSr+D`b}v8^sz
zv)#04j@{6$Q_VewBKIE~U_TIU2JlWJy?Qp&564<bmc`^ozAYkf-=%j4ASCKYTjXgA
z@TXV4he&&=be|n>C4I3XE)#)7QJ`L^sw@_v#!YLngfw#y=Rn{3>D>o>SRhlx&nX{(
z^pIDY3wVqSP1p;xY{v#`{k3id`ldX#{BhS0R-@dHuF$4CNBo;%6RR*Q0{MT+QlER~
z$Xr8%u2jeHb&f&qCl9oSO&7MjdKpZ`=du5)K@Gn$nn4bgU<~B8?2P#6FI}IGVl%m0
zXPDe_GqzV&)*%+@L`}oG)fE6%QnSs$7O+WbeCFWS6~)z2HjM812B_>tQMP~mE<%@3
zmHZkVO-)x_99S?<-rD(qU9c~HjC6{%h;z+T;tW{?B4tshULnsOGnb7hgA>kB8Rvr-
zv-MldhEd*OU0A^|X}s`{razvzx^cPs{D*l~6i@j;aEV5clh^*Mcixhg3`?p%x<Gd2
z2_r!ewPQ^-KPTHPS-#lTzTez9{}y$=zMCE6)|R-0eQ(*!qBWF4aUJu%<YQ#u{+Dbp
zlbwTi#Wo<V*&YXyoVjAboyB_RQTJ{f_l@1-SEq^%ZJx-$?N?8Gx9%WLFgfbEw8Y<M
zs7<uQ9v{7Uh321q2LdWkQDFuydx8|3S03d%NjFP?udMAk8M~IYWBD@StFq85OxNZ^
zKO*1ZM3l6}3-Fj2CNxkz?3gA*aKU3vbKQfS^5!xuW0zbzG~G)nckcMlJE=kJo2eoG
z@*a|#88tV@y)$1+rhS>EwPTSj47DuHok*fg&RE>)W3g#{ahdD-dXC}R!P(K#o^SA6
z{8CjJ7`?=L8KT?`&zg6)y*#E%8Bu~Wr8b9vI?)Ap+cb`_<%PWSMM1}vs-Pr*k=R$k
z?69D#N_cq{eRR19RqE9&cX*56Famj|Kajh0gD0MhCN7&V3pbx-YDnCeh`s8nyMSzm
zpJk+UPiYo@vogwU8lSs1V;}(^p@vNP92pzDHq(3Lkach^V4Fs(EY<|F!}oND?i5w;
ztp<FlFTccNxC-k9#(;m|L1#qjfd4S=0G;ZJCEeXfKu_6A`*WqIAg-JGRee=N=hKmW
zxY)S=-X%?7!N4wg`K-4H$oNZzG|bhB=&nq}Px0)B99E79@qQ(aRzS$6O~r2ft?CVz
z89NAAd0Fp<@12i)1B+X|Atclg_(-5;T_}h+V0sKwuCS%qoPNNs`7^X>+!B8ESU++?
zStFzyv0Y&Z2YdhP-D)M@I<V&9b8iNTMep49x4P0GPzX_8duHrqp?e@<t=74Y)qJ=A
z?fi|5oQ_FeM40YeU;^>GzZQKy;1<K^!sE5dKxw)wzEWWfy@!tm*4qP&j-pBQVBB-~
zvWdn3V%sy#<7X+&*z0$-en+sv72m_-=p7Q@%#&K|F!CK+TNLT_F=Xcwd@v-SD0MU2
zTe{<v_Pm!$T-47)s$QO<(Oz3@^_#LkS3uudAKR5k#!i5pG?)1&fqiQ#f6e{HCUCQT
zQ+imRSnkrMu4!1K{V_kzm9q5mJ*(Cy7r8UZJ9stO^|XI;zNkDmyZ0o%EN{C(Al&e_
z?Y~-9!UgV+L`ZSM{eke|0ndw{?z{Dq)cCQFA<B3<9(@Z9t(@fyj+4pSvS`cZVnLoC
z*L--ZaHx#^I-i>Pk>Ug58cfGPReG1Ha{h*0D8IYIu@{%;$8*_r?#B@SJ+6Pr3GLy4
z9-7+VqS(84pU<<rdIzzH{#_2eb$BxNWanZesE=C67^8-^y1F)#bmtg}O2*oC#4Wux
z9?D=?@n@JtsmdgFiDaeFJs721MV&@xn&KOZ4A=FNv5Vd0w-Lo;YCena`+M9$V_gK%
zd5HS2qFCP*tFD7(CdBR~2nMgN_JAbWr_9urHT~(Ny}?T=MTEC|k{!6Rs8#~6BR%rP
z$6|1enjzk`?5UbvSWI{lwafAYD^%wGqyp#f_1A^2VHv(+&@2+~K*`6sv~pyh%w5>$
zRGW)P_2%J*e|kbQ&C^0P&)82M3pL53>U`Lv#-$63>0k?YKH{Q4AkJ8&ufoL%=od7`
zvGrHky`W&#|NOZBd;WIwKa1WCDq~#R`*&}<WBbx$L&a#(;TSO16sz*}3#&x(b^Vg1
zjiG+=otZ3^I$&F&g@&+<F);aLV>g^-OiUn!#l8sPppsDMb{Vzu=S`$;F+kRcW#j9)
z`sU<UUx(9Z>aJ>VjK%EHm&<-ma<bzc>EX5EdFz+`wr#VL@xxd9|0M3$e>b-D(I>E%
z3#Ok|uJr_dfzfyfswJoEm%wM1Rt8FC7y>Kv_No20KW)l%+hi=NDDDDe->5=C<p7As
z3nArugRqz=B2!62IBdH?oeH5JvP6^R5X)J~=p^m|*t+>PS?2zlu&Ad$+^O#!QTcmA
zW_+V-YO5?BnLQn5qj;X=)3x8z@mtftvfo$pgba6n*-~utY{c#8^$NCJ>pUriYZ^IY
z0addz((|5)^tP`u+X;Z}nHE9B@{F3?Ruibp|26UKxMpK>%T`}$(h-%bMtXCwOf@34
z?eNYB!o*mhtCt{vzj)4I@ht8aAgwXY9<&j^<-vZ<irh(AAf1Wgc@Q!Frr<}_Z#<&b
zZvOUv(-0rStz>I)l#r$BxA<bN5bTtAqYt3tz*56hv99oNT7zR4EoJiY?9n{$jJ7mn
zZP<1j?;9QA;zU=eb^~;KCbOL>Y}Yw+xwr?tp*DWBVZ*DMB7v$Fjd&(6tk!nF_c0!|
zC1~L5aI6vU64upJsMTnBzFBgeG70LQ$SrhqAHVvCDK_l%QPI!#=oEWa;A2a<`Brs2
zUr6a1B1cErL^wuKFm>c|=Xa9nDazh@cSje{E%;6?#|3+ymNi2LE_F_Cvv%_I@3Y!V
zEmJ1H>R;T7HK(YBL^=Y@SYy{dhrS-ghaQRW=33&oO&w8o-s4HownpN=l}6W18t6}^
zXx}69kdMJ1Bn90Rhx<Z7x12FSKS;A^mlFEU+>I=JcR3_39{ogv*Pg83e-shB_JkUu
z94$CVBATA!02X9q`L$2hw|wqRitE)R<A_ulx7Of?msAG7ILOy8;aNX5C7wrzNfSC<
zxErf{l-7*Eej1knX&7gVFSlN25s)bD>lxm)T~Eqfoo4s%qUVH$kgx_S4msG|w!WdY
zya`&4{$F&8VAoQuciu%9BTb1g%X*_-ol=x(e^mx_T0C8v6_=X&FOtWCdfINbC>|O~
zRo&sEc`(^*miHOQCH~I)eeS`e0$I>xLV95ucxT_l#f$!Z#<b#kGG-M$u^PJ6jR|Qd
zypn8!>}}<n8<%hJsFlA(98uq&__gk?=D!MZ{SkLM7RvKuJ)ISgU40l9tUB1Wv!g$g
zhvoB0Nl582@!%l4|5jP{LoTl4OzYtbo2dB&Y;mIM(EQfUmI)nTmUf-oYtmJ`hbUUS
z(}ts81<j-&3oxSB%BU!<bMhPLQ&d>s2a%ZDQPb87$o_okJDIAaOsP7VyXn9p58;eE
z9m}W-tcL@vSth{9)DXuX=Qsys)Ux{}p9cMF{1994$L85GzQoWqlip%d4jJeq2xJzI
z3k<Pwkor>J$wFzrIUz+MhG^$5h)9WC@pomBfB#~RVa$hs?F++cK|>|L1j@{qPR&tc
z@!XcAXzjt^t>;P`s;kUfJBmGoh8_2)v!~I}1h^(YVV8Y^ZK=Bnxs=Y*2U}q57Yj=D
zQOAfr+@CZ{jIB8h-NpJs@KV3RD#NsuIB@!y2Km9UuOsQP;I+>{0Mh*}kb2<O+m|{4
zP5gw>B9c|n0W0rHH2C)?r^b-Ak8@Ixl9d?%*}cKEyu3jAN*n%Tp-)!?CoCSzDDe&i
zbDM4Jbd-#w-yN4it9LgT`6`{4XvF)9ZK2Eza^R4tg<{kK`73TVi{jL4^KBVhdW)8M
z#tXkw-Gc6)%?ymM?Y^`Sy?)j)Te1b$a*12U&YlP!6dR4`cKV91@2<zU8NLySe#!wr
z23zwiwK$i8{&S)LEUzbqi{CzVgUim|kWsMX^_0uz$>r29A>RGr(wOL*mc4a9Oaj(d
z>nch+&(Uoc!!`|vIW1}IlIKxn3nstV8CNnC{RdRS&I!i)R!4y<I<>dyEloLmKZBN8
ze3tvq3j1cfAvR5#;Bv~wuTZ)9TZ|ztajmeHRK#It-=iI>3E?!)@M?=*Uts0X1`_il
z{uXq~Cd|Z~9%QF3wTu*0evhVotqsu`hZt0v)oGb+<|5lgH0tKESD(O-HkD3Sx>|Z$
z@BEa*rTwGD`n7DnNj2e=LH}ho@l%t{{8iC5w7(+K#KwQO0qj*GQ9~`<;FYV@VGJPL
zc2*khfWWp3J5gSlsqvV`YYj%T44c0|@w!W{9>t*c&QB7Zr-;D_AlU&**dK`o8GaBk
zr!f$~DOED}gr8y5B_N2d7SNAOX38f+`W9H)A5gi%AvjTL^XVQ88t*;ySw>>(?;GQv
z$Q5UIY&y6HbHCI28juFjw(9!?EXIHTZU|5O4WpcdK6&+2wkm6`iOajv?Xx!WY#1z?
zk`J=fpoaH-ctjoJ5+hvNgPnzgJP)=P37~Y}A;=WJiNY}p`+yFHk6@E{Ui2EvkM3OE
ziaifZhty;!pGvf-XPQ_LXk|E@eD1TtEg~#?`cck}MhP-E;RTyN5o$}^ERFJ3-Z6VM
zu_QMY=9i@1p`M8A-)k2(zadD&YvCyAvf&tC{d5KPC7B75H-Mt_NXV4aX&YF^7Xu*r
zf7O4^PWq;;<~GJ*S~?ACeK+IM4`l7sAMi<MhCTJ5u2CCGSH-Mg78=jis$4m;xjI{U
zHL1AwS5@AezK%uar$N&XK33DhMr!DFknduAvpI)Duo=)8%c;B)=$8sr20^6e3Inof
zu1Me?Y@AoM(!ME|%5RW;etG0Fvx$l28|kxSV~IO=?j1}Dg}DzqUBtE23el)g+fD7V
z;B&Y7+&KWlm|s4PWG}D_XKv*lee%2ZVM2*y-@gGJ{(jQXdank;Db%8pq7L#inizcW
zn_B2k<ET5kpWu?JG*T>MbE8lHcF>eb9?%}lIE1<F?#%QbW&jwJe_>tIHFC<n!k!e$
zxOxy|p2?*G6qXO@mAMN+>n#rG&-+^-0FL&|M|${5Od(-r3Aycqz}xm+zUD6|wu)jj
zk|bR<9P)*)X84<Ls-F0-d<|2KrCmK}8gDR4;mW3I%Lh_6Z}R+?Pd_1l0p{%GW%;7`
zO&a4e3#l}Ev6L4E&A|Qee%EN))lGkzRdZ}e45=WdG;Y6PZBA&z-j8?f_!Xl>oZkU_
zu)uJRxw5VMS9c25?f{ZcP5X=YSQ*fKF4Rk;hhaFxTOkomHa35N`-b~QD}mG>KYK6)
z^&M`7aM#X{4u#dubB%)f^lzk>^il4Eh{+J?D>4&o>$gIlAHzb`pmwkIkyjXOpyRR!
z^94b|%IrLs9|L3fa0o51{*!%x6y(ZiyfE?S#~?<c@eWmHt1|`>>wRMsDWhW;GNO`^
zGG-TTvJl6scYfs{w|yO$PsJ~N{=8yx5mLv3t8WI5C7|V}2^lAq=ZBWzSU~ZNPaLvC
z*D>m)G{bZT8d&_iOX&GtT|$=7#`Bdd1Pz#2Oqmn~xi;$*va4F++6WNV6Vn_mqoZ6O
zEhUrQOUT!L9|~|Xe16eKufnl3`>$m=@2MU{a+S2!&ZSHIsr@J@zno5YdJ{PDx*M^(
zd|2O7h3m?4(mUzx2_?F@&;#?-+~|Yc(r#X_acwn0Z(238zA98CF^S2N8?Tp}*E_v7
z6DHMUyokaJ&9hCXSstT1xDDq~J_VZX^koCSk03={{K?kO;icA}A4ABA0<k6p7sOSJ
zDgN64g3jfb-0N;WDDvfWQbMk7Nu5+Y9)vwfAb&eMlJyhGLEiI+&quM!?F!()AAzz`
z5vU?}j!CG^lJT6Z#SG5__;ezG-p%LUEp8zo-d!?UZ8M7gy+i%&A?dpRR>kfag!9U6
zDuLspWr4ilv80IOkNf<3#B);dNzOCo6Agm~YS!b6mmx4qYY&76iBD#M^^>LlpcJAO
zH<>cf(wN?dJ<2Q?BQN28qpa9MP}ds0;wn(&ro1Y0bF{6lqQccGPNW=8;vP>?2cgl}
zmJLVN6Q4+l1SVJxz@D_u&%=&(_n+VPU8+ZtW$xfTrgHf)zio5-&zrZKp0ASPps&eR
zculc`&ic+X?SF<X*kQw?M5-bg($PsHj5H>i;Uz}jcyt72$Rv?vnOXX@4klH*qa6oA
z#HG!Rr1^(nGv|uiogUs6gXi~&*m5x6!O!|BPwL_?gRo9J3k?H!^(OC{!vnt=alaXS
z+SWQ^*@`I#`#Z2J#*I0q_|wRXO_U4gz&UB<U=7($Tss}pq8RT*N0OaZX~8W1rg858
z4O#cu?}?H1t*QB0W1w`N71-;o?*DIur+7#MfjRq69IyDlI+ehm|A?5SH#!yHi;Q{m
zf4O;y-g;ZAE@xGD@I*c4G0+#?r&tG-q-Y1TsfVi39;M39E!Xl`-@1z<D?#>u$jx8Q
zMH$7BZ=ImLcX){q$%Pw68F(y{PZxV;`$ZOUV16G|k~%TtUn=htLpSmg|BcpWw-~%?
zY?08gbULr4cD|yO=-cHQcydd|e%?SiZug2ouuOc7(5??IA-%g_eRi{KP8!-zWc1mY
zJexF&_9N_Kd^Ai<ZZ}oAoF)B(t!xFSjMAkft*Vw-?&f9HoBiR_XbhVIb-lMg{$ciV
zmw@%k0o`lLn{bhf-+hV@>w5*I35V<F{)#1|*5FU{HHBRCpJlirwl5|*?hDbVo#wwh
zKLJz~Jk`ux`21TZN5$)KCWQAJmDZ3X+rlr1?cu@FMk4@3W;|Fu{3J=!fR<_aw`r5=
zSF6%tq-Vcx^XC0Zk!Sj!*RX80^S7adKS|PD5=0mXS^l{X%?sU&hRvRT^P;KwkBEGF
zLqD?R{QQk)olT^6{?;%4huV*CIPPN5eu>*eP-g^vkz_knkQ2u#kK*lxgW?~s<pAb$
zG%FE<Uibi9f<Be-MBJ--XQvYg*@KZk&@MsQrtEu6z3i=1yaQf=cS%)vvGn%q3uaIG
zLTA>D6HeS_Y02aBds9Cd=oTP4h;0aZt_ZXIkxkxiU5Wtaa^&35`c)blrVHq^hE*<`
zFvj+n2m5Y^X6?QQM(DH!2fHcQz1=V9O6u5N1%*`M0k>^(j{th`*23;u(o3w}`fexK
zb0>C-tm)!kMAF{B)i7mJ+wZk}O<9#g1A9Gu_fwEo`ECY7cxKO8ZV>aGpBx=<n-5pX
z5x^b4U`E{>4auL?cjw=51ezO*fyu*-NH~+y3l;F(yR!CFtdegE6S%Y6*k|A&A69$s
z2REPa`=J-U!viqJRTNFoB_n)Tji-cA_mZiXEqL3J<|O$N*{0Zcd&Y?mm0(;@hUbCo
z_5yw8Z%Yra{B4$y8nik-?>zdG%X2Txvy%VI<u=<julj)93zG85hYo#CG4@fR1ynBe
zhV_Pp_jDEIaAq@bFkYVdAV)Rs>~^)UnL(bBmEiMW=X(dH3Ak=*<Jf>u`=}%Axc@mK
zHvxGauV>qs=x3j225M6yeC_gc3gM4pPjAd(wWaB%n4(d~m&T<H1Zt31`J{PzJ_efo
zaltuua}hEI2OMa3BxUxWA&r>fS0ggV2pOjVISKTQi97?Qt1Za{q-_*ls+-_3LtqGO
zNxV)mm7eJA2+`W6C`TROT%7Di7HZ_|QVGGrAR-2-YWw}Cn(E8oCZl5*Zb3Kug@=q`
z2<P3Du!i}dT7@SDvP1lUr7-!>*6w{+3RgqSjQJanp(434QMh#o?kQqB8#=ag9;k}X
zD-t5hfp;#jG>xh6y50AU?webpSCsH(sj=-===a-pwHs80gy{Ze8x8OyVAan1dR}_(
zv<WD$?5*_3d~caOcm1zHdr6AHg6^q1=m=8$RBYhstCIFhKXZvv1mx0`3atV7q;;&T
z%lUXxG!VE6O=Flci18rMG+kzv^ePMQK}P!Aj?`ly0jh_oFKqIPqbJL%BMs2<ggZEQ
z!hGz2ExwBpl4jrBsUg&(J37xm{*PrUnV0|i)9$~L^Vm~={O`I%_SNKfYtw1K|4vZk
z!;s6CVs~7AcB>a~6OMBi5u@qTEunNS8cnP)PsimNljBUvBwgk|!Me$ppEJv<_e+}!
znYZ%(dRJh$gSP9!<7uc|!KIq|@WK;)#odT4IUifC-nk@->CsWjYvQw2|2b3#=n<c^
z|9xq^+>kPuCo(0~W^tW1&Gx|@)`VrAY{XA(eqmC-(7UKxU9;$ZKu|H0YYu#N33<=(
zSDgOkhVQ%Ut#i-?<ZJNUt8;nIs5X*?Td%|HpjTq0_lPefyp%069O0RG5}N_d0eCXB
zoKXAwu<FcEK6nB$yg}C2U`Zj-|Am)kH)F^{hQ=Goa=o+XZ_iwPavcg^i_fS0i@xY^
zcwine-JPqP3^(N-9**4o<kPi0GCKD{uUK!X(HMP{q<>k8D?|U&U!>T$Y326Q@lI#^
z+}g9rq}e@N&j=Ig13GBntDx;84^645?!NVman#?7S$%8eohqjSOJLyCEhC|2eA*DL
z`hif|gH+v<tlyMKF|=Pe)eI1Eh`EQMqI~mgx-o7yA6!C26!~+&9l{}IhLq>oEs@O0
z7Q%dct?c(kkh+>O?n2=ZvO!p5taA4jxV-MsT)NNIaWyXB?7lFB{PTkV@{ixfB5WAH
z3A4C#Suxsn_>YUd&!PHe;!*BQ$LyO}lR+*X1kUwJAuma$vdh`f7k>KQvgmE>EW27?
zT|RQrTM=ivhl*Eak?D`Mt?n7Js)CSng}o*Z#l1=glx$VB2;T@{+6?S=_cLlcKZU8p
zz)Q++lP=aP6JSH#HcangWtZ$!fbI}I=Cp2|@FavYDBT);Upepp#*NRS#dOf;?ef_p
zhF={y$XJOy`M5W?HOjH3w)^w>E*VizcM;z!yc_DHpqCuiDh;yBJ1Mh<RFX@pYnQ|y
zRdBRp>+)LQKIoDCqE=CpZxH3iO!COAv}^G&`3riy{A_osx3y*XlWHq=XZW=5N!Gae
z2VptTiD^R_!nvBLtk-QCeWdPHqwBY<p$56y;Gd1WXG|m;kFgXIB&er8Bcoa}K4Tv)
zUHEknvy4@0d>r@4CwQzbyZY(@%JOU}a`C?1w~QM-7XHbdJXT#9A>RA0FEA0iXAk)7
zh<q(iSkIo{g!m7<ui0W}J~}5R+r_AS6)m=LI{LZ%;x4dw)WE?6w-O*z=ddfVSn`K~
zwz1kmIHLK*-GFVoaiJ~`(CCoP{G}UcuUODjh4-_Vt%6fzDO`~pLA)LWY8R4RfU)Sd
z(D(?*%!|8zcCf%nD))&7%{E}aqxKdiP*dbQjAajpLEAZHD=Zpt>&}<z9h+7L!wt1!
zK8=uUN`TGNty*B|3J@_hUgiQ}GrnQb^qP@i@O((zec6kmYFVMqaw$Sx!QuViIvOYO
z->g;JXL~;OviNWf#PPEj^nV|?$`+I3E$g@aoYwkTP(bVX`vX%qDM2o3K77J<`q|0&
z8$eFVtaR8q&n{0g^^vR<lJOm6wmGIx3lLL5KPB<4duJ8Gk6fSpNLXs*wzum2N3Qbe
z>Q}k$x%n2Z6vf?mv~u}$%Sr8}?u{k*r?7OxM(4M^^Vg-MMHvAv<m+v3;%d(~=8l@(
zF-UI^ZA0hpvmY|`3j&26BC>y849{fjF9NFB<DhLbglaJPBBXRdU`e5yWk>rxCI#a=
z<Lf|wWLl=Pxt`8m_u38lRam^Lyyex#H3_GALk<P-h`Sxjf$5tTc8Q>cM@kHzEotZc
zl^SvnW`~&T#JC#e=RoW9BQH<KWRKj%8WS`Bh0G1w4J_LVD}Pr`nX8Y!T~y!Nbw|N(
zyP@xbWY&tF!k$q{z;+g;btx+|66llM1!!EKbB({o|ND=|b?qDOt2VyghBfCw$Trvl
z+iGx;|Hs%+y|G=Mi2va&kqC<006i3TAo<Z)8z2%6uD|iU9K7#oEttw;;p<>PPzYbV
zMQ6Tw8F^^OUQ9>9a(kZCvmL7X5#ysjTDBxqC!S84q;vo~Nwrh2Hbdbdtl#%ADT?4S
zSp1?)p9x&IW<AeuxyR%B(OCzqG3w-KlsG-4^Q#+ROMccD!v8W^tFA9M8Y89)_yn|l
zy>mNV>-3w*(r}lQr1bT~W~lZ7Dx59gG6yyEeuB6C63Y5>rz0*Xqx|0|?=FH)Uf4Pr
zeeUx!3M;YT=+bZ$uV{6b=^#V#7H<45qKmgQCJDzV=ldW~%*RQo=2DG)#o{et|6F%|
z{Hsax$m>3RCoj>efPXBH8#g2p@_dk{fFFD+B$%AD$Qk=6qfPaNN>R!Z&A@{;@d-~T
z^O4t`dhrln{dtq73bD6~dP<?B_cWeNq^>nQl$QR=N@g=NNs%=A-H3gs#~6Gt58Sx!
z(EKL}`q%<Uf*gyyd|8}CwjCv|U5~iDMLIhZoq^XF{4pN-Yo`?Gv|6O~d@C=U7pqkl
zuYCx_S83<?G+Yvr3?(SU<)@55K8_<fKI7${x?0U+Am0;pnTnfc_Qfz(|JeQD>hiU7
z*S<Nm2sGPlRRG@(;3c;>ZuMG4&#Omyr(<*<A-YlxvNgWG;kQj-^KlaCSL)(>=)d7Z
zxCum&)S^6B*r2n=RozGntBcBV=eb81o(q9aIX2sSF^L_`>#U!!d(pfDIQ`O{@*`{t
zt~rUUWW65*6+4+MOHLaUnO9cH;2C%fnVJu}r}XFVl4!agZ-bHP4AfNb-0R)fyk6NF
zZ(vo{2GO5;F1=Y3$@A;MN=CMTvpp4|nBS;z6(&fIzdrU1>Ro$EZRtNyOJm%O%c(Q;
zcjqsUWzJJ$>_-LHvy)J<>AZV>tpkCa0JFtsyJ1fu#zlwT*|qz9y!Rzw;#l;$D!GmJ
zK1qPzW#vN*XHQH0QVcUNOw)P{`1Xu*9Rx>#{1asmHzZxpBL3k?>~E{ifgrF**H<6h
z!hEJr`JM7LB%_KtEAcn^k||DO=dxNY5kBmg(xE@^9wb(8%kQURMi$g@ebQCfSOxXj
zR`g8K{;v~Rf5Y8t)}$Kan}cicO?f=v7L9@f`Ds^=ZVXgx|4Gvvi_$doi$Yj5h_t(Q
zP`CaEVc?9JzJCO_3)vRhL#+p1*t^;Xc|GCV>1!iWAG0XyUDIO3c8020Qx4YP4R0#J
zC`-?c6e%m%c-hrTRKSmpjaCrLZkxMbK11*Cp(L*r;HwP+Lf`wW0EQELR2eZ3Ng1v^
z+(8Zu@0y6OJ7JVMsMunvAZZs1Qv$U1<_JpM<j~uYG`w*{1v7k_>!fjBAZRaDGn3g)
zmvNKmmUgjkc-O<M3*nSQaMD|F!c{JDUTvy+d)AitYYgPS%2OK=#q`>4FZ$?baCA3D
zy~X~Z!p;M|^pVii#hD8FqUPpc1Xyi@oq#d@W$*RNY#PrfXY3-+%{p&0eRN^J5}8~j
zJiC9s?~))PdPp61{cz=&>WU@zfv$Zjw2fUpod_ImVhk8X;nK9OH6L?ViDXqNeAcz%
zXP64!f$1<SrskahZ$I4@Sj<M#385}VrC#d%1{t*+5v?BtAvqMf%^DF*_f~)Gm+5e}
z)t0WjqX{)+so&{#JoWyZ^f+dQ<ZTLrdRw-`=H5Sfz})wf4k(V_C9SlFG=;CU=k>#c
zPS(OZoJtq3>btxoq0+6naN8P!_3_lV_h1zPRfBKMF;m6^wkk0wNN=fGNTHmMDVN^`
zCrdNacAX?2+<e*Gb&RLffQjGO^VQbsY)+i16F^5n1y!CN8$|Z}P|7%2G}oC?P`O6&
z;om=g&cca0w?8G~CmrQ<l=)O^m&$T%qn~{a+)T*QWJ?<{XohK6`qGf5F7|q$r|^?%
zU!Tb+2s3-xAS8U8npxlOwoOBR=ul-s=KjM~{Fn4IzTF~7phU3d>@f)^)QDeW)&5w!
zOEz6@)j#a-R*s>}&Lc!TW+O(fOI)>kH-oG_aQ-EtHdeUQP_3?-*$44(=1Fa0ka($j
ziaNm3P?-Ki%LWW5^zVHKoshL%b;~jJ2zEp$C>?frAcuVF-H}qpzk-|@VqXj+NkB@M
zkx@3?6dw;??l-2w%$$wSzA60RTXgpE1e|b<yVWfP704~sPfbP^K{>Mz@ndD6fy;0v
z&WSV1tlC#lVLA~Yq@U)kl6CRnmE(0yFqt)d;mT7FQIKWqN8~-7t+ZA5vzVS_Cyc2I
z(e}@-Fb@lFWD6%-!1iD80p2;d7v$S@5ABt0(V{$;>JfmEi{l=fbVnqd@?uET5N=z-
zlTLUbTnNXoS&TZ6-{sw5pH@Kfea51ChSJiBvx-7As+o+Cf&(Df9X;>|7^sj~<qv7J
z2W+<lRs=?rgP!7|tM=6=IseyN!|PmYo<9#NPMGY|%nj3MTzRD-OlP;9k)eqc777&c
z$?d5g?o)TeOtEC;l($=n7%28f?*a<;s6$+z(J<1Yhhfp2UdvV#XCBdX<fh-Y5BJdz
z2@8mIdK9!aMNR3$DZ&y?GE=zzF$@iL*XOY>B111uT3?Pb?F=^pej+7rc7F8B*}`<v
z3F=^VaOLW0_+mib3bGN(H+h@;1?g)0ysDsz?K{qu(fS#t^2j)ZnD2^{*r~%PO9^OT
zlQJ8&nisY~=WzjAvWN`C8xuWU2*&X3!$7SVzD6E=)xH*DJG3C%_X4o-ZdcbNzT@|U
zjD?WaK82Y(_p7em5n&chtN<?}OHeMLvLtt0hALx_7(=6GhmR0MfXCTy5$U9Yyqb2A
z_tsa#-h6k&vTA!_+w4%<KDZ;(A@azlPVgsuaM}|huzTu0etADxy|^$tv)Sew#ziX0
zYZqm9v>H(+Q|AU0^4GL~Z$0gyM99@d@JB4SnLe}+886e@BN%AS?qBTDJtdR&G+RPI
z0a@|lAz|sqDRK3cZuU`pQ6>l2MICq$JkN1JP>kG-jnlHs98pf0K1fe|hI}1ls!e|@
z-pwoXjIc4*|6?;I&?7|1um7vD%dL!T!@!iN*=86ULKo8|S<ZZDD_i+N`d~8qd}!?i
zzTP#Fl7GnenGZ4dxHp}A{+yFExonXJYf_3L9{t0W^!!!-?3QR-YM7q75g?9J`OEov
zKW{_<I&=)q#qtSlZd_XepO|mL*ftwaLv5u`)f3%4GLr%v4#tbO+Fl7I40N~vXrdT!
zs&aC$^O$0Nk}$-7u&GfRym2{-hFGerVp|tt;0MDzV+v}D5jPAH;|gtSAbe~3Bh|az
zEz$5R^!)VkY)l5U>0lDyo_$sJ^ywQ<sQfr!ksy4&q<M!(#CqlL^U_xA{SxV0=F3)q
zp-(UHlUC;0o_N}IXW1A8VM@#*^Nk##)M%#D3wU^I(|@HwDghuwZ2Ok`KM<PsciesL
z1P6%^UM98;nOQk=Mw#^I=|uvWR19Ezg{k=H+L1cuuqR3hWA{MeH$#J$Y(WLroHHK~
z*=PvNQ-nmhfcv{c0TVMedVE|_?R(#ogfqWA^;P|;BYu9o^d1b>?2uVv9h{feqa3%n
zdVF~imO(?YZ}q<0lvwXIUJ_a%HLe<(N@W>g>`LPw<E2JDS1*k>ojbMxtU{t0aMRD|
zL~oVGHd6E&tC#Rx89<1wkJ(A#L737vj1T>#neYtSgNOmegLoazcv8|g9a1A(AZCT>
z{11^ShS{a~Cg#aJH#KA@SYdpTf5M`s8Yqfl1T@u8FTk|(o0#2a#4!qllq@D@lZ}hO
z3gWc&?!IHr?$i8Ic}wn$ZUip0BcL^*;wxG{%7kkcpYhICr)K1B)83Q3<ajg2K<Ag^
zC#FZU-FX*qY5AiPr{8e766R#oxpva{20RF+FS$e|qw=M%6V>HZHJ*_UKX0E%nNehD
zdsunTq~PhV^A7i00X9}aG*b`fn?Lp~m}g-e(Nh@zzX0K_TKx=Vs6>sct{ixT%>mK!
z|8xK2zmI}RQr$f+!{C))5wn}TL|3%(Iz^9)n5tg#?Ok6D@eVVn&#3*TvYdRtywJu!
z&5|V38yjZ+%u)*$c>6C{$>$3Y{b2dY6rO9NB95!|i}5`vw##kQk^ZR9f#VC>z8i8C
zp*;R#07c+i0k&ZFj&4nT7pf2Wy9XYnmGb?%Bi;;xEDPuq{j7BzUh?HBz5pR_Wfbl+
z#EhDDoQ(xIEw=$q4(&Ix8N{bSPTFCSVWFkRp4{I0u`G%U`jc&YHs0ugmFXcoO2A;N
zDU05Mi!bE%+$Zt8NNGD3Ku{)~m9KN>ymvBu5t#tAYr<aEjJHUlDDwhJ;@E<i)>ic%
z^#T`t6Wk&zgA<MqkIIw#9+Mf#GqT(LFYh1jTbe%FWf+vUvQ@Q??0+TrEbH|;A0wpM
zKfpRGk0+KGZ~$n1{(pbLA@J!=(;IqOKlZy9-7T6W9m8{dnv9tn8En8;k?r(u@=9OD
zEK^?qE8d|5iONEMceMh;JZ8)KUo7=Z3J(a}J-sKE^MFnD=MZyHSrdR`1TqG92$Q2G
zX13-^-pP+$+8w`$=Fw*P@CZ_{&=#FLg~iF?<vT(C{7YNcEXj{-Bq!9dUYVh@SDPx$
zmtW=@&_luUo0fdg5LDf#JKQjUT$EX-^tE^;yi?O`7r^1$zxj&3re^~3Toi6P8hzZa
zw+tQYeN!}yMZ>7D%?dMvG~;8Na$14CyKZo;ovELoV*!I2weVGF@fniX3Kse<#YFMR
zi}&)|({wrfz6p?)&dV~?3Pa5@>en)QVjmkj&j+}5gJ~rqK4#@v?$qyEQ2T5*E4%Yp
zkfs+~xj5e3Z(^H%A8aPJVALThCVoilc3hi|Rmfbd$N*kmNKlrUV&9(3ga{BiPhiy(
z^fzq!yx%x4th-9IN?FtddCHXrj9|{6dkM-j0B1?_?zpU{001pJ+~DHN%B@S9e9C1S
zv9!iS_n|Bkl^)LpkwUfD{Qk16YaDLY$1o~>4L@Jl&mcOKKpO<sPO>&oTeEQJG1owr
z^tDhyd{^@GpX<n+qA=%D_(Ik~(N8WpEl9ocgCUX;p`_rsP<09RsGSo;oM?=902P+=
zmF&Usr`hYxx6IEJloc5ePH|^LU#V|Uu<2H_Bb~-3Cl`&4yM~!77S*1|WNyZ0$(YxQ
zpTP0!y2lQU6kc_XUhtvtAmqxFT!R0><Xrr-a?j9+<2&w%*7SzTN0yWGDjrKu>ENsg
zCsPt)UF>J0%N00lqrCSyRt)U7@M7Rsq{bOqy8dU2ESk7me+DwzhAX<Hfu$o$L<S<@
zV&um{bIbNY%Y9)9mh>X9Tr*bg7gn@kz6iogE)a9rbEx!zDWG_5bno7npx?dTIBuO4
zuMv2oe70CL*qZ;dr82v!nUjh~^4KR-<Kg58r}sL_pOLrMBTJuyG8zBy{6Dxl4-n$>
z%kN4QBU9MZE@Y_C=&?QVwqPZJjPAzm=J9Gyg;R>Sxni3k<ehwmIi1>%D$AikUl0di
z>W#L*e;q+%A@s8gcSMlmR?fvAAVo?iZx+??s>`Dn`e6Ah{5{umDB3ua*L?2Zin;>R
z*H#iMT!aF3OSa!P&2&04Ck{C=61H~^RxSmJ)lI_X!sX)8rC!vhlVYkP*MjQt&y;aL
zr+*ej+ZpJ*BYZN{YC{Hg=cojAL+w={cv!uM!x(yks-h4c-P8F4^QcI1&@`s)P0TZK
zQ3m8&K({y#M8v3qN=^j9Czp&Qk)dbb6HY$oB&K29Uf{Be5{L)ah%LWTfHD<BYt_Qp
z%b<50{@Y#b{0P;`7b8kqd*5o0==nAaaL!}PeXtOonbB$01Xjm}COo$45kz12@(E~V
zi#G(plycWq+If1!9q=;4km+Ij!_6kP1tZmN=GX?W%Yl7$J4?FnK5(fLYe=y3`^xeE
z{lx(iPMlLWK*Hh5CR};yXXT>GYR`h?iA!jY|D&d&#j-lqqfS}Kb4^~&+3FsGv1r=n
zfe{s>ubrpXkR`>zkJNnc2tBu66|3pI8}j}Yjk3*s3)1ca+{*ZCipv=Lw;q>1DErjm
zy8Y)zoi!qx@_tT5rNehSqa2&061+W|RL<H@=GT+n@GJW{4Tj@aUOB6UDRZ!|w&r0m
z>&xNgUW&Ymj}1D?^RQkAokK(T^-)8=H;F4`^UbZmKsi+^50h5mLGGvQJGaO-^6wZH
zkR=G)rM~J-(FcFj68nf-dGWfv)9o$y2d+~x%_H^g{tDWtFH|uGm9#j5{0r)Y<}O88
zuc6XOevY&LN4gfEI}!mafU|EP`~`97Qj9}FSb+O<ZjQ*`+NIvrR^>-Q+sVhugQ-eq
zxkYp~_J`OL4*TN_LQUPC#Zv$1JnSUqm((fhk+*gtGx!ZKN&`aMQ2`&q!A`9zKe9Rh
zA4%sP&h-Dk@sEVcsS<L|r=oJo+03C*R8B=XW>e&}95UybW30$2IW~kOIV>@9oI}pc
zAuMy4^PD%#VK)5UpYQKam&<iA?>+Z=-Ou}e+{8f`=Jbu6>{VNWrD|~94w2W{`NQ~4
zF1<mS2g7#(8Q*x4I(R>fRt?6S(o5xv34N$S%M4Z3;6+h1QnXo)r>LKAQ2v$SDHvd#
zMrk!s5sMdJp^7h_z!Lz;XtB@Opu>iqF!NBZHAideR~BG>PJdV$j_J?k=(Is$p~hAS
zs?8i%if40zawpa@#acMPU5{h*2IjQM=LaxT4>+0U&!%_jT6o#8CdT?#^#r|D*Cx{d
z6}rSiWg$s=p%7k}$?1*xm050u&5V*}J*oWPU5nQ}$mavjL`!&o*`?vtbNBd_<R!43
z^l*s=<sKL1W1=Jt6y4}|GW#Lg;O7;BQh~rPerH4;vdPnS^W1CL1WX#1Q&ZS8xLsOS
zFIcbQQ-V17q??@hbOktJakYT=<PSB)O}n$H1TIXWX6yZJGgYC{zk30Wo(h;+T^I7?
z8H`+xFq1O)V@;Bp!Bt;XIZYMM(fpjm)d_`d;yQS1QriFF3E-pJ6f<qyQl?fG4W(#<
z>=0Y4Mc?@2@RuQsI3&<<uEFzPldaj!zknU;mF4)Bl-qZ|-4pk7FTCofVATRY9b2_$
z{DW~1SdQ(#qN`(22+(^TBybU&pJ~*#kDr^yCde;Q#9I0rR2R%N$(-2{i+oF83M6ds
zA-R|+UBxCJb`9v)?Kt27dh{@eZTWfXATQg2&CgVWarhRgRS~q;e#pPoFF9vs1*)(?
z!Nj^TQSk5BkAZ%v70^JOWj+c1Wr(i7xHo%g{V?e3t(~~K5IcYcG}VD+bhvHBzrs`Y
zwEzHkz#wlCxp*WCfG)FVtAAHS9I{%zRS#JIoPFOliDyp!Nl0n1N!x3_{z(9Z9Z*{7
z0Vfm-da_^cS>j?QMiQ&P7^ITnnv4R_A~W$hj!RbgBQ(~MI_L=s0A(F;BG+fvHDY8h
z*L%vK5AQhNm*0OR4omj01_FVGtf=chy}G^xUGr-!!>*#?aK-QHM|zpsn*J&WM4Q>o
z$E-Iwyee%ak?x7f<(+<Q>PTTvBJWG*k6&*6*JJYh1PhRu#rn<Mb1tl;Z}*t#OJ148
z$Zf-_b^FGTJQZvbJ!7T`d){tgF}TPO6Q$Ltkoacc0&s_u5zNn_6C8<R)<R62{6tGF
zpH=i*&eBPsH_>JTBQ_0lq*knyKV;KGNXzlyAH(&1ThlLP4%c!xNnQ83&-+Re>&`l{
zj8bileO&9>Y1!77BEGiUECzV<fc7d~r2QQivGK>}jHh4Byc3;#-V1xKW6)Kh<~#(T
zaj67>gJSnQ7LxCCg(3gm5WIB5#MuA~z{%fF-q(fI+yhU4y0}eTLc883om6=Fcx9;<
z6UCt{3!kJukYU_4)LDFU9r8RTfwe4Q1|#NpHqSYxB?}{i1Wugs`hvXW(w_I93j+0@
zW7ES;qOvYsF`oyqRG8ZAzcKajyWel-|F{*JgX~>W-<F&K>F-jik6@ogzF!T6cEjf(
zU<pg@Tlr-1uWNk!Fv>o3t{L)eZ4d$ZG?9`Pl8d*a&#X;&UpV#RVn9Lml|Ko<Ge3AI
z&A{bc_TgM{)Y+R^f8}+7P*eTRx@_QyHgDB>CJS%P%(-RS<KbU}BR5$aswC#0YrvX?
zt^Ne)e85B@ZBx1dv$!UlBgnn=*mu*$|EEVZ58o2j=kTTY%E4Sn4&FJzG<@S@gkI56
z2Q+GC)f(BK;P@g|-1p@RRBm0zz_VD&YZ9{GJ~U?mt*Xlqhtkyvdl#vRBAGtZfmTC4
z@0kvt3Egx0>N~~>wx0<tE^8blhI~6tx%EEg>K@|IWE$kVXcN%s+jM1Yucf1y;K>;4
zI@~D<>Yq*tdP{jpjR-DHFS<N)fbJEGP8FJmDWJ{Evwx?)-kqO^nQrBg8$+MA5@zO4
z+@ah2+%~7gA}W)cIRQ(o`0SO~O0@(}73VTLBKe2;tsWz%sKvF60hlxro}7VcPM2%7
zJ-dX><X;NWTpq4a0&s!?y9Rd|Boh|#tsGIiV2fof*dQ!f+*gT^uxzT8-hW&SXqUD>
z|HC9ypS<{f?6^I%MqSi-$fS5z0h;}BE9Q!!b<bv{5$PJ0G5;mSbG{cqrR04w1tVnE
zC=UV^XnO&I3qhjU=@CE3O@!1l?8za)0W#_{JoZ#<IfI%-+P90pZMB7EQRx0#{Y)>S
zabO8!M-7INkO~>M?Jgo@=5>0{q@5lOXLmjIEG*@yB=<_O$^gl-NI*mCKmoec<?NLG
zG&hyBhn|ylH1Qg>aIIgQj3rwou!e?tQblDp+4&aMyd=7r-RK-USQ6WLbb{m>A3K!M
zou<oJyl~jiOel*@l|YM%*Z37!Ad<kk8yYnqz@ft}f&%V^h-@*wi7%(In!gmrhSvs{
zCXVY)>W<z?aNQ4`$@$aV75iCCjhWbS6s_nTg8v>Q=i{0YB{C<Cb1&YUC)^faExKJ^
zsztZr)FRIgx&)|rCy2K&-6kk<4Jl)|ffsMKbcdj}P2yrD`Mtxwr&eEYW7C-NRmxs(
znDHFW&S9%J|AUV{HVOkiYeR>+4G9~tDfuv)>jjB_Lol$?Lx}QrhCO?d-IKVw6t}wN
z{GRV4$vVWru;TV(o192?_pK&z*v_hG%?wQQrL_j!aR!6T7YX_v6(3kyZdwvp`i<c?
ztGh85tL6A~OL3WzHwV7o<uO{5PKeKHe6XnXIp>?cf-!In)VAqzKZ<bGy1H*MfBi}2
zGGES&&q{2dyS0CD2iQXCn;FcV34=pE37z`!bErZCz5Ql(h4S`;@{dl+U|>fG`B|&-
z8uc1i>fVJTqCiHo338!fbV>V6$hyTYY;=*XGan2X&u9ABWD_qX?>%^bSUH+W(3h!Q
zB;_2;kJkK{43=(wkM*QgiB&~W2_H(C%6zwhwm~O@aKT&c`aY{QR3Us*K2HLFc6@#@
z|28p0Q)fTHt2#*ipwVrz7pm&!+Xr*-KudR?2J#r_*J`fRZbNSg&0}J(h_{<>7Mxu(
zsvVv?CcMzsFqZ&OFH_FG313PPuqgswc3tZ<^+ku-0G5bz*DABrd#r|GgK7pjhsC-;
z;@wE~1+mIIKY9u~fh@H`%t-QDnMy2<K>9e5?kzhr9zT07;|Fx3nJ`;9XOkAMay;6&
z(Ia5H5;>Bk;jD6mmHU!qiBqU0ZIryL-TYG|;^{^PkS$vFQ=Q7E<U_4Vo!T6D*P+!v
z-#kN?`%N8YpdwzDW|=w5`Hd;fcJHh)hu2F@*Dd6OqLhBIDIWBNyaAU4p(=n5Eqw!#
z`*IZ{0jdfs*rDmcguss)s`&b8{iJdEdUN}Cab6qVOE3kxi}#tK9~x-X#i6Vp7Dc?S
zo+8<w5pPi?!74|=#^s}9dUIC6Nij#FFFLxc0)!2<<})H6{H=aqd~oHWR(!#c=<?*I
zVv}jmD&DG_w0F;Wf6Lu>6Z2H!{gfEv)83;ljHvr1>{lMt&_Tj5jBnjF?|NjU<Fd~Q
zaqnwi`$T&evUYP2dmUpne}U`lEuX7~U#<lnw+T0mf-m16G!(q_>Na$W0+&136ZwR2
z*JJQd=L<mCCKzfTYKyrU$P20oXMxD{{p(*7Vacd<5XN?5;*x`PHpTt3@m{}L%ZZe+
z7yf5HYU5Ia^QRweaJAf)x})k`-vr|f!Lt<7!+39Uh4xz2!}#!{SIj9-Qj^L72vHZc
z+opRdMSM&Mv8bJ`Uh%Q!927}tBuU#;OHw>$&ftjx5XQ7ShqFy^^El9>rwW0K9v1_<
zJc<i!*pM^OLFo7tgflypV~lKU<K=uz3~-nAkw$h^-$GQHb7r5=mQjlHL@w<3sgIrw
za32qh9vk2-_}M1f`zWMy+O=j!?<(e_Qb6A8535!E@e$+J^B<r3A2d#5?X)f){Il7q
z?b`@zaDa#NnyLLfl6}RaJ1<H`91ZmG)K9sFlBCb;I;xbn(97iU+Pi<gVfPqOUtbO3
z(r}pkWz%I?mzKj6VQmWsc*ep~<~j)Ta~AXEZVJp9!1gW59u90}KXd+v0-@h$-iYBZ
z(h|INs$9ixoKj9(&sFD8T{IAH%XqIk2A#%wb!mpUzFRbChw)CSP>If<fD@Q3JVVUh
ze)u2cRT!myi>0wI^ldgHezYe*&RXAb`a;I%(@>Lnf(bK!^A36h&C7?*<-{N<ZwT3c
zkH`7u3F65R4z2Wijdy&+2MK;buI@8`jH*`8XmO0t33*920R<n?UD+jqnyv0RO{?-+
zwKXwa_3v$SyFPbV_KjT!UyKcP&+zmvMMhTJg+rc9W7{OYGEuJfn#vi3qs6Ir;y>|0
zEe(7D?&Ni<7&6RL<{Kv)1eQ?2+W=OrIl+89jg5TP{dnVgCC9~ds-A~n&a;5zGYOx^
z`W+j5wlhe4xXOjh>luVB)ccNOt-xwN%KdOcPzjHq-uz1`v{No-GJrWQvyehe3@UIz
zs~^sN?sq(N$TR(O)1yuM@w^Af;rf#AQVWdW6YVx;d2W&-f;r4zoA@C5pZ&NXK->@T
zes7(d$crJy{R)dcs~nw?N;|fh`^tHLLz}RWrPm8feifUh^m&1GW7uU8ds;ekMKT|G
zt<Yo|B|CLxKdygqBjr$iPK`69WzZIwfUknEwEUc%2~MOOC|0^a{Lu<@7atJ)5n8-=
zN9o*@t*7ectiysmgbzzvaHI4yg9lKN%oGwWSetvaaDcG8;SghtNremtN-KDWEWYk}
z9J&hbD;m5SY7~Us*N%S_|M9W(L%570@6d0amG9dkGZ!F^W;3w9MvB+2;I_@yJyVX<
zOOjgEtUdkMB?lAlx6j@5^C&-#4EE7Ije?Pth?^#h`us<GUN@<Gq{^mbJ+<syft*%r
zLlga`GFh^y+vXl0uR~)sZy)OY!ByS)_1B{uHN4GZ<y=`lNl<Y5GS~i{mnoX!aaWOY
z$QqBJn~pC_y*IR(+5}%~n2TJ#em;g<ssB8;xU-Ed$pR1{bj(}07i<KxnE=!B@1_5y
zO~DsGJAa^)+%3>j@}#A}+q?X;{f8krY!Dgot<Qcx=HR>Y?<AD8o#gf}*{Kjr6gVJt
zEvIEGr}@O+=X2g?CW`Rh@S2~sEA^gop<yM(bTWcU#hWrDQlQ14xJ<R?MNu44c3rXS
z-Vl1!-<!+qzy@EtbnWkE+eR>gsTe4IB9zozErAco>jXdVA9k6vd8X8AaK%u|QOS<_
zB(s~L`s?v&h^-_0j$y2iM@>S-`{T0#>uvpKJeswG!BK<{aIq~G=Q3_qiH9>-ujd>W
ztxl8t+&B)1`uQRA=f#;Lc^)E^1}gF2e9OORtr;}2JZYP?AK6{(QKqi-9$u_~E8moV
z7&(`^1cSZh1Ru?|NCmjp2PI$Ppag=>_YTxR!M<+~Z_xGBSJePd15Cl7v<>C`dJ1C^
zs!OW*!NIz_w(!0V5cE6$NX~h)p*DB_na0|NQg5YqXQ{8`Q*9P`g85~pwRNt6`Nm@a
z>rL6b-c~tKJRZ_0!TRN11{;^iBU#k!<_tHpP9UiGu!$48nB8tRb(+a25ZyUy`J*)I
zbFk|Z5L`a$09D8Ir7?)SaTl<eb>A%Fkhz$rQV7=}!tCosT4kK+v|9rD=ck-+fBt*{
z><Vqgm8!EUmJV_ojBWRXpq`1djc&sYi`b>o0UA_ciW9*_eqT@FB}*R6Od*SRhYp4J
zv=4|kph`^X#b^!(7qUa7Lv{^=u&~)3idJBX>um!jE_-YmD>h-o!>gBFUF=y|k~(?*
zY~dny|J@mck*frk$L)vE@y=hrDdjl_52XdQ3NUsqT<KY|0eN*G=QZ4Xodh%|ysZ8r
z$n0HXRT%dOPw1T;Y;?H*6CLS(ob+-YeU2%fu=Xfh@(47tZ`$*3*356*S&4IAz0da@
zoRSjWdYg8=dZR!N@OPfUr7{hiGV<lAE^}GQy)e|z9O~N2Wk@eqa-jQ&k@PQ4-G(^;
z+}#b({hlwSoU*q8<~i~b<hx?g6x$=qmls};1K0W5>k=eDx<4XhroaZQ=39vpsw}JM
z36ztIam+T_oXW$QP{!r-W&mc`(SO&t>H8l$G)cq$*DEPe>tB~wkGxlaRKaY0X5fXZ
z$eZnA)=OAra;7+1cyTfdNRMJ023Ef%A88|=zg{VJ(&dn|cdWX{oIyNU2*#il|I!nJ
z!Ku1)zNJCE%Wq$mk1dY?9QHeyr{Vp-tv9;gU(J{PUP^E?9u8*U(kY4C&-O2z@VGsI
zm^d~7g@AGi@=p<pXVdAq3S`Ik#Y)ciQwKF2o_x48o{b5%i$&)Ig@8Twi%lAV_N6@?
z-buHn+uq*IBhz7X&MOlrkArz0^Jli0!=m!9IZUMhJ-{8(<xFI_L06uSca>mZsy{hQ
z`YjUKl(<4Fs~|EP!TC+<@3J$3@HQ<J5e}$_qgubul;xJ9H2n;1p;N*;xbsD$pGx!h
zRzkD3oCi?o#Apu|o=UL>C?DgcfIxHCR%r@I&U>zfoW*}WdmS$F<JKjFw&_M*mr*=!
zbOHmeDBNth1(w|>Hqb43VWl&u2&41OgpCni9OI{s^Z=<i2admze=csL=zv~harMAu
zJ>1lQiuLAIgvss2oJ_A<!c5L^^&l?*s^edHr(RW6MVH-c-kwyn>prYcRjd^W2PpG!
zk;dI`2fcy60!^V^834d5h8*Eg>WA_8k=mr#wJS0zDY3{Ec?`foN4FGcQI4dtdGIX8
z&d1|@IOa4{rYkaOC42<G&RLa(7NcTC#LoBBEZgg)^hWK&JbzJC4btA5o}75sNF(rU
z+~mtzGTRbs2Jl=r0}f_FoWn2xXrjF}j5}p#u&bdpSdLgX(@S=hzw{SA4V#P|MmZ<1
zOEld7mp22Mw?w_+M1mU})QmEFPn{p5QYt@Jc*<*lJM}hfoiE!+)V9?o``2$^ITOe_
zzj(2mE%RbK>6Qxa2NKTCsh1_W0AVI+S`M%@xtt8tpWJ@j%XapziPy97$%3hjwL7Kk
z+l;ZGbo^37zk)e4Llh~u{Zzs$ak16>K@nzF=WYmxuWoTgWQy~8t*2;v#hx1E(}}d+
z<XUGnA9*T|hDR<f{j>yd3<xLO!UyO6dA$YuRKaFSduFd`KJ5^cC)44{_&ujfb^cjY
zl7?LL<OsR>{1ZZY!4rHyY&nLl8NIpba{+eBS(1)T1_dU1?!>bK(8c<+jt%1t_4>;D
zExO$GRlB0oCLXmvjDn;VaNH2vd1m5Ep8`k7YQb9WDB(lRV-Zr-Kdllc$j!xv7k0%T
zZfq!!rPz*-G#Z(jMBet4jHhG*9$6;8u@P-B_s9)f+uyAG!g~=|9X~9sY824+E&=LB
zZ--7}qjc#9mt_pC8CMco(m#EEEZr(&OxMRFevqP^31f7Nhr9y;>x(^YgGWYQrT_hT
zb667ETx2sEzOs&DF5w2sl|()S{X->QLQE6LyQp&Ihw=ZLH~)z60rMv0Rbcl=zwewk
zyLg_LztqkeGkIP0{#cR@OK24Pl&MgwRP-JJwA@N23~#nxVY*<T0W@Ogu#qt?I3phC
z=dnVZyBC8UELBk;PgrgeoDwl!_@(=9#VP@=+bK{PkKxY}aiq!R<~1bZI*3!6YtEHQ
zDF*st3ZplodQC5?dgl^`(im}`X8E9gHeC*0&fwk$qrKA2bQ1P=)YBYhc*dEWU=Sre
zlw9uAkv0}L^(dFXzT-!AH~m|E8I8p^hMo_hE&Dopu8?IN<Q5e-9oM+$jOb#~lxiRt
z1>$7IJ$<v)6kQ>`Yr4DckKG*nG8hskZUh8J_pP8Mg#{D0=4yWHN$LID>GR-V&;;*0
z19T=UN{c>J#1GjE@@vgsQ<}98UF*tFMq{^LEbC(G|6vA4^O)NqjW)cg3#s)Vd+6({
z-9Hri9C+3h97u*3y8x@q`r02epSI(du)*V74-5r;ojA`lq>?kC=&acPd}VhnKipk;
z1<>Rk{|@rexh8MdbV_t6FF+UDUB=p@vT;**9V=Dl^B$%9hi+{A8FR1rQvkzw|DRMp
z!+ApcV%gnS37<<2GNZ+<=Lti4AWzYAyL@=i8;PyXA+wE|A3)frsr1PKG0Q)%D$w;j
zy;CXpnksEn@5L^+*F_G>qh%N?USRtqJ;CB@EEOmma}>k5=jNXxBN7_bf}U%-u=eB+
zf`H2O<`drGt=H1?xz~#Z2u`TF6Kc}P<dlMMAZG{TSZ0UnV2lRfp|qiirERUua73zk
zf%?03z4p40on7JseY_wNGjZ^x+na6OGp~3O#*z<&Qw&{)ZvbUFFLd#s!lzI`o)6hr
z$hDmK29yhNns94H9oiYsY!AH8iZ~Db+YtG#nX!^jbJf>%3O%$_p1y?b9#;0-_!lSO
zaj>woJOA?e>pwueb>W-D5=wx9Kq*Kw6XArz5#!^f+>&}eFGnSLkt67zj4scRPMqms
zE^u!;3xNEB3ff<z7moy4A8&m<A8e!$_E4~6_f?wyjWOS_J`nj)OlU%=O0d++Z4J#B
z;GVQbxx9pHvH}uFCoos*Jh+1CpP16<%*e*w90gr+{sQl#Y3!PDW2bxA1jKq%zwb5_
z;ckEl{8SqwPy|wSp2JcycxC^|5#IR+1^3|HPd6u>7481$S-a_;k4fQhagZi1Tbf2n
z+ss)yTX|V#zr>H8J<gVWwsnutr%SAnUoM^Z{Q0YF^A_nbaO*-y92!p^^(J`TEuoyN
zuhN7Fpt096_743|_9Z38G5IIt7Os%oK!?DKtaK{5_p{MY^Oj}YLoK!qZN%5py3U|F
zNvciYtEOVH>&IvSIkQ;6Ci>-`o!$N=>m6}jN9KYO6{q{xA$7;3$^0KmI&rgE&Z_TQ
zu{v@+`}rGxw0#NLXQP2hQOBntHokpHgL}W_tlv!?pBQ_$CF%geUDaj7+qk}!c+C$e
zDwN*N2MQf!qd~X<LKQs^XodODOT2$o<Gt9?ak+(C#=WkmlZ;zFf-H(K3Le6Dc~doM
z({r*qb~{_E_(8*WPj{gSl<bP=uYVn2dY2*HBHmMkQAGy=pL6u<$0Ts=vs{N+FsR|<
zi&!B>c_#~Md8@@1-rSY0PttC~AX}Tds&uAh=C5wB);<`d*!%4-3>WXiP)g==wR=7#
z=%y>Y)_cSO=8Bo$m+g|~k{u>vJn4DBFkh$~B#8o6+Wu#0FW&OXCcz{iBN=;!!IZ9{
z0lAv$57KH2insWD@u#;E$J6~Ot<Be7D?K|O>fZE2(7C+1W~0Ztm<F@e-hJfvQd<c2
zB8l(qSFhpX?SrtijAGp>B)d(f20MNV*xb43bu>f<jSO}z{71EvTgr^fY!@=d`8EGq
z8?U%{8{_Ir_E!w$6<m(co3L+FFJy0miuAr(a2(~B>f$2nj%q8vaDmACd)(HTD*XbL
z$*NE18?n|vD|3XbKT2K2%iUkFQFkaE^~CMQ{!}gpoM_?p3YOtJk7V{pR$R|CL@u)2
zQNML1^`7Ab1^jgmz1qzL638YqSKCADgH$xUpL?!OLp}v+CPOsxb9kLLPGDYIfIm`x
zb8U<Zr`Vw3CmK!!8gur`-&+VAr2J`JDE+py9~<Yx&#;aKeZ}7InnM&mv`~)o{R`-_
z+g-u@p14UFteV!|uN=-uU#70)QHk#q$YT)AfBbe%iiQPd6}*vBE-`@`9uVT$eKaa;
zU-DX@UUwMn|3W?*N#B(Fw&u=|Gz~c8Le5#JJ&jyHDdS1CuktNn)BbrL6W2L5@Nb<*
z5}Vnqjm#!-<lD&f(hc(9s_X>)ZpgZtMA-YQKkG4NR@MdqXGG8nbiUTZ#+K7h;CR!r
zxt{_P%%u~Ja#S1l0M}*Sv#kdmE!7rTfjnA+JnU6{A~$*$h6jaO;Ct5cy;ym)^qWSD
zPbA-7gh_iQTfay+Awt!T#8~6w5S~3FVUEXOrRE$wKY5xJwTbcp7VH6*YI|%qI2R}Q
z|Fx*U2V~fsnt)o=@q{<(DQ4Hpc2B&uxEA?}8JvSzkNrALvQ$st+W0|*bv@{KveQ>?
z;lIl!!FPm=%s3c}bzGC_v|aD*e`VmSrc})xXG$ZqAbKY#6Yx~e1?Jv7Y&()1AJT6m
z5{<vYB*yPr)w>rtp%f)%Bv-F})iBc7aveh>b4fWtH_tv)@Yxvr7b>&C$HDdHvFO9g
zt^aOee-K`zu$z-wyzqpGx}oVCsnW)Ke}FIOy{gTT%i}V*pC+ELB#d^KtiHhIw{(~N
zn=P2QKJ#xzp;Bw(s#(YxLJZ}1qv=F%a;)bI;66s2N9g|CFYc8jXPav|dS8GeSkzag
z)mF*ArJK{f=z2J&ItI@W<>wU|4V0K~8pw!-?*Um-%jL<B6Ay0xvMcx=EGHBhhMFKM
zWI0Em>Ma;~1#P@GneESAZ~mdeRAVkj2sVj4{CVH9u4mO|zSK|pDH^%DM`OO1C#&a?
zX~%vanLwBgbiU;#5N0cI9|9!e%iQxBBf%v#x1vtIIXkY<bwrF(|NicQw;SGZ!eAMD
zIpo)4WUi16A<83)P@9ymv3b(3(BwWwTg4C@>Kz?VQZFD#h43xs(WFX2&hOINvwyxZ
z6aZRg-$59ivEOkyncPCyo0T2rd*}MK=<&~cCz21boVy&tM{mlX)7_MpDCWK=6l6<k
zXM#}=G2B}>!#%;k<K9;zzYiil&O=_H1pTvx%}?(~T2y`Q-_q)xp{38mDpXnx*fGt}
ztR7Hopvey3xs>O0<zuClyUSR0j-yo$ptqtMkJ=1Qfq+dn_XDKVb^t4j)d$Ro&Q0cC
z8f<6xt%h^+X|2lf6O&m-Fwn8Z5|${(4&KV+pU5_!tBZrwO~0+Ym+Fn136rK1$vmRv
zo^xyrwLzFV5?^A}p5D743UU8{(f<9!EIT3V^Efs1YS4OFMTC*H(ch5qKp>qyb~R8D
zyJ2&!zvwYMbvHl?@H|v=XwA>%gf;@J*i;cou9Jf@GX=}LKtl{KwfNdy<u*21Lsq?U
zY(1=0UjQ8feccV&1fOs4Yi7&YH+BkbEq$;FTiAP<y=2_W?Od9Lu^Z>xk6jnu#|<rM
z_Qx1VcYRUDzV4q7pz}3U9faDkuJuq0uF{F(0mv#HpB&+}iW78VQ{madeKD5|e6>Kx
z`oElwyG&p8^4i1V2aQ$3@b1Y+UoNJ#``>30FJW#`yx#7uqW=uQYzLGR3Z*iTV#b<X
zgqBz6Lg0<XFY4rwN7#L0+1;41u?EvP-kT+q%{4!NcRHVtk<m%m3XXf$ySEfPYGfke
zZM!<SL&I|<8$PQ(<mp1FQw21{p47~DphGFr^5i|_@eUGNpfi8qCD8DV8%l69k$#uL
zra&W_eKi^r)?5{9e40y`P5TrV?0&c2{<1*Ox|VNQf#G}S7eXZ&cL0x9ZH@N*e0JsJ
z-0+djd1fa#cp&!N0uwlF+K~)2SG(B7B{oU`YN+5iV83}=cH!{bHsGgs`R;$uY?vT_
z>tdCCQhg5WU7a3Ar*G%4JuXFy0NNX&n*Wo3ZL#uXKA>EU>@2QZ+7DSy!{lh#(z(+H
z?dP-W`)L*9HadH#KNHiRUin<8`#_FB1v}}Gu*LJ%k{SS4j{KW9T8D@({gPmDxtczG
zCco7+BtTa&nPP>}{IT2{hg)ts31Kj_KhDRTLb~sT&gRhblpy1TPkRPQY#*q&Hxk}_
zXkoYJIa`@u)i059^&M4XBu{F`=QO^6(uN1saB63mIE%X75-d(AK9UfUi@NS~Z40Kr
z%+M6AE*?w6abT$|f{i*?oi6&_WZ5$rCFHT;rmfwz{vy1AC5uVFtGzv5%h3D!jvQ{Z
z@rR356O0cd?R$WB)#hTH-Yag_F<^xd+v^xKBUYWJ3eLvTdpVKOFC{|5guR|SZ#51O
z@cCUAV_y+CtV8*yJH12JFDZ*aVM?C~g<FeN0!JWbzO%nR<<08$wm<Xp+OrQA{&(8^
z{gYX9-1hlCEi>F&1#D54=<R4N*KkxPaJc7!;}iSpyJM<x{5p79&$%hV<nN>j&!ZrB
zr@YItgKy*4dTD^|8Q<}#9@*AHEH<(8XxL077nV`|3?R`0KWc+RmQI(z!Ap7}jS6#X
zz?h7H9DT>=gr38_KWbs)&0sugIX+10s#Ag5_N%71;%Yl7=&rweL$DdvCeV67Ah~KZ
zB2C|pN3FGq)A3ER1JEOSxM6NX_t{cdgdK1H;;LUQ34jK<^U?z>bpL346WjpM%{5!b
zrIDV9HyZcbZHhp8R=%ng0j8n{Fhx(*C(@|X2Jd+yLvddSA41zcNLWcvi70Z2d*|c4
zUh{MnKiBkkq!A$y{W0owhT>Ej1o3zjO1hj$)B2tks;N`Xc}y%qGaq?|Z*1s8tb*KM
z`4sn+i1;RJm1;lsHFA>B&)&CvcYERY9U8G}6Sk7simF)njo3`AA+!|L6bfRd_#H4n
z#UFiQv#EyhA#bT)0;YWpoOT6u8$h<4=Dd>0fXWtS&UC%}ndomFnABpGvq2zNtbr;H
zEQgp25B3Bzh3{=q_Q3N+Vj&AjX73|AoYn2*;Jptqw?ayj&#4DicYXC!a6$2-<VzLY
zzDE1C*)CYu;e{9zq{<jtf+DAlRRK<5YOYONF~j%Ubg}@@2!8^HlV_e8_KwP^>%?HA
z8ol-sNHTE;#am+CKm}d@tJqtF$KB0;rU(ZUI;~-Y7jFvdMNOioCE+Ch@j8;uH(bk&
zV}eF7%RKYfu6)HP0mxCniD~xCIdGAqhs&a9GPBZgL^UX?yV}7C+Ot6*CNx%gS&R{O
zyXyL6<%B+0m>IO{9ktDI(*EHW&-qKJecV&pI}B4uuQwY79XV=G(m?#Uh`$6iXPz*M
zx`4lrBuu|cFS_nU1`gTNBFEg@hjqM38LD8ncX|o}I?TB#!A`dltQ54$ABL8$I{Gz?
zXI%sRyW07ovX{H0SMwvh7b%4<iEb;I8}kSFp@Jf)+n3%}Ikx=#aj2e}99&<HzMG*E
z_UgT?y$<EjsyoXIRl-z*`GOE(A52+Hjd|ONu-WG>3x;%?+Osu?-diy5+OugiBBudz
zf^v8JxeG2f*j;rKH6J-6v5p2;K^T-5ZYslB&Qbf#{gnf-k^bMAonvDp3A}$VB6Ma!
zw;AjN--!N=$#NWSYm)59#M?wc8SS=b_e<Jm(5Pv`EMg7Y?<#3xtsXEG1u^t6u}*qD
zgqbM0KZu&>`t7%yPE)aER-VW0ez=|=c?LPYd5J%0{Q}9YajR6c>Ru7AkX%?<ALRPt
ztBVfqq4D0*<$HUefypeL#($wA`}^Lr#VKEvv*?*xf<m+SqYyZ2Maj<2P?`X%+D^%?
z9@Hk6p!Q4kUYRKVg*+LYM_|uVx1POh80ym=u^LU<yM?N`8Tnq;Y!JnjUyZp!3KtyR
z97#P$<ft9lW%$*WAK}N_Ct{)F@%=_~=8}h+qrVWS{NdYd1}g{grrr2|s>9E+M?hQH
zgLjX0Q@?}S-9J1W=e-ow#In1wMsi5<KjEyiSvS72b9K!CmUW`W)+=8M#4Z^y+;b3;
zpcdmxvbIj@o-oIuC}3014GxK0U0>xrb)<wE47P8MB^Y+;C~U#_B&@Q1L&+LC74<3Q
z(=BGjSzeaATcP{iJz&zxgmGDHCcm@I4MtMPI)~{P25t3nW6zd*QHcgxy6{mLz}2cU
zZ$5CpMlZXeowZd)YW?Tlag?dE>9V>M#b8QrX(3PO^U#04!I<i@tq^(cd}Yi%oSz6b
zHwgo&_G)H4q9!)@j{o@0t~Dq*Zwn}Derh{+pq&$j<jZtyU*rSt>!pmF5ea$IlC4sQ
zwFN+<dqKBVFr{CFo)HyHai1D5U?$uakcUeEAZpM<`2Z{ciQr}J|Nf1{dz%$PgXI%Z
zlpjK!!|<1lRNLnDXKNjI^<3}p0>)TB2`5I#oWM1$V$DM$IEl>o^auUNr4g+pK)3iI
z^vl5D^Rec$HjbC%2q4u4*g{Hkz5tLe_ES575vMaapK$rYGXM7D2xbz=H7Dwctl~Mz
zhSos#fd+ly-fih|2yOP~_h{ZoHt_O$V;-uA$zr*DD!S)`_@5e?X^ip3;{fX7XR;2r
zodF<Mr5X7hM0s_UWV((PmieKZ>2HtA!8lHFCCWfW>bOnF$lfUUcYW#v9ijUkZutn1
zOwu~GWy^)$Z=Vz2DrG;ti<)D|Ef8X!R>MO+%6u3^J3rZIWhwSxghZl$`nVbO!3J;S
zDTsD|c*cHQoKEm-+_PS~JNW7z2$tmhO?38ah@@)RAC54Tk)Pdtk*BlCV1~@55JX92
zthk$7r80|+7bK!=aZ#jO`5C?@Yxd*^gw3IT-E0Za@j=eJT*EuV#w%^`eOi*Ve`3nb
z06h1TO30pP6J4?w2-?~hF7Acpf7y#u&~d8BK1b?0{fR}vECySH)|SkUPzp-H3>;Bq
z0H4Y&Xa0E^*~Vgp^}a}8q4M}5`-`QN&l!%h|Jl#n7|(7OsD>WixfCU}`8VV^L;%?t
z`Cc=y(QQNQL1_Fzw6j$<VTCh0m)P(aE&Ug^&XRDHK(61#_|ES2s;o>F{<vWu*u%7`
z#b*%8B885UmZI>4yk;My*KlD3GjRe{-@#q6xye@XxDVvK*{FNy9f@xayt@h`dEMjL
za*bl=TNCS}9}QPQO#?Ff3b>qDUO?)Ep*G5}7ZPUExU_9-B>vNKi3o^!*BSWEpndkl
zJ%ZF~YRS_rtW){SPSI1ZYW*#d)yPAiWtS`cX#t6M8~vKx+xvZ%L3Yj0o@5hJ>&ky!
z{zDjKf$RBi+aOLXU%)IOW^g3hhvsY6OHzZtK$>swfqK1ASPQ?KV-Hzfiv-i$nyT(s
z8uY^k;c67ocgp6|h>wiKhQ_5^OW`E-F<6uY-)OIt$bHl4CqJc5?lq$&Xz!$%xfx4F
zG)djgAJc&W+PO8-lsjW-PDhvP`K&Ghn-mt0-#1U4#J!1=oH>?&eHpEITJ~X?<B|76
z?=XL7gE`TfY00`pg9FTUT_f_u8S$-w_yqALvse2jrH2isD)-+NuAT2c)GADQhpI<x
z<*bi5>X8w8{w1nYz0FoP+fpPIOW<}(iLCl(mA8I1^sio14wjx@{uRVmR_s(b`Y$Q~
zuJ~eA+6>XF37g2aX%6hTWH3n&u|s+sn9GokI!*<M5e?Mwu%3_5o{*;*ryO$%v#|cA
zatESXzxk@(Uyr0}d8Pr)=IzGx;32K~8U<NC-oTl6s$12CO6P=ehdLNzE7riI<kvD}
zvYQrkA9nmACb?$QSWtI#Yp<7FZhc)mKtfm<I`(Lz73CMu#TkN_t3jdG7&tX<eTO__
zoCR5YyEKin6(zBT(^t)Ag!2Tt`k@|p%Y2d+#{PBiuqy@7)ZU%Y@frhK`mArF;LR~s
zl><iM%weZ*>^sUHw8rD*J}i_$|0sCNX_sD7|9;yh7%(Yq!at^r1OV53Uh<^A$WE3k
z<K9@!RdueGM?Qv1Cmh#99hSd%&HrAW_hUVvhW+q?Hu9H3VKb<Dc+x>Q4-Ol;@AoyF
z0MOj_eN}D-H}lDtmiLcMg>b$Lo^p56@ob@g2M`I2mab}EyS+~q2R3zx82{Ef#)Si9
zaR@IDpJU<8?b8`gT%!oHaN#;r4Xwe!kLvDo*hsP7Q@@tOA;Y{gh(JbD;HjHTbF$W#
zTuj?>vHE^7z;!E|aL3WZ7><SZRNP74?<yVYF~L!e{T~CEoOBDIb1Tms;&Dnr{8UU8
zh`WBYnQAbB$VGWsG{bZ^SeOG9!axIgLr_?r<uy;U0!##<1x}eBkL_9+7g~gs&XRwF
zb)6OU7b<K3IW)B_5WaNHWX6~k)3>rG#!SlkM$2J^fH?rrOl;Y*DViSQ7KbC}7I+=(
zT(EQ-q$mVNuTjR{={)|3!Om*u`(NE|JWxKZm0r1}S7tra<SbrNWV}!!6}0z&op#i}
zJbY%Mlno<hA8ipdxP2Sw;?)0NIb>LKIKaRhl&XIxT$I%iR&ceXTw5X^<GYo%OK7>u
z3e&78QekiR7hU4o8&9%y9^Sn^S&k-M#5FwV(0JQc(wc6NQ+@!$$ZIt|M%6!y1G7ND
z%_m~CE{g~A&6#k~-wvl0E_@{15=Nq!iGipXKl9deMLq9SixkImRFgMHc}74(vJu-)
zHNs7_llJwSMb4<08Ea;}oIubeV?~};7IJZyCtD5@q?j&~n5%I?7ybF`cmE#Fl{OyH
z#Ck7q$+zD)?a{_nlLyQEt>h<{Q{EoCow)CN@_2o@K4A@GOpX7dX6>R?mn_``+x+`W
zOBzRbTyg>emYM3_=jqrz*HwZai?nrL5BAx*;n^{gb0i3OTtYUqo51tr?2%3oFS3-0
z+`J0gDptjdBi%)oQ0XIn8sX8Y-uyHy2jiZD1IyuK1F$nM#84r~G#5iWsX*BH{oxoH
z_?j~!WIQueY?gd7+b)Zkw(Y$LT7nIFCe(wbfk9;L{lCQL6#<so<F@mb(S))s1ESz(
zEeHMcwB5{%19j|Kq#U_}1d$<K+c)Z15}U>j(F%h&#)ijhI4<EVgueGmDZkOxB)iXG
z?H9mQi^XT-e*&N!5Miyodv;mfF{b&2V*7h&{sI4B@;$q7iJt*^sJf2p{kNTg=a8Ll
z@c{1|5i6|8JVPZusY>^OcPqcb+w_9EjCj=D$}Q92mOx}6P$u%RO0Xr~Z}f&rxl8vq
z=%)r^Rs}eqbc<hU@SBXo^*AJS)<JE<nBDqAK#vB)Fu>g)-z1bvsXtozQy3wlyo@C^
zV+mz)@eo)BJm4&A?3?uC&0o9_a>miz|M>;aot{8_FPX)6zI3DfCW+SO=kusw=bEUF
z_78#yNh6QK8wL8C4GIPn{>;n(nD9nwWcYtI))oS9H|vOPu;av?!oqO2de?*Ma)F)3
z$jkoTR{K>9uTisx4$}O_$o2jwtsSL6%!50a(y2tWgx1Z4uIpjbB_`?!p}Vbrh5p{;
zioE4jV9)iJ0fcT#6TUqzfHt}DjkAbvBuK0}R_R-Fnp|pN>op5`w%Dlr($-4mxL?-^
zsLPvaR1fHkZ?7Eym%!(9wGjKDeKn3?=*8Pb!^T_<eo6|ph_A0yK0WyhHNbEOBs?BP
zo9`Rl;c=iQiWxh%*oC_aNxJN}2fJt0q6u`JpurBZxpl10eEtKDY!UzH9*a>oh;V~H
zPu(|-ggfrz@AtDc7lC$3DUkOKN)j?*kABa{B-H1XWr*cqae#Leo1ogKPx8YTdWn=T
z8MBAT-v-@L+kb=Pw9=zYtyep*54&+UjH(-HFz+QRKk0_t!%VIV-Br*PJ_4T+zz<yP
z&n{g|{^Mz89*{syOb#A@E3MDCcxv;FA{6mdCnz)W_}YGir^u%Lqf+zY!^FbIy@nss
zL5-=|i{LaaV}pScT*o%34%Eg*-=JNY7G?)5y)Hr$Ze=y7wamaYP!zm%wj|AW-|&%I
zT~sQQPs6=roJAT^Ggbp$`{}Fyhnlv#{{1SL7+Nlqd9Zo;TKDP+{r4(WH_Q?yXJ0%L
z6vjS#)lk)$l(}>U-cn?(FD9mkL%2a-ULKP6rx6n&hWMQ~oQQ?oPh;eMEcJTg$d4*#
z7@ACL_yKePv*frgjqCdZF0yZdGK)S{(K)g3f4i+Y<2!%l>~*VD;Sn^Odgkf;a(3;g
zR;ok$D2x<8lZNv;99@0;z8@re-1BbzQONr4jnqXYX(VY=yZS4uxKb@5DGg)@$Msmt
z==OiZxjH-i!8evYtww-jnJRe1>eN(_JMdXhD*D1nAdaggzLbEEeYrJz@VOQJLzYMv
zH$P%DbXb_Oq_%0I$q^#=5-2RK3yHin@As_cQ*vIsd)y<(^frlm2dVpgMhbC@9xR53
zKPD#*_Hgx7{CtzJJTcx&Xff{pjXNVUwXz9-^vyyzl+D6ZGf)*BwSkuHbJA0O9NXCI
z7C+LjypS|;PS`tYIFfm5SjBayn2u@iRs)i6f}(E#7Zs#vS-tMKE&U{tJ^GD*xLc%&
zu>+Z&%=hhB5sm2hwM$vxu=1T+B5?$*f2<CZy}Un<UmHC)D+&Mlbdld|j2s;=+Ku5S
zoh&nLIRnv$%1=ugk~Svz&u6<(@RTS>Pa}#&GjgqPW^E*J=53{Xyok7+gTV4Ln3C=r
z!PM+K0)cL5|0h|j&YTo6P&SX@@iQ5PLxqhq7?bqL<2x8JFUkNFF{I$5^=~+2{7H|h
zR_#1qoxElRoY2Sa%P(9T2AT9#e)N1AI{&R7eE4(=#@Sd|uHC2IHMNGX22z$)zpsEg
zmCSaN6%Ec&6IGLwXc-Tu*M0CjG@F-&y?3JB<aNOdZ%YXw`)&(-1=Z_lY$ir*<<nZ-
z9giwfvM|$M&O4;@`E_cBlns4G%kl>4p-$sYpMq!`mG$n?ED26V%xwyhE^lL1e;ej!
zUy|wB6x6@bpU8#&F01B7S}AF3G+@NdPf2cM<<1zmk#se{`J(?*danO%|F0X^O(Z)%
zt}<f-ihFb+>5P`LXFBGCBu{PNM_IE^Da!L)VG@5bSeX;`;)J}tT#W9|k4Y`+Zy=v;
zzE@aNrAa;j-^Rq<YL&)mThP0run#el)?cjBHdvg3yODKUSRc9mS@+h@9~PxJ<=3uN
zNr>BNjulRuy8x_GJ7uTMe)5^d^;yi;@jcufzXc?);Fx-}^VrKt>0UK4XuXIKicdeP
z<G`3Mpd%rxv~6w;TS3zb;KzY|PS8rY;9S_kO1E`<uw2$D3KX5+h2JCBGnBTlqsx?~
z6oaF71?PE~816J_fDy9>cs{Ip?6;(pqe?yJ;Qd0~aK#Q;CvE?|z%f2MD;W=EHh*tv
zn$Vfa=AJ5uNMHA5vm+OkGc(MW^RSE_x_3YV?MKOzDZ;Pvl)*2NJnu~L$FED_B<I(b
z?W0ZJvmm>&wUNGl5RYc$FWZID$&@4F%k^K&<L$vIQ-4%$3u1?0&kg+kPX2gS_rbr~
z9D{uA$Ns;(8}t0%)A0Z|4fa$~1gkj-(G9aX$+9*%CLQaltkx;;M|^7$@J}}G!AthI
z-uY@G5Dybh>jpt2CcY^J8M6Q-uZu<6PYhMr9C(YMhESTJnk%qPh)}R>L-HTqO;v^x
z5R+F#j=p=d8i2Ri6u8?%W%xd-zt3NPpLmoVtmArZM!?9qG<pTZ2-c#qaVd$U&7gpy
zn+H-YcUg~cnNO#IWn0DNMfH+C9wxR17xkbKu^W-Gf)>kVXd4yWvk=HcCE+QvKoIT{
zJM!^s#cpdpuY7x+G7<RMtf!!3;3kSMxL`}aWJ!1~quahhf>{`_VQt7dlA&@nA7eG0
zzT+KTx&Z4uCB$I&l60zQs@Ecfj-@8Tu1O2v>NZU{53moME{Ev6{zFh%f#!zD1@n!r
zfWC#MY#%=K{?yeY>vLug5~eJm(`qj4Rj(?jwFgK-p{Ao;4PmS~v|<4!*=nBffmeCv
zYjveR9y$AZ3J99B|2hK<{Dz^_uaXVNZH>PR`}y=*o_#*SJ#^JCyPAg;28U1lRG{m%
z`#a(+lw|_xDdVrSft{B>k6GKMp1^p_1ziqLmiqOgAWvl3>$%P5hc#RKXt3P&;#F{l
zuL}6(pCS+uBX$!nK6_)9#eW4LKjw;F{}r>Qt9gXB$5~LI0Tj0zhC?-fwk#;eFh(rA
z+ay}ikaG)WdZ4m{4KJJip&P*@I(39)!bhsPP2ryjA@)5+-d3_zMooGqzp}`z3Tq)a
z)5`{KQ8Z$BVa>p`0i_(9V?xDWjPZt~(?%b<YkCWlz9#g6W7Ny-!|@|<!?hrH8IdGN
zC3#C(-tsenUF#yPLpY$c=K$GkIIc7Ab`b9*=!%7>(ui!Z?J(@SoGvOi8y(xAUHBAH
zWw)=`Gk8xgNDd@>8)(EhxJ?3vm$xretaDp7dv0a|dsSX`Dk7Wmo;$WdfSPFVwyhP-
zY?4?XMl54z-+lEn^^Y@gs9sF?32y)_oZ-}mZ7g$ZIIDcAU_n*gAiGOH&z_w_08jz>
z(5(V~(1vK`wh8WGh`a6K@2;KNt;w#7{u}5hLcCzec%;#;y}WwXk<N^RiR-;iOZ(lw
zS=p{FhLM)Gj?*eyIjCI9DJt<<;DT7rVs3AoyZ=fHZ-)9-2glLY={KeuC4ejTcYi}u
zlZwa+KKm@B_;?_*`5FI#Zyd_Qqou#5e<BM@ZnP9HX0m8bJTESzqc=A<t~pt>P7j|v
zu+hSwmm9)416=N^Bu_TMsyXQc?_JAgL%m3jsiYF5U!nT-;QY?#8LRO+lNR`j_1>yM
zLW`>oWNLpT#?-^>F7Q8ns1ZKQFPS4;D8HX>{LD(jV~M{z@G@x&HYbv7A=To7N1v{@
zI7|zw8P<MYs$H9Gn|j6h)7nQTs-?pWmenp$jah|SY-E=b1Db~>pP`C1%xk9GtNpf2
z&K$QC2u?aZ%yF8C;>2i=>TJ5o@7_qK`84te*vzWlVvqk>6uJ=52m(h=0Q(joZa(y|
zau*OE9uq3wajW=vf=<6pvXV&>6^FH@WE>n`-@I;w>$n7_6B~bt+~Ah*81~R+%#zVU
zk=ea`v50>nV+YOE7r9@_`r^;%GL|~9epUk8#B+s@cBVn3*OTdyX!@I+2OlZ~w6piC
zWX9{4km>DU%>me$1nH-T>2Aj@j9he&rZZF#qp7VcWV=vG{q<Vh&F7n1tAv=y#J4R2
zxFxtNMx(Lg67<tP=kcd^+%)2sd`H>(EXQi1*XWR{!zCpGuQGc$L`Kt@Ey2{~0{f~~
zWUzbFm@utQ`IG3E*aX<?P+W6G%c`<WzQ=^}J(*A**lD@sz^Cm(AR@BS(`A8g{fm%|
zd6S-nm&tf>U72nt@4d~$=l;A_z9adKT)MXsF<G>a-0AAG)hjN*tj%CBYEnAZXDW2b
z=r?g}67WRDbe>4<0T|TEG*7zfVg;U2Od|?PKovPwW!;$7U4+@IU|KUt=pX$732~|d
z9^cgdpU^BPRuZ0n+<yLgN4j93YYO|>hwuA;?8?HP9$cWFbWh{acTk)fda`{eK9x8G
zRiPWTdnP~__fW2BLlV~QHYifpqV(jlo*MH@;Q(y&5jTDgo~h%TyQ%AOgheF;-IQM6
z|7My?7)`;c@hWIcI~fh+v^Lr^w5Q7DCCt0@Ohy+o!OIUVyfhe@z3e6%ojcMLmRy40
z3+(hcOQ}5-Y0TG9Igo)ND(R>HU;5Wvf}7&A$_DNvikL-~5B0)S0cHPP;UyX|=@6=}
zBQ%C1qOrsoMR9a4?V|r*s!fo4VQAhT=>z$Q=PH_;Q4mI(h~kT#=E@gdcYg=FOL&!T
ze)u9-^|a9G4yGYv6YYXas^^*OvrC$|<}ImuE2C>eZ5FnS9kh%Oafu5RiaX;B<=6SA
zf_H*{h|^KHqLxS_swxC=FFsF~seYmQf%8*#MKCx*DAH>*51&yVIx~`}8s>4?Vh|=X
zLDL-YN!LEaD69h_&lM0rNTxl!^`{*`;?Lbc6*6yJ_JcgOp1x=^^k>z^E1ycLZVT#G
zn#Za&jvpqoLOxEmnDgQ7DvL4bdj5*_&v1u}*4?)-eT5ka>AI(f8`DDXc!hYc?!|Mw
z?pf$z3v$2FLHsB~0h4l{cq(%>NREPZqE?t?JlodVu^k8!THPF2)HUtaWeZ$h0(Nr~
zN#;yZE3IBl;>2_9sDRG7%j#*7_;y)*_C8QDtUZJ9!AmV+gHQwaFs=WPY{*6?jk~dA
zS`ctp`|}xBHQ1rK5Oq&Nvv5-)4$>pEttf^g&%+%|#DM~V>mibm)jX3&4xtY)R~>Gt
zn<_bXtNh$%;RXFIru}&3y$D2ybGNaH{ch4=32LILQ^Hd;2Yzs*rmj_Q<Mx!>=7rf?
ztqF@IZ4G{|7Ywe(4v%clP0*JxVq)wr0_pYpim?>}M~M2E`D(CHfh~jKU+RlrUPacE
z1FJ)4->fF%ZD>rF#dw{Mj%BN9phdvP944Z8inUqc+^ae2al+1*XYHVG!wn(-+>5y6
zK*4VS>i9)km!b5-b?`^!aGaXW0zL=U5Oi+%_!;b#<{ryx(ZwLUB2MMK44)6Y=GK=U
zdWrxwL!URORba-&?z;SdPRBrSaBsLtE+>({m`SYbAopGaU>|Qkud6VzZDJu*N{?aD
zngbnHlizCJJEht9h*s=JBvu49&^s?VW~bWG<xz@;;;Ssh@nD<5cf#Am@6z#u>iGZT
z>D=R){Qv*|DM^L&PB|amQdE-j`BW(?q>|GdM$VSw<hV^GB<JKjgpeGT!yIRGC}(pB
zb3WUgH;irO@VnmMKYoAiAD8R4?b`G8cs?HY2j+{1J;_2LwvF-<KNR&8vi!4&NpV8t
zHz^R&u~U&L!xFX(vu+TyOcKyBP~DfGee(tIZANq&Kb^u-hJHz!LxubBBv;XgL(iXx
zYdX$MlFj{b8o6FsKfH~BHqd7iZ?S;{9?~ny55eOJA>8s460e9cpm(6|<S&NOeoyUi
zXh|Ml3^p4KhZ-ZK5qy!!J9aNZO!l`C1b+*buF~SVHlt$PoEX<}ZkXY7$z8+rqM-ax
zW8;?etSd5QGQsttcs%QWh}c|n5O-}g4afKR7q1<RgZI;=uv?-`#@jOgI{vfuN@3W6
zdVcq4F2e%bm<>PoT!ZM>j^xI;mOj}ScpQcBOkTw<bgJ-dfZ2eVdbo`Xx-L23Sa&cB
zlx&{euTIN$q<Xg7K1&9Nkl350TJQGF&qN)9i26660s`F#dBq|ik?`kaVMZ)aSiVx=
zcN33S)c~i>(~ADpXVM2qc#a7`Ht3Z1^|d&|rFOYYX?M{p2<pzr23zbd?nNQW9(h7n
zB?Tr<ADAkUn6Jx)9gCiqj3xH0;9ebrG<E*OeUGoH)4qmN9@y?1IT>pC0j%1N2<6Mh
zK%O5@#%`ghYNyCATyGZ52k_D+-gRZJoa$a&4TPNG3TnL~+9i@iYl8Bc{=V;m<_YHZ
zbBoh|>O-{xq-*hO^+MNKkKjGL>Ftj1`D!Ivbjz)6#wZz6_DE|RR*YgLrb>8k5QHbG
zYcaoz2K&~r29QS-TwJ~aC=p<f6?9el22h2{=7?~ITyY9G6{;F1wjQ;_L{G2@af)DS
zw33B3!vNEI`?t<ajqQ8qT*&k2weiMK{1>-v(DZNvci_a66R9lpgy`<rUOc_NXt2aI
zAwWJYwP)gxU076w6>jMJI*hh2v>R>c@Myi8-G*@rB4EJ1J`CWURLoU7FCNE9{WwYp
zh_6x|EaD8)xgALGkKjES_&Bct=)}89sXJnk;lX=PR~gkj7-cqc+;T20p_qh$6ll{Z
zAU=yc1;0b1GpHLn9#1KtEm!^-4iH8;@^$9=WBPOcH_!6$Ei6<EcyG_%%>Gg`<)8V|
zi(9Vlg;M{J7eQ2VJ$X>+R(gD#?|w7`>Cpee*qNw=B#)6qc$(h?SAgZRs)DfxQOARy
zCH1zMse&%(qXaLi$l#0Kak%fI#xuVNYF8B~<f-v+S{NYNAv!g3vE-=?``%f|OVV(5
zyfq6Bq)Yf-oF!G-)c<|o#(EwPD9JZDe#=tthMayp<Ol>0?}7TD=wyqwQ$Og28isFl
zaJUpYZ7Jh6c5V9h4*E4~hxYD`J8QF!YdC@c#ONb*3wW%u8$+YI403XJ!55oSHee!5
zwM4dz+@vg-9drfpOFkdpIk&*B&&LzoIvG`seoM;ETO&S$9Dhun*Ep+%2xu<xw6U7W
zV&d8c85f%N-+NwtBBBS!>6I4`K>9;K$A_EU4YNqvqnQhO`3*5k>wKg)BdIfNt7w$Q
z|N0MAXOCVRH#Wg%G$0G7Qe$ju6J4}*=6ZR9Jra5}muOns4`cg(z&vvKeZ8Wi|G`^+
zg?U602fZ2gAa&Tg42*0Jq@S$gsLdN(<~-R107&ThS%@V8pVNZm3&%3_!Dj$Sv}u1&
zJy4b+H=?uT{mg(daW4rAiHnNEAeCAgQfr|narJgt@wrx4856%nr~6{!NpRq<f;T%w
zIYsTpAb-^Yz7YyF8^rrzSq+uhfOdQlz$XBe<59vCKt_oFs`9FMc$M{e$*-~OO&VyH
zsCJ~*??VKeFhz7|$xq&9TS+8WNJ`MOK>uI}JJ~|h4Qh*T!U)9Qp;u3s+;`uwlXQG%
z{}x?UHB8L$7dZYOAmI;uNW#Hm^>mho2kBx`qH5-xmsllbIkbZemjgcpe6v?;CYGX~
z)?F3Q40>^rd`fr)!Y1N^LBBsMBV4N43<(llyf*vuuhpLKXdaf_?fwn5{05Bgb)QFj
z5m1?ef3oi-%?Glw9e|wXey0>m<_Ihv-}aqenAbRzoW1^3Eqh&azpr0-8u^}}SBzf`
z{Kboqbsf&KweLaM9Qj)vuB-^w?grST8EIdGb#%c__j>caeWtuE*F_2w)iSW$b}GGb
z5<-^<oavk;bSXaDfk*}iY|AYhsSh!1;$bBLKSzr6{Z)J^mods+w*=R&4n&Kb#byBl
zJC|@^PcszP;6u88FmYM*ok}cb_6|gPIV(Z%=9{>qy@d^q=Td-aEx16U;y;VNVCmj&
zWUQF~`!5j#!zqV;Luz0Wn^jP&?RtH^$4aLFJwc|9Z#d7`oNoVxFNBMWVYmf?ZDqp3
z>yU4O1ZB^HisyYkEj~^>+{p@a%YSyZbwP{_QC)8>YPPiTzNt~-Cx9>n92o1?FsS;;
zwz9h;e2L)erLfEGSizaEa-9gNI^<?Q`{2w(R6gscLy&LngWex1`7hd=q^T3pmXzO-
zm_Yr=^q)fzB@GmEX3<hh$FY>X$$vI9=%El#9-!iC{xXD_$^IdGXOF05dv|r#aU9Fl
zCZ<bMK}3daEAdV%u_Qos{R6v!a{t6|p7%ri@`e@(tMF?6(>DT9PVqvrZDziE8rR8M
zI@O)?=mqyPJ5qqqfv;A7DqiEu;&_!6J;IZ(J<dOG2=exGd^&errfLa5A)`YZa!h7E
z5O}woe-~3HE*%M#?Rz90IZ~Hj1$%tcIi4g-5h1#iuHr|J{3+G@wzA1~J<Z2~NNMob
zEUPacWjR<-OHuinKsxBiZm2Ng=o0U@cNd~6MurNi<gvMTvK}1byK$dc0|4?E#&-?*
zFcY7i(teUZ2SG#n(~EMrSB6rmBq-;Xru9SD=&dXIC5t)GT^eU~7PAljw$2yxM36}+
zr8%uU99f<9%1+FP@^V!T=6-v4rSr`jZ=+LELmXQVdm$t{&+wCnlKGC7gxhfZIC-+X
z)QRdF;cww$t3fdoUg_$vcCBduE)@PpM>1^6S@A3W@C5}eM+vjvx?3I4v%*=t16d8V
zxqkB2pUP{9yAp5MWR^iRAAjAz5Ub*C9i3Vi%Fn*3<48^GwWvBSLn1|62oi>&*}L1s
z-2vo;IsH?!QlBkMV8cwE0K{lq%I;RCcriNh#|3M%@oc)7&k)}O?mR3C5$CRbh75QW
zDCi(XrKg%+&Q4VIx4D##k1T?LNqC$3qV|IiD4Styrn&%rU_Db7*jfy>TfYkAtd0i?
z4>uZ)jQ5*Gok+f{a_8EbQ|RY6js+*V7cqSz)tpN=K3@7&Fu45AMV%Jj{|jwybCLKh
zWl&?#7ImV$i{R=1slhZ2?2IJKNk!Hv_UUQoPzc()-v<@Yd-}pAbO^Wf`0svmv_7PK
zYhhMptwh-D!uoIDc5N^yM;AL%iZKk+y|n`gNH_@`uibssG%zp|h1hfeR=zI)=+xOC
zw{iQ~SC!Q&8gE!X$~V7zfWCjxAfavO)r|9^R;zB|zN!l0_Vj=s@%Hh=yP||A+8i@%
zlKJLzNYyAxV_%``<|;nuT&TyF^BF74r~SVNNK<Kz@=t#-zYJ<18_qM(!|8q$B_nE@
zy=>z{oPRUseF08yd6W-?7(~H?AKBHF9!Hu#{G+?2WP3mUbo|$<j_=^cwcd_;e>rlk
ziEc!s=4Iv4qX0wS#8Q}4IF^BZTE{v?NU1`wGKDOL%i_Jt;;$iHG`&Rmns(kl6DxCx
zQDILE#z$1lFDb9@LqZ*6LjS*Ne135ZP>pM*J%YHMq()Z3xJ$QRyxvF;Vn#1zmhQSq
z?<5E}Jqb%*raY2@g(u+r30ODpThaqOR}{bA7xDEUDVbsnyhA<hhu>mD9-GT&?rPXl
z0HXypfi1X~XEEZUgxO(_o2?v{>A8r?Dmq+gDSe{-xfL3kLD+(;Vc*rG`39u|q!<vE
zyMfJ|8&ixt-?$xuyuxoCzXjGS*&{%(FtGdbXihpt>4inKI-8!*_#^$I_BY|`>Rq}Q
zs{>BS{9W-dmuIVr3dplYI3?{1j(_jMDDQLhavvwaB(KH=cZ1n+Z7ZP#@@y{4LR}{B
z_|IgLlE)5VsG3$#@GKV$=W0%|Ix6r9wT9Sg9cc?~VPMMzP*}c!!`4i4qRonBL6pnQ
z<NV5(OS8Zi(R{RbcZM<K(8?l3UH+oE^vLu6vp_p~q~>jA9(Go#dC^=l|DSSCH*kki
z+n?2>#@$d;XGyp12&th?fnS0Raj!&nwn#!ah0mfx_~shGsQg~aG9{-HsQI}sC>*BF
zy5e{0)RQZ#d&VN>$KsmUdzp8MXjbU20hBW7^O+`nIn-O@Tsz+B^;<vsa13yyLdxxd
z+ZRHm4@csac3<0C$$r>)3z_t3TbDRQZ&`BkeOm(f{23%PYZ%-qP`GkNC9UtgNF`Yj
zALTxZlpy_%L&2KLM2v0RC9pCcU7%qa%dCt`ZYOCyWQV`Q3%Bz3#z9jGF_u4#LP!aL
zQRNJ%>Ux#t^S4xsI7BU!<ZVtzL?8Hf@sVB4dj|x&7$beBij?0=f>t6xFIoK76G%F0
zo@)f8D6MPq8#oOK24G*j!rT`N#^trtpbb#bXZxu$!)h&B)kJjs1;}<pJ3~UnTLO}+
zo1J<x5WhH|-j#hAhk<n6EZ#hHm5>hXY;~~+l=rXJcA?Cq9HAYf=e4vRn(4O2j~XDP
z$KNiEZVabgr5gRl__yYMeT#ODbg7iQ2+bdz-hMRBe_f8FRhD8P_U<td#41dxT;ou?
z$#s*>c>RJS%D?JK*SlxLDZo8!_|brw!Tl-wv0^<9vR$ixgBQ~(WEgCpKWjeww~p{-
zK6&ZR&)DVC_grCM!E9E^0ZU8cAZW|R=R)vg7vgddR34?=g&Ltk{uowKD6FBTT9oN<
zu$BFG^A`5+-_Se1=Ni|JCSuc@8QOy&edFr~GfeabU!XF)Io()OxJ6gFs8F$=vtqqQ
za?ckRfbg*NwE#8ez5>5}R;w(ge|!71BW}N1A_s)G?72}NFh|HJ1|t1e`C@NB*#!D^
zXs?fLduPc{a+*;`iwBDR??h#Yr_OMVt5uZqj*|$Y2G3=J`Ukws-rE0?G*nFlH}=s+
zu<@0?&D<XHM-%IJjw9Q3M-62~rPJf1@b_m^wQU{y9&cnNaEG*-ensY_3?ue|f`{q~
z^47+CarNi`L)E#B4<{1kTfwYHhyyg5*W#@pxn$}Q_sNU4LnN7`4MabEfL~T1W}YJ5
z19)LG-_2gGyS^Y`$LDZ3=uU%&cARFDIS9jwi4K*m?6ve4ailt@1BtUd(cNDC8a9|C
zFD?ZcX@oJX`<hLWqT9`|HJql2Rld}G=`f3W`)+X`N5Ew}&Zq`^Kr7c$^rry^cbUtm
z>mhn-de%uR_NBtCT)C!j=6Z~q30ye+=$|Hkai$rE(4j7>!uU}41)^VQ%Dl{v_$~6_
z%3Q+>7l9pd7a~wY&c22I>5!qh7Pb8a=(fliGm+e{=pTmXH+3!M>({18l7yDUq<DD>
zvn$F|&P=wpopef+EmTMxkm0N7p;~aLTF_+gNDQhg4AE<vql(Pe$mf*_Bm!%%NjsgE
zD6N~VHLB-Nv>+)V@m3Z6YvCr?9W=3e`BCNSLZ8!2i7k3I?DU>Ov`Y_?+@<R;TH9Ox
zG*+fSDj_l^baHM^>2Ol3jpzf2@lte`rq75WNY_>hc>dM;<6eMLYx`f9l3?V2Jd5w0
z=y5=p*O|~fn<~|P$BvKF-Rj!j*oyF0eUhXw9nK5%rOT+Svb>ofAJ%GtOCY0$GV5p@
zF27gTxh6>FaPXJ1OY`yb7X)?g;qlC(-l~5}{{(pnM;t%g7B+A8HDzFmX7+`&gFC8{
z;NziOC$^52qBD)?)5odqwhZnST{KcWc?05P_~je;W<Md1pXW`w<x&wV+&7B~IxJ~q
zf_ocSXZ)_hdKa4-0Gdp%c8r~b86_c_KTI9LH1X`q=mJgZxLgc6WuijW_kcUK<*3dD
zW`w;l2ddLYEB&wS=CgP_8->)@MvpT>kj|E<8{q1By_R@H(qBY5x_rFcqlSa#KPNLx
z#BlG*4MMUE_^DSMoBS72#YLSxWTnGwGX@}o&(6l2v>@j<mhNmEFyln<|H5!T{ssW9
z>S7ITQ-`F-$kF(<V=O9?Qs=}}KS*0Bhfj2L94?C2i|Pb#Mpr`bzXei;bIFG<s)3Zx
z{)Jc<(KDZY-w%8jOF{4S>J;^GjDq@G&8#_F!Ge;1>&<Ir3~)`Be>)-eNw!aPB!6dn
znU?QS8(87>=a_$Q_ebxddo2r?CEi!1rtE#N{tEq$E(vOVO*>idBJV)m=SY4BX_i08
zk8Cp|Idj6MK5K!uPMbVgLffaXLd~*;&BRd2N9ZiX#c^vF>@NVFw=<#UJwH@+Imn}A
zI2;f0`Ej<Y?S0S93sV|d82`I`C&V-RBetr+Z+9ky0&k&`#7Q5nTBnDPSaZ!dK>fck
zTK_3>%RYT5gm>yb9C;9Lyo9#;rSk*#I+4qCCTc~;`pbDQSMyQO&IE)xg<>ut74CSu
zf5e$hV>-_2pV7XTTlDYFL?08~SNxvK+a@{0503K@SZt|kE1~LSuxKObH*Z6Auc5Mj
z&9`x!8M7#(Hjd^W3sB?;u)i`_jzP$8DmM^9*ABD#u9mZMjWZQBQpTc*cd3%p;<;mB
zhMD^GU&bK{AhrT_Gtovw+;20DP1Z}F-@S7=EVRg+UT@dooYqQ}mw~yB@0lvfy5~vI
z&8w)O$dkR5>4qQmMRTTxft}8Tma)2e<2OzK>c1xR!^A+N@nUl94;WK*$8UutWNFnE
za*Ycs<M2mmhb!pRc`gRFxZp*q0jAAlAQDJ!O&&MzuiL83Xa8jYQNlbZLISPtRF+4G
z!zTn{AoI6wdcB}djIU$cLBIHIf36ZLC}N9Y<5Yrrda(G{pphUQ&qKAAX<l##sM`YJ
zNEqMPXxNhC-S<b<_nj>NdqdNayixReMB2g2AfSE-0{^R1?X?yjUwS9^;-#!bx4`Ck
zWb5&BRV$#ot<5_M9ar0W#iBgQcKr`JTU*`h;@yaW^%OT8O$u|eTs3qK7iUUp3fPzM
z(q5EyH%aHkR<9*~Hl0fL)@*pGRkQ~pBSqJiWXFu^9VFHfG5Ohlg;dOEbOGK%sVUyn
zFO9F2vDfy0ji_PwC<d`WF72cvxZ&&g4|N-}qjw_`a_!9<5p+=9Y`FPo>*A0-;@X<1
zk?P(fVWYaofhEom#MWvizjyHRv%9H39lp%=<fmqgC=%7L&6jnuvmA}E^nY9405E;a
zTHf}Ew0@tu!gr`Y3Lyo4<hfd5^4w#_A$4PV#X{B8Km%E&dyE$3avhQUZVc?Q-pQ@h
zfx0ZMF#4ps7r+_=_a5*0typPskpfz*<hW!F5T`za^^iCFNCOU!6dq_3R)^D{23<re
zE;MP5hmt})2@fQHtz%8#+SDs}lO=!Y1N0E=xRNILr-{dS@wUZ3TQK~g`?pBV?fi3o
z33t`|p7j<Vbv1aXwrR0t6i4iP_~G{Ra1E9Qw*NZ8!Mz1<jr_8vQwRO<nLU2T;_B}y
zy7`RFT7lN|*;#VOM-*I^J57^$MbI^n{{~DNi5FtekspD_!mgcAfXHR4@+ud9@7tf?
zXs=!C9lehuN>~&uf%HxCwy+JcCWq;)13cn+g;-zzXST`t+5q50t~~|o{VSc#{_xz2
z;o{PGBaga7{k07c*!OkY3WOD`!LDVPu$eLbI^yED5Al!ZnLlN9u7YFcf%qJ)xS(QP
zH{$1?hNvJ9qy1`MaI)tV+*F~1+w+;X<O=o=1N8;We922|tXX7B5-Q2fJg2jCe$pC$
z{4im;34T9xbj|V7LYeivpV?YT`?v(I#w91ka(k&wRpg|Vi!nH0gcqJ0tm{!C0c|dm
z{n@52*lE(>l*;r;)#z_rf{S0};|->n8X7n@>WlQshfOE{^Q>$yy=i=#8;-Rj0kh{E
z#QYn}w_9I(go60dYotRtN`F25x%#et3!##ft?*eTe*=H>47eu<meU&1QwbO8$0&c1
zdpy(BHdm~MZZ}8CN-)qKQ!7`8>t=a1pL9Bc)4M!Z!n=buL$ep!w$1))qG9oK9u>`S
z<*PDmArz{>xTk~y-nmm@A5bH!8V^><2G1;gw1F}!ANl^*UVF?Cbm-Tt7nfWAPcKu<
z1riR#$ep1I^>SXjudV;<0<z-KAs4-t?#U2zLw`m4trGIs-kpr>r}N0KN!$*VRxc65
zybr8JA|DC=IYqj7PdZlQkBQ|m^bSmtUUqgP{v_=>pn%KV5mDu$%L~`UPzde+CJ8^A
zyGPP4+cQ<m4)I$5$S|BiF0z<-<Mg>M{nByv_U8-sZPC4(V{hW4K|AoJ8-CulFSRR^
zaNys)n#}w)({xQ?0BD{6=MknV`+=(lwB=ZKE&MZPUHv!HCpi*89{u^J*!ufga@#rI
zE$|3xGeA`8sN<G+<RdCX!^Okxv_|@d0G^ze-DY(K?`G!TZI78oGttS?Df+7qyAs{?
zaJtFho+E@XHF98Ex{VhoId<)`y--<k)e$8SBS)ho042xJUHV;2$1)7)epKj`B9&d@
zt%*^f4a*f9UkClkUhb0Je~uS~m|#RF@%1$pncYJLiDDIm-)}bb*Rh|03XEyKa}P)&
zU|$x|uUY5g0JZWF>Xob=^duVna)DHx=#04g?)mHH9x#@0U?5s0J7*G93jzFMdcK+Z
z)vcDdAZRO(WqPvCUxR2<^*LnjlIM7YiE^^SN0G`!HRb|`N9YwA1tPf{r}g8}{ClHi
zd<(8-UWGSG#nO)5OwkEUg|0C5W=d*W^rb`=-;4Mb6%Eu&9)yeESo$BGkO!tmoe9>R
z3MY2cCTbD6PGxra)EZWppDMKEJ=qN#U!tMPSD@z~xExp^yf-SxJ_mp0`!0hp;}g#|
zu}#&xvLJ%+U=;1`Si-*B3)u$t>djt96FA-!)yViYud-mCDtxGaz$@!{3OBm_(3Np9
z_MS{%<YjJtn%Ub4TO4L~JatF3i=2e={%IMIV3e|T|D^oUl(8=`52<MW%H3esTKb>K
z;$QM{{8I!MZdBig<Ecuwh_}VU0@&c#DcnHZELk8u$iuDBw%=h79$wXl;W7UB_xyZ_
z_IK|C7KBF;&OJ(3ThbzhyEF$q^EK=Km$v^B57$qh-ad(6zN}QdXD=!0J?><n$Dy^0
z;laKbmUt985|W0PZ`4Qa*?F)XTnZ{JL_QjXtnV9L-ntGDr*EI+&O<sJQqrB<WQ^?P
zpCzpmsR<oL41**fO9((1g^ffN=E@!vpPGXZR?LPaBGs@a-3l`d<d|dfg4{Y?^LyoN
z+ke&3ZCO{;b6TH>QYQxeFm~M$WiLiAG0^Pgt5ZV7*BkHZ7B9~MS5?PQywB4+#OdWi
z)QR@UFG|&!F*9YZr;PB%bK9X25D-=JcorwnG@6#PVt4j@wimlrxCoX<R7FOyO=%{v
z8{Q<s*usl=43|8`h9rSAm+&aQh~+(&qQ3xyL|k`abZG{%V-Knul|Y?Gow73Kag*v#
z;|k^8M^URqgUw=X*TXwbM&xx!_mWBLC4@p7uKnLRw~BF<tP(Z6Z}Gn#_wxLPaeo*c
z*2@+{pNHJsHhCN#<w2jw>gDw<FPl#c5A|4#<k0^|3;Sz>7OM7H#mU8Q@xR?v@|!N-
zyd&Pm(;gx$*F`a`G2fneSYBhy5I*dNp>B2k({<~j0YBu$EVTCL6)ujlejv<>z?+6H
zU!eNBPIV95QaqmcdaS*cSOrk^3!MRf=*5|X&CJ<j#nIpra?VtSo0d7$GY2{8dUZS5
z%R!kyhrA7ttgYh79;+P9SW*~Fb%^JgY#l6k`)RVY^pw+~luHj?B8|}6-TlF&Pz}s~
zFwzbd<fSRD>K74Z+teUlhZ99bCz;9fGm!#_%@0}f>^2z|Um~k`7-^KUwQq#`M`(_H
z69p9K!4hYQ;*L&waV#$72y&GnQLC0y73yYd5RU>H3tmN3Y)`kLv?RwxSD+GatN(Iu
zLTpQ7Ho)@!)?H&dUf;GwpVo2dD&5np{>AjmHh@X_YAkPG2Yd4Ex%Yq#B6?a?^!uuT
z|7V-P)8w%YjEaiNc(I*?!BF_j3{lJ1SOK%kiBlejz6`mTz3!tr%e!~<93C%P$h-li
z#8)UZ#sX8nt3k@mr_Lv_%WcHWN6M!P--i<<)kruT&|6j}Gv!LusjJ_F{Y{~&QMRZJ
zMou0AQ%~kmT1#5pF7$NBrVt?jmFZk~PdEK+B$!ITXQme`DOuWWrS9V2qlB&aIJC`{
zlQf`Wu+24W?^rD9j5?nI4%A0zUmDLo!g2+_T~uXW3hJB-mzswxGtRSwlorfHX5;h{
z+1XWGHuDxB$#C|XrunjnT(C5K;_X+Hd}|BLT!eDd%O=nFHB~6_iAG@b-~@*ZH$}A@
zDg5=`I!^~RRE{D8TgL5?BE=t2N8%xy9wu+A2)74kbM~zIzp|C>`R#WQA<#Q-xxU>n
z!F|{j2KwdP7~4w1jK8J3ds#Uw$9pxGG_{2nZKu~fY>`Z2b0w`B!x8H_k7^3hN9-Kt
zoSbuhtI@wW%GB=qpHutyzp63TF|A;$1!5sl$bWDVDMMl2FIR%G1p-m`0kFolHTc%-
zd7wk(#TD2l{8s<Z9Q}qAg_(7F+xYnAzd+cBo~(Q`9D5S&CUoS!@H%cL2z^PYR4er8
z_|Bmjx0af~Q=+zO+EtjxyQs6aiE_6yUok|hP@L{b-75Sq8pP~vmc&%#od<it_z%+o
z=hj=n(fj2gI$npcRwgSLV&}G>vS|*IU$&&8!_r+SZkv)GuMC-#fZiqh82*o6aN-og
zg1sCu&{O---mf#qAk1#~i0!$}E&GpThh;Grt!<1hcZlDXkolG=eL@8`(h*9(4cq*Q
z6rh$gnMzB-G)5yY2FW(!`*)P3LULebqCpXu{TX%_fHO%4ITwwkYr8?F!Y>qYFNrC{
zqh+>MSYkgd^u%=Q#$_D6O5Zzsx2QDwKm<R~40UD@zwXvGLtjoZ4wqd;R?5Dr3t;`1
zsv1!H<_N!pNTKn7H-4C9$C=GG^L_1YWOz#GTWYwlPRz?5;JsP3-;Wt3@L#UHa~eBZ
zhIJchyMs|`MYI5^4qrBOSLq$|0`q2YhzYOl2K(Fju&SyS`%52lDalt{TY#{k!vs0q
z^+6T8ViJc3^LP|Jz%TEmp|Rxa%9a$Q7kGibb5fG8dNFkFf~i{cA=#wvG?4bNkMI>8
zaI7|r=MOAP9eANyW!h2ut>`~UXRKCpV3+$!&$Pp|@+xH8$AqWcT()f)>peQLeUDGZ
zBIpT}-B}uD-{?yjXlz5*d|}x1qJ2a&{Un2VQ=GVDAxd=t3vW5L^7pyZt2*@0z&Zzh
z3mmpKPzBP^6x}#1<*E1~T-2sv))3GXH<rI=3erE7YAFMMGCwU*n%YUj)TgM)z#guc
zL#A>|syg?$XF)5FlElV8K+i$sm^^wP2#iQ@IqdnSYkb6xevCewb2!AFZ9Voo=oZcl
z83Zg1iIxE84%CbGW)~Q<CN(yRrn@LAp5+7|@1#ZU-xyVdsPQ2-+->-<s-D?(lXGa8
z#?s=b-joNl2YD3O!V%ka-UZA}en3Sp@eP}J_#X7+)`EN^acIwjiGwAvr2J#CP3r`{
zGym1pp1DkUtrc3(U7q}NoqAfs|FhiEuJTh*Cv;B#Mb`~ou$Yuw<k3WVGWUV((wFet
zzlA6XEWywp%)6&jI2@K$<oj321BRZG4BscJ;6zL{qtk@)DdRz6c26XKw{<&zcS!t~
z!tjHmm?_@3z8gj74YvzT;}N*b9x|`~!?_+M>1<{N*g$U|9_uxDnrqy@x8*(iI!)w;
z5k&pOpD)MY^WYSU)A6~zf0|m*^XfSldK>xo?SSte19Nuf{zO>NJEP0o##w8tsLaI-
zu32|Rv*91?%G$3x@+O&P^-G#*y+N)ZO06%|J~%F2)m*UPBoXUrcY9Ab?98ll05@KX
z29Yy|Xd&vwJ4&D8&xrVLH1;7~x+5kQzhmOl8CqNMX}WhC8<Q!U&4@BJ=L95kYrab*
z_GrR2REKwswo=h*b*H0Pv&*P52jVfUYr_tg`rUdSUSiC<xkvo}En?X3btkVqUaZ*s
zk8L%V{al>Utt&woT1dG%M7VA)Jm<8C;9<Zkm3`%-iF@nf&)U1}q4HQ@CKOy)yGuma
zI|)nXd;@Dl9}wONJ|+hg{KIX9;l_`=#)|*>;+M@n)76(x!i0pd?#8#N<^Mrlbr9lQ
zzFlDwbBKuc3Xks`A(j5SMN)qK;Alcp{O%8}cE7DH3S{?FRUl<ZpS=Eijfb$AB`VKI
zg$5J>iz1fzYrzVm7Z|NG+VXFA-bG!4^U3|Qq_#p&8;R9UV+~kS%Rq4|Hr)4Y?OpKp
z<vu{G{fTUmVzrs@-rAyzk<a(b{!mC{IqaJ`w1k*I^~uqrr0~9~EHa<5*U-4=jHm{3
z_NJ)!LFeE}0M9~XZ_tUni-oyKQs204FCklk>$&>{quIeg8WqAWY$#`v;@uLWGGo54
zGL`XR{IQ{`OD+*IINUoleWY#9Aue$lSN%=9Vu`DHqfHs>@OigQ<N@2?eO@QhYhb`+
z8BFf(I14OC3Z7=?4}9)9Z8mc6b?<cJZIX3ANFs=1$c!KdVT9hbJU<#_I#VLO)4gg`
z7kQqzJJYWMk?U7`yVW9a^9Whb>&BG`z@tqpKE)ARXh9J<pe2GWpNs6gNI9@XBv@bH
z61DpEBN?=${Vn9<ABWW;<^?ifn_o&c$H$MXz#}Uq)OSO4b%UIX0>fo!d+*;se9E2T
zR$E|t>{eg3e#19qW*p>_g5s-q4uqULvkv1le<IuDA$v>?qUt;%$Khgs{EkpRqbV_J
z;2N#PPA_esClS0}8iK>%Y>k6wJ5hUS1wM#};xB*hH162of`4$xKQ%M5l7(D7oP^a1
z*1zWo{@*-K^zEKw^Lf}pR~mX$jaU-n6jx7b#e?V^^948JH%@JJCx?Vr5VMvj){88V
zZV^C5+r|sVC~Pr)qd(s*i@aDUoxxVX_IQaf+Bq9xHJ}yPDKY#(FuYJrIHnz#CjABF
z06b~RW01>9?2TvNR3dgOlFoigwucta3kCGsqY~_gzsQtk^I9J-ljf%XgU%pOZ{&73
zir)9!U{3f~2A!QrT+D4zIR5(u?r}B!ZYHy)+R9A&a7ZLL{9USq44jmu8u&~wP%&;H
zTlvI?WN?_kVtA!&@}~37I8wpW57*1>T1zqE>uXMzPltZN^hTyiS<90G3cL;dB3SO;
zX{d(?%wA%G7`>?!rf`kdunqg6?UY7kO8$3FKm6FSyC!@2!hBud<07-rkkJ5YXMP&=
zCqMi&eDmxga~lckGYnGeXK%VnySQWDKo2)p%pZNgl${-K$sb5Y`MG;2zKmQqp)xto
zR>dCqSE6iSy7yDQ!|Z#SPgO33iqdBn``(38pXKZ8>_GmUk__P%{oap&1xO!4JO7T)
z{V%YNithfwn!P)a{iR-Rxx^I%-T<s?1J}Z23-@L9P9A_uFosk#ypm*<3e}^l-HO|4
zvFm((WK?uu!JZ{%eSAFK1*keKKnMJ#&$hR&zfS`c&Gm9k^@;T3rvK$9-)1y3S7%S*
ze%(@gkKp1>K}>9Hyj0GWP&q&+!Uv<Br*iq@zw?L2IvJB2RFrRlBE1pSFG808w71S)
z;EK96ymXc;$OXZv`4r=PQ~K+AhPT|pyi46r{A#O)Iul)xY5i>cgkZ!W;#-j{DPZ_j
zM0)ulQR_{qWw5=2xueRmNPHuXY3w#J0QK`E@t06T4$$=k#oM@so!NHW{yBdRo>C*t
z>nQ`XH49>bvllV<rfN4%0^8SU7SLgi%g4HRT_^Q$DNXO9hpDv975SXi7*j;VsiOL^
z#No8NnjKHFOkAY=A@1h1M#)xwDG?@2ILoaiWXhl`YR{f%?<4X-=~6fJ4vzbE+3~<s
zk?gv|II8JN^=vv3xp$sOUQB!7u>*8vGfXvJDuq>_@tCBbJi?HC?0px6?-j$3+77kU
zogeN!`)Iwl(5g&Vqt@1!Z+4R(Wwp&jwJrD@<oVyEtppS<1L;9e6^=03D>moD94N=p
zXwx>IVd`QH`@av*jZK-GwW}VkSa(l!NVXp+1<ZT}UBvAF*lV>4N=V<#?S+t;VN+$e
zejqZo9^>D*ZecRlVsS+$GB|m!;lTJ@$Z3rKys(=$QEJxxwu|C_08x8Rt(~W8QpZZb
zd3ot`@ANJsX6N2>qABxuD@0|0TJ$nB8S77*bh%)mzkE1~mvR^+2=Lzs)Z*NS-zEdG
zU-&m(C)?=KJG^y{HQN&;)=xQCZC}5rw|dHXX(I$5;tRPp&|vgF+I|i_%q>1|TpjK5
zQx@fxqxM^00kalpAb8rVvl&vN?=K%L>~*$SUjjE881g1?#pY-#JX8?lZ*y3~F8aFZ
zs{pso5(}r#8KrwP(Ll6vbZSkA_Dp^guMQ|^Q5;vZE$rZs-ePfC^e+JAPp5${+T6QM
zg0DixxeHjt*_Rl?;d`f1(#Ds4GljJazr%mU60*y=&wd!MUEH(`Jx>FOC1j0*`#@Xj
zy>mcYYQb1N)9a1->6w4&`~sg6eC<NY-<?XA{g=xo>4ou4-2Q@Q^%GRW9B`229wJo6
z_p&pWPArP5%sO=AH;h*Q&fTi^+fNL7mKeVk=!OtNJi9|rn}c078gE@M)@W)S3X$2e
z5o;^?_7;jKAc$Xu(;bUyB82wbkWn_-Y6K4%w}T)_q{bQB=%SZKiZ4x@8ciHL>1nRr
zziGl0kuqrLuCBAR5BUMicTqbJ#fhP^aHamvROG-~zgf=el)RKB7L?ATTw9><#u%J~
zRjvY&VrTw#BR<b>ECw^mWd+>_57_QnenVZ26Ix+l>6yb{!qtnu)jQ+;dTuMx{|CVQ
ztExlyIC#S*0t61K&!B`c;Gs5H2=ubf(&IX*-l;+5lagJ}(m$GPo>zj>BQ^R~O%`Fi
zyU3n^<ur#JepTw^$hbZQq)1?m-?&4OB+8DSMm23Mp7Rd(n#eeVy1L)^`~FL1W7S#o
z>Z4HPe<B)SdcryOM1DO9ee*(5n8)as9rIM%IU&)@YQIZ*8qI{dJuqdbLpP0b$eUCC
z2e83pm&XxJ@;0^z#}eL4l!V3hk`PM7`8F<YDn$HGzgUiO`UX%|Y6CM&Q`rbV<pL3K
z(QnpG;ld^R=?*U=wTetSUX?jCPwJ_>>Pa`xL&s%iB>UyzF>6VEvML8rUSk~b6`daK
z+>`Yvp59D1`qdAJO+(FSwu#ew8r}Q`4T|!`57dEdavMGJnkS!Nko_A+!FCI3*^I?&
z`pvmF%dYJfD^~;p{uhW2%%lOKOa_F#Pm^Zq?pBhaAmi7WoWp?izrrdQcUaJN2s|5;
z0RA;uyZxtuR)gKjeC>pT>TX_k67^>18KVPPw_*6=2nzmk)i}rA1|R1~WCgGot1@XS
z2DUb&$@r5s+6|iwC7DqzY;TxmR+&cqu1+_&$5wSAZrll|+(W<SjgpHlbS{7vW*trF
z4B`K+e|-t?Zl4z90LW+u8VpV8${+Gg|4UN6<S_mP5i~??R?KH7Vq>tb&8SUeZkdL2
z(rnbWjN!i4u5VX>Vf7s|)rwHMm6OmN>10UTTwwbgLWdSgJ99X}&Y^b<Yg&BbG{=1(
z=kE~|J-_bnyXi-1y~m|i7wV?n@WiS;?c@SrV>+ow1KYHc%L3;Ed|@s6BGMJ(6wA{2
z-z6eJjSsM%>qavoKOq{szQdiae35%`6iD&3e#mfVRZSJoTj}iaR6jqp$$8{vRCeo2
z9Lou)uA#5l9N5Fy<wZF^w6-%#tuQZ$L~_|SlcLLcG4C$nc(|CF6(_!5cmK@@E&p>O
zGJR7sHav6K&_x=SnF-5GUp7Z5((`-{(6i@rLToRBy|>g#kfb3^iL|RwGmi_4&}{bE
z$jdVCL>@hzC3H?wAiSEt&dYq044%Y~>v7e03Tte?USAK_HUU;MT(%Z8o9)qsTuBcq
zA`DSRiF!}t1{sea1sL4hqTTrafN1AFfIn2Y7y=HEcdyOG6Lq0IU7tS^Y*SNovOx&h
z5?MvA`=K5zE>CCNWJtU)>1k4|$in`qR0C2U8<>56Oyy8G@OA&5E7FZMTNmY7764N6
zxq_d(fHl(!9O+t2+Q%Qn&8bC4ra%2_QC?lVC%11(2W`<vGT!x%H5~Q@*o90Q6!)2V
z;FiIW_611Mvp`bH!J_;&E1%FKj=f~4_6{yCxa~>DO1!mb(7`-Kiu0mQgtsB__a(E&
z$@G4L#hQX+`Iq}>skX6kfTh2+#5qlQpnf+J2*6H3J7ZiSIcc2Mw&YQz(F_{B8<HP-
zb8w~r>hcA*@9*-mU&%U2L2?OYv?FO|-p08;#-U}>Oc*k<IklzH8GOJef=R&f;Jx)j
zYJoyJBrV|pqNdRhEZTWR6d(L5R62u!R~v4@4bAy21k%f#4UFe7zDH)Kz*cK7I*Pa>
z_s=_Uwh)ecu1Jb^E_?@CS^dmT8v6fQOoF@d8=veioz0UL`)z;Vbw~8PSC?wi8v)9g
zke;i#aq=;G$o}k6*|WRpa`8V=f54xNt2-=CVgRSKBq<KBBA}hNii}@DPuaIO;~M-C
zuhp^DPvM)ZD#fCQ678CKglF6N_MlOz<GGPhCC}ri(LZDV7R@b1yaI>F<_wm7=DUv%
zY3Uz#@rVwi-Bd1Ci0__lb0e1jqG*;LXed9SPCVgi9a@(8dN-KA{~Erf|H|j(vG};-
zG}hyzf+o(epD#7MewRFfm({I?XT*H3agNx%1G^ym<gD%bPcIG^%nyxuoWRNjee#t>
zSnrO<w9d5WR)cY1XS%oF_M5jAA7orailrh=^$}>(;7b>ESquPQY7UIqHS7L1b~`WB
zV?)TdqiXN_X^f_4yT}6+C#-Wx@?atEP1$)WXrVQZci-+`Lvcdlf>_B+(|oa7@JluF
z$PcDRfL_h(-h~)=WZ$oxf{>1Dkr<A6t2~1HhGekEyl9q=MJ87_{*L|wzO#AePpvIG
zk7SfZ#rmZaf`7``y}#nUG2t)mCrPp6VZ^h0^vMR7t?dm5&U~634gB1Q^4XHAyE;xv
z;%MzYF5%bEeiY;@;#uwPa&|;imFvRJGxv~H1lx>!l?HGI&^eSz%>9W-7KNFAWuQgV
z@7rBjdKm#V8zkJNqVoa_F#unyL`Us?)0qi2=RsR!!1exL9U2Ce?~eq8R2~tN7sr+6
zc^AT#=sY*~(8={Fp>gt)XjPZ1;IU6K*uyyUU(FCH5y3n!V^yV|RoyxC`z;klnh&0U
z-953AdMlZJ<ae;RaB+^V_0%i-bP%-5WThv~{vpDnZC$9ZfAit|f$<8^nuMvZz-PlG
z-%UXyw>jSv@YJ~LV6m4;_JH&=oLr=@JazL|k{J>-MgE&P-<wzVC20_O@^Q?8IQ63W
z=GaJg^VN@7|3WVMcndYQ+Y6tvZOw)fmK)F!nOU@mjFyYetp|{Y>v=kPqV9I3yT0z{
zr-hmp136u@;r23MVzmws+o`p`bS}^QG?yr_tx|f~oq6+Fa<R<2H|)Jzhog|qlcqTf
zuyanMvB5!{e+zU%byQkYp9tY){I5}&F_KyUl9$8PNXuVR#@?1s&ORg(&=kT}fDkuV
z&y!i7xTQ%HP5r>9-ezs3GrkltI6I4vy$qAK<SA<)<!4*ySEl$FLPTye4DH-b#oswZ
zp9V_@%Adu)<9D<?hpl<;piG}|p7ru2_%G7%X65wAm|NHTAHj`L16}=zy{u<Q|6psr
zt^Yvg7G>Vg>^W%QVW`Ojux0#Ru7BLZ?<*p|Tgzry9&T7CUW|)?<~NfYN!M~qjJ7-u
z(c$S;z7gzW{tHpb3=rvH3d#KU5G@RQeFZ8>g}sk6Zma)=$sa4RLpz;ivSUY~^0(7g
zPUP<?X)o)|m$eA~$krqre!DRV2W|IOxrUAhe9#L>aC%RymKYNc>g1djPgl8?Iqx$S
zrX|OiZL9dwKg<hS-;D=tMOG>FxXDJmrz9_^t{=(h6^zcFyZL&q%sBCQcwBRmRPl4G
zXvWO-7A;(3qc`<1A=&hxJ$hmdAlPhybj81RT_jgnIr#M7&#5UeZu6Q1%0N=QuD~Vg
z4qHSv?IdsMIA#e4{@dJP{kOU7GG-s>-OV`+SJ%>-M`qk}d0Z%>-4|_mMyl~HI{=%w
z3RalunV-rDp-jZm^kvGn#=J!`-YXSQK+AK>N1x|)0@lGDKaUWtRiC5G9%_|%V-vNV
zZ$b)ZCR2CiIHqpLZ>h1{NWj1c5^eP;kpmjNZhI^6uojlz!fixFdwkMWJNc8_+Y0HB
zAZ#iI>w3$jKxH(Cvc5gKz!2*Yh2>v{d%UD^#y$Rs@rvF1gjFu|OJC{c8jIRB`yc90
z5pg>j#<$$Sum1Tuu(m($Jylz+^aR++<WF{Of2Bo+w^<+1TCX-U(oo4~&9Zq#y?sf7
zM=NHq9W)a3hbz6xVFsiNd0s+Lt1UojEoPoI)-EFd+Tp_ErPUq))>iW!U589S9Nzth
zrkcQ2!TXKJyn;i#cn>q$pfD!ROcb2Hbup~T1?wNW>n4l<V?|?yV^&Zej??NPv(eV|
z0n)I}!@G5(w>Rh+iBjfn0quH@k|P@J5uJp>6ieT;&F1T_(1~CVuTv&MM(Qgg9%scL
zub`!XC5l3}w|NZ1b_tSXMFE?K1=!M|lv%LGiRuTE5C3jzC*j$F--?9*e2ujhh|so!
z>pC4D9zbJ+bKHYgE|mQR$O{bF!=<0AxX9FYW@5dpvkJaMo5)-gneC$i7rat!nC6|I
zr=yOL@MtpopmsBuBo*|cqvYle@W_K~9mi?g*L|!AxuWTak@^`nlaaXl6S_|sat|g`
zjOW;Hwr5+fpk4I6PJSvprV_pc#MfvQMV8M|Bp+gHxTa~`I+7w@TR!XP5B%GaMVDj(
zFFX~g46NzeO=frgxO)<AD@ZXKb>=)g2%WlUDjY2R=FV6mi_Cak(_g@B`NH#z7>6!O
z@lxA=ERd&G*)Ahb(Ew|m>x@|3(XlPNr@|gEu6ArtX1cHvUTnaN!c*j0R&>+=#7i?f
zHi#QK{RJDffr8WJC9C+hM$QI2Q$Zn-Y&&GHD(5e|rj%z5P>mo_djY8xW;bwc_cWLI
zsYZTksULOXMQ<G^sc<oXe4h*GTT&;LbY8ftfbpl)zHHHGF<`i97g7lBmXWtq3DK~m
zZ}|JDk?XtZIy>&iUXm`SaaVi4Ik#U9z+X5Re1Hmnve%TkE}mtqk4o;8lp(68nIbRv
z%6-I*9y~9?f>&VYLjaS1B(w|9r025{2E$HlqK}Uvsvg_8`ctO5u)Q9I=Iki9mQce=
z9ml2=hUt#F;ze%1n`t3mkI*G2YbdO>rcAs`B|w?}ma2CWjoDPoL-$H`K;c`aHs0TZ
z4Mx@Xj+Ow<MB5b_{8eV>6cLKbBaGgZfAXOoWQkffl=a&2m-rBJx@liqOPkc&AB|g4
za5)CdfIU9{o_Rf&>?#`%B$F-OB7DDYIA`Kuxi7xTa@O>Oq5y!67ExgIJK;S6G#w<B
zcAeOI&}clxdA><mb@yr|m#~+M@znNt5ntWE{2Hl@-KZn&`Hrtaou*5VByl5%IUv`#
z`T9g&*GtKzTfU!_i{B<!A@h~<j^X~R6*QM>-;K0o0fl?5>*6%RGhe9eB_eU9Q2nmb
zLK{Jj7Q*~PsJJ}++Ba1CSjM;Xr}LpCom(ETJeQ8K|GC3^Ui#h&TK2<3(UK3li%;nf
zotjcEGAs6Soh7Uz77NP=HUH4BbOy}H2%#NEuYnEpr|uv%Ce-IF-AchQS?{R<4h5m7
zExL%k)>iNBPz{Al0I?K;rNOD<Yxm<DdUc6!Oxvb3XlI>){c}lQYNOZfyXCJnR%U@4
zdWnJhJ<@BEQeXjkh%x^#I!bQLAqW!t=XVprn6BzJy~mIHmY}dDN;Dj{0Ztdf5>>KK
ztM4TDFaxBS3AEnfpGRr5<AT0Tm@hyBxg7TIrKT^Sdm$&$o5qMBhnlXt)9eYOe2@5u
z@VIahlP1F%vlgt56nQfioEdVhLA3%|QeZJeTC!XbeztKb<l8UFl)z<V_);4Ext@$`
zMl3=aJ>juAh#VcwMtFDuzBL6W;VM1@hL-Io1CadMQh55KeDHd&r|^mqvYxxPdm`V!
z%D==z=cq%I%o02KG06G7XXAi_5)razql0QXOi<BD!~FfK@MxK{s*kX+_mM5R|M*+{
zn_hyv75D2W-7NNfPwyO(?H>;$#jP6isrn=KO#<^$t75?+yB#ru8}Ezi<iL{x+SiIh
zFs?uK{oAnZ-I^T=;Mhd$i+R_`rXgc)9FMVWpC{)w#M~(~>sN}Uj1NzdDq)r^=7QZv
z4krx0tu9w5zWDS9D@u9xTmFl=O>R30kkp70Cp6%$c0yvhbzXM7S@bXBwD>pQ^!2#L
z?#8vO*zf*d(_QZBEQJNJrhPNfz7`tL99<2q@c1{ve&uP+o9wb9UdTVloDUNB()~{@
zCeWo`#^d6{jo&lZF04sdG6~99_M8X9@MN@&np0moH<iCNHY2d+6+B|KHwp%g*Jl1+
z*cj6@0zSzli2)xXa3u&b3^)e}#ZP8o|M~8vNleX^`q75dQF8Qv2@A%3LY@F9*A+VM
zTIi_VT}cJ26*NYa{JT#zDl<Sdd^hC$C^rUlK)kyp5r@)k+GoPLAfR;7C8gp;6IVJE
z<n!=HCZDxD(8OdSfzKs}iEgSOD+VAzZ8twh#_0c6)wtrFKS$cge=+rw80ZHU++`Qp
z(VR&Rjd_$a50cSdVz-UV_X2WnvE8B>f$+81HyeP>iOu>Ey8B%m*Vf?Yo!K0yD>9=s
z&6G_RCJZ>b`X`UvjV%=@r()C#KO6x+5(8nWbh5CKe#LC5*pUZkE`et^$Oscqa3qis
zr?*WWy!ykEHK5Qb@S)<|nf-+~SFP&P7TSZa11ebQ<{ybiZ6|p^yU+EH|1AM4$Ib&b
zz?g?j)9=SC3#T8SI(?Opg4ZddPbBa-q+TTY=!a51`T%b7E$?*r<C8rJlHz9ougg}m
z!aHrG#otcD(kC$PXOniUrjug65ldfSx!vs7k6tQc!sS*`Mu+i{{(M~7i{x|kiM#PF
zbD8;f;EQ(zfJ3qK>7*j{Sk5E!D`3H;0;e2xu0e;nx%10nV8@x8Cn7L%*^8hHN>wi-
z*KW)rb30-dARX6qz1a07GlJF;#r@BxS&$l?_b2pbo*VjIIE?(R25)RP4S8%+w~_0J
z2n9xj`y%p9Tym>5s+H8gL2)@W?ZHqdPxY!*L__T1%5#96)?qh#pAElTbQmNJlk7F$
ze(%J>QoUtu0PT%6OUz#XokN_GIYhIyPpz{%fW{skPjn$(kq?9Sj=tb{5T9(j)3_0n
z4LtCOIaAF0le8RsEV0xFK97n$N!*$fiXbXJfG>wBfbD17m~$Iq^oi?XpDj0GX^p^G
ze?#pxaIQ6PJ$D{RC_Bsjf!yxO%VIYizpM9nZB`|0K$W&c(4K>_<5x2>M6+gt=Uz8U
zzXLx$>nH7^^8Ii^$C)-TJx>J^-h}ajN1L;J*nFnZA%MA_O{eqvJ1Gk&9n7KgRcTzB
zB@K0~_*xlieD}q|a$?~7q8kSj&kMJ8j>z0V_MEEb%EDA?Q=NtUMTuxT&%ebQlOc@q
z>xfQh>*68~zG}~*?fik@xfA(;S)sM?T!5^K?vKjZU7Qqv&!gG@<1C7itrn+}z$IBL
z?^xo@ZTyRXMi0n#l{!iLtnH_H>e3t<zSzMQ`oQ+na<A+h+V%TcvMObw*V`TFNZYAQ
z>sCxDEJczY1bj$cPaaR(WW~wyGR(YdI_re~)Oz7X>{<-OYn>PDOF3jDJN^wPTpU>m
zYwJAe8N9aK0;vLv+}~g?nHd(EN6*Exauv?IEPJzmIh+_RE^(=~u{rj|PXp;;-Sl8b
z<#H|;mjnkOFE}8DzVT%Km^afiP!DI5R)6ot?SEUNa#r~Tpt9rSRIpeGb7UEK^Xnv6
z2-yW{v@pw@sX0Z-<B2N-7d+~2_OY)Yu=)HYp5r?-Ypar<nqCE%lzNBlP`C4I`C)~x
z5YqL#7>(@c%hG*=@W`FAuTAMI|Bt7)4r}uN!@j?Yh>|MOX#h%yG$U0+R0Kq%Moe0m
zv~(#5h?Iy@5+VXBF={lMbdP2*I!AAe!8XR&bN%k;xbOe==XM>}K5@R!^L6@Ewvvq~
zQ1#NrCOS;(Q>@0}guhDQ-M-md*oY<deE)<l4U@gq_@WbdmbZ>X`d$eCe3>92rz5^w
zr4dzI4fr4&BZX&41Z_3z?c*L;8S0s+ZJk~AZWav_Ehlgc2{aNi$X~psV0B69)%;?Z
zYD{(4d0($dV76cxd}bs^>B~x7fYuU^ZE@9~F|t`W@OTwH)U(UL1n83Jw~Wghkl5-+
z>z~sbuC=HK7V}XNi`RHunp9`{-mya?_RDj!LSEi3P6z_&kO0>MG{*cy{>henu!Ju1
zs6eZWk%an_EEeI;Id;WAAfAo=#RzN{HZZN-_y1yQ;hHiyq=l8J8vpC}qc<Kt{u+^@
z5nf9-Lfxe#43K8xjWsvI7HtiDN~>)9XO7_29=?_B+4oP4qpTaS4}5&Fd*Hnf`4WLW
zldL&$VQw+4xRGF)>e<cd)m+a#QzGVPI>FNxL$A&T5*gvp)?ui^JqE3J!%$h(gD630
z`-nlavD%!cu2C16CjNIrAuG8z01l|4&Bm>)qF87hk4|?-vDXpH<hubKVdpphI_rsT
z40jGb$CF+MLnrroH*Ut?+=i3SbWE!puW&WH10j6cOu7A$&|Yo*mxH$A3d*XH(D``>
zMI+$Yl2-kd{LrrLP-w?h(kJGvl_D-0NBDUiu$7N}qFwIVA*o)?=AmHLG!_U!hb+Q*
zvk(^T;I>uGDfKJDRl+p*p8ZPh;*NTc^j|!7@qRGj>Z=LHY<{kgvX+xnYOYH3M$#jg
z`w@G61$<+_IaNLO6l43=<KKPo35U>o4$DcXUH?ho7*bXJyY<EUq8A{&=Nms$Av*>D
z3hy9W*U7*9+4GLb<EC{URqSJ|Em4b=NYV(&ITTLx1C;ti5sZb$1<ij;rJQ*9MgjHb
zHtapijcmCuHzMcjP_@1J&m^|3Zy<Ll8(DvLuIn(}AY)P!s&6tVlK6bo!mjd@4fz{#
zvKbO=`JcKZOi(W+vuD>2hPWiK*q(W2Xs%OI9;j1YNI+Kwc)n`r3?j<cb1uQe81ly&
zQd*j=V#J?M3xkRejlL7N*s%hQhv=UzGtCbmj&0H2%D)8ZK_h5l7Wr*Yvv<YCQ%vOn
z5K$rwJ(~yRU<-kEDzf31u&h=-W<;6?x?}{t`v~2i=llwYG8$)PIcNpn&MDUx11%DH
z&+*UQ%4y0MN(10|M~tZ~)>CZd)?{e9q;_m5#4G6#5D~3%s_%RHrXeRO!YYvO41%<h
za<lI+AqmxDANBtB<-oog3Z|d&VDCG0<JAW&hOeMUbq4co3S<Q<xfwB$QIeJHx13z<
z+y5T$IBleT9=%Ron98_sn0T<{r+hD=m6`O!7L(2Hf=(b<XZ!Yyw9MK)J-U8-s1q@S
z`k{HceD*AYdth#h;FKGdtuXdtiZkbgstK=H)hr@i`--(+SkaVuB}BBMh?9R6jICVs
zbRuUlQ}we($k34pB_qMbFL?!}Yoxv6w9GVIu+a@Fbj0Z8dYJ0*#^2Jzf^Jq6>3$de
zrL$JKE+nWsiiyMFZDfo*%Mw(mTu_@J7uJ(uI<FZjL&6X_bcYRunD<zK=OG;*&A^-E
zGR8!#H#_djEQxEt!MuEqp=?H_Ye)tSz0J8#`oi)787ZMMym|5x+>nrgzl9K?ZPwwD
zFMfqmQj1U~P-EeH>KB{UQ7V`^pPq+%DCS(GiZ#6-e;E&le@=f?Za@9+%-2i?2#bXK
z25u<4AXDh}4r~?L3v!S46fk&oi<dC9H~T~&v(S^q7Enb7I~ZCVb$DzVo8M(TfyW4s
z_1@_VEqZ=e>KNKjnmK*$f9DBv`#si{7lIKVa1oXH|H7Z1F)i4!2(r7f;Q=T1q57>t
zW||NY4@tVGVS05}f|(jk+X%vBC}q%f*|Novhp|b@p^b8TM|3ympDyDQOHqah_c{2i
zZvUGjD>1)oCt%(y(CzJ6D@cC;A;RDe5p$m&C|_OWKdSG;9VSCEWvNySjd|kH*rUVE
z`XHarux8;VkC`5A^@$1>?-Bm3@cV_QWT+IsMajIc3h92U<v3_8M8`45h-#7ABtpE~
z)a7{o;N(NZt>JLL=L-excn=lag2bu&5)4q+Y+ZtKeWiHJfD+vA2Zn>1^VzkwGr@3|
z6lzvu3g~wk+SX?*q9Up(GW0)7n4f1Mj_=v1)y44LWO}|`jN52?&k5K$6xDsR|GIr6
z@L7Xz=i}Q0-GYD%5xege@?Fgsgwt}fb?-=PG1nB;1vgg_Q>oWQ4!mlg(fU+Cs8vc<
z-gL?yv<bf`_U2(q>};l=U@p%*Rd@tCw68ZkEh+_Yyva|8{{uMQJ0LTJUvAQz?Ym0%
z51(nNvV8o_*YoZ<B&Uf~RRtlOwLwU!p3gs+{;_y}?B+p%cbSUC|B2-782}Aj9D_fr
zyz~WC6yt+#q08vQN=n5DyiP8@v~QI9Q&#cr=0k|pZ&-P#@m{iJ4tOrOq|rqvIXRa7
zStx`-{RtlPHC>Bz&F;*kB?|!ebCBuN1qZV8A0DPb`dRrzQpCe{eR5NR*iTo9(YybR
zdA~iwN4PlayTH2=A-qkQO^5C_ayY%e#Up6&Nac8=0~p_#+z4l%4=-jSt$`QeO+!I)
zmPQc^jxq%<K+WaM&-?{MrhCc;v|y?Cd*CG6M+cb$7}4LZF=-W>G+3c>f&8zefH&#C
z{Dk_uidz=}qRENlgrKOW<0bL%9#iZM7xyTg&D9s;#~90zO;%Np0fTHyaP813Vwon_
zR3Ct9(({CWP&$-72yqyi4s@45I=oY2+y9)?6oSD2Z$fx@-j4TtThrb9PqwC}Bji5+
zTQL175^Ev)qTnWch_rDIXP)>(`zl6u#io;kPnO1+JMn#J*~k1!m<&ZouGPHmZA{m|
z-4V1|+xBC^*$z&n`bj>*<;@89KK+D*FHWz__(rXEwS7~nu<&cP-OrJ1dXDO0dbjE_
ztuLz{NRZLlsCiODY%#tMO&*p~rNIB3V9p@%|LROY=TTuhLA#74iRI=Czsuq$iU6~V
z?lSu>^`sT8Hi8yjeC91#SJYD`hcX|6<{1%zUPH7bp{(x@ZUlY4VNpMzX<SNm;bR1Q
zb;I=n$3<^5RK)k7-LAU-TBtBh`S2d-Sb&!q%u*C^OqPjTxT8T*_&hK9C_ueTQI~~u
z>WV+$C%XXy_pR(my3)+T%_Bf3MWh8BeoyXMTFgj40iQ@LI<PBlg@6E~I}^1t+bB4C
z?G^JyS+>2L<8Btu8Bj@_wm2m@Ism9NEKQ(hkRPQ))$s_^?<WPTQMu}v0IJ#cy$feY
zq#Cw90m6+z7NLti^J|#plFEHEUT5*Qw^kOGk|dg(;kiAso7a+QX9`{yS}el%ZEaL2
z@YcD!XM3>942M2Xc46J`=C_f<Lv{g$?Kwz;+~7FU!$o*WcR11h6t3($Fs`!4(M-T|
z-Cov-i71OIw!x3Zq!WO6Mz7G7h{q@HMqWnl3f&*5iyI7&1++{Hme8ZcbIP5qsU+v?
z<|+sdukf#sqL%Jw+UJmyKxT69GdYxR;hs7k?EmmLXu@LS_6O$<Hyy3`mMc<tO!}kN
z>h;A#6=$gp?hN8*4m$hk%!bjb{h`XBz$TbOpwME4-eBk+v)nM8cow!>$znwuS2%%A
z%WBxmz&fvZh|L-Lf5!J)XM!&P@iy#=3~7shv?Y=ZXPR`>rkwDeVCGuYF(<uDo-2@e
z)Jb0EE&i7mXWi<y6HUYsk-;PCa!i3<{*0=ZqC|J}gBMHb^eLH!sXJq{uS7&WuDpC|
zb(QjMs9HxgFEEpPxa%whp0JifcECOEwAYSp{x8oZwjV3eR`3pwDLPrsiSzv_<CPq9
z0>w7No=_*(Jh}c^+;6TOI;px=re=3F-?O7AJf;1?9Pvtqx6X)$a|6lum*<r&?7Kjj
zmb4*1@7zD64|Tlaw%hZ+mG05IlNA#fLZzNH`wKuTlKJAD`mM$(F(b3jZ%J$&mkV`e
z#=bDAT%}gHF{-#_M-$>tz?-nDp|^X&FX$yERR415%gz3^Bkwh|$J@{0#d{8=`{^an
zOp6XEta4|ru><Cm^KbPrpNpG4^>H(IcRf1$jp0X#6zoNi$Ew@4!_QLN9ozf{nyUth
zM=z4c8<TW-7&JtDPuxSfbC*mV3M?ci+Z1N!&Imh%fq<kRuq?#bUOdzbrpLQq!CPYz
z#hTtR=GVApPcfN6oVg1xU+w7I(uXRTJ=g2N!;}V<XaXU`&xc7sUdbWvAfWU>id@-O
z+UYC*O9fJ=^9?J(O#&-AlTgiV|M=8S-PfV+JWS3Tl9QLX!(7>fY*3g-VQmFbj(B*q
zZJt3uhA8)TZkFi-y*hAQM=k|pl=T$k+BLRs%>ZdCjr*>Z$`nsKU4}B1Yt$oFA^Nzd
z2xsWe?GlYrs#o*YD95WA<%1bifFtS>EHk%LyJ*-~4$>cXYYF|eFmI)|pfFY%_jTSG
zHM}<c+UXB=ygU^C0fp&nIqEZ*FIGA=`>UzuHY2XN`qepX;Tq|1gUTP=b1`|pW#nME
zMo--y(rLA{Il5u;oNYSVZw(Y;33U}{)Iv<5i?eTsAXeh575)K?TD!&c*Y7U@Q~xJ3
z!OmrBVzhf#Z?WA<a__9t)<h`5dghZA*bh?8JrXzC+E{*PdAAFApI2-W3@=mN@-$da
zO%Grp%Gm_UsETN511OzY2A8(Cdut?pT;+3L@J-oy&;U1Y@E-ilMPbAW#43a7ZaPXw
zzq1V+3;x~geE707+;#<Rw|a2Cr?aX*oU49t+G0H9_?eN?CBbI@L`GQi+EKVIVkM@#
zFlev?*ob6v;@;RgG?CkP@FF?KT*o4<(12jGtq6la@@2zJ7FcH<Oeo7MUZgW&RtFEw
z$qaHc#HCp|Ad|n9L3Dgw2Q0ZZBa9`kYx3g3&CUqsR%-sG?2ny-@}x`I@~OFzOwI*@
z&9yJgdDtBE*BFsz;c8A&Lq{y(Wu`S~_Q7%S2-4*sh4<*EIxzisew!-qC>lalJzX&7
z|3s}jI;H>)o)ly5gyLWEIlpMp$oIior-INW+C3|Pq9c@07>K`)=NlcWkiWz#Q+g4^
zak<-6hjOZ$#+Xe^>#Kty2Ju2<T`2|o4^>^>HY?WC2s7mcP}}$BWAvB%PKne?^!F#3
z=JPwSn=IZTRmeVw`o`viIrJau(*@{0eBQhTzq9G<COkY*v}nl+&}p*C5w^8NpPXiP
z4JY>Qzpo2^lEGEE%Cbi1J$>@&&lh1bCsnKS;V~deG$}gTXusqbectlp_!)mPxRWG+
zhu6B@ZE1e5=OhI*2q4l}TQ;xEwkmQVuOR%b)G|nR*I6o2pMQirBV&Fy3VIIgjL$NP
z=%xXD!d8pJTa`?wm=7@bjZwpB%rt#ur118EBqZo`iexa%E)mqDLRxt!&xNd_m}0ez
z)?-mN*=Q0ST#)4YZB8a|4mkgk1P}~tPPZJ&f>HN}9&J5C_y!~hXabt5!oNh`3&2Zz
zWoj^n9#Q%N=byb@YhFzI?|Mqqg;ybQaM^m~E5Fws%dbpNFpJ#W24Ct2B>Fybc@i2a
zY`sWs+aSI8Muof!1>D?J49flZN3x;+8n^hc&fXKG<lb!!W?9*F5L>BRmtLN4+QD9H
z*rJezcf?!OK&Js=C?xE=EPaN2J#1c*#?OKz<XAF=q3#_tBxpixj^MA`tIZ!bH@8^K
z-ez?TD6mYfP2iCVPx7PkN$gGMoUDZ93y75pAJ=6mlz45q5lz$cW(+q8AwhrUJvYjq
z4gJvYGx7-4k(+Eb406VnHKSC>jRGZzeYuT@_;2IXj))5)Y0{KpK24KP=30oY2+gbL
z++)ZinGcYDwm=R-Bun_$N~k0m9&PlfeT<i5!r>REJ_!_P^@DS2gC)RW&uRxcBd)Ep
z)uQOh%C6rEa~DusJSacfoF)xRM9>yaMR%XQ0oH?CjW6~({@2g(75h<?sKZkc$*5dO
z_ZEo{ac@I%)AP@2f%jRfG`JUnh*y)OX~D6CaBo<ShK*#sBAyg!-dqXW1=(s2u@@^?
z_D>A!l*`E+Bf5~;%hRt>Fimf`Q^ygrITVZV?`s)46SJ~*uI!8s2Orz8dbvmceGt!~
zu)DTK7xb2UvEe_MlEx6TFDJI*b)}km`#z~*5iL(=-Z|?(<itUde68@fauH2PKyo4i
zyL=%b=17F86mDGh2)?(w1^)ggXz=p9=@Gm`vKORHWS8MqWvo|ft(4ke=Xei+0&4@O
zI<_CFCk9#ct=HxbeD#fwaCeQ58kyYX;@uc;cE4_HSO=9d{k%BfUC^-o^hyK4u#`J3
z)UR139>?`Hv=x>(AS_@#H%YQDoN(w3Yt51R8JdiTCYSSWe!BRQ4%ZHU3|N+9?q9kP
z-pk8)Lhn`^n<`A5V!tW!D&g9CGs9j$>G^J#c)pzhm5YH*><yCuaH+f+mvS(Vbq_K8
z$JS}@4U-wyGx@%!;7sBVdW2K2EDpi}BRZFXuw*bdxx^N4eu3dGhh_8ncy@`wTKZ%}
zMsv|!(81^Z^~_Se=)()XLPYePqY`xz?~Lr0uNqh!Y(hvdBkixw>;+aXRo3W{fi6+5
zw*hxkmnz4v2b%urE?wIhnfYbHacSvuW^D6EzxtCdhXz{~<<^C#ZZq;!Co<nC)k`~V
zNaqgm#)^bZurtmE2H(BXKWu1UiLtlIBmGY61I#&oM#H0?<t*6_E3W0Eka&*$QppgK
z6{WQJ9mhU-1AcbsCNWp|?@F^L)2Wa$O34F)P4|W8`vK&V8qj_79|8LP;}#HLV9VYi
zdVvvFCGqa31#ri8A5~L?j*Yhbix-jXi(0ac4->H!uePxo$2x{G2KKPgjUSa6xsGQ)
zjT{=^gw3hP9r+C&=qfy$XXoG(&z9}LI92kr9JHY0tX@6HoxRR<<Dv{Q&b9a?EOHke
zLN@Ej@1t>5);b@ZJ1{)Yi2}68bF>>CE|W?}VeYF1nJt^+AA1x8^u+>uqWnC@xxZ$(
zWZ>;yW<WxWMQG&#;bY)Mzvt#w4iTpFBe}y>@xhS1`H|C|Vt26D!$8<+?^EM^WE!QX
zJ8mAtAr?_<8Ut*Ghvpev$X(DL6?^deN_bhf=4F~tYv=HX$*kiW5+@jg5_;8>GLE6)
zSI?cMen~!Eh#S^x%^M=-aBD<A7(DstI{E5Tx{HyX*a=2{(3sR?DQ3|M{QY^f7Vi5#
zk+*({hr%@4Q_){X|E8K%XwSQ~Ufwj;0co`Rbw&)#LRxhmLD%y9ZPUXLzjExjqeNMw
zU^kyj0Vn(!4oVwm9aq46jZ%wz*VF}z!{Y=AlMMCtns-Y3W<!;W(A2kCO(G>vT%>-K
zopdc{x9^<T5j89<+qS6lTOZasv_6{RKi`Y+8>8f&nsS6DZ(NHq^&!n`XkJ^fpt_W<
z`7KeO|6v&J)*EU@_h`%L8=V<+S$i<2ew`9e!4!}r!BG6(XeNi9@lZ;)>fwVije*Nk
zBs@Guf{Xv9)|P^9#b{!kl(qQbhRl@^GB~Kpye2Rd&y)DdxO;VGJ{uGo7=5L;WB}cm
zYQ7d#-1OkJ4Rz4wYGPtq+GO-;*dfvZb}Cqt`$h4|qP*s3UuLY}7GkIp!?kU_#87&l
zBdDt{3(9O)c-xjQY(ah%b|LMAwW0mxW+D6=>GcAs1-2u*57)%1wtUh-1p%h`C#-Fv
zSLeR0>dsoA7s4|b3jEJky;m2r@6%z=r^ZvjO)NG-q5(XkFfOs!_h*8WUM4(2PIi}s
z4t4CfK7+2opUU2wZZJ-?x!MbONx0%O-}q}4cZQY$=0h3P>t5=l2=gEfJ-NLcxdgp`
zIClg$DzthI;L(~ggb#)8_6MyUZJpK}(}aBF?s+OW-3Sr+xb`+HQO2oY7dFwow^*d)
zbmJss3i_g<;15I1<6LJA$D@F&0Y_g(enPBfskdHFd`<gz6|%qe?!b$gF2s+g0)T_q
zmDFwaJZtuqYwfbxse+FZ-(UJ|#2V;|pH-Km*!gB&lc_f@)DG;)9lZ1#I}9`R?=aZP
zU}`$G2M5>fSC!(gE-RzxE_stxWJELh;UM_~aF3sy8V3i-EHGFLgSl@X9*FI-dhwpW
ze=At5Q}XbX$12r{!zAncETipb|H(6_A}+?=Uy%zTduT0sj1TlzQtulzgw>{!KM&7A
z^k#j`f!x%PrY~SZZjjJq-+lspg~W!Jy$sIW&~UUo5H{aN`o2{V`E#lN1Zv><krMZH
z{<(}kGEG68(pQx+B$r5kB=l-u{i22*@iXIsNoB5K{&~(I2|Tcgbw7n!8+6NbY{{0s
zv2NdmfRAnTwR=WmTkunka>-9LkDIEfe4=exN$`$u4wlHYS<h~z5(k+EqpA;dolx}*
zkiq)=36$c$Q~gZh5*trtuA&Q}C%2l6=5B5tX->I}2DMnUZ)ThASt$)x4xj1P3mY@S
z+ULlY76H(^|1JVn&`8MH2R}~e4r=f>*)QCGicDP;i@MNlQ(E51V-~GKtHgaX0sEBO
zwK(H4^f;to(g5we%6TC*HNR-r5jWGJ^yrB6ExU>$ydEf3v0Z=*JL_9Z1$U{cQSM%G
zSjtn7o{4OMO?h^ERp7h7?s}SOqYsaguJ>UORp5_GsD{Q!TwiNIbv;ZeZFz;elm#GR
zf+lJ{UC)N8p?m=`qUf;U<me7JDA!=f&lIkN>HMn?(8pce=H@5gu%{8|a;eC{W8LzP
z$rC+<$svl6rr3}MD$G#GQ6^Q#IyP~na(yaH<}_Lj=+hqF2;O>-*ABWTMK-G8wwn&y
z#gvTX-r@;ME`CvA4wR29y}7_4>0~o^7+)uCNnF((lMN<F#0w5J%!_bwOA^tA`Y_aN
zEFe#OUA_Ciq1RGmsuw-}Th92<&hYN1)3tsFjgD(QU%G79-u#@9!s0;vVzGr1#mI}5
zqje232N`1f*X)YAuE1;@K#1%1(!{G8ek`g+ixM&$+zDnqAndt?M?)>|IE310>82qC
z@1OG+T={c!Sm~pITp@mEw59f~lX9m9rH)(pX3GL&`87gyyWP*>*Jk7>RwL#im*;`7
z0dXyKbk)GH^edY3e#W}qMeQ_iM2P{G^A?An%?O45YCc|oFW5LN!#B-Q&k_}k$~&vX
zVAd-_kmP7Bao?Z9f$oPH)oPzuTJF-Iz1vl*FZRkVYeu6Y_!oA2^Ke&=+@b>7rt1py
z*X0x<(ykL9;4vyeiN#PU*c3@gHE>YCI%V8OPHb}7h5UEa23Gsc9MXJQi0$v71z_|%
zw1;_2vV^<G(Ysf=Y&_}RCfLP9i-Fr6G&kD5ONhMxoyQlV?p|tnVRCU8pphkI)d@N6
z*ox|;6t&XA2&^UxdIbwSwlh{vm3|b4XY~OGwqqi|C~^f2tv)2SDBt*i7SDXSy12xp
zQ5!PUdVvThE7q}~`Pp9xqvkm@su}`-`-$TLZ;-D`83o4|UjWrw*<TUs$|MgM;}q;>
z)z!k8Iq$^a6@whD;P#c}6Vljm3=-S+O?kNVP?RI#S$cotctK)#vIxOY)_T1X4F9`;
z3#=fu-8#OfXScDA0&<LzIX6!^uL))3_kL`H4w337l>`DD@9N<AI*~9fxeW8}ujRcP
zARd6pk-aYHeJdwGAWX(ZNg@>D^a9=<Sl0>_IQZ*KNKB}&<U`&FbZ>{g3vuVDcWgQk
zdH|71RHGZcrF?0rH?M<(U9tKCf#vybPfV0cX+S(ZfHy}LwY7ATXA<Zxe&BY#!K$wz
zw~O)s(u4tWG%d6?qopsq%#$6>SuwTZ=bLMmBMv28v5^3@;z6qvpWB=Nfm^`o*WCW5
zy^*~nc6o6qDrgix;S@6^)zCsX4L?1$m0HP-;6P(GN^+vZ#X&%Ug8e6sbzS(EnGLvt
zGya%W=HKX8{S&((0C3o*=k_+#$lT{)DIt-&8SLPEIZgNI5rF)<594x6x|Q$<HKW5q
z$<S~NmP?o?W*5FJ>v-sM7SyD`^FxMe&O&`~0_DgR7@vSvd-x1Pmo$EH%r9A6k%8)O
z&&tWubam;-h~1Fne*aAYPYKU0u6e(ilwcSf{82VGVqwf7JIHZ)KIEFn2-M}M^<PFy
zMsgC40jqbks=U~Svi&Ga7bImv;RIVbbFHrw_rSZt2S4Go7Aln17b5O!!Em6?VR^Mh
zd3r8HW<eV5_{lt143<E5F@5=WxtwGc$W5jCPsWzJsxfm==31;#o;(>*KR4igmic4J
zpg$nO+?cK+5o|T$DL>3ALZv$9ge+O&ub#>upr$hyEiSa*B|c3o28^&rVn2oo>~6Lp
z?=j{(R&ruHuHr$j%xFOo;GP5cdf&(gYNzo)!Y)AV1ckW{3_AJv<i`rCYt@eYyINsB
zI3-n@XVOrD-y7d+sNOKKIK;JhriPtKS-j<l;LbDITv5MatL*Y(IL~A%UvdXdL*IHj
zOZBo*A1T@0DfrK%ClqirhfU(OK5@fPTPo59UJ_lSkA5;enbdJM*XfM-)?xya@c$hH
zn4lbnr=1+NjX5dl_G`qLD^s<~kdQy&LKI2AELz9oS3LliVx*qZ)@4%`hj}`H{=)Ef
z2C;;5>4Gt9GWx2;t9H=quOC<+3XlDp)!ljAsn{TrYNL>w`lxt)cr9F`{}{B#v?$cA
z9%3o+8G%Xsp8ah<noVqvwhomQ`?3=8Ya!sv!q788dqnMB-$CIh+eM1ob=j*2aOn1<
zLzEzIn2-ziNnqMGxaLy&zF<r69W3a3!DmF6-rIs@9ZbXGJ=Vy3#HVC5V0``FrIpoK
zSrPI+j{j_rOH9@+Yx|sf8Ju<NwNcpa_?fe(QgR2c+9d^~aSdAsNt}nk4S_9<WF58-
zIji@1V;*L)1C<VsJnnd?<lu_ro>vbw<nkf7wK0#Y{l0b(yKmpAL~pc<V_}(Ns@YaM
zlpSPow-~tA9v$fRW>7m}kB|R^hX%e6ee`=FWPv3|WIb#weHI<#HyvhIjASIft)R-Y
zHhAvo?_ALJW3{eSE|@7*&$V2s-L@t|aRJt0No-Qm;qWM>E-$;z-H<qJ%TvsWUAD3@
z!Pl&knc9;=bMG&;e~45r$P@3ts0nH`GNqvw`sGDri0WJFJcsW)v(JX!Rm$IeYCv@S
z71}v^97gqBSG1*JuKzVC)A(xa`(ISpVEAq<pmvl2SMrT-Pv2by*xO;i5p2QjONouB
z<khpPNns;8s1H_NRc6Hsq+U&?L2Mg!|L2<9A_NHP?1CYGoANwQZ_waz3r|{$Sv3KZ
zUZ^*+dqK#v@~e2SV!hNg&DF5UavR<do^m;Um+nH_rhUQ0%KcjY^K}XvFfo{Ny|Gj~
zh9cFy!23*OoYjgqpeQ>zAgjjnn|Yb_?^E!^+204Io04kS+7qZOG*XzG@*d>Ly9MXe
zG*&cG_;<D0;?P+Aa%~xo*@Yu#`C7YxBp&JS`O1vRBybXH{_TioM(bZ@g2w$8e-t?{
zeN|$z3m4lwv=mp1`VLcd5PYrhwqEKxM75r0ax9Y?G!$JTut<HT&Z>1UVP!Awc`=@<
za>^`*hwU1KkG?kMnKMtMe-!pfJz`RtOrc0lqDc5rv++eMnnj!MS!uTHCw|6KW=L4v
zd8W`7ksT%A$A2AK-XB)sn^TR|+9t$SRqNaHo&${Wq8CPhd~uHQPSKO%=sFF#*H<H^
zI8x2u`HTJ7{%pH2WVN79M9k42&of(#D_X7Ejk7oaJpw|r*<TjAru)oVfeHn|5`E8F
zx9}yKI_tXWE|;EZa4o)E;0TexxuuDepAT`Xed9d%@`luvZyBi+a1{3uMaf4iQttCp
zYt4Q5VmKwH<M#U1Bk@HjlDvkq`ql_JXzYI53tGJ|6VVIvgF3uxEzoMT@5hJl-bAvw
zzsHSQj6EZ&iEAC(@;kISHo?6g;QBR#u4b?@K(;MsaAX!(@ZR^@H;E!ECEGlEIAa$m
zv+pQo3lM=X%4n;$NBjM*8mb&XAGc+3tHz%{%+O(}U01?sd9AC<<6$5oea>0wOhBaX
z?qZO@KEjbDbe9L2Byi9u<0bK1$Td}3EC|sSp|J*~Wx@O=S4t?~j<eqhi&``Zz?~#_
zCZnnqTJMXV&)@j==CT_uLN4)JcZb{Amj5>I{$e@NjfCizmAiI6**lz>nc&ZT>EKp~
zXhSLo>u_omP1q+ItkBQr-VQ8PmZy&_z&Yk!Ro<5EqHHsUAzWlQdRAmo^8_QDd%u{T
z5+p;OSks2jo4H>l>ntCDt%|J<W<%W~=bzih$l{@yeDf0_p)hJrgo8+?Cu@r$u|S4w
z7WhP*Nd6F17HRTa2W$5-l=VZ<t{8Vl*<$0GeUOOn?!`oD8Qg(wpZTI(1NL9U_{Rx_
z?JT+jm-o*rCt&=D!N|Re(Z&ZHnHEotYJBs0Itet}hJ_OE$s^_>%bS5QVI{D&jFj>?
z7NmdtVW0UQGhG!e!nu%Qe#G^-ko>7+TMXa4IWU#b2xd^1#@G2)3ePkediMbPDG?F(
zFEx!X_kLXNZ!!?1Sg9S}#f3enQY8WBge)MM+O{aQc4p8A@bT*PWB+^?pStsE<m1g>
zQ|ldDPc)zX%>4mr3Y7X`Od4!x<V55s9K*XmfwX0X1!hJX3n%;cj<0F+hlIrGWd1($
z3&y3AgZb6foh>eMIned50e+=_!>(u@P4JIhSwD|%3=x;;p)S4)LC*#S<wy{PQp07c
zPfHIxe;4$=zNj_!RfHglT+A-t`&K`U{;At|=}|occg3*P6D!VeA-&>&DoyY5QJCiR
zBFQuK>!cI`(VG{Sy)g?1Nh2L>E+9Li^V*8gH+P#uvpB<|<3y@t_G6A>tp_`zJzo;n
z@1$Yhtp$ZU*n1YhxXj{7pIx~hGqZ%1RoI47px*f~q0<QK6}EUjF(>Ij<^gDyK9qjT
zZdyRE&UnGR65!eRwhc2*SrAtAXOqd-IM%Ha#q#dS+5sr(L0DmTUkfd<j&^f5!3S7l
zfsTptYj=S~Hs3wyk>m_3b*10U_=(Q)RNK$+WaKUW9qNISI!^y2yD_$E8GUq<BV=Vh
zEyDc}svs#l@G!Ll%yS9{@}Sm5vAQ$_F-&4#!eewtzJ|~KK2O@|r3Htsy-*M?9%1@?
zdt>>XzEzhhgb3}GIQ{oGs00uixJNM>v5c|?2h40T!ak7gSp~=pKCUInlnxI(Xf~F8
zB?n=d45>4(`0a3qO#8y{aqMKZ`lMrP^*=5afz!~O2xE@;W7-RE`@ObN;l%8Vbj%Iu
zP0=6=(15mhmQB1fs~Hn?6<b4q&H0A0?mZob?JDWX{qg)ZV(9hx=P^7Jg!(Gxvh4Ai
zhmi&jOrGHkk15$xype1><5KGW2V1d-eaQyGK2Mko&GI%|gGgygA$A`P&RLl!Sj^6N
zUxD&3^H{((@Lb!i(|n?G7uo;-D%-i+bh?F$T7B^kB_e~$nUU7jDiHLW2q|u&zBZ(6
zt$ypR3t`R|6F0b|p1K7Ow38}*&vTfMlWx_M*_T_o24(lQ9r>RL$N4W0IU`Wr0jyju
zr*g{GaWl@fxA?i<qgn+cwHlIPL>X?Nwft_??;BvP&O;>kL7AeSn~UXJ5C3_i?gDN~
zNa#$aZCw#P|1)>!v%L%^_O+jr9cPeBsd_aT2kisXe>K)I;hCY#<5`NZ(6QO|k7<e7
zWuw2BVBWQ}qxGaPr?}!v5C_Do3M73d<iHgdx7`tw{Q8^mwwE}O_Q}<I?@+7HGg3tK
zNO0-)s{CM4xqa$+w^HD15i$ywOA5I!#m8&u#C~V5?q^r3z&2$|5J1Z?4?;s7BQjg!
zd$35=RNZRWm~P9F&U6s)=osYi`cnaV6ngiUCwNH)$4er^&sp!dxkwX9+NX*q%qCj+
zT=CFd(<8l~Yp}tFa*d$54-=L~fk3uf)np1^DW3B~Bp1sa@0X-@Syh5#9n-rQ`y!}E
zM|*$%dVY(}*p6LF@jH*-y($v!Un|WYlQF1}4(*zzeS6i3y^04~IzjlJybKHjPNxlR
z`)YTdS%f8weMM@6F>j<kh{UT`x=KIfm7*ud9gDxfI9%^R=A}EBhe|fRRwn0vfUzA~
z)5-E9is}mmgwHxu#l}4T=GVTt=-^{v7+Ft(={6I@>JR&as!B{xbWS_|vDhj2ggJy^
zPetLUupQhX`PdXz9;ei$NfR>FGz?jlbP#^J3$^_I53St%-pNr@>=g5KaE4qKcoZKk
zhA<P>Xy*8%ROFkyBIs+gq3{8_U7E>_6=;JrdEZgt!Wr}Td6nz0<kHa?&q~{0InXQZ
zq8C2EzFv?AX2pkk?d2wKn06QumeNmtHy=rlV}H~I{Rwfj&gfZ!Vr^Aelt(3AG!8@b
zC*5PQou`<@a>@P$QVczm2dn4X9k|te2`eh${(FUUy^fO<y+r|EMj>>O6Jj-T?QOXt
zc{pkyX6DiDN>#mcL0ZJ(GM7BN#D5s-!x$x`w$8-CgNWTewVIK=e=ks~Qd@3;JSe0k
zVN3!XSD07Y4K=cu@?7)Vb7N@a{qC51Z57HE#JhK{tm@JN)uzmTGAO;(;?DkV1@D3a
zQbze{DW8S?$}{vRq-n&|k)kQ??EY68o+Bop32AcS^7Br*aBO$pnF`Okv*V{DGYu-y
zvmpzSN_kwck*lKr>+eeGpa8mw%-FJobLQM9;UBq47sYEGH*ppl4w3B%+3tBDqQjE8
z)~0&jG4SeAy@KkNZeK;{#CZC?Msf=lajld7z(H-95oI$C+HU!%zk8sj%O&qBmkZd3
zgftNa0Ri@#xh52?qZxK@g`>0ft}sCnhTWXIQG63|j2@<i+YAu)y}lYkr!B>Q<r*Xy
z;kNUbF;J#*9!V|2{Rflz)585aJNj*wicW~ku#Q=2X2?~&<QmOSVy7)9W&du~f487~
z5%ziKxx(W$@`__+?|Yy-l>EYn&g}ZB+vn8WsWwN+<tDaf*Tz<%%aRc$MDQyxEL9fn
ze4z5z2Qj?Nw-_o5PfV^{#6Cw#sxB<w!LG5){odhvq>J>j4R(~6bX2Y}k&w*2;}yoL
zWpV+=<&rz?pL}$S6hcsYu@G=hfplroaTQSw=?`5_INloTpv!MP>_*mh9EF(QJT3_J
z!(-sfBJOK`DBo~^Ol%!($9rKunse1f0x0CoB|de&tXt7?Z#?Tc+%jaH3Z}J0EJqt5
zRFRO*20fG<NQF=Llzr+~=btd^b;{Yi{B=sw);J5U{j^rivILv(p7(xiby_nAb*FN<
zA(s&F7Aw5;$f?Ck{aXO*4F;CL9^xaXcBh-CTl5bU7`z7>>wJ4<D=X7*7fM^SAJc%e
zEZN8Z#bHjC?Rxi0896MaE5+&<8@>UR4LN{(vy>Vb>=R2Z3*JT4U|wmurhOqzOlNQZ
z<Om9>i&>BT*}Ib21ttW3c`w&~WnfaUa~eWikVVAyP(IZM3^v?3(#(~gkm|Jc-J0mo
zk78=qR1WX<XjbS%K|5zq;(N?P)EkK*H(~DCSn1Q5sQD(Rz_|yf;6R<fG{L_##mUA!
zYSmE8s(t^CVM`BGVn|R!J1$kTY`c#{n^-#cD7M!MP%EZ_cJ<3e#c{tlocZU+L}5Aj
zGaceBXzj~nD9e28tA+H>CHYza4xPaoARGWlXvQmxfH59Xqj{rC5eNC_R`Oqw;SS7#
zd`%WR>@7YSSl$;7fz8z^bji?PJ0zE{9SFDVfLu?I97HhTt>JX5rI5#qk+R<tkvu;`
z4MPIvQyP2%?Qk12qjN$@z}cnZe3sqsy0Nyc*yEpdsZEiwg{Ok5V?V?*#$1;|sX;ws
zoA`;7Yeo_nt2ynGmWsYzc%rRUF@bA5R@$I@(TAXefJNC#Nf#i7p{d~wR+^7TZ)H=T
zL)FdVM^59onza8_#eA8LRjhgUnlg#CT_i<OFhL-ToE^0jgY(!Mq}|P(5jHv%J>Yj9
zY|<mu8C>4r()736eW`?-ZjUf)SR5h37}&HE4^k+Yu{xu*4mAxh1y1(sDKHKTomV#l
z>bWW+HfN9oQzE#&w<=~bB(}14U#Fb-@uMEZz$NQo*LNr`>?ikgdWCTI|6Ne8ioBbr
z+vg}BFJ+wmvwjC&xmD5cA)Th_1CrS^ZvWszD2~{r1_)?6%4EYjIf)wxCKz07XrEFO
zzPKc|agBb!pq|JmJGkEB_UU|6QGrGDaZ2!oIj-pKu^WfV!9DX#J%d9Xem;96I*7#v
z2ocvwDM>kCwB0`VSz<V7DLsQ$y6QCF;YMvdAFtYeJ*oRT(xujNQ!gMm8T7A()7Qo#
zaBp4s=#@kYRk&GMLGMg=8Fzh7rA2uJhxlM<7L>;(<+P&%D%M0-&UJYJF=RNnYrlbg
zXFSyr`}e(e5kDoF%qPBXCyv&W46u`)9PpL&bpIIvV`1l<mYoUv7)!<D41AIQ#qaQh
zJtLZDDhM*u0yM8$nlB(%ygEYmg#^L|z{0kc7jv5)x$)vLN#QlC=^+an4*uO1ah(H3
z90R}grJ5FSUQq~8@dD)dv;Q5{OTa{_`3n3V2GB`3RoD}io*tf+tu4|HWTnnXDnWv~
zTW+LhZW_3+LhJG+Lh!wIlM>|U^Bk5OlkYB`yuOh;CSO@|17Z~w^)g1wiD>?q);*nG
zBu_>904?q^D7{XG+|lb0DK@$}F>9%8F;`XnH^3oQ<VU#giRbpvfObD&;it!gWo{GI
zld-r@R81vXM`?ok*y)R~@t=9uyo+Qqo+>r-#sS0{b79S{eZSJA%i*ZjAAg?;2Q4}j
z)%=!<)jukZ$3fNIj%5_O@D9r+AH&u3!FNW`iO1LWd~)R0Yx;;bI5__Hzb?1CPqG{T
zd(wf-KE`<GiSqoAa><IHf6cXp_XYbW-LAi)a*;hS#(aAfYKq96xnoYH9l0R`2yn){
zZ=D#A#$OY%$MG@UY_Mc)n4U;r&&+B!@pxq?!RIDm3=0<H7X`HIH`=ut1^1hLuxHI&
zzu&r<GzYPZix?`ukefI{{jOk3Q2#?bqnLW<^&4I~%~YE*!sZ#D19hKOe?f)!BGiNT
zc)%KS^`6Bi(Ea(ZB$JPM4zItgW}(eoMQ1SuKbTf>yicMgK3?O1h6kfOn!f&(s|ISJ
z4{<EHKXkMH>;^}5HrK+A5n^iBQv+)d4%sKv%YO?BMcg}{cPunIeh={C*UU($Mu_Zu
zRjM~u$Wf55yAJyaB5!z}60T+k7-`2&mG698AXxa=Tb;t$$_&<fDksF*C+~fKX)SV;
zl6eD|Qb_91HHB>lvc8;th}8|#p29{YPY+*^d}NRdwY7>mDV(~qe9g*Y^kVi#T#{_%
z@I~u@XlCrv{lm&(eJks{-G-x+wO2|$OMk;0eCoc;KUZcb$s0NZR1{pEw1|`f@}C-s
zm1h!27rpDad*N)WtnSU<z{y_Sz24V;^nsSw*zm)L4Pvkf9NIL;qBX@2Ud0jAn;g<^
z{p)%7O%6U`zq^t1+nNUsiveY)7@fnov=jUb<zDhHgWijRswIa9rtS@an?b@E1RL5Z
zi?<9)D!{1gpO6-E_saBwL%7U}skl*Q(Q@>upe4Mjl7vw77O@Z$xmO8E)LgMx5lcvS
zsu36V(T<quzEgO7XANf7(35;5U2JfQQ7Sggo_PAJeC-50@a8J8e`~(KocntTQQL?!
z_iMM|40{DEG#ZZc#$LAT?8pZ@e7gw4YJ(R_z-v^LG5t73|3yh2yl2$_nizucG-J_l
zTu<s&k`L@jO<TxuT)3DTj}fwFm2Wz$dHsBZdo1o(4}##v(Bk+=xC+K80-1@gky5n>
zE|yX$|D6ZYK_W6=ID8&j^9)~RiaMju58!HNzX@JP`cIJ9vYKCLz2E@JWOuFvrnpQ6
z@K0Zv{OwCvi=gX4x(<J*l)ZWni4WWtFzTL|iqLlRaa)KHe6h}R0*yjWn6N*w=nocI
zr`<N21`LS3xszL^A~{QyUpLeLB=&QcUJ5~(UMz9VI=nJzMnCm3B!@mK->{+37(qvP
zSRxcP{QBh4JzL)%m~Nuw2Bbgh&ut4*0vEZb*kU-55GnY;^J*}zRC0egL<WATwYNSf
z`Om9~&KY=WiN37$eLeI)n9O36)%&6AA(Uv9y9E(4&CblIWK`XMJV(3pDgmzM%K{}=
zWQm1rNiMr=Ejg-IheTA^T|Moh5iAplw4sBFH2g7w^nV>U!Qq5W+W~ZqVVO=whh}=>
z;f+J%EF!8?VEA)JE60abg8KU=d1fuX{BRj+?TJXL-$3LMco^2XJ(Q>tke=jG(g9yL
zR2)*l^9)YFgt$D>uMm?0Bz9FGkj8@adHc_%TFEMF8DP_Y_lI$&XE`vQx|N2P<xwBr
z7&A<qp6Z*R+(2$DiToX*cPrhYfsdK9Vq0aadDiE;_XnsyT<QgQLI)g^xKNY749AzN
znj}nr9C$rC=#`ZM0(|;4PcjSN&cs94TGq=jfs=6=-|9Q`9bjv$qV#-V#-6C-yXN)z
z8HROKHsP$<Y1s_L_<I>}s76#sH=>?xe7~ydQIKEk)e!Fkn-FUFFp+DqG2x7oDLo8d
zNY8Cz!pLv7@iR)lEm-AK+;`toQ*b)dFJdvj(yd}vF|5BbcTPm3dcL+|Ifb)}?*L9o
z#LHRDqxY>_*h)_bpCWwy#h+aLKe=xO;NnAjDW>saLHeJKnT`GMm;CP`d!brcT(Ut2
z)b6S%zx>#fN|Ie^LgGeYnT`Mp4Kzg#6V}}R`#ljBa{XiH37D3QHZMv}7ECCJkp+r*
z-AYG$G!2_r(i!w=;VISf28B)sy2UOyr+&*q*Zmu~2m4b!VMco+g#Y3iBR!EjIXZb~
zE8Bi}C<$u5w?BYx&#pIF-EjvgDxcGIydTA^xoW#~gS6HvA1>qhpJGtck)pm2e(Xc=
zZtNcZ<0d=HAyADZww6<KYqBWzM06Hg8B?*CbIB7)(~7NdY<DXZw0G6g<DTVD<N`Y>
z+xraEe|7VdI-H0!v&j#rSFQQhN&F14Smy+N__iq_LbnJ@aUs}og+@+)<PWfh$O$a*
zNt&-_gh&>}vXT_11(&rRY*(Gok^!IW|1ZM#y}JbHLk3x=3Q|Dv?mJzRtY1^A-|H4c
z*uJE&?Ca#tLPwiZe}8JJG|z-cLF8Myolwap>Z`G=vVElbRlySfk1)n~g^@frO{2-f
zB`9?9Ojb5exF$F~%5>hM<)tD=7N4Wt?S=03%U{QnTmyO7$e2cA2|k&U-C-Nv!(!Hu
z5Ju<FujZGQ4n3PW^8Lih;O&g<jyA1DwIZZ+RiH1R%*LmNlyHy;U!SP9^;m+E{BrEQ
zk+n~ti5{=_$tp*Z;XQ4Qdtn70;Xm16uQVOhu+L^;GJ%hNti*TGFv6(D;oCoSa!)wo
zjJCT#>lfyv^ky>g@W8?ktx~L%Yb7pjL*Irb-@%+>%ssR9REXkcc?A^s>xUVhexH<b
z4HO_Rp>binh))cN+T~0&0{3>nLPV<n9T00fKpoIG8a_t{vcO<d=NL6Nb+Z7=#OKfK
z-z=u=ZdrF5$TUqwgQr~c%MaJA)o+-`bM6_*bdbC`{!OXmP!wgxZ%;LpuN+(q2-W$x
z_8BHL;;Cc`kppe3-7NDSSq^oa^m`5NLGxRb<6#d@KRh>|>DBR=g?f8F(0cdFuT(QW
zV#+W4R5$>gqOtmmasFs(OtK_`i=}J2*5>dpmzJEVUm2dtpin&{1n72brY5JP9<=gm
z7Q6iE4G9@HIfy>pr<p2))Qc#4fAAUYtuM9z*#Wkjl)dyy*m9~a1=iww<ZPG2HC6XC
z>8!>o|Lm=jR&jVos2R$2@tO%s^KM&EOcr+#bB4giPTkKme6oKw)O+Y9s9SWd|01=v
z4zA(_CeI7}o@NX;WR!{yGsxz<Sz+DeyT`D#HoS2E^slLIzbAl>`H$(r{|q9M7Ya}5
z4(Zw5J7U(TWhQ0QIOaK&A&SA*K(~4k8)KFs<HtwppSD`7VGi;oL}-@9lQjK6rHglj
zeIg;eM5t+c_gEwUg5t5+-ERrLAfo}^4~K>2%5(`WF5&7nE17xHm;&9nOe4CPyJ7H7
zc)qduS~&azH$qW<DB;-$!eL(OpLju|lMKfjd$u=d;Lv2Y^RH9u77bLICnV!1TZJ2z
zf_hwg)0Kxt1y9XyF{q``d9z^A-}eS8kB3kE4PKAHCMa%L%`>nY=I9+Ozunlz^|!-M
z@yN5n1bXgL#XuG>OWv$qTZ7L>&H?Nzgc;U{c9o;(jcZE4b=z)GxJLH}v*<hqlA*$R
z!uN!f5y}3brHQpE+ySG;YAR@QyYEik#FS;p7P{@KY~Wjm4is1nsq8G$Wix#nZ?3@l
z;rHq{0hgIR{FNEmrI9di;JgiBO<7y6<Xr_&V6|>svXAG~s#zYs=f2xfspmS1{M)%K
z#JT%;yY=#WS#-40RbUa)jhkr0g5!1b^2df$luQB+{%$Ih@JLicT@K}MvqL0{NuY^Q
zXvCe8I~|hA4mD+RlUAi&m^-woPtk^=q?*<Uq(D3=<ZY}FDrzNe@hrq+7_z-F0bGea
z{i)Fgp9n(gClf(MLNO6~fyBm&+CS(=w(%r!K@}NU`sZ|7dis9&5a!Ot8~45FG~`f=
z)7H!=?}*O%1zEMP?|rR*$FoO83}v3zE;bFVyUBWY8!qAhPW%1(tJ$%d=A>A;n8_k;
zsgts7-;Y^}w3$1v;}ScO+ym$IZc;i{LAMvYf2=Vp=hOGMj$Zo7#k3;xG)mHV1~0e_
zU0!FQW776{hw?|JRD$KtpTg(&&t`hw-6cfU2hN;T&PPs;WR!Ua#Hyd@7gKaG(`$e&
z=Pvo_y_sKt)S=8qPMCBhObHlq*Ic8;?e17?9hjVk!_-_gqE36_k2p~p%dvuZoNpmA
zGW6_N4+Lnq#_+2a4;3rG${%T#jUoL%=ILlN=jgUCPWT_f*xsHQx4VMU37FK|gf6Ax
zv}|Yic9~rIdqygs&CikjZJV27mqg}PN;vA@8ldLWgUdATSy5NdY`yX>H+W0d@pBCP
z8Gn#CijIs<pSnfiGz;l=gU@&VwC&IGk258Uo0Y~aYn|qHYf+9Dfeeh>8j8k4gX))X
z;^fx!*LMtlqq*Nou-OECG1n|T6xt4KM{9Cs^K<B*2oh(!ZpjAyRI>o;$6;{?D`^7T
z1yQ=Qd4hFje*!iH#)hr@4q;9^XfuzbuxE0YSN5i=kyw#PQoX_+yKvs+l0WqTI&brL
z_m@LYY(~YE(+}xL;Ie%`sY8_Y9P$IF=n-AJHa$PM&}##KhDHAM-P)!s3;buwQFYwq
zn=RjbJ;z|*jNYW5Hxj)3KeD=2Aw_U&b>LA@$V;UE92{P+RXr&^J=R7R+C;mdX#Be$
zWz&HkBU}ym&06w6>p%mDvv^^9dS_p2_J%L>cx{xX^18VYoA-JbESo=%_re(doWUlv
zSB_!OzK3%hKR>`6PZ1onM5~cfwFcTX#(4iy)hcbRr`UCH={)4^>&Wgr&mPG8W3*Gn
ziz~uD0<Ui`Jz|7o_QsKT7%fj>4yGZ&s_C-~QOCa%el0ItbFi5`5u8I^aHW^$3|*1%
z^2lh0s4hk$YR6bUDl2<tDBACre-n{<_T`Dtj|3GTrF~y~eKTgM(c|c`v<240lQD|p
zIq-WDrbmWOS>nUX>{~N-35rMdgXp=|Mpoek5m%RYg8wU3mSyx6C(}i?pGjDnY}h=c
zo=HqqeN`b%>i|zu?L_3?)+$P$7~**h++$YVr5aDXr4P&)@|uIT{FyD<LuIzlHEuG&
zVfq$MUHpW8Q1KIr=?;%fd}D{{IXb2%ybQjUg!_daj|NrzfIwd_TtOc~HoYmcdj2QB
zVBtBZdozTD$t{t*{p_KiQ6f->TFdq=a^+EBcksjD;*58UA_~61jlX(5SA5m{7+sWm
zE9<byA}D#2B`xHQ-E?fdf8}D~oYKABadGABvJbe|y(T|wqno~j?5b36US^?D3kIzd
z(q;|WScK)bH8FLv4*pW-3=MdXNgnYo&#&R&^~VWouiI>Xt4$6fBXol~{%!N3?hXa~
zG#<ki(*;WYKa$S-pUwVl<9Dm7s%WeBsw&!AwQCn`wN-Q>g2bqq+FK;L>`m=;tEyHI
zN^D7OYR}lQV<%=1;koYb^9T6F>&kU~&hv8|?{~MmQH3i^lTw;0E?s5p*6s^aDmm6D
zVJMOw>}{z8+-kYvM+w%OI8fwy<dykbNkN=9uZwBCi&%_#Y@xbxu0X)Uc1`5>!*2^Y
z%~L)eYT^yz+5IPvC}N|VP>gX*DbSSMb9bX~A+Y58(GsqDdznvSiJmo1!F4G}YnEqF
zvkgvcGGAYEW8tLgjI35ZQO~M)f5zB&^`*g+1wIS5K;1uh9!lznMr%S)%(4F8O5{ko
zzizMcwRgK0d@s*evF-QI!x|*{Q=z#?(Iqq6(x0&H=-U2Uo%XQ3Zoh#boZ8$A<b5~&
zXGLQt2&RRl+V!XJT0?)8Y`X5--0n?{MAJ@RuS?)fa(;H@oP@HTvM~YoAo0rWp`e}i
z+oY7tv1Za8%|#X{6X(mN{jdGC!Fw3nQ{Jwssp4xpjPJ!fFCip(I5LJE3v3K?KJ6HQ
zNU9B7a&tzUq89$aiP_}9cm84l?9E9gC5Xwfs!lM{VH&`jSN+!&h;aFJ>*q$0&E|^*
zA^jcqx^qwRFn<taK2)PpuIne?@4L%>mx&J|f^aoliE!vt-3>R?BWPExwb2<<y^dK5
zp*jNPHlS(KiV5WtI2@VR8P^_Pu#7o(DD3(8ic|<Ajrs@*`yAka=g0m$`jKE5HE%Qj
zxx#-k$2V!}(d-Z6Pi0N5pr$R)#-vO~YzeLDW~@fvUAF2IWu_`?<GZO9>;<N?T_VR|
zz2o4+9R><YoWN9H>E$Wywe-sT@m-Eu4-e(uZSo3rSs4(-K&WnFr!fj8>WglEvG&N^
z>p+@RhoO=Rok<9I`UhEl5=SZv$jal0q-59n0GkMhY3)CP08bmM05Jci#l=#rG3x@c
z=y#=$7u8*WGGnn&i8p`U2p&*MobhW(Z!YEtTj~QlR|U0CWOp+%lg^*e>-9eKxeRS<
zONhxYrlyP#>eY3k()Si^*I>J{L}JAj>&#!*!Cw0Rj#1xCej7;uVRx9~&htkp^AJnz
z(qyE4c9{wS1vKf*v&-yY9ZLpP+)_-_q7`G$8@JZqAFtIo{Jtw_LB$j>+<-hTM$h|G
zK30uVV7xhW4BCm!k4l{abIgNysp)~LD}cQ$D7Ehb_yUYnZSFl}a)Js*ZZ4<uZs0GU
zK)+qf=rAe9y_q9@ljiv?eJB%t?soIJ=P~AOGDp`A%j`k@L+4Q21K{%@je<W067^iq
zqx(EApe7ppw^+nTQXFS749519&7yDXy|J68e<qNvsP3@9vjHJv>x+EZZ>qVA!V$ut
zLwJsRo~}&f5^Z9?z2;q}@VYi`)SJ!(f5$y5YCC)HqmfH*(oB|KvJ?anE256Z;PZYF
z82pO8wQ!0f$9TYE4TR*BUU^DB^ZD*EyA_NOw`%|6Qr+9<iFlw|z8Laf^YYnS%v+%J
zrWSJ;r|xie61+V&e=Ff1O`BXMJ?S?*(doFHUQ-~*#N`&o>0L9D)WuE*)0nW~?W9io
z*iOdn#RU!I+@S>>aIMn>KKInilI~;r(d?8x@Hnb-?3m8@s-U-VxT6sg!wn)A&$8Yf
zeXa+f(sWJMC^}O-9&9}|s_s84IRjrgO?D@uR|BP2^E*Sv)NgM6VuQ`$IeHSCtr(XE
zhDzHv@G<ED{OxR&J&<^XsK9R#z6lKk!3VTAr!!6SQ=TL)Q#R*8ofs#}XRJpxIX-H^
z1Vh!*`G%aa_`x7)uk)Wz7hXGu)oF7fZ&5K>%EA2cTQ==Aj&tH1yQ#w@)qS+osf|0<
zB<MJH!`Wr<dgQ9*>XczXT8n&jfmi`W9H^8on~a}TE1jl#8Z&V0Q->#}t{p__OvR_{
zL)K;50qA2TG+%LX@x?fL`qH^3TJ{xIaSbe9ax}QYvoV_M;>VSw6GlY<jjiakpbIlz
zdk6m*&u(>I?#d}IYAN8>8sE;BkP+V^YV024=()ZM>rd5H=b#TFUmE_4KkyUFql!%}
z1S@<$($)&9FYSkkEAx~za~9l>+-p#SbLcKxR(NJPQZ`!_j>s-%YcRq=;A?0ku5y12
zwbF@`BttokCy4^2ja>!%){W9XrWk8=BHHu&NxoGhfpbe(AbGo)Bz2<N4^vL@&s7ZP
zkA4n$j9x1CLv`=KyKD47z(8B)65F>_2i-Hy@)1PsY&N?lQHU?9V}1<}tYEx1D=J(~
z21x-UwO3Iqm?ZyyLi?2M{O+<BCC|f3VY7=adfS-23Ao035a{j}>F$q^$%pN~PXxHs
z{P#Kv7}c)?IJ45?(?aPqqw21+dG<k#zxf6w<B}n&g}HTdtoOHP8=k7x@c{vki%`aN
zS_K8i<=~`YSi~b$zx}RQ1V-nxQK<r2@m!27JMk;o`s*#elBVeNX&1$VkVkg#%4Lht
z#5f#fSe6&Wjk76C=E`!BuLj=xgWPw`nF$80;?&Hfqlpi?G5zX`8=R-9(cPw7xuz03
zf8|(<NP}}?g@iz>`dBiCuE^K*x1rUDR&k|X@e`S?7=A(WUQ|CaIB>a`_!_y%jta`t
z7~L%wJ>PfiD6v!<&SaUKura%7wdVoEIBkcgJD#gp*LW^1x$o%MoxVEr{<HeXGh0tt
zGYuM<g6zx15Za%+cxF?AEOYffS50(=N5>K3+*ytGDSoBRJxQXy{VRDe-ppVGX`vg>
z1ABq>3CoYtV_o+*&D&c{guO*>GBQp3m=%=HKOrIqf0%)~9x}X<M#O|BdB-Mi(0<uw
z&%JV#24>K3t^a1wTh|$Z8Pps6+r0&tG~8_N=EqMtV<Er0RRz`FiFi&|=UfWP&95Nm
zw-#xF?nYC?r#$!TMt_lwfg_o7Vyvsa-t%s`J%nraD}p4~+i*gqAI>L}1(#_B_cnOC
z2>YDDlK5y<VM)UV(H~F;2_T^0j@#;g6O!?iQoNL}&bL>@4aQ<0JkMpq{u&IdsGd^Y
zhfuSEpbR0c;_&E+MNPC#qBcShTLBRmn+~UmxSh``%N?A{h|B15eB2wSc4cGo6RUD#
zhX$r2>rc)HPZdAYkyW=K%sq9-)Y~$;SyRsphoQF?|89Ga1?LF+8&CggMX)ry*!Q<2
zDr@z8t;TUK<JVfDD@2p-xH0&$+{9PY;m^KY(E$qO2YY~br)ZHJJCjl|dqKswnvsMV
z(5*~(;F${TnqVF2F>%z=6D8!$iIo4nLQNQBTZHB8d<zKt@11%PV8cQ>2TL7*J=3D_
zZu$k2!fpDuvcmU&a`G3e`xQU9weH)U2O{5yz>v_JQcA^yv9s+8zDOMU6-8Omxm+IK
zRg@;%Yt(~Is=UZ2y6w2Nv}hD$-+H#QSWGu{PoUly%cV!4bZ`pOA)Gy=AEEp8c4e7k
z%s$|o`i_v?bLFjP{rAZ+|Df4@=}UmkGeclvoS^K<h>>)_QNX|z^2E9bi*5b(_;X=n
zg4&)`faA{F^r23sX~u>LOIDGFO*@1xU^L4dmCJFRDl}SPW^01kK&g*IHM2mmTery%
zc>N+`TMdUF<Yo9d?nt*}Xo2kH4i3Jd8~k@2Pi<5qlHd@*_Se(R%KG~<q&$#wtVrNf
z^;hD_ejVM`HptK|XiB3y6L})wc#$^vLjA#0h{Tq1;wdNmXD6Ld6xexR6n$U?p%}C6
z5~EIUZ9ad0Gem3b`B4syQ*|{VResUyA!q5G$9Ll<jPZ|rii|fw)m5LQZ7=F()$?FU
zE7GHDo+rza$<d(xbH3zI(`<Xkg-?;CgRT<Z=G>Wr3<%MU&N<)t#93+>bpnn}zbCaJ
zV-^@aBIW*A*qB&D*wepXC#IG2W~x(HO5T-KEPa6P(lO%>Iygk2diV1{(VxpvV)|h3
z{MFK1RHb`w2Paw51w5zmZ4h^ZhnfYS%!IqtSMOHiK}%7vZ{X6@Q`%d<fPmUCJFa<r
zfTH*!%W0g0@g3UmX)4=@XQ)I(<RK=b4Y$n=bef4K7YP>rNG;YhugdOSo9Gwf`Hgt}
z4C!u6S$X=H+O^wo<#{}04UoH*K$ryqIA1&P?annxScD?ZBE3I23VfEiXj$9!{3U<u
z&qom_QXKX2YQH{V^C}7!_9mNPm{4g$_5E+gMTkT3lUmN<{40BnccP9Hf{H5?x8ve`
z;^)F&h6{Lnv*L3jiBiAy%&v&~IoJ6GI(HDV5cE2(b-=ldo{Nhp!cUg1US))c$8K}E
z9sNRs4InEvzu6||g!Fbrv$%KkC<xt2*6yp$MKW2GY8JudUbR}+)g~4H26B881FN}E
zsNLif^uILl!H_6rEg>k>^WYGFuoBdVTv7TVmow%+yk<=@!K7cb7vDx(IOuXb$nknq
z58CWlUyi<$Whb5-D5#SCwp%Q9TY(6lI?VD~W&S8Wb>DH})EcKq{>wvVqTBi_??#y#
zZ2!`QM!d3?v_JK3hM~`tog+w*CZC7!pYYdFm`G{L?%r+VkNA7iZUdqIMnEKL{};3h
zd#|5y$~#b}Zw>oBG|Fcn<F}_4kSNZbO}c~(1I|ct7^$=|<NALVxE3yv$`&t*(_j2l
zoHlPFaY7+8O?Ifh_H27Hd;0n#8))Z^Zi$6ZBswx6Ms6-u#${`gWl<*r0*~DnK{L0i
zh!yiycI%6?mfDtpoD0zhz#&fW8T3!Oeg2x-yVU13Jw%Op=twSpl()UOL%yKsqSq^L
zfgQp)oom5{?5H2{EhSMdLxno2w8OuOw#C9Fr`UQ?nCqsTSosR*$v`WH;Mv3XHaOIL
zl|)XnU;SxTwo&zCsPm1LzAo#ba_KYYVUxsM{6xCDPis@GvPW=BX6v9B|Ko;;=Rw6+
zT(vmreM8rE&Pn46J@bBghk3GZ(_N?^EvzRc_W2eBb?nPCp6FbbE>0+5^!{gj5`AKB
zV!VbG=^U;7X%nL{YB*dac2&w$f&(FTU-&ZQbebmH+p?|3HV)i2+RuOK1hCDRL_ehi
ztiC4<E8{QOFI~8Tp=lu9edv{eJ>G^MeSstOEY>+aB>EqHyQ(Y+E}=)!HbDWF^^=s`
zBWIh~J@lr%poa|Aa^sqJRQMZ+=~d|-W!+x9j|RT$3|Jp+;IsD<rS1wEzPHM<>0OnV
zRPtou@Mf_m%2hcfj-ns`js4_nMo@XKvYzg3wGe->Sr$AppRM5k@5_`I4T<tI^2d0M
zje?}8@TzF1;TL=8#~I%6vs>t7_?O)u^b6VR2^W7p*cIUT;XNR>5V>a4THpTtRQ;f|
zMGv*t2qXG+z;E(P9Mx{CvURYHya);Qrh)KM#$A+W*-0l}FO}r&V9bd2`Z3Z?LW=p=
zCE=}cba2J96bw4vWC^Ngv3^#z_BLqS1-L>K0R9MXVUIPZxbTv$5@9BwHCH%@=oe%9
zpnYOh-i(-P6DUbrE;@9gfp0?oYg+@>XdU!hE@mJN=DgM>$77MQhlak&wbSvj7RS*=
zW7=kbI&1F&qKIW`h<N%dV4>kX6=GvmDQX@`fFBnnJmA{K3Lu+yNOCt?)sHY@_NwNv
zo+{ZRn>Mm7RRk+hLD|9e>9M#E`3L$r89jJa;jz!@0ob#e0E49QluW0r?7sTJ@;Ei7
zq*PKFKP}I;4ietQu%(D<gciN#Ofeo}hjJ|}g+O4odoQusE3qM-=;dl%J+y-D>pA<!
z*;d|%$M2T#3Bs80zJVD|!(v2F$pTAh!F(UMx2B1(AS~NgFmeeR28kq*zo110pZBTr
zG#uQ3YQ4Bb2|ok-H=_iH8Z-XIbL?%3_FY;Ys`YouN4@9|7xN8l&&4Ba9a*PfE>eq{
z@!L8fDH&>?TDnYki?*YwVvZ&rKp?x>XZ1pa$kA9(*^kGMIh6nTMO%72)@!Bvy@OLP
zQe(9vf+7W(m7RQtWyhkLqTEk+ZQJOxw1<HN@F!`BfDGqBUIB=8^6Z@s{Gjlq`a5#t
zo}hINU#v>WV|BZtln*ALy^X)*`v6nw0313~#S}pF1Z^T?s1~JzeEZc0Apr*7o1f7}
zlW|Fp(dV!_j5HIoz^#4K{+gIX`^>A>rX!8OyaUwi@)gtS<P}b5ST=03<MDB!Gi=_h
zdL`weKJ&3G!!f(vyoM7QV-ff2+fV1+69u;Vx<TLu|7}0V4R3y)Kxf~>%-$7(!1X?S
z+?TU2O|1ScXL<AdvZEpIZI>PTeO|9GtQ41BPZp$AN~_Pw5~Z23qYMqtg7zlfHXaF>
zcCj#DFL!h9vTRk>Ez@Kn-+!WS`OTn2`;01HWZL*m(8CgObp})}U*Zf`yQ^9?by53H
zh>PPNH43imiPHmvjEbF;rS*H(To+3bTSuewMz`OLc3)=U3eZNgXG@j~6XjKZU&Qpo
zwlDY)m}^FPv?K!^d0eA5mS%`rPo9(GP*m2m$yEiFLWNViA6VJ-JTOt<%^^t@0a8qB
zEqu4Z**5_Ghua(OWiN|6Ac13veh5p#Ma(@~F_~^7M6^evmVpO#?<CXXkj)_k;j!h=
zSw+|2Gv|peQf3z<M4fUXrlopgL%H24)1pwOl(X%~_cwjFg!_vDc74&lAqy_avg8{c
zvV7r~W!&Fa#6~lXZ7QSm4E*kxa%nU?53j+PLEp5jlu|TZxZkFO#13d4VdXl?E;m$W
z)>9)XCAoECGph0E&Cl6y9V`!O#Oj^n(fL)aadIt1P~mZ6YUs(we9cOiXcJYUGZoRw
z&8;{Z(}v0cM>Y6QQtCCd(YDbpw^Ru=DUqWNejO?jWfz;PnV2<y?YE9|FFn1|1XSTf
z9FzZR6yP=TWUad)f3*3<UtG5lJHn`>l(LXmc3}BS(j%F|l0ga33>^Yf$zRqsWqh>3
zTtfCQNgfMUSReeDrI{$St%KF}<=NHlapFf#FPaS$%mqPpY7{~Y<Vh2U;e*W}<hM?&
z;;G$zUt+ZV?B~U-NZ*jd;VWLo7MT7q`rAhs&g1YuIgS-_MP-Y1v3E063`#rD4IM8f
zdj$4FTIcSOV8o4&`)4UeOyl@o&l>Y(kLlIo=bqif%_T6a2J4e-uXnj`4z=hESlr8+
zrG*7WQ8Op$0RwHBQ&j%#H<ki4*OJi~%A45tR_cO>kI%+>4;3oSH^qPuV9<6yoUf=d
zkP6fj1_`|I;1*U>Q0tb7cT@A<o*IL)pOiz+ixYd-Tn>(;f!^`L%_}Ya;_RZGUx308
ziatB<$IlQP(o~;*s3m5TABFV!E%?*0lt<YtctaseFvSeyAMIT<+Wy+*#+gn5uJXIb
za<qBQAE>IejAu2>*{Tz&+U;=cHAeIbP07Rgz{7JK-1xh-b*e6(VBm67=bL&tXI7CB
zQR^jx-=@4slqRU2Yflqxq>M6bx}Z!dZ?Z{vBiE~KgNuOhy6H@U1&*qOcPE%;S{nU8
zi^MyEY=$8_al5wlI=^N@Gb?sNSQZxF(+5bV)fZ=*hB@ox9l9o*h3B8}d1=Vb9Y991
zJe9IXN+4B=>TJJy-#0g32MC<s&otDB{xcXIKpXxQX3hMx&9bku|B-#)b$!OibF@SK
z-O=}v&XRHm-_ca)aeUWs?1t4{O)*Uze&Fhsjq?ys=O&*@w4}r;MytfoLfNd?_kr({
z5G&}NyfMSN{)9ij%$4T*ULu^YZO>X0Vh<Z>|8|{!U@GeT{N_2UTso|y5b`re!^ALu
zPW<E!I%|6*YnzytGu0e{KZ~<&dLZ14FL?~U%b#<l;&szF`culghCs0=_*QjMPh2fU
za+qyIx!KE5_q)peBa%{$B$ON<c%=s~s`AxMKhdi=IyEd@S?59Nr{u>=>MH6VKL!;q
zhk~EVvG?}(^Rw*5l@I9D6s7Q`XY59~w;c;*D&J=i&%rB18TD>^|4bYGcxH1S8X4P|
z8}kFJ<Z&kzt?xwmYS8md?)R>Ms=~vD0LAC1-dRB)u?c7a2S%io!tzh4mTjK3;nEDS
z8q3Z3NaR1PFoXqO?F&1Rc1$OpLqT#e5$t+9?iw~I-ayU6=Kh9L)lFQiF!n`PdR){k
zfh`=}fBdtHNXHwYO~9?tv*7YJ#m;GlqDxwi^JB<%l`W81Q#4w?G!wdB+W|{&1<wwV
z^~}_9RrXHwpv9yi%|e;8-v(mj<ZH-|i4IuPq-%^J+Yx5bJm)7fR;s-aZXwpB>3vjh
zAJfTFt!{oVmF^Ov_<>k`yFK%E*#!#YNgV6(L~Sqn-rhG;i#<%><V>qWJ=?X>Ry?-W
zbN&2E@sukAmR=i5wX7=N=!^`hW~f{BKo*xdQQ2U$o}NzsCB~c|BS=TuXSvMX>ukpp
z%neOieM;@Nm$9Q*jnC?Qpc6qlO)iT-XYVb_PRY0K=G&kRA?Qq1Axlo>q`kO5WTm(R
zTq#JnSde%a#E2aYcn1edZOrWd;e{Lu#kP#iX)RGAgLHS)3m>bj7D*k*WbA%7S+jPz
zt`6+1d!KwEtz_rZAH^o@{!Js4cj4e6C;25}zzq=qo}p`$7P=S*5T@iXTQXxRjI=+@
z)>jhh%(p<^kQD3rsqI~jVKq2mS>RVAFD!LwQ@LsmMrCJ9s+qMaI(@8X>{=Vs>`7#U
zMpD3Yy`0?uaX1S}ziDz8zQ{cXlT)CS-`j?m#0SMN0D<Pa+swJSMJtuQ!1{vKR5_p<
zb!{_Z0NSN|dwSu1;&iAH3A9$sXpJF&b5@S-V3WD~(@eYC&c3wc`v1PkvEn@;@ymP^
z^!ULl(dc`l`bW<$v(br+etEJ<*-x9-_V?BjmtV+*&a@Qnr4FhsK9*QhKKxNoQ7bi%
z9NG{&MSKSBFn$k-vVW8k8wMjyo(O3E6bH4_8Ow`)*DDVyTR~5cycuozC=)uCYb3vo
z8GK)iZBHg1dbH92gxqrg^A4;hU!1?V6(plMv0>NZ{)cJfr5?t8ZnJ#!lA5o_5&P~y
zk6ez-j%SRsE+D4m`v~nKZNn|>ElXjV!kS|F?8+ZQ$8{y)zhDWd)WMyU+6ZtPpJA!F
ziAD4M$#FJF;!WIvmY&^E0!MY}`juVua!Ru-;P6%zg7<XtYNMY&(K}CJfxL-_i|xVq
zsU4SbpHE*FN}b}M_OFib8%etTsc{W1vdumM-y-TpQK;O<$TMgAijxwN#hdJyIB4YQ
z^>?(@jfO#>kQG0t(4j&!2ocTJnL>-eojt0!NjO<#`e(Wr`{MU$ZQW@7y?cHg&bA6q
z7mngpZIf#tJoZkdiLbhb*<x#4LOl!`pL<&guyu#EnJZzHo^9YGCN1<-?f#&^-3Tr%
zlru%!$s#k$ECG1H9#?(eDV;uRt3`?O{g`-hnJ5jd8ov7ZLnyAI2ovg_<+LBVuL6t~
zR*SHan!5ZU))VQ^p%N`Oq6GBB-+NbnLU2=HR)8;A)%GP`1|zF`0N>d<u*SK1$m^ah
z`#`?*2#)^Xb7L>=;gvk%q#N$Qt5DU?<TDOm++#2H9@0gSR$tGd!OJk;<n@uDnv#*K
zaw8|nf&xe`wjW3bi_ibFHa?W9LZ87d`H`|h=pOESqiG8F>j>$4mnQi4u+X?-me6dG
ziyXm6s$jK?zwIxExe>C!V~_bgoXxE$>Gmkg4-+?&MT4uu8+Crf78D(7uDx7)q-z^9
zhR9=eZ$pHSB)2KZ#-u4~^^!Rgt1O{;1czwnO&GYd{YGl?oGy{pKEY>;znoD$<6t4~
z-;tYyi5S{ddppq7C&ZvQ?K+D3wlqmO{Jt-`c_r>PpnE?QxpKP$cnxBF?O8?4jK`=C
zIU_F1rgh3OH6$NX?Itq*eO1w|mK`O2NV+Mky2i2o_nbWr%wW%-FTSf>=7Qh(v*U>9
zE?um8&4C%!C0LKs>4D$G7?JRYtj1;_`kXl_z-UpJbC?`VdgOoEg!ZLRd6wH4SN_9&
zvsajAP?8?XQ;L+kiv)$A$>*G45F_NJyL#_9l>;PA4WqMp^%cGXC+}GRPQWP9rrMI8
zY%`v<uaxcz$|RBlvm8RANr=d9nsv@XW=5Qx>*CG*N6_c(KrZC|6ZH?B@N{eXhTqo3
z*T&!N=ZE4OkMO?)`WcHm2Vk)`Jzv(W<`xxntHr>3l37i9KdZeC_r26`u(Gmsc;|=O
zz@ua=G{AZ6j$Z7xm2F;owW_ycA~9Wp7PpmcHNxtx<B)ckK7)7#%z#WRUv6G`guabq
z|1akjhZR~YX{8%`m;_cCS}iYrflcpKK*`jc^yiQdyRcN_VO2rMs`rgmAv4k{$m(72
zsrN@S?jY+&tv1HSpm61G^pe_gx5e8NM!f$cR%N3e>+(Pa*j92o2MwbS=9rxf#(vP?
z-x)Br?DbY{Uy<3K*p%Lj6C(^s*B%PW*86Nol$Hy4c8CSSyU+Z-!OmEkVWGkQ4DCf1
z_bp{S-J@|hCI(o`2LNLX^i5_z|F}D+LcNa~o)T8MBZYvbNK&_|o?xFlt2QmbvZ=y;
zo5_FftQ3cL8%DCs*qlQb|IRl}7`9Xc8`|RLY($s-acqT#;A5(M7unVjW6AHAc!T1*
zUg_-~p-z@f^#i*Fhyu<CsrB@I+~|yOK*!<>$v3F{(K#~{+mf)Xc4h&O8_BDkq+ooL
zR)nQ~{7ILs9u1>ZdCxah+R^?Koy;Ze0r6k-&jF6vGnIn@2f4;xdgMys4yOm`gtU<L
zhv5f@x5!pQp57!#5S?8&<$-t&ngp5XB0h_-aU7$UV8fw&-yiJe4(R(0Cmmq`)ffdt
zT?t2I8J3VSjm-{jOYz$z?jkx?h=2cwc5dY|jd`?4d$Gxw<*Pw&U}!uG{|m>JOMm@>
zHkZa$3I`s=kZ&Db=LqNyfyB)Cz-(8Mona%_cnpPN^KBr`?;@n_y4NIGk4%14e_zv%
z4Oe=3Tg~?Om!&*ntyq4xJr`Eju)7rhSvlL_6cJscaCrXu5%eNde1n8)%l!TOi;<vR
zYvO?4BmsV&$s+wE)_c>F9C>howr_ef1UD*KL9e((wad<9&+-VR(;Hx3Dt$l78G_E#
z_><kgV@AeA`&;fYb=B|yEAhO=2raIQkY86N68<aYV}A$eAHIa2V|7ox`X08QMdi@~
zzGizv>EqL*b-HDvK{3YCyZ9=%(>b#{RQ!A}%npAJwN;w{I@mTZTgJ?VKPel<azf-(
zM~^P~@jJDL2r|=EC>xgoEM^tTP?6>FebcS=-09=9S~AcNz9(<HT=MS7TBBg)8G0hF
zmZ*O|rlcS5Vt1b2?1{-AWp>)cJ-p=uL8~9V58?OrFr&6jM#Bt58~R$d{ZPU)qbhsh
zsh|I13uj2{*FCqO43VCK8`682IuL1MXpy@H?;)7JGSoI#6EmysQ(a1qOM@beDuUKh
zpJBc16FO$-q&de=xb0gyvOAT(U=O}XR}DoTd>E3T;s*_3D`dm14&hXbfi>Wn^?$K8
zVA~dS12w%LIAR56;nE6sG1$T<(?Zu8lRHQ0#p0+7%7+vMlFaN(I8st>wz<2}1`t9$
zQNI4a=o@n!a4j~5+#pAV40P0ShJnBS5Q=eL{^w$jG*!)7|G`>tTM;LKv^!+&T#p^M
z@dd0J7_@p_<X=A6LN9t?MJV)?U&m8<2dSdm$oGb#Yp0V1kzzJXX~9)aaHD1~29y~$
z<aB*@Yd`NY0$<n|&~ed8ciYxtbKxob17j))t7utC`>PBmgQr7zYJC}vv!}x`JEy;h
zUC6on4`_GQ7c;WM(}(JO;-XZ9&L-~8Obr@c@o4&MbOLjAd?)wj&Ir6fiTf}7e&C)M
z*v;gAee#<Vu=_Caq`ynKtRzqRgm(FiO+3c8espSazY;02gPi63&_1{fg;}Q6kSCZE
zk!0p6pF7gT8URjgtam0dog{lQ&8EJn727GW!yz6;qqg9T;rw*!D4$4Ot3Bmi^7d4=
z_@DT?kD8(<6WQC36K_XN_kICxO-JHf8lg5aecUujQqY~cPyeA|4@918-vRi}K4Tjt
zR!O_(#I>JZ5Ua$ouYqVW`>Sg~a1UnjC5@<$Gx!zUy%nqT$Kd0}{(>K-s1qyelfEZ`
z6lg;n1IM*-Pq)1ue@5S=UGVa|hj6gE^v2ylIk%}!>H!bO!HsIYi#T24$*acn&1<lv
z(wzoEPJ^3CE?V8q#CedeBB^vEW~qao@=xq9EB~g;?`q$!&ujb;6a2nTuxPwIJVNqL
zDzlqc*=X|qAjWw}{eVqQlM+}wob80)^Dgco@Mmh9CE=(5TOB(ZIU@+^I3J#Pn#$jR
z&ZV@Tez{L%>W2Ax%NXjSx)iA>xy=$UEmpQv{KPjC{@p9NhzDQG`;;|5bNA<G=KPC2
z*w!CfODC`Y0}WH>T7E61h2tmIY~mo_EwujIK~i5|4hGKM?^UnxM*Db-G7NvZ^ZHrl
z7*$mlpo7XdQ(23_ch8S5!ot1t=Du0JGR)Oz5I%sVLHCaJmN^e6#DlQ!W<I0yE4%%V
zm-`B=Fz}+in&ThdGZ$x4PgtLUu>StdRm%%&#WwB&Y<07qr{etR>h|Z^T|L-_b+9mJ
ze`nSmP<br(lvP^5mco5rg$n|0#qaCutdvU2pKy42O|SS`|77R!D&B6pLLYfd$sBLm
zaC_)$`}Q1DfFrqPncqzMm#T+UG*)4$&+nCVv057snU0ryMZ1Ans{9hqC6{esNW=H}
z$5<ba8zfRcRNYkk5)pg|#-$ECCY3Sy2i+t!;!Dc2X8+P#TxmxZ_nkWNpCj-bEPX-d
z3a$_sXphTSo55O5PW`vjsFOe->mNKoan3bKKhM8+%1Iq6)F3KNUYMjWx~>1z$>t$J
zF)Npc1EGd6Me9TU@)(=9FD(jHm3gEI!$@zWf*4`A5*p4OGYSC+V>u6|Qu}s0PJe$=
z<Q&%d5wy7w;B~-BD4Q*2T*Wwq*sQT8X6=SSGWMPfk5{e|8a_R)$JfPSUEVb04)PtL
z^QGD-pu@l0Px;NKU#&l@HJY0dn4k<}+VJv=u-|{HcM1#q=LuV@jzSFw*tL$i@o>}{
zR5gr34({QS4BBkxBlC=cwpgN3s=7O#2bi<GMs>T7IhQ{7<qD2{py(e>Gu1y!^?NbH
zmf-~6l9V_x7Bh6A3=!rEmEJZ-P(W|Ge_0I>oZ#%90U-2RSX`|C`tUVIT+*81*ZGF^
ztVG-le*px>@OejfqGk+;ratr%L6$85S~mJa?pMPCULV=QFEC;W$&z%?uJLQ-pB^I(
z4o)hT;`mJ=@z4JJh4&`EJP_nip+62i?obciP~c5c;Av1`F3JXl&hXH8Ntf<G9yANX
zKzmvJk@7=SH(%U*Jw<hmt_bLFLu&?FeTJaxWK4sa?Fho4@&%__Sqx6G!!oCT*w6p2
zzNv71QetPMK_mH7`@co;aF#P;y(Q)WG4;?L^Ud`mKi#t>GUjl|he%GOJx9dkrb+kc
zEJpR=zbxc{Rt7tw?@1qifi}`_W^qFGG?w4E{@aX)*ixrk{~oFHD0!+#sj8&9(Zl{y
zt|1J19_cCF(5_15RsPtf#*pQ(YQmnC)QtbO@1Ij!ujBCO1|o(Nnvw3WlVTUGk;V0u
z_PbobGKUWhH#D%k<5{x^bMA26D=C>+hOQi@e;U!O{*j9f9w7)>$>1oQj`m;wo1F*5
zg|2=A?!2;IL%1BX9-aZVgh!8mQ%fm$ySk{*69DVw$e&quL5Eafu1p=srf}|qD?DsV
zN}S4aK9kBs5`~YE#cGasYd(yc;efpS6wdLZx7BUkxpc}R%<O!%Kgr9po-C9>aWO*~
zY(^Z)?8f=}7LgbPWW8TKV9o!^UaYb^=yT+884x(O?XSjR+bZPV^3SN|Lo&AWZH08L
zh|TW|1&7|8y5BAT*#HqgJl72ceFK$r4(ZlVP0&os4I%Vrg~kgPMsYw%F>L9MC4t5J
zU7w$OuVJ5p$fnvrEEB2WfH|A$hqMB>HI!8Wy3g0latnk4g<Y8*&)PzIO|g{*3z6pW
z9mjmaRPWNZ^_j-p{v5YTk==@aWhefd$YDs!=`;fDJOj9l=y-vz#HFo4#+zJj2hbuT
z_Fm&>X3giN8MNN{o#EhciF!^5dt2EUMN!aMt|uAA+o8Hj#-#r^`_kp~;Ff*I4ve3}
zS9}-3Wclkzs9dc7wejwv<T(xfH`#r88Dh}pZ#dFaG5Nl6bvH#~5h{^^!}CTLWVLq$
zbbc9OH@se86Kxr9|6pf2Kk-d+$Di=-8u7qQ06oI#Rdg8&XR+{S8@f2ymDRvdx>vVF
z@qXm3ML``3DS0g|YRIQB2~-QO&%*SAneH6QD;;NYaRi{^ZC=j7Q2sR`qXL@mP6nlh
z`6awUiV%6RQU+#hjR}sMk^}@h>Kj3T`?^JMkL&v!5NA^@hq>n&1TQ<f;`u#+&{$+x
zS!Z;K3BaAYndFt|9vhj&ixjEhjoy`)d_H@Waco3fNS6O#Bw*OvyZN6%{gb2>BpxuR
zYg)yICw9kQbh*NDGp-_F>4Jw~Vfjfb&n3T(2=37jyZ=tH3%jb`<BP|jv2V`?KBZKa
z?OELnTbIi`x&^5_wTWyU=ZSEIgSV}s_J+o>UEIPxnnY);6Q3i%%SAyq6O-M4yn<#h
zMuw`TwrqvI+GQ(5I|ooK?9&flIPS%TjY>dtIqb15!IJkG{87_00{q49g2LF$K&Wff
zZXIGjI`loQy}iyDs17>_IMPa~HpSni*tSY{Oq8I#<h&7FWjkDBxgQH=R&;y`g^MVZ
zwXmzmWUWpC9bKbrhwII_YF|G>a1a{HdKmoJ+j2B;Kf~CDIm?N8{##eh)85Tn7nAZ8
zf*i6YE>OUuc_6hEk4KppeS~v?ASyso>9{2T{9~H8M%?gk@11A=i$Pw$A_UL|H%GU~
z69ci1QgP??KHpx&2V)fvq0w)Yb$xwpEP#`#Mdy<qb*rYNfv%zvwEE{X{}W^o?gJLn
zo<y?Rv1>OJdoaXD82S`Cwf!SRno~uU4{M%_HtHRyLWHqe4m-g*(0nC^Pbs{p_K7U}
z*sXUXm4pjxXES`HFLNU=S74uKq_GOh87Hz?>QWFeTh6b!NUu3(Uif#Y*&aJj{bo2I
zjuwINAd9*=Hr&}Gk(*^}9%(Iqm3^`~X%p_lc|Y8G*m?y9viJ^r*9l6;#zos8e9hiv
z68mx4PA|OP&(^!A1XQ-Hjt)6otSh@5n~xvrdl}&S`N(_^W;M#H_FQA<OFYv6{$P<W
z;h-WCZ&i<a<JsXhm3mGypSi+1JV%&t6nOm9v@EsnBiopjde4{{e*Ug}J<qrPS@+Oq
zHj0IdP$s&!z5@oDo3Z}e3dS?0-Zmb-tjl5$=&~5{>3;`7tE&ehJP9`d(*nQZhC{Sy
zhlZuXC3dlk06`gBaU>1R50XTvm3>C6>gR-mc>{`XnP3{b!r)G~%Q%~7p^-s***11q
zrhv_mAfvuZXA|r&0qfP}DD~w(hsnuJ=lisf-rZbpZ8Wj!8+|0>C&)gP8<+*~!9BZP
zKg|bknz8Lt;HKY#yMe86p8W};MMVVt8Q9^*+9xF2-f`3mgD;S-G3o8v72ecvlNF3v
zk@bcJ4pv<I<m}5EV%IPjkVlVNO@~0%=eUQdvJ4j?4vYf&4IB+wPo$^pL?n*=o*4Wb
z#7Ccnx2TGq!05}L>Xemt<<G9$^~1y{ay5KbHEMpnZU;8Wy(_8c$MqUN#X!vP&VHS{
zeoDCo5N$cH6^s%*lpF0XQVO72O#eFvK0;rxjRfZ9gHWYAFI!!t?>9+YZam<1ybDE{
ze>lEly^yXJ{I%MU3>llda9ptnRVATH{nkW+H1Jcb$A9jrzutQde$S7lRxi49&#+at
zR!8a0WC%ze;gf&+yI!>EJ~V4IhJdUk=i8mqROkcfLSGeF3V%0ZIniE*sA=fV{Otgi
zcjJdFk1-R=ImzG|+K@Szc8aZaV~0te3yJIrbk5fRcMspQYY5eMBFCi!{4*oK1lg9>
zb^h8DxcLfI5SM%cGi{eLCWkrNdK4|VN*+@7TpSG_*+@{13fF9+onFN%Bkl$*kMPhi
zEr-<8PoeeM?Qf!D<SwutIU4#^l#muK!?;f!gM(6$vnwhUvqFLu8oobH{@q{R0O-kI
z{-Y;PYBK?oTf(@8q5}6cJ@TG$@t>eTSQ2XV?a#=yx?CgIbsia}cW+SB0bZC>f58lM
z%#S9`b!)=V!V?QE>a{Y%4Pd3WmwDNq(D~jeQf==IOpVO6Kz+(m<ESkjDAovXDFAwn
z5^U1#>!X5pUrS3KoqcK6Y3rk0la8$UnC3T!W<K+=P<y2iU?tKR<K+)D3X6BW<QiPU
z%hC7o&N6kP3PgVRXT$7SbigodwLz8S5G;j+*oZ>b0}1%5JY9`|SebQlT%M1|;Lm$T
zUn>jmXkyx&4f(p5G<<cDhFlvMOXmc(d>`xZ8Fo%w8<x{A@Ugep!7z+})PIAKb<}^E
zC+Q5#+^5j@vit9Ia$4XB%$|L-L8{&*FF86Oy;;ZS!Ph4}rGI$W7@y?9PVfn0O4hMe
zKVqXekm83gv;`h^$~k^wSeQcxS4}rZK7tnOi5?vOWtQSTmA6_h(x}e^K=e!=z?A$5
zedFw%7r<rJX`1{XXPd#~5Eb7j>_{jnYtad@Z>3;mht!z$O`k(E#CcB}CEhE^zkY_R
zj5zmPU8PQqH~QrAG-<UUo{hO@UW0((1wdf0N?xP##Ts@wU2QNhX5}Y;Zd+mdw{?5}
zMV=|*B9ebcC|CxX4B$ET(^F$voMNe7>&`{NbOL@K>t%TOfA}@&7)v;MFDVgQCrT)2
zHp9K3vhP*bhki?EOU1-$85}9bK8C7#351rFFmfJPM&M><OefzrwAU=t{@8E(pWmnt
z4V_xedL-WEUvVICHh~<T3NjSh^%zVtTi3P+O(vj%!Qk=(@l)%Ye9BfbS9ezM*z5u~
zHu#!>7lYfVh=432SoRm)zk;%3@ploMp=s%#1pIk6Vjn?OSL<B&>->Lw36(JXa>se(
zX>b|Tj5b?-=YWAYKxTTnhw)>`+1uKi&S29+E;+>a`(8Of)}2%ZJy7N34F!T}CAZIR
z*q^nQR4c|lc`xt5d2{%7(oaE5+k8oe&+)4G1NG9acuEI0$x~chCenRN9e#ok^SPfh
z^n1DJyn6-}v(TOFXEo8JLh|+2#Xgt5`L)>%XAD}@ahXpQDvBglS16`gxbMUW&ohmq
z`S<dE$vtCL)_ovKn+Rxa2d74_t$hsM&^DY)^~8Qo8=4aCL+LA|ex80)r7nT<>^2-m
zP{S+PVB=_`t(hZZqrM~JNi1k3e>_4ishHr0T!Qj~T3-ZQR&?}DxxKl?_vbmAabk>1
zrx}1#TCVL-{b{I18m%w=+awjpVlMSZ3<B~VRjI0+9k^B}6+~)=oA>DImS&#$)b48c
z6%sT(Ypgf$c0FCRs1dO`4`)s5XJS`z_v*f~suMA-!{}lnCk;4q?NT;&jU0Vee{}t;
zf7}iz>Qn*H>fv+IpR<7JzV|jVBOHPL&S`nV$uUNo1pYbf_@-Z9Dp5f}o<%_Oa3fE_
z=_piQO4te|m3jMQl39H;3hH1Bqo{h3k8+SK%A?6?HfOrcs5Qe$IqHh98D~RcL8Wze
zcxQf)!_BNiM9@1XHR3m&DUP0vVU2Il^(O`aGwo}`Hp}lB`?yibl=A)Sg0c#%h39;?
zyJK69zTqn8f@onvW*=E=`gq7Z$3q?5F~b4wTXPd$)~S~jZxE;kMPaP|apHsyaq|;&
zcl8O~L6{<D4fn*ZVYx<g*>fnu*KbO~1|~sTlX{;4ArDu#gudu8UWsm#=2I_&EW+{}
z&38Hh5-x`tk-zRuxk&HuSIIhjjiAD&{nR-Pt8mpvL6Qw-f;K4i>-I^3&S9)+%9ke%
z7S9*Op^YF~L||Wzl&wtGXfCgF%Xtc~R3bZzCyya?G6HB-!22Ma8OZz4nY=y$o>K6?
z9RvR0ev1zs3(pI=5^!Y)B-O=)j%it+4pO{w2}oqtz<OuEyR;HUN<EH~{nwX?2`7)$
zXZ4uAM-3l{vIqFp_ODg?1}3_^3w-0CD4LTNNn`tRFR83UEN)lft>@13tUH^!J&r5W
z>Jq((#ZZf4rx=;Ug;2HrIVL?-an|*plmR2$UuRcqt7lNv&Af$PTa`Z4H@OycWn2<w
z8<88DM80j6yb#oWUGu9>prpcaki;5IR5GEOkWUE%kVT5CcSd_nl7NcS^O?Nm@VQ~?
zgy3=9gVM@D)xw>>s@(nW%)V@u@q!l3___7+1ra|DAYtRxQrnn~!IrYWngz<c_l_sN
z*0cxu3EgY|)BN0|<Yc%iv@ePH0i8u0Q8k{3_9VCv?%t>{Q}|9-UP^wma>()Tkunqy
z_|f&O|0fZ>bu*UcT0|=)s=S`OpyYN@=OUf|)LD^A*^6D=ry|AH7xu<1Wp87Z1tzm=
zD~wAH3PrO7StC!uWruC|VReM|`{L6io77hS*pNs0E<Y8=XWUD^LE+X4^L$%68p-qU
zWg8AV`9j_4)?2RmLEvYR>$iHjk7ObPUW_!!W;8yDYNaBAy0vk}1dzO$XvaJ)d%|ne
zrXSaVcM?pY=>bL+X=;5wf1oDngdF~};h<A&)HIVa*3}<DT6?_H!j`3><E2)HNF711
ztNau%a<?#%5<L4`P*VyZaVK2u=Sur)JMiBYj<E0F4~N~xwb?4}!GMFb!Y11~ki8N8
z{~zm}Yk&s<PJ4yZU(aAXI3IO2s#fBCFNZ%GJk+Q0ZMRt>J45tN=JFTOpS(0oQ^+SJ
zXcn!5<AEqiXw~)!eo}qGhT!%=qpQvTDOqevba${{-3a$7soYP7)2F9_X?<S3X{m}x
zv3b>CjA5Jic0vWVYh-F<`81orn~a0IaBG*{DoZku=@yJ;*dB^e{R_S-dx0Fz5m+$i
zZ^7w`lJrsxg?r|KS?&oBquIQThf5yqHa|yIRP4OX*0xhXLH@h~c6YrYz3=2NqMb42
z{cFyAMF!)HRQsi1|Bl|Ny~^r{63FznTHdxT>ZDu{6T0?n1MnydF=sxM3rp|qKJ1_g
zFgL|1?%!xj=|CHynPG<yyrpl8l|;olH(PqOt2J9bA5dpFz1L8%X8Jz<C}tfA9f8)l
zCBi<`6zpW5g2#Cxb&kN6n!gpQ<a(MkPf<bNvtIp&`~&W@?xh1wFPek@`t7v4m7JDO
zwXd4`JR>?BVrn(BMJ-@<QvtVvp0RS%R_OTM3Rv%(wV^vGtpi26L6|U{1)DvC-{#QK
z9i;9SB9{)b%9-7Cez{lkcKyLz&>pz*eJkJZ2N%V$4aAfK4X*V0S;sxgwik<hhnP$q
z98voaL;S6qh3%aBO^@@LI|<V*bL=Xi8KrRabq3~A9tF}vCM%@>jOm=rkVmXxt0rcf
z94I@VE;ePH3bJ+j`2;dV<6$p444!8)`3s>x@%S$8B4+B4%AMDn=8(^ouH-CW))!`A
zX$wvCGSF8Ri#KV6saI$Q*fSW==^Bg!=EBEycHgAb3YR<C+@;muxqs()F;V&c8f61{
zJv2Y5%vR6afHo<;h54wd=+R4zTqZOS-utgK?%9gow}qKIA8A3n;qgF6p5@Db9r?Kb
zTmbKN#g}T<qI{+g&U2(2-W-c*Hv=(kx|#b8U`BSi_XV)V6RO*RgDhuuPP9m)z|A&7
z8HxZY?i9D)a3o_EU(Yz5FZPays%9^<1bxS8mR*E=cOTHzgvUp@vSSr5rt>VzIi7y0
zl3FH^4y8WdR|(ww@dWr0{zYf?mgjIrmjtT(RksK!$&+I>H4O@{T7IZmHe|}FLf^{<
z8#H?sIhSd&yB*<e{Lm@aLyf;EoKP5eW7iV7XLqpKyehbj?{$Ep^>#@MMnRex2b=P1
zDLb%jb6tP3EZH0m^3F+gJJ;w-@QW2NKAn^4$8K7Us4qLT*2St2>xqdm8u*^too0J9
zHB+B9-#xq(D%1M{Sn6#}_2pbehRsYjffuvfpdEbEI`vH|d=h~n4hBgSlybonj;(M7
zmq3+0$HQX2AYFTb-v^sb$GIC*E+Ut#xF)U(scD}@Pd5l={%aeYa8W|k+U~_h>X~Cb
zpE2A@1V4f+i{Va|7(J9>U1-=$Yf8sM*u7F0fu0rr%KeC$++LCnXg$8wrVdg*{0HZ=
zj?p=}BBu`f5aj$tE*I|;KWVSv30g6Z_GC~in6)4Lkn$o5E-0G)@EEJx_T+nt-Ddo+
zMRTdRUwe&f-L3?I>7f)3|F&&m8y$4!L*8o=C(3R$2AT!p*oh9x%tpL7gq-kLZPt1{
zt!^IM{->^ohOuv$T`aa+dn~Xsq5M(zq7ho5xwBITlAX~T7)ms4E!`_Ck>H?aZ^UXT
zuDS_A8TY0*HRw-LdlC3iFFVF=&C3DBq>+fW2;JKW<@wqIJF^Bp<CFpg%&-ze!)V#?
zMxn_S*fhqMc1?i)7h*b~7>!ydN&t)8@teS&@#W$3&b~rm+t`y#(ytX6K6k*&`Q)J%
z7qa8E#3C$MMwx(r4H2-E!4hjYj)XQgx%4#A;yv1$^b6__g9&y~ch4pFZLf*{PF)ze
zwEj?&;?Y=m*Vtm-LD2jDa<YxPi`>@IeWf@#CF>%MvpgB4l#}*&Gy-8#%JcEbLecNx
zpfW?xPyq!?&o4*dMZq9@M~5folYQ*|rEN7FWoY%jU3=ySGo?QtftqLXIKK%7q9TvO
zxtO-q?Jg?x$}eZMelSdY&6!*#D7X__OY+Zq4gPtsRl#Lu41~r@(&IU2@G3hxh4r5u
z)4Uls)B~~vCsNeCUROz^QR1wOb<*=Y6vm5m?Mbn50sx03?NkzuvuxA^$9Q+|1nlZ4
ztB<xKr=O|fh5yTmp)bTZCeS$7Sz`=y`?Iw<`?>G;HvisJ6PsWrR6(jo1&phzOF4{9
zvF!@c!MLQIbs6J8YsccOHkBPDiAJL3F7)18(fm;s%d!mP^dHOX`|9vv^eLU*DdzBG
zR>!=x&)rF$Ho*z@rgyPle%p{DAnQK&t4d)t0|e4-U_E@%x3H$Pdztl2=m-xfGw>d1
ze2uF-snd{!PPSZI1y^CD<qsBDgt}t2Rla7G8~Gk6cjHT@IF0x8WmA4tm-s^!Z0?hR
zW(d7t;_1OvyqmGx{B_MxQziMU##@NU+@$L(LMF?9*$ng(V+(TkZ~XGyJkTKx^g|`f
ze$5DyU<3ZV0xx7LG(RCX$LP%b+hlk72Xta0W`rR#`ltMDFP_Xo^-5wIl&5vg+_QF1
z^(VMz?*okjvL5WtZ2-qB>fBZHrjEIS738RWm$?lYJEC*?-0B*ooAq%AygcOqa-?zE
zwg&ZHcJ<HlhwZ_X0<TOQqY?VK8u+9z_%VhPB!EO&0*sQ}`pbe3X`3&YZ=QkoJo&Qh
z9B<y1w=1TnP!1JIjlN;nrqBLlHrR-=%@SWmcjT7La}b$i!L#9Ja`5`aeQ4KAhV<zd
zJy+E#io1%gKetg|yb6Q9UQP?X#5}bFwIT$~%%kLjdRo4$!FSY;MMD%n+j`_K!_cK*
zW|*o~ZU&^yy7y%!Lyzx`oB@ONiP?;|W&Lmd*f6?guTg&@H|Yz;S<`Qa^Sn95&^Gwh
z;H%TgL6XRGyZ09yMI;U>At?ieB<MgqfqJBjtv6$Yb@bgQ-~9UI>TV#Tix%&c&4DU#
z2XH|MF!IPrvID``_d$!nrc-HerQ@!(fG6Y!X7KiKz+83H{xwdqhO&l_DBtJO^EYTv
zW)lfEQj(wz{RS1<e7p8YvY0Od)fV(qd<KsP(I_=*P3<qNU*YhXEM+f|gVQyUQo9&{
zuQ;W^Y3TswSQT2|68M|vFGYl?R@Sf`T@@o5{0+-cc#X5)YB3W&q5hI&8$8FlZ;+`f
z7|;<Nh%q$i8DPgnDQ5x4J}{m00AF_&<FWDKXvMu8*?o3CiPf;Lc#uu=CwNNB<rA1{
z!$0+Jq}~dy?*iI0&GzP7eU0KM4`boCO3KU<evW?TPwu;7h6jNce#Ul$CXt8r=o1{4
zc|;3uudZ$$r#!{^?4<267gKFpGE-?2q8dlcLEo5dX6}_BH&cL$uNGH`)k@N+!gM+n
zdgW0DF<dCViM}Wf*|9cO(_+Mr)uFwpsXpO{-8v!jZtILTIL+lMxsGi#fc0wj(b>AR
ze%u5b=rCVKZgN0^h4Nwh)cbbnO5duVP{_>mA`?}G2?|KtK2sHjs3`}C%i_m_y$^K$
zkEU}EXZrpBcqOTvDk0}|pcs;nb5Th`@-cIqvsjYzaYP|GRdPP%OdE5Wv&}K*Id9H$
zHgi4>Gk)*B*Y*3?AMCRC;lA(J^Z9rH`Km5y*<!ox=c%_(emHq9iHT)#7B&(@C{lCH
ztbgNOqSJ%+Tb?_iIXIQ48=GIdud+CB!-yYzgWMlwc|Jx*ZK96}+^&tugN(_|Z&RD!
zOCFm)k|+~C7`qG|Z{mSvvhe4EEVk10%A<CxHJxIczR9;`cU*~^%F=@{$lE`%F_n6S
z-wrNPoPB5&S80m#&@|U@YL#VDBnlPP3E{pU82P}t%fvVUiu+VQ(5Bns8&U*Ux89X#
z(FgS?9I6!gG#@EJb(gB7bhxML-zJy8cHEwjWgWnYhdsS<zRBQWpgBOB8q*zhv=aD@
zIo#E{VD)9QOcHj}M`!XQwzJBk7s=?);s$&FP`m6Jqt8NQlK8Ihrjn4$*`O1nwuryX
z?(LVymmru@WxT$%AhfIgGJIY#)!DJBx1Wk>TU~$1=&wCN{iZ(Uu!{>&pFMtSxc6Lw
zyrn~ZjC}|)HRPNzMm%ccuDo%0>aJVK<%uROrz>vg`JUSusKO?Q+By2%Qn~X36&se+
zAeE-Fl33p2;uj5{q>RaLoV{kpvW>R3(B64ab`4Qj5zr8n{<$_PvSx=0E+Kp$-XD9D
zWn8Yb3#+fp+mPHwyLfa9D3KG~#a9_$c0c(Zh}kCT_^PxrDILwr;aTD)@iyJGTu9$x
zn2%6n_fUAc-63lntx_DPhOfpqGU=6GlYF=&sJ6r{cYJH*Ibdmdz!Y?5_Z6E83BV!U
zEsVw`(c>BGZa$?yOjt(M&rcS9X!n7bfR1_nVonWhVps0?5tt7l?y)Op8Eb_p3bw0e
zt&2L3w=)y{3Lz>knM-XBNv23#s?6d9`w;|s9QIwQ<Q<PF%$K7EvP<A-6}Dqtxbs8W
z2m{_Nz_b%C*XK==56VLzbxR|s=<boPrJJt#-tAIT%AO+`zHQzp_vYEiXx`xH=c!E*
z&s7#-QhHXPqr&UhzQt}<=8{d<#|FVkp(&O}+?CRqC_S(&0xRSD?*0Dv+x$s~W8s)z
ziJ#kQXfBs_o(*bIp2FRaeOIa%0}$^eU7SbY5~5wJqTPRZsN5q4j3wOrt%t4SbHiXI
z5beG}#IOOlV5|w|=jw6yB|vCh)zr`E17ZrPh8ptxwbKj_f1^2G#z=ruHrU6qyLIb#
zSJi75Zx}T)`16O$2d@3Jk}ld?B%Z~D87=tojspz+d<C!ghoN`vkoSvbl>@yCL(<D{
zkRJ)BYg~h$>4q_*V^I;Bnvnk9K-_1y7Mq%1#m8Kla3cyAs2j#Wk=WhH+o7E*fBI;~
z*mE)Y@hxf4=Jkeg|LEs@AKz8IpEr!W2HxCIc*M=1G}@eXCr3qaNG)xaEHT$qqkbAL
z=P|d#eF>D}IxU@*kx_|~ldu?-E25jxGV#w+v9P0Ef`wJ*KRPg;;m0(yzJEqb@QqF&
zc!UOUE3GDjUA_c}%?0IYy2Jai94Xu-Jla~bMPEVVIv`OC3oI)%yB>K-S#HB~zPLdT
z@*tV+R5X4rwETZv$bTGzoB!-8Qeo>xTE;IWHZQone$ByAI(<86=PPel4#T)1!*1KQ
zEaC$w%~1l;$RnB=;?lxCdirit_UbMnq+d<3B<KL*Y~$YK-FvCO^_8zlGqF<ro!wKE
zKK{O9q$U_FoYEUcHb!mB6{QuX=J1FrMKPWvG+U|B`3^Cj1aKXPocC|vU3o)lH{+nW
zj{WJWUwCJ(<=@Vn*1IJb?rz^#_&d-(2WMAB_Z#bB+q#Bvu(FuC<nZhY!M)6__&oPX
zMf7t~iY^mq*Vs9v#mmW4)<Z#47Ti=PC$Rz{Xo@JMf3CtK*5xwupfilg%=IsSj`#R1
zB=a(ZE<tCvOE*oEcZ@WJQs^xU?5>f~pY^XTP1BH(K0iDzykr6(jmK}VWzU|f;1h)=
z&<;k$0waQ9R#&2SV(yZ9`tA6oMYZaEcVQ(u*C%#jY;~gxNE&Kv?THbeP8|XTw!h@m
z1>F1lM``7oZSaCOuHcg*jIZ<{Vl6F)ihl^=b8lyD_D-fOe}QDNcvH&sljv3GyK4%|
zvhC{OZ6HQhVV(`e<{H_>`M~-&?gx2%4+|Q<K>BhtxMm;rw9=;r!5YGEpqDY2Z}cug
zyD-*(zbcSIyRc%}P`TwRj6hEh&u)=IFYs{{ak&t!AubN3%%U^ABX#JO9FGJ8P+P%}
z1!eKc{HK>o%A;3qAzOkK88FM2S<e@R8K8EB5iB6DHwDsU13Ec2DtfB&=NS1GVlVBE
z>=fkoipE&=0zd|RviYi|?q3X0K+8_|<@Z!GbL)GBm#0j1Ku2h6kyLKsEU-#A?~g}o
zw0zB-RVCV3a<61}r=Dr$m;xsPRQfj4R|gx{{U7!4UWlTo08E+E%<Zn@T3CXDGy<zu
zyJ4Wk*2@i0v4rkz2z3@Xm+bEzPe$RNV=H2uD;(>nWUPtn@l;G`%GfDr9j&l&=HOf=
zXjhJbV&uJK9HF1Sa=C0X^`%bQI-cZ}eiLA+cR3jXQU*%gRxIo!E8N}0usQK!={!m+
zNl+KsGkCvErf0Cka_~5V+&%`{Cj9B8>=5F#Z4Er;A8{U|E!`jOBrVTcbvOlc$Si+g
zM<C1$g=Y|nI)Y&1p}p>Zoaid%FaP{}l3s$q-Y4e*R%7tWXb*i_w|cGlY9ax7Xou-b
zA3=P#E0jX;avsTLlw>IBTFd#g54~A8Lf7iND1OnTIWSl6foM1$__+0aazB<7<8cIA
zfPdJY%oM)OX)wQml29zTB|IiT=x0MZ+aCTGVD#-dHdc{GKNRUnxxR9%=moUlNEn6*
zL&*Q#6Dkr}+3zMF0iQR_7IHukDf(+#{umnRs(oCkV$S9Kd~Nbhn*pDdN?F}9vr6l?
z4cadOgtJae?%SrA&Mnm1OpK(h*Di}Uc>zL5T*y^?@{OJ9zb#`ofA)`+NiULhkx@l$
zDeAqCm5t6FKY^4JBS`W`N>2GTKm=?@3^a3e=j*|NWS6CKAbd*74$pv<^^t=AF9n&E
z<Z{;%AR`q>dX<oFaoQ?^USN6pa?LGJSnXPnBu1fZyYr7~p}8<4MUwu6Z&UK?Zmvwp
z3p0e^319q_!~2gtlE*Ns+P;$~d?C{IYzQac>PL?>T!KQ$R2HfP#}N#s4i$P-drf+G
zs94q_pzwjtU?`}Fl6B!l@9L+iLR(U!C}6?<79d9Ui}kV3J#3N_BBOs+L)keI@129M
zP)r(IGX1s3X1Aks36k17cSkAyPjv#}T740~U`|>|eRYGLdo*7|$6Zv~Zye|or=lYH
z<0ObU)%uENwm?s}T8SdBsIH!%XklF9Tlhf{Fy*$v#ea*|uTW%OA*AFbLiTv$lj&2R
z%p~gjwmYm$aC(JT8`9zyl6(&c{+K!U2vOh|viinTK-*G&clzKRa1asEX{<e@`F@)D
zoXDNz9w|{}TzvF%;$jiBe)sOUL)=N}SE49?4|U`^Li!;2`T~rBW6Rfp={?fLcKEj$
zGdcRbWrqp_O8!xe8MroGLKYxDk?#c^1v)R49q9bZd~A!&D_oUGkAGh9M+(_8a6ouL
zILXAw%$@xv;1YH)H2<E<Ajw55eu^pAxn!euigL5gE3}<Z8YQ=^IAg57hsyCxRn({h
zkzooeePydjdeOofx|p~!4MunTn<PkAwl9;ncZbo2p-tZr1TqifvFjEL0i9B99|zor
z@+@d%p73?F&YFn^K#yIMEFTEr8Ndl?&iO={k|T=0Cwy#oUc+6un4|eH+)vCkKyfX1
z!3pC$yyLe3>H+T--gbU%pOrv8E{lTVa5n)QN=T-`xrlQVY(i=j=E2{_FQx`gKQG^J
zoj-K~OTknf3{BW3ThQG}%Yxy3c6->n2i7)hoW0H|Ssz>VyZwi1qwa-Q$M}LhC!(AA
zU51ALD&_jzCU<8#NL4|oU)Up89>^87=?f#@nXDPQ7QND2&+{C<)MgrbM8GUoJ%^B?
z#@kXwlIonIREz{?xI6S9IzmWe$@3+zk-NeUy4XM6i}UvhSUm0lR!c%f>TRY^dz4ve
zDg~Wm(>&G(2xAhYT5cC*)`Rs`#$s<DC8(-+oA&(h!4{mpF|tl{m#7!jJSWGm0T&q1
zG?C=M^l(ka8mAx2Gkf)(QE#f08`QyctE$iMy}u<G_j>j%zGIZ@?mz#}?kf@1%@a<<
zV5hPAYIhS9J9YlbWeu4v2p0#@U_~L|grVgMLUHNj)_Y`7?>GO5o+8(BD_1CV5%Icc
zZi{zLQFF^^p<DFB@V2>&j6*XgSx}<H^YC>BK>XXkvNcw3?++x-6TJ%UIS=LD6~&JT
zuQf$$C@+SD+;xktfOKM`qxAO{%OE+Z40S(}`kvvRXbqE$;ionE%9?wURKHK()9Zvj
zx6;y#8msO7#aTNk5i;d9&w&gikRt`(wCl1e)Pas^e3#H#dFKbD6g8C)`tI7%l3+4q
z$75}1?`dej&Q?Z_+y3n>Bgm4(?&S$aC60};Y~{CQ$O9+B=8csueg_|fG0Mx1^}bo{
zTZOmvy=^#&S@gRjlpbuhTZ5!sF~_<BI1z;;FMb9_b@Na8frmI%O_{e)Ohcmh^H*zz
z2`%368UYT2ZPSJVRMZ&`A5kyCo#8R<B`ZerVLPNy(K4$=H6~8(Fq^Z~ig_<(0JEDi
zT(x<%|5z4ZRo~Wq+HbX`#NE5RR#eU3d2Du0kpb>#nfpoNuLImUpwMj*Q?RCF<zCNz
z43kgaG+H~0bZPZ*g^soa5tAie^zajm3Nul(FL&X~6Sh#_*)uiXAF@!X^Wjx2$B#KM
z#ko47>reG37$txCp0quaHRvYJk8lN-{FgT8vjn>@zKbr(L3&`D8nc=X-|mCE<tuyz
zsYcGHz6W18h=dC`!98jxl^t<O`f78~(g@3{IR}@mZiL}+i$gDDY=;}Xl*Z(j)Gvb|
zkR#^#CpEU66n;>FaN)lq#kmFv^kse^PyOL7pA6d3oC+u;2S3s0hC;e~1v!V`Yk%ph
zIe@}^-_KtzXoGkq_h?odZUFP6#d^Zw$zD)wubtD9biRKa(lcl@d-2nL$!?l7uCF)q
zWXf-#%;Rxgn~&{i>cz6JuIGDimF4rmwfGId8CbBL$w9M7)d;ZhL3j5JMsoRFa?*0&
ztzkbQd~j7>yveIQ$89Mo5s6`|GbSd4QAo326G<o=)47$8tCGR^yPPcgJA|Lc?!BYH
zD2A5)+|LP=kse(m=sxuI`VoxY0NmT{n~m#ibFgDA0h5s)U56&VtE~L9H-RzNGKw&~
zAF6QGCZ~1HXiaNK5g<ZfRHzR$!T8w9(bm#a^gQ2f+oLxg7r@to9$Z;l5P9?K3{AFz
z`k_OBb0bZIZs$B3v$gHdRJHe}uKuLj^d$R~eqG>vloLb?{Rye*mE6AS1X_1hmCN>D
zyIDE8Ba|FXg8Am0UUYi*+1KE<I{?B$PxCFiCNI^@^)65-^lSJG*S3s<%P9(VP-E%S
zABI2EV|%18te?HGr$lV}iv?5nR?1JmK8F+6Fq9z*TD^ERKx`ml>?3jjMZa>5A}98f
z`Pg-u*>SsF8>5axPci1_)m@nk7zRxjP7I;yNt+vG-j)yrGsW&r)s3n7MEP3~o7SUm
zR9<}JlyALJoo&*AGt#xEE$od~)8n`!@VJ)2RCu}cRgiJ@4Ni<k6rsP5aMItb<HA3d
zE0<=qz>!^YAti~2bFSGx%xWgoWTMiw^!eqKZ_T5(q9N38cQG9bV6oumsbyWwImdNC
z65-B;rvQrS(z$Jbx<<ZN_hxydfqv>)F?*RUMNZb!JM+|L%QT4$PO`6S|E2;d?PyZT
z>t#i^j5tZOyd$aGrJF$#cfLdhL%CrRN&U4D1MkwN1kU2W1Ae09%-%a*=My0$bkHfM
z@-0a>vFXhV&=C*`OuEc|Iy^2tcXaxPBkncz#;}y7qrjFL%NSyf0#6Po!`0aAjybP&
zG&t8pTblD(b7gpLp5*&KkO3zZ{iyEV4}oD{^i-1T$3(iD=g~EtyRX?QyOP$aq@T84
zvFsfF?c&w;0&Uc;rfmuL!qUe}-#LFLY4brsh*y9Y1un~e#Cj$GMU=`2yp(ux__v1L
zt`TuZ;V16bk8wX`ZIHW`_d;dp-lW7Ybj{->;JgdFztG{pm&X^kNbnGwZXT@$^ktuc
zC%=QnKYW!(W?j!nbPMCE`Gs3&<4i|XX6h_zWZKx{fZ3<E<YN^aF1aYrISid9*RqXj
z#@CsyMslzIkzKRomm>E!kFJP!kJ@0d&fJU`cBvY%-6V(pQ^^cpGMVtU4fK)2z~e^c
zvq?gaibJOI$HrwY@vs{~P-+fFK63cPWhk$hL<q8J>3am8ms=c|_*(fc&~?)2mhAoU
zQDGLHktQ~e^p~WU)d%R<DUDTORK-P6=cSj}xWh}gWet;xuQ}-g!#lXN{q*;x>|?WI
zBixEI@Qd!+R!se%TM9LMA`&u9;3(UvHxd{NO{vEI`&(mhg|J|M$9_dNX}~CUgjS2(
z5Xa9@+=oZA=BnSW<cApw<UwIN!v=|BzxgMZoFqyzqn0zm-JWSjt1t8?-T+P^j~-B!
z%Bco^R)qUCEtafalrGNyxy=D3f@o_P^ZW_t%ImjjHEV5u>d(wQXfeOjk}Os)AZE-*
zsSH+FAN9SATN-tkxD5aF1S-C6fZt;^#Hh=@8tJ$m7lvg@O|r&#lzjfE<I_HHi8o4Y
zd8wgZ)Z@da+W3;*2Rx|A;f)O8Yj6wf#|@mteAJiF2{`cyk7zDgRn0&$C-k+Ja$o;2
zCN~LJeVtMm_~22zh7*aY4Z8JXuqE2R#~xQLzuwOm1%DgR&nA{f__4Q6MN6y8W;@F?
zm(YJ`P2R9GM#EcL3b#%uJQB*s*oq^JO2eYITgQjq(UWtiVbk`A#!63%IdqA@rZ9`;
zIg>}J7zwYnu@1GN{xJ=k1;J&(&s??*lpF!Rzsld<*Le)TNc~*+DIWY6Lj<`!YnTjo
z8Zz<DVPpG7U3?!Vdnfe?Vqa|k_<?LC#~$sVGj8`g14PJu*Amm*sg{J|8;I``aMUI0
zSeQTcyRX8%)#|rq2H@52h5|uiU@hnH6}acQ^|yEmo)vb8Bd%Vt3ktAWyx@RQ)i-+t
zG_^w~l8Pe^qucN`U#<Q!4L_Z*W;!^DQ9lX?{0M5H4=vl5^o~Pc2(2s3Q2SPEJoe{T
z`>}ab^Ev+X$59hCi<VF^@>!V@#clNGG2D&<3w68Wb>Bla$Uv{f$#)#)n}PZ{MhxNj
z(Xz+@^?QlF1j;Fy^lgiM%4)rC^#Vev<r+~BN}9byKDg!{Z8lH%i5jkBdwlegq~j$Q
zryzF}Jns8tBOE^Nke*yoGeWaji)7C&0iuis)c<<XpKUH7YmU@*XEr9aOb(3}adXW~
z>afA+ZvJ5?kMnDFsp0li>yvS_Etq4y&T0|jwCUk^6SpWB9SR{e&EBTC7%(PJtM&lj
z7z@r`D4<rjn1qVF(H(qrW~GyWkplu;z?|tTkYwN95}phwc@?afrD_~XuPyVXWkPN#
z%S<!62y$?LsD;0WW|T^UDyV*5>#}Mj&dL7wpZI#}ohhpom14^{PnK}sh21w5-pa2?
z;A-AIg*bFgh&07Fyt-#XNx$SS=rjVRUd2YJYVUU{LM>eq#S<)}Na*^O%1ATB)p+6J
z&8rzYL(6+%)vQ0|D*ItunNznX{5J5j<aEd@n$57^B~5K3y=eYdxG}*npK~hnE4*!Q
zO+0?gRVCi0)^Bg%n0T{L&5C81Y03V3B4x9*O>C;S*^t~s<M`sA5Ab%!yG035&8T2$
zi_oO|y2%$^6~oiWq)qu=ixOh9p?gNJl2`S4to$9nbIdBr>GIpI%f8qB&N1?qHs1d&
z>eV#p@)`(XL`g+=fU-OVdZ8fdRRdO>2z$H=P{BR>kMm83b<+$4I#8?G#y84l|Es13
zUc8qP#wQ%3U<f2?<X&H&5qe=#bub22C~-O)FWS3bwV8r(J4@X7;onZJ*%WlUj;|SF
zO{_gyyxMg{t=lk=oDK8%yi|@uVjnq7gd7;zhTlCPgeyAU;QriC?g$SObVAePs5$=a
z<KEJKU+c2ui6z95Z;=Yl?^`Wk`TS3$c*Kn7+6P0t=v@$TQH6CKhx}t?l{_(@V&OVp
zc}X@u$GgNSKjVa;IW-at7=4o?rJ(}jm5ESa$z*jOYm4Z5dBF5mKkeqlC^3BhaRU3%
zm@0JS8mY5Gpx(X5S7pWQ^rPHk{Ij`4eCpQ#zn8B5fUC}Gr7yKR6;9T!QxY<17<Jv8
z8D(&edO#WGL2wTL<dP1&{dGglZ)`==cv^1yj21fe9Zb=9rQXRrQ&4%$r?dzPpngN2
z-aMaa@TW@P-z;EcohK`-bnhJ7ofbaxGj^DYVo@7GA(2X37s%e1R$1-wyQX6a8y{^a
zn-+_YE@{?Y;au>$585jvTOl92RND^x+{zt(hQ%kMB0E{Wm}2n_uZAS6q2V0+F-Bnl
zjlvHVL*eb_g)?h9pvg*ZAdy0w84`AZY*L?N^27<9zp&GkEuU5DRZ7T4WPP!AVb<{L
z*Ab^mo}1j#3HWNOE3m(S+BM&ia4SlKh7kT>QnOBYsArp6`T4}^vL?-FvSK<ti`RSZ
zMkQouBUZF;<4QEnVzj@A0rGk2#*P{@e5O)3aX43jW^{=7y_bkyL1H~0dmlucOf3^a
zGS(g)@zq>4U@Q3pZ(p6=%7D`J*><+*v33mkF8w*8OPWK8x5TF$X&aSe$IRf5SQ+jy
z?ODX?R2!^zD#cWnrS;~;+H1*Q0XA5Dv<57#BdGR_b5tM<=51+e4088bZqr3lPq~%^
zsPT616TBB82KXiho_v%h)FESwM`Wn!40K#>F!*u9%+&1-XZ2L>k3GlSZxa&vHq|`T
zOj}bU8Vrk~JExWo`4eL0?Lhrq=->7%qwuV0@3Mmz`p4!$6j-339_vSLQRnVB#q^3@
z?>A&~hmyC^1qGUAQLZ>H3GNO8PGz4_cf*>G6$r+!NFCMN4{H9qBNBR-cHb#>T{;j{
zPz>S_L$djT=0%nWEIu)oC;P)u_yuEupIe2j^ao>SE(~7L<lahA^}h>+oppSgEzq6S
zndqMR#`Q54>=F6(lNI_E;8!i}XTt?@&PEs(Kog+j*Vv@b5-mvM;6AGt+vxBLz5Y;n
z_&MLZ_-?8<bm82q1Jb~Vf(SLZZfTNxmQAzBNRVS!?%evb-=-Nw`>pEp|LSN@08@h7
zUF8gW3Uu|#tzLHCnqS5@Mar{*7H;dG-Xmz1_pQw_*Q7a=$wf2RK{083-65vCrcW)d
z*U}2pmpvEPAx9D{6Q_ecq=hfy(Nl}qgr_3FJUD^JA&~GP*6C%*x6wBsuaM&%>2fcQ
z@xHwdMXTzxVI{h;E(m{0I;o32FBGKmjZW%-3*kR=11VvpOO%3%t*hnyecgHv1$;rW
ziwh)b?o|Bd*fdvMlb>KsGj;MudvGAZ!!?s$`L+8(N{iAL{?hewg59}OqrLCK_Bo&E
zApi<z`TPJIy98U*FX6?7q>N}T?>(df>uc_)p~Xb^!+IU%N!sB1o)px#=$bhRAIe}s
zfhQ2DmOp*8yp(MjNbm`z|D>U_^9H#ykq%4nF1<VCcfoST({fuua^IPMw2c|NozO~x
zZ)VeejH(|JW_=w#x^ueV1`TN+Jzi)q0lT64pZCrKP^&#P?{SW?OD5(F^jxn;;OR!U
zi6V&g+LlU}V>IQEgcEn5qZ8i8v>YzOl~;&X7``&+!u{lEznF;TQAiXv&d%>e*;d2>
z3}(-^KUk6-d$QT^*381II<?sh(r07>J%AA@O|DM-9cm%z`_?TfeNVFzO|`Kch4<B@
zb8YCH#5uQxH;d=nj~?#(*6oC@)3pye1@4HPjAcni<4hr`9co4=O5$uhx`so7Vn^tZ
zCE=JK^?zbX&G`&3B6U($zJpO#Ns4Lj!bWclT24Z(!)&&-=BuNSmyXdf-hMA`2yjxa
zi@UhBI=pdI_`Wy43F{39JzEeFcW6`yR7n5Dh^WO27Mit{uP;lqdZLewSGZ<EI8Kc6
zY|*s!Wdi<{P?*c&p(iTlq%XWw>d8N-%XIwLYuA9b3hqC{u@dlhAkTk69egH5ka4&P
z-X#}%ozpdB9?q(~gtT@C9d8sMhMJ_B<iV$G1Q8Cn{cdst9b~6FtO?6eFSAhu+f7DV
zYWXe7H5c;(Flx|lfSi9jTVzw8!cW(9_Vugv75xf|lwI_GY?UfXTBG-3Pnjy7)Z~9o
z#d>98CRnI&_htbHS;VI>dx=?5Pg5oMTHI7y&Ta2%V9J$n(9I)NvUs56)5tKPhC&Bo
zl!SJ`yNW}_e}_ebH%PmdL&dl{*+r(vfVFL@TmhGP8eYo4PRT%D6{U2Q`(h|G6flBY
z$=4r`2J}v72yOsB*I$1~_PV*N78^iCDO05i+Wkj4WvbTdx{TA6Wd2J)(Sl<=LBqvI
zHUd5VmRyXdDGASyW(}wVwXFPukmwMWvj4FEeQ_0|lB{e#AiI^oiwyYia;aL2n_n`_
zHF?d<sX$XL+56?=FhS;sGtP%z6}__<I}}-Qe_4Rf+~znzs~Uenv|qvIJmiR|r*553
zytFmO{}_0;3KO%)mI*Fy8)p#WGA<AI;C+02T=8&=4$2KHU6nR#(fo?i_rVtta-ePb
z`EiyK(p*83Y^w6x7A7muEco4Xkt4@7eX6P6vTm5aIXW9aNFqo9(E^_;Wu(U~7i>(H
zkh8@_YGC(8uTE8Ha`{Hv=!pn<E=)*mFH6?2CyaiYN41t+KKl6y@AmZrD;(w7bfJD-
z1+BM+6P!oX7_+*HV(;oRUMnpvGjrlG+{0Rewl@ldU!`m$I;I3qT{b<l;vT6LC+CU`
z1#L^(c)o^hl>A%t0DYf}&rx60mg`Pi@yOAvg5jqUo9ABX-8wo=vFU<$msEHc<{BPw
z)#Qcyn4BnGIJ&g^-9mo`r}h)DD~c?g@hag%Sz&3<vg4bv9C4Ri=Rqs(!{`rVRcal4
zn>RF<kZvaKGxo@$*lWw!1Oh&Nv8RJhzN@rx9R09T1Zfa~?lBC_f(7mI*L~dbP-@#d
zjkIIm{cajl`P=yWw#Q@uMK#J#Ek~t)WyElyb8PNsGVg6ry768zuXO9cZ_W>2S`U>r
z8kpd6t(^D&I;chU8p_z^5MYc)`Rb7M@d$&0vF0R_0X}=34ixj;#1PEoph|K@R$gC`
zM$#MvRQ{JJzj@`naZ|(AE)jCAH8J*#LMYFTvlU+JqxE(<_9n3@84eb3WZi*qTIs57
zy@z2PENk)Ql&So!#joytP*Jc%C;cxmjvC#qO4MSzzXY=gCtxv#wAD4q8OtKb{yM4p
zH<dH|5vMeJJ6`I_>DLRYu|=7G7pipro25ij;o32%<mlKB5G|#*;$VKmOO7FqabkW$
zJI!)&F#P@);ZQ;R_|OmO(KE(xAYgUb?)}b6yoO>M@7ASlG$WphRjGh5fD~7km%@i~
zDbp7Hp4W0RLjS(_q5SE#a(|!Rv?<S)_VSR_;os+Q7P;dVele)*PK#DjB=SA^@RCiq
z{)<#w*!Bygd?lZ!%Q4KgK`pkd0)cJbDayg_|1Qc3eh8x`&WU~FFa5z8SvM)VG^cJg
z14O5%U;LX2YK}OcJ3h7YeA|&QVB!?R8UgzFm40f^0Gx;EJ&fK}chX%)D(%2V+n&O|
zvyotvdRhMKS#x`L3gJ3X2&V0oqpJU~8pL-OO%ET__FsGV{1Nylhc6}AOUkQ02GNb8
zB{JE*;roO8BMSS5(87GXjDSbMtkZF1QP`FBHk-Q}t_fT%e6KTvIP3D8y-@CTK@z<w
z8%o9&B$x!GZC>quNd=?Udmnn)qYxAGg^ADxpy>(CAwFyO6{U72DaO9q|D*{b^G*pU
zERjP{vzYsGfzcN|`F4w#{@@%$S7=XFY*O7>R@l4WN38DsfYcE@jzdbZ#ktx>Rcz9`
z=mQeV9@$ChwbLsTi~}qrIW4R7Dq7kJ4^^4}sl+<ycY_U5Qu^2Ji!f4Z<Mu$nIjt8*
z$rn!_X~NgAHQj&)+!81=s5Zu0MyRY}A-DDAG6%rl>C;q$3P(1p?kDvb7275}T~Ml-
z+WDR6xv?W@7(G!PE#`dzS6~yEHz=1E>m@%nf6!FXFsP%V7sQnv=_96O+#KTi&<lzX
zE-yMw!M&cEs_MOpvJt{xIWcOKsM#t3r)#QVFDV}{mtE+-R^6#+ZJ81(pOp=K2Jc?E
z!X(PIL+~q=#ngiM4it^55NGwpv&jSo9d|Uo`vOI%;KTW;Mp{~LPXU0P-dQGp%ol;f
zp`SW&{dz*f1;ccl_Ik+(2m8&E%Sy&{teWC~VOUwp4Y#LVuZ#>-7R^rxH>er-S%Kek
z#E@oHQ;W#g+N;?2Kx;c&Ta3DkBUZg6?;O}#_J*B|EfKE<6gqE=vo2k5(9jH8@{xm8
z&r*k9)bA&Io@ga_{qVT^0!RqHzx%o;hQ=wX^>kKsoNf7>ylR9%M9z+ii1T<NF$;Wg
zo|nlO(!7p1yYe*c39;#%&TqAVi{88IvMv}7#SaOvZ|%Z&Y6WOx5sB&kE>rSe3Cj{e
zlhl%f;q(5lkA^en=Mzwc(=IvMe_Mdug~WLQmos)EUWdfm>;S88Dwf=Ew<uM9r6Y6{
zS1-RibnnXH!6Rg>N**`5RmMwlVg&UZ;}c`m97!`85ph=(rm5$wKf%iI%wCzYZ0VN*
z310R{Cx=Q|%MyZpyE8-|y5@Z9Qk}MQ=?YJ?kl*xo*X%8}NX#C+w*Z}2GxJUorvB;l
z&wzHxN{1aiNHDmk8r`(*K<R5(CjZU6pxvB_(Wmi<LQ9S=Z<xn!?9F`;OIktucYj6u
zj(uf@0eSyQ#=O(nTEV-*dH!qPh80I+0J$QtMYEiaH&Kk6I~5pgv3jLw`Ay*6w24JV
zd5;(ps(cIH`To(7#G#-BF1pOWy>XUCGwe7Fw2I}7-dWpHGc&h&8oB|HAIdl!h(!ap
zf_K)uqcsB3x3wg;Paonh?V<<0zn;!b#PCqg90&@`YHvOnS;cOu0Xm^0q<MtqAsS&c
ziICWaEm27on`I9j&SAhw&)3k~3?yKhw5fJNn#a0q&fi^}SYpELt6sdK?5jT7)FdI+
zqEhNqInvZg<&`edLhj$D^ASxxx_B`5=k=FHuEm%d+0ugOgk5wN!#!5~yGdp_*Dolg
zWUqb}iB8^dUFas-{i8W2Sp_m@!lUan_sU<LmC;nrvwcFHV1_1e(+u*~g^6zEzpM$~
zkk2Sb>(-?{8w}62$H%rqK!9a{W=r55=fLMvW0+9>_0j%7enbYi6t7I=uw8k76S$G}
zuAXKEy;Wl%b-WC7o}*CpsQj9CEoQO~&-ymnC+;p6z-K~JbQ~;ZN*e2q#tn3>E;cLt
z8l|pn8+a5?r?b70vJlD&SRZbDXqp6J{z&+ybvsiNlsF&uX#NtBi@p8~Ejd=md08l2
zdD^CFHWkc^+-@Kf1z8#8tq+DfOS=Bh!4$+-2(L;Mw50qRf~CBo4#&P8j=eeLV^jE?
zKPNie*yI}R6n)kQnqh`({TVpinqv``!|IF{i}2_0d-h&vKX<+Ob$ZMyPx}1h^`G5o
zCKpw#y}m)Q2%;33UuP>kSWfML?&A7b%T&j5Sl2dOaTm&Qgm$b!?)}KPI%AeS-Hu2>
zrKXe=9MPOdPmLN)yQ)9w;c@rWOsJrFUyGh>l&qbd`Tw|Fu_Ak*b?nGpG3D33gik=!
zZR8!ja+YWK*gdhc_|V7v-B}Idgay_TZqGC1#J;$WvEUE?Eq$1E;!}2&X&I0OyF`+{
zMmUWh#he!iF{FCfam@@wYZv}FM60a6DkD|81Y|H1A1z1_)Iy}!P$s+`1Z^tJomk8N
zP`c(JJbGS$ZqG$Ez>&)?v{emv|NKu&zEeY6i<BHE*!#P!<Zgo-dkLoQk@|_$Cjo1v
zrt>h1#9&d-Hn@B0`jNme+UC(mmf<!``mww29P%i_%9*)OsdW}xvBmPhWdUy(u$W!>
z73+oFNQthayLXszqs#r-3mP0THSU*<f4okq#cp|PX$?SWIG5T|&=JgH)Pde1MW5gK
z_@{^X|E?(0f=`El=?ek&<_vzRG)Av|_U_qnN@Axdaol$qwj9&!tGKn0D{0l^zP$8|
zJ@l=6+XJ%tB6_W_`I&@wM+$r?)30^l)J(Z&^MFM6I#2sHR%Y6<G8^RNHyG)!4fYq4
ze%(;^t-rGPf<O49b_bEgTMFW<f`X8{)+~QOjoVBVaiz8gt@*HiLe$IC1<z-HSq;ZR
zYhPQf&<5)EZ6nD_KClSb;``T!biX1&6Yap@s!$W`cW1F(yZ17@aNlf7AaBApFQmE$
z<%pfvz!pyn66ZBk`slr2|E<#<u9N)d+_17~Kt!SVSAT8fT~qIwaXfE`a;__7?chAX
z<%&7|qF4(8rlWtfHaL@j-kC28rZ{-D=g#T7B|mGk@s_na<C(BHxo?5)o02;-c^?-6
zMbG+fNCJV396r{aIJbg)4y8I5z+F5%G%f-vRLsvq7@(TW)ms=J!r$NO;gn*g|5;j`
zY|gCgLceiwb<JoRY>rj)37Jh`?hdzA>+M5xE2kjajtJ}am9QKqTw}-n>=(vS{<;dy
zIhRd-pt?!tJ-jt0Rts)ME)<qoJxfEJU;?z1SOwFcVE4ael|0n6|FI#sIY#;5nSO@q
z$l7YvVn(|@eyS4RKgi^iS8(coKZF-W^U`lZuxym5oHHrns;lryZ(1?99iY2%BQQm3
zpt9cV6p=^$V|bH42b%myR^92kba3h=vWM8@MuB59gOtVf45g;LCyrnJh>yar8zWL@
zOTu;jJ8HkWdcLkAh~V&7N|R1_mNJbV_ATTgjvEKriB_nu%OzW0)b1)@WZM;FQ@h=@
zF|Nw`*166@UO=Hfb>L^jJZaWzEoaTqxCCy2!6$Sa$c9|rK^K^&M3ZH?q>JO0sIN|+
z2`wQPhMW8fhXHcyFF;YQ+9=AUivY&yD%=#CSHjO-1Np4`ZUlx#huvDsylQAwtCU56
z_?sQB`<D+*@;yOL?OcOB#%Bazx;#mz{*R7eU42|yD4vaZNxXBjkLkY0msrz!lgv}+
zVR6@!pQhXJi05!zKYtmS8Rj0@eK?aABZU_Ap)l_r-|%Udk@nUhvuM^7ce@F)4(^%V
z00g}10hY<Z{4O~-B@HQ{ZORo$%l8w5tv<&%X(ErCp;j^fvaG%<t~hkTg^qK3^Di(J
zeXN5?j{hDs0qdwm2-Ty9s^mQ{CI9gFF(RN$d~5hW<13Z`{yQq#WYOLtA;+)Ku5j!*
zrsAQiOqO2ONmSC?PkUihS$jJV;Qv9_Z}v9u={5D!$c2w1?o1k2PId@9i9fg!O|$ce
z*)*r-<P)#U;&DunA@-KmfgJ@i^HDkR*jG+I?j=U4Wo+kw>DU6)S<WzFC9byW=XI#|
zM{JwyuP$yz3XHNYo6fC_t~OXI$0Gae4|ca<x}1!zia!w5hmyoW>Z0Mmiv4}&-Eyut
z5BZ1qm1(^Mt5FKtv#d{6q}1SYooGiESLajI+OB$D6lgVc!e`s;D<aL%N%f1oQcr22
zRUvuYGT&9ki~Tm7FCn^4YY5Q?Yn1n4OaXCuF&a(5io`km?9WQuF8Z)@!sdHRTB|-r
zb&P)Paz@uhlf>wNR!1U*ZRt!Ev@7MN=qu+E@|re~CA@j1>CEP<C*DI;=xeJu`}1y$
zCx_C@V0=QwYjtpwJBAB@ihSicNs&(XT}ul^B(2)z+%IyCJ8q|mcj1(J6E=sQt>j5F
zAf{ihr5z@?C!LB!DMu7zJsN8qbo{}|kZJ`dv-JJh0eXZuu0FIiC1_IM7KLjgRg|&|
zGazOSSHM9E6tB<%EAYgmGMIa3Z%esT8^b+y&vlruZ2MM`PkUxm80!mB9M66}XB*AP
zei6$$VP#_*4j)jC8<reZvF6{@;-F~Xs(n@4B|Wax%*`u(W1qmGD1BD_%}uCyoXdJ^
z+K<Ca6P+9PLyS3G+dCCM^^gYW5K(F6_f9tw;|E`)7Q_`+SzFV#A`X2`#z8xR@l#T(
z*x;W6`z(`7D;=ZNBLEQ|h=X0*(L9YTEDw_Py)(dUKi%<Z?o35!!r|D{$2XBX3&me4
zPj$H9*U2&a5Sq-3)ysQ5-ar`J7WeUrHmKZi9=4+cZP@#OA)$u->Z71_P{g5S#5l5{
z$a|4-($KMVyOaA%t1!?EOVL}o(b7~{^^Jd<4mMuof#A9P$Q!1s6<H#YjpfkV`k8Nc
zdEqc+Cu<6&bV#_yD6tP^5fwhhnC$o>Q=aFn5o#MV`Cb1~jSA!nnd=3+#8Y8hw>K`t
zjruy2ex=aET^8=;mx+WncY5;4x*XK3<cF9!Y9A<}o8Jw`=DN0By?{_I-qr*g8_qHR
z!Ya>{9Mwcw?P0tzqK<`GZqNGmvp&=oR19wEZ=<7q#^>)Ta%`ndiOo7_nJUi|w-eHg
z)b|r694P_hXDZqM4^jPsJ_e@X(yyShRgyOK4cSlbcQOq!GM@T+B?wI{T{mnR7?<Zb
zqW_P&A6a<Yznv5kW%`onje=%W9pEIV93sFs9C^FE5O-)Y6nkiMDU}*>AuJ6DCY9G=
z@vH0{8?b=3*!beUrAJfw$pEVgS3W=|cNS{Qwvz9`a$h-566DsNSb1wP@WGooh<sbD
zEKx1oIYSM9+^1fD-tF>bXcs^C@C=d-x~Ke+rIFx4iP%gk`#Nm9fzEn8-TL`L9YdXo
zzT!rr#L*R}*{RCFYFUiO0XCIe_K4o?WKzu;$WVk+s~IV0sBcZS|1+qi4(FcXIN}|&
zydJ1yoZ>r05IMoj!$(tMqUM41s(IwAeO7RytGjjn6${=j+Vue?@ueSX5XZkhl2F?H
zqAU1NU?TuzG%cp%e`~!1>Q*vZ3lZNcat=SS-#Q=IA_Lik<yDm~ecAn<CoSaaG|+oh
zJ(cT@?Ku^*D*+`3*rhf90pk8L?MBrgiEy$X8fJ0Gx1!qKBE3(;e+}ol+D0v4I3Dbt
zHjee^jZY`%1<%UIPb}>WZ$J+H<Z5&WeZQVwa&TeYZ0OEmdt59pzw`0o6xwNe>IJLe
ziM^>&5!tEorAfD7jD(sKk3d}3`yW;BI|wtQeuvv0l$t`SXhX+?Js5MO;h<dOsl&U-
zqc&dHF9uvlo>~40a01F4&nW%5)sF?!6Is0$>MnSKM)uFQE_OS%6;E?%J9|GAC-d4j
zIWO+sA{IVL&HA@9BA+lZVz<?lj^kRmshCXTH#$8!ztka{oijFgJ~OtY&%}S69L9hB
zW_r|}YXQL9PAXDd>#ah9nYnt{iz|L9h6@fT708~?2biiF$}lq7PGtaF;Y`TbMQP#L
z8k=uH5kV}Eor<a@+)AyLi)=Xd5=bJ-=~*Y{Vq=&$c~2(y|I!SKf%ayA4u&JL3`7#-
zET{cZ)3KnEpbGo@FT|zv5D7|KR}PIJhE?%;D|vI4iRo;p{a3kx(`5$9Wnjl>{)b5I
z$CkQ=mK|`Dz5Alqc7D(??nkqXOqB@znVJ*Cf0^d2!2l@Tckky_ne_7I97jt+`_z<&
zR-!9Eywer-Ra@P3C0Am4Qqat6tXeGiP1h>Bv3Lokr{RSX>M1hY=+v86rsSHh$3sX<
z5oU%|N!dqEmp9x@kUvmsUv_vo+iYmC<r((&z)JxB5b2dZw<#QFC|_wHFcYzNYpwg|
z%?nR&`rOU>4NM1mbXGl@?$9SP)~R;iGF~xs*&|f^MPmB`ddnoNMCTF}uhb?J^llu@
z!I|C#w1ZKt)x{)H+NIG&SYmuu#cQo@4aP;-iZ#*7nHKzmODCAWG{a+{|MPz$y=OSg
zXHJaBbT=$T=lRj-GXNxVDC61toc7_r5R%>l(o~`Rwl|NPU*t+P>g@!4pneHLo{PE+
zCkA=uYkV3`#ZGO^eFOz_>^;&r^fxoilXlwgU$<kjrgB`^P5kB4Zq8TN#dF$rgV7xk
z+k4eiPB%j+tm1aVpATkF`zcimuBu3mWP^((^NmHIa981cR!LcFIWU$&(}*nl8@p!{
zp9?_(U{AwENDQ~QT)^-);D!ZaiCj0;0U^ky=B2+E{!IWLwaI&ybM^Z_p*#Pz<o&W8
zvU;PZjFo9^ecT&#j)MYMOJDZjr*gz8MZh>2F>#L>h@p<4gE2z`o)A{eIh?&}be;}o
zf6uJCitRYm%lNrL@z|12{giRA_lj$_IJ206+r3Hx>{z+T6qKbb+!<iSrl4Y#i#;9u
ziK6c+!`}9tyaO^;Tn!VR%{F-UO_+pQEAwdmi)=$Oz_qjvRhkHCw`q_ivwB_xrtR**
za@CKvI}%GIos<?AtueNtrH?w-{a`<(R?pdyb_s9QycNb@fC#KM^?x%9+%hmkwrk*R
zbPGZTeFfglALnsV?gq**?@gMUgULaZdw=BRI=x#Y15%L34}*PpiLkctFX!RAl!Rj|
z&9#?;6jJO#n!KoG?&dDj&&76(%Ggg$*Ih|9ZiAzmjI*zBlYRBIR{xXCU->tSx^`{>
zfUP;s+7k0kt+s$cbWVj^NOfB#if^Gte5HHS3Ni?{3f=iWc8z1lsAuuA5|MXy==_o3
zE}D+N8%rf|Z4OI!MScDyzcB@9lF!xG?xN?zT6lOaMOVE^`yL=x@@EG!eX|vBBhHCw
zb0E0$xy*=wJ^jw~6w1`2?E`nd0wHVtnhfBa#JJ}rQkxRV&QBbhteAn0Cpy`YB@W-N
zpC+h-CYRn&uTj3CZh$d(p}d5AO-L~JZ#ll_u?*UuYAv@>Iku`2V{Vmvz*}jjs*ciQ
zQBS1ucd|(W?Z?n6-Qk`=+Xm`HA0gAwPk;^U?HEhRJ?=CpnWsMRrVDhp+4@d*m`3@|
zaKzF|uta+F>U|G|XI&V9Vbqa60hEKaE7}l&0o=VXi!0|dJ(n*<eCq@tHmu2}!bXhy
z=bUbKSYIEp=?!waUYGAno11<e<-g_twQWUa+CXy~SmlVytX#fB!BRE3z6=yXlawl5
zeaX-8oaCx+RqJXb!o#Ab`j?oh->AYqnkuUlsiCDW>k0{`9>-fc5EEPMI>(lg8tf~!
zD4A%LgTc4_)G{&SIHi<&?f19VtWd6^AGOw{n02%|u)+MImE%6Ry207FIgrg8;r{J(
zj5W~xN-boSg&gtr9y&i~&$L!ad<a=OQ}+t)_<7^<;=-*ZNi9&K;ifRFt_gBmNnJL4
zDP`L;%F$NZr^-Y;P8@R9`NtlW>CFhrwD^})j}XU70<$!wrd<*{^>1APkTsv7<{6#?
zP&6$M_rLGPg7?o!+^fi7w>>EvXe5VuzXx)mVVY&pcNsKi2=kFJJSEW|NxHh6V(@_E
z0iGaKoQWI_a=Jl&kqD`2lV1ObJ>7`6Yj1KOfGFH@P~)kht2<~>gtB$(?P#&@IpW|N
zWws9-r%O+=e$a$k(UcSveYhQ(o{%{0CsuzozRC}V?9)$?j(H8{aCq^R8*-VWT;-h7
zYFT*jiSIk>w#)EbT)oo;FwwACbMvfdiH;zSn@#D1MrJs>CqBHYFO(^jA$ZaJw{lEa
ztSA2F@%BCOI9}v=;v$avhz-H(8$E^lL9Y;glwjYRr67J3JC{lqokNOX+=H{qE}a0`
z>FJw*EoS#sPWqRrQ_GvV%B&#`pBW*`+^=|qD?+7No!2NODUCrWv3Dr@Na4Ak{M(WS
z<Jw(KO+N9Iy-N5Oz|az1)_j{46W^Fezk@C$uqu0%$vbDn#~m0uW1Z>_2m0c}TM2(J
z9<1doa3?FzE@Ib^lEjbl-J<!GgH5ykDkRw-ga}-U8-^2Z@AY=UXpZkuuetkz67}9`
z)OV=2WN|`e5bTdaI+Oi*IcE)l7~k@8(0r^-YjC=S{?uUJ?^8#$9ie%sW@-UD&UbIh
z5JKm8&_#qee}%oGD^EAJ!Yq<$hH5>gyommBE`azcc?BFu7fx=GUS7L{-PD1lP?l4I
zfyQ^gut4MSZ6^#b3x|9lUwVW-!@DHTz2bZ#YBaRuzO<5WzOq*(3LsF0ELNgWK48hn
zB-P)cAZ0C@&>y10gcB1WyxAF8^E-awlno5y013c(tQ*I>ty6(o&F_x%y`ZB&jkAt@
z6}4-Ich@QTgc_Xv54SBANl<MVELMMpBANhi2#85Bm{LC={5=j{nmVOE1P#Hg(!4sy
zUf_Rdr59V9%rSzKaJok+GbMD2qS12lDOUMAx*)*cm{<zU4FrGttrBYal#^qx{H<cZ
zA$OPp+c69^>);^iXX3s)^&eqYa%1%90dn1r#Qij6^ogFSg$1T!a@Y9e&(4${Xu`E+
zYQ4UrUH;+{@B&?a;neO6C*z6%A&;DzyMUq}>)MyL93w6?S#{%M{tO#DlkC&p_q((2
zqR4uIdSQPq?b^_}3C*8Y!=rkvMqg`tHKaU0nW30LgS!#*N<iklylR84b?l@K-K~mY
zm1FS79%_zN-xUQeKQ~Q{<dGf*DiNO=xS0Q@YQ%;vDK}wALgQ|X)C|<POHN2ehZf~(
zR$KcGd?LqbdG2(q5>gEb2EfPEsP$I{Dm4r)E{kZGHz%7MsFl|1i4#f}AhY1!X&pM;
zJmp^4HHqH{(>;~Ta@oGYL8Er)5~Z0p;N5?!Sp7mDp>hP27FR1Z=yoxT6m|ssug}0<
zn7JfsZ*OTS$SH@PI3!L^H8Wa;A9f4pKTr1fPBPp(<2f}=`18UnU!V*!geH0LKZ-5S
z;%V4^YgWR9N~D!LBYkkf)89slzi9u4nT4~aWk~le_;UB{yDp+hVHJ*rtBuxP*UefK
zEPCtNpk$>BUczRZj=3t%(wG$QH9-suF^V@X-PYCd$NFVTz2O;HvRTe7Ylg-9u9se7
z3dcsv9?I7{<HiMS>^`jk6y`qBv-GOKMoEPh%Zb-ct^O4J_Of79Dyzzk3<|D~5TxIh
z!swq#h8+5E;DbG*71f(E{nLe62kq*jv~{#N9oGLI8~HW#@*Ux&M{#C7d%A>QGCubl
zx6!D8cMqULc1qk)`o^5J1SKM_2~XL7cJRVxdzfS|uCPRyhv@_i^_qMrFArXrRnTfM
z+C}d+PK%X&Jm|zmVmzi3jXE}9-AoRhHSHTbo?_f}+)kbrCl#@CUA0+$i3UaHGi(=G
z*&z1)AMS58$zBfV{%RoMEowHCXC6(|tr7?~Es2|o<v5`Lng!83|7fg+rK#<!Rhkix
z(Vm~K>@t?f=kaB#v!Cm&-lrw1=jY?F;PveJ<O`_hX;z&zmc-A&&_XGxcGJfjGcdmN
zMeBF&1<6bq@x-X3D^yR@7t!$AH5C4Kd>2n$elR9(B#*O6!2aJb@1k0xsr=KxPyd>3
z?2og)S9sJkbld?4(T?R-{Dh!dE*Ul<ZAx)R^{XZKxM7k*!<|Dg*UXCF`nES#(gf7R
zwfbPS*ZAIK)(VNG*+rYxmVUsf?~ch(2RYI=m)A3QzTe(U2sBChyUu~l!^SDSZ65b!
zF_iXeR!Z`2UmlflEaLT{phwW~jkd^|@w?)+?MrXy(mHbZ<n5+*>+<#Pttv%wo~oDB
zwe82UD}mNfrjVI5(;Dpl&xNw^D)0_s{;b=F##)ILVNERM&<S5M8k?Y3wi+W-^3X_+
zmi*k*D2p?tdRfB`pA0E25vl!Lk2H+t3LdL1pl4!SLweYX*)esrTJk?ssN<-0a6fDr
zg2hY4aouM9lgh4AHevUA9&Tqsy|p&s0<8b<)#PmH_S2l+D-XHyXmP)n{dnt_^P8D#
z0i*!?3)(KnPB8zq=#&)sV2~*jCnMjF0-LQseZ0FVJ-iy}H{4q4ZYluT3yfXuezDE#
zvK?e=P`ieRO7X)Ga>EU`B!BN^r*yR5TDKD${rw`}AM96L^5?X_HHiw>`m=Hqv)cW)
z?od?nbZdyxqNEfa>Aj#u8((Y}j_?;<PYiN!aI0Li9Q|8^66Gz)S9_6H{bz9|PRHvQ
z-A01}k^53{%$%g=p4>7FiLWXtc79fvo`c!0`b)D%;_FJxHstn<9C?Q>4)=<%BJ~2e
zcG&w$r<wE)qIxotKad3fkEipFX1jmm{#~<`Dy<qdtBST(RZ%0f6fH&7En>!~nWFZN
z(xRwQt-Y#Rqe29+C8$kpiP}4MVkHRj<o-R+dH!>bb8>Q=_~!GuuJ`-(lH;&Fs@SA|
zYXD7{OPYl$?KAG^pDee-n3uXQ1R%C&&cX)D|G8w#9u?X%oRUfn>(BY};l0vS=*<W}
zj*;7Eq1>!+Kw!7yP`|e}|06OF$SknFYcrXTHTj#zxGn=A<jRJ1M%)Epp;lc&VIMzN
zWDz`2uiq94a$>Cmg%@g<P-Ec$rTJGa<KNLQ$>moiNoC#k5i-luqmRoITOkr>lH?q%
zFf6xMC|%W}!1*LVa{LKiuyxY?2w~JG)EZ%Mp^BHc5?L9%MWDn7-XALDJA82gHV&aQ
z>739dh#MP&8{nHtTsx?lsynRYhXb`I%TA{ql{Yry-VW@3y`Cy_c7??0rN$DC;j-NJ
zhO_$4wfs~X;OHMo-1>Yz$yxfV5G`{A1w2x-^+-_K7naOGM$O5_p$4fg!TAQ^8CS#K
z1n6K$EYM;KJE(a+bXWy>S!lZ%5*$Lzs*+Plrgcr7b$M<i?HRsN_dA`GKPmuTDz1yw
zIMBiXBav-aWgi6Xv#S@)+ilH$ww5|d2b?K{npct>mY>sPi#jOQ=o?kDpElc|9^U-U
zcfH$7&Cf1SfMNXH1j@Ujq51kaWBcWKhb|#w>oH<d<E)Z)`LhU|80|Zvg^qZgOxhi}
zQNu@-PzZ6p(d_&k;jpcvX=**fR4Avj6MQ_&X;!C9j#4+)h4iVn)YZlAugc&*ZARf%
z$^7_yj819lDdBkYrUd#2Mc!-XfzQrgoz?U`=ZD0}PZO2z*?i#mcs<ALm`6gDitEQj
zWk{!rvVEUicC+hfcp!>+Rao<o>{%Ai0X}mP$~mNY?WakeQ58x{=dqI~+mSV94ID*t
z2J6rs?wr>hUB{hlN<D}iT*eV`jS3wvH4hzKe|QQg3L18t9&Up&*Snw6`#2cOEamLC
zLa8)Px+JZX6J>oV+J+X;C-Lt`D=Km~J%(s~8WLMi;Mf!B%<=)th=b}E4KE*YYQtHW
zV=_5Us(%4(4^%Wx%m+9mEGr+{<bN@3Q8cpFfk!tnWq!eV4y^m1GdjBCTi^OC9+C55
z+e`@helsRmLO2J__LbSyOGT=vH=I<z#H7NQo!*htT*5RDpx&L_e(}L`1qZ0#{buW<
z8)I^*qvy$C2?3gj82&JOlhc~@v&A?g?)6$$NlB-suokPo?fKOt)6>rETT*ptrW8xc
zR73xx6V&_ES90;pX9b)zD6iqh1NzXiy$wS@ahU*?F@S_BW3vtbu#OWuT{#G|Ea_8{
zN57;6>L~MB(wKzR_V2l077Ca0jFtLC@w39}uN_lXSx>)<x!U>wmqHVVcG3DBuG~&v
zdQe?#H-LMl0#KgG<IvcHFI5t<cC=BO1mnfdSsGt?1pHkz&A8!RB6~~X>%bnBc@<?s
z&82fsVzWnF8B71msz|aRntob^q?UfyiS7)=sA}|f8vev^EK-d{Xnsy7+CAI>LwRWW
z6zPyjiav<9FEPA4cD?u#o@VK=FPpOvWdh~4FSkH5e)DW7_1k_`(===%9SpA!Awzt2
zZqH&?h9G<yID<zo^6GLlUhEv&UD4YK{jnO)mGuu|<_jbMTb$^-tIo17Byffz^HK|!
zUC^CMc|Djp-!DmT!lS3Vo2Skf%^T-B$kpR1nGpqq4?!;BnRK%VVWPL{t~ovSHC)Hg
za^l{W=^~1$`Jvofm9iS~O^vW^CjLVERqciB2T%0o-YefSrI-knm7XnrH$F8floM{^
zK+2#~!K<ArKWNEdAvybZwfn7#m4@ae_H;C})w)2?{Q)`QzjV~xY~$rAK8nhRiRF&T
z44T67zrp#Ht1qeXqCx{-y4an1euOK|(|<@!=`0cS>XhkKzUtc|nhG&vwxxdBDhlcj
z=#`wculUu{%TapXzi6HLS>{Cu$8hjtJ0o!-o213jOblkCmXlgjfYXNjc(sU*@rd6P
zUe&)2!c<<-u>GLCsg_sOwYNS!th>BomoP_uIOt+0x;SnHI`4Naf<;{`m0Ybe_r6Yx
zd#dKf@U#&Bu(k$o&;%c9tDD#7dd!B^^@&AFhe>X4LBt_&J+m<<*Ia0q-t)vdU5IWx
zX9FiyWVS`u!!%yrz0<_}uU$Sa$jmv)MN{s8h{F!SXvti|A)-K-6kMlM#9?d%2VRhS
zVSJfAw?k}MnZMbO({QVDO8`M4(lDoe?MiCT8?W(we8N+6jh`X&jJwg;$Zd>}?RNn{
z7s0+1V3R>pwcDaNn(wHVtZj+~NGef;4Z-WeTon8pN-1BE8F5e(M7lQ+9PsKwsfnv0
zCp_7`b7e<Za;?{>>*-dR;h~JM^*l8A2_f+{8!{b#v>7nIIiZ95e2(HtGdx6qx29kT
z@oEl6a2O9RV>PJR{@m^f1bTeGOZVKUZ7<aN(TdVEN8Av8tOv&%U^FHhJvG3S_LeIG
zA&?SV8Z>Y#AXn)C<#hV8Gf!&WKvR8rH`8oxCuS3@;SJ9u{X3KryrRCmy>m3*Jo7oM
z{sZGI3pFGCi|Oi%S6h@nxz5GouDcOCA9xL&d(C@=C5b3^5ArX8kgPByGbSg1iv@r0
zXfgukVg#p2!`{)3ax`g}tqE;S^+pdQ6z_hi4$$<?r8JV-3Jw-DcFfCk_2&@kJ9(Gr
zhWQX?<m)`mbU4|`t3@<=`2`dm7MzYr^=~v9jj8;4gX91d@<^%78%I|h+%G>@DZk%$
za+j#4R?Ty;<9C1&I)Y{mHGVt>Wq2ecrYOW)bdCze_w6b9LPRDxh2l<u4ch?2jM()H
z{BtH*5DHBXDfsTR`8S)~SGDk}PV*z7Usm>>e}c*eG7V%6!+hf199$IK{!QvQ6J!Gf
z3t2CP?8xlj*s!%cg7&GZxC)cgyMLDao|9dRw(RB>8`!=FY;OR8wy~zN-5P08;-qX7
z5H{;=Z{;xxHwQnSHg%L-$=Iw@i4O%Q1pCP4&?))*+)sY>alBsckRD5OP(F@eXUJbm
zd8N5>&OMcrbAoBJB+_}XKbJ)ZIOS7A`wFAu9@kn49J+09<=InOU*dP{^W7Px!t`D4
zYwMgx29;&|F26t71eEgHaoTfN`@eecw+$ArP|xN441E4c)DZim`-tllu3Vu<T-9bp
zPO3<}G0p22L1EQWCy!hmq|k3MHN;>`N6{*S>kB~8>6G8v^{-@TBuZ>mEL|rWWMqVp
zdM&#8k5v0)9`wNBlM&a6_U>uGUm<&YIQ?9$R;m>t!|<uu%n>x_Cr4PM-6Hgl!mjC8
z`Iunavgxi~!Y-#Hr|F-HGu++oC<;n7&b7wF<5!>b8bNOGeox2ATR$z8|A0hk{Cx9g
z)Wn>af<H>WTeBgq3K81hq(oAGI%d?Xoai-8DE8Rex-%k_PxcVGfV1HKmdn$Pu^B#D
z(Aox_lM=Tpte)X>q{8e*rwZL8bAbFSmYp0a+aBMd+|PP7RYE|VyKl`<Pu@Fi0aeDG
zAA85sx{61_d^-WPbN8aPta(ps7E1n2A}iqg4y|!AT&S;O`^Vy+AqSf7ZmOokKfSky
zUTFhgUn!FYD!4ArNM~ELCbALijgE8%Lpgnynn=<lsQ>jHxev9MgIFSF?eCG&akKWv
z*RV-szn$C3-9rPA6b8^3>R_{YfH&&!r5NcXicx);A9OmWcVL=WRIH+~9D1b>0Tx)u
z^WGlBn|HG0J&v29ACHjn4=KArd1~<Q5rf7kq^$rcOKasgwCoMBOPtYu+6&PsJO6Mf
zx^0=nL$gQ*iQd1xNSin&pc-#fWKIB@jGn^u{07Y)RDMNEIP@SVj}pQv*60(IHTzxS
zMn{9*IehWc0O_hI@yGd5FRgwxBG_0tejG<Uyub4qYGWBGRB4|=`ZQj+&p&&CEO?RZ
zA3X=Zi`P-yn7R=*_dBPs#p--X{eu4FxBcffz}AyVk3u9U+pwC^KA#Z_VGR^NSfY=E
zfn-w?B-e?DJ!;&cPb+eriIo#UzqUVbMoB(T814_7Hp#T$I=h~pf>Jw87=l_Ud{?!1
zxj{+mvy<B?(~#VOvcgbA7p?)#aFQ3SoA~Y8YNKAPsEA&M`d0_ku7Js>{g?X4x4HIH
zO#{zs(#~Mz524M)oM!9KudS0~chMRWI*_t*v;t9mqle~V1MbnX?0x?Os-)0ONYYkM
z1q!+OuS?3#51}6<n9W-H8^<dtlS|X;!n6%RG}SNvd`x!&(_Ps4VjwtuYq+;G_4eN7
z_vYPtngf~-!ZMSr@S~Mz9W)`IxZr_LN-Z}xC)Rjly|&1Hkl>1=Yj>3YejGbL6AbMB
zS%4w>fm<%`m2KWt{3Q_zPuRcIh~QiX{<>M<xx6!Ydzh6r4M>E0Qpaz}(<J5R=a_j!
z4h3)=`7^2-PC%t%pkFE0tOz~RsP?aaIk#e>LS8($%`|6k$Hd-6o|p`@njq9FXl!nX
zWB2YS1PQFh9KN0Lu@`(WyQ>dh`8fEp*1%c`@4R=pN7!$RqhB+s_P9-RtMuyWWGSzN
zBLotEaO2)7%i;2_&ug<Sb1d1;Ddd%GpJ=XIu;V{R&=S#Avw!tziitc|cwoscjk&V?
zpN8r{_xa6p8lTu<xc}yhl0W68MrsO`s(<#YQnjVLWMj?O>}$aI?qZj~VhqE+P~0JI
z4~nV9<)17H9;0gl=j%Q<r~X=5!@Vk{=t;FVKeJ(dSb>vVVw1vvhWM0W3t9HroOw!!
z8(tPIy1P$i{k~gALiD7W@bgObv8ii@M;y$SPT}-0=LIXJYK4Q0Za%L+Tf@6t*>fgG
zn)CSA1Et<DDMu0aQ?|N4Z9virE*GmMrAd`2lBcsTkRf%Y)qH;arvD12CWg@w2=;wm
zc9yAW+!`Xdh5ytqXgUp0dNyAO2w9#E?9qJj@1V8Ep64wgoxA8QN2?RB#O1s1JnW`L
zQ0I8RXh>r%iHCecYLCDjXD;gvLe-Re#>W_kY_HKTSJ!Mdz+6KgHFEK@JmK*ZwNa&E
zh_^&pw&`H8+|Hf19$<&j_6}=^Mfgw0w9ye64a<3GNd}8_)we;Pqx(&EDbaF&*70{J
zvest=jGdbZD2@ogp7WSmwdxLCEji#Bobw{g;=ZS?hG^Y4{_??tGpM_S96BYXw!r0a
z#zl>FAbX<v*F9HUU~TyG+7IItGTx&4H+PTA+Rqdq1J!&@_3IZQ9-!`ZxU%c(D#u^*
ztFG*hfLllAO~US_z|-0uoGzI1RmSV+f``^^+P8j-*D=e`&}hZt8E+bL0z=i8cl<Gj
zc$M{%?M6sueSJdHhZLtX89i>fXJR%_3@@BShO6Z|>UpO0j7A<Z5CmxOHSa%su8;vl
zLvBO_>iJw+wNNY0D;^F=3xQ_#O%wCps!0lL4*pG<xX<2Jk#glLGfgYSS@tF<`{p_w
z$jh|{|46v80y4!{9U)+jr%RaPM3zdQpvOWC)+uNt7*{^oJ67TuKOxFDv+xzW%BQEO
z)_|`l4nw5lyg&))7>4u2Ax(EHtVQ2*$pcwFZ?EOyk1kR#aj7oWaXCUEG96Mit>&t>
zw$^>-3vIL63$?s^S1BkExM){9+bLwMVf2NT+e-Mk>jF&5<JP=Xc3}5aq0jhvF*>h*
z-0CDAR68evgSsAkZXhX3E*8wx$Id+?^_lQf%5@|mvu)z~eOEsxfMrAbc|efG8iU%w
z8>4he^;TKAocl3JRuc#ZR*?We75H!<5hO~L=tz_v(j@6_chlw4*=6c%B{S>yQCBq?
z_swU0gw-1iDc{4%vo+qOg?AfU25nj2*N=;1(a%)4muY9zDC@iFi3{i4P)Gm3Sr_Mf
zV%#tJ+qz^c4^~<4?nAMJ=Bb&<owlHCG7A4*Jas=IG|n_@4Z$k(o_|S;ReNZ->=M<y
zqW9{gmctv{zpPky%QbD3J<{+^z(x*u!6TAwc5Fpv!DY)Trqr5@SmVrB+kLfi%pDh)
zCv?J;3pQX4bmb0wD?6m?nU4|igk-Jx%3*7kmP%~n^~yvBy(z|rNl*bG?WX9x@!e1-
zCXO<h4vB7Mo~Ih|QryGrLr=_o;2~ea+*Z@qglpHyQzM>-KSpTz$EER?F@5IC|MdF5
zp5?Cly|7*xqlMvAsz>?k_KsAX5b6YN;w@O4ho-m&gb$LWyp#eGcLD(bVC0eMJB|rg
z;?u}8=tP824j0<JE#MDjQf9EK(`;%;fJ=4I0A4wyT$Jd0O5>9$&{oLoR+l1T{tL&u
zE-3vfC24R!Qo1^kpza?x;0rUj(6r}FHH_PC`Q;pkH171rL?w*fI=Xa%f^Dx)Kw0MN
zzaTy24rA7E<<2xAmB|`=mYpf}m7?q_fU}W>f=aj&rv!`e&x}ghP!ewwXw;b7*c%==
zFJM+|dMPfmhC9)nMjsWprEex}MaZ~KC7-|aXx%hslq5kHO76amr4ZHcf#uIM_4@mD
zr2eGHols_?tygCY1l?F@D4*Hngn#2_W7vfN6qIJp-Rj5lkh0zz>o`~&3#8b#EW>cj
zd~u5QOgd|iMVtJd+t*JDJG4Rq)LzftSMebKrBp7PD%y2rL!?@xRf!Losm<%Ef0()U
zm58i2C@4VHYu;3G=`)HS%166kP_aWR)aLN3{gva5e-q3m5CV3*mgSukqrJ!jC^IIg
zvy0iu)Qds(;%{>nwVMZX6R?P<sh90X-$nhiD=NvBc)cr`EzfT)nt^a#8}g-oZ@Z!k
z)o9hu1>ez8o~M2IrH%D%i72Uh>49T2WaXx7pW@=2fxVFqg97t(Psi*rJGO#+rBT_X
z0#5=2b>CVkfO*8g{D-eC)6w~xtO#xHR)~We%y5iuM?9%+*p!aNrY}Z$YsKRRWQl8d
z=NX$6iRkgv)6YtfpVnom|6rSu5G842CP*pkbc_goG)Co8NP+OcZbN%ywmiq4=9uQH
z<yF!EKBTP2k)RTsB@&!?ZVnwv;6DrL%y`nwv?xPF8S97d|2QU<Gwxj>qAHZwHZ0QA
zqfFFYS;$8EPr7luP7#azt-sp`cB67B*>UHO8ox_MJz@9z8FOov`kLbWoaD3lox7U@
z%J}?~juUzrYL=Bv)kMQ7`#jC6f4FIVz~aGh=J9uFYQ7;?>1b`-<<V~tDdKl*1@CH{
zd?2+FaSx3C6ep|jR-cy(3!J?xLF9cq#b?^@O%?IK1GXpeu0_JS-}@$1;9J=0!zsYd
z4MYch{z89koE93J=Ie2AXfz<ugPY~2j1Pu0sjmI`W;6b`YE!$p`gbUx^bggq!2k76
zouump2%!J;vFvo#DD52~yK;*ov~uX6|EQcMSdv><4w8-yqFNUCPLtj@TyZ@nSG3@Q
za<vFAT-MOI{;y%kZVQK<J7)NRkR!u8OKqVN2P6E!2Rn5e*Ort(^q^JY4FF<BzpJhJ
zOGt1P=D7+z%|*)|YyBK>i+0%1!ybnftVhw5QNKhP4)-5*PcDbr>h`V5$Hw!18xBqz
zrDM*PMC!fRDjUY1UCV}wt_c{pbbRMDB+uR;D?>xib*uqujP1XAMhVJXoi_qQmdyg6
zXV=ntN{*ij!k%^W=^kCU(uBMBNS<*k(W<N_B(0{%yqnxC9q4OX`aW{v9J}Wb&nYP@
zs;>N#lWY#^2^nzKs?U?~a`4l-rBj6=ji}$Akog-kJ`WTNO{}A~nT_4@^kd5iHdOcM
z^I#JVnaZty-x^$2UD*%wiX6Q60J_XSh$dd|W+o;Vi%&oR>hB`-uw`y8hcclyPFzY$
z5>*g2sQmB7wsLGYd83;nTjm$s8`kyV`hmqIvlBSxjUMy>2O2PElIU0yjr)Wx_8!QJ
z{l7ZP%XGsM9sfKJqPd?&Q=<#EFR$f6RG!AzrCO=+Gdg`&`wgvW7rb^f8Ohw(_WJ{3
zQP;WLp$Oq%t#l5N^1<Ad#93V0Z&C2MUSoDi!e<4BAzEeh-^`X8t`c2?GF#GM9(17P
zG|`IrvZ$GXODD1gb07BCqMb#{=b`$BFqfKAStmNEioH>o335@jC}+_XE*q^S<kf^B
zcK+)8*;VImBTH_jjJytjHJ4Y<cZpl{A78DwPHnSpW1(gTZcNn>t&o>fapX}l$uw^7
z9B(|JFNv&OfWD75dwaw-9-)}}2qJOx5JGbPnjizmaYW2oX>6vN+Y{6)j&!iRsi%p0
zrU7b26$eNBn2X%GA}8h*e$dm`I)c!5@~~yoZCIqbn7o*^p&R}}<`K3H=SuwUd}1-C
zbXRhNvb((X>AyV-?N%lAk>)p<`cpHI?pieu!C3!#_3PqgvQn00#%7rxC5Gh?YGi*O
zD>3#s(d<d66xe=H8f)1IelQ+;M?N)usWA6=glt`YPt`x*^usrqH#jxSC7g0p$dw%^
z-(JSOJz0*>1c57{9PlS@Z8M-ud?+2C*Re&S;h0ZA=QE%tw*3L9?`VTsRXmSYIJDdh
zu2v6Aw1mmANnom8tYa+UI|P8;cZH)%mHcxBw-Q{2pc=DDHwCxtg%e`VntOMGTXzD}
z?hd^hxZ7SCBYO6U-*Fs29hMiw_Q4J*n@fP({l@(M?FzugkXg#?p94Ts7G25W6uM1o
zHucSbNt{jTz5HX1P^s#`)F9>6IvuVxoa0#R<skSIE+3(mUgEG3)`3h5z5GL?2{J`M
zSeQPYQ|;Y!>I)(iXztsX-pk2v{e?h>!znJQz7&zX&%tGhC}0!f4q)HBzgGW|;gS`!
zYqm8|%28PgdI>pVvWa!JEBU<VY{z+G&bJ0F3)JqyTsljF=B<yF3Hg=@gLXFWRr#hs
zt&~j9>^u4Y_C)M39CvrZd_J@H3C@Oojr2{td}(Rx_7B?QUMY7?u66S+I1L$wu)^+r
ze(+P?_gGxwFmNP>y3A`QWyR!^-`R4zeFSP1R<Wn4;QN(v=F*wBpTJtJfD;cbT5~RD
z#I+*~2q7?_{SR#Xkwb&wMah>2rnEHSXXx@f(9OMGL(a3y5;Ik3Y;!c~^24()bGxA<
zVgDbAo6IXhq$c``jsIpU0%oyI7yC+HaIbffGE>b4HIZSMLf`|BfnuEBt&q+S8FZC&
zea4TfrO-1LpTvuOBOf_s<jq$fNMzX>0$`<F_<gG{13|EekK*$Px8j_OV7mx42?J;o
znFf`3j~4E+FlR(V0-MU02E0AQgYJkAG+muzi3)~HMwEOI{Gr=kT3}6Cpy;=5cDg7r
zPm?b?{t9o+{TR?T6qYBeBXF$Yn_DdFq`m_T@t*lfbnKg_eva|JkMYaQ=dC~W`hz&l
zH)*y8Pzwg#YSy<T^5r*B5xI{w4SW#Ml?g%HKSWtTy$><(hm~7~|0I&vPWhK>768OK
zql=i}NKDOlo#g{%ugOu@a3ydOHF*pDLb!VQyqq*{iOjBIFY$E=C@9^?!#nJ5jW-un
z=F>8cpJ<z?|Ni$bwLhfY(!(-q6OhKq);7#nIq4huq7u4osjIU?#!1qhCFf{q+Y}|p
zFGNS(X)eOB(|?bXL#V#RAG6aho|`X=IQuUDlB=4D4!HcQIbpkQs7q39_p>RoU2a)5
zsHtERK=?W>Pr6i^>ER;Ro{odDe`>6F?;wW}A=SBuhi!8tE{;jwj9mFbHs0JDHS$P4
zQqyI-A=CtOh9t~1=C+Q6ZLi5nWLoK?*)Hv9euPli)0#ecdCH%d6ghntYd6$e+4N1^
ztSr3)`C(~!mM?aYKuXE9u@3IoYd-NJjieWG1{!bP*odLr0lu#Gi1)6Kg83NsU#5q-
zefukFNHUg-ZNK7Bw;?!lXQ|ODK@=`qdym!n-R7r6bNwwd#-Q%-+S2mjVcsK7TvoN*
zV-4E+juu1yph2a|I#qAUazVcfO|)jFK9)}7j`McIf3iH}t7X^QHy~a&b#H5&5oos1
zZsx*l_sIF?otg?ro+j-t<H8N~cZ5@YSeDcGf?m!1Qd*=biq?-{PVqryB{HMM;p;Oy
z3DnO)W%<Sxo~FTjXYdA_6d@e#1L2^Gs7$o3^?Df{xHAti+m?e4j=XFDhY;imPaDjS
zzhsG{clNU98;Wr|OM>6-dy{^gm>uUFb~SvYq)H!~rqWi=9oa%BcPdpEG^|y%!^%QJ
zH-_f&uBgL6TBdRSWY6L8hH9+BAA|#XJioa{dr|LjQVXtacIIbg@v);`p=|Z{)9Upo
zp}knGX%(}hcU5d|qx&1esR!g`bd#nL*D=s3U7_jBTz7hR=152VnF_~$_Ttz9h6#R(
z4CwCF!GGQ3o^u~*#BkVBe@Dr0qLcr;>~VBn-TgGZA_lRT$hj4%swT?4^oq*^={Upf
z<%7z9FRKo@2*sYozn$~m)0A8#6J0pnf*x2u{NUg_Cy+XsoA+3usRh@|6J{?Oonj(r
z_c<CqGu|FA)OD|1>@^AHL6D7zymI5pn{SFe(>)d~I>JPho)~{<=B_|msaKrIOm;TG
zb6v|Gyhcb9WMaKGZOI0dp<)!(^LX;GB7<>guCVC)%+KNs#otO#K_mn>iI%`)rGK&)
z%+%^zaIg*AD^3D&m{cl5(B7LH7e$8D7ZFmcLch+@K@NfL$gyqP)@aP~J978*2i4cY
zdM~8JhtOR^^^=Lf8%~X%+D}o_E4lWpMf#?s6u|j5SNBTV0_ldUmTA^dVOXCx?K!8d
z$W9YXTE&b!re!vE3ZnmfE`HF=nEUD@3(w+d<rO?@UZ>imSR!kT{GQ<9{S<ko1E*IZ
z)0bi0TZhb$3B=S^4u_S^UvnzBH@$0Q$fKMk^fK+27fKyZPM*OVHeMi^M!$MAWqUNV
z?jQT<*9XgAbfO`%79ri}aGk=`!exd%LHU3vRKbXowGHQyaMx0bLTBj^TgIjc!M4!5
ztgY8NIOLDA(BkCiif#~AmJDvHT~xHo8!d?uq>~ttozml)o#Wfl>RZ|PEDr)KZnOs6
zh3|Ne*A2R;z(s%+Vu{)@k!11>psqISF4;GIfcGS{H}vq@RKlj^(#iXkJ#>qrtG{5;
zIVu;$$4w#!c<XX)&d6g|I@NyVB+|m5<^RygYz#1$e~0#{iBcI}=?ypD3e`F55toTz
zq~y+mr~<nIsd&&g$6h~3>g0No_eCdj)-@NqpzX&uZyqSciAMVVcW-HH;t0^buH3O$
zq%Aw4kK=4g2xP2aAiH&t7gwfg-!Vs|TdRPds;exs1Jve8?mLOV*|<WvoT*s|Pg`Z3
z%siSVpirvP8HMV|C%lZO5KRbwM=qvz0FjitEpnXM&*{l-;X)6LLkC!2>}kk0`yE^(
zDduwezAy-QbMZ6@viCDeGMQMJM3+1Imhi4C3Y%%p9dJeUV9hJ{%OaZQ$raqL3QPu*
zSJf*A8CY%C9j%_jd)NY-C0-+k(wKHO)hw1heCg%Y7EEe0gKEa`ub8|ZritR8x#$Q=
zw>9-a)RD6^Rq21`TusEkYL^bqxw8r*{(Q^4%pK7C5;WN!GiNrz@$qc<(p<>;s+GiY
zC;_+n(cJB|zU`ynNR!)Ti2!+{zL449Dv?1-8yS`{o4IE3L}wp_0M{v${vZ-BiIv??
zhBOKN-2WaXwKKW9MFt<0cQnTQju!Q-txV=PKrl*B?gG4{LUE7#CJ9!0@mZaF84g2X
zsEfX!V-B2jsWi2VcTpG+IA~RFz=ml0t$|7P{E3E?@A`sTC>!$B&h5Iz?=F6-rb|T0
z>l;exh)6082zM5+|7?=Zd*gagqI{6j>%Z{4N2CW24xm?YNUq;Qh!umnPqWXTjeP;g
zOLS!m?@9c7lzYV-7U?S^Il!bgqnXhG+t#BFugTm)2F)_}A9!Q8a}I^KX#(AgPi`KG
z60V0+!{GV^%NIzg3APu`u`z;MJ5Ja&iaXh);@$vzTFaCGtUG{hW=sGS>}0b1XJ+gX
z0BuARt!hXp5x)iBEjI~xn29UABD0ZX$ZBg{+PzyX_j(qJ7(MtB8Tz7WMy4&r?aAHL
zhK3rmMK7VugbZ8b(MIEWn9O<ZXhkhBl=<S8U-CM1;p_qxftM-x*J|8BB-I7~mE-Tn
z*Rbv*A+lL@_f5+HEOT}EZMDIQDZav-yIf(V5<S<7c2%=nRG}Jt&sL)^vklpgIJ_#9
z-q-BRRk1H`A+d^8;0=N#SHEL9GS@Ewxts5)`Af9_8uFh&^EWm@68c;2BU1J}KzCc&
z>aUdTe0?t-X$;@l^ZBubb=WsQxaVi8{O}b&5hS(-)swk^eP8`wKZmwvv+|2D7;61b
z4U&>rg1X=z&Mn&h3Z|x7b<n#Z-e1LgVD9W~8LC!D`2ht~yqvS|{JXC5h}Of5T?x+0
zFZ!!k=5bq%z+=0B!QzwMssijjuZOs#u7sLofK|shuF~3bb@uyaS+c3?C`NCUU4tYF
zja*|^1vAT1Nwb3;*uoh5X@m&74C~;o-cCS}6!`3+3S5c6sq*&M+gPnlOZ}>&)wAy<
z=ds9*KNQg{I1RLDt#!BKM784AGT1Brj2-c2%V=(MSEldK{J=FD{k&IYt~Youf>6~v
zSuk7T$yEkCb4hI`d+f7&3lr>vw&YtP=6Xr)p2%Ff{faz8$bVG1$Z(zy5vH_&zCSgN
zbMp0NXueo;%lxZ+?K~Qf@<eGL`0yfunt<;5B`uu+9Bxgl;+12W?Ot8~?i;5SI;gfM
z8y8rHO#Ry<rZ=saTQ!E~R?07NLnilK^72&_Uv2Vhl6@W2A9f<v%P02scU^jz+u`Iv
zEbKe}ndO@7u8-M?*J{kr!xoLS&iJYjPm90qVcncIC~+veng<!kbqK7DyDk;wk{N6h
zR$KvTbS~RwN*N~$r`FXC{fxi3B)O5DOFi#gemKt!jMSo+4!3M3h(n(SwDk_C{2cdM
z_J5U*Q)qN}!g}-XBFl2~F%D*Xmwdraa#Z*WgcZX<nhCavuA{x~QN`G*Pq%zUqe*I@
zl=thVP1j1a<-C78Mj?wf3uly?j*lJVScUYJf7~{@NDhV2wBFbLORx_vKln&Hjlz<n
zp7y%Z8aK($?j*Tg*Y5mDSQZNj*5U!p&q=)Tc~8(A6Yl$hXci65E4`W4lLMfgZ{PP+
zbvmYY+||QKh9ySB>qjqb5x;}65UBE15}T~#)Fu;Oe5gJvWz=z-q163NbrnQ?)v}fU
zv#Y#2h~wGXy*(7#u;IIUnb1K)j3g|9kmXHP*p(KqJbF<`rk8Kv2T%-Fsgg~2)m?kz
z5QH7@ReO_8tLie7mG3!&*T{9K4J;v!)A6RrRS|o^N+*|O6I}4atR<faThwFm$_IY0
zFg#qV43pA?>Q9vp>sO(0_yN$hr5A>XIb~lpTvHKjc+^Pu-)V_-4W9IYDl}E?u5gdj
z>*VoMk*`sYYD}bmG9Jk8hJ^^mq21G2$N55@tzUSD!-fm|2!l-2D?a=Xssz}0m&jP_
zwR86we)3R>!|zsyMzc8K$CJ@(RrzmM`0_a>l$J!I3?aJtTv3q0!$1q$Jbqs3$$C&z
zO}M72E)xR9V}V|KW&_uzm9m+cnnVJ{zeV@gHez~3;^n6Hq2Bd*M<`f97c=nniklXY
z277>IQeZ1;r#x&<gI|Z!<ko~$nmYJZ1&S2E&m&(SAXqJSfaD9+)5by^R2_S%Hzm_-
z&ZoaM>8iFzOJ9wnNUu_Jn-&eSXX<+y$*&X-OSNwAtsEdC*#r+)-Yl|l3S*I@{L4)*
z>q@UsC+Va%41f}L8PUlyO;CwbpE^wDCkI?cn+MyXO0c8{?S32`&dv}4x%PCJ_RN0H
z;h*Iyd7xGy%dH9;YUPk;>^hxn3lyLKsej{c8FIzkOZKwA>@CVLU?bgYKE_M!#W$v<
zWnn#)_NNAVHJKVkdCy#>t^{O}z@_d~jh(JmCERC^M3@xn@*%=DdBoMUEOVr-p6k@4
zqhH&!)6|Bo4CbczwnfEzo0+eaxf%p4ipY1e*<B70pjA*}T<)gJ?+<umst-E5{;g23
zH{WZn6@u%@nE&;a%Cm2)Go2oG2w~hSm~1sX(45w(J}T!|V%_BJ@%0>FbIfhk;cL$R
z^Db3rLTfKg(enUGm{ly4R~-DeyW0^c{!+$=m}KbjBgC-|I{+&i(oq?>e~J%y4Df`s
z44dpFEfDBYItUdZ@8fZ9CsRL7+N2n?cu_}v_8ba4Y|(y+Dg=PvwQ+V0s7bGZBbCu3
z$HJNf1EJ6Ev;nyBv_G#QTl4tUQ3Uw-LR^p$E8vj4rUdQg=G|L1SsOI96F}{A#S2Q)
z8t!zVZiy@E>%D*@8a?kqj_qqHc%^kb;!jkgf-uhLFJ5O}NN)*Bz;0%isp%XsWH#>d
zUep7BqFnS~8Y`?iFJ%dy8qtT*h2pCqL$O~wan`z@H2oL%0#==ar+CQQg32l#AF!OO
z%9yX|#T+1;MA4HqUGUV_{`^F#j|I{3P7m<NZb(u0H=W0d8?UKD{KpTGAqns2M9x7O
zx$m!mvbzog6G-z&WCLm4wi$%nOV>mX+Or(DX`mIxWId8ut+_@54bch}gw%M?um<xc
zJGY~K6uJGctmtV&utl(862fgsSEcGieB0Ig4ukDPN_NN_TC;?ZSpD?ldM>wf@9knA
zC?V)Db3y)K^4f1)ks#|Cq~DLT>8vSFuO{6VUC^4>6G?II3fXp#_g>AY)DD^Zjl;Kv
zUI_)Xeeh>KO_~~NalMI{t}vCC+@d@P_&ZKrj-*h&<*9_a2K^!-0~1bD_pf6g5i-8C
zPI?<YgMP3MzB#q1VW@A5iD?4_ZFi<o9gFRA5Q5Z_AYqJO?*p$5kdigA%f}+X0hvic
zy!@~)7$g-u%3AMkJQ#9yAefs%5QR_l^Hg+|6;(_`Z$Xd|YV&wpP-HV)HqKWq&}14v
zU91cWv<sa#;TEXZ4-JvZ7g1S-O5kf3AkJT~KWw%`3QiUemm{KcjS-PLLy6VifBx&~
z5>o;gu(Ur8Wq8%QC|`bE+UDoA>u>FXSD5!>-wMnk&brq)ols7Xj0m_~MAZAiy9amL
z%@}t$mT_DUN<P8NE2U3Rr43Pa`7f=ey@#H$9tc#e4_q(l!!=jSbI%puPF+yX4|yHp
zx{SQqW;f&SpzuHrgWu5b&`KR1nzG_;5}dz2gv0g<Mx<2@zXI>Y+X-@ny?bNT|I@RO
zbA@R~8A>3K`OeI3O$HtslOA6zh1q6QGMgLPqJ-wsJM3n-A4$xH=!e+O(Sf6wosapT
zk`)`8@cN_9BJepzF;7YUJW?FSPkT4|Uf}tR4F?aM3KF6jh_3=x_psd%=y(h1Fpe9s
z3ipZ=g@7H@|JoTmj959F?A;=2u@%7FE|yZWIsVwzhYhseZK7e3Z_`HaAFX@T1E_K1
zF_o{YU4*#<jKx5v;VT<jZChWzW%k^kiV!*V27^DGcdaY9I@u1espd(Xs5r6`;TII)
zGPK$Bn#|!<;r_mAWVL~C=&tU%G>E#}m@TV|_T!)WUQjh4__lI!N3W*%lIN6}3t~z-
zdtv{Z;FBnGXlh7V<*xy*{qc8I%TPH-q{-OBVBEb`+^<?lM}PeF*tl^&>@7<I$Flvf
z_b2z%u{rO~nGN|;AqoTbLz?LEBnqmvWxlT>#;rF;I8?diG~pv7$&^aU>CWJ?3+riX
zR#=$k+P28tFrk&U;7rstIPYltFPrfklRHP?$~nbA4CI48B@<lT^{5<l`am1z7#}89
z4-SQJXi}n#DXG+YC2h2VoRFl(9~bfWOm!<z8W8Woe`PmX2`Px>@V^q0xs$#=?;5k1
ztMe0Z(us&iyVB$WPpQ|OwxPiQuu*zeu3eoMp09SF?UdluOrmDp#63}62%@OA-$Iic
zkS}<Nf`1EUclpTyzQbbyi4zQ-1LO%GmN;ptAxQ8`#I~HZ)x#o_;5S@0tUChBHAQ9C
z!*9~H!rVMY+OElkYRCRWd)d8MT$}A+nbs=7l}kFla}~4vsCAB(qyI`kre@mx31q?l
z&2G>+6PN7RP$_M4`0EHMXa)waGPsImzd@m{Z`M_%`Z}2P586iMVpFCILKP^<`mfDa
z7Md#ICvUCIu+@}TDCrZG7ifhf=5N*#se9-?$y|25Gtkk)1GI^Uf_6ys-&K|DKmh~T
zt<JrfqR&fuCtao1l%=gnFCHe_3EHuoktLsunP`ZgD8Bh;%L4+^F%sStA+TKFm+-D3
z4d@V2%nzUSztGntmAzGCf>^B2sR>j)UXx9#c++cgDkP!5X##Hi4cO_WS+>pNU<(WR
zCR@eI*lI$f!m&zec<?O%cnJUcB=cLTgWJz(@21(oYV&z}x9pW1PRS4gs}u8nfg)Ap
zgxsy`d9V`2|JGsdJwkq9)vQ_PiQ-rbu1&)0EY`XV875;Z%sidsyQ8pzcLvksD+7#9
z1f#ZI4s3-ry4ISQvXoGt?%>mGzOVy8`zgtMnQSan<;Gjw2vHvLyOR0XmiDqg{o~9G
zg9GoghDe=FmEQQJs{o=bAZFTF(5W!A_2#Tkh{n08y`a}Jt8dYu({`L&0L+|-LTL=P
zA5S?QJUzR+R={^O=}oNoN_AB`fu@070Hvxl4(0#)^iL6A=b32%bLG)?tI~CbrWU>z
z#_uI1{9$Zv<s*t+q2miZ&Y-mHlJA{GzpdAbvmPT%#`HfZama`Gp4OJ&zK2DGviN-%
z=+1^v>N-U#wBK9zHNDOAm6jX`<Ht-1g2D*0X<iinhifPqZ+ZdpL%to&LYbT76W0Oa
z?<4Svx&%Kr<@#IDJFcVvKYyf;<5_?5C*+#k^|69r*1`&%_KwQvx+KFN?6k|z(xg*P
zRoDK`RI{q&P;{&^_(3q<qs_Pck1)u*sfZ$ZaChFKFW5Fx&Pvz2qQTnYv)uE~`dl07
z#q`fGa;R^4(>)`R9l6KOmTuPet}OZuSoXeDyve-nrB23XQtvBt;FS$8mkCUNtA;>T
zKEf}(=(iw|O#V+>GynL1lAmY!Ewr0p51pK&kz5^jz+Fz%x(Dwnv@v(2b|Cs}*>5tf
zaKfSQ2K~u&PB7p$$Q)b&4KQ$8p~$&c5t|iH)G(?dd*pKrVYAt43LZ#6icFoT6?mw&
z9$Bv)x=ch{HmmkyuM49+igAUN8x>zi6TaQ4SbSgDCk;3bUdDhW{GG#{&vm(x{3oG?
zN@~LA4>nHwCltM<TSmG1g!W#1mKRu8`p$MkR*X88;;o--<!d_(X>@uMhq0bwJTrff
zzT>JdVn2H(I*ss=g!l1Awr8Fx2@>50)yQA#jV&jT!;a0QSoyIvA1(sW?!_t`Z1@G7
zt`hE7VM`LONWF_ZO_RUqv1O;m4E*{fMQVZzI!iHl^!Ot&zm1m4lvZGGqmA`S9;^49
z$K^a-_x8=M`^qR;tm|ywwF5pUTE@}HZq0seOdEXgZN5#703;1dSF=Df*kS^`E>Ms|
ziKJHASKKEjb&AhmP|(x`g1Zx%bd$Qvo;clZ#NcXR)GWk%8;`N-en-0A${X6>sbV1b
zL<?2HP|;nRES~MyI?9_WEB<Htl9^oj?8_EtO9})!t!07URCfKRw9o_IgSoF)%9B3s
zdt_cvG{pIO6Q-$lG&xE19Gz5YPLMO&kl{K{ACYU#`FGVv)r;^Bp}&lEZtnfpR0KSN
zpJ$dk#Oz(;!UwA!@LQRu_&qvE$o5_qV&zU+$Acf2t`SkRZV=u%&>q#D`#ACM*TJqA
z>Oo3?W&cO}G<C>R4FI3H%+aL2xA^pDz&V<WSo!v7GD@)|=)N}g6JzD4CYSQla|Ey$
z!gVazf&0ERRYfi4_>963f^D}qgw<_AX&IgW_qEENLc@}yM!Vg`R^QVq;uVLZm6Ay&
zgLvehE>3l&-P+%WlfM4dJA|ZxW=$ea5Lf5x>C&R-k`4iY_NQJ{)Ep241qg_X(Dj|R
z<i6LI*G>fO;V7JKooU*GN?L$WG%l2IZ{JH8v_9~1(drRT8g<|~@%dmE<4mmg*yl9+
za*<a>HbYQR%|3>{N2a&iE4|O!)9x7`axgWMesS5qjVI!)J4B-urP`9CPh`sMp$Ak{
z=F9#0vk~(%!)moION40YRR$;FfqP`nl^0gR?Y{&h8gXuqq??ONhD$PeHPv57a((N*
z%Y)CM2^q_<(&e(C{ZOh`Vnj2Ghs{sSlGPXY1X8pAGF5U}cDUB~FI#;tVDtB16pzv6
zh>Db#7GKY}gPVipk*K0II;C};4>o)4x&qj%{>X%d2CSWG^rrdmk#N(H1tq5)&ahH(
z^`_eh$p}jcfLi;#WvIlUzlx|#FfRm5BAKHFQWY!iL8kgoc!H)J{~}C^uC+ZQyI%$P
zN_jEwC#6(;NST$p<?ntnc%@)AchIcl9fEbup7-py7@&d^H4Yc_qN6$=?70st=lVX;
zxm{HbB%vu$2>l$HWUm_I_HdI~*^LtHAimD7I+6TwmYv!)KOx?Yd)0Wci83<7o6?Kh
zF!NHZoq4OgA7mlg`Q+2s1hEV-2RzgtdT%sM-?xv>ro|?{45!f?s(XpjaPN1VS!c8F
zO$N!ICufRn9}sdIDt=w5vndP|D)o`oJ~#p)x0V7+0Gm4hvwcUrJkTw>^`H0lwF}jw
z-ECf)_(~#vf-R(r2IwnW;|@JYk#l0n7O1rjzB*fv&@lZrX!wza3wW3liWMLS!8csJ
zp<go&yC|;i@du_aNh#6b178XEc(YU`>^F#GawJtLJq$C*n@5)A;~0W+Q_>xC()F}c
z`+cWeKUaZz(?a_zUGIzClJu0kk^T4QT~L-8w=KRt0MRVJZm^x^ohg-M_zhEY?@Vhr
zt%sV<^{6%<=XcVsQG2UT1HJ$b`U>P)6;5;qr2YgK*<V6$OP012aQoiJDww6`(NnuZ
zQv(P#?P*BuTIM|jHrsUlx6|j`zf$a_TL`J_zb3E~cFeQ?1{AjJq*vE;zfsj|T+Ftf
zm6%TmRwSq1Vwpg9X8Ib?v&|9JU(fR}1YBso<3qRG^vz*72WB&fF7l8(@SaF?^qBIL
zzBHzkjT>Pmw9zX^nRuN3sKUEi4CEL7Y<%rCkd1>G8eh$KYp@WnXpvBCX9&C==lGNX
za6<kVtT_k_)@cV;pE3CVkfxS|*Ab?2Ba$f<N9@rRr($6a_P16|1>4%1NbLz0a;|f(
zVus+E*`;gbgV|3_I`oA038#DB>P7E1LG<$f(Bd<!^3FzlO`EF81#W$0<$LY<JrWrq
zhOn~p#PQltjve3?-{h+tpPf7uz0(J*gf5Mty{#q2&{Ay~270z`-V(scMDPKEb8D^5
zTOm+qZYkG#HtKju{0q<yIj|tjw3?W?@iQEv=MhJLA~tgt5qxrM`^DQk4B<RMqMvPd
z&$+*xKGtjbc|;>wGjL`Y1P``Ra?L+Ue_@$SDejkjA=s&M&N<;!j7(aJIq&Mv7E0**
zu>TYveHr-AY1CyZh*v`WfbA#ewyv$dQmz%@^cDctt%6PzYR+YeJK-NQxCRyP-@QHy
zVfLO;fO9v+%~u^7w=`EyqUV(Jq)y}_MN?Y`d!;*5(!jR;FQxF8$fBEwibeXqQRe4%
z@}XBko_<pM%2)ONr_!qDHvN7X2$xIS3pO$uCU0mUD)~21V_`;msp$)%s+#5F&_>|Z
z^;YyK{lB)mYSCuNV|V9gZ|j7wh+A#@W50Tsl-SQA+F01&(iSi5v_gb_hnaV@>2gb+
z?5_OuT*w{`Q2}ny#-Ggl<)u>arCbw3`UikB)R>u4W8Gj0{7bb2k~UDam5ZdiM3M0;
z{(j{aE_YqZ=JUIk)|4B1SZ~%ogB>;kn-Tb~&HABE;zV>;!+CJxg?p>|?WprRaQ;OE
z`Mk|K@K<SkU}i~v#fIzB;{f{twdHP$CLV!J3u~xwt!r;~DWm>N+#ZPd=7teD<+{&I
zVYY|fl-)t)U;rm@odMl-d4^Xc=t9KVWW=LMN(frqEuP4I08OM<My^S`@tpO6^S`;i
z{Jl{j^;^ekXlaSRUAs_@C0>Wxxpz$YG-G@uNH|~q_c+F3H#A?&{3T>%*3{zAN15wU
z2Pf54WRZUj$Gf<uy#4#)pw$@iHu0uQpGQEFGS_0ZCCEBY_UdnYMzu(suaZ(ku5FGF
z*w2Tn^c~yZkS-3(lRr+f*SyPv2nf%DCX7!<!%7v+{wn&2R{0?6#r^zwM(vt@qaYWb
z&T>f4p{48jX!S;^CflbImo;y^TB#rs2R;b%tvV_%qQXfXrjca!!I$&(|CUeUWh$lx
zKlj4wU3P9?^R9j*Xp^fmV0(A*1G>33AEH-|eM!%Enjj3XDOTUhlZirY=&7hB&yO%r
zl3Zk5*?jiM`FLJ{lqJb5((B!Zk1BaT=AMCl({<7wR4ngtbE?xvexc*Gx$I>Tkf&4d
zD!?1u5X<o#-Vo3w$#rIJWeF_g5kLY@1%s67o$lNyFhVp>Z7UWJPu&8~6J$$+aWdR{
zCR>`h`)f6La{O63XH$=LnPo8qIyM*8{9=g~A(9-pVaIg|95nW{%#t_og?FPm6Dcb@
z+bV{YX3(*SK`@XYTR*%ero+vD(}6fg9xvX;q5&aN=fXQBJ!3!N8s`_!CRq$7DaMk^
zsO8oB(L#%YTziv`6X;M6H?aQ-3*Cb7jr^ttY>qVBh9j(OBh70of|}UU3m$dRd32a5
z9&N}^Sa*-M;CM+tjk<0kL8VQER@{TtYF^()=<dMPM*?hUh0D8wO?2dOUD6_~|1xA7
zHaFohV@<LNwoj0>eS*kVNqMOllfJGfTJDAR%fHYZLyHdv_22OM2yoJ3n0k-!9V2{`
zUdctI_7E_|;^5sm(tE?F8|%-&F3MeN(`_UcENVhMeDdXLQzN@6fRZ#iy@Vy}OaV9d
zVk6JU(gXN(@)jc|8Y@IjRw8}8BU?1Ke%9gr!|=K&;UCDRto@L3IV{*UmSd6o*nEy~
zh2&dpPNad@p4k1j=t;5shnCoaI^7fE8@*1u1^uh>Lai@)1zfO!N|BxNEfKapxf}4`
z3Xn?aJleS*j|v2vLoA|KDWLe_lvi)!PqR7-*^X%)eI9RO@{Fk!JgQk|mNbHYSVI<o
zhoGRjWqI=De)<~I<==zKCO%!;G#+hWI7R;e3VHtt{)Fsx<d&*8x^CA>U^M?SzW%Jg
zJS(I>YuZ34PEr44TKcb}BgdZ29oDeHEG4(?MjVH*w%ow*@aFm-ji$lwyvLzB9$cnC
zzj&x+&Tw^ctsyo{>f7taIsc~G?JGBhK`<MwZ4ImXjS%(4=4cZk@MduL?-5F9t15QC
z86WS9hExJIyLKhik3%8V|3uG~TI+q6TZCh>e;nM}W=Y~<dNPq_&hV2ap$zh7@_2J)
zn%N6WN)i*+RfX(ywoPB!DI0D@pkHYRN&h9NMX!O6j|M~*nnk7|6eR3tkk~E4;9oVB
zZ@32*(vpO6=e@((fqco-!N{DZSYwY@^k7bWLHWa2c97=kx5IxbzbFORuRpL?sFfZI
zb_~P4aE*%mhKuk{Q*iLlyDPc;@i9dneZNuKJZRdyZArUZvxZO_F<38YDEz@e)v@D^
zTqV;R%pIa&+%CB#0;G0Gz7QsCCivipf3(F*Q1{+I;xRLqSHZzsSbbqKv2S<?8kayR
zi@n17No8pW$GJv`wuXX7oL=WrK`XkpIRrJd3ucvC-6Hou$<Rjh5H`mS@(iB)R{<HY
zVA5~bV+z@RU+w)of}N&Y&S0mbh3EO=@>M<>m@IBtHfyL|eKr;Djss%0Xu)`{?TYoJ
zP<Tz1wD~5Fo<H`1_;<KL7$juWXE)(8vV8z`=D`)(vcPG1Zx(r=1>FW~9%w3n2KU^7
zw;&cDCR0F<#FLTyP7=#dDTDrJa;H6d0OYbFR9i^BbQVmP`1d~Gc=E$Ep=S{o7>it^
zA0XH}!c->7p+Y)P(`v$T*fzbyr1UaWMsiHs5|<S1I}O$is|R^~bikWq`wIu|nU?-u
ze55W7>mI8^Mm1*&j&|4qHP0|sO<nD1Vo0XvEsOH!U+fcOLbf^d(4JF+uPWC{Kb{UL
zRV%e`ux<Y$faA}V(jir8QB2c28J6(sDzOEg@zmSxZD*nH%l#_Ue&iVaU!>EI;)}Gw
z4eU*ZtbEqD;PAA`SDZZa35<>YIs~@%p0wusG=wa==Kasufd50<dw|2Wb^qfMi4ufF
zq6R^bMDNiPf+V5`qj$n6(W4AO^cE4l1&Jub7>qI)y+kL>=pt&g5p8t;Blo^<?!E7Q
z%lG$xJkK}|_Bv<p{aNd?*4}%q8RyHEAoD`qAvWt!Y*K%5hsEUM>E-j0$nu9gnr~p&
zdoO&PZe&~~p3HgA<jlXsFBVrfe6;$B<L$<99BXE9Mqmh6&WX{f)vzcy*-^Nh0p0{-
zc!^UmOwpuFD)B~RnikEC-ii4rEj<j{0?$MUB-->VE`rRzT(~<+>7WRXd>K8%v?;Gz
ztO%`^qP9Bj(U=Rp?pwryHtlzNiB*JFExIm!zUZCBiwkS1U+Xt#X%`3ASqw+Hof^QW
zy@zDn(P-D1>huk!0diXCf+>z%xbIR8Z>ZmJ39M24=mxk}*8s?A0dKnpR=Sf2POI1L
zv)$qvikH}Z-h6a<xAjen;pHu`{&SMHkaCwUAUTEq*Lb2-LSQ?yyp~k1a=zU`JEr4x
z$7NrOY8j+s#w<xU1=w_2M+UacUig&1Xk1DkwzO*iyDyVVwJBDl{KHAEhNo>X29#<!
zkSWJ_UzW1bMcdy9yzj$}d{hYjbW0avmL=hr)?ynjoEI_Jg@s(AyMuPO*GXyhDe8F)
zw&p2AW`>qPjX1X}Ig!FJ7=?AbD*70^w1wD`$kkoP_P}^puo3PXR2yQYUTa~kPZeAs
zK{O<Oj^Y`9B_p_{UYNu_Y)1MM0m$6UZM~JE49QP*ib&tP?TW9Z$+fIK<m*ws^47hm
z3t?!Zos1@_8M_lhYnEI;J<!M+lU$)>yo&59g%}Ss{743SX53N3j~fO~klG?%&E|gq
z9Y^ilT(f&~^TGo@FSd(HH9*D$4o|x;LXGbJqPDpk{x3{Ewh!m;JoL#^rN3XPp#k+r
z6}bDF3Kp&F2Z5&QEBM+yRi64L$xB&S^S7^h-C2~Xfb}ark;HJcyal7j4&Itorw0;z
z`C%&QCrn|kwak1d^Q>)`BjPA+S%jV6XGgT<N<upBaAl=$k~vpO<hZ)h`_-^27j_i%
z@dIeq%fN;TtI}~ry}W$ROPySo%MTH&DqXLbW_jqF)az<u6K;6`X@nImcnC4+Jg>_O
zS>=KYdU**tQMpIAk}h@<mqqmr;H38F=3ZIXvwGSr6?#kMK%$>t5;)H_jvIqRl*coM
z?t#@<Yh)Oycdqr5=m?<}oGw=5D&3qIT)evrJ~8eNV})YUCva(yvbhiVt91&|J5UrX
z&rvtwliKpH6OK>9bb<6lzCzt^N;~9uH|9WXEJg&YB4yZK(I*C6tNIVdV*pGQL|EcS
zOh0E+f?k+3U6Q<Sp7VmdyR|bl*(zR(9qQFlV4m@nHXu5b6IEh-$R_Ec@|2Dfy7pGr
zd;*8^<2(sq+#IfBxN%vxYVo!B51m-lKm}Kiv5m#B&vTurQlXkQaVydB{P{FAY;6<6
zU$_It=6RuYTDOv7v2f$m_p?;{(^nXTX;8-Fy=vh@b+b=RT!+L*VDmng53=vB=#_D~
zxVN^J5*MbgQLhy8Xdmogn7D@c#~D#U?uj+~zEra)Qk2eG0l4NFdJ=a0#$7>-^z}`O
zIwjTjp-5nnM_H3LGFABL;pAKpTWSR#pN}M6mLsdN(xm$Ny30!l5)!0r!UOmm4Rw1d
zPCDj5RLMhoCv}yJWGg8zM8GR%`M^DNI74^KW|nJ}Hl<BGzrLh69WjS8FhI32^Sli@
zL=b0u8_|VM0;HbzIN(^%+6_z1bBbl<T3IBrD#|(@ggToD+g}5k?a9?2*l#+La?tcf
zjZ}@f7zmL_voK6e?im$zVcp+P1sg@AmbsvJCHg*GTXC;<zq(f?^l_Zq02g>=LNF4(
z>EGHG1mWzyd&!pOF(c->i7u0-T65@r>a!h45CxEz_QiCk?Zp(WOx>+7_X^kc2l@FZ
zm!y&?3hRNrRljTNXYmDq#;F-CBB!Ja1dhD2+->{T&G*u0wCC6%a<ZKWgZw;IHDrqT
zvfo5LY9`63^W^f1kAWvV+6>W7q3sz4zY(ouAe~{J#kt6nSWO-N{fp4WlDp#Qh$*uT
z6M-9*c#isQ-fLyqGN>CycP8(Bx_Ym^A9L5*H0#q;l;blXEv(Rij4ehG+U>_pmoTas
zcKC1@j|xdS<(lG2JzDdeC;~;kw83$zHB0rnL_zA)@VHI!qWFCiST-#Eh@)Soz{yn(
z6c|FvyEbtB6x=aaVQ>zLY$!djB`p*?4XZxUsxVt6F^=^8OqGB{v24tvjBPj+wh@k?
zRF@bOdbeQBn_orQ0tO_LouRjsS{2=j#f{bMO;k(`U4fFHC7=SzR}RF#HQ5{m>VJ}X
zhCGqCM>fPgV7}+>W4*-8(L?K8VT){E><_LaOK(sys5V$B9KHe7>ia%7r|AuDyKb)D
z-Xd5N2XpTom!{hB_Nhdn-xxxjJlnK8%c}b2rhaU6a&RBhnSEyzfY7*}2fuB9=~6Pc
z71(|cwIz(9h(N_>4TSD0c6W7<N?jBhA)G4Caq6pk3F7Qa9`$5z%9ogsb%L+E%+tTs
z@o9<c+<;vNUtOqoCxN4VGYPEK%j1QcH?{TmK5O`9{$Ml-mM`mJL@#63bH%@yYoA1}
zyq7k$>7}4@qb$2-X0Jn~cc4u7j3;5T<+`O)F&hWQ=y`!+4QMC$x`FXFxMtoDQ*eNI
z`6w+zeZL?AvFojQOd^$ZGs2hKiNVq5z=M=y1*l>)d7mNx$QYvbY_%SKI5H6_#zSA?
zPn}qG<(d^^LfcEjvN8SIa46%lq9NU}DOaqy2DvT`@6ufnPI%i2(iXb!Egh}GE0PcY
zI{TPOG7aIL#z31;pEllyS<sbeIT1H{2{R;f+{>%v&lK@6bLd?%R${_m9=fKx4Ouds
z&YVu__)NWn&6->rs*|&43-b&0>WG8L)rw|WtFhFdEoFBn?|NjwY{GWx>N7XYEl&%Y
zXPr5YTuHHr0LjISc~e7K<ti31Vbo}pFP^Di@1r?mAK1l0PVfL-#37^0;C4uspQ0>g
z>;|%=|Fx##>D@X*!D=kOaiQOO@CG?st!KA7Cfj2^L%0b!*O3F}T2jd3pvWj|9@T#n
zjtPe+5<_xhfoN|{#cx?dVqUic(R5cr5!-@<7bGBm-#2a1%D|c0*wgiw5(#z~2B>cl
zIBoaaT4kW{z8)Hp21hS9r5r;@I~EIfR@c9W+?c`EbXT+nT|7QsB~i4MleLx0$R~q=
zHkayhqbCTz+X~!zlDjaZqr<P;MThLsLq}EO`*4?A_?Za17)zzkdvr8m%-B02(io3t
z8;GW<*VQaMD7j=~{ZT<vD|x@Ts7g7wF-ft_`xCFYg{Dq&&=his-V%5HTAjhz*CL_&
zetmWs3Q@)4J}U8th=56}O>HTOBc1Dqh&uK9CzIw*!^6eaH|$0})7H#<iCzhB?0$nS
zPd66r*MUBVYlyWV2biblA3K^_1|qs`(?OeRI$uNq;8`a<<iCJF!#T_f?9JQtedcl9
z{Ayi;XjsJ)Xiq9zYE>;)F_vGkEOWcnQGy=i+5BXnT~<obN%5{`VjGG)*z^1%f)*kl
zt-B$2`H3-T@2yk4y;%@{yFyjFk^$F{ONq{Vg3n#ytSfQ`FR`pHbF|Xi#u{W?w7Tgh
zU0q&iTovV^e~@%Wo+78zHt1AfJC$;e857i(kf^1o&3eT6iARFd=<Ff(no1qZWGO)g
zVx@j-W~+73dvJ~Uk*!)08jy{Ja8uDdIZr}&M&O3mX4}Pjp*_XS_IM7e9p_2uo|e0*
zH|n6`Qtj`5a4Al}4B-d3sisSDjQ5?U)Zd90?$;kLt{S|c2nEhNe5}~C!TRw>eeM;C
z(B3%DJM`8t@f>?;72ypdyU>VZF)<*osyhZ$x1-w+x_<bkZz|Ps_=rPE)99lZ6$*^F
znD8iS-XG!F!*vI~z+8M6+&WFNBg^zr&{hI&iz7PK+f_Yc!rX(0J2{<7EsH&=H<sqO
zI_-0p&`(+prmB#mwuJEYd>k$_q9ig95gXQ}cB+?Ul(+HLAgnI^$*JD9nThDpN@P-_
zw?%L0qEv0)_>Rn23I>SmzbPar`dqF9>Idt(SgR1>LM@!nd#!P3^Vi!=VAV_NUlf|>
zu3zygGDi8AuE|2@FD!uTW{>k$J!#mqJG`|l4L;Vk`*7<<l(EQDEvS?eqR~w0X39f@
zR{fRr?K^Wo_uTw>97I1W^U%0Es<R&i4z6n;nS5qxN;9RaT@OQJN8t48At)_oXP{P+
zd1YaC8_v7IIW(R<!M*#DC+{n>`5oG3t{NQMzV~&#On><y4nAZ3tSeWZUvI6exsy;l
z`!*~0KD<+qhxVj~a8~x1k&(WblEH`ncEY5$zoJ@*is=@^?6pF_k^m>&`d#*04_zP<
zyA+&R)M|@W0Z>Wo)N9rERair2TfQX>RqL@py<$(XVgAG3*ZX67Um;-Yp@r%jt)=^8
zVAift^GPR#=^3ps59VErLlSI~izCtH(t_0$F}$NU^t-+FYl3sWhYI^tFQC$`JEDbt
zE7w?3Jl$mGOoKo6q!5P3iydERmCXoTgjZ+E=IIn0W_Z1NfL*CMxtCCkxJZJ2FqX{r
z;O8ReYh@s3b596d4*rzw$9b6EL%W+@$w3EVWB7C@Q(c4iEDpK{y)NyWA3ZdmDlx;t
zKe?jkt!9o;1MF0R49Bq&>)@`2?EXmu)lfMg0m>S;c9;QFyzE1vg@Vpwi9&8<l2~3L
zFR~cteFMkGPKEZK>xox*fR@10FNaRh<rGS{Z!j%)z*=cD)$qCIFzcWXCsQri`?NtD
zOPg>t4hlw-yoi}0tp)3Awy(9Q(O;F*%wwv`aT7YaZ%?hPcaqs&TO01ci^T|4iQ?LY
z;Op`_X{~+>4~LK61jT<@C6Ot44)|Pe;ziB<j5vHh7>-{7@($_Wfs=_G@}iB*U(+AF
zvN*@!w1@Y)-;rxW`zt7x(uS+Zg{X$Jc4FmrSV~$WhEAK_=SoChUDGyw7w%G|cSl1(
zf3HkLnSlYmM~HC!1&@c(M6;kxsbVf|VVUORg%c@G<MFBvPae_hs{_f`<%}beZ<9U$
z&~oH@eyWiavewX>@RdH*6CPBO60ssqC1(6$<;%+-!(>B2*OAU&$Qujay`hA4+4;fW
zOAI8R$Bj)$T_o=2sM3SLQdZ!r?h7dOUQk*1J;{780+Iv02bu2sYvbz&YlEUXi!CKW
zSU4DhzY@6qFcN=U;M8dV({xBIDUb|%)F2Z@?>euQ#;72&_2JT7!6xEM9l$mME<+c;
zId9!y*=A_1%IzN~4`CZgt{hb(RZ>%oX!eR(dGOD*qjWhSFNNJ>%!y<9cj=XjMtN+{
zUy;k`=3&e{CJ{V>ueY*MR1)9vy6n<`qJW)E-|UjPR;1ctNStW5c=OWvE-HJI646e*
zaIGsYNBmvZHNlSErD#a-1o!S*JzCfP2Q2)MziXNLl>fc%gaFqxRn$AOt!o<6{$AYJ
zc4{-%1TBYE+dxJIQ~0SgW0{@l5Bf5$7Vqx->LFH9X2);EHbZRM&&6$k!~TjWiaKe9
zNdwAnb*z5V`x$v7-g*Mi`zI(fE8EuN4rEP#&dLKrF`<l+&kiqDpS!2~8ut^Lr*Dbp
z>0Ucpfnpfxsc}`|qZ=Jvt?a9}f0P+{g9PDk-Ax?@t$!RrjC`B3Rek=sKKqz#@8@=k
zAwzIM(A;@PqDI=Fi*{T~{5cNg9z9oaP)un%-dKE-LD3ylUi-Br+ku>7$?;QgFzt?B
z<3wKEi)Bbz#C7W$#*!C(-}OLJC7P;9vxUK;&hu&aGni{b^2CJUbKhWxT<L3cCpn4n
zqEH&h$z5tc`2|KX@17Rfi9*SW!XD_MJKU(tvE?W%k7v5fNTTEorDeuMOOuphOgnT|
z@#!s}oIc~oL)RaP7+}j#S6AoATDX_qeINmWSaAA->iFax=Gy7(v~#v*!w5qM?LKoe
zrl3&Sh%4cNTC$)rq2aG)J5@5o(<of2m$Y?%@q0i0>gmpsnC$mP<Fa}sz~&PDvtkYM
zl^?EA;OgPKIaA}r>7*9;))yW>%Wz9zPq?WtV9BgHvmGt;ptm^!m36ht5hP+Afp{Ak
zH~r>i#C01(|FJLY$lXkcPe;>{o|I>d_>GE!BgUMDZ%2BH#`0qqY*X90O73CEP>OSA
z4<AMZ?IV`*TihN$iuh==UK_Y0;bC-%tIKUL^mzTTjFlzRals+1{JhPIKrv^8$iS51
z0e{)F2l2G_^~3B*`V+A?{0fS=JXlo6VO8&_x`ip~`WlJgvna@$Cs3EZAA-1Tmpb~s
z)rc+dkA<8_xc9-}T$x7Nc<A>bJFOReS5yz2*NT8QFq{;02s-j^ag7wy52`#ggRG@T
zetbE0^}ywgM7Om6(u$^87SpBzV<xe=39!L;K3JB9Ab@)w3luA=!!L2UDVy5gaGRzi
z5@QsqBMjQqeDs`S?90q_Xz(t5{D~Cfd&{_>%=2(e+V!2f89}Bcgev;FSmwu*I@Fg1
zx};`0%7opbjmQ$v53ge3gk6<&u^{m2+ECG8r-bVYB5^tC<9ht~S}&R@=c7&!AC*w^
z^SxJ`sxPAU+{J%1k?RUK>_XldNl0N>ly)F>nTG|^`(`|L$Bp6@x_v&zE>n?GUPa5#
zJr5DZ2b}cPYQ7zFO~I9<TkI+)Z<#h7BVj<MiSN@ZbP|m8RGjrC1SwgqgK4s675Am2
z7a(Nh{r#t4>ysdVncUX5MujMY608dO{&RxDE{~5sR#Bg;JJ};VpIW`?#YW5gme&`5
z0Lbgx)ZTCsfzW#Ek@qZil4oO1<6&f<HRGbtc;Ng!k^yi`_^u!H2QB9NMd_(GK-mXa
z(V8O~1=abKt2V^DXg0%{7$bWeWW}tF(mh;q<P!B}>D2I5m7*hq+U8c7TRp7V*84(Q
z@MPWlUg<H{ruV`oXYo7D(BZ_Yx3yc1RaL<H*>|<|8YNYiv_gCR@@jz|=iw9Qxu@N7
zZ83Ix`*ydM*$)>?3~_pO`J(WO8)iSIh^0$-Q??`KM+&>;7=0?ohh`OEW=?Z>ONdsK
z57ThXH$Cs&V^<HX%t_3gSoi(BA*{0WCF(-nl^qE%ms9cq|3^zN&=Mlq2=qmtEK3^2
zUYDS|_*j^8r>YwCJx+^rCrv0F$Eb}mm7o1q8?w{;IrA*6`tuOfLtPRe{5)PxpwF5o
zunIF)^_Qi;`Ylr0Q>n?foU_ChQ@BGE-g|eT_%W%1`2)fmIAxwT{w)3X@R!APCsv37
zo=*-X{q^p)i400m^Q)&w5nZu8XAbP0241@-2E~iuIvyO}Ol5t1n|L!#CFbrjICD0L
zj`ILF5kq|7Ob1jH(q1cdid5-H|H?H}JNc3+uKHCTwy;)F>CVy;3TeFOd6z^S2`~bn
z`uet;;P$@FRn8dxAp0mgIaC7IvLdYX0I6926gz~2#0>FVT~;C8*DGBg*}q))-cK>=
z0F}=LU(UO;K0N2aeHB%RzCg87^uFfp_c-(Qi^tDb_Q$?YU`mA)mY7*FbDT3)PL3qt
z_#Fh|R01d^06tSiuVEid)Pc~}$s@xe_RHf&U+ImT-*A!ie|b)IV*bth`8G7M3GTWg
zC<80hfI2UI>?`$RiXA)51+S&3JkGe2Py{7^@Pf&SYWW%kc6dfG4LCOnvNso#JjQ%(
z)jg@@Nw`?2txh<br`#8J^8B2(bP1m-N5|Xvo%fs%LC2HyLYJ^k-!#~Xv>)_^mg79%
zZ;ui9*~@p+j=@qjxFnW3xC$B3t?N$R_Uk{UoR4kVG$>_iiQj(wzQ7n_q@N^ZI|UL&
zb>CECVeGpJ#?f9{W^9cYhm}svGC?sj$|YR-F4LoZqRw&GI+WS{)-n{w^ODKoW7I3k
zK>aT@(t!J}N{GFQ)3)`Hc;;+^TKap*WBF_>eBWiGK7}Ddu><DlPvALlzLhi~4gbEV
za3Ll@hCn+>mtPHK5w#~BX<&70g8N13^S(}&3_f@;Hs36Ian0+aR9BJG{z+l#@~Pr>
z7Ab+Y*j`sxlW*UNZ1j1QD159NiHTR!QL(LacKQxv12}kPTsGD0<*8e4;&dw8GRID}
zOgdYCa&-%g;NgwH-g)0A2W<WEkqa)1en#cJ-37_Xj?lt!c@mhLA!a8$6N``X9BVcw
z<1@(0$^y)oGufwef<7+lv+?7%<08v9S_-W!M?p?j#D*$<mc9A|F~A8fe_&bWYvT56
zDxj*1(%gh_fPsz--<|7Wu4^J5WmmKkltH$rqfRe)n}BJ)({LD5BwOiuH?eI@6YJre
z)~Eek>TS&BS_8i+e<yS|wRRMk{$)6mTbyQ$b!hy$uCsw>iNfAgdT&?*gx<Hq-m4!-
zJm<H$&@#F%=kGO>g&7O*%OO2M#k&Z|a`i&KGSD7MLp}(j8zG0xz~1)TIB#qJ2ECdp
zI#WNUeD&9$Nt9n>(+$<$2|ll`s?8f&7^~fFxsV^_kGb~lsOgv}`%lUHd!D=KRTLNB
zArLl?@tG%8y{iAV9N2a5;=ZBB*rp|+?N3<asDT1j+Kew7p4)-l1g{B|JV1?w{YV_%
zJx(m=d}Ma>f~ntkk^<=M(^HT{(XHt9b7SNd7N$e-w<KGZjF)_JMMg+&`}=vsF|6G6
z<*0v+MKN>LFE$*Sv-p(zcS(j5Q7s}Llo9!LXNhr1l@J_^kGk#5dNa3$F|`Mv(B2%~
z=3a)q^*Xrv%<5y?SlcFQ;LIXJ1huM!q$A4>!$1^zq73YgMtMoE4isG|xm&xP+25-v
z^N@?!gxGa&Z@MiFlp|fVjYswJ(l%S*2|SLRA}QW-LyocE;#utvx85|eBBef>Mx`&N
zcYw#bwx^(#hN!5uS2Sz!#nzVR8%+vFTmfpZ^S8T*F?r{rzJ}DIZI6qzmBcnjmXdAn
zeL3&4SOlD@04l?6+Dnx43`v>YsHN_V*Tayho`V#wR&uD$beoGPOoGim=e)_GZ(8<_
z^c%Xcj_b%l(>pvMTQ$ZC&d86^GCTk<RnA6!-TX9aQqdJ7_Vz{+!IVirUh{c(ZJ#nd
zQu2s>y^;^BrB5>(^!Oy?Z(X#?^q7&9>&BlQml7-%?-iN@U#t^xo8mzG6m=Dw?amhG
z<|;u(#?^uJJpDqMM%OWm+sQBnBeyQ+{g!hK-QL>ud%L#g(biGPzN)89hy37{dI2|^
zgA}$lo*rsQg#pxVb<8?z>JmRvz0$D5d4dBt-4Q+|5Lu`p#{~gae^U<9`nnzCgik^;
z-Hu8LOs%7ir;2Zr>>!AblPO3P7n9@WtEPE(5KHrV+u7PJ@XEx4u@Ik-xcDf;BtvQ_
z^%}4(ZM+&9dq7NGm?9qjnl7P5*KhN*2gkPd<ONMIus}R^;So^CjJ+s5Y_2G98=q?X
z=Idtnu!B08HdzMEW}fal_h&a51W(Nvy8TNcccN4uU`kwTcGRDMLUD`|T(T3LVo>)L
zb52vY%>mgEkgYrMC?fjfH5W6qb>z#KFv){2FtT(|`rd?6N?Gp#g1qE%QvhR<isaWj
z(0)OS8e6?8hjGW6PLRY}jbjcx*GaWSb{p(gpu5)b+1uZ-V*nOpRY7;q!Mbi^coigj
zFfLKm%kBK?T7sF#<ooG!8T;R-RpyKvLn5u21RZj<o9J3TN9-?w3wf}!PMVsx(c;}U
z8An5OVs49#o^fJdq>uF?T*jSX>D2+09v4?Jvb<a0UK;PQE979io^^tFfpqeOW)!a>
zpL@t=&UW;#qv?c|e&Cbgvys~En@a7Uw9!B5-KfSr+mzZvgwEn766>ZY00t}Nyq>WN
z6Y;Jde^66!Rk63I0rF~U7uXB(dglm3<t&hvaz(7>yytm@fuR%Vb<LV(tjmdYw#JG<
zv-qod&6CbCH=b47k}ge<+uYFx{TFv9tX%50I34c$vl(cBu|D}mEKFDNVRNZ^T+1bA
zAspNmw04mbOuc*<y=A^NZfeS*_42kJJ{{EpV*9wFz5`}x!gd_wStPb?BJO9oXXEd=
zc6BBC8d?}lIbK`+p3ylZ$fZxT=V}7?o=^YD((;Xqh02~yKGa>G94BJTYfT?J9ldaO
z5W5BxgPOehoTTbB%G1UFvOh@gq=y)mCl`_hw@qJNIWnggli>7)5sR*9l)?#$O8Va0
z+BP(dtwb{^`CNLdM0Fr#`81DHjj!b8kFd9^FoHdZGS}*2C{SmWPQ0h3^GQuDG<z?H
zki05v=QiUD>l!tfe8LDnCl5Hg_;sM?J4uTYhi`HT6I+xPSf`HKSRA!He#EVuSoEr}
zYP5dOO0p2?_Uu=}5pV3Wpr!)F=Dfz|V)uEr!u8r1`JTEOL#X0+bF1Bw;^9oqd=6;d
zD!!y#9hxu3871=hW&DZi6iP$O(HdWA8L=^SJq;GcLv<vk=RQz>Qeyc7$|Sav_66<e
zU2}k}*U)t-%9@nfgc_aYz5&ko2N(}NBsn@Y?-BYUL2q|y7hmG_y*8o=NNI~_O>x;!
ztJc$Whi8$NDuK4$kh?rX;CA3>OKl%Hju=dZVT%j!TC29@Js24LmeQxO3(;U|x^b~@
zAj{g0nHx@1INcI&`2g5{%Se0D!CpNP;T`iy`}C61B%@R@u`;mPI)4uqBqI0rB9P8e
zk6iq#EiuDJpcY*F(9lmMtYt@f(QXMRpXvRneXlTjJMJQ+TUO@Mgy0Wp<V6&a(<~Tw
zAGQ>eYo!w!bj;}F?{>8LIDF^DPW0Vvs&NgjZhiPEqtvI-s_o7LR-P?sf=($tL9TAV
zDy={dAj%(fxA$l295eUQFZ2RMmeRMI93&T?f>e8pxq-w7!G`&kxBP*)!tuzet?BLc
zi_mLfcN=3Ypcz8QUa5$11<}j1(sE1UFL&jZUAi@miPj&kk#N85opiMBo2m>D76HW}
zv#wIP+N|>Xx7PWyajgTBILvJTsEMlSr>8S+lJ8dMyq+F4JyG+dZ8b<9wVT?*7h5M1
zHP+iC`T7_^rW;Da?Pt#@%ed)WF=%BGBjh-}`!d`uYEFl!HY{9_X-_XhXX5BmlkdR2
z28_rHlWhw=#me9y2nU&g*w(qcmD{F(U%RwNEz7Iu=t9hSsM5PYzOwvyR$<+uyLck2
zWDVj<+~tuL{Z<}g%I$h-TR6Fa)fmLOb~%`7VM{=_J!R?K%gVm)$NDq$GcdM<z^<d1
zorP7>vt2mA0e-f-d#5poFG3z778)Id?vXhcD5Aj$Scy>&6*XEQ_j>X$8C*8OZO)~F
zZ0pPG9lU#mS34S$V!-X$44)5aI>I*VDjIOyNyK+q5ydkgpPUZgoD4S-)YhoG{)p!E
zb5S~?sQqDzu9a7+OQE-LzEtglj}PPZsHeajt9KEO5{H$nB7|NY7V2HXU7Kzl>2>5{
z^kh;Nx>h0rsu{?bC0Lyq_l_}h0?q{#_|9@>f;Dq1%@UPy<Fp(>Alc+B&LUGrCxC-%
zkb7qP(TiDVM&RHm-5nOk02gEHa5e|SKHX5D$hMpy!c^gNyToai__wiOUmE>y%uzTI
zFn7|dSm)%v23d((OxO)$`gvyH@MiydZgAJL12L$#50FCX9!20yilagQ?2}W=#Bw*x
zvp!iYKIJVm9Vl@cD86<a|D#zym`+q@eTMRpA>GmE6*UfzmR4VGFOFHejB93}%|yr%
z>1-{7J#>N9i-%)vQ(=?V@fmcxid2xCuWKRRrtgNaxUrq5qXMoBX-?nG;w4sCZiwTu
znYGW>#C9N#NyBdrDjBRyr<;v?-xD9H<*b-y8P|kzc3*w|@MOxkVC&=wFHQ%GNx3U2
zvZ4Kf?9{$pH`LcY7?yn>Y#4$YXQWydyUw@@J*=Psipw7y4DG(v;-JFhH8V6cH~Dbt
zw_NY0UQW_p@KLw6>_Z4Wmc&-KwT^32E4f2W3~Cp@o`zOFlAWxG2-;%I2t3by`rUoO
zdS2N;a7Ae>{wp78QwcBP-PYMzY%+S`NU>FX?Qo5ftL?hxY?>>tbS4#BZ@RGWF*C_w
zFEH{9by@nWmKaO?xE4cr&x-0E`vKz0>28<=$D26O`C3rD;*`s-|8Y6jhW9oY|Bx@}
zL@b14MaXH*Jj+p@fyq6COs{mhW+elJDIlOs;VjOxnfOpOc)Y5Kug#Khje1u^bh-Ye
zpBA;YZi{fY^dr!4i@ecN&#;xV+t(!2QIijMHFj490OTsG<Kl(mH(AM_+U;nTpI$;+
z3i)q2J}dbqTe#G^d?ZcX`$)d4{#^|pJR`8~-O~4$@J^{>nG*4Ozj_?6%)q+D4bD0W
zHmKDU^Rmm`#m;z-+p0e2E8!)JgnF5dzS-oxy%z~(DG0K4u4-Qb7XOv9yM+==x-J^s
zwUs+a-nX)B9vjM9g-*+2`IWeM_Kx23eA=|-D;6+~@7cPVGmp$arxyoxHO=9gz{cv(
zFH=70+R+awEz8SnroFXYS<O0M-KEvLc&k|>#gIo^04be);B%*?lf4*{uv3Xt@Vi|R
zGojmobNeRRZj>7VY@Vq7oQ;(e5%kYKGL>8m+V}3gGiM$*JXIDR<2_VIf14SN2<7as
zZEu2o*Uoe~`0h%zz+b%;$lx{;39PQjk|%Sm_R1KCWCk5TN`1xSGw8p0wr%wcp2!Vd
zae{}N4#4ho((R<V9LY(UM_NDK_PweY&3LTW`Yprt-7p_EqN*elttPtfa)zXU`=m!#
zsjdK|ZvARjm%o>xG~b;oZ{xWQqgo-;R@^#GA3421tq0nNRSGbkE;)9vA$5jZweB|a
z)>KQWhDsNa_-nyuyH0JEAC0DZznOisF=9Wz1%+aH;8oaB!N{Y<z{$gfn<YsxHv7h{
zwMPq?YM^c<FeIsf;#uCx-9G5pq`Iz2JsR|U%Jmb^24szFrD5TV{3#?=X%y0KBE=AP
zT~V72x|Fhjg!Ik6+qtzy{Q5(8D5Y*YSp))R`RWPR!Qe}5s_x;zu9RN=?jmW?@?A~C
zq~26dm;F-)(u$3y&IPS^AeVIfjmgLD0S#slN5@KJbx&(+I3>xpf~PKUp6!XDuDO?~
zVd3!$cXzQf)gm1iDg$hX01t{Mnbmw9mxes}QiP@@lp)#2z4oCrOLZJ94GcPlT(|K1
zdYWg=032F1u?!n#OX7WgO{;fVma()ndNE?q+fa14FMH94+wI~aaIS5|MW#N)%(EjZ
z*QhHcwnsCErrtJG>nS<xV<qSo*rlX^cGh%Z%LLIwLu(!hKk!y?Phw-=@)V=L>)*Yo
zFuKrWn;FSDbFXiBjh8cd=SP}6(`c-^w(r#S{0n^vOOu||5mAmy&it)Xk1o{h4)$K1
zC>JsWikvh6OU1`}&x7e>isL>Wdan#bp@+FiGOV_x+)72ffRu7sG6%roT%}uUTj(L;
zwTDn&%{%$>zL;jpM+KMwwtI3``#>@$v7ePb2lbwx*=)aw<Thk(D@pC`Tek*1a}q#n
zr!MijQge*yhYi)kNyJoAa$%#_k;pp<%sJ!6Wo<hQK=pVqLBa|<cd2%Fn)8&pzIQh`
zd3?(HxcBf};-J`Zr{i3UZr;_+r`<QTbh&pW8x~V*>7T$4@JZ6IJWi0_rh1mixqzj{
zRv^A@5g&~;mc8(1TI`WtW(T+S5|tR7a5l>_ZKf;P6n?V|-vW<!o!o#g(GHS9J%a;0
z*JLvce#nHU1akDk*8H_xKrKS0A`lu=rcFW|YD3~Oe9$Y3Faa(o+?vve4_+JDY-o8g
z#i}#jCp`cZtO#i4BR${9JA7|s@06*qKt%3V&6RshG~BT+Z{|C8KM@~-P3>`K-@?@6
z4ayCyJQP9O`V6a`EQ^|_?3MR>F*=JGi*?vEGI;c39m`?_GUkTaovq~6(_<P71ihiM
zGp0}#iF(aoxQDRjIncaqM-Wlgc7ydqO+evD&sEAKK9wfUdiYq+^^Wk@1?i`uTBDlU
z8B=oZT%a1{wt`MVYjx#8(lAGYdPtg&%2y1J8=LMnZHBLX&1%jDuHpiyc~QYL=GyVN
z{RhyH`L_sU@sCcpMfiZ5rFjcX3Wv;pgDJo$=zcv-#9;&~-#f3Dah;gIC0{Gs>&=p0
zl!L^b4LyK}It_JO;PA(|vPf^zpis^s21fma^9rqLj2j!3*HPvd2K=z=pK)J&aPl=?
zrQk#@b=dsWhxeyC{Bzm^7pQt&NL@mcWzgnfttVmza-m{SOdDItdnG|tsEWORi*pNc
z_d~vEizrAh?Hbm@?lVtLZ@REgn41mVld$VB_agW~L_HP6QL%J|Ss{W;DP>{Q*g%fC
zgs+lz$G*2}`?K+-LU!~lsdv~suX|DH`}UT)?uP2eCD9W>_e}elCCby2WXd~bYhkP~
z`z1on(U8)r2D-&0veOp-L%Dd5MmDNt#GZ~H+OFhYJ(cyP@<LU*D?yeXXdE#z>v2R@
z$rHVpXvv;^h8z;;6)c12SV)-*{AZ<rC;XYOaK=y#`t?VlOO5AMFH;1<dp^cFnvY)P
zR9;<n?YyPUxSHLkiy#rtAYkaLSTEbUu@=&Bmsd=?g|D{IjS{pf`0z3l+}kYXUCSoN
z3X9#yb=?rsge>V0#Ko&!1XN%W?X^oehU3#T9MH`3)xA&Re&|_RvW4)Ls>loKTd3o*
z;4d>Zk$$&{pyC4)c~I-OAnEPzFPI93zWg}lH@4d!BP!bK(x3Jz?<ghaRP%dehN#tQ
zqJI!C#(*ZPF7ddv8=q6TPnrsK_w&29-GewOH`qhJYUxx(%M+ETSvO8=b`e3>m9K_r
z8MTo(rOdNwGk^}amOzxyz!^zr2(c6QCSu;ZbnlIOuo!9JO`19l!n;69*|qjkRc#Rd
zOMhx}J<f}a*3iT<o;d+UC3uIfPJC-L=F@ENt>hZs1F#hO*;WV(Q0ekHLs{@FeRd7u
zoeo)p@r6^bT(vbmP9}lWMWy*lotwT7QB+v>^p8Fr%}&fu!Yv_}C{IZe#p_wP1P*tS
z#}768u35~~Dxz|hv*xZqHHnG}W#C@X!lX)A9S1D1+iU)a6?-yf$g5+7aW-(PVY2cA
z<NtUgiCLTjO{3xp4MSYOppI^-qJs(AW5l>-*)dA9b=|*A4a(7<iK91ln+=AE6VmSM
z&EwXDd1Z3y6UI`@!Chy8N1eMB_s<G<$t7n~43<(SJ!`p;Oub$B?lRnUpkCPp)-hjo
zy6m&oFJl4f+02mwrNg*sQ&P~vEUMm_OkJCANF<m0he*ZM$*Ei~-BW$GBrY_3pPYo1
zd^Cf9+>>SKd(&Nga;Fvm4>0aqr(U77K1KT>Ds@|=C@O|~VscCnSejp*Yv6TA%!WSg
zr@%7D7d#sXPUu&IbQr^KqDXqZqVrL+D{2>^V+q%h0@ZHhWzJLa?Ttx%nc0eD$*SIb
zJskY>$B0+_q`?EO?ewoI=Uk-73Vpej-V{+jSfT*;YTlL;kt3VCLo~p%$gD)fshpAN
z0tJ7Gzux-Iv8`<^;$f@58}^XN#@h8vQJyX4yeMG+67w62sX1}+7=8^?yIM`Nj`m`>
zDkO3jdXmN~UK|xo)RWS;A1=|tMs<S8NbqozE7ArfxTp5)3|3VckkcM^z-9yd*6tRs
zm!-35D>=F0idknjA%*&i9!T6PAz4m&c~LGE5BZD7H)Ia83C)Y;4b7rjQZ^P-XPz3F
zPP)kq^wARb&dp2~m#E=@d?`ozj~2Q_oMO2qFyfqZ85W<TTaTmr<xms22V+<R#n|}e
zlNjrvXT}MKh4R{}bz?ZF;ba-KdcbK`Xl4it&eEYjD!MJh*9uu9+F~b354p4=Ik^7a
zJHZD96qdajbXLIl*`*X<x4WZ)KHYc0_tY=T-iQS?oy73h9o&|L3N3=4rh_`Dd%>|V
zGQ&=ceV*=TYI@`&bYg^-l_5Q}pq4HHV~c`H^X2<7^fcNgV6`LVlSm>KJ2YGp^@?&9
zL;8(5eZ{}^P+GFBc?L^3EMZ@imbPBnr@i`J%>VInlGaq#mqs%Pq2#O)_pCmTw`+W|
z+v#z<CqaCi*03Ga4gJw<HFoFVLI|j*A8;&~Y^|uJ+;V4LV6D@`cfw=k_?zl0YBty4
zrEvCu>UPhfrMC#W;h=q7o_TTa73MbI81I;A@8}S%>xG<=Wxi*5EMD^gc`PjS$G)A)
zxPLY@Q0pM}F$ri(q8c$w=}&)8IBU_0#q!`dSHu_Z7ZwV9d&{-Q><#@W5Xb`Ewa6#+
z&ZtHrHFY>kgTMcX%IRd0kN}eZimN^ZeX$rROXJt9-nt-TA>7PcR*}E5nD6q%kx=*E
z;<mleGIUDkwcANP=jXScMHYmduy>JEX<tKp+_xe7FG`=VLJR$PPs7B)BS@=wd4-Va
zlEsWKGjW|T1k?a6z+A8GJk<AqP3B?%O53_rM|Ww_#4!}-jDi7y{VlzOnt(&)3!o$n
z&s@p9>YfMMf?Sg3$l~?AyKi^2A}5O8!`R{#)h#`}ZC0vhcbDmbY<mU{H-T~rV;XPg
zDGwa&$T^c^L;LTIH&9+sxv<K_c}!Zg_tojd2goj4CNup3<lAvYV$13pIPr$zc4wyQ
zSL28qSY7_k^xh)Etgooua>|a<g3K(_%lCI5eqC=la->>F+MDi0d8mhf{1`oI%+-}5
zKK9M4DOJ1_I{AFsSsZzF;3c<<myNi>;yLB-AMb3xiE)aB4%-YDJ%CFG?IeAqZEupa
zHtl0L3@W9Wyx!_pBuDsoQ)MxBmOepP;@y+Bc$9;-t1SraFco1bAGVSrtk}#l?Thy8
z?H%3q&H1#!c9u?%z?5e1W9(NoU};5pIprCNT@vK$wfEUJaODz<lgu!yR$r$5rx4E6
zbL%h$ONA0H3$(jof+YMCVFa#)<p?1>8F2x##8WCM`ee;fJ2U1=sIOTNTTDwh66yr~
zAXhOvc&GN@Q1*EUbL^*A@6L^VJ5(=e(CDiJ?@#)xz-<dwB!{mp!paO{bP2>hSs3mn
zpF7YNjVMgj5$@U88e@(av~TVMo1>unCt4(}%a1GTdIsC?ry5nRs|6(-K^@98cvgF;
z?-%DRi&9la>n)m>GaiJoQ7yQrmKC2c&VZ3?Vv)w@#@^!2$&2c?PsEuzcaWpw%2$km
zs9h86Dyrc&;tJF{md`X`_&&Xzs?2039fE1`Sa)yIv%TGPVsXczaBOJU4CQgYsL-yk
zUZ!|KQLg+*au<yAO6HRii@|{-_INAgB@DQa%j@k17}C89xGP36UFQuJdudP8cuR^l
zBNCYC%!ioU#T@F*BpE&kw5gD<^$Q~_2b4dp>Kf1s-eo2<f9E<T;aV9{@Hx+0u~geb
z_{ZatgZ1eFzFt2C?<2~Ti{xfwAB}AZMrpFVK27$>9pyF^q(Eifc)+jub6**`<ln=8
zE@aD9;NA_QFO6aZk&oT;Am2$FTb}YCWhW)w2{r{PJ_no9v|FT_(@;Gm`fftn{KTZ2
zTw`T~;1$h<S0hhm&OO*Q=Gwt9e!X;yWUsxvQQPc_2#ejrk&bT8ChgZnL^Uj{;U%0B
zTq<hH9-BhL*<1k&(b-;0!eY-jhAq}|61hI>y+zyt%cH}g*L8D@nNy&`y5Q2?M>XcG
zc(N4X0o>_?x3{O01S?7|9@*h%5~o7#OBHy7Jysde7He-1>|kZ|*}u@2idfjEXv8~j
zDd{mSTNJLo7k1md3dVM`LBE^Na)2M81E3dml}ZyVxX%Q#{1mw6_P9Eb5-%I@{ke(#
zwGJKa8n2#k-mGktQ;@YWTVqA1fWT%&MKZV0!62Y=V<_TdO-0L?o{dtGy}G^r(0D=#
zl`}rG*bBiQSerq7QTxj_W@KdN;8xMEZawI@`dX+_3S9T;@wL}aA3VA~acfyMh2bh5
z9{vMTN;kGG$JNGL5AW;hz88tk#)Oh681bDCjHQX}FtH$D6{5*+3?<v`mL`_@OvWM_
zI&srEu;ag7yvGtK7BGzC5#jNX)({VDoZ38v-kiZNb#pmI&k?YS(o{EgkSRFuIS0nl
zM^2dh;TA>pgE@j&de;$;<qrqhdKFZ^{ru43_h0<HaCCU#3$znUzg^X+d?tq!pN~|c
zpybujDX49A{@hfp`YCz<^KV1|QW=z-@>|*d=4F=3)>Bame-buFASGJ$VLXehfe#PA
zG5N{Sp`*6myC>D>xG2lw90zy#OXAM`+t&eP{iU<s$I(lkepeT@kNTIMTv{RE{qFws
z0v>4#AE|aXlkTE1Cmyqjp)`6>@^3rqSO3M*|G9_GI_Ix<2Bv|bE2fv!Snnsmqj_aI
zqR!fL8WR<xEd3tZt%1U93;*kI{F2ahp5z(m=HGQ0s3-6*T?V5!&{$8p00{Aa{}HPZ
z>SsQzrgFc+jvQB=3sV;z5f%?dDNLFSk^TCxdK7y{zU`X2D2-bnrL6qz>$F<$bmeKa
z-`U91>b&!mrv<$Wlc&{vmn=`K_by+aR{veKJgvbH>wL65-h}`fqKfiQ-fx!b`Ilaq
zTzXNF{E@%<c20yq&F$t0fx6qX5d!tM@goHqZ?i@UG~bqs6llF|9x2eC*UooelY(Ow
z@4J3dmdi{ktj94`(@l=BS+w5HVYo=EQhQR*t-U}(dlJ5Uk`bI(E>UsrCV~IWk++tC
z{wMU_9vh9<UW{5i>gtnJHcUYZxnYJ3H9eFKlaT^$mdl+(h<vanCfDKVWD>IRTQQqQ
zqOeDzyhoyxY>5t0>N>fj%Cd;z%_&Jchvmz`8OoFVZtX)s`6QauOg1=;^T2FVR~vep
z>1XcNPo;3*!Nt3T|7WZ5XRTK8IxLS3Mdj0Lism{fPo^M+-K>{;hZuUt#*6C^VW8B|
zfBE<-deP_8tJ7;x<+&o|x%T};WQdRiJ09LEQwsL*1B?i<1k0-!UR4K7va*Fp?C3))
z%Kv!LZD(dhDVUlx+S1K#CBk18maP2eTX44zlg#Jv`0$$f)Ugf6^fj*oiD>9a@_N?X
z{!7z8#Z!~mCp`bX{orJ)KeRv6$oIak*Uro@_2q|2{wuHU1A2@X^s4KXpE>rG)x{4=
zm959UJ?sLhOYmRsLgxK$SG+8&8@SzJ$MS~@>F)P>gv0;oW!7=xA12Qc<KY1YNGILT
zy7EQnt2;zF0+rK$>?6}H+MGTRMC32c|5M;!yXRMrd5^TjI<yPnHQXm{F)`d@EzG!2
zjo;y(8jqbQ5KQgx{m<j@hq3zA<iCuIHD!#DMD96YuxS)H=T+^lvD4m1`6Nsf0|Nfk
z9shjZzrXnV;g%M0`Y>8e_KFYhLSw?4{qkecV4H@U%I8wkcv9sZ&L$IQD$R8DALbNi
z>K?rI4?q9wjIf|IXH8AoH{Dkj1E!cq7jIWinw{Cgr+MrO<KSu<kqHgaD;oAi=~Njw
zjV$~5l62&8X2=<Oa(R9OqYZ$-_<T+PfyK&(sYre|^W`=GG2^)osYv_f=zNLX=&6>n
zCFKc8F2}CNli8w9Tcv43++LKTr`hXlJu0?%!TvXioX0pt{LJ9z8^WLA9q7Q4l^m7_
zhd$;jX(r|tKmCbxdjN=t-+*|A^l{Nx8D~vg64G)xAz%MDVHNo~jw}JFu(-<k(yNO7
zqE4HDq>B(rj?<yK599n-@c2pbAE>CW-a85lYU<;~a~q#rI<2*LST+N`mPFxb5x4On
zdrh4`i<HP+PeT6oQfF#lJp~C~hAOv=J^bUxoIZe((K8&9Uf@^9ogkv#U6#LpZLVvL
zy)?DMfu$yF_5XU2G}*GsZY9cJ6E>>c?O^6{Hnna8iZS43-ktugeGe+a$5mJRyRCh9
zL`DCn*|k*m3#aLJW|J=efTx*?2%K>f?&dX_q}-jOY&W?21`m&h$SkQK!_P*JJcQ+a
z`K{?Rqs0F>k^XgR{prpxrPa&MXyg9kJRZ>nKD*mlA&0yR1T0psP7b;pGv-|l|MX9P
z0NsDrl#!z?z~lF@qvcT3n{r5oR6JlPD4^fdR(Fh(1+9G<bMY>ow+!_C_M3<S!J%Ud
zN|!5@!~aqL{`nDhe|0qIP#HSf;w$pwtrejx9^Os7mU3x7_%$Q}U%+wI<U@DLQDqC!
z*#Gwnb5Z`qRM6mRKfx;syZ{rW%=Z<iZTDvwALYJsDRl5%c=qS6axD!z^ceWeZnU7C
z{(l*#E2AxY9qecy9nr^?aV&Udz~1EdJ}nEXT>d2pG85lp&F{uj3B2>=%C)szOr76F
ze{7ad{ANCLd7l2X#(z-&B7k{i(DXRN=$S4+4;AI>YvLfORUbz4ui!CL;58=YK|q_T
zq;p{|3=LK8TZz10l)St@RRhrYPu0Ln-Zk!gredBNCIR-|2G9j(D&{9JQ;{NW_RAH&
zDVTp~o1Yl%17wVUzVhlOg?!^XuC$&bN*9g(%U>sv_cmq}eR-<crX;yI+(IhCdK_Qs
zS9$8HEMK;#O#L*U8-1c|$Cx0RMW(4Z-m+j>{Zs7#>g^}Num+UcnZ$q4fOUR1ri!pc
zA&FaOHl2pO;G`~{F;X7j^;Rkv%m2Zm|9M9J-F%0n-Wyy^BEX}-Gf84^VmzX6K6mb}
z$u#O@&i(%|w!n;ViskL>VHY25sqI+%vsLzjhbecSQTpcl6ytZ$o~HxZBKO5FznJuR
zy&adT{1ZzLJt$LS=F5@Y?AbM8Juu*kaeuhlGhuxB%xEo*{QUOc%$oE+0K!MwlDB*E
z+<fWc%?qQ|lP#mlY5(uw_#InclqCTsj}I{U`;l7FGG)EIZi27uMxlq@XXNL1>-<+H
z^7j@Oc#jqKQU`#tK!0Jp!!8?48RL3p(Fx3MDiml$%aoeEqy;!OdUElM=lsq#{;EOH
z$`+G<BrRvZA7DN1`x^?7ovQ2u3^t%|2?E{}$(*(!Ke3)yYiM8lgX;hPqe}*=!vG&~
z=*-!n`0(t`XT*XkH0uQ&-eGDcBz0Wm$~e2(_(QwYP<u+aJxjUrwj6)}^L<4z02!6@
zXSlaBN?_{x2iZO|!QeA4{2RO#Q7ym>$z2zAOB`=eMKYw}k-k>D2DKRwb~ue{bve(>
zcd>T->-;RI=uZHh{jbL=nxV$6TzM|r-s~sZ$Jp7)ySkh;Dp3_-d$Epys3atxo9S=n
zfB$LPk($bQ%N(E%emBcqLsFGtsX`KW&fg3+z1eX`8a<<Gr_4Nzw}AN=W8^Z9?5p_w
z>CW5)#p#EP2kate`b5KHDRrdwOaq|8dcOQqz3}~1FCYJ`UX1F)GKBy)geLeLjr+S-
zEkM9)y{7}e+-8=y-hC3WQfw&dJ~`rMjwv#%be|mipP2R^kj_xEKH?Um>;sSzvY*Ud
zt!Gbj{Pt6VH?Yj%`iXzTlK(o(wo_m3!zZ+@f9V|c3Z&hyXPFjpdR%5siI;^J?l1AZ
z>!fg$)8{q)O+%#jJfKJZ;!jA7w(PK0uKYW2WXCB_$T-*Z{@o0QDNBABeLxJn2tL1h
z4&j!g9i763ZIA7^`f4rfzq%~NkVz?#%Ku4q{PS5(?7ziYwLiprg-6kB0QmunOqQr1
zTAE;1b@*%Rml@puiF>PG{qo<*!!|rj3CTcl4tNEkIISbj)L`Qa?{BuViT)eUYxTGL
z|3<eQ{;T_A_YH79*zwK-q$EUxum02w9T55g-zRasgY}Go{Gvx^ZXTRB^`7tCr+Mmm
zE6TFzpCk3(U*V@+aTIZib7&XAYr0QyL0{I3{>(?ve|5*CtV;pM_IFfg)bW>>RvHG0
zRZjEKJyBB;aoU6*RY-PzW>-ORR}M!NIoP?G7wT6aEzdq=0HtmVQvh7fYZt)Ic901_
z^DCr8<L4b7CP+ax&(PcSXYy|Ole`1ySDq9Gz~6EPetS<nm1Qb>%D9mE4-Nw&{J>lW
z$am%Z7n?JRkseZ<S#qR0sgwdJFN#35YunE*ai2t8Cr)KJ$2-F}vsurS`I`#@1Oe)c
zS26MV61ywW#{g3=&aXLR>AxB60g>2<im=aL00r|rHOWW+A0h!O|I>+iIw|4?RQ6U(
zVW2xl+Kfkf<H=&nq#t}Rpp@zUYO-|oFOS3gr!(`D{ucw3rt-IdK>LtXZtv8?UG`GZ
z*t)P)WeZ0ZZ_3fsj=$bIu0P`p?B@YPLPO9w6H|2U<SyP+?e~oFUx59ChWIPi|1hin
z#r;e$Of<y(^gIDdLJ&Y>Rj@ccHd2;Fbepqle$;LBe-!Z7N%$8zfFXZWhR=*=a+ApH
znfJ+atvwq&**Bb({}=D(mp9{1S(f@o2WNHb%qw^VIR6*;yS4i2%iz{>SJbo<y8gmj
z{te*%>B;>2egc^KqcU?A;Q511OKzNWJeh%=|JsvUTy6LV1^U0B>@WTDdsyaptcA7b
zGBH32Z-$N{agKH$TyLMxz6sdz|Fi#R_Sen<ygzr!!>Ka?DuB0)7hLp=i0sEn#Et^d
zFy6`jr<#esQOmzz{g2N1<DCxnT{!@9r9S$M^A?nG^$AP>)Y(tHClyoD>CRD{KSvQ6
zHby9N+HyZlYWQ3vSk%}7!1T|s**_frv(VemAlYw@|8Jc9r>h+OJ7^f{!i=`rjf@iF
zkn)b-=556C^?@Hx3fJFSameGn2ErIpv4LNwX&#M?QSsHE^i<Yzi~iIdL4RW4ze0Rx
z5rv9BBQi&HAY!Ve>kQvZ%C%=P2EW3Z52H#z9GUdtgQsf?U74VQ^Cc`~ucSQZx(*kI
z*ioL9)%g)WzreZ0$;blbT51<f9Yolo*%S~92+pU^bx1<mEa&E@?yeMwI62`g>m5d6
zzsDH<==A@L0epB)2?Y3V0}SyMO|H%M5jZuFKlIF<1+3HmGM)bXH+6R3e12#7zk*98
zVSpC=@^c-5HGWpLXb^wN3~#h_-x<mCcVqicyZK)(eg&D10qb;TU;$^K<u)Ytc*B~C
z0B(KZE3!yMbPFM-^{<})fH`2a-f1NQ2L3NE@F(}vPs9l&?cTQVY%)a|I?|$uWVi;H
z*at)|tp^@x&3;wD#x?^s?q9Xt|9Iygp~0V+Tm`tgkOURrmigZdcEhS_zrK8q=>Kc)
z%EM|}zyEHKE~N-{g(BDNRz$ApWS+{DdH7Z`Wr}OMhB{?vaFMPlg^ZDFXh7t08dNT!
z5*j4KjZidcJi~9j@7`yhvEg*~`Q!IIJ^OidI<oEF^A4Z&S)cV;Bi+|36NP8uARdUA
zan|cGS~G1sdgSD87XN(DHR|d3n_AA0A8CdcU&@R7QbX=ti|o7hY6Gc1cLQgRZ&mh#
zUvdt(5GW3hSh<w{;8g6E!Ni-0lfQp*{_U#xr|mvyeQ-@ZyP^1kr{@B!eE(&itcVA|
z=k^+#WzF?nWVFzdcy0G-wCmzl_k53;=fNU9byN?1>3lRQkBq{lVDfQ^n3$r*SCL2W
zCjhpY**_6objHR8J{Xq4H_o1UI<D=yqUEL!@BR1nhTTH8{~_;t<Voy`u|FKm!(i>-
zu(MqY3!FTdr9*$jE}}CX!hv}IA!`iG?}XOa<}Cl>o>uUmmW`42PDk5<r4Lz_9X&^0
z1`aW8nAd&Zc4c-2!}^&#p13H*I=u82W&?+sLyUpa2x7DXd2b=f7iF8%f73<R_uEf@
zD6?A#G~<?_=%jQvHv@BgL;>uvotcW5c29J~K2q$6lKY{cPbdG>MuZO_sL|@p+RchM
zI#Nrms66N?EGQth#&CRD&!kD8`l$qJ9j$^i%N97Hgmde!%P&gCm+QFyMr8hTvLu)a
z_~qTMHLv@i25d5CZ+>|SEP6i7tt54Vu+V>SiO)^lo6?2oqP?DCFqH{ofk+eBbtKbv
z@izM=ciH&Rn-$SNzbo;^{dpA&1r&*}f(BVCv6-NqZ2L19BVR=9_&9wztjAt_CS|Bv
z(MP*M30F6zUfxhX@AZ7?9giAfF>0_5P9#6R`+<!pu+*|K9XxYyQH}XgTgQ3PYWXWt
zeC=`IN8x?EqsjX~;34(yh1IdCY;%d<9N`;OnHvqe;b1lRMNBhhyj|^(&URk^lV>l-
zk$z)?_Y}YEzIaVn(I4sE-*{&|c)zsrmlN<MsmOBJZu_9Q|L9tOJ+LF^{nFd><}6!u
zeACjGN9Mg+wkQaCjqZ2L$#}JY-j*lPtTpd(eh@?h+E2SZp8X%s@Xv#4X|IXgMdLl#
zcS5(@QVSR1@&mVgTS3G>6|H(hSnlq9T?hC6JlE;B&_9>bj6cpCtO&|Ky=F12J(B)M
zXu~c0!Q{Y`25S0%)BpSLdq@6*Hrm#aMEaT@5A9$hAgM-R9#MubH7MgWkd<i3!=835
z@BFU_9>7*0T>BDPi$OSR!P{m47~P5>c0<%ZGa*sn*Cpjr$7yqpu}4Tm`>S5z0KT@V
zHhuG=+IYI*KvBLP**XSg>!uZ-<NB}B-`0*WOZny59qE8vE_;<_cVdNg@u%~G)Qivm
ztqt@=NBY7ie@jhY+tKuv!6RRu^|>>7d;U{PThyEV>}vEOJMJH^-7-<qON0PwA+l=w
z74eyWZ&2~Uwao_-F@*MmG5t=kT_VG-s8<%BeK!;xdNTKx`wNL}Ed|!8XY#s<y^-8~
z+YJ<z8=$CM$GKhU@|T~Jrl>n=4iWrLQ*UzrBRLE3zHfmzuSf5~XCr+9m82kWrG02q
z<(xq+gJ%&fI*fqi2p*GiyX5;qnosios%3FX4O!}o?wxyWSq;hw51V!U+yx0~7yfkq
ztabX_(AYU>FOeTj(6N}D--P_wBXY*{2&xp^&0k_*y?zy@h0*7+thqJB{zUxjQPDde
zf{TWk=`b7js;cGnq?^YKN*#+s{%{=fyD#9+Kor2zJ3^jo|DvdZ=%ugRZu#0}p-36g
ze7>&<@Gxm+Xb{zGSd>@QP63skCj$dIBS@kGij%uxS5U>Dd+O+8lW<>cbSw|D90`nL
zQc1*XoHgjQ#=rnL$F*PXuX+E=lU4@^?U97fk8V3t*v|9go?P(Y<wbEy$fH|G+2Q5h
zNtk~mS8{4l0E#$(^dqAJI=vvwUBDLe-Sz!n%e=LST>yl<C%uEd)GPaZS?h6oL)A08
z9A`4CcpL{DkjoUNGf+MgVjT24Mb;hgV-6tLy7;fP2v{SE`rfgU9!IB5X!h3Hb%@~6
z8pXo$bGZ+!tL<LzIQsmHqzoWqmt99PVW+h-AauLn<+zrKT}@k*d{E@LmB=(oho1#F
z^3=qk?ev_QbNkP<w9zh!RVcE}L@7+^8{@a`zJ|DV^$erkXDt3`SFHZSg*P*Q(ZVrj
z)YvT&_Y8O2_2=5Qt(OHQ4Qtc??r-tOH(jywx%pH0pe`@FKgilWH%Nb#!QwTeL~m}4
zviqmAGv}Xdx3uW3M%xUz!+1#-pLbgwe0%v1`w54h`qh*qus_V3ek3*H@#9V-2Hq7|
zXsm9Pp&m9h=BP(I$38JHJ=XXbPw2b&XzQE%ZZ944tJ&tCQy>4zt@fXf2}o^Xz)u;R
zz}6i{5ZNY0dM(4u;=0C-%J~KU6u)}M^^TiV+7td1UESl*HBQfVw;g>gYQ6cHSwgFo
zFt+-{W%Vx(nSJ~Irp8;OJ@dfWxnt&D`tQ#$AL`m0Hpy$&Zgd^ld|vx+d<AKXF5`Q>
z$7G<(H_X7PN8FU%IeuZ|v#|WkLMPIyvf6rcvmSmP;b#xtdzQAO@19O+7QG54I8Btg
zTHg-5-R91L<W0M;nQiJ6{`KLa@kK-ade!>gf%&7~TzsihX;-<w@=2v`mEf@8uVqP^
z1jO0#7I%!<t7}>~svk5z_Rp&74!^NAdHZj6tL`w5y_@G>KK`}IR<<VJzjFM4Cdb)H
zalg3j&tUy7(B_*}`Q@`B1lj^Ko?j(r)sYkT$2BvZL`>K4>1s1mt@;V!Hxo%`09knb
zJKma~3_YMUO@moWU!`{#Y12(@|Dyhv2F7_z(CFIAXPBwF=LF5JZG3D^M|mFLu`dn$
z-BVku>(4$bOd~wCn|JNx^M`4P=e3hhE)DFu^PzUvZa#-i7w_bseCxjwX+n_bWZ<jB
z;EeOrEj-+LCpaP3{oC%l<e2nmTy+PRSUGCFYfEpuOr0@dvXqJq3BpqPX2CxfD#Lt@
zhouz;XalP747k`_kQFmpbK}>eH4e`~ITtY^MqRD1X8x*|+H<=(9`RVJ{_>}}J#EN)
z?$7Iq#9~s)Hc*$n%<56yK}@knhShO|PHB243&A7()_T0WNy6vaxcbJqm$LVGs2ja`
z(~MQ}6l}v6_=Jl8zne$&+G48-!iJGL_G^uUSe8>Qv}3lsa&iA0cnb^WI@Qd%cvV_r
zh&62m^E<|V(LOw0uA(inZF7-4FMrFf@sAM60rTm@jeV?Jopw1Ayy|%^u6(8*GG%VX
z9w`OfY@>(=2M2mt^dI98nS5}QS6{0o7rIQ=rHB4%yQ}%4UlG)j_<w-SSfkyh56@Q5
z`6;<$$-GAu+WY34k&?T_a+h@Rk)?+x>3?qW|Ke5RLD65NM8}%twOT_!)=2y5%zGp6
z3Ko0j-BC+Uo>KjIpc^Gc+;(-;BnRsMllWZnBmcWP(6!gL$?_DNVM*$b(QLrO%rWkm
z_ALYCg_=7vro1Z;-hXsRXOC|~C%=9*P;5jqtzEO^{xZ(jKe&j7<v*=?=VH1xo82qS
zR&8^O6{}|V4x8zDv&A*zzAjr<U^P}juPrr#$aiU<JuC)z?zkeF9H+zWbymtMEPY;|
zcGl}F8WwR;>8o$<ur%?cUU4@TD&U2q^|{~88uRx5Yo9|bTh^Sv%}z8#+phK-EBa1M
z9Gf3`@c5DBo=fGbHp7x4wvq!@@LkLMhA_0gyp^A>ZfZZ3_=gt~8@x*H(@Se_^E12j
zyeTbL#S1;7rZ4#yuXK+J{|m1#_Wa~grjy~n*!sN4VO4eDtONZv*seXe=fKsC`$C<o
z0}~Eh-Mspav&7Qw@O35H5X62vN&~#D{rZb|GfBzQ0veD6!=v+xyl1O($~0qwtliSf
z<bKNZ+!cFKmnIk%Y|h%E36Z-%u?#`uwJ#1?ZFO38J<Z|wf7S5+fnIy^UX<O5^<UQf
z7sL<5FMPqd(aWgg7#lWk>6Opo`;EL&kR2C!@4zMk9Qg_$0FAWoL|1Pa)I9hXZ5uUK
z;2YCzyYh9<TKhEMh0(p(eBE)b7Tb2E8t;4KSf+K(TJ+W;R~RAZ4lqKHMTiT|G_pOS
zW9l$MZ{R(7^Fw^%i+u|6hK7<6^VY7zGBSeL6*jlbwOre<rAK_>OQy#Ewd46rOEp;3
zyDa9Vb0Q{Yv{u`(W9!Oo^475QDxfv#wad!Ga&-@g^p9Ns{joFuB}(#27d#i=ZtD2;
z>-npc_gavsBM*sl?f4H99WO5-s!FOt8Ja&UHo*J=`V|q#sgH_#%+@rY)gJ^UI~4u^
zY7^dvIaq^E5R&Cckg@28>*^L-&0D89uoe9b=nq5sMOMz+36Z0_;w2pYB{xH79~Wtp
z-UR+n-jO5yujMT&$)9O&4cesF+BQanW5%T2MOy_4aYWnKF2t5^Wz!q+Dev3=_U#kz
zyt{eNOX5qOmpm@XE=ejedDRc=pFllt6msi>-<mX{z|vy}zvN$MEY(DEP0_XTi|n=R
zi|mC%w|-t!D#cRY?8tvr1N!Wlq_r+6YS-)Z1hMNyy6p8NUG_Q|I@Eqk$T!=ZS3BWT
zJ);(5qaPo3eCMyw7od6GFCAiRlUa9!KXN=eP|kHcTIw3I-5}h$wd5cE-|dFs0U<OU
z147&?=Xf<6)vO@<6???dhGviJ$fxA2UOX{!G?2DN+M|wNW8XQRIY-k}?NGLI@<lRn
z0y0RRT}KyTwZ)-$lZCywv(Uk~r5;A2PIg5^nheEh*Zl+mS<%Aup?{PI>+Bh`)FV22
zN9oe4TRZx)lpLYdNR)enLpR1oyL2~u{mqmbZAa(FfeeiMal5jczI4ubYjnl;HCI-n
zoUsWr8LMU1;depT0DLJ@ofym-A$SxP(^@SjI&Z+U5~r#gJLcW**ZARihQvj9)_6Ic
z{gRvgE_Isb;Uh~GQYhB(8J8icJ1Dk6P-Zc`vSN12dw#^ATdNgL)=MTQsa3#6`bv;E
zgIHo(uj=JNC;!-@HX-JHmfZ^LGda6A8z}kW4W99E`*_pjw)~rR@g3lhJuY87Me~pi
ze9;+=3&_k-ylVgBdSRJkU-d_i`fre{%xd60>C|9y_i8-sBtV!|88t|Em1a@#(tjDr
za8*P7#WIMs0sQTrd6K>AWDwVjXlrp>X%#3*bfw;f#dH7;R!5`Vp>dp>E_2PG&StbS
z+YCK<QXh8*Tyq0*{5y>Xy;v$p-Rsc1lyGvwf?T1HPHY$z&dVa1DF#l2qyEPhg0v8)
zP-4V=J~Puj*lwQ{S%GBqUvK_}LI+5@d%RPG9;{2v{v8bs<Sjis^*??o{(hyyw$?F;
zNAdP9E^1SFNbuy{mIZUhTNCDtPW+M=oXAqWaR6qz*RE4kXv&{;H6Y<6VWE9!4}1CZ
zu$hF3L$1QrI`T;Rv#+|3gM$M$0UQ0letdG6SFv#n(PHrHT3Ar}xNPW)R9p`N!ep2+
z%UTK^ku&BLGczU%%@`1q0sdO{H~+{<wgqf5CCuz#$=&B;c{>ndTB8E4CUL@7=8q+e
z7r3KG7ai=4$+h71%3JfEiqN!2ML*?)KecloO|<yqb)#x<WGi=8yhghio{@1I-{odl
zU1=SYbZibY+l(Wck5JF6VWYFqSI-l&!|msHi#CoqdA9~1tWUbH95g-BH_$G9_1R?x
z1A{JQj-lT=yn1oRB?hjYp?~Q`K+_0GFRgOEv&iu7ubUSYL}zRY|GM~9!nK-6UpqW6
z)h%?MKNuv)N+DXOm^(P&M62y0*~@N`%#~v+bD`P`0KkMP5g+#VtzyB_xthN=Pfz%v
zJYuiu{wv@|I5Z#!cqpnPd$He{c7$sdw~I9{#iSv)%rl*=OO8n?G^>A5vO}clu;&F0
z9d7ieM?}OwjBEk07u}-3FQL)J)`0)y#i;LQ9{c+V7`gq~Curw|RqEww8uIxK=XQ9+
z8Ev1P9T`$&LUJY;)wEF{Y-*+991?{6!wlFMCj?<$P5~FI4YzC_)K+cj(ke!V21fp<
zDD2pGC_Z=r6?P0%_~?+#wozGa=tu}dgK?PVnQ5;$*~tZc)DL=mV(L&W6&<SGTL|8)
zJX3)V)%voyb>L~Sze-(=b{Wc+;6>^6HUE7^&^@oQ+q+Dnza|?pdPu}(LwFs}@?<Za
zYdSOLzT3S#*o|rt&qyWBY2YRMA~m=BQLCYsP>HSSk}up<3;L_^ObJLpE22ZLLz3G8
zbbgsom4N{Ej9%=O=PWRT)kooZBL;XxBjkx^r3Q9Vm=#?-eo!b;ZUhy=Z-zZiDsis5
zspRY@HO|0J5?W4|i(J>VKZ*cNu#$JBfNi)haJL!|2!pn3883C4CQs8;^Ebv~Rm^dm
zhN3rZ$AF%WZykPa|7)lRul%d2!%^4AetGlU`>`7x%P%p2Y92@=LY5Vw>p{)jPz`=C
zBSAb=cHJVwcwkU=-#p8{G5+>kqT^bYGBZXDQ7%5884DjMoFG@YPrSmCF8C`Qpi=Se
z1_R7KpvO))%Z?-;+nS-rK8q&{ir>SY=C0P>es~;Hd*gQmtYQ0tM4`c^8G=W@I++4G
zjcDxlB{tMJc!=(SWc)BFS}*1cmiVoMt|=i;83B*c)|NDj*ZZ$`xkhaUqpHpk4D5<{
zpDaW~8$3DC4zr70SGU<b1{Qx`^m*blOsV)Z7s(bO+VJu;dU!#*|E&J(#ZCwF2=2$i
zvI+(56J+;v>YcJr{oohSfKS%c){wvdN!(v8-hSwVYSpA`DQmrj*fA&hGo1!mrWKxO
zVbgQ(nbW`g^{kw0tf7;#&m-IJ*rD9l>6wEp%Y%%vyC>fA4PUc(MbKR1H3&(sg8GOk
zZW#9lH-dXhk|7qd#Uh><#EGLxmA<9^hq8&4_7t^z2x^%y2mEV@>~$?f_F5Yvetr8y
zaleQRzkD;#Z?%vNe~he5<Xr<d$zB6C$zI>>7LxN3^c5i|XtxTl*Vlp;S>Ii|Ij0~x
zb5rEkWg^!Aia%?}X$=)@B*zBuE~MIe%eoP50N(w~)Lg$O7g%p+CJcK<0c&7;LOy?S
zc>VA>uBE~|x?DI2VXH!`3tJ$70}*WM$p-ucDlFK*%+o)oo*w4Q$54Jkr%qr*0mbQz
z+#D7a=1j;e^oO>kpJumULpb)PEC?N@l0myT{nOxL%sDi$20xo0-wO+X5@&FC-zLUA
z^yF^;d(WHkz&#`~f{@Nep-D;Bu-T@+;M|HGk89Yl*N^02$mcogokM3qtSZb#4A{e7
zLuDfxjf*4}a#<7wV;qgVj$dZ4x!BwpRp6au3MEC7{H%wk>F(q2xeNaGa@7nA&r<+c
zi(oV@j}^Vu36(HWOySHIoSV;gg`?t(WJaiKD9*?h(LOWZ<z|tz&o7LCrF>@;kYynW
zvQAL%D8Y&Z^CMe5!Yl*|Lz>#GqB6qqyg`^rd&3^K%k!{t01aTHucM4WEPj!OND_Z_
z_86Y^XfuP#P2ObVH#w1L<fR=aB>oXbS`B-L9QiRQZ4kGxn16ECXmj<9jFM-K`d~%#
zg_=S&nH0ec#MR=H{C|r~4c~rS%Q8{0?zEQQXUL#%GMFSlZ&A5rknZGWMa4g!HtNx(
zKZGG`ATj_30!nQx<_#A-N+d~IrQnkI{=Ep3KM)9O$5_k(Rbh$^0;}$&;XC?0Q+Q%Z
zj!(51tH1gMCxT@4-I+R}@Nyzkwvh=n*0Xi*p_J_arPnH+GOp+VNdeLw^bgaWZ3Ju`
zz5dP9U*tVv0rAQK;uX@)jbB&!H+@ME2^op!d)UroMuOA$8;Z@Ev$-g6f^7!$kK0{N
zcN4H?FLX(6zI#vAM@AsFzg==o#sjPghMY&dMULBZFII%(3eczx5<GI=3bi*TkB{YD
z&kF`!zP+KGYmU9_g}p`+f(D<@4A;f-iZiQo`RCj^nRaSEEon-yBq|r7anUPT)y5MF
zkb`dHcr?cvm4&OrspRE!<=3BRdifV2y-ZdLOaA$HsO%LKDt^@n>)9oVWiBJ1B&?<o
zjDK;khlph|$Gnx9?7N*<j@j;q>o+pT%vky-3+I^0jm0jRGq|rl+F0HoR(Ua0@zqw<
z)WFkXxdG@kNOqufrr>=mKd-K*uk>Y%>Ip+2#ut)qrn|Ssac<AgcS9hC8H{8_ZHs7{
z4_n0BZoC~+;&;%T5kI(U4RY%V&r+YEWCs~`*tX^0qrwh`@|`b4VF&WWqQZ_5O7FTP
zC_d|gFcKMdXtXO$qQZ`i7~e_5LCMg+o>9R+48c3eg;ChI$3=|X8wWDP_FU@RTY=Fd
ziD7KtIV|W`HUeQ7W<W+3N_c`2$I;ZsDdZaes_rloU&vuCM8|1uQAb0@g#H;f><$3J
z4MHalVc))ekvQRh%!KleKtiHi0Sx?^7VMRWv`+h}{rC72V<V679TuJF#7`T@J+nWq
zo5sUq&oCt}zNTabs@_-(f3$5d%Yjnaiv#|yK6Wd}vj>Wq7<+oOBcP{;kze@Efg1VF
z%#8dJH1c3r0`b_LA>5%~`{cJ#TfJIlw~-kcYF5$Hqt+M5I2Px~B(%(*7y%o{kwU=;
z1_n0bBb-eA^4nHvYe(Jvsj&NvpcLg^tXm7fT2>^jK-RPNb%!@{$l8)metr{w$>@x8
zRuK&4uC`%<83x5`WWbeo4w>D`d|;toVG47612-`w6ZIN-Yla}PyHoSdl@^;6Wc4E@
zTz^D0fp3I#p{C>9o)+I7_G$YxyL~tN5L4vCQ<5Bjb@Y2GC&O%EU!s*YGuv-9VwMAt
zAbRI%!?rf22TNUb+NNCb_<BFPN`T$jcrtEab#5+Qg95;e?U>0?y~k6*j`w0-RGwen
zs_iiN9bmS@M)OzEr}911{w3CyZay3o9UyrP0W(c&IRx-PIRx;4O(w2LEYp?P3F!Cy
zUwzrjtf#&;R$F)RDMx6LBLcp%koRv1$SZ`ulq9+WgAGV^KCscT51CqNAkBwk_}v&y
zv_DkUVu_C<aN+?a8$bB1o}q>W;#FKmvZzR*goF<OQ6X-(tF*RmIk~ro-}QrxOva6w
z59s4Ma2r2?I<9vp8B_NcLd0;y5uQvZkm$Gc#=0s}EFR?`C{<eXyUgHT<^!n8hV&R5
z*IO^M*Hbu&8T<>GRE(40yaP67n6BVWn9U^*x0-5Z2$PR1P-xJB(1C%u>(VxZ&sp8V
z_mSGBO?N)}<;9ou4L)lAI0}cSjXI$=u72M`7#jG-aiYl3VCfS^$R2UVWXuarRAeO1
zNHAtSgEezqVQ<%V3MsmNwf!~|fC4{nP|jb9!ol0nhe|QCw!n(VpTp127(XcY*)x@1
zPWb8h!cbT{CTzw(?16pNqlhhAYM6;t!ClrFO-T@m0xxU7hrNpAWkVP_u+Mr^*$Biy
z%;GJeq;1KJ+#JB~eTsq5(d=UT;+@0%fjf}2jfJqOD7#TBHk8Ob$Og0<F=5>Xm0jp;
zm?cQ_+ERgZ?u;e*w~6W8=Tsh}bneVd$!(ZY9)yH4@wcK2IP;1pFYRpFH(7qn(U=i>
zMIEguQQn?^(k^}m6d3Rn0H}4~j}bvew8_<M-q4`}M^x6q%)P<T1&=#f)-lhIz4S%O
zpHS9;6@~J17YYr}a4Hf8i0X6;ycDXMn*sO37=}doF%+tTUM4e+6X7x!fdW@XSnJeP
zq!tI!keSid)`R%FP#norQgxYu8+N}Wm0{6EuB$s71#QLG<IEtMY!cC+VMis0<glAF
z#r&Wmsi(eBdO>(ifArCsz4)g+08u|pSyg`+yu_el+@Ru5&Q)un!G%lJ(yBF8&Q<X5
zDD&q1=tVSgtE0H(<4?=^kwR`6bRo(JH`azw(hU?bfpnuA_jtSb?gYQAs+YA=vJH&c
zN1MS^@o^e>Jf}Q2<3sZ9P-1{38#LUg81Z=Y09qPtZ7+Q-uf?F2_N-0K#po9*3!q9E
zp<i4Cl*i06x`B#-C@^64f^&yT(=tn#fGLTMew@{Me!{GHYarTwS8!vOzZDG#$~cC!
zIH+)p(kySYXb+;6t@TgDdX78l09+#`PUyk?lM*NJnYn!s1qYD9uKhDk6eUh*To5dW
zI?G6s%PxOs1aF*8m1LJsp43I67RK1+rDE)IUJ=bMD*@icIUslBU+z5yP#&RSmls_%
zXVA>SW$JNpkWA&yb?>M2MtPsIHkO3%TbW7gJ)s~l$}`&!2YabgSWon;(oao|5UCc2
zlnPYv9zQ#bf5getOg(zj;|2HoJ}X&MHP;<07#o)Tk!IejqfqrOnGLd^C3xBD>3HU|
zK@@rYsB*M16q6q`55CCAlz$)7{S+#!GlB+hmqOc);`RC3Nqz4Bp!WnDO5~lYR-p>s
zQ+e4Xjm*YJXFh=Lgy5wBsb-`Ji3~fhURhbqObXE#7m%T%K%<YBq2zGc+li>efGHRm
zh+!nj&mdg|$<K^urvD1Xi=#Tyf8#ijb|Zte-+p+^6m5M&h*3eJAD*9E(E8W*gm*Sm
z=O18qtN^x{F#7}WzXgObO|jNh!`ToL_n9!9j4{2^o_A<?T!Q-Bb$6LLo0b{uS1Bh>
zwX?c-=5MyMIhKo)xi@-~mfkoN*lykkndM!-UuB1nzkOPxmHl$%EvMn*$`K32o;z`k
z!Ed+)5>{nzdeYr0C}s7i$e)yXv2#20cOz^}wRfKWW!ctmi5$yyHq+FH{Cx$Cn9IAb
zbUiEjqpbVOk*@C_JHu`~-+dmqL(aY5H}|Lv_l%invLzF0cQA8EcS7I8iTK#;r&WKl
zT?W7P1&a35t#7MyGNU6mE&uxTWrCdR#Y@@i$xG2y=r$s);ItNDs_hwYxf!?5(3Zz$
z5*)8*DI{E%(3R9s+;~G+W<PX@f^mum!0NyjuQ=hs1B$w#vezetlnnZbxGuV3h)yhg
z-6$4;1s1ukC2MmSQV^or94gCcv4?eMqDD#*^4(#UAB5-;BAI{={I}zr{(>a!aty2K
zH6()x#eR8NhDYojvbw$-E;q)C<r99WP3|~GB5N_lvZRGagBx$u`D>IRRVxtUC~)5z
zU0pG#1lm5pq`@0{?L$KeIvTRg48hTuv=c@$GaK(zVcHEo*GttEn>P+dMVQB#xjCc@
zFh@vs+C3a^A}qpeFlSO*?wK0C%{P&(m4tT#W(l&MKE+}m1ti6F?)zsk;RDDNa?Ho$
zIJYQ9pBYK9kQGNPq3sXu0^=Q4xc*f^{3W7VsWB1NC*Y1S-LWx4NDIMBs)khgXakXl
z`M3%|1gxj%B_d!wROz6AWG2rp$MG0aL~Gk8R2`eGn~Nlzjj6JiGeF_H#KL$`ZEPmP
zc*bTu*}f041S13ba3=?O4Fq5vq2LEwi-rlbIB-fC!<6)KT98+sd!_P1e?9&79~~OM
zSxPRlaA)L10=1HantuD1H9ZFG`js%r?Y#A<pHj+Vw24A@N+{j!hNFV+fAdf3e*ZR)
zQO_W;Oi;uhf=8Fn7(y1SN=f8S4Nr!!C`eP?Xl{$jA5*=WZ&myF@!PXw5P|_PI;GU`
z49Bh7NP6~G(RGTRWhSk<F^i&S0gK(7B3S&#!ItZ`L>*&<`h`A`3sIBO)7nT79niyZ
zSGBd5*01W-U(K&qh3%MszptRLpkFR@5NuQ$H2(!Me}IY_l*5|CGbXbUc}jkwH1x0%
z3nLd*T2u0TX7=}JB+n05^MJmvF-N%L_wah`n*Z3?G-p%Qe`nV&D(gN4l^2F_Z*jx9
zH_<pXoD+^u=jA@=j#AAKU3+;>D&d}KHyX@FT}q)xlgJhiy^=M?TPepFZy9tnM@)Bx
z05N!ARS!(h>c1oJ2^KpvpOB=M9{$`~D27Jb4%sTkU*%LWUXxSBh?rB*_k>KYHZ;@d
z8<UeW1yS+Jmv`!+DR_`n;X$pT^*?u)qwEPYQyliK2$cBw35gzdyTozskj_##omVG*
zpv0eb{><3~sanH)vTg}8k2HR)^A>ggHzYTRWLsKJr;5zic6f={j5<0!)_psP%;5?&
zFk)&Ds$z_>aYuFa)HGkew`xP5J)9OE)~?ZL`3p_As3EEoqtokM@&y|Qd|1#X=3vJd
zN7X?r)hTkYW7s?eHR-<eH+zlqGmL!k$jbmhRF|pX3_2T(tB%o<8WqrsyNXIh+-D{*
z_*+ON#akrL<gFSyq~l%?EbnMMgpvGUaRDp<U+A<ruJ^~O!cL0;=){vdI5=``NGyha
z=B%qw)(Q?GvwpZ1{zpc9%nZ#k1MwtKZzz)_D^%T?x&2*H63F%i7%+Q&GDABhKAq{^
zMkbJ_2CX3@1SWrUlKf5_=f=FbNSknv88uD}Dqterf1TU$Q@ZQgm|!tCBTz=T&y#e1
z_@t@<#(O3rIv-0~YJuYt`;MGYL*gx*`W%A_8L^jLj?OTo(`R<tgGB?>rgd*Ac)HAK
zA}TgiF!fo>?%x$rk-#h?u}^z2vvU}E3<YEgVqS^Sklez>wc_*3rc%DwOaVPwD}Me6
zOJ!Q|1?ik{%22y8c@DYDuK?`W;S+^jc;P4WLA!@fGP~<rpm;~ot}_4X>=q<A!Q6(|
zzgaKf$^Xy?=4T!=+srb9oI}VYZx;afzWde2^Ncl`cWj+<-Jw9T3w=X&6#O$0z9XQe
zncibI$e|xYR`6@|=-!~4)6p;`o@;hoz%%}Pcjwjz&Gq;{3-)J6XUMs-qGhklXzA-D
zlH;innqBk<G&{jwZvO61?bDA_`aY54JMAD_t2jqSY=OiVpvlN31zVQTbn)P1{r}D%
zTV2|ty;iP{M`1{|Kw4?tFr9Uz_4@MePv1Pq3>v)Mpn`vjv=0Tx3a?)AAQ&&`HM74*
z{?TmPs*LJz?tFgVs7ASXkSuqqw_RUY{@~1_Zeja;C)-t1V_3T|SJEkSMPolxG0%*r
zh!{8so?f1&i5tJ`S?~F!S<jK43^-6*-t~1`izV(JBjN6+MtN4xNu<)Kf=7`%=JMx_
z=!XoZ*o_NN0S>G}?O(}l_v253_vE(Qj+q1RS5XEi*`D|3(80K}Yab)|W!UN8px8qn
z_!uWst#<6FUIo=emxqsTDqBE<>u)$x%<}I;5WShn)czu5mXWcdsFaam2NgoisQuoG
zXI`Vuwg*!H%v$ebz>DZ4T1}>!us7P+e&J<?gsp-`+Wrj8c4(5BD>m$*)vq>_u8NFp
z>%w7&<^}s^CI`=_Toth~Aw`ra7-@(Dj;CS~+2t>}S*q|9_tXazqhWcuVop%pHE0jq
zodE+o$kp;tAq`c8dHEXu!u}E1NR*3^fRvm}B7|=6XdS=-89)JXQn|l^0IU`iI~<eB
zWF(B*zI=|Ii+EXP^h02Ck9b)PHK0$l7tdz%mpSLF>+jsLj_wK@DNz%)M6uj?Y92aU
zC%|gbu(Soive15nvD7CnAcfmo=)^5~mzzl%zjR?F(UFg3XW+;H#xKTSBLqt*;}<qM
zJ)~xh7(7(K4J{RC$g}}MTIi=e3SO;qx4F;hpeROm_*{7=(Gg5-@WaKlkRp@lH|X|t
zgb@v;I`VNjIhntDK1-1Jlx2kSo=hFAxHbaq@G&+%ec0ia1)WWIPI;qTSt?c4`VXq{
zg#Ih0+KzK4_wDFc<GQcQFSFF1p7`8AkAo!!k!yAvIIuFlXP9J|7fdZMFK{g|DJbT|
z3bX{qT-PGbJo8?grlG<;aEQM70%UF48V{efD9`_%l6!_Tn(fWsDZB(NtA$seYT3)U
zT6AUCoKGLw8u_?e%&_avf2cKz;6DF(d)XGat%LYg#2$&Sv259EG+Xl8j%+<iq9^oC
z3D>vXZeq#vrIz1Pb5o?QB7qmb6|YnEQ2ZZKzeg*clR&#>d<H9y-@4o{40;us6_`+O
zeQ^VCJd*$Fz6}~Jj2#0$VPQ#v6xJv~Pp%%%tjrI+)NaI!YGaqp(_puS4a@$WBh+t<
z(JXuAK;3&qrAhVpe3LWm-Tc;#c(D;gJplxg-30s+t-&2S8t(nou%MWQ9(S9f_fAS-
zdGRgF{LZj-c+UAILn{uUW~PLx&VymYHJ}ZRk9OtN1=ljn%e{wx(-SoMq4BS}VQRFn
zvy)Zc&+KK*oCsdYyoBN9-e@2y8#U7O=TmL`8OJa27W>i;mwXzeua#mRJnOYH8;`W0
z(H|uqokgIdgc`0mXtMIcvgo=_YZU2*>D9#Y9XS~e1t#T+4m<VvPcNMqg<6dfyPeJ+
zee2MnYi|!%2aRvx__K@?C^1WR^HVoN(Xtj2vKw6*X3So!ve7=jhjnWwwA8G+^8QVA
zOSD>w1dW;4^l~V(rl0&`uMX@LDtU4bi{$jqT;tJWniUnUieY9B&hL?fTZ<X_tiSyG
zGn4rvjcjgZUwPZPX0*VlI;lti>#VUm$|ym84!%3Ae6P^?JK0NpE)n<LbZ;l|@hz2H
znuX`HyC4CQhUH{4y^pzb$Bwbdj9j?hkB4_Dej~R*YH{+%3D^AxtI&6PYfN=cJB;`n
zKRK)}F1hpIA!@|voV!a7i=&a3e^wkGbIy+0%sx46hZ}B!Up1r4a|rBLq;AUoSY?%2
zA8oaVAMFhBh6Q86m)Mr6!SQPNfpM?qd^Y8AK52VM(el|$?T6?yJ;(81OKA}Y7yerb
z&#sYw>{)My_O09rQP7~$1AGtyTeTX(KXTPaJKxp)jQsf`et0!(3Z1L)!#>Ago;q%2
zV4TT3Sf$L(m~Z3pT!$HRD1qCD@!f?~1WaFP?ac~r-i65g=kw0(1sJL{bkCJK@adTq
zE+FlnVOSDfvJChSTEr36d69b+ynQW4me`gaI?*1SA{d`B9f(m-KzP(c<F6mC`${d;
z%U|W5&-l=&&G9%p*@<6VVNkP&=gmvxJF-o1W&~UkZJ*!L;P%nbL;Y03S#a{FiUZqV
zo?q@c&S|*L%DK*PB(I$DlPI^VbLn0FErk`T{?=}}<Q?(d5nPr9%44N~G6|b2M!=(L
z+UW1LNlE+O!-MVI<7~5ooBVaYNjxaNZLwf4U;6UmOJ8B^j^%#w{Pnql36UGRLVypj
zbI0c-ST)*^sE>0GbI5Ql&?`5r@gB~{Fiv4$YxNZp31A3;;)bz@9+_m>pmqs~odu)O
zP7{yecw;a)-lz)64t4;Rk6-iPCuoO5ZGSv<>saM(olT!R(*yhSUkjJZS95g8D~sJ=
z52SG6sm)B|LUix|(GNh`{>E|?QK^+ZUf!-E14kwA1WJTG08(7(V`s{KD}IWWXcK|x
zB3=Ny4~^IresL}bf)jG4*o-}tsG6M{dJdek>h($mTNKq(_{7ViB=P7(=CD^dFifS!
zh0u<-)fK$dpRTr}ro%dBu-i*AK!K`&^JiVS{)|r+=#y&$eV^=_cbY4BGzCIgYtA&L
zF%S`FF?m?2t8VLdF;Ummn3?F8PHr696St`O=&}yHb9;AHufFThlQ{?^w1VnAFv%oq
zmxagbsCls{N`V;SodDJneQ=9{clxdRqOW^wa+Sis*e~H<=yF!QvV0&8Q(&XzHj<a1
z!ndpR8lAiJgWnY~tPks5$tb15EQb<{O<!r~&5BeZ0t#%)PZn<JiUF*85D?)M(Ce?N
zEnYq?-e$k@U<O^KPl=|XL})Aa61`DG#MbA{8a>k~GKiW_<$N0L+Z4{lX#e4>XT8h)
z+yGxS6n54!DjWCHSllI-X)I2~of?+<=Voq-F6vQks$-hHX14M>BLwp)EEtw$pEL;%
z8zO$p`e8p@5h-+a0pKCMa^sp^yac|JpFrWQ9IxD~RrK<l(+#}lnB2Ek3?)y0pg-C(
zeCtamfvSZJkcZK@UZ180m5hJ6P9NI%?HgVNiI3v)_z{2;t;<acI2o)ALD+b?`1K4Y
z#UbCk%n*2_J^WE@_%`<rpQe?kOr8Odf})iT%OtNkT!&QYONt^UDPzQNSBwx6;QP|k
z%PS3p1h{#==(?T{SEUq^m&EYocZe`Y%=6s}%E8aaDIo1kS}~q*3kEs+33LU<d~4+>
z<!u1K5rP0H8`ypn=6}FAZ7+qocQtaVQ4@4KStss6=tMr~+y=8^1=({bPI<m^4<5Z0
z8)_K&IGqmhdICk4-hIql4&@?ZcC;WP9wIb4hF2VV@<l;wuPkWD!*p0F#B9IYGJTe@
z>9fpf<v+vNOPYzIc_C7!$3=A9Hxx6U+Y&6=SZ7%A(^Ybo0kwP)i2NlgA!y?vH<exw
zRHhM+2n5x$<);3i_g4Fs3`3urH1wG;Hj8OijE5sa<PLgx{^z)0aY(2@@<cR~Bqvt}
zo8+w^`uSkhj~mK3&KLGu{4+6_S;9?3E}y&6BTs@{ZVceWSulE9g=f<rsg2#EM3YR!
zO}NhvcPP-?{@O%ITKwZF(Gs1bqG2Ji&+Ve+%wr!Ae|lH|_E|Fx@timZ*}NtJ*s^dv
zCCH!}Iw5u~fW4g297i@C%7#T0_fQof-qQ}q(}%+CmQgkcg76cYZQn5*RH1{2RK)vd
z`KxAJz~b@2;7yl)=lTu@p~2>$cH$9!eZguS8@e!#1?F((q4o?@)*D%577_xsU*1$%
zGaay<Y^w&@HvRK$ubv#u_5H15hZt`4#Wv;ndKG@}`O~@Vw)pF7*4~=&YXozT6`HV3
z3Yr5Woybq*$MO^S@tt|i<XpPd#%0zUCWP+licAchPI**C4T8YL;aUdCOe1z$$WXtR
zVt}Q&U-Uh#s3^xM9Ne`nW&s5r1UVV=IR&Y-%z}Ovfe4k)DU-dd%S2byFd(Zj6RBf=
z{|GDG6Ozc&O+Iw48Cvi?jN`<P=X>#VYmCdS3tTJlH+4(}>Aynibkb$GuVowV0!YL#
z3TRPcUDGij#Qz{p3qp63#bmUX`koXVG(1x$@#Lvb;JLv@%m$`(!mD>UEm-u?F5?4<
zmfztoIQ*16zp1zCTT6v*qRjdVrZel&CL&__)P7b3r3paUZ{=yF97x&;bwHacH*D8e
zKlmi*S4FemlBc@}G}e44`F6C!9xYB%)!AUPG_7)gDq<823wtjrgF4~eYD?}uY0+pN
zl7>Eba0)2R0VLNw=bwkq6qe`?-j&6i43qNPEG3!3C&TIal6GLihiA-kh2*gY_0vAn
zFJErSUa1#HMC2@MJSRpcE-*Rvok|I6SlFh|j^XqlGscGF9t+v9f_Q|0*m%K8tnB)h
zCiTOSWZXvB7=^5?JjUpua|0;r5JXuUdG$_944%tq-W$R2!^q`YKhnzR1ly%uYc*bu
zdE1JY4od2;P{b?L8$g0%*!pCS)tH$??tLu`B4F4WukFJ37RjVSd!?x`?X%g6dt6tP
zYeRW>0m$xX)sx~cqUa3d8OT7=n3EB@T8Mri#J}K{s={F@x8nNC85Vk{u7x<RW3)C_
z&^gE%L2Vfx7om^=P+_0`f=7(z+Op^XC7^sD*SD@w5ve%p7zoL~g4u$r0gZg-b@=%Y
zK_X<V9-Yc#Uf*$XQA-tw4X0_E>OZhaY16WKQl+(4=lL<*lCLe`45~lb{?X*Cg`g6o
znh*GK?oMoHfg>lJ9iGI~{pPxky{pFfb?z0v!$U5qp<;5c&si(EXJFv}Ti%QmE@Oa8
z%9Tg5V+AzK<+YP@>GDKZq1%ivr?s&$bZB?r$TYeT{LlM_V|lWOV}@6iVu)N?HzLh8
z-$Oc7HINnSoSW&o6#^be^n8vms>pYhzAAxUCs}C;J+!0(T3i(U11m>BvfRbi;9m8s
z@~&OM>z_Kt+BQ<!K}|p&SU;j%si#p$DCA0?c86T)S99v#R!XwV!y$&i9ZZwk<f!pa
zc7c2UXi4dDhbww-DSGTAVk01s($`vi>XaI$Ik+$T%_%UfiSJzDt>n3Lhu*!X2bSz(
zMKTJPd186BNmUyly}^t?55vQ2&;<p&Qk)1c-!Dd3BcA`tJj0vk$OimlUaq%Y(P5`}
z|4X90*YwFn=8Wd+g?TSvm1jb560Wk*PKz^HKp`tv$YCkK&DN6r5EHgPZ@Zs$LlsXB
zaC6y8J^p?bC;>3{GwaSLy{lr`S2*1(K@zR_*-js6W#33<79iowez5?+8HR+&Yskwp
z;DUeiQr9b8yPhtXcTLe?lYUmo7b3oGePDW#w`!z7Af}tJ<{cVyT58=GHeBwLg8==`
zd{hL%pqyp}#3p2T?-e?ki*!cBlG2ctIE;mWOCVqF(qLKO8xikuVYt0&VsLcSpD16V
zN{v+WPJ&0X8>EpEQ5*F{7^yXM;>T>D9n;)066^rC3^V56#rz|T?=B=!*7Igid~n7t
zeUH^|He!jC0(-91flmuxB=TW}&@);^Db9WA=X<F@f;m!`=mI6DlVdt{`<iR?hml&%
zSJxQ@>q%--LEMteDz^~)!F%BDBybWqbHZ82K<0tiPoof*Y&HH7PjBt~W7jiG;N%w*
zPnhRF<0pM5RmU>23<ufjy>Dh0gwn1r2mh-AmQ1ZEWPs!yF>FR~SsEsz@1>zK`kpKv
zG}Rtuy5e(%K@2C{AXWWg^aQO6i3dfuy<RCtVl7#Th`!5UwW>*S65RgIKA-s;Ds==&
z`28{@4S*Kt)=n&_wzMv9Uh^l9(iqorq$A#;mcI)8fi)y(GYL355$7{a9Y%nJ1g+y#
z#Q)Z_pzGk7Qp?F^t<dSrc8-l;@$R`EckfavrPQ~|-MWxYl=igynZ1@;F86*IqC=h`
zQ8CCBrw(Nr7t*9yVy~<L45yHUWC7Aij03t|Lsakx8#I=2D)DK4qv?XvXD2c(PoZ{h
zAbzI@9$uw_Es7EZOj%XwEFPW69QHKt+RzvI)VM%RWr!Dh6{9KSuOenC)k+1-(rHb?
z)W<U*WLK*z?4>;*lntUJ#WKS}pH#K(B+{FV5CZ{ob-5}^t24AV+jU;8G@}6&O1+y-
zvD$BGh4AnQGGC01<@Wg-@`K;0nk}Y)C*ty*E~j^7uMp$%g)}P77mAoM`mOrHj512#
ziuCjTRSc8vAkC%x?2f21C$^{~Ke@9QXjY&EMKa|>k6IFcs3=+JGDAh68LiR@A9EQk
zt(=ZDuDG;v-;9exxc<Y%N-JT%RS^G(=@T(p%n%`FjhoIGF`GKD{?1^PJNebbD_OHW
zkRI|2ZY@<Ktb=aN`)0fV30a0%Re=JKSr)hmhb8bN)X1x==@=vwr*kYJB^I?d)*V2R
zk_BQnKGLE7LjPpAF_WP_6h7lF&~X+En7;L9<kJ9p=*31CUb_YDW<?y`Mf~x6S;4=#
z|0`$lM`RcRCk;vtcV~7OM@pR`uF{YOyYoyyx(u@$>bIW%b(nPn?2ZH*6J^yP?F4nJ
zFN8V_WY3X%Z|bB@>Bz4_$86xu;rs_sw^b6kb2#n&fjmI4`v)JZqLDHhUoyNi@X)l0
z$TwuLp+%q(2-$dPBdPv5`UHsIc!3vaqOmTZu_f_uSor2xg|SCQg`p&xeIrtjgnMfW
z5+Th~Q{Il^HQOuq;A>IOF9OoA`XQk^N?lh2(e6i*;UI^W5O~x9<!kw?7c>eVJl2@K
zQdL2#{Q*^!f>}a9r4KIf`;UD>0hMWx^&(uVL6L=xIM`|WO2`%hE!NX+Z(=ZVW?-)7
zTO>jKaAO$LKwLx@It6y%XUHk2l&b`y2q4+bTJoJ}QiF>5-&oZp)+ZP<e3nsKBYc+i
zSyXAiU0>^9;h;W>QnVtlBYDb;>w!Y{ux_e?bI1MzsVah1Kpz|~KaW$HN)`9gVFnhM
zZQf49lS>mbE6q^V45|eClg9w`c}?$KJqsVHW>~OH>T)YX1eKMONzq|D2G95`LTN(B
zfJ?f2!J5U#!=1O22i`!46>}0$#!n3n)#y-n8H<!iLA6%9((lYN?o=TdB*bP9QXTJc
zVd8dCSs(KWu>-wSz_$x)6^8a#&A1r(cp6=7HR}LacsLQ6Ya_9R2Y_g0%i~4HCSEJk
z;uscqiHuDm9}LBah`Azj5Wei{O*ol)?L7K$M$cl`E5KL_21Whj=*M3t==segK`?$j
z{>nRdo1G4Yr<q{S0ctx=xC7J@av;E9$??qq%emasoRRDS-iL?u1Pk1eMjw9)V6QR&
zWm?`|C86zFz{_pbh!|5H`++f>2wxu${_hE$Y4<tW6+~!thZH3Bd3Zb)`C#NNs6r))
z`G!9%zlC$+`K?G5bVe>Eixz++n)GX+H=;UUq$8CCD6Q2klG~WYat4l>8FSw)f%3sf
zP|gP<2-E<O<FO&UTsr*p6VCFK7xtkP82yw}j^rSPIAxNwqthwS6hlSno874B5dcmn
z@{8mdC60#b9220^-_R0_^?O5#y_uE$*3ebcgY)35WLEZzs=>gG#T1VD`QEIk=Az<3
zz;_L;$(Dnt@mmsBKtHort0;`nnc026YGf~3i%rLcrj3<!V1v_FVZpK}jY^*LqBQa)
zRN<#G{NrP#8utNo@?5waU35`}<zUdTRa6d!YQB~61`?HnUG`$TFv{hN%E2ymU88~o
z2RNHxKfPVC(A^M9aB_L0)-wx$02LY}aVIlsGPaW568!_as!k`B=rTS&7*$gWqi`z7
zuaByyBYN2v;EO8syS&_s=_p(*9hPON%3+xrkBdyDhDEef%l_W=y|aaOT{XKok!gVk
z#ZDkeP}fpsB|*qxCxk3laB%>EhwNk#jS3ydH+cS_*+Of)JS$YE@yfbc#C)x3^Ra~b
zNFB|7;p<}dvz_0bX_joxx#sBCfJ&<+{BXTeKaL4@g*F5~4!v^oa^vl<bKml{Dy(mF
zVtG%hp?a_b#ufqBt|nqXHuu@!*CCV>(*=H98s?@*8*iZRCCoS8^tjM!FRnfDU-?(@
z_(5QH7yJ}hZwa$$WI9b5PRm+N_Yt$2CQYZoa5|GB4JZ9L`e`aA4S)S}y`PMWotMB`
z(iNJtiPo#d89I(X{X4G1141&+Diyk~nRivs$k<7lZ78Y2$c2tS;7bn4%)l1SOTPmF
ze44`--djn(yKH!DsLO`zK;P6(Zy~ML^|S-Wky4K+d~b0q4dnD4s7(Tq9t3J1KmUx2
zo?={ceot@@XMwaxN&DtN(e8br*E7}7KS)$_IOH%Z3Kg1yTd~rWi5MOhY$N@+5&3h#
zQ%L@}fejEUhhN-y@+XkoxWP));HIV^jnPt*TQu2b1HlRNcAS)N%Hi()xZy%C2}Vo7
zfXN?hms&ZR*|17vyBJdbHrI%8zh7jzZ?n(-$aa1TI0Ojm5z#rOWGUG95kjKS_C*_p
zeP;m@(uG4?EmT-IG*MTsM2glY)ROe7Bg)Sam6)ct$79aCr7h@b{%*!_B^YvDB*XiF
z=m*b`*{aPT*JueNaXG99O&izqLg*xp#9dhf_NXQX$3DVSnKtR9%1kva^`CECmr{Iv
zH5iq%OIzX|0<ar1=8Op0^%>8Zt{oKCRKkqu`%zVH;`?UY{S9T>MQ-A-J{l@{kv#B4
zJ_EchwD4`p^HVASw8*Og)hyTrGR<4Vj5(Q3=tIlvbLkr{yqkLEaV+uiSa7>WtD!r5
zG-0!VcqUaX-~EMv%WBO~z(hs*YP^zm$p24Lk&!8=Bq`?x0b958=|W)J>91kXDWePV
zMxMr_8Mtl8syyb1d29$(9)N#INUJ$gTeBa}UA@wJbJzLAJi~wAN<Jv6aBL?K>N`YV
zWtAR!ND4i;z@&l)oe6uW6JBaYUjH6*$Hg0ely;}wN|dXHM@5O0Lx@!<S(*8GIps??
zq>*K2R2nV|bQs;BHbKqk=;s#s4*T?5uG?Zw-MWKvw~iL^gco{!cqXjEiQ;2Trot?w
z<he(c_Cd=2qf2v!9n3`Lt%JvISA|6YDTVxyKH-CeQy1(zs11aqHbGjzTIZ>jMW6IK
zGp!g`r?}JG-=ssotCIfFWv`Ya5@!Gbp>`)l%vvC$nk|x`8P_{dl?Q!_=a1_JASZ0V
zL0<<Jl=!REyL50B`CtIUp4lj!i2{768rEuFdL5Mya%%P{A8z7(fLi{L;_wQcv4ML=
zj-!@T)<RO+A~6h-I}7?NVLcc`odd>xWVj=d$a#L&AcocR7+XQPy$|?RY+heEK!pZD
zArs%J#H$9C$sO-{oMG2HByc5#b(2nhDH>lcCaeSISYZo85hla|$amWFNhkfl9_;yq
z{DA}+473Y-MSC(GF7KxrnTG{f&rh0l5ezHDN(z)KSfYl-W%CqpCD636ZJT5dYKhir
zInm9)y$!r4P}`73Hw;S^kwP2B_GegzL6JgG2C?x8$FgV|gKY$wTLDR?jl|HV7dVjy
z-mHjymVJp$**|SBe)V&;Nt9lBg1Zy=a)hyAeAo)8p$D>>)X)H%n$*y8>LQ!e(DDnn
zn$*y>1R70hXynN*b;ReJG^wGfP*jq0ZBj$anAediDO8!$q=u$-8Ddr7O=@Vd@RJ&s
zCN;E_8-${2=!Lh~T(>Y2=<#hxsyS-(woCO!Atf8u`K~Fs$z6~TgK*UM+N%CBHw)1!
zcNY5z+kNA&xGSJQlBgE7`4+vRo#nC*%>YFTVF6xDx<%KqpkZOSl7f*E(01s8f({D8
zs%GPY#Okqb`?e!zXfa=Cq=<eeKqk=&G#}g~*6m~hCdI;B9m2`R-z&&I+6r-xVn3Y!
zk+knXU0TM;bZPlhxh^f%wEJItTL*7kB!^r_kh%i|P~PMhxhFW<m+O;8-Ke1bBu+r9
zH{>L&ROyfeU7IgrP^WBFCHM34-LpcmY^egG-`ZHS0uF7EzkYrqZSKZQdp%L<pvIAj
zA5=mskrv1sQ%jM)y)i{{^g%|e>`0ZksKt!dN`LrFQO)p=$i2M9;C`%ZUob0?hwG%F
zphH!OJ0g~eU;dRFD$b$80oBlKso1)wa!NRV3S9{@E!BWPjj@=%Kn;`uP;gS+tR~hS
z8e=Hc7wm~Usc=OO9`6{YW<@T@m!VjbdAqA=pc{*~NltTI$G<QOEX=k*o5uxgj0P0u
zAgRHohM!tOFy5sPEE$$bi5z*)hfMeY0z(zp>46GkeO7AGaydqTvh;j|-^rny%XqDP
zq>AbjXhnvLOvkEnSe_SwQdBF&Ja`s1`-WpovM;(AnxuEBI$sD|rDA`?8BC9hNIrJ$
zA@d?Es!NMg)~li(b&d)h!Yedex<QGYlj$;-C2x7gVBgbo`_Vp)?jj)ZxujCV0@LNh
z=6))uw3yi1!$x0o<mBXtj(OmAH$m;kSBG)V4OBz7!fI&4@*dE&v1N^MP4gN<2{kmo
zNe$hkhQ@rMq&TWc4J{o|G^wHG9X(>ZUy~Y|K9EvLDL|7NT5=JIQH2+q)X*#n;Ww$F
zB_kf1S!q&3O8`yD-Gwp$Y*IsuCp#HeLxVSTWsNT{j&!kOgA%yO8@kCGT4GtIHhDwK
zBudY)@lg*=CbT>Qdc5I8y&SC>7QXH`3qKx?-iri)rs;iN;TM%^TWQ7ewAAy(<AM66
zSrqti8qaW|Bl(=j+N7u5qk*b1Ng|MG_CRiUU0tvw!IM1nO&<x=3t?|CuoAbAM?N?V
zHj>*!`wxUdZ%yW#q638rEwF5#k8J*u6M<Zeo<M&+Z~+pQ4@%PWI2vonkl>#Y)ek1O
zd4}7i78S0F8BS)^lq~H<^@Ecj<7niwwL`~bPQ+d?OZsNWY~wMML=Ktsq}W^B*aQXy
zb(xW46Cir4z7Y}%TtPqI_Bg{1BqBHQ*{U=M%1U_mtUz@+vB2&ssvtzBlzW#zORux)
zmE{9*@uLFiJn5BBeb6_d@R@2GvgtB-Z8WZJ2o0&Q^|5G*i8Z92HncsKxZ{+VGXw2X
z7tv|R=~+=l4DaY1Y*vMOHT9fz@>j_|-AbJobVlqq$cX7fMy%sho-z0XZT#9E<O;i>
zowZU0Vyo!7=j3+(a^c3!nA^9qNb7b;EJY?TeCw6CgPND8sn_&JIT!6J%~t)U?P0wp
z@f5dkso=x+U2fqf&`1PXb3ii@Nvk^K#7w&}lb+1<pFuzTkq{#W7036RST))hny5@&
zF2@?LSdJN;Y_}7#gJ4b#bpF=G*1R+9vp-B-4Sl>=eWWDX$fR1KcH(caYn%s+fYT)J
zNlBy`dFH<1d~2?2Wo{8}N+6qGZP+{cJTuyoZoam(C7rHvmUM+;R(jh(Jp!hj%&JEq
zQEH^+6!^$mkO++uD=V=x2%P4UZg&z0yOzC9;%BDQ1#<iBZxml-77&u#2ddy5oEM;q
zQZTaVWqkS{TVYd$rk7iv<4(>@LLcx`PdmSY8_KNi#g)e4QyvdsxaLWWEer{L=eI^I
zJ53c-N*zy<`qg?C)48vt9td@4Xs<e#vAs7`6P@6*>}DF6H;b99!nw_;IpX|EdzBcF
zK&te7dlji(kngn1)JNFYNoX?$;7DN=h6wfGX(eh#?HPDjg`MKBsi;*d76W}*hoG{N
z&8_S!%HvHkABN5%s#$8*X}Vde9(ZQQ@)w&lzFF#ua?-*Fs<jqc3ZAOS9msL1>f{~M
z18?*YmGv?14pbN*GM;8ytY>!9Of}<z#Cq$$Ov|e@5O=hvc5^!FQ2fO<0bNXa2|Ss6
znLXqvaVL-}lm972h$trNx*DP;fS^&b_ZxBnyrd2dn0v19?b}aZka)?vb&>0a$1ThA
z^(y?{^QUv!ZSmLFti3hk*9bC>6`EYsgTP`x;-m$Rg2e(SNp&-L%;8Imr&}FVH8FHo
zR{&hQolbdFMGXR*PKRsCLfdk{%dJ7V9A`00gWD$vI$@d5DM-bQ#F2#_-9j9^JA_w#
z9v)H12buE0xPOEdjttDEn|$b8GZg8eo!DZE=t}&J1oW#L9_EO8omjTP)K5Y79Lfh{
zzLGu|TSYxu{AGHyyjQN{;1lf72giK8MZ&9hRba5JR`k&hcNLdzq=I*1NqVgAG08V6
z6j^v&1U7F4qaMgq_X+|ar#&>Ij$pLCM2;VJ>4R?e<3cx8Zct$%{L$hhRfQ2YOVd>2
z0f<{b^j=hk_3caUK55ZtjT^19BhUF9+Bny9{&^MRp92$ADHFfklD(4oQg~Y^h1amK
zO`nZTBW*bD;N9;~5U(8d6A5mVU_SyZVaUo#hMV@$&L&>H(^O%DbC>{<MnBTZ=mguP
z9WePhz~nOufB+Q^Tc51DhCaR0RA(A_VzU+ZxSX_4eN?^tVrTrXM8V0K!2S$J;X+q8
z$X8u(OI6{plv{EA<qQjbt~EXzhTQIgn0C7pvJ+6P(5FAc{)i%7en9y^u5VqV((qId
zJ%3=f(1w>k|Di&|%SB*3!YHt)HvYVMnx-kF2~*m%Op2|v*6KVzhFkKrMfvRpw0Zq#
zQiIeSvHS=8ICm#D^!i4A97#OgZ?5auyK0PI=U(wUJmiuZ0ocOpbJj}Ik8OFg?ILew
z)aL|Uu>u<A^4iI{ba|qy&~3(-(_q~L3n;Yv&+H`{T?qc?eZ#9!c_D83E&LO;{zjK{
zM?`t;zwgnta_45cZiN&zkcOWlj4Gf%q108$CV6hs5}Iya7{=bsGb=E05@<`CME^jh
zbkOToql>M<z3Nxx(7<nhKa4xiu-hs}F7x(V4ebe@=a9?{U1uS93IuTVSF$<a8Mc*@
zU>p(Ga1h5p511S^NUOoUf3&3fv<z4D-crosNz|wT0x1a8PMuQ29U!<b`^_mZtcmYj
z;jN_H;0_I~rU#a&i2lK>*rcir;=QO9=%FhcZ((?N4d;0XC&J73ixEx!c=H_DfPc&z
zPySr0B57raxTjBMx+A)%G1yE9PQn=tPAK;>Jlbh-bTK8feKAmH)VBLsH&pTDxKpAY
ze?Oy1Y0`EPG1h};-T9;kevzixYi5f#zf}Ber_qwo?FAs=%zm+){)}o~plp!tqR_ll
zbzKw!(~G?8ta*}Mfc3m1Q3>`AjrnPZ5q~S%K$0G1$roa6G3FOB+ZF@4E`kX^I)Xzd
zbFta#lG2ctIE)1%ULeoFMS(`U!Y=U$%?`I$O$?5X`V-|#MBFbUOkqBx+Mwr-4OqI_
zHE-TY@Mt!anOZ}csWb3Qup3KO4oXJv7(>@LVMKku%?8>r-AILMFas8V|1QQo)R>dJ
zpxuR%yxa_eMk<Yyyht7RbSg1}Jzm)1{)1KFPbvVkB=NZ~{d_N`d22LdTF00Y8Y3s$
zoH<$Qx^LTDwTj2CJ)nLaOD+W_^~?!L7V$WHM?Ck#_a5afp^9)n<ah3oh2X&R*=4ta
zePGxa=y#NWXpiv}PA1WEIm?~osIl_~U-C~csct5lq5rqAyS;a}XTe|&?_qsX>W)GT
zULW=rqHqv-pjIj)_0>mC<^&V`{U?3e+q@jx|F-0VqT41&IfEdd5RoT{@Krp2eFm#l
zO_H0y?8#GKs4N9NXUPQ<kVS%(^*=vBH9Xk;DQAUvg|zWNYL~Wly>aV+s*<0nCf%(B
z3T%3^`r2DPp0t9j9W*su8m(S!X!bz;b&f7|Yc1t&y_V#yFa&y3xj~pezRGFLl#`yH
zqJw8^mZ!?(ic?Zg757jT^*eZAS|uo#H1dx<>n(n&)lvf^``O99vzcyzrP0ogX=$z)
znV)ukp=#2CAfEMFKR@0iyRIf!k`RPuGwOIjwFX08zXKT-{m!RjHh*ZX$-G*z`7Z=9
zQs;qHr;U!hK0{G^J?^OWD9u~D=(oWbS`0DwEly@wB@T%BG>`{go&gtQW4V2x(mwyY
z`x!=YCrTnaT~6=FULi*1*CCZ^FoRgeCwrPgC}Hbg#W3eisx4tRcRr%Zl-Qz<sQWiT
zV`c?{d^wmAzr`O)EB`OL%uo?#1{qew$K0R)xI~O-b3iNEnQYptAVQHkE|QurX>x~_
za$iHI2MQ&?e5}bGT3l!%a)(}R$*}Qs7MP}~gZYS$)8XGM))?>~&S<6n)-EW#2YWg6
zO{sBofL<ct%Tc3;P_=Bk65O&x4$1r^8Y?jXA6iVAJcFO2HHzRq|5?@>Zw^<seW672
z!W8PeGtjQEVgwjYqds01`_j|PD^Z*7htFD+3pr~16?aXkl;Ww+aAYqb^L)1g+r~M<
z2n3{^Nh|Jw%2*Z*a`qGG3XDM#t*1<D4AA~WqJC`1ldiptC*3ZvjZ+*s(4b;F3BsY{
zVB~|&ZLmz9S@{TbXz>~u5K{7l6YlFnjJWUUNBZ1J*xfbwXs3VEnKUH)&~}XqMZdqP
z0{l?nyv4x(;g;wgtKV#lMYUR>M5wI;Rzp8zVPgz9htFB{>cC#fcz%is=br<U&#dr8
z#4UTdtgLjF6GBKyRwb<xWy1!Eck;K<=4+wNRA(~=t*HG~A<n~R+0~8jrWQ6%-YQ2z
zMe1I}+z|uY^V6ZNA@eQvP-bwfYGf}cvYMWCs6>KYhQ*?A%1X)|sE{_(Jl%ci2R~Fa
z<G}hm!@Qh<#uyvuz3beKKB^fO(lm0&Lexk_Inzjb$Hh^`c61i0LlVWq>Fl7MKy;Ex
z$X#F>8OF)*=EZkzB)JmEqcdW2k~sqyO>&?XDx?+dT$T1p1@=@}HGJ=fAp_!B3dbT7
z-6=yuR8upEihd>(K2(kF1*!E;44L^G|3T;7YP4F9N^>Yd2tm6Hx>x)}rbQS+LI_HR
z+k9uda4@IUWn#CdQH%LqC!cx134iaT$<2OUvU7NKJn!6Xc3Xi-0{)6M(b=qRnf&4k
zP}^~!VIeDn15FEAa>@Zy98z*mb4IcUcpo0p6KnuS8h!jJfV~RUnCI=4EI-7q(0ox_
zK=evVP=UXvbrfr-PU_TFjfgSTu^$-2iSUKu@86*}qEKx?w-7H9W5mbSQ=a&klq@4)
zpSPe2LGXOTAC}+3!5O+0SV3DCxFTO@EQ=PPZ?F)(VF)N)th~=G7I8l@_uUf6UFlo`
z8FV)ijGqg_HIIl?cIohwbXj6Q<&+~iNFk0bZ*=T;bi%NZaDB5Ibu5Q-TC#Rf4v$gK
z;H18x>Adwo=Xo>B{fg`)217Gy5ORySUj^71`M*Lc4+<a1R=S7hd$XdNcOf$W`Mh&`
z0S>7cEe89Uy;?<JS!ZT<6%~Wws;9KE&rIew4i?f0Fe!W}mPWobHmlMMMai$8^@ge^
zC%>9_f#UHR4I`jM-D|pedCx*0D}J&nFefsUxNteT=%Tox1U!VoWpeZ>g@ccBKG`qU
zf`}iprWw{rm3=h?dLv;(fnK>`jW=4b^q?y6!U_qnAjk)r@Uj=fiJxp5%U*);gyGsD
zGHXxhXjo3(6<c*|Hlp%*qt-L42!f;7AW3yKtbyQAt}2~WqRaUB;7r-Pj}l90<8~4H
z>Gi>nSyyXH$biEtLsbsTRB-Q*9hOGOeQ7R>N{0dUVRmyO(*h4sX7*0kQf4JVs75XX
zRHIHtUM>zG@ThB48l3B)H(WGZXpNU=h3Yh3SvOVCSiHwrLVcvZW<Se<-w(5$H9O3(
z;Z+|?ZIHmjpMB+nDXE8c2eASNK(w?Tx}Zr9U0~9rhlUiAlsxMHw;mcK{vIPuKYlLy
zzNU1V+OP?g106xdjc`fht-$aARceh7>|{U?afFV+3rnPoY@Kr5AxsZy4jehk^hKRs
zO2ePCN8hTfH^!x5s_2bDG2&_G_pokJn&mguEm4%&(D<YlFd!_!0sizNaQVy@v7%ZN
z^yGl8(mOLubCBv0TnvBtcgf%cV6>9vi1}2hCTJ}~=kH`M^|?gcchhA^fdO1$7gYQW
zaMn!kWA5CsV{9@b7h+|KQqcnrBShVTK3Ijm)2q|)r5<+|@ysrn=Qwwlj`97o;&4Ey
zj6Db)_lQ3^D2+DUeCzOY*WMnk4jPRvy_E>{v6VQ*d>pI9b>I&_+8Nd(`)zP&b+3kI
ze<y7ZDO%1f^&w`QRQNB`)Cct4fIjpdz@Y}VYBhv^<SJ;5Tq&&)69z#QP-#x$&T%UP
znKs+_M#_p|#vDpuxR(mrT|koR37Maj*50ge6>>sZ2C8#M4V`GO0@i(32VxYVwezTl
z#$P{N_mx_xm%qwA-ypm!u`2QUI?hgZ0{+<m8lQV(r#};637YNmTi}hMq1QUa+yTpg
zQ)wa?$mn36U+%dEm-^+5pVW!;2RoPE<=;|Rp&%ZS=X!@I=K82*p$lFGF7mU{-))nU
z_PvJ(+quWtW(PO<>wJ@VQ2fxv0!hI(`c7K3?ZppccP#e<Rdg<7z%~FO2^p|}9iNj-
zuzcG!4hrIdoL7zl`YNKu#~vaLp6>5Rq`2#N<+$s@iIJn#v4-UMH4lD*b~v$R3ze)p
z7pvT@v*~kZIuvKW7P5I?&5;9goRVCjs3p^>%}nD$vWEqB@wl;E1-uxQbeyu^3bae2
zygDH1cmePn3ZL-wnSU;aW>9U$9%9<BkJ`CO1<5NFY*C2kL?uKoi;`4R6NdDyx`LOC
zdTOC27UXlEhwhpTYdpkDpE}JIJety=(kF#65HffgR_dzDw80Z9d3G}W=mI6rk9vb5
z;I2bYhOi;I{81V?p!dKeldN499;>6~)hCvs6J+&`kkIcJ*@-XVUr<3&C`zx-1px{3
zB&`qu8G5rKRfvEB+o~o(Lx8VDufM9cc=@z=oBhf|!GvBd0dqQt(1lPUv=w`ap2%tx
z{)OUJW^|RDF!{4K$qM=;>%`j>&c$dSC&m2Sly8{2aX*d4U2>Vm;#AzJVX1#^=BDT(
ztWFgcC@U4!3WsIcCr!e`26AHShy4KmxYj9G7XTj8gO+?sHB7xKDwChnjbUTD6;zo#
z&>!s?zV)S(&_%`3NZZ3`T(3`4gG$D~T&GXCX6+kZ^)*6JTpo{7h1TUJ1ssrc2*SpL
ze}(LIhLhruZ(e2yJklQiC^meXdxzg7hXzFX|5^@x5Ri|L)9DZ|kV6N1_c3odluMR3
zXT(FvDy>1JkzRve@DB+0kHlVCs&lnH@w+Y4XBkSYk!P9H%72F80#l*FLx_~=aS^ff
z4F%8VL|v}Oxy-Oqoxt^C9$4Qrb0T;p^AecpyCEcK<1KWar`H3OX~ZMaama@A67Qt`
zpaqxqEg6PBs7V8PPEJ7L5#|L!9S8&o56}M`7c3450q!+4!6BMSl9NlK9KN6G3JYfZ
znFy8NMo>>an{jga+>IW2667*07KIDV=tMKl$cJasAE}MqqePs!zwbUf+@U~k`)iZN
zi)t{r{E_Z;J<es0iiU;6KDUdOt56R#O<WIzTmtkM(F0uzU@vDh$05=Kg+-{Y4!oxw
zkf#q-!UiGoV6&}?6ds^_@z3&C&A4ETpiP&4mu%1in>R8ysV`WS*uEuySQy8Gpmye=
z_6$?jLW4vI*nW9aWzBTJcCxJ+WZU%5x4n9DG}rgHjvZpS)fd~;Vh=qR?4j8vptsut
zd~_l|mY=|nmtRn*TWwrsy#bnkcWttVhO^j|i0|8E4^1zjCVOc40I23W?K6L($sSrH
zMl5KuhnC4#U~=p`l@e^Sho&M@s;6_4Jv6=7q8F)D9uFh8CVOa98z?<2P4>`qO0>xy
zT7L6j347?~NebITf0eL@7C3?+y2&28$sSrxJ){&m{QoV7rZjFYP4>`$;e>fFV3nKf
zp+)|nl=(=LJ+!!;*10BoXi1)p!n9(wU`_VWBHmIQ<Tu$vi^c`!P?J40WbS2iwxSfL
zs_db4i7v<<I;K;%uenBl7^&5Kb)8YLp6pzwphr+LtK35H2k(KqlfX#;%~e>(K;}UZ
znvO;xF4=1QBc9&c`Nytjm_TC)2{*ZC{G{)s>NvFlK6T&BE(pc#Uk?6PH2}563mG7J
zN8D8fbyI0bCl%ycw>=mhRozs3l<A7k6$UY!aD!C!htU(XDkL5h-S&E=9Er88JOz70
zI|*)oXP?jftu-j3Vk~U$mmz6@W=xQ^6Dz|U`kzDZb0rLceqc*IBoqxeI}ztIO&vyn
zqaKc%-znF7u>5>x7ic}E9TR3d$40Pt_gs&=cb%wPzg6zmg><5{r`^x&wUi=&SwA3<
zD^4BCblVWR2pI$<0~k&ri5IesgF-e9kxl{x3)u6HI$G&s?uNfe{YFc3PoJI0v^+(u
z9zO8!Dix~4SJh*ACvX3h-BHEf$*0BzH30WwuVOTX{FN@MnvrTH%JM4a%2JDn6HOMd
zST^<X3<%lP>I!>l50DfGQIcZHI|>UAC6ybJ1#5MTmeAV-@|l;bqO>~q_VC+vUad5v
z0UfsLos`9Dzcu+oi=ryAMSY{mA6l+Ys}MA!RXPC-qM0nMoQ^cExU_QLjEh6K{=>D^
z=+a8~XcWXhV){f(4`qlNs%YGF#%c`gk;p1%z$0iNZE<qJt)*&&bvh4h_RV+!60!`j
zssh034V93|YBPny5_l47<ki)53=)ddIhJF_*hH;`ei<xf3&d`GB(VjQw=DEeh8xc$
za_?*5LfOWAnqo(VHt!r|k_gaZ0n@kM3|*w5U`~6n(S_G;LAzNIM|Tl_JYQDuZ|?uf
zS^N<hhF~86N)C5t<RMAc4U&xlMSsczy7Qos$~2hWs9o4!hgml~^$EeoL|HXRJArI_
zZtF7HYfC<u-rWPcyL9LcXsKg1@aAy-1E||7i3E4PmSUH}9(v#0a35_n0wEhOZ6wt{
zN1tSTV8;u*z#>|yRwv+vSP-Cv;*fxlJu*$Yl|-{|M9sy+y*06Icujdbs*y^2<sN+P
zDI7m}IO&Ik?kII#4Sg8>$X<!k{lDdsFm;~AFK84#c&xGNOpxslsG<}M8u?i0$6MI$
zKlTX)RHi}Ji^O}$iBt)+Mza<qMSB3zFNCczpoFET-QL7tWE-an3F?O%!<Yu*6zK-?
zJg2}8{0un-m6CW+5+cfO){^f;lNwaa|Hi7W@A3p=hR-s}tQ4PReHK;PH`4Bxo=H-Z
zOI!~WvWIn36)hQ2C#99CDr&m{v*mF4dEDu??D6t;6^(6GCs_%$S>(WWX(Cu&s>~ko
zk!pqotLHDbGDNLZM83RARcqr41bh~uF0zgRmvr}nHH(jjJ8vfsynzra<|GJ9YGkST
zG8S!C)2{Tp4wD6}VhOR?gH*?RT$s3BRMy9=J0b!=2YRWXCYdT=pE0z*YQ_bbbY5&V
z>i}4II1!m^BeAV3fM{jQ<3+|MUMth$g6A@N$cc<iA|DK8ypc-OuHJ-`sn^b<4`=i&
zcD(|OwO~-xKaPI<b%LJXOcDg+*W<6qBRaj@&#lQGy2&28$sQW2!Qhy0vWFHCZ<L&&
z$sSrdbfhv7|Nrcv$DVO-@!VujsYyuNr|f_kw*~Qs<Er%RTYO^K_BtW3xUh~d=Z%ai
zJ!9VM^!NMz2(#VsyZe+WD}SH3%)RrNtZ}SgSk{&Ut{XkrbLqwh^`AbTU#fnD&?1VS
Mo&5Ri^LfPo0VWXwrT_o{

literal 0
HcmV?d00001

diff --git a/test/unit/fem/python/manifolds.py b/test/unit/fem/python/manifolds.py
new file mode 100644
index 0000000..f632ee4
--- /dev/null
+++ b/test/unit/fem/python/manifolds.py
@@ -0,0 +1,275 @@
+"""Unit tests for the solve function on manifolds
+embedded in higher dimensional spaces."""
+
+# Copyright (C) 2012 Imperial College London and others.
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by David Ham 2012
+#
+# First added:  2012-12-06
+# Last changed: 2014-05-28
+
+# MER: The solving test should be moved into test/regression/..., the
+# evaluatebasis part should be moved into test/unit/FiniteElement.py
+
+import unittest
+from dolfin import *
+from itertools import izip
+
+import numpy
+
+# Subdomain to extract bottom boundary.
+class BottomEdge(SubDomain):
+    def inside(self, x, on_boundary):
+        return near(x[2], 0.0)
+
+class Rotation(object):
+    """Class implementing rotations of the unit plane through an angle
+    of phi about the x axis followed by theta about the z axis."""
+    def __init__(self, phi, theta):
+        self.theta = theta
+        self.mat = numpy.dot(self._zmat(theta), self._xmat(phi))
+        self.invmat = numpy.dot(self._xmat(-phi), self._zmat(-theta))
+
+    def _zmat(self, theta):
+        return numpy.array([[numpy.cos(theta), -numpy.sin(theta), 0.0],
+                            [numpy.sin(theta),  numpy.cos(theta), 0.0],
+                            [0.0,           0.0,          1.0]])
+
+    def _xmat(self, phi):
+        return numpy.array([[1.0,           0.0,           0.0],
+                            [0.0,  numpy.cos(phi), -numpy.sin(phi)],
+                            [0.0,  numpy.sin(phi),  numpy.cos(phi)]])
+
+    def to_plane(self, x):
+        """Map the point x back to the horizontal plane."""
+        return numpy.dot(self.invmat, x)
+
+    def x(self, i):
+        """Produce a C expression for the ith component
+        of the image of x mapped back to the horizontal plane."""
+
+        return "("+" + ".join(["%.17f * x[%d]" % (a, j)
+                               for (j,a) in enumerate(self.invmat[i,:])])+")"
+
+    def rotate(self, mesh):
+        """Rotate mesh through phi then theta."""
+
+        mesh.coordinates()[:,:] = \
+            numpy.dot(mesh.coordinates()[:,:], self.mat.T)
+
+    def rotate_point(self, point):
+        """Rotate point through phi then theta."""
+
+        return numpy.dot(point, self.mat.T)
+
+def poisson_2d():
+
+    # Create mesh and define function space
+    mesh = UnitSquareMesh(32, 32)
+    V = FunctionSpace(mesh, "Lagrange", 1)
+
+    # Define Dirichlet boundary (x = 0 or x = 1)
+    def boundary(x):
+        return x[0] < DOLFIN_EPS or x[0] > 1.0 - DOLFIN_EPS
+
+    # Define boundary condition
+    u0 = Constant(0.0)
+    bc = DirichletBC(V, u0, boundary)
+
+    # Define variational problem
+    u = TrialFunction(V)
+    v = TestFunction(V)
+    f = Expression("10*exp(-(pow(x[0] - 0.5, 2) + pow(x[1] - 0.5, 2)) / 0.02)")
+    g = Expression("sin(5*x[0])")
+    a = inner(grad(u), grad(v))*dx
+    L = f*v*dx + g*v*ds
+
+    # Compute solution
+    u = Function(V)
+    solve(a == L, u, bc)
+
+    return u
+
+def poisson_manifold():
+
+    # Create mesh
+    cubemesh = UnitCubeMesh(32, 32, 2)
+
+    boundarymesh = BoundaryMesh(cubemesh, "exterior")
+
+    mesh = SubMesh(boundarymesh, BottomEdge())
+
+    rotation = Rotation(numpy.pi/4, numpy.pi/4)
+    rotation.rotate(mesh)
+
+    # Define function space
+    V = FunctionSpace(mesh, "Lagrange", 1)
+
+    # Define Dirichlet boundary (x = 0 or x = 1)
+    def boundary(x):
+        return rotation.to_plane(x)[0] < DOLFIN_EPS or \
+            rotation.to_plane(x)[0] > 1.0 - DOLFIN_EPS
+
+    # Define boundary condition
+    u0 = Constant(0.0)
+    bc = DirichletBC(V, u0, boundary)
+
+    # Define variational problem
+    u = TrialFunction(V)
+    v = TestFunction(V)
+    f = Expression(("10*exp(-(pow(x[0] - %.17f, 2) "
+                    + " + pow(x[1] - %.17f, 2)"
+                    + " + pow(x[2] - %.17f, 2)) / 0.02)")\
+                       % tuple(rotation.rotate_point([0.5,0.5,0])))
+    g = Expression("sin(5*%s)"%rotation.x(0))
+
+    a = inner(grad(u), grad(v))*dx
+    L = f*v*dx + g*v*ds
+
+    # Compute solution
+    u = Function(V)
+    solve(a == L, u, bc)
+
+    return u
+
+def rotate_2d_mesh(theta):
+    """Unit square mesh in 2D rotated through theta about the x and z
+    axes."""
+
+    cubemesh = UnitCubeMesh(1,1,1)
+    boundarymesh = BoundaryMesh(cubemesh, "exterior")
+    mesh = SubMesh(boundarymesh, BottomEdge())
+
+    mesh.init_cell_orientations(Expression(("0.","0.","1.")))
+
+    rotation = Rotation(theta, theta)
+    rotation.rotate(mesh)
+
+    return mesh
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class ManifoldSolving(unittest.TestCase):
+
+    def test_poisson2D_in_3D(self):
+        """This test solves Poisson's equation on a unit square in 2D,
+        and then on a unit square embedded in 3D and rotated pi/4
+        radians about each of the z and x axes."""
+
+        u_2D = poisson_2d()
+        u_manifold = poisson_manifold()
+
+        self.assertAlmostEqual(u_2D.vector().norm("l2"),
+                               u_manifold.vector().norm("l2"), 10)
+        self.assertAlmostEqual(u_2D.vector().max(),
+                               u_manifold.vector().max(), 10)
+        self.assertAlmostEqual(u_2D.vector().min(),
+                               u_manifold.vector().min(), 10)
+
+class ManifoldBasisEvaluation(unittest.TestCase):
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_basis_evaluation_2D_in_3D(self):
+        """This test checks that basis functions and their derivatives are
+        unaffected by rotations."""
+
+        self.basemesh = rotate_2d_mesh(0.0)
+        self.rotmesh  = rotate_2d_mesh(numpy.pi/4)
+
+        self.rotation = Rotation(numpy.pi/4, numpy.pi/4)
+
+        for i in range(4):
+            self.basis_test("CG", i + 1)
+        for i in range(5):
+            self.basis_test("DG", i)
+
+        for i in range(4):
+            self.basis_test("RT", i + 1, piola=True)
+        for i in range(4):
+            self.basis_test("DRT", i + 1, piola=True)
+        for i in range(4):
+            self.basis_test("BDM", i + 1, piola=True)
+        for i in range(4):
+            self.basis_test("N1curl", i + 1, piola=True)
+        self.basis_test("BDFM", 2, piola=True)
+
+    def basis_test(self, family, degree, piola=False):
+
+        parameters["form_compiler"]["no-evaluate_basis_derivatives"] = False
+
+        f_base = FunctionSpace(self.basemesh, family, degree)
+        f_rot = FunctionSpace(self.rotmesh, family, degree)
+
+        points = numpy.array([[1.0, 1.0, 0.0],
+                              [0.5, 0.5, 0.0],
+                              [0.3, 0.7, 0.0],
+                              [0.4, 0.0, 0.0]])
+
+        for cell_base, cell_rot in izip(cells(self.basemesh), cells(self.rotmesh)):
+
+            values_base = numpy.zeros(f_base.element().value_dimension(0))
+            derivs_base = numpy.zeros(f_base.element().value_dimension(0)*3)
+            values_rot = numpy.zeros(f_rot.element().value_dimension(0))
+            derivs_rot = numpy.zeros(f_rot.element().value_dimension(0)*3)
+
+            # Get cell vertices
+            vertex_coordinates_base = cell_base.get_vertex_coordinates()
+            vertex_coordinates_rot  = cell_rot.get_vertex_coordinates()
+
+            for i in range(f_base.element().space_dimension()):
+                for point in points:
+                    f_base.element().evaluate_basis(i, values_base,
+                                                    point,
+                                                    vertex_coordinates_base,
+                                                    cell_base.orientation())
+
+                    f_base.element().evaluate_basis_derivatives(i, 1, derivs_base,
+                                                                point, vertex_coordinates_base,
+                                                                cell_base.orientation())
+
+                    f_rot.element().evaluate_basis(i, values_rot,
+                                                   self.rotation.rotate_point(point),
+                                                   vertex_coordinates_rot,
+                                                   cell_rot.orientation())
+
+                    f_base.element().evaluate_basis_derivatives(i, 1, derivs_rot,
+                                                                self.rotation.rotate_point(point),
+                                                                vertex_coordinates_rot,
+                                                                cell_rot.orientation())
+
+                    if piola:
+                        values_cmp = self.rotation.rotate_point(values_base)
+
+                        derivs_rot2 = derivs_rot.reshape(f_rot.element().value_dimension(0),3)
+                        derivs_base2 = derivs_base.reshape(f_base.element().value_dimension(0),3)
+                        # If D is the unrotated derivative tensor, then RDR^T is the rotated version.
+                        derivs_cmp = numpy.dot(self.rotation.mat, self.rotation.rotate_point(derivs_base2))
+                    else:
+                        values_cmp = values_base
+                        # Rotate the derivative for comparison.
+                        derivs_cmp = self.rotation.rotate_point(derivs_base)
+                        derivs_rot2 = derivs_rot
+
+                    self.assertAlmostEqual(abs(derivs_rot2-derivs_cmp).max(), 0.0, 10)
+                    self.assertAlmostEqual(abs(values_cmp-values_rot).max(), 0.0, 10)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing solving and evaluate basis over manifolds"
+    print "-------------------------------------------------"
+
+    unittest.main()
diff --git a/test/unit/fem/python/solving.py b/test/unit/fem/python/solving.py
new file mode 100644
index 0000000..d302eb5
--- /dev/null
+++ b/test/unit/fem/python/solving.py
@@ -0,0 +1,95 @@
+"""Unit tests for the solve function"""
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-11-10
+# Last changed: 2011-11-10
+
+import unittest
+from dolfin import *
+
+class Solving(unittest.TestCase):
+
+    def test_bcs(self):
+        "Check that the bcs argument is picked up"
+
+        mesh = UnitSquareMesh(4, 4)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        f = Constant(100.0)
+
+        a = dot(grad(u), grad(v))*dx + u*v*dx
+        L = f*v*dx
+
+        bc = DirichletBC(V, 0.0, DomainBoundary())
+
+        # Single bc argument
+        u1 = Function(V)
+        solve(a == L, u1, bc)
+
+        # List of bcs
+        u2 = Function(V)
+        solve(a == L, u2, [bc])
+
+        # Single bc keyword argument
+        u3 = Function(V)
+        solve(a == L, u3, bcs=bc)
+
+        # List of bcs keyword argument
+        u4 = Function(V)
+        solve(a == L, u4, bcs=[bc])
+
+        # Check all solutions
+        self.assertAlmostEqual(u1.vector().norm("l2"), 14.9362601686, 10)
+        self.assertAlmostEqual(u2.vector().norm("l2"), 14.9362601686, 10)
+        self.assertAlmostEqual(u3.vector().norm("l2"), 14.9362601686, 10)
+        self.assertAlmostEqual(u4.vector().norm("l2"), 14.9362601686, 10)
+
+    def test_calling(self):
+        "Test that unappropriate arguments are not allowed"
+        mesh = UnitSquareMesh(4, 4)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        u = TrialFunction(V)
+        v = TestFunction(V)
+        f = Constant(100.0)
+
+        a = dot(grad(u), grad(v))*dx + u*v*dx
+        L = f*v*dx
+
+        bc = DirichletBC(V, 0.0, DomainBoundary())
+
+        kwargs = {"solver_parameters":{"linear_solver": "lu"},
+                  "form_compiler_parameters":{"optimize": True}}
+
+        A = assemble(a)
+        b = assemble(L)
+        x = Vector()
+
+        def wrong_solve_0():
+            solve(A, x, b, **kwargs)
+
+        self.assertRaises(RuntimeError, wrong_solve_0)
+
+        # FIXME: Include more tests for this versatile function
+
+if __name__ == "__main__":
+    print ""
+    print "Testing the solve function"
+    print "--------------------------"
+    unittest.main()
diff --git a/test/unit/fem/python/tetrahedron.xml.gz b/test/unit/fem/python/tetrahedron.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..cef35b62c9a9bb394c955519a4418469df30b651
GIT binary patch
literal 254
zcmV<a00I9WiwFq1%Zo|^19W9{a$#s?WO8qAE_iKh0F97AZo?oDMfaRyH2azmcM(P4
z>~ezU0F{}<NH#<U*^W;ijP1lyRkfQzFi)TVzdQ|14IQ=KIIB=(I|Q<&)5hKuUcSyB
z2Rs#wN$u*Zu@GtNkMl)g6~g_<dEfWhm8>a!=Gq&dw;T%wARF=(lvLN@aVLd=Li=5j
zZk<KYrcszDE|SqiFeQ2LW{l+L^1f_n0An=`3Zuh$KGGc1<iEfo!Qy}Lexoe@g7Y6X
z#0!>u4YS;*0@h&S9c<IaCSA9i50NCheKOYN)0Z#(B$x{3Q^N(5OYH@F0{0-1Q_}$e
E0CFREi~s-t

literal 0
HcmV?d00001

diff --git a/test/unit/function/cpp/CMakeLists.txt b/test/unit/function/cpp/CMakeLists.txt
new file mode 100644
index 0000000..c5f919e
--- /dev/null
+++ b/test/unit/function/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME test_function)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(test_Expression Expression.cpp)
+
+# Target libraries
+target_link_libraries(test_Expression ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/test/unit/function/cpp/Expression.cpp b/test/unit/function/cpp/Expression.cpp
new file mode 100644
index 0000000..2ca1633
--- /dev/null
+++ b/test/unit/function/cpp/Expression.cpp
@@ -0,0 +1,111 @@
+// Copyright (C) 2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Garth N. Wells, 2008.
+// Modified by Johannes Ring, 2009.
+// Modified by Benjamin Kehlet 2012
+//
+// First added:  2007-05-24
+// Last changed: 2012-11-12
+//
+// Unit tests for the function library
+
+#include <boost/assign/list_of.hpp>
+#include <dolfin.h>
+#include <dolfin/common/unittest.h>
+#include "Projection.h"
+
+using namespace dolfin;
+
+class Eval : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(Eval);
+  CPPUNIT_TEST(testArbitraryEval);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testArbitraryEval()
+  {
+    class F0 : public Expression
+    {
+    public:
+
+      F0() {}
+
+      void eval(Array<double>& values, const Array<double>& x) const
+      {
+        values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2]);
+      }
+    };
+
+    class F1 : public Expression
+    {
+    public:
+
+      F1() {}
+
+      void eval(Array<double>& values, const Array<double>& x) const
+      {
+        values[0] = 1.0 + 3.0*x[0] + 4.0*x[1] + 0.5*x[2];
+      }
+    };
+
+    UnitCubeMesh mesh(8, 8, 8);
+
+    Array<double> x(3);
+    x[0] = 0.31; x[1] = 0.32; x[2] = 0.33;
+
+    Array<double> u0(1);
+    Array<double> u1(1);
+
+    // User-defined functions (one from finite element space, one not)
+    F0 f0;
+    F1 f1;
+
+    // Test evaluation of a user-defined function
+    f0.eval(u0, x);
+    CPPUNIT_ASSERT_DOUBLES_EQUAL(u0[0],
+                                 sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2]),
+                                 DOLFIN_EPS);
+
+    #ifdef HAS_CGAL
+    if (dolfin::MPI::size(mesh.mpi_comm()) == 1)
+    {
+      // Test evaluation of a discrete function
+      Projection::FunctionSpace V(mesh);
+      Projection::BilinearForm a(V, V);
+      Projection::LinearForm L(V);
+      L.f = f1;
+      Function g(V);
+      solve(a == L, g);
+
+      const double tol = 1.0e-6;
+      f1.eval(u0, x);
+      g.eval(u1, x);
+      CPPUNIT_ASSERT(std::abs(u0[0]-u1[0]) < tol);
+    }
+    #endif
+  }
+};
+
+CPPUNIT_TEST_SUITE_REGISTRATION(Eval);
+
+int main()
+{
+  DOLFIN_TEST;
+}
diff --git a/test/unit/function/cpp/Projection.h b/test/unit/function/cpp/Projection.h
new file mode 100644
index 0000000..d45e52b
--- /dev/null
+++ b/test/unit/function/cpp/Projection.h
@@ -0,0 +1,4575 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __PROJECTION_H
+#define __PROJECTION_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class projection_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  projection_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::tetrahedron;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 10; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[9]  + vertex_coordinates[6] + vertex_coordinates[3]  - vertex_coordinates[0];
+    const double C1 = vertex_coordinates[10] + vertex_coordinates[7] + vertex_coordinates[4]  - vertex_coordinates[1];
+    const double C2 = vertex_coordinates[11] + vertex_coordinates[8] + vertex_coordinates[5]  - vertex_coordinates[2];
+    
+    // Compute subdeterminants
+    const double d_00 = J[4]*J[8] - J[5]*J[7];
+    const double d_01 = J[5]*J[6] - J[3]*J[8];
+    const double d_02 = J[3]*J[7] - J[4]*J[6];
+    const double d_10 = J[2]*J[7] - J[1]*J[8];
+    const double d_11 = J[0]*J[8] - J[2]*J[6];
+    const double d_12 = J[1]*J[6] - J[0]*J[7];
+    const double d_20 = J[1]*J[5] - J[2]*J[4];
+    const double d_21 = J[2]*J[3] - J[0]*J[5];
+    const double d_22 = J[0]*J[4] - J[1]*J[3];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (d_00*(2.0*x[0] - C0) + d_10*(2.0*x[1] - C1) + d_20*(2.0*x[2] - C2)) / detJ;
+    double Y = (d_01*(2.0*x[0] - C0) + d_11*(2.0*x[1] - C1) + d_21*(2.0*x[2] - C2)) / detJ;
+    double Z = (d_02*(2.0*x[0] - C0) + d_12*(2.0*x[1] - C1) + d_22*(2.0*x[2] - C2)) / detJ;
+    
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[9][2];
+    for (unsigned int row = 0; row < 9; row++)
+    {
+      for (unsigned int col = 0; col < 2; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 2)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[3][3] = {{K[0], K[1], K[2]}, {K[3], K[4], K[5]}, {K[6], K[7], K[8]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[9][9];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, -0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, 0.050395263067897, 0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189625, 0.0608580619450185, -0.0351364184463153, -0.0248451997499977, 0.0650600048632355, -0.050395263067897, -0.0411475599898912, 0.0290957186981323, 0.0237565548366599, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0702728368926306, -0.0248451997499977, 0.0, 0.0, 0.0, 0.0872871560943969, -0.0475131096733199, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 3:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {-0.0577350269189626, 0.0, 0.0, 0.074535599249993, 0.0, 0.0, 0.0, 0.0, 0.0, 0.100790526135794};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 4:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, 0.140545673785261, 0.0993807989999906, 0.0, 0.0, 0.0, 0.0, 0.1187827741833, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 5:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, -0.0702728368926307, 0.0993807989999907, 0.0, 0.0, 0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 6:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.121716123890037, 0.0702728368926307, -0.0993807989999906, 0.0, 0.100790526135794, -0.0205737799949456, -0.087287156094397, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 7:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, -0.0702728368926306, 0.0993807989999906, 0.0, 0.0, -0.102868899974728, 0.0, -0.0593913870916499, -0.0671936840905293};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 8:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, -0.121716123890037, 0.0702728368926306, -0.0993807989999906, 0.0, -0.100790526135794, 0.0205737799949456, -0.0872871560943969, -0.01187827741833, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 9:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[10] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = 0.5*(2.0 + Y + Z + 2.0*X);
+      double tmp1 = 0.25*(Y + Z)*(Y + Z);
+      double tmp2 = 0.5*(1.0 + Z + 2.0*Y);
+      double tmp3 = 0.5*(1.0 - Z);
+      double tmp4 = tmp3*tmp3;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[4] = 1.5*tmp0*basisvalues[1] - 0.5*tmp1*basisvalues[0];
+      basisvalues[2] = 0.5*(2.0 + 3.0*Y + Z)*basisvalues[0];
+      basisvalues[5] = (0.5*(2.0 + 3.0*Y + Z) + 1.0*(1.0 + Y))*basisvalues[1];
+      basisvalues[7] = (1.66666666666667*tmp2 + 0.111111111111111*tmp3)*basisvalues[2] - 0.555555555555556*tmp4*basisvalues[0];
+      basisvalues[3] = (2.0*Z + 1.0)*basisvalues[0];
+      basisvalues[8] = (3.0*Z + 2.0)*basisvalues[2];
+      basisvalues[6] = (3.0*Z + 2.0)*basisvalues[1];
+      basisvalues[9] = basisvalues[3]*(0.3125 + 1.875*Z) - 0.5625*basisvalues[0];
+      basisvalues[0] *= std::sqrt(0.75);
+      basisvalues[3] *= std::sqrt(1.25);
+      basisvalues[9] *= std::sqrt(1.75);
+      basisvalues[2] *= std::sqrt(2.5);
+      basisvalues[8] *= std::sqrt(3.5);
+      basisvalues[7] *= std::sqrt(5.25);
+      basisvalues[1] *= std::sqrt(7.5);
+      basisvalues[6] *= std::sqrt(10.5);
+      basisvalues[5] *= std::sqrt(15.75);
+      basisvalues[4] *= std::sqrt(26.25);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[10] = \
+      {0.23094010767585, 0.0, -0.140545673785261, -0.0993807989999906, -0.130120009726471, 0.0, 0.0, 0.0290957186981323, 0.02375655483666, 0.0167984210226323};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {6.32455532033676, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 11.2249721603218, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {4.58257569495584, 0.0, 8.36660026534075, -1.18321595661992, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.74165738677394, 0.0, 0.0, 8.69482604771366, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats1[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.47722557505166, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 7.24568837309472, 4.18330013267038, -0.591607978309961, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 0.0, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-2.64575131106459, 0.0, 9.66091783079296, 0.683130051063973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.24037034920393, 0.0, 0.0, 7.52994023880668, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      static const double dmats2[10][10] = \
+      {{0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {3.16227766016838, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.82574185835055, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {5.16397779494322, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.95803989154981, 5.61248608016091, -1.08012344973464, -0.763762615825973, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {2.29128784747792, 1.44913767461894, 4.18330013267038, -0.591607978309962, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.87082869338697, 7.09929573971954, 0.0, 4.34741302385683, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.3228756555323, 0.0, 3.86436713231718, -0.341565025531987, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {1.08012344973464, 0.0, 7.09929573971954, 2.50998007960223, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {-3.81881307912987, 0.0, 0.0, 8.87411967464942, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[9];
+      for (unsigned int r = 0; r < 9; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[10][10] = \
+      {{1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0},
+      {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 10; t++)
+        {
+          for (unsigned int u = 0; u < 10; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 2)
+          {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            for (unsigned int u = 0; u < 10; u++)
+            {
+              for (unsigned int tu = 0; tu < 10; tu++)
+              {
+                dmats[t][u] += dmats2[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 10; s++)
+        {
+          for (unsigned int t = 0; t < 10; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 3;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 2)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[9];
+    for (unsigned int r = 0; r < 9; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 10; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      y[2] = vertex_coordinates[2];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[3];
+      y[1] = vertex_coordinates[4];
+      y[2] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[6];
+      y[1] = vertex_coordinates[7];
+      y[2] = vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 3:
+      {
+        y[0] = vertex_coordinates[9];
+      y[1] = vertex_coordinates[10];
+      y[2] = vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 4:
+      {
+        y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 5:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 6:
+      {
+        y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 7:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 8:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 9:
+      {
+        y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+      y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+      y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[3];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    y[2] = vertex_coordinates[2];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[3];
+    y[1] = vertex_coordinates[4];
+    y[2] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[6];
+    y[1] = vertex_coordinates[7];
+    y[2] = vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+    y[0] = vertex_coordinates[9];
+    y[1] = vertex_coordinates[10];
+    y[2] = vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[3] = vals[0];
+    y[0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[4] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[5] = vals[0];
+    y[0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[6] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    f.evaluate(vals, y, c);
+    values[7] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    f.evaluate(vals, y, c);
+    values[8] = vals[0];
+    y[0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    y[1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    y[2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[9] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+    vertex_values[3] = dof_values[3];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new projection_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class projection_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  projection_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('tetrahedron', 3)), 2, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return true;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    case 3:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0] + num_global_entities[1];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 10;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 6;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 1;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    case 3:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    unsigned int offset = 0;
+    dofs[0] = offset + c.entity_indices[0][0];
+    dofs[1] = offset + c.entity_indices[0][1];
+    dofs[2] = offset + c.entity_indices[0][2];
+    dofs[3] = offset + c.entity_indices[0][3];
+    offset += num_global_entities[0];
+    dofs[4] = offset + c.entity_indices[1][0];
+    dofs[5] = offset + c.entity_indices[1][1];
+    dofs[6] = offset + c.entity_indices[1][2];
+    dofs[7] = offset + c.entity_indices[1][3];
+    dofs[8] = offset + c.entity_indices[1][4];
+    dofs[9] = offset + c.entity_indices[1][5];
+    offset += num_global_entities[1];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 5;
+      dofs[5] = 6;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+      dofs[2] = 3;
+      dofs[3] = 4;
+      dofs[4] = 7;
+      dofs[5] = 8;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 3;
+      dofs[3] = 5;
+      dofs[4] = 7;
+      dofs[5] = 9;
+        break;
+      }
+    case 3:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+      dofs[2] = 2;
+      dofs[3] = 6;
+      dofs[4] = 8;
+      dofs[5] = 9;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 3)
+    {
+    throw std::runtime_error("d is larger than dimension (3)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 3)
+      {
+      throw std::runtime_error("i is larger than number of entities (3)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 3;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        if (i > 5)
+      {
+      throw std::runtime_error("i is larger than number of entities (5)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 4;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 5;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 6;
+          break;
+        }
+      case 3:
+        {
+          dofs[0] = 7;
+          break;
+        }
+      case 4:
+        {
+          dofs[0] = 8;
+          break;
+        }
+      case 5:
+        {
+          dofs[0] = 9;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    case 3:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[0][2] = vertex_coordinates[2];
+    dof_coordinates[1][0] = vertex_coordinates[3];
+    dof_coordinates[1][1] = vertex_coordinates[4];
+    dof_coordinates[1][2] = vertex_coordinates[5];
+    dof_coordinates[2][0] = vertex_coordinates[6];
+    dof_coordinates[2][1] = vertex_coordinates[7];
+    dof_coordinates[2][2] = vertex_coordinates[8];
+    dof_coordinates[3][0] = vertex_coordinates[9];
+    dof_coordinates[3][1] = vertex_coordinates[10];
+    dof_coordinates[3][2] = vertex_coordinates[11];
+    dof_coordinates[4][0] = 0.5*vertex_coordinates[6] + 0.5*vertex_coordinates[9];
+    dof_coordinates[4][1] = 0.5*vertex_coordinates[7] + 0.5*vertex_coordinates[10];
+    dof_coordinates[4][2] = 0.5*vertex_coordinates[8] + 0.5*vertex_coordinates[11];
+    dof_coordinates[5][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[9];
+    dof_coordinates[5][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[10];
+    dof_coordinates[5][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[11];
+    dof_coordinates[6][0] = 0.5*vertex_coordinates[3] + 0.5*vertex_coordinates[6];
+    dof_coordinates[6][1] = 0.5*vertex_coordinates[4] + 0.5*vertex_coordinates[7];
+    dof_coordinates[6][2] = 0.5*vertex_coordinates[5] + 0.5*vertex_coordinates[8];
+    dof_coordinates[7][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[9];
+    dof_coordinates[7][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[10];
+    dof_coordinates[7][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[11];
+    dof_coordinates[8][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[6];
+    dof_coordinates[8][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[7];
+    dof_coordinates[8][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[8];
+    dof_coordinates[9][0] = 0.5*vertex_coordinates[0] + 0.5*vertex_coordinates[3];
+    dof_coordinates[9][1] = 0.5*vertex_coordinates[1] + 0.5*vertex_coordinates[4];
+    dof_coordinates[9][2] = 0.5*vertex_coordinates[2] + 0.5*vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new projection_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class projection_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  projection_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    0
+    // Number of operations (multiply-add pairs) for tensor contraction: 50
+    // Total number of operations (multiply-add pairs):                  53
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.00238095238095238*G0_;
+    A[1] = 0.000396825396825396*G0_;
+    A[2] = 0.000396825396825396*G0_;
+    A[3] = 0.000396825396825396*G0_;
+    A[4] = -0.00238095238095238*G0_;
+    A[5] = -0.00238095238095238*G0_;
+    A[6] = -0.00238095238095238*G0_;
+    A[7] = -0.00158730158730159*G0_;
+    A[8] = -0.00158730158730158*G0_;
+    A[9] = -0.00158730158730159*G0_;
+    A[10] = 0.000396825396825396*G0_;
+    A[11] = 0.00238095238095238*G0_;
+    A[12] = 0.000396825396825395*G0_;
+    A[13] = 0.000396825396825396*G0_;
+    A[14] = -0.00238095238095238*G0_;
+    A[15] = -0.00158730158730158*G0_;
+    A[16] = -0.00158730158730158*G0_;
+    A[17] = -0.00238095238095238*G0_;
+    A[18] = -0.00238095238095238*G0_;
+    A[19] = -0.00158730158730158*G0_;
+    A[20] = 0.000396825396825396*G0_;
+    A[21] = 0.000396825396825395*G0_;
+    A[22] = 0.00238095238095238*G0_;
+    A[23] = 0.000396825396825396*G0_;
+    A[24] = -0.00158730158730159*G0_;
+    A[25] = -0.00238095238095238*G0_;
+    A[26] = -0.00158730158730158*G0_;
+    A[27] = -0.00238095238095238*G0_;
+    A[28] = -0.00158730158730159*G0_;
+    A[29] = -0.00238095238095238*G0_;
+    A[30] = 0.000396825396825396*G0_;
+    A[31] = 0.000396825396825396*G0_;
+    A[32] = 0.000396825396825396*G0_;
+    A[33] = 0.00238095238095238*G0_;
+    A[34] = -0.00158730158730159*G0_;
+    A[35] = -0.00158730158730159*G0_;
+    A[36] = -0.00238095238095238*G0_;
+    A[37] = -0.00158730158730159*G0_;
+    A[38] = -0.00238095238095238*G0_;
+    A[39] = -0.00238095238095238*G0_;
+    A[40] = -0.00238095238095238*G0_;
+    A[41] = -0.00238095238095238*G0_;
+    A[42] = -0.00158730158730159*G0_;
+    A[43] = -0.00158730158730159*G0_;
+    A[44] = 0.0126984126984127*G0_;
+    A[45] = 0.00634920634920635*G0_;
+    A[46] = 0.00634920634920635*G0_;
+    A[47] = 0.00634920634920635*G0_;
+    A[48] = 0.00634920634920634*G0_;
+    A[49] = 0.00317460317460317*G0_;
+    A[50] = -0.00238095238095238*G0_;
+    A[51] = -0.00158730158730158*G0_;
+    A[52] = -0.00238095238095238*G0_;
+    A[53] = -0.00158730158730159*G0_;
+    A[54] = 0.00634920634920635*G0_;
+    A[55] = 0.0126984126984127*G0_;
+    A[56] = 0.00634920634920635*G0_;
+    A[57] = 0.00634920634920635*G0_;
+    A[58] = 0.00317460317460317*G0_;
+    A[59] = 0.00634920634920635*G0_;
+    A[60] = -0.00238095238095238*G0_;
+    A[61] = -0.00158730158730158*G0_;
+    A[62] = -0.00158730158730158*G0_;
+    A[63] = -0.00238095238095238*G0_;
+    A[64] = 0.00634920634920635*G0_;
+    A[65] = 0.00634920634920635*G0_;
+    A[66] = 0.0126984126984127*G0_;
+    A[67] = 0.00317460317460317*G0_;
+    A[68] = 0.00634920634920634*G0_;
+    A[69] = 0.00634920634920635*G0_;
+    A[70] = -0.00158730158730159*G0_;
+    A[71] = -0.00238095238095238*G0_;
+    A[72] = -0.00238095238095238*G0_;
+    A[73] = -0.00158730158730159*G0_;
+    A[74] = 0.00634920634920635*G0_;
+    A[75] = 0.00634920634920635*G0_;
+    A[76] = 0.00317460317460317*G0_;
+    A[77] = 0.0126984126984127*G0_;
+    A[78] = 0.00634920634920635*G0_;
+    A[79] = 0.00634920634920635*G0_;
+    A[80] = -0.00158730158730158*G0_;
+    A[81] = -0.00238095238095238*G0_;
+    A[82] = -0.00158730158730159*G0_;
+    A[83] = -0.00238095238095238*G0_;
+    A[84] = 0.00634920634920634*G0_;
+    A[85] = 0.00317460317460317*G0_;
+    A[86] = 0.00634920634920634*G0_;
+    A[87] = 0.00634920634920635*G0_;
+    A[88] = 0.0126984126984127*G0_;
+    A[89] = 0.00634920634920634*G0_;
+    A[90] = -0.00158730158730159*G0_;
+    A[91] = -0.00158730158730158*G0_;
+    A[92] = -0.00238095238095238*G0_;
+    A[93] = -0.00238095238095238*G0_;
+    A[94] = 0.00317460317460317*G0_;
+    A[95] = 0.00634920634920635*G0_;
+    A[96] = 0.00634920634920635*G0_;
+    A[97] = 0.00634920634920635*G0_;
+    A[98] = 0.00634920634920634*G0_;
+    A[99] = 0.0126984126984127*G0_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class projection_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  projection_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    10
+    // Number of operations (multiply-add pairs) for tensor contraction: 95
+    // Total number of operations (multiply-add pairs):                  108
+    
+    // Compute Jacobian
+    double J[9];
+    compute_jacobian_tetrahedron_3d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[9];
+    double detJ;
+    compute_jacobian_inverse_tetrahedron_3d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    const double G0_3 = det*w[0][3]*(1.0);
+    const double G0_4 = det*w[0][4]*(1.0);
+    const double G0_5 = det*w[0][5]*(1.0);
+    const double G0_6 = det*w[0][6]*(1.0);
+    const double G0_7 = det*w[0][7]*(1.0);
+    const double G0_8 = det*w[0][8]*(1.0);
+    const double G0_9 = det*w[0][9]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.00238095238095238*G0_0 + 0.000396825396825396*G0_1 + 0.000396825396825396*G0_2 + 0.000396825396825396*G0_3 - 0.00238095238095238*G0_4 - 0.00238095238095238*G0_5 - 0.00238095238095238*G0_6 - 0.00158730158730159*G0_7 - 0.00158730158730158*G0_8 - 0.00158730158730159*G0_9;
+    A[1] = 0.000396825396825396*G0_0 + 0.00238095238095238*G0_1 + 0.000396825396825395*G0_2 + 0.000396825396825396*G0_3 - 0.00238095238095238*G0_4 - 0.00158730158730158*G0_5 - 0.00158730158730158*G0_6 - 0.00238095238095238*G0_7 - 0.00238095238095238*G0_8 - 0.00158730158730158*G0_9;
+    A[2] = 0.000396825396825396*G0_0 + 0.000396825396825395*G0_1 + 0.00238095238095238*G0_2 + 0.000396825396825396*G0_3 - 0.00158730158730159*G0_4 - 0.00238095238095238*G0_5 - 0.00158730158730158*G0_6 - 0.00238095238095238*G0_7 - 0.00158730158730159*G0_8 - 0.00238095238095238*G0_9;
+    A[3] = 0.000396825396825396*G0_0 + 0.000396825396825396*G0_1 + 0.000396825396825396*G0_2 + 0.00238095238095238*G0_3 - 0.00158730158730159*G0_4 - 0.00158730158730159*G0_5 - 0.00238095238095238*G0_6 - 0.00158730158730159*G0_7 - 0.00238095238095238*G0_8 - 0.00238095238095238*G0_9;
+    A[4] = -0.00238095238095238*G0_0 - 0.00238095238095238*G0_1 - 0.00158730158730159*G0_2 - 0.00158730158730159*G0_3 + 0.0126984126984127*G0_4 + 0.00634920634920635*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00634920634920634*G0_8 + 0.00317460317460317*G0_9;
+    A[5] = -0.00238095238095238*G0_0 - 0.00158730158730158*G0_1 - 0.00238095238095238*G0_2 - 0.00158730158730159*G0_3 + 0.00634920634920635*G0_4 + 0.0126984126984127*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00317460317460317*G0_8 + 0.00634920634920635*G0_9;
+    A[6] = -0.00238095238095238*G0_0 - 0.00158730158730158*G0_1 - 0.00158730158730158*G0_2 - 0.00238095238095238*G0_3 + 0.00634920634920635*G0_4 + 0.00634920634920635*G0_5 + 0.0126984126984127*G0_6 + 0.00317460317460317*G0_7 + 0.00634920634920634*G0_8 + 0.00634920634920635*G0_9;
+    A[7] = -0.00158730158730159*G0_0 - 0.00238095238095238*G0_1 - 0.00238095238095238*G0_2 - 0.00158730158730159*G0_3 + 0.00634920634920635*G0_4 + 0.00634920634920635*G0_5 + 0.00317460317460317*G0_6 + 0.0126984126984127*G0_7 + 0.00634920634920635*G0_8 + 0.00634920634920635*G0_9;
+    A[8] = -0.00158730158730158*G0_0 - 0.00238095238095238*G0_1 - 0.00158730158730159*G0_2 - 0.00238095238095238*G0_3 + 0.00634920634920634*G0_4 + 0.00317460317460317*G0_5 + 0.00634920634920634*G0_6 + 0.00634920634920635*G0_7 + 0.0126984126984127*G0_8 + 0.00634920634920634*G0_9;
+    A[9] = -0.00158730158730159*G0_0 - 0.00158730158730158*G0_1 - 0.00238095238095238*G0_2 - 0.00238095238095238*G0_3 + 0.00317460317460317*G0_4 + 0.00634920634920635*G0_5 + 0.00634920634920635*G0_6 + 0.00634920634920635*G0_7 + 0.00634920634920634*G0_8 + 0.0126984126984127*G0_9;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class projection_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  projection_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "3b167d47d86e6d08a9afe04ee5d4a2f17cae4ae856ed1b48eb7abc1cebd69e58d89332adfd41113b9a7753b87b0e8d966a7855db051c30750af570be0f38418e";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new projection_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class projection_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  projection_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~projection_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "43145964686b6b70399e810d68d5808ce481de0ab7937b15e48b40c9c4e3f124b2b0cfc9e3998c7c2f4200754bde07ead6b75338da5888fb3b177a9b17db6f81";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new projection_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new projection_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new projection_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace Projection
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new projection_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new projection_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new projection_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/test/unit/function/cpp/Projection.ufl b/test/unit/function/cpp/Projection.ufl
new file mode 100644
index 0000000..2b6fec7
--- /dev/null
+++ b/test/unit/function/cpp/Projection.ufl
@@ -0,0 +1,33 @@
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-03-17
+# Last changed: 2008-03-17
+#
+# The bilinear form a(v, u) and linear form L(v) for
+# projection onto piecewise quadratics.
+#
+# Compile this form with FFC: ffc -l dolfin Projection.form.
+
+element = FiniteElement("Lagrange", tetrahedron, 2)
+
+v = TestFunction(element)
+u = TrialFunction(element)
+f = Coefficient(element)
+
+a = v*u*dx
+L = v*f*dx
diff --git a/test/unit/function/cpp/compile.log b/test/unit/function/cpp/compile.log
new file mode 100644
index 0000000..e76290e
--- /dev/null
+++ b/test/unit/function/cpp/compile.log
@@ -0,0 +1,242 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form Projection
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    3
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Estimated cost of tensor representation: 0
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    3
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG2(?)'
+  Unique sub elements:    'CG2(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 4
+  quadrature_degree: auto --> 4
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0335219 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  100 entries computed in 0.00162 seconds
+  Shape of reference tensor: (10, 10)
+  Primary multi index:   rank = 2 dims = [10, 10] indices = [[0, 0], [0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 0], [2, 1], [2, 2], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 0], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [6, 0], [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [6, 7], [6, 8], [6, 9], [7, 0], [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [7, 9], [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 6], [8, 7], [8, 8], [8, 9], [9, 0], [9, 1], [9, 2], [9, 3], [9, 4], [9, 5], [9, 6], [9, 7], [9, 8], [9, 9]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  100 entries computed in 0.00122 seconds
+  Shape of reference tensor: (10, 10)
+  Primary multi index:   rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [10] indices = [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.011097 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.00039196 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.311454 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.00082016 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./Projection.h.
+  
+Compiler stage 5 finished in 0.00115609 seconds.
+
+FFC finished in 0.358908 seconds.
diff --git a/test/unit/function/python/Constant.py b/test/unit/function/python/Constant.py
new file mode 100644
index 0000000..f5ec0dd
--- /dev/null
+++ b/test/unit/function/python/Constant.py
@@ -0,0 +1,86 @@
+"""Unit tests for the function library"""
+
+# Copyright (C) 2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2007-05-24
+# Last changed: 2011-01-28
+
+import unittest
+from numpy import array
+from dolfin import *
+
+
+mesh = UnitCubeMesh(8, 8, 8)
+V = FunctionSpace(mesh, 'CG', 1)
+W = VectorFunctionSpace(mesh, 'CG', 1)
+
+class Constants(unittest.TestCase):
+
+     def test_name_argument(self):
+          u = Constant(1.0)
+          v = Constant(1.0, name="v")
+          self.assertEqual(u.name(), "f_%d" % u.count())
+          self.assertEqual(v.name(), "v")
+          self.assertEqual(str(v), "v")
+
+     def testConstantInit(self):
+          c0 = Constant(1.)
+          c1 = Constant([2,3], interval)
+          c2 = Constant([[2,3], [3,4]], triangle)
+          c3 = Constant(array([2,3]), tetrahedron)
+
+          # FIXME:
+          self.assertTrue(c0.cell() is None)
+          self.assertTrue(c1.cell() == interval)
+          self.assertTrue(c2.cell() == triangle)
+          self.assertTrue(c3.cell() == tetrahedron)
+
+          self.assertTrue(c0.shape() == ())
+          self.assertTrue(c1.shape() == (2,))
+          self.assertTrue(c2.shape() == (2,2))
+          self.assertTrue(c3.shape() == (2,))
+
+     def testGrad(self):
+          import ufl
+          zero = ufl.constantvalue.Zero((2,3))
+          c0 = Constant(1.)
+          c3 = Constant(array([2,3]), tetrahedron)
+          def gradient(c):
+               return grad(c)
+          self.assertRaises(UFLException, gradient, c0)
+          self.assertEqual(zero, gradient(c3))
+
+     def test_compute_vertex_values(self):
+          from numpy import zeros, all, array
+
+          e0 = Constant(1)
+          e1 = Constant((1, 2, 3))
+
+          #e0_values = zeros(mesh.num_vertices(),dtype='d')
+          #e1_values = zeros(mesh.num_vertices()*3,dtype='d')
+
+          e0_values = e0.compute_vertex_values(mesh)
+          e1_values = e1.compute_vertex_values(mesh)
+
+          self.assertTrue(all(e0_values==1))
+          self.assertTrue(all(e1_values[:mesh.num_vertices()]==1))
+          self.assertTrue(all(e1_values[mesh.num_vertices():mesh.num_vertices()*2]==2))
+          self.assertTrue(all(e1_values[mesh.num_vertices()*2:mesh.num_vertices()*3]==3))
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/function/python/ConstrainedFunctionSpace.py b/test/unit/function/python/ConstrainedFunctionSpace.py
new file mode 100644
index 0000000..bfc066f
--- /dev/null
+++ b/test/unit/function/python/ConstrainedFunctionSpace.py
@@ -0,0 +1,168 @@
+"""Unit tests for FunctionSpace with constrained domain"""
+
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Mikael Mortensen 2013
+#
+# First added:  2012-08-18
+# Last changed: 2013-04-12
+
+import unittest
+import numpy
+from dolfin import *
+
+class PeriodicBoundary2(SubDomain):
+    def __init__(self, tolerance=DOLFIN_EPS):
+        SubDomain.__init__(self, tolerance)
+        self.tol = tolerance
+    def inside(self, x, on_boundary):
+        return bool(x[0] < self.tol and x[0] > -self.tol and on_boundary)
+    def map(self, x, y):
+        y[0] = x[0] - 1.0
+        y[1] = x[1]
+
+class PeriodicBoundary3(SubDomain):
+    def inside(self, x, on_boundary):
+        return bool(x[0] < DOLFIN_EPS and x[0] > -DOLFIN_EPS and on_boundary)
+
+    def map(self, x, y):
+        y[0] = x[0] - 1.0
+        y[1] = x[1]
+        y[2] = x[2]
+
+class ConstrainedFunctionSpaceTest(unittest.TestCase):
+
+    def test_instantiation(self):
+        """ A rudimentary test for instantiation"""
+        
+        sub_domain = PeriodicBoundary3()
+        mesh = UnitCubeMesh(8, 8, 8)
+        V = FunctionSpace(mesh, "CG", 1, constrained_domain=sub_domain)
+
+    def test_instantiation_mixed_element(self):
+        """ A rudimentary test for instantiation with mixed elements"""
+
+        pbc = PeriodicBoundary2()
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1, constrained_domain=pbc)
+        VV = V*V
+
+    def test_instantiation_mixed_element_real(self):
+        """ A rudimentary test for instantiation with mixed elements that include a real space"""
+
+        pbc = PeriodicBoundary2()
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1, constrained_domain=pbc)
+        R = FunctionSpace(mesh, "Real", 0, constrained_domain=pbc)
+        VV = V*R
+        VV = R*V
+
+    def test_instantiation_no_vertex_element_2D(self):
+        """ A rudimentary test for instantiation for element that does
+        not require number of vertices (2D)"""
+
+        pbc = PeriodicBoundary2()
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "BDM", 1, constrained_domain=pbc)
+
+    def test_instantiation_no_vertex_element_3D(self):
+        """ A rudimentary test for instantiation for element that does
+        not require number of vertices (3D)"""
+
+        pbc = PeriodicBoundary3()
+        mesh = UnitCubeMesh(8, 8, 9)
+        V = FunctionSpace(mesh, "BDM", 1, constrained_domain=pbc)
+
+    def test_director_lifetime(self):
+        """Test for problems with objects with directors going out
+        of scope"""
+
+        mesh = UnitSquareMesh(8, 8)
+        V = FunctionSpace(mesh, "Lagrange", 1, constrained_domain=PeriodicBoundary2())
+
+
+    def test_tolerance(self):
+        """Test tolerance for matching periodic mesh entities"""
+        shift = 0.0001
+        mesh = UnitSquareMesh(8, 8)
+
+        # Randomly perturb mesh vertex coordinates
+        mesh_perturb = Mesh(mesh)
+        import random
+        for x in mesh_perturb.coordinates():
+            x[0] += random.uniform(-shift, shift)
+            x[1] += random.uniform(-shift, shift)
+
+        pbc = PeriodicBoundary2()
+        pbc_tol = PeriodicBoundary2(2*shift)
+
+        for dim in range(mesh.geometry().dim()):
+            periodic_pairs = PeriodicBoundaryComputation.compute_periodic_pairs(mesh, pbc, dim)
+            num_periodic_pairs0 =  len(periodic_pairs)
+
+            periodic_pairs = PeriodicBoundaryComputation.compute_periodic_pairs(mesh_perturb, pbc_tol, dim)
+            num_periodic_pairs1 = len(periodic_pairs)
+            self.assertEqual(num_periodic_pairs0, num_periodic_pairs1)
+
+
+    def test_solution(self):
+        """Test periodic constrained domain by checking solution to a PDE."""
+
+        # Create mesh and constrained FunctionSpace
+        mesh = UnitSquareMesh(8, 8)
+        pbc = PeriodicBoundary2()
+        V = FunctionSpace(mesh, "Lagrange", 1, constrained_domain=pbc)
+
+        class DirichletBoundary(SubDomain):
+            def inside(self, x, on_boundary):
+                return bool((x[1] < DOLFIN_EPS or x[1] > (1.0 - DOLFIN_EPS)) and on_boundary)
+
+        # Dirichlet boundary condition
+        dirichlet_boundary = DirichletBoundary()
+        bc0 = DirichletBC(V, 0.0, dirichlet_boundary)
+        bcs = [bc0]
+
+        # Define variational problem, linear formulation
+        u, v = TrialFunction(V), TestFunction(V)
+        f = Expression("sin(x[0])", degree=2)
+        a = dot(grad(u), grad(v))*dx
+        L = f*v*dx
+
+        # Compute solution
+        u = Function(V)
+        solve(a == L, u, bcs)
+
+        self.assertAlmostEqual(u.vector().norm("l2"), 0.3368694028630991, 10)
+
+        # Define variational problem, nonlinear formulation
+        u, v = Function(V), TestFunction(V)
+        f = Expression("sin(x[0])", degree=2)
+        a = dot(grad(u), grad(v))*dx
+        L = f*v*dx
+        F = a - L
+
+        # Compute solution
+        solve(F == 0, u, bcs)
+
+        self.assertAlmostEqual(u.vector().norm("l2"), 0.3368694028630991, 10)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing constrained (periodic) FunctionSpace"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/function/python/Expression.py b/test/unit/function/python/Expression.py
new file mode 100644
index 0000000..6588994
--- /dev/null
+++ b/test/unit/function/python/Expression.py
@@ -0,0 +1,658 @@
+"""Unit tests for the function library"""
+
+# Copyright (C) 2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Benjamin Kehlet 2012
+#
+# First added:  2007-05-24
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+from math   import sin, cos, exp, tan
+from numpy  import array, zeros, float_
+
+mesh = UnitCubeMesh(8, 8, 8)
+V = FunctionSpace(mesh, 'CG', 1)
+W = VectorFunctionSpace(mesh, 'CG', 1)
+
+class Eval(unittest.TestCase):
+
+     def test_arbitraryEval(self):
+          class F0(Expression):
+               def eval(self, values, x):
+                    values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])
+
+          f0 = F0(name="f0", label="My expression")
+          f1 = Expression("a*sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])", \
+                          degree=2, a=1., name="f1")
+          x = array([0.31, 0.32, 0.33])
+          u00 = zeros(1); u01 = zeros(1)
+          u10 = zeros(1); u20 = zeros(1)
+
+          # Check usergeneration of name and label
+          self.assertEqual(f0.name(), "f0")
+          self.assertEqual(str(f0), "f0")
+          self.assertEqual(f0.label(), "My expression")
+          self.assertEqual(f1.name(), "f1")
+          self.assertEqual(str(f1), "f1")
+          self.assertEqual(f1.label(), "User defined expression")
+
+          # Check outgeneration of name
+          count = int(F0().name()[2:])
+          self.assertEqual(F0().count(), count+1)
+
+          # Test original and vs short evaluation
+          f0.eval(u00, x)
+          f0(x, values = u01)
+          self.assertAlmostEqual(u00[0], u01[0])
+
+          # Evaluation with and without return value
+          f1(x, values = u10);
+          u11 = f1(x);
+          self.assertAlmostEqual(u10[0], u11)
+
+          # Test *args for coordinate argument
+          f1(0.31, 0.32, 0.33, values = u20)
+          u21 = f0(0.31, 0.32, 0.33)
+          self.assertAlmostEqual(u20[0], u21)
+
+          # Test Point evaluation
+          p0 = Point(0.31, 0.32, 0.33)
+          u21 = f1(p0)
+          self.assertAlmostEqual(u20[0], u21)
+
+          same_result = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])
+          self.assertAlmostEqual(u00[0], same_result)
+          self.assertAlmostEqual(u11, same_result)
+          self.assertAlmostEqual(u21, same_result)
+
+          # Projection requires CGAL
+          if not has_cgal():
+               return
+
+          x = (mesh.coordinates()[0]+mesh.coordinates()[1])/2
+          f2 = Expression("1.0 + 3.0*x[0] + 4.0*x[1] + 0.5*x[2]", degree=2)
+          V2 = FunctionSpace(mesh, 'CG', 2)
+          g0 = interpolate(f2, V=V2)
+          g1 = project(f2, V=V2)
+
+          u3 = f2(x)
+          u4 = g0(x)
+          u5 = g1(x)
+          self.assertAlmostEqual(u3, u4)
+          self.assertAlmostEqual(u3, u5, 4)
+
+     def test_ufl_eval(self):
+          class F0(Expression):
+               def eval(self, values, x):
+                    values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])
+
+          class V0(Expression):
+               def eval(self, values, x):
+                    values[0] = x[0]**2
+                    values[1] = x[1]**2
+                    values[2] = x[2]**2
+               def value_shape(self):
+                    return (3,)
+
+          f0 = F0()
+          v0 = V0()
+
+          x = (2.0, 1.0, 3.0)
+
+          # Test ufl evaluation through mapping (overriding the Expression with N here):
+          def N(x):
+               return x[0]**2 + x[1] + 3*x[2]
+
+          self.assertEqual(f0(x, { f0: N }), 14)
+
+          a = f0**2
+          b = a(x, { f0: N })
+          self.assertEqual(b, 196)
+
+          # Test ufl evaluation together with Expression evaluation by dolfin
+          # scalar
+          self.assertEqual(f0(x), f0(*x))
+          self.assertEqual((f0**2)(x), f0(*x)**2)
+          # vector
+          self.assertTrue(all(a == b for a,b in zip(v0(x), v0(*x))))
+          self.assertEqual(dot(v0,v0)(x), sum(v**2 for v in v0(*x)))
+          self.assertEqual(dot(v0,v0)(x), 98)
+
+     def test_overload_and_call_back(self):
+          class F0(Expression):
+               def eval(self, values, x):
+                    values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])
+
+          class F1(Expression):
+               def __init__(self, mesh, *arg, **kwargs):
+                    self.mesh = mesh
+               def eval_cell(self, values, x, cell):
+                    c = Cell(self.mesh, cell.index)
+                    values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])
+
+          e0 = F0(degree=2)
+          e1 = F1(mesh, degree=2)
+          e2 = Expression("sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])", degree=2)
+
+          s0 = norm(interpolate(e0, V))
+          s1 = norm(interpolate(e1, V))
+          s2 = norm(interpolate(e2, V))
+
+          ref = 0.36557637568519191
+          self.assertAlmostEqual(s0, ref)
+          self.assertAlmostEqual(s1, ref)
+          self.assertAlmostEqual(s2, ref)
+
+     def test_wrong_eval(self):
+          # Test wrong evaluation
+          class F0(Expression):
+               def eval(self, values, x):
+                    values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])
+
+          f0 = F0()
+          f1 = Expression("sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])", degree=2)
+
+          for f in [f0, f1]:
+               self.assertRaises(TypeError, f, "s")
+               self.assertRaises(TypeError, f, [])
+               self.assertRaises(TypeError, f, 0.5, 0.5, 0.5, values = zeros(3,'i'))
+               self.assertRaises(TypeError, f, [0.3, 0.2, []])
+               self.assertRaises(TypeError, f, 0.3, 0.2, {})
+               self.assertRaises(TypeError, f, zeros(3), values = zeros(4))
+               self.assertRaises(TypeError, f, zeros(4), values = zeros(3))
+
+     def test_no_write_to_const_array(self):
+          class F1(Expression):
+               def eval(self, values, x):
+                    x[0] = 1.0
+                    values[0] = sin(3.0*x[0])*sin(3.0*x[1])*sin(3.0*x[2])
+
+          mesh = UnitCubeMesh(3,3,3)
+          f1 = F1()
+          self.assertRaises(StandardError, lambda : assemble(f1*dx, mesh=mesh))
+
+class MeshEvaluation(unittest.TestCase):
+
+     def test_compute_vertex_values(self):
+          from numpy import zeros, all, array
+
+          e0 = Expression("1")
+          e1 = Expression(("1", "2", "3"))
+
+          e0_values = e0.compute_vertex_values(mesh)
+          e1_values = e1.compute_vertex_values(mesh)
+
+          self.assertTrue(all(e0_values==1))
+          self.assertTrue(all(e1_values[:mesh.num_vertices()]==1))
+          self.assertTrue(all(e1_values[mesh.num_vertices():mesh.num_vertices()*2]==2))
+          self.assertTrue(all(e1_values[mesh.num_vertices()*2:mesh.num_vertices()*3]==3))
+
+class Instantiation(unittest.TestCase):
+
+     def test_wrong_sub_classing(self):
+
+          def noAttributes():
+               class NoAttributes(Expression):pass
+
+          def wrongEvalAttribute():
+               class WrongEvalAttribute(Expression):
+                    def eval(values, x):
+                         pass
+
+          def wrongEvalDataAttribute():
+               class WrongEvalDataAttribute(Expression):
+                    def eval_cell(values, data):
+                         pass
+
+          def noEvalAttribute():
+               class NoEvalAttribute(Expression):
+                    def evaluate(self, values, data):
+                         pass
+
+          def wrongArgs():
+               class WrongArgs(Expression):
+                    def eval(self, values, x):
+                         pass
+               e = WrongArgs(V)
+
+          def deprecationWarning():
+               class Deprecated(Expression):
+                    def eval(self, values, x):
+                         pass
+                    def dim(self):
+                         return 2
+               e = Deprecated()
+
+          def noDefaultValues():
+               Expression("a")
+
+          def wrongDefaultType():
+               Expression("a", a="1")
+
+          def wrongParameterNames0():
+               Expression("long", str=1.0)
+
+          def wrongParameterNames1():
+               Expression("user_parameters", user_parameters=1.0)
+
+          self.assertRaises(TypeError, noAttributes)
+          self.assertRaises(TypeError, noEvalAttribute)
+          self.assertRaises(TypeError, wrongEvalAttribute)
+          self.assertRaises(TypeError, wrongEvalDataAttribute)
+          self.assertRaises(TypeError, wrongArgs)
+          self.assertRaises(DeprecationWarning, deprecationWarning)
+          self.assertRaises(RuntimeError, noDefaultValues)
+          self.assertRaises(TypeError, wrongDefaultType)
+          self.assertRaises(RuntimeError, wrongParameterNames0)
+          self.assertRaises(RuntimeError, wrongParameterNames1)
+
+     def test_element_instantiation(self):
+          class F0(Expression):
+               def eval(self, values, x):
+                    values[0] = 1.0
+          class F1(Expression):
+               def eval(self, values, x):
+                    values[0] = 1.0
+                    values[1] = 1.0
+               def value_shape(self):
+                    return (2,)
+
+          class F2(Expression):
+               def eval(self, values, x):
+                    values[0] = 1.0
+                    values[1] = 1.0
+                    values[2] = 1.0
+                    values[3] = 1.0
+               def value_shape(self):
+                    return (2,2)
+
+          e0 = Expression("1")
+          self.assertTrue(e0.ufl_element().cell() is None)
+
+          e1 = Expression("1", cell=triangle)
+          self.assertFalse(e1.ufl_element().cell() is None)
+
+          e2 = Expression("1", cell=triangle, degree=2)
+          self.assertEqual(e2.ufl_element().degree(), 2)
+
+          e3 = Expression(["1", "1"], cell=triangle)
+          self.assertTrue(isinstance(e3.ufl_element(), VectorElement))
+
+          e4 = Expression((("1", "1"), ("1", "1")), cell=triangle)
+          self.assertTrue(isinstance(e4.ufl_element(), TensorElement))
+
+          f0 = F0()
+          self.assertTrue(f0.ufl_element().cell() is None)
+
+          f1 = F0(cell=triangle)
+          self.assertFalse(f1.ufl_element().cell() is None)
+
+          f2 = F0(cell=triangle, degree=2)
+          self.assertEqual(f2.ufl_element().degree(), 2)
+
+          f3 = F1(cell=triangle)
+          self.assertTrue(isinstance(f3.ufl_element(), VectorElement))
+
+          f4 = F2(cell=triangle)
+          self.assertTrue(isinstance(f4.ufl_element(), TensorElement))
+
+     def test_exponent_init(self):
+          e0 = Expression("1e10")
+          self.assertEqual(e0(0,0,0), 1e10)
+
+          e1 = Expression("1e-10")
+          self.assertEqual(e1(0,0,0), 1e-10)
+
+          e2 = Expression("1e+10")
+          self.assertEqual(e2(0,0,0), 1e+10)
+
+     def test_name_space_usage(self):
+          e0 = Expression("std::sin(x[0])*cos(x[1])")
+          e1 = Expression("sin(x[0])*std::cos(x[1])")
+          self.assertAlmostEqual(assemble(e0*dx(mesh)), \
+                                 assemble(e1*dx(mesh)))
+
+     def test_generic_function_attributes(self):
+          tc = Constant(2.0)
+          te = Expression("value", value=tc)
+
+          self.assertAlmostEqual(tc(0), te(0))
+          tc.assign(1.0)
+          self.assertAlmostEqual(tc(0), te(0))
+
+          tf = Function(V)
+          tf.vector()[:] = 1.0
+
+          e0 = Expression(["2*t", "-t"], t=tc)
+          e1 = Expression(["2*t", "-t"], t=1.0)
+          e2 = Expression("t", t=te)
+          e3 = Expression("t", t=tf)
+
+          self.assertAlmostEqual(assemble(inner(e0,e0)*dx(mesh)), \
+                                 assemble(inner(e1,e1)*dx(mesh)))
+
+          self.assertAlmostEqual(assemble(inner(e2,e2)*dx(mesh)), \
+                                 assemble(inner(e3,e3)*dx(mesh)))
+
+          tc.assign(3.0)
+          e1.t = float(tc)
+
+          self.assertAlmostEqual(assemble(inner(e0,e0)*dx(mesh)), \
+                                 assemble(inner(e1,e1)*dx(mesh)))
+          tc.assign(5.0)
+
+          self.assertNotEqual(assemble(inner(e2,e2)*dx(mesh)), \
+                              assemble(inner(e3,e3)*dx(mesh)))
+
+          self.assertAlmostEqual(assemble(e0[0]*dx(mesh)), \
+                                 assemble(2*e2*dx(mesh)))
+
+          e2.t = e3.t
+
+          self.assertEqual(assemble(inner(e2,e2)*dx(mesh)), \
+                           assemble(inner(e3,e3)*dx(mesh)))
+
+          # Test wrong kwargs
+          self.assertRaises(TypeError, lambda : Expression("t", t=Constant((1,0))))
+          self.assertRaises(TypeError, lambda : Expression("t", t=Function(V*V)))
+
+          # Test non-scalar GenericFunction
+          f2 = Function(V*V)
+          e2.t = f2
+
+          self.assertRaises(RuntimeError, lambda : e2(0, 0))
+
+          # Test self assignment
+          e2.t = e2
+          self.assertRaises(RuntimeError, lambda : e2(0, 0))
+
+          # Test user_parameters assignment
+          self.assertTrue("value" in te.user_parameters)
+          te.user_parameters["value"] = Constant(5.0)
+          self.assertEqual(te(0.0), 5.0)
+
+          te.user_parameters.update(dict(value=Constant(3.0)))
+          self.assertEqual(te(0.0), 3.0)
+
+          te.user_parameters.update([("value", Constant(4.0))])
+          self.assertEqual(te(0.0), 4.0)
+
+          # Test wrong assignment
+          self.assertRaises(TypeError, lambda : te.user_parameters.__setitem__("value", 1.0))
+          self.assertRaises(KeyError, lambda : te.user_parameters.__setitem__("values", 1.0))
+
+     def test_doc_string_eval(self):
+          """
+          This test tests all features documented in the doc string of
+          Expression. If this test breaks and it is fixed the corresponding fixes
+          need also be updated in the docstring.
+          """
+
+          square = UnitSquareMesh(10,10)
+          V = VectorFunctionSpace(square, "CG", 1)
+
+          f0 = Expression('sin(x[0]) + cos(x[1])')
+          f1 = Expression(('cos(x[0])', 'sin(x[1])'), element = V.ufl_element())
+          self.assertAlmostEqual(f0(0,0), sum(f1(0,0)))
+
+          f2 = Expression((('exp(x[0])','sin(x[1])'),
+                           ('sin(x[0])','tan(x[1])')))
+          self.assertAlmostEqual(sum(f2(0,0)), 1.0)
+
+          f = Expression('A*sin(x[0]) + B*cos(x[1])', A=2.0, B=Constant(4.0))
+          self.assertAlmostEqual(f(pi/4, pi/4), 6./sqrt(2))
+
+          f.A = 5.0
+          f.B = Expression("value", value=6.0)
+          self.assertAlmostEqual(f(pi/4, pi/4), 11./sqrt(2))
+
+          f.user_parameters["A"] = 1.0
+          f.user_parameters["B"] = Constant(5.0)
+          self.assertAlmostEqual(f(pi/4, pi/4), 6./sqrt(2))
+
+     def test_doc_string_complex_compiled_expression(self):
+          """
+          This test tests all features documented in the doc string of
+          Expression. If this test breaks and it is fixed the corresponding fixes
+          need also be updated in the docstring.
+          """
+
+          code = '''
+          class MyFunc : public Expression
+          {
+          public:
+
+            std::shared_ptr<MeshFunction<std::size_t> > cell_data;
+
+            MyFunc() : Expression()
+            {
+            }
+
+          void eval(Array<double>& values, const Array<double>& x,
+                    const ufc::cell& c) const
+            {
+              assert(cell_data);
+              const Cell cell(*cell_data->mesh(), c.index);
+              switch ((*cell_data)[cell.index()])
+              {
+              case 0:
+                values[0] = exp(-x[0]);
+                break;
+              case 1:
+                values[0] = exp(-x[2]);
+                break;
+              default:
+                values[0] = 0.0;
+              }
+            }
+          };'''
+
+          cell_data = CellFunction('uint', mesh)
+          f = Expression(code)
+          f.cell_data = cell_data
+
+          CompiledSubDomain("x[0]<=0.25").mark(cell_data, 0)
+          CompiledSubDomain("x[0]>0.25 && x[0]<0.75").mark(cell_data, 1)
+          CompiledSubDomain("x[0]>=0.75").mark(cell_data, 2)
+
+          bb = mesh.bounding_box_tree()
+          p0 = Point(0.1, 1.0, 0)
+          c0 = bb.compute_first_entity_collision(p0)
+
+          # If run in paralell
+          if c0 > mesh.num_cells():
+              return
+
+          p1 = Point(0.5, 1.0, 0)
+          c1 = bb.compute_first_entity_collision(p1)
+
+          # If run in paralell
+          if c1 > mesh.num_cells():
+              return
+
+          p2 = Point(1.0, 1.0, 1.0)
+          c2 = bb.compute_first_entity_collision(p2)
+
+          # If run in paralell
+          if c2 > mesh.num_cells():
+              return
+
+          # Create cells for evaluation
+          c0 = Cell(mesh, c0)
+          c1 = Cell(mesh, c1)
+          c2 = Cell(mesh, c2)
+
+          coords = array([p0.x(), p0.y(), p0.z()], dtype=float_)
+          values = zeros(1, dtype=float_)
+
+          f.eval_cell(values, coords, c0)
+          self.assertEqual(values[0], exp(-p0.x()))
+
+          coords = array([p1.x(), p1.y(), p1.z()], dtype=float_)
+
+          f.eval_cell(values, coords, c1)
+          self.assertEqual(values[0], exp(-p1.z()))
+
+          f.eval_cell(values, coords, c2)
+          self.assertEqual(values[0], 0.0)
+
+     @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+     def test_doc_string_compiled_expression_with_system_headers(self):
+          """
+          This test tests all features documented in the doc string of
+          Expression. If this test breaks and it is fixed the corresponding fixes
+          need also be updated in the docstring.
+          """
+
+          # Add header and it should compile
+          code_compile = '''
+          #include "dolfin/fem/GenericDofMap.h"
+          namespace dolfin
+          {
+            class Delta : public Expression
+            {
+            public:
+
+              Delta() : Expression() {}
+
+              void eval(Array<double>& values, const Array<double>& data,
+                        const ufc::cell& cell) const
+              { }
+
+              void update(const std::shared_ptr<const Function> u,
+                          double nu, double dt, double C1,
+                          double U_infty, double chord)
+              {
+                const std::shared_ptr<const Mesh> mesh = u->function_space()->mesh();
+                const std::shared_ptr<const GenericDofMap> dofmap = u->function_space()->dofmap();
+                const uint ncells = mesh->num_cells();
+                uint ndofs_per_cell;
+                if (ncells > 0)
+                {
+                  CellIterator cell(*mesh);
+                  ndofs_per_cell = dofmap->cell_dimension(cell->index());
+                }
+                else
+                {
+                   return;
+                }
+              }
+            };
+          }'''
+
+          e = Expression(code_compile)
+          self.assertTrue(hasattr(e, "update"))
+
+          # Test not compile
+          code_not_compile = '''
+          namespace dolfin
+          {
+            class Delta : public Expression
+            {
+            public:
+
+              Delta() : Expression() {}
+
+              void eval(Array<double>& values, const Array<double>& data,
+                        const ufc::cell& cell) const
+              { }
+
+              void update(const std::shared_ptr<const Function> u,
+                          double nu, double dt, double C1,
+                          double U_infty, double chord)
+              {
+                const std::shared_ptr<const Mesh> mesh = u->function_space()->mesh();
+                const std::shared_ptr<const GenericDofMap> dofmap = u->function_space()->dofmap();
+                const uint ncells = mesh->num_cells();
+                uint ndofs_per_cell;
+                if (ncells > 0)
+                {
+                  CellIterator cell(*mesh);
+                  ndofs_per_cell = dofmap->cell_dimension(cell->index());
+                }
+                else
+                {
+                   return;
+                }
+              }
+            };
+          }'''
+
+          self.assertRaises(RuntimeError, Expression, code_not_compile)
+
+     def test_doc_string_python_expressions(self):
+          """
+          This test tests all features documented in the doc string of
+          Expression. If this test breaks and it is fixed the corresponding fixes
+          need also be updated in the docstring.
+          """
+
+          square = UnitSquareMesh(4,4)
+
+          class MyExpression0(Expression):
+              def eval(self, value, x):
+                  dx = x[0] - 0.5
+                  dy = x[1] - 0.5
+                  value[0] = 500.0*exp(-(dx*dx + dy*dy)/0.02)
+                  value[1] = 250.0*exp(-(dx*dx + dy*dy)/0.01)
+              def value_shape(self):
+                  return (2,)
+
+          f0 = MyExpression0()
+          values = f0(0.2,0.3)
+          dx = 0.2-0.5
+          dy = 0.3-0.5
+
+          self.assertAlmostEqual(values[0], 500.0*exp(-(dx*dx + dy*dy)/0.02))
+          self.assertAlmostEqual(values[1], 250.0*exp(-(dx*dx + dy*dy)/0.01))
+
+          ufc_cell_attrs = ["cell_shape", "index", "topological_dimension",
+                            "geometric_dimension", "local_facet", "mesh_identifier"]
+
+          class MyExpression1(Expression):
+              def eval_cell(self_expr, value, x, ufc_cell):
+                  if ufc_cell.index > 10:
+                      value[0] = 1.0
+                  else:
+                      value[0] = -1.0
+
+               # Check attributes in ufc cell
+                  for attr in ufc_cell_attrs:
+                       self.assertTrue(hasattr(ufc_cell, attr))
+
+          f1 = MyExpression1()
+          assemble(f1*ds(square))
+
+          class MyExpression2(Expression):
+              def __init__(self, mesh, domain):
+                  self._mesh = mesh
+                  self._domain = domain
+              def eval(self, values, x):
+                  pass
+
+          cell_data = CellFunction('uint', square)
+
+          f3 = MyExpression2(square, cell_data)
+
+          self.assertEqual(id(f3._mesh), id(square))
+          self.assertEqual(id(f3._domain), id(cell_data))
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/function/python/Function.py b/test/unit/function/python/Function.py
new file mode 100644
index 0000000..da64fac
--- /dev/null
+++ b/test/unit/function/python/Function.py
@@ -0,0 +1,401 @@
+"""Unit tests for the Function class"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-03-23
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+import ufl
+
+mesh = UnitCubeMesh(8, 8, 8)
+R = FunctionSpace(mesh, 'R', 0)
+V = FunctionSpace(mesh, 'CG', 1)
+W = VectorFunctionSpace(mesh, 'CG', 1)
+
+class Interface(unittest.TestCase):
+    def test_name_argument(self):
+        u = Function(W)
+        v = Function(W, name="v")
+        self.assertEqual(u.name(), "f_%d" % u.count())
+        self.assertEqual(v.name(), "v")
+        self.assertEqual(str(v), "v")
+
+    def test_in_function_space(self):
+        u = Function(W)
+        v = Function(W)
+        self.assertTrue(u in W)
+        self.assertTrue(u in u.function_space())
+        self.assertTrue(u in v.function_space())
+        for i, usub in enumerate(u.split()):
+            self.assertTrue(usub in W.sub(i))
+
+    def test_compute_vertex_values(self):
+        from numpy import zeros, all, array
+        u = Function(V)
+        v = Function(W)
+
+        u.vector()[:] = 1.
+        v.vector()[:] = 1.
+
+        u_values = u.compute_vertex_values(mesh)
+        v_values = v.compute_vertex_values(mesh)
+
+        self.assertTrue(all(u_values==1))
+
+    def test_assign(self):
+        from ufl.algorithms import replace
+
+        for V0, V1, vector_space in [(V, W, False), (W, V, True)]:
+            u = Function(V0)
+            u0 = Function(V0)
+            u1 = Function(V0)
+            u2 = Function(V0)
+            u3 = Function(V1)
+
+            u.vector()[:] =  1.0
+            u0.vector()[:] = 2.0
+            u1.vector()[:] = 3.0
+            u2.vector()[:] = 4.0
+            u3.vector()[:] = 5.0
+
+            scalars = {u:1.0, u0:2.0, u1:3.0, u2:4.0, u3:5.0}
+
+            uu = Function(V0)
+            uu.assign(2*u)
+            self.assertEqual(uu.vector().sum(), u0.vector().sum())
+
+            uu = Function(V1)
+            uu.assign(3*u)
+            self.assertEqual(uu.vector().sum(), u1.vector().sum())
+
+            # Test complex assignment
+            expr = 3*u-4*u1-0.1*4*u*4+u2+3*u0/3./0.5
+            expr_scalar = 3-4*3-0.1*4*4+4.+3*2./3./0.5
+            uu.assign(expr)
+            self.assertAlmostEqual(uu.vector().sum(), \
+                                   float(expr_scalar*uu.vector().size()))
+
+            # Test expression scaling
+            expr = 3*expr
+            expr_scalar *= 3
+            uu.assign(expr)
+            self.assertAlmostEqual(uu.vector().sum(), \
+                                   float(expr_scalar*uu.vector().size()))
+
+            # Test expression scaling
+            expr = expr/4.5
+            expr_scalar /= 4.5
+            uu.assign(expr)
+            self.assertAlmostEqual(uu.vector().sum(), \
+                                   float(expr_scalar*uu.vector().size()))
+
+            # Test self assignment
+            expr = 3*u - Constant(5)*u2 + u1 - 5*u
+            expr_scalar = 3 - 5*4. + 3. - 5
+            u.assign(expr)
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar*u.vector().size()))
+
+            # Test zero assignment
+            u.assign(-u2/2+2*u1-u1/0.5+u2*0.5)
+            self.assertAlmostEqual(u.vector().sum(), 0.0)
+
+            # Test errounious assignments
+            uu = Function(V1)
+            f = Expression("1.0")
+            self.assertRaises(RuntimeError, lambda: uu.assign(1.0))
+            self.assertRaises(RuntimeError, lambda: uu.assign(4*f))
+
+            if not vector_space:
+                self.assertRaises(RuntimeError, lambda: uu.assign(u*u0))
+                self.assertRaises(RuntimeError, lambda: uu.assign(4/u0))
+                self.assertRaises(RuntimeError, lambda: uu.assign(4*u*u1))
+
+    def test_axpy(self):
+
+        for V0, V1, vector_space in [(V, W, False), (W, V, True)]:
+            u = Function(V0)
+            u0 = Function(V0)
+            u1 = Function(V0)
+            u2 = Function(V0)
+            u3 = Function(V1)
+
+            u.vector()[:] =  1.0
+            u0.vector()[:] = 2.0
+            u1.vector()[:] = 3.0
+            u2.vector()[:] = 4.0
+            u3.vector()[:] = 5.0
+
+            axpy = FunctionAXPY(u1, 2.0)
+            u.assign(axpy)
+            expr_scalar = 3*2
+
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar*u.vector().size()))
+
+            axpy = FunctionAXPY([(2.0, u1), (3.0, u2)])
+
+            u.assign(axpy)
+            expr_scalar = 3*2+3*4.0
+
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar*u.vector().size()))
+
+            axpy = axpy*3
+            u.assign(axpy)
+            expr_scalar *= 3
+
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar*u.vector().size()))
+
+            axpy0 = axpy/5
+            u.assign(axpy0)
+            expr_scalar0 = expr_scalar/5
+
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar0*u.vector().size()))
+
+            axpy1 = axpy0+axpy
+            u.assign(axpy1)
+            expr_scalar1 = expr_scalar0 + expr_scalar
+
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar1*u.vector().size()))
+
+            axpy1 = axpy0-axpy
+            u.assign(axpy1)
+            expr_scalar1 = expr_scalar0 - expr_scalar
+
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar1*u.vector().size()))
+
+            axpy1 = axpy0+u1
+            u.assign(axpy1)
+            expr_scalar1 = expr_scalar0 + 3.0
+
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar1*u.vector().size()))
+
+            axpy1 = axpy0-u2
+            u.assign(axpy1)
+            expr_scalar1 = expr_scalar0 - 4.0
+
+            self.assertAlmostEqual(u.vector().sum(), \
+                                   float(expr_scalar1*u.vector().size()))
+
+            self.assertRaises(RuntimeError, FunctionAXPY, u, u3, 0)
+
+            axpy = FunctionAXPY(u3, 2.0)
+
+            self.assertRaises(RuntimeError, lambda : axpy+u)
+
+    def test_call(self):
+        from numpy import zeros, all, array
+        u0 = Function(R)
+        u1 = Function(V)
+        u2 = Function(W)
+        e0=Expression("x[0]+x[1]+x[2]")
+        e1=Expression(("x[0]+x[1]+x[2]", "x[0]-x[1]-x[2]", "x[0]+x[1]+x[2]"))
+
+        u0.vector()[:] = 1.0
+        u1.interpolate(e0)
+        u2.interpolate(e1)
+
+        p0 = (Vertex(mesh,0).point()+Vertex(mesh,1).point())/2
+        x0 = (mesh.coordinates()[0]+mesh.coordinates()[1])/2
+        x1 = tuple(x0)
+
+        self.assertAlmostEqual(u0(*x1), u0(x0))
+        self.assertAlmostEqual(u0(x1), u0(p0))
+        self.assertAlmostEqual(u1(x1), u1(x0))
+        self.assertAlmostEqual(u1(*x1), u1(p0))
+        self.assertAlmostEqual(u2(x1)[0], u1(p0))
+
+        self.assertTrue(all(u2(*x1) == u2(x0)))
+        self.assertTrue(all(u2(*x1) == u2(p0)))
+
+        values = zeros(mesh.geometry().dim(), dtype='d')
+        u2(p0, values=values)
+        self.assertTrue(all(values == u2(x0)))
+
+        self.assertRaises(TypeError, u0, [0,0,0,0])
+        self.assertRaises(TypeError, u0, [0,0])
+
+class ScalarFunctions(unittest.TestCase):
+    def test_constant_float_conversion(self):
+        c = Constant(3.45)
+        self.assertTrue(float(c) == 3.45)
+
+    def test_real_function_float_conversion1(self):
+        c = Function(R)
+        self.assertTrue(float(c) == 0.0)
+
+    def test_real_function_float_conversion2(self):
+        c = Function(R)
+        c.assign(Constant(2.34))
+        self.assertTrue(float(c) == 2.34)
+
+    def test_real_function_float_conversion3(self):
+        c = Function(R)
+        c.vector()[:] = 1.23
+        self.assertTrue(float(c) == 1.23)
+
+    def test_scalar_conditions(self):
+        c = Function(R)
+        c.vector()[:] = 1.5
+
+        # Float conversion does not interfere with boolean ufl expressions
+        self.assertTrue(isinstance(lt(c, 3), ufl.classes.LT))
+        self.assertFalse(isinstance(lt(c, 3), bool))
+
+        # Float conversion is not implicit in boolean Python expressions
+        self.assertTrue(isinstance(c < 3, ufl.classes.LT))
+        self.assertFalse(isinstance(c < 3, bool))
+
+        # == is used in ufl to compare equivalent representations,
+        # <,> result in LT/GT expressions, bool conversion is illegal
+        # Note that 1.5 < 0 == False == 1.5 < 1, but that is not what we compare here:
+        self.assertFalse((c < 0) == (c < 1))
+        # This protects from "if c < 0: ..." misuse:
+        self.assertRaises(ufl.UFLException, lambda: bool(c < 0))
+        self.assertRaises(ufl.UFLException, lambda: not c < 0)
+
+
+class Interpolate(unittest.TestCase):
+
+    def test_interpolation_mismatch_rank0(self):
+        f = Expression("1.0")
+        self.assertRaises(RuntimeError, interpolate, f, W)
+
+    def test_interpolation_mismatch_rank1(self):
+        f = Expression(("1.0", "1.0"))
+        self.assertRaises(RuntimeError, interpolate, f, W)
+
+    def test_interpolation_jit_rank0(self):
+        f = Expression("1.0")
+        w = interpolate(f, V)
+        x = w.vector()
+        self.assertEqual(x.max(), 1)
+        self.assertEqual(x.min(), 1)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_extrapolation(self):
+        f0 = Function(V)
+        self.assertRaises(RuntimeError, f0.__call__, (0., 0, -1))
+
+        mesh1 = UnitSquareMesh(3, 3)
+        V1 = FunctionSpace(mesh1, "CG", 1)
+
+        parameters["allow_extrapolation"] = True
+        f1 = Function(V1)
+        f1.vector()[:] = 1.0
+        self.assertAlmostEqual(f1(0.,-1), 1.0)
+
+        mesh2 = UnitTriangleMesh()
+        V2 = FunctionSpace(mesh2, "CG", 1)
+
+        parameters["allow_extrapolation"] = False
+        f2 = Function(V2)
+        self.assertRaises(RuntimeError, f2.__call__, (0.,-1.))
+
+        parameters["allow_extrapolation"] = True
+        f3 = Function(V2)
+        f3.vector()[:] = 1.0
+
+        self.assertAlmostEqual(f3(0.,-1), 1.0)
+
+    def test_interpolation_jit_rank1(self):
+        f = Expression(("1.0", "1.0", "1.0"))
+        w = interpolate(f, W)
+        x = w.vector()
+        self.assertEqual(x.max(), 1)
+        self.assertEqual(x.min(), 1)
+
+    def test_restricted_function_equals_its_interpolation_and_projection_in_dg(self):
+        class Side0(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] <= 0.55
+
+        class Side1(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] >= 0.45
+
+        mesh = UnitSquareMesh(10,10)
+        dim = 2
+
+        sd0 = MeshFunctionSizet(mesh, dim)
+        sd1 = MeshFunctionSizet(mesh, dim)
+
+        Side0().mark(sd0, 1)
+        Side1().mark(sd1, 2)
+
+        r0 = Restriction(sd0, 1)
+        r1 = Restriction(sd1, 2)
+
+        Vt = FunctionSpace(mesh, "DG", 1)
+        V0 = FunctionSpace(r0, "CG", 1)
+        V1 = FunctionSpace(r1, "CG", 1)
+
+        ft = Function(Vt)
+        f0 = Function(V0)
+        f1 = Function(V1)
+
+        f0.interpolate(Expression("x[0]*x[0]"))
+        f1.interpolate(Expression("x[1]*x[1]"))
+        ft.interpolate(f0)
+        gt = project(f1+f0, Vt)
+
+        f0v = assemble(f0*dx(1, subdomain_data=sd0))
+        f1v = assemble(f1*dx(2, subdomain_data=sd1))
+        ftv = assemble(ft*dx(1, subdomain_data=sd0))
+        gtv = assemble(gt*dx)
+
+        self.assertAlmostEqual(f0v, ftv)
+        self.assertAlmostEqual(f0v+f1v, gtv)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_interpolation_old(self):
+
+        class F0(Expression):
+            def eval(self, values, x):
+                values[0] = 1.0
+
+        class F1(Expression):
+            def eval(self, values, x):
+                values[0] = 1.0
+                values[1] = 1.0
+            def value_shape(self):
+                return (2,)
+
+        # Scalar interpolation
+        f0 = F0()
+        f = Function(V)
+        f.interpolate(f0)
+        self.assertAlmostEqual(f.vector().norm("l1"), mesh.num_vertices())
+
+        # Vector interpolation
+        f1 = F1()
+        W = V * V
+        f = Function(W)
+        f.interpolate(f1)
+        self.assertAlmostEqual(f.vector().norm("l1"), 2*mesh.num_vertices())
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/function/python/FunctionAssigner.py b/test/unit/function/python/FunctionAssigner.py
new file mode 100644
index 0000000..433fdc3
--- /dev/null
+++ b/test/unit/function/python/FunctionAssigner.py
@@ -0,0 +1,168 @@
+"""Unit tests for the FunctionAssigner class"""
+
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-11-07
+# Last changed: 2013-11-07
+
+import unittest
+from dolfin import *
+import numpy as np
+
+mesh = UnitCubeMesh(8, 8, 8)
+V = FunctionSpace(mesh, "CG", 1)
+Q = FunctionSpace(mesh, "CG", 2)
+W = VectorFunctionSpace(mesh, "CG", 1)
+QQ = VectorFunctionSpace(mesh, "CG", 2)
+R = FunctionSpace(mesh, "R", 0)
+RR = VectorFunctionSpace(mesh, "R", 0)
+QQV = QQ*V
+WW = W*W
+WR = W*R
+WRR = W*RR
+
+class Creation(unittest.TestCase):
+    def setUp(self):
+
+        self.u0 = Function(V)
+        self.u0.vector()[:] = 1.
+        self.u1 = Function(V)
+        self.u1.vector()[:] = 2.
+        self.u2 = Function(V)
+        self.u2.vector()[:] = 3.
+
+        self.r = Function(R)
+        self.r.vector()[:] = 3.
+
+        self.rr = Function(RR)
+        self.rr.vector()[:] = 2.
+
+        self.w = Function(W)
+        self.w.vector()[:] = 4.
+
+        self.ww = Function(WW)
+        self.ww.vector()[:] = 5.
+
+        self.wr = Function(WR)
+        self.wr.vector()[:] = 6.
+
+        self.wrr = Function(WRR)
+        self.wrr.vector()[:] = 7.
+
+        self.q = Function(Q)
+        self.q.vector()[:] = 1.
+
+        self.qq = Function(QQ)
+        self.qq.vector()[:] = 2.
+
+        self.qqv = Function(QQV)
+        self.qqv.vector()[:] = 3.
+
+    def test_1_1_assigner(self):
+
+        assigner = FunctionAssigner(W.sub(0), V)
+        assigner.assign(self.w.sub(0), self.u0)
+        
+        self.assertTrue(np.all(self.w.sub(0, deepcopy=True).vector().array() == \
+                               self.u0.vector().array()))
+        
+        assign(self.w.sub(2), self.u2)
+        self.assertTrue(np.all(self.w.sub(2, deepcopy=True).vector().array() == \
+                               self.u2.vector().array()))
+
+        assigner = FunctionAssigner(V, W.sub(2))
+        assigner.assign(self.u0, self.w.sub(2))
+
+        self.assertTrue(np.all(self.u0.vector().array() == \
+                               self.w.sub(2, deepcopy=True).vector().array()))
+
+        assign(self.u1, self.w.sub(1))
+        self.assertTrue(np.all(self.u1.vector().array() == \
+                               self.w.sub(1, deepcopy=True).vector().array()))
+
+        assigner = FunctionAssigner(WW.sub(0), W)
+        assigner.assign(self.ww.sub(0), self.w)
+
+        assign(self.wr.sub(0), self.w)
+        self.assertTrue(np.all(self.wr.sub(0, deepcopy=True).vector().array() == \
+                               self.w.vector().array()))
+
+        assign(self.wr.sub(1), self.r)
+        self.assertTrue(np.all(self.wr.sub(1, deepcopy=True).vector().array() == \
+                               self.r.vector().array()))
+
+        assign(self.qqv.sub(0).sub(0), self.q)
+        self.assertTrue(np.all(self.qqv.sub(0).sub(0, deepcopy=True).vector().array() == \
+                               self.q.vector().array()))
+
+        self.assertRaises(RuntimeError, lambda : assign(self.qqv.sub(0), self.q))
+        self.assertRaises(RuntimeError, lambda : assign(self.qqv.sub(1), self.q))
+        self.assertRaises(RuntimeError, lambda : assign(self.wrr.sub(1), self.w))
+
+    def test_N_1_assigner(self):
+
+        vv = Function(W)
+        assigner = FunctionAssigner(W, [V,V,V])
+        assigner.assign(vv, [self.u0, self.u1, self.u2])
+        
+        self.assertTrue(np.all(vv.sub(0, deepcopy=True).vector().array() == \
+                               self.u0.vector().array()))
+        self.assertTrue(np.all(vv.sub(1, deepcopy=True).vector().array() == \
+                               self.u1.vector().array()))
+        self.assertTrue(np.all(vv.sub(2, deepcopy=True).vector().array() == \
+                               self.u2.vector().array()))
+
+        assign(self.qqv, [self.qq, self.u1])
+        self.assertTrue(np.all(self.qqv.sub(0, deepcopy=True).vector().array() == \
+                              self.qq.vector().array()))
+        self.assertTrue(np.all(self.qqv.sub(1, deepcopy=True).vector().array() == \
+                               self.u1.vector().array()))
+
+        assign(self.wrr, [self.w, self.rr])
+        self.assertTrue(np.all(self.wrr.sub(0, deepcopy=True).vector().array() ==
+                               self.w.vector().array()))
+        self.assertTrue(np.all(self.wrr.sub(1, deepcopy=True).vector().array() ==
+                               self.rr.vector().array()))
+
+        self.assertRaises(RuntimeError, lambda : assign(self.qqv, \
+                                                        [self.qq, self.u1, self.u1]))
+
+        self.assertRaises(RuntimeError, lambda : assign(self.wrr, \
+                                                        [self.w, self.r, self.r]))
+
+    def test_1_N_assigner(self):
+
+        assigner = FunctionAssigner([V,V,V], W)
+        assigner.assign([self.u0, self.u1, self.u2], self.w)
+
+        self.assertTrue(np.all(self.w.sub(0, deepcopy=True).vector().array() == \
+                               self.u0.vector().array()))
+        self.assertTrue(np.all(self.w.sub(1, deepcopy=True).vector().array() == \
+                               self.u1.vector().array()))
+        self.assertTrue(np.all(self.w.sub(2, deepcopy=True).vector().array() == \
+                               self.u2.vector().array()))
+
+        assign([self.qq, self.u1], self.qqv)
+
+        self.assertTrue(np.all(self.qqv.sub(0, deepcopy=True).vector().array() == \
+                              self.qq.vector().array()))
+        self.assertTrue(np.all(self.qqv.sub(1, deepcopy=True).vector().array() == \
+                               self.u1.vector().array()))
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/function/python/FunctionSpace.py b/test/unit/function/python/FunctionSpace.py
new file mode 100644
index 0000000..93500fb
--- /dev/null
+++ b/test/unit/function/python/FunctionSpace.py
@@ -0,0 +1,158 @@
+"""Unit tests for the FunctionSpace class"""
+
+# Copyright (C) 2011 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Oeyvind Evju 2013
+#
+# First added:  2011-09-21
+# Last changed: 2013-10-11
+
+import unittest
+from dolfin import *
+
+mesh = UnitCubeMesh(8, 8, 8)
+V = FunctionSpace(mesh, 'CG', 1)
+W = VectorFunctionSpace(mesh, 'CG', 1)
+Q = W*V
+f = Function(V)
+V2 = f.function_space()
+g = Function(W)
+W2 = g.function_space()
+
+class Interface(unittest.TestCase):
+
+    def test_python_interface(self):
+        # Test Python interface of cpp generated FunctionSpace
+        self.assertTrue(isinstance(V, FunctionSpaceBase))
+        self.assertTrue(isinstance(W, FunctionSpaceBase))
+        self.assertTrue(isinstance(V2, FunctionSpaceBase))
+        self.assertTrue(isinstance(W2, FunctionSpaceBase))
+
+        self.assertEqual(V.cell(), V2.cell())
+        self.assertEqual(W.cell(), W2.cell())
+        self.assertEqual(V.dolfin_element().signature(), V2.dolfin_element().signature())
+        self.assertEqual(W.dolfin_element().signature(), W2.dolfin_element().signature())
+        self.assertEqual(V.ufl_element(), V2.ufl_element())
+        self.assertEqual(W.ufl_element(), W2.ufl_element())
+        self.assertEqual(W.id(), W2.id())
+        self.assertEqual(V.id(), V2.id())
+
+        Q2 = W2*V2
+        self.assertEqual(Q2.dim(), Q.dim())
+
+    def test_component(self):
+        self.assertFalse(W.component())
+        self.assertFalse(V.component())
+        self.assertEqual(W.sub(0).component()[0], 0)
+        self.assertEqual(W.sub(1).component()[0], 1)
+        self.assertEqual(Q.sub(0).component()[0], 0)
+        self.assertEqual(Q.sub(1).component()[0], 1)
+
+    def test_equality(self):
+        self.assertEqual(V, V)
+        self.assertEqual(V, V2)
+        self.assertEqual(W, W)
+        self.assertEqual(W, W2)
+        
+    def test_boundary(self):
+        bmesh = BoundaryMesh(mesh, "exterior")
+        Vb = FunctionSpace(bmesh, "DG", 0)
+        Wb = VectorFunctionSpace(bmesh, "CG", 1)
+        self.assertEqual(Vb.dim(), 768)
+        self.assertEqual(Wb.dim(), 1158)       
+
+    def test_not_equal(self):
+        self.assertNotEqual(W, V)
+        self.assertNotEqual(W2, V2)
+
+    def test_sub_equality(self):
+        self.assertEqual(W.sub(0), W.sub(0))
+        self.assertNotEqual(W.sub(0), W.sub(1))
+        self.assertEqual(W.sub(0), W.extract_sub_space([0]))
+        self.assertEqual(W.sub(1), W.extract_sub_space([1]))
+        self.assertEqual(Q.sub(0), Q.extract_sub_space([0]))
+
+    def test_in_operator(self):
+        self.assertTrue(f in V)
+        self.assertTrue(f in V2)
+        self.assertTrue(g in W)
+        self.assertTrue(g in W2)
+
+    def test_collapse(self):
+        Vs = W.sub(2)
+        self.assertRaises(RuntimeError, Function, Vs)
+        self.assertNotEqual(Vs.dofmap().cell_dofs(0)[0], \
+                            V.dofmap().cell_dofs(0)[0],)
+
+        # Collapse the space it should now be the same as V
+        Vc, dofmap_new_old = Vs.collapse(True)
+        self.assertEqual(Vc.dofmap().cell_dofs(0)[0], \
+                         V.dofmap().cell_dofs(0)[0],)
+        f0 = Function(V)
+        f1 = Function(Vc)
+        self.assertEqual(len(f0.vector()), len(f1.vector()))
+
+    def test_argument_equality(self):
+        "Placed this test here because it's mainly about detecting differing function spaces."
+        mesh2 = UnitCubeMesh(8, 8, 8)
+        V3 = FunctionSpace(mesh2, 'CG', 1)
+        W3 = VectorFunctionSpace(mesh2, 'CG', 1)
+
+        for TF in (TestFunction, TrialFunction):
+            v = TF(V)
+            v2 = TF(V2)
+            v3 = TF(V3)
+            self.assertEqual(v, v2)
+            self.assertEqual(v2, v)
+            self.assertNotEqual(V, V3)
+            self.assertNotEqual(V2, V3)
+            self.assertTrue(not(v == v3))
+            self.assertTrue(not(v2 == v3))
+            self.assertTrue(v != v3)
+            self.assertTrue(v2 != v3)
+            self.assertNotEqual(v, v3)
+            self.assertNotEqual(v2, v3)
+
+            w = TF(W)
+            w2 = TF(W2)
+            w3 = TF(W3)
+            self.assertEqual(w, w2)
+            self.assertEqual(w2, w)
+            self.assertNotEqual(w, w3)
+            self.assertNotEqual(w2, w3)
+
+            self.assertNotEqual(v, w)
+            self.assertNotEqual(w, v)
+
+            s1 = set((v, w))
+            s2 = set((v2, w2))
+            s3 = set((v, v2, w, w2))
+            self.assertEqual(len(s1), 2)
+            self.assertEqual(len(s2), 2)
+            self.assertEqual(len(s3), 2)
+            self.assertEqual(s1, s2)
+            self.assertEqual(s1, s3)
+            self.assertEqual(s2, s3)
+
+            # Test that the dolfin implementation of Argument.__eq__
+            # is triggered when comparing ufl expressions
+            self.assertTrue(grad(v) == grad(v2))
+            self.assertTrue(grad(v) != grad(v3))
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/function/python/LagrangeInterpolator.py b/test/unit/function/python/LagrangeInterpolator.py
new file mode 100644
index 0000000..52f434a
--- /dev/null
+++ b/test/unit/function/python/LagrangeInterpolator.py
@@ -0,0 +1,90 @@
+"""Unit tests for interpolation using LagrangeInterpolator"""
+
+# Copyright (C) 2014 Mikael Mortensen
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2014-02-18
+# Last changed:
+
+import unittest
+import numpy
+from dolfin import *
+
+class Quadratic2D(Expression):
+    def eval(self, values, x):
+        values[0] = x[0]*x[0] + x[1]*x[1] + 1.0
+
+class Quadratic3D(Expression):
+    def eval(self, values, x):
+        values[0] = x[0]*x[0] + x[1]*x[1] + x[2]*x[2] + 1.0
+
+class LagrangeInterpolatorTest(unittest.TestCase):
+
+    def test_functional2D(self):
+        """Test integration of function interpolated in non-matching meshes"""
+
+        f = Quadratic2D()
+        
+        ll = LagrangeInterpolator()
+
+        # Interpolate quadratic function on course mesh
+        mesh0 = UnitSquareMesh(8, 8)
+        V0 = FunctionSpace(mesh0, "Lagrange", 2)
+        u0 = Function(V0)
+        ll.interpolate(u0, f)
+
+        # Interpolate FE function on finer mesh
+        mesh1 = UnitSquareMesh(31, 31)
+        V1 = FunctionSpace(mesh1, "Lagrange", 2)
+        u1 = Function(V1)
+        ll.interpolate(u1, u0)
+        self.assertAlmostEqual(assemble(u0*dx), assemble(u1*dx), 10)
+
+        mesh1 = UnitSquareMesh(30, 30)
+        V1 = FunctionSpace(mesh1, "Lagrange", 2)
+        u1 = Function(V1)
+        ll.interpolate(u1, u0)
+        self.assertAlmostEqual(assemble(u0*dx), assemble(u1*dx), 10)
+
+    def test_functional3D(self):
+        """Test integration of function interpolated in non-matching meshes"""
+
+        f = Quadratic3D()
+
+        ll = LagrangeInterpolator()
+
+        # Interpolate quadratic function on course mesh
+        mesh0 = UnitCubeMesh(4, 4, 4)
+        V0 = FunctionSpace(mesh0, "Lagrange", 2)
+        u0 = Function(V0)
+        ll.interpolate(u0, f)
+
+        # Interpolate FE function on finer mesh
+        mesh1 = UnitCubeMesh(11, 11, 11)
+        V1 = FunctionSpace(mesh1, "Lagrange", 2)
+        u1 = Function(V1)
+        ll.interpolate(u1, u0)
+        self.assertAlmostEqual(assemble(u0*dx), assemble(u1*dx), 10)
+
+        mesh1 = UnitCubeMesh(10, 11, 10)
+        V1 = FunctionSpace(mesh1, "Lagrange", 2)
+        u1 = Function(V1)
+        ll.interpolate(u1, u0)
+        self.assertAlmostEqual(assemble(u0*dx), assemble(u1*dx), 10)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/function/python/SpecialFunctions.py b/test/unit/function/python/SpecialFunctions.py
new file mode 100644
index 0000000..f6e2621
--- /dev/null
+++ b/test/unit/function/python/SpecialFunctions.py
@@ -0,0 +1,46 @@
+"""Unit tests for the function library"""
+
+# Copyright (C) 2011 Kristian B. Oelgaard
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-11-28
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+import ufl
+import dolfin
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class SpecialFunctions(unittest.TestCase):
+
+    def testFacetArea(self):
+
+        references = [(UnitIntervalMesh(1), 2, 2),\
+                      (UnitSquareMesh(1,1), 4, 4),\
+                      (UnitCubeMesh(1,1,1), 6, 3)]
+        for mesh, surface, ref_int in references:
+            c = Constant(1, mesh.ufl_cell()) # FIXME
+            c0 = ufl.FacetArea(mesh)
+            c1 = dolfin.FacetArea(mesh)
+            self.assertAlmostEqual(assemble(c*dx(mesh)), 1)
+            self.assertAlmostEqual(assemble(c*ds(mesh)), surface)
+            self.assertAlmostEqual(assemble(c0*ds(mesh)), ref_int)
+            self.assertAlmostEqual(assemble(c1*ds(mesh)), ref_int)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/function/python/nonmatching_interpolation.py b/test/unit/function/python/nonmatching_interpolation.py
new file mode 100644
index 0000000..1565874
--- /dev/null
+++ b/test/unit/function/python/nonmatching_interpolation.py
@@ -0,0 +1,87 @@
+"""Unit tests for evaluating functions on non-matching meshes"""
+
+# Copyright (C) 2013 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-12-14
+# Last changed:
+
+import unittest
+import numpy
+from dolfin import *
+
+class Quadratic2D(Expression):
+    def eval(self, values, x):
+        values[0] = x[0]*x[0] + x[1]*x[1] + 1.0
+
+class Quadratic3D(Expression):
+    def eval(self, values, x):
+        values[0] = x[0]*x[0] + x[1]*x[1] + x[2]*x[2] + 1.0
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class NonmatchingFunctionInterpolationTest(unittest.TestCase):
+
+    def test_functional2D(self):
+        """Test integration of function interpolated in non-matching meshes"""
+
+        f = Quadratic2D()
+
+        # Interpolate quadratic function on course mesh
+        mesh0 = UnitSquareMesh(8, 8)
+        V0 = FunctionSpace(mesh0, "Lagrange", 2)
+        u0 = Function(V0)
+        u0.interpolate(f)
+
+        # Interpolate FE function on finer mesh
+        mesh1 = UnitSquareMesh(31, 31)
+        V1 = FunctionSpace(mesh1, "Lagrange", 2)
+        u1 = Function(V1)
+        u1.interpolate(u0)
+        self.assertAlmostEqual(assemble(u0*dx), assemble(u1*dx), 10)
+
+        mesh1 = UnitSquareMesh(30, 30)
+        V1 = FunctionSpace(mesh1, "Lagrange", 2)
+        u1 = Function(V1)
+        u1.interpolate(u0)
+        self.assertAlmostEqual(assemble(u0*dx), assemble(u1*dx), 10)
+
+    def test_functional3D(self):
+        """Test integration of function interpolated in non-matching meshes"""
+
+        f = Quadratic3D()
+
+        # Interpolate quadratic function on course mesh
+        mesh0 = UnitCubeMesh(4, 4, 4)
+        V0 = FunctionSpace(mesh0, "Lagrange", 2)
+        u0 = Function(V0)
+        u0.interpolate(f)
+
+        # Interpolate FE function on finer mesh
+        mesh1 = UnitCubeMesh(11, 11, 11)
+        V1 = FunctionSpace(mesh1, "Lagrange", 2)
+        u1 = Function(V1)
+        u1.interpolate(u0)
+        self.assertAlmostEqual(assemble(u0*dx), assemble(u1*dx), 10)
+
+        mesh1 = UnitCubeMesh(10, 11, 10)
+        V1 = FunctionSpace(mesh1, "Lagrange", 2)
+        u1 = Function(V1)
+        u1.interpolate(u0)
+        self.assertAlmostEqual(assemble(u0*dx), assemble(u1*dx), 10)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/geometry/python/BoundingBoxTree.py b/test/unit/geometry/python/BoundingBoxTree.py
new file mode 100644
index 0000000..6612830
--- /dev/null
+++ b/test/unit/geometry/python/BoundingBoxTree.py
@@ -0,0 +1,447 @@
+"""Unit tests for BoundingBoxTree"""
+
+# Copyright (C) 2013 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-04-15
+# Last changed: 2014-05-30
+
+import unittest
+import numpy
+
+from dolfin import BoundingBoxTree
+from dolfin import UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh
+from dolfin import Point
+from dolfin import MPI, mpi_comm_world
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class BoundingBoxTreeTest(unittest.TestCase):
+
+    #--- compute_collisions with point ---
+
+    def test_compute_collisions_point_1d(self):
+
+        reference = {1: set([4])}
+
+        p = Point(0.3)
+        mesh = UnitIntervalMesh(16)
+        for dim in range(1, 2):
+            tree = BoundingBoxTree()
+            tree.build(mesh, dim)
+            entities = tree.compute_collisions(p)
+            self.assertEqual(set(entities), reference[dim])
+
+    def test_compute_collisions_point_2d(self):
+
+        reference = {1: set([226]),
+                     2: set([136, 137])}
+
+        p = Point(0.3, 0.3)
+        mesh = UnitSquareMesh(16, 16)
+        for dim in range(1, 3):
+            tree = BoundingBoxTree()
+            tree.build(mesh, dim)
+            entities = tree.compute_collisions(p)
+            self.assertEqual(set(entities), reference[dim])
+
+    def test_compute_collisions_point_3d(self):
+
+        reference = {1: set([1364]),
+                     2: set([1967, 1968, 1970, 1972, 1974, 1976]),
+                     3: set([876, 877, 878, 879, 880, 881])}
+
+        p = Point(0.3, 0.3, 0.3)
+        mesh = UnitCubeMesh(8, 8, 8)
+        for dim in range(1, 4):
+            tree = BoundingBoxTree()
+            tree.build(mesh, dim)
+            entities = tree.compute_collisions(p)
+            self.assertEqual(set(entities), reference[dim])
+
+    #--- compute_collisions with tree ---
+
+    def test_compute_collisions_tree_1d(self):
+
+        references = [[set([8, 9, 10, 11, 12, 13, 14, 15]),
+                       set([0, 1, 2, 3, 4, 5, 6, 7])],
+                      [set([14, 15]),
+                       set([0, 1])]]
+
+        points = [Point(0.52), Point(0.9)]
+
+        for i, point in enumerate(points):
+
+            mesh_A = UnitIntervalMesh(16)
+            mesh_B = UnitIntervalMesh(16)
+
+            mesh_B.translate(point)
+
+            tree_A = BoundingBoxTree()
+            tree_A.build(mesh_A)
+
+            tree_B = BoundingBoxTree()
+            tree_B.build(mesh_B)
+
+            entities_A, entities_B = tree_A.compute_collisions(tree_B)
+
+            self.assertEqual(set(entities_A), references[i][0])
+            self.assertEqual(set(entities_B), references[i][1])
+
+    def test_compute_collisions_tree_2d(self):
+
+        references = [[set([20, 21, 22, 23, 28, 29, 30, 31]),
+                       set([0, 1, 2, 3, 8, 9, 10, 11])],
+                      [set([6, 7]),
+                       set([24, 25])]]
+
+        points = [Point(0.52, 0.51), Point(0.9, -0.9)]
+
+        for i, point in enumerate(points):
+
+            mesh_A = UnitSquareMesh(4, 4)
+            mesh_B = UnitSquareMesh(4, 4)
+
+            mesh_B.translate(point)
+
+            tree_A = BoundingBoxTree()
+            tree_A.build(mesh_A)
+
+            tree_B = BoundingBoxTree()
+            tree_B.build(mesh_B)
+
+            entities_A, entities_B = tree_A.compute_collisions(tree_B)
+
+            self.assertEqual(set(entities_A), references[i][0])
+            self.assertEqual(set(entities_B), references[i][1])
+
+    def test_compute_collisions_tree_3d(self):
+
+        references = [[set([18, 19, 20, 21, 22, 23, 42, 43, 44, 45, 46, 47]),
+                       set([0, 1, 2, 3, 4, 5, 24, 25, 26, 27, 28, 29])],
+                      [set([6, 7, 8, 9, 10, 11, 30, 31, 32, 33, 34, 35]),
+                       set([12, 13, 14, 15, 16, 17, 36, 37, 38, 39, 40, 41])]]
+
+        points = [Point(0.52, 0.51, 0.3), Point(0.9, -0.9, 0.3)]
+
+        for i, point in enumerate(points):
+
+            mesh_A = UnitCubeMesh(2, 2, 2)
+            mesh_B = UnitCubeMesh(2, 2, 2)
+
+            mesh_B.translate(point)
+
+            tree_A = BoundingBoxTree()
+            tree_A.build(mesh_A)
+
+            tree_B = BoundingBoxTree()
+            tree_B.build(mesh_B)
+
+            entities_A, entities_B = tree_A.compute_collisions(tree_B)
+
+            self.assertEqual(set(entities_A), references[i][0])
+            self.assertEqual(set(entities_B), references[i][1])
+
+    #--- compute_entity_collisions ---
+
+    def test_compute_entity_collisions_1d(self):
+
+        reference = set([4])
+
+        p = Point(0.3)
+        mesh = UnitIntervalMesh(16)
+
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        entities = tree.compute_entity_collisions(p)
+        self.assertEqual(set(entities), reference)
+
+        tree = mesh.bounding_box_tree()
+        entities = tree.compute_entity_collisions(p)
+        self.assertEqual(set(entities), reference)
+
+    def test_compute_entity_collisions_2d(self):
+
+        reference = set([136, 137])
+
+        p = Point(0.3, 0.3)
+        mesh = UnitSquareMesh(16, 16)
+
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        entities = tree.compute_entity_collisions(p)
+        self.assertEqual(set(entities), reference)
+
+        tree = mesh.bounding_box_tree()
+        entities = tree.compute_entity_collisions(p)
+        self.assertEqual(set(entities), reference)
+
+    def test_compute_entity_collisions_3d(self):
+
+        reference = set([876, 877, 878, 879, 880, 881])
+
+        p = Point(0.3, 0.3, 0.3)
+        mesh = UnitCubeMesh(8, 8, 8)
+
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        entities = tree.compute_entity_collisions(p)
+        self.assertEqual(set(entities), reference)
+
+    #--- compute_entity_collisions with tree ---
+
+    def test_compute_entity_collisions_tree_1d(self):
+
+        references = [[set([8, 9, 10, 11, 12, 13, 14, 15]),
+                       set([0, 1, 2, 3, 4, 5, 6, 7])],
+                      [set([14, 15]),
+                       set([0, 1])]]
+
+        points = [Point(0.52), Point(0.9)]
+
+        for i, point in enumerate(points):
+
+            mesh_A = UnitIntervalMesh(16)
+            mesh_B = UnitIntervalMesh(16)
+
+            mesh_B.translate(point)
+
+            tree_A = BoundingBoxTree()
+            tree_A.build(mesh_A)
+
+            tree_B = BoundingBoxTree()
+            tree_B.build(mesh_B)
+
+            entities_A, entities_B = tree_A.compute_entity_collisions(tree_B)
+
+            self.assertEqual(set(entities_A), references[i][0])
+            self.assertEqual(set(entities_B), references[i][1])
+
+    def test_compute_entity_collisions_tree_2d(self):
+
+        references = [[set([20, 21, 22, 23, 28, 29, 30, 31]),
+                       set([0, 1, 2, 3, 8, 9, 10, 11])],
+                      [set([6]),
+                       set([25])]]
+
+        points = [Point(0.52, 0.51), Point(0.9, -0.9)]
+
+        for i, point in enumerate(points):
+
+            mesh_A = UnitSquareMesh(4, 4)
+            mesh_B = UnitSquareMesh(4, 4)
+
+            mesh_B.translate(point)
+
+            tree_A = BoundingBoxTree()
+            tree_A.build(mesh_A)
+
+            tree_B = BoundingBoxTree()
+            tree_B.build(mesh_B)
+
+            entities_A, entities_B = tree_A.compute_entity_collisions(tree_B)
+
+            self.assertEqual(set(entities_A), references[i][0])
+            self.assertEqual(set(entities_B), references[i][1])
+
+    def test_compute_entity_collisions_tree_3d(self):
+
+        references = [[set([18, 19, 20, 21, 22, 23, 42, 43, 44, 45, 46, 47]),
+                       set([0, 1, 2, 3, 4, 5, 24, 25, 26, 27, 28, 29])],
+                      [set([7, 8, 30, 31, 32]),
+                       set([15, 16, 17, 39, 41])]]
+
+        points = [Point(0.52, 0.51, 0.3), Point(0.9, -0.9, 0.3)]
+
+        for i, point in enumerate(points):
+
+            mesh_A = UnitCubeMesh(2, 2, 2)
+            mesh_B = UnitCubeMesh(2, 2, 2)
+
+            mesh_B.translate(point)
+
+            tree_A = BoundingBoxTree()
+            tree_A.build(mesh_A)
+
+            tree_B = BoundingBoxTree()
+            tree_B.build(mesh_B)
+
+            entities_A, entities_B = tree_A.compute_entity_collisions(tree_B)
+
+            self.assertEqual(set(entities_A), references[i][0])
+            self.assertEqual(set(entities_B), references[i][1])
+
+    #--- compute_first_collision ---
+
+    def test_compute_first_collision_1d(self):
+
+        reference = {1: [4]}
+
+        p = Point(0.3)
+        mesh = UnitIntervalMesh(16)
+        for dim in range(1, 2):
+            tree = BoundingBoxTree()
+            tree.build(mesh, dim)
+            first = tree.compute_first_collision(p)
+            self.assertIn(first, reference[dim])
+
+        tree = mesh.bounding_box_tree()
+        first = tree.compute_first_collision(p)
+        self.assertIn(first, reference[mesh.topology().dim()])
+
+    def test_compute_first_collision_2d(self):
+
+        reference = {1: [226],
+                     2: [136, 137]}
+
+        p = Point(0.3, 0.3)
+        mesh = UnitSquareMesh(16, 16)
+        for dim in range(1, 3):
+            tree = BoundingBoxTree()
+            tree.build(mesh, dim)
+            first = tree.compute_first_collision(p)
+            self.assertIn(first, reference[dim])
+
+        tree = mesh.bounding_box_tree()
+        first = tree.compute_first_collision(p)
+        self.assertIn(first, reference[mesh.topology().dim()])
+
+    def test_compute_first_collision_3d(self):
+
+        reference = {1: [1364],
+                     2: [1967, 1968, 1970, 1972, 1974, 1976],
+                     3: [876, 877, 878, 879, 880, 881]}
+
+        p = Point(0.3, 0.3, 0.3)
+        mesh = UnitCubeMesh(8, 8, 8)
+        for dim in range(1, 4):
+            tree = BoundingBoxTree()
+            tree.build(mesh, dim)
+            first = tree.compute_first_collision(p)
+            self.assertIn(first, reference[dim])
+
+        tree = mesh.bounding_box_tree()
+        first = tree.compute_first_collision(p)
+        self.assertIn(first, reference[mesh.topology().dim()])
+
+    #--- compute_first_entity_collision ---
+
+    def test_compute_first_entity_collision_1d(self):
+
+        reference = [4]
+
+        p = Point(0.3)
+        mesh = UnitIntervalMesh(16)
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        first = tree.compute_first_entity_collision(p)
+        self.assertIn(first, reference)
+
+        tree = mesh.bounding_box_tree()
+        first = tree.compute_first_entity_collision(p)
+        self.assertIn(first, reference)
+
+    def test_compute_first_entity_collision_2d(self):
+
+        reference = [136, 137]
+
+        p = Point(0.3, 0.3)
+        mesh = UnitSquareMesh(16, 16)
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        first = tree.compute_first_entity_collision(p)
+        self.assertIn(first, reference)
+
+        tree = mesh.bounding_box_tree()
+        first = tree.compute_first_entity_collision(p)
+        self.assertIn(first, reference)
+
+    def test_compute_first_entity_collision_3d(self):
+
+        reference = [876, 877, 878, 879, 880, 881]
+
+        p = Point(0.3, 0.3, 0.3)
+        mesh = UnitCubeMesh(8, 8, 8)
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        first = tree.compute_first_entity_collision(p)
+        self.assertIn(first, reference)
+
+        tree = mesh.bounding_box_tree()
+        first = tree.compute_first_entity_collision(p)
+        self.assertIn(first, reference)
+
+    #--- compute_closest_entity ---
+
+    def test_compute_closest_entity_1d(self):
+
+        reference = (0, 1.0)
+
+        p = Point(-1.0)
+        mesh = UnitIntervalMesh(16)
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        entity, distance = tree.compute_closest_entity(p)
+
+        self.assertEqual(entity, reference[0])
+        self.assertAlmostEqual(distance, reference[1])
+
+        tree = mesh.bounding_box_tree()
+        entity, distance = tree.compute_closest_entity(p)
+        self.assertEqual(entity, reference[0])
+        self.assertAlmostEqual(distance, reference[1])
+
+    def test_compute_closest_entity_2d(self):
+
+        reference = (1, 1.0)
+
+        p = Point(-1.0, 0.01)
+        mesh = UnitSquareMesh(16, 16)
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        entity, distance = tree.compute_closest_entity(p)
+
+        self.assertEqual(entity, reference[0])
+        self.assertAlmostEqual(distance, reference[1])
+
+        tree = mesh.bounding_box_tree()
+        entity, distance = tree.compute_closest_entity(p)
+        self.assertEqual(entity, reference[0])
+        self.assertAlmostEqual(distance, reference[1])
+
+    def test_compute_closest_entity_3d(self):
+
+        reference = (0, 0.1)
+
+        p = Point(0.1, 0.05, -0.1)
+        mesh = UnitCubeMesh(8, 8, 8)
+        tree = BoundingBoxTree()
+        tree.build(mesh)
+        entity, distance = tree.compute_closest_entity(p)
+
+        self.assertEqual(entity, reference[0])
+        self.assertAlmostEqual(distance, reference[1])
+
+        tree = mesh.bounding_box_tree()
+        entity, distance = tree.compute_closest_entity(p)
+        self.assertEqual(entity, reference[0])
+        self.assertAlmostEqual(distance, reference[1])
+
+if __name__ == "__main__":
+    print ""
+    print "Testing BoundingBoxTree"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/geometry/python/CollisionDetection.py b/test/unit/geometry/python/CollisionDetection.py
new file mode 100644
index 0000000..b773fe7
--- /dev/null
+++ b/test/unit/geometry/python/CollisionDetection.py
@@ -0,0 +1,159 @@
+"""Unit tests for the CollisionDetection class"""
+
+# Copyright (C) 2014 Anders Logg and August Johansson
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2014-02-16
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+def create_triangular_mesh_3D():
+    editor = MeshEditor()
+    mesh = Mesh()
+    editor.open(mesh,2,3)
+    editor.init_cells(2)
+    editor.init_vertices(4)
+    editor.add_cell(0, 0,1,2)
+    editor.add_cell(1, 1,2,3)
+    editor.add_vertex(0, 0,0,0.5)
+    editor.add_vertex(1, 1,0,0.5)
+    editor.add_vertex(2, 0,1,0.5)
+    editor.add_vertex(3, 1,1,0.5)
+    editor.close()
+    return mesh;
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class IntervalTest(unittest.TestCase):
+    "Test class for collision with interval"
+
+    def test_collides_point(self):
+
+        mesh = UnitIntervalMesh(1)
+        cell = Cell(mesh, 0)
+
+        self.assertEqual(cell.collides(Point(0.5)), True)
+        self.assertEqual(cell.collides(Point(1.5)), False)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TriangleTest(unittest.TestCase):
+    "Test class for collision with triangle"
+
+    def test_collides_point(self):
+
+        mesh = UnitSquareMesh(1, 1)
+        cell = Cell(mesh, 0)
+
+        self.assertEqual(cell.collides(Point(0.5)), True)
+        self.assertEqual(cell.collides(Point(1.5)), False)
+
+    def test_collides_triangle(self):
+
+        m0 = UnitSquareMesh(8, 8)
+        c0 = Cell(m0, 0)
+
+        m1 = UnitSquareMesh(8, 8)
+        m1.translate(Point(0.1, 0.1))
+        c1 = Cell(m1, 0)
+        c2 = Cell(m1, 1)
+
+        self.assertEqual(c0.collides(c0), True)
+        self.assertEqual(c0.collides(c1), True)
+        # self.assertEqual(c0.collides(c2), False) # touching edges
+        self.assertEqual(c1.collides(c0), True)
+        self.assertEqual(c1.collides(c1), True)
+        self.assertEqual(c1.collides(c2), False)
+        # self.assertEqual(c2.collides(c0), False) # touching edges
+        self.assertEqual(c2.collides(c1), False)
+        self.assertEqual(c2.collides(c2), True)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TetrahedronTest(unittest.TestCase):
+    "Test class for collision with tetrahedron"
+
+    def test_collides_point(self):
+
+        mesh = UnitCubeMesh(1, 1, 1)
+        cell = Cell(mesh, 0)
+
+        self.assertEqual(cell.collides(Point(0.5)), True)
+        self.assertEqual(cell.collides(Point(1.5)), False)
+
+    def test_collides_triangle(self):
+
+        tetmesh = UnitCubeMesh(2, 2, 2)
+        trimesh = create_triangular_mesh_3D()
+        dx = Point(0.1, 0.1, -0.1)
+        trimesh_shift = create_triangular_mesh_3D()
+        trimesh_shift.translate(dx)
+
+        tet0 = Cell(tetmesh, 18)
+        tet1 = Cell(tetmesh, 19)
+        tri0 = Cell(trimesh, 1)
+        tri0shift = Cell(trimesh_shift, 1)
+
+        # proper intersection
+        self.assertEqual(tet0.collides(tri0shift), True)
+        self.assertEqual(tri0shift.collides(tet0), True)
+        self.assertEqual(tet1.collides(tri0shift), True)
+        self.assertEqual(tri0shift.collides(tet1), True)
+
+        # point touch
+        self.assertEqual(tet0.collides(tri0), True)
+        self.assertEqual(tri0.collides(tet0), True)
+
+        # face alignment (true or false)
+        self.assertEqual(tet1.collides(tri0), True)
+        self.assertEqual(tri0.collides(tet1), True)
+
+    def test_collides_tetrahedron(self):
+
+        m0 = UnitCubeMesh(2, 2, 2)
+        c19 = Cell(m0, 19)
+        c26 = Cell(m0, 26)
+        c37 = Cell(m0, 37)
+        c43 = Cell(m0, 43)
+        c45 = Cell(m0, 45)
+
+        m1 = UnitCubeMesh(1,1,1)
+        m1.translate(Point(0.5, 0.5, 0.5))
+        c3 = Cell(m0, 3)
+        c5 = Cell(m1, 5)
+
+        # self collisions
+        self.assertEqual(c3.collides(c3), True)
+        self.assertEqual(c45.collides(c45), True)
+
+        # standard collisions
+        self.assertEqual(c3.collides(c37), True)
+        self.assertEqual(c37.collides(c3), True)
+
+        # edge face
+        self.assertEqual(c5.collides(c45), True)
+        self.assertEqual(c45.collides(c5), True)
+
+        # touching edges
+        self.assertEqual(c5.collides(c19), False)
+        self.assertEqual(c19.collides(c5), False)
+
+        # touching faces
+        self.assertEqual(c3.collides(c43), True)
+        self.assertEqual(c43.collides(c3), True)
+
+if __name__ == "__main__":
+        unittest.main()
diff --git a/test/unit/geometry/python/Intersection.py b/test/unit/geometry/python/Intersection.py
new file mode 100644
index 0000000..fac013c
--- /dev/null
+++ b/test/unit/geometry/python/Intersection.py
@@ -0,0 +1,67 @@
+"""Unit tests for intersection computation"""
+
+# Copyright (C) 2013 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-04-18
+# Last changed: 2014-05-30
+
+import unittest
+
+from dolfin import intersect
+from dolfin import UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh, BoxMesh
+from dolfin import Point, FunctionSpace, Expression, interpolate
+from dolfin import MPI, mpi_comm_world
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class BoundingBoxTreeTest(unittest.TestCase):
+
+    def test_mesh_point_1d(self):
+        "Test mesh-point intersection in 1D"
+
+        point = Point(0.1)
+        mesh = UnitIntervalMesh(16)
+
+        intersection = intersect(mesh, point)
+
+        self.assertEqual(intersection.intersected_cells(), [1])
+
+    def test_mesh_point_2d(self):
+        "Test mesh-point intersection in 2D"
+
+        point = Point(0.1, 0.2)
+        mesh = UnitSquareMesh(16, 16)
+
+        intersection = intersect(mesh, point)
+
+        self.assertEqual(intersection.intersected_cells(), [98])
+
+    def test_mesh_point_3d(self):
+        "Test mesh-point intersection in 3D"
+
+        point = Point(0.1, 0.2, 0.3)
+        mesh = UnitCubeMesh(8, 8, 8)
+
+        intersection = intersect(mesh, point)
+
+        self.assertEqual(intersection.intersected_cells(), [816])
+
+if __name__ == "__main__":
+    print ""
+    print "Testing intersection computation"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/geometry/python/IntersectionTriangulation.py b/test/unit/geometry/python/IntersectionTriangulation.py
new file mode 100644
index 0000000..fb02c46
--- /dev/null
+++ b/test/unit/geometry/python/IntersectionTriangulation.py
@@ -0,0 +1,175 @@
+"""Unit tests for the IntersectionTriangulation class"""
+
+# Copyright (C) 2014 Anders Logg and August Johansson
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2014-02-16
+# Last changed: 2014-05-30
+
+import unittest
+import numpy
+from dolfin import *
+
+def triangulation_to_mesh_2d(triangulation):
+    editor = MeshEditor()
+    mesh = Mesh()
+    editor.open(mesh, 2, 2)
+    num_cells = len(triangulation) / 6
+    num_vertices = len(triangulation) / 2
+    editor.init_cells(num_cells)
+    editor.init_vertices(num_vertices)
+    for i in xrange(num_cells):
+        editor.add_cell(i, 3*i, 3*i + 1, 3*i + 2)
+    for i in xrange(num_vertices):
+        editor.add_vertex(i, triangulation[2*i], triangulation[2*i + 1])
+    editor.close()
+    return mesh
+
+def triangulation_to_mesh_2d_3d(triangulation):
+    editor = MeshEditor()
+    mesh = Mesh()
+    editor.open(mesh,2,3)
+    num_cells = len(triangulation)/9
+    num_vertices = len(triangulation)/3
+    editor.init_cells(num_cells)
+    editor.init_vertices(num_vertices)
+    for i in xrange(num_cells):
+        editor.add_cell(i, 3*i, 3*i+1, 3*i+2)
+    for i in xrange(num_vertices):
+        editor.add_vertex(i, triangulation[3*i], triangulation[3*i+1], triangulation[3*i+2])
+    editor.close()
+    return mesh
+
+def triangulation_to_mesh_3d(triangulation):
+    editor = MeshEditor()
+    mesh = Mesh()
+    editor.open(mesh,3,3)
+    num_cells = len(triangulation)/12
+    num_vertices = len(triangulation)/3
+    editor.init_cells(num_cells)
+    editor.init_vertices(num_vertices)
+    for i in xrange(num_cells):
+        editor.add_cell(i, 4*i, 4*i+1, 4*i+2, 4*i+3)
+    for i in xrange(num_vertices):
+        editor.add_vertex(i, triangulation[3*i], triangulation[3*i+1], triangulation[3*i+2])
+    editor.close()
+    return mesh
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TriangulateTest(unittest.TestCase):
+
+    def test_triangulate_intersection_2d(self):
+
+        # Create two meshes of the unit square
+        mesh_0 = UnitSquareMesh(1, 1)
+        mesh_1 = UnitSquareMesh(1, 1)
+
+        # Translate second mesh randomly
+        #dx = Point(numpy.random.rand(),numpy.random.rand())
+        dx = Point(0.278498, 0.546881, 0.957506)
+        mesh_1.translate(dx)
+
+        exactvolume = (1 - abs(dx[0]))*(1 - abs(dx[1]))
+
+        # Compute triangulation
+        volume = 0
+        for c0 in cells(mesh_0):
+            for c1 in cells(mesh_1):
+                triangulation = c0.triangulate_intersection(c1)
+                if (triangulation.size>0):
+                    tmesh = triangulation_to_mesh_2d(triangulation)
+                    for t in cells(tmesh):
+                        volume += t.volume()
+
+        errorstring = "translation=" + str(dx[0]) + str(" ") + str(dx[1])
+        self.assertAlmostEqual(volume, exactvolume,7,errorstring)
+
+    def test_triangulate_intersection_2d_3d(self):
+
+        # Note: this test will fail if the triangle mesh is aligned
+        # with the tetrahedron mesh
+
+        # Create a unit cube
+        mesh_0 = UnitCubeMesh(1,1,1)
+
+        # Create a 3D surface mesh
+        editor = MeshEditor()
+        mesh_1 = Mesh()
+        editor.open(mesh_1,2,3)
+        editor.init_cells(2)
+        editor.init_vertices(4)
+        # add cells
+        editor.add_cell(0,0,1,2)
+        editor.add_cell(1,1,2,3)
+        # add vertices
+        editor.add_vertex(0,0,0,0.5)
+        editor.add_vertex(1,1,0,0.5)
+        editor.add_vertex(2,0,1,0.5)
+        editor.add_vertex(3,1,1,0.5)
+        editor.close()
+
+        # Rotate the triangle mesh around y axis a random angle in
+        # (0,90) degrees
+        #angle = numpy.random.rand()*90
+        angle = 23.46354
+        mesh_1.rotate(angle,1)
+
+        # Exact area
+        exactvolume = 1
+
+        # Compute triangulation
+        volume = 0
+        for c0 in cells(mesh_0):
+            for c1 in cells(mesh_1):
+                triangulation = c0.triangulate_intersection(c1)
+                if (triangulation.size>0):
+                    tmesh = triangulation_to_mesh_2d_3d(triangulation)
+                    for t in cells(tmesh):
+                        volume += t.volume()
+
+        errorstring = "rotation angle = " + str(angle)
+        self.assertAlmostEqual(volume, exactvolume, 7, errorstring)
+
+    def test_triangulate_intersection_3d(self):
+
+        # Create two meshes of the unit cube
+        mesh_0 = UnitCubeMesh(1, 1, 1)
+        mesh_1 = UnitCubeMesh(1, 1, 1)
+
+        # Translate second mesh
+        # dx = Point(numpy.random.rand(),numpy.random.rand(),numpy.random.rand())
+        dx = Point(0.913375, 0.632359, 0.097540)
+
+        mesh_1.translate(dx)
+        exactvolume = (1 - abs(dx[0]))*(1 - abs(dx[1]))*(1 - abs(dx[2]))
+
+        # Compute triangulation
+        volume = 0
+        for c0 in cells(mesh_0):
+            for c1 in cells(mesh_1):
+                triangulation = c0.triangulate_intersection(c1)
+                if (triangulation.size>0):
+                    tmesh = triangulation_to_mesh_3d(triangulation)
+                    for t in cells(tmesh):
+                        volume += t.volume()
+
+        errorstring = "translation="
+        errorstring += str(dx[0])+" "+str(dx[1])+" "+str(dx[2])
+        self.assertAlmostEqual(volume, exactvolume, 7, errorstring)
+
+if __name__ == "__main__":
+        unittest.main()
diff --git a/test/unit/geometry/python/Issues.py b/test/unit/geometry/python/Issues.py
new file mode 100644
index 0000000..fb02cb4
--- /dev/null
+++ b/test/unit/geometry/python/Issues.py
@@ -0,0 +1,54 @@
+"""Unit tests for intersection computation"""
+
+# Copyright (C) 2013 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-12-09
+# Last changed: 2014-05-30
+
+import unittest
+
+from dolfin import *
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class Issues(unittest.TestCase):
+
+    def test_issue_97(self):
+        "Test from Mikael Mortensen (issue #97)"
+
+        N = 2
+        L = 1000
+        mesh = BoxMesh(0, 0, 0, L, L, L, N, N, N)
+        V = FunctionSpace(mesh, 'CG', 1)
+        v = interpolate(Expression('x[0]'), V)
+        x = Point(0.5*L, 0.5*L, 0.5*L)
+        vx = v(x)
+
+    def test_issue_168(self):
+        "Test from Torsten Wendav (issue #168)"
+
+        mesh = UnitCubeMesh(14, 14, 14)
+        V = FunctionSpace(mesh, "Lagrange", 1)
+        v = Function(V)
+        x = (0.75, 0.25, 0.125)
+        vx = v(x)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing issues reported by users"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/graph/python/GraphBuild.py b/test/unit/graph/python/GraphBuild.py
new file mode 100644
index 0000000..87c7ce3
--- /dev/null
+++ b/test/unit/graph/python/GraphBuild.py
@@ -0,0 +1,40 @@
+"""Unit tests for graph building"""
+
+# Copyright (C) 2013 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-08-10
+# Last changed:
+
+import unittest
+from dolfin import *
+
+class GraphBuilding(unittest.TestCase):
+
+    def test_build_from_mesh_simple(self):
+        """Build mesh graph """
+
+        mesh = UnitCubeMesh(16, 16, 16)
+        D = mesh.topology().dim()
+        GraphBuilder.local_graph(mesh, D, 0)
+        GraphBuilder.local_graph(mesh, D, 1)
+        GraphBuilder.local_graph(mesh, 2, D)
+        GraphBuilder.local_graph(mesh, 1, D)
+        GraphBuilder.local_graph(mesh, 0, D)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/cpp/CMakeLists.txt b/test/unit/io/cpp/CMakeLists.txt
new file mode 100644
index 0000000..2574824
--- /dev/null
+++ b/test/unit/io/cpp/CMakeLists.txt
@@ -0,0 +1,44 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME test_io)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(test_XMLLocalMeshData XMLLocalMeshData.cpp)
+add_executable(test_XMLMeshValueCollection XMLMeshValueCollection.cpp)
+add_executable(test_XMLMeshData XMLMeshData.cpp)
+
+# Target libraries
+target_link_libraries(test_XMLLocalMeshData ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
+target_link_libraries(test_XMLMeshValueCollection ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
+target_link_libraries(test_XMLMeshData ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/test/unit/io/cpp/XMLLocalMeshData.cpp b/test/unit/io/cpp/XMLLocalMeshData.cpp
new file mode 100644
index 0000000..f392dae
--- /dev/null
+++ b/test/unit/io/cpp/XMLLocalMeshData.cpp
@@ -0,0 +1,53 @@
+// Copyright (C) 2007 Magnus Vikstrøm
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-05-29
+// Last changed: 2012-01-12
+//
+
+#include <dolfin.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/common/unittest.h>
+
+using namespace dolfin;
+
+class LocalMeshDataIO : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(LocalMeshDataIO);
+  CPPUNIT_TEST(testRead);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+// FIXME: Not a proper unit test. When LocalMeshData has a public interface
+// FIXME: we can expand on these
+  void testRead()
+  {
+    // Create undirected graph with edges added out of order (should pass)
+    File file("../snake.xml.gz");
+    LocalMeshData localdata(MPI_COMM_WORLD);
+    file >> localdata;
+  }
+};
+
+
+CPPUNIT_TEST_SUITE_REGISTRATION(LocalMeshDataIO);
+
+int main()
+{
+  DOLFIN_TEST;
+}
diff --git a/test/unit/io/cpp/XMLMeshData.cpp b/test/unit/io/cpp/XMLMeshData.cpp
new file mode 100644
index 0000000..b546b2a
--- /dev/null
+++ b/test/unit/io/cpp/XMLMeshData.cpp
@@ -0,0 +1,85 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2012-05-25
+// Last changed:
+//
+
+#include <dolfin.h>
+#include <dolfin/common/unittest.h>
+
+using namespace dolfin;
+
+class XMLMeshDataIO : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(XMLMeshDataIO);
+  CPPUNIT_TEST(test_write_read);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void test_write_read()
+  {
+    // XML mesh output is not supported in parallel. Add test for
+    // parallel with HDF5 when ready.
+    if (dolfin::MPI::size(MPI_COMM_WORLD) == 1)
+    {
+      const std::size_t value = 10;
+      {
+        UnitSquareMesh mesh(2, 2);
+
+        // Create some mesh data
+        std::vector<std::size_t>& data0 = mesh.data().create_array("v", 0);
+        data0.resize(mesh.num_entities(0), value);
+
+        mesh.init(1);
+        std::vector<std::size_t>& data1 = mesh.data().create_array("e", 1);
+        data1.resize(mesh.num_entities(1), value);
+
+        std::vector<std::size_t>& data2 = mesh.data().create_array("c", 2);
+        data2.resize(mesh.num_entities(2), value);
+
+        File file("mesh_data.xml");
+        file << mesh;
+      }
+
+      {
+        // Read mesh from file
+        Mesh mesh("mesh_data.xml");
+
+        // Access mesh data and check
+        const std::vector<std::size_t>& data0 = mesh.data().array("v", 0);
+        CPPUNIT_ASSERT(data0.size() == mesh.num_entities(0));
+        CPPUNIT_ASSERT(data0[2] == value);
+        const std::vector<std::size_t>& data1 = mesh.data().array("e", 1);
+        CPPUNIT_ASSERT(data1.size() == mesh.num_entities(1));
+        CPPUNIT_ASSERT(data1[2] == value);
+        const std::vector<std::size_t>& data2 = mesh.data().array("c", 2);
+        CPPUNIT_ASSERT(data2.size() == mesh.num_entities(2));
+        CPPUNIT_ASSERT(data2[2] == value);
+      }
+    }
+  }
+};
+
+
+CPPUNIT_TEST_SUITE_REGISTRATION(XMLMeshDataIO);
+
+int main()
+{
+  DOLFIN_TEST;
+}
diff --git a/test/unit/io/cpp/XMLMeshValueCollection.cpp b/test/unit/io/cpp/XMLMeshValueCollection.cpp
new file mode 100644
index 0000000..ff04a77
--- /dev/null
+++ b/test/unit/io/cpp/XMLMeshValueCollection.cpp
@@ -0,0 +1,65 @@
+// Copyright (C) 2007 Magnus Vikstrøm
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-05-29
+// Last changed: 2012-01-12
+//
+
+#include <dolfin.h>
+#include <dolfin/mesh/LocalMeshData.h>
+#include <dolfin/common/unittest.h>
+
+using namespace dolfin;
+
+class MeshValueCollectionIO : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(MeshValueCollectionIO);
+  CPPUNIT_TEST(test_read);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void test_read()
+  {
+    // Create mesh and read file
+    UnitCubeMesh mesh(5, 5, 5);
+    MeshValueCollection<std::size_t>
+      markers(mesh, "xml_value_collection_ref.xml");
+
+    // Check size
+    CPPUNIT_ASSERT(dolfin::MPI::sum(mesh.mpi_comm(), markers.size()) == 6);
+
+    // Check sum of values
+    const std::map<std::pair<std::size_t, std::size_t>, std::size_t>&
+      values = markers.values();
+    std::map<std::pair<std::size_t, std::size_t>,
+             std::size_t>::const_iterator it;
+    std::size_t sum = 0;
+    for (it = values.begin(); it != values.end(); ++it)
+      sum += it->second;
+    CPPUNIT_ASSERT(dolfin::MPI::sum(mesh.mpi_comm(), sum) == 48);
+  }
+
+};
+
+
+CPPUNIT_TEST_SUITE_REGISTRATION(MeshValueCollectionIO);
+
+int main()
+{
+  DOLFIN_TEST;
+}
diff --git a/test/unit/io/cpp/xml_value_collection_ref.xml b/test/unit/io/cpp/xml_value_collection_ref.xml
new file mode 100644
index 0000000..68c9de9
--- /dev/null
+++ b/test/unit/io/cpp/xml_value_collection_ref.xml
@@ -0,0 +1,11 @@
+<?xml version="1.0"?>
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <mesh_value_collection type="uint" dim="2" size="6">
+    <value cell_index="1" local_entity="1" value="1" />
+    <value cell_index="2" local_entity="1" value="3" />
+    <value cell_index="4" local_entity="2" value="2" />
+    <value cell_index="5" local_entity="1" value="8" />
+    <value cell_index="7" local_entity="2" value="13" />
+    <value cell_index="13" local_entity="1" value="21" />
+  </mesh_value_collection>
+</dolfin>
diff --git a/test/unit/io/python/Exodus.py b/test/unit/io/python/Exodus.py
new file mode 100644
index 0000000..8272b5f
--- /dev/null
+++ b/test/unit/io/python/Exodus.py
@@ -0,0 +1,90 @@
+# -*- coding: utf-8 -*-
+"""Unit tests for the Exodus io library"""
+
+# Copyright (C) 2013 Nico Schlömer
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-02-27
+# Last changed: 2013-03-11
+
+import unittest
+from dolfin import *
+
+if has_exodus():
+    class Exodus_Mesh_Output(unittest.TestCase):
+        """Test output of Meshes to Exodus files"""
+
+        def test_save_1d_mesh(self):
+            mesh = UnitIntervalMesh(32)
+            File("mesh.e") << mesh
+
+        def test_save_2d_mesh(self):
+            mesh = UnitSquareMesh(32, 32)
+            File("mesh.e") << mesh
+
+        def test_save_3d_mesh(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            File("mesh.e") << mesh
+
+
+    class Exodus_Point_Function_Output(unittest.TestCase):
+        """Test output of point-based Functions to Exodus files"""
+
+        def test_save_1d_scalar(self):
+            mesh = UnitIntervalMesh(32)
+            u = Function(FunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File("u.e") << u
+
+        def test_save_2d_scalar(self):
+            mesh = UnitSquareMesh(16, 16)
+            u = Function(FunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File("u.e") << u
+
+        def test_save_3d_scalar(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            u = Function(FunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File("u.e") << u
+
+        def test_save_2d_vector(self):
+            mesh = UnitSquareMesh(16, 16)
+            u = Function(VectorFunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File("u.e") << u
+
+        def test_save_3d_vector(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            u = Function(VectorFunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File("u.e") << u
+
+        def test_save_2d_tensor(self):
+            mesh = UnitSquareMesh(16, 16)
+            u = Function(TensorFunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File("u.e") << u
+
+        #def test_save_3d_tensor(self):
+        #    mesh = UnitCubeMesh(8, 8, 8)
+        #    u = Function(TensorFunctionSpace(mesh, "Lagrange", 2))
+        #    u.vector()[:] = 1.0
+        #    File("u.e") << u
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/HDF5.py b/test/unit/io/python/HDF5.py
new file mode 100644
index 0000000..cc73483
--- /dev/null
+++ b/test/unit/io/python/HDF5.py
@@ -0,0 +1,182 @@
+"""Unit tests for the HDF5 io library"""
+
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Chris Richardson 2013
+
+import unittest
+from dolfin import *
+
+if has_hdf5():
+    class HDF5_Vector(unittest.TestCase):
+        """Test input/output of Vector to HDF5 files"""
+
+        def test_save_vector(self):
+            x = Vector(mpi_comm_world(), 305)
+            x[:] = 1.0
+            vector_file = HDF5File(x.mpi_comm(), "new_folder/x.h5", "w")
+            vector_file.write(x, "/my_vector")
+
+        def test_save_and_read_vector(self):
+            # Write to file
+            x = Vector(mpi_comm_world(), 305)
+            x[:] = 1.2
+            vector_file = HDF5File(x.mpi_comm(), "vector.h5", "w")
+            vector_file.write(x, "/my_vector")
+            del vector_file
+
+            # Read from file
+            y = Vector()
+            vector_file = HDF5File(x.mpi_comm(), "vector.h5", "r")
+            vector_file.read(y, "/my_vector", False)
+            self.assertEqual(y.size(), x.size())
+            self.assertEqual((x - y).norm("l1"), 0.0)
+
+    class HDF5_MeshFunction(unittest.TestCase):
+
+        def test_save_and_read_meshfunction_2D(self):
+            # Write to file
+            mesh = UnitSquareMesh(20, 20)
+            mf_file = HDF5File(mesh.mpi_comm(), "meshfn-2d.h5", "w")
+
+            # save meshfuns to compare when reading back
+            meshfunctions = []
+            for i in range(0,3):
+                mf = MeshFunction('double', mesh, i)
+                # NB choose a value to set which will be the same
+                # on every process for each entity
+                for cell in entities(mesh, i):
+                    mf[cell] = cell.midpoint()[0]
+                meshfunctions.append(mf)
+                mf_file.write(mf, "/meshfunction/meshfun%d"%i)
+
+            del mf_file
+
+            # Read back from file
+            mf_file = HDF5File(mesh.mpi_comm(), "meshfn-2d.h5", "r")
+            for i in range(0,3):
+                mf2 = MeshFunction('double', mesh, i)
+                mf_file.read(mf2, "/meshfunction/meshfun%d"%i)
+                for cell in entities(mesh, i):
+                    self.assertEqual(meshfunctions[i][cell], mf2[cell])
+
+        def test_save_and_read_meshfunction_3D(self):
+            # Write to file
+            mesh = UnitCubeMesh(10, 10, 10)
+            mf_file = HDF5File(mesh.mpi_comm(), "meshfn-3d.h5", "w")
+
+            # save meshfuns to compare when reading back
+            meshfunctions = []
+            for i in range(0,4):
+                mf = MeshFunction('double', mesh, i)
+                # NB choose a value to set which will be the same
+                # on every process for each entity
+                for cell in entities(mesh, i):
+                    mf[cell] = cell.midpoint()[0]
+                meshfunctions.append(mf)
+                mf_file.write(mf, "/meshfunction/group/%d/meshfun"%i)
+
+            del mf_file
+
+            # Read back from file
+            mf_file = HDF5File(mesh.mpi_comm(), "meshfn-3d.h5", "r")
+            for i in range(0,4):
+                mf2 = MeshFunction('double', mesh, i)
+                mf_file.read(mf2, "/meshfunction/group/%d/meshfun"%i)
+                for cell in entities(mesh, i):
+                    self.assertEqual(meshfunctions[i][cell], mf2[cell])
+
+    class HDF5_MeshValueCollection(unittest.TestCase):
+
+        def test_save_and_read_mesh_value_collection(self):
+            mesh = UnitCubeMesh(5, 5, 5)
+
+            # Writ to file
+            hdf5_file = HDF5File(mesh.mpi_comm(), "mesh_value_collection.h5", "w")
+            for dim in range(mesh.topology().dim()):
+                mvc = MeshValueCollection("size_t", mesh, dim)
+                for i, cell in enumerate(entities(mesh, dim)):
+                    mvc.set_value(cell.index(), i)
+                hdf5_file.write(mvc, "/mesh_value_collection_%d"%dim)
+            del hdf5_file
+
+            # Read from file
+            hdf5_file = HDF5File(mesh.mpi_comm(), "mesh_value_collection.h5", "r")
+            for dim in range(mesh.topology().dim()):
+                mvc = MeshValueCollection("size_t", mesh, dim)
+                hdf5_file.read(mvc, "/mesh_value_collection_%d"%dim)
+
+
+    class HDF5_Function(unittest.TestCase):
+
+        def test_save_and_read_function(self):
+            mesh = UnitSquareMesh(10, 10)
+            Q = FunctionSpace(mesh, "CG", 3)
+            F0 = Function(Q)
+            F1 = Function(Q)
+            E = Expression("x[0]")
+            F0.interpolate(E)
+
+            # Save to HDF5 File
+            hdf5_file = HDF5File(mesh.mpi_comm(), "function.h5", "w")
+            hdf5_file.write(F0, "function")
+            del hdf5_file
+
+            #Read back from file
+            hdf5_file = HDF5File(mesh.mpi_comm(), "function.h5", "r")
+            hdf5_file.read(F1, "function")
+            result = F0.vector() - F1.vector()
+            self.assertTrue(result.array().all() == 0)
+
+    class HDF5_Mesh(unittest.TestCase):
+
+        def test_save_and_read_mesh_2D(self):
+            # Write to file
+            mesh0 = UnitSquareMesh(20, 20)
+            mesh_file = HDF5File(mesh0.mpi_comm(), "mesh.h5", "w")
+            mesh_file.write(mesh0, "/my_mesh")
+            del mesh_file
+
+            # Read from file
+            mesh1 = Mesh()
+            mesh_file = HDF5File(mesh0.mpi_comm(), "mesh.h5", "r")
+            mesh_file.read(mesh1, "/my_mesh", False)
+
+            self.assertEqual(mesh0.size_global(0), mesh1.size_global(0))
+            dim = mesh0.topology().dim()
+            self.assertEqual(mesh0.size_global(dim), mesh1.size_global(dim))
+
+        def test_save_and_read_mesh_3D(self):
+            # Write to file
+            mesh0 = UnitCubeMesh(10, 10, 10)
+            mesh_file = HDF5File(mesh0.mpi_comm(), "mesh.h5", "w")
+            mesh_file.write(mesh0, "/my_mesh")
+            del mesh_file
+
+            # Read from file
+            mesh1 = Mesh()
+            mesh_file = HDF5File(mesh0.mpi_comm(), "mesh.h5", "r")
+            mesh_file.read(mesh1, "/my_mesh", False)
+
+            self.assertEqual(mesh0.size_global(0), mesh1.size_global(0))
+            dim = mesh0.topology().dim()
+            self.assertEqual(mesh0.size_global(dim), mesh1.size_global(dim))
+
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/HDF5Attribute.py b/test/unit/io/python/HDF5Attribute.py
new file mode 100644
index 0000000..b8dcaad
--- /dev/null
+++ b/test/unit/io/python/HDF5Attribute.py
@@ -0,0 +1,87 @@
+"""Unit tests for the Attribute interface of the HDF5 io library"""
+
+# Copyright (C) 2013 Chris Richardson
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+#
+# First added:  2013-10-25
+# Last changed: 2013-10-25
+
+import unittest
+from dolfin import *
+
+if has_hdf5():
+    class HDF5_Attribute(unittest.TestCase):
+        """Test read/write of Atrtibutes in HDF5 files"""
+
+        def test_read_write_str_attribute(self):
+            hdf_file = HDF5File(mpi_comm_world(), "a.h5", "w")
+            x = Vector(mpi_comm_world(), 123)
+            hdf_file.write(x, "/a_vector")
+            attr = hdf_file.attributes("/a_vector")
+            attr['name'] = 'Vector'
+            self.assertEqual(attr.type_str("name"), "string")
+            self.assertEqual(attr['name'], 'Vector')
+
+        def test_read_write_float_attribute(self):
+            hdf_file = HDF5File(mpi_comm_world(), "a.h5", "w")
+            x = Vector(mpi_comm_world(), 123)
+            hdf_file.write(x, "/a_vector")
+            attr = hdf_file.attributes("/a_vector")
+            attr['val'] = -9.2554
+            self.assertEqual(attr.type_str("val"), "float")
+            self.assertEqual(attr['val'], -9.2554)
+
+        def test_read_write_int_attribute(self):
+            hdf_file = HDF5File(mpi_comm_world(), "a.h5", "w")
+            x = Vector(mpi_comm_world(), 123)
+            hdf_file.write(x, "/a_vector")
+            attr = hdf_file.attributes("/a_vector")
+            attr['val'] = 1
+            self.assertEqual(attr.type_str("val"), "int")
+            self.assertEqual(attr['val'], 1)
+
+        def test_read_write_vec_float_attribute(self):
+            import numpy
+            hdf_file = HDF5File(mpi_comm_world(), "a.h5", "w")
+            x = Vector(mpi_comm_world(), 123)
+            hdf_file.write(x, "/a_vector")
+            attr = hdf_file.attributes("/a_vector")
+            vec = numpy.array([1,2,3,4.5], dtype='float')
+            attr['val'] = vec
+            ans = attr['val']
+            self.assertEqual(attr.type_str("val"), "vectorfloat")
+            self.assertEqual(len(vec), len(ans))
+            for val1, val2 in zip(vec, ans):
+                self.assertEqual(val1, val2)
+
+        def test_read_write_vec_int_attribute(self):
+            import numpy
+            hdf_file = HDF5File(mpi_comm_world(), "a.h5", "w")
+            x = Vector(mpi_comm_world(), 123)
+            hdf_file.write(x, "/a_vector")
+            attr = hdf_file.attributes("/a_vector")
+            vec = numpy.array([1,2,3,4,5], dtype=numpy.uintp)
+            attr['val'] = vec
+            ans = attr['val']
+            self.assertEqual(attr.type_str("val"), "vectorint")
+            self.assertEqual(len(vec), len(ans))
+            for val1, val2 in zip(vec, ans):
+                self.assertEqual(val1, val2)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/SVG.py b/test/unit/io/python/SVG.py
new file mode 100644
index 0000000..ddef326
--- /dev/null
+++ b/test/unit/io/python/SVG.py
@@ -0,0 +1,45 @@
+"""Unit tests for SVG output"""
+
+# Copyright (C) 2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-12-01
+# Last changed: 2012-12-01
+
+import unittest
+from dolfin import *
+
+class SVG(unittest.TestCase):
+    "Test output to SVG"
+
+    def test_write_mesh_1d(self):
+        mesh = UnitIntervalMesh(8)
+        f = File("output/mesh_1d.svg")
+        f << mesh
+
+    def test_write_mesh_2d(self):
+        mesh = UnitSquareMesh(8, 8)
+        f = File("output/mesh_2d.svg")
+        f << mesh
+
+    def test_write_mesh_3d(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        f = File("output/mesh_3d.svg")
+        f << mesh
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/X3D.py b/test/unit/io/python/X3D.py
new file mode 100644
index 0000000..1089941
--- /dev/null
+++ b/test/unit/io/python/X3D.py
@@ -0,0 +1,71 @@
+"""Unit tests for the X3D io library"""
+
+# Copyright (C) 2013 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-05-12
+# Last changed:
+
+import unittest
+from dolfin import *
+
+class X3D_Mesh(unittest.TestCase):
+    """Test output of Mesh to X3D file"""
+
+    def test_save_mesh1D(self):
+        mesh = UnitIntervalMesh(16)
+        file = File("mesh1D.x3d")
+        #self.assertRaises(RuntimeError, file << mesh)
+
+    def test_save_mesh2D(self):
+        mesh = UnitSquareMesh(16, 16)
+        file = File("mesh2D.x3d")
+        file << mesh
+
+    def test_save_mesh3D(self):
+        mesh = UnitCubeMesh(16, 16, 16)
+        file = File("mesh3D.x3d")
+        file << mesh
+
+class X3D_MeshFunction(unittest.TestCase):
+
+    def test_save_cell_meshfunction2D(self):
+        mesh = UnitSquareMesh(16, 16)
+        mf = CellFunction("size_t", mesh, 12)
+        file = File("cell_mf2D.x3d")
+        file << mf
+
+    def test_save_facet_meshfunction2D(self):
+        mesh = UnitSquareMesh(16, 16)
+        mf = FacetFunction("size_t", mesh, 12)
+        file = File("facet_mf2D.x3d")
+        #self.assertRaises(RuntimeError, file << mf)
+
+    def test_save_cell_meshfunctio22D(self):
+        mesh = UnitCubeMesh(16, 16, 16)
+        mf = CellFunction("size_t", mesh, 12)
+        file = File("cell_mf3D.x3d")
+        file << mf
+
+    def test_save_facet_meshfunction3D(self):
+        mesh = UnitCubeMesh(16, 16, 16)
+        mf = FacetFunction("size_t", mesh, 12)
+        file = File("facet_mf3D.x3d")
+        #self.assertRaises(RuntimeError, file << mf)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/XDMF.py b/test/unit/io/python/XDMF.py
new file mode 100644
index 0000000..1f63423
--- /dev/null
+++ b/test/unit/io/python/XDMF.py
@@ -0,0 +1,239 @@
+"""Unit tests for the XDMF io library"""
+
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-09-14
+# Last changed: 2013-03-05
+
+import unittest
+from dolfin import *
+
+if has_hdf5():
+    class XDMF_Mesh_Output_and_Input(unittest.TestCase):
+        """Test output and input of Meshes to/from XDMF files"""
+
+        def test_save_and_load_1d_mesh(self):
+            mesh = UnitIntervalMesh(32)
+            File("output/mesh.xdmf") << mesh
+            XDMFFile(mesh.mpi_comm(), "output/mesh.xdmf") << mesh
+            mesh2 = Mesh("output/mesh.xdmf")
+            self.assertEqual(mesh.size_global(0), mesh2.size_global(0))
+            dim = mesh.topology().dim()
+            self.assertEqual(mesh.size_global(dim), mesh2.size_global(dim))
+
+        def test_save_and_load_2d_mesh(self):
+            mesh = UnitSquareMesh(32, 32)
+            File("output/mesh_2D.xdmf") << mesh
+            XDMFFile(mesh.mpi_comm(), "output/mesh_2D.xdmf") << mesh
+            mesh2 = Mesh("output/mesh_2D.xdmf")
+            self.assertEqual(mesh.size_global(0), mesh2.size_global(0))
+            dim = mesh.topology().dim()
+            self.assertEqual(mesh.size_global(dim), mesh2.size_global(dim))
+
+        def test_save_and_load_3d_mesh(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            File("output/mesh_3D.xdmf") << mesh
+            XDMFFile(mesh.mpi_comm(), "output/mesh_3D.xdmf") << mesh
+            mesh2 = Mesh("output/mesh_3D.xdmf")
+            self.assertEqual(mesh.size_global(0), mesh2.size_global(0))
+            dim = mesh.topology().dim()
+            self.assertEqual(mesh.size_global(dim), mesh2.size_global(dim))
+
+    class XDMF_Vertex_Function_Output(unittest.TestCase):
+        """Test output of vertex-based Functions to XDMF files"""
+
+        def test_save_1d_scalar(self):
+            mesh = UnitIntervalMesh(32)
+            u = Function(FunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File("output/u.xdmf") << u
+            XDMFFile(mesh.mpi_comm(), "output/u.xdmf") << u
+
+        def test_save_2d_scalar(self):
+            mesh = UnitSquareMesh(16, 16)
+            u = Function(FunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File(mesh.mpi_comm(), "output/u.xdmf") << u
+            XDMFFile(mesh.mpi_comm(), "output/u.xdmf") << u
+
+        def test_save_3d_scalar(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            u = Function(FunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File(mesh.mpi_comm(), "output/u.xdmf") << u
+            XDMFFile(mesh.mpi_comm(), "output/u.xdmf") << u
+
+        def test_save_2d_vector(self):
+            mesh = UnitSquareMesh(16, 16)
+            u = Function(VectorFunctionSpace(mesh, "Lagrange", 2))
+            c = Constant((1.0, 2.0))
+            u.interpolate(c)
+            File(mesh.mpi_comm(), "output/u_2dv.xdmf") << u
+            XDMFFile(mesh.mpi_comm(), "output/u.xdmf") << u
+
+        def test_save_3d_vector(self):
+            mesh = UnitCubeMesh(1, 1, 1)
+            u = Function(VectorFunctionSpace(mesh, "Lagrange", 1))
+            c = Constant((1.0, 2.0, 3.0))
+            u.interpolate(c)
+            File(mesh.mpi_comm(), "output/u_3Dv.xdmf") << u
+            XDMFFile(mesh.mpi_comm(), "output/u.xdmf") << u
+
+        def test_save_3d_vector_series(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            u = Function(VectorFunctionSpace(mesh, "Lagrange", 2))
+            file = File(mesh.mpi_comm(), "output/u_3D.xdmf")
+
+            u.vector()[:] = 1.0
+            file << (u, 0.1)
+
+            u.vector()[:] = 2.0
+            file << (u, 0.2)
+
+            u.vector()[:] = 3.0
+            file << (u, 0.3)
+            del file
+
+            file = XDMFFile(mesh.mpi_comm(), "output/u_3D.xdmf")
+
+            u.vector()[:] = 1.0
+            file << (u, 0.1)
+
+            u.vector()[:] = 2.0
+            file << (u, 0.2)
+
+            u.vector()[:] = 3.0
+            file << (u, 0.3)
+
+        def test_save_2d_tensor(self):
+            mesh = UnitSquareMesh(16, 16)
+            u = Function(TensorFunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File(mesh.mpi_comm(), "output/tensor.xdmf") << u
+            XDMFFile(mesh.mpi_comm(), "output/tensor.xdmf") << u
+
+        def test_save_3d_tensor(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            u = Function(TensorFunctionSpace(mesh, "Lagrange", 2))
+            u.vector()[:] = 1.0
+            File(mesh.mpi_comm(), "output/u.xdmf") << u
+            XDMFFile(mesh.mpi_comm(), "output/u.xdmf") << u
+
+    class XDMF_MeshFunction_Output(unittest.TestCase):
+        """Test output of Meshes to XDMF files"""
+
+        def test_save_1d_mesh(self):
+            mesh = UnitIntervalMesh(32)
+            mf = CellFunction("size_t", mesh)
+            for cell in cells(mesh):
+                mf[cell] = cell.index()
+            File(mesh.mpi_comm(), "output/mf_1D.xdmf") << mf
+            XDMFFile(mesh.mpi_comm(), "output/mf_1D.xdmf") << mf
+
+        def test_save_2D_cell_function(self):
+            mesh = UnitSquareMesh(32, 32)
+            mf = CellFunction("size_t", mesh)
+            for cell in cells(mesh):
+                mf[cell] = cell.index()
+            File(mesh.mpi_comm(), "output/mf_2D.xdmf") << mf
+            XDMFFile(mesh.mpi_comm(), "output/mf_2D.xdmf") << mf
+
+        def test_save_3D_cell_function(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            mf = CellFunction("size_t", mesh)
+            for cell in cells(mesh):
+                mf[cell] = cell.index()
+            File(mesh.mpi_comm(), "output/mf_3D.xdmf") << mf
+            XDMFFile(mesh.mpi_comm(), "output/mf_3D.xdmf") << mf
+
+        def test_save_2D_facet_function(self):
+            mesh = UnitSquareMesh(32, 32)
+            mf = FacetFunction("size_t", mesh)
+            for facet in facets(mesh):
+                mf[facet] = facet.index()
+            File(mesh.mpi_comm(), "output/mf_facet_2D.xdmf") << mf
+            XDMFFile(mesh.mpi_comm(), "output/mf_facet_2D.xdmf") << mf
+
+        def test_save_3D_facet_function(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            mf = FacetFunction("size_t", mesh)
+            for facet in facets(mesh):
+                mf[facet] = facet.index()
+            File(mesh.mpi_comm(), "output/mf_facet_3D.xdmf") << mf
+            XDMFFile(mesh.mpi_comm(), "output/mf_facet_3D.xdmf") << mf
+
+        def test_save_3D_edge_function(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            mf = EdgeFunction("size_t", mesh)
+            for edge in edges(mesh):
+                mf[edge] = edge.index()
+            File(mesh.mpi_comm(), "output/mf_edge_3D.xdmf") << mf
+            XDMFFile(mesh.mpi_comm(), "output/mf_edge_3D.xdmf") << mf
+
+        def test_save_2D_vertex_function(self):
+            mesh = UnitSquareMesh(32, 32)
+            mf = VertexFunction("size_t", mesh)
+            for vertex in vertices(mesh):
+                mf[vertex] = vertex.index()
+            File(mesh.mpi_comm(), "output/mf_vertex_2D.xdmf") << mf
+            XDMFFile(mesh.mpi_comm(), "output/mf_vertex_2D.xdmf") << mf
+
+        def test_save_3D_vertex_function(self):
+            mesh = UnitCubeMesh(8, 8, 8)
+            mf = VertexFunction("size_t", mesh)
+            for vertex in vertices(mesh):
+                mf[vertex] = vertex.index()
+            File(mesh.mpi_comm(), "output/mf_vertex_3D.xdmf") << mf
+            XDMFFile(mesh.mpi_comm(), "output/mf_vertex_3D.xdmf") << mf
+
+    class XDMF_Point_Output(unittest.TestCase):
+        """Test output of points to XDMF files"""
+
+        def test_save_points_2D(self):
+            import numpy
+            mesh = UnitSquareMesh(16, 16)
+            points, values = [], []
+            for v in vertices(mesh):
+                points.append(v.point())
+                values.append(v.point().norm())
+            vals = numpy.array(values)
+
+            file = XDMFFile(mesh.mpi_comm(), "output/points_2D.xdmf")
+            file.write(points)
+
+            file = XDMFFile(mesh.mpi_comm(), "output/point_values_2D.xdmf")
+            file.write(points, vals)
+
+        def test_save_points_3D(self):
+            import numpy
+            mesh = UnitCubeMesh(4, 4, 4)
+            points, values = [], []
+            for v in vertices(mesh):
+                points.append(v.point())
+                values.append(v.point().norm())
+            vals = numpy.array(values)
+
+            file = XDMFFile(mesh.mpi_comm(), "output/points_3D.xdmf")
+            file.write(points)
+
+            file = XDMFFile(mesh.mpi_comm(), "output/point_values_3D.xdmf")
+            file.write(points, vals)
+
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/XMLLocalMeshData.py b/test/unit/io/python/XMLLocalMeshData.py
new file mode 100644
index 0000000..1b98ff5
--- /dev/null
+++ b/test/unit/io/python/XMLLocalMeshData.py
@@ -0,0 +1,36 @@
+"""Unit tests for the io library"""
+
+# Copyright (C) 2007 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-01-02
+# Last changed: 2009-01-02
+
+import unittest
+from dolfin import *
+
+# FIXME: Not a proper unit test. When LocalMeshData has a public interface
+# FIXME: we can expand on these
+class LocalMeshDataXML_IO(unittest.TestCase):
+
+    def testRead(self):
+        file = File("../snake.xml.gz")
+        localdata = cpp.LocalMeshData(mpi_comm_world())
+        file >> localdata
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/XMLMesh.py b/test/unit/io/python/XMLMesh.py
new file mode 100644
index 0000000..2a5dff9
--- /dev/null
+++ b/test/unit/io/python/XMLMesh.py
@@ -0,0 +1,123 @@
+"Unit tests for XML input/output of Mesh (class XMLMesh)"
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2011-06-17
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class XMLMesh(unittest.TestCase):
+
+    def test_save_plain_mesh2D(self):
+        mesh = UnitSquareMesh(8, 8)
+        f = File("unit_square.xml")
+        f << mesh
+
+    def test_save_plain_mesh3D(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        f = File("unit_cube.xml")
+        f << mesh
+
+    def test_mesh_domains_io(self):
+        "Test input/output for mesh domains"
+
+        # Define subdomains for the 6 faces of the unit cube
+        class F0(SubDomain):
+            def inside(self, x, inside):
+                return near(x[0], 0.0)
+        class F1(SubDomain):
+            def inside(self, x, inside):
+                return near(x[0], 1.0)
+        class F2(SubDomain):
+            def inside(self, x, inside):
+                return near(x[1], 0.0)
+        class F3(SubDomain):
+            def inside(self, x, inside):
+                return near(x[1], 1.0)
+        class F4(SubDomain):
+            def inside(self, x, inside):
+                return near(x[2], 0.0)
+        class F5(SubDomain):
+            def inside(self, x, inside):
+                return near(x[2], 1.0)
+
+        # Define subdomains for left and right of x = 0.5
+        class S0(SubDomain):
+            def inside(self, x, inside):
+                return x[0] < 0.5 + DOLFIN_EPS
+
+        class S1(SubDomain):
+            def inside(self, x, inside):
+                return x[0] > 0.5 - DOLFIN_EPS
+
+        # Create a mesh
+        output_mesh = UnitCubeMesh(3, 3, 3)
+
+        # Apply facet markers
+        f0 = F0()
+        f0.mark_facets(output_mesh, 0)
+        f1 = F1()
+        f1.mark_facets(output_mesh, 1)
+        f2 = F2()
+        f2.mark_facets(output_mesh, 2)
+        f3 = F3()
+        f3.mark_facets(output_mesh, 3)
+        f4 = F4()
+        f4.mark_facets(output_mesh, 4)
+        f5 = F5()
+        f5.mark_facets(output_mesh, 5)
+
+        # Apply cell markers
+        s0 = S0()
+        s0.mark_cells(output_mesh, 0)
+        s1 = S1()
+        s1.mark_cells(output_mesh, 1)
+
+        # Write to file
+        output_file = File("XMLMesh_test_mesh_domains_io.xml")
+        output_file << output_mesh
+
+        # Read from file
+        input_file = File("XMLMesh_test_mesh_domains_io.xml")
+        input_mesh = Mesh()
+        input_file >> input_mesh
+
+        # Get some data and check that it matches
+        self.assertEqual(len(input_mesh.domains().markers(0)),
+                         len(output_mesh.domains().markers(0)));
+        self.assertEqual(len(input_mesh.domains().markers(1)),
+                         len(output_mesh.domains().markers(1)));
+        self.assertEqual(len(input_mesh.domains().markers(2)),
+                         len(output_mesh.domains().markers(2)));
+        self.assertEqual(len(input_mesh.domains().markers(3)),
+                         len(output_mesh.domains().markers(3)));
+
+class LocalMeshDataXML_IO(unittest.TestCase):
+
+    def testRead(self):
+        file = File("../snake.xml.gz")
+        localdata = cpp.LocalMeshData(mpi_comm_world())
+        file >> localdata
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/XMLMeshFunction.py b/test/unit/io/python/XMLMeshFunction.py
new file mode 100644
index 0000000..242e286
--- /dev/null
+++ b/test/unit/io/python/XMLMeshFunction.py
@@ -0,0 +1,124 @@
+"Unit tests for XML input/output of MeshFunction (class XMLMeshFunction)"
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2011-09-13
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class XMLMeshFunction(unittest.TestCase):
+
+    def test_io_size_t(self):
+        "Test input/output for size_t"
+
+        # Write some data
+        mesh = UnitSquareMesh(5, 5)
+        f = MeshFunction("size_t", mesh, 1)
+        f.set_all(0)
+        f[2] = 3
+        f[5] = 7
+
+        # Write
+        output_file = File("XMLMeshFunction_test_io_size_t.xml")
+        output_file << f
+
+        # Read from file
+        g = MeshFunction("size_t", mesh, 1)
+        input_file = File("XMLMeshFunction_test_io_size_t.xml")
+        input_file >> g
+
+        # Check values
+        for i in xrange(f.size()):
+            self.assertEqual(f[i], g[i])
+
+    def test_io_int(self):
+        "Test input/output for int"
+
+        # Write some data
+        mesh = UnitSquareMesh(5, 5)
+        f = MeshFunction("int", mesh, 1)
+        f.set_all(0)
+        f[2] = -3
+        f[5] = 7
+
+        # Write
+        output_file = File("XMLMeshFunction_test_io_int.xml")
+        output_file << f
+
+        # Read from file
+        g = MeshFunction("int", mesh, 1)
+        input_file = File("XMLMeshFunction_test_io_int.xml")
+        input_file >> g
+
+        # Check values
+        for i in xrange(f.size()):
+            self.assertEqual(f[i], g[i])
+
+    def test_io_double(self):
+        "Test input/output for double"
+
+        # Write some data
+        mesh = UnitSquareMesh(5, 5)
+        f = MeshFunction("double", mesh, 1)
+        f.set_all(0.0)
+        f[2] = 3.14
+        f[5] = 10000000.0
+
+        # Write
+        output_file = File("XMLMeshFunction_test_io_double.xml")
+        output_file << f
+
+        # Read from file
+        g = MeshFunction("double", mesh, 1)
+        input_file = File("XMLMeshFunction_test_io_double.xml")
+        input_file >> g
+
+        # Check values
+        for i in xrange(f.size()):
+            self.assertEqual(f[i], g[i])
+
+    def test_io_bool(self):
+        "Test input/output for bool"
+
+        # Write some data
+        mesh = UnitSquareMesh(5, 5)
+        f = MeshFunction("bool", mesh, 1)
+        f.set_all(False)
+        f[2] = True
+        f[5] = False
+
+        # Write
+        output_file = File("XMLMeshFunction_test_io_bool.xml")
+        output_file << f
+
+        # Read from file
+        g = MeshFunction("bool", mesh, 1)
+        input_file = File("XMLMeshFunction_test_io_bool.xml")
+        input_file >> g
+
+        # Check values
+        for i in xrange(f.size()):
+            self.assertEqual(f[i], g[i])
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/XMLMeshValueCollection.py b/test/unit/io/python/XMLMeshValueCollection.py
new file mode 100644
index 0000000..7e5caab
--- /dev/null
+++ b/test/unit/io/python/XMLMeshValueCollection.py
@@ -0,0 +1,75 @@
+"Unit tests for XML input/output of MeshValueCollection"
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-09-01
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+class XMLMeshValueCollection(unittest.TestCase):
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_insertion_extraction_io(self):
+        "Test input/output via << and >>."
+
+        # Create mesh
+        mesh = UnitCubeMesh(5, 5, 5)
+
+        # Create mesh value collection and add some data
+        mesh = UnitCubeMesh(5, 5, 5)
+        output_values = MeshValueCollection("size_t", mesh, 2)
+        output_values.set_value(1,  1, 1);
+        output_values.set_value(2,  1, 3);
+        output_values.set_value(5,  1, 8);
+        output_values.set_value(13, 1, 21);
+        output_values.set_value(7,  2, 13);
+        output_values.set_value(4,  2, 2);
+
+        name = "test_mesh_value_collection"
+        output_values.rename(name, "a MeshValueCollection")
+
+        # Write to file
+        output_file = File("xml_mesh_value_collection_test_io.xml")
+        output_file << output_values
+
+        # Read from file
+        input_file = File("xml_mesh_value_collection_test_io.xml")
+        input_values = MeshValueCollection("size_t", mesh)
+        input_file >> input_values
+
+        # Get some data and check that it matches
+        self.assertEqual(input_values.size(), output_values.size())
+        self.assertEqual(input_values.dim(), output_values.dim())
+        self.assertEqual(input_values.name(), name)
+
+    def test_constructor_input(self):
+        "Test input via constructor."
+
+        # Create mesh
+        mesh = UnitCubeMesh(5, 5, 5)
+
+        # Read from file
+        input_values = MeshValueCollection("size_t", mesh, "xml_value_collection_ref.xml")
+
+        # Check that size is correct
+        self.assertEqual(MPI.sum(mesh.mpi_comm(), input_values.size()), 6)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/XMLVector.py b/test/unit/io/python/XMLVector.py
new file mode 100644
index 0000000..600af5d
--- /dev/null
+++ b/test/unit/io/python/XMLVector.py
@@ -0,0 +1,109 @@
+"""Unit tests for the XML io library for vectors"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-06-17
+# Last changed:
+
+import unittest
+from dolfin import *
+
+class XML_vector_io(unittest.TestCase):
+    """Test output of Meshes to XML files"""
+
+    def test_save_vector(self):
+        if has_linear_algebra_backend("PETSc"):
+            # Create vector and write file
+            x = PETScVector(mpi_comm_world(), 197)
+            x[:] = 1.0
+            f = File("x.xml")
+            f << x
+
+        if has_linear_algebra_backend("Epetra"):
+            # Create vector and write file
+            x = EpetraVector(mpi_comm_world(), 197)
+            x[:] = 1.0
+            f = File("x.xml")
+            f << x
+
+    def test_save_gzipped_vector(self):
+        if has_linear_algebra_backend("PETSc"):
+            # Create vector and write file
+            x = PETScVector(mpi_comm_world(), 197)
+            x[:] = 1.0
+            f = File("x.xml.gz")
+            f << x
+
+
+    def test_read_vector(self):
+        if has_linear_algebra_backend("PETSc"):
+            # Create vector and write file
+            x = PETScVector(mpi_comm_world(), 197)
+            x[:] = 1.0
+            f = File("x.xml")
+            f << x
+
+            # Read vector from previous write
+            y = PETScVector()
+            f >> y
+            self.assertEqual(x.size(), y.size())
+            self.assertAlmostEqual(x.norm("l2"), y.norm("l2"))
+
+
+        if has_linear_algebra_backend("Epetra"):
+            # Create vector and write file
+            x = EpetraVector(mpi_comm_world(), 197)
+            x[:] = 1.0
+            f = File("x.xml")
+            f << x
+
+            # Read vector from write
+            y = EpetraVector()
+            f >> y
+            self.assertEqual(x.size(), y.size())
+            self.assertAlmostEqual(x.norm("l2"), y.norm("l2"))
+
+    def test_read_gzipped_vector(self):
+        if has_linear_algebra_backend("PETSc"):
+            # Create vector and write file
+            x = PETScVector(mpi_comm_world(), 197)
+            x[:] = 1.0
+            f = File("x.xml")
+            f << x
+
+            # Read vector from previous write
+            y = PETScVector()
+            f >> y
+            self.assertEqual(x.size(), y.size())
+            self.assertAlmostEqual(x.norm("l2"), y.norm("l2"))
+
+    def test_save_read_vector(self):
+        size = 512
+        x = Vector(mpi_comm_world(), size)
+        x[:] = 1.0
+
+        out_file = File("test_vector_xml.xml")
+        out_file << x
+
+        y = Vector()
+        out_file >> y
+        self.assertEqual(x.size(), y.size())
+        self.assertAlmostEqual((x - y).norm("l2"), 0.0)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/vtk.py b/test/unit/io/python/vtk.py
new file mode 100644
index 0000000..c1a23b7
--- /dev/null
+++ b/test/unit/io/python/vtk.py
@@ -0,0 +1,203 @@
+"""Unit tests for the VTK io library"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-05-18
+# Last changed:
+
+import unittest
+from dolfin import *
+
+# VTK file options
+file_options = ["ascii", "base64", "compressed"]
+mesh_functions = [CellFunction, FacetFunction, FaceFunction, EdgeFunction, VertexFunction]
+mesh_function_types = ["size_t", "int", "double", "bool"]
+type_conv = dict(size_t=int, int=int, double=float, bool=bool)
+
+class VTK_MeshFunction_Output(unittest.TestCase):
+    """Test output of MeshFunctions to VTK files"""
+    def test_save_1d_meshfunctions(self):
+        mesh = UnitIntervalMesh(32)
+        for F in mesh_functions:
+            if F in [FaceFunction, EdgeFunction]: continue
+            for t in mesh_function_types:
+                mf = F(t, mesh, type_conv[t](1))
+                File("mf.pvd") << mf
+                f = File("mf.pvd")
+                f << (mf, 0.)
+                f << (mf, 1.)
+                for file_option in file_options:
+                    File("mf.pvd", file_option) << mf
+
+    def test_save_2d_meshfunctions(self):
+        mesh = UnitSquareMesh(32, 32)
+        for F in mesh_functions:
+            for t in mesh_function_types:
+                mf = F(t, mesh, type_conv[t](1))
+                File("mf.pvd") << mf
+                f = File("mf.pvd")
+                f << (mf, 0.)
+                f << (mf, 1.)
+                for file_option in file_options:
+                    File("mf.pvd", file_option) << mf
+
+    def test_save_3d_meshfunctions(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        for F in mesh_functions:
+            for t in mesh_function_types:
+                mf = F(t, mesh, type_conv[t](1))
+                File("mf.pvd") << mf
+                f = File("mf.pvd")
+                f << (mf, 0.)
+                f << (mf, 1.)
+                for file_option in file_options:
+                    File("mf.pvd", file_option) << mf
+
+class VTK_Mesh_Output(unittest.TestCase):
+    """Test output of Meshes to VTK files"""
+
+    def test_save_1d_mesh(self):
+        mesh = UnitIntervalMesh(32)
+        File("mesh.pvd") << mesh
+        f = File("mesh.pvd")
+        f << (mesh, 0.)
+        f << (mesh, 1.)
+        for file_option in file_options:
+            File("mesh.pvd", file_option) << mesh
+
+    def test_save_2d_mesh(self):
+        mesh = UnitSquareMesh(32, 32)
+        File("mesh.pvd") << mesh
+        f = File("mesh.pvd")
+        f << (mesh, 0.)
+        f << (mesh, 1.)
+        for file_option in file_options:
+            File("mesh.pvd", file_option) << mesh
+
+    def test_save_3d_mesh(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        File("mesh.pvd") << mesh
+        f = File("mesh.pvd")
+        f << (mesh, 0.)
+        f << (mesh, 1.)
+        for file_option in file_options:
+            File("mesh.pvd", file_option) << mesh
+
+
+class VTK_Point_Function_Output(unittest.TestCase):
+    """Test output of point-based Functions to VTK files"""
+
+    def test_save_1d_scalar(self):
+        mesh = UnitIntervalMesh(32)
+        u = Function(FunctionSpace(mesh, "Lagrange", 2))
+        u.vector()[:] = 1.0
+        File("u.pvd") << u
+        f = File("u.pvd")
+        f << (u, 0.)
+        f << (u, 1.)
+        for file_option in file_options:
+            File("u.pvd", file_option) << u
+
+    def test_save_2d_scalar(self):
+        mesh = UnitSquareMesh(16, 16)
+        u = Function(FunctionSpace(mesh, "Lagrange", 2))
+        u.vector()[:] = 1.0
+        File("u.pvd") << u
+        f = File("u.pvd")
+        f << (u, 0.)
+        f << (u, 1.)
+        for file_option in file_options:
+            File("u.pvd", file_option) << u
+
+    def test_save_3d_scalar(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        u = Function(FunctionSpace(mesh, "Lagrange", 2))
+        u.vector()[:] = 1.0
+        File("u.pvd") << u
+        f = File("u.pvd")
+        f << (u, 0.)
+        f << (u, 1.)
+        for file_option in file_options:
+            File("u.pvd", file_option) << u
+
+    # FFC fails for vector spaces in 1D
+    #@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    #def test_save_1d_vector(self):
+    #    mesh = UnitIntervalMesh(32)
+    #    u = Function(VectorFunctionSpace(mesh, "Lagrange", 2))
+    #    u.vector()[:] = 1.0
+    #    File("u.pvd") << u
+    #    for file_option in file_options:
+    #        File("u.pvd", file_option) << u
+
+    def test_save_2d_vector(self):
+        mesh = UnitSquareMesh(16, 16)
+        u = Function(VectorFunctionSpace(mesh, "Lagrange", 2))
+        u.vector()[:] = 1.0
+        File("u.pvd") << u
+        f = File("u.pvd")
+        f << (u, 0.)
+        f << (u, 1.)
+        for file_option in file_options:
+            File("u.pvd", file_option) << u
+
+    def test_save_3d_vector(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        u = Function(VectorFunctionSpace(mesh, "Lagrange", 2))
+        u.vector()[:] = 1.0
+        File("u.pvd") << u
+        f = File("u.pvd")
+        f << (u, 0.)
+        f << (u, 1.)
+        for file_option in file_options:
+            File("u.pvd", file_option) << u
+
+    # FFC fails for tensor spaces in 1D
+    #@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    #def test_save_1d_tensor(self):
+    #    mesh = UnitIntervalMesh(32)
+    #    u = Function(TensorFunctionSpace(mesh, "Lagrange", 2))
+    #    u.vector()[:] = 1.0
+    #    File("u.pvd") << u
+    #    for file_option in file_options:
+    #        File("u.pvd", file_option) << u
+
+    def test_save_2d_tensor(self):
+        mesh = UnitSquareMesh(16, 16)
+        u = Function(TensorFunctionSpace(mesh, "Lagrange", 2))
+        u.vector()[:] = 1.0
+        File("u.pvd") << u
+        f = File("u.pvd")
+        f << (u, 0.)
+        f << (u, 1.)
+        for file_option in file_options:
+            File("u.pvd", file_option) << u
+
+    def test_save_3d_tensor(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        u = Function(TensorFunctionSpace(mesh, "Lagrange", 2))
+        u.vector()[:] = 1.0
+        File("u.pvd") << u
+        f = File("u.pvd")
+        f << (u, 0.)
+        f << (u, 1.)
+        for file_option in file_options:
+            File("u.pvd", file_option) << u
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/io/python/xml_value_collection_ref.xml b/test/unit/io/python/xml_value_collection_ref.xml
new file mode 100644
index 0000000..68c9de9
--- /dev/null
+++ b/test/unit/io/python/xml_value_collection_ref.xml
@@ -0,0 +1,11 @@
+<?xml version="1.0"?>
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <mesh_value_collection type="uint" dim="2" size="6">
+    <value cell_index="1" local_entity="1" value="1" />
+    <value cell_index="2" local_entity="1" value="3" />
+    <value cell_index="4" local_entity="2" value="2" />
+    <value cell_index="5" local_entity="1" value="8" />
+    <value cell_index="7" local_entity="2" value="13" />
+    <value cell_index="13" local_entity="1" value="21" />
+  </mesh_value_collection>
+</dolfin>
diff --git a/test/unit/io/snake.xml.gz b/test/unit/io/snake.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..ea05b94e9f396e35d050182b6b6cfee1f4366885
GIT binary patch
literal 95055
zcmV)MK)AmjiwFQB^h!|x1B8^@YQjJeK;Qj}W#2V>%U;CjTfd<FfD%``5EC(>YQMgr
znJIK(wl9L@a13*1+#Md5j(x`4n1;ULaw9m4eLEaee{T5O>&x2n!+y2e9f$6edN$Mj
zxLv+9{9~G~+p4<X@0(NXQ#)>k+qqhvR(!u=Y<G#{2Ww;3P0wp=_;gF}{ke;r9n+=Z
z>Ia&!`3<Jj#*vNbYsR!z5+1?B_+Y6&#z({FH=IAEtvP!(d|lVPB1pNAP5|jhQUM80
zD@jrV>4CH)X%^DMuRGdV11W)|ofb&7ke+tBjHI3ZFBxcO$Vl2LA(DrIN<mvCWC{XV
zL$eSnC}ac8LaG2`m9pT)SOM9B7jrpaRl$qFG_v##N=#;e)rw|)HeX%vVm1q`p}k6E
zb1;RQ!EX4zHQiWYH}uw;W|wYC{CepNR|Z%(M`;DkF5Q&GJ+lR`1r~S56}&EI3tkT_
z?yoO+L(bA(Er7+D1=_16u(&&+;8nol{sy|6*4cc$r`f!lFL<Gwz<YBAug%$l*JZ3N
zc%hrXnc0FDx(VEen)VvFw_yL@btAL?v%(D-mEAmbo8OF=S&qXn3`4IJFIsZ{iwz1(
zDxv|I{u{4Oo<gyov#aHf;5^&ApT#-3rJYs6)qa+6t!1APuD7f<!oAxba?F+VmfwYA
zu8fwcjx$xdH^*5mtL+ve-2JQ=!w6TN#bqerhBwP+Q^K{zC4Ef1-B$>=)e^R|^lI;n
z>_Q!lOLnZzc3-l)wN=P5aXx5xv+56c&NRH~FWm5^#l^X!;Z4%<#95-@P4e3u<eh~#
z$$1#~4i?_FymvVZZ@aiSCoR0K;$m+W-d1r*`wnkY-g~Nrw^{uc_i77oBlF=R_YH5^
zOKv<47TPX-ZT1${a=YDFupeo;+sN<xQC6Fc{9Ev2%yY;uJT!iU)t(r*6Z!E~u|P)A
zkFH9ENvPV65~@9qE<!!BzEMM{_mjH+QU4e*quh*P5C&f<khBT+zu5FII31PtZSTmU
zaWTfvZP#9<zoW)x>+t}9nr!{U-o$3>Y+rElvDrGy7mP)0wqpJ5E8?zyHhIU$**bm@
zc5mcxJ-!$&?3}LS&B23MYcJsdWAXh}MUmjn|ENlpx}Y}tOGAU&7*(9TH7LHS>U--@
zeAjj2jpB(}_moqP(2~Gg$VN{WHJ)<VKBkyt9%Kl!l#|SZyr9^t*>aF6Q&J+Obcf_Y
zQAr$R>Ny#VgG@c^coQ-OAU5ko<{jv^RZmmzK(|G`rF{T{uETq&7=HdtOg_)Mi^0`e
zMkcO-^$R{wnTe-Ib4V~vp-ER8HzDWst?Bkj$jM-zDkkJ)u&d`q$jRU^6%%qYIC4Qa
zX`P~zA-XBnRCXdo>Xd6LJQ=r&2{{=Y`E;E`M)Ap0Ovu-(_@{sWV$57}C<s9ycqN&}
z`P~0vZ!t89^OA~t(m@b}^3S+3n755d`T8h}l<%)GDL<dkB`D|kBqc#PV@<avDLaFQ
zjY-)VtR^F>!OXQ%L^YVMLHkTKn65#)K{Z$`rJIbX1`DPfo;O4_nC_y^AP~uzV@0R}
z%oxQ}j?v2CMgf(Eae4^sYo&1s+f^8;cxg%cwrHl(%H;F8!h{^~Xqu{AtxN~3N#=?j
zV^1<xhW#lFR?gTlu1RL@_-wQ?cYHQm$ySEv*l;CV873Li6}2*4QR5Z0GDV{@c<kI~
z0~U`Edf<whuy{BT5cx1-G3pns9%d}#u`wLbkY#lHqEE2O;OO=RaW2f_dKGMUQJBT$
zD){}0!Yp?;X9)7OZtj{C<2QRIf0`8HH+d$1_)ZmRG5J%155-!F{QVd;mm~&45QtuB
zMEu?VVo8-WDP6qGp6W6-6Y#+|7R(6P(&mf88nmU=H?i9{SM~rwD8XB@ZJ>F70GDiD
zI_YlT+VdhG0=YDKJV<x@rk7=fX<!NHlJ^VKiLx%=U@}kwyJS94p$_hnc{b?`e&#Rz
z`2=|pQmcdz0=>-Cr8^r3{Ha760==x%h3`V><*ENW1rvJF{L<kaU_vkYXQk3%LN8_h
zuV5zhVp(<R7-G_{;10p<EJ|*q9Oce*W+UZsvL&yiJnvvqURTwHM}rBy{DMJQ=p~Oq
zs}4dhdW(A_<$7IRCuP4(>7*<Nm34!Z`-u{Lkn%W(5Kc=B+Eh_%@6cA5R#l!<hUC|-
z%9G0Q!3KKC&K_PP7UU%xdyK6I;Pyp3Fn)l0*4^%9SC7AKo0m;JUfT99d-@NfW{|@$
z3<AL~wS-{j{~zli%SuSq$aiZ+Yz$_y;JXMhmx|7b4Qti)I_DSpduG>5@Lhy}%e{In
z>Bd}plkPQRKtIxZZjFC4N%uXs>KdD*`<`3%p26Rl5NcVi3ji}jTKb=SUKH;${^g*q
zILmgt;3E@eX`dceS5cPskzsKaWNDs^wN;G8x>Q<)SQ=_$Wffs*TAoFFrs?2wkn7?r
z>psZ!oYMj3y6B2^$p<UA;@pABC&X5qI~1?b%JzMOJrh}Rp23t90xQ-{(yj3#P58wb
z!Ya$U6vLipfoq@fGEeeXimBAey{I`I;Jpx0@mjhU0xFJy?uB@Yzl|Oo!YS@q<e3yr
zaWAAkB$(nJyD5e}dpAr}A(Y}b0rkx_eGjN>km8Mi1U5*igI#No^7WJMUwip6ZU#vV
zgD?#IQjsCa|6kTaWp~VB!(F4vG=`LwNU{G}X4iC5H#Q3^qlSW<x5mn(Hg8o{>Jv`R
z&vsIx^_;bpa;A^%^Vyy`sL?yNUn9s_+e;BSM=u%R8O%uKKS<DEmzhdUD73U>rc#qX
z=!x&XqM)Uvt;RATCzqK@?ErMlHB-3{K(vyn9B^nQQyK3BUuG)nfECM3WgVbmnW<DN
z2JAy-Ds#N^7n!NVK~^I(l?;!GEy+wp&wIKQMk<v=0VIx32I;94Xfpvy&PTqnX~{S9
zpX8F{ySncp->YjU`R3Jw)RM2$yTn^TzJ6~N)q<}<N^+Ed8!lmvQgbF~(Ho=G{EBWg
zL|+%sjET|LTMT;M)z&d<ueLw1wx7aT`?URxwSAvN?GK-P88?>{3PK<TUTLtLkN3aW
zgNF&&i|Ag0sM9)~itBG&v)MiQo`bz8-4g;!#O$8fzX?eyTDjojL7VLpzmy=&_*q+2
zkfu?ZUy#;KPn2=+fzB3+`?JYGfop9t5`KI@?aO{pe-QgO_9hj`Z|!?P0_3-zl+4*k
z`P=OK!Ox1QbEnmqJNWdyV+UgYj^;df@I6@#MStG0H?~mr=d*ICoDTn-oDHRa#({5#
z;y*T2(s>rOa<zjSN7RZv;&kQo!v4il(7!r3DUUKZRZvkYo^uEfU}{CHaV6yvm*h&y
zg<5GNDfcx%+fty<)QaH7l<2!l)V0M(-@9gDTCfl>wIb#8G&Hp$<&X};)CzmJ5mPHt
zPI*C7D^d<W)R<baa@cNDD^?CmXKF>twS4^;IfERCK^O*pX&ci8{{OMPB$3Qv*n4DE
zw25G_YsKYSDP@}c?OJJNTDs+TQ9%>wbgcwUq|>!RW?eOGX=PZthApK`<11lH&BdS{
z#Psw+!2PGD<ISK!Hyv*VZKkH<%?Nr1$D2VTaXQ`%001h}O6$VQNXXKy2ZwK!X+`(Y
zfD*A(<2`WauQIK?_e_M!v=aAts1mSf-6J1Lz|v8RNxFVer<kk~uyo!7t~8W@CFVVS
zqXaDRy~l;M%WQj(A#2M3z(eyS0ZSc{pFz5>*NSxgp#D(L@9DKcy6dPV-R-pi{YC+n
zKYoWX4!}b3#ql}b+lO>z-@_)^VeDv=>T3vMk!m(uKI|gZ?6us3QF1)lO0_#+`H^U)
zPz8{ykz}Pv1#CA)f|UXll(c`0WBv#^w_FKA5Qy%Gh@j~HH+H!lz!@h~^Vtce@!9cE
zUC8Q21FIyaKt2XRRgzLb8-sUg19CA4rjm>TnHcbep22JdQ8~375W3$%IdJ>=kfVSh
zNb8g;<be4~>y#4EAlC=E3Kw8?B~K~s7>fN+gMrvv`;21k5>=zVtxK(qV)rEj2jiP0
zr2ssbW4VOupgg6?QF5c9buML9MC11tO#`G@RmnDi#TF#Rj7nHAV0``uYa~_oWu|VZ
z2WjrW)Q&;PrUkH~CR`atGb@i%$qYG=l)Z|2qhqo1Jbbq;$*a1jXVqvt58oT*mEB$%
z&0mcQzECUYp3w*$^jd{JYSXIDMhm%%C5xGjBsqZ(cyAqLmt0iHN}I!rPz6xaoMket
zY&0fyhUo?3_U!7PWA(}1fR}2p8h_E2BZK*0MQHTm&LPBB2cL=O3i=f6rYe7Pp)E18
zPDs}33*#G#fzVY0;`j)dlumdsF;Gowz#N~*sYgIMXm@0^lL9qQsL44LI&|lGmckz)
zSDRZw2m)_Je1fR=zgWix(5C71=O&NcC-UVuaMZR+)y6cIxmen$TlC|tgk@_<qZy(_
zoS=#h13*A1qcIgmqPIYNR+C+`$l$xeZe7ij6IDSG5=2`8{#cha3Ui-Z*svK35J**E
z#EGv$Wn?h{1<fYoWugls9hztHB}-NBdf4P13utKB-5RI=EPG<!k9a>%L@28=X?lyO
z0i$6;>nC^6smT;G=M6N-D2;$<mK2>Xs=d-ET!A2*7Vyz-;_l-*bR*<{n>nxK8XC>M
zi6m+Lo^Q*nYcbjXGpwz+J9w$z06ROANpd)rnn#=yUN%b_Gut#|dUlE7^d%qC-DUwb
zAx5}c3E_$Pe_&1<TfXX6Zgi}P2o=SrpK{~6W~V}*^yhv3*^ma<;WXeVTlmm(p)PE+
zmjy26Wi_fz7}3-Mol<*Z4Qgd(Itfy>R|IxMogmSw{pjG7UyDF;mc3T}*&+m<P7A#x
z2(4qCUVs-~!4$Vkaax1@`ebTI!VuQ5vZO`=`qs(cLUn?ZN;(KSn+x@Fq@mR-gYssv
zzn2{%aDzH09cv<3u<hjYoyyvZJ|@4|cVC2DTegEB5ZjSQp{c|EH+F+1(cX`A0SXMm
zypykwj2PL5UmsN{1(d@?V%F3_)6&x?PWm>_8+Kk;RPSLR(50TD{P?kw7{;7d^)o*s
z2-rofyEn&JKCJ^)%V<<zZWQ+s9};%=_%4lBD|$YP@R2w+>#@?2(m$w<c6=<N8cgvS
zK?6(eBVl#_ew^t2O%;;3BOn+UcVa=ecK*1Xy0c8zCTX>kQ-NS%=FkhcH<-A%U(u6t
z@fhVm@Gyp;W!750>pirZVVGFm9*EwurFItt7o(}En*yz6^*ltjIv!HvUZd2^a@-$z
zEdNk@I+G@8XxlxOOT`=Sv^{ZYQN5g4(5|-7A%|dPm!VhPH^qq%wv6e76%LinJY3Y9
z((-{A(*(x_Rrh9`tL_VPvoyYoRpq1K88={$id|`Q|7P=frQ!Um-Zy`00-_mPCb$9w
zLt`%avL7j)D+<k-;@iDsh5)gEgr<%plRX1vi#7}COqz|`TJ?t*Qb2}P9PBi;yXV7d
z7DR&O5oV3o2+w=e^y5KESGjN|u;bx?@JghvtD8c@yPFXr=8Ra?Lx!a|JtlZETo`Gc
zk2?JEaRpfxgCOiiJbwlK-v43~W+Zeo*>%ISwTelE;FQ{3ymgY>i<m1JBpqchv)lfv
zmm_UF^Sl<rQpxA4iC|h-Y^&GmP%lUB@EIPhHn_6It@gK>jP%Q1OH*D{am7Rsj_)fd
z68wpv50y9O)BL0@M`FW=^(W=gEjChh$Q_$cUvVU=7puV=FM4ZY$l{{9J4#GMKJ09d
zgglkOvG)<d=BoYs{C~(MS3BjG<SBNznufA8Jw~pcqM(|D!;sJDrdLzdgi%h=Bh1-Z
zhM-W6&_VkYBcaAGQho|iHDQ<q?=MPZss<|Z;IF9zc-ZO}1<h-1viBtN*c3~(YQ+F&
zSOS(os%$2zW(?VG^Zo@nR%W599eaSb*ry0;Dc5S%kRgbkTgjr1tC83=guT6cBzgK(
zO&L)6>ejubU$1J*z#tB@Ly`eeHWpQ5_B;(cQ!9R?VRu~-;y=wc9WdqAAB)xzM(6<G
zK4nbwZ(7~Htzpm=84nV|APySft#YI*GGa3=qJZ4@Dos}NpCdiAlNhkLtI4C(3~<^8
z9j1WIl^XvDC7UmnCOTJYOwcshEs>;OT)D)R8V}OsXdw)XNZ6kI@O4E=7K0${MjfeQ
z>-{gb@hyb*qd5S>v?_#v(W$qDJzfHO*J0ArU@|MC-5FD0jnpGfUEa~}2>nfk@!%d&
z7`B2#!?EGTE(-2(Qx{%5-TIx9Z==xo@uJ*-Qq-Rd$%A4(5HOWEx(Dev0Az+ejMRv|
zr(RQ0fhRnQ-iF_-C9FQb@7ADl(-Y}?-LSw)EhW-Fa&Zc)YR=Jvb9}W#cKBB&lkm3H
z;1E)@N=G>;x1kBA`wZAyMPW|N;Q(D6Lj!tOIV?x#fVT$w(O4}t7w5dB_@pVLsQ)&K
za^iZNZy=3Jb$mTI$6a=mCmeRAbnmIfjqp>l&WL&vHU#Im@#*UIj)x8k!8yM9+HtD=
z5R@Y#$IY7-)_1o{oQakC8HYdio%R!Ls2yx_hy&@OsmXm`>_(ZTWErw6!mN6fBCleh
zSjiNDT5Kp!GgYNffZdG)QvYG{+vp_4%jeTH1u|1(3LxlWJ%QidZ)H^V#NwC=j=8!K
zJgGT_h{z(OD^h1tc?uwd&A;wHX!C7!@h3F$+;G}NDK?XOJnf*+gYA@}9If~DuRYTt
z7RRXPemK#^26rL`&*UEM{<RS}(J@8%naMp`|0C>*k|l&e*o_>;F17c+*h_U2`myF6
zfKh8{NeHkk8;thmjEE(0+?TM*{+?=BwVh>>TN=2RYFq^@dg!0xz<0AmjzSWH%I`Ka
z4CbQDqmV=_!h!K|Lt&PE&?}?c!mZq>ypIC)6aUCfb0PJJU8)D+gIry7l6j1I%xS$R
zKkgpHQkBVai+_!qjD0uyZiX3TsFBFOMl4;qioFKrwd{3<N?70sL#>r<2$T{bHbqUA
z9nR<lUwN7aHg|KrM@ixbE3Aq!K%8NMjHEUZH={C#lNEIAQBtHh_GJ-9`q!gc5iy;}
z+iB$Zx+MRIAZS-jciU}#H#PbV;g(v$;*JP6UWw(PS1!9DeFi9N7~B?1s{os~PbwM#
zD~IauCXV0T>-8TC@lE%>8(o!b6K*@EXvl0<DjJUms<BY(e%JTGP*gNNppf$fHdlI-
zQZ%;8ImP8w56LFz@Fl4e15uHq`I61h&&P$>vww4=eUeSlaTj;ZqL{i>=T9s%ZI$H3
z&0&^X4brb$!NTfycRG-P?0rdAK2i%~#1vI4pN)C9yMv1yBv6NZb{e_KAW07LvnIy@
z6YRPAaFBnDU14^{APBq54&ZB5g5LjPlYS%g&$1oBCsjlmB8gVc&Hs}RBLT=@y;1u}
z4jAMHIEBXUE+Ih>e2h?%LbJ!mw=3l{W4NEwi^<|D2}<zs9<^$5Nyx0*C>&Gw!~^51
zKuk5epf%3=8C47=8084tprqSF!xrC!qA#qZDSn9DN(=60ATGVKb8#*;5%p!>D}Dy4
zbpUl{o+C}`T%GU49?#Y=hYaA!RQLfk44aYJbTuXE1W<#r^>Wu^>QL5YWVi~r-Qk7e
z#S~EfVEpNgnt4~|ZJM{J{dG>0Y666O9_wdoGX|XuV5m;h@X8w!?cL!*P!nZv2ykzb
z%`l;YU1E<>|KUtMib=}4$rYzGZn!(tHYN5L!7d98`;Q!woy!7*W$piJkPGfr6C;5&
zuvJsmRjq2jdPX&+AOZ^UMRfJ5#;VQ<NZO-YUCTN#&h};j<YXsU?`^uuXtK>&0JVIZ
zaDVW--v_a9dD-N8BS-{dP$AJp8;DaO-ko3>p_BTPJ&Dv%6Ctg;8Sr9bhXMeWlRmO+
zmJ2CB5i7l+zu<|Jc)Ciae^AJimi5tJk9MFklzn}D6Lv1i5yK!5y-~^%KhOOy7Fv}?
zv+C?-<B~_lSUhOpt7OmU0ec}qA(NGlnP1Nqj!gY0RzBvwU-djbTv#|OA5mn^jewdW
z6g^<&V@I>b1}La8lkp2HAKOMb^8x4YTI!mdlfXQtJlIcMQ=_Cwvb2IENjZL&K1PRo
zHtL&D&D4^Wj}D|v4B1B(mANd|K4Ooj40fy5y+sHKipWi9Yf9BOwg@3Jf2JQ};zk91
zDq=_|y(j@Z${;n?lo%38FdjJC^*uY(HpDGyrJfe)+ocwwF?8I=y3F2hS3^{4h7cnA
zdRg)7Y6vYkB#!s=Lr3;yYNgMBm*njQN&-ZZuZSZZ8lRju$x_XnC64Ts))Z6s>zAP}
z+7rJx<G%i#0^-)1&Qo7*s4d)0E%av(hM00bOH1W^i#XDs^J(SYy(ZvYt!brllsi;5
zDmqrAk^N-znKGC5LTVl`ais4np>!mqO|5i;%=lLWT?CN;aCtpysF@c<5{U#HK}g_h
zsT>1Iq(jSdQyN=!VJebH2avUSi%j+XD3VAp0LrY|NrWoRt09qj!W^1hn2>tckjTj^
zC$wF!TBqh8eJGkjf=tyQ*S>}@6G9=kbY-Ud^UK(^<wy*|up5oaq+ojgi*1a8>F$TM
z2SAiIq~J%QO{7zM=DNpG^4M4;|1F`42cO#&oI#wtu<5sT>Tn6Dph(<rlNN7u?&TE}
z3DPFg8xliu(Yh=AQ!6H+T@G?Q1-7p`Gxk?HBwClgZcXD4n|~WH7O~5{5I1NlxcYHD
z{ZJSr-E7yZv(U%U#3&4Mxs)yq>h`3H!XRl+jq`Y3&w#=pGr#xKBWYSY6bgbQbM&a8
z5a{_f!Ceq!#&#SmmaMV4ilHD#E~%aNNi<fP&r}d3Dce&TZ!S5m8MNz#<|_7|l4OWI
z&}>(A<e5=bJ}2_qx<PX*6fOZ9)CW5a4GM^44hpru%t6fv=1@T7`h%%dVaED2WyjEu
zN?OXnWyP~IDIz9RPZG3qn#|P|5gkWc4a=#aZ%~>$1OE|Zqi;x>jxD?#PSdSu{I2CY
z9y<jj6Yob%m4|@gmQw7*vluEpmfH`7LLR*UcaV9m0w8mWq5i@_^vPU{Pyi%hdx0kF
zyEHdbnX4~`<o$jFW;umGlER+)m@E63L^6)G@>X|5l4|Dak3t}GPz%-ArJ2TEateZs
zmWd=zYeh>aq9Dk~0KG-N!Q%xe2r_>7x{@S@K^XR<4okrB|Buy5vCO49_TUL*T;s@+
z@Uw&&>M^~jH%{TiW7K&0doTf0*+C%DJr_>-{7GA#lE#F1E}PaViSK6NL-o1z3|ru^
zW~>LLr75jvgSdar4*vLHe8_AV82XBsu!F-<RC9(c+aH_MsTe(hCuAKWgM#{4vhBt{
zX-u`F<6bqc6B%foP_NlRA74U3@A;r2F2J&bK6Ys9=<Dl2YD{Axx`u!xD@xH#Mo=LA
z=phOOv~H>V4hp0<3^TFY`Kj_rr**{WV_b~oqE4?1fTZ`v^1Kz3CtH&;xojO(DJJ*`
z|BRg~gQ~!f03WOGCtV)E{Z~QBlP|QXvfq!tK><F3B9^KSFOXtOfjw5BB>dXNY(uQ>
zV2^-C2hEl-Qk1Lf!6|Qj-24{xWfTlZG(5@qLR}Uy$A-gKmxKmz4h05lL4jNlmOZ&8
zWgKfkfdr6W^L7k5va?N^eCxajuDrOL2%@U0^$WmWB8S!iA76qCjjP+1Bbs&K$9FVH
zx0Hb%K*Y3k@yN3JDhNeTza&Uegg_5!>PZjL|Jkp8tBZ2C4*JN?2mz3<Kpl(Mfus__
z`9`hEg4?@&g<rzXEJ=b81fn<UuyD(||HTG6AoZtn4q#|mD)89Y=;EW+gv!e3CvH6)
z1!`?{NX*Ip(<_owexGY3a`cmo^FO0n*(=7JIM_z@CzNed6B#{j?G|54#1Ny9W2COx
zr97&<R#ft}--Tm7j7XIb8~)IMu*D|S<NZ4Neh*q@5;R`bh}?SB>UN3#Zda3nk1CRm
z=jaRjRDzGpCAH&ePx^z(wiiCe)KxVm-R{X}E@IIH<3*B3H(VRNMm;F8P=S!-aYQjJ
zcB={SE!0OOdAu@4hRHx3Bz9b(-}4VW(t1Zy$NBY^*~#X31++#|$AG8f)Zh1$VQLVo
zw5-h*2EHY2sZB`QgvjW<P7u@ys&1k2I9$<!!gfbeM?Z9XlWO%P1re%ysQ;D|>g9%#
z@+_d*i25C6+<y<_Pq;9U*fCsZFI%5<f9?djMq)=_-o$ey-N4j0&ALcF69uJfsaq{?
z5xO;|uSYoYt7h6ob8J%R{kuHErUR&4jH{-!DER2|w9}OLiA*UB2_FMcH8%6HA^8~w
zSySt$-HQu#VU?rk;|xRPIp=kX@GTU5ba8LE4#XoE5Q;vI2xho`Qxnxdk@RtV%V%6Q
zVbs%=@Nuj^!p;RZ!Vm<)H)^ae@ctJoV|kb~J3WBe)gKW*WWaLu`k_t0vd$1hwkyQ0
zZW=fC_&iAC7TZ#4_San5I-C--s=ghN1R;YQK3?LIJ{+5!ZH$$YUL%v7uvb!4tt-h>
zE3`8jdp@F$9+5iQ^+LMQDjIe4Xlu8Mj1D9`*)ps+V_Hgy+{#22J2-q?Pm!U`uCxE<
zhlSYIZq?80OEz2W=qL@IE{}b)u*(tTRo6=3((NwKEXX<JQ=AFOBm(hu7ly8j7`6lv
zs!)fJ6Uv+E?#$+xo~k;8gy)+1OJ*6H`ICT<Ht+MsLhNOyI)t=2NzG|o(Sgrnb^wi3
zh=p4nbViw$IGGB=E^32)qSX2vy}s+Fuv2&RJ+=V4&X<1%NpzZcje$<c0VFaya-I-n
zv743jG}M#+5$=fXBl)BB_l={IteXQ!yB3|+9^Xx^+X*BdvaC5Owi6b5N>*C-YT7j+
z=fnm{0<kh61i9ppZ~_S}+B2T=Yu5Zwqt^&>yXWzatVmTIK?*i(O^B&&s{=^nJ<jt{
z*$EN&5w9%EDKJ$F4aG<Jjx4FSL5t8j)f9f6ng@i%DTiGy9X{g4@*F>WT?wwmAPBtC
zORKod{V(>#;9&C8IRLS0Wf@@LxUHr36w(st<4$(xj4o%u5f35|$l)YBb{WcE)eQxw
z(|XgDiq114%0|rO00uLA{sW2Z`aDh8>rIq#`L}9H$qWe6SF*gPx?5wug$il3$iU{t
zQVockNGjk&0MvF^#PCcTc?N1Q$;27P@G}zsRL}6JFgD;vrw%T}>b7sI4sIMu3%d;E
zt5ivVk7N0c^oI8`YC|*-c<eHH5ZpRA4cP71ulw<=C4>+;Iy!T89vumtg#aI?7kU#q
z@pdN>kRrfGFD=P{)M-Pz`Z^<zu(7;gZE2c1hsG`S^v~AMEvzd7g~agUyLr8cp;jUa
zS$Z0=vD;R^g@{A8Cs%ql8`-xIPT_XLxY%@s4#L49m-jc*ty|VfXa>B=@b%VlVJ@bG
z3X8o*>Y(KTh<rH?5a}IGv)xgwTFD5=PJ1t7E`{2mlxbk}R(F0w2=#-oqj0pVM?ORC
z>9kv3Wfq!C1c5`Y=aXd?-g2P!gM*R2<rMdNX`UjON5GJd#<K3uD+g6K5z70Y$4?WT
zAV5gJeI5aJDUDi(<bOsQ2q)b(k(5W^kn0uv@pVO441^$Tqdx7SlKmH}X$9<02Jk6f
zwU~skJQP9uRQc*^rjgQ)a*KYXcm@ZD<V1<ukq;S74O+qe?^I(|rPDMO()lq^#2IJe
z*Wp9WgukBSl-P^!^IY_G#4_9KE#MCv1d?x|7NEq}PgcM{I0)oUdiLX^*V<gXtr0cY
z;2mn!fn}Lmo&_w?%zF9ID2^Bhfh7LnGq;Xcgo-KI32);X^r$iE<8&WzNJBnc0AxPN
zsdRRzkP>j(JC5?MflwvF(m32uc0ohdI3p0qanX-!CjiQC3zqbRtq{>H8k~vj34uVi
z3(%lAQx$vTAdp7+P&P^9vtIp6SQ^Q@1zGO>h5o3RW+GxaLM?3N7PNTk(2Zww^@WnD
zdS~H3?a=@=6LOFR_~@={CNa|5Yk&Qf0X4-!B9xEp;1kAHtO{0_;{hMZ>}1<4a@kF=
z6A0nsL(9HVgOtbs2Yoam$&ujh%&@!MhY_5?@@(D5f}pNun$e-^I!F{5K+Tkf!POps
z1`q0WfT+Z7?MvsJo&qeTQOm=BC)lo%g#$ePxbkYfDO*@zR_d5!ISZbZZ3GVXh*>t6
z3`LP9m}%@af7I=VuPaKH7zANA>Zo-U?tih@bYFr$n*%UTsVE>xUL(AE8mIlY9uYXb
zgcyLsGBzbN)%L+4W}0qE0QU29ZuY2pjCVrux6v+&T=_fR8^ah?At5*-fcDKr-YR-n
zsVo6#@8qbHLNn{=zykliT$NZl#n;xa4S-cmJnZ6!t*i;0$>!ZViNNkS?6^{5+{+nF
ztrSh)^jwxMA0`63q5fy4@wjEVEiMT5mnT^(O#?woL9koR>foCktyAuhiqN`ux!i#!
zk`U~Hx1Xq$-0WXQ&AlD_!MK|U><;!Co{pILcRhnB=IAXV2%rmGz7;j#q7rdHUEt$Z
zn)F<oN{eyzxh=#2Nc6guLLvZNC9es{C-adb5+t7{)HMY;UusuHZMWVF_6%b34XvYc
zcCn->$ooptGxqdc%b7(VowdV1FU9k3qppK;x2#Z4cM_%a%&(9JFfL3psF8$V_cvLn
zZ?ZO1ksj<04v09pT$%`MOt*5xY=E)DK(Lb#Y;4h$W#opwlNfAJsj$C{O+MX)K@4_7
z+Aa}t=;@d{FpHsK9LnXkBz^wrp-jb-XaLD?o}PLm5F2N59&3e3J07d?$JezTK@ftl
zmcR!}|BW5oX>jf%1!R1z$PzF>$-dj;(tOadN*%O~QFqH4bgXJrhCi<~UUF9kXx@t2
z;kaCUvjR_*OGsvLS%x@h1gIi)Q4IGQiV0%}YL|TSLdW^|WnOfK4xPT;XQ7NZ_}Dlp
z$M%k;i_H)Mk*Qp9LD?&f9YP31+BY|UP!XmI+d>pbT2jH!vO3$0`zSko!N7sf@+Nki
zwB*Ideaw_*vZ$FTx={#nhS{fuWzl~D-LF~X6Q59#+Q1-pVWlS2BPebZ<u?*C=%1$$
zrV`dZu0IeFOJG}#&+qV)%Q72RossCX3Y9}q{-OM<CPz>mYR6DxO0`j=Lk*-A+$&~v
zUlcWOf@RGcQ)fAqQyV!n<?^S5DuwiYP!x_uvsN8=r%rYR8!GDIhGQu6MwjI%_@7$u
z)!U}_*o&Z&RxkJWrdxO@%Lu$0CTQ8oh=SVv#A~+_9Qo$p2&$tCt6$DC%e{s9gxmeP
zKfmg+Dr3rrftsjg0Gp9{bETiSBkirwH;GTIOk_!=<6uMp((!=bm}Zj7AucmX3`x~g
zTJp`DLifM=5z1kQcatiY4^#gzc5b;2gD?=?Q3S!}vHy)-hRWlpRj2nq7LO2OjD046
z5hpoaSk-Wdtxbxb?=Mpg$TG>^SO+qH8MSvp^)`{<s9LCAgBu#srcI(cUm`(K>O|dW
zB%@6^e{m#@Vi+kdSqsH${7OX&?CA2J80<*gL9_e_q5Y-SLck+&i8e>JrB1%vr7e^Z
zaVoVUZ*r-x(33mOGz~+x!L52249VNCNwzceCgqMq6&ql*a#%$-WjU-AZd0!+D3VZK
z_lFF7H`%#PuZ*Q6u+odqQ`0D+%iGGTob<`I=Dd^gr2sbDYSBlfm%sPD<D-4I3Y277
zkIw_db7@rB!BqP?VJtNn0h2r^NRr?7rlj6)PvMeWNb30ngE1nBs<bY*mhSKRriN;(
zrruJ-F;Na{k2+G*Q#U@KJf+F3-EA|8-(tW9{p(eZiGrB_Z;2pD6c+nK`%Suw5y*U9
zi#*iKmu%}!;u13mAzC%mtVbxb+0~i%?BnY4cQcX*WlSRUd5RZ=m6LCn)nog(DUWXv
z%)}KIGn0<YgEAVN!O_yD>Fxy!Xyq=8{`F61?2oT=u?--EVdzQ(2%r5IE50^Pq)HwD
z!NC#0;Fnq|nQ?p@0Z&|)`;U+_y#%uHA&%5wg{FzTSi3;oyWC`ksQD$-xW%=ndN4#y
z+|;jPqaQL_1XmInHRv2#Ag9U(I=hhDMX*Bj@iKHxyrrj&^VQ|Lg_{&Tp9Ma@T@Ke_
z7v3DKDYq3NY`$|;CmZN(IGd|k9LlES>eP}bq*u6*HbIo6w*pU9WebUy#IRcS`<5#=
z`I7#<XX1DDA?upi8#UYJkw=2iHvzz$g;p}<L=J%y#2QXX7`RPMWKt$a=II1Z=Ez7B
z5+{5_w~m)Cl_|D+#RR#q@xR?c<65`)Zy^1RxVtqgu*sGbsJAYt?X3lE^0jcZ!j4j(
zW#RV*f3I47mx_fJ5+}T{v@Ic9uF21GmZCf|kVQ%T8W!H~*^-C(Ww8}6^IoY<(qgZr
z++|&dD_3Tt!vl{i`|$7AfM1MHi;)>qtwLtWvcEJ+;g(fN(iS4;YMFHLw-42?5h^Fb
zHJ^q8`Jh`k61hmo6<VlH&=x8uD6X5iPsX?F5T%?!)M;2i064O)#Q;FuCnn1JAJ~2f
zJDX&QK@bSv=#^;HaQ}<FV5Hl{RA)I0O2^<Y(BEk_kDVMk8K#dymI9O^or}%O=hs(u
zEc1{)Z3_{ttSXm{dC1MlbH7#YC<P_%!39<}=bC|`xMUUUOLxpg1II!iGA;hGx-hwJ
zOs)vQs~Cr+7G;lmXsE}PrCcwp2Bygk*A2-HIk~{b>8q-HkKm=_4p#YuG0Fj@s8x=J
z<JOLP%;50ICB6}rbWgy0wCI>wN>WCgh;l#Wql5dQGg237KcG6ggWEH_ulEt$gFZS)
zK+YfxHH5U37q&znJool$6eMaUdw4)md>)liE(c?0>INv1I$aU!RsNKaoU)>N%*e00
zE%Fa|mmC_W@~parKpsjnzCVN&U1Ly6BeL?<$ODw)OEO^-gIv}onk6Zx+*HeH);>-(
ziOMnJ=%R42n`|oKNvndJNTVUAfAVtd6{^^6jYw!#Rug{<Z{Vx!QjTEalb#bEHj||)
zB|GR~LP5s9#dDk~f9mNOfsvm4T2mS&K&c<slNDxH9o(;;!SSIY>tof_Rmgfe#`r@>
zrTQ&Z5zSJr(q4eeZY$29KOO#`u&ce2AOvB(Tmkn4*RTE?y9p~{e&q__t*cQp2uVhj
ztrlew(30Y6wNkOtQGRNLT-6HqL@mOp^DIP}pdMhJ8U42;R#E>V@4Hm5MD+<XNqG5C
zsclOQOLUBLLyk}>6G0alNM_GMuH-W}@98kP;97;Hi$YUsSjL0?8@Tf0X{L-RtO0vP
z$()tl^d~lC>EfWg!PR2T$qBUFB|xrb<1<eTD-C^z6L^<Vb!2oN8K}%rxR{BH7UYZr
zbcu`A3Qfs_{H);fBI*JI^?qc9@%pBqkz$q)4|?4trfJ6NyzI!Gz&{n5)`u~C9C$8b
zDWht(3Ky-{Oz4{~y}VJ)$wH3<O+7h(i<cH3_ptN3dQz~P0(JiiyIp&{Xu42Qhm%21
zJt(-SU%ClU4~NoGuvL9gW;X%q{Y!}H#5bFoi|vdmm&%QXEVYSudGXO>*?0SIgdf`e
zjjWM&Ncu^>wNtrlMCmNMVq24Qc##1m){-ac=m1wy7a3?`d~qPv;c9jhpjfUF^L4ar
z%D;8^x9U4wdImn9xQ)Yesv1RUt(uCHz!;HVrMiQwWUCz~eJ{3!$Kx$W*nj>AySg)o
zK@heQ#-G;x7d!C|!c%SlJ}X9wC`pX9cWHA~VA=r-m-HQ_8ClP2rWHGwPZ*Uuf3H;F
zB)fs%Tgv^oc_u+w-#MiJeyA9BYsT48izWRRsOZ(|Pq7+ixx%cAoxg(uAdK;XEQcr8
zTFNFs;WyKT`9$d_G+0lsZ$jO9P^HzNTI#57-*Q%yU--1j8#9#^abZ?CV3v5M-e6D0
zGcqvQSMyj{F<hjm{S|b5<h%$Ba+CR;xXO&tjGjkP(N+9f$0`y}zai{oNsz@pw7`bb
zr<G>)Hsn}8Y@8*+TPU`aqHse{U;^wMzMOEXRE^-k#0j~HsJrCK^Fe~?isM<h_fW9p
zSWlj0Kw^REM7hf9&3X0e4V5{eQS8_9I>I?o)XgWN1>N^XVd<DE9YnOCpYJ10ryt_w
zNJzJnqr1P7kGKInPd|MZcE&C@G6ER&vd?n>`GGUlDT}P`qw7G(%I9LS?<S(^O#wi4
zPxcDj7stxzrNDQlc1^3CHl!@LvDkMHhBAOg<#TmDU$|qbdIX9X&xf&dNwydSf#{Y3
zL6rS(?1?utj=J7Fl==9Hc$)6t$YC7I(8_$C)7Yz`0h36HR_Zft*P!&#!G8#~QlE(*
zIEdz#A4Y1WJ`;ovv}MQpjYK)_5Xt^MPLHoWiJEX$bx1a4@~-h^KKJf!Z^EtdY2_a|
z`eoRKYKO3>0zK0(NoGeeBSg{4d}j4_l&#2A4a?4Gk)A1J4{Jl)mvK^BsAm?HLWery
z2DWk)?CB`G%gbtrS~FY@WrzMeFG*C*7&-TOM+sf|4Gxd!wCw8DgTCLJ^8-jN%=5TS
zj_ySd+YxJFo=e-tEst58@giE7XO>t;RJO&V6u_p+?Z?dsI0fdJvfOA-X%X6%wbdSm
z@3Tk8pluD16$ZU$O5<3DU%`4x@4w^usX|CplYKY|I|ji@pKD!IkaSeMY$O)zIkPky
zY8SBHRGjDB>uzm`*C_zT{w@4+kAJ(kgfR;X(E>e_?y2Q!MXJx)xAGP#H-pKpH)vm1
zP0dL-F4`l$RA;0jRlOY_WYH(`%PTwnVW_-ACO#1|ZaZA~idd*;x|0;{l`bew2gjG_
z47>co68#15@kiJhrAG{cK=?`qB;x%q){MIhd1$8x;9IjA1oFfDYSm5agA4{J-jFN&
z7CO-g$YC3hif~m_H429l)0UovlHt(TzFTP3Og_-$WgRU(tPFxN9F^^G;iNnaMR>xh
zx)m{w&t>dfi04N`k#e{Za%b1eJvbXvo|s!c*5=(w%`9|fE%gz=3h@LdR~vi$iwy3w
zb)svc4#r?inJQ-MM9<dib(1-Ib{t_8mqbD!y-E?Dj}^aN13{b8mlxr==4qv`mv=~l
z(y~KL0=etpiSoG?iS?}Ggsv=?foTz*P&F$nD0|&9TFkyTSSvblnM@=oAZ{o9`dB%p
zA4{u?n|x7~dH)k{7vdSu)kGco#Pk69Q-yefR-tzuvR-Z^JW&<y^L|a~V@P=3)E35&
z(2xa{{qh)<u^_PxS;~6Jh+DO0<c*w1S|wj&&bR_{73zDk?IyLVGM`7&Mf?{|C2^=M
zZ7$GLZLyD+$EbG;BP&A8N_(t~EdE^+6!Q#Pl`Hh-psS@9!#_fCAwHT4XS|MB$xW^>
zcnFED=c!(pvT7=vJT5-wsiW)UJ2BVc;sVE?%}76dUD2__APn262M7|p|6(tqm7Slb
z0enpf1Y4G+Z`97SmG-Js`?>wXN0F`te^JmS9IS_4h(##fq+X%(3hU@EpLv~=BOD$!
zYScki;!USM*fkWtb6tmOp{U{H**nr&d{kfQ5CMn%t(8%F$LlzG+rM?yq|44(%(k|D
zzPqf?)vF*+dD??4b|+Plb&!u8kL$5P>`p#lnuZY?aBK*q&v^T!b2A;`XV|FU&KOau
zs~p|76S@$=lP$7LpPrNumyJTM#wC&*i*P%;jZr(JNyU)7HQ1n)tk99%ze(1neZZO*
z*sVs0o5S@mYQ(5(XV82W{%!3nyR$L!T$16mk2-{MPOjRWxA?TBFw${+9s?t#h1;pG
zbO_~SV}4X}0%vP+2D_7uFHD+gq5W2)DB&HiJjn7PfEpLbNqgFfExUvQIcIz#6CwH(
z+&1b;T77EyJ*x?OFW@zNme2r82Ulc3Am{Ura}!d#+DUysQIVMR(uKTf`Qe~22;`(F
zs4CTSo45oN0y*b*PDSa-vf3dK$cc4WXS&9lGn48N$cZSYT}m}sVIBzNWWQYX=ac%+
z<=`m@=;Ta@a?oH$=6@LWkFRsPwjcyyXe+k_6&3Bju{-fd@GAwdW{vX@A!H+J^5rd|
z3O#Oa>cC)8=(Kf4PH6O4^?fbw3?XjV=mof3!p%$3_Xa9pQ*tsJIY`o?3UpZC>a1(G
z-kHT^Q>r=(H_nBQ?K7<+g$*_c3p1|WmmBMXpxr{}0Fj-o=#7S`db+pJc@jeE<B%UK
z@sEv%AD1&pzs*uaT_zAZ(Nw(bE}4&C6bW)8p^un5Q4R@q3!UFtp(juf?y2(MG-=bi
zN{Yylz^b6oUf^4&%6&+u&1w{P0@LC-SzMI*!b04Mu@1IGzm#w*`Hux0sA7P|Gpfji
z4{;~tHT}7k$)C)mZ||aa)zSP9d0%9QE&B2tQmagzf>Q3t=j@?i$a7?H%KiIa(jLEK
zctr#`>0u?cP$&IVi{Z5Q{^?galpqhEA?^eWY&<ydDR*P1!S`M>UtNW+t9C1&AZ@JC
zlBBLc*wviy`k4$dFWSh<0vBW`0Iw_nmoB3`EUyZ4C!o5wOvRn{T8*t<)cBj+6K?&}
zF}de0Yy7eYX2A@?{1<f|d!G>n5mmzkX!85V9L~~FEuy^gH3Yg^6`n20<zwb>VUv*A
zik<E6pRqGLjvxksXhtp&=*mAat9J$HtL*@$W(Hk|<Mmfy#%i6Mr)av|ZUpq)5Qb)F
zJeYxOtGNNtfkO9J<$BZAbpxP?R?8^51wZgs%8G3-&WBRDZ?zl$L<e003Bc^2P$|3d
zPc&!^d-x!9+ufNbX=^^|DQD>^3l(!cK0}FW3zcS33mJ1Pr~XV`dPs(hIW8F4)4k^p
zH^l|7on5SD`#9ijEOc)>!E2Ite#{G+%C?XaQdAA*f&B4s*i$QPVM)HiR!BQ=Ews$f
z!6ms!z%(GU$tCq;%+l<LFR<V8WO%-%SLYVRM6A@MxUSXGJ^$c9xD@I)KM;BcPCw8S
z(%R%Xf`k>VdxSrcj_r@A_n?1OR3&|tz-bGKOHq|(%9;WfKnH830j-Wm$h6Z}?JNZ-
zG(+DUz2jQ+wOtlOiRWZbX`zm4<}MB+@st+Q$}{6#Mn~&LKfze7Qpi4e*O`~NP&SW(
zv&0-^4{f22%!<`uQJ2uQCPqu&>EqC_(TeCNP*nSIb){2Vth8VotFR)J-R2Sf6y$Sv
z?M{O={CF$uZxybt<8rZbBaaeKfDC2+M<z}^Dm>B3(S8X#vm}N=7=~UcfCzB^i?w3B
z^+!Dblhn=P$VhJ&LYh+h;hZ5}KfRz6rG5+t4c$H0yI?0D`KzV_fC`R{pb*u;!^F>C
z$eXeZ%iHOmK)NHdgkYlQxEsj|4hu&X;W#g6t_l=a=5HiysAr_jnAbxlRvFIt`pkP$
zV&$6=&Kr73g&0W=gqp2l1mPMHf6D*1sW}Nu^u%?;6+YjR&oYOe6BS(dGV8*R_#pY=
z`KlGm`;iu#{s!Yglo1x5+{rYs7H7xgeOZa)$6A>rfG*oCICF@NRr>V*Wck4a&)a4_
z<(8jH_kanWo5TG;pYl;7`w<g7$?a(A<$?~2feD^OJr>8r(ZP^F@Cw)Uj(Z7TH9vz1
zo|_i6S*kJQ%fJLrD%n8<=GA^=F}8QAy`12@o=&mq_@SN*I)Y9;$Bb{0CqgiIC^;5{
z>7B$B{O~`e6bX|($yDs&oge&6Q@4r9p0xBPG4s1h0fide(9V|5y}EZ~q9$Q*LpyPT
z-U%{(Th`(Yoi8@9U8P!fs_tiJY*vtNM!OIevC4f#yy{|i@z$B9n1L@u?g=F%SlwE0
z;0u%6*S!)SzRv7Of)IwG8EtW>Ir2|zTa+#OXA}T66hi}kmaQK{Y8uZEsT%jNwks7w
zRBOl)p4JT2KG_p^Qbyl3iov^`V3wQx?Tk=QeBq!rl6TS~T4s0eJMwW=KFDHrcITHd
zCA)gKJOYw;lEJF|dl}XQqaushsRn&MTIOz_OP6;prRlhY#U4!;c&@DihGS#kW*ETp
zd=*t+<Mi2VB=BUT{jUq6t;#|G&xhPm<|Ax%>V%P)vNY^PE$Z1Z%1%(gbE~SAnWJep
zQ~=LTflUgQn838U83gd8Ti%@@YnWY$1?IX?TegOv-<e&Eoxk-+%61M<x1WM{vN~wV
z6zbUFxt$Tb^PN(I+<7QO*mhLQ=U^!*SZCI=IzElyonTO<GZ)48T*i{2-9-D0>NfZe
z-pR9Y*LrUSt1d+V&(lj)3(o|my~CHbhBhH9x^0LRyc5i@mwH!lIXwV^cY>|Ab*eE!
zaakM$@8r7ge9lk-V!N;)fF}hDP`%3gTh@;STR}-HcZMV&?%xXF*?ECn%g|!GRwIBX
z!@8zHbg=dllntu#F`S<j<RgG5EAH=CLfcUr)&=n71k3#F40}2S@8lJ9ov$XD>1WVC
zVP}>jK?uXpE3vtN`(JD@3I=ILp8t-jnnHm%%ll<C&#F(!D=c<y?l?y1odhXQ^)Y?T
z4H7_lFcb6f({=&|LhU37BfUgew-N}kbA>-hrCs){9c6(ecL5z*>mon0w~Bl_F?Z#b
zUl;f{jC?ysFP_7gv5-xwBIHhj7;d35{cpEcLss*<<?_kGhY)%v==hEsWG_l_ZU&)u
zVqK2YIZD1wKW@${pVi1}I$ImJHWw%$^iGbHR9M#wNBP@lNySi8jr(=fVC<TeBC-dP
z(~1#FCns?Cr~E(JnWo4}w6~_hW)4xZ-zh86UUie9RfT<)ZWmcW``Elex7S1IWapjW
z^+YS#GH-;^S=oFof^GiqJB89&IVDq-UhBMSu2=z~bu#|GPKNEQ?oxuoE25LZ)34`>
zjS*7kAYkTX5O<Pz*uRAn6MsoPqhr@zJF6g^RdNE`1pxMHt@=?2(A3MxEMK-(<77s0
zZ{cKc4!iL4fZKAP<-VaE2!JYetLIWK2e-SZ7#CR7Q+;rVwxJFodXk9U`?y%mQry-E
z(UbXZ&0*QdPrHU8dQwSiy5&ynSqa8UEUR6MD=UXZURF}K>Ng(z>E8o{eh53aWQSo8
zhVG~n$Kc2QH+CZzL_RvY3t-$y{XzyEM)66tEoPpm=aa`)2%oUHrWg7b>MEmRZoq42
zk$z_%^<e2Cd_K#|?qWSQ=_lz{PwnQTpo3fKgPw(+pz|?X-T!nHdlq`Oc^s%1)t4O0
zh|FVWSVIr0ib?d{^JnE#Q9Ew3YHeki=lx~m@%QOfLVOX*S6{SDS&!x~d=V{<V4Eku
zUojCoO?=_=rYLbvc+svJ5qt}&n0R)z-!GrH%e8~Ir|1d!GP8s;ZRM>bo7%6_f>&Tp
zlb=0A&kc*0NxC5rVlt{G#-!=pwT^4Eh#ItazSqkdMQ?;5djhnV_kC!YDx&yibrx%i
zqC0tree_<5k6KdW`VoWn6E)Bv4)M!@%Dha{fjlHnv{*DNb!80s`+5@Fw$)J2cC8Xe
z55*HUD%P#ECV4W3;yKZhJzqKWTrz58l<|q~C?0ax48;@fFoQQ4Bw1aKwGyy*6+-(-
zspY+Mu#9gS4HY1Y%j-`Fo@lk~d`N&KqiS9}1kc0i;bjmrP(7>o{53J!>F*XnF)^Ma
z&TC@KkK6!5?tIdTO;b`d8w`1YoLR*8$JZ4lSqy@(8|@Sos`tOx7HdL(UJl??Eh1n@
z{=9#=K;$0=zBA*NBFb@1+V7{_IX6v4D@jv1W@5}MxCe3_ZGnaEbYqFsn&eFNQ|w&(
z#Q|aa$cR%}Ae!5^^0ZYBBQKCs>&%`Jnvy?vxHmbfBgUEo?)f=Zqjfn!nnf?+%E!4$
zJ{mu@&WzK^V3YDdmtI%kxw0FR{OnDXhj=pL?2Z7ZKv=)aD%<{>YQphCcSa*wLIT+J
z3>SRUAX9bZ*_3{85%+7w>=BoAG5~kZ6mu}PftqAp^2N|%-l$9`_FNK#`>A#A7U}*q
z47C-f*12}+9OjhRPMJraTIU9VVp-Wq8zDC^@U6a(_IQSOdelvI`;No!n_O4Uu&`Ru
zs%!VzPvt#NxibaO$tti5Nb1rGw6{MYBgJ@=Q$@LqxXNWLNS<U<z3dSTpgWW2A86~n
zg)S%933nqANt#9|Ja~NIodnsu`XX{&P|eKn&&aM4O@S_h_|E-6%Ab76a~#+GSy%at
z$BD~zO-hwIUM&)-xo-Kb0(cs-z_2%v`aOyo?FqcN>34_h=?p96uc5}0oM1!wr=Upt
zhGFo3O_}=y+S@aGoc2%Hx!^Di!Z7qk6JM9y|6*&9;zXL{9RRTcD>T@C+=cWq40pRj
zbqCw5A%EWH2eIvR#7`-yN9a2}Wsw9?yT>Te=;1T1ord!*lOsTL`$}Gq6CFpFGi<5S
zw%o<hl{f;Fcb*g(zptkzOZ5nIdppSnTKms#f|2ix4Pt<YMra|-?Ui)u(!Q<QEZT3M
zHj@e}lPy4YQTq@q+nl?sCX3c~WFg`jepFEg^tOBG-ORqwWnYJ_W<gpFJy(f4<F<AE
zKC1qUu(tb!;3>9=sqTrv0MB=*lm6tm^`lyiG{m=pAd}lM=KQ6_Lf>*Cob4CRXN4AP
zax69z3VU*M{m3O-f!SWhh_m<Xu+(t@VQqhp)%_`bN&OYV+U~mSwF@$8$#FMkC?=fF
z*OQWmBCPEWsi)G@mX=c?tnFUNrexh*imKLAR6NhQ!PZ<EL*-Q?DxUW&SuD7H$>&<+
zIJIhHp7Na*HBalGVlUG7`iPRJ&77{g;N@NyB~SmJW2(DfhD|vb8SVOHU++n(%fT>a
z>dsNjYD4~!qv&}7)3q;^dH_aw_N2qlFJWht95D#P&?_Y*mC5}t)+jTU+#mG-3@l*{
z80(4OE``D-dGg<N*{3hEaL_qVLfEAE;U|s<$p(4W8^<Ipq=GEZh2gHZWtIm8o~f0&
zTib$3CK%!fOTk(X1D~=Z?p#0SVOS|dC1eco0(mkk^Vq{V0@{JGGS)CjJL9psVV-zA
zhwLjRcF-_SV)y2+N&&P{p4c|t`D~T*_-=EZRUFQz{WR_E+)h&AF$Ned9Uz`3y^imp
ze2yn^AwBszbz7}=ruRJv>3M#dCyDT4eLY}Mxb#`|kMSegzMWErQ(mmxS<(Q@#|+yR
z5)Bk%TKSlvPh4b1rRCmSPnx4kxyS5P-23I;&Z&l5tyFuBhI_I|?pmIVXjzJedtTFr
zh(ya63d`6n+`~GzVtA?nSCZ(oSVWUnVbeWXF(UEL2XstJqv@Wjh6e|g<hhlxTaOJ~
z&zwO<<2|qU?x}Mt74j)Bj^=yPXhLp`%p1mgTJt^MzDCe^*I`WUG~aXWzi!dFE7-Ku
zOMXY$DVpxd!g9M=v+^Uh@}0Gg;T6B)Eu-n4bj6VDltE+v5_V=u4umiay-|v-Ex7;1
zrcK7Ozmx;G=nxho(6gHUC+}8gX-XERw19j1Q5?1SxO%i;LHE2b-%FHr`GI9%@bKh}
zA9>6;xoD&f#g@LPvcP-3(*&(}TxCiVcuy~NL<bdq+@9M>v=ZUN-tm%>WFdeKWGd<A
zZ2fN?PLgL8M|W5BJcRz~Y@4K>^jqLTM0F0`L5HhNed~^vDEZc(+*;?BQIni0-ZkGZ
zRDMCUTrviVr&}@>&~nM3<mXx8RB|vVfI5S*y0ee`U7(EA=rr^Ph)U%K1<=dUsk^^y
z>rmJ|y=<-$P6-O2R)^sa^8hG-o}^QH2Kqoo4Yoz~-nSE|7a0fvw70Ax?wz6fBJ|Jx
zEerA=<ZpIVzlQ?qzI~3TH%fBm5DMt6DptyzcgQcyL?i29I`?DBwl*=iE3?Vxvmm1m
zLA`_LPahd-`j6Bz5_+_ouD^v)K+PY%qU^^iaYZPgzD^{*Y}^$@M9n;M?K+&)K90~p
zZI`UevlGa+9!918d|$_niZaRtV4dE*KHFpz$lE?lPy9aqoe6)0omq~=FbG7i<Q;PV
zi%pj!3Z#)L|BdV>Uf|iLgq1U~ZW(obJOZ?lKqD2w5eg~6Sfh;5Eh<!^f7!#JpjRa5
z6mO`!&}Iq_lyL}=7iBb=;60ot_hPCVyi_roS+^8cTj6n|icza{2Yg(8<iMaPmc*zA
zR~@IcGR|c80+RcdF7#APvXwAyEZJ6KP*(W7sgPXbSBekxRX&%LoU@fB=FchQZ>iwg
zC}V_&A}7C>OK$`Q#b0Tqhh06}vcRBL>rdD#-zlsTk@I!QWs^(x@DO&hUOe^&xg`e%
z_4g2n^S?Fec&Amap;+a+Z0kv`PSD`}W7P-@`WuFuijF9!piqeIgc`=So_1ALgw<e*
z$1}C-!YSK|v)0CT)UOvK_%jOQo-&*%mp=KN6nou~%LSE;Afa&5cT(lk0)P%2HSP3*
zR0FU8p!2tDwK9^n?%~7SsqHe<C1A7wphy?U)cm8UkOctkP_x^W(x~wl0JN84vC0pJ
zqk$KS5DiLFZNWarzB})GI~SRuj0OXKB2Ng!1##Pd^XZSUbHR}qgkk87Dhe%z`(JD^
zY8+Ntc@GfHv;<0ie!q;msOYmF^+9hG)e=s+9@2xuTYWCUPWSu>GgE7=rijY9bvZfh
z3fn*ex<_gx!H@j|$ziU~A)I;Jm?;L`3-ud&qE0Q~3Zd*-=Jm{!-?4H>h}<W)x~jSF
zKSWC$;C8i$bAMPe8$@nj2YEmCJ#PClK4px%<!r+aN$lMniDG^w3s#=XVgL~2cFN@`
zfmD3&EQD@fv8t*-Yw3o|nLz0FP6Sc{>8+Rn4s<(2A8zZSW&dD026RcNR@Vx_ZRhlg
z%4ll|URS|DaNFy-jX4D1AF7MBJ=3cCStA6uz1_>3r1irQJ?9sZ`Q$;PL5eLCZJ#S~
zyHl65!t}E{G6LORsRmrrF)RxXfo@;#P-v4zRT4KGia@v5EmxdeYCGl$q1($&gMU`z
zvN$9Jyq)VM;Y^B%x^@@@yqz;Pl0GU7W1Js~-rlldr<Hm&>l>oC_e(w8w5tBMhJGuu
zGnFm4_97Vc_MMN6ZzN+M=NcpE?ff2V3W&9Lx5y*#?RVlAD*M1)U@?N<em}_rU$Me2
z(-^BbGsYHW`K;FY`DeNLhp;nBau^0-=#4rtB#wIji*4lw;n@%M0E`pr+CV^0R;Shq
z&3UnZ)^$6h`0Z@*Ym9JsSJYiHU#EtYsPQuFTZzzJZ)8OdQQUSy4fNYmnA$qwEdaan
z+W66Ag3*_VdN+dskSm6xsO=0&&g|37&KN_~_PM5ozE%{gb15{6+Mc8PbmG1i>fBg8
zJA!Ius*?_jO++!<*#oCaQ}BbaU1`cnTHcI*!u6P;nC%P(?_I^s6<1Nr_WXx8x1xn8
zXgej&bbEh74Lf9mg0@qjOQ$U<J8mgK+u5^K9z538GDacNyD*<gaV%@p%yvx<aVd+H
zMlsu&DqWkHW%>uKgCbs1SfSP1x?<`i>uM)IiMxCl(NX7dZW^7}X&(>@+&f9gAL7t>
zs-1j7seCcDm@bRPQ|;tspc(R|TIlj&Jk`!MaoVDQ>``+*%t}b+C;rJz`O(b};3;>0
zN%Gr2(zZt-Yikhlut}=khxNv#2u)0M`fwc98x?sT3vwYjMyp?hynD;<so?NFgbI9F
z(O@iPL3dWG+<Cnu@413Jw+#ht-#Tt$3D&toP0)7MIkF#c+ReMFoqvR#VRpkH41;g9
zmkeyo{Vz5|XW9Fs9l$SXN*ioGNgt|;r2V~?-2ddX6A85`62WH3<<eki`&;B3exZ__
zi=1{sgyK{tUrC#)DpH({@#$%_rDe<_#o20MGb7hiPCMuLqUYx6ePH&fsy0tMh>F69
zT@Lu8L7zUFd!fvp3~QO1UREY@uoXG%bRfD}WZIJ?2z@@qEJ5tFlqfu`9g#$HJd}Em
zusR|c&0JBw?yNF+|J>hr<nvpV-AT_BWSZ!z;8S1TKb73?=fo3vzq2__%6|+JpR@3H
zh~U(LKrp?1)F2INwlQSYH}7v!7yj5kZ=jrdnw5Dys$^_hcqOfpeupCPmA!>mHlEM6
zE>wv#F_p6V+ixyalrgJdP~Y;-lnRl^p=S>k-CG-6MB<+IIRN~<)X={0k-X>W;7DOy
zeTX`|iR3-cvv|vxX-m_INZfO-+NIqEC|j-MJ?*{_>B}TFK#?O)M7q&p<@^Q8e7jgB
zH+pg@0ri%{`dBSWGq*t7fxfD*IC0NYWqF4in{xRkW|n))b4GTEF4~3k(tGCtkE&K~
zRFvk0q<;81w=4!i5Qgrk$G5Qmja6(({K^76bnFbGT$A6ZI1W;SDnc1PlG^mXI9bo}
zAXxVcmW#L1E^+QhLs&I^EK$$<3K|oq#DFbP&+uexkH~<O9JgdW!we4-c&bpT`D%bY
z+h;OesBh8eyi2j-^7AqjqZ~ve4u7v$v0P3Q^o+I=^e;>J$E#lm((`E{Mz*aoGlBGs
zL(<7u((cPZde*C1k1Qz57=QYy93tm0DbF)ys2#(=P^v*#VxA>D*r`n?oAQQh?vpp5
zuS}N$WewNd?b9>Vl`xb0xx_rn>&Je|e(3_|g_b1Pj946Jn;JxtZzZthR}*HbQEa7-
zK@<1AbgT~N9;5o84m7CJ)hTQ)FVuQrH`Vj{^O^MN>Y}xS@QjWZR{QBHl{o;<fs<?x
zx1}v383y$%ZO^OZZOFgZ@l;^0<E0p?%y;me(e<Z)dzYIRPrmaS+R&F?{k;EKrw5tT
z7VnTs*H=%t(;`#SQ+ZGQPy<X@gMvxy7*zwo6Yrek((NhhdFmKBYN2+lx!CWp1yt*{
zC*FBtp~|w844aN+Pwh>+?M?9K%h$CfISj*~8|}oe*xdhO8!|=oqr(B1#%XIw2&7*i
zXPo7krnBRUzxM8ovtsZeaWNvQ+03Ns<xPoGG(gEasoFhXrDoFoqno*?-8h_oHxu;>
z$vdA?b1DDkST>|~1xnsYztyR8^?c!$yz|{s?wB9HE~z^oP`RdQ_`Oy{omv%Lju5U$
zjpPryeI!#H#G5{)^bt~ba==tgk9caxsGY*Fk)+N=rTaJ$WxGJt(DxG_qWm1gvl}mU
zAc)FgLGsQvtEJBsdU3ZEr0#6XStrSvXb6MUolND_KqLbf2?a>q*{nIBN_l6{@x;fW
zJA>4~jwlprO5?RTvnJl4qC45_5QrxEw1@{{JGnbWIW9j6iITx|-dVRA-(c#pLuBXk
zd{x76h*Xb<vWsLYLUMX_v=^d=dd|OE(L}*^i=f+w>YltcT1IXAA60zc)N782I^M#r
z2z0Mk_Ypv_{c(93`q_!|fT+&#)%fP`V#nK4R44bb$wRV1&LjQx#dY#!EQjMY5m8@u
zRYl{Avw;$3R=sp-VF1V3Mj{N_-#$$Lyb|&jAMdk$f<0bqLg$Ze{y$;olH@Q51JN5z
z0S1BYf3cw*{j%xoLsg80Ew`lCU#qsS>Sctab8i<ltrOMIVC<s*bny+;0N#gV05}z$
zCj4&Sjy~0>NrRfkG;lSwbAsR-6((@6={v#H&IH4Qu)yNagwDHtIui47A5u&RQxiIo
z*X1nDO%*2lpi>h%F@LzEtP-YpsA-)7MpVoQpdpW@o+fr;lu)AhjqRf+->uu*4W{Uy
z1g~__-B5R#oI{IsJO3u}4o|!gXYp>QMRRp4qxRR<Dn6Z?UYE(8a0eOD<ONn2izQP#
zU)PU__O*E>ThqxXQ3L`u2#Z2@GQ#lKBY9PPkvMNN@Gl=+54%@8fUhIt0(f$oD7bMu
z+*P6z0KzIgj3#!<>mypu)}%?UiJhRfwNqd?oko+Xoj0$Q@?fH6EOoReCIXKnK5Oy+
z_XKoZD!S+}?2eu^8t6H1`WnWwRm)e!P-bI47k5@1Et*{K)0(Dpu5w~xG>h^-h6?l)
zm)%y(vZ-;Dy3*NZc`-ubXY-Egjh)~oX9K{)%Z+MEXYmnzQQU01P3A-<ak6i>(*tE9
zCngRhh$ZOurHP}vwZjTNx=9v_ux$HG=-mH&ozVfrAP7TOLbUbVf3Y(bf?pYct6DrQ
z1m24Vz?apOt`~vMA5>P}Z)mO@;Y=F(X=q5ji@q);t{tK<Dxsi$)T^<QR<UL&wU+FE
z<(9m5-~<cujtopwR*hC>H}+K=AZ|u>=6G*d>=HU=w+MBfKO)w(?0Km=ST}a`MCz;6
zTOOi##4W;|cvf}kKm&EXhHv7$`{?t=N_S;N3UfiUaE{CI5p4AopJD%kaCkQ(g!#Mk
zXUl8lPHqwH1a+?yt%!aYT`ff;mHQ%LO62CYA(guqs={>xdN)ctPu7YlECr=?OJygR
zuVj#+5Ns-6YNTiS=%plCuX?@7FhWp}c^j}U^s3Li1sXL*7~oHCkz^PFV?cD-0Y1xV
z(J!1dq7$4^({jSOKNb&VHA5LSvKYDXkL<^!mD2-XB41G~A;;HAabx{E9<`*~CafKM
zk#M!Pq@LR?LY)8@kYtOLN|SpyLY@1oaXPIAx_PQs9I?)Qc6^toOpiP+M;O4fgG(8e
zDW9$!BVwI6af);by--slj9BNuHZHk_u4LU-{1oXI&+?I4X19oSj#C*pE`nZD4wcw;
zbh-BVC+rH61O`Fak9Mpe>i<8sjf0_wo$Lb`EmeewNy%_@Jww0sx-Bcs3ca`N4~0a>
zUr>K5p-%Y1O0&WxP0VXG8Pf)@1dfii3N%L9v)ykNbolIK(6w3_^<8*`?CQG`>%?<K
zmUD*;Bh-5G(%W6^q5$=s9EvsST}w0M;gdM0<IbAhR^S^`LB?60dPx_dJF&^3#tkxS
zQBNaGPmfA?yRn__A2y%f66SQoBAaE^r?gu4H%$sB94omM6X(P;o9d7Oui>LSI7&{H
zO;BUXmoU90%n3D-Y77B8l&h^ch-NhwKInYuawxlMhvT8(2bi*yD+VLQXgs`ezZcSK
zT(^fYy?6(HLQXJlqR{y``gE;MwLMC)eU$su`Ws9*7t5YQvALwxrohFsKZ-q%oLoYj
z0|KnKbMG)q$Vi(IC(89&e^5s=X+;UV2xe!i|M*rRDREA)G!uV7fKlupua#eKoEEwq
z>yeLvdkdl#n~KP|z@EzSQP{=e3dEhN+>8lxf@rB4Y0**d(i!V&pUhoRy-Pm6-V){n
z2Ldxy=n~09YktHL?c<D)MQWm)8%3Xg&Z?Z>FJI@DEHMZI(H%|U6W#yD#&$xJ`*C{#
zR2c&%Lc{sTsK$-Gv)qUZc$c4@C(F4poXB6HwU&x}Cy=BivH1komcjL;IdR)$ehObx
zrC>f*GZ18!RBlZ1Flprh?CR|61p%|j`%)x2J8Csywa@vc+$j)7e?ZS?fz6cFqGyc3
z*urbjRwXE>C85pxSC$r5HPTHZ*@NxV<$u<b=yV__*r02e$EE)1R%W(R`i#7Z%f}kA
zg=~02&$vQ}R$D|{bz|_uxrTf!Pc35tI_K@<7FH`~6OIG|>c7X8gBqv5=#9(Onf9bR
zp*-nq*0FX`1Hy_7qsD=T*mvo<fiMC`i>;}+r^+KE5Js3q6iL1l1+v0kEf_}VXC3S&
zvU3?%o=a^fq#-luh+7^R$uQc!$#2{^gO!zsmDwi0amY5)Y7}?28yW0(8v1o*CcNkR
zx~P4fy)x$9IaL$QnQGShv7%#K3KrM5)hDtTv1eCLM{cGn_0|&F&f8~~4Pz$e_|y{l
zPUx}wYulH8tdV0R^JRgwFqG9xl9LV(&8l3XQ&Zd7_g!>Pe=U}(-`QsFhEg@wLV+g=
z|KYme>b$fAU%sxyNMaa-b+i+3Y(xKzU9{ox-OZ=~##t}^goOS_CBgFo%IW=ujFj_4
zNwb;n*|TwxdcqTR(0*r)wP`C}l>j|oil-c|mi!CvEPl7>?zYdM6Ca=_+Wz&)is})&
zK1raS6M~zzf1Ioa`vmPQaq87hnAqZ2P}$+lG6+JSEoQy<M0vYYCVK#DhS~P01n7w>
z*eGLZc~xB`s%mGZ_KWY&{^CGAH+rJ1LzYF)V@cn3tYe>tB4N<qRWFlg9gh~MF#(f`
zmbI$SJz8Es0VmPAfDRvr5`>vVtE6!|*75A2wy=B;)YE`iw(brDN*3gq@0utYPIO~$
zcNtY?UtVG}`<S!52*~pp$!a6S(aZ>MDgk+}FA}7OK8T(`0eM1iEAyB@zgS)b<Oz*w
zF~iWW>=HWG%*Vp^%qFxD;X6ivo@l6Bpb0KT4E>N%1dO#x*oJN$O8+g(eP*r};J_k;
zj^#->vfe(Sc%)+m<_U3c@r7|up;)d2=D7eY76N>|lw%U5nT2k4s281{c7c4t$6?<s
zXE2JUNkE@qlF#fag}dHOx59uv(UiDYKn`{@d+ADmpI<t1MWM+p{lJ}5ILf3B{;d8t
zcYpZ079&wY5Z2O)KkUD;GoFd}=FOx4W?eyq2;^U>q||KuEhL|5b-Y+E(<F3waqW@3
z(C6O4sX?Y^y0(LZN>|ES#nO#7l5kIGrK=VrG#VF;LSYwJX-=OYad7Z1zrbr4xE1~^
za7J^cd%;iKcHgtyxxxw!`gcv!1zywL6JNQ|CwOWGQ|c3#du1iF<GrL%BUtsfG4ap6
z7mNKCnCbf2Z;`znxE6zPj5r+bLAH>-9TP6qUxdrp2IG&uJ%w*W3CqTW7ykr3`eMw5
z;$Js)eoHmRCNX)5&-Lr!j8x|_S*j$!)?~L*gWsw|o(^eubEYvAe-@FY0U0jVS6}=S
zWKk-y+e&VZ(Iv_waQ|{V;~imx-3x#sqFGY%nbzn`;{u?_7Bn{pN=^rxmWzObCRVl3
z+n^48s*$P$@1qi!K%=lL@!nF(Ox`O-o`xuAyrghHHS+V7*87a>BA`1IDsljT#+%hL
zIo#3H$=x_qHC`%N+MJ@e08n1TN-Y(<$8*-h4P=OtdNt{yR|S7xu_+fTJ>dZ5t@qBP
zO(avVCQWm*aICw%##!rmy0n^3@@Joa3n9?MDZ12f)jn%bto5wOE1Ei!=J&tx{_u51
zNeqM_484+~E^_~i)i@>il>;!_*{ZdW<h@lKn{3O;ECjc*-P$+DCTn{+lP;rFRP7vq
zkh}|n-KU1E{oezHXM!wjtU|d>g3>;p*%HE#I^-LSnwpGOZ%}1~pCV382Gs<Jt#3*q
z)q~1DPO0yGS#GU=2NWJv29GUB^5y0a9vSDx6hvBInU<*f@`#_l%CXj5KdVsP@j$od
zmizeWfU>EE%&0YGRj{*LsP41TnwozYd!VB*aNpJBf2yi5?%4#v5!}>W%~JD;NK!5*
zhtX@Ps!`nXzc~E-I5%~AS}RXt?tCaWo5=^2Cy{iUc|ERMRekg`F-&bj0Pphs`GbH9
ze!>>&!eDf`BZ?r`JLZf_Rz*!(_QMA4Tdj+1fC7_TaOEv&NoLsqg%;tZtFA7qjBHS9
zf$^76))b4xD{&nT4_P&d-w6g^E<|^z@3<F4bHqbElcHYh50aV5lGu>?S<aX}t_)PE
zFh#RoNM<i<&AF(k)`_LZ{i3G5I9fwZkjyHbFN%marHIDT;tu|;JvN?@$BY$`nZj)d
zThx%y>;W>*hoUFED?h%jC|P0<gxzSTMW}lJi@l9o0`ordzf2VoS0o9noSzDcAACI+
zsv*!4;l8Z^C4lcKlZPf;-<VQQ%q-#U`#L?8M29G0db5PLqr-xVXYm{jDPgtwEtWEl
zcA+W;S;E_q-J|IV%KM-tyd5JX;6VL817bH}75v|oSt)_-`=6xMlG!$a?dJi!HsV&*
zElXfK-oI=6PTfvm$>Vw5A3m@^A<<nrW76ebDxH^<5jGpeAm8L7(MKmoxakZ6W$*?f
zcSi!-zec?6pKL2no<z29XaY85m%QMbC&lYHIxG#UrPkO7#Xf=xi7%6huyWGL#_HKt
zI{qzuo=0DvsEA!vwlmMrK+m!D<x-*HljOQ3TLeP8TY6)0UdyASCRLX4M*n-)wA3q_
zy@k(1YRnvi)^s_(xJl2x`j(v1sQBYA;>iG!lUX`OsdhvQ-60R}1h?-W@VoZ$P)nRV
zp6AZl<eTLwoJ5}JPod~D`jONo$(~O%9gUh)$TSlf6|<cp(3f4(?VFRjOJ4f=tgQx^
zJf5p@zaY=J%rj4Aj3!q;QT10=#>M*M>)dV_2w@=DOA3fM0|)fqSh6Rr*ZIg6fN~<{
zZO;^q6Kce4t1@HsADg8cBli$kJL_q&t8;Ndjwdk4cX2mQyXX_;xu1hUky+ZIMV9BT
z?slZo*?3QZ(N=8(Lbut_puh-IwYUuJ@vHuC#qxHPy2_3?-!?MnFKVEVEe*(S*OK%X
z#UsJVh!1<{q`wF>;<5D~Z};XIDKNsTN{vE0kSQ=i=2D``A?&kfrloC0!o;vg8}@`t
zn&-h5uxx4WVZTr)`KBF1dmwA3)k#ABY}E&B1By7$CsAS)Z?-)PCeL#gDGshM-3KPm
z^E-peA-<3V?pk%}%T}GN-9u!gyS=^h`4Wrdw#Od=J$s1agzeMi-aR7a?I_P4rS{jQ
zvqzS?pJLsc)4$jUQ$JB(nDPVwv}_j^4|6ZJ?P2de$n*rpGu@+DPwc6LOwaKR*Gr~8
zn_?bBdLpg-(l2crP9%DwGO2{%vWp~%p7V&f2YXp}S%JaCPl!_TIs$d&z5@k%m7xwe
zW!p%C#2*{pvVnV)5qw4I_G9lak65p57Lny}DZ!n$o*fs{@%r#}W=9Z%Fbr)evCJm)
z-`GaXSoW6+@IVNM5uhh04SRzIrF!xis=E93e$9b$^+cYfpc_7HS!iF`Mu;Xwbr&@_
ziM0!gV@hOexSBhzE0W39cwN*_>w->Yj<1N1dbB5e_xQ`stm}(vQeqo%FfVd%jZw-c
zm7r_%-pd`ZpioB11M%ISJ-18NFi=La$mjm^cKHeP-hD7DXlU?*>%DsKPR%*Sv<q9q
z6gEi@fLX)sziSEKlS=Wvg<-pE!MGcVr)x<3F6%RZf*BF)w1)4|YlGgw(R)Tw%MFxb
z84=6W4jBYnnkfp=*t21=bo)D55X|TvQ`F*xI@j=%W+XN(MQ695AevdTl>O7|V%r*~
zc$g7G1_?VT3unaEXp^Po02E))uR%9Th4|bvY{Nf->d3N-<~VMPjG`GG2a0TE0=@;e
zn1a_-s?#0lplC)s271O<xrH2P%2mp=hAvvLMa_<}I@@(<%P$H7EM9UVqgL&<g(#R2
zqG1h3F|dEDU`7ODby;EE+yW(nav<-KOor3#fyQW}bN_XW%T3fP4rzXy*gs+CmL)L=
z0?{o+5zzf_Y`SuW!jGBi|Ms*oM)2||&TvahZl^U*$ut})Z(`7Tc+!OD6^>B6)z-K~
z_&PEpQ!A|)C>nJ#kQPUZ9!@I;iZ&~GUE&p0v&D^Z!C>`!=XKC-?^6<PEBLt(|GM;I
zx1L*4JNHog3=M>bT!u}f%0#^hNG>PX>~ogqWH@i+_d)s@7ow4Zw$sQy(G;+D1UjCo
z$cGVr`bEajCr9PL7~$u~JMP9^kB&B(cf6$Qw$K)8%m4BYVwB%Bk=d)3-5ZLtzxjM?
zQRM{7^)wXa*C-s)@?~vmtj(6g{Cq1a_1OH-_GF8(=9>lb|EPHSXfHqmJxuM(#NZ51
z^0~g$MOm~NIb}w$8ejga%?KMm&Nn4cZNtK!sL7%BCT6Hgy)B$JH7QMtL_)oWajEuM
zKUYd$CX$EXU`5(ql1W%>3hDJOe591ow4$FQUeEhihji!^1S|T9j@}jefO@Gc&#~;C
z;oOA?rb`c~@F%W=o|ne7d|Sky^JN}XfE@~_TmIpB;!EE0Vn_XUL?COBztuWoP&5mU
z>wH=kKYU%=k;EVjYYDIup#R1$;!YO#qXImeFj+q&EV-yDrmA*xu`!qS;0272RulEK
zyKgati&y@H$&*cmOSL50zbN;7OE#LbCVudq4xJ6Uw|A^x^CN`3vf~GX_U#>aZW#5z
zwZVNDG;l``x%K6)ZVy8q-Tk?W$?MSBpnp5$g-AG$!(!Oqnwk@8Hy7-TZPC_JH&}UQ
zE-PC)g8uEXq~{Og*mML}Q05azPBnHAhO+}&`L_d-VC_d2?p|wODWkZwuMK@|S)hIU
zQCFMlPMTvDVk>2A^+CRrZ1E*RB%wjq?DM^{jV<N_re?M((7YY)Z@03go%Z)dm*nNi
z`uM0VLZ?vs1R-u-D+zuc`?q<CQl|^*g}{j|fxzl^L8H>305~L!WuH$2NfhCnVVyTe
z68b!%>s-tK#wTaVI+D;Ql)T@HYIgX^rkj28as6tn^Kl*7WKmK#%+Md&)siIg35~S8
zt#Dn;mI-MI0KhcN{YR2FKId;4`1>ipDx19UiJha8P=L0-V}OzuKH;1|MWb`-j+V)O
zneMJS3#>!is4Tz9eM@rW^<F=GonfxSAPj?VG*J==-2Y;)VT#S9C;uM;G1`VC_V>>y
zGBk+=&Z^`iw{T*vMGu9H0pzFv1#&gN$jV!;Z~+<wI`z2%G&yQxg?;Vo5UMj+9iQ|4
z9UL!?1*$rQpc<vdHaM!u1y;-F*UzzHjQz2YD>P6qTBRg1#^`c^jvXAdBF!GbsYVfM
z6mh{Bw{n|xK#kJN_Mr}4mc$%Xqx4!>)Empvk%MX!2a8-vbUo8XT^kAeRH6<QVR$ut
zo-gTuV0(2XdUs<P4L6{j{e6!d)lss81<mPvRGDozA`_7d$`wl20JjTXGpRO?J>*<h
z<-HSt7~bR_PL>C|U%Xkp^MSc~z2fs~EU!Rr#A!AofNq7#qkHv!+F(~(Y9d3fu$n)Q
zR}(dnq5RIfUs$6F#o<gdS2<Tl_kukXzJ(0$ytqauO?^pNr45A_*eLH9RLh2`db5LT
zG(K<(Tv-lNy`K)S(L)|&-e$7%SBzry9o5`?yrd@D3v86RV}LmG<1hF9^5Yt$WId*O
z3cSEZ?|-~1=1TuH*~IOGCj(H|uOp3m?-tnTJ@IBVl5D>r{2yW0Vk0^X!d5CN4P^ht
zUY!f3rziOai24lyW9<J{wd0jns`e&(bIAOp08ohV(8V2g&N9;|02Ct7@v(82p{CfM
z_v8@4)^e5?3eJa()tmoKTIH)quDa`FMdMv^M*YB_pm0+u8480#hKvJ$=Gw%ly1~m-
z1IQ=+2khxUm`caPC&joHtwQlvgxrn?`@|FhSzH)%yk)U)u+MjukDkeQ$y@RReL@S|
ziiwQ_XvjT0X+Chp-A0!t<?*~EKfwbom~{aq81l6zA1k5{)<2HO1AZ>(53hC>zJ{7L
z_8NH)c)A5+lS!7o2X)%)p-C{jJ!E(<BX=~astOA9sukYnW#qnz)yZpZMH;cnc`YjV
zp?sBt@*dA;M<xTION~K~k5Jp}!)`q$pQ~fWRb8imcc2Vu(etaL<}YE?<1%e6D|h>0
z0&`Ga7lp<B+*ZM#e_oed#r?F=nw9uouDX3*<WKmu1swyIDSnC<_w%_LMA~{!vgFE7
z23qIVt~lgI$+l0VpTM@&H2GMQ9&b1KDfnJ;qa6Gb24f8I=;#hv2PJ*-@@_)mn}W(<
zbMVi%%t#~CBr#Q_-r>PNcZ0qHfFD)K->d!+b}l#)gD?!e(TYzD<^C7jh6xTMt-J?_
z7<F1o9mnshsxpC&;!gL@oqQ;d`}4hd2L(`DIta~<{nKyxdBJ^(EIPZ!OpjlGFKAO;
zeq-+E$VqhnfimU6$aLSq0V&`??uMLtAKS=A-Bh`xY+VNpwyN!eq83%_5Dyx|ah)C`
zY7qLTxhpE!3iU_ENuV%s9wi|?*uti$Y79-M=;uFB4znQ?(DxwO*`C>MS~bjuLUPGq
zwClzVE43A&fSMnr2?+2njw-7NBN&!!6@O34Dw0c9A5WfjW&9*U0=4ovT||}JTI5>m
z5I$C`Gu0g#?uwc)f+OJhQjao!Aw*E;9#mXZASu(J5=LOmlk$gJZZrrH)X5BN6nJK<
zOz}gApf2*4Srd^YLue2pDD0*&)v_H8qH6HMPf}8fZ8NQ?ng>s_EUVmg3sv=;jM1mv
zA$dzKwa!v~u2ikYkoRsQbrpT&$9R>zD1->=quLKrN$T<w9wCByjzmA(uB%pEUW~@v
zrP?orOj(H$8mPai7$RH#X=36SKRq*@P#{O?KrTg01&k@O?yFYs5`+ZWopPD{2-~BG
zqUzzF#m3VfEckn$`6cY!vK)p%7`i1tfY|%r*i=47_)D_@>eNYHBH-!<ZTjHMoVV)-
zC$H|+Y?YhP2g0PS?(i#t+Al$7t>u)H)C;IjJ{EhB`-y1`mut<8>R+d&10XbN2h-{(
zz_(fzHC3|fR{}+KzrNRMy2rvN6VTYiAmZgj{*12#iu05Ic9?$u<OSA&(U^^+svdF+
zchb{74zgo2nyLo5(U73{m~h3AMR7Nh+U)USQZ~cGjcmu=YTLmyQX6RWBX|za{of86
zp-bHg_wUCMOGG*8lY=flz)>yvy&@4_6x2~mmec{i`sas96f2j7Fd4KGe;lo%z+95|
zYI8#GV@F|wN4q*_XzV^ubJUG$M*|R1osu7E|9CA|eHrdmG@15Xpd>;%ecj)dM>MO-
zpfYyvw#vjnRr}ma7auL2mAYIiD8X~&1I5{pk9+E$<M;8I10CAGQb7FbpWt2?dEanq
z?($~s)bDyk)ZLnL3$Ol(raAJR&JeQd*7bBff`1Xa5dhPdDMm`5m=j@hCHNy-t~GP5
zMvUYcYM0q(xgI^<2f*CQJThI6kioFkv_TJ6JD;{k$Tydl6NFU#{s_CGYl}e;wo=gt
z>i&ye<CD;@bO4U6wF)sLo){>y&t7YHK5`0Y4)v^rxsE%7%ra8-6PH>fJR|K__ZXfK
zC|qDj^RxKa;ZyZ<Poa@nU}(ftPdEx4FPh&TYbY*~r|%K?>D&vg%c9>e0t(u3Z{tN`
zQ2cpM+apw1?<kuxDr&{|;%4Zib<nkWc6)7wt~hi~0MyIc>aa(;{Kg4@+EFnhD@O7V
zJps`DP}H71ZXfCn-V*@D5yuV6h9-b|0-)F@$U<&k$H_%N(Z0g53^13>GbZzlMcIKv
z$5D6HKB+DqG(G!pQExt}?dWZ>GQrZ7uQe!S-s-g+V!kSha<F62+X{{5a%o%u)S)^+
zYf2FPWQLpoD7sL2wYaBH##q9-tBe&<h{}}a!k>Ro6fTofbUewidg3Pju;AJwOL<{m
z#4>jEo?{(IUd?-|ej>r6i{q{cb<njif%FI6%Np9SRM5!EX-;}Np!QVPgnr@AK*~js
z3!vm9A8_T$jb7j#)}T1J;sT%nD?3*GZD@0wxBw`+8p}ivtq&@uWx3U<EsP9Sb`Qse
zKVjm_KOdwTg?`3U&Nj_nAK2CJ82{+!kFPUIau|eR=#4sHhz$3?*v3pO^RxP|rzs_X
zg{^n+l&zo`(ZD4K5X=YZ4i#4f4mlW}*~~i|M_sf^?jAn%GfYsLSv}!08MV{ldUU_o
z*HVN-C&OeKE>L+>*)cx(Gn~6Gy!rf1bpXXDe_{lRc9ghiOFrSK?_%Xc4@YhlR4FS+
z&V9Fj$s9-LR<b4)khV`toQOh#AeQ4ImCF(<B=#sk;BF;WZ<kSv=#xu#4g#DCBEw`p
zxjgy)9aQ80QO23!{8=9TEb`w<>`{0|d*LH6)l!I0{alA*Ij=$$b)tb0Z?h@+9q)g2
z8ix^Y<Ca?RA>_#S#5gsa9O2_IDwnlS0A1n8o@0p9M<<`qsRxl78E%|gPF^cL!*^9n
zJ<^N{R%t7%o=<hG5*RUf&-(N{SqDI2sf-4L+lkYuATX)w#DFXU4T&Hxg5w44N~Xb}
zx%gmROtiks5geswJhVSnpRelAGHiJ_1?ixKakUb(%MP~bD5s}kuM5^-_NtkbP4DMs
zYSqQ@QUW}(`ZKDsE^9qC-r4dV8FZiJy8^ky%yM_M%im3kAIO&XNV|7+ypKl)RjVS-
zvh+vT8RRew!a(pxRUoj0|9`AmB(Hti+-nul(17ub!-a6$@eTDk?N3o;*}jx0m7nRX
zWTx94+!2+Z^j)mtps^k8FjB`=?2gvB2-SVwzrBki*w)))B*Y4F?=)AqatF+WSe5uZ
zj$qiRCggaha;^K@0R;I@G%RACpZ%UY<(P8T?91AmF-OWzCF9s1t^v#`uq<tBtSj^r
z0X??2CZc~RZXxIAJ1FI4Pd>v1r3qGrM8q%cT^#~?=O$_Ngs7K&aU;c!yD;xAU5`NC
z4=z_YPdmII-kEHRq|EzM*_OjV{#P`CsHfoDMvWw8mEvdhd$Unft7<Co#y&!BDIy`o
zWa}w;vwQa7-PycO7XwfCjfxS#J3IeIO@BXEiSD_DgyLn=&F9x8ZC4kMOOV2)Ah4QP
z!>jrXT%iqQ`h54AXi1XKZ3mbR*j;8}xuZIw*puhPnG^2!JMw(;=|e_McWs8K_1r8g
zi*>l(le+tDSBly0^b)LN@G()vCf>?i!0xSrbZ7euQI{<Bw(B=gcfRX&N5?2<PJmE%
zmL|&U^1k584*yTsxgbdlf<W{}TZ$j#{ukTegodfw>OBB6#%Ms~HGfzMtZ?{~E9k@)
zMnT;h@}q0=p1eCycaO{PHCy_RgF8iO9(iBa`Q*=)!fa;68wi7ccd+g^h$-3*Lh~KL
zx{pdIdPGd!!O698#8ReVGX?z}tos<@?w?<xUl~jBtp<}#LC77L`<r2VSG!zHnOF@t
zEA2)9ZP6It3eTLht8v<ON15lTayl*(L{D&*bmGL-sAt@0z#e6uUO<44=TJ{ZFslQm
zv5m_98l8E=2pjgJYZ<VBSc7!eBG}~$jmG9s19iWx=uXZdb>14R``UT+@R^OytfD%6
zq_CyO8Z_;z!MZ=EkB#TLJ*Jddtwd`f4(cruCLQ5MBcN5KLa5BAwmgd9u;eKWZS;Me
ztX~KHcN-nj_w}xgClrS2$New1mo;#AS7?g-gM&@9DTwx-ZSTMg9xvTsBYbn6=PGXo
z87e<QbJH3f-d!jt?gL!`mL-|AXRo|0IP9Nxo5X5`)xlQwOa94<W%bQ<J_DRs@?N$z
z*ojj++9=MovK3{c4p}>Rqb4i4995yuWuRU(oXHainS56e{ql7sI1+;}>_@A%93KAv
zvBgZ{R4c6?fQo=&g5%@QsMNc&DpcMmv3~ccL+ai6Cb{Zcu-Ft*?|yU%6{BcfnUQjL
zR_}@K?@?CRfTwf=vOgnqY~`*9sFS|FPsYU@KANB4%-zB#dqwoPdYWB#<ftX>KO<YM
zB^jQw6IXCB|0c%A&TvTqG&PDDD-PsC3f`Hk(rOL&Y~6`}u|4lfMcd0^FT-SeQr0P#
zUuJ~310PW5zO28B3RzT7`>9?bfSO>xebx~Y@w~>5*d>h?MQ+TjKt$PfHh4=Nq}u&v
zz;1$6)H%2vPO<y-&R=WoJc-Px@|jOK$8lHD>#n%v5yVAsFEj+!*-!e9q#C62xXlf)
zlWYNHkC0iv>`4!_vopqOqPkzrJueVw=U~I<^J*Xt$B94}|Myz&Ky!b$2iiIKLRFjn
zUY^2&F2%stt|c`M!<J56{EJ=9OFG?r36C!Rg?KNd$y;Cx0e2FDRlMFhDN$~M;}yp%
z=`Sxqd!PdDq^--ms<+&%rU3zYj(#j+MF6%&90<sh=Si+9$7I$mU?84*i=X1VcOOcF
z06Zx%T*>n~Rk>>{A=BL%Gb&C5QyKpM-TxAHM%NC5FbrKOG+@F0i@l0x3%=9=IBf_J
zBVSt_H7k8M<(*Db7Td@Osd&;uMM?|7a5&xwsd%!)P+t-LR=1a#)I7Hfx=;ls_}q01
zDS8H5tj()D!A^XfEW5gV@*)~8iH#IJnJ}D6vom~mS`d!8do*Dsyd1iPo1!P(G}jc6
z|1y>6M#<bA(pR_jhTV`MGH1Lxbs4aReXLcF)w&=SM#@gcKuVv3Wrf<2RL~tajFdjN
zg^FMg1~X0=Lu#KSqQ<<68p3r8K$*LP6n<PU*~a`Se$wZ1o|pW?fe~fy&O-OK&f;zM
zvHq6^4b+~yNM;WE2lLQi^AatMZJ}jHC4li>^Z*ys$4`6`z|205tHuNNdXefUc92k0
z80_@zrZCk{WVZyJ)*l;sruxY;b<qQRRJZ?7oaZ_mQ1mUmm{GkdL%vaUEhwToj~z8?
z4%H~RMfaXmD9&?y146wnK9)N)rpig;nv2I50AL<8CxjbD+nxW+C{bIFm<X<n=IWV|
z+9$gK9|(|KmA%+4u{mo9qogIB)2fjQD0>)o6<iZqwA()wQ0}e^%MEXhhO&2OIf%Yp
z-$Twqr6|xd*x~OzpN3{;<Bzaw$#NJ5VOR1m2H*c;6S*L=((KD~>(CfvNenw=^tFd#
zT&%2aKkSgvH_4UV7<i`6t^h#oV#pu<s!h2WpO;4B)%`8pj!Iq+02H-_d#^N<9(>+X
zHjvAhLef2uPh4g#RtuNcvsBc~9UqO#_}%VsDiKA#)}YwsddDlirU&x*X7}8ElpN=5
z8MT>7q_JQvQxJg%^7;M}uU8Xn@RyA8EEk%6L~D8_7N2i><)y?^g}5ih^P)x6)D10z
z@T7QlJf6%WD3Vq3b&`L7R=+8o8jp;cS<IYM`WW1!tDu!ZYt{GLnnvZRZ^zg`)=h9U
zQv7ZY)N|wVm%LDzxv5-Af+s`;{Ue-Os;l!NcrFe#2F~A?+`+?Mu=8pQEv~9Be6aL9
z<+AX$tJ3($Q{Rs1Yx5(~l-__IpyxeB>7Ctv=6xb+GKyQFKECoWHJTk>l8Jn}gU84A
z`X?G(zEsp^Z^n7X7zFz0wP>NUt6_qwY0E9Aw*Bxb47tAbmQ!|iO~m+km+JLB@J`Gz
zG>$lE|CGfZc&A+-yr+`At3JyE@4T~gX-x~Un!=1d0M9F@n^r<5IseB4@O+P~hAZ(u
z!p`+bff$Ctt=v!mlc(eK-`Jgkql6!)Ex-dTyTp99q^Mfc4^`E9(9vB!Bimg)jg>=^
zn)VUAVkYDdZV=D8gvEB0R+6%KAWztb)_P4Y^@9?~bFFaLRb^^O;sHM4O4nvP&d*Xw
z?*Tq1l4aWEXRY61fKO=C?Mv_{uY7<{bO&eitpGZyYZ%~jqW9x0yksri^#GqZeKR+s
z5J4ipWv+RC^Z}Q<x2zicmr#giamuR6fN$`L4Fb9m0Msf%=#2uSJc!_0T6+BdtAc#m
zLWGoqA)!kZ@hHjEXT#9h<b~hh)8B;&ig>A6WL4e2@->r*<JOq+V-avoqZFqkodx2Z
zT}B>9vN9fy$j&aKr+q^$wUt_e^UgM-ae%(&;<8}~_Svxs!!Nl!xWIU@PxM^#5*VpJ
zf^KXwvdwF%ASJFI<P(8}^%$#~4g~N`KCxD|tIQs3e*B=%mda5WB<Yso8+{h+m`#c_
z`cShYx1%uXdkXY-)FzYnE(4DGdz?^(p$#s4FMLABJ+7#TEE~|h@QH;s241$VLlvA6
zN9pXb!ccH1V(JWdpT}4oA=yRtP&?u%*Go0<K&qT;pUb}N_47;E8680kf<UyR8#IYR
z|BaoHW8rJB0LP3$6L6Q8Q(ZJI-VImsw7CYW5hw^p-U)mc<C%7W(OpvD37o7;ftgoO
z6LI9Dz^?S>@iYzE1=mEo&MTA)bPctTFGb0Au^L^&VjS(+(bX&p!8m#;S@4q#Rz6Y)
zKX+@%=$!`WuSOGo;+ExQ$+N|1!p{vuj(Zen7-o~tb3otLydkUrujuh9(V`Dql3HFg
z`R*q&?!J*HJq*EjUmsL41BJ{gx(dE~bc`tyG7b3Ty9Y*P)~LyDjy3u2)9?6qxmT3k
z+G+CLop_1Rbweb(n^7>1R)g)FjE`3fz&Ki=d;LYm2;T=8b=T%XWJDQ&z2u}Ed7hxw
z8Lw>60&PbCH9sFR6S^36W+*zcE^bxOgdD|Mq<Z!oRW!BE4xhs__X1`a+r=h=#}j0r
zE*E2QVKU0q1j()590+1kwvvH5LsT8;6JF5hV;hG<gw>8Mg`eI+5Ofs(EU-h@Qut|I
zO01p;85^}=2*AIZdn1O>)hJ^L&g#FibQ6W6;#uIgTwHQ%;JaI>!;5{#_Le2z{mhjx
zwJ%}kb_FpA0@0Rypb7mqw!$tme$5uZi7{Xl8SeRBQNE*$I!RloN<UkA+4amj`Bww2
znKDVKT%)sId;!E1m!L}-84ADA{BisVNH5A!9O9uo_!cuLs|}87<6O8_Z+KCTLI8jY
z?j4{LIfIvD;Dj7$wkAhN$9VSjTJmEJ>d-b70ZZ!td{AA|E?=5*0t@YawuDUXWJX@O
zMWNl>WVOyns<yN;#3MCjI{^;LYC-kZ5XD(6s-n2q?y+}5!sVR5q!8S}cF#@_#4q+o
zj*uY52DwuHjpa9X{2^aNNnT5;5ngb2v{#G~O01-V?jAXoLC~wL-*(X5=e2&umAX3j
zJLv8$*?K>#^O8+I%YXnzW-<<=%HfOc9;lshg|Vq?J1@3-z=p47(4|fJ#hZ81_`-6|
zUx<3pduL>okbI}|iicxU^JdgB^Dms28OryJyNiX6d$Cr?m@*Q)ulbI|np$Cus60TW
zLN22RXkhtagBwuPt*#@y1n$R2f!0iHy)@b&$~hp-bLnKHm%e=)1-x_WE`44C_dTvK
zoIN{Rmeq%^D>`-<24NfZ+yrB@|6;FlLFA)P18_+kViSR+A5ra-x7n`)`%0b$rR<5^
z<`MF_LkVw1DSJ-L4f^9+^6V~YPYl>lneGT9t8^-9&xwgG?>jVwd_-w`Vt?H<<r_z{
zQ$$VP;p%+CIi!NTZ4IY2WlNgYMrnIOXo}zcjjp!5*5+cgR4m-aRZKA5gIy{(KFL$q
z2h)jW8F*Q8s5iWbX!pZT(!T0|BI@D_wsob!a!4hHS7O+U4Y3Qqj%p)J*b{hr`z^x^
zOjd#kd!7*y7ELzvA7{ApWp%OtiIUSm;fssWg$#gX_3?WdDEg^R`B=BCz>DUN!;n;H
zXm%)SSQOd)>!Z@w(iKUO-O-m}S!@$TF%^}WvEN4>fVpc5eT(uoLQ{1$Uu$od&t;4v
zRThoYtvV5ruqSwU^k|20%v)}StJ`RUTpsX@6)z%6+S6YbN7>L*(`lHnC!EcKEGmrW
zD{MOw_B1?K_hszR%l?l_+|zKxvC#)X6NNZM;+}AuXLSOpWK)=ZB<^VeRCPaWKx93g
zxaV=U=lnbTSLA`W$t@Yyt1)%MIX2xWhVAvRQju>tfzLy8<=h<h_$RXPN7xx4R}6wc
z^hO;Cig5pnRq}Ol+UfQHJN_u&M0l*fRr8GH_<v=RaSZxgewrNI{JKDZQqFO_JvFP3
ze#5qGtn&680blB@`!%Yn*zj?2v;6CQXFf-Qs6{;W_XtH)hz%XUfz!v0o{e|rbG#Ky
z@a6NLH~G$du1(YjV&3D6*54v<?||C8`Y__5W6c9)t%KpX8W#9^!N&3J6~-!4+CFyj
zGXcz^xBcDo{}O3y@ai)I$(5l&HteNB6TwuFpIP}N+1aIni(~J=in7W|=xuGSimZBv
zt}+cutbsaz<ZMzAItbjJYlY3J3bwBu*RNy@M$oC4K%*;d_c}n+v93J>xN<19dC;~q
zpJ}}VJH||)kPy_i6Q46Pgdi(roneLjz@7PAk7aO3O;snU1#MECc%>s><GIdMiayV}
zOkU_k=u6bm=jnEtQcv<WS*ihp0z)w(z5ax%s_zJZRYEk<*lLx#r<?V<FXwR<PXb`)
zW3_SorCBq;QUU(#$6X^&9gR-mgHA>1H;c_)3)&9*IWmQT$w(@R?M{dNe9{?FN+kfy
zKr_EIG7kGGX#*<7JT)4-2LbJAP89WA_Tyvio3AS{ju-}ED>*hXVgJQyB}H((o(ACg
zbBF^%h(A_$@v2D<f~<#%j7i;BC&e7alnjg{fSya@;#lMfC-q@HR;24Z{QkVl8|6`O
zg4Ke98<@CNCsE3tX48t<Z$kxc13vGRfdk{g<g+61X(h$A-a13wGXy>-B)Y5d?%G#2
zOPYKfq~+DA=d^qD4iKU^R9NJ^J2XO~ftYF&z#2L4j_;f8hRhE6v>sYHm31(g8!84@
zF*1TsA+(cZWLQx$CY7$h8BwmRB-*^Sf2Rtj#6O3%s@fsZC_OETW8EcYcB&cq4x5!P
z_DZ0uAulw$DFNve7;}5cS;A`b0Lej^uL`X6<?PD@D|m#HKEtONV@(|^WHcoLiaFAP
zGq#kmKl$(=O5;}px|Yl$69L7~6Gt-48>_cC5m3~u(R`_rbqy{z+TCi)LGLxV+dUd?
z3SU$DO2wsbK9;^h-k%A9V#g!383EwQgeD=-^ADMQVh7`;E}BF@p#sdME#EwXvic1T
z&<ELx{Fappt6gia_SG;eRll#17$`sxCaqZADnH?gfugiyhi0Ah=Kt*Ohp=nQVHkvA
zH=2O(DEGhEY9>2;d7qOOL1`$&No-n$tX3PD02$S}20_pmhX+%*-`sYFNyb$(ZPNc7
zk_17ayQ(ttZc}!z(b5E`uGPI*UBf5@L1Sl08-Vy_Kk)=Xp<Auao(`<sxgkMN?5=X9
zgGP0(K@c>`M`7Ao413-Y1dVJX0*K-)A{|%B1%Ox6tvUhFj^sjIFW3f=6nDoT70d**
zC7lZr00rG#=D6C&UNT7d8Gt`VLjKE7@X-WQM(O=wH!+os;!bKGolQ3sm5rh#dDrpV
z;x;jrjnIm+uC3qgAx>qZwh}_dW0mFBo!ai0VIR5fu1n{&>SCTN<66S75w+?*fza*@
zb6sC)6xMy7>b{*jtA~4EtouaUi<08_d~Q3#N2{^-%8=U8l0{+RClbxNe>P9A5ru`H
z@1tye;87`HgP@%niY>Fc?J%Dkt0oHf&{YjGhxQbwwmXoBbtQIYb$&?JPY6(F_YpRL
zGfL?Jkyrf6PV7)K1sfGEpm1W?v6eQ<<?@F{&RIQDlw2ts=If(htF7l6^={yDV^xxV
zf<RVj=Q^FL)R(VwyJ8pyVdzQ`es=%G8YM-zKN^73gt*w|aYd^N8zsxf<dC-tolfeU
z5zE2`8m`jUoE?W0oy!Lydp{`vDi$<Z@Y{N0=)Deg$YDu24cYt2_;SqKIi0tLWPb9f
z_7|b72XkdGy?PX$o2gbeT(zNu0I1A=hI=d22~;(crwPvmC;-}AmFD7Q&yfOetI#TJ
znh2(Pr5TTWN5k_xuKOJ*Lu=owHk5ioj+id{gopNOePmiW&u8-|tHG*`2U}d+SI*|o
z;BsBZ|HR#Pfn9Li>JnN$>4$9oq{g!X@3{OG6v_M~t-B7Bd_w2>WPXnO45gkfR@dA{
ziDZ86SF-ZBXSnZ`&`+{_&O=lz`&*gnVhJgYrj;+ajYgL4qKkaN-KE)|60U8Q*c;oz
zrgfn(e!a%o*9+w}RvLnz?F7p0Ze94veCySeq$SPN-Qtl7@163HD3n(;7Y!5od2e!}
zFc6g0ZD332Cz#+GN5RV7{ZZ7<k7SY9<>40mF9+J6Y2zsP-?FYKSlh0uGkj?gf_`$b
zMr|kC#*9pYk_%Bo-;@EgR$C}j!PcK9VduavU+0!XF$e<D9W~;k;{G>wGu|@rH47kZ
zjS8F&VA1sx46pj}CeIdof1>9~iJ+GB{y{-)74<iU+n8FzkAvPWx2H%8^_?+`b|)JG
zyf?%VRz<tBN{jX-J^9Sm^Nr$195t01S|~xiDnT*X)Yah%B`5^`te)9-W~s7rQsK=Q
z@9t$~lpHiO4ftoZGXjHxz9&3|Rz(>ZRhB6bUQKq27)Bka7bHA&nd2~0(34G*@l_^+
zNm9`9+~)?To!V+;@Slgv^|BL!VlGw5Gqf{V$uuU@U6d3`Bd1X#n6!V@ldw9>)HvY>
zakbijfk5wH+!9K*q27-O6s~mSNOS3ogMfZ@IfPawqo5$5KA+wTE|CAyEeI$|yxXes
zVEKk|U!V_MfmUkf<*+yJ3-&6wGEkFCxcRJ;R`ZfgVdea;mr?6P)swW!fq88ev9wFC
zz@bO|R)!O1>g<j~k7iLZAVHKyoiBKpJRxb5fqziYV`UK5*m6GKu$={qJ+F7P5tCN=
zuXTF?@v4jYu$={qn_C_<PR4}5pg+E@AlYINgx%<mptgAbi~YuV1XkIXsbei*AmkSm
zN{?jW{41j<tvI%~ASkFhoFxnjI^b+4<H%cU!k}NQ+pC?zbJPmSen(S~wGQE}98{DZ
z)|l<arJAfitI2T+1ST-re5uVy6!i31a+3^cwaJZ~s|8khk4({{fp*TPN*P-oj1)Z@
z{#Qp(Js<qK#yT)0YV?jD(jto@ib$lYM|MhwV0)9p(WptnpZ4DQ&-50uDsBmX+Pue`
zE8Ih_aMEh6R?>M?lb<F0iD4PmuzU4&6a6%3Lhr_skhhCOKLgz1#!0h~JNVK|moy!^
zgqM6*l$YME%DUwhH_=b9KgbyYZ%38wJkif9W%U%xEL1w^qnIXyg1~NG%EpORajp?E
zAT^Y0I<e2$GBjYHY6m^BPgD{M#f(dE5muYc2!nc*-wNeT%SUCNMqxGdaXxb2-zxPt
zK_*qe^wD@GZfz)}U~zm_he_l^D-d<nRwVQp2%_bpUEx%o$R`k|YRfoxM5(YUmdR6?
zSjZXX(-ZlO?$NHCfwU@-G`2e9A9<A@^h7=(5pdu2PuR5`Kn#Mgm29w5_h0P9JAyx#
z4nUu_LI}w(>M<FWCTX@iKg_7-C9lwFL3Y)D=92!pD=JOWA^{v#OHUazIlp=IOXtQx
z{zsu!hOwb@OCvl(;+~=R<A>V7%c;PqPUIs5olTyra8FWHM$_b3pcsCW073Nm75om|
z+!P)HRq+H>-U$pA`=i7wR{o<OhBJyR$&kEgsy~P{I~w1^*9PSB3Ug)nxs~|N4F5-^
z*^zIAgmglsuCanH>YB7NvxH_9Abs5(dkTQJr4-&)RIZG<)#9mbpbX6oN&fW8>tfrJ
zFDuEPAv#sa(W8@9(A+&f+<r`>cX?ON|4dQMZY{)XNZd2LJxCgR5inm-lZ%k1^>JUa
zJBY+R<LhVY9!eRChJ?gD!(Nv&3vXj7=+!I1$#@(pX9efqC-nwG;YF^dL_NoI>{~Hv
zE}uKc-&dB_PajcL{2)=!@TRIMVr?X9NYpd*HQF)dtQ=qry%2FK8g86LVWmjevyE-f
z&RRji%}Cg@wPIsOP1jWkgv32tF|vaDr6Rx~OkySW(oaA_p1aaIa)tHkK75@~62l+}
zL~qnd5QE<TV(r?p(4Rd3V`4@nk7ZR+PN+}<8V}iLH!P7Sekevew4RW!^)%2|1&<*&
z8MeM7r?4vHsv9YXQTVw|XB|^x*@I=tJWnyPiA<F`#S(hL+kUoFf6Cl5p(lEkOJMH$
zpWTvruFvsU{x0{i^Ab^mQP=qMtx*$C>N#E%i=vjOA8>LzySzosOHN@sNSfGw${dZ%
zGhTOHQyxdJFQSThPO@A$<d}S|%@g4!dV}AZoWW$Cm^Ff<lU}Q_l6k@+Xg6;nldC_W
zC;CuW-;YQ3dJaqIxmJTz;iuRyqAK|u%#L9%D);G_jZrt3HmTyWgr2dR9`o~+^{$rC
z6ZB&>Z#Or!X+$NTRquo=)Fq?J7s1-%QWKcS6KQ_gYQg?j1r@_6RR!8bx0=6I*EW}`
z3i+VSWm5PFSGLvc;3Nk!BG3DXHu$YVo(d`aJon&qrz^R(e#{f!l!V&-+sh%MqH?tA
zIF#co`gV?dIzRcDjN0tJ+<87a{#)gaMz_ze4?f3QGOznlPuyh50x9fmXRYBkVP}xj
zFbqV|s~|2w>~RuXg2SLHLX|2O6m`Mr@t=6cCZfN)cJUHBb<)ZA%%A_LXr*scEYkaW
z3XP{t^+frljZg}DU^6K7)gHZPYu5EhsP3YYz42&KXH5bvo>Aq^yi<+4XkA1!)e|+4
z_7hJJc73CXo>_Nan`d{V{@@iVzSb>7!@Vf%Jyn|IiBzay0&u~?Vw(ceBu_QP^6J$Z
zBQI=LGKikV-JH>Di!r^dr1TEz=qFtmm0Y~^+JEQ+^Gs(od-7XPr<iw}YeEg)Iw6ln
znw09MORL9_YGaWYl|5edno@*=v<y&8^hBL}uWdx}A-fu(o9hg(`fN^~><OW{^xiql
zDpkajJy%VUcOf^^wKODqmM}DZN=zD*;5E(JuR5}OSpX@6(WlR9eXyS@CU{~q(1U3d
zh(tQ8)m5W3Zne`AMG5_BF?DL8HkBf-c-CLb6RGQ;+{7~T#S~AxO?c#v9bboDU%;GC
z+qHc^ZI{dS>3aUzP=j9YKtK5R*ZKYP<FeV|>#=Xs+p~&iw}20IT(^isyKziMEbN%t
z;Q&MX8pW2nhVNssoej5#Vpvl<HWN%57K;sXvO#8or30p2Rd%cpY;Ksk{^{w8fohp|
zpIjR0ARf7T!aoneBepgS|G@h=S3bR8%FYG3VGstQSE_zEx&Or)gjOBQ%+@);jzIg6
zFp15Qy_Rg01(K(dQzp6{%iMKugwuPt4c^1@M#bQQL#Iq9h$j^<6goCcDOmEBpsCA?
zf2MBU<wJBui~khTl5eJ^eLoa4@nfX+C^K=(%+ncy7jtAZprhjiFafZmbqpAJ-R8Ft
z_<w#)42r~%C(dgVBVUoGMU3QYS!rQ@k7!xA9b_HSg2tml=06jsaKEnd&=oYFS{W5G
zt|~IJ-^6`Li<-PPdAU*9*>~)R4%FztP#r^M?rTw#KRZs{W%@|h)L`Au)2(!4uu`v0
zO^@?JJUYLkM)I6_l|!i+exAbF!Z3j20M!BN#oRZP8ih_<N8_O{fg1f=z^rgvHzv$b
z2drnbSs^o`7S#GUz!c^S|3ulPX23-Bv_T^lG)Sl$Dw{J84a|VG1-UNBiLRJ&>mE~y
z8E;mh43);>tIFmL40Z^C9RgkU4q*I3UgC-I4q#BYp>mcL2QFx!=%2>6BaW_wKB)Ff
z*}33G48lP4N-<yz_rF-XjvrDQX|z3n#bQ5?hipEl1~Lv*263l$Iwwpe$HjPjwcgQ}
z^)ECB`U0BF7HMKek>U`RZ{JN-lC#r`l>51>?7e)JDtqsFE6^(xSURxG>zfTau<Rq)
z2<VhQ^~|Kk7`!z<XHt_EwwTFR_hk+9kAi!EO84Z){RZZDq4sJ@cu`~B@uQpcw6SDp
zoIz1W&uYnKa+3v)1ryBzR4pW{&TQIP8rygpdw${J<?#!kMS}7(ET6zFXWGQnP?EeU
z@=mOhwpsM#1)v*r2XvLyS@g_na@MN$w@YgG94y!vPMrl6=F?fwSrE-{^3YV|#3)$|
zbSgr|1qx8ud@f5@oYL;O{<zX}ZqlxF7BkT|zZ2gzRN>>I@O1H_qvT;SjQx=p`YEQG
z+0kBS^FiT<+F%qh;fFK|ABwaXG}A?5km8~AEgVmRac;+PZ$)U}fN`YOIN{mz4#rm`
zGm2WYQw!-!qL^{S%@G>cwZPA8Qo1;!cd3aBLt{W{73jb1|HIfB;5ZC}K=4a7)CN9w
z?>{xka5_iY<^j|WEbMxnDk5&@DDx&^1-3N6Hn)xb|F-Kb4oMRn4rY-Ux!#4D$P3)V
zgVF6FT@O(6x1v8OMXpUb8!W8ZJL8ra?~N*s$=n8hplpsi9ue5&1Zdu!8acV^wKpQg
z583$DDj5G_p%mo=E`xv}?iUV?bO8%t<JnrFt6#GEg|M;f5m&-$wp2B0-jX^ysnRV2
zH>`LbE<bpaLaJhG{o{)6LF*U%L>13pu(KycT(ts2VR-gfTuWMeJ#K=g>h>=g2y}w>
zu;U-y=OJGTo8uM8b5Xx_vNj?eb$cn4g!w<8-c*5DH8VEL<zuX?zzaPS<9hU59p*Yi
zO;)J?YT%V#v=83~^2m?tYQk3760>cIFBPfHz<y{EjrN9l$hKU+Y!!3(jqNtQw<^<$
zJ6v2`6e_Od>2_cbC#W02)EY6gkqvyR74CeZa0dqQ0I&lNNs|U~JH*iB@lM9iFJotd
z<RA>hz%L=6@c)l(t=U#Kq#}60l#M-y++$#ohUh!G!oFgZoil+Mv8h4V6KWtJabrU!
zisk*1#3$y*cRJ6=NxsF5uHq(?^9Rw~^N8h&7fqQWUKEtLAOjnW_|C9hDr{*FpRr#S
zXZ=d=G>oBK+>7cThIw)3_r;0P@#4hD`RR0(M+D_id<J4*L@gj=VxuFEc+(-GY8}H6
zh*rpYkuBMByh8N!wlQdoWneL(Oe8C}2?Q)&Z(W=Mlyh#>5rP#<kUXtd-_KOH$7qHZ
zcPc?ggU+a3Wnw&Oz_j{ow#a3xSC!2*cFTKmeBYBeTXW;Xfq4*_>sN8fR`3qyyFOZe
z9<*y7meZCfBzWJ5>`5lb_`=f!1Vq+`$7|36(8!q`kgW9y*VA?fmW@3x(w`qyCR}j`
z>1Jy<ccBcb&+6-DT{3lNocX#hqu;9o$rJ@7>Lxc7dT!;ym3y-bI!a>_gDT6A*Npf5
zt9<_~e;7L#90y?-h+ZiPV8{2rSf#+5th(xm16a_+-#12mEGc6-c;v+EZMXoI*Q(~-
zRm7_ys*5X=7LxHR{gntS<9=g1u0L0}a^o)5t<BSm@{a=rpf(%)tocXIuX7!{toW;x
zdc}_<4XyoFw+PTkU_gf2mi9)#%Ig!%y9r`E^;;RC>8tP_jhQy20n6(3|FrBj!-qH_
zhO{JE{#B)vlcY7a`5_@BW#Q<WXM8Uc;)M8lQ8<TBw9w^Ku_a8rb~v4BnMu)lY_{KF
zX&))ZOju@Z3TH1fm3){JvRLKvhR4^@-Yj<9XY35gJ#-ecNwM+K1!%sKOpp?oY(N8=
zyB4}szD8XBWD}VPm56T7ujoLU&y*9CoWQ17So6U?$$Jtb+B^jep4Saaf4gw=C16nR
zG9JKr{gK%X@|dN4y@WU?#eK^~zFdNw1Ed}dsJ;1459GY{hNJo`y`e*$qaFXn7#k;3
z^hc~pLhOgKGs<xghJomnY$q7F|HZb_@+PfV&C<XAL<xx<>^FmI^91g^CBom14(C%^
z+&R=Q1d>yRh3g4=o<l=X|1+!<o2P_PF0Wm(lRXyjbK$~x!(4tw_%jTduBh8jNCX9?
zTFj-X`u({=Na}bEU`4fs><NG#ea$*r1!CD$0YM)jVV$s@;g?GVeN{kB0hBhyK+xUl
z<f-;QzgxRI1(7axx?}R>^Dp7=1Bo7y*(7AE+KwcAj#UOz2fu##<sz=jc_8a%*6`EL
z8|_e+Yq56;LNB?6J+jAAAn2s9SU!oW(?95rx$(O<L&2bHG3ZCAy+W_CU45T|);?w`
zhOUjRCqY~CCreP|(%ae(6h;g=tWuVje<r<=#AlLQr5brufed7UO6!*?F!XX%Q}Q47
zb}umW#ugo^$g_tDhHlI&*)(C<whJpj^k8!j>?Aq8uND&hyU1@wf}&rE5+WVk@O|36
z7LAssIVJc_TfSGx;xlCjrRMuH1b-Mi0~`rq7zTa`OiOeB|JX^Oadn_GeLz)+(vsMd
z-MP|VvMEBjD&F!a2AZ_njmwXspw16WBB2o%XRXe>@cg&B{TVsDKw^#NdN)(L=UEl0
zp2)yF;W;1Z$Vi8R8K_uc$jbCKjT<g&{rzdP_geR47KFxb=QwYxmm}h_oV@4pijb|?
zc)$^-o2^(!D1ybZINixyZOvmEE#?B^^g&TQ+0RVsA5Nm(vmtH*+DC}$(L_#4F<&ZX
znvJ@wR@FkDE~@GxM3p0iHr?T&7gZslOqaYP6<qfJWNCU%F+m<h%uTJm4jC_*D=Bp8
zW^9G%bmbjSUXo%{Q(4a88IM7MMP6KnoQdmT;rMt-$|0<RgO6F|9W6+kbyy>_WXu_z
z<<>#3+{p{|VAeX$VgGp4!?&e*dh8}u1fA8}LmONK2!tZ-z!t{OS6~qpH!@w<U)J3>
zS9E2CCT)9RA}@I&3QhWkU4I!l11tnW5QtuB0cGX>7pu25V`*=;1Mt?+VEBUHMY1+5
zHs~z(5?v?F++z>?qt6eC^f*{oq3-nW*Ozx&4&osBd518L8$AOq9cXyI2EJb+Rk~<4
zJR_Z)?9|fnIs1<eeF&Par=!TG2NU2poDxC1359**SDly1+7ha|-UqO--qLXha5~WY
zay?Uc8R}q5HjTwjL!EHJrlVFvyBQxmIXT+4j3UoG*fc*$MO>y0QI)mY2QGSO2X)2-
z-Z{>SPBV;?v50sP6kf||;OW3!jB#4W4~aDW<Pk!FUM$eN-qBj*X+lD!9K3Px>5s;%
zKMjolKRFD{Q>0@x2(=lm)?V+Wymf+f?}){{fjZ~uUA<xiqvC>*MeRmo08^(=p$XHJ
zUE>Z+-7xcEEvfr7l>(<u<EFO%_GYXRh3)@$KeRTep2V>7zg7%JW9u4}4kDzEc?UoY
z8yeYwQ#X|Ng=k%JO4P}zKWd~)eLNUB100D#7zTcc;6ma5A3NzJ539XBcOOudmO#S9
z<~NS=S~IJ@%&NEBkXhE!5lXLm7uUx2K{uzaf<=@wa8*tcCe=mLq6T)Qk>kj$`m@(9
z|KM#ADNNz`%%eO-4IiP)qd{FB9j*q}XO+&;zFMU+u^yI`Z}YpIUAzdU|2$Zu<<Zje
z;KmN{(!*d$Yt5yu+fcC_lWFzKX0LBH6rq<cM6U(su7_FSe1_p>iUy7Hm+lY2dlS4Z
z8rGfJ{C{6(=8jJiM+jqRB(x~*Q-O(qhJr{$*R9O0W%Hc4bYzY^UJ{#Q(1-3FPk5>$
zKLg4F#Af#O1FmWDw06pzJTq)bl=cg~Tz;t&n;Q{=6g`Y~|7Y3E`f{0DFCX&i@+r7>
zBpN!{+APF6jumA<LPV|g*80y*Gr_Fy!<{kzL<xwDti2bxyqWn{2ynIIeL?2;&i6u?
zG}`>5P6st_xyYz78oC*kztAdJE->lM#ZABLQT(Cg3~(a`VIcUWz!nn!|6`|0oh7={
zE$IU+L~x8fto_B-sEDM~S7=2Ukn|y5e1?B@6H>d4TGpK8HT!pkar7VgGW+w`LPl0+
zHpF|#{fHtJsj-Zz<xxxWY?z8ggh16r+E`fbj^z9xxc!NwOK@tprxUhnbCmTa>+67*
zEb9}HdbRL8>oyXQ+UG%KR{3{^QBO}A@VJ)N^Yj!T^=)bd7<T40$%A0ctyu!y@@)&I
z7Ug|`dFsf9U}`^}-U8)jP0D+@6g1O1A{h{*nhxp9Nkz-2S#R4E5M#4VKy@3#RSu7?
zJtJqqs%P_K_*kW2blc(b{x((a2h@0FTR*$X>sn2JC~ucMi2Pp&BPu6+0P6|5o6v}v
zZ%u&p3YaS-#J~rwuHiov&z*Tl(Pc#LnhgKzM^1tO)`iNYkgrwL_X%L_z(;mavEfPZ
z>LPh6Kl$g59?j)K=RXIK2wKg>xz1!`_xn{|l$;9=gD?z3uhcXtpZi~I5|dvMOokl*
zF?FSJUt%9yuMqEr1osytaJ4Szr=_*E0ai^6)QmXuD@3%5eymQ-ZS`*?+eHr|`O9lz
zfognjYDhoabj7K&1Gu%>ZO<absrkC_b@>BGlsX1}?Lh|3gYH_<KujV6&sz71URV(u
zLrZUF;uB8&!%^s0cDV-6y|W^wAoa=C^~y_@Lex9o$Y}Fg?f*?&^laHAv%_Z-<VGa}
zqmG6g_Tn8<-GckP<ogj5?Ve>2jhfPQ4rTMXaEw#$nkm#eSu1^Ra}I5}+24j&Cj!+e
zshN_R5$WH$5YxyvqciMrmDWqPT-P1hw=GhjnlZmplV$geaKjJO|H>0hFm>L8JnS2V
zsbRMiT`zA*@+eKWM2Q1L`MN7g-KUTW&{_DqgD5rK>2D{kf7{gVK}uPGXW%o#mr#M~
z62ro&9%)-&Nv4O+m6ED?usft6b=5sc(e8LsJ<d||L&+H>ISj%u^h!1nG`au9_NRJu
z+KeW9fKCeqY|HW^!bCfms=nNIbGIy_?jf)q4*0`&JEN0jiP|F;9(!4_XjL6wOyaSQ
zCm3p3pKc3$uNPLZ42*mqAVz|`GiQWy$m;Y~F^MaAg^p#mn+Q{C#U8Jarv3bE>O|)c
zIuq*sLa#>y%0ia*?NW2OB7{aw90PY&>`~=YXI*-`g-c{LnXK7VWVWRCWJYIR`6v4f
zO=|mt+CD=ltxe1NpwI_1W>JkNzhTFcD~!s}Qny?|Sux){Mx3({c#j@^V>XCKA9?z~
z%stWJqwXS%)zguwFIKCVCkq;ML0d&?9$NW($BoGbFH)R=(V*3#n+8k#bFEV^<d@Tg
z*go@ZAG<~aL=9>vV=c6qANqm5#K+KLHSU!zs+fv63_<-k+2Hs7W`DoHLwlKwpvQoy
zqkgQ)dZJYet-9C$W~_x&eQkrzB*BTRgb;0a#ArQXTnXw2_RSB^`X6QImgF!9#K0^0
zAt1j0#r9)MjVmO|_yAPd*uWs9CN}h8ho|lrCJ>#ugGhPU%ME`+dw$sQoynIQT5OzZ
zqmRn2{1;$r9B)qdT>J^*hu4@QY(`kBZwRnK<SRGj+6yO>$aie{0t@u&nW7pMZC%o0
z`y3U9fuKfvqVC&S3akol^l?1m{|HmHcg-w>*~F$vj=oqzE7%u_gH|I_2@Piay4vbQ
z8<m8Ga8+L*4;!a*d5~DCzQIRJzG}4v0X#*bJjvp!-q_N)kl%Cvv?YO3a(xI_^?;ku
zD=9o-srE}An2vr7uBlSL56d5g^^G3=4AdZN)SoPRTLiNSTeUj~v9RSDs2@w_>MTC(
z`8_ukzllZak0)1GhR?SpwosecI|VhqDj|#Kp5^|X@obWXByEwphys%}>b<k4$CcWn
zC-9&5^hepbBq<ETQ1D9rNVanSi@_A5_TVWV&W??%NFa{Xl3OLkFR!J9YC6iB|9yFR
zoqD(eq#9W|oLbXGgHsP03;f98WQnQAI_CQ4I%OO)eZNJc9p0g_sn$FxjZ52yO`3)1
z$agYG{bjSzu{yEo6|O%7N3Fd!Yip}<a>~o1yw`Ytq4R6jjeJ)prk?qO&O}O6nxhQg
zM@BMl6=^*mqHpKC2I@Smmat%;lWo*ZJNFDiozShX^6u0t*@iCmA#$mqb17P>GtsT&
z=5=Ub6Y*KVD*y7awxSh8Wp>?Ui=16pU;WmwC8L{~w#SCtt$j(xK-JaSO;4cFPz}nj
zwv-rEueHy~wO*JJHHe6;Q$A{msYfq&u@syd+sK*V)Dly7reFmJ@n(^4(FLlJ+!g|j
zA}te6Gc^rX!P)MRL7YRXk-4mqf^sMe`VTCDEfNSkKgmHbWoa0hk&$<}>&AR9wv|zv
z9aTd;iS_fzeo%HsNe+WB480P;F*x_X*zS)W9oj1C0hrJ+Q`@pE{UmpjZEVIo9j4~Z
zRh88mRL!>jddu7F)H?$S@Ok<ldhJF+4}Eq}p%xwEAx$9#T1Swan1i<Ro<MyYKpfJL
znbUt0cv0($zzNMNU?oiIrL_bXt(E_1ZWGCl4_Nwxq_vZpYEZG-a3V#G%OT<PPE7}M
zSM7I;pLN;no%j_V=>8q-%?y85NcE5-SRWThZTe0D)u9d~s962Fel9NcT(%vUQu&ag
zNiC8@pO1t`Qy}$$5PAVLdxy>J>`n_QRF){)7-nC}4J_#fOoj0Go!_(yJ+&f%sNW<q
zXZf&P-1db2P4@Qb1qF}~uiidDVCtMd@#<43_3Pvf^5(cX8(ZFwF&?G;42EX|U17@I
z@b+f;L2ZXN*j9lltoj8=fs#GEyRX3NQo&m)t15g*Yun>Hg%|lfz6@&Y)j+F*?l<q~
zZ2NHXzoz@6?97fBh(Q?I(i#@q+ka!pj~+QDN>Tvh6PrT_8G%;U&d!@{Dp*KcY(Hu^
zraSu{DP%nwDm^jgmN#*TS|2dzmJTN>{kSj;18m!Z72TZ+zg6><la0nHo|CN_Xe}sH
zUOyhJ3?xlAsr>Sk4h2W`n^)_xBvr?A|H%Z?;l*^3*6MVo^mM0}jnC~Q?Bf8$x=S+;
zE|Jx50M-rF*Up9ys8qeWYQJ?!El8@FZIFtH@Q*|Bt^I{pExI2<a*l?2-pnF=O|a_G
zv9zMZuffp4O?CHX?K<gyc%0<ZX~FcxC<ADX#XC^Y;s0>Ou*c|*XdF$3UoG4+++O<1
z#<a2Xg0nhz8<LW}EN^E4w@$hKks#_a{d(oI0n2Pv9e$JPS4M_&LudHqJD!bngx?fM
zN_zib@hUAIZmO^^uds_i61)XMm84Bn6*29znZS_rV^Y5e*GIygk>1V%e4V7ZCRmoa
zy{ycoHE)caQF6o}3`4IJ2Mp%^7u(%V{m8Jb;4eR(Nl0RBAxrswdcO|unFIyOY@p0q
z!_oWX&0-0Af#T~{9&|f^G@ncu9Xl3<@k22?hlXvG-g!P(HgyjyY)h(#8R+e1ou*!h
zv&NIxEJqVP04DJywfSmg?E(?IQ$<gc$u4C|JgC4cEF8QByFBjq_*Z)7T_Ng4?rSy&
z`7jMCAsG@&0iyvhc-Vj*M|Dra+r<H3ALb?6UYPGF5eS>(<F>ITPBqY+9*+}maR=Kr
z_E!VDEt}h|f5bK(RsL-Q6~5oUG+i~dT{I-@TE86PW#Ue3yX0VOK|aH(j*LYw{J#A}
zlGw*sTJqbEOjR4UiX&UbnL6KB(xn)k5ZW0WQh&f96^bus#FyH5k)T^cD&)qjoHHG5
zi(S{Yx-;r^%fL)R$w)QC%uG_US_0dRtohhXWvAILD73kU56luq)vFs~=5+Ht%o%HV
z?t!6%+?rZ~+n?Fq7h`9X<S+=s&?_x=qQd<zwqJT=hF0wXm^LIBBkU(<?URH*&M>GD
zP!<!q)6DZ^dHWdy+0(L(I3?N056_nA{D&Qn3MW&q@eI$^z^HQ{{)oHz<sflC><{SX
z%$GU>7D8#XS50-4el_Ns>&$(STXF3AT#Ob6QjR@dr20@MI_k|T;u1R>?onfACwr?(
z7sohi^eZO%vdXRAxfM|&mV>BHHXo42FKj+xzu4Mw!smn)cQ}<!WB@@ps!Fody}UUt
zFS?a2>MeD@vm3edYqi#G?#LJv_veH~mb$kQ9y;T=;~lpe?+@yud+rZ0kA-4XN2O|h
z)+SW~$vkNR%Y;%jAP5c!Toq>5Yc=Xp!*(&4vhK<ctB*fh9TPMGy`J;|fv&C$6j#r4
zvHvE#2v0^=^<ICQC>W#vHf7|Nav^_wS#%b?%gV{+9Qew!bk)J8{0U<y^zLUY<zvb@
zp7m}TVaLP#FGQw)#?B~*VGxF)SE95vaQ}<#WAcM_n#TbqI+X_UlGuJB#b(%t&8^>>
z8To<r%LKbc_$RaOF@?+*uYvqZyW7Tmt8`}ETK=2UlgJe~A5>>1Jc4#J|5lk|tGU@n
zbZc9-r@BA$&v%NdNagB+Zt~INOsj4LjO$a@KHu4KWu!BBhak(edzerTPU8{>&@@dM
z(V#eXgd_y)HqvoBUXGkMwGyX%J7QW|K=&-3F*}=I2Be$1Terwiy&}<<N%wMBS-3$A
z2orP@t52i^&%9^p*7maW9cJeeO-T_(Coks4^BJuB+gS+qln>#lf6dLRpr@Ljw{d(o
zP9>6(*j6m;89j!f0#uAq6T&?ZmqZPxX2B}8r@JS+@Xsd1p0UgeGlj|giJEUO?x)V<
zOJ3942w66_6vtm(pH-|q3M4aa+@<cV$kmwO|6DC6X@KnZ-Q68G4HO&Kki}29<~7F?
zZggh9denPTCj!AmoK(IjJEI&1VHk#9sSRC1?|-pP)BHLCv)JE$q7|qJwH>>M$6|<O
zB$x_YaEoE5Fzic1Tz_{3VT+W`m4{|O4OT28huFMhdYJ;R*#!HoUa|z*pE3l%;Xi+X
zt-s9vaoO}EZYkheBEfyl{`<wEKvLz_;4=JVZlca6EIa~s%txu^1TnhUdiK3D8CGM+
zWZaosO>9J>{gvUKfY+o^#n1@YJDSbaK2Fz3&hPNonTjFBgAhn<`t{Z!!=0z%qu+Ak
ziKW#_QR^q!6KOU%$bIMZ=tY<%2wU$=0v&gIax8S&?bK+SFJ#yVTdV}?@u+SIye36^
z&6J0&BZ4ST4((|R@#IsJ<?eJ_rv|3BFyfwvTP;oYl2>(xM7m!s8z`U(b@qGx@{eU6
zO*bddl4mlix1WaIwi^|=wb1g?`K_#8q!49qb!5B4rzn?D>j7a6sM<a6Tpe;B&F2Qb
zvssF=mXV0)Flh3Ne|=JRF1QWDFbus?!?b30|BDR;%I7p4SnmKqK6Yg5nWEmVOd!hU
z#PkX7BZ`a2sTOrA^!rCT2q<JnNjB6$ixFq%_g<8PJJ32}aQd;=kf3WE5=FjsX)v&w
zE_|GftDdGBgX@b2(x!S$<A7>b6x6%DB+B{(iw{k(Sbt7DL+Hc3c81_E>M7n8wIMqC
zNQNrDCM;6R{-lXOQ6Uabk!GE)0P69_Dqo)zK7F5(n+Jz8b>an2pMqBsu&rN61oA%-
zfa%6KBkhubyg}38f9>FoQC$X%Z3r-EOheKypO@~!*^I|Nsr!X_zn1Q6rt$q@Uy}%d
zr$UG8Wq4dqY!J3mvkiww=hG~`-Th<gBz<$mtfmK}A~cr}@~iKi&|V8?DD)BPn|=pI
z56Bbyu71zKI)Z;Z{egdO{av9zIBI}~H+>nE<I*WQ<I?Y#WDM`gjdR4kLKVZJsqgWz
zQhIN+*Pw^zrs$WkGdf}rhGFO~ouG*cGW##qFDa1pga_~uf`N-HKNpk-$ay_^5mD(2
zf~GM-V;sK~>MAHh?=n~PmrIVtvDZ>I`t$NTD`%q$V>+RPzbF$(`7=SUVHH!zd!4e6
zNNf#Xjs`_(5y_HmOqV^A<NQ8_xe4^KQG`CQn}~TAHj1ZsHAIGRpy8jTWN1->3;H2W
z{kf>hu-sy!#u7!vz;7fEUo1lO(w5*EHAw<CYDI*|FYgf{px*osMPa{fvQyLTcpHdn
zUtfvMOqIc0@e?P2zAm-aUkAj}yWLx>fQ=v<HNi9;s6b*My?GLCN)R1Djf*TpvIuFT
zun|{|+70G1%QRVyZim+gpdm2O6qs8psf|ss(Z*IBu{lS*S-aEt-M3MFogGe9J;Sea
zVjK=N2MKcbved)bD(%yx;LOS{J!w7%<dep;c4^x<ko%xuWzP8gD7&^K2w@m>C0kcR
z?tiiUS*Wc$7!Sbc_-Gp-!~vDZ$gZ-AR2n3jFMD@sOmK*0jyKY5Wc!oXD$|hd=Z#cy
z1AqR?6CE+t@?N&#z4T`(Wq+{NmDT9<)R(e9sKaoUv41${@}cb|R4iM~$ltSu)<~=~
z{zg)R|JXz<lLZIMB5#EPS>*=NGF2li#4NLeoPLn7s6MMjQeZu5pUv(3DLxMu<07Lv
zoEZYKd7x-O)~6Ls3#5~ogLrPGh#81XPQCdo^}S+~pam*gT)V>qd9HbRt0R$mPSNq5
znIMI%qe-h?uP@C4$7mKfEs&cN9T8+;>>HHhIh8h?TuPfC&5d^4h2mXmorh|kf_BnF
zMYI>;(e4DG_+!sCfc$Z4)=HPD%N9XsIaltQ18q_AJ8L}R4`t)vpyX*1j<hR1;reaL
zuugCO?;v#yo=>II;kqb(DLc0-hCvvHu9N@<vHxQIDc8-TjxzwKhMEAfEZq!j$Ex;1
z3~i4W#_)aE@qOsT8qadslXX4;Gvzs{GLBoMZ>c{Kzv#s$&2(|8%nRMoGE_d*f8Fw7
zB}eFYlviOcxOnY|Ix<~fLSLG8(#&C4(V#lDm_1C*{tSDFv0t7QBlD~f%;oCv;9>}s
z7QQV7LfpAvSVsC!C`<cY&u>HFJR5|amDeP8__!3L<?Yqk)^1E&1jjl)-WF2qu_nK5
zjcy7oTQ({MapR|u=-5wNBVJYzzRRk{<Hp%HV7DK4qj;=PJYBG&r@=$kwt2D(O1g9l
zkQn^^yFB5~VS$J}h;zNdIT{)-_D&sIuFXM3ZNdwgq4<PQmhQ+RC?ixU><_)3Rx@M(
zxw5ogNp{P|5jsWFK1_13;hTPdQWb|vqq4WCy0eF)DIdzt=!jtuhM_YRE>!HlSbwT#
zdPx;BfDac3Ol4WVvK>YDdOf6j3C41fMZLF?Wh!vug`i4X*372;G)<(}fbE!v3>J?n
z=+djCoEDImzEbhe#}k2RL4gtdfjY9s?_Xll_QYBlKpu}PWHN-z2t{d+o+L!3dkJ_0
zuw|(U8Ae|CD4f%H+!mE-#0cnwyt&JaBtt`QM5Y~iRa#9es*uU^5DLAI|4B3(qBrHM
z*H7o(W_A~O7suthVE+DKFt>+}&fnZ?3d4;V3LF$Iw=#CkK=iI)7q1eur3X)hzGvvq
z#yad{@Xs)2F{8-KH3H|M#lnt^A}_JW*%(6u$%x1;+mlyx-<D}!dp}X9z1iGUcslme
zC9e_rPnv*&u*xR%#7x8#crv5;Dk67hYPM54L2In#C%-}EQ8eJmh`pS1jVZ4UMqJM~
zt9}@}qAQ3&5Vn%qmYV$+yRXD6-lYt{qgoUVm~8t_F@y*#v&<d@Y+erigqAf!!9&}d
z!?}HF(GZWAErt+?D}TkF&ZYLY52DIEv)9~>f1%!|E%2c!aP;bb$-&rM2Z77WDR*Vd
zI1GZzGnu_QjP$K*Qin}DAijJF3>~5b_lpu@+2B1vPQzX>&~lsL*Ub7pLG+eZ^Xf44
ziy6Hq2_uzI!gdLQF!M#=u3CEmapqmfst=nFK&<&({L$hj@;b2)f3)QETCb>Qp+_<d
zY3cb&14OMM<}$3`>1Svr-H3}9Twh^=gbp`c+e?9Cv@IQkGKrsA^(pU7!``Ld`N{H7
z+OvyusLzy-7gn38<wJtx4W)n7O64u6QF-!uOE!U+ew2|6&$DQFr&yPENK8LQ?mv8Z
zC2HcZ{ZA0yeCUDMUGhl0`DZciY5Ae-43i}UVHkX+Cswfczu5kG)2~cfgL?o*iKUiI
zn%0%{Nu=i^cSNZebw(Qo_c-ArKjq1d%Zg?0ZlRTzP0!~hyAC|)=Z;i81@aq!`qMKv
zA2S%}2_6>8!-ZEg)GWfU<J>Iua-v7NE$R~;1oVKkY$=hKJ=I=x%99zJ%vwhH{5J5}
zZEaSkJy`~U*@DjBo4#hZ>sf0qQ;1ckIx=jR43`H1O`7c74VwO22K~IEvwNgJ2@kq1
zw=P2GUL@xdouHp5bnM+G;h&x6x$yJX_2{+64!<86<oIM{Im#fjrb`0m8h)`W)Vr+1
z=8tolHm{)_6`;7f?*Kxcobz;;{C?{sdwBsDD)`Vwq>f|8;y7?L>0{<eKQ9|?dLfMx
z@KgEEy!G4SPM4hQ$TCj`L-5a2)_YlVAy`gy$zC!Rf_(n(tNk!`B{&R&FziblT@(NR
zW1BR^AkrEhfV!owAx<356?)tWM2(HyIwR&h=!W``y-BjYk+5*a()PZE?P6;QMXcC$
zS<gZ!&&DbSXNtB<R%}4wIS6-<nCzYb?>9`pc5{ZN=scbnZQ4c0hoUpqg;j^g(xyU<
zOP?;y-;GQX?x8!=s5})BB-}%J9)EIBiF_h2HY}E+BZ<V@x^o_~v}fqxEUeB1z9eg*
zgn;K7Dz{vTRu|aOVYO^#<OLZT=pjH)uQD(oZR79^o|vO0MPz`p4uWK(RcN=6HLpmB
zIUlBLyi$9f%6pXM^!JQ4f4_P;F_<EhXNx8}+Uj?SKW9BZSX1?#2H?Dm(4PO6_igze
zuoVV}Q~+O2UZ-D4XwQ6`6|{asn%iqBuMql$>Z6yk+pvuxvi%W8U&^ikiD3|geQ9bb
z`u~rO?UvNT73l+Vv=}HV4S&GMLg-aYy4R4<%s^4Bl%j~2^eYnQBUCa=V@O#-v}Zj`
zBFPfn8wcYO9?ccW@HS+>C-27QaL6wWK#16CS-Es3=}^{$^vb>JC7r<v>>5ni!cHv%
zgG=1(42U_^BRr@x>~a6ej~P)&CVixUVaU@zZ<}1KF;<<`Cs^=_qg^L#sQYPHT*-G{
z9rb=G6UMG$BlJM@JXoPxmNL1NRGDnpx^&^9@@N}mb5fj1LHb|Y-#ng}=lENsIHaPX
zJ|1jr$n$Ol=@zMr@P5{2cfOrG6lbS8+|vppr^RW4&C%H4)dO8Kb?03iS5I#$Nvk|=
z#0LjWz41&iL-MbTPQe;(E90bw18e1;of@J;V*hf&A*?EYrI(oX6xCpfk0#QOI>ei@
zGr)lu1cBg}ysL=*|6`Xlx1(uOun#a)T*0omgd@2xYsjJXxy9qaB-+~R{1b+)vN*QT
z<xqm2u6jOC(gwV>O8d7bE82P)dF(kDy=QsJDc~6vJ4xKNaj?W_jZrA_`fk)~yl2E-
zPdrd8nSrpPR97ze^_q-SilgPkiiYHa#U719qS>@MsQO2IfNH)Bgz(s%XH<<B10&9?
zqOx(+i|L~Ke4tu4=B;sy0cAHpsnj^u7&;p*{YUE9FP&;{iKFalQ{@BR<K1fDiFmlB
z<^AubQPd*)48p8yONRExJ(p~B5!#D$iNW!jiqLlTK4DqX&uzE3WZ%tnGo?2^FLMTz
zwq%hRnSZZxoPmb6hd?pfR0_LZ=(xqn97>yW>@lxMJ(;SSKoyoo=(RWmi`8~RiGCVQ
z@Gu^YChirhy(qhHI*Dp(-Fcr{3qQ)P0EuA`gng-<7WDrg+ud%7J?RL0Kn?|lF-7)W
zZeB;JYLgbC%f~HGL2o+}T`X>ST%c+%7cFG&T#tEFjHvUq{0O8_IG0`dR|u%^P{^Wj
z6tl=@DA_z@L`28&JED19I1qYrc11BRkhh6+j*$}H9W88>HuIVSecSE$*XFff5E>&Y
ze2Z#?Pp0K8g2a78T5+Fa%iI@Q+oa7IJXEwvjeD)O$QUScKX@qrg>oh|Gl7$Zl+6|{
zeC(1HOmGISZAF?wmD>W>P{=@y@Y!7=kwne|cvXeG7I7?ev&DINIZ$?4jrRW>QD^W;
zsrzBcdHFmkb)&h?ogVHvlBv`K^2(89N9*+#kRwO-@Z7Q4BCY}q31E`u+}}!y-CCe!
zpEbW3I|CesK^O*pX{PId|9@<ird$wcNgfb+G>m!1b#g{0#BNIxaDE?}F`mlt5449K
zvZvC#BlgP3!Xjf#le!mrKTH2cByDZ&W-K0xJA?JwEPB6KvBHKRBih%=r;WRU$jt#!
zrE?-78qg}`5Hh!O-d06r8}(zUNn^&rTwhgCX06z-n+G!{Td=*h;KHRe*1m+i&3LN|
zL(tWeS`Qq@rS5K`SXUQD><_@qhnN}gdl&2`k9j5?YJ}lg#0|3Bh#Q2;&BY&Q=}7w1
zH_W9nS?SnP2J4tdlwvK=R6^zUCv;abR3$WS#v<3!S0#c#m|BKMW5kCjSs+~cna15?
z<xAv&*sV~rOQEY}p!X3R*NdPgag)QznIB6e!j*luW1&eUs$}QuVwEx5LEXmDHa#ph
zE+sq~FZjivwb-67nZSKJ^>}K(oSh4910f7VuLOn0`2H7b5_O(etZI`Uz=Gfpc-EOY
zTvw44e+vj==KN9F!MGp%Tt0fNVp*uH_{6AJfahfeO+zN4padM1sjfKZoZ`BvHf*>0
zdq{TsD=z##W3_M*ig|6BzFC@+IQg3Jgsj~+r6nUK3t?q%hkg~r{f*d3<W62Agm0Vw
zV^twa;!|Qi%3B^1LbxGXcFnAL&npw0(iTZaLseXj!niLCUT}Yn!aHkYQ|x+puT~te
zZaDQAp+Gtc-#{B;13FD%CSNuRV^t@(fTlBwP-HAphxA3XMYH8GA)tFTc#oK=pT(;m
zu|o*Y3~JqcuJElh{TJP35sSjQmxvTXZ+KRwy6o&zuG`)PcHiS7mr;LO`ldB?Y$>e!
z>Kq)~^L|%oH?~VDTV(*`A+g_6%dwp=PAy|eX!m8ienNlRyAes_wrCOjue$QX*cD|l
z2*aQ&N$V8vf3bb+LA&}S9w0BVp<QK2eo1W&4J9oibu`%qaVU<@sxwTM%UiyH+eO55
zCC0xl1$7O3iCAF$S9TF>V``7jJ6`!{12jFbT5vP#_8{V$)>w59LoBoI_t^f9%Y(^p
z|7=Y>V5Vq6`<u(m5o4k90Y$?~yTEedJu89Wv4~PNa4b|7J%Lu6*gnJU$&V@q{9Z4!
zR2DWFQBF$B&Mf$Y7;u71WVuG7z$qU}O0`-h6_%u^oFX%V#ek2#h#BBfRC_F>8oDvq
z3k+U2AX$mLXCWIdE@`QcJIkILM>e7Fij1d!6aW1Y<ugToa-?yj+khm@Wlme>3k-Tw
zVZKMVt>3DB2Zpu<7@av%Fp^a_H5h=ssP=dq4UmOWO}zJ1?fGt}wT<ic9t|xX^jaDU
zv5r+kMSN45bV`BQ+w<%Fm$EZJVi*L0;Fnr3$@Tvq>rB%nPMCsyzzvFrF$dxaeco5}
zuvKWH5kaatMlGc8SQuIx%WEGYeG9oq$UUm-aO}Ay>h5baLiiTx!)vr#Gf!yb{<m|L
zj4rYs-TNW~IUCg(2}Aat78K;(AcIB8MfIL*mY(mp<~eGlC!6djbpfzhJk<I~$eMn(
zC7ZFMG^6Ec#1)PS*?8zkqlNNiPuI`WUSImX?jPW~BGwSQ#hXZ?0KE${#BNdUHX&=9
zA$G?+xg4)L5p0OvqPBYSP=n-HG{WYwXmk8T)>n@VtvmYDiDbF<#zT8LP}$n|%wr=u
zl7||b`gw@!kgt1WuZ|X}d$Q?k2YN&47R6X+<6b)(@s>y<KtYaJmO9K(xt%{^kAJ)-
zv=O-jDKbME^%jQ6?eyYw<dKfJXxy9Lj9t+c#2^S;snTk3|Hba-5?Z(e2H>H##268d
z07QjPq)S46VhswtinUc|*$x(VOEgPxj66$T=HWpB<rpiU(6`UQMpUEeQ=H|4o#bBy
z;x<pt!&*0A1+`}SwrLE!_|0$6WKKWeE?Ps~{)O{-bWdj8B8w1D-AkY9EMJRMe3~7`
zi-4Iqq^$TOX>X=$1fS9zE_7|Hy>hPIJI2Zi#0Uwg6<=MKC!HvIsQFEwK-5;;RJU=L
zqV^BO&g0ZH?d=h}@~MC6YPCW;jFxAfJW83pjeB)Ide3X=d`o`4j{?BmJh@JwXFo>U
z{1fie(N#V;u69EvZ%3kAS<XNJkKUffzKXVwHmM`kYz8-Bp&(;7dskteNQWxaExC8F
zG<uUe)u1|drB2ZRMjy(~D2ZVZ1fo}JBx&LP7i&MdyHia858#N37@r%s^rV<Cj7lsX
zyEtwTV++o5g7Yv&i2dYk^lU~zzh=K@U9nu)JeZ<{Pz~>ic}22g5MXPsMYB(Mk`PQ2
z#{pl<T8%T0oy6BrgtV{vz}JEVP*8cUgBrm~GfWwK>L=L9H%-_SJ{5S2@JWEpB6CP<
zSuLpmHt`L<alEjWhg!_jTO6cJR6=Ly2K(^8)>bW5?R9U4jP!chE=BdOZ%v4M->o_w
zi@DZp$--#YR$;VHOClp&W~r*kwUtKcwltj*LFMWO1Hg995ptD!uF)~(%$B`92x#Kh
z%d<i?(pdWB7EKQcBfpmGHu<%IUpqhL7>*)e(i?pJYK2`>amL5&422sJUqd<N(BV}J
z3ViMC6YAb_oIKL(*NNVgT>%cnAPD=C4t4VXk6m&J<ql_M4<JlwOV*L`O->`NrH%WY
z{z+Y08a`#5B6SCaQ{+|R(`IvGL!)EJAg_l=Z)uoQ!PbYyeFlMn?R?Q(Nw2o(Laqmk
z8Q2f2A^C`xTw|Ye@W^|K1knyRG#83$@|*@En~O{nP0F4wg-6!qoS-Pzc^KF(3mAUj
z4z`E@^gs*0#K%<>l&csV?4hwNr-Syrig74lTHCfxOvM%Pf|`S^K8J}nA8sd$z<o5s
z>2iv4qRG<IoGv`FmDnS)ngR=Z_LoZE03#!}_8hre+!$M%I088ue3xVE&_FjJIUw*y
z5(mVc8m|@ev3~$z3ljP4o0yM1b;O+IP?{MT?ib8e#eD2(L+N>j!^nQ<{Jg5YMzR0H
z!-ugeID#MqVJ)fXD*ZQh_qaqy_J9Hy5JGk*qI#AM$=xMw$#xr-k!mizqnlalWJ#f8
zzkwm}`52#^4EMW@IyNrWla`w)7wFhWw31COaa1n?jTTB7dpqs0^sx&WTQECzSo)+5
z6`LtKN!za|L~MPji=SQIs|`v~>@TQ4aw)up1d|h5NDO|zJR~D)86=nAwRxW}h<vWA
zplRxah^-j@P5Xq1y)E}tw!e8JvtG#+?A-*Xmjo*IaoeEo?~9MXNf@mQ4BvqLhT)rz
zeehNDy?+xK^O0-ahZ;H$H3UIF28WtV715+vF1n@$0WX6IO<Dp?*rFvS+Vsz=2&b|Y
zf0C{6mD>{VF9dCi;;=gFMwHg<4-53{6O5A)2ey`((r(A!h{MH#n;@6zZ&LX~*co6s
z41z%PN=8Utx&OtsP4|y|c6T@c528eLfZ-+DEU{1|9Fd#z9KKR20JVb&D-|->!;!I2
z?c5BWFV;sVTB=}Ee}Nh-yT1-#yXN}c6|H=_EW}N+Oy(?}{wyx}Q*BH9RO)>KU^}?S
zMyW{Ev-w470vlPnIS#q;(R?grwS)VBXlK(W%|hrlFBFaDoMSd7t9L|<l!FKoF`8B8
zj3PZPF7EOr9k~#0S<H#**^?81JGny_g}|+(P$l(}=E{Bfv{{02zsID#W#tw=x09gU
zA3Lj$y}ac4uh#HW5AVL8Uq4n55F_yL!6(7FpX$~u!PPw2>@6{m++>k!sc6*VPms@k
zNc!yo>i$d8>pYHKk{K-J>s=G1dk*FU%yH^(_f-~o=s72Yp~5^HrvU9PO-jm@bM`?X
z!MlTpPEpd{uG96kt2$${F_<SElp$)9Z<Rha$%1$JUUVy}I>~FZxBT@fMN{(l_9cJ9
z+#&9VvMa!m7zBY|syNi;{~x={CNnmg1^WPk!f0U%@|0{Cr(PxJ9eia+fT(b2eZ&5#
zBo>`t{BXVbi6iA5Eb*|*wbz`BgWX#^p^2lYWXIxHyP!BG9VOIY`q<5WT|L@_Q5cKA
zbJ^K%7pAfDE0OGXblt^Wi_XbXbOq#$fwbE~DG|k5Y8xLlj~7-Z{|)BPP%fJ@3?TpQ
z8cgMCpY=Rz2O01n<r!i;y%nPOqBiK9C_o_!oV_pMx?_qnOA36(KR&lwcvYbj19{dc
zM_%;{QsDb~i^rw`g--Wd^FmnaZ<ov4i9HWmZu3@%VgcbpY3>;K&%m@m12hYnWr6>P
zdmi)LsTkW{ap;=QX5Yg|8u81%l}^7l2p$@V4EO{0*CFop7Pp3KH_hNJQRw>8^_O`L
zNP?T@;g}{)e?6QE^LGlfZfk5|wYDn$W9$rYAO=Ao_$4(I%l|)imrG|&+AH_~Vzr1m
zu5h>Y$DfT&{|AK!q-;MjiG`DeNuD@*t{O2FnPi>Y4{FL+@_&%?^9nrt`N@?dyRvdY
z_D1Jn>F`z<qdGZos(v6C7(K@fri3L;LWQ-kd;T!hRBuvQ_#3<1UT`2287C)Lo0<u;
z=&-zs^#ieM<XUTU1t~Quf1HJ95T)c(Y$u9MjL<j-(LfIzo;L{@SE-Hdeu|9K(a^2p
zkyAkv825WWy)Yy`HP^n@b(qZ6jRqFS8+3V9HR|t!TUbJz;P9cM=GDOgB)&|y|7hGT
z*XZVd^lb0GkWaKzx?If`qEaqOGtqD$d{CgZxLq;9a3oiOK&*IpWT0?OvvaeT0+%Wo
z)Vb;%#dAA@gkP28ei76Z^>cJ-u<)32B*u3Z-%K=Oc+rp)sWlA{9y|gHWdW;v7Z85c
z^y{k8H?ER<U*ivDS7O6J2*Xw)i1f(*i&Z++rXszV4iNDf2aFY-gEJvrXUhs5Jm4u>
zfDn2Qb?_C5%_bNdGC0bgqx!jQ5nKc_aKIufs>uxq-~opNpMdWF7t2thh``4%YZu*s
z{{0JoA~N=Yvd!8e<`BQTHJ0?m!*(|l!InA<wyzI%-ukv-2!(pXc*`IfN3-itzJrVn
ztBl}4r@y=LLp$f`$cN}K^V-bWN%T1L5#cMQ7vd5=$p{vz^dTB0lzN)rdZe}pX-7j{
z?b@k(!^L#UpKi}=6r#-pq_s_JI8gIu8m3pFH4zFVvBa?Xx`Mgr@oP{2ljrO@v$+vT
z^UpNnHutpwlthI~=LeJtgenrMcR(8b0)CC&ZqKVKB74e+KyU4#cWT~@oY!F_uWWdY
z`%uh%TB%=coTB&2im~4e-i)0K62l+}M6aY+(t7`kwUY^tjH$o@c1#fYtUI`a9^1S)
z6Xbg-B!B+vk?<8`KYKgHo-gyUt3@Pa_cQvoSa7It-AFkYsGLG6w`KX>tT0m}yC?k<
z{azMa#%tYGFY@E_2G{K+%dGi>QQf!pl%yKFFV9al<{_w4O7XR>LU#MFO4Ukp|HUy9
zvU}1MPqZ@0NjJJ%8nj)rtZ_CvA$a8gE}O~q_;ZLIYa#1fo2>eDCoS3-${Xr|<}cY;
zqr5vK+of^Iq?&*&IJwH;wn6a`;2BC@EgH>I$7o6JV1$XqCmE)K9X(kX=G*<T*l8$J
zx|`|pI?9Ni$SM^5w?)Q|F7Hf7A$BYkP`&e1BfszKR%>ZA;9hx2b=hML$#p1h)&E#3
z!G87`KL1^t{I2Ms)bGUOmQYU`?MvAiB}oi|K=ew0+eYtyvHcmIGn*~Q9Kb?Iz}R$}
zk2nhsmuj&=%~P!~obXngg)@qWRM!m{;kUZcF9oyQu!Qz_nEZ);$I9s_!&2aB_-OnE
za)K`^*azNZ(qz(UwwdF~bQodHw%7e!@Q3FDy4~mawd75Q*S&FF=cf04;Ylp~;|?TJ
zq7F9l-DdWW&yD3#)JxU9W5E@-GyBBoV>M3-8Si(?R7`Ic&%Zvuz?yi0HRa;-nYF)u
zJFj(*Hq7tV=gm>hfEqiC>$<s^Hb4bp>_x1a3aZ4(b(%vHhD$AGqD0Ei{f5Hl&Fi)3
z-l1MD=4WX(4)d#K{wSOaYv@^sc{9+&Ab+ct#?e8`vq$O%H@P)@;V!X)Vdmb18EGBt
z5~*6fKyb$y&GWwJ`cOm@1qrK%Mp5*(0Bn!(tTQV_y>;8L)!lw=N*0uLBGudd`DN@(
zY#4??D7um_NWK4Jm7?;f8W$J<nQ#YxgVhfPS{Xu&m!!A5<yXw2yQp2(Te7j{^SQ|r
zV6oo$aIEhIQ20vx&)Vk;G)EhF!YiRASZ$KhrYwzLZm9Lpmm%#}$FAawIc;uN&h+Nu
zy~o5P!{Imn3*v<7k7cQc_OF9mOiL~t6c0Aj_l`&*F}V;Rxv+aL(UUUoySp!GRo2&2
zT=h>T70wevA~|_Khz0ng#<u`!ZS^ljm1S*>^^;3v*2VCY4$qx)<1HY{_!Obu5wEl|
z;&m|VRunZI_BILB(?y*S>*3_8d3DTdt^@IoiETX?tE6sbjqOCs9=s?Jy=sX^@+lL+
zS@zN<aXy|#piEV9kh#3d#N(i;BIZa3d2!0Gns3-sNX!;P1w*GKb4}Q`e?@i@k6!j=
zz~%#AW|oY^Ekp%u-k;{x{`{l9DZ2t32tgS3CB&`j|37xg<=S~_3O=A=!W^S)RM?#{
zWVwyod=WKBz6V=8LXsruFPA~~{cl&z$z7HFdx&-cwdlV)kj2uspxOwiD;Pd|f$Gg!
zgcte~yFV~tl>&6h@+j9^ebFJLkXgrhy`9&5-3!RW_q`Ta&f!nCAQP`~p*TMrmVUM9
z7lx*}51iwmPd<IFH#wwi*dMUouR<wT#Ot||RHiBcn(l9#Z;uD5_&CaFZN~oY7b-u0
z!g|gGk$0P?vEU-*dz-h5%_x$11l@J~r&^}Mm49X%lFK9%%P|R+UZzT6MAeSgHkS(&
zZJUMm`_h)hKHj8~_>CXiW})njsnk%t(9J)tjFd+)Vzjc@M`rTyU}A_O4t;4gQVCX;
z$>ogRkyHAs4C>+>2gMU04Sx!9(=$aD{yfX&7(PvrXeP1PrlCKd`cQTTI1Ym_5d0Dp
zx+MSqSam1u7`2s6AAm>}2it>j#NV|xrE(}FLwH)aidvCMWJCBli6x)+p~}JF!<CFf
zR}u&w^7g}Emk+yn!X|Si)%7M-TpuZi-d~LQR4em$bUrucpzk+P6+-1Z#(KPcLYuR1
zD#jA8)9oH6J03X|66k$f-Ff=Z<b%S4xv-}m%xN^~O)OC!Wx(AT+NeCyD5f=Q=!E*c
zhgkV833hL;*zRPKy~-qw-4&G6N|&o->P}MCxis*<*6CPoVo_kZ5G!{mS6CJnO<tr~
z%sW3;3FBya(`jAL&xwhRRK!(~cf{KEtKx-iS-pjI*oUqn#Gz+P<lGD6D14d0yWn=s
z1)gK%6;X;}^%eh=C95hZ7Vur1%7|Jl6=|g5`~Jp69C_Wjg1+<AA=fH$K^LuuT%s$q
zif_sAeFRDhr<5O6$ngDd-WOwMU;{A-!@!lG`C_{NVlTafU44+r08v6PkREB92Yg5t
zODv>0{)J$T=f=1k^=hG69|aDPZ0{GXZTzy@@!G-y@Ixf~W!t<h2^M&L#v7&KOEi$b
z6a1_0KtGK5lY-Xsk?)vB`<GV4T^%pWEK!EZM>^jlg+<?E0lN^rI)zMOsWz<p<#{++
zXle8Cx4|HLe<ivX9rx~{_T&tN?+=y5OSI-eH2CXH*{Xt{hXH@`S}IFg>>WGLej)ae
zQ(cZ4d5$O3<+&=l)Ww2nNFd>jxou&onk9e-?^xhHVr)e1Gkr;0JecMzYD?gq$Ej9C
z^VA+!<Y^kkX;Qnp-ZHK`zBk4<H_Su6MqUz6)iG?;Ue(uT>ry+MZ?4AmBxTlT`N!VB
zl$=2l!ypJnucR0yx&Ou5nU;qg9k9D>G9Y{r@Jqo;AIW+c_Zp`n376-maW1d)-pd0-
zc$qNbq*@yp7fo;;f4;wxC9n9JevVmI+8kePv6t4wUIZ^s$qRxLt#|mkSaKY^+74gG
zUVZ|IWJ|Ud{O*Lxyi5zeay<hztR{>$z1E}g7+zNku$jS&Dd-h0FFd?l>rPE?YWv&{
zNkR~;c;6L&sO|M4y8?bnjqjusTD%*qLVix@gKDk#S@Q8_?qwsnQ8C79J2M_u+zhZd
z5_H-8?0$};pLOKt>YS^98k2IhJHlM@jpTSk_P&vP3Qudxi<q@V3}MnTS2@D^qPE5p
zxfO=|+|D?SoqdNeIb8E78$aJ5ES5a#;wrUyy&_4<Ik=v-w`JcB=?S(O5;GVaHy9i@
zehd5;V^@^LFbKk~G_f;!|BLNoHS`S^H~>!zDPTa1!j}qEiN4&0xg#O8HM0m(^kYwe
zyF;$sF;EH<U@WUQ4oA*%zi|RsFQRiSC9KIduua~}FyIK@3?pd4QcmOcMAi-jvRg_c
zn^gTXQhB`4`og7Lev*R00oFpKf}UUma`j+u4X7|=+s1Fc%gZBaBDC51=Py;(^^%6t
z>f&hi#^I}tUDQpNHZVD>f2X_M_JzcZ>c@=u!hSP8D^Osb@bxO@Bh&GP=)iP8H0Hs9
zJyuS(Jp?$@Z69*5`Zq^_)y=&Amy%L+u2)2MvCsf-m<QEmy;g<-pAj9qU)F4Q7})5E
za1SdF<B>?;e8ak;zRJ#Ty(O}fZSx4(Sxw@xMz_m=w0$F){AC_Kl$}wI#4rd$uQWh6
zb?<+%tyc0&rIDcfI}%fx(2yA8yg6K4J3n4uNc8G;Tu#IGf<1cvkeK@txQyEuh03tg
zHMHqy!}i#kBAnHe17+AA+box&YJj5kVeukU{NusLm(#GZqvxLs*naKMy58DS#^$tL
zEFgU?T88cU5^oDOo5wI%f(7p2aCJ4Szeq#C_Cek5M1yWJMu~<OM(1^UU!(TV_kBB7
zL0Y72x9WO1SWxEI!<agD&uErm`={6Jy887}p!VDA#}xNFbHSKLa}vqP>ZLgpM3yH>
zF!hv!ts^Vh>?Jud`vSV4%O^cmqS&auZAPH>?i9X%T6o>h5|Zp2KSD0Ndb*wr+TT9A
zsWH9%$Tc}#Hcs*>U1Za6f!YV!-CPoz>IFUpYQLa_@frUe&01sM8bPCQ96)CMaX?9Q
zxt}7jJ$g`8fc60}kQ`$2Gd$QV2?B)nfcyXYum-aasL25}IeKcc3PggTj$g*E#0Fv*
zgsoIAA*K5-c2e&!s6{vfSa~pnx(JX#h?12*1$cX9AKX6uCs?92Sr>uJo-QHMm$DfY
z`(Jdw!6?j>lk6GX!h4EFM)bVr(@dX%)-|i21z{Lf>Mhep7>TWWJ)k$@f6;xxkzrVA
zN&@gpNBV&?Hsx)lAV=@SF4t%5*kmQ-dcoXLNtEurIOO`cF4QYBZiQT5u1vPQ-eARZ
ztmLk}PC|V^NrI9SqlXQC6Py=1KpU|W5-vq{y5Nd^p_J)SoEUel1ng2oFjFH2^t6Un
zFN%nX(m^5bix%{X0Mb{(S!neMJa@ru=u)z6&<oX)nb<u?LaQ(10I?JvMl_WXPX%tR
zp#>KNLopo-*Xt-QEZEumBc_}BcgVnyN9iltZ3VxiFcblghS&@{U%BG8jYFvaQg$v$
z5Q88Py;8&|<o*|%Sq$COXo1;flfs~Ue72SC0?9KUKs_4G?-O=yPhlCW3zzm9L>f|T
zj|u9-urX1&5XT(Uhcd$iRFpTpHil1Q0)qM&Q0zi-e-YFN%M7T(a$hY&>8VAlNl-to
zHGNeM!vdS{n+bsWrr6oz(r_=r0<!uBMQ&4iJ8!+5)Jyl5rMtRSW<h>{>ecT$OUHjK
z3f+Mb)w4{6;+k8Au)fXt`kRUBN!cd7ollkhC$LVAQWR!_dQaE_RbA<8g8FsPWws}%
z557JPNYgB)iVA18Nd@;|Ktf#)lA=(VX?~<)P}j#5f}CBn6He-XvG8uD9$77ig<T9A
z2@EIMP4(3By~zakspYY0WR73<-+SSjXrDm9MRf(KH@}H5bKqnn*Iye+{TOSryX&An
zl%3IW!$1f`Tk>&{&Gz3|#veR1lD#AaFc^gIhQ|t>jrBcWQ?iA`J{f~2E6ASyo>H;;
zP)WaoF9pZ@gK*ZE0!tiMtG&HOLk;VBjd)XE+i#i?J8lrVF1FOXDY3OZiUGx~58J+9
z7O=jD1n8i14FMPQYKT*E_1M!>N*=M`v5&tRQ(PHW<1t&%dR|xw&MvR9*W&DYa-;W@
zz_)(_*Pk*?t33n^tzX%WfB4mdW41)FBm$Z;1x#ge0w4rTFRxIudTg`(zPv5>Vt&Ay
zQ@nY1+_v(z4yO)&i`AcPxtn|^BNX<F)iw*^_OR1eDD0W2Fi@G|WwA{UV^FFO_*jto
zwpITLeL=@@&D9xs4|#6h760YsihIi#?0FgXt*A)-(RxXw)8U7NYEXZCs1AS7HmK+2
zjYN=^UXUh0J*{e@3LA!IDo)=4$HN5t%h(wmF$lvjbR}@$67RoQ`RS9}aJC1~r8Tl*
zgb2S_G>e2g)p|55=Ov#~4VCV;gN*vnOJ^5Mt_$UvuDjfvA2{`Ph?%43M>yH~VDn$z
zv-zEDy%AY7f;X0@c3ft?-h$8oQCum)^+Vel>f;60_MT{CMX&Y0H<i5pn)N}d{b<UM
zy!!CC&YB7$uRegaa=uAia~I7vc7Mn?sr4+z0L*&vTHuxE$y{dr>tD|6MY8_nT+mqT
zyrbmS2d(e6qulzi^4-)v+<GIuXXJRT7@XwR@51?jb7sq}4?nvr*|+oy72!;xa^<yc
z%ad1h<|@Eq7=8qUS0%f0>v^S#{9ZYUC|UnHP2^gDUr(rHh+nyWk*gnDwQS^PiaFn2
z4cCeLA3KX`?evP^d=h!J>*<OQWmj}WF$ls|Qm_^FU+jGuypu=l03Lw?#WdPZU>_13
z>7k;j69jC%Kuo(WW-fbDj<=RU*Gt#WE`zR5Efd(F>n)T+xCNSg8*$L}($NSu!Bbrn
zGfObN_4z4tq^_v>R&AGAp6BA*k4Zi)2^dDGT9xn9&&ALmTYaaDTT23VYuS1Qn@oP7
z>%+1^sikCBvgrC(^>c!OuMbh&uBaoZpR=eSd=??7L8nGdfdsB~k8WoJ+w2mLEdhP)
zvHuU33^GG`OM1|AY1z;8GQCY~(DfGkR@{zEVJo`d5&~*RZq|p#d=u6~zYM!|6A7|D
zq-o1v!XA4ZoLzy&P0}_<tT5agp77d(4f3J@Q*Vojm4P2;3^Jd4<ko|SWI$b2leE@$
z)IY|~D92$C2BKG@gTs>hU#yi{KO?ak@|PdWHW_T<OeWu`IWSs&sv2VS%ZB)SYFk=3
zNENVH;Z6G%GL-sw9o)utgDYK2i&sO4UdiQG(43BrlRwxSdN!Hy=j!&x$?@V}W4xf8
zaqycT1O0Ht`$buDx>}Ct2SgS@Y*+Vp2pJsuN}Z}LyIc(w992_d7%IzKR;vkpFKA>(
zQyh#FRy^b)k|;~GR4Y1t$~wNDrVHPBPxkU~L;#1E$La;;L%=*I_HxYD?H*D&o?jhf
z8;78&RROF*d<p0s=Y0NJsx#-6@LMS7^DCUk!-Q3^x;Jdh%NJM#a2Ch$5Ry5dUsf8D
zk}SDXjRAe)c_bs^yv}*T%2DJP^j>*jL8DKi&!|du9g^jI#UN6M&g;;|WN`Jl@}-XH
z{Df6CVO8DoVKbedsEyt#V;^=eWW_&K=iqrOSPQUxfrds8JMzn_eKU4OIS_*&5WP|t
zslxp)w)?R>OiaK75T(M@j??j`po5*?3)*g{Jc~|hgV93ZMQbZJNlnI77gV)qqE-za
zSkH&!FS{$N;T>XrAJs1(G{n5*Mkj;2k)yJru4qH6pR$e<-EUt>dg7Jd;uWm?dq7<~
z<+whI9zu3zR^t_BH;%qW6|idx5=!1MMl;T-%$wD9f;raXbWNLGT~PAz$1=Bk>RYz~
zbi5#T+oxRPWYF;wLAIf{wb{hNmeToy+OXB6`>(47(jmz9r(Pqtc;oQGP(b+8Oggq$
z^xu2i`N72R&uWowvq*L{zP)k@bV<ZB@;2*LCp=SH13qJL?4P=WgNVmxCT(V9*1&=P
zyul6QoZZHb*sZWiyu8QL#Og6F!grZXx_l1esVFF~#Otz58lGDm93u~Jz9mu33vz1A
zmwqYNhzAd!mtJSaU(T-W24Wb5%~YBMvj1ZDWxLY#OmqVv^59kD5^q{S;n_sgfB(_A
zKQQ>kS2k)MY9#`XHu0oI#_~>>G%G$$P^Y3q-&I~MT~M>z;mp}vhQN377ecEpU#KJl
z7Hcz7)S{Y2<1Ix<CcoL6cqQQd;R(E>?OhPSd*FGjDMWVp-E#VTDOmBC(|a#a_rXz1
z!Fl_wEX|7bpw#-^0&<@yB~y*zPV4yE?fHsPv#Y=QxLxlFz}w;T;#s7xaLA1hGKeGP
zLf)o;wol;Y)O*Kn%woUj)hYY%2&_Ft0OCONNUs=B`@{S4)D4KVhl-8k!`inI?qUXz
z_CL;wR)vJWbyPlu0canCqID`tvnpjj2Dzr{2GIU`Mcwt{D-gZO6feUv%i|&+K9mv2
z4)>GY;^OQY^+ZX_Xcfnc;@=tJL&>!zK@5VhD{Zu0>isXaKQ&=1gY*Cys60)P2e_x;
zjb#2H<Z|y9;B%F%cY%3t1x>`eazya80o&RUO6w!XUMp5nc;;9pEk0qYE3Jw6s1@Bv
z7US+DGbYlJ=>`O8t6KU2`Io(oWZ+oZey-rlSIRYzb@!iq)tWm@-u+HoXZ57)4^~gm
z(DIt-jCbI%f?2^gbp;%VckN^^8g~-z#uq?7<K?y$;T}3hZl6iG+hlZ<rU!Drn0&i*
z9^}n7mol_7(3vLATNbo$0M<!c4!%9h<}xSaE~lQ8*AVCKZjxoC#}a|n`!9M>5S@i{
zGm&!lb*Wb+w>586D~lL+dompTlNWI^?jkAK@oZQMa2~#C;Llkp_e)Xkfr<Nr0Q)g^
zMmZ3JAP~J$0bA?+FSZ|DAEq|I0f>r&l5vpDxPRah>P=!?I_16?kE-$5{8eRjq#gSf
zSAFfIJK2^YIkqDPCZxOZ3xlD3Gf76aR~U=8G%`yD_DUWkAmp`ooW@H#H-xN9j^TwK
z{!ueL#-qAq;6>d6-G#Iz*=f5!rtK7K9F8uCA3kj<ZZm>-$H)q>#F+O&{_^H~w2TOs
z(*bsE-X0pS846zMgy0Sv8gCVXc=L+h`n10gb{Dtmygt_K-j44mr{VpflUIi`jtgjb
zLuqK}tcS+vgoa;_g1Z<O(C~)Rp+52@TmC~Z#|*wq8oo{WOs9AtHJw+Z#}hJXOET(<
zwClgxzL>_D;w0gl>6=GLN1b`R{r%LeJmHzkd#gU-``q|JO5op@mhY4TS`vkmf$#HK
zx2s<-@wr0}*g0pVGDNAl{84rWHVlI>5Zt8`1e`*=|6*;W`fSnEP6l`Z<}vVk%s*^f
znvGp9HgY`hat1EOYbtygZ@=2Ek%~ir5G&2iiOn?lfe1J-&yV8HWD@-Bo-~-FB12Dj
z_04oU&gOE8jx5YA&ytwm1K3pflF*pnB}96=IAYB25$v~@eDNRtc!yZSkI#GE6inG~
ziXRBJ`)ZQW;vvY5hOzvypZPEBqe!z9t5HsgO4|CoY)rxPhngYQ#fT4EPHe(Fk0`Nf
zv_6d1oDh57W!)C&ja7{EU8ub+xVa^_zczJljr(AZ@*ZfeT)Bs)nH)c@%ES!8%5#9}
z@jgeo<4-QMOPueDflhbKRfU9zBrjgp8Bdt(Ii*dKkM|xAbkS>Fg7rqUYm?N`<mKeT
zrOyJ~)`k@~ndZK(jwUbSq2>^u)1z<hqwyDua4R>mb~JhaLo$N(@uK9~jvxp@SW9PM
zPwl_4``UyV9pDOJ(C}EzMpEPFz?#ze66^1!6x)HCNgbDgS{J;U*J_ZIkH-9%=VEjW
z<rfcnCN0g*jmO2a(4M(5j=Ng>qK9!yu+>CclWIQrJHg1x8=HNsi;)|%f4#ysxLzt1
zbwN3NTsFI|7l5r3?GUPB&-?W3P2vXB!}Foj;#9?z%S-?z7{9E}ip&Mm(7c+kY8e-v
z?c$k7iCl?`FtTPc%$(C+R3s_-=((F<r07lOMMlcJh}5gCanrIl#h!VBk))5FX<Q^2
zh4C7SZ$6uViKTx;D^l^9|HFmG*6>6T<6L;gW!ct5+cXnt5pD18`J__&aekTlXW(?4
zYkEPVesM&Y>s^}_V9z79Hx>O=*CtVKKg!MpxnURtqGzgP33LC8b=qd%y5kHu2Vg8#
zK*;hD&j>s>Fo=4SicfRhA)?-Sa(bYyF)tDI!TW&T(p>K;9YZ{Q9HcS^s|lRY^z3l)
zcYhWnl(Modtuu+kP}O%Nk{)$~xrtVE-;uIxqb>dMGz2FdvbmcpI&Wuoe%;&<VQU?4
z4qd}6etuC9WfUkoQGyl`Z!Vi;BRt+5+W!h_KN36d8ecN2nRT=3FgefQ#TBhO?m*7Z
zWp5ziJL_LX$oZtp=WiRrFJ9RQ6SOd{Nd<YHjm`{Ty!<d+i>*7xhq(FB1XD0C(us<h
zzvOx@OE&HRG0!`5SJ~Q!#mrMp;0dz+vkF+O&;H=Z$Nk8HD(kw<5H)|A=iY|7zTE9+
zqUgk++LX}<zszc>wKu|8)gCNzo+0gjST&y|WbLny6&5>x0UCX0-F`j9&M(anKG#>|
zyrBA~?2K|C20<WtrUhK={V%p3o0&1S0egT6Xt5>F(f$?C*6$6l`JqcIY0Piq#x3p?
zh^$TD1~wm4vrN=fyRQvwUf1zB4dc<U0A5WK{NZAlUeHa_b4xn)6>a8Obrrj~Sqp;m
zOJT81s!s!%;QS)ykZbq10nX=ORVr>HWo6m>oa3fVE#OXy%F-rv`srxD4^wq4&WE?1
zpFUwUSp$2vlk~Kc!oY>A7Bc3c6kOhT7=eFA_;`aYz~vME?WB3jvu;O0<ry|*W$L2x
z<b^VpwqAl@@~f5|QkOE@t5lQ2C)Bi8pz=vyuL8GP?Dp{B<BPa+*K!43&497n^Ht7d
zY2__~=3w&cc(1dZok(6epU#yN$;*eN@zy>hCy{64?yBc{*To6s)%3?{*s+H_?44aW
z{?>T^C^-Wx20<8xUTGR8aQ};K@45c)bSvxtv7nH?#<VB+$ic8xyGQQ%O%igv+a9&L
z=zfI?gZ!jum$mqzjHNQm`#xkXzWFw^wHimE#XtQMfU%hQ-1l7@B_TxVk5qGLxm`jm
z<I}JqHMH{ol8<X!o#>6z>{W&Pp++Y2*~rc2+Tbgo=(@R%q)_1NaF6<8SOoa!5%r|$
zeD>Zh?D1d2<}V8Q9j0>@>^b3Jj(1pW*V84JJJ#FH*$V01uG#@RS@Ut-u7-m#!9rGM
zjdgIlW(Az$lO(9U|4v4I!t9~C57_0ni0=LQKQ@k4^#os_Io+VR``U9P`y>Y<xW{yd
z_VCHbnHjkqX`|50UUEO2LT)!!a7M{Z;zDh&{z7ea&F;TPsb}o@Bkv**Q{vBkZp_2n
zKaa`4p|;~_d6)1ZZPruee=&9jSqy_95WP~2M9KXx*7P-eX-&ahH&nq%F!RRof9#Db
zMa?Q3cRD8<22}BGl`!N_R>|0QHLa9lt@i$tFw|NgheQM+Y-}O9S0wR5z8#%)kJX{o
z_;x?AFmO_5SO(<uf*4k^f$hw+eMb6XC3QZHtQ%`|EEdb?b|1T1Xye<TYn8+rt{M(H
zZCrttpyQ}NfWCHe$eohD0NpOIz*5G0Cw_#X+XdH5TqLhwF+8B#eacG8$;eOGTAsGf
zIrBuM!Dl#fyi$na1u?t~T$dOln8OP`qrTd4SHm3MPkZbu<DGB=U`BDejFV9Cg|I`g
zu+91!w7W}q^#x+I`<OFF77|m|iX^^|MXIY));ac|BgU=RSa-JtST0rHW^g!6$H?k4
zvQ9-<k!+<A#eeWr@R#0iv*<9m65PnSFTO#HdFNujFIc`PI~N;<K^TaxM8FiY|6)}m
z`9UGF$pBa4AE>^=_|Uo>FMmbsr!-UH<w5|{8EMsnI61i$l_9!#Zd(cB^yW`^Dvd+2
z?AV|lH0?|h2dXcMFV=V0ix?e4;R&1ZgjBGvrY}6+IyNjhh04y!P)9j%RDIx8$Yx*S
zU99b{gBm$sxUJa1=lnEfE><l<RA3$<@=q1U(+EOZ$pp!tL0x*<7v_&v(5<k(`?yp#
zf3&~bA%}lrzanojo@S`{5$#=pvZ*i#es)(sbyr<XW{%$dBQBI3i%VW}UIyUyU~xLN
z*pjQJ_XhVZsZTvE2;%1$>sgG&y6<WYNBzj@y4mcNx4sf<zN?+1I%4F@%Efx`yiRZ<
z3@bhsZ9{vH{VeM$GWrnO7XF&IJ|g;Btnog@r|!@%WoLlIFbD#{FU5Lk;Qt@%Oq)B}
zghBcM#;Az8IWRY+PpO<1LdRaCN(j6|83!H(1Zrpqfp@892lR&$wNe-o!9zMuNXLm<
z#|eqxdEzh&Z?@W0ILq|>p!!=6G{L)xgo)iPG{P97S-Mmz&)I$P#m9Y^r*#|Fy-;;s
zp}MZX!aL|$zW;6e*ph}7>S}p0NZ)6yeMtmS*Ukp%yNM`&+twaU{J!(onR(k37gG<&
zvNGi^IAWyGT)>3yd2bgZB_S3goj<!1bh?!*A=L?#-*0J@w)85B1p3Vqy+=XkzE91O
zIHWeCTKtU}(Mksfr6!=3QA6}SUxSO5kp$U@SoI7Cfaiv^jb?nF_lVW+@R7v!qid{)
zg=AM*8T-XA&u3vi*VuZb$={ve&x4TEDT5$>ccly?4zjiU8&L^<A6MhY@f+S>lwE-h
z!ypWMsRL7*{~w#guv3*Op$B+1X;_70k`-LZ`5@<W_qiZc?}#?rbPH2|uPilI`67}I
z=b-v7=s-+tPr|IcYR=i$8z(f?cPk!deZE_g8b;C_4&;AXu|pqCS!J&&%k2(6caC=`
zbKXJ-_Ppxa3zxtN>-q@R9NzQWM+s{-ELAOeKhRX)@6obd&gc4q`);Ip0qi(DShl-h
zx{`UtMpe!+wJ3y2Y&aEY9yi9cmI&<1yBy7G&OCl51hcZED}s<48nNXS6yA+TZ}THk
z>{!RC#Oi+@n^49|x$IJ=d6ZpuyvB*R!8z23Ms0@RXXn^A4$1DU2g5(W8T5)Gm0)ef
zDyw1z8dTlewO~JpedCbT{f5;RjLqM0&0S4DK_7KZ+V`Q?M@GI#4b5V8GuC~@30U$d
zJw|hgR+$sALa;O}8CSLBG1lq{{xWt&Nfd%0@Jgmoa{r6HrfHX6HEe(VFp?tRy2zg}
zT$a;iIsN-)LU`Us?kvL6lTD|Uxgm;sx(mMp;5{;(B{SJ-rk??LCs`=DLMn9t@E#~-
zjIn+d9YD{y!p0yh4jn+=M?*jx^zTFYcR=rf3XaHQe_eB80Ny#vS5cudPKCU}wk;F1
z+V22&kMSle#!ahY61~ljmcbURFD5BR2JrrztnLB=OWd8zD&s5K;)O&@+&zW!kJZS$
z)3Lkkz6Wc=3V-ZDD6Ri^t&~>FM4tuY>MP=KpLK=5u?Z{jiv4R)xOTMw-mh+l$Jv^F
z?g_l-Tu+A68pd`uVKqL7PvOPt+fmOhtbqK_N1u;o$~9NXNqoPMceu<_Z3acM$c-#x
zsrG4K=PTexXaW~}wEE)Sfxn+!@D5=%>Rp>qn<vD{L}2EYYPB$fA_=7ynKlXGc$u)T
zMzT~EcG(v{%FY0XVGx9(R~phk=lw6XWE&sT+K)Q`feJx=P+SY!z2?$YiQ%UOqn~w~
z1k4w)y}R0WD9x4GxN7DDB&LU!!5Cr29euht6|U-M%^9AxW=2>7%rN_tXQc4B&m?7#
z1ddO|U?m=US4Xp}r;>~7u4S+per6cYJ%)j{*deFr)ShY?V0~eBA&he_nCVH83j)fM
zV*K;T{XPlVF$&?Avf2wzjfI<c(;r9C%w}WL>_qcf#n}F4zXX^aS&PuMQv{m#IFICC
z9tAE&fO*ez^59bI;uwO<`-@k%Xd!Sb_6leA;#>5H;<lR?iX*xZK;ri*X!~7jq%cqS
zJbxwV(ijv8<|#_ptl1ob%eT(e>VwVg#epEneCXxu4Cq-BAeeu!ivXOh0?oOQV4mL_
z*8)@~AM{b9-mj0|l$`+%!ypU;zf>5e<NqJqCe2sWvZQ-}MG_K(91}jC$648Uevi$J
z5iWazb<4*_4|>#}`(Oz5#lBca@Ev+zzeDIluurYckHTxWc&R?KK#!}#4XfjY859qN
zQlL<ZlIu0(ylDCe%2=@qL6Gy)%7~^Flg46D{JipQv)%S-M`rF|6RY_H7}X>$7sWbp
z2^w`=7tTE9*ecX9s%gbCVws+=JW#8h!CgH$Fd^vY6ggau!TrduvDoD}UcFp{ecNZG
z@#}!a#oQkYaJv~WNcstTH?bk<jcpS&vAO?F&9oZL(!Y-#-%<HFxh6j+i-GY%^C<>Z
zD<<1zqP}f(Qp{*7mJ-W6{Sc=$(D>nmOw$hr7OEVj7{|&qJ=npZvlMC~b^AY1dpiZH
z@%2Fp)d^a}E0HwF^b{Y94qIG<Cg|CqIm&ToK>KsK?u)WB%V8LVf#{WhbR4+<#ac!3
z12w5}|N1iu%a~>C4!JguJ0a6x<ax1=J0q`WutIG8!d6lLsLiz+eSX10=U7$Lw2E)_
z0UVRE^M?zEPJgsG%chRZ)i}3MZDO0VN9VBRaYRy48)CUaKPX`oh2q-HkrQibsCg{J
zYIBkZ;JD;kDD=WiQtpg@Jun`E*$WTi0i);L>h2o-I$V}*HCrK>)TPUto0?1Xe0cO%
zw!<9bT_-O#2P>wBEA;IYxjio?{``u!1{8X1;aaaGtTvn;{XWto+hfQ@C9*JxF0o03
zq0kEp@-(@u)Zfg!+7N=<ogkE&D^^?#g}%(KiTWPJ*J4AV7oNrCM6QXAe9RU4!)FQ~
zpQF^xa2buZhaM{ipAUg-xj;7b`E{(*6E*qu`uoduE?z8~*jkr3y=e7`UuPEVj#}4i
z>Tk-<D2YKB1fo}}nx%OEi`B96uww`G&z~KVKtfmuezlxQoMu~0g?;sN9+9hyKa(DJ
z&izu{=ox;V)&3dwsKNF}Rpd5DvtZ#IBiK82Z>Td87VP|Lem(1JM$e}7jegw~4LHd8
zHC}M6<R(?ujvL&(sFoFVx>6%IJR>#ho^op)!OSaThztZ89R)Lw-079UY5nxWAm&Bq
z@dtvjEIMhQ!HwiMd?5Rns^)g7;kXhz-yL;ur@XJ#SZ-p2m(QgZZwtB!FKJu;*tVeM
z0ndPU7ODheUCL80F9Wq>q+(uFpP%$J8nDVa*9XXASFlL$b&@f!u<K;VyBYh{GHIBu
zx|O%lvql-GDlZ{57;c_XAKcS?5J@F?3f~rKpY4k|*Lg(?c7CO=y|R40F4#55d2&^+
z<WJQMI^3dj?Q)!xHwS&N^GCe9gZYb-H%IQa(?675K@P(p4Es_GN>={=u}xKDM+G_T
zwu@CrAlYm;i*7#tPt;tz4!pHqf-!a(#=9f*xqhAnc*K8eG=L*hzfT$r_dKdsSi0M#
z<#Go<pHzOwR{=e1*2&KsZ*qXovjF#5INDX6JotI2iU&C|JrBW2&(jZ%w@6K!s~w|j
zvf70Xr7e<9em+T7$DY3D!Ot7!sTpPhm#ZGHXdz2wv`Ef7WyOKJs9R$q=i5RX)EAlL
zJPgMM!?9_@v6GztK>i&hor));HToni-f@s%TLcV-<D%q}pHF+n+0@o>_s`-&(Y;da
zd2zh9gFV!$i?azMJ$wnNHEL_9V|on|_0XK{;VdP%y?2Zn(yD3=jz0N>h}F>oM?Yh4
zw~@r!oTcqGFU}Swuv<~-gQZVdN?2X?;G)kD?wfa!F8T{Ukvmho4A+;kYr&xy1YuXw
zeH8A0v6n2PU7n7*12pJFWKaNLd)F<wYOCXI>f7RNvYG8#RS=`?sw0C}_{Rp@b^64D
zh-K4uo!|G|KyHZ3SaDKSxO@i6GqTU8lg^qOKBHqFdoE1nh|m$*$9tbp{&Fn(*tCh*
z{F!j77hM=%1xNAz@imdte9QtBrk@n}7}8H2?p~fUYYx)|?TDiED-f1qqk+8tXP@e6
zLM;CmF;TJYYpJUSE<Ia2unON?91>nd^pjc!_XyP=G(KqME?&isNPR(>*8}VVyoKNx
z-py>RlDiLb3nPOH3_=8cHW_!$U-FJ7@&ys^f?h)s++qlJfnX|^I3>J_RLpQPtC9=8
zP4GzXz}t35(NZvVi$@FsTi(gGN0|QbVaL}JQfz$}EI$`m^sH;aq=0Mga|#ZZ3quLf
z$NHiyJ+ME<&Hx8u5Cno>Dz=6C|BqdADT6sZ@Bvgr1l?@c+4h1uN8x%XT)8@g0n)>}
zd;M?kXHsLDB7ZIm<wvxbvi-7kS|I!?#mFv4Nl(0ymA&&n77UpF;IX~q3gfim8XS5W
z+kW+Fi_(Q=!d<L#YyXYQ?by!A>%Q$ZXRaQ`UVro`!bN%o)o>U&&yYas!RWZ=etk%d
z%`2ZQ7Wv6-pGB<C-G%C@*SRqidW^qo>*Xt-vSalW>?Y`UO0miT)yHiD)#57F0o8NN
zRHVnH2zEgAL%jO#l<#Te{p19ykM5`lHWgPlJE#1Lcoj!_bFBV?8LnvJmrnO-JMJ4h
zR4)o-r7)!nwvstiFN%n`qK>0Enav>5k0X1lXgTND9IGGqa>MI9v0>8d5xE)NG4JVU
z%rCqyGX#zKVU>3`MZD=6&+fi_fe&TplH@Q90?{i)mITrLFE&Y4c&Nrs<Lt8O;v<Af
z8^imTz7*pkyvALN7Z%%pcQw<!&dyTTOh8$;6;I`$>OVsu8dDjL&y)lS&gf!c19k4|
zg=C_OeMi*SOV9H3IljBA^!1$IL$j@3m~1DLjTh*p+I|5hiL}CBPrwr}i$8TgoX;gC
z>-Y+~K2NIi@7{ECxCdLm-Q<>7tu$o4wY1m(>r;lTH(GHGE~HAEkoBF)?FW;y`0D3`
zU4bKe#T&bEWV$Y(uoC0<Tu&?guJmnRFL_WpZ8B<pm+XMG+CkQjAYu~xGFgWgQ*Tmm
zhpaz}r!te~_Xv611(Uw`Qe(RnMQk$mW_R{Nvaapn>#bcJb0yg?)V_PA*z=kcA%hrA
z(|qph9NDoIx4afl_HokOK^u<gK|daR{p)o8C_4ijh(QnteyM6j`~Qz!(mQ8K+93CU
z?G{8LxGLD5#cFB4uqIE(p($BCmsKCuvtSw%+~#CUXx{3k5~5pgno(8E8}N#*!ld8`
z!~K~MO!{Jn;t%He0+zSq^o6*deHG3?Zi&&>i`bbQAJ`i7>rK8U^KD8nuD>yKv4-xt
z#z)2n4SNyyEHAmMD!OKtx4(d|ESTtWp-JtxS#2V&Z=Akvlm+eBfM>|O8RY9FG?U<o
zy52FnQLZt#FdccSYbE>pt>F+%`eLM-;`)rSN?+tYc6KdZs!oaPwZ96q$56tn$y)?=
zEV`bE>*4j-5o1^GDvnrVe8pfE_B4`>TX(H*Tzx%U{WZS+J{W<etzRaWw8=E>y~!i#
z>!Re<{|B$aks95aWwGbuubs)!e)5O1Gcke~1fgh48#SQ)H?}7aCuYDcz`@Ap`a!g7
zIgg)4O;HDnV?`NhKku5{=}ZLksG?N`hZ3PQaUsUpPjO<}bnHRk>;)cKoB~R|m@)L?
ziM?k}ar1OH(*AUga9^-r3_`~RSD(nWhlLAczlukw#2Df1za-R0PmOY9B$7c_^Po(U
z8*}!($g1SBd(;~0DRu*J_Ts7ezLLjv*C;AoTUT@`-7xQmn!?5Iyo@p{UN^=yXE)CN
z*8e03G0MKtYb6Z&khmeY*A_+9xP_-zN7v&f$RuY?)kt%_w6VJwc=2eD5YaV>GPU2h
z+_vd9>sTyGY5C493eH}UtN>e+(>BgtxD%-q${Le|-6{JMVDp1E-F00xWi#Giz>YI7
z<LoD3GuI#kwo~@(`VYafT7?&^iD3I7L};8U<;0?xexsxzy!(5F=995Az=043f#8>F
z^%ng9$L^x(V5|o|fKVI2?RKHFaYWbtkjr^e49b4JY&G@A^Hqnso>zyOMNZ_ahO%!4
z@)`p9wKxYk>Utr~KjpHAXDf_3I6{aBvAI+jkEYp?jO!L-WQwgGuO2Xdw4t<6-Vxvs
z_KguoLTj#E<?aynVN8$BqP#)JgRq}>>z7Y?PN1(BT5~Bp=f5}f^%B{rh|PS%24x?G
z@BJqSV^0r-P}Y{l0DI{EOUcdoMOPFr@HL0sVxG4P=(PbQ0F1rZF1zE9#cX?tL!j&p
zO4a(?zf4f}3{US&-{|?Jq1#h@*~|E{h_BBaU-^Vuw<*4a&b|6%TmJ`ky=uT$(8y@i
zlq>8V%D!<m+|Z_!#&ieSey`X^`Av;&HV({K8T&)ICn57&R)@0}%`%-f^qzOmyQ3zw
z*>OHH)zR25Ty-wo4VR7qUqRNLp1+Kpiw(mt2t;@31aTvS*?+N0P4loC>+k@`d=Bhh
zDEusu!T^ko%jQ%+{VjdK+8g6=j21W3O^_p5dryafkx{5^PiF&8-QhMM?TyXH#!dm#
z!-EE-eLLb`xQ<jToZUB_4Qt=%A86Tbp&R8#vi2)y7d9ttKRGNTrEP|`cSu?9`I}dV
z8RCB7?ON@w)UJf>DLg@2BaB}AIWH2PMVxQ$i>XOh%y!Zu5@2JYwJbsbZ$JBMGpPdJ
zeq9QRliv%q+n&t<ac}&+zy=Q?y+A6CtYCRENu>vX1l0YtxAqHdW>or7oNNn+0d38@
z#o-H^J5{J~7;i9|^E}B7D};lOJI)n(?xl0U-5U=QV-ss}UqnlUQ44}+fqwnPP2NxU
zMIIc5*5?x=)4@8-EdiEw#CNss5}i#8+v`Kw8Q?GogHZHJwK^;Jzt|FE-zVz^>;R<N
z!VkUzKE|{+oYt%FjDtC2v@@>pHOAKKu?ORfM@!xr2_x^U2bJ)>zJ1+>#Vhx1J*x7C
z_0_@bsHL4o$-T2B1&dLVO?-c<)d;RKl5iBgr)_6YvN~F_Fo@!DkbPICoS4pg?anWf
z0HpWyh|qZUXNv{V&XLLHWcS{-DtvpC-X{kPx_2KXbLM;ou#9qhABuZ16e+hqZ3)FY
zD-4a%E>l2Q(YXZg?e({UFtpx#2vbw8#F(4MCaeM`$c(SwkDYIrv2t65FRoZM!TToR
z>s8||N=4!#6+8N;hDf`zV+P&}?AA48!h4AFEgdDIY{xhMvg*QTs6ffe@-MDvnB#gS
zIiv8sb57cS<BLnv@Ou8x<S4=F*l)_tC<#IkhM`x2RhRbu7uyeqm+q*g9-t$(u|N_b
z#&URloL7NYu01;R{lF4khnH@a4cLSLYl~rT&+UG-8sKak*15Z&naewl;a(TS@k{&2
zscgq@AF|b3@k^fceXQ|T&9q(nPZ?Z?Kex^0s3&`G!L<dra$U(Md9M-&c;t35pWMC8
zF`FK{s4&$15ED&k-T@%)N0U~%711$?dkblnz?&DCV{t~v^Ii?+s-OVNqZ%yU3lma9
zTJDPq`wewv#b6Ql)?e>9A?`<KyV~We$w4i%Ju9!?_0D<ofw_<3j@~)%dSdRG++GA9
z*C&7InYjbpVeZf0m(O6y%ZqHYYy9qS1saFBkHhAR%<a$)b02jj)-bs}*sa}I)tKFK
z->6%^(cwPDghAbhY)iz;kB@Y_(}w<pr5`0{fWtrt0>Lk-c&GgTW4)v;Ybssv0h=fe
z=;3-y+?{|S+QFP{b2NwV3JK4u3Bv4?L=4X!3>&UOxF0Mf`K`Lnxr>)!b37*qyN}ly
zy?cBAQtb&##J0i`U61k9=0qDiMj*Btw#@lXE|qqtl4z1`1z~b}PppbvQuhKFiN}^z
z!yZS3;<;B6upKRxQao8!Nh!ri4B&Zjaovn|i+zipqaJblb-liwr0wG*rCK|KnG<vL
z93zjo?|G3#TS~cD6_P-FJHgK7#Umb0u+u9wX+{Q&=zk+8caBLx>%N~lBBfaCeh5ZA
zlB0(2-rZm)7Yhw`Aci&i`<tEyrwi>hN~yGh1!z|fu$lzSdiV83*_GHp48pLLXac0{
zzt~lG!bYV{asx!A`G|}S%n^upLSs&0nDZr@V8@nV`7jf@XP7|;x9ayGK=*4O$q`?*
z$Wwyl$g5f=cE57|F?Uu!MJ9GHf*VqqU%moI3&DHN+MPnFz+e5rUnGwOzl<4-EcV6O
z!9Snx{N~tr?9Oh<t!Clg+g<1IEpXSE`PJ^5T-XUFfG?t86)9l5?w5r^+kw}41Xm?X
z_ag-Wf8~So%Ynntz?Mj58yML4rn*;iWNiDFTS=z2p1XjMk`xzCx{Rl|L)iRK&CQP#
zFU;Z5Bi8J@8tA=2)Mjm@j`OvUd(Y=8*+l#VsU+u+3V>?tewaYL=Qcw<%J2({=sm6s
z&2kVfV^Al?|BJReP`Ti`K`qwvVbLvxa$d$b*T%frSP*`G0K5NPB6EOE6;ND0lwAQ5
z!ypLzQju2N|35ab8%bw-z#foOTLg^|K44kFa~rTmD~>WpyCowPb8Eh;{XeN9e^@m#
z?;o~A`jbiCU(C7;?hhmPqKQx~2d3F+Ua|8bd(VM;)i#-X58JH1ZR^(g^oW6_IO_-Y
zo)mmGZu3SF=%>y`5nJLkJKH8e|Bl*KiK7RD53q_8=_(R$WoPhJ{Pd*ak5Vd0e7ba=
zMfN<@PLKHBNd})ik^NI!^0g2al{JsFj|2>6f}9A_-}@0S*tTWCjYU>*v6F62-=D`M
zKmFjbq{sdT^gRzh5VRf=ubAvTZ>#{D#U8}=8+d@d9};_9u=i#VeSo{x#H_*I07pT%
zzVCds1T=Oa#<C8-jHpYQG}UCq-ton2h?PfcOQ!r<pmPGFh$V54<bwhEmC@o|4C4L*
zh7jD)WMubTPAi<1FO}l1iPd`{FZ$Qdz!-xO7Yz+J4ao<KZ26nAGeBY(1cBg}f~KPX
z|5!7fWG_=Kqz||OBN9CioWR@+i4Acc$Z2t4($*d-<t(ZxXOT+?W=qfRSe4IN29f6e
z=JxAh;?pa%Q@%~H(DshZ);kL-IdERIeWQl2NHWpm^#p5AvM!slPdrZ&+#{xT-Umz#
zle+fuzt^wXGX3ej#}OjZ{sNcE5j*|XK2MZ(Kgn4{r2Wn9$Fn?shsei=0Bq`%Q)QW}
z?f8^z8}U`Y6X$`o7<<JR-MG!sLwl&aswUDNovc&c;5`}gzOby6ow!Z@f?zDtFlBDH
z3G4{&JrtiGU|)<`0ajvgU%2g0Esr3L#CuIM<uBG0Pr$`h*VQi4zH)4Ayoc7}9gvyg
zi@&<ArbDG#H8}fQFBB@aQ?TNTi9)RJBaSa|_R`2v^XMb_UTtC79)^gz<&1q{IbKuZ
z>}B~Arf<s51qVVH1fo}xHd?&@#kPs^AZnm{fC-;cs1t-G$)3RcTC4_`k@g;((c}Uv
zAI@&8VB=J~FO6V+@KMAF%V-CEJyGram}$5VCa)e;+tX7n1RpQKUR*1|U-gk<k(1v7
zWgoS+2+7wfPB5)s{PGy@V{Wo>_RQ(IR~)SzvQzd!>%}L5^jH3xiPMW~A-R8;yy`Ef
z>`_}c#zttNw#V1`0+(u&zxW;!n2A2}``8&(c<|NA_PRduwCj}pNr}T<dG?~?Uff{B
z<}Xfxu(#I0F7|TkQaodfvA-b~SOMprhOt-crJTC52QDW@g#q`l8p2Ply5&zG2Hey0
z^#|5si*BB)f%U@X_ZY%HU>n%N)8pwZQ5sK6utiq$@Ngm~k4gx8Wp??x#W41w+f#Cx
zaAEA#+KXp=K$+#Af3k<l_@nF$a~Om{FnT2^o5lNIY{rC#u@$=i`&Q^!4G%1nCu3o@
zj%L#XUTql2p8rIMF9%Zb_kF|am5DD;quQ}5_3&ze>f!*&qYGd!OiO11%k?#>*u#r)
zY`j!@z2uf@;q_FpPFp>?@(cY{xGRUeQN!l^N8)mOq=6+$t)E*|(3v<RCi&SD7v=C!
zl*3lVku+kp#LC4^?+FJkAhLk#$?kPoY7>OKuZl?-+usiN?WtWx*V1KJ7p|$5woM#9
z5a$lxXg%zjHybps=7`h!^MjvJtcBQzIc@=<0XRht(*sEKfo4=FByc?(#prRhR;=tJ
z_tZ1&)7Z9Z_VILC_SJ;}_C|l~eZO*-Z2(?IbB4A25TMcC=<G0hs7(v2^_8?$RR+27
z`dNu0k89`kv)V|x@G1FGb_PZggdh-1X&v=f@=xrp?#pKD^}!2(5_Civ5PxO+Ov&Is
zlH+BP^@x^1@nMn}DU+-3SNVRPxp9em&kWf<t-~T=+vS2zEjIFuM4D<mjY_U-koBXI
z;e?4z)vg=0$Khlf1%&KlT2kjD_kUOUJ?-&!f~?=IR84|wTj6zXF(1*=gmQSF<b(w=
zTd>Jvn-Q0M3#wjxMEmeQF|b8_{h)*Qs1EEq7M}1DQJZwEHsynjmU%zq8pDoLRdDrk
zrwP2;mDt?Z$!@161Fzcu&eunUQ25>mPpxZwtm<-n`Aq^~hn*3t9=&nqz@*<>9H|Pb
zUQ~P!Zx<RrW>Dcnw9A7D0>*eds<`{I??<ky+I~dEwdQiJ-r;4Zvd|IqA!-EJEq<~h
zsCtBpbS!)?tNgH7u`KYSK;r?Cl9+6Bl?&$#PItS?FUrm!$zl)$qF0)<G2;C%Hd%}h
zYksQ9-(^EY0*IX!H(~ue*eheX5T<)?pf&gH`F)?1=?io(X%=T8+?eu$`ROhp-{hf*
z&i1hu8l5Yao4<6bNi^?WA$31>TDBDS!oPBrqJ7DzMqW@V*Qsf2BYWpmI@tJr<oTdB
zY1dalT3CI%GJlP?vRs^ii*P0&{OJt=)r->z0Zl#pKXd`rZ^BUO!jsdqp!$o(h5^Ym
zJZn-Q_1cndYV8*(kotfJxNBVq19;JGUE9co+VQD&Ki&#c-gmb6w1+<ZR!9r1zu*sX
z71A;Nu2azK0}fC?pAOGr7GQnDIRjSiEXs*9{p<Me+4q}$NdQ_Ou)e=gyDxkFg=027
zk6w(6d-V(owyak%<MCkY{#NODnDN_?O1%D4?c3Hqmci>Mr}ZY~{j7u!lL-8eGeNN5
zl+JJLQy*ykZZ1lZ+ev>ZyS5|-LJ)SPE~~=c|6*-FOq}WjdH@D_2pAD1F}*8({W@1y
zKg7*m^lPB?fu`OzPwHtL=)TL0f$NWH7ny*4$Kwyu#z+hW_Zno3<fzZuM!<fMGt8_T
zFAadb;axyrR84q7jOrdQ68<2DgJBYPpywd;jgC#w9(;|C?Fnh$?NnCvkakK0_Jf_u
z#E4!jfks*6XBRn&Sq2^U_iJp#p<A^K6LMC4F?#6@<)%bV^u_OJvFw{yexAsT-;U7}
zjBeyBT!%08*rT|=?w40Nk6qgf=Y-gIZP%9_2bmc-^}d*}J(JYBA9d^lY;VjJ&N4=O
zc3g^aLVNHpj5o~!P|&~d2Y92db)ErkzZ$9+bv<$WPj;Lq^#*LUX^7L}5Ww83oN?v&
zEdbw)oe2`eAP5A%w2>V6|Bvm~R_HNDfe)Ze2%@wjIp2Aoedi>;YUBQ#Q=&Qf#e@dD
zf1k~T@!R^y$hl^{^|uVxC)Y>dy@vqcx9=uMifwkl`?%(Fs1zzj-EIr(I3@D*BW_QN
zcc;;MHJ|!3wuba$g`Zg*B@RLJR2l;&wCO`EQTW+J?iC&=^gUNwnaKVA7F%m>Ol(Qh
zGV5&%a!<WGROz|W-Nfxx;;SyGjA?3r){WZ#c;RTM7o}el9H@-rmuMTTj&q&WijQ>0
z7B^5E*TFp(JlO}PN^gdhV~RD$Ru;_uP(*ivGXJ{E@{DL2mFI1S%|z@w%S)Rc*=~*=
z=V39G0@y2gAe;7FW^TdjHEi3+TDjuD0@ue0snT6F=y5f?__#3jr<;8Cc_|g?fA4hc
z_WVS}1nNZu1}_)Jq^rNlm$Gxqb`S=k=#(@VBlDkF{U{snHS3TLfKuMcf#8pv!>ybO
z?wpEUL*B+reM@kU(e_I>W-XC=PlY+0H%;6poXJ^wzkvl(&;7P%g4V<77C8O5Ch``f
zQ4BqXof_LJo8B>Z6Z4?)+F$az?hlx46J@Px+IDHCg7eqA`2NtkZy71;gqG^Bk7yPk
z{hiFCn{x21@X(L@%)lYqyEy38DrTn$h*IJ~DDH?1%C!|D$8^^bx3ybK94<#;Cce#1
z&!3REe^Bd-iF)V8<=p69w>K?N`jJLXuP*qux1BhK>m_dnMDH}coO_GwrDetn9IANh
zX(pZY7^r`y+hvK*3GuR~$6rm4vC8#&`SjB*3q||C1h5_siOxU5fdfxrqeSQPKljB@
z>XVYlNc*9;l^O8-G>8iu1w8*%R+_dDwm-=}l$`+%gdhwAzoab(^#32bTw-^PlBM^6
zO%VahbcLU*y;qfaqaNOmVFw=C%kBx~dG?IqKI5%6nf$fgfK0DbiQ|z?&RJA~#T(K>
z8*Hu4k;vk)Oj#UNaee|h9!>_<g9#|!qAkRF{`B??%p*mb{!7Y}#g9Z;gCuLSc?ODS
zo88%FJ@tU%1BSc6<+!1pSe_`JH*{E7wX<T;)1xRRiieH8-fE!ub!6RNJniPj-+DDN
zM_0Tf@5D`%A2ziMAFonR*jX#*d6M{5Id7|7)e(=XcuG%zP7KGpPF*fFI}P;Q9d`DY
zUPD0Q!IT0<($Ey&=i3Hx7jIe(PMUv*o?*q(yeEn8gNA}$ed5nk8%C{8c9O&2d#hEo
zSiF!${}K2aT`iq@%{ZI%@{<t$I)401*%{zA5W+z4O~8iB{{LgGa$;;HjiC=f1`B-W
zVQpT4{yH4H82seleNr{FsVN&E_<=@wq}@?Ru6SM+d7(#GuD>xLcq1<~@<P|0YzN(L
zOl61T16Avc2i<PWoyGkO*KK(-?fJ3h+1lxv*<BP`nQ8@X_%0xRQr2oz@ZKb~fcRuN
z4K5v~cwaVI4sXwTFcRk{%#*y-^);g6eOW9|3KzGQBSF-EH;ERC7d&pFx^1;&SBu2=
zzS<r4YZb=#tNyME7@uct25&51f8@mdbjjd{^^5$1G;4QmrtSAb^_ymaT<ShyLPMX|
zO!%w&X$vCn0X2EV9aBB+MdbVaD%!2t#oKkNCp7d{9A^$yt&mpJ`?SyTh1#R?wl)r1
z=#=MrQpm4UW1*oRNp9z}s4YbFIq)9)%io>7i=Bea4+_oAt(<GEv0(G2tF=+>y4KDr
z*!<^-{66g;%B}#3VGx9UX%?L2{~z1!HWJTu!9IWk6%b>@6sChA@e%{Ag#BW|D6D52
z*!;B4=-6I439$LBgZPU<=$knQHV@wnAG<c6i!73Etu_{mskW503*SQDa@XaA8|$yY
z;g7Y54rJr2{&w3j!JvoPH&Td^#Dz2K6i+&NS^pVx><h2HHP2Ty<nbHGT;@s`M@Ljp
zhW-mtY;XYQry=*YDeRAnl_Hj@g8~$KV42?wm5;DaA%N!%`I;;l%?t2^=Ld4V@$}aV
zy+~bzemfUR$790tM?TIUeEO*S`*?!${%rTvj{i2-lXWhN*{h<|n|SKvS?A_>0nejV
zU<(l7L-Wu*;rS!Ga~$}4`2EkO6vd`USb+~pH1op~ou9C_$z~nI9hZvet4LH-e<Ww#
z;aJ#=i5+PYx`R3&pw27BFUGFu3Stn1&D4q_`!9B1Bt6;}93T(1k!pxqz^(!}*j=zU
zOU_-JqkP~i7G{5Fax5~-KfaQtM{4!FvXhtOn6}v1BDJix`if=~v#3cRXCX^3J%u6F
z<NRK*grkp58>D(*2dj}CHh+k?Y9e6d4qaong(r)V@2LN-2Aky{#{<3?W^c$5HLOvf
zYr;aOH!e(>D;riqryn>a5UiDH2e_q9KUwGIU^P9aW1g%$51h=xd&dJtsunx*$8u-M
z7^G~p7l`!SllwTudc_V-25n?8YV^*)_bE6^fB&$$(J9fR(dT2eNi6KCAKzE6cBs%l
z$Z?&5^BJ==6+4YR`j!YwecoV%3U*jm2yKH`xQlGFzk0<2pZs{_caF49cl61_j*Kf9
z`^dYtI%uKju<^>X@DqpjsvBMMGd_C!&Uin{&M3)Y5Qd>wf?%g`|BLNM>nE1Z*y#Z@
zP8h&O2>BnlpMh~SEfZQW^va}r3NNtZJB8o&G%yuB^6RAuQh_5KMumsvZD0ANw*@`#
zdTl({Q|#+l53c>aSPsF>zwikk(#TX;e4H8PsbNl6zr)NAgnc{s&cQwU+4tYER~oqZ
z>hT4()}BU=nPtJ)c57-*HFI#7LvWIwlO7yZU|O_r^Ydna-(Ot>rU4M52*V}MRxw`i
zrZY^N8fLk+iqDQJzHu4R;sO5Ea_y%FF~8S54~s2_msh1`IEt0v3!C0gb*b7T-?toA
z-cWKtY}Me;>_Vcu2_kagxd$h&_qt2cl~s)MePE}wNfk8u;&Eo#|F*!+a|bXHak=Q+
z;o}Wka~m3~d`82^3%tZ0RA3o|{~nkkzVXK-;$kJi#+%r99j0^TxWmQ^Y~pIq3&lUm
z&HxKS5Co!EqLR$}Uu=85<zwXoJHYIS$>2_gPp}S{>nzwxVs)AKQMVXdUsx~28TLRg
zF?nondWlg8{;#e^hbaQS<SW8r$UAYNFK9+=hJ2|mwHw$tCGg{0bFj>gdV3Sgq)eL~
zuN;hQ{y|f+s?CjOrf=mT&ZcdDjQOgAlap1cOY2~!6JoE3$1CELxrNLz*v$C<EPWfc
znejJf-;c+6Y-W7_p!QiT(xoW9`l#a-QmBavvE`!1ZT{8F__jK)=W#5V=EjeBMUsHo
zZ`q%hFJSXbWdY13acRWVMJ`m3g{h7Y8Y_l;@t8Tbu8DME$cw!IU4<UKnmlB)<k^y+
zzk&?JC&88T@_on-j<w4y`F@2Qv&0$_C*XYm<^^a{+_2<@M(z%lxUsq7$qUy6^x!iq
zew1BX5(6O!yOQEY-TPmx`_V*OE!h8MKn#z`GU5rdGFtmvF<E)Z=1X)yD9gf_cCZd)
zZHeRw)jmGR$<L_Pw(8_hb%Uh*ho?_-7g_lqntgzfmVci#zvGvh{a&C7UD`1KZOBDX
zWNP1-t=j01grmCX@{in98ch%}lVbmxNzJ1VXx2lc$;>|=<|XkZe?A(d<_&tO5(6Ru
zzS^}|t<9RrpGAiT=(}8P$Fg;E$NezXx3+QD@jVT6bwSe(W0~x{HNL86B2g_MQ6YN1
zkLosF*9>IEMd;5yCTIHrMSlLqPS*EzFW-tEk#=e|3Hp&XP5Gw;vPxc77hweO(#F`N
zSHe>n$;&TLeT5fPlo50TV(4{bsBLRkVD+s?rqvLx5u^c9^pmfTPpn7ix9$pjeXFfk
z<5lvDvNOP87zCl{m8kORy#K|PEc3Cf3v>q{TKOV=ei7RmnTxY=veY!>(`aT5x&R2W
zSyMCcMwe)0A>N@-!yF-@|ET}c$--(0y^zqSoZKc!ZmoCGrs;=}e~4>i(|=X)^ht(@
zURtVor!az-U%YIyvE7*$MI28qq_Z90_n^Z?GEfWX1D@Vjj;y=JJFnlHab?h~h3G*C
z`j5rZUE4Rf*37NQb)r^PN0Ri(-*^U)RU2<?ok9;qEBDpG18mWE%;@%SwYVTq&r|do
z;?*(LwU{`LOBCRb6swi50ZGqpG6&Rku#RNu*Z+>%EIlu!QB8fl09l&qhmUVhnsX7^
zy)w|xX40EW%_0tZTl2<C58gtztFan4!FPH3iL9$Gh{PbNpX0|dQLoqd2G^ST#dY}D
zMEyc~n%Ae+c3xK+Osn}`Zj6pGYVNac(G-KEi^lav6ZdxH1lReb><n-u20<u#C9CCI
z?|-qG><*7f+JJKaqESSAe&xY9j{*EWAD;O`x5?=Vnucb!G+y^^Z#&4yy(?c7d_Mm*
z&24kAM^Dy7X^aBZTmBUJ?VpmpsWBHp6LMsmsgnkI7gbKCotsP9X?>r5`8A-=qkzB)
zT>mxA92yHBaa<qSA}XbRoyB;q2NyBME6o;lwp#$YHoePPJpqXKl5f*|tWNgD2qAMb
zSUai5_BhwIYwO$MiWmSx$$tP6pnj~MHy8)?6y-L>I?S^sIKA<B+2T5-GWNJd;p2X|
z$fzH=$VkrV`+v#CKVyDtRgSvkoc`iXg%Btg*%~!s4Yqf1Fjvm@M2*-cf=3YCTq!It
zy>VJ>lzMKtCR-@y+l<tQhmwVJ!Rg~6iN*1!YMFge{hk}E7%;+?I7`gP*os*OMzBYS
zb({-tg?RpHrmBYZqU;Q^7zRNgdL^4yko#Y(-SDAJ3TD?04;k!eM#S;s*wV*9?N`tu
zcmRC}3tQb4TwJHm0q@SP(CL$7(5idCOX&2;7}}EtE&p7!*U5G^UlJkHhhti<wQxCk
zB^4H|)f&9k#RS<NHc}VePv<jsAT`*o({uS|e|EV_Z*gR{jh3tQ$t^@*7deY-^vDo1
z*3-HmT<CE_j_w$<pI4|yW6(8kxkjI{I(7rr?|?&f>6|Xts&8X#7qPxJjp=Ta^b0yn
zkGjBF7L=vX4yOX6J{1s(=d)-2gLMVGxH^CEQv9)~C2bxcmj!3hLws>ax1P<gV?~6t
z=!!AwLS><VK4Rvo!sl1bJ0Z`jo&cNmb!AzQmdgE9**VW_*G98lvvFY@fYo^pfgVM1
zaut3yDwiF<sd~V*ZK^ExTzV1nKjSxJXMh7S2m-+`$u%qW{~x>La?Uns1APENK?Ro;
z|H58jzzL^^U2jQ4^qW)q;hWf_q2A0zSR})>=CeUUf#_v80U$&5qr<t*o1aCShjz~E
zX0X>=GRM;jdui<)QMjrxSOU^R!=<7+>c_ANL@$~=$N)+wOl*W5A<zV=5#A>lKbL9)
zPQNbcrR=0vEyf}ypN+9tUE(4Faw9c9-r<qNntwRQYQ_vi&zH@EuM9?wL*$0&O;<E&
zQ1$IP;n6=Uu18IO8=KmfbJd|DgOq+*^Ug$~E?y`7ZLY(fZ#C;dGnq_XOi56BO^V3V
znj3==9v8(F(l%w|W)3e{bOCA|qtU#nH!e&#?W^f%37`IIY};$r!kk^cKwUglPx%8P
zvB(IhPPW2FY3$m~AoT&mDmKsHh@+V^rxyj4aDT6wADTw$c~n2ZGrN6Zq#i$ejp+Xf
z@ypm1ATbPrurC!U#s2?e+pQ3~)d3I4Q57i0D1X885f^<23#NYIot5Qa>TeOLP0Ji9
z44fB4<}wQ~>aRF->y{JBocea2g*f((g3o4*dC$S9@cliIfsH3q&hshWpohHFzTvW5
zfP<EZ+1_C}4-C9PPyQzCJuvbI(G*;L6a@r*JLP&@g|c4!W-pVU=X_d;q+s&<VopL^
zN7G>)MpN+kO$HSD)G8S`VZWZRt*{&w*nDJ?DkSmH%_0E~$v0!_oc-5lpT0fFRa)w-
z{g{3y`Mp#~y?X%;4^vp4O%Ds!9usy+5<6pd*50Ox4AM(OP}k#XpgHRGyU8<&jK!GG
zW?+D~zsGYMY#!!?=L}%JOwQS(Vijpa!B5~^20gMz(b-#rv3DH}<3bV_N?>)yo;E^X
z7%(H0tJD>ZV&%Y?kFyCrwude)q-9c6=^*XNR`^B986`0YgFy65q=v-%U##tPc$-=W
z(m#I~(5z&$tiFR~YRj=D(O$RAH_iF4#fC(CWT<{>7?nfIk4xfL`ICN~?~bnCHLk(U
zi>)<8`yQ;(<X^UYayO*eH)e*o<GrdHcr{spAp`|BUH(Cy7nV3LHVQO*$b`k;)?Zio
zB4e!=XC&5hgZl{4J|s?)qqZ0`42<=LE7lnLc|k*v?R!(vzMC0vEx}r*{6!AgK1j$^
zVE!J4W<NEhwB68oQ!u<K_mvHVd&3}MxE$ULDhr-hTzxHYzDDTwYt_eYaQhj9??108
zX#LL6D|Cczk81x%Xurw3i%LxOc90n(ixp}cs=eVZm0Q7zV>YV&iV$G^$a~(cs~(nF
zv>sIZ1tQx$;IyQHRArwquGas)XMFX>k<%bBUK|Ke?bpoPWq%O%r0k56AOv9;dL@gj
z#`|AvzkFp^CdC7EkPtd04f3;8nA*a3g-=xb5iq!2l;zhsAql&=kW;Q?7<0yQ8NC23
z6BuaIU<v;Um{9G53T6yGeJ~8;IlmFG?t{4&L<PfJo(0(2_9tHJ14A(SD<elPA3P!0
zI@l<y9AiF#UgwYK+A@XR%gn$0t2#uRCLGb)j?^vP4+T)B0>7sen*saqhcBgcPsz7F
z<&^Gwo9rnMcI?k!T04a`PPcSFFq;-!c-y2R`85glP9CA$k7<Oj?#0OPtM~VK!7u#4
zfxR`30<UWl%x8PwlrY$j%S<!hJCW7GrOsl`EeV!OrNue7-3AwP?vr&U*n7r>$$lt>
zFq(xonhELtla~`Y8l2V0d9zV(uL`T_QB&|tPdon9g)e1ilmjsc0?{jJrIz0RV*9c2
zK~@6p0SFcbq$A=c{BBvu3+H|w?Khk!gF|NC2%s?c%{(<NE(*l}?6xHI9OeS%(_7Q{
zc|;EDCv5+g%Sw}dn0WJ6cO6#cN6;>WgDU?xYY*MBw)?#(JO#ei9q03Z6J5mpBEIa^
z*&-Mjha+n&<|Q@;JU`h{xq>AFuDj42)L#x<IWmRp<-kQrkU#IEJRTdux>`2i!eE`#
z{GK<S>mu#%*PhJA#d!mj8fWi}t*4)Co%U?ZoX7Y4JYJcI<LqTTL4grCd$&nB;XLOu
zq~2?`N+yqFhSYa@5IU^vyozN@pt+rDCVSB?@0VSCa}Kb=RnHz5bQYJwx^FZv_ocx=
z*du|p^SFSyM{~EEsMQu{%)PU=oC*g8*te4TP<91J48tI7rMiucvj1ZJG!obN1Q~$K
z*}(z?mK&K2srzlLC=xKv+vhKH&3?uhix4*E^W9#q@-2{e#fCy_8|$_Z6EN}MUZnwx
zC8XXMqrzU1j8GRR9V$-E53df4Py&X>;3;986sd>>zP*gtI9T!#zh80OuV#ge{htzl
zpNvVZ_$Du6ZCracT{~g}+k!9;o?`J67IZP6kIPPuqA&HOibI8$1y8?b(fDyUMiDST
z2;(&QxVqx+@KR==IL@M!^U3OU`HTF(F2(00KtW_tzMk4keeb+@eA=FZ-OBX3)}eZ+
z?bpDct)60<m3uHesyF=}&7xNne(F4Ynl*_ie3eq&8=4@6FYTm*u{DZ{SrmS9O#Wg&
zV+>LFLTvT{qbRpU;X`ZIN%oHUqwv3+T>%oqAPD=?pmv)7e{8+&OnQ|AZx2XumIB5M
zRHR?nMr^TaU2U_FasA{x3Sg{xrrYkS<zT^P=i&#jhrJqm8Kv`<iyt5c{|4^6mOZdc
z^+SGv2~qe|{NF6+?cgB_{|4UlPKd(qf9&=<uq^K^cDpChzFamN<WTa_Df#G?WqKG3
zFsFjFNEHx=uVsVruXxW!57S|cU_)WqSNGfpAAx0(etDlPSX(yCs4VncuL~1NF%$DC
zfinur)ULAs{_7C9<={DkgKbrfO_VIx{bO?YzoEW1AF>6-19~A;h@{yS(%$npG?=D}
z`UxWNDJ7TXk<%M+O~-B=Qq9Pj|Nj`1z>f!97ufdnkFQrua2^Nz48UU-%<!eVJX)^4
z3G(-bWBDdZ@K}a=D*|~gm4gSzM>dQIx?FrXJA*8VK@f;usi_!z-2Y<Ji|}!ghxY8U
zseq9Xt(350QQjMCf^);k-@kgj%bW1`6D7k$?y}3+$=@$SX5TvceQP9rPv?-Y(-$M|
zGYGnSH(JK?lSX}k(x9My%2li=g011nqaJvD1MU|D6tu_d=Qet7(}IJeczOZ%maDt0
zmD>)upJckrev*(e=bNrx-xJ90vHZP?Q_GpYGBk&dogSo3W_hu@d0Z7<@$)Pve-FD*
zRE~N9XizAppo&v0!9|B^rw6%u#eGoE-ml6aaR`RJ2fSF`l)nus<xEZuiSrHGe4=3Q
zk?Pr`AewsJMxeMimLcMIt2Qfa*n7_nvrYJ9_0svEQjXI$*~c;X39sv7nj!DiOPk}a
z_#&>U{H=bo9gz2c%^|YY@0SDeUX}Wc*P^G80`lJdA7FbK^L^+xjb>NNHRk?}guEAf
zAyo>}=Z~^8z=05if#8=etAhRi$Ie`iDT!pO52!%9ZQ9L(-grFo1w?w!Ncjqc?tXT5
ze`?$oN6ufb`D{jb-x0~E<up_H>kqJo$WKV;<*EBXcc0pc>Bycs3%Gls7ZCz!c`12x
znlIkq7TPg+;aLpsem*kT^h{7d-LH4;D*@EKvio|zGWg1EXYtz$XSc<+L3S~x59&U{
zJg0>xu%a*U^*GAZFS=wQoRxo{InD*X(zx)~VD1}(Hn;Gu@A=v{i2H3%R}&|H;~)la
zkL?RjpNX!0v9M2N^!MWT6fbt2=%Nllp{p3e(BF#(w*>94qX;si<CX}a0`($Lz$=@3
z1eNld$cWFq0&&}+^7bI_w_JF#_0ER7Uq`A~c)L3r*@jwSO#781$+!u8wVdABak$!7
z<TCPmWv4t90-qPi?|&<Q89SF`i$M^GZixW#v;U3VH+UYciUrIvu|Q~1JFWgV-j)-$
zM`$^5dtNN>JV)cg1^K<c%<2g3H2lNtBG1J#>xob+=OQ2s?fz-G$BjW4T4D8F3zEj`
z(HE{%sZMb&aQDhVzACg`WCN^!<JFR2_m9`bwTKJU{W&qWYM1BNFg*^>Nw_TLzU>?z
zc4Ma(aeq%!i`%Zn{otxpgO;@!kBR37u2uvWyuHDW@;36{SJLH$u3fTi%@r2Etl<K0
zzm@yOR?0L^@^e9#Rl5wjkj(1d^Li5Oc`1F>H0z~$LEUSQM<dj|A~dPH4Rt?`#R$Xk
zO)Q7iE3@p8+i#p^wD(tNx42@%-5-rn5@=7{?q9d-0UMua8^0XdjK>Aq`^LGY!Np8t
z#t4JFKLa+?KL04W0vw1z5cVYpinsrN?2^0Ll4yWEfJn5|(lMXl6T)~u#%aU67Yv&i
zuJw;4X)lB+2w(A=gi2h`dO+A<a10V12bEqE+P$gm!m%tUmVfViz`N8Q^alHW@|bDu
zTC!jFS{U?agh*VFcr?eUAWZvalAse``dS4o_ueyp^^(K*y<ikmFl>^k#@_dma-<zs
z#j@|+A=AOK7+rMljSIJG@C<|Fa>V%kzhS)|M6TcjBKM)2su^#+jTY+Fc(Y;P+aiL;
z{Husv82AYOb#JSWOVZXu+PrGwqry}7f|t1k|97OpW7i|Biy5CY#_!L1B-!nqzeW|>
zH1O?xUEtju7ku+;Nt`tdd@$!VdB-Kp2?Kx9+U0kL8S}l#UR16kla+PnT{g`L?_&C1
zT-uip{!(@YI1qv`>`Q{e%Ktxh$tAQz&593bP#hiW3TEJ!3R3s|Am;+Q?@w;EK?f?3
zR~J1Vd1_e}28%3DnIy;C?!j~crVE(Q9B&E*_{up6Nx|o(=r#JL$Uygfjq-iu^YPf7
z6_o`uz*_md)1DIkx~L@Yn*HvS@YgO6!7ka*eXr0y4{U}u-S@SR&#WCURpj<}mWD6>
zTa>7L!sxzV>({nBa?M!CfzMPx%UMV={sKOB!R;kH>BBPht7QCZJgN&9+lVaBnFs^!
z?a#H#?ZEWt3^r@zX)??^c)nw>v#;59;Bp`N51HVcNqG5v531=}7!J(y9pHpP;Cy2s
z9e-M9OQ>Drz->AqxTs{Kzw(5^-_r(9;s{)k6A3-|K}%-H9^}CE;QuH)7aRtG5Qtt$
zSi0!_FV-e)-<WD(dw|K}4`F<=I@yn06_dh1jc2GXD394-@PolFzAN+YwU{al#!$@4
zUeYpQvhn$K;3O`Q@-U{~=Qb~4&vIkAFc^HT{Kql#0}%{{>49vbo<-EH_&a6pt9@NE
z)!JLF#ianaOYtt97>t6I-`mvmOjH<K)aHqI@l`Qx<RlYdMtKR*hvDR>Lu1J|teX>K
zliFKbrxVBT%Ij^BLEtm0)-<%ykNRnrlg|`Xjj3zJ0>J>o^?ofm`Y;m+=5%w*;^VjQ
zw3HoH7oO(oBX7KhPRt#ae}aZ#IQdYDmP*>4_;Z6z*E>!@*C_}HKh@YA64z-22>%@Q
zvX~N#Im!-4UsIi7GV&1*K5)%Z-y#_Klj&s=kNWGF`Ed~|33cLelfgLKW2=*pjC>IO
zbJ$n$ld?0)ffxjV=#`3Ni}yd-e)VCa0rvnC6baIC3LkJ=EDH&L2}a4<e2Gq7c@k2T
zV73HF34WQ@*RU9Tq<q*@H`?DjWxD8KpHH>vM*I8df~XjCTY<SEkvIm}iUfuZ|Bmj!
zcq`99sPH}RxW`Yy6kv=povG41jr5gg4SKlXS*>faJo8C;CI}*b^SNJI=BfMg|H03O
z9zNc)Q!8^)BtI**OnAX$iMlbLn$!&?{tRZ-mIpROz9Q{T;JhZFkB(3cPtpL(1B~AH
zvt^xHCcu0H&iN!mi63eRu60?SzToj?0q%hFL_h=l?W(ISJCD`7V=kOMHX@E2f8}`u
zCBB$vD*on?<<5r4A3OO-1vZvV`t$2Bv{B*@%H7e9!P=bjedz6%$p0MGvBP+ZY|E;D
zl$==(!$1f_uM}`H%l$9bkG3XKkRb;c0mBmHc}jWqUtpwYf7jkRJfE2g%dUqIg?xC(
z44nAIx=R#)@d+WYf`Un~c_fF~&aT^;ztQ2l2S~p`gJeb>AF)s%dP;|U)A2naDfB3y
zj*qA>BDio}oPpxsFbwZnjxQu=nd8rkOwGh?>(L`NqrjLdFjXj0wG+2TPgyqV`0z;8
z)x2%$`0(t)bj-^iP1VoyLgM!59?mMP9rKkm2J@_OL!*w5XlH_Z)t7xum8zmh)=J!t
z3e$~29RFsSF&8wL?L%7DZu4I{@oF-tWL1+lc>Lr=aA*qG$m1tisgJ90n@iaFdU)=v
zz}QrUR<N@r>};+=dnT6Ab$h9hbx(a|{10X4cEvCV!_bvl*&%fQ#rl;in)cXq03E_3
z#t2z_CUDCVDZg6K_)C`~cfmw3bVA{rq851zE1jjw=idG*SbPdLGWSMHykML0ZwwI+
z*c!Wgve09c1Kohn?}1*D5!K*XB{ErKU$;rJt#LO;Sm=b8<!%C{=Z}?@B61xyn7z@I
z-v#b8?Lvw_D07?kwyQ751%aRAN7SpQ$qqU&XIvbNqv^3lI_$~(5ly%iF8EgX4D_>&
z!bi~eu6jVb7TJuJ*@?*!4ql`d;tTd3n*iq#O}lXSK&N@2tiy-7`{@p!yWqGr{128A
zZU{RLQBiB~W$J#$7kC`aKwlOC+>-bijke*lXt)JaVS5F63ooL+l9Ie9vb3<{i{^)b
zxYyI#e{Hsm{k^y`T|c{y0TB0&x3+?hQojFY>}-=520<WtCZUpe|BLlU$G1+KS$Y75
zXz*)!;wwbp>)a@ael^BBym&&9DIjOl;`wD7r>&p3wrr2>7*a+%TU2{;a0%{Fo+l3;
zt<4Kj0+h3=`AzKT^*(~ixqGfLq}$(MdgNDH<Gn5xbYTgW^T=AD+Ye<7ZuPd`f=IVl
zLP{Oxb0k6ioN=LCDVx=Kp1+=zQ|gRa8L0@G((SAHY*t1J#wHYL`paGcfq!~tw)e<x
zAlwha^JsJ9c?<Wd3!D@c?wTy!{`hJZ^d>r`+k?R;FnW3>JOJ<?jXhiw==OtWCshSC
z{VlVQaDRCIyTj_cvrAy&?U&Z6_<H>~E)OOKy8Y)(vd=sM$<z#s`4C?m?$h(pQ4jI;
z?~vNEed*K()ZGmV@cW{Y-{QX2@>)o2)&6w6duxU7E$I8jv)PM--|{+gK;P%3?KKh7
zgeLU;bCZt^)SIy@z+oT+VP6_>LH+;7mfS*n+YI#q1`n}9?cr`P!wbMUNdE|D&ki^R
z5I}w($?)>S@Phn4pi<#Uqp)w-#_}m-58v#H<7vm=e&m)?83k$k$FzY2{jInUMi}sm
zNr4*te?TTMX!Q~o2W>ymvT;JzvtGjT+)O)99R>hn=ExK*`)Q;3y$x;*9L>E%*^9Oh
ztEx57l08ffCWMvcQHfBPKoZdQt4fRTx+DqF+rZ}z!z#8{f92^#+b8J-^kfgg5EN@~
zpC>H8oE`mJ7MGK?=SrPht^oTqlD<E=`VfZr8QQ_xC-}Mq7No!esPC<+PnLipLZH3h
zxJwWA-*rk<z3bJl@gjcVf*4&rL#)$c{sr+V+I+_p-a>TYiz&SqSr93EyixV2EP4UF
z7iFIpsuE*KBMevi#XHAIZwXi9Qrl=4Sx}!e1{iyE!@3&{zbQN0GzLK!246`VnDzb_
z+mA`YgRZRyhz$IorrGON5qPZS?x^TIosFcNz-B?|=E=ag)#vk!6EQEYQ)0dh#pen1
z>|F^Jz4V^Rlo^ZW{`NwAtRwGEieM^cDu+CES3^9Gzk{y5JSaCSiW$6jwJRt03$b{=
zdr(#D3_|Fb@-3*2JmArKZ1%F2)fZcx=;dGC7n|}rN=Zv^b!_Nruf$Cb4A&mI8(Dd^
zIN}SM_AUopjNP~+4dQdaKZl8ol7Nn2+XE%3SH+~u;em4$Pnln?6%+4=ODgbOKzfb{
zOJx`gWZbv+Gw#8_srd7s_1NOt9E{vQGo_NX_F%0OAQkLf`CVn06^PE6m#cbHV7<E3
zK})5^Y~6Tpi9*`q)H|5BCn;@re$pxxv#S4cb}l#&gCG#SQWgB&|6;q@#D__nq1giv
zqyoipgbl1(*_l2&PZ+>GrGzo3$@J(lHyY>o<#)|J(L6XqH8gk51UhL#xaXZyG?{c=
z<QjbYNh8w9y|Qc4yn);!{1bVn8ODA2LzW-ok@*+~p*i3NaDT2kgmoSOxIZ*Qh#pBe
zLb&&^IgXsJ{ma9@nDiUPdGe2fa8HBXbDJ}pr&xAs^AgL>whG4m;*xj4*IF$RE(q_f
zT4b=L@nCDz_Ke=3!uFadHtC%@69C-vCc|M|jU@Te`F?U+I;o#rbLNfC_l%x3hFDll
z0<w|6_WNZk`+=2}OMCVP?z@MFkO@k%PgM4GJ(#ScV&nGT4_hDHOPkEtS}(W=6!6SN
zdc7^XT116D{=v8RG9H{$2lIyR&yO7tP-1dZij$oJxj%&K+gR@O#thjc>wXwJqa+An
z5Qbi<Zm81xUu-{id2~hxJU}LBTWVvViS_$Z*4uGfciy*S9I`z<4|N1qO*xuEwbzJ0
z6&e?gt-6bqLbcb3)0@Vmh3RaV1=s+GIyue;Y)CPo^L_G?rrIyBQ0?>156}C7J1m;&
zWPjU;>-<C8dxv@9gl@seUimeFb=+#xx)ANRu<2rDb%}s{JTS*dHI>hz@BN9gFyBV)
zTslPgo?rRC8e%rb3lRumv<3g?*9EWVYOK?bvo~^qtMTK|YG;j7vVRJ?kqK#-lXgPO
zTwnjC6%BI$A8C<m!3!{{4^yD2KEol|@8EpqIt7Jjf9AYKcW;S555x(s6G4dfJF&kF
zI?j$p`#-~UZngDWq1jJr;4H_fwlWIMK8pi(;(9e=vp41R${ErydpSdzM_y&vCD_Jz
z0B6{%2J`Jje>KBOZNE~CFK1VP#4rfLzEoUX%l|*NyWUKC>Ol8^9Hm5x6ytAj<CpVJ
zET|6@@4`UUd+?55Xd{(@(fe!~hfaO21dE-%>N6R}>&sN>0*U2wd|?Vze5wKL+dsfn
zo5w2#H->qetTFzuyn_~j*|+yLe_*biXFN>}D&K24bI2F*`2tw!BV}G~F;djaVWc*w
z&2f9@m)S+_n!GPo_xxE3b^L1L^LxUPYjIsrFNcxZSdp!F|E3Cy^Ww%d%HCmbM8k%8
z7v&hSiwPfPWY;5!Bz8;hueAG8yDYx0$)_~~i(J^wA)L5>G83y{l8Z_Aq&UZUB;ZN*
z(t=88O|cwW-dIpny$4nAp*#?eTY#;5V9c8-*d~@&lP;V0jz1pz6<AKet-QBMg^n1i
z^8Q;9d?-5uT!%pzhF*#Ox&-cjv2FU>^R%L*JwOylLMg_?+nDXDF|7brzpMG#K(Ow|
zynV3HK7M~!-Kk&sNnM8S?HIa$Wh`%wV3d&VU&6|%vCAuNYB5X3?yYJZRy8h+DKFOu
zoI>S~(L}SH4XsL3<Ys=oBS`n{Pm6#R!$xwOwlf|6LF6E~KG^*v*c(Un-ij%Yvw}2B
zIj7pn$US8LZ{vI^gWL-yx3#My2RH?C??eTNaFr-H_rYyN__iVk!3A_rmbb$YLoYn*
z9BdYIj+_a~y*_}<bF4d~E*t}`!q*p+RrS0!54vG4Op82?M3OycM2ki_3Jaq*gwgW}
z_qLeuyqIGe<s7W!=DN=Ns0+%yXl^EG^Hrz~-19)|%eeBa#d6%Q&iTkZSHpgn7Y{sd
zge%T|%}OplUVZ%T6z|>Y-*YkJ2V>`w12G80&@1&58o2+(rqYOKW<UwMZXzfck{aV`
z_d++}=VqpmPtK5|Sjw>-xykVU(BHn<fa2pBLvcUmWkDofkFM-UFj85+;!+pIy>XLn
zOs(-~qqw(H7r{xl`}XDhDan-`W6g%i@SZa~hrDmuJX3x>08FvTD{BJ-V0ePJ1S9z5
ztOh%qDSUFYb!wVhGT3ziumRdh@Csnt!M0e=$7bP&;J#=zQ)I`ocf%$Jr|EZyQ3%I}
zX@=n5;bUAEj<RX4Q?Cbz#P~vQuU_xttCRQMRfXrRPxV+cZ=JjMfi`<~W3S#WCIn)H
zW68XsxBrUgzYT8(i=4P-ejyf6St~QMAucBi7CCXw6hSPwH@xo0Za=%hz5HUZo4!bD
z0uY$h0h-k3@d-^4cMk`pi{=(<{R>w2_oC%A`1<em`$T&DQNDjDI|E#YVGxF1iEj9(
z-2Y<Jq|c+$CZ{`qg_5R_7z1Cxc&}l<5U($v91;_2Td=W)0^iw{wY%Btc3xBONL=-j
zdC?@Np^GY#EtI?vlOt;UtryH|SbK(i)I6d#;NxSA!jTjSq;D4?+T0iA99c8*=g)(C
z8sEe=l=|s4&4RVR8omwAeu2@viRRSHXaCfseWCrl5Pd#1qvq^c@KNV{V|gqcd}$c^
z1Ni*hX*@t}7TjTRk)&OOnB9t-v%eaC-Zadt+AJ6iMBK}#rG?r)xTRi~e0nf`ivoj0
z^uD$Hf4GXfb;SHm-f^L}544+c<Xv#b#bk0#!pJH%AByAEbnZjk73<u9Td%qh#*FhS
ze~}QReIV--kIr`#a9~LLKra^LE9FJ=YSLc4Uk~wYlvjR=Nwq;StMDOPaGx)ce*0m`
z`2~#1*5B&Iq}m}>2Q06V6N3A|6KE<};zijR-9QY&Fm$DY@D=u7?7nzLI%K#3q7ZP?
z)HvxO<`>T#Gc2KU_pg|hvts0W*#L|wr%$~#hPH1^FnFp#lJf|(z156Dm#i!TR|8>A
zB=??;Fz+_GAoJg9M%eh@SQ}#=jLez|+TJm*8+P#g#%1SRfaHGNZ9tMG<bt>t47kiC
zX9<BI?tM2c>aRE7#S7wo|5Rmct8S8kE@PGvrvGE6X{b|VQ!0;sh<PHcbH8jUWzULg
z!Q8JPLGGVtQHp6fqAvLOH!xWhE%nV&&1I_|JUfT^_55C*GvxgmbG<|us(TfmGo6Pg
z&l6z<*;rxvp7N!XAn!{XKc3%qFm9XOzBZmUJ}t!JrbJnUuF2igKr{GISEiyhxqJ8C
zJk<cn`HNvWVq&1Gah<DzDY|#OrQgOonfuYcjGYS(#2^SnucSq)-2Y;m?1o1ZyWjx`
zeo*Oj7}m>L<%6Dady&1#vGKKs2esNWS9Vl@`w+s64r^13DUbay9-ri?TVO`duWF+l
zxHnWi28tk>|H4zp?Lo~hy&^L6bL_A^wkF4>==aX>8;h0S)-did?t^Z`rE&Lmhx~PX
zjJmKz8rt}xS(H~5D-Gj*thhgD(pUtSgZAJ+KRWx@Z-JO0ZQm$^Q;>7bN%IP3|1gfT
zD8-;j?%|8I(M~-tFJ<%Sk}lWjoOu{|VV<7zVIys?Fu9|Hixtop()NnRvqJ6DoQ$nV
z+do&EEV-Do<Mx82Z3uI$yr4s&+&AQmqCMK2#i+^cT~J#(1u(txd~fSzq5NWnXELw&
z^yDzxDm<^3ow`rA*|r$LxSI3b_5d@lj;M`!9g($daMdiwlW%Z)rC)20n^OwU{yH|8
z4=R!K{duE4l$}u$!ypJmuVi9&HTS<*zkJxH1MLBJPzF(8XI)?-%)#~`@Ad*r3Uizb
zI`{e8-gNE-k8&`;8~Gs3^zP$VxWS}#<P<13csbY8a30!j_hZ#!oK<ZZiTe>OrqIs2
z3orpTcz%s=b{->0+y_|kb#va^FcSA|%!g&=#iP;68ARt?&#&I{?wR4-qcL`d#@KAd
zp8aLdr2M>)G9veaU%WZ2TJ{<b30kz`n#)P|M&&+|XQSG#z$YEnxNT_3%>1!ybneCN
zEatq*t1u&UzaI?$3MRtl^}po{%Xk|?wsMBCA>KpxXv}GpmnG(t+Q#5gQ7`Azd83#k
zG^DgfQ@!}7(eUnBwWx=r0!s#ig1);eUo{<kMH#nQF2Kj9zxuJ7jlCZQ_+;4zj1p!A
z?x}b~9$)-X8)Kd$`u|1Br-i>e?D}=tepm)vMmEHIj>Q}JMcEnPIt;=v^h*3v2YUaD
zO<x)>(~6w#0BNWTA(+%Dj8~T55Zq}9?zB+=cHKW!ikABSQ347d;~&sY3Lmmjkd3AB
z0ov<QKeJY;81{RHU4(*m<)ZR<o#(gXLuC1-V**$*yQm+_tK!CD@c)$D8KMIJkFmz%
z?)kYf{3=P9GVdJ4mwHdIo*R4WRQn6xP`mF_=v2#>?MGJLb5H#oYzTa1woJ{xybgLm
z;D35%S@_EPKs4uLW2d#i^vCX41U_JQPA0P#aK*-NfBME_0~a&I|1S{G_lk3awO^0W
z_o6mhRD;VG?gve3cS%%*b<+3SVSB*h*ceYTZ68LU?}e=Q5AS^5v(AHN>a7?yIX>t8
z+56LB$G35(qM*0pT(cN_TDqigaur3Az)!d+pO=@757h4WvCm_T+P$c&p7e#AzF}cN
z;cL7oI|CesK@f^wNwXF3{ukSl&i74ipgRCT6cN5(q@IGO7x}ww1Hxa1z1W<G0wDZD
zz_P&bO89+QsNeWclk-Rbf`7mU516k}RDn?MPksHTZ)(mR+i|aBpX&nC@jL&rr>i`+
zQ7^*9Do5K>0v&P1!5nwz<I__;<X<GL0>N@plY!zlC=^{>gd$<3*L}=?_`b1&5R|hZ
zjLtc3^rjqKK8#|vdHJYeiv>~H?E8f2CNO9HTf`>ZMTx3}!6=kxhlF#RN85y-??~bJ
zAmZ@`;4SdViQ}Kp_&I8JWKrz%Lv8OenOr6(!5cXKDoiaFg~@#MNHZ#BZ>46tYW_Mj
zg<MYLGH`r-J?4YrwTMFW&RHUU=w7Yxk(uGQ*$wa2I=M^^#rwqZ*Jaj9c`l28g<XB5
znlEo$a(DaJWT)l*GG7Z{uMma=#$)$G_2*p>`fzqeNeqJ^6ueT@BJutgYk#`W87-I|
zfB_8A1Xh@ZEil_+df#cCqdQO3J=zuH2u>P**32*DNQ9YFd;j6{_`P6hfC<9?YA(8a
zlxbETU-d02YZf<vcjfW7!Yvk7rMo;Ael40WJ2u;vAhDq!i6g9N3*&d6j_5X$N9CKh
zO2YB`T=)v(jD#R-tt37(5C-yBJr@&d&dK9Xdl;KR<}-PG;SeGkdQ3Zet;=c`cHYcq
z^7umT9+>@&unw2mVHA6&**4(YA(!cO7h%Uf3o{%GW_ZVaM!f2fG*)|@`pjJq#z#A;
zh7o^-xmbM4OdXy+!Csu9wY#%DJFAq*-vmh(o^-#TQ6I6W@oJOFS4ydfj*N?X-YnRL
zQsKTdRp^(56SFxbnXpoz1$*2*+Ub5jYyMdCrtDmAAcjF0ywY)Pq1}J6`%&HJNQrPe
zfR#5S#F!@%1GQa~wh9y_*J}mxr3mv>+n^+&gD^r$(yIS9sa-r)o;JH$?yb;1a}AS+
zq#-KSAfY3$j&pyg1__;Q0q!>#T>Q~^Qhv<bTgAo4c$QvdX~ulcV<v?l-BRHsV+HPQ
z0bKmCWsSK%7YgNX*ITA^5y~ICO(JD4r&WaVZ^(Ty*q$-s3od^0B{)u)Y5ADE&2tY+
z;aW0ngP&hJ*;p_>T~u4ff=@CC2&D1P<aXzw4Mq|`=*{2XJfY&RcW1v+#PX9&k%V__
z!LTU^bHrCI_a^Kg%U`dQ!R`~8EL6rY%zWV@VP%C1i}rl_N?asjrU&{47F<)yse6<I
z%YxBul`1z+Sc3Thk0Z5GJuANIGl4@T=^a=yVEI-xt?I|w86-CpgD~_=;1vAtf3b8?
zKmGpBh)H+ZFeHwRu@Hh{H(bY{3|d}Prp3os)~ZRYlkw~6`TG;;pQk8wi>?C}CWNJi
z1tZN@LlC6;U4!Sd!-@fpyL3nT5QYjqs8R@dEYHdB1LwakiQ{RpeH=MxKDNKsdaw=F
znlqI$_HhI-KX@SoAlzuo{-VA41JB6J5jih8_5lnm|6j&G+lw(kngUdwRNn{5$28RD
zR=#H3NZ@~QNd>+0qw)1{oJAYKWDAa8^vi~(+<D!OzW%C!)sm={Ka243Lq`HK{~&7B
z0`mEfr9W1l(a`AVzzj&G=pGPnaD1LLsbpdezxZ5^#j9kgmvM4@3Xx>GdD~q+_`t?b
zo(8Ejc``<Vl~8{xpL#mOhK*l~C*V@3-`<$1$jLa=+r}P@(|R7h_Ss&^e9zRC?h8~K
z7$2qGOiDeY@yWh4&3U8xxSvXdZ_3U!hhZ3m!B?7SM%?>fZ2ObXQ9D6*01NV_F5oM8
zy^TTTeDck#*;u9>#hNeCtxdC;Y&MwVC!$r=T)JTKQDhDakEm{CA+qt4J{WQW$k~9o
zzla%wG3RK&adSJ#Oz*}Fi$6)b0a`Dm&<o37*EP{vEdF6~V;K9cu`3a5)lnWkQ5`fd
z&`2lKt8tmY3zk!iS85FF2beXkE0IJd{`4CKznXPcx?u2wmPcWVv~FTA7<{kszD|wh
zxLN+gZLTlMn1Wi5tP5Th<9?PO?`vz<@`Gu=2<ml)!ADK(3*n_Xo7v|2LZH}_T{GdL
znGRx4aiCSug4tk%6A2TPb$+)jUQ1D8Qb6#k!!MDFZ_y=N?yh?};LmBdeIn~I(@kf$
zJf4nu6mGX*g8LUi_EYEzzozb@-C6(R5%m40alSd-fDx}X5l$DwtjRBti0@v4fIp0#
z0hWX?2t%(lY8&bOFSffg&!4`r3mzbkS`Z;kaaS%hjEleb*HIi_Dpxp0+ZKl7;i{qU
zEu0gbw(?FpF8Y4C>YVP2*0SxYR^7iHwRw8}pRhLti$}(?9)r(&h&%@~MEbSZFcog5
z{Gte&E$85iz3*J@8}MdhFR*Z{NS)<6x#$i0D!#adna_m@llL4U&cRt&Ccsd29*C?*
zKJzUYq%%J=MN~d*E*PZaWe2_b$cdnUy%$`Lpmj%n3>dKY;%5c(h830xFn=KJ=lq&)
zn7yA|g@&xCSk2zAEEj%;y|->o&ILu@MTviOzs~%EHYYbi?SJrl4Jo*1S-VL2DDfvS
z>hKbL-gn#GRORQmrF@@QRM=a9{YFN67$dOv;sU|z;t7tuNPn>RLK5YdN=4I*6kjO3
zbvlvc4b_Le|6%NmvK<CNAi5=$R|EUs*y|5>(k6v0fFl}I9LUVadOhA#km=le-53*J
z^q&O?Sk%Q{KXgUrIb!1b9?g0|^_x^YHj=2oX7d=M7hj)wWvRs0(YPJo3-%5x`V8y8
zx!o0DxtkGhv(>ztk+9`?U^;i33_sC(vBeozO>1kHjKZ{+>y~zR-H^P+6knY&DHuY<
z6F_G-?-Dd@Cy{-2yD>g;t;bDl*5O4X{%Kdxa1yf_IIaWB={hvyl7MZnv)u$&!uMxe
zGJ;xo(i6Skh7_4vp}KMNa*Py)u(@C#+RcRjeor`7<1_+l>bnpwQum#CqW9<RL^@D6
zq&pP&N9f#pJvH|4fj3<8tu3LImDWSmof<g{81Q|J8>buNd0pz0*HIgj+`FdiPmPH#
zu>0WOx~QuxfqE_VVN;2>=Kl$xdqV&%q@q#R;R5L1g!hT6=~uP%pRsdEVi<&B=#}^t
zqWfR0-T0}KcI@o3@jx6xKrv4dj5vYrKMmEYT1LA^#~#q}cCMfc4E}{EJY1$y1XF=O
z$o3ZBiM-HQX!pw#fseK10)ud`z4)89qYShT2377C(!u%MCo1r_%NN8TSw(Od#4L}I
z{WM=}9>p>QfmFGuqLA-D%d9vaHv&2Nxhi^n{r1{Gu93&;XNauc9^NwQ{qh_{zN%b<
z!gs#>piaKc7wSEJtP=?9?5`r&oD+iC^7h=vOmK8AR*VZp=H$AFLcKRT`*502t4Q{~
z$BJ1*ucBR!sBz*{5I<DBj>hP?(=bU}@sRN!>Wu4H#>|luKNQ-1hcxo#*PFLX>3xH(
z5_WSH$wmnG1FGnu&oi&Qm#u55LU(YhZrEeXsoqb6<Hw_|>Wq%f<tNR|8@VvI(mZ#6
z^)KV?lhXwR1>aV`$A#oM*FaN$T$%ebhho{hcG`Hd-CBNAc5XKmgD?zTso~{%|HbZ~
zgA{H^2e2qfQITsnf5oN+rB2yXgK|;U{TLSKd?}cc_jtTjtcphnL&B_fV1Q!=c4V0@
zN{83F@l`#lz;OUTR!N;y^8O4(%@>Be`<(;ZYY<s(_}b@C?fkK4Jljzw&~mnfx_fKY
z?4e+epuLL6q1uk@MJ`q{`fVW&d25x-dl!Eg8HdM4jWo>prUko*BVrVOseAs<fimws
z9|+%!T(*tN0(%mz*Vus6H99*nvq;{hBW#b@-h40P2-{6;HR>g0-a}W)e<;{WkeSz!
z5n!EVJ}H&G-$|dVDrP$8TrBr~7dv(?|J*<%wZ6W_SBV&3)r}zyc^aI`-lO?TQly(w
z_Pyap*}3LG41z%TN<OMM_rKWgkL_T@0DAxewMglN@QE!3!Ih+Zzk8m!sawdj#ULNH
z*s$BohP}>is6v+%2l5E_;X`q1O>3CnO09Al|I#IsVO*tiOV6l=t#&bfvYz|pnX?yz
z6kAN<J{7|q=t;|xAf?wFff5w(={b+=#F7i|6ItW8hEbQ<z;{8=I8E~p%zgMf_by4?
z11zpjx@L&~mE-*VZcNCaKNOBv!iV;qSwJChq9A_}Bv6n5$5;8kuG!&N0dRa({v}X?
zJ9PH5npxv@#0>54qnP0wvuisF<@<+ooEuTmeMev8dK^|$6s))-?4uM-tYxz@a@;M~
za48hA`o=fL6<bDEnH}Yo?}>8kUDt$^!0|N5I)$i-yR2=LA_nUvPfu-t_)vC6IS_*&
z5WNyr5xxJ#wm&;#A_01UiPf@hMVO}|%i*An5)({?{yA{8V#~ONH|i>=ygxg7*<cYb
z*z;U`taD_I#VzP`PsQDtb9J?my+1i<DBsff2l=QovQ<Z(mrclr)wYP+G?K^mFju`q
zPkP1sW`Y$NSt|6;ftNy++oXd0J?C7tfKZ`-PG_t8EU~Io8X;;o+bb21d(K)Gt0N}Y
zB91Wn=Pday{$CJb<6Ss0ua-RZx)2WsA7>`7If4<H##=s(@X;f->G~L+;a)Mm?U@0a
z#QMbR1^XPsrz+6W`N#k*Fb~h`k{yROs_!WlUexUPRdt6IQv|2HVuuxj%51ZE7wSZL
zG$%-s#|A7JrwZeFCW$cA-y6e|WqLcF^FV$Ag|o&?=ZycVn8iQD{fw|5V^@F!Aqd01
zgq~yY|Bq>6Y?r`wdjQdO-M|J{wHOTJZ3IqhYnowH@dIF1jro!>>mvzN{NS$RtSX%<
zsQ8XM&hM~+_q8>{F1it+c~U0L&>o9HPMu-&vgNmWc(Mk}ntZZufKc&6RUuVbo}uDL
zBP7)G)ZB)O?}PqL*kOkT3@UyEj3h~7HsRmoJ&73%qXNd5yJndAX7MQbU0LHW{4Gf|
zJ)z<|{_%(<snPB`hRu@s)3f*xet#LaIShX_f=gWFto5HtRYFgw`0ON;zgo-$Fxxah
zFQ%$@$?asZ^6X2|9?Op5&Kdp*U~|)YaUJW_fKkOaTa4he)!?)ESo2(N`hNa@?X)Bv
z!+!CV&;qx0CxME;J<zz`pFb7<rtDg9C<Z~;m2^Mk{ug^o_SP<w6m|dt3RZ@U{`GZa
zCzVu+^YE#euQi$3Hft^?aU6)x46uB;n<VW^Dnn?(H*#>IZP=2^5Ucp;&AjHOTu72=
zMuhR*7hTpibcBudO>+2Q$$+r&m74Js287{X*$-9+i9SgVGtG7{nN}l2JaN<ryu1~Y
z3RLl*`?VC8j52<_U-~qA4>SX{lkYiaeC<JS>dgkNZMz@n*Vgd+dDHiWZ!_?YqX@jd
ztLXG(!;auU!d0G_JqMVRxIm*H2I)NA3{NE&6=-dv{Yny&-U8Oq$C+|190XVuz<OIG
z`Yl>`0x)wf*|aQX%wg)I;c0Bh4%}0CS1^(oeauIyE_`#o6Z<fH%=Dq?<g{(Iu>MhY
z1ve1GAZ(>jk`wH|*gdYX(WL@90HR3^sZ46eSeh+tWtVZ`A2rQ)3tT>ZkKOr+p94hX
zgeJ$X1+InY`n(T5&^37Pu0WSO9FN{?KmsXzKvUN0LX%WJ)UW$RA^-4_HM;PkqwT&}
z9z00OU_Y_R#CiV#k^c*kJ6$vQh8J{D4P#pyc`a@l-yt*E57l#@+p#yaobJ8g!i!qk
z41VYyR65GfW4TUT#l%JM(YB02@>MJdeDuq%&GHgD*-pAc<2=rJN&$gy7@bCI=^R*_
zz*nQEHTL?-mrVKlIo~JN^r`bY)cKIvTPEO3lvdmjdBc@oll)DAzmJcN5v1gOOW~si
z$ES-9MtMD{Wj5Z`lKotA*sr`CLEneb)Tg`Ipzrw$q`~aC;LQZ|y+L@|FxR(z%lXUM
z6(m6ng0L^C)E58$vArw_(^_En0SwkAu?-Hq1p{DgPL4*(I^x}ieeW_4@*+m3+4rsv
z=n^OU1$^NugL~vG7zN00tgwY(kLd{S-jkxd)hl{W$)ac5WG1j<?VGF)$vs$Fq9X9_
zede=>O?vmv5I$-~VTX6`RD@mk6Kuk}S8D;m8Kpx<l9~GTM=<nDpYu%<{W9yGy#eZM
zoGYYqj4wF%o>5W_?i(E_*7W;1-bEw@r#bf!5w=4}^B#|_#x3^jOy>++hs>+^p3V)p
zTyP97*!GI4G(Rj`@0^g<IP5OjuN8d*#j7^g9!I(;;Sp=s)i*qz)!^}1b3GQ#0q{G4
zs`yyR?<OYLn)xGaVVaza*WB=-SA*^5DoUlsr4MCikOMIY!@w^QAO-&avE@=5l_<&H
zda(k#r9=jK5?c86SP|tIwZAityRo0RL_Pyg0e=0#lWrx&lU9LWuS_FOSDtc<n`A2!
zzzsqaTfXKmCuH6qBx|;O!CEB1)?#P}d(8X--mBs$$|t;UEdj~pPk8qh4-f0?Hxlsc
zO~!E~UJmTsrz@+hVobSb#qwc7w`0)$_vdx%Pn>iPMXds}{{68UjyZi2^_KRVpPfX8
zZ?S&r*2y4s|2nrUqTTVKXCis`7X)tIBc-DuTx355qkfw%WDFtIWIy@uG{Cip`@&In
zP`1LSXR=6o!WBOKDaJ10U*@jx>FxhGs7$gukfeOOdNAj1h@Y%jjX5`98y{c%7zk@L
zPHw`-77qg|FIh3VF6PcNB|8$|<ZWWReR#H3di87k7(25hh(QpDUMV8D-2Y<Z{Loe)
zzyZ2Uf(t?5Ii^a)V7reus=T*&^CINkd)V$|hH1z9>s(z@yLTfE)(adFRv(v=ca}FL
zxIg$8iTx+iruX-?$}B-|kJxf+7w-~ES_pafdNXp1pIE%V3D~Ka-stUi`4XA786qjL
zwK0+Oh)LPTY)I0nxEl=hLM!zan;B{M?#GTTMG=wj-)uM(4?~_+kYIwXJ>qHDb_-41
zC0-XAw!hiNTw>lH@peX*5|U3y!}b#~Z0)6&6tj@#-46gAuz4nrePL_ywMPltDAfD6
zsd6zpz(}r&#Z>=nbUlo7Q%K|XzMbQR(WgUCoK-t7Q>X=cVhnve;%z1g%B8YN!jB<F
zR&kR@+yW$XIx^X^xboa)JtVbudMVIv+0^+TWoLi{AqYazE3G79_rKV-v(x{U&c_b$
zM?)ZEh<6vm!w3oP$ap%3Ve&m!E{CtKteJd?I0X7k1O43Uz)kCTlc^ZjutEZ&FVO(q
z$gPdpGbdt#hd`6SKXtz;+)`{$Aea3Icjsg)x2tyVBn2!|u}*CrkXkPm#_UzX&$?sQ
zS?DU=-^NVZsyLpclfq`%rkmf*f$n(C<2uF1DCSKnbS}7x_d8Fy)9Pqu?H+TG8$DY$
z7u#+Vq!wPV`tJ(6YWLi=b>>QTT_wIO5&QFzw-1YcTOvl8f*195d&R_Fb%|egikmv+
z#MXm*mFRY@Q&3<$K$~cFM8(X#5X-uQ+(NsTwl(Va{mS?p)74qy-209%g)E|biw)4)
zit!O`)m*!b#zY)LP&71teknVnBm_bjhF-~SWGVN*n0`po5vFtxkO`}7aZ2oS&kGR8
z=5!I2i-f3VY~ah;wCsa3$L7cx3X7b?*TSX>MK{mAo7+lI>}4^@X(|Lo7GX0s@V7+3
zJoj!)+z01!6=4TIyi>X}9S3p$=lWIAe9hcbu3x^vW(Oa0HUM<RbMT%0drHGF7tiDN
zHrw}c{tT+x`P*wS4DHNtyXTc}U?Z+^48P*{=96w!XBMv+_xP=$<a{qELKm+4@Ex;<
zZ~lCPjNR@kJI~YcW*e(3SeXB-0vw(b*^OQmU;oI-OLLSxkK1Fm@wII8@v4fkqEy2P
zhg{72M@4P*V&umo0=L$lRv^4|K=$X(eIsTX2?u9Sd6fs}v519@%wd-eY~zDtoB=)a
zor`}v>_gcZ<uDAwF!V|kFRgO_i>*Jivr(Ds09Ggk1SaI&r^fjwDf1SSt^i@gq8k}Y
zWR>9BMt(wzW>*{w<RE$A_VlyB;m~QGyLO8&gNxgWxrUvZ&)LGo-QrwWbCq)E#mu^g
zwqT+{?8L_d!>7mB3$T1nMdY1bG1o8^@lvtx!_Q~>_&Mgnh#LMX5-gun7*Tux?MY36
zkB?7s8m2Cd{aFmM@wtR`Nniom_{seY`BF2-CUX9Y!9D(lQx_1tR-C%)XdwjyvhkT#
zP@BCG&n0q>=!)^cYU&O!+4vltr%KF?O^3yTKP!|dpJ)Tx_{j{z3SRR=Tlm@%ne~SJ
zp$N3`mHb-7{@oC0<0tLiezR%gSFwJT?=af<CohdFlWP-s+GhJf^1>RK#nIE}G=MgK
z^6G-$jPaeC^rq}ej35R<U`r8vLjR53OrBjQdY}dDz##&MgdM>JU?xe#d<oR9W8~#F
zd4KX&GuinvA}?5Rf~q28MW!T7>tNC+2a@SwWsrRMLsj~=@gLI1o7#`hufDb4HhxEo
zgQp8kK|NFCd(ImM!w9}59u+cd3MA*R!5(+H=Q#ZP{Pyvu1`EOUf1<l66<u(fsJ$8t
zus#Rmk^Ifq6>-5ff<b?D`0G#=L-;00H$rAFKe?lkZ+JB}F2Rq$@-2pTB&!Sd-IENq
ztko4UEO3%qCZX3BV;DO5_W^AhtWB()R>9}QV8<#LUvFpGq_8cD^*PpoSFMd+ey?_2
zl?)HVHu)axhavRx=_IRk)<x0FpGywZE}&3)`ZGd;z`$IjQR8if(*84(w&wjK^M}c_
zfkur~>p#lQ00&|a1cF~`kzV2dAG^yX-6hrlK47Cos&$JF>4NzLcKfUyW=$=ee4aoe
z6R{MNqK53k-RM=g=;Slj;4^q$9zNjYhnCv|MJGSB+)a_k$p;!$9DgyrSmR*iM|dTI
zUF=^C(-&&*9Jha!y|xsanZJ!jOdquP8Y$LCKPK&Ya_^g0q>jhRCxv!Hi@6KGUN<^T
z$ml9H^Ju}!524nxImoy;XFUPsgZx<enE1qpbszbj)4EFw{%LIy>vqGw$V{YlegHv_
z7azGDYDGDI9H-`+tcScB2III`8I=fIk=<ogc?rI<*9=!7zGiTxILbQxQ#|q~L1yN>
z%}Zh96V@5{r1^rbu<<EY?$#?YA&{~iFxdD}e7BgHm%_$(mUS}Pc`56^y)R=|bVMNx
z!d8-!`egsbo<9UnIbZ;eRw&gN$jkFot@Ae4ujg2HO&kVcd`M`0+DPkjgD`&Txmz}`
zM-Fv24o$S0Xb8gi7DJA9?78uLC7xLec9SIb)i>ohd8--qARC{Z`iRep=3y@>SKSzU
zuiD8DDyKrI)?g(F;+uDSsBoavIvU4iel<~c5T6_$J=imL)I@%)Gbx?ZQ^67Vhd=AF
z=I?EMl^If3f&lTeqFr;eK@i_K%)#OpQ%yw$LHtl$GV+yc;ojSLCCNEGj|B0P!>l5W
zu{Uyy&qYuX{^+SeeCSR*vj)|SP-v22^HBYgI0tUm7(2wO{z9Tk@m}rrY)PDX*VNQ<
z1c<*w-5JAo3PgtOL>js=Uhmv~6a%S2KS00Bp6~fv!XVQU2Fkog+v~~x(`Tgql$}uy
z#2^SnuS6HbdjE@Ue>!7=3+w?VrdFXHg?G?;&<bl;^WBUdI`aNnr~qs)`8l`QA%eBz
z2rc|A2zBEKJK%34dovWk!WU#Yan!z7BO^oN)M6sZ<#!zIb?_BS^8+XRa~I<xehIRx
z+|9R41K)96!cN_l81W0e9@iu>CEt$YkRiDpi`+~DA1&<HgjkBV%=Hz;Qfx<;-;1++
zW*Yc(!Z~5Z7Z`8iF9O%48Sv3X=X%S5^uo%%ik0maiR*M3W-(zTKw`qCw&>%-+ykz?
zi!L7q1E1XUKSsV$(Gz*tIZS)lMzPg^cdo=R@Ht`oZ0B2Yo*1Lr6-Q38tF~~kk5~f&
zx66`!#1>exq!s5Z*<om>vqP3gSB#2VSTlo{NAgSYHVNy4{f67+tBCpRe~;2tb`>qf
z3k4g9BwxzT#Rg&!hM_AJ5?ZqVVs|>Jc66j99l&zw2SG~ws$@i+$G`YHeQ+hTe?4&=
zUs-aTt%g-p=IP*j_N}Y?nPf&Z$g;Dp&hAkq&LeP^s`I(ru=AjJ|4E{X&vsqIL2uh1
z^j0R|2bjR5QCP{bMf<%m&^>Wxq7HjN%VS0YKE*Gbd*IxvVhP4vz1tRWh^pKYWdc5T
zHuq0CX+05R9X7F)LM%msTTz_JcWK{<SxESCic-Gg$8k58iR~GCmx%|Wb+CN=0sczl
zx`A4L%*;!~*hd=U(Xqpj<g#VS=`4fT28;Q(vov8|i|)l}iR{E1N>zLY{5Z_pmWZz)
zW{*ssWX$vVva^i7fnvTF7gJG3BM-8_e$FiByO*RoW=88cCeM|E*glk<Q4WM45JRt|
zg%Y{{#r9{nH99*C2WW_qfT@%BzTuWQ^OoWMR9e&(Aat4UZ<0A{#}HlSPlGFs=|djQ
z&#=YH*GoDeyVrVUjp{&+0a{J8K+WXqnd_njLR|%pUBv@|KwUD5&y2_uQ+-wF!OFVm
z@_|-DZG{HZ5A<qy{AYi!D940tecSkMy3Zed*QG|x7hm}fXU@ZB>x5Y7{1|HHvT7#v
zD2EYXH;ceenu-4=JFmk5vb>7IrrA1d+c$=twknqBVk!SgMmueXMy9<zbGkgu*3k}=
z%wrukJ9F-GN~u2o7Onz^*(37rsD=^XRnHnBm4@PD?1%f4o7axB)wp@oQ2y0}@VN*Z
zK&Kk-H>T7+lwAuBg&+*O%R7O53V8pEy~LP~0O{rdnhlsxXQ@dmjX+U8%#S~6t_X_q
zFVoczZoOL00eb6ntL?$r)_37y-a4tS?setT>ULO1e>$IQ%qtKS<xf6vQ4={(ls_s7
zjqTfB+I6+Bd*X#$3PE3drv1bVrrlO5^%9Ky5)29MJ2RNT&N>f8EA;m{;68wP#A>}Y
z8v9}97Q-tL-k90bH}1(-U>{5##-CP&tt>%NK7BCf3e(bfP?UcxPY;Y8Y^+yb2S97<
zm_Iy{?Nnhoy3S*tuqkaPvSj)Wm_7Y@!fdwnX3*2Yb+iSUK70Ce<e=XvdXZ+Sn$Yx9
zg@q$y^Y6r+qTsfsoncKDFYPWj0|z_~FJ(EpR90c-^E!{~_owWPvKR(IAb2H3S@r%G
z>rcBT!2mq~k6?`2l$qR(L|?y9LU^U@%WwT;%ktNPDGwErVDFJp;^rm}g1Zqeq*V_(
z_34TDr(`^d&Q{mRA+SopPUZQp?gj+}!SldXB1bpsT<^$S#FFYNCbMvBmtbqBBVQW(
z8-8w#CI~W%!;(fd?{C_+%~i5F0>Nc>wkXtpaZp_wjT|O(fJW-#IiIro!U3y2sCm4z
zXAz*N+p;t4fQ2>F1I)j1u~#AgM*{dp9~7gdaZnWQk(~=~=kx5#^6`74e+!oEWjEsk
zS$mK4yUkJhA#=;!XB5sbuAY^L$6$t`z#TC7!NcBX%xul`0PCd(Y+0qp<yQH@)y%LP
zSLxSWPctkXEbqFS2+9OMY<r<rPVmTwvMa!W5C&miViT(Wf7xAfNqf<y%m)y3LfNn@
zOIzJ8Iv2)`<GO#T{i~!<L%-%*t`i1T=mrbMAl-a4p05Q(i$&6Nuc3ziA7z}#>*d=q
zsUJ{;Z7`{PwSgM?9HAAL2yq^TrpT>$l3TmSW|6G%c<1Ph31Mm&6hqrH2tkpZ)S*gx
z_tAJJgjK%x%!8!Zz}kj&t9@C|J|(9jj9EppdU&Qgj#zvu#<pibgEMY}vPA#k*?4A=
zEbeDC=h0Jo!G?b7XtV#$c{iSCVAq&R)B4q~pBSAno~yl`&m3|aCnHSz8P6;O3HqUY
zW<$RV&x2CH)Y9ZA^si?hBpC(_IwZ+q0no2@E-*~g+6MG<aRp?T)C;NX;CjpZMwTIs
zw~vhl3@NL8kg%cuON<X?*Omk^2*R#p-5T2aUu=JB!c+$70URYfq?p2Mv2A3&0+~mR
z`Hk}q^xTVpsmqR{r|##xb37bHzkLovqX%&tMe`iLKxX-Ko>q)ASj;e#bCDsEz5~pv
z$Brzl8Vp#_mq%JJ8kjixdi0S;+D20}FxY3X(N>XN>Y0N*>-m_Jp(lz~;6i`F^>}6l
zE;96;z*19w)o{>l6Vz_;X5*3SX@eG4yRI+R4XK|`=#DvM9N-Pf!NBbz*!O1f9muTg
zFOOdwb?c8!6UnK>P%&SHN3xBMoIC>#yKSt;AAIFHHhJeP=AR;1mD3RpyY;z@G?ho7
zS<Cku(>QaUI}B?aaQ3x1wJjU-gR12md9cAwx6dJD7V`bR#n*1QR{8AC!+-YjL;o4O
z7955`5OyW>ZGiW`*tRTbNi@X+kf(gA);|0ikNv~*GBFdmmAs=zh*x8*a;y9BYcD4j
zver#IUb>|$VH5&Q$0=P+S<AgW58#!Yv(C)KOGP+|;myZqXla$BQ+`3db&GuHm0#z~
zy9=FP3%$(IzWCu`s&N>)<yR5Nt+&bJ7tD=IZ<EK*L#VVE*U94(uoLjrIgA;W2jgbg
zaabyVBl?=j!Q<BqgBVvU!W>WD8n5WfA|*o=X4@iFhyB*ZXrc*e)nE4WA9iCrg+{4?
zu(0Q_pYU5_WZ2qEa*W1dAi*%~iBL^VQ3QGX@|$+vZ3)8S5GtGjbyM&#Y`_+vm;a+`
z^>WzSOOoRHCeFhS-u62H4D$GtxEC;JjHifmYy52WJZ#==I%B+KN&eFFL)jG^F${yS
zm10~<z5il;RpJs(&;fMLB{C3MQ3Tj!0X!Pa8g`2P+<>E)Seb*OxxK0yMus&v?A%+d
zEeujkiwz3-iJm^>wy}m8zHA>VE0Ki!zrSn`2>Hty_<(bEZ9ooVj=<}YgVH@JI`hjn
zlLidWA-ZJx5A|y9cHBu~&g_?lB&O%E2K-}KGUHyXVRH5i2>I(;1z4|4As_R0sw7Q+
zhLE4=dBu=ndl%r(klPUQQ)&a0(k9C!cEvDm49#r_`H9=pX(%A%=Z!I?C!F~;w@rgj
zu`=kXbLWH3d>qVefOoSpocXwHbLLldVECpHP2~Qbg7>4*v65KR=u*-Sq5xR*_3>EX
zueaFGmPw+yot*hz46d5n%-W%$jAf`P25{zoDLWS&20{>sUa9^%>-{g*q^UDB8o&dv
zur6`Q2+yKzi1RL?=gCoqc{_~&3i;MEzq8+T0}1&m*3%{P*z2(TJF_$2AcC^AFbJ2g
z<L>Nf4=Cg}&aX+_X+ce5Xge$)bvzc-VN1wAf$#$M6^0T_<K@gw{}dDkwli-TLD*qC
z-(Zu*g&0uYfUSzz?^wiA^530nT}AovGn=>G_6>X*+j2ber8gF*$IlQc`KSlTk6(~b
z$+v_chK(R>Y>bOhpBzyHOUeIZnUt*Y0U|JE>@OHJ;;qlj4a{%L2T?oh(fmCofouTV
z^2vM1BOAcBeCxSoJ$Ki0V7y~0AY51!wjcuKc0L?J?Qq)9vJd>NfNlBuy=J)y;KjGX
z0GP!N96zE|h}gjF^xMp_)ckYQ`~LNz><Vxg2tnAF2I^q{|JafxwoZ-q9zZbMMWN90
zXNx2s6W62Ti*cDx?ae>xse2g-@|hJ^ZTtHOY&x6xnSkX(xh45m-)!T+NV?F<gCaYF
zWI|Dmk$zEoRONF9p?o7#rD`<PfXEI!d*h{h^XxN|^k>o&zjHbPDBrL%$Sd^<FUI}v
za<C^HBdLBC!3#q91AF$P9vkmtp`tIhQeC1Q8_#mUatYW2&$zyV$9AnjmVojN1PHmi
zmW1-Lh{llM`+06TUp{x5^fpxz%HP#u=ei`h_?G+}wWvuz`D3(A4cOX_eDJAaSs*5F
zA4@{{1>_!p6n-w)6Hvb64wGlK6Hvar>r*yVZb$M(mQ0$@YrJ&!L{c$-T_AQhuA3Eg
zvgfv_fOgsEFJ)(x!!QWL&?_yFQt$p3+kR$8110GJP^m<_^8E117ElP~A6m(0z70fZ
z%-@=ut4edo$-l(Jt=IMn+xC!gaK7^eQT{j{T+5#-Rpy6jH%n^4%6y|qYcy$x71N%X
z44Z4X2u{8|AAB8@n|Dur!4KsJZKivM0aEgH^z6QS`54A-8@59ijFS%5Y(Ylo%*RtC
zjzIGFu)K(GAtgV=0JA$-B%fQ8i=Sb+h=%DIPtW5XkmSddN`yCGB<$ExSZ*}Ti--#%
z`TSyT=VPFfZ-P<b%Edi1D_T#vH2k$)crdW3X6?4WJG<}>K6diAM(=L|AR|A}DDR;x
zxF2W~ALqP588q@OkWwz~Jnez6v?)7Zoig&-GP{%;uVUKx2bTSgZhU{nKa`ze5(6;=
zg|F0fo3Qu4Sby#JOp`$mU@SqzK5W|V77jfO&3|oK*j3zA+IveBdehtZ&I=??AwOzc
zMpAIT4z2XvbJp1WgOQY+PZp+PY3@}Z@`sTZm~6W^D%&`RRDBkoO$alztsB+~Vtz&{
zlF-~ea;Uch$&WI(iN~&O+7K$4!Q?Z@JrI|iuY=5O;!i4b?$2u;J{!l#vGLA`9d@+G
zbIu{x4k~}BxTB|cj>q-ozX9-%xV`9Gn@{V-YP!W!$sfuJgy+u(bUTpzsA}%lB55_5
zmu&NHs#;5Lbxul`bFjCY%uB@F?D=$Ww|OAOu)R?BI)o9)ocp8J-WpG5rH+-%zJGRK
z+c%tVcGpVV`K!nYV2(3`Qm?el%zV{m+8)Jx9nl8Mj<jFSuILJ45QNPH)l>Fg?0!mO
zs}HyvfCpL>O(H$mUjF!%XZ(85?LA$O{7R<FwG@8oUg-H`IikDHvW1MYu@jMw%iKdR
z4cK`|!OO2%ToI7uugj?yjq%T0`NLKYHKv*#P~^)v>;Z9!A&O7O?Bkp40d}g4t!m7z
z%MM{D#-AOa1qF~`=@TeE>x5B&5hte22;5BoZRqg@BJb66xD<^bzU?@C61D-vKMuLa
zwi-|m2?1ch@P%@}derS;+-fY5p{)*vOub6x*9#*~i<ItWlQlNN<A<4^?}lVI4Nw68
z4fwsZzA*<HgTls^I!h}wl6i4vifo=0ylZlEG`7^?mb-Y4KNO|-Bs}OjmYkT7gGAUk
zN9at#_U!7oEaRrFBbjVZFU5O*g%m-rFJo791tAE-R)T<N_FwG2NcHGzJ3t;4Q85YW
ziouH1QQ|SAkR$ee@D-_}zfKtx@g%od0#UQ{HxmNmJB4;oc4eB9FDJgo_r+xchY__*
zQ!;VlCnHa1<YM1O;=f-crd|bz9qq(&?6ac^zJq3y8Fp{IHuKeWtZ?*XvUu2>(N?W}
zE63@PHiLBv?hcz=<Yl?J`@T21{Z(}QFmC2v(9Z=Y*y*gx;#o5qaqlwV$px<<_cGxa
zX<0g+Kz$|P$LTa#)ZsWx-PUX?G!wD9O=IrOt)j9=23BZhSIcd=7!aGnDdrxwHtXP_
zPlXhHxnB`GSSjY-vje0fUs2h~USyu?Htf|Go5DG7r|hc=e)NU23A2>Zq-<}62^`xZ
zX<0gxKgzD)h+!Cnt&|XB!v2f(C;18oWB^}nS6~o21&i<Dwv`CmpRuiyEXKBLg`tDF
z7l^3@rLxp6D^BKK`Bx!_Npof`LDJmzj_{nC;JRAyv7Oi1VD1G*d4lmy3lfj<%(}5w
zpZUI$Gt2Oo`N7*md~pvi49vYS=|dbTwM5bP6D^02TDitHnfnzDp1a0mYw}jDnc&2!
z!q0|jO;<zaJ{fg%uO$3*&Ul_i)lN!$_6JP@grCl#lW`w*CLr(Awx&r#78N@4p2)~h
zcsz5rcqI>=4x`HWN)jYK3=EL>0%4I5B=wlZ&63K1QB_w4B=6l~$KFJhF^8?MQ)Yj!
zi0v^*-UMM#w0E}+9sb#}PjlE?=CJj@?H^@lV8bvB0>PDt6C>Dvu~w?|Z^h_M2SB#z
zlcWcRmoX^?9QMrKO!-71{%^hawzal{3WG?H101>(A=y?34cmvaRlHVM#P02OV1VJ*
zuN!^lv^^x-BFREw1SE&2XI5`XMwNb&fZ~Hjp_cRnqgaX0b=y=23?KhOonL<kPx~&-
zr5aub1ql9lh@!5hx`6P<J@=JQ#wjK@4B6e@4G4c(8C5cReuA4_YTMFbZdR#__bqO1
zd>2p7w((O?Lo)osnP;)>Y>Cqi6o1Tr`K}vU>Hv|DkjMfXH;dw83?&lUIE#xh(Mox^
zu?oLPw&+Za8%EtS&9iR%U_ACSPixJja|6Xk$=iC7NdHcN_{c!=Bk1I<`8Mq)m)y`5
zKX7$37>rW~BM?5u7tmMV^L{9~f*Xio7_<^i8q)5+*gftJBGq!-0g$8AjSN`i*ne})
z^L<_S*7dru1pM&Od10;JFTNIP?h@f79Yq^dttq1QWP>W_VT6-(#KWp2j?ntOcW%4n
z-F)YkP$a%5ujS?1T=ootH)hFoAe4yzU41`(kV>=*;r09R+@RlqCE=gP{W4UBu!KJX
z(_-XLuGa4xY}1S?IC3CIiK`PmZ?Fw`WOiISZ4#XU-M*^e84v@5H^<iWWebuXR`Z|A
zD!ww>o126=SV20sT|~uiw`&7Fo_wY_aS~SXm$|Qe>>kX0tvEDV#a}*^C(gXLt>T-v
z76~A6GOfHh_6!*FRnnCSsraEapFf^w)L_;7l8C>ycJ;roi2tGNjE*1%K_J=^F%eAv
zjosJnIwu2r1vo0MM4m`Cd%Y6RaU;afdX8G1fcU7LhAKMkpr7BS`d*%yx?Egi5PbUk
zTZ?$zCdIXq#!bg7!EUBD{;CVVUSSGEBTV4?8Goz8uSC?UIy{jUvfn$e33`tRjE9M+
zT>vWRq~5yG7T7%_Kct?HsLv8ey5BlRQe!*n?9=G#I;~@kMWX8la*u*8zUiZ$aU37U
z@tSHbfctbO)($hqd3{JWuxe9-+w(OYxo8ujN0R!5{PVGD{}I{2Yl>VUYA8`V0b={?
zdZz0+x!hh_?w1>}J%-JS;kVV+2DZnZAPH_}ysn~HS{FqT+Hba2XN=-G`=)qAzlWTA
z$7_;-3fA@CH{Cv*T>%opFbMn7(3aBwf6O~=lG)qA^Z_|K1f+oiN&73qE}TM~{iz@y
zcfowpv9L`na^&HM({qprG)1lox=ai4qpKk(^52&Y_qZ_L26AYQ?1D;~x%Y#o?<mJ~
zrNohkJFxVZVk7q<(DZHmf#niz&cp0?zt%TsS2kQh(Fu*oqeIPFGY?f@=m!jO=&Dsg
zVNKwBLUqlV#u@`VAE-=*Jg0(k+0aU`%)3<Fax7nOsN^KlHtiU9JGii8`JJ6rRS0g|
zp}*u7SpEl2CP^Yst3x|_<T;M$2k_X{WiHMnT>{~Dus>DFta^9S279+-?qJg{s|pNi
z{#w}u7S@F;hn)&P>HY{e5c8d#z)cnN3cHMp^HsHR@sUnzaRV*yC`8yP0k5#jwmK%y
z&4+kX%c0A%8hPe}U;9k=Ah;Q4U*gq=HQww>!LgnBE$$|kcJ+zvFUqbchhh+fU1>#S
z?*12h$xA3C8pOZ-G>CIdiq!v;dz?oe;kq)ces2|P?TpgEQTwf}c?2+8J}S}HZhTc3
zEANIeyL+6kO0x2CSLc@V=pkcmfT)9YGhe+r?02KS`;;_;6-LYZWXBhEz<v}f?whT9
z9(sZ(&U+8G)X;8Jzj(_e<w;pIo^Nl+zhrXqafL`NSphkDb!q2WH9S_e^&usxb_FT<
z#?s4$%Wu*>k+)tb+Dy79j>Go84Y`!3R~RMl@<S1ukD7`&dtLkkSnNl^@~uZN<dKhp
zIKvJMih8g=fju+S+sqJsENSJ_Q3Wq0>w1YEB;<G6l}GSgWoe3Xb&9^q5;h)gKY_>E
zxY006%_@p;tbSt|dHfo(_#DBR<)6$9;Un_K@EzSGINJozRsw<nW{S_*2+cP7$*DOx
i#UPH2er{@Uh8>rUeoB5$T4tUd7hnLy7NJSONC*H>3UIOj

literal 0
HcmV?d00001

diff --git a/test/unit/jit/python/test.py b/test/unit/jit/python/test.py
new file mode 100644
index 0000000..09b76af
--- /dev/null
+++ b/test/unit/jit/python/test.py
@@ -0,0 +1,81 @@
+"""Unit tests for the JIT compiler"""
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-05-12
+# Last changed: 2011-05-12
+
+import unittest
+from dolfin import *
+
+class JIT(unittest.TestCase):
+
+    def test_nasty_jit_caching_bug(self):
+
+        # This may result in something like "matrices are not aligned"
+        # from FIAT if the JIT caching does not recognize that the two
+        # forms are different
+
+        for representation in ["tensor", "quadrature"]:
+
+            parameters["form_compiler"]["representation"] = representation
+
+            M1 = assemble(Constant(1.0)*dx(UnitSquareMesh(4, 4)))
+            M2 = assemble(Constant(1.0)*dx(UnitCubeMesh(4, 4, 4)))
+
+            self.assertAlmostEqual(M1, 1.0)
+            self.assertAlmostEqual(M2, 1.0)
+
+    def test_compile_extension_module(self):
+
+        # This test should do basically the same as the docstring of
+        # the compile_extension_module function in compilemodule.py.
+        # Remember to update the docstring if the test is modified!
+
+        if not has_linear_algebra_backend("PETSc"):
+            return
+
+        from numpy import arange, exp
+        code = """
+        namespace dolfin {
+
+          void PETSc_exp(std::shared_ptr<dolfin::PETScVector> vec)
+          {
+            Vec x = vec->vec();
+            assert(x);
+            VecExp(x);
+          }
+        }
+        """
+        for module_name in ["mypetscmodule", ""]:
+            ext_module = compile_extension_module(\
+                code, module_name=module_name,\
+                additional_system_headers=["petscvec.h"])
+            vec = PETScVector(mpi_comm_world(), 10)
+            np_vec = vec.array()
+            np_vec[:] = arange(len(np_vec))
+            vec.set_local(np_vec)
+            ext_module.PETSc_exp(vec)
+            np_vec[:] = exp(np_vec)
+            self.assertTrue((np_vec == vec.array()).all())
+
+if __name__ == "__main__":
+    print ""
+    print "Testing JIT compiler"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/la/cpp/CMakeLists.txt b/test/unit/la/cpp/CMakeLists.txt
new file mode 100644
index 0000000..91c8efd
--- /dev/null
+++ b/test/unit/la/cpp/CMakeLists.txt
@@ -0,0 +1,42 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME test_la)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(test_Vector Vector.cpp)
+add_executable(test_LinearOperator LinearOperator.cpp)
+
+# Target libraries
+target_link_libraries(test_Vector ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
+target_link_libraries(test_LinearOperator ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/test/unit/la/cpp/LinearOperator.cpp b/test/unit/la/cpp/LinearOperator.cpp
new file mode 100644
index 0000000..3ff508f
--- /dev/null
+++ b/test/unit/la/cpp/LinearOperator.cpp
@@ -0,0 +1,136 @@
+// Copyright (C) 2012 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Johannes Ring 2012
+//
+// First added:  2012-08-21
+// Last changed: 2012-09-19
+//
+// Unit tests for matrix-free linear solvers (LinearOperator)
+
+#include <dolfin.h>
+#include <dolfin/common/unittest.h>
+#include "forms/ReactionDiffusion.h"
+#include "forms/ReactionDiffusionAction.h"
+
+using namespace dolfin;
+
+// Backends supporting the LinearOperator interface
+std::vector<std::string> backends;
+
+class TestLinearOperator : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(TestLinearOperator);
+  CPPUNIT_TEST(test_linear_operator);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void test_linear_operator()
+  {
+    // Define linear operator
+    class MyLinearOperator : public LinearOperator
+    {
+    public:
+
+      MyLinearOperator(Form& a_action, Function& u)
+        : LinearOperator(*u.vector(), *u.vector()),
+	  a_action(a_action), u(u)
+      {
+        // Do nothing
+      }
+
+      std::size_t size(std::size_t dim) const
+      { return u.function_space()->dim(); }
+
+      void mult(const GenericVector& x, GenericVector& y) const
+      {
+        // Update coefficient vector
+        *u.vector() = x;
+
+        // Assemble action
+        Assembler assembler;
+        assembler.assemble(y, a_action);
+      }
+
+    private:
+
+      Form& a_action;
+      Function& u;
+
+    };
+
+    // Iterate over backends supporting linear operators
+    for (std::size_t i = 0; i < backends.size(); i++)
+    {
+      // Check whether backend is available
+      if (!has_linear_algebra_backend(backends[i]))
+	continue;
+
+      // Skip testing uBLAS in parallel
+      if (dolfin::MPI::size(MPI_COMM_WORLD) > 1
+          && backends[i] == "uBLAS")
+      {
+	info("Not running uBLAS test in parallel");
+	continue;
+      }
+
+      // Set linear algebra backend
+      parameters["linear_algebra_backend"] = backends[i];
+
+      // Compute reference value by solving ordinary linear system
+      UnitSquareMesh mesh(8, 8);
+      ReactionDiffusion::FunctionSpace V(mesh);
+      ReactionDiffusion::BilinearForm a(V, V);
+      ReactionDiffusion::LinearForm L(V);
+      Constant f(1.0);
+      L.f = f;
+      Matrix A;
+      Vector x, b;
+      assemble(A, a);
+      assemble(b, L);
+      solve(A, x, b, "gmres", "none");
+      const double norm_ref = norm(x, "l2");
+
+      continue;
+
+      // Solve using linear operator defined by form action
+      ReactionDiffusionAction::LinearForm a_action(V);
+      Function u(V);
+      a_action.u = u;
+      MyLinearOperator O(a_action, u);
+      solve(O, x, b, "gmres", "none");
+      const double norm_action = norm(x, "l2");
+
+      // Check results
+      CPPUNIT_ASSERT_DOUBLES_EQUAL(norm_ref, norm_action, 1e-10);
+    }
+  }
+
+};
+
+CPPUNIT_TEST_SUITE_REGISTRATION(TestLinearOperator);
+
+int main()
+{
+  // Add backends supporting the LinearOperator interface
+  backends.push_back("PETSc");
+  backends.push_back("Epetra");
+  backends.push_back("uBLAS");
+
+  DOLFIN_TEST;
+}
diff --git a/test/unit/la/cpp/Vector.cpp b/test/unit/la/cpp/Vector.cpp
new file mode 100644
index 0000000..50d685e
--- /dev/null
+++ b/test/unit/la/cpp/Vector.cpp
@@ -0,0 +1,218 @@
+// Copyright (C) 2007 Johan Hake
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2008-09-30
+// Last changed: 2012-08-21
+//
+// Unit tests Selected methods for GenericVector
+
+#include <dolfin.h>
+#include <dolfin/common/unittest.h>
+
+using namespace dolfin;
+
+class TestVector : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(TestVector);
+  CPPUNIT_TEST(test_backends);
+  CPPUNIT_TEST(test_init);
+  CPPUNIT_TEST(test_get_local_empty);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void test_backends()
+  {
+    // uBLAS
+    parameters["linear_algebra_backend"] = "uBLAS";
+    _test_operators(MPI_COMM_SELF);
+
+    // FIXME: Outcommented STL backend to circumvent infinite loops as
+    // FIXME: seen on one buildbot
+    // STL
+    //parameters["linear_algebra_backend"] = "STL";
+    //_test_operators();
+
+    // PETSc
+    #ifdef HAS_PETSC
+    parameters["linear_algebra_backend"] = "PETSc";
+    _test_operators(MPI_COMM_WORLD);
+    #endif
+
+    // Epetra
+    #ifdef HAS_EPETRA
+    parameters["linear_algebra_backend"] = "Epetra";
+    _test_operators(MPI_COMM_WORLD);
+    #endif
+  }
+
+  void _test_operators(MPI_Comm comm)
+  {
+    Vector v(comm, 10), u(comm, 10);
+    v = 0.0;
+    u = 0.0;
+    CPPUNIT_ASSERT(v.sum() == 0.0);
+
+    // operator=(double a)
+    v = 1.0;
+    CPPUNIT_ASSERT(v.sum() == v.size());
+
+    // operator=(const GenericVector& x)
+    u = v;
+    CPPUNIT_ASSERT(u.sum() == u.size());
+
+    // operator+=(const GenericVector& x)
+    u += v;
+    CPPUNIT_ASSERT(u.sum() == 2*u.size());
+
+    // operator-=(const GenericVector& x)
+    u -= v;
+    u -= v;
+    CPPUNIT_ASSERT(u.sum() == 0.0);
+
+    // operator*=(double a)
+    v *= 5.0;
+    CPPUNIT_ASSERT(v.sum() == v.size()*5.0);
+
+    // operator/=(double a)
+    v /= 2.0;
+    CPPUNIT_ASSERT(v.sum() == 2.5*v.size());
+
+    // operator*=(const GenericVector& x)
+    u = 2.0;
+    v*=u;
+    CPPUNIT_ASSERT(v.sum() == v.size()*5.0);
+
+  }
+
+  void test_init()
+  {
+    // Create local and distributed vector layouts
+    const std::vector<std::size_t> dims(1, 203);
+
+    // Create local vector layout
+    TensorLayout layout_local(0, false);
+    std::vector<std::pair<std::size_t, std::size_t> >
+      local_range(1, std::make_pair(0, 203));
+    layout_local.init(MPI_COMM_SELF, dims, 1, local_range);
+
+    // Create distributed vector layout
+    TensorLayout layout_distributed(0, false);
+    std::vector<std::pair<std::size_t, std::size_t> >
+      ownership_range(1, dolfin::MPI::local_range(MPI_COMM_WORLD, 203));
+    layout_distributed.init(MPI_COMM_WORLD, dims, 1, ownership_range);
+
+    // Vector
+    #ifdef HAS_PETSC
+    parameters["linear_algebra_backend"] = "PETSc";
+    {
+      Vector x;
+      x.init(layout_local);
+      CPPUNIT_ASSERT(x.size() == 203);
+
+      Vector y;
+      y.init(layout_distributed);
+      CPPUNIT_ASSERT(y.size() == 203);
+    }
+    #endif
+
+    // uBLAS
+    {
+      uBLASVector x;
+      x.init(layout_local);
+      CPPUNIT_ASSERT(x.size() == 203);
+    }
+
+    // PETSc
+    #ifdef HAS_PETSC
+    {
+      PETScVector x;
+      x.init(layout_local);
+      CPPUNIT_ASSERT(x.size() == 203);
+
+      PETScVector y;
+      y.init(layout_distributed);
+      CPPUNIT_ASSERT(y.size() == 203);
+    }
+    #endif
+
+    // Epetra
+    #ifdef HAS_EPETRA
+    {
+      EpetraVector x;
+      x.init(layout_local);
+      CPPUNIT_ASSERT(x.size() == 203);
+
+      EpetraVector y;
+      y.init(layout_distributed);
+      CPPUNIT_ASSERT(y.size() == 203);
+    }
+    #endif
+
+  }
+
+  void test_get_local_empty()
+  {
+    // Create local and distributed vector layouts
+    const std::vector<std::size_t> dims(1, 203);
+
+    // Create local vector layout
+    TensorLayout layout_local(0, false);
+    std::vector<std::pair<std::size_t, std::size_t> >
+      local_range(1, std::make_pair(0, 203));
+    layout_local.init(MPI_COMM_SELF, dims, 1, local_range);
+
+    // Create distributed vector layout
+    TensorLayout layout_distributed(0, false);
+    std::vector<std::pair<std::size_t, std::size_t> >
+      ownership_range(1, dolfin::MPI::local_range(MPI_COMM_WORLD, 203));
+    layout_distributed.init(MPI_COMM_WORLD, dims, 1, ownership_range);
+
+    // Vector
+    #ifdef HAS_PETSC
+    parameters["linear_algebra_backend"] = "PETSc";
+    {
+      Vector x;
+      x.init(layout_local);
+      CPPUNIT_ASSERT(x.size() == 203);
+
+      Vector y;
+      y.init(layout_distributed);
+      CPPUNIT_ASSERT(y.size() == 203);
+
+      //:get_local(double* block, std::size_t m,
+      //           const dolfin::la_index* rows) const
+
+      double* block = NULL;
+      dolfin::la_index* rows = NULL;
+      x.get_local(block, 0, rows);
+      y.get_local(block, 0, rows);
+
+    }
+    #endif
+
+  }
+
+
+};
+
+CPPUNIT_TEST_SUITE_REGISTRATION(TestVector);
+
+int main()
+{
+  DOLFIN_TEST;
+}
diff --git a/test/unit/la/cpp/forms/ReactionDiffusion.h b/test/unit/la/cpp/forms/ReactionDiffusion.h
new file mode 100644
index 0000000..026def4
--- /dev/null
+++ b/test/unit/la/cpp/forms/ReactionDiffusion.h
@@ -0,0 +1,2214 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __REACTIONDIFFUSION_H
+#define __REACTIONDIFFUSION_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class reactiondiffusion_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  reactiondiffusion_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusion_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new reactiondiffusion_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class reactiondiffusion_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  reactiondiffusion_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusion_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new reactiondiffusion_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class reactiondiffusion_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  reactiondiffusion_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusion_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    8
+    // Number of operations (multiply-add pairs) for tensor contraction: 20
+    // Total number of operations (multiply-add pairs):                  31
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0 = det*(K[0]*K[0] + K[1]*K[1]);
+    const double G0_0_1 = det*(K[0]*K[2] + K[1]*K[3]);
+    const double G0_1_0 = det*(K[2]*K[0] + K[3]*K[1]);
+    const double G0_1_1 = det*(K[2]*K[2] + K[3]*K[3]);
+    const double G1_ = det;
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0 + 0.5*G0_0_1 + 0.5*G0_1_0 + 0.5*G0_1_1 + 0.0833333333333334*G1_;
+    A[1] = -0.5*G0_0_0 - 0.5*G0_1_0 + 0.0416666666666667*G1_;
+    A[2] = -0.5*G0_0_1 - 0.5*G0_1_1 + 0.0416666666666667*G1_;
+    A[3] = -0.5*G0_0_0 - 0.5*G0_0_1 + 0.0416666666666667*G1_;
+    A[4] = 0.5*G0_0_0 + 0.0833333333333333*G1_;
+    A[5] = 0.5*G0_0_1 + 0.0416666666666666*G1_;
+    A[6] = -0.5*G0_1_0 - 0.5*G0_1_1 + 0.0416666666666667*G1_;
+    A[7] = 0.5*G0_1_0 + 0.0416666666666666*G1_;
+    A[8] = 0.5*G0_1_1 + 0.0833333333333333*G1_;
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class reactiondiffusion_cell_integral_1_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  reactiondiffusion_cell_integral_1_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusion_cell_integral_1_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    3
+    // Number of operations (multiply-add pairs) for tensor contraction: 7
+    // Total number of operations (multiply-add pairs):                  13
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0 = det*w[0][0]*(1.0);
+    const double G0_1 = det*w[0][1]*(1.0);
+    const double G0_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.0833333333333334*G0_0 + 0.0416666666666667*G0_1 + 0.0416666666666667*G0_2;
+    A[1] = 0.0416666666666667*G0_0 + 0.0833333333333333*G0_1 + 0.0416666666666666*G0_2;
+    A[2] = 0.0416666666666667*G0_0 + 0.0416666666666666*G0_1 + 0.0833333333333333*G0_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class reactiondiffusion_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  reactiondiffusion_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusion_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "2d7c212bac2ef45be1ef005fb1efd6cdc2ac065717c936309928a33b6189a324aca404a0571c55272c20932622ca3804df5f5df12a2e28668afedf70fe231afc";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 2;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 0;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new reactiondiffusion_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new reactiondiffusion_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new reactiondiffusion_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new reactiondiffusion_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new reactiondiffusion_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class reactiondiffusion_form_1: public ufc::form
+{
+public:
+
+  /// Constructor
+  reactiondiffusion_form_1() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusion_form_1()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "d29669d54e80ba045b9f6aeb94d0d33237447c2de5977853d51a949f2f7e7c2b30871cf2fd1dd173fdabb4daf7908a96678f21eb4086c6ed052d173bfb7ea232";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new reactiondiffusion_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new reactiondiffusion_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new reactiondiffusion_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new reactiondiffusion_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new reactiondiffusion_cell_integral_1_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace ReactionDiffusion
+{
+
+class CoefficientSpace_f: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_f(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_f(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_f(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_f()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_1: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_1(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_1(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_1()
+  {
+  }
+
+};
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V1, const dolfin::FunctionSpace& V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+    _function_spaces[1] = reference_to_no_delete_pointer(V1);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusion_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V1, std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(2, 0)
+  {
+    _function_spaces[0] = V0;
+    _function_spaces[1] = V1;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusion_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "There are no coefficients");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 TrialSpace;
+
+  // Coefficients
+};
+
+class Form_L_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_L_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_L_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusion_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusion_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_L_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_f Form_L_FunctionSpace_1;
+
+class Form_L: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusion_form_1());
+  }
+
+  // Constructor
+  Form_L(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> f):
+    dolfin::Form(1, 1), f(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->f = *f;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusion_form_1());
+  }
+
+  // Destructor
+  ~Form_L()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "f")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "f";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_L_FunctionSpace_0 TestSpace;
+  typedef Form_L_FunctionSpace_1 CoefficientSpace_f;
+
+  // Coefficients
+  dolfin::CoefficientAssigner f;
+};
+
+// Class typedefs
+typedef Form_a BilinearForm;
+typedef Form_a JacobianForm;
+typedef Form_L LinearForm;
+typedef Form_L ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/test/unit/la/cpp/forms/ReactionDiffusion.ufl b/test/unit/la/cpp/forms/ReactionDiffusion.ufl
new file mode 100644
index 0000000..fe0558f
--- /dev/null
+++ b/test/unit/la/cpp/forms/ReactionDiffusion.ufl
@@ -0,0 +1,28 @@
+# Copyright (C) 2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http:#www.gnu.org/licenses/>.
+#
+# First added:  2012-08-21
+# Last changed: 2012-08-21
+#
+# Bilinear and linear forms for a simple reaction-diffusion problem
+
+V = FiniteElement("Lagrange", triangle, 1)
+u = TrialFunction(V)
+v = TestFunction(V)
+f = Coefficient(V)
+a = dot(grad(u), grad(v))*dx + u*v*dx
+L = f*v*dx
diff --git a/test/unit/la/cpp/forms/ReactionDiffusionAction.h b/test/unit/la/cpp/forms/ReactionDiffusionAction.h
new file mode 100644
index 0000000..dce6a05
--- /dev/null
+++ b/test/unit/la/cpp/forms/ReactionDiffusionAction.h
@@ -0,0 +1,1735 @@
+// This code conforms with the UFC specification version 1.4.0
+// and was automatically generated by FFC version 1.4.0.
+//
+// This code was generated with the option '-l dolfin' and
+// contains DOLFIN-specific wrappers that depend on DOLFIN.
+// 
+// This code was generated with the following parameters:
+// 
+//   cache_dir:                      ''
+//   convert_exceptions_to_warnings: False
+//   cpp_optimize:                   True
+//   cpp_optimize_flags:             '-O2'
+//   epsilon:                        1e-14
+//   error_control:                  False
+//   form_postfix:                   True
+//   format:                         'dolfin'
+//   log_level:                      10
+//   log_prefix:                     ''
+//   no_ferari:                      True
+//   optimize:                       True
+//   output_dir:                     '.'
+//   precision:                      15
+//   quadrature_degree:              'auto'
+//   quadrature_rule:                'auto'
+//   representation:                 'auto'
+//   restrict_keyword:               ''
+//   split:                          False
+
+#ifndef __REACTIONDIFFUSIONACTION_H
+#define __REACTIONDIFFUSIONACTION_H
+
+#include <cmath>
+#include <stdexcept>
+#include <fstream>
+#include <ufc.h>
+
+/// This class defines the interface for a finite element.
+
+class reactiondiffusionaction_finite_element_0: public ufc::finite_element
+{
+public:
+
+  /// Constructor
+  reactiondiffusionaction_finite_element_0() : ufc::finite_element()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusionaction_finite_element_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the finite element
+  virtual const char* signature() const
+  {
+    return "FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return the cell shape
+  virtual ufc::shape cell_shape() const
+  {
+    return ufc::triangle;
+  }
+
+  /// Return the topological dimension of the cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the finite element function space
+  virtual std::size_t space_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the rank of the value space
+  virtual std::size_t value_rank() const
+  {
+    return 0;
+  }
+
+  /// Return the dimension of the value space for axis i
+  virtual std::size_t value_dimension(std::size_t i) const
+  {
+    return 1;
+  }
+
+  /// Evaluate basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation)
+  {
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Reset values
+    *values = 0.0;
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Compute value(s)
+      for (unsigned int r = 0; r < 3; r++)
+      {
+        *values += coefficients0[r]*basisvalues[r];
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis(std::size_t i,
+                              double* values,
+                              const double* x,
+                              const double* vertex_coordinates,
+                              int cell_orientation) const
+  {
+    _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation)
+  {
+    // Helper variable to hold values of a single dof.
+    double dof_values = 0.0;
+    
+    // Loop dofs and call evaluate_basis
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis(r, &dof_values, x, vertex_coordinates, cell_orientation);
+      values[r] = dof_values;
+    } // end loop over 'r'
+  }
+
+  /// Evaluate all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_all(double* values,
+                                  const double* x,
+                                  const double* vertex_coordinates,
+                                  int cell_orientation) const
+  {
+    _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation)
+  {
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Reset values. Assuming that values is always an array.
+    for (unsigned int r = 0; r < num_derivatives; r++)
+    {
+      values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Call evaluate_basis if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis(i, values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+    return ;
+    }
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    
+    // Compute constants
+    const double C0 = vertex_coordinates[2] + vertex_coordinates[4];
+    const double C1 = vertex_coordinates[3] + vertex_coordinates[5];
+    
+    // Get coordinates and map to the reference (FIAT) element
+    double X = (J[1]*(C1 - 2.0*x[1]) + J[3]*(2.0*x[0] - C0)) / detJ;
+    double Y = (J[0]*(2.0*x[1] - C1) + J[2]*(C0 - 2.0*x[0])) / detJ;
+    
+    // Declare two dimensional array that holds combinations of derivatives and initialise
+    unsigned int combinations[2][1];
+    for (unsigned int row = 0; row < 2; row++)
+    {
+      for (unsigned int col = 0; col < 1; col++)
+        combinations[row][col] = 0;
+    }
+    
+    // Generate combinations of derivatives
+    for (unsigned int row = 1; row < num_derivatives; row++)
+    {
+      for (unsigned int num = 0; num < row; num++)
+      {
+        for (unsigned int col = n-1; col+1 > 0; col--)
+        {
+          if (combinations[row][col] + 1 > 1)
+            combinations[row][col] = 0;
+          else
+          {
+            combinations[row][col] += 1;
+            break;
+          }
+        }
+      }
+    }
+    
+    // Compute inverse of Jacobian
+    const double Jinv[2][2] = {{K[0], K[1]}, {K[2], K[3]}};
+    
+    // Declare transformation matrix
+    // Declare pointer to two dimensional array and initialise
+    double transform[2][2];
+    for (unsigned int j = 0; j < num_derivatives; j++)
+    {
+      for (unsigned int k = 0; k < num_derivatives; k++)
+        transform[j][k] = 1;
+    }
+    
+    // Construct transformation matrix
+    for (unsigned int row = 0; row < num_derivatives; row++)
+    {
+      for (unsigned int col = 0; col < num_derivatives; col++)
+      {
+        for (unsigned int k = 0; k < n; k++)
+          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];
+      }
+    }
+    switch (i)
+    {
+    case 0:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, -0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 1:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.288675134594813, -0.166666666666667};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    case 2:
+      {
+        
+      // Array of basisvalues
+      double basisvalues[3] = {0.0, 0.0, 0.0};
+      
+      // Declare helper variables
+      double tmp0 = (1.0 + Y + 2.0*X)/2.0;
+      
+      // Compute basisvalues
+      basisvalues[0] = 1.0;
+      basisvalues[1] = tmp0;
+      basisvalues[2] = basisvalues[0]*(0.5 + 1.5*Y);
+      basisvalues[0] *= std::sqrt(0.5);
+      basisvalues[2] *= std::sqrt(1.0);
+      basisvalues[1] *= std::sqrt(3.0);
+      
+      // Table(s) of coefficients
+      static const double coefficients0[3] = \
+      {0.471404520791032, 0.0, 0.333333333333333};
+      
+      // Tables of derivatives of the polynomial base (transpose).
+      static const double dmats0[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {4.89897948556636, 0.0, 0.0},
+      {0.0, 0.0, 0.0}};
+      
+      static const double dmats1[3][3] = \
+      {{0.0, 0.0, 0.0},
+      {2.44948974278318, 0.0, 0.0},
+      {4.24264068711928, 0.0, 0.0}};
+      
+      // Compute reference derivatives.
+      // Declare array of derivatives on FIAT element.
+      double derivatives[2];
+      for (unsigned int r = 0; r < 2; r++)
+      {
+        derivatives[r] = 0.0;
+      } // end loop over 'r'
+      
+      // Declare derivative matrix (of polynomial basis).
+      double dmats[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Declare (auxiliary) derivative matrix (of polynomial basis).
+      double dmats_old[3][3] = \
+      {{1.0, 0.0, 0.0},
+      {0.0, 1.0, 0.0},
+      {0.0, 0.0, 1.0}};
+      
+      // Loop possible derivatives.
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        // Resetting dmats values to compute next derivative.
+        for (unsigned int t = 0; t < 3; t++)
+        {
+          for (unsigned int u = 0; u < 3; u++)
+          {
+            dmats[t][u] = 0.0;
+            if (t == u)
+            {
+            dmats[t][u] = 1.0;
+            }
+            
+          } // end loop over 'u'
+        } // end loop over 't'
+        
+        // Looping derivative order to generate dmats.
+        for (unsigned int s = 0; s < n; s++)
+        {
+          // Updating dmats_old with new values and resetting dmats.
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              dmats_old[t][u] = dmats[t][u];
+              dmats[t][u] = 0.0;
+            } // end loop over 'u'
+          } // end loop over 't'
+          
+          // Update dmats using an inner product.
+          if (combinations[r][s] == 0)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats0[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+          if (combinations[r][s] == 1)
+          {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            for (unsigned int u = 0; u < 3; u++)
+            {
+              for (unsigned int tu = 0; tu < 3; tu++)
+              {
+                dmats[t][u] += dmats1[t][tu]*dmats_old[tu][u];
+              } // end loop over 'tu'
+            } // end loop over 'u'
+          } // end loop over 't'
+          }
+          
+        } // end loop over 's'
+        for (unsigned int s = 0; s < 3; s++)
+        {
+          for (unsigned int t = 0; t < 3; t++)
+          {
+            derivatives[r] += coefficients0[s]*dmats[s][t]*basisvalues[t];
+          } // end loop over 't'
+        } // end loop over 's'
+      } // end loop over 'r'
+      
+      // Transform derivatives back to physical element
+      for (unsigned int r = 0; r < num_derivatives; r++)
+      {
+        for (unsigned int s = 0; s < num_derivatives; s++)
+        {
+          values[r] += transform[r][s]*derivatives[s];
+        } // end loop over 's'
+      } // end loop over 'r'
+        break;
+      }
+    }
+    
+  }
+
+  /// Evaluate order n derivatives of basis function i at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives(std::size_t i,
+                                          std::size_t n,
+                                          double* values,
+                                          const double* x,
+                                          const double* vertex_coordinates,
+                                          int cell_orientation) const
+  {
+    _evaluate_basis_derivatives(i, n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (actual implementation)
+  static void _evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation)
+  {
+    // Call evaluate_basis_all if order of derivatives is equal to zero.
+    if (n == 0)
+    {
+      _evaluate_basis_all(values, x, vertex_coordinates, cell_orientation);
+      return ;
+    }
+    
+    // Compute number of derivatives.
+    unsigned int num_derivatives = 1;
+    for (unsigned int r = 0; r < n; r++)
+    {
+      num_derivatives *= 2;
+    } // end loop over 'r'
+    
+    // Set values equal to zero.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = 0.0;
+      } // end loop over 's'
+    } // end loop over 'r'
+    
+    // If order of derivatives is greater than the maximum polynomial degree, return zeros.
+    if (n > 1)
+    {
+      return ;
+    }
+    
+    // Helper variable to hold values of a single dof.
+    double dof_values[2];
+    for (unsigned int r = 0; r < 2; r++)
+    {
+      dof_values[r] = 0.0;
+    } // end loop over 'r'
+    
+    // Loop dofs and call evaluate_basis_derivatives.
+    for (unsigned int r = 0; r < 3; r++)
+    {
+      _evaluate_basis_derivatives(r, n, dof_values, x, vertex_coordinates, cell_orientation);
+      for (unsigned int s = 0; s < num_derivatives; s++)
+      {
+        values[r*num_derivatives + s] = dof_values[s];
+      } // end loop over 's'
+    } // end loop over 'r'
+  }
+
+  /// Evaluate order n derivatives of all basis functions at given point x in cell (non-static member function)
+  virtual void evaluate_basis_derivatives_all(std::size_t n,
+                                              double* values,
+                                              const double* x,
+                                              const double* vertex_coordinates,
+                                              int cell_orientation) const
+  {
+    _evaluate_basis_derivatives_all(n, values, x, vertex_coordinates, cell_orientation);
+  }
+
+  /// Evaluate linear functional for dof i on the function f
+  virtual double evaluate_dof(std::size_t i,
+                              const ufc::function& f,
+                              const double* vertex_coordinates,
+                              int cell_orientation,
+                              const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    switch (i)
+    {
+    case 0:
+      {
+        y[0] = vertex_coordinates[0];
+      y[1] = vertex_coordinates[1];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 1:
+      {
+        y[0] = vertex_coordinates[2];
+      y[1] = vertex_coordinates[3];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    case 2:
+      {
+        y[0] = vertex_coordinates[4];
+      y[1] = vertex_coordinates[5];
+      f.evaluate(vals, y, c);
+      return vals[0];
+        break;
+      }
+    }
+    
+    return 0.0;
+  }
+
+  /// Evaluate linear functionals for all dofs on the function f
+  virtual void evaluate_dofs(double* values,
+                             const ufc::function& f,
+                             const double* vertex_coordinates,
+                             int cell_orientation,
+                             const ufc::cell& c) const
+  {
+    // Declare variables for result of evaluation
+    double vals[1];
+    
+    // Declare variable for physical coordinates
+    double y[2];
+    y[0] = vertex_coordinates[0];
+    y[1] = vertex_coordinates[1];
+    f.evaluate(vals, y, c);
+    values[0] = vals[0];
+    y[0] = vertex_coordinates[2];
+    y[1] = vertex_coordinates[3];
+    f.evaluate(vals, y, c);
+    values[1] = vals[0];
+    y[0] = vertex_coordinates[4];
+    y[1] = vertex_coordinates[5];
+    f.evaluate(vals, y, c);
+    values[2] = vals[0];
+  }
+
+  /// Interpolate vertex values from dof values
+  virtual void interpolate_vertex_values(double* vertex_values,
+                                         const double* dof_values,
+                                         const double* vertex_coordinates,
+                                         int cell_orientation,
+                                         const ufc::cell& c) const
+  {
+    // Evaluate function and change variables
+    vertex_values[0] = dof_values[0];
+    vertex_values[1] = dof_values[1];
+    vertex_values[2] = dof_values[2];
+  }
+
+  /// Map coordinate xhat from reference cell to coordinate x in cell
+  virtual void map_from_reference_cell(double* x,
+                                       const double* xhat,
+                                       const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_from_reference_cell not yet implemented.");
+  }
+
+  /// Map from coordinate x in cell to coordinate xhat in reference cell
+  virtual void map_to_reference_cell(double* xhat,
+                                     const double* x,
+                                     const ufc::cell& c) const
+  {
+    throw std::runtime_error("map_to_reference_cell not yet implemented.");
+  }
+
+  /// Return the number of sub elements (for a mixed element)
+  virtual std::size_t num_sub_elements() const
+  {
+    return 0;
+  }
+
+  /// Create a new finite element for sub element i (for a mixed element)
+  virtual ufc::finite_element* create_sub_element(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::finite_element* create() const
+  {
+    return new reactiondiffusionaction_finite_element_0();
+  }
+
+};
+
+/// This class defines the interface for a local-to-global mapping of
+/// degrees of freedom (dofs).
+
+class reactiondiffusionaction_dofmap_0: public ufc::dofmap
+{
+public:
+
+  /// Constructor
+  reactiondiffusionaction_dofmap_0() : ufc::dofmap()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusionaction_dofmap_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the dofmap
+  virtual const char* signature() const
+  {
+    return "FFC dofmap for FiniteElement('Lagrange', Domain(Cell('triangle', 2)), 1, None)";
+  }
+
+  /// Return true iff mesh entities of topological dimension d are needed
+  virtual bool needs_mesh_entities(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return true;
+        break;
+      }
+    case 1:
+      {
+        return false;
+        break;
+      }
+    case 2:
+      {
+        return false;
+        break;
+      }
+    }
+    
+    return false;
+  }
+
+  /// Return the topological dimension of the associated cell shape
+  virtual std::size_t topological_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the geometric dimension of the associated cell shape
+  virtual std::size_t geometric_dimension() const
+  {
+    return 2;
+  }
+
+  /// Return the dimension of the global finite element function space
+  virtual std::size_t global_dimension(const std::vector<std::size_t>&
+                                       num_global_entities) const
+  {
+    return num_global_entities[0];
+  }
+
+  /// Return the dimension of the local finite element function space for a cell
+  virtual std::size_t local_dimension() const
+  {
+    return 3;
+  }
+
+  /// Return the number of dofs on each cell facet
+  virtual std::size_t num_facet_dofs() const
+  {
+    return 2;
+  }
+
+  /// Return the number of dofs associated with each cell entity of dimension d
+  virtual std::size_t num_entity_dofs(std::size_t d) const
+  {
+    switch (d)
+    {
+    case 0:
+      {
+        return 1;
+        break;
+      }
+    case 1:
+      {
+        return 0;
+        break;
+      }
+    case 2:
+      {
+        return 0;
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Tabulate the local-to-global mapping of dofs on a cell
+  virtual void tabulate_dofs(std::size_t* dofs,
+                             const std::vector<std::size_t>& num_global_entities,
+                             const ufc::cell& c) const
+  {
+    dofs[0] = c.entity_indices[0][0];
+    dofs[1] = c.entity_indices[0][1];
+    dofs[2] = c.entity_indices[0][2];
+  }
+
+  /// Tabulate the local-to-local mapping from facet dofs to cell dofs
+  virtual void tabulate_facet_dofs(std::size_t* dofs,
+                                   std::size_t facet) const
+  {
+    switch (facet)
+    {
+    case 0:
+      {
+        dofs[0] = 1;
+      dofs[1] = 2;
+        break;
+      }
+    case 1:
+      {
+        dofs[0] = 0;
+      dofs[1] = 2;
+        break;
+      }
+    case 2:
+      {
+        dofs[0] = 0;
+      dofs[1] = 1;
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the local-to-local mapping of dofs on entity (d, i)
+  virtual void tabulate_entity_dofs(std::size_t* dofs,
+                                    std::size_t d, std::size_t i) const
+  {
+    if (d > 2)
+    {
+    throw std::runtime_error("d is larger than dimension (2)");
+    }
+    
+    switch (d)
+    {
+    case 0:
+      {
+        if (i > 2)
+      {
+      throw std::runtime_error("i is larger than number of entities (2)");
+      }
+      
+      switch (i)
+      {
+      case 0:
+        {
+          dofs[0] = 0;
+          break;
+        }
+      case 1:
+        {
+          dofs[0] = 1;
+          break;
+        }
+      case 2:
+        {
+          dofs[0] = 2;
+          break;
+        }
+      }
+      
+        break;
+      }
+    case 1:
+      {
+        
+        break;
+      }
+    case 2:
+      {
+        
+        break;
+      }
+    }
+    
+  }
+
+  /// Tabulate the coordinates of all dofs on a cell
+  virtual void tabulate_coordinates(double** dof_coordinates,
+                                    const double* vertex_coordinates) const
+  {
+    dof_coordinates[0][0] = vertex_coordinates[0];
+    dof_coordinates[0][1] = vertex_coordinates[1];
+    dof_coordinates[1][0] = vertex_coordinates[2];
+    dof_coordinates[1][1] = vertex_coordinates[3];
+    dof_coordinates[2][0] = vertex_coordinates[4];
+    dof_coordinates[2][1] = vertex_coordinates[5];
+  }
+
+  /// Return the number of sub dofmaps (for a mixed element)
+  virtual std::size_t num_sub_dofmaps() const
+  {
+    return 0;
+  }
+
+  /// Create a new dofmap for sub dofmap i (for a mixed element)
+  virtual ufc::dofmap* create_sub_dofmap(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new class instance
+  virtual ufc::dofmap* create() const
+  {
+    return new reactiondiffusionaction_dofmap_0();
+  }
+
+};
+
+/// This class defines the interface for the tabulation of the cell
+/// tensor corresponding to the local contribution to a form from
+/// the integral over a cell.
+
+class reactiondiffusionaction_cell_integral_0_otherwise: public ufc::cell_integral
+{
+public:
+
+  /// Constructor
+  reactiondiffusionaction_cell_integral_0_otherwise() : ufc::cell_integral()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusionaction_cell_integral_0_otherwise()
+  {
+    // Do nothing
+  }
+
+  /// Tabulate which form coefficients are used by this integral
+  virtual const std::vector<bool> & enabled_coefficients() const
+  {
+    static const std::vector<bool> enabled({true});
+    return enabled;
+  }
+
+  /// Tabulate the tensor for the contribution from a local cell
+  virtual void tabulate_tensor(double*  A,
+                               const double * const *  w,
+                               const double*  vertex_coordinates,
+                               int cell_orientation) const
+  {
+    // Number of operations (multiply-add pairs) for Jacobian data:      3
+    // Number of operations (multiply-add pairs) for geometry tensor:    23
+    // Number of operations (multiply-add pairs) for tensor contraction: 23
+    // Total number of operations (multiply-add pairs):                  49
+    
+    // Compute Jacobian
+    double J[4];
+    compute_jacobian_triangle_2d(J, vertex_coordinates);
+    
+    // Compute Jacobian inverse and determinant
+    double K[4];
+    double detJ;
+    compute_jacobian_inverse_triangle_2d(K, detJ, J);
+    
+    // Set scale factor
+    const double det = std::abs(detJ);
+    
+    // Compute geometry tensor
+    const double G0_0_0_0 = det*(w[0][0]*((K[0]*K[0] + K[1]*K[1])));
+    const double G0_0_0_1 = det*(w[0][0]*((K[0]*K[2] + K[1]*K[3])));
+    const double G0_0_1_0 = det*(w[0][1]*((K[0]*K[0] + K[1]*K[1])));
+    const double G0_0_2_1 = det*(w[0][2]*((K[0]*K[2] + K[1]*K[3])));
+    const double G0_1_0_0 = det*(w[0][0]*((K[2]*K[0] + K[3]*K[1])));
+    const double G0_1_0_1 = det*(w[0][0]*((K[2]*K[2] + K[3]*K[3])));
+    const double G0_1_1_0 = det*(w[0][1]*((K[2]*K[0] + K[3]*K[1])));
+    const double G0_1_2_1 = det*(w[0][2]*((K[2]*K[2] + K[3]*K[3])));
+    const double G1_0 = det*w[0][0]*(1.0);
+    const double G1_1 = det*w[0][1]*(1.0);
+    const double G1_2 = det*w[0][2]*(1.0);
+    
+    // Compute element tensor
+    A[0] = 0.5*G0_0_0_0 + 0.5*G0_0_0_1 - 0.5*G0_0_1_0 - 0.5*G0_0_2_1 + 0.5*G0_1_0_0 + 0.5*G0_1_0_1 - 0.5*G0_1_1_0 - 0.5*G0_1_2_1 + 0.0833333333333334*G1_0 + 0.0416666666666667*G1_1 + 0.0416666666666667*G1_2;
+    A[1] = -0.5*G0_0_0_0 - 0.5*G0_0_0_1 + 0.5*G0_0_1_0 + 0.5*G0_0_2_1 + 0.0416666666666667*G1_0 + 0.0833333333333333*G1_1 + 0.0416666666666666*G1_2;
+    A[2] = -0.5*G0_1_0_0 - 0.5*G0_1_0_1 + 0.5*G0_1_1_0 + 0.5*G0_1_2_1 + 0.0416666666666667*G1_0 + 0.0416666666666666*G1_1 + 0.0833333333333333*G1_2;
+  }
+
+};
+
+/// This class defines the interface for the assembly of the global
+/// tensor corresponding to a form with r + n arguments, that is, a
+/// mapping
+///
+///     a : V1 x V2 x ... Vr x W1 x W2 x ... x Wn -> R
+///
+/// with arguments v1, v2, ..., vr, w1, w2, ..., wn. The rank r
+/// global tensor A is defined by
+///
+///     A = a(V1, V2, ..., Vr, w1, w2, ..., wn),
+///
+/// where each argument Vj represents the application to the
+/// sequence of basis functions of Vj and w1, w2, ..., wn are given
+/// fixed functions (coefficients).
+
+class reactiondiffusionaction_form_0: public ufc::form
+{
+public:
+
+  /// Constructor
+  reactiondiffusionaction_form_0() : ufc::form()
+  {
+    // Do nothing
+  }
+
+  /// Destructor
+  virtual ~reactiondiffusionaction_form_0()
+  {
+    // Do nothing
+  }
+
+  /// Return a string identifying the form
+  virtual const char* signature() const
+  {
+    return "ac8ed1ce408944abb63c7013d6b4852cff66cabfae2753aa9cb2f791f5585ef65343c3efdd22c93efa0df19644ea183d4c328cd95cfcdda8a5c7e1ef79e2c599";
+  }
+
+  /// Return the rank of the global tensor (r)
+  virtual std::size_t rank() const
+  {
+    return 1;
+  }
+
+  /// Return the number of coefficients (n)
+  virtual std::size_t num_coefficients() const
+  {
+    return 1;
+  }
+
+  /// Return the number of cell domains
+  virtual std::size_t num_cell_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of exterior facet domains
+  virtual std::size_t num_exterior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of interior facet domains
+  virtual std::size_t num_interior_facet_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of point domains
+  virtual std::size_t num_point_domains() const
+  {
+    return 0;
+  }
+
+  /// Return the number of custom domains
+  virtual std::size_t num_custom_domains() const
+  {
+    return 0;
+  }
+
+  /// Return whether the form has any cell integrals
+  virtual bool has_cell_integrals() const
+  {
+    return true;
+  }
+
+  /// Return whether the form has any exterior facet integrals
+  virtual bool has_exterior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any interior facet integrals
+  virtual bool has_interior_facet_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any point integrals
+  virtual bool has_point_integrals() const
+  {
+    return false;
+  }
+
+  /// Return whether the form has any custom integrals
+  virtual bool has_custom_integrals() const
+  {
+    return false;
+  }
+
+  /// Create a new finite element for argument function i
+  virtual ufc::finite_element* create_finite_element(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new reactiondiffusionaction_finite_element_0();
+        break;
+      }
+    case 1:
+      {
+        return new reactiondiffusionaction_finite_element_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new dofmap for argument function i
+  virtual ufc::dofmap* create_dofmap(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      {
+        return new reactiondiffusionaction_dofmap_0();
+        break;
+      }
+    case 1:
+      {
+        return new reactiondiffusionaction_dofmap_0();
+        break;
+      }
+    }
+    
+    return 0;
+  }
+
+  /// Create a new cell integral on sub domain i
+  virtual ufc::cell_integral* create_cell_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new exterior facet integral on sub domain i
+  virtual ufc::exterior_facet_integral* create_exterior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on sub domain i
+  virtual ufc::interior_facet_integral* create_interior_facet_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on sub domain i
+  virtual ufc::point_integral* create_point_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on sub domain i
+  virtual ufc::custom_integral* create_custom_integral(std::size_t i) const
+  {
+    return 0;
+  }
+
+  /// Create a new cell integral on everywhere else
+  virtual ufc::cell_integral* create_default_cell_integral() const
+  {
+    return new reactiondiffusionaction_cell_integral_0_otherwise();
+  }
+
+  /// Create a new exterior facet integral on everywhere else
+  virtual ufc::exterior_facet_integral* create_default_exterior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new interior facet integral on everywhere else
+  virtual ufc::interior_facet_integral* create_default_interior_facet_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new point integral on everywhere else
+  virtual ufc::point_integral* create_default_point_integral() const
+  {
+    return 0;
+  }
+
+  /// Create a new custom integral on everywhere else
+  virtual ufc::custom_integral* create_default_custom_integral() const
+  {
+    return 0;
+  }
+
+};
+
+// DOLFIN wrappers
+
+// Standard library includes
+#include <string>
+
+// DOLFIN includes
+#include <dolfin/common/NoDeleter.h>
+#include <dolfin/mesh/Restriction.h>
+#include <dolfin/fem/FiniteElement.h>
+#include <dolfin/fem/DofMap.h>
+#include <dolfin/fem/Form.h>
+#include <dolfin/function/FunctionSpace.h>
+#include <dolfin/function/GenericFunction.h>
+#include <dolfin/function/CoefficientAssigner.h>
+#include <dolfin/adaptivity/ErrorControl.h>
+#include <dolfin/adaptivity/GoalFunctional.h>
+
+namespace ReactionDiffusionAction
+{
+
+class CoefficientSpace_u: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  CoefficientSpace_u(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  CoefficientSpace_u(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  CoefficientSpace_u(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~CoefficientSpace_u()
+  {
+  }
+
+};
+
+class Form_a_FunctionSpace_0: public dolfin::FunctionSpace
+{
+public:
+
+  //--- Constructors for standard function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()), mesh)))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()), *mesh)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for constrained function space, 2 different versions ---
+
+  // Create standard function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Mesh& mesh, const dolfin::SubDomain& constrained_domain):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(mesh),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()), mesh,
+                              dolfin::reference_to_no_delete_pointer(constrained_domain))))
+  {
+    // Do nothing
+  }
+
+  // Create standard function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Mesh> mesh, std::shared_ptr<const dolfin::SubDomain> constrained_domain):
+    dolfin::FunctionSpace(mesh,
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()), *mesh, constrained_domain)))
+  {
+    // Do nothing
+  }
+
+  //--- Constructors for restricted function space, 2 different versions ---
+
+  // Create restricted function space (reference version)
+  Form_a_FunctionSpace_0(const dolfin::Restriction& restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction.mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()),
+                                                                                     reference_to_no_delete_pointer(restriction))))
+  {
+    // Do nothing
+  }
+
+  // Create restricted function space (shared pointer version)
+  Form_a_FunctionSpace_0(std::shared_ptr<const dolfin::Restriction> restriction):
+    dolfin::FunctionSpace(dolfin::reference_to_no_delete_pointer(restriction->mesh()),
+                          std::shared_ptr<const dolfin::FiniteElement>(new dolfin::FiniteElement(std::shared_ptr<ufc::finite_element>(new reactiondiffusionaction_finite_element_0()))),
+                          std::shared_ptr<const dolfin::DofMap>(new dolfin::DofMap(std::shared_ptr<ufc::dofmap>(new reactiondiffusionaction_dofmap_0()),
+                                                                                     restriction)))
+  {
+    // Do nothing
+  }
+
+  // Copy constructor
+  ~Form_a_FunctionSpace_0()
+  {
+  }
+
+};
+
+typedef CoefficientSpace_u Form_a_FunctionSpace_1;
+
+class Form_a: public dolfin::Form
+{
+public:
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V0):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusionaction_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V0, const dolfin::GenericFunction& u):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusionaction_form_0());
+  }
+
+  // Constructor
+  Form_a(const dolfin::FunctionSpace& V0, std::shared_ptr<const dolfin::GenericFunction> u):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = reference_to_no_delete_pointer(V0);
+
+    this->u = *u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusionaction_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V0):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusionaction_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V0, const dolfin::GenericFunction& u):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusionaction_form_0());
+  }
+
+  // Constructor
+  Form_a(std::shared_ptr<const dolfin::FunctionSpace> V0, std::shared_ptr<const dolfin::GenericFunction> u):
+    dolfin::Form(1, 1), u(*this, 0)
+  {
+    _function_spaces[0] = V0;
+
+    this->u = *u;
+
+    _ufc_form = std::shared_ptr<const ufc::form>(new reactiondiffusionaction_form_0());
+  }
+
+  // Destructor
+  ~Form_a()
+  {}
+
+  /// Return the number of the coefficient with this name
+  virtual std::size_t coefficient_number(const std::string& name) const
+  {
+    if (name == "u")
+      return 0;
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return 0;
+  }
+
+  /// Return the name of the coefficient with this number
+  virtual std::string coefficient_name(std::size_t i) const
+  {
+    switch (i)
+    {
+    case 0:
+      return "u";
+    }
+
+    dolfin::dolfin_error("generated code for class Form",
+                         "access coefficient data",
+                         "Invalid coefficient");
+    return "unnamed";
+  }
+
+  // Typedefs
+  typedef Form_a_FunctionSpace_0 TestSpace;
+  typedef Form_a_FunctionSpace_1 CoefficientSpace_u;
+
+  // Coefficients
+  dolfin::CoefficientAssigner u;
+};
+
+// Class typedefs
+typedef Form_a LinearForm;
+typedef Form_a ResidualForm;
+typedef Form_a::TestSpace FunctionSpace;
+
+}
+
+#endif
diff --git a/test/unit/la/cpp/forms/ReactionDiffusionAction.ufl b/test/unit/la/cpp/forms/ReactionDiffusionAction.ufl
new file mode 100644
index 0000000..2455ab7
--- /dev/null
+++ b/test/unit/la/cpp/forms/ReactionDiffusionAction.ufl
@@ -0,0 +1,26 @@
+# Copyright (C) 2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http:#www.gnu.org/licenses/>.
+#
+# First added:  2012-08-21
+# Last changed: 2012-08-21
+#
+# Linear form the action of a simple reaction-diffusion problem
+
+V = FiniteElement("Lagrange", triangle, 1)
+u = Coefficient(V)
+v = TestFunction(V)
+a = dot(grad(u), grad(v))*dx + u*v*dx
diff --git a/test/unit/la/cpp/forms/compile.log b/test/unit/la/cpp/forms/compile.log
new file mode 100644
index 0000000..8518b40
--- /dev/null
+++ b/test/unit/la/cpp/forms/compile.log
@@ -0,0 +1,329 @@
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form ReactionDiffusionAction
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[u]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 3
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0274529 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.0015 seconds
+  Shape of reference tensor: (3, 2, 3, 2)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 3 dims = [2, 3, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [0, 2, 0], [0, 2, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1], [1, 2, 0], [1, 2, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 3 dims = [2, 3, 2] indices = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [0, 2, 0], [0, 2, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1], [1, 2, 0], [1, 2, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.00107 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.0118911 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000345945 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0721262 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.000558138 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./ReactionDiffusionAction.h.
+  
+Compiler stage 5 finished in 0.00072813 seconds.
+
+FFC finished in 0.113581 seconds.
+This is FFC, the FEniCS Form Compiler, version 1.4.0.
+For further information, visit http://www.fenics.org/ffc/.
+
+Compiling form ReactionDiffusion
+
+Compiler stage 1: Analyzing form(s)
+-----------------------------------
+  
+  Name:                   'a'
+  Geometric dimension:    2
+  Rank:                   2
+  Arguments:              '[v_0, v_1]'
+  Argument names:         '[v, u]'
+  Number of coefficients: 0
+  Coefficients:           '[]'
+  Coefficient names:      '[]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 2
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+  Name:                   'L'
+  Geometric dimension:    2
+  Rank:                   1
+  Arguments:              '[v_0]'
+  Argument names:         '[v]'
+  Number of coefficients: 1
+  Coefficients:           '[w_0]'
+  Coefficient names:      '[f]'
+  Unique elements:        'CG1(?)'
+  Unique sub elements:    'CG1(?)'
+  
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Estimated cost of tensor representation: 1
+  representation:    auto --> tensor
+  Selecting quadrature degree based on total polynomial degree of integrand: 2
+  quadrature_degree: auto --> 2
+  quadrature_rule:   auto --> default
+  
+Compiler stage 1 finished in 0.0209081 seconds.
+
+Compiler stage 2: Computing intermediate representation
+-------------------------------------------------------
+  Computing representation of 1 elements
+  Reusing element from cache
+  Reusing element from cache
+  Computing representation of 1 dofmaps
+  Reusing element from cache
+  Computing representation of integrals
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  36 entries computed in 0.0011 seconds
+  Shape of reference tensor: (3, 3, 2, 2)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 2 dims = [2, 2] indices = [[0, 0], [0, 1], [1, 0], [1, 1]]
+  External multi index:  rank = 1 dims = [2] indices = [[0], [1]]
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000743 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 2 dims = [3, 3] indices = [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 0 dims = [] indices = [[]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing tensor representation
+  Extracting monomial form representation from UFL form
+  Transforming monomial form to reference element
+  Reusing element from cache
+  Reusing element from cache
+  Precomputing integrals on reference element
+  Reusing element from cache
+  9 entries computed in 0.000755 seconds
+  Shape of reference tensor: (3, 3)
+  Primary multi index:   rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  Internal multi index:  rank = 0 dims = [] indices = [[]]
+  Secondary multi index: rank = 1 dims = [3] indices = [[0], [1], [2]]
+  External multi index:  rank = 0 dims = [] indices = [[]]
+  Reusing element from cache
+  Computing representation of forms
+  
+Compiler stage 2 finished in 0.012099 seconds.
+
+Compiler stage 3: Optimizing intermediate representation
+--------------------------------------------------------
+  FErari not installed, skipping tensor optimizations
+  FErari not installed, skipping tensor optimizations
+  
+Compiler stage 3 finished in 0.000313044 seconds.
+
+Compiler stage 4: Generating code
+---------------------------------
+  Generating code for 1 element(s)
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Removing unused variable: tmp2
+  Removing unused variable: tmp1
+  Removing unused variable: tmp7
+  Removing unused variable: tmp6
+  Removing unused variable: tmp5
+  Removing unused variable: tt
+  Removing unused variable: ss
+  Removing unused variable: rr
+  Generating code for 1 dofmap(s)
+  Generating code for integrals
+  Generating code for forms
+  
+Compiler stage 4 finished in 0.0825009 seconds.
+
+Compiler stage 4.1: Generating additional wrapper code
+------------------------------------------------------
+  Generating wrapper code for DOLFIN
+  
+Compiler stage 4.1 finished in 0.001472 seconds.
+
+Compiler stage 5: Formatting code
+---------------------------------
+  Output written to ./ReactionDiffusion.h.
+  
+Compiler stage 5 finished in 0.00151682 seconds.
+
+FFC finished in 0.119405 seconds.
diff --git a/test/unit/la/python/KrylovSolver.py b/test/unit/la/python/KrylovSolver.py
new file mode 100644
index 0000000..79611c5
--- /dev/null
+++ b/test/unit/la/python/KrylovSolver.py
@@ -0,0 +1,80 @@
+"""Unit tests for the KrylovSolver interface"""
+
+# Copyright (C) 2012 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2012
+#
+# First added:  2012-02-21
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+# Assemble system
+mesh = UnitSquareMesh(32, 32)
+V = FunctionSpace(mesh, 'CG', 1)
+bc = DirichletBC(V, Constant(0.0), lambda x, on_boundary: on_boundary)
+u = TrialFunction(V)
+v = TestFunction(V)
+u1 = Function(V)
+
+# Forms
+a, L = inner(grad(u), grad(v))*dx, Constant(1.0)*v*dx
+a_L = inner(grad(u1), grad(v))*dx
+
+# Assemble linear algebra objects
+A = assemble(a)
+b = assemble(L)
+bc.apply(A, b)
+
+if has_linear_algebra_backend("PETSc"):
+    class PETScKrylovSolverTester(unittest.TestCase):
+
+        def test_krylov_solver(self):
+            "Test PETScKrylovSolver"
+            # Get solution vector
+            tmp = Function(V)
+            #x = tmp.vector()
+
+            # Solve first using direct solver
+            #solve(A, x, b, "lu")
+
+            #direct_norm = x.norm("l2")
+
+            # Get solution vector
+            #x_petsc = as_backend_type(x)
+
+            # With simple interface
+            #solver = PETScKrylovSolver("gmres", prec)
+            #solver.solve(A, x_petsc, as_backend_type(b))
+            #self.assertAlmostEqual(x_petsc.norm("l2"), direct_norm, 5)
+
+            # With PETScPreconditioner interface
+            #solver = PETScKrylovSolver("gmres", PETScPreconditioner(prec))
+            #solver.solve(A, x_petsc, as_backend_type(b))
+            #self.assertAlmostEqual(x_petsc.norm("l2"), direct_norm, 5)
+
+if __name__ == "__main__":
+
+    # Turn off DOLFIN output
+    set_log_active(False)
+
+    print ""
+    print "Testing DOLFIN la/KrylovSolver interface"
+    print "----------------------------------------"
+    unittest.main()
diff --git a/test/unit/la/python/LinearOperator.py b/test/unit/la/python/LinearOperator.py
new file mode 100644
index 0000000..ee2669a
--- /dev/null
+++ b/test/unit/la/python/LinearOperator.py
@@ -0,0 +1,94 @@
+"Unit tests for matrix-free linear solvers (LinearOperator)"
+
+# Copyright (C) 2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-08-24
+# Last changed: 2012-08-24
+
+import unittest
+from dolfin import *
+
+# Backends supporting the LinearOperator interface
+backends = ["PETSc", "uBLAS"]
+
+class TestLinearOperator(unittest.TestCase):
+
+    def test_linear_operator(self):
+
+        # Define linear operator
+        class MyLinearOperator(LinearOperator):
+
+            def __init__(self, a_action, u):
+                LinearOperator.__init__(self, u.vector(), u.vector())
+                self.a_action = a_action
+                self.u = u
+
+            def size(self, dim):
+                return self.u.function_space().dim()
+
+            def mult(self, x, y):
+
+                # Update coefficient vector
+                self.u.vector()[:] = x
+
+                # Assemble action
+                assemble(self.a_action, tensor=y)
+
+        # Iterate over backends supporting linear operators
+        for backend in backends:
+
+            # Check whether backend is available
+            if not has_linear_algebra_backend(backend):
+                continue
+
+            # Set linear algebra backend
+            parameters["linear_algebra_backend"] = backend
+
+            # Compute reference value by solving ordinary linear system
+            mesh = UnitSquareMesh(8, 8)
+
+            # Skip testing uBLAS in parallel
+            if MPI.size(mesh.mpi_comm()) > 1 and backend == "uBLAS":
+                print "Not running uBLAS test in parallel"
+                continue
+
+            V = FunctionSpace(mesh, "Lagrange", 1)
+            u = TrialFunction(V)
+            v = TestFunction(V)
+            f = Constant(1.0)
+            a = dot(grad(u), grad(v))*dx + u*v*dx
+            L = f*v*dx
+            A = assemble(a)
+            b = assemble(L)
+            x = Vector()
+            solve(A, x, b, "gmres", "none")
+            norm_ref = norm(x, "l2")
+
+            # Solve using linear operator defined by form action
+            u = Function(V)
+            a_action = action(a, coefficient=u)
+            O = MyLinearOperator(a_action, u)
+            solve(O, x, b, "gmres", "none")
+            norm_action = norm(x, "l2")
+
+if __name__ == "__main__":
+
+    print ""
+    print "Testing DOLFIN la/LinearOperator (matrix-free) interface"
+    print "--------------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/la/python/Matrix.py b/test/unit/la/python/Matrix.py
new file mode 100644
index 0000000..121822e
--- /dev/null
+++ b/test/unit/la/python/Matrix.py
@@ -0,0 +1,376 @@
+"""Unit tests for the Matrix interface"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+# Modified by Mikael Mortensen 2011
+# Modified by Jan Blechta 2013
+#
+# First added:  2011-03-03
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+class AbstractBaseTest(object):
+    count = 0
+    def setUp(self):
+        if self.backend != "default":
+            parameters.linear_algebra_backend = self.backend
+        type(self).count += 1
+        if type(self).count == 1:
+            # Only print this message once per class instance
+            print "\nRunning:",type(self).__name__
+
+
+    def assemble_matrices(self, use_backend=False, keep_diagonal=False):
+        " Assemble a pair of matrices, one (square) MxM and one MxN"
+        mesh = UnitSquareMesh(21, 23)
+
+        V = FunctionSpace(mesh, "Lagrange", 2)
+        W = FunctionSpace(mesh, "Lagrange", 1)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        s = TrialFunction(W)
+
+        # Forms
+        a = dot(grad(u), grad(v))*ds
+        b = v*s*dx
+
+        return self.assemble(a, use_backend=use_backend, keep_diagonal=keep_diagonal), \
+               self.assemble(b, use_backend=use_backend, keep_diagonal=keep_diagonal)
+
+    def assemble(self, form, use_backend=False, keep_diagonal=False):
+        if use_backend:
+            backend = globals()[self.backend + self.sub_backend + 'Factory'].instance()
+            return assemble(form, backend=backend, keep_diagonal=keep_diagonal)
+        else:
+            return assemble(form, keep_diagonal=keep_diagonal)
+
+    def test_basic_la_operations(self, use_backend=False):
+        from numpy import ndarray, array, ones, sum
+
+        # Tests bailout for this choice
+        if self.backend == "uBLAS" and not use_backend:
+            return
+
+        A, B = self.assemble_matrices(use_backend)
+        unit_norm = A.norm('frobenius')
+
+        def wrong_getitem(type):
+            if type == 0:
+                A["0,1"]
+            elif type == 1:
+                A[0]
+            elif type == 2:
+                A[0, 0, 0]
+
+        # Test wrong getitem
+        self.assertRaises(TypeError, wrong_getitem, 0)
+        self.assertRaises(TypeError, wrong_getitem, 1)
+        self.assertRaises(TypeError, wrong_getitem, 2)
+
+        # Test __imul__ operator
+        A *= 2
+        self.assertAlmostEqual(A.norm('frobenius'), 2*unit_norm)
+
+        # Test __idiv__ operator
+        A /= 2
+        self.assertAlmostEqual(A.norm('frobenius'), unit_norm)
+
+        # Test __mul__ operator
+        C = 4*A
+        self.assertAlmostEqual(C.norm('frobenius'), 4*unit_norm)
+
+        # Test __iadd__ operator
+        A += C
+        self.assertAlmostEqual(A.norm('frobenius'), 5*unit_norm)
+
+        # Test __isub__ operator
+        A -= C
+        self.assertAlmostEqual(A.norm('frobenius'), unit_norm)
+
+        # Test __mul__ and __add__ operator
+        D = (C+A)*0.2
+        self.assertAlmostEqual(D.norm('frobenius'), unit_norm)
+
+        # Test __div__ and __sub__ operator
+        F = (C-A)/3
+        self.assertAlmostEqual(F.norm('frobenius'), unit_norm)
+
+        # Test axpy
+        A.axpy(10,C,True)
+        self.assertAlmostEqual(A.norm('frobenius'), 41*unit_norm)
+
+        # Test expected size of rectangular array
+        self.assertEqual(A.size(0), B.size(0))
+        self.assertEqual(B.size(1), 528)
+
+        # Test setitem/getitem
+        #A[5,5] = 15
+        #self.assertEqual(A[5,5],15)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_numpy_array(self, use_backend=False):
+        from numpy import ndarray, array, ones, sum
+
+        # Tests bailout for this choice
+        if self.backend == "uBLAS" and not use_backend:
+            return
+
+        # Assemble matrices
+        A, B = self.assemble_matrices(use_backend)
+
+        # Test to NumPy array
+        A2 = A.array()
+        self.assertTrue(isinstance(A2,ndarray))
+        self.assertEqual(A2.shape, (2021, 2021))
+        self.assertAlmostEqual(sqrt(sum(A2**2)), A.norm('frobenius'))
+
+        if self.backend == 'uBLAS' and self.sub_backend == 'Sparse':
+            try:
+                import scipy.sparse
+                import numpy.linalg
+                A3 = A.sparray()
+                self.assertTrue(isinstance(A3, scipy.sparse.csr_matrix))
+                self.assertAlmostEqual(numpy.linalg.norm(A3.todense() - A2), 0.0)
+            except ImportError:
+                pass
+
+    def test_basic_la_operations_with_backend(self):
+        self.test_basic_la_operations(True)
+
+    #def create_sparsity_pattern(self):
+    #    "Create a sparsity pattern"
+    #    mesh = UnitSquareMesh(34, 33)
+    #
+    #    V = FunctionSpace(mesh, "Lagrange", 2)
+    #    W = FunctionSpace(mesh, "Lagrange", 1)
+    #
+    #    v = TestFunction(V)
+    #    u = TrialFunction(V)
+    #    s = TrialFunction(W)
+    #
+    #    # Forms
+    #    a = dot(grad(u), grad(v))*dx
+    #    b = v*s*dx
+
+    def test_create_empty_matrix(self):
+        A = Matrix()
+        self.assertEqual(A.size(0), 0)
+        self.assertEqual(A.size(1), 0)
+        info(A)
+        info(A, True)
+
+    def test_copy_empty_matrix(self):
+        A = Matrix()
+        B = Matrix(A)
+        self.assertEqual(B.size(0), 0)
+        self.assertEqual(B.size(1), 0)
+
+    def test_copy_matrix(self):
+        A0, B0 = self.assemble_matrices()
+
+        A1 = Matrix(A0)
+        self.assertEqual(A0.size(0), A1.size(0))
+        self.assertEqual(A0.size(1), A1.size(1))
+        self.assertEqual(A0.norm("frobenius"), A1.norm("frobenius"))
+
+        B1 = Matrix(B0)
+        self.assertEqual(B0.size(0), B1.size(0))
+        self.assertEqual(B0.size(1), B1.size(1))
+        self.assertAlmostEqual(B0.norm("frobenius"), B1.norm("frobenius"))
+
+    def test_compress_matrix(self):
+
+        A, B = self.assemble_matrices()
+        A_norm = A.norm('frobenius')
+        C = Matrix()
+        A.compressed(C)
+        C_norm = C.norm('frobenius')
+        self.assertAlmostEqual(A_norm, C_norm)
+
+    def test_ident_zeros(self, use_backend=False):
+
+        # EpetraMatrix::ident() is not reliable
+        if self.backend == "Epetra":
+            return
+
+        # Check that PETScMatrix::ident_zeros() rethrows PETSc error
+        if self.backend[0:5] == "PETSc":
+            A, B = self.assemble_matrices(use_backend=use_backend)
+            self.assertRaises(RuntimeError, A.ident_zeros)
+
+        # Assemble matrix A with diagonal entries
+        A, B = self.assemble_matrices(use_backend=use_backend, keep_diagonal=True)
+
+        # Find zero rows
+        zero_rows = []
+        for i in range(A.local_range(0)[0], A.local_range(0)[1]):
+            row = A.getrow(i)[1]
+            if sum(abs(row)) < DOLFIN_EPS:
+                zero_rows.append(i)
+
+        # Set zero rows to (0,...,0, 1, 0,...,0)
+        A.ident_zeros()
+
+        # Check it
+        for i in zero_rows:
+            cols = A.getrow(i)[0]
+            row  = A.getrow(i)[1]
+            for j in range(cols.size + 1):
+                if i == cols[j]:
+                    self.assertAlmostEqual(row[j], 1.0)
+                    break
+            self.assertTrue(j < cols.size)
+            self.assertAlmostEqual(sum(abs(row)), 1.0)
+
+    def test_ident_zeros_with_backend(self):
+        self.test_ident_zeros(use_backend=True)
+
+    def test_setting_diagonal(self, use_backend=False):
+
+        mesh = UnitSquareMesh(21, 23)
+
+        V = FunctionSpace(mesh, "Lagrange", 2)
+        W = FunctionSpace(mesh, "Lagrange", 1)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+
+        B = self.assemble(u*v*dx(), use_backend=use_backend, keep_diagonal=True)
+
+        b = assemble(action(u*v*dx(), Constant(1)))
+        A = B.copy()
+        A.zero()
+        A.set_diagonal(b)
+
+        resultsA = Vector()
+        resultsB = Vector()
+        A.init_vector(resultsA, 1)
+        B.init_vector(resultsB, 1)
+
+        ones = b.copy()
+        ones[:] = 1.0
+
+        A.mult(ones, resultsA)
+        B.mult(ones, resultsB)
+        self.assertAlmostEqual(resultsA.norm("l2"), resultsB.norm("l2"))
+
+    def test_setting_diagonal_with_backend(self):
+        self.test_setting_diagonal(True)
+
+    #def test_create_from_sparsity_pattern(self):
+
+    #def test_size(self):
+
+    #def test_local_range(self):
+
+    #def test_zero(self):
+
+    #def test_apply(self):
+
+    #def test_str(self):
+
+    #def test_resize(self):
+
+
+# A DataTester class that test the acces of the raw data through pointers
+# This is only available for uBLAS and MTL4 backends
+class DataTester:
+    def test_matrix_data(self, use_backend=False):
+        """ Test for ordinary Matrix"""
+        # Tests bailout for this choice
+        if self.backend == "uBLAS" and \
+               (not use_backend or self.sub_backend =="Dense"):
+            return
+
+        A, B = self.assemble_matrices(use_backend)
+        array = A.array()
+        rows, cols, values = A.data()
+        i = 0
+        for row in xrange(A.size(0)):
+            for col in xrange(rows[row], rows[row+1]):
+                self.assertEqual(array[row, cols[col]],values[i])
+                i += 1
+
+        # Test none writeable of a shallow copy of the data
+        rows, cols, values = A.data(False)
+        def write_data(data):
+            data[0] = 1
+        self.assertRaises(StandardError, write_data, rows)
+        self.assertRaises(StandardError, write_data, cols)
+        self.assertRaises(StandardError, write_data, values)
+
+        # Test for as_backend_typeed Matrix
+        A = as_backend_type(A)
+        rows, cols, values = A.data()
+        for row in xrange(A.size(0)):
+            for k in xrange(rows[row], rows[row+1]):
+                self.assertEqual(array[row,cols[k]], values[k])
+
+    def test_matrix_data_use_backend(self):
+        self.test_matrix_data(True)
+
+class DataNotWorkingTester:
+    def test_matrix_data(self):
+        A, B = self.assemble_matrices()
+        self.assertRaises(RuntimeError, A.data)
+
+        A = as_backend_type(A)
+        self.assertRaises(RuntimeError, A.data)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class uBLASSparseTester(DataTester, AbstractBaseTest, unittest.TestCase):
+    backend     = "uBLAS"
+    sub_backend = "Sparse"
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class uBLASDenseTester(DataTester, AbstractBaseTest, unittest.TestCase):
+    backend     = "uBLAS"
+    sub_backend = "Dense"
+
+if has_linear_algebra_backend("PETScCusp"):
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    class PETScCuspTester(DataNotWorkingTester, AbstractBaseTest, unittest.TestCase):
+        backend    = "PETScCusp"
+        sub_backend = ""
+
+if has_linear_algebra_backend("PETSc"):
+    class PETScTester(DataNotWorkingTester, AbstractBaseTest, unittest.TestCase):
+        backend    = "PETSc"
+        sub_backend = ""
+
+if has_linear_algebra_backend("Epetra"):
+    class EpetraTester(DataNotWorkingTester, AbstractBaseTest, unittest.TestCase):
+        backend    = "Epetra"
+        sub_backend = ""
+
+#class STLTester(DataNotWorkingTester, AbstractBaseTest, unittest.TestCase):
+#    backend    = "STL"
+
+if __name__ == "__main__":
+
+    # Turn off DOLFIN output
+    set_log_active(False)
+
+    print ""
+    print "Testing DOLFIN Matrix classes"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/la/python/Scalar.py b/test/unit/la/python/Scalar.py
new file mode 100644
index 0000000..581976f
--- /dev/null
+++ b/test/unit/la/python/Scalar.py
@@ -0,0 +1,44 @@
+"""Unit tests for the Scalar interface"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-03-01
+# Last changed: 2011-03-01
+
+import unittest
+from dolfin import *
+
+class ScalarTest(unittest.TestCase):
+
+    def test_parallel_sum(self):
+        a = Scalar()
+        b = 1.0
+        a.assign(b)
+        a.apply("add")
+        self.assertAlmostEqual(a.getval(),
+                               b*MPI.size(a.mpi_comm()))
+
+if __name__ == "__main__":
+
+    # Turn off DOLFIN output
+    set_log_active(False)
+
+    print ""
+    print "Testing DOLFIN Scalar classes"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/la/python/Vector.py b/test/unit/la/python/Vector.py
new file mode 100644
index 0000000..e71793a
--- /dev/null
+++ b/test/unit/la/python/Vector.py
@@ -0,0 +1,384 @@
+"""Unit tests for the Vector interface"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Anders Logg 2011
+#
+# First added:  2011-03-01
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+class AbstractBaseTest(object):
+    count = 0
+    backend = "default"
+    def setUp(self):
+        if self.backend != "default":
+            parameters.linear_algebra_backend = self.backend
+        type(self).count += 1
+        if type(self).count == 1:
+            # Only print this message once per class instance
+            print "\nRunning:",type(self).__name__
+
+    def assemble_vectors(self):
+        mesh = UnitSquareMesh(7, 4)
+
+        V = FunctionSpace(mesh, "Lagrange", 2)
+        W = FunctionSpace(mesh, "Lagrange", 1)
+
+        v = TestFunction(V)
+        t = TestFunction(W)
+
+        return assemble(v*dx), assemble(t*dx)
+
+    def test_create_empty_vector(self):
+        v0 = Vector()
+        info(v0)
+        info(v0, True)
+        self.assertEqual(v0.size(), 0)
+
+    def test_create_vector(self):
+        n = 301
+        v1 = Vector(mpi_comm_world(), n)
+        self.assertEqual(v1.size(), n)
+
+    def test_copy_vector(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v1 = Vector(v0)
+        self.assertEqual(v0.size(), n)
+        del v0
+        self.assertEqual(v1.size(), n)
+
+    def test_assign_and_copy_vector(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = 1.0
+        self.assertEqual(v0.sum(), n)
+        v1 = Vector(v0)
+        del v0
+        self.assertEqual(v1.sum(), n)
+
+    def test_zero(self):
+        v0 = Vector(mpi_comm_world(), 301)
+        v0.zero()
+        self.assertEqual(v0.sum(), 0.0)
+
+    def test_apply(self):
+        v0 = Vector(mpi_comm_world(), 301)
+        v0.apply("insert")
+        v0.apply("add")
+
+    def test_str(self):
+        v0 = Vector(mpi_comm_world(), 13)
+        tmp = v0.str(False)
+        tmp = v0.str(True)
+
+    def test_init_range(self):
+        n = 301
+        local_range = MPI.local_range(mpi_comm_world(), n)
+        v0 = Vector()
+        v0.init(mpi_comm_world(), local_range)
+        self.assertEqual(v0.local_range(), local_range)
+
+    def test_size(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), 301)
+        self.assertEqual(v0.size(), n)
+
+    def test_local_size(self):
+        n = 301
+        local_range = MPI.local_range(mpi_comm_world(), n)
+        v0 = Vector()
+        v0.init(mpi_comm_world(), local_range)
+        self.assertEqual(v0.local_size(), local_range[1] - local_range[0])
+
+    def test_owns_index(self):
+        m, n = 301, 25
+        v0 = Vector(mpi_comm_world(), m)
+        local_range = v0.local_range()
+        in_range = local_range[0] <= n < local_range[1]
+        self.assertEqual(v0.owns_index(n), in_range)
+
+    #def test_set(self):
+
+    #def test_add(self):
+
+    def test_get_local(self):
+        from numpy import empty
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        data = v0.get_local()
+
+    def test_set_local(self):
+        from numpy import zeros
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        data = zeros((v0.local_size()), dtype='d')
+        v0.set_local(data)
+        data = zeros((v0.local_size()*2), dtype='d')
+
+    def test_add_local(self):
+        from numpy import zeros
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        data = zeros((v0.local_size()), dtype='d')
+        v0.add_local(data)
+        data = zeros((v0.local_size()*2), dtype='d')
+        self.assertRaises(TypeError, v0.add_local, data[::2])
+
+    #def test_gather(self):
+
+    def test_axpy(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = 1.0
+        v1 = Vector(v0)
+        v0.axpy(2.0, v1)
+        self.assertEqual(v0.sum(), 2*n + n)
+
+    def test_abs(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = -1.0
+        v0.abs()
+        self.assertEqual(v0.sum(), n)
+
+    def test_inner(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = 2.0
+        v1 = Vector(mpi_comm_world(), n)
+        v1[:] = 3.0
+        self.assertEqual(v0.inner(v1), 6*n)
+
+    def test_norm(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = -2.0
+        self.assertEqual(v0.norm("l1"), 2.0*n)
+        self.assertEqual(v0.norm("l2"), sqrt(4.0*n))
+        self.assertEqual(v0.norm("linf"), 2.0)
+
+    def test_min(self):
+        v0 = Vector(mpi_comm_world(), 301)
+        v0[:] = 2.0
+        self.assertEqual(v0.min(), 2.0)
+
+    def test_max(self):
+        v0 = Vector(mpi_comm_world(),301)
+        v0[:] = -2.0
+        self.assertEqual(v0.max(), -2.0)
+
+    def test_sum(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = -2.0
+        self.assertEqual(v0.sum(), -2.0*n)
+
+    def test_sum_entries(self):
+        from numpy import zeros
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = -2.0
+        entries = zeros(5, dtype='uintp')
+        self.assertEqual(v0.sum(entries), -2.0)
+        entries[0] = 2
+        entries[1] = 1
+        entries[2] = 236
+        entries[3] = 123
+        entries[4] = 97
+        self.assertEqual(v0.sum(entries), -2.0*5)
+
+    def test_scalar_mult(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = -1.0
+        v0 *= 2.0
+        self.assertEqual(v0.sum(), -2.0*n)
+
+    def test_vector_element_mult(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v1 = Vector(mpi_comm_world(), n)
+        v0[:] = -2.0
+        v1[:] =  3.0
+        v0 *= v1
+        self.assertEqual(v0.sum(), -6.0*n)
+
+    def test_scalar_divide(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v0[:] = -1.0
+        v0 /= -2.0
+        self.assertEqual(v0.sum(), 0.5*n)
+
+    def test_vector_add(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v1 = Vector(mpi_comm_world(), n)
+        v0[:] = -1.0
+        v1[:] =  2.0
+        v0 += v1
+        self.assertEqual(v0.sum(), n)
+
+    def test_scalar_add(self):
+        #if self.backend == "Epetra":
+        #    return
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v1 = Vector(mpi_comm_world(), n)
+        v0[:] = -1.0
+        v0 += 2.0
+        self.assertEqual(v0.sum(), n)
+        v0 -= 2.0
+        self.assertEqual(v0.sum(), -n)
+        v0 = v0 + 3.0
+        self.assertEqual(v0.sum(), 2*n)
+        v0 = v0 - 1.0
+        self.assertEqual(v0.sum(), n)
+
+    def test_vector_subtract(self):
+        n = 301
+        v0 = Vector(mpi_comm_world(), n)
+        v1 = Vector(mpi_comm_world(), n)
+        v0[:] = -1.0
+        v1[:] =  2.0
+        v0 -= v1
+        self.assertEqual(v0.sum(), -3.0*n)
+
+    def test_vector_assignment(self):
+        m, n = 301, 345
+        v0 = Vector(mpi_comm_world(), m)
+        v1 = Vector(mpi_comm_world(), n)
+        v0[:] = -1.0
+        v1[:] =  2.0
+        v0 = v1
+        self.assertEqual(v0.sum(), 2.0*n)
+
+    def test_vector_assignment_length(self):
+        # Test that assigning vectors of different lengths fails
+        m, n = 301, 345
+        v0 = Vector(mpi_comm_world(), m)
+        v1 = Vector(mpi_comm_world(), n)
+        def wrong_assignment(v0, v1):
+            v0[:] = v1
+        self.assertRaises(RuntimeError, wrong_assignment, v0, v1)
+
+    def test_vector_assignment_length(self):
+        # Test that assigning with diffrent parallel layouts fails
+        if MPI.size(mpi_comm_world()) > 1:
+            m = 301
+            local_range0 = MPI.local_range(mpi_comm_world(), m)
+            print "local range", local_range0[0], local_range0[1]
+
+            # Shift parallel partitiong but preserve global size
+            if MPI.rank(mpi_comm_world()) == 0:
+                local_range1 = (local_range0[0], local_range0[1] + 1)
+            elif MPI.rank(mpi_comm_world()) == MPI.size(mpi_comm_world()) - 1:
+                local_range1 = (local_range0[0] + 1, local_range0[1])
+            else:
+                local_range1 = (local_range0[0] + 1, local_range0[1] + 1)
+
+            v0 = Vector()
+            v0.init(mpi_comm_world(), local_range0)
+            v1 = Vector()
+            v1.init(mpi_comm_world(), local_range1)
+            self.assertEqual(v0.size(), v1.size())
+
+            def wrong_assignment(v0, v1):
+                v0[:] = v1
+                self.assertRaises(RuntimeError, wrong_assignment, v0, v1)
+
+
+# A DataTester class that test the acces of the raw data through pointers
+# This is only available for uBLAS backend
+class DataTester:
+    def test_vector_data(self):
+        # Test for ordinary Vector
+        v = Vector(mpi_comm_world(), 301)
+        array = v.array()
+        data = v.data()
+        self.assertTrue((data == array).all())
+
+        # Test none writeable of a shallow copy of the data
+        data = v.data(False)
+        def write_data(data):
+            data[0] = 1
+        self.assertRaises(StandardError, write_data, data)
+
+        # Test for as_backend_typeed Vector
+        v = as_backend_type(v)
+        data = v.data()
+        self.assertTrue((data==array).all())
+
+class DataNotWorkingTester:
+    def test_vector_data(self):
+        v = Vector(mpi_comm_world(), 301)
+        self.assertRaises(RuntimeError, v.data)
+
+        v = as_backend_type(v)
+        def no_attribute():
+            v.data()
+        self.assertRaises(AttributeError,no_attribute)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class uBLASSparseTester(DataTester, AbstractBaseTest, unittest.TestCase):
+    backend     = "uBLAS"
+    sub_backend = "Sparse"
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class uBLASDenseTester(DataTester, AbstractBaseTest, unittest.TestCase):
+    backend     = "uBLAS"
+    sub_backend = "Dense"
+
+if has_linear_algebra_backend("PETScCusp"):
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    class PETScCuspTester(DataNotWorkingTester, AbstractBaseTest, unittest.TestCase):
+        backend    = "PETScCusp"
+
+if has_linear_algebra_backend("PETSc"):
+    class PETScTester(DataNotWorkingTester, AbstractBaseTest, \
+                      unittest.TestCase):
+        backend    = "PETSc"
+
+if has_linear_algebra_backend("Epetra"):
+    class EpetraTester(DataNotWorkingTester, AbstractBaseTest, \
+                       unittest.TestCase):
+        backend    = "Epetra"
+
+# If we have PETSc or Epetra STL Vector gets typedefed to one of these and
+# data test will not work. If none of these backends are available
+# STLVector defaults to uBLASVEctor, which data will work
+if has_linear_algebra_backend("Epetra") or has_linear_algebra_backend("PETSc"):
+    class STLTester(DataNotWorkingTester, AbstractBaseTest, unittest.TestCase):
+        backend    = "STL"
+else:
+    class STLTester(AbstractBaseTest, unittest.TestCase):
+        backend    = "STL"
+
+if __name__ == "__main__":
+
+    # Turn off DOLFIN output
+    set_log_active(False)
+
+    print ""
+    print "Testing DOLFIN Vector classes"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/la/python/solve.py b/test/unit/la/python/solve.py
new file mode 100644
index 0000000..098c5c1
--- /dev/null
+++ b/test/unit/la/python/solve.py
@@ -0,0 +1,54 @@
+"""Unit tests for the solve interface"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-12-21
+# Last changed:se
+
+import unittest
+from dolfin import *
+
+class solveTest(unittest.TestCase):
+
+    def test_normalize_average(self):
+        size = 200
+        value = 2.0
+        x = Vector(mpi_comm_world(), size)
+        x[:] = value
+        factor =normalize(x, "average")
+        self.assertEqual(factor, value)
+        self.assertEqual(x.sum(), 0.0)
+
+    def test_normalize_l2(self):
+        size = 200
+        value = 2.0
+        x = Vector(mpi_comm_world(), size)
+        x[:] = value
+        factor = normalize(x, "l2")
+        self.assertAlmostEqual(factor, sqrt(size*value*value))
+        self.assertAlmostEqual(x.norm("l2"), 1.0)
+
+if __name__ == "__main__":
+
+    # Turn off DOLFIN output
+    set_log_active(False)
+
+    print ""
+    print "Testing DOLFIN la/solve interface"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/la/python/test.py b/test/unit/la/python/test.py
new file mode 100644
index 0000000..d50a738
--- /dev/null
+++ b/test/unit/la/python/test.py
@@ -0,0 +1,372 @@
+"""Unit tests for the linear algebra interface"""
+
+# Copyright (C) 2008 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2008-09-30
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+import sys
+
+mesh = UnitSquareMesh(3, 3)
+
+class AbstractBaseTest(object):
+    count = 0
+    def setUp(self):
+        if self.backend != "default":
+            parameters.linear_algebra_backend = self.backend
+        type(self).count += 1
+        if type(self).count == 1:
+            # Only print this message once per class instance
+            print "\nRunning:",type(self).__name__
+
+    def assemble_matrices(self, use_backend=False):
+        " Assemble a pair of matrices, one (square) MxM and one MxN"
+
+        V = FunctionSpace(mesh, "Lagrange", 2)
+        W = FunctionSpace(mesh, "Lagrange", 1)
+
+        v = TestFunction(V)
+        u = TrialFunction(V)
+        s = TrialFunction(W)
+
+        # Forms
+        a = dot(grad(u),grad(v))*dx
+        b = v*s*dx
+
+        if use_backend:
+            if self.backend == "uBLAS":
+                backend = getattr(cpp, self.backend+self.sub_backend+'Factory').instance()
+            else:
+                backend = getattr(cpp, self.backend+'Factory').instance()
+            return assemble(a, backend=backend), assemble(b, backend=backend)
+        else:
+            return assemble(a), assemble(b)
+
+    def assemble_vectors(self):
+        V = FunctionSpace(mesh, "Lagrange", 2)
+        W = FunctionSpace(mesh, "Lagrange", 1)
+
+        v = TestFunction(V)
+        t = TestFunction(W)
+
+        return assemble(v*dx), assemble(t*dx)
+
+    def test_vector(self):
+        from numpy import ndarray, linspace, array, fromiter
+        from numpy import int,int0,int16,int32,int64
+        from numpy import uint,uint0,uint16,uint32,uint64
+        v, w = self.assemble_vectors()
+
+        # Get local ownership range (relevant for parallel vectors)
+        n0, n1 = v.local_range()
+        distributed = True
+        if (n1 - n0) == v.size():
+            distributed = False
+
+        # Test set and access with different integers
+        ind = 2
+        for t in [int,int16,int32,int64,uint,uint0,uint16,uint32,uint64,int0,long]:
+            v[t(ind)] = 2.0
+            if v.owns_index(t(ind)): self.assertAlmostEqual(v[t(ind)], 2.0)
+
+        A = v.copy()
+        B = as_backend_type(v.copy())
+        if A.owns_index(5): self.assertAlmostEqual(A[5], B[5])
+
+        B *= 0.5
+        A *= 2
+        if A.owns_index(5): self.assertAlmostEqual(A[5], 4*B[5])
+
+        B /= 2
+        A /= 0.5
+        if A.owns_index(5): self.assertAlmostEqual(A[5], 16*B[5])
+
+        if n0 <= 5 and 5 < n1:
+            val1 = A[5]
+            val2 = B[5]
+        A += B
+        if A.owns_index(5): self.assertAlmostEqual(A[5], val1+val2)
+
+        A -= B
+        if A.owns_index(5): self.assertAlmostEqual(A[5], val1)
+
+        C = 16*B
+        if A.owns_index(5): self.assertAlmostEqual(A[5],C[5])
+
+        D = (C + B)*5
+        if A.owns_index(5): self.assertAlmostEqual(D[5], (val1+val2)*5)
+
+        F = (A-B)/4
+        if A.owns_index(5): self.assertAlmostEqual(F[5], (val1-val2)/4)
+
+        A.axpy(100,B)
+        if A.owns_index(5): self.assertAlmostEqual(A[5], val1+val2*100)
+
+        A2 = A.array()
+        self.assertTrue(isinstance(A2,ndarray))
+        self.assertEqual(A2.shape, (n1 - n0,))
+        if A.owns_index(5): self.assertAlmostEqual(A2[5], A[5])
+        self.assertAlmostEqual(MPI.sum(A.mpi_comm(), A2.sum()), A.sum())
+
+        B2 = B.array()
+        # TODO: test strides in parallel also
+        if not distributed:
+            A[1:16:2] = B[1:16:2]
+            A2[1:16:2] = B2[1:16:2]
+            self.assertAlmostEqual(A2[1], A[1])
+
+        ind = [1,3,6,9,15,20,24,28,32,40,50,60,70,100000]
+
+        # Extract owned indices
+        ind = [i for i in ind if v.owns_index(i)]
+        ind1 = array(ind, 'i')
+        ind2 = array(ind, 'I')
+
+        # Build indices with local numbering (for indexing arrays)
+        ind0 = [i-n0 for i in ind]
+        ind3 = list(array(ind0,'I'))
+
+        if len(ind2)>0:
+          A[ind2] = ind2
+        else:
+          A.apply('insert') # workaround to issue 54
+        A2[ind3] = ind2
+
+        G  = A[ind]
+        G1 = A[ind1]
+        G2 = A2[ind0]
+
+        G3 = A[A > 1]
+        G4 = A2[A2 > 1]
+
+        if not distributed:
+            A3 = fromiter(A, "d")
+
+        if A.owns_index(15):
+            a = A[15]
+        b = 1.e10
+
+        self.assertAlmostEqual(G1.sum(), G.sum())
+        self.assertAlmostEqual(G2.sum(), G.sum())
+        self.assertEqual(len(G3), len(G4))
+        self.assertAlmostEqual(G3.sum(), G4.sum())
+        if A.owns_index(len(A)-1): self.assertEqual(A[-1], A[len(A)-1])
+        if A.owns_index(0): self.assertEqual(A[-len(A)], A[0])
+        self.assertEqual(len(ind),len(G))
+        self.assertTrue(all(val==G[i] for i, val in enumerate(G)))
+        self.assertTrue((G==G1).all())
+        self.assertTrue((G<=G1).all())
+        self.assertTrue((G>=G1).all())
+        self.assertFalse((G<G1).any())
+        self.assertFalse((G>G1).any())
+        if A.owns_index(15): self.assertTrue(a in A)
+        self.assertTrue(b not in A)
+        if not distributed:
+            self.assertTrue((A3==A2).all())
+
+        # operator== returns array of global size with Falses at
+        # not-owned items
+        X = A==A
+        for i in range(len(X)):  # gather X, because of issue 54
+            X[i] = MPI.max(A.mpi_comm(), float(X[i]))
+        A[:] = X
+        self.assertTrue(A.sum()==len(A))
+
+        if not distributed: # issue 54
+            A[:] = A2
+            self.assertTrue((A==A2).all())
+
+        H  = A.copy()
+        H._assign(0.0)
+        H[ind] = G
+
+        C[:] = 2
+        D._assign(2)
+        if C.owns_index(0): self.assertAlmostEqual(C[0], 2)
+        if C.owns_index(len(A)-1): self.assertAlmostEqual(C[-1], 2)
+        self.assertAlmostEqual(C.sum(), D.sum())
+
+        C[ind] = 3
+        self.assertAlmostEqual(C[ind].sum(), 3*len(ind))
+
+        def wrong_index(ind):
+            A[ind]
+
+        self.assertRaises(RuntimeError, wrong_index, (-len(A)-1))
+        self.assertRaises(RuntimeError, wrong_index, (len(A)+1))
+        self.assertRaises(TypeError, wrong_index, ("jada"))
+        self.assertRaises(TypeError, wrong_index, (.5))
+        self.assertRaises(RuntimeError, wrong_index, ([-len(A)-1, 2]))
+        self.assertRaises(RuntimeError, wrong_index, ([len(A), 2]))
+
+        def wrong_dim(ind0, ind1):
+            A[ind0] = B[ind1]
+
+        self.assertRaises(RuntimeError, wrong_dim, [0,2], [0,2,4])
+        self.assertRaises(RuntimeError, wrong_dim, [0,2], slice(0,4,1))
+        #self.assertRaises(TypeError, wrong_dim, 0, slice(0,4,1))
+
+        # Tests bailout for these choices
+        if self.backend == "uBLAS" and sys.version_info[0]==2 and \
+               sys.version_info[1]==6:
+            return
+
+        A2 = A.array()
+        A *= B
+        A2 *= B2
+        I = A*B
+        I2 = A2*B2
+        self.assertAlmostEqual(A.sum(), MPI.sum(A.mpi_comm(), A2.sum()))
+        self.assertAlmostEqual(I.sum(), MPI.sum(A.mpi_comm(), I2.sum()))
+
+        def wrong_assign(A, ind):
+            A[ind[::2]] = ind[::2]
+
+        if len(ind[::2]) > 1:
+            self.assertRaises(RuntimeError, wrong_assign, A, ind2)
+
+
+    def test_matrix_vector(self, use_backend=False):
+        from numpy import dot, absolute
+
+        # Tests bailout for this choice
+        if self.backend == "uBLAS" and not use_backend:
+            return
+
+        A,B = self.assemble_matrices(use_backend)
+        v,w = self.assemble_vectors()
+
+        # Get local ownership range (relevant for parallel vectors)
+        n0, n1 = v.local_range()
+        distributed = True
+        if (n1 - n0) == v.size():
+            distributed = False
+
+        # Reference values
+        v_norm  = 0.181443684651
+        w_norm  = 0.278394377377
+        A_norm  = 31.947874212
+        B_norm  = 0.11052313564
+        Av_norm = 0.575896483442
+        Bw_norm = 0.0149136743079
+        Cv_norm = 0.00951459156865
+
+        self.assertAlmostEqual(v.norm('l2'), v_norm)
+        self.assertAlmostEqual(w.norm('l2'), w_norm)
+        self.assertAlmostEqual(A.norm('frobenius'), A_norm)
+        self.assertAlmostEqual(B.norm('frobenius'), B_norm)
+
+        u = A*v
+
+        self.assertTrue(isinstance(u, type(v)))
+        self.assertEqual(len(u), len(v))
+
+        # Test basic square matrix multiply results
+
+        self.assertAlmostEqual(v.norm('l2'), v_norm)
+        self.assertAlmostEqual(u.norm('l2'), Av_norm)
+
+        # Test rectangular matrix multiply results
+
+        self.assertAlmostEqual((B*w).norm('l2'), Bw_norm)
+
+        # Test transpose multiply (rectangular)
+
+        x = Vector()
+        if self.backend == 'uBLAS':
+            self.assertRaises(RuntimeError, B.transpmult, v, x)
+        else:
+            B.transpmult(v, x)
+            self.assertAlmostEqual(x.norm('l2'), Cv_norm)
+
+        # Miscellaneous tests
+
+        u2 = 2*u - A*v
+        if u2.owns_index(4): self.assertAlmostEqual(u2[4], u[4])
+
+        u3 = 2*u + -1.0*(A*v)
+        if u3.owns_index(4): self.assertAlmostEqual(u3[4], u[4])
+
+        if not distributed:
+            v_numpy = v.array()
+            A_numpy = A.array()
+
+            u_numpy = dot(A_numpy,v_numpy)
+            u_numpy2 = A*v_numpy
+
+            self.assertTrue(absolute(u.array() - u_numpy).sum() \
+                            < DOLFIN_EPS*len(v))
+            self.assertTrue(absolute(u_numpy2 - u_numpy).sum() \
+                            < DOLFIN_EPS*len(v))
+
+    def test_matrix_vector_with_backend(self):
+        self.test_matrix_vector(True)
+
+class DataNotWorkingTester:
+    def test_matrix_data(self):
+        A,B = self.assemble_matrices()
+        self.assertRaises(RuntimeError, A.data)
+
+        A = as_backend_type(A)
+        self.assertRaises(RuntimeError, A.data)
+
+    def test_vector_data(self):
+        v,w = self.assemble_vectors()
+        self.assertRaises(RuntimeError, v.data)
+
+        v = as_backend_type(v)
+        def no_attribute():
+            v.data()
+        self.assertRaises(AttributeError,no_attribute)
+
+if has_linear_algebra_backend("PETSc"):
+    class PETScTester(DataNotWorkingTester, AbstractBaseTest, \
+                      unittest.TestCase):
+        backend    = "PETSc"
+
+if has_linear_algebra_backend("Epetra"):
+    class EpetraTester(DataNotWorkingTester, AbstractBaseTest, \
+                       unittest.TestCase):
+        backend    = "Epetra"
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel)")
+class uBLASSparseTester(AbstractBaseTest, unittest.TestCase):
+    backend     = "uBLAS"
+    sub_backend = "Sparse"
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel)")
+class uBLASDenseTester(AbstractBaseTest, unittest.TestCase):
+    backend     = "uBLAS"
+    sub_backend = "Dense"
+
+if has_linear_algebra_backend("PETScCusp"):
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel)")
+    class PETScCuspTester(DataNotWorkingTester, AbstractBaseTest, unittest.TestCase):
+        backend    = "PETScCusp"
+
+if __name__ == "__main__":
+
+    # Turn off DOLFIN output
+    #set_log_active(False);
+
+    print ""
+    print "Testing basic PyDOLFIN linear algebra operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/math/python/test.py b/test/unit/math/python/test.py
new file mode 100644
index 0000000..b36fbd0
--- /dev/null
+++ b/test/unit/math/python/test.py
@@ -0,0 +1,98 @@
+"""Unit tests for basic math functions"""
+
+# Copyright (C) 2011 Martin Alnaes
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Garth N. Wells, 2011
+#
+# First added:  2011-07-108
+# Last changed:
+
+import unittest
+import numpy
+from dolfin import *
+
+class DirichletBCTest(unittest.TestCase):
+
+    def test_near(self):
+        eps = DOLFIN_EPS
+        # Loop over magnitudes
+        for i in range(100):
+            # Loop over base values
+            for j in range(1, 10):
+                # Compute a value v and some values close to it
+                v = j*10**(i-13)
+                #print "number:", v
+                vm = v - eps
+                vp = v + eps
+                #vm = v - v*eps # Scaling eps does not work
+                #vp = v + v*eps
+
+                # Check that we return True when we should by definition:
+                self.assertTrue(near(v, v))
+                self.assertTrue(near(vm, vm))
+                self.assertTrue(near(vp, vp))
+                #self.assertTrue(near(v, vm)) # Can fail
+                #self.assertTrue(near(v, vp))
+                if not near(v, vm):
+                    print "not near vm: %r, %r" % (v, vm)
+                if not near(v, vp):
+                    print "not near vp: %r, %r" % (v, vp)
+
+                # vm and vp can round off to v, make some small values != v
+                # that are close to 1 (except for some of the smallest v's)
+                v2m = v * (1.0 - 2*eps) - 2*eps
+                v2p = v * (1.0 + 2*eps) + 2*eps
+                self.assertTrue(v/v2m > 1.0)
+                self.assertTrue(v/v2p < 1.0)
+
+                # Check that we can fail for fairly close values
+                self.assertFalse(near(v, v2m))
+                self.assertFalse(near(v, v2p))
+
+    def test_between(self):
+        eps = DOLFIN_EPS
+        # Loop over magnitudes
+        for i in range(100):
+            # Loop over base values
+            for j in range(1, 10):
+                # Compute a value v and some values close to it
+                v = j*10**(i - 15)
+                vm = v - eps
+                vp = v + eps
+
+                # Check that we return True when we should by definition:
+                self.assertTrue(between(v, (vm, vp)))
+
+                # vm and vp can round off to v, make some small values != v
+                v2m = v * (1.0 - 2*eps) - 2*eps
+                v2p = v * (1.0 + 2*eps) + 2*eps
+
+                # Close to 1 except for some of the smallest v's:
+                self.assertTrue(v/v2m > 1.0)
+                self.assertTrue(v/v2p < 1.0)
+                self.assertTrue(between(v, (v2m, v2p)))
+
+                # Check that we can fail for fairly close values
+                self.assertFalse(between(v, (v2p, v2m)))
+
+
+if __name__ == "__main__":
+    print ""
+    print "Testing basic DOLFIN maths operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/mesh/boxes.xml.gz b/test/unit/mesh/boxes.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..805421d6a5c163d8e928b382dcfe5337b9e1189f
GIT binary patch
literal 16611
zcmaia1yEc~w=ED{LIMO5Jh&4exD#B1y9IZ5_u%gC!QI{6gS$Hf2s#YBL-PG{?|W6R
zYS)~WEo-mt-F<3i2twiEx6|LtLcIEB<!oR_=WJmPQI@_wP0|p)d%jPJ;Xz--82fB1
zaLE<Y^YOOSEtiy?CS32NP}@V1i=29h2CB5C-MVpAN`VX=n*R~vSJ3mrdS-{`)x^Z}
z-RVe0$K##J{n^c7$J1{D-pA|tif8a{qSez~i?%0dVt~N&@pr?z*E7h=^BL^r^|U)8
z(*Xt(bUdw3@PeOKE1vIoGXcYO_p6?XOfS$fE3e1X!}YBf7<?6(>G}K!;(fYonD7D*
zRCKsM>{V!cK3&W>K0A3mj_`V(-qHiwr>X1hkDy4eCd;BHDR9fgGiWSP`|07{%j?k|
z^m~lpxoypIef8}5{`XkNxYy%tWM;d^)733KG_A64yNAfMYhtfgGcBs@NV`|V^F?MY
zNXP<J_I>kd;k-nswj5jATKgId|5@1zjLS}MOBzRI-sxwlk%U#>X_o|Bj)`gPm6%J_
z>AKg>(D6Z81H2kHSFhp^GEczbiECenf^3zUsS4+p$lAfx8sn26=V^_B^lmBdvB=C-
zAGOUFGmKm#_v@6j$4DtO%IjuQn|68&lOyhH*^XQtg2f8&?<Y6Cm^q%#jf9*j$ulv2
zv@2fmy=K_u;w-8XOjV!stp8%tF)b8i;I4FV>~QpE+V~1Bv;BU{Bj3S8iC-o2o^`3b
z{bvI?jJ+s=%oS9Ro$JT>c69oad9e^HkSm1^_@_gmvlVe^g3JALC3^YpZ~@&p*KEGS
z(+!^N@|VoS8ZsX00(CjXBMv5pR*RE{Yg-pSTQzb)i^LK93Y=;GAJ%o!#aLBVmU!!1
z`2l5-wWTH6(={oHF?3RO5?^z7Ni{fL)5+2!-z;jikenu}Ri-J<?6PGzw5koWuGCs9
z*-*?p(gf6C$-&gsgKD$1Lzbk^%;}7r>WgC~rd7Kb*2Aw3VlZT4%E?zqDKt4m((fIH
zOw&%V&YC3@F4)l93r!zmY)!nmW42UBw9|++V-jlE8!>ldes2-p_wR=;?;?1A34PA)
zzQ5MVSxYItGxxncorZ3K&M)b^wa`0tpNOkaB0&DN<&|eE_oFs#=MKeXrNZOKeUDhP
z=AA=0Y~#&ktuy`*xheOU9NTg;)ezIFNy}v~_SNy5tCQ~)iJWoACK-{jBc29v8pBD`
zE+ZQ2^>LJ$B$_zlK}n1(VkOGsJaOpY7O{2|B8U=gpGykiYU!k<*4I*HApPWqk+yK#
z;a=i^{dj^N(36~J{eq@Danm|2cc#J@7cZotdsVsPKADAMjd9_!aCpg+<tB#3GQXn;
z`?%%V`kO!r)$y*=nZuC|;}O@U5qza_Fx!3>g7n7BvL`|!93=88c+HKSfLdakukl?=
z9?v(<4*A5ID$9nWU~k9VpADC|=qXV(+AagvexzQbULD*Oa~!<uECo}f#xC_=)UP(l
zU!Q|qH!;%p2C#mumwz*q@v=ukR7T#ygSN5dr@JN0O#A#b+o5}QnVvh!k<(6$N_lCa
z|D0>Yvt#bqNszW-*(E2XaXG9>%W^(DhLz=H*YQwy0;D=}nzt23%5`dEDK_>N&2giZ
z;9jtAq{s0J(j!NjM@*C96zxWASXu2lLOlNI{l$2)W7BEk%;yd}`jOd>)#Iw8Pm8cI
zTyEZDBljd_iN|NZEqVCWy>3!@A81F07RyEIW6MEN>OwJNW@GrqiTPFQ^Fa=gS=nI6
zOv1!n)uM{|5)tu|DXfg}FQXjxqL1{7$@*p>8S#U+H8-g@4TVm&MH|hUN!2y-+p$+)
zcfVq}p*f0F4*jr-h?ilhr)j_Xni%-7+#twZ%aKuAg;IV`qBvGwlW_$y^lH(hL;Ft0
z<SF=y;`p-Syv33!X0D`8E|XI7<m0lVfywsa;2ygD^i`#1ig{*UO-j&+pSR33QVU+e
zms|-XiW2PJSlb7Z^x9VT_3_pf)qxQctJLItYg>^eJx)xC-=f$V6eTQ8(CM=vCAzh-
zTfzOPn_csk9e)Y9qPjLZ+3*&R)20>@(jeANw*s5WygPzJ^X>|ncshR25WI%OC42~d
zM4ax^NLyCSd+f)F+6=97Zn*JL`G6Rigy-&)X6S$t(%aL;&U<`Htupq7l^w4fd&amC
zu~GlS^3T-{sojrNd6$DV^iEHY?Wde)5h9nt#e$bZ!3WZ88AIh<mnUxNDCHu<L$|N7
z1T-ct-M^c6TQY^H@bA==+!T0}(xAnZpXQ24W8)B8eRmggp`b8&)=!iW8zBEZ{2@@p
z*Q@->Lf-&9Fx0AXYVxK=hHLVn^~lb1op+dAZ#95<MVmJhYDMa4&B72gSZF^#XQusl
z^Xl{E$z1)!PK-Uv{POj(3v_%59_=V+^gZq-4?+E-S$)i)V-WXf+O5kl`&U~sF?4lL
zb{ibFCpO1>)+1X4%dJwS#8BunR+hu*g`+Dv?zfOsM)B<d`)_`azS>2~e6MYm8fB-d
zW>+7|1CWTE4l|balRAWJ;<t&fJC7u3v{cy1VWg*6VF<L~a|-i$?C%r*m90Mfoj7zY
zvnj@Hrn5vI(VEPA5@sz?2kefqP3XnkFK8=KHFOTD4EWU5+MGnrRJQ69dToPYYU71)
zkyV;LB<iY)3Z)}`q{XfzGFJARk%l0cdG%O=chmPUW|n!!+4Y;C`w27ZD1Bv02TzK1
zh1ti`0Sy||OtZ49dhX->f!a1qzmwBg+@r7TB|kZ0;wlmt@SJXARIT>0)B2OW4O||s
z%)}Cz*`zjB6-R5*PMjC%%L-(s58tbLG}KVt@04N<OtCba9ztp(aWt*CaGp9$X*1Q(
z8AaGtw=)HI9NX4!8#H}|$jln?KNXI3oWR`;9cq^Z;nA@uh-=YDd+Z%+2iB)f5a2~Z
zf4;Ak(CSsynD7r7s)5odATG}x5*{OwoObwjHG|upP^%fpx^=T!Elh_t;aJVWGaPK;
zEpcynh$cJ7E2%G8_U@}vthT1W!u%0Sz;%nxA<Hm%=92|EJTGI~$>k&0hmcxNEGrR@
zB0Yj4ecQ!L4}HB_qZ3h>*dX$I+u*Q1uHPI1=ie6V>yVuWvk7;ikd@2MXYo_gWpI|K
z&&-2NTQU9NH-<=<V=B>tWPTo8UzQ3>cpmOO{Q?JNMbhD3PY|SYPDbm=G~^Nw$P=SJ
z9ua(da&g08dA2J`MtRma4!+D(=N|IlMXTZxboWo;5p)++I!EKl=_f!ttM{VN^$=|&
zPg~90(xW<K<l&nGQ|6HBmC&OR5b<CxX?72ox^wl7MZGEZ&*$kK2x$rZel2vCJ)8ag
z?oE~ATLO{97Jt-=M>^dGE#mYJkuIi{=K-bk@NECbs9!cbF7C3Uf}Li)I^QW2d%tw6
zWoG|OZY|V99yoV+oO2Ha<u<nW$z5M=*R1dBc1f5!2O9_faJ~0&J|o)t%|&yp+8a?(
zW!Uijbap=}N|xC!+tijrJUs%m#(;@dHF(sb!@+ZMzFm`o)JC;0!uI?{u;1Pv;+jQB
zzjZi7xeGfxaJfQmeAs3py=`PcslibJZ!8;3rx4kyW>`XXxNUUqSkkFaV*Kz8p~$p3
z4GRZ4iK)4K|KgCrbG2=o)jhiSy_2oGSFi^2Z_i#lr0l>sQZG~s?h~tCBjx}Fl(Dz4
zNtw`lOzQnsQj@l&4bY@xwOw<r>e+cn86>)G1~dug<7SF-qoQ4<!ZZorK6KR`8J9*z
z>v0lHr9_q$A82LmO`_6(KyR&Ra!rlJ$`Y`a>?B4Su50s892gx{?Cc~Kbwn=2i148p
z&kFaekc|&f0`&qe7O~F9YZYl}D|4MADx1karz>s`rS*8eyXx7ya_^i~X&SIhKv)@G
zgx<6C`%Jr0uZ>M08DQcLRexWMrBRA=vOo5Fsn~Jvfg7=Xz_)3o^!#nHt))YB?*j$`
z=k(Zg>DM~D5_uP|ifdU7Pp`mK=2*xz@|#?!Z8(t?E&c3bLw~K+JE23fB*tRPK#p_-
z!{h$L+WLLIt6+l!s5o>p2PUIhDkCt-g0$oNiCGMYSxM)Rw917djfC0Yh0Viq!Di|{
zT4+wL4kU-4=U0Lm(Z(&mI2J92h;LlkYO&NDYet3r3+7~Ei_6cQk!K>qtc4Qu(`Uo3
zv{=^jsi<V&t=S%VbV@@IQB-a2(kExWTeP<$rjfhiOfl+IQJD^gqqKI#r0$XPOMNjX
z|7>vXPxixPlk%0@a5zs|e!<~McpwLkr4@_pmwU3Wc7f=UC{n+L2^i}qRkp{f`w_5R
zHy4?RbfqcWWi#Z_W>+kH<j&f~ak6dP<BRjYq8f|%#K4ZMidGgZU_Q*`Ucb3_#I&)2
zU>4dC?O=7|UJdBOsLF8gGt~2$sY!;!Y|LT%L~Fgy^3YR&{KJ@oJ`U;>F=27=>lDO0
zl%(+9?HG0(MIoo=8&(y*QkI$U(fbpINrqcD<R*;?;n!!2KOUOeqjaz{eErZ87A;br
ze&iSLZ}vEVT4{UcWJa9h`#-eZ5f;GzAiv22)?uG{MklT~gR5fo7Y22LTkX%BPH)D~
z(M`lnD8|{Wi05WKu&LJHmT9i3ehI%-RI!|VJu1pTpwH{2+S_RJy&h#k%b`}MZ~Y*Q
z@u#JQxZA93zu|}JJR=KXr|g_p^wV4=CyHXA_Zht1El&IQz7y4Ybtij%3PKimje^W|
zae6^1_?tvr{kp-lpql-wxtoP)C1=#~HVZ2O=}6~`A(N`iSAoBkwD+oh&S7`D(O{WL
zpL1hsaUtYtC)D$14V49QBpeY=u=k^uxiad1tPLDx42TTh2z)i~i|2H<bM3r`gmv<1
zxIoMUcR#a!NJE>fB|XsX%6~s<t7`0CFC=o;F+hlHa5!9@hh?O-*40ogM<nic=oWsq
zpu2k6CJ`p@u*w+A9La1qp&hIXX`YkV{^_@`2t#@mOk>e?o_P0b-OwMyY7=|kt?+fx
zQ&R%^-8xkvsr&8mF|!JIqB7Y(6vRNXoUR%+OcO3;!pKguJaWG+)AUY-Z@gepzc_|t
zd4`ceI|$gYw&=&kgdjIn?L4~1xeMq-U{D^V{t4E)G8r^(Rd`_JjO%@D-;rj0Fi4sg
z%^dbjE-u?;W}+%+hvIt2h0xZ*_z_wQ!ZBqIWAO&OA^k}Rr~MofRx%a-*YBNQmpbqu
z4Rgg;Jp(2lPhl+(Je&R@U&mk5R^3up7bYro_8X4~2i5ucehOnr*Wk;l^t+9=0U`PE
z^<7m%dNfzSd=Z$PHBGNFth`DwVMN-P>5~pHFj{^yS*WxKhRn~;mjUzlX5&>B6RJ3@
z;#axIL&N`+7l1-#^5lhngLuWC)gXB5?=A4L{I&8sqn6c`$5-65{a#s$EM@OMVKkia
z4WuvWb|7qnz=i|F4e7t3;JiOze^n^3FT2?vGn$Er9AQhfSa@|x$vwM9wQMJ+SVve@
zqIZ828zo%#K?*4`%!QFtM*&M`V5{!c36crMZPNDO2s=Z^Cu;>?)%K|x-vOKx5g)O>
zyiOXK9c4&S24y{-RXxbat<BPBwt{*nQ52PWlMskJqPeyH9f}Mk3))3($wB{2F^T}m
zV3DtTaTdBFXrlR+Y#tS>y4_(HG@Wv6-NYk^O~j6C*qsV)G%4`KbQ^N3(S}0S^W(az
z-UW9apdD6F68z^`S3}Ro$~Te@d=H|uw)z;|jYN~9)(u|UB&i(Ty((@Zu&GU!-h~2+
z_bLXsUGL;aybIsA43zI1NdWhB2|k0>vNCCoZ?wo$FQS>gU3x&+(e-f>6{>iEwO!`Z
z5nG?1+!VIW^YwXp6Q?>JD1+0u4ML$0)33a?>?ZcBW;Aoa=k$0v^A;5~?JNg#a|c=l
zWi}R3b&i}`L)ZlYop(A>52IY_x?QDe?P))*_J%*!xVAwq%lnE#u%rfHyvguBor6$!
zfO*TMLn^<^Uk1_aGUqR^mnqg+x}mvg{X0(GXoAv&Pf@Y=f}n_zM+AT2Nc7f6+b;6s
z-9kT<^=v+(^dv+SHEu@<OqRT!%%C*)X^xU-e+z_0)v#Z|VEWe<Z}pF1iP=Qxx?E8u
z5QPQBgV1=84Mfcq!&;A_uNR8nF;rdos%;8&LPp0Lb_^ow&yM$neLpkrlb1E5Dylmz
z7gX}WhhXwd3Nlbq@KNhZ*HzfAcQJAxtufWeq5NR2%(>yumxGd~^tFV{&Al7DTu15G
z$Ab$-^~q91!s?uX)Z}&k74yB{uT;5Jqg<dHeAVjcqIt`!=tf51F5otlKb3?+3B+jC
z{Cf5Cs0bD&GN$Nq?sZkQq-icWRDjS^cH32XY3$M`S`YY9hNfST#Zs^I*>9v~vQ<^7
z`)&_yBDXy@U_T8xcp_;BSEPiA^I~XlI`%bQ2}+?X%u-ZzroHW^?oVIio1ngX7cuF5
z;n`RPrIl^y0MnX6v84i8LFbF8k8{&nZH{P|A|?lUE`K7zuhm%?>$Y2nbG$@FZE8)R
zy;fMtr~GPS@UfXsd1M%2bMZT8pr+dVkK^d(<MDYlgo^sBQli?b1#|)101R>(>>Y>o
zj{1+pwb<SExW?bNXS}uW+EFq|^~6u|;r#1nMGoDi)u-SqQ$9<0F|Hwc&(1z>^dvQr
zQ{T^q-y@Wg*%^tI^Qpl63Ray$Hcyhkf+&HE<*Hg@LUd;ifm>R7?eCz^HoC7?=B*;4
zLp(kZrYu()E{zZ#&B^Wx)5me}b~X6KiCjgl4+_=L;^b`R5iutIK&F?~pOEC&(aF&Q
z1$=dsKjLz;PDv$s0%544;raW#+|r}n{{3iyXJ(e->Q4b4th|h(bMUE4{cmYXs=}Y%
z4~WMo&J#w!e2wV~lP-_mi~r~XodsqXe@B5d#a55F@W_K8I#>PcvsBH__($!bYV1T`
ziG{GbQfSqI!@M%{YQ0cuzB!@r)(#6uRm@A)L)6Li1_F{agWpw<LCAYGF{MmeP)-v{
z&XqK5ohMuy<jB;znALm{NnGEMGst~JzVg2IM!?fqE`k`z`A%o9Hv%!_8x}fYHsZY>
z;&GP_4y2*}GCUO@G~jBt>1_~BguGV>Inqoa;zPT5dYdi6*WpVN;@tT=kH1D|SKcFL
z6s}5$Flm<jQ051<j?#8V&TdSyc)hPa<m;bU{H*VpbWKQmiQ-xg{B?L>N6K}^E46h6
z#?&sZe>4l|WS?t)Ya#JhiL=f6#JZu~RW&^_Oo_u-4x#FS!h@=It7sysD=m?l$6Mpw
zRXx}2;+U<huGm#g$KiyVtqgKVA?l*j*P}*M!CcFqXTH*es9riudMi5{4@rZGq<g_p
z%Jfw!eyX6?89%qAV=LN<=teL~s3CFHu`^rAt>@cYOzL{jh7|)d^yd;8^4r3PvK`e@
z3(iZ~M>=w(Dm9(12RjK>R>CsUU(n0xey74rS!$we->~5?!*N%=25TdvaE}vx)a}5Q
zrM(>E(+#X^aB88}3+U$7nS-p>w4NFDlKrJxD|~evZ$q`AAC>Acvx^zvmY~UTx|BBB
zVJNv$lB(`ebV7?Bz~n4?S2&GIsTCjvBQsBIU)qAN2F>YTRcmq==P>m?Ds7>jThR1(
z*J>%CEDNM)_>kYupW0datI^1kil^Lld#jDwiZpZAJe@X}Ai<@OI7Py98cZfsv06><
zAEz=dfX^LR>Wj`w`#3^Sn{K1WlQB<!^kb)KNl|zDmWCp;?=7k>&-F`tf9K^FSz!*t
z`Hm@AdC&JNRCHdZYsWt5`&w<i$#aGn?O01E+Q+M*D-w_@EO9wHWBplPU#)eATWu9~
z39E65_TUmcdj`ovz^@;DQfV33>B8!W{QQ|tl}#NCS(wdFM4fC?*G{jdUCmSWZ*2&y
zS>(!kM)fSg+`25@v?}Oa2x;@2kj#Rg$B%``p+Go(W)3DDOpKFXAgUns9T-TAT&JMb
z{VWao(iFVQ$dr6n=fmR7&EE{B`%<nxr9(*~mD3X+o%}K&vo+7QQIDjd5Uw=mMdd3|
zj{5L%my0wqxlu;!Mg~D4zUcDJR-rqN&zvl=u%(#tggXXd*?f6MI(Z9TzN+R9T>Rec
zo2ZWg;}B)`>VoFVZC2**zP}so34U&b&4_QZd7E0<*n`>4hZzZdm8Tm@pZm(6KH`=#
zJc{RV?PH$Fz+6zx>0>o5^Ubx2Ur>h;lF#_%&w=28Eu)#<YOa#m*kDTCeLmRS2V16=
zCVF+a>4hsQC@+Ex6dmdsO$_@4H)EDM6b+<ZI}s%Je$CM@G)+n!PEtu2*0i{C3zv8B
zqRW|$^wR>>IP9gTl~q9-LN&GtkV!QHjRB;Mw$u*$s}>^JN?5yB4S}l=4Vc1GYX?Cc
zRdS(tO-at<Ay7;g?!;?3GU2e#GAMkfLk3ivU*OFUEAQE~$TNiquOn`)*#zTi;8}{&
zokPG6lrhhggAETDW?prJ{TyXs6`?H7=;>jsM09)11ixZhsy;vwZRNz3;}wY@c0sZ_
zSo$Vuf}$Y%9jd}sYb{=FeH&u-t%NU6em9T9iOd*!e$aae`yS^l)^gZed`AAIQo4l&
z{a+5L#z7cL<_-xPgBo?TUD9o|AsB{cR~uJ>iKq(!H%M4QSdJ8!t<-v!k^L3FOHXeP
zOKJR0pJ0)3tg%u8YGGt<(<Ht?w=M=jJBkcAn%^QWM-0=t>-H9qUA|$7Di1($NUrL3
zZac(=?k>+I70M+4)+P&af^DdzB9HUE<w1kqD?l6K49XjRUvm=q19S}C7Kqi-0D(|*
z(iQ&}EKcCv{1weDjSS3O<x?42<SvOXQX{Rt45fp$ze90h&|L_oKpyH=Aqb}CiccAa
zU6@@)_riJX9QRYyj+WvJv$F7k%sV!Y8HntWgOi_M>i7F02mdsnb3gZ`SIKE>@J#5&
zUrAAF9u4=_`HfB6*{<n1i%%T2z&dJVIPB6>^)6SwqM+mQKE&wtQg14{?N_=K#cqYb
z!7=5J`y94hg9Lus;)*}Z>I5kuoqi1RH;IFI%zKS--YQv^jg3~b4I;Zje=8?eFFh9D
zcP5~qS*CA|=0;a(g2~KlVc*jVHh}kG{guMN?$~x+S~L1SeNt7+H6V*OlpcIFJWcy`
zkE7&Cx)?I6<lP0^HJd?aDPv5pUt5cr7~vj=?FJ}=v0%K$v80$<5_{rZgc$G}#|KTj
z6KD1M&%K^+@avP#7Y)cbwF)hc9)1q>@m7ey2?+P^9eU`%b;qwKT`&tbN^x3OmM20?
z=}IjGMRB)?ei>XHwM~N9=%dNV<;0cWI2kGv4_#{Psk}E6g)(b|UHW#eHBhIL^e#c$
zMq=H9Qqk^^=|<D81}vaxGo%199?|bMl(v-nox1*<sVb?f_5E_U%dxD)?y`7St7z%5
zU#0Mz`Hwg7tq+p8Ugr@I8?zbl@XUDVzUEM^NaEq5rDHP)##o$2H+H7<yb0D8>CKl{
z9C6Tvw1#1mRo3#yd`s~k?9(d9kUBL7P>`<l$ty#U)DJo1v3wfz9ZF4!>_70ezMe=E
zSn;WX*a+Z5TNoEa@95+xUt0r>5WK1w;o#uzXU*$m-%!qoY=ncTSi>_6>vRm_Z(S+|
z5r>aqL~FysFK`X8++=Bj-&H=5fFYLR*@%CAF#%qQp%>nLq4viTO_hCym=k&*EVCUH
z4Vi~DaHY_^U#T4^4LO8|NB7K+_5;bm<h&LF;Y3^|;M2l}RTTzbi|ZGU9k(Qb&X#69
zn;U{qv6jjGvf&M(K*J)719ddVTUO3T=B)BHrev2?C3Rgb@;Q9A`Qu{~DFcI#%7lcT
z+xDFT<>kK#5Up5J;6+HW+WPCw*KNd3Z4xn~aU9e5B0Jp)bjs@k7uVHDqin88v!8Z4
zA^PK6(yfRxdguJz<5<fxkxCCaA`Ujgv7k~c@N6?yPT+L;=f6O=Agn$T6qX%%!pXo0
zl#`t?OqCKr*j#fGG|1TPhl;Q(r$;}yfE(}xH)zSoAgQ=1Q<y)#wKw|$sW<D4k&q$;
zb<rpn+UGjzYGd@d_mvgGJymp~se=zXY~y*M`xiuKntA-0h9=V!k&i3~)v1pQgizKW
z@$jZ5i1Ak2vp%?o2H|EPCdKIwv(e3=O)C+FHbq3P6yR|3FuuX!6HT46?2jW>$8c0E
zW*QdmXa3>fAnG&hn0`%ub`UCY-suPm@StV?s_eJ&9Yt~n)2HcyvpHuuH<ISS)gn*o
zgP<l>0z~GWq4e=miprknrL}JALT*l|`Hy1~onr)5tm3Q!nXI>2$3*ZWrf)zNSrwAd
zM`wq>TT!-O(SG5gB2=<NhdJB=d86EK<6S^#3ShMi;?%!S34F6>of;veuc=ICV%XZF
z3HJ`6g(9y+>l1iFbS0pNKwYQFE`!(_%fOqVX}j=k<uTDm?uX3W3+?2k;|>@~D93A5
zMq-j>0drEy`5F#VJue30Cu%%mG3D6JP4e#y_9;sY7@*@oCHWRtI`y&F{j;jXUZLxQ
zIpwCWAVyWoj9PvZYBY+3GhnUd8nQr#LTF&UF%%HB#D_L&-@%%qI>I4JO76QXWR1YA
zLeS@?<-GObg0iUE$G9pc!%fXiE8&bJc!yh%;bW=0si?U6_TUqe0&&G+ci1oJ76!fL
zpNf@b<#kh|DeOz=^?2Zj&wK+|WZ@Q9-ee0N&}-lPYL?f=#Ti!-w#xX?A<(&n>nU2N
zD0Oc|9Wj|^!`(v{hw^#%l7gUq(UO>6h&=|Yy#;<D8*nu?oPY*d2yl{%q<5V?@${;T
z5HE~lC$(h}|C*bUttiuLEvfhjea5HBCxQ<(AK3)2IyOt&jlha+T~gBKEWXIX%W$F8
z;QFJ=FtR#{lX`@vdF+{_Q{Ca!PR3hfB*~UIob_wdiBBkq2Xk*lzS%&?ADlFpFxFK*
zMobpb`U+z%8xs_;mV74$Vese^`n|i-b*u~#`GDorQ4X2DZQ!UL;!(*P(xe0XKA*Rq
z&u;UL)wRjHC)Yja-_-tdOmd<<hMW{Md*2#PbCX6^pNODrG~YNm390DQD!VzSsc?F0
zh=Mef&kj5_A-4tQv9u^9$@F>Qpei$^$1ypZm&Y-GVUiHu{yZ<Q@-1m)A*pxkQ3{xh
z41i5>`Bvarsj90C+B_$DgV6B628ZNz$_9778sZyR>3!U<#wdKZ5*+;2nc8uHh4&5A
zItL5V*^WxPp|CvkTJzwfZQ`C_f;HYUOdF1`<w$Y9Iyyn4F_P6{?a#O6`5?BvO&%ZX
zk6L18pNY5QpNBtHF7C7XSYI@YVbV6o?xWo)5op~i-;!+5DuAmyXV<qVqAeZDZU`D$
zSF{J7+JD2}@zjc;rwB)G>~?k5LkIhZq8P7HU`i5d)J9^NxX(dJ0(<X6+u4lJQN^Zf
z&mh^S@~*bno8vdb{fX-XT!$oRbQ<KfpQc6#ki-c!zE3%vR*u^GLHEvvB>jLEBhh&E
zsH^VhXLGF+>=xJr-_`h_6UFO8=VNoq1+ID%EAy=bHC8KWiqEc7wQ9Yv_+-R6Ae;f6
z5DPCZ0FKPCXW4F=p}dYWjg!ZARz;(_H;!cOR$t3IKB7Osn$FgVrP88nsyT`dacF%j
zL11u}cO(phf|iTU^5|@5<|iZFlJ6?LZ!oljOpqO_-8URJB06k0*Pov0a9aWqOsWmM
zee6{kp_KT@X?I_$5W-3v=mzn}YFwZ;U5hRpwOgROg+7cF9xA@-zUHV}aC}f1QshNe
zKO?^FZ}%d{OSC~bvXJ7m{X}<?xf)RDh+5pc+<26`p})~_PE-|wWM%jHL2s|<a23M#
zBMj!-Shfq3jc)wHNjiw*J2p0(y24Nxvd%DbawThBVU<xv8$rn3oT&D0x+Kq`K5mWE
zsfma!GM)09Jf@n{x3<jj@<E9PsY>6<O+%YulN}$)eQZ%ME5W#g)!Zs-kFg;uG~YDq
zqwIp}(BELK8Om6-qL?->Uvt_B=|XLMOMH*fBPqx!XUe7QiNo6`S-RG|!Ead{w@?uU
z&X3$E;RMs+`5(_vDkMD;ymt=8J9vnrSRSl#Mw;Km=dOfkIUVmgYzzzysK0WsLGVVB
zm9XqSp-nisUDR%m?0CZgX?;zpg%gnEirNWt``yU4U+aW6Xbf>tBkURtJrihY4``jJ
z*P^AqBMNUDwl0h$zbwPXZ8ZLFNyiISessFI@SdTlzDA^ZR%ifKs3tS_T0^~JX0yrH
zDtqNH9Cjzz{@6h%oLE}4nYr=P@XelB!_jS<af;PA^&+O_9k(ejnY%Cx6&H5em|h%o
zW58G%wevT6FU>9o`%jLeGzXZHdN{e(xDVb9ufKQi*s%(V(QJHUf~KM^sTehcM~I`Y
zYe#Uj6N!p?rxEllp4)%RaEt3mc{03Y=)0Vy;bC?ie1%EfXnU^GSY*kugi${W$y8;5
zY2z@4LykQ|W?g>PX}{uVxHOonsH@y~K5;94ny+#4u-B2!;b(j8Bk(-tp6r3BPB7rb
zZ3Mgf%?e{@Tl%M+p-%Y&BO9nmo{O=h@gXArNdldzV*8sm>}Muz6Qt4WM4zUwr+g4i
zO$}klqjgu4vl%PqS4m<`*r@x10+ploWLsOXgA<_(X{!%puWWP$obw7$J`wo8)A0C~
z(=nk6yFp~?whw}`)}6&Qc>NUb6lcu<u4N5N_&5ZVb1mUL0nFR7`Zwr0^S^bOIN#x`
zb>~=;r6qGrP&a7>;hg&M!)|u-7t(8dM&-CSR$dUw0}BNupCY!{9lYIVI!7CX(8!Bi
zWv!Rl|KME`>N>hWqBY!S)?;^U;bI7r4Bck1jrMuo#))a3(PGiN;VXEdp|py1GuOYw
zBIBy}>j}Lij>L>GrTMrH57Nb4xLMRD1Ag0RFw9yGeb_c+o9ztNI8NIFooo!189w9X
z&G7K0xrOhfWbdp|M$?Q8(;F<j%`*#JVazZj+1>Wg+%odgErD(1*07FXJ;S%k$6_*h
z!TOFgJNH~wp2M0=N&HQ06`Cp|meVn)qq7xwM=7)c*ewm~&fQHA2UL~jnli>gCD7yX
zICZ?@6k}G%<JWRBCz4B}h5?$3;Hi_D`fC!+Y|eKwrCWTg2|}n`lhag-6LRsGq<f0~
z9VK>#?8;yCBbJ1&W+3e9T)IR&;}`45UfJR)tL{2VkCBu~4#RM2V||MCvxvlvGW%)0
z?r8PB2`UY-S?$R)Avp_)FOV|A6J2T?hV~fk3eRo5tLb45*%CHcbtK>`jqQgYrAm23
zHBlwOk}}TMrCX-H!y>4(>d+`=iS=WxI?I%hJ4F2_=PnFic9O$N+EHfBlb!KY=AN|R
zfIrem4m&{i8LO|(+9cB=wygGh$qK>l_<m?Sz}F$5<7@ib%+Itj(K*r@6ADA?K~Dhk
zhZ^i7i7xoOQf1lM=q$tS*TsdIM3Cek3Z`?$*_onTt~DXl;2JFG7hFye?hSB<SE<dF
z3IH2ql~vdg<AwB(G)ANnu15>Vc#pO^9N?|t^I@^-5>Y*qAy4)VN*u80E>}VBZ%sXg
z8+*a-9l5nwtpuFTAF|K8_vw)BW3LG59CNc_>8kEe(eLFmCuf!19xOsFmg<eS#)du!
zx9?cx$47ED=@_^u$97QK!ybS0eJ<l%gR^6($)dLZ$nwmMn_O8UhQ(gq$K<3JLwCky
zRXaXGsObRi%**;1jMBzr)|8~mHQ~fWiPbTNBc;JazukS|D;=?3W>g`t_tOsM!K!{V
zPXl=aVo>t;J<zg%N?kXhZom>L51u}o7NFBoXLwsd-x^v1>P0u2w6&+{ts#u|$k|nc
zJU-H6^ZYJr86Llzhx_^GL-%e!A!OJ|bm3<GEzA!jyJ;5RTBmK>V`)up4=49@aGzi4
z8Qi9(#`R1kRz`<uk+;3>#NpXc+y2k@j0@)h&P9r@1O5>9b*vkbp9ZTx573cx+R(G=
zxd#|%&?NIdgf~m<jZFRc<uDdgR!X9|!q);~=9VjN&sl~hpIfgftBfg0R)Ix44L%)d
zbmcSXK>jq}w@VSmnqu{8IAG?)#;b}mIIA?>!5{z^UEBN^ad=kSZ8OsJ9Uq<jX@@8T
z>n#ssxn7Nq)hDOQYzVvTPj1{H`0szQqHwd%3!y7D5NLEZEwLB?^}8%AP(E*>bkkG<
zVXLXIB0WmOfR&lw@oIc6D7fkC=Y_dgHnM;wXw8WJ-lNSv4L|A)bG=Tr@;&2EZ)K=9
zG`Q>?Sj9LL60(p+oDGJPI5QL=nu~)CU~%O?kAiHFTHX<5+3RoLw<IJyX_Y^{R&pDG
z*xMRvJ~!0~TtcEy_L?Z{AkfrhR(3k=>m4hE$tt0Z-o!Mf|7KfG1!bXRD7YgmIE&_}
z{n^L#<EE+Los}6?uli~OcMjQJ1I#A&&$wiQ-5)y-_K51z82FfLy|efM;IVK-_<4yB
zH#W_0Y%U1hYhmojbFc{MZZKQwsQabOs7N$4%>t8eT{O)$BGeLI*;LI6W}+FFV4F36
z7&h<?;*3)lZF)F91Dj;RWQA%*G~+|vf>u#J8VmBZ3??C<!WK*<rl8Mrs$P&f^k3^x
zex52Quhib$aD)lMz#LSd#6p;<=hhLzdf$uKmyX~9;i&nEto)<8jq1$oK8LjE$MbKy
z0*Mm)mGdWR3+al^=dm72kQV|Z^(7#iMsp7-W$i|zWwtr{Yq<?y*St5=-CPceorXrk
zwksojxeWP@OumRkSWIN=6kZfrTBG&N2hRFlyYqcDPqWBJvs%KevW7|!ZLn@pZP9p6
zb`0&znLbLQZ4qCfBI_nS+`zwV%YF6@I^LAhrVQXFLf&1SApMv>UNNfiuZVJaYjI=3
zUEc?L^-a~50HZp$h);`t<N)uef4M2;#1Wqfm#DaZj=l$5hSh+|LsL1k#=uL{k)Er#
zr#XK+YTBN@^`Ob@m@63TLKEx0p@Nf&P)mc|Lt|cxT~I3*n@?RlsMS?wz5bR@t3twf
zEbHX;4$KFS?D{YLmxlpj92|ox^3~`rc&t)Ehrz4Ctx)DP;KvV?*|7o~%@6r}W(;*R
zCJvm@SQUvL#D_M#Denak)xJxcb8-HdhuB;^_e(kv5>9Q&vVptl-kaUiq&2iX9e<!Z
zJ6M4LdpqzpVoelS6jz?6om==|8QguL<ZPN3q6<qcJK@t7CD|tDQQKH%{2Fmrt(Ux5
zZ47twZ9cbNFZm0!97;+3H;%{K*JpfMN#U#qN3Zt+?(CU~7p%>Rp;nkpQw`H)9XHBl
zKLpbHKk>B~N#&WGY-k$qWHvr2cOds8ZYXF_w17>LOcn~#B|nod%&&;M<ht~}-ny=K
zs_3crb-E6(BJ=ll&i3{Fy<tpcGUClyNsU^aL6FBJg#Y1FDNHI#WKZvxf{*OhSp4s5
z%)p#5HuHqC>m+YDZLrFzn+Jb0qe^gkV~L%I%uEYLnV*Zdyzc3Z4QYyT;aB#EYK|t3
z|0!9su-H-=;DpY-;J8I+t~x8eJ!z<g*NX0NtyuH9vOuPLJU}F1gyUJWv$<KM2}kKX
zmrxVQ)$wOSv`Q*$0`O(tij{uE>5itR(_*lC&F#jd5=iz&Sk%icg%*0!OgE&rdE6`O
zmD^OtsL`tv+Pmh)wE;(N{`L&~{Ic9zE^*_6-9yuoV3Ta4UrQ(~6SJK3$45w1N={RE
zuO9*e-Pi<(0t^_wRB<jSZ*!A1+`^v(7>W8B-ED$0dAz_6>fj!2FYrCRw&#8LwAa()
z^7_-`M29;#bHeNCaK1vD_xU#{k=JuSvE%Xaen5uT>tXNZPuP*q7rcN8c!t#re0jB+
z^L(?rp2_R!3Wlci8f*%^+uKfj(jd5u6nS_!mhrlO*q`WleA>PB;$FMi)&?^e$ecT|
zJ6a5scQ1tN$pmeVbRAx!R_tx8yw-})W+7<7;ksJbz1|qZZMA1|Om#ks#M=QkJT0VX
zx7TyKeloe)u$(T?aw7<1DRe)@9O(7)Qn|kExLNY3_#gygOGc=mEsH8sPh%o5KjvAu
zSSw-YKsFp>L6*H=vC*GAneu~cfOFDzORmZXTGyXZX#BXhi`*`Q@kqq>K0A%rnWBDZ
zt>12dld+_BNk|a=upsaDYoqXVehn_g@agwjS=5J`YO|I>iw#njz{s#BJ?92-L!LW4
z&eo0(D>K>wPTI{5EUfNXOgD_0!V#f8yJ~qJ_8-`JBAm`wBa4dE>xz!KqY#$e8C?6l
zn$Q_{XGPY>7+OJ=@)dNR*W(IOU}vLjqxw3x_nPebqHCRP+^Z!)PNj36cPkYV5y#v^
zUp_G}8wXVf!Sy+{C91(slsBz9eJ*NkX1T~ty(@~f!N$G9MO}C6L_b^L)}d&1#cs5V
zFq(LkZg)qjiiCvhxpHx2u<^vH)h3#0u>;RZR_+vFL}q!ewEXjRm03xdQ?HSh$EoIK
zlXJxHUryflPvf2g8RwZZ^no(q2O`>}y4!6d-?rS1e7#ys<m0wG2h***FXzQB7iI*)
zX*fLa@tne_bD<X0b8D$-7yD;L^}b~X;HD;sQbTIjAoKpwa{f^Kpe`dPV<}#Dx(6B<
znz^<7l&M9Y4E8#qu$+*H^8`3uD$wE;Va)M+?qB+N984k99D$Lzj6uWiESj!$$BMMq
z>#nCch2(`@6Ae9&b7PrMJ67{V@8;lG_dPY2mK&D8OL7FF(!?9><<lA-gNK@maJr=2
zoX-`<PzchN@N!8r&DCpz31AHIdh#a^<_1`d9Fr_&l-zjTw|+I6Ty&M)9_$55;2Piv
zk>k~W+mUhg^mwCigPiz!Tzz7;(9m-yg2TQ(l75^f=~Lyq41#$yw1;0?KYz)}`FuId
zxjRO?U5T-GTy+)k?0>f|+yoOrkSHLePN0^~-eM_+U}>2<SiHR`Qr-yOHi)9ydrvD=
zRIkY)WDcUhK7U`{B<Nx6AijI!!*q1-Ag1@lD<tXeWV2w$(VvHfoykTQgTS67JUj;a
z1Wfw7{A9)2L=TmlE+hHwBclT{0bc5<GJ%W2O=M(cwqC7(b@z964y{(B2>FLK5Qh8=
ze!c~J7$Y7Y2f9ef82*~ou{;wmQ9;BexSxyJA@?9l&$)wX0-%TwH_)_}nUiP5+RX8>
z8DkCwjR}R=@L~L*iFMxG{v1=%LdL_~)^JVlTyfMuU!s62!Z*}W?V7@7nn4Zms9$$0
z7kr!xk*xRoJBVFwv#x?g{K-y#+KiVcgn?bFEs|jj+#FYe1A0FLaE6w=y$T|nTB$HQ
z=dm5)LZxrota2JE!1vsdU*s)sdRJ8#A<xo0v8`rgSdOYR%2rc_ED)NpDJRN~IiwKI
zMKxd?oYuEimh{Wyn+#VXLb}*edxr4B_>-yF2)X#uSyF9n!e{Y%hgLT)(+toxf1vMn
z3*1nuWJ<i02b<f`CMb7b(o<-dSi)e!UE7w$&Q+p~fEOKalz8}@LiJelu*kGUb}QfL
zZe#V-C~-LP>if+SRVwJQt%#K%{*t4;xj%(IaAI@?KFO8pbG&5f3Qlp6%X#c%K??Hk
z-^P23pxURRV4N;;&;Y1;DH%)}8J4%d7(ZObWeba!n~zbu(qboXwFZ}LcvH_fI#3l9
zDgC%tlGrY1vo||ZIXC%qEvxojueP=#A)3?h`R+|6XCT0$bvIsaJmUZ(qs@&mN=4$+
z0!!V`2hp3}nseewQ(jPczWSLO<pWPK{{=F^NpZx~bd?2xt(x1Ou#J$&u|H4!jljO=
z-BYzP#<OdE?9V`HIS@f%;U?4Tal?{p&sUs=5qLfy%}zQ+K6^R6d0-fLy-~yN_=b#m
zAY!YhU=z*L$@-+h;foxNP>ryn+0BOR*Ew9SZumVNp%z!`&rB*)6|#l&pu~45IPnLI
zex%F!#wzEx(xW$(J%Q{hQ<Xe<3|Au|f!9rPOp#^ADg+40A4-iED0bKIOHU$+F-%dF
zKAQ{5o_4)Lsez-$W*MGpXnQNvBfK+*|Dq;t^fDg@Vf^w?kkxs4eAkxDbb!_#?aCDm
zc!|(nw>3&HA^r3NstXse`C-}%n5rn4FI2Ad_E!(<2=&C|=z1Vq?g1E&<#ml<sXbK)
zK&dW9K$!cM8y$nhldk^JKaY!1K)V{F_^Y|fI-;&&C1A%f^D_1z`6Ib2Brv=>>!d4$
zKnVk9Zog;Zu^O0<UXi4c0@6hCdQs0^;&7`(D?4CXHS|=Ss+84!14_*IF4;On1>tdS
z)ya+4!D-0nzN1xtuq2Yt&2K#ZvDC?+HdUKHQIRr@N!d&vcuT4|1NE2--=SBVXQmdW
zjdU5A^B6HDm!utXh01BlDQrd~HqA^q$7^1AdS@XvFTCjqlmtaM)KkP%Ou5*{XI)~;
z0poyRdbyv^IdFGBjm75kI-iB$&WomEG-JO#W36@=wKrgZI}Y%8nAN745g=&LAXP}9
zt*2_;O>6b%g)usxPT#^>hbiUMj=)2+2}?ASWqTX+LgD6;YQ`FO5^Z`5Z9#@YL({2U
z$%H4IEPY3K(P7DfdWj$2=>3A5m{G^e3IT-%4M#=Ty7OWO0OqXo;R15Nn08STi20U=
zSa@U5KGxns5COM?_AsRv0TTfOnSRweEWuvt8%!uP5@s+a4H}&aiI%m^)X+;7!h--)
z({*n@|Iz7&9r=!vl&c(!Q`%Diabw(9UWUf1LTdS`^=CgoXk93dO@T1={$wbUg`u#-
z%ElH)YSFsV$x@#Ki+l$ysU@maZLJ89nj%~&8f#-?uaRM`5+R`yyr`o^FA4x@k-1Eq
zj~e~G&8q<`K+VR_p%>-kHleYrFI+<Yg^9*4jxE>-)!37iUKFJl6zxxY#zn>(TM@+o
z)8%3-I(TbrrjY<am1F7L0MSLxI`NHNRDV4E;gSk|?k($|WVT?Bf1M$?y%1-q^L+Ci
zXQ6}E#%~jB7qOo3$A3}EAKO`U4UHw%>t$de|9Dc|g6(NR#Csu7LAg>K2>B1(Sxk+U
zDz>W~IfpK)cq|}8fSJmOMjyR75-+JOSgZy$X>fg>+23)%?k_OF9oBr*xVsgQ4zcCN
zokba^@3(n6x=-m376zzojqUcPwYDscjji@aZTVyffQqxN(0t%+#*z%3jUV7QwHGB2
ztDZwx;*^cV(%MGz_@|Ww9y^I;CBO!N7+~=wxblj0IIzlqx`I`u*!7DQOIc6Ui!F%5
zQ@t7>0dQ=BI{Sc(QejpFtWrT8cFYk9OE8Xx1{oK#S~UQCA<xw>)Ge$~Si<pd;6Jlj
zTvu&CrY}za?YkZzxwYXX*%zBlkNH1!@&{0#)UteTot6i{=O6dxa&29Gc<cYHFH5WC
zC_e4|i{VQOe}TSWfahga3vm&>hQ&&p0!qMMs`!uVzc_$!l_HS<)xc{0W4WS(1FVbN
zpKbJ_^s|scbcGPG=RcCi05B2S{6{_kn`-?JJ1>*MD}Rdz(Dn%N?M3lbuzEvc`69rK
z=jG=0@{REju-6D*{QVWc>((Cu%>SzXj|j6k(7`y+MQeW?I!gFBN_Bn5Vaw2{Hd~T{
zk!$0B+3-NI{j~%>UyT3S{A2dle=#dO8Y?`YAJzCTIYRNZ_xP{QU#NK!$S<H@++0&4
z0^9o-sF#;a{>nc}{~ZK~^FKoU&8B(j4`Exdx<Gl#lxyl29H_-TU<d)3h_4WeU&G37
z!P)>*x%o(A0BlmrH~Fr9Y+JB5u@b;sG3$4^%p8hq$`AlD?n{b?H(bFuf`8@32cQHH
z2AGNbp&TeM{<t&N?`VKw8-E<o`71y~z@|t>_MiR{N)C_$VD>j4g^k~f%mONZaG5sX
zN_d3i^rGZAPE`SleI*gV(E%8}jI34xpY|R9a^3g`SghHt>7OkP<n#ZL=5<2xzs><a
z|3>i-7SNv<z-T^?&_C43&;iH9AFu#5f02^d`28cZI3$Oj|LUw-MUhzkBf!f2M+L|V
z*lhn1kC2#Nlo*A7ssBgU#_u!0y>T!O$^Vl7?cu+@{cT^vifzG)6|;(>v5HQ&4Zd{#
zEx;(SjxTtwDaC<>iFv@t2kMO(IGq0+sSg;W|BnCwN}%NaLH!r<zftG$2#Eni0@W>c
zBp(N4od-gB$qA4bo4;WG;(3YJ$RBg|2iad3G&X+!L#`=@(O3un3ZOyr@BT|?7DqoA
zM<3Wb361>te+~pk;N<v68?bpf_N-n?FN)MM3RpJPE!e-}^5;eZE=iPXKmfLZ`G2eY
zom^xFT>q8-1TZ#1jc?>nIQnDu$M_PsTC^qq<@etKUK)Rq067Ba{<r*>hnMjAZqZl3
zq4Dx&03`T-o4h3V^4j6*_fO9M09zxJSRn+;Q59es*n$9aM1N&9R0CKCp)FWI4F1&j
zotaQGRugbU{v8x*Ue6L;$$IG@$twVkiB_$?zC8Zz0%-huh!HqL$rDe2&HnYT+ZUgI
z?ri?(M*a^k)KfpH0nHaVLJ0wC@a56_BEvvpYrq`@WEK5@@vdm?Ph24Mza*^Dr|i${
zAM?M?xN85I_6YgwB?JgfV)-I3C-^e(I&e#b6^w)NR}QsyUVzX3>Hm)if9-!3{s5wE
z552r){0rG%hk&;XW?+H;!TvXcm(MQX0@mDuZRtgE48}Q`2LEXlt?48JGqX4+z`gdO
z(7gU<0B8X>7O(>Udi*skl9~F)3vhQzto)<u@h|SW=vG5pfz|t0jJCm-7GT5!(Eay~
zC-LY{c;MOtwusX|;r|;LFauoA|M&)Q{ihFDTD5hdu0KECH*|pSpIHCv+bC@>m&a>h
p>Uuu&`EoaLo#*N9F45~DGV=NA*vspFJM)qEb<dhcfHM@t{{eQ}#_#|D

literal 0
HcmV?d00001

diff --git a/test/unit/mesh/cpp/CMakeLists.txt b/test/unit/mesh/cpp/CMakeLists.txt
new file mode 100644
index 0000000..2a8fbb1
--- /dev/null
+++ b/test/unit/mesh/cpp/CMakeLists.txt
@@ -0,0 +1,44 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME test_mesh)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(test_MeshFunction MeshFunction.cpp)
+add_executable(test_Mesh Mesh.cpp)
+add_executable(test_MeshValueCollection MeshValueCollection.cpp)
+
+# Target libraries
+target_link_libraries(test_MeshFunction ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
+target_link_libraries(test_Mesh ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
+target_link_libraries(test_MeshValueCollection ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/test/unit/mesh/cpp/Mesh.cpp b/test/unit/mesh/cpp/Mesh.cpp
new file mode 100644
index 0000000..db3f228
--- /dev/null
+++ b/test/unit/mesh/cpp/Mesh.cpp
@@ -0,0 +1,322 @@
+// Copyright (C) 2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// Modified by Benjamin Kehlet 2012
+//
+// First added:  2007-05-14
+// Last changed: 2012-11-12
+//
+// Unit tests for the mesh library
+
+#include <dolfin.h>
+#include <dolfin/common/unittest.h>
+
+using namespace dolfin;
+
+class SimpleShapes : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(SimpleShapes);
+  CPPUNIT_TEST(testUnitSquareMesh);
+  CPPUNIT_TEST(testUnitCubeMesh);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testUnitSquareMesh()
+  {
+    // Create mesh of unit square
+    UnitSquareMesh mesh(5, 7);
+    CPPUNIT_ASSERT(mesh.num_vertices() == 48);
+    CPPUNIT_ASSERT(mesh.num_cells() == 70);
+  }
+
+  void testUnitCubeMesh()
+  {
+    // Create mesh of unit cube
+    UnitCubeMesh mesh(5, 7, 9);
+    CPPUNIT_ASSERT(mesh.num_vertices() == 480);
+    CPPUNIT_ASSERT(mesh.num_cells() == 1890);
+  }
+
+};
+
+class MeshRefinement : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(MeshRefinement);
+  CPPUNIT_TEST(testRefineUnitSquareMesh);
+  CPPUNIT_TEST(testRefineUnitCubeMesh);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testRefineUnitSquareMesh()
+  {
+    // Refine mesh of unit square
+    UnitSquareMesh mesh0(5, 7);
+    Mesh mesh1 = refine(mesh0);
+    CPPUNIT_ASSERT(mesh1.num_vertices() == 165);
+    CPPUNIT_ASSERT(mesh1.num_cells() == 280);
+  }
+
+  void testRefineUnitCubeMesh()
+  {
+    // Refine mesh of unit cube
+    UnitCubeMesh mesh0(5, 7, 9);
+    Mesh mesh1 = refine(mesh0);
+    CPPUNIT_ASSERT(mesh1.num_vertices() == 3135);
+    CPPUNIT_ASSERT(mesh1.num_cells() == 15120);
+  }
+
+};
+
+class MeshIterators : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(MeshIterators);
+  CPPUNIT_TEST(testVertexIterators);
+  CPPUNIT_TEST(testEdgeIterators);
+  CPPUNIT_TEST(testFaceIterators);
+  CPPUNIT_TEST(testFacetIterators);
+  CPPUNIT_TEST(testCellIterators);
+  CPPUNIT_TEST(testMixedIterators);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testVertexIterators()
+  {
+    // Iterate over vertices
+    UnitCubeMesh mesh(5, 5, 5);
+    unsigned int n = 0;
+    for (VertexIterator v(mesh); !v.end(); ++v)
+      n++;
+    CPPUNIT_ASSERT(n == mesh.num_vertices());
+  }
+
+  void testEdgeIterators()
+  {
+    // Iterate over edges
+    UnitCubeMesh mesh(5, 5, 5);
+    unsigned int n = 0;
+    for (EdgeIterator e(mesh); !e.end(); ++e)
+      n++;
+    CPPUNIT_ASSERT(n == mesh.num_edges());
+  }
+
+  void testFaceIterators()
+  {
+    // Iterate over faces
+    UnitCubeMesh mesh(5, 5, 5);
+    unsigned int n = 0;
+    for (FaceIterator f(mesh); !f.end(); ++f)
+      n++;
+    CPPUNIT_ASSERT(n == mesh.num_faces());
+  }
+
+  void testFacetIterators()
+  {
+    // Iterate over facets
+    UnitCubeMesh mesh(5, 5, 5);
+    unsigned int n = 0;
+    for (FacetIterator f(mesh); !f.end(); ++f)
+      n++;
+    CPPUNIT_ASSERT(n == mesh.num_facets());
+  }
+
+  void testCellIterators()
+  {
+    // Iterate over cells
+    UnitCubeMesh mesh(5, 5, 5);
+    unsigned int n = 0;
+    for (CellIterator c(mesh); !c.end(); ++c)
+      n++;
+    CPPUNIT_ASSERT(n == mesh.num_cells());
+  }
+
+  void testMixedIterators()
+  {
+    // Iterate over vertices of cells
+    UnitCubeMesh mesh(5, 5, 5);
+    unsigned int n = 0;
+    for (CellIterator c(mesh); !c.end(); ++c)
+      for (VertexIterator v(*c); !v.end(); ++v)
+        n++;
+    CPPUNIT_ASSERT(n == 4*mesh.num_cells());
+  }
+
+};
+
+class BoundaryExtraction : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(BoundaryExtraction);
+  CPPUNIT_TEST(testBoundaryComputation);
+  CPPUNIT_TEST(testBoundaryBoundary);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testBoundaryComputation()
+  {
+    // Compute boundary of mesh
+    UnitCubeMesh mesh(2, 2, 2);
+    BoundaryMesh boundary(mesh, "exterior");
+    CPPUNIT_ASSERT(boundary.num_vertices() == 26);
+    CPPUNIT_ASSERT(boundary.num_cells() == 48);
+  }
+
+  void testBoundaryBoundary()
+  {
+    // Compute boundary of boundary
+    //
+    // Note that we can't do
+    //
+    //   BoundaryMesh b0(mesh);
+    //   BoundaryMesh b1(b0);
+    //
+    // since b1 would then be a copy of b0 (copy
+    // constructor in Mesh will be used).
+
+    UnitCubeMesh mesh(2, 2, 2);
+    BoundaryMesh b0(mesh, "exterior");
+    b0.order();
+    BoundaryMesh b1(b0, "exterior");
+    CPPUNIT_ASSERT(b1.num_vertices() == 0);
+    CPPUNIT_ASSERT(b1.num_cells() == 0);
+  }
+
+};
+
+class MeshFunctions : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(MeshFunctions);
+  CPPUNIT_TEST(testAssign);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testAssign()
+  {
+    /// Assign value of mesh function
+    UnitSquareMesh mesh(3, 3);
+    MeshFunction<int> f(mesh, 0);
+    f[3] = 10;
+    Vertex v(mesh, 3);
+    CPPUNIT_ASSERT(f[v] == 10);
+  }
+
+};
+
+class InputOutput : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(InputOutput);
+  CPPUNIT_TEST(testMeshXML2D);
+  CPPUNIT_TEST(testMeshXML3D);
+  CPPUNIT_TEST(testMeshFunction);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testMeshXML2D()
+  {
+    // Write and read 2D mesh to/from file
+    UnitSquareMesh mesh_out(3, 3);
+    Mesh mesh_in;
+    File file("unitsquare.xml");
+    file << mesh_out;
+    file >> mesh_in;
+    CPPUNIT_ASSERT(mesh_in.num_vertices() == 16);
+  }
+
+  void testMeshXML3D()
+  {
+    // Write and read 3D mesh to/from file
+    UnitCubeMesh mesh_out(3, 3, 3);
+    Mesh mesh_in;
+    File file("unitcube.xml");
+    file << mesh_out;
+    file >> mesh_in;
+    CPPUNIT_ASSERT(mesh_in.num_vertices() == 64);
+  }
+
+  void testMeshFunction()
+  {
+    // Write and read mesh function to/from file
+    UnitSquareMesh mesh(1, 1);
+    MeshFunction<int> f(mesh, 0);
+    f[0] = 2;
+    f[1] = 4;
+    f[2] = 6;
+    f[3] = 8;
+    File file("meshfunction.xml");
+    file << f;
+    MeshFunction<int> g(mesh, 0);
+    file >> g;
+    for (VertexIterator v(mesh); !v.end(); ++v)
+      CPPUNIT_ASSERT(f[*v] == g[*v]);
+  }
+
+};
+
+class PyCCInterface : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(PyCCInterface);
+  CPPUNIT_TEST(testGetGeometricalDimension);
+  CPPUNIT_TEST(testGetCoordinates);
+  CPPUNIT_TEST(testGetCells);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testGetGeometricalDimension()
+  {
+    // Get geometrical dimension of mesh
+    UnitSquareMesh mesh(5, 5);
+    CPPUNIT_ASSERT(mesh.geometry().dim() == 2);
+  }
+
+  void testGetCoordinates()
+  {
+    // Get coordinates of vertices
+    UnitSquareMesh mesh(5, 5);
+    CPPUNIT_ASSERT(mesh.geometry().size() == 36);
+  }
+
+  void testGetCells()
+  {
+    // Get cells of mesh
+    UnitSquareMesh mesh(5, 5);
+    CPPUNIT_ASSERT(mesh.topology().size(2) == 50);
+  }
+
+};
+
+int main()
+{
+  CPPUNIT_TEST_SUITE_REGISTRATION(MeshIterators);
+
+  // FIXME: The following test breaks in parallel
+  if (dolfin::MPI::size(MPI_COMM_WORLD) == 1)
+  {
+    CPPUNIT_TEST_SUITE_REGISTRATION(SimpleShapes);
+    CPPUNIT_TEST_SUITE_REGISTRATION(MeshRefinement);
+    CPPUNIT_TEST_SUITE_REGISTRATION(BoundaryExtraction);
+    CPPUNIT_TEST_SUITE_REGISTRATION(MeshFunctions);
+    CPPUNIT_TEST_SUITE_REGISTRATION(InputOutput);
+    CPPUNIT_TEST_SUITE_REGISTRATION(PyCCInterface);
+  }
+
+  DOLFIN_TEST;
+}
diff --git a/test/unit/mesh/cpp/MeshFunction.cpp b/test/unit/mesh/cpp/MeshFunction.cpp
new file mode 100644
index 0000000..d3f7d3d
--- /dev/null
+++ b/test/unit/mesh/cpp/MeshFunction.cpp
@@ -0,0 +1,97 @@
+// Copyright (C) 2013 Garth N. Wells
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2013-05-30
+// Last changed:
+//
+// Unit tests for MeshFunction
+
+#include <dolfin.h>
+#include <dolfin/common/unittest.h>
+
+using namespace dolfin;
+
+class MeshFunctions : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(MeshFunctions);
+  CPPUNIT_TEST(test_create_from_domains);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void test_create_from_domains()
+  {
+    // Create mesh
+    std::shared_ptr<Mesh> mesh(new UnitSquareMesh(3, 3));
+    dolfin_assert(mesh);
+
+    const std::size_t D = mesh->topology().dim();
+
+    // Test setting all values
+    for (std::size_t d = 0; d <= D; ++d)
+    {
+      // Create MeshDomains object
+      MeshDomains mesh_domains;
+      mesh_domains.init(D);
+
+      mesh->init(d);
+
+      // Build mesh domain
+      std::map<std::size_t, std::size_t>& domain = mesh_domains.markers(d);
+      for (std::size_t i = 0; i < mesh->num_entities(d); ++i)
+        domain.insert(std::make_pair(i, i));
+
+      // Create MeshFunction and test values
+      MeshFunction<std::size_t> mf(mesh, d, mesh_domains);
+      for (std::size_t i = 0; i < mf.size(); ++i)
+        CPPUNIT_ASSERT(mf[i] == i);
+    }
+
+    // Test setting some values only
+    for (std::size_t d = 0; d <= D; ++d)
+    {
+      // Create MeshDomains object
+      MeshDomains mesh_domains;
+      mesh_domains.init(D);
+
+      mesh->init(d);
+
+      // Build mesh domain
+      std::map<std::size_t, std::size_t>& domain = mesh_domains.markers(d);
+      const std::size_t num_entities = mesh->num_entities(d);
+      for (std::size_t i = num_entities/2; i < num_entities; ++i)
+        domain.insert(std::make_pair(i, i));
+
+      // Create MeshFunction and test values
+      MeshFunction<std::size_t> mf(mesh, d, mesh_domains);
+      for (std::size_t i = 0; i < num_entities/2; ++i)
+        CPPUNIT_ASSERT(mf[i] == std::numeric_limits<std::size_t>::max());
+      for (std::size_t i = num_entities/2; i < mf.size(); ++i)
+        CPPUNIT_ASSERT(mf[i] == i);
+    }
+
+
+  }
+
+};
+
+
+int main()
+{
+  CPPUNIT_TEST_SUITE_REGISTRATION(MeshFunctions);
+  DOLFIN_TEST;
+}
diff --git a/test/unit/mesh/cpp/MeshValueCollection.cpp b/test/unit/mesh/cpp/MeshValueCollection.cpp
new file mode 100644
index 0000000..1ec93f8
--- /dev/null
+++ b/test/unit/mesh/cpp/MeshValueCollection.cpp
@@ -0,0 +1,187 @@
+// Copyright (C) 2007 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2007-05-14
+// Last changed: 2012-01-11
+//
+// Unit tests for the mesh library
+
+#include <dolfin.h>
+#include <dolfin/common/unittest.h>
+
+using namespace dolfin;
+
+class MeshValueCollections : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(MeshValueCollections);
+  CPPUNIT_TEST(testAssign2DCells);
+  CPPUNIT_TEST(testAssign2DFacets);
+  CPPUNIT_TEST(testAssign2DVertices);
+  CPPUNIT_TEST(testMeshFunctionAssign2DCells);
+  CPPUNIT_TEST(testMeshFunctionAssign2DFacets);
+  CPPUNIT_TEST(testMeshFunctionAssign2DVertices);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void testAssign2DCells()
+  {
+    UnitSquareMesh mesh(3, 3);
+    const std::size_t ncells = mesh.num_cells();
+    MeshValueCollection<int> f(mesh, 2);
+    bool all_new = true;
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      bool this_new;
+      const int value = ncells - cell->index();
+      this_new = f.set_value(cell->index(), value);
+      all_new = all_new && this_new;
+    }
+    MeshValueCollection<int> g(mesh, 2);
+    g = f;
+    CPPUNIT_ASSERT_EQUAL(ncells, f.size());
+    CPPUNIT_ASSERT_EQUAL(ncells, g.size());
+    CPPUNIT_ASSERT(all_new);
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const int value = ncells - cell->index();
+      CPPUNIT_ASSERT_EQUAL(value, g.get_value(cell->index(), 0));
+    }
+  }
+
+  void testAssign2DFacets()
+  {
+    UnitSquareMesh mesh(3, 3);
+    mesh.init(2,1);
+    const std::size_t ncells = mesh.num_cells();
+    MeshValueCollection<int> f(mesh, 1);
+    bool all_new = true;
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const int value = ncells - cell->index();
+      for (std::size_t i = 0; i < cell->num_entities(1); ++i)
+      {
+        bool this_new;
+        this_new = f.set_value(cell->index(), i, value + i);
+        all_new = all_new && this_new;
+      }
+    }
+    MeshValueCollection<int> g(mesh, 1);
+    g = f;
+    CPPUNIT_ASSERT_EQUAL(ncells*3, f.size());
+    CPPUNIT_ASSERT_EQUAL(ncells*3, g.size());
+    CPPUNIT_ASSERT(all_new);
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      for (std::size_t i = 0; i < cell->num_entities(1); ++i)
+      {
+        const int value = ncells - cell->index() + i;
+        CPPUNIT_ASSERT_EQUAL(value, g.get_value(cell->index(), i));
+      }
+    }
+  }
+
+  void testAssign2DVertices()
+  {
+    UnitSquareMesh mesh(3, 3);
+    mesh.init(2, 0);
+    const std::size_t ncells = mesh.num_cells();
+    MeshValueCollection<int> f(mesh, 0);
+    bool all_new = true;
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const int value = ncells - cell->index();
+      for (std::size_t i = 0; i < cell->num_entities(0); ++i)
+      {
+        bool this_new;
+        this_new = f.set_value(cell->index(), i, value+i);
+        all_new = all_new && this_new;
+      }
+    }
+    MeshValueCollection<int> g(mesh, 0);
+    g = f;
+    CPPUNIT_ASSERT_EQUAL(ncells*3, f.size());
+    CPPUNIT_ASSERT_EQUAL(ncells*3, g.size());
+    CPPUNIT_ASSERT(all_new);
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      for (std::size_t i = 0; i < cell->num_entities(0); ++i)
+      {
+        const int value = ncells - cell->index() + i;
+        CPPUNIT_ASSERT_EQUAL(value, g.get_value(cell->index(), i));
+      }
+    }
+  }
+
+  void testMeshFunctionAssign2DCells()
+  {
+    UnitSquareMesh mesh(3, 3);
+    const std::size_t ncells = mesh.num_cells();
+    MeshFunction<int> f(mesh, 2, 0);
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+      f[cell->index()] = ncells - cell->index();
+    MeshValueCollection<int> g(mesh, 2);
+    g = f;
+    CPPUNIT_ASSERT_EQUAL(ncells, f.size());
+    CPPUNIT_ASSERT_EQUAL(ncells, g.size());
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      const int value = ncells - cell->index();
+      CPPUNIT_ASSERT_EQUAL(value, g.get_value(cell->index(), 0));
+    }
+  }
+
+  void testMeshFunctionAssign2DFacets()
+  {
+    UnitSquareMesh mesh(3, 3);
+    mesh.init(1);
+    MeshFunction<int> f(mesh, 1, 25);
+    MeshValueCollection<int> g(mesh, 1);
+    g = f;
+    CPPUNIT_ASSERT_EQUAL(mesh.num_facets(), f.size());
+    CPPUNIT_ASSERT_EQUAL(mesh.num_cells()*3, g.size());
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      for (std::size_t i = 0; i < cell->num_entities(1); ++i)
+        CPPUNIT_ASSERT_EQUAL(25, g.get_value(cell->index(), i));
+    }
+  }
+
+  void testMeshFunctionAssign2DVertices()
+  {
+    UnitSquareMesh mesh(3, 3);
+    mesh.init(0);
+    MeshFunction<int> f(mesh, 0, 25);
+    MeshValueCollection<int> g(mesh, 0);
+    g = f;
+    CPPUNIT_ASSERT_EQUAL(mesh.num_vertices(), f.size());
+    CPPUNIT_ASSERT_EQUAL(mesh.num_cells()*3, g.size());
+    for (CellIterator cell(mesh); !cell.end(); ++cell)
+    {
+      for (std::size_t i = 0; i < cell->num_entities(0); ++i)
+        CPPUNIT_ASSERT_EQUAL(25, g.get_value(cell->index(), i));
+    }
+  }
+
+};
+
+
+int main()
+{
+  CPPUNIT_TEST_SUITE_REGISTRATION(MeshValueCollections);
+  DOLFIN_TEST;
+}
diff --git a/test/unit/mesh/python/BoundaryMesh.py b/test/unit/mesh/python/BoundaryMesh.py
new file mode 100644
index 0000000..61ca58c
--- /dev/null
+++ b/test/unit/mesh/python/BoundaryMesh.py
@@ -0,0 +1,59 @@
+"Unit tests for BoundaryMesh library"
+
+# Copyright (C) 2012 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Oeyvind Evju 2013
+#
+# First added:  2011-10-09
+# Last changed: 2013-10-11
+
+import unittest
+import numpy
+from dolfin import *
+
+class BoundaryMeshConstruction(unittest.TestCase):
+
+    def test_1D_mesh(self):
+        mesh = UnitIntervalMesh(32)
+
+        # Create global boundary mesh
+        bmesh1 = BoundaryMesh(mesh, "exterior")
+        self.assertEqual(MPI.sum(mesh.mpi_comm(), bmesh1.num_cells()), 2)
+        self.assertEqual(bmesh1.size_global(0), 2)
+        self.assertEqual(bmesh1.topology().dim(), 0)
+
+    def test_2D_mesh(self):
+        mesh = UnitSquareMesh(8, 8)
+
+        # Create global boundary mesh
+        bmesh1 = BoundaryMesh(mesh, "exterior")
+        self.assertEqual(MPI.sum(mesh.mpi_comm(), bmesh1.num_cells()), 4*8)
+        self.assertEqual(bmesh1.size_global(1), 4*8)
+        self.assertEqual(bmesh1.topology().dim(), 1)
+
+    def test_3D_mesh(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+
+        # Create global boundary mesh
+        bmesh1 = BoundaryMesh(mesh, "exterior")
+        self.assertEqual(MPI.sum(mesh.mpi_comm(), bmesh1.num_cells()), 6*8*8*2)
+        self.assertEqual(bmesh1.size_global(2), 6*8*8*2)
+        self.assertEqual(bmesh1.topology().dim(), 2)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/Cell.py b/test/unit/mesh/python/Cell.py
new file mode 100644
index 0000000..abe4276
--- /dev/null
+++ b/test/unit/mesh/python/Cell.py
@@ -0,0 +1,65 @@
+"""Unit tests for the Cell class"""
+
+# Copyright (C) 2013 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-04-18
+# Last changed: 2014-05-30
+
+import unittest
+import numpy
+
+from dolfin import *
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class IntervalTest(unittest.TestCase):
+
+    def test_distance(self):
+
+        mesh = UnitIntervalMesh(1)
+        cell = Cell(mesh, 0)
+
+        self.assertAlmostEqual(cell.distance(Point(-1.0)), 1.0)
+        self.assertAlmostEqual(cell.distance(Point(0.5)), 0.0)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TriangleTest(unittest.TestCase):
+
+    def test_distance(self):
+
+        mesh = UnitSquareMesh(1, 1)
+        cell = Cell(mesh, 1)
+
+        self.assertAlmostEqual(cell.distance(Point(-1.0, -1.0)), numpy.sqrt(2))
+        self.assertAlmostEqual(cell.distance(Point(-1.0, 0.5)), 1)
+        self.assertAlmostEqual(cell.distance(Point(0.5, 0.5)), 0.0)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TetrahedronTest(unittest.TestCase):
+
+    def test_distance(self):
+
+        mesh = UnitCubeMesh(1, 1, 1)
+        cell = Cell(mesh, 5)
+
+        self.assertAlmostEqual(cell.distance(Point(-1.0, -1.0, -1.0)), \
+                               numpy.sqrt(3))
+        self.assertAlmostEqual(cell.distance(Point(-1.0, 0.5, 0.5)), 1)
+        self.assertAlmostEqual(cell.distance(Point(0.5, 0.5, 0.5)), 0.0)
+
+if __name__ == "__main__":
+        unittest.main()
diff --git a/test/unit/mesh/python/Edge.py b/test/unit/mesh/python/Edge.py
new file mode 100644
index 0000000..af11f87
--- /dev/null
+++ b/test/unit/mesh/python/Edge.py
@@ -0,0 +1,56 @@
+"""Unit tests for the Edge class"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-02-26
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+cube   = UnitCubeMesh(5, 5, 5)
+square = UnitSquareMesh(5, 5)
+meshes = [cube, square]
+
+class EdgeFunctions(unittest.TestCase):
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test2DEdgeLength(self):
+        """Iterate over edges and sum length."""
+        length = 0.0
+        for e in edges(square):
+            length += e.length()
+        self.assertAlmostEqual(length, 19.07106781186544708362)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test3DEdgeLength(self):
+        """Iterate over edges and sum length."""
+        length = 0.0
+        for e in edges(cube):
+            length += e.length()
+        self.assertAlmostEqual(length, 278.58049080280125053832)
+
+    def testEdgeDot(self):
+        """Iterate over edges compute dot product with self."""
+        for mesh in meshes:
+            for e in edges(mesh):
+                dot = e.dot(e)/(e.length()**2)
+                self.assertAlmostEqual(dot, 1.0)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/Face.py b/test/unit/mesh/python/Face.py
new file mode 100644
index 0000000..e9bc331
--- /dev/null
+++ b/test/unit/mesh/python/Face.py
@@ -0,0 +1,68 @@
+"""Unit tests for the Face class"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-02-26
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+cube = UnitCubeMesh(5, 5, 5)
+square = UnitSquareMesh(5, 5)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class Area(unittest.TestCase):
+
+    def testArea(self):
+        """Iterate over faces and sum area."""
+
+        area = 0.0
+        for f in faces(cube):
+            area += f.area()
+        self.assertAlmostEqual(area, 39.21320343559672494393)
+
+        area = 0.0
+        for f in faces(square):
+            area += f.area()
+        self.assertAlmostEqual(area, 1.0)
+
+class Normal(unittest.TestCase):
+
+    def testNormalPoint(self):
+        """Compute normal vector to each face."""
+        for f in faces(cube):
+            n = f.normal()
+            self.assertAlmostEqual(n.norm(), 1.0)
+
+        f = Face(square, 0)
+        self.assertRaises(RuntimeError, f.normal)
+
+    def testNormalComponent(self):
+        """Compute normal vector components to each face."""
+        D = cube.topology().dim()
+        for f in faces(cube):
+            n = [f.normal(i) for i in range(D)]
+            norm = sum(map(lambda x: x*x, n))
+            self.assertAlmostEqual(norm, 1.0)
+
+        f = Face(square, 0)
+        self.assertRaises(RuntimeError, f.normal, 0)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/Mesh.py b/test/unit/mesh/python/Mesh.py
new file mode 100644
index 0000000..a6c1bc2
--- /dev/null
+++ b/test/unit/mesh/python/Mesh.py
@@ -0,0 +1,374 @@
+"Unit tests for the mesh library"
+
+# Copyright (C) 2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Benjamin Kehlet 2012
+# Modified by Marie E. Rognes 2012
+# Modified by Johannes Ring 2013
+# Modified by Jan Blechta 2013
+# Modified by Oeyvind Evju 2013
+#
+# First added:  2006-08-08
+# Last changed: 2014-05-30
+
+import unittest
+import numpy
+from dolfin import *
+
+class MeshConstruction(unittest.TestCase):
+
+    def setUp(self):
+
+        self.interval = UnitIntervalMesh(10)
+        if has_cgal():
+            self.circle = CircleMesh(Point(0.0, 0.0), 1.0, 0.1)
+        self.square = UnitSquareMesh(5, 5)
+        self.rectangle = RectangleMesh(0, 0, 2, 2, 5, 5)
+        self.cube = UnitCubeMesh(3, 3, 3)
+        self.box = BoxMesh(0, 0, 0, 2, 2, 2, 2, 2, 5)
+
+    def testUFLCell(self):
+        import ufl
+        self.assertEqual(ufl.interval, self.interval.ufl_cell())
+        if has_cgal():
+            self.assertEqual(ufl.triangle, self.circle.ufl_cell())
+        self.assertEqual(ufl.triangle, self.square.ufl_cell())
+        self.assertEqual(ufl.triangle, self.rectangle.ufl_cell())
+        self.assertEqual(ufl.tetrahedron, self.cube.ufl_cell())
+        self.assertEqual(ufl.tetrahedron, self.box.ufl_cell())
+
+    def testUFLDomain(self):
+        import ufl
+        def _check_ufl_domain(mesh):
+            domain = mesh.ufl_domain()
+            self.assertEqual(mesh.geometry().dim(), domain.geometric_dimension())
+            self.assertEqual(mesh.topology().dim(), domain.topological_dimension())
+            self.assertTrue(mesh.ufl_cell() == domain.cell())
+            self.assertTrue(str(mesh.id()) in domain.label())
+
+        _check_ufl_domain(self.interval)
+        if has_cgal():
+            _check_ufl_domain(self.circle)
+        _check_ufl_domain(self.square)
+        _check_ufl_domain(self.rectangle)
+        _check_ufl_domain(self.cube)
+        _check_ufl_domain(self.box)
+
+class SimpleShapes(unittest.TestCase):
+
+    def testUnitSquareMesh(self):
+        """Create mesh of unit square."""
+        mesh = UnitSquareMesh(5, 7)
+        self.assertEqual(mesh.size_global(0), 48)
+        self.assertEqual(mesh.size_global(2), 70)
+
+    def testUnitSquareMeshDistributed(self):
+        """Create mesh of unit square."""
+        mesh = UnitSquareMesh(mpi_comm_world(), 5, 7)
+        self.assertEqual(mesh.size_global(0), 48)
+        self.assertEqual(mesh.size_global(2), 70)
+        if has_petsc4py():
+            import petsc4py
+            self.assertTrue(isinstance(mpi_comm_world(), petsc4py.PETSc.Comm))
+            self.assertTrue(isinstance(mesh.mpi_comm(), petsc4py.PETSc.Comm))
+            self.assertEqual(mesh.mpi_comm(), mpi_comm_world())
+
+    def testUnitSquareMeshLocal(self):
+        """Create mesh of unit square."""
+        mesh = UnitSquareMesh(mpi_comm_self(), 5, 7)
+        self.assertEqual(mesh.num_vertices(), 48)
+        self.assertEqual(mesh.num_cells(), 70)
+        if has_petsc4py():
+            import petsc4py
+            self.assertTrue(isinstance(mpi_comm_self(), petsc4py.PETSc.Comm))
+            self.assertTrue(isinstance(mesh.mpi_comm(), petsc4py.PETSc.Comm))
+            self.assertEqual(mesh.mpi_comm(), mpi_comm_self())
+
+    def testUnitCubeMesh(self):
+        """Create mesh of unit cube."""
+        mesh = UnitCubeMesh(5, 7, 9)
+        self.assertEqual(mesh.size_global(0), 480)
+        self.assertEqual(mesh.size_global(3), 1890)
+
+    def testUnitCubeMeshDistributed(self):
+        """Create mesh of unit cube."""
+        mesh = UnitCubeMesh(mpi_comm_world(), 5, 7, 9)
+        self.assertEqual(mesh.size_global(0), 480)
+        self.assertEqual(mesh.size_global(3), 1890)
+
+    def testUnitCubeMeshDistributedLocal(self):
+        """Create mesh of unit cube."""
+        mesh = UnitCubeMesh(mpi_comm_self(), 5, 7, 9)
+        self.assertEqual(mesh.num_vertices(), 480)
+        self.assertEqual(mesh.num_cells(), 1890)
+
+class MeshRefinement(unittest.TestCase):
+
+    def testRefineUnitSquareMesh(self):
+        """Refine mesh of unit square."""
+        mesh = UnitSquareMesh(5, 7)
+        mesh = refine(mesh)
+        self.assertEqual(mesh.size_global(0), 165)
+        self.assertEqual(mesh.size_global(2), 280)
+
+    def testRefineUnitCubeMesh(self):
+        """Refine mesh of unit cube."""
+        mesh = UnitCubeMesh(5, 7, 9)
+        mesh = refine(mesh)
+        self.assertEqual(mesh.size_global(0), 3135)
+        self.assertEqual(mesh.size_global(3), 15120)
+
+class BoundaryExtraction(unittest.TestCase):
+
+    def testBoundaryComputation(self):
+        """Compute boundary of mesh."""
+        mesh = UnitCubeMesh(2, 2, 2)
+        boundary = BoundaryMesh(mesh, "exterior")
+        self.assertEqual(boundary.size_global(0), 26)
+        self.assertEqual(boundary.size_global(2), 48)
+
+        def testBoundaryBoundary(self):
+            """Compute boundary of boundary."""
+            mesh = UnitCubeMesh(2, 2, 2)
+            b0 = BoundaryMesh(mesh, "exterior")
+            b1 = BoundaryMesh(b0, "exterior")
+            self.assertEqual(b1.num_vertices(), 0)
+            self.assertEqual(b1.num_cells(), 0)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class MeshFunctions(unittest.TestCase):
+
+    def setUp(self):
+        self.mesh = UnitSquareMesh(3, 3)
+        self.f = MeshFunction('int', self.mesh, 0)
+
+    def testAssign(self):
+        """Assign value of mesh function."""
+        f = self.f
+        f[3] = 10
+        v = Vertex(self.mesh, 3)
+        self.assertEqual(f[v], 10)
+
+    def testWrite(self):
+        """Construct and save a simple meshfunction."""
+        f = self.f
+        f[0] = 1
+        f[1] = 2
+        file = File("saved_mesh_function.xml")
+        file << f
+
+    def testRead(self):
+        """Construct and save a simple meshfunction. Then read it back from
+        file."""
+        #mf = self.mesh.data().create_mesh_function("mesh_data_function", 2)
+        #print "***************", mf
+        #mf[0] = 3
+        #mf[1] = 4
+
+        #self.f[0] = 1
+        #self.f[1] = 2
+        #file = File("saved_mesh_function.xml")
+        #file << self.f
+        #f = MeshFunction('int', self.mesh, "saved_mesh_function.xml")
+        #assert all(f.array() == self.f.array())
+
+    def testSubsetIterators(self):
+        def inside1(x):
+            return x[0] <= 0.5
+        def inside2(x):
+            return x[0] >= 0.5
+        sd1 = AutoSubDomain(inside1)
+        sd2 = AutoSubDomain(inside2)
+        cf = CellFunction('size_t', self.mesh)
+        cf.set_all(0)
+        sd1.mark(cf, 1)
+        sd2.mark(cf, 2)
+
+        for i in range(3):
+            num = 0
+            for e in SubsetIterator(cf, i):
+                num += 1
+            self.assertEqual(num, 6)
+
+# FIXME: Mesh IO tests should be in io test directory
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class InputOutput(unittest.TestCase):
+
+    def testMeshXML2D(self):
+        """Write and read 2D mesh to/from file"""
+        mesh_out = UnitSquareMesh(3, 3)
+        mesh_in  = Mesh()
+        file = File("unitsquare.xml")
+        file << mesh_out
+        file >> mesh_in
+        self.assertEqual(mesh_in.num_vertices(), 16)
+
+    def testMeshXML3D(self):
+        """Write and read 3D mesh to/from file"""
+        mesh_out = UnitCubeMesh(3, 3, 3)
+        mesh_in  = Mesh()
+        file = File("unitcube.xml")
+        file << mesh_out
+        file >> mesh_in
+        self.assertEqual(mesh_in.num_vertices(), 64)
+
+    def xtestMeshFunction(self):
+        """Write and read mesh function to/from file"""
+        mesh = UnitSquareMesh(1, 1)
+        f = MeshFunction('int', mesh, 0)
+        f[0] = 2
+        f[1] = 4
+        f[2] = 6
+        f[3] = 8
+        file = File("meshfunction.xml")
+        file << f
+        g = MeshFunction('int', mesh, 0)
+        file >> g
+        for v in vertices(mesh):
+            self.assertEqual(f[v], g[v])
+
+class PyCCInterface(unittest.TestCase):
+
+    def testGetGeometricalDimension(self):
+        """Get geometrical dimension of mesh"""
+        mesh = UnitSquareMesh(5, 5)
+        self.assertEqual(mesh.geometry().dim(), 2)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def testGetCoordinates(self):
+        """Get coordinates of vertices"""
+        mesh = UnitSquareMesh(5, 5)
+        self.assertEqual(len(mesh.coordinates()), 36)
+
+    def testGetCells(self):
+        """Get cells of mesh"""
+        mesh = UnitSquareMesh(5, 5)
+        self.assertEqual(MPI.sum(mesh.mpi_comm(), len(mesh.cells())), 50)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class CellRadii(unittest.TestCase):
+
+    def setUp(self):
+        # Create 1D mesh with degenerate cell
+        self.mesh1d = UnitIntervalMesh(4)
+        self.mesh1d.coordinates()[4] = self.mesh1d.coordinates()[3]
+
+        # Create 2D mesh with one equilateral triangle
+        self.mesh2d = UnitSquareMesh(1, 1, 'left')
+        self.mesh2d.coordinates()[3] += 0.5*(sqrt(3.0)-1.0)
+
+        # Create 3D mesh with regular tetrahedron and degenerate cells
+        self.mesh3d = UnitCubeMesh(1, 1, 1)
+        self.mesh3d.coordinates()[2][0] = 1.0
+        self.mesh3d.coordinates()[7][1] = 0.0
+        # Original tetrahedron from UnitCubeMesh(1, 1, 1)
+        self.c0 = Cell(self.mesh3d, 0)
+        # Degenerate cell
+        self.c1 = Cell(self.mesh3d, 1)
+        # Regular tetrahedron with edge sqrt(2)
+        self.c5 = Cell(self.mesh3d, 5)
+
+    def test_cell_inradius(self):
+        self.assertAlmostEqual(self.c0.inradius(), (3.0-sqrt(3.0))/6.0)
+        self.assertAlmostEqual(self.c1.inradius(), 0.0)
+        self.assertAlmostEqual(self.c5.inradius(), sqrt(3.0)/6.0)
+
+    def test_cell_diameter(self):
+        from math import isnan
+        self.assertAlmostEqual(self.c0.diameter(), sqrt(3.0))
+        # Implementation of diameter() does not work accurately
+        # for degenerate cells - sometimes yields NaN
+        self.assertTrue(isnan(self.c1.diameter()))
+        self.assertAlmostEqual(self.c5.diameter(), sqrt(3.0))
+
+    def test_cell_radius_ratio(self):
+        self.assertAlmostEqual(self.c0.radius_ratio(), sqrt(3.0)-1.0)
+        self.assertAlmostEqual(self.c1.radius_ratio(), 0.0)
+        self.assertAlmostEqual(self.c5.radius_ratio(), 1.0)
+
+    def test_hmin_hmax(self):
+        self.assertAlmostEqual(self.mesh1d.hmin(), 0.0)
+        self.assertAlmostEqual(self.mesh1d.hmax(), 0.25)
+        self.assertAlmostEqual(self.mesh2d.hmin(), sqrt(2.0))
+        self.assertAlmostEqual(self.mesh2d.hmax(), 2.0*sqrt(6.0)/3.0)
+        # nans are not taken into account in hmax and hmin
+        self.assertAlmostEqual(self.mesh3d.hmin(), sqrt(3.0))
+        self.assertAlmostEqual(self.mesh3d.hmax(), sqrt(3.0))
+
+    def test_rmin_rmax(self):
+        self.assertAlmostEqual(self.mesh1d.rmin(), 0.0)
+        self.assertAlmostEqual(self.mesh1d.rmax(), 0.125)
+        self.assertAlmostEqual(self.mesh2d.rmin(), 1.0/(2.0+sqrt(2.0)))
+        self.assertAlmostEqual(self.mesh2d.rmax(), sqrt(6.0)/6.0)
+        self.assertAlmostEqual(self.mesh3d.rmin(), 0.0)
+        self.assertAlmostEqual(self.mesh3d.rmax(), sqrt(3.0)/6.0)
+
+class MeshOrientations(unittest.TestCase):
+
+    def setUp(self):
+        pass
+
+    def test_basic_cell_orientations(self):
+        "Test that default cell orientations initialize and update as expected."
+        mesh = UnitIntervalMesh(12)
+        orientations = mesh.cell_orientations()
+        self.assertEqual(len(orientations), mesh.num_cells())
+        for i in range(mesh.num_cells()):
+            self.assertEqual(orientations[i], -1)
+
+        orientations[0] = 1
+        self.assertEqual(mesh.cell_orientations()[0], 1)
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_cell_orientations(self):
+        "Test that cell orientations update as expected."
+        mesh = UnitIntervalMesh(12)
+        mesh.init_cell_orientations(Expression(("0.0", "1.0", "0.0")))
+        for i in range(mesh.num_cells()):
+            self.assertEqual(mesh.cell_orientations()[i], 0)
+
+        mesh = UnitSquareMesh(2, 2)
+        mesh.init_cell_orientations(Expression(("0.0", "0.0", "1.0")))
+        reference = numpy.array((0, 1, 0, 1, 0, 1, 0, 1))
+        # Only compare against reference in serial (don't know how to
+        # compare in parallel)
+        for i in range(mesh.num_cells()):
+            self.assertEqual(mesh.cell_orientations()[i], reference[i])
+
+        mesh = BoundaryMesh(UnitSquareMesh(2, 2), "exterior")
+        mesh.init_cell_orientations(Expression(("x[0]", "x[1]", "x[2]")))
+        print mesh.cell_orientations()
+
+class MeshSharedEntities(unittest.TestCase):
+    def test_shared_entities(self):
+        for ind, MeshClass in enumerate([UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh]):
+            if MeshClass not in [UnitSquareMesh]:
+                continue
+            dim = ind+1
+            args = [4]*dim
+            mesh = MeshClass(*args)
+            mesh.init()
+
+            # FIXME: Implement a proper test
+            for shared_dim in range(dim):
+                self.assertTrue(isinstance(mesh.topology().shared_entities(shared_dim), dict))
+                self.assertTrue(isinstance(mesh.topology().global_indices(shared_dim), numpy.ndarray))
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshColoring.py b/test/unit/mesh/python/MeshColoring.py
new file mode 100644
index 0000000..1af959a
--- /dev/null
+++ b/test/unit/mesh/python/MeshColoring.py
@@ -0,0 +1,41 @@
+"""Unit tests for mesh coloring"""
+
+# Copyright (C) 2013 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-08-10
+# Last changed:
+
+import unittest
+from dolfin import *
+
+class MeshColoring(unittest.TestCase):
+
+    def test_by_entity_cell_coloring(self):
+        """Color mesh cells by connections."""
+
+        # Get coloring libraries
+        coloring_libraries =  parameters.get_range("graph_coloring_library")
+        for coloring_library in coloring_libraries:
+            parameters["graph_coloring_library"] = coloring_library
+            mesh = UnitCubeMesh(16, 16, 16)
+            mesh.color("vertex")
+            mesh.color("edge")
+            mesh.color("facet")
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshData.py b/test/unit/mesh/python/MeshData.py
new file mode 100644
index 0000000..a6a339f
--- /dev/null
+++ b/test/unit/mesh/python/MeshData.py
@@ -0,0 +1,40 @@
+"Unit tests for the MeshData class"
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-08-22
+# Last changed: 2011-08-22
+
+import unittest
+from dolfin import *
+
+class MeshData(unittest.TestCase):
+
+    def test_meshfunction(self):
+        "Test input/output"
+
+        mesh = UnitCubeMesh(3, 3, 3)
+
+        f = mesh.data().create_array("foo", 3)
+        #f[:] = 0.0
+        #g = mesh.data().array("foo")
+
+        #self.assertEqual(len(g), mesh.num_vertices())
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshEditor.py b/test/unit/mesh/python/MeshEditor.py
new file mode 100644
index 0000000..46057e0
--- /dev/null
+++ b/test/unit/mesh/python/MeshEditor.py
@@ -0,0 +1,52 @@
+"Unit tests for the MeshEditor class"
+
+# Copyright (C) 2006-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2006-08-08
+# Last changed: 2014-02-06
+
+import unittest
+import numpy
+from dolfin import *
+
+class MeshEditorTest(unittest.TestCase):
+
+    def test_triangle_mesh(self):
+
+        # Create mesh object and open editor
+        mesh = Mesh()
+        editor = MeshEditor()
+        editor.open(mesh, 2, 2)
+        editor.init_vertices(3) # test both versions of interface
+        editor.init_vertices_global(3, 3)
+        editor.init_cells(1)    # test both versions of interface
+        editor.init_cells_global(1, 1)
+
+        # Add vertices
+        editor.add_vertex(0, 0.0, 0.0)
+        editor.add_vertex(1, 1.0, 0.0)
+        editor.add_vertex(2, 0.0, 1.0)
+
+        # Add cell
+        editor.add_cell(0, 0, 1, 2)
+
+        # Close editor
+        editor.close()
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshFunction.py b/test/unit/mesh/python/MeshFunction.py
new file mode 100644
index 0000000..56d3650
--- /dev/null
+++ b/test/unit/mesh/python/MeshFunction.py
@@ -0,0 +1,131 @@
+"""Unit tests for MeshFunctions"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-03-10
+# Last changed: 2011-03-10
+
+import unittest
+import numpy.random
+from dolfin import *
+
+class NamedMeshFunctions(unittest.TestCase):
+
+    def setUp(self):
+        #self.names = ["Cell", "Vertex", "Edge", "Face", "Facet"]
+        #self.tps = ['int', 'size_t', 'bool', 'double']
+        self.names = ["Cell", "Vertex", "Edge", "Face", "Facet"]
+        self.tps = ['int', 'size_t', 'bool', 'double']
+        self.mesh = UnitCubeMesh(3, 3, 3)
+        self.funcs = {}
+        for tp in self.tps:
+            for name in self.names:
+                self.funcs[(tp, name)] = eval("%sFunction('%s', self.mesh)"%\
+                                              (name, tp))
+
+    def test_size(self):
+        for tp in self.tps:
+            for name in self.names:
+                if name is "Vertex":
+                    a = len(self.funcs[(tp, name)])
+                    b = self.mesh.num_vertices()
+                    self.assertEqual(a, b)
+                else:
+                    a = len(self.funcs[(tp, name)])
+                    b = getattr(self.mesh, "num_%ss"%name.lower())()
+                    self.assertEqual(a, b)
+
+    def test_access_type(self):
+        type_dict = dict(int=int, size_t=int, double=float, bool=bool)
+        for tp in self.tps:
+            for name in self.names:
+                self.assertTrue(isinstance(self.funcs[(tp, name)][0], \
+                                           type_dict[tp]))
+
+    def test_numpy_access(self):
+        for tp in self.tps:
+            for name in self.names:
+                values = self.funcs[(tp, name)].array()
+                values[:] = numpy.random.rand(len(values))
+                self.assertTrue(all(values[i]==self.funcs[(tp, name)][i]
+                                    for i in xrange(len(values))))
+
+    def test_iterate(self):
+        for tp in self.tps:
+            for name in self.names:
+                for index, value in enumerate(self.funcs[(tp, name)]):
+                    pass
+                self.assertEqual(index, len(self.funcs[(tp, name)])-1)
+                self.assertRaises(IndexError, self.funcs[(tp, name)].__getitem__, len(self.funcs[(tp, name)]))
+
+    def test_setvalues(self):
+        for tp in self.tps:
+            if tp == 'bool':
+                continue
+            for name in self.names:
+                self.assertRaises(TypeError, self.funcs[(tp, name)].__setitem__, len(self.funcs[(tp, name)])-1, "jada")
+                
+class MeshFunctions(unittest.TestCase):
+
+    def setUp(self):
+        self.mesh = UnitCubeMesh(8, 8, 8)
+        self.f = MeshFunction('int', self.mesh, 0)
+
+    def testCreate(self):
+        """Create MeshFunctions."""
+        v = MeshFunction("size_t", self.mesh)
+
+        v = MeshFunction("size_t", self.mesh, 0)
+        self.assertEqual(v.size(), self.mesh.num_vertices())
+
+        v = MeshFunction("size_t", self.mesh, 1)
+        self.assertEqual(v.size(), self.mesh.num_edges())
+
+        v = MeshFunction("size_t", self.mesh, 2)
+        self.assertEqual(v.size(), self.mesh.num_facets())
+
+        v = MeshFunction("size_t", self.mesh, 3)
+        self.assertEqual(v.size(), self.mesh.num_cells())
+
+    def testCreateAssign(self):
+        """Create MeshFunctions with value."""
+        i = 10
+        v = MeshFunction("size_t", self.mesh, 0, i)
+        self.assertEqual(v.size(), self.mesh.num_vertices())
+        self.assertEqual(v[0], i)
+
+        v = MeshFunction("size_t", self.mesh, 1, i)
+        self.assertEqual(v.size(), self.mesh.num_edges())
+        self.assertEqual(v[0], i)
+
+        v = MeshFunction("size_t", self.mesh, 2, i)
+        self.assertEqual(v.size(), self.mesh.num_facets())
+        self.assertEqual(v[0], i)
+
+        v = MeshFunction("size_t", self.mesh, 3, i)
+        self.assertEqual(v.size(), self.mesh.num_cells())
+        self.assertEqual(v[0], i)
+
+    def testAssign(self):
+        f = self.f
+        f[3] = 10
+        v = Vertex(self.mesh, 3)
+        self.assertEqual(f[v], 10)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshIterator.py b/test/unit/mesh/python/MeshIterator.py
new file mode 100644
index 0000000..442579c
--- /dev/null
+++ b/test/unit/mesh/python/MeshIterator.py
@@ -0,0 +1,148 @@
+"Unit tests for MeshIterator and subclasses"
+
+# Copyright (C) 2006-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2006-08-08
+# Last changed: 2011-08-21
+
+import unittest
+import numpy
+from dolfin import *
+
+class MeshIterator(unittest.TestCase):
+
+    def test_vertex_iterators(self):
+        "Iterate over vertices"
+
+        mesh = UnitCubeMesh(5, 5, 5)
+
+        # Test connectivity
+        cons = [(i, mesh.topology()(0,i)) for i in xrange(4)]
+
+        # Test writability
+        for i, con in cons:
+            def assign(con, i):
+                con(i)[0] = 1
+            self.assertRaises(StandardError, assign, con, i)
+
+        n = 0
+        for i, v in enumerate(vertices(mesh)):
+            n += 1
+            for j, con in cons:
+                self.assertTrue(numpy.all(con(i) == v.entities(j)))
+
+        self.assertEqual(n, mesh.num_vertices())
+
+        # Check coordinate assignment
+        # FIXME: Outcomment to hopefully please Mac-buildbot
+        #end_point = numpy.array([v.x(0), v.x(1), v.x(2)])
+        #mesh.coordinates()[:] += 2
+        #self.assertEqual(end_point[0] + 2, mesh.coordinates()[-1,0])
+        #self.assertEqual(end_point[1] + 2, mesh.coordinates()[-1,1])
+        #self.assertEqual(end_point[2] + 2, mesh.coordinates()[-1,2])
+
+    def test_edge_iterators(self):
+        "Iterate over edges"
+
+        mesh = UnitCubeMesh(5, 5, 5)
+
+        # Test connectivity
+        cons = [(i, mesh.topology()(1,i)) for i in xrange(4)]
+
+        # Test writability
+        for i, con in cons:
+            def assign(con, i):
+                con(i)[0] = 1
+            self.assertRaises(StandardError, assign, con, i)
+
+        n = 0
+        for i, e in enumerate(edges(mesh)):
+            n += 1
+            for j, con in cons:
+                self.assertTrue(numpy.all(con(i) == e.entities(j)))
+
+        self.assertEqual(n, mesh.num_edges())
+
+    def test_face_iterator(self):
+        "Iterate over faces"
+
+        mesh = UnitCubeMesh(5, 5, 5)
+
+        # Test connectivity
+        cons = [(i, mesh.topology()(2,i)) for i in xrange(4)]
+
+        # Test writability
+        for i, con in cons:
+            def assign(con, i):
+                con(i)[0] = 1
+            self.assertRaises(StandardError, assign, con, i)
+
+        n = 0
+        for i, f in enumerate(faces(mesh)):
+            n += 1
+            for j, con in cons:
+                self.assertTrue(numpy.all(con(i) == f.entities(j)))
+
+        self.assertEqual(n, mesh.num_faces())
+
+    def test_facet_iterators(self):
+        "Iterate over facets"
+        mesh = UnitCubeMesh(5, 5, 5)
+        n = 0
+        for f in facets(mesh):
+            n += 1
+        self.assertEqual(n, mesh.num_facets())
+
+    def test_cell_iterators(self):
+        "Iterate over cells"
+        mesh = UnitCubeMesh(5, 5, 5)
+
+        # Test connectivity
+        cons = [(i, mesh.topology()(3,i)) for i in xrange(4)]
+
+        # Test writability
+        for i, con in cons:
+            def assign(con, i):
+                con(i)[0] = 1
+            self.assertRaises(StandardError, assign, con, i)
+
+        n = 0
+        for i, c in enumerate(cells(mesh)):
+            n += 1
+            for j, con in cons:
+                self.assertTrue(numpy.all(con(i) == c.entities(j)))
+
+        self.assertEqual(n, mesh.num_cells())
+
+        # Test non destruction of MeshEntities
+        cell_list = [c for c in cells(mesh)]
+        self.assertEqual(sum(c.volume() for c in cell_list), \
+                         sum(c.volume() for c in cells(mesh)))
+
+    def test_mixed_iterators(self):
+        "Iterate over vertices of cells"
+
+        mesh = UnitCubeMesh(5, 5, 5)
+        n = 0
+        for c in cells(mesh):
+            for v in vertices(c):
+                n += 1
+        self.assertEqual(n, 4*mesh.num_cells())
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshMarkers.py b/test/unit/mesh/python/MeshMarkers.py
new file mode 100644
index 0000000..e6a6844
--- /dev/null
+++ b/test/unit/mesh/python/MeshMarkers.py
@@ -0,0 +1,67 @@
+"""Unit tests for the class MeshMarkers. These unit test actually test
+a bit more than that, since they also test marking of meshes and the
+interaction between Mesh - MeshDomains - MeshMarkers"""
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-09-01
+# Last changed: 2011-09-02
+
+import unittest
+from dolfin import *
+
+class XMLMesMarkers(unittest.TestCase):
+
+    def test_subdomain_marking(self):
+        "Test setting markers from subdomains"
+
+        # Define subdomains for 5 of the 6 faces of the unit cube
+        class F0(SubDomain):
+            def inside(self, x, inside):
+                return near(x[0], 0.0)
+        class F1(SubDomain):
+            def inside(self, x, inside):
+                return near(x[0], 1.0)
+        class F2(SubDomain):
+            def inside(self, x, inside):
+                return near(x[1], 0.0)
+        class F3(SubDomain):
+            def inside(self, x, inside):
+                return near(x[1], 1.0)
+        class F4(SubDomain):
+            def inside(self, x, inside):
+                return near(x[2], 0.0)
+        f0 = F0()
+        f1 = F1()
+        f2 = F2()
+        f3 = F3()
+        f4 = F4()
+
+        # Apply markers to unit cube
+        mesh = UnitCubeMesh(3, 3, 3)
+        f0.mark_facets(mesh, 0)
+        f1.mark_facets(mesh, 1)
+        f2.mark_facets(mesh, 2)
+        f3.mark_facets(mesh, 3)
+        f4.mark_facets(mesh, 4)
+
+        # FIXME: Add test here
+        self.assertEqual(0, 0)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshQuality.py b/test/unit/mesh/python/MeshQuality.py
new file mode 100644
index 0000000..cf225c3
--- /dev/null
+++ b/test/unit/mesh/python/MeshQuality.py
@@ -0,0 +1,114 @@
+"Unit tests for the MeshQuality class"
+
+# Copyright (C) 2013 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-10-07
+# Last changed:
+
+import unittest
+import numpy
+from dolfin import *
+
+class MeshQualityTest(unittest.TestCase):
+
+    def test_radius_ratio_triangle(self):
+
+        # Create mesh and compute rations
+        mesh = UnitSquareMesh(12, 12)
+        ratios = MeshQuality.radius_ratios(mesh)
+        for c in cells(mesh):
+            self.assertAlmostEqual(ratios[c], 0.828427124746)
+
+    def test_radius_ratio_tetrahedron(self):
+
+        # Create mesh and compute ratios
+        mesh = UnitCubeMesh(14, 14, 14)
+        ratios = MeshQuality.radius_ratios(mesh)
+        for c in cells(mesh):
+            self.assertAlmostEqual(ratios[c], 0.717438935214)
+            #print ratio[c]
+
+    def test_radius_ratio_triangle_min_max(self):
+
+        # Create mesh, collpase and compute min ratio
+        mesh = UnitSquareMesh(12, 12)
+
+        rmin, rmax = MeshQuality.radius_ratio_min_max(mesh)
+        self.assertTrue(rmax <= rmax)
+
+        x = mesh.coordinates()
+        x[:, 0] *= 0.0
+        rmin, rmax = MeshQuality.radius_ratio_min_max(mesh)
+        self.assertAlmostEqual(rmin, 0.0)
+        self.assertAlmostEqual(rmax, 0.0)
+
+    def test_radius_ratio_tetrahedron_min_max(self):
+
+        # Create mesh, collpase and compute min ratio
+        mesh = UnitCubeMesh(12, 12, 12)
+
+        rmin, rmax = MeshQuality.radius_ratio_min_max(mesh)
+        self.assertTrue(rmax <= rmax)
+
+        x = mesh.coordinates()
+        x[:, 0] *= 0.0
+        rmin, rmax = MeshQuality.radius_ratio_min_max(mesh)
+        self.assertAlmostEqual(rmax, 0.0)
+        self.assertAlmostEqual(rmax, 0.0)
+
+    def test_radius_ratio_matplotlib(self):
+
+        # Create mesh, collpase and compute min ratio
+        mesh = UnitCubeMesh(12, 12, 12)
+        test = MeshQuality.radius_ratio_matplotlib_histogram(mesh, 5)
+        print test
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class CellRadii(unittest.TestCase):
+
+    def setUp(self):
+
+        # Create 1D mesh with degenerate cell
+        self.mesh1d = UnitIntervalMesh(4)
+        self.mesh1d.coordinates()[4] = self.mesh1d.coordinates()[3]
+
+        # Create 2D mesh with one equilateral triangle
+        self.mesh2d = UnitSquareMesh(1, 1, 'left')
+        self.mesh2d.coordinates()[3] += 0.5*(sqrt(3.0)-1.0)
+
+        # Create 3D mesh with regular tetrahedron and degenerate cells
+        self.mesh3d = UnitCubeMesh(1, 1, 1)
+        self.mesh3d.coordinates()[2][0] = 1.0
+        self.mesh3d.coordinates()[7][1] = 0.0
+
+    def test_radius_ratio_min_radius_ratio_max(self):
+
+        rmin, rmax = MeshQuality.radius_ratio_min_max(self.mesh1d)
+        self.assertAlmostEqual(rmin, 0.0)
+        self.assertAlmostEqual(rmax, 1.0)
+
+        rmin, rmax = MeshQuality.radius_ratio_min_max(self.mesh2d)
+        self.assertAlmostEqual(rmin, 2.0*sqrt(2.0)/(2.0+sqrt(2.0)) )
+        self.assertAlmostEqual(rmax, 1.0)
+
+        rmin, rmax = MeshQuality.radius_ratio_min_max(self.mesh3d)
+        self.assertAlmostEqual(rmin, 0.0)
+        self.assertAlmostEqual(rmax, 1.0)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshTransformation.py b/test/unit/mesh/python/MeshTransformation.py
new file mode 100644
index 0000000..a03a8cf
--- /dev/null
+++ b/test/unit/mesh/python/MeshTransformation.py
@@ -0,0 +1,54 @@
+"Unit tests for the mesh library"
+
+# Copyright (C) 2012 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-01-16
+# Last changed: 2013-06-28
+
+import unittest
+from dolfin import *
+
+class MeshTransformation(unittest.TestCase):
+
+    def test_translate_2d(self):
+        mesh = UnitSquareMesh(8, 8)
+        p = Point(1, 2)
+        mesh.translate(p)
+
+    def test_translate_3d(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        p = Point(1, 2, 3)
+        mesh.translate(p)
+
+    def test_rotate_2d(self):
+        mesh = UnitSquareMesh(8, 8)
+        p = Point(1, 2)
+        mesh.rotate(10)
+        mesh.rotate(10, 2)
+        mesh.rotate(10, 2, p)
+
+    def test_rotate_3d(self):
+        mesh = UnitCubeMesh(8, 8, 8)
+        p = Point(1, 2, 3)
+        mesh.rotate(30, 0)
+        mesh.rotate(30, 1)
+        mesh.rotate(30, 2)
+        mesh.rotate(30, 0, p)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/MeshValueCollection.py b/test/unit/mesh/python/MeshValueCollection.py
new file mode 100644
index 0000000..cd60b39
--- /dev/null
+++ b/test/unit/mesh/python/MeshValueCollection.py
@@ -0,0 +1,172 @@
+"""Unit tests for MeshValueCollection"""
+
+# Copyright (C) 2011 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-03-10
+# Last changed: 2011-03-10
+
+import unittest
+import numpy.random
+from dolfin import *
+
+class MeshValueCollections(unittest.TestCase):
+
+    def test_assign_2D_cells(self):
+        mesh = UnitSquareMesh(3, 3)
+        ncells = mesh.num_cells()
+        f = MeshValueCollection("int", mesh, 2)
+        all_new = True
+        for cell in cells(mesh):
+            value = ncells - cell.index()
+            all_new = all_new and f.set_value(cell.index(), value)
+        g = MeshValueCollection("int", mesh, 2)
+        g.assign(f)
+        self.assertEqual(ncells, f.size())
+        self.assertEqual(ncells, g.size())
+        self.assertTrue(all_new)
+
+        for cell in cells(mesh):
+            value = ncells - cell.index()
+            self.assertEqual(value, g.get_value(cell.index(), 0))
+
+        old_value = g.get_value(0,0)
+        g.set_value(0, 0, old_value+1)
+        self.assertEqual(old_value+1, g.get_value(0, 0))
+
+    def test_assign_2D_facets(self):
+        mesh = UnitSquareMesh(3, 3)
+        mesh.init(2,1)
+        ncells = mesh.num_cells()
+        f = MeshValueCollection("int", mesh, 1)
+        all_new = True
+        for cell in cells(mesh):
+            value = ncells - cell.index()
+            for i, facet in enumerate(facets(cell)):
+                all_new = all_new and f.set_value(cell.index(), i, value + i)
+
+        g = MeshValueCollection("int", mesh, 1)
+        g.assign(f)
+        self.assertEqual(ncells*3, f.size())
+        self.assertEqual(ncells*3, g.size())
+        self.assertTrue(all_new)
+
+        for cell in cells(mesh):
+            value = ncells - cell.index()
+            for i, facet in enumerate(facets(cell)):
+                self.assertEqual(value+i, g.get_value(cell.index(), i))
+
+    def test_assign_2D_vertices(self):
+        mesh = UnitSquareMesh(3, 3)
+        mesh.init(2,0)
+        ncells = mesh.num_cells()
+        f = MeshValueCollection("int", mesh, 0)
+        all_new = True
+        for cell in cells(mesh):
+            value = ncells - cell.index()
+            for i, vert in enumerate(vertices(cell)):
+                all_new = all_new and f.set_value(cell.index(), i, value+i)
+
+        g = MeshValueCollection("int", mesh, 0)
+        g.assign(f)
+        self.assertEqual(ncells*3, f.size())
+        self.assertEqual(ncells*3, g.size())
+        self.assertTrue(all_new)
+
+        for cell in cells(mesh):
+            value = ncells - cell.index()
+            for i, vert in enumerate(vertices(cell)):
+                self.assertEqual(value+i, g.get_value(cell.index(), i))
+
+    def test_mesh_function_assign_2D_cells(self):
+        mesh = UnitSquareMesh(3, 3)
+        ncells = mesh.num_cells()
+        f = CellFunction("int", mesh)
+        for cell in cells(mesh):
+            f[cell] = ncells - cell.index()
+
+        g = MeshValueCollection("int", mesh, 2)
+        g.assign(f)
+        self.assertEqual(ncells, f.size())
+        self.assertEqual(ncells, g.size())
+
+        f2 = MeshFunction("int", mesh, g)
+
+        for cell in cells(mesh):
+            value = ncells - cell.index()
+            self.assertEqual(value, g.get_value(cell.index(), 0))
+            self.assertEqual(f2[cell], g.get_value(cell.index(), 0))
+
+        h = MeshValueCollection("int", mesh, 2)
+        global_indices = mesh.topology().global_indices(2)
+        ncells_global = mesh.size_global(2)
+        for cell in cells(mesh):
+            if global_indices[cell.index()] in [5,8,10]:
+                continue
+            value = ncells_global - global_indices[cell.index()]
+            h.set_value(cell.index(), int(value))
+
+        f3 = MeshFunction("int", mesh, h)
+
+        values = f3.array()
+        values[values>ncells_global] = 0.
+
+        info(str(values))
+        info(str(values.sum()))
+
+        self.assertEqual(MPI.sum(mesh.mpi_comm(), values.sum()*1.0), 140.)
+
+    def test_mesh_function_assign_2D_facets(self):
+        mesh = UnitSquareMesh(3, 3)
+        mesh.init(1)
+        f = FacetFunction("int", mesh, 25)
+        for cell in cells(mesh):
+            for i, facet in enumerate(facets(cell)):
+                self.assertEqual(25, f[facet])
+
+        g = MeshValueCollection("int", mesh, 1)
+        g.assign(f)
+        self.assertEqual(mesh.num_facets(), f.size())
+        self.assertEqual(mesh.num_cells()*3, g.size())
+        for cell in cells(mesh):
+            for i, facet in enumerate(facets(cell)):
+                self.assertEqual(25, g.get_value(cell.index(), i))
+
+        f2 = MeshFunction("int", mesh, g)
+
+        for cell in cells(mesh):
+            for i, facet in enumerate(facets(cell)):
+                self.assertEqual(f2[facet], g.get_value(cell.index(), i))
+
+    def test_mesh_function_assign_2D_vertices(self):
+        mesh = UnitSquareMesh(3, 3)
+        mesh.init(0)
+        f = VertexFunction("int", mesh, 25)
+        g = MeshValueCollection("int", mesh, 0)
+        g.assign(f)
+        self.assertEqual(mesh.num_vertices(), f.size())
+        self.assertEqual(mesh.num_cells()*3, g.size())
+
+        f2 = MeshFunction("int", mesh, g)
+
+        for cell in cells(mesh):
+            for i, vert in enumerate(vertices(cell)):
+                self.assertEqual(25, g.get_value(cell.index(), i))
+                self.assertEqual(f2[vert], g.get_value(cell.index(), i))
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/PeriodicBoundaryComputation.py b/test/unit/mesh/python/PeriodicBoundaryComputation.py
new file mode 100644
index 0000000..91efb5e
--- /dev/null
+++ b/test/unit/mesh/python/PeriodicBoundaryComputation.py
@@ -0,0 +1,62 @@
+"""Unit tests for PeriodicBoundaryComputation"""
+
+# Copyright (C) 2013 Mikael Mortensen
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-04-12
+# Last changed: 2014-05-30
+
+import unittest
+import numpy as np
+from dolfin import *
+
+class PeriodicBoundary(SubDomain):
+    def inside(self, x, on_boundary):
+        return x[0] < DOLFIN_EPS
+    def map(self, x, y):
+        y[0] = x[0] - 1.0
+        y[1] = x[1]
+
+# Create instance of PeriodicBoundaryComputation
+periodic_boundary = PeriodicBoundary()
+pbc = PeriodicBoundaryComputation()
+mesh = UnitSquareMesh(4, 4)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class PeriodicBoundaryComputations(unittest.TestCase):
+
+    def testComputePeriodicPairs(self):
+
+        # Verify that correct number of periodic pairs are computed
+        vertices = pbc.compute_periodic_pairs(mesh, periodic_boundary, 0)
+        edges    = pbc.compute_periodic_pairs(mesh, periodic_boundary, 1)
+        self.assertEqual(len(vertices), 5)
+        self.assertEqual(len(edges), 4)
+
+    def testMastersSlaves(self):
+
+        # Verify that correct number of masters and slaves are marked
+        mf = pbc.masters_slaves(mesh, periodic_boundary, 0)
+        self.assertEqual(len(np.where(mf.array() == 1)[0]), 5)
+        self.assertEqual(len(np.where(mf.array() == 2)[0]), 5)
+
+        mf = pbc.masters_slaves(mesh, periodic_boundary, 1)
+        self.assertEqual(len(np.where(mf.array() == 1)[0]), 4)
+        self.assertEqual(len(np.where(mf.array() == 2)[0]), 4)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/SubDomain.py b/test/unit/mesh/python/SubDomain.py
new file mode 100644
index 0000000..53fa6dc
--- /dev/null
+++ b/test/unit/mesh/python/SubDomain.py
@@ -0,0 +1,100 @@
+"""Unit tests for SubDomain"""
+
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-06-24
+# Last changed: 2013-06-24
+
+import unittest
+import numpy as np
+from dolfin import *
+
+class SubDomainTester(unittest.TestCase):
+
+    def test_compiled_subdomains(self):
+        def noDefaultValues():
+            CompiledSubDomain("a")
+
+        def wrongDefaultType():
+            CompiledSubDomain("a", a="1")
+
+        def wrongParameterNames():
+            CompiledSubDomain("long", str=1.0)
+
+        self.assertRaises(RuntimeError, noDefaultValues)
+        self.assertRaises(TypeError, wrongDefaultType)
+        self.assertRaises(RuntimeError, wrongParameterNames)
+
+    def test_creation_and_marking(self):
+
+        class Left(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] < DOLFIN_EPS
+
+        class Right(SubDomain):
+            def inside(self, x, on_boundary):
+                return x[0] > 1.0 - DOLFIN_EPS
+
+        subdomain_pairs = [(Left(), Right()),
+                           (AutoSubDomain(\
+                               lambda x, on_boundary: x[0] < DOLFIN_EPS),
+                            AutoSubDomain(\
+                                lambda x, on_boundary: x[0] > 1.0 - DOLFIN_EPS)),
+                           (CompiledSubDomain("near(x[0], a)", a = 0.0),
+                            CompiledSubDomain("near(x[0], a)", a = 1.0)),
+                           (CompiledSubDomain("near(x[0], 0.0)"),
+                            CompiledSubDomain("near(x[0], 1.0)"))]
+
+        for ind, MeshClass in enumerate([UnitIntervalMesh, UnitSquareMesh, UnitCubeMesh]):
+            dim = ind+1
+            args = [10]*dim
+            mesh = MeshClass(*args)
+
+            mesh.init()
+
+            for left, right in subdomain_pairs:
+
+                for MeshFunc, f_dim in [(VertexFunction, 0),
+                                        (FacetFunction, dim-1),
+                                        (CellFunction, dim)]:
+                    f = MeshFunc("size_t", mesh, 0)
+
+                    left.mark(f, 1)
+                    right.mark(f, 2)
+
+                    correct = {(1,0):1,
+                               (1,0):1,
+                               (1,1):0,
+                               (2,0):11,
+                               (2,1):10,
+                               (2,2):0,
+                               (3,0):121,
+                               (3,2):200,
+                               (3,3):0}
+
+                    # Check that the number of marked entities are at least the
+                    # correct number (it can be larger in parallel)
+                    self.assertTrue(all(value >= correct[dim, f_dim]
+                                        for value in [
+                                            MPI.sum(mesh.mpi_comm(), float((f.array()==2).sum())),
+                                            MPI.sum(mesh.mpi_comm(), float((f.array()==1).sum())),
+                                            ]))
+
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/mesh/python/SubMesh.py b/test/unit/mesh/python/SubMesh.py
new file mode 100644
index 0000000..fd4463c
--- /dev/null
+++ b/test/unit/mesh/python/SubMesh.py
@@ -0,0 +1,107 @@
+"Unit tests for the mesh library"
+
+# Copyright (C) 2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-02-06
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class SubMeshTester(unittest.TestCase):
+
+    def test_creation(self):
+        """Create SubMesh."""
+        for MeshClass, args in [(UnitIntervalMesh, (10,)),
+                                (UnitSquareMesh, (10, 10)),
+                                (UnitCubeMesh, (10,10,10))]:
+
+            mesh = MeshClass(*args)
+            dim_t = mesh.topology().dim()
+            mesh.domains().init(dim_t)
+            domains = CellFunction("size_t", mesh, 0)
+            for cell in cells(mesh):
+                # Mark half the cells
+                if cell.index()>mesh.num_cells()/2:
+                    break
+                domains[cell] = 1
+                mesh.domains().set_marker((cell.index(), 1), dim_t)
+
+            # Create mesh from stored MeshValueCollection and
+            # external CellFunction
+            smesh0 = SubMesh(mesh, 1)
+            smesh1 = SubMesh(mesh, domains, 1)
+            self.assertEqual(smesh0.num_cells(), smesh1.num_cells())
+            self.assertEqual(smesh0.num_vertices(), smesh1.num_vertices())
+
+            # Check that we create the same sub mesh with the same
+            # MeshValueCollection
+            for cell0, cell1 in zip(cells(smesh0), cells(smesh1)):
+                self.assertEqual(cell0.index(), cell1.index())
+                self.assertEqual(smesh0.domains().get_marker(cell0.index(),\
+                                                                 dim_t),
+                                 smesh1.domains().get_marker(cell1.index(),\
+                                                                 dim_t))
+
+            self.assertRaises(RuntimeError, SubMesh, (mesh, 2))
+            mesh = MeshClass(*args)
+            self.assertRaises(RuntimeError, SubMesh, (mesh, 1))
+
+    def test_facet_domain_propagation(self):
+
+        # Boxes contains two subdomains with marked faces between
+        # them.  These faces are marked with 5, 10, 15.
+        mesh = Mesh("../boxes.xml.gz")
+        inner = SubMesh(mesh, 1)
+        outer = SubMesh(mesh, 2)
+
+        # Test dict interface
+        D = mesh.topology().dim() - 1
+        parent_facets = mesh.domains().markers(D)
+        inner_facets = inner.domains().markers(D)
+        outer_facets = outer.domains().markers(D)
+
+        for value in [5, 10, 15]:
+            sum_parent = 0
+            sum_inner  = 0
+            sum_outer  = 0
+            for key, val in parent_facets.iteritems():
+                if val == value: sum_parent += val
+            for key, val in inner_facets.iteritems():
+                if val == value: sum_inner += val
+            for key, val in outer_facets.iteritems():
+                if val == value: sum_outer += val
+
+            self.assertEqual(sum_outer, sum_inner)
+            self.assertEqual(sum_outer, sum_parent)
+
+        # Test Meshfunction interface
+        parent_facets = MeshFunction("size_t", mesh, D, mesh.domains())
+        inner_facets = MeshFunction("size_t", inner, D, inner.domains())
+        outer_facets = MeshFunction("size_t", outer, D, outer.domains())
+
+        # Check we have the same number of value-marked facets
+        for value in [5, 10, 15]:
+            self.assertEqual((inner_facets.array()==value).sum(),
+                             (outer_facets.array()==value).sum())
+            self.assertEqual((parent_facets.array()==value).sum(),
+                             (outer_facets.array()==value).sum())
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/meshconvert/python/data/abaqus.inp b/test/unit/meshconvert/python/data/abaqus.inp
new file mode 100644
index 0000000..d670461
--- /dev/null
+++ b/test/unit/meshconvert/python/data/abaqus.inp
@@ -0,0 +1,79 @@
+*HEADING
+Test input
+*Node, NSET=CORNER
+100, 0., 0., 0
+180, 1., 0., 0
+810, 0., 1., 0
+818, 1., 1., 0
+200, 10., 10., 10
+201, 10., 10., 11
+** Note that this node is not in a set
+*NODE
+1000, 0.0, 0.0, 0.0
+1001, 1., 0., 0
+1002, 0., 1., 0
+1003, 1., 1., 0
+1004, 10., 10., 10
+1005, 10., 10., 11
+*NGEN, NSET=LEFT
+100, 810, 200
+*NGEN, NSET=RIGHT
+180, 818, 200
+*NFILL, NSET=MIDDLE
+LEFT, RIGHT, 80, 1
+*NSET, NSET=ALL
+LEFT, RIGHT, MIDDLE, CORNER
+**
+**
+*ELEMENT, TYPE=C3D4, ELSET=FIRST
+1, 100, 180, 810, 818
+*ELEMENT, TYPE=C3D4, ELSET=SECOND
+2, 100, 180, 200, 201
+** Note that this element is not in a set
+*ELEMENT, TYPE=C3D4
+3, 810, 818, 200, 201
+*ELGEN, ELSET=MOST
+1, 40, 2, 1, 40, 200, 40, 1
+*ELSET, ELSET=ALL
+FIRST, MOST
+**
+**
+*SOLID SECTION, ELSET=FIRST, MATERIAL=HY100
+*MATERIAL,NAME=HY100
+*ELASTIC
+180.0E+09,0.3
+*DENSITY
+7.7E+3
+*SOLID SECTION, ELSET=SECOND, MATERIAL=HY200
+*MATERIAL,NAME=HY200
+*MATERIAL,NAME=HY300
+**
+**
+*NSET, NSET=CENTER, GENERATE
+3736,4536,200
+3738,4538,200
+3740,4540,200
+3742,4542,200
+3744,4544,200
+**
+**
+*BOUNDARY
+LEFT, 1, 5, 0.
+RIGHT, 1, 5, 0.
+**
+**
+*PREPRINT, MODEL=NO, ECHO=NO
+*AMPLITUDE, NAME=ATONCE
+0., 0., 1e-6, 1., 2e-6, 1., 3e-6, 0., 5, 0.
+*STEP, NLGEOM=YES
+*DYNAMIC, EXPLICIT
+ , 1.e-4,
+*CLOAD, AMPLITUDE=ATONCE
+CENTER, 3, -1.e8
+*HISTORY OUTPUT, TIME INTERVAL=1e-4
+*NODE HISTORY, NSET=ALL
+U
+*FILE OUTPUT, NUMBER INTERVAL=1
+*NODE FILE, NSET=ALL
+U
+*END STEP
diff --git a/test/unit/meshconvert/python/data/abaqus_facet.inp b/test/unit/meshconvert/python/data/abaqus_facet.inp
new file mode 100644
index 0000000..90765c7
--- /dev/null
+++ b/test/unit/meshconvert/python/data/abaqus_facet.inp
@@ -0,0 +1,781 @@
+*HEADING
+cubit(abaqus/test/unit/meshconvert/python/data/abaqus_facet.inp): 12/19/2013: 12
+version: 13.1
+**
+********************************** P A R T S **********************************
+*PART, NAME=Part-Default
+**
+********************************** N O D E S **********************************
+*NODE, NSET=ALLNODES
+    1620,    5.000000e-01,    0.000000e+00,   -5.000000e-01
+    1621,    4.330127e-01,   -2.500000e-01,   -5.000000e-01
+    1622,    2.500000e-01,   -4.330127e-01,   -5.000000e-01
+    1623,    3.061617e-17,   -5.000000e-01,   -5.000000e-01
+    1624,   -2.500000e-01,   -4.330127e-01,   -5.000000e-01
+    1625,   -4.330127e-01,   -2.500000e-01,   -5.000000e-01
+    1626,   -5.000000e-01,   -6.123234e-17,   -5.000000e-01
+    1627,   -4.330127e-01,    2.500000e-01,   -5.000000e-01
+    1628,   -2.500000e-01,    4.330127e-01,   -5.000000e-01
+    1629,   -9.184851e-17,    5.000000e-01,   -5.000000e-01
+    1630,    2.500000e-01,    4.330127e-01,   -5.000000e-01
+    1631,    4.330127e-01,    2.500000e-01,   -5.000000e-01
+    1632,    5.000000e-01,    0.000000e+00,    5.000000e-01
+    1633,    4.330127e-01,    2.500000e-01,    5.000000e-01
+    1634,    2.500000e-01,    4.330127e-01,    5.000000e-01
+    1635,    3.061617e-17,    5.000000e-01,    5.000000e-01
+    1636,   -2.500000e-01,    4.330127e-01,    5.000000e-01
+    1637,   -4.330127e-01,    2.500000e-01,    5.000000e-01
+    1638,   -5.000000e-01,    6.123234e-17,    5.000000e-01
+    1639,   -4.330127e-01,   -2.500000e-01,    5.000000e-01
+    1640,   -2.500000e-01,   -4.330127e-01,    5.000000e-01
+    1641,   -9.184851e-17,   -5.000000e-01,    5.000000e-01
+    1642,    2.500000e-01,   -4.330127e-01,    5.000000e-01
+    1643,    4.330127e-01,   -2.500000e-01,    5.000000e-01
+    1644,    5.000000e-01,   -9.836362e-06,    2.499603e-01
+    1645,    4.329544e-01,   -2.501009e-01,    2.502143e-01
+    1646,    2.496835e-01,   -4.331953e-01,    2.499602e-01
+    1647,   -2.984207e-04,   -4.999999e-01,    2.498906e-01
+    1648,   -2.502906e-01,   -4.328448e-01,    2.498300e-01
+    1649,   -4.331478e-01,   -2.497658e-01,    2.497848e-01
+    1650,   -4.999999e-01,    3.419011e-04,    2.497897e-01
+    1651,   -4.329081e-01,    2.501811e-01,    2.499582e-01
+    1652,   -2.498296e-01,    4.331110e-01,    2.500278e-01
+    1653,    3.438233e-04,    4.999999e-01,    2.500302e-01
+    1654,    2.499892e-01,    4.330189e-01,    2.497462e-01
+    1655,    4.329941e-01,    2.500322e-01,    2.498010e-01
+    1656,    4.999998e-01,   -4.320394e-04,   -2.499326e-01
+    1657,    4.330699e-01,    2.499008e-01,   -2.501072e-01
+    1658,    2.501742e-01,    4.329121e-01,   -2.503052e-01
+    1659,    1.539119e-04,    5.000000e-01,   -2.502326e-01
+    1660,   -2.498446e-01,    4.331024e-01,   -2.501255e-01
+    1661,   -4.329432e-01,    2.501204e-01,   -2.502139e-01
+    1662,   -5.000000e-01,    1.052439e-04,   -2.502535e-01
+    1663,   -4.331594e-01,   -2.497457e-01,   -2.502268e-01
+    1664,   -2.501351e-01,   -4.329347e-01,   -2.500830e-01
+    1665,   -3.053758e-04,   -4.999999e-01,   -2.501416e-01
+    1666,    2.495363e-01,   -4.332801e-01,   -2.497703e-01
+    1667,    4.328167e-01,   -2.503393e-01,   -2.496924e-01
+    1668,    4.328757e-01,   -2.502371e-01,    1.595420e-06
+    1669,    2.497003e-01,   -4.331856e-01,    2.431921e-05
+    1670,   -3.321875e-04,   -4.999999e-01,   -1.370747e-04
+    1671,   -2.502724e-01,   -4.328553e-01,   -2.048238e-04
+    1672,   -4.331549e-01,   -2.497536e-01,   -2.094810e-04
+    1673,   -4.999999e-01,    2.304082e-04,   -2.380535e-04
+    1674,   -4.329014e-01,    2.501926e-01,   -9.967719e-05
+    1675,   -2.498211e-01,    4.331159e-01,   -9.929825e-05
+    1676,    2.793518e-04,    4.999999e-01,   -2.895325e-04
+    1677,    5.000000e-01,   -1.503351e-04,   -1.182414e-04
+    1678,    4.330896e-01,    2.498668e-01,   -3.202120e-04
+    1679,    2.501308e-01,    4.329371e-01,   -2.922078e-04
+    1680,    2.284294e-01,   -1.501228e-02,   -5.000000e-01
+    1681,    1.895227e-01,   -1.906886e-01,   -5.000000e-01
+    1682,    1.593603e-01,   -3.223930e-01,   -5.000000e-01
+    1683,    3.855816e-02,   -3.434777e-01,   -5.000000e-01
+    1684,   -2.283257e-01,   -1.081840e-01,   -5.000000e-01
+    1685,   -3.275273e-01,    8.896469e-03,   -5.000000e-01
+    1686,   -1.368263e-01,    2.492225e-01,   -5.000000e-01
+    1687,    1.794655e-02,    2.941194e-01,   -5.000000e-01
+    1688,    1.613575e-01,    2.964500e-01,   -5.000000e-01
+    1689,    2.161260e-01,    1.622179e-01,   -5.000000e-01
+    1690,   -7.340782e-02,    1.438429e-01,   -5.000000e-01
+    1691,    2.747841e-02,   -1.281244e-02,   -5.000000e-01
+    1692,   -4.250352e-02,   -2.034698e-01,   -5.000000e-01
+    1693,   -2.524348e-01,    1.358763e-01,   -5.000000e-01
+    1694,   -1.331654e-01,    3.587378e-02,   -5.000000e-01
+    1695,    4.976821e-02,    1.464325e-01,   -5.000000e-01
+    1696,    2.283326e-01,    1.501524e-02,    5.000000e-01
+    1697,    1.895128e-01,    1.906839e-01,    5.000000e-01
+    1698,    1.593580e-01,    3.223932e-01,    5.000000e-01
+    1699,    3.856121e-02,    3.434830e-01,    5.000000e-01
+    1700,   -2.283734e-01,    1.082141e-01,    5.000000e-01
+    1701,   -3.275757e-01,   -8.864649e-03,    5.000000e-01
+    1702,   -1.369750e-01,   -2.491747e-01,    5.000000e-01
+    1703,    1.782396e-02,   -2.941013e-01,    5.000000e-01
+    1704,    1.612799e-01,   -2.964374e-01,    5.000000e-01
+    1705,    2.160157e-01,   -1.621982e-01,    5.000000e-01
+    1706,   -7.354821e-02,   -1.438019e-01,    5.000000e-01
+    1707,    2.737237e-02,    1.283551e-02,    5.000000e-01
+    1708,   -4.252359e-02,    2.034926e-01,    5.000000e-01
+    1709,   -2.525196e-01,   -1.358313e-01,    5.000000e-01
+    1710,   -1.332791e-01,   -3.582629e-02,    5.000000e-01
+    1711,    4.960948e-02,   -1.464047e-01,    5.000000e-01
+    1712,    3.000737e-01,   -8.652781e-02,    8.110248e-02
+    1713,    3.140742e-02,   -6.658081e-03,   -2.139514e-02
+    1714,    1.260078e-01,   -2.235282e-01,   -2.097017e-02
+    1715,    1.730893e-01,    1.397733e-02,    1.870613e-01
+    1716,    2.956163e-01,   -6.746598e-02,    3.385367e-01
+    1717,   -9.880973e-02,   -7.910880e-02,    3.853914e-01
+    1718,    1.507665e-01,   -2.618389e-01,    1.386146e-01
+    1719,   -1.961992e-01,   -1.106950e-01,    3.289401e-03
+    1720,    4.754237e-04,   -1.382759e-01,    1.822058e-01
+    1721,   -1.240165e-01,   -2.845294e-01,    9.164209e-02
+    1722,   -5.315730e-02,   -2.430042e-01,    3.607100e-01
+    1723,   -1.787296e-02,   -2.987898e-01,   -1.667531e-01
+    1724,   -3.112619e-01,   -1.199781e-01,    3.900911e-01
+    1725,   -2.345129e-01,   -2.501061e-01,    3.562247e-01
+    1726,   -2.652276e-01,   -1.405586e-01,    1.875300e-01
+    1727,    2.342583e-01,    1.200628e-01,    3.453384e-02
+    1728,    3.024173e-01,   -7.195632e-02,   -7.659019e-02
+    1729,    1.129929e-01,   -4.024322e-02,   -1.850592e-01
+    1730,    2.847562e-01,   -1.039719e-01,   -2.880551e-01
+    1731,    2.763101e-01,    1.186319e-01,   -1.668089e-01
+    1732,    1.115224e-01,    2.808129e-01,   -6.276832e-02
+    1733,    7.617527e-02,    1.275764e-01,   -1.707959e-01
+    1734,   -3.204305e-02,    2.958726e-01,   -1.712739e-01
+    1735,   -2.896860e-02,    6.809483e-02,    1.768661e-01
+    1736,   -2.212655e-01,    3.605267e-02,    3.556533e-01
+    1737,   -1.078905e-01,    2.472555e-01,   -4.383229e-02
+    1738,   -1.974848e-01,    7.003257e-02,   -3.735647e-01
+    1739,   -1.125617e-01,   -8.484644e-02,   -3.480554e-01
+    1740,    1.697263e-01,    2.574591e-01,    1.699609e-01
+    1741,   -1.121648e-01,    2.972871e-01,    1.909865e-01
+    1742,    2.578646e-01,   -2.472835e-01,   -3.877736e-01
+    1743,    1.507914e-01,    6.704675e-02,   -3.480885e-01
+    1744,    1.083550e-01,   -1.773121e-01,   -3.453064e-01
+    1745,   -1.218309e-01,    1.529587e-02,   -1.889007e-01
+    1746,    9.998995e-02,    2.264419e-01,   -3.374468e-01
+    1747,   -4.889151e-02,    1.166364e-01,   -3.529805e-01
+    1748,   -2.418281e-01,    1.795769e-01,   -1.670278e-01
+    1749,   -2.666342e-01,   -1.381252e-01,   -1.474666e-01
+    1750,    1.221688e-01,   -1.190504e-01,    3.661424e-01
+    1751,   -2.751641e-01,    1.209814e-01,    1.636836e-01
+    1752,   -4.396873e-02,    1.407328e-01,    3.554240e-01
+    1753,    2.669308e-01,    1.837800e-01,    3.410892e-01
+    1754,    3.036213e-01,    4.952157e-02,   -3.415585e-01
+    1755,   -2.094521e-01,    2.184856e-01,    3.627906e-01
+    1756,   -3.435902e-01,    8.907493e-02,    3.667169e-01
+    1757,    2.555357e-01,   -2.227913e-01,    3.627045e-01
+    1758,    1.133391e-01,   -3.152930e-01,    3.936073e-01
+    1759,    2.542063e-01,    2.055818e-01,   -3.393529e-01
+    1760,   -2.483628e-01,    2.059524e-01,   -3.898484e-01
+    1761,   -1.193441e-01,   -2.765090e-01,   -3.335609e-01
+    1762,   -4.173398e-02,    3.473271e-01,   -3.650271e-01
+    1763,    5.242520e-02,    2.914314e-01,    3.795068e-01
+    1764,   -8.767774e-02,    3.220502e-01,    3.690696e-01
+    1765,   -3.192813e-01,   -1.173565e-01,   -3.847772e-01
+**
+********************************** E L E M E N T S ****************************
+*ELEMENT, TYPE=C3D4, ELSET=EB4
+     441,    1712,    1713,    1714,    1715
+     442,    1644,    1715,    1712,    1716
+     443,    1707,    1706,    1710,    1717
+     444,    1668,    1712,    1714,    1718
+     445,    1712,    1716,    1715,    1718
+     446,    1713,    1719,    1714,    1720
+     447,    1714,    1720,    1719,    1721
+     448,    1718,    1720,    1721,    1722
+     449,    1714,    1718,    1720,    1721
+     450,    1670,    1721,    1714,    1723
+     451,    1639,    1724,    1709,    1725
+     452,    1671,    1721,    1719,    1726
+     453,    1648,    1722,    1721,    1725
+     454,    1721,    1725,    1722,    1726
+     455,    1713,    1727,    1728,    1729
+     456,    1714,    1729,    1728,    1730
+     457,    1668,    1712,    1677,    1728
+     458,    1677,    1728,    1727,    1731
+     459,    1649,    1650,    1638,    1724
+     460,    1656,    1667,    1728,    1730
+     461,    1656,    1730,    1728,    1731
+     462,    1658,    1731,    1732,    1733
+     463,    1658,    1733,    1732,    1734
+     464,    1713,    1715,    1727,    1735
+     465,    1717,    1735,    1726,    1736
+     466,    1713,    1732,    1733,    1737
+     467,    1684,    1694,    1738,    1739
+     468,    1639,    1649,    1638,    1724
+     469,    1653,    1676,    1740,    1741
+     470,    1622,    1666,    1667,    1742
+     471,    1732,    1735,    1740,    1741
+     472,    1713,    1720,    1715,    1735
+     473,    1713,    1727,    1732,    1735
+     474,    1727,    1732,    1735,    1740
+     475,    1732,    1737,    1735,    1741
+     476,    1713,    1714,    1715,    1720
+     477,    1712,    1715,    1714,    1718
+     478,    1667,    1714,    1728,    1730
+     479,    1729,    1733,    1731,    1743
+     480,    1713,    1714,    1723,    1729
+     481,    1713,    1727,    1729,    1733
+     482,    1666,    1714,    1730,    1744
+     483,    1666,    1714,    1667,    1730
+     484,    1712,    1728,    1713,    1727
+     485,    1713,    1737,    1733,    1745
+     486,    1731,    1743,    1733,    1746
+     487,    1693,    1694,    1690,    1738
+     488,    1729,    1731,    1730,    1743
+     489,    1713,    1732,    1727,    1733
+     490,    1713,    1719,    1737,    1745
+     491,    1713,    1729,    1723,    1745
+     492,    1713,    1723,    1719,    1745
+     493,    1733,    1746,    1743,    1747
+     494,    1738,    1745,    1747,    1748
+     495,    1738,    1745,    1748,    1749
+     496,    1713,    1719,    1720,    1735
+     497,    1715,    1735,    1720,    1750
+     498,    1719,    1726,    1735,    1751
+     499,    1729,    1733,    1743,    1747
+     500,    1713,    1719,    1735,    1737
+     501,    1719,    1737,    1745,    1748
+     502,    1733,    1745,    1734,    1747
+     503,    1715,    1727,    1735,    1740
+     504,    1715,    1735,    1750,    1752
+     505,    1655,    1727,    1715,    1740
+     506,    1644,    1655,    1715,    1753
+     507,    1645,    1644,    1712,    1716
+     508,    1717,    1720,    1722,    1726
+     509,    1718,    1720,    1722,    1750
+     510,    1712,    1714,    1713,    1728
+     511,    1645,    1716,    1712,    1718
+     512,    1620,    1730,    1656,    1754
+     513,    1666,    1730,    1742,    1744
+     514,    1730,    1743,    1731,    1754
+     515,    1676,    1737,    1732,    1741
+     516,    1652,    1751,    1741,    1755
+     517,    1675,    1737,    1741,    1751
+     518,    1675,    1737,    1676,    1741
+     519,    1650,    1726,    1751,    1756
+     520,    1705,    1750,    1716,    1757
+     521,    1696,    1716,    1705,    1750
+     522,    1717,    1722,    1720,    1750
+     523,    1711,    1722,    1717,    1750
+     524,    1646,    1647,    1641,    1758
+     525,    1711,    1717,    1707,    1750
+     526,    1689,    1746,    1743,    1759
+     527,    1628,    1660,    1661,    1760
+     528,    1631,    1689,    1754,    1759
+     529,    1658,    1731,    1746,    1759
+     530,    1631,    1658,    1688,    1759
+     531,    1646,    1669,    1647,    1718
+     532,    1664,    1723,    1665,    1761
+     533,    1723,    1749,    1739,    1761
+     534,    1723,    1739,    1729,    1744
+     535,    1728,    1729,    1727,    1731
+     536,    1659,    1676,    1660,    1734
+     537,    1665,    1744,    1683,    1761
+     538,    1666,    1723,    1714,    1744
+     539,    1640,    1702,    1722,    1725
+     540,    1640,    1639,    1709,    1725
+     541,    1639,    1649,    1724,    1725
+     542,    1717,    1726,    1724,    1736
+     543,    1726,    1736,    1751,    1756
+     544,    1735,    1751,    1736,    1752
+     545,    1710,    1717,    1736,    1752
+     546,    1709,    1710,    1717,    1736
+     547,    1734,    1746,    1747,    1762
+     548,    1660,    1734,    1748,    1762
+     549,    1628,    1660,    1760,    1762
+     550,    1629,    1628,    1686,    1762
+     551,    1695,    1743,    1746,    1747
+     552,    1658,    1733,    1734,    1746
+     553,    1658,    1734,    1659,    1746
+     554,    1629,    1687,    1688,    1762
+     555,    1634,    1654,    1655,    1753
+     556,    1629,    1688,    1659,    1762
+     557,    1733,    1734,    1746,    1747
+     558,    1653,    1740,    1654,    1763
+     559,    1697,    1752,    1708,    1763
+     560,    1735,    1740,    1741,    1752
+     561,    1735,    1741,    1737,    1751
+     562,    1653,    1741,    1740,    1763
+     563,    1708,    1763,    1752,    1764
+     564,    1656,    1730,    1731,    1754
+     565,    1681,    1742,    1730,    1744
+     566,    1729,    1745,    1733,    1747
+     567,    1728,    1730,    1729,    1731
+     568,    1691,    1743,    1739,    1744
+     569,    1695,    1691,    1743,    1747
+     570,    1620,    1680,    1730,    1754
+     571,    1673,    1726,    1719,    1751
+     572,    1719,    1737,    1748,    1751
+     573,    1738,    1739,    1745,    1749
+     574,    1662,    1738,    1748,    1749
+     575,    1661,    1662,    1738,    1748
+     576,    1674,    1748,    1737,    1751
+     577,    1663,    1749,    1761,    1765
+     578,    1739,    1761,    1749,    1765
+     579,    1625,    1761,    1684,    1765
+     580,    1692,    1739,    1684,    1761
+     581,    1734,    1747,    1745,    1748
+     582,    1686,    1760,    1747,    1762
+     583,    1686,    1747,    1687,    1762
+     584,    1660,    1676,    1675,    1737
+     585,    1660,    1734,    1676,    1737
+     586,    1727,    1732,    1731,    1733
+     587,    1709,    1717,    1706,    1725
+     588,    1715,    1740,    1735,    1752
+     589,    1715,    1750,    1716,    1753
+     590,    1711,    1706,    1717,    1722
+     591,    1736,    1752,    1751,    1755
+     592,    1637,    1651,    1755,    1756
+     593,    1637,    1755,    1700,    1756
+     594,    1701,    1709,    1724,    1736
+     595,    1717,    1720,    1726,    1735
+     596,    1717,    1735,    1736,    1752
+     597,    1681,    1730,    1680,    1744
+     598,    1665,    1723,    1666,    1744
+     599,    1715,    1720,    1718,    1750
+     600,    1648,    1721,    1671,    1726
+     601,    1719,    1721,    1720,    1726
+     602,    1670,    1671,    1721,    1723
+     603,    1729,    1739,    1743,    1744
+     604,    1735,    1741,    1751,    1752
+     605,    1669,    1670,    1714,    1723
+     606,    1674,    1675,    1737,    1748
+     607,    1686,    1738,    1747,    1760
+     608,    1684,    1738,    1685,    1765
+     609,    1733,    1737,    1734,    1745
+     610,    1692,    1691,    1739,    1744
+     611,    1687,    1747,    1746,    1762
+     612,    1713,    1728,    1714,    1729
+     613,    1681,    1682,    1742,    1744
+     614,    1703,    1722,    1750,    1758
+     615,    1717,    1725,    1724,    1726
+     616,    1630,    1658,    1659,    1688
+     617,    1707,    1717,    1710,    1752
+     618,    1706,    1717,    1722,    1725
+     619,    1719,    1726,    1720,    1735
+     620,    1647,    1718,    1670,    1721
+     621,    1715,    1752,    1750,    1753
+     622,    1645,    1712,    1668,    1718
+     623,    1741,    1752,    1763,    1764
+     624,    1660,    1737,    1675,    1748
+     625,    1712,    1713,    1715,    1727
+     626,    1650,    1726,    1673,    1751
+     627,    1652,    1675,    1741,    1751
+     628,    1650,    1751,    1651,    1756
+     629,    1674,    1737,    1675,    1751
+     630,    1654,    1740,    1753,    1763
+     631,    1697,    1753,    1752,    1763
+     632,    1676,    1734,    1732,    1737
+     633,    1655,    1740,    1715,    1753
+     634,    1740,    1752,    1753,    1763
+     635,    1740,    1741,    1752,    1763
+     636,    1676,    1732,    1740,    1741
+     637,    1677,    1728,    1712,    1727
+     638,    1697,    1698,    1753,    1763
+     639,    1634,    1698,    1654,    1753
+     640,    1718,    1757,    1750,    1758
+     641,    1644,    1716,    1633,    1753
+     642,    1632,    1696,    1633,    1716
+     643,    1634,    1633,    1698,    1753
+     644,    1697,    1707,    1752,    1753
+     645,    1684,    1761,    1739,    1765
+     646,    1640,    1648,    1639,    1725
+     647,    1625,    1624,    1684,    1761
+     648,    1663,    1749,    1664,    1761
+     649,    1640,    1709,    1702,    1725
+     650,    1626,    1685,    1662,    1765
+     651,    1626,    1625,    1685,    1765
+     652,    1741,    1755,    1752,    1764
+     653,    1636,    1755,    1652,    1764
+     654,    1636,    1708,    1755,    1764
+     655,    1637,    1636,    1700,    1755
+     656,    1708,    1752,    1755,    1764
+     657,    1696,    1750,    1707,    1753
+     658,    1646,    1757,    1718,    1758
+     659,    1632,    1643,    1705,    1716
+     660,    1643,    1642,    1704,    1757
+     661,    1696,    1716,    1750,    1753
+     662,    1703,    1722,    1711,    1750
+     663,    1732,    1734,    1733,    1737
+     664,    1729,    1739,    1745,    1747
+     665,    1707,    1750,    1752,    1753
+     666,    1719,    1745,    1723,    1749
+     667,    1643,    1716,    1645,    1757
+     668,    1709,    1710,    1706,    1717
+     669,    1729,    1743,    1730,    1744
+     670,    1644,    1677,    1712,    1727
+     671,    1717,    1750,    1735,    1752
+     672,    1676,    1732,    1679,    1740
+     673,    1689,    1695,    1743,    1746
+     674,    1667,    1714,    1668,    1728
+     675,    1657,    1656,    1731,    1754
+     676,    1723,    1729,    1739,    1745
+     677,    1660,    1734,    1737,    1748
+     678,    1747,    1760,    1748,    1762
+     679,    1694,    1690,    1738,    1747
+     680,    1738,    1739,    1749,    1765
+     681,    1672,    1673,    1719,    1749
+     682,    1664,    1749,    1723,    1761
+     683,    1666,    1669,    1714,    1723
+     684,    1624,    1623,    1683,    1761
+     685,    1671,    1719,    1721,    1723
+     686,    1687,    1695,    1688,    1746
+     687,    1696,    1711,    1707,    1750
+     688,    1679,    1732,    1727,    1740
+     689,    1713,    1733,    1729,    1745
+     690,    1662,    1738,    1749,    1765
+     691,    1686,    1738,    1690,    1747
+     692,    1691,    1739,    1743,    1747
+     693,    1691,    1694,    1739,    1747
+     694,    1684,    1694,    1685,    1738
+     695,    1671,    1719,    1672,    1726
+     696,    1624,    1692,    1684,    1761
+     697,    1664,    1671,    1723,    1749
+     698,    1687,    1690,    1695,    1747
+     699,    1715,    1740,    1752,    1753
+     700,    1679,    1727,    1678,    1740
+     701,    1687,    1695,    1746,    1747
+     702,    1658,    1731,    1679,    1732
+     703,    1648,    1725,    1721,    1726
+     704,    1642,    1641,    1704,    1758
+     705,    1642,    1704,    1757,    1758
+     706,    1641,    1640,    1702,    1722
+     707,    1718,    1750,    1722,    1758
+     708,    1641,    1722,    1703,    1758
+     709,    1717,    1720,    1735,    1750
+     710,    1704,    1750,    1757,    1758
+     711,    1679,    1731,    1727,    1732
+     712,    1644,    1715,    1716,    1753
+     713,    1673,    1748,    1719,    1749
+     714,    1670,    1718,    1714,    1721
+     715,    1669,    1714,    1670,    1718
+     716,    1720,    1721,    1722,    1726
+     717,    1702,    1706,    1722,    1725
+     718,    1651,    1751,    1755,    1756
+     719,    1709,    1724,    1717,    1725
+     720,    1662,    1748,    1673,    1749
+     721,    1657,    1679,    1658,    1731
+     722,    1680,    1730,    1743,    1744
+     723,    1652,    1755,    1741,    1764
+     724,    1708,    1752,    1700,    1755
+     725,    1741,    1751,    1752,    1755
+     726,    1635,    1653,    1763,    1764
+     727,    1636,    1635,    1699,    1764
+     728,    1693,    1738,    1686,    1760
+     729,    1621,    1667,    1730,    1742
+     730,    1689,    1743,    1754,    1759
+     731,    1631,    1754,    1657,    1759
+     732,    1620,    1631,    1689,    1754
+     733,    1620,    1680,    1621,    1730
+     734,    1661,    1674,    1673,    1748
+     735,    1661,    1673,    1662,    1748
+     736,    1659,    1746,    1734,    1762
+     737,    1686,    1690,    1687,    1747
+     738,    1660,    1748,    1760,    1762
+     739,    1685,    1694,    1693,    1738
+     740,    1627,    1685,    1693,    1760
+     741,    1628,    1760,    1686,    1762
+     742,    1628,    1627,    1693,    1760
+     743,    1637,    1700,    1701,    1756
+     744,    1638,    1701,    1724,    1756
+     745,    1656,    1728,    1677,    1731
+     746,    1651,    1674,    1675,    1751
+     747,    1648,    1649,    1725,    1726
+     748,    1681,    1692,    1682,    1744
+     749,    1639,    1701,    1709,    1724
+     750,    1708,    1710,    1700,    1752
+     751,    1649,    1650,    1724,    1726
+     752,    1665,    1682,    1683,    1744
+     753,    1638,    1637,    1701,    1756
+     754,    1635,    1653,    1698,    1763
+     755,    1653,    1654,    1698,    1763
+     756,    1650,    1651,    1637,    1756
+     757,    1716,    1750,    1718,    1757
+     758,    1635,    1763,    1699,    1764
+     759,    1654,    1753,    1698,    1763
+     760,    1729,    1743,    1739,    1747
+     761,    1708,    1707,    1710,    1752
+     762,    1652,    1741,    1653,    1764
+     763,    1641,    1647,    1640,    1722
+     764,    1697,    1707,    1708,    1752
+     765,    1633,    1716,    1696,    1753
+     766,    1736,    1755,    1751,    1756
+     767,    1633,    1696,    1697,    1753
+     768,    1738,    1745,    1739,    1747
+     769,    1723,    1739,    1744,    1761
+     770,    1660,    1675,    1674,    1748
+     771,    1693,    1690,    1686,    1738
+     772,    1660,    1674,    1661,    1748
+     773,    1688,    1746,    1689,    1759
+     774,    1731,    1743,    1746,    1759
+     775,    1657,    1731,    1658,    1759
+     776,    1681,    1680,    1691,    1744
+     777,    1680,    1695,    1691,    1743
+     778,    1620,    1689,    1680,    1754
+     779,    1709,    1706,    1702,    1725
+     780,    1723,    1745,    1739,    1749
+     781,    1734,    1747,    1748,    1762
+     782,    1658,    1659,    1688,    1746
+     783,    1657,    1754,    1731,    1759
+     784,    1658,    1676,    1659,    1734
+     785,    1669,    1668,    1714,    1718
+     786,    1629,    1686,    1687,    1762
+     787,    1647,    1718,    1722,    1758
+     788,    1658,    1731,    1733,    1746
+     789,    1738,    1748,    1747,    1760
+     790,    1658,    1746,    1688,    1759
+     791,    1687,    1746,    1688,    1762
+     792,    1659,    1734,    1660,    1762
+     793,    1629,    1659,    1660,    1762
+     794,    1628,    1693,    1686,    1760
+     795,    1662,    1685,    1738,    1765
+     796,    1661,    1662,    1685,    1738
+     797,    1661,    1748,    1738,    1760
+     798,    1627,    1661,    1662,    1685
+     799,    1651,    1751,    1652,    1755
+     800,    1662,    1749,    1663,    1765
+     801,    1632,    1645,    1643,    1716
+     802,    1731,    1754,    1743,    1759
+     803,    1626,    1662,    1663,    1765
+     804,    1623,    1665,    1683,    1761
+     805,    1692,    1744,    1739,    1761
+     806,    1681,    1691,    1692,    1744
+     807,    1652,    1653,    1635,    1764
+     808,    1653,    1741,    1763,    1764
+     809,    1665,    1666,    1682,    1744
+     810,    1664,    1671,    1670,    1723
+     811,    1663,    1671,    1664,    1749
+     812,    1625,    1663,    1664,    1761
+     813,    1623,    1665,    1682,    1683
+     814,    1647,    1718,    1721,    1722
+     815,    1713,    1714,    1719,    1723
+     816,    1621,    1681,    1682,    1742
+     817,    1666,    1730,    1667,    1742
+     818,    1680,    1743,    1691,    1744
+     819,    1657,    1678,    1679,    1731
+     820,    1641,    1647,    1722,    1758
+     821,    1672,    1719,    1673,    1726
+     822,    1631,    1658,    1630,    1688
+     823,    1691,    1690,    1694,    1747
+     824,    1620,    1657,    1631,    1754
+     825,    1620,    1656,    1657,    1754
+     826,    1666,    1670,    1669,    1723
+     827,    1666,    1669,    1667,    1714
+     828,    1623,    1665,    1666,    1682
+     829,    1719,    1735,    1737,    1751
+     830,    1700,    1755,    1736,    1756
+     831,    1656,    1667,    1677,    1728
+     832,    1700,    1752,    1736,    1755
+     833,    1699,    1763,    1708,    1764
+     834,    1655,    1678,    1677,    1727
+     835,    1680,    1743,    1730,    1754
+     836,    1667,    1668,    1677,    1728
+     837,    1701,    1710,    1709,    1736
+     838,    1644,    1715,    1655,    1727
+     839,    1697,    1696,    1707,    1753
+     840,    1688,    1695,    1689,    1746
+     841,    1644,    1655,    1677,    1727
+     842,    1711,    1706,    1707,    1717
+     843,    1727,    1731,    1729,    1733
+     844,    1668,    1714,    1712,    1728
+     845,    1671,    1672,    1719,    1749
+     846,    1714,    1721,    1719,    1723
+     847,    1703,    1706,    1711,    1722
+     848,    1673,    1748,    1674,    1751
+     849,    1700,    1710,    1736,    1752
+     850,    1661,    1738,    1685,    1760
+     851,    1662,    1672,    1663,    1749
+     852,    1649,    1671,    1672,    1726
+     853,    1649,    1673,    1650,    1726
+     854,    1648,    1671,    1649,    1726
+     855,    1632,    1705,    1696,    1716
+     856,    1685,    1738,    1693,    1760
+     857,    1645,    1718,    1646,    1757
+     858,    1680,    1689,    1743,    1754
+     859,    1724,    1736,    1726,    1756
+     860,    1667,    1669,    1668,    1714
+     861,    1646,    1668,    1669,    1718
+     862,    1657,    1656,    1678,    1731
+     863,    1659,    1688,    1746,    1762
+     864,    1621,    1680,    1681,    1730
+     865,    1640,    1722,    1648,    1725
+     866,    1714,    1718,    1715,    1720
+     867,    1679,    1678,    1727,    1731
+     868,    1719,    1748,    1745,    1749
+     869,    1651,    1675,    1652,    1751
+     870,    1620,    1621,    1656,    1730
+     871,    1658,    1679,    1676,    1732
+     872,    1656,    1621,    1667,    1730
+     873,    1650,    1724,    1726,    1756
+     874,    1624,    1664,    1665,    1761
+     875,    1624,    1665,    1623,    1761
+     876,    1664,    1670,    1665,    1723
+     877,    1665,    1723,    1744,    1761
+     878,    1625,    1664,    1624,    1761
+     879,    1655,    1678,    1727,    1740
+     880,    1624,    1683,    1692,    1761
+     881,    1717,    1722,    1725,    1726
+     882,    1700,    1736,    1701,    1756
+     883,    1625,    1684,    1685,    1765
+     884,    1626,    1663,    1625,    1765
+     885,    1684,    1739,    1738,    1765
+     886,    1695,    1690,    1691,    1747
+     887,    1622,    1667,    1621,    1742
+     888,    1713,    1735,    1732,    1737
+     889,    1628,    1661,    1627,    1760
+     890,    1627,    1662,    1626,    1685
+     891,    1647,    1669,    1670,    1718
+     892,    1627,    1661,    1685,    1760
+     893,    1707,    1750,    1717,    1752
+     894,    1643,    1704,    1705,    1757
+     895,    1654,    1740,    1655,    1753
+     896,    1696,    1705,    1711,    1750
+     897,    1692,    1694,    1684,    1739
+     898,    1658,    1732,    1676,    1734
+     899,    1631,    1688,    1689,    1759
+     900,    1680,    1689,    1695,    1743
+     901,    1631,    1657,    1658,    1759
+     902,    1623,    1666,    1622,    1682
+     903,    1734,    1745,    1737,    1748
+     904,    1673,    1719,    1748,    1751
+     905,    1698,    1708,    1699,    1763
+     906,    1666,    1742,    1682,    1744
+     907,    1622,    1621,    1682,    1742
+     908,    1644,    1633,    1655,    1753
+     909,    1634,    1655,    1633,    1753
+     910,    1662,    1673,    1672,    1749
+     911,    1641,    1702,    1703,    1722
+     912,    1700,    1710,    1701,    1736
+     913,    1633,    1697,    1698,    1753
+     914,    1636,    1699,    1708,    1764
+     915,    1703,    1750,    1704,    1758
+     916,    1653,    1654,    1634,    1698
+     917,    1645,    1644,    1668,    1712
+     918,    1632,    1644,    1645,    1716
+     919,    1635,    1653,    1634,    1698
+     920,    1647,    1670,    1648,    1721
+     921,    1644,    1712,    1715,    1727
+     922,    1703,    1711,    1704,    1750
+     923,    1642,    1646,    1641,    1758
+     924,    1636,    1652,    1635,    1764
+     925,    1648,    1670,    1671,    1721
+     926,    1709,    1717,    1724,    1736
+     927,    1678,    1677,    1727,    1731
+     928,    1714,    1723,    1729,    1744
+     929,    1641,    1703,    1704,    1758
+     930,    1637,    1651,    1636,    1755
+     931,    1644,    1677,    1668,    1712
+     932,    1646,    1718,    1647,    1758
+     933,    1642,    1757,    1646,    1758
+     934,    1704,    1750,    1705,    1757
+     935,    1629,    1660,    1628,    1762
+     936,    1692,    1691,    1694,    1739
+     937,    1636,    1708,    1700,    1755
+     938,    1650,    1674,    1651,    1751
+     939,    1654,    1679,    1655,    1740
+     940,    1697,    1708,    1698,    1763
+     941,    1645,    1716,    1718,    1757
+     942,    1663,    1672,    1671,    1749
+     943,    1638,    1650,    1637,    1756
+     944,    1625,    1663,    1761,    1765
+     945,    1647,    1648,    1640,    1722
+     946,    1660,    1748,    1661,    1760
+     947,    1650,    1673,    1674,    1751
+     948,    1654,    1676,    1679,    1740
+     949,    1726,    1736,    1735,    1751
+     950,    1622,    1682,    1666,    1742
+     951,    1645,    1668,    1646,    1718
+     952,    1645,    1646,    1642,    1757
+     953,    1649,    1724,    1725,    1726
+     954,    1653,    1676,    1654,    1740
+     955,    1643,    1705,    1716,    1757
+     956,    1649,    1672,    1673,    1726
+     957,    1652,    1675,    1653,    1741
+     958,    1702,    1706,    1703,    1722
+     959,    1704,    1711,    1705,    1750
+     960,    1630,    1659,    1629,    1688
+     961,    1683,    1744,    1692,    1761
+     962,    1621,    1730,    1681,    1742
+     963,    1656,    1677,    1678,    1731
+     964,    1651,    1652,    1636,    1755
+     965,    1682,    1692,    1683,    1744
+     966,    1647,    1721,    1648,    1722
+     967,    1715,    1718,    1716,    1750
+     968,    1648,    1649,    1639,    1725
+     969,    1714,    1729,    1730,    1744
+     970,    1639,    1638,    1701,    1724
+     971,    1632,    1633,    1644,    1716
+     972,    1655,    1679,    1678,    1740
+     973,    1638,    1724,    1650,    1756
+     974,    1635,    1698,    1699,    1763
+     975,    1665,    1670,    1666,    1723
+     976,    1694,    1738,    1739,    1747
+     977,    1643,    1645,    1642,    1757
+     978,    1671,    1719,    1723,    1749
+     979,    1701,    1736,    1724,    1756
+     980,    1653,    1675,    1676,    1741
+**
+********************************** S I D E S E T S **********************************
+*ELSET, ELSET=SS1_S1
+     487,     550,     554,     647,     651,     684,     686,     694,     696,     698,
+     732,     733,     737,     739,     740,     742,     748,     771,     776,     777,
+     778,     786,     794,     806,     816,     823,     840,     864,     880,     883,
+     886,     897,     899,     900,     907,     936,     965
+*ELSET, ELSET=SS1_S4
+     813,     822,     890,     902,     960
+*SURFACE, NAME=SS1
+SS1_S1, S1
+SS1_S4, S4
+*ELSET, ELSET=SS2_S1
+     459,     468,     470,     524,     527,     531,     536,     555,     584,     616,
+     646,     721,     734,     735,     746,     756,     763,     770,     772,     784,
+     793,     798,     801,     803,     807,     810,     811,     812,     819,     822,
+     824,     825,     826,     827,     828,     831,     834,     836,     841,     851,
+     852,     853,     854,     860,     861,     862,     869,     870,     871,     872,
+     874,     875,     876,     878,     884,     887,     889,     890,     891,     901,
+     902,     908,     909,     910,     916,     917,     918,     919,     920,     923,
+     924,     925,     930,     931,     935,     938,     939,     942,     943,     945,
+     947,     948,     951,     952,     954,     956,     957,     960,     963,     964,
+     968,     971,     972,     975,     977,     980
+*SURFACE, NAME=SS2
+SS2_S1, S1
+*ELSET, ELSET=SS3_S1
+     443,     540,     642,     643,     649,     655,     659,     660,     668,     687,
+     704,     706,     727,     743,     749,     750,     753,     761,     764,     767,
+     779,     837,     839,     842,     847,     855,     894,     896,     905,     911,
+     912,     913,     914,     922,     929,     937,     940,     958,     959,     970,
+     974
+*ELSET, ELSET=SS3_S4
+     919
+*SURFACE, NAME=SS3
+SS3_S1, S1
+SS3_S4, S4
+**
+********************************** P R O P E R T I E S ************************
+*SOLID SECTION, ELSET=EB4, MATERIAL=Default-Steel
+**
+*END PART
+**
+**
+**
+********************************** E N D   P A R T S **********************************
+**
+**
+********************************** A S S E M B L Y ************************************
+**
+*ASSEMBLY, NAME=ASSEMBLY1
+**
+*INSTANCE, NAME=Part-Default_1, PART=Part-Default
+*END INSTANCE
+**
+*END ASSEMBLY
+**
+**
+**
+*MATERIAL, NAME = Default-Steel
+*ELASTIC, TYPE=ISOTROPIC
+2.068000e+05, 2.900000e-01
+*DENSITY
+7.000000e-06
+*CONDUCTIVITY,TYPE=ISO
+4.500000e-02
+*SPECIFIC HEAT
+5.000000e+02
+**
+**
+************************************** H I S T O R Y *************************************
+**
+*PREPRINT
+**
+**************************************** S T E P 1 ***************************************
+*STEP,INC=100,NAME=Default Set
+**
+*STATIC
+1, 1, 1e-05, 1
+**
+**
+**
+**
+*END STEP
diff --git a/test/unit/meshconvert/python/data/diffpack_tet.grid b/test/unit/meshconvert/python/data/diffpack_tet.grid
new file mode 100644
index 0000000..a4eedff
--- /dev/null
+++ b/test/unit/meshconvert/python/data/diffpack_tet.grid
@@ -0,0 +1,121 @@
+
+
+Finite element mesh (GridFE):
+
+  Number of space dim. =   3  embedded in physical space with dimension 3
+  Number of elements   =  48
+  Number of nodes      =  27
+
+  All elements are of the same type : true
+  Max number of nodes in an element: 4
+  Only one material                : true
+  Lattice data                     ? 0
+
+
+
+  12 boundary indicators: 
+    pressure_LV
+    pressure_RV
+    pressure_epi
+    traction_1
+    traction_2
+    u=0
+    v=0
+    w=0
+    u1=u1_0
+    u2=u2_0
+    u3=u3_0
+    free
+
+
+  Nodal coordinates and nodal boundary indicators,
+  the columns contain:
+   - node number
+   - coordinates
+   - no of boundary indicators that are set (ON)
+   - the boundary indicators that are set (ON) if any.
+# 
+   1  ( 0.00000e+00, 0.00000e+00, 0.00000e+00)  [3]  6  7  8  
+   2  ( 1.00000e+00, 0.00000e+00, 0.00000e+00)  [1]  3  
+   3  ( 0.00000e+00, 1.00000e+00, 0.00000e+00)  [1]  6  
+   4  ( 1.00000e+00, 1.00000e+00, 0.00000e+00)  [1]  3  
+   5  ( 0.00000e+00, 0.00000e+00, 1.00000e+00)  [2]  6  7  
+   6  ( 1.00000e+00, 0.00000e+00, 1.00000e+00)  [1]  3  
+   7  ( 0.00000e+00, 1.00000e+00, 1.00000e+00)  [1]  6  
+   8  ( 1.00000e+00, 1.00000e+00, 1.00000e+00)  [1]  3  
+   9  ( 5.00000e-01, 5.00000e-01, 5.00000e-01)  [0]  
+  10  ( 5.00000e-01, 5.00000e-01, 0.00000e+00)  [0]  
+  11  ( 1.00000e+00, 0.00000e+00, 5.00000e-01)  [1]  3  
+  12  ( 5.00000e-01, 0.00000e+00, 5.00000e-01)  [0]  
+  13  ( 0.00000e+00, 5.00000e-01, 0.00000e+00)  [1]  6  
+  14  ( 5.00000e-01, 0.00000e+00, 0.00000e+00)  [0]  
+  15  ( 5.00000e-01, 0.00000e+00, 1.00000e+00)  [0]  
+  16  ( 0.00000e+00, 5.00000e-01, 5.00000e-01)  [1]  6  
+  17  ( 0.00000e+00, 0.00000e+00, 5.00000e-01)  [2]  6  7  
+  18  ( 5.00000e-01, 5.00000e-01, 1.00000e+00)  [0]  
+  19  ( 0.00000e+00, 1.00000e+00, 5.00000e-01)  [1]  6  
+  20  ( 0.00000e+00, 5.00000e-01, 1.00000e+00)  [1]  6  
+  21  ( 5.00000e-01, 1.00000e+00, 0.00000e+00)  [0]  
+  22  ( 1.00000e+00, 5.00000e-01, 5.00000e-01)  [1]  3  
+  23  ( 1.00000e+00, 5.00000e-01, 0.00000e+00)  [1]  3  
+  24  ( 5.00000e-01, 1.00000e+00, 5.00000e-01)  [0]  
+  25  ( 1.00000e+00, 5.00000e-01, 1.00000e+00)  [1]  3  
+  26  ( 1.00000e+00, 1.00000e+00, 5.00000e-01)  [1]  3  
+  27  ( 5.00000e-01, 1.00000e+00, 1.00000e+00)  [0]  
+
+  Element types and connectivity
+  the columns contain:
+   - element number
+   - element type
+   - material number
+   - the global node numbers of the nodes in the element.
+#
+  1  ElmT4n3D  1         6   9  11  12
+  2  ElmT4n3D  1         9   3  10  13
+  3  ElmT4n3D  1        11  10   2  14
+  4  ElmT4n3D  1        12  13  14   1
+  5  ElmT4n3D  1        13  12  10   9
+  6  ElmT4n3D  1        13  12  14  10
+  7  ElmT4n3D  1        11  10  14  12
+  8  ElmT4n3D  1        11  10  12   9
+  9  ElmT4n3D  1         6   9  12  15
+ 10  ElmT4n3D  1         9   3  13  16
+ 11  ElmT4n3D  1        12  13   1  17
+ 12  ElmT4n3D  1        15  16  17   5
+ 13  ElmT4n3D  1        12  13  16   9
+ 14  ElmT4n3D  1        12  13  17  16
+ 15  ElmT4n3D  1        16  15  17  12
+ 16  ElmT4n3D  1        16  15  12   9
+ 17  ElmT4n3D  1         6   9  15  18
+ 18  ElmT4n3D  1         9   3  16  19
+ 19  ElmT4n3D  1        15  16   5  20
+ 20  ElmT4n3D  1        18  19  20   7
+ 21  ElmT4n3D  1        19  18  16   9
+ 22  ElmT4n3D  1        19  18  20  16
+ 23  ElmT4n3D  1        15  16  20  18
+ 24  ElmT4n3D  1        15  16  18   9
+ 25  ElmT4n3D  1         6   9  22  11
+ 26  ElmT4n3D  1         9   3  21  10
+ 27  ElmT4n3D  1        22  21   4  23
+ 28  ElmT4n3D  1        11  10  23   2
+ 29  ElmT4n3D  1        22  21  10   9
+ 30  ElmT4n3D  1        22  21  23  10
+ 31  ElmT4n3D  1        10  11  23  22
+ 32  ElmT4n3D  1        10  11  22   9
+ 33  ElmT4n3D  1         6   9  25  22
+ 34  ElmT4n3D  1         9   3  24  21
+ 35  ElmT4n3D  1        25  24   8  26
+ 36  ElmT4n3D  1        22  21  26   4
+ 37  ElmT4n3D  1        21  22  24   9
+ 38  ElmT4n3D  1        21  22  26  24
+ 39  ElmT4n3D  1        25  24  26  22
+ 40  ElmT4n3D  1        25  24  22   9
+ 41  ElmT4n3D  1         6   9  18  25
+ 42  ElmT4n3D  1         9   3  19  24
+ 43  ElmT4n3D  1        18  19   7  27
+ 44  ElmT4n3D  1        25  24  27   8
+ 45  ElmT4n3D  1        18  19  24   9
+ 46  ElmT4n3D  1        18  19  27  24
+ 47  ElmT4n3D  1        24  25  27  18
+ 48  ElmT4n3D  1        24  25  18   9
+
diff --git a/test/unit/meshconvert/python/data/diffpack_tri.grid b/test/unit/meshconvert/python/data/diffpack_tri.grid
new file mode 100644
index 0000000..cc2ad54
--- /dev/null
+++ b/test/unit/meshconvert/python/data/diffpack_tri.grid
@@ -0,0 +1,138 @@
+
+
+Finite element mesh (GridFE):
+
+  Number of space dim. =  2
+  Number of elements   =  64
+  Number of nodes      =  41
+
+  All elements are of the same type : dpTRUE
+  Max number of nodes in an element: 3
+  Only one subdomain               : dpFALSE
+  Lattice data                     ? 0
+
+
+
+  2 Boundary indicators:  1 2 
+
+
+  Nodal coordinates and nodal boundary indicators,
+  the columns contain:
+   - node number
+   - coordinates
+   - no of boundary indicators that are set (ON)
+   - the boundary indicators that are set (ON) if any.
+#
+           1  (        1.000000,         1.000000) [2] 1 3
+           2  (        0.000000,         1.000000) [2] 1 2
+           3  (        0.000000,         0.000000) [2] 1 2
+           4  (        1.000000,         0.000000) [2] 1 3
+           5  (        0.500000,         0.500000) [0]
+           6  (        0.500000,         1.000000) [1] 1
+           7  (        0.000000,         0.500000) [1] 2
+           8  (        0.500000,         0.000000) [1] 1
+           9  (        1.000000,         0.500000) [1] 3
+          10  (        0.750000,         0.750000) [0]
+          11  (        0.250000,         0.250000) [0]
+          12  (        0.750000,         0.250000) [0]
+          13  (        0.250000,         0.750000) [0]
+          14  (        0.750000,         1.000000) [1] 1
+          15  (        0.000000,         0.750000) [1] 2
+          16  (        0.250000,         0.000000) [1] 1
+          17  (        1.000000,         0.250000) [1] 3
+          18  (        0.875000,         0.875000) [0]
+          19  (        0.375000,         0.375000) [0]
+          20  (        0.250000,         1.000000) [1] 1
+          21  (        0.000000,         0.250000) [1] 2
+          22  (        0.750000,         0.000000) [1] 1
+          23  (        1.000000,         0.750000) [1] 3
+          24  (        0.625000,         0.625000) [0]
+          25  (        0.125000,         0.125000) [0]
+          26  (        0.375000,         0.125000) [0]
+          27  (        0.875000,         0.375000) [0]
+          28  (        0.875000,         0.125000) [0]
+          29  (        0.625000,         0.875000) [0]
+          30  (        0.125000,         0.625000) [0]
+          31  (        0.125000,         0.875000) [0]
+          32  (        0.625000,         0.125000) [0]
+          33  (        0.500000,         0.250000) [0]
+          34  (        0.625000,         0.375000) [0]
+          35  (        0.875000,         0.625000) [0]
+          36  (        0.750000,         0.500000) [0]
+          37  (        0.375000,         0.875000) [0]
+          38  (        0.500000,         0.750000) [0]
+          39  (        0.375000,         0.625000) [0]
+          40  (        0.125000,         0.375000) [0]
+          41  (        0.250000,         0.500000) [0]
+
+  Element types and connectivity
+  the columns contain:
+   - element number
+   - element type
+   - subdomain number
+   - the global node numbers of the nodes in the element.
+#
+           1  ElmT3n2D            1                   3              16              25
+           2  ElmT3n2D            1                   4              17              28
+           3  ElmT3n2D            2                   1              14              18
+           4  ElmT3n2D            2                   2              15              31
+           5  ElmT3n2D            1                   4              28              22
+           6  ElmT3n2D            1                   5              19              34
+           7  ElmT3n2D            1                   8              32              26
+           8  ElmT3n2D            1                   1              18              23
+           9  ElmT3n2D            1                   5              34              24
+          10  ElmT3n2D            1                   9              35              27
+          11  ElmT3n2D            2                   2              31              20
+          12  ElmT3n2D            2                   5              24              39
+          13  ElmT3n2D            2                   6              37              29
+          14  ElmT3n2D            2                   3              25              21
+          15  ElmT3n2D            2                   5              39              19
+          16  ElmT3n2D            2                   7              40              30
+          17  ElmT3n2D            1                   8              26              16
+          18  ElmT3n2D            1                  11              25              26
+          19  ElmT3n2D            1                  16              26              25
+          20  ElmT3n2D            1                   9              27              17
+          21  ElmT3n2D            1                  12              28              27
+          22  ElmT3n2D            1                  17              27              28
+          23  ElmT3n2D            2                   6              29              14
+          24  ElmT3n2D            2                  10              18              29
+          25  ElmT3n2D            2                  14              29              18
+          26  ElmT3n2D            2                   7              30              15
+          27  ElmT3n2D            2                  13              31              30
+          28  ElmT3n2D            2                  15              30              31
+          29  ElmT3n2D            1                  12              32              28
+          30  ElmT3n2D            1                   8              22              32
+          31  ElmT3n2D            1                  28              32              22
+          32  ElmT3n2D            1                  11              33              19
+          33  ElmT3n2D            1                  12              34              33
+          34  ElmT3n2D            1                  19              33              34
+          35  ElmT3n2D            1                  12              33              32
+          36  ElmT3n2D            1                  11              26              33
+          37  ElmT3n2D            1                  32              33              26
+          38  ElmT3n2D            1                  10              35              18
+          39  ElmT3n2D            1                   9              23              35
+          40  ElmT3n2D            1                  18              35              23
+          41  ElmT3n2D            1                  12              36              34
+          42  ElmT3n2D            1                  10              24              36
+          43  ElmT3n2D            1                  34              36              24
+          44  ElmT3n2D            1                  10              36              35
+          45  ElmT3n2D            1                  12              27              36
+          46  ElmT3n2D            1                  35              36              27
+          47  ElmT3n2D            2                  13              37              31
+          48  ElmT3n2D            2                   6              20              37
+          49  ElmT3n2D            2                  31              37              20
+          50  ElmT3n2D            2                  10              38              24
+          51  ElmT3n2D            2                  13              39              38
+          52  ElmT3n2D            2                  24              38              39
+          53  ElmT3n2D            2                  13              38              37
+          54  ElmT3n2D            2                  10              29              38
+          55  ElmT3n2D            2                  37              38              29
+          56  ElmT3n2D            2                  11              40              25
+          57  ElmT3n2D            2                   7              21              40
+          58  ElmT3n2D            2                  25              40              21
+          59  ElmT3n2D            2                  13              41              39
+          60  ElmT3n2D            2                  11              19              41
+          61  ElmT3n2D            2                  39              41              19
+          62  ElmT3n2D            2                  11              41              40
+          63  ElmT3n2D            2                  13              30              41
+          64  ElmT3n2D            2                  40              41              30
diff --git a/test/unit/meshconvert/python/data/gmsh.msh b/test/unit/meshconvert/python/data/gmsh.msh
new file mode 100644
index 0000000..8e7f3b2
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh.msh
@@ -0,0 +1,29 @@
+$MeshFormat
+2.1 0 8
+$EndMeshFormat
+$Nodes
+10
+1 0 0 0
+2 1 0 1
+3 -0 0.8 0.6
+4 0.3 0.8 -0.1
+5 0.6 0.3 -0.4
+6 0.5 0 0.5
+7 0.5 0.4 0.8
+8 0.76 0.26 0.63
+9 0.53 0.53 0.26
+10 0.8 0.15 0.3
+$EndNodes
+$Elements
+10
+1 4 3 1000 25 0 10 6 2 8
+2 4 3 1000 25 0 5 9 1 10
+3 4 3 1000 25 0 9 6 1 10
+4 4 3 1000 25 0 9 6 10 8
+5 4 3 1000 25 0 9 4 5 1
+6 4 3 2000 27 0 9 3 4 1
+7 4 3 2000 27 0 8 6 7 9
+8 4 3 2000 27 0 6 3 7 9
+9 4 3 2000 27 0 2 8 6 7
+10 4 3 2000 27 0 6 3 9 1
+$EndElements
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_1D_2.geo b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_1D_2.geo
new file mode 100644
index 0000000..afd4ba8
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_1D_2.geo
@@ -0,0 +1,10 @@
+Point(1) = {0, 0, 0, 0.1};
+Extrude {0.5, 0, 0} {
+  Point{1}; Layers{5};
+}
+Extrude {0.5, 0, 0} {
+  Point{2}; Layers{5};
+}
+Physical Point(999) = {1,3};
+Physical Line(1) = {1};
+Physical Line(2) = {2};
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_1D_2.msh b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_1D_2.msh
new file mode 100644
index 0000000..44c27da
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_1D_2.msh
@@ -0,0 +1,32 @@
+$MeshFormat
+2.2 0 8
+$EndMeshFormat
+$Nodes
+11
+1 0 0 0
+2 0.5 0 0
+3 1 0 0
+4 0.1 0 0
+5 0.2 0 0
+6 0.3 0 0
+7 0.4 0 0
+8 0.6 0 0
+9 0.7 0 0
+10 0.8 0 0
+11 0.9 0 0
+$EndNodes
+$Elements
+12
+1 15 2 999 1 1
+2 15 2 999 3 3
+3 1 2 1 1 1 4
+4 1 2 1 1 4 5
+5 1 2 1 1 5 6
+6 1 2 1 1 6 7
+7 1 2 1 1 7 2
+8 1 2 2 2 2 8
+9 1 2 2 2 8 9
+10 1 2 2 2 9 10
+11 1 2 2 2 10 11
+12 1 2 2 2 11 3
+$EndElements
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_1.geo b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_1.geo
new file mode 100644
index 0000000..b54a07f
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_1.geo
@@ -0,0 +1,15 @@
+cl1 = 0.5;
+Point(1) = {0, 0, 0, cl1};
+Point(2) = {1, 0, 0, cl1};
+Point(3) = {1, 1, 0, cl1};
+Point(4) = {0, 1, 0, cl1};
+Line(1) = {1, 4};
+Line(2) = {4, 3};
+Line(3) = {3, 2};
+Line(4) = {2, 1};
+Line Loop(6) = {2, 3, 4, 1};
+Plane Surface(6) = {6};
+PEC = 999;
+Physical Line(PEC) = {4};
+cl1 = 0;
+Physical Surface(cl1) = {6};
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_1.msh b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_1.msh
new file mode 100644
index 0000000..e9d1b32
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_1.msh
@@ -0,0 +1,19 @@
+$MeshFormat
+2.2 0 8
+$EndMeshFormat
+$Nodes
+5
+1 0 0 0
+2 1 0 0
+3 1 1 0
+4 0 1 0
+5 0.5 0.5 0
+$EndNodes
+$Elements
+5
+1 1 2 999 4 2 1
+2 2 2 0 6 2 5 3
+3 2 2 0 6 4 5 1
+4 2 2 0 6 5 4 3
+5 2 2 0 6 5 2 1
+$EndElements
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_2.geo b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_2.geo
new file mode 100644
index 0000000..2cac4bc
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_2.geo
@@ -0,0 +1,15 @@
+cl1 = 0.5;
+Point(1) = {0, 0, 0, cl1};
+Point(2) = {1, 0, 0, cl1};
+Point(3) = {1, 1, 0, cl1};
+Point(4) = {0, 1, 0, cl1};
+Line(1) = {1, 4};
+Line(2) = {4, 3};
+Line(3) = {3, 2};
+Line(4) = {2, 1};
+Line Loop(6) = {2, 3, 4, 1};
+Plane Surface(6) = {6};
+PEC = 999;
+Physical Line(PEC) = {2,4};
+cl1 = 0;
+Physical Surface(cl1) = {6};
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_2.msh b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_2.msh
new file mode 100644
index 0000000..e613aa8
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_2.msh
@@ -0,0 +1,20 @@
+$MeshFormat
+2.2 0 8
+$EndMeshFormat
+$Nodes
+5
+1 0 0 0
+2 1 0 0
+3 1 1 0
+4 0 1 0
+5 0.5 0.5 0
+$EndNodes
+$Elements
+6
+1 1 2 999 2 4 3
+2 1 2 999 4 2 1
+3 2 2 0 6 1 5 2
+4 2 2 0 6 3 5 4
+5 2 2 0 6 5 3 2
+6 2 2 0 6 5 1 4
+$EndElements
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_3.geo b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_3.geo
new file mode 100644
index 0000000..ca79ccc
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_3.geo
@@ -0,0 +1,15 @@
+cl1 = 0.5;
+Point(1) = {0, 0, 0, cl1};
+Point(2) = {1, 0, 0, cl1};
+Point(3) = {1, 1, 0, cl1};
+Point(4) = {0, 1, 0, cl1};
+Line(1) = {1, 4};
+Line(2) = {4, 3};
+Line(3) = {3, 2};
+Line(4) = {2, 1};
+Line Loop(6) = {2, 3, 4, 1};
+Plane Surface(6) = {6};
+PEC = 999;
+Physical Line(PEC) = {2,4,1};
+cl1 = 0;
+Physical Surface(cl1) = {6};
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_3.msh b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_3.msh
new file mode 100644
index 0000000..99856bb
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_3.msh
@@ -0,0 +1,21 @@
+$MeshFormat
+2.2 0 8
+$EndMeshFormat
+$Nodes
+5
+1 0 0 0
+2 1 0 0
+3 1 1 0
+4 0 1 0
+5 0.5 0.5 0
+$EndNodes
+$Elements
+7
+1 1 2 999 1 1 4
+2 1 2 999 2 4 3
+3 1 2 999 4 2 1
+4 2 2 0 6 5 3 2
+5 2 2 0 6 5 1 4
+6 2 2 0 6 1 5 2
+7 2 2 0 6 3 5 4
+$EndElements
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_4.geo b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_4.geo
new file mode 100644
index 0000000..41f63f7
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_4.geo
@@ -0,0 +1,15 @@
+cl1 = 0.5;
+Point(1) = {0, 0, 0, cl1};
+Point(2) = {1, 0, 0, cl1};
+Point(3) = {1, 1, 0, cl1};
+Point(4) = {0, 1, 0, cl1};
+Line(1) = {1, 4};
+Line(2) = {4, 3};
+Line(3) = {3, 2};
+Line(4) = {2, 1};
+Line Loop(6) = {2, 3, 4, 1};
+Plane Surface(6) = {6};
+PEC = 999;
+Physical Line(PEC) = {1,2,3,4};
+cl1 = 0;
+Physical Surface(cl1) = {6};
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_4.msh b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_4.msh
new file mode 100644
index 0000000..5dfa8b6
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_2D_4.msh
@@ -0,0 +1,22 @@
+$MeshFormat
+2.2 0 8
+$EndMeshFormat
+$Nodes
+5
+1 0 0 0
+2 1 0 0
+3 1 1 0
+4 0 1 0
+5 0.5 0.5 0
+$EndNodes
+$Elements
+8
+1 1 2 999 1 1 4
+2 1 2 999 2 4 3
+3 1 2 999 3 3 2
+4 1 2 999 4 2 1
+5 2 2 0 6 2 5 3
+6 2 2 0 6 4 5 1
+7 2 2 0 6 5 4 3
+8 2 2 0 6 5 2 1
+$EndElements
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_3D_1.geo b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_3D_1.geo
new file mode 100644
index 0000000..459c8c0
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_3D_1.geo
@@ -0,0 +1,39 @@
+cl1 = 1;
+Point(1) = {0, 0, 0, cl1};
+Point(2) = {1, 0, 0, cl1};
+Point(3) = {1, 1, 0, cl1};
+Point(4) = {0, 1, 0, cl1};
+Point(5) = {0, 0, 1, cl1};
+Point(6) = {1, 0, 1, cl1};
+Point(7) = {1, 1, 1, cl1};
+Point(8) = {0, 1, 1, cl1};
+Line(1) = {1, 2};
+Line(2) = {2, 3};
+Line(3) = {3, 4};
+Line(4) = {4, 1};
+Line(5) = {5, 6};
+Line(6) = {6, 7};
+Line(7) = {7, 8};
+Line(8) = {8, 5};
+Line(9) = {1, 5};
+Line(10) = {2, 6};
+Line(11) = {3, 7};
+Line(12) = {4, 8};
+Line Loop(15) = {1, 2, 3, 4};
+Plane Surface(15) = {15};
+Line Loop(17) = {5, 6, 7, 8};
+Plane Surface(17) = {17};
+Line Loop(19) = {10, -5, -9, 1};
+Plane Surface(19) = {19};
+Line Loop(21) = {2, 11, -6, -10};
+Plane Surface(21) = {21};
+Line Loop(22) = {7, -12, -3, 11};
+Plane Surface(22) = {22};
+Line Loop(24) = {4, 9, -8, -12};
+Plane Surface(24) = {24};
+Surface Loop(26) = {17, 19, 21, 15, 22, 24};
+Volume(26) = {26};
+PEC = 999;
+Physical Surface(PEC) = {17};
+cl1 = 0;
+Physical Volume(cl1) = {26};
diff --git a/test/unit/meshconvert/python/data/gmsh_test_facet_regions_3D_1.msh b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_3D_1.msh
new file mode 100644
index 0000000..48f6519
--- /dev/null
+++ b/test/unit/meshconvert/python/data/gmsh_test_facet_regions_3D_1.msh
@@ -0,0 +1,51 @@
+$MeshFormat
+2.2 0 8
+$EndMeshFormat
+$Nodes
+14
+1 0 0 0
+2 1 0 0
+3 1 1 0
+4 0 1 0
+5 0 0 1
+6 1 0 1
+7 1 1 1
+8 0 1 1
+9 0.5 0.5 0
+10 0.5 0.5 1
+11 0.5 0 0.5
+12 1 0.5 0.5
+13 0.5 1 0.5
+14 0 0.5 0.5
+$EndNodes
+$Elements
+28
+1 2 2 999 17 5 6 10
+2 2 2 999 17 7 8 10
+3 2 2 999 17 10 6 7
+4 2 2 999 17 10 8 5
+5 4 2 0 26 14 8 5 10
+6 4 2 0 26 3 9 13 4
+7 4 2 0 26 9 12 13 10
+8 4 2 0 26 6 11 5 10
+9 4 2 0 26 12 13 10 7
+10 4 2 0 26 14 9 13 10
+11 4 2 0 26 6 12 10 7
+12 4 2 0 26 12 9 2 11
+13 4 2 0 26 6 12 11 10
+14 4 2 0 26 14 11 5 1
+15 4 2 0 26 6 12 2 11
+16 4 2 0 26 13 8 10 7
+17 4 2 0 26 12 3 13 7
+18 4 2 0 26 14 8 13 4
+19 4 2 0 26 11 9 1 14
+20 4 2 0 26 9 14 4 1
+21 4 2 0 26 8 14 13 10
+22 4 2 0 26 11 14 5 10
+23 4 2 0 26 12 9 11 10
+24 4 2 0 26 14 9 4 13
+25 4 2 0 26 2 9 1 11
+26 4 2 0 26 12 9 3 2
+27 4 2 0 26 12 9 13 3
+28 4 2 0 26 11 9 14 10
+$EndElements
diff --git a/test/unit/meshconvert/python/data/test_Triangle_3.edge b/test/unit/meshconvert/python/data/test_Triangle_3.edge
new file mode 100644
index 0000000..f57a620
--- /dev/null
+++ b/test/unit/meshconvert/python/data/test_Triangle_3.edge
@@ -0,0 +1,118 @@
+116  1
+   1   29  2  0
+   2   2  1  1
+   3   1  29  1
+   4   22  2  0
+   5   2  23  0
+   6   23  22  1
+   7   4  3  1
+   8   3  21  0
+   9   21  4  0
+  10   22  21  1
+  11   3  22  0
+  12   3  2  1
+  13   21  20  1
+  14   20  4  0
+  15   29  23  0
+  16   4  26  0
+  17   26  5  0
+  18   5  4  1
+  19   23  25  0
+  20   25  24  1
+  21   24  23  1
+  22   29  25  1
+  23   19  26  0
+  24   4  19  0
+  25   18  26  0
+  26   19  18  1
+  27   20  19  1
+  28   26  28  1
+  29   28  5  0
+  30   32  33  1
+  31   33  50  0
+  32   50  32  0
+  33   33  49  0
+  34   49  50  1
+  35   50  51  1
+  36   51  32  0
+  37   58  30  1
+  38   30  31  1
+  39   31  58  0
+  40   31  52  0
+  41   52  58  0
+  42   51  31  0
+  43   31  32  1
+  44   51  52  1
+  45   48  33  0
+  46   33  55  0
+  47   55  48  0
+  48   34  57  0
+  49   57  55  1
+  50   55  34  0
+  51   48  49  1
+  52   55  47  0
+  53   47  48  1
+  54   53  54  1
+  55   54  52  0
+  56   52  53  1
+  57   54  58  1
+  58   33  34  1
+  59   28  6  0
+  60   6  5  1
+  61   12  14  0
+  62   14  13  1
+  63   13  12  1
+  64   12  11  1
+  65   11  14  0
+  66   7  6  1
+  67   6  27  0
+  68   27  7  0
+  69   28  27  1
+  70   27  18  0
+  71   18  7  0
+  72   27  26  1
+  73   18  17  1
+  74   17  7  0
+  75   9  11  0
+  76   11  10  1
+  77   10  9  1
+  78   8  14  0
+  79   14  9  0
+  80   9  8  1
+  81   16  15  1
+  82   15  7  0
+  83   7  16  0
+  84   8  7  1
+  85   15  8  0
+  86   15  14  1
+  87   17  16  1
+  88   35  56  0
+  89   56  57  1
+  90   57  35  0
+  91   47  56  0
+  92   56  36  0
+  93   36  47  0
+  94   55  56  1
+  95   43  41  0
+  96   41  42  1
+  97   42  43  1
+  98   36  46  0
+  99   46  47  1
+ 100   35  36  1
+ 101   34  35  1
+ 102   44  45  1
+ 103   45  36  0
+ 104   36  44  0
+ 105   36  37  1
+ 106   37  44  0
+ 107   45  46  1
+ 108   37  43  0
+ 109   43  44  1
+ 110   43  38  0
+ 111   38  40  0
+ 112   40  43  0
+ 113   37  38  1
+ 114   39  40  1
+ 115   38  39  1
+ 116   40  41  1
+# Generated by triangle -Ae AA.poly
diff --git a/test/unit/meshconvert/python/data/test_Triangle_3.ele b/test/unit/meshconvert/python/data/test_Triangle_3.ele
new file mode 100644
index 0000000..1713dee
--- /dev/null
+++ b/test/unit/meshconvert/python/data/test_Triangle_3.ele
@@ -0,0 +1,60 @@
+58  3  1
+   1      29     2     1  10
+   2      22     2    23  10
+   3       4     3    21  10
+   4      22    21     3  10
+   5       3     2    22  10
+   6       4    21    20  10
+   7       2    29    23  10
+   8       4    26     5  10
+   9      23    25    24  10
+  10      25    23    29  10
+  11      19    26     4  10
+  12      18    26    19  10
+  13      19     4    20  10
+  14       5    26    28  10
+  15      32    33    50  -10
+  16      50    33    49  -10
+  17      32    50    51  -10
+  18      58    30    31  -10
+  19      58    31    52  -10
+  20      51    31    32  -10
+  21      52    31    51  -10
+  22      48    33    55  -10
+  23      34    57    55  -10
+  24      49    33    48  -10
+  25      55    47    48  -10
+  26      53    54    52  -10
+  27      52    54    58  -10
+  28      33    34    55  -10
+  29      28     6     5  10
+  30      12    14    13  10
+  31      14    12    11  10
+  32       7     6    27  10
+  33       6    28    27  10
+  34       7    27    18  10
+  35      26    18    27  10
+  36       7    18    17  10
+  37       9    11    10  10
+  38       8    14     9  10
+  39      16    15     7  10
+  40       8     7    15  10
+  41      14     8    15  10
+  42      16     7    17  10
+  43       9    14    11  10
+  44      35    56    57  -10
+  45      47    56    36  -10
+  46      47    55    56  -10
+  47      43    41    42  -10
+  48      36    46    47  -10
+  49      36    56    35  -10
+  50      34    35    57  -10
+  51      44    45    36  -10
+  52      36    37    44  -10
+  53      45    46    36  -10
+  54      44    37    43  -10
+  55      43    38    40  -10
+  56      38    43    37  -10
+  57      39    40    38  -10
+  58      43    40    41  -10
+# Generated by triangle -Ae AA.poly
diff --git a/test/unit/meshconvert/python/data/test_Triangle_3.node b/test/unit/meshconvert/python/data/test_Triangle_3.node
new file mode 100644
index 0000000..a3bdc1e
--- /dev/null
+++ b/test/unit/meshconvert/python/data/test_Triangle_3.node
@@ -0,0 +1,60 @@
+58  2  1  1
+   1    0.20000000000000001  -0.77639999999999998  -0.56999999999999995    1
+   2    0.22  -0.7732  -0.55000000000000004    1
+   3    0.24560000000000001  -0.75639999999999996  -0.51000000000000001    1
+   4    0.27760000000000001  -0.70199999999999996  -0.53000000000000003    1
+   5    0.48880000000000001  -0.20760000000000001  0.28000000000000003    1
+   6    0.50480000000000003  -0.20760000000000001  0.29999999999999999    1
+   7    0.74080000000000001  -0.73960000000000004  0    1
+   8    0.75600000000000001  -0.76119999999999999  -0.01    1
+   9    0.77439999999999998  -0.77239999999999998  0    1
+  10    0.80000000000000004  -0.77639999999999998  0.02    1
+  11    0.80000000000000004  -0.79239999999999999  0.01    1
+  12    0.57920000000000005  -0.79239999999999999  -0.20999999999999999    1
+  13    0.57920000000000005  -0.77639999999999998  -0.20000000000000001    1
+  14    0.62160000000000004  -0.77159999999999995  -0.14999999999999999    1
+  15    0.63360000000000005  -0.76280000000000003  -0.13    1
+  16    0.63919999999999999  -0.74439999999999995  -0.10000000000000001    1
+  17    0.62080000000000002  -0.68440000000000001  -0.059999999999999998    1
+  18    0.58720000000000006  -0.60440000000000005  -0.01    1
+  19    0.36080000000000001  -0.60440000000000005  -0.23999999999999999    1
+  20    0.31919999999999998  -0.70679999999999998  -0.39000000000000001    1
+  21    0.312  -0.73960000000000004  -0.42999999999999999    1
+  22    0.31840000000000002  -0.76119999999999999  -0.44    1
+  23    0.33439999999999998  -0.77159999999999995  -0.44    1
+  24    0.37119999999999997  -0.77639999999999998  -0.40999999999999998    1
+  25    0.37119999999999997  -0.79239999999999999  -0.41999999999999998    1
+  26    0.37440000000000001  -0.56999999999999995  -0.20000000000000001    1
+  27    0.57440000000000002  -0.56999999999999995  0    1
+  28    0.47360000000000002  -0.33079999999999998  0.14000000000000001    1
+  29    0.20000000000000001  -0.79239999999999999  -0.58999999999999997    1
+  30    0.20000000000000001  0.77639999999999998  -0.56999999999999995    1
+  31    0.22  0.7732  -0.55000000000000004    1
+  32    0.24560000000000001  0.75639999999999996  -0.51000000000000001    1
+  33    0.27760000000000001  0.70199999999999996  -0.53000000000000003    1
+  34    0.48880000000000001  0.20760000000000001  0.28000000000000003    1
+  35    0.50480000000000003  0.20760000000000001  0.29999999999999999    1
+  36    0.74080000000000001  0.73960000000000004  0    1
+  37    0.75600000000000001  0.76119999999999999  -0.01    1
+  38    0.77439999999999998  0.77239999999999998  0    1
+  39    0.80000000000000004  0.77639999999999998  0.02    1
+  40    0.80000000000000004  0.79239999999999999  0.01    1
+  41    0.57920000000000005  0.79239999999999999  -0.20999999999999999    1
+  42    0.57920000000000005  0.77639999999999998  -0.20000000000000001    1
+  43    0.62160000000000004  0.77159999999999995  -0.14999999999999999    1
+  44    0.63360000000000005  0.76280000000000003  -0.13    1
+  45    0.63919999999999999  0.74439999999999995  -0.10000000000000001    1
+  46    0.62080000000000002  0.68440000000000001  -0.059999999999999998    1
+  47    0.58720000000000006  0.60440000000000005  -0.01    1
+  48    0.36080000000000001  0.60440000000000005  -0.23999999999999999    1
+  49    0.31919999999999998  0.70679999999999998  -0.39000000000000001    1
+  50    0.312  0.73960000000000004  -0.42999999999999999    1
+  51    0.31840000000000002  0.76119999999999999  -0.44    1
+  52    0.33439999999999998  0.77159999999999995  -0.44    1
+  53    0.37119999999999997  0.77639999999999998  -0.40999999999999998    1
+  54    0.37119999999999997  0.79239999999999999  -0.41999999999999998    1
+  55    0.37440000000000001  0.56999999999999995  -0.20000000000000001    1
+  56    0.57440000000000002  0.56999999999999995  0    1
+  57    0.47360000000000002  0.33079999999999998  0.14000000000000001    1
+  58    0.20000000000000001  0.79239999999999999  -0.58999999999999997    1
+# Generated by triangle -Ae AA.poly
diff --git a/test/unit/meshconvert/python/data/triangle.ele b/test/unit/meshconvert/python/data/triangle.ele
new file mode 100644
index 0000000..1d0e2eb
--- /dev/null
+++ b/test/unit/meshconvert/python/data/triangle.ele
@@ -0,0 +1,161 @@
+159  3  0
+   0      62    61    39
+   1      10    13    12
+   2       7    15     9
+   3      90    32    31
+   4      37    39    28
+   5      52    29    56
+   6      19    16    18
+   7       5     9    10
+   8      26    19     7
+   9      32     6    31
+  10      66    58    47
+  11      20    13    17
+  12      15    13     9
+  13      15     7    18
+  14      26    28    19
+  15      13    20    12
+  16      55    51    52
+  17       9    13    10
+  18      60    36    49
+  19      13    15    17
+  20      22    20    33
+  21      32    24    91
+  22      21    20    17
+  23      89    15    18
+  24      17    24    21
+  25      19    18     7
+  26      18    16    89
+  27       7    27    26
+  28      19     4    86
+  29      17    89    24
+  30      22    12    20
+  31      33     1    22
+  32      50    53    56
+  33      33    21    25
+  34      28     4    19
+  35      21    33    20
+  36      90    21    24
+  37       9    55     7
+  38      21    14    25
+  39      26    23    28
+  40       0    42    50
+  41      23    26    27
+  42      23    37    28
+  43      34    46    39
+  44      38    41    40
+  45      52     8    27
+  46      37    38    34
+  47      41    53    30
+  48      36    32    91
+  49      90    14    21
+  50       4    77    86
+  51       1    33    25
+  52       8    23    27
+  53      59    46    34
+  54      49    81    83
+  55      54    47    58
+  56      70    65    79
+  57      49    45    44
+  58      38    37    23
+  59      39    37    34
+  60      23     8    38
+  61      43    40    41
+  62      40    11    59
+  63      46    35    39
+  64      62    39    35
+  65      44    60    49
+  66       8    41    38
+  67      43    11    40
+  68      59    58    46
+  69      53    41     8
+  70      41    30    43
+  71      34    40    59
+  72      44     6    60
+  73      38    40    34
+  74       7    55    27
+  75      57    64    70
+  76      71    63    35
+  77      61     4    28
+  78      42    30    53
+  79       4    61    76
+  80       5    51    55
+  81      55    52    27
+  82      51    29    52
+  83       8    52    56
+  84      50    42    53
+  85      55     9     5
+  86      50    56    29
+  87       8    56    53
+  88      63    57    62
+  89      57    63    64
+  90      72     2    68
+  91      46    58    35
+  92      11    54    59
+  93      58    59    54
+  94       6    32    60
+  95      36    60    32
+  96      39    61    28
+  97      76    61    57
+  98      63    62    35
+  99      61    62    57
+ 100      72    66    67
+ 101      63    92    64
+ 102      65    92    73
+ 103      58    66    71
+ 104      80    74    88
+ 105      36    77    81
+ 106      71    78    93
+ 107      92    71    93
+ 108      70    64    65
+ 109      66    47    67
+ 110      71    35    58
+ 111      94    48    75
+ 112      69    48    73
+ 113      76    77     4
+ 114      72    71    66
+ 115      68    69    93
+ 116       2    72    67
+ 117      78    72    68
+ 118      74    80    95
+ 119      92    65    64
+ 120      94    65    73
+ 121      75    74    95
+ 122      73    48    94
+ 123      57    70    76
+ 124      77    76    70
+ 125      70    79    82
+ 126      77    36    86
+ 127      92    63    71
+ 128      71    72    78
+ 129      79    94    95
+ 130      81    49    36
+ 131      84    80    88
+ 132      84    49    83
+ 133      82    77    70
+ 134      82    79    83
+ 135      83    79    80
+ 136      77    82    81
+ 137      83    80    84
+ 138      81    82    83
+ 139      74    85    88
+ 140      49    84    45
+ 141       3    88    85
+ 142      84    87    45
+ 143      91    86    36
+ 144      86    16    19
+ 145      84    88    87
+ 146       3    87    88
+ 147      89    17    15
+ 148      91    89    16
+ 149      32    90    24
+ 150      14    90    31
+ 151      89    91    24
+ 152      86    91    16
+ 153      69    73    92
+ 154      68    93    78
+ 155      69    92    93
+ 156      79    65    94
+ 157      79    95    80
+ 158      75    95    94
+# Generated by triangle -a0.01q30 simple.node
diff --git a/test/unit/meshconvert/python/data/triangle.node b/test/unit/meshconvert/python/data/triangle.node
new file mode 100644
index 0000000..4ad7234
--- /dev/null
+++ b/test/unit/meshconvert/python/data/triangle.node
@@ -0,0 +1,98 @@
+96  2  0  1
+   0    0  0    1
+   1    0  1    1
+   2    1  0    1
+   3    1  1    1
+   4    0.5  0.5    0
+   5    0  0.5    1
+   6    0.5  1    1
+   7    0.25  0.5    0
+   8    0.20298237488621035  0.22287402825896152    0
+   9    0.125  0.5    0
+  10    0  0.625    1
+  11    0.5  0    1
+  12    0  0.75    1
+  13    0.083333333333333329  0.6875    0
+  14    0.25  1    1
+  15    0.1875  0.6122685185185186    0
+  16    0.375  0.64311879534173344    0
+  17    0.20337108593858963  0.74397499363576824    0
+  18    0.28679162379972561  0.59401310137457042    0
+  19    0.375  0.50528745912760253    0
+  20    0.10328288429366807  0.80090495683600182    0
+  21    0.21152041373211666  0.87474946729089553    0
+  22    0  0.875    1
+  23    0.32089826129419596  0.30410173870580404    0
+  24    0.35195167381446679  0.80035721511364    0
+  25    0.125  1    1
+  26    0.31628301439626477  0.41321007379055807    0
+  27    0.2284840788842788  0.35484442826710155    0
+  28    0.45175279770757681  0.36428862206910451    0
+  29    0  0.25    1
+  30    0.25  0    1
+  31    0.375  1    1
+  32    0.44424935171945745  0.88662758800449182    0
+  33    0.097760727328293648  0.90223927267170634    0
+  34    0.45738798283878329  0.17969566374363238    0
+  35    0.67802510619064738  0.2356032278494338    0
+  36    0.49401838703908013  0.74087319674700325    0
+  37    0.41548478905000613  0.27079895221884098    0
+  38    0.3288710357480748  0.17577234621341173    0
+  39    0.54400173614071456  0.27472226974906161    0
+  40    0.4375  0.080079320864191311    0
+  41    0.25993367177498178  0.10112398444869998    0
+  42    0.125  0    1
+  43    0.375  0    1
+  44    0.625  1    1
+  45    0.75  1    1
+  46    0.54840743001176451  0.18372046403839223    0
+  47    0.75  0    1
+  48    1  0.5    1
+  49    0.625  0.86813767066762126    0
+  50    0  0.125    1
+  51    0  0.375    1
+  52    0.11119627716704297  0.30905974556395743    0
+  53    0.14075081821000779  0.11956868922947742    0
+  54    0.625  0    1
+  55    0.14218842162187012  0.40278830398072712    0
+  56    0.092970149787420672  0.20916674343834879    0
+  57    0.65731413752855783  0.41379081690481823    0
+  58    0.6875  0.10970224189544132    0
+  59    0.5625  0.081769767980438057    0
+  60    0.53805270869934374  0.91089382069502667    0
+  61    0.5505459171436794  0.40559830281522219    0
+  62    0.63003236530173168  0.32032239648298022    0
+  63    0.75430108411978036  0.33476630671692287    0
+  64    0.7535690707031788  0.43289630138800084    0
+  65    0.81555596732160485  0.50897294922033132    0
+  66    0.78724733449849127  0.0938756963090525    0
+  67    0.875  0    1
+  68    1  0.25    1
+  69    1  0.375    1
+  70    0.67890812080630991  0.55702133450455749    0
+  71    0.80262644822728924  0.21867738483877674    0
+  72    0.92260163907755366  0.13244918046122317    0
+  73    0.90654721227336688  0.4791872744888242    0
+  74    1  0.75    1
+  75    1  0.625    1
+  76    0.59991540418828415  0.49568752528325605    0
+  77    0.56274481006865207  0.62509492757459384    0
+  78    0.90195417066425843  0.23029988861772704    0
+  79    0.78098262945372543  0.62898256956955256    0
+  80    0.84106566238785851  0.77894184057925364    0
+  81    0.62300633576917519  0.73915366778201619    0
+  82    0.6839678716997456  0.65821944124830978    0
+  83    0.73222791477190285  0.75799595903838035    0
+  84    0.76572321229797546  0.87719074616077775    0
+  85    1  0.875    1
+  86    0.47025207734868557  0.64847815623034655    0
+  87    0.875  1    1
+  88    0.88528714727015489  0.88528714727015478    0
+  89    0.30031092204624377  0.71247916401502764    0
+  90    0.31771015446498463  0.90546215625923321    0
+  91    0.40507291472157542  0.72783538918270696    0
+  92    0.85168827787216683  0.38456050672380426    0
+  93    0.92213204806748283  0.32219475027906186    0
+  94    0.89274169189993613  0.59088912722666298    0
+  95    0.90810768925421614  0.6962381588480232    0
+# Generated by triangle -a0.01q30 simple.node
diff --git a/test/unit/meshconvert/python/test.py b/test/unit/meshconvert/python/test.py
new file mode 100644
index 0000000..615f4d2
--- /dev/null
+++ b/test/unit/meshconvert/python/test.py
@@ -0,0 +1,532 @@
+""" Tests for the meshconvert module."""
+
+# Copyright (C) 2012
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Jan Blechta 2012
+#
+# First added:
+# Last changed: 2014-05-30
+
+from unittest import TestCase as _TestCase
+import unittest
+import os
+import glob
+import tempfile
+
+from dolfin_utils.meshconvert import meshconvert
+from dolfin_utils.meshconvert.meshconvert import DataHandler
+from dolfin import MPI, mpi_comm_world
+
+class TestCase(_TestCase):
+    def _get_tempfname(self, suffix=None):
+        fd, fname = tempfile.mkstemp(suffix=suffix)
+        os.close(fd)
+        return fname
+
+class _TestHandler(DataHandler):
+    def __init__(self, cell_type, mesh_dim, test):
+        DataHandler.__init__(self)
+        self.vertices, self.cells, self.functions = [], [], {}
+        self.vertices_ended = self.cells_ended = self.closed = False
+        self.__type, self.__dim = cell_type, mesh_dim
+        self.__test = test
+        test.assertEqual(self._state, self.State_Invalid)
+        self.test_warnings = []
+
+    def set_mesh_type(self, *args):
+        DataHandler.set_mesh_type(self, *args)
+        test = self.__test
+        test.assertEqual(self._state, self.State_Init)
+        test.assertEqual(self._cell_type, self.__type)
+        test.assertEqual(self._dim, self.__dim)
+
+    def start_vertices(self, num_vertices):
+        DataHandler.start_vertices(self, num_vertices)
+        self.vertices = []
+        for i in range(num_vertices):
+            self.vertices.append(None)
+
+    def add_vertex(self, vertex, coords):
+        DataHandler.add_vertex(self, vertex, coords)
+        self.vertices[vertex] = tuple(coords)
+
+    def end_vertices(self):
+        DataHandler.end_vertices(self)
+        self.vertices_ended = True
+
+    def start_cells(self, num_cells):
+        DataHandler.start_cells(self, num_cells)
+        for i in range(num_cells):
+            self.cells.append(None)
+
+    def add_cell(self, cell, nodes):
+        DataHandler.add_cell(self, cell, nodes)
+        self.cells[cell] = tuple(nodes)
+
+    def end_cells(self):
+        DataHandler.end_cells(self)
+        self.cells_ended = True
+
+    def start_meshfunction(self, name, dim, sz):
+        DataHandler.start_meshfunction(self, name, dim, sz)
+        entries = []
+        for i in range(sz):
+            entries.append(None)
+        self.__curfunc = self.functions[name] = [dim, sz, entries, False]
+
+    def add_entity_meshfunction(self, index, value):
+        DataHandler.add_entity_meshfunction(self, index, value)
+        self.__curfunc[2][index] = value
+
+    def end_meshfunction(self):
+        DataHandler.end_meshfunction(self)
+        self.__curfunc[-1] = True
+
+    def warn(self, msg):
+        self.test_warnings.append(msg)
+
+    def close(self):
+        DataHandler.close(self)
+        self.__test.assertEqual(self._state, self.State_Invalid)
+        self.closed = True
+
+class _ConverterTest(TestCase):
+    """ Base converter test class.
+    """
+
+class AbaqusTest(_ConverterTest):
+    """ Test AbaqusConverter."""
+
+    def test_success(self):
+        """ Test success case.
+        """
+        handler = self.__convert("abaqus.inp")
+        # Verify vertices
+        self.assertEqual(handler.vertices, [
+            (0.0, 0.0, 0.0),
+            (10.0, 10.0, 10.0),
+            (10.0, 10.0, 11.0),
+            (0.0, 1.0, 0.0),
+            (1.0, 1.0, 0.0),
+            (0.0, 0.0, 0.0),
+            (10.0, 10.0, 11.0),
+            (10.0, 10.0, 10.0),
+            (1.0, 1.0, 0.0),
+            (1.0, 0.0, 0.0),
+            (1.0, 0.0, 0.0),
+            (0.0, 1.0, 0.0)
+            ])
+        self.assert_(handler.vertices_ended)
+
+        # Verify cells
+        self.assertEqual(handler.cells, [
+            (0, 9, 3, 8),
+            (0, 9, 1, 2),
+            (3, 8, 1, 2)
+            ])
+        self.assert_(handler.cells_ended)
+
+        # Verify materials
+        print handler.functions.keys()
+        #self.assertEqual(handler.functions.keys(), ["material"])
+        #dim, sz, entries, ended = handler.functions["material"]
+        #self.assertEqual(dim, 3)
+        #self.assertEqual(sz, 2)
+        ## Cell 0 should have material 0, cell 1 material 1
+        #self.assertEqual(entries, [0, 1])
+        #self.assert_(ended)
+
+        self.assert_(handler.closed)
+
+    def xtest_error(self):
+        """ Test various cases of erroneus input.
+        """
+        def convert(fname, text, error=False):
+            f = file(fname, "w")
+            f.write(text)
+            f.close()
+            if not error:
+                handler = self.__convert(fname)
+                self.assert_(handler.test_warnings)
+            else:
+                self.assertRaises(meshconvert.ParseError, self.__convert, fname)
+            os.remove(fname)
+
+        fname = self._get_tempfname(suffix=".inp")
+
+        # Too few coordinates
+#        convert(fname, """*NODE
+#1, 0, 0""")
+        # Non-numeric index
+#        convert(fname, """*NODE
+#a, 0, 0, 0""")
+        # Non-numeric coordinate
+#        convert(fname, """*NODE
+#1, 0, 0, a""")
+        # Unsupported element type, also the body should be ignored
+#        convert(fname, """*ELEMENT, TYPE=sometype
+#0
+#""")
+#        # Bad parameter syntax
+#        convert(fname, "*ELEMENT, TYPE=sometype, BAD")
+#        # Missing type specifier
+#        convert(fname, "*ELEMENT", error=True)
+#        # Non-existent node
+#        convert(fname, """*NODE
+#1, 0, 0, 0
+#2, 0, 0, 0
+#3, 0, 0, 0
+#*ELEMENT, TYPE=C3D4
+#1, 1, 2, 3, 4
+#""", error=True)
+#        # Too few nodes
+#        convert(fname, """*NODE
+#1, 0, 0, 0
+##2, 0, 0, 0
+#3, 0, 0, 0
+#*ELEMENT, TYPE=C3D4
+#1, 1, 2, 3
+#""", error=True)
+#        # Non-existent element set
+#        convert(fname, """*MATERIAL, NAME=MAT
+#*SOLID SECTION, ELSET=NONE, MATERIAL=MAT""", error=True)
+
+    def test_facet_success(self):
+        """ Test facet export.
+        """
+        dim = 3
+        nb_facets = 1170  # The total number of facets in the mesh
+        marker_counter = {0: 990,
+                          1: 42,
+                          2: 42,
+                          3: 96,
+                          4: 0}
+        handler = self.__convert("abaqus_facet.inp")
+        self.assert_(handler.vertices_ended)
+        self.assert_(handler.cells_ended)
+
+        self.assert_("facet_region" in handler.functions.keys())
+        cell_type = DataHandler.CellType_Triangle
+        function_dim, sz, entries, ended = handler.functions["facet_region"]
+
+        # the dimension of the meshfunction should be dim-1
+        self.assertEqual(function_dim, dim - 1)
+        # There should be size facets in the mesh function
+        self.assertEqual(len(entries), nb_facets)
+        self.assertEqual(sz, nb_facets)
+
+
+        # Check that the right number of facets are marked
+        for marker, count in marker_counter.iteritems():
+            self.assert_(len([i for i in entries if i == marker]) == count)
+
+        self.assert_(ended)
+        self.assert_(handler.closed)
+
+    def __convert(self, fname):
+        handler = _TestHandler(DataHandler.CellType_Tetrahedron, 3, self)
+        if not os.path.isabs(fname):
+            fname = os.path.join("data", fname)
+        meshconvert.convert(fname, handler)
+        return handler
+
+class GmshTest(_ConverterTest):
+    """ Test Gmsh convertor.
+    """
+    def test_success(self):
+        """ Test success case.
+        """
+        handler = self.__convert("gmsh.msh")
+        # Verify vertices
+        self.assertEqual(handler.vertices, [
+            (0,    0,    0),
+            (1,    0,    1),
+            (-0,    0.8,  0.6),
+            (0.3,  0.8, -0.1),
+            (0.6,  0.3, -0.4),
+            (0.5,  0,    0.5),
+            (0.5,  0.4,  0.8),
+            (0.76, 0.26, 0.63),
+            (0.53, 0.53, 0.26),
+            (0.8,  0.15, 0.3)
+            ])
+        self.assert_(handler.vertices_ended)
+
+        # Verify cells
+        self.assertEqual(handler.cells, [
+            (9, 5, 1, 7),
+            (4, 8, 0, 9),
+            (8, 5, 0, 9),
+            (8, 5, 9, 7),
+            (8, 3, 4, 0),
+            (8, 2, 3, 0),
+            (7, 5, 6, 8),
+            (5, 2, 6, 8),
+            (1, 7, 5, 6),
+            (5, 2, 8, 0)
+            ])
+        self.assert_(handler.cells_ended)
+
+        # Verify physical regions
+        self.assertEqual(handler.functions.keys(), ["physical_region"])
+        dim, sz, entries, ended = handler.functions["physical_region"]
+        self.assertEqual(dim, 3)
+        self.assertEqual(sz, 10)        # There are 10 cells
+        # Cells 0 thru 4 should be in region 1000, cells 5 thru 9 in
+        # region 2000
+        self.assertEqual(entries, [1000]*5 + [2000]*5)
+        self.assert_(ended)
+        self.assert_(handler.closed)
+
+    def test_1D_facet_markings_2 (self):
+        """
+        Test to see if the 1D facet markings behave as expected.
+        2 vertices marked
+        """
+        marked_facets = [0,2]
+        self._facet_marker_driver(1, 2, marked_facets, 11)
+
+    def test_2D_facet_markings_1 (self):
+        """
+        Test to see if the 2D facet markings behave as expected.
+        1 edge marked
+        """
+        marked_facets = [7]
+        self._facet_marker_driver(2, 1, marked_facets, 8)
+
+    def test_2D_facet_markings_2 (self):
+        """
+        Test to see if the 2D facet markings behave as expected.
+        2 edges marked
+        """
+        marked_facets = [2,5]
+        self._facet_marker_driver(2, 2, marked_facets, 8)
+
+    def test_2D_facet_markings_3 (self):
+        """
+        Test to see if the 2D facet markings behave as expected.
+        3 edges marked
+        """
+        marked_facets = [5,6,7]
+        self._facet_marker_driver(2, 3, marked_facets, 8)
+
+    def test_2D_facet_markings_4 (self):
+        """
+        Test to see if the 2D facet markings behave as expected.
+        4 edges marked
+        """
+        marked_facets = [2,5,6,7]
+        self._facet_marker_driver(2, 4, marked_facets, 8)
+
+    def test_3D_facet_markings_1 (self):
+        """
+        Test the marking of 3D facets
+        Unit cube, 1 Face marked
+        """
+#         [0, 0, 0, 999, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 999, 0, 0, 0, 0, 0, 0, 0, 0, 999, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 999,
+# 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
+        marked_facets = [3, 15, 24, 39,]
+        self._facet_marker_driver(3, 1, marked_facets, 60)
+
+    def _facet_marker_driver (self, dim, id, marked_facets, size ):
+        if dim == 1:
+            cell_type = DataHandler.CellType_Interval
+        elif dim == 2:
+            cell_type = DataHandler.CellType_Triangle
+        elif dim == 3:
+            cell_type = DataHandler.CellType_Tetrahedron
+
+        handler = self.__convert("gmsh_test_facet_regions_%dD_%d.msh" % (dim, id), cell_type, dim)
+
+        free_facets = range(size)
+
+        for i in marked_facets:
+            free_facets.remove(i)
+
+        function_dim, sz, entries, ended = handler.functions["facet_region"]
+
+        # the dimension of the meshfunction should be dim-1
+        self.assertEqual(function_dim, dim-1)
+        # There should be size facets in the mesh function
+        self.assertEqual(len(entries), size)
+        self.assertEqual(sz, size)
+        # marked
+        self.assert_( all ( entries[i] == 999 for i in marked_facets ) )
+        # all other edges should be zero
+        self.assert_( all ( entries[i] == 0 for i in free_facets ) )
+
+        self.assert_(ended)
+        self.assert_(handler.closed)
+
+    def __convert(self, fname, cell_type=DataHandler.CellType_Tetrahedron, dim=3):
+        handler = _TestHandler(cell_type, dim, self)
+        if not os.path.isabs(fname):
+            fname = os.path.join("data", fname)
+        meshconvert.convert(fname, handler)
+        return handler
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class TriangleTester(_TestCase):
+
+    def test_convert_triangle(self): # Disabled because it fails, see FIXME below
+
+        # test no. 1
+        from dolfin import Mesh, MPI, mpi_comm_world
+
+        fname = os.path.join("data", "triangle")
+        dfname = fname+".xml"
+
+        # Read triangle file and convert to a dolfin xml mesh file
+        meshconvert.triangle2xml(fname, dfname)
+
+        # Read in dolfin mesh and check number of cells and vertices
+        mesh = Mesh(dfname)
+        self.assertEqual(mesh.num_vertices(), 96)
+        self.assertEqual(mesh.num_cells(), 159)
+
+        # Clean up
+        os.unlink(dfname)
+
+        # test no. 2
+        from dolfin import MPI, Mesh, MeshFunction, \
+                           edges, Edge, faces, Face, \
+                           SubsetIterator, facets, CellFunction, mpi_comm_world
+
+        fname = os.path.join("data", "test_Triangle_3")
+        dfname = fname+".xml"
+        dfname0 = fname+".attr0.xml"
+
+        # Read triangle file and convert to a dolfin xml mesh file
+        meshconvert.triangle2xml(fname, dfname)
+
+        # Read in dolfin mesh and check number of cells and vertices
+        mesh = Mesh(dfname)
+        mesh.init()
+        mfun = MeshFunction('double', mesh, dfname0)
+        self.assertEqual(mesh.num_vertices(), 58)
+        self.assertEqual(mesh.num_cells(), 58)
+
+        # Create a size_t CellFunction and assign the values based on the
+        # converted Meshfunction
+        cf = CellFunction("size_t", mesh)
+        cf.array()[mfun.array()==10.0] = 0
+        cf.array()[mfun.array()==-10.0] = 1
+
+        # Meassure total area of cells with 1 and 2 marker
+        add = lambda x, y : x+y
+        area0 = reduce(add, (Face(mesh, cell.index()).area() \
+                             for cell in SubsetIterator(cf, 0)), 0.0)
+        area1 = reduce(add, (Face(mesh, cell.index()).area() \
+                             for cell in SubsetIterator(cf, 1)), 0.0)
+        total_area = reduce(add, (face.area() for face in faces(mesh)), 0.0)
+
+        # Check that all cells in the two domains are either above or below y=0
+        self.assertTrue(all(cell.midpoint().y()<0 for cell in SubsetIterator(cf, 0)))
+        self.assertTrue(all(cell.midpoint().y()>0 for cell in SubsetIterator(cf, 1)))
+
+        # Check that the areas add up
+        self.assertAlmostEqual(area0+area1, total_area)
+
+        # Measure the edge length of the two edge domains
+        #edge_markers = mesh.domains().facet_domains()
+        edge_markers = mesh.domains().markers(mesh.topology().dim()-1)
+        self.assertTrue(edge_markers is not None)
+        #length0 = reduce(add, (Edge(mesh, e.index()).length() \
+        #                    for e in SubsetIterator(edge_markers, 0)), 0.0)
+        length0, length1 = 0.0, 0.0
+        for item in edge_markers.items():
+            if item[1] == 0:
+                e = Edge(mesh, int(item[0]))
+                length0 +=  Edge(mesh, int(item[0])).length()
+            elif item [1] == 1:
+                length1 +=  Edge(mesh, int(item[0])).length()
+
+        # Total length of all edges and total length of boundary edges
+        total_length = reduce(add, (e.length() for e in edges(mesh)), 0.0)
+        boundary_length = reduce(add, (Edge(mesh, f.index()).length() \
+                          for f in facets(mesh) if f.exterior()), 0.0)
+
+        # Check that the edges add up
+        self.assertAlmostEqual(length0 + length1, total_length)
+        self.assertAlmostEqual(length1, boundary_length)
+
+        # Clean up
+        os.unlink(dfname)
+        os.unlink(dfname0)
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class DiffPackTester(_TestCase):
+    def test_convert_diffpack(self):
+
+        from dolfin import Mesh, MPI, MeshFunction, mpi_comm_world
+
+        fname = os.path.join("data", "diffpack_tet")
+        dfname = fname+".xml"
+
+        # Read triangle file and convert to a dolfin xml mesh file
+        meshconvert.diffpack2xml(fname+".grid", dfname)
+
+        # Read in dolfin mesh and check number of cells and vertices
+        mesh = Mesh(dfname)
+        self.assertEqual(mesh.num_vertices(), 27)
+        self.assertEqual(mesh.num_cells(), 48)
+        self.assertEqual(len(mesh.domains().markers(3)), 48)
+        self.assertEqual(len(mesh.domains().markers(2)), 16)
+
+        mf_basename = dfname.replace(".xml", "_marker_%d.xml")
+        for marker, num in [(3, 9), (6, 9), (7, 3), (8, 1)]:
+
+            mf_name = mf_basename % marker
+            mf = MeshFunction("size_t", mesh, mf_name)
+            self.assertEqual(sum(mf.array()==marker), num)
+            os.unlink(mf_name)
+
+        # Clean up
+        os.unlink(dfname)
+
+    def test_convert_diffpack_2d(self):
+
+        from dolfin import Mesh, MPI, MeshFunction, mpi_comm_world
+
+        fname = os.path.join("data", "diffpack_tri")
+        dfname = fname+".xml"
+
+        # Read triangle file and convert to a dolfin xml mesh file
+        meshconvert.diffpack2xml(fname+".grid", dfname)
+
+        # Read in dolfin mesh and check number of cells and vertices
+        mesh = Mesh(dfname)
+
+        self.assertEqual(mesh.num_vertices(), 41)
+        self.assertEqual(mesh.num_cells(), 64)
+        self.assertEqual(len(mesh.domains().markers(2)), 64)
+
+        mf_basename = dfname.replace(".xml", "_marker_%d.xml")
+        for marker, num in [(1,10), (2,5), (3,5)]:
+
+            mf_name = mf_basename % marker
+            mf = MeshFunction("size_t", mesh, mf_name)
+            self.assertEqual(sum(mf.array()==marker), num)
+            os.unlink(mf_name)
+
+        # Clean up
+        os.unlink(dfname)
+
+if __name__ == "__main__":
+    unittest.main()
+    meshconvert
diff --git a/test/unit/multistage/python/PointIntegralSolver.py b/test/unit/multistage/python/PointIntegralSolver.py
new file mode 100644
index 0000000..2a58440
--- /dev/null
+++ b/test/unit/multistage/python/PointIntegralSolver.py
@@ -0,0 +1,156 @@
+"""Unit tests for the RKSolver interface"""
+
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-02-20
+# Last changed: 2013-02-20
+
+import unittest
+from dolfin import *
+
+parameters.form_compiler.optimize=True
+
+import numpy as np
+
+def convergence_order(errors, base = 2):
+    import math
+    orders = [0.0] * (len(errors)-1)
+    for i in range(len(errors)-1):
+        try:
+            orders[i] = math.log(errors[i]/errors[i+1], base)
+        except ZeroDivisionError:
+            orders[i] = np.nan
+
+    return orders
+
+def function_closure(Scheme):
+
+    def scalar_time(self):
+
+        mesh = UnitSquareMesh(10, 10)
+        V = FunctionSpace(mesh, "CG", 1)
+        v = TestFunction(V)
+        time = Constant(0.0)
+        u0=10.0
+        tstop = 1.0
+        weight = Constant(2)
+        u_true = Expression("u0 + 2*t + pow(t, 2)/2. + weight*pow(t, 3)/3. - "\
+                            "pow(t, 5)/5.", t=tstop, u0=u0, weight=weight)
+
+        u = Function(V)
+        compound_time_expr = Expression("weight*time*time", weight=weight, \
+                                        element=time.element(), time=time)
+        form = (2+time+compound_time_expr-time**4)*v*dP
+        
+        scheme = Scheme(form, u, time)
+        info(scheme)
+        solver = PointIntegralSolver(scheme)
+        u_errors = []
+        for dt in [0.05, 0.025, 0.0125]:
+            solver.reset_newton_solver()
+            solver.reset_stage_solutions()
+            u.interpolate(Constant(u0))
+            solver.step_interval(0., tstop, dt)
+            u_errors.append(errornorm(u_true, u))
+
+        self.assertTrue(scheme.order()-min(convergence_order(u_errors))<0.1)
+
+    def scalar(self):
+
+        mesh = UnitSquareMesh(10, 10)
+        V = FunctionSpace(mesh, "CG", 1)
+        v = TestFunction(V)
+
+        tstop = 1.0
+        u_true = Expression("exp(t)", t=tstop)
+
+        u = Function(V)
+        form = u*v*dP
+
+        scheme = Scheme(form, u)
+        info(scheme)
+        u_errors = []
+        solver = PointIntegralSolver(scheme)
+        for dt in [0.05, 0.025, 0.0125]:
+            solver.reset_newton_solver()
+            solver.reset_stage_solutions()
+            u.interpolate(Constant(1.0))
+            solver.step_interval(0., tstop, dt)
+            u_errors.append(errornorm(u_true, u))
+        self.assertTrue(scheme.order()-min(convergence_order(u_errors))<0.1)
+
+    def vector(self):
+
+        mesh = UnitSquareMesh(10, 10)
+        V = VectorFunctionSpace(mesh, "CG", 1, dim=2)
+        v = TestFunction(V)
+        tstop = 1.0
+        u_true = Expression(("cos(t)", "sin(t)"), t=tstop)
+
+        u = Function(V)
+        form = inner(as_vector((-u[1], u[0])), v)*dP
+
+        scheme = Scheme(form, u)
+        info(scheme)
+        solver = PointIntegralSolver(scheme)
+        u_errors = []
+        for dt in [0.05, 0.025, 0.0125]:
+            solver.reset_newton_solver()
+            solver.reset_stage_solutions()
+            u.interpolate(Constant((1.0, 0.0)))
+            scheme.t().assign(0.0)
+            next_dt = dt
+            while float(scheme.t()) + next_dt <= tstop:
+                if next_dt < 1000*DOLFIN_EPS:
+                    break
+
+                solver.step(next_dt)
+                next_dt = min(tstop-float(scheme.t()), dt)
+
+            u_errors.append(errornorm(u_true, u))
+
+        self.assertTrue(scheme.order()-min(convergence_order(u_errors))<0.1)
+
+    return scalar_time, scalar, vector
+
+class PointIntegralSolverTest(unittest.TestCase):
+    pass
+
+# Build test methods using function closure so 1 test is generated per Scheme and
+# test case
+for Scheme in [ForwardEuler, ExplicitMidPoint, RK4,
+               BackwardEuler, CN2, ESDIRK3, ESDIRK4]:
+
+    scalar_time, scalar, vector = function_closure(Scheme)
+    
+    setattr(PointIntegralSolverTest,
+            "test_butcher_schemes_scalar_time_{0}".format(Scheme), scalar_time)
+
+    setattr(PointIntegralSolverTest,
+            "test_butcher_schemes_scalar_{0}".format(Scheme), scalar)
+
+    setattr(PointIntegralSolverTest,
+            "test_butcher_schemes_vector_{0}".format(Scheme), vector)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing PyDOLFIN PointIntegralSolver operations"
+    print "------------------------------------------------"
+    unittest.main()
+    cpp.set_log_level(INFO)
+    list_timings()
diff --git a/test/unit/multistage/python/RKSolver.py b/test/unit/multistage/python/RKSolver.py
new file mode 100644
index 0000000..ba837ae
--- /dev/null
+++ b/test/unit/multistage/python/RKSolver.py
@@ -0,0 +1,105 @@
+"""Unit tests for the RKSolver interface"""
+
+# Copyright (C) 2013 Johan Hake
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-02-20
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+import numpy as np
+
+def convergence_order(errors, base = 2):
+    import math
+    orders = [0.0] * (len(errors)-1)
+    for i in range(len(errors)-1):
+        try:
+            orders[i] = math.log(errors[i]/errors[i+1], base)
+        except ZeroDivisionError:
+            orders[i] = numpy.nan
+
+    return orders
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class RKSolverTest(unittest.TestCase):
+
+    def test_butcher_schemes_scalar(self):
+
+        LEVEL = cpp.get_log_level()
+        cpp.set_log_level(cpp.WARNING)
+        mesh = UnitSquareMesh(4, 4)
+
+        V = FunctionSpace(mesh, "R", 0)
+        u = Function(V)
+        v = TestFunction(V)
+        form = u*v*dx
+
+        tstop = 1.0
+        u_true = Expression("exp(t)", t=tstop)
+
+        for Scheme in [ForwardEuler, ExplicitMidPoint, RK4,
+                       BackwardEuler, CN2, ESDIRK3, ESDIRK4]:
+            scheme = Scheme(form, u)
+            solver = RKSolver(scheme)
+            u_errors = []
+            for dt in [0.05, 0.025, 0.0125]:
+                u.interpolate(Constant(1.0))
+                solver.step_interval(0., tstop, dt)
+                u_errors.append(u_true(0.0, 0.0) - u(0.0, 0.0))
+
+            self.assertTrue(scheme.order()-min(convergence_order(u_errors))<0.1)
+
+        cpp.set_log_level(LEVEL)
+
+    def test_butcher_schemes_vector(self):
+
+        LEVEL = cpp.get_log_level()
+        cpp.set_log_level(cpp.WARNING)
+        mesh = UnitSquareMesh(4, 4)
+
+        V = VectorFunctionSpace(mesh, "R", 0, dim=2)
+        u = Function(V)
+        v = TestFunction(V)
+        form = inner(as_vector((-u[1], u[0])), v)*dx
+
+        tstop = 1.0
+        u_true = Expression(("cos(t)", "sin(t)"), t=tstop)
+
+        for Scheme in [ForwardEuler, ExplicitMidPoint, RK4,
+                       BackwardEuler, CN2, ESDIRK3, ESDIRK4]:
+            scheme = Scheme(form, u)
+            solver = RKSolver(scheme)
+            u_errors_0 = []
+            u_errors_1 = []
+            for dt in [0.05, 0.025, 0.0125]:
+                u.interpolate(Constant((1.0, 0.0)))
+                solver.step_interval(0., tstop, dt)
+                u_errors_0.append(u_true(0.0, 0.0)[0] - u(0.0, 0.0)[0])
+                u_errors_1.append(u_true(0.0, 0.0)[1] - u(0.0, 0.0)[1])
+
+            self.assertTrue(scheme.order()-min(convergence_order(u_errors_0))<0.1)
+            self.assertTrue(scheme.order()-min(convergence_order(u_errors_1))<0.1)
+
+        cpp.set_log_level(LEVEL)
+
+if __name__ == "__main__":
+    print ""
+    print "Testing PyDOLFIN RKSolver operations"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/nls/python/PETScSNESSolver.py b/test/unit/nls/python/PETScSNESSolver.py
new file mode 100644
index 0000000..a653e0b
--- /dev/null
+++ b/test/unit/nls/python/PETScSNESSolver.py
@@ -0,0 +1,125 @@
+"""Unit test for the SNES nonlinear solver"""
+# Copyright (C) 2012 Patrick E. Farrell
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2012-10-17
+# Last changed: 2013-11-22
+
+"""Solve the Yamabe PDE which arises in the differential geometry of
+general relativity. http://arxiv.org/abs/1107.0360.
+
+The Yamabe equation is highly nonlinear and supports many
+solutions. However, only one of these is of physical relevance -- the
+positive solution.
+
+This unit test demonstrates the capability of the SNES solver to
+accept bounds on the resulting solution. The plain Newton method
+converges to an unphysical negative solution, while the SNES solution
+with {sign: nonnegative} converges to the physical positive solution.
+
+An alternative interface to SNESVI allows the user to set explicitly
+more complex bounds as GenericVectors or Function.
+"""
+
+from dolfin import *
+import unittest
+
+if has_petsc_snes():
+    try:
+        parameters["linear_algebra_backend"] = "PETSc"
+    except RuntimeError:
+        import sys; sys.exit(0)
+
+    parameters["form_compiler"]["quadrature_degree"] = 5
+
+    mesh = Mesh("doughnut.xml.gz")
+    V = FunctionSpace(mesh, "CG", 1)
+    bcs = [DirichletBC(V, 1.0, "on_boundary")]
+
+    u = Function(V)
+    v = TestFunction(V)
+    u.interpolate(Constant(-1000.0))
+
+    #x = SpatialCoordinate(triangle)
+    x = SpatialCoordinate(mesh)
+    r = sqrt(x[0]**2 + x[1]**2)
+    rho = 1.0/r**3
+
+    F = (8*inner(grad(u), grad(v))*dx + rho * inner(u**5, v)*dx \
+         + (-1.0/8.0)*inner(u, v)*dx)
+
+    du = TrialFunction(V)
+    J = derivative(F,u,du)
+    lb = Function(interpolate(Constant(0.),V))
+    ub = Function(interpolate(Constant(100.),V))
+
+    newton_solver_parameters = {"nonlinear_solver": "newton",
+                                "newton_solver": {"linear_solver": "lu",
+                                                  "maximum_iterations": 100,
+                                                  "report": False}}
+
+    snes_solver_parameters_sign = {"nonlinear_solver": "snes",
+                                   "snes_solver": {"linear_solver": "lu",
+                                                   "maximum_iterations": 100,
+                                                   "sign": "nonnegative",
+                                                   "report": True}}
+
+    snes_solver_parameters_bounds = {"nonlinear_solver": "snes",
+                                     "snes_solver": {"linear_solver": "lu",
+                                                     "maximum_iterations": 100,
+                                                     "sign": "default",
+                                                     "report": True}}
+
+class SNESSolverTester(unittest.TestCase):
+
+    if has_petsc_snes():
+
+        def test_snes_solver(self):
+            u.interpolate(Constant(-1000.0))
+            solve(F == 0, u, bcs, solver_parameters=snes_solver_parameters_sign)
+            self.assertTrue(u.vector().min() >= 0)
+
+        def test_newton_solver(self):
+            u.interpolate(Constant(-1000.0))
+            solve(F == 0, u, bcs, solver_parameters=newton_solver_parameters)
+            self.assertTrue(u.vector().min() < 0)
+
+        def test_snes_solver_bound_functions(self):
+            u.interpolate(Constant(-1000.0))
+            problem = NonlinearVariationalProblem(F, u, bcs, J)
+            solver  = NonlinearVariationalSolver(problem)
+            solver.parameters.update(snes_solver_parameters_bounds)
+            solver.solve(lb, ub)
+            self.assertTrue(u.vector().min() >= 0)
+
+        def test_snes_solver_bound_vectors(self):
+            u.interpolate(Constant(-1000.0))
+            problem = NonlinearVariationalProblem(F, u, bcs, J)
+            solver  = NonlinearVariationalSolver(problem)
+            solver.parameters.update(snes_solver_parameters_bounds)
+            solver.solve(lb.vector(), ub.vector())
+            self.assertTrue(u.vector().min() >= 0)
+
+
+if __name__ == "__main__":
+  # Turn off DOLFIN output
+  set_log_active(False)
+
+  print ""
+  print "Testing DOLFIN nls/PETScSNESSolver interface"
+  print "--------------------------------------------"
+  unittest.main()
diff --git a/test/unit/nls/python/TAOLinearBoundSolver.py b/test/unit/nls/python/TAOLinearBoundSolver.py
new file mode 100644
index 0000000..6ca15d7
--- /dev/null
+++ b/test/unit/nls/python/TAOLinearBoundSolver.py
@@ -0,0 +1,111 @@
+"""Unit tests for the TAOLinearBoundSolver interface"""
+# Copyright (C) 2013 Corrado Maurini
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  03/09/2012
+# Last changed: 2013-04-04
+
+# Begin demo
+# Corrado Maurini
+#
+# This example solve the bound constrained minimization problem
+# in the domain (x,y) in [0,Lx]x[0,Ly]
+#
+# min F(u) with  0<=u<=1 and u(0,y)= 0, u(Lx,y) = 1
+#
+# where F(u) is the quadratic functionaldefined by the form
+#
+# F(u) = 3./4.*(ell/2.*inner(grad(u), grad(u))+ 2./ell*usol)*dx
+#
+# An analytical is available:
+# u(x,y) = 0 for 0<x<1-ell,  u(x,y) = (x-(1-ell))^2 for 1-ell<x<Lx
+# and the value of the functional at the solution usol is F(usol)=Ly
+# for any value of ell, with 0<ell<Lx.
+
+from dolfin import *
+import unittest
+
+if has_petsc():
+
+    try:
+        parameters["linear_algebra_backend"] = "PETSc"
+    except RuntimeError:
+        import sys; sys.exit(0)
+
+    # Create mesh and define function space
+    Lx = 1.0; Ly = 0.1
+    mesh = RectangleMesh(0, 0, Lx, Ly, 100, 10)
+    V = FunctionSpace(mesh, "Lagrange", 1)
+
+    # Define Dirichlet boundaries
+    def left(x,on_boundary):
+        return on_boundary and near(x[0], 0.0)
+
+    def right(x,on_boundary):
+        return on_boundary and near(x[0], Lx)
+
+    # Define boundary conditions
+    zero = Constant(0.0)
+    one  = Constant(1.0)
+    bc_l = DirichletBC(V, zero, left)
+    bc_r = DirichletBC(V, one, right)
+    bc = [bc_l, bc_r]
+
+    # Define variational problem
+    usol = Function(V)
+    u = TrialFunction(V)
+    v = TestFunction(V)
+    cv = Constant(3.0/4.0)
+    ell = Constant(0.5) # This should be smaller than Lx
+    F = cv*(ell/2.0*inner(grad(usol), grad(usol))*dx + 2.0/ell*usol*dx)
+    # Weak form
+    a = cv*ell*inner(grad(u), grad(v))*dx
+    L = -cv*2*v/ell*dx
+
+    # Assemble the linear system
+    A, b = assemble_system(a, L, bc)
+
+    # Define the upper and lower bounds
+    upperbound = interpolate(Constant(1.), V)
+    lowerbound = interpolate(Constant(0.), V)
+    xu = upperbound.vector()
+    xl = lowerbound.vector()
+
+    # Take the PETScVector of the solution function
+    xsol = usol.vector()
+
+if has_petsc_tao():
+
+    class TAOLinearBoundSolverTester(unittest.TestCase):
+
+        def test_tao_linear_bound_solver(self):
+            "Test TAOLinearBoundSolver"
+            solver = TAOLinearBoundSolver("tron","stcg")
+            solver.solve(A,xsol,b,xl,xu)
+
+            # Test that F(usol) = Ly
+            self.assertAlmostEqual(assemble(F), Ly, 4)
+
+if __name__ == "__main__":
+
+    # Turn off DOLFIN output
+    set_log_active(False)
+
+    print ""
+    print "Testing DOLFIN TAOLinearBoundSolver interface"
+    print "----------------------------------------"
+    unittest.main()
diff --git a/test/unit/nls/python/doughnut.xml.gz b/test/unit/nls/python/doughnut.xml.gz
new file mode 100644
index 0000000000000000000000000000000000000000..66b00d921ecf20826ce9536ce70487cab5a2bbc8
GIT binary patch
literal 15843
zcmV<9JsiRxiwFo0V~S7!17vS?XJ~G9bS`*pYyh==Taqoek>tNtLF4Zji-|YTMymg2
z1v3j6qi(D37)7;-G_}~PANQ;bN9L(IQ6=OwB@;!~MIiwM;^E;D_~Bpw@t2>!`TLi@
z{rdH<zx?=Zc-g-F=F2ZX{q;{@fBEx|-~R9a^*_Js-~Q_#|L}(&{`A+M|LyB9-{4RG
z^6S66{=<*o{`+sg{l~w2|NVdd=YPKZ+m~Oy{`BjA{Ozy*_sdVez5MlWfByE5fB5E`
zAO7;?*MI-!r!PPM{M+yU@#V*FfBW0l|MSbAfBy3AH-Gy2mmj~4`yav|!w3BK^`|et
ze)H?s|H2<jy&gX~e)i=b-+cY$PhbA=<G1*}fABja|Jw9d`0_tC{OEW5ftT&!uh$>_
z*V7+;|75DLPt{*)j(OY47PinaY5DTq7WSzge-!fTkN)|o;yzWxs<xc#mPagG3MqW~
zF4TRhXAA!4r%L-&-#vc&mYyyvwbf<i*SVb2N-rsGwT`W&-b!xUvE+Y#uJZo6a@V>Z
ze-=huU08jcEWhNu^%1wx%eK{6qYmupqW}5H+Iw;sdU(39SjOtYx&-mR{d$e#CYKgc
zu04g=dusOket-U>g`51UHJsymw&I1kf(iZQ>uVqX9SeI^9N#$y_H5A$lcjf8c0RJF
zt6rEbe|*ROKb~57Pa4mM_H@|`lhtFgFnUWR^^!v_xWJk$zNDUWiX)|#17;1Y7dkYX
zD~{0fmTAFyjb{O=t;Liwv~S5})Mc$0`Z3oQYJ@)TqvW1Po10i)+SuZNqKZ&eqt*3w
zy{eD%FN~>fJxVKHKBLu=md`7i`Z#SAwyF2iT<7hrC9lsF4h=j7pk(+1+j*{&*u>J7
zuUM4!xJp}iHrbTXg~^iL=c~Bo?a3}qAzhg4P#%x+miqhRagx%7$%^U4v%tkX!n<-G
zN3CI5?qjvd&U=+8An#r1T1GKBU6`zCvXc~qv&O#&YVX*{<;nUxlck>0$-JCr!*n%m
z%d?I5_OazQ5A7<dEw#A3wzRz?A_G?KG~1MsFb1TxE$iVF9;F|@vEufgT*m8{z^W}@
z>=fU**fDKeKhJjF<x%SLWlQO;&Z>iJxXgBvpi$N>b;@tFF%%@0@?^4G8Zwo)W(Eo}
zJl)4#{#PffZ|o-(WNc4F<d%j^?X6?b#%SAn(vJ`6xu)e<I`wxvo)Po2i=DPHmep|@
z@40d~wfA)vVzjufv+`!qSqLS-azZy2nwpa~4y}h$GqgUmS&GXG%jSoKHcCW@UOImD
zsAs=1VZo^eta_A$i?%$M!5<;QO$(T>w}72G+s|CKR&#(Lww|F}mgh>xTs-)isPUoL
zQ=fD7m$Kyz0@AjI9nQTh&y^417-e*vd&53byw8!~mI-^%XWXEL*RNQ%0H$YrIK)06
zTpHyRQ-qh8AebZegpg_4)rGk%ercgK{=!l5|KNR}=E}Qw54j(SF2nk|Om&=p;Rqp|
z<~n~yfCgEf%QVMnqap<Eyso*uu-|#zYGzX$QvmSkrJU!QV#9DFEYDT813@|oc54uS
z>H6z+*h*cWD;#!ZUf6;7rKi(er)$2Iux>C*JPf83(TEA&MLW-RQeO#5czLcQeP{|6
z%DkWAva4FgMz60cn~!tR=COq*lT912Fj+D8?V`@NKA!C2Gy)5gRr5?Q`W({#zIdFh
zz`|tBAmOV*&*6#OPcyJEnWC2mjsE_HKHGtX$rQZ2uhM^iZU`2zZpAL|>-0A&7?xmp
zWmV|u`8USU&ielR9S8&0R~Buu^ImQFnbC}4r1g~vJv~bS#Ne4X&~I3>Dh+a$Z>W%W
z-JFWMHbPxah7_r*)6Ip#n%j7}@4VCNnU^|sqjXZ=>Iq~#YqDNz?8{DYZGzX&+P07W
zzQ-L>Y|EZ$?e9)@cJH5BgoWA0JNtNb@SmE5g%sBIo`_sr{HHcyVYcv|^k1C(r$%96
zw)oz~zPR~Mt-``=={=owarB>>g@xJjd+K;9_}?A7urOPB&(cf{|GQ%t7G|sO7}1l8
z|J|_+3$wNN{DZ0Ee|Jp7!fgGG>vK`^zdN>JVYcy(S9j9#zdOcZAw|8tby&}8{&&YZ
zEX)?(@x@Pi{&&YbEX)?)L>Ui`|5Nj@Fj;yGpB^3mr`BO%viv44d~p1q8i$3+%G-eV
z>i9pk4GWVQ8uHZfe`*>QCNntXspJ3DGAvAHc*s-7|EXbEn9Kl?r;h(qyRg7LF&f!Z
z$N#BWSePul0|Q<h|EE@AVKUPoPaXfKMqyzxfg;Zw|ED%#VX`dU_{8ylY7!PEEAK(=
zXUG4kMOc_jF-?oL_8MCqJ%@|h4=?yZOEH(;H*E7dx-<??q`g2P4rXLRuBl?;^K7Nm
zo=46*0v^__^_W@RTt~$oh8nh*uJ;-zm2j*XCV}LM_1OfBWM*O_WPjl1wt5l&KCq1y
z|4pG|$Csm;un8KeHMdY8ju4S8j*Cpj67V&HTn*Tnv7C($+XP4A)*2SDg_z^W=cpd%
zSaOO1`<S3jI9ptsO>s?4kwO`2PY{PbZ+C(Ij4@UG%ep7ImQy8RQ(OblfSkluAQG{L
zIUAH@B<7xC?XlzkuCu*1#Wh=E4v_4i$SZILV^Zff4(P}cpd@e1cEmN<E^O8aP+l#<
z@QgEAsbX(S#K~2XmDa<WuvPQ@aRK=KfoBGl(q2X36|ajqgstU)3j#-M`NH9M98M$-
zWoKa3T=5GpJS^y~(Fcw*^B$BNOY4VUH*hkId{=({809os?vT=mn-9wXYja~|=8(h&
z{jrr+-~~WWodq(~EtkBL=6Xpt4lS5NQXp&<GO|H8k8+xf>KZOlg9(MniQNd>E0YDe
zS|t}4Zmfza@;O<2DH(FuA&gs(n0VQ?g@dAs$+iqrgJ0Ql?0uYk1k47-iR%aR7ICUK
zSb+ye75j*5%X7(;@_5$&jrXELf%Xlv<*lqM<dCO`<iL9rGr8;+HxkEL80f&W%Q3CH
z{vlXY!`*9iO3K#pw|KVO8CJC5-@~7*^+s+j93<8B(%XPb4&~HRg1kTYBnjFPHzO4+
zeLX`Nf~gU>;jok&eOEF?hIAI=np$z;aSPzCLoMH!t(!tlh1918n+b;!{@i(SG&E3-
zb>t3}w(bIjaPmqbE_g<C2w^GxA}3H*I6SDGk>SFwV?QCvD;c{#0xLkiaxE8^3z5(3
zscndT`6;WHAj&I&+DhaJwbHqOxjHCp{JR1r3CoQQzj48hvpRnzP6rWnJ<~|_A+YPE
z+_2nH>I4@6=hpHoyZ5q_h_v7=!>r?U+YPWa9IVy$f{-48E<%_VN7>7Ow6un);6mpT
z<ACkEF<G(62E1haM))IGVyovXfXH!!>4UFO;U3+oQ!tRE)2s~!Oi)}~8K<Q|S{d^|
z&ke*lclJ@7_kpM)L{eaJa`}=&gmHt7fI@*h#v8gM8c5Pp!qP~BZHUiKxNd<`OSQmf
zfw!{P9j!~hd=hBn#?TXPYm4y;l9b&WZ)Cn9=vrS|5=s(sY7qg){!7o~HmnW$Word~
zZA&4wb+04|CV?N>x2+PLDAxpf83XE?CI_>ookhJC+$8f#psL_j!u1&aq$-YN?8u~y
zw?H#{!?+n|6}B|*>aoD2R=Nr&>4#FJEkZB_$Cfne<=GV5q(o<n;0xiNbY5E`qq7fM
zJ-QJ$)~1{d)G!?_*n@)Wev0qY{v&KAB!_BwohTTRayE^q5?m@cRSj|H$&$jq+hXe@
zWjMB&tS^@@hIC5W;0DLSpc`TMHAPgQxLBf5L&wS92m&T^HDp*Y2ttL9O6B5m6+$&Q
zzQ(I@$4xk>tK+2vqH}eRbRj17B$Uve*hgp)d=MPmbur1NN^)lWf`9{#Nsi-^ZHD54
zMnkX&Jz8#*Erc928?*>)O2nOm<29v(Rb}vd5GTe0=RJiRlf`2np>*L(!BGrQ_PLhx
zsRcNf*xL<1#tpf%k@84bkI)dv(8<f~>?7b#z-7<aMks)CBLqGOthiEPY;Z(sA-J`r
ze4Z__@`ElpZepwJFnP#jDy~fGJ8lyWDV>guA2MKP$-&2=wX|NVmZeG%Ex{&_h)@P$
z_tm#6CBT})U5Cm}`36*&XDJPSTO34z2+p5^?(ZN%bq8diVhC-dWnexWRMzhpP~lQ{
zxZU`5al}i6lS}Fm(g*{Ndve25IM}T4$_bh!_{tlzCiRM7N4TyH7Nd1I=<P-%TuziU
zSY||obhx0XPMcYFm=}AD=#&S$t)E>9Gk$}4W;_q2v7O7H5-h~l5K9H(CD?-X2&V{l
zWnnx)<H9^gywb+8hgdhXXuv0x8(S&g1U@Pxq$JvC{J--R$FlLST7+*t_N>bCY!fhn
zzXu`dC8nA$p(3s!ZW}EDJkGIRPZkblYk3)nH(+sEPdOv9xRkiS*f7M88{(XP$L%T>
z;Y8>_tSQ6C#Mzy*eEkJp0=*!@zmc%Y`r0hSfqsH5jcHE^)O_AZoMp{vg9U)fOnc%j
ztxeXCjf8;Xs|&0PbV|F#rJ2P0!Ne@wl6WI{o7`5G=&-E;+=MdX*v`i`5(E|AG{ROm
z4L3~O!EQ~^lL0EeRyvjx%ZJ(E+d-Yd#N*nn%m1XeLUBbbkAE@Ea9LbN{F9h6rKfZ!
z@R$VGgx?3z4}qziJg)vL%uQqQ7n~M|$&J-biYsm}EGDcfyq<CnPs>YS>XryV=C_P>
z8&?(Rz^deiSRN`P^m83bg}<<4+pLskW!CzQtMX1F_K10BrcXw@#;3Flu<mehA+<LQ
zYMtaXmPo*!<k8{ur*pjlj*}Q(*q}|IqHoM*+GOlG(GIJCn5thI5@fhPIAKcBz<<}(
zay4xdq1`)zG&p&%JK>zf85@&3TMcQ0jNI@ks{tmNKw)MAdQYBQkXJ0VGAzf0^a9uS
zv00R}K|5^?*PZI(oa<nwn8_sUAbwur4a?mu$icN9362g_6eb*(R0jl<NI5nb5pgc-
zp>R_gr$TYDfG8qlJhLzQ3&LNf?{{czcHUW;%z_+56rIWtnmN!$pAn2klRY*>c$AVG
z`<QiTh^bhj*#>dYOB{f+Z1l)UUufHnTtKrrJ@_4v7g!yJgXem-odyCOLkPX{s<j)Z
zrh1zQC4n1&m=T(Hvrbj7$P+?RXc2e{8*crL^z7ugRu(`dsHXzIHT3hjvBedA1g4%L
zl{d~!eEE$HS@3%+wZ$0M*?PvkU~ZiWko7D_n{Ej^Aheug-L^i?NtN-^cF-mhw(o36
zvffE$vw(`kG&qu_Cj<eZUmS%-jSM$wZ~N45pb7`eHN7Nm81Eb`CL!jFTf*EFGaw`!
z_8Tr<pAk;X+$`K|c#gSVv~t)3D)`ZnAjgdh-qQ@<3T1rb+4VCZitvXj1`bm!uyE8X
z>qjTI1ai*E0{0CXWt<`b*uIz&!NSb+T&?T8nS<&I*+ZNU$D@$)*I~rZ1Pm(UPL(#`
z$;KPn>)^V=uv7+8c_TBDe}xmb1fP%y-@|Zc2CwV0nOl-r^Bu>i@RUbAlU?fzscR%L
z>`7esDC;}f=WL}wJK@eFXgpyG6|Qn%auz`_6j)#H;u6Gmg-+_^ry=5n9XkQb5qGg9
zxSg#q>z;1}i^F0Zd^nLHoK4vCDChW%sb^g6K?Hcap_avV#cCi3nZ(vzX`Jsi=4Z2*
zPU00c_xfz{$YRocs}b=oY<J(v8N?<|*eQv$>-9#Du!HW}UdT;`TRxyD_rG5N1)MFL
zgfIcY{M`C%SsO`EJn?X#p06n?a(8ecnCUKe!r-C)XUv%v3JLv_Gr2atyyh=SDuYhW
z>%Ap{5nibW$$P7qh!NGL7gS~lOvJL|2jkA#<d#6|c1H5}fY!&!Eg3JbjFLg;gpTbx
zt~?2^5Pn7-Oo}C(-8?sFPbNP|V1~f5Bh+#pa}r(?;|(V8v5ISs7EwTA_dGaA%nXFM
zY;EGUnLk-}yaz%_a#*kVas_yt13GlT_T3;(MkBoLyza6=p=9#9(oSVeA|a8bz(N^D
zclJA%ri%s`26E$RoMCacbn&@fwKY{TMCe9UK-^|lxWX@oQ&l3R^NN`d22><rC%9j6
z-3yAF!W?)AI2CqfNGuS!M8di5%^K*CK|S9%InyVBz}d!58F2T{$rWP22*?roR8s!R
zoyiP(#a@N7hw{B`=hBh<LYD8|wGkc}LY?*gYn#X=M8#7XOk}2OgT6+J!iK=3Hzw(B
z9Gdwg6<3<2D!Ac+%=UR`xEnYy=J)Yu;JV!C_I5B{>D>h~$HJasZ=;<Z1$cJ>;sJ*|
zGhw#Awy;e_xwn<0h`_r#Mfv=Y#9SD5kqyztazGVlTUH)Uiy2C)Wq1tNm;?F)+NA9O
zUcDhDVIr?oP7SUw!u%PdS<z2T0sj-|mDhD&AqF*9B-Io#en<QkQ|uSlq?Wixi!CGq
z3pb`ST|!<JmPdkogTA~dN=!jQM1)!0(w*zA-mDD{D(2Y;WFVrspvn*+Cd2}qpiaMR
z)uP6O_u6ncg^BI*>VfC8N6B!51iixidS3?&qq?(_7lQ@B&4;^O!r3!nbG`xtP<Ia5
zdNb~*_N?qM&P5>@qz$;%#ssFP;7X_6urK>T@gTioA6fP@n5V+;M!<iqGTLHmkW@O$
zIjzfxabDvK?$O?I2!<32zg+7O$lr(Q8!c@&YV6{qyuwe8Jh8~mk@cZA0N0}J!Rg+I
zZhf{{h|?ka8|g8LIp}$Ck=^sQ8d!z^d9CY3MlsGV&jX$?ltoYMtaL8<uP?-2Go1I0
zk$H+Yrptz3>~^$LX|X!&>U5<YOCb0JLFwxuT(n-T5X+A3LJ))KkXr1bC>e~fMw1Ti
zR@QN~IJ>oyhXdDRFjY1Ch8<Rim3@V9FPUt2Bt`v7Nb08TCb^yP`8gU0B=T%5RbVD3
zuB*z~u@#@+Sei%&eJ3oRLe!SvD!}zaXtMXqT3(zuCOPo_l1T;&-rBjRFEu6W)R~A#
zH`35i+*evL92gw)5#zb~2ga5qB)Ino6E*}q>m0I}41Xop2<9>o%4UtzIor2Eqmfx3
z8x+b7?IrGOB@3^xIDjGVH7OiZWt}Zt&b*ZyRV(ozzxI~_ZBdAIrfny$UrR00{(=Ea
zE<ws0YctOTo*lLeMu&XD?NZkVxn+GJ;V#5oHzK&CTn<wwEX$2BEnz!H`pi2gmZ0Ki
zVdVADJJl(WV+Taoj-j0V*ZfjRorJ!Ihsz3q_2$UQ-kj)UPw{n*+E_4txoUA#=ra-v
zu=;gSIUclEsN_MjLZ(_I_#cHSQ=h>lN3>e#MBkw6M>TB4C5n5v$W&~)mTYZdw>Qkt
z1}Lrd*|K6BEGH3Qg4Y$|wap`ySz}>bW_j(6i=E|`5D5>g@l3>K@;OPH5pUxn4rT(`
z%6nNxvbx7_AtSsYO@S!u8Bu^jBbkOZnq(lA8!9r-EY2V&fMtX@nk`&T4&gEMOYShI
z@VstV8})7tf#jG#u%d@c{tXL<OhTgYGgzWKDmkCXC77c#4~ttB$7OLlldF(ZM%%Vd
z9f*_rI%rIw`a>XZ<=VJ`I1qk7+DD%~uUDp<ZV9h9%MyuMrwbpuC*}hJI{+Zc+inPo
zyb}24mA3#c<EWwtyhd<4HUpc@VE;}8XUx}x8(#O|jU{PWW&W?)3qekS2SijTgt6|v
z9>mv3YAA%iGrnM@Ks;S=nphTy?YLS?ZP~pmvu_Ehg!G3gch^8*Z>q|^FDbHn_j>pL
zVqOUZWY@bPZmi-vYf5t1aB!6z<9z4Tie++OEMtKgEv%HP7ocmf;<XLvHYl(goz|mB
zuQWM(u_fWGcHt>(Yz#x^nI-Gx&dSUuNv*(P9Bf?D5fxq(3B2RP2gW*6w{4wZ7$@m9
zHmD^;psW=h*LFnkN?4SPWer~M8}DogEvc;MU>$7@Te=XV*<u5`TguK*y5W@+dkTw{
z)EjHVSmen^UruPri0oC5i%r@<Y0LF!(O9q4gDv)*Tmr-0>!nvMWCL4>SiF;wy1usA
z(zTGxMV2WQSIFm`Og-&d5@xig8@1ihNUzj`1%B1W{1ExVb1M_`1n@IA=66z3A@<5_
zv#Be4T*DFGc3xk(5V6@D2;o88Z9rI0WyZ;Q-5PE;%P~p$7+1HX)kKhp1qr#{0TgCq
z*Fkibyh&*L5aI<cftqH)Yl3wv<h!g-SIoL$3f%FHfNmbCUg*(STN-_Tx{z$Eb@Mh^
zugpQW2FI#yp*;5G8dQ{($TIog>-wZBF-*E{U^NWxc+2(T!D2<Jv)_B5pT1s366=IZ
za4@m+bl4T;(&U3|7F>Tu`K(J@e^JsJybiXD7<9t}(dtsp)IU0t1#2U`N9Db|mCYOz
zs1r5;V+)7GPEShIvOsh+zO|7_*4b_-l*xQ$%+&VUv%pSICw<b{*M_hqnQHw;+#%v?
zO_9XbZGWevZWq)X+sFPlY$4I|xZwpI%vanuazDeqti%GYbKp(999o8rm*O2@S<Khn
z(6CSh4%c?3*}j&m1)^Mu|8t||UTkX0Sn}?CB)GyP?VJ(%J?!CoMYsTW0`E4TsDPe;
zmS)ER1aNa{^`$m4^T_DJPTt^##%5?qBbRC83NpOmYYhpkIX<AWAQ@kB!^3Mz<M3r0
za>zR~RTo|mF2ru!aA5UTc+-Zi8W~$;g$}CT3w5%x0JX7<m^b4_plGaDszD}&E8@h!
z`kr(0tuew+ur`A|D{feuF1Q58^;$+m6g&0{e9e*>crDvtH_97;!X&+R){cbw+JLB^
zj7@!kGYS1jT}|;1On2wC*=808qEGrMR0f;7UU4o&I9%AqK<AD|?s{*J*|!vTkg2dB
z`a)O6(r9V1ylu}GFHdKceRa<rvc{o~eJd~d=e*OE@f}R|t=qPP^jdhm;Sj@1*()Ts
zi{k2Jyhj!ru~_(qP^z$xRQ$5nL67-_*&gBZAJg87fcB^_Q(j}ARl<3+o%1({M2<_x
z8E9%I*85;y<&KaDdTp6}Oqfja_OFU7u)K%?a?1M?DyvHy3ULDSz=1>y)_`76pae<X
zr-4H0^#)OGOm+#0pVV6$E2}ThWfc}zk)Ox3mD+Z#%qCUB24^I9vobed(8Bh@Mw>0|
zjeBy7b=?CRdNQ1jH#7#kJ*I~HHI=_t7#5=Hd;gyGy;KUPLP=ECx0V>srLB883uKbz
zRk`j-@%6<SUIJfWFw&(nP{)-PL=IB#nN#l9WPNS3SM*-Iv<GTwjPn&BVKjG!<AHR?
z8$u~nLec=c>jl<YgmWE2FWYN#Y@#;(M#g9uT+%QJq`wlI3@Kb&Tw?D?h$V6v*IPx$
zp;Ykh-?YlRMp&esW<#jW*BWbQT0O6qwWdv~1cyc{7X*YgRPC&jVPXlOFg?Xik;{3$
zv`LjP;DA2l%Ytl{exYI`ax9Dj;H?wyy74fnbV(!+du)&tcD%l}xS`^NN#~oq{Z3cG
zWTaO}9(?^&2a6IbT+2&3n9YeY?HiTX4PBB%dTl#&oyd<a{Y+@w$t4>*UBVH9wY|{=
zBW>1F4N_hsIRh!|5Y4rgd{;CiU-dg}=hLRzKEhnAae$?RBbTo4g${BC2wz6{xa$n7
zwCOc1_ON0ZRpL@wxV{+5E?T>`B+uo}bZXH^wactSXCrRd>&s@2ws)z9$mVvV0y=H;
zMXksh|GM{{D0RD99p(ZDv%~Dv9@n2Jo!r+%DqbUPapQG9O_z5NjEU9C6nt6dbfrmt
zC9VXWSow-=IQIddxs7bSANU#hM!GMZxUWnLu&XlZIOl{1OOYV7gVjL@P1?HQNnrx8
zumDUnKySbz)U$SmZjLNB?S-~IFVl$A!F;7J#3eDso_8wo<=y$rMk$?78&VUjOJxxJ
z+E~KPPPSX!>tfF3O^`|!?gsW#33q0jWHoXk0*kcZ8^lXh4*S!w@Oytccl2c&o+kB`
zX%&(Y*k8F^Gu}*`GRXt2P3-W7l&H85f|oaT;>tUr{v7JFH5t1?MzT5A$=@mHZBLd^
z?Ooh5>8}?W2Ex+Dj_Fty?)WmRH$@|=u`;r-lOdB|{e(}#KolDAOc#kny>;j0Aih!)
z!c*AUcagmq(^)A;Hg+J@izwd>fF?zI-;>cPo47%9!ERo=^x{gAE-(;skzctkkO%R#
zB4BK!5R-|~m>Rnj(w3bt$7ch2Tn9tbL3_<FBnv<zZF%RR#`9!}%?;U}E3xIy4W}y>
z$>T;9!5Rx<%h%RKWZ;#JUAvh0TYr3BtzN@GXhTPNu<GpLvG2;Rp^a`?Wg=vKHmQ-!
z!X6lz%-PPh-Fvwy37QDZ8RoCUp~)Dp3HO&L!?tkPv~YdvzVGdO16itkwByEf!?G&0
z%AH+-$h2*<+WNIDzq1uVgRtTztj{LO>$X?WBI+QOs$7%#tS=92Im>+CwjP}(wR=Ux
zQ}??3#!8XPL!XHccrf&c%y!(kZnNDhep7<4$nKBVh69L5($0!ty*_hT>o*`-`x2JP
z@>!p-6F;sS33I^La5A}^J=`#)2jz7@B;m6%OH<&LjC$?S2n{;u9mKeebpld4D6bhN
zC3Y5ZGm_uxwSN^EYB^9s3XXXlF-+pTvZWY20K^^eg&&^Q3W@k+<f-*=Yc_R3BC1sP
z`sZt#i1NZGYWR)?pM`=4vF?&5(M#A!AR~^CBtMi(f2YjsAInW4DS5rIY)Z-nvv(}j
z6Ps)DL7Gci5sPK96HA5f1g4YpO2Q;FrhNx<PaGtENTVJh*i~Rt*Fz~Iy>h#9C1WwO
z{*BKWo$wMUmdaNj`cBbUPvWOMvDZ$f2PwPk2y~Un#4IX%rDj%o-w1<GtXEcsKn&O#
z2uryj7zETw1f=^+{`~rM>Rqz;J4Fz{V(S+A8OKgc&OuVfP8_)5luy<x+0lD1%Z$%I
zw=-uU0$cZ{#`gMmxRWWHGGX0FfVHEfKeSB5BrNPJds~9G{!BqSD6fV6=NP*L(vXVY
z8Zq)kCy=<mOn;-3bIPg`hJJo+tF)I1pMx9B!L|mthRj@*8;2&Q8i}7cEuuht0P3<d
z`m)e!1SxY{r~IW;r&qR0NKBx^sXQn0nJtE+#m)zz@67LYZ_+xwb{0vsx_6F(+X#2)
zeBD?z#y2ivX1f2*>ZD9qibg?*gQcEV1_oTP07c1yWL9n6m`=)M_Z8U;1Bwd{-L;`V
z)3<vG1}y3gMsF%oCd|Ylb{lN%dU@84l?s7RC&3!PuT1M?t|a1XC-sx<@JPzcR~(y8
zdnNG%j%^F;Ep<{6R<gHV#9CQ<zg-KB7yz+}RoGvUx&dRCNmPR--1f&~*tq|63;5t8
zTjBFrfeJ5Zy;XHOn6I$WA*Vf`F*2Nm3+O~geSgR4_3f)0OEav5*ah2RhXJ3Uo$ohW
z6H}K2u8WV`tsmP#eC^mQ7Wi|XG5Qrx!@pvWXYvMeyW^N2yw~x<s?W6ZI!a|vg$rQ5
z@gDL&jroUl^H!}B5-a-$-|K@lPw84`hcFWVszOWl{pp|e*(}5%;Rm*xt*b&g3uM8m
zH9iE<nM}%Y{ndw5EsMhkEh=$UTyA<MCp?*bJK1m+E>hvsM(dL)AxuU9B2Ye_3e9zC
zxxrUeYuy82mRYQa0SDtX?l0RC0Y$i2$94goaO3&N3!AO6=HtepnNv~`vPF2x?8eSG
z^vi7ChBFKF9b(ztgd3A7fx`}Mfdom?3v)j6Pf2oxm_&A+EjJoqq^i~>Y~c|YQs5-{
znCkgvvt?-H3u2|^8}A~db|RM$jZZ9nKpb=8ay33gm`Rz&F4LZ_M>y@&Z6F7}4@lU6
zy|GT04aSH4)?kZD#-CW1$TqV#<g|wU1qRa6u4R3Jc@}crBcsOUBBRviyPt&$7tRg~
za@rZ1i7&7|EDvUM!)o?*@3qM%A#A`VV6U%o#0wV6!Xx&Z-K&tsjpS6D5e}?2t~a8z
z{Taa1bc1<5K8lv$FT@zvTNoy5_eup-`iQI!Lo|P8VNi-Xd}T&B<nY|6$WLv)B+QDO
zNcRJ}11|BzCt0cnFP<O4&bi};``QdLf!g9`R#Gn5so`3Z$y#NWJ}_x~gY|JRU)f%1
z!vZ!I-qR(xB=ccMcLq`<i~k0JG9Ap<{8EX~AK?XG3%;z4H5iFamK)!p=<BlyGhql!
z06CICqpsd|aD2!Wi>EH_H<WX?H_00x1t|~+N_@LEIwMTVrkjkt$Bj~ibZYlX#1p!n
zkHxfyHjR}O;=tEGGo7Lvi&I4onN3t)yaP4n%hQ#GJ^o|e!{zNpiA?JDFnOlGz@Ru0
z%)ag=Yra{s{MrWR(@o=k_@0w}{priE$3Oq{<>#M&{pQ!N|Mlg^Z!46GKI*r>ef>Yb
z{Q2iE_F4Gtf8Tz5?d<#a@cQca-{Wh0m+zmB3J;_9W-uJa_hg<Ai#9C14%?sMew{5j
z!_vdBz0=J;TiKjp*@op~SU6_m1KH1qm4{*b>qh%W25+`%!|E{`X*aL4RcBZ`hUN4)
ztb4=y!)*K8(XTt{edIWX6+3|bsbRsSq}bv@x36s8ILS$S92dL;4<;yth+n^R9N+0~
zW{{+eW8D4)ACEIp8PT@Wu0e3em4|VA53*Ou?A|yNmSN`*OvX0%+DTgMJ4gD|xc)d_
zkxYB{HH?RGdvCDU^DEvxH+dO$hc=y`JI>@K+4+t9sd4dfzGCBoC!aArjN99~y<S>Z
zkD0ubX5Xp(bidQ&B}iV5ar_0&xcV?|&bN7T79}s6X_x+~`AlBOi+mkt=RUmq5KUgP
zox?Ew;_hdXevv&1HlKHX$>e1-xgO2*S@6b5znJ=z*$eJClb0>n`RO~ob4ZdG8@EgB
z$K%SweDgb_XTp-nOO|}v{R{56Lte(P<>@os<2%Hq9kVqV2hXUaLs;5z=FN<H^XAGX
zDs~fWvg!#+J_My6`&eyV%^h`!iJe-pQPn%NY(jF}9Wz~g(Z(5dh=^$-yWo6w#2Ix6
zh^b54!|dJCd`O2G^I|%$xuXu*Fpr~alxKPJAsYMNF)G_;G}m)GM8lk-Y~E#a9k)X?
zOxb0-o33b-Lo~*5$U~yxX@X)J<e1Cs4WEB<MjfJ2j`OPKkXG-I%OM)|5RGc0QN5in
zhiKGeuBN#>&#Rc`ICj2iE_de-*=XI=n+<a{Kry``zuvqjR|OQaGBOqtMeknLLp-X6
znVNEyKt1HcO#R-?@Z;-JO?TLANz&+kWV+t6{f(ntaVPKC>Vx(Oc5dv3=nOk##N6e*
z!QjWbsvbfj>uG9-P5hi;?Ru;Cm#JQddE#ID^@8rtXT1({KhkuF)+Q<OwxpR7F-x6H
zCS5Jk<cS;~S<UfD-f=gR5>w!Ix7mNr8J4aZVSiBXb(p8Lnkf>^X6Kf@+uh6yv2!!)
z$<A)hFjFPAxSbNiaU^3p<J#l6W+&%5^Q}LQvkT6K{m!^UP!3^E=7v;nEBhfP$yC==
z%I>i6@QuL&j^yrTkC$)UU!#28N$(1D^F)HeZ-rCtSDL$;OrLLd<$`y?yLlt^;Q&5Z
z+#x7Y3f(SGa)FxOY@FTIYMbdV?+}#Npe7t0SN7$(Zf+ko&bCwDc=OgbHXCQ?Ni*f(
zMmHna`VOU%1ebMheZzbcQxAKQ^T)u~NDt#eGHo>6`Al4Dv2iA5!v&+t!??Zl`}I3L
zF&m~>s)?teSiuD?M|&6-3~P%n);3JBNV&^!x#-t0KP8!5PoLR4hgVc|A8018>O)<)
zW;69tE$$Qk^}#?BnI=5Zj=sA<)@Cx3WYp{D2Aa^c;}R-D9sb_P7|Hqg<Uo10wm02w
z({QoK&4Oaxdb1F&bNdP*?$<Zj^)++bU9fI5xiPgZ1IXT{9@=Vh6QtPeFx;>|2&avP
z6G`A)JR}IHjZ)nL`don%QX3!Pa$lDQLAB8?zXZ;Qc!kwQVK<-Bra@qBv)h;?IR0_8
zhk?=1%n#6S!L{b7MWF$%y$`}`<>ATTyLev^VB1UphE%Ex@C&iEffG4*k-{LzHrP3a
z&)p8gYz0Z{G>UtShS_E_HZoGhpYM>HVmnh5?D#ulViWE9M@hIpVS5;;q)GbVEKF=n
zZCF&0+>k#QYHJ!bnSY;LUp5$OYZofXZF57VAk_94R&06I)u#s9T5cej%S|StH|`J^
zokP`p{<uS6Vlgdz2wHNHp<tkGwqdrLzG5@XHkq?$k$-X#z+jkdGN-L8HgI*mfwneo
z@3`=4*8JtkI+?h1I|moF3Hc#pN>bb|`V|bj)r5*-II}nKjUSxN|8fC`AOu&AX*Q_H
z1vo;MQ)3#xnCI={Fd@sU(Llj<?p?}{zHo?AYp%FuIm2cu4A){KVsD^nnIr_>ykTFF
z8mK!>g%o0OCAG*MHicL|1;GV_cI7L^iTk^vDs<O;#aKV*^OZLt)MlIG!hWH=iJ|N|
zMqf)A%sagk*-<~pC~u-DC15sJ<ccK6Hpc+D;5&=uja$>?54n;fz}EsW`FtM)QuU2n
zBRt#9n}#a4#w4dJG<9!BRUl<+?8mOU&_XcWcf1Ksd~c}A9X3^E+BmwgeyGwo@@oXE
zx*}c`N14m7T)VFvtNa>M$4U3!RaFK6$1Ia-7Th-g1_3vz@lRzlf?>dtnk)?1{ZIpe
zr`a%j<7R4tp}<x1nYr;Tqrt#MFhT#+h8hlR8Ol&Ur}_;DF0!XeZMu5ckYG#9O*q5l
zZv{hwEqNH4Tz&uiEMp)EH3j8+ZiWP#oJq1jP%{Pw+m)XQRreSS3>G=6NUQl|o<m%Q
ziCIx1%RN4WgNu+8bHIED+TdVIo(I7ZzQb;Cu)rw0w$YC(3=eK{FibrCYioFLd!s}B
zYioG$u<MtO`B=s7jWcmkiq9NjKQc5t*hqMLMfs}&b@#>a;L>fJ?Te2J7#?ivOP11N
zy3ZSzuIo$E*Z#g39$XZmo4R&$VZrd=YWtGK4)w>?>%K%Am)rzlFg(~Cpk#!B=*QWH
z2itc>8<*UqT`)YjnHkIG8%CE@WpJ<@H5-@QY+p1qxJg}G{>@GIMS;Oe8|6<0T+zT_
zqXFpNMt|5LFGd4U%KL+D5uo=vOvcYWy=XYF(EyYKb%iV%3T!lhqS;)cpn<@KR*BE(
zI$6;mV7szIzL`6l0l-E&m{64~C<gy_V=PHOczQD$_-lw-)-ca}MT34VF>jHskEcZg
zeoY%?t<7hYK2RKnW^?a=fxboq&{cI+UlimkQ*wxj>ySkQd`*K{eCx9SqQSkUh(5;x
zi19(6$ouov!X)QDs1w&)i3aq(s+Dtu;^RfpfZi^^*3{PrTwqfth7$^r_SKNcxdNyZ
z*!V>aLV5+D>fX6Lyl6<TMN&e<{Cg*yS9q=5RCky~(KgB=T6b{<@(NS__7l)>G>BI;
zXB*|Su?^uhgDiyC|HL-{uLRm1_6FZICF>sA8+cb~3wM<HC?=D31zeF#f?5oQu!t+U
zSX)dI5nWb0IA0S9-Hmp8W_rclmdVRCNio73!y#{=pcX}4x&^NG6TB<>pv7IuH+O<}
z<=<>_;M~m-yt^rNp}f4SItA};QZ34o`=9zq{Etln;7X3cyTg1&<!0Q_ISSnsm9v|(
z`N1&?-L*|s9>NzKp}U6CB-N()_Ce^bd2*=;YxQR|!BHS=?v<Zli$ZrrMN}r@gMk8E
zY>i^p_}bUdU8yKjh%Q7M4coOGxs+6LOW2}8yOxxfN=z<)AQmBX4;nbRz-}~P*A7tp
zEw}0_8mucj5oMM9DjKO8n@@y9cUuh9Rie{!EXfx%19fGnmB@ARz-XXu4C7H;`~XaR
zUgh*Y1qMgMbi2xg<Z8KAO^~iqvS!!Zdd_HwuFgUC&tKkSqI&uj?(z)Jwc`uYp?>ky
zAudWd7fH2y`wY&NKVn5*$;|;pgLCDOSSBaAjOA!>t{u8@zLJYtMniLzaJCw+<U90+
z=E`fe($nN-<Dz)IRx}(89`|XUQN-S^84pG87EeWkb5%E-%+80+-B81GXPvUVCzn_n
zMekM2Vyrfw(HITV)xcnoi%&_7qWFrhZWVCB<=;hde0zT!=-UWGb%S9OlSSzthrzlk
zbq<QfKNzT>TIZ<H#l46I>;^+9R34Z<5CGLNiU4hj&83n@gLW;AHz|MqghQ4|n6P=z
zZcR%R*H@sT{B^ggB^tPE8SZIA{rSu^nbHv5z`Yov`f4^iL4P*$V@$KDTHPIW$cufV
zYR>)ARpY}PCvGO*_h1aumB(ZildeOU4APZ@CN831CTkf0lP>v7?kEeZO+=zxdUx2P
zx0|Bum_OfRHGQ&v4L-vw3DF&j<n2rSa$a$Jt^R3p%3S|CZE|2_b8SoAoLDkkH>lP@
ztTML(Jc-;Z6(L%gOA1XQ_YOJrwmE*yvdFzw)jOGGeo=N1awkff%%FFblE}R(uu#I@
zmsF8^Ei)aPLV8znMDCp~f(>*LmLzhoe1srq#y<{uGjhAc^YhmzZ$=`gXu>}Zxiiu=
zpW<64k$b!RZM(=W)RlzzcKP?xif-Au$h}<=n(eBaicPa2gNdAQ3m42wvm=9I19evL
zI{`el@CZ^Jeoq>qzEW1|S>Qr5N&H?ZD>c<{LA@m0*K$x&R(>~!B;;3ZUyR-TfwFqj
zmti_kzOoX<SJadt_2@TP5H@4prFqaFC@TYj?f8v8=jNi48Z)R$bUJ$O)lg>!)f&pt
zbBCGG9E<y$l`<Gu&XW=-?kIC;OwY_{*&Q~n-qWXI-emA^l&hu!WOtZ_*fz>`(G^QW
zehn~|OuC|Fu&<D9#k=m28R%=w+!^k=oiqgbikN3XtDn9~lhJFCud&vA=r)PbE0<n)
zX!d6m=KDw}@<HY#%vXCO=+;G6(!_lAsp5jWhhdm+G^(5i`poPk%-3-33Elh7tT11@
zMp0mu3y3FSzE<Ee^N?-~naZOt6O{CEQQuS^eVI_?TKc=HifbWc#*=p0r%8<7qHC`r
z0#|a%qeYT0<F`FaV)P2Tx0=cid>LWCYT4AK*<4wzkG_n0OZljAs&9N5HOcdDhrz#=
z!0s|h{;&t|S7~-%-w69PZ7MzGckeOmSN@iS)D;<nex(;DM(t+3lYzg6Q76kUeQ=!w
z{;JSS;I^BxO={_&m_p?7?A}A+zjKM|dgssh*yvDso8S@&k_f#DMnuW?Rliz0C>XKK
zO>j$1Q+osE_0I((LV>e9eD#X)2MWxS^Q3HwF973V;N(lVMbSwxa26b4O3JNkPlADG
zn?AW-uCWmeJp13N6wjYAJ<KTNB)G-RX|{S$l0zNhTmcXaEK>K7o8s@PBuB|Y&FBib
zU|>UYg`9lQByPgMN^5?u``Uzoh1Hnk`2Elf1`cvll(zTnqHy3WkVn<celImysmH>j
z<X>bpeNd#<^XCRi=R8&{C12+V3sz7mOZCA(`8Q^Xh1K}#QH>u2N2s8~kGRL1h+CBz
zzUolx2O%dK=msfStsj(KkuUBVovhXm@-|d_;(Co)Y+t!zs_Jm>V-`MaO(G|%;PU0N
z;lo2pPWf23DV*TpBIjQUz@Jbdl?Zy4weZ`}2_6<DUCche-Jsy%B3!|o4wvwg1rJND
z%D;8v%^V&<KGgw!H1N?_C3Qe@k+ZDc56TZ{pqn$vf`^qKuu^=#DldmO#!3U--XB@;
zaF&&m^XLkI!NcnPA$Z7bHjoV+7FIvYK;1hfa9EJLIxl_D-_qn}Q_mk2&A4|%;INt+
ziO}d8$1HGITxa!O_4`N)9JX}sWQzHRA#hlH8Wr5Q^t(L4VUtv4*WFBFj*q4)sTa7L
zkjeswRg)sD-dE!Shpom=rpoVRoZo=MYAsCD;|+Wa#iOu#UyV<2*aSdnK3|U;IIK%0
zkHd}R^6c7cN>xc(|2C>^uSLef#aul#!C{do1-!ZvE^t@`HCv(IcP$GZo}I#^Z~RXc
zMdGo6kI(nb1`;dc6xiVM4zi)d-ENc;b-sNwoY?BBXDOlknT8Wvk-J(BxWun)K(X2V
z`YFsWPlE6<Ogh+=YeR~S<S9(k4T!RkVxg~xl(__+tS-LRfmU>De<!VtuT6Himu?0r
z8$^6uJaa95YIin#*jy3|*nKK_Rv+Kvx=QEzcfhb=3)Zq`b7jPkVQWw<y1RSU1`C@D
zqdxq;CNfaiw7c+fU)2f{Hj<aE%@;@mgsmQ3-N1Ysq;9^4WT`H~?<%cszQ=5eT-~TH
zPbgS<DvMlQeo7V;EFC0wz_;pxf(4cx;_Ry~0l`A9tXr<%gg@6ua3(5Jb|KGPAN}2E
zSZQ*z9a&KDF`@OK_&})}6l|Q9sDd&#+nYrLmZ4N0&m}r%fx$Y${>ig9+LiK+lP~EW
zqM^Z2TyAL>7t_mz21j)v>YwxIga(WICXdbqJhSM)G7QRC_#U01!BO4(gp~Sf#?auX
z&SQcfeQjuHa8zrLAy?2p4*4yr6jRN<zec4I)ce)cy_@UGLWAXE&BlZ7K%v3$(Km}e
zz#=qQ9SikVkINLwLW8CDrHNf~LY{qprEt`!))jz>2CH9=+Bv$%Av9PIhN$;~OWVjo
zgVjJ%FU7d&r#wl)wmI_ZeS}SDux`ifk?NWaLxc4=hG|v5xn>p^tgf8mh;~=43Jg|R
zh7mvfra*a;f)yy$&&_CpGaLDTs=zG^3|94*dT;wibrOT^R>jYqzrbLT79^@JpCbzl
zR=uHO5Z@XL3|76N`kDCFSYWUkI81W4`xb-1VC#f3d!4%GvCKZekB$BP-jika0agLK
zw4*<xBuBbR74z;}4k8Pyn^^jkb}T}J>l=OSQrOExgT?6hRJnbbXs}6+Y>r!SUxWs$
z8drg+TXJ8728#<cU3gb=ga#`CHH+@u%~30e<4Xn2_z!s)7HpbIh@N}<%j^QI)=7$)
zU2&U8u=*t`+VekDv@A7U`cxCbBBHRG5L%kV5ATbJ!bZPW@aDq_MOd(yNBL9mMG+RP
zwukaK{a0Ls1*`3$oMZpdnAsXafS1T_uD+Q>VX^BZaQ>&t#gP{OR4Hx|7ChUR%5U&L
zRnD=cyMj!dKTtK?Cgf^e;y)H-Sa39tGX&X2|2W>bIBH+wKZO((R#_6suwdW*7h%D2
z$JI;8_2Y|(!Wt-AkIT*}0)yo^3b}C;9z|fV2Fg`+i*JhHU<Cl`+vP?MMR4$p96r^T
zrw9&KJT_kg@{dEU7S-ER4TSvnsruuL>M`a&y*2wr$j4C?zdPgX8}ZoY#V=qh>Kmb0
zWmdkq=cv9B3RdT1N&bwYf~w)0(#Wo?s&B-kgQ$U}D>;IO)pJKW$3KqzR&u1}{7+R_
z)gL#<EuSkQ5o=dftmk`<A`wdf<d3_o_#zUq@DZs;UvktqLgh)Jed-)%TVVO)0v-Gr
zMY6H{vmB%kKJ`sNKHKa2kH1OhJU$`dzZ6?UB9?<RpYU|gQ6yqjA`9kl=~+c2Vm*PZ
zXLVd)r3g7zzfNHXE+3=_ITn*l59_$#QJKiGT9GSt?P~Ig9V<I42g$w2!j8ovS77a8
zvPIajm}DwN{$QZuDuoV83HrNgAfRD+C(@h0tFl&txrLAW1Eq6B&k#QDABQETj$vv+
z=MuAv-iA}`pw8#6pc;0pQu|pZ;p$Yq4yVkZ0#)}U+C%;_T3e3j0>?$~!wLUa=Eq;(
zAu@{n=L2#6`mE8b=2PD^SJfD5tUQINPQK45(AX@-ESC3`;slLFJQ5P?eyM@R(ah=0
z8TtC#K;t<1JQ8j9`Wk2)g~W=L=b}{Q4QM=zdE6qwGC|`v1QIu4TPA3%fuCv_RRkIf
z`<)f-uAmAuR%ARWEB>xp{#(^UYTfED@r`pcLpXO+1scnpQd3Uf4-;rCA4SfMn{Fxs
zjdhGl*SmEtMWC^;7|T<AAUFbzg^bww`?<Ix&{)Vw)U9&$zCdH0|Ij(Q=P%G$$cPgD
zz5vX(<HSAxqyQ)_t^ymm#r`X|)`G;wsq3!`8q`f1N4Z$F3-$*-7A?#!P_8+x!i;Cp
z!l(K<Rbj@;#H%xt+W@QzGoGa&>P+FjTr13YmVy}H$;EK0FymS6pilKT=dpLq?8WAy
z4RtbzC2`9BySpmPcvd?IGj=y8JfeT62YUP&6^RRNQ2O89)rlLcU5*kX?wi1GUXMHV
zG<PLu;>N-^WLEvxqZLmHHL`Pb(-c*>v0BT_Hu3&IdBtV{RGRm}=8T7dv%$QZ7^(3M
z`Zphb^#?wpf3xMgn^CE1Dy(j!dhFdbR#mvM8W;(vbW<_aaASe7>fRn)n4*e9tX2U6
zV|~3kabsJfo_2AO>M9Pg(0IjDF2Y%b8_UW~f~~(f@{gsEWggu%3O6=3#;nZn&r!Is
zoDR{Q-ON!HZme!dN;$cd?ke0^{S=fra_MGOxN%i@q^yd2j>3&6|JXLiH*>;`C#6me
z7X43^wNj4+b^LL)oN!~6=BT-Xi>OrL#<TSNQ!PiUaN}8et{$iEt_nAvrROF&u4i3^
z8_)JDYTw~*j&Ngf`qhBa7jogodhtW|(Z5!cQY`0DO)Ff<5pJwprA_GKlvS)^K|jij
z`-k!99?$0RzCAY7cs4irRHv|Npz-YHp^kv=;j8h4T?~~Ty8NbUkg@EPa6gx&R1Gnf
zjH>aHd+<e8%Eo=F(NCQ{Cu}>_Il^C_^#Xm<n#S$MPz@|ri$1k*aa|kr8CFLH0Y9#o
z%?IQJF$-aIwTzHrafOwgatZTQNbv-IL{N2iMo6(3k*Xc{uac1Bi5RJl$NyAi#N~u3
zvF#qdkm5~Fn4kuKjq+?nP_^@S0mCY!*uX8-s`{^uS3`=`0#AsqTR2z^C|0vRRav-Y
z^|d_);o=JVCSN@#rmvt-%AYVk3{=U{2R@&$;@M1FsJ;KG>IC{`#t%NVy!q7hX2u`B
t|LM!mKmW>q_~HA%eEId?|M-U=zW>u-fBv_xzx?qJ{}0GNAT9ek0RV)@Lk|D|

literal 0
HcmV?d00001

diff --git a/test/unit/parameter/cpp/CMakeLists.txt b/test/unit/parameter/cpp/CMakeLists.txt
new file mode 100644
index 0000000..db45500
--- /dev/null
+++ b/test/unit/parameter/cpp/CMakeLists.txt
@@ -0,0 +1,40 @@
+# This file is automatically generated by running
+#
+#     cmake/scripts/generate-cmakefiles
+#
+# Require CMake 2.8
+cmake_minimum_required(VERSION 2.8)
+
+set(PROJECT_NAME test_parameter)
+project(${PROJECT_NAME})
+
+# Set verbose output while testing CMake
+#set(CMAKE_VERBOSE_MAKEFILE 1)
+
+# Set CMake behavior
+cmake_policy(SET CMP0004 OLD)
+
+# Get DOLFIN configuration data (DOLFINConfig.cmake must be in DOLFIN_CMAKE_CONFIG_PATH)
+find_package(DOLFIN)
+
+# Default build type (can be overridden by user)
+if (NOT CMAKE_BUILD_TYPE)
+  set(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING
+    "Choose the type of build, options are: Debug MinSizeRel Release RelWithDebInfo." FORCE)
+endif()
+
+# Compiler definitions
+add_definitions(${DOLFIN_CXX_DEFINITIONS})
+
+# Compiler flags
+set(CMAKE_CXX_FLAGS "${DOLFIN_CXX_FLAGS} ${CMAKE_CXX_FLAGS}")
+
+# Include directories
+include_directories(${DOLFIN_INCLUDE_DIRS})
+include_directories(SYSTEM ${DOLFIN_3RD_PARTY_INCLUDE_DIRS})
+
+# Executable
+add_executable(test_Parameters Parameters.cpp)
+
+# Target libraries
+target_link_libraries(test_Parameters ${DOLFIN_LIBRARIES} ${DOLFIN_3RD_PARTY_LIBRARIES})
diff --git a/test/unit/parameter/cpp/Parameters.cpp b/test/unit/parameter/cpp/Parameters.cpp
new file mode 100644
index 0000000..b86bcf1
--- /dev/null
+++ b/test/unit/parameter/cpp/Parameters.cpp
@@ -0,0 +1,124 @@
+// Copyright (C) 2011 Anders Logg
+//
+// This file is part of DOLFIN.
+//
+// DOLFIN is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// DOLFIN 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 Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+//
+// First added:  2011-03-28
+// Last changed: 2011-03-31
+//
+// Unit tests for the parameter library
+
+#include <dolfin.h>
+#include <dolfin/common/unittest.h>
+
+using namespace dolfin;
+
+class InputOutput : public CppUnit::TestFixture
+{
+  CPPUNIT_TEST_SUITE(InputOutput);
+  CPPUNIT_TEST(test_simple);
+  CPPUNIT_TEST(test_nested);
+  CPPUNIT_TEST_SUITE_END();
+
+public:
+
+  void test_simple()
+  {
+    // Not working in parallel, even if only process 0 writes and
+    // others wait for a barrier. Skipping this in parallel for now.
+    if (dolfin::MPI::size(MPI_COMM_WORLD) > 1)
+      return;
+
+    // Create some parameters
+    Parameters p0("test");
+    p0.add("filename", "foo.txt");
+    p0.add("maxiter", 100);
+    p0.add("tolerance", 0.001);
+    p0.add("monitor_convergence", true);
+
+    // Save to file
+    File f0("test_parameters.xml");
+    f0 << p0;
+
+    // Read from file
+    Parameters p1;
+    File f1("test_parameters.xml");
+    f1 >> p1;
+
+    // Get parameter values
+    std::string filename(p1["filename"]);
+    std::size_t maxiter(p1["maxiter"]);
+    double tolerance(p1["tolerance"]);
+    bool monitor_convergence(p1["monitor_convergence"]);
+
+    // Check values
+    CPPUNIT_ASSERT(filename == "foo.txt");
+    CPPUNIT_ASSERT(maxiter == 100);
+    CPPUNIT_ASSERT(tolerance == 0.001);
+    CPPUNIT_ASSERT(monitor_convergence == true);
+  }
+
+  void test_nested()
+  {
+    // Not working in parallel, even if only process 0 writes and
+    // others wait for a barrier. Skipping this in parallel for now.
+    if (dolfin::MPI::size(MPI_COMM_WORLD) > 1)
+      return;
+
+    // Create some nested parameters
+    Parameters p0("test");
+    Parameters p00("sub0");
+    p00.add("filename", "foo.txt");
+    p00.add("maxiter", 100);
+    p00.add("tolerance", 0.001);
+    p00.add("monitor_convergence", true);
+    p0.add("foo", "bar");
+    Parameters p01(p00);
+    p01.rename("sub1");
+    p0.add(p00);
+    p0.add(p01);
+
+    // Save to file
+    File f0("test_parameters.xml");
+    f0 << p0;
+
+    // Read from file
+    Parameters p1;
+    File f1("test_parameters.xml");
+    f1 >> p1;
+
+    // Get parameter values
+    std::string foo(p1["foo"]);
+    std::string filename(p1("sub0")["filename"]);
+    std::size_t maxiter(p1("sub0")["maxiter"]);
+    double tolerance(p1("sub0")["tolerance"]);
+    bool monitor_convergence(p1("sub0")["monitor_convergence"]);
+
+    // Check values
+    CPPUNIT_ASSERT(foo == "bar");
+    CPPUNIT_ASSERT(filename == "foo.txt");
+    CPPUNIT_ASSERT(maxiter == 100);
+    CPPUNIT_ASSERT(tolerance == 0.001);
+    CPPUNIT_ASSERT(monitor_convergence == true);
+  }
+
+};
+
+
+int main()
+{
+  CPPUNIT_TEST_SUITE_REGISTRATION(InputOutput);
+  DOLFIN_TEST;
+}
diff --git a/test/unit/parameter/python/Parameters.py b/test/unit/parameter/python/Parameters.py
new file mode 100644
index 0000000..ffd23b7
--- /dev/null
+++ b/test/unit/parameter/python/Parameters.py
@@ -0,0 +1,149 @@
+"""Unit tests for parameter library"""
+
+# Copyright (C) 2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-03-28
+# Last changed: 2014-05-30
+
+import unittest
+from dolfin import *
+
+@unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+class InputOutput(unittest.TestCase):
+
+    def test_simple(self):
+
+        # Create some parameters
+        p0 = Parameters("test")
+        p0.add("filename", "foo.txt")
+        p0.add("maxiter", 100)
+        p0.add("tolerance", 0.001)
+        p0.add("monitor_convergence", True)
+
+        # Save to file
+        f0 = File("test_parameters.xml")
+        f0 << p0
+
+        # Read from file
+        p1 = Parameters()
+        f1 = File("test_parameters.xml")
+        f1 >> p1
+
+        # Check values
+        self.assertEqual(p1.name(), "test")
+        self.assertEqual(p1["filename"], "foo.txt")
+        self.assertEqual(p1["maxiter"], 100)
+        self.assertEqual(p1["tolerance"], 0.001)
+        self.assertEqual(p1["monitor_convergence"], True)
+
+    def test_gzipped_simple(self):
+
+        # Create some parameters
+        p0 = Parameters("test")
+        p0.add("filename", "foo.txt")
+        p0.add("maxiter", 100)
+        p0.add("tolerance", 0.001)
+        p0.add("monitor_convergence", True)
+
+        # Save to file
+        f0 = File("test_parameters.xml.gz")
+        f0 << p0
+
+        # Read from file
+        p1 = Parameters()
+        f1 = File("test_parameters.xml.gz")
+        f1 >> p1
+
+        # Check values
+        self.assertEqual(p1.name(), "test")
+        self.assertEqual(p1["filename"], "foo.txt")
+        self.assertEqual(p1["maxiter"], 100)
+        self.assertEqual(p1["tolerance"], 0.001)
+        self.assertEqual(p1["monitor_convergence"], True)
+
+    def test_nested(self):
+
+        # Create some nested parameters
+        p0 = Parameters("test")
+        p00 = Parameters("sub0")
+        p00.add("filename", "foo.txt")
+        p00.add("maxiter", 100)
+        p00.add("tolerance", 0.001)
+        p00.add("monitor_convergence", True)
+        p0.add("foo", "bar")
+        p01 = Parameters(p00);
+        p01.rename("sub1");
+        p0.add(p00)
+        p0.add(p01)
+
+        # Save to file
+        f0 = File("test_parameters.xml")
+        f0 << p0
+
+        # Read from file
+        p1 = Parameters()
+        f1 = File("test_parameters.xml")
+        f1 >> p1
+
+        # Check values
+        self.assertEqual(p1.name(), "test")
+        self.assertEqual(p1["foo"], "bar")
+        self.assertEqual(p1["sub0"]["filename"], "foo.txt")
+        self.assertEqual(p1["sub0"]["maxiter"], 100)
+        self.assertEqual(p1["sub0"]["tolerance"], 0.001)
+        self.assertEqual(p1["sub0"]["monitor_convergence"], True)
+
+    def test_nested_read_existing(self):
+        """Test that we can read in a nested parameter database into
+        an existing (and matching) parameter database"""
+
+        file = File("test_parameters.xml")
+        file << parameters
+
+        p = Parameters("test")
+        file >> p
+        file >> p
+
+    def test_solver_parameters(self):
+        "Test that global parameters are propagated to solvers"
+
+        # Record default values so we can change back
+        absolute_tolerance = parameters["krylov_solver"]["absolute_tolerance"]
+        reuse_factorization = parameters["lu_solver"]["reuse_factorization"]
+
+        # Set global parameters
+        parameters["krylov_solver"]["absolute_tolerance"] = 1.23456
+        parameters["lu_solver"]["reuse_factorization"] = True
+
+        # Create solvers
+        krylov_solver = KrylovSolver()
+        lu_solver = LUSolver()
+
+        # Check that parameters propagate to solvers
+        self.assertEqual(krylov_solver.parameters["absolute_tolerance"], 1.23456)
+        self.assertEqual(lu_solver.parameters["reuse_factorization"], True)
+
+        # Reset parameters so that other tests will continue to work
+        parameters["krylov_solver"]["absolute_tolerance"] = absolute_tolerance
+        parameters["lu_solver"]["reuse_factorization"] = reuse_factorization
+
+if __name__ == "__main__":
+    print ""
+    print "Testing parameter library"
+    print "------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/python-extras/python/test.py b/test/unit/python-extras/python/test.py
new file mode 100644
index 0000000..b2cba72
--- /dev/null
+++ b/test/unit/python-extras/python/test.py
@@ -0,0 +1,49 @@
+"""This module contains unit tests for functionaliy only available in
+Python. This functionality is implemented in site-packages/dolfin"""
+
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2009-11-16
+# Last changed: 2009-11-16
+
+import unittest
+from dolfin import *
+
+class ErrorNorm(unittest.TestCase):
+
+    def test_error_norm(self):
+
+        # Approximation (zero)
+        mesh = UnitSquareMesh(4, 4)
+        V = FunctionSpace(mesh, "CG", 2)
+        u_h = Function(V)
+        u_h.vector().zero()
+
+        # Exact solution
+        u = Expression("x[0]*x[0]", element=V.ufl_element())
+
+        # Norm of error
+        e = errornorm(u, u_h)
+
+        self.assertAlmostEqual(e, sqrt(1.0/5.0))
+
+if __name__ == "__main__":
+    print ""
+    print "Testing Python extras"
+    print "----------------------------------------------------------------------"
+    unittest.main()
diff --git a/test/unit/refinement/python/refine.py b/test/unit/refinement/python/refine.py
new file mode 100644
index 0000000..b1e1f55
--- /dev/null
+++ b/test/unit/refinement/python/refine.py
@@ -0,0 +1,44 @@
+"""Unit tests for the refinement library"""
+
+# Copyright (C) 2011 Garth N. Wells
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2011-08-23
+# Last changed:
+
+import unittest
+from dolfin import *
+
+class MeshRefinement(unittest.TestCase):
+
+    @unittest.skipIf(MPI.size(mpi_comm_world()) > 1, "Skipping unit test(s) not working in parallel")
+    def test_uniform_refine1D(self):
+        mesh = UnitIntervalMesh(20)
+        mesh2 = refine(mesh)
+        self.assertAlmostEqual(mesh.hmax(), 0.05)
+        self.assertAlmostEqual(mesh2.hmax(), 0.025)
+
+    def test_uniform_refine2D(self):
+            mesh = UnitSquareMesh(4, 6)
+            mesh = refine(mesh)
+
+    def test_uniform_refine3D(self):
+            mesh = UnitCubeMesh(4, 4, 6)
+            mesh = refine(mesh)
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/test/unit/test.py b/test/unit/test.py
new file mode 100644
index 0000000..a250906
--- /dev/null
+++ b/test/unit/test.py
@@ -0,0 +1,153 @@
+"""Run all unit tests."""
+
+# Copyright (C) 2006-2011 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Modified by Johannes Ring 2009, 2011-2012
+# Modified by Garth N. Wells 2009-2011
+#
+# First added:  2006-08-09
+# Last changed: 2014-02-24
+
+import sys, os, re
+import platform
+from instant import get_status_output
+from dolfin import has_mpi, has_parmetis, has_scotch, has_linear_algebra_backend
+
+# Tests to run
+tests = {
+    "adaptivity":     ["errorcontrol", "TimeSeries"],
+    "ale":            ["HarmonicSmoothing"],
+    "book":           ["chapter_1", "chapter_10"],
+    "fem":            ["solving", "Assembler", "DirichletBC", "DofMap", \
+                       "FiniteElement", "Form", "SystemAssembler",
+                       "LocalSolver", "manifolds"],
+    "function":       ["Constant", "ConstrainedFunctionSpace", \
+                       "Expression", "Function", "FunctionAssigner", \
+                       "FunctionSpace", "SpecialFunctions", \
+                       "LagrangeInterpolator", \
+                       "nonmatching_interpolation"],
+    "geometry":       ["BoundingBoxTree", "CollisionDetection", "Intersection",
+                       "IntersectionTriangulation", "Issues"],
+    "graph":          ["GraphBuild"],
+    "io":             ["vtk", "XMLMeshFunction", "XMLMesh", \
+                       "XMLMeshValueCollection", "XMLVector", \
+                       "XMLMeshData", "XMLLocalMeshData", \
+                       "XDMF", "HDF5", "Exodus", "X3D"],
+    "jit":            ["test"],
+    "la":             ["test", "solve", "Matrix", "Scalar", "Vector", \
+                       "KrylovSolver", "LinearOperator"],
+    "math":           ["test"],
+    "mesh":           ["Cell", "Edge", "Face", "MeshColoring", \
+                       "MeshData", "MeshEditor", "MeshFunction", \
+                       "MeshIterator", "MeshMarkers", "MeshQuality", \
+                       "MeshValueCollection", "BoundaryMesh", "Mesh", \
+                       "SubMesh", "MeshTransformation", "SubDomain", \
+                       "PeriodicBoundaryComputation"],
+    "meshconvert":    ["test"],
+    "multistage":     ["RKSolver", "PointIntegralSolver"],
+    "nls":            ["PETScSNESSolver", "TAOLinearBoundSolver"],
+    "parameter":      ["Parameters"],
+    "python-extras":  ["test"],
+    "refinement":     ["refine"],
+    }
+
+# Run both C++ and Python tests as default
+only_python = False
+
+# Check if we should run only Python tests, use for quick testing
+if len(sys.argv) == 2 and sys.argv[1] == "--only-python":
+    only_python = True
+
+# Build prefix list
+prefixes = [""]
+if has_mpi() and (has_parmetis() or has_scotch()) and \
+       (has_linear_algebra_backend("Epetra") or \
+        has_linear_algebra_backend("PETSc")):
+    prefixes.append("mpirun -np 3 ")
+else:
+    print "DOLFIN has not been compiled with MPI and/or ParMETIS/SCOTCH. " \
+          "Unit tests will not be run in parallel."
+
+# Allow to disable parallel testing
+if "DISABLE_PARALLEL_TESTING" in os.environ:
+    prefixes = [""]
+
+# Set non-interactive
+os.putenv('DOLFIN_NOPLOT', '1')
+
+failed = []
+# Run tests in serial, then in parallel
+for prefix in prefixes:
+    for test, subtests in tests.items():
+        for subtest in subtests:
+            print "Running unit tests for %s (%s) with prefix '%s'" % (test,  subtest, prefix)
+            print "----------------------------------------------------------------------"
+
+            cpptest_executable = "test_" + subtest
+            if platform.system() == 'Windows':
+                cpptest_executable += '.exe'
+            print "C++:   ",
+            if only_python:
+                print "Skipping tests as requested (--only-python)"
+            elif not os.path.isfile(os.path.join(test, "cpp", cpptest_executable)):
+                print "This test set does not have a C++ version"
+            else:
+                os.chdir(os.path.join(test, "cpp"))
+                status, output = get_status_output("%s.%s%s" % \
+                                   (prefix, os.path.sep, cpptest_executable))
+                os.chdir(os.path.join(os.pardir, os.pardir))
+                if status == 0 and "OK" in output:
+                    print "OK",
+                    match = re.search("OK \((\d+)\)", output)
+                    if match:
+                        num_tests = int(match.groups()[0])
+                        print "(%d tests)" % num_tests,
+                    print
+                else:
+                    print "*** Failed"
+                    failed += [(test, subtest, "C++", output)]
+
+            print "Python:",
+            if os.path.isfile(os.path.join(test, "python", subtest + ".py")):
+                os.chdir(os.path.join(test,"python"))
+                status, output = get_status_output("%s%s .%s%s.py" % \
+                                   (prefix, sys.executable, os.path.sep, subtest))
+                os.chdir(os.path.join(os.pardir, os.pardir))
+                if status == 0 and "OK" in output:
+                    print "OK",
+                    match = re.search("Ran (\d+) test", output)
+                    if match:
+                        num_tests = int(match.groups()[0])
+                        print "(%d tests)" % num_tests,
+                    print
+                else:
+                    print "*** Failed"
+                    failed += [(test, subtest, "Python", output)]
+            else:
+                print "Skipping"
+
+            print ""
+
+    # Print output for failed tests
+    for (test, subtest, interface, output) in failed:
+        print "One or more unit tests failed for %s (%s, %s):" % (test, subtest, interface)
+        print output
+        open("fail.log", "w").write(output)
+
+# Return error code if tests failed
+sys.exit(len(failed) != 0)
diff --git a/utils/emacs/macros b/utils/emacs/macros
new file mode 100644
index 0000000..d82d33d
--- /dev/null
+++ b/utils/emacs/macros
@@ -0,0 +1,21 @@
+;; Macro for DOLFIN .h file
+(fset 'dolfin\.h
+   [?/ ?/ ?  ?C ?o ?p ?y ?r ?i ?g ?h ?t ?  ?( ?C ?) ?  ?2 ?0 ?0 ?6 ?  ?Y ?o ?u ?r ?  ?N ?a ?m ?e ?. return ?/ ?/ ?  ?L ?i ?c ?e ?n ?s ?e ?d ?  ?u ?n ?d ?e ?r ?  ?t ?h ?e ?  ?G ?N ?U ?\S-  ?G ?P ?L ?\S-  ?V ?e ?r ?s ?i ?o ?n ?  ?2 ?. return ?/ ?/ return ?/ ?/ ?  ?F ?i ?r ?s ?t ?  ?a ?d ?d ?e ?d ?: ?  ?  ?2 ?0 ?0 ?6 ?- ?0 ?1 ?- ?0 ?1 return ?/ ?/ ?  ?L ?a ?s ?t ?  ?c ?h ?a ?n ?g ?e ?d ?: ?  ?2 ?0 ?0 ?6 ?- ?0 ?1 ?- ?0 ?1 return return ?# ?i ?f ?n ?d ?e ?f ?  ?_ ?_ ?F ?O ?O ?_ ?H return ?# ?d ?e ?f ?i ?n ?e ?  ?_ ?_ ?F ?O ?O ?_ ?H return return ?# ?i ?n ?c ?l ?u ?d ?e ?  ?< ?d ?o ?l ?f ?i ?n ?/ ?c ?o ?n ?s ?t ?a ?n ?t ?s ?. ?h ?> return return ?n ?a ?m ?e ?s ?p ?a ?c ?e ?  ?d ?o ?l ?f ?i ?n return ?{ return return ?  ?  ?/ ?/ ?/ ?  ?D ?o ?c ?u ?m ?e ?n ?t ?a ?t ?i ?o ?n ?  ?o ?f ?  ?c ?l ?a ?s ?s return return ?  ?  ?c ?l ?a ?s ?s ?  ?F ?o ?o return ?  ?  ?{ return ?  ?  ?p ?u ?b ?l ?i ?c ?: return return ?  ?  ?  ?  ?/ ?/ ?/ ?  ?C ?o ?n ?s ?t ?r ?u ?c ?t ?o ?r return ?  ?  ?  ?  ?F ?o ?o ?( ?) ?\; return return ?  ?  ?  ?  ?/ ?/ ?/ ?  ?D ?e ?s ?t ?r ?u ?c ?t ?o ?r return ?  ?  ?  ?  ?~ ?F ?o ?o ?( ?) ?\; return return ?  ?  ?p ?r ?i ?v ?a ?t ?e ?: return return ?  ?  ?} ?\; return return ?} return return ?# ?e ?n ?d ?i ?f return ?\M-x ?e ?n ?d tab ?k tab])
+
+;; Macro for DOLFIN .cpp file
+(fset 'dolfin\.cpp
+   [?/ ?/ ?  ?C ?o ?p ?y ?r ?i ?g ?h ?t ?  ?( ?C ?) ?  ?2 ?0 ?0 ?6 ?  ?Y ?o ?u ?r ?  ?N ?a ?m ?e ?. return ?/ ?/ ?  ?L ?i ?c ?e ?n ?s ?e ?d ?  ?u ?n ?d ?e ?r ?  ?t ?h ?e ?  ?G ?N ?U ?\S-  ?G ?P ?L ?\S-  ?V ?e ?r ?s ?i ?o ?n ?  ?2 ?. return ?/ ?/ return ?/ ?/ ?  ?F ?i ?r ?s ?t ?  ?a ?d ?d ?e ?d ?: ?  ?  ?2 ?0 ?0 ?6 ?- ?0 ?1 ?- ?0 ?1 return ?/ ?/ ?  ?L ?a ?s ?t ?  ?c ?h ?a ?n ?g ?e ?d ?: ?  ?2 ?0 ?0 ?6 ?- ?0 ?1 ?- ?0 ?1 return return ?# ?i ?n ?c ?l ?u ?d ?e ?  ?< ?d ?o ?l ?f ?i ?n ?/ ?F ?o ?o ?. ?h ?> return return ?u ?s ?i ?n ?g ?  ?n ?a ?m ?e ?s ?p ?a ?c ?e ?  ?d ?o ?l ?f ?i ?n ?\; return return ?/ ?/ ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- return ?F ?o ?o ?: ?: ?F ?o ?o ?( ?) return ?{ return ?  ?  ?/ ?/ ?  ?D ?o ?  ?n ?o ?t ?h ?i ?n ?g return ?} return ?/ ?/ ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- return ?F ?o ?o ?: ?: ?~ ?F ?o ?o ?( ?) return ?{ return ?  ?  ?/ ?/ ?  ?D ?o ?  ?n ?o ?t ?h ?i ?n ?g return ?} return ?/ ?/ ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- ?- return ?\M-x ?e ?n ?d tab ?k tab])
+
+;; Update time stamp for DOLFIN source code
+(setq
+  time-stamp-start "Last changed:\\\\? "; start of pattern
+  time-stamp-end "\\\\?\n"              ; end of pattern
+  time-stamp-active t                   ; do enable time-stamps
+  time-stamp-line-limit 20              ; check first 20 lines
+  time-stamp-format "%04y-%02m-%02d")   ; date format
+
+;; Update timestamp before saving
+(add-hook 'before-save-hook 'time-stamp)
+
+;; Remove trailing whitespaces before saving
+(add-hook 'before-save-hook 'delete-trailing-whitespace)
diff --git a/utils/gid/DOLFIN.bas b/utils/gid/DOLFIN.bas
new file mode 100644
index 0000000..138b6d9
--- /dev/null
+++ b/utils/gid/DOLFIN.bas
@@ -0,0 +1,17 @@
+*#FILE_EXTENSION .xml
+*realformat "%-f"
+<?xml version="1.0"?>
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <mesh celltype="tetrahedron" dim="3">
+    <vertices size="*npoin">
+*loop nodes
+      <vertex index="*operation(nodesnum-1)" x="*nodescoord(1)" y="*nodescoord(2)" z="*nodescoord(3)"/>
+*end nodes
+    </vertices>
+    <cells size="*nelem">
+*loop elems
+      <tetrahedron index="*operation(elemsnum-1)" v0="*operation(elemsconec(1)-1)" v1="*operation(elemsconec(2)-1)" v2="*operation(elemsconec(3)-1)" v3="*operation(elemsconec(4)-1)" />
+*end elems
+    </cells>
+  </mesh>
+</dolfin>
diff --git a/utils/matlab/meshindex.m b/utils/matlab/meshindex.m
new file mode 100644
index 0000000..20af389
--- /dev/null
+++ b/utils/matlab/meshindex.m
@@ -0,0 +1,54 @@
+function index = meshindex(p, t)
+
+% MESHINDEX - COMPUTE APPROXIMATE MULTI-ADAPTIVE EFFICIENCY INDEX FOR MESH
+%
+% Usage: index = meshindex(p, t)
+%
+%   p - points    (exported from PDE Toolbox)
+%   t - triangles (exported from PDE Toolbox)
+%	
+% Copyright (C) 2005 Anders Logg
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+
+hmin = 1.0;
+hlist = hmin*ones(size(p, 2), 1);
+
+for triangle = t
+
+  i0 = triangle(1);
+  i1 = triangle(2);
+  i2 = triangle(3);
+
+  p0 = p(:, i0);
+  p1 = p(:, i1);
+  p2 = p(:, i2);
+
+  h0 = norm(p1 - p0);
+  h1 = norm(p2 - p1);
+  h2 = norm(p0 - p2);
+
+  h = min([h0, h1, h2]);
+
+  hlist(i0) = min(hlist(i0), h);
+  hlist(i1) = min(hlist(i1), h);
+  hlist(i2) = min(hlist(i2), h);
+
+  hmin = min(h, hmin);
+
+end
+
+index = (length(hlist) / hmin) / sum(1.0 ./ hlist);
diff --git a/utils/matlab/plotcontroller.m b/utils/matlab/plotcontroller.m
new file mode 100644
index 0000000..aa7a2dc
--- /dev/null
+++ b/utils/matlab/plotcontroller.m
@@ -0,0 +1,35 @@
+% Copyright (C) 2005 Anders Logg
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+% 
+% Simple script for evaluating the performance of
+% different time step controllers.
+
+clf
+
+subplot(2,1,1)
+plot(t, k)
+
+subplot(2,1,2)
+e = k.*abs(r);
+semilogy(t, e);
+hold on
+plot(t, 2.0*tol*ones(size(t)))
+plot(t, 1.0*tol*ones(size(t)))
+plot(t, 0.5*tol*ones(size(t)))
+grid on
+xlabel('t')
+ylabel('e')
diff --git a/utils/matlab/plotslab.m b/utils/matlab/plotslab.m
new file mode 100644
index 0000000..7d7d4e2
--- /dev/null
+++ b/utils/matlab/plotslab.m
@@ -0,0 +1,173 @@
+% Copyright (C) 2003-2005 Anders Logg
+% Copyright (C) 2003 Johan Hoffman
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+%
+% First added:  2003-11-07
+% Last changed: 2005
+
+function M = plotslab(debugfile, interval, drawupdates, drawtext, saveps, savepng)
+
+% Usage: M = plotslab(debugfile, interval, drawupdates, drawtext, saveps, savepng)
+%
+% Draws and creates a movie M of a time slab. A debug file
+% is created by DOLFIN when the option 'debug time steps'
+% is specified.
+%
+% Arguments:
+%
+%   debugfile   - name of file containing time stepping data
+%   interval    - plot elements within interval
+%   drawupdates - blink element updates
+%   drawtext    - draw extra text
+%   saveps      - save a postscript file for each frame
+%   savepng     - save a png file for each frame
+
+% Load the steps
+disp('Loading file...')
+timesteps = load(debugfile);
+
+% Get the number of components
+N  = max(timesteps(:,2)) + 1;
+
+% Get the time interval
+T1 = interval(1);
+T2 = interval(2);
+
+% Create figure
+clf
+axis([T1 T2 -0.3*N 1.2*N])
+axis off
+hold on
+if drawtext
+  h1 = text(T1,1.1*N,'Action:');
+  h2 = text(T1,-0.1*N,['t = ' num2str(T1)]);
+  h3 = text(T1,-0.15*N,['i = ' num2str(0)]);
+end
+plot([T1 T2],[0 0],'k');
+framecount = 1;
+iterations = 0;
+
+% Clear the movie
+clear M
+
+% Step to the correct position
+for i = 1:size(timesteps,1)
+
+  a  = timesteps(i,1);
+  n  = timesteps(i,2);
+  t1 = timesteps(i,3);
+  t2 = timesteps(i,4); 
+
+  if t2 >= T1
+    break;
+  end
+
+end
+
+% Draw the elements
+for j = i:size(timesteps, 1)
+
+  % Get next element
+  a  = timesteps(j,1);
+  n  = timesteps(j,2);
+  t1 = timesteps(j,3);
+  t2 = timesteps(j,4);
+
+  % Go to next element if we don't want to draw updates
+  if ~drawupdates & a == 1
+    continue
+  end
+  
+  % Check if we have finished
+  if t1 > T2
+    break
+  end
+
+  % Check action
+  switch a
+    case 0
+      
+      % Draw a new box
+      %c = [128 156 178]/256;
+      c = 'b';
+      drawbox([t1 n], [t2 (n+1)], c);
+
+      % Draw text
+      if ( drawtext )
+	set(h1, 'String', 'Action: Creating new element')
+	set(h2, 'String', ['t = ' num2str(t1)])
+	set(h3, 'String', ['i = ' num2str(n)])
+      end
+
+    case 1
+
+      % Blink box
+      %c = [0 98 178]/256;
+      c = 'r';
+      cc = [250 130 180]/256;
+      drawbox([t1 n], [t2 (n+1)], c);
+
+      % Draw text
+      if ( drawtext )
+	set(h1, 'String', 'Action: Updating element')
+	set(h2, 'String', ['t = ' num2str(t1)])
+	set(h3, 'String', ['i = ' num2str(n)])
+      end
+      
+      % Save frame
+      drawnow
+      M(framecount) = getframe;
+      if saveps
+	print('-depsc', ['frame_' sprintf('%.4d', framecount) '.eps'])
+      elseif savepng
+	print('-dpng', '-r0', ['frame_' sprintf('%.4d', framecount) '.png'])
+      else
+	disp('Press any key to continue')
+	pause
+      end		  
+      framecount = framecount + 1;
+
+      % Restore box
+      %c = [128 156 178]/256;
+      c = 'b';
+      drawbox([t1 n], [t2 (n+1)], c);
+
+  end  
+  
+  % Save frame
+  drawnow
+  M(framecount) = getframe;
+  if saveps
+    print('-depsc', ['frame_' sprintf('%.4d', framecount) '.eps'])
+  elseif savepng
+    print('-dpng', '-r0', ['frame_' sprintf('%.4d', framecount) '.png'])
+  else
+    disp('Press any key to continue')
+    pause
+  end		  
+  framecount = framecount + 1;
+  
+end
+
+function drawbox(x, y, c)
+
+% This function draws a box from x to y with color c
+
+x1 = [x(1) y(1) y(1) x(1)];
+x2 = [x(2) x(2) y(2) y(2)];
+
+fill(x1, x2, c)
diff --git a/utils/matlab/xmlmatrix.m b/utils/matlab/xmlmatrix.m
new file mode 100644
index 0000000..1a1ce45
--- /dev/null
+++ b/utils/matlab/xmlmatrix.m
@@ -0,0 +1,72 @@
+function xmlmatrix(filename, A)
+
+% XMLMATRIX - SAVE MATRIX TO DOLFIN IN XML FORMAT
+%
+% Usage: xmlmatrix(filename, A)
+%
+%   A - a matrix
+%
+% Copyright (C) 2004 Georgios Foufas
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+%
+% Modified by Anders Logg 2004-2005.
+%
+% First added:  2004-02-10
+% Last changed: 2005
+
+% Tolerance for sparse matrix
+tol = 1e-16;
+
+% Open file
+fp = fopen(filename,'w');
+
+%Get matrix size
+nrows = size(A,1);
+ncols = size(A,2);
+
+% Write header
+fprintf(fp,'<?xml version="1.0" encoding="UTF-8"?>\n\n');
+fprintf(fp,'<dolfin xmlns:dolfin="http://www.phi.chalmers.se/dolfin/">\n');
+
+% Write matrix values
+disp('Writing matrix...')
+fprintf(fp,'  <sparsematrix rows="%d" columns="%d">\n',nrows,ncols);  
+
+for i=1:nrows
+  
+  % Compute size of row
+  size = round(length(find(abs(A(i,:)) > tol)));
+  
+  fprintf(fp,'    <row row="%d" size="%d"/>\n', i-1, size);
+  
+  for j=1:ncols
+    element = A(i,j);
+    if abs(element) > tol
+      fprintf(fp,'      <element column="%d" value="%f"/>\n', j-1, A(i,j));
+    end
+  end
+  
+  fprintf(fp,'    </row>\n');
+
+end
+
+fprintf(fp,'  </sparsematrix>\n');
+fprintf(fp,'</dolfin>\n');  
+
+% Close file
+fclose(fp);
+disp('Done')
diff --git a/utils/matlab/xmlmesh.m b/utils/matlab/xmlmesh.m
new file mode 100644
index 0000000..c6ae134
--- /dev/null
+++ b/utils/matlab/xmlmesh.m
@@ -0,0 +1,97 @@
+function xmlmesh(filename, p, t)
+
+% XMLMESH - SAVE MATLAB 2D (AND FEMLAB 3D) MESH TO DOLFIN XML FORMAT
+%
+% Usage: xmlmesh(filename,p,t)
+%
+%   p - points    (exported from PDE Toolbox)
+%   t - triangles (exported from PDE Toolbox)
+%
+% Copyright (C) 2004 Erik Svensson
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+%
+% Modified by Anders Logg 2004-2005.
+% Modified by Marie Rognes 2009.
+%
+% First added:  2004-02-10
+% Last changed: 2009-11-18
+
+% Open file
+fp = fopen(filename, 'w');
+disp('Exporting mesh to DOLFIN XML format')
+
+% Get number of points and triangles
+np = size(p, 2);
+nt = size(t, 2);
+
+% Write header
+fprintf(fp,'<?xml version="1.0" encoding="UTF-8"?>\n\n');
+fprintf(fp,'<dolfin xmlns:dolfin="http://www.fenics.org/dolfin">\n');
+
+% 2D mesh
+if (size(p, 1) == 2)
+
+  % Write nodes
+  fprintf(fp,'  <mesh celltype="triangle" dim="2">\n');
+  disp('Writing vertices...')
+  fprintf(fp,'    <vertices size="%d">\n',np);
+  for n=1:np
+    fprintf(fp,'      <vertex index="%d" x="%f" y="%f" z="0.0"/>\n', ...
+	    n - 1, p(1, n), p(2, n));
+  end
+  fprintf(fp,'    </vertices>\n');
+
+  % Write cells
+  disp('Writing cells...')
+  fprintf(fp,'    <cells size="%d">\n',nt);
+  for n=1:nt
+    fprintf(fp,'      <triangle index="%d" v0="%d" v1="%d" v2="%d"/>\n', ...
+	    n - 1, t(1, n) - 1, t(2, n) - 1, t(3, n) - 1);
+  end
+  fprintf(fp,'    </cells>\n');
+  fprintf(fp,'  </mesh>\n');
+  fprintf(fp,'</dolfin>\n');
+
+% 3D mesh
+elseif (size(p, 1) == 3)
+
+  % Write nodes
+  disp('Writing nodes...')
+  fprintf(fp,'  <mesh>\n');
+  fprintf(fp,'    <vertices size="%d">\n',np);
+  for n=1:np
+    fprintf(fp,'      <vertex name="%d" x="%f" y="%f" z="%f"/>\n', ...
+            n - 1, p(1, n), p(2, n), p(3, n));
+  end
+  fprintf(fp,'    </vertices>\n');
+
+  % Write cells
+  disp('Writing cells...')
+  fprintf(fp,'    <cells size="%d">\n',nt);
+  for n=1:nt
+    fprintf(fp,'      <tetrahedron name="%d" n0="%d" n1="%d" n2="%d" n3="%d"/>\n', ...
+            n-1, t (1, n) - 1, t(2, n) - 1, t(3, n) - 1, t(4, n) - 1);
+  end
+  fprintf(fp,'    </cells>\n');
+  fprintf(fp,'  </mesh>\n');
+  fprintf(fp,'</dolfin>\n');
+
+end
+
+% Close file
+fclose(fp);
+disp('Done')
diff --git a/utils/matlab/xmlvector.m b/utils/matlab/xmlvector.m
new file mode 100644
index 0000000..435cdea
--- /dev/null
+++ b/utils/matlab/xmlvector.m
@@ -0,0 +1,58 @@
+function xmlvector(filename, x)
+
+% XMLVECTOR - SAVE VECTOR TO DOLFIN IN XML FORMAT
+%
+% Usage: xmlvector(filename, x)
+%
+%   x - a vector
+%
+% Copyright (C) 2004 Georgios Foufas
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+%
+% Modified by Anders Logg 2004-2005.
+%
+% First added:  2004-02-10
+% Last changed: 2005
+
+
+% Open file
+fp = fopen(filename,'w');
+
+% Row or column  vector??
+ssize = size(x,1);
+if(ssize == 1)
+  ssize = size(x,2);
+end
+
+% Write header
+fprintf(fp,'<?xml version="1.0" encoding="UTF-8"?>\n\n');
+fprintf(fp,'<dolfin xmlns:dolfin="http://www.phi.chalmers.se/dolfin/">\n');
+
+% Write vector values
+disp('Writing vector...')
+fprintf(fp,'  <vector size="%d">\n',ssize);  
+
+for n = 1:ssize
+  fprintf(fp,'    <element row="%d" value="%f"/>\n', n-1, x(n));
+end
+
+fprintf(fp,'  </vector>\n');
+fprintf(fp,'</dolfin>\n');  
+ 
+% Close file
+fclose(fp);
+disp('Done')
diff --git a/utils/octave/README b/utils/octave/README
new file mode 100644
index 0000000..8891bdb
--- /dev/null
+++ b/utils/octave/README
@@ -0,0 +1,28 @@
+Notes about the pdeplot, pdesurf and pdemesh Octave functions:
+
+These functions are Free Software reimplementations of the corresponding
+functions in Matlab's PDE Toolbox.
+
+They require the external program "ivview" included in the open source
+Open Inventor distribution which can be obtained from
+
+	http://oss.sgi.com/projects/inventor/.
+
+Open Inventor also exists in the package system of some Linux
+distributions, such as Debian (the package inventor-clients).
+
+They have been verified to work in Octave 2.1.50.
+
+Example usage:
+
+> pdemesh(points, edges, cells)
+> pdesurf(points, cells, u)
+
+Bugs and comments on features:
+
+The functions use the "popen2" call in Octave to communicate with
+"ivview", and this does not always work correctly, "ivview" can
+sometimes hang. This is presumably an Octave bug.
+
+The pdeplot function is a far from complete reimplementation of the 
+Matlab pdeplot.
diff --git a/utils/octave/pdemesh.m b/utils/octave/pdemesh.m
new file mode 100644
index 0000000..ad294ff
--- /dev/null
+++ b/utils/octave/pdemesh.m
@@ -0,0 +1,29 @@
+function h = pdemesh(p, e, t, u)
+
+% Plots the mesh described by p, e, t (points, edges, triangles).
+%
+% Copyright (C) 2004-2005 Johan Jansson
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+%
+% First added:  2004-01-23
+% Last changed: 2005
+
+if(nargin == 3)
+  u = zeros(size(p, 2), 1);
+end
+
+pdeplot(p, [], t, 'xydata', u)
diff --git a/utils/octave/pdeplot.m b/utils/octave/pdeplot.m
new file mode 100644
index 0000000..2ededfc
--- /dev/null
+++ b/utils/octave/pdeplot.m
@@ -0,0 +1,230 @@
+function h = pdeplot(p, e, t, p1, u)
+
+% Plots the scalar solution u on the mesh described by p, e, t (points, edges,
+% triangles).
+%
+% Copyright (C) 2004-2005 Johan Jansson
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+%
+% First added:  2004-01-23
+% Last changed: 2005
+
+%u = v1;
+
+color1 = [0.0 1.0 0.0];
+color2 = [1.0 0.0 0.0];
+
+%Compute some useful information about the geometry
+
+pmax = max(p');
+pmin = min(p');
+
+umin = min(u);
+umax = max(u);
+
+urange = umax - umin;
+
+if(urange == 0)
+  urange = 1;
+end
+
+
+%offset = max([umax / 100 1e-3]);
+offset = urange / 100;
+%  offset
+
+%  center = [(max(p(1, :)) + min(p(1, :))) / 2
+%	    (max(p(2, :)) + min(p(2, :))) / 2]; 
+%  centeru = (max(u) + min(u)) / 2;
+
+center = (pmax + pmin) / 2;
+centeru = (umax + umin) / 2;
+
+%Assume that u is xydata
+  
+fname = tempname;
+%[fd, fdout, pid] = popen2('ivview', 'w');
+[fd, fdout, pid] = popen2('ivview', '');
+%[fd, fdout, pid] = popen2('SceneViewer -', '');
+%fd = fopen(fname, 'w');
+  
+fprintf(fd, '#Inventor V2.1 ascii\n\n');
+
+fprintf(fd, 'Separator\n');
+fprintf(fd, '{\n');
+
+fprintf(fd, ' OrthographicCamera\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  position %f %f %f\n', 0, 0, 5);
+fprintf(fd, '  focalDistance %f\n', 5);
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' ShapeHints\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  creaseAngle 1.5\n');
+fprintf(fd, '  vertexOrdering COUNTERCLOCKWISE\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' Scale\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  scaleFactor %f %f %f\n', 1.5 / (2 * center(1)), 1.5 / (2 * center(2)), 1 / (urange));
+
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' Translation\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  translation %f %f %f\n', -center(1), -center(2), -centeru);
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' LightModel\n');
+fprintf(fd, ' {\n');
+%  fprintf(fd, ' model PHONG\n');
+fprintf(fd, '  model BASE_COLOR\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, 'Separator\n');
+fprintf(fd, '{\n');
+fprintf(fd, ' Font\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  size 20\n');
+fprintf(fd, ' }\n');
+fprintf(fd, ' Translation\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  translation 0.0 1.05 0\n');
+fprintf(fd, ' }\n');
+fprintf(fd, ' Text2\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  string \"Title\"\n');
+fprintf(fd, ' }\n');
+fprintf(fd, '}\n');
+
+fprintf(fd, ' Material\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  ambientColor 0.5 0.5 0.5\n');
+fprintf(fd, '  specularColor 0.8 0.8 0.8\n');
+fprintf(fd, '  diffuseColor\n');
+fprintf(fd, '  [\n');
+  
+for i = 1:size(u, 1)
+  value = (u(i) - umin) / urange;
+  color = (1 - value) * color1 + value * color2;
+  %color
+  
+  if(i < size(u, 1))
+    fprintf(fd, '   %f %f %f,\n', color(1), color(2), color(3));
+  else
+    fprintf(fd, '   %f %f %f\n', color(1), color(2), color(3));
+  end
+end
+
+fprintf(fd, '  ]\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' MaterialBinding\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  value PER_VERTEX_INDEXED\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' Coordinate3\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  point\n');
+fprintf(fd, '  [\n');
+	  
+for i = 1:size(p, 2)
+  if(i < size(p, 2))
+    fprintf(fd, '   %f %f %f,\n', p(1, i), p(2, i), u(i));
+  else
+    fprintf(fd, '   %f %f %f\n', p(1, i), p(2, i), u(i));
+  end
+end
+
+fprintf(fd, '  ]\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' IndexedFaceSet\n');
+fprintf(fd, ' {\n');
+
+fprintf(fd, '  coordIndex\n');
+fprintf(fd, '  [\n');
+  
+for i = 1:size(t, 2)
+  if(i < size(t, 2))
+    fprintf(fd, '   %d, %d, %d, -1,\n', t(1, i) - 1, t(2, i) - 1, t(3, i) - 1);
+  else
+    fprintf(fd, '   %d, %d, %d, -1\n', t(1, i) - 1, t(2, i) - 1, t(3, i) - 1);
+  end
+end
+
+fprintf(fd, '  ]\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' Material\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  diffuseColor    0.1 0.1 0.1\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' MaterialBinding\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  value OVERALL\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' Coordinate3\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  point\n');
+fprintf(fd, '  [\n');
+  
+for i = 1:size(p, 2)
+  if(i < size(p, 2))
+    fprintf(fd, '   %f %f %f,\n', p(1, i), p(2, i), u(i) + offset);
+  else
+    fprintf(fd, '   %f %f %f\n', p(1, i), p(2, i), u(i) + offset);
+  end
+end
+
+fprintf(fd, '  ]\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, ' IndexedLineSet\n');
+fprintf(fd, ' {\n');
+fprintf(fd, '  coordIndex\n');
+fprintf(fd, '  [\n');
+  
+for i = 1:size(t, 2)
+  if(i < size(t, 2))
+    fprintf(fd, '   %d, %d, -1,\n', t(1, i) - 1, t(2, i) - 1);
+    fprintf(fd, '   %d, %d, -1,\n', t(2, i) - 1, t(3, i) - 1);
+    fprintf(fd, '   %d, %d, -1,\n', t(3, i) - 1, t(1, i) - 1);
+  else
+    fprintf(fd, '   %d, %d, -1,\n', t(1, i) - 1, t(2, i) - 1);
+    fprintf(fd, '   %d, %d, -1,\n', t(2, i) - 1, t(3, i) - 1);
+    fprintf(fd, '   %d, %d, -1\n', t(3, i) - 1, t(1, i) - 1);
+  end
+end
+
+fprintf(fd, '  ]\n');
+fprintf(fd, ' }\n');
+
+fprintf(fd, '}\n');
+
+fclose(fd);
+
+%cmd = sprintf('SceneViewer %s', fname);
+%system(cmd, 1, 'async');
+
+%sleep(1);
+
+%unlink(fname);
diff --git a/utils/octave/pdesurf.m b/utils/octave/pdesurf.m
new file mode 100644
index 0000000..b7f6585
--- /dev/null
+++ b/utils/octave/pdesurf.m
@@ -0,0 +1,26 @@
+function h = pdesurf(p, t, u)
+
+% Plots the scalar solution u on the mesh described by p, t (points,
+% triangles).							    
+%
+% Copyright (C) 2004-2005 Johan Jansson
+%
+% This file is part of DOLFIN.
+%
+% DOLFIN is free software: you can redistribute it and/or modify
+% it under the terms of the GNU Lesser General Public License as published by
+% the Free Software Foundation, either version 3 of the License, or
+% (at your option) any later version.
+%
+% DOLFIN 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 Lesser General Public License for more details.
+%
+% You should have received a copy of the GNU Lesser General Public License
+% along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+%
+% First added:  2004-01-23
+% Last changed: 2005
+
+pdeplot(p, [], t, 'xydata', u)
diff --git a/utils/python/README b/utils/python/README
new file mode 100644
index 0000000..e8de05f
--- /dev/null
+++ b/utils/python/README
@@ -0,0 +1,2 @@
+Place for random Python utilities that we may or may not want to include
+as part of the official DOLFIN Python interface.
diff --git a/utils/python/extract2d b/utils/python/extract2d
new file mode 100755
index 0000000..288afb4
--- /dev/null
+++ b/utils/python/extract2d
@@ -0,0 +1,88 @@
+#!/usr/bin/env python
+#
+# Extract two-dimensional DOLFIN mesh from three-dimensional DOLFIN mesh.
+#
+# Usage: extract2d mesh.xml
+#
+# Copyright (C) 2008 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2007-09-02
+# Last changed: 2008-09-12
+
+import sys
+
+if not len(sys.argv) == 2:
+    print "Usage: extract2D mesh.xml"
+    sys.exit(1)
+
+from dolfin import *
+
+# Read mesh
+filename = sys.argv[1]
+mesh = Mesh(filename)
+
+# Check geometry
+if not mesh.geometry().dim() == 3:
+    print "Not a 3D mesh"
+    sys.exit(1)
+
+# Create boundary mesh
+boundary = BoundaryMesh(mesh)
+
+# Extract cells and vertices on the boundary
+eps = 1e-12
+cells = []
+coordinates = boundary.coordinates()
+vertex_map = {}
+vertex_coordinates = []
+k = 0
+for cell in boundary.cells():
+    xs = coordinates[cell]
+    if all([x[2] < eps for x in xs]):
+        cells.append(cell)
+        for vertex in cell:
+            if not vertex in vertex_map:
+                vertex_map[vertex] = k
+                vertex_coordinates.append(coordinates[vertex])
+                k += 1
+
+# Write mesh
+file = open(filename.split(".")[0] + "-2d.xml", "w")
+file.write("""\
+<?xml version="1.0" encoding="UTF-8"?>
+
+<dolfin xmlns:dolfin="http://fenicsproject.org">
+  <mesh celltype="triangle" dim="2">
+    <vertices size="%d">
+""" % len(vertex_map))
+for i in range(len(vertex_map)):
+    x = vertex_coordinates[i]
+    file.write('      <vertex index="%d" x="%.16e" y="%.16e"/>\n' % (i, x[0], x[1]))
+file.write("""\
+    </vertices>
+    <cells size="%d">
+""" % len(cells))
+for i in range(len(cells)):
+    v = [vertex_map[v] for v in cells[i]]
+    file.write('      <triangle index="%d" v0="%d" v1="%d" v2="%d"/>\n' % (i, v[0], v[1], v[2]))
+file.write("""
+    </cells>
+  </mesh>
+</dolfin>
+""")
+file.close()
diff --git a/utils/scripts/broken b/utils/scripts/broken
new file mode 100755
index 0000000..2d9fbda
--- /dev/null
+++ b/utils/scripts/broken
@@ -0,0 +1,6 @@
+#!/bin/sh
+
+# Find all BROKENs in the code 
+
+find . -name '*.h' | xargs grep BROKEN
+find . -name '*.cpp' | xargs grep BROKEN
diff --git a/utils/scripts/code-formatting b/utils/scripts/code-formatting
new file mode 100755
index 0000000..595309a
--- /dev/null
+++ b/utils/scripts/code-formatting
@@ -0,0 +1,198 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Check and fix coding style in all files (currently very limited)
+#
+# Modified by Chris Richardson, 2013
+#
+# Last changed: 2013-05-10
+#
+
+import os, sys, re, getopt
+
+# Camelcaps exceptions
+camelcaps_exceptions = ["cGq", "dGq",                                                         # ODE solver
+                        "addListener", "addTest", "getRegistry", "makeTest", "wasSuccessful", # cppunit
+                        "tagName", "tagNames", "documentElement", "childNodes",               # doscstrings
+                        "nodeType", "firstChild", "parentNode",                               # docstrings
+                        "doubleArray", "intArray",                                            # swig 
+                        "fatalError", "xmlChar", "xmlNode", "xmlStrcasecmp",                  # libxml2
+                        "startDocument", "endDocument", "startElement", "endElement"]         # libxml2
+
+
+def camelcaps2underscore(word):
+    "Convert fooBar to foo_bar."
+    new_word = ""
+    for c in word:
+        if c.isupper() and len(new_word) > 0:
+            new_word += "_" + c.lower()
+        else:
+            new_word += c
+    return new_word
+
+def check_camelcaps(code):
+    "Check for fooBar (should be foo_bar)"
+    problems=[]
+    for i,line in enumerate(code.split("\n")):
+        if(re.search(r"//",line)):
+            continue
+        words = re.findall(r"\b([a-z]+[A-Z][a-z]+)\b", line)
+        for word in words:
+            if word in camelcaps_exceptions:
+                continue
+            if re.match("vtk",word):
+                continue
+            problems.append("[camelCaps          ] Line %d: %s"%(i+1,line))
+    return code, problems
+
+def check_trailing_whitespace(code):
+    "Remove trailing spaces at end of lines."
+    problems = []
+    lines = []
+    for i,line in enumerate(code.split("\n")):
+        new_line = line.rstrip()
+        lines.append(new_line)
+        if new_line == line:
+            continue
+        problems.append("[trailing whitespace] Line %d: %s"%(i+1,line.replace(" ","_").replace("\r","^M")))
+    new_code = "\n".join(lines)
+    if len(new_code) > 0 and not new_code[-1] == "\n":
+        new_code += "\n"
+    return new_code, problems
+
+def check_tabs(code):
+    "Check for TAB character"
+    problems = []
+    lines =[]
+    for i,line in enumerate(code.split("\n")):
+        if(re.search("\t",line)):
+            problems.append("[tab                ] Line %d: %s"%(i+1,line.replace("\t",r"\t      ")))
+            lines.append(re.sub("\t","        ",line))
+        else:
+            lines.append(line)
+
+    new_code = "\n".join(lines)
+    if len(new_code) > 0 and not new_code[-1] == "\n":
+        new_code += "\n"
+    return new_code, problems
+
+def check_symbol_spacing(code):
+    "Add spaces around +,-,= etc."
+    problems = []
+    for i,line in enumerate(code.split("\n")):
+        if(re.search(r"//",line)):
+            continue
+        words = re.findall(r"\b[=|+|-|==]\b", line)
+        if(len(words)>0):
+            problems.append("[symbol spacing     ] Line %d: %s"%(i,line))
+        words = re.findall(r"\b,\b", line)
+        if(len(words)>0):
+            problems.append("[comma spacing      ] Line %d: %s"%(i,line))
+    return code, problems
+
+def part_of_dolfin(code):
+    "Look for DOLFIN in file"
+    if re.search("DOLFIN",code):
+        return True
+    else:
+        return False
+
+def detect_bad_formatting(filename, opts):
+    """Detect where code formatting appears to be wrong.
+    opts Flags:
+    -c for checking camelCaps
+    -w for checking whitespace
+    -s for checking symbol spacing, i.e. =, +, - etc.
+    -wf to fix whitespace errors
+    """
+
+    # Open file
+    f = open(filename, "r")
+    code = f.read()
+    f.close()
+    
+    if(not part_of_dolfin(code)):
+        problems = ['[part of dolfin     ] Does not contain "DOLFIN" - skipping']
+    else:
+        # Checks
+        problems = []
+        if("-c" in opts):
+            code, p = check_camelcaps(code)
+            problems.extend(p)
+        if("-w" in opts):
+            code, p1 = check_trailing_whitespace(code)
+            problems.extend(p1)
+            code, p2 = check_tabs(code)
+            problems.extend(p2)
+            # Rewrite corrected file (only corrects whitespace errors)
+            if("-f" in opts and (len(p1)!=0 or len(p2)!=0)):
+                problems.append('Rewriting file %s'%filename)
+                f = open(filename, "w")
+                f.write(code)
+                f.close()
+        if("-s" in opts):
+            code, p = check_symbol_spacing(code)
+            problems.extend(p)
+
+    if(len(problems) != 0):
+        print "================================================================================"
+        print filename
+        print "================================================================================"
+        for p in problems:
+            print p
+
+
+def usage(name):
+    print
+    print name," [-c|-w|-s|-f] path"
+    print "\n Check formatting of code in the folders and subfolders of path\n"
+    print " -c check camelCaps"
+    print " -w check white space and tabs"
+    print " -s check symbol spacing"
+    print " -wf fix whitespace errors"
+    print " default: check all"
+
+if __name__ == "__main__":
+    try:
+        opts, args = getopt.getopt(sys.argv[1:], "cwsf")
+    except getopt.GetoptError as err:
+        print str(err) # will print something like "option -a not recognized"
+        usage(sys.argv[0])
+        sys.exit(0)
+
+    if(len(args)==0):
+        usage(sys.argv[0])
+        sys.exit(0)
+    filepath = args[0]
+
+    options=[]
+    for opt, arg in opts:
+        options.append(opt)
+
+    if len(options)==0:
+        options=['-c','-w','-s']
+
+    # Iterate over all source files
+    for root, dirs, files in os.walk(filepath):
+        for file in files:
+            if not file.endswith((".cpp", ".h", ".py", ".i")):
+                continue
+            filename = os.path.join(root, file)
+            detect_bad_formatting(filename, options)
+
diff --git a/utils/scripts/dolfinreplace b/utils/scripts/dolfinreplace
new file mode 100755
index 0000000..ea7b998
--- /dev/null
+++ b/utils/scripts/dolfinreplace
@@ -0,0 +1,141 @@
+#!/usr/bin/python
+#
+# Replace string in dolfin files
+#
+#     dolfinreplace s0 s1 [-sv]
+#
+# Example:
+#
+#     dolfinreplace foo bar
+#
+# Johan Hake, 2008-19-09
+#
+# Modified by Anders Logg 2008, 2014
+
+from os import path
+import glob
+
+# File post fixes to look in
+post_fixes = [".h", ".cpp", ".i", ".tex", ".py", ".rst"]
+
+# Primitive exclusion of some directories
+exclude_patterns = ["build.", "local."]
+
+# Global variables
+count         = 0
+changed_files = 0
+report_lines = []
+dolfin_root   = path.abspath(path.join(path.dirname(path.abspath(__file__)),
+                                       path.pardir, path.pardir))
+
+# Output strings
+post_fix_string = ", ".join( "'%s'"%s for s in post_fixes)
+
+start_str = """Replacing '%s' with '%s' in all %s files..."""
+
+report_str = """
+%d occurences replaced in %d files:
+
+%s
+%s"""
+
+def replace(args, dirname, filenames):
+    """ Replace replaces[0] with replaces[1]
+
+    In all fnames with post fixes in 'post_fixes' replace replaces[0] with replaces[1]
+    """
+    global count, report_lines, changed_files
+    (s0, s1), options = args
+
+    _filenames = filenames[:]
+    for f in _filenames:
+        for exclude in exclude_patterns:
+            if exclude in f:
+                filenames.remove(f)
+
+    for filename in glob.glob(path.join(dirname, options.pattern)):
+        if path.splitext(filename)[1] in post_fixes:
+            fullpath_filename = path.join(dirname,filename)
+            f = open(fullpath_filename, "r")
+            if options.verbose:
+                changed_lines = []
+                lines = f.readlines()
+                num_changed = 0
+                for i, line in enumerate(lines):
+                    num = line.count(s0)
+                    if num>0:
+                        num_changed += num
+                        changed_lines.append(" "*8+line.replace(s0,\
+                                             "\033[4m%s\033[0;0m"%s0).strip())
+                        lines[i] = line.replace(s0, s1)
+                count += num_changed
+                output = "".join(lines)
+            else:
+                input = f.read()
+                num_changed = input.count(s0)
+                count += num_changed
+                output = input.replace(s0, s1)
+
+            f.close()
+
+            if not options.simulate and num_changed > 0:
+                f = open(fullpath_filename, "w")
+                f.write(output)
+                f.close()
+
+            if num_changed > 0:
+                changed_files += 1
+                report_lines.append(" "*4+fullpath_filename)
+                if options.verbose:
+                    report_lines.extend(changed_lines)
+                    report_lines.append("")
+
+def options_parser():
+    import optparse
+    usage ="""Usage: %prog [options] arg1 arg2
+
+Replaces string 'arg1' with 'arg2' in files in the present directory tree.
+
+For options, see dolfinreplace --help."""
+
+    parser = optparse.OptionParser(usage=usage)
+    parser.add_option("-s", "--simulate", help="simulate the replacement",
+                      action="store_true", dest="simulate", default=False)
+    parser.add_option("-p", "--pattern", help="a glob compatible pattern "
+                      "for which files should be looked into. "\
+                      "[default: '%default']", action="store",\
+                      dest="pattern", default="*")
+    parser.add_option("-v", "--verbose", help="verbosely print each line that"\
+                      " includes the searched pattern.", action="store_true", \
+                      dest="verbose", default=False)
+    return parser
+
+def main():
+    parser = options_parser()
+    options, args = parser.parse_args()
+
+    if len(args) != 2:
+        parser.error("incorrect number of arguments")
+
+    s0, s1 = args[0].replace("\\", ""), args[1].replace("\\", "")
+
+    print start_str%(s0,s1,post_fix_string)
+
+    # Do it!
+    path.walk(dolfin_root, replace, ((s0, s1), options))
+    if count > 0:
+        if options.simulate:
+            simulate_str = "\nSimulating, no replacement done..."
+        else:
+            simulate_str = ""
+
+        if report_lines[-1]:
+            report_lines.pop(-1)
+
+        print report_str % (count, changed_files, "\n".\
+                            join(report_lines), simulate_str)
+    else:
+        print "Done\n\nNo occurens of '%s' found"%args[0]
+
+if __name__ == "__main__":
+    main()
diff --git a/utils/scripts/fixme b/utils/scripts/fixme
new file mode 100755
index 0000000..aa0e49c
--- /dev/null
+++ b/utils/scripts/fixme
@@ -0,0 +1,6 @@
+#!/bin/sh
+
+# Find all FIXMEs in the code
+
+find . -name '*.h' | xargs grep FIXME
+find . -name '*.cpp' | xargs grep FIXME
diff --git a/utils/scripts/formatcode b/utils/scripts/formatcode
new file mode 100755
index 0000000..b513796
--- /dev/null
+++ b/utils/scripts/formatcode
@@ -0,0 +1,122 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Check and fix coding style in all files (currently very limited)
+
+import os, sys, re
+
+# Camelcaps exceptions
+camelcaps_exceptions = ["cGq", "dGq",                                                         # ODE solver
+                        "addListener", "addTest", "getRegistry", "makeTest", "wasSuccessful", # cppunit
+                        "tagName", "tagNames", "documentElement", "childNodes",               # doscstrings
+                        "nodeType", "firstChild", "parentNode",                               # docstrings
+                        "doubleArray", "intArray",                                            # swig 
+                        "fatalError", "xmlChar", "xmlNode", "xmlStrcasecmp",                  # libxml2
+                        "startDocument", "endDocument", "startElement", "endElement"]         # libxml2
+
+def camelcaps2underscore(word):
+    "Convert fooBar to foo_bar."
+    new_word = ""
+    for c in word:
+        if c.isupper() and len(new_word) > 0:
+            new_word += "_" + c.lower()
+        else:
+            new_word += c
+    return new_word
+
+def check_camelcaps(code, replacements):
+    "Replace fooBar by foo_bar."
+    words = re.findall(r"\b([a-z]+[A-Z][a-z]+)\b", code)
+    for word in words:
+        if word in camelcaps_exceptions:
+            continue
+        new_word = camelcaps2underscore(word)
+        code = code.replace(word, new_word)
+        r = (word, new_word)
+        if r in replacements:
+            replacements[r] += 1
+        else:
+            replacements[r] = 1
+        print "  Replacing: %s --> %s" % r
+    return code
+
+def check_trailing_whitespace(code, replacements):
+    "Remove trailing spaces at end of lines."
+    lines = []
+    for line in code.split("\n"):
+        new_line = line.rstrip()
+        lines.append(new_line)
+        if new_line == line:
+            continue
+        r = ("trailing whitespace", "")
+        if r in replacements:
+            replacements[r] += 1
+        else:
+            replacements[r] = 1
+        print "  Removing trailing whitespace"
+    new_code = "\n".join(lines)
+    if len(new_code) > 0 and not new_code[-1] == "\n":
+        new_code += "\n"
+    return new_code
+
+def replace(filename, replacements):
+    "Make replacements for given filename."
+
+    print "Checking %s..." % filename
+
+    # Open file
+    f = open(filename, "r")
+    code = f.read()
+    f.close()
+
+    # Checks
+    new_code = check_camelcaps(code, replacements)
+    new_code = check_trailing_whitespace(code, replacements)
+
+    # Write file
+    f = open(filename, "w")
+    f.write(new_code)
+    f.close()
+
+# Iterate over all source files
+replacements = {}
+for root, dirs, files in os.walk("dolfin"):
+    for file in files:
+        if not file.endswith((".cpp", ".h", ".py", ".i")):
+            continue
+        filename = os.path.join(root, file)
+        replace(filename, replacements)
+for root, dirs, files in os.walk("demo"):
+    for file in files:
+        if not file.endswith((".cpp", ".h", ".py")):
+            continue
+        filename = os.path.join(root, file)
+        replace(filename, replacements)
+
+# Report replacements
+if len(replacements) == 0:
+    print "No replacements were made, unchanged."
+else:
+    print ""
+    print "The following replacements were made:"
+    lines = []
+    for r in replacements:
+        lines.append("  %s --> %s (%d occurences)" % (r[0], r[1], replacements[r]))
+    lines.sort()
+    print "\n".join(lines)
diff --git a/utils/scripts/klocs b/utils/scripts/klocs
new file mode 100755
index 0000000..7a286eb
--- /dev/null
+++ b/utils/scripts/klocs
@@ -0,0 +1,17 @@
+#!/bin/sh
+
+# klocs
+#
+# Count the number of kilos of lines of code (klocs)
+# in the directory src.
+#
+# This script should be run from the top level directory.
+                                                                                                    
+IMPL=`find dolfin -name '*.cpp' | xargs wc -l | grep total | awk '{ printf "%d", $1/1000 }'`
+HEAD=`find dolfin -name '*.h'   | grep -v elements | grep -v ffc-forms | xargs wc -l | grep total | awk '{ printf "%d", $1/1000 }'`
+
+TOTAL=`echo $IMPL $HEAD | awk '{ print $1 + $2 }'`
+
+echo $HEAD' klocs in .h files'
+echo $IMPL' klocs in .cpp files'
+echo $TOTAL' klocs total'
diff --git a/utils/scripts/makedoc b/utils/scripts/makedoc
new file mode 100755
index 0000000..e9b0b10
--- /dev/null
+++ b/utils/scripts/makedoc
@@ -0,0 +1,14 @@
+#!/bin/sh
+
+# This script uses doxygen to create documentation.
+
+# Simple test to see where we are
+# FIXME: Does not work when typing ./scripts/...
+CHECK=`echo $0 | cut -d'/' -f1`
+if [ "$CHECK" != "utils" ]; then
+    echo "This script must be run from the top level directory."
+    exit 1
+fi
+
+# Run doxygen
+/usr/bin/doxygen doc/progr_reference/html/Doxyfile
diff --git a/utils/scripts/notinuse b/utils/scripts/notinuse
new file mode 100755
index 0000000..5d6e92c
--- /dev/null
+++ b/utils/scripts/notinuse
@@ -0,0 +1,23 @@
+#!/bin/sh
+
+# notinuse
+#
+# Scan subdirectories for files that may not be in use,
+# that is, old files that should be removed.
+#
+# This script should be run from the top level directory.
+                                                                                                    
+# Simple test to see where we are
+# FIXME: Does not work when typing ./scripts/...
+CHECK=`echo $0 | cut -d'/' -f1`
+if [ "$CHECK" != "scripts" ]; then
+        echo "This script must be run from the top level directory."
+        exit 1
+fi
+
+for f in `find . -name '*.h' -printf '%f '`; do
+	a=`rgrep $f * | grep include`
+	if [ "x$a" == "x" ]; then
+		echo File $f may not be used.
+	fi
+done
diff --git a/utils/scripts/pdebug b/utils/scripts/pdebug
new file mode 100755
index 0000000..cf212c3
--- /dev/null
+++ b/utils/scripts/pdebug
@@ -0,0 +1,7 @@
+#!/bin/bash
+
+echo "Running \"$2\" on $1 processes through gdb debugger."
+env=""
+# Example of how to set the environment, if needed
+#env="source /home/skavhaug/.setups/alt1; source ../../dolfin.conf;"
+mpirun -np $1 -x DISPLAY=:0.0 xterm -e "$env gdb $2"
diff --git a/utils/scripts/plotklocs b/utils/scripts/plotklocs
new file mode 100644
index 0000000..e1cefd1
--- /dev/null
+++ b/utils/scripts/plotklocs
@@ -0,0 +1,88 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2013 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify it
+# under the terms of the GNU Lesser General Public License as
+# published by the Free Software Foundation, either version 3 of the
+# License, or (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2013-02-26
+# Last changed: 2013-02-26
+#
+# Plot growth of code as function of time. This script should be
+# run rom the top level directory.
+
+from commands import getoutput
+from datetime import datetime
+import pylab as pl
+
+# Suffixes to check
+suffixes = [".h", ".hh", ".cpp", ".C"]
+
+# Paths to skip
+skip = ["demo", "bench", "test", "local", "build"]
+
+# Get time stamps
+timestamps = getoutput("bzr log | grep timestamp | awk '{print $3}'")
+t = []
+for timestamp in timestamps.split("\n"):
+    y, m, d = timestamp.split("-")
+    t.append(datetime(int(y), int(m), int(d)))
+t.reverse()
+
+# Revisions to check
+revisions = range(len(t))
+
+# For quick testing
+#revisions = revisions[-10:]
+#t = t[-10:]
+
+# Iterate over revisions
+locs = []
+for i, r in enumerate(revisions):
+
+    print "Updating to revision %r %s" % (r, t[i])
+
+    # Update repository
+    getoutput("bzr update -r %d" % r)
+
+    # Count the lines of code
+    n_total = 0
+    for suffix in suffixes:
+        skips = " | ".join("grep -v %s" % s for s in skip)
+        n = getoutput("""find . -name *%s \
+                  | %s \
+                  | xargs wc -l \
+                  | grep total \
+                  | awk '{print $1}'""" % (suffix, skips))
+        if n.isdigit():
+            n_total += int(n)
+
+    # Store lines of code
+    print "%d lines of code" % n_total
+    locs.append(n_total)
+
+# Store results to file
+f = open("klocs.csv", "w")
+f.write("\n".join("%d-%d-%d,%d" % \
+                      (t[i].year, t[i].month, t[i].day, locs[i]) \
+                      for i in range(len(revisions))))
+f.close()
+
+# Plot results
+pl.plot(t, locs)
+pl.grid(True)
+pl.ylabel("Lines of code")
+pl.title("Code growth for DOLFIN %d - %d" % (t[0].year, t[-1].year))
+pl.show()
diff --git a/utils/swig/dolfin-swig b/utils/swig/dolfin-swig
new file mode 100755
index 0000000..f89c1d3
--- /dev/null
+++ b/utils/swig/dolfin-swig
@@ -0,0 +1,156 @@
+#!/usr/bin/env python
+
+import os, sys
+from dolfin_utils.commands import getoutput
+
+debug = False
+
+# Simple tool to automatically convert a header file (with
+# implementation) including DOLFIN classes or functions to a Python
+# module.
+
+usage = """
+Usage: %s sourcefile [modulename]
+
+Example: dolfin-swig Poisson3D.h poisson3dform
+""" % os.path.basename(sys.argv[0])
+
+if len(sys.argv) < 2:
+    print usage
+
+name = sys.argv[1]
+name = name.rstrip(".h")
+
+if(len(sys.argv) > 2):
+    modulename = sys.argv[2]
+else:
+    lowername = name.lower()
+    modulename = lowername
+
+swigfile = modulename + ".i"
+
+print "Generating the SWIG interface file for the %s module" % name
+
+swigsource = """%%module %s
+
+%%{
+#include <dolfin.h>
+#include <string>
+
+#include \"%s.h\"
+
+using namespace dolfin;
+%%}
+
+%%typemap(python,in) real = double; 
+%%typemap(python,out) real = double; 
+%%typemap(python,in) uint = int; 
+%%typemap(python,out) uint = int; 
+
+// Typemaps for dolfin::real array arguments in virtual methods
+// probably not very safe
+%%typemap(directorin) dolfin::real [] {
+  {
+    // Custom typemap
+    $input = SWIG_NewPointerObj((void *) $1_name, $1_descriptor, $owner);
+  }
+}
+
+%%typemap(directorin) dolfin::real const [] {
+  {
+    // Custom typemap
+    $input = SWIG_NewPointerObj((void *) $1_name, $1_descriptor, $owner);
+  }
+}
+
+%%include \"typemaps.i\"
+%%include \"std_string.i\"
+
+%%include \"carrays.i\"
+
+%%include \"%s.i\"
+
+%%array_functions(dolfin::real, realArray);
+
+%%feature(\"director\") Function;
+%%feature(\"director\") BoundaryCondition;
+%%feature(\"director\") ODE;
+
+%%ignore dolfin::dolfin_set;
+%%ignore dolfin::dolfin_set_aptr;
+
+%%import \"dolfin.h\"
+%%import \"dolfin/constants.h\"
+
+/* function imports */
+
+%%import \"dolfin/Function.h\"
+
+/* fem imports */
+
+%%include \"dolfin/FiniteElementSpec.h\"
+%%include \"dolfin/BoundaryCondition.h\"
+%%include \"dolfin/FiniteElement.h\"
+
+/* form imports */
+
+%%include \"dolfin/Form.h\"
+%%include \"dolfin/BilinearForm.h\"
+%%include \"dolfin/LinearForm.h\"
+
+/* form include */
+
+%%include \"%s.h\"
+""" % (modulename, name, name, name)
+
+swigoutput = open(swigfile, 'w')
+swigoutput.write(swigsource)
+swigoutput.close()
+
+#print "Building the Python module"
+
+debugout = getoutput("swig -python -c++ -nodefault -dirprot `pkg-config --cflags-only-I dolfin` -o %s_wrap.cpp %s" % (modulename, swigfile))
+
+if debug:
+    print debugout
+
+# FIXME: Workaround for apparent bug in SWIG, try to fix the bug.
+
+interfacefile = open("%s_wrap.cpp" % modulename)
+
+tmpfile = open("tmp.cpp", 'w')
+
+stext = "dolfin::%s::dolfin::" % name
+rtext = "dolfin::"
+
+for s in interfacefile.xreadlines():
+    tmpfile.write(s.replace(stext, rtext))
+
+interfacefile.close()
+tmpfile.close()
+
+debugout = getoutput("mv tmp.cpp %s_wrap.cpp" % modulename)
+
+if debug:
+    print debugout
+
+# FIXME:
+# Compilation still not compiler-independent
+
+#print "Compiling generated code"
+
+debugout = getoutput("`pkg-config --variable=compiler dolfin` `pkg-config --variable=swigcflags dolfin` `pkg-config --cflags-only-I dolfin` -I. -g -fPIC  -c -o %s_wrap.o %s_wrap.cpp" % (modulename, modulename))
+
+if debug:
+    print debugout
+
+# FIXME:
+# Generating shared library still not compiler-independent (syntax likely
+# only works for GCC)
+
+#print "Linking generated code"
+
+debugout = getoutput("`pkg-config --variable=compiler dolfin` -g -shared %s_wrap.o -o _%s.so `pkg-config --libs dolfin`" % (modulename, modulename))
+
+if debug:
+    print debugout
diff --git a/utils/system/monitor b/utils/system/monitor
new file mode 100644
index 0000000..936052c
--- /dev/null
+++ b/utils/system/monitor
@@ -0,0 +1,42 @@
+#!/bin/sh
+#
+# Copyright (C) 2005 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# First added:  2005-12-13
+# Last changed: 2005-12-13
+#            
+# Monitor memory usage for given command. This script
+# will probably only work on Linux.
+#
+# Note that this script runs the given command as a new
+# process, so killing the script (ctrl-c) won't kill the
+# running process.
+
+exec $* &
+pid="$!"
+
+echo "Monitoring memory usage for process with id $pid..."
+PIDFILE="/proc/$pid/status"
+while [ 1 ]; do
+    if [ -e $PIDFILE ]; then
+	cat $PIDFILE | grep VmSize | awk '{ print $2/1024" MB"}'
+    else
+	exit 0
+    fi
+    sleep 1
+done
diff --git a/utils/tetgen/dolfin-tetgen b/utils/tetgen/dolfin-tetgen
new file mode 100755
index 0000000..4859791
--- /dev/null
+++ b/utils/tetgen/dolfin-tetgen
@@ -0,0 +1,36 @@
+#!/usr/bin/env python
+#
+# Copyright (C) 2009 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Simple script for mesh STL geometry with TetGen and converting to DOLFIN XML format
+
+import sys, os
+
+# Check command-line arguments
+if len(sys.argv) != 3:
+    print "Usage: dolfin-tetgen mesh.stl mesh.xml"
+    sys.exit(1)
+stl_file = sys.argv[1]
+xml_file = sys.argv[2]
+
+# Run TetGen
+os.system("tetgen -g -p %s" % stl_file)
+
+# Convert to DOLFIN
+mesh_file = stl_file.split(".stl")[0] + ".1" + ".mesh"
+os.system("dolfin-convert %s %s" % (mesh_file, xml_file))
diff --git a/utils/vim/macros b/utils/vim/macros
new file mode 100644
index 0000000..5b3e9d2
--- /dev/null
+++ b/utils/vim/macros
@@ -0,0 +1,6 @@
+set tabstop=2
+set   shiftwidth=2
+map ,ih "%pbd$0"adwp0v$~0"bdwddi// Copyright (C) 2006 :r !echo $USER 
~$a.kJo// Licensed under the GNU LGPL Version 2.1.
//
// First added:  :r !date +'\%F'
kJo// Last changed: :r !date +'\%F'
kJo
#ifndef __FOO_H
#define __FOO_H

#include <dolfin/constants.h>

namespace dolfin
{

/// Documentation of class Foo

class Foo
{
public:

/// Constructor
Foo();

/// Destructor
~Foo();

private:

};

}

#endif:%s/Foo/\=@a/g

:%s/FOO/\=@b/g

+map ,ic "%pbd$0"1dwddi// Copyright (C) 2006 :r !echo $USER 
~$a.kJo// Licensed under the GNU LGPL Version 2.1.
//
// First added:  :r !date +'\%F'
kJo// Last changed: :r !date +'\%F'
kJo
#include <dolfin/Foo.h>

using namespace dolfin;

//-----------------------------------------------------------------------------
Foo::Foo()
{
// Do nothing
}
//-----------------------------------------------------------------------------
Foo::~Foo()
{
// Do nothing
}
//-----------------------------------------------------------------------------:%s/Foo/\=@2/g

+map ,OH :split
:e %<.h
+map ,OC :split
:e %<.cpp
diff --git a/utils/xml/convertall b/utils/xml/convertall
new file mode 100644
index 0000000..44f0049
--- /dev/null
+++ b/utils/xml/convertall
@@ -0,0 +1,40 @@
+#!/bin/sh
+#
+# Copyright (C) 2006 Anders Logg
+#
+# This file is part of DOLFIN.
+#
+# DOLFIN is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# DOLFIN 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 Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
+#
+# Convert all DOLFIN XML files in a directory from
+# the old DOLFIN XML format to the new format
+
+# Unpack all .xml.gz files if any
+for f in *.xml.gz; do
+	echo "Unpacking $f..."
+	gunzip $f
+done
+
+# Convert all .xml files
+for f in *.xml; do
+	echo "Converting $f..."
+	mv $f $f.old
+	dolfin-convert -i xml-old $f.old $f
+done
+
+# Pack all .xml files
+for f in *.xml; do
+	echo "Packing $f..."
+	gzip $f
+done
-- 
2.30.2